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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
#include <cxxtest/TestSuite.h>
#include "common/stdafx.h"
#include "common/map.h"
class MapTestSuite : public CxxTest::TestSuite
{
public:
void test_empty_clear( void )
{
Common::Map<int, int> container;
TS_ASSERT( container.empty() );
container[0] = 17;
container[1] = 33;
TS_ASSERT( !container.empty() );
container.clear();
TS_ASSERT( container.empty() );
}
void test_contains( void )
{
Common::Map<int, int> container;
container[0] = 17;
container[1] = 33;
TS_ASSERT( container.contains(0) );
TS_ASSERT( container.contains(1) );
TS_ASSERT( !container.contains(17) );
TS_ASSERT( !container.contains(-1) );
}
void test_add_remove( void )
{
Common::Map<int, int> container;
container[0] = 17;
container[1] = 33;
TS_ASSERT( container.contains(1) );
container.erase(1);
TS_ASSERT( !container.contains(1) );
container[1] = 42;
TS_ASSERT( container.contains(1) );
}
void test_lookup( void )
{
Common::Map<int, int> container;
container[0] = 17;
container[1] = -1;
container[2] = 45;
container[3] = 12;
container[4] = 96;
TS_ASSERT_EQUALS( container[0], 17 );
TS_ASSERT_EQUALS( container[1], -1 );
TS_ASSERT_EQUALS( container[2], 45 );
TS_ASSERT_EQUALS( container[3], 12 );
TS_ASSERT_EQUALS( container[4], 96 );
}
void test_merge( void )
{
Common::Map<int, int> mapA, mapB;
mapA[0] = 17;
mapA[1] = 33;
mapA[2] = 45;
mapA[3] = 12;
mapB[1] = -1;
mapB[4] = 96;
mapA.merge(mapB);
TS_ASSERT( mapA.contains(1) );
TS_ASSERT( mapA.contains(4) );
TS_ASSERT_EQUALS( mapA[0], 17 );
TS_ASSERT_EQUALS( mapA[1], -1 );
TS_ASSERT_EQUALS( mapA[2], 45 );
TS_ASSERT_EQUALS( mapA[3], 12 );
TS_ASSERT_EQUALS( mapA[4], 96 );
}
void test_iterator_begin_end( void )
{
Common::Map<int, int> container;
// The container is initially empty ...
TS_ASSERT( container.begin() == container.end() );
// ... then non-empty ...
container[324] = 33;
TS_ASSERT( container.begin() != container.end() );
// ... and again empty.
container.clear();
TS_ASSERT( container.begin() == container.end() );
}
void test_iterator( void )
{
Common::Map<int, int> container;
Common::Map<int, int>::const_iterator iter;
// Fill the container with some random data
container[102] = 17;
container[-37] = 33;
container[324] = -11;
// Iterate over the container and verify that we encounter the elements
// in increasing order
iter = container.begin();
TS_ASSERT( iter->_key == -37 );
TS_ASSERT( iter->_value == 33 );
++iter;
TS_ASSERT( iter != container.end() );
TS_ASSERT( iter->_key == 102 );
TS_ASSERT( iter->_value == 17 );
++iter;
TS_ASSERT( iter != container.end() );
#if 0
// Also test the postinc
TS_ASSERT( iter->_key == 324 );
TS_ASSERT( iter->_value == -11 );
iter++;
TS_ASSERT( iter == container.end() );
#endif
}
// TODO: Add test cases for iterators, find, ...
};
|
