TreeMap实现自然排序与定制排序

在Java中，如果我们想要实现对我们类中的对象按照一定规则进行比较，就要在类中实现Compare类并重写compareTo方法（自然排序）。

首先我们要新建一个类，在这个类中必须实现Comparable接口，并重写这个接口的compareTo方法

public class User implements Comparable{
    private String name;
    private int age;

    public User() {
    }

    public User(String name, int age) {
        this.name = name;
        this.age = age;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

    @Override
    public String toString() {
        return "User{" +
                "name='" + name + '\'' +
                ", age=" + age +
                '}';
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        User user = (User) o;
        return age == user.age &&
                Objects.equals(name, user.name);
    }

    @Override
    public int hashCode() {
        return Objects.hash(name, age);
    }

    //按照姓名从大到小排列，年龄从小到大排列
    @Override
    public int compareTo(Object o) {
        if (o instanceof User){
            User user = (User) o;
            int compare = -this.name.compareTo(user.name); //前面加负号就是降序排列
            if (compare != 0){
                return compare;
            } else {
                return Integer.compare(this.age,user.age); //如果姓名一样就比较年龄升序排列
            }
        } else {
            throw new RuntimeException("输入的类型不匹配");
        }
    }
}

测试如下：

public class TreeMapeTest {
    //自然排序
    @Test
    public void test(){
        TreeMap map = new TreeMap();

        User u1 = new User("Tom",11);
        User u2 = new User("Team",30);
        User u3 = new User("John",23);
        User u4 = new User("Jerry",18);

        map.put(u1,11);
        map.put(u2,11);
        map.put(u3,22);
        map.put(u4,33);

        Set entrySet = map.entrySet();
        Iterator iterator = entrySet.iterator();
        while (iterator.hasNext()){
            Object obj = iterator.next();
            Map.Entry entry = (Map.Entry) obj;
            System.out.println(entry.getKey() + "------>" + entry.getValue());
        }
    }

    //定制排序
    @Test
    public void test2(){
        TreeMap map = new TreeMap(new Comparator() {
            @Override
            public int compare(Object o1, Object o2) {
                if (o1 instanceof User && o2 instanceof User){
                    User u1 = (User) o1;
                    User u2 = (User) o2;
                    return Integer.compare(u1.getAge(),u2.getAge());
                } else {
                    throw new RuntimeException("输入的类型不匹配");
                }
            }
        });

        User u1 = new User("Tom",11);
        User u2 = new User("Team",30);
        User u3 = new User("John",23);
        User u4 = new User("Jerry",18);

        map.put(u1,11);
        map.put(u2,11);
        map.put(u3,22);
        map.put(u4,33);

        Set entrySet = map.entrySet();
        Iterator iterator = entrySet.iterator();
        while (iterator.hasNext()){
            Object obj = iterator.next();
            Map.Entry entry = (Map.Entry) obj;
            System.out.println(entry.getKey() + "------>" + entry.getValue());
        }
    }
}