ViewVC Help

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

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

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

Diff Legend

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