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.11 by dl, Sun Oct 31 14:55:14 2004 UTC vs.
Revision 1.17 by jsr166, Sat Nov 21 07:10:56 2009 UTC

#	Line 2 | Line 2
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.
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 27 | Line 28 | public class ArrayBlockingQueueTest exte
28		private ArrayBlockingQueue populatedQueue(int n) {
29		ArrayBlockingQueue q = new ArrayBlockingQueue(n);
30		assertTrue(q.isEmpty());
31	<	for(int i = 0; i < n; i++)
32	<	assertTrue(q.offer(new Integer(i)));
31	>	for (int i = 0; i < n; i++)
32	>	assertTrue(q.offer(new Integer(i)));
33		assertFalse(q.isEmpty());
34		assertEquals(0, q.remainingCapacity());
35	<	assertEquals(n, q.size());
35	>	assertEquals(n, q.size());
36		return q;
37		}
38	<
38	>
39		/**
40		* A new queue has the indicated capacity
41		*/
#	Line 49 | Line 50 | public class ArrayBlockingQueueTest exte
50		try {
51		ArrayBlockingQueue q = new ArrayBlockingQueue(0);
52		shouldThrow();
53	<	}
53	<	catch (IllegalArgumentException success) {}
53	>	} catch (IllegalArgumentException success) {}
54		}
55
56		/**
#	Line 60 | Line 60 | public class ArrayBlockingQueueTest exte
60		try {
61		ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null);
62		shouldThrow();
63	<	}
64	<	catch (NullPointerException success) {}
63	>	} catch (NullPointerException success) {}
64		}
65
66		/**
#	Line 72 | 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	<	}
76	<	catch (NullPointerException success) {}
74	>	} catch (NullPointerException success) {}
75		}
76
77		/**
#	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		/**
#	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		/**
#	Line 155 | Line 151 | public class ArrayBlockingQueueTest exte
151		*  offer(null) throws NPE
152		*/
153		public void testOfferNull() {
154	<	try {
154	>	try {
155		ArrayBlockingQueue q = new ArrayBlockingQueue(1);
156		q.offer(null);
157		shouldThrow();
158	<	} catch (NullPointerException success) { }
158	>	} catch (NullPointerException success) {}
159		}
160
161		/**
162		*  add(null) throws NPE
163		*/
164		public void testAddNull() {
165	<	try {
165	>	try {
166		ArrayBlockingQueue q = new ArrayBlockingQueue(1);
167		q.add(null);
168		shouldThrow();
169	<	} catch (NullPointerException success) { }
169	>	} catch (NullPointerException success) {}
170		}
171
172		/**
#	Line 186 | Line 182 | public class ArrayBlockingQueueTest exte
182		* add succeeds if not full; throws ISE if full
183		*/
184		public void testAdd() {
185	<	try {
185	>	try {
186		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
187		for (int i = 0; i < SIZE; ++i) {
188		assertTrue(q.add(new Integer(i)));
189		}
190		assertEquals(0, q.remainingCapacity());
191		q.add(new Integer(SIZE));
192	<	} catch (IllegalStateException success){
193	<	}
192	>	shouldThrow();
193	>	} catch (IllegalStateException success) {}
194		}
195
196		/**
#	Line 205 | Line 201 | public class ArrayBlockingQueueTest exte
201		ArrayBlockingQueue q = new ArrayBlockingQueue(1);
202		q.addAll(null);
203		shouldThrow();
204	<	}
209	<	catch (NullPointerException success) {}
204	>	} catch (NullPointerException success) {}
205		}
206
207		/**
#	Line 217 | Line 212 | public class ArrayBlockingQueueTest exte
212		ArrayBlockingQueue q = populatedQueue(SIZE);
213		q.addAll(q);
214		shouldThrow();
215	<	}
221	<	catch (IllegalArgumentException success) {}
215	>	} catch (IllegalArgumentException success) {}
216		}
217
218
#	Line 231 | Line 225 | public class ArrayBlockingQueueTest exte
225		Integer[] ints = new Integer[SIZE];
226		q.addAll(Arrays.asList(ints));
227		shouldThrow();
228	<	}
235	<	catch (NullPointerException success) {}
228	>	} catch (NullPointerException success) {}
229		}
230		/**
231		* addAll of a collection with any null elements throws NPE after
#	Line 246 | Line 239 | public class ArrayBlockingQueueTest exte
239		ints[i] = new Integer(i);
240		q.addAll(Arrays.asList(ints));
241		shouldThrow();
242	<	}
250	<	catch (NullPointerException success) {}
242	>	} catch (NullPointerException success) {}
243		}
244		/**
245		* addAll throws ISE if not enough room
#	Line 260 | Line 252 | public class ArrayBlockingQueueTest exte
252		ints[i] = new Integer(i);
253		q.addAll(Arrays.asList(ints));
254		shouldThrow();
255	<	}
264	<	catch (IllegalStateException success) {}
255	>	} catch (IllegalStateException success) {}
256		}
257		/**
258		* Queue contains all elements, in traversal order, of successful addAll
259		*/
260		public void testAddAll5() {
261	<	try {
262	<	Integer[] empty = new Integer[0];
263	<	Integer[] ints = new Integer[SIZE];
264	<	for (int i = 0; i < SIZE; ++i)
265	<	ints[i] = new Integer(i);
266	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
267	<	assertFalse(q.addAll(Arrays.asList(empty)));
268	<	assertTrue(q.addAll(Arrays.asList(ints)));
269	<	for (int i = 0; i < SIZE; ++i)
279	<	assertEquals(ints[i], q.poll());
280	<	}
281	<	finally {}
261	>	Integer[] empty = new Integer[0];
262	>	Integer[] ints = new Integer[SIZE];
263	>	for (int i = 0; i < SIZE; ++i)
264	>	ints[i] = new Integer(i);
265	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
266	>	assertFalse(q.addAll(Arrays.asList(empty)));
267	>	assertTrue(q.addAll(Arrays.asList(ints)));
268	>	for (int i = 0; i < SIZE; ++i)
269	>	assertEquals(ints[i], q.poll());
270		}
271
272		/**
273		*  put(null) throws NPE
274		*/
275	<	public void testPutNull() {
276	<	try {
275	>	public void testPutNull() throws InterruptedException {
276	>	try {
277		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
278		q.put(null);
279		shouldThrow();
280	<	}
293	<	catch (NullPointerException success){
294	<	}
295	<	catch (InterruptedException ie) {
296	<	unexpectedException();
297	<	}
280	>	} catch (NullPointerException success) {}
281		}
282
283		/**
284		* all elements successfully put are contained
285		*/
286	<	public void testPut() {
287	<	try {
288	<	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
289	<	for (int i = 0; i < SIZE; ++i) {
290	<	Integer I = new Integer(i);
291	<	q.put(I);
309	<	assertTrue(q.contains(I));
310	<	}
311	<	assertEquals(0, q.remainingCapacity());
312	<	}
313	<	catch (InterruptedException ie) {
314	<	unexpectedException();
286	>	public void testPut() throws InterruptedException {
287	>	ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
288	>	for (int i = 0; i < SIZE; ++i) {
289	>	Integer I = new Integer(i);
290	>	q.put(I);
291	>	assertTrue(q.contains(I));
292		}
293	+	assertEquals(0, q.remainingCapacity());
294		}
295
296		/**
297		* put blocks interruptibly if full
298		*/
299	<	public void testBlockingPut() {
299	>	public void testBlockingPut() throws InterruptedException {
300		final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE);
301	<	Thread t = new Thread(new Runnable() {
302	<	public void run() {
303	<	int added = 0;
304	<	try {
305	<	for (int i = 0; i < SIZE; ++i) {
306	<	q.put(new Integer(i));
307	<	++added;
308	<	}
309	<	q.put(new Integer(SIZE));
310	<	threadShouldThrow();
311	<	} catch (InterruptedException ie){
312	<	threadAssertEquals(added, SIZE);
313	<	}
314	<	}});
315	<	try {
316	<	t.start();
317	<	Thread.sleep(MEDIUM_DELAY_MS);
318	<	t.interrupt();
341	<	t.join();
342	<	}
343	<	catch (InterruptedException ie) {
344	<	unexpectedException();
345	<	}
301	>	Thread t = new Thread(new CheckedRunnable() {
302	>	public void realRun() {
303	>	int added = 0;
304	>	try {
305	>	for (int i = 0; i < SIZE; ++i) {
306	>	q.put(new Integer(i));
307	>	++added;
308	>	}
309	>	q.put(new Integer(SIZE));
310	>	threadShouldThrow();
311	>	} catch (InterruptedException ie) {
312	>	threadAssertEquals(added, SIZE);
313	>	}}});
314	>
315	>	t.start();
316	>	Thread.sleep(MEDIUM_DELAY_MS);
317	>	t.interrupt();
318	>	t.join();
319		}
320
321		/**
322		* put blocks waiting for take when full
323		*/
324	<	public void testPutWithTake() {
324	>	public void testPutWithTake() throws InterruptedException {
325		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
326	<	Thread t = new Thread(new Runnable() {
327	<	public void run() {
328	<	int added = 0;
329	<	try {
330	<	q.put(new Object());
331	<	++added;
332	<	q.put(new Object());
333	<	++added;
334	<	q.put(new Object());
335	<	++added;
336	<	q.put(new Object());
337	<	++added;
338	<	threadShouldThrow();
339	<	} catch (InterruptedException e){
340	<	threadAssertTrue(added >= 2);
341	<	}
342	<	}
343	<	});
344	<	try {
345	<	t.start();
346	<	Thread.sleep(SHORT_DELAY_MS);
347	<	q.take();
348	<	t.interrupt();
376	<	t.join();
377	<	} catch (Exception e){
378	<	unexpectedException();
379	<	}
326	>	Thread t = new Thread(new CheckedRunnable() {
327	>	public void realRun() {
328	>	int added = 0;
329	>	try {
330	>	q.put(new Object());
331	>	++added;
332	>	q.put(new Object());
333	>	++added;
334	>	q.put(new Object());
335	>	++added;
336	>	q.put(new Object());
337	>	++added;
338	>	threadShouldThrow();
339	>	} catch (InterruptedException e) {
340	>	threadAssertTrue(added >= 2);
341	>	}
342	>	}});
343	>
344	>	t.start();
345	>	Thread.sleep(SHORT_DELAY_MS);
346	>	q.take();
347	>	t.interrupt();
348	>	t.join();
349		}
350
351		/**
352		* timed offer times out if full and elements not taken
353		*/
354	<	public void testTimedOffer() {
354	>	public void testTimedOffer() throws InterruptedException {
355		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
356	<	Thread t = new Thread(new Runnable() {
357	<	public void run() {
358	<	try {
359	<	q.put(new Object());
360	<	q.put(new Object());
361	<	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS));
362	<	q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS);
363	<	threadShouldThrow();
364	<	} catch (InterruptedException success){}
365	<	}
366	<	});
367	<
399	<	try {
400	<	t.start();
401	<	Thread.sleep(SHORT_DELAY_MS);
402	<	t.interrupt();
403	<	t.join();
404	<	} catch (Exception e){
405	<	unexpectedException();
406	<	}
356	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
357	>	public void realRun() throws InterruptedException {
358	>	q.put(new Object());
359	>	q.put(new Object());
360	>	threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, MILLISECONDS));
361	>	q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS);
362	>	}};
363	>
364	>	t.start();
365	>	Thread.sleep(SHORT_DELAY_MS);
366	>	t.interrupt();
367	>	t.join();
368		}
369
370		/**
371		* take retrieves elements in FIFO order
372		*/
373	<	public void testTake() {
374	<	try {
375	<	ArrayBlockingQueue q = populatedQueue(SIZE);
376	<	for (int i = 0; i < SIZE; ++i) {
377	<	assertEquals(i, ((Integer)q.take()).intValue());
417	<	}
418	<	} catch (InterruptedException e){
419	<	unexpectedException();
420	<	}
373	>	public void testTake() throws InterruptedException {
374	>	ArrayBlockingQueue q = populatedQueue(SIZE);
375	>	for (int i = 0; i < SIZE; ++i) {
376	>	assertEquals(i, ((Integer)q.take()).intValue());
377	>	}
378		}
379
380		/**
381		* take blocks interruptibly when empty
382		*/
383	<	public void testTakeFromEmpty() {
383	>	public void testTakeFromEmpty() throws InterruptedException {
384		final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
385	<	Thread t = new Thread(new Runnable() {
386	<	public void run() {
387	<	try {
388	<	q.take();
389	<	threadShouldThrow();
390	<	} catch (InterruptedException success){ }
391	<	}
392	<	});
393	<	try {
437	<	t.start();
438	<	Thread.sleep(SHORT_DELAY_MS);
439	<	t.interrupt();
440	<	t.join();
441	<	} catch (Exception e){
442	<	unexpectedException();
443	<	}
385	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
386	>	public void realRun() throws InterruptedException {
387	>	q.take();
388	>	}};
389	>
390	>	t.start();
391	>	Thread.sleep(SHORT_DELAY_MS);
392	>	t.interrupt();
393	>	t.join();
394		}
395
396		/**
397		* Take removes existing elements until empty, then blocks interruptibly
398		*/
399	<	public void testBlockingTake() {
400	<	Thread t = new Thread(new Runnable() {
401	<	public void run() {
402	<	try {
403	<	ArrayBlockingQueue q = populatedQueue(SIZE);
404	<	for (int i = 0; i < SIZE; ++i) {
405	<	threadAssertEquals(i, ((Integer)q.take()).intValue());
406	<	}
407	<	q.take();
408	<	threadShouldThrow();
409	<	} catch (InterruptedException success){
410	<	}
461	<	}});
462	<	try {
463	<	t.start();
464	<	Thread.sleep(SHORT_DELAY_MS);
399	>	public void testBlockingTake() throws InterruptedException {
400	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
401	>	public void realRun() throws InterruptedException {
402	>	ArrayBlockingQueue q = populatedQueue(SIZE);
403	>	for (int i = 0; i < SIZE; ++i) {
404	>	threadAssertEquals(i, ((Integer)q.take()).intValue());
405	>	}
406	>	q.take();
407	>	}};
408	>
409	>	t.start();
410	>	Thread.sleep(SHORT_DELAY_MS);
411		t.interrupt();
412		t.join();
467	–	}
468	–	catch (InterruptedException ie) {
469	–	unexpectedException();
470	–	}
413		}
414
415
#	Line 479 | Line 421 | public class ArrayBlockingQueueTest exte
421		for (int i = 0; i < SIZE; ++i) {
422		assertEquals(i, ((Integer)q.poll()).intValue());
423		}
424	<	assertNull(q.poll());
424	>	assertNull(q.poll());
425		}
426
427		/**
428		* timed pool with zero timeout succeeds when non-empty, else times out
429		*/
430	<	public void testTimedPoll0() {
431	<	try {
432	<	ArrayBlockingQueue q = populatedQueue(SIZE);
433	<	for (int i = 0; i < SIZE; ++i) {
434	<	assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue());
435	<	}
494	<	assertNull(q.poll(0, TimeUnit.MILLISECONDS));
495	<	} catch (InterruptedException e){
496	<	unexpectedException();
497	<	}
430	>	public void testTimedPoll0() throws InterruptedException {
431	>	ArrayBlockingQueue q = populatedQueue(SIZE);
432	>	for (int i = 0; i < SIZE; ++i) {
433	>	assertEquals(i, ((Integer)q.poll(0, MILLISECONDS)).intValue());
434	>	}
435	>	assertNull(q.poll(0, MILLISECONDS));
436		}
437
438		/**
439		* timed pool with nonzero timeout succeeds when non-empty, else times out
440		*/
441	<	public void testTimedPoll() {
442	<	try {
443	<	ArrayBlockingQueue q = populatedQueue(SIZE);
444	<	for (int i = 0; i < SIZE; ++i) {
445	<	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
446	<	}
509	<	assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
510	<	} catch (InterruptedException e){
511	<	unexpectedException();
512	<	}
441	>	public void testTimedPoll() throws InterruptedException {
442	>	ArrayBlockingQueue q = populatedQueue(SIZE);
443	>	for (int i = 0; i < SIZE; ++i) {
444	>	assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
445	>	}
446	>	assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS));
447		}
448
449		/**
450		* Interrupted timed poll throws InterruptedException instead of
451		* returning timeout status
452		*/
453	<	public void testInterruptedTimedPoll() {
454	<	Thread t = new Thread(new Runnable() {
455	<	public void run() {
456	<	try {
457	<	ArrayBlockingQueue q = populatedQueue(SIZE);
458	<	for (int i = 0; i < SIZE; ++i) {
459	<	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue());
460	<	}
461	<	threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
462	<	} catch (InterruptedException success){
463	<	}
464	<	}});
465	<	try {
466	<	t.start();
533	<	Thread.sleep(SHORT_DELAY_MS);
534	<	t.interrupt();
535	<	t.join();
536	<	}
537	<	catch (InterruptedException ie) {
538	<	unexpectedException();
539	<	}
453	>	public void testInterruptedTimedPoll() throws InterruptedException {
454	>	Thread t = new ThreadShouldThrow(InterruptedException.class) {
455	>	public void realRun() throws InterruptedException {
456	>	ArrayBlockingQueue q = populatedQueue(SIZE);
457	>	for (int i = 0; i < SIZE; ++i) {
458	>	threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue());
459	>	}
460	>	q.poll(MEDIUM_DELAY_MS, MILLISECONDS);
461	>	}};
462	>
463	>	t.start();
464	>	Thread.sleep(SMALL_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);
561	<	assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS));
562	<	t.interrupt();
563	<	t.join();
564	<	} catch (Exception e){
565	<	unexpectedException();
566	<	}
567	<	}
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 578 | 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 593 | Line 513 | public class ArrayBlockingQueueTest exte
513		try {
514		q.element();
515		shouldThrow();
516	<	}
597	<	catch (NoSuchElementException success) {}
516	>	} catch (NoSuchElementException success) {}
517		}
518
519		/**
#	Line 608 | Line 527 | public class ArrayBlockingQueueTest exte
527		try {
528		q.remove();
529		shouldThrow();
530	<	} catch (NoSuchElementException success){
612	<	}
530	>	} catch (NoSuchElementException success) {}
531		}
532
533		/**
#	Line 626 | 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 707 | 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++)
715	<	assertEquals(o[i], q.take());
716	<	} catch (InterruptedException e){
717	<	unexpectedException();
718	<	}
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++)
730	<	assertEquals(ints[i], q.take());
731	<	} catch (InterruptedException e){
732	<	unexpectedException();
733	<	}
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 {
650	>	try {
651		ArrayBlockingQueue q = populatedQueue(SIZE);
652	<	Object o[] = q.toArray(null);
653	<	shouldThrow();
654	<	} catch(NullPointerException success){}
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 {
661	>	try {
662		ArrayBlockingQueue q = populatedQueue(SIZE);
663	<	Object o[] = q.toArray(new String[10] );
664	<	shouldThrow();
665	<	} catch(ArrayStoreException  success){}
663	>	Object o[] = q.toArray(new String[10] );
664	>	shouldThrow();
665	>	} catch (ArrayStoreException  success) {}
666		}
667
668	<
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());
768	<	}
769	<	} catch (InterruptedException e){
770	<	unexpectedException();
771	<	}
674	>	Iterator it = q.iterator();
675	>	while (it.hasNext()) {
676	>	assertEquals(it.next(), q.take());
677	>	}
678		}
679
680		/**
#	Line 783 | 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 817 | 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();
823	<	it.next();
824	<	}
825	<	}
826	<	catch (ConcurrentModificationException e) {
827	<	unexpectedException();
726	>	for (Iterator it = q.iterator(); it.hasNext();) {
727	>	q.remove();
728	>	it.next();
729		}
730		assertEquals(0, q.size());
731		}
#	Line 839 | 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 850 | 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
866	–	executor.execute(new Runnable() {
867	–	public void run() {
868	–	try {
869	–	Thread.sleep(SMALL_DELAY_MS);
870	–	threadAssertEquals(one, q.take());
871	–	}
872	–	catch (InterruptedException e) {
873	–	threadUnexpectedException();
874	–	}
875	–	}
876	–	});
877	–
767		joinPool(executor);
768
769		}
#	Line 885 | 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
901	–	executor.execute(new Runnable() {
902	–	public void run() {
903	–	try {
904	–	Thread.sleep(SMALL_DELAY_MS);
905	–	q.put(one);
906	–	}
907	–	catch (InterruptedException e) {
908	–	threadUnexpectedException();
909	–	}
910	–	}
911	–	});
912	–
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	<	try {
800	<	ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
801	<	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
802	<	out.writeObject(q);
803	<	out.close();
804	<
805	<	ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
806	<	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
807	<	ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject();
808	<	assertEquals(q.size(), r.size());
809	<	while (!q.isEmpty())
933	<	assertEquals(q.remove(), r.remove());
934	<	} catch(Exception e){
935	<	unexpectedException();
936	<	}
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	<	*/
814	>	*/
815		public void testDrainToNull() {
816		ArrayBlockingQueue q = populatedQueue(SIZE);
817		try {
818		q.drainTo(null);
819		shouldThrow();
820	<	} catch(NullPointerException success) {
948	<	}
820	>	} catch (NullPointerException success) {}
821		}
822
823		/**
824		* drainTo(this) throws IAE
825	<	*/
825	>	*/
826		public void testDrainToSelf() {
827		ArrayBlockingQueue q = populatedQueue(SIZE);
828		try {
829		q.drainTo(q);
830		shouldThrow();
831	<	} catch(IllegalArgumentException success) {
960	<	}
831	>	} catch (IllegalArgumentException success) {}
832		}
833
834		/**
835		* drainTo(c) empties queue into another collection c
836	<	*/
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)
843	>	for (int i = 0; i < SIZE; ++i)
844		assertEquals(l.get(i), new Integer(i));
845		q.add(zero);
846		q.add(one);
#	Line 980 | Line 851 | public class ArrayBlockingQueueTest exte
851		q.drainTo(l);
852		assertEquals(q.size(), 0);
853		assertEquals(l.size(), 2);
854	<	for (int i = 0; i < 2; ++i)
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() {
860	>	*/
861	>	public void testDrainToWithActivePut() throws InterruptedException {
862		final ArrayBlockingQueue q = populatedQueue(SIZE);
863	<	Thread t = new Thread(new Runnable() {
864	<	public void run() {
865	<	try {
866	<	q.put(new Integer(SIZE+1));
867	<	} catch (InterruptedException ie){
868	<	threadUnexpectedException();
869	<	}
870	<	}
871	<	});
872	<	try {
873	<	t.start();
874	<	ArrayList l = new ArrayList();
875	<	q.drainTo(l);
1005	<	assertTrue(l.size() >= SIZE);
1006	<	for (int i = 0; i < SIZE; ++i)
1007	<	assertEquals(l.get(i), new Integer(i));
1008	<	t.join();
1009	<	assertTrue(q.size() + l.size() >= SIZE);
1010	<	} catch(Exception e){
1011	<	unexpectedException();
1012	<	}
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	<	*/
880	>	*/
881		public void testDrainToNullN() {
882		ArrayBlockingQueue q = populatedQueue(SIZE);
883		try {
884		q.drainTo(null, 0);
885		shouldThrow();
886	<	} catch(NullPointerException success) {
1024	<	}
886	>	} catch (NullPointerException success) {}
887		}
888
889		/**
890		* drainTo(this, n) throws IAE
891	<	*/
891	>	*/
892		public void testDrainToSelfN() {
893		ArrayBlockingQueue q = populatedQueue(SIZE);
894		try {
895		q.drainTo(q, 0);
896		shouldThrow();
897	<	} catch(IllegalArgumentException success) {
1036	<	}
897	>	} catch (IllegalArgumentException success) {}
898		}
899
900		/**
901		* drainTo(c, n) empties first max {n, size} elements of queue into c
902	<	*/
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++)
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)
913	>	for (int j = 0; j < k; ++j)
914		assertEquals(l.get(j), new Integer(j));
915		while (q.poll() != null) ;
916		}
917		}
918
1058	–
919		}

Diff Legend

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