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

Diff Legend

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