利用阻塞队列BlockingDeque实现生产者-消费者模式

最新推荐文章于 2024-04-22 11:16:05 发布

lchina1314

最新推荐文章于 2024-04-22 11:16:05 发布

阅读量314

点赞数

分类专栏：并发编程文章标签： java BlockingDeque 并发编程生产者消费者

本文链接：https://blog.csdn.net/lchina1314/article/details/84359664

版权

并发编程专栏收录该内容

4 篇文章 0 订阅

订阅专栏


import java.util.concurrent.BlockingDeque;
import java.util.concurrent.LinkedBlockingDeque;

/**
 * 消费者类
 * */
public class Consumer implements Runnable {
	private BlockingDeque<String> queue = new LinkedBlockingDeque<String>();

	public Consumer(BlockingDeque<String> queue){
		this.queue = queue;
	}
	@Override
	public void run() {
		// TODO Auto-generated method stub
		int i = 0;
			do{
				try {
					String product = queue.take();
					if(!"".equals(product) && null != product){
						System.out.println("消费者-:"+product);
						i++;
					}
				} catch (InterruptedException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}

			}while(i < 50);
		}
}


import java.util.concurrent.BlockingDeque;
import java.util.concurrent.LinkedBlockingDeque;
/**
 * 生产者类
 * */

public class Producer implements Runnable {
	private BlockingDeque<String> queue = new LinkedBlockingDeque<String>();

	public Producer(BlockingDeque<String> queue){
		this.queue = queue;
	}
	@Override
	public void run() {
		// TODO Auto-generated method stub
		for(int i=0; i < 50; i++){
			try {
				System.out.println("生产者-Product"+i);
				queue.put("Prodect:"+i);
			} catch (InterruptedException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
	}

}


import java.util.concurrent.BlockingDeque;
import java.util.concurrent.LinkedBlockingDeque;

/**
 * 测试类
 * */
public class BlockingQueueTest {

	private static BlockingDeque<String> queue = new LinkedBlockingDeque<String>();

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Producer producer = new Producer(queue);
		Consumer cusumer = new Consumer(queue); 
		new Thread(cusumer).start();
		new Thread(producer).start();
	}
}