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.19 by jsr166, Sat Nov 21 10:29:49 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 {
17		public static void main(String[] args) {
18	<	junit.textui.TestRunner.run (suite());
18	>	junit.textui.TestRunner.run (suite());
19		}
20		public static Test suite() {
21	<	return new TestSuite(ArrayBlockingQueueTest.class);
21	>	return new TestSuite(ArrayBlockingQueueTest.class);
22		}
23
24		/**
#	Line 26 | 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	<
38	>
39		/**
40	<	*
40	>	* A new queue has the indicated capacity
41		*/
42		public void testConstructor1() {
43		assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity());
44		}
45
46		/**
47	<	*
47	>	* Constructor throws IAE if capacity argument nonpositive
48		*/
49		public void testConstructor2() {
50		try {
51		ArrayBlockingQueue q = new ArrayBlockingQueue(0);
52		shouldThrow();
53	<	}
52	<	catch (IllegalArgumentException success) {}
53	>	} catch (IllegalArgumentException success) {}
54		}
55
56		/**
57	<	*
57	>	* Initializing from null Collection throws NPE
58		*/
59		public void testConstructor3() {
59	–
60		try {
61		ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null);
62		shouldThrow();
63	<	}
64	<	catch (NullPointerException success) {}
63	>	} catch (NullPointerException success) {}
64		}
65
66		/**
67	<	*
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		shouldThrow();
74	<	}
76	<	catch (NullPointerException success) {}
74	>	} catch (NullPointerException success) {}
75		}
76
77		/**
78	<	*
78	>	* Initializing from Collection with some null elements throws NPE
79		*/
80		public void testConstructor5() {
81		try {
#	Line 86 | Line 84 | public class ArrayBlockingQueueTest exte
84		ints[i] = new Integer(i);
85		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
86		shouldThrow();
87	<	}
90	<	catch (NullPointerException success) {}
87	>	} catch (NullPointerException success) {}
88		}
89
90		/**
91	<	*
91	>	* Initializing from too large collection throws IAE
92		*/
93		public void testConstructor6() {
94		try {
#	Line 100 | Line 97 | public class ArrayBlockingQueueTest exte
97		ints[i] = new Integer(i);
98		ArrayBlockingQueue q = new ArrayBlockingQueue(1, false, Arrays.asList(ints));
99		shouldThrow();
100	<	}
104	<	catch (IllegalArgumentException success) {}
100	>	} catch (IllegalArgumentException success) {}
101		}
102
103		/**
104	<	*
104	>	* Queue contains all elements of collection used to initialize
105		*/
106		public void testConstructor7() {
107	<	try {
108	<	Integer[] ints = new Integer[SIZE];
109	<	for (int i = 0; i < SIZE; ++i)
110	<	ints[i] = new Integer(i);
111	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints));
112	<	for (int i = 0; i < SIZE; ++i)
117	<	assertEquals(ints[i], q.poll());
118	<	}
119	<	finally {}
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	<	*
116	>	* Queue transitions from empty to full when elements added
117		*/
118		public void testEmptyFull() {
119		ArrayBlockingQueue q = new ArrayBlockingQueue(2);
#	Line 135 | Line 128 | public class ArrayBlockingQueueTest exte
128		}
129
130		/**
131	<	*
131	>	* remainingCapacity decreases on add, increases on remove
132		*/
133		public void testRemainingCapacity() {
134		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 152 | Line 145 | public class ArrayBlockingQueueTest exte
145		}
146
147		/**
148	<	*
148	>	*  offer(null) throws NPE
149		*/
150		public void testOfferNull() {
151	<	try {
151	>	try {
152		ArrayBlockingQueue q = new ArrayBlockingQueue(1);
153		q.offer(null);
154		shouldThrow();
155	<	} catch (NullPointerException success) { }
155	>	} catch (NullPointerException success) {}
156		}
157
158		/**
159	<	*
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);
#	Line 172 | Line 176 | public class ArrayBlockingQueueTest exte
176		}
177
178		/**
179	<	*
179	>	* add succeeds if not full; throws ISE if full
180		*/
181		public void testAdd() {
182	<	try {
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		/**
194	<	*
194	>	*  addAll(null) throws NPE
195		*/
196		public void testAddAll1() {
197		try {
198		ArrayBlockingQueue q = new ArrayBlockingQueue(1);
199		q.addAll(null);
200		shouldThrow();
201	<	}
202	<	catch (NullPointerException success) {}
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	+
215	+
216		/**
217	<	*
217	>	*  addAll of a collection with null elements throws NPE
218		*/
219		public void testAddAll2() {
220		try {
#	Line 206 | Line 222 | public class ArrayBlockingQueueTest exte
222		Integer[] ints = new Integer[SIZE];
223		q.addAll(Arrays.asList(ints));
224		shouldThrow();
225	<	}
210	<	catch (NullPointerException success) {}
225	>	} catch (NullPointerException success) {}
226		}
227		/**
228	<	*
228	>	* addAll of a collection with any null elements throws NPE after
229	>	* possibly adding some elements
230		*/
231		public void testAddAll3() {
232		try {
#	Line 220 | Line 236 | public class ArrayBlockingQueueTest exte
236		ints[i] = new Integer(i);
237		q.addAll(Arrays.asList(ints));
238		shouldThrow();
239	<	}
224	<	catch (NullPointerException success) {}
239	>	} catch (NullPointerException success) {}
240		}
241		/**
242	<	*
242	>	* addAll throws ISE if not enough room
243		*/
244		public void testAddAll4() {
245		try {
#	Line 234 | Line 249 | public class ArrayBlockingQueueTest exte
249		ints[i] = new Integer(i);
250		q.addAll(Arrays.asList(ints));
251		shouldThrow();
252	<	}
238	<	catch (IllegalStateException success) {}
252	>	} catch (IllegalStateException success) {}
253		}
254		/**
255	<	*
255	>	* Queue contains all elements, in traversal order, of successful addAll
256		*/
257		public void testAddAll5() {
258	<	try {
259	<	Integer[] empty = new Integer[0];
260	<	Integer[] ints = new Integer[SIZE];
261	<	for (int i = 0; i < SIZE; ++i)
262	<	ints[i] = new Integer(i);
263	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
264	<	assertFalse(q.addAll(Arrays.asList(empty)));
265	<	assertTrue(q.addAll(Arrays.asList(ints)));
266	<	for (int i = 0; i < SIZE; ++i)
253	<	assertEquals(ints[i], q.poll());
254	<	}
255	<	finally {}
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		/**
270	<	*
270	>	*  put(null) throws NPE
271		*/
272	<	public void testPutNull() {
273	<	try {
272	>	public void testPutNull() throws InterruptedException {
273	>	try {
274		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
275		q.put(null);
276		shouldThrow();
277	<	}
267	<	catch (NullPointerException success){
268	<	}
269	<	catch (InterruptedException ie) {
270	<	unexpectedException();
271	<	}
277	>	} catch (NullPointerException success) {}
278		}
279
280		/**
281	<	*
281	>	* all elements successfully put are contained
282		*/
283	<	public void testPut() {
284	<	try {
285	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
286	<	for (int i = 0; i < SIZE; ++i) {
287	<	Integer I = new Integer(i);
288	<	q.put(I);
283	<	assertTrue(q.contains(I));
284	<	}
285	<	assertEquals(0, q.remainingCapacity());
286	<	}
287	<	catch (InterruptedException ie) {
288	<	unexpectedException();
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		/**
294	<	*
295	<	*/
296	<	public void testBlockingPut() {
297	<	Thread t = new Thread(new Runnable() {
298	<	public void run() {
299	<	int added = 0;
300	<	try {
301	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
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 ie){
309	<	threadAssertEquals(added, SIZE);
310	<	}
311	<	}});
312	<	try {
313	<	t.start();
314	<	Thread.sleep(SHORT_DELAY_MS);
315	<	t.interrupt();
315	<	t.join();
316	<	}
317	<	catch (InterruptedException ie) {
318	<	unexpectedException();
319	<	}
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 ie) {
309	>	threadAssertEquals(added, SIZE);
310	>	}}});
311	>
312	>	t.start();
313	>	Thread.sleep(MEDIUM_DELAY_MS);
314	>	t.interrupt();
315	>	t.join();
316		}
317
318		/**
319	<	*
319	>	* put blocks waiting for take when full
320		*/
321	<	public void testPutWithTake() {
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	<	threadShouldThrow();
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();
350	<	t.join();
351	<	} catch (Exception e){
352	<	unexpectedException();
353	<	}
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 e) {
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		/**
349	<	*
349	>	* timed offer times out if full and elements not taken
350		*/
351	<	public void testTimedOffer() {
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	<	threadShouldThrow();
361	<	} catch (InterruptedException success){}
362	<	}
363	<	});
364	<
373	<	try {
374	<	t.start();
375	<	Thread.sleep(SHORT_DELAY_MS);
376	<	t.interrupt();
377	<	t.join();
378	<	} catch (Exception e){
379	<	unexpectedException();
380	<	}
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		/**
368	<	*
368	>	* take retrieves elements in FIFO order
369		*/
370	<	public void testTake() {
371	<	try {
372	<	ArrayBlockingQueue q = populatedQueue(SIZE);
373	<	for (int i = 0; i < SIZE; ++i) {
374	<	assertEquals(i, ((Integer)q.take()).intValue());
391	<	}
392	<	} catch (InterruptedException e){
393	<	unexpectedException();
394	<	}
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		/**
378	<	*
378	>	* take blocks interruptibly when empty
379		*/
380	<	public void testTakeFromEmpty() {
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	<	threadShouldThrow();
387	<	} catch (InterruptedException success){ }
388	<	}
389	<	});
390	<	try {
411	<	t.start();
412	<	Thread.sleep(SHORT_DELAY_MS);
413	<	t.interrupt();
414	<	t.join();
415	<	} catch (Exception e){
416	<	unexpectedException();
417	<	}
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	<	*
394	>	* Take removes existing elements until empty, then blocks interruptibly
395		*/
396	<	public void testBlockingTake() {
397	<	Thread t = new Thread(new Runnable() {
398	<	public void run() {
399	<	try {
400	<	ArrayBlockingQueue q = populatedQueue(SIZE);
401	<	for (int i = 0; i < SIZE; ++i) {
402	<	threadAssertEquals(i, ((Integer)q.take()).intValue());
403	<	}
404	<	q.take();
405	<	threadShouldThrow();
406	<	} catch (InterruptedException success){
407	<	}
435	<	}});
436	<	try {
437	<	t.start();
438	<	Thread.sleep(SHORT_DELAY_MS);
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();
441	–	}
442	–	catch (InterruptedException ie) {
443	–	unexpectedException();
444	–	}
410		}
411
412
413		/**
414	<	*
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		/**
425	<	*
425	>	* timed pool with zero timeout succeeds when non-empty, else times out
426		*/
427	<	public void testTimedPoll0() {
428	<	try {
429	<	ArrayBlockingQueue q = populatedQueue(SIZE);
430	<	for (int i = 0; i < SIZE; ++i) {
431	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
432	<	}
468	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
469	<	} catch (InterruptedException e){
470	<	unexpectedException();
471	<	}
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		/**
436	<	*
436	>	* timed pool with nonzero timeout succeeds when non-empty, else times out
437		*/
438	<	public void testTimedPoll() {
439	<	try {
440	<	ArrayBlockingQueue q = populatedQueue(SIZE);
441	<	for (int i = 0; i < SIZE; ++i) {
442	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
443	<	}
483	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
484	<	} catch (InterruptedException e){
485	<	unexpectedException();
486	<	}
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		/**
447	<	*
448	<	*/
449	<	public void testInterruptedTimedPoll() {
450	<	Thread t = new Thread(new Runnable() {
451	<	public void run() {
452	<	try {
453	<	ArrayBlockingQueue q = populatedQueue(SIZE);
454	<	for (int i = 0; i < SIZE; ++i) {
455	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
456	<	}
457	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
458	<	} catch (InterruptedException success){
459	<	}
460	<	}});
461	<	try {
462	<	t.start();
463	<	Thread.sleep(SHORT_DELAY_MS);
507	<	t.interrupt();
508	<	t.join();
509	<	}
510	<	catch (InterruptedException ie) {
511	<	unexpectedException();
512	<	}
447	>	* Interrupted timed poll throws InterruptedException instead of
448	>	* returning timeout status
449	>	*/
450	>	public void testInterruptedTimedPoll() throws InterruptedException {
451	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
452	>	public void realRun() throws InterruptedException {
453	>	ArrayBlockingQueue q = populatedQueue(SIZE);
454	>	for (int i = 0; i < SIZE; ++i) {
455	>	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
456	>	}
457	>	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
458	>	}};
459	>
460	>	t.start();
461	>	Thread.sleep(SMALL_DELAY_MS);
462	>	t.interrupt();
463	>	t.join();
464		}
465
466		/**
467	<	*
467	>	*  timed poll before a delayed offer fails; after offer succeeds;
468	>	*  on interruption throws
469		*/
470	<	public void testTimedPollWithOffer() {
470	>	public void testTimedPollWithOffer() throws InterruptedException {
471		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
472	<	Thread t = new Thread(new Runnable() {
473	<	public void run() {
474	<	try {
475	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
476	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
477	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
478	<	threadShouldThrow();
479	<	} catch (InterruptedException success) { }
480	<	}
481	<	});
482	<	try {
483	<	t.start();
484	<	Thread.sleep(SMALL_DELAY_MS);
533	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
534	<	t.interrupt();
535	<	t.join();
536	<	} catch (Exception e){
537	<	unexpectedException();
538	<	}
539	<	}
472	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
473	>	public void realRun() throws InterruptedException {
474	>	threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
475	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
476	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
477	>	}};
478	>
479	>	t.start();
480	>	Thread.sleep(SMALL_DELAY_MS);
481	>	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
482	>	t.interrupt();
483	>	t.join();
484	>	}
485
486
487		/**
488	<	*
488	>	* peek returns next element, or null if empty
489		*/
490		public void testPeek() {
491		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 550 | Line 495 | public class ArrayBlockingQueueTest exte
495		assertTrue(q.peek() == null ||
496		i != ((Integer)q.peek()).intValue());
497		}
498	<	assertNull(q.peek());
498	>	assertNull(q.peek());
499		}
500
501		/**
502	<	*
502	>	* element returns next element, or throws NSEE if empty
503		*/
504		public void testElement() {
505		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 565 | Line 510 | public class ArrayBlockingQueueTest exte
510		try {
511		q.element();
512		shouldThrow();
513	<	}
569	<	catch (NoSuchElementException success) {}
513	>	} catch (NoSuchElementException success) {}
514		}
515
516		/**
517	<	*
517	>	* remove removes next element, or throws NSEE if empty
518		*/
519		public void testRemove() {
520		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 580 | Line 524 | public class ArrayBlockingQueueTest exte
524		try {
525		q.remove();
526		shouldThrow();
527	<	} catch (NoSuchElementException success){
584	<	}
527	>	} catch (NoSuchElementException success) {}
528		}
529
530		/**
531	<	*
531	>	* remove(x) removes x and returns true if present
532		*/
533		public void testRemoveElement() {
534		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 598 | Line 541 | public class ArrayBlockingQueueTest exte
541		}
542		assertTrue(q.isEmpty());
543		}
544	<
544	>
545		/**
546	<	*
546	>	* contains(x) reports true when elements added but not yet removed
547		*/
548		public void testContains() {
549		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 612 | Line 555 | public class ArrayBlockingQueueTest exte
555		}
556
557		/**
558	<	*
558	>	* clear removes all elements
559		*/
560		public void testClear() {
561		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 622 | Line 565 | public class ArrayBlockingQueueTest exte
565		assertEquals(SIZE, q.remainingCapacity());
566		q.add(one);
567		assertFalse(q.isEmpty());
568	+	assertTrue(q.contains(one));
569		q.clear();
570		assertTrue(q.isEmpty());
571		}
572
573		/**
574	<	*
574	>	* containsAll(c) is true when c contains a subset of elements
575		*/
576		public void testContainsAll() {
577		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 641 | Line 585 | public class ArrayBlockingQueueTest exte
585		}
586
587		/**
588	<	*
588	>	* retainAll(c) retains only those elements of c and reports true if changed
589		*/
590		public void testRetainAll() {
591		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 660 | Line 604 | public class ArrayBlockingQueueTest exte
604		}
605
606		/**
607	<	*
607	>	* removeAll(c) removes only those elements of c and reports true if changed
608		*/
609		public void testRemoveAll() {
610		for (int i = 1; i < SIZE; ++i) {
#	Line 675 | Line 619 | public class ArrayBlockingQueueTest exte
619		}
620		}
621
678	–
622		/**
623	<	*
623	>	*  toArray contains all elements
624		*/
625	<	public void testToArray() {
625	>	public void testToArray() throws InterruptedException {
626		ArrayBlockingQueue q = populatedQueue(SIZE);
627	<	Object[] o = q.toArray();
628	<	try {
629	<	for(int i = 0; i < o.length; i++)
687	<	assertEquals(o[i], q.take());
688	<	} catch (InterruptedException e){
689	<	unexpectedException();
690	<	}
627	>	Object[] o = q.toArray();
628	>	for (int i = 0; i < o.length; i++)
629	>	assertEquals(o[i], q.take());
630		}
631
632		/**
633	<	*
633	>	* toArray(a) contains all elements
634		*/
635	<	public void testToArray2() {
635	>	public void testToArray2() throws InterruptedException {
636		ArrayBlockingQueue q = populatedQueue(SIZE);
637	<	Integer[] ints = new Integer[SIZE];
638	<	ints = (Integer[])q.toArray(ints);
639	<	try {
640	<	for(int i = 0; i < ints.length; i++)
641	<	assertEquals(ints[i], q.take());
642	<	} catch (InterruptedException e){
643	<	unexpectedException();
644	<	}
637	>	Integer[] ints = new Integer[SIZE];
638	>	ints = (Integer[])q.toArray(ints);
639	>	for (int i = 0; i < ints.length; i++)
640	>	assertEquals(ints[i], q.take());
641	>	}
642	>
643	>	/**
644	>	* toArray(null) throws NPE
645	>	*/
646	>	public void testToArray_BadArg() {
647	>	try {
648	>	ArrayBlockingQueue q = populatedQueue(SIZE);
649	>	Object o[] = q.toArray(null);
650	>	shouldThrow();
651	>	} catch (NullPointerException success) {}
652	>	}
653	>
654	>	/**
655	>	* toArray with incompatible array type throws CCE
656	>	*/
657	>	public void testToArray1_BadArg() {
658	>	try {
659	>	ArrayBlockingQueue q = populatedQueue(SIZE);
660	>	Object o[] = q.toArray(new String[10] );
661	>	shouldThrow();
662	>	} catch (ArrayStoreException success) {}
663		}
664	<
664	>
665	>
666		/**
667	<	*
667	>	* iterator iterates through all elements
668		*/
669	<	public void testIterator() {
669	>	public void testIterator() throws InterruptedException {
670		ArrayBlockingQueue q = populatedQueue(SIZE);
671	<	Iterator it = q.iterator();
672	<	try {
673	<	while(it.hasNext()){
674	<	assertEquals(it.next(), q.take());
717	<	}
718	<	} catch (InterruptedException e){
719	<	unexpectedException();
720	<	}
671	>	Iterator it = q.iterator();
672	>	while (it.hasNext()) {
673	>	assertEquals(it.next(), q.take());
674	>	}
675		}
676
677		/**
678	<	*
678	>	* iterator.remove removes current element
679	>	*/
680	>	public void testIteratorRemove () {
681	>	final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
682	>	q.add(two);
683	>	q.add(one);
684	>	q.add(three);
685	>
686	>	Iterator it = q.iterator();
687	>	it.next();
688	>	it.remove();
689	>
690	>	it = q.iterator();
691	>	assertEquals(it.next(), one);
692	>	assertEquals(it.next(), three);
693	>	assertFalse(it.hasNext());
694	>	}
695	>
696	>	/**
697	>	* iterator ordering is FIFO
698		*/
699		public void testIteratorOrdering() {
700		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
#	Line 740 | Line 713 | public class ArrayBlockingQueueTest exte
713		}
714
715		/**
716	<	*
716	>	* Modifications do not cause iterators to fail
717		*/
718		public void testWeaklyConsistentIteration () {
719		final ArrayBlockingQueue q = new ArrayBlockingQueue(3);
720		q.add(one);
721		q.add(two);
722		q.add(three);
723	<	try {
724	<	for (Iterator it = q.iterator(); it.hasNext();) {
725	<	q.remove();
753	<	it.next();
754	<	}
755	<	}
756	<	catch (ConcurrentModificationException e) {
757	<	unexpectedException();
723	>	for (Iterator it = q.iterator(); it.hasNext();) {
724	>	q.remove();
725	>	it.next();
726		}
759	–
727		assertEquals(0, q.size());
728		}
729
730
731		/**
732	<	*
732	>	* toString contains toStrings of elements
733		*/
734		public void testToString() {
735		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 770 | Line 737 | public class ArrayBlockingQueueTest exte
737		for (int i = 0; i < SIZE; ++i) {
738		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
739		}
740	<	}
740	>	}
741
742
743		/**
744	<	*
744	>	* offer transfers elements across Executor tasks
745		*/
746		public void testOfferInExecutor() {
780	–
747		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
782	–
748		q.add(one);
749		q.add(two);
785	–
750		ExecutorService executor = Executors.newFixedThreadPool(2);
751	<
752	<	executor.execute(new Runnable() {
789	<	public void run() {
751	>	executor.execute(new CheckedRunnable() {
752	>	public void realRun() throws InterruptedException {
753		threadAssertFalse(q.offer(three));
754	<	try {
755	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
756	<	threadAssertEquals(0, q.remainingCapacity());
757	<	}
758	<	catch (InterruptedException e) {
759	<	threadUnexpectedException();
760	<	}
761	<	}
762	<	});
754	>	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS));
755	>	threadAssertEquals(0, q.remainingCapacity());
756	>	}});
757	>
758	>	executor.execute(new CheckedRunnable() {
759	>	public void realRun() throws InterruptedException {
760	>	Thread.sleep(SMALL_DELAY_MS);
761	>	threadAssertEquals(one, q.take());
762	>	}});
763
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	–
764		joinPool(executor);
765
766		}
767
768		/**
769	<	*
769	>	* poll retrieves elements across Executor threads
770		*/
771		public void testPollInExecutor() {
821	–
772		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
823	–
773		ExecutorService executor = Executors.newFixedThreadPool(2);
774	<
775	<	executor.execute(new Runnable() {
827	<	public void run() {
774	>	executor.execute(new CheckedRunnable() {
775	>	public void realRun() throws InterruptedException {
776		threadAssertNull(q.poll());
777	<	try {
778	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
779	<	threadAssertTrue(q.isEmpty());
780	<	}
781	<	catch (InterruptedException e) {
782	<	threadUnexpectedException();
783	<	}
784	<	}
785	<	});
777	>	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
778	>	threadAssertTrue(q.isEmpty());
779	>	}});
780	>
781	>	executor.execute(new CheckedRunnable() {
782	>	public void realRun() throws InterruptedException {
783	>	Thread.sleep(SMALL_DELAY_MS);
784	>	q.put(one);
785	>	}});
786
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	–
787		joinPool(executor);
788	+	}
789	+
790	+	/**
791	+	* A deserialized serialized queue has same elements in same order
792	+	*/
793	+	public void testSerialization() throws Exception {
794	+	ArrayBlockingQueue q = populatedQueue(SIZE);
795	+
796	+	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
797	+	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
798	+	out.writeObject(q);
799	+	out.close();
800
801	+	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
802	+	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
803	+	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
804	+	assertEquals(q.size(), r.size());
805	+	while (!q.isEmpty())
806	+	assertEquals(q.remove(), r.remove());
807		}
808
809		/**
810	<	*
810	>	* drainTo(null) throws NPE
811		*/
812	<	public void testSerialization() {
812	>	public void testDrainToNull() {
813		ArrayBlockingQueue q = populatedQueue(SIZE);
814	+	try {
815	+	q.drainTo(null);
816	+	shouldThrow();
817	+	} catch (NullPointerException success) {}
818	+	}
819
820	+	/**
821	+	* drainTo(this) throws IAE
822	+	*/
823	+	public void testDrainToSelf() {
824	+	ArrayBlockingQueue q = populatedQueue(SIZE);
825		try {
826	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
827	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
828	<	out.writeObject(q);
829	<	out.close();
826	>	q.drainTo(q);
827	>	shouldThrow();
828	>	} catch (IllegalArgumentException success) {}
829	>	}
830
831	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
832	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
833	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
834	<	assertEquals(q.size(), r.size());
835	<	while (!q.isEmpty())
836	<	assertEquals(q.remove(), r.remove());
837	<	} catch(Exception e){
838	<	unexpectedException();
839	<	}
831	>	/**
832	>	* drainTo(c) empties queue into another collection c
833	>	*/
834	>	public void testDrainTo() {
835	>	ArrayBlockingQueue q = populatedQueue(SIZE);
836	>	ArrayList l = new ArrayList();
837	>	q.drainTo(l);
838	>	assertEquals(q.size(), 0);
839	>	assertEquals(l.size(), SIZE);
840	>	for (int i = 0; i < SIZE; ++i)
841	>	assertEquals(l.get(i), new Integer(i));
842	>	q.add(zero);
843	>	q.add(one);
844	>	assertFalse(q.isEmpty());
845	>	assertTrue(q.contains(zero));
846	>	assertTrue(q.contains(one));
847	>	l.clear();
848	>	q.drainTo(l);
849	>	assertEquals(q.size(), 0);
850	>	assertEquals(l.size(), 2);
851	>	for (int i = 0; i < 2; ++i)
852	>	assertEquals(l.get(i), new Integer(i));
853	>	}
854	>
855	>	/**
856	>	* drainTo empties full queue, unblocking a waiting put.
857	>	*/
858	>	public void testDrainToWithActivePut() throws InterruptedException {
859	>	final ArrayBlockingQueue q = populatedQueue(SIZE);
860	>	Thread t = new Thread(new CheckedRunnable() {
861	>	public void realRun() throws InterruptedException {
862	>	q.put(new Integer(SIZE+1));
863	>	}});
864	>
865	>	t.start();
866	>	ArrayList l = new ArrayList();
867	>	q.drainTo(l);
868	>	assertTrue(l.size() >= SIZE);
869	>	for (int i = 0; i < SIZE; ++i)
870	>	assertEquals(l.get(i), new Integer(i));
871	>	t.join();
872	>	assertTrue(q.size() + l.size() >= SIZE);
873		}
874
875	+	/**
876	+	* drainTo(null, n) throws NPE
877	+	*/
878	+	public void testDrainToNullN() {
879	+	ArrayBlockingQueue q = populatedQueue(SIZE);
880	+	try {
881	+	q.drainTo(null, 0);
882	+	shouldThrow();
883	+	} catch (NullPointerException success) {}
884	+	}
885	+
886	+	/**
887	+	* drainTo(this, n) throws IAE
888	+	*/
889	+	public void testDrainToSelfN() {
890	+	ArrayBlockingQueue q = populatedQueue(SIZE);
891	+	try {
892	+	q.drainTo(q, 0);
893	+	shouldThrow();
894	+	} catch (IllegalArgumentException success) {}
895	+	}
896	+
897	+	/**
898	+	* drainTo(c, n) empties first max {n, size} elements of queue into c
899	+	*/
900	+	public void testDrainToN() {
901	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2);
902	+	for (int i = 0; i < SIZE + 2; ++i) {
903	+	for (int j = 0; j < SIZE; j++)
904	+	assertTrue(q.offer(new Integer(j)));
905	+	ArrayList l = new ArrayList();
906	+	q.drainTo(l, i);
907	+	int k = (i < SIZE)? i : SIZE;
908	+	assertEquals(l.size(), k);
909	+	assertEquals(q.size(), SIZE-k);
910	+	for (int j = 0; j < k; ++j)
911	+	assertEquals(l.get(j), new Integer(j));
912	+	while (q.poll() != null) ;
913	+	}
914	+	}
915
916		}

Diff Legend

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