BlockingQueue:一个支持阻塞机制的队列,阻塞的放入和得到数据。
import java.util.LinkedList;
import java.util.concurrent.atomic.AtomicInteger;
public class MyQueue {
//1.需要一个承装元素的集合,插入删除多的情况使用LinkedList
private LinkedList<Object> list = new LinkedList<>();
//2.需要一个计数器。原本是int count,但后面会有count++这个非原子性操作,使用AtomicInteger保证了count的原子性,对应了count.incrementAndGet()。
private AtomicInteger count = new AtomicInteger(0);
//3.需要制定上限和下线
private final int minSize = 0;
private final int maxSize;
//4.构造方法
public MyQueue(int size){
this.maxSize = size;
}
//5.初始化一个对象用于加锁
private Object lock = new Object();
//put(anObject):把anObject加到BlockingQueue里,如果BlokQueue没有空间,则调用此方法线程被阻断
public void put(Object obj){
synchronized(lock){
if(count.get() == this.maxSize){
try {
System.out.println("放入操作开始等待中~");
lock.wait();
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
//1.加入元素
list.add(obj);
//2.计数器累加
count.incrementAndGet();
System.out.println("新增一个元素:" + obj);
//3.通知另外一个线程(唤醒)
lock.notify();
}
}
public Object take(){
Object ref = null;
synchronized(lock){
if(count.get() == this.minSize){
try {
System.out.println("取出操作开始等待");
lock.wait();
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
//1.移除元素操作
ref = list.removeFirst();
//2.计数器递减
count.decrementAndGet();
System.out.println("移除一个元素:" + ref);
//3.唤醒另一个线程
lock.notify();
}
return ref;
}
public static void main(String args[]) throws InterruptedException{
final MyQueue mq = new MyQueue(5);
mq.put("a");
mq.put("b");
mq.put("c");
mq.put("d");
mq.put("e");
Thread t1 = new Thread(new Runnable(){
@Override
public void run() {
mq.put("f");
mq.put("g");
}
});
Thread t2 = new Thread(new Runnable(){
@Override
public void run() {
Object o1 = mq.take();
Object o2 = mq.take();
}
});
t1.start();
Thread.sleep(1000);
t2.start();
}
}