TreeSet存储自定义对象并遍历2

需求：按姓名的长度排序；
Student.java:

package cn.itcast_05;
//如果一个类的元素要想能够进行自然排序，就必须实现自然排序接口
public class Student implements Comparable<Student>{
	private String name;
	private int age;
	public Student() {
		super();
		// TODO Auto-generated constructor stub
	}
	public Student(String name, int age) {
		super();
		this.name = name;
		this.age = 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;
	}
	@Override
	public int compareTo(Student o) {
		// TODO Auto-generated method stub
		//return 0;//不排序
		//return -1;//从大到小排序
		//return 1;//从小到大排序
		//按姓名的长度排序规则，这是主要条件
		int num=this.name.length()-o.name.length();
		//姓名长度相同不代表姓名相同
		int num1=num==0?this.name.compareTo(o.name):num;
		//姓名相同，不代表年龄相同
		int x=num1==0?this.age-o.age:num1;
		return x;
	}
	 
}

test.java:

package cn.itcast_05;

import java.util.TreeSet;

public class test {
	public static void main(String[] args) {
		TreeSet<Student> ts=new TreeSet<Student>();
		
		Student s1=new Student("aa",12);
		Student s2=new Student("bb",13);
		Student s3=new Student("cc",10);
		Student s4=new Student("dd",11);
		Student s5=new Student("ee",14);
		Student s6=new Student("ff",12);
		
		ts.add(s1);
		ts.add(s2);
		ts.add(s3);
		ts.add(s4);
		ts.add(s5);
		ts.add(s6);
		
		for(Student x:ts){
			System.out.println(x.getName()+"---"+x.getAge());
		}
}
}

结果：

aa---12
bb---13
cc---10
dd---11
ee---14
ff---12