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
|
#include <stdio.h>
#include <time.h>
#include <bitset/bitset.h>
#include "unit.h"
static
void test_cardinality()
{
header();
struct tt_bitset bm;
tt_bitset_create(&bm, realloc);
fail_unless(tt_bitset_cardinality(&bm) == 0);
size_t cnt = 0;
fail_if(tt_bitset_set(&bm, 10) < 0);
cnt++;
fail_if(tt_bitset_set(&bm, 15) < 0);
cnt++;
fail_if(tt_bitset_set(&bm, 20) < 0);
cnt++;
fail_unless(tt_bitset_cardinality(&bm) == cnt);
fail_if(tt_bitset_set(&bm, 10) < 0);
fail_unless(tt_bitset_cardinality(&bm) == cnt);
fail_if(tt_bitset_clear(&bm, 20) < 0);
cnt--;
fail_unless(tt_bitset_cardinality(&bm) == cnt);
fail_if(tt_bitset_clear(&bm, 20) < 0);
fail_unless(tt_bitset_cardinality(&bm) == cnt);
fail_if(tt_bitset_clear(&bm, 666) < 0);
fail_unless(tt_bitset_cardinality(&bm) == cnt);
fail_if(tt_bitset_clear(&bm, 10) < 0);
cnt--;
fail_unless(tt_bitset_cardinality(&bm) == cnt);
fail_if(tt_bitset_clear(&bm, 15) < 0);
cnt--;
fail_unless(tt_bitset_cardinality(&bm) == cnt);
tt_bitset_destroy(&bm);
footer();
}
static
void shuffle(size_t *arr, size_t size)
{
if (size <= 1) {
return;
}
for (size_t i = 0; i < (size - 1); i++) {
size_t j = i + rand() / (RAND_MAX / (size - i) + 1);
size_t tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
static
int size_compator(const void *a, const void *b)
{
size_t *aa = (size_t *) a;
size_t *bb = (size_t *) b;
if (*aa < *bb) {
return -1;
} else if (*aa > *bb) {
return 1;
} else {
return 0;
}
}
static
void test_get_set()
{
header();
struct tt_bitset bm;
tt_bitset_create(&bm, realloc);
const size_t NUM_SIZE = (size_t) 1 << 14;
size_t *nums = malloc(NUM_SIZE * sizeof(size_t));
printf("Generating test set... ");
for(size_t i = 0; i < NUM_SIZE; i++) {
nums[i] = rand();
}
/* Remove dups */
qsort(nums, NUM_SIZE, sizeof(size_t), size_compator);
size_t prev = nums[0];
for(size_t i = 1; i < NUM_SIZE; i++) {
if (nums[i] == prev) {
nums[i] = SIZE_MAX;
} else {
prev = nums[i];
}
}
shuffle(nums, NUM_SIZE);
printf("ok\n");
printf("Settings bits... ");
for(size_t i = 0; i < NUM_SIZE; i++) {
if (nums[i] == SIZE_MAX)
continue;
fail_if(tt_bitset_set(&bm, nums[i]) < 0);
}
printf("ok\n");
printf("Checking bits... ");
shuffle(nums, NUM_SIZE);
for(size_t i = 0; i < NUM_SIZE; i++) {
if (nums[i] == SIZE_MAX)
continue;
fail_unless(tt_bitset_test(&bm, nums[i]));
}
printf("ok\n");
printf("Unsetting random bits... ");
for(size_t k = 0; k < (NUM_SIZE >> 3); k++) {
size_t i = rand() % NUM_SIZE;
if (nums[i] == SIZE_MAX)
continue;
fail_if(tt_bitset_clear(&bm, nums[i]) < 0);
fail_if(tt_bitset_test(&bm, nums[i]));
nums[i] = SIZE_MAX;
}
printf("ok\n");
printf("Checking set bits... ");
shuffle(nums, NUM_SIZE);
for(size_t i = 0; i < NUM_SIZE; i++) {
if (nums[i] == SIZE_MAX) {
continue;
}
if (!tt_bitset_test(&bm, nums[i])) {
printf("Fail :%zu\n", nums[i]);
}
fail_unless(tt_bitset_test(&bm, nums[i]));
}
printf("ok\n");
printf("Checking all bits... ");
qsort(nums, NUM_SIZE, sizeof(size_t), size_compator);
size_t *pn = nums;
size_t i_max = MIN(1ULL << 14, RAND_MAX);
for(size_t i = 0; i < i_max; i++) {
if (*pn < SIZE_MAX && *pn == i) {
fail_unless(tt_bitset_test(&bm, *pn));
pn++;
} else {
fail_if(tt_bitset_test(&bm, i));
}
}
printf("ok\n");
printf("Unsetting all bits... ");
shuffle(nums, NUM_SIZE);
for(size_t i = 0; i < NUM_SIZE; i++) {
if (nums[i] == SIZE_MAX) {
continue;
}
fail_if(tt_bitset_clear(&bm, nums[i]) < 0);
}
printf("ok\n");
printf("Checking all bits... ");
for(size_t i = 0; i < i_max; i++) {
fail_if(tt_bitset_test(&bm, i));
}
printf("ok\n");
free(nums);
tt_bitset_destroy(&bm);
footer();
}
int main(int argc, char *argv[])
{
setbuf(stdout, NULL);
srand(time(NULL));
test_cardinality();
test_get_set();
return 0;
}
|
