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.
Authors | Simon Grondin and Will Welch |
---|---|
License | MIT |
Published | |
Homepage | https://github.com/SGrondin/tdigest |
Issue Tracker | https://github.com/SGrondin/tdigest/issues |
Maintainer | Simon Grondin |
Dependencies | |
Source [http] | https://github.com/SGrondin/tdigest/archive/refs/tags/2.1.3.tar.gz md5=60569f9c1605439334f55429d6c4bd9b sha512=f6a0eb96f4cad5dabf79ff67397846af8d52230f3e2816860e1211dcf85a9119521a8796ad046426026110820f2b52a76c0728f95fe909ab9b6cc34f97f86882 |
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/tdigest/tdigest.2.1.3/opam |
No package is dependent