Struct BloomFilter

pub struct BloomFilter { /* private fields */ }

A simple implementation of a Bloom filter backed by BitVec

Implementations

impl BloomFilter

pub fn new<P>( filename: Option<P>, bits: usize, n_hashes: u8, ) -> Result<Self, Error>

where P: AsRef<Path>,

Creates a new BloomFilter (or opens an existing one, if the file already exists) of a given size (in bits) and with a given number of hash functions for each insert (n_hashes). If a filename is not passed, the Bloom filter will be created in memory.

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

where H: Hash,

Insert an item into the Bloom filter.

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

where H: Hash,

Check if an item is in the Bloom filter already.