tdigestversion

OCaml implementation of the T-Digest algorithm

The T-Digest is a data structure and algorithm for constructing an approximate distribution for a collection of real numbers presented as a stream.

The T-Digest can estimate percentiles or quantiles extremely accurately even at the tails, while using a fraction of the space.

Additionally, the T-Digest is concatenable, making it a good fit for distributed systems. The internal state of a T-Digest can be exported as a binary string, and the concatenation of any number of those strings can then be imported to form a new T-Digest.

AuthorsSimon Grondin and Will Welch
LicenseMIT
Published
Homepagehttps://github.com/SGrondin/tdigest
Issue Trackerhttps://github.com/SGrondin/tdigest/issues
MaintainerSimon Grondin
Dependencies
Source [http] https://github.com/SGrondin/tdigest/archive/2.1.0.tar.gz
md5=0772efa1b0f164c48c25be0f108dedc6
sha512=b858b1d300416c2c14db1dffdcd68adc359bf04c6d64c9cde52fdeaa5034de4a61b7be2f5872ee727e17f1bf599f8bf72f1ef251fd0c3777edc14444ed249002
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/tdigest/tdigest.2.1.0/opam
No package is dependent