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

Diff Legend

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