Structs§
- A scalable bloom filter implementation, based on VariantBloomFilter.
- Stable bloom filter, the best choice for small data set. In this structure, k hash functions share a global bitmap, whose max size is u64::MAX. Usage:
- A variant bloom filter, the best choice for bigger data set. In this structure, k hash functions all has it’s own slice of bitmap, whose max size is u64::MAX. Usage:
Traits§
- Interface for bloom filter. Define all the function a bloom filter should implement.