public class IntArrayPriorityQueue extends java.lang.Object implements IntPriorityQueue, java.io.Serializable
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.
Constructor and Description |
---|
IntArrayPriorityQueue()
Creates 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,
IntComparator c)
Wraps a given array in a queue using a given comparator.
|
IntArrayPriorityQueue(int[] a,
int size,
IntComparator c)
Wraps a given array in a queue using a given comparator.
|
IntArrayPriorityQueue(IntComparator c)
Creates a new empty queue with a given comparator.
|
IntArrayPriorityQueue(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 array so that it has exactly
size() elements. |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
dequeue, enqueue, first, last, lastInt
isEmpty
public IntArrayPriorityQueue(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 IntArrayPriorityQueue(int capacity)
capacity
- the initial capacity of this queue.public IntArrayPriorityQueue(IntComparator c)
c
- the comparator used in this queue, or null
for the natural order.public IntArrayPriorityQueue()
public IntArrayPriorityQueue(int[] a, int size, IntComparator c)
The queue returned by this method will be backed by the given array.
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 IntArrayPriorityQueue(int[] a, IntComparator c)
The queue returned by this method will be backed by the given array.
a
- an array.c
- the comparator used in this queue, or null
for the natural order.public IntArrayPriorityQueue(int[] a, int size)
The queue returned by this method will be backed by the given array.
a
- an array.size
- the number of elements to be included in the queue.public IntArrayPriorityQueue(int[] a)
The queue returned by this method will be backed by the given array.
a
- an array.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()