java treeSet Comparator demo

package zhu0703;

import java.util.Comparator;
import java.util.TreeSet;

/*
存储学生对象并遍历， 创建TreeSet集合使用带参方法
要求： 按年龄从小到大排序， 年龄相同按字母顺序排序
 */
public class TreeSetDemo1 {


    public static void main(String[] args) {
        TreeSet<Student1> ts = new TreeSet<Student1>(new Comparator<Student1>() {
            @Override
            public int compare(Student1 o1, Student1 o2) {
                int num = o1.getAge() - o2.getAge();
                return num == 0 ? o1.getName().compareTo(o2.getName()) : num;

            }
        });
        Student1 s1 = new Student1("xishi", 29);
        Student1 s2 = new Student1("wangzhaojun", 28);
        Student1 s3 = new Student1("diaochan", 30);
        Student1 s4 = new Student1("lingqinxia", 33);
        Student1 s5 = new Student1("xishi1", 29);

        ts.add(s1);
        ts.add(s2);
        ts.add(s3);
        ts.add(s4);
        ts.add(s5);
        for (Student1 s : ts) {
            System.out.println(s.getName() + ", " + s.getAge());
        }


    }
}

package zhu0703;

public class Student1 {
    private String name;
    private int age;

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

    public Student1() {
    }

    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;
    }

}