26 |
|
package java.util; |
27 |
|
|
28 |
|
import java.util.concurrent.atomic.AtomicLong; |
29 |
< |
import java.util.Spliterator; |
29 |
> |
import java.util.function.DoubleConsumer; |
30 |
|
import java.util.function.IntConsumer; |
31 |
|
import java.util.function.LongConsumer; |
32 |
< |
import java.util.function.DoubleConsumer; |
33 |
< |
import java.util.stream.StreamSupport; |
32 |
> |
import java.util.stream.DoubleStream; |
33 |
|
import java.util.stream.IntStream; |
34 |
|
import java.util.stream.LongStream; |
35 |
< |
import java.util.stream.DoubleStream; |
37 |
< |
|
35 |
> |
import java.util.stream.StreamSupport; |
36 |
|
|
37 |
|
/** |
38 |
|
* A generator of uniform pseudorandom values applicable for use in |
39 |
|
* (among other contexts) isolated parallel computations that may |
40 |
< |
* generate subtasks. Class SplittableRandom supports methods for |
40 |
> |
* generate subtasks. Class {@code SplittableRandom} supports methods for |
41 |
|
* producing pseudorandom numbers of type {@code int}, {@code long}, |
42 |
|
* and {@code double} with similar usages as for class |
43 |
< |
* {@link java.util.Random} but differs in the following ways: <ul> |
43 |
> |
* {@link java.util.Random} but differs in the following ways: |
44 |
> |
* |
45 |
> |
* <ul> |
46 |
|
* |
47 |
|
* <li>Series of generated values pass the DieHarder suite testing |
48 |
|
* independence and uniformity properties of random number generators. |
50 |
|
* href="http://www.phy.duke.edu/~rgb/General/dieharder.php"> version |
51 |
|
* 3.31.1</a>.) These tests validate only the methods for certain |
52 |
|
* types and ranges, but similar properties are expected to hold, at |
53 |
< |
* least approximately, for others as well. </li> |
53 |
> |
* least approximately, for others as well. The <em>period</em> |
54 |
> |
* (length of any series of generated values before it repeats) is at |
55 |
> |
* least 2<sup>64</sup>. |
56 |
|
* |
57 |
< |
* <li> Method {@link #split} constructs and returns a new |
57 |
> |
* <li>Method {@link #split} constructs and returns a new |
58 |
|
* SplittableRandom instance that shares no mutable state with the |
59 |
< |
* current instance. However, with very high probability, the set of |
60 |
< |
* values collectively generated by the two objects has the same |
59 |
> |
* current instance. However, with very high probability, the |
60 |
> |
* values collectively generated by the two objects have the same |
61 |
|
* statistical properties as if the same quantity of values were |
62 |
|
* generated by a single thread using a single {@code |
63 |
< |
* SplittableRandom} object. </li> |
63 |
> |
* SplittableRandom} object. |
64 |
|
* |
65 |
|
* <li>Instances of SplittableRandom are <em>not</em> thread-safe. |
66 |
|
* They are designed to be split, not shared, across threads. For |
71 |
|
* |
72 |
|
* <li>This class provides additional methods for generating random |
73 |
|
* streams, that employ the above techniques when used in {@code |
74 |
< |
* stream.parallel()} mode.</li> |
74 |
> |
* stream.parallel()} mode. |
75 |
|
* |
76 |
|
* </ul> |
77 |
|
* |
78 |
+ |
* <p>Instances of {@code SplittableRandom} are not cryptographically |
79 |
+ |
* secure. Consider instead using {@link java.security.SecureRandom} |
80 |
+ |
* in security-sensitive applications. Additionally, |
81 |
+ |
* default-constructed instances do not use a cryptographically random |
82 |
+ |
* seed unless the {@linkplain System#getProperty system property} |
83 |
+ |
* {@code java.util.secureRandomSeed} is set to {@code true}. |
84 |
+ |
* |
85 |
|
* @author Guy Steele |
86 |
|
* @author Doug Lea |
87 |
|
* @since 1.8 |
88 |
|
*/ |
89 |
< |
public class SplittableRandom { |
81 |
< |
|
82 |
< |
/* |
83 |
< |
* File organization: First the non-public methods that constitute |
84 |
< |
* the main algorithm, then the main public methods, followed by |
85 |
< |
* some custom spliterator classes needed for stream methods. |
86 |
< |
* |
87 |
< |
* Credits: Primary algorithm and code by Guy Steele. Stream |
88 |
< |
* support methods by Doug Lea. Documentation jointly produced |
89 |
< |
* with additional help from Brian Goetz. |
90 |
< |
*/ |
89 |
> |
public final class SplittableRandom { |
90 |
|
|
91 |
|
/* |
92 |
|
* Implementation Overview. |
94 |
|
* This algorithm was inspired by the "DotMix" algorithm by |
95 |
|
* Leiserson, Schardl, and Sukha "Deterministic Parallel |
96 |
|
* Random-Number Generation for Dynamic-Multithreading Platforms", |
97 |
< |
* PPoPP 2012, but improves and extends it in several ways. |
97 |
> |
* PPoPP 2012, as well as those in "Parallel random numbers: as |
98 |
> |
* easy as 1, 2, 3" by Salmon, Morae, Dror, and Shaw, SC 2011. It |
99 |
> |
* differs mainly in simplifying and cheapening operations. |
100 |
> |
* |
101 |
> |
* The primary update step (method nextSeed()) is to add a |
102 |
> |
* constant ("gamma") to the current (64 bit) seed, forming a |
103 |
> |
* simple sequence. The seed and the gamma values for any two |
104 |
> |
* SplittableRandom instances are highly likely to be different. |
105 |
> |
* |
106 |
> |
* Methods nextLong, nextInt, and derivatives do not return the |
107 |
> |
* sequence (seed) values, but instead a hash-like bit-mix of |
108 |
> |
* their bits, producing more independently distributed sequences. |
109 |
> |
* For nextLong, the mix64 function is based on David Stafford's |
110 |
> |
* (http://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html) |
111 |
> |
* "Mix13" variant of the "64-bit finalizer" function in Austin |
112 |
> |
* Appleby's MurmurHash3 algorithm (see |
113 |
> |
* http://code.google.com/p/smhasher/wiki/MurmurHash3). The mix32 |
114 |
> |
* function is based on Stafford's Mix04 mix function, but returns |
115 |
> |
* the upper 32 bits cast as int. |
116 |
> |
* |
117 |
> |
* The split operation uses the current generator to form the seed |
118 |
> |
* and gamma for another SplittableRandom. To conservatively |
119 |
> |
* avoid potential correlations between seed and value generation, |
120 |
> |
* gamma selection (method mixGamma) uses different |
121 |
> |
* (Murmurhash3's) mix constants. To avoid potential weaknesses |
122 |
> |
* in bit-mixing transformations, we restrict gammas to odd values |
123 |
> |
* with at least 24 0-1 or 1-0 bit transitions. Rather than |
124 |
> |
* rejecting candidates with too few or too many bits set, method |
125 |
> |
* mixGamma flips some bits (which has the effect of mapping at |
126 |
> |
* most 4 to any given gamma value). This reduces the effective |
127 |
> |
* set of 64bit odd gamma values by about 2%, and serves as an |
128 |
> |
* automated screening for sequence constant selection that is |
129 |
> |
* left as an empirical decision in some other hashing and crypto |
130 |
> |
* algorithms. |
131 |
> |
* |
132 |
> |
* The resulting generator thus transforms a sequence in which |
133 |
> |
* (typically) many bits change on each step, with an inexpensive |
134 |
> |
* mixer with good (but less than cryptographically secure) |
135 |
> |
* avalanching. |
136 |
> |
* |
137 |
> |
* The default (no-argument) constructor, in essence, invokes |
138 |
> |
* split() for a common "defaultGen" SplittableRandom. Unlike |
139 |
> |
* other cases, this split must be performed in a thread-safe |
140 |
> |
* manner, so we use an AtomicLong to represent the seed rather |
141 |
> |
* than use an explicit SplittableRandom. To bootstrap the |
142 |
> |
* defaultGen, we start off using a seed based on current time |
143 |
> |
* unless the java.util.secureRandomSeed property is set. This |
144 |
> |
* serves as a slimmed-down (and insecure) variant of SecureRandom |
145 |
> |
* that also avoids stalls that may occur when using /dev/random. |
146 |
> |
* |
147 |
> |
* It is a relatively simple matter to apply the basic design here |
148 |
> |
* to use 128 bit seeds. However, emulating 128bit arithmetic and |
149 |
> |
* carrying around twice the state add more overhead than appears |
150 |
> |
* warranted for current usages. |
151 |
|
* |
152 |
< |
* The primary update step is simply to add a constant ("gamma") |
153 |
< |
* to the current seed, modulo a prime ("George"). However, the |
154 |
< |
* nextLong and nextInt methods do not return this value, but |
155 |
< |
* instead the results of bit-mixing transformations that produce |
104 |
< |
* more uniformly distributed sequences. |
105 |
< |
* |
106 |
< |
* "George" is the otherwise nameless (because it cannot be |
107 |
< |
* represented) prime number 2^64+13. Using a prime number larger |
108 |
< |
* than can fit in a long ensures that all possible long values |
109 |
< |
* can occur, plus 13 others that just get skipped over when they |
110 |
< |
* are encountered; see method addGammaModGeorge. For this to |
111 |
< |
* work, initial gamma values must be at least 13. |
112 |
< |
* |
113 |
< |
* The value of gamma differs for each instance across a series of |
114 |
< |
* splits, and is generated using a slightly stripped-down variant |
115 |
< |
* of the same algorithm, but operating across calls to split(), |
116 |
< |
* not calls to nextSeed(): Each instance carries the state of |
117 |
< |
* this generator as nextSplit, and uses mix64(nextSplit) as its |
118 |
< |
* own gamma value. Computations of gammas themselves use a fixed |
119 |
< |
* constant as the second argument to the addGammaModGeorge |
120 |
< |
* function, GAMMA_GAMMA, a "genuinely random" number from a |
121 |
< |
* radioactive decay reading (obtained from |
122 |
< |
* http://www.fourmilab.ch/hotbits/) meeting the above range |
123 |
< |
* constraint. Using a fixed constant maintains the invariant that |
124 |
< |
* the value of gamma is the same for every instance that is at |
125 |
< |
* the same split-distance from their common root. (Note: there is |
126 |
< |
* nothing especially magic about obtaining this constant from a |
127 |
< |
* "truly random" physical source rather than just choosing one |
128 |
< |
* arbitrarily; using "hotbits" was merely an aesthetically pleasing |
129 |
< |
* choice. In either case, good statistical behavior of the |
130 |
< |
* algorithm should be, and was, verified by using the DieHarder |
131 |
< |
* test suite.) |
132 |
< |
* |
133 |
< |
* The mix64 bit-mixing function called by nextLong and other |
134 |
< |
* methods computes the same value as the "64-bit finalizer" |
135 |
< |
* function in Austin Appleby's MurmurHash3 algorithm. See |
136 |
< |
* http://code.google.com/p/smhasher/wiki/MurmurHash3 , which |
137 |
< |
* comments: "The constants for the finalizers were generated by a |
138 |
< |
* simple simulated-annealing algorithm, and both avalanche all |
139 |
< |
* bits of 'h' to within 0.25% bias." It also appears to work to |
140 |
< |
* use instead any of the variants proposed by David Stafford at |
141 |
< |
* http://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html |
142 |
< |
* but these variants have not yet been tested as thoroughly |
143 |
< |
* in the context of the implementation of SplittableRandom. |
144 |
< |
* |
145 |
< |
* The mix32 function used for nextInt just consists of two of the |
146 |
< |
* five lines of mix64; avalanche testing shows that the 64-bit result |
147 |
< |
* has its top 32 bits avalanched well, though not the bottom 32 bits. |
148 |
< |
* DieHarder tests show that it is adequate for generating one |
149 |
< |
* random int from the 64-bit result of nextSeed. |
150 |
< |
* |
151 |
< |
* Support for the default (no-argument) constructor relies on an |
152 |
< |
* AtomicLong (defaultSeedGenerator) to help perform the |
153 |
< |
* equivalent of a split of a statically constructed |
154 |
< |
* SplittableRandom. Unlike other cases, this split must be |
155 |
< |
* performed in a thread-safe manner. We use |
156 |
< |
* AtomicLong.compareAndSet as the (typically) most efficient |
157 |
< |
* mechanism. To bootstrap, we start off using System.nanotime(), |
158 |
< |
* and update using another "genuinely random" constant |
159 |
< |
* DEFAULT_SEED_GAMMA. The default constructor uses GAMMA_GAMMA, |
160 |
< |
* not 0, for its splitSeed argument (addGammaModGeorge(0, |
161 |
< |
* GAMMA_GAMMA) == GAMMA_GAMMA) to reflect that each is split from |
162 |
< |
* this root generator, even though the root is not explicitly |
163 |
< |
* represented as a SplittableRandom. |
164 |
< |
*/ |
165 |
< |
|
166 |
< |
/** |
167 |
< |
* The "genuinely random" value for producing new gamma values. |
168 |
< |
* The value is arbitrary, subject to the requirement that it be |
169 |
< |
* greater or equal to 13. |
170 |
< |
*/ |
171 |
< |
private static final long GAMMA_GAMMA = 0xF2281E2DBA6606F3L; |
172 |
< |
|
173 |
< |
/** |
174 |
< |
* The "genuinely random" seed update value for default constructors. |
175 |
< |
* The value is arbitrary, subject to the requirement that it be |
176 |
< |
* greater or equal to 13. |
177 |
< |
*/ |
178 |
< |
private static final long DEFAULT_SEED_GAMMA = 0xBD24B73A95FB84D9L; |
152 |
> |
* File organization: First the non-public methods that constitute |
153 |
> |
* the main algorithm, then the main public methods, followed by |
154 |
> |
* some custom spliterator classes needed for stream methods. |
155 |
> |
*/ |
156 |
|
|
157 |
|
/** |
158 |
< |
* The next seed for default constructors. |
158 |
> |
* The golden ratio scaled to 64bits, used as the initial gamma |
159 |
> |
* value for (unsplit) SplittableRandoms. |
160 |
|
*/ |
161 |
< |
private static final AtomicLong defaultSeedGenerator = |
184 |
< |
new AtomicLong(System.nanoTime()); |
161 |
> |
private static final long GOLDEN_GAMMA = 0x9e3779b97f4a7c15L; |
162 |
|
|
163 |
|
/** |
164 |
< |
* The seed, updated only via method nextSeed. |
164 |
> |
* The least non-zero value returned by nextDouble(). This value |
165 |
> |
* is scaled by a random value of 53 bits to produce a result. |
166 |
|
*/ |
167 |
< |
private long seed; |
167 |
> |
private static final double DOUBLE_UNIT = 0x1.0p-53; // 1.0 / (1L << 53); |
168 |
|
|
169 |
|
/** |
170 |
< |
* The constant value added to seed (mod George) on each update. |
170 |
> |
* The seed. Updated only via method nextSeed. |
171 |
|
*/ |
172 |
< |
private final long gamma; |
172 |
> |
private long seed; |
173 |
|
|
174 |
|
/** |
175 |
< |
* The next seed to use for splits. Propagated using |
198 |
< |
* addGammaModGeorge across instances. |
175 |
> |
* The step value. |
176 |
|
*/ |
177 |
< |
private final long nextSplit; |
177 |
> |
private final long gamma; |
178 |
|
|
179 |
|
/** |
180 |
< |
* Internal constructor used by all other constructors and by |
204 |
< |
* method split. Establishes the initial seed for this instance, |
205 |
< |
* and uses the given splitSeed to establish gamma, as well as the |
206 |
< |
* nextSplit to use by this instance. |
180 |
> |
* Internal constructor used by all others except default constructor. |
181 |
|
*/ |
182 |
< |
private SplittableRandom(long seed, long splitSeed) { |
182 |
> |
private SplittableRandom(long seed, long gamma) { |
183 |
|
this.seed = seed; |
184 |
< |
long s = splitSeed, g; |
211 |
< |
do { // ensure gamma >= 13, considered as an unsigned integer |
212 |
< |
s = addGammaModGeorge(s, GAMMA_GAMMA); |
213 |
< |
g = mix64(s); |
214 |
< |
} while (Long.compareUnsigned(g, 13L) < 0); |
215 |
< |
this.gamma = g; |
216 |
< |
this.nextSplit = s; |
184 |
> |
this.gamma = gamma; |
185 |
|
} |
186 |
|
|
187 |
|
/** |
188 |
< |
* Adds the given gamma value, g, to the given seed value s, mod |
189 |
< |
* George (2^64+13). We regard s and g as unsigned values |
190 |
< |
* (ranging from 0 to 2^64-1). We add g to s either once or twice |
191 |
< |
* (mod George) as necessary to produce an (unsigned) result less |
192 |
< |
* than 2^64. We require that g must be at least 13. This |
193 |
< |
* guarantees that if (s+g) mod George >= 2^64 then (s+g+g) mod |
226 |
< |
* George < 2^64; thus we need only a conditional, not a loop, |
227 |
< |
* to be sure of getting a representable value. |
228 |
< |
* |
229 |
< |
* @param s a seed value |
230 |
< |
* @param g a gamma value, 13 <= g (as unsigned) |
231 |
< |
*/ |
232 |
< |
private static long addGammaModGeorge(long s, long g) { |
233 |
< |
long p = s + g; |
234 |
< |
if (Long.compareUnsigned(p, g) >= 0) |
235 |
< |
return p; |
236 |
< |
long q = p - 13L; |
237 |
< |
return (Long.compareUnsigned(p, 13L) >= 0) ? q : (q + g); |
188 |
> |
* Computes Stafford variant 13 of 64bit mix function. |
189 |
> |
*/ |
190 |
> |
private static long mix64(long z) { |
191 |
> |
z = (z ^ (z >>> 30)) * 0xbf58476d1ce4e5b9L; |
192 |
> |
z = (z ^ (z >>> 27)) * 0x94d049bb133111ebL; |
193 |
> |
return z ^ (z >>> 31); |
194 |
|
} |
195 |
|
|
196 |
|
/** |
197 |
< |
* Updates in-place and returns seed. |
242 |
< |
* See above for explanation. |
197 |
> |
* Returns the 32 high bits of Stafford variant 4 mix64 function as int. |
198 |
|
*/ |
199 |
< |
private long nextSeed() { |
200 |
< |
return seed = addGammaModGeorge(seed, gamma); |
199 |
> |
private static int mix32(long z) { |
200 |
> |
z = (z ^ (z >>> 33)) * 0x62a9d9ed799705f5L; |
201 |
> |
return (int)(((z ^ (z >>> 28)) * 0xcb24d0a5c88c35b3L) >>> 32); |
202 |
|
} |
203 |
|
|
204 |
|
/** |
205 |
< |
* Returns a bit-mixed transformation of its argument. |
250 |
< |
* See above for explanation. |
205 |
> |
* Returns the gamma value to use for a new split instance. |
206 |
|
*/ |
207 |
< |
private static long mix64(long z) { |
208 |
< |
z ^= (z >>> 33); |
209 |
< |
z *= 0xff51afd7ed558ccdL; |
210 |
< |
z ^= (z >>> 33); |
211 |
< |
z *= 0xc4ceb9fe1a85ec53L; |
212 |
< |
z ^= (z >>> 33); |
258 |
< |
return z; |
207 |
> |
private static long mixGamma(long z) { |
208 |
> |
z = (z ^ (z >>> 33)) * 0xff51afd7ed558ccdL; // MurmurHash3 mix constants |
209 |
> |
z = (z ^ (z >>> 33)) * 0xc4ceb9fe1a85ec53L; |
210 |
> |
z = (z ^ (z >>> 33)) | 1L; // force to be odd |
211 |
> |
int n = Long.bitCount(z ^ (z >>> 1)); // ensure enough transitions |
212 |
> |
return (n < 24) ? z ^ 0xaaaaaaaaaaaaaaaaL : z; |
213 |
|
} |
214 |
|
|
215 |
|
/** |
216 |
< |
* Returns a bit-mixed int transformation of its argument. |
263 |
< |
* See above for explanation. |
216 |
> |
* Adds gamma to seed. |
217 |
|
*/ |
218 |
< |
private static int mix32(long z) { |
219 |
< |
z ^= (z >>> 33); |
267 |
< |
z *= 0xc4ceb9fe1a85ec53L; |
268 |
< |
return (int)(z >>> 32); |
218 |
> |
private long nextSeed() { |
219 |
> |
return seed += gamma; |
220 |
|
} |
221 |
|
|
222 |
< |
/** |
223 |
< |
* Atomically updates and returns next seed for default constructor |
224 |
< |
*/ |
225 |
< |
private static long nextDefaultSeed() { |
226 |
< |
long oldSeed, newSeed; |
227 |
< |
do { |
228 |
< |
oldSeed = defaultSeedGenerator.get(); |
229 |
< |
newSeed = addGammaModGeorge(oldSeed, DEFAULT_SEED_GAMMA); |
230 |
< |
} while (!defaultSeedGenerator.compareAndSet(oldSeed, newSeed)); |
231 |
< |
return mix64(newSeed); |
222 |
> |
// IllegalArgumentException messages |
223 |
> |
static final String BAD_BOUND = "bound must be positive"; |
224 |
> |
static final String BAD_RANGE = "bound must be greater than origin"; |
225 |
> |
static final String BAD_SIZE = "size must be non-negative"; |
226 |
> |
|
227 |
> |
/** |
228 |
> |
* The seed generator for default constructors. |
229 |
> |
*/ |
230 |
> |
private static final AtomicLong defaultGen |
231 |
> |
= new AtomicLong(mix64(System.currentTimeMillis()) ^ |
232 |
> |
mix64(System.nanoTime())); |
233 |
> |
|
234 |
> |
// at end of <clinit> to survive static initialization circularity |
235 |
> |
static { |
236 |
> |
if (java.security.AccessController.doPrivileged( |
237 |
> |
new java.security.PrivilegedAction<Boolean>() { |
238 |
> |
public Boolean run() { |
239 |
> |
return Boolean.getBoolean("java.util.secureRandomSeed"); |
240 |
> |
}})) { |
241 |
> |
byte[] seedBytes = java.security.SecureRandom.getSeed(8); |
242 |
> |
long s = (long)seedBytes[0] & 0xffL; |
243 |
> |
for (int i = 1; i < 8; ++i) |
244 |
> |
s = (s << 8) | ((long)seedBytes[i] & 0xffL); |
245 |
> |
defaultGen.set(s); |
246 |
> |
} |
247 |
|
} |
248 |
|
|
249 |
|
/* |
277 |
|
* evenly divisible by the range. The loop rejects candidates |
278 |
|
* computed from otherwise over-represented values. The |
279 |
|
* expected number of iterations under an ideal generator |
280 |
< |
* varies from 1 to 2, depending on the bound. |
280 |
> |
* varies from 1 to 2, depending on the bound. The loop itself |
281 |
> |
* takes an unlovable form. Because the first candidate is |
282 |
> |
* already available, we need a break-in-the-middle |
283 |
> |
* construction, which is concisely but cryptically performed |
284 |
> |
* within the while-condition of a body-less for loop. |
285 |
|
* |
286 |
|
* 4. Otherwise, the range cannot be represented as a positive |
287 |
< |
* long. Repeatedly generate unbounded longs until obtaining |
288 |
< |
* a candidate meeting constraints (with an expected number of |
289 |
< |
* iterations of less than two). |
287 |
> |
* long. The loop repeatedly generates unbounded longs until |
288 |
> |
* obtaining a candidate meeting constraints (with an expected |
289 |
> |
* number of iterations of less than two). |
290 |
|
*/ |
291 |
|
|
292 |
|
long r = mix64(nextSeed()); |
293 |
|
if (origin < bound) { |
294 |
|
long n = bound - origin, m = n - 1; |
295 |
< |
if ((n & m) == 0L) // power of two |
295 |
> |
if ((n & m) == 0L) // power of two |
296 |
|
r = (r & m) + origin; |
297 |
< |
else if (n > 0) { // reject over-represented candidates |
297 |
> |
else if (n > 0L) { // reject over-represented candidates |
298 |
|
for (long u = r >>> 1; // ensure nonnegative |
299 |
< |
u + m - (r = u % n) < 0L; // reject |
299 |
> |
u + m - (r = u % n) < 0L; // rejection check |
300 |
|
u = mix64(nextSeed()) >>> 1) // retry |
301 |
|
; |
302 |
|
r += origin; |
303 |
|
} |
304 |
< |
else { // range not representable as long |
304 |
> |
else { // range not representable as long |
305 |
|
while (r < origin || r >= bound) |
306 |
|
r = mix64(nextSeed()); |
307 |
|
} |
321 |
|
int r = mix32(nextSeed()); |
322 |
|
if (origin < bound) { |
323 |
|
int n = bound - origin, m = n - 1; |
324 |
< |
if ((n & m) == 0L) |
324 |
> |
if ((n & m) == 0) |
325 |
|
r = (r & m) + origin; |
326 |
|
else if (n > 0) { |
327 |
|
for (int u = r >>> 1; |
328 |
< |
u + m - (r = u % n) < 0L; |
328 |
> |
u + m - (r = u % n) < 0; |
329 |
|
u = mix32(nextSeed()) >>> 1) |
330 |
|
; |
331 |
|
r += origin; |
346 |
|
* @return a pseudorandom value |
347 |
|
*/ |
348 |
|
final double internalNextDouble(double origin, double bound) { |
349 |
< |
long bits = (1023L << 52) | (nextLong() >>> 12); |
380 |
< |
double r = Double.longBitsToDouble(bits) - 1.0; |
349 |
> |
double r = (nextLong() >>> 11) * DOUBLE_UNIT; |
350 |
|
if (origin < bound) { |
351 |
|
r = r * (bound - origin) + origin; |
352 |
< |
if (r == bound) // correct for rounding |
352 |
> |
if (r >= bound) // correct for rounding |
353 |
|
r = Double.longBitsToDouble(Double.doubleToLongBits(bound) - 1); |
354 |
|
} |
355 |
|
return r; |
358 |
|
/* ---------------- public methods ---------------- */ |
359 |
|
|
360 |
|
/** |
361 |
< |
* Creates a new SplittableRandom instance using the given initial |
362 |
< |
* seed. Two SplittableRandom instances created with the same seed |
363 |
< |
* generate identical sequences of values. |
361 |
> |
* Creates a new SplittableRandom instance using the specified |
362 |
> |
* initial seed. SplittableRandom instances created with the same |
363 |
> |
* seed in the same program generate identical sequences of values. |
364 |
|
* |
365 |
|
* @param seed the initial seed |
366 |
|
*/ |
367 |
|
public SplittableRandom(long seed) { |
368 |
< |
this(seed, 0); |
368 |
> |
this(seed, GOLDEN_GAMMA); |
369 |
|
} |
370 |
|
|
371 |
|
/** |
374 |
|
* of those of any other instances in the current program; and |
375 |
|
* may, and typically does, vary across program invocations. |
376 |
|
*/ |
377 |
< |
public SplittableRandom() { |
378 |
< |
this(nextDefaultSeed(), GAMMA_GAMMA); |
377 |
> |
public SplittableRandom() { // emulate defaultGen.split() |
378 |
> |
long s = defaultGen.getAndAdd(2 * GOLDEN_GAMMA); |
379 |
> |
this.seed = mix64(s); |
380 |
> |
this.gamma = mixGamma(s + GOLDEN_GAMMA); |
381 |
|
} |
382 |
|
|
383 |
|
/** |
395 |
|
* @return the new SplittableRandom instance |
396 |
|
*/ |
397 |
|
public SplittableRandom split() { |
398 |
< |
return new SplittableRandom(nextSeed(), nextSplit); |
398 |
> |
return new SplittableRandom(nextLong(), mixGamma(nextSeed())); |
399 |
|
} |
400 |
|
|
401 |
|
/** |
402 |
|
* Returns a pseudorandom {@code int} value. |
403 |
|
* |
404 |
< |
* @return a pseudorandom value |
404 |
> |
* @return a pseudorandom {@code int} value |
405 |
|
*/ |
406 |
|
public int nextInt() { |
407 |
|
return mix32(nextSeed()); |
408 |
|
} |
409 |
|
|
410 |
|
/** |
411 |
< |
* Returns a pseudorandom {@code int} value between 0 (inclusive) |
411 |
> |
* Returns a pseudorandom {@code int} value between zero (inclusive) |
412 |
|
* and the specified bound (exclusive). |
413 |
|
* |
414 |
< |
* @param bound the bound on the random number to be returned. Must be |
415 |
< |
* positive. |
416 |
< |
* @return a pseudorandom {@code int} value between {@code 0} |
417 |
< |
* (inclusive) and the bound (exclusive). |
447 |
< |
* @exception IllegalArgumentException if the bound is not positive |
414 |
> |
* @param bound the upper bound (exclusive). Must be positive. |
415 |
> |
* @return a pseudorandom {@code int} value between zero |
416 |
> |
* (inclusive) and the bound (exclusive) |
417 |
> |
* @throws IllegalArgumentException if {@code bound} is not positive |
418 |
|
*/ |
419 |
|
public int nextInt(int bound) { |
420 |
|
if (bound <= 0) |
421 |
< |
throw new IllegalArgumentException("bound must be positive"); |
421 |
> |
throw new IllegalArgumentException(BAD_BOUND); |
422 |
|
// Specialize internalNextInt for origin 0 |
423 |
|
int r = mix32(nextSeed()); |
424 |
|
int m = bound - 1; |
425 |
< |
if ((bound & m) == 0L) // power of two |
425 |
> |
if ((bound & m) == 0) // power of two |
426 |
|
r &= m; |
427 |
|
else { // reject over-represented candidates |
428 |
|
for (int u = r >>> 1; |
429 |
< |
u + m - (r = u % bound) < 0L; |
429 |
> |
u + m - (r = u % bound) < 0; |
430 |
|
u = mix32(nextSeed()) >>> 1) |
431 |
|
; |
432 |
|
} |
440 |
|
* @param origin the least value returned |
441 |
|
* @param bound the upper bound (exclusive) |
442 |
|
* @return a pseudorandom {@code int} value between the origin |
443 |
< |
* (inclusive) and the bound (exclusive). |
444 |
< |
* @exception IllegalArgumentException if {@code origin} is greater than |
443 |
> |
* (inclusive) and the bound (exclusive) |
444 |
> |
* @throws IllegalArgumentException if {@code origin} is greater than |
445 |
|
* or equal to {@code bound} |
446 |
|
*/ |
447 |
|
public int nextInt(int origin, int bound) { |
448 |
|
if (origin >= bound) |
449 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
449 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
450 |
|
return internalNextInt(origin, bound); |
451 |
|
} |
452 |
|
|
453 |
|
/** |
454 |
|
* Returns a pseudorandom {@code long} value. |
455 |
|
* |
456 |
< |
* @return a pseudorandom value |
456 |
> |
* @return a pseudorandom {@code long} value |
457 |
|
*/ |
458 |
|
public long nextLong() { |
459 |
|
return mix64(nextSeed()); |
460 |
|
} |
461 |
|
|
462 |
|
/** |
463 |
< |
* Returns a pseudorandom {@code long} value between 0 (inclusive) |
463 |
> |
* Returns a pseudorandom {@code long} value between zero (inclusive) |
464 |
|
* and the specified bound (exclusive). |
465 |
|
* |
466 |
< |
* @param bound the bound on the random number to be returned. Must be |
467 |
< |
* positive. |
468 |
< |
* @return a pseudorandom {@code long} value between {@code 0} |
469 |
< |
* (inclusive) and the bound (exclusive). |
500 |
< |
* @exception IllegalArgumentException if the bound is not positive |
466 |
> |
* @param bound the upper bound (exclusive). Must be positive. |
467 |
> |
* @return a pseudorandom {@code long} value between zero |
468 |
> |
* (inclusive) and the bound (exclusive) |
469 |
> |
* @throws IllegalArgumentException if {@code bound} is not positive |
470 |
|
*/ |
471 |
|
public long nextLong(long bound) { |
472 |
|
if (bound <= 0) |
473 |
< |
throw new IllegalArgumentException("bound must be positive"); |
473 |
> |
throw new IllegalArgumentException(BAD_BOUND); |
474 |
|
// Specialize internalNextLong for origin 0 |
475 |
|
long r = mix64(nextSeed()); |
476 |
|
long m = bound - 1; |
492 |
|
* @param origin the least value returned |
493 |
|
* @param bound the upper bound (exclusive) |
494 |
|
* @return a pseudorandom {@code long} value between the origin |
495 |
< |
* (inclusive) and the bound (exclusive). |
496 |
< |
* @exception IllegalArgumentException if {@code origin} is greater than |
495 |
> |
* (inclusive) and the bound (exclusive) |
496 |
> |
* @throws IllegalArgumentException if {@code origin} is greater than |
497 |
|
* or equal to {@code bound} |
498 |
|
*/ |
499 |
|
public long nextLong(long origin, long bound) { |
500 |
|
if (origin >= bound) |
501 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
501 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
502 |
|
return internalNextLong(origin, bound); |
503 |
|
} |
504 |
|
|
505 |
|
/** |
506 |
< |
* Returns a pseudorandom {@code double} value between {@code 0.0} |
507 |
< |
* (inclusive) and {@code 1.0} (exclusive). |
506 |
> |
* Returns a pseudorandom {@code double} value between zero |
507 |
> |
* (inclusive) and one (exclusive). |
508 |
|
* |
509 |
< |
* @return a pseudorandom value between {@code 0.0} |
510 |
< |
* (inclusive) and {@code 1.0} (exclusive) |
509 |
> |
* @return a pseudorandom {@code double} value between zero |
510 |
> |
* (inclusive) and one (exclusive) |
511 |
|
*/ |
512 |
|
public double nextDouble() { |
513 |
< |
long bits = (1023L << 52) | (nextLong() >>> 12); |
545 |
< |
return Double.longBitsToDouble(bits) - 1.0; |
513 |
> |
return (mix64(nextSeed()) >>> 11) * DOUBLE_UNIT; |
514 |
|
} |
515 |
|
|
516 |
|
/** |
517 |
|
* Returns a pseudorandom {@code double} value between 0.0 |
518 |
|
* (inclusive) and the specified bound (exclusive). |
519 |
|
* |
520 |
< |
* @param bound the bound on the random number to be returned. Must be |
521 |
< |
* positive. |
522 |
< |
* @return a pseudorandom {@code double} value between {@code 0.0} |
555 |
< |
* (inclusive) and the bound (exclusive). |
520 |
> |
* @param bound the upper bound (exclusive). Must be positive. |
521 |
> |
* @return a pseudorandom {@code double} value between zero |
522 |
> |
* (inclusive) and the bound (exclusive) |
523 |
|
* @throws IllegalArgumentException if {@code bound} is not positive |
524 |
|
*/ |
525 |
|
public double nextDouble(double bound) { |
526 |
< |
if (bound <= 0.0) |
527 |
< |
throw new IllegalArgumentException("bound must be positive"); |
528 |
< |
double result = nextDouble() * bound; |
526 |
> |
if (!(bound > 0.0)) |
527 |
> |
throw new IllegalArgumentException(BAD_BOUND); |
528 |
> |
double result = (mix64(nextSeed()) >>> 11) * DOUBLE_UNIT * bound; |
529 |
|
return (result < bound) ? result : // correct for rounding |
530 |
|
Double.longBitsToDouble(Double.doubleToLongBits(bound) - 1); |
531 |
|
} |
532 |
|
|
533 |
|
/** |
534 |
< |
* Returns a pseudorandom {@code double} value between the given |
534 |
> |
* Generates a pseudorandom number with the indicated number of |
535 |
> |
* low-order bits. Because this class has no subclasses, this |
536 |
> |
* method cannot be invoked or overridden. |
537 |
> |
* |
538 |
> |
* @param bits random bits |
539 |
> |
* @return the next pseudorandom value from this random number |
540 |
> |
* generator's sequence |
541 |
> |
*/ |
542 |
> |
protected int next(int bits) { |
543 |
> |
return nextInt() >>> (32 - bits); |
544 |
> |
} |
545 |
> |
|
546 |
> |
/** |
547 |
> |
* Returns a pseudorandom {@code double} value between the specified |
548 |
|
* origin (inclusive) and bound (exclusive). |
549 |
|
* |
550 |
|
* @param origin the least value returned |
551 |
< |
* @param bound the upper bound |
551 |
> |
* @param bound the upper bound (exclusive) |
552 |
|
* @return a pseudorandom {@code double} value between the origin |
553 |
< |
* (inclusive) and the bound (exclusive). |
553 |
> |
* (inclusive) and the bound (exclusive) |
554 |
|
* @throws IllegalArgumentException if {@code origin} is greater than |
555 |
|
* or equal to {@code bound} |
556 |
|
*/ |
557 |
|
public double nextDouble(double origin, double bound) { |
558 |
< |
if (origin >= bound) |
559 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
558 |
> |
if (!(origin < bound)) |
559 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
560 |
|
return internalNextDouble(origin, bound); |
561 |
|
} |
562 |
|
|
563 |
+ |
/** |
564 |
+ |
* Returns a pseudorandom {@code boolean} value. |
565 |
+ |
* |
566 |
+ |
* @return a pseudorandom {@code boolean} value |
567 |
+ |
*/ |
568 |
+ |
public boolean nextBoolean() { |
569 |
+ |
return mix32(nextSeed()) < 0; |
570 |
+ |
} |
571 |
+ |
|
572 |
|
// stream methods, coded in a way intended to better isolate for |
573 |
|
// maintenance purposes the small differences across forms. |
574 |
|
|
575 |
|
/** |
576 |
< |
* Returns a stream with the given {@code streamSize} number of |
577 |
< |
* pseudorandom {@code int} values. |
576 |
> |
* Returns a stream producing the given {@code streamSize} number |
577 |
> |
* of pseudorandom {@code int} values from this generator and/or |
578 |
> |
* one split from it. |
579 |
|
* |
580 |
|
* @param streamSize the number of values to generate |
581 |
|
* @return a stream of pseudorandom {@code int} values |
582 |
|
* @throws IllegalArgumentException if {@code streamSize} is |
583 |
< |
* less than zero |
583 |
> |
* less than zero |
584 |
|
*/ |
585 |
|
public IntStream ints(long streamSize) { |
586 |
|
if (streamSize < 0L) |
587 |
< |
throw new IllegalArgumentException("negative Stream size"); |
587 |
> |
throw new IllegalArgumentException(BAD_SIZE); |
588 |
|
return StreamSupport.intStream |
589 |
|
(new RandomIntsSpliterator |
590 |
|
(this, 0L, streamSize, Integer.MAX_VALUE, 0), |
593 |
|
|
594 |
|
/** |
595 |
|
* Returns an effectively unlimited stream of pseudorandom {@code int} |
596 |
< |
* values |
596 |
> |
* values from this generator and/or one split from it. |
597 |
|
* |
598 |
|
* @implNote This method is implemented to be equivalent to {@code |
599 |
|
* ints(Long.MAX_VALUE)}. |
608 |
|
} |
609 |
|
|
610 |
|
/** |
611 |
< |
* Returns a stream with the given {@code streamSize} number of |
612 |
< |
* pseudorandom {@code int} values, each conforming to the given |
613 |
< |
* origin and bound. |
611 |
> |
* Returns a stream producing the given {@code streamSize} number |
612 |
> |
* of pseudorandom {@code int} values from this generator and/or one split |
613 |
> |
* from it; each value conforms to the given origin (inclusive) and bound |
614 |
> |
* (exclusive). |
615 |
|
* |
616 |
|
* @param streamSize the number of values to generate |
617 |
< |
* @param randomNumberOrigin the origin of each random value |
618 |
< |
* @param randomNumberBound the bound of each random value |
617 |
> |
* @param randomNumberOrigin the origin (inclusive) of each random value |
618 |
> |
* @param randomNumberBound the bound (exclusive) of each random value |
619 |
|
* @return a stream of pseudorandom {@code int} values, |
620 |
< |
* each with the given origin and bound. |
620 |
> |
* each with the given origin (inclusive) and bound (exclusive) |
621 |
|
* @throws IllegalArgumentException if {@code streamSize} is |
622 |
< |
* less than zero. |
632 |
< |
* @throws IllegalArgumentException if {@code randomNumberOrigin} |
622 |
> |
* less than zero, or {@code randomNumberOrigin} |
623 |
|
* is greater than or equal to {@code randomNumberBound} |
624 |
|
*/ |
625 |
|
public IntStream ints(long streamSize, int randomNumberOrigin, |
626 |
|
int randomNumberBound) { |
627 |
|
if (streamSize < 0L) |
628 |
< |
throw new IllegalArgumentException("negative Stream size"); |
628 |
> |
throw new IllegalArgumentException(BAD_SIZE); |
629 |
|
if (randomNumberOrigin >= randomNumberBound) |
630 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
630 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
631 |
|
return StreamSupport.intStream |
632 |
|
(new RandomIntsSpliterator |
633 |
|
(this, 0L, streamSize, randomNumberOrigin, randomNumberBound), |
636 |
|
|
637 |
|
/** |
638 |
|
* Returns an effectively unlimited stream of pseudorandom {@code |
639 |
< |
* int} values, each conforming to the given origin and bound. |
639 |
> |
* int} values from this generator and/or one split from it; each value |
640 |
> |
* conforms to the given origin (inclusive) and bound (exclusive). |
641 |
|
* |
642 |
|
* @implNote This method is implemented to be equivalent to {@code |
643 |
|
* ints(Long.MAX_VALUE, randomNumberOrigin, randomNumberBound)}. |
644 |
|
* |
645 |
< |
* @param randomNumberOrigin the origin of each random value |
646 |
< |
* @param randomNumberBound the bound of each random value |
645 |
> |
* @param randomNumberOrigin the origin (inclusive) of each random value |
646 |
> |
* @param randomNumberBound the bound (exclusive) of each random value |
647 |
|
* @return a stream of pseudorandom {@code int} values, |
648 |
< |
* each with the given origin and bound. |
648 |
> |
* each with the given origin (inclusive) and bound (exclusive) |
649 |
|
* @throws IllegalArgumentException if {@code randomNumberOrigin} |
650 |
|
* is greater than or equal to {@code randomNumberBound} |
651 |
|
*/ |
652 |
|
public IntStream ints(int randomNumberOrigin, int randomNumberBound) { |
653 |
|
if (randomNumberOrigin >= randomNumberBound) |
654 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
654 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
655 |
|
return StreamSupport.intStream |
656 |
|
(new RandomIntsSpliterator |
657 |
|
(this, 0L, Long.MAX_VALUE, randomNumberOrigin, randomNumberBound), |
659 |
|
} |
660 |
|
|
661 |
|
/** |
662 |
< |
* Returns a stream with the given {@code streamSize} number of |
663 |
< |
* pseudorandom {@code long} values. |
662 |
> |
* Returns a stream producing the given {@code streamSize} number |
663 |
> |
* of pseudorandom {@code long} values from this generator and/or |
664 |
> |
* one split from it. |
665 |
|
* |
666 |
|
* @param streamSize the number of values to generate |
667 |
< |
* @return a stream of {@code long} values |
667 |
> |
* @return a stream of pseudorandom {@code long} values |
668 |
|
* @throws IllegalArgumentException if {@code streamSize} is |
669 |
< |
* less than zero |
669 |
> |
* less than zero |
670 |
|
*/ |
671 |
|
public LongStream longs(long streamSize) { |
672 |
|
if (streamSize < 0L) |
673 |
< |
throw new IllegalArgumentException("negative Stream size"); |
673 |
> |
throw new IllegalArgumentException(BAD_SIZE); |
674 |
|
return StreamSupport.longStream |
675 |
|
(new RandomLongsSpliterator |
676 |
|
(this, 0L, streamSize, Long.MAX_VALUE, 0L), |
678 |
|
} |
679 |
|
|
680 |
|
/** |
681 |
< |
* Returns an effectively unlimited stream of pseudorandom {@code long} |
682 |
< |
* values. |
681 |
> |
* Returns an effectively unlimited stream of pseudorandom {@code |
682 |
> |
* long} values from this generator and/or one split from it. |
683 |
|
* |
684 |
|
* @implNote This method is implemented to be equivalent to {@code |
685 |
|
* longs(Long.MAX_VALUE)}. |
694 |
|
} |
695 |
|
|
696 |
|
/** |
697 |
< |
* Returns a stream with the given {@code streamSize} number of |
698 |
< |
* pseudorandom {@code long} values, each conforming to the |
699 |
< |
* given origin and bound. |
697 |
> |
* Returns a stream producing the given {@code streamSize} number of |
698 |
> |
* pseudorandom {@code long} values from this generator and/or one split |
699 |
> |
* from it; each value conforms to the given origin (inclusive) and bound |
700 |
> |
* (exclusive). |
701 |
|
* |
702 |
|
* @param streamSize the number of values to generate |
703 |
< |
* @param randomNumberOrigin the origin of each random value |
704 |
< |
* @param randomNumberBound the bound of each random value |
703 |
> |
* @param randomNumberOrigin the origin (inclusive) of each random value |
704 |
> |
* @param randomNumberBound the bound (exclusive) of each random value |
705 |
|
* @return a stream of pseudorandom {@code long} values, |
706 |
< |
* each with the given origin and bound. |
706 |
> |
* each with the given origin (inclusive) and bound (exclusive) |
707 |
|
* @throws IllegalArgumentException if {@code streamSize} is |
708 |
< |
* less than zero. |
716 |
< |
* @throws IllegalArgumentException if {@code randomNumberOrigin} |
708 |
> |
* less than zero, or {@code randomNumberOrigin} |
709 |
|
* is greater than or equal to {@code randomNumberBound} |
710 |
|
*/ |
711 |
|
public LongStream longs(long streamSize, long randomNumberOrigin, |
712 |
|
long randomNumberBound) { |
713 |
|
if (streamSize < 0L) |
714 |
< |
throw new IllegalArgumentException("negative Stream size"); |
714 |
> |
throw new IllegalArgumentException(BAD_SIZE); |
715 |
|
if (randomNumberOrigin >= randomNumberBound) |
716 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
716 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
717 |
|
return StreamSupport.longStream |
718 |
|
(new RandomLongsSpliterator |
719 |
|
(this, 0L, streamSize, randomNumberOrigin, randomNumberBound), |
722 |
|
|
723 |
|
/** |
724 |
|
* Returns an effectively unlimited stream of pseudorandom {@code |
725 |
< |
* long} values, each conforming to the given origin and bound. |
725 |
> |
* long} values from this generator and/or one split from it; each value |
726 |
> |
* conforms to the given origin (inclusive) and bound (exclusive). |
727 |
|
* |
728 |
|
* @implNote This method is implemented to be equivalent to {@code |
729 |
|
* longs(Long.MAX_VALUE, randomNumberOrigin, randomNumberBound)}. |
730 |
|
* |
731 |
< |
* @param randomNumberOrigin the origin of each random value |
732 |
< |
* @param randomNumberBound the bound of each random value |
731 |
> |
* @param randomNumberOrigin the origin (inclusive) of each random value |
732 |
> |
* @param randomNumberBound the bound (exclusive) of each random value |
733 |
|
* @return a stream of pseudorandom {@code long} values, |
734 |
< |
* each with the given origin and bound. |
734 |
> |
* each with the given origin (inclusive) and bound (exclusive) |
735 |
|
* @throws IllegalArgumentException if {@code randomNumberOrigin} |
736 |
|
* is greater than or equal to {@code randomNumberBound} |
737 |
|
*/ |
738 |
|
public LongStream longs(long randomNumberOrigin, long randomNumberBound) { |
739 |
|
if (randomNumberOrigin >= randomNumberBound) |
740 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
740 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
741 |
|
return StreamSupport.longStream |
742 |
|
(new RandomLongsSpliterator |
743 |
|
(this, 0L, Long.MAX_VALUE, randomNumberOrigin, randomNumberBound), |
745 |
|
} |
746 |
|
|
747 |
|
/** |
748 |
< |
* Returns a stream with the given {@code streamSize} number of |
749 |
< |
* pseudorandom {@code double} values, each between {@code 0.0} |
750 |
< |
* (inclusive) and {@code 1.0} (exclusive). |
748 |
> |
* Returns a stream producing the given {@code streamSize} number of |
749 |
> |
* pseudorandom {@code double} values from this generator and/or one split |
750 |
> |
* from it; each value is between zero (inclusive) and one (exclusive). |
751 |
|
* |
752 |
|
* @param streamSize the number of values to generate |
753 |
|
* @return a stream of {@code double} values |
754 |
|
* @throws IllegalArgumentException if {@code streamSize} is |
755 |
< |
* less than zero |
755 |
> |
* less than zero |
756 |
|
*/ |
757 |
|
public DoubleStream doubles(long streamSize) { |
758 |
|
if (streamSize < 0L) |
759 |
< |
throw new IllegalArgumentException("negative Stream size"); |
759 |
> |
throw new IllegalArgumentException(BAD_SIZE); |
760 |
|
return StreamSupport.doubleStream |
761 |
|
(new RandomDoublesSpliterator |
762 |
|
(this, 0L, streamSize, Double.MAX_VALUE, 0.0), |
765 |
|
|
766 |
|
/** |
767 |
|
* Returns an effectively unlimited stream of pseudorandom {@code |
768 |
< |
* double} values, each between {@code 0.0} (inclusive) and {@code |
769 |
< |
* 1.0} (exclusive). |
768 |
> |
* double} values from this generator and/or one split from it; each value |
769 |
> |
* is between zero (inclusive) and one (exclusive). |
770 |
|
* |
771 |
|
* @implNote This method is implemented to be equivalent to {@code |
772 |
|
* doubles(Long.MAX_VALUE)}. |
781 |
|
} |
782 |
|
|
783 |
|
/** |
784 |
< |
* Returns a stream with the given {@code streamSize} number of |
785 |
< |
* pseudorandom {@code double} values, each conforming to the |
786 |
< |
* given origin and bound. |
784 |
> |
* Returns a stream producing the given {@code streamSize} number of |
785 |
> |
* pseudorandom {@code double} values from this generator and/or one split |
786 |
> |
* from it; each value conforms to the given origin (inclusive) and bound |
787 |
> |
* (exclusive). |
788 |
|
* |
789 |
|
* @param streamSize the number of values to generate |
790 |
< |
* @param randomNumberOrigin the origin of each random value |
791 |
< |
* @param randomNumberBound the bound of each random value |
790 |
> |
* @param randomNumberOrigin the origin (inclusive) of each random value |
791 |
> |
* @param randomNumberBound the bound (exclusive) of each random value |
792 |
|
* @return a stream of pseudorandom {@code double} values, |
793 |
< |
* each with the given origin and bound. |
793 |
> |
* each with the given origin (inclusive) and bound (exclusive) |
794 |
|
* @throws IllegalArgumentException if {@code streamSize} is |
795 |
< |
* less than zero. |
795 |
> |
* less than zero |
796 |
|
* @throws IllegalArgumentException if {@code randomNumberOrigin} |
797 |
|
* is greater than or equal to {@code randomNumberBound} |
798 |
|
*/ |
799 |
|
public DoubleStream doubles(long streamSize, double randomNumberOrigin, |
800 |
|
double randomNumberBound) { |
801 |
|
if (streamSize < 0L) |
802 |
< |
throw new IllegalArgumentException("negative Stream size"); |
803 |
< |
if (randomNumberOrigin >= randomNumberBound) |
804 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
802 |
> |
throw new IllegalArgumentException(BAD_SIZE); |
803 |
> |
if (!(randomNumberOrigin < randomNumberBound)) |
804 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
805 |
|
return StreamSupport.doubleStream |
806 |
|
(new RandomDoublesSpliterator |
807 |
|
(this, 0L, streamSize, randomNumberOrigin, randomNumberBound), |
810 |
|
|
811 |
|
/** |
812 |
|
* Returns an effectively unlimited stream of pseudorandom {@code |
813 |
< |
* double} values, each conforming to the given origin and bound. |
813 |
> |
* double} values from this generator and/or one split from it; each value |
814 |
> |
* conforms to the given origin (inclusive) and bound (exclusive). |
815 |
|
* |
816 |
|
* @implNote This method is implemented to be equivalent to {@code |
817 |
|
* doubles(Long.MAX_VALUE, randomNumberOrigin, randomNumberBound)}. |
818 |
|
* |
819 |
< |
* @param randomNumberOrigin the origin of each random value |
820 |
< |
* @param randomNumberBound the bound of each random value |
819 |
> |
* @param randomNumberOrigin the origin (inclusive) of each random value |
820 |
> |
* @param randomNumberBound the bound (exclusive) of each random value |
821 |
|
* @return a stream of pseudorandom {@code double} values, |
822 |
< |
* each with the given origin and bound. |
822 |
> |
* each with the given origin (inclusive) and bound (exclusive) |
823 |
|
* @throws IllegalArgumentException if {@code randomNumberOrigin} |
824 |
|
* is greater than or equal to {@code randomNumberBound} |
825 |
|
*/ |
826 |
|
public DoubleStream doubles(double randomNumberOrigin, double randomNumberBound) { |
827 |
< |
if (randomNumberOrigin >= randomNumberBound) |
828 |
< |
throw new IllegalArgumentException("bound must be greater than origin"); |
827 |
> |
if (!(randomNumberOrigin < randomNumberBound)) |
828 |
> |
throw new IllegalArgumentException(BAD_RANGE); |
829 |
|
return StreamSupport.doubleStream |
830 |
|
(new RandomDoublesSpliterator |
831 |
|
(this, 0L, Long.MAX_VALUE, randomNumberOrigin, randomNumberBound), |
834 |
|
|
835 |
|
/** |
836 |
|
* Spliterator for int streams. We multiplex the four int |
837 |
< |
* versions into one class by treating and bound < origin as |
837 |
> |
* versions into one class by treating a bound less than origin as |
838 |
|
* unbounded, and also by treating "infinite" as equivalent to |
839 |
|
* Long.MAX_VALUE. For splits, it uses the standard divide-by-two |
840 |
|
* approach. The long and double versions of this class are |
841 |
|
* identical except for types. |
842 |
|
*/ |
843 |
< |
static class RandomIntsSpliterator implements Spliterator.OfInt { |
843 |
> |
private static final class RandomIntsSpliterator |
844 |
> |
implements Spliterator.OfInt { |
845 |
|
final SplittableRandom rng; |
846 |
|
long index; |
847 |
|
final long fence; |
865 |
|
|
866 |
|
public int characteristics() { |
867 |
|
return (Spliterator.SIZED | Spliterator.SUBSIZED | |
868 |
< |
Spliterator.ORDERED | Spliterator.NONNULL | |
873 |
< |
Spliterator.IMMUTABLE); |
868 |
> |
Spliterator.NONNULL | Spliterator.IMMUTABLE); |
869 |
|
} |
870 |
|
|
871 |
|
public boolean tryAdvance(IntConsumer consumer) { |
884 |
|
long i = index, f = fence; |
885 |
|
if (i < f) { |
886 |
|
index = f; |
887 |
+ |
SplittableRandom r = rng; |
888 |
|
int o = origin, b = bound; |
889 |
|
do { |
890 |
< |
consumer.accept(rng.internalNextInt(o, b)); |
890 |
> |
consumer.accept(r.internalNextInt(o, b)); |
891 |
|
} while (++i < f); |
892 |
|
} |
893 |
|
} |
896 |
|
/** |
897 |
|
* Spliterator for long streams. |
898 |
|
*/ |
899 |
< |
static class RandomLongsSpliterator implements Spliterator.OfLong { |
899 |
> |
private static final class RandomLongsSpliterator |
900 |
> |
implements Spliterator.OfLong { |
901 |
|
final SplittableRandom rng; |
902 |
|
long index; |
903 |
|
final long fence; |
921 |
|
|
922 |
|
public int characteristics() { |
923 |
|
return (Spliterator.SIZED | Spliterator.SUBSIZED | |
924 |
< |
Spliterator.ORDERED | Spliterator.NONNULL | |
928 |
< |
Spliterator.IMMUTABLE); |
924 |
> |
Spliterator.NONNULL | Spliterator.IMMUTABLE); |
925 |
|
} |
926 |
|
|
927 |
|
public boolean tryAdvance(LongConsumer consumer) { |
940 |
|
long i = index, f = fence; |
941 |
|
if (i < f) { |
942 |
|
index = f; |
943 |
+ |
SplittableRandom r = rng; |
944 |
|
long o = origin, b = bound; |
945 |
|
do { |
946 |
< |
consumer.accept(rng.internalNextLong(o, b)); |
946 |
> |
consumer.accept(r.internalNextLong(o, b)); |
947 |
|
} while (++i < f); |
948 |
|
} |
949 |
|
} |
953 |
|
/** |
954 |
|
* Spliterator for double streams. |
955 |
|
*/ |
956 |
< |
static class RandomDoublesSpliterator implements Spliterator.OfDouble { |
956 |
> |
private static final class RandomDoublesSpliterator |
957 |
> |
implements Spliterator.OfDouble { |
958 |
|
final SplittableRandom rng; |
959 |
|
long index; |
960 |
|
final long fence; |
978 |
|
|
979 |
|
public int characteristics() { |
980 |
|
return (Spliterator.SIZED | Spliterator.SUBSIZED | |
981 |
< |
Spliterator.ORDERED | Spliterator.NONNULL | |
984 |
< |
Spliterator.IMMUTABLE); |
981 |
> |
Spliterator.NONNULL | Spliterator.IMMUTABLE); |
982 |
|
} |
983 |
|
|
984 |
|
public boolean tryAdvance(DoubleConsumer consumer) { |
997 |
|
long i = index, f = fence; |
998 |
|
if (i < f) { |
999 |
|
index = f; |
1000 |
+ |
SplittableRandom r = rng; |
1001 |
|
double o = origin, b = bound; |
1002 |
|
do { |
1003 |
< |
consumer.accept(rng.internalNextDouble(o, b)); |
1003 |
> |
consumer.accept(r.internalNextDouble(o, b)); |
1004 |
|
} while (++i < f); |
1005 |
|
} |
1006 |
|
} |
1007 |
|
} |
1008 |
|
|
1009 |
|
} |
1012 |
– |
|