91 |
|
for (long seed = 2; seed < MAX_LONG_BOUND; seed += 15485863) { |
92 |
|
SplittableRandom sr1 = new SplittableRandom(seed); |
93 |
|
SplittableRandom sr2 = new SplittableRandom(seed); |
94 |
< |
for (int i = 0; i < REPS; ++i) |
94 |
> |
for (int i = 0; i < REPS; ++i) |
95 |
|
assertEquals(sr1.nextLong(), sr2.nextLong()); |
96 |
|
} |
97 |
|
} |
380 |
|
for (int bound = least + 2; bound > least && bound < MAX_INT_BOUND; bound += 67867967) { |
381 |
|
final int lo = least, hi = bound; |
382 |
|
r.ints(size, lo, hi).parallel(). |
383 |
< |
forEach(x -> {if (x < lo || x >= hi) |
383 |
> |
forEach(x -> {if (x < lo || x >= hi) |
384 |
|
fails.getAndIncrement(); }); |
385 |
|
} |
386 |
|
} |
398 |
|
for (long bound = least + 2; bound > least && bound < MAX_LONG_BOUND; bound += Math.abs(bound * 7919)) { |
399 |
|
final long lo = least, hi = bound; |
400 |
|
r.longs(size, lo, hi).parallel(). |
401 |
< |
forEach(x -> {if (x < lo || x >= hi) |
401 |
> |
forEach(x -> {if (x < lo || x >= hi) |
402 |
|
fails.getAndIncrement(); }); |
403 |
|
} |
404 |
|
} |
416 |
|
for (double bound = least * 1.0011; bound < 1.0e20; bound *= 17) { |
417 |
|
final double lo = least, hi = bound; |
418 |
|
r.doubles(size, lo, hi).parallel(). |
419 |
< |
forEach(x -> {if (x < lo || x >= hi) |
419 |
> |
forEach(x -> {if (x < lo || x >= hi) |
420 |
|
fails.getAndIncrement(); }); |
421 |
|
} |
422 |
|
} |