10 #include <utl/Histogram.h>
11 #include <utl/CountedObject.h>
12 #include <utl/CountedObjectRegistry.h>
14 #include <tst/Verify.h>
15 #include <cppunit/extensions/HelperMacros.h>
21 #define ASSERT_EQUAL(x, y) CPPUNIT_ASSERT(Verify<Equal>(x, y))
22 #define ASSERT_CLOSE(x, y) CPPUNIT_ASSERT(Verify<CloseTo>(x, y))
24 #define ASSERT_OBJECT_COUNTS(o, c, d) \
25 ASSERT_EQUAL(CountedObject<o>::GetObjectsCreated(), c); \
26 ASSERT_EQUAL(CountedObject<o>::GetObjectsDestroyed(), d)
28 #define ASSERT_EXTENDED_OBJECT_COUNTS(o, c, d, cp, a) \
29 ASSERT_OBJECT_COUNTS(o, c, d); \
30 ASSERT_EQUAL(CountedObject<o>::GetObjectsCopied(), cp); \
31 ASSERT_EQUAL(CountedObject<o>::GetObjectsAssigned(), a)
40 CPPUNIT_TEST(testEqualBinning);
41 CPPUNIT_TEST(testVariableBinning);
42 CPPUNIT_TEST(testSharedBinning);
43 CPPUNIT_TEST(testHistogramWrap);
44 CPPUNIT_TEST(testBinEdges);
45 CPPUNIT_TEST_SUITE_END();
55 const double eps = 1e-9;
64 for (
int i = 1; i < 10; ++i) {
70 for (
int i = 0; i < 10; ++i)
76 const double some = 123;
77 vector<double> dataBins(10, some);
85 for (
int i = 0; i < 10; ++i) {
95 const double eps = 1e-9;
97 vector<double> binEdges;
98 for (
int i = 0; i <= 10; ++i)
99 binEdges.push_back(i/10.);
108 for (
int i = 1; i < 10; ++i) {
115 for (
int i = 0; i <= 10; ++i) {
122 const double some = 123;
123 vector<double> dataBins(10, some);
131 for (
int i = 0; i <= 10; ++i) {
146 vector<int> edges(10);
147 for (
int i = 0; i < 10; ++i)
160 edges[0] = edges[1] = edges[2] = 13;
172 vector<unsigned short int> y(n);
173 for (
int i = 0; i < n; ++i) {
216 for (
int i = 0; i < 10; ++i)
219 for (
int i = 0; i < 10; ++i)
void testVariableBinning()
BinLowerEdgesRefType GetBinLowerEdges()
void Fill(const double x)
CPPUNIT_TEST_SUITE_REGISTRATION(testAiresShowerFile)
#define ASSERT_CLOSE(x, y)
const BinType & GetBin(const size_t i) const
#define ASSERT_EQUAL(x, y)
BinEdgeType GetStart() const
BinEdgeType GetStop() const
BinEdgeType GetBinLowerEdge(const size_t bin) const