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:
Add to Cargo.toml:
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.
toml
[dependencies]
hyperloglogplus = { version = "*", features = ["const-loop"] }
A simple example using HyperLogLog++ implementation:
```rust use std::collections::hash_map::RandomState; use hyperloglogplus::{HyperLogLog, HyperLogLogPlus};
let mut hllp = HyperLogLogPlus::new(16, RandomState::new()).unwrap();
hllp.add(&12345); hllp.add(&23456);
assert_eq!(hllp.count().trunc() as u32, 2);
```
Here you can find figures and discussion on experimental evaluation.