4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
– |
import junit.framework.*; |
7 |
|
import java.util.Arrays; |
8 |
|
import java.util.Comparator; |
9 |
|
import java.util.Iterator; |
10 |
|
import java.util.NavigableSet; |
12 |
– |
import java.util.SortedSet; |
11 |
|
import java.util.Set; |
12 |
+ |
import java.util.SortedSet; |
13 |
|
import java.util.TreeSet; |
14 |
|
|
15 |
+ |
import junit.framework.Test; |
16 |
+ |
import junit.framework.TestSuite; |
17 |
+ |
|
18 |
|
public class TreeSubSetTest extends JSR166TestCase { |
19 |
|
public static void main(String[] args) { |
20 |
|
junit.textui.TestRunner.run(suite()); |
37 |
|
TreeSet<Integer> q = new TreeSet<Integer>(); |
38 |
|
assertTrue(q.isEmpty()); |
39 |
|
|
40 |
< |
for (int i = n-1; i >= 0; i-=2) |
40 |
> |
for (int i = n-1; i >= 0; i -= 2) |
41 |
|
assertTrue(q.add(new Integer(i))); |
42 |
< |
for (int i = (n & 1); i < n; i+=2) |
42 |
> |
for (int i = (n & 1); i < n; i += 2) |
43 |
|
assertTrue(q.add(new Integer(i))); |
44 |
|
assertTrue(q.add(new Integer(-n))); |
45 |
|
assertTrue(q.add(new Integer(n))); |
132 |
|
* add(null) throws NPE |
133 |
|
*/ |
134 |
|
public void testAddNull() { |
135 |
+ |
NavigableSet q = set0(); |
136 |
|
try { |
134 |
– |
NavigableSet q = set0(); |
137 |
|
q.add(null); |
138 |
|
shouldThrow(); |
139 |
|
} catch (NullPointerException success) {} |
160 |
|
* Add of non-Comparable throws CCE |
161 |
|
*/ |
162 |
|
public void testAddNonComparable() { |
163 |
+ |
NavigableSet q = set0(); |
164 |
|
try { |
162 |
– |
NavigableSet q = set0(); |
163 |
– |
q.add(new Object()); |
165 |
|
q.add(new Object()); |
166 |
|
q.add(new Object()); |
167 |
|
shouldThrow(); |
172 |
|
* addAll(null) throws NPE |
173 |
|
*/ |
174 |
|
public void testAddAll1() { |
175 |
+ |
NavigableSet q = set0(); |
176 |
|
try { |
175 |
– |
NavigableSet q = set0(); |
177 |
|
q.addAll(null); |
178 |
|
shouldThrow(); |
179 |
|
} catch (NullPointerException success) {} |
183 |
|
* addAll of a collection with null elements throws NPE |
184 |
|
*/ |
185 |
|
public void testAddAll2() { |
186 |
+ |
NavigableSet q = set0(); |
187 |
+ |
Integer[] ints = new Integer[SIZE]; |
188 |
|
try { |
186 |
– |
NavigableSet q = set0(); |
187 |
– |
Integer[] ints = new Integer[SIZE]; |
189 |
|
q.addAll(Arrays.asList(ints)); |
190 |
|
shouldThrow(); |
191 |
|
} catch (NullPointerException success) {} |
196 |
|
* possibly adding some elements |
197 |
|
*/ |
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); |
203 |
|
try { |
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); |
204 |
|
q.addAll(Arrays.asList(ints)); |
205 |
|
shouldThrow(); |
206 |
|
} catch (NullPointerException success) {} |
237 |
|
*/ |
238 |
|
public void testRemoveElement() { |
239 |
|
NavigableSet q = populatedSet(SIZE); |
240 |
< |
for (int i = 1; i < SIZE; i+=2) { |
240 |
> |
for (int i = 1; i < SIZE; i += 2) { |
241 |
|
assertTrue(q.contains(i)); |
242 |
|
assertTrue(q.remove(i)); |
243 |
|
assertFalse(q.contains(i)); |
244 |
|
assertTrue(q.contains(i-1)); |
245 |
|
} |
246 |
< |
for (int i = 0; i < SIZE; i+=2) { |
246 |
> |
for (int i = 0; i < SIZE; i += 2) { |
247 |
|
assertTrue(q.contains(i)); |
248 |
|
assertTrue(q.remove(i)); |
249 |
|
assertFalse(q.contains(i)); |
322 |
|
assertTrue(q.removeAll(p)); |
323 |
|
assertEquals(SIZE-i, q.size()); |
324 |
|
for (int j = 0; j < i; ++j) { |
325 |
< |
Integer I = (Integer)(p.pollFirst()); |
326 |
< |
assertFalse(q.contains(I)); |
325 |
> |
Integer x = (Integer)(p.pollFirst()); |
326 |
> |
assertFalse(q.contains(x)); |
327 |
|
} |
328 |
|
} |
329 |
|
} |
427 |
|
*/ |
428 |
|
public void testIterator() { |
429 |
|
NavigableSet q = populatedSet(SIZE); |
429 |
– |
int i = 0; |
430 |
|
Iterator it = q.iterator(); |
431 |
< |
while (it.hasNext()) { |
431 |
> |
int i; |
432 |
> |
for (i = 0; it.hasNext(); i++) |
433 |
|
assertTrue(q.contains(it.next())); |
433 |
– |
++i; |
434 |
– |
} |
434 |
|
assertEquals(i, SIZE); |
435 |
+ |
assertIteratorExhausted(it); |
436 |
|
} |
437 |
|
|
438 |
|
/** |
439 |
|
* iterator of empty set has no elements |
440 |
|
*/ |
441 |
|
public void testEmptyIterator() { |
442 |
< |
NavigableSet q = set0(); |
443 |
< |
int i = 0; |
444 |
< |
Iterator it = q.iterator(); |
445 |
< |
while (it.hasNext()) { |
446 |
< |
assertTrue(q.contains(it.next())); |
447 |
< |
++i; |
448 |
< |
} |
449 |
< |
assertEquals(0, i); |
442 |
> |
assertIteratorExhausted(set0().iterator()); |
443 |
|
} |
444 |
|
|
445 |
|
/** |
479 |
|
NavigableSet x = populatedSet(SIZE); |
480 |
|
NavigableSet y = serialClone(x); |
481 |
|
|
482 |
< |
assertTrue(x != y); |
482 |
> |
assertNotSame(x, y); |
483 |
|
assertEquals(x.size(), y.size()); |
484 |
|
assertEquals(x, y); |
485 |
|
assertEquals(y, x); |
645 |
|
* Add of non-Comparable throws CCE |
646 |
|
*/ |
647 |
|
public void testDescendingAddNonComparable() { |
648 |
+ |
NavigableSet q = dset0(); |
649 |
|
try { |
656 |
– |
NavigableSet q = dset0(); |
657 |
– |
q.add(new Object()); |
650 |
|
q.add(new Object()); |
651 |
|
q.add(new Object()); |
652 |
|
shouldThrow(); |
657 |
|
* addAll(null) throws NPE |
658 |
|
*/ |
659 |
|
public void testDescendingAddAll1() { |
660 |
+ |
NavigableSet q = dset0(); |
661 |
|
try { |
669 |
– |
NavigableSet q = dset0(); |
662 |
|
q.addAll(null); |
663 |
|
shouldThrow(); |
664 |
|
} catch (NullPointerException success) {} |
668 |
|
* addAll of a collection with null elements throws NPE |
669 |
|
*/ |
670 |
|
public void testDescendingAddAll2() { |
671 |
+ |
NavigableSet q = dset0(); |
672 |
+ |
Integer[] ints = new Integer[SIZE]; |
673 |
|
try { |
680 |
– |
NavigableSet q = dset0(); |
681 |
– |
Integer[] ints = new Integer[SIZE]; |
674 |
|
q.addAll(Arrays.asList(ints)); |
675 |
|
shouldThrow(); |
676 |
|
} catch (NullPointerException success) {} |
681 |
|
* possibly adding some elements |
682 |
|
*/ |
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); |
688 |
|
try { |
693 |
– |
NavigableSet q = dset0(); |
694 |
– |
Integer[] ints = new Integer[SIZE]; |
695 |
– |
for (int i = 0; i < SIZE-1; ++i) |
696 |
– |
ints[i] = new Integer(i+SIZE); |
689 |
|
q.addAll(Arrays.asList(ints)); |
690 |
|
shouldThrow(); |
691 |
|
} catch (NullPointerException success) {} |
722 |
|
*/ |
723 |
|
public void testDescendingRemoveElement() { |
724 |
|
NavigableSet q = populatedSet(SIZE); |
725 |
< |
for (int i = 1; i < SIZE; i+=2) { |
725 |
> |
for (int i = 1; i < SIZE; i += 2) { |
726 |
|
assertTrue(q.remove(new Integer(i))); |
727 |
|
} |
728 |
< |
for (int i = 0; i < SIZE; i+=2) { |
728 |
> |
for (int i = 0; i < SIZE; i += 2) { |
729 |
|
assertTrue(q.remove(new Integer(i))); |
730 |
|
assertFalse(q.remove(new Integer(i+1))); |
731 |
|
} |
801 |
|
assertTrue(q.removeAll(p)); |
802 |
|
assertEquals(SIZE-i, q.size()); |
803 |
|
for (int j = 0; j < i; ++j) { |
804 |
< |
Integer I = (Integer)(p.pollFirst()); |
805 |
< |
assertFalse(q.contains(I)); |
804 |
> |
Integer x = (Integer)(p.pollFirst()); |
805 |
> |
assertFalse(q.contains(x)); |
806 |
|
} |
807 |
|
} |
808 |
|
} |
967 |
|
NavigableSet x = dset5(); |
968 |
|
NavigableSet y = serialClone(x); |
969 |
|
|
970 |
< |
assertTrue(x != y); |
970 |
> |
assertNotSame(x, y); |
971 |
|
assertEquals(x.size(), y.size()); |
972 |
|
assertEquals(x.toString(), y.toString()); |
973 |
|
assertEquals(x, y); |