|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface IntPriorityQueue
A type-specific PriorityQueue; provides some additional methods that use polymorphism to avoid (un)boxing.
Additionally, this interface strengthens comparator().
| Method Summary | |
|---|---|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering. |
int |
dequeueInt()
Dequeues the first element from the queue. |
void |
enqueue(int x)
Enqueues a new element. |
int |
firstInt()
Returns the front element of the queue. |
int |
lastInt()
Returns the rear element of the queue, that is, the element the would be dequeued last (optional operation). |
| Methods inherited from interface it.unimi.dsi.fastutil.PriorityQueue |
|---|
changed, clear, dequeue, enqueue, first, isEmpty, last, size |
| Method Detail |
|---|
void enqueue(int x)
x - the element to enqueue..int dequeueInt()
NoSuchElementException - if the queue is empty.int firstInt()
NoSuchElementException - if the queue is empty.int lastInt()
NoSuchElementException - if the queue is empty.IntComparator comparator()
Note that this specification strengthens the one given in PriorityQueue.comparator().
comparator in interface PriorityQueue<Integer>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 | ||||||||