pcg-random

Haskell bindings to the PCG random number generator.

http://github.com/cchalmers/pcg-random

Version on this page:0.1.3.6
LTS Haskell 22.39:0.1.4.0@rev:1
Stackage Nightly 2024-10-31:0.1.4.0@rev:1
Latest on Hackage:0.1.4.0@rev:1

See all snapshots pcg-random appears in

BSD-3-Clause licensed by Christopher Chalmers
Maintained by [email protected]
This version can be pinned in stack with:pcg-random-0.1.3.6@sha256:ff9c6b2ed237668250ad9676e35fcf82586404926771d6a1d8eca54e7c92030a,2559

Module documentation for 0.1.3.6

Used by 1 package in lts-15.3(full list with versions):
random-bytestring

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.

Changes

0.1.3.5

  • Build with ghc-8.4

0.1.3.4

  • Fix byte array bugs in System.Random.PCG.Pure

0.1.3.3

  • Added System.Random.PCG.Pure module.

0.1.3.2

  • Added System.Random.PCG.Fast.Pure module.

0.1.3.1

  • Added withFrozen function.

0.1.3.0

  • Use entropy package for system random generator.

0.1.2.0

  • Allow primitive-0.6.

0.1.1.0

  • Add uniformB, a function to generate a bounded random number in [0,b) range. This preforms significantly faster than uniformR (0,b-1).

  • Add type specific versions for uniformR and uniformB.

0.1.0.1

  • Fix bug when dealing with Word and Int types.