使用TreeSet添加对象如何保证有序，实现Comparable接口

当我们使用TreeSet时，如果添加了学生对象的话，我们就必须去实现Comparable接口，当然也可以实现Comparator接口，，这次我们实现Comparable接口。

package Domain;

按照年龄大小排序
public class Student implements Comparable<Student>{
	private String name;
	private int 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;
	}
	public Student(String name,int age) {
		this.name=name;
		this.age=age;
	}
	
	@Override
	public String toString() {
		return "Student [name=" + name + ", age=" + age + "]";
	}
	@Override
	public int compareTo(Student o) {
		//按年龄排序，如果年龄相同，看姓名是否也相同
		int num2=this.age-o.age;
		int num3=num2==0?this.name.compareTo(o.name):num2;
		return num3;
	}
}

package cn.map;

import java.util.TreeSet;

import Domain.Student;

public class TreeSetDemo {
	public static void main(String[] args) {
		TreeSet<Student> set=new TreeSet<Student>();
		Student s1 = new Student("linqingxia", 27);
		Student s2 = new Student("zhangguorong", 29);
		Student s3 = new Student("wanglihong", 23);
		Student s4 = new Student("linqingxia", 27);
		Student s5 = new Student("liushishi", 22);
		Student s6 = new Student("wuqilong", 40);
		Student s7 = new Student("fengqingy", 22);
		set.add(s1);
		set.add(s2);
		set.add(s3);
		set.add(s4);
		set.add(s5);
		set.add(s6);
		set.add(s7);
		for (Student student : set) {
			System.out.println(student);
		}
	}
}