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.

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

    rebase Rebase.Prelude

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

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

    rebase Rebase.Prelude

    Map the unwrapped computation using the given function.

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

    rebase Rebase.Prelude

    Map the unwrapped computation using the given function.

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

    rebase Rebase.Prelude

    Transform the computation inside a MaybeT.

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

    rebase Rebase.Prelude

    Transform the value returned by a Reader.

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

    rebase Rebase.Prelude

    Transform the computation inside a ReaderT.

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

    rebase Rebase.Prelude

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

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

    rebase Rebase.Prelude

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

  9. mapWriter :: ((a, w) -> (b, w')) -> Writer w a -> Writer w' b

    rebase Rebase.Prelude

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

  10. mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b

    rebase Rebase.Prelude

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

Page 245 of many | Previous | Next