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

Diff Legend

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