[][src]Crate pdatastructs

A collection of data structures that are based probability theory and therefore only provide the correct answer if a certain probability. In exchange they have a better runtime and memory complexity compared to traditional data structures.

Re-exports

pub use num_traits;
pub use rand;

Modules

countminsketch

CountMinSketch implementation.

filters

Filters, Approximate Membership Queries (AMQs).

hash_utils

Hash-related utils.

hyperloglog

HyperLogLog implementation.

reservoirsampling

ReservoirSampling implementation.

tdigest

TDigest implementation.

topk

Top-K, store k most frequent data points in stream.