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 |
|
} |
428 |
|
*/ |
429 |
|
public void testIterator() { |
430 |
|
NavigableSet q = populatedSet(SIZE); |
429 |
– |
int i = 0; |
431 |
|
Iterator it = q.iterator(); |
432 |
< |
while (it.hasNext()) { |
432 |
> |
int i; |
433 |
> |
for (i = 0; it.hasNext(); i++) |
434 |
|
assertTrue(q.contains(it.next())); |
433 |
– |
++i; |
434 |
– |
} |
435 |
|
assertEquals(i, SIZE); |
436 |
+ |
assertIteratorExhausted(it); |
437 |
|
} |
438 |
|
|
439 |
|
/** |
440 |
|
* iterator of empty set has no elements |
441 |
|
*/ |
442 |
|
public void testEmptyIterator() { |
443 |
< |
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); |
443 |
> |
assertIteratorExhausted(set0().iterator()); |
444 |
|
} |
445 |
|
|
446 |
|
/** |
724 |
|
*/ |
725 |
|
public void testDescendingRemoveElement() { |
726 |
|
NavigableSet q = populatedSet(SIZE); |
727 |
< |
for (int i = 1; i < SIZE; i+=2) { |
727 |
> |
for (int i = 1; i < SIZE; i += 2) { |
728 |
|
assertTrue(q.remove(new Integer(i))); |
729 |
|
} |
730 |
< |
for (int i = 0; i < SIZE; i+=2) { |
730 |
> |
for (int i = 0; i < SIZE; i += 2) { |
731 |
|
assertTrue(q.remove(new Integer(i))); |
732 |
|
assertFalse(q.remove(new Integer(i+1))); |
733 |
|
} |
803 |
|
assertTrue(q.removeAll(p)); |
804 |
|
assertEquals(SIZE-i, q.size()); |
805 |
|
for (int j = 0; j < i; ++j) { |
806 |
< |
Integer I = (Integer)(p.pollFirst()); |
807 |
< |
assertFalse(q.contains(I)); |
806 |
> |
Integer x = (Integer)(p.pollFirst()); |
807 |
> |
assertFalse(q.contains(x)); |
808 |
|
} |
809 |
|
} |
810 |
|
} |