声明
1)该文章整理自网上的大牛和专家无私奉献的资料,具体引用的资料请看参考文献。
2)本文仅供学术交流,非商用。如果某部分不小心侵犯了大家的利益,还望海涵,并联系博主删除。
3)博主才疏学浅,文中如有不当之处,请各位指出,共同进步,谢谢。
4)此属于第一版本,若有错误,还需继续修正与增删。还望大家多多指点。大家都共享一点点,一起为祖国科研的推进添砖加瓦。
public class Logs implements Serializable, Comparable<Logs> {
private String id;
private String username;
private String contents;
private String consequence;
private String ip;
private Long times;
@Override
public int compareTo(Logs o) {
return 0;
}
}
解析: Logs实体,要继承Comparable<T>接口, 然后再实现一个public int compareTo(Logs o) 方法.
现在,我要对List<Logs> 中的数据按 times 字段进行排序
@Test
public void testMath(){
List<Logs> list = new ArrayList<Logs>();
list.add(new Logs("1","chen", "djifand", "jdifa", "jdfid", 49L));
list.add(new Logs("134","ce", "cae", "jdifa", "jdfid", 123L));
list.add(new Logs("3","cet", "djifand", "jdifa", "jdfid", 99L));
list.add(new Logs("4","egge", "djifand", "jdifa", "jdfid", 111L));
list.add(new Logs("15","chen", "djifand", "jdifa", "jdfid", 59L));
list.add(new Logs("6","chen2", "cae", "jdifa", "jdfid", 123L));
list.add(new Logs("87","cet", "djifand", "jdifa", "jdfid", 213L));
list.add(new Logs("8","egge", "djifand", "jdifa", "jdfid", 201L));
list.add(new Logs("9","egge2", "djifand", "jdifa", "jdfid", 269L));
list.add(new Logs("10","ce", "cae", "jdifa", "jdfid", 121L));
list.add(new Logs("11","chen3", "djifand", "jdifa", "jdfid", 1123L));
list.add(new Logs("5","cet2", "djifand", "jdifa", "jdfid", 12L));
System.out.println("---- 排序前的输出 ----- ");
for (Logs logs : list) {
System.out.println("数据: "+logs);
}
System.out.println("---- 排序后的结果 ----- ");
List<Logs> search = search(list);
for (Logs logs : search) {
System.out.println("-->"+logs);
}
}
// 方式1: 降序排列
public List<Logs> search(List<Logs> logsList){
Collections.sort(logsList, new Comparator<Logs>() {
@Override
public int compare(Logs o1, Logs o2) {
if ((o1.getTimes() > o2.getTimes())){
return -1;
}
if (o1.getTimes() == o2.getTimes()){
return 0;
}
return 1;
}
});
return logsList;
}
// 方式2: 升序排列
public List<Logs> search(List<Logs> logsList){
Collections.sort(logsList, new Comparator<Logs>() {
@Override
public int compare(Logs o1, Logs o2) {
if ((o1.getTimes() > o2.getTimes())){
return 1;
}
if (o1.getTimes() == o2.getTimes()){
return 0;
}
return -1;
}
});
return logsList;
}
// 方式3: 降序排列
public List<Logs> search(List<Logs> logsList){
Collections.sort(logsList, new Comparator<Logs>() {
@Override
public int compare(Logs o1, Logs o2) {
return -o1.getTimes().compareTo(o2.getTimes());
}
});
return logsList;
}
// 方式4: 升序排列
public List<Logs> search(List<Logs> logsList){
Collections.sort(logsList, new Comparator<Logs>() {
@Override
public int compare(Logs o1, Logs o2) {
return o1.getTimes().compareTo(o2.getTimes());
}
});
return logsList;
}