E - element in queuepublic class JDKPriorityBlockingQueue<E> extends AbstractQueue<E> implements BlockingQueue<E>, Serializable
| Modifier and Type | Field and Description |
|---|---|
protected ReentrantLock |
lock |
protected Condition |
notEmpty |
protected PriorityQueue<E> |
q |
| Constructor and Description |
|---|
JDKPriorityBlockingQueue()
Creates a PriorityBlockingQueue with the default
initial capacity (11) that orders its elements according to
their natural ordering.
|
JDKPriorityBlockingQueue(Collection<? extends E> c)
Creates a PriorityBlockingQueue containing the elements
in the specified collection.
|
JDKPriorityBlockingQueue(int initialCapacity)
Creates a PriorityBlockingQueue with the specified
initial capacity that orders its elements according to their
natural ordering.
|
JDKPriorityBlockingQueue(int initialCapacity,
Comparator<? super E> comparator)
Creates a PriorityBlockingQueue with the specified initial
capacity that orders its elements according to the specified
comparator.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E e)
Inserts the specified element into this priority queues.
|
void |
clear()
Atomically removes all of the elements from this queues.
|
Comparator<? super E> |
comparator()
Returns the comparator used to order the elements in this queues,
or null if this queues uses the natural ordering of its elements.
|
boolean |
contains(Object o)
Returns
true if this queues 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 queues.
|
boolean |
offer(E e)
Inserts the specified element into this priority queues.
|
boolean |
offer(E e,
long timeout,
TimeUnit unit)
Inserts the specified element into this priority queues.
|
E |
peek() |
E |
poll() |
E |
poll(long timeout,
TimeUnit unit) |
void |
put(E e)
Inserts the specified element into this priority queues.
|
int |
remainingCapacity()
Always returns Integer.MAX_VALUE because
a PriorityBlockingQueue is not capacity constrained.
|
boolean |
remove(Object o)
Removes a single instance of the specified element from this queues,
if it is present.
|
int |
size() |
E |
take() |
Object[] |
toArray()
Returns an array containing all of the elements in this queues.
|
<T> T[] |
toArray(T[] a)
Returns an array containing all of the elements in this queues; the
runtime type of the returned array is that of the specified array.
|
String |
toString() |
addAll, element, removecontainsAll, isEmpty, removeAll, retainAllclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitaddAll, containsAll, equals, hashCode, isEmpty, removeAll, retainAllprotected final PriorityQueue<E> q
protected final ReentrantLock lock
protected final Condition notEmpty
public JDKPriorityBlockingQueue()
public JDKPriorityBlockingQueue(int initialCapacity)
initialCapacity - the initial capacity for this priority queuesIllegalArgumentException - if initialCapacity is less
than 1public JDKPriorityBlockingQueue(int initialCapacity,
Comparator<? super E> comparator)
initialCapacity - the initial capacity for this priority queuescomparator - the comparator that will be used to order this
priority queues. If null, the natural ordering of the elements will be used.IllegalArgumentException - if initialCapacity is less
than 1public JDKPriorityBlockingQueue(Collection<? extends E> c)
SortedSet or a PriorityQueue, this
priority queues will be ordered according to the same ordering.
Otherwise, this priority queues will be ordered according to the
natural ordering of its elements.c - the collection whose elements are to be placed
into this priority queuesClassCastException - if elements of the specified collection
cannot be compared to one another according to the priority
queues's orderingNullPointerException - if the specified collection or any
of its elements are nullpublic boolean add(E e)
add in interface Collection<E>add in interface BlockingQueue<E>add in interface Queue<E>add in class AbstractQueue<E>e - the element to addCollection.add(E))ClassCastException - if the specified element cannot be compared
with elements currently in the priority queues according to the
priority queues's orderingNullPointerException - if the specified element is nullpublic boolean offer(E e)
offer in interface BlockingQueue<E>offer in interface Queue<E>e - the element to addQueue.offer(E))ClassCastException - if the specified element cannot be compared
with elements currently in the priority queues according to the
priority queues's orderingNullPointerException - if the specified element is nullpublic void put(E e)
put in interface BlockingQueue<E>e - the element to addClassCastException - if the specified element cannot be compared
with elements currently in the priority queues according to the
priority queues's orderingNullPointerException - if the specified element is nullpublic boolean offer(E e, long timeout, TimeUnit unit)
offer in interface BlockingQueue<E>e - the element to addtimeout - This parameter is ignored as the method never blocksunit - This parameter is ignored as the method never blocksClassCastException - if the specified element cannot be compared
with elements currently in the priority queues according to the
priority queues's orderingNullPointerException - if the specified element is nullpublic 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 queues contains one or more such
elements. Returns true if and only if this queues contained
the specified element (or equivalently, if this queues 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 queues, if presentpublic boolean contains(Object o)
true if this queues contains the specified element.
More formally, returns true if and only if this queues 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 queuespublic Object[] toArray()
The returned array will be "safe" in that no references to it are maintained by this queues. (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 queues fits in the specified array with room to spare (i.e., the array has more elements than this queues), the element in the array immediately following the end of the queues 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 queues known to contain only strings. The following code can be used to dump the queues 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 queues 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 queuesNullPointerException - 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 © 1999-2012 CodeLutin. All Rights Reserved.