ViewVC Help

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

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

Comparing jsr166/src/test/tck/ConcurrentLinkedDequeTest.java (file contents):
Revision 1.4 by jsr166, Thu Nov 4 01:04:54 2010 UTC vs.
Revision 1.5 by jsr166, Fri Nov 5 00:17:22 2010 UTC

#	Line 25 | Line 25 | public class ConcurrentLinkedDequeTest e
25		* Create a deque of given size containing consecutive
26		* Integers 0 ... n.
27		*/
28	<	private ConcurrentLinkedDeque populatedDeque(int n) {
29	<	ConcurrentLinkedDeque q = new ConcurrentLinkedDeque();
28	>	private ConcurrentLinkedDeque<Integer> populatedDeque(int n) {
29	>	ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<Integer>();
30		assertTrue(q.isEmpty());
31		for (int i = 0; i < n; ++i)
32		assertTrue(q.offer(new Integer(i)));
#	Line 648 | Line 648 | public class ConcurrentLinkedDequeTest e
648		* toArray(a) contains all elements in FIFO order
649		*/
650		public void testToArray2() {
651	<	ConcurrentLinkedDeque q = populatedDeque(SIZE);
651	>	ConcurrentLinkedDeque<Integer> q = populatedDeque(SIZE);
652		Integer[] ints = new Integer[SIZE];
653	<	assertSame(ints, q.toArray(ints));
653	>	Integer[] array = q.toArray(ints);
654	>	assertSame(ints, array);
655		for (int i = 0; i < ints.length; i++)
656		assertSame(ints[i], q.poll());
657		}

Diff Legend

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