|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.IndirectPriorityQueues.SynchronizedIndirectPriorityQueue<K>
public static class IndirectPriorityQueues.SynchronizedIndirectPriorityQueue<K>
A synchronized wrapper class for indirect priority queues.
Field Summary | |
---|---|
static long |
serialVersionUID
|
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<? super K> |
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 x)
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 |
Field Detail |
---|
public static final long serialVersionUID
Method Detail |
---|
public void enqueue(int x)
IndirectPriorityQueue
enqueue
in interface IndirectPriorityQueue<K>
x
- the element to enqueue..public int dequeue()
IndirectPriorityQueue
dequeue
in interface IndirectPriorityQueue<K>
public int first()
IndirectPriorityQueue
first
in interface IndirectPriorityQueue<K>
public int last()
IndirectPriorityQueue
last
in interface IndirectPriorityQueue<K>
public boolean isEmpty()
IndirectPriorityQueue
isEmpty
in interface IndirectPriorityQueue<K>
public int size()
IndirectPriorityQueue
size
in interface IndirectPriorityQueue<K>
public void clear()
IndirectPriorityQueue
clear
in interface IndirectPriorityQueue<K>
public void changed()
IndirectPriorityQueue
changed
in interface IndirectPriorityQueue<K>
public void allChanged()
IndirectPriorityQueue
allChanged
in interface IndirectPriorityQueue<K>
public void changed(int i)
IndirectPriorityQueue
Note that the specified element must belong to the queue.
changed
in interface IndirectPriorityQueue<K>
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<K>
i
- the element to be removed.public java.util.Comparator<? super K> comparator()
IndirectPriorityQueue
null
if it uses its elements' natural ordering.
comparator
in interface IndirectPriorityQueue<K>
null
if it uses its elements' natural ordering.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.
front
in interface IndirectPriorityQueue<K>
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 |