Class IntHeapPriorityQueue
- All Implemented Interfaces:
IntPriorityQueue,it.unimi.dsi.fastutil.PriorityQueue<Integer>,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.IntHeapPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.IntHeapPriorityQueue(int[] a) Wraps a given array in a queue using the natural order.IntHeapPriorityQueue(int[] a, int size) Wraps a given array in a queue using the natural order.IntHeapPriorityQueue(int[] a, int size, it.unimi.dsi.fastutil.ints.IntComparator c) Wraps a given array in a queue using a given comparator.IntHeapPriorityQueue(int[] a, it.unimi.dsi.fastutil.ints.IntComparator c) Wraps a given array in a queue using a given comparator.IntHeapPriorityQueue(int capacity, it.unimi.dsi.fastutil.ints.IntComparator c) Creates a new empty queue with a given capacity and comparator.IntHeapPriorityQueue(it.unimi.dsi.fastutil.ints.IntCollection collection) Creates a queue using the elements in a type-specific collection using the natural order.IntHeapPriorityQueue(it.unimi.dsi.fastutil.ints.IntCollection collection, it.unimi.dsi.fastutil.ints.IntComparator c) Creates a queue using the elements in a type-specific collection using a given comparator.IntHeapPriorityQueue(it.unimi.dsi.fastutil.ints.IntComparator c) Creates a new empty queue with a given comparator.IntHeapPriorityQueue(Collection<? extends Integer> collection) Creates a queue using the elements in a collection using the natural order.IntHeapPriorityQueue(Collection<? extends Integer> collection, it.unimi.dsi.fastutil.ints.IntComparator c) Creates a queue using the elements in a collection using a given comparator. -
Method Summary
Modifier and TypeMethodDescriptionvoidchanged()voidclear()it.unimi.dsi.fastutil.ints.IntComparatorReturns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.intDequeues the first element from the queue.voidenqueue(int x) Enqueues a new element.intfirstInt()Returns the first element of the queue.intsize()voidtrim()Trims the underlying heap array so that it has exactlysize()elements.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.ints.IntPriorityQueue
dequeue, enqueue, first, last, lastIntMethods inherited from interface it.unimi.dsi.fastutil.PriorityQueue
isEmpty
-
Field Details
-
heap
protected transient int[] heapThe heap array. -
size
protected int sizeThe number of elements in this queue. -
c
protected it.unimi.dsi.fastutil.ints.IntComparator cThe type-specific comparator used in this queue.
-
-
Constructor Details
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(int capacity, it.unimi.dsi.fastutil.ints.IntComparator c) 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.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.- Parameters:
capacity- the initial capacity of this queue.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(it.unimi.dsi.fastutil.ints.IntComparator c) Creates a new empty queue with a given comparator.- Parameters:
c- the comparator used in this queue, ornullfor the natural order.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue()Creates a new empty queue using the natural order. -
IntHeapPriorityQueue
public IntHeapPriorityQueue(int[] a, int size, it.unimi.dsi.fastutil.ints.IntComparator 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:
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.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(int[] a, it.unimi.dsi.fastutil.ints.IntComparator 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:
a- an array.c- the comparator used in this queue, ornullfor the natural order.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(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:
a- an array.size- the number of elements to be included in the queue.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(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:
a- an array.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(it.unimi.dsi.fastutil.ints.IntCollection collection, it.unimi.dsi.fastutil.ints.IntComparator c) Creates a queue using the elements in a type-specific 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.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(it.unimi.dsi.fastutil.ints.IntCollection collection) Creates a queue using the elements in a type-specific 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.
-
IntHeapPriorityQueue
public IntHeapPriorityQueue(Collection<? extends Integer> collection, it.unimi.dsi.fastutil.ints.IntComparator c) 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.
-
IntHeapPriorityQueue
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
public void enqueue(int x) Description copied from interface:IntPriorityQueueEnqueues a new element.- Specified by:
enqueuein interfaceIntPriorityQueue- Parameters:
x- the element to enqueue.- See Also:
-
dequeueInt
public int dequeueInt()Description copied from interface:IntPriorityQueueDequeues the first element from the queue.- Specified by:
dequeueIntin interfaceIntPriorityQueue- Returns:
- the dequeued element.
- See Also:
-
firstInt
public int firstInt()Description copied from interface:IntPriorityQueueReturns the first element of the queue.- Specified by:
firstIntin interfaceIntPriorityQueue- Returns:
- the first element.
- See Also:
-
changed
public void changed()- Specified by:
changedin interfaceit.unimi.dsi.fastutil.PriorityQueue<Integer>
-
size
public int size()- Specified by:
sizein interfaceit.unimi.dsi.fastutil.PriorityQueue<Integer>
-
clear
public void clear()- Specified by:
clearin interfaceit.unimi.dsi.fastutil.PriorityQueue<Integer>
-
trim
public void trim()Trims the underlying heap array so that it has exactlysize()elements. -
comparator
public it.unimi.dsi.fastutil.ints.IntComparator comparator()Description copied from interface:IntPriorityQueueReturns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.- Specified by:
comparatorin interfaceIntPriorityQueue- Specified by:
comparatorin interfaceit.unimi.dsi.fastutil.PriorityQueue<Integer>- Returns:
- the comparator associated with this priority queue.
- See Also:
-