Struct BloomFine 

pub struct BloomFine { /* private fields */ }

256-bit Bloom filter with 8 hash functions.

Implementations

impl BloomFine

pub const ZERO: Self

pub const SUGGESTED_CAPACITY: usize = 64

~64 keys before 5% FPR.

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

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

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

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

pub fn popcount(&self) -> u32

Trait Implementations

impl Clone for BloomFine

fn clone(&self) -> BloomFine

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BloomFine

impl Debug for BloomFine

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

Formats the value using the given formatter.

impl Default for BloomFine

fn default() -> BloomFine

Returns the “default value” for a type.

impl Eq for BloomFine

impl PartialEq for BloomFine

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BloomFine