6 * invbloom - implementation of invertible bloom lookup tables.
8 * This code implements a subset of invertible bloom lookup tables
11 * [1] Goodrich, Michael T., and Michael Mitzenmacher. "Invertible bloom
12 * lookup tables." Communication, Control, and Computing (Allerton), 2011
13 * 49th Annual Allerton Conference on. IEEE, 2011.
14 * http://arxiv.org/pdf/1101.2245
19 * #include <ccan/invbloom/invbloom.h>
22 * int main(int argc, char *argv[])
25 * struct invbloom *ib = invbloom_new(NULL, char *, 16, 0);
27 * for (i = 1; i < argc; i++)
28 * invbloom_insert(ib, &argv[i]);
31 * for (i = 1; i < argc; i++)
32 * n += invbloom_get(ib, &argv[i]);
34 * printf("%u out of %u are found\n", n, argc);
37 * for (i = 1; i < argc; i++) {
39 * char **p = invbloom_extract(NULL, ib);
41 * for (j = 1; j < argc; j++) {
47 * printf("%u out of %u were extracted\n", n, argc);
51 int main(int argc, char *argv[])
53 /* Expect exactly one argument */
57 if (strcmp(argv[1], "depends") == 0) {
58 printf("ccan/endian\n");
59 printf("ccan/hash\n");
60 printf("ccan/short_types\n");
62 printf("ccan/typesafe_cb\n");