Crate flit

BloomFilter is a probabilistic data structure that can quickly and definitively conclude that it does not contain an item. On the other hand, it can only conclude that it probably contains an item, i.e., the data structure has an inherent false-positive rate greater than 0%.

Items can be added to the Bloom filter, but cannot be removed - this would introduce false negative cases. If this is required, an alternative might be to use a Counting Bloom filter (not (yet) implemented in this crate).

This implementation is backed by a Rust implementation of the xxHash hashing algorithm, twox-hash.

References

• Less Hashing, Same Performance: Building a Better Bloom Filter
• Wikipedia article
• Bloom Filters by Example
• Bloom Filter Calculator

Structs

BloomFilter

Represents a Bloom filter.