Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. mapMonotonic :: (a -> b) -> Set a -> Set b

   containers	Data.Set

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. 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
   

2. mapMonotonic :: (a -> b) -> Set a -> Set b

   containers	Data.Set.Internal

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. 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
   

3. mapLift :: (f a -> g a) -> Lift f a -> Lift g a

   transformers	Control.Applicative.Lift

   Apply a transformation to the other computation.

4. mapAccum :: ((a, w) -> (b, w)) -> Accum w a -> Accum w b

   transformers	Control.Monad.Trans.Accum

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

   • runAccum (mapAccum f m) = f . runAccum
     m

5. mapAccumT :: (m (a, w) -> n (b, w)) -> AccumT w m a -> AccumT w n b

   transformers	Control.Monad.Trans.Accum

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

   • runAccumT (mapAccumT f m) = f .
     runAccumT m

6. mapCont :: (r -> r) -> Cont r a -> Cont r a

   transformers	Control.Monad.Trans.Cont

   Apply a function to transform the result of a continuation-passing computation.

   • runCont (mapCont f m) = f . runCont
     m

7. mapExcept :: (Either e a -> Either e' b) -> Except e a -> Except e' b

   transformers	Control.Monad.Trans.Except

   Map the unwrapped computation using the given function.

   • runExcept (mapExcept f m) = f (runExcept
     m)

8. mapExceptT :: (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b

   transformers	Control.Monad.Trans.Except

   Map the unwrapped computation using the given function.

   • runExceptT (mapExceptT f m) = f
     (runExceptT m)

9. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   transformers	Control.Monad.Trans.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

10. mapRWS :: (Monoid w, Monoid w') => ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b

    transformers	Control.Monad.Trans.RWS.CPS

    Map the return value, final state and output of a computation using the given function.

    • runRWS (mapRWS f m) r s = f (runRWS m r
      s)

Page 99 of many | Previous | Next