通过元素自身实现比较规则

在元素自身实现比较规则时，需要实现Comparable接口中的compareTo方法，该方法中用来定义比较规则。TreeSet通过调用该方法来完成对元素的排序处理。

创建Users类

pubic class Users implements Comparable<Users> {
    private String username;
    private int userage;
    
    public Users(String username,int userage){
        this.username = username;
        this.userage = userage;
    }
    
    public Users(){}

    @Override
    public boolean equals(Object o){
        System.out.println("equals...");
        if(this == o) return true;
        if(o == null || getClass() != o.getClass()) return false;

        Users users = (Users) o;
        if(userage != users.userage) return false;
        return username != null ? username.equals(users.username) : users.username == null;
    }

    @Override
    public int hashCode(){
        int result = username != null ? username.hashCode() : 0;
        result = 31 * result + userage;
        return result; 
    }

    public String getUsername(){
        return username;
    }

    public void SetUsername(String username){
        this.username = username;
    }

    public int getUserage(){
        return userage;
    }

    public void setUserage(int userage){
        this.userage = userage;
    }

    @Override
    public String toString(){
        return "Users{" +
                "username='" + username + '\'' +
                ",userage=" + userage +
                '}';
    }

    //定义比较规则
    //正数：大，负数：小，0：相等
    @Override
    public int compareTo(Users o){
        if(this.userage > p.getUserage()){
            return 1;    
        }
        if(this.userage == o.getUserage()){
            return this.username.compareTo(o.getUsername());
        }
        return -1;
    }
}

Set<Users> set1 = new TreeSet<>();
User u = new Users("小明",18);
User u1 = new Users("小红",22);
User u2 = new Users("小亮",22);
set1.add(u);
set1.add(u1);
set1.add(u2);
for(Users users : set1){
    System.out.println(users);
}