Module probably::quantile

Re-exports

pub use p2::P2;

pub use greenwald_khanna::Stream;

pub use greenwald_khanna::Tuple;

pub use histogram::Bound;

pub use histogram::Error;

pub use histogram::Histogram;

pub use histogram::Iter;

Modules

greenwald_khanna	Greenwald Khanna calculates epsilon-approximate quantiles. If the desired quantile is phi, the epsilon-approximate quantile is any element in the range of elements that rank between lbound((phi-epsilon) x N) and lbound((phi+epsilon) x N)
histogram	'histogram' approximates a distribution calculation by counting the number of times samples fall into pre-configured bins. This implementation does not require bins to be equally sized. The user must specify upper bounds on bins via Bounds. The implementation includes a +Inf bound automatically.
misra_gries	Misra-Gries calculates an ε-approximate frequency count for a stream of N elements. The output is the k most frequent elements.
p2