Expand description
This crate defines a minimal implementation of DDSketch.
DDSketch is a data sketch used to generate percentiles over streaming data using constant memory. A DDSketch is essentially a histogram that partitions the range of positive values into an infinite number of indexed bins whose size grows exponentially. It keeps track of the number of values (or possibly floating-point weights) added to each bin. Negative values are partitioned like positive values, symmetrically to zero. The value zero as well as its close neighborhood that would be mapped to extreme bin indexes is mapped to a specific counter.
Modules§
- pb
- Protobuf representation of DDSketch - generated by build.rs
Structs§
- DDSketch
- This is a minimal DDSketch implementation