Сравнить коммиты

...

7 Коммитов

Разница между файлами не показана из-за своего большого размера Загрузить разницу

@ -32,7 +32,23 @@
<Add option="-Wall" />
<Add option="-fexceptions" />
</Compiler>
<Unit filename=".gitignore" />
<Unit filename="histogram.cpp" />
<Unit filename="histogram.h">
<Option target="&lt;{~None~}&gt;" />
</Unit>
<Unit filename="histogram_internal.h">
<Option target="&lt;{~None~}&gt;" />
</Unit>
<Unit filename="main.cpp" />
<Unit filename="svg.cpp" />
<Unit filename="svg.h">
<Option target="&lt;{~None~}&gt;" />
</Unit>
<Unit filename="text.cpp" />
<Unit filename="text.h">
<Option target="&lt;{~None~}&gt;" />
</Unit>
<Extensions>
<lib_finder disable_auto="1" />
</Extensions>

@ -1,5 +1,9 @@
#include <iostream>
#include <vector>
#include <curl/curl.h>
#include "histogram.h"
#include "text.h"
#include "svg.h"
using namespace std;
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
@ -10,95 +14,55 @@ struct Input {
};
Input
input_data() {
input_data(istream& in, bool prompt) {
size_t number_count;
cin >> number_count;
Input in;
in.numbers.resize(number_count);
if (prompt == true){
cerr << "input number count";
in >> number_count;
Input inn;
inn.numbers.resize(number_count);
cerr << "input numbers";
for (size_t i = 0; i < number_count; i++) {
cin >> in.numbers[i];
}
cin >> in.bin_count;
return in;
}
void
find_minmax(const vector<double>& numbers, double& min, double& max) {
min = numbers[0];
max = numbers[0];
for (size_t x : numbers) {
if (x < min) {
min = x;
}
else if (x > max) {
max = x;
}
}
// (çäåñü êîä ïîèñêà ìèíèìóìà è ìàêñèìóìà)
}
vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count){
vector<size_t> bins(bin_count);
double min, max;
find_minmax(numbers, min, max);
double bin_size = (max-min)/bin_count;
for (size_t i = 0; i < numbers.size(); 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 ( (numbers[i] >= lo) && (numbers[i] < hi) ) {
bins[j]++;
found = true;
}
}
if (!found) {
bins[bin_count-1]++;
}
}
return bins;
}
void
show_histogram_text(vector<size_t> bins){
size_t max_count = bins[0];
for(size_t x: bins){
if(x > max_count){
max_count = x;
}
}
vector<size_t> heights(bins.size());
if (max_count>MAX_ASTERISK){
for (size_t i = 0; i < bins.size(); i++){
heights[i] = MAX_ASTERISK * (static_cast<double>(bins[i]) /max_count);
cin >> inn.numbers[i];
}
cerr << "input bin count";
in >> inn.bin_count;
return inn;
}
else{
for (size_t i=0; i<bins.size(); i++){
heights[i] = bins[i];
}
}
for(size_t i=0; i<bins.size(); i++){
if (bins[i] < 10){
cout << " " << bins[i] << "|";
}
else if (bins[i] < 100){
cout << " " << bins[i] << "|";
}
else{
cout << bins[i] << "|";
}
for (size_t j=0; j<heights[i]; j++){
cout<<"*";
cout << "input number count";
in >> number_count;
Input inn;
inn.numbers.resize(number_count);
cout << "input numbers";
for (size_t i = 0; i < number_count; i++) {
cin >> inn.numbers[i];
}
cout<<"\n";
cerr << "input bin count";
in >> inn.bin_count;
return inn;
}
}
int
main(){
auto in = input_data();
main(int argc, char* argv[]){
CURL *curl = curl_easy_init();
if (argc>1){
if(curl) {
CURLcode res;
curl_easy_setopt(curl, CURLOPT_URL, argv[1]);
res = curl_easy_perform(curl);
if (res!=CURLE_OK){
cerr<<curl_easy_strerror(res);
exit(1);
}
curl_easy_cleanup(curl);
}
return 0;
}
curl_global_init(CURL_GLOBAL_ALL);
auto in = input_data(cin,true);
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins);
show_histogram_svg(bins);
return 0;
}

Загрузка…
Отмена
Сохранить