java Lock实现生产者 消费者 模式 实例教程 (强烈推荐)

话不多说,直接上代码;
github代码地址

数量

package com.pattern.productorconsumer.lock;

/**
 * 数量
 */
public class CountNum {

    private Integer count;

    public Integer getCount() {
        return count;
    }

    public void setCount(Integer count) {
        this.count = count;
    }
}

生产者

package com.pattern.productorconsumer.lock;

/**
 * 生产者
 */
public class Product {

    private CountNum countNum;

    private final Object lock;

    public Product(CountNum countNum, Object lock){
        super();
        this.countNum = countNum;
        this.lock = lock;
    }

    public void Produce(){
        synchronized (lock){
            if (countNum.getCount() < 5){
                try {
                    Thread.sleep(500);
                }catch (Exception e){
                    e.printStackTrace();
                }
                countNum.setCount(countNum.getCount() + 1);
                System.out.println(Thread.currentThread().getName() + "生产+1,当前count:" + countNum.getCount());
                lock.notifyAll();// 很重要
            }else {
                try {
                    lock.wait();
                }catch (Exception e){
                    e.printStackTrace();
                }
            }
        }
    }

}

消费者

package com.pattern.productorconsumer.lock;

/**
 * 消费者
 */
public class Consumer {

    private CountNum countNum;

    private final Object lock;

    public Consumer(CountNum countNum, Object lock){
        super();
        this.countNum = countNum;
        this.lock = lock;
    }

    public void Consume(){
        synchronized (lock){
            if (countNum.getCount() > 0){
                try {
                    Thread.sleep(500);
                    countNum.setCount(countNum.getCount() - 1);
                    System.out.println(Thread.currentThread().getName() + "消费-1,当前count:" + countNum.getCount());
                    lock.notifyAll();
                }catch (Exception e){
                    e.printStackTrace();
                }
            }else {
                try {
                    lock.wait();
                }catch (Exception e){
                    e.printStackTrace();
                }
            }
        }
    }
}

主程序

package com.pattern.productorconsumer.lock;

/**
 * lock 实现 生产者 消费者 模式
 */
public class ProductAndConsumerPattern {

    public static void main(String[] args) {
        CountNum countNum = new CountNum();
        countNum.setCount(0);
        Object lock = new Object();
        Product product = new Product(countNum,lock);
        Consumer consumer = new Consumer(countNum,lock);
        Thread[] pThread = new Thread[2];
        Thread[] cThread = new Thread[2];
        for (int i = 0; i < 2; i++) {
            pThread[i] = new Thread(() -> {
                while (true) {
                    product.Produce();
                }
            }, "生产者:" + (i + 1));
            cThread[i] = new Thread(() -> {
                while (true) {
                    consumer.Consume();
                }
            }, "消费者:" + (i + 1));
        }

        for (int i = 0;i < 2;i++){
            pThread[i].start();
            cThread[i].start();
        }
    }
}

执行结果:

在这里插入图片描述

总结:

1.加锁,防止高并发导致数量紊乱;
2.notifyall,多对多 不能使用notify,否则会死锁。

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
下面是一个使用Lock实现生产者队列和消费者队列的相互唤醒沉睡的线程同步案例: ```java 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 ProducerConsumerLockExample { private static final int CAPACITY = 5; private final Queue<Integer> queue = new LinkedList<>(); private final Lock lock = new ReentrantLock(); private final Condition notEmpty = lock.newCondition(); private final Condition notFull = lock.newCondition(); public static void main(String[] args) { ProducerConsumerLockExample example = new ProducerConsumerLockExample(); Thread producer = new Thread(() -> { try { example.produce(); } catch (InterruptedException e) { e.printStackTrace(); } }); Thread consumer = new Thread(() -> { try { example.consume(); } catch (InterruptedException e) { e.printStackTrace(); } }); producer.start(); consumer.start(); } private void produce() throws InterruptedException { while (true) { lock.lock(); try { while (queue.size() == CAPACITY) { System.out.println("Queue is full, waiting"); notFull.await(); } int value = (int) (Math.random() * 100); System.out.println("Produced " + value); queue.add(value); notEmpty.signalAll(); } finally { lock.unlock(); } } } private void consume() throws InterruptedException { while (true) { lock.lock(); try { while (queue.isEmpty()) { System.out.println("Queue is empty, waiting"); notEmpty.await(); } Integer value = queue.remove(); System.out.println("Consumed " + value); notFull.signalAll(); } finally { lock.unlock(); } } } } ``` 在该示例中,我们创建了一个具有固定容量的队列,当生产者向队列添加元素时,如果队列已满,则生产者线程会等待,直到消费者消耗了一些元素并释放了空间。另一方面,当消费者从队列中删除元素时,如果队列为空,则消费者线程将等待,直到生产者添加了一些元素并通知消费者。 这里使用了Lock锁和Condition对象来实现线程同步。其中,notEmpty和notFull条件变量分别用于通知消费者队列非空和生产者队列非满。当队列为空时,消费者线程调用notEmpty.await()方法来等待;当队列已满时,生产者线程调用notFull.await()方法来等待。当生产者向队列中添加元素时,调用notEmpty.signalAll()方法来通知消费者队列非空;当消费者从队列中删除元素时,调用notFull.signalAll()方法来通知生产者队列非满。

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值