Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

  1. caseMaybe :: Maybe a -> b -> (a -> b) -> b

    Agda Agda.Utils.Maybe.Strict

    Version of maybe with different argument ordering. Often, we want to case on a Maybe, do something interesting in the Just case, but only a default action in the Nothing case. Then, the argument ordering of caseMaybe is preferable.

    caseMaybe m err f = flip (maybe err) m f
    

  2. caseMaybeM :: Monad m => m (Maybe a) -> m b -> (a -> m b) -> m b

    Agda Agda.Utils.Maybe.Strict

    Monadic version of caseMaybe. That is, maybeM with a different argument ordering.

  3. filterMaybe :: (a -> Bool) -> a -> Maybe a

    Agda Agda.Utils.Maybe.Strict

    Filtering a singleton list.

    filterMaybe p a = listToMaybe (filter p [a])
    

  4. forMaybe :: [a] -> (a -> Maybe b) -> [b]

    Agda Agda.Utils.Maybe.Strict

    Version of mapMaybe with different argument ordering.

  5. fromMaybeM :: Monad m => m a -> m (Maybe a) -> m a

    Agda Agda.Utils.Maybe.Strict

    Monadic version of fromMaybe.

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

    Agda Agda.Utils.Maybe.Strict

    No documentation available.

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

    Agda Agda.Utils.Maybe.Strict

    unionWith for collections of size <= 1.

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

    Agda Agda.Utils.Maybe.Strict

    Unzipping a list of length <= 1.

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

    Agda Agda.Utils.Monad

    Generalises the catMaybes function from lists to an arbitrary MonadPlus.

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

    Agda Agda.Utils.Monad

    The for version of mapMaybeM.

Page 265 of many | Previous | Next