Сравнить коммиты
2 Коммитов
ab6b91d81f
...
2f1c968e10
| Автор | SHA1 | Дата |
|---|---|---|
 GaidaiAS
|
2f1c968e10 | 2 недель назад |
|
GaidaiAS
|
530d2d8fd8 | 2 месяцев назад |
Двоичный файл не отображается.
Разница между файлами не показана из-за своего большого размера
Загрузить разницу
@ -0,0 +1,86 @@
|
||||
#include "histogram.h"
|
||||
#include <iostream>
|
||||
#include <limits>
|
||||
|
||||
Input input_data() {
|
||||
Input in;
|
||||
size_t number_count;
|
||||
|
||||
std::cerr << "Enter number count: ";
|
||||
std::cin >> number_count;
|
||||
|
||||
in.numbers.resize(number_count);
|
||||
std::cerr << "Enter " << number_count << " numbers: ";
|
||||
for (size_t i = 0; i < number_count; i++) {
|
||||
std::cin >> in.numbers[i];
|
||||
}
|
||||
|
||||
std::cerr << "Enter bin count: ";
|
||||
std::cin >> in.bin_count;
|
||||
|
||||
std::cerr << "Enter text width : ";
|
||||
std::cin >> in.width;
|
||||
|
||||
return in;
|
||||
}
|
||||
|
||||
void find_minmax(const std::vector<double>& numbers, double& min, double& max) {
|
||||
min = std::numeric_limits<double>::max();
|
||||
max = std::numeric_limits<double>::lowest();
|
||||
|
||||
for (double x : numbers) {
|
||||
if (x < min) min = x;
|
||||
if (x > max) max = x;
|
||||
}
|
||||
}
|
||||
|
||||
std::vector<size_t> make_histogram(const std::vector<double>& numbers, size_t bin_count) {
|
||||
double min, max;
|
||||
find_minmax(numbers, min, max);
|
||||
|
||||
if (max == min) {
|
||||
return std::vector<size_t>(bin_count, numbers.size());
|
||||
}
|
||||
|
||||
double bin_size = (max - min) / bin_count;
|
||||
std::vector<size_t> bins(bin_count, 0);
|
||||
|
||||
for (double x : numbers) {
|
||||
size_t bin_index = static_cast<size_t>((x - min) / bin_size);
|
||||
if (bin_index >= bin_count) bin_index = bin_count - 1;
|
||||
bins[bin_index]++;
|
||||
}
|
||||
|
||||
return bins;
|
||||
}
|
||||
|
||||
void show_histogram_text(const std::vector<size_t>& bins) {
|
||||
const size_t SCREEN_WIDTH = 80;
|
||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
size_t max_count = 0;
|
||||
|
||||
for (size_t count : bins) {
|
||||
if (count > max_count) max_count = count;
|
||||
}
|
||||
|
||||
std::cerr << "Bin counts:" << std::endl;
|
||||
|
||||
for (size_t j = 0; j < bins.size(); j++) {
|
||||
size_t height = (max_count > MAX_ASTERISK)
|
||||
? static_cast<size_t>(MAX_ASTERISK * (static_cast<double>(bins[j]) / max_count))
|
||||
: bins[j];
|
||||
|
||||
if (bins[j] < 10) {
|
||||
std::cout << " " << bins[j] << "|";
|
||||
}
|
||||
else if (bins[j] < 100) {
|
||||
std::cout << " " << bins[j] << "|";
|
||||
}
|
||||
else {
|
||||
std::cout << bins[j] << "|";
|
||||
}
|
||||
|
||||
for (size_t k = 0; k < height; k++) std::cout << "*";
|
||||
std::cout << std::endl;
|
||||
}
|
||||
}
|
||||
@ -0,0 +1,13 @@
|
||||
#pragma once
|
||||
|
||||
#include <vector>
|
||||
|
||||
struct Input {
|
||||
std::vector<double> numbers;
|
||||
size_t bin_count{};
|
||||
int width;
|
||||
};
|
||||
|
||||
Input input_data();
|
||||
std::vector<size_t> make_histogram(const std::vector<double>& numbers, size_t bin_count);
|
||||
void show_histogram_text(const std::vector<size_t>& bins);
|
||||
@ -0,0 +1,5 @@
|
||||
#pragma once
|
||||
|
||||
#include <vector>
|
||||
|
||||
void find_minmax(const std::vector<double>& numbers, double& min, double& max);
|
||||
@ -1,88 +1,10 @@
|
||||
#include <vector>
|
||||
#include <iostream>
|
||||
#include <cstdlib>
|
||||
#include <ctime>
|
||||
#include <cmath>
|
||||
using namespace std;
|
||||
|
||||
struct Input {
|
||||
vector<double> numbers;
|
||||
size_t bin_count{};
|
||||
};
|
||||
|
||||
Input
|
||||
input_data() {
|
||||
Input in;
|
||||
size_t number_count;
|
||||
cerr << "Enter number count: ";
|
||||
cin >> number_count;
|
||||
in.numbers.resize(number_count);
|
||||
for (size_t i = 0; i < number_count; i++) {
|
||||
cin >> in.numbers[i];
|
||||
}
|
||||
size_t bin_count;
|
||||
cerr << "Enter bin count: ";
|
||||
cin >> in.bin_count;
|
||||
return in;
|
||||
}
|
||||
|
||||
void
|
||||
find_minmax(const vector<double>& numbers, double& min, double& max) {
|
||||
min = numbers[0];
|
||||
max = numbers[0];
|
||||
for (double x : numbers) {
|
||||
if (x < min) {
|
||||
min = x;
|
||||
}
|
||||
else if (x > max) {
|
||||
max = x;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#include "histogram.h"
|
||||
#include "svg.h"
|
||||
|
||||
int main() {
|
||||
const size_t SCREEN_WIDTH = 80;
|
||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
Input in = input_data();
|
||||
vector<size_t> bins(in.bin_count, 0);
|
||||
|
||||
double min, max;
|
||||
find_minmax(in.numbers, min, max);
|
||||
|
||||
|
||||
double bin_size = (max - min) / in.bin_count;
|
||||
|
||||
for (size_t i = 0; i < in.numbers.size(); i++) {
|
||||
bool found = false;
|
||||
for (size_t j = 0; (j < in.bin_count - 1) && !found; j++) {
|
||||
auto lo = min + j * bin_size;
|
||||
auto hi = min + (j + 1) * bin_size;
|
||||
if ((lo <= in.numbers[i]) && (in.numbers[i] < hi)) {
|
||||
bins[j]++;
|
||||
found = true;
|
||||
}
|
||||
}
|
||||
if (!found) {
|
||||
bins[in.bin_count - 1]++;
|
||||
}
|
||||
}
|
||||
|
||||
size_t max_bin_count = 0;
|
||||
for (size_t bin : bins) {
|
||||
if (bin > max_bin_count) {
|
||||
max_bin_count = bin;
|
||||
}
|
||||
}
|
||||
|
||||
for (size_t i = 0; i < in.bin_count; i++) {
|
||||
cout << bins[i] << " |";
|
||||
size_t height = (max_bin_count <= MAX_ASTERISK) ? bins[i] : static_cast<size_t>(MAX_ASTERISK * (static_cast<double>(bins[i]) / max_bin_count));
|
||||
for (size_t j = 0; j < height; j++) {
|
||||
cout << "*";
|
||||
}
|
||||
cout << endl;
|
||||
}
|
||||
|
||||
auto in = input_data();
|
||||
auto bins = make_histogram(in.numbers, in.bin_count);
|
||||
show_histogram_svg(bins, in.width);
|
||||
return 0;
|
||||
}
|
||||
//h hjhbhbjbh
|
||||
|
||||
Двоичный файл не отображается.
@ -0,0 +1,44 @@
|
||||
#include "svg.h"
|
||||
#include "text.h"
|
||||
void svg_begin(double width, double height) {
|
||||
std::cout << "<?xml version='1.0' encoding='UTF-8'?>\n";
|
||||
std::cout << "<svg ";
|
||||
std::cout << "width='" << width << "' ";
|
||||
std::cout << "height='" << height << "' ";
|
||||
std::cout << "viewBox='0 0 " << width << " " << height << "' ";
|
||||
std::cout << "xmlns='http://www.w3.org/2000/svg'>\n";
|
||||
}
|
||||
|
||||
void svg_end() {
|
||||
std::cout << "</svg>\n";
|
||||
}
|
||||
void svg_text(double left, double baseline, std::string text) {
|
||||
std::cout << "<text x='" << left << "' y='"<< baseline <<"'>" << text<<"</text>";
|
||||
}
|
||||
|
||||
void show_histogram_svg(const std::vector<size_t>& bins, int TEXT_WIDTH) {
|
||||
const auto IMAGE_WIDTH = 400;
|
||||
const auto IMAGE_HEIGHT = 300;
|
||||
const auto TEXT_LEFT = 20;
|
||||
const auto TEXT_BASELINE = 20;
|
||||
const auto BIN_HEIGHT = 30;
|
||||
const auto TEXT_GAP = 10;
|
||||
|
||||
svg_begin(IMAGE_WIDTH, IMAGE_HEIGHT);
|
||||
|
||||
size_t maxCount = maxBin(bins);
|
||||
double top = 0;
|
||||
for (size_t bin : bins) {
|
||||
const double bin_width = (IMAGE_WIDTH - TEXT_WIDTH - TEXT_GAP) * (bin / double(maxCount));
|
||||
svg_text(TEXT_LEFT, top + TEXT_BASELINE, std::to_string(bin));
|
||||
svg_rect(TEXT_WIDTH, top, bin_width, BIN_HEIGHT,"red","#006B3C");
|
||||
top += BIN_HEIGHT;
|
||||
}
|
||||
svg_end();
|
||||
}
|
||||
|
||||
void svg_rect(double x, double y, double width, double height,std::string stroke="black", std::string fills="black"){
|
||||
std::cout << "<rect x='"<<x<<"' y='"<<y<<"' width='"<<width<<"' height='"<<height<<"' stroke='"<<stroke<<"' fill='"<<fills<<"' />";
|
||||
}
|
||||
|
||||
|
||||
@ -0,0 +1,12 @@
|
||||
#ifndef SVG_H_INCLUDED
|
||||
#define SVG_H_INCLUDED
|
||||
|
||||
#include <vector>
|
||||
#include <iostream>
|
||||
void svg_begin(double width, double height);
|
||||
void svg_end();
|
||||
void show_histogram_svg(const std::vector<size_t>& bins, int width);
|
||||
void svg_text(double left, double baseline, std::string text);
|
||||
void svg_rect(double x, double y, double width, double height,std::string stroke, std::string fills);
|
||||
|
||||
#endif // SVG_H_INCLUDED
|
||||
@ -0,0 +1,41 @@
|
||||
#include "text.h"
|
||||
|
||||
void show_histogram_text(std::vector<size_t> bins , size_t bin_count) {
|
||||
size_t maxCount = maxBin(bins);
|
||||
size_t count_stars;
|
||||
for (size_t i = 0; i < bin_count; i++) {
|
||||
|
||||
if (bins[i] < 100) {
|
||||
std::cout << " ";
|
||||
}
|
||||
if (bins[i] < 10) {
|
||||
std::cout << " ";
|
||||
}
|
||||
|
||||
std::cout << bins[i];
|
||||
std::cout << "|";
|
||||
|
||||
if (maxCount > MAX_ASTERISK) {
|
||||
count_stars = MAX_ASTERISK * (static_cast<double>(bins[i]) / maxCount);
|
||||
}
|
||||
else {
|
||||
count_stars = bins[i];
|
||||
}
|
||||
for (size_t i2 = 0; i2 < count_stars; i2++) {
|
||||
std::cout << "*";
|
||||
}
|
||||
std::cout << std::endl;
|
||||
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
const size_t maxBin(std::vector<size_t> bins) {
|
||||
size_t max = bins[0];
|
||||
for (int i = 1; i < bins.size(); i++) {
|
||||
if (max < bins[i]) {
|
||||
max = bins[i];
|
||||
}
|
||||
}
|
||||
return max;
|
||||
}
|
||||
@ -0,0 +1,12 @@
|
||||
#ifndef TEXT_H_INCLUDED
|
||||
#define TEXT_H_INCLUDED
|
||||
|
||||
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
|
||||
const size_t SCREEN_WIDTH = 80;
|
||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
void show_histogram_text(std::vector<size_t> bins , size_t bin_count);
|
||||
const size_t maxBin(std::vector<size_t> bins);
|
||||
#endif // TEXT_H_INCLUDED
|
||||
@ -0,0 +1,45 @@
|
||||
#define DOCTEST_CONFIG_NO_MULTITHREADING
|
||||
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
|
||||
#include "doctest.h"
|
||||
#include "histogram_internal.h"
|
||||
|
||||
TEST_CASE("distinct positive numbers") {
|
||||
double min = 0;
|
||||
double max = 0;
|
||||
find_minmax({1, 2}, min, max);
|
||||
CHECK(min == 1);
|
||||
CHECK(max == 2);
|
||||
}
|
||||
|
||||
TEST_CASE("empty vector") {
|
||||
double min = 0;
|
||||
double max = 0;
|
||||
find_minmax({}, min, max);
|
||||
CHECK(min == std::numeric_limits<double>::max());
|
||||
CHECK(max == std::numeric_limits<double>::lowest());
|
||||
}
|
||||
|
||||
TEST_CASE("single element vector") {
|
||||
double min = 0;
|
||||
double max = 0;
|
||||
find_minmax({42}, min, max);
|
||||
CHECK(min == 42);
|
||||
CHECK(max == 42);
|
||||
}
|
||||
|
||||
TEST_CASE("negative numbers") {
|
||||
double min = 0;
|
||||
double max = 0;
|
||||
find_minmax({-5, -1, -3}, min, max);
|
||||
CHECK(min == -5);
|
||||
CHECK(max == -1);
|
||||
}
|
||||
|
||||
TEST_CASE("identical elements") {
|
||||
double min = 0;
|
||||
double max = 0;
|
||||
find_minmax({7, 7, 7}, min, max);
|
||||
CHECK(min == 7);
|
||||
CHECK(max == 7);
|
||||
}
|
||||
//wewger
|
||||
Загрузка…
Ссылка в новой задаче