45 |
|
static final long MAX_LONG_BOUND = (1L << 42); |
46 |
|
|
47 |
|
// Number of replications for other checks |
48 |
< |
static final int REPS = 20; |
48 |
> |
static final int REPS = |
49 |
> |
Integer.getInteger("SplittableRandomTest.reps", 4); |
50 |
|
|
51 |
|
/** |
52 |
|
* Repeated calls to nextInt produce at least two distinct results |
128 |
|
} |
129 |
|
|
130 |
|
/** |
131 |
< |
* nextInt(negative) throws IllegalArgumentException |
131 |
> |
* nextInt(non-positive) throws IllegalArgumentException |
132 |
|
*/ |
133 |
< |
public void testNextIntBoundedNeg() { |
133 |
> |
public void testNextIntNonPositive() { |
134 |
|
SplittableRandom sr = new SplittableRandom(); |
135 |
< |
try { |
136 |
< |
int f = sr.nextInt(-17); |
137 |
< |
shouldThrow(); |
138 |
< |
} catch (IllegalArgumentException success) {} |
135 |
> |
Runnable[] throwingActions = { |
136 |
> |
() -> sr.nextInt(-17), |
137 |
> |
() -> sr.nextInt(0), |
138 |
> |
() -> sr.nextInt(Integer.MIN_VALUE), |
139 |
> |
}; |
140 |
> |
assertThrows(IllegalArgumentException.class, throwingActions); |
141 |
|
} |
142 |
|
|
143 |
|
/** |
195 |
|
} |
196 |
|
|
197 |
|
/** |
198 |
< |
* nextLong(negative) throws IllegalArgumentException |
198 |
> |
* nextLong(non-positive) throws IllegalArgumentException |
199 |
|
*/ |
200 |
< |
public void testNextLongBoundedNeg() { |
200 |
> |
public void testNextLongNonPositive() { |
201 |
|
SplittableRandom sr = new SplittableRandom(); |
202 |
< |
try { |
203 |
< |
long f = sr.nextLong(-17); |
204 |
< |
shouldThrow(); |
205 |
< |
} catch (IllegalArgumentException success) {} |
202 |
> |
Runnable[] throwingActions = { |
203 |
> |
() -> sr.nextLong(-17L), |
204 |
> |
() -> sr.nextLong(0L), |
205 |
> |
() -> sr.nextLong(Long.MIN_VALUE), |
206 |
> |
}; |
207 |
> |
assertThrows(IllegalArgumentException.class, throwingActions); |
208 |
|
} |
209 |
|
|
210 |
|
/** |
261 |
|
} |
262 |
|
|
263 |
|
/** |
264 |
+ |
* nextDouble(non-positive) throws IllegalArgumentException |
265 |
+ |
*/ |
266 |
+ |
public void testNextDoubleNonPositive() { |
267 |
+ |
SplittableRandom sr = new SplittableRandom(); |
268 |
+ |
Runnable[] throwingActions = { |
269 |
+ |
() -> sr.nextDouble(-17.0d), |
270 |
+ |
() -> sr.nextDouble(0.0d), |
271 |
+ |
() -> sr.nextDouble(-Double.MIN_VALUE), |
272 |
+ |
() -> sr.nextDouble(Double.NEGATIVE_INFINITY), |
273 |
+ |
() -> sr.nextDouble(Double.NaN), |
274 |
+ |
}; |
275 |
+ |
assertThrows(IllegalArgumentException.class, throwingActions); |
276 |
+ |
} |
277 |
+ |
|
278 |
+ |
/** |
279 |
|
* nextDouble(least, bound) returns least <= value < bound; |
280 |
|
* repeated calls produce at least two distinct results |
281 |
|
*/ |
303 |
|
*/ |
304 |
|
public void testBadStreamSize() { |
305 |
|
SplittableRandom r = new SplittableRandom(); |
306 |
< |
try { |
307 |
< |
java.util.stream.IntStream x = r.ints(-1L); |
308 |
< |
shouldThrow(); |
309 |
< |
} catch (IllegalArgumentException success) {} |
310 |
< |
try { |
311 |
< |
java.util.stream.LongStream x = r.longs(-1L); |
312 |
< |
shouldThrow(); |
313 |
< |
} catch (IllegalArgumentException success) {} |
314 |
< |
try { |
295 |
< |
java.util.stream.DoubleStream x = r.doubles(-1L); |
296 |
< |
shouldThrow(); |
297 |
< |
} catch (IllegalArgumentException success) {} |
306 |
> |
Runnable[] throwingActions = { |
307 |
> |
() -> { java.util.stream.IntStream x = r.ints(-1L); }, |
308 |
> |
() -> { java.util.stream.IntStream x = r.ints(-1L, 2, 3); }, |
309 |
> |
() -> { java.util.stream.LongStream x = r.longs(-1L); }, |
310 |
> |
() -> { java.util.stream.LongStream x = r.longs(-1L, -1L, 1L); }, |
311 |
> |
() -> { java.util.stream.DoubleStream x = r.doubles(-1L); }, |
312 |
> |
() -> { java.util.stream.DoubleStream x = r.doubles(-1L, .5, .6); }, |
313 |
> |
}; |
314 |
> |
assertThrows(IllegalArgumentException.class, throwingActions); |
315 |
|
} |
316 |
|
|
317 |
|
/** |
320 |
|
*/ |
321 |
|
public void testBadStreamBounds() { |
322 |
|
SplittableRandom r = new SplittableRandom(); |
323 |
< |
try { |
324 |
< |
java.util.stream.IntStream x = r.ints(2, 1); |
325 |
< |
shouldThrow(); |
326 |
< |
} catch (IllegalArgumentException success) {} |
327 |
< |
try { |
328 |
< |
java.util.stream.LongStream x = r.longs(1, -2); |
329 |
< |
shouldThrow(); |
330 |
< |
} catch (IllegalArgumentException success) {} |
331 |
< |
try { |
315 |
< |
java.util.stream.DoubleStream x = r.doubles(0, 0); |
316 |
< |
shouldThrow(); |
317 |
< |
} catch (IllegalArgumentException success) {} |
323 |
> |
Runnable[] throwingActions = { |
324 |
> |
() -> { java.util.stream.IntStream x = r.ints(2, 1); }, |
325 |
> |
() -> { java.util.stream.IntStream x = r.ints(10, 42, 42); }, |
326 |
> |
() -> { java.util.stream.LongStream x = r.longs(-1L, -1L); }, |
327 |
> |
() -> { java.util.stream.LongStream x = r.longs(10, 1L, -2L); }, |
328 |
> |
() -> { java.util.stream.DoubleStream x = r.doubles(0.0, 0.0); }, |
329 |
> |
() -> { java.util.stream.DoubleStream x = r.doubles(10, .5, .4); }, |
330 |
> |
}; |
331 |
> |
assertThrows(IllegalArgumentException.class, throwingActions); |
332 |
|
} |
333 |
|
|
334 |
|
/** |
340 |
|
long size = 0; |
341 |
|
for (int reps = 0; reps < REPS; ++reps) { |
342 |
|
counter.reset(); |
343 |
< |
r.ints(size).parallel().forEach(x -> {counter.increment();}); |
343 |
> |
r.ints(size).parallel().forEach(x -> counter.increment()); |
344 |
|
assertEquals(size, counter.sum()); |
345 |
|
size += 524959; |
346 |
|
} |
355 |
|
long size = 0; |
356 |
|
for (int reps = 0; reps < REPS; ++reps) { |
357 |
|
counter.reset(); |
358 |
< |
r.longs(size).parallel().forEach(x -> {counter.increment();}); |
358 |
> |
r.longs(size).parallel().forEach(x -> counter.increment()); |
359 |
|
assertEquals(size, counter.sum()); |
360 |
|
size += 524959; |
361 |
|
} |
370 |
|
long size = 0; |
371 |
|
for (int reps = 0; reps < REPS; ++reps) { |
372 |
|
counter.reset(); |
373 |
< |
r.doubles(size).parallel().forEach(x -> {counter.increment();}); |
373 |
> |
r.doubles(size).parallel().forEach(x -> counter.increment()); |
374 |
|
assertEquals(size, counter.sum()); |
375 |
|
size += 524959; |
376 |
|
} |
437 |
|
LongAdder counter = new LongAdder(); |
438 |
|
SplittableRandom r = new SplittableRandom(); |
439 |
|
long size = 100; |
440 |
< |
r.ints().limit(size).parallel().forEach(x -> {counter.increment();}); |
440 |
> |
r.ints().limit(size).parallel().forEach(x -> counter.increment()); |
441 |
|
assertEquals(size, counter.sum()); |
442 |
|
} |
443 |
|
|
448 |
|
LongAdder counter = new LongAdder(); |
449 |
|
SplittableRandom r = new SplittableRandom(); |
450 |
|
long size = 100; |
451 |
< |
r.longs().limit(size).parallel().forEach(x -> {counter.increment();}); |
451 |
> |
r.longs().limit(size).parallel().forEach(x -> counter.increment()); |
452 |
|
assertEquals(size, counter.sum()); |
453 |
|
} |
454 |
|
|
459 |
|
LongAdder counter = new LongAdder(); |
460 |
|
SplittableRandom r = new SplittableRandom(); |
461 |
|
long size = 100; |
462 |
< |
r.doubles().limit(size).parallel().forEach(x -> {counter.increment();}); |
462 |
> |
r.doubles().limit(size).parallel().forEach(x -> counter.increment()); |
463 |
|
assertEquals(size, counter.sum()); |
464 |
|
} |
465 |
|
|
470 |
|
LongAdder counter = new LongAdder(); |
471 |
|
SplittableRandom r = new SplittableRandom(); |
472 |
|
long size = 100; |
473 |
< |
r.ints().limit(size).forEach(x -> {counter.increment();}); |
473 |
> |
r.ints().limit(size).forEach(x -> counter.increment()); |
474 |
|
assertEquals(size, counter.sum()); |
475 |
|
} |
476 |
|
|
481 |
|
LongAdder counter = new LongAdder(); |
482 |
|
SplittableRandom r = new SplittableRandom(); |
483 |
|
long size = 100; |
484 |
< |
r.longs().limit(size).forEach(x -> {counter.increment();}); |
484 |
> |
r.longs().limit(size).forEach(x -> counter.increment()); |
485 |
|
assertEquals(size, counter.sum()); |
486 |
|
} |
487 |
|
|
492 |
|
LongAdder counter = new LongAdder(); |
493 |
|
SplittableRandom r = new SplittableRandom(); |
494 |
|
long size = 100; |
495 |
< |
r.doubles().limit(size).forEach(x -> {counter.increment();}); |
495 |
> |
r.doubles().limit(size).forEach(x -> counter.increment()); |
496 |
|
assertEquals(size, counter.sum()); |
497 |
|
} |
498 |
|
|