java：list排序

package com.mapred.entity;public class Bar implements Comparable<Bar>{private String id; private String hexValue  ;public String getId() {return id;}public void setId(String id) {this.id = id;}public String getHexValue() {return hexValue;}public void setHexValue(String hexValue) {this.hexValue = hexValue;} @Overridepublic int compareTo(Bar arg0) {    return this.getId().compareTo(arg0.getId());}}

StringBuffer buffer = new StringBuffer(""); Collections.sort(list);for(int i=0;i<list.size();i++){Bar bar=list.get(i);String lineHex=bar.getHexValue();buffer.append(lineHex);}

public class Person {    private String name;    private Integer order;     public String getName() {        return name;    }    public void setName(String name) {        this.name = name;    }     public Integer getOrder() {        return order;    }    public void setOrder(Integer order) {        this.order = order;    }}

public static void main(String[] args) {        List<Person> listA = new ArrayList<Person>();        Person p1 = new Person();        Person p2 = new Person();        Person p3 = new Person();         p1.setName("name1");        p1.setOrder(1);        p2.setName("name2");        p2.setOrder(2);        p3.setName("name3");        p3.setOrder(3);         listA.add(p2);        listA.add(p1);        listA.add(p3);                 Collections.sort(listA, new Comparator<Person>() {            public int compare(Person arg0, Person arg1) {                return arg0.getOrder().compareTo(arg1.getOrder());            }        });                 for (Person p : listA) {            System.out.println(p.getName());        }    }