强行对某个对象 collection 进行整体排序 的比较函数。可以将 Comparator 传递给 sort 方法(如 Collections.sort
或 Arrays.sort
),从而允许在排序顺序上实现精确控制。还可以使用 Comparator 来控制某些数据结构(如有序 set
或有序映射
)的顺序,或者为那些没有自然顺序
的对象 collection 提供排序。需要实现compare方法,比较用来排序的两个参数。根据第一个参数小于、等于或大于第二个参数分别返回负整数、零或正整数。
看一个例子:
// 定义一个Teacher类
package comparabletest;
/**
* @author Administrator 定义一个Teacher类
*/
public class Teacher {
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;
}
@Override
public String toString() {
return "Teacher [name=" + name + ", age=" + age + "]";
}
public Teacher(String name, int age) {
this.name = name;
this.age = age;
}
}
// 定义一个Teacher类的比较器
package comparabletest;
import java.util.Comparator;
/**
* @author Administrator 定义一个Teacher类的比较器,实现Comparator接口
*/
public class TeacherComparator implements Comparator<Teacher> {
@Override
public int compare(Teacher o1, Teacher o2) {
if (o1.getName().compareTo(o2.getName()) > 0) {
return -1; // 对象1的值大于对象2的值,返回-1.降序排列
} else if (o1.getName().compareTo(o2.getName()) < 0) {
return 1; // 对象1的值小于对象2的值,返回1.降序排列
} else {
if (o1.getAge() > o2.getAge()) {
return 1; // 对象1的值大于对象2的值,返回1.升序排列
} else if (o1.getAge() < o2.getAge()) {
return -1; // 对象1的值小于对象2的值,返回-1.升序排列
} else {
return 0;
}
}
}
}
// 测试代码,将Teacher对象进行排序
package comparabletest;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class StudentCompare {
public static void main(String[] args) {
// 定义一个长度为4的数组
Teacher[] teachers = { new Teacher("jack", 23), new Teacher("tom", 22),
new Teacher("peter", 21), new Teacher("jack", 28) };
// 按名字降序,年龄升序排列
java.util.Arrays.sort(teachers, new TeacherComparator());
for (int i = 0; i < teachers.length; i++) {
System.out.println(teachers[i]);
}
System.out.println("------");
// 定义一个长度为4的列表
List<Teacher> teachersList = new ArrayList<Teacher>();
teachersList.add(new Teacher("jack", 23));
teachersList.add(new Teacher("tom", 22));
teachersList.add(new Teacher("peter", 21));
teachersList.add(new Teacher("jack", 28));
// 按名字降序,年龄升序排列
Collections.sort(teachersList, new TeacherComparator());
for (Teacher t : teachersList) {
System.out.println(t);
}
}
}
// 输出结果:
Teacher [name=tom, age=22]
Teacher [name=peter, age=21]
Teacher [name=jack, age=23]
Teacher [name=jack, age=28]
------
Teacher [name=tom, age=22]
Teacher [name=peter, age=21]
Teacher [name=jack, age=23]
Teacher [name=jack, age=28]