java1.8 list 多条件排序

java1.8 list 多条件排序

参考:https://blog.csdn.net/u010772230/article/details/88896422

public static void main(String[] args) {

    String orderId1 = "2321837281372913";
    String userId1 = "20180701001";
    String orderId2 = "2321837281372914";
    String userId2 = "20180701002";
    String orderId3 = "2321837281372912";
    String userId3 = "20180701003";
    String orderId5 = "2321837281372918";
    String userId5 = "20180701004";
    String orderId6 = "2321837281372918";
    String userId6 = "20180701009";
    String orderId4 = "2321837281372918";
    String userId4 = "20180701005";
    
    Order order = new Order();
    order.setUserId(userId1);
    order.setOrderId(orderId1);
    Order order1 = new Order();
    order1.setOrderId(orderId2);
    order1.setUserId(userId2);
 
    Order order2 = new Order();
    order2.setOrderId(orderId3);
    order2.setUserId(userId3);
    Order order3 = new Order();
    order3.setOrderId(orderId4);
    order3.setUserId(userId4);
    Order order4 = new Order();
    order4.setOrderId(orderId5);
    order4.setUserId(userId5);
    Order order5 = new Order();
    order5.setUserId(userId6);
    order5.setOrderId(orderId6);
 
    List<Order> orderList = new ArrayList<Order>();
    orderList.add(order);
    orderList.add(order1);
    orderList.add(order2);
    orderList.add(order3);
    orderList.add(order4);
    orderList.add(order5);
 
    System.out.println(orderList.toString());
    System.out.println("=========================");
    System.out.println("=======这样子就是以orderid降序,如果ordeid相同再以userid降序==================");
    orderList.sort(Comparator.comparing(Order::getOrderId).thenComparing(Order::getUserId).reversed());
    System.out.println(orderList.toString());
 
    System.out.println("=======这样子就是以orderid降序,如果ordeid相同再以userid升序==================");
    orderList.sort(Comparator.comparing(Order::getOrderId).reversed().thenComparing(Order::getUserId));
    System.out.println(orderList.toString());
 
    System.out.println("=======这样子就是以orderid升序,如果ordeid相同再以userid升序==================");
    orderList.sort(Comparator.comparing(Order::getOrderId).thenComparing(Order::getUserId));
    System.out.println(orderList.toString());
 
    System.out.println("=======这样子就是以orderid升序,如果ordeid相同再以userid降序==================");
          orderList.sort(Comparator.comparing(Order::getOrderId).reversed().thenComparing(Order::getUserId).reversed());
    System.out.println(orderList.toString());
 
 
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值