Java:ArrayBlockingQueue 与 LinkedBlockingQueue

1 . LinkedBlockingQueue ( LinkedList Implementation but not exactly JDK Implementation of LinkedList. It uses static inner class Node to maintain Links between elements )

Constructor for LinkedBlockingQueue
public LinkedBlockingQueue(int capacity) 
{
        if (capacity < = 0) throw new IllegalArgumentException();
        this.capacity = capacity;
        last = head = new Node< E >(null);   // Maintains a underlying linkedlist. ( Use when size is not known )
}

Node类用于维护Links

static class Node<E> {
    E item;
    Node<E> next;
    Node(E x) { item = x; }
}

2 .ArrayBlockingQueue(数组实现)

ArrayBlockingQueue

public ArrayBlockingQueue(int capacity, boolean fair) 
{
            if (capacity < = 0)
                throw new IllegalArgumentException();
            this.items = new Object[capacity]; // Maintains a underlying array
            lock = new ReentrantLock(fair);
            notEmpty = lock.newCondition();
            notFull =  lock.newCondition();
}

ArrayBlockingQueue 和 LinkedBlockingQueue 的最大区别从构造函数中可以清楚地看出，一个具有 Array 的底层数据结构，另一个具有 的底层数据结构链表.