public class DoubleHeapPriorityQueue extends java.lang.Object implements DoublePriorityQueue, 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.
| Modifier and Type | Field and Description |
|---|---|
protected it.unimi.dsi.fastutil.doubles.DoubleComparator |
c
The type-specific comparator used in this queue.
|
protected double[] |
heap
The heap array.
|
protected int |
size
The number of elements in this queue.
|
| Constructor and Description |
|---|
DoubleHeapPriorityQueue()
Creates a new empty queue using the natural order.
|
DoubleHeapPriorityQueue(java.util.Collection<? extends java.lang.Double> collection)
Creates a queue using the elements in a collection using the natural order.
|
DoubleHeapPriorityQueue(java.util.Collection<? extends java.lang.Double> collection,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Creates a queue using the elements in a collection using a given comparator.
|
DoubleHeapPriorityQueue(double[] a)
Wraps a given array in a queue using the natural order.
|
DoubleHeapPriorityQueue(double[] a,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Wraps a given array in a queue using a given comparator.
|
DoubleHeapPriorityQueue(double[] a,
int size)
Wraps a given array in a queue using the natural order.
|
DoubleHeapPriorityQueue(double[] a,
int size,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Wraps a given array in a queue using a given comparator.
|
DoubleHeapPriorityQueue(it.unimi.dsi.fastutil.doubles.DoubleCollection collection)
Creates a queue using the elements in a type-specific collection using the natural order.
|
DoubleHeapPriorityQueue(it.unimi.dsi.fastutil.doubles.DoubleCollection collection,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Creates a queue using the elements in a type-specific collection using a given comparator.
|
DoubleHeapPriorityQueue(it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Creates a new empty queue with a given comparator.
|
DoubleHeapPriorityQueue(int capacity)
Creates a new empty queue with a given capacity and using the natural order.
|
DoubleHeapPriorityQueue(int capacity,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Creates a new empty queue with a given capacity and comparator.
|
| Modifier and Type | Method and Description |
|---|---|
void |
changed() |
void |
clear() |
it.unimi.dsi.fastutil.doubles.DoubleComparator |
comparator()
Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
|
double |
dequeueDouble()
Dequeues the first element from the queue.
|
void |
enqueue(double x)
Enqueues a new element.
|
double |
firstDouble()
Returns the first element of the queue.
|
int |
size() |
void |
trim()
Trims the underlying heap array so that it has exactly
size() elements. |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitdequeue, enqueue, first, last, lastDoubleprotected transient double[] heap
protected int size
protected it.unimi.dsi.fastutil.doubles.DoubleComparator c
public DoubleHeapPriorityQueue(int capacity,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
capacity - the initial capacity of this queue.c - the comparator used in this queue, or null for the natural order.public DoubleHeapPriorityQueue(int capacity)
capacity - the initial capacity of this queue.public DoubleHeapPriorityQueue(it.unimi.dsi.fastutil.doubles.DoubleComparator c)
c - the comparator used in this queue, or null for the natural order.public DoubleHeapPriorityQueue()
public DoubleHeapPriorityQueue(double[] a,
int size,
it.unimi.dsi.fastutil.doubles.DoubleComparator 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 DoubleHeapPriorityQueue(double[] a,
it.unimi.dsi.fastutil.doubles.DoubleComparator 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 DoubleHeapPriorityQueue(double[] 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 DoubleHeapPriorityQueue(double[] 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 DoubleHeapPriorityQueue(it.unimi.dsi.fastutil.doubles.DoubleCollection collection,
it.unimi.dsi.fastutil.doubles.DoubleComparator 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 DoubleHeapPriorityQueue(it.unimi.dsi.fastutil.doubles.DoubleCollection 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 DoubleHeapPriorityQueue(java.util.Collection<? extends java.lang.Double> collection,
it.unimi.dsi.fastutil.doubles.DoubleComparator 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 DoubleHeapPriorityQueue(java.util.Collection<? extends java.lang.Double> 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(double x)
DoublePriorityQueueenqueue in interface DoublePriorityQueuex - the element to enqueue.PriorityQueue.enqueue(Object)public double dequeueDouble()
DoublePriorityQueuedequeueDouble in interface DoublePriorityQueueDoublePriorityQueue.dequeue()public double firstDouble()
DoublePriorityQueuefirstDouble in interface DoublePriorityQueueDoublePriorityQueue.first()public void changed()
changed in interface it.unimi.dsi.fastutil.PriorityQueue<java.lang.Double>public int size()
size in interface it.unimi.dsi.fastutil.PriorityQueue<java.lang.Double>public void clear()
clear in interface it.unimi.dsi.fastutil.PriorityQueue<java.lang.Double>public void trim()
size() elements.public it.unimi.dsi.fastutil.doubles.DoubleComparator comparator()
DoublePriorityQueuecomparator in interface DoublePriorityQueuecomparator in interface it.unimi.dsi.fastutil.PriorityQueue<java.lang.Double>PriorityQueue.comparator()