Struct libbgs::markoff::BloomFilter

pub struct BloomFilter<T, F> { /* private fields */ }

A Bloom Filter, a probabilistic set. Elements may be added to the filter, and then the filter may be tested for membership, with false positives. The false positivity rate is determined by the size of the Bloom filter and the number of hashes.

Implementations

impl<T, F> BloomFilter<T, F>where F: Fn(&T) -> usize + Send + Sync,

pub fn new(bits: usize, hashes: Vec<F>) -> BloomFilter<T, F>

Create a new Bloom filter, with the given size in bits and the given list of hashes to be applied to all members on addition and query.

pub fn add(&mut self, elem: &T)

Add elem to the Bloom filter.

pub fn is_member_prob(&self, elem: &T) -> bool

True if elem is in the set. If elem is not in the set, this method returns False; i.e., this method return false positives, but not false negatives.

pub fn is_member<G>(&self, elem: &T, confirm: G) -> boolwhere G: Fn(&T) -> bool,

True if elem is in the set, lazily confirming the result with the confirm closure to guard against false positives.

pub fn union(&mut self, other: &Self)

Modifies self to include elements from other. The false positivity rate of the resultant bloom filter will be greater than or equal to the maximum of the false positivity rates of the two operands.

Trait Implementations

impl<T, F> Clone for BloomFilter<T, F>

fn clone(&self) -> BloomFilter<T, F>

Returns a copy of the value.

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

Performs copy-assignment from source.