|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.AbstractPriorityQueue<K>
it.unimi.dsi.fastutil.objects.ObjectHeapPriorityQueue<K>
public class ObjectHeapPriorityQueue<K>
A type-specific heap-based priority queue.
Instances of this class represent a priority queue using a heap. The heap is enlarged as needed, but
it is never shrunk. Use the trim()
method to reduce its size, if necessary.
Constructor Summary | |
---|---|
ObjectHeapPriorityQueue()
Creates a new empty queue using the natural order. |
|
ObjectHeapPriorityQueue(java.util.Comparator<? super K> c)
Creates a new empty queue with a given comparator. |
|
ObjectHeapPriorityQueue(int capacity)
Creates a new empty queue with a given capacity and using the natural order. |
|
ObjectHeapPriorityQueue(int capacity,
java.util.Comparator<? super K> c)
Creates a new empty queue with a given capacity and comparator. |
|
ObjectHeapPriorityQueue(K[] a)
Wraps a given array in a queue using the natural order. |
|
ObjectHeapPriorityQueue(K[] a,
java.util.Comparator<? super K> c)
Wraps a given array in a queue using a given comparator. |
|
ObjectHeapPriorityQueue(K[] a,
int size)
Wraps a given array in a queue using the natural order. |
|
ObjectHeapPriorityQueue(K[] a,
int size,
java.util.Comparator<? super K> c)
Wraps a given array in a queue using a given comparator. |
Method Summary | |
---|---|
void |
changed()
Notifies the queue that the first element has changed (optional operation). |
void |
clear()
Removes all elements from this queue. |
java.util.Comparator<? super K> |
comparator()
Returns the comparator associated with this queue, or null if it uses its elements' natural ordering. |
K |
dequeue()
Dequeues the PriorityQueue.first() element from the queue. |
void |
enqueue(K x)
Enqueues a new element. |
K |
first()
Returns the first element of the queue. |
int |
size()
Returns the number of elements in this queue. |
void |
trim()
Trims the underlying heap array so that it has exactly size() elements. |
Methods inherited from class it.unimi.dsi.fastutil.AbstractPriorityQueue |
---|
isEmpty, last |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ObjectHeapPriorityQueue(int capacity, java.util.Comparator<? super K> c)
capacity
- the initial capacity of this queue.c
- the comparator used in this queue, or null
for the natural order.public ObjectHeapPriorityQueue(int capacity)
capacity
- the initial capacity of this queue.public ObjectHeapPriorityQueue(java.util.Comparator<? super K> c)
c
- the comparator used in this queue, or null
for the natural order.public ObjectHeapPriorityQueue()
public ObjectHeapPriorityQueue(K[] a, int size, java.util.Comparator<? super K> c)
The queue returned by this method will be backed by the given array.
The first size
element of the array will be rearranged so to form a heap (this is
more efficient than enqueing the elements of a
one by one).
a
- an array.size
- the number of elements to be included in the queue.c
- the comparator used in this queue, or null
for the natural order.public ObjectHeapPriorityQueue(K[] a, java.util.Comparator<? super K> c)
The queue returned by this method will be backed by the given array.
The elements of the array will be rearranged so to form a heap (this is
more efficient than enqueing the elements of a
one by one).
a
- an array.c
- the comparator used in this queue, or null
for the natural order.public ObjectHeapPriorityQueue(K[] a, int size)
The queue returned by this method will be backed by the given array.
The first size
element of the array will be rearranged so to form a heap (this is
more efficient than enqueing the elements of a
one by one).
a
- an array.size
- the number of elements to be included in the queue.public ObjectHeapPriorityQueue(K[] a)
The queue returned by this method will be backed by the given array.
The elements of the array will be rearranged so to form a heap (this is
more efficient than enqueing the elements of a
one by one).
a
- an array.Method Detail |
---|
public void enqueue(K x)
PriorityQueue
x
- the element to enqueue..public K dequeue()
PriorityQueue
PriorityQueue.first()
element from the queue.
public K first()
PriorityQueue
public void changed()
PriorityQueue
changed
in interface PriorityQueue<K>
changed
in class AbstractPriorityQueue<K>
public int size()
PriorityQueue
public void clear()
PriorityQueue
public void trim()
size()
elements.
public java.util.Comparator<? super K> comparator()
PriorityQueue
null
if it uses its elements' natural ordering.
null
if it uses its elements' natural ordering.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |