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.15 by jsr166, Sat Nov 21 02:07:26 2009 UTC vs.
Revision 1.77 by jsr166, Sun Nov 6 03:11:15 2016 UTC

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

Diff Legend

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