Java函数式编程与并行计算的结合创新

import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.RecursiveTask;

class MatrixMultiplier extends RecursiveTask<int[][]> {
    private final int[][] a;
    private final int[][] b;

    public MatrixMultiplier(int[][] a, int[][] b) {
        this.a = a;
        this.b = b;
    }

    @Override
    protected int[][] compute() {
        int[][] result = new int[a.length][b[0].length];
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < b[0].length; j++) {
                for (int k = 0; k < a[0].length; k++) {
                    result[i][j] += a[i][k] * b[k][j];
                }
            }
        }
        return result;
    }
}

public class Main {
    public static void main(String[] args) {
        int[][] a = new int[][]{{1, 2}, {3, 4}};
        int[][] b = new int[][]{{5, 6}, {7, 8}};

        ForkJoinPool pool = new ForkJoinPool();
        int[][] result = pool.invoke(new MatrixMultiplier(a, b));

        for (int[] row : result) {
            for (int element : row) {
                System.out.print(element + " ");
            }
            System.out.println();
        }
    }
}