Class ShortHeapPriorityQueue
- All Implemented Interfaces:
it.unimi.dsi.fastutil.PriorityQueue<Short>,ShortPriorityQueue,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.ShortHeapPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.ShortHeapPriorityQueue(int capacity, it.unimi.dsi.fastutil.shorts.ShortComparator c) Creates a new empty queue with a given capacity and comparator.ShortHeapPriorityQueue(short[] a) Wraps a given array in a queue using the natural order.ShortHeapPriorityQueue(short[] a, int size) Wraps a given array in a queue using the natural order.ShortHeapPriorityQueue(short[] a, int size, it.unimi.dsi.fastutil.shorts.ShortComparator c) Wraps a given array in a queue using a given comparator.ShortHeapPriorityQueue(short[] a, it.unimi.dsi.fastutil.shorts.ShortComparator c) Wraps a given array in a queue using a given comparator.ShortHeapPriorityQueue(it.unimi.dsi.fastutil.shorts.ShortCollection collection) Creates a queue using the elements in a type-specific collection using the natural order.ShortHeapPriorityQueue(it.unimi.dsi.fastutil.shorts.ShortCollection collection, it.unimi.dsi.fastutil.shorts.ShortComparator c) Creates a queue using the elements in a type-specific collection using a given comparator.ShortHeapPriorityQueue(it.unimi.dsi.fastutil.shorts.ShortComparator c) Creates a new empty queue with a given comparator.ShortHeapPriorityQueue(Collection<? extends Short> collection) Creates a queue using the elements in a collection using the natural order.ShortHeapPriorityQueue(Collection<? extends Short> collection, it.unimi.dsi.fastutil.shorts.ShortComparator c) Creates a queue using the elements in a collection using a given comparator. -
Method Summary
Modifier and TypeMethodDescriptionvoidchanged()voidclear()it.unimi.dsi.fastutil.shorts.ShortComparatorReturns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.shortDequeues the first element from the queue.voidenqueue(short x) Enqueues a new element.shortReturns 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.PriorityQueue
isEmpty
-
Field Details
-
heap
protected transient short[] heapThe heap array. -
size
protected int sizeThe number of elements in this queue. -
c
protected it.unimi.dsi.fastutil.shorts.ShortComparator cThe type-specific comparator used in this queue.
-
-
Constructor Details
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(int capacity, it.unimi.dsi.fastutil.shorts.ShortComparator 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.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.- Parameters:
capacity- the initial capacity of this queue.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(it.unimi.dsi.fastutil.shorts.ShortComparator c) Creates a new empty queue with a given comparator.- Parameters:
c- the comparator used in this queue, ornullfor the natural order.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue()Creates a new empty queue using the natural order. -
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(short[] a, int size, it.unimi.dsi.fastutil.shorts.ShortComparator 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.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(short[] a, it.unimi.dsi.fastutil.shorts.ShortComparator 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.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(short[] 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.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(short[] 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.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(it.unimi.dsi.fastutil.shorts.ShortCollection collection, it.unimi.dsi.fastutil.shorts.ShortComparator 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.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(it.unimi.dsi.fastutil.shorts.ShortCollection 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.
-
ShortHeapPriorityQueue
public ShortHeapPriorityQueue(Collection<? extends Short> collection, it.unimi.dsi.fastutil.shorts.ShortComparator 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.
-
ShortHeapPriorityQueue
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(short x) Description copied from interface:ShortPriorityQueueEnqueues a new element.- Specified by:
enqueuein interfaceShortPriorityQueue- Parameters:
x- the element to enqueue.- See Also:
-
dequeueShort
public short dequeueShort()Description copied from interface:ShortPriorityQueueDequeues the first element from the queue.- Specified by:
dequeueShortin interfaceShortPriorityQueue- Returns:
- the dequeued element.
- See Also:
-
firstShort
public short firstShort()Description copied from interface:ShortPriorityQueueReturns the first element of the queue.- Specified by:
firstShortin interfaceShortPriorityQueue- Returns:
- the first element.
- See Also:
-
changed
public void changed()- Specified by:
changedin interfaceit.unimi.dsi.fastutil.PriorityQueue<Short>
-
size
public int size()- Specified by:
sizein interfaceit.unimi.dsi.fastutil.PriorityQueue<Short>
-
clear
public void clear()- Specified by:
clearin interfaceit.unimi.dsi.fastutil.PriorityQueue<Short>
-
trim
public void trim()Trims the underlying heap array so that it has exactlysize()elements. -
comparator
public it.unimi.dsi.fastutil.shorts.ShortComparator comparator()Description copied from interface:ShortPriorityQueueReturns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.- Specified by:
comparatorin interfaceit.unimi.dsi.fastutil.PriorityQueue<Short>- Specified by:
comparatorin interfaceShortPriorityQueue- Returns:
- the comparator associated with this priority queue.
- See Also:
-