|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.AbstractIndirectPriorityQueue
it.unimi.dsi.fastutil.IndirectPriorityQueues.EmptyIndirectPriorityQueue
public static class IndirectPriorityQueues.EmptyIndirectPriorityQueue
An immutable class representing the empty indirect priority queue.
This class may be useful to implement your own in case you subclass
IndirectPriorityQueue
.
Method Summary | |
---|---|
void |
allChanged()
Notifies the queue that the all elements have changed (optional operation). |
void |
changed()
Notifies the queue that the first element has changed (optional operation). |
void |
changed(int i)
Notifies the queue that the specified element has changed (optional operation). |
void |
clear()
Removes all elements from this queue. |
java.util.Comparator |
comparator()
Returns the comparator associated with this queue, or null if it uses its elements' natural ordering. |
int |
dequeue()
Dequeues the first element from the queue. |
void |
enqueue(int i)
Enqueues a new element. |
int |
first()
Returns the first element of the queue. |
int |
front(int[] a)
Retrieves the front of the queue in a given array (optional operation). |
boolean |
isEmpty()
Checks whether the queue is empty. |
int |
last()
Returns the last element of the queue, that is, the element the would be dequeued last (optional operation). |
void |
remove(int i)
Removes the specified element from the queue (optional operation). |
int |
size()
Returns the number of elements in this queue. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Method Detail |
---|
public void enqueue(int i)
IndirectPriorityQueue
i
- the element to enqueue..public int dequeue()
IndirectPriorityQueue
public boolean isEmpty()
IndirectPriorityQueue
isEmpty
in interface IndirectPriorityQueue
isEmpty
in class AbstractIndirectPriorityQueue
public int size()
IndirectPriorityQueue
public void clear()
IndirectPriorityQueue
public int first()
IndirectPriorityQueue
public int last()
IndirectPriorityQueue
last
in interface IndirectPriorityQueue
last
in class AbstractIndirectPriorityQueue
public void changed()
IndirectPriorityQueue
changed
in interface IndirectPriorityQueue
changed
in class AbstractIndirectPriorityQueue
public void allChanged()
IndirectPriorityQueue
allChanged
in interface IndirectPriorityQueue
allChanged
in class AbstractIndirectPriorityQueue
public java.util.Comparator comparator()
IndirectPriorityQueue
null
if it uses its elements' natural ordering.
null
if it uses its elements' natural ordering.public void changed(int i)
IndirectPriorityQueue
Note that the specified element must belong to the queue.
changed
in interface IndirectPriorityQueue
changed
in class AbstractIndirectPriorityQueue
i
- the element that has changed.public void remove(int i)
IndirectPriorityQueue
Note that the specified element must belong to the queue.
remove
in interface IndirectPriorityQueue
remove
in class AbstractIndirectPriorityQueue
i
- the element to be removed.public int front(int[] a)
IndirectPriorityQueue
The front of an indirect queue is the set of indices whose associated elements in the reference array are equal to the element associated to the first index. These indices can be always obtain by dequeueing, but this method should retrieve efficiently such indices in the given array without modifying the state of the queue.
a
- an array large enough to hold the front (e.g., at least long as the reference array).
a
).
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |