ViewVC Help

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

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

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

#	Line 26 | Line 26 | public class ArrayDequeTest extends JSR1
26		* Create a deque of given size containing consecutive
27		* Integers 0 ... n.
28		*/
29	<	private ArrayDeque populatedDeque(int n) {
30	<	ArrayDeque q = new ArrayDeque();
29	>	private ArrayDeque<Integer> populatedDeque(int n) {
30	>	ArrayDeque<Integer> q = new ArrayDeque<Integer>();
31		assertTrue(q.isEmpty());
32		for (int i = 0; i < n; ++i)
33		assertTrue(q.offerLast(new Integer(i)));
#	Line 633 | Line 633 | public class ArrayDequeTest extends JSR1
633		* toArray(a) contains all elements in FIFO order
634		*/
635		public void testToArray2() {
636	<	ArrayDeque q = populatedDeque(SIZE);
636	>	ArrayDeque<Integer> q = populatedDeque(SIZE);
637		Integer[] ints = new Integer[SIZE];
638	<	assertSame(ints, q.toArray(ints));
638	>	Integer[] array = q.toArray(ints);
639	>	assertSame(ints, array);
640		for (int i = 0; i < ints.length; i++)
641		assertSame(ints[i], q.remove());
642		}

Diff Legend

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