1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Library General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
* IntervalTest.cpp
* Test fixture for the ValueInterval class.
* Copyright (C) 2011 Simon Newton
*/
#include <cppunit/extensions/HelperMacros.h>
#include "tools/ola_trigger/Action.h"
#include "ola/testing/TestUtils.h"
class IntervalTest: public CppUnit::TestFixture {
CPPUNIT_TEST_SUITE(IntervalTest);
CPPUNIT_TEST(testLowerUpper);
CPPUNIT_TEST(testContains);
CPPUNIT_TEST(testIntersects);
CPPUNIT_TEST(testLessThan);
CPPUNIT_TEST_SUITE_END();
public:
void testLowerUpper();
void testContains();
void testIntersects();
void testLessThan();
};
CPPUNIT_TEST_SUITE_REGISTRATION(IntervalTest);
/**
* Check that lower and upper work.
*/
void IntervalTest::testLowerUpper() {
ValueInterval interval(0, 10);
OLA_ASSERT_EQ(static_cast<uint8_t>(0), interval.Lower());
OLA_ASSERT_EQ(static_cast<uint8_t>(10), interval.Upper());
}
/**
* Check that contains works
*/
void IntervalTest::testContains() {
ValueInterval interval(0, 10);
for (uint8_t i = 0; i <= 10; i++)
OLA_ASSERT(interval.Contains(i));
OLA_ASSERT_FALSE(interval.Contains(11));
ValueInterval interval2(10, 10);
OLA_ASSERT_FALSE(interval2.Contains(0));
OLA_ASSERT_FALSE(interval2.Contains(9));
OLA_ASSERT(interval2.Contains(10));
OLA_ASSERT_FALSE(interval2.Contains(11));
ValueInterval interval3(234, 255);
OLA_ASSERT_FALSE(interval3.Contains(0));
OLA_ASSERT_FALSE(interval3.Contains(233));
for (uint8_t i = 234; i != 0; i++)
OLA_ASSERT(interval3.Contains(i));
}
/**
* Check that Intersects works
*/
void IntervalTest::testIntersects() {
ValueInterval interval(0, 10);
ValueInterval interval2(10, 10);
ValueInterval interval3(5, 6);
ValueInterval interval4(11, 20);
OLA_ASSERT(interval.Intersects(interval2));
OLA_ASSERT(interval2.Intersects(interval));
OLA_ASSERT(interval.Intersects(interval3));
OLA_ASSERT(interval3.Intersects(interval));
OLA_ASSERT_FALSE(interval2.Intersects(interval3));
OLA_ASSERT_FALSE(interval2.Intersects(interval4));
OLA_ASSERT_FALSE(interval.Intersects(interval4));
OLA_ASSERT(interval.Intersects(interval));
OLA_ASSERT(interval2.Intersects(interval2));
OLA_ASSERT(interval3.Intersects(interval3));
OLA_ASSERT(interval4.Intersects(interval4));
}
/**
* Check the less than operator works.
*/
void IntervalTest::testLessThan() {
ValueInterval interval1(0, 10);
ValueInterval interval2(11, 12);
ValueInterval interval3(14, 15);
OLA_ASSERT(interval1 < interval2);
OLA_ASSERT(interval1 < interval3);
OLA_ASSERT(interval2 < interval3);
OLA_ASSERT_FALSE((interval2 < interval1));
OLA_ASSERT_FALSE((interval3 < interval2));
OLA_ASSERT_FALSE((interval3 < interval1));
}
|
