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

Diff Legend

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