Structs§
- Bloom
Filter - Straight-forward implementation of a bloom filter on u8 slices. It applies the result of Kirsch and Mitzenmacher [1] of using a simple linear combination of two hash functions without any loss in the asymptotic false positive rate. [1] Kirsch, Mitzenmacher. “Less Hashing, Same Performance: Building a Better Bloom Filter”.
Enums§
- Bloom
Result - Result type for the contains(.) operation