PriorityQueue<K,A> |
PriorityQueue.dequeue() |
Removes the node with the highest priority.
|
PriorityQueue<K,A> |
PriorityQueue.dequeue(int n) |
Removes the top n elements with the highest priority.
|
static <K,A> PriorityQueue<K,A> |
PriorityQueue.empty(Monoid<K> m,
Equal<K> e) |
Creates an empty priority queue.
|
static <A> PriorityQueue<java.lang.Integer,A> |
PriorityQueue.emptyInt() |
An empty priority queue with integer priorities.
|
PriorityQueue<K,A> |
PriorityQueue.enqueue(List<P2<K,A>> list) |
Adds nodes using the list of products with priority k and value a.
|
PriorityQueue<K,A> |
PriorityQueue.enqueue(P2<K,A> p) |
Adds a node with priority k and value a.
|
PriorityQueue<K,A> |
PriorityQueue.enqueue(java.lang.Iterable<P2<K,A>> it) |
Adds nodes using the iterable of products with priority k and value a.
|
PriorityQueue<K,A> |
PriorityQueue.enqueue(K k,
A a) |
Adds a node with priority k and value a.
|
PriorityQueue<K,A> |
PriorityQueue.filterKeys(F<K,java.lang.Boolean> f) |
Filters the nodes based on the annotation of each node.
|
PriorityQueue<K,A> |
PriorityQueue.filterValues(F<A,java.lang.Boolean> f) |
Filters nodes based on the value inside each node.
|
<B> PriorityQueue<K,B> |
PriorityQueue.map(F<A,B> f) |
Maps the values in each node with function f.
|
static <K,A> PriorityQueue<K,A> |
PriorityQueue.priorityQueue(Equal<K> e,
FingerTree<K,P2<K,A>> ft) |
Creates a priority queue from a finger tree.
|