----------- android培训、java培训、java学习型技术博客、期待与您交流! ------------
/**
* |--TreeSet :可以对Set集合中的元素进行排序 依据字母的自然顺序 小写字母比大写的大 HashSet是无序的为了弥补它的不足
* 有了TreeSet
*
* 需求: 往TreeSet存储自定义对象学生 按照学生的年龄进行排序
* 记住: 排序时 当主要条件相同时 一定要判断次要条件
* @author lazy
*
*/
public class TreeSetDemo {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
TreeSet<Student> ts = new TreeSet<Student>();
// ts.add("111");
//
// ts.add("444");
// ts.add("222");
// ts.add("333");
ts.add(new Student("lis007", 20));
ts.add(new Student("lis04", 19));
ts.add(new Student("lis01", 40));
ts.add(new Student("lis09", 40));
for (Iterator it = ts.iterator(); it.hasNext();) {
Student s = (Student) it.next();
sop(s.getName() + "....." + s.getAge());
}
}
public static void sop(Object obj) {
System.out.println(obj);
}
}
class Student implements Comparable {
private String name;
private int age;
Student(String name, int age) {
// TODO Auto-generated constructor stub
this.name = name;
this.age = age;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
@Override
public int compareTo(Object o) {
// TODO Auto-generated method stub
if (!(o instanceof Student)) {
throw new RuntimeException("不是学生对象");
}
Student s = (Student) o;
System.out.println(this.name + "...compareTo.." + s.name);
if (this.age > s.age) // 从小到大
return 1;
if (this.age == s.age && this.name == s.name)
return 0; // return this.name.compareTo(s.name); 也可以这么做
return -1;
}
}
----------------------- android培训、java培训、java学习型技术博客、期待与您交流! ----------------------