edu.emory.mathcs.backport.java.util.concurrent
public class LinkedBlockingQueue extends AbstractQueue implements BlockingQueue, Serializable
The optional capacity bound constructor argument serves as a way to prevent excessive queue expansion. The capacity, if unspecified, is equal to Integer#MAX_VALUE. Linked nodes are dynamically created upon each insertion unless this would bring the queue above capacity.
This class and its iterator implement all of the optional methods of the Collection and Iterator interfaces.
This class is a member of the Java Collections Framework.
Since: 1.5
Constructor Summary | |
---|---|
LinkedBlockingQueue()
Creates a LinkedBlockingQueue with a capacity of
Integer#MAX_VALUE. | |
LinkedBlockingQueue(int capacity)
Creates a LinkedBlockingQueue with the given (fixed) capacity.
| |
LinkedBlockingQueue(Collection c)
Creates a LinkedBlockingQueue with a capacity of
Integer#MAX_VALUE, initially containing the elements of the
given collection,
added in traversal order of the collection's iterator.
|
Method Summary | |
---|---|
void | clear()
Atomically removes all of the elements from this queue.
|
int | drainTo(Collection c) |
int | drainTo(Collection c, int maxElements) |
Iterator | iterator()
Returns an iterator over the elements in this queue in proper sequence.
|
boolean | offer(Object e, long timeout, TimeUnit unit)
Inserts the specified element at the tail of this queue, waiting if
necessary up to the specified wait time for space to become available.
|
boolean | offer(Object e)
Inserts the specified element at the tail of this queue if it is
possible to do so immediately without exceeding the queue's capacity,
returning true upon success and false if this queue
is full.
|
Object | peek() |
Object | poll(long timeout, TimeUnit unit) |
Object | poll() |
void | put(Object e)
Inserts the specified element at the tail of this queue, waiting if
necessary for space to become available.
|
int | remainingCapacity()
Returns the number of additional elements that this queue can ideally
(in the absence of memory or resource constraints) accept without
blocking. |
boolean | remove(Object o)
Removes a single instance of the specified element from this queue,
if it is present. |
int | size()
Returns the number of elements in this queue.
|
Object | take() |
Object[] | toArray()
Returns an array containing all of the elements in this queue, in
proper sequence.
|
Object[] | toArray(Object[] a)
Returns an array containing all of the elements in this queue, in
proper sequence; the runtime type of the returned array is that of
the specified array. |
String | toString() |
Parameters: capacity the capacity of this queue
Throws: IllegalArgumentException if capacity is not greater than zero
Parameters: c the collection of elements to initially contain
Throws: NullPointerException if the specified collection or any of its elements are null
Throws: UnsupportedOperationException {@inheritDoc } ClassCastException {@inheritDoc } NullPointerException {@inheritDoc } IllegalArgumentException {@inheritDoc }
Throws: UnsupportedOperationException {@inheritDoc } ClassCastException {@inheritDoc } NullPointerException {@inheritDoc } IllegalArgumentException {@inheritDoc }
Returns: an iterator over the elements in this queue in proper sequence
Returns: true if successful, or false if the specified waiting time elapses before space is available.
Throws: InterruptedException {@inheritDoc } NullPointerException {@inheritDoc }
add
, which can fail to
insert an element only by throwing an exception.
Throws: NullPointerException if the specified element is null
Throws: InterruptedException {@inheritDoc } NullPointerException {@inheritDoc }
Note that you cannot always tell if an attempt to insert an element will succeed by inspecting remainingCapacity because it may be the case that another thread is about to insert or remove an element.
Parameters: o element to be removed from this queue, if present
Returns: true if this queue changed as a result of the call
Returns: the number of elements in this queue
The returned array will be "safe" in that no references to it are maintained by this queue. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array.
This method acts as bridge between array-based and collection-based APIs.
Returns: an array containing all of the elements in this queue
If this queue fits in the specified array with room to spare (i.e., the array has more elements than this queue), the element in the array immediately following the end of the queue is set to null.
Like the toArray method, this method acts as bridge between array-based and collection-based APIs. Further, this method allows precise control over the runtime type of the output array, and may, under certain circumstances, be used to save allocation costs.
Suppose x is a queue known to contain only strings. The following code can be used to dump the queue into a newly allocated array of String:
String[] y = x.toArray(new String[0]);Note that toArray(new Object[0]) is identical in function to toArray().
Parameters: a the array into which the elements of the queue are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose
Returns: an array containing all of the elements in this queue
Throws: ArrayStoreException if the runtime type of the specified array is not a supertype of the runtime type of every element in this queue NullPointerException if the specified array is null