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

Diff Legend

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