


Description 
Monad based on state for passing random number state around for GEP.
The choice of Mersenne.Pure64 was for performance, and the pure version
will play nicely with threading.
Author: mjsottile@computer.org


Synopsis 



Documentation 


The GEPMonad is just a specific instance of the State monad where the
state is just the PureMT PRNG state.



:: Double  Upper bound.
 > Rmonad PureMT Double   Generate a random number as a Double between 0.0 and the given upper
bound.




:: Int  Upper bound.
 > Rmonad PureMT Int   Generate a random integer between 1 and the upper bound (inclusive).




:: Int  Upper bound.
 > Int  Integer to avoid.
 > Rmonad PureMT Int   Generate a random integer in the specified range that is NOT equal to
the integer provided.




:: Int  Number of integers to generate
 > Int  Upper bound for each integer.
 > Rmonad PureMT [Int]   Generate a list of random integers.




Generate a list of n random integers such that each entry occurs at most
once. Each number in the list must be unique.





Document me!



Run function for the Rmonad.


Produced by Haddock version 2.6.1 