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
|
#include <ccan/tap/tap.h>
#include <ccan/jmap/jmap.c>
struct foo;
struct jmap_foo {
JMAP_MEMBERS(unsigned long, struct foo *);
};
#define NUM 100
int main(int argc, char *argv[])
{
struct jmap_foo *map;
struct foo *foo[NUM], **foop;
unsigned long i;
plan_tests(40 + NUM*2 + 19);
for (i = 0; i < NUM; i++)
foo[i] = malloc(20);
map = jmap_new(struct jmap_foo);
ok1(jmap_error(map) == NULL);
ok1(jmap_test(map, 0) == false);
ok1(jmap_get(map, 0) == (struct foo *)NULL);
ok1(jmap_popcount(map, 0, -1) == 0);
ok1(jmap_first(map) == 0);
ok1(jmap_last(map) == 0);
ok1(jmap_del(map, 0) == false);
/* Set only works on existing cases. */
ok1(jmap_set(map, 1, foo[0]) == false);
ok1(jmap_add(map, 1, foo[1]) == true);
ok1(jmap_get(map, 1) == foo[1]);
ok1(jmap_set(map, 1, foo[0]) == true);
ok1(jmap_get(map, 1) == foo[0]);
ok1(jmap_test(map, 1) == true);
ok1(jmap_popcount(map, 0, -1) == 1);
ok1(jmap_first(map) == 1);
ok1(jmap_last(map) == 1);
ok1(jmap_next(map, 0) == 1);
ok1(jmap_next(map, 1) == 0);
ok1(jmap_prev(map, 2) == 1);
ok1(jmap_prev(map, 1) == 0);
ok1(jmap_del(map, 1) == true);
ok1(jmap_test(map, 1) == false);
ok1(jmap_popcount(map, 0, -1) == 0);
for (i = 0; i < NUM; i++)
jmap_add(map, i+1, foo[i]);
ok1(jmap_count(map) == NUM);
ok1(jmap_popcount(map, 0, -1) == NUM);
ok1(jmap_popcount(map, 1, NUM) == NUM);
ok1(jmap_popcount(map, 1, NUM/2) == NUM/2);
ok1(jmap_popcount(map, NUM/2+1, NUM) == NUM - NUM/2);
ok1(jmap_nth(map, 0, -1) == 1);
ok1(jmap_nth(map, NUM-1, -1) == NUM);
ok1(jmap_nth(map, NUM, -1) == (size_t)-1);
ok1(jmap_first(map) == 1);
ok1(jmap_last(map) == NUM);
ok1(jmap_next(map, 1) == 2);
ok1(jmap_next(map, NUM) == 0);
ok1(jmap_prev(map, 2) == 1);
ok1(jmap_prev(map, 1) == 0);
ok1(jmap_get(map, 1) == foo[0]);
ok1(jmap_get(map, NUM) == foo[NUM-1]);
ok1(jmap_get(map, NUM+1) == NULL);
/* Reverse values in map. */
for (i = 0; i < NUM; i++) {
foop = jmap_getval(map, i+1);
ok1(*foop == foo[i]);
*foop = foo[NUM-1-i];
jmap_putval(map, &foop);
}
for (i = 0; i < NUM; i++)
ok1(jmap_get(map, i+1) == foo[NUM-1-i]);
foop = jmap_nthval(map, 0, &i);
ok1(i == 1);
ok1(*foop == foo[NUM-1]);
jmap_putval(map, &foop);
foop = jmap_nthval(map, NUM-1, &i);
ok1(i == NUM);
ok1(*foop == foo[0]);
jmap_putval(map, &foop);
foop = jmap_firstval(map, &i);
ok1(i == 1);
ok1(*foop == foo[NUM-1]);
jmap_putval(map, &foop);
foop = jmap_nextval(map, &i);
ok1(i == 2);
ok1(*foop == foo[NUM-2]);
jmap_putval(map, &foop);
foop = jmap_prevval(map, &i);
ok1(i == 1);
ok1(*foop == foo[NUM-1]);
jmap_putval(map, &foop);
foop = jmap_prevval(map, &i);
ok1(foop == NULL);
foop = jmap_lastval(map, &i);
ok1(i == NUM);
ok1(*foop == foo[0]);
jmap_putval(map, &foop);
foop = jmap_prevval(map, &i);
ok1(i == NUM-1);
ok1(*foop == foo[1]);
jmap_putval(map, &foop);
foop = jmap_nextval(map, &i);
ok1(i == NUM);
ok1(*foop == foo[0]);
jmap_putval(map, &foop);
foop = jmap_nextval(map, &i);
ok1(foop == NULL);
ok1(jmap_error(map) == NULL);
jmap_free(map);
for (i = 0; i < NUM; i++)
free(foo[i]);
return exit_status();
}
|
