javaSE关于TreeSet的笔记（5）

package collection;

import java.util.TreeSet;

// 先按照年龄升序，年龄一样再按照姓名升序
public class TreeSetTest05 {
    public static void main(String[] args) {
        // 创建Vip对象
        Vip v1 = new Vip("b", 20);
        Vip v2 = new Vip("a", 20);
        Vip v3 = new Vip("a", 19);

        // 创建TreeSet对象
        TreeSet<Vip> ts = new TreeSet<>();

        // 添加元素
        ts.add(v1);
        ts.add(v2);
        ts.add(v3);

        // 遍历
        for (Vip v : ts){
            System.out.println(v);
        }
    }
}

class Vip implements Comparable<Vip>{
    String name;
    int age;

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

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

    @Override
    public int compareTo(Vip vip) {
        if (this.age == vip.age){
            return this.name.compareTo(vip.name);
        }
        return this.age - vip.age;
    }
}