Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. mapContM :: (a -> (b -> m c) -> m c) -> [a] -> ([b] -> m c) -> m c

    mtl-misc-yj Control.Monad.Cont.MiscYj

    No documentation available.

  2. mapEither :: (Key -> Either Key Key) -> IntMultiSet -> (IntMultiSet, IntMultiSet)

    multiset Data.IntMultiSet

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

  3. mapMaybe :: (Key -> Maybe Key) -> IntMultiSet -> IntMultiSet

    multiset Data.IntMultiSet

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

  4. mapMonotonic :: (Key -> Key) -> IntMultiSet -> IntMultiSet

    multiset Data.IntMultiSet

    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

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

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

    multiset Data.MultiSet

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

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

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

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

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

Page 255 of many | Previous | Next