|
||||||||||
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.CharHeapPriorityQueue
public class CharHeapPriorityQueue
A type-specific heap-based priority queue.
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.
Field Summary | |
---|---|
protected CharComparator |
c
The type-specific comparator used in this queue. |
protected char[] |
heap
The heap array. |
protected int |
size
The number of elements in this queue. |
Constructor Summary | |
---|---|
CharHeapPriorityQueue()
Creates a new empty queue using the natural order. |
|
CharHeapPriorityQueue(char[] a)
Wraps a given array in a queue using the natural order. |
|
CharHeapPriorityQueue(char[] a,
CharComparator c)
Wraps a given array in a queue using a given comparator. |
|
CharHeapPriorityQueue(char[] a,
int size)
Wraps a given array in a queue using the natural order. |
|
CharHeapPriorityQueue(char[] a,
int size,
CharComparator c)
Wraps a given array in a queue using a given comparator. |
|
CharHeapPriorityQueue(CharComparator c)
Creates a new empty queue with a given comparator. |
|
CharHeapPriorityQueue(int capacity)
Creates a new empty queue with a given capacity and using the natural order. |
|
CharHeapPriorityQueue(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 the first element from the queue. |
void |
enqueue(char x)
Enqueues a new element. |
char |
firstChar()
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. |
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 |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.PriorityQueue |
---|
isEmpty |
Field Detail |
---|
protected char[] heap
protected int size
protected CharComparator c
Constructor Detail |
---|
public CharHeapPriorityQueue(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 CharHeapPriorityQueue(int capacity)
capacity
- the initial capacity of this queue.public CharHeapPriorityQueue(CharComparator c)
c
- the comparator used in this queue, or null
for the natural order.public CharHeapPriorityQueue()
public CharHeapPriorityQueue(char[] a, int size, CharComparator 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 CharHeapPriorityQueue(char[] a, CharComparator 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 CharHeapPriorityQueue(char[] 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 CharHeapPriorityQueue(char[] 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.Method Detail |
---|
public void enqueue(char x)
CharPriorityQueue
x
- the element to enqueue.public char dequeueChar()
CharPriorityQueue
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 |