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

Diff Legend

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