public class ShortArrayPriorityQueue extends Object implements ShortPriorityQueue, 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.
This implementation is extremely inefficient, but it is difficult to beat when the size of the queue is very small.
| Constructor and Description |
|---|
ShortArrayPriorityQueue()
Creates 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.
|
ShortArrayPriorityQueue(ShortComparator c)
Creates a new empty queue with a given 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.
|
ShortComparator |
comparator()
Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
|
short |
dequeueShort()
Dequeues the first element from the queue.
|
void |
enqueue(short x)
Enqueues a new element.
|
short |
firstShort()
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, waitdequeue, enqueue, first, last, lastShortisEmptypublic ShortArrayPriorityQueue(int capacity,
ShortComparator c)
capacity - the initial capacity of this queue.c - the comparator used in this queue, or null for the natural order.public ShortArrayPriorityQueue(int capacity)
capacity - the initial capacity of this queue.public ShortArrayPriorityQueue(ShortComparator c)
c - the comparator used in this queue, or null for the natural order.public ShortArrayPriorityQueue()
public ShortArrayPriorityQueue(short[] a,
int size,
ShortComparator 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 ShortArrayPriorityQueue(short[] a,
ShortComparator 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 ShortArrayPriorityQueue(short[] 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 ShortArrayPriorityQueue(short[] a)
The queue returned by this method will be backed by the given array.
a - an array.public void enqueue(short x)
ShortPriorityQueueenqueue in interface ShortPriorityQueuex - the element to enqueue.PriorityQueue.enqueue(Object)public short dequeueShort()
ShortPriorityQueuedequeueShort in interface ShortPriorityQueueShortPriorityQueue.dequeue()public short firstShort()
ShortPriorityQueuefirstShort in interface ShortPriorityQueueShortPriorityQueue.first()public void changed()
PriorityQueueThis default implementation just throws an UnsupportedOperationException.
changed in interface PriorityQueue<Short>public int size()
PriorityQueuesize in interface PriorityQueue<Short>public void clear()
PriorityQueueclear in interface PriorityQueue<Short>public void trim()
size() elements.public ShortComparator comparator()
ShortPriorityQueueNote that this specification strengthens the one given in PriorityQueue.comparator().
comparator in interface PriorityQueue<Short>comparator in interface ShortPriorityQueuePriorityQueue.comparator()