ArrayBlockingQueue JDK 1.6)

Methods

public boolean add ( E e) [Overrides AbstractQueue] [Specified in BlockingQueue]

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 throwing an IllegalStateException if this queue is full.

public boolean addAll (Collection<Object> c) [Inherited From AbstractQueue]

Adds all of the elements in the specified collection to this queue.

public void clear () [Overrides AbstractQueue]

Atomically removes all of the elements from this queue.

public boolean contains (Object o) [Overrides AbstractCollection] [Specified in BlockingQueue]

Returns true if this queue contains the specified element.

public boolean containsAll (Collection<Object> c) [Inherited From AbstractCollection]

Returns true if this collection contains all of the elements in the specified collection.

public int drainTo (Collection<Object> c) [Specified in BlockingQueue]

public int drainTo (Collection<Object> c, int maxElements) [Specified in BlockingQueue]

public E element () [Inherited From AbstractQueue]

Retrieves, but does not remove, the head of this queue.

pack-privatefinal int inc (int i)

Circularly increment i.

public boolean isEmpty () [Inherited From AbstractCollection]

Returns true if this collection contains no elements.

public Iterator< E> iterator () [Specified in AbstractCollection]

Returns an iterator over the elements in this queue in proper sequence.

public boolean offer ( E e) [Specified in BlockingQueue]

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.

public boolean offer ( E e, long timeout, TimeUnit unit) throws InterruptedException [Specified in BlockingQueue]

Inserts the specified element at the tail of this queue, waiting up to the specified wait time for space to become available if the queue is full.

public E peek ()

public E poll ()

public E poll (long timeout, TimeUnit unit) throws InterruptedException [Specified in BlockingQueue]

public void put ( E e) throws InterruptedException [Specified in BlockingQueue]

Inserts the specified element at the tail of this queue, waiting for space to become available if the queue is full.

public int remainingCapacity () [Specified in BlockingQueue]

Returns the number of additional elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking.

public E remove () [Inherited From AbstractQueue]

Retrieves and removes the head of this queue.

public boolean remove (Object o) [Overrides AbstractCollection] [Specified in BlockingQueue]

Removes a single instance of the specified element from this queue, if it is present.

public boolean removeAll (Collection<Object> c) [Inherited From AbstractCollection]

Removes all of this collection's elements that are also contained in the specified collection (optional operation).

pack-private void removeAt (int i)

Utility for remove and iterator.remove: Delete item at position i.

public boolean retainAll (Collection<Object> c) [Inherited From AbstractCollection]

Retains only the elements in this collection that are contained in the specified collection (optional operation).

public int size () [Specified in AbstractCollection]

Returns the number of elements in this queue.

public E take () throws InterruptedException [Specified in BlockingQueue]

public Object toArray () [Overrides AbstractCollection]

Returns an array containing all of the elements in this queue, in proper sequence.

public T toArray ( T a) [Overrides AbstractCollection]

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.

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. If the queue fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of 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 ArrayBlockingQueue.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().
Returns: an array containing all of the elements in this queue
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
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

public String toString () [Overrides AbstractCollection]