map -package:containers -package:imports -package:Cabal-syntax -package:integration -package:bytestring -package:charset -package:basement -package:monoidal-containers -package:hedgehog -package:conduit -package:ghc -package:text -package:unordered-containers -package:base-compat -package:base package:psqueues

map :: (k -> p -> v -> w) -> HashPSQ k p v -> HashPSQ k p w
psqueues Data.HashPSQ
O(n) Modify every value in the queue.
map :: (Int -> p -> v -> w) -> IntPSQ p v -> IntPSQ p w
psqueues Data.IntPSQ
O(n) Modify every value in the queue.
map :: forall k p v w . (k -> p -> v -> w) -> OrdPSQ k p v -> OrdPSQ k p w
psqueues Data.OrdPSQ
O(n) Modify every value in the queue.
unsafeMapMonotonic :: (k -> p -> v -> (q, w)) -> HashPSQ k p v -> HashPSQ k q w
psqueues Data.HashPSQ
O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.
unsafeMapMonotonic :: (Key -> p -> v -> (q, w)) -> IntPSQ p v -> IntPSQ q w
psqueues Data.IntPSQ
O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.
unsafeMapMonotonic :: forall k p q v w . (k -> p -> v -> (q, w)) -> OrdPSQ k p v -> OrdPSQ k q w
psqueues Data.OrdPSQ
O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.