| bf::a2< Core > | The \(A^2\) Bloom filter |
| bf::basic< Core > | The basic Bloom filter |
| bf::basic_hasher | A basic hasher that computes a hash value using boost::hash |
| bf::bitwise< Core > | The bitwise Bloom filter |
| bf::bloom_filter< Derived > | The Bloom filter interface |
| bf::core< Store, Hash, Partition > | The Bloom filter core class |
| bf::default_hashing< Hasher, Seed > | The default hash policy |
| bf::double_hashing< Hasher, Seed1, Seed2 > | A hash policy that implements double hashing |
| bf::extended_double_hashing< Hasher, Seed1, Seed2 > | A hash policy that implements extended double hashing |
| bf::fixed_seed< Seed > | A seed policy that fixed seed |
| bf::fixed_width< Block, Allocator > | The fixed width storage policy implements a bit vector where each cell itself is a counter with a fixed number of bits |
| bf::hash_policy< Derived > | The base class for hash policies |
| bf::no_partitioning | Do not perform partitioning; use the whole bitvector for all \(k\) hash values |
| bf::partition_policy< Derived > | The base class for partition policies |
| bf::partitioning | Partition the bitvector of size \(m\) in \(k\) sub-vectors of size \(\frac{m}{k}\) |
| bf::random_seed | A seed policy that returns a non-deterministic random seed |
| bf::spectral_mi< Core > | The spectral Bloom filter with minimum increase optimization |
| bf::spectral_rm< Core1, Core2 > | The spectral Bloom filter with recurring minimum optimization |
| bf::stable< Core, Generator > | The stable Bloom filter |
| bf::store_policy< Derived > | The base class for store policies |
1.7.3
