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.

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

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

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

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

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

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

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

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

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

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

  9. mapNew' :: (a -> a) -> Map k (Delta a) -> Map k (Delta a)

    patience Patience.Map

    Map over all the New values, preserving the remaining values in the map.

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

    patience Patience.Map

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

Page 255 of many | Previous | Next