11 |
|
|
12 |
|
public class TreeMapTest 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(TreeMapTest.class); |
357 |
|
|
358 |
|
Map.Entry e4 = map.lowerEntry(zero); |
359 |
|
assertNull(e4); |
360 |
– |
|
360 |
|
} |
361 |
|
|
362 |
|
/** |
375 |
|
|
376 |
|
Map.Entry e4 = map.higherEntry(six); |
377 |
|
assertNull(e4); |
379 |
– |
|
378 |
|
} |
379 |
|
|
380 |
|
/** |
393 |
|
|
394 |
|
Map.Entry e4 = map.floorEntry(zero); |
395 |
|
assertNull(e4); |
398 |
– |
|
396 |
|
} |
397 |
|
|
398 |
|
/** |
411 |
|
|
412 |
|
Map.Entry e4 = map.ceilingEntry(six); |
413 |
|
assertNull(e4); |
417 |
– |
|
414 |
|
} |
415 |
|
|
416 |
|
|
430 |
|
|
431 |
|
Object e4 = q.lowerKey(zero); |
432 |
|
assertNull(e4); |
437 |
– |
|
433 |
|
} |
434 |
|
|
435 |
|
/** |
448 |
|
|
449 |
|
Object e4 = q.higherKey(six); |
450 |
|
assertNull(e4); |
456 |
– |
|
451 |
|
} |
452 |
|
|
453 |
|
/** |
466 |
|
|
467 |
|
Object e4 = q.floorKey(zero); |
468 |
|
assertNull(e4); |
475 |
– |
|
469 |
|
} |
470 |
|
|
471 |
|
/** |
484 |
|
|
485 |
|
Object e4 = q.ceilingKey(six); |
486 |
|
assertNull(e4); |
494 |
– |
|
487 |
|
} |
488 |
|
|
489 |
|
/** |
652 |
|
assertEquals(1, sm.size()); |
653 |
|
assertEquals(three, sm.firstKey()); |
654 |
|
assertEquals(three, sm.lastKey()); |
655 |
< |
assertTrue(sm.remove(three) != null); |
655 |
> |
assertEquals("C", sm.remove(three)); |
656 |
|
assertTrue(sm.isEmpty()); |
657 |
|
assertEquals(3, map.size()); |
658 |
|
} |
685 |
|
assertEquals(4, map.size()); |
686 |
|
assertEquals(0, sm.size()); |
687 |
|
assertTrue(sm.isEmpty()); |
688 |
< |
assertTrue(sm.remove(three) == null); |
688 |
> |
assertSame(sm.remove(three), null); |
689 |
|
assertEquals(4, map.size()); |
690 |
|
} |
691 |
|
|
767 |
|
NavigableMap ssm = sm.tailMap(four, true); |
768 |
|
assertEquals(four, ssm.firstKey()); |
769 |
|
assertEquals(five, ssm.lastKey()); |
770 |
< |
assertTrue(ssm.remove(four) != null); |
770 |
> |
assertEquals("D", ssm.remove(four)); |
771 |
|
assertEquals(1, ssm.size()); |
772 |
|
assertEquals(3, sm.size()); |
773 |
|
assertEquals(4, map.size()); |
992 |
|
// BitSet should support this! Test would run much faster |
993 |
|
while (key >= min) { |
994 |
|
if (bs.get(key)) |
995 |
< |
return(key); |
995 |
> |
return key; |
996 |
|
key--; |
997 |
|
} |
998 |
|
return -1; |