数组转换，集合去重，list转map

//string数组转换成int数组
 String[] strArr =approveCashierIds.split(",");
int[] cashierIds = Arrays.asList(strArr).stream().mapToInt(Integer::parseInt).toArray();

 

//去重
              oldList=oldList.stream().collect(
                      Collectors.collectingAndThen(Collectors.toCollection(
                              () -> new TreeSet<>(Comparator.comparing(ImAllMessage ::getId))), ArrayList::new)
              );

 

 

//list转Map

Map<String,Integer> userMap=userList.stream().collect(Collectors.toMap(User::getCode(),User::getName));

 

//查找身高在1.8米及以上的男生
List<StudentInfo> boys = studentList.stream().filter(s->s.getGender() && s.getHeight() >= 1.8).collect(Collectors.toList());

 

2.4 flatMap

将多个Stream合并为一个Stream。惰性求值

public class TestCase {
    public static void main(String[] args) {
        List<Student> students = new ArrayList<>(3);
        students.add(new Student("路飞", 22, 175));
        students.add(new Student("红发", 40, 180));
        students.add(new Student("白胡子", 50, 185));

        List<Student> studentList = Stream.of(students,
                asList(new Student("艾斯", 25, 183),
                        new Student("雷利", 48, 176)))
                .flatMap(students1 -> students1.stream()).collect(Collectors.toList());
        System.out.println(studentList);
    }
}

 

 

2.5 max和min

我们经常会在集合中求最大或最小值，使用流就很方便。及早求值。

public class TestCase {
    public static void main(String[] args) {
        List<Student> students = new ArrayList<>(3);
        students.add(new Student("路飞", 22, 175));
        students.add(new Student("红发", 40, 180));
        students.add(new Student("白胡子", 50, 185));

        Optional<Student> max = students.stream()
            .max(Comparator.comparing(stu -> stu.getAge()));
        Optional<Student> min = students.stream()
            .min(Comparator.comparing(stu -> stu.getAge()));
        //判断是否有值
        if (max.isPresent()) {
            System.out.println(max.get());
        }
        if (min.isPresent()) {
            System.out.println(min.get());
        }
    }
}