Struct HyperLogLog 

pub struct HyperLogLog { /* private fields */ }

Approximate algorithms for large-scale graph analytics These algorithms trade accuracy for performance and memory efficiency HyperLogLog implementation for approximate cardinality estimation Useful for counting unique nodes, edges, or other graph elements

Implementations

impl HyperLogLog

pub fn new(precision: u8) -> Self

Create new HyperLogLog with specified precision precision: number of bits for bucket selection (4-16)

pub fn add<T: Hash>(&mut self, element: &T)

Add an element to the HyperLogLog

pub fn estimate(&self) -> f64

Estimate the cardinality

pub fn merge(&mut self, other: &HyperLogLog) -> Result<()>

Merge with another HyperLogLog

Trait Implementations

impl Clone for HyperLogLog

fn clone(&self) -> HyperLogLog

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HyperLogLog

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

Formats the value using the given formatter.