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

Diff Legend

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