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.8 by dl, Mon Dec 29 19:05:40 2003 UTC vs.
Revision 1.68 by jsr166, Sat May 13 21:52:59 2017 UTC

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

Diff Legend

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