Class ObjectHeapPriorityQueue<K>
- All Implemented Interfaces:
it.unimi.dsi.fastutil.PriorityQueue<K>,Serializable
Instances of this class represent a priority queue using a heap. The heap is enlarged as needed, but
it is never shrunk. Use the trim() method to reduce its size, if necessary.
- See Also:
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionCreates a new empty queue using the natural order.ObjectHeapPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.ObjectHeapPriorityQueue(int capacity, Comparator<? super K> c) Creates a new empty queue with a given capacity and comparator.ObjectHeapPriorityQueue(Collection<? extends K> collection) Creates a queue using the elements in a collection using the natural order.ObjectHeapPriorityQueue(Collection<? extends K> collection, Comparator<? super K> c) Creates a queue using the elements in a collection using a given comparator.ObjectHeapPriorityQueue(Comparator<? super K> c) Creates a new empty queue with a given comparator.ObjectHeapPriorityQueue(K[] a) Wraps a given array in a queue using the natural order.ObjectHeapPriorityQueue(K[] a, int size) Wraps a given array in a queue using the natural order.ObjectHeapPriorityQueue(K[] a, int size, Comparator<? super K> c) Wraps a given array in a queue using a given comparator.ObjectHeapPriorityQueue(K[] a, Comparator<? super K> c) Wraps a given array in a queue using a given comparator. -
Method Summary
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface it.unimi.dsi.fastutil.PriorityQueue
isEmpty, last
-
Field Details
-
heap
The heap array. -
size
protected int sizeThe number of elements in this queue. -
c
The type-specific comparator used in this queue.
-
-
Constructor Details
-
ObjectHeapPriorityQueue
Creates a new empty queue with a given capacity and comparator.- Parameters:
capacity- the initial capacity of this queue.c- the comparator used in this queue, ornullfor the natural order.
-
ObjectHeapPriorityQueue
public ObjectHeapPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.- Parameters:
capacity- the initial capacity of this queue.
-
ObjectHeapPriorityQueue
Creates a new empty queue with a given comparator.- Parameters:
c- the comparator used in this queue, ornullfor the natural order.
-
ObjectHeapPriorityQueue
public ObjectHeapPriorityQueue()Creates a new empty queue using the natural order. -
ObjectHeapPriorityQueue
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:
a- an array.size- the number of elements to be included in the queue.c- the comparator used in this queue, ornullfor the natural order.
-
ObjectHeapPriorityQueue
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:
a- an array.c- the comparator used in this queue, ornullfor the natural order.
-
ObjectHeapPriorityQueue
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:
a- an array.size- the number of elements to be included in the queue.
-
ObjectHeapPriorityQueue
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:
a- an array.
-
ObjectHeapPriorityQueue
Creates a queue using the elements in a collection using a given comparator.This constructor is more efficient than enqueing the elements of
collectionone by one.- Parameters:
collection- a collection; its elements will be used to initialize the queue.c- the comparator used in this queue, ornullfor the natural order.
-
ObjectHeapPriorityQueue
Creates a queue using the elements in a collection using the natural order.This constructor is more efficient than enqueing the elements of
collectionone by one.- Parameters:
collection- a collection; its elements will be used to initialize the queue.
-
-
Method Details
-
enqueue
- Specified by:
enqueuein interfaceit.unimi.dsi.fastutil.PriorityQueue<K>
-
dequeue
- Specified by:
dequeuein interfaceit.unimi.dsi.fastutil.PriorityQueue<K>
-
first
- Specified by:
firstin interfaceit.unimi.dsi.fastutil.PriorityQueue<K>
-
changed
public void changed()- Specified by:
changedin interfaceit.unimi.dsi.fastutil.PriorityQueue<K>
-
size
public int size()- Specified by:
sizein interfaceit.unimi.dsi.fastutil.PriorityQueue<K>
-
clear
public void clear()- Specified by:
clearin interfaceit.unimi.dsi.fastutil.PriorityQueue<K>
-
trim
public void trim()Trims the underlying heap array so that it has exactlysize()elements. -
comparator
- Specified by:
comparatorin interfaceit.unimi.dsi.fastutil.PriorityQueue<K>
-