模拟阻塞的queue
import java.util.LinkedList;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicInteger;
public class Myqueue {
// 1 需要一个集合 是装元素的
private final LinkedList<Object> list = new LinkedList<Object>();
// 2 在这里需要计数器 统计加入list的个数
private AtomicInteger count = new AtomicInteger(0);
// 3需要制定上线和下线的容量
private final int minsize = 0;
private final int maxsize;
// 构造方法初始化maxsize
public Myqueue(int size) {
this.maxsize = size;
}
// 初始化一个额object对象 用于枷锁
private final Object lock = new Object();
public void put(Object object) {
synchronized (lock) {
// 如果list满了就等待(阻塞 )
while (count.get() == this.maxsize) {
try {
lock.wait();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
// 如果不满就给list添加元素
list.add(object); // 1 加入元素
count.incrementAndGet(); // 2 加一个元素 加一个计数器
lock.notify(); // 3 通知另外一个线程
System.out.println("新加入的元素:" + object);
}
}
public Object take() {
Object object = null;
synchronized (lock) {
while (count.get() == this.minsize) {
try {
lock.wait(); // 元素为空的话就处于等待(阻塞)
} catch (InterruptedException e) {
e.printStackTrace();
}
}
// 1 移除第一个元素操作(先进先出原则)
object = list.removeFirst();
// 2 计数器递减
count.decrementAndGet();
// 3 唤醒另外一个线程
lock.notify();
}
return object;
}
// 返回当前容器的个数
private int getSize() {
return this.count.get();
}
public static void main(String[] args) {
final Myqueue mq = new Myqueue(5);
mq.put("a");
mq.put("b");
mq.put("c");
mq.put("d");
mq.put("e");
System.out.println("当前容器的长度:" + mq.getSize());
Thread t1 = new Thread(new Runnable() {
@Override
public void run() {
mq.put("f");
mq.put("g");
}
}, "t1");
t1.start();
Thread t2 = new Thread(new Runnable() {
@Override
public void run() {
Object o1 = mq.take();
System.out.println("移除的元素为:" + o1);
Object o2 = mq.take();
System.out.println("移除的元素为:" + o2);
}
}, "t2");
try {
TimeUnit.SECONDS.sleep(2);
} catch (InterruptedException e) {
e.printStackTrace();
}
t2.start();
}
}