学习笔记(11):Java并发编程精讲-线程池常用队列之LinkedBlockingQueue

立即学习:https://edu.csdn.net/course/play/26270/326869?utm_source=blogtoedu

一、类属性说明

二、LinkedBlockingQueue.Node类属性说明

添加元素：

取元素：

三、源码分析：

put：

public void put(E e) throws InterruptedException {
        if (e == null) throw new NullPointerException();
        // Note: convention in all put/take/etc is to preset local var
        // holding count negative to indicate failure unless set.
        int c = -1;
        Node<E> node = new Node<E>(e);
        final ReentrantLock putLock = this.putLock;
        final AtomicInteger count = this.count;
        putLock.lockInterruptibly();
        try {
            /*
             * Note that count is used in wait guard even though it is
             * not protected by lock. This works because count can
             * only decrease at this point (all other puts are shut
             * out by lock), and we (or some other waiting put) are
             * signalled if it ever changes from capacity. Similarly
             * for all other uses of count in other wait guards.
             */
            while (count.get() == capacity) {
                // 满了的时候，就等待
                notFull.await();
            }
            // 入队列
            enqueue(node);
            c = count.getAndIncrement();
            if (c + 1 < capacity)
                notFull.signal();
        } finally {
            putLock.unlock();
        }
        if (c == 0)
            signalNotEmpty();
    }

 

四、添加-取出元素方法区别与对比