Struct BloomFilter 

pub struct BloomFilter { /* private fields */ }

Bloom filter for membership testing with false positives

Implementations

impl BloomFilter

pub fn new(capacity: usize, false_positive_rate: f64) -> Self

Create a new Bloom filter with optimal parameters for given capacity and false positive rate

pub fn with_parameters(size: usize, hash_functions: usize) -> Self

Create a new Bloom filter with explicit parameters

pub fn insert<T: Hash>(&mut self, item: &T)

Insert an item into the filter

pub fn contains<T: Hash>(&self, item: &T) -> bool

Test if an item might be in the filter (no false negatives, possible false positives)

pub fn false_positive_probability(&self) -> f64

Get the current false positive probability

pub fn len(&self) -> usize

Get the number of items inserted

pub fn is_empty(&self) -> bool

Check if the filter is empty

pub fn clear(&mut self)

Clear the filter

pub fn stats(&self) -> BloomFilterStats

Get filter statistics