Struct Doorkeeper 

pub struct Doorkeeper { /* private fields */ }

1-bit Bloom filter used as a doorkeeper to filter one-hit wonders.

On first access within an epoch, the doorkeeper sets a bit. Only on the second access does the item get promoted to the Count-Min Sketch. The doorkeeper is cleared whenever the CMS resets (halves).

Implementations

impl Doorkeeper

pub fn new(num_bits: usize) -> Self

Create a new doorkeeper with the specified number of bits.

pub fn with_defaults() -> Self

Create a doorkeeper with the default size (2048 bits).

pub fn check_and_set(&mut self, hash: u64) -> bool

Check if a key has been seen. Returns true if the bit was already set.

pub fn contains(&self, hash: u64) -> bool

Check if a key has been seen without setting.

pub fn clear(&mut self)

Clear all bits.

Trait Implementations

impl Clone for Doorkeeper

fn clone(&self) -> Doorkeeper

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Doorkeeper

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

Formats the value using the given formatter.