úÎ2I     % !"#$)O(1). The number of bindings in a queue.  O(1). Test if a queue is empty. @O(log n). Determine if a key is in the queue, and its priority. O(1). The empty queue. )O(1). Construct a queue with a single key/priority binding. 3O(log n). Alters a priority search queue such that 'lookup k (alter f k q) = f (lookup k q)&. This can be used to insert, delete, " or update a priority in a queue. %O(log n). Delete a key from a queue. OO(log n). Adjust the priority of a key in the queue, provided that key exists. €O(log n). Adjust the priority of a key in the queue, provided that key exists, according to a function which additionally takes  the key as a parameter. NO(log n). Update or delete a priority in the queue, provided that key exists. O(log n). Update or delete a priority in the queue, provided that key exists, according to a function which additionally takes  the key as a parameter. /O(n). Flatten a queue into a list of bindings. +O(n). Extract the list of keys of a queue. 7O(n log n). Construct a queue from a list of bindings. sO(n log n). Contstruct a queue from an already ascending list of bindings. Does not check that the list is sorted. SO(log n). Split a queue into the element with minimum priority, and the remainder. 9O(1). Find the binding with minimum priority in a queue. =O(log n). Delete the key with minimum priority from a queue. O(log n). The expression  range (l,u) q! selects the keys k from q where l <= k and k <= u. ]O(r (log n)). Finds all the bindings in a queue whose priority is less than the given value. 2Right fold over the list of bindings in a queue. 0Left fold over the list of bindings in a queue.    %      !"!#fingertree-psqueue-0.3Data.FingerTree.PSQueuePSQBinding:->sizenulllookupempty singletonalterdeleteadjust adjustWithKeyupdate updateWithKeytoListkeysfromList fromAscListminViewfindMin deleteMinrangeatMostfoldrfoldlKPSkpsKeykpsPriokpsSizeKeyNoKeyPrioPMax