public class LongArrayPriorityQueue extends AbstractLongPriorityQueue implements 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 |
|---|
LongArrayPriorityQueue()
Creates a new empty queue using the natural order.
|
LongArrayPriorityQueue(int capacity)
Creates a new empty queue with a given capacity and using the natural order.
|
LongArrayPriorityQueue(int capacity,
LongComparator c)
Creates a new empty queue with a given capacity and comparator.
|
LongArrayPriorityQueue(long[] a)
Wraps a given array in a queue using the natural order.
|
LongArrayPriorityQueue(long[] a,
int size)
Wraps a given array in a queue using the natural order.
|
LongArrayPriorityQueue(long[] a,
int size,
LongComparator c)
Wraps a given array in a queue using a given comparator.
|
LongArrayPriorityQueue(long[] a,
LongComparator c)
Wraps a given array in a queue using a given comparator.
|
LongArrayPriorityQueue(LongComparator 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.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
long |
dequeueLong()
Dequeues the first element from the queue.
|
void |
enqueue(long x)
Enqueues a new element.
|
long |
firstLong()
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. |
dequeue, enqueue, first, last, lastLongisEmptyequals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitisEmptypublic LongArrayPriorityQueue(int capacity,
LongComparator c)
capacity - the initial capacity of this queue.c - the comparator used in this queue, or null for the natural order.public LongArrayPriorityQueue(int capacity)
capacity - the initial capacity of this queue.public LongArrayPriorityQueue(LongComparator c)
c - the comparator used in this queue, or null for the natural order.public LongArrayPriorityQueue()
public LongArrayPriorityQueue(long[] a,
int size,
LongComparator 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 LongArrayPriorityQueue(long[] a,
LongComparator 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 LongArrayPriorityQueue(long[] 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 LongArrayPriorityQueue(long[] a)
The queue returned by this method will be backed by the given array.
a - an array.public void enqueue(long x)
LongPriorityQueueenqueue in interface LongPriorityQueuex - the element to enqueue.public long dequeueLong()
LongPriorityQueuedequeueLong in interface LongPriorityQueuepublic long firstLong()
LongPriorityQueuefirstLong in interface LongPriorityQueuepublic void changed()
PriorityQueuechanged in interface PriorityQueue<Long>changed in class AbstractPriorityQueue<Long>public int size()
PriorityQueuesize in interface PriorityQueue<Long>public void clear()
PriorityQueueclear in interface PriorityQueue<Long>public void trim()
size() elements.public LongComparator comparator()
LongPriorityQueueNote that this specification strengthens the one given in PriorityQueue.comparator().
comparator in interface LongPriorityQueuecomparator in interface PriorityQueue<Long>null if it uses its elements' natural ordering.PriorityQueue.comparator()