7 unstable releases

0.4.1 Jun 13, 2022
0.4.0 Apr 7, 2021
0.3.0 Jan 16, 2021
0.2.2 Sep 23, 2020
0.1.0 Apr 16, 2020

#209 in Data structures

Download history 243/week @ 2022-08-13 255/week @ 2022-08-20 307/week @ 2022-08-27 359/week @ 2022-09-03 472/week @ 2022-09-10 496/week @ 2022-09-17 215/week @ 2022-09-24 213/week @ 2022-10-01 179/week @ 2022-10-08 221/week @ 2022-10-15 240/week @ 2022-10-22 217/week @ 2022-10-29 323/week @ 2022-11-05 312/week @ 2022-11-12 212/week @ 2022-11-19 234/week @ 2022-11-26

1,106 downloads per month
Used in dsrs

MIT license

185KB
6K SLoC

HyperLogLog

Build status Crates.io Documentation

HyperLogLog is a probabilistic algorithm for estimating the number of distinct elements (cardinality) of a multiset. Several variations of the original algorithm, described by P. Flajolet et al., have been proposed.

The following implementations are provided:

Usage

Add to Cargo.toml:

[dependencies]
hyperloglogplus = "*"

With Rust compiler version 1.45.0 or higher consider enabling the const-loop feature for better performance, see here for more details.

[dependencies]
hyperloglogplus = { version = "*", features = ["const-loop"] }

A simple example using HyperLogLog++ implementation:

use std::collections::hash_map::RandomState;
use hyperloglogplus::{HyperLogLog, HyperLogLogPlus};

let mut hllp: HyperLogLogPlus<u32, _> =
    HyperLogLogPlus::new(16, RandomState::new()).unwrap();

hllp.insert(&12345);
hllp.insert(&23456);

assert_eq!(hllp.count().trunc() as u32, 2);

Evaluation

Here you can find figures and discussion on experimental evaluation.

Dependencies

~0.3–0.9MB
~20K SLoC