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

Diff Legend

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