!z f      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdeZiyang Liu <free@cofree.io>Safe2PSXG#&min-max-pqueueAA double-ended priority queue whose elements are compared on an f field.min-max-pqueueO(1). The empty queue.min-max-pqueueO(1) . A queue with a single element.min-max-pqueue O(n * log n)9. Build a queue from a list of (priority, element) pairs.min-max-pqueue O(n * log n)T. Build a queue from a list of elements and a function from elements to priorities.min-max-pqueueO(n)% (due to calculating the queue size).min-max-pqueueO(1). Is the queue empty?min-max-pqueueO(1). Is the queue non-empty? min-max-pqueueO(1),. The total number of elements in the queue. min-max-pqueueReturn a queue that is limited to the given number of elements. If the original queue has more elements than the size limit, the greatest elements will be dropped until the size limit is satisfied. min-max-pqueueO(1)1. The size limit of the queue. It returns either Nothing/ (if the queue does not have a size limit) or Just n where n >= 0. min-max-pqueueO(log n). Add the given element to the queue. If the queue has a size limit, and the insertion causes the queue to grow beyond its size limit, the greatest element will be removed from the queue, which may be the element just added. min-max-pqueueO(log n)5. Retrieve the least element of the queue, if exists.min-max-pqueueO(log n)8. Retrieve the greatest element of the queue, if exists.min-max-pqueueO(log n)3. Remove the least element of the queue, if exists.min-max-pqueueO(log n)6. Remove the greatest element of the queue, if exists.min-max-pqueueO(log n)>. Remove and return the least element of the queue, if exists.min-max-pqueueO(log n)A. Remove and return the greatest element of the queue, if exists.min-max-pqueue n q returns a queue with the n least elements in q, or q itself if n >=   q.min-max-pqueue n q returns a queue with the n greatest elements in q, or q itself if n >=   q.min-max-pqueue n q returns a queue with the n least elements dropped from q, or  if n >=   q.min-max-pqueue n q returns a queue with the n! greatest elements dropped from q, or  if n >=   q.min-max-pqueue.Map a function over all elements in the queue.min-max-pqueue.Map a function over all elements in the queue.min-max-pqueue]Fold the elements in the queue using the given right-associative binary operator, such that  f z == g f z . ".min-max-pqueue\Fold the elements in the queue using the given left-associative binary operator, such that  f z == h f z . ".min-max-pqueue^Fold the elements in the queue using the given right-associative binary operator, such that  f z == g (i f) z . $.min-max-pqueue]Fold the elements in the queue using the given left-associative binary operator, such that  f z == g (i . f) z . $.min-max-pqueueA strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.min-max-pqueueA strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.min-max-pqueueA strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value. min-max-pqueueA strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.!min-max-pqueueBFold the elements in the queue using the given monoid, such that ! f == j (uncurry f) . "."min-max-pqueue{Elements in the queue in ascending order of priority. Elements with the same priority are returned in no particular order.#min-max-pqueue An alias for $.$min-max-pqueueConvert the queue to a list in ascending order of priority. Elements with the same priority are returned in no particular order.%min-max-pqueueConvert the queue to a list in descending order of priority. Elements with the same priority are returned in no particular order.&min-max-pqueueO(n). Convert the queue to an k.'  !"#$%&' ! "#$%&Ziyang Liu <free@cofree.io>Safe2PSXy&2min-max-pqueue9A double-ended priority queue whose elements are of type a and are compared on prio.3min-max-pqueueO(1). The empty queue.4min-max-pqueueO(1) . A queue with a single element.5min-max-pqueue O(n * log n)9. Build a queue from a list of (priority, element) pairs.6min-max-pqueue O(n * log n)T. Build a queue from a list of elements and a function from elements to priorities.7min-max-pqueueO(n)% (due to calculating the queue size).8min-max-pqueueO(1). Is the queue empty?9min-max-pqueueO(1). Is the queue non-empty?:min-max-pqueueO(1),. The total number of elements in the queue.;min-max-pqueueReturn a queue that is limited to the given number of elements. If the original queue has more elements than the size limit, the greatest elements will be dropped until the size limit is satisfied.<min-max-pqueueO(1)1. The size limit of the queue. It returns either Nothing/ (if the queue does not have a size limit) or Just n where n >= 0.=min-max-pqueueO(log n). Add the given element to the queue. If the queue has a size limit, and the insertion causes the queue to grow beyond its size limit, the greatest element will be removed from the queue, which may be the element just added.>min-max-pqueueO(log n)5. Retrieve the least element of the queue, if exists.?min-max-pqueueO(log n)8. Retrieve the greatest element of the queue, if exists.@min-max-pqueueO(log n)3. Remove the least element of the queue, if exists.Amin-max-pqueueO(log n)6. Remove the greatest element of the queue, if exists.Bmin-max-pqueueO(log n)>. Remove and return the least element of the queue, if exists.Cmin-max-pqueueO(log n)A. Remove and return the greatest element of the queue, if exists.Dmin-max-pqueueD n q returns a queue with the n least elements in q, or q itself if n >= : q.Emin-max-pqueueD n q returns a queue with the n greatest elements in q, or q itself if n >= : q.Fmin-max-pqueueF n q returns a queue with the n least elements dropped from q, or 3 if n >= : q.Gmin-max-pqueueG n q returns a queue with the n! greatest elements dropped from q, or 3 if n >= : q.Hmin-max-pqueue.Map a function over all elements in the queue.Imin-max-pqueue.Map a function over all elements in the queue.Jmin-max-pqueue]Fold the elements in the queue using the given right-associative binary operator, such that J f z == g f z . S.Kmin-max-pqueue\Fold the elements in the queue using the given left-associative binary operator, such that K f z == h f z . S.Lmin-max-pqueue^Fold the elements in the queue using the given right-associative binary operator, such that L f z == g (i f) z . U.Mmin-max-pqueue]Fold the elements in the queue using the given left-associative binary operator, such that M f z == g (i . f) z . U.Nmin-max-pqueueA strict version of J. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.Omin-max-pqueueA strict version of K. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.Pmin-max-pqueueA strict version of L. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.Qmin-max-pqueueA strict version of M. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.Rmin-max-pqueueBFold the elements in the queue using the given monoid, such that R f == j (uncurry f) . S.Smin-max-pqueue{Elements in the queue in ascending order of priority. Elements with the same priority are returned in no particular order.Tmin-max-pqueue An alias for U.Umin-max-pqueueConvert the queue to a list in ascending order of priority. Elements with the same priority are returned in no particular order.Vmin-max-pqueueConvert the queue to a list in descending order of priority. Elements with the same priority are returned in no particular order.Wmin-max-pqueueO(n). Convert the queue to a l.&23456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVW&23456789:;<=>?@ABCDEFGHIJKLMRNOPQSTUVWSafemnopqrstu      !"#$%&'()*+,-./0123456      !"#$%&'()*789:;<=>?@ABCDEFGHIHIHJKHILMNOMPQRSTUVWXYZ-min-max-pqueue-0.1.0.1-31RrILb4JKE9g9TmwfJgHwData.IntMinMaxQueueData.MinMaxQueuePaths_min_max_pqueueIntMinMaxQueuePrioempty singletonfromList fromListWithfromMapnullnotNullsize withMaxSizemaxSizeinsertpeekMinpeekMax deleteMin deleteMaxpollMinpollMaxtakeMintakeMaxdropMindropMaxmapmapWithPriorityfoldrfoldlfoldrWithPriorityfoldlWithPriorityfoldr'foldl'foldrWithPriority'foldlWithPriority'foldMapWithPriorityelemstoList toAscList toDescListtoMap$fFoldableIntMinMaxQueue$fFunctorIntMinMaxQueue$fRead1IntMinMaxQueue$fReadIntMinMaxQueue$fShow1IntMinMaxQueue$fShowIntMinMaxQueue$fOrd1IntMinMaxQueue$fEq1IntMinMaxQueue$fEqIntMinMaxQueue$fOrdIntMinMaxQueue$fDataIntMinMaxQueue MinMaxQueue$fFoldableMinMaxQueue$fFunctorMinMaxQueue$fRead1MinMaxQueue$fReadMinMaxQueue$fShow2MinMaxQueue$fShow1MinMaxQueue$fShowMinMaxQueue$fOrd2MinMaxQueue$fOrd1MinMaxQueue$fEq2MinMaxQueue$fEq1MinMaxQueue$fEqMinMaxQueue$fOrdMinMaxQueue$fDataMinMaxQueueghc-prim GHC.TypesIntbase Data.Foldable Data.TupleuncurryfoldMapcontainers-0.6.0.1Data.IntMap.InternalIntMapData.Map.InternalMapversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName