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.4 by dl, Sat Sep 20 18:20:07 2003 UTC vs.
Revision 1.71 by jsr166, Sat Aug 6 17:02:49 2016 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 static java.util.concurrent.TimeUnit.MILLISECONDS;
10
11	<	import junit.framework.*;
12	<	import java.util.*;
13	<	import java.util.concurrent.*;
14	<	import java.io.*;
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.ArrayBlockingQueue;
18	>	import java.util.concurrent.BlockingQueue;
19	>	import java.util.concurrent.CountDownLatch;
20	>	import java.util.concurrent.Executors;
21	>	import java.util.concurrent.ExecutorService;
22	>
23	>	import junit.framework.Test;
24
25		public class ArrayBlockingQueueTest extends JSR166TestCase {
26	+
27	+	public static class Fair extends BlockingQueueTest {
28	+	protected BlockingQueue emptyCollection() {
29	+	return new ArrayBlockingQueue(SIZE, true);
30	+	}
31	+	}
32	+
33	+	public static class NonFair extends BlockingQueueTest {
34	+	protected BlockingQueue emptyCollection() {
35	+	return new ArrayBlockingQueue(SIZE, false);
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(ArrayBlockingQueueTest.class);
44	>	return newTestSuite(ArrayBlockingQueueTest.class,
45	>	new Fair().testSuite(),
46	>	new NonFair().testSuite());
47		}
48
49		/**
50	<	* Create a queue of given size containing consecutive
50	>	* Returns a new queue of given size containing consecutive
51		* Integers 0 ... n.
52		*/
53	<	private ArrayBlockingQueue populatedQueue(int n) {
54	<	ArrayBlockingQueue q = new ArrayBlockingQueue(n);
53	>	private ArrayBlockingQueue<Integer> populatedQueue(int n) {
54	>	ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<Integer>(n);
55		assertTrue(q.isEmpty());
56	<	for(int i = 0; i < n; i++)
57	<	assertTrue(q.offer(new Integer(i)));
56	>	for (int i = 0; i < n; i++)
57	>	assertTrue(q.offer(new Integer(i)));
58		assertFalse(q.isEmpty());
59		assertEquals(0, q.remainingCapacity());
60	<	assertEquals(n, q.size());
60	>	assertEquals(n, q.size());
61		return q;
62		}
63	<
63	>
64		/**
65	<	*
65	>	* A new queue has the indicated capacity
66		*/
67		public void testConstructor1() {
68		assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity());
69		}
70
71		/**
72	<	*
72	>	* Constructor throws IAE if capacity argument nonpositive
73		*/
74		public void testConstructor2() {
75		try {
76	<	ArrayBlockingQueue q = new ArrayBlockingQueue(0);
76	>	new ArrayBlockingQueue(0);
77		shouldThrow();
78	<	}
52	<	catch (IllegalArgumentException success) {}
78	>	} catch (IllegalArgumentException success) {}
79		}
80
81		/**
82	<	*
82	>	* Initializing from null Collection throws NPE
83		*/
84		public void testConstructor3() {
59	–
85		try {
86	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null);
86	>	new ArrayBlockingQueue(1, true, null);
87		shouldThrow();
88	<	}
64	<	catch (NullPointerException success) {}
88	>	} catch (NullPointerException success) {}
89		}
90
91		/**
92	<	*
92	>	* Initializing from Collection of null elements throws NPE
93		*/
94		public void testConstructor4() {
95	+	Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
96		try {
97	<	Integer[] ints = new Integer[SIZE];
73	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
97	>	new ArrayBlockingQueue(SIZE, false, elements);
98		shouldThrow();
99	<	}
76	<	catch (NullPointerException success) {}
99	>	} catch (NullPointerException success) {}
100		}
101
102		/**
103	<	*
103	>	* Initializing from Collection with some null elements throws NPE
104		*/
105		public void testConstructor5() {
106	+	Integer[] ints = new Integer[SIZE];
107	+	for (int i = 0; i < SIZE - 1; ++i)
108	+	ints[i] = i;
109	+	Collection<Integer> elements = Arrays.asList(ints);
110		try {
111	<	Integer[] ints = new Integer[SIZE];
85	<	for (int i = 0; i < SIZE-1; ++i)
86	<	ints[i] = new Integer(i);
87	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
111	>	new ArrayBlockingQueue(SIZE, false, elements);
112		shouldThrow();
113	<	}
90	<	catch (NullPointerException success) {}
113	>	} catch (NullPointerException success) {}
114		}
115
116		/**
117	<	*
117	>	* Initializing from too large collection throws IAE
118		*/
119		public void testConstructor6() {
120	+	Integer[] ints = new Integer[SIZE];
121	+	for (int i = 0; i < SIZE; ++i)
122	+	ints[i] = i;
123	+	Collection<Integer> elements = Arrays.asList(ints);
124		try {
125	<	Integer[] ints = new Integer[SIZE];
99	<	for (int i = 0; i < SIZE; ++i)
100	<	ints[i] = new Integer(i);
101	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1, false, Arrays.asList(ints));
125	>	new ArrayBlockingQueue(SIZE - 1, false, elements);
126		shouldThrow();
127	<	}
104	<	catch (IllegalArgumentException success) {}
127	>	} catch (IllegalArgumentException success) {}
128		}
129
130		/**
131	<	*
131	>	* Queue contains all elements of collection used to initialize
132		*/
133		public void testConstructor7() {
134	<	try {
135	<	Integer[] ints = new Integer[SIZE];
136	<	for (int i = 0; i < SIZE; ++i)
137	<	ints[i] = new Integer(i);
138	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints));
139	<	for (int i = 0; i < SIZE; ++i)
140	<	assertEquals(ints[i], q.poll());
118	<	}
119	<	finally {}
134	>	Integer[] ints = new Integer[SIZE];
135	>	for (int i = 0; i < SIZE; ++i)
136	>	ints[i] = i;
137	>	Collection<Integer> elements = Arrays.asList(ints);
138	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements);
139	>	for (int i = 0; i < SIZE; ++i)
140	>	assertEquals(ints[i], q.poll());
141		}
142
143		/**
144	<	*
144	>	* Queue transitions from empty to full when elements added
145		*/
146		public void testEmptyFull() {
147		ArrayBlockingQueue q = new ArrayBlockingQueue(2);
#	Line 135 | Line 156 | public class ArrayBlockingQueueTest exte
156		}
157
158		/**
159	<	*
159	>	* remainingCapacity decreases on add, increases on remove
160		*/
161		public void testRemainingCapacity() {
162	<	ArrayBlockingQueue q = populatedQueue(SIZE);
162	>	BlockingQueue q = populatedQueue(SIZE);
163		for (int i = 0; i < SIZE; ++i) {
164		assertEquals(i, q.remainingCapacity());
165	<	assertEquals(SIZE-i, q.size());
166	<	q.remove();
165	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
166	>	assertEquals(i, q.remove());
167		}
168		for (int i = 0; i < SIZE; ++i) {
169	<	assertEquals(SIZE-i, q.remainingCapacity());
170	<	assertEquals(i, q.size());
171	<	q.add(new Integer(i));
169	>	assertEquals(SIZE - i, q.remainingCapacity());
170	>	assertEquals(SIZE, q.size() + q.remainingCapacity());
171	>	assertTrue(q.add(i));
172		}
173		}
174
175		/**
176	<	*
156	<	*/
157	<	public void testOfferNull() {
158	<	try {
159	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
160	<	q.offer(null);
161	<	shouldThrow();
162	<	} catch (NullPointerException success) { }
163	<	}
164	<
165	<	/**
166	<	*
176	>	* Offer succeeds if not full; fails if full
177		*/
178		public void testOffer() {
179		ArrayBlockingQueue q = new ArrayBlockingQueue(1);
#	Line 172 | Line 182 | public class ArrayBlockingQueueTest exte
182		}
183
184		/**
185	<	*
185	>	* add succeeds if not full; throws ISE if full
186		*/
187		public void testAdd() {
188	<	try {
189	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
190	<	for (int i = 0; i < SIZE; ++i) {
191	<	assertTrue(q.add(new Integer(i)));
192	<	}
183	<	assertEquals(0, q.remainingCapacity());
184	<	q.add(new Integer(SIZE));
185	<	} catch (IllegalStateException success){
186	<	}
187	<	}
188	<
189	<	/**
190	<	*
191	<	*/
192	<	public void testAddAll1() {
188	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
189	>	for (int i = 0; i < SIZE; ++i) {
190	>	assertTrue(q.add(new Integer(i)));
191	>	}
192	>	assertEquals(0, q.remainingCapacity());
193		try {
194	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
195	<	q.addAll(null);
194	>	q.add(new Integer(SIZE));
195		shouldThrow();
196	<	}
198	<	catch (NullPointerException success) {}
196	>	} catch (IllegalStateException success) {}
197		}
198	+
199		/**
200	<	*
200	>	* addAll(this) throws IAE
201		*/
202	<	public void testAddAll2() {
202	>	public void testAddAllSelf() {
203	>	ArrayBlockingQueue q = populatedQueue(SIZE);
204		try {
205	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
206	<	Integer[] ints = new Integer[SIZE];
207	<	q.addAll(Arrays.asList(ints));
205	>	q.addAll(q);
206		shouldThrow();
207	<	}
210	<	catch (NullPointerException success) {}
207	>	} catch (IllegalArgumentException success) {}
208		}
209	+
210		/**
211	<	*
211	>	* addAll of a collection with any null elements throws NPE after
212	>	* possibly adding some elements
213		*/
214		public void testAddAll3() {
215	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
216	+	Integer[] ints = new Integer[SIZE];
217	+	for (int i = 0; i < SIZE - 1; ++i)
218	+	ints[i] = new Integer(i);
219		try {
217	–	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
218	–	Integer[] ints = new Integer[SIZE];
219	–	for (int i = 0; i < SIZE-1; ++i)
220	–	ints[i] = new Integer(i);
220		q.addAll(Arrays.asList(ints));
221		shouldThrow();
222	<	}
224	<	catch (NullPointerException success) {}
222	>	} catch (NullPointerException success) {}
223		}
224	+
225		/**
226	<	*
226	>	* addAll throws ISE if not enough room
227		*/
228		public void testAddAll4() {
229	+	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
230	+	Integer[] ints = new Integer[SIZE];
231	+	for (int i = 0; i < SIZE; ++i)
232	+	ints[i] = new Integer(i);
233		try {
231	–	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
232	–	Integer[] ints = new Integer[SIZE];
233	–	for (int i = 0; i < SIZE; ++i)
234	–	ints[i] = new Integer(i);
234		q.addAll(Arrays.asList(ints));
235		shouldThrow();
236	<	}
238	<	catch (IllegalStateException success) {}
236	>	} catch (IllegalStateException success) {}
237		}
238	+
239		/**
240	<	*
240	>	* Queue contains all elements, in traversal order, of successful addAll
241		*/
242		public void testAddAll5() {
243	<	try {
244	<	Integer[] empty = new Integer[0];
245	<	Integer[] ints = new Integer[SIZE];
246	<	for (int i = 0; i < SIZE; ++i)
247	<	ints[i] = new Integer(i);
248	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
249	<	assertFalse(q.addAll(Arrays.asList(empty)));
250	<	assertTrue(q.addAll(Arrays.asList(ints)));
251	<	for (int i = 0; i < SIZE; ++i)
253	<	assertEquals(ints[i], q.poll());
254	<	}
255	<	finally {}
256	<	}
257	<
258	<	/**
259	<	*
260	<	*/
261	<	public void testPutNull() {
262	<	try {
263	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
264	<	q.put(null);
265	<	shouldThrow();
266	<	}
267	<	catch (NullPointerException success){
268	<	}
269	<	catch (InterruptedException ie) {
270	<	unexpectedException();
271	<	}
272	<	}
273	<
274	<	/**
275	<	*
276	<	*/
277	<	public void testPut() {
278	<	try {
279	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
280	<	for (int i = 0; i < SIZE; ++i) {
281	<	Integer I = new Integer(i);
282	<	q.put(I);
283	<	assertTrue(q.contains(I));
284	<	}
285	<	assertEquals(0, q.remainingCapacity());
286	<	}
287	<	catch (InterruptedException ie) {
288	<	unexpectedException();
289	<	}
290	<	}
291	<
292	<	/**
293	<	*
294	<	*/
295	<	public void testBlockingPut() {
296	<	Thread t = new Thread(new Runnable() {
297	<	public void run() {
298	<	int added = 0;
299	<	try {
300	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
301	<	for (int i = 0; i < SIZE; ++i) {
302	<	q.put(new Integer(i));
303	<	++added;
304	<	}
305	<	q.put(new Integer(SIZE));
306	<	threadShouldThrow();
307	<	} catch (InterruptedException ie){
308	<	threadAssertEquals(added, SIZE);
309	<	}
310	<	}});
311	<	try {
312	<	t.start();
313	<	Thread.sleep(SHORT_DELAY_MS);
314	<	t.interrupt();
315	<	t.join();
316	<	}
317	<	catch (InterruptedException ie) {
318	<	unexpectedException();
319	<	}
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	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
248	>	assertFalse(q.addAll(Arrays.asList(empty)));
249	>	assertTrue(q.addAll(Arrays.asList(ints)));
250	>	for (int i = 0; i < SIZE; ++i)
251	>	assertEquals(ints[i], q.poll());
252		}
253
254		/**
255	<	*
255	>	* all elements successfully put are contained
256		*/
257	<	public void testPutWithTake() {
258	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
259	<	Thread t = new Thread(new Runnable() {
260	<	public void run() {
261	<	int added = 0;
262	<	try {
331	<	q.put(new Object());
332	<	++added;
333	<	q.put(new Object());
334	<	++added;
335	<	q.put(new Object());
336	<	++added;
337	<	q.put(new Object());
338	<	++added;
339	<	threadShouldThrow();
340	<	} catch (InterruptedException e){
341	<	threadAssertTrue(added >= 2);
342	<	}
343	<	}
344	<	});
345	<	try {
346	<	t.start();
347	<	Thread.sleep(SHORT_DELAY_MS);
348	<	q.take();
349	<	t.interrupt();
350	<	t.join();
351	<	} catch (Exception e){
352	<	unexpectedException();
257	>	public void testPut() throws InterruptedException {
258	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
259	>	for (int i = 0; i < SIZE; ++i) {
260	>	Integer x = new Integer(i);
261	>	q.put(x);
262	>	assertTrue(q.contains(x));
263		}
264	+	assertEquals(0, q.remainingCapacity());
265		}
266
267		/**
268	<	*
268	>	* put blocks interruptibly if full
269		*/
270	<	public void testTimedOffer() {
271	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
272	<	Thread t = new Thread(new Runnable() {
273	<	public void run() {
274	<	try {
275	<	q.put(new Object());
276	<	q.put(new Object());
277	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
278	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
279	<	threadShouldThrow();
280	<	} catch (InterruptedException success){}
281	<	}
282	<	});
283	<
284	<	try {
285	<	t.start();
286	<	Thread.sleep(SHORT_DELAY_MS);
287	<	t.interrupt();
288	<	t.join();
289	<	} catch (Exception e){
290	<	unexpectedException();
291	<	}
270	>	public void testBlockingPut() throws InterruptedException {
271	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
272	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
273	>	Thread t = newStartedThread(new CheckedRunnable() {
274	>	public void realRun() throws InterruptedException {
275	>	for (int i = 0; i < SIZE; ++i)
276	>	q.put(i);
277	>	assertEquals(SIZE, q.size());
278	>	assertEquals(0, q.remainingCapacity());
279	>
280	>	Thread.currentThread().interrupt();
281	>	try {
282	>	q.put(99);
283	>	shouldThrow();
284	>	} catch (InterruptedException success) {}
285	>	assertFalse(Thread.interrupted());
286	>
287	>	pleaseInterrupt.countDown();
288	>	try {
289	>	q.put(99);
290	>	shouldThrow();
291	>	} catch (InterruptedException success) {}
292	>	assertFalse(Thread.interrupted());
293	>	}});
294	>
295	>	await(pleaseInterrupt);
296	>	assertThreadStaysAlive(t);
297	>	t.interrupt();
298	>	awaitTermination(t);
299	>	assertEquals(SIZE, q.size());
300	>	assertEquals(0, q.remainingCapacity());
301		}
302
303		/**
304	<	*
304	>	* put blocks interruptibly waiting for take when full
305		*/
306	<	public void testTake() {
307	<	try {
308	<	ArrayBlockingQueue q = populatedQueue(SIZE);
309	<	for (int i = 0; i < SIZE; ++i) {
310	<	assertEquals(i, ((Integer)q.take()).intValue());
311	<	}
312	<	} catch (InterruptedException e){
313	<	unexpectedException();
314	<	}
306	>	public void testPutWithTake() throws InterruptedException {
307	>	final int capacity = 2;
308	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(capacity);
309	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
310	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
311	>	Thread t = newStartedThread(new CheckedRunnable() {
312	>	public void realRun() throws InterruptedException {
313	>	for (int i = 0; i < capacity; i++)
314	>	q.put(i);
315	>	pleaseTake.countDown();
316	>	q.put(86);
317	>
318	>	pleaseInterrupt.countDown();
319	>	try {
320	>	q.put(99);
321	>	shouldThrow();
322	>	} catch (InterruptedException success) {}
323	>	assertFalse(Thread.interrupted());
324	>	}});
325	>
326	>	await(pleaseTake);
327	>	assertEquals(0, q.remainingCapacity());
328	>	assertEquals(0, q.take());
329	>
330	>	await(pleaseInterrupt);
331	>	assertThreadStaysAlive(t);
332	>	t.interrupt();
333	>	awaitTermination(t);
334	>	assertEquals(0, q.remainingCapacity());
335		}
336
337		/**
338	<	*
338	>	* timed offer times out if full and elements not taken
339		*/
340	<	public void testTakeFromEmpty() {
340	>	public void testTimedOffer() throws InterruptedException {
341		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
342	<	Thread t = new Thread(new Runnable() {
343	<	public void run() {
344	<	try {
345	<	q.take();
346	<	threadShouldThrow();
347	<	} catch (InterruptedException success){ }
348	<	}
349	<	});
350	<	try {
351	<	t.start();
352	<	Thread.sleep(SHORT_DELAY_MS);
353	<	t.interrupt();
354	<	t.join();
355	<	} catch (Exception e){
416	<	unexpectedException();
417	<	}
418	<	}
342	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
343	>	Thread t = newStartedThread(new CheckedRunnable() {
344	>	public void realRun() throws InterruptedException {
345	>	q.put(new Object());
346	>	q.put(new Object());
347	>	long startTime = System.nanoTime();
348	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
349	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
350	>	pleaseInterrupt.countDown();
351	>	try {
352	>	q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
353	>	shouldThrow();
354	>	} catch (InterruptedException success) {}
355	>	}});
356
357	<	/**
358	<	*
359	<	*/
360	<	public void testBlockingTake() {
424	<	Thread t = new Thread(new Runnable() {
425	<	public void run() {
426	<	try {
427	<	ArrayBlockingQueue q = populatedQueue(SIZE);
428	<	for (int i = 0; i < SIZE; ++i) {
429	<	threadAssertEquals(i, ((Integer)q.take()).intValue());
430	<	}
431	<	q.take();
432	<	threadShouldThrow();
433	<	} catch (InterruptedException success){
434	<	}
435	<	}});
436	<	try {
437	<	t.start();
438	<	Thread.sleep(SHORT_DELAY_MS);
439	<	t.interrupt();
440	<	t.join();
441	<	}
442	<	catch (InterruptedException ie) {
443	<	unexpectedException();
444	<	}
357	>	await(pleaseInterrupt);
358	>	assertThreadStaysAlive(t);
359	>	t.interrupt();
360	>	awaitTermination(t);
361		}
362
447	–
363		/**
364	<	*
364	>	* take retrieves elements in FIFO order
365		*/
366	<	public void testPoll() {
366	>	public void testTake() throws InterruptedException {
367		ArrayBlockingQueue q = populatedQueue(SIZE);
368		for (int i = 0; i < SIZE; ++i) {
369	<	assertEquals(i, ((Integer)q.poll()).intValue());
369	>	assertEquals(i, q.take());
370		}
456	–	assertNull(q.poll());
371		}
372
373		/**
374	<	*
374	>	* Take removes existing elements until empty, then blocks interruptibly
375		*/
376	<	public void testTimedPoll0() {
377	<	try {
378	<	ArrayBlockingQueue q = populatedQueue(SIZE);
379	<	for (int i = 0; i < SIZE; ++i) {
380	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
381	<	}
382	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
383	<	} catch (InterruptedException e){
384	<	unexpectedException();
385	<	}
376	>	public void testBlockingTake() throws InterruptedException {
377	>	final ArrayBlockingQueue q = populatedQueue(SIZE);
378	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
379	>	Thread t = newStartedThread(new CheckedRunnable() {
380	>	public void realRun() throws InterruptedException {
381	>	for (int i = 0; i < SIZE; ++i) {
382	>	assertEquals(i, q.take());
383	>	}
384	>
385	>	Thread.currentThread().interrupt();
386	>	try {
387	>	q.take();
388	>	shouldThrow();
389	>	} catch (InterruptedException success) {}
390	>	assertFalse(Thread.interrupted());
391	>
392	>	pleaseInterrupt.countDown();
393	>	try {
394	>	q.take();
395	>	shouldThrow();
396	>	} catch (InterruptedException success) {}
397	>	assertFalse(Thread.interrupted());
398	>	}});
399	>
400	>	await(pleaseInterrupt);
401	>	assertThreadStaysAlive(t);
402	>	t.interrupt();
403	>	awaitTermination(t);
404		}
405
406		/**
407	<	*
407	>	* poll succeeds unless empty
408		*/
409	<	public void testTimedPoll() {
410	<	try {
411	<	ArrayBlockingQueue q = populatedQueue(SIZE);
412	<	for (int i = 0; i < SIZE; ++i) {
413	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
414	<	}
483	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
484	<	} catch (InterruptedException e){
485	<	unexpectedException();
486	<	}
409	>	public void testPoll() {
410	>	ArrayBlockingQueue q = populatedQueue(SIZE);
411	>	for (int i = 0; i < SIZE; ++i) {
412	>	assertEquals(i, q.poll());
413	>	}
414	>	assertNull(q.poll());
415		}
416
417		/**
418	<	*
419	<	*/
420	<	public void testInterruptedTimedPoll() {
421	<	Thread t = new Thread(new Runnable() {
422	<	public void run() {
423	<	try {
496	<	ArrayBlockingQueue q = populatedQueue(SIZE);
497	<	for (int i = 0; i < SIZE; ++i) {
498	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
499	<	}
500	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
501	<	} catch (InterruptedException success){
502	<	}
503	<	}});
504	<	try {
505	<	t.start();
506	<	Thread.sleep(SHORT_DELAY_MS);
507	<	t.interrupt();
508	<	t.join();
509	<	}
510	<	catch (InterruptedException ie) {
511	<	unexpectedException();
418	>	* timed poll with zero timeout succeeds when non-empty, else times out
419	>	*/
420	>	public void testTimedPoll0() throws InterruptedException {
421	>	ArrayBlockingQueue q = populatedQueue(SIZE);
422	>	for (int i = 0; i < SIZE; ++i) {
423	>	assertEquals(i, q.poll(0, MILLISECONDS));
424		}
425	+	assertNull(q.poll(0, MILLISECONDS));
426	+	checkEmpty(q);
427		}
428
429		/**
430	<	*
430	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
431		*/
432	<	public void testTimedPollWithOffer() {
433	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
434	<	Thread t = new Thread(new Runnable() {
435	<	public void run() {
436	<	try {
437	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
438	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
439	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
440	<	threadShouldThrow();
441	<	} catch (InterruptedException success) { }
432	>	public void testTimedPoll() throws InterruptedException {
433	>	ArrayBlockingQueue q = populatedQueue(SIZE);
434	>	for (int i = 0; i < SIZE; ++i) {
435	>	long startTime = System.nanoTime();
436	>	assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
437	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
438	>	}
439	>	long startTime = System.nanoTime();
440	>	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
441	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
442	>	checkEmpty(q);
443	>	}
444	>
445	>	/**
446	>	* Interrupted timed poll throws InterruptedException instead of
447	>	* returning timeout status
448	>	*/
449	>	public void testInterruptedTimedPoll() throws InterruptedException {
450	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
451	>	final CountDownLatch aboutToWait = new CountDownLatch(1);
452	>	Thread t = newStartedThread(new CheckedRunnable() {
453	>	public void realRun() throws InterruptedException {
454	>	long startTime = System.nanoTime();
455	>	for (int i = 0; i < SIZE; ++i) {
456	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
457		}
458	<	});
459	<	try {
460	<	t.start();
461	<	Thread.sleep(SMALL_DELAY_MS);
462	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
463	<	t.interrupt();
464	<	t.join();
465	<	} catch (Exception e){
537	<	unexpectedException();
538	<	}
539	<	}
458	>	aboutToWait.countDown();
459	>	try {
460	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
461	>	shouldThrow();
462	>	} catch (InterruptedException success) {
463	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
464	>	}
465	>	}});
466
467	+	await(aboutToWait);
468	+	waitForThreadToEnterWaitState(t);
469	+	t.interrupt();
470	+	awaitTermination(t);
471	+	checkEmpty(q);
472	+	}
473
474		/**
475	<	*
475	>	* peek returns next element, or null if empty
476		*/
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		/**
489	<	*
489	>	* element returns next element, or throws NSEE if empty
490		*/
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	<	}
569	<	catch (NoSuchElementException success) {}
500	>	} catch (NoSuchElementException success) {}
501		}
502
503		/**
504	<	*
504	>	* remove removes next element, or throws NSEE if empty
505		*/
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){
584	<	}
514	>	} catch (NoSuchElementException success) {}
515		}
516
517		/**
518	<	*
589	<	*/
590	<	public void testRemoveElement() {
591	<	ArrayBlockingQueue q = populatedQueue(SIZE);
592	<	for (int i = 1; i < SIZE; i+=2) {
593	<	assertTrue(q.remove(new Integer(i)));
594	<	}
595	<	for (int i = 0; i < SIZE; i+=2) {
596	<	assertTrue(q.remove(new Integer(i)));
597	<	assertFalse(q.remove(new Integer(i+1)));
598	<	}
599	<	assertTrue(q.isEmpty());
600	<	}
601	<
602	<	/**
603	<	*
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		}
528
529		/**
530	<	*
530	>	* clear removes all elements
531		*/
532		public void testClear() {
533		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 622 | 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		}
544
545		/**
546	<	*
546	>	* containsAll(c) is true when c contains a subset of elements
547		*/
548		public void testContainsAll() {
549		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 641 | Line 557 | public class ArrayBlockingQueueTest exte
557		}
558
559		/**
560	<	*
560	>	* retainAll(c) retains only those elements of c and reports true if changed
561		*/
562		public void testRetainAll() {
563		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 654 | Line 570 | public class ArrayBlockingQueueTest exte
570		assertTrue(changed);
571
572		assertTrue(q.containsAll(p));
573	<	assertEquals(SIZE-i, q.size());
573	>	assertEquals(SIZE - i, q.size());
574		p.remove();
575		}
576		}
577
578		/**
579	<	*
579	>	* removeAll(c) removes only those elements of c and reports true if changed
580		*/
581		public void testRemoveAll() {
582		for (int i = 1; i < SIZE; ++i) {
583		ArrayBlockingQueue q = populatedQueue(SIZE);
584		ArrayBlockingQueue p = populatedQueue(i);
585		assertTrue(q.removeAll(p));
586	<	assertEquals(SIZE-i, q.size());
586	>	assertEquals(SIZE - i, q.size());
587		for (int j = 0; j < i; ++j) {
588	<	Integer I = (Integer)(p.remove());
589	<	assertFalse(q.contains(I));
588	>	Integer x = (Integer)(p.remove());
589	>	assertFalse(q.contains(x));
590		}
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	<	*
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	>	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	<	*
661	>	* toArray(a) contains all elements in FIFO order
662		*/
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(incompatible array type) throws ArrayStoreException
684	+	*/
685	+	public void testToArray1_BadArg() {
686		ArrayBlockingQueue q = populatedQueue(SIZE);
687	<	Integer[] ints = new Integer[SIZE];
688	<	ints = (Integer[])q.toArray(ints);
689	<	try {
690	<	for(int i = 0; i < ints.length; i++)
702	<	assertEquals(ints[i], q.take());
703	<	} catch (InterruptedException e){
704	<	unexpectedException();
705	<	}
687	>	try {
688	>	q.toArray(new String[10]);
689	>	shouldThrow();
690	>	} catch (ArrayStoreException success) {}
691		}
692	<
692	>
693		/**
694	<	*
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());
702	<	}
703	<	} catch (InterruptedException e){
704	<	unexpectedException();
705	<	}
698	>	Iterator it = q.iterator();
699	>	int i;
700	>	for (i = 0; it.hasNext(); i++)
701	>	assertTrue(q.contains(it.next()));
702	>	assertEquals(i, SIZE);
703	>	assertIteratorExhausted(it);
704	>
705	>	it = q.iterator();
706	>	for (i = 0; it.hasNext(); i++)
707	>	assertEquals(it.next(), q.take());
708	>	assertEquals(i, SIZE);
709	>	assertIteratorExhausted(it);
710		}
711
712		/**
713	<	*
713	>	* iterator of empty collection has no elements
714	>	*/
715	>	public void testEmptyIterator() {
716	>	assertIteratorExhausted(new ArrayBlockingQueue(SIZE).iterator());
717	>	}
718	>
719	>	/**
720	>	* iterator.remove removes current element
721	>	*/
722	>	public void testIteratorRemove() {
723	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
724	>	q.add(two);
725	>	q.add(one);
726	>	q.add(three);
727	>
728	>	Iterator it = q.iterator();
729	>	it.next();
730	>	it.remove();
731	>
732	>	it = q.iterator();
733	>	assertSame(it.next(), one);
734	>	assertSame(it.next(), three);
735	>	assertFalse(it.hasNext());
736	>	}
737	>
738	>	/**
739	>	* iterator ordering is FIFO
740		*/
741		public void testIteratorOrdering() {
742		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
#	Line 733 | Line 748 | public class ArrayBlockingQueueTest exte
748
749		int k = 0;
750		for (Iterator it = q.iterator(); it.hasNext();) {
751	<	int i = ((Integer)(it.next())).intValue();
737	<	assertEquals(++k, i);
751	>	assertEquals(++k, it.next());
752		}
753		assertEquals(3, k);
754		}
755
756		/**
757	<	*
757	>	* Modifications do not cause iterators to fail
758		*/
759	<	public void testWeaklyConsistentIteration () {
759	>	public void testWeaklyConsistentIteration() {
760		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
761		q.add(one);
762		q.add(two);
763		q.add(three);
764	<	try {
765	<	for (Iterator it = q.iterator(); it.hasNext();) {
766	<	q.remove();
753	<	it.next();
754	<	}
755	<	}
756	<	catch (ConcurrentModificationException e) {
757	<	unexpectedException();
764	>	for (Iterator it = q.iterator(); it.hasNext();) {
765	>	q.remove();
766	>	it.next();
767		}
759	–
768		assertEquals(0, q.size());
769		}
770
763	–
771		/**
772	<	*
772	>	* toString contains toStrings of elements
773		*/
774		public void testToString() {
775		ArrayBlockingQueue q = populatedQueue(SIZE);
776		String s = q.toString();
777		for (int i = 0; i < SIZE; ++i) {
778	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
778	>	assertTrue(s.contains(String.valueOf(i)));
779		}
780	<	}
774	<
780	>	}
781
782		/**
783	<	*
783	>	* offer transfers elements across Executor tasks
784		*/
785		public void testOfferInExecutor() {
780	–
786		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
782	–
787		q.add(one);
788		q.add(two);
789	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
790	+	final ExecutorService executor = Executors.newFixedThreadPool(2);
791	+	try (PoolCleaner cleaner = cleaner(executor)) {
792	+	executor.execute(new CheckedRunnable() {
793	+	public void realRun() throws InterruptedException {
794	+	assertFalse(q.offer(three));
795	+	threadsStarted.await();
796	+	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
797	+	assertEquals(0, q.remainingCapacity());
798	+	}});
799
800	<	ExecutorService executor = Executors.newFixedThreadPool(2);
801	<
802	<	executor.execute(new Runnable() {
803	<	public void run() {
804	<	threadAssertFalse(q.offer(three));
805	<	try {
806	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
793	<	threadAssertEquals(0, q.remainingCapacity());
794	<	}
795	<	catch (InterruptedException e) {
796	<	threadUnexpectedException();
797	<	}
798	<	}
799	<	});
800	<
801	<	executor.execute(new Runnable() {
802	<	public void run() {
803	<	try {
804	<	Thread.sleep(SMALL_DELAY_MS);
805	<	threadAssertEquals(one, q.take());
806	<	}
807	<	catch (InterruptedException e) {
808	<	threadUnexpectedException();
809	<	}
810	<	}
811	<	});
812	<
813	<	joinPool(executor);
814	<
800	>	executor.execute(new CheckedRunnable() {
801	>	public void realRun() throws InterruptedException {
802	>	threadsStarted.await();
803	>	assertEquals(0, q.remainingCapacity());
804	>	assertSame(one, q.take());
805	>	}});
806	>	}
807		}
808
809		/**
810	<	*
810	>	* timed poll retrieves elements across Executor threads
811		*/
812		public void testPollInExecutor() {
821	–
813		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
814	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
815	+	final ExecutorService executor = Executors.newFixedThreadPool(2);
816	+	try (PoolCleaner cleaner = cleaner(executor)) {
817	+	executor.execute(new CheckedRunnable() {
818	+	public void realRun() throws InterruptedException {
819	+	assertNull(q.poll());
820	+	threadsStarted.await();
821	+	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
822	+	checkEmpty(q);
823	+	}});
824
825	<	ExecutorService executor = Executors.newFixedThreadPool(2);
826	<
827	<	executor.execute(new Runnable() {
827	<	public void run() {
828	<	threadAssertNull(q.poll());
829	<	try {
830	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
831	<	threadAssertTrue(q.isEmpty());
832	<	}
833	<	catch (InterruptedException e) {
834	<	threadUnexpectedException();
835	<	}
836	<	}
837	<	});
838	<
839	<	executor.execute(new Runnable() {
840	<	public void run() {
841	<	try {
842	<	Thread.sleep(SMALL_DELAY_MS);
825	>	executor.execute(new CheckedRunnable() {
826	>	public void realRun() throws InterruptedException {
827	>	threadsStarted.await();
828		q.put(one);
829	<	}
830	<	catch (InterruptedException e) {
831	<	threadUnexpectedException();
847	<	}
848	<	}
849	<	});
850	<
851	<	joinPool(executor);
829	>	}});
830	>	}
831	>	}
832
833	+	/**
834	+	* A deserialized serialized queue has same elements in same order
835	+	*/
836	+	public void testSerialization() throws Exception {
837	+	Queue x = populatedQueue(SIZE);
838	+	Queue y = serialClone(x);
839	+
840	+	assertNotSame(x, y);
841	+	assertEquals(x.size(), y.size());
842	+	assertEquals(x.toString(), y.toString());
843	+	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
844	+	while (!x.isEmpty()) {
845	+	assertFalse(y.isEmpty());
846	+	assertEquals(x.remove(), y.remove());
847	+	}
848	+	assertTrue(y.isEmpty());
849		}
850
851		/**
852	<	*
852	>	* drainTo(c) empties queue into another collection c
853		*/
854	<	public void testSerialization() {
854	>	public void testDrainTo() {
855		ArrayBlockingQueue q = populatedQueue(SIZE);
856	+	ArrayList l = new ArrayList();
857	+	q.drainTo(l);
858	+	assertEquals(0, q.size());
859	+	assertEquals(SIZE, l.size());
860	+	for (int i = 0; i < SIZE; ++i)
861	+	assertEquals(l.get(i), new Integer(i));
862	+	q.add(zero);
863	+	q.add(one);
864	+	assertFalse(q.isEmpty());
865	+	assertTrue(q.contains(zero));
866	+	assertTrue(q.contains(one));
867	+	l.clear();
868	+	q.drainTo(l);
869	+	assertEquals(0, q.size());
870	+	assertEquals(2, l.size());
871	+	for (int i = 0; i < 2; ++i)
872	+	assertEquals(l.get(i), new Integer(i));
873	+	}
874
875	<	try {
876	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
877	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
878	<	out.writeObject(q);
879	<	out.close();
875	>	/**
876	>	* drainTo empties full queue, unblocking a waiting put.
877	>	*/
878	>	public void testDrainToWithActivePut() throws InterruptedException {
879	>	final ArrayBlockingQueue q = populatedQueue(SIZE);
880	>	Thread t = new Thread(new CheckedRunnable() {
881	>	public void realRun() throws InterruptedException {
882	>	q.put(new Integer(SIZE + 1));
883	>	}});
884	>
885	>	t.start();
886	>	ArrayList l = new ArrayList();
887	>	q.drainTo(l);
888	>	assertTrue(l.size() >= SIZE);
889	>	for (int i = 0; i < SIZE; ++i)
890	>	assertEquals(l.get(i), new Integer(i));
891	>	t.join();
892	>	assertTrue(q.size() + l.size() >= SIZE);
893	>	}
894
895	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
896	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
897	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
898	<	assertEquals(q.size(), r.size());
899	<	while (!q.isEmpty())
900	<	assertEquals(q.remove(), r.remove());
901	<	} catch(Exception e){
902	<	unexpectedException();
895	>	/**
896	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
897	>	*/
898	>	public void testDrainToN() {
899	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE * 2);
900	>	for (int i = 0; i < SIZE + 2; ++i) {
901	>	for (int j = 0; j < SIZE; j++)
902	>	assertTrue(q.offer(new Integer(j)));
903	>	ArrayList l = new ArrayList();
904	>	q.drainTo(l, i);
905	>	int k = (i < SIZE) ? i : SIZE;
906	>	assertEquals(k, l.size());
907	>	assertEquals(SIZE - k, q.size());
908	>	for (int j = 0; j < k; ++j)
909	>	assertEquals(l.get(j), new Integer(j));
910	>	do {} while (q.poll() != null);
911		}
912		}
913
914	+	/**
915	+	* remove(null), contains(null) always return false
916	+	*/
917	+	public void testNeverContainsNull() {
918	+	Collection<?>[] qs = {
919	+	new ArrayBlockingQueue<Object>(10),
920	+	populatedQueue(2),
921	+	};
922
923	+	for (Collection<?> q : qs) {
924	+	assertFalse(q.contains(null));
925	+	assertFalse(q.remove(null));
926	+	}
927	+	}
928		}

Diff Legend

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