ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/main/java/util/SplittableRandom.java

Comparing jsr166/src/main/java/util/SplittableRandom.java (file contents):
Revision 1.11 by dl, Tue Jul 16 12:32:05 2013 UTC vs.
Revision 1.15 by dl, Fri Aug 9 12:12:10 2013 UTC

#	Line 25 | Line 25
25
26		package java.util;
27
28	+	import java.net.InetAddress;
29		import java.util.concurrent.atomic.AtomicLong;
30		import java.util.Spliterator;
31		import java.util.function.IntConsumer;
#	Line 83 | Line 84 | import java.util.stream.DoubleStream;
84		public class SplittableRandom {
85
86		/*
86	–	* File organization: First the non-public methods that constitute
87	–	* the main algorithm, then the main public methods, followed by
88	–	* some custom spliterator classes needed for stream methods.
89	–	*
90	–	* Credits: Primary algorithm and code by Guy Steele.  Stream
91	–	* support methods by Doug Lea.  Documentation jointly produced
92	–	* with additional help from Brian Goetz.
93	–	*/
94	–
95	–	/*
87		* Implementation Overview.
88		*
89		* This algorithm was inspired by the "DotMix" algorithm by
90		* Leiserson, Schardl, and Sukha "Deterministic Parallel
91		* Random-Number Generation for Dynamic-Multithreading Platforms",
92	<	* PPoPP 2012, but improves and extends it in several ways.
93	<	*
94	<	* The primary update step (see method nextSeed()) is simply to
95	<	* add a constant ("gamma") to the current seed, modulo a prime
96	<	* ("George"). However, the nextLong and nextInt methods do not
97	<	* return this value, but instead the results of bit-mixing
98	<	* transformations that produce more uniformly distributed
99	<	* sequences.
100	<	*
101	<	* "George" is the otherwise nameless (because it cannot be
102	<	* represented) prime number 2^64+13. Using a prime number larger
103	<	* than can fit in a long ensures that all possible long values
104	<	* can occur, plus 13 others that just get skipped over when they
105	<	* are encountered; see method addGammaModGeorge. For this to
106	<	* work, initial gamma values must be at least 13.
116	<	*
117	<	* The value of gamma differs for each instance across a series of
118	<	* splits, and is generated using a slightly stripped-down variant
119	<	* of the same algorithm, but operating across calls to split(),
120	<	* not calls to nextSeed(): Each instance carries the state of
121	<	* this generator as nextSplit, and uses mix64(nextSplit) as its
122	<	* own gamma value. Computations of gammas themselves use a fixed
123	<	* constant as the second argument to the addGammaModGeorge
124	<	* function, GAMMA_GAMMA, a "genuinely random" number from a
125	<	* radioactive decay reading (obtained from
126	<	* http://www.fourmilab.ch/hotbits/) meeting the above range
127	<	* constraint. Using a fixed constant maintains the invariant that
128	<	* the value of gamma is the same for every instance that is at
129	<	* the same split-distance from their common root. (Note: there is
130	<	* nothing especially magic about obtaining this constant from a
131	<	* "truly random" physical source rather than just choosing one
132	<	* arbitrarily; using "hotbits" was merely an aesthetically pleasing
133	<	* choice.  In either case, good statistical behavior of the
134	<	* algorithm should be, and was, verified by using the DieHarder
135	<	* test suite.)
136	<	*
137	<	* The mix64 bit-mixing function called by nextLong and other
138	<	* methods computes the same value as the "64-bit finalizer"
139	<	* function in Austin Appleby's MurmurHash3 algorithm.  See
92	>	* PPoPP 2012, as well as those in "Parallel random numbers: as
93	>	* easy as 1, 2, 3" by Salmon, Morae, Dror, and Shaw, SC 2011.  It
94	>	* differs mainly in simplifying and cheapening operations.
95	>	*
96	>	* The primary update step (method nextSeed()) is to add a
97	>	* constant ("gamma") to the current (64 bit) seed, forming a
98	>	* simple sequence.  The seed and the gamma values for any two
99	>	* SplittableRandom instances are highly likely to be different.
100	>	*
101	>	* Methods nextLong, nextInt, and derivatives do not return the
102	>	* sequence (seed) values, but instead a hash-like bit-mix of
103	>	* their bits, producing more independently distributed sequences.
104	>	* For nextLong, the mix64 bit-mixing function computes the same
105	>	* value as the "64-bit finalizer" function in Austin Appleby's
106	>	* MurmurHash3 algorithm.  See
107		* http://code.google.com/p/smhasher/wiki/MurmurHash3 , which
108		* comments: "The constants for the finalizers were generated by a
109		* simple simulated-annealing algorithm, and both avalanche all
110	<	* bits of 'h' to within 0.25% bias." It also appears to work to
111	<	* use instead any of the variants proposed by David Stafford at
112	<	* http://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html
113	<	* but these variants have not yet been tested as thoroughly
114	<	* in the context of the implementation of SplittableRandom.
115	<	*
116	<	* The mix32 function used for nextInt just consists of two of the
117	<	* five lines of mix64; avalanche testing shows that the 64-bit result
118	<	* has its top 32 bits avalanched well, though not the bottom 32 bits.
119	<	* DieHarder tests show that it is adequate for generating one
120	<	* random int from the 64-bit result of nextSeed.
121	<	*
122	<	* Support for the default (no-argument) constructor relies on an
123	<	* AtomicLong (defaultSeedGenerator) to help perform the
124	<	* equivalent of a split of a statically constructed
125	<	* SplittableRandom. Unlike other cases, this split must be
126	<	* performed in a thread-safe manner. We use
127	<	* AtomicLong.compareAndSet as the (typically) most efficient
128	<	* mechanism. To bootstrap, we start off using a function of the
129	<	* current System time as seed, and update using another
130	<	* "genuinely random" constant DEFAULT_SEED_GAMMA. The default
131	<	* constructor uses GAMMA_GAMMA, not 0, for its splitSeed argument
132	<	* (addGammaModGeorge(0, GAMMA_GAMMA) == GAMMA_GAMMA) to reflect
133	<	* that each is split from this root generator, even though the
134	<	* root is not explicitly represented as a SplittableRandom.  When
135	<	* establishing the initial seed, we use both
136	<	* System.currentTimeMillis and System.nanoTime(), to avoid
137	<	* regularities that may occur if using either alone.
138	<	*/
139	<
140	<	/**
141	<	* The "genuinely random" value for producing new gamma values.
142	<	* The value is arbitrary, subject to the requirement that it be
143	<	* greater or equal to 13.
144	<	*/
145	<	private static final long GAMMA_GAMMA = 0xF2281E2DBA6606F3L;
146	<
147	<	/**
148	<	* The "genuinely random" seed update value for default constructors.
149	<	* The value is arbitrary, subject to the requirement that it be
150	<	* greater or equal to 13.
110	>	* bits of 'h' to within 0.25% bias." The mix32 function is
111	>	* equivalent to (int)(mix64(seed) >>> 32), but faster because it
112	>	* omits a step that doesn't contribute to result.
113	>	*
114	>	* The split operation uses the current generator to form the seed
115	>	* and gamma for another SplittableRandom.  To conservatively
116	>	* avoid potential correlations between seed and value generation,
117	>	* gamma selection (method nextGamma) uses the "Mix13" constants
118	>	* for MurmurHash3 described by David Stafford
119	>	* (http://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html)
120	>	* To avoid potential weaknesses in bit-mixing transformations, we
121	>	* restrict gammas to odd values with at least 12 and no more than
122	>	* 52 bits set.  Rather than rejecting candidates with too few or
123	>	* too many bits set, method nextGamma flips some bits (which has
124	>	* the effect of mapping at most 4 to any given gamma value).
125	>	* This reduces the effective set of 64bit odd gamma values by
126	>	* about 2<sup>14</sup>, a very tiny percentage, and serves as an
127	>	* automated screening for sequence constant selection that is
128	>	* left as an empirical decision in some other hashing and crypto
129	>	* algorithms.
130	>	*
131	>	* The resulting generator thus transforms a sequence in which
132	>	* (typically) many bits change on each step, with an inexpensive
133	>	* mixer with good (but less than cryptographically secure)
134	>	* avalanching.
135	>	*
136	>	* The default (no-argument) constructor, in essence, invokes
137	>	* split() for a common "seeder" SplittableRandom.  Unlike other
138	>	* cases, this split must be performed in a thread-safe manner, so
139	>	* we use an AtomicLong to represent the seed rather than use an
140	>	* explicit SplittableRandom. To bootstrap the seeder, we start
141	>	* off using a seed based on current time and host. This serves as
142	>	* a slimmed-down (and insecure) variant of SecureRandom that also
143	>	* avoids stalls that may occur when using /dev/random.
144	>	*
145	>	* It is a relatively simple matter to apply the basic design here
146	>	* to use 128 bit seeds. However, emulating 128bit arithmetic and
147	>	* carrying around twice the state add more overhead than appears
148	>	* warranted for current usages.
149	>	*
150	>	* File organization: First the non-public methods that constitute
151	>	* the main algorithm, then the main public methods, followed by
152	>	* some custom spliterator classes needed for stream methods.
153		*/
185	–	private static final long DEFAULT_SEED_GAMMA = 0xBD24B73A95FB84D9L;
154
155		/**
156	<	* The value 13 with 64bit sign bit set. Used in the signed
157	<	* comparison in addGammaModGeorge.
156	>	* The initial gamma value for (unsplit) SplittableRandoms. Must
157	>	* be odd with at least 12 and no more than 52 bits set. Currently
158	>	* set to the golden ratio scaled to 64bits.
159		*/
160	<	private static final long BOTTOM13 = 0x800000000000000DL;
160	>	private static final long INITIAL_GAMMA = 0x9e3779b97f4a7c15L;
161
162		/**
163		* The least non-zero value returned by nextDouble(). This value
#	Line 197 | Line 166 | public class SplittableRandom {
166		private static final double DOUBLE_UNIT = 1.0 / (1L << 53);
167
168		/**
169	<	* The next seed for default constructors.
201	<	*/
202	<	private static final AtomicLong defaultSeedGenerator =
203	<	new AtomicLong(mix64(System.currentTimeMillis()) ^
204	<	mix64(System.nanoTime()));
205	<
206	<	/**
207	<	* The seed, updated only via method nextSeed.
169	>	* The seed. Updated only via method nextSeed.
170		*/
171		private long seed;
172
173		/**
174	<	* The constant value added to seed (mod George) on each update.
174	>	* The step value.
175		*/
176		private final long gamma;
177
178		/**
179	<	* The next seed to use for splits. Propagated using
218	<	* addGammaModGeorge across instances.
219	<	*/
220	<	private final long nextSplit;
221	<
222	<	/**
223	<	* Adds the given gamma value, g, to the given seed value s, mod
224	<	* George (2^64+13). We regard s and g as unsigned values
225	<	* (ranging from 0 to 2^64-1). We add g to s either once or twice
226	<	* (mod George) as necessary to produce an (unsigned) result less
227	<	* than 2^64.  We require that g must be at least 13. This
228	<	* guarantees that if (s+g) mod George >= 2^64 then (s+g+g) mod
229	<	* George < 2^64; thus we need only a conditional, not a loop,
230	<	* to be sure of getting a representable value.
231	<	*
232	<	* Because Java comparison operators are signed, we implement this
233	<	* by conceptually offsetting seed values downwards by 2^63, so
234	<	* 0..13 is represented as Long.MIN_VALUE..BOTTOM13.
235	<	*
236	<	* @param s a seed value, viewed as a signed long
237	<	* @param g a gamma value, 13 <= g (as unsigned)
179	>	* Internal constructor used by all others except default constructor.
180		*/
181	<	private static long addGammaModGeorge(long s, long g) {
182	<	long p = s + g;
183	<	return (p >= s) ? p : ((p >= BOTTOM13) ? p  : p + g) - 13L;
181	>	private SplittableRandom(long seed, long gamma) {
182	>	this.seed = seed;
183	>	this.gamma = gamma;
184		}
185
186		/**
187	<	* Returns a bit-mixed transformation of its argument.
246	<	* See above for explanation.
187	>	* Computes MurmurHash3 64bit mix function.
188		*/
189		private static long mix64(long z) {
190	<	z ^= (z >>> 33);
191	<	z *= 0xff51afd7ed558ccdL;
192	<	z ^= (z >>> 33);
252	<	z *= 0xc4ceb9fe1a85ec53L;
253	<	z ^= (z >>> 33);
254	<	return z;
190	>	z = (z ^ (z >>> 33)) * 0xff51afd7ed558ccdL;
191	>	z = (z ^ (z >>> 33)) * 0xc4ceb9fe1a85ec53L;
192	>	return z ^ (z >>> 33);
193		}
194
195		/**
196	<	* Returns a bit-mixed int transformation of its argument.
259	<	* See above for explanation.
196	>	* Returns the 32 high bits of mix64(z) as int.
197		*/
198		private static int mix32(long z) {
199	<	z ^= (z >>> 33);
200	<	z *= 0xc4ceb9fe1a85ec53L;
264	<	return (int)(z >>> 32);
199	>	z = (z ^ (z >>> 33)) * 0xff51afd7ed558ccdL;
200	>	return (int)(((z ^ (z >>> 33)) * 0xc4ceb9fe1a85ec53L) >>> 32);
201		}
202
203		/**
204	<	* Internal constructor used by all other constructors and by
269	<	* method split. Establishes the initial seed for this instance,
270	<	* and uses the given splitSeed to establish gamma, as well as the
271	<	* nextSplit to use by this instance. The loop to skip ineligible
272	<	* gammas very rarely iterates, and does so at most 13 times.
204	>	* Returns the gamma value to use for a new split instance.
205		*/
206	<	private SplittableRandom(long seed, long splitSeed) {
207	<	this.seed = seed;
208	<	long s = splitSeed, g;
209	<	do { // ensure gamma >= 13, considered as an unsigned integer
210	<	s = addGammaModGeorge(s, GAMMA_GAMMA);
211	<	g = mix64(s);
280	<	} while (g >= 0L && g < 13L);
281	<	this.gamma = g;
282	<	this.nextSplit = s;
206	>	private static long nextGamma(long z) {
207	>	z = (z ^ (z >>> 30)) * 0xbf58476d1ce4e5b9L; // Stafford "Mix13"
208	>	z = (z ^ (z >>> 27)) * 0x94d049bb133111ebL;
209	>	z = (z ^ (z >>> 31)) | 1L; // force to be odd
210	>	int n = Long.bitCount(z);  // ensure enough 0 and 1 bits
211	>	return (n < 12 || n > 52) ? z ^ 0xaaaaaaaaaaaaaaaaL : z;
212		}
213
214		/**
215	<	* Updates in-place and returns seed.
287	<	* See above for explanation.
215	>	* Adds gamma to seed.
216		*/
217		private long nextSeed() {
218	<	return seed = addGammaModGeorge(seed, gamma);
218	>	return seed += gamma;
219		}
220
221		/**
222	<	* Atomically updates and returns next seed for default constructor.
222	>	* The seed generator for default constructors.
223	>	*/
224	>	private static final AtomicLong seeder =
225	>	new AtomicLong(mix64((((long)hashedHostAddress()) << 32) ^
226	>	System.currentTimeMillis()) ^
227	>	mix64(System.nanoTime()));
228	>
229	>	/**
230	>	* Returns hash of local host IP address, if available; else 0.
231		*/
232	<	private static long nextDefaultSeed() {
233	<	long oldSeed, newSeed;
234	<	do {
235	<	oldSeed = defaultSeedGenerator.get();
236	<	newSeed = addGammaModGeorge(oldSeed, DEFAULT_SEED_GAMMA);
237	<	} while (!defaultSeedGenerator.compareAndSet(oldSeed, newSeed));
302	<	return mix64(newSeed);
232	>	private static int hashedHostAddress() {
233	>	try {
234	>	return InetAddress.getLocalHost().hashCode();
235	>	} catch (Exception ex) {
236	>	return 0;
237	>	}
238		}
239
240	+	// IllegalArgumentException messages
241	+	static final String BadBound = "bound must be positive";
242	+	static final String BadRange = "bound must be greater than origin";
243	+	static final String BadSize  = "size must be non-negative";
244	+
245		/*
246		* Internal versions of nextX methods used by streams, as well as
247		* the public nextX(origin, bound) methods.  These exist mainly to
#	Line 377 | Line 317 | public class SplittableRandom {
317		int r = mix32(nextSeed());
318		if (origin < bound) {
319		int n = bound - origin, m = n - 1;
320	<	if ((n & m) == 0L)
320	>	if ((n & m) == 0)
321		r = (r & m) + origin;
322		else if (n > 0) {
323		for (int u = r >>> 1;
#	Line 421 | Line 361 | public class SplittableRandom {
361		* @param seed the initial seed
362		*/
363		public SplittableRandom(long seed) {
364	<	this(seed, 0);
364	>	this(seed, INITIAL_GAMMA);
365		}
366
367		/**
#	Line 430 | Line 370 | public class SplittableRandom {
370		* of those of any other instances in the current program; and
371		* may, and typically does, vary across program invocations.
372		*/
373	<	public SplittableRandom() {
374	<	this(nextDefaultSeed(), GAMMA_GAMMA);
373	>	public SplittableRandom() { // emulate seeder.split()
374	>	this.gamma = nextGamma(this.seed = seeder.addAndGet(INITIAL_GAMMA));
375		}
376
377		/**
#	Line 449 | Line 389 | public class SplittableRandom {
389		* @return the new SplittableRandom instance
390		*/
391		public SplittableRandom split() {
392	<	return new SplittableRandom(nextSeed(), nextSplit);
392	>	long s = nextSeed();
393	>	return new SplittableRandom(s, nextGamma(s));
394		}
395
396		/**
#	Line 473 | Line 414 | public class SplittableRandom {
414		*/
415		public int nextInt(int bound) {
416		if (bound <= 0)
417	<	throw new IllegalArgumentException("bound must be positive");
417	>	throw new IllegalArgumentException(BadBound);
418		// Specialize internalNextInt for origin 0
419		int r = mix32(nextSeed());
420		int m = bound - 1;
421	<	if ((bound & m) == 0L) // power of two
421	>	if ((bound & m) == 0) // power of two
422		r &= m;
423		else { // reject over-represented candidates
424		for (int u = r >>> 1;
#	Line 501 | Line 442 | public class SplittableRandom {
442		*/
443		public int nextInt(int origin, int bound) {
444		if (origin >= bound)
445	<	throw new IllegalArgumentException("bound must be greater than origin");
445	>	throw new IllegalArgumentException(BadRange);
446		return internalNextInt(origin, bound);
447		}
448
#	Line 526 | Line 467 | public class SplittableRandom {
467		*/
468		public long nextLong(long bound) {
469		if (bound <= 0)
470	<	throw new IllegalArgumentException("bound must be positive");
470	>	throw new IllegalArgumentException(BadBound);
471		// Specialize internalNextLong for origin 0
472		long r = mix64(nextSeed());
473		long m = bound - 1;
#	Line 554 | Line 495 | public class SplittableRandom {
495		*/
496		public long nextLong(long origin, long bound) {
497		if (origin >= bound)
498	<	throw new IllegalArgumentException("bound must be greater than origin");
498	>	throw new IllegalArgumentException(BadRange);
499		return internalNextLong(origin, bound);
500		}
501
#	Line 581 | Line 522 | public class SplittableRandom {
522		*/
523		public double nextDouble(double bound) {
524		if (!(bound > 0.0))
525	<	throw new IllegalArgumentException("bound must be positive");
525	>	throw new IllegalArgumentException(BadBound);
526		double result = (mix64(nextSeed()) >>> 11) * DOUBLE_UNIT * bound;
527		return (result < bound) ?  result : // correct for rounding
528		Double.longBitsToDouble(Double.doubleToLongBits(bound) - 1);
#	Line 600 | Line 541 | public class SplittableRandom {
541		*/
542		public double nextDouble(double origin, double bound) {
543		if (!(origin < bound))
544	<	throw new IllegalArgumentException("bound must be greater than origin");
544	>	throw new IllegalArgumentException(BadRange);
545		return internalNextDouble(origin, bound);
546		}
547
#	Line 627 | Line 568 | public class SplittableRandom {
568		*/
569		public IntStream ints(long streamSize) {
570		if (streamSize < 0L)
571	<	throw new IllegalArgumentException("negative Stream size");
571	>	throw new IllegalArgumentException(BadSize);
572		return StreamSupport.intStream
573		(new RandomIntsSpliterator
574		(this, 0L, streamSize, Integer.MAX_VALUE, 0),
#	Line 667 | Line 608 | public class SplittableRandom {
608		public IntStream ints(long streamSize, int randomNumberOrigin,
609		int randomNumberBound) {
610		if (streamSize < 0L)
611	<	throw new IllegalArgumentException("negative Stream size");
611	>	throw new IllegalArgumentException(BadSize);
612		if (randomNumberOrigin >= randomNumberBound)
613	<	throw new IllegalArgumentException("bound must be greater than origin");
613	>	throw new IllegalArgumentException(BadRange);
614		return StreamSupport.intStream
615		(new RandomIntsSpliterator
616		(this, 0L, streamSize, randomNumberOrigin, randomNumberBound),
#	Line 692 | Line 633 | public class SplittableRandom {
633		*/
634		public IntStream ints(int randomNumberOrigin, int randomNumberBound) {
635		if (randomNumberOrigin >= randomNumberBound)
636	<	throw new IllegalArgumentException("bound must be greater than origin");
636	>	throw new IllegalArgumentException(BadRange);
637		return StreamSupport.intStream
638		(new RandomIntsSpliterator
639		(this, 0L, Long.MAX_VALUE, randomNumberOrigin, randomNumberBound),
#	Line 710 | Line 651 | public class SplittableRandom {
651		*/
652		public LongStream longs(long streamSize) {
653		if (streamSize < 0L)
654	<	throw new IllegalArgumentException("negative Stream size");
654	>	throw new IllegalArgumentException(BadSize);
655		return StreamSupport.longStream
656		(new RandomLongsSpliterator
657		(this, 0L, streamSize, Long.MAX_VALUE, 0L),
#	Line 750 | Line 691 | public class SplittableRandom {
691		public LongStream longs(long streamSize, long randomNumberOrigin,
692		long randomNumberBound) {
693		if (streamSize < 0L)
694	<	throw new IllegalArgumentException("negative Stream size");
694	>	throw new IllegalArgumentException(BadSize);
695		if (randomNumberOrigin >= randomNumberBound)
696	<	throw new IllegalArgumentException("bound must be greater than origin");
696	>	throw new IllegalArgumentException(BadRange);
697		return StreamSupport.longStream
698		(new RandomLongsSpliterator
699		(this, 0L, streamSize, randomNumberOrigin, randomNumberBound),
#	Line 775 | Line 716 | public class SplittableRandom {
716		*/
717		public LongStream longs(long randomNumberOrigin, long randomNumberBound) {
718		if (randomNumberOrigin >= randomNumberBound)
719	<	throw new IllegalArgumentException("bound must be greater than origin");
719	>	throw new IllegalArgumentException(BadRange);
720		return StreamSupport.longStream
721		(new RandomLongsSpliterator
722		(this, 0L, Long.MAX_VALUE, randomNumberOrigin, randomNumberBound),
#	Line 794 | Line 735 | public class SplittableRandom {
735		*/
736		public DoubleStream doubles(long streamSize) {
737		if (streamSize < 0L)
738	<	throw new IllegalArgumentException("negative Stream size");
738	>	throw new IllegalArgumentException(BadSize);
739		return StreamSupport.doubleStream
740		(new RandomDoublesSpliterator
741		(this, 0L, streamSize, Double.MAX_VALUE, 0.0),
#	Line 836 | Line 777 | public class SplittableRandom {
777		public DoubleStream doubles(long streamSize, double randomNumberOrigin,
778		double randomNumberBound) {
779		if (streamSize < 0L)
780	<	throw new IllegalArgumentException("negative Stream size");
780	>	throw new IllegalArgumentException(BadSize);
781		if (!(randomNumberOrigin < randomNumberBound))
782	<	throw new IllegalArgumentException("bound must be greater than origin");
782	>	throw new IllegalArgumentException(BadRange);
783		return StreamSupport.doubleStream
784		(new RandomDoublesSpliterator
785		(this, 0L, streamSize, randomNumberOrigin, randomNumberBound),
#	Line 861 | Line 802 | public class SplittableRandom {
802		*/
803		public DoubleStream doubles(double randomNumberOrigin, double randomNumberBound) {
804		if (!(randomNumberOrigin < randomNumberBound))
805	<	throw new IllegalArgumentException("bound must be greater than origin");
805	>	throw new IllegalArgumentException(BadRange);
806		return StreamSupport.doubleStream
807		(new RandomDoublesSpliterator
808		(this, 0L, Long.MAX_VALUE, randomNumberOrigin, randomNumberBound),
#	Line 919 | Line 860 | public class SplittableRandom {
860		long i = index, f = fence;
861		if (i < f) {
862		index = f;
863	+	SplittableRandom r = rng;
864		int o = origin, b = bound;
865		do {
866	<	consumer.accept(rng.internalNextInt(o, b));
866	>	consumer.accept(r.internalNextInt(o, b));
867		} while (++i < f);
868		}
869		}
#	Line 973 | Line 915 | public class SplittableRandom {
915		long i = index, f = fence;
916		if (i < f) {
917		index = f;
918	+	SplittableRandom r = rng;
919		long o = origin, b = bound;
920		do {
921	<	consumer.accept(rng.internalNextLong(o, b));
921	>	consumer.accept(r.internalNextLong(o, b));
922		} while (++i < f);
923		}
924		}
#	Line 1028 | Line 971 | public class SplittableRandom {
971		long i = index, f = fence;
972		if (i < f) {
973		index = f;
974	+	SplittableRandom r = rng;
975		double o = origin, b = bound;
976		do {
977	<	consumer.accept(rng.internalNextDouble(o, b));
977	>	consumer.accept(r.internalNextDouble(o, b));
978		} while (++i < f);
979		}
980		}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines