|
libbf
0.1
|
| A vector of bits | |
| An lvalue proxy for single bits | |
| The abstract Bloom filter interface | |
| The basic Bloom filter | |
| The bitwise Bloom filter | |
| The counting Bloom filter | |
| A spectral Bloom filter with minimum increase (MI) policy | |
| A stable Bloom filter | |
| A spectral Bloom filter with recurring minimum (RM) policy | |
| The fixed width storage policy implements a bit vector where each cell represents a counter having a fixed number of bits | |
| A hasher which hashes an object k times | |
| A hasher which hashes an object two times and generates k digests through a linear combinations of the two digests | |
| An implementation of the H3 hash function family | |
| Wraps sequential data to be used in hashing | |
1.8.3.1