package tdigest
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
OCaml implementation of the T-Digest algorithm
Install
Dune Dependency
Authors
Maintainers
Sources
2.2.1.tar.gz
md5=b1e6a1105a0ff82ea56bb1f9391d0330
sha512=b632c721556cafd94f8b7493b737cc3b77cd440883fd216702b91cf4a717a424798b1f9b5f2d80196b6825a17993caf61b26f582a8c4d9470ce491d68663c6af
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: 21 May 2025
Dependencies (4)
-
ppx_sexp_conv
>= "v0.17.0"
-
base
>= "v0.17.0" & < "v0.18.0"
-
dune
>= "1.9.0"
-
ocaml
>= "4.10.0"
Dev Dependencies (4)
-
ocaml-lsp-server
with-dev-setup
-
ocamlformat
= "0.25.1" & with-dev-setup
-
ppx_custom_printf
>= "v0.17.0" & with-test
-
ppx_expect
>= "v0.17.0" & with-test
Used by
None
Conflicts
None
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page