ArrayBlockingQueueDemo

public class ArrayBlockingQueueDemo<T> {

    private T[] items = (T[]) new Object[100];
    private int count,getIndex,putIndex = 0;

    private final ReentrantLock lock = new ReentrantLock();
    private final Condition notEmpty = lock.newCondition();
    private final Condition notFull = lock.newCondition();

    private T get(){
        lock.lock(); // 先上锁
        T obj = null;
        while(count == 0){
            try {
                notEmpty.await();
                obj = items[getIndex++];
                if(getIndex == items.length) getIndex = 0; //循环队列
                --count;
                notFull.signalAll();
            } catch (InterruptedException e) {
                e.printStackTrace();
            } finally {
                lock.unlock();
            }
        }
        return obj;
    }

    public void put(T t){
        lock.lock();
        while(count == items.length){
            try {
                notFull.await();
                items[putIndex++] = t;
                if(putIndex == items.length) putIndex = 0;
                ++count;
                notEmpty.signalAll();
            } catch (InterruptedException e) {
                e.printStackTrace();
            } finally {
                lock.unlock();
            }
        }
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值