Hackage :: [Package]

Dist: A Haskell library for probability distributions

[ library, math, mit ] [ Propose Tags ] [ Report a vulnerability ]

This library provides a data structure and associated functions for representing discrete probability distributions.

[Skip to Readme]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.2.0.0, 0.3.0.0, 0.4.0.0, 0.4.1.0, 0.4.2, 0.5.0
Dependencies base (>=4.12 && <4.13), containers (>=0.6 && <0.7), MonadRandom (>=0.5 && <0.6) [details]
License MIT
Author William Yager
Maintainer will.yager@gmail.com
Category Math
Home page https://github.com/wyager/Dist
Source repo head: git clone https://github.com/wyager/Dist.git
Uploaded by wyager at 2019-06-16T09:28:45Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5247 total (26 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2019-06-16 [all 1 reports]

Readme for Dist-0.5.0

[back to package description]

Dist

A Haskell library for probability distributions

This library provides a data structure and associated functions for representing discrete probability distributions.

This library is optimized for very fast sampling. If n is the number of unique outcomes, sampling from the distribution is O(log(n)) worst case, and O(1) best case.

The average time complexity depends on the distribution. A more evenly distributed distribution will be closer to O(log(n)). A less evenly dsitributed distribution will be closer to O(1).