forkJoin的使用，分支合并

forkJoin的使用，分支合并

如何使用forkJoin
1、forkJoinPool 通过他来执行
2、计算任务 forkJoinPool.execute(ForkJoinTask task)
3、计算要继承forkJoinTask

package ForkJoinA;

import java.util.concurrent.ExecutionException;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.ForkJoinTask;
import java.util.stream.LongStream;

/**分支合并 ForkJoin
 * @author liu
 */
public class Test {
    public static void main(String[] args) throws ExecutionException, InterruptedException {
        //test1();//结果：500000000500000000 时间：4841
        //test2();//500000000500000000 时间：7876
test3();
    }

    public static void test1() {
        Long sum = 0L;
        long start = System.currentTimeMillis();
        for (int i = 1; i <= 10_0000_0000; i++) {
            sum += i;
        }
        long end = System.currentTimeMillis();
        System.out.println("结果：" + sum + " 时间：" + (end - start));
    }

    public static void test2() throws ExecutionException, InterruptedException {
        long start = System.currentTimeMillis();

        ForkJoinPool forkJoinPool = new ForkJoinPool();
        ForkJoinTask<Long> task = new Demo01(0L, 10_0000_0000L);
        ForkJoinTask<Long> submit = forkJoinPool.submit(task);//提交任务
        Long sum = submit.get();
        long end = System.currentTimeMillis();
        System.out.println("结果：" + sum + " 时间：" + (end - start));
    }

    public static void test3() {
        long start = System.currentTimeMillis();
        //stream并行流  range并发是（） rangeClose是（ ]  reduce减少
        Long sum = LongStream.rangeClosed(0L, 10_0000_0000L).parallel().reduce(0L,Long::sum);
        long end = System.currentTimeMillis();
        System.out.println("结果：" + sum + " 时间：" + (end - start));
    }
}

extends RecursiveTask ，重写compute

package ForkJoinA;

import java.util.concurrent.RecursiveTask;

/**
 * 如何使用forkJoin
 * 1、forkJoinPool  通过他来执行
 * 2、计算任务 forkJoinPool.execute(ForkJoinTask task)
 * 3、计算要继承forkJoinTask
 *
 * @author liu
 */
public class Demo01 extends RecursiveTask<Long> {
    private Long start;
    private Long end;

    //临界值
    private Long temp = 10000L;

    public Demo01(Long start, Long end) {
        this.start = start;
        this.end = end;
    }

    //计算方法
    @Override
    protected Long compute() {
        if ((end - start) < temp) {
            Long sum = 0L;
            for (Long i = start; i < end + 1; i++) {
                sum = sum + i;
            }
            return sum;
        } else {//forkJoin 递归
            Long mid=(start+end)/2;
            Demo01 task1=new Demo01(start,mid);
            task1.fork();//拆分任务，把任务压入线程队列
            Demo01 task2=new Demo01(mid+1,end);
            task2.fork();//拆分任务，把任务压入线程队列
            return task1.join()+task2.join();
        }

    }
}