Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. mapMaybe' :: Foldable f => (a -> Maybe b) -> f a -> [b]

   ghc-lib-parser	GHC.Utils.Misc

   No documentation available.

2. mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]

   ghc-lib-parser	GHC.Utils.Monad

   Applicative version of mapMaybe

3. mapMaybe :: Ord b => (a -> Maybe b) -> MaxQueue a -> MaxQueue b

   pqueue	Data.PQueue.Max

   Maps a function over the elements of the queue, and collects the Just values.

4. mapMaybe :: Ord b => (a -> Maybe b) -> MinQueue a -> MinQueue b

   pqueue	Data.PQueue.Min

   Map elements and collect the Just results.

5. 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 () = ⊥.

6. mapMaybe :: Ord k => (a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k b

   pqueue	Data.PQueue.Prio.Max

   Map values and collect the Just results.

7. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k b

   pqueue	Data.PQueue.Prio.Max

   Map values and collect the Just results.

8. 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 () = ⊥.

9. mapMaybe :: Ord k => (a -> Maybe b) -> MinPQueue k a -> MinPQueue k b

   pqueue	Data.PQueue.Prio.Min

   Map values and collect the Just results.

10. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MinPQueue k a -> MinPQueue k b

    pqueue	Data.PQueue.Prio.Min

    Map values and collect the Just results.

Page 37 of many | Previous | Next