多线程：生产者和消费者模式（管程法）

package usi.dbdp.SalesOrder.controller;
//生产者和消费者--->管程法

//生产者、消费者、产品、缓冲区
public class PCTest {
	public static void main(String[] args) {
		SynContainer container = new SynContainer();
		new Product(container).start();
		new Consumer(container).start();
	}
}
//生产者
class Product extends Thread{
	SynContainer container;
	public Product(SynContainer container) {
		this.container = container;
	}
	@Override
	public void run() {
		for (int i = 1; i <= 100; i++) {
			System.out.println("生产了第"+i+"只鸡");
			container.push(new Chicken(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;
	}
}