ViewVC Help

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

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

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

Diff Legend

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