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

Diff Legend

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