mapKeys package:pqueue

mapKeys :: Ord k' => (k -> k') -> MaxPQueue k a -> MaxPQueue k' a

Map a function over all values in the queue.

mapKeys :: Ord k' => (k -> k') -> MinPQueue k a -> MinPQueue k' a

mapKeys f q is the queue obtained by applying f to each key of q.

mapKeysMonotonic :: (k -> k') -> MaxPQueue k a -> MaxPQueue k' a

mapKeysMonotonic f q == mapKeys f q, but only works when f is strictly monotonic. The precondition is not checked. This function has better performance than mapKeys.

mapKeysMonotonic :: (k -> k') -> MinPQueue k a -> MinPQueue k' a

pqueue Data.PQueue.Prio.Min

mapKeysMonotonic f q == mapKeys f q, but only works when f is (weakly) monotonic. The precondition is not checked. This function has better performance than mapKeys. Note: if the given function returns bottom for any of the keys in the queue, then the portion of the queue which is bottom is unspecified.