This generator features an extremely long period (219937-1) and 623-dimensional equidistribution up to 32 bits accuracy. The home page for this generator is located at http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html.
This generator is described in a paper by Makoto Matsumoto and Takuji Nishimura in 1998: 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 class is mainly a Java port of the 2002-01-26 version of the generator written in C by Makoto Matsumoto and Takuji Nishimura. Here is their original copyright:
| Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura, All rights reserved. |
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
|
| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| Modifier and Type | Field and Description |
|---|---|
| private static final int | M
Period second parameter. |
| private static final int[] | MAG01
X * MATRIX_A for X = {0, 1}. |
| private int[] | mt
Bytes pool. |
| private int | mti
Current index in the bytes pool. |
| private static final int | N
Size of the bytes pool. |
| private static final long | serialVersionUID
Hides org. |
| Access | Constructor and Description |
|---|---|
| public | |
| public | MersenneTwister(int
the initial seed (32 bits integer) seed)Creates a new random number generator using a single int seed. |
| public | MersenneTwister(int[]
the initial seed (32 bits integers array), if null
the seed of the generator will be related to the current time seed)Creates a new random number generator using an int array seed. |
| public | MersenneTwister(long
the initial seed (64 bits integer) seed)Creates a new random number generator using a single long seed. |
| Modifier and Type | Method and Description |
|---|---|
| protected int | Returns: random bits generatednumber of random bits to produce bits)Implements abstract org. Generate next pseudorandom number. |
| public void | setSeed(int
the initial seed (32 bits integer) seed)Implements abstract org. Implements org. Reinitialize the generator as if just built with the given int seed. |
| public void | setSeed(int[]
the initial seed (32 bits integers array), if null
the seed of the generator will be the current system time plus the
system identity hash code of this instance seed)Implements abstract org. Implements org. Reinitialize the generator as if just built with the given int array seed. |
| public void | setSeed(long
the initial seed (64 bits integer) seed)Implements abstract org. Implements org. Reinitialize the generator as if just built with the given long seed. |
| M | back to summary |
|---|---|
| private static final int M Period second parameter. | |
| MAG01 | back to summary |
|---|---|
| private static final int[] MAG01 X * MATRIX_A for X = {0, 1}. | |
| mt | back to summary |
|---|---|
| private int[] mt Bytes pool. | |
| mti | back to summary |
|---|---|
| private int mti Current index in the bytes pool. | |
| N | back to summary |
|---|---|
| private static final int N Size of the bytes pool. | |
| serialVersionUID | back to summary |
|---|---|
| private static final long serialVersionUID Hides org. Serializable version identifier. | |
| MersenneTwister | back to summary |
|---|---|
| public MersenneTwister() Creates a new random number generator. The instance is initialized using the current time plus the system identity hash code of this instance as the seed. | |
| MersenneTwister | back to summary |
|---|---|
| public MersenneTwister(int seed) Creates a new random number generator using a single int seed.
| |
| MersenneTwister | back to summary |
|---|---|
| public MersenneTwister(int[] seed) Creates a new random number generator using an int array seed.
| |
| MersenneTwister | back to summary |
|---|---|
| public MersenneTwister(long seed) Creates a new random number generator using a single long seed.
| |
| next | back to summary |
|---|---|
| protected int next(int bits) Implements abstract org. Generate next pseudorandom number. This method is the core generation algorithm. It is used by all the
public generation methods for the various primitive types
| |
| setSeed | back to summary |
|---|---|
| public void setSeed(int seed) Implements abstract org. Implements org. Reinitialize the generator as if just built with the given int seed. The state of the generator is exactly the same as a new generator built with the same seed.
| |
| setSeed | back to summary |
|---|---|
| public void setSeed(int[] seed) Implements abstract org. Implements org. Reinitialize the generator as if just built with the given int array seed. The state of the generator is exactly the same as a new generator built with the same seed.
| |
| setSeed | back to summary |
|---|---|
| public void setSeed(long seed) Implements abstract org. Implements org. Reinitialize the generator as if just built with the given long seed. The state of the generator is exactly the same as a new generator built with the same seed.
| |