32 |
|
* Create a set of given size containing consecutive |
33 |
|
* Integers 0 ... n. |
34 |
|
*/ |
35 |
< |
private TreeSet populatedSet(int n) { |
36 |
< |
TreeSet q = new TreeSet(); |
35 |
> |
private TreeSet<Integer> populatedSet(int n) { |
36 |
> |
TreeSet<Integer> q = new TreeSet<Integer>(); |
37 |
|
assertTrue(q.isEmpty()); |
38 |
|
for (int i = n-1; i >= 0; i-=2) |
39 |
|
assertTrue(q.add(new Integer(i))); |
280 |
|
public void testRemoveElement() { |
281 |
|
TreeSet q = populatedSet(SIZE); |
282 |
|
for (int i = 1; i < SIZE; i+=2) { |
283 |
< |
assertTrue(q.remove(new Integer(i))); |
283 |
> |
assertTrue(q.contains(i)); |
284 |
> |
assertTrue(q.remove(i)); |
285 |
> |
assertFalse(q.contains(i)); |
286 |
> |
assertTrue(q.contains(i-1)); |
287 |
|
} |
288 |
|
for (int i = 0; i < SIZE; i+=2) { |
289 |
< |
assertTrue(q.remove(new Integer(i))); |
290 |
< |
assertFalse(q.remove(new Integer(i+1))); |
289 |
> |
assertTrue(q.contains(i)); |
290 |
> |
assertTrue(q.remove(i)); |
291 |
> |
assertFalse(q.contains(i)); |
292 |
> |
assertFalse(q.remove(i+1)); |
293 |
> |
assertFalse(q.contains(i+1)); |
294 |
|
} |
295 |
|
assertTrue(q.isEmpty()); |
296 |
|
} |
445 |
|
} |
446 |
|
|
447 |
|
/** |
448 |
< |
* toArray contains all elements |
448 |
> |
* toArray contains all elements in sorted order |
449 |
|
*/ |
450 |
|
public void testToArray() { |
451 |
|
TreeSet q = populatedSet(SIZE); |
452 |
|
Object[] o = q.toArray(); |
447 |
– |
Arrays.sort(o); |
453 |
|
for (int i = 0; i < o.length; i++) |
454 |
< |
assertEquals(o[i], q.pollFirst()); |
454 |
> |
assertSame(o[i], q.pollFirst()); |
455 |
|
} |
456 |
|
|
457 |
|
/** |
458 |
< |
* toArray(a) contains all elements |
458 |
> |
* toArray(a) contains all elements in sorted order |
459 |
|
*/ |
460 |
|
public void testToArray2() { |
461 |
< |
TreeSet q = populatedSet(SIZE); |
461 |
> |
TreeSet<Integer> q = populatedSet(SIZE); |
462 |
|
Integer[] ints = new Integer[SIZE]; |
463 |
< |
ints = (Integer[])q.toArray(ints); |
464 |
< |
Arrays.sort(ints); |
463 |
> |
Integer[] array = q.toArray(ints); |
464 |
> |
assertSame(ints, array); |
465 |
|
for (int i = 0; i < ints.length; i++) |
466 |
< |
assertEquals(ints[i], q.pollFirst()); |
466 |
> |
assertSame(ints[i], q.pollFirst()); |
467 |
|
} |
468 |
|
|
469 |
|
/** |
669 |
|
* Subsets of subsets subdivide correctly |
670 |
|
*/ |
671 |
|
public void testRecursiveSubSets() throws Exception { |
672 |
< |
int setSize = 1000; |
672 |
> |
int setSize = expensiveTests ? 1000 : 100; |
673 |
|
Class cl = TreeSet.class; |
674 |
|
|
675 |
|
NavigableSet<Integer> set = newSet(cl); |
885 |
|
// BitSet should support this! Test would run much faster |
886 |
|
while (element >= min) { |
887 |
|
if (bs.get(element)) |
888 |
< |
return(element); |
888 |
> |
return element; |
889 |
|
element--; |
890 |
|
} |
891 |
|
return -1; |