Struct BloomFilter 

pub struct BloomFilter { /* private fields */ }

A proper Bloom Filter implementation using a bit vector for memory efficiency. This is used for efficiently checking if a URL has potentially been visited before, reducing the need for expensive lookups in the main visited URLs cache.

Implementations

impl BloomFilter

pub fn new(num_bits: u64, hash_functions: usize) -> Self

Creates a new BloomFilter with the specified capacity and number of hash functions.

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

Adds an item to the BloomFilter.

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

Checks if an item might be in the BloomFilter. Returns true if the item might be in the set, false if it definitely isn’t.