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
|
#include <ccan/tap/tap.h>
#include <ccan/jset/jset.c>
struct foo;
struct jset_foo {
JSET_MEMBERS(struct foo *);
};
static int cmp_ptr(const void *a, const void *b)
{
return *(char **)a - *(char **)b;
}
#define NUM 100
int main(int argc, char *argv[])
{
struct jset_foo *set;
struct foo *foo[NUM];
unsigned int i;
plan_tests(20);
for (i = 0; i < NUM; i++)
foo[i] = malloc(20);
set = jset_new(struct jset_foo);
ok1(jset_error(set) == NULL);
ok1(jset_set(set, foo[0]) == true);
ok1(jset_set(set, foo[0]) == false);
ok1(jset_clear(set, foo[0]) == true);
ok1(jset_clear(set, foo[0]) == false);
ok1(jset_count(set) == 0);
ok1(jset_nth(set, 0, NULL) == (struct foo *)NULL);
ok1(jset_first(set) == (struct foo *)NULL);
ok1(jset_last(set) == (struct foo *)NULL);
for (i = 0; i < NUM; i++)
jset_set(set, foo[i]);
qsort(foo, NUM, sizeof(foo[0]), cmp_ptr);
ok1(jset_count(set) == NUM);
ok1(jset_nth(set, 0, NULL) == foo[0]);
ok1(jset_nth(set, NUM-1, NULL) == foo[NUM-1]);
ok1(jset_nth(set, NUM, NULL) == (struct foo *)NULL);
ok1(jset_first(set) == foo[0]);
ok1(jset_last(set) == foo[NUM-1]);
ok1(jset_next(set, foo[0]) == foo[1]);
ok1(jset_next(set, foo[NUM-1]) == (struct foo *)NULL);
ok1(jset_prev(set, foo[1]) == foo[0]);
ok1(jset_prev(set, foo[0]) == (struct foo *)NULL);
ok1(jset_error(set) == NULL);
jset_free(set);
for (i = 0; i < NUM; i++)
free(foo[i]);
return exit_status();
}
|
