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.72 by jsr166, Sun May 14 00:56:43 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	>	assertThreadBlocks(t, Thread.State.WAITING);
296	>	t.interrupt();
297	>	awaitTermination(t);
298	>	assertEquals(SIZE, q.size());
299	>	assertEquals(0, q.remainingCapacity());
300		}
301
302		/**
303	<	*
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	>	assertThreadBlocks(t, Thread.State.WAITING);
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){
355	<	unexpectedException();
356	<	}
341	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
342	>	Thread t = newStartedThread(new CheckedRunnable() {
343	>	public void realRun() throws InterruptedException {
344	>	q.put(new Object());
345	>	q.put(new Object());
346	>	long startTime = System.nanoTime();
347	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
348	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
349	>	pleaseInterrupt.countDown();
350	>	try {
351	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
352	>	shouldThrow();
353	>	} catch (InterruptedException success) {}
354	>	assertFalse(Thread.interrupted());
355	>	}});
356	>
357	>	await(pleaseInterrupt);
358	>	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
359	>	t.interrupt();
360	>	awaitTermination(t);
361		}
362
363		/**
364	<	*
365	<	*/
366	<	public void testBlockingTake() {
367	<	Thread t = new Thread(new Runnable() {
368	<	public void run() {
369	<	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();
364	>	* take retrieves elements in FIFO order
365	>	*/
366	>	public void testTake() throws InterruptedException {
367	>	LinkedBlockingQueue q = populatedQueue(SIZE);
368	>	for (int i = 0; i < SIZE; ++i) {
369	>	assertEquals(i, q.take());
370		}
371		}
372
373	+	/**
374	+	* Take removes existing elements until empty, then blocks interruptibly
375	+	*/
376	+	public void testBlockingTake() throws InterruptedException {
377	+	final BlockingQueue q = populatedQueue(SIZE);
378	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
379	+	Thread t = newStartedThread(new CheckedRunnable() {
380	+	public void realRun() throws InterruptedException {
381	+	for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
382	+
383	+	Thread.currentThread().interrupt();
384	+	try {
385	+	q.take();
386	+	shouldThrow();
387	+	} catch (InterruptedException success) {}
388	+	assertFalse(Thread.interrupted());
389	+
390	+	pleaseInterrupt.countDown();
391	+	try {
392	+	q.take();
393	+	shouldThrow();
394	+	} catch (InterruptedException success) {}
395	+	assertFalse(Thread.interrupted());
396	+	}});
397	+
398	+	await(pleaseInterrupt);
399	+	assertThreadBlocks(t, Thread.State.WAITING);
400	+	t.interrupt();
401	+	awaitTermination(t);
402	+	}
403
404		/**
405	<	*
405	>	* poll succeeds unless empty
406		*/
407		public void testPoll() {
408		LinkedBlockingQueue q = populatedQueue(SIZE);
409		for (int i = 0; i < SIZE; ++i) {
410	<	assertEquals(i, ((Integer)q.poll()).intValue());
410	>	assertEquals(i, q.poll());
411		}
412	<	assertNull(q.poll());
412	>	assertNull(q.poll());
413		}
414
415		/**
416	<	*
416	>	* timed poll with zero timeout succeeds when non-empty, else times out
417		*/
418	<	public void testTimedPoll0() {
419	<	try {
420	<	LinkedBlockingQueue q = populatedQueue(SIZE);
421	<	for (int i = 0; i < SIZE; ++i) {
422	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
423	<	}
456	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
457	<	} catch (InterruptedException e){
458	<	unexpectedException();
459	<	}
418	>	public void testTimedPoll0() throws InterruptedException {
419	>	LinkedBlockingQueue q = populatedQueue(SIZE);
420	>	for (int i = 0; i < SIZE; ++i) {
421	>	assertEquals(i, q.poll(0, MILLISECONDS));
422	>	}
423	>	assertNull(q.poll(0, MILLISECONDS));
424		}
425
426		/**
427	<	*
427	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
428		*/
429	<	public void testTimedPoll() {
430	<	try {
431	<	LinkedBlockingQueue q = populatedQueue(SIZE);
432	<	for (int i = 0; i < SIZE; ++i) {
433	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
434	<	}
471	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
472	<	} catch (InterruptedException e){
473	<	unexpectedException();
474	<	}
475	<	}
476	<
477	<	/**
478	<	*
479	<	*/
480	<	public void testInterruptedTimedPoll() {
481	<	Thread t = new Thread(new Runnable() {
482	<	public void run() {
483	<	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();
429	>	public void testTimedPoll() throws InterruptedException {
430	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
431	>	for (int i = 0; i < SIZE; ++i) {
432	>	long startTime = System.nanoTime();
433	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
434	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
435		}
436	+	long startTime = System.nanoTime();
437	+	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
438	+	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
439	+	checkEmpty(q);
440		}
441
442		/**
443	<	*
443	>	* Interrupted timed poll throws InterruptedException instead of
444	>	* returning timeout status
445		*/
446	<	public void testTimedPollWithOffer() {
447	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
448	<	Thread t = new Thread(new Runnable() {
449	<	public void run() {
450	<	try {
451	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
452	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
453	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
514	<	threadShouldThrow();
515	<	} catch (InterruptedException success) { }
446	>	public void testInterruptedTimedPoll() throws InterruptedException {
447	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
448	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
449	>	Thread t = newStartedThread(new CheckedRunnable() {
450	>	public void realRun() throws InterruptedException {
451	>	long startTime = System.nanoTime();
452	>	for (int i = 0; i < SIZE; ++i) {
453	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
454		}
517	–	});
518	–	try {
519	–	t.start();
520	–	Thread.sleep(SMALL_DELAY_MS);
521	–	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
522	–	t.interrupt();
523	–	t.join();
524	–	} catch (Exception e){
525	–	unexpectedException();
526	–	}
527	–	}
455
456	+	pleaseInterrupt.countDown();
457	+	try {
458	+	q.poll(LONG_DELAY_MS, MILLISECONDS);
459	+	shouldThrow();
460	+	} catch (InterruptedException success) {}
461	+	assertFalse(Thread.interrupted());
462	+
463	+	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
464	+	}});
465	+
466	+	await(pleaseInterrupt);
467	+	assertThreadBlocks(t, Thread.State.TIMED_WAITING);
468	+	t.interrupt();
469	+	awaitTermination(t);
470	+	checkEmpty(q);
471	+	}
472
473		/**
474	<	*
474	>	* peek returns next element, or null if empty
475		*/
476		public void testPeek() {
477		LinkedBlockingQueue q = populatedQueue(SIZE);
478		for (int i = 0; i < SIZE; ++i) {
479	<	assertEquals(i, ((Integer)q.peek()).intValue());
480	<	q.poll();
479	>	assertEquals(i, q.peek());
480	>	assertEquals(i, q.poll());
481		assertTrue(q.peek() == null ||
482	<	i != ((Integer)q.peek()).intValue());
482	>	!q.peek().equals(i));
483		}
484	<	assertNull(q.peek());
484	>	assertNull(q.peek());
485		}
486
487		/**
488	<	*
488	>	* element returns next element, or throws NSEE if empty
489		*/
490		public void testElement() {
491		LinkedBlockingQueue q = populatedQueue(SIZE);
492		for (int i = 0; i < SIZE; ++i) {
493	<	assertEquals(i, ((Integer)q.element()).intValue());
494	<	q.poll();
493	>	assertEquals(i, q.element());
494	>	assertEquals(i, q.poll());
495		}
496		try {
497		q.element();
498		shouldThrow();
499	<	}
557	<	catch (NoSuchElementException success) {}
499	>	} catch (NoSuchElementException success) {}
500		}
501
502		/**
503	<	*
503	>	* remove removes next element, or throws NSEE if empty
504		*/
505		public void testRemove() {
506		LinkedBlockingQueue q = populatedQueue(SIZE);
507		for (int i = 0; i < SIZE; ++i) {
508	<	assertEquals(i, ((Integer)q.remove()).intValue());
508	>	assertEquals(i, q.remove());
509		}
510		try {
511		q.remove();
512		shouldThrow();
513	<	} catch (NoSuchElementException success){
572	<	}
513	>	} catch (NoSuchElementException success) {}
514		}
515
516		/**
517	<	*
517	>	* An add following remove(x) succeeds
518		*/
519	<	public void testRemoveElement() {
520	<	LinkedBlockingQueue q = populatedQueue(SIZE);
521	<	for (int i = 1; i < SIZE; i+=2) {
522	<	assertTrue(q.remove(new Integer(i)));
523	<	}
524	<	for (int i = 0; i < SIZE; i+=2) {
525	<	assertTrue(q.remove(new Integer(i)));
526	<	assertFalse(q.remove(new Integer(i+1)));
586	<	}
587	<	assertTrue(q.isEmpty());
519	>	public void testRemoveElementAndAdd() throws InterruptedException {
520	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
521	>	assertTrue(q.add(new Integer(1)));
522	>	assertTrue(q.add(new Integer(2)));
523	>	assertTrue(q.remove(new Integer(1)));
524	>	assertTrue(q.remove(new Integer(2)));
525	>	assertTrue(q.add(new Integer(3)));
526	>	assertNotNull(q.take());
527		}
528	<
528	>
529		/**
530	<	*
530	>	* contains(x) reports true when elements added but not yet removed
531		*/
532		public void testContains() {
533		LinkedBlockingQueue q = populatedQueue(SIZE);
#	Line 600 | Line 539 | public class LinkedBlockingQueueTest ext
539		}
540
541		/**
542	<	*
542	>	* clear removes all elements
543		*/
544		public void testClear() {
545		LinkedBlockingQueue q = populatedQueue(SIZE);
#	Line 610 | Line 549 | public class LinkedBlockingQueueTest ext
549		assertEquals(SIZE, q.remainingCapacity());
550		q.add(one);
551		assertFalse(q.isEmpty());
552	+	assertTrue(q.contains(one));
553		q.clear();
554		assertTrue(q.isEmpty());
555		}
556
557		/**
558	<	*
558	>	* containsAll(c) is true when c contains a subset of elements
559		*/
560		public void testContainsAll() {
561		LinkedBlockingQueue q = populatedQueue(SIZE);
#	Line 629 | Line 569 | public class LinkedBlockingQueueTest ext
569		}
570
571		/**
572	<	*
572	>	* retainAll(c) retains only those elements of c and reports true if changed
573		*/
574		public void testRetainAll() {
575		LinkedBlockingQueue q = populatedQueue(SIZE);
#	Line 642 | Line 582 | public class LinkedBlockingQueueTest ext
582		assertTrue(changed);
583
584		assertTrue(q.containsAll(p));
585	<	assertEquals(SIZE-i, q.size());
585	>	assertEquals(SIZE - i, q.size());
586		p.remove();
587		}
588		}
589
590		/**
591	<	*
591	>	* removeAll(c) removes only those elements of c and reports true if changed
592		*/
593		public void testRemoveAll() {
594		for (int i = 1; i < SIZE; ++i) {
595		LinkedBlockingQueue q = populatedQueue(SIZE);
596		LinkedBlockingQueue p = populatedQueue(i);
597		assertTrue(q.removeAll(p));
598	<	assertEquals(SIZE-i, q.size());
598	>	assertEquals(SIZE - i, q.size());
599		for (int j = 0; j < i; ++j) {
600	<	Integer I = (Integer)(p.remove());
601	<	assertFalse(q.contains(I));
600	>	Integer x = (Integer)(p.remove());
601	>	assertFalse(q.contains(x));
602		}
603		}
604		}
605
666	–
606		/**
607	<	*
607	>	* toArray contains all elements in FIFO order
608		*/
609		public void testToArray() {
610		LinkedBlockingQueue q = populatedQueue(SIZE);
611	<	Object[] o = q.toArray();
612	<	try {
613	<	for(int i = 0; i < o.length; i++)
675	<	assertEquals(o[i], q.take());
676	<	} catch (InterruptedException e){
677	<	unexpectedException();
678	<	}
611	>	Object[] o = q.toArray();
612	>	for (int i = 0; i < o.length; i++)
613	>	assertSame(o[i], q.poll());
614		}
615
616		/**
617	<	*
617	>	* toArray(a) contains all elements in FIFO order
618		*/
619	<	public void testToArray2() {
619	>	public void testToArray2() throws InterruptedException {
620	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
621	>	Integer[] ints = new Integer[SIZE];
622	>	Integer[] array = q.toArray(ints);
623	>	assertSame(ints, array);
624	>	for (int i = 0; i < ints.length; i++)
625	>	assertSame(ints[i], q.poll());
626	>	}
627	>
628	>	/**
629	>	* toArray(incompatible array type) throws ArrayStoreException
630	>	*/
631	>	public void testToArray1_BadArg() {
632		LinkedBlockingQueue q = populatedQueue(SIZE);
633	<	Integer[] ints = new Integer[SIZE];
634	<	ints = (Integer[])q.toArray(ints);
635	<	try {
636	<	for(int i = 0; i < ints.length; i++)
690	<	assertEquals(ints[i], q.take());
691	<	} catch (InterruptedException e){
692	<	unexpectedException();
693	<	}
633	>	try {
634	>	q.toArray(new String[10]);
635	>	shouldThrow();
636	>	} catch (ArrayStoreException success) {}
637		}
638	<
638	>
639		/**
640	<	*
640	>	* iterator iterates through all elements
641		*/
642	<	public void testIterator() {
642	>	public void testIterator() throws InterruptedException {
643		LinkedBlockingQueue q = populatedQueue(SIZE);
644	<	Iterator it = q.iterator();
645	<	try {
646	<	while(it.hasNext()){
647	<	assertEquals(it.next(), q.take());
648	<	}
649	<	} catch (InterruptedException e){
650	<	unexpectedException();
651	<	}
644	>	Iterator it = q.iterator();
645	>	int i;
646	>	for (i = 0; it.hasNext(); i++)
647	>	assertTrue(q.contains(it.next()));
648	>	assertEquals(i, SIZE);
649	>	assertIteratorExhausted(it);
650	>
651	>	it = q.iterator();
652	>	for (i = 0; it.hasNext(); i++)
653	>	assertEquals(it.next(), q.take());
654	>	assertEquals(i, SIZE);
655	>	assertIteratorExhausted(it);
656		}
657
658		/**
659	<	*
659	>	* iterator of empty collection has no elements
660		*/
661	<	public void testIteratorOrdering() {
661	>	public void testEmptyIterator() {
662	>	assertIteratorExhausted(new LinkedBlockingQueue().iterator());
663	>	}
664
665	+	/**
666	+	* iterator.remove removes current element
667	+	*/
668	+	public void testIteratorRemove() {
669		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
670	+	q.add(two);
671	+	q.add(one);
672	+	q.add(three);
673	+
674	+	Iterator it = q.iterator();
675	+	it.next();
676	+	it.remove();
677
678	+	it = q.iterator();
679	+	assertSame(it.next(), one);
680	+	assertSame(it.next(), three);
681	+	assertFalse(it.hasNext());
682	+	}
683	+
684	+	/**
685	+	* iterator ordering is FIFO
686	+	*/
687	+	public void testIteratorOrdering() {
688	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
689		q.add(one);
690		q.add(two);
691		q.add(three);
721	–
692		assertEquals(0, q.remainingCapacity());
723	–
693		int k = 0;
694		for (Iterator it = q.iterator(); it.hasNext();) {
695	<	int i = ((Integer)(it.next())).intValue();
727	<	assertEquals(++k, i);
695	>	assertEquals(++k, it.next());
696		}
729	–
697		assertEquals(3, k);
698		}
699
700		/**
701	<	*
701	>	* Modifications do not cause iterators to fail
702		*/
703	<	public void testWeaklyConsistentIteration () {
737	<
703	>	public void testWeaklyConsistentIteration() {
704		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
739	–
705		q.add(one);
706		q.add(two);
707		q.add(three);
708	<
709	<	try {
710	<	for (Iterator it = q.iterator(); it.hasNext();) {
746	<	q.remove();
747	<	it.next();
748	<	}
749	<	}
750	<	catch (ConcurrentModificationException e) {
751	<	unexpectedException();
708	>	for (Iterator it = q.iterator(); it.hasNext();) {
709	>	q.remove();
710	>	it.next();
711		}
753	–
712		assertEquals(0, q.size());
713		}
714
757	–
715		/**
716	<	*
716	>	* toString contains toStrings of elements
717		*/
718		public void testToString() {
719		LinkedBlockingQueue q = populatedQueue(SIZE);
720		String s = q.toString();
721		for (int i = 0; i < SIZE; ++i) {
722	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
722	>	assertTrue(s.contains(String.valueOf(i)));
723		}
724	<	}
768	<
724	>	}
725
726		/**
727	<	*
727	>	* offer transfers elements across Executor tasks
728		*/
729		public void testOfferInExecutor() {
774	–
730		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
776	–
731		q.add(one);
732		q.add(two);
733	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
734	+	final ExecutorService executor = Executors.newFixedThreadPool(2);
735	+	try (PoolCleaner cleaner = cleaner(executor)) {
736	+	executor.execute(new CheckedRunnable() {
737	+	public void realRun() throws InterruptedException {
738	+	assertFalse(q.offer(three));
739	+	threadsStarted.await();
740	+	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
741	+	assertEquals(0, q.remainingCapacity());
742	+	}});
743
744	<	ExecutorService executor = Executors.newFixedThreadPool(2);
745	<
746	<	executor.execute(new Runnable() {
747	<	public void run() {
748	<	threadAssertFalse(q.offer(three));
749	<	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	<
744	>	executor.execute(new CheckedRunnable() {
745	>	public void realRun() throws InterruptedException {
746	>	threadsStarted.await();
747	>	assertSame(one, q.take());
748	>	}});
749	>	}
750		}
751
752		/**
753	<	*
753	>	* timed poll retrieves elements across Executor threads
754		*/
755		public void testPollInExecutor() {
815	–
756		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
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	+	assertNull(q.poll());
763	+	threadsStarted.await();
764	+	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
765	+	checkEmpty(q);
766	+	}});
767
768	<	ExecutorService executor = Executors.newFixedThreadPool(2);
768	>	executor.execute(new CheckedRunnable() {
769	>	public void realRun() throws InterruptedException {
770	>	threadsStarted.await();
771	>	q.put(one);
772	>	}});
773	>	}
774	>	}
775
776	<	executor.execute(new Runnable() {
777	<	public void run() {
778	<	threadAssertNull(q.poll());
779	<	try {
780	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
781	<	threadAssertTrue(q.isEmpty());
826	<	}
827	<	catch (InterruptedException e) {
828	<	threadUnexpectedException();
829	<	}
830	<	}
831	<	});
776	>	/**
777	>	* A deserialized serialized queue has same elements in same order
778	>	*/
779	>	public void testSerialization() throws Exception {
780	>	Queue x = populatedQueue(SIZE);
781	>	Queue y = serialClone(x);
782
783	<	executor.execute(new Runnable() {
784	<	public void run() {
785	<	try {
786	<	Thread.sleep(SMALL_DELAY_MS);
787	<	q.put(one);
788	<	}
789	<	catch (InterruptedException e) {
790	<	threadUnexpectedException();
791	<	}
842	<	}
843	<	});
844	<
845	<	joinPool(executor);
783	>	assertNotSame(x, y);
784	>	assertEquals(x.size(), y.size());
785	>	assertEquals(x.toString(), y.toString());
786	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
787	>	while (!x.isEmpty()) {
788	>	assertFalse(y.isEmpty());
789	>	assertEquals(x.remove(), y.remove());
790	>	}
791	>	assertTrue(y.isEmpty());
792		}
793
794		/**
795	<	*
795	>	* drainTo(c) empties queue into another collection c
796		*/
797	<	public void testSerialization() {
797	>	public void testDrainTo() {
798		LinkedBlockingQueue q = populatedQueue(SIZE);
799	+	ArrayList l = new ArrayList();
800	+	q.drainTo(l);
801	+	assertEquals(0, q.size());
802	+	assertEquals(SIZE, l.size());
803	+	for (int i = 0; i < SIZE; ++i)
804	+	assertEquals(l.get(i), new Integer(i));
805	+	q.add(zero);
806	+	q.add(one);
807	+	assertFalse(q.isEmpty());
808	+	assertTrue(q.contains(zero));
809	+	assertTrue(q.contains(one));
810	+	l.clear();
811	+	q.drainTo(l);
812	+	assertEquals(0, q.size());
813	+	assertEquals(2, l.size());
814	+	for (int i = 0; i < 2; ++i)
815	+	assertEquals(l.get(i), new Integer(i));
816	+	}
817
818	<	try {
819	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
820	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
821	<	out.writeObject(q);
822	<	out.close();
818	>	/**
819	>	* drainTo empties full queue, unblocking a waiting put.
820	>	*/
821	>	public void testDrainToWithActivePut() throws InterruptedException {
822	>	final LinkedBlockingQueue q = populatedQueue(SIZE);
823	>	Thread t = new Thread(new CheckedRunnable() {
824	>	public void realRun() throws InterruptedException {
825	>	q.put(new Integer(SIZE + 1));
826	>	}});
827
828	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
829	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
830	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
831	<	assertEquals(q.size(), r.size());
832	<	while (!q.isEmpty())
833	<	assertEquals(q.remove(), r.remove());
834	<	} catch(Exception e){
835	<	unexpectedException();
828	>	t.start();
829	>	ArrayList l = new ArrayList();
830	>	q.drainTo(l);
831	>	assertTrue(l.size() >= SIZE);
832	>	for (int i = 0; i < SIZE; ++i)
833	>	assertEquals(l.get(i), new Integer(i));
834	>	t.join();
835	>	assertTrue(q.size() + l.size() >= SIZE);
836	>	}
837	>
838	>	/**
839	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
840	>	*/
841	>	public void testDrainToN() {
842	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
843	>	for (int i = 0; i < SIZE + 2; ++i) {
844	>	for (int j = 0; j < SIZE; j++)
845	>	assertTrue(q.offer(new Integer(j)));
846	>	ArrayList l = new ArrayList();
847	>	q.drainTo(l, i);
848	>	int k = (i < SIZE) ? i : SIZE;
849	>	assertEquals(k, l.size());
850	>	assertEquals(SIZE - k, q.size());
851	>	for (int j = 0; j < k; ++j)
852	>	assertEquals(l.get(j), new Integer(j));
853	>	do {} while (q.poll() != null);
854	>	}
855	>	}
856	>
857	>	/**
858	>	* remove(null), contains(null) always return false
859	>	*/
860	>	public void testNeverContainsNull() {
861	>	Collection<?>[] qs = {
862	>	new LinkedBlockingQueue<Object>(),
863	>	populatedQueue(2),
864	>	};
865	>
866	>	for (Collection<?> q : qs) {
867	>	assertFalse(q.contains(null));
868	>	assertFalse(q.remove(null));
869		}
870		}
871

Diff Legend

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