ViewVC Help

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

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

Comparing jsr166/src/test/tck/PriorityBlockingQueueTest.java (file contents):
Revision 1.44 by jsr166, Fri May 27 20:07:24 2011 UTC vs.
Revision 1.66 by jsr166, Tue Oct 6 00:03:55 2015 UTC

#	Line 6 | Line 6
6		* Pat Fisher, Mike Judd.
7		*/
8
9	–	import junit.framework.*;
10	–	import java.util.*;
11	–	import java.util.concurrent.*;
9		import static java.util.concurrent.TimeUnit.MILLISECONDS;
10	<	import java.io.*;
10	>
11	>	import java.util.ArrayList;
12	>	import java.util.Arrays;
13	>	import java.util.Collection;
14	>	import java.util.Comparator;
15	>	import java.util.Iterator;
16	>	import java.util.NoSuchElementException;
17	>	import java.util.Queue;
18	>	import java.util.concurrent.BlockingQueue;
19	>	import java.util.concurrent.CountDownLatch;
20	>	import java.util.concurrent.Executors;
21	>	import java.util.concurrent.ExecutorService;
22	>	import java.util.concurrent.PriorityBlockingQueue;
23	>
24	>	import junit.framework.Test;
25
26		public class PriorityBlockingQueueTest extends JSR166TestCase {
27
#	Line 22 | Line 33 | public class PriorityBlockingQueueTest e
33
34		public static class InitialCapacity extends BlockingQueueTest {
35		protected BlockingQueue emptyCollection() {
36	<	return new PriorityBlockingQueue(20);
36	>	return new PriorityBlockingQueue(SIZE);
37		}
38		}
39
40		public static void main(String[] args) {
41	<	junit.textui.TestRunner.run(suite());
41	>	main(suite(), args);
42		}
43
44		public static Test suite() {
#	Line 36 | Line 47 | public class PriorityBlockingQueueTest e
47		new InitialCapacity().testSuite());
48		}
49
39	–	private static final int NOCAP = Integer.MAX_VALUE;
40	–
50		/** Sample Comparator */
51		static class MyReverseComparator implements Comparator {
52		public int compare(Object x, Object y) {
#	Line 46 | Line 55 | public class PriorityBlockingQueueTest e
55		}
56
57		/**
58	<	* Create a queue of given size containing consecutive
58	>	* Returns a new queue of given size containing consecutive
59		* Integers 0 ... n.
60		*/
61		private PriorityBlockingQueue<Integer> populatedQueue(int n) {
62		PriorityBlockingQueue<Integer> q =
63		new PriorityBlockingQueue<Integer>(n);
64		assertTrue(q.isEmpty());
65	<	for (int i = n-1; i >= 0; i-=2)
65	>	for (int i = n - 1; i >= 0; i -= 2)
66		assertTrue(q.offer(new Integer(i)));
67	<	for (int i = (n & 1); i < n; i+=2)
67	>	for (int i = (n & 1); i < n; i += 2)
68		assertTrue(q.offer(new Integer(i)));
69		assertFalse(q.isEmpty());
70	<	assertEquals(NOCAP, q.remainingCapacity());
70	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
71		assertEquals(n, q.size());
72		return q;
73		}
#	Line 67 | Line 76 | public class PriorityBlockingQueueTest e
76		* A new queue has unbounded capacity
77		*/
78		public void testConstructor1() {
79	<	assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity());
79	>	assertEquals(Integer.MAX_VALUE,
80	>	new PriorityBlockingQueue(SIZE).remainingCapacity());
81		}
82
83		/**
#	Line 75 | Line 85 | public class PriorityBlockingQueueTest e
85		*/
86		public void testConstructor2() {
87		try {
88	<	PriorityBlockingQueue q = new PriorityBlockingQueue(0);
88	>	new PriorityBlockingQueue(0);
89		shouldThrow();
90		} catch (IllegalArgumentException success) {}
91		}
#	Line 85 | Line 95 | public class PriorityBlockingQueueTest e
95		*/
96		public void testConstructor3() {
97		try {
98	<	PriorityBlockingQueue q = new PriorityBlockingQueue(null);
98	>	new PriorityBlockingQueue(null);
99		shouldThrow();
100		} catch (NullPointerException success) {}
101		}
#	Line 94 | Line 104 | public class PriorityBlockingQueueTest e
104		* Initializing from Collection of null elements throws NPE
105		*/
106		public void testConstructor4() {
107	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
108		try {
109	<	Integer[] ints = new Integer[SIZE];
99	<	PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
109	>	new PriorityBlockingQueue(elements);
110		shouldThrow();
111		} catch (NullPointerException success) {}
112		}
#	Line 105 | Line 115 | public class PriorityBlockingQueueTest e
115		* Initializing from Collection with some null elements throws NPE
116		*/
117		public void testConstructor5() {
118	+	Integer[] ints = new Integer[SIZE];
119	+	for (int i = 0; i < SIZE - 1; ++i)
120	+	ints[i] = i;
121	+	Collection<Integer> elements = Arrays.asList(ints);
122		try {
123	<	Integer[] ints = new Integer[SIZE];
110	<	for (int i = 0; i < SIZE-1; ++i)
111	<	ints[i] = new Integer(i);
112	<	PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
123	>	new PriorityBlockingQueue(elements);
124		shouldThrow();
125		} catch (NullPointerException success) {}
126		}
#	Line 120 | Line 131 | public class PriorityBlockingQueueTest e
131		public void testConstructor6() {
132		Integer[] ints = new Integer[SIZE];
133		for (int i = 0; i < SIZE; ++i)
134	<	ints[i] = new Integer(i);
134	>	ints[i] = i;
135		PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
136		for (int i = 0; i < SIZE; ++i)
137		assertEquals(ints[i], q.poll());
#	Line 137 | Line 148 | public class PriorityBlockingQueueTest e
148		for (int i = 0; i < SIZE; ++i)
149		ints[i] = new Integer(i);
150		q.addAll(Arrays.asList(ints));
151	<	for (int i = SIZE-1; i >= 0; --i)
151	>	for (int i = SIZE - 1; i >= 0; --i)
152		assertEquals(ints[i], q.poll());
153		}
154
#	Line 147 | Line 158 | public class PriorityBlockingQueueTest e
158		public void testEmpty() {
159		PriorityBlockingQueue q = new PriorityBlockingQueue(2);
160		assertTrue(q.isEmpty());
161	<	assertEquals(NOCAP, q.remainingCapacity());
161	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
162		q.add(one);
163		assertFalse(q.isEmpty());
164		q.add(two);
#	Line 157 | Line 168 | public class PriorityBlockingQueueTest e
168		}
169
170		/**
171	<	* remainingCapacity does not change when elements added or removed,
161	<	* but size does
171	>	* remainingCapacity() always returns Integer.MAX_VALUE
172		*/
173		public void testRemainingCapacity() {
174	<	PriorityBlockingQueue q = populatedQueue(SIZE);
174	>	BlockingQueue q = populatedQueue(SIZE);
175		for (int i = 0; i < SIZE; ++i) {
176	<	assertEquals(NOCAP, q.remainingCapacity());
177	<	assertEquals(SIZE-i, q.size());
178	<	q.remove();
176	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
177	>	assertEquals(SIZE - i, q.size());
178	>	assertEquals(i, q.remove());
179		}
180		for (int i = 0; i < SIZE; ++i) {
181	<	assertEquals(NOCAP, q.remainingCapacity());
181	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
182		assertEquals(i, q.size());
183	<	q.add(new Integer(i));
183	>	assertTrue(q.add(i));
184		}
185		}
186
187		/**
178	–	* offer(null) throws NPE
179	–	*/
180	–	public void testOfferNull() {
181	–	try {
182	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
183	–	q.offer(null);
184	–	shouldThrow();
185	–	} catch (NullPointerException success) {}
186	–	}
187	–
188	–	/**
189	–	* add(null) throws NPE
190	–	*/
191	–	public void testAddNull() {
192	–	try {
193	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
194	–	q.add(null);
195	–	shouldThrow();
196	–	} catch (NullPointerException success) {}
197	–	}
198	–
199	–	/**
188		* Offer of comparable element succeeds
189		*/
190		public void testOffer() {
#	Line 209 | Line 197 | public class PriorityBlockingQueueTest e
197		* Offer of non-Comparable throws CCE
198		*/
199		public void testOfferNonComparable() {
200	+	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
201		try {
213	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
214	–	q.offer(new Object());
202		q.offer(new Object());
203		q.offer(new Object());
204		shouldThrow();
#	Line 230 | Line 217 | public class PriorityBlockingQueueTest e
217		}
218
219		/**
233	–	* addAll(null) throws NPE
234	–	*/
235	–	public void testAddAll1() {
236	–	try {
237	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
238	–	q.addAll(null);
239	–	shouldThrow();
240	–	} catch (NullPointerException success) {}
241	–	}
242	–
243	–	/**
220		* addAll(this) throws IAE
221		*/
222		public void testAddAllSelf() {
223	+	PriorityBlockingQueue q = populatedQueue(SIZE);
224		try {
248	–	PriorityBlockingQueue q = populatedQueue(SIZE);
225		q.addAll(q);
226		shouldThrow();
227		} catch (IllegalArgumentException success) {}
228		}
229
230		/**
255	–	* addAll of a collection with null elements throws NPE
256	–	*/
257	–	public void testAddAll2() {
258	–	try {
259	–	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
260	–	Integer[] ints = new Integer[SIZE];
261	–	q.addAll(Arrays.asList(ints));
262	–	shouldThrow();
263	–	} catch (NullPointerException success) {}
264	–	}
265	–
266	–	/**
231		* addAll of a collection with any null elements throws NPE after
232		* possibly adding some elements
233		*/
234		public void testAddAll3() {
235	+	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
236	+	Integer[] ints = new Integer[SIZE];
237	+	for (int i = 0; i < SIZE - 1; ++i)
238	+	ints[i] = new Integer(i);
239		try {
272	–	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
273	–	Integer[] ints = new Integer[SIZE];
274	–	for (int i = 0; i < SIZE-1; ++i)
275	–	ints[i] = new Integer(i);
240		q.addAll(Arrays.asList(ints));
241		shouldThrow();
242		} catch (NullPointerException success) {}
#	Line 284 | Line 248 | public class PriorityBlockingQueueTest e
248		public void testAddAll5() {
249		Integer[] empty = new Integer[0];
250		Integer[] ints = new Integer[SIZE];
251	<	for (int i = SIZE-1; i >= 0; --i)
251	>	for (int i = SIZE - 1; i >= 0; --i)
252		ints[i] = new Integer(i);
253		PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
254		assertFalse(q.addAll(Arrays.asList(empty)));
#	Line 294 | Line 258 | public class PriorityBlockingQueueTest e
258		}
259
260		/**
297	–	* put(null) throws NPE
298	–	*/
299	–	public void testPutNull() {
300	–	try {
301	–	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
302	–	q.put(null);
303	–	shouldThrow();
304	–	} catch (NullPointerException success) {}
305	–	}
306	–
307	–	/**
261		* all elements successfully put are contained
262		*/
263		public void testPut() {
264		PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
265		for (int i = 0; i < SIZE; ++i) {
266	<	Integer I = new Integer(i);
267	<	q.put(I);
268	<	assertTrue(q.contains(I));
266	>	Integer x = new Integer(i);
267	>	q.put(x);
268	>	assertTrue(q.contains(x));
269		}
270		assertEquals(SIZE, q.size());
271		}
#	Line 440 | Line 393 | public class PriorityBlockingQueueTest e
393		final CountDownLatch aboutToWait = new CountDownLatch(1);
394		Thread t = newStartedThread(new CheckedRunnable() {
395		public void realRun() throws InterruptedException {
396	+	long startTime = System.nanoTime();
397		for (int i = 0; i < SIZE; ++i) {
444	–	long t0 = System.nanoTime();
398		assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
446	–	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
399		}
448	–	long t0 = System.nanoTime();
400		aboutToWait.countDown();
401		try {
402		q.poll(LONG_DELAY_MS, MILLISECONDS);
403		shouldThrow();
404		} catch (InterruptedException success) {
405	<	assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
405	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
406		}
407		}});
408
409		aboutToWait.await();
410	<	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
410	>	waitForThreadToEnterWaitState(t, LONG_DELAY_MS);
411		t.interrupt();
412	<	awaitTermination(t, MEDIUM_DELAY_MS);
412	>	awaitTermination(t);
413		}
414
415		/**
#	Line 505 | Line 456 | public class PriorityBlockingQueueTest e
456		}
457
458		/**
508	–	* remove(x) removes x and returns true if present
509	–	*/
510	–	public void testRemoveElement() {
511	–	PriorityBlockingQueue q = populatedQueue(SIZE);
512	–	for (int i = 1; i < SIZE; i+=2) {
513	–	assertTrue(q.contains(i));
514	–	assertTrue(q.remove(i));
515	–	assertFalse(q.contains(i));
516	–	assertTrue(q.contains(i-1));
517	–	}
518	–	for (int i = 0; i < SIZE; i+=2) {
519	–	assertTrue(q.contains(i));
520	–	assertTrue(q.remove(i));
521	–	assertFalse(q.contains(i));
522	–	assertFalse(q.remove(i+1));
523	–	assertFalse(q.contains(i+1));
524	–	}
525	–	assertTrue(q.isEmpty());
526	–	}
527	–
528	–	/**
459		* contains(x) reports true when elements added but not yet removed
460		*/
461		public void testContains() {
#	Line 580 | Line 510 | public class PriorityBlockingQueueTest e
510		assertTrue(changed);
511
512		assertTrue(q.containsAll(p));
513	<	assertEquals(SIZE-i, q.size());
513	>	assertEquals(SIZE - i, q.size());
514		p.remove();
515		}
516		}
#	Line 593 | Line 523 | public class PriorityBlockingQueueTest e
523		PriorityBlockingQueue q = populatedQueue(SIZE);
524		PriorityBlockingQueue p = populatedQueue(i);
525		assertTrue(q.removeAll(p));
526	<	assertEquals(SIZE-i, q.size());
526	>	assertEquals(SIZE - i, q.size());
527		for (int j = 0; j < i; ++j) {
528	<	Integer I = (Integer)(p.remove());
529	<	assertFalse(q.contains(I));
528	>	Integer x = (Integer)(p.remove());
529	>	assertFalse(q.contains(x));
530		}
531		}
532		}
#	Line 626 | Line 556 | public class PriorityBlockingQueueTest e
556		}
557
558		/**
629	–	* toArray(null) throws NullPointerException
630	–	*/
631	–	public void testToArray_NullArg() {
632	–	PriorityBlockingQueue q = populatedQueue(SIZE);
633	–	try {
634	–	q.toArray(null);
635	–	shouldThrow();
636	–	} catch (NullPointerException success) {}
637	–	}
638	–
639	–	/**
559		* toArray(incompatible array type) throws ArrayStoreException
560		*/
561		public void testToArray1_BadArg() {
#	Line 652 | Line 571 | public class PriorityBlockingQueueTest e
571		*/
572		public void testIterator() {
573		PriorityBlockingQueue q = populatedQueue(SIZE);
655	–	int i = 0;
574		Iterator it = q.iterator();
575	<	while (it.hasNext()) {
575	>	int i;
576	>	for (i = 0; it.hasNext(); i++)
577		assertTrue(q.contains(it.next()));
659	–	++i;
660	–	}
578		assertEquals(i, SIZE);
579	+	assertIteratorExhausted(it);
580	+	}
581	+
582	+	/**
583	+	* iterator of empty collection has no elements
584	+	*/
585	+	public void testEmptyIterator() {
586	+	assertIteratorExhausted(new PriorityBlockingQueue().iterator());
587		}
588
589		/**
#	Line 697 | Line 622 | public class PriorityBlockingQueueTest e
622		public void testPollInExecutor() {
623		final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
624		final CheckedBarrier threadsStarted = new CheckedBarrier(2);
625	<	ExecutorService executor = Executors.newFixedThreadPool(2);
626	<	executor.execute(new CheckedRunnable() {
627	<	public void realRun() throws InterruptedException {
628	<	assertNull(q.poll());
629	<	threadsStarted.await();
630	<	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
631	<	checkEmpty(q);
632	<	}});
633	<
634	<	executor.execute(new CheckedRunnable() {
635	<	public void realRun() throws InterruptedException {
636	<	threadsStarted.await();
637	<	q.put(one);
638	<	}});
639	<
640	<	joinPool(executor);
625	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
626	>	try (PoolCleaner cleaner = cleaner(executor)) {
627	>	executor.execute(new CheckedRunnable() {
628	>	public void realRun() throws InterruptedException {
629	>	assertNull(q.poll());
630	>	threadsStarted.await();
631	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
632	>	checkEmpty(q);
633	>	}});
634	>
635	>	executor.execute(new CheckedRunnable() {
636	>	public void realRun() throws InterruptedException {
637	>	threadsStarted.await();
638	>	q.put(one);
639	>	}});
640	>	}
641		}
642
643		/**
644		* A deserialized serialized queue has same elements
645		*/
646		public void testSerialization() throws Exception {
647	<	PriorityBlockingQueue q = populatedQueue(SIZE);
648	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
724	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
725	<	out.writeObject(q);
726	<	out.close();
647	>	Queue x = populatedQueue(SIZE);
648	>	Queue y = serialClone(x);
649
650	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
651	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
652	<	PriorityBlockingQueue r = (PriorityBlockingQueue)in.readObject();
653	<	assertEquals(q.size(), r.size());
654	<	while (!q.isEmpty())
655	<	assertEquals(q.remove(), r.remove());
656	<	}
735	<
736	<	/**
737	<	* drainTo(null) throws NPE
738	<	*/
739	<	public void testDrainToNull() {
740	<	PriorityBlockingQueue q = populatedQueue(SIZE);
741	<	try {
742	<	q.drainTo(null);
743	<	shouldThrow();
744	<	} catch (NullPointerException success) {}
745	<	}
746	<
747	<	/**
748	<	* drainTo(this) throws IAE
749	<	*/
750	<	public void testDrainToSelf() {
751	<	PriorityBlockingQueue q = populatedQueue(SIZE);
752	<	try {
753	<	q.drainTo(q);
754	<	shouldThrow();
755	<	} catch (IllegalArgumentException success) {}
650	>	assertNotSame(x, y);
651	>	assertEquals(x.size(), y.size());
652	>	while (!x.isEmpty()) {
653	>	assertFalse(y.isEmpty());
654	>	assertEquals(x.remove(), y.remove());
655	>	}
656	>	assertTrue(y.isEmpty());
657		}
658
659		/**
#	Line 762 | Line 663 | public class PriorityBlockingQueueTest e
663		PriorityBlockingQueue q = populatedQueue(SIZE);
664		ArrayList l = new ArrayList();
665		q.drainTo(l);
666	<	assertEquals(q.size(), 0);
667	<	assertEquals(l.size(), SIZE);
666	>	assertEquals(0, q.size());
667	>	assertEquals(SIZE, l.size());
668		for (int i = 0; i < SIZE; ++i)
669		assertEquals(l.get(i), new Integer(i));
670		q.add(zero);
#	Line 773 | Line 674 | public class PriorityBlockingQueueTest e
674		assertTrue(q.contains(one));
675		l.clear();
676		q.drainTo(l);
677	<	assertEquals(q.size(), 0);
678	<	assertEquals(l.size(), 2);
677	>	assertEquals(0, q.size());
678	>	assertEquals(2, l.size());
679		for (int i = 0; i < 2; ++i)
680		assertEquals(l.get(i), new Integer(i));
681		}
#	Line 786 | Line 687 | public class PriorityBlockingQueueTest e
687		final PriorityBlockingQueue q = populatedQueue(SIZE);
688		Thread t = new Thread(new CheckedRunnable() {
689		public void realRun() {
690	<	q.put(new Integer(SIZE+1));
690	>	q.put(new Integer(SIZE + 1));
691		}});
692
693		t.start();
#	Line 800 | Line 701 | public class PriorityBlockingQueueTest e
701		}
702
703		/**
803	–	* drainTo(null, n) throws NPE
804	–	*/
805	–	public void testDrainToNullN() {
806	–	PriorityBlockingQueue q = populatedQueue(SIZE);
807	–	try {
808	–	q.drainTo(null, 0);
809	–	shouldThrow();
810	–	} catch (NullPointerException success) {}
811	–	}
812	–
813	–	/**
814	–	* drainTo(this, n) throws IAE
815	–	*/
816	–	public void testDrainToSelfN() {
817	–	PriorityBlockingQueue q = populatedQueue(SIZE);
818	–	try {
819	–	q.drainTo(q, 0);
820	–	shouldThrow();
821	–	} catch (IllegalArgumentException success) {}
822	–	}
823	–
824	–	/**
704		* drainTo(c, n) empties first min(n, size) elements of queue into c
705		*/
706		public void testDrainToN() {
707	<	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2);
707	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE * 2);
708		for (int i = 0; i < SIZE + 2; ++i) {
709		for (int j = 0; j < SIZE; j++)
710		assertTrue(q.offer(new Integer(j)));
711		ArrayList l = new ArrayList();
712		q.drainTo(l, i);
713		int k = (i < SIZE) ? i : SIZE;
714	<	assertEquals(l.size(), k);
715	<	assertEquals(q.size(), SIZE-k);
714	>	assertEquals(k, l.size());
715	>	assertEquals(SIZE - k, q.size());
716		for (int j = 0; j < k; ++j)
717		assertEquals(l.get(j), new Integer(j));
718	<	while (q.poll() != null) ;
718	>	do {} while (q.poll() != null);
719	>	}
720	>	}
721	>
722	>	/**
723	>	* remove(null), contains(null) always return false
724	>	*/
725	>	public void testNeverContainsNull() {
726	>	Collection<?>[] qs = {
727	>	new PriorityBlockingQueue<Object>(),
728	>	populatedQueue(2),
729	>	};
730	>
731	>	for (Collection<?> q : qs) {
732	>	assertFalse(q.contains(null));
733	>	assertFalse(q.remove(null));
734		}
735		}
736

Diff Legend

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