1 #include <ccan/tap/tap.h>
2 #include <ccan/jset/jset.c>
4 int main(int argc, char *argv[])
7 JSET_MEMBERS(unsigned long);
14 set = jset_new(struct jset_long);
15 ok1(jset_error(set) == NULL);
17 ok1(jset_set(set, 0) == true);
18 ok1(jset_set(set, 0) == false);
19 ok1(jset_clear(set, 0) == true);
20 ok1(jset_clear(set, 0) == false);
21 ok1(jset_popcount(set, 0, -1) == 0);
22 ok1(jset_nth(set, 0, 0) == 0);
23 ok1(jset_nth(set, 0, -1) == (size_t)-1);
24 ok1(jset_first(set) == 0);
25 ok1(jset_last(set) == 0);
26 ok1(jset_first_clear(set) == 1);
27 ok1(jset_last_clear(set) == (size_t)-1);
28 ok1(jset_prev_clear(set, 1) == 0);
29 ok1(jset_next_clear(set, 1) == 2);
30 ok1(jset_next_clear(set, -1) == 0);
32 /* Set a million bits, 16 bits apart. */
33 for (i = 0; i < 1000000; i++)
34 jset_set(set, 1 + (i << 4));
36 /* This only take 1.7MB on my 32-bit system. */
37 diag("%u bytes memory used\n",
38 (unsigned)Judy1MemUsed(jset_raw_(set)->judy));
40 ok1(jset_popcount(set, 0, -1) == 1000000);
41 ok1(jset_nth(set, 0, -1) == 1);
42 ok1(jset_nth(set, 999999, -1) == 1 + (999999 << 4));
43 ok1(jset_nth(set, 1000000, -1) == (size_t)-1);
44 ok1(jset_first(set) == 1);
45 ok1(jset_last(set) == 1 + (999999 << 4));
46 ok1(jset_first_clear(set) == 2);
47 ok1(jset_last_clear(set) == (size_t)-1);
48 ok1(jset_prev_clear(set, 3) == 2);
49 ok1(jset_prev_clear(set, 2) == 0);
50 ok1(jset_next(set, 1) == 1 + (1 << 4));
51 ok1(jset_next(set, 1 + (999999 << 4)) == 0);
52 ok1(jset_prev(set, 1) == 0);
53 ok1(jset_prev(set, 2) == 1);
54 ok1(jset_error(set) == NULL);
56 /* Test error handling */
57 JU_ERRNO(&jset_raw_(set)->err) = 100;
58 JU_ERRID(&jset_raw_(set)->err) = 991;
59 err = jset_error(set);
61 ok1(strstr(err, "100"));
62 ok1(strstr(err, "991"));
63 ok1(err == jset_raw_(set)->errstr);