Struct CountMinSketch 

pub struct CountMinSketch { /* private fields */ }

A plain count-min counter array. It carries no aging clock of its own: ShardedCountMinSketch owns the node-wide clock and calls Self::halve, which is what keeps every shard on one cadence.

Implementations

impl CountMinSketch

pub fn new(cols: usize) -> Self

A zeroed sketch cols counters wide per row. A cols of 0 is raised to 1 so the modulo is always defined.

pub fn increment(&mut self, key: &Hash)

Record one access to key, saturating each row’s counter rather than wrapping.

pub fn halve(&mut self, times: u32)

Age every counter by times halvings. A times at or past the counter width drains the counter to zero — a shard cold for that many windows has nothing left to age — rather than overflowing the shift.

pub fn estimate(&self, key: &Hash) -> u8

The count-min estimate for key: the smallest of its per-row counters, which bounds the collision overcount.

Trait Implementations

impl Debug for CountMinSketch

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

Formats the value using the given formatter.