ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/LinkedBlockingQueueTest.java

Comparing jsr166/src/test/tck/LinkedBlockingQueueTest.java (file contents):
Revision 1.36 by jsr166, Thu Nov 4 01:04:54 2010 UTC vs.
Revision 1.38 by jsr166, Thu Nov 18 20:21:53 2010 UTC

#	Line 41 | Line 41 | public class LinkedBlockingQueueTest ext
41		* Create a queue of given size containing consecutive
42		* Integers 0 ... n.
43		*/
44	<	private LinkedBlockingQueue populatedQueue(int n) {
45	<	LinkedBlockingQueue q = new LinkedBlockingQueue(n);
44	>	private LinkedBlockingQueue<Integer> populatedQueue(int n) {
45	>	LinkedBlockingQueue<Integer> q =
46	>	new LinkedBlockingQueue<Integer>(n);
47		assertTrue(q.isEmpty());
48		for (int i = 0; i < n; i++)
49		assertTrue(q.offer(new Integer(i)));
#	Line 507 | Line 508 | public class LinkedBlockingQueueTest ext
508		public void testRemoveElement() {
509		LinkedBlockingQueue q = populatedQueue(SIZE);
510		for (int i = 1; i < SIZE; i+=2) {
511	<	assertTrue(q.remove(new Integer(i)));
511	>	assertTrue(q.contains(i));
512	>	assertTrue(q.remove(i));
513	>	assertFalse(q.contains(i));
514	>	assertTrue(q.contains(i-1));
515		}
516		for (int i = 0; i < SIZE; i+=2) {
517	<	assertTrue(q.remove(new Integer(i)));
518	<	assertFalse(q.remove(new Integer(i+1)));
517	>	assertTrue(q.contains(i));
518	>	assertTrue(q.remove(i));
519	>	assertFalse(q.contains(i));
520	>	assertFalse(q.remove(i+1));
521	>	assertFalse(q.contains(i+1));
522		}
523		assertTrue(q.isEmpty());
524		}
#	Line 620 | Line 627 | public class LinkedBlockingQueueTest ext
627		* toArray(a) contains all elements in FIFO order
628		*/
629		public void testToArray2() throws InterruptedException {
630	<	LinkedBlockingQueue q = populatedQueue(SIZE);
630	>	LinkedBlockingQueue<Integer> q = populatedQueue(SIZE);
631		Integer[] ints = new Integer[SIZE];
632	<	assertSame(ints, q.toArray(ints));
632	>	Integer[] array = q.toArray(ints);
633	>	assertSame(ints, array);
634		for (int i = 0; i < ints.length; i++)
635		assertSame(ints[i], q.poll());
636		}

Diff Legend

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