public class DoubleArrayIndirectPriorityQueue extends java.lang.Object implements DoubleIndirectPriorityQueue
Instances of this class use as reference list a reference array,
which must be provided to each constructor, and represent a priority queue
using a backing array of integer indices—all operations are performed
directly on the array. The array 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 int[] |
array
The backing array.
|
protected it.unimi.dsi.fastutil.doubles.DoubleComparator |
c
The type-specific comparator used in this queue.
|
protected int |
firstIndex
The first index, cached, if
firstIndexValid is true. |
protected boolean |
firstIndexValid
Whether
firstIndex contains a valid value. |
protected double[] |
refArray
The reference array.
|
protected int |
size
The number of elements in this queue.
|
| Constructor and Description |
|---|
DoubleArrayIndirectPriorityQueue(double[] refArray)
Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.
|
DoubleArrayIndirectPriorityQueue(double[] refArray,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
|
DoubleArrayIndirectPriorityQueue(double[] refArray,
int capacity)
Creates a new empty queue with given capacity and using the natural order.
|
DoubleArrayIndirectPriorityQueue(double[] refArray,
int[] a)
Wraps a given array in a queue using the natural order.
|
DoubleArrayIndirectPriorityQueue(double[] refArray,
int[] a,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Wraps a given array in a queue using a given comparator.
|
DoubleArrayIndirectPriorityQueue(double[] refArray,
int[] a,
int size)
Wraps a given array in a queue using the natural order.
|
DoubleArrayIndirectPriorityQueue(double[] refArray,
int[] a,
int size,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Wraps a given array in a queue using a given comparator.
|
DoubleArrayIndirectPriorityQueue(double[] refArray,
int capacity,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
Creates a new empty queue without elements with a given capacity and comparator.
|
| Modifier and Type | Method and Description |
|---|---|
void |
allChanged()
Signals the queue that all elements have changed.
|
void |
changed() |
void |
changed(int index) |
void |
clear() |
it.unimi.dsi.fastutil.doubles.DoubleComparator |
comparator()
Returns the type-specific comparator associated with this queue.
|
int |
dequeue() |
void |
enqueue(int x) |
protected void |
ensureElement(int index)
Ensures that the given index is a firstIndexValid reference.
|
protected void |
ensureNonEmpty() |
int |
first() |
int |
front(int[] a)
Writes in the provided array the front of the queue, that is, the set of indices
whose elements have the same priority as the top.
|
int |
last() |
boolean |
remove(int index) |
int |
size() |
java.lang.String |
toString() |
void |
trim()
Trims the backing array so that it has exactly
size() elements. |
protected double[] refArray
protected int[] array
protected int size
protected it.unimi.dsi.fastutil.doubles.DoubleComparator c
protected int firstIndex
firstIndexValid is true.protected boolean firstIndexValid
firstIndex contains a valid value.public DoubleArrayIndirectPriorityQueue(double[] refArray,
int capacity,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
refArray - the reference array.capacity - the initial capacity of this queue.c - the comparator used in this queue, or null for the natural order.public DoubleArrayIndirectPriorityQueue(double[] refArray,
int capacity)
refArray - the reference array.capacity - the initial capacity of this queue.public DoubleArrayIndirectPriorityQueue(double[] refArray,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
refArray - the reference array.c - the comparator used in this queue, or null for the natural order.public DoubleArrayIndirectPriorityQueue(double[] refArray)
refArray - the reference array.public DoubleArrayIndirectPriorityQueue(double[] refArray,
int[] a,
int size,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
The queue returned by this method will be backed by the given array.
refArray - the reference array.a - an array of indices into refArray.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 DoubleArrayIndirectPriorityQueue(double[] refArray,
int[] a,
it.unimi.dsi.fastutil.doubles.DoubleComparator c)
The queue returned by this method will be backed by the given array.
refArray - the reference array.a - an array of indices into refArray.c - the comparator used in this queue, or null for the natural order.public DoubleArrayIndirectPriorityQueue(double[] refArray,
int[] a,
int size)
The queue returned by this method will be backed by the given array.
refArray - the reference array.a - an array of indices into refArray.size - the number of elements to be included in the queue.public DoubleArrayIndirectPriorityQueue(double[] refArray,
int[] a)
The queue returned by this method will be backed by the given array.
refArray - the reference array.a - an array of indices into refArray.protected final void ensureNonEmpty()
protected void ensureElement(int index)
index - an index in the reference array.java.lang.IndexOutOfBoundsException - if the given index is negative or larger than the reference array length.public void enqueue(int x)
Note that for efficiency reasons this method will not throw an exception
when x is already in the queue. However, the queue state will become
inconsistent and the following behaviour will not be predictable.
enqueue in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public int dequeue()
dequeue in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public int first()
first in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public int last()
last in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public void changed()
changed in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public void changed(int index)
Note that for efficiency reasons this method will not throw an exception
when index is not in the queue.
changed in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public void allChanged()
allChanged in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public boolean remove(int index)
remove in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public int front(int[] a)
front in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>a - an array whose initial part will be filled with the frnot (must be sized as least as the heap size).public int size()
size in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public void clear()
clear in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>public void trim()
size() elements.public it.unimi.dsi.fastutil.doubles.DoubleComparator comparator()
DoubleIndirectPriorityQueuecomparator in interface DoubleIndirectPriorityQueuecomparator in interface it.unimi.dsi.fastutil.IndirectPriorityQueue<java.lang.Double>IndirectPriorityQueue.comparator()public java.lang.String toString()
toString in class java.lang.Object