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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

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]

Properties

Versions0.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.5
Change logCHANGELOG.md
Dependenciesbase (>=4.3 && <5), bytestring, entropy, primitive (>=0.4 && <0.7), random (>=1.0 && <2.0) [details]
LicenseBSD-3-Clause
Copyright(c) 2014-2015. Christopher Chalmers <c.chalmers@me.com>
AuthorChristopher Chalmers
Maintainerc.chalmers@me.com
CategorySystem
Home pagehttp://github.com/cchalmers/pcg-random
Bug trackerhttp://github.com/cchalmers/pcg-random/issues
Source repositoryhead: git clone git://github.com/cchalmers/pcg-random.git
UploadedSun Mar 11 17:33:54 UTC 2018 by cchalmers

Modules

[Index]

Downloads

Maintainers' 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.