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.5 by dl, Thu Sep 25 11:02:41 2003 UTC vs.
Revision 1.22 by jsr166, Sat Nov 21 19:48:24 2009 UTC

#	Line 1 | Line 1
1		/*
2	<	* Written by members of JCP JSR-166 Expert Group and released to the
3	<	* public domain. Use, modify, and redistribute this code in any way
4	<	* without acknowledgement. Other contributors include Andrew Wright,
5	<	* Jeffrey Hayes, Pat Fischer, Mike Judd.
2	>	* Written by Doug Lea with assistance from members of JCP JSR-166
3	>	* Expert Group and released to the public domain, as explained at
4	>	* http://creativecommons.org/licenses/publicdomain
5	>	* Other contributors include Andrew Wright, Jeffrey Hayes,
6	>	* Pat Fisher, Mike Judd.
7		*/
8
9
10		import junit.framework.*;
11		import java.util.*;
12		import java.util.concurrent.*;
13	+	import static java.util.concurrent.TimeUnit.MILLISECONDS;
14		import java.io.*;
15
16		public class ArrayBlockingQueueTest extends 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		* A new queue has the indicated capacity
41		*/
#	Line 42 | Line 44 | public class ArrayBlockingQueueTest exte
44		}
45
46		/**
47	<	* Constructor throws IAE if  capacity argument nonpositive
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		/**
#	Line 59 | Line 60 | public class ArrayBlockingQueueTest exte
60		try {
61		ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null);
62		shouldThrow();
63	<	}
63	<	catch (NullPointerException success) {}
63	>	} catch (NullPointerException success) {}
64		}
65
66		/**
#	Line 71 | Line 71 | public class ArrayBlockingQueueTest exte
71		Integer[] ints = new Integer[SIZE];
72		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
73		shouldThrow();
74	<	}
75	<	catch (NullPointerException success) {}
74	>	} catch (NullPointerException success) {}
75		}
76
77		/**
#	Line 85 | 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	<	}
89	<	catch (NullPointerException success) {}
87	>	} catch (NullPointerException success) {}
88		}
89
90		/**
#	Line 99 | 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	<	}
103	<	catch (IllegalArgumentException success) {}
100	>	} catch (IllegalArgumentException success) {}
101		}
102
103		/**
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)
116	<	assertEquals(ints[i], q.poll());
117	<	}
118	<	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		/**
#	Line 154 | Line 148 | public class ArrayBlockingQueueTest exte
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	>	*  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		/**
#	Line 174 | Line 179 | public class ArrayBlockingQueueTest exte
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		/**
#	Line 193 | Line 198 | public class ArrayBlockingQueueTest exte
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		*  addAll of a collection with null elements throws NPE
218		*/
#	Line 205 | Line 222 | public class ArrayBlockingQueueTest exte
222		Integer[] ints = new Integer[SIZE];
223		q.addAll(Arrays.asList(ints));
224		shouldThrow();
225	<	}
209	<	catch (NullPointerException success) {}
225	>	} catch (NullPointerException success) {}
226		}
227		/**
228		* addAll of a collection with any null elements throws NPE after
#	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		* addAll throws ISE if not enough room
#	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		* 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		*  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		* 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		* put blocks interruptibly if full
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	<	}
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		/**
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 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		/**
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		* 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		* 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		* 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
#	Line 453 | Line 418 | public class ArrayBlockingQueueTest exte
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		* 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		* 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		* Interrupted timed poll throws InterruptedException instead of
448		* returning timeout status
449		*/
450	<	public void testInterruptedTimedPoll() {
451	<	Thread t = new Thread(new Runnable() {
452	<	public void run() {
453	<	try {
454	<	ArrayBlockingQueue q = populatedQueue(SIZE);
455	<	for (int i = 0; i < SIZE; ++i) {
456	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
457	<	}
458	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
459	<	} catch (InterruptedException success){
460	<	}
461	<	}});
462	<	try {
463	<	t.start();
464	<	Thread.sleep(SHORT_DELAY_MS);
465	<	t.interrupt();
466	<	t.join();
510	<	}
511	<	catch (InterruptedException ie) {
512	<	unexpectedException();
513	<	}
450	>	public void testInterruptedTimedPoll() throws InterruptedException {
451	>	Thread t = new Thread(new CheckedRunnable() {
452	>	public void realRun() throws InterruptedException {
453	>	ArrayBlockingQueue q = populatedQueue(SIZE);
454	>	for (int i = 0; i < SIZE; ++i) {
455	>	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
456	>	}
457	>	try {
458	>	q.poll(SMALL_DELAY_MS, MILLISECONDS);
459	>	shouldThrow();
460	>	} catch (InterruptedException success) {}
461	>	}});
462	>
463	>	t.start();
464	>	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() {
473	>	public void testTimedPollWithOffer() throws InterruptedException {
474		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
475	<	Thread t = new Thread(new Runnable() {
476	<	public void run() {
477	<	try {
478	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
479	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
480	<	q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS);
481	<	threadShouldThrow();
482	<	} catch (InterruptedException success) { }
483	<	}
484	<	});
485	<	try {
486	<	t.start();
487	<	Thread.sleep(SMALL_DELAY_MS);
535	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
536	<	t.interrupt();
537	<	t.join();
538	<	} catch (Exception e){
539	<	unexpectedException();
540	<	}
541	<	}
475	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
476	>	public void realRun() throws InterruptedException {
477	>	threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
478	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
479	>	q.poll(LONG_DELAY_MS, MILLISECONDS);
480	>	}};
481	>
482	>	t.start();
483	>	Thread.sleep(SMALL_DELAY_MS);
484	>	assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS));
485	>	t.interrupt();
486	>	t.join();
487	>	}
488
489
490		/**
#	Line 552 | Line 498 | public class ArrayBlockingQueueTest exte
498		assertTrue(q.peek() == null ||
499		i != ((Integer)q.peek()).intValue());
500		}
501	<	assertNull(q.peek());
501	>	assertNull(q.peek());
502		}
503
504		/**
#	Line 567 | Line 513 | public class ArrayBlockingQueueTest exte
513		try {
514		q.element();
515		shouldThrow();
516	<	}
571	<	catch (NoSuchElementException success) {}
516	>	} catch (NoSuchElementException success) {}
517		}
518
519		/**
#	Line 582 | Line 527 | public class ArrayBlockingQueueTest exte
527		try {
528		q.remove();
529		shouldThrow();
530	<	} catch (NoSuchElementException success){
586	<	}
530	>	} catch (NoSuchElementException success) {}
531		}
532
533		/**
#	Line 600 | Line 544 | public class ArrayBlockingQueueTest exte
544		}
545		assertTrue(q.isEmpty());
546		}
547	<
547	>
548		/**
549		* contains(x) reports true when elements added but not yet removed
550		*/
#	Line 624 | 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		}
#	Line 680 | Line 625 | public class ArrayBlockingQueueTest exte
625		/**
626		*  toArray contains all elements
627		*/
628	<	public void testToArray() {
628	>	public void testToArray() throws InterruptedException {
629		ArrayBlockingQueue q = populatedQueue(SIZE);
630	<	Object[] o = q.toArray();
631	<	try {
632	<	for(int i = 0; i < o.length; i++)
688	<	assertEquals(o[i], q.take());
689	<	} catch (InterruptedException e){
690	<	unexpectedException();
691	<	}
630	>	Object[] o = q.toArray();
631	>	for (int i = 0; i < o.length; i++)
632	>	assertEquals(o[i], q.take());
633		}
634
635		/**
636		* toArray(a) contains all elements
637		*/
638	<	public void testToArray2() {
638	>	public void testToArray2() throws InterruptedException {
639		ArrayBlockingQueue q = populatedQueue(SIZE);
640	<	Integer[] ints = new Integer[SIZE];
641	<	ints = (Integer[])q.toArray(ints);
642	<	try {
643	<	for(int i = 0; i < ints.length; i++)
644	<	assertEquals(ints[i], q.take());
645	<	} catch (InterruptedException e){
646	<	unexpectedException();
647	<	}
640	>	Integer[] ints = new Integer[SIZE];
641	>	ints = (Integer[])q.toArray(ints);
642	>	for (int i = 0; i < ints.length; i++)
643	>	assertEquals(ints[i], q.take());
644	>	}
645	>
646	>	/**
647	>	* toArray(null) throws NPE
648	>	*/
649	>	public void testToArray_BadArg() {
650	>	try {
651	>	ArrayBlockingQueue q = populatedQueue(SIZE);
652	>	Object o[] = q.toArray(null);
653	>	shouldThrow();
654	>	} catch (NullPointerException success) {}
655	>	}
656	>
657	>	/**
658	>	* toArray with incompatible array type throws CCE
659	>	*/
660	>	public void testToArray1_BadArg() {
661	>	try {
662	>	ArrayBlockingQueue q = populatedQueue(SIZE);
663	>	Object o[] = q.toArray(new String[10] );
664	>	shouldThrow();
665	>	} catch (ArrayStoreException success) {}
666		}
667	<
667	>
668	>
669		/**
670		* iterator iterates through all elements
671		*/
672	<	public void testIterator() {
672	>	public void testIterator() throws InterruptedException {
673		ArrayBlockingQueue q = populatedQueue(SIZE);
674	<	Iterator it = q.iterator();
675	<	try {
676	<	while(it.hasNext()){
677	<	assertEquals(it.next(), q.take());
718	<	}
719	<	} catch (InterruptedException e){
720	<	unexpectedException();
721	<	}
674	>	Iterator it = q.iterator();
675	>	while (it.hasNext()) {
676	>	assertEquals(it.next(), q.take());
677	>	}
678		}
679
680		/**
#	Line 733 | Line 689 | public class ArrayBlockingQueueTest exte
689		Iterator it = q.iterator();
690		it.next();
691		it.remove();
692	<
692	>
693		it = q.iterator();
694		assertEquals(it.next(), one);
695		assertEquals(it.next(), three);
#	Line 767 | Line 723 | public class ArrayBlockingQueueTest exte
723		q.add(one);
724		q.add(two);
725		q.add(three);
726	<	try {
727	<	for (Iterator it = q.iterator(); it.hasNext();) {
728	<	q.remove();
773	<	it.next();
774	<	}
775	<	}
776	<	catch (ConcurrentModificationException e) {
777	<	unexpectedException();
726	>	for (Iterator it = q.iterator(); it.hasNext();) {
727	>	q.remove();
728	>	it.next();
729		}
730		assertEquals(0, q.size());
731		}
#	Line 789 | Line 740 | public class ArrayBlockingQueueTest exte
740		for (int i = 0; i < SIZE; ++i) {
741		assertTrue(s.indexOf(String.valueOf(i)) >= 0);
742		}
743	<	}
743	>	}
744
745
746		/**
#	Line 800 | Line 751 | public class ArrayBlockingQueueTest exte
751		q.add(one);
752		q.add(two);
753		ExecutorService executor = Executors.newFixedThreadPool(2);
754	<	executor.execute(new Runnable() {
755	<	public void run() {
754	>	executor.execute(new CheckedRunnable() {
755	>	public void realRun() throws InterruptedException {
756		threadAssertFalse(q.offer(three));
757	<	try {
758	<	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
759	<	threadAssertEquals(0, q.remainingCapacity());
760	<	}
761	<	catch (InterruptedException e) {
762	<	threadUnexpectedException();
763	<	}
764	<	}
765	<	});
757	>	threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS));
758	>	threadAssertEquals(0, q.remainingCapacity());
759	>	}});
760	>
761	>	executor.execute(new CheckedRunnable() {
762	>	public void realRun() throws InterruptedException {
763	>	Thread.sleep(SMALL_DELAY_MS);
764	>	threadAssertEquals(one, q.take());
765	>	}});
766
816	–	executor.execute(new Runnable() {
817	–	public void run() {
818	–	try {
819	–	Thread.sleep(SMALL_DELAY_MS);
820	–	threadAssertEquals(one, q.take());
821	–	}
822	–	catch (InterruptedException e) {
823	–	threadUnexpectedException();
824	–	}
825	–	}
826	–	});
827	–
767		joinPool(executor);
768
769		}
#	Line 835 | Line 774 | public class ArrayBlockingQueueTest exte
774		public void testPollInExecutor() {
775		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
776		ExecutorService executor = Executors.newFixedThreadPool(2);
777	<	executor.execute(new Runnable() {
778	<	public void run() {
777	>	executor.execute(new CheckedRunnable() {
778	>	public void realRun() throws InterruptedException {
779		threadAssertNull(q.poll());
780	<	try {
781	<	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS));
782	<	threadAssertTrue(q.isEmpty());
783	<	}
784	<	catch (InterruptedException e) {
785	<	threadUnexpectedException();
786	<	}
787	<	}
788	<	});
780	>	threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS));
781	>	threadAssertTrue(q.isEmpty());
782	>	}});
783	>
784	>	executor.execute(new CheckedRunnable() {
785	>	public void realRun() throws InterruptedException {
786	>	Thread.sleep(SMALL_DELAY_MS);
787	>	q.put(one);
788	>	}});
789
851	–	executor.execute(new Runnable() {
852	–	public void run() {
853	–	try {
854	–	Thread.sleep(SMALL_DELAY_MS);
855	–	q.put(one);
856	–	}
857	–	catch (InterruptedException e) {
858	–	threadUnexpectedException();
859	–	}
860	–	}
861	–	});
862	–
790		joinPool(executor);
791		}
792
793		/**
794		* A deserialized serialized queue has same elements in same order
795		*/
796	<	public void testSerialization() {
796	>	public void testSerialization() throws Exception {
797		ArrayBlockingQueue q = populatedQueue(SIZE);
798
799	+	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
800	+	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
801	+	out.writeObject(q);
802	+	out.close();
803	+
804	+	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
805	+	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
806	+	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
807	+	assertEquals(q.size(), r.size());
808	+	while (!q.isEmpty())
809	+	assertEquals(q.remove(), r.remove());
810	+	}
811	+
812	+	/**
813	+	* drainTo(null) throws NPE
814	+	*/
815	+	public void testDrainToNull() {
816	+	ArrayBlockingQueue q = populatedQueue(SIZE);
817		try {
818	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
819	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
820	<	out.writeObject(q);
821	<	out.close();
822	<
823	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
824	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
825	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
826	<	assertEquals(q.size(), r.size());
827	<	while (!q.isEmpty())
828	<	assertEquals(q.remove(), r.remove());
829	<	} catch(Exception e){
830	<	unexpectedException();
831	<	}
818	>	q.drainTo(null);
819	>	shouldThrow();
820	>	} catch (NullPointerException success) {}
821	>	}
822	>
823	>	/**
824	>	* drainTo(this) throws IAE
825	>	*/
826	>	public void testDrainToSelf() {
827	>	ArrayBlockingQueue q = populatedQueue(SIZE);
828	>	try {
829	>	q.drainTo(q);
830	>	shouldThrow();
831	>	} catch (IllegalArgumentException success) {}
832	>	}
833	>
834	>	/**
835	>	* drainTo(c) empties queue into another collection c
836	>	*/
837	>	public void testDrainTo() {
838	>	ArrayBlockingQueue q = populatedQueue(SIZE);
839	>	ArrayList l = new ArrayList();
840	>	q.drainTo(l);
841	>	assertEquals(q.size(), 0);
842	>	assertEquals(l.size(), SIZE);
843	>	for (int i = 0; i < SIZE; ++i)
844	>	assertEquals(l.get(i), new Integer(i));
845	>	q.add(zero);
846	>	q.add(one);
847	>	assertFalse(q.isEmpty());
848	>	assertTrue(q.contains(zero));
849	>	assertTrue(q.contains(one));
850	>	l.clear();
851	>	q.drainTo(l);
852	>	assertEquals(q.size(), 0);
853	>	assertEquals(l.size(), 2);
854	>	for (int i = 0; i < 2; ++i)
855	>	assertEquals(l.get(i), new Integer(i));
856	>	}
857	>
858	>	/**
859	>	* drainTo empties full queue, unblocking a waiting put.
860	>	*/
861	>	public void testDrainToWithActivePut() throws InterruptedException {
862	>	final ArrayBlockingQueue q = populatedQueue(SIZE);
863	>	Thread t = new Thread(new CheckedRunnable() {
864	>	public void realRun() throws InterruptedException {
865	>	q.put(new Integer(SIZE+1));
866	>	}});
867	>
868	>	t.start();
869	>	ArrayList l = new ArrayList();
870	>	q.drainTo(l);
871	>	assertTrue(l.size() >= SIZE);
872	>	for (int i = 0; i < SIZE; ++i)
873	>	assertEquals(l.get(i), new Integer(i));
874	>	t.join();
875	>	assertTrue(q.size() + l.size() >= SIZE);
876		}
877
878	+	/**
879	+	* drainTo(null, n) throws NPE
880	+	*/
881	+	public void testDrainToNullN() {
882	+	ArrayBlockingQueue q = populatedQueue(SIZE);
883	+	try {
884	+	q.drainTo(null, 0);
885	+	shouldThrow();
886	+	} catch (NullPointerException success) {}
887	+	}
888	+
889	+	/**
890	+	* drainTo(this, n) throws IAE
891	+	*/
892	+	public void testDrainToSelfN() {
893	+	ArrayBlockingQueue q = populatedQueue(SIZE);
894	+	try {
895	+	q.drainTo(q, 0);
896	+	shouldThrow();
897	+	} catch (IllegalArgumentException success) {}
898	+	}
899	+
900	+	/**
901	+	* drainTo(c, n) empties first max {n, size} elements of queue into c
902	+	*/
903	+	public void testDrainToN() {
904	+	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2);
905	+	for (int i = 0; i < SIZE + 2; ++i) {
906	+	for (int j = 0; j < SIZE; j++)
907	+	assertTrue(q.offer(new Integer(j)));
908	+	ArrayList l = new ArrayList();
909	+	q.drainTo(l, i);
910	+	int k = (i < SIZE)? i : SIZE;
911	+	assertEquals(l.size(), k);
912	+	assertEquals(q.size(), SIZE-k);
913	+	for (int j = 0; j < k; ++j)
914	+	assertEquals(l.get(j), new Integer(j));
915	+	while (q.poll() != null) ;
916	+	}
917	+	}
918
919		}

Diff Legend

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