mersenne-random-pure64

Generate high quality pseudorandom numbers purely using a Mersenne Twister

http://code.haskell.org/~dons/code/mersenne-random-pure64/

Version on this page:0.2.0.4
LTS Haskell 22.36:0.2.2.0@rev:1
Stackage Nightly 2024-10-03:0.2.2.0@rev:1
Latest on Hackage:0.2.2.0@rev:1

See all snapshots mersenne-random-pure64 appears in

BSD-3-Clause licensed by Don Stewart
Maintained by Don Stewart
This version can be pinned in stack with:mersenne-random-pure64-0.2.0.4@sha256:13f413cf88c33b5783298b34df95524e341e9f6d7ac9517f6b632888fa452df1,2366

Module documentation for 0.2.0.4

Depends on 3 packages(full list with versions):
Used by 1 package in lts-2.22(full list with versions):

The Mersenne twister is a pseudorandom number generator developed by Makoto Matsumoto and Takuji Nishimura that is based on a matrix linear recurrence over a finite binary field. It provides for fast generation of very high quality pseudorandom numbers. The source for the C code can be found here:

http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt64.html

This library provides a purely functional binding to the 64 bit classic mersenne twister, along with instances of RandomGen, so the generator can be used with System.Random. The generator should typically be a few times faster than the default StdGen (but a tad slower than the impure 'mersenne-random' library based on SIMD instructions and destructive state updates.