Class Chill32Random
- All Implemented Interfaces:
Externalizable,Serializable,RandomGenerator
Xoshiro128PlusPlusRandom, except that
Xoshiro128PlusPlusRandom doesn't permit the state to be all 0s, while Chill32Random isn't adversely affected by
that condition. This generator has three int states and doesn't use any
multiplication. It does use the count leading zeros instruction, which is Integer.numberOfLeadingZeros(int)
on most platforms, or the JS function Math.clz32() on GWT. This only counts leading zeros for the purposes of
its state transition (for stateB and stateC), and using it the way this does is what allows the period to be so high.
This is meant to be faster on GWT and TeaVM than the 64-bit-native generators here.
This algorithm passes 64TB of PractRand testing with no anomalies. It was tested as a 64-bit generator (using both 64-bit and 32-bit "folding modes"), because this is designed to be much faster at calling
nextLong() on any
platform (relative to other 32-bit-native generators) while still using 32-bit math. Essentially, it always generates
64 bits of result, but only uses 32 of them from nextInt() (and
doesn't need to produce a long on GWT in nextInt(), which is a slow task).
When the state is given exactly with
Chill32Random(int, int, int) or setState(long, long, long),
this doesn't have any generations at the start where numerically similar states show correlation. This is different
from generators like AceRandom, which take some time to become adequately random, but similar to generators
like DistinctRandom and FlowRandom, which hash their state(s) to get a random output from predictable
state changes. Some generators never stop showing correlation from similar initial states, such as
WhiskerRandom or Xoshiro256StarStarRandom; this doesn't affect how useful they are if you have only
one generator or if they are seeded in an adequately-random manner.
A notable quality of the implementation is that
nextInt() and nextLong() return the same values for
their lowest 32 bits, and nextLong() advances the state by the same amount as nextInt(). This is
not a cryptographically-secure generator (at all), even though it uses only operations that should be immune or
resistant to timing attacks.
The hash-like construction used to randomize the three counter-like states is loosely based on the Speck cipher (using only 4 rounds), but adds in an extra rotation at each round, and uses very different rotation constants in every round. The input states A and B correspond to plaintext, and stateC to the key.
This implements all optional methods in EnhancedRandom except
EnhancedRandom.skip(long).- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from interface java.util.random.RandomGenerator
RandomGenerator.ArbitrarilyJumpableGenerator, RandomGenerator.JumpableGenerator, RandomGenerator.LeapableGenerator, RandomGenerator.SplittableGenerator, RandomGenerator.StreamableGenerator -
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionCreates a new Chill32Random with a random state.Chill32Random(int stateA, int stateB, int stateC) Creates a new Chill32Random with the given three states.Chill32Random(long seed) Creates a new Chill32Random with the given seed; alllongvalues are permitted. -
Method Summary
Modifier and TypeMethodDescriptioncopy()Creates a new EnhancedRandom with identical states to this one, so if the same EnhancedRandom methods are called on this object and its copy (in the same order), the same outputs will be produced.boolean2 to the 96.longgetSelectedState(int selection) Gets the state determined byselection, as-is.longlonglongintThis generator has 3intstates, so this returns 3.getTag()Gets the tag used to identify this type of EnhancedRandom, as a String.intnext(int bits) Generates the next pseudorandom number with a specific maximum size in bits (not a max number).booleanReturns the next pseudorandom, uniformly distributedbooleanvalue from this random number generator's sequence.voidnextBytes(byte[] bytes) Generates random bytes and places them into a user-supplied byte array.floatReturns the next pseudorandom, uniformly distributedfloatvalue between0.0(inclusive) and1.0(exclusive) from this random number generator's sequence.intnextInt()Returns the next pseudorandom, uniformly distributedintvalue from this random number generator's sequence.intnextInt(int bound) Returns a pseudorandom, uniformly distributedintvalue between 0 (inclusive) and the specified value (exclusive), drawn from this random number generator's sequence.longnextLong()Returns the next pseudorandom, uniformly distributedlongvalue from this random number generator's sequence.longnextLong(long inner, long outer) Returns a pseudorandom, uniformly distributedlongvalue between the specifiedinnerBound(inclusive) and the specifiedouterBound(exclusive).intnextSignedInt(int outerBound) Returns a pseudorandom, uniformly distributedintvalue between an inner bound of 0 (inclusive) and the specifiedouterBound(exclusive).longnextSignedLong(long inner, long outer) Returns a pseudorandom, uniformly distributedlongvalue between the specifiedinnerBound(inclusive) and the specifiedouterBound(exclusive).intOptional; moves the state to its previous value and returns the previous int that would have been produced byEnhancedRandom.nextInt().longOptional; moves the state to its previous value and returns the previous long that would have been produced byEnhancedRandom.nextLong().voidsetSeed(long seed) This initializes all 3 states of the generator to random values based on the given seed.voidsetSelectedState(int selection, long value) Sets one of the states, determined byselection, to the lower 32 bits ofvalue, as-is.voidsetState(long stateA, long stateB, long stateC) Sets the state completely to the given three state variables, casting each to an int.voidsetStateA(long stateA) Sets the first part of the state by casting the parameter to an int.voidsetStateB(long stateB) Sets the second part of the state by casting the parameter to an int.voidsetStateC(long stateC) Sets the third part of the state by casting the parameter to an int.toString()Methods inherited from class com.github.tommyettinger.random.EnhancedRandom
appendSerialized, appendSerialized, areEqual, fixGamma, fixGamma, lcm, mainlyGeneratesInt, maxDoubleOf, maxFloatOf, maxIntOf, maxLongOf, minDoubleOf, minFloatOf, minIntOf, minLongOf, nextBoolean, nextDouble, nextDouble, nextDouble, nextExclusiveDouble, nextExclusiveDouble, nextExclusiveDouble, nextExclusiveDoubleEquidistant, nextExclusiveFloat, nextExclusiveFloat, nextExclusiveFloat, nextExclusiveFloatEquidistant, nextExclusiveSignedDouble, nextExclusiveSignedFloat, nextExponential, nextFloat, nextFloat, nextGaussian, nextGaussian, nextGaussianFloat, nextGaussianFloat, nextInclusiveDouble, nextInclusiveDouble, nextInclusiveDouble, nextInclusiveFloat, nextInclusiveFloat, nextInclusiveFloat, nextInt, nextLong, nextSign, nextSignedInt, nextSignedLong, nextTriangular, nextTriangular, nextTriangular, nextTriangular, nextUnsignedInt, probit, randomElement, randomElement, rateGamma, readExternal, seedFromMath, setState, setState, setState, setState, setState, setState, setWith, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, shuffle, skip, stringDeserialize, stringDeserialize, stringSerialize, stringSerialize, writeExternalMethods inherited from class java.util.Random
doubles, doubles, doubles, doubles, ints, ints, ints, ints, longs, longs, longs, longsMethods inherited from class java.lang.Object
clone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.random.RandomGenerator
isDeprecated
-
Field Details
-
stateA
protected int stateAThe first state; may be any int. -
stateB
protected int stateBThe second state; may be any int. -
stateC
protected int stateCThe third state; may be any int.
-
-
Constructor Details
-
Chill32Random
public Chill32Random()Creates a new Chill32Random with a random state. -
Chill32Random
public Chill32Random(long seed) Creates a new Chill32Random with the given seed; alllongvalues are permitted. The seed will be passed tosetSeed(long)to attempt to adequately distribute the seed randomly.- Parameters:
seed- anylongvalue
-
Chill32Random
public Chill32Random(int stateA, int stateB, int stateC) Creates a new Chill32Random with the given three states. Allintvalues are permitted.- Parameters:
stateA- anyintvaluestateB- anyintvaluestateC- anyintvalue
-
-
Method Details
-
getTag
Description copied from class:EnhancedRandomGets the tag used to identify this type of EnhancedRandom, as a String. This tag should be unique, and for uniformity purposes, all tags used in this library are 4 characters long. User-defined tags should have a different length.- Specified by:
getTagin classEnhancedRandom- Returns:
- a unique String identifier for this type of EnhancedRandom; usually 4 chars long.
-
getMinimumPeriod
2 to the 96.- Overrides:
getMinimumPeriodin classEnhancedRandom- Returns:
- 2 to the 96
-
getStateCount
public int getStateCount()This generator has 3intstates, so this returns 3.- Overrides:
getStateCountin classEnhancedRandom- Returns:
- 3 (three)
-
getSelectedState
public long getSelectedState(int selection) Gets the state determined byselection, as-is. The value for selection should be between 0 and 2, inclusive; if it is any other value this gets state C as if 2 was given.- Overrides:
getSelectedStatein classEnhancedRandom- Parameters:
selection- used to select which state variable to get; generally 0, 1, or 2- Returns:
- the value of the selected state, which is an int that will be promoted to long
-
setSelectedState
public void setSelectedState(int selection, long value) Sets one of the states, determined byselection, to the lower 32 bits ofvalue, as-is. Selections 0, 1, and 2 refer to states A, B, and C, and if the selection is anything else, this treats it as 2 and sets stateC. This always castsvalueto an int before using it.- Overrides:
setSelectedStatein classEnhancedRandom- Parameters:
selection- used to select which state variable to set; generally 0, 1, or 2value- the exact value to use for the selected state, if valid
-
setSeed
public void setSeed(long seed) This initializes all 3 states of the generator to random values based on the given seed. (2 to the 64) known-good initial generator states can be produced here.- Specified by:
setSeedin classEnhancedRandom- Parameters:
seed- the initial seed; may be any long
-
getStateA
public long getStateA() -
setStateA
public void setStateA(long stateA) Sets the first part of the state by casting the parameter to an int.- Parameters:
stateA- can be any long, but will be cast to an int before use
-
getStateB
public long getStateB() -
setStateB
public void setStateB(long stateB) Sets the second part of the state by casting the parameter to an int.- Parameters:
stateB- can be any long, but will be cast to an int before use
-
getStateC
public long getStateC() -
setStateC
public void setStateC(long stateC) Sets the third part of the state by casting the parameter to an int.- Parameters:
stateC- can be any long, but will be cast to an int before use
-
setState
public void setState(long stateA, long stateB, long stateC) Sets the state completely to the given three state variables, casting each to an int. This is the same as callingsetStateA(long),setStateB(long), andsetStateC(long)as a group.- Overrides:
setStatein classEnhancedRandom- Parameters:
stateA- the first state; can be any long, but will be cast to an int before usestateB- the second state; can be any long, but will be cast to an int before usestateC- the third state; can be any long, but will be cast to an int before use
-
nextLong
public long nextLong()Description copied from class:EnhancedRandomReturns the next pseudorandom, uniformly distributedlongvalue from this random number generator's sequence. The general contract ofnextLongis that onelongvalue is pseudorandomly generated and returned.
The only methods that need to be implemented by this interface are this andEnhancedRandom.copy(), though other methods can be implemented as appropriate for generators that, for instance, natively produce ints rather than longs.- Specified by:
nextLongin interfaceRandomGenerator- Specified by:
nextLongin classEnhancedRandom- Returns:
- the next pseudorandom, uniformly distributed
longvalue from this random number generator's sequence
-
previousLong
public long previousLong()Description copied from class:EnhancedRandomOptional; moves the state to its previous value and returns the previous long that would have been produced byEnhancedRandom.nextLong(). This can be equivalent to callingEnhancedRandom.skip(long)with -1L, but not always; many generators can't efficiently skip long distances, but can step back by one value.
Generators that natively generateintresults typically producelongvalues by generating an int for the high 32 bits and an int for the low 32 bits. When producing the previous long, the order the high and low bits are generated, such as byEnhancedRandom.previousInt(), should be reversed. Generators that natively producelongvalues usually don't need to implementEnhancedRandom.previousInt(), but those that produceintusually should implement it, and may optionally call previousInt() twice in this method.
If you know how to implement the reverse of a particular random number generator, it is recommended you do so here, rather than rely on skip(). This isn't always easy, but should always be possible for any decent PRNG (some historical PRNGs, such as the Middle-Square PRNG, cannot be reversed at all). If a generator cannot be reversed because multiple initial states can transition to the same subsequent state, it is known to have statistical problems that are not necessarily present in a generator that matches one initial state to one subsequent state.
The public implementation callsEnhancedRandom.skip(long)with -1L, and if skip() has not been implemented differently, then it will throw an UnsupportedOperationException.- Overrides:
previousLongin classEnhancedRandom- Returns:
- the previous number this would have produced with
EnhancedRandom.nextLong()
-
next
public int next(int bits) Description copied from class:EnhancedRandomGenerates the next pseudorandom number with a specific maximum size in bits (not a max number). If you want to get a random number in a range, you should usually useEnhancedRandom.nextInt(int)instead. For some specific cases, this method is more efficient and less biased thanEnhancedRandom.nextInt(int). Forbitsvalues between 1 and 30, this should be similar in effect tonextInt(1 << bits); though it won't typically produce the same values, they will have the correct range. Ifbitsis 31, this can return any non-negativeint; note thatnextInt(1 << 31)won't behave this way because1 << 31is negative. Ifbitsis 32 (or 0), this can return anyint.The general contract of
nextis that it returns anintvalue and if the argumentbitsis between1and32(inclusive), then that many low-order bits of the returned value will be (approximately) independently chosen bit values, each of which is (approximately) equally likely to be0or1.Note that you can give this values for
bitsthat are outside its expected range of 1 to 32, but the value used, as long as bits is positive, will effectively bebits % 32. As stated before, a value of 0 for bits is the same as a value of 32.- Overrides:
nextin classEnhancedRandom- Parameters:
bits- the amount of random bits to request, from 1 to 32- Returns:
- the next pseudorandom value from this random number generator's sequence
-
nextInt
public int nextInt()Description copied from class:EnhancedRandomReturns the next pseudorandom, uniformly distributedintvalue from this random number generator's sequence. The general contract ofnextIntis that oneintvalue is pseudorandomly generated and returned. All 232 possibleintvalues are produced with (approximately) equal probability.- Specified by:
nextIntin interfaceRandomGenerator- Overrides:
nextIntin classEnhancedRandom- Returns:
- the next pseudorandom, uniformly distributed
intvalue from this random number generator's sequence
-
previousInt
public int previousInt()Description copied from class:EnhancedRandomOptional; moves the state to its previous value and returns the previous int that would have been produced byEnhancedRandom.nextInt(). This can be equivalent to callingEnhancedRandom.previousLong()and casting to int, but not always; generators that natively generateintresults typically move the state once in nextInt() and twice in nextLong(), and should move the state back once here.
IfEnhancedRandom.nextInt()is implemented using a call toEnhancedRandom.nextLong(), the implementation in this class is almost always sufficient and correct. If nextInt() changes state differently from nextLong(), then this should be implemented, if feasible, andEnhancedRandom.previousLong()can be implemented using this method. If you know how to implement the reverse of a particular random number generator, it is recommended you do so here, rather than rely on skip(). This isn't always easy, but should always be possible for any decent PRNG (some historical PRNGs, such as the Middle-Square PRNG, cannot be reversed at all). If a generator cannot be reversed because multiple initial states can transition to the same subsequent state, it is known to have statistical problems that are not necessarily present in a generator that matches one initial state to one subsequent state.
The public implementation callsEnhancedRandom.previousLong()and casts it to int, and if previousLong() and skip() have not been implemented differently, then it will throw an UnsupportedOperationException.- Overrides:
previousIntin classEnhancedRandom- Returns:
- the previous number this would have produced with
EnhancedRandom.nextInt()
-
nextInt
public int nextInt(int bound) Description copied from class:EnhancedRandomReturns a pseudorandom, uniformly distributedintvalue between 0 (inclusive) and the specified value (exclusive), drawn from this random number generator's sequence. The general contract ofnextIntis that oneintvalue in the specified range is pseudorandomly generated and returned. Allboundpossibleintvalues are produced with (approximately) equal probability.
This method clamps bound to be at least 0; it never returns a negative int.
It should be mentioned that the technique this uses has some bias, depending onbound, but it typically isn't measurable without specifically looking for it. Using the method this does allows this method to always advance the state by one step, instead of a varying and unpredictable amount with the more typical ways of rejection-sampling random numbers and only using numbers that can produce an int within the bound without bias. See M.E. O'Neill's blog about random numbers for discussion of alternative, unbiased methods.- Specified by:
nextIntin interfaceRandomGenerator- Overrides:
nextIntin classEnhancedRandom- Parameters:
bound- the upper bound (exclusive). If negative or 0, this always returns 0.- Returns:
- the next pseudorandom, uniformly distributed
intvalue between zero (inclusive) andbound(exclusive) from this random number generator's sequence
-
nextSignedInt
public int nextSignedInt(int outerBound) Description copied from class:EnhancedRandomReturns a pseudorandom, uniformly distributedintvalue between an inner bound of 0 (inclusive) and the specifiedouterBound(exclusive). This is meant for cases where the outer bound may be negative, especially if the bound is unknown or may be user-specified. A negative outer bound is used as the lower bound; a positive outer bound is used as the upper bound. An outer bound of -1, 0, or 1 will always return 0, keeping the bound exclusive (except for outer bound 0). This method is slightly slower thanEnhancedRandom.nextInt(int).- Overrides:
nextSignedIntin classEnhancedRandom- Parameters:
outerBound- the outer exclusive bound; may be any int value, allowing negative- Returns:
- a pseudorandom int between 0 (inclusive) and outerBound (exclusive)
- See Also:
-
nextBytes
public void nextBytes(byte[] bytes) Description copied from class:EnhancedRandomGenerates random bytes and places them into a user-supplied byte array. The number of random bytes produced is equal to the length of the byte array.- Specified by:
nextBytesin interfaceRandomGenerator- Overrides:
nextBytesin classEnhancedRandom- Parameters:
bytes- the byte array to fill with random bytes
-
nextLong
public long nextLong(long inner, long outer) Description copied from class:EnhancedRandomReturns a pseudorandom, uniformly distributedlongvalue between the specifiedinnerBound(inclusive) and the specifiedouterBound(exclusive). IfouterBoundis less than or equal toinnerBound, this always returnsinnerBound.
For any case where outerBound might be valid but less than innerBound, you can useEnhancedRandom.nextSignedLong(long, long).- Specified by:
nextLongin interfaceRandomGenerator- Overrides:
nextLongin classEnhancedRandom- Parameters:
inner- the inclusive inner bound; may be any long, allowing negativeouter- the exclusive outer bound; must be greater than innerBound (otherwise this returns innerBound)- Returns:
- a pseudorandom long between innerBound (inclusive) and outerBound (exclusive)
- See Also:
-
nextSignedLong
public long nextSignedLong(long inner, long outer) Description copied from class:EnhancedRandomReturns a pseudorandom, uniformly distributedlongvalue between the specifiedinnerBound(inclusive) and the specifiedouterBound(exclusive). This is meant for cases where either bound may be negative, especially if the bounds are unknown or may be user-specified.- Overrides:
nextSignedLongin classEnhancedRandom- Parameters:
inner- the inclusive inner bound; may be any long, allowing negativeouter- the exclusive outer bound; may be any long, allowing negative- Returns:
- a pseudorandom long between innerBound (inclusive) and outerBound (exclusive)
- See Also:
-
nextBoolean
public boolean nextBoolean()Description copied from class:EnhancedRandomReturns the next pseudorandom, uniformly distributedbooleanvalue from this random number generator's sequence. The general contract ofnextBooleanis that onebooleanvalue is pseudorandomly generated and returned. The valuestrueandfalseare produced with (approximately) equal probability.
The public implementation simply returns a sign check onEnhancedRandom.nextLong(), returning true if the generated long is negative. This is typically the safest way to implement this method; many types of generators have less statistical quality on their lowest bit, so just returning based on the lowest bit isn't always a good idea.- Specified by:
nextBooleanin interfaceRandomGenerator- Overrides:
nextBooleanin classEnhancedRandom- Returns:
- the next pseudorandom, uniformly distributed
booleanvalue from this random number generator's sequence
-
nextFloat
public float nextFloat()Description copied from class:EnhancedRandomReturns the next pseudorandom, uniformly distributedfloatvalue between0.0(inclusive) and1.0(exclusive) from this random number generator's sequence.The general contract of
nextFloatis that onefloatvalue, chosen (approximately) uniformly from the range0.0f(inclusive) to1.0f(exclusive), is pseudorandomly generated and returned. All 224 possiblefloatvalues of the form m x 2-24, where m is a positive integer less than 224, are produced with (approximately) equal probability.The public implementation uses the upper 24 bits of
EnhancedRandom.nextLong(), with an unsigned right shift and a multiply by a very small float (5.9604645E-8for0x1p-24f). It tends to be fast if nextLong() is fast, but alternative implementations could use 24 bits ofEnhancedRandom.nextInt()(or justEnhancedRandom.next(int), giving it24) if that generator doesn't efficiently generate 64-bit longs.- Specified by:
nextFloatin interfaceRandomGenerator- Overrides:
nextFloatin classEnhancedRandom- Returns:
- the next pseudorandom, uniformly distributed
floatvalue between0.0and1.0from this random number generator's sequence
-
copy
Description copied from class:EnhancedRandomCreates a new EnhancedRandom with identical states to this one, so if the same EnhancedRandom methods are called on this object and its copy (in the same order), the same outputs will be produced. This is not guaranteed to copy the inherited state of any parent class, so if you call methods that are only implemented by a superclass (likeRandom) and not this one, the results may differ.- Specified by:
copyin classEnhancedRandom- Returns:
- a deep copy of this EnhancedRandom.
-
equals
-
toString
-