java队列,ArrayBlockingQueue

 /**添加**/
 public void put(E e) throws InterruptedException {
        checkNotNull(e);//非空检查,若为空抛异常
        final ReentrantLock lock = this.lock;//加锁
        lock.lockInterruptibly();
        try {
            while (count == items.length)
                notFull.await();//队列满了阻塞.
            insert(e);//否则添加
        } finally {
            lock.unlock();
        }
    }

private void insert(E x) {
        items[putIndex] = x;
        putIndex = inc(putIndex);
        ++count;
        notEmpty.signal();//唤醒消费线程
    }


 final int inc(int i) {//返回下一个该添加的位置,若满则从0开始
        return (++i == items.length) ? 0 : i;
    }


 /**取**/
 public E take() throws InterruptedException {
        final ReentrantLock lock = this.lock;
        lock.lockInterruptibly();
        try {
            while (count == 0)
                notEmpty.await();//没有可消费对象阻塞
            return extract();//获取
        } finally {
            lock.unlock();
        }
    }

private E extract() {
        final Object[] items = this.items;
        E x = this.<E>cast(items[takeIndex]);//获取一个强转对象
        items[takeIndex] = null;/清除容器中这个元素
        takeIndex = inc(takeIndex);//下一个可取的位置
        --count;
        notFull.signal();//唤醒生产线程
        return x;
    }