mirror of
https://github.com/boostorg/histogram.git
synced 2025-05-12 05:31:51 +00:00
378 lines
8.5 KiB
C++
378 lines
8.5 KiB
C++
// Copyright 2015-2016 Hans Dembinski
|
|
//
|
|
// Distributed under the Boost Software License, Version 1.0.
|
|
// (See accompanying file LICENSE_1_0.txt
|
|
// or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#include <boost/archive/text_iarchive.hpp>
|
|
#include <boost/archive/text_oarchive.hpp>
|
|
#include <boost/core/lightweight_test.hpp>
|
|
#include <boost/histogram/serialization.hpp>
|
|
#include <boost/histogram/storage/adaptive_storage.hpp>
|
|
#include <boost/histogram/storage/container_storage.hpp>
|
|
#include <limits>
|
|
#include <sstream>
|
|
|
|
namespace boost {
|
|
|
|
namespace histogram {
|
|
|
|
template <typename T> adaptive_storage<> prepare(unsigned n = 1) {
|
|
adaptive_storage<> s(n);
|
|
s.increase(0);
|
|
const auto tmax = std::numeric_limits<T>::max();
|
|
while (s.value(0) < 0.1 * tmax) {
|
|
s += s;
|
|
}
|
|
return s;
|
|
}
|
|
|
|
template <> adaptive_storage<> prepare<void>(unsigned n) {
|
|
adaptive_storage<> s(n);
|
|
return s;
|
|
}
|
|
|
|
template <> adaptive_storage<> prepare<detail::weight>(unsigned n) {
|
|
adaptive_storage<> s(n);
|
|
s.increase(0, 1.0);
|
|
return s;
|
|
}
|
|
|
|
template <> adaptive_storage<> prepare<detail::mp_int>(unsigned n) {
|
|
adaptive_storage<> s(n);
|
|
s.increase(0);
|
|
auto tmax = static_cast<double>(std::numeric_limits<uint64_t>::max());
|
|
tmax *= 2.0;
|
|
while (s.value(0) < tmax) {
|
|
s += s;
|
|
}
|
|
return s;
|
|
}
|
|
|
|
} // namespace prepare
|
|
|
|
namespace python { // cheating to get access
|
|
class access {
|
|
public:
|
|
template <typename T> static histogram::adaptive_storage<> set_value(unsigned n, T x) {
|
|
histogram::adaptive_storage<> s = histogram::prepare<T>(n);
|
|
get<histogram::adaptive_storage<>::array<T>>(s.buffer_)[0] = x;
|
|
return s;
|
|
}
|
|
};
|
|
} // namespace python
|
|
|
|
namespace histogram {
|
|
|
|
template <typename T> void copy_impl() {
|
|
const auto b = prepare<T>(1);
|
|
auto a(b);
|
|
BOOST_TEST(a == b);
|
|
a.increase(0);
|
|
BOOST_TEST(!(a == b));
|
|
a = b;
|
|
BOOST_TEST(a == b);
|
|
a.increase(0);
|
|
BOOST_TEST(!(a == b));
|
|
a = b;
|
|
a = prepare<T>(2);
|
|
BOOST_TEST(!(a == b));
|
|
a = b;
|
|
BOOST_TEST(a == b);
|
|
}
|
|
|
|
template <typename T> void serialization_impl() {
|
|
const auto a = python::access::set_value(1, T(1));
|
|
std::ostringstream os;
|
|
std::string buf;
|
|
{
|
|
std::ostringstream os;
|
|
boost::archive::text_oarchive oa(os);
|
|
oa << a;
|
|
buf = os.str();
|
|
}
|
|
adaptive_storage<> b;
|
|
BOOST_TEST(!(a == b));
|
|
{
|
|
std::istringstream is(buf);
|
|
boost::archive::text_iarchive ia(is);
|
|
ia >> b;
|
|
}
|
|
BOOST_TEST(a == b);
|
|
}
|
|
|
|
template <> void serialization_impl<void>() {
|
|
adaptive_storage<> a(1);
|
|
std::ostringstream os;
|
|
std::string buf;
|
|
{
|
|
std::ostringstream os;
|
|
boost::archive::text_oarchive oa(os);
|
|
oa << a;
|
|
buf = os.str();
|
|
}
|
|
adaptive_storage<> b;
|
|
BOOST_TEST(!(a == b));
|
|
{
|
|
std::istringstream is(buf);
|
|
boost::archive::text_iarchive ia(is);
|
|
ia >> b;
|
|
}
|
|
BOOST_TEST(a == b);
|
|
}
|
|
|
|
template <typename T> void equal_impl() {
|
|
adaptive_storage<> a(1);
|
|
auto b = python::access::set_value(1, T(0));
|
|
BOOST_TEST_EQ(a.value(0), 0.0);
|
|
BOOST_TEST_EQ(a.variance(0), 0.0);
|
|
BOOST_TEST(a == b);
|
|
b.increase(0);
|
|
BOOST_TEST(!(a == b));
|
|
|
|
container_storage<std::vector<unsigned>> c(1);
|
|
auto d = python::access::set_value(1, T(0));
|
|
BOOST_TEST(c == d);
|
|
c.increase(0);
|
|
BOOST_TEST(!(c == d));
|
|
}
|
|
|
|
template <> void equal_impl<void>() {
|
|
adaptive_storage<> a(1);
|
|
auto b = python::access::set_value(1, uint8_t(0));
|
|
auto c = python::access::set_value(2, uint8_t(0));
|
|
auto d = container_storage<std::vector<unsigned>>(1);
|
|
BOOST_TEST_EQ(a.value(0), 0.0);
|
|
BOOST_TEST_EQ(a.variance(0), 0.0);
|
|
BOOST_TEST(a == b);
|
|
BOOST_TEST(b == a);
|
|
BOOST_TEST(a == d);
|
|
BOOST_TEST(d == a);
|
|
BOOST_TEST(!(a == c));
|
|
BOOST_TEST(!(c == a));
|
|
b.increase(0);
|
|
BOOST_TEST(!(a == b));
|
|
BOOST_TEST(!(b == a));
|
|
d.increase(0);
|
|
BOOST_TEST(!(a == d));
|
|
BOOST_TEST(!(d == a));
|
|
}
|
|
|
|
template <typename T> void increase_and_grow_impl() {
|
|
auto tmax = std::numeric_limits<T>::max();
|
|
auto s = python::access::set_value<T>(2, tmax - 1);
|
|
auto n = s;
|
|
auto n2 = s;
|
|
|
|
n.increase(0);
|
|
n.increase(0);
|
|
|
|
adaptive_storage<> x(2);
|
|
x.increase(0);
|
|
n2 += x;
|
|
n2 += x;
|
|
|
|
double v = tmax;
|
|
++v;
|
|
BOOST_TEST_EQ(n.value(0), v);
|
|
BOOST_TEST_EQ(n2.value(0), v);
|
|
BOOST_TEST_EQ(n.value(1), 0.0);
|
|
BOOST_TEST_EQ(n2.value(1), 0.0);
|
|
}
|
|
|
|
template <> void increase_and_grow_impl<void>() {
|
|
adaptive_storage<> s(2);
|
|
s.increase(0);
|
|
BOOST_TEST_EQ(s.value(0), 1.0);
|
|
BOOST_TEST_EQ(s.value(1), 0.0);
|
|
}
|
|
|
|
template <typename T> void convert_container_storage_impl() {
|
|
const auto aref = python::access::set_value(1, T(0));
|
|
container_storage<std::vector<uint8_t>> s(1);
|
|
s.increase(0);
|
|
|
|
auto a = aref;
|
|
a = s;
|
|
BOOST_TEST_EQ(a.value(0), 1.0);
|
|
BOOST_TEST(a == s);
|
|
a.increase(0);
|
|
BOOST_TEST(!(a == s));
|
|
|
|
adaptive_storage<> b(s);
|
|
BOOST_TEST_EQ(b.value(0), 1.0);
|
|
BOOST_TEST(b == s);
|
|
b.increase(0);
|
|
BOOST_TEST(!(b == s));
|
|
|
|
auto c = aref;
|
|
c += s;
|
|
BOOST_TEST_EQ(c.value(0), 1.0);
|
|
BOOST_TEST(c == s);
|
|
BOOST_TEST(s == c);
|
|
|
|
container_storage<std::vector<float>> t(1);
|
|
t.increase(0);
|
|
while (t.value(0) < 1e20)
|
|
t += t;
|
|
auto d = aref;
|
|
d = t;
|
|
BOOST_TEST(d == t);
|
|
|
|
auto e = aref;
|
|
e = s;
|
|
BOOST_TEST_EQ(e.value(0), 1.0);
|
|
BOOST_TEST(e == s);
|
|
e.increase(0);
|
|
BOOST_TEST(!(e == s));
|
|
|
|
adaptive_storage<> f(s);
|
|
BOOST_TEST_EQ(f.value(0), 1.0);
|
|
BOOST_TEST(f == s);
|
|
f.increase(0);
|
|
BOOST_TEST(!(f == s));
|
|
|
|
auto g = aref;
|
|
g += s;
|
|
BOOST_TEST_EQ(g.value(0), 1.0);
|
|
BOOST_TEST(g == s);
|
|
BOOST_TEST(s == g);
|
|
|
|
container_storage<std::vector<uint8_t>> u(2);
|
|
u.increase(0);
|
|
auto h = aref;
|
|
BOOST_TEST(!(h == u));
|
|
h = u;
|
|
BOOST_TEST(h == u);
|
|
}
|
|
|
|
template <> void convert_container_storage_impl<void>() {
|
|
const auto aref = adaptive_storage<>(1);
|
|
BOOST_TEST_EQ(aref.value(0), 0.0);
|
|
container_storage<std::vector<uint8_t>> s(1);
|
|
s.increase(0);
|
|
|
|
auto a = aref;
|
|
a = s;
|
|
BOOST_TEST_EQ(a.value(0), 1.0);
|
|
BOOST_TEST(a == s);
|
|
a.increase(0);
|
|
BOOST_TEST(!(a == s));
|
|
|
|
auto c = aref;
|
|
c += s;
|
|
BOOST_TEST_EQ(c.value(0), 1.0);
|
|
BOOST_TEST(c == s);
|
|
BOOST_TEST(s == c);
|
|
|
|
container_storage<std::vector<uint8_t>> t(2);
|
|
t.increase(0);
|
|
auto d = aref;
|
|
BOOST_TEST(!(d == t));
|
|
}
|
|
|
|
} // namespace histogram
|
|
} // namespace boost
|
|
|
|
int main() {
|
|
using namespace boost::histogram;
|
|
|
|
// empty state
|
|
{
|
|
adaptive_storage<> a;
|
|
BOOST_TEST_EQ(a.size(), 0);
|
|
}
|
|
|
|
// copy
|
|
{
|
|
copy_impl<detail::weight>();
|
|
copy_impl<void>();
|
|
copy_impl<uint8_t>();
|
|
copy_impl<uint16_t>();
|
|
copy_impl<uint32_t>();
|
|
copy_impl<uint64_t>();
|
|
copy_impl<detail::mp_int>();
|
|
}
|
|
|
|
// equal_operator
|
|
{
|
|
equal_impl<void>();
|
|
equal_impl<uint8_t>();
|
|
equal_impl<uint16_t>();
|
|
equal_impl<uint32_t>();
|
|
equal_impl<uint64_t>();
|
|
equal_impl<detail::mp_int>();
|
|
equal_impl<detail::weight>();
|
|
}
|
|
|
|
// increase_and_grow
|
|
{
|
|
increase_and_grow_impl<void>();
|
|
increase_and_grow_impl<uint8_t>();
|
|
increase_and_grow_impl<uint16_t>();
|
|
increase_and_grow_impl<uint32_t>();
|
|
increase_and_grow_impl<uint64_t>();
|
|
|
|
// only increase for mp_int
|
|
auto a = boost::python::access::set_value(2, detail::mp_int(1));
|
|
BOOST_TEST_EQ(a.value(0), 1.0);
|
|
BOOST_TEST_EQ(a.value(1), 0.0);
|
|
a.increase(0);
|
|
BOOST_TEST_EQ(a.value(0), 2.0);
|
|
BOOST_TEST_EQ(a.value(1), 0.0);
|
|
}
|
|
|
|
// add_and_grow
|
|
{
|
|
adaptive_storage<> a(1);
|
|
a.increase(0);
|
|
double x = 1.0;
|
|
adaptive_storage<> y(1);
|
|
BOOST_TEST_EQ(y.value(0), 0.0);
|
|
a += y;
|
|
BOOST_TEST_EQ(a.value(0), x);
|
|
for (unsigned i = 0; i < 80; ++i) {
|
|
a += a;
|
|
x += x;
|
|
adaptive_storage<> b(1);
|
|
b += a;
|
|
BOOST_TEST_EQ(a.value(0), x);
|
|
BOOST_TEST_EQ(a.variance(0), x);
|
|
BOOST_TEST_EQ(b.value(0), x);
|
|
BOOST_TEST_EQ(b.variance(0), x);
|
|
b.increase(0, 0.0);
|
|
BOOST_TEST_EQ(b.value(0), x);
|
|
BOOST_TEST_EQ(b.variance(0), x);
|
|
adaptive_storage<> c(1);
|
|
c.increase(0, 0.0);
|
|
c += a;
|
|
BOOST_TEST_EQ(c.value(0), x);
|
|
BOOST_TEST_EQ(c.variance(0), x);
|
|
}
|
|
}
|
|
|
|
// convert_container_storage
|
|
{
|
|
convert_container_storage_impl<void>();
|
|
convert_container_storage_impl<uint8_t>();
|
|
convert_container_storage_impl<uint16_t>();
|
|
convert_container_storage_impl<uint32_t>();
|
|
convert_container_storage_impl<uint64_t>();
|
|
convert_container_storage_impl<detail::mp_int>();
|
|
convert_container_storage_impl<detail::weight>();
|
|
}
|
|
|
|
// serialization_test
|
|
{
|
|
serialization_impl<void>();
|
|
serialization_impl<uint8_t>();
|
|
serialization_impl<uint16_t>();
|
|
serialization_impl<uint32_t>();
|
|
serialization_impl<uint64_t>();
|
|
serialization_impl<detail::mp_int>();
|
|
serialization_impl<detail::weight>();
|
|
}
|
|
|
|
return boost::report_errors();
|
|
}
|