Родитель
							
								
									2c5e59637d
								
							
						
					
					
						Сommit
						daf15cde1f
					
				| @ -0,0 +1,58 @@ | ||||
| #include <iostream> | ||||
| #include <vector> | ||||
| #include <string> | ||||
| 
 | ||||
| using namespace std; | ||||
| 
 | ||||
| void svg_begin(double width, double height) { | ||||
|     cout << "<?xml version='1.0' encoding='UTF-8'?>\n"; | ||||
|     cout << "<svg "; | ||||
|     cout << "width='" << width << "' "; | ||||
|     cout << "height='" << height << "' "; | ||||
|     cout << "viewBox='0 0 " << width << " " << height << "' "; | ||||
|     cout << "xmlns='http://www.w3.org/2000/svg'>\n"; | ||||
| } | ||||
| 
 | ||||
| void svg_end() { | ||||
|     cout << "</svg>\n"; | ||||
| } | ||||
| 
 | ||||
| void svg_text(double left, double baseline, const string& text) { | ||||
|     cout << "<text x='" << left << "' y='" << baseline << "'>" << text << "</text>\n"; | ||||
| } | ||||
| 
 | ||||
| void svg_rect(double x, double y, double width, double height, | ||||
|               string stroke = "black", string fill = "black") { | ||||
|     cout << "<rect x='" << x << "' y='" << y | ||||
|          << "' width='" << width << "' height='" << height | ||||
|          << "' stroke='" << stroke << "' fill='" << fill << "' />\n"; | ||||
| } | ||||
| 
 | ||||
| void show_histogram_svg(const vector<size_t>& bins) { | ||||
|     const auto IMAGE_WIDTH = 400; | ||||
|     const auto IMAGE_HEIGHT = 300; | ||||
|     const auto TEXT_LEFT = 20; | ||||
|     const auto TEXT_BASELINE = 20; | ||||
|     const auto TEXT_WIDTH = 50; | ||||
|     const auto BIN_HEIGHT = 30; | ||||
| 
 | ||||
|     svg_begin(IMAGE_WIDTH, IMAGE_HEIGHT); | ||||
| 
 | ||||
|     double top = 0; | ||||
|     size_t max_bin = 0; | ||||
|     for (size_t i = 0; i < bins.size(); ++i) { | ||||
|         if (bins[i] > max_bin) { | ||||
|             max_bin = bins[i]; | ||||
|         } | ||||
|     } | ||||
|     double scale = (max_bin > 0) ? (IMAGE_WIDTH - TEXT_WIDTH) * 1.0 / max_bin : 0; | ||||
| 
 | ||||
|     for (size_t bin : bins) { | ||||
|         const double bin_width = scale * bin; | ||||
|         svg_text(TEXT_LEFT, top + TEXT_BASELINE, to_string(bin)); | ||||
|         svg_rect(TEXT_WIDTH, top, bin_width, BIN_HEIGHT); | ||||
|         top += BIN_HEIGHT; | ||||
|     } | ||||
| 
 | ||||
|     svg_end(); | ||||
| } | ||||
| @ -0,0 +1,10 @@ | ||||
| #ifndef SVG_H_INCLUDED | ||||
| #define SVG_H_INCLUDED | ||||
| 
 | ||||
| #include <vector> | ||||
| 
 | ||||
| void svg_begin(double width, double height); | ||||
| void svg_end(); | ||||
| void show_histogram_svg(const std::vector<size_t>& bins); | ||||
| 
 | ||||
| #endif // SVG_H_INCLUDED
 | ||||
| @ -0,0 +1,36 @@ | ||||
| #define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN | ||||
| #include "doctest.h" | ||||
| #include "histogram_internal.h" | ||||
| #include <vector> | ||||
| 
 | ||||
| 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("find_minmax with one element") { | ||||
|     std::vector<double> numbers{42}; | ||||
|     double min, max; | ||||
|     find_minmax(numbers, min, max); | ||||
|     CHECK(min == 42); | ||||
|     CHECK(max == 42); | ||||
| } | ||||
| 
 | ||||
| TEST_CASE("find_minmax with negative values") { | ||||
|     std::vector<double> numbers{-10.5, -2.3, -3.3}; | ||||
|     double min, max; | ||||
|     find_minmax(numbers, min, max); | ||||
|     CHECK(min == -10.5); | ||||
|     CHECK(max == -2.3); | ||||
| } | ||||
| 
 | ||||
| TEST_CASE("find_minmax with identical elements") { | ||||
|     std::vector<double> numbers{7, 7, 7, 7}; | ||||
|     double min, max; | ||||
|     find_minmax(numbers, min, max); | ||||
|     CHECK(min == 7); | ||||
|     CHECK(max == 7); | ||||
| } | ||||
					Загрузка…
					
					
				
		Ссылка в новой задаче
	
	 BadakinaVV
						BadakinaVV