ViewVC Help

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

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

Comparing jsr166/src/test/tck/PriorityBlockingQueueTest.java (file contents):
Revision 1.48 by jsr166, Sat Nov 26 05:19:17 2011 UTC vs.
Revision 1.52 by jsr166, Thu May 30 03:28:55 2013 UTC

#	Line 55 | Line 55 | public class PriorityBlockingQueueTest e
55		}
56
57		/**
58	<	* Create a queue of given size containing consecutive
58	>	* Returns a new queue of given size containing consecutive
59		* Integers 0 ... n.
60		*/
61		private PriorityBlockingQueue<Integer> populatedQueue(int n) {
#	Line 644 | Line 644 | public class PriorityBlockingQueueTest e
644		Queue x = populatedQueue(SIZE);
645		Queue y = serialClone(x);
646
647	<	assertTrue(x != y);
647	>	assertNotSame(x, y);
648		assertEquals(x.size(), y.size());
649		while (!x.isEmpty()) {
650		assertFalse(y.isEmpty());
#	Line 708 | Line 708 | public class PriorityBlockingQueueTest e
708		ArrayList l = new ArrayList();
709		q.drainTo(l, i);
710		int k = (i < SIZE) ? i : SIZE;
711	<	assertEquals(l.size(), k);
712	<	assertEquals(q.size(), SIZE-k);
711	>	assertEquals(k, l.size());
712	>	assertEquals(SIZE-k, q.size());
713		for (int j = 0; j < k; ++j)
714		assertEquals(l.get(j), new Integer(j));
715		while (q.poll() != null) ;

Diff Legend

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