public class MersenneTwister extends Object implements Serializable
Caveat: It is recommended to use one of WELL generators rather than the MersenneTwister generator (see this paper for more information).
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. | 
| Constructor and Description | 
|---|
| MersenneTwister()Creates a new random number generator. | 
| MersenneTwister(int seed)Creates a new random number generator using a single int seed. | 
| MersenneTwister(int[] seed)Creates a new random number generator using an int array seed. | 
| MersenneTwister(long seed)Creates a new random number generator using a single long seed. | 
| Modifier and Type | Method and Description | 
|---|---|
| protected void | clearCache()Clears the cache used by the default implementation of
  nextGaussian. | 
| boolean | nextBoolean()Returns the next pseudorandom, uniformly distributed
  booleanvalue from this random number generator's sequence. | 
| void | nextBytes(byte[] bytes)Generates random bytes and places them into a user-supplied
 byte array. | 
| void | nextBytes(byte[] bytes,
         int start,
         int len)Generates random bytes and places them into a user-supplied
 byte array. | 
| double | nextDouble()Returns the next pseudorandom, uniformly distributed
  doublevalue between0.0and1.0from this random number generator's sequence. | 
| float | nextFloat()Returns the next pseudorandom, uniformly distributed  floatvalue between0.0and1.0from this random
 number generator's sequence. | 
| double | nextGaussian()Returns the next pseudorandom, Gaussian ("normally") distributed
  doublevalue with mean0.0and standard
 deviation1.0from this random number generator's sequence. | 
| int | nextInt()Returns the next pseudorandom, uniformly distributed  intvalue from this random number generator's sequence. | 
| int | nextInt(int n)Returns a pseudorandom, uniformly distributed  intvalue
 between 0 (inclusive) and the specified value (exclusive), drawn from
 this random number generator's sequence. | 
| long | nextLong()Returns the next pseudorandom, uniformly distributed  longvalue from this random number generator's sequence. | 
| long | nextLong(long n)Returns a pseudorandom, uniformly distributed  intvalue
 between 0 (inclusive) and the specified value (exclusive), drawn from
 this random number generator's sequence. | 
| void | setSeed(int seed)Reinitialize the generator as if just built with the given int seed. | 
| void | setSeed(int[] seed)Reinitialize the generator as if just built with the given int array seed. | 
| void | setSeed(long seed)Sets the seed of the underlying random number generator using a
  longseed. | 
| String | toString() | 
public MersenneTwister()
The instance is initialized using the current time plus the system identity hash code of this instance as the seed.
public MersenneTwister(int seed)
seed - the initial seed (32 bits integer)public MersenneTwister(int[] seed)
seed - the initial seed (32 bits integers array), if null
 the seed of the generator will be related to the current timepublic MersenneTwister(long seed)
seed - the initial seed (64 bits integer)public void setSeed(int seed)
The state of the generator is exactly the same as a new generator built with the same seed.
setSeed in interface RandomGeneratorseed - the initial seed (32 bits integer)public void setSeed(int[] seed)
The state of the generator is exactly the same as a new generator built with the same seed.
setSeed in interface RandomGeneratorseed - 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 instancepublic int nextInt()
int
 value from this random number generator's sequence.
 
 All 232 possible int values should be produced
 with (approximately) equal probability.
nextInt in interface RandomGeneratorint
 value from this random number generator's sequencepublic boolean nextBoolean()
boolean value from this random number generator's sequence.boolean value from this random number generator's
 sequencepublic double nextDouble()
double value between 0.0 and
 1.0 from this random number generator's sequence.double value between 0.0 and
  1.0 from this random number generator's sequencepublic float nextFloat()
float
 value between 0.0 and 1.0 from this random
 number generator's sequence.float
 value between 0.0 and 1.0 from this
 random number generator's sequencepublic long nextLong()
long
 value from this random number generator's sequence. All 264
 possible long values should be produced with (approximately)
 equal probability.long
 value from this random number generator's sequencepublic void nextBytes(byte[] bytes)
bytes - the non-null byte array in which to put the random bytespublic void nextBytes(byte[] bytes,
                      int start,
                      int len)
bytes - the non-null byte array in which to put the random bytesstart - the starting index for inserting the generated bytes into
 the arraylen - the number of bytes to generatepublic void setSeed(long seed)
long seed.
 Sequences of values generated starting with the same seeds should be identical.
setSeed in interface RandomGeneratorseed - the seed valuepublic int nextInt(int n)
            throws IllegalArgumentException
int value
 between 0 (inclusive) and the specified value (exclusive), drawn from
 this random number generator's sequence.nextInt in interface RandomGeneratorn - the bound on the random number to be returned. Must be positive.int
 value between 0 (inclusive) and n (exclusive).IllegalArgumentException - if n is not positive.public long nextLong(long n)
int value
 between 0 (inclusive) and the specified value (exclusive), drawn from
 this random number generator's sequence.nextLong in interface RandomGeneratorn - the bound on the random number to be returned. Must be positive.int
 value between 0 (inclusive) and n (exclusive).public double nextGaussian()
double value with mean 0.0 and standard
 deviation 1.0 from this random number generator's sequence.nextGaussian in interface RandomGeneratordouble value with mean 0.0 and
 standard deviation 1.0 from this random number
  generator's sequenceprotected void clearCache()
nextGaussian.Copyright © 2016–2020 Hipparchus.org. All rights reserved.