java生产者消费者 阻塞_java 用阻塞队列实现生产者消费者

package com.lb;

import java.util.concurrent.ArrayBlockingQueue;

import java.util.concurrent.BlockingQueue;

public class ProductConsumer {

private BlockingQueue queue = null;

private boolean flag = true;

public static void main(String[] args) {

// TODO Auto-generated method stub

new ProductConsumer().test();

}

public void test() {

Product product = new Product(queue);

Consumer consumer = new Consumer(queue);

Thread p = new Thread(product);

Thread c = new Thread(consumer);

p.start();

c.start();

}

public ProductConsumer() {

queue = new ArrayBlockingQueue<>(1);

}

class Product implements Runnable {

private BlockingQueue queue = null;

public Product(BlockingQueue queue) {

// TODO Auto-generated constructor stub

this.queue = queue;

}

@Override

public void run() {

// TODO Auto-generated method stub

while (flag) {

try {

Thread.sleep(1000);

} catch (InterruptedException e) {

// TODO Auto-generated catch block

e.printStackTrace();

}

String n = String.valueOf((int) (Math.random() * 10));

try {

queue.put(n);

System.out.println("生产了 " + n);

} catch (InterruptedException e) {

// TODO Auto-generated catch block

e.printStackTrace();

}

}

}

}

class Consumer implements Runnable {

private BlockingQueue queue = null;

public Consumer(BlockingQueue queue) {

// TODO Auto-generated constructor stub

this.queue = queue;

}

@Override

public void run() {

// TODO Auto-generated method stub

while (flag) {

try {

Thread.sleep(4000);

System.out.println("消费了 " + queue.take());

} catch (InterruptedException e) {

// TODO Auto-generated catch block

e.printStackTrace();

}

}

}

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值