tdigest
  1. Overview
  2. No Docs
OCaml implementation of the T-Digest algorithm

Install

Authors

Maintainers

Sources

2.1.1.tar.gz
md5=e1551ea77faa1d5b1da89534704f6897
sha512=7644efb5f1a4b2e51dd7380650c2d627756bd441f91a459874f42ec78bf110bc7cac67dd85c8f917ebaf39f300dc191ccaa599cfc2655257a80b55f2ed0d626a

Description

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.

Published: 16 Jan 2023

Dependencies (3)

  1. core >= "v0.15.0" & < "v0.16.0"
  2. dune >= "1.9.0"
  3. ocaml >= "4.10.0"

Dev Dependencies

None

Used by

None

Conflicts

None