Java生产者消费者condition实现

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

public class BlockingQueue {
    public static final Queue<Apple> queue = new LinkedList<>();
    public static final Lock lock = new ReentrantLock();

    private static final Condition un_empty = lock.newCondition();
    private static final Condition un_full = lock.newCondition();
    public static void main(String[] args) {
        for (int i = 0; i < 3; i++) {
            new Thread(new Producer01(queue, un_empty, un_full, lock), i + "号生产者").start();
            new Thread(new Consumer01(queue, un_empty, un_full, lock), i + "号消费者").start();
        }


    }


}
class Apple{}
class Consumer01 implements Runnable{
    private Queue<Apple> queue;
    private Condition un_empty;
    private Condition un_full;
    private Lock lock;
    public Consumer01(Queue<Apple> queue, Condition condition, Condition condition1, Lock lock) {
        this.queue = queue;
        this.un_empty = condition;
        this.un_full = condition1;
        this.lock = lock;
    }

    @Override
    public void run() {
        while(true) {
            consume();
        }
    }

    private void consume() {
        try{
            lock.lock();
            while(queue.size() == 0) {
                un_empty.await();
            }
            queue.poll();
            System.out.println(Thread.currentThread().getName() + ":消费了一个苹果,还有" + queue.size() + "个苹果");

            un_full.signal();
            Thread.sleep(200);
        }catch(Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }
}
class Producer01 implements Runnable{
    private Queue<Apple> queue;
    private Condition un_empty;
    private Condition un_full;
    private Lock lock;
    public Producer01(Queue<Apple> queue, Condition condition, Condition condition1, Lock lock) {
        this.queue = queue;
        this.un_empty = condition;
        this.un_full = condition1;
        this.lock = lock;
    }
    @Override
    public void run() {
        while (true) {
            produce();
        }
    }
    private void produce() {
        try{
            lock.lock();
            while(queue.size() == 100) {
                System.out.println("queue已满无法添加");
                un_full.await();
            }
            queue.offer(new Apple());
            System.out.println(Thread.currentThread().getName() + ":产了一个苹果,还有" +queue.size() + "个苹果" );

            un_empty.signal();
            Thread.sleep(200);
        } catch(Exception e) {
            e.printStackTrace();
        } finally {
            lock.unlock();
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值