| java.lang.Object | |||
| ↳ | java.util.AbstractCollection<E> | ||
| ↳ | java.util.AbstractQueue<E> | ||
| ↳ | java.util.concurrent.LinkedBlockingQueue<E> | ||
An optionally-bounded blocking queue based on linked nodes. This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time. New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue. Linked queues typically have higher throughput than array-based queues but less predictable performance in most concurrent applications.
The optional capacity bound constructor argument serves as a way to prevent excessive queue expansion. The capacity, if unspecified, is equal to MAX_VALUE. Linked nodes are dynamically created upon each insertion unless this would bring the queue above capacity.
This class implements all of the optional methods of the Collection and Iterator interfaces.
| Public Constructors | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
Creates a LinkedBlockingQueue with a capacity of
MAX_VALUE.
| |||||||||||
Creates a LinkedBlockingQueue with the given (fixed) capacity.
| |||||||||||
Creates a LinkedBlockingQueue with a capacity of
MAX_VALUE, initially containing the elements of the
given collection,
added in traversal order of the collection's iterator.
| |||||||||||
| Public Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
Removes all elements of the queue.
| |||||||||||
Removes at most the given number of available elements from
this queue and adds them into the given collection.
| |||||||||||
Removes all available elements from this queue and adds them
into the given collection.
| |||||||||||
Returns an iterator over the elements in this queue in proper sequence.
| |||||||||||
Inserts the specified element at the tail of this queue, waiting if
necessary up to the specified wait time for space to become available.
| |||||||||||
Inserts the specified element at the tail of this queue if possible,
returning immediately if this queue is full.
| |||||||||||
Gets but not removes the element in the head of the queue, or throws
exception if there is no element in the queue.
| |||||||||||
Retrieves and removes the head of this queue, waiting
if necessary up to the specified wait time if no elements are
present on this queue.
| |||||||||||
Gets and removes the element in the head of the queue, or returns null if
there is no element in the queue.
| |||||||||||
Adds the specified element to the tail of this queue, waiting if
necessary for space to become available.
| |||||||||||
Returns the number of elements that this queue can ideally (in
the absence of memory or resource constraints) accept without
blocking.
| |||||||||||
Removes the first occurrence of the specified object from this
Collection.
| |||||||||||
Returns the number of elements in this queue.
| |||||||||||
Retrieves and removes the head of this queue, waiting
if no elements are present on this queue.
| |||||||||||
Returns an array containing all elements contained in this Collection.
| |||||||||||
Returns a new array containing all elements contained in this Collection.
| |||||||||||
Returns the string representation of this Collection.
| |||||||||||
|
[Expand]
Inherited Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
From class java.util.AbstractQueue
| |||||||||||
|
From class java.util.AbstractCollection
| |||||||||||
|
From class java.lang.Object
| |||||||||||
|
From interface java.lang.Iterable
| |||||||||||
|
From interface java.util.Collection
| |||||||||||
|
From interface java.util.Queue
| |||||||||||
|
From interface java.util.concurrent.BlockingQueue
| |||||||||||
Creates a LinkedBlockingQueue with a capacity of MAX_VALUE.
Creates a LinkedBlockingQueue with the given (fixed) capacity.
| capacity | the capacity of this queue. |
|---|
| IllegalArgumentException | if capacity is not greater than zero. |
|---|
Creates a LinkedBlockingQueue with a capacity of MAX_VALUE, initially containing the elements of the given collection, added in traversal order of the collection's iterator.
| c | the collection of elements to initially contain |
|---|
| NullPointerException | if c or any element within it is null |
|---|
Removes all elements of the queue.
Removes at most the given number of available elements from this queue and adds them into the given collection. A failure encountered while attempting to add elements to collection c may result in elements being in neither, either or both collections when the associated exception is thrown. Attempts to drain a queue to itself result in IllegalArgumentException. Further, the behavior of this operation is undefined if the specified collection is modified while the operation is in progress.
| c | the collection to transfer elements into |
|---|---|
| maxElements | the maximum number of elements to transfer |
Removes all available elements from this queue and adds them into the given collection. This operation may be more efficient than repeatedly polling this queue. A failure encountered while attempting to add elements to collection c may result in elements being in neither, either or both collections when the associated exception is thrown. Attempts to drain a queue to itself result in IllegalArgumentException. Further, the behavior of this operation is undefined if the specified collection is modified while the operation is in progress.
| c | the collection to transfer elements into |
|---|
Returns an iterator over the elements in this queue in proper sequence. The returned Iterator is a "weakly consistent" iterator that will never throw ConcurrentModificationException, and guarantees to traverse elements as they existed upon construction of the iterator, and may (but is not guaranteed to) reflect any modifications subsequent to construction.
Inserts the specified element at the tail of this queue, waiting if necessary up to the specified wait time for space to become available.
| o | the element to add |
|---|---|
| timeout | how long to wait before giving up, in units of unit |
| unit | a TimeUnit determining how to interpret the timeout parameter |
| InterruptedException | if interrupted while waiting. |
|---|---|
| NullPointerException | if the specified element is null. |
Inserts the specified element at the tail of this queue if possible, returning immediately if this queue is full.
| o | the element to add. |
|---|
| NullPointerException | if the specified element is null |
|---|
Gets but not removes the element in the head of the queue, or throws exception if there is no element in the queue.
Retrieves and removes the head of this queue, waiting if necessary up to the specified wait time if no elements are present on this queue.
| timeout | how long to wait before giving up, in units of unit |
|---|---|
| unit | a TimeUnit determining how to interpret the timeout parameter |
| InterruptedException |
|---|
Gets and removes the element in the head of the queue, or returns null if there is no element in the queue.
Adds the specified element to the tail of this queue, waiting if necessary for space to become available.
| o | the element to add |
|---|
| InterruptedException | if interrupted while waiting. |
|---|---|
| NullPointerException | if the specified element is null. |
Returns the number of elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking. This is always equal to the initial capacity of this queue less the current size of this queue.
Note that you cannot always tell if an attempt to add an element will succeed by inspecting remainingCapacity because it may be the case that a waiting consumer is ready to take an element out of an otherwise full queue.
Removes the first occurrence of the specified object from this Collection. This operation traverses over the collection, looking for the specified object. Once the object is found, the object will be removed from the collection using the iterator's remove method. This collection will throw an UnsupportedOperationException if the iterator returned does not implement remove method, and the specified object is in this collection.
| o | the object to remove |
|---|
Returns the number of elements in this queue.
Retrieves and removes the head of this queue, waiting if no elements are present on this queue.
| InterruptedException |
|---|
Returns an array containing all elements contained in this Collection. If the specified array is large enough to hold the elements, the specified array is used, otherwise an array of the same type is created. If the specified array is used and is larger than this Collection, the array element following the collection elements is set to null.
| a | the array |
|---|
Returns a new array containing all elements contained in this Collection. All the elements in the array will not be referenced by the collection. The elements in the returned array will be sorted to the same order as those returned by the iterator of this collection itself if the collection guarantees the order.
Returns the string representation of this Collection. The presentation has a specific format. It is enclosed by square brackets ("[]"). Elements are separated by ', ' (comma and space).
