50 |
|
Integer.getInteger("SplittableRandomTest.reps", 4); |
51 |
|
|
52 |
|
/** |
53 |
– |
* Repeated calls to next (only accessible via reflection) produce |
54 |
– |
* at least two distinct results, and repeated calls produce all |
55 |
– |
* possible values. |
56 |
– |
*/ |
57 |
– |
public void testNext() throws ReflectiveOperationException { |
58 |
– |
SplittableRandom rnd = new SplittableRandom(); |
59 |
– |
try { |
60 |
– |
java.lang.reflect.Method m |
61 |
– |
= SplittableRandom.class.getDeclaredMethod( |
62 |
– |
"next", new Class[] { int.class }); |
63 |
– |
m.setAccessible(true); |
64 |
– |
|
65 |
– |
int i; |
66 |
– |
{ |
67 |
– |
int val = new java.util.Random().nextInt(4); |
68 |
– |
for (i = 0; i < NCALLS; i++) { |
69 |
– |
int q = (int) m.invoke(rnd, new Object[] { 2 }); |
70 |
– |
if (val == q) break; |
71 |
– |
} |
72 |
– |
assertTrue(i < NCALLS); |
73 |
– |
} |
74 |
– |
|
75 |
– |
{ |
76 |
– |
int r = (int) m.invoke(rnd, new Object[] { 3 }); |
77 |
– |
for (i = 0; i < NCALLS; i++) { |
78 |
– |
int q = (int) m.invoke(rnd, new Object[] { 3 }); |
79 |
– |
assertTrue(q < (1<<3)); |
80 |
– |
if (r != q) break; |
81 |
– |
} |
82 |
– |
assertTrue(i < NCALLS); |
83 |
– |
} |
84 |
– |
} catch (SecurityException acceptable) {} |
85 |
– |
} |
86 |
– |
|
87 |
– |
/** |
53 |
|
* Repeated calls to nextInt produce at least two distinct results |
54 |
|
*/ |
55 |
|
public void testNextInt() { |