Java：实现简单的阻塞队列

来源：互联网发布：点卡商城源码编辑：程序博客网时间：2024/06/06 01:09

JDK中自带ArrayBlockingQueue、ListBlockingQueue等阻塞的队列。我们也可以认为自己实现一个。

public class BlockQueue<T> {    // push的锁    private final static Object pushLock = new Object();    // pop的锁    private final static Object popLock = new Object();    // 存储数据    private Stack<T> stack;    public BlockQueue() {        stack = new Stack<>();    }    public synchronized void push(T t) {        int MAX_SIZE = 3;        if (stack.size() >= MAX_SIZE) {            // 超过了最大长度，那么就等待            pushLock();        }        stack.push(t);        // 解开pop的锁        popUnlock();    }    public T pop() {        if (stack.size() == 0) {            // 不能pop，那么就等待            popLock();        }        T t = stack.pop();        // 解开push的锁        pushUnlock();        return t;    }    // push锁    private void pushLock() {        synchronized (pushLock) {            try {                pushLock.wait();            } catch (InterruptedException e) {                e.printStackTrace();            }        }    }    // 解开push锁    private void pushUnlock() {        synchronized (pushLock) {            pushLock.notify();        }    }    // pop锁    private void popLock() {        synchronized (popLock) {            try {                popLock.wait();            } catch (InterruptedException e) {                e.printStackTrace();            }        }    }    // 解开pop锁    private void popUnlock() {        synchronized (popLock) {            popLock.notify();        }    }}

阅读全文

0 0