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.2 by dl, Sun Sep 7 20:39:11 2003 UTC vs.
Revision 1.70 by jsr166, Tue Nov 22 16:48:36 2016 UTC

#	Line 1 | Line 1
1		/*
2	<	* Written by members of JCP JSR-166 Expert Group and released to the
3	<	* public domain. Use, modify, and redistribute this code in any way
4	<	* without acknowledgement. Other contributors include Andrew Wright,
5	<	* Jeffrey Hayes, Pat Fischer, Mike Judd.
2	>	* Written by Doug Lea with assistance from members of JCP JSR-166
3	>	* Expert Group and released to the public domain, as explained at
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5	>	* Other contributors include Andrew Wright, Jeffrey Hayes,
6	>	* Pat Fisher, Mike Judd.
7		*/
8
9	<	import junit.framework.*;
10	<	import java.util.*;
11	<	import java.util.concurrent.*;
12	<	import java.io.*;
13	<
14	<	public class PriorityBlockingQueueTest extends TestCase {
15	<
16	<	private static final int N = 10;
17	<	private static final long SHORT_DELAY_MS = 100;
18	<	private static final long MEDIUM_DELAY_MS = 1000;
19	<	private static final long LONG_DELAY_MS = 10000;
20	<	private static final int NOCAP = Integer.MAX_VALUE;
9	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
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	>
28	>	public static class Generic extends BlockingQueueTest {
29	>	protected BlockingQueue emptyCollection() {
30	>	return new PriorityBlockingQueue();
31	>	}
32	>	}
33	>
34	>	public static class InitialCapacity extends BlockingQueueTest {
35	>	protected BlockingQueue emptyCollection() {
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() {
45	<	return new TestSuite(PriorityBlockingQueueTest.class);
45	>	class Implementation implements CollectionImplementation {
46	>	public Class<?> klazz() { return PriorityBlockingQueue.class; }
47	>	public Collection emptyCollection() { return new PriorityBlockingQueue(); }
48	>	public Object makeElement(int i) { return i; }
49	>	public boolean isConcurrent() { return true; }
50	>	public boolean permitsNulls() { return false; }
51	>	}
52	>	return newTestSuite(PriorityBlockingQueueTest.class,
53	>	new Generic().testSuite(),
54	>	new InitialCapacity().testSuite(),
55	>	CollectionTest.testSuite(new Implementation()));
56		}
57
58	<	static class MyReverseComparator implements Comparator {
58	>	/** Sample Comparator */
59	>	static class MyReverseComparator implements Comparator {
60		public int compare(Object x, Object y) {
61	<	int i = ((Integer)x).intValue();
32	<	int j = ((Integer)y).intValue();
33	<	if (i < j) return 1;
34	<	if (i > j) return -1;
35	<	return 0;
61	>	return ((Comparable)y).compareTo(x);
62		}
63		}
64
39	–
65		/**
66	<	* Create a queue of given size containing consecutive
67	<	* Integers 0 ... n.
66	>	* Returns a new queue of given size containing consecutive
67	>	* Integers 0 ... n - 1.
68		*/
69	<	private PriorityBlockingQueue fullQueue(int n) {
70	<	PriorityBlockingQueue q = new PriorityBlockingQueue(n);
69	>	private PriorityBlockingQueue<Integer> populatedQueue(int n) {
70	>	PriorityBlockingQueue<Integer> q =
71	>	new PriorityBlockingQueue<Integer>(n);
72		assertTrue(q.isEmpty());
73	<	for(int i = n-1; i >= 0; i-=2)
74	<	assertTrue(q.offer(new Integer(i)));
75	<	for(int i = (n & 1); i < n; i+=2)
76	<	assertTrue(q.offer(new Integer(i)));
73	>	for (int i = n - 1; i >= 0; i -= 2)
74	>	assertTrue(q.offer(new Integer(i)));
75	>	for (int i = (n & 1); i < n; i += 2)
76	>	assertTrue(q.offer(new Integer(i)));
77		assertFalse(q.isEmpty());
78	<	assertEquals(NOCAP, q.remainingCapacity());
79	<	assertEquals(n, q.size());
78	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
79	>	assertEquals(n, q.size());
80	>	assertEquals((Integer) 0, q.peek());
81		return q;
82		}
83	<
84	<	public void testConstructor1(){
85	<	assertEquals(NOCAP, new PriorityBlockingQueue(N).remainingCapacity());
83	>
84	>	/**
85	>	* A new queue has unbounded capacity
86	>	*/
87	>	public void testConstructor1() {
88	>	assertEquals(Integer.MAX_VALUE,
89	>	new PriorityBlockingQueue(SIZE).remainingCapacity());
90		}
91
92	<	public void testConstructor2(){
92	>	/**
93	>	* Constructor throws IAE if capacity argument nonpositive
94	>	*/
95	>	public void testConstructor2() {
96		try {
97	<	PriorityBlockingQueue q = new PriorityBlockingQueue(0);
98	<	fail("Cannot make zero-sized");
99	<	}
66	<	catch (IllegalArgumentException success) {}
97	>	new PriorityBlockingQueue(0);
98	>	shouldThrow();
99	>	} catch (IllegalArgumentException success) {}
100		}
101
102	<	public void testConstructor3(){
103	<
102	>	/**
103	>	* Initializing from null Collection throws NPE
104	>	*/
105	>	public void testConstructor3() {
106		try {
107	<	PriorityBlockingQueue q = new PriorityBlockingQueue(null);
108	<	fail("Cannot make from null collection");
109	<	}
75	<	catch (NullPointerException success) {}
107	>	new PriorityBlockingQueue(null);
108	>	shouldThrow();
109	>	} catch (NullPointerException success) {}
110		}
111
112	<	public void testConstructor4(){
112	>	/**
113	>	* Initializing from Collection of null elements throws NPE
114	>	*/
115	>	public void testConstructor4() {
116	>	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
117		try {
118	<	Integer[] ints = new Integer[N];
119	<	PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
120	<	fail("Cannot make with null elements");
83	<	}
84	<	catch (NullPointerException success) {}
118	>	new PriorityBlockingQueue(elements);
119	>	shouldThrow();
120	>	} catch (NullPointerException success) {}
121		}
122
123	<	public void testConstructor5(){
124	<	try {
125	<	Integer[] ints = new Integer[N];
126	<	for (int i = 0; i < N-1; ++i)
127	<	ints[i] = new Integer(i);
128	<	PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
129	<	fail("Cannot make with null elements");
130	<	}
131	<	catch (NullPointerException success) {}
123	>	/**
124	>	* Initializing from Collection with some null elements throws NPE
125	>	*/
126	>	public void testConstructor5() {
127	>	Integer[] ints = new Integer[SIZE];
128	>	for (int i = 0; i < SIZE - 1; ++i)
129	>	ints[i] = i;
130	>	Collection<Integer> elements = Arrays.asList(ints);
131	>	try {
132	>	new PriorityBlockingQueue(elements);
133	>	shouldThrow();
134	>	} catch (NullPointerException success) {}
135		}
136
137	<	public void testConstructor6(){
138	<	try {
139	<	Integer[] ints = new Integer[N];
140	<	for (int i = 0; i < N; ++i)
141	<	ints[i] = new Integer(i);
142	<	PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
143	<	for (int i = 0; i < N; ++i)
144	<	assertEquals(ints[i], q.poll());
145	<	}
146	<	finally {}
137	>	/**
138	>	* Queue contains all elements of collection used to initialize
139	>	*/
140	>	public void testConstructor6() {
141	>	Integer[] ints = new Integer[SIZE];
142	>	for (int i = 0; i < SIZE; ++i)
143	>	ints[i] = i;
144	>	PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints));
145	>	for (int i = 0; i < SIZE; ++i)
146	>	assertEquals(ints[i], q.poll());
147		}
148
149	<	public void testConstructor7(){
150	<	try {
151	<	PriorityBlockingQueue q = new PriorityBlockingQueue(N, new MyReverseComparator());
152	<	Integer[] ints = new Integer[N];
153	<	for (int i = 0; i < N; ++i)
154	<	ints[i] = new Integer(i);
155	<	q.addAll(Arrays.asList(ints));
156	<	for (int i = N-1; i >= 0; --i)
157	<	assertEquals(ints[i], q.poll());
158	<	}
159	<	finally {}
149	>	/**
150	>	* The comparator used in constructor is used
151	>	*/
152	>	public void testConstructor7() {
153	>	MyReverseComparator cmp = new MyReverseComparator();
154	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp);
155	>	assertEquals(cmp, q.comparator());
156	>	Integer[] ints = new Integer[SIZE];
157	>	for (int i = 0; i < SIZE; ++i)
158	>	ints[i] = new Integer(i);
159	>	q.addAll(Arrays.asList(ints));
160	>	for (int i = SIZE - 1; i >= 0; --i)
161	>	assertEquals(ints[i], q.poll());
162		}
163
164	+	/**
165	+	* isEmpty is true before add, false after
166	+	*/
167		public void testEmpty() {
168		PriorityBlockingQueue q = new PriorityBlockingQueue(2);
169		assertTrue(q.isEmpty());
170	<	assertEquals(NOCAP, q.remainingCapacity());
171	<	q.add(new Integer(1));
170	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
171	>	q.add(one);
172		assertFalse(q.isEmpty());
173	<	q.add(new Integer(2));
173	>	q.add(two);
174		q.remove();
175		q.remove();
176		assertTrue(q.isEmpty());
177		}
178
179	<	public void testRemainingCapacity(){
180	<	PriorityBlockingQueue q = fullQueue(N);
181	<	for (int i = 0; i < N; ++i) {
182	<	assertEquals(NOCAP, q.remainingCapacity());
183	<	assertEquals(N-i, q.size());
184	<	q.remove();
179	>	/**
180	>	* remainingCapacity() always returns Integer.MAX_VALUE
181	>	*/
182	>	public void testRemainingCapacity() {
183	>	BlockingQueue q = populatedQueue(SIZE);
184	>	for (int i = 0; i < SIZE; ++i) {
185	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
186	>	assertEquals(SIZE - i, q.size());
187	>	assertEquals(i, q.remove());
188		}
189	<	for (int i = 0; i < N; ++i) {
190	<	assertEquals(NOCAP, q.remainingCapacity());
189	>	for (int i = 0; i < SIZE; ++i) {
190	>	assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
191		assertEquals(i, q.size());
192	<	q.add(new Integer(i));
192	>	assertTrue(q.add(i));
193		}
194		}
195
196	<	public void testOfferNull(){
197	<	try {
198	<	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
152	<	q.offer(null);
153	<	fail("should throw NPE");
154	<	} catch (NullPointerException success) { }
155	<	}
156	<
196	>	/**
197	>	* Offer of comparable element succeeds
198	>	*/
199		public void testOffer() {
200		PriorityBlockingQueue q = new PriorityBlockingQueue(1);
201	<	assertTrue(q.offer(new Integer(0)));
202	<	assertTrue(q.offer(new Integer(1)));
201	>	assertTrue(q.offer(zero));
202	>	assertTrue(q.offer(one));
203		}
204
205	+	/**
206	+	* Offer of non-Comparable throws CCE
207	+	*/
208		public void testOfferNonComparable() {
209	+	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
210		try {
165	–	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
166	–	q.offer(new Object());
211		q.offer(new Object());
212	<	q.offer(new Object());
213	<	fail("should throw CCE");
212	>	shouldThrow();
213	>	} catch (ClassCastException success) {
214	>	assertTrue(q.isEmpty());
215	>	assertEquals(0, q.size());
216	>	assertNull(q.poll());
217		}
171	–	catch(ClassCastException success) {}
218		}
219
220	<	public void testAdd(){
221	<	PriorityBlockingQueue q = new PriorityBlockingQueue(N);
222	<	for (int i = 0; i < N; ++i) {
220	>	/**
221	>	* add of comparable succeeds
222	>	*/
223	>	public void testAdd() {
224	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
225	>	for (int i = 0; i < SIZE; ++i) {
226		assertEquals(i, q.size());
227		assertTrue(q.add(new Integer(i)));
228		}
229		}
230
231	<	public void testAddAll1(){
231	>	/**
232	>	* addAll(this) throws IAE
233	>	*/
234	>	public void testAddAllSelf() {
235	>	PriorityBlockingQueue q = populatedQueue(SIZE);
236		try {
237	<	PriorityBlockingQueue q = new PriorityBlockingQueue(1);
238	<	q.addAll(null);
239	<	fail("Cannot add null collection");
187	<	}
188	<	catch (NullPointerException success) {}
237	>	q.addAll(q);
238	>	shouldThrow();
239	>	} catch (IllegalArgumentException success) {}
240		}
241	<	public void testAddAll2(){
241	>
242	>	/**
243	>	* addAll of a collection with any null elements throws NPE after
244	>	* possibly adding some elements
245	>	*/
246	>	public void testAddAll3() {
247	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
248	>	Integer[] ints = new Integer[SIZE];
249	>	for (int i = 0; i < SIZE - 1; ++i)
250	>	ints[i] = new Integer(i);
251		try {
192	–	PriorityBlockingQueue q = new PriorityBlockingQueue(N);
193	–	Integer[] ints = new Integer[N];
252		q.addAll(Arrays.asList(ints));
253	<	fail("Cannot add null elements");
254	<	}
197	<	catch (NullPointerException success) {}
253	>	shouldThrow();
254	>	} catch (NullPointerException success) {}
255		}
256	<	public void testAddAll3(){
257	<	try {
258	<	PriorityBlockingQueue q = new PriorityBlockingQueue(N);
259	<	Integer[] ints = new Integer[N];
260	<	for (int i = 0; i < N-1; ++i)
261	<	ints[i] = new Integer(i);
262	<	q.addAll(Arrays.asList(ints));
263	<	fail("Cannot add null elements");
264	<	}
265	<	catch (NullPointerException success) {}
256	>
257	>	/**
258	>	* Queue contains all elements of successful addAll
259	>	*/
260	>	public void testAddAll5() {
261	>	Integer[] empty = new Integer[0];
262	>	Integer[] ints = new Integer[SIZE];
263	>	for (int i = SIZE - 1; i >= 0; --i)
264	>	ints[i] = new Integer(i);
265	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
266	>	assertFalse(q.addAll(Arrays.asList(empty)));
267	>	assertTrue(q.addAll(Arrays.asList(ints)));
268	>	for (int i = 0; i < SIZE; ++i)
269	>	assertEquals(ints[i], q.poll());
270		}
271
272	<	public void testAddAll5(){
273	<	try {
274	<	Integer[] empty = new Integer[0];
275	<	Integer[] ints = new Integer[N];
276	<	for (int i = N-1; i >= 0; --i)
277	<	ints[i] = new Integer(i);
278	<	PriorityBlockingQueue q = new PriorityBlockingQueue(N);
279	<	assertFalse(q.addAll(Arrays.asList(empty)));
280	<	assertTrue(q.addAll(Arrays.asList(ints)));
220	<	for (int i = 0; i < N; ++i)
221	<	assertEquals(ints[i], q.poll());
222	<	}
223	<	finally {}
224	<	}
225	<
226	<	public void testPutNull() {
227	<	try {
228	<	PriorityBlockingQueue q = new PriorityBlockingQueue(N);
229	<	q.put(null);
230	<	fail("put should throw NPE");
231	<	}
232	<	catch (NullPointerException success){
233	<	}
234	<	}
235	<
236	<	public void testPut() {
237	<	try {
238	<	PriorityBlockingQueue q = new PriorityBlockingQueue(N);
239	<	for (int i = 0; i < N; ++i) {
240	<	Integer I = new Integer(i);
241	<	q.put(I);
242	<	assertTrue(q.contains(I));
243	<	}
244	<	assertEquals(N, q.size());
245	<	}
246	<	finally {
272	>	/**
273	>	* all elements successfully put are contained
274	>	*/
275	>	public void testPut() {
276	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE);
277	>	for (int i = 0; i < SIZE; ++i) {
278	>	Integer x = new Integer(i);
279	>	q.put(x);
280	>	assertTrue(q.contains(x));
281		}
282	+	assertEquals(SIZE, q.size());
283		}
284
285	<	public void testPutWithTake() {
285	>	/**
286	>	* put doesn't block waiting for take
287	>	*/
288	>	public void testPutWithTake() throws InterruptedException {
289		final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
290	<	Thread t = new Thread(new Runnable() {
291	<	public void run(){
292	<	int added = 0;
293	<	try {
294	<	q.put(new Integer(0));
295	<	++added;
296	<	q.put(new Integer(0));
297	<	++added;
298	<	q.put(new Integer(0));
299	<	++added;
262	<	q.put(new Integer(0));
263	<	++added;
264	<	assertTrue(added == 4);
265	<	} finally {
266	<	}
267	<	}
268	<	});
269	<	try {
270	<	t.start();
271	<	Thread.sleep(SHORT_DELAY_MS);
272	<	q.take();
273	<	t.interrupt();
274	<	t.join();
275	<	} catch (Exception e){
276	<	fail("Unexpected exception");
277	<	}
290	>	final int size = 4;
291	>	Thread t = newStartedThread(new CheckedRunnable() {
292	>	public void realRun() {
293	>	for (int i = 0; i < size; i++)
294	>	q.put(new Integer(0));
295	>	}});
296	>
297	>	awaitTermination(t);
298	>	assertEquals(size, q.size());
299	>	q.take();
300		}
301
302	<	public void testTimedOffer() {
302	>	/**
303	>	* timed offer does not time out
304	>	*/
305	>	public void testTimedOffer() throws InterruptedException {
306		final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
307	<	Thread t = new Thread(new Runnable() {
308	<	public void run(){
309	<	try {
310	<	q.put(new Integer(0));
311	<	q.put(new Integer(0));
312	<	assertTrue(q.offer(new Integer(0), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
313	<	assertTrue(q.offer(new Integer(0), LONG_DELAY_MS, TimeUnit.MILLISECONDS));
289	<	} finally { }
290	<	}
291	<	});
292	<
293	<	try {
294	<	t.start();
295	<	Thread.sleep(SHORT_DELAY_MS);
296	<	t.interrupt();
297	<	t.join();
298	<	} catch (Exception e){
299	<	fail("Unexpected exception");
300	<	}
301	<	}
307	>	Thread t = newStartedThread(new CheckedRunnable() {
308	>	public void realRun() {
309	>	q.put(new Integer(0));
310	>	q.put(new Integer(0));
311	>	assertTrue(q.offer(new Integer(0), SHORT_DELAY_MS, MILLISECONDS));
312	>	assertTrue(q.offer(new Integer(0), LONG_DELAY_MS, MILLISECONDS));
313	>	}});
314
315	<	public void testTake(){
304	<	try {
305	<	PriorityBlockingQueue q = fullQueue(N);
306	<	for (int i = 0; i < N; ++i) {
307	<	assertEquals(i, ((Integer)q.take()).intValue());
308	<	}
309	<	} catch (InterruptedException e){
310	<	fail("Unexpected exception");
311	<	}
315	>	awaitTermination(t);
316		}
317
318	<	public void testTakeFromEmpty() {
319	<	final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
320	<	Thread t = new Thread(new Runnable() {
321	<	public void run(){
322	<	try {
323	<	q.take();
324	<	fail("Should block");
321	<	} catch (InterruptedException success){ }
322	<	}
323	<	});
324	<	try {
325	<	t.start();
326	<	Thread.sleep(SHORT_DELAY_MS);
327	<	t.interrupt();
328	<	t.join();
329	<	} catch (Exception e){
330	<	fail("Unexpected exception");
318	>	/**
319	>	* take retrieves elements in priority order
320	>	*/
321	>	public void testTake() throws InterruptedException {
322	>	PriorityBlockingQueue q = populatedQueue(SIZE);
323	>	for (int i = 0; i < SIZE; ++i) {
324	>	assertEquals(i, q.take());
325		}
326		}
327
328	<	public void testBlockingTake(){
329	<	Thread t = new Thread(new Runnable() {
330	<	public void run() {
331	<	try {
332	<	PriorityBlockingQueue q = fullQueue(N);
333	<	for (int i = 0; i < N; ++i) {
334	<	assertEquals(i, ((Integer)q.take()).intValue());
335	<	}
336	<	q.take();
337	<	fail("take should block");
338	<	} catch (InterruptedException success){
345	<	}
346	<	}});
347	<	t.start();
348	<	try {
349	<	Thread.sleep(SHORT_DELAY_MS);
350	<	t.interrupt();
351	<	t.join();
352	<	}
353	<	catch (InterruptedException ie) {
354	<	fail("Unexpected exception");
355	<	}
356	<	}
328	>	/**
329	>	* Take removes existing elements until empty, then blocks interruptibly
330	>	*/
331	>	public void testBlockingTake() throws InterruptedException {
332	>	final PriorityBlockingQueue q = populatedQueue(SIZE);
333	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
334	>	Thread t = newStartedThread(new CheckedRunnable() {
335	>	public void realRun() throws InterruptedException {
336	>	for (int i = 0; i < SIZE; ++i) {
337	>	assertEquals(i, q.take());
338	>	}
339
340	+	Thread.currentThread().interrupt();
341	+	try {
342	+	q.take();
343	+	shouldThrow();
344	+	} catch (InterruptedException success) {}
345	+	assertFalse(Thread.interrupted());
346
347	<	public void testPoll(){
348	<	PriorityBlockingQueue q = fullQueue(N);
349	<	for (int i = 0; i < N; ++i) {
350	<	assertEquals(i, ((Integer)q.poll()).intValue());
351	<	}
352	<	assertNull(q.poll());
347	>	pleaseInterrupt.countDown();
348	>	try {
349	>	q.take();
350	>	shouldThrow();
351	>	} catch (InterruptedException success) {}
352	>	assertFalse(Thread.interrupted());
353	>	}});
354	>
355	>	await(pleaseInterrupt);
356	>	assertThreadStaysAlive(t);
357	>	t.interrupt();
358	>	awaitTermination(t);
359		}
360
361	<	public void testTimedPoll0() {
362	<	try {
363	<	PriorityBlockingQueue q = fullQueue(N);
364	<	for (int i = 0; i < N; ++i) {
365	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
366	<	}
367	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
368	<	} catch (InterruptedException e){
369	<	fail("Unexpected exception");
376	<	}
361	>	/**
362	>	* poll succeeds unless empty
363	>	*/
364	>	public void testPoll() {
365	>	PriorityBlockingQueue q = populatedQueue(SIZE);
366	>	for (int i = 0; i < SIZE; ++i) {
367	>	assertEquals(i, q.poll());
368	>	}
369	>	assertNull(q.poll());
370		}
371
372	<	public void testTimedPoll() {
373	<	try {
374	<	PriorityBlockingQueue q = fullQueue(N);
375	<	for (int i = 0; i < N; ++i) {
376	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
377	<	}
378	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
386	<	} catch (InterruptedException e){
387	<	fail("Unexpected exception");
388	<	}
389	<	}
390	<
391	<	public void testInterruptedTimedPoll(){
392	<	Thread t = new Thread(new Runnable() {
393	<	public void run() {
394	<	try {
395	<	PriorityBlockingQueue q = fullQueue(N);
396	<	for (int i = 0; i < N; ++i) {
397	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
398	<	}
399	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
400	<	} catch (InterruptedException success){
401	<	}
402	<	}});
403	<	t.start();
404	<	try {
405	<	Thread.sleep(SHORT_DELAY_MS);
406	<	t.interrupt();
407	<	t.join();
408	<	}
409	<	catch (InterruptedException ie) {
410	<	fail("Unexpected exception");
372	>	/**
373	>	* timed poll with zero timeout succeeds when non-empty, else times out
374	>	*/
375	>	public void testTimedPoll0() throws InterruptedException {
376	>	PriorityBlockingQueue q = populatedQueue(SIZE);
377	>	for (int i = 0; i < SIZE; ++i) {
378	>	assertEquals(i, q.poll(0, MILLISECONDS));
379		}
380	+	assertNull(q.poll(0, MILLISECONDS));
381		}
382
383	<	public void testTimedPollWithOffer(){
384	<	final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
385	<	Thread t = new Thread(new Runnable() {
386	<	public void run(){
387	<	try {
388	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
389	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
390	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
391	<	fail("Should block");
392	<	} catch (InterruptedException success) { }
383	>	/**
384	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
385	>	*/
386	>	public void testTimedPoll() throws InterruptedException {
387	>	PriorityBlockingQueue<Integer> q = populatedQueue(SIZE);
388	>	for (int i = 0; i < SIZE; ++i) {
389	>	long startTime = System.nanoTime();
390	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
391	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
392	>	}
393	>	long startTime = System.nanoTime();
394	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
395	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
396	>	checkEmpty(q);
397	>	}
398	>
399	>	/**
400	>	* Interrupted timed poll throws InterruptedException instead of
401	>	* returning timeout status
402	>	*/
403	>	public void testInterruptedTimedPoll() throws InterruptedException {
404	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
405	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
406	>	Thread t = newStartedThread(new CheckedRunnable() {
407	>	public void realRun() throws InterruptedException {
408	>	long startTime = System.nanoTime();
409	>	for (int i = 0; i < SIZE; ++i) {
410	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
411		}
412	<	});
413	<	try {
414	<	t.start();
415	<	Thread.sleep(SHORT_DELAY_MS * 2);
416	<	assertTrue(q.offer(new Integer(0), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
417	<	t.interrupt();
418	<	t.join();
419	<	} catch (Exception e){
433	<	fail("Unexpected exception");
434	<	}
435	<	}
412	>	aboutToWait.countDown();
413	>	try {
414	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
415	>	shouldThrow();
416	>	} catch (InterruptedException success) {
417	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
418	>	}
419	>	}});
420
421	+	aboutToWait.await();
422	+	waitForThreadToEnterWaitState(t);
423	+	t.interrupt();
424	+	awaitTermination(t);
425	+	}
426
427	<	public void testPeek(){
428	<	PriorityBlockingQueue q = fullQueue(N);
429	<	for (int i = 0; i < N; ++i) {
430	<	assertEquals(i, ((Integer)q.peek()).intValue());
431	<	q.poll();
427	>	/**
428	>	* peek returns next element, or null if empty
429	>	*/
430	>	public void testPeek() {
431	>	PriorityBlockingQueue q = populatedQueue(SIZE);
432	>	for (int i = 0; i < SIZE; ++i) {
433	>	assertEquals(i, q.peek());
434	>	assertEquals(i, q.poll());
435		assertTrue(q.peek() == null ||
436	<	i != ((Integer)q.peek()).intValue());
436	>	!q.peek().equals(i));
437		}
438	<	assertNull(q.peek());
438	>	assertNull(q.peek());
439		}
440
441	<	public void testElement(){
442	<	PriorityBlockingQueue q = fullQueue(N);
443	<	for (int i = 0; i < N; ++i) {
444	<	assertEquals(i, ((Integer)q.element()).intValue());
445	<	q.poll();
441	>	/**
442	>	* element returns next element, or throws NSEE if empty
443	>	*/
444	>	public void testElement() {
445	>	PriorityBlockingQueue q = populatedQueue(SIZE);
446	>	for (int i = 0; i < SIZE; ++i) {
447	>	assertEquals(i, q.element());
448	>	assertEquals(i, q.poll());
449		}
450		try {
451		q.element();
452	<	fail("no such element");
453	<	}
459	<	catch (NoSuchElementException success) {}
452	>	shouldThrow();
453	>	} catch (NoSuchElementException success) {}
454		}
455
456	<	public void testRemove(){
457	<	PriorityBlockingQueue q = fullQueue(N);
458	<	for (int i = 0; i < N; ++i) {
459	<	assertEquals(i, ((Integer)q.remove()).intValue());
456	>	/**
457	>	* remove removes next element, or throws NSEE if empty
458	>	*/
459	>	public void testRemove() {
460	>	PriorityBlockingQueue q = populatedQueue(SIZE);
461	>	for (int i = 0; i < SIZE; ++i) {
462	>	assertEquals(i, q.remove());
463		}
464		try {
465		q.remove();
466	<	fail("remove should throw");
467	<	} catch (NoSuchElementException success){
471	<	}
466	>	shouldThrow();
467	>	} catch (NoSuchElementException success) {}
468		}
469
470	<	public void testRemoveElement(){
471	<	PriorityBlockingQueue q = fullQueue(N);
472	<	for (int i = 1; i < N; i+=2) {
473	<	assertTrue(q.remove(new Integer(i)));
474	<	}
475	<	for (int i = 0; i < N; i+=2) {
480	<	assertTrue(q.remove(new Integer(i)));
481	<	assertFalse(q.remove(new Integer(i+1)));
482	<	}
483	<	assertTrue(q.isEmpty());
484	<	}
485	<
486	<	public void testContains(){
487	<	PriorityBlockingQueue q = fullQueue(N);
488	<	for (int i = 0; i < N; ++i) {
470	>	/**
471	>	* contains(x) reports true when elements added but not yet removed
472	>	*/
473	>	public void testContains() {
474	>	PriorityBlockingQueue q = populatedQueue(SIZE);
475	>	for (int i = 0; i < SIZE; ++i) {
476		assertTrue(q.contains(new Integer(i)));
477		q.poll();
478		assertFalse(q.contains(new Integer(i)));
479		}
480		}
481
482	<	public void testClear(){
483	<	PriorityBlockingQueue q = fullQueue(N);
482	>	/**
483	>	* clear removes all elements
484	>	*/
485	>	public void testClear() {
486	>	PriorityBlockingQueue q = populatedQueue(SIZE);
487		q.clear();
488		assertTrue(q.isEmpty());
489		assertEquals(0, q.size());
490	<	assertEquals(NOCAP, q.remainingCapacity());
501	<	q.add(new Integer(1));
490	>	q.add(one);
491		assertFalse(q.isEmpty());
492	+	assertTrue(q.contains(one));
493		q.clear();
494		assertTrue(q.isEmpty());
495		}
496
497	<	public void testContainsAll(){
498	<	PriorityBlockingQueue q = fullQueue(N);
499	<	PriorityBlockingQueue p = new PriorityBlockingQueue(N);
500	<	for (int i = 0; i < N; ++i) {
497	>	/**
498	>	* containsAll(c) is true when c contains a subset of elements
499	>	*/
500	>	public void testContainsAll() {
501	>	PriorityBlockingQueue q = populatedQueue(SIZE);
502	>	PriorityBlockingQueue p = new PriorityBlockingQueue(SIZE);
503	>	for (int i = 0; i < SIZE; ++i) {
504		assertTrue(q.containsAll(p));
505		assertFalse(p.containsAll(q));
506		p.add(new Integer(i));
#	Line 515 | Line 508 | public class PriorityBlockingQueueTest e
508		assertTrue(p.containsAll(q));
509		}
510
511	<	public void testRetainAll(){
512	<	PriorityBlockingQueue q = fullQueue(N);
513	<	PriorityBlockingQueue p = fullQueue(N);
514	<	for (int i = 0; i < N; ++i) {
511	>	/**
512	>	* retainAll(c) retains only those elements of c and reports true if changed
513	>	*/
514	>	public void testRetainAll() {
515	>	PriorityBlockingQueue q = populatedQueue(SIZE);
516	>	PriorityBlockingQueue p = populatedQueue(SIZE);
517	>	for (int i = 0; i < SIZE; ++i) {
518		boolean changed = q.retainAll(p);
519		if (i == 0)
520		assertFalse(changed);
#	Line 526 | Line 522 | public class PriorityBlockingQueueTest e
522		assertTrue(changed);
523
524		assertTrue(q.containsAll(p));
525	<	assertEquals(N-i, q.size());
525	>	assertEquals(SIZE - i, q.size());
526		p.remove();
527		}
528		}
529
530	<	public void testRemoveAll(){
531	<	for (int i = 1; i < N; ++i) {
532	<	PriorityBlockingQueue q = fullQueue(N);
533	<	PriorityBlockingQueue p = fullQueue(i);
530	>	/**
531	>	* removeAll(c) removes only those elements of c and reports true if changed
532	>	*/
533	>	public void testRemoveAll() {
534	>	for (int i = 1; i < SIZE; ++i) {
535	>	PriorityBlockingQueue q = populatedQueue(SIZE);
536	>	PriorityBlockingQueue p = populatedQueue(i);
537		assertTrue(q.removeAll(p));
538	<	assertEquals(N-i, q.size());
538	>	assertEquals(SIZE - i, q.size());
539		for (int j = 0; j < i; ++j) {
540	<	Integer I = (Integer)(p.remove());
541	<	assertFalse(q.contains(I));
540	>	Integer x = (Integer)(p.remove());
541	>	assertFalse(q.contains(x));
542		}
543		}
544		}
545
546	<	public void testToArray(){
547	<	PriorityBlockingQueue q = fullQueue(N);
548	<	Object[] o = q.toArray();
546	>	/**
547	>	* toArray contains all elements
548	>	*/
549	>	public void testToArray() throws InterruptedException {
550	>	PriorityBlockingQueue q = populatedQueue(SIZE);
551	>	Object[] o = q.toArray();
552		Arrays.sort(o);
553	<	try {
554	<	for(int i = 0; i < o.length; i++)
553	<	assertEquals(o[i], q.take());
554	<	} catch (InterruptedException e){
555	<	fail("Unexpected exception");
556	<	}
553	>	for (int i = 0; i < o.length; i++)
554	>	assertSame(o[i], q.take());
555		}
556
557	<	public void testToArray2(){
558	<	PriorityBlockingQueue q = fullQueue(N);
559	<	Integer[] ints = new Integer[N];
560	<	ints = (Integer[])q.toArray(ints);
557	>	/**
558	>	* toArray(a) contains all elements
559	>	*/
560	>	public void testToArray2() throws InterruptedException {
561	>	PriorityBlockingQueue<Integer> q = populatedQueue(SIZE);
562	>	Integer[] ints = new Integer[SIZE];
563	>	Integer[] array = q.toArray(ints);
564	>	assertSame(ints, array);
565		Arrays.sort(ints);
566	<	try {
567	<	for(int i = 0; i < ints.length; i++)
568	<	assertEquals(ints[i], q.take());
569	<	} catch (InterruptedException e){
570	<	fail("Unexpected exception");
571	<	}
572	<	}
573	<
574	<	public void testIterator(){
575	<	PriorityBlockingQueue q = fullQueue(N);
576	<	int i = 0;
577	<	Iterator it = q.iterator();
578	<	while(it.hasNext()) {
566	>	for (int i = 0; i < ints.length; i++)
567	>	assertSame(ints[i], q.take());
568	>	}
569	>
570	>	/**
571	>	* toArray(incompatible array type) throws ArrayStoreException
572	>	*/
573	>	public void testToArray1_BadArg() {
574	>	PriorityBlockingQueue q = populatedQueue(SIZE);
575	>	try {
576	>	q.toArray(new String[10]);
577	>	shouldThrow();
578	>	} catch (ArrayStoreException success) {}
579	>	}
580	>
581	>	/**
582	>	* iterator iterates through all elements
583	>	*/
584	>	public void testIterator() {
585	>	PriorityBlockingQueue q = populatedQueue(SIZE);
586	>	Iterator it = q.iterator();
587	>	int i;
588	>	for (i = 0; it.hasNext(); i++)
589		assertTrue(q.contains(it.next()));
590	<	++i;
591	<	}
580	<	assertEquals(i, N);
590	>	assertEquals(i, SIZE);
591	>	assertIteratorExhausted(it);
592		}
593
594	<	public void testIteratorRemove () {
594	>	/**
595	>	* iterator of empty collection has no elements
596	>	*/
597	>	public void testEmptyIterator() {
598	>	assertIteratorExhausted(new PriorityBlockingQueue().iterator());
599	>	}
600
601	+	/**
602	+	* iterator.remove removes current element
603	+	*/
604	+	public void testIteratorRemove() {
605		final PriorityBlockingQueue q = new PriorityBlockingQueue(3);
586	–
606		q.add(new Integer(2));
607		q.add(new Integer(1));
608		q.add(new Integer(3));
#	Line 598 | Line 617 | public class PriorityBlockingQueueTest e
617		assertFalse(it.hasNext());
618		}
619
620	<
621	<	public void testToString(){
622	<	PriorityBlockingQueue q = fullQueue(N);
620	>	/**
621	>	* toString contains toStrings of elements
622	>	*/
623	>	public void testToString() {
624	>	PriorityBlockingQueue q = populatedQueue(SIZE);
625		String s = q.toString();
626	<	for (int i = 0; i < N; ++i) {
627	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
626	>	for (int i = 0; i < SIZE; ++i) {
627	>	assertTrue(s.contains(String.valueOf(i)));
628		}
629	<	}
629	>	}
630
631	+	/**
632	+	* timed poll transfers elements across Executor tasks
633	+	*/
634		public void testPollInExecutor() {
611	–
635		final PriorityBlockingQueue q = new PriorityBlockingQueue(2);
636	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
637	+	final ExecutorService executor = Executors.newFixedThreadPool(2);
638	+	try (PoolCleaner cleaner = cleaner(executor)) {
639	+	executor.execute(new CheckedRunnable() {
640	+	public void realRun() throws InterruptedException {
641	+	assertNull(q.poll());
642	+	threadsStarted.await();
643	+	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
644	+	checkEmpty(q);
645	+	}});
646
647	<	ExecutorService executor = Executors.newFixedThreadPool(2);
647	>	executor.execute(new CheckedRunnable() {
648	>	public void realRun() throws InterruptedException {
649	>	threadsStarted.await();
650	>	q.put(one);
651	>	}});
652	>	}
653	>	}
654
655	<	executor.execute(new Runnable() {
656	<	public void run() {
657	<	assertNull("poll should fail", q.poll());
658	<	try {
659	<	assertTrue(null != q.poll(MEDIUM_DELAY_MS * 2, TimeUnit.MILLISECONDS));
660	<	assertTrue(q.isEmpty());
661	<	}
662	<	catch (InterruptedException e) {
663	<	fail("should not be interrupted");
664	<	}
665	<	}
666	<	});
655	>	/**
656	>	* A deserialized serialized queue has same elements
657	>	*/
658	>	public void testSerialization() throws Exception {
659	>	Queue x = populatedQueue(SIZE);
660	>	Queue y = serialClone(x);
661	>
662	>	assertNotSame(x, y);
663	>	assertEquals(x.size(), y.size());
664	>	while (!x.isEmpty()) {
665	>	assertFalse(y.isEmpty());
666	>	assertEquals(x.remove(), y.remove());
667	>	}
668	>	assertTrue(y.isEmpty());
669	>	}
670
671	<	executor.execute(new Runnable() {
672	<	public void run() {
673	<	try {
674	<	Thread.sleep(MEDIUM_DELAY_MS);
675	<	q.put(new Integer(1));
676	<	}
677	<	catch (InterruptedException e) {
678	<	fail("should not be interrupted");
679	<	}
680	<	}
681	<	});
682	<
683	<	executor.shutdown();
671	>	/**
672	>	* drainTo(c) empties queue into another collection c
673	>	*/
674	>	public void testDrainTo() {
675	>	PriorityBlockingQueue q = populatedQueue(SIZE);
676	>	ArrayList l = new ArrayList();
677	>	q.drainTo(l);
678	>	assertEquals(0, q.size());
679	>	assertEquals(SIZE, l.size());
680	>	for (int i = 0; i < SIZE; ++i)
681	>	assertEquals(l.get(i), new Integer(i));
682	>	q.add(zero);
683	>	q.add(one);
684	>	assertFalse(q.isEmpty());
685	>	assertTrue(q.contains(zero));
686	>	assertTrue(q.contains(one));
687	>	l.clear();
688	>	q.drainTo(l);
689	>	assertEquals(0, q.size());
690	>	assertEquals(2, l.size());
691	>	for (int i = 0; i < 2; ++i)
692	>	assertEquals(l.get(i), new Integer(i));
693	>	}
694
695	+	/**
696	+	* drainTo empties queue
697	+	*/
698	+	public void testDrainToWithActivePut() throws InterruptedException {
699	+	final PriorityBlockingQueue q = populatedQueue(SIZE);
700	+	Thread t = new Thread(new CheckedRunnable() {
701	+	public void realRun() {
702	+	q.put(new Integer(SIZE + 1));
703	+	}});
704	+
705	+	t.start();
706	+	ArrayList l = new ArrayList();
707	+	q.drainTo(l);
708	+	assertTrue(l.size() >= SIZE);
709	+	for (int i = 0; i < SIZE; ++i)
710	+	assertEquals(l.get(i), new Integer(i));
711	+	t.join();
712	+	assertTrue(q.size() + l.size() >= SIZE);
713		}
714
715	<	public void testSerialization() {
716	<	PriorityBlockingQueue q = fullQueue(N);
717	<	try {
718	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
719	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
720	<	out.writeObject(q);
721	<	out.close();
722	<
723	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
724	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
725	<	PriorityBlockingQueue r = (PriorityBlockingQueue)in.readObject();
726	<	assertEquals(q.size(), r.size());
727	<	while (!q.isEmpty())
728	<	assertEquals(q.remove(), r.remove());
729	<	} catch(Exception e){
730	<	fail("unexpected exception");
715	>	/**
716	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
717	>	*/
718	>	public void testDrainToN() {
719	>	PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE * 2);
720	>	for (int i = 0; i < SIZE + 2; ++i) {
721	>	for (int j = 0; j < SIZE; j++)
722	>	assertTrue(q.offer(new Integer(j)));
723	>	ArrayList l = new ArrayList();
724	>	q.drainTo(l, i);
725	>	int k = (i < SIZE) ? i : SIZE;
726	>	assertEquals(k, l.size());
727	>	assertEquals(SIZE - k, q.size());
728	>	for (int j = 0; j < k; ++j)
729	>	assertEquals(l.get(j), new Integer(j));
730	>	do {} while (q.poll() != null);
731	>	}
732	>	}
733	>
734	>	/**
735	>	* remove(null), contains(null) always return false
736	>	*/
737	>	public void testNeverContainsNull() {
738	>	Collection<?>[] qs = {
739	>	new PriorityBlockingQueue<Object>(),
740	>	populatedQueue(2),
741	>	};
742	>
743	>	for (Collection<?> q : qs) {
744	>	assertFalse(q.contains(null));
745	>	assertFalse(q.remove(null));
746		}
747		}
748

Diff Legend

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