Package it.unimi.dsi.fastutil.shorts
Class ShortArrayPriorityQueue
java.lang.Object
it.unimi.dsi.fastutil.shorts.ShortArrayPriorityQueue
- All Implemented Interfaces:
PriorityQueue<Short>,ShortPriorityQueue,Serializable
A type-specific array-based priority queue.
Instances of this class represent a priority queue using a backing array—all operations are
performed directly on the array. The array is enlarged as needed, but it is never shrunk. Use the
trim() method to reduce its size, if necessary.
- See Also:
- Implementation Specification:
- This implementation is extremely inefficient, but it is difficult to beat when the size of the queue is very small.
-
Constructor Summary
ConstructorsConstructorDescriptionCreates a new empty queue using the natural order.ShortArrayPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.ShortArrayPriorityQueue(int capacity, ShortComparator c) Creates a new empty queue with a given capacity and comparator.ShortArrayPriorityQueue(short[] a) Wraps a given array in a queue using the natural order.ShortArrayPriorityQueue(short[] a, int size) Wraps a given array in a queue using the natural order.ShortArrayPriorityQueue(short[] a, int size, ShortComparator c) Wraps a given array in a queue using a given comparator.ShortArrayPriorityQueue(short[] a, ShortComparator c) Wraps a given array in a queue using a given comparator.Creates a new empty queue with a given comparator. -
Method Summary
Modifier and TypeMethodDescriptionvoidchanged()Notifies the queue that the first element has changed (optional operation).voidclear()Removes all elements from this queue.Returns 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()Returns the number of elements in this queue.voidtrim()Trims the underlying array so that it has exactlysize()elements.Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface it.unimi.dsi.fastutil.PriorityQueue
isEmpty
-
Constructor Details
-
ShortArrayPriorityQueue
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.
-
ShortArrayPriorityQueue
public ShortArrayPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.- Parameters:
capacity- the initial capacity of this queue.
-
ShortArrayPriorityQueue
Creates a new empty queue with a given comparator.- Parameters:
c- the comparator used in this queue, ornullfor the natural order.
-
ShortArrayPriorityQueue
public ShortArrayPriorityQueue()Creates a new empty queue using the natural order. -
ShortArrayPriorityQueue
Wraps a given array in a queue using a given comparator.The queue returned by this method will be backed by the given array.
- 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.
-
ShortArrayPriorityQueue
Wraps a given array in a queue using a given comparator.The queue returned by this method will be backed by the given array.
- Parameters:
a- an array.c- the comparator used in this queue, ornullfor the natural order.
-
ShortArrayPriorityQueue
public ShortArrayPriorityQueue(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.
- Parameters:
a- an array.size- the number of elements to be included in the queue.
-
ShortArrayPriorityQueue
public ShortArrayPriorityQueue(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.
- Parameters:
a- an array.
-
-
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()Description copied from interface:PriorityQueueNotifies the queue that the first element has changed (optional operation).This default implementation just throws an
UnsupportedOperationException.- Specified by:
changedin interfacePriorityQueue<Short>
-
size
public int size()Description copied from interface:PriorityQueueReturns the number of elements in this queue.- Specified by:
sizein interfacePriorityQueue<Short>- Returns:
- the number of elements in this queue.
-
clear
public void clear()Description copied from interface:PriorityQueueRemoves all elements from this queue.- Specified by:
clearin interfacePriorityQueue<Short>
-
trim
public void trim()Trims the underlying array so that it has exactlysize()elements. -
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 interfacePriorityQueue<Short>- Specified by:
comparatorin interfaceShortPriorityQueue- Returns:
- the comparator associated with this priority queue.
- See Also:
-