410 |
|
for (int least = -15485867; least < MAX_INT_BOUND; least += 524959) { |
411 |
|
for (int bound = least + 2; bound > least && bound < MAX_INT_BOUND; bound += 67867967) { |
412 |
|
final int lo = least, hi = bound; |
413 |
< |
r.ints(size, lo, hi).parallel(). |
414 |
< |
forEach(x -> {if (x < lo || x >= hi) |
415 |
< |
fails.getAndIncrement(); }); |
413 |
> |
r.ints(size, lo, hi).parallel().forEach( |
414 |
> |
x -> { |
415 |
> |
if (x < lo || x >= hi) |
416 |
> |
fails.getAndIncrement(); }); |
417 |
|
} |
418 |
|
} |
419 |
|
assertEquals(0, fails.get()); |
429 |
|
for (long least = -86028121; least < MAX_LONG_BOUND; least += 1982451653L) { |
430 |
|
for (long bound = least + 2; bound > least && bound < MAX_LONG_BOUND; bound += Math.abs(bound * 7919)) { |
431 |
|
final long lo = least, hi = bound; |
432 |
< |
r.longs(size, lo, hi).parallel(). |
433 |
< |
forEach(x -> {if (x < lo || x >= hi) |
434 |
< |
fails.getAndIncrement(); }); |
432 |
> |
r.longs(size, lo, hi).parallel().forEach( |
433 |
> |
x -> { |
434 |
> |
if (x < lo || x >= hi) |
435 |
> |
fails.getAndIncrement(); }); |
436 |
|
} |
437 |
|
} |
438 |
|
assertEquals(0, fails.get()); |
448 |
|
for (double least = 0.00011; least < 1.0e20; least *= 9) { |
449 |
|
for (double bound = least * 1.0011; bound < 1.0e20; bound *= 17) { |
450 |
|
final double lo = least, hi = bound; |
451 |
< |
r.doubles(size, lo, hi).parallel(). |
452 |
< |
forEach(x -> {if (x < lo || x >= hi) |
453 |
< |
fails.getAndIncrement(); }); |
451 |
> |
r.doubles(size, lo, hi).parallel().forEach( |
452 |
> |
x -> { |
453 |
> |
if (x < lo || x >= hi) |
454 |
> |
fails.getAndIncrement(); }); |
455 |
|
} |
456 |
|
} |
457 |
|
assertEquals(0, fails.get()); |