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

Diff Legend

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