úΈ|     brad.larsen@gmail.comA queue of values of type a with priority of type p. O(1) An empty priority queue. O(1)) Test whether a priority queue is empty. O(1)' A priority queue with a single entry. O(log p); Insert a value with given priority into a priority queue. O(log p)5 Remove the value with the minimum priority from the  queue. If the queue is empty,  returns  . Ties are  broken arbitrarily. O(log p)5 Remove the value with the maximum priority from the  queue. If the queue is empty,  returns  . Ties are  broken arbitrarily.  Applies a  Data.Map.Map* view function to a given priority queue. The view function The priority queue O(log p)4 View a priority queue to get the (value, priority) ? pair with the lowest priority and the remainder of the queue. Ties are broken arbitrarily. O(log p)4 View a priority queue to get the (value, priority) @ pair with the highest priority and the remainder of the queue. Ties are broken arbitrarily. O(log p)8 Get the minimum priority of the elements in the queue. O(log p)8 Get the maximum priority of the elements in the queue. O(n)5 Fold the priorities and values of a priority queue. O(log p) Split a priority queue q into two queues (q1, q2)  by the given priority p , such that q1 contains exactly the ! entries with priority less than p, and q2 containes exactly the 0 entries with priority greater than or equal to p. O(n), The number of entries in a priority queue.  O(n log p)/ Filter all values that satisfy the predicate.  O(n log p)0 Filter all entries that satisfy the predicate. O(n)3 Convert the priority queue into a list of (value, ( priority) pairs in ascending priority. (Ties are broken in an arbitrary manner.    brad.larsen@gmail.com       pure-priority-queue-0.14Data.PurePriorityQueue.InternalData.PurePriorityQueue MinMaxQueue unMinMaxQueueemptynull singletoninsert deleteMin deleteMaxviewWithminViewmaxView minPriority maxPriorityfoldWithPrioritysplitByPrioritysizefilterfilterWithPriority toAscList