pcg-random: Haskell bindings to the PCG random number generator.
PCG is a family of simple fast space-efficient statistically good algorithms for random number generation. Unlike many general-purpose RNGs, they are also hard to predict.
This library implements bindings to the standard C implementation. This includes the standard, unique, fast and single variants in the pcg family. There is a pure implementation that can be used as a generator with the random package as well as a faster primitive api that includes functions for generating common types.
The generators in this module are suitable for use in parallel but make sure threads don't share the same generator or things will go horribly wrong.
[Skip to Readme]
|Versions [RSS]||0.1.0.0, 0.1.0.1, 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.3.1, 0.1.3.2, 0.1.3.3, 0.1.3.4, 0.1.3.5, 0.1.3.6, 0.1.3.7, 0.1.4.0|
|Dependencies||base (>=4.3 && <5), bytestring, entropy, primitive (>=0.7 && <0.9), random (>=1.2 && <2.0) [details]|
|Copyright||(c) 2014-2015. Christopher Chalmers <firstname.lastname@example.org>|
|Source repo||head: git clone git://github.com/cchalmers/pcg-random.git|
|Uploaded||by cchalmers at 2023-04-30T15:09:10Z|
|Distributions||Arch:0.1.4.0, LTSHaskell:0.1.4.0, NixOS:0.1.4.0, Stackage:0.1.4.0|
|Reverse Dependencies||3 direct, 9 indirect [details]|
|Downloads||10563 total (46 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]