Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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. mapWire :: (Monad m', Monad m) => (forall a1 . () => m' a1 -> m a1) -> Wire s e m' a b -> Wire s e m a b

    netwire Control.Wire.Core

    Apply the given monad morphism to the wire's underlying monad.

  10. mapNew :: (a -> b) -> Map k (Delta a) -> Map k b

    patience Patience.Map

    Map over all New values, returning a map of just the transformed values. This can be more efficient than calling toNew and then Data.Map's map.

Page 253 of many | Previous | Next