【Java】Treeset实现自定义排序

两个类，一个学生类，含姓名和出生日期两个属性；还有一个学生排序类，重写compare函数，自定义排序规则是先比较出生日期，如果相同再比较姓名字母

package birthday;

import ;

public class Student {

	private String name;
	private Calendar birthday;
	Student(String aname,Calendar date)
	{
		name=aname;
		birthday=date;
		
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		 = name;
	}
	public Calendar getBirthday() {
		return birthday;
	}
	public void setBirthday(Calendar birthday) {
		 = birthday;
	}
	
}

package birthday;

import ;
import ;
import ;
import ;
import ;

public class ComparatorStudent implements Comparator<Student>{

	@Override
	public int compare(Student o1, Student o2) {
		// TODO Auto-generated method stub
		if (().equals(()))
			{
				if (().compareTo(())>0) return 1;
				else if (().compareTo(())<0) return -1;
				else return 0;
			}
		else if (().after(()))
			return 1;
		else 
			return -1;
	}
	public static void main(String ars[])
	{
		Set<Student> treeset = new TreeSet<Student>(new ComparatorStudent());
		Calendar cal1 = ();
		Calendar cal2 = ();
		Calendar cal3 = ();
		Calendar cal4 = ();
		(1991,5,6);
		(1992,2,5);
		(1992,10,12);
		(1992,2,5);
		Student stu1 = new Student ("Mike",cal1);
		Student stu2 = new Student ("Jack",cal2);
		Student stu3 = new Student ("Lucy",cal3);
		Student stu4 = new Student ("Lily",cal4);
		
		(stu4);
		(stu3);
		(stu2);
		(stu1);
		
		SimpleDateFormat dateformat = new SimpleDateFormat("yyyy-MM-dd");
		for (Student s:treeset)
		{
			(()+"	出生日期:	"+(().getTime()));
		}
	}
	
}

输出结果：

Mike	出生日期:	1991-06-06
Jack	出生日期:	1992-03-05
Lily	出生日期:	1992-03-05
Lucy	出生日期:	1992-11-12