|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.AbstractPriorityQueue<Character>
it.unimi.dsi.fastutil.chars.AbstractCharPriorityQueue
it.unimi.dsi.fastutil.chars.CharArrayPriorityQueue
public class CharArrayPriorityQueue
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.
Constructor Summary | |
---|---|
CharArrayPriorityQueue()
Creates a new empty queue using the natural order. |
|
CharArrayPriorityQueue(char[] a)
Wraps a given array in a queue using the natural order. |
|
CharArrayPriorityQueue(char[] a,
CharComparator c)
Wraps a given array in a queue using a given comparator. |
|
CharArrayPriorityQueue(char[] a,
int size)
Wraps a given array in a queue using the natural order. |
|
CharArrayPriorityQueue(char[] a,
int size,
CharComparator c)
Wraps a given array in a queue using a given comparator. |
|
CharArrayPriorityQueue(CharComparator c)
Creates a new empty queue with a given comparator. |
|
CharArrayPriorityQueue(int capacity)
Creates a new empty queue with a given capacity and using the natural order. |
|
CharArrayPriorityQueue(int capacity,
CharComparator c)
Creates a new empty queue with a given capacity and comparator. |
Method Summary | |
---|---|
void |
changed()
Notifies the queue that the first element has changed (optional operation). |
void |
clear()
Removes all elements from this queue. |
CharComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering. |
char |
dequeueChar()
Dequeues an element. |
void |
enqueue(char x)
Enqueues a new element. |
char |
firstChar()
Returns the front 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.chars.AbstractCharPriorityQueue |
---|
dequeue, enqueue, first, last, lastChar |
Methods inherited from class it.unimi.dsi.fastutil.AbstractPriorityQueue |
---|
isEmpty |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.PriorityQueue |
---|
isEmpty |
Constructor Detail |
---|
public CharArrayPriorityQueue(int capacity, CharComparator c)
capacity
- the initial capacity of this queue.c
- the comparator used in this queue, or null
for the natural order.public CharArrayPriorityQueue(int capacity)
capacity
- the initial capacity of this queue.public CharArrayPriorityQueue(CharComparator c)
c
- the comparator used in this queue, or null
for the natural order.public CharArrayPriorityQueue()
public CharArrayPriorityQueue(char[] a, int size, CharComparator 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 CharArrayPriorityQueue(char[] a, CharComparator 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 CharArrayPriorityQueue(char[] 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 CharArrayPriorityQueue(char[] a)
The queue returned by this method will be backed by the given array.
a
- an array.Method Detail |
---|
public void enqueue(char x)
CharPriorityQueue
x
- the element to enqueue..public char dequeueChar()
Note that each call to this method requires a complete scan of the backing array. Please consider caching its result.
public char firstChar()
CharPriorityQueue
public void changed()
PriorityQueue
changed
in interface PriorityQueue<Character>
changed
in class AbstractPriorityQueue<Character>
public int size()
PriorityQueue
public void clear()
PriorityQueue
public void trim()
size()
elements.
public CharComparator comparator()
CharPriorityQueue
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 |