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

Diff Legend

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