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.3 by dl, Sun Sep 14 20:42:40 2003 UTC vs.
Revision 1.23 by jsr166, Sat Nov 21 21:00:34 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 JSR166TestCase {
14	–
17		public static void main(String[] args) {
18	<	junit.textui.TestRunner.run (suite());
18	>	junit.textui.TestRunner.run (suite());
19		}
18	–
20		public static Test suite() {
21	<	return new TestSuite(ArrayBlockingQueueTest.class);
21	>	return new TestSuite(ArrayBlockingQueueTest.class);
22		}
23
24		/**
#	Line 27 | Line 28 | public class ArrayBlockingQueueTest exte
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(){
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	<	}
47	<	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	<	}
56	<	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[SIZE];
72		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
73	<	fail("Cannot make with null elements");
74	<	}
65	<	catch (NullPointerException success) {}
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[SIZE];
83		for (int i = 0; i < SIZE-1; ++i)
84		ints[i] = new Integer(i);
85		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
86	<	fail("Cannot make with null elements");
87	<	}
76	<	catch (NullPointerException success) {}
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[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	<	}
87	<	catch (IllegalArgumentException success) {}
99	>	shouldThrow();
100	>	} catch (IllegalArgumentException success) {}
101		}
102
103	<	public void testConstructor7(){
104	<	try {
105	<	Integer[] ints = new Integer[SIZE];
106	<	for (int i = 0; i < SIZE; ++i)
107	<	ints[i] = new Integer(i);
108	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints));
109	<	for (int i = 0; i < SIZE; ++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());
121	>	assertEquals(2, q.remainingCapacity());
122		q.add(one);
123		assertFalse(q.isEmpty());
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(three));
126	>	assertEquals(0, q.remainingCapacity());
127	>	assertFalse(q.offer(three));
128		}
129
130	<	public void testRemainingCapacity(){
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());
#	Line 125 | Line 144 | public class ArrayBlockingQueueTest exte
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(zero));
175		assertFalse(q.offer(one));
176		}
177
178	<	public void testAdd(){
179	<	try {
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(SIZE));
189	<	} catch (IllegalStateException success){
190	<	}
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	<	}
160	<	catch (NullPointerException success) {}
200	>	shouldThrow();
201	>	} catch (NullPointerException success) {}
202		}
203	<	public void testAddAll2(){
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	>
215	>
216	>	/**
217	>	*  addAll of a collection with null elements throws NPE
218	>	*/
219	>	public void testAddAll2() {
220		try {
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	<	}
169	<	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(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	<	}
180	<	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[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	<	}
191	<	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[SIZE];
258	<	for (int i = 0; i < SIZE; ++i)
259	<	ints[i] = new Integer(i);
260	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
261	<	assertFalse(q.addAll(Arrays.asList(empty)));
262	<	assertTrue(q.addAll(Arrays.asList(ints)));
263	<	for (int i = 0; i < SIZE; ++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 {
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	<	}
214	<	catch (NullPointerException success){
215	<	}
216	<	catch (InterruptedException ie) {
217	<	fail("Unexpected exception");
218	<	}
276	>	shouldThrow();
277	>	} catch (NullPointerException success) {}
278		}
279
280	<	public void testPut() {
281	<	try {
282	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
283	<	for (int i = 0; i < SIZE; ++i) {
284	<	Integer I = new Integer(i);
285	<	q.put(I);
286	<	assertTrue(q.contains(I));
287	<	}
288	<	assertEquals(0, q.remainingCapacity());
230	<	}
231	<	catch (InterruptedException ie) {
232	<	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(SIZE);
299	<	for (int i = 0; i < SIZE; ++i) {
300	<	q.put(new Integer(i));
301	<	++added;
302	<	}
303	<	q.put(new Integer(SIZE));
304	<	threadFail("put should block");
305	<	} catch (InterruptedException ie){
306	<	threadAssertEquals(added, SIZE);
307	<	}
308	<	}});
309	<	try {
310	<	t.start();
311	<	Thread.sleep(SHORT_DELAY_MS);
312	<	t.interrupt();
313	<	t.join();
314	<	}
315	<	catch (InterruptedException ie) {
259	<	fail("Unexpected exception");
260	<	}
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	>	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	<	threadFail("Should block");
336	<	} catch (InterruptedException e){
337	<	threadAssertTrue(added >= 2);
338	<	}
339	<	}
340	<	});
341	<	try {
342	<	t.start();
343	<	Thread.sleep(SHORT_DELAY_MS);
344	<	q.take();
345	<	t.interrupt();
288	<	t.join();
289	<	} catch (Exception e){
290	<	fail("Unexpected exception");
291	<	}
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	>
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	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
359	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
360	<	threadFail("Should block");
361	<	} catch (InterruptedException success){}
362	<	}
363	<	});
364	<
308	<	try {
309	<	t.start();
310	<	Thread.sleep(SHORT_DELAY_MS);
311	<	t.interrupt();
312	<	t.join();
313	<	} catch (Exception e){
314	<	fail("Unexpected exception");
315	<	}
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 = populatedQueue(SIZE);
370	<	for (int i = 0; i < SIZE; ++i) {
371	<	assertEquals(i, ((Integer)q.take()).intValue());
372	<	}
373	<	} catch (InterruptedException e){
374	<	fail("Unexpected exception");
326	<	}
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	<	threadFail("Should block");
387	<	} catch (InterruptedException success){ }
388	<	}
389	<	});
390	<	try {
340	<	t.start();
341	<	Thread.sleep(SHORT_DELAY_MS);
342	<	t.interrupt();
343	<	t.join();
344	<	} catch (Exception e){
345	<	fail("Unexpected exception");
346	<	}
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	<	public void testBlockingTake(){
394	<	Thread t = new Thread(new Runnable() {
395	<	public void run() {
396	<	try {
397	<	ArrayBlockingQueue q = populatedQueue(SIZE);
398	<	for (int i = 0; i < SIZE; ++i) {
399	<	threadAssertEquals(i, ((Integer)q.take()).intValue());
400	<	}
401	<	q.take();
402	<	threadFail("take should block");
403	<	} catch (InterruptedException success){
404	<	}
405	<	}});
406	<	try {
407	<	t.start();
364	<	Thread.sleep(SHORT_DELAY_MS);
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	>	q.take();
404	>	}};
405	>
406	>	t.start();
407	>	Thread.sleep(SHORT_DELAY_MS);
408		t.interrupt();
409		t.join();
367	–	}
368	–	catch (InterruptedException ie) {
369	–	fail("Unexpected exception");
370	–	}
410		}
411
412
413	<	public void testPoll(){
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());
421	>	assertNull(q.poll());
422		}
423
424	<	public void testTimedPoll0() {
425	<	try {
426	<	ArrayBlockingQueue q = populatedQueue(SIZE);
427	<	for (int i = 0; i < SIZE; ++i) {
428	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
429	<	}
430	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
431	<	} catch (InterruptedException e){
432	<	fail("Unexpected exception");
391	<	}
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(0, MILLISECONDS));
433		}
434
435	<	public void testTimedPoll() {
436	<	try {
437	<	ArrayBlockingQueue q = populatedQueue(SIZE);
438	<	for (int i = 0; i < SIZE; ++i) {
439	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
440	<	}
441	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
401	<	} catch (InterruptedException e){
402	<	fail("Unexpected exception");
403	<	}
404	<	}
405	<
406	<	public void testInterruptedTimedPoll(){
407	<	Thread t = new Thread(new Runnable() {
408	<	public void run() {
409	<	try {
410	<	ArrayBlockingQueue q = populatedQueue(SIZE);
411	<	for (int i = 0; i < SIZE; ++i) {
412	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
413	<	}
414	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
415	<	} catch (InterruptedException success){
416	<	}
417	<	}});
418	<	try {
419	<	t.start();
420	<	Thread.sleep(SHORT_DELAY_MS);
421	<	t.interrupt();
422	<	t.join();
423	<	}
424	<	catch (InterruptedException ie) {
425	<	fail("Unexpected exception");
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 testTimedPollWithOffer(){
447	<	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
448	<	Thread t = new Thread(new Runnable() {
449	<	public void run(){
450	<	try {
451	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
452	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
453	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
454	<	threadFail("Should block");
455	<	} catch (InterruptedException success) { }
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	<	});
458	<	try {
459	<	t.start();
460	<	Thread.sleep(SMALL_DELAY_MS);
461	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
462	<	t.interrupt();
463	<	t.join();
464	<	} catch (Exception e){
465	<	fail("Unexpected exception");
466	<	}
467	<	}
457	>	try {
458	>	q.poll(SMALL_DELAY_MS, MILLISECONDS);
459	>	shouldThrow();
460	>	} catch (InterruptedException success) {}
461	>	}});
462	>
463	>	t.start();
464	>	Thread.sleep(SHORT_DELAY_MS);
465	>	t.interrupt();
466	>	t.join();
467	>	}
468	>
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 CheckedRunnable() {
476	>	public void realRun() throws InterruptedException {
477	>	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
478	>	assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
479	>	try {
480	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
481	>	shouldThrow();
482	>	} catch (InterruptedException success) {}
483	>	}});
484	>
485	>	t.start();
486	>	Thread.sleep(SMALL_DELAY_MS);
487	>	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
488	>	t.interrupt();
489	>	t.join();
490	>	}
491
492
493	<	public void testPeek(){
493	>	/**
494	>	* peek returns next element, or null if empty
495	>	*/
496	>	public void testPeek() {
497		ArrayBlockingQueue q = populatedQueue(SIZE);
498		for (int i = 0; i < SIZE; ++i) {
499		assertEquals(i, ((Integer)q.peek()).intValue());
#	Line 458 | Line 501 | public class ArrayBlockingQueueTest exte
501		assertTrue(q.peek() == null ||
502		i != ((Integer)q.peek()).intValue());
503		}
504	<	assertNull(q.peek());
504	>	assertNull(q.peek());
505		}
506
507	<	public void testElement(){
507	>	/**
508	>	* element returns next element, or throws NSEE if empty
509	>	*/
510	>	public void testElement() {
511		ArrayBlockingQueue q = populatedQueue(SIZE);
512		for (int i = 0; i < SIZE; ++i) {
513		assertEquals(i, ((Integer)q.element()).intValue());
#	Line 469 | Line 515 | public class ArrayBlockingQueueTest exte
515		}
516		try {
517		q.element();
518	<	fail("no such element");
519	<	}
474	<	catch (NoSuchElementException success) {}
518	>	shouldThrow();
519	>	} catch (NoSuchElementException success) {}
520		}
521
522	<	public void testRemove(){
522	>	/**
523	>	* remove removes next element, or throws NSEE if empty
524	>	*/
525	>	public void testRemove() {
526		ArrayBlockingQueue q = populatedQueue(SIZE);
527		for (int i = 0; i < SIZE; ++i) {
528		assertEquals(i, ((Integer)q.remove()).intValue());
529		}
530		try {
531		q.remove();
532	<	fail("remove should throw");
533	<	} catch (NoSuchElementException success){
486	<	}
532	>	shouldThrow();
533	>	} catch (NoSuchElementException success) {}
534		}
535
536	<	public void testRemoveElement(){
536	>	/**
537	>	* remove(x) removes x and returns true if present
538	>	*/
539	>	public void testRemoveElement() {
540		ArrayBlockingQueue q = populatedQueue(SIZE);
541		for (int i = 1; i < SIZE; i+=2) {
542		assertTrue(q.remove(new Integer(i)));
#	Line 497 | Line 547 | public class ArrayBlockingQueueTest exte
547		}
548		assertTrue(q.isEmpty());
549		}
550	<
551	<	public void testContains(){
550	>
551	>	/**
552	>	* contains(x) reports true when elements added but not yet removed
553	>	*/
554	>	public void testContains() {
555		ArrayBlockingQueue q = populatedQueue(SIZE);
556		for (int i = 0; i < SIZE; ++i) {
557		assertTrue(q.contains(new Integer(i)));
#	Line 507 | Line 560 | public class ArrayBlockingQueueTest exte
560		}
561		}
562
563	<	public void testClear(){
563	>	/**
564	>	* clear removes all elements
565	>	*/
566	>	public void testClear() {
567		ArrayBlockingQueue q = populatedQueue(SIZE);
568		q.clear();
569		assertTrue(q.isEmpty());
#	Line 515 | Line 571 | public class ArrayBlockingQueueTest exte
571		assertEquals(SIZE, q.remainingCapacity());
572		q.add(one);
573		assertFalse(q.isEmpty());
574	+	assertTrue(q.contains(one));
575		q.clear();
576		assertTrue(q.isEmpty());
577		}
578
579	<	public void testContainsAll(){
579	>	/**
580	>	* containsAll(c) is true when c contains a subset of elements
581	>	*/
582	>	public void testContainsAll() {
583		ArrayBlockingQueue q = populatedQueue(SIZE);
584		ArrayBlockingQueue p = new ArrayBlockingQueue(SIZE);
585		for (int i = 0; i < SIZE; ++i) {
#	Line 530 | Line 590 | public class ArrayBlockingQueueTest exte
590		assertTrue(p.containsAll(q));
591		}
592
593	<	public void testRetainAll(){
593	>	/**
594	>	* retainAll(c) retains only those elements of c and reports true if changed
595	>	*/
596	>	public void testRetainAll() {
597		ArrayBlockingQueue q = populatedQueue(SIZE);
598		ArrayBlockingQueue p = populatedQueue(SIZE);
599		for (int i = 0; i < SIZE; ++i) {
#	Line 546 | Line 609 | public class ArrayBlockingQueueTest exte
609		}
610		}
611
612	<	public void testRemoveAll(){
612	>	/**
613	>	* removeAll(c) removes only those elements of c and reports true if changed
614	>	*/
615	>	public void testRemoveAll() {
616		for (int i = 1; i < SIZE; ++i) {
617		ArrayBlockingQueue q = populatedQueue(SIZE);
618		ArrayBlockingQueue p = populatedQueue(i);
#	Line 559 | Line 625 | public class ArrayBlockingQueueTest exte
625		}
626		}
627
628	+	/**
629	+	*  toArray contains all elements
630	+	*/
631	+	public void testToArray() throws InterruptedException {
632	+	ArrayBlockingQueue q = populatedQueue(SIZE);
633	+	Object[] o = q.toArray();
634	+	for (int i = 0; i < o.length; i++)
635	+	assertEquals(o[i], q.take());
636	+	}
637
638	<	public void testToArray(){
638	>	/**
639	>	* toArray(a) contains all elements
640	>	*/
641	>	public void testToArray2() throws InterruptedException {
642		ArrayBlockingQueue q = populatedQueue(SIZE);
643	<	Object[] o = q.toArray();
644	<	try {
645	<	for(int i = 0; i < o.length; i++)
646	<	assertEquals(o[i], q.take());
569	<	} catch (InterruptedException e){
570	<	fail("Unexpected exception");
571	<	}
572	<	}
573	<
574	<	public void testToArray2(){
575	<	ArrayBlockingQueue q = populatedQueue(SIZE);
576	<	Integer[] ints = new Integer[SIZE];
577	<	ints = (Integer[])q.toArray(ints);
578	<	try {
579	<	for(int i = 0; i < ints.length; i++)
580	<	assertEquals(ints[i], q.take());
581	<	} catch (InterruptedException e){
582	<	fail("Unexpected exception");
583	<	}
584	<	}
585	<
586	<	public void testIterator(){
587	<	ArrayBlockingQueue q = populatedQueue(SIZE);
588	<	Iterator it = q.iterator();
589	<	try {
590	<	while(it.hasNext()){
591	<	assertEquals(it.next(), q.take());
592	<	}
593	<	} catch (InterruptedException e){
594	<	fail("Unexpected exception");
595	<	}
643	>	Integer[] ints = new Integer[SIZE];
644	>	ints = (Integer[])q.toArray(ints);
645	>	for (int i = 0; i < ints.length; i++)
646	>	assertEquals(ints[i], q.take());
647		}
648
649	<	public void testIteratorOrdering() {
649	>	/**
650	>	* toArray(null) throws NPE
651	>	*/
652	>	public void testToArray_BadArg() {
653	>	try {
654	>	ArrayBlockingQueue q = populatedQueue(SIZE);
655	>	Object o[] = q.toArray(null);
656	>	shouldThrow();
657	>	} catch (NullPointerException success) {}
658	>	}
659
660	+	/**
661	+	* toArray with incompatible array type throws CCE
662	+	*/
663	+	public void testToArray1_BadArg() {
664	+	try {
665	+	ArrayBlockingQueue q = populatedQueue(SIZE);
666	+	Object o[] = q.toArray(new String[10] );
667	+	shouldThrow();
668	+	} catch (ArrayStoreException success) {}
669	+	}
670	+
671	+
672	+	/**
673	+	* iterator iterates through all elements
674	+	*/
675	+	public void testIterator() throws InterruptedException {
676	+	ArrayBlockingQueue q = populatedQueue(SIZE);
677	+	Iterator it = q.iterator();
678	+	while (it.hasNext()) {
679	+	assertEquals(it.next(), q.take());
680	+	}
681	+	}
682	+
683	+	/**
684	+	* iterator.remove removes current element
685	+	*/
686	+	public void testIteratorRemove () {
687		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
688	+	q.add(two);
689	+	q.add(one);
690	+	q.add(three);
691	+
692	+	Iterator it = q.iterator();
693	+	it.next();
694	+	it.remove();
695	+
696	+	it = q.iterator();
697	+	assertEquals(it.next(), one);
698	+	assertEquals(it.next(), three);
699	+	assertFalse(it.hasNext());
700	+	}
701
702	+	/**
703	+	* iterator ordering is FIFO
704	+	*/
705	+	public void testIteratorOrdering() {
706	+	final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
707		q.add(one);
708		q.add(two);
709		q.add(three);
#	Line 608 | Line 713 | public class ArrayBlockingQueueTest exte
713		int k = 0;
714		for (Iterator it = q.iterator(); it.hasNext();) {
715		int i = ((Integer)(it.next())).intValue();
716	<	assertEquals("items should come out in order", ++k, i);
716	>	assertEquals(++k, i);
717		}
718	<
614	<	assertEquals("should go through 3 elements", 3, k);
718	>	assertEquals(3, k);
719		}
720
721	+	/**
722	+	* Modifications do not cause iterators to fail
723	+	*/
724		public void testWeaklyConsistentIteration () {
618	–
725		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
620	–
726		q.add(one);
727		q.add(two);
728		q.add(three);
729	<
730	<	try {
731	<	for (Iterator it = q.iterator(); it.hasNext();) {
627	<	q.remove();
628	<	it.next();
629	<	}
630	<	}
631	<	catch (ConcurrentModificationException e) {
632	<	fail("weakly consistent iterator; should not get CME");
729	>	for (Iterator it = q.iterator(); it.hasNext();) {
730	>	q.remove();
731	>	it.next();
732		}
733	<
635	<	assertEquals("queue should be empty again", 0, q.size());
733	>	assertEquals(0, q.size());
734		}
735
736
737	<	public void testToString(){
737	>	/**
738	>	* toString contains toStrings of elements
739	>	*/
740	>	public void testToString() {
741		ArrayBlockingQueue q = populatedQueue(SIZE);
742		String s = q.toString();
743		for (int i = 0; i < SIZE; ++i) {
744		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
745		}
746	<	}
746	>	}
747
748
749	+	/**
750	+	* offer transfers elements across Executor tasks
751	+	*/
752		public void testOfferInExecutor() {
649	–
753		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
651	–
754		q.add(one);
755		q.add(two);
654	–
756		ExecutorService executor = Executors.newFixedThreadPool(2);
757	<
758	<	executor.execute(new Runnable() {
658	<	public void run() {
757	>	executor.execute(new CheckedRunnable() {
758	>	public void realRun() throws InterruptedException {
759		threadAssertFalse(q.offer(three));
760	<	try {
761	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
762	<	threadAssertEquals(0, q.remainingCapacity());
763	<	}
764	<	catch (InterruptedException e) {
765	<	threadFail("should not be interrupted");
766	<	}
767	<	}
768	<	});
760	>	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS));
761	>	threadAssertEquals(0, q.remainingCapacity());
762	>	}});
763	>
764	>	executor.execute(new CheckedRunnable() {
765	>	public void realRun() throws InterruptedException {
766	>	Thread.sleep(SMALL_DELAY_MS);
767	>	threadAssertEquals(one, q.take());
768	>	}});
769
670	–	executor.execute(new Runnable() {
671	–	public void run() {
672	–	try {
673	–	Thread.sleep(SMALL_DELAY_MS);
674	–	threadAssertEquals(one, q.take());
675	–	}
676	–	catch (InterruptedException e) {
677	–	threadFail("should not be interrupted");
678	–	}
679	–	}
680	–	});
681	–
770		joinPool(executor);
771
772		}
773
774	+	/**
775	+	* poll retrieves elements across Executor threads
776	+	*/
777		public void testPollInExecutor() {
687	–
778		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
689	–
779		ExecutorService executor = Executors.newFixedThreadPool(2);
780	<
781	<	executor.execute(new Runnable() {
693	<	public void run() {
780	>	executor.execute(new CheckedRunnable() {
781	>	public void realRun() throws InterruptedException {
782		threadAssertNull(q.poll());
783	<	try {
784	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
785	<	threadAssertTrue(q.isEmpty());
786	<	}
787	<	catch (InterruptedException e) {
788	<	threadFail("should not be interrupted");
789	<	}
790	<	}
791	<	});
783	>	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
784	>	threadAssertTrue(q.isEmpty());
785	>	}});
786	>
787	>	executor.execute(new CheckedRunnable() {
788	>	public void realRun() throws InterruptedException {
789	>	Thread.sleep(SMALL_DELAY_MS);
790	>	q.put(one);
791	>	}});
792
705	–	executor.execute(new Runnable() {
706	–	public void run() {
707	–	try {
708	–	Thread.sleep(SMALL_DELAY_MS);
709	–	q.put(one);
710	–	}
711	–	catch (InterruptedException e) {
712	–	threadFail("should not be interrupted");
713	–	}
714	–	}
715	–	});
716	–
793		joinPool(executor);
794	+	}
795
796	+	/**
797	+	* A deserialized serialized queue has same elements in same order
798	+	*/
799	+	public void testSerialization() throws Exception {
800	+	ArrayBlockingQueue q = populatedQueue(SIZE);
801	+
802	+	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
803	+	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
804	+	out.writeObject(q);
805	+	out.close();
806	+
807	+	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
808	+	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
809	+	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
810	+	assertEquals(q.size(), r.size());
811	+	while (!q.isEmpty())
812	+	assertEquals(q.remove(), r.remove());
813		}
814
815	<	public void testSerialization() {
815	>	/**
816	>	* drainTo(null) throws NPE
817	>	*/
818	>	public void testDrainToNull() {
819		ArrayBlockingQueue q = populatedQueue(SIZE);
820	+	try {
821	+	q.drainTo(null);
822	+	shouldThrow();
823	+	} catch (NullPointerException success) {}
824	+	}
825
826	+	/**
827	+	* drainTo(this) throws IAE
828	+	*/
829	+	public void testDrainToSelf() {
830	+	ArrayBlockingQueue q = populatedQueue(SIZE);
831		try {
832	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
833	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
834	<	out.writeObject(q);
835	<	out.close();
836	<
837	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
838	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
839	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
840	<	assertEquals(q.size(), r.size());
841	<	while (!q.isEmpty())
842	<	assertEquals(q.remove(), r.remove());
843	<	} catch(Exception e){
844	<	fail("unexpected exception");
845	<	}
832	>	q.drainTo(q);
833	>	shouldThrow();
834	>	} catch (IllegalArgumentException success) {}
835	>	}
836	>
837	>	/**
838	>	* drainTo(c) empties queue into another collection c
839	>	*/
840	>	public void testDrainTo() {
841	>	ArrayBlockingQueue q = populatedQueue(SIZE);
842	>	ArrayList l = new ArrayList();
843	>	q.drainTo(l);
844	>	assertEquals(q.size(), 0);
845	>	assertEquals(l.size(), SIZE);
846	>	for (int i = 0; i < SIZE; ++i)
847	>	assertEquals(l.get(i), new Integer(i));
848	>	q.add(zero);
849	>	q.add(one);
850	>	assertFalse(q.isEmpty());
851	>	assertTrue(q.contains(zero));
852	>	assertTrue(q.contains(one));
853	>	l.clear();
854	>	q.drainTo(l);
855	>	assertEquals(q.size(), 0);
856	>	assertEquals(l.size(), 2);
857	>	for (int i = 0; i < 2; ++i)
858	>	assertEquals(l.get(i), new Integer(i));
859		}
860
861	+	/**
862	+	* drainTo empties full queue, unblocking a waiting put.
863	+	*/
864	+	public void testDrainToWithActivePut() throws InterruptedException {
865	+	final ArrayBlockingQueue q = populatedQueue(SIZE);
866	+	Thread t = new Thread(new CheckedRunnable() {
867	+	public void realRun() throws InterruptedException {
868	+	q.put(new Integer(SIZE+1));
869	+	}});
870	+
871	+	t.start();
872	+	ArrayList l = new ArrayList();
873	+	q.drainTo(l);
874	+	assertTrue(l.size() >= SIZE);
875	+	for (int i = 0; i < SIZE; ++i)
876	+	assertEquals(l.get(i), new Integer(i));
877	+	t.join();
878	+	assertTrue(q.size() + l.size() >= SIZE);
879	+	}
880	+
881	+	/**
882	+	* drainTo(null, n) throws NPE
883	+	*/
884	+	public void testDrainToNullN() {
885	+	ArrayBlockingQueue q = populatedQueue(SIZE);
886	+	try {
887	+	q.drainTo(null, 0);
888	+	shouldThrow();
889	+	} catch (NullPointerException success) {}
890	+	}
891	+
892	+	/**
893	+	* drainTo(this, n) throws IAE
894	+	*/
895	+	public void testDrainToSelfN() {
896	+	ArrayBlockingQueue q = populatedQueue(SIZE);
897	+	try {
898	+	q.drainTo(q, 0);
899	+	shouldThrow();
900	+	} catch (IllegalArgumentException success) {}
901	+	}
902	+
903	+	/**
904	+	* drainTo(c, n) empties first max {n, size} elements of queue into c
905	+	*/
906	+	public void testDrainToN() {
907	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2);
908	+	for (int i = 0; i < SIZE + 2; ++i) {
909	+	for (int j = 0; j < SIZE; j++)
910	+	assertTrue(q.offer(new Integer(j)));
911	+	ArrayList l = new ArrayList();
912	+	q.drainTo(l, i);
913	+	int k = (i < SIZE)? i : SIZE;
914	+	assertEquals(l.size(), k);
915	+	assertEquals(q.size(), SIZE-k);
916	+	for (int j = 0; j < k; ++j)
917	+	assertEquals(l.get(j), new Integer(j));
918	+	while (q.poll() != null) ;
919	+	}
920	+	}
921
922		}

Diff Legend

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