ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/ArrayBlockingQueueTest.java

Comparing jsr166/src/test/tck/ArrayBlockingQueueTest.java (file contents):
Revision 1.6 by dl, Sun Oct 5 23:00:39 2003 UTC vs.
Revision 1.56 by jsr166, Thu May 30 03:28:55 2013 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
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.ArrayBlockingQueue;
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 static java.util.concurrent.TimeUnit.MILLISECONDS;
22
23		public class ArrayBlockingQueueTest extends JSR166TestCase {
24	+
25	+	public static class Fair extends BlockingQueueTest {
26	+	protected BlockingQueue emptyCollection() {
27	+	return new ArrayBlockingQueue(SIZE, true);
28	+	}
29	+	}
30	+
31	+	public static class NonFair extends BlockingQueueTest {
32	+	protected BlockingQueue emptyCollection() {
33	+	return new ArrayBlockingQueue(SIZE, false);
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(ArrayBlockingQueueTest.class);
42	>	return newTestSuite(ArrayBlockingQueueTest.class,
43	>	new Fair().testSuite(),
44	>	new NonFair().testSuite());
45		}
46
47		/**
48	<	* Create a queue of given size containing consecutive
48	>	* Returns a new queue of given size containing consecutive
49		* Integers 0 ... n.
50		*/
51	<	private ArrayBlockingQueue populatedQueue(int n) {
52	<	ArrayBlockingQueue q = new ArrayBlockingQueue(n);
51	>	private ArrayBlockingQueue<Integer> populatedQueue(int n) {
52	>	ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<Integer>(n);
53		assertTrue(q.isEmpty());
54	<	for(int i = 0; i < n; i++)
55	<	assertTrue(q.offer(new Integer(i)));
54	>	for (int i = 0; i < n; i++)
55	>	assertTrue(q.offer(new Integer(i)));
56		assertFalse(q.isEmpty());
57		assertEquals(0, q.remainingCapacity());
58	<	assertEquals(n, q.size());
58	>	assertEquals(n, q.size());
59		return q;
60		}
61	<
61	>
62		/**
63		* A new queue has the indicated capacity
64		*/
#	Line 42 | Line 67 | public class ArrayBlockingQueueTest exte
67		}
68
69		/**
70	<	* Constructor throws IAE if  capacity argument nonpositive
70	>	* Constructor throws IAE if capacity argument nonpositive
71		*/
72		public void testConstructor2() {
73		try {
74	<	ArrayBlockingQueue q = new ArrayBlockingQueue(0);
74	>	new ArrayBlockingQueue(0);
75		shouldThrow();
76	<	}
52	<	catch (IllegalArgumentException success) {}
76	>	} catch (IllegalArgumentException success) {}
77		}
78
79		/**
#	Line 57 | Line 81 | public class ArrayBlockingQueueTest exte
81		*/
82		public void testConstructor3() {
83		try {
84	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null);
84	>	new ArrayBlockingQueue(1, true, null);
85		shouldThrow();
86	<	}
63	<	catch (NullPointerException success) {}
86	>	} catch (NullPointerException success) {}
87		}
88
89		/**
90		* Initializing from Collection of null elements throws NPE
91		*/
92		public void testConstructor4() {
93	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
94		try {
95	<	Integer[] ints = new Integer[SIZE];
72	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
95	>	new ArrayBlockingQueue(SIZE, false, elements);
96		shouldThrow();
97	<	}
75	<	catch (NullPointerException success) {}
97	>	} catch (NullPointerException success) {}
98		}
99
100		/**
101		* Initializing from Collection with some null elements throws NPE
102		*/
103		public void testConstructor5() {
104	+	Integer[] ints = new Integer[SIZE];
105	+	for (int i = 0; i < SIZE-1; ++i)
106	+	ints[i] = i;
107	+	Collection<Integer> elements = Arrays.asList(ints);
108		try {
109	<	Integer[] ints = new Integer[SIZE];
84	<	for (int i = 0; i < SIZE-1; ++i)
85	<	ints[i] = new Integer(i);
86	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
109	>	new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
110		shouldThrow();
111	<	}
89	<	catch (NullPointerException success) {}
111	>	} catch (NullPointerException success) {}
112		}
113
114		/**
115		* Initializing from too large collection throws IAE
116		*/
117		public void testConstructor6() {
118	+	Integer[] ints = new Integer[SIZE];
119	+	for (int i = 0; i < SIZE; ++i)
120	+	ints[i] = i;
121	+	Collection<Integer> elements = Arrays.asList(ints);
122		try {
123	<	Integer[] ints = new Integer[SIZE];
98	<	for (int i = 0; i < SIZE; ++i)
99	<	ints[i] = new Integer(i);
100	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1, false, Arrays.asList(ints));
123	>	new ArrayBlockingQueue(SIZE - 1, false, elements);
124		shouldThrow();
125	<	}
103	<	catch (IllegalArgumentException success) {}
125	>	} catch (IllegalArgumentException success) {}
126		}
127
128		/**
129		* Queue contains all elements of collection used to initialize
130		*/
131		public void testConstructor7() {
132	<	try {
133	<	Integer[] ints = new Integer[SIZE];
134	<	for (int i = 0; i < SIZE; ++i)
135	<	ints[i] = new Integer(i);
136	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints));
137	<	for (int i = 0; i < SIZE; ++i)
138	<	assertEquals(ints[i], q.poll());
117	<	}
118	<	finally {}
132	>	Integer[] ints = new Integer[SIZE];
133	>	for (int i = 0; i < SIZE; ++i)
134	>	ints[i] = i;
135	>	Collection<Integer> elements = Arrays.asList(ints);
136	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements);
137	>	for (int i = 0; i < SIZE; ++i)
138	>	assertEquals(ints[i], q.poll());
139		}
140
141		/**
#	Line 151 | Line 171 | public class ArrayBlockingQueueTest exte
171		}
172
173		/**
154	–	*  offer(null) throws NPE
155	–	*/
156	–	public void testOfferNull() {
157	–	try {
158	–	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
159	–	q.offer(null);
160	–	shouldThrow();
161	–	} catch (NullPointerException success) { }
162	–	}
163	–
164	–	/**
165	–	*  add(null) throws NPE
166	–	*/
167	–	public void testAddNull() {
168	–	try {
169	–	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
170	–	q.add(null);
171	–	shouldThrow();
172	–	} catch (NullPointerException success) { }
173	–	}
174	–
175	–	/**
174		* Offer succeeds if not full; fails if full
175		*/
176		public void testOffer() {
#	Line 185 | Line 183 | public class ArrayBlockingQueueTest exte
183		* add succeeds if not full; throws ISE if full
184		*/
185		public void testAdd() {
186	<	try {
186	>	try {
187		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
188		for (int i = 0; i < SIZE; ++i) {
189		assertTrue(q.add(new Integer(i)));
190		}
191		assertEquals(0, q.remainingCapacity());
192		q.add(new Integer(SIZE));
195	–	} catch (IllegalStateException success){
196	–	}
197	–	}
198	–
199	–	/**
200	–	*  addAll(null) throws NPE
201	–	*/
202	–	public void testAddAll1() {
203	–	try {
204	–	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
205	–	q.addAll(null);
193		shouldThrow();
194	<	}
208	<	catch (NullPointerException success) {}
194	>	} catch (IllegalStateException success) {}
195		}
196
197		/**
#	Line 216 | Line 202 | public class ArrayBlockingQueueTest exte
202		ArrayBlockingQueue q = populatedQueue(SIZE);
203		q.addAll(q);
204		shouldThrow();
205	<	}
220	<	catch (IllegalArgumentException success) {}
205	>	} catch (IllegalArgumentException success) {}
206		}
207
223	–
224	–	/**
225	–	*  addAll of a collection with null elements throws NPE
226	–	*/
227	–	public void testAddAll2() {
228	–	try {
229	–	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
230	–	Integer[] ints = new Integer[SIZE];
231	–	q.addAll(Arrays.asList(ints));
232	–	shouldThrow();
233	–	}
234	–	catch (NullPointerException success) {}
235	–	}
208		/**
209		* addAll of a collection with any null elements throws NPE after
210		* possibly adding some elements
#	Line 245 | Line 217 | public class ArrayBlockingQueueTest exte
217		ints[i] = new Integer(i);
218		q.addAll(Arrays.asList(ints));
219		shouldThrow();
220	<	}
249	<	catch (NullPointerException success) {}
220	>	} catch (NullPointerException success) {}
221		}
222	+
223		/**
224		* addAll throws ISE if not enough room
225		*/
#	Line 259 | Line 231 | public class ArrayBlockingQueueTest exte
231		ints[i] = new Integer(i);
232		q.addAll(Arrays.asList(ints));
233		shouldThrow();
234	<	}
263	<	catch (IllegalStateException success) {}
234	>	} catch (IllegalStateException success) {}
235		}
236	+
237		/**
238		* Queue contains all elements, in traversal order, of successful addAll
239		*/
240		public void testAddAll5() {
241	<	try {
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	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
247	<	assertFalse(q.addAll(Arrays.asList(empty)));
248	<	assertTrue(q.addAll(Arrays.asList(ints)));
249	<	for (int i = 0; i < SIZE; ++i)
278	<	assertEquals(ints[i], q.poll());
279	<	}
280	<	finally {}
241	>	Integer[] empty = new Integer[0];
242	>	Integer[] ints = new Integer[SIZE];
243	>	for (int i = 0; i < SIZE; ++i)
244	>	ints[i] = new Integer(i);
245	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
246	>	assertFalse(q.addAll(Arrays.asList(empty)));
247	>	assertTrue(q.addAll(Arrays.asList(ints)));
248	>	for (int i = 0; i < SIZE; ++i)
249	>	assertEquals(ints[i], q.poll());
250		}
251
252		/**
284	–	*  put(null) throws NPE
285	–	*/
286	–	public void testPutNull() {
287	–	try {
288	–	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
289	–	q.put(null);
290	–	shouldThrow();
291	–	}
292	–	catch (NullPointerException success){
293	–	}
294	–	catch (InterruptedException ie) {
295	–	unexpectedException();
296	–	}
297	–	}
298	–
299	–	/**
253		* all elements successfully put are contained
254		*/
255	<	public void testPut() {
256	<	try {
257	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
258	<	for (int i = 0; i < SIZE; ++i) {
259	<	Integer I = new Integer(i);
260	<	q.put(I);
308	<	assertTrue(q.contains(I));
309	<	}
310	<	assertEquals(0, q.remainingCapacity());
311	<	}
312	<	catch (InterruptedException ie) {
313	<	unexpectedException();
255	>	public void testPut() throws InterruptedException {
256	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
257	>	for (int i = 0; i < SIZE; ++i) {
258	>	Integer I = new Integer(i);
259	>	q.put(I);
260	>	assertTrue(q.contains(I));
261		}
262	+	assertEquals(0, q.remainingCapacity());
263		}
264
265		/**
266		* put blocks interruptibly if full
267		*/
268	<	public void testBlockingPut() {
269	<	Thread t = new Thread(new Runnable() {
270	<	public void run() {
271	<	int added = 0;
272	<	try {
273	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
274	<	for (int i = 0; i < SIZE; ++i) {
275	<	q.put(new Integer(i));
276	<	++added;
277	<	}
278	<	q.put(new Integer(SIZE));
279	<	threadShouldThrow();
280	<	} catch (InterruptedException ie){
281	<	threadAssertEquals(added, SIZE);
282	<	}
283	<	}});
284	<	try {
285	<	t.start();
286	<	Thread.sleep(SHORT_DELAY_MS);
287	<	t.interrupt();
288	<	t.join();
289	<	}
290	<	catch (InterruptedException ie) {
291	<	unexpectedException();
292	<	}
268	>	public void testBlockingPut() throws InterruptedException {
269	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
270	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
271	>	Thread t = newStartedThread(new CheckedRunnable() {
272	>	public void realRun() throws InterruptedException {
273	>	for (int i = 0; i < SIZE; ++i)
274	>	q.put(i);
275	>	assertEquals(SIZE, q.size());
276	>	assertEquals(0, q.remainingCapacity());
277	>
278	>	Thread.currentThread().interrupt();
279	>	try {
280	>	q.put(99);
281	>	shouldThrow();
282	>	} catch (InterruptedException success) {}
283	>	assertFalse(Thread.interrupted());
284	>
285	>	pleaseInterrupt.countDown();
286	>	try {
287	>	q.put(99);
288	>	shouldThrow();
289	>	} catch (InterruptedException success) {}
290	>	assertFalse(Thread.interrupted());
291	>	}});
292	>
293	>	await(pleaseInterrupt);
294	>	assertThreadStaysAlive(t);
295	>	t.interrupt();
296	>	awaitTermination(t);
297	>	assertEquals(SIZE, q.size());
298	>	assertEquals(0, q.remainingCapacity());
299		}
300
301		/**
302	<	* put blocks waiting for take when full
302	>	* put blocks interruptibly waiting for take when full
303		*/
304	<	public void testPutWithTake() {
305	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
306	<	Thread t = new Thread(new Runnable() {
307	<	public void run() {
308	<	int added = 0;
309	<	try {
310	<	q.put(new Object());
311	<	++added;
312	<	q.put(new Object());
313	<	++added;
314	<	q.put(new Object());
315	<	++added;
316	<	q.put(new Object());
317	<	++added;
318	<	threadShouldThrow();
319	<	} catch (InterruptedException e){
320	<	threadAssertTrue(added >= 2);
321	<	}
322	<	}
323	<	});
324	<	try {
325	<	t.start();
326	<	Thread.sleep(SHORT_DELAY_MS);
327	<	q.take();
328	<	t.interrupt();
329	<	t.join();
330	<	} catch (Exception e){
331	<	unexpectedException();
332	<	}
304	>	public void testPutWithTake() throws InterruptedException {
305	>	final int capacity = 2;
306	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(capacity);
307	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
308	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
309	>	Thread t = newStartedThread(new CheckedRunnable() {
310	>	public void realRun() throws InterruptedException {
311	>	for (int i = 0; i < capacity; i++)
312	>	q.put(i);
313	>	pleaseTake.countDown();
314	>	q.put(86);
315	>
316	>	pleaseInterrupt.countDown();
317	>	try {
318	>	q.put(99);
319	>	shouldThrow();
320	>	} catch (InterruptedException success) {}
321	>	assertFalse(Thread.interrupted());
322	>	}});
323	>
324	>	await(pleaseTake);
325	>	assertEquals(0, q.remainingCapacity());
326	>	assertEquals(0, q.take());
327	>
328	>	await(pleaseInterrupt);
329	>	assertThreadStaysAlive(t);
330	>	t.interrupt();
331	>	awaitTermination(t);
332	>	assertEquals(0, q.remainingCapacity());
333		}
334
335		/**
336		* timed offer times out if full and elements not taken
337		*/
338	<	public void testTimedOffer() {
338	>	public void testTimedOffer() throws InterruptedException {
339		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
340	<	Thread t = new Thread(new Runnable() {
341	<	public void run() {
342	<	try {
343	<	q.put(new Object());
344	<	q.put(new Object());
345	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
346	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
347	<	threadShouldThrow();
348	<	} catch (InterruptedException success){}
349	<	}
350	<	});
351	<
352	<	try {
353	<	t.start();
354	<	Thread.sleep(SHORT_DELAY_MS);
355	<	t.interrupt();
356	<	t.join();
357	<	} catch (Exception e){
358	<	unexpectedException();
405	<	}
340	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
341	>	Thread t = newStartedThread(new CheckedRunnable() {
342	>	public void realRun() throws InterruptedException {
343	>	q.put(new Object());
344	>	q.put(new Object());
345	>	long startTime = System.nanoTime();
346	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
347	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
348	>	pleaseInterrupt.countDown();
349	>	try {
350	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
351	>	shouldThrow();
352	>	} catch (InterruptedException success) {}
353	>	}});
354	>
355	>	await(pleaseInterrupt);
356	>	assertThreadStaysAlive(t);
357	>	t.interrupt();
358	>	awaitTermination(t);
359		}
360
361		/**
362		* take retrieves elements in FIFO order
363		*/
364	<	public void testTake() {
365	<	try {
366	<	ArrayBlockingQueue q = populatedQueue(SIZE);
367	<	for (int i = 0; i < SIZE; ++i) {
415	<	assertEquals(i, ((Integer)q.take()).intValue());
416	<	}
417	<	} catch (InterruptedException e){
418	<	unexpectedException();
419	<	}
420	<	}
421	<
422	<	/**
423	<	* take blocks interruptibly when empty
424	<	*/
425	<	public void testTakeFromEmpty() {
426	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
427	<	Thread t = new Thread(new Runnable() {
428	<	public void run() {
429	<	try {
430	<	q.take();
431	<	threadShouldThrow();
432	<	} catch (InterruptedException success){ }
433	<	}
434	<	});
435	<	try {
436	<	t.start();
437	<	Thread.sleep(SHORT_DELAY_MS);
438	<	t.interrupt();
439	<	t.join();
440	<	} catch (Exception e){
441	<	unexpectedException();
364	>	public void testTake() throws InterruptedException {
365	>	ArrayBlockingQueue q = populatedQueue(SIZE);
366	>	for (int i = 0; i < SIZE; ++i) {
367	>	assertEquals(i, q.take());
368		}
369		}
370
371		/**
372		* Take removes existing elements until empty, then blocks interruptibly
373		*/
374	<	public void testBlockingTake() {
375	<	Thread t = new Thread(new Runnable() {
376	<	public void run() {
377	<	try {
378	<	ArrayBlockingQueue q = populatedQueue(SIZE);
379	<	for (int i = 0; i < SIZE; ++i) {
380	<	threadAssertEquals(i, ((Integer)q.take()).intValue());
381	<	}
456	<	q.take();
457	<	threadShouldThrow();
458	<	} catch (InterruptedException success){
459	<	}
460	<	}});
461	<	try {
462	<	t.start();
463	<	Thread.sleep(SHORT_DELAY_MS);
464	<	t.interrupt();
465	<	t.join();
466	<	}
467	<	catch (InterruptedException ie) {
468	<	unexpectedException();
469	<	}
470	<	}
374	>	public void testBlockingTake() throws InterruptedException {
375	>	final ArrayBlockingQueue q = populatedQueue(SIZE);
376	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
377	>	Thread t = newStartedThread(new CheckedRunnable() {
378	>	public void realRun() throws InterruptedException {
379	>	for (int i = 0; i < SIZE; ++i) {
380	>	assertEquals(i, q.take());
381	>	}
382
383	+	Thread.currentThread().interrupt();
384	+	try {
385	+	q.take();
386	+	shouldThrow();
387	+	} catch (InterruptedException success) {}
388	+	assertFalse(Thread.interrupted());
389	+
390	+	pleaseInterrupt.countDown();
391	+	try {
392	+	q.take();
393	+	shouldThrow();
394	+	} catch (InterruptedException success) {}
395	+	assertFalse(Thread.interrupted());
396	+	}});
397	+
398	+	await(pleaseInterrupt);
399	+	assertThreadStaysAlive(t);
400	+	t.interrupt();
401	+	awaitTermination(t);
402	+	}
403
404		/**
405		* poll succeeds unless empty
#	Line 476 | Line 407 | public class ArrayBlockingQueueTest exte
407		public void testPoll() {
408		ArrayBlockingQueue q = populatedQueue(SIZE);
409		for (int i = 0; i < SIZE; ++i) {
410	<	assertEquals(i, ((Integer)q.poll()).intValue());
410	>	assertEquals(i, q.poll());
411		}
412	<	assertNull(q.poll());
412	>	assertNull(q.poll());
413		}
414
415		/**
416	<	* timed pool with zero timeout succeeds when non-empty, else times out
416	>	* timed poll with zero timeout succeeds when non-empty, else times out
417		*/
418	<	public void testTimedPoll0() {
419	<	try {
420	<	ArrayBlockingQueue q = populatedQueue(SIZE);
421	<	for (int i = 0; i < SIZE; ++i) {
422	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
423	<	}
424	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
494	<	} catch (InterruptedException e){
495	<	unexpectedException();
496	<	}
418	>	public void testTimedPoll0() throws InterruptedException {
419	>	ArrayBlockingQueue q = populatedQueue(SIZE);
420	>	for (int i = 0; i < SIZE; ++i) {
421	>	assertEquals(i, q.poll(0, MILLISECONDS));
422	>	}
423	>	assertNull(q.poll(0, MILLISECONDS));
424	>	checkEmpty(q);
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	<	ArrayBlockingQueue 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	>	ArrayBlockingQueue q = populatedQueue(SIZE);
432	>	for (int i = 0; i < SIZE; ++i) {
433	>	long startTime = System.nanoTime();
434	>	assertEquals(i, 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	<	ArrayBlockingQueue q = populatedQueue(SIZE);
452	<	for (int i = 0; i < SIZE; ++i) {
453	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
454	<	}
455	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
527	<	} catch (InterruptedException success){
528	<	}
529	<	}});
530	<	try {
531	<	t.start();
532	<	Thread.sleep(SHORT_DELAY_MS);
533	<	t.interrupt();
534	<	t.join();
535	<	}
536	<	catch (InterruptedException ie) {
537	<	unexpectedException();
538	<	}
539	<	}
540	<
541	<	/**
542	<	*  timed poll before a delayed offer fails; after offer succeeds;
543	<	*  on interruption throws
544	<	*/
545	<	public void testTimedPollWithOffer() {
546	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
547	<	Thread t = new Thread(new Runnable() {
548	<	public void run() {
549	<	try {
550	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
551	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
552	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
553	<	threadShouldThrow();
554	<	} 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	>	for (int i = 0; i < SIZE; ++i) {
453	>	long t0 = System.nanoTime();
454	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
455	>	assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS);
456		}
457	<	});
458	<	try {
459	<	t.start();
460	<	Thread.sleep(SMALL_DELAY_MS);
461	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
462	<	t.interrupt();
463	<	t.join();
464	<	} catch (Exception e){
465	<	unexpectedException();
466	<	}
467	<	}
468	<
457	>	long t0 = System.nanoTime();
458	>	aboutToWait.countDown();
459	>	try {
460	>	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
461	>	shouldThrow();
462	>	} catch (InterruptedException success) {
463	>	assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS);
464	>	}
465	>	}});
466	>
467	>	aboutToWait.await();
468	>	waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
469	>	t.interrupt();
470	>	awaitTermination(t, MEDIUM_DELAY_MS);
471	>	checkEmpty(q);
472	>	}
473
474		/**
475		* peek returns next element, or null if empty
#	Line 572 | Line 477 | public class ArrayBlockingQueueTest exte
477		public void testPeek() {
478		ArrayBlockingQueue q = populatedQueue(SIZE);
479		for (int i = 0; i < SIZE; ++i) {
480	<	assertEquals(i, ((Integer)q.peek()).intValue());
481	<	q.poll();
480	>	assertEquals(i, q.peek());
481	>	assertEquals(i, q.poll());
482		assertTrue(q.peek() == null ||
483	<	i != ((Integer)q.peek()).intValue());
483	>	!q.peek().equals(i));
484		}
485	<	assertNull(q.peek());
485	>	assertNull(q.peek());
486		}
487
488		/**
#	Line 586 | Line 491 | public class ArrayBlockingQueueTest exte
491		public void testElement() {
492		ArrayBlockingQueue q = populatedQueue(SIZE);
493		for (int i = 0; i < SIZE; ++i) {
494	<	assertEquals(i, ((Integer)q.element()).intValue());
495	<	q.poll();
494	>	assertEquals(i, q.element());
495	>	assertEquals(i, q.poll());
496		}
497		try {
498		q.element();
499		shouldThrow();
500	<	}
596	<	catch (NoSuchElementException success) {}
500	>	} catch (NoSuchElementException success) {}
501		}
502
503		/**
#	Line 602 | Line 506 | public class ArrayBlockingQueueTest exte
506		public void testRemove() {
507		ArrayBlockingQueue q = populatedQueue(SIZE);
508		for (int i = 0; i < SIZE; ++i) {
509	<	assertEquals(i, ((Integer)q.remove()).intValue());
509	>	assertEquals(i, q.remove());
510		}
511		try {
512		q.remove();
513		shouldThrow();
514	<	} catch (NoSuchElementException success){
611	<	}
514	>	} catch (NoSuchElementException success) {}
515		}
516
517		/**
615	–	* remove(x) removes x and returns true if present
616	–	*/
617	–	public void testRemoveElement() {
618	–	ArrayBlockingQueue q = populatedQueue(SIZE);
619	–	for (int i = 1; i < SIZE; i+=2) {
620	–	assertTrue(q.remove(new Integer(i)));
621	–	}
622	–	for (int i = 0; i < SIZE; i+=2) {
623	–	assertTrue(q.remove(new Integer(i)));
624	–	assertFalse(q.remove(new Integer(i+1)));
625	–	}
626	–	assertTrue(q.isEmpty());
627	–	}
628	–
629	–	/**
518		* contains(x) reports true when elements added but not yet removed
519		*/
520		public void testContains() {
521		ArrayBlockingQueue q = populatedQueue(SIZE);
522		for (int i = 0; i < SIZE; ++i) {
523		assertTrue(q.contains(new Integer(i)));
524	<	q.poll();
524	>	assertEquals(i, q.poll());
525		assertFalse(q.contains(new Integer(i)));
526		}
527		}
#	Line 649 | Line 537 | public class ArrayBlockingQueueTest exte
537		assertEquals(SIZE, q.remainingCapacity());
538		q.add(one);
539		assertFalse(q.isEmpty());
540	+	assertTrue(q.contains(one));
541		q.clear();
542		assertTrue(q.isEmpty());
543		}
#	Line 702 | Line 591 | public class ArrayBlockingQueueTest exte
591		}
592		}
593
594	+	void checkToArray(ArrayBlockingQueue q) {
595	+	int size = q.size();
596	+	Object[] o = q.toArray();
597	+	assertEquals(size, o.length);
598	+	Iterator it = q.iterator();
599	+	for (int i = 0; i < size; i++) {
600	+	Integer x = (Integer) it.next();
601	+	assertEquals((Integer)o[0] + i, (int) x);
602	+	assertSame(o[i], x);
603	+	}
604	+	}
605	+
606		/**
607	<	*  toArray contains all elements
607	>	* toArray() contains all elements in FIFO order
608		*/
609		public void testToArray() {
610	<	ArrayBlockingQueue q = populatedQueue(SIZE);
611	<	Object[] o = q.toArray();
612	<	try {
613	<	for(int i = 0; i < o.length; i++)
614	<	assertEquals(o[i], q.take());
615	<	} catch (InterruptedException e){
616	<	unexpectedException();
617	<	}
610	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
611	>	for (int i = 0; i < SIZE; i++) {
612	>	checkToArray(q);
613	>	q.add(i);
614	>	}
615	>	// Provoke wraparound
616	>	for (int i = 0; i < SIZE; i++) {
617	>	checkToArray(q);
618	>	assertEquals(i, q.poll());
619	>	checkToArray(q);
620	>	q.add(SIZE+i);
621	>	}
622	>	for (int i = 0; i < SIZE; i++) {
623	>	checkToArray(q);
624	>	assertEquals(SIZE+i, q.poll());
625	>	}
626		}
627
628	<	/**
629	<	* toArray(a) contains all elements
630	<	*/
631	<	public void testToArray2() {
632	<	ArrayBlockingQueue q = populatedQueue(SIZE);
633	<	Integer[] ints = new Integer[SIZE];
634	<	ints = (Integer[])q.toArray(ints);
635	<	try {
636	<	for(int i = 0; i < ints.length; i++)
637	<	assertEquals(ints[i], q.take());
638	<	} catch (InterruptedException e){
639	<	unexpectedException();
640	<	}
628	>	void checkToArray2(ArrayBlockingQueue q) {
629	>	int size = q.size();
630	>	Integer[] a1 = size == 0 ? null : new Integer[size-1];
631	>	Integer[] a2 = new Integer[size];
632	>	Integer[] a3 = new Integer[size+2];
633	>	if (size > 0) Arrays.fill(a1, 42);
634	>	Arrays.fill(a2, 42);
635	>	Arrays.fill(a3, 42);
636	>	Integer[] b1 = size == 0 ? null : (Integer[]) q.toArray(a1);
637	>	Integer[] b2 = (Integer[]) q.toArray(a2);
638	>	Integer[] b3 = (Integer[]) q.toArray(a3);
639	>	assertSame(a2, b2);
640	>	assertSame(a3, b3);
641	>	Iterator it = q.iterator();
642	>	for (int i = 0; i < size; i++) {
643	>	Integer x = (Integer) it.next();
644	>	assertSame(b1[i], x);
645	>	assertEquals(b1[0] + i, (int) x);
646	>	assertSame(b2[i], x);
647	>	assertSame(b3[i], x);
648	>	}
649	>	assertNull(a3[size]);
650	>	assertEquals(42, (int) a3[size+1]);
651	>	if (size > 0) {
652	>	assertNotSame(a1, b1);
653	>	assertEquals(size, b1.length);
654	>	for (int i = 0; i < a1.length; i++) {
655	>	assertEquals(42, (int) a1[i]);
656	>	}
657	>	}
658		}
659
660		/**
661	<	* toArray(null) throws NPE
661	>	* toArray(a) contains all elements in FIFO order
662		*/
663	<	public void testToArray_BadArg() {
664	<	try {
665	<	ArrayBlockingQueue q = populatedQueue(SIZE);
666	<	Object o[] = q.toArray(null);
667	<	shouldThrow();
668	<	} catch(NullPointerException success){}
663	>	public void testToArray2() {
664	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
665	>	for (int i = 0; i < SIZE; i++) {
666	>	checkToArray2(q);
667	>	q.add(i);
668	>	}
669	>	// Provoke wraparound
670	>	for (int i = 0; i < SIZE; i++) {
671	>	checkToArray2(q);
672	>	assertEquals(i, q.poll());
673	>	checkToArray2(q);
674	>	q.add(SIZE+i);
675	>	}
676	>	for (int i = 0; i < SIZE; i++) {
677	>	checkToArray2(q);
678	>	assertEquals(SIZE+i, q.poll());
679	>	}
680		}
681
682		/**
683	<	* toArray with incompatable array type throws CCE
683	>	* toArray(incompatible array type) throws ArrayStoreException
684		*/
685		public void testToArray1_BadArg() {
686	<	try {
687	<	ArrayBlockingQueue q = populatedQueue(SIZE);
688	<	Object o[] = q.toArray(new String[10] );
689	<	shouldThrow();
690	<	} catch(ArrayStoreException  success){}
686	>	ArrayBlockingQueue q = populatedQueue(SIZE);
687	>	try {
688	>	q.toArray(new String[10]);
689	>	shouldThrow();
690	>	} catch (ArrayStoreException success) {}
691		}
692
756	–
693		/**
694		* iterator iterates through all elements
695		*/
696	<	public void testIterator() {
696	>	public void testIterator() throws InterruptedException {
697		ArrayBlockingQueue q = populatedQueue(SIZE);
698	<	Iterator it = q.iterator();
699	<	try {
700	<	while(it.hasNext()){
701	<	assertEquals(it.next(), q.take());
766	<	}
767	<	} catch (InterruptedException e){
768	<	unexpectedException();
769	<	}
698	>	Iterator it = q.iterator();
699	>	while (it.hasNext()) {
700	>	assertEquals(it.next(), q.take());
701	>	}
702		}
703
704		/**
705		* iterator.remove removes current element
706		*/
707	<	public void testIteratorRemove () {
707	>	public void testIteratorRemove() {
708		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
709		q.add(two);
710		q.add(one);
#	Line 781 | Line 713 | public class ArrayBlockingQueueTest exte
713		Iterator it = q.iterator();
714		it.next();
715		it.remove();
716	<
716	>
717		it = q.iterator();
718	<	assertEquals(it.next(), one);
719	<	assertEquals(it.next(), three);
718	>	assertSame(it.next(), one);
719	>	assertSame(it.next(), three);
720		assertFalse(it.hasNext());
721		}
722
#	Line 801 | Line 733 | public class ArrayBlockingQueueTest exte
733
734		int k = 0;
735		for (Iterator it = q.iterator(); it.hasNext();) {
736	<	int i = ((Integer)(it.next())).intValue();
805	<	assertEquals(++k, i);
736	>	assertEquals(++k, it.next());
737		}
738		assertEquals(3, k);
739		}
#	Line 810 | Line 741 | public class ArrayBlockingQueueTest exte
741		/**
742		* Modifications do not cause iterators to fail
743		*/
744	<	public void testWeaklyConsistentIteration () {
744	>	public void testWeaklyConsistentIteration() {
745		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
746		q.add(one);
747		q.add(two);
748		q.add(three);
749	<	try {
750	<	for (Iterator it = q.iterator(); it.hasNext();) {
751	<	q.remove();
821	<	it.next();
822	<	}
823	<	}
824	<	catch (ConcurrentModificationException e) {
825	<	unexpectedException();
749	>	for (Iterator it = q.iterator(); it.hasNext();) {
750	>	q.remove();
751	>	it.next();
752		}
753		assertEquals(0, q.size());
754		}
755
830	–
756		/**
757		* toString contains toStrings of elements
758		*/
#	Line 835 | Line 760 | public class ArrayBlockingQueueTest exte
760		ArrayBlockingQueue q = populatedQueue(SIZE);
761		String s = q.toString();
762		for (int i = 0; i < SIZE; ++i) {
763	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
763	>	assertTrue(s.contains(String.valueOf(i)));
764		}
765	<	}
841	<
765	>	}
766
767		/**
768		* offer transfers elements across Executor tasks
#	Line 848 | Line 772 | public class ArrayBlockingQueueTest exte
772		q.add(one);
773		q.add(two);
774		ExecutorService executor = Executors.newFixedThreadPool(2);
775	<	executor.execute(new Runnable() {
776	<	public void run() {
777	<	threadAssertFalse(q.offer(three));
778	<	try {
779	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
780	<	threadAssertEquals(0, q.remainingCapacity());
781	<	}
782	<	catch (InterruptedException e) {
783	<	threadUnexpectedException();
784	<	}
785	<	}
786	<	});
775	>	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
776	>	executor.execute(new CheckedRunnable() {
777	>	public void realRun() throws InterruptedException {
778	>	assertFalse(q.offer(three));
779	>	threadsStarted.await();
780	>	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
781	>	assertEquals(0, q.remainingCapacity());
782	>	}});
783	>
784	>	executor.execute(new CheckedRunnable() {
785	>	public void realRun() throws InterruptedException {
786	>	threadsStarted.await();
787	>	assertEquals(0, q.remainingCapacity());
788	>	assertSame(one, q.take());
789	>	}});
790
864	–	executor.execute(new Runnable() {
865	–	public void run() {
866	–	try {
867	–	Thread.sleep(SMALL_DELAY_MS);
868	–	threadAssertEquals(one, q.take());
869	–	}
870	–	catch (InterruptedException e) {
871	–	threadUnexpectedException();
872	–	}
873	–	}
874	–	});
875	–
791		joinPool(executor);
877	–
792		}
793
794		/**
795	<	* poll retrieves elements across Executor threads
795	>	* timed poll retrieves elements across Executor threads
796		*/
797		public void testPollInExecutor() {
798		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
799	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
800		ExecutorService executor = Executors.newFixedThreadPool(2);
801	<	executor.execute(new Runnable() {
802	<	public void run() {
803	<	threadAssertNull(q.poll());
804	<	try {
805	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
806	<	threadAssertTrue(q.isEmpty());
807	<	}
808	<	catch (InterruptedException e) {
809	<	threadUnexpectedException();
810	<	}
811	<	}
812	<	});
801	>	executor.execute(new CheckedRunnable() {
802	>	public void realRun() throws InterruptedException {
803	>	assertNull(q.poll());
804	>	threadsStarted.await();
805	>	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
806	>	checkEmpty(q);
807	>	}});
808	>
809	>	executor.execute(new CheckedRunnable() {
810	>	public void realRun() throws InterruptedException {
811	>	threadsStarted.await();
812	>	q.put(one);
813	>	}});
814
899	–	executor.execute(new Runnable() {
900	–	public void run() {
901	–	try {
902	–	Thread.sleep(SMALL_DELAY_MS);
903	–	q.put(one);
904	–	}
905	–	catch (InterruptedException e) {
906	–	threadUnexpectedException();
907	–	}
908	–	}
909	–	});
910	–
815		joinPool(executor);
816		}
817
818		/**
819		* A deserialized serialized queue has same elements in same order
820		*/
821	<	public void testSerialization() {
822	<	ArrayBlockingQueue q = populatedQueue(SIZE);
823	<
824	<	try {
825	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
826	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
827	<	out.writeObject(q);
828	<	out.close();
829	<
830	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
831	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
928	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
929	<	assertEquals(q.size(), r.size());
930	<	while (!q.isEmpty())
931	<	assertEquals(q.remove(), r.remove());
932	<	} catch(Exception e){
933	<	unexpectedException();
934	<	}
935	<	}
936	<
937	<	/**
938	<	* drainTo(null) throws NPE
939	<	*/
940	<	public void testDrainToNull() {
941	<	ArrayBlockingQueue q = populatedQueue(SIZE);
942	<	try {
943	<	q.drainTo(null);
944	<	shouldThrow();
945	<	} catch(NullPointerException success) {
946	<	}
947	<	}
948	<
949	<	/**
950	<	* drainTo(this) throws IAE
951	<	*/
952	<	public void testDrainToSelf() {
953	<	ArrayBlockingQueue q = populatedQueue(SIZE);
954	<	try {
955	<	q.drainTo(q);
956	<	shouldThrow();
957	<	} catch(IllegalArgumentException success) {
821	>	public void testSerialization() throws Exception {
822	>	Queue x = populatedQueue(SIZE);
823	>	Queue y = serialClone(x);
824	>
825	>	assertNotSame(x, y);
826	>	assertEquals(x.size(), y.size());
827	>	assertEquals(x.toString(), y.toString());
828	>	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
829	>	while (!x.isEmpty()) {
830	>	assertFalse(y.isEmpty());
831	>	assertEquals(x.remove(), y.remove());
832		}
833	+	assertTrue(y.isEmpty());
834		}
835
836		/**
837		* drainTo(c) empties queue into another collection c
838	<	*/
838	>	*/
839		public void testDrainTo() {
840		ArrayBlockingQueue q = populatedQueue(SIZE);
841		ArrayList l = new ArrayList();
842		q.drainTo(l);
843	<	assertEquals(q.size(), 0);
844	<	assertEquals(l.size(), SIZE);
845	<	for (int i = 0; i < SIZE; ++i)
843	>	assertEquals(0, q.size());
844	>	assertEquals(SIZE, l.size());
845	>	for (int i = 0; i < SIZE; ++i)
846	>	assertEquals(l.get(i), new Integer(i));
847	>	q.add(zero);
848	>	q.add(one);
849	>	assertFalse(q.isEmpty());
850	>	assertTrue(q.contains(zero));
851	>	assertTrue(q.contains(one));
852	>	l.clear();
853	>	q.drainTo(l);
854	>	assertEquals(0, q.size());
855	>	assertEquals(2, l.size());
856	>	for (int i = 0; i < 2; ++i)
857		assertEquals(l.get(i), new Integer(i));
858		}
859
860		/**
861		* drainTo empties full queue, unblocking a waiting put.
862	<	*/
863	<	public void testDrainToWithActivePut() {
862	>	*/
863	>	public void testDrainToWithActivePut() throws InterruptedException {
864		final ArrayBlockingQueue q = populatedQueue(SIZE);
865	<	Thread t = new Thread(new Runnable() {
866	<	public void run() {
867	<	try {
868	<	q.put(new Integer(SIZE+1));
983	<	} catch (InterruptedException ie){
984	<	threadUnexpectedException();
985	<	}
986	<	}
987	<	});
988	<	try {
989	<	t.start();
990	<	ArrayList l = new ArrayList();
991	<	q.drainTo(l);
992	<	assertTrue(l.size() >= SIZE);
993	<	for (int i = 0; i < SIZE; ++i)
994	<	assertEquals(l.get(i), new Integer(i));
995	<	t.join();
996	<	assertTrue(q.size() + l.size() == SIZE+1);
997	<	} catch(Exception e){
998	<	unexpectedException();
999	<	}
1000	<	}
865	>	Thread t = new Thread(new CheckedRunnable() {
866	>	public void realRun() throws InterruptedException {
867	>	q.put(new Integer(SIZE+1));
868	>	}});
869
870	<	/**
871	<	* drainTo(null, n) throws NPE
872	<	*/
873	<	public void testDrainToNullN() {
874	<	ArrayBlockingQueue q = populatedQueue(SIZE);
875	<	try {
876	<	q.drainTo(null, 0);
877	<	shouldThrow();
1010	<	} catch(NullPointerException success) {
1011	<	}
1012	<	}
1013	<
1014	<	/**
1015	<	* drainTo(this, n) throws IAE
1016	<	*/
1017	<	public void testDrainToSelfN() {
1018	<	ArrayBlockingQueue q = populatedQueue(SIZE);
1019	<	try {
1020	<	q.drainTo(q, 0);
1021	<	shouldThrow();
1022	<	} catch(IllegalArgumentException success) {
1023	<	}
870	>	t.start();
871	>	ArrayList l = new ArrayList();
872	>	q.drainTo(l);
873	>	assertTrue(l.size() >= SIZE);
874	>	for (int i = 0; i < SIZE; ++i)
875	>	assertEquals(l.get(i), new Integer(i));
876	>	t.join();
877	>	assertTrue(q.size() + l.size() >= SIZE);
878		}
879
880		/**
881	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
882	<	*/
881	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
882	>	*/
883		public void testDrainToN() {
884	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2);
885		for (int i = 0; i < SIZE + 2; ++i) {
886	<	ArrayBlockingQueue q = populatedQueue(SIZE);
886	>	for (int j = 0; j < SIZE; j++)
887	>	assertTrue(q.offer(new Integer(j)));
888		ArrayList l = new ArrayList();
889		q.drainTo(l, i);
890	<	int k = (i < SIZE)? i : SIZE;
891	<	assertEquals(q.size(), SIZE-k);
892	<	assertEquals(l.size(), k);
893	<	for (int j = 0; j < k; ++j)
890	>	int k = (i < SIZE) ? i : SIZE;
891	>	assertEquals(k, l.size());
892	>	assertEquals(SIZE-k, q.size());
893	>	for (int j = 0; j < k; ++j)
894		assertEquals(l.get(j), new Integer(j));
895	+	while (q.poll() != null) ;
896		}
897		}
898
1042	–
899		}

Diff Legend

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