java线程生产者消费者

public class Thread_04_ProducerConsumer {

	public static void main(String[] args) {
		SynStack ss = new SynStack();
		Thread t1 = new Thread(new Producer(ss));
		Thread t2 = new Thread(new Consumer(ss));
		t1.start();
		t2.start();
	}
}
class Producer implements Runnable{
	private SynStack ss = null;
	
	public Producer(SynStack ss) {
		super();
		this.ss = ss;
	}

	@Override
	public void run() {
		for (int i = 0; i < 26; i++) {
			ss.push((char)('a'+i));
		}
	}
}
class Consumer implements Runnable{
	private SynStack ss = null;
	
	public Consumer(SynStack ss) {
		super();
		this.ss = ss;
	}

	@Override
	public void run() {
		for (int i = 0; i < 26; i++) {
			try {
				Thread.sleep(1010);
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
			ss.pop();
		}
	}
}
class SynStack{
	// 缓冲区
	private char[] data = new char[6];
	// 已有元素个数
	private int count = 0;
	
	public synchronized void push(char ch){
		// 唤醒消费
		this.notifyAll();
		// 判断是否生产满了
		if (count == data.length) {
			// 满了就不生产了
			try {
				this.wait();
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
		}
		data[count] = ch;
		count++;
		System.out.println("生产了:"+ch+",容器中有:"+count+"个元素");
	}
	public synchronized char pop(){
		this.notifyAll();
		char ch ;
		// 判断是否还有元素
		if (count == 0) {
			try {
				this.wait();
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
		}
		count--;
		ch = data[count];
		System.out.println("消费了:"+ch+",容器中有:"+count+"个元素");
		return ch;
	}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值