Package com.github.tommyettinger.random
Class ScruffRandom
java.lang.Object
java.util.Random
com.github.tommyettinger.random.EnhancedRandom
com.github.tommyettinger.random.ScruffRandom
- All Implemented Interfaces:
- Externalizable,- Serializable,- RandomGenerator
A generator with 4 
Quality-wise, this does very well in testing. It passes 64TB of PractRand with no anomalies, and has passed 89PB of the ReMortality test with a strong final result (7.97358e-01, a one-sided p-value where close to 1.0 is best). This isn't cryptographically secure (at all), but as a non-cryptographic generator it does the job. While WhiskerRandom has only a very small chance of randomly finding an unusually short cycle (short enough to exhaust in, say, a month), ScruffRandom has no chance of finding such a short cycle, since all of its cycles have lengths that are multiples of 2 to the 64 (which currently takes longer than a month to exhaust on one machine, though if you attacked a generator using a top-notch GPU, you could get close... if you happened to find a cycle with an incredibly low multiple).
The name continues the theme of WhiskerRandom, naming generators after where my cats like to get scratched.
long states and a guaranteed minimum period of 2 to the 64, this is structured much like
 WhiskerRandom and is almost as fast. In each call to nextLong(), this performs 5 different operations: add a
 constant, subtract two variables, multiply by a constant, XOR two variables, and bitwise-rotate one variable (this is
 one hardware instruction on desktop JVMs and probably many others). None of these operations have any data dependency
 on each other, so all of nextLong() can be performed with instruction-level parallelism when available. That's how,
 on a laptop, this can produce 1.6 billion longs per second when ThreadLocalRandom can only produce about 940 million
 longs per second (and ThreadLocalRandom uses JVM-internal variables, too).
 Quality-wise, this does very well in testing. It passes 64TB of PractRand with no anomalies, and has passed 89PB of the ReMortality test with a strong final result (7.97358e-01, a one-sided p-value where close to 1.0 is best). This isn't cryptographically secure (at all), but as a non-cryptographic generator it does the job. While WhiskerRandom has only a very small chance of randomly finding an unusually short cycle (short enough to exhaust in, say, a month), ScruffRandom has no chance of finding such a short cycle, since all of its cycles have lengths that are multiples of 2 to the 64 (which currently takes longer than a month to exhaust on one machine, though if you attacked a generator using a top-notch GPU, you could get close... if you happened to find a cycle with an incredibly low multiple).
The name continues the theme of WhiskerRandom, naming generators after where my cats like to get scratched.
- See Also:
- 
Nested Class SummaryNested classes/interfaces inherited from interface java.util.random.RandomGeneratorRandomGenerator.ArbitrarilyJumpableGenerator, RandomGenerator.JumpableGenerator, RandomGenerator.LeapableGenerator, RandomGenerator.SplittableGenerator, RandomGenerator.StreamableGenerator
- 
Field SummaryFields
- 
Constructor SummaryConstructorsConstructorDescriptionCreates a new ScruffRandom with a random state.ScruffRandom(long seed) Creates a new ScruffRandom with the given seed; alllongvalues are permitted.ScruffRandom(long stateA, long stateB, long stateC, long stateD) Creates a new ScruffRandom with the given four states; alllongvalues are permitted except thatstateAmust be odd, otherwise it will have 1 added to it to make it odd.
- 
Method SummaryModifier 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 64.longgetSelectedState(int selection) Gets the state determined byselection, as-is.longlonglongintThis generator has 4longstates, so this returns 4.longgetTag()Gets the tag used to identify this type of EnhancedRandom, as a String.longleap()Jumps extremely far in the generator's sequence, such that one call to leap() advances the state as many asMath.pow(2, 48)calls tonextLong().intnext(int bits) Generates the next pseudorandom number with a specific maximum size in bits (not a max number).longnextLong()Returns the next pseudorandom, uniformly distributedlongvalue from this random number generator's sequence.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 4 states of the generator to random values based on the given seed.voidsetSelectedState(int selection, long value) Sets one of the states, determined byselection, tovalue, as-is.voidsetState(long stateA, long stateB, long stateC, long stateD) Sets the state completely to the given four state variables.voidsetStateA(long stateA) Sets the first part of the state.voidsetStateB(long stateB) Sets the second part of the state.voidsetStateC(long stateC) Sets the third part of the state.voidsetStateD(long stateD) Sets the fourth part of the state.toString()Methods inherited from class com.github.tommyettinger.random.EnhancedRandomappendSerialized, appendSerialized, areEqual, fixGamma, fixGamma, lcm, mainlyGeneratesInt, maxDoubleOf, maxFloatOf, maxIntOf, maxLongOf, minDoubleOf, minFloatOf, minIntOf, minLongOf, nextBoolean, nextBoolean, nextBytes, nextDouble, nextDouble, nextDouble, nextExclusiveDouble, nextExclusiveDouble, nextExclusiveDouble, nextExclusiveDoubleEquidistant, nextExclusiveFloat, nextExclusiveFloat, nextExclusiveFloat, nextExclusiveFloatEquidistant, nextExclusiveSignedDouble, nextExclusiveSignedFloat, nextExponential, nextFloat, nextFloat, nextFloat, nextGaussian, nextGaussian, nextGaussianFloat, nextGaussianFloat, nextInclusiveDouble, nextInclusiveDouble, nextInclusiveDouble, nextInclusiveFloat, nextInclusiveFloat, nextInclusiveFloat, nextInt, nextInt, nextInt, nextLong, nextLong, nextSign, nextSignedInt, nextSignedInt, nextSignedLong, nextSignedLong, nextTriangular, nextTriangular, nextTriangular, nextTriangular, nextUnsignedInt, previousInt, 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.Randomdoubles, doubles, doubles, doubles, ints, ints, ints, ints, longs, longs, longs, longsMethods inherited from class java.lang.Objectclone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.random.RandomGeneratorisDeprecated
- 
Field Details- 
stateAprotected long stateAThe first state; can be any odd-number long.
- 
stateBprotected long stateBThe second state; can be any long.
- 
stateCprotected long stateCThe third state; can be any long.
- 
stateDprotected long stateDThe fourth state; can be any long.
 
- 
- 
Constructor Details- 
ScruffRandompublic ScruffRandom()Creates a new ScruffRandom with a random state.
- 
ScruffRandompublic ScruffRandom(long seed) Creates a new ScruffRandom with the given seed; alllongvalues are permitted. The seed will be passed tosetSeed(long)to attempt to adequately distribute the seed randomly.- Parameters:
- seed- any- longvalue
 
- 
ScruffRandompublic ScruffRandom(long stateA, long stateB, long stateC, long stateD) Creates a new ScruffRandom with the given four states; alllongvalues are permitted except thatstateAmust be odd, otherwise it will have 1 added to it to make it odd. Other than that, these states will be used verbatim.- Parameters:
- stateA- any- longvalue
- stateB- any- longvalue
- stateC- any- longvalue
- stateD- any- longvalue
 
 
- 
- 
Method Details- 
getTagDescription 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 class- EnhancedRandom
- Returns:
- a unique String identifier for this type of EnhancedRandom; usually 4 chars long.
 
- 
getMinimumPeriod2 to the 64.- Overrides:
- getMinimumPeriodin class- EnhancedRandom
- Returns:
- 2 to the 64
 
- 
getStateCountpublic int getStateCount()This generator has 4longstates, so this returns 4.- Overrides:
- getStateCountin class- EnhancedRandom
- Returns:
- 4 (four)
 
- 
getSelectedStatepublic long getSelectedState(int selection) Gets the state determined byselection, as-is. The value for selection should be between 0 and 3, inclusive; if it is any other value this gets state D as if 3 was given.- Overrides:
- getSelectedStatein class- EnhancedRandom
- Parameters:
- selection- used to select which state variable to get; generally 0, 1, 2, or 3
- Returns:
- the value of the selected state
 
- 
setSelectedStatepublic void setSelectedState(int selection, long value) Sets one of the states, determined byselection, tovalue, as-is. Selections 0, 1, 2, and 3 refer to states A, B, C, and D, and if the selection is anything else, this treats it as 3 and sets stateD.- Overrides:
- setSelectedStatein class- EnhancedRandom
- Parameters:
- selection- used to select which state variable to set; generally 0, 1, 2, or 3
- value- the exact value to use for the selected state, if valid
 
- 
setSeedpublic void setSeed(long seed) This initializes all 4 states of the generator to random values based on the given seed. (2 to the 64) possible initial generator states can be produced here, all with a different first value returned bynextLong().- Specified by:
- setSeedin class- EnhancedRandom
- Parameters:
- seed- the initial seed; may be any long
 
- 
getStateApublic long getStateA()
- 
setStateApublic void setStateA(long stateA) Sets the first part of the state.- Parameters:
- stateA- can be any long
 
- 
getStateBpublic long getStateB()
- 
setStateBpublic void setStateB(long stateB) Sets the second part of the state.- Parameters:
- stateB- can be any long
 
- 
getStateCpublic long getStateC()
- 
setStateCpublic void setStateC(long stateC) Sets the third part of the state.- Parameters:
- stateC- can be any long
 
- 
getStateDpublic long getStateD()
- 
setStateDpublic void setStateD(long stateD) Sets the fourth part of the state.- Parameters:
- stateD- can be any long
 
- 
setStatepublic void setState(long stateA, long stateB, long stateC, long stateD) Sets the state completely to the given four state variables. This is the same as callingsetStateA(long),setStateB(long),setStateC(long), andsetStateD(long)as a group.- Overrides:
- setStatein class- EnhancedRandom
- Parameters:
- stateA- the first state; can be any long
- stateB- the second state; can be any long
- stateC- the third state; can be any long
- stateD- the fourth state; can be any long
 
- 
nextLongpublic 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 interface- RandomGenerator
- Specified by:
- nextLongin class- EnhancedRandom
- Returns:
- the next pseudorandom, uniformly distributed longvalue from this random number generator's sequence
 
- 
previousLongpublic 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 class- EnhancedRandom
- Returns:
- the previous number this would have produced with EnhancedRandom.nextLong()
 
- 
leappublic long leap()Jumps extremely far in the generator's sequence, such that one call to leap() advances the state as many asMath.pow(2, 48)calls tonextLong(). This can be used to create 65536 substreams of this generator's sequence, each with a period of at leastMath.pow(2, 48)but likely much more.- Returns:
- the result of what nextLong() would return if it was called at the state this jumped to
 
- 
nextpublic 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 class- EnhancedRandom
- 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
 
- 
copyDescription 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 class- EnhancedRandom
- Returns:
- a deep copy of this EnhancedRandom.
 
- 
equals
- 
toString
 
-