生产者消费模型-管程法
去博客设置页面,选择一款你喜欢的代码片高亮样式,下面展示同样高亮的 代码片
.
package com.nikekun.mianshi.create;
/**
* @version 1.0
* @auther wukun
* @date 2021/10/27 22:52
* 测试生产消费者模型 --》利用缓存区解决:管程法
*/
public class TestPC {
public static void main(String[] args) {
SynContainer container=new SynContainer();
new Producer(container).start();
new Consumer(container).start();
}
}
//生产者
class Producer extends Thread{
SynContainer container;
public Producer(SynContainer container) {
this.container = container;
}
//生产
@Override
public void run() {
for (int i = 0; i <= 100; i++) {
container.push(new Chicken(i));
System.out.println("生产了"+i+"只鸡");
}
}
}
//消费者
class Consumer extends Thread{
SynContainer container;
public Consumer(SynContainer container) {
this.container = container;
}
@Override
public void run() {
for (int i = 0; i <= 100; i++) {
System.out.println("消费了第"+container.pop().id+"只鸡");
}
}
}
//产品
class Chicken{
int id;
public Chicken(int id) {
this.id = id;
}
}
//缓冲区
class SynContainer{
//需要一个固定的容器大小
Chicken[] chickens=new Chicken[10];
//容器计数器
int count=0;
//生产者放入产品
public synchronized void push(Chicken chicken){
//容器满了,等待消费者消费
if(count==chickens.length){
//通知消费者消费,生产等待
try {
this.wait();
}catch (InterruptedException e){
e.printStackTrace();
}
}
//如果容器没有满,丢入产品
chickens[count]=chicken;
count++;
//通知消费者消费
this.notifyAll();
}
//生产者放入产品
public synchronized Chicken pop(){
//容器满了,等待消费者消费
if(count==0){
//通知生产者生产,消费者等待
try {
this.wait();
}catch (InterruptedException e){
e.printStackTrace();
}
}
//如果可以消费
count--;
Chicken chicken= chickens[count];
//生产者生产
this.notifyAll();
return chicken;
}
}
;