Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. mapAccum :: ((a, w) -> (b, w)) -> Accum w a -> Accum w b

   transformers	Control.Monad.Trans.Accum

   Map both the return value and output of a computation using the given function.

   • runAccum (mapAccum f m) = f . runAccum
     m

2. mapAccumT :: (m (a, w) -> n (b, w)) -> AccumT w m a -> AccumT w n b

   transformers	Control.Monad.Trans.Accum

   Map both the return value and output of a computation using the given function.

   • runAccumT (mapAccumT f m) = f .
     runAccumT m

3. mapCont :: (r -> r) -> Cont r a -> Cont r a

   transformers	Control.Monad.Trans.Cont

   Apply a function to transform the result of a continuation-passing computation.

   • runCont (mapCont f m) = f . runCont
     m

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

   transformers	Control.Monad.Trans.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

   transformers	Control.Monad.Trans.Except

   Map the unwrapped computation using the given function.

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

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

   transformers	Control.Monad.Trans.Maybe

   Transform the computation inside a MaybeT.

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

7. mapRWS :: (Monoid w, Monoid w') => ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b

   transformers	Control.Monad.Trans.RWS.CPS

   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)

8. mapRWST :: (Monad n, Monoid w, Monoid w') => (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b

   transformers	Control.Monad.Trans.RWS.CPS

   Map the inner computation using the given function.

   • runRWST (mapRWST f m) r s = f (runRWST m r s) mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b

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

   transformers	Control.Monad.Trans.RWS.Lazy

   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)

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

    transformers	Control.Monad.Trans.RWS.Lazy

    Map the inner computation using the given function.

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

Page 64 of many | Previous | Next