Struct BloomFilter 

pub struct BloomFilter { /* private fields */ }

Bloom Filter for approximate set membership testing Useful for checking if nodes/edges exist without storing the full set

Implementations

impl BloomFilter

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

Create new Bloom Filter expected_elements: expected number of elements false_positive_rate: desired false positive rate (0.0 - 1.0)

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 Returns true if element might be present (could be false positive) Returns false if element is definitely not present

pub fn false_positive_probability(&self) -> f64

Get current false positive probability estimate

pub fn union(&mut self, other: &BloomFilter) -> Result<()>

Union with another 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.