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

Diff Legend

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