libbf
0.1
|
bf::bitvector | A vector of bits |
bf::bitvector::reference | An lvalue proxy for single bits |
bf::bloom_filter | The abstract Bloom filter interface |
bf::basic_bloom_filter | The basic Bloom filter |
bf::bitwise_bloom_filter | The bitwise Bloom filter |
bf::counting_bloom_filter | The counting Bloom filter |
bf::spectral_mi_bloom_filter | A spectral Bloom filter with minimum increase (MI) policy |
bf::stable_bloom_filter | A stable Bloom filter |
bf::spectral_rm_bloom_filter | A spectral Bloom filter with recurring minimum (RM) policy |
bf::counter_vector | The fixed width storage policy implements a bit vector where each cell represents a counter having a fixed number of bits |
bf::default_hash_function | |
bf::default_hasher | A hasher which hashes an object k times |
bf::double_hasher | A hasher which hashes an object two times and generates k digests through a linear combinations of the two digests |
bf::h3< T, N > | An implementation of the H3 hash function family |
bf::object | Wraps sequential data to be used in hashing |
bf::h3< size_t, max_obj_size > |