Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybe :: Ord b => (a -> Maybe b) -> MaxQueue a -> MaxQueue bpqueue Data.PQueue.Max Maps a function over the elements of the queue, and collects the Just values.
mapMaybe :: Ord b => (a -> Maybe b) -> MinQueue a -> MinQueue bpqueue Data.PQueue.Min Map elements and collect the Just results.
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.
mapMWithKey :: (Ord k, Monad m) => (k -> a -> m b) -> MinPQueue k a -> m (MinPQueue k b)pqueue Data.PQueue.Prio.Min 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) -> MinPQueue k a -> MinPQueue k bpqueue Data.PQueue.Prio.Min Map values and collect the Just results.
mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MinPQueue k a -> MinPQueue k bpqueue Data.PQueue.Prio.Min Map values and collect the Just results.
-
bound Bound.Scope mapM over both bound and free variables
-
bound Bound.Scope mapM_ over the variables bound by this scope