pcg-random: Haskell bindings to the PCG random number generator.

[ bsd3, library, system ] [ Propose Tags ]

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 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
Change log CHANGELOG.md
Dependencies base (>=4.3 && <5), bytestring, entropy, primitive (>=0.4 && <0.7), random (>=1.0 && <2.0) [details]
License BSD-3-Clause
Copyright (c) 2014-2015. Christopher Chalmers <c.chalmers@me.com>
Author Christopher Chalmers
Maintainer c.chalmers@me.com
Category System
Home page http://github.com/cchalmers/pcg-random
Bug tracker http://github.com/cchalmers/pcg-random/issues
Source repo head: git clone git://github.com/cchalmers/pcg-random.git
Uploaded by cchalmers at Sun Mar 11 17:36:49 UTC 2018
Distributions LTSHaskell:0.1.3.5, NixOS:0.1.3.5, Stackage:0.1.3.5
Downloads 2617 total (27 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for pcg-random-0.1.3.5

[back to package description]

pcg-random

Build Status Hackage

Haskell bindings to the PCG random number generator http://www.pcg-random.org.

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.

Implements the standard multiple stream generator as well as the fast, single and unique variants.

The api is very similar to mwc-random but the pcg generator appears to be slightly faster. There is also a pure interface via the random libray.