Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. mapFirstSuspension :: forall s (m :: Type -> Type) x . (Functor s, Monad m) => (forall y . () => s y -> s y) -> Coroutine s m x -> Coroutine s m x

   monad-coroutine	Control.Monad.Coroutine

   Modify the first upcoming suspension of a Coroutine.

2. mapMonad :: forall (s :: Type -> Type) m m' x . (Functor s, Monad m, Monad m') => (forall y . () => m y -> m' y) -> Coroutine s m x -> Coroutine s m' x

   monad-coroutine	Control.Monad.Coroutine

   Change the base monad of a Coroutine.

3. mapSuspension :: forall s (m :: Type -> Type) s' x . (Functor s, Monad m) => (forall y . () => s y -> s' y) -> Coroutine s m x -> Coroutine s' m x

   monad-coroutine	Control.Monad.Coroutine

   Change the suspension functor of a Coroutine.

4. mapNestedSuspension :: forall (s0 :: Type -> Type) s (m :: Type -> Type) s' x . (Functor s0, Functor s, Monad m) => (forall y . () => s y -> s' y) -> Coroutine (Sum s0 s) m x -> Coroutine (Sum s0 s') m x

   monad-coroutine	Control.Monad.Coroutine.Nested

   Change the suspension functor of a nested Coroutine.

5. mapLogStrBS :: ToLogStr msg => (ByteString -> msg) -> LogStr -> LogStr

   monad-logger-extras	Control.Monad.Logger.Extras

   Map a function over a log string.

6. 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.

7. 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

8. 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)

9. 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)

10. 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)

Page 348 of many | Previous | Next