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.65 by jsr166, Mon Oct 17 01:31:30 2016 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 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	>	assertThreadStaysAlive(t);
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) {
381	<	assertEquals(i, ((Integer)q.take()).intValue());
382	<	}
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) {
381	>	assertEquals(i, q.take());
382	>	}
383
384	+	Thread.currentThread().interrupt();
385	+	try {
386	+	q.take();
387	+	shouldThrow();
388	+	} catch (InterruptedException success) {}
389	+	assertFalse(Thread.interrupted());
390	+
391	+	pleaseInterrupt.countDown();
392	+	try {
393	+	q.take();
394	+	shouldThrow();
395	+	} catch (InterruptedException success) {}
396	+	assertFalse(Thread.interrupted());
397	+	}});
398	+
399	+	await(pleaseInterrupt);
400	+	assertThreadStaysAlive(t);
401	+	t.interrupt();
402	+	awaitTermination(t);
403	+	}
404
405		/**
406		* poll succeeds unless empty
#	Line 466 | Line 408 | public class LinkedBlockingQueueTest ext
408		public void testPoll() {
409		LinkedBlockingQueue q = populatedQueue(SIZE);
410		for (int i = 0; i < SIZE; ++i) {
411	<	assertEquals(i, ((Integer)q.poll()).intValue());
411	>	assertEquals(i, q.poll());
412		}
413	<	assertNull(q.poll());
413	>	assertNull(q.poll());
414		}
415
416		/**
417	<	* timed pool with zero timeout succeeds when non-empty, else times out
417	>	* timed poll with zero timeout succeeds when non-empty, else times out
418		*/
419	<	public void testTimedPoll0() {
420	<	try {
421	<	LinkedBlockingQueue q = populatedQueue(SIZE);
422	<	for (int i = 0; i < SIZE; ++i) {
423	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
424	<	}
483	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
484	<	} catch (InterruptedException e){
485	<	unexpectedException();
486	<	}
419	>	public void testTimedPoll0() throws InterruptedException {
420	>	LinkedBlockingQueue q = populatedQueue(SIZE);
421	>	for (int i = 0; i < SIZE; ++i) {
422	>	assertEquals(i, q.poll(0, MILLISECONDS));
423	>	}
424	>	assertNull(q.poll(0, MILLISECONDS));
425		}
426
427		/**
428	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
428	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
429		*/
430	<	public void testTimedPoll() {
431	<	try {
432	<	LinkedBlockingQueue q = populatedQueue(SIZE);
433	<	for (int i = 0; i < SIZE; ++i) {
434	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
435	<	}
436	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
437	<	} catch (InterruptedException e){
438	<	unexpectedException();
439	<	}
430	>	public void testTimedPoll() throws InterruptedException {
431	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
432	>	for (int i = 0; i < SIZE; ++i) {
433	>	long startTime = System.nanoTime();
434	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
435	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
436	>	}
437	>	long startTime = System.nanoTime();
438	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
439	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
440	>	checkEmpty(q);
441		}
442
443		/**
444		* Interrupted timed poll throws InterruptedException instead of
445		* returning timeout status
446		*/
447	<	public void testInterruptedTimedPoll() {
448	<	Thread t = new Thread(new Runnable() {
449	<	public void run() {
450	<	try {
451	<	LinkedBlockingQueue q = populatedQueue(SIZE);
452	<	for (int i = 0; i < SIZE; ++i) {
453	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
454	<	}
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) { }
447	>	public void testInterruptedTimedPoll() throws InterruptedException {
448	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
449	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
450	>	Thread t = newStartedThread(new CheckedRunnable() {
451	>	public void realRun() throws InterruptedException {
452	>	long startTime = System.nanoTime();
453	>	for (int i = 0; i < SIZE; ++i) {
454	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
455		}
456	<	});
457	<	try {
458	<	t.start();
459	<	Thread.sleep(SMALL_DELAY_MS);
460	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
461	<	t.interrupt();
462	<	t.join();
463	<	} catch (Exception e){
464	<	unexpectedException();
465	<	}
466	<	}
456	>	aboutToWait.countDown();
457	>	try {
458	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
459	>	shouldThrow();
460	>	} catch (InterruptedException success) {
461	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
462	>	}
463	>	}});
464	>
465	>	await(aboutToWait);
466	>	waitForThreadToEnterWaitState(t);
467	>	t.interrupt();
468	>	awaitTermination(t);
469	>	checkEmpty(q);
470	>	}
471
472		/**
473		* peek returns next element, or null if empty
#	Line 561 | Line 475 | public class LinkedBlockingQueueTest ext
475		public void testPeek() {
476		LinkedBlockingQueue q = populatedQueue(SIZE);
477		for (int i = 0; i < SIZE; ++i) {
478	<	assertEquals(i, ((Integer)q.peek()).intValue());
479	<	q.poll();
478	>	assertEquals(i, q.peek());
479	>	assertEquals(i, q.poll());
480		assertTrue(q.peek() == null ||
481	<	i != ((Integer)q.peek()).intValue());
481	>	!q.peek().equals(i));
482		}
483	<	assertNull(q.peek());
483	>	assertNull(q.peek());
484		}
485
486		/**
#	Line 575 | Line 489 | public class LinkedBlockingQueueTest ext
489		public void testElement() {
490		LinkedBlockingQueue q = populatedQueue(SIZE);
491		for (int i = 0; i < SIZE; ++i) {
492	<	assertEquals(i, ((Integer)q.element()).intValue());
493	<	q.poll();
492	>	assertEquals(i, q.element());
493	>	assertEquals(i, q.poll());
494		}
495		try {
496		q.element();
497		shouldThrow();
498	<	}
585	<	catch (NoSuchElementException success) {}
498	>	} catch (NoSuchElementException success) {}
499		}
500
501		/**
#	Line 591 | Line 504 | public class LinkedBlockingQueueTest ext
504		public void testRemove() {
505		LinkedBlockingQueue q = populatedQueue(SIZE);
506		for (int i = 0; i < SIZE; ++i) {
507	<	assertEquals(i, ((Integer)q.remove()).intValue());
507	>	assertEquals(i, q.remove());
508		}
509		try {
510		q.remove();
511		shouldThrow();
512	<	} catch (NoSuchElementException success){
600	<	}
512	>	} catch (NoSuchElementException success) {}
513		}
514
515		/**
516	<	* remove(x) removes x and returns true if present
516	>	* An add following remove(x) succeeds
517		*/
518	<	public void testRemoveElement() {
519	<	LinkedBlockingQueue q = populatedQueue(SIZE);
520	<	for (int i = 1; i < SIZE; i+=2) {
521	<	assertTrue(q.remove(new Integer(i)));
522	<	}
523	<	for (int i = 0; i < SIZE; i+=2) {
524	<	assertTrue(q.remove(new Integer(i)));
525	<	assertFalse(q.remove(new Integer(i+1)));
614	<	}
615	<	assertTrue(q.isEmpty());
518	>	public void testRemoveElementAndAdd() throws InterruptedException {
519	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
520	>	assertTrue(q.add(new Integer(1)));
521	>	assertTrue(q.add(new Integer(2)));
522	>	assertTrue(q.remove(new Integer(1)));
523	>	assertTrue(q.remove(new Integer(2)));
524	>	assertTrue(q.add(new Integer(3)));
525	>	assertNotNull(q.take());
526		}
527	<
527	>
528		/**
529		* contains(x) reports true when elements added but not yet removed
530		*/
#	Line 638 | Line 548 | public class LinkedBlockingQueueTest ext
548		assertEquals(SIZE, q.remainingCapacity());
549		q.add(one);
550		assertFalse(q.isEmpty());
551	+	assertTrue(q.contains(one));
552		q.clear();
553		assertTrue(q.isEmpty());
554		}
#	Line 670 | Line 581 | public class LinkedBlockingQueueTest ext
581		assertTrue(changed);
582
583		assertTrue(q.containsAll(p));
584	<	assertEquals(SIZE-i, q.size());
584	>	assertEquals(SIZE - i, q.size());
585		p.remove();
586		}
587		}
#	Line 683 | Line 594 | public class LinkedBlockingQueueTest ext
594		LinkedBlockingQueue q = populatedQueue(SIZE);
595		LinkedBlockingQueue p = populatedQueue(i);
596		assertTrue(q.removeAll(p));
597	<	assertEquals(SIZE-i, q.size());
597	>	assertEquals(SIZE - i, q.size());
598		for (int j = 0; j < i; ++j) {
599	<	Integer I = (Integer)(p.remove());
600	<	assertFalse(q.contains(I));
599	>	Integer x = (Integer)(p.remove());
600	>	assertFalse(q.contains(x));
601		}
602		}
603		}
604
605		/**
606	<	* toArray contains all elements
606	>	* toArray contains all elements in FIFO order
607		*/
608		public void testToArray() {
609		LinkedBlockingQueue q = populatedQueue(SIZE);
610	<	Object[] o = q.toArray();
611	<	try {
612	<	for(int i = 0; i < o.length; i++)
702	<	assertEquals(o[i], q.take());
703	<	} catch (InterruptedException e){
704	<	unexpectedException();
705	<	}
610	>	Object[] o = q.toArray();
611	>	for (int i = 0; i < o.length; i++)
612	>	assertSame(o[i], q.poll());
613		}
614
615		/**
616	<	* toArray(a) contains all elements
616	>	* toArray(a) contains all elements in FIFO order
617		*/
618	<	public void testToArray2() {
619	<	LinkedBlockingQueue q = populatedQueue(SIZE);
620	<	Integer[] ints = new Integer[SIZE];
621	<	ints = (Integer[])q.toArray(ints);
622	<	try {
623	<	for(int i = 0; i < ints.length; i++)
624	<	assertEquals(ints[i], q.take());
718	<	} catch (InterruptedException e){
719	<	unexpectedException();
720	<	}
618	>	public void testToArray2() throws InterruptedException {
619	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
620	>	Integer[] ints = new Integer[SIZE];
621	>	Integer[] array = q.toArray(ints);
622	>	assertSame(ints, array);
623	>	for (int i = 0; i < ints.length; i++)
624	>	assertSame(ints[i], q.poll());
625		}
626
627		/**
628	<	* toArray(null) throws NPE
628	>	* toArray(incompatible array type) throws ArrayStoreException
629		*/
630	<	public void testToArray_BadArg() {
631	<	try {
632	<	LinkedBlockingQueue q = populatedQueue(SIZE);
633	<	Object o[] = q.toArray(null);
634	<	shouldThrow();
635	<	} catch(NullPointerException success){}
630	>	public void testToArray1_BadArg() {
631	>	LinkedBlockingQueue q = populatedQueue(SIZE);
632	>	try {
633	>	q.toArray(new String[10]);
634	>	shouldThrow();
635	>	} catch (ArrayStoreException success) {}
636		}
637
638		/**
639	<	* toArray with incompatible array type throws CCE
639	>	* iterator iterates through all elements
640		*/
641	<	public void testToArray1_BadArg() {
642	<	try {
643	<	LinkedBlockingQueue q = populatedQueue(SIZE);
644	<	Object o[] = q.toArray(new String[10] );
645	<	shouldThrow();
646	<	} catch(ArrayStoreException  success){}
641	>	public void testIterator() throws InterruptedException {
642	>	LinkedBlockingQueue q = populatedQueue(SIZE);
643	>	Iterator it = q.iterator();
644	>	int i;
645	>	for (i = 0; it.hasNext(); i++)
646	>	assertTrue(q.contains(it.next()));
647	>	assertEquals(i, SIZE);
648	>	assertIteratorExhausted(it);
649	>
650	>	it = q.iterator();
651	>	for (i = 0; it.hasNext(); i++)
652	>	assertEquals(it.next(), q.take());
653	>	assertEquals(i, SIZE);
654	>	assertIteratorExhausted(it);
655		}
656
745	–
657		/**
658	<	* iterator iterates through all elements
658	>	* iterator of empty collection has no elements
659		*/
660	<	public void testIterator() {
661	<	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	<	}
660	>	public void testEmptyIterator() {
661	>	assertIteratorExhausted(new LinkedBlockingQueue().iterator());
662		}
663
664		/**
665		* iterator.remove removes current element
666		*/
667	<	public void testIteratorRemove () {
667	>	public void testIteratorRemove() {
668		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
669		q.add(two);
670		q.add(one);
#	Line 770 | Line 673 | public class LinkedBlockingQueueTest ext
673		Iterator it = q.iterator();
674		it.next();
675		it.remove();
676	<
676	>
677		it = q.iterator();
678	<	assertEquals(it.next(), one);
679	<	assertEquals(it.next(), three);
678	>	assertSame(it.next(), one);
679	>	assertSame(it.next(), three);
680		assertFalse(it.hasNext());
681		}
682
780	–
683		/**
684		* iterator ordering is FIFO
685		*/
#	Line 789 | Line 691 | public class LinkedBlockingQueueTest ext
691		assertEquals(0, q.remainingCapacity());
692		int k = 0;
693		for (Iterator it = q.iterator(); it.hasNext();) {
694	<	int i = ((Integer)(it.next())).intValue();
793	<	assertEquals(++k, i);
694	>	assertEquals(++k, it.next());
695		}
696		assertEquals(3, k);
697		}
#	Line 798 | Line 699 | public class LinkedBlockingQueueTest ext
699		/**
700		* Modifications do not cause iterators to fail
701		*/
702	<	public void testWeaklyConsistentIteration () {
702	>	public void testWeaklyConsistentIteration() {
703		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
704		q.add(one);
705		q.add(two);
706		q.add(three);
707	<	try {
708	<	for (Iterator it = q.iterator(); it.hasNext();) {
709	<	q.remove();
809	<	it.next();
810	<	}
811	<	}
812	<	catch (ConcurrentModificationException e) {
813	<	unexpectedException();
707	>	for (Iterator it = q.iterator(); it.hasNext();) {
708	>	q.remove();
709	>	it.next();
710		}
711		assertEquals(0, q.size());
712		}
713
818	–
714		/**
715		* toString contains toStrings of elements
716		*/
#	Line 823 | Line 718 | public class LinkedBlockingQueueTest ext
718		LinkedBlockingQueue q = populatedQueue(SIZE);
719		String s = q.toString();
720		for (int i = 0; i < SIZE; ++i) {
721	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
721	>	assertTrue(s.contains(String.valueOf(i)));
722		}
723	<	}
829	<
723	>	}
724
725		/**
726		* offer transfers elements across Executor tasks
#	Line 835 | Line 729 | public class LinkedBlockingQueueTest ext
729		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
730		q.add(one);
731		q.add(two);
732	<	ExecutorService executor = Executors.newFixedThreadPool(2);
733	<	executor.execute(new Runnable() {
734	<	public void run() {
735	<	threadAssertFalse(q.offer(three));
736	<	try {
737	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
738	<	threadAssertEquals(0, q.remainingCapacity());
739	<	}
740	<	catch (InterruptedException e) {
741	<	threadUnexpectedException();
848	<	}
849	<	}
850	<	});
732	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
733	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
734	>	try (PoolCleaner cleaner = cleaner(executor)) {
735	>	executor.execute(new CheckedRunnable() {
736	>	public void realRun() throws InterruptedException {
737	>	assertFalse(q.offer(three));
738	>	threadsStarted.await();
739	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
740	>	assertEquals(0, q.remainingCapacity());
741	>	}});
742
743	<	executor.execute(new Runnable() {
744	<	public void run() {
745	<	try {
746	<	Thread.sleep(SMALL_DELAY_MS);
747	<	threadAssertEquals(one, q.take());
748	<	}
858	<	catch (InterruptedException e) {
859	<	threadUnexpectedException();
860	<	}
861	<	}
862	<	});
863	<
864	<	joinPool(executor);
743	>	executor.execute(new CheckedRunnable() {
744	>	public void realRun() throws InterruptedException {
745	>	threadsStarted.await();
746	>	assertSame(one, q.take());
747	>	}});
748	>	}
749		}
750
751		/**
752	<	* poll retrieves elements across Executor threads
752	>	* timed poll retrieves elements across Executor threads
753		*/
754		public void testPollInExecutor() {
755		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
756	<	ExecutorService executor = Executors.newFixedThreadPool(2);
757	<	executor.execute(new Runnable() {
758	<	public void run() {
759	<	threadAssertNull(q.poll());
760	<	try {
761	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
762	<	threadAssertTrue(q.isEmpty());
763	<	}
764	<	catch (InterruptedException e) {
765	<	threadUnexpectedException();
882	<	}
883	<	}
884	<	});
756	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
757	>	final ExecutorService executor = Executors.newFixedThreadPool(2);
758	>	try (PoolCleaner cleaner = cleaner(executor)) {
759	>	executor.execute(new CheckedRunnable() {
760	>	public void realRun() throws InterruptedException {
761	>	assertNull(q.poll());
762	>	threadsStarted.await();
763	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
764	>	checkEmpty(q);
765	>	}});
766
767	<	executor.execute(new Runnable() {
768	<	public void run() {
769	<	try {
889	<	Thread.sleep(SMALL_DELAY_MS);
767	>	executor.execute(new CheckedRunnable() {
768	>	public void realRun() throws InterruptedException {
769	>	threadsStarted.await();
770		q.put(one);
771	<	}
772	<	catch (InterruptedException e) {
893	<	threadUnexpectedException();
894	<	}
895	<	}
896	<	});
897	<
898	<	joinPool(executor);
771	>	}});
772	>	}
773		}
774
775		/**
776		* A deserialized serialized queue has same elements in same order
777		*/
778	<	public void testSerialization() {
779	<	LinkedBlockingQueue q = populatedQueue(SIZE);
780	<
781	<	try {
782	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
783	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
784	<	out.writeObject(q);
785	<	out.close();
786	<
787	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
788	<	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) {
778	>	public void testSerialization() throws Exception {
779	>	Queue x = populatedQueue(SIZE);
780	>	Queue y = serialClone(x);
781	>
782	>	assertNotSame(x, y);
783	>	assertEquals(x.size(), y.size());
784	>	assertEquals(x.toString(), y.toString());
785	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
786	>	while (!x.isEmpty()) {
787	>	assertFalse(y.isEmpty());
788	>	assertEquals(x.remove(), y.remove());
789		}
790	+	assertTrue(y.isEmpty());
791		}
792
793		/**
794		* drainTo(c) empties queue into another collection c
795	<	*/
795	>	*/
796		public void testDrainTo() {
797		LinkedBlockingQueue q = populatedQueue(SIZE);
798		ArrayList l = new ArrayList();
799		q.drainTo(l);
800	<	assertEquals(q.size(), 0);
801	<	assertEquals(l.size(), SIZE);
802	<	for (int i = 0; i < SIZE; ++i)
800	>	assertEquals(0, q.size());
801	>	assertEquals(SIZE, l.size());
802	>	for (int i = 0; i < SIZE; ++i)
803	>	assertEquals(l.get(i), new Integer(i));
804	>	q.add(zero);
805	>	q.add(one);
806	>	assertFalse(q.isEmpty());
807	>	assertTrue(q.contains(zero));
808	>	assertTrue(q.contains(one));
809	>	l.clear();
810	>	q.drainTo(l);
811	>	assertEquals(0, q.size());
812	>	assertEquals(2, l.size());
813	>	for (int i = 0; i < 2; ++i)
814		assertEquals(l.get(i), new Integer(i));
815		}
816
817		/**
818		* drainTo empties full queue, unblocking a waiting put.
819	<	*/
820	<	public void testDrainToWithActivePut() {
819	>	*/
820	>	public void testDrainToWithActivePut() throws InterruptedException {
821		final LinkedBlockingQueue q = populatedQueue(SIZE);
822	<	Thread t = new Thread(new Runnable() {
823	<	public void run() {
824	<	try {
825	<	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	<	}
822	>	Thread t = new Thread(new CheckedRunnable() {
823	>	public void realRun() throws InterruptedException {
824	>	q.put(new Integer(SIZE + 1));
825	>	}});
826
827	<	/**
828	<	* drainTo(null, n) throws NPE
829	<	*/
830	<	public void testDrainToNullN() {
831	<	LinkedBlockingQueue q = populatedQueue(SIZE);
832	<	try {
833	<	q.drainTo(null, 0);
834	<	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	<	}
827	>	t.start();
828	>	ArrayList l = new ArrayList();
829	>	q.drainTo(l);
830	>	assertTrue(l.size() >= SIZE);
831	>	for (int i = 0; i < SIZE; ++i)
832	>	assertEquals(l.get(i), new Integer(i));
833	>	t.join();
834	>	assertTrue(q.size() + l.size() >= SIZE);
835		}
836
837		/**
838	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
839	<	*/
838	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
839	>	*/
840		public void testDrainToN() {
841	+	LinkedBlockingQueue q = new LinkedBlockingQueue();
842		for (int i = 0; i < SIZE + 2; ++i) {
843	<	LinkedBlockingQueue q = populatedQueue(SIZE);
843	>	for (int j = 0; j < SIZE; j++)
844	>	assertTrue(q.offer(new Integer(j)));
845		ArrayList l = new ArrayList();
846		q.drainTo(l, i);
847	<	int k = (i < SIZE)? i : SIZE;
848	<	assertEquals(q.size(), SIZE-k);
849	<	assertEquals(l.size(), k);
850	<	for (int j = 0; j < k; ++j)
847	>	int k = (i < SIZE) ? i : SIZE;
848	>	assertEquals(k, l.size());
849	>	assertEquals(SIZE - k, q.size());
850	>	for (int j = 0; j < k; ++j)
851		assertEquals(l.get(j), new Integer(j));
852	+	do {} while (q.poll() != null);
853	+	}
854	+	}
855	+
856	+	/**
857	+	* remove(null), contains(null) always return false
858	+	*/
859	+	public void testNeverContainsNull() {
860	+	Collection<?>[] qs = {
861	+	new LinkedBlockingQueue<Object>(),
862	+	populatedQueue(2),
863	+	};
864	+
865	+	for (Collection<?> q : qs) {
866	+	assertFalse(q.contains(null));
867	+	assertFalse(q.remove(null));
868		}
869		}
870

Diff Legend

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