package com.atguigu.mianshi;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicInteger;
/**
* @author zzyuan
* @date 2021/11/2 - 20:04
*/
public class ProdConsumerBlockQueueDemo {
public static void main(String[] args) {
MySource mySource = new MySource(new ArrayBlockingQueue<>(10));
new Thread(() -> {
System.out.println(Thread.currentThread().getName() + "生产线程启动");
try{
mySource.myProd();
}catch (Exception e){
e.printStackTrace();
}
},"prod").start();
new Thread(() -> {
System.out.println(Thread.currentThread().getName() + "消费线程启动");
try{
mySource.myConsumer();
}catch (Exception e){
e.printStackTrace();
}
},"consumer").start();
try {
TimeUnit.SECONDS.sleep(5);
} catch (InterruptedException e) {
e.printStackTrace();
}
System.out.println();
System.out.println();
System.out.println("准备停止线程");
mySource.stop();
}
}
class MySource{
private volatile boolean flag = true;
private AtomicInteger atomicInteger = new AtomicInteger();
BlockingQueue<String> blockingQueue = null;
public MySource(BlockingQueue<String> blockingQueue) {
this.blockingQueue = blockingQueue;
System.out.println(blockingQueue.getClass().getName());
}
public void myProd() throws Exception {
String data = null;
boolean retValue;
while (flag){
data = atomicInteger.incrementAndGet() + "";
retValue = blockingQueue.offer(data,2L, TimeUnit.SECONDS);
if(retValue){
System.out.println(Thread.currentThread().getName() + "\t 插入队列" + data + "成功");
}else {
System.out.println(Thread.currentThread().getName() + "\t 插入队列" + data + "失败");
}
TimeUnit.SECONDS.sleep(1);
}
System.out.println(Thread.currentThread().getName() + "停止 , 因为 : flag=false " );
}
public void myConsumer() throws Exception {
String result = null;
while(flag){
result = blockingQueue.poll(2L, TimeUnit.SECONDS);
if(result == null){
flag = false;
System.out.println(Thread.currentThread().getName() + "超过2s没有取到物品 , 消费线程退出" );
return;
}
System.out.println(Thread.currentThread().getName() + "消费队列" + result +"成功");
}
}
public void stop() {
this.flag = false;
}
}
线程通信之消费者生产者(使用阻塞队列)
最新推荐文章于 2024-07-30 20:50:32 发布