Java 集合对象排序

实现了Comparator接口，重写了compare方法

public class test {

	public static List<link> listLink = new ArrayList<link>();
	
	public static void main(String args[]){
		link lik = new link();
		lik.setUpdate(1);
		lik.setUrl("");
		lik.setFatherUrl("");
		lik.setCeng(1);
		lik.setLo(10);
		listLink.add(lik);
		
		lik = new link();
		lik.setUpdate(2);
		lik.setUrl("");
		lik.setFatherUrl("");
		lik.setCeng(1);
		lik.setLo(10);
		listLink.add(lik);
		
		lik = new link();
		lik.setUpdate(3);
		lik.setUrl("");
		lik.setFatherUrl("");
		lik.setCeng(1);
		lik.setLo(10);
		listLink.add(lik);
		
		lik = new link();
		lik.setUpdate(4);
		lik.setUrl("");
		lik.setFatherUrl("");
		lik.setCeng(1);
		lik.setLo(10);
		listLink.add(lik);
		
		lik = new link();
		lik.setUpdate(5);
		lik.setUrl("");
		lik.setFatherUrl("");
		lik.setCeng(1);
		lik.setLo(10);
		listLink.add(lik);
		
		Comparator<link> ascComparator = new linkComparator();
		Collections.sort(listLink, ascComparator);
		
		Iterator iter  = listLink.iterator();
		while(iter.hasNext()){		
			link liks = (link)iter.next();
			System.out.println("map="+liks.getUpdate());
		}
		
		System.out.println("\n降序排序测试:");
		Comparator<link> descComparator = Collections
		    .reverseOrder(ascComparator);
		System.out.println("利用反转后的排序接口对象对集合List排序并输出:");
		Collections.sort(listLink, descComparator);
		iter  = listLink.iterator();
		while(iter.hasNext()){		
			link liks = (link)iter.next();
			System.out.println("map="+liks.getUpdate());
		}
	}
}