Struct BloomFilter 

pub struct BloomFilter { /* private fields */ }

Bloom Filter - Probabilistic membership test

Space-efficient set membership test with no false negatives but possible false positives (configurable error rate).

Implementations

impl BloomFilter

pub fn new(size: usize, hash_count: usize) -> Self

Create a new Bloom filter

Arguments

• size - Number of bits in the filter
• hash_count - Number of hash functions

Optimal hash_count = (bits / expected_items) * ln(2)

pub fn optimal(expected_items: usize, false_positive_rate: f64) -> Self

Optimal Bloom filter for expected items and false positive rate

pub fn add<T: Hash>(&mut self, element: &T)

Add an element to the filter

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

Check if an element might be in the set

pub fn false_positive_rate(&self) -> f64

Estimate current false positive rate

pub fn stats(&self) -> BloomFilterStats

Get statistics about the Bloom filter

Trait Implementations

impl Clone for BloomFilter

fn clone(&self) -> BloomFilter

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BloomFilter

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.