Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybe :: Ord b => (a -> Maybe b) -> MinQueue a -> MinQueue bpqueue Data.PQueue.Min Map elements and collect the Just results.
mapU :: (a -> b) -> MinQueue a -> MinQueue bpqueue Data.PQueue.Min Assumes that the function it is given is (weakly) monotonic, and applies this function to every element of the priority queue, as in fmap. If the function is not monotonic, the result is undefined.
mapEither :: Ord k => (a -> Either b c) -> MaxPQueue k a -> (MaxPQueue k b, MaxPQueue k c)pqueue Data.PQueue.Prio.Max -
pqueue Data.PQueue.Prio.Max mapKeys :: Ord k' => (k -> k') -> MaxPQueue k a -> MaxPQueue k' apqueue Data.PQueue.Prio.Max Map a function over all values in the queue.
mapKeysMonotonic :: (k -> k') -> MaxPQueue k a -> MaxPQueue k' apqueue Data.PQueue.Prio.Max 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.
mapMWithKey :: (Ord k, Monad m) => (k -> a -> m b) -> MaxPQueue k a -> m (MaxPQueue k b)pqueue Data.PQueue.Prio.Max A strictly accumulating version of traverseWithKey. This works well in IO and strict State, and is likely what you want for other "strict" monads, where ⊥ >>= pure () = ⊥.
mapMaybe :: Ord k => (a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k bpqueue Data.PQueue.Prio.Max Map values and collect the Just results.
mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k bpqueue Data.PQueue.Prio.Max Map values and collect the Just results.
mapWithKey :: (k -> a -> b) -> MaxPQueue k a -> MaxPQueue k bpqueue Data.PQueue.Prio.Max Map a function over all values in the queue.