TreeMap的floorEntry和ceilingEntry用法区别

floorEntry方法找到第一个小于或等于指定key的Map.Entry
ceilingEntry方法找到第一个大于或等于指定key的Map.Entry

测试代码如下所示
public class TreeMapTest {
    private static NavigableMap<Integer, Integer> rankingMap = new TreeMap<Integer, Integer>();

    static {
        rankingMap.put(1,1);  //ranking 1 ->1
        rankingMap.put(2,2); //ranking 2 ->2
        rankingMap.put(3,3); //ranking 3 -> 3
        rankingMap.put(4,4); //ranking 4-10 ->4
        rankingMap.put(11,5); //ranking 11-20 ->5
        rankingMap.put(21,6); //ranking 21-30 ->6
        rankingMap.put(31,7); //ranking >= 31 ->7
    }
    public static void main(String[] args) {
        System.out.println(rankingMap.floorEntry(20).getValue());
        System.out.println(rankingMap.ceilingEntry(20).getValue());
    }
}

测试代码返回的结果为

5

6