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.6 by dl, Sun Oct 5 23:00:40 2003 UTC vs.
Revision 1.64 by jsr166, Sun Oct 16 20:44:18 2016 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	>	return newTestSuite(LinkedBlockingQueueTest.class,
45	>	new Unbounded().testSuite(),
46	>	new Bounded().testSuite());
47		}
48
23	–
49		/**
50	<	* Create a queue of given size containing consecutive
51	<	* Integers 0 ... n.
50	>	* Returns a new queue of given size containing consecutive
51	>	* Integers 0 ... n - 1.
52		*/
53	<	private LinkedBlockingQueue populatedQueue(int n) {
54	<	LinkedBlockingQueue q = new LinkedBlockingQueue(n);
53	>	private LinkedBlockingQueue<Integer> populatedQueue(int n) {
54	>	LinkedBlockingQueue<Integer> q =
55	>	new LinkedBlockingQueue<Integer>(n);
56		assertTrue(q.isEmpty());
57	<	for(int i = 0; i < n; i++)
58	<	assertTrue(q.offer(new Integer(i)));
57	>	for (int i = 0; i < n; i++)
58	>	assertTrue(q.offer(new Integer(i)));
59		assertFalse(q.isEmpty());
60		assertEquals(0, q.remainingCapacity());
61	<	assertEquals(n, q.size());
61	>	assertEquals(n, q.size());
62	>	assertEquals((Integer) 0, q.peek());
63		return q;
64		}
65	<
65	>
66		/**
67		* A new queue has the indicated capacity, or Integer.MAX_VALUE if
68		* none given
#	Line 46 | Line 73 | public class LinkedBlockingQueueTest ext
73		}
74
75		/**
76	<	* Constructor throws IAE if  capacity argument nonpositive
76	>	* Constructor throws IllegalArgumentException if capacity argument nonpositive
77		*/
78		public void testConstructor2() {
79		try {
80	<	LinkedBlockingQueue q = new LinkedBlockingQueue(0);
80	>	new LinkedBlockingQueue(0);
81		shouldThrow();
82	<	}
56	<	catch (IllegalArgumentException success) {}
82	>	} catch (IllegalArgumentException success) {}
83		}
84
85		/**
86	<	* Initializing from null Collection throws NPE
86	>	* Initializing from null Collection throws NullPointerException
87		*/
88		public void testConstructor3() {
89		try {
90	<	LinkedBlockingQueue q = new LinkedBlockingQueue(null);
90	>	new LinkedBlockingQueue(null);
91		shouldThrow();
92	<	}
67	<	catch (NullPointerException success) {}
92	>	} catch (NullPointerException success) {}
93		}
94
95		/**
96	<	* Initializing from Collection of null elements throws NPE
96	>	* Initializing from Collection of null elements throws NullPointerException
97		*/
98		public void testConstructor4() {
99	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
100		try {
101	<	Integer[] ints = new Integer[SIZE];
76	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
101	>	new LinkedBlockingQueue(elements);
102		shouldThrow();
103	<	}
79	<	catch (NullPointerException success) {}
103	>	} catch (NullPointerException success) {}
104		}
105
106		/**
107	<	* Initializing from Collection with some null elements throws NPE
107	>	* Initializing from Collection with some null elements throws
108	>	* NullPointerException
109		*/
110		public void testConstructor5() {
111	+	Integer[] ints = new Integer[SIZE];
112	+	for (int i = 0; i < SIZE - 1; ++i)
113	+	ints[i] = new Integer(i);
114	+	Collection<Integer> elements = Arrays.asList(ints);
115		try {
116	<	Integer[] ints = new Integer[SIZE];
88	<	for (int i = 0; i < SIZE-1; ++i)
89	<	ints[i] = new Integer(i);
90	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
116	>	new LinkedBlockingQueue(elements);
117		shouldThrow();
118	<	}
93	<	catch (NullPointerException success) {}
118	>	} catch (NullPointerException success) {}
119		}
120
121		/**
122		* Queue contains all elements of collection used to initialize
123		*/
124		public void testConstructor6() {
125	<	try {
126	<	Integer[] ints = new Integer[SIZE];
127	<	for (int i = 0; i < SIZE; ++i)
128	<	ints[i] = new Integer(i);
129	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
130	<	for (int i = 0; i < SIZE; ++i)
106	<	assertEquals(ints[i], q.poll());
107	<	}
108	<	finally {}
125	>	Integer[] ints = new Integer[SIZE];
126	>	for (int i = 0; i < SIZE; ++i)
127	>	ints[i] = new Integer(i);
128	>	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
129	>	for (int i = 0; i < SIZE; ++i)
130	>	assertEquals(ints[i], q.poll());
131		}
132
133		/**
#	Line 127 | Line 149 | public class LinkedBlockingQueueTest ext
149		* remainingCapacity decreases on add, increases on remove
150		*/
151		public void testRemainingCapacity() {
152	<	LinkedBlockingQueue q = populatedQueue(SIZE);
152	>	BlockingQueue q = populatedQueue(SIZE);
153		for (int i = 0; i < SIZE; ++i) {
154		assertEquals(i, q.remainingCapacity());
155	<	assertEquals(SIZE-i, q.size());
156	<	q.remove();
155	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
156	>	assertEquals(i, q.remove());
157		}
158		for (int i = 0; i < SIZE; ++i) {
159	<	assertEquals(SIZE-i, q.remainingCapacity());
160	<	assertEquals(i, q.size());
161	<	q.add(new Integer(i));
159	>	assertEquals(SIZE - i, q.remainingCapacity());
160	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
161	>	assertTrue(q.add(i));
162		}
163		}
164
165		/**
144	–	* offer(null) throws NPE
145	–	*/
146	–	public void testOfferNull() {
147	–	try {
148	–	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
149	–	q.offer(null);
150	–	shouldThrow();
151	–	} catch (NullPointerException success) { }
152	–	}
153	–
154	–	/**
155	–	* add(null) throws NPE
156	–	*/
157	–	public void testAddNull() {
158	–	try {
159	–	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
160	–	q.add(null);
161	–	shouldThrow();
162	–	} catch (NullPointerException success) { }
163	–	}
164	–
165	–	/**
166		* Offer succeeds if not full; fails if full
167		*/
168		public void testOffer() {
#	Line 172 | Line 172 | public class LinkedBlockingQueueTest ext
172		}
173
174		/**
175	<	* add succeeds if not full; throws ISE if full
175	>	* add succeeds if not full; throws IllegalStateException if full
176		*/
177		public void testAdd() {
178	<	try {
179	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
180	<	for (int i = 0; i < SIZE; ++i) {
181	<	assertTrue(q.add(new Integer(i)));
182	<	}
183	<	assertEquals(0, q.remainingCapacity());
184	<	q.add(new Integer(SIZE));
185	<	} catch (IllegalStateException success){
186	<	}
187	<	}
188	<
189	<	/**
190	<	* addAll(null) throws NPE
191	<	*/
192	<	public void testAddAll1() {
178	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
179	>	for (int i = 0; i < SIZE; ++i)
180	>	assertTrue(q.add(new Integer(i)));
181	>	assertEquals(0, q.remainingCapacity());
182		try {
183	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
195	<	q.addAll(null);
183	>	q.add(new Integer(SIZE));
184		shouldThrow();
185	<	}
198	<	catch (NullPointerException success) {}
185	>	} catch (IllegalStateException success) {}
186		}
187
188		/**
189	<	* addAll(this) throws IAE
189	>	* addAll(this) throws IllegalArgumentException
190		*/
191		public void testAddAllSelf() {
192	+	LinkedBlockingQueue q = populatedQueue(SIZE);
193		try {
206	–	LinkedBlockingQueue q = populatedQueue(SIZE);
194		q.addAll(q);
195		shouldThrow();
196	<	}
210	<	catch (IllegalArgumentException success) {}
196	>	} catch (IllegalArgumentException success) {}
197		}
198
199		/**
214	–	* addAll of a collection with null elements throws NPE
215	–	*/
216	–	public void testAddAll2() {
217	–	try {
218	–	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
219	–	Integer[] ints = new Integer[SIZE];
220	–	q.addAll(Arrays.asList(ints));
221	–	shouldThrow();
222	–	}
223	–	catch (NullPointerException success) {}
224	–	}
225	–	/**
200		* addAll of a collection with any null elements throws NPE after
201		* possibly adding some elements
202		*/
203		public void testAddAll3() {
204	+	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
205	+	Integer[] ints = new Integer[SIZE];
206	+	for (int i = 0; i < SIZE - 1; ++i)
207	+	ints[i] = new Integer(i);
208	+	Collection<Integer> elements = Arrays.asList(ints);
209		try {
210	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
232	<	Integer[] ints = new Integer[SIZE];
233	<	for (int i = 0; i < SIZE-1; ++i)
234	<	ints[i] = new Integer(i);
235	<	q.addAll(Arrays.asList(ints));
210	>	q.addAll(elements);
211		shouldThrow();
212	<	}
238	<	catch (NullPointerException success) {}
212	>	} catch (NullPointerException success) {}
213		}
214	+
215		/**
216	<	* addAll throws ISE if not enough room
216	>	* addAll throws IllegalStateException if not enough room
217		*/
218		public void testAddAll4() {
219	+	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1);
220	+	Integer[] ints = new Integer[SIZE];
221	+	for (int i = 0; i < SIZE; ++i)
222	+	ints[i] = new Integer(i);
223	+	Collection<Integer> elements = Arrays.asList(ints);
224		try {
225	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
246	<	Integer[] ints = new Integer[SIZE];
247	<	for (int i = 0; i < SIZE; ++i)
248	<	ints[i] = new Integer(i);
249	<	q.addAll(Arrays.asList(ints));
225	>	q.addAll(elements);
226		shouldThrow();
227	<	}
252	<	catch (IllegalStateException success) {}
227	>	} catch (IllegalStateException success) {}
228		}
229	+
230		/**
231		* Queue contains all elements, in traversal order, of successful addAll
232		*/
233		public void testAddAll5() {
234	<	try {
235	<	Integer[] empty = new Integer[0];
236	<	Integer[] ints = new Integer[SIZE];
237	<	for (int i = 0; i < SIZE; ++i)
238	<	ints[i] = new Integer(i);
239	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
240	<	assertFalse(q.addAll(Arrays.asList(empty)));
241	<	assertTrue(q.addAll(Arrays.asList(ints)));
242	<	for (int i = 0; i < SIZE; ++i)
267	<	assertEquals(ints[i], q.poll());
268	<	}
269	<	finally {}
234	>	Integer[] empty = new Integer[0];
235	>	Integer[] ints = new Integer[SIZE];
236	>	for (int i = 0; i < SIZE; ++i)
237	>	ints[i] = new Integer(i);
238	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
239	>	assertFalse(q.addAll(Arrays.asList(empty)));
240	>	assertTrue(q.addAll(Arrays.asList(ints)));
241	>	for (int i = 0; i < SIZE; ++i)
242	>	assertEquals(ints[i], q.poll());
243		}
244
245		/**
273	–	* put(null) throws NPE
274	–	*/
275	–	public void testPutNull() {
276	–	try {
277	–	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
278	–	q.put(null);
279	–	shouldThrow();
280	–	}
281	–	catch (NullPointerException success){
282	–	}
283	–	catch (InterruptedException ie) {
284	–	unexpectedException();
285	–	}
286	–	}
287	–
288	–	/**
246		* all elements successfully put are contained
247		*/
248	<	public void testPut() {
249	<	try {
250	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
251	<	for (int i = 0; i < SIZE; ++i) {
252	<	Integer I = new Integer(i);
253	<	q.put(I);
297	<	assertTrue(q.contains(I));
298	<	}
299	<	assertEquals(0, q.remainingCapacity());
300	<	}
301	<	catch (InterruptedException ie) {
302	<	unexpectedException();
248	>	public void testPut() throws InterruptedException {
249	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
250	>	for (int i = 0; i < SIZE; ++i) {
251	>	Integer x = new Integer(i);
252	>	q.put(x);
253	>	assertTrue(q.contains(x));
254		}
255	+	assertEquals(0, q.remainingCapacity());
256		}
257
258		/**
259		* put blocks interruptibly if full
260		*/
261	<	public void testBlockingPut() {
262	<	Thread t = new Thread(new Runnable() {
263	<	public void run() {
264	<	int added = 0;
265	<	try {
266	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
267	<	for (int i = 0; i < SIZE; ++i) {
268	<	q.put(new Integer(i));
269	<	++added;
270	<	}
271	<	q.put(new Integer(SIZE));
272	<	threadShouldThrow();
273	<	} catch (InterruptedException ie){
274	<	threadAssertEquals(added, SIZE);
275	<	}
276	<	}});
277	<	t.start();
278	<	try {
279	<	Thread.sleep(SHORT_DELAY_MS);
280	<	t.interrupt();
281	<	t.join();
282	<	}
283	<	catch (InterruptedException ie) {
284	<	unexpectedException();
285	<	}
261	>	public void testBlockingPut() throws InterruptedException {
262	>	final LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
263	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
264	>	Thread t = newStartedThread(new CheckedRunnable() {
265	>	public void realRun() throws InterruptedException {
266	>	for (int i = 0; i < SIZE; ++i)
267	>	q.put(i);
268	>	assertEquals(SIZE, q.size());
269	>	assertEquals(0, q.remainingCapacity());
270	>
271	>	Thread.currentThread().interrupt();
272	>	try {
273	>	q.put(99);
274	>	shouldThrow();
275	>	} catch (InterruptedException success) {}
276	>	assertFalse(Thread.interrupted());
277	>
278	>	pleaseInterrupt.countDown();
279	>	try {
280	>	q.put(99);
281	>	shouldThrow();
282	>	} catch (InterruptedException success) {}
283	>	assertFalse(Thread.interrupted());
284	>	}});
285	>
286	>	await(pleaseInterrupt);
287	>	assertThreadStaysAlive(t);
288	>	t.interrupt();
289	>	awaitTermination(t);
290	>	assertEquals(SIZE, q.size());
291	>	assertEquals(0, q.remainingCapacity());
292		}
293
294		/**
295	<	* put blocks waiting for take when full
295	>	* put blocks interruptibly waiting for take when full
296		*/
297	<	public void testPutWithTake() {
297	>	public void testPutWithTake() throws InterruptedException {
298	>	final int capacity = 2;
299		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
300	<	Thread t = new Thread(new Runnable() {
301	<	public void run() {
302	<	int added = 0;
303	<	try {
304	<	q.put(new Object());
305	<	++added;
306	<	q.put(new Object());
307	<	++added;
308	<	q.put(new Object());
309	<	++added;
310	<	q.put(new Object());
311	<	++added;
312	<	threadShouldThrow();
313	<	} catch (InterruptedException e){
314	<	threadAssertTrue(added >= 2);
315	<	}
316	<	}
317	<	});
318	<	try {
319	<	t.start();
320	<	Thread.sleep(SHORT_DELAY_MS);
321	<	q.take();
322	<	t.interrupt();
323	<	t.join();
324	<	} catch (Exception e){
325	<	unexpectedException();
367	<	}
300	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
301	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
302	>	Thread t = newStartedThread(new CheckedRunnable() {
303	>	public void realRun() throws InterruptedException {
304	>	for (int i = 0; i < capacity; i++)
305	>	q.put(i);
306	>	pleaseTake.countDown();
307	>	q.put(86);
308	>
309	>	pleaseInterrupt.countDown();
310	>	try {
311	>	q.put(99);
312	>	shouldThrow();
313	>	} catch (InterruptedException success) {}
314	>	assertFalse(Thread.interrupted());
315	>	}});
316	>
317	>	await(pleaseTake);
318	>	assertEquals(0, q.remainingCapacity());
319	>	assertEquals(0, q.take());
320	>
321	>	await(pleaseInterrupt);
322	>	assertThreadStaysAlive(t);
323	>	t.interrupt();
324	>	awaitTermination(t);
325	>	assertEquals(0, q.remainingCapacity());
326		}
327
328		/**
#	Line 372 | Line 330 | public class LinkedBlockingQueueTest ext
330		*/
331		public void testTimedOffer() {
332		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
333	<	Thread t = new Thread(new Runnable() {
334	<	public void run() {
335	<	try {
336	<	q.put(new Object());
337	<	q.put(new Object());
338	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
339	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
340	<	threadShouldThrow();
341	<	} catch (InterruptedException success){}
342	<	}
343	<	});
344	<
345	<	try {
346	<	t.start();
347	<	Thread.sleep(SMALL_DELAY_MS);
348	<	t.interrupt();
349	<	t.join();
350	<	} catch (Exception e){
351	<	unexpectedException();
394	<	}
333	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
334	>	Thread t = newStartedThread(new CheckedRunnable() {
335	>	public void realRun() throws InterruptedException {
336	>	q.put(new Object());
337	>	q.put(new Object());
338	>	long startTime = System.nanoTime();
339	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
340	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
341	>	pleaseInterrupt.countDown();
342	>	try {
343	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
344	>	shouldThrow();
345	>	} catch (InterruptedException success) {}
346	>	}});
347	>
348	>	await(pleaseInterrupt);
349	>	assertThreadStaysAlive(t);
350	>	t.interrupt();
351	>	awaitTermination(t);
352		}
353
354		/**
355		* take retrieves elements in FIFO order
356		*/
357	<	public void testTake() {
358	<	try {
359	<	LinkedBlockingQueue q = populatedQueue(SIZE);
360	<	for (int i = 0; i < SIZE; ++i) {
404	<	assertEquals(i, ((Integer)q.take()).intValue());
405	<	}
406	<	} catch (InterruptedException e){
407	<	unexpectedException();
408	<	}
409	<	}
410	<
411	<	/**
412	<	* take blocks interruptibly when empty
413	<	*/
414	<	public void testTakeFromEmpty() {
415	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
416	<	Thread t = new Thread(new Runnable() {
417	<	public void run() {
418	<	try {
419	<	q.take();
420	<	threadShouldThrow();
421	<	} catch (InterruptedException success){ }
422	<	}
423	<	});
424	<	try {
425	<	t.start();
426	<	Thread.sleep(SHORT_DELAY_MS);
427	<	t.interrupt();
428	<	t.join();
429	<	} catch (Exception e){
430	<	unexpectedException();
357	>	public void testTake() throws InterruptedException {
358	>	LinkedBlockingQueue q = populatedQueue(SIZE);
359	>	for (int i = 0; i < SIZE; ++i) {
360	>	assertEquals(i, q.take());
361		}
362		}
363
364		/**
365		* Take removes existing elements until empty, then blocks interruptibly
366		*/
367	<	public void testBlockingTake() {
368	<	Thread t = new Thread(new Runnable() {
369	<	public void run() {
370	<	try {
371	<	LinkedBlockingQueue q = populatedQueue(SIZE);
372	<	for (int i = 0; i < SIZE; ++i) {
373	<	assertEquals(i, ((Integer)q.take()).intValue());
374	<	}
445	<	q.take();
446	<	threadShouldThrow();
447	<	} catch (InterruptedException success){
448	<	}
449	<	}});
450	<	t.start();
451	<	try {
452	<	Thread.sleep(SHORT_DELAY_MS);
453	<	t.interrupt();
454	<	t.join();
455	<	}
456	<	catch (InterruptedException ie) {
457	<	unexpectedException();
458	<	}
459	<	}
367	>	public void testBlockingTake() throws InterruptedException {
368	>	final BlockingQueue q = populatedQueue(SIZE);
369	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
370	>	Thread t = newStartedThread(new CheckedRunnable() {
371	>	public void realRun() throws InterruptedException {
372	>	for (int i = 0; i < SIZE; ++i) {
373	>	assertEquals(i, q.take());
374	>	}
375
376	+	Thread.currentThread().interrupt();
377	+	try {
378	+	q.take();
379	+	shouldThrow();
380	+	} catch (InterruptedException success) {}
381	+	assertFalse(Thread.interrupted());
382	+
383	+	pleaseInterrupt.countDown();
384	+	try {
385	+	q.take();
386	+	shouldThrow();
387	+	} catch (InterruptedException success) {}
388	+	assertFalse(Thread.interrupted());
389	+	}});
390	+
391	+	await(pleaseInterrupt);
392	+	assertThreadStaysAlive(t);
393	+	t.interrupt();
394	+	awaitTermination(t);
395	+	}
396
397		/**
398		* poll succeeds unless empty
#	Line 465 | Line 400 | public class LinkedBlockingQueueTest ext
400		public void testPoll() {
401		LinkedBlockingQueue q = populatedQueue(SIZE);
402		for (int i = 0; i < SIZE; ++i) {
403	<	assertEquals(i, ((Integer)q.poll()).intValue());
403	>	assertEquals(i, q.poll());
404		}
405	<	assertNull(q.poll());
405	>	assertNull(q.poll());
406		}
407
408		/**
409	<	* timed pool with zero timeout succeeds when non-empty, else times out
409	>	* timed poll with zero timeout succeeds when non-empty, else times out
410		*/
411	<	public void testTimedPoll0() {
412	<	try {
413	<	LinkedBlockingQueue q = populatedQueue(SIZE);
414	<	for (int i = 0; i < SIZE; ++i) {
415	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
416	<	}
482	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
483	<	} catch (InterruptedException e){
484	<	unexpectedException();
485	<	}
411	>	public void testTimedPoll0() throws InterruptedException {
412	>	LinkedBlockingQueue q = populatedQueue(SIZE);
413	>	for (int i = 0; i < SIZE; ++i) {
414	>	assertEquals(i, q.poll(0, MILLISECONDS));
415	>	}
416	>	assertNull(q.poll(0, MILLISECONDS));
417		}
418
419		/**
420	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
420	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
421		*/
422	<	public void testTimedPoll() {
423	<	try {
424	<	LinkedBlockingQueue q = populatedQueue(SIZE);
425	<	for (int i = 0; i < SIZE; ++i) {
426	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
427	<	}
428	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
429	<	} catch (InterruptedException e){
430	<	unexpectedException();
431	<	}
422	>	public void testTimedPoll() throws InterruptedException {
423	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
424	>	for (int i = 0; i < SIZE; ++i) {
425	>	long startTime = System.nanoTime();
426	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
427	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
428	>	}
429	>	long startTime = System.nanoTime();
430	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
431	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
432	>	checkEmpty(q);
433		}
434
435		/**
436		* Interrupted timed poll throws InterruptedException instead of
437		* returning timeout status
438		*/
439	<	public void testInterruptedTimedPoll() {
440	<	Thread t = new Thread(new Runnable() {
441	<	public void run() {
442	<	try {
443	<	LinkedBlockingQueue q = populatedQueue(SIZE);
444	<	for (int i = 0; i < SIZE; ++i) {
445	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
446	<	}
515	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
516	<	} catch (InterruptedException success){
517	<	}
518	<	}});
519	<	t.start();
520	<	try {
521	<	Thread.sleep(SHORT_DELAY_MS);
522	<	t.interrupt();
523	<	t.join();
524	<	}
525	<	catch (InterruptedException ie) {
526	<	unexpectedException();
527	<	}
528	<	}
529	<
530	<	/**
531	<	*  timed poll before a delayed offer fails; after offer succeeds;
532	<	*  on interruption throws
533	<	*/
534	<	public void testTimedPollWithOffer() {
535	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
536	<	Thread t = new Thread(new Runnable() {
537	<	public void run() {
538	<	try {
539	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
540	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
541	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
542	<	threadShouldThrow();
543	<	} catch (InterruptedException success) { }
439	>	public void testInterruptedTimedPoll() throws InterruptedException {
440	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
441	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
442	>	Thread t = newStartedThread(new CheckedRunnable() {
443	>	public void realRun() throws InterruptedException {
444	>	long startTime = System.nanoTime();
445	>	for (int i = 0; i < SIZE; ++i) {
446	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
447		}
448	<	});
449	<	try {
450	<	t.start();
451	<	Thread.sleep(SMALL_DELAY_MS);
452	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
453	<	t.interrupt();
454	<	t.join();
455	<	} catch (Exception e){
456	<	unexpectedException();
457	<	}
458	<	}
448	>	aboutToWait.countDown();
449	>	try {
450	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
451	>	shouldThrow();
452	>	} catch (InterruptedException success) {
453	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
454	>	}
455	>	}});
456	>
457	>	await(aboutToWait);
458	>	waitForThreadToEnterWaitState(t);
459	>	t.interrupt();
460	>	awaitTermination(t);
461	>	checkEmpty(q);
462	>	}
463
464		/**
465		* peek returns next element, or null if empty
#	Line 560 | Line 467 | public class LinkedBlockingQueueTest ext
467		public void testPeek() {
468		LinkedBlockingQueue q = populatedQueue(SIZE);
469		for (int i = 0; i < SIZE; ++i) {
470	<	assertEquals(i, ((Integer)q.peek()).intValue());
471	<	q.poll();
470	>	assertEquals(i, q.peek());
471	>	assertEquals(i, q.poll());
472		assertTrue(q.peek() == null ||
473	<	i != ((Integer)q.peek()).intValue());
473	>	!q.peek().equals(i));
474		}
475	<	assertNull(q.peek());
475	>	assertNull(q.peek());
476		}
477
478		/**
#	Line 574 | Line 481 | public class LinkedBlockingQueueTest ext
481		public void testElement() {
482		LinkedBlockingQueue q = populatedQueue(SIZE);
483		for (int i = 0; i < SIZE; ++i) {
484	<	assertEquals(i, ((Integer)q.element()).intValue());
485	<	q.poll();
484	>	assertEquals(i, q.element());
485	>	assertEquals(i, q.poll());
486		}
487		try {
488		q.element();
489		shouldThrow();
490	<	}
584	<	catch (NoSuchElementException success) {}
490	>	} catch (NoSuchElementException success) {}
491		}
492
493		/**
#	Line 590 | Line 496 | public class LinkedBlockingQueueTest ext
496		public void testRemove() {
497		LinkedBlockingQueue q = populatedQueue(SIZE);
498		for (int i = 0; i < SIZE; ++i) {
499	<	assertEquals(i, ((Integer)q.remove()).intValue());
499	>	assertEquals(i, q.remove());
500		}
501		try {
502		q.remove();
503		shouldThrow();
504	<	} catch (NoSuchElementException success){
599	<	}
504	>	} catch (NoSuchElementException success) {}
505		}
506
507		/**
508	<	* remove(x) removes x and returns true if present
508	>	* An add following remove(x) succeeds
509		*/
510	<	public void testRemoveElement() {
511	<	LinkedBlockingQueue q = populatedQueue(SIZE);
512	<	for (int i = 1; i < SIZE; i+=2) {
513	<	assertTrue(q.remove(new Integer(i)));
514	<	}
515	<	for (int i = 0; i < SIZE; i+=2) {
516	<	assertTrue(q.remove(new Integer(i)));
517	<	assertFalse(q.remove(new Integer(i+1)));
613	<	}
614	<	assertTrue(q.isEmpty());
510	>	public void testRemoveElementAndAdd() throws InterruptedException {
511	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
512	>	assertTrue(q.add(new Integer(1)));
513	>	assertTrue(q.add(new Integer(2)));
514	>	assertTrue(q.remove(new Integer(1)));
515	>	assertTrue(q.remove(new Integer(2)));
516	>	assertTrue(q.add(new Integer(3)));
517	>	assertNotNull(q.take());
518		}
519	<
519	>
520		/**
521		* contains(x) reports true when elements added but not yet removed
522		*/
#	Line 637 | Line 540 | public class LinkedBlockingQueueTest ext
540		assertEquals(SIZE, q.remainingCapacity());
541		q.add(one);
542		assertFalse(q.isEmpty());
543	+	assertTrue(q.contains(one));
544		q.clear();
545		assertTrue(q.isEmpty());
546		}
#	Line 669 | Line 573 | public class LinkedBlockingQueueTest ext
573		assertTrue(changed);
574
575		assertTrue(q.containsAll(p));
576	<	assertEquals(SIZE-i, q.size());
576	>	assertEquals(SIZE - i, q.size());
577		p.remove();
578		}
579		}
#	Line 682 | Line 586 | public class LinkedBlockingQueueTest ext
586		LinkedBlockingQueue q = populatedQueue(SIZE);
587		LinkedBlockingQueue p = populatedQueue(i);
588		assertTrue(q.removeAll(p));
589	<	assertEquals(SIZE-i, q.size());
589	>	assertEquals(SIZE - i, q.size());
590		for (int j = 0; j < i; ++j) {
591	<	Integer I = (Integer)(p.remove());
592	<	assertFalse(q.contains(I));
591	>	Integer x = (Integer)(p.remove());
592	>	assertFalse(q.contains(x));
593		}
594		}
595		}
596
597		/**
598	<	* toArray contains all elements
598	>	* toArray contains all elements in FIFO order
599		*/
600		public void testToArray() {
601		LinkedBlockingQueue q = populatedQueue(SIZE);
602	<	Object[] o = q.toArray();
603	<	try {
604	<	for(int i = 0; i < o.length; i++)
701	<	assertEquals(o[i], q.take());
702	<	} catch (InterruptedException e){
703	<	unexpectedException();
704	<	}
602	>	Object[] o = q.toArray();
603	>	for (int i = 0; i < o.length; i++)
604	>	assertSame(o[i], q.poll());
605		}
606
607		/**
608	<	* toArray(a) contains all elements
608	>	* toArray(a) contains all elements in FIFO order
609		*/
610	<	public void testToArray2() {
611	<	LinkedBlockingQueue q = populatedQueue(SIZE);
612	<	Integer[] ints = new Integer[SIZE];
613	<	ints = (Integer[])q.toArray(ints);
614	<	try {
615	<	for(int i = 0; i < ints.length; i++)
616	<	assertEquals(ints[i], q.take());
717	<	} catch (InterruptedException e){
718	<	unexpectedException();
719	<	}
610	>	public void testToArray2() throws InterruptedException {
611	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
612	>	Integer[] ints = new Integer[SIZE];
613	>	Integer[] array = q.toArray(ints);
614	>	assertSame(ints, array);
615	>	for (int i = 0; i < ints.length; i++)
616	>	assertSame(ints[i], q.poll());
617		}
618
619		/**
620	<	* toArray(null) throws NPE
620	>	* toArray(incompatible array type) throws ArrayStoreException
621		*/
622	<	public void testToArray_BadArg() {
623	<	try {
624	<	LinkedBlockingQueue q = populatedQueue(SIZE);
625	<	Object o[] = q.toArray(null);
626	<	shouldThrow();
627	<	} catch(NullPointerException success){}
622	>	public void testToArray1_BadArg() {
623	>	LinkedBlockingQueue q = populatedQueue(SIZE);
624	>	try {
625	>	q.toArray(new String[10]);
626	>	shouldThrow();
627	>	} catch (ArrayStoreException success) {}
628		}
629
630		/**
631	<	* toArray with incompatable array type throws CCE
631	>	* iterator iterates through all elements
632		*/
633	<	public void testToArray1_BadArg() {
634	<	try {
635	<	LinkedBlockingQueue q = populatedQueue(SIZE);
636	<	Object o[] = q.toArray(new String[10] );
637	<	shouldThrow();
638	<	} catch(ArrayStoreException  success){}
633	>	public void testIterator() throws InterruptedException {
634	>	LinkedBlockingQueue q = populatedQueue(SIZE);
635	>	Iterator it = q.iterator();
636	>	int i;
637	>	for (i = 0; it.hasNext(); i++)
638	>	assertTrue(q.contains(it.next()));
639	>	assertEquals(i, SIZE);
640	>	assertIteratorExhausted(it);
641	>
642	>	it = q.iterator();
643	>	for (i = 0; it.hasNext(); i++)
644	>	assertEquals(it.next(), q.take());
645	>	assertEquals(i, SIZE);
646	>	assertIteratorExhausted(it);
647		}
648
744	–
649		/**
650	<	* iterator iterates through all elements
650	>	* iterator of empty collection has no elements
651		*/
652	<	public void testIterator() {
653	<	LinkedBlockingQueue q = populatedQueue(SIZE);
750	<	Iterator it = q.iterator();
751	<	try {
752	<	while(it.hasNext()){
753	<	assertEquals(it.next(), q.take());
754	<	}
755	<	} catch (InterruptedException e){
756	<	unexpectedException();
757	<	}
652	>	public void testEmptyIterator() {
653	>	assertIteratorExhausted(new LinkedBlockingQueue().iterator());
654		}
655
656		/**
657		* iterator.remove removes current element
658		*/
659	<	public void testIteratorRemove () {
659	>	public void testIteratorRemove() {
660		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
661		q.add(two);
662		q.add(one);
#	Line 769 | Line 665 | public class LinkedBlockingQueueTest ext
665		Iterator it = q.iterator();
666		it.next();
667		it.remove();
668	<
668	>
669		it = q.iterator();
670	<	assertEquals(it.next(), one);
671	<	assertEquals(it.next(), three);
670	>	assertSame(it.next(), one);
671	>	assertSame(it.next(), three);
672		assertFalse(it.hasNext());
673		}
674
779	–
675		/**
676		* iterator ordering is FIFO
677		*/
#	Line 788 | Line 683 | public class LinkedBlockingQueueTest ext
683		assertEquals(0, q.remainingCapacity());
684		int k = 0;
685		for (Iterator it = q.iterator(); it.hasNext();) {
686	<	int i = ((Integer)(it.next())).intValue();
792	<	assertEquals(++k, i);
686	>	assertEquals(++k, it.next());
687		}
688		assertEquals(3, k);
689		}
#	Line 797 | Line 691 | public class LinkedBlockingQueueTest ext
691		/**
692		* Modifications do not cause iterators to fail
693		*/
694	<	public void testWeaklyConsistentIteration () {
694	>	public void testWeaklyConsistentIteration() {
695		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
696		q.add(one);
697		q.add(two);
698		q.add(three);
699	<	try {
700	<	for (Iterator it = q.iterator(); it.hasNext();) {
701	<	q.remove();
808	<	it.next();
809	<	}
810	<	}
811	<	catch (ConcurrentModificationException e) {
812	<	unexpectedException();
699	>	for (Iterator it = q.iterator(); it.hasNext();) {
700	>	q.remove();
701	>	it.next();
702		}
703		assertEquals(0, q.size());
704		}
705
817	–
706		/**
707		* toString contains toStrings of elements
708		*/
#	Line 822 | Line 710 | public class LinkedBlockingQueueTest ext
710		LinkedBlockingQueue q = populatedQueue(SIZE);
711		String s = q.toString();
712		for (int i = 0; i < SIZE; ++i) {
713	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
713	>	assertTrue(s.contains(String.valueOf(i)));
714		}
715	<	}
828	<
715	>	}
716
717		/**
718		* offer transfers elements across Executor tasks
#	Line 834 | Line 721 | public class LinkedBlockingQueueTest ext
721		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
722		q.add(one);
723		q.add(two);
724	<	ExecutorService executor = Executors.newFixedThreadPool(2);
725	<	executor.execute(new Runnable() {
726	<	public void run() {
727	<	threadAssertFalse(q.offer(three));
728	<	try {
729	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
730	<	threadAssertEquals(0, q.remainingCapacity());
731	<	}
732	<	catch (InterruptedException e) {
733	<	threadUnexpectedException();
847	<	}
848	<	}
849	<	});
724	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
725	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
726	>	try (PoolCleaner cleaner = cleaner(executor)) {
727	>	executor.execute(new CheckedRunnable() {
728	>	public void realRun() throws InterruptedException {
729	>	assertFalse(q.offer(three));
730	>	threadsStarted.await();
731	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
732	>	assertEquals(0, q.remainingCapacity());
733	>	}});
734
735	<	executor.execute(new Runnable() {
736	<	public void run() {
737	<	try {
738	<	Thread.sleep(SMALL_DELAY_MS);
739	<	threadAssertEquals(one, q.take());
740	<	}
857	<	catch (InterruptedException e) {
858	<	threadUnexpectedException();
859	<	}
860	<	}
861	<	});
862	<
863	<	joinPool(executor);
735	>	executor.execute(new CheckedRunnable() {
736	>	public void realRun() throws InterruptedException {
737	>	threadsStarted.await();
738	>	assertSame(one, q.take());
739	>	}});
740	>	}
741		}
742
743		/**
744	<	* poll retrieves elements across Executor threads
744	>	* timed poll retrieves elements across Executor threads
745		*/
746		public void testPollInExecutor() {
747		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
748	<	ExecutorService executor = Executors.newFixedThreadPool(2);
749	<	executor.execute(new Runnable() {
750	<	public void run() {
751	<	threadAssertNull(q.poll());
752	<	try {
753	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
754	<	threadAssertTrue(q.isEmpty());
755	<	}
756	<	catch (InterruptedException e) {
757	<	threadUnexpectedException();
881	<	}
882	<	}
883	<	});
748	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
749	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
750	>	try (PoolCleaner cleaner = cleaner(executor)) {
751	>	executor.execute(new CheckedRunnable() {
752	>	public void realRun() throws InterruptedException {
753	>	assertNull(q.poll());
754	>	threadsStarted.await();
755	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
756	>	checkEmpty(q);
757	>	}});
758
759	<	executor.execute(new Runnable() {
760	<	public void run() {
761	<	try {
888	<	Thread.sleep(SMALL_DELAY_MS);
759	>	executor.execute(new CheckedRunnable() {
760	>	public void realRun() throws InterruptedException {
761	>	threadsStarted.await();
762		q.put(one);
763	<	}
764	<	catch (InterruptedException e) {
892	<	threadUnexpectedException();
893	<	}
894	<	}
895	<	});
896	<
897	<	joinPool(executor);
763	>	}});
764	>	}
765		}
766
767		/**
768		* A deserialized serialized queue has same elements in same order
769		*/
770	<	public void testSerialization() {
771	<	LinkedBlockingQueue q = populatedQueue(SIZE);
772	<
773	<	try {
774	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
775	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
776	<	out.writeObject(q);
777	<	out.close();
778	<
779	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
780	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
914	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
915	<	assertEquals(q.size(), r.size());
916	<	while (!q.isEmpty())
917	<	assertEquals(q.remove(), r.remove());
918	<	} catch(Exception e){
919	<	unexpectedException();
920	<	}
921	<	}
922	<
923	<	/**
924	<	* drainTo(null) throws NPE
925	<	*/
926	<	public void testDrainToNull() {
927	<	LinkedBlockingQueue q = populatedQueue(SIZE);
928	<	try {
929	<	q.drainTo(null);
930	<	shouldThrow();
931	<	} catch(NullPointerException success) {
932	<	}
933	<	}
934	<
935	<	/**
936	<	* drainTo(this) throws IAE
937	<	*/
938	<	public void testDrainToSelf() {
939	<	LinkedBlockingQueue q = populatedQueue(SIZE);
940	<	try {
941	<	q.drainTo(q);
942	<	shouldThrow();
943	<	} catch(IllegalArgumentException success) {
770	>	public void testSerialization() throws Exception {
771	>	Queue x = populatedQueue(SIZE);
772	>	Queue y = serialClone(x);
773	>
774	>	assertNotSame(x, y);
775	>	assertEquals(x.size(), y.size());
776	>	assertEquals(x.toString(), y.toString());
777	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
778	>	while (!x.isEmpty()) {
779	>	assertFalse(y.isEmpty());
780	>	assertEquals(x.remove(), y.remove());
781		}
782	+	assertTrue(y.isEmpty());
783		}
784
785		/**
786		* drainTo(c) empties queue into another collection c
787	<	*/
787	>	*/
788		public void testDrainTo() {
789		LinkedBlockingQueue q = populatedQueue(SIZE);
790		ArrayList l = new ArrayList();
791		q.drainTo(l);
792	<	assertEquals(q.size(), 0);
793	<	assertEquals(l.size(), SIZE);
794	<	for (int i = 0; i < SIZE; ++i)
792	>	assertEquals(0, q.size());
793	>	assertEquals(SIZE, l.size());
794	>	for (int i = 0; i < SIZE; ++i)
795	>	assertEquals(l.get(i), new Integer(i));
796	>	q.add(zero);
797	>	q.add(one);
798	>	assertFalse(q.isEmpty());
799	>	assertTrue(q.contains(zero));
800	>	assertTrue(q.contains(one));
801	>	l.clear();
802	>	q.drainTo(l);
803	>	assertEquals(0, q.size());
804	>	assertEquals(2, l.size());
805	>	for (int i = 0; i < 2; ++i)
806		assertEquals(l.get(i), new Integer(i));
807		}
808
809		/**
810		* drainTo empties full queue, unblocking a waiting put.
811	<	*/
812	<	public void testDrainToWithActivePut() {
811	>	*/
812	>	public void testDrainToWithActivePut() throws InterruptedException {
813		final LinkedBlockingQueue q = populatedQueue(SIZE);
814	<	Thread t = new Thread(new Runnable() {
815	<	public void run() {
816	<	try {
817	<	q.put(new Integer(SIZE+1));
969	<	} catch (InterruptedException ie){
970	<	threadUnexpectedException();
971	<	}
972	<	}
973	<	});
974	<	try {
975	<	t.start();
976	<	ArrayList l = new ArrayList();
977	<	q.drainTo(l);
978	<	assertTrue(l.size() >= SIZE);
979	<	for (int i = 0; i < SIZE; ++i)
980	<	assertEquals(l.get(i), new Integer(i));
981	<	t.join();
982	<	assertTrue(q.size() + l.size() == SIZE+1);
983	<	} catch(Exception e){
984	<	unexpectedException();
985	<	}
986	<	}
814	>	Thread t = new Thread(new CheckedRunnable() {
815	>	public void realRun() throws InterruptedException {
816	>	q.put(new Integer(SIZE + 1));
817	>	}});
818
819	<	/**
820	<	* drainTo(null, n) throws NPE
821	<	*/
822	<	public void testDrainToNullN() {
823	<	LinkedBlockingQueue q = populatedQueue(SIZE);
824	<	try {
825	<	q.drainTo(null, 0);
826	<	shouldThrow();
996	<	} catch(NullPointerException success) {
997	<	}
998	<	}
999	<
1000	<	/**
1001	<	* drainTo(this, n) throws IAE
1002	<	*/
1003	<	public void testDrainToSelfN() {
1004	<	LinkedBlockingQueue q = populatedQueue(SIZE);
1005	<	try {
1006	<	q.drainTo(q, 0);
1007	<	shouldThrow();
1008	<	} catch(IllegalArgumentException success) {
1009	<	}
819	>	t.start();
820	>	ArrayList l = new ArrayList();
821	>	q.drainTo(l);
822	>	assertTrue(l.size() >= SIZE);
823	>	for (int i = 0; i < SIZE; ++i)
824	>	assertEquals(l.get(i), new Integer(i));
825	>	t.join();
826	>	assertTrue(q.size() + l.size() >= SIZE);
827		}
828
829		/**
830	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
831	<	*/
830	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
831	>	*/
832		public void testDrainToN() {
833	+	LinkedBlockingQueue q = new LinkedBlockingQueue();
834		for (int i = 0; i < SIZE + 2; ++i) {
835	<	LinkedBlockingQueue q = populatedQueue(SIZE);
835	>	for (int j = 0; j < SIZE; j++)
836	>	assertTrue(q.offer(new Integer(j)));
837		ArrayList l = new ArrayList();
838		q.drainTo(l, i);
839	<	int k = (i < SIZE)? i : SIZE;
840	<	assertEquals(q.size(), SIZE-k);
841	<	assertEquals(l.size(), k);
842	<	for (int j = 0; j < k; ++j)
839	>	int k = (i < SIZE) ? i : SIZE;
840	>	assertEquals(k, l.size());
841	>	assertEquals(SIZE - k, q.size());
842	>	for (int j = 0; j < k; ++j)
843		assertEquals(l.get(j), new Integer(j));
844	+	do {} while (q.poll() != null);
845	+	}
846	+	}
847	+
848	+	/**
849	+	* remove(null), contains(null) always return false
850	+	*/
851	+	public void testNeverContainsNull() {
852	+	Collection<?>[] qs = {
853	+	new LinkedBlockingQueue<Object>(),
854	+	populatedQueue(2),
855	+	};
856	+
857	+	for (Collection<?> q : qs) {
858	+	assertFalse(q.contains(null));
859	+	assertFalse(q.remove(null));
860		}
861		}
862

Diff Legend

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