CyclicBarrier 用法 ,汇总统计

package net.biancheng.c.thread;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.concurrent.BrokenBarrierException;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.locks.ReentrantLock;

/**
 * @author cheng
 * @Description 统计所有线程的数字汇总
 * @Date 2022/8/29 17:29
 */
public class Caculate {
    public static  List<Integer> list = new ArrayList<Integer>();

    public static void main(String[] args) {
        int nums = 15;
        ExecutorService executor = Executors.newFixedThreadPool(nums);
        CyclicBarrier barrier = new CyclicBarrier(nums, () -> {
            try {
                System.out.println("Arrays.toString(list.toArray()) = " + Arrays.toString(list.toArray()));
                Integer total = 0;
                for (int i = 0; i < list.size(); i++) {
                    total = total + list.get(i);
                }
                System.out.println("total = " + total);

            } catch (Exception e) {
                e.printStackTrace();
            }

        });

        for (int i = 0; i < nums; i++) {
            executor.submit(new Each(barrier, (i + 1)));
        }

        executor.shutdown();
    }

    static class Each implements Runnable {
        private CyclicBarrier barrier;
        private Integer nums;
        private static final ReentrantLock lock = new ReentrantLock();

        public Each(CyclicBarrier barrier, Integer nums) {
            this.barrier = barrier;
            this.nums = nums;
        }

        @Override
        public String toString() {
            return "Each{" +
                    "barrier=" + barrier +
                    ", nums=" + nums +
                    '}';
        }

        @Override
        public void run() {

            try {
                //必须同步,不然nums可能为空;
              /*  synchronized(Each.class){
                    list.add(nums);
                }*/
                lock.lock();
                list.add(nums);
                lock.unlock();
                System.out.println(Thread.currentThread().getName() + ",nums = " + nums);
                barrier.await();
            } catch (InterruptedException e) {
                e.printStackTrace();
            } catch (BrokenBarrierException e) {
                e.printStackTrace();
            }
        }
    }

}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值