Struct BloomFilter 

pub struct BloomFilter { /* private fields */ }

Implementations

impl BloomFilter

pub fn new_with_keys(keys: &[Key], fpr: f64) -> Self

Create a new Bloom Filter with the given keys and false positive rate.

Arguments

• keys - A slice of keys to insert into the filter
• fpr - Target false positive rate (e.g., 0.01 for 1%)

Returns

A new BloomFilter instance containing all the provided keys

pub fn point_query(&self, key: Key) -> bool

Perform a point query to check if a key might exist in the filter.

Arguments

• key - The key to search for

Returns

• true if the key might exist (with false positive rate fpr)
• false if the key definitely does not exist

pub fn range_query(&self, start: Key, end: Key) -> bool

Perform a range query to check if any key might exist in the given range [start, end] (inclusive).

Arguments

• start - The start of the range (inclusive)
• end - The end of the range (inclusive)

Returns

• true if at least one key in the range might exist (with false positive rate fpr)
• false if no keys in the range exist

pub fn fpr(&self) -> f64

Get the configured false positive rate.

Returns

The false positive rate (e.g., 0.01 for 1%)

pub fn num_keys(&self) -> usize

Get the number of keys inserted into the filter.