Library for pseudorandom number generation in Curry.
This library provides operations for generating pseudorandom
number sequences.
For any given seed, the sequences generated by the operations
in this module should be identical
to the sequences
generated by the java.util.Random package
.
The algorithm is a linear congruential pseudorandom number generator described in Donald E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms, section 3.2.1.
Author: Sergio Antoy (with extensions by Michael Hanus)
Version: June 2017
nextInt
:: Int > [Int]
Returns a sequence of pseudorandom, uniformly distributed 32bits integer values. 
nextIntRange
:: Int > Int > [Int]
Returns a pseudorandom, uniformly distributed sequence of values between 0 (inclusive) and the specified value (exclusive). 
nextBoolean
:: Int > [Bool]
Returns a pseudorandom, uniformly distributed sequence of boolean values. 
getRandomSeed
:: IO Int
Returns a timedependent integer number as a seed for really random numbers. 
shuffle
:: Int > [a] > [a]
Computes a random permutation of the given list. 
Returns a sequence of pseudorandom, uniformly distributed 32bits integer values. All 2^{32} possible integer values are produced with (approximately) equal probability.

Returns a pseudorandom, uniformly distributed sequence of values
between 0 (inclusive) and the specified value (exclusive).
Each value is a 32bits positive integer.
All

Returns a pseudorandom, uniformly distributed sequence of
boolean values. The values

Returns a timedependent integer number as a seed for really random numbers. Should only be used as a seed for pseudorandom number sequence and not as a random number since the precision is limited to milliseconds 
Computes a random permutation of the given list.
