Random number generator. The method is attributed to B.A. Wichmann and I.D.Hill, in 'An efficient and portable pseudo-random number generator', Journal of Applied Statistics. AS183. 1982. Also Byte March 1987.
The current algorithm is a modification of the version attributed to Richard A O'Keefe in the standard Prolog library.
Every time a random number is requested, a state is used to calculate
it, and a new state produced. The state can either be implicit (kept
in the process dictionary) or be an explicit argument and return value.
In this implementation, the state (the type
It should be noted that this random number generator is not cryptographically
strong. If a strong cryptographic random number generator is needed for
example
The state.
Seeds random number generation with default (fixed) values in the process dictionary, and returns the old state.
Seeds random number generation with integer values in the process dictionary, and returns the old state.
One way of obtaining a seed is to use the BIF
...
{A1,A2,A3} = now(),
random:seed(A1, A2, A3),
...
Returns the default state.
Returns a random float uniformly distributed between
Given an integer
Given a state,
Given an integer
Some of the functions use the process dictionary variable
If a process calls
The implementation changed in R15. Upgrading to R15 will break
applications that expect a specific output for a given seed. The output
is still deterministic number series, but different compared to releases
older than R15. The seed