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.SplittableRandom; |
8 |
|
import java.util.concurrent.atomic.AtomicInteger; |
10 |
– |
import java.util.concurrent.atomic.AtomicLong; |
9 |
|
import java.util.concurrent.atomic.LongAdder; |
10 |
|
|
11 |
+ |
import junit.framework.Test; |
12 |
+ |
import junit.framework.TestSuite; |
13 |
+ |
|
14 |
|
public class SplittableRandomTest extends JSR166TestCase { |
15 |
|
|
16 |
|
public static void main(String[] args) { |
40 |
|
static final int NCALLS = 10000; |
41 |
|
|
42 |
|
// max sampled int bound |
43 |
< |
static final int MAX_INT_BOUND = (1 << 28); |
43 |
> |
static final int MAX_INT_BOUND = (1 << 26); |
44 |
|
|
45 |
|
// max sampled long bound |
46 |
< |
static final long MAX_LONG_BOUND = (1L << 42); |
46 |
> |
static final long MAX_LONG_BOUND = (1L << 40); |
47 |
|
|
48 |
|
// Number of replications for other checks |
49 |
|
static final int REPS = |
90 |
|
* same values for nextLong. |
91 |
|
*/ |
92 |
|
public void testSeedConstructor() { |
93 |
< |
for (long seed = 2; seed < MAX_LONG_BOUND; seed += 15485863) { |
93 |
> |
for (long seed = 2; seed < MAX_LONG_BOUND; seed += 15485863) { |
94 |
|
SplittableRandom sr1 = new SplittableRandom(seed); |
95 |
|
SplittableRandom sr2 = new SplittableRandom(seed); |
96 |
|
for (int i = 0; i < REPS; ++i) |
131 |
|
/** |
132 |
|
* nextInt(non-positive) throws IllegalArgumentException |
133 |
|
*/ |
134 |
< |
public void testNextIntNonPositive() { |
134 |
> |
public void testNextIntBoundNonPositive() { |
135 |
|
SplittableRandom sr = new SplittableRandom(); |
136 |
|
Runnable[] throwingActions = { |
137 |
|
() -> sr.nextInt(-17), |
146 |
|
*/ |
147 |
|
public void testNextIntBadBounds() { |
148 |
|
SplittableRandom sr = new SplittableRandom(); |
149 |
< |
try { |
150 |
< |
int f = sr.nextInt(17, 2); |
151 |
< |
shouldThrow(); |
152 |
< |
} catch (IllegalArgumentException success) {} |
149 |
> |
Runnable[] throwingActions = { |
150 |
> |
() -> sr.nextInt(17, 2), |
151 |
> |
() -> sr.nextInt(-42, -42), |
152 |
> |
() -> sr.nextInt(Integer.MAX_VALUE, Integer.MIN_VALUE), |
153 |
> |
}; |
154 |
> |
assertThrows(IllegalArgumentException.class, throwingActions); |
155 |
|
} |
156 |
|
|
157 |
|
/** |
200 |
|
/** |
201 |
|
* nextLong(non-positive) throws IllegalArgumentException |
202 |
|
*/ |
203 |
< |
public void testNextLongNonPositive() { |
203 |
> |
public void testNextLongBoundNonPositive() { |
204 |
|
SplittableRandom sr = new SplittableRandom(); |
205 |
|
Runnable[] throwingActions = { |
206 |
|
() -> sr.nextLong(-17L), |
215 |
|
*/ |
216 |
|
public void testNextLongBadBounds() { |
217 |
|
SplittableRandom sr = new SplittableRandom(); |
218 |
< |
try { |
219 |
< |
long f = sr.nextLong(17, 2); |
220 |
< |
shouldThrow(); |
221 |
< |
} catch (IllegalArgumentException success) {} |
218 |
> |
Runnable[] throwingActions = { |
219 |
> |
() -> sr.nextLong(17L, 2L), |
220 |
> |
() -> sr.nextLong(-42L, -42L), |
221 |
> |
() -> sr.nextLong(Long.MAX_VALUE, Long.MIN_VALUE), |
222 |
> |
}; |
223 |
> |
assertThrows(IllegalArgumentException.class, throwingActions); |
224 |
|
} |
225 |
|
|
226 |
|
/** |
268 |
|
/** |
269 |
|
* nextDouble(non-positive) throws IllegalArgumentException |
270 |
|
*/ |
271 |
< |
public void testNextDoubleNonPositive() { |
271 |
> |
public void testNextDoubleBoundNonPositive() { |
272 |
|
SplittableRandom sr = new SplittableRandom(); |
273 |
|
Runnable[] throwingActions = { |
274 |
|
() -> sr.nextDouble(-17.0d), |
281 |
|
} |
282 |
|
|
283 |
|
/** |
284 |
+ |
* nextDouble(! (least < bound)) throws IllegalArgumentException |
285 |
+ |
*/ |
286 |
+ |
public void testNextDoubleBadBounds() { |
287 |
+ |
SplittableRandom sr = new SplittableRandom(); |
288 |
+ |
Runnable[] throwingActions = { |
289 |
+ |
() -> sr.nextDouble(17.0d, 2.0d), |
290 |
+ |
() -> sr.nextDouble(-42.0d, -42.0d), |
291 |
+ |
() -> sr.nextDouble(Double.MAX_VALUE, Double.MIN_VALUE), |
292 |
+ |
() -> sr.nextDouble(Double.NaN, 0.0d), |
293 |
+ |
() -> sr.nextDouble(0.0d, Double.NaN), |
294 |
+ |
}; |
295 |
+ |
assertThrows(IllegalArgumentException.class, throwingActions); |
296 |
+ |
} |
297 |
+ |
|
298 |
+ |
// TODO: Test infinite bounds! |
299 |
+ |
//() -> sr.nextDouble(Double.NEGATIVE_INFINITY, 0.0d), |
300 |
+ |
//() -> sr.nextDouble(0.0d, Double.POSITIVE_INFINITY), |
301 |
+ |
|
302 |
+ |
/** |
303 |
|
* nextDouble(least, bound) returns least <= value < bound; |
304 |
|
* repeated calls produce at least two distinct results |
305 |
|
*/ |