57 |
|
* possible values. |
58 |
|
*/ |
59 |
|
public void testNext() throws ReflectiveOperationException { |
60 |
+ |
// Inhibit "An illegal reflective access operation has occurred" |
61 |
+ |
if (!testImplementationDetails) return; |
62 |
+ |
|
63 |
|
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
64 |
+ |
final java.lang.reflect.Method m; |
65 |
|
try { |
66 |
< |
java.lang.reflect.Method m |
63 |
< |
= ThreadLocalRandom.class.getDeclaredMethod( |
64 |
< |
"next", new Class[] { int.class }); |
66 |
> |
m = ThreadLocalRandom.class.getDeclaredMethod("next", int.class); |
67 |
|
m.setAccessible(true); |
68 |
+ |
} catch (SecurityException acceptable) { |
69 |
+ |
// Security manager may deny access |
70 |
+ |
return; |
71 |
+ |
} catch (Exception ex) { |
72 |
+ |
// jdk9 module system may deny access |
73 |
+ |
if (ex.getClass().getSimpleName() |
74 |
+ |
.equals("InaccessibleObjectException")) |
75 |
+ |
return; |
76 |
+ |
throw ex; |
77 |
+ |
} |
78 |
|
|
79 |
< |
int i; |
80 |
< |
{ |
81 |
< |
int val = new java.util.Random().nextInt(4); |
82 |
< |
for (i = 0; i < NCALLS; i++) { |
83 |
< |
int q = (int) m.invoke(rnd, new Object[] { 2 }); |
84 |
< |
if (val == q) break; |
73 |
< |
} |
74 |
< |
assertTrue(i < NCALLS); |
79 |
> |
int i; |
80 |
> |
{ |
81 |
> |
int val = new java.util.Random().nextInt(4); |
82 |
> |
for (i = 0; i < NCALLS; i++) { |
83 |
> |
int q = (int) m.invoke(rnd, new Object[] { 2 }); |
84 |
> |
if (val == q) break; |
85 |
|
} |
86 |
+ |
assertTrue(i < NCALLS); |
87 |
+ |
} |
88 |
|
|
89 |
< |
{ |
90 |
< |
int r = (int) m.invoke(rnd, new Object[] { 3 }); |
91 |
< |
for (i = 0; i < NCALLS; i++) { |
92 |
< |
int q = (int) m.invoke(rnd, new Object[] { 3 }); |
93 |
< |
assertTrue(q < (1<<3)); |
94 |
< |
if (r != q) break; |
83 |
< |
} |
84 |
< |
assertTrue(i < NCALLS); |
89 |
> |
{ |
90 |
> |
int r = (int) m.invoke(rnd, new Object[] { 3 }); |
91 |
> |
for (i = 0; i < NCALLS; i++) { |
92 |
> |
int q = (int) m.invoke(rnd, new Object[] { 3 }); |
93 |
> |
assertTrue(q < (1<<3)); |
94 |
> |
if (r != q) break; |
95 |
|
} |
96 |
< |
} catch (SecurityException acceptable) {} |
96 |
> |
assertTrue(i < NCALLS); |
97 |
> |
} |
98 |
|
} |
99 |
|
|
100 |
|
/** |
354 |
|
// Don't use main thread's ThreadLocalRandom - it is likely to |
355 |
|
// be polluted by previous tests. |
356 |
|
final AtomicReference<ThreadLocalRandom> threadLocalRandom = |
357 |
< |
new AtomicReference<ThreadLocalRandom>(); |
357 |
> |
new AtomicReference<>(); |
358 |
|
final AtomicLong rand = new AtomicLong(); |
359 |
|
|
360 |
|
long firstRand = 0; |
384 |
|
fail("all threads generate the same pseudo-random sequence"); |
385 |
|
} |
386 |
|
|
387 |
+ |
/** |
388 |
+ |
* Repeated calls to nextBytes produce at least values of different signs for every byte |
389 |
+ |
*/ |
390 |
+ |
public void testNextBytes() { |
391 |
+ |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
392 |
+ |
int n = rnd.nextInt(1, 20); |
393 |
+ |
byte[] bytes = new byte[n]; |
394 |
+ |
outer: |
395 |
+ |
for (int i = 0; i < n; i++) { |
396 |
+ |
for (int tries = NCALLS; tries-->0; ) { |
397 |
+ |
byte before = bytes[i]; |
398 |
+ |
rnd.nextBytes(bytes); |
399 |
+ |
byte after = bytes[i]; |
400 |
+ |
if (after * before < 0) |
401 |
+ |
continue outer; |
402 |
+ |
} |
403 |
+ |
fail("not enough variation in random bytes"); |
404 |
+ |
} |
405 |
+ |
} |
406 |
+ |
|
407 |
+ |
/** |
408 |
+ |
* Filling an empty array with random bytes succeeds without effect. |
409 |
+ |
*/ |
410 |
+ |
public void testNextBytes_emptyArray() { |
411 |
+ |
ThreadLocalRandom.current().nextBytes(new byte[0]); |
412 |
+ |
} |
413 |
+ |
|
414 |
+ |
public void testNextBytes_nullArray() { |
415 |
+ |
try { |
416 |
+ |
ThreadLocalRandom.current().nextBytes(null); |
417 |
+ |
shouldThrow(); |
418 |
+ |
} catch (NullPointerException success) {} |
419 |
+ |
} |
420 |
+ |
|
421 |
|
} |