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

Diff Legend

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