3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
< |
import junit.framework.*; |
7 |
< |
import java.util.*; |
6 |
> |
|
7 |
|
import java.util.concurrent.ThreadLocalRandom; |
8 |
|
import java.util.concurrent.atomic.AtomicLong; |
10 |
– |
import java.util.concurrent.atomic.AtomicInteger; |
9 |
|
import java.util.concurrent.atomic.AtomicReference; |
10 |
< |
import java.util.concurrent.atomic.LongAdder; |
10 |
> |
|
11 |
> |
import junit.framework.Test; |
12 |
> |
import junit.framework.TestSuite; |
13 |
|
|
14 |
|
public class ThreadLocalRandomTest 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(ThreadLocalRandomTest.class); |
52 |
|
} |
53 |
|
|
54 |
|
/** |
55 |
+ |
* Repeated calls to next (only accessible via reflection) produce |
56 |
+ |
* at least two distinct results, and repeated calls produce all |
57 |
+ |
* possible values. |
58 |
+ |
*/ |
59 |
+ |
public void testNext() throws ReflectiveOperationException { |
60 |
+ |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
61 |
+ |
final java.lang.reflect.Method m; |
62 |
+ |
try { |
63 |
+ |
m = ThreadLocalRandom.class.getDeclaredMethod( |
64 |
+ |
"next", new Class[] { int.class }); |
65 |
+ |
m.setAccessible(true); |
66 |
+ |
} catch (SecurityException acceptable) { |
67 |
+ |
// Security manager may deny access |
68 |
+ |
return; |
69 |
+ |
} catch (Exception ex) { |
70 |
+ |
// jdk9 module system may deny access |
71 |
+ |
if (ex.getClass().getSimpleName() |
72 |
+ |
.equals("InaccessibleObjectException")) |
73 |
+ |
return; |
74 |
+ |
throw ex; |
75 |
+ |
} |
76 |
+ |
|
77 |
+ |
int i; |
78 |
+ |
{ |
79 |
+ |
int val = new java.util.Random().nextInt(4); |
80 |
+ |
for (i = 0; i < NCALLS; i++) { |
81 |
+ |
int q = (int) m.invoke(rnd, new Object[] { 2 }); |
82 |
+ |
if (val == q) break; |
83 |
+ |
} |
84 |
+ |
assertTrue(i < NCALLS); |
85 |
+ |
} |
86 |
+ |
|
87 |
+ |
{ |
88 |
+ |
int r = (int) m.invoke(rnd, new Object[] { 3 }); |
89 |
+ |
for (i = 0; i < NCALLS; i++) { |
90 |
+ |
int q = (int) m.invoke(rnd, new Object[] { 3 }); |
91 |
+ |
assertTrue(q < (1<<3)); |
92 |
+ |
if (r != q) break; |
93 |
+ |
} |
94 |
+ |
assertTrue(i < NCALLS); |
95 |
+ |
} |
96 |
+ |
} |
97 |
+ |
|
98 |
+ |
/** |
99 |
|
* Repeated calls to nextInt produce at least two distinct results |
100 |
|
*/ |
101 |
|
public void testNextInt() { |
162 |
|
} |
163 |
|
|
164 |
|
/** |
165 |
< |
* nextInt(negative) throws IllegalArgumentException |
165 |
> |
* nextInt(non-positive) throws IllegalArgumentException |
166 |
|
*/ |
167 |
< |
public void testNextIntBoundedNeg() { |
168 |
< |
try { |
169 |
< |
int f = ThreadLocalRandom.current().nextInt(-17); |
170 |
< |
shouldThrow(); |
171 |
< |
} catch (IllegalArgumentException success) {} |
167 |
> |
public void testNextIntBoundNonPositive() { |
168 |
> |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
169 |
> |
for (int bound : new int[] { 0, -17, Integer.MIN_VALUE }) { |
170 |
> |
try { |
171 |
> |
rnd.nextInt(bound); |
172 |
> |
shouldThrow(); |
173 |
> |
} catch (IllegalArgumentException success) {} |
174 |
> |
} |
175 |
|
} |
176 |
|
|
177 |
|
/** |
178 |
|
* nextInt(least >= bound) throws IllegalArgumentException |
179 |
|
*/ |
180 |
|
public void testNextIntBadBounds() { |
181 |
< |
try { |
182 |
< |
int f = ThreadLocalRandom.current().nextInt(17, 2); |
183 |
< |
shouldThrow(); |
184 |
< |
} catch (IllegalArgumentException success) {} |
181 |
> |
int[][] badBoundss = { |
182 |
> |
{ 17, 2 }, |
183 |
> |
{ -42, -42 }, |
184 |
> |
{ Integer.MAX_VALUE, Integer.MIN_VALUE }, |
185 |
> |
}; |
186 |
> |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
187 |
> |
for (int[] badBounds : badBoundss) { |
188 |
> |
try { |
189 |
> |
rnd.nextInt(badBounds[0], badBounds[1]); |
190 |
> |
shouldThrow(); |
191 |
> |
} catch (IllegalArgumentException success) {} |
192 |
> |
} |
193 |
|
} |
194 |
|
|
195 |
|
/** |
234 |
|
} |
235 |
|
|
236 |
|
/** |
237 |
< |
* nextLong(negative) throws IllegalArgumentException |
237 |
> |
* nextLong(non-positive) throws IllegalArgumentException |
238 |
|
*/ |
239 |
< |
public void testNextLongBoundedNeg() { |
240 |
< |
try { |
241 |
< |
long f = ThreadLocalRandom.current().nextLong(-17); |
242 |
< |
shouldThrow(); |
243 |
< |
} catch (IllegalArgumentException success) {} |
239 |
> |
public void testNextLongBoundNonPositive() { |
240 |
> |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
241 |
> |
for (long bound : new long[] { 0L, -17L, Long.MIN_VALUE }) { |
242 |
> |
try { |
243 |
> |
rnd.nextLong(bound); |
244 |
> |
shouldThrow(); |
245 |
> |
} catch (IllegalArgumentException success) {} |
246 |
> |
} |
247 |
|
} |
248 |
|
|
249 |
|
/** |
250 |
|
* nextLong(least >= bound) throws IllegalArgumentException |
251 |
|
*/ |
252 |
|
public void testNextLongBadBounds() { |
253 |
< |
try { |
254 |
< |
long f = ThreadLocalRandom.current().nextLong(17, 2); |
255 |
< |
shouldThrow(); |
256 |
< |
} catch (IllegalArgumentException success) {} |
253 |
> |
long[][] badBoundss = { |
254 |
> |
{ 17L, 2L }, |
255 |
> |
{ -42L, -42L }, |
256 |
> |
{ Long.MAX_VALUE, Long.MIN_VALUE }, |
257 |
> |
}; |
258 |
> |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
259 |
> |
for (long[] badBounds : badBoundss) { |
260 |
> |
try { |
261 |
> |
rnd.nextLong(badBounds[0], badBounds[1]); |
262 |
> |
shouldThrow(); |
263 |
> |
} catch (IllegalArgumentException success) {} |
264 |
> |
} |
265 |
|
} |
266 |
|
|
267 |
|
/** |
305 |
|
} |
306 |
|
|
307 |
|
/** |
308 |
+ |
* nextDouble(non-positive) throws IllegalArgumentException |
309 |
+ |
*/ |
310 |
+ |
public void testNextDoubleBoundNonPositive() { |
311 |
+ |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
312 |
+ |
double[] badBounds = { |
313 |
+ |
0.0d, |
314 |
+ |
-17.0d, |
315 |
+ |
-Double.MIN_VALUE, |
316 |
+ |
Double.NEGATIVE_INFINITY, |
317 |
+ |
Double.NaN, |
318 |
+ |
}; |
319 |
+ |
for (double bound : badBounds) { |
320 |
+ |
try { |
321 |
+ |
rnd.nextDouble(bound); |
322 |
+ |
shouldThrow(); |
323 |
+ |
} catch (IllegalArgumentException success) {} |
324 |
+ |
} |
325 |
+ |
} |
326 |
+ |
|
327 |
+ |
/** |
328 |
|
* nextDouble(least, bound) returns least <= value < bound; |
329 |
|
* repeated calls produce at least two distinct results |
330 |
|
*/ |
358 |
|
long firstRand = 0; |
359 |
|
ThreadLocalRandom firstThreadLocalRandom = null; |
360 |
|
|
361 |
< |
final CheckedRunnable getRandomState = new CheckedRunnable() { |
361 |
> |
Runnable getRandomState = new CheckedRunnable() { |
362 |
|
public void realRun() { |
363 |
|
ThreadLocalRandom current = ThreadLocalRandom.current(); |
364 |
|
assertSame(current, ThreadLocalRandom.current()); |
382 |
|
fail("all threads generate the same pseudo-random sequence"); |
383 |
|
} |
384 |
|
|
299 |
– |
/** |
300 |
– |
* Invoking sized ints, long, doubles, with negative sizes throws |
301 |
– |
* IllegalArgumentException |
302 |
– |
*/ |
303 |
– |
public void testBadStreamSize() { |
304 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
305 |
– |
try { |
306 |
– |
java.util.stream.IntStream x = r.ints(-1L); |
307 |
– |
shouldThrow(); |
308 |
– |
} catch (IllegalArgumentException success) {} |
309 |
– |
try { |
310 |
– |
java.util.stream.IntStream x = r.ints(-1L, 2, 3); |
311 |
– |
shouldThrow(); |
312 |
– |
} catch (IllegalArgumentException success) {} |
313 |
– |
try { |
314 |
– |
java.util.stream.LongStream x = r.longs(-1L); |
315 |
– |
shouldThrow(); |
316 |
– |
} catch (IllegalArgumentException success) {} |
317 |
– |
try { |
318 |
– |
java.util.stream.LongStream x = r.longs(-1L, -1L, 1L); |
319 |
– |
shouldThrow(); |
320 |
– |
} catch (IllegalArgumentException success) {} |
321 |
– |
try { |
322 |
– |
java.util.stream.DoubleStream x = r.doubles(-1L); |
323 |
– |
shouldThrow(); |
324 |
– |
} catch (IllegalArgumentException success) {} |
325 |
– |
try { |
326 |
– |
java.util.stream.DoubleStream x = r.doubles(-1L, .5, .6); |
327 |
– |
shouldThrow(); |
328 |
– |
} catch (IllegalArgumentException success) {} |
329 |
– |
} |
330 |
– |
|
331 |
– |
/** |
332 |
– |
* Invoking bounded ints, long, doubles, with illegal bounds throws |
333 |
– |
* IllegalArgumentException |
334 |
– |
*/ |
335 |
– |
public void testBadStreamBounds() { |
336 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
337 |
– |
try { |
338 |
– |
java.util.stream.IntStream x = r.ints(2, 1); |
339 |
– |
shouldThrow(); |
340 |
– |
} catch (IllegalArgumentException success) {} |
341 |
– |
try { |
342 |
– |
java.util.stream.IntStream x = r.ints(10, 42, 42); |
343 |
– |
shouldThrow(); |
344 |
– |
} catch (IllegalArgumentException success) {} |
345 |
– |
try { |
346 |
– |
java.util.stream.LongStream x = r.longs(-1L, -1L); |
347 |
– |
shouldThrow(); |
348 |
– |
} catch (IllegalArgumentException success) {} |
349 |
– |
try { |
350 |
– |
java.util.stream.LongStream x = r.longs(10, 1L, -2L); |
351 |
– |
shouldThrow(); |
352 |
– |
} catch (IllegalArgumentException success) {} |
353 |
– |
try { |
354 |
– |
java.util.stream.DoubleStream x = r.doubles(0.0, 0.0); |
355 |
– |
shouldThrow(); |
356 |
– |
} catch (IllegalArgumentException success) {} |
357 |
– |
try { |
358 |
– |
java.util.stream.DoubleStream x = r.doubles(10, .5, .4); |
359 |
– |
shouldThrow(); |
360 |
– |
} catch (IllegalArgumentException success) {} |
361 |
– |
} |
362 |
– |
|
363 |
– |
/** |
364 |
– |
* A parallel sized stream of ints generates the given number of values |
365 |
– |
*/ |
366 |
– |
public void testIntsCount() { |
367 |
– |
LongAdder counter = new LongAdder(); |
368 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
369 |
– |
long size = 0; |
370 |
– |
for (int reps = 0; reps < REPS; ++reps) { |
371 |
– |
counter.reset(); |
372 |
– |
r.ints(size).parallel().forEach(x -> {counter.increment();}); |
373 |
– |
assertEquals(size, counter.sum()); |
374 |
– |
size += 524959; |
375 |
– |
} |
376 |
– |
} |
377 |
– |
|
378 |
– |
/** |
379 |
– |
* A parallel sized stream of longs generates the given number of values |
380 |
– |
*/ |
381 |
– |
public void testLongsCount() { |
382 |
– |
LongAdder counter = new LongAdder(); |
383 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
384 |
– |
long size = 0; |
385 |
– |
for (int reps = 0; reps < REPS; ++reps) { |
386 |
– |
counter.reset(); |
387 |
– |
r.longs(size).parallel().forEach(x -> {counter.increment();}); |
388 |
– |
assertEquals(size, counter.sum()); |
389 |
– |
size += 524959; |
390 |
– |
} |
391 |
– |
} |
392 |
– |
|
393 |
– |
/** |
394 |
– |
* A parallel sized stream of doubles generates the given number of values |
395 |
– |
*/ |
396 |
– |
public void testDoublesCount() { |
397 |
– |
LongAdder counter = new LongAdder(); |
398 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
399 |
– |
long size = 0; |
400 |
– |
for (int reps = 0; reps < REPS; ++reps) { |
401 |
– |
counter.reset(); |
402 |
– |
r.doubles(size).parallel().forEach(x -> {counter.increment();}); |
403 |
– |
assertEquals(size, counter.sum()); |
404 |
– |
size += 524959; |
405 |
– |
} |
406 |
– |
} |
407 |
– |
|
408 |
– |
/** |
409 |
– |
* Each of a parallel sized stream of bounded ints is within bounds |
410 |
– |
*/ |
411 |
– |
public void testBoundedInts() { |
412 |
– |
AtomicInteger fails = new AtomicInteger(0); |
413 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
414 |
– |
long size = 12345L; |
415 |
– |
for (int least = -15485867; least < MAX_INT_BOUND; least += 524959) { |
416 |
– |
for (int bound = least + 2; bound > least && bound < MAX_INT_BOUND; bound += 67867967) { |
417 |
– |
final int lo = least, hi = bound; |
418 |
– |
r.ints(size, lo, hi).parallel(). |
419 |
– |
forEach(x -> {if (x < lo || x >= hi) |
420 |
– |
fails.getAndIncrement(); }); |
421 |
– |
} |
422 |
– |
} |
423 |
– |
assertEquals(0, fails.get()); |
424 |
– |
} |
425 |
– |
|
426 |
– |
/** |
427 |
– |
* Each of a parallel sized stream of bounded longs is within bounds |
428 |
– |
*/ |
429 |
– |
public void testBoundedLongs() { |
430 |
– |
AtomicInteger fails = new AtomicInteger(0); |
431 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
432 |
– |
long size = 123L; |
433 |
– |
for (long least = -86028121; least < MAX_LONG_BOUND; least += 1982451653L) { |
434 |
– |
for (long bound = least + 2; bound > least && bound < MAX_LONG_BOUND; bound += Math.abs(bound * 7919)) { |
435 |
– |
final long lo = least, hi = bound; |
436 |
– |
r.longs(size, lo, hi).parallel(). |
437 |
– |
forEach(x -> {if (x < lo || x >= hi) |
438 |
– |
fails.getAndIncrement(); }); |
439 |
– |
} |
440 |
– |
} |
441 |
– |
assertEquals(0, fails.get()); |
442 |
– |
} |
443 |
– |
|
444 |
– |
/** |
445 |
– |
* Each of a parallel sized stream of bounded doubles is within bounds |
446 |
– |
*/ |
447 |
– |
public void testBoundedDoubles() { |
448 |
– |
AtomicInteger fails = new AtomicInteger(0); |
449 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
450 |
– |
long size = 456; |
451 |
– |
for (double least = 0.00011; least < 1.0e20; least *= 9) { |
452 |
– |
for (double bound = least * 1.0011; bound < 1.0e20; bound *= 17) { |
453 |
– |
final double lo = least, hi = bound; |
454 |
– |
r.doubles(size, lo, hi).parallel(). |
455 |
– |
forEach(x -> {if (x < lo || x >= hi) |
456 |
– |
fails.getAndIncrement(); }); |
457 |
– |
} |
458 |
– |
} |
459 |
– |
assertEquals(0, fails.get()); |
460 |
– |
} |
461 |
– |
|
462 |
– |
/** |
463 |
– |
* A parallel unsized stream of ints generates at least 100 values |
464 |
– |
*/ |
465 |
– |
public void testUnsizedIntsCount() { |
466 |
– |
LongAdder counter = new LongAdder(); |
467 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
468 |
– |
long size = 100; |
469 |
– |
r.ints().limit(size).parallel().forEach(x -> {counter.increment();}); |
470 |
– |
assertEquals(size, counter.sum()); |
471 |
– |
} |
472 |
– |
|
473 |
– |
/** |
474 |
– |
* A parallel unsized stream of longs generates at least 100 values |
475 |
– |
*/ |
476 |
– |
public void testUnsizedLongsCount() { |
477 |
– |
LongAdder counter = new LongAdder(); |
478 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
479 |
– |
long size = 100; |
480 |
– |
r.longs().limit(size).parallel().forEach(x -> {counter.increment();}); |
481 |
– |
assertEquals(size, counter.sum()); |
482 |
– |
} |
483 |
– |
|
484 |
– |
/** |
485 |
– |
* A parallel unsized stream of doubles generates at least 100 values |
486 |
– |
*/ |
487 |
– |
public void testUnsizedDoublesCount() { |
488 |
– |
LongAdder counter = new LongAdder(); |
489 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
490 |
– |
long size = 100; |
491 |
– |
r.doubles().limit(size).parallel().forEach(x -> {counter.increment();}); |
492 |
– |
assertEquals(size, counter.sum()); |
493 |
– |
} |
494 |
– |
|
495 |
– |
/** |
496 |
– |
* A sequential unsized stream of ints generates at least 100 values |
497 |
– |
*/ |
498 |
– |
public void testUnsizedIntsCountSeq() { |
499 |
– |
LongAdder counter = new LongAdder(); |
500 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
501 |
– |
long size = 100; |
502 |
– |
r.ints().limit(size).forEach(x -> {counter.increment();}); |
503 |
– |
assertEquals(size, counter.sum()); |
504 |
– |
} |
505 |
– |
|
506 |
– |
/** |
507 |
– |
* A sequential unsized stream of longs generates at least 100 values |
508 |
– |
*/ |
509 |
– |
public void testUnsizedLongsCountSeq() { |
510 |
– |
LongAdder counter = new LongAdder(); |
511 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
512 |
– |
long size = 100; |
513 |
– |
r.longs().limit(size).forEach(x -> {counter.increment();}); |
514 |
– |
assertEquals(size, counter.sum()); |
515 |
– |
} |
516 |
– |
|
517 |
– |
/** |
518 |
– |
* A sequential unsized stream of doubles generates at least 100 values |
519 |
– |
*/ |
520 |
– |
public void testUnsizedDoublesCountSeq() { |
521 |
– |
LongAdder counter = new LongAdder(); |
522 |
– |
ThreadLocalRandom r = ThreadLocalRandom.current(); |
523 |
– |
long size = 100; |
524 |
– |
r.doubles().limit(size).forEach(x -> {counter.increment();}); |
525 |
– |
assertEquals(size, counter.sum()); |
526 |
– |
} |
527 |
– |
|
385 |
|
} |