spire.random.rng

Bit-mixing random number generator based on rotations from Bob Burtle. Maintains 16 bytes of state information. Good speed and randomness (see Burtle3rot for better randomness). Algorithm from http://burtleburtle.net/bob/rand/

Bit-mixing random number generator based on rotations from Bob Burtle. Maintains 16 bytes of state information. Decent speed and very good randomness (see Burtle2rot for better speed). Algorithm from http://burtleburtle.net/bob/rand/

Bit-mixing random number generator based on rotations from Bob Burtle. Maintains 16 bytes of state information. Algorithm from http://burtleburtle.net/bob/rand/

Marsaglia "Weyl sequence" RNG with cycle length of 2^192^ - 2^32^ from http://www.jstatsoft.org/v08/i14/paper. Quite fast and quite random; requires 24 bytes of state.

This is a 32-bit Scala implementation of MersenneTwister based on MT19937.c.

MersenneTwister is a fast, 623-dimensionally equidistributed pseudo random number generator with a 2¹⁹⁹³⁷ - 1 long period.

Reference: Makoto Matsumoto and Takuji Nishimura: "Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator", ACM Transactions on Modeling and Computer Simulation, Vol. 8, No. 1, January 1998, pp 3--30.

This is a 64-bit Scala implementation of MersenneTwister based on MT19937-64.c.

MersenneTwister is a fast, 623-dimensionally equidistributed pseudo random number generator with a 2¹⁹⁹³⁷ - 1 long period.

Reference: Makoto Matsumoto and Takuji Nishimura: "Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator", ACM Transactions on Modeling and Computer Simulation, Vol. 8, No. 1, January 1998, pp 3--30.

This is a Scala implementation of the PCG-XSH-RR-64/32 PRNG based on basic C implementation.

Reference: Melissa E. O'Neill: "PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation", Submitted to ACM Transactions on Mathematical Software.

This object provides helper functions used for seeding arrays of integers or longs.

The seeding functions are an adaptation/port of code from the the 32-bit and 64-bit implementations of MersenneTwister (MT19937.c, MT19937-64.c).

MersenneTwister is a fast, 623-dimensionally equidistributed pseudo random number generator with a 2¹⁹⁹³⁷ - 1 long period.

Reference: Makato Matsumoto and Takuji Nishimura: "Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator", ACM Transactions on Modeling and Computer Simulation, Vol. 8, No. 1, January 1998, pp 3--30.

This is a Scala implementation of the Well1024a PRNG based on WELL1024a.c.

The acronym WELL stands for Well Equidistributed Long-period Linear.

Reference: François Panneton, Pierre L'Ecuyer and Makoto Matsumoto: "Improved Long-Period Generators Based on Linear Recurrences Modulo 2", ACM Transactions on Mathematical Software, Vol. 32, No. 1, January 2006, pp 1--16.

This is a Scala implementation of the Well19937a PRNG based on WELL19937a.c.

The acronym WELL stands for Well Equidistributed Long-period Linear.

Reference: François Panneton, Pierre L'Ecuyer and Makoto Matsumoto: "Improved Long-Period Generators Based on Linear Recurrences Modulo 2", ACM Transactions on Mathematical Software, Vol. 32, No. 1, January 2006, pp 1--16.

This is a Scala implementation of the Well19937c PRNG based on WELL19937a.c.

The acronym WELL stands for Well Equidistributed Long-period Linear.

Reference: François Panneton, Pierre L'Ecuyer and Makoto Matsumoto: "Improved Long-Period Generators Based on Linear Recurrences Modulo 2", ACM Transactions on Mathematical Software, Vol. 32, No. 1, January 2006, pp 1--16.

This is a Scala implementation of the Well44497a PRNG based on WELL44497a.c.

The acronym WELL stands for Well Equidistributed Long-period Linear.

Reference: François Panneton, Pierre L'Ecuyer and Makoto Matsumoto: "Improved Long-Period Generators Based on Linear Recurrences Modulo 2", ACM Transactions on Mathematical Software, Vol. 32, No. 1, January 2006, pp 1--16.

This is a Scala implementation of the Well44497b PRNG based on WELL44497a.c.

The acronym WELL stands for Well Equidistributed Long-period Linear.

Reference: François Panneton, Pierre L'Ecuyer and Makoto Matsumoto: "Improved Long-Period Generators Based on Linear Recurrences Modulo 2", ACM Transactions on Mathematical Software, Vol. 32, No. 1, January 2006, pp 1--16.

This is a Scala implementation of the Well512a PRNG based on WELL512a.c.

The acronym WELL stands for Well Equidistributed Long-period Linear.

Reference: François Panneton, Pierre L'Ecuyer and Makoto Matsumoto: "Improved Long-Period Generators Based on Linear Recurrences Modulo 2", ACM Transactions on Mathematical Software, Vol. 32, No. 1, January 2006, pp 1--16.