úÎQN['      !"#$%&-Policy type for a (priority, value) . Policy type for a (priority, value) . Policy type for a . Policy type for a  . The 9 class defines an order on the elements contained within  a  .  Compare two elements, just like ' of the ( class, so this > function has to define a mathematical ordering. When using a   for a  =, the minimal value (defined by this order) will be the head  of the  . Must not be evaluated. Compared to 3rd parameter. Compared to 2nd parameter. Result of the comparison. A  C storing priority-value-associations. It only regards the priority ? for determining the order of elements, the tuple with maximal ) value 1 (i. e. priority) will always be the head of the  . A  C storing priority-value-associations. It only regards the priority ? for determining the order of elements, the tuple with minimal ) value 1 (i. e. priority) will always be the head of the  . A  . which will always extract the maximum first. A  . which will always extract the minimum first.  The basic   type. *+ O(1) . Is the   empty? O(1) . Is the   empty? ,O(1). Calculate the rank of a  . O(1) . The number of elements in the  . -This function is .- and just used as a type-helper to determine  the first parameter of . O(1) . Returns the first item of the  , according to its . Warning: This function issues an / for empty  s, please consider  using the  function instead, it's safe. O(log n). Returns the   with the  removed. Warning: This function issues an / for empty  s, please consider  using the  function instead, it's safe. O(log n) for the tail, O(1)+ for the head. Find the minimum (depending  on the ) and delete it from the   (i. e. find head and tail + of a heap) if it is not empty. Otherwise, 0 is returned. O(log n) . Returns  and  of a  . Warning: This function issues an / for empty  s, please consider  using the  function instead, it's safe. O(1). Constructs an empty  . O(1). Create a singleton  . O(log n). Insert an element in the  . 1O(1). Insert an element into the  # that is smaller than all elements  currently in the   (according to the ), i. e. an element  that will be the new  of the  . The precondition is not checked. Take the lowest n$ elements in ascending order of the   (according  to the ). $Remove the lowest (according to the ) n elements  from the  .  n h) returns an ascending list of the lowest n elements of h  (according to its ) and a   like h, lacking those elements.  p h9 lists the longest prefix of elements in ascending order  (according to its ) of h that satisfy p.  p h- removes the longest prefix of elements from h that  satisfy p.  p h; returns the longest prefix of elements in ascending order  (according to its ) of h that satisfy p and a   like  h, with those elements removed.  p h; returns the longest prefix of elements in ascending order  (according to its ) of h that do not satisfy p and a    like h, with those elements removed. O(log max(n, m)). The union of two  s. 2Combines a value x and two   s to one   . Therefore, x has to / be less or equal the minima (depending on the  ) of both    parameters. The precondition is not checked.  Builds the union over all given  s. "Removes all elements from a given  # that do not fulfil the predicate. Partition the   into two.  p h = (h1, h2): All elements  in h1 fulfil the predicate p , those in h2 don't.  h1 h2 = h.  Builds a  ; from the given elements. Assuming you have a sorted list,  you may want to use % or #, they are both faster  than this function. !O(n). Lists elements of the   in no specific order. "O(n). Lists elements of the   in no specific order. #O(n) . Creates a  3 from an ascending list. Note that the list has to # be ascending corresponding to the  , not to its ( instance = declaration (if there is one). This function is faster than   but  not as fast as %. The precondition is not checked. $O(n). Lists elements of the  & in ascending order (corresponding to  the ). %O(n) . Create a  3 from a descending list. Note that the list has to $ be descending corresponding to the  , not to its ( instance N declaration (if there is one). This function is provided, because it is much  faster than   and #. The precondition is not checked. &O(n). Lists the elements on the  $ in descending order (corresponding  to the ;). Note that this function is not especially efficient (it  is implemented as 3 . $), it is just provided as a # counterpart of the very efficient % function. '  !"#$%&'   !"#$%&'  !"#$%&4      !"#$%&'()*+)*,)-./012)34)35)6789):;< heap-0.6.0 Data.Heap FstMaxPolicy FstMinPolicy MaxPolicy MinPolicy HeapPolicy heapCompare MaxPrioHeap MinPrioHeapMaxHeapMinHeapHeapnullisEmptysizeheadtailview extractHeadempty singletoninserttakedropsplitAt takeWhile dropWhilespanbreakunionunionsfilter partitionfromListtoListelems fromAscList toAscList fromDescList toDescListbase GHC.ClassescompareOrd Data.TuplefstTreeEmptyrankpolicyGHC.Err undefinederror Data.MaybeNothing insertMinmakeTGHC.Listreverse