Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapExn :: forall e2 e1 (m :: Type -> Type) . (e2 -> e1) -> (e1 -> Maybe e2) -> Exn m e1 -> Exn m e2

   monadology	Control.Monad.Ology.Data.Exn

   No documentation available.

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

   monadology	Control.Monad.Ology.Specific.ContT

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

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

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

   monadology	Control.Monad.Ology.Specific.ExceptT

   Map the unwrapped computation using the given function.

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

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

   monadology	Control.Monad.Ology.Specific.ExceptT

   Map the unwrapped computation using the given function.

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

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

   monadology	Control.Monad.Ology.Specific.MaybeT

   Transform the computation inside a MaybeT.

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

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

   monadology	Control.Monad.Ology.Specific.ReaderT

   Transform the value returned by a Reader.

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

7. mapReaderT :: (m a -> n b) -> ReaderT r m a -> ReaderT r n b

   monadology	Control.Monad.Ology.Specific.ReaderT

   Transform the computation inside a ReaderT.

   • runReaderT (mapReaderT f m) = f .
     runReaderT m

8. mapResultFailure :: (e1 -> e2) -> Result e1 a -> Result e2 a

   monadology	Control.Monad.Ology.Specific.Result

   No documentation available.

9. mapState :: ((a, s) -> (b, s)) -> State s a -> State s b

   monadology	Control.Monad.Ology.Specific.StateT

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

   • runState (mapState f m) = f . runState
     m

10. mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b

    monadology	Control.Monad.Ology.Specific.StateT

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

    • runStateT (mapStateT f m) = f .
      runStateT m

Page 308 of many | Previous | Next