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

Diff Legend

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