public class ShortHeapPriorityQueue extends AbstractShortPriorityQueue
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 |
---|
ShortHeapPriorityQueue()
Creates a new empty queue using the natural order.
|
ShortHeapPriorityQueue(int capacity)
Creates a new empty queue with a given capacity and using the natural order.
|
ShortHeapPriorityQueue(int capacity,
ShortComparator c)
Creates a new empty queue with a given capacity and comparator.
|
ShortHeapPriorityQueue(short[] a)
Wraps a given array in a queue using the natural order.
|
ShortHeapPriorityQueue(short[] a,
int size)
Wraps a given array in a queue using the natural order.
|
ShortHeapPriorityQueue(short[] a,
int size,
ShortComparator c)
Wraps a given array in a queue using a given comparator.
|
ShortHeapPriorityQueue(short[] a,
ShortComparator c)
Wraps a given array in a queue using a given comparator.
|
ShortHeapPriorityQueue(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 sorted set, 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 heap array so that it has exactly
size() elements. |
dequeue, enqueue, first, last, lastShort
isEmpty
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
isEmpty
public ShortHeapPriorityQueue(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 ShortHeapPriorityQueue(int capacity)
capacity
- the initial capacity of this queue.public ShortHeapPriorityQueue(ShortComparator c)
c
- the comparator used in this queue, or null
for the natural order.public ShortHeapPriorityQueue()
public ShortHeapPriorityQueue(short[] a, int size, ShortComparator 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 ShortHeapPriorityQueue(short[] a, ShortComparator 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 ShortHeapPriorityQueue(short[] 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 ShortHeapPriorityQueue(short[] 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 void enqueue(short x)
ShortPriorityQueue
x
- the element to enqueue.public short dequeueShort()
ShortPriorityQueue
public short firstShort()
ShortPriorityQueue
public void changed()
PriorityQueue
changed
in interface PriorityQueue<Short>
changed
in class AbstractPriorityQueue<Short>
public int size()
PriorityQueue
public void clear()
PriorityQueue
public void trim()
size()
elements.public ShortComparator comparator()
ShortPriorityQueue
Note that this specification strengthens the one given in PriorityQueue.comparator()
.
null
if it uses its elements' natural ordering.PriorityQueue.comparator()