//! Cardinality estimation algorithms
//!
//! This module provides probabilistic algorithms for counting unique items
//! in large data streams.
//!
//! # Algorithm Comparison
//!
//! | Algorithm | Space Efficiency | Accuracy | Use Case |
//! |-----------|------------------|----------|----------|
//! | UltraLogLog | Best (28% better than HLL) | ~1.04/√m | New applications |
//! | HyperLogLog | Good | ~1.04/√m | Ecosystem interop (Redis, Druid) |
//! | CpcSketch | Better than HLL | ~1/√m | Apache DataSketches compat |
//! | ThetaSketch | Good | ~1/√k | Set operations (union, intersection) |
pub use CpcSketch;
pub use HyperLogLog;
pub use QSketch;
pub use ThetaSketch;
pub use UltraLogLog;