| 
|   | RandomFast (unsigned int=239) | 
|   | Create a fast random number generator.  
  | 
|   | 
|   | RandomFast (int) | 
|   | Create a fast random number generator.  
  | 
|   | 
| 
  | ~RandomFast () | 
|   | Empty. 
  | 
|   | 
| void  | Seed (unsigned int) | 
|   | Changer the seed of the random number generator.  
  | 
|   | 
| void  | Seed (int) | 
|   | Changer the seed of the random number generator.  
  | 
|   | 
| 
unsigned int  | Integer () | 
|   | Compute a random unsigned integer. 
  | 
|   | 
| unsigned int  | Integer (int) | 
|   | Compute a random unsigned integer within interval [0,a].  
  | 
|   | 
| 
double  | Uniform () | 
|   | Compute uniform distribution in [0, 1[. 
  | 
|   | 
| double  | Uniform (const double &) | 
|   | Compute uniform distribution in [0, a[.  
  | 
|   | 
| double  | Uniform (const double &, const double &) | 
|   | Compute uniform distribution in [a, b[.  
  | 
|   | 
| unsigned int  | Poisson (const double &) | 
|   | Poisson random sequence.  
  | 
|   | 
| int  | Pick (const double *, int) | 
|   | Randomly pick one item given an array of probabilities.  
  | 
|   | 
A fast linear congruential random number generator. 
It uses the linear congruential generator xn+1 = 3039177861 xn (mod 232), introduced by Borosh and Niederreiter. This generator is fast and, despite its simplicity, optimal with respect to statistical independence of successive pseudo-random numbers.
- See also
 - RandomMul, RandomXorShift