public class FloatHeapPriorityQueue extends java.lang.Object implements FloatPriorityQueue, java.io.Serializable
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 and Description |
|---|
FloatHeapPriorityQueue()
Creates a new empty queue using the natural order.
|
FloatHeapPriorityQueue(java.util.Collection<? extends java.lang.Float> collection)
Creates a queue using the elements in a collection using the natural order.
|
FloatHeapPriorityQueue(java.util.Collection<? extends java.lang.Float> collection,
FloatComparator c)
Creates a queue using the elements in a collection using a given comparator.
|
FloatHeapPriorityQueue(float[] a)
Wraps a given array in a queue using the natural order.
|
FloatHeapPriorityQueue(float[] a,
FloatComparator c)
Wraps a given array in a queue using a given comparator.
|
FloatHeapPriorityQueue(float[] a,
int size)
Wraps a given array in a queue using the natural order.
|
FloatHeapPriorityQueue(float[] a,
int size,
FloatComparator c)
Wraps a given array in a queue using a given comparator.
|
FloatHeapPriorityQueue(FloatCollection collection)
Creates a queue using the elements in a type-specific collection using the
natural order.
|
FloatHeapPriorityQueue(FloatCollection collection,
FloatComparator c)
Creates a queue using the elements in a type-specific collection using a
given comparator.
|
FloatHeapPriorityQueue(FloatComparator c)
Creates a new empty queue with a given comparator.
|
FloatHeapPriorityQueue(int capacity)
Creates a new empty queue with a given capacity and using the natural order.
|
FloatHeapPriorityQueue(int capacity,
FloatComparator c)
Creates a new empty queue with a given capacity and comparator.
|
| Modifier and Type | Method and Description |
|---|---|
void |
changed()
Notifies the queue that the first element has changed (optional operation).
|
void |
clear()
Removes all elements from this queue.
|
FloatComparator |
comparator()
Returns the comparator associated with this priority queue, or null if it
uses its elements' natural ordering.
|
float |
dequeueFloat()
Dequeues the first element from the queue.
|
void |
enqueue(float x)
Enqueues a new element.
|
float |
firstFloat()
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. |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitdequeue, enqueue, first, last, lastFloatisEmptypublic FloatHeapPriorityQueue(int capacity,
FloatComparator c)
capacity - the initial capacity of this queue.c - the comparator used in this queue, or null for the natural
order.public FloatHeapPriorityQueue(int capacity)
capacity - the initial capacity of this queue.public FloatHeapPriorityQueue(FloatComparator c)
c - the comparator used in this queue, or null for the natural
order.public FloatHeapPriorityQueue()
public FloatHeapPriorityQueue(float[] a,
int size,
FloatComparator 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 FloatHeapPriorityQueue(float[] a,
FloatComparator 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 FloatHeapPriorityQueue(float[] 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 FloatHeapPriorityQueue(float[] 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.public FloatHeapPriorityQueue(FloatCollection collection, FloatComparator c)
This constructor is more efficient than enqueing the elements of
collection one by one.
collection - a collection; its elements will be used to initialize the queue.c - the comparator used in this queue, or null for the natural
order.public FloatHeapPriorityQueue(FloatCollection collection)
This constructor is more efficient than enqueing the elements of
collection one by one.
collection - a collection; its elements will be used to initialize the queue.public FloatHeapPriorityQueue(java.util.Collection<? extends java.lang.Float> collection,
FloatComparator c)
This constructor is more efficient than enqueing the elements of
collection one by one.
collection - a collection; its elements will be used to initialize the queue.c - the comparator used in this queue, or null for the natural
order.public FloatHeapPriorityQueue(java.util.Collection<? extends java.lang.Float> collection)
This constructor is more efficient than enqueing the elements of
collection one by one.
collection - a collection; its elements will be used to initialize the queue.public void enqueue(float x)
FloatPriorityQueueenqueue in interface FloatPriorityQueuex - the element to enqueue.PriorityQueue.enqueue(Object)public float dequeueFloat()
FloatPriorityQueuedequeueFloat in interface FloatPriorityQueueFloatPriorityQueue.dequeue()public float firstFloat()
FloatPriorityQueuefirstFloat in interface FloatPriorityQueueFloatPriorityQueue.first()public void changed()
PriorityQueueThis default implementation just throws an UnsupportedOperationException.
changed in interface PriorityQueue<java.lang.Float>public int size()
PriorityQueuesize in interface PriorityQueue<java.lang.Float>public void clear()
PriorityQueueclear in interface PriorityQueue<java.lang.Float>public void trim()
size()
elements.public FloatComparator comparator()
FloatPriorityQueue
Note that this specification strengthens the one given in
PriorityQueue.comparator().
comparator in interface FloatPriorityQueuecomparator in interface PriorityQueue<java.lang.Float>PriorityQueue.comparator()