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.3 by dl, Sun Sep 14 20:42:40 2003 UTC vs.
Revision 1.48 by jsr166, Sat Nov 26 05:19:17 2011 UTC

#	Line 1 | Line 1
1		/*
2	<	* Written by members of JCP JSR-166 Expert Group and released to the
3	<	* public domain. Use, modify, and redistribute this code in any way
4	<	* without acknowledgement. Other contributors include Andrew Wright,
5	<	* Jeffrey Hayes, Pat Fischer, Mike Judd.
2	>	* Written by Doug Lea with assistance from members of JCP JSR-166
3	>	* Expert Group and released to the public domain, as explained at
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5	>	* Other contributors include Andrew Wright, Jeffrey Hayes,
6	>	* Pat Fisher, Mike Judd.
7		*/
8
9		import junit.framework.*;
10	<	import java.util.*;
11	<	import java.util.concurrent.*;
12	<	import java.io.*;
10	>	import java.util.Arrays;
11	>	import java.util.ArrayList;
12	>	import java.util.Collection;
13	>	import java.util.Iterator;
14	>	import java.util.NoSuchElementException;
15	>	import java.util.Queue;
16	>	import java.util.concurrent.BlockingQueue;
17	>	import java.util.concurrent.CountDownLatch;
18	>	import java.util.concurrent.LinkedBlockingQueue;
19	>	import java.util.concurrent.Executors;
20	>	import java.util.concurrent.ExecutorService;
21	>	import static java.util.concurrent.TimeUnit.MILLISECONDS;
22
23		public class LinkedBlockingQueueTest extends JSR166TestCase {
24
25	+	public static class Unbounded extends BlockingQueueTest {
26	+	protected BlockingQueue emptyCollection() {
27	+	return new LinkedBlockingQueue();
28	+	}
29	+	}
30	+
31	+	public static class Bounded extends BlockingQueueTest {
32	+	protected BlockingQueue emptyCollection() {
33	+	return new LinkedBlockingQueue(SIZE);
34	+	}
35	+	}
36	+
37		public static void main(String[] args) {
38	<	junit.textui.TestRunner.run (suite());
38	>	junit.textui.TestRunner.run(suite());
39		}
40
41		public static Test suite() {
42	<	return new TestSuite(LinkedBlockingQueueTest.class);
42	>	return newTestSuite(LinkedBlockingQueueTest.class,
43	>	new Unbounded().testSuite(),
44	>	new Bounded().testSuite());
45		}
46
23	–
47		/**
48		* Create a queue of given size containing consecutive
49		* Integers 0 ... n.
50		*/
51	<	private LinkedBlockingQueue populatedQueue(int n) {
52	<	LinkedBlockingQueue q = new LinkedBlockingQueue(n);
51	>	private LinkedBlockingQueue<Integer> populatedQueue(int n) {
52	>	LinkedBlockingQueue<Integer> q =
53	>	new LinkedBlockingQueue<Integer>(n);
54		assertTrue(q.isEmpty());
55	<	for(int i = 0; i < n; i++)
56	<	assertTrue(q.offer(new Integer(i)));
55	>	for (int i = 0; i < n; i++)
56	>	assertTrue(q.offer(new Integer(i)));
57		assertFalse(q.isEmpty());
58		assertEquals(0, q.remainingCapacity());
59	<	assertEquals(n, q.size());
59	>	assertEquals(n, q.size());
60		return q;
61		}
62	<
63	<	public void testConstructor1(){
62	>
63	>	/**
64	>	* A new queue has the indicated capacity, or Integer.MAX_VALUE if
65	>	* none given
66	>	*/
67	>	public void testConstructor1() {
68		assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity());
69	+	assertEquals(Integer.MAX_VALUE, new LinkedBlockingQueue().remainingCapacity());
70		}
71
72	<	public void testConstructor2(){
72	>	/**
73	>	* Constructor throws IllegalArgumentException if capacity argument nonpositive
74	>	*/
75	>	public void testConstructor2() {
76		try {
77	<	LinkedBlockingQueue q = new LinkedBlockingQueue(0);
78	<	fail("Cannot make zero-sized");
79	<	}
48	<	catch (IllegalArgumentException success) {}
77	>	new LinkedBlockingQueue(0);
78	>	shouldThrow();
79	>	} catch (IllegalArgumentException success) {}
80		}
81
82	<	public void testConstructor3(){
83	<
82	>	/**
83	>	* Initializing from null Collection throws NullPointerException
84	>	*/
85	>	public void testConstructor3() {
86		try {
87	<	LinkedBlockingQueue q = new LinkedBlockingQueue(null);
88	<	fail("Cannot make from null collection");
89	<	}
57	<	catch (NullPointerException success) {}
87	>	new LinkedBlockingQueue(null);
88	>	shouldThrow();
89	>	} catch (NullPointerException success) {}
90		}
91
92	<	public void testConstructor4(){
92	>	/**
93	>	* Initializing from Collection of null elements throws NullPointerException
94	>	*/
95	>	public void testConstructor4() {
96	>	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
97		try {
98	<	Integer[] ints = new Integer[SIZE];
99	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
100	<	fail("Cannot make with null elements");
65	<	}
66	<	catch (NullPointerException success) {}
98	>	new LinkedBlockingQueue(elements);
99	>	shouldThrow();
100	>	} catch (NullPointerException success) {}
101		}
102
103	<	public void testConstructor5(){
104	<	try {
105	<	Integer[] ints = new Integer[SIZE];
106	<	for (int i = 0; i < SIZE-1; ++i)
107	<	ints[i] = new Integer(i);
108	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
109	<	fail("Cannot make with null elements");
110	<	}
111	<	catch (NullPointerException success) {}
103	>	/**
104	>	* Initializing from Collection with some null elements throws
105	>	* NullPointerException
106	>	*/
107	>	public void testConstructor5() {
108	>	Integer[] ints = new Integer[SIZE];
109	>	for (int i = 0; i < SIZE-1; ++i)
110	>	ints[i] = new Integer(i);
111	>	Collection<Integer> elements = Arrays.asList(ints);
112	>	try {
113	>	new LinkedBlockingQueue(elements);
114	>	shouldThrow();
115	>	} catch (NullPointerException success) {}
116		}
117
118	<	public void testConstructor6(){
119	<	try {
120	<	Integer[] ints = new Integer[SIZE];
121	<	for (int i = 0; i < SIZE; ++i)
122	<	ints[i] = new Integer(i);
123	<	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
124	<	for (int i = 0; i < SIZE; ++i)
125	<	assertEquals(ints[i], q.poll());
126	<	}
127	<	finally {}
118	>	/**
119	>	* Queue contains all elements of collection used to initialize
120	>	*/
121	>	public void testConstructor6() {
122	>	Integer[] ints = new Integer[SIZE];
123	>	for (int i = 0; i < SIZE; ++i)
124	>	ints[i] = new Integer(i);
125	>	LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints));
126	>	for (int i = 0; i < SIZE; ++i)
127	>	assertEquals(ints[i], q.poll());
128		}
129
130	+	/**
131	+	* Queue transitions from empty to full when elements added
132	+	*/
133		public void testEmptyFull() {
134		LinkedBlockingQueue q = new LinkedBlockingQueue(2);
135		assertTrue(q.isEmpty());
#	Line 97 | Line 138 | public class LinkedBlockingQueueTest ext
138		assertFalse(q.isEmpty());
139		q.add(two);
140		assertFalse(q.isEmpty());
141	<	assertEquals("queue should be full", 0, q.remainingCapacity());
142	<	assertFalse("offer should be rejected", q.offer(three));
141	>	assertEquals(0, q.remainingCapacity());
142	>	assertFalse(q.offer(three));
143		}
144
145	<	public void testRemainingCapacity(){
145	>	/**
146	>	* remainingCapacity decreases on add, increases on remove
147	>	*/
148	>	public void testRemainingCapacity() {
149		LinkedBlockingQueue q = populatedQueue(SIZE);
150		for (int i = 0; i < SIZE; ++i) {
151		assertEquals(i, q.remainingCapacity());
#	Line 115 | Line 159 | public class LinkedBlockingQueueTest ext
159		}
160		}
161
162	<	public void testOfferNull(){
163	<	try {
164	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
165	<	q.offer(null);
122	<	fail("should throw NPE");
123	<	} catch (NullPointerException success) { }
124	<	}
125	<
126	<	public void testOffer(){
162	>	/**
163	>	* Offer succeeds if not full; fails if full
164	>	*/
165	>	public void testOffer() {
166		LinkedBlockingQueue q = new LinkedBlockingQueue(1);
167		assertTrue(q.offer(zero));
168		assertFalse(q.offer(one));
169		}
170
171	<	public void testAdd(){
172	<	try {
173	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
174	<	for (int i = 0; i < SIZE; ++i) {
175	<	assertTrue(q.add(new Integer(i)));
176	<	}
177	<	assertEquals(0, q.remainingCapacity());
171	>	/**
172	>	* add succeeds if not full; throws IllegalStateException if full
173	>	*/
174	>	public void testAdd() {
175	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
176	>	for (int i = 0; i < SIZE; ++i)
177	>	assertTrue(q.add(new Integer(i)));
178	>	assertEquals(0, q.remainingCapacity());
179	>	try {
180		q.add(new Integer(SIZE));
181	<	} catch (IllegalStateException success){
182	<	}
181	>	shouldThrow();
182	>	} catch (IllegalStateException success) {}
183		}
184
185	<	public void testAddAll1(){
185	>	/**
186	>	* addAll(this) throws IllegalArgumentException
187	>	*/
188	>	public void testAddAllSelf() {
189	>	LinkedBlockingQueue q = populatedQueue(SIZE);
190		try {
191	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
192	<	q.addAll(null);
193	<	fail("Cannot add null collection");
149	<	}
150	<	catch (NullPointerException success) {}
151	<	}
152	<	public void testAddAll2(){
153	<	try {
154	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
155	<	Integer[] ints = new Integer[SIZE];
156	<	q.addAll(Arrays.asList(ints));
157	<	fail("Cannot add null elements");
158	<	}
159	<	catch (NullPointerException success) {}
160	<	}
161	<	public void testAddAll3(){
162	<	try {
163	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
164	<	Integer[] ints = new Integer[SIZE];
165	<	for (int i = 0; i < SIZE-1; ++i)
166	<	ints[i] = new Integer(i);
167	<	q.addAll(Arrays.asList(ints));
168	<	fail("Cannot add null elements");
169	<	}
170	<	catch (NullPointerException success) {}
171	<	}
172	<	public void testAddAll4(){
173	<	try {
174	<	LinkedBlockingQueue q = new LinkedBlockingQueue(1);
175	<	Integer[] ints = new Integer[SIZE];
176	<	for (int i = 0; i < SIZE; ++i)
177	<	ints[i] = new Integer(i);
178	<	q.addAll(Arrays.asList(ints));
179	<	fail("Cannot add with insufficient capacity");
180	<	}
181	<	catch (IllegalStateException success) {}
182	<	}
183	<	public void testAddAll5(){
184	<	try {
185	<	Integer[] empty = new Integer[0];
186	<	Integer[] ints = new Integer[SIZE];
187	<	for (int i = 0; i < SIZE; ++i)
188	<	ints[i] = new Integer(i);
189	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
190	<	assertFalse(q.addAll(Arrays.asList(empty)));
191	<	assertTrue(q.addAll(Arrays.asList(ints)));
192	<	for (int i = 0; i < SIZE; ++i)
193	<	assertEquals(ints[i], q.poll());
194	<	}
195	<	finally {}
196	<	}
197	<
198	<	public void testPutNull() {
199	<	try {
200	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
201	<	q.put(null);
202	<	fail("put should throw NPE");
203	<	}
204	<	catch (NullPointerException success){
205	<	}
206	<	catch (InterruptedException ie) {
207	<	fail("Unexpected exception");
208	<	}
209	<	}
210	<
211	<	public void testPut() {
212	<	try {
213	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
214	<	for (int i = 0; i < SIZE; ++i) {
215	<	Integer I = new Integer(i);
216	<	q.put(I);
217	<	assertTrue(q.contains(I));
218	<	}
219	<	assertEquals(0, q.remainingCapacity());
220	<	}
221	<	catch (InterruptedException ie) {
222	<	fail("Unexpected exception");
223	<	}
224	<	}
225	<
226	<	public void testBlockingPut(){
227	<	Thread t = new Thread(new Runnable() {
228	<	public void run() {
229	<	int added = 0;
230	<	try {
231	<	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
232	<	for (int i = 0; i < SIZE; ++i) {
233	<	q.put(new Integer(i));
234	<	++added;
235	<	}
236	<	q.put(new Integer(SIZE));
237	<	threadFail("put should block");
238	<	} catch (InterruptedException ie){
239	<	threadAssertEquals(added, SIZE);
240	<	}
241	<	}});
242	<	t.start();
243	<	try {
244	<	Thread.sleep(SHORT_DELAY_MS);
245	<	t.interrupt();
246	<	t.join();
247	<	}
248	<	catch (InterruptedException ie) {
249	<	fail("Unexpected exception");
250	<	}
191	>	q.addAll(q);
192	>	shouldThrow();
193	>	} catch (IllegalArgumentException success) {}
194		}
195
196	<	public void testPutWithTake() {
197	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
198	<	Thread t = new Thread(new Runnable() {
199	<	public void run(){
200	<	int added = 0;
201	<	try {
202	<	q.put(new Object());
203	<	++added;
204	<	q.put(new Object());
205	<	++added;
206	<	q.put(new Object());
207	<	++added;
208	<	q.put(new Object());
209	<	++added;
267	<	threadFail("Should block");
268	<	} catch (InterruptedException e){
269	<	threadAssertTrue(added >= 2);
270	<	}
271	<	}
272	<	});
273	<	try {
274	<	t.start();
275	<	Thread.sleep(SHORT_DELAY_MS);
276	<	q.take();
277	<	t.interrupt();
278	<	t.join();
279	<	} catch (Exception e){
280	<	fail("Unexpected exception");
281	<	}
196	>	/**
197	>	* addAll of a collection with any null elements throws NPE after
198	>	* possibly adding some elements
199	>	*/
200	>	public void testAddAll3() {
201	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
202	>	Integer[] ints = new Integer[SIZE];
203	>	for (int i = 0; i < SIZE-1; ++i)
204	>	ints[i] = new Integer(i);
205	>	Collection<Integer> elements = Arrays.asList(ints);
206	>	try {
207	>	q.addAll(elements);
208	>	shouldThrow();
209	>	} catch (NullPointerException success) {}
210		}
211
212	<	public void testTimedOffer() {
213	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
214	<	Thread t = new Thread(new Runnable() {
215	<	public void run(){
216	<	try {
217	<	q.put(new Object());
218	<	q.put(new Object());
219	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
220	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
221	<	threadFail("Should block");
222	<	} catch (InterruptedException success){}
223	<	}
224	<	});
297	<
298	<	try {
299	<	t.start();
300	<	Thread.sleep(SMALL_DELAY_MS);
301	<	t.interrupt();
302	<	t.join();
303	<	} catch (Exception e){
304	<	fail("Unexpected exception");
305	<	}
212	>	/**
213	>	* addAll throws IllegalStateException if not enough room
214	>	*/
215	>	public void testAddAll4() {
216	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1);
217	>	Integer[] ints = new Integer[SIZE];
218	>	for (int i = 0; i < SIZE; ++i)
219	>	ints[i] = new Integer(i);
220	>	Collection<Integer> elements = Arrays.asList(ints);
221	>	try {
222	>	q.addAll(elements);
223	>	shouldThrow();
224	>	} catch (IllegalStateException success) {}
225		}
226
227	<	public void testTake(){
228	<	try {
229	<	LinkedBlockingQueue q = populatedQueue(SIZE);
230	<	for (int i = 0; i < SIZE; ++i) {
231	<	assertEquals(i, ((Integer)q.take()).intValue());
232	<	}
233	<	} catch (InterruptedException e){
234	<	fail("Unexpected exception");
235	<	}
227	>	/**
228	>	* Queue contains all elements, in traversal order, of successful addAll
229	>	*/
230	>	public void testAddAll5() {
231	>	Integer[] empty = new Integer[0];
232	>	Integer[] ints = new Integer[SIZE];
233	>	for (int i = 0; i < SIZE; ++i)
234	>	ints[i] = new Integer(i);
235	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
236	>	assertFalse(q.addAll(Arrays.asList(empty)));
237	>	assertTrue(q.addAll(Arrays.asList(ints)));
238	>	for (int i = 0; i < SIZE; ++i)
239	>	assertEquals(ints[i], q.poll());
240		}
241
242	<	public void testTakeFromEmpty() {
243	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
244	<	Thread t = new Thread(new Runnable() {
245	<	public void run(){
246	<	try {
247	<	q.take();
248	<	threadFail("Should block");
249	<	} catch (InterruptedException success){ }
250	<	}
328	<	});
329	<	try {
330	<	t.start();
331	<	Thread.sleep(SHORT_DELAY_MS);
332	<	t.interrupt();
333	<	t.join();
334	<	} catch (Exception e){
335	<	fail("Unexpected exception");
242	>	/**
243	>	* all elements successfully put are contained
244	>	*/
245	>	public void testPut() throws InterruptedException {
246	>	LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
247	>	for (int i = 0; i < SIZE; ++i) {
248	>	Integer I = new Integer(i);
249	>	q.put(I);
250	>	assertTrue(q.contains(I));
251		}
252	+	assertEquals(0, q.remainingCapacity());
253		}
254
255	<	public void testBlockingTake(){
256	<	Thread t = new Thread(new Runnable() {
257	<	public void run() {
258	<	try {
259	<	LinkedBlockingQueue q = populatedQueue(SIZE);
260	<	for (int i = 0; i < SIZE; ++i) {
261	<	assertEquals(i, ((Integer)q.take()).intValue());
262	<	}
263	<	q.take();
264	<	threadFail("take should block");
265	<	} catch (InterruptedException success){
266	<	}
267	<	}});
268	<	t.start();
269	<	try {
270	<	Thread.sleep(SHORT_DELAY_MS);
271	<	t.interrupt();
272	<	t.join();
273	<	}
274	<	catch (InterruptedException ie) {
275	<	fail("Unexpected exception");
276	<	}
255	>	/**
256	>	* put blocks interruptibly if full
257	>	*/
258	>	public void testBlockingPut() throws InterruptedException {
259	>	final LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE);
260	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
261	>	Thread t = newStartedThread(new CheckedRunnable() {
262	>	public void realRun() throws InterruptedException {
263	>	for (int i = 0; i < SIZE; ++i)
264	>	q.put(i);
265	>	assertEquals(SIZE, q.size());
266	>	assertEquals(0, q.remainingCapacity());
267	>
268	>	Thread.currentThread().interrupt();
269	>	try {
270	>	q.put(99);
271	>	shouldThrow();
272	>	} catch (InterruptedException success) {}
273	>	assertFalse(Thread.interrupted());
274	>
275	>	pleaseInterrupt.countDown();
276	>	try {
277	>	q.put(99);
278	>	shouldThrow();
279	>	} catch (InterruptedException success) {}
280	>	assertFalse(Thread.interrupted());
281	>	}});
282	>
283	>	await(pleaseInterrupt);
284	>	assertThreadStaysAlive(t);
285	>	t.interrupt();
286	>	awaitTermination(t);
287	>	assertEquals(SIZE, q.size());
288	>	assertEquals(0, q.remainingCapacity());
289		}
290
291	+	/**
292	+	* put blocks interruptibly waiting for take when full
293	+	*/
294	+	public void testPutWithTake() throws InterruptedException {
295	+	final int capacity = 2;
296	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
297	+	final CountDownLatch pleaseTake = new CountDownLatch(1);
298	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
299	+	Thread t = newStartedThread(new CheckedRunnable() {
300	+	public void realRun() throws InterruptedException {
301	+	for (int i = 0; i < capacity; i++)
302	+	q.put(i);
303	+	pleaseTake.countDown();
304	+	q.put(86);
305	+
306	+	pleaseInterrupt.countDown();
307	+	try {
308	+	q.put(99);
309	+	shouldThrow();
310	+	} catch (InterruptedException success) {}
311	+	assertFalse(Thread.interrupted());
312	+	}});
313	+
314	+	await(pleaseTake);
315	+	assertEquals(0, q.remainingCapacity());
316	+	assertEquals(0, q.take());
317	+
318	+	await(pleaseInterrupt);
319	+	assertThreadStaysAlive(t);
320	+	t.interrupt();
321	+	awaitTermination(t);
322	+	assertEquals(0, q.remainingCapacity());
323	+	}
324	+
325	+	/**
326	+	* timed offer times out if full and elements not taken
327	+	*/
328	+	public void testTimedOffer() {
329	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
330	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
331	+	Thread t = newStartedThread(new CheckedRunnable() {
332	+	public void realRun() throws InterruptedException {
333	+	q.put(new Object());
334	+	q.put(new Object());
335	+	long startTime = System.nanoTime();
336	+	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
337	+	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
338	+	pleaseInterrupt.countDown();
339	+	try {
340	+	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
341	+	shouldThrow();
342	+	} catch (InterruptedException success) {}
343	+	}});
344	+
345	+	await(pleaseInterrupt);
346	+	assertThreadStaysAlive(t);
347	+	t.interrupt();
348	+	awaitTermination(t);
349	+	}
350
351	<	public void testPoll(){
351	>	/**
352	>	* take retrieves elements in FIFO order
353	>	*/
354	>	public void testTake() throws InterruptedException {
355		LinkedBlockingQueue q = populatedQueue(SIZE);
356		for (int i = 0; i < SIZE; ++i) {
357	<	assertEquals(i, ((Integer)q.poll()).intValue());
357	>	assertEquals(i, q.take());
358		}
369	–	assertNull(q.poll());
359		}
360
361	<	public void testTimedPoll0() {
362	<	try {
363	<	LinkedBlockingQueue q = populatedQueue(SIZE);
364	<	for (int i = 0; i < SIZE; ++i) {
365	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
366	<	}
367	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
368	<	} catch (InterruptedException e){
369	<	fail("Unexpected exception");
370	<	}
361	>	/**
362	>	* Take removes existing elements until empty, then blocks interruptibly
363	>	*/
364	>	public void testBlockingTake() throws InterruptedException {
365	>	final BlockingQueue q = populatedQueue(SIZE);
366	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
367	>	Thread t = newStartedThread(new CheckedRunnable() {
368	>	public void realRun() throws InterruptedException {
369	>	for (int i = 0; i < SIZE; ++i) {
370	>	assertEquals(i, q.take());
371	>	}
372	>
373	>	Thread.currentThread().interrupt();
374	>	try {
375	>	q.take();
376	>	shouldThrow();
377	>	} catch (InterruptedException success) {}
378	>	assertFalse(Thread.interrupted());
379	>
380	>	pleaseInterrupt.countDown();
381	>	try {
382	>	q.take();
383	>	shouldThrow();
384	>	} catch (InterruptedException success) {}
385	>	assertFalse(Thread.interrupted());
386	>	}});
387	>
388	>	await(pleaseInterrupt);
389	>	assertThreadStaysAlive(t);
390	>	t.interrupt();
391	>	awaitTermination(t);
392		}
393
394	<	public void testTimedPoll() {
395	<	try {
396	<	LinkedBlockingQueue q = populatedQueue(SIZE);
397	<	for (int i = 0; i < SIZE; ++i) {
398	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
399	<	}
400	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
391	<	} catch (InterruptedException e){
392	<	fail("Unexpected exception");
393	<	}
394	<	}
395	<
396	<	public void testInterruptedTimedPoll(){
397	<	Thread t = new Thread(new Runnable() {
398	<	public void run() {
399	<	try {
400	<	LinkedBlockingQueue q = populatedQueue(SIZE);
401	<	for (int i = 0; i < SIZE; ++i) {
402	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
403	<	}
404	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
405	<	} catch (InterruptedException success){
406	<	}
407	<	}});
408	<	t.start();
409	<	try {
410	<	Thread.sleep(SHORT_DELAY_MS);
411	<	t.interrupt();
412	<	t.join();
413	<	}
414	<	catch (InterruptedException ie) {
415	<	fail("Unexpected exception");
394	>	/**
395	>	* poll succeeds unless empty
396	>	*/
397	>	public void testPoll() {
398	>	LinkedBlockingQueue q = populatedQueue(SIZE);
399	>	for (int i = 0; i < SIZE; ++i) {
400	>	assertEquals(i, q.poll());
401		}
402	+	assertNull(q.poll());
403		}
404
405	<	public void testTimedPollWithOffer(){
406	<	final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
407	<	Thread t = new Thread(new Runnable() {
408	<	public void run(){
409	<	try {
410	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
411	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
426	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
427	<	threadFail("Should block");
428	<	} catch (InterruptedException success) { }
429	<	}
430	<	});
431	<	try {
432	<	t.start();
433	<	Thread.sleep(SMALL_DELAY_MS);
434	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
435	<	t.interrupt();
436	<	t.join();
437	<	} catch (Exception e){
438	<	fail("Unexpected exception");
405	>	/**
406	>	* timed poll with zero timeout succeeds when non-empty, else times out
407	>	*/
408	>	public void testTimedPoll0() throws InterruptedException {
409	>	LinkedBlockingQueue q = populatedQueue(SIZE);
410	>	for (int i = 0; i < SIZE; ++i) {
411	>	assertEquals(i, q.poll(0, MILLISECONDS));
412		}
413	<	}
413	>	assertNull(q.poll(0, MILLISECONDS));
414	>	}
415	>
416	>	/**
417	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
418	>	*/
419	>	public void testTimedPoll() throws InterruptedException {
420	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
421	>	for (int i = 0; i < SIZE; ++i) {
422	>	long startTime = System.nanoTime();
423	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
424	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
425	>	}
426	>	long startTime = System.nanoTime();
427	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
428	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
429	>	checkEmpty(q);
430	>	}
431
432	+	/**
433	+	* Interrupted timed poll throws InterruptedException instead of
434	+	* returning timeout status
435	+	*/
436	+	public void testInterruptedTimedPoll() throws InterruptedException {
437	+	final BlockingQueue<Integer> q = populatedQueue(SIZE);
438	+	final CountDownLatch aboutToWait = new CountDownLatch(1);
439	+	Thread t = newStartedThread(new CheckedRunnable() {
440	+	public void realRun() throws InterruptedException {
441	+	for (int i = 0; i < SIZE; ++i) {
442	+	long t0 = System.nanoTime();
443	+	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
444	+	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
445	+	}
446	+	long t0 = System.nanoTime();
447	+	aboutToWait.countDown();
448	+	try {
449	+	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
450	+	shouldThrow();
451	+	} catch (InterruptedException success) {
452	+	assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
453	+	}
454	+	}});
455	+
456	+	aboutToWait.await();
457	+	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
458	+	t.interrupt();
459	+	awaitTermination(t, MEDIUM_DELAY_MS);
460	+	checkEmpty(q);
461	+	}
462
463	<	public void testPeek(){
463	>	/**
464	>	* peek returns next element, or null if empty
465	>	*/
466	>	public void testPeek() {
467		LinkedBlockingQueue q = populatedQueue(SIZE);
468		for (int i = 0; i < SIZE; ++i) {
469	<	assertEquals(i, ((Integer)q.peek()).intValue());
470	<	q.poll();
469	>	assertEquals(i, q.peek());
470	>	assertEquals(i, q.poll());
471		assertTrue(q.peek() == null ||
472	<	i != ((Integer)q.peek()).intValue());
472	>	!q.peek().equals(i));
473		}
474	<	assertNull(q.peek());
474	>	assertNull(q.peek());
475		}
476
477	<	public void testElement(){
477	>	/**
478	>	* element returns next element, or throws NSEE if empty
479	>	*/
480	>	public void testElement() {
481		LinkedBlockingQueue q = populatedQueue(SIZE);
482		for (int i = 0; i < SIZE; ++i) {
483	<	assertEquals(i, ((Integer)q.element()).intValue());
484	<	q.poll();
483	>	assertEquals(i, q.element());
484	>	assertEquals(i, q.poll());
485		}
486		try {
487		q.element();
488	<	fail("no such element");
489	<	}
464	<	catch (NoSuchElementException success) {}
488	>	shouldThrow();
489	>	} catch (NoSuchElementException success) {}
490		}
491
492	<	public void testRemove(){
492	>	/**
493	>	* remove removes next element, or throws NSEE if empty
494	>	*/
495	>	public void testRemove() {
496		LinkedBlockingQueue q = populatedQueue(SIZE);
497		for (int i = 0; i < SIZE; ++i) {
498	<	assertEquals(i, ((Integer)q.remove()).intValue());
498	>	assertEquals(i, q.remove());
499		}
500		try {
501		q.remove();
502	<	fail("remove should throw");
503	<	} catch (NoSuchElementException success){
476	<	}
502	>	shouldThrow();
503	>	} catch (NoSuchElementException success) {}
504		}
505
506	<	public void testRemoveElement(){
507	<	LinkedBlockingQueue q = populatedQueue(SIZE);
508	<	for (int i = 1; i < SIZE; i+=2) {
509	<	assertTrue(q.remove(new Integer(i)));
510	<	}
511	<	for (int i = 0; i < SIZE; i+=2) {
512	<	assertTrue(q.remove(new Integer(i)));
513	<	assertFalse(q.remove(new Integer(i+1)));
514	<	}
515	<	assertTrue(q.isEmpty());
506	>	/**
507	>	* An add following remove(x) succeeds
508	>	*/
509	>	public void testRemoveElementAndAdd() throws InterruptedException {
510	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
511	>	assertTrue(q.add(new Integer(1)));
512	>	assertTrue(q.add(new Integer(2)));
513	>	assertTrue(q.remove(new Integer(1)));
514	>	assertTrue(q.remove(new Integer(2)));
515	>	assertTrue(q.add(new Integer(3)));
516	>	assertTrue(q.take() != null);
517		}
518	<
519	<	public void testContains(){
518	>
519	>	/**
520	>	* contains(x) reports true when elements added but not yet removed
521	>	*/
522	>	public void testContains() {
523		LinkedBlockingQueue q = populatedQueue(SIZE);
524		for (int i = 0; i < SIZE; ++i) {
525		assertTrue(q.contains(new Integer(i)));
#	Line 497 | Line 528 | public class LinkedBlockingQueueTest ext
528		}
529		}
530
531	<	public void testClear(){
531	>	/**
532	>	* clear removes all elements
533	>	*/
534	>	public void testClear() {
535		LinkedBlockingQueue q = populatedQueue(SIZE);
536		q.clear();
537		assertTrue(q.isEmpty());
#	Line 505 | Line 539 | public class LinkedBlockingQueueTest ext
539		assertEquals(SIZE, q.remainingCapacity());
540		q.add(one);
541		assertFalse(q.isEmpty());
542	+	assertTrue(q.contains(one));
543		q.clear();
544		assertTrue(q.isEmpty());
545		}
546
547	<	public void testContainsAll(){
547	>	/**
548	>	* containsAll(c) is true when c contains a subset of elements
549	>	*/
550	>	public void testContainsAll() {
551		LinkedBlockingQueue q = populatedQueue(SIZE);
552		LinkedBlockingQueue p = new LinkedBlockingQueue(SIZE);
553		for (int i = 0; i < SIZE; ++i) {
#	Line 520 | Line 558 | public class LinkedBlockingQueueTest ext
558		assertTrue(p.containsAll(q));
559		}
560
561	<	public void testRetainAll(){
561	>	/**
562	>	* retainAll(c) retains only those elements of c and reports true if changed
563	>	*/
564	>	public void testRetainAll() {
565		LinkedBlockingQueue q = populatedQueue(SIZE);
566		LinkedBlockingQueue p = populatedQueue(SIZE);
567		for (int i = 0; i < SIZE; ++i) {
#	Line 536 | Line 577 | public class LinkedBlockingQueueTest ext
577		}
578		}
579
580	<	public void testRemoveAll(){
580	>	/**
581	>	* removeAll(c) removes only those elements of c and reports true if changed
582	>	*/
583	>	public void testRemoveAll() {
584		for (int i = 1; i < SIZE; ++i) {
585		LinkedBlockingQueue q = populatedQueue(SIZE);
586		LinkedBlockingQueue p = populatedQueue(i);
#	Line 549 | Line 593 | public class LinkedBlockingQueueTest ext
593		}
594		}
595
596	+	/**
597	+	* toArray contains all elements in FIFO order
598	+	*/
599	+	public void testToArray() {
600	+	LinkedBlockingQueue q = populatedQueue(SIZE);
601	+	Object[] o = q.toArray();
602	+	for (int i = 0; i < o.length; i++)
603	+	assertSame(o[i], q.poll());
604	+	}
605
606	<	public void testToArray(){
606	>	/**
607	>	* toArray(a) contains all elements in FIFO order
608	>	*/
609	>	public void testToArray2() throws InterruptedException {
610	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
611	>	Integer[] ints = new Integer[SIZE];
612	>	Integer[] array = q.toArray(ints);
613	>	assertSame(ints, array);
614	>	for (int i = 0; i < ints.length; i++)
615	>	assertSame(ints[i], q.poll());
616	>	}
617	>
618	>	/**
619	>	* toArray(incompatible array type) throws ArrayStoreException
620	>	*/
621	>	public void testToArray1_BadArg() {
622		LinkedBlockingQueue q = populatedQueue(SIZE);
623	<	Object[] o = q.toArray();
624	<	try {
625	<	for(int i = 0; i < o.length; i++)
626	<	assertEquals(o[i], q.take());
559	<	} catch (InterruptedException e){
560	<	fail("Unexpected exception");
561	<	}
562	<	}
563	<
564	<	public void testToArray2(){
565	<	LinkedBlockingQueue q = populatedQueue(SIZE);
566	<	Integer[] ints = new Integer[SIZE];
567	<	ints = (Integer[])q.toArray(ints);
568	<	try {
569	<	for(int i = 0; i < ints.length; i++)
570	<	assertEquals(ints[i], q.take());
571	<	} catch (InterruptedException e){
572	<	fail("Unexpected exception");
573	<	}
574	<	}
575	<
576	<	public void testIterator(){
577	<	LinkedBlockingQueue q = populatedQueue(SIZE);
578	<	Iterator it = q.iterator();
579	<	try {
580	<	while(it.hasNext()){
581	<	assertEquals(it.next(), q.take());
582	<	}
583	<	} catch (InterruptedException e){
584	<	fail("Unexpected exception");
585	<	}
623	>	try {
624	>	q.toArray(new String[10]);
625	>	shouldThrow();
626	>	} catch (ArrayStoreException success) {}
627		}
628
629	<	public void testIteratorOrdering() {
629	>	/**
630	>	* iterator iterates through all elements
631	>	*/
632	>	public void testIterator() throws InterruptedException {
633	>	LinkedBlockingQueue q = populatedQueue(SIZE);
634	>	Iterator it = q.iterator();
635	>	while (it.hasNext()) {
636	>	assertEquals(it.next(), q.take());
637	>	}
638	>	}
639
640	+	/**
641	+	* iterator.remove removes current element
642	+	*/
643	+	public void testIteratorRemove() {
644		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
591	–
592	–	q.add(one);
645		q.add(two);
646	+	q.add(one);
647		q.add(three);
648
649	<	assertEquals("queue should be full", 0, q.remainingCapacity());
649	>	Iterator it = q.iterator();
650	>	it.next();
651	>	it.remove();
652	>
653	>	it = q.iterator();
654	>	assertSame(it.next(), one);
655	>	assertSame(it.next(), three);
656	>	assertFalse(it.hasNext());
657	>	}
658
659	+	/**
660	+	* iterator ordering is FIFO
661	+	*/
662	+	public void testIteratorOrdering() {
663	+	final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
664	+	q.add(one);
665	+	q.add(two);
666	+	q.add(three);
667	+	assertEquals(0, q.remainingCapacity());
668		int k = 0;
669		for (Iterator it = q.iterator(); it.hasNext();) {
670	<	int i = ((Integer)(it.next())).intValue();
601	<	assertEquals("items should come out in order", ++k, i);
670	>	assertEquals(++k, it.next());
671		}
672	<
604	<	assertEquals("should go through 3 elements", 3, k);
672	>	assertEquals(3, k);
673		}
674
675	<	public void testWeaklyConsistentIteration () {
676	<
675	>	/**
676	>	* Modifications do not cause iterators to fail
677	>	*/
678	>	public void testWeaklyConsistentIteration() {
679		final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
610	–
680		q.add(one);
681		q.add(two);
682		q.add(three);
683	<
684	<	try {
685	<	for (Iterator it = q.iterator(); it.hasNext();) {
617	<	q.remove();
618	<	it.next();
619	<	}
620	<	}
621	<	catch (ConcurrentModificationException e) {
622	<	fail("weakly consistent iterator; should not get CME");
683	>	for (Iterator it = q.iterator(); it.hasNext();) {
684	>	q.remove();
685	>	it.next();
686		}
687	<
625	<	assertEquals("queue should be empty again", 0, q.size());
687	>	assertEquals(0, q.size());
688		}
689
690	<
691	<	public void testToString(){
690	>	/**
691	>	* toString contains toStrings of elements
692	>	*/
693	>	public void testToString() {
694		LinkedBlockingQueue q = populatedQueue(SIZE);
695		String s = q.toString();
696		for (int i = 0; i < SIZE; ++i) {
697	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
697	>	assertTrue(s.contains(String.valueOf(i)));
698		}
699	<	}
636	<
699	>	}
700
701	+	/**
702	+	* offer transfers elements across Executor tasks
703	+	*/
704		public void testOfferInExecutor() {
639	–
705		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
641	–
706		q.add(one);
707		q.add(two);
644	–
708		ExecutorService executor = Executors.newFixedThreadPool(2);
709	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
710	+	executor.execute(new CheckedRunnable() {
711	+	public void realRun() throws InterruptedException {
712	+	assertFalse(q.offer(three));
713	+	threadsStarted.await();
714	+	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
715	+	assertEquals(0, q.remainingCapacity());
716	+	}});
717	+
718	+	executor.execute(new CheckedRunnable() {
719	+	public void realRun() throws InterruptedException {
720	+	threadsStarted.await();
721	+	assertSame(one, q.take());
722	+	}});
723
647	–	executor.execute(new Runnable() {
648	–	public void run() {
649	–	threadAssertFalse(q.offer(three));
650	–	try {
651	–	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
652	–	threadAssertEquals(0, q.remainingCapacity());
653	–	}
654	–	catch (InterruptedException e) {
655	–	threadFail("should not be interrupted");
656	–	}
657	–	}
658	–	});
659	–
660	–	executor.execute(new Runnable() {
661	–	public void run() {
662	–	try {
663	–	Thread.sleep(SMALL_DELAY_MS);
664	–	threadAssertEquals(one, q.take());
665	–	}
666	–	catch (InterruptedException e) {
667	–	threadFail("should not be interrupted");
668	–	}
669	–	}
670	–	});
671	–
724		joinPool(executor);
673	–
725		}
726
727	+	/**
728	+	* timed poll retrieves elements across Executor threads
729	+	*/
730		public void testPollInExecutor() {
677	–
731		final LinkedBlockingQueue q = new LinkedBlockingQueue(2);
732	<
732	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
733		ExecutorService executor = Executors.newFixedThreadPool(2);
734	+	executor.execute(new CheckedRunnable() {
735	+	public void realRun() throws InterruptedException {
736	+	assertNull(q.poll());
737	+	threadsStarted.await();
738	+	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
739	+	checkEmpty(q);
740	+	}});
741	+
742	+	executor.execute(new CheckedRunnable() {
743	+	public void realRun() throws InterruptedException {
744	+	threadsStarted.await();
745	+	q.put(one);
746	+	}});
747
682	–	executor.execute(new Runnable() {
683	–	public void run() {
684	–	threadAssertNull(q.poll());
685	–	try {
686	–	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
687	–	threadAssertTrue(q.isEmpty());
688	–	}
689	–	catch (InterruptedException e) {
690	–	threadFail("should not be interrupted");
691	–	}
692	–	}
693	–	});
694	–
695	–	executor.execute(new Runnable() {
696	–	public void run() {
697	–	try {
698	–	Thread.sleep(SMALL_DELAY_MS);
699	–	q.put(one);
700	–	}
701	–	catch (InterruptedException e) {
702	–	threadFail("should not be interrupted");
703	–	}
704	–	}
705	–	});
706	–
748		joinPool(executor);
749		}
750
751	<	public void testSerialization() {
751	>	/**
752	>	* A deserialized serialized queue has same elements in same order
753	>	*/
754	>	public void testSerialization() throws Exception {
755	>	Queue x = populatedQueue(SIZE);
756	>	Queue y = serialClone(x);
757	>
758	>	assertTrue(x != y);
759	>	assertEquals(x.size(), y.size());
760	>	assertEquals(x.toString(), y.toString());
761	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
762	>	while (!x.isEmpty()) {
763	>	assertFalse(y.isEmpty());
764	>	assertEquals(x.remove(), y.remove());
765	>	}
766	>	assertTrue(y.isEmpty());
767	>	}
768	>
769	>	/**
770	>	* drainTo(c) empties queue into another collection c
771	>	*/
772	>	public void testDrainTo() {
773		LinkedBlockingQueue q = populatedQueue(SIZE);
774	+	ArrayList l = new ArrayList();
775	+	q.drainTo(l);
776	+	assertEquals(0, q.size());
777	+	assertEquals(SIZE, l.size());
778	+	for (int i = 0; i < SIZE; ++i)
779	+	assertEquals(l.get(i), new Integer(i));
780	+	q.add(zero);
781	+	q.add(one);
782	+	assertFalse(q.isEmpty());
783	+	assertTrue(q.contains(zero));
784	+	assertTrue(q.contains(one));
785	+	l.clear();
786	+	q.drainTo(l);
787	+	assertEquals(0, q.size());
788	+	assertEquals(2, l.size());
789	+	for (int i = 0; i < 2; ++i)
790	+	assertEquals(l.get(i), new Integer(i));
791	+	}
792
793	<	try {
794	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
795	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
796	<	out.writeObject(q);
797	<	out.close();
798	<
799	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
800	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
801	<	LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject();
802	<	assertEquals(q.size(), r.size());
803	<	while (!q.isEmpty())
804	<	assertEquals(q.remove(), r.remove());
805	<	} catch(Exception e){
806	<	e.printStackTrace();
807	<	fail("unexpected exception");
793	>	/**
794	>	* drainTo empties full queue, unblocking a waiting put.
795	>	*/
796	>	public void testDrainToWithActivePut() throws InterruptedException {
797	>	final LinkedBlockingQueue q = populatedQueue(SIZE);
798	>	Thread t = new Thread(new CheckedRunnable() {
799	>	public void realRun() throws InterruptedException {
800	>	q.put(new Integer(SIZE+1));
801	>	}});
802	>
803	>	t.start();
804	>	ArrayList l = new ArrayList();
805	>	q.drainTo(l);
806	>	assertTrue(l.size() >= SIZE);
807	>	for (int i = 0; i < SIZE; ++i)
808	>	assertEquals(l.get(i), new Integer(i));
809	>	t.join();
810	>	assertTrue(q.size() + l.size() >= SIZE);
811	>	}
812	>
813	>	/**
814	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
815	>	*/
816	>	public void testDrainToN() {
817	>	LinkedBlockingQueue q = new LinkedBlockingQueue();
818	>	for (int i = 0; i < SIZE + 2; ++i) {
819	>	for (int j = 0; j < SIZE; j++)
820	>	assertTrue(q.offer(new Integer(j)));
821	>	ArrayList l = new ArrayList();
822	>	q.drainTo(l, i);
823	>	int k = (i < SIZE) ? i : SIZE;
824	>	assertEquals(l.size(), k);
825	>	assertEquals(q.size(), SIZE-k);
826	>	for (int j = 0; j < k; ++j)
827	>	assertEquals(l.get(j), new Integer(j));
828	>	while (q.poll() != null) ;
829		}
830		}
831

Diff Legend

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