| 1 | // Copyright 2015-2018 Hans Dembinski |
| 2 | // |
| 3 | // Distributed under the Boost Software License, Version 1.0. |
| 4 | // (See accompanying file LICENSE_1_0.txt |
| 5 | // or copy at http://www.boost.org/LICENSE_1_0.txt) |
| 6 | |
| 7 | #include <boost/core/lightweight_test.hpp> |
| 8 | #include <boost/histogram/accumulators/fraction.hpp> |
| 9 | #include <boost/histogram/accumulators/ostream.hpp> |
| 10 | #include <boost/histogram/utility/wilson_interval.hpp> |
| 11 | #include <cmath> |
| 12 | #include <limits> |
| 13 | #include "is_close.hpp" |
| 14 | #include "str.hpp" |
| 15 | #include "throw_exception.hpp" |
| 16 | |
| 17 | using namespace boost::histogram; |
| 18 | using namespace std::literals; |
| 19 | |
| 20 | template <class T> |
| 21 | void run_tests() { |
| 22 | using f_t = accumulators::fraction<T>; |
| 23 | |
| 24 | const double eps = std::numeric_limits<typename f_t::real_type>::epsilon(); |
| 25 | |
| 26 | { |
| 27 | f_t f; |
| 28 | BOOST_TEST_EQ(f.successes(), 0); |
| 29 | BOOST_TEST_EQ(f.failures(), 0); |
| 30 | BOOST_TEST(std::isnan(f.value())); |
| 31 | BOOST_TEST(std::isnan(f.variance())); |
| 32 | |
| 33 | const auto ci = f.confidence_interval(); |
| 34 | BOOST_TEST(std::isnan(ci.first)); |
| 35 | BOOST_TEST(std::isnan(ci.second)); |
| 36 | } |
| 37 | |
| 38 | { |
| 39 | f_t f; |
| 40 | f(true); |
| 41 | BOOST_TEST_EQ(f.successes(), 1); |
| 42 | BOOST_TEST_EQ(f.failures(), 0); |
| 43 | BOOST_TEST_EQ(str(f), "fraction(1, 0)"s ); |
| 44 | f(false); |
| 45 | BOOST_TEST_EQ(f.successes(), 1); |
| 46 | BOOST_TEST_EQ(f.failures(), 1); |
| 47 | BOOST_TEST_EQ(str(f), "fraction(1, 1)"s ); |
| 48 | BOOST_TEST_EQ(str(f, 20), "fraction(1, 1) "s ); |
| 49 | } |
| 50 | |
| 51 | { |
| 52 | f_t f(3, 1); |
| 53 | BOOST_TEST_EQ(f.successes(), 3); |
| 54 | BOOST_TEST_EQ(f.failures(), 1); |
| 55 | BOOST_TEST_EQ(f.value(), 0.75); |
| 56 | BOOST_TEST_IS_CLOSE(f.variance(), 0.75 * (1 - 0.75) / 4, eps); |
| 57 | |
| 58 | const auto ci = f.confidence_interval(); |
| 59 | const auto expected = utility::wilson_interval<double>()(3, 1); |
| 60 | BOOST_TEST_IS_CLOSE(ci.first, expected.first, eps); |
| 61 | BOOST_TEST_IS_CLOSE(ci.second, expected.second, eps); |
| 62 | } |
| 63 | |
| 64 | { |
| 65 | f_t f(0, 1); |
| 66 | BOOST_TEST_EQ(f.successes(), 0); |
| 67 | BOOST_TEST_EQ(f.failures(), 1); |
| 68 | BOOST_TEST_EQ(f.value(), 0); |
| 69 | BOOST_TEST_EQ(f.variance(), 0); |
| 70 | |
| 71 | const auto ci = f.confidence_interval(); |
| 72 | const auto expected = utility::wilson_interval<double>()(0, 1); |
| 73 | BOOST_TEST_IS_CLOSE(ci.first, expected.first, eps); |
| 74 | BOOST_TEST_IS_CLOSE(ci.second, expected.second, eps); |
| 75 | } |
| 76 | |
| 77 | { |
| 78 | f_t f(1, 0); |
| 79 | BOOST_TEST_EQ(f.successes(), 1); |
| 80 | BOOST_TEST_EQ(f.failures(), 0); |
| 81 | BOOST_TEST_EQ(f.value(), 1); |
| 82 | BOOST_TEST_EQ(f.variance(), 0); |
| 83 | |
| 84 | const auto ci = f.confidence_interval(); |
| 85 | const auto expected = utility::wilson_interval<double>()(1, 0); |
| 86 | BOOST_TEST_IS_CLOSE(ci.first, expected.first, eps); |
| 87 | BOOST_TEST_IS_CLOSE(ci.second, expected.second, eps); |
| 88 | } |
| 89 | |
| 90 | { |
| 91 | f_t a(1, 0), b(0, 1); |
| 92 | |
| 93 | a += b; |
| 94 | BOOST_TEST_EQ(a, f_t(1, 1)); |
| 95 | } |
| 96 | } |
| 97 | |
| 98 | int main() { |
| 99 | |
| 100 | run_tests<int>(); |
| 101 | run_tests<double>(); |
| 102 | run_tests<float>(); |
| 103 | |
| 104 | { |
| 105 | using f_t1 = accumulators::fraction<double>; |
| 106 | using f_t2 = accumulators::fraction<int>; |
| 107 | f_t1 f1(5, 3); |
| 108 | f_t2 f2(f1); |
| 109 | BOOST_TEST_EQ(f2.successes(), 5); |
| 110 | BOOST_TEST_EQ(f2.failures(), 3); |
| 111 | } |
| 112 | |
| 113 | return boost::report_errors(); |
| 114 | } |
| 115 | |