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.

Exact lookup

1. mapMaybePickFn :: (a -> Maybe b) -> Renderable a -> Renderable b

   Chart	Graphics.Rendering.Chart.Renderable

   Map a function over the result of a renderable's pickfunction, keeping only Just results.

2. mapPickFn :: (a -> b) -> Renderable a -> Renderable b

   Chart	Graphics.Rendering.Chart.Renderable

   Map a function over result of a renderable's pickfunction.

3. mapAnnotation :: (AnnC a, AnnC b) => (a -> b) -> Annotation -> Maybe Annotation

   annotated-exception	Data.Annotation

   Map a function over the given Annotation. If the types don't match up, then the whole thing returns Nothing.

4. mapMaybeAnnotation :: (AnnC a, AnnC b) => (a -> b) -> Annotation -> Annotation

   annotated-exception	Data.Annotation

   Map a function over the Annotation, leaving it unchanged if the types don't match.

5. mapMaybeS :: forall (m :: Type -> Type) a b . Monad m => Automaton m a b -> Automaton m (Maybe a) (Maybe b)

   automaton	Data.Automaton

   Only step the automaton if the input is Just.

6. mappendFrom :: forall w (m :: Type -> Type) . (Monoid w, Monad m) => w -> Automaton m w w

   automaton	Data.Automaton

   Like accumulateWith, with mappend as the accumulation function.

7. mappendS :: forall w (m :: Type -> Type) . (Monoid w, Monad m) => Automaton m w w

   automaton	Data.Automaton

   Like mappendFrom, initialised at mempty.

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

   automaton	Data.Automaton.Trans.Maybe

   Transform the computation inside a MaybeT.

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

9. mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b

   automaton	Data.Automaton.Trans.RWS

   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)

10. mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b

    automaton	Data.Automaton.Trans.RWS

    Map the inner computation using the given function.

    • runRWST (mapRWST f m) r s = f (runRWST m
      r s)

Page 211 of many | Previous | Next