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.33 by jsr166, Sat Oct 9 19:30:34 2010 UTC vs.
Revision 1.38 by jsr166, Wed Nov 3 07:54:52 2010 UTC

#	Line 393 | Line 393 | public class ArrayBlockingQueueTest exte
393		}
394
395		/**
396	–	* take blocks interruptibly when empty
397	–	*/
398	–	public void testTakeFromEmpty() throws InterruptedException {
399	–	final ArrayBlockingQueue q = new ArrayBlockingQueue(2);
400	–	Thread t = new ThreadShouldThrow(InterruptedException.class) {
401	–	public void realRun() throws InterruptedException {
402	–	q.take();
403	–	}};
404	–
405	–	t.start();
406	–	Thread.sleep(SHORT_DELAY_MS);
407	–	t.interrupt();
408	–	t.join();
409	–	}
410	–
411	–	/**
396		* Take removes existing elements until empty, then blocks interruptibly
397		*/
398		public void testBlockingTake() throws InterruptedException {
#	Line 443 | Line 427 | public class ArrayBlockingQueueTest exte
427		}
428
429		/**
430	<	* timed pool with zero timeout succeeds when non-empty, else times out
430	>	* timed poll with zero timeout succeeds when non-empty, else times out
431		*/
432		public void testTimedPoll0() throws InterruptedException {
433		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 454 | Line 438 | public class ArrayBlockingQueueTest exte
438		}
439
440		/**
441	<	* timed pool with nonzero timeout succeeds when non-empty, else times out
441	>	* timed poll with nonzero timeout succeeds when non-empty, else times out
442		*/
443		public void testTimedPoll() throws InterruptedException {
444		ArrayBlockingQueue q = populatedQueue(SIZE);
#	Line 655 | Line 639 | public class ArrayBlockingQueueTest exte
639		}
640
641		/**
642	<	* toArray with incompatible array type throws CCE
642	>	* toArray(incompatible array type) throws ArrayStoreException
643		*/
644		public void testToArray1_BadArg() {
645		ArrayBlockingQueue q = populatedQueue(SIZE);
646		try {
647	<	Object o[] = q.toArray(new String[10]);
647	>	q.toArray(new String[10]);
648		shouldThrow();
649		} catch (ArrayStoreException success) {}
650		}
#	Line 896 | Line 880 | public class ArrayBlockingQueueTest exte
880		}
881
882		/**
883	<	* drainTo(c, n) empties first max {n, size} elements of queue into c
883	>	* drainTo(c, n) empties first min(n, size) elements of queue into c
884		*/
885		public void testDrainToN() {
886		ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2);
#	Line 905 | Line 889 | public class ArrayBlockingQueueTest exte
889		assertTrue(q.offer(new Integer(j)));
890		ArrayList l = new ArrayList();
891		q.drainTo(l, i);
892	<	int k = (i < SIZE)? i : SIZE;
892	>	int k = (i < SIZE) ? i : SIZE;
893		assertEquals(l.size(), k);
894		assertEquals(q.size(), SIZE-k);
895		for (int j = 0; j < k; ++j)

Diff Legend

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