fock join 列子

import java.util.List;
import java.util.concurrent.RecursiveTask;


public class MyCounter extends RecursiveTask<Integer> {

	private static final long serialVersionUID = 1L;
	
	private List<Integer> list;

	/**
	 * 开始
	 */
	private int first;

	/**
	 * 结束
	 */
	private int last;

	public MyCounter(int first, int last, List<Integer> list) {
		super();
		this.first = first;
		this.last = last;
		this.list =list;
	}



	@Override
	protected Integer compute() {

		int sum = 0;

		if (last - first < 10) {
			System.out.print("["+first+"-"+last+"]");
			for (int i = first; i < last; i++) {
				sum = sum + list.get(i);
			}
		} else {
			int middle = (last + first)/2;
			MyCounter left = new MyCounter(first, middle, list);
			MyCounter right = new MyCounter(middle, last, list);
			left.fork();
			right.fork();
			sum = left.join()+right.join();
			System.out.println(sum);
		}
		return sum;
	}

}

import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.Future;

public class MyTest {
	public static void main(String[] args) throws InterruptedException,
			ExecutionException {
		List<Integer> list = new ArrayList<>();
		for (int i = 0; i < 20; i++) {
			list.add(i);
		}

		System.out.println(list);

		ForkJoinPool forkJoinPool = new ForkJoinPool();// 对线程池的扩展
		Future<Integer> result = forkJoinPool
				.submit(new MyCounter(0, 20, list));

		System.out.println(result.get());
		forkJoinPool.shutdown();
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值