PriorityBlockingQueue JDK 1.6)

Methods

Hide/Show inherited methods

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

Inserts the specified element into this priority queue.

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 Comparator<Object> comparator ()

Returns the comparator used to order the elements in this queue, or null if this queue uses the natural ordering of its elements.

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

Returns true if this queue contains the specified element.

Returns true if this queue contains the specified element.
More formally, returns true if and only if this queue contains
at least one element e such that o.equals(e).
Returns: true if this queue contains the specified element
Parameters:
- o - object to be checked for containment in this queue

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.

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.

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

Inserts the specified element into this priority queue.

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

Inserts the specified element into this priority queue.

public E peek ()

public E poll ()

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

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

Inserts the specified element into this priority queue.

public int remainingCapacity () [Specified in BlockingQueue]

Always returns Integer.MAX_VALUE because a PriorityBlockingQueue is not capacity constrained.

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.

Removes a single instance of the specified element from this queue,
if it is present. More formally, removes an element e such
that o.equals(e), if this queue contains one or more such
elements. Returns true if and only if this queue contained
the specified element (or equivalently, if this queue changed as a
result of the call).
Returns: true if this queue changed as a result of the call
Parameters:
- o - element to be removed from this queue, if 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).

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]

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

public Object toArray () [Overrides AbstractCollection]

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

public T toArray ( T a) [Overrides AbstractCollection]

Returns an array containing all of the elements in this queue; the runtime type of the returned array is that of the specified array.

Returns an array containing all of the elements in this queue; the runtime type of the returned array is that of the specified array. The returned array elements are in no particular order. 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 PriorityBlockingQueue.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]