public class FloatHeapIndirectPriorityQueue extends FloatHeapSemiIndirectPriorityQueue
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 FloatHeapSemiIndirectPriorityQueue.trim() method to reduce its size, if necessary.
This implementation does not allow one to enqueue several times the same index.
| Constructor and Description |
|---|
FloatHeapIndirectPriorityQueue(float[] refArray)
Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.
|
FloatHeapIndirectPriorityQueue(float[] refArray,
FloatComparator c)
Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
|
FloatHeapIndirectPriorityQueue(float[] refArray,
int capacity)
Creates a new empty queue with a given capacity and using the natural order.
|
FloatHeapIndirectPriorityQueue(float[] refArray,
int[] a)
Wraps a given array in a queue using the natural order.
|
FloatHeapIndirectPriorityQueue(float[] refArray,
int[] a,
FloatComparator c)
Wraps a given array in a queue using a given comparator.
|
FloatHeapIndirectPriorityQueue(float[] refArray,
int[] a,
int size)
Wraps a given array in a queue using the natural order.
|
FloatHeapIndirectPriorityQueue(float[] refArray,
int[] a,
int size,
FloatComparator c)
Wraps a given array in a queue using a given comparator.
|
FloatHeapIndirectPriorityQueue(float[] refArray,
int capacity,
FloatComparator c)
Creates a new empty queue with a given capacity and comparator.
|
| Modifier and Type | Method and Description |
|---|---|
void |
allChanged()
Rebuilds this heap in a bottom-up fashion.
|
void |
changed()
Notifies this queue that the first element has changed (optional operation).
|
void |
changed(int index)
Notifies this queue that the specified element has changed (optional operation).
|
void |
clear()
Removes all elements from this queue.
|
boolean |
contains(int index)
Checks whether a given index belongs to this queue (optional operation).
|
int |
dequeue()
Dequeues the first element from this queue.
|
void |
enqueue(int x)
Enqueues a new element.
|
boolean |
remove(int index)
Removes the specified element from this queue (optional operation).
|
comparator, first, front, size, toString, trimisEmpty, lastequals, getClass, hashCode, notify, notifyAll, wait, wait, waitisEmpty, lastpublic FloatHeapIndirectPriorityQueue(float[] refArray,
int capacity,
FloatComparator 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 FloatHeapIndirectPriorityQueue(float[] refArray,
int capacity)
refArray - the reference array.capacity - the initial capacity of this queue.public FloatHeapIndirectPriorityQueue(float[] refArray,
FloatComparator c)
refArray - the reference array.c - the comparator used in this queue, or null for the natural order.public FloatHeapIndirectPriorityQueue(float[] refArray)
refArray - the reference array.public FloatHeapIndirectPriorityQueue(float[] refArray,
int[] 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).
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 FloatHeapIndirectPriorityQueue(float[] refArray,
int[] 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).
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 FloatHeapIndirectPriorityQueue(float[] 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 FloatHeapIndirectPriorityQueue(float[] 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.public void enqueue(int x)
IndirectPriorityQueueenqueue in interface IndirectPriorityQueue<Float>enqueue in class FloatHeapSemiIndirectPriorityQueuex - the element to enqueue.public boolean contains(int index)
IndirectPriorityQueuecontains in interface IndirectPriorityQueue<Float>contains in class AbstractIndirectPriorityQueue<Float>index - an index possibly in the queue.public int dequeue()
IndirectPriorityQueuedequeue in interface IndirectPriorityQueue<Float>dequeue in class FloatHeapSemiIndirectPriorityQueuepublic void changed()
FloatHeapSemiIndirectPriorityQueueThe 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<Float>changed in class FloatHeapSemiIndirectPriorityQueuepublic void changed(int index)
IndirectPriorityQueueNote that the specified element must belong to this queue.
changed in interface IndirectPriorityQueue<Float>changed in class AbstractIndirectPriorityQueue<Float>index - the element that has changed.public void allChanged()
allChanged in interface IndirectPriorityQueue<Float>allChanged in class FloatHeapSemiIndirectPriorityQueuepublic boolean remove(int index)
IndirectPriorityQueueremove in interface IndirectPriorityQueue<Float>remove in class AbstractIndirectPriorityQueue<Float>index - the element to be removed.public void clear()
IndirectPriorityQueueclear in interface IndirectPriorityQueue<Float>clear in class FloatHeapSemiIndirectPriorityQueue