|
||||||||||
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.shorts.ShortHeapSemiIndirectPriorityQueue
it.unimi.dsi.fastutil.shorts.ShortHeapIndirectPriorityQueue
A type-specific heap-based indirect priority queue.
Instances of this class use an additional inversion array, of the same length of the reference array,
to keep track of the heap position containing a given element of the reference array. The priority queue is
represented using a heap. The heap is enlarged as needed, but it is never
shrunk. Use the ShortHeapSemiIndirectPriorityQueue.trim()
method to reduce its size, if necessary.
This implementation does not allow one to enqueue several times the same index.
Constructor Summary | |
ShortHeapIndirectPriorityQueue(short[] refArray)
Creates a new empty queue with capacity equal to the length of the reference array and using the natural order. |
|
ShortHeapIndirectPriorityQueue(short[] refArray,
int capacity)
Creates a new empty queue with a given capacity and using the natural order. |
|
ShortHeapIndirectPriorityQueue(short[] refArray,
int[] a)
Wraps a given array in a queue using the natural order. |
|
ShortHeapIndirectPriorityQueue(short[] refArray,
int[] a,
int size)
Wraps a given array in a queue using the natural order. |
|
ShortHeapIndirectPriorityQueue(short[] refArray,
int[] a,
int size,
ShortComparator c)
Wraps a given array in a queue using a given comparator. |
|
ShortHeapIndirectPriorityQueue(short[] refArray,
int[] a,
ShortComparator c)
Wraps a given array in a queue using a given comparator. |
|
ShortHeapIndirectPriorityQueue(short[] refArray,
int capacity,
ShortComparator c)
Creates a new empty queue with a given capacity and comparator. |
|
ShortHeapIndirectPriorityQueue(short[] refArray,
ShortComparator c)
Creates a new empty queue with capacity equal to the length of the reference array and a given 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. Failure to do so will bring the queue in an inconsistent state, and will cause unpredictable behaviour. The caller must guarantee that when this method is called the index of the first element appears just once in the queue. |
void |
changed(int index)
Notifies the queue that the specified element has changed (optional operation). |
void |
clear()
Removes all elements from this queue. |
int |
dequeue()
Dequeues the first element from the queue. |
void |
enqueue(int x)
Enqueues a new element. |
void |
remove(int index)
Removes the specified element from the queue (optional operation). |
Methods inherited from class it.unimi.dsi.fastutil.shorts.ShortHeapSemiIndirectPriorityQueue |
comparator, first, size, toString, trim |
Methods inherited from class it.unimi.dsi.fastutil.AbstractIndirectPriorityQueue |
isEmpty, last |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
public ShortHeapIndirectPriorityQueue(short[] refArray, int capacity, ShortComparator 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 ShortHeapIndirectPriorityQueue(short[] refArray, int capacity)
refArray
- the reference array.capacity
- the initial capacity of this queue.public ShortHeapIndirectPriorityQueue(short[] refArray, ShortComparator c)
refArray
- the reference array.c
- the comparator used in this queue, or null
for the natural order.public ShortHeapIndirectPriorityQueue(short[] refArray)
refArray
- the reference array.public ShortHeapIndirectPriorityQueue(short[] refArray, int[] a, int size, ShortComparator 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 ShortHeapIndirectPriorityQueue(short[] refArray, int[] a, ShortComparator 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 ShortHeapIndirectPriorityQueue(short[] 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 ShortHeapIndirectPriorityQueue(short[] 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
enqueue
in interface IndirectPriorityQueue
enqueue
in class ShortHeapSemiIndirectPriorityQueue
public int dequeue()
IndirectPriorityQueue
dequeue
in interface IndirectPriorityQueue
dequeue
in class ShortHeapSemiIndirectPriorityQueue
public void changed()
ShortHeapSemiIndirectPriorityQueue
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 ShortHeapSemiIndirectPriorityQueue
public void changed(int index)
IndirectPriorityQueue
Note that the specified element must belong to the queue.
changed
in interface IndirectPriorityQueue
changed
in class AbstractIndirectPriorityQueue
public void allChanged()
allChanged
in interface IndirectPriorityQueue
allChanged
in class ShortHeapSemiIndirectPriorityQueue
public void remove(int index)
IndirectPriorityQueue
Note that the specified element must belong to the queue.
remove
in interface IndirectPriorityQueue
remove
in class AbstractIndirectPriorityQueue
public void clear()
IndirectPriorityQueue
clear
in interface IndirectPriorityQueue
clear
in class ShortHeapSemiIndirectPriorityQueue
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |