14 |
|
public class SplittableRandomTest extends JSR166TestCase { |
15 |
|
|
16 |
|
public static void main(String[] args) { |
17 |
< |
junit.textui.TestRunner.run(suite()); |
17 |
> |
main(suite(), args); |
18 |
|
} |
19 |
|
public static Test suite() { |
20 |
|
return new TestSuite(SplittableRandomTest.class); |
160 |
|
*/ |
161 |
|
public void testNextIntBounded() { |
162 |
|
SplittableRandom sr = new SplittableRandom(); |
163 |
+ |
for (int i = 0; i < 2; i++) assertEquals(0, sr.nextInt(1)); |
164 |
|
// sample bound space across prime number increments |
165 |
|
for (int bound = 2; bound < MAX_INT_BOUND; bound += 524959) { |
166 |
|
int f = sr.nextInt(bound); |
230 |
|
*/ |
231 |
|
public void testNextLongBounded() { |
232 |
|
SplittableRandom sr = new SplittableRandom(); |
233 |
+ |
for (int i = 0; i < 2; i++) assertEquals(0L, sr.nextLong(1L)); |
234 |
|
for (long bound = 2; bound < MAX_LONG_BOUND; bound += 15485863) { |
235 |
|
long f = sr.nextLong(bound); |
236 |
|
assertTrue(0 <= f && f < bound); |
412 |
|
for (int least = -15485867; least < MAX_INT_BOUND; least += 524959) { |
413 |
|
for (int bound = least + 2; bound > least && bound < MAX_INT_BOUND; bound += 67867967) { |
414 |
|
final int lo = least, hi = bound; |
415 |
< |
r.ints(size, lo, hi).parallel(). |
416 |
< |
forEach(x -> {if (x < lo || x >= hi) |
417 |
< |
fails.getAndIncrement(); }); |
415 |
> |
r.ints(size, lo, hi).parallel().forEach( |
416 |
> |
x -> { |
417 |
> |
if (x < lo || x >= hi) |
418 |
> |
fails.getAndIncrement(); }); |
419 |
|
} |
420 |
|
} |
421 |
|
assertEquals(0, fails.get()); |
431 |
|
for (long least = -86028121; least < MAX_LONG_BOUND; least += 1982451653L) { |
432 |
|
for (long bound = least + 2; bound > least && bound < MAX_LONG_BOUND; bound += Math.abs(bound * 7919)) { |
433 |
|
final long lo = least, hi = bound; |
434 |
< |
r.longs(size, lo, hi).parallel(). |
435 |
< |
forEach(x -> {if (x < lo || x >= hi) |
436 |
< |
fails.getAndIncrement(); }); |
434 |
> |
r.longs(size, lo, hi).parallel().forEach( |
435 |
> |
x -> { |
436 |
> |
if (x < lo || x >= hi) |
437 |
> |
fails.getAndIncrement(); }); |
438 |
|
} |
439 |
|
} |
440 |
|
assertEquals(0, fails.get()); |
450 |
|
for (double least = 0.00011; least < 1.0e20; least *= 9) { |
451 |
|
for (double bound = least * 1.0011; bound < 1.0e20; bound *= 17) { |
452 |
|
final double lo = least, hi = bound; |
453 |
< |
r.doubles(size, lo, hi).parallel(). |
454 |
< |
forEach(x -> {if (x < lo || x >= hi) |
455 |
< |
fails.getAndIncrement(); }); |
453 |
> |
r.doubles(size, lo, hi).parallel().forEach( |
454 |
> |
x -> { |
455 |
> |
if (x < lo || x >= hi) |
456 |
> |
fails.getAndIncrement(); }); |
457 |
|
} |
458 |
|
} |
459 |
|
assertEquals(0, fails.get()); |