| java.lang.Object
 EDU.oswego.cs.dl.util.concurrent.SemaphoreControlledChannel
EDU.oswego.cs.dl.util.concurrent.BoundedPriorityQueue
| BoundedPriorityQueue | | public class BoundedPriorityQueue extends SemaphoreControlledChannel (Code) | | A heap-based priority queue, using semaphores for
concurrency control.
The take operation returns the least element
with respect to the given ordering. (If more than
one element is tied for least value, one of them is
arbitrarily chosen to be returned -- no guarantees
are made for ordering across ties.)
Ordering follows the JDK1.2 collection
conventions: Either the elements must be Comparable, or
a Comparator must be supplied. Comparison failures throw
ClassCastExceptions during insertions and extractions.
The implementation uses a standard array-based heap algorithm,
as described in just about any data structures textbook.
Put and take operations may throw ClassCastException
if elements are not Comparable, or
not comparable using the supplied comparator.
Since not all elements are compared on each operation
it is possible that an exception will not be thrown
during insertion of non-comparable element, but will later be
encountered during another insertion or extraction.
[ Introduction to this package. ]
|
| BoundedPriorityQueue | | public BoundedPriorityQueue(Comparator comparator)(Code) | | Create a priority queue with the current default capacity
and the given comparator
|
| BoundedPriorityQueue | | public BoundedPriorityQueue(int capacity)(Code) | | Create a priority queue with the given capacity,
and relying on natural ordering.
|
| BoundedPriorityQueue | | public BoundedPriorityQueue()(Code) | | Create a priority queue with the current default capacity
and relying on natural ordering.
|
|
|