public class IntHeapPriorityQueue extends java.lang.Object implements IntPriorityQueue, java.io.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.
Constructor and Description |
---|
IntHeapPriorityQueue()
Creates a new empty queue using the natural order.
|
IntHeapPriorityQueue(java.util.Collection<? extends java.lang.Integer> collection)
Creates a queue using the elements in a collection using the natural order.
|
IntHeapPriorityQueue(java.util.Collection<? extends java.lang.Integer> collection,
IntComparator c)
Creates a queue using the elements in a collection using a given comparator.
|
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,
IntComparator c)
Wraps a given array in a queue using a given comparator.
|
IntHeapPriorityQueue(int[] a,
int size,
IntComparator c)
Wraps a given array in a queue using a given comparator.
|
IntHeapPriorityQueue(IntCollection collection)
Creates a queue using the elements in a type-specific collection using the natural order.
|
IntHeapPriorityQueue(IntCollection collection,
IntComparator c)
Creates a queue using the elements in a type-specific collection using a given comparator.
|
IntHeapPriorityQueue(IntComparator c)
Creates a new empty queue with a given comparator.
|
IntHeapPriorityQueue(int capacity,
IntComparator c)
Creates a new empty queue with a given capacity and comparator.
|
Modifier and Type | Method and Description |
---|---|
void |
changed()
Notifies the queue that the first element has changed (optional operation).
|
void |
clear()
Removes all elements from this queue.
|
IntComparator |
comparator()
Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
|
int |
dequeueInt()
Dequeues the first element from the queue.
|
void |
enqueue(int x)
Enqueues a new element.
|
int |
firstInt()
Returns the first element of the queue.
|
int |
size()
Returns the number of elements in this queue.
|
void |
trim()
Trims the underlying heap array so that it has exactly
size() elements. |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
dequeue, enqueue, first, last, lastInt
isEmpty
public IntHeapPriorityQueue(int capacity, IntComparator c)
capacity
- the initial capacity of this queue.c
- the comparator used in this queue, or null
for the natural order.public IntHeapPriorityQueue(int capacity)
capacity
- the initial capacity of this queue.public IntHeapPriorityQueue(IntComparator c)
c
- the comparator used in this queue, or null
for the natural order.public IntHeapPriorityQueue()
public IntHeapPriorityQueue(int[] a, int size, IntComparator c)
The queue returned by this method will be backed by the given array.
The first size
element of the array will be rearranged so to form a heap (this is
more efficient than enqueing the elements of a
one by one).
a
- an array.size
- the number of elements to be included in the queue.c
- the comparator used in this queue, or null
for the natural order.public IntHeapPriorityQueue(int[] a, IntComparator c)
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 a
one by one).
a
- an array.c
- the comparator used in this queue, or null
for the natural order.public IntHeapPriorityQueue(int[] a, int size)
The queue returned by this method will be backed by the given array.
The first size
element of the array will be rearranged so to form a heap (this is
more efficient than enqueing the elements of a
one by one).
a
- an array.size
- the number of elements to be included in the queue.public IntHeapPriorityQueue(int[] a)
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 a
one by one).
a
- an array.public IntHeapPriorityQueue(IntCollection collection, IntComparator c)
This constructor is more efficient than enqueing the elements of collection
one by one.
collection
- a collection; its elements will be used to initialize the queue.c
- the comparator used in this queue, or null
for the natural order.public IntHeapPriorityQueue(IntCollection collection)
This constructor is
more efficient than enqueing the elements of collection
one by one.
collection
- a collection; its elements will be used to initialize the queue.public IntHeapPriorityQueue(java.util.Collection<? extends java.lang.Integer> collection, IntComparator c)
This constructor is more efficient than enqueing the elements of collection
one by one.
collection
- a collection; its elements will be used to initialize the queue.c
- the comparator used in this queue, or null
for the natural order.public IntHeapPriorityQueue(java.util.Collection<? extends java.lang.Integer> collection)
This constructor is
more efficient than enqueing the elements of collection
one by one.
collection
- a collection; its elements will be used to initialize the queue.public void enqueue(int x)
IntPriorityQueue
enqueue
in interface IntPriorityQueue
x
- the element to enqueue.PriorityQueue.enqueue(Object)
public int dequeueInt()
IntPriorityQueue
dequeueInt
in interface IntPriorityQueue
IntPriorityQueue.dequeue()
public int firstInt()
IntPriorityQueue
firstInt
in interface IntPriorityQueue
IntPriorityQueue.first()
public void changed()
PriorityQueue
This default implementation just throws an UnsupportedOperationException
.
changed
in interface PriorityQueue<java.lang.Integer>
public int size()
PriorityQueue
size
in interface PriorityQueue<java.lang.Integer>
public void clear()
PriorityQueue
clear
in interface PriorityQueue<java.lang.Integer>
public void trim()
size()
elements.public IntComparator comparator()
IntPriorityQueue
comparator
in interface IntPriorityQueue
comparator
in interface PriorityQueue<java.lang.Integer>
PriorityQueue.comparator()