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

Diff Legend

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