From ef601fa2020994412716c1b76ea34fc08dddf817 Mon Sep 17 00:00:00 2001 From: ShchipkovMY Date: Sun, 10 Sep 2023 17:23:13 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?= =?UTF-8?q?=D0=B5=D0=BD=D0=B8=D0=B5=20=D1=82=D0=B5=D1=81=D1=82=D0=BE=D0=B2?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- histogram.cpp | 2 +- histogram_internal.h | 7 +++++++ unittest.cbp | 38 ++++++++++++++++++++++++++++++++++++++ unittest.cpp | 40 ++++++++++++++++++++++++++++++++++++++++ 4 files changed, 86 insertions(+), 1 deletion(-) create mode 100644 histogram_internal.h create mode 100644 unittest.cbp create mode 100644 unittest.cpp diff --git a/histogram.cpp b/histogram.cpp index 5867495..52c06d3 100644 --- a/histogram.cpp +++ b/histogram.cpp @@ -3,7 +3,7 @@ #include using namespace std; -void find_minmax(const vector &numbers, double &min, double &max) +void find_minmax( vector numbers, double &min, double &max) { min = numbers[0]; max = numbers[0]; diff --git a/histogram_internal.h b/histogram_internal.h new file mode 100644 index 0000000..d28f5fc --- /dev/null +++ b/histogram_internal.h @@ -0,0 +1,7 @@ +#ifndef HISTOGRAM_INTERNAL_H_INCLUDED +#define HISTOGRAM_INTERNAL_H_INCLUDED +#include + +bool find_minmax(std::vector numbers, double& min, double& max); + +#endif // HISTOGRAM_INTERNAL_H_INCLUDED diff --git a/unittest.cbp b/unittest.cbp new file mode 100644 index 0000000..7f9621b --- /dev/null +++ b/unittest.cbp @@ -0,0 +1,38 @@ + + + + + + diff --git a/unittest.cpp b/unittest.cpp new file mode 100644 index 0000000..62f954d --- /dev/null +++ b/unittest.cpp @@ -0,0 +1,40 @@ +#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("distinct positive numbers 2") { + double min = 0; + double max = 0; + std::vectorv{2,1}; + CHECK(v.size() != 0); + CHECK(v.size() != 1); + find_minmax({1, 2}, min, max); + CHECK(min == 1); + CHECK(max == 2); + CHECK(min != max); +} + +TEST_CASE("vector with one element") { + double min = 0; + double max = 0; + find_minmax({1}, min, max); + CHECK(min == 1); + CHECK(max == 1); +} + +TEST_CASE("vector with same elements") { + double min = 0; + double max = 0; + find_minmax({2,2,2}, min, max); + CHECK(min == 2); + CHECK(max == 2); +}