1 #include <ccan/tap/tap.h>
2 #include <ccan/jbitset/jbitset.c>
4 int main(int argc, char *argv[])
13 ok1(jbit_error(set) == NULL);
15 ok1(jbit_set(set, 0) == true);
16 ok1(jbit_set(set, 0) == false);
17 ok1(jbit_clear(set, 0) == true);
18 ok1(jbit_clear(set, 0) == false);
19 ok1(jbit_popcount(set, 0, -1) == 0);
20 ok1(jbit_nth(set, 0, 0) == 0);
21 ok1(jbit_nth(set, 0, -1) == (size_t)-1);
22 ok1(jbit_first(set, 0) == 0);
23 ok1(jbit_first(set, -1) == (size_t)-1);
24 ok1(jbit_last(set, 0) == 0);
25 ok1(jbit_last(set, -1) == (size_t)-1);
26 ok1(jbit_first_clear(set, -1) == 0);
27 ok1(jbit_first_clear(set, -2) == 0);
28 ok1(jbit_last_clear(set, 0) == (size_t)-1);
29 ok1(jbit_prev_clear(set, 1, -1) == 0);
30 ok1(jbit_next_clear(set, 0, -1) == 1);
31 ok1(jbit_next_clear(set, -1, -1) == -1);
33 /* Set a million bits, 16 bits apart. */
34 for (i = 0; i < 1000000; i++)
35 jbit_set(set, i << 4);
37 /* This only take 1.7MB on my 32-bit system. */
38 diag("%u bytes memory used\n", (unsigned)Judy1MemUsed(set->judy));
40 ok1(jbit_popcount(set, 0, -1) == 1000000);
41 ok1(jbit_nth(set, 0, -1) == 0);
42 ok1(jbit_nth(set, 999999, -1) == 999999 << 4);
43 ok1(jbit_nth(set, 1000000, -1) == (size_t)-1);
44 ok1(jbit_first(set, -1) == 0);
45 ok1(jbit_last(set, -1) == 999999 << 4);
46 ok1(jbit_first_clear(set, -1) == 1);
47 ok1(jbit_last_clear(set, 0) == (size_t)-1);
48 ok1(jbit_prev_clear(set, 1, -1) == (size_t)-1);
49 ok1(jbit_next(set, 0, -1) == 1 << 4);
50 ok1(jbit_next(set, 999999 << 4, -1) == (size_t)-1);
51 ok1(jbit_prev(set, 1, -1) == 0);
52 ok1(jbit_prev(set, 0, -1) == (size_t)-1);
53 ok1(jbit_error(set) == NULL);
55 /* Test error handling */
56 JU_ERRNO(&set->err) = 100;
57 JU_ERRID(&set->err) = 991;
58 err = jbit_error(set);
60 ok1(strstr(err, "100"));
61 ok1(strstr(err, "991"));
62 ok1(err == set->errstr);