Uses of Class
fj.data.PriorityQueue
Packages that use PriorityQueue
Package
Description
Types that set the premise for the existence of Functional Java.
Common algebraic data types.
-
Uses of PriorityQueue in fj
Methods in fj that return types with arguments of type PriorityQueueModifier and TypeMethodDescriptionstatic <K,
V> Show <PriorityQueue<K, V>> Show.priorityQueueShow
(Show<K> sk, Show<V> sv) -
Uses of PriorityQueue in fj.data
Methods in fj.data that return PriorityQueueModifier and TypeMethodDescriptionPriorityQueue.dequeue()
Removes the node with the highest priority.PriorityQueue.dequeue
(int n) Removes the top n elements with the highest priority.static <K,
A> PriorityQueue <K, A> Creates an empty priority queue.static <A> PriorityQueue
<Integer, A> PriorityQueue.emptyInt()
An empty priority queue with integer priorities.Adds nodes using the list of products with priority k and value a.Adds a node with priority k and value a.Adds nodes using the iterable of products with priority k and value a.Adds a node with priority k and value a.PriorityQueue.filterKeys
(F<K, Boolean> f) Filters the nodes based on the annotation of each node.PriorityQueue.filterValues
(F<A, Boolean> f) Filters nodes based on the value inside each node.<B> PriorityQueue
<K, B> 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.Methods in fj.data that return types with arguments of type PriorityQueueModifier and TypeMethodDescriptionPriorityQueue.topDequeue()
Returns a tuple of the node with the highest priority and the rest of the priority queue.Method parameters in fj.data with type arguments of type PriorityQueue