Struct CardinalitySketch

pub struct CardinalitySketch { /* private fields */ }

HyperLogLog in Practice: Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm Stefan Heule, Marc Nunkesser, Alexander Hall

We use m = 256 which gives a relative error of ~6.5% of the cardinality estimate. We don’t bother with stuffing the counts in 6 bits, byte access is fast.

The bias correction described in the paper is not implemented, so this is somewhere in between HyperLogLog and HyperLogLog++.

Implementations

impl CardinalitySketch

pub fn new() -> Self

pub fn insert(&mut self, h: u64)

Add a new hash to the sketch.

pub fn combine(&mut self, other: &CardinalitySketch)

pub fn estimate(&self) -> usize

Trait Implementations

impl Clone for CardinalitySketch

fn clone(&self) -> CardinalitySketch

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Default for CardinalitySketch

fn default() -> Self

Returns the “default value” for a type.