经典的生产者消费者模型(二)

package com.zzj.concurrency;

import java.util.LinkedList;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

public class ProducerConsumerModel2 {

	private final LinkedList<String> queue = new LinkedList<>(); 
	private final int max = 3;
	
	private Lock lock = new ReentrantLock();
	private Condition producer = lock.newCondition();
	private Condition consumer = lock.newCondition();
	
	public void put(String e) {
		try {
			lock.lock();
			while(queue.size() == max){ // 此处不能用if判断
				producer.await();
			}
			
			queue.add(e);
			consumer.signalAll(); // 通知消费者消费
		} catch (InterruptedException e1) {
			e1.printStackTrace();
		} finally {
			lock.unlock();
		}
	}
	
	public String get(){
		String r = null;
		try {
			lock.lock();
			while(queue.size() == 0){ // 此处不能用if判断
				consumer.await();
			}
			
			r = queue.removeFirst();
			producer.signalAll(); // 通知生产者生产
		} catch (InterruptedException e) {
			e.printStackTrace();
		} finally {
			lock.unlock();
		}
		return r;
	}
	
	public static void main(String[] args) {
		final ProducerConsumerModel2 model = new ProducerConsumerModel2();
		
		// 启动5生产者
		for (int i = 0; i < 5; i++) {
			new Thread(new Runnable() {
				public void run() {
					for(int j = 0; j < 10; j++){
						model.put(Thread.currentThread().getName() + "-" + j);
					}
				}
			}, "producer-" + i).start();
		}
		
		// 启动10消费者
		for (int i = 0; i < 10; i++) {
			new Thread(new Runnable() {
				public void run() {
					for(int j = 0; j < 5; j++){
						System.out.println(model.get());
					}
				}
			}, "consumer-" + i).start();
		}

	}

}

输出结果:

producer-0-0
producer-3-0
producer-3-1
producer-3-2
producer-3-3
producer-0-1
producer-3-4
producer-4-0
producer-4-1
producer-4-2
producer-1-0
producer-1-2
producer-1-1
producer-1-3
producer-3-5
producer-3-6
producer-0-2
producer-4-3
producer-4-4
producer-4-5
producer-1-4
producer-1-6
producer-1-5
producer-1-7
producer-0-3
producer-3-7
producer-0-4
producer-4-6
producer-1-8
producer-1-9
producer-3-8
producer-0-5
producer-2-0
producer-3-9
producer-0-6
producer-0-7
producer-0-8
producer-0-9
producer-2-1
producer-2-2
producer-2-3
producer-4-8
producer-4-9
producer-2-4
producer-4-7
producer-2-5
producer-2-6
producer-2-7
producer-2-8
producer-2-9




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值