ViewVC Help

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

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

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

#	Line 122 | Line 122 | public class ConcurrentSkipListSubSetTes
122		public void testSize() {
123		NavigableSet q = populatedSet(SIZE);
124		for (int i = 0; i < SIZE; ++i) {
125	<	assertEquals(SIZE-i, q.size());
125	>	assertEquals(SIZE - i, q.size());
126		q.pollFirst();
127		}
128		for (int i = 0; i < SIZE; ++i) {
#	Line 201 | Line 201 | public class ConcurrentSkipListSubSetTes
201		public void testAddAll3() {
202		NavigableSet q = set0();
203		Integer[] ints = new Integer[SIZE];
204	<	for (int i = 0; i < SIZE-1; ++i)
205	<	ints[i] = new Integer(i+SIZE);
204	>	for (int i = 0; i < SIZE - 1; ++i)
205	>	ints[i] = new Integer(i + SIZE);
206		try {
207		q.addAll(Arrays.asList(ints));
208		shouldThrow();
#	Line 216 | Line 216 | public class ConcurrentSkipListSubSetTes
216		Integer[] empty = new Integer[0];
217		Integer[] ints = new Integer[SIZE];
218		for (int i = 0; i < SIZE; ++i)
219	<	ints[i] = new Integer(SIZE-1- i);
219	>	ints[i] = new Integer(SIZE - 1 - i);
220		NavigableSet q = set0();
221		assertFalse(q.addAll(Arrays.asList(empty)));
222		assertTrue(q.addAll(Arrays.asList(ints)));
#	Line 310 | Line 310 | public class ConcurrentSkipListSubSetTes
310		assertTrue(changed);
311
312		assertTrue(q.containsAll(p));
313	<	assertEquals(SIZE-i, q.size());
313	>	assertEquals(SIZE - i, q.size());
314		p.pollFirst();
315		}
316		}
#	Line 323 | Line 323 | public class ConcurrentSkipListSubSetTes
323		NavigableSet q = populatedSet(SIZE);
324		NavigableSet p = populatedSet(i);
325		assertTrue(q.removeAll(p));
326	<	assertEquals(SIZE-i, q.size());
326	>	assertEquals(SIZE - i, q.size());
327		for (int j = 0; j < i; ++j) {
328		Integer x = (Integer)(p.pollFirst());
329		assertFalse(q.contains(x));
#	Line 618 | Line 618 | public class ConcurrentSkipListSubSetTes
618		public void testDescendingSize() {
619		NavigableSet q = populatedSet(SIZE);
620		for (int i = 0; i < SIZE; ++i) {
621	<	assertEquals(SIZE-i, q.size());
621	>	assertEquals(SIZE - i, q.size());
622		q.pollFirst();
623		}
624		for (int i = 0; i < SIZE; ++i) {
#	Line 697 | Line 697 | public class ConcurrentSkipListSubSetTes
697		public void testDescendingAddAll3() {
698		NavigableSet q = dset0();
699		Integer[] ints = new Integer[SIZE];
700	<	for (int i = 0; i < SIZE-1; ++i)
701	<	ints[i] = new Integer(i+SIZE);
700	>	for (int i = 0; i < SIZE - 1; ++i)
701	>	ints[i] = new Integer(i + SIZE);
702		try {
703		q.addAll(Arrays.asList(ints));
704		shouldThrow();
#	Line 712 | Line 712 | public class ConcurrentSkipListSubSetTes
712		Integer[] empty = new Integer[0];
713		Integer[] ints = new Integer[SIZE];
714		for (int i = 0; i < SIZE; ++i)
715	<	ints[i] = new Integer(SIZE-1- i);
715	>	ints[i] = new Integer(SIZE - 1 - i);
716		NavigableSet q = dset0();
717		assertFalse(q.addAll(Arrays.asList(empty)));
718		assertTrue(q.addAll(Arrays.asList(ints)));
#	Line 800 | Line 800 | public class ConcurrentSkipListSubSetTes
800		assertTrue(changed);
801
802		assertTrue(q.containsAll(p));
803	<	assertEquals(SIZE-i, q.size());
803	>	assertEquals(SIZE - i, q.size());
804		p.pollFirst();
805		}
806		}
#	Line 813 | Line 813 | public class ConcurrentSkipListSubSetTes
813		NavigableSet q = populatedSet(SIZE);
814		NavigableSet p = populatedSet(i);
815		assertTrue(q.removeAll(p));
816	<	assertEquals(SIZE-i, q.size());
816	>	assertEquals(SIZE - i, q.size());
817		for (int j = 0; j < i; ++j) {
818		Integer x = (Integer)(p.pollFirst());
819		assertFalse(q.contains(x));

Diff Legend

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