11 |
|
|
12 |
|
public class TreeSetTest extends JSR166TestCase { |
13 |
|
public static void main(String[] args) { |
14 |
< |
junit.textui.TestRunner.run (suite()); |
14 |
> |
junit.textui.TestRunner.run(suite()); |
15 |
|
} |
16 |
|
public static Test suite() { |
17 |
|
return new TestSuite(TreeSetTest.class); |
208 |
|
shouldThrow(); |
209 |
|
} catch (NullPointerException success) {} |
210 |
|
} |
211 |
+ |
|
212 |
|
/** |
213 |
|
* addAll of a collection with null elements throws NPE |
214 |
|
*/ |
220 |
|
shouldThrow(); |
221 |
|
} catch (NullPointerException success) {} |
222 |
|
} |
223 |
+ |
|
224 |
|
/** |
225 |
|
* addAll of a collection with any null elements throws NPE after |
226 |
|
* possibly adding some elements |
382 |
|
|
383 |
|
Object e4 = q.lower(zero); |
384 |
|
assertNull(e4); |
383 |
– |
|
385 |
|
} |
386 |
|
|
387 |
|
/** |
400 |
|
|
401 |
|
Object e4 = q.higher(six); |
402 |
|
assertNull(e4); |
402 |
– |
|
403 |
|
} |
404 |
|
|
405 |
|
/** |
418 |
|
|
419 |
|
Object e4 = q.floor(zero); |
420 |
|
assertNull(e4); |
421 |
– |
|
421 |
|
} |
422 |
|
|
423 |
|
/** |
436 |
|
|
437 |
|
Object e4 = q.ceiling(six); |
438 |
|
assertNull(e4); |
440 |
– |
|
439 |
|
} |
440 |
|
|
441 |
|
/** |
492 |
|
/** |
493 |
|
* iterator.remove removes current element |
494 |
|
*/ |
495 |
< |
public void testIteratorRemove () { |
495 |
> |
public void testIteratorRemove() { |
496 |
|
final TreeSet q = new TreeSet(); |
497 |
|
q.add(new Integer(2)); |
498 |
|
q.add(new Integer(1)); |
880 |
|
// BitSet should support this! Test would run much faster |
881 |
|
while (element >= min) { |
882 |
|
if (bs.get(element)) |
883 |
< |
return(element); |
883 |
> |
return element; |
884 |
|
element--; |
885 |
|
} |
886 |
|
return -1; |