linkedblockingqueue在java中出队

public E take() throws InterruptedException {

        E x;

        int c = -1;            //设定一个记录变量

        final AtomicInteger count = this.count;     //获得count

        final ReentrantLock takeLock = this.takeLock;

        takeLock.lockInterruptibly();        //加锁

        try {

            while (count.get() == 0) {       //如果没有元素，那么就阻塞性等待

                notEmpty.await();

            }

            x = dequeue();            //一定可以拿到。

            c = count.getAndDecrement();

            if (c > 1)

                notEmpty.signal();        //报告还有元素，唤醒队列

        } finally {

            takeLock.unlock();

        }

        if (c == capacity)

            signalNotFull();           //解锁

        return x;

}