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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
|
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <stdbool.h>
#include <limits.h>
#include <bitset/index.h>
#include "unit.h"
enum { NUMS_SIZE = 1 << 16 };
static
void test_resize(void)
{
header();
struct bitset_index index;
fail_unless(bitset_index_create(&index, realloc) == 0);
struct bitset_iterator it;
bitset_iterator_create(&it, realloc);
struct bitset_expr expr;
bitset_expr_create(&expr, realloc);
size_t key = 23411111;
size_t value = 2321321;
bitset_index_insert(&index, &key, sizeof(key), value);
fail_unless(bitset_index_expr_equals(&expr, &key, sizeof(key)) == 0);
fail_unless(bitset_index_init_iterator(&index, &it, &expr) == 0);
fail_unless(bitset_iterator_next(&it) == value);
fail_unless(bitset_iterator_next(&it) == SIZE_MAX);
bitset_expr_destroy(&expr);
bitset_iterator_destroy(&it);
bitset_index_destroy(&index);
footer();
}
static
void test_size_and_count(void)
{
header();
struct bitset_index index;
fail_unless(bitset_index_create(&index, realloc) == 0);
enum { P = 10, SIZE = (1 << P) + 1 };
for(size_t i = 0; i < SIZE; i++) {
bitset_index_insert(&index, &i, sizeof(i), i);
}
fail_unless(bitset_index_size(&index) == SIZE);
fail_unless(bitset_index_count(&index, 0) == SIZE / 2);
fail_unless(bitset_index_count(&index, 1) == SIZE / 2);
fail_unless(bitset_index_count(&index, 4) == SIZE / 2);
fail_unless(bitset_index_count(&index, P) == 1);
fail_unless(bitset_index_count(&index, P + 1) == 0);
fail_unless(bitset_index_count(&index, 2147483648) == 0);
bitset_index_destroy(&index);
footer();
}
static
void check_keys(struct bitset_index *index,
size_t *keys, size_t *values, size_t size)
{
struct bitset_iterator it;
bitset_iterator_create(&it, realloc);
struct bitset_expr expr;
bitset_expr_create(&expr, realloc);
printf("Checking keys... ");
for (size_t i = 0; i < size; i++) {
/* ignore removed keys */
if (keys[i] == SIZE_MAX) {
continue;
}
fail_unless(bitset_index_expr_equals(&expr, &keys[i],
sizeof(keys[i])) == 0);
fail_unless(bitset_index_init_iterator(index, &it, &expr) == 0);
size_t pos;
bool pair_found = false;
while ( (pos = bitset_iterator_next(&it)) != SIZE_MAX) {
if (pos == values[i]) {
pair_found = true;
break;
}
}
fail_unless(pair_found);
}
printf("ok\n");
bitset_iterator_destroy(&it);
bitset_expr_destroy(&expr);
}
static
void test_insert_remove(void)
{
header();
struct bitset_index index;
fail_unless(bitset_index_create(&index, realloc) == 0);
size_t NUMS_SIZE = 1 << 11;
size_t *keys = malloc(NUMS_SIZE * sizeof(size_t));
size_t *values = malloc(NUMS_SIZE * sizeof(size_t));
size_t count0 = 0;
size_t count1 = 0;
printf("Generating test set... ");
for(size_t i = 0; i < NUMS_SIZE; i++) {
keys[i] = rand();
values[i] = rand();
count0 += (keys[i] & 1) != 0 ? 1 : 0;
count1 += (keys[i] & 2) != 0 ? 1 : 0;
}
printf("ok\n");
printf("Inserting pairs... ");
for(size_t i = 0; i < NUMS_SIZE; i++) {
bitset_index_insert(&index, &keys[i], sizeof(keys[i]),
values[i]);
}
printf("ok\n");
check_keys(&index, keys, values, NUMS_SIZE);
fail_unless(bitset_index_count(&index, 0) == count0);
fail_unless(bitset_index_count(&index, 1) == count1);
printf("Removing random pairs... ");
for(size_t i = 0; i < NUMS_SIZE; i++) {
if (rand() % 5 == 0) {
bitset_index_remove_value(&index, values[i]);
keys[i] = SIZE_MAX;
}
}
printf("ok\n");
check_keys(&index, keys, values, NUMS_SIZE);
bitset_index_destroy(&index);
free(keys);
free(values);
footer();
}
static
void test_simple(int mode, size_t search_mask)
{
fail_unless(mode >= 0 && mode < 3);
struct bitset_index index;
fail_unless(bitset_index_create(&index, realloc) == 0);
struct bitset_iterator it;
bitset_iterator_create(&it, realloc);
struct bitset_expr expr;
bitset_expr_create(&expr, realloc);
size_t check_count = 0;
for (size_t key = 0; key < NUMS_SIZE; key++) {
bitset_index_insert(&index, &key, sizeof(key), key);
if (mode == 0) {
check_count++;
} else if (mode == 1 && (key & search_mask) == search_mask) {
check_count++;
} else if (mode == 2 && (key & search_mask) != 0) {
check_count++;
}
}
if (mode == 0) {
fail_unless(bitset_index_expr_all(&expr) == 0);
} else if (mode == 1) {
fail_unless(bitset_index_expr_all_set(&expr,
&search_mask, sizeof(search_mask)) == 0);
} else if (mode == 2) {
fail_unless(bitset_index_expr_any_set(&expr,
&search_mask, sizeof(search_mask)) == 0);
}
fail_unless(bitset_index_init_iterator(&index, &it, &expr) == 0);
size_t found_count = 0;
for (size_t key = 0; key < NUMS_SIZE; key++) {
size_t r = bitset_iterator_next(&it);
if (mode == 0) {
fail_unless(key == r);
found_count++;
} else if (mode == 1 && (key & search_mask) == search_mask) {
found_count++;
} else if (mode == 2 && (key & search_mask) != 0){
found_count++;
}
}
fail_unless(bitset_iterator_next(&it) == SIZE_MAX);
fail_unless(found_count == check_count);
bitset_expr_destroy(&expr);
bitset_iterator_destroy(&it);
bitset_index_destroy(&index);
}
static void
test_empty_simple(void)
{
header();
test_simple(1, 0); /* empty result */
footer();
}
static void
test_all_simple(void)
{
header();
test_simple(0, 0); /* all */
footer();
}
static void
test_all_set_simple(void)
{
header();
size_t search_mask = 66; /* 0b1000010 */
test_simple(1, search_mask); /* all bits set */
footer();
}
static void
test_any_set_simple(void)
{
header();
size_t search_mask = 66; /* 0b1000010 */
test_simple(2, search_mask); /* any bits set */
footer();
}
static
void test_equals_simple(void)
{
header();
struct bitset_index index;
fail_unless(bitset_index_create(&index, realloc) == 0);
struct bitset_iterator it;
bitset_iterator_create(&it, realloc);
struct bitset_expr expr;
bitset_expr_create(&expr, realloc);
size_t mask = ~((size_t ) 7);
for (size_t i = 0; i < NUMS_SIZE; i++) {
size_t key = i & mask;
size_t value = i;
bitset_index_insert(&index, &key, sizeof(key), value);
}
size_t key1 = (rand() % NUMS_SIZE) & mask;
fail_unless(bitset_index_expr_equals(&expr, &key1, sizeof(key1)) == 0);
fail_unless(bitset_index_init_iterator(&index, &it, &expr) == 0);
for (size_t i = key1; i <= (key1 + ~mask); i++) {
fail_unless(i == bitset_iterator_next(&it));
}
fail_unless(bitset_iterator_next(&it) == SIZE_MAX);
bitset_expr_destroy(&expr);
bitset_iterator_destroy(&it);
bitset_index_destroy(&index);
footer();
}
int main(void)
{
setbuf(stdout, NULL);
test_size_and_count();
test_resize();
test_insert_remove();
test_empty_simple();
test_all_simple();
test_all_set_simple();
test_any_set_simple();
test_equals_simple();
return 0;
}
|
