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

Diff Legend

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