阻塞队列

生产者消费者模式传统版

/**
 * @author xixing
 * @version 1.0
 * @date 2020/7/3 19:57
 */
public class ProdConsumeTranditionalDemo {

    public static void main(String[] args) {

        ShareData shareData=new ShareData();
        for(int i=0;i<10;i++){
            new Thread(()->{
                shareData.increment();
                System.out.println(Thread.currentThread().getName()+"\t 生产成功！");
            },String.valueOf(i)).start();
        }
        for(int i=0;i<10;i++){
            new Thread(()->{
                shareData.decrement();
                System.out.println(Thread.currentThread().getName()+"\t 消费成功！");
            },String.valueOf(i)).start();
        }

    }
}

class ShareData{
    private Integer num=0;
    private Lock lock=new ReentrantLock();
    private Condition condition=lock.newCondition();

    public void increment(){
        lock.lock();
        try{
            while (num!=0){//不能用if，防止虚假唤醒
                condition.await();
            }
            num++;
            System.out.println(Thread.currentThread().getName()+"\t"+num);
            condition.signalAll();
        } catch (InterruptedException e) {
            e.printStackTrace();
        } finally{
            lock.unlock();
        }
    }
    public void decrement(){
        lock.lock();
        try{
            while (num==0){
                condition.await();
            }
            num--;
            System.out.println(Thread.currentThread().getName()+"\t"+num);
            condition.signalAll();
        } catch (InterruptedException e) {
            e.printStackTrace();
        } finally{
            lock.unlock();
        }
    }
}