Crate flit

This crate provides a couple of simple varieties of Bloom filters:

• BloomFilter is a standard Bloom filter implementation. Items can be added to the filter, but cannot be removed. It is a very space-efficient data structure.
• CountingBloomFilter (not yet implemented) is a Counting Bloom filter implementation. Items can both be added and removed. The trade off is that it has much higher space requirements than a standard Bloom filter.

Re-exports

pub use bloom_filter::BloomFilter;

Modules

bloom_filter

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%.