Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. lensMaybeLazy :: forall a f . Functor f => (Maybe a -> f (Maybe a)) -> Maybe a -> f (Maybe a)

   Agda	Agda.Utils.Maybe.Strict

   No documentation available.

2. unionMaybeWith :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a

   Agda	Agda.Utils.Maybe.Strict

   unionWith for collections of size <= 1.

3. unzipMaybe :: Maybe (a, b) -> (Maybe a, Maybe b)

   Agda	Agda.Utils.Maybe.Strict

   Unzipping a list of length <= 1.

4. catMaybesMP :: MonadPlus m => m (Maybe a) -> m a

   Agda	Agda.Utils.Monad

   Generalises the catMaybes function from lists to an arbitrary MonadPlus.

5. forMaybeM :: Monad m => [a] -> (a -> m (Maybe b)) -> m [b]

   Agda	Agda.Utils.Monad

   The for version of mapMaybeM.

6. forMaybeMM :: Monad m => m [a] -> (a -> m (Maybe b)) -> m [b]

   Agda	Agda.Utils.Monad

   The for version of mapMaybeMM.

7. fromMaybeMP :: MonadPlus m => Maybe a -> m a

   Agda	Agda.Utils.Monad

   Translates Maybe to MonadPlus.

8. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

   Agda	Agda.Utils.Monad

   A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].

9. mapMaybeMM :: Monad m => (a -> m (Maybe b)) -> m [a] -> m [b]

   Agda	Agda.Utils.Monad

   A version of mapMaybeM with a computation for the input list.

10. tryMaybe :: (MonadError e m, Functor m) => m a -> m (Maybe a)

    Agda	Agda.Utils.Monad

    Try a computation, return Nothing if an Error occurs.

Page 261 of many | Previous | Next