创建两个线程,很基础的生产者消费者
package lock;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
/**
* @author Mr.Zhao
* @Description: 共享资源类
* @date 2019/12/26 19:26
* @version 1.0
*/
class ShareDate {
private int number = 0;
private Lock lock = new ReentrantLock();
private Condition condition = lock.newCondition();
/**
* @author Mr.Zhao
* @Description: 资源类加一
* @date 2019/12/26 19:28
* @version 1.0
*/
public void increment(){
lock.lock();
try {
while (number != 0) {
condition.await();
}
number++;
System.out.println(Thread.currentThread().getName() + "\t生产:" + number);
condition.signalAll();
} catch (Exception e) {
e.printStackTrace();
} finally {
lock.unlock();
}
}
/**
* @author Mr.Zhao
* @Description: 资源类减一
* @date 2019/12/26 19:28
* @version 1.0
*/
public void decrement(){
lock.lock();
try {
while (number == 0) {
condition.await();
}
number--;
System.out.println(Thread.currentThread().getName() + "\t消费:" + number);
condition.signalAll();
} catch (Exception e) {
e.printStackTrace();
} finally {
lock.unlock();
}
}
}
/**
* @author Mr.Zhao
* @version 1.0
* @Description: 传统生产者消费者模式消息队列
* @date 2019/12/26 19:06
*/
public class ProdConsumer_TraditionDemo {
public static void main(String[] args) {
ShareDate shareDate = new ShareDate();
new Thread(() -> {
for (int i = 0; i < 5; i++) {
shareDate.increment();
}
}, "厨师").start();
new Thread(() -> {
for (int i = 0; i < 5; i++) {
shareDate.decrement();
}
}, "顾客").start();
}
}