|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.AbstractIndirectPriorityQueue
it.unimi.dsi.fastutil.doubles.DoubleHeapSemiIndirectPriorityQueue
A type-specific heap-based semi-indirect priority queue.
Instances of this class use as reference list a reference array,
which must be provided to each constructor. The priority queue is
represented using a heap. The heap is enlarged as needed, but it is never
shrunk. Use the trim()
method to reduce its size, if necessary.
This implementation allows one to enqueue several time the same index, but
you must be careful when calling changed()
.
Constructor Summary | |
DoubleHeapSemiIndirectPriorityQueue(double[] refArray)
Creates a new empty queue with capacity equal to the length of the reference array and using the natural order. |
|
DoubleHeapSemiIndirectPriorityQueue(double[] refArray,
DoubleComparator c)
Creates a new empty queue with capacity equal to the length of the reference array and a given comparator. |
|
DoubleHeapSemiIndirectPriorityQueue(double[] refArray,
int capacity)
Creates a new empty queue with given capacity and using the natural order. |
|
DoubleHeapSemiIndirectPriorityQueue(double[] refArray,
int[] a)
Wraps a given array in a queue using the natural order. |
|
DoubleHeapSemiIndirectPriorityQueue(double[] refArray,
int[] a,
DoubleComparator c)
Wraps a given array in a queue using a given comparator. |
|
DoubleHeapSemiIndirectPriorityQueue(double[] refArray,
int[] a,
int size)
Wraps a given array in a queue using the natural order. |
|
DoubleHeapSemiIndirectPriorityQueue(double[] refArray,
int[] a,
int size,
DoubleComparator c)
Wraps a given array in a queue using a given comparator. |
|
DoubleHeapSemiIndirectPriorityQueue(double[] refArray,
int capacity,
DoubleComparator c)
Creates a new empty queue without elements with a given capacity and comparator. |
Method Summary | |
void |
allChanged()
Rebuilds this heap in a bottom-up fashion. |
void |
changed()
The caller must guarantee that when this method is called the index of the first element appears just once in the queue. |
void |
clear()
Removes all elements from this queue. |
Comparator |
comparator()
Returns the comparator associated with this queue, or null if it uses its elements' natural ordering. |
int |
dequeue()
Dequeues the first element from the queue. |
void |
enqueue(int x)
Enqueues a new element. |
int |
first()
Returns the first element of the queue. |
int |
size()
Returns the number of elements in this queue. |
String |
toString()
|
void |
trim()
Trims the backing array so that it has exactly size() elements. |
Methods inherited from class it.unimi.dsi.fastutil.AbstractIndirectPriorityQueue |
changed, isEmpty, last, remove |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
public DoubleHeapSemiIndirectPriorityQueue(double[] refArray, int capacity, 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 DoubleHeapSemiIndirectPriorityQueue(double[] refArray, int capacity)
refArray
- the reference array.capacity
- the initial capacity of this queue.public DoubleHeapSemiIndirectPriorityQueue(double[] refArray, DoubleComparator c)
refArray
- the reference array.c
- the comparator used in this queue, or null
for the natural order.public DoubleHeapSemiIndirectPriorityQueue(double[] refArray)
refArray
- the reference array.public DoubleHeapSemiIndirectPriorityQueue(double[] refArray, int[] a, int size, 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).
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 DoubleHeapSemiIndirectPriorityQueue(double[] refArray, int[] a, 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).
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 DoubleHeapSemiIndirectPriorityQueue(double[] refArray, int[] 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).
refArray
- the reference array.a
- an array of indices into refArray
.size
- the number of elements to be included in the queue.public DoubleHeapSemiIndirectPriorityQueue(double[] refArray, int[] 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).
refArray
- the reference array.a
- an array of indices into refArray
.Method Detail |
public void enqueue(int x)
IndirectPriorityQueue
x
- the element to enqueue..public int dequeue()
IndirectPriorityQueue
public int first()
IndirectPriorityQueue
public void changed()
The caller must guarantee that when this method is called the index of the first element appears just once in the queue. Failure to do so will bring the queue in an inconsistent state, and will cause unpredictable behaviour.
changed
in interface IndirectPriorityQueue
changed
in class AbstractIndirectPriorityQueue
public void allChanged()
allChanged
in interface IndirectPriorityQueue
allChanged
in class AbstractIndirectPriorityQueue
public int size()
IndirectPriorityQueue
public void clear()
IndirectPriorityQueue
public void trim()
size()
elements.
public Comparator comparator()
IndirectPriorityQueue
null
if it uses its elements' natural ordering.
null
if it uses its elements' natural ordering.public String toString()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |