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))); |
238 |
|
*/ |
239 |
|
public void testRemoveElement() { |
240 |
|
NavigableSet q = populatedSet(SIZE); |
241 |
< |
for (int i = 1; i < SIZE; i+=2) { |
241 |
> |
for (int i = 1; i < SIZE; i += 2) { |
242 |
|
assertTrue(q.contains(i)); |
243 |
|
assertTrue(q.remove(i)); |
244 |
|
assertFalse(q.contains(i)); |
245 |
|
assertTrue(q.contains(i-1)); |
246 |
|
} |
247 |
< |
for (int i = 0; i < SIZE; i+=2) { |
247 |
> |
for (int i = 0; i < SIZE; i += 2) { |
248 |
|
assertTrue(q.contains(i)); |
249 |
|
assertTrue(q.remove(i)); |
250 |
|
assertFalse(q.contains(i)); |
323 |
|
assertTrue(q.removeAll(p)); |
324 |
|
assertEquals(SIZE-i, q.size()); |
325 |
|
for (int j = 0; j < i; ++j) { |
326 |
< |
Integer I = (Integer)(p.pollFirst()); |
327 |
< |
assertFalse(q.contains(I)); |
326 |
> |
Integer x = (Integer)(p.pollFirst()); |
327 |
> |
assertFalse(q.contains(x)); |
328 |
|
} |
329 |
|
} |
330 |
|
} |
488 |
|
NavigableSet x = populatedSet(SIZE); |
489 |
|
NavigableSet y = serialClone(x); |
490 |
|
|
491 |
< |
assertTrue(x != y); |
491 |
> |
assertNotSame(x, y); |
492 |
|
assertEquals(x.size(), y.size()); |
493 |
|
assertEquals(x, y); |
494 |
|
assertEquals(y, x); |
732 |
|
*/ |
733 |
|
public void testDescendingRemoveElement() { |
734 |
|
NavigableSet q = populatedSet(SIZE); |
735 |
< |
for (int i = 1; i < SIZE; i+=2) { |
735 |
> |
for (int i = 1; i < SIZE; i += 2) { |
736 |
|
assertTrue(q.remove(new Integer(i))); |
737 |
|
} |
738 |
< |
for (int i = 0; i < SIZE; i+=2) { |
738 |
> |
for (int i = 0; i < SIZE; i += 2) { |
739 |
|
assertTrue(q.remove(new Integer(i))); |
740 |
|
assertFalse(q.remove(new Integer(i+1))); |
741 |
|
} |
811 |
|
assertTrue(q.removeAll(p)); |
812 |
|
assertEquals(SIZE-i, q.size()); |
813 |
|
for (int j = 0; j < i; ++j) { |
814 |
< |
Integer I = (Integer)(p.pollFirst()); |
815 |
< |
assertFalse(q.contains(I)); |
814 |
> |
Integer x = (Integer)(p.pollFirst()); |
815 |
> |
assertFalse(q.contains(x)); |
816 |
|
} |
817 |
|
} |
818 |
|
} |
977 |
|
NavigableSet x = dset5(); |
978 |
|
NavigableSet y = serialClone(x); |
979 |
|
|
980 |
< |
assertTrue(x != y); |
980 |
> |
assertNotSame(x, y); |
981 |
|
assertEquals(x.size(), y.size()); |
982 |
|
assertEquals(x.toString(), y.toString()); |
983 |
|
assertEquals(x, y); |