Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

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

   distribution-opensuse	OpenSuse.Prelude

   A version of mapMaybe that works with a monadic predicate.

2. mappend :: Monoid a => a -> a -> a

   distribution-opensuse	OpenSuse.Prelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

3. mappend :: Monoid a => a -> a -> a

   distribution-opensuse	OpenSuse.Prelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

4. mapExcept :: (Either e a -> Either e' b) -> Except e a -> Except e' b

   dunai	Control.Monad.Trans.MSF.Except

   Map the unwrapped computation using the given function.

   • runExcept (mapExcept f m) = f (runExcept
     m)

5. mapExceptT :: (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b

   dunai	Control.Monad.Trans.MSF.Except

   Map the unwrapped computation using the given function.

   • runExceptT (mapExceptT f m) = f
     (runExceptT m)

6. mapMSF :: forall (m :: Type -> Type) a b . Monad m => MSF m a b -> MSF m [a] [b]

   dunai	Control.Monad.Trans.MSF.List

   Apply an MSF to every input.

7. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   dunai	Control.Monad.Trans.MSF.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

8. mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b

   dunai	Control.Monad.Trans.MSF.RWS

   Map the return value, final state and output of a computation using the given function.

   • runRWS (mapRWS f m) r s = f (runRWS m r
     s)

9. mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b

   dunai	Control.Monad.Trans.MSF.RWS

   Map the inner computation using the given function.

   • runRWST (mapRWST f m) r s = f (runRWST m
     r s)

10. mapReader :: (a -> b) -> Reader r a -> Reader r b

    dunai	Control.Monad.Trans.MSF.Reader

    Transform the value returned by a Reader.

    • runReader (mapReader f m) = f .
      runReader m

Page 330 of many | Previous | Next