import java.util.LinkedList; import java.util.concurrent.TimeUnit; import java.util.concurrent.atomic.AtomicInteger;public class MyQueue {//1 需要一個承裝元素的集合 private LinkedList<Object> list = new LinkedList<Object>();//2 需要一個計數(shù)器private AtomicInteger count = new AtomicInteger(0);//3 需要指定上限和下限private final int minSize = 0;private final int maxSize ;//4 構(gòu)造方法public MyQueue(int size){this.maxSize = size;}//5 初始化一個對象 用于加鎖private final Object lock = new Object();//put(anObject): 把anObject加到BlockingQueue里,如果BlockQueue沒有空間,則調(diào)用此方法的線程被阻斷，直到BlockingQueue里面有空間再繼續(xù).public void put(Object obj){synchronized (lock) {while(count.get() == this.maxSize){try {lock.wait();} catch (InterruptedException e) {e.printStackTrace();}}//1 加入元素list.add(obj);//2 計數(shù)器累加count.incrementAndGet();//3 通知另外一個線程（喚醒）lock.notify();System.out.println("新加入的元素為:" + obj);}}//take: 取走BlockingQueue里排在首位的對象,若BlockingQueue為空,阻斷進入等待狀態(tài)直到BlockingQueue有新的數(shù)據(jù)被加入.public Object take(){Object ret = null;synchronized (lock) {while(count.get() == this.minSize){try {lock.wait();} catch (InterruptedException e) {e.printStackTrace();}}//1 做移除元素操作ret = list.removeFirst();//2 計數(shù)器遞減count.decrementAndGet();//3 喚醒另外一個線程lock.notify();}return ret;}public 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("當(dāng)前容器的長度:" + mq.getSize());Thread t1 = new Thread(new Runnable() {@Overridepublic void run() {mq.put("f");mq.put("g");}},"t1");t1.start();Thread t2 = new Thread(new Runnable() {@Overridepublic 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();}}

?

總結(jié)

以上是生活随笔為你收集整理的queue模拟的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。