1.自然排序
-
在TreeSet中默认要求里面的元素进行自然排序,强制要求里面的所有元素必须按照Comparable中的compareTo方法进行比较。
-
类需实现Comparable接口,并重写方法compareTo(Object obj) 方法。
-
两个对象即通过 compareTo(Object obj) 方法的返回值来比较大小。如果当前对象this大于形参对象obj,则返回正整数,如果当前对象this小于形参对象obj,则返回负整数,如果当前对象this等于形参对象obj,则返回零。
-
TreeSet实例在调用add方法时会调用容器对象的compareTo方法对元素进行比较
-
TreeSet实例中对象必须是实现了Comparable接口
示例:按照年龄比较;当年龄相等返回0,大于返回1,小于返回-1
User类:
public class User implements Comparable{
private String name;
private int age;
public User() {
}
public User(String name, int age) {
this.name = name;
this.age = age;
}
@Override
public int compareTo(Object o) {
//比如按照年龄比较;当年龄相等返回0,大于返回1,小于返回-1
User user = (User)o;
if(this.age > user.age){
return 1;
}else if(this.age<user.age){
return -1;
}else{
return this.name.compareTo(user.name);
}
}
@Override
public String toString() {
return "User{" +
"name='" + name + '\'' +
", age=" + age +
'}';
}
}
测试类:
@Test
public void test01(){
TreeSet set = new TreeSet();
set.add(new User("xx",18));
set.add(new User("yy",16));
set.add(new User("zz",12));
Iterator iterator = set.iterator();
while(iterator.hasNext()){
System.out.println(iterator.next());
}
}
实验结果:
2.定制排序
- 重写compare(Object o1,Object o2)方法,比较o1和o2的大小:如果方法返回正整数,则表示o1大于o2;如果返回0,表示相等;返回负整数,表示 o1小于o2
User类:
public class User{
private String name;
private int age;
public User() {
}
public User(String name, int age) {
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 String toString() {
return "User{" +
"name='" + name + '\'' +
", age=" + age +
'}';
}
}
测试类:
@Test
public void test01(){
Comparator com = new Comparator() {
//按照年龄从小到大排列
@Override
public int compare(Object o1, Object o2) {
if(o1 instanceof User && o2 instanceof User){
User u1 = (User)o1;
User u2 = (User)o2;
return Integer.compare(u1.getAge(),u2.getAge());
}else{
throw new RuntimeException("输入的数据类型不匹配");
}
}
};
TreeSet set = new TreeSet(com);
set.add(new User("xx",18));
set.add(new User("yy",16));
set.add(new User("zz",12));
Iterator iterator = set.iterator();
while(iterator.hasNext()){
System.out.println(iterator.next());
}
}
实验结果: