package bentov
All checked builds passInstall
dune-project
Dependency
Authors
Maintainers
Sources
sha256=9dd08f88b554ee5d8127f683cd4530773763091d692c86b7ddd4794a0fbad8e3
sha512=622efa18f1a5a3c2968953570ac30d37d9871e011c7d340cc11d3ced35ee2f8327e8bd1016e964e15536a4ff0c500a5b76ebb525d35a52cc81d03b997f45464f
Description
Bentov implements an algorithm which approximates a 1D histogram as data is streamed over it.
README
An OCaml implementation of histogram-sketching algorithm described in A Streaming Parallel Decision Tree Algorithm by Yael Ben-Haim and Elad Tom-Tov . Included is a command-line utility bt, which can read a file (or stdin) containing numbers, one per line, and output a representation of the approximated distribution.
For example, to approximate 10 quantiles of 1M data in U(0,1):
echo "" | awk '{ for ( i=0 ; i < 1e6 ; i++ ) { print rand() } }' | bt -n 20 -u 10In this example, the size of the approximating histogram is 20. For additional details, bt --help .
To install:
opam install bentov
Dev Dependencies
None
Optional Dependencies
None
Used by (2)
Conflicts
None
Build status
Results of building bentov with each compiler on check.ci.ocaml.org, run of against opam-repository 8a77e58. All results for this package.
Each result links to its build log. To keep crawlers from overloading the site, build logs require a GitHub sign-in (see ocurrent/opam-health-check). On your first log, GitHub asks you to “Authorize opam-health-check”, the OCurrent app that runs these checks; it sees only your public profile, not your repositories. The sign-in lasts 30 days.
| Version | OCaml 4.11 | OCaml 4.14 | OCaml 5.2 | OCaml 5.4 | OCaml 5.5 |
|---|---|---|---|---|---|
| 1 (this version) | good | good | good | good | good |
- good Package successfully built
- partial One of the dependencies failed to build
- bad Package failed to build
- n/a Package is not available in this environment
- internal Internal failure