Package it.unimi.dsi.fastutil.ints
Class IntArrayPriorityQueue
java.lang.Object
it.unimi.dsi.fastutil.ints.IntArrayPriorityQueue
- All Implemented Interfaces:
IntPriorityQueue,PriorityQueue<Integer>,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.IntArrayPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.IntArrayPriorityQueue(int[] a) Wraps a given array in a queue using the natural order.IntArrayPriorityQueue(int[] a, int size) Wraps a given array in a queue using the natural order.IntArrayPriorityQueue(int[] a, int size, IntComparator c) Wraps a given array in a queue using a given comparator.IntArrayPriorityQueue(int[] a, IntComparator c) Wraps a given array in a queue using a given comparator.IntArrayPriorityQueue(int capacity, IntComparator c) Creates a new empty queue with a given capacity and 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.intDequeues the first element from the queue.voidenqueue(int x) Enqueues a new element.intfirstInt()Returns 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.ints.IntPriorityQueue
dequeue, enqueue, first, last, lastIntMethods inherited from interface it.unimi.dsi.fastutil.PriorityQueue
isEmpty
-
Constructor Details
-
IntArrayPriorityQueue
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.
-
IntArrayPriorityQueue
public IntArrayPriorityQueue(int capacity) Creates a new empty queue with a given capacity and using the natural order.- Parameters:
capacity- the initial capacity of this queue.
-
IntArrayPriorityQueue
Creates a new empty queue with a given comparator.- Parameters:
c- the comparator used in this queue, ornullfor the natural order.
-
IntArrayPriorityQueue
public IntArrayPriorityQueue()Creates a new empty queue using the natural order. -
IntArrayPriorityQueue
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.
-
IntArrayPriorityQueue
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.
-
IntArrayPriorityQueue
public IntArrayPriorityQueue(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.
- Parameters:
a- an array.size- the number of elements to be included in the queue.
-
IntArrayPriorityQueue
public IntArrayPriorityQueue(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.
- Parameters:
a- an array.
-
-
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()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<Integer>
-
size
public int size()Description copied from interface:PriorityQueueReturns the number of elements in this queue.- Specified by:
sizein interfacePriorityQueue<Integer>- 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<Integer>
-
trim
public void trim()Trims the underlying array so that it has exactlysize()elements. -
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 interfacePriorityQueue<Integer>- Returns:
- the comparator associated with this priority queue.
- See Also:
-