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.97 by jsr166, Mon Dec 16 21:16:08 2019 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.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 = randomBoolean();
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	<
97	>
98		/**
99	<	*
99	>	* A new queue has the indicated capacity
100		*/
101		public void testConstructor1() {
102		assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity());
103		}
104
105		/**
106	<	*
106	>	* Constructor throws IllegalArgumentException 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		}
52	–	catch (IllegalArgumentException success) {}
121		}
122
123		/**
124	<	*
124	>	* Initializing from null Collection throws NPE
125		*/
126	<	public void testConstructor3() {
59	<
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	<	*
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	<	*
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	<	*
159	>	* Initializing from too large collection throws IllegalArgumentException
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	<	*
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	<	*
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));
198		}
199
200		/**
201	<	*
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(SIZE-i, q.remainingCapacity());
215	<	assertEquals(i, q.size());
216	<	q.add(new Integer(i));
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		}
218		}
219
220		/**
221	<	*
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	<	*
221	>	* Offer succeeds if not full; fails if full
222		*/
223		public void testOffer() {
224		ArrayBlockingQueue q = new ArrayBlockingQueue(1);
#	Line 172 | Line 227 | public class ArrayBlockingQueueTest exte
227		}
228
229		/**
230	<	*
230	>	* add succeeds if not full; throws IllegalStateException if full
231		*/
232		public void testAdd() {
233	<	try {
234	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
235	<	for (int i = 0; i < SIZE; ++i) {
181	<	assertTrue(q.add(new Integer(i)));
182	<	}
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() {
233	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
234	>	for (int i = 0; i < SIZE; i++) assertTrue(q.add((Integer) i));
235	>	assertEquals(0, q.remainingCapacity());
236		try {
237	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
195	<	q.addAll(null);
237	>	q.add((Integer) SIZE);
238		shouldThrow();
239	<	}
198	<	catch (NullPointerException success) {}
239	>	} catch (IllegalStateException success) {}
240		}
241	+
242		/**
243	<	*
243	>	* addAll(this) throws IllegalArgumentException
244		*/
245	<	public void testAddAll2() {
245	>	public void testAddAllSelf() {
246	>	ArrayBlockingQueue q = populatedQueue(SIZE);
247		try {
248	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
206	<	Integer[] ints = new Integer[SIZE];
207	<	q.addAll(Arrays.asList(ints));
248	>	q.addAll(q);
249		shouldThrow();
250	<	}
210	<	catch (NullPointerException success) {}
250	>	} catch (IllegalArgumentException success) {}
251		}
252	+
253		/**
254	<	*
254	>	* addAll of a collection with any null elements throws NPE after
255	>	* possibly adding some elements
256		*/
257		public void testAddAll3() {
258	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
259	+	Integer[] ints = new Integer[SIZE];
260	+	for (int i = 0; i < SIZE - 1; ++i)
261	+	ints[i] = new Integer(i);
262		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);
263		q.addAll(Arrays.asList(ints));
264		shouldThrow();
265	<	}
224	<	catch (NullPointerException success) {}
265	>	} catch (NullPointerException success) {}
266		}
267	+
268		/**
269	<	*
269	>	* addAll throws IllegalStateException if not enough room
270		*/
271	<	public void testAddAll4() {
271	>	public void testAddAll_insufficientSpace() {
272	>	int size = ThreadLocalRandom.current().nextInt(1, SIZE);
273	>	ArrayBlockingQueue q = populatedQueue(0, size, size, false);
274	>	// Just fits:
275	>	q.addAll(populatedQueue(size, size, 2 * size, false));
276	>	assertEquals(0, q.remainingCapacity());
277	>	assertEquals(size, q.size());
278	>	assertEquals(0, q.peek());
279		try {
280	<	ArrayBlockingQueue q = new ArrayBlockingQueue(1);
281	<	Integer[] ints = new Integer[SIZE];
233	<	for (int i = 0; i < SIZE; ++i)
234	<	ints[i] = new Integer(i);
235	<	q.addAll(Arrays.asList(ints));
280	>	q = populatedQueue(0, size, size, false);
281	>	q.addAll(Collections.nCopies(size + 1, 42));
282		shouldThrow();
283	<	}
238	<	catch (IllegalStateException success) {}
283	>	} catch (IllegalStateException success) {}
284		}
285	+
286		/**
287	<	*
287	>	* Queue contains all elements, in traversal order, of successful addAll
288		*/
289		public void testAddAll5() {
290	<	try {
291	<	Integer[] empty = new Integer[0];
292	<	Integer[] ints = new Integer[SIZE];
293	<	for (int i = 0; i < SIZE; ++i)
294	<	ints[i] = new Integer(i);
295	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
296	<	assertFalse(q.addAll(Arrays.asList(empty)));
297	<	assertTrue(q.addAll(Arrays.asList(ints)));
298	<	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	<	}
290	>	Integer[] empty = new Integer[0];
291	>	Integer[] ints = new Integer[SIZE];
292	>	for (int i = 0; i < SIZE; ++i)
293	>	ints[i] = new Integer(i);
294	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
295	>	assertFalse(q.addAll(Arrays.asList(empty)));
296	>	assertTrue(q.addAll(Arrays.asList(ints)));
297	>	for (int i = 0; i < SIZE; ++i)
298	>	assertEquals(ints[i], q.poll());
299		}
300
301		/**
302	<	*
302	>	* all elements successfully put are contained
303		*/
304	<	public void testPutWithTake() {
305	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
306	<	Thread t = new Thread(new Runnable() {
307	<	public void run() {
308	<	int added = 0;
309	<	try {
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();
304	>	public void testPut() throws InterruptedException {
305	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
306	>	for (int i = 0; i < SIZE; ++i) {
307	>	Integer x = new Integer(i);
308	>	q.put(x);
309	>	assertTrue(q.contains(x));
310		}
311	+	assertEquals(0, q.remainingCapacity());
312		}
313
314		/**
315	<	*
315	>	* put blocks interruptibly if full
316		*/
317	<	public void testTimedOffer() {
318	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
319	<	Thread t = new Thread(new Runnable() {
320	<	public void run() {
321	<	try {
322	<	q.put(new Object());
323	<	q.put(new Object());
324	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
325	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
326	<	threadShouldThrow();
327	<	} catch (InterruptedException success){}
328	<	}
329	<	});
330	<
331	<	try {
332	<	t.start();
333	<	Thread.sleep(SHORT_DELAY_MS);
334	<	t.interrupt();
335	<	t.join();
336	<	} catch (Exception e){
337	<	unexpectedException();
338	<	}
317	>	public void testBlockingPut() throws InterruptedException {
318	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
319	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
320	>	Thread t = newStartedThread(new CheckedRunnable() {
321	>	public void realRun() throws InterruptedException {
322	>	for (int i = 0; i < SIZE; ++i)
323	>	q.put(i);
324	>	assertEquals(SIZE, q.size());
325	>	assertEquals(0, q.remainingCapacity());
326	>
327	>	Thread.currentThread().interrupt();
328	>	try {
329	>	q.put(99);
330	>	shouldThrow();
331	>	} catch (InterruptedException success) {}
332	>	assertFalse(Thread.interrupted());
333	>
334	>	pleaseInterrupt.countDown();
335	>	try {
336	>	q.put(99);
337	>	shouldThrow();
338	>	} catch (InterruptedException success) {}
339	>	assertFalse(Thread.interrupted());
340	>	}});
341	>
342	>	await(pleaseInterrupt);
343	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING);
344	>	t.interrupt();
345	>	awaitTermination(t);
346	>	assertEquals(SIZE, q.size());
347	>	assertEquals(0, q.remainingCapacity());
348		}
349
350		/**
351	<	*
351	>	* put blocks interruptibly waiting for take when full
352		*/
353	<	public void testTake() {
354	<	try {
355	<	ArrayBlockingQueue q = populatedQueue(SIZE);
356	<	for (int i = 0; i < SIZE; ++i) {
357	<	assertEquals(i, ((Integer)q.take()).intValue());
358	<	}
359	<	} catch (InterruptedException e){
360	<	unexpectedException();
361	<	}
353	>	public void testPutWithTake() throws InterruptedException {
354	>	final int capacity = 2;
355	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(capacity);
356	>	final CountDownLatch pleaseTake = new CountDownLatch(1);
357	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
358	>	Thread t = newStartedThread(new CheckedRunnable() {
359	>	public void realRun() throws InterruptedException {
360	>	for (int i = 0; i < capacity; i++)
361	>	q.put(i);
362	>	pleaseTake.countDown();
363	>	q.put(86);
364	>
365	>	Thread.currentThread().interrupt();
366	>	try {
367	>	q.put(99);
368	>	shouldThrow();
369	>	} catch (InterruptedException success) {}
370	>	assertFalse(Thread.interrupted());
371	>
372	>	pleaseInterrupt.countDown();
373	>	try {
374	>	q.put(99);
375	>	shouldThrow();
376	>	} catch (InterruptedException success) {}
377	>	assertFalse(Thread.interrupted());
378	>	}});
379	>
380	>	await(pleaseTake);
381	>	assertEquals(0, q.remainingCapacity());
382	>	assertEquals(0, q.take());
383	>
384	>	await(pleaseInterrupt);
385	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING);
386	>	t.interrupt();
387	>	awaitTermination(t);
388	>	assertEquals(0, q.remainingCapacity());
389		}
390
391		/**
392	<	*
392	>	* timed offer times out if full and elements not taken
393		*/
394	<	public void testTakeFromEmpty() {
394	>	public void testTimedOffer() {
395		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
396	<	Thread t = new Thread(new Runnable() {
397	<	public void run() {
398	<	try {
399	<	q.take();
400	<	threadShouldThrow();
401	<	} catch (InterruptedException success){ }
402	<	}
403	<	});
404	<	try {
405	<	t.start();
406	<	Thread.sleep(SHORT_DELAY_MS);
407	<	t.interrupt();
408	<	t.join();
409	<	} catch (Exception e){
410	<	unexpectedException();
411	<	}
396	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
397	>	Thread t = newStartedThread(new CheckedRunnable() {
398	>	public void realRun() throws InterruptedException {
399	>	q.put(new Object());
400	>	q.put(new Object());
401	>	long startTime = System.nanoTime();
402	>	assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
403	>	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
404	>
405	>	Thread.currentThread().interrupt();
406	>	try {
407	>	q.offer(new Object(), randomTimeout(), randomTimeUnit());
408	>	shouldThrow();
409	>	} catch (InterruptedException success) {}
410	>	assertFalse(Thread.interrupted());
411	>
412	>	pleaseInterrupt.countDown();
413	>	try {
414	>	q.offer(new Object(), LONGER_DELAY_MS, MILLISECONDS);
415	>	shouldThrow();
416	>	} catch (InterruptedException success) {}
417	>	assertFalse(Thread.interrupted());
418	>	}});
419	>
420	>	await(pleaseInterrupt);
421	>	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
422	>	t.interrupt();
423	>	awaitTermination(t);
424		}
425
426		/**
427	<	*
428	<	*/
429	<	public void testBlockingTake() {
430	<	Thread t = new Thread(new Runnable() {
431	<	public void run() {
432	<	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();
427	>	* take retrieves elements in FIFO order
428	>	*/
429	>	public void testTake() throws InterruptedException {
430	>	ArrayBlockingQueue q = populatedQueue(SIZE);
431	>	for (int i = 0; i < SIZE; ++i) {
432	>	assertEquals(i, q.take());
433		}
434		}
435
436	+	/**
437	+	* Take removes existing elements until empty, then blocks interruptibly
438	+	*/
439	+	public void testBlockingTake() throws InterruptedException {
440	+	final ArrayBlockingQueue q = populatedQueue(SIZE);
441	+	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
442	+	Thread t = newStartedThread(new CheckedRunnable() {
443	+	public void realRun() throws InterruptedException {
444	+	for (int i = 0; i < SIZE; i++) assertEquals(i, q.take());
445	+
446	+	Thread.currentThread().interrupt();
447	+	try {
448	+	q.take();
449	+	shouldThrow();
450	+	} catch (InterruptedException success) {}
451	+	assertFalse(Thread.interrupted());
452	+
453	+	pleaseInterrupt.countDown();
454	+	try {
455	+	q.take();
456	+	shouldThrow();
457	+	} catch (InterruptedException success) {}
458	+	assertFalse(Thread.interrupted());
459	+	}});
460	+
461	+	await(pleaseInterrupt);
462	+	if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING);
463	+	t.interrupt();
464	+	awaitTermination(t);
465	+	}
466
467		/**
468	<	*
468	>	* poll succeeds unless empty
469		*/
470		public void testPoll() {
471		ArrayBlockingQueue q = populatedQueue(SIZE);
472		for (int i = 0; i < SIZE; ++i) {
473	<	assertEquals(i, ((Integer)q.poll()).intValue());
473	>	assertEquals(i, q.poll());
474		}
475	<	assertNull(q.poll());
475	>	assertNull(q.poll());
476		}
477
478		/**
479	<	*
479	>	* timed poll with zero timeout succeeds when non-empty, else times out
480		*/
481	<	public void testTimedPoll0() {
482	<	try {
483	<	ArrayBlockingQueue q = populatedQueue(SIZE);
484	<	for (int i = 0; i < SIZE; ++i) {
485	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
486	<	}
487	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
469	<	} catch (InterruptedException e){
470	<	unexpectedException();
471	<	}
481	>	public void testTimedPoll0() throws InterruptedException {
482	>	ArrayBlockingQueue q = populatedQueue(SIZE);
483	>	for (int i = 0; i < SIZE; ++i) {
484	>	assertEquals(i, q.poll(0, MILLISECONDS));
485	>	}
486	>	assertNull(q.poll(0, MILLISECONDS));
487	>	checkEmpty(q);
488		}
489
490		/**
491	<	*
491	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
492		*/
493	<	public void testTimedPoll() {
494	<	try {
495	<	ArrayBlockingQueue q = populatedQueue(SIZE);
496	<	for (int i = 0; i < SIZE; ++i) {
497	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
498	<	}
483	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
484	<	} catch (InterruptedException e){
485	<	unexpectedException();
486	<	}
487	<	}
488	<
489	<	/**
490	<	*
491	<	*/
492	<	public void testInterruptedTimedPoll() {
493	<	Thread t = new Thread(new Runnable() {
494	<	public void run() {
495	<	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();
493	>	public void testTimedPoll() throws InterruptedException {
494	>	ArrayBlockingQueue q = populatedQueue(SIZE);
495	>	for (int i = 0; i < SIZE; ++i) {
496	>	long startTime = System.nanoTime();
497	>	assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS));
498	>	assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS);
499		}
500	+	long startTime = System.nanoTime();
501	+	assertNull(q.poll(timeoutMillis(), MILLISECONDS));
502	+	assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
503	+	checkEmpty(q);
504		}
505
506		/**
507	<	*
507	>	* Interrupted timed poll throws InterruptedException instead of
508	>	* returning timeout status
509		*/
510	<	public void testTimedPollWithOffer() {
511	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
512	<	Thread t = new Thread(new Runnable() {
513	<	public void run() {
514	<	try {
515	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
516	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
525	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
526	<	threadShouldThrow();
527	<	} catch (InterruptedException success) { }
528	<	}
529	<	});
530	<	try {
531	<	t.start();
532	<	Thread.sleep(SMALL_DELAY_MS);
533	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
534	<	t.interrupt();
535	<	t.join();
536	<	} catch (Exception e){
537	<	unexpectedException();
538	<	}
539	<	}
510	>	public void testInterruptedTimedPoll() throws InterruptedException {
511	>	final BlockingQueue<Integer> q = populatedQueue(SIZE);
512	>	final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
513	>	Thread t = newStartedThread(new CheckedRunnable() {
514	>	public void realRun() throws InterruptedException {
515	>	for (int i = 0; i < SIZE; i++)
516	>	assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS));
517
518	+	Thread.currentThread().interrupt();
519	+	try {
520	+	q.poll(randomTimeout(), randomTimeUnit());
521	+	shouldThrow();
522	+	} catch (InterruptedException success) {}
523	+	assertFalse(Thread.interrupted());
524	+
525	+	pleaseInterrupt.countDown();
526	+	try {
527	+	q.poll(LONGER_DELAY_MS, MILLISECONDS);
528	+	shouldThrow();
529	+	} catch (InterruptedException success) {}
530	+	assertFalse(Thread.interrupted());
531	+	}});
532	+
533	+	await(pleaseInterrupt);
534	+	if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING);
535	+	t.interrupt();
536	+	awaitTermination(t);
537	+	checkEmpty(q);
538	+	}
539
540		/**
541	<	*
541	>	* peek returns next element, or null if empty
542		*/
543		public void testPeek() {
544		ArrayBlockingQueue q = populatedQueue(SIZE);
545		for (int i = 0; i < SIZE; ++i) {
546	<	assertEquals(i, ((Integer)q.peek()).intValue());
547	<	q.poll();
546	>	assertEquals(i, q.peek());
547	>	assertEquals(i, q.poll());
548		assertTrue(q.peek() == null ||
549	<	i != ((Integer)q.peek()).intValue());
549	>	!q.peek().equals(i));
550		}
551	<	assertNull(q.peek());
551	>	assertNull(q.peek());
552		}
553
554		/**
555	<	*
555	>	* element returns next element, or throws NSEE if empty
556		*/
557		public void testElement() {
558		ArrayBlockingQueue q = populatedQueue(SIZE);
559		for (int i = 0; i < SIZE; ++i) {
560	<	assertEquals(i, ((Integer)q.element()).intValue());
561	<	q.poll();
560	>	assertEquals(i, q.element());
561	>	assertEquals(i, q.poll());
562		}
563		try {
564		q.element();
565		shouldThrow();
566	<	}
569	<	catch (NoSuchElementException success) {}
566	>	} catch (NoSuchElementException success) {}
567		}
568
569		/**
570	<	*
570	>	* remove removes next element, or throws NSEE if empty
571		*/
572		public void testRemove() {
573		ArrayBlockingQueue q = populatedQueue(SIZE);
574		for (int i = 0; i < SIZE; ++i) {
575	<	assertEquals(i, ((Integer)q.remove()).intValue());
575	>	assertEquals(i, q.remove());
576		}
577		try {
578		q.remove();
579		shouldThrow();
580	<	} catch (NoSuchElementException success){
584	<	}
580	>	} catch (NoSuchElementException success) {}
581		}
582
583		/**
584	<	*
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	<	*
584	>	* contains(x) reports true when elements added but not yet removed
585		*/
586		public void testContains() {
587	<	ArrayBlockingQueue q = populatedQueue(SIZE);
588	<	for (int i = 0; i < SIZE; ++i) {
587	>	int size = ThreadLocalRandom.current().nextInt(1, SIZE);
588	>	ArrayBlockingQueue q = populatedQueue(size, size, 2 * size, false);
589	>	assertFalse(q.contains(null));
590	>	for (int i = 0; i < size; ++i) {
591		assertTrue(q.contains(new Integer(i)));
592	<	q.poll();
592	>	assertEquals(i, q.poll());
593		assertFalse(q.contains(new Integer(i)));
594		}
595		}
596
597		/**
598	<	*
598	>	* clear removes all elements
599		*/
600		public void testClear() {
601	<	ArrayBlockingQueue q = populatedQueue(SIZE);
601	>	int size = ThreadLocalRandom.current().nextInt(1, 5);
602	>	ArrayBlockingQueue q = populatedQueue(size, size, 2 * size, false);
603	>	int capacity = size + q.remainingCapacity();
604		q.clear();
605		assertTrue(q.isEmpty());
606		assertEquals(0, q.size());
607	<	assertEquals(SIZE, q.remainingCapacity());
607	>	assertEquals(capacity, q.remainingCapacity());
608		q.add(one);
609		assertFalse(q.isEmpty());
610	+	assertTrue(q.contains(one));
611		q.clear();
612		assertTrue(q.isEmpty());
613		}
614
615		/**
616	<	*
616	>	* containsAll(c) is true when c contains a subset of elements
617		*/
618		public void testContainsAll() {
619		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 641 | Line 627 | public class ArrayBlockingQueueTest exte
627		}
628
629		/**
630	<	*
630	>	* retainAll(c) retains only those elements of c and reports true if changed
631		*/
632		public void testRetainAll() {
633		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 654 | Line 640 | public class ArrayBlockingQueueTest exte
640		assertTrue(changed);
641
642		assertTrue(q.containsAll(p));
643	<	assertEquals(SIZE-i, q.size());
643	>	assertEquals(SIZE - i, q.size());
644		p.remove();
645		}
646		}
647
648		/**
649	<	*
649	>	* removeAll(c) removes only those elements of c and reports true if changed
650		*/
651		public void testRemoveAll() {
652		for (int i = 1; i < SIZE; ++i) {
653		ArrayBlockingQueue q = populatedQueue(SIZE);
654		ArrayBlockingQueue p = populatedQueue(i);
655		assertTrue(q.removeAll(p));
656	<	assertEquals(SIZE-i, q.size());
656	>	assertEquals(SIZE - i, q.size());
657		for (int j = 0; j < i; ++j) {
658	<	Integer I = (Integer)(p.remove());
659	<	assertFalse(q.contains(I));
658	>	Integer x = (Integer)(p.remove());
659	>	assertFalse(q.contains(x));
660		}
661		}
662		}
663
664	+	void checkToArray(ArrayBlockingQueue<Integer> q) {
665	+	int size = q.size();
666	+	Object[] a1 = q.toArray();
667	+	assertEquals(size, a1.length);
668	+	Integer[] a2 = q.toArray(new Integer[0]);
669	+	assertEquals(size, a2.length);
670	+	Integer[] a3 = q.toArray(new Integer[Math.max(0, size - 1)]);
671	+	assertEquals(size, a3.length);
672	+	Integer[] a4 = new Integer[size];
673	+	assertSame(a4, q.toArray(a4));
674	+	Integer[] a5 = new Integer[size + 1];
675	+	Arrays.fill(a5, 42);
676	+	assertSame(a5, q.toArray(a5));
677	+	Integer[] a6 = new Integer[size + 2];
678	+	Arrays.fill(a6, 42);
679	+	assertSame(a6, q.toArray(a6));
680	+	Object[][] as = { a1, a2, a3, a4, a5, a6 };
681	+	for (Object[] a : as) {
682	+	if (a.length > size) assertNull(a[size]);
683	+	if (a.length > size + 1) assertEquals(42, a[size + 1]);
684	+	}
685	+	Iterator it = q.iterator();
686	+	Integer s = q.peek();
687	+	for (int i = 0; i < size; i++) {
688	+	Integer x = (Integer) it.next();
689	+	assertEquals(s + i, (int) x);
690	+	for (Object[] a : as)
691	+	assertSame(a[i], x);
692	+	}
693	+	}
694
695		/**
696	<	*
696	>	* toArray() and toArray(a) contain all elements in FIFO order
697		*/
698		public void testToArray() {
699	<	ArrayBlockingQueue q = populatedQueue(SIZE);
700	<	Object[] o = q.toArray();
701	<	try {
702	<	for(int i = 0; i < o.length; i++)
703	<	assertEquals(o[i], q.take());
704	<	} catch (InterruptedException e){
705	<	unexpectedException();
706	<	}
699	>	final ThreadLocalRandom rnd = ThreadLocalRandom.current();
700	>	final int size = rnd.nextInt(6);
701	>	final int capacity = Math.max(1, size + rnd.nextInt(size + 1));
702	>	ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<>(capacity);
703	>	for (int i = 0; i < size; i++) {
704	>	checkToArray(q);
705	>	q.add(i);
706	>	}
707	>	// Provoke wraparound
708	>	int added = size * 2;
709	>	for (int i = 0; i < added; i++) {
710	>	checkToArray(q);
711	>	assertEquals((Integer) i, q.poll());
712	>	q.add(size + i);
713	>	}
714	>	for (int i = 0; i < size; i++) {
715	>	checkToArray(q);
716	>	assertEquals((Integer) (added + i), q.poll());
717	>	}
718		}
719
720		/**
721	<	*
721	>	* toArray(incompatible array type) throws ArrayStoreException
722		*/
723	<	public void testToArray2() {
723	>	public void testToArray_incompatibleArrayType() {
724		ArrayBlockingQueue q = populatedQueue(SIZE);
725	<	Integer[] ints = new Integer[SIZE];
726	<	ints = (Integer[])q.toArray(ints);
727	<	try {
728	<	for(int i = 0; i < ints.length; i++)
729	<	assertEquals(ints[i], q.take());
730	<	} catch (InterruptedException e){
731	<	unexpectedException();
732	<	}
725	>	try {
726	>	q.toArray(new String[10]);
727	>	shouldThrow();
728	>	} catch (ArrayStoreException success) {}
729	>	try {
730	>	q.toArray(new String[0]);
731	>	shouldThrow();
732	>	} catch (ArrayStoreException success) {}
733		}
734	<
734	>
735		/**
736	<	*
736	>	* iterator iterates through all elements
737		*/
738	<	public void testIterator() {
738	>	public void testIterator() throws InterruptedException {
739		ArrayBlockingQueue q = populatedQueue(SIZE);
740	<	Iterator it = q.iterator();
741	<	try {
742	<	while(it.hasNext()){
743	<	assertEquals(it.next(), q.take());
744	<	}
745	<	} catch (InterruptedException e){
746	<	unexpectedException();
747	<	}
740	>	Iterator it = q.iterator();
741	>	int i;
742	>	for (i = 0; it.hasNext(); i++)
743	>	assertTrue(q.contains(it.next()));
744	>	assertEquals(i, SIZE);
745	>	assertIteratorExhausted(it);
746	>
747	>	it = q.iterator();
748	>	for (i = 0; it.hasNext(); i++)
749	>	assertEquals(it.next(), q.take());
750	>	assertEquals(i, SIZE);
751	>	assertIteratorExhausted(it);
752	>	}
753	>
754	>	/**
755	>	* iterator of empty collection has no elements
756	>	*/
757	>	public void testEmptyIterator() {
758	>	assertIteratorExhausted(new ArrayBlockingQueue(SIZE).iterator());
759	>	}
760	>
761	>	/**
762	>	* iterator.remove removes current element
763	>	*/
764	>	public void testIteratorRemove() {
765	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
766	>	q.add(two);
767	>	q.add(one);
768	>	q.add(three);
769	>
770	>	Iterator it = q.iterator();
771	>	it.next();
772	>	it.remove();
773	>
774	>	it = q.iterator();
775	>	assertSame(it.next(), one);
776	>	assertSame(it.next(), three);
777	>	assertFalse(it.hasNext());
778		}
779
780		/**
781	<	*
781	>	* iterator ordering is FIFO
782		*/
783		public void testIteratorOrdering() {
784		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
#	Line 733 | Line 790 | public class ArrayBlockingQueueTest exte
790
791		int k = 0;
792		for (Iterator it = q.iterator(); it.hasNext();) {
793	<	int i = ((Integer)(it.next())).intValue();
737	<	assertEquals(++k, i);
793	>	assertEquals(++k, it.next());
794		}
795		assertEquals(3, k);
796		}
797
798		/**
799	<	*
799	>	* Modifications do not cause iterators to fail
800		*/
801	<	public void testWeaklyConsistentIteration () {
801	>	public void testWeaklyConsistentIteration() {
802		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
803		q.add(one);
804		q.add(two);
805		q.add(three);
806	<	try {
807	<	for (Iterator it = q.iterator(); it.hasNext();) {
808	<	q.remove();
753	<	it.next();
754	<	}
755	<	}
756	<	catch (ConcurrentModificationException e) {
757	<	unexpectedException();
806	>	for (Iterator it = q.iterator(); it.hasNext();) {
807	>	q.remove();
808	>	it.next();
809		}
759	–
810		assertEquals(0, q.size());
811		}
812
763	–
813		/**
814	<	*
814	>	* toString contains toStrings of elements
815		*/
816		public void testToString() {
817		ArrayBlockingQueue q = populatedQueue(SIZE);
818		String s = q.toString();
819		for (int i = 0; i < SIZE; ++i) {
820	<	assertTrue(s.indexOf(String.valueOf(i)) >= 0);
820	>	assertTrue(s.contains(String.valueOf(i)));
821		}
822	<	}
774	<
822	>	}
823
824		/**
825	<	*
825	>	* offer transfers elements across Executor tasks
826		*/
827		public void testOfferInExecutor() {
780	–
828		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
782	–
829		q.add(one);
830		q.add(two);
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	+	assertFalse(q.offer(three));
837	+	threadsStarted.await();
838	+	assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS));
839	+	assertEquals(0, q.remainingCapacity());
840	+	}});
841
842	<	ExecutorService executor = Executors.newFixedThreadPool(2);
843	<
844	<	executor.execute(new Runnable() {
845	<	public void run() {
846	<	threadAssertFalse(q.offer(three));
847	<	try {
848	<	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	<
842	>	executor.execute(new CheckedRunnable() {
843	>	public void realRun() throws InterruptedException {
844	>	threadsStarted.await();
845	>	assertEquals(0, q.remainingCapacity());
846	>	assertSame(one, q.take());
847	>	}});
848	>	}
849		}
850
851		/**
852	<	*
852	>	* timed poll retrieves elements across Executor threads
853		*/
854		public void testPollInExecutor() {
821	–
855		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
856	+	final CheckedBarrier threadsStarted = new CheckedBarrier(2);
857	+	final ExecutorService executor = Executors.newFixedThreadPool(2);
858	+	try (PoolCleaner cleaner = cleaner(executor)) {
859	+	executor.execute(new CheckedRunnable() {
860	+	public void realRun() throws InterruptedException {
861	+	assertNull(q.poll());
862	+	threadsStarted.await();
863	+	assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
864	+	checkEmpty(q);
865	+	}});
866
867	<	ExecutorService executor = Executors.newFixedThreadPool(2);
868	<
869	<	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);
867	>	executor.execute(new CheckedRunnable() {
868	>	public void realRun() throws InterruptedException {
869	>	threadsStarted.await();
870		q.put(one);
871	<	}
872	<	catch (InterruptedException e) {
873	<	threadUnexpectedException();
847	<	}
848	<	}
849	<	});
850	<
851	<	joinPool(executor);
871	>	}});
872	>	}
873	>	}
874
875	+	/**
876	+	* A deserialized/reserialized queue has same elements in same order
877	+	*/
878	+	public void testSerialization() throws Exception {
879	+	Queue x = populatedQueue(SIZE);
880	+	Queue y = serialClone(x);
881	+
882	+	assertNotSame(x, y);
883	+	assertEquals(x.size(), y.size());
884	+	assertEquals(x.toString(), y.toString());
885	+	assertTrue(Arrays.equals(x.toArray(), y.toArray()));
886	+	while (!x.isEmpty()) {
887	+	assertFalse(y.isEmpty());
888	+	assertEquals(x.remove(), y.remove());
889	+	}
890	+	assertTrue(y.isEmpty());
891		}
892
893		/**
894	<	*
894	>	* drainTo(c) empties queue into another collection c
895		*/
896	<	public void testSerialization() {
896	>	public void testDrainTo() {
897		ArrayBlockingQueue q = populatedQueue(SIZE);
898	+	ArrayList l = new ArrayList();
899	+	q.drainTo(l);
900	+	assertEquals(0, q.size());
901	+	assertEquals(SIZE, l.size());
902	+	for (int i = 0; i < SIZE; ++i)
903	+	assertEquals(l.get(i), new Integer(i));
904	+	q.add(zero);
905	+	q.add(one);
906	+	assertFalse(q.isEmpty());
907	+	assertTrue(q.contains(zero));
908	+	assertTrue(q.contains(one));
909	+	l.clear();
910	+	q.drainTo(l);
911	+	assertEquals(0, q.size());
912	+	assertEquals(2, l.size());
913	+	for (int i = 0; i < 2; ++i)
914	+	assertEquals(l.get(i), new Integer(i));
915	+	}
916
917	<	try {
918	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
919	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
920	<	out.writeObject(q);
921	<	out.close();
917	>	/**
918	>	* drainTo empties full queue, unblocking a waiting put.
919	>	*/
920	>	public void testDrainToWithActivePut() throws InterruptedException {
921	>	final ArrayBlockingQueue q = populatedQueue(SIZE);
922	>	Thread t = new Thread(new CheckedRunnable() {
923	>	public void realRun() throws InterruptedException {
924	>	q.put(new Integer(SIZE + 1));
925	>	}});
926	>
927	>	t.start();
928	>	ArrayList l = new ArrayList();
929	>	q.drainTo(l);
930	>	assertTrue(l.size() >= SIZE);
931	>	for (int i = 0; i < SIZE; ++i)
932	>	assertEquals(l.get(i), new Integer(i));
933	>	t.join();
934	>	assertTrue(q.size() + l.size() >= SIZE);
935	>	}
936
937	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
938	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
939	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
940	<	assertEquals(q.size(), r.size());
941	<	while (!q.isEmpty())
942	<	assertEquals(q.remove(), r.remove());
943	<	} catch(Exception e){
944	<	unexpectedException();
937	>	/**
938	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
939	>	*/
940	>	public void testDrainToN() {
941	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE * 2);
942	>	for (int i = 0; i < SIZE + 2; ++i) {
943	>	for (int j = 0; j < SIZE; j++)
944	>	assertTrue(q.offer(new Integer(j)));
945	>	ArrayList l = new ArrayList();
946	>	q.drainTo(l, i);
947	>	int k = (i < SIZE) ? i : SIZE;
948	>	assertEquals(k, l.size());
949	>	assertEquals(SIZE - k, q.size());
950	>	for (int j = 0; j < k; ++j)
951	>	assertEquals(l.get(j), new Integer(j));
952	>	do {} while (q.poll() != null);
953		}
954		}
955
956	+	/**
957	+	* remove(null), contains(null) always return false
958	+	*/
959	+	public void testNeverContainsNull() {
960	+	Collection<?>[] qs = {
961	+	populatedQueue(0, 1, 10, false),
962	+	populatedQueue(2, 2, 10, true),
963	+	};
964
965	+	for (Collection<?> q : qs) {
966	+	assertFalse(q.contains(null));
967	+	assertFalse(q.remove(null));
968	+	}
969	+	}
970		}

Diff Legend

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