Struct BloomFilter 

pub struct BloomFilter { /* private fields */ }

Implementations

impl BloomFilter

pub fn new(expected_entries: usize) -> Self

Build an empty filter sized for expected_entries at ~1% FPR (10 bits/key, k=7). The 64-bit floor matters when expected_entries is small.

pub fn add(&mut self, key: &str)

pub fn might_contain(&self, key: &str) -> bool

pub fn bit_count(&self) -> u32

pub fn k(&self) -> u32

pub fn write_to<W: Write>(&self, out: &mut W) -> Result<()>

pub fn parse(buf: &[u8]) -> Result<Self>

Parse a serialised bloom filter from buf. Errors if the buffer is shorter than the header or truncated mid-bits.