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.80 by jsr166, Thu Sep 5 20:54:24 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());
468	<	}
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	>	long startTime = System.nanoTime();
467	>	for (int i = 0; i < SIZE; i++)
468	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
469
470	<	/**
471	<	*  timed poll before a delayed offer fails; after offer succeeds;
472	<	*  on interruption throws
473	<	*/
474	<	public void testTimedPollWithOffer() {
475	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
476	<	Thread t = new Thread(new Runnable() {
477	<	public void run() {
478	<	try {
479	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
480	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
481	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
482	<	threadShouldThrow();
483	<	} catch (InterruptedException success) { }
484	<	}
485	<	});
486	<	try {
487	<	t.start();
488	<	Thread.sleep(SMALL_DELAY_MS);
489	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
490	<	t.interrupt();
491	<	t.join();
492	<	} catch (Exception e){
529	<	unexpectedException();
530	<	}
531	<	}
470	>	Thread.currentThread().interrupt();
471	>	try {
472	>	q.poll(randomTimeout(), randomTimeUnit());
473	>	shouldThrow();
474	>	} catch (InterruptedException success) {}
475	>	assertFalse(Thread.interrupted());
476	>
477	>	pleaseInterrupt.countDown();
478	>	try {
479	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
480	>	shouldThrow();
481	>	} catch (InterruptedException success) {}
482	>	assertFalse(Thread.interrupted());
483	>
484	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
485	>	}});
486	>
487	>	await(pleaseInterrupt);
488	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
489	>	t.interrupt();
490	>	awaitTermination(t);
491	>	checkEmpty(q);
492	>	}
493
494		/**
495		* peek returns next element, or null if empty
#	Line 536 | Line 497 | public class LinkedBlockingQueueTest ext
497		public void testPeek() {
498		LinkedBlockingQueue q = populatedQueue(SIZE);
499		for (int i = 0; i < SIZE; ++i) {
500	<	assertEquals(i, ((Integer)q.peek()).intValue());
501	<	q.poll();
500	>	assertEquals(i, q.peek());
501	>	assertEquals(i, q.poll());
502		assertTrue(q.peek() == null ||
503	<	i != ((Integer)q.peek()).intValue());
503	>	!q.peek().equals(i));
504		}
505	<	assertNull(q.peek());
505	>	assertNull(q.peek());
506		}
507
508		/**
#	Line 550 | Line 511 | public class LinkedBlockingQueueTest ext
511		public void testElement() {
512		LinkedBlockingQueue q = populatedQueue(SIZE);
513		for (int i = 0; i < SIZE; ++i) {
514	<	assertEquals(i, ((Integer)q.element()).intValue());
515	<	q.poll();
514	>	assertEquals(i, q.element());
515	>	assertEquals(i, q.poll());
516		}
517		try {
518		q.element();
519		shouldThrow();
520	<	}
560	<	catch (NoSuchElementException success) {}
520	>	} catch (NoSuchElementException success) {}
521		}
522
523		/**
#	Line 566 | Line 526 | public class LinkedBlockingQueueTest ext
526		public void testRemove() {
527		LinkedBlockingQueue q = populatedQueue(SIZE);
528		for (int i = 0; i < SIZE; ++i) {
529	<	assertEquals(i, ((Integer)q.remove()).intValue());
529	>	assertEquals(i, q.remove());
530		}
531		try {
532		q.remove();
533		shouldThrow();
534	<	} catch (NoSuchElementException success){
575	<	}
534	>	} catch (NoSuchElementException success) {}
535		}
536
537		/**
538	<	* remove(x) removes x and returns true if present
538	>	* An add following remove(x) succeeds
539		*/
540	<	public void testRemoveElement() {
541	<	LinkedBlockingQueue q = populatedQueue(SIZE);
542	<	for (int i = 1; i < SIZE; i+=2) {
543	<	assertTrue(q.remove(new Integer(i)));
544	<	}
545	<	for (int i = 0; i < SIZE; i+=2) {
546	<	assertTrue(q.remove(new Integer(i)));
547	<	assertFalse(q.remove(new Integer(i+1)));
589	<	}
590	<	assertTrue(q.isEmpty());
540	>	public void testRemoveElementAndAdd() throws InterruptedException {
541	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
542	>	assertTrue(q.add(new Integer(1)));
543	>	assertTrue(q.add(new Integer(2)));
544	>	assertTrue(q.remove(new Integer(1)));
545	>	assertTrue(q.remove(new Integer(2)));
546	>	assertTrue(q.add(new Integer(3)));
547	>	assertNotNull(q.take());
548		}
549	<
549	>
550		/**
551		* contains(x) reports true when elements added but not yet removed
552		*/
#	Line 613 | Line 570 | public class LinkedBlockingQueueTest ext
570		assertEquals(SIZE, q.remainingCapacity());
571		q.add(one);
572		assertFalse(q.isEmpty());
573	+	assertTrue(q.contains(one));
574		q.clear();
575		assertTrue(q.isEmpty());
576		}
#	Line 645 | Line 603 | public class LinkedBlockingQueueTest ext
603		assertTrue(changed);
604
605		assertTrue(q.containsAll(p));
606	<	assertEquals(SIZE-i, q.size());
606	>	assertEquals(SIZE - i, q.size());
607		p.remove();
608		}
609		}
#	Line 658 | Line 616 | public class LinkedBlockingQueueTest ext
616		LinkedBlockingQueue q = populatedQueue(SIZE);
617		LinkedBlockingQueue p = populatedQueue(i);
618		assertTrue(q.removeAll(p));
619	<	assertEquals(SIZE-i, q.size());
619	>	assertEquals(SIZE - i, q.size());
620		for (int j = 0; j < i; ++j) {
621	<	Integer I = (Integer)(p.remove());
622	<	assertFalse(q.contains(I));
621	>	Integer x = (Integer)(p.remove());
622	>	assertFalse(q.contains(x));
623		}
624		}
625		}
626
627		/**
628	<	* toArray contains all elements
628	>	* toArray contains all elements in FIFO order
629		*/
630		public void testToArray() {
631		LinkedBlockingQueue q = populatedQueue(SIZE);
632	<	Object[] o = q.toArray();
633	<	try {
634	<	for(int i = 0; i < o.length; i++)
635	<	assertEquals(o[i], q.take());
636	<	} catch (InterruptedException e){
679	<	unexpectedException();
680	<	}
632	>	Object[] a = q.toArray();
633	>	assertSame(Object[].class, a.getClass());
634	>	for (Object o : a)
635	>	assertSame(o, q.poll());
636	>	assertTrue(q.isEmpty());
637		}
638
639		/**
640	<	* toArray(a) contains all elements
641	<	*/
642	<	public void testToArray2() {
643	<	LinkedBlockingQueue q = populatedQueue(SIZE);
644	<	Integer[] ints = new Integer[SIZE];
645	<	ints = (Integer[])q.toArray(ints);
646	<	try {
647	<	for(int i = 0; i < ints.length; i++)
648	<	assertEquals(ints[i], q.take());
649	<	} catch (InterruptedException e){
694	<	unexpectedException();
695	<	}
640	>	* toArray(a) contains all elements in FIFO order
641	>	*/
642	>	public void testToArray2() throws InterruptedException {
643	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
644	>	Integer[] ints = new Integer[SIZE];
645	>	Integer[] array = q.toArray(ints);
646	>	assertSame(ints, array);
647	>	for (Integer o : ints)
648	>	assertSame(o, q.poll());
649	>	assertTrue(q.isEmpty());
650		}
651	<
651	>
652	>	/**
653	>	* toArray(incompatible array type) throws ArrayStoreException
654	>	*/
655	>	public void testToArray1_BadArg() {
656	>	LinkedBlockingQueue q = populatedQueue(SIZE);
657	>	try {
658	>	q.toArray(new String[10]);
659	>	shouldThrow();
660	>	} catch (ArrayStoreException success) {}
661	>	}
662	>
663		/**
664		* iterator iterates through all elements
665		*/
666	<	public void testIterator() {
666	>	public void testIterator() throws InterruptedException {
667		LinkedBlockingQueue q = populatedQueue(SIZE);
668	<	Iterator it = q.iterator();
669	<	try {
670	<	while(it.hasNext()){
671	<	assertEquals(it.next(), q.take());
672	<	}
673	<	} catch (InterruptedException e){
674	<	unexpectedException();
675	<	}
668	>	Iterator it = q.iterator();
669	>	int i;
670	>	for (i = 0; it.hasNext(); i++)
671	>	assertTrue(q.contains(it.next()));
672	>	assertEquals(i, SIZE);
673	>	assertIteratorExhausted(it);
674	>
675	>	it = q.iterator();
676	>	for (i = 0; it.hasNext(); i++)
677	>	assertEquals(it.next(), q.take());
678	>	assertEquals(i, SIZE);
679	>	assertIteratorExhausted(it);
680	>	}
681	>
682	>	/**
683	>	* iterator of empty collection has no elements
684	>	*/
685	>	public void testEmptyIterator() {
686	>	assertIteratorExhausted(new LinkedBlockingQueue().iterator());
687		}
688
689		/**
690		* iterator.remove removes current element
691		*/
692	<	public void testIteratorRemove () {
692	>	public void testIteratorRemove() {
693		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
694		q.add(two);
695		q.add(one);
#	Line 722 | Line 698 | public class LinkedBlockingQueueTest ext
698		Iterator it = q.iterator();
699		it.next();
700		it.remove();
701	<
701	>
702		it = q.iterator();
703	<	assertEquals(it.next(), one);
704	<	assertEquals(it.next(), three);
703	>	assertSame(it.next(), one);
704	>	assertSame(it.next(), three);
705		assertFalse(it.hasNext());
706		}
707
732	–
708		/**
709		* iterator ordering is FIFO
710		*/
#	Line 741 | Line 716 | public class LinkedBlockingQueueTest ext
716		assertEquals(0, q.remainingCapacity());
717		int k = 0;
718		for (Iterator it = q.iterator(); it.hasNext();) {
719	<	int i = ((Integer)(it.next())).intValue();
745	<	assertEquals(++k, i);
719	>	assertEquals(++k, it.next());
720		}
721		assertEquals(3, k);
722		}
#	Line 750 | Line 724 | public class LinkedBlockingQueueTest ext
724		/**
725		* Modifications do not cause iterators to fail
726		*/
727	<	public void testWeaklyConsistentIteration () {
727	>	public void testWeaklyConsistentIteration() {
728		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
729		q.add(one);
730		q.add(two);
731		q.add(three);
732	<	try {
733	<	for (Iterator it = q.iterator(); it.hasNext();) {
734	<	q.remove();
761	<	it.next();
762	<	}
763	<	}
764	<	catch (ConcurrentModificationException e) {
765	<	unexpectedException();
732	>	for (Iterator it = q.iterator(); it.hasNext();) {
733	>	q.remove();
734	>	it.next();
735		}
736		assertEquals(0, q.size());
737		}
738
770	–
739		/**
740		* toString contains toStrings of elements
741		*/
#	Line 775 | Line 743 | public class LinkedBlockingQueueTest ext
743		LinkedBlockingQueue q = populatedQueue(SIZE);
744		String s = q.toString();
745		for (int i = 0; i < SIZE; ++i) {
746	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
746	>	assertTrue(s.contains(String.valueOf(i)));
747		}
748	<	}
781	<
748	>	}
749
750		/**
751		* offer transfers elements across Executor tasks
#	Line 787 | Line 754 | public class LinkedBlockingQueueTest ext
754		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
755		q.add(one);
756		q.add(two);
757	<	ExecutorService executor = Executors.newFixedThreadPool(2);
758	<	executor.execute(new Runnable() {
759	<	public void run() {
760	<	threadAssertFalse(q.offer(three));
761	<	try {
762	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
763	<	threadAssertEquals(0, q.remainingCapacity());
764	<	}
765	<	catch (InterruptedException e) {
766	<	threadUnexpectedException();
800	<	}
801	<	}
802	<	});
757	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
758	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
759	>	try (PoolCleaner cleaner = cleaner(executor)) {
760	>	executor.execute(new CheckedRunnable() {
761	>	public void realRun() throws InterruptedException {
762	>	assertFalse(q.offer(three));
763	>	threadsStarted.await();
764	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
765	>	assertEquals(0, q.remainingCapacity());
766	>	}});
767
768	<	executor.execute(new Runnable() {
769	<	public void run() {
770	<	try {
771	<	Thread.sleep(SMALL_DELAY_MS);
772	<	threadAssertEquals(one, q.take());
773	<	}
810	<	catch (InterruptedException e) {
811	<	threadUnexpectedException();
812	<	}
813	<	}
814	<	});
815	<
816	<	joinPool(executor);
768	>	executor.execute(new CheckedRunnable() {
769	>	public void realRun() throws InterruptedException {
770	>	threadsStarted.await();
771	>	assertSame(one, q.take());
772	>	}});
773	>	}
774		}
775
776		/**
777	<	* poll retrieves elements across Executor threads
777	>	* timed poll retrieves elements across Executor threads
778		*/
779		public void testPollInExecutor() {
780		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
781	<	ExecutorService executor = Executors.newFixedThreadPool(2);
782	<	executor.execute(new Runnable() {
783	<	public void run() {
784	<	threadAssertNull(q.poll());
785	<	try {
786	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
787	<	threadAssertTrue(q.isEmpty());
788	<	}
789	<	catch (InterruptedException e) {
790	<	threadUnexpectedException();
834	<	}
835	<	}
836	<	});
781	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
782	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
783	>	try (PoolCleaner cleaner = cleaner(executor)) {
784	>	executor.execute(new CheckedRunnable() {
785	>	public void realRun() throws InterruptedException {
786	>	assertNull(q.poll());
787	>	threadsStarted.await();
788	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
789	>	checkEmpty(q);
790	>	}});
791
792	<	executor.execute(new Runnable() {
793	<	public void run() {
794	<	try {
841	<	Thread.sleep(SMALL_DELAY_MS);
792	>	executor.execute(new CheckedRunnable() {
793	>	public void realRun() throws InterruptedException {
794	>	threadsStarted.await();
795		q.put(one);
796	<	}
797	<	catch (InterruptedException e) {
798	<	threadUnexpectedException();
799	<	}
800	<	}
801	<	});
802	<
803	<	joinPool(executor);
796	>	}});
797	>	}
798	>	}
799	>
800	>	/**
801	>	* A deserialized/reserialized queue has same elements in same order
802	>	*/
803	>	public void testSerialization() throws Exception {
804	>	Queue x = populatedQueue(SIZE);
805	>	Queue y = serialClone(x);
806	>
807	>	assertNotSame(x, y);
808	>	assertEquals(x.size(), y.size());
809	>	assertEquals(x.toString(), y.toString());
810	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
811	>	while (!x.isEmpty()) {
812	>	assertFalse(y.isEmpty());
813	>	assertEquals(x.remove(), y.remove());
814	>	}
815	>	assertTrue(y.isEmpty());
816		}
817
818		/**
819	<	* A deserialized serialized queue has same elements in same order
819	>	* drainTo(c) empties queue into another collection c
820		*/
821	<	public void testSerialization() {
821	>	public void testDrainTo() {
822		LinkedBlockingQueue q = populatedQueue(SIZE);
823	+	ArrayList l = new ArrayList();
824	+	q.drainTo(l);
825	+	assertEquals(0, q.size());
826	+	assertEquals(SIZE, l.size());
827	+	for (int i = 0; i < SIZE; ++i)
828	+	assertEquals(l.get(i), new Integer(i));
829	+	q.add(zero);
830	+	q.add(one);
831	+	assertFalse(q.isEmpty());
832	+	assertTrue(q.contains(zero));
833	+	assertTrue(q.contains(one));
834	+	l.clear();
835	+	q.drainTo(l);
836	+	assertEquals(0, q.size());
837	+	assertEquals(2, l.size());
838	+	for (int i = 0; i < 2; ++i)
839	+	assertEquals(l.get(i), new Integer(i));
840	+	}
841
842	<	try {
843	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
844	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
845	<	out.writeObject(q);
846	<	out.close();
842	>	/**
843	>	* drainTo empties full queue, unblocking a waiting put.
844	>	*/
845	>	public void testDrainToWithActivePut() throws InterruptedException {
846	>	final LinkedBlockingQueue q = populatedQueue(SIZE);
847	>	Thread t = new Thread(new CheckedRunnable() {
848	>	public void realRun() throws InterruptedException {
849	>	q.put(new Integer(SIZE + 1));
850	>	}});
851	>
852	>	t.start();
853	>	ArrayList l = new ArrayList();
854	>	q.drainTo(l);
855	>	assertTrue(l.size() >= SIZE);
856	>	for (int i = 0; i < SIZE; ++i)
857	>	assertEquals(l.get(i), new Integer(i));
858	>	t.join();
859	>	assertTrue(q.size() + l.size() >= SIZE);
860	>	}
861
862	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
863	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
864	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
865	<	assertEquals(q.size(), r.size());
866	<	while (!q.isEmpty())
867	<	assertEquals(q.remove(), r.remove());
868	<	} catch(Exception e){
869	<	unexpectedException();
862	>	/**
863	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
864	>	*/
865	>	public void testDrainToN() {
866	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
867	>	for (int i = 0; i < SIZE + 2; ++i) {
868	>	for (int j = 0; j < SIZE; j++)
869	>	assertTrue(q.offer(new Integer(j)));
870	>	ArrayList l = new ArrayList();
871	>	q.drainTo(l, i);
872	>	int k = (i < SIZE) ? i : SIZE;
873	>	assertEquals(k, l.size());
874	>	assertEquals(SIZE - k, q.size());
875	>	for (int j = 0; j < k; ++j)
876	>	assertEquals(l.get(j), new Integer(j));
877	>	do {} while (q.poll() != null);
878	>	}
879	>	}
880	>
881	>	/**
882	>	* remove(null), contains(null) always return false
883	>	*/
884	>	public void testNeverContainsNull() {
885	>	Collection<?>[] qs = {
886	>	new LinkedBlockingQueue<Object>(),
887	>	populatedQueue(2),
888	>	};
889	>
890	>	for (Collection<?> q : qs) {
891	>	assertFalse(q.contains(null));
892	>	assertFalse(q.remove(null));
893		}
894		}
895

Diff Legend

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