tdigest
On-line accumulation of rank-based statistics
https://github.com/phadej/haskell-tdigest#readme
| Version on this page: | 0.2.1.1 |
| LTS Haskell 23.19: | 0.3.1 |
| Stackage Nightly 2025-04-24: | 0.3.1 |
| Latest on Hackage: | 0.3.1 |
This version can be pinned in stack with:
tdigest-0.2.1.1@sha256:793fa51658532086ddec221746237c6ead6fd9dcdef88649ed54fa7150bab351,2805Module documentation for 0.2.1.1
Depends on 9 packages(full list with versions):
tdigest
A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means.
See original paper: “Computing extremely accurate quantiles using t-digest” by Ted Dunning and Otmar Ertl
Synopsis
λ *Data.TDigest > median (tdigest [1..1000] :: TDigest 3)
Just 499.0090729817737
Benchmarks
Using 50M exponentially distributed numbers:
- average: 16s; incorrect approximation of median, mostly to measure prng speed
- sorting using
vector-algorithms: 33s; using 1000MB of memory - sparking t-digest (using some
par): 53s - buffered t-digest: 68s
- sequential t-digest: 65s
Example histogram
tdigest-simple -m tdigest -d standard -s 100000 -c 10 -o output.svg -i 34
cp output.svg example.svg
inkscape --export-png=example.png --export-dpi=80 --export-background-opacity=0 --without-gui example.svg
