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
|
/* Test high bit handling. */
#include <ccan/strset/strset.h>
#include <ccan/strset/strset.c>
#include <ccan/tap/tap.h>
#define NUM 1000
static void encode(char template[3], unsigned int val)
{
assert(val < 255 * 255);
template[0] = (val / 255) + 1;
template[1] = (val % 255) + 1;
template[2] = '\0';
}
static bool in_order(const char *value, unsigned int *count)
{
char template[3];
encode(template, *count);
ok1(streq(value, template));
(*count)++;
return true;
}
static bool in_order_by_2(const char *value, unsigned int *count)
{
char template[3];
encode(template, *count);
ok1(streq(value, template));
(*count) += 2;
return true;
}
static bool dump(const char *value, void *unused)
{
diag("%s", value);
return true;
}
int main(void)
{
struct strset set;
unsigned int i;
char *str[NUM];
plan_tests(NUM + 3 * NUM / 2);
strset_init(&set);
for (i = 0; i < NUM; i++) {
char template[3];
encode(template, i);
str[i] = strdup(template);
}
for (i = 0; i < NUM; i++)
strset_add(&set, str[i]);
strset_iterate(&set, dump, NULL);
/* Iterate. */
i = 0;
strset_iterate(&set, in_order, &i);
/* Preserve order after deletion. */
for (i = 0; i < NUM; i += 2)
ok1(strset_del(&set, str[i]) == str[i]);
i = 1;
strset_iterate(&set, in_order_by_2, &i);
for (i = 1; i < NUM; i += 2)
ok1(strset_del(&set, str[i]) == str[i]);
/* empty traverse. */
strset_iterate(&set, in_order_by_2, (unsigned int *)NULL);
for (i = 0; i < NUM; i++)
free(str[i]);
/* This exits depending on whether all tests passed */
return exit_status();
}
|
