Struct bloom_filters::ClassicBloomFilter

pub struct ClassicBloomFilter<BHK: BuildHashKernels> { /* private fields */ }

Implementations

impl<BHK: BuildHashKernels> Filter<BHK>

pub fn new(items_count: usize, fp_rate: f64, build_hash_kernels: BHK) -> Self

Create a new bloom filter structure. items_count is an estimation of the maximum number of items to store. fp_rate is the wanted rate of false positives, in ]0.0, 1.0[

pub fn with_raw_data(raw_data: &[u8], k: usize, build_hash_kernels: BHK) -> Self

pub fn buckets(&self) -> &Buckets

Trait Implementations

impl<BHK: BuildHashKernels> BloomFilter for Filter<BHK>

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

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

fn reset(&mut self)

impl<BHK: BuildHashKernels> UpdatableBloomFilter for Filter<BHK>

fn update(&mut self, raw_data: &[u8])

Update filter internal buckets with raw_data via BitOr operation