Fast and simple bloom filters in C and Python
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

38 lines
686 B

typedef
struct {
size_t num_elems;
size_t num_ints;
uint32_t *arr;
}
bit_array_t;
typedef
struct {
uint32_t hash_1;
uint32_t hash_2;
}
fnv_hashes_t;
typedef uint32_t* hashes_t;
int printbits(uint32_t, size_t);
int print_barray(bit_array_t*);
bit_array_t* empty_bfilter(int);
fnv_hashes_t hash_fnv(const char*);
uint32_t kth_hash(fnv_hashes_t, uint32_t, size_t);
hashes_t hash(const char *, uint32_t, size_t);
int setbit(bit_array_t*, int);
int unsetbit(bit_array_t*, int);
int bfilter_set(bit_array_t *, const char*, int);
int bfilter_get(bit_array_t *, const char*, int);
int getbit(bit_array_t *, int);
int release_bfilter(bit_array_t *);