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/0.1.0.tar.gz
md5=a5253dec749621a8dc2484c92f087975
sha512=2eb1428a137fc2515af945e15a06cb49c3d7e8c0260f82b7f1391f94861ceea788f9f3a44671ed95d22f994a524cd0ce677913ac52aa0f3f589a28c1e664089c
StatisticsInstalled once last month.
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/tdigest/tdigest.0.1.0/opam
No package is dependent