TreeMap的键按顺序排列

package com.xxx;

import java.util.Iterator;
import java.util.Set;
import java.util.TreeMap;

/**
 * com.xxx
 * 2022/4/19
 * user
 * function:TreeMap的键按顺序排列
 */
public class demo007_treemap {
    public static void main(String[] args) {
        int i = 1;
        i = i++;
        System.out.println(i);//1

        int count = 0;
        for (int j = 0; j < 10000; j++) {
            count = count++;
        }
        System.out.println(count);//0

        final StringBuilder sb = new StringBuilder("abc");
        sb.append("d");
        System.out.println(sb);

        Dog1 d1 = new Dog1("red", 30);
        Dog1 d2 = new Dog1("black", 20);
        Dog1 d3 = new Dog1("white", 10);
        Dog1 d4 = new Dog1("white", 40);

        TreeMap treeMap = new TreeMap();
        treeMap.put(d1, 10);
        treeMap.put(d2, 15);
        treeMap.put(d3, 5);
        treeMap.put(d4, 20);

        Set set = treeMap.entrySet();
        Iterator iterator = set.iterator();
        for (; iterator.hasNext(); ){
            System.out.println(iterator.next());
        }
    }
}
class Dog1 implements Comparable<Dog1>{
    String color;
    int size;
    public Dog1(String color, int size) {
        this.color = color;
        this.size = size;
    }
    @Override
    public String toString() {
        return color + " dog";
    }
    @Override
    public int compareTo(Dog1 o) {
        return o.size - this.size;
    }
}

运行结果