Condtion实现生产者消费者通信

本文探讨了并发编程中的核心概念,通过实现一个简单的线程池实例,演示了如何高效地管理多个线程,同时确保数据的一致性和正确性。重点介绍了线程池的工作原理、任务调度和资源复用策略。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

  public void testCondtion() {
        final Lock lock = new ReentrantLock();
        final Condition isEmpty = lock.newCondition();
        final Condition isFull = lock.newCondition();

        final List<Integer> list = new CopyOnWriteArrayList<Integer>();
        final int listSize = 20;
        ExecutorService putService = Executors.newCachedThreadPool();
        for (int i = 0 ; i < 100; i ++) {
//            System.out.println("放入");
            putService.submit(
                    new Runnable() {
                        @Override
                        public void run() {
                            while (true) {
                                lock.lock();
                                try{
                                    while (list.size() == listSize) {
                                        try {
//                                            System.out.println("满了");
                                            isFull.await();
                                        } catch (InterruptedException e) {
                                            e.printStackTrace();
                                        }
                                    }
                                    try {
                                        TimeUnit.SECONDS.sleep(new Random(3).nextInt());
                                    } catch (InterruptedException e) {
                                        e.printStackTrace();
                                    }
                                    list.add(new Random().nextInt(1000));
                                    isEmpty.signal();
                                } finally {
                                    lock.unlock();
                                }

                            }

                        }
            });
        }

        ExecutorService getService = Executors.newCachedThreadPool();
        for (int i = 0 ; i < 10 ; i ++) {
//            System.out.println("取出");
            getService.submit(
                    new Runnable() {
                        @Override
                        public void run() {
                            while (true) {
                                lock.lock();
                                try{
                                    while (list.isEmpty()) {
//                                        System.out.println("空了");
                                        try {
                                            isEmpty.await();
                                        } catch (InterruptedException e) {
                                            e.printStackTrace();
                                        }
                                    }
                                    try {
                                        TimeUnit.SECONDS.sleep(new Random(3).nextInt());
                                    } catch (InterruptedException e) {
                                        e.printStackTrace();
                                    }
                                    list.remove(0);
                                    isFull.signal();
                                } finally {
                                    lock.unlock();
                                }

                            }

                        }
                    });
        }

        putService.shutdown();
        getService.shutdown();

        while (true) {
            System.out.println(list.size() + "    " +  list.toString() );
            try {
                Thread.sleep(1000);
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }

    }

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值