From da71b97e7c214db1122ea3b38df7447dba2bb153 Mon Sep 17 00:00:00 2001
From: "Alice (KanishchevYA)" <KanishchevYA@mpei.ru>
Date: Wed, 7 Jun 2023 15:26:37 +0300
Subject: [PATCH] jjj

---
 main.cpp | 103 ++++++++++++++++++++++++++++++++-----------------------
 1 file changed, 60 insertions(+), 43 deletions(-)

diff --git a/main.cpp b/main.cpp
index 4f0b6ac..a6313ce 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,66 +1,83 @@
 #include <iostream>
 #include <vector>
+#include <cmath>
+#include <string>
+#include "histogram.h"
+#include "text.h"
 #include <conio.h>
-
-using namespace std;
+#include "histogram_internal.h"
+#include <curl/curl.h>
+#include <sstream>
+#include "svg.h"
 
 
+using namespace std;
 
+struct Input
+{
+vector<double> numbers;
+size_t bin_count{};
+};
 
-int main()
+Input
+input_data(istream &tin, bool promt)
 {
+Input in;
 size_t number_count;
 
-cerr << "Enter number count: ";              //количество чисел
-cin >> number_count;
-
-vector<double> numbers(number_count);         //векток с числами
+if (promt)
+{
+    cerr << "enter number count";
+}
+tin>> number_count;
 
-for(size_t i=0; i < number_count; i++)       //заполнение вектора
-    cin >> numbers[i];
 
-size_t bin_count;                               //количество корзин
-cerr << "Enter bin count: ";
-cin >> bin_count;
 
-vector<size_t> bins(bin_count);
+in.numbers.resize(number_count);
+for (size_t i = 0; i < number_count; i++)
+{
+in>> in.numbers[i];
+}
 
-double min;
-min = numbers[0];
-for (size_t i = 1; i < numbers.size(); i++)
-    if (numbers[i] < min)
-        min = numbers[i];
+if (promt)
+{
+    cerr<<"enter bin count:";
+}
+in >>in.bin_count;
 
+return in;
+}
 
-double max;
-max = numbers[0];
-for (size_t i = 1; i < numbers.size(); i++)
-    if (numbers[i] > max)
-        max = numbers[i];
 
-double bin_size = (max - min) / bin_count;
 
-for (size_t i = 0; i < number_count; i++) {
-    bool found = false;
-    for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
-        auto lo = min + j * bin_size;
-        auto hi = min + (j + 1) * bin_size;
-        if ((lo <= numbers[i]) && (numbers[i] < hi)) {
-            bins[j]++;
-            found = true;
+int main(int arg, char* argv[])
+{
+    if (arg > 1)
+    {
+        CURL* curl = curl_easy_init();
+        if(curl)
+        {
+            CURLcode res;
+            curl_easy_setopt(curl,CURLOPT_URL,argv[1]);
+            res = curl_easy_perform(curl);
+            curl_easy_cleanup(curl);
+            if (res != CURE_OK)
+            {
+                cout<<curl_easy_strerror;
+                exit(1);
+            }
         }
+        return 0;
+
     }
-     if (!found) {
-        bins[bin_count - 1]++;
-    }
-}
 
-for (size_t i=0; i<bins.size(); i++)
-    {cout << bins[i] << "|";
-    for (size_t j=0; j<bins[i]; j++)
-        cout << "*";
-    cout << "\n" ;
+Input in = input_data();
+char arr[bin_count];
+for(int i=0; i<bin_count;i++)
+{
+    cin>>arr[i];
 }
-
-    return 0;
+auto bins = make_histogram(in.numbers, in.bin_count);
+show_histogram_svg(bins);
+return 0;
 }