Struct Bloom64 

pub struct Bloom64(pub u64);

64-bit Bloom filter with 4 hash functions.

Capacity for ~8 distinct keys at ~3% false-positive rate. Beyond that the filter saturates and FPR climbs rapidly.

Tuple Fields

0: u64

Implementations

impl Bloom64

pub const ZERO: Self

pub const SUGGESTED_CAPACITY: usize = 8

Suggested capacity: ~8 keys before FPR climbs past ~3%. (64 bits / 4 hashes / 8 keys -> ~2.4% FPR; at 16 keys FPR is already ~16%.)

pub fn insert<K: Hash + ?Sized>(&mut self, key: &K)

Insert key into the filter.

pub fn might_contain<K: Hash + ?Sized>(&self, key: &K) -> bool

Probabilistic membership: returns false when key is definitely-not-present, true when key might-be-present.

pub fn from_keys<'a, K, I>(keys: I) -> Self

where K: Hash + 'a, I: IntoIterator<Item = &'a K>,

Build from an iterator of keys.

pub fn popcount(&self) -> u32

Number of set bits (informational; high values suggest saturation).

pub fn estimated_fpr(n: usize) -> f64

Approximate false-positive rate assuming n keys inserted.

Trait Implementations

impl Clone for Bloom64

fn clone(&self) -> Bloom64

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Bloom64

impl Debug for Bloom64

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Bloom64

fn default() -> Bloom64

Returns the “default value” for a type.

impl Eq for Bloom64

impl Hash for Bloom64

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Bloom64

fn eq(&self, other: &Bloom64) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Bloom64