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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
|
// $Id: SimpleTest.cc 113 2008-09-07 15:25:51Z tb $
/*
* STX B+ Tree Template Classes v0.8.3
* Copyright (C) 2008 Timo Bingmann
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by the
* Free Software Foundation; either version 2.1 of the License, or (at your
* option) any later version.
*
* This library 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 Lesser General Public License
* for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <cppunit/extensions/HelperMacros.h>
#include <stdlib.h>
#include <stx/btree_multiset.h>
#include <stx/btree_multimap.h>
#include <stx/btree_map.h>
class SimpleTest : public CPPUNIT_NS::TestFixture
{
CPPUNIT_TEST_SUITE( SimpleTest );
CPPUNIT_TEST(test_empty);
CPPUNIT_TEST(test_set_insert_erase_320);
CPPUNIT_TEST(test_set_insert_erase_320_descending);
CPPUNIT_TEST(test_map_insert_erase_320);
CPPUNIT_TEST(test_map_insert_erase_320_descending);
CPPUNIT_TEST(test2_map_insert_erase_strings);
CPPUNIT_TEST(test_set_100000_uint64);
CPPUNIT_TEST_SUITE_END();
protected:
struct traits_nodebug
{
static const bool selfverify = true;
static const bool debug = false;
static const int leafslots = 8;
static const int innerslots = 8;
};
void test_empty()
{
typedef stx::btree_multiset<unsigned int,
std::less<unsigned int>, struct traits_nodebug> btree_type;
btree_type bt, bt2;
bt.verify();
CPPUNIT_ASSERT( bt.erase(42) == false );
CPPUNIT_ASSERT( bt == bt2 );
}
void test_set_insert_erase_320()
{
typedef stx::btree_multiset<unsigned int,
std::less<unsigned int>, struct traits_nodebug> btree_type;
btree_type bt;
bt.verify();
srand(34234235);
for(unsigned int i = 0; i < 320; i++)
{
CPPUNIT_ASSERT(bt.size() == i);
bt.insert(rand() % 100);
CPPUNIT_ASSERT(bt.size() == i + 1);
}
srand(34234235);
for(unsigned int i = 0; i < 320; i++)
{
CPPUNIT_ASSERT(bt.size() == 320 - i);
CPPUNIT_ASSERT( bt.erase_one(rand() % 100) );
CPPUNIT_ASSERT(bt.size() == 320 - i - 1);
}
CPPUNIT_ASSERT( bt.empty() );
}
void test_set_insert_erase_320_descending()
{
typedef stx::btree_multiset<unsigned int,
std::greater<unsigned int>, struct traits_nodebug> btree_type;
btree_type bt;
srand(34234235);
for(unsigned int i = 0; i < 320; i++)
{
CPPUNIT_ASSERT(bt.size() == i);
bt.insert(rand() % 100);
CPPUNIT_ASSERT(bt.size() == i + 1);
}
srand(34234235);
for(unsigned int i = 0; i < 320; i++)
{
CPPUNIT_ASSERT(bt.size() == 320 - i);
CPPUNIT_ASSERT( bt.erase_one(rand() % 100) );
CPPUNIT_ASSERT(bt.size() == 320 - i - 1);
}
CPPUNIT_ASSERT( bt.empty() );
}
void test_map_insert_erase_320()
{
typedef stx::btree_multimap<unsigned int, std::string,
std::less<unsigned int>, struct traits_nodebug> btree_type;
btree_type bt;
srand(34234235);
for(unsigned int i = 0; i < 320; i++)
{
CPPUNIT_ASSERT(bt.size() == i);
bt.insert2(rand() % 100, "101");
CPPUNIT_ASSERT(bt.size() == i + 1);
}
srand(34234235);
for(unsigned int i = 0; i < 320; i++)
{
CPPUNIT_ASSERT(bt.size() == 320 - i);
CPPUNIT_ASSERT( bt.erase_one(rand() % 100) );
CPPUNIT_ASSERT(bt.size() == 320 - i - 1);
}
CPPUNIT_ASSERT( bt.empty() );
bt.verify();
}
void test_map_insert_erase_320_descending()
{
typedef stx::btree_multimap<unsigned int, std::string,
std::greater<unsigned int>, struct traits_nodebug> btree_type;
btree_type bt;
srand(34234235);
for(unsigned int i = 0; i < 320; i++)
{
CPPUNIT_ASSERT(bt.size() == i);
bt.insert2(rand() % 100, "101");
CPPUNIT_ASSERT(bt.size() == i + 1);
}
srand(34234235);
for(unsigned int i = 0; i < 320; i++)
{
CPPUNIT_ASSERT(bt.size() == 320 - i);
CPPUNIT_ASSERT( bt.erase_one(rand() % 100) );
CPPUNIT_ASSERT(bt.size() == 320 - i - 1);
}
CPPUNIT_ASSERT( bt.empty() );
bt.verify();
}
void test2_map_insert_erase_strings()
{
typedef stx::btree_multimap<std::string, unsigned int,
std::less<std::string>, struct traits_nodebug> btree_type;
std::string letters = "abcdefghijklmnopqrstuvwxyz";
btree_type bt;
for(unsigned int a = 0; a < letters.size(); ++a)
{
for(unsigned int b = 0; b < letters.size(); ++b)
{
bt.insert2(std::string(1, letters[a]) + letters[b],
a * letters.size() + b);
}
}
for(unsigned int b = 0; b < letters.size(); ++b)
{
for(unsigned int a = 0; a < letters.size(); ++a)
{
std::string key = std::string(1, letters[a]) + letters[b];
CPPUNIT_ASSERT( bt.find(key)->second == a * letters.size() + b );
CPPUNIT_ASSERT( bt.erase_one(key) );
}
}
CPPUNIT_ASSERT( bt.empty() );
bt.verify();
}
typedef unsigned char uint8_t;
typedef unsigned long long uint64_t;
void test_set_100000_uint64()
{
stx::btree_map<uint64_t, uint8_t> bt;
for(uint64_t i = 10; i < 100000; ++i)
{
uint64_t key = i % 1000;
if (bt.find(key) == bt.end())
{
bt.insert( std::make_pair(key, key % 100) );
}
}
CPPUNIT_ASSERT( bt.size() == 1000 );
}
};
CPPUNIT_TEST_SUITE_REGISTRATION( SimpleTest );
|
