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.35 by jsr166, Fri May 15 18:21:19 2015 UTC vs.
Revision 1.36 by jsr166, Sat May 23 00:53:08 2015 UTC

#	Line 71 | Line 71 | public class ArrayDequeTest extends JSR1
71		*/
72		public void testConstructor5() {
73		Integer[] ints = new Integer[SIZE];
74	<	for (int i = 0; i < SIZE-1; ++i)
74	>	for (int i = 0; i < SIZE - 1; ++i)
75		ints[i] = new Integer(i);
76		try {
77		new ArrayDeque(Arrays.asList(ints));
#	Line 111 | Line 111 | public class ArrayDequeTest extends JSR1
111		public void testSize() {
112		ArrayDeque q = populatedDeque(SIZE);
113		for (int i = 0; i < SIZE; ++i) {
114	<	assertEquals(SIZE-i, q.size());
114	>	assertEquals(SIZE - i, q.size());
115		q.removeFirst();
116		}
117		for (int i = 0; i < SIZE; ++i) {
#	Line 316 | Line 316 | public class ArrayDequeTest extends JSR1
316		public void testAddAll3() {
317		ArrayDeque q = new ArrayDeque();
318		Integer[] ints = new Integer[SIZE];
319	<	for (int i = 0; i < SIZE-1; ++i)
319	>	for (int i = 0; i < SIZE - 1; ++i)
320		ints[i] = new Integer(i);
321		try {
322		q.addAll(Arrays.asList(ints));
#	Line 355 | Line 355 | public class ArrayDequeTest extends JSR1
355		*/
356		public void testPollLast() {
357		ArrayDeque q = populatedDeque(SIZE);
358	<	for (int i = SIZE-1; i >= 0; --i) {
358	>	for (int i = SIZE - 1; i >= 0; --i) {
359		assertEquals(i, q.pollLast());
360		}
361		assertNull(q.pollLast());
#	Line 440 | Line 440 | public class ArrayDequeTest extends JSR1
440		*/
441		public void testPeekLast() {
442		ArrayDeque q = populatedDeque(SIZE);
443	<	for (int i = SIZE-1; i >= 0; --i) {
443	>	for (int i = SIZE - 1; i >= 0; --i) {
444		assertEquals(i, q.peekLast());
445		assertEquals(i, q.pollLast());
446		assertTrue(q.peekLast() == null ||
#	Line 484 | Line 484 | public class ArrayDequeTest extends JSR1
484		*/
485		public void testLastElement() {
486		ArrayDeque q = populatedDeque(SIZE);
487	<	for (int i = SIZE-1; i >= 0; --i) {
487	>	for (int i = SIZE - 1; i >= 0; --i) {
488		assertEquals(i, q.getLast());
489		assertEquals(i, q.pollLast());
490		}
#	Line 605 | Line 605 | public class ArrayDequeTest extends JSR1
605		boolean changed = q.retainAll(p);
606		assertEquals(changed, (i > 0));
607		assertTrue(q.containsAll(p));
608	<	assertEquals(SIZE-i, q.size());
608	>	assertEquals(SIZE - i, q.size());
609		p.removeFirst();
610		}
611		}
#	Line 618 | Line 618 | public class ArrayDequeTest extends JSR1
618		ArrayDeque q = populatedDeque(SIZE);
619		ArrayDeque p = populatedDeque(i);
620		assertTrue(q.removeAll(p));
621	<	assertEquals(SIZE-i, q.size());
621	>	assertEquals(SIZE - i, q.size());
622		for (int j = 0; j < i; ++j) {
623		assertFalse(q.contains(p.removeFirst()));
624		}
#	Line 650 | Line 650 | public class ArrayDequeTest extends JSR1
650		for (int i = 0; i < SIZE; i++) {
651		checkToArray(q);
652		assertEquals(i, q.poll());
653	<	q.addLast(SIZE+i);
653	>	q.addLast(SIZE + i);
654		}
655		for (int i = 0; i < SIZE; i++) {
656		checkToArray(q);
657	<	assertEquals(SIZE+i, q.poll());
657	>	assertEquals(SIZE + i, q.poll());
658		}
659		}
660
#	Line 703 | Line 703 | public class ArrayDequeTest extends JSR1
703		for (int i = 0; i < SIZE; i++) {
704		checkToArray2(q);
705		assertEquals(i, q.poll());
706	<	q.addLast(SIZE+i);
706	>	q.addLast(SIZE + i);
707		}
708		for (int i = 0; i < SIZE; i++) {
709		checkToArray2(q);
710	<	assertEquals(SIZE+i, q.poll());
710	>	assertEquals(SIZE + i, q.poll());
711		}
712		}
713

Diff Legend

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