ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/ThreadLocalRandomTest.java

Comparing jsr166/src/test/tck/ThreadLocalRandomTest.java (file contents):
Revision 1.15 by dl, Wed Aug 14 12:41:18 2013 UTC vs.
Revision 1.22 by jsr166, Sun Nov 13 03:36:50 2016 UTC

#	Line 3 | Line 3
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);
#	Line 52 | Line 52 | public class ThreadLocalRandomTest exten
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	+	try {
62	+	java.lang.reflect.Method m
63	+	= ThreadLocalRandom.class.getDeclaredMethod(
64	+	"next", new Class[] { int.class });
65	+	m.setAccessible(true);
66	+
67	+	int i;
68	+	{
69	+	int val = new java.util.Random().nextInt(4);
70	+	for (i = 0; i < NCALLS; i++) {
71	+	int q = (int) m.invoke(rnd, new Object[] { 2 });
72	+	if (val == q) break;
73	+	}
74	+	assertTrue(i < NCALLS);
75	+	}
76	+
77	+	{
78	+	int r = (int) m.invoke(rnd, new Object[] { 3 });
79	+	for (i = 0; i < NCALLS; i++) {
80	+	int q = (int) m.invoke(rnd, new Object[] { 3 });
81	+	assertTrue(q < (1<<3));
82	+	if (r != q) break;
83	+	}
84	+	assertTrue(i < NCALLS);
85	+	}
86	+	} catch (SecurityException acceptable) {}
87	+	}
88	+
89	+	/**
90		* Repeated calls to nextInt produce at least two distinct results
91		*/
92		public void testNextInt() {
#	Line 118 | Line 153 | public class ThreadLocalRandomTest exten
153		}
154
155		/**
156	<	* nextInt(negative) throws IllegalArgumentException
156	>	* nextInt(non-positive) throws IllegalArgumentException
157		*/
158	<	public void testNextIntBoundedNeg() {
159	<	try {
160	<	int f = ThreadLocalRandom.current().nextInt(-17);
161	<	shouldThrow();
162	<	} catch (IllegalArgumentException success) {}
158	>	public void testNextIntBoundNonPositive() {
159	>	ThreadLocalRandom rnd = ThreadLocalRandom.current();
160	>	for (int bound : new int[] { 0, -17, Integer.MIN_VALUE }) {
161	>	try {
162	>	rnd.nextInt(bound);
163	>	shouldThrow();
164	>	} catch (IllegalArgumentException success) {}
165	>	}
166		}
167
168		/**
169		* nextInt(least >= bound) throws IllegalArgumentException
170		*/
171		public void testNextIntBadBounds() {
172	<	try {
173	<	int f = ThreadLocalRandom.current().nextInt(17, 2);
174	<	shouldThrow();
175	<	} catch (IllegalArgumentException success) {}
172	>	int[][] badBoundss = {
173	>	{ 17, 2 },
174	>	{ -42, -42 },
175	>	{ Integer.MAX_VALUE, Integer.MIN_VALUE },
176	>	};
177	>	ThreadLocalRandom rnd = ThreadLocalRandom.current();
178	>	for (int[] badBounds : badBoundss) {
179	>	try {
180	>	rnd.nextInt(badBounds[0], badBounds[1]);
181	>	shouldThrow();
182	>	} catch (IllegalArgumentException success) {}
183	>	}
184		}
185
186		/**
#	Line 179 | Line 225 | public class ThreadLocalRandomTest exten
225		}
226
227		/**
228	<	* nextLong(negative) throws IllegalArgumentException
228	>	* nextLong(non-positive) throws IllegalArgumentException
229		*/
230	<	public void testNextLongBoundedNeg() {
231	<	try {
232	<	long f = ThreadLocalRandom.current().nextLong(-17);
233	<	shouldThrow();
234	<	} catch (IllegalArgumentException success) {}
230	>	public void testNextLongBoundNonPositive() {
231	>	ThreadLocalRandom rnd = ThreadLocalRandom.current();
232	>	for (long bound : new long[] { 0L, -17L, Long.MIN_VALUE }) {
233	>	try {
234	>	rnd.nextLong(bound);
235	>	shouldThrow();
236	>	} catch (IllegalArgumentException success) {}
237	>	}
238		}
239
240		/**
241		* nextLong(least >= bound) throws IllegalArgumentException
242		*/
243		public void testNextLongBadBounds() {
244	<	try {
245	<	long f = ThreadLocalRandom.current().nextLong(17, 2);
246	<	shouldThrow();
247	<	} catch (IllegalArgumentException success) {}
244	>	long[][] badBoundss = {
245	>	{ 17L, 2L },
246	>	{ -42L, -42L },
247	>	{ Long.MAX_VALUE, Long.MIN_VALUE },
248	>	};
249	>	ThreadLocalRandom rnd = ThreadLocalRandom.current();
250	>	for (long[] badBounds : badBoundss) {
251	>	try {
252	>	rnd.nextLong(badBounds[0], badBounds[1]);
253	>	shouldThrow();
254	>	} catch (IllegalArgumentException success) {}
255	>	}
256		}
257
258		/**
#	Line 239 | Line 296 | public class ThreadLocalRandomTest exten
296		}
297
298		/**
299	+	* nextDouble(non-positive) throws IllegalArgumentException
300	+	*/
301	+	public void testNextDoubleBoundNonPositive() {
302	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
303	+	double[] badBounds = {
304	+	0.0d,
305	+	-17.0d,
306	+	-Double.MIN_VALUE,
307	+	Double.NEGATIVE_INFINITY,
308	+	Double.NaN,
309	+	};
310	+	for (double bound : badBounds) {
311	+	try {
312	+	rnd.nextDouble(bound);
313	+	shouldThrow();
314	+	} catch (IllegalArgumentException success) {}
315	+	}
316	+	}
317	+
318	+	/**
319		* nextDouble(least, bound) returns least <= value < bound;
320		* repeated calls produce at least two distinct results
321		*/
#	Line 272 | Line 349 | public class ThreadLocalRandomTest exten
349		long firstRand = 0;
350		ThreadLocalRandom firstThreadLocalRandom = null;
351
352	<	final CheckedRunnable getRandomState = new CheckedRunnable() {
352	>	Runnable getRandomState = new CheckedRunnable() {
353		public void realRun() {
354		ThreadLocalRandom current = ThreadLocalRandom.current();
355		assertSame(current, ThreadLocalRandom.current());
#	Line 296 | Line 373 | public class ThreadLocalRandomTest exten
373		fail("all threads generate the same pseudo-random sequence");
374		}
375
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	–
376		}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines