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.25 by jsr166, Sun Nov 22 00:17:37 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() {
318	>	/**
319	>	* put blocks waiting for take when full
320	>	*/
321	>	public void testPutWithTake() throws InterruptedException {
322		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
323	<	Thread t = new Thread(new Runnable() {
324	<	public void run(){
325	<	int added = 0;
326	<	try {
327	<	q.put(new Object());
328	<	++added;
329	<	q.put(new Object());
330	<	++added;
331	<	q.put(new Object());
332	<	++added;
333	<	q.put(new Object());
334	<	++added;
335	<	fail("Should block");
336	<	} catch (InterruptedException e){
337	<	assertTrue(added >= 2);
284	<	}
323	>	Thread t = new Thread(new CheckedRunnable() {
324	>	public void realRun() {
325	>	int added = 0;
326	>	try {
327	>	q.put(new Object());
328	>	++added;
329	>	q.put(new Object());
330	>	++added;
331	>	q.put(new Object());
332	>	++added;
333	>	q.put(new Object());
334	>	++added;
335	>	threadShouldThrow();
336	>	} catch (InterruptedException success) {
337	>	threadAssertTrue(added >= 2);
338		}
339	<	});
340	<	try {
341	<	t.start();
342	<	Thread.sleep(SHORT_DELAY_MS);
343	<	q.take();
344	<	t.interrupt();
345	<	t.join();
293	<	} catch (Exception e){
294	<	fail("Unexpected exception");
295	<	}
339	>	}});
340	>
341	>	t.start();
342	>	Thread.sleep(SHORT_DELAY_MS);
343	>	q.take();
344	>	t.interrupt();
345	>	t.join();
346		}
347
348	<	public void testTimedOffer() {
348	>	/**
349	>	* timed offer times out if full and elements not taken
350	>	*/
351	>	public void testTimedOffer() throws InterruptedException {
352		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
353	<	Thread t = new Thread(new Runnable() {
354	<	public void run(){
355	<	try {
356	<	q.put(new Object());
357	<	q.put(new Object());
358	<	assertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
359	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
360	<	fail("Should block");
361	<	} catch (InterruptedException success){}
362	<	}
363	<	});
364	<
365	<	try {
366	<	t.start();
367	<	Thread.sleep(SHORT_DELAY_MS);
315	<	t.interrupt();
316	<	t.join();
317	<	} catch (Exception e){
318	<	fail("Unexpected exception");
319	<	}
353	>	Thread t = new Thread(new CheckedRunnable() {
354	>	public void realRun() throws InterruptedException {
355	>	q.put(new Object());
356	>	q.put(new Object());
357	>	assertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, MILLISECONDS));
358	>	try {
359	>	q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS);
360	>	shouldThrow();
361	>	} catch (InterruptedException success) {}
362	>	}});
363	>
364	>	t.start();
365	>	Thread.sleep(SHORT_DELAY_MS);
366	>	t.interrupt();
367	>	t.join();
368		}
369
370	<	public void testTake(){
371	<	try {
372	<	ArrayBlockingQueue q = fullQueue(N);
373	<	for (int i = 0; i < N; ++i) {
374	<	assertEquals(i, ((Integer)q.take()).intValue());
375	<	}
376	<	} catch (InterruptedException e){
377	<	fail("Unexpected exception");
330	<	}
370	>	/**
371	>	* take retrieves elements in FIFO order
372	>	*/
373	>	public void testTake() throws InterruptedException {
374	>	ArrayBlockingQueue q = populatedQueue(SIZE);
375	>	for (int i = 0; i < SIZE; ++i) {
376	>	assertEquals(i, q.take());
377	>	}
378		}
379
380	<	public void testTakeFromEmpty() {
380	>	/**
381	>	* take blocks interruptibly when empty
382	>	*/
383	>	public void testTakeFromEmpty() throws InterruptedException {
384		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
385	<	Thread t = new Thread(new Runnable() {
386	<	public void run(){
387	<	try {
388	<	q.take();
389	<	fail("Should block");
390	<	} catch (InterruptedException success){ }
391	<	}
392	<	});
393	<	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	<	}
385	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
386	>	public void realRun() throws InterruptedException {
387	>	q.take();
388	>	}};
389	>
390	>	t.start();
391	>	Thread.sleep(SHORT_DELAY_MS);
392	>	t.interrupt();
393	>	t.join();
394		}
395
396	<	public void testBlockingTake(){
397	<	Thread t = new Thread(new Runnable() {
398	<	public void run() {
399	<	try {
400	<	ArrayBlockingQueue q = fullQueue(N);
401	<	for (int i = 0; i < N; ++i) {
402	<	assertEquals(i, ((Integer)q.take()).intValue());
403	<	}
404	<	q.take();
405	<	fail("take should block");
406	<	} catch (InterruptedException success){
407	<	}
408	<	}});
396	>	/**
397	>	* Take removes existing elements until empty, then blocks interruptibly
398	>	*/
399	>	public void testBlockingTake() throws InterruptedException {
400	>	final ArrayBlockingQueue q = populatedQueue(SIZE);
401	>	Thread t = new Thread(new CheckedRunnable() {
402	>	public void realRun() throws InterruptedException {
403	>	for (int i = 0; i < SIZE; ++i) {
404	>	assertEquals(i, q.take());
405	>	}
406	>	try {
407	>	q.take();
408	>	shouldThrow();
409	>	} catch (InterruptedException success) {}
410	>	}});
411	>
412		t.start();
413	<	try {
414	<	Thread.sleep(SHORT_DELAY_MS);
415	<	t.interrupt();
370	<	t.join();
371	<	}
372	<	catch (InterruptedException ie) {
373	<	fail("Unexpected exception");
374	<	}
413	>	Thread.sleep(SHORT_DELAY_MS);
414	>	t.interrupt();
415	>	t.join();
416		}
417
418
419	<	public void testPoll(){
420	<	ArrayBlockingQueue q = fullQueue(N);
421	<	for (int i = 0; i < N; ++i) {
422	<	assertEquals(i, ((Integer)q.poll()).intValue());
419	>	/**
420	>	* poll succeeds unless empty
421	>	*/
422	>	public void testPoll() {
423	>	ArrayBlockingQueue q = populatedQueue(SIZE);
424	>	for (int i = 0; i < SIZE; ++i) {
425	>	assertEquals(i, q.poll());
426		}
427	<	assertNull(q.poll());
427	>	assertNull(q.poll());
428		}
429
430	<	public void testTimedPoll0() {
431	<	try {
432	<	ArrayBlockingQueue q = fullQueue(N);
433	<	for (int i = 0; i < N; ++i) {
434	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
435	<	}
436	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
437	<	} catch (InterruptedException e){
438	<	fail("Unexpected exception");
395	<	}
430	>	/**
431	>	* timed pool with zero timeout succeeds when non-empty, else times out
432	>	*/
433	>	public void testTimedPoll0() throws InterruptedException {
434	>	ArrayBlockingQueue q = populatedQueue(SIZE);
435	>	for (int i = 0; i < SIZE; ++i) {
436	>	assertEquals(i, q.poll(0, MILLISECONDS));
437	>	}
438	>	assertNull(q.poll(0, MILLISECONDS));
439		}
440
441	<	public void testTimedPoll() {
442	<	try {
443	<	ArrayBlockingQueue q = fullQueue(N);
444	<	for (int i = 0; i < N; ++i) {
445	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
446	<	}
447	<	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");
441	>	/**
442	>	* timed pool with nonzero timeout succeeds when non-empty, else times out
443	>	*/
444	>	public void testTimedPoll() throws InterruptedException {
445	>	ArrayBlockingQueue q = populatedQueue(SIZE);
446	>	for (int i = 0; i < SIZE; ++i) {
447	>	assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS));
448		}
449	+	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
450		}
451
452	<	public void testTimedPollWithOffer(){
453	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
454	<	Thread t = new Thread(new Runnable() {
455	<	public void run(){
456	<	try {
457	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
458	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
459	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
460	<	fail("Should block");
461	<	} catch (InterruptedException success) { }
452	>	/**
453	>	* Interrupted timed poll throws InterruptedException instead of
454	>	* returning timeout status
455	>	*/
456	>	public void testInterruptedTimedPoll() throws InterruptedException {
457	>	Thread t = new Thread(new CheckedRunnable() {
458	>	public void realRun() throws InterruptedException {
459	>	ArrayBlockingQueue q = populatedQueue(SIZE);
460	>	for (int i = 0; i < SIZE; ++i) {
461	>	assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS));;
462		}
463	<	});
464	<	try {
465	<	t.start();
466	<	Thread.sleep(SHORT_DELAY_MS * 2);
467	<	assertTrue(q.offer(new Integer(0), SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
468	<	t.interrupt();
469	<	t.join();
470	<	} catch (Exception e){
471	<	fail("Unexpected exception");
472	<	}
473	<	}
474	<
475	<
476	<	public void testPeek(){
477	<	ArrayBlockingQueue q = fullQueue(N);
478	<	for (int i = 0; i < N; ++i) {
463	>	try {
464	>	q.poll(SMALL_DELAY_MS, MILLISECONDS);
465	>	shouldThrow();
466	>	} catch (InterruptedException success) {}
467	>	}});
468	>
469	>	t.start();
470	>	Thread.sleep(SHORT_DELAY_MS);
471	>	t.interrupt();
472	>	t.join();
473	>	}
474	>
475	>	/**
476	>	*  timed poll before a delayed offer fails; after offer succeeds;
477	>	*  on interruption throws
478	>	*/
479	>	public void testTimedPollWithOffer() throws InterruptedException {
480	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
481	>	Thread t = new Thread(new CheckedRunnable() {
482	>	public void realRun() throws InterruptedException {
483	>	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
484	>	assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
485	>	try {
486	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
487	>	shouldThrow();
488	>	} catch (InterruptedException success) {}
489	>	}});
490	>
491	>	t.start();
492	>	Thread.sleep(SMALL_DELAY_MS);
493	>	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
494	>	t.interrupt();
495	>	t.join();
496	>	}
497	>
498	>
499	>	/**
500	>	* peek returns next element, or null if empty
501	>	*/
502	>	public void testPeek() {
503	>	ArrayBlockingQueue q = populatedQueue(SIZE);
504	>	for (int i = 0; i < SIZE; ++i) {
505		assertEquals(i, ((Integer)q.peek()).intValue());
506		q.poll();
507		assertTrue(q.peek() == null ||
508		i != ((Integer)q.peek()).intValue());
509		}
510	<	assertNull(q.peek());
510	>	assertNull(q.peek());
511		}
512
513	<	public void testElement(){
514	<	ArrayBlockingQueue q = fullQueue(N);
515	<	for (int i = 0; i < N; ++i) {
513	>	/**
514	>	* element returns next element, or throws NSEE if empty
515	>	*/
516	>	public void testElement() {
517	>	ArrayBlockingQueue q = populatedQueue(SIZE);
518	>	for (int i = 0; i < SIZE; ++i) {
519		assertEquals(i, ((Integer)q.element()).intValue());
520		q.poll();
521		}
522		try {
523		q.element();
524	<	fail("no such element");
525	<	}
478	<	catch (NoSuchElementException success) {}
524	>	shouldThrow();
525	>	} catch (NoSuchElementException success) {}
526		}
527
528	<	public void testRemove(){
529	<	ArrayBlockingQueue q = fullQueue(N);
530	<	for (int i = 0; i < N; ++i) {
528	>	/**
529	>	* remove removes next element, or throws NSEE if empty
530	>	*/
531	>	public void testRemove() {
532	>	ArrayBlockingQueue q = populatedQueue(SIZE);
533	>	for (int i = 0; i < SIZE; ++i) {
534		assertEquals(i, ((Integer)q.remove()).intValue());
535		}
536		try {
537		q.remove();
538	<	fail("remove should throw");
539	<	} catch (NoSuchElementException success){
490	<	}
538	>	shouldThrow();
539	>	} catch (NoSuchElementException success) {}
540		}
541
542	<	public void testRemoveElement(){
543	<	ArrayBlockingQueue q = fullQueue(N);
544	<	for (int i = 1; i < N; i+=2) {
542	>	/**
543	>	* remove(x) removes x and returns true if present
544	>	*/
545	>	public void testRemoveElement() {
546	>	ArrayBlockingQueue q = populatedQueue(SIZE);
547	>	for (int i = 1; i < SIZE; i+=2) {
548		assertTrue(q.remove(new Integer(i)));
549		}
550	<	for (int i = 0; i < N; i+=2) {
550	>	for (int i = 0; i < SIZE; i+=2) {
551		assertTrue(q.remove(new Integer(i)));
552		assertFalse(q.remove(new Integer(i+1)));
553		}
554	<	assert(q.isEmpty());
554	>	assertTrue(q.isEmpty());
555		}
556	<
557	<	public void testContains(){
558	<	ArrayBlockingQueue q = fullQueue(N);
559	<	for (int i = 0; i < N; ++i) {
556	>
557	>	/**
558	>	* contains(x) reports true when elements added but not yet removed
559	>	*/
560	>	public void testContains() {
561	>	ArrayBlockingQueue q = populatedQueue(SIZE);
562	>	for (int i = 0; i < SIZE; ++i) {
563		assertTrue(q.contains(new Integer(i)));
564		q.poll();
565		assertFalse(q.contains(new Integer(i)));
566		}
567		}
568
569	<	public void testClear(){
570	<	ArrayBlockingQueue q = fullQueue(N);
569	>	/**
570	>	* clear removes all elements
571	>	*/
572	>	public void testClear() {
573	>	ArrayBlockingQueue q = populatedQueue(SIZE);
574		q.clear();
575		assertTrue(q.isEmpty());
576		assertEquals(0, q.size());
577	<	assertEquals(N, q.remainingCapacity());
578	<	q.add(new Integer(1));
577	>	assertEquals(SIZE, q.remainingCapacity());
578	>	q.add(one);
579		assertFalse(q.isEmpty());
580	+	assertTrue(q.contains(one));
581		q.clear();
582		assertTrue(q.isEmpty());
583		}
584
585	<	public void testContainsAll(){
586	<	ArrayBlockingQueue q = fullQueue(N);
587	<	ArrayBlockingQueue p = new ArrayBlockingQueue(N);
588	<	for (int i = 0; i < N; ++i) {
585	>	/**
586	>	* containsAll(c) is true when c contains a subset of elements
587	>	*/
588	>	public void testContainsAll() {
589	>	ArrayBlockingQueue q = populatedQueue(SIZE);
590	>	ArrayBlockingQueue p = new ArrayBlockingQueue(SIZE);
591	>	for (int i = 0; i < SIZE; ++i) {
592		assertTrue(q.containsAll(p));
593		assertFalse(p.containsAll(q));
594		p.add(new Integer(i));
#	Line 534 | Line 596 | public class ArrayBlockingQueueTest exte
596		assertTrue(p.containsAll(q));
597		}
598
599	<	public void testRetainAll(){
600	<	ArrayBlockingQueue q = fullQueue(N);
601	<	ArrayBlockingQueue p = fullQueue(N);
602	<	for (int i = 0; i < N; ++i) {
599	>	/**
600	>	* retainAll(c) retains only those elements of c and reports true if changed
601	>	*/
602	>	public void testRetainAll() {
603	>	ArrayBlockingQueue q = populatedQueue(SIZE);
604	>	ArrayBlockingQueue p = populatedQueue(SIZE);
605	>	for (int i = 0; i < SIZE; ++i) {
606		boolean changed = q.retainAll(p);
607		if (i == 0)
608		assertFalse(changed);
#	Line 545 | Line 610 | public class ArrayBlockingQueueTest exte
610		assertTrue(changed);
611
612		assertTrue(q.containsAll(p));
613	<	assertEquals(N-i, q.size());
613	>	assertEquals(SIZE-i, q.size());
614		p.remove();
615		}
616		}
617
618	<	public void testRemoveAll(){
619	<	for (int i = 1; i < N; ++i) {
620	<	ArrayBlockingQueue q = fullQueue(N);
621	<	ArrayBlockingQueue p = fullQueue(i);
618	>	/**
619	>	* removeAll(c) removes only those elements of c and reports true if changed
620	>	*/
621	>	public void testRemoveAll() {
622	>	for (int i = 1; i < SIZE; ++i) {
623	>	ArrayBlockingQueue q = populatedQueue(SIZE);
624	>	ArrayBlockingQueue p = populatedQueue(i);
625		assertTrue(q.removeAll(p));
626	<	assertEquals(N-i, q.size());
626	>	assertEquals(SIZE-i, q.size());
627		for (int j = 0; j < i; ++j) {
628		Integer I = (Integer)(p.remove());
629		assertFalse(q.contains(I));
#	Line 563 | Line 631 | public class ArrayBlockingQueueTest exte
631		}
632		}
633
634	+	/**
635	+	*  toArray contains all elements
636	+	*/
637	+	public void testToArray() throws InterruptedException {
638	+	ArrayBlockingQueue q = populatedQueue(SIZE);
639	+	Object[] o = q.toArray();
640	+	for (int i = 0; i < o.length; i++)
641	+	assertEquals(o[i], q.take());
642	+	}
643
644	<	public void testToArray(){
645	<	ArrayBlockingQueue q = fullQueue(N);
646	<	Object[] o = q.toArray();
647	<	try {
648	<	for(int i = 0; i < o.length; i++)
649	<	assertEquals(o[i], q.take());
650	<	} catch (InterruptedException e){
651	<	fail("Unexpected exception");
652	<	}
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	<	}
644	>	/**
645	>	* toArray(a) contains all elements
646	>	*/
647	>	public void testToArray2() throws InterruptedException {
648	>	ArrayBlockingQueue q = populatedQueue(SIZE);
649	>	Integer[] ints = new Integer[SIZE];
650	>	ints = (Integer[])q.toArray(ints);
651	>	for (int i = 0; i < ints.length; i++)
652	>	assertEquals(ints[i], q.take());
653		}
654
655	<	public void testIteratorOrdering() {
655	>	/**
656	>	* toArray(null) throws NPE
657	>	*/
658	>	public void testToArray_BadArg() {
659	>	try {
660	>	ArrayBlockingQueue q = populatedQueue(SIZE);
661	>	Object o[] = q.toArray(null);
662	>	shouldThrow();
663	>	} catch (NullPointerException success) {}
664	>	}
665	>
666	>	/**
667	>	* toArray with incompatible array type throws CCE
668	>	*/
669	>	public void testToArray1_BadArg() {
670	>	try {
671	>	ArrayBlockingQueue q = populatedQueue(SIZE);
672	>	Object o[] = q.toArray(new String[10] );
673	>	shouldThrow();
674	>	} catch (ArrayStoreException success) {}
675	>	}
676	>
677	>
678	>	/**
679	>	* iterator iterates through all elements
680	>	*/
681	>	public void testIterator() throws InterruptedException {
682	>	ArrayBlockingQueue q = populatedQueue(SIZE);
683	>	Iterator it = q.iterator();
684	>	while (it.hasNext()) {
685	>	assertEquals(it.next(), q.take());
686	>	}
687	>	}
688
689	+	/**
690	+	* iterator.remove removes current element
691	+	*/
692	+	public void testIteratorRemove () {
693		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
694	+	q.add(two);
695	+	q.add(one);
696	+	q.add(three);
697	+
698	+	Iterator it = q.iterator();
699	+	it.next();
700	+	it.remove();
701	+
702	+	it = q.iterator();
703	+	assertEquals(it.next(), one);
704	+	assertEquals(it.next(), three);
705	+	assertFalse(it.hasNext());
706	+	}
707
708	<	q.add(new Integer(1));
709	<	q.add(new Integer(2));
710	<	q.add(new Integer(3));
708	>	/**
709	>	* iterator ordering is FIFO
710	>	*/
711	>	public void testIteratorOrdering() {
712	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
713	>	q.add(one);
714	>	q.add(two);
715	>	q.add(three);
716
717		assertEquals("queue should be full", 0, q.remainingCapacity());
718
719		int k = 0;
720		for (Iterator it = q.iterator(); it.hasNext();) {
721		int i = ((Integer)(it.next())).intValue();
722	<	assertEquals("items should come out in order", ++k, i);
722	>	assertEquals(++k, i);
723		}
724	<
618	<	assertEquals("should go through 3 elements", 3, k);
724	>	assertEquals(3, k);
725		}
726
727	+	/**
728	+	* Modifications do not cause iterators to fail
729	+	*/
730		public void testWeaklyConsistentIteration () {
622	–
731		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
732	<
733	<	q.add(new Integer(1));
734	<	q.add(new Integer(2));
735	<	q.add(new Integer(3));
736	<
737	<	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");
732	>	q.add(one);
733	>	q.add(two);
734	>	q.add(three);
735	>	for (Iterator it = q.iterator(); it.hasNext();) {
736	>	q.remove();
737	>	it.next();
738		}
739	<
639	<	assertEquals("queue should be empty again", 0, q.size());
739	>	assertEquals(0, q.size());
740		}
741
742
743	<	public void testToString(){
744	<	ArrayBlockingQueue q = fullQueue(N);
743	>	/**
744	>	* toString contains toStrings of elements
745	>	*/
746	>	public void testToString() {
747	>	ArrayBlockingQueue q = populatedQueue(SIZE);
748		String s = q.toString();
749	<	for (int i = 0; i < N; ++i) {
749	>	for (int i = 0; i < SIZE; ++i) {
750		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
751		}
752	<	}
752	>	}
753
754
755	+	/**
756	+	* offer transfers elements across Executor tasks
757	+	*/
758		public void testOfferInExecutor() {
653	–
759		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
760	+	q.add(one);
761	+	q.add(two);
762	+	ExecutorService executor = Executors.newFixedThreadPool(2);
763	+	executor.execute(new CheckedRunnable() {
764	+	public void realRun() throws InterruptedException {
765	+	threadAssertFalse(q.offer(three));
766	+	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS));
767	+	threadAssertEquals(0, q.remainingCapacity());
768	+	}});
769	+
770	+	executor.execute(new CheckedRunnable() {
771	+	public void realRun() throws InterruptedException {
772	+	Thread.sleep(SMALL_DELAY_MS);
773	+	threadAssertEquals(one, q.take());
774	+	}});
775
776	<	q.add(new Integer(1));
777	<	q.add(new Integer(2));
776	>	joinPool(executor);
777	>
778	>	}
779
780	+	/**
781	+	* poll retrieves elements across Executor threads
782	+	*/
783	+	public void testPollInExecutor() {
784	+	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
785		ExecutorService executor = Executors.newFixedThreadPool(2);
786	+	executor.execute(new CheckedRunnable() {
787	+	public void realRun() throws InterruptedException {
788	+	threadAssertNull(q.poll());
789	+	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
790	+	threadAssertTrue(q.isEmpty());
791	+	}});
792	+
793	+	executor.execute(new CheckedRunnable() {
794	+	public void realRun() throws InterruptedException {
795	+	Thread.sleep(SMALL_DELAY_MS);
796	+	q.put(one);
797	+	}});
798
799	<	executor.execute(new Runnable() {
800	<	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	<	});
799	>	joinPool(executor);
800	>	}
801
802	<	executor.execute(new Runnable() {
803	<	public void run() {
804	<	try {
805	<	Thread.sleep(MEDIUM_DELAY_MS);
806	<	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();
802	>	/**
803	>	* A deserialized serialized queue has same elements in same order
804	>	*/
805	>	public void testSerialization() throws Exception {
806	>	ArrayBlockingQueue q = populatedQueue(SIZE);
807
808	+	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
809	+	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
810	+	out.writeObject(q);
811	+	out.close();
812	+
813	+	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
814	+	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
815	+	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
816	+	assertEquals(q.size(), r.size());
817	+	while (!q.isEmpty())
818	+	assertEquals(q.remove(), r.remove());
819		}
820
821	<	public void testPollInExecutor() {
821	>	/**
822	>	* drainTo(null) throws NPE
823	>	*/
824	>	public void testDrainToNull() {
825	>	ArrayBlockingQueue q = populatedQueue(SIZE);
826	>	try {
827	>	q.drainTo(null);
828	>	shouldThrow();
829	>	} catch (NullPointerException success) {}
830	>	}
831
832	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
832	>	/**
833	>	* drainTo(this) throws IAE
834	>	*/
835	>	public void testDrainToSelf() {
836	>	ArrayBlockingQueue q = populatedQueue(SIZE);
837	>	try {
838	>	q.drainTo(q);
839	>	shouldThrow();
840	>	} catch (IllegalArgumentException success) {}
841	>	}
842
843	<	ExecutorService executor = Executors.newFixedThreadPool(2);
843	>	/**
844	>	* drainTo(c) empties queue into another collection c
845	>	*/
846	>	public void testDrainTo() {
847	>	ArrayBlockingQueue q = populatedQueue(SIZE);
848	>	ArrayList l = new ArrayList();
849	>	q.drainTo(l);
850	>	assertEquals(q.size(), 0);
851	>	assertEquals(l.size(), SIZE);
852	>	for (int i = 0; i < SIZE; ++i)
853	>	assertEquals(l.get(i), new Integer(i));
854	>	q.add(zero);
855	>	q.add(one);
856	>	assertFalse(q.isEmpty());
857	>	assertTrue(q.contains(zero));
858	>	assertTrue(q.contains(one));
859	>	l.clear();
860	>	q.drainTo(l);
861	>	assertEquals(q.size(), 0);
862	>	assertEquals(l.size(), 2);
863	>	for (int i = 0; i < 2; ++i)
864	>	assertEquals(l.get(i), new Integer(i));
865	>	}
866
867	<	executor.execute(new Runnable() {
868	<	public void run() {
869	<	assertNull("poll should fail", q.poll());
870	<	try {
871	<	assertTrue(null != q.poll(MEDIUM_DELAY_MS * 2, TimeUnit.MILLISECONDS));
872	<	assertTrue(q.isEmpty());
873	<	}
874	<	catch (InterruptedException e) {
875	<	fail("should not be interrupted");
705	<	}
706	<	}
707	<	});
867	>	/**
868	>	* drainTo empties full queue, unblocking a waiting put.
869	>	*/
870	>	public void testDrainToWithActivePut() throws InterruptedException {
871	>	final ArrayBlockingQueue q = populatedQueue(SIZE);
872	>	Thread t = new Thread(new CheckedRunnable() {
873	>	public void realRun() throws InterruptedException {
874	>	q.put(new Integer(SIZE+1));
875	>	}});
876
877	<	executor.execute(new Runnable() {
878	<	public void run() {
879	<	try {
880	<	Thread.sleep(MEDIUM_DELAY_MS);
881	<	q.put(new Integer(1));
882	<	}
883	<	catch (InterruptedException e) {
884	<	fail("should not be interrupted");
885	<	}
886	<	}
887	<	});
888	<
889	<	executor.shutdown();
877	>	t.start();
878	>	ArrayList l = new ArrayList();
879	>	q.drainTo(l);
880	>	assertTrue(l.size() >= SIZE);
881	>	for (int i = 0; i < SIZE; ++i)
882	>	assertEquals(l.get(i), new Integer(i));
883	>	t.join();
884	>	assertTrue(q.size() + l.size() >= SIZE);
885	>	}
886	>
887	>	/**
888	>	* drainTo(null, n) throws NPE
889	>	*/
890	>	public void testDrainToNullN() {
891	>	ArrayBlockingQueue q = populatedQueue(SIZE);
892	>	try {
893	>	q.drainTo(null, 0);
894	>	shouldThrow();
895	>	} catch (NullPointerException success) {}
896	>	}
897
898	+	/**
899	+	* drainTo(this, n) throws IAE
900	+	*/
901	+	public void testDrainToSelfN() {
902	+	ArrayBlockingQueue q = populatedQueue(SIZE);
903	+	try {
904	+	q.drainTo(q, 0);
905	+	shouldThrow();
906	+	} catch (IllegalArgumentException success) {}
907	+	}
908	+
909	+	/**
910	+	* drainTo(c, n) empties first max {n, size} elements of queue into c
911	+	*/
912	+	public void testDrainToN() {
913	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2);
914	+	for (int i = 0; i < SIZE + 2; ++i) {
915	+	for (int j = 0; j < SIZE; j++)
916	+	assertTrue(q.offer(new Integer(j)));
917	+	ArrayList l = new ArrayList();
918	+	q.drainTo(l, i);
919	+	int k = (i < SIZE)? i : SIZE;
920	+	assertEquals(l.size(), k);
921	+	assertEquals(q.size(), SIZE-k);
922	+	for (int j = 0; j < k; ++j)
923	+	assertEquals(l.get(j), new Integer(j));
924	+	while (q.poll() != null) ;
925	+	}
926		}
927
928		}

Diff Legend

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