Îõ³h$ ó W     None '(>?ÀÁÂÙ 1lazy-priority-queueÁA lazy-spined priority queue where the type parameters t c a are:ðt for a phantom that can be either Pruned for a single-item container or Branching for a growing priority queue;&c for the cost type, like Sum Int; anda for the valueslazy-priority-queue withCost k0 adds a penalty of k to each value in the queue.lazy-priority-queue=Fold together all stored values that share the same priority.lazy-priority-queueÚImposes the given cost on the current computation branch. > cost k = withCost k (pure ())lazy-priority-queue Relax the 2 phantom constraint, allowing the queue to become .lazy-priority-queueÀPrune away all stored values more expensive than the given cost.lazy-priority-queueçPrune away all stored values more expensive than the given cost and a less expensive alternative value. lazy-priority-queueÕPrune away all stored values except the one with the least penalty, making the queue . lazy-priority-queueæMinimize the queue structure. This operation forces the entire spine of the queue and its every level. lazy-priority-queueÉFilter away from the queue the values that the argument function maps to  lazy-priority-queueõAssuming the stored values belong to a cancellative monoid, prune away all extraneous values and factors using the supplied function that calculates the sum and difference of the two values, if there is any difference, and the monoid null. > fold (pruneSubsets plusDiff mempty pq) == fold pq > where plusDiff u a > | gcd u a == a = Nothing > | d  -a - gcd u a = Just (u < d, d) lazy-priority-queueÚReturns the pair of the GCD of all the penalties and the penalties without the GCD > gcd  *1 rest == f > where (gcd, rest) = stripCommon flazy-priority-queueØSubtract the first argument cost GCD from the cost of every value in the second argumentlazy-priority-queueReturns ( the minimal cost present in the queue,  if the queue is empty.lazy-priority-queueÒMaps each item contained in the queue, supplying the item's cost as first argument           !"#!"$%2lazy-priority-queue-0.1.0.2-LdOEhpBSHgdANijXfITbIJData.PriorityQueuePQueuePruned BranchingwithCost foldPeerscost branchable pruneAbovepruneAlternativesAboveprune canonicalfilter pruneSubsets stripCommonstrip leastCost mapWithCost$fApplicativeGround$fFunctorGround$fFoldableGround $fMonadPQueue$fAlternativePQueue$fAlternativePQueue0$fApplicativePQueue$fFunctorPQueue$fFoldablePQueue $fShowPQueue $fShowGroundghc-prim GHC.TypesFalsebase GHC.MaybeJustNothing