ViewVC Help

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

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

Comparing jsr166/src/test/tck/TreeSubSetTest.java (file contents):
Revision 1.31 by jsr166, Sat Apr 25 04:55:31 2015 UTC vs.
Revision 1.32 by jsr166, Sat May 23 00:53:08 2015 UTC

#	Line 119 | Line 119 | public class TreeSubSetTest extends JSR1
119		public void testSize() {
120		NavigableSet q = populatedSet(SIZE);
121		for (int i = 0; i < SIZE; ++i) {
122	<	assertEquals(SIZE-i, q.size());
122	>	assertEquals(SIZE - i, q.size());
123		q.pollFirst();
124		}
125		for (int i = 0; i < SIZE; ++i) {
#	Line 198 | Line 198 | public class TreeSubSetTest extends JSR1
198		public void testAddAll3() {
199		NavigableSet q = set0();
200		Integer[] ints = new Integer[SIZE];
201	<	for (int i = 0; i < SIZE-1; ++i)
202	<	ints[i] = new Integer(i+SIZE);
201	>	for (int i = 0; i < SIZE - 1; ++i)
202	>	ints[i] = new Integer(i + SIZE);
203		try {
204		q.addAll(Arrays.asList(ints));
205		shouldThrow();
#	Line 213 | Line 213 | public class TreeSubSetTest extends JSR1
213		Integer[] empty = new Integer[0];
214		Integer[] ints = new Integer[SIZE];
215		for (int i = 0; i < SIZE; ++i)
216	<	ints[i] = new Integer(SIZE-1- i);
216	>	ints[i] = new Integer(SIZE - 1 - i);
217		NavigableSet q = set0();
218		assertFalse(q.addAll(Arrays.asList(empty)));
219		assertTrue(q.addAll(Arrays.asList(ints)));
#	Line 307 | Line 307 | public class TreeSubSetTest extends JSR1
307		assertTrue(changed);
308
309		assertTrue(q.containsAll(p));
310	<	assertEquals(SIZE-i, q.size());
310	>	assertEquals(SIZE - i, q.size());
311		p.pollFirst();
312		}
313		}
#	Line 320 | Line 320 | public class TreeSubSetTest extends JSR1
320		NavigableSet q = populatedSet(SIZE);
321		NavigableSet p = populatedSet(i);
322		assertTrue(q.removeAll(p));
323	<	assertEquals(SIZE-i, q.size());
323	>	assertEquals(SIZE - i, q.size());
324		for (int j = 0; j < i; ++j) {
325		Integer x = (Integer)(p.pollFirst());
326		assertFalse(q.contains(x));
#	Line 615 | Line 615 | public class TreeSubSetTest extends JSR1
615		public void testDescendingSize() {
616		NavigableSet q = populatedSet(SIZE);
617		for (int i = 0; i < SIZE; ++i) {
618	<	assertEquals(SIZE-i, q.size());
618	>	assertEquals(SIZE - i, q.size());
619		q.pollFirst();
620		}
621		for (int i = 0; i < SIZE; ++i) {
#	Line 683 | Line 683 | public class TreeSubSetTest extends JSR1
683		public void testDescendingAddAll3() {
684		NavigableSet q = dset0();
685		Integer[] ints = new Integer[SIZE];
686	<	for (int i = 0; i < SIZE-1; ++i)
687	<	ints[i] = new Integer(i+SIZE);
686	>	for (int i = 0; i < SIZE - 1; ++i)
687	>	ints[i] = new Integer(i + SIZE);
688		try {
689		q.addAll(Arrays.asList(ints));
690		shouldThrow();
#	Line 698 | Line 698 | public class TreeSubSetTest extends JSR1
698		Integer[] empty = new Integer[0];
699		Integer[] ints = new Integer[SIZE];
700		for (int i = 0; i < SIZE; ++i)
701	<	ints[i] = new Integer(SIZE-1- i);
701	>	ints[i] = new Integer(SIZE - 1 - i);
702		NavigableSet q = dset0();
703		assertFalse(q.addAll(Arrays.asList(empty)));
704		assertTrue(q.addAll(Arrays.asList(ints)));
#	Line 786 | Line 786 | public class TreeSubSetTest extends JSR1
786		assertTrue(changed);
787
788		assertTrue(q.containsAll(p));
789	<	assertEquals(SIZE-i, q.size());
789	>	assertEquals(SIZE - i, q.size());
790		p.pollFirst();
791		}
792		}
#	Line 799 | Line 799 | public class TreeSubSetTest extends JSR1
799		NavigableSet q = populatedSet(SIZE);
800		NavigableSet p = populatedSet(i);
801		assertTrue(q.removeAll(p));
802	<	assertEquals(SIZE-i, q.size());
802	>	assertEquals(SIZE - i, q.size());
803		for (int j = 0; j < i; ++j) {
804		Integer x = (Integer)(p.pollFirst());
805		assertFalse(q.contains(x));

Diff Legend

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