Hoogle Search

Within LTS Haskell 24.25 (ghc-9.10.3)

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

  1. mapMultiReaderT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiReaderT w m a -> MultiReaderT w m' a'

    multistate Control.Monad.Trans.MultiReader.Lazy

    Map both the return value and the environment of a computation using the given function. Note that there is a difference to mtl's ReaderT, where it is not possible to modify the environment.

  2. mapMultiReaderT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiReaderT w m a -> MultiReaderT w m' a'

    multistate Control.Monad.Trans.MultiReader.Strict

    Map both the return value and the environment of a computation using the given function. Note that there is a difference to mtl's ReaderT, where it is not possible to modify the environment.

  3. mapMultiStateT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiStateT w m a -> MultiStateT w m' a'

    multistate Control.Monad.Trans.MultiState

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

  4. mapMultiStateT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiStateT w m a -> MultiStateT w m' a'

    multistate Control.Monad.Trans.MultiState.Lazy

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

  5. mapMultiStateT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiStateT w m a -> MultiStateT w m' a'

    multistate Control.Monad.Trans.MultiState.Strict

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

  6. mapMultiWriterT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiWriterT w m a -> MultiWriterT w m' a'

    multistate Control.Monad.Trans.MultiWriter

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

  7. mapMultiWriterT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiWriterT w m a -> MultiWriterT w m' a'

    multistate Control.Monad.Trans.MultiWriter.Lazy

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

  8. mapMultiWriterT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiWriterT w m a -> MultiWriterT w m' a'

    multistate Control.Monad.Trans.MultiWriter.Strict

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

  9. mapMaybe :: (a -> Maybe b) -> Event a -> Event b

    reactive-midyim Reactive.Banana.MIDI.Utility

    No documentation available.

  10. mapM_ :: (Generator c, Monad m) => (Elem c -> m b) -> c -> m ()

    reducers Data.Generator.Combinators

    Efficiently mapReduce a Generator using the Action monoid. A specialized version of its namesake from Data.Foldable and Control.Monad 

    mapReduceWith getAction

Page 49 of many | Previous | Next