histogram_test.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512
  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. #include <boost/core/ignore_unused.hpp>
  7. #include <boost/core/lightweight_test.hpp>
  8. #include <boost/histogram/accumulators.hpp>
  9. #include <boost/histogram/accumulators/ostream.hpp>
  10. #include <boost/histogram/algorithm/sum.hpp>
  11. #include <boost/histogram/axis.hpp>
  12. #include <boost/histogram/axis/ostream.hpp>
  13. #include <boost/histogram/histogram.hpp>
  14. #include <boost/histogram/literals.hpp>
  15. #include <boost/histogram/make_histogram.hpp>
  16. #include <boost/histogram/ostream.hpp>
  17. #include <sstream>
  18. #include <stdexcept>
  19. #include <tuple>
  20. #include <utility>
  21. #include <vector>
  22. #include "is_close.hpp"
  23. #include "std_ostream.hpp"
  24. #include "throw_exception.hpp"
  25. #include "utility_allocator.hpp"
  26. #include "utility_axis.hpp"
  27. #include "utility_histogram.hpp"
  28. using namespace boost::histogram;
  29. using namespace boost::histogram::literals; // to get _c suffix
  30. template <class A, class S>
  31. void pass_histogram(boost::histogram::histogram<A, S>& h) {
  32. BOOST_TEST_EQ(h.at(0), 0);
  33. BOOST_TEST_EQ(h.at(1), 1);
  34. BOOST_TEST_EQ(h.at(2), 0);
  35. BOOST_TEST_EQ(h.axis(0_c), axis::integer<>(0, 3));
  36. }
  37. template <class Tag>
  38. void run_tests() {
  39. // init_1
  40. {
  41. auto h = make(Tag(), axis::regular<>{3, -1, 1});
  42. BOOST_TEST_EQ(h.rank(), 1);
  43. BOOST_TEST_EQ(h.size(), 5);
  44. BOOST_TEST_EQ(h.axis(0_c).size(), 3);
  45. BOOST_TEST_EQ(h.axis().size(), 3);
  46. auto h2 = make_s(Tag(), std::vector<unsigned>(), axis::regular<>{3, -1, 1});
  47. BOOST_TEST_EQ(h2, h);
  48. }
  49. // init_2
  50. {
  51. auto h = make(Tag(), axis::regular<>{3, -1, 1}, axis::integer<>{-1, 2},
  52. axis::circular<>{2, 0, 360}, axis::variable<>{-1, 0, 1},
  53. axis::category<>{{3, 1, 2}});
  54. BOOST_TEST_EQ(h.rank(), 5);
  55. BOOST_TEST_EQ(h.size(), 5 * 5 * 3 * 4 * 4);
  56. auto h2 = make_s(Tag(), std::vector<unsigned>(), axis::regular<>{3, -1, 1},
  57. axis::integer<>{-1, 2}, axis::circular<>{2, 0, 360},
  58. axis::variable<>{-1, 0, 1}, axis::category<>{{3, 1, 2}});
  59. BOOST_TEST_EQ(h2, h);
  60. }
  61. // copy_ctor
  62. {
  63. auto h = make(Tag(), axis::integer<>{0, 2}, axis::integer<>{0, 3});
  64. h(0, 0);
  65. auto h2 = decltype(h)(h);
  66. BOOST_TEST_EQ(h2, h);
  67. auto h3 =
  68. histogram<std::tuple<axis::integer<>, axis::integer<>>, dense_storage<double>>(h);
  69. BOOST_TEST_EQ(h3, h);
  70. }
  71. // copy_assign
  72. {
  73. auto h = make(Tag(), axis::integer<>(0, 1), axis::integer<>(0, 2));
  74. h(0, 0);
  75. auto h2 = decltype(h)();
  76. BOOST_TEST_NE(h, h2);
  77. h2 = h;
  78. BOOST_TEST_EQ(h, h2);
  79. auto h3 =
  80. histogram<std::tuple<axis::integer<>, axis::integer<>>, dense_storage<double>>();
  81. h3 = h;
  82. BOOST_TEST_EQ(h, h3);
  83. }
  84. // move
  85. {
  86. auto h = make(Tag(), axis::integer<>(0, 1), axis::integer<>(0, 2));
  87. h(0, 0);
  88. const auto href = h;
  89. decltype(h) h2(std::move(h));
  90. BOOST_TEST_EQ(algorithm::sum(h), 0);
  91. BOOST_TEST_EQ(h.size(), 0);
  92. BOOST_TEST_EQ(h2, href);
  93. decltype(h) h3;
  94. h3 = std::move(h2);
  95. BOOST_TEST_EQ(algorithm::sum(h2), 0);
  96. BOOST_TEST_EQ(h2.size(), 0);
  97. BOOST_TEST_EQ(h3, href);
  98. }
  99. // axis methods
  100. {
  101. auto a = make(Tag(), axis::integer<double>(1, 2, "foo"));
  102. BOOST_TEST_EQ(a.axis().size(), 1);
  103. BOOST_TEST_EQ(a.axis().bin(0).lower(), 1);
  104. BOOST_TEST_EQ(a.axis().bin(0).upper(), 2);
  105. BOOST_TEST_EQ(a.axis().metadata(), "foo");
  106. unsafe_access::axis(a, 0).metadata() = "bar";
  107. BOOST_TEST_EQ(a.axis().metadata(), "bar");
  108. auto b = make(Tag(), axis::integer<double>(1, 2, "foo"), axis::integer<>(1, 3));
  109. // check static access
  110. BOOST_TEST_EQ(b.axis(0_c).size(), 1);
  111. BOOST_TEST_EQ(b.axis(0_c).bin(0).lower(), 1);
  112. BOOST_TEST_EQ(b.axis(0_c).bin(0).upper(), 2);
  113. BOOST_TEST_EQ(b.axis(1_c).size(), 2);
  114. BOOST_TEST_EQ(b.axis(1_c).bin(0), 1);
  115. BOOST_TEST_EQ(b.axis(1_c).bin(1), 2);
  116. unsafe_access::axis(b, 1_c).metadata() = "bar";
  117. BOOST_TEST_EQ(b.axis(0_c).metadata(), "foo");
  118. BOOST_TEST_EQ(b.axis(1_c).metadata(), "bar");
  119. // check dynamic access
  120. BOOST_TEST_EQ(b.axis(0).size(), 1);
  121. BOOST_TEST_EQ(b.axis(0).bin(0).lower(), 1);
  122. BOOST_TEST_EQ(b.axis(0).bin(0).upper(), 2);
  123. BOOST_TEST_EQ(b.axis(1).size(), 2);
  124. BOOST_TEST_EQ(b.axis(1).bin(0), 1);
  125. BOOST_TEST_EQ(b.axis(1).bin(1), 2);
  126. BOOST_TEST_EQ(b.axis(0).metadata(), "foo");
  127. BOOST_TEST_EQ(b.axis(1).metadata(), "bar");
  128. unsafe_access::axis(b, 0).metadata() = "baz";
  129. BOOST_TEST_EQ(b.axis(0).metadata(), "baz");
  130. auto c = make(Tag(), axis::category<>({1, 2}));
  131. BOOST_TEST_EQ(c.axis().size(), 2);
  132. unsafe_access::axis(c, 0).metadata() = "foo";
  133. BOOST_TEST_EQ(c.axis().metadata(), "foo");
  134. // need to cast here for this to work with Tag == dynamic_tag, too
  135. const auto& ca = axis::get<axis::category<>>(c.axis());
  136. BOOST_TEST_EQ(ca.bin(0), 1);
  137. const auto& ca2 = axis::get<axis::category<>>(c.axis(0));
  138. BOOST_TEST_EQ(&ca2, &ca);
  139. }
  140. // equal_compare
  141. {
  142. auto a = make(Tag(), axis::integer<>(0, 2));
  143. auto b = make(Tag(), axis::integer<>(0, 2), axis::integer<>(0, 3));
  144. BOOST_TEST(a != b);
  145. BOOST_TEST(b != a);
  146. auto c = make(Tag(), axis::integer<>(0, 2));
  147. BOOST_TEST(b != c);
  148. BOOST_TEST(c != b);
  149. BOOST_TEST(a == c);
  150. BOOST_TEST(c == a);
  151. auto d = make(Tag(), axis::regular<>(2, 0, 1));
  152. BOOST_TEST(c != d);
  153. BOOST_TEST(d != c);
  154. c(0);
  155. BOOST_TEST(a != c);
  156. BOOST_TEST(c != a);
  157. a(0);
  158. BOOST_TEST(a == c);
  159. BOOST_TEST(c == a);
  160. a(0);
  161. BOOST_TEST(a != c);
  162. BOOST_TEST(c != a);
  163. }
  164. // 1D
  165. {
  166. auto h = make(Tag(), axis::integer<int, axis::null_type>{0, 2});
  167. h(0);
  168. auto i = h(0);
  169. BOOST_TEST(i == h.begin() + 1); // +1 because of underflow
  170. i = h(-1);
  171. BOOST_TEST(i == h.begin()); // underflow
  172. i = h(10);
  173. BOOST_TEST(i == h.end() - 1); // overflow
  174. BOOST_TEST_EQ(h.rank(), 1);
  175. BOOST_TEST_EQ(h.axis().size(), 2);
  176. BOOST_TEST_EQ(algorithm::sum(h), 4);
  177. BOOST_TEST_EQ(h.at(-1), 1);
  178. BOOST_TEST_EQ(h.at(0), 2);
  179. BOOST_TEST_EQ(h.at(1), 0);
  180. BOOST_TEST_EQ(h.at(2), 1);
  181. }
  182. // 1D no *flow
  183. {
  184. auto h = make(Tag(), axis::integer<int, axis::null_type, axis::option::none_t>(0, 2));
  185. h(0);
  186. auto i = h(-0);
  187. BOOST_TEST(i == h.begin());
  188. i = h(-1);
  189. BOOST_TEST(i == h.end());
  190. i = h(10);
  191. BOOST_TEST(i == h.end());
  192. BOOST_TEST_EQ(h.rank(), 1);
  193. BOOST_TEST_EQ(h.axis().size(), 2);
  194. BOOST_TEST_EQ(algorithm::sum(h), 2);
  195. BOOST_TEST_EQ(h.at(0), 2);
  196. BOOST_TEST_EQ(h.at(1), 0);
  197. }
  198. // 1D category axis
  199. {
  200. auto h = make(Tag(), axis::category<>({1, 2}));
  201. h(1);
  202. h(2);
  203. h(4);
  204. h(5);
  205. BOOST_TEST_EQ(h.rank(), 1);
  206. BOOST_TEST_EQ(h.axis().size(), 2);
  207. BOOST_TEST_EQ(algorithm::sum(h), 4);
  208. BOOST_TEST_EQ(h.at(0), 1);
  209. BOOST_TEST_EQ(h.at(1), 1);
  210. BOOST_TEST_EQ(h.at(2), 2); // overflow bin
  211. }
  212. // 1D weight
  213. {
  214. auto h = make_s(Tag(), weight_storage(), axis::integer<>(0, 2));
  215. h(-1);
  216. h(0);
  217. h(weight(0.5), 0);
  218. h(1);
  219. h(weight(2), 2);
  220. BOOST_TEST_EQ(algorithm::sum(h).value(), 5.5);
  221. BOOST_TEST_EQ(algorithm::sum(h).variance(), 7.25);
  222. BOOST_TEST_EQ(h[-1].value(), 1);
  223. BOOST_TEST_EQ(h[-1].variance(), 1);
  224. BOOST_TEST_EQ(h[0].value(), 1.5);
  225. BOOST_TEST_EQ(h[0].variance(), 1.25);
  226. BOOST_TEST_EQ(h[1].value(), 1);
  227. BOOST_TEST_EQ(h[1].variance(), 1);
  228. BOOST_TEST_EQ(h[2].value(), 2);
  229. BOOST_TEST_EQ(h[2].variance(), 4);
  230. }
  231. // 1D profile
  232. {
  233. auto h = make_s(Tag(), profile_storage(), axis::integer<>(0, 2));
  234. h(0, sample(1));
  235. h(0, sample(2));
  236. h(0, sample(3));
  237. h(sample(4), 1);
  238. h(sample(5), 1);
  239. h(sample(6), 1);
  240. BOOST_TEST_EQ(h[0].count(), 3);
  241. BOOST_TEST_EQ(h[0].value(), 2);
  242. BOOST_TEST_EQ(h[0].variance(), 1);
  243. BOOST_TEST_EQ(h[1].count(), 3);
  244. BOOST_TEST_EQ(h[1].value(), 5);
  245. BOOST_TEST_EQ(h[1].variance(), 1);
  246. }
  247. // 1D weighted profile
  248. {
  249. auto h = make_s(Tag(), weighted_profile_storage(), axis::integer<>(0, 2));
  250. h(0, sample(1));
  251. h(sample(1), 0);
  252. h(0, weight(2), sample(3));
  253. h(0, sample(5), weight(2));
  254. h(weight(2), 1, sample(1));
  255. h(sample(2), 1, weight(2));
  256. h(weight(2), sample(3), 1);
  257. h(sample(4), weight(2), 1);
  258. BOOST_TEST_EQ(h[0].sum_of_weights(), 6);
  259. BOOST_TEST_EQ(h[0].value(), 3);
  260. BOOST_TEST_EQ(h[1].sum_of_weights(), 8);
  261. BOOST_TEST_EQ(h[1].value(), 2.5);
  262. }
  263. // 2D
  264. {
  265. auto h = make(Tag(), axis::integer<>(-1, 1),
  266. axis::integer<int, axis::null_type, axis::option::none_t>(-1, 2));
  267. h(-1, -1);
  268. h(-1, 0);
  269. h(-1, -10);
  270. h(-10, 0);
  271. BOOST_TEST_EQ(h.rank(), 2);
  272. BOOST_TEST_EQ(h.axis(0_c).size(), 2);
  273. BOOST_TEST_EQ(h.axis(1_c).size(), 3);
  274. BOOST_TEST_EQ(algorithm::sum(h), 3);
  275. BOOST_TEST_EQ(h.at(-1, 0), 0);
  276. BOOST_TEST_EQ(h.at(-1, 1), 1);
  277. BOOST_TEST_EQ(h.at(-1, 2), 0);
  278. BOOST_TEST_EQ(h.at(0, 0), 1);
  279. BOOST_TEST_EQ(h.at(0, 1), 1);
  280. BOOST_TEST_EQ(h.at(0, 2), 0);
  281. BOOST_TEST_EQ(h.at(1, 0), 0);
  282. BOOST_TEST_EQ(h.at(1, 1), 0);
  283. BOOST_TEST_EQ(h.at(1, 2), 0);
  284. BOOST_TEST_EQ(h.at(2, 0), 0);
  285. BOOST_TEST_EQ(h.at(2, 1), 0);
  286. BOOST_TEST_EQ(h.at(2, 2), 0);
  287. }
  288. // 2D weight
  289. {
  290. auto h = make_s(Tag(), weight_storage(), axis::integer<>(-1, 1),
  291. axis::integer<int, axis::null_type, axis::option::none_t>(-1, 2));
  292. h(-1, 0); // -> 0, 1
  293. h(weight(10), -1, -1); // -> 0, 0
  294. h(weight(5), -1, -10); // is ignored
  295. h(weight(7), -10, 0); // -> -1, 1
  296. BOOST_TEST_EQ(algorithm::sum(h).value(), 18);
  297. BOOST_TEST_EQ(algorithm::sum(h).variance(), 150);
  298. BOOST_TEST_EQ(h.at(-1, 0).value(), 0);
  299. BOOST_TEST_EQ(h.at(-1, 1).value(), 7);
  300. BOOST_TEST_EQ(h.at(-1, 2).value(), 0);
  301. BOOST_TEST_EQ(h.at(0, 0).value(), 10);
  302. BOOST_TEST_EQ(h.at(0, 1).value(), 1);
  303. BOOST_TEST_EQ(h.at(0, 2).value(), 0);
  304. BOOST_TEST_EQ(h.at(1, 0).value(), 0);
  305. BOOST_TEST_EQ(h.at(1, 1).value(), 0);
  306. BOOST_TEST_EQ(h.at(1, 2).value(), 0);
  307. BOOST_TEST_EQ(h.at(2, 0).value(), 0);
  308. BOOST_TEST_EQ(h.at(2, 1).value(), 0);
  309. BOOST_TEST_EQ(h.at(2, 2).value(), 0);
  310. BOOST_TEST_EQ(h.at(-1, 0).variance(), 0);
  311. BOOST_TEST_EQ(h.at(-1, 1).variance(), 49);
  312. BOOST_TEST_EQ(h.at(-1, 2).variance(), 0);
  313. BOOST_TEST_EQ(h.at(0, 0).variance(), 100);
  314. BOOST_TEST_EQ(h.at(0, 1).variance(), 1);
  315. BOOST_TEST_EQ(h.at(0, 2).variance(), 0);
  316. BOOST_TEST_EQ(h.at(1, 0).variance(), 0);
  317. BOOST_TEST_EQ(h.at(1, 1).variance(), 0);
  318. BOOST_TEST_EQ(h.at(1, 2).variance(), 0);
  319. BOOST_TEST_EQ(h.at(2, 0).variance(), 0);
  320. BOOST_TEST_EQ(h.at(2, 1).variance(), 0);
  321. BOOST_TEST_EQ(h.at(2, 2).variance(), 0);
  322. }
  323. // 3D weight
  324. {
  325. auto h = make_s(Tag(), weight_storage(), axis::integer<>(0, 3), axis::integer<>(0, 4),
  326. axis::integer<>(0, 5));
  327. for (auto i = 0; i < h.axis(0_c).size(); ++i)
  328. for (auto j = 0; j < h.axis(1_c).size(); ++j)
  329. for (auto k = 0; k < h.axis(2_c).size(); ++k) h(i, j, k, weight(i + j + k));
  330. for (auto i = 0; i < h.axis(0_c).size(); ++i) {
  331. for (auto j = 0; j < h.axis(1_c).size(); ++j) {
  332. for (auto k = 0; k < h.axis(2_c).size(); ++k) {
  333. BOOST_TEST_EQ(h.at(i, j, k).value(), i + j + k);
  334. BOOST_TEST_EQ(h.at(i, j, k).variance(), (i + j + k) * (i + j + k));
  335. }
  336. }
  337. }
  338. }
  339. // STL support
  340. {
  341. auto v = std::vector<int>{0, 1, 2};
  342. auto h = std::for_each(v.begin(), v.end(), make(Tag(), axis::integer<>(0, 3)));
  343. BOOST_TEST_EQ(h.at(0), 1);
  344. BOOST_TEST_EQ(h.at(1), 1);
  345. BOOST_TEST_EQ(h.at(2), 1);
  346. BOOST_TEST_EQ(algorithm::sum(h), 3);
  347. auto a = std::vector<double>();
  348. // walks over all bins, including underflow and overflow
  349. std::partial_sum(h.begin(), h.end(), std::back_inserter(a));
  350. BOOST_TEST_EQ(a.size(), 5);
  351. BOOST_TEST_EQ(a[0], 0);
  352. BOOST_TEST_EQ(a[1], 1);
  353. BOOST_TEST_EQ(a[2], 2);
  354. BOOST_TEST_EQ(a[3], 3);
  355. BOOST_TEST_EQ(a[4], 3);
  356. }
  357. // histogram_reset
  358. {
  359. auto h = make(Tag(), axis::integer<int, axis::null_type, axis::option::none_t>(0, 2));
  360. h(0);
  361. h(1);
  362. BOOST_TEST_EQ(h.at(0), 1);
  363. BOOST_TEST_EQ(h.at(1), 1);
  364. BOOST_TEST_EQ(algorithm::sum(h), 2);
  365. h.reset();
  366. BOOST_TEST_EQ(h.at(0), 0);
  367. BOOST_TEST_EQ(h.at(1), 0);
  368. BOOST_TEST_EQ(algorithm::sum(h), 0);
  369. }
  370. // using containers or input and output
  371. {
  372. auto h = make_s(Tag(), weight_storage(), axis::integer<>(0, 2),
  373. axis::integer<double>(2, 4));
  374. // tuple in
  375. h(std::make_tuple(0, 2.0));
  376. h(std::make_tuple(1, 3.0));
  377. auto i00 = std::make_tuple(0, 0);
  378. auto i11 = std::make_tuple(1, 1);
  379. // tuple out
  380. BOOST_TEST_EQ(h.at(i00).value(), 1);
  381. BOOST_TEST_EQ(h[i00].value(), 1);
  382. BOOST_TEST_EQ(h[i11].value(), 1);
  383. // iterable out
  384. int j11[] = {1, 1};
  385. BOOST_TEST_EQ(h.at(j11), 1);
  386. BOOST_TEST_EQ(h[j11], 1);
  387. int j111[] = {1, 1, 1};
  388. boost::ignore_unused(j111);
  389. BOOST_TEST_THROWS((void)h.at(j111), std::invalid_argument);
  390. int j13[] = {1, 3};
  391. boost::ignore_unused(j13);
  392. BOOST_TEST_THROWS((void)h.at(j13), std::out_of_range);
  393. // tuple with weight
  394. h(std::make_tuple(weight(2), 0, 2.0));
  395. h(std::make_tuple(1, 3.0, weight(2)));
  396. BOOST_TEST_EQ(h.at(i00).value(), 3);
  397. BOOST_TEST_EQ(h[i00].value(), 3);
  398. BOOST_TEST_EQ(h.at(i11).variance(), 5);
  399. BOOST_TEST_EQ(h[i11].variance(), 5);
  400. // test special case of 1-dimensional histogram, which should unpack
  401. // 1-dimensional tuple normally, but forward larger tuples to the axis
  402. auto h1 = make(Tag(), axis::integer<>(0, 2));
  403. h1(std::make_tuple(0)); // as if one had passed 0 directly
  404. BOOST_TEST_EQ(h1.at(std::make_tuple(0)), 1); // as if one had passed 0 directly
  405. }
  406. // bad bin access
  407. {
  408. auto h = make(Tag(), axis::integer<>(0, 1), axis::integer<>(0, 1));
  409. BOOST_TEST_THROWS(h.at(0, 2), std::out_of_range);
  410. BOOST_TEST_THROWS(h.at(std::make_tuple(2, 0)), std::out_of_range);
  411. }
  412. // pass histogram to function
  413. {
  414. auto h = make(Tag(), axis::integer<>(0, 3));
  415. h(1);
  416. pass_histogram(h);
  417. }
  418. // allocator support
  419. {
  420. tracing_allocator_db db;
  421. {
  422. tracing_allocator<char> a(db);
  423. auto h = make_s(Tag(), std::vector<int, tracing_allocator<int>>(a),
  424. axis::integer<>(0, 1000));
  425. h(0);
  426. }
  427. // int allocation for std::vector
  428. BOOST_TEST_EQ(db.at<int>().first, 0);
  429. BOOST_TEST_EQ(db.at<int>().second, 1002);
  430. if (Tag()) { // axis::variant allocation, only for dynamic histogram
  431. using T = axis::variant<axis::integer<>>;
  432. BOOST_TEST_EQ(db.at<T>().first, 0);
  433. // may be zero if vector uses small-vector-optimisation
  434. BOOST_TEST_LE(db.at<T>().second, 1);
  435. }
  436. }
  437. }
  438. int main() {
  439. run_tests<static_tag>();
  440. run_tests<dynamic_tag>();
  441. return boost::report_errors();
  442. }