生產者消費者模型——管程法

package Thread;
//測試：生產消費者模型--->利用緩衝區解決：管程法
public class PCThread {
   public static void main(String[] args) {
     SynContainer container = new SynContainer();
     new Product(container).start();
     new Consumer(container).start();
   }
}
//生產者
class Product extends Thread{
SynContainer container;
Product(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;
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{
​
   public int id;
​
   public Chicken(int i) {
     this.id = i;
   }
}
//緩衝區
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;
   }
}