JavaRecursiveTask使用与结果获取详解

public class SumTask extends RecursiveTask<Long> {
    private static final int THRESHOLD = 1000; // 单个任务处理的最大数组长度
    private long[] array;
    private int start, end;
<pre class="brush:java;toolbar:false;">public SumTask(long[] array, int start, int end) {
    this.array = array;
    this.start = start;
    this.end = end;
}

@Override
protected Long compute() {
    if (end - start &lt;= THRESHOLD) {
        // 小任务：直接计算
        long sum = 0;
        for (int i = start; i &lt; end; i++) {
            sum += array[i];
        }
        return sum;
    } else {
        // 大任务：拆分
        int mid = (start + end) / 2;
        SumTask leftTask = new SumTask(array, start, mid);
        SumTask rightTask = new SumTask(array, mid, end);

        leftTask.fork(); // 异步提交左任务
        long rightResult = rightTask.compute(); // 当前线程执行右任务
        long leftResult = leftTask.join(); // 等待左任务完成并获取结果

        return leftResult + rightResult;
    }
}

}

public class Main {
    public static void main(String[] args) {
        long[] data = new long[10000];
        for (int i = 0; i < data.length; i++) {
            data[i] = i + 1;
        }
<pre class="brush:java;toolbar:false;">    SumTask task = new SumTask(data, 0, data.length);
    ForkJoinPool pool = new ForkJoinPool();
    long result = pool.invoke(task); // 启动任务并等待结果

    System.out.println("总和：" + result);
    pool.shutdown();
}

}