public class BoundedPriorityBlockingQueue<E> extends AbstractQueue<E> implements BlockingQueue<E>
| Constructor and Description |
|---|
BoundedPriorityBlockingQueue(int capacity) |
BoundedPriorityBlockingQueue(int capacity,
Comparator<? super E> comparator) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Atomically removes all of the elements from this queue.
|
Comparator<? super E> |
comparator()
Returns the comparator used to order the elements in this queue, or
null if this queue uses the natural
ordering of its elements.
|
boolean |
contains(Object o)
Returns
true if this queue contains the specified element. |
int |
drainTo(Collection<? super E> c) |
int |
drainTo(Collection<? super E> c,
int maxElements) |
Iterator<E> |
iterator()
Returns an iterator over the elements in this queue.
|
boolean |
offer(E e)
Inserts the specified element into this priority queue.
|
boolean |
offer(E e,
long timeout,
TimeUnit unit) |
E |
peek() |
E |
poll() |
E |
poll(long timeout,
TimeUnit unit) |
void |
put(E e) |
int |
remainingCapacity() |
boolean |
remove(Object o)
Removes a single instance of the specified element from this queue, if it
is present.
|
int |
size() |
E |
take() |
Object[] |
toArray()
Returns an array containing all of the elements in this queue.
|
<T> T[] |
toArray(T[] a)
Returns an array containing all of the elements in this queue; the
runtime type of the returned array is that of the specified array.
|
String |
toString() |
add, addAll, element, removecontainsAll, isEmpty, removeAll, retainAllclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitaddaddAll, containsAll, equals, hashCode, isEmpty, removeAll, retainAllpublic BoundedPriorityBlockingQueue(int capacity)
public BoundedPriorityBlockingQueue(int capacity,
Comparator<? super E> comparator)
public boolean offer(E e)
offer in interface BlockingQueue<E>offer in interface Queue<E>e - the element to addClassCastException - if the specified element cannot be compared with elements
currently in the priority queue according to the priority
queue's orderingNullPointerException - if the specified element is nullpublic void put(E e) throws InterruptedException
put in interface BlockingQueue<E>InterruptedExceptionpublic boolean offer(E e, long timeout, TimeUnit unit) throws InterruptedException
offer in interface BlockingQueue<E>InterruptedExceptionpublic E take() throws InterruptedException
take in interface BlockingQueue<E>InterruptedExceptionpublic E poll(long timeout, TimeUnit unit) throws InterruptedException
poll in interface BlockingQueue<E>InterruptedExceptionpublic Comparator<? super E> comparator()
public int size()
size in interface Collection<E>size in class AbstractCollection<E>public int remainingCapacity()
remainingCapacity in interface BlockingQueue<E>public boolean remove(Object o)
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).remove in interface Collection<E>remove in interface BlockingQueue<E>remove in class AbstractCollection<E>o - element to be removed from this queue, if presentpublic boolean contains(Object o)
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).contains in interface Collection<E>contains in interface BlockingQueue<E>contains in class AbstractCollection<E>o - object to be checked for containment in this queuepublic Object[] toArray()
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.
toArray in interface Collection<E>toArray in class AbstractCollection<E>public String toString()
toString in class AbstractCollection<E>public int drainTo(Collection<? super E> c)
drainTo in interface BlockingQueue<E>UnsupportedOperationExceptionClassCastExceptionNullPointerExceptionIllegalArgumentExceptionpublic int drainTo(Collection<? super E> c, int maxElements)
drainTo in interface BlockingQueue<E>UnsupportedOperationExceptionClassCastExceptionNullPointerExceptionIllegalArgumentExceptionpublic void clear()
clear in interface Collection<E>clear in class AbstractQueue<E>public <T> T[] toArray(T[] a)
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().
toArray in interface Collection<E>toArray in class AbstractCollection<E>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 purposeArrayStoreException - if the runtime type of the specified array is not a supertype
of the runtime type of every element in this queueNullPointerException - if the specified array is nullpublic Iterator<E> iterator()
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.iterator in interface Iterable<E>iterator in interface Collection<E>iterator in class AbstractCollection<E>Copyright © 2014 Molindo GmbH. All Rights Reserved.