|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.AbstractPriorityQueue<Long>
it.unimi.dsi.fastutil.longs.AbstractLongPriorityQueue
it.unimi.dsi.fastutil.longs.LongArrayPriorityQueue
public class LongArrayPriorityQueue
A type-specific array-based priority queue.
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.
Field Summary | |
---|---|
protected long[] |
array
The backing array. |
protected LongComparator |
c
The type-specific comparator used in this queue. |
protected int |
size
The number of elements in this queue. |
Constructor Summary | |
---|---|
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. |
Method Summary | |
---|---|
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 an element. |
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. |
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongPriorityQueue |
---|
dequeue, enqueue, first, last, lastLong |
Methods inherited from class it.unimi.dsi.fastutil.AbstractPriorityQueue |
---|
isEmpty |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.PriorityQueue |
---|
isEmpty |
Field Detail |
---|
protected long[] array
protected int size
protected LongComparator c
Constructor Detail |
---|
public 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.Method Detail |
---|
public void enqueue(long x)
LongPriorityQueue
x
- the element to enqueue.public long dequeueLong()
Note that each call to this method requires a complete scan of the backing array. Please consider caching its result.
public long firstLong()
LongPriorityQueue
public void changed()
PriorityQueue
changed
in interface PriorityQueue<Long>
changed
in class AbstractPriorityQueue<Long>
public int size()
PriorityQueue
public void clear()
PriorityQueue
public void trim()
size()
elements.
public LongComparator comparator()
LongPriorityQueue
Note that this specification strengthens the one given in PriorityQueue.comparator()
.
null
if it uses its elements' natural ordering.PriorityQueue.comparator()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |