void test_bloom_query()
{
int size = 8;
int hashes = 4;
char string[] = "test";
bloom_filter_t filter;
filter = bloom_new(size, hashes);
bloom_insert(&filter, string, 4);
int res = bloom_query(&filter, string, 4);
ok(
res == 1,
"bloom_query ok."
) |
diag(
"Expected %d got %d.",
1,
res
);
}
int
main(int argc, char **argv)
{
bloom_filter bf;
int bsz;
long long rll;
int n_inserted;
long long *testnums;
int matched = 0;
int i;
if(argc < 2) {
printf("Usage:\n ./bloom_test <bitmap_size> <random_num_seed>\n");
exit(1);
}
bsz = atoi(argv[1]);
/* initialize random number generator's seed*/
if (argc > 2) {
srandom(atoi(argv[2]));
}
n_inserted = bsz/10;
testnums = (long long *)malloc(sizeof(long long)*n_inserted);
/*generate n_inserted random numbers (of long long type)
insert them into bloom filter*/
bf = bloom_init(bsz);
for (i = 0; i < n_inserted; i++) {
rll = (long long) random();
rll = rll << 31 | random();
testnums[i] = rll;
bloom_add(bf, rll);
}
/*check if all the n_inserted numbers are present in the
bloom filter using bloom_query*/
for (i = 0; i < n_inserted; i++) {
if (!bloom_query(bf, testnums[i])) {
printf("%lld inserted, but not present according to bloom_query\n", testnums[i]);
exit(1);
}
}
/*generate n_inserted*100 random numbers and check if any of them is
in the bloom filter*/
for (i = 0; i < n_inserted*100; i++) {
rll = (long long) random();
rll = rll << 31 | random();
if (bloom_query(bf, rll)) {
matched++;
}
}
printf("false positive %d/%d\n", matched, n_inserted*100);
/* print the first 1024 bits of bloom filter*/
bloom_print(bf, 1024);
return 0;
}
