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. mapEither :: (Ord b, Ord c) => (a -> Either b c) -> MultiSet a -> (MultiSet b, MultiSet c)

    multiset Data.MultiSet

    O(n). Map and separate the Left and Right results.

  2. mapMaybe :: Ord b => (a -> Maybe b) -> MultiSet a -> MultiSet b

    multiset Data.MultiSet

    O(n). Map and collect the Just results.

  3. mapMonotonic :: (a -> b) -> MultiSet a -> MultiSet b

    multiset Data.MultiSet

    O(n). mapMonotonic f s == map f s, but works only when f is strictly monotonic. The precondition is not checked. Semi-formally, we have: 

    and [x < y ==> f x < f y | x <- ls, y <- ls]
==> mapMonotonic f s == map f s
where ls = toList s

  4. mapMultiGSTT :: forall ts (cts :: [CanReadWrite Type]) m a m' a' . ts ~ HListM cts => (m (a, ts) -> m' (a', ts)) -> MultiGSTT cts m a -> MultiGSTT cts m' a'

    multistate Control.Monad.Trans.MultiGST

    No documentation available.

  5. mapMultiGSTT :: forall ts (cts :: [CanReadWrite Type]) m a m' a' . ts ~ HListM cts => (m (a, ts) -> m' (a', ts)) -> MultiGSTT cts m a -> MultiGSTT cts m' a'

    multistate Control.Monad.Trans.MultiGST.Lazy

    No documentation available.

  6. mapMultiGSTT :: forall ts (cts :: [CanReadWrite Type]) m a m' a' . ts ~ HListM cts => (m (a, ts) -> m' (a', ts)) -> MultiGSTT cts m a -> MultiGSTT cts m' a'

    multistate Control.Monad.Trans.MultiGST.Strict

    No documentation available.

  7. mapMultiRWST :: forall ss (r :: [Type]) (w :: [Type]) (s :: [Type]) m a m' a' . ss ~ (HList r, HList w, HList s) => (m (a, ss) -> m' (a', ss)) -> MultiRWST r w s m a -> MultiRWST r w s m' a'

    multistate Control.Monad.Trans.MultiRWS

    No documentation available.

  8. mapMultiRWST :: forall ss (r :: [Type]) (w :: [Type]) (s :: [Type]) m a m' a' . ss ~ (HList r, HList w, HList s) => (m (a, ss) -> m' (a', ss)) -> MultiRWST r w s m a -> MultiRWST r w s m' a'

    multistate Control.Monad.Trans.MultiRWS.Lazy

    No documentation available.

  9. mapMultiRWST :: forall ss (r :: [Type]) (w :: [Type]) (s :: [Type]) m a m' a' . ss ~ (HList r, HList w, HList s) => (m (a, ss) -> m' (a', ss)) -> MultiRWST r w s m a -> MultiRWST r w s m' a'

    multistate Control.Monad.Trans.MultiRWS.Strict

    No documentation available.

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

    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.

Page 252 of many | Previous | Next