jdk8 新特性

一、排序
1.对数字进行排序
List nums = Arrays.asList(3,1,5,2,9,8,4,10,6,7);
nums.sort(Comparator.reverseOrder()); //reverseOrder倒序
System.err.println(“倒序:”+nums);

nums.sort(Comparator.naturalOrder()); //naturalOrder自然排序即：正序
System.err.println(“正序:”+nums);
2.对实体对象进行排序
ArrayList inventory = Lists.newArrayList(
new Apple(10, “red”),
new Apple(5, “red”),
new Apple(1, “green”),
new Apple(15, “green”),
new Apple(2, “red”));
/**

• 顺序排序
  */
  // 传递代码，函数式编程
  inventory.sort(new AppleComparator());
  System.out.println(inventory);

// 匿名内部类
inventory.sort(new Comparator() {
@Override
public int compare(Apple o1, Apple o2) {
return o1.getWeight() - o2.getWeight();
}
});

// 使用Lambda表达式
inventory.sort((a, b) -> a.getWeight() - b.getWeight());

// 使用Comparator的comparing
Comparator comparing = comparing((Apple a) -> a.getWeight());
inventory.sort(comparing((Apple a) -> a.getWeight()));
//或者等价于
inventory.sort(comparing(Apple::getWeight));
/**

• 逆序排序
  */
  // 根据重量逆序排序
  inventory.sort(comparing(Apple::getWeight).reversed());