parallelSort（）、parallelPrefix（）、parallelSetAll（） java8新增方法

import java.util.Arrays;
import java.util.function.IntBinaryOperator;
import java.util.function.IntUnaryOperator;

public class MyDemo1 {
    public static void main(String[] args) {
        int[] arr1=new int[]{1,8,51,13,46,11,22};
        //对数组进行并发排序
        Arrays.parallelSort(arr1);
        System.out.println(Arrays.toString(arr1));
        
        int[] arr2=new int[]{1,8,51,13,46,11,22};
        Arrays.parallelPrefix(arr2, new IntBinaryOperator() {
            @Override
            public int applyAsInt(int left, int right) {
                //left代表数组中前一个索引处的元素，计算第一个元素时，left为1
                //right代表数组中当前索引处的元素
                return left*right;
            }
        });
        System.out.println(Arrays.toString(arr2));

        int[] arr3=new int[5];
        Arrays.parallelSetAll(arr3, new IntUnaryOperator() {
            @Override
            public int applyAsInt(int operand) {
                //operand代表正在子酸的元素的索引
                return operand*5;
            }
        });
        System.out.println(Arrays.toString(arr3));
    }
}

输出：
[1, 8, 11, 13, 22, 46, 51]
[1, 8, 408, 5304, 243984, 2683824, 59044128]
[0, 5, 10, 15, 20]