Class FloatHeapSemiIndirectPriorityQueue
- All Implemented Interfaces:
FloatIndirectPriorityQueue,it.unimi.dsi.fastutil.IndirectPriorityQueue<Float>
- Direct Known Subclasses:
FloatHeapIndirectPriorityQueue
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.
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionFloatHeapSemiIndirectPriorityQueue(float[] refArray) Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.FloatHeapSemiIndirectPriorityQueue(float[] refArray, int capacity) Creates a new empty queue with given capacity and using the natural order.FloatHeapSemiIndirectPriorityQueue(float[] refArray, int[] a) Wraps a given array in a queue using the natural order.FloatHeapSemiIndirectPriorityQueue(float[] refArray, int[] a, int size) Wraps a given array in a queue using the natural order.FloatHeapSemiIndirectPriorityQueue(float[] refArray, int[] a, int size, it.unimi.dsi.fastutil.floats.FloatComparator c) Wraps a given array in a queue using a given comparator.FloatHeapSemiIndirectPriorityQueue(float[] refArray, int[] a, it.unimi.dsi.fastutil.floats.FloatComparator c) Wraps a given array in a queue using a given comparator.FloatHeapSemiIndirectPriorityQueue(float[] refArray, int capacity, it.unimi.dsi.fastutil.floats.FloatComparator c) Creates a new empty queue without elements with a given capacity and comparator.FloatHeapSemiIndirectPriorityQueue(float[] refArray, it.unimi.dsi.fastutil.floats.FloatComparator c) Creates a new empty queue with capacity equal to the length of the reference array and a given comparator. -
Method Summary
Modifier and TypeMethodDescriptionvoidRebuilds this heap in a bottom-up fashion (in linear time).voidchanged()voidclear()it.unimi.dsi.fastutil.floats.FloatComparatorReturns the type-specific comparator associated with this queue.intdequeue()voidenqueue(int x) protected voidensureElement(int index) Ensures that the given index is a valid reference.intfirst()intfront(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.intsize()toString()voidtrim()Trims the backing array so that it has exactlysize()elements.Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface it.unimi.dsi.fastutil.IndirectPriorityQueue
changed, contains, isEmpty, last, remove
-
Field Details
-
refArray
protected final float[] refArrayThe reference array. -
heap
protected int[] heapThe semi-indirect heap. -
size
protected int sizeThe number of elements in this queue. -
c
protected it.unimi.dsi.fastutil.floats.FloatComparator cThe type-specific comparator used in this queue.
-
-
Constructor Details
-
FloatHeapSemiIndirectPriorityQueue
public FloatHeapSemiIndirectPriorityQueue(float[] refArray, int capacity, it.unimi.dsi.fastutil.floats.FloatComparator c) Creates a new empty queue without elements with a given capacity and comparator.- Parameters:
refArray- the reference array.capacity- the initial capacity of this queue.c- the comparator used in this queue, ornullfor the natural order.
-
FloatHeapSemiIndirectPriorityQueue
public FloatHeapSemiIndirectPriorityQueue(float[] refArray, int capacity) Creates a new empty queue with given capacity and using the natural order.- Parameters:
refArray- the reference array.capacity- the initial capacity of this queue.
-
FloatHeapSemiIndirectPriorityQueue
public FloatHeapSemiIndirectPriorityQueue(float[] refArray, it.unimi.dsi.fastutil.floats.FloatComparator c) Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.- Parameters:
refArray- the reference array.c- the comparator used in this queue, ornullfor the natural order.
-
FloatHeapSemiIndirectPriorityQueue
public FloatHeapSemiIndirectPriorityQueue(float[] refArray) Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.- Parameters:
refArray- the reference array.
-
FloatHeapSemiIndirectPriorityQueue
public FloatHeapSemiIndirectPriorityQueue(float[] refArray, int[] a, int size, it.unimi.dsi.fastutil.floats.FloatComparator c) Wraps a given array in a queue using a given comparator.The queue returned by this method will be backed by the given array. The first
sizeelement of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements ofaone by one).- Parameters:
refArray- the reference array.a- an array of indices intorefArray.size- the number of elements to be included in the queue.c- the comparator used in this queue, ornullfor the natural order.
-
FloatHeapSemiIndirectPriorityQueue
public FloatHeapSemiIndirectPriorityQueue(float[] refArray, int[] a, it.unimi.dsi.fastutil.floats.FloatComparator c) Wraps a given array in a queue using a given comparator.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
aone by one).- Parameters:
refArray- the reference array.a- an array of indices intorefArray.c- the comparator used in this queue, ornullfor the natural order.
-
FloatHeapSemiIndirectPriorityQueue
public FloatHeapSemiIndirectPriorityQueue(float[] refArray, int[] a, int size) Wraps a given array in a queue using the natural order.The queue returned by this method will be backed by the given array. The first
sizeelement of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements ofaone by one).- Parameters:
refArray- the reference array.a- an array of indices intorefArray.size- the number of elements to be included in the queue.
-
FloatHeapSemiIndirectPriorityQueue
public FloatHeapSemiIndirectPriorityQueue(float[] refArray, int[] a) Wraps a given array in a queue using the natural order.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
aone by one).- Parameters:
refArray- the reference array.a- an array of indices intorefArray.
-
-
Method Details
-
ensureElement
protected void ensureElement(int index) Ensures that the given index is a valid reference.- Parameters:
index- an index in the reference array.- Throws:
IndexOutOfBoundsException- if the given index is negative or larger than the reference array length.
-
enqueue
public void enqueue(int x) - Specified by:
enqueuein interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>
-
dequeue
public int dequeue()- Specified by:
dequeuein interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>
-
first
public int first()- Specified by:
firstin interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>
-
changed
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.
- Specified by:
changedin interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>
-
allChanged
public void allChanged()Rebuilds this heap in a bottom-up fashion (in linear time).- Specified by:
allChangedin interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>
-
size
public int size()- Specified by:
sizein interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>
-
clear
public void clear()- Specified by:
clearin interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>
-
trim
public void trim()Trims the backing array so that it has exactlysize()elements. -
comparator
public it.unimi.dsi.fastutil.floats.FloatComparator comparator()Description copied from interface:FloatIndirectPriorityQueueReturns the type-specific comparator associated with this queue.- Specified by:
comparatorin interfaceFloatIndirectPriorityQueue- Specified by:
comparatorin interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>- Returns:
- the comparator associated with this queue.
- See Also:
-
front
public 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.- Specified by:
frontin interfaceit.unimi.dsi.fastutil.IndirectPriorityQueue<Float>- Parameters:
a- an array whose initial part will be filled with the frnot (must be sized as least as the heap size).- Returns:
- the number of elements of the front.
-
toString
-