Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. mapMaybeM :: (Monad m, Vector v a, Vector v b) => (a -> m (Maybe b)) -> v a -> m (v b)

   rebase	Rebase.Data.Vector.Generic

   No documentation available.

2. mapMaybeM :: (Monad m, Prim a, Prim b) => (a -> m (Maybe b)) -> Vector a -> m (Vector b)

   rebase	Rebase.Data.Vector.Primitive

   No documentation available.

3. mapMaybeM :: (Monad m, Storable a, Storable b) => (a -> m (Maybe b)) -> Vector a -> m (Vector b)

   rebase	Rebase.Data.Vector.Storable

   No documentation available.

4. mapMaybeM :: (Monad m, Unbox a, Unbox b) => (a -> m (Maybe b)) -> Vector a -> m (Vector b)

   rebase	Rebase.Data.Vector.Unboxed

   No documentation available.

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

   rebase	Rebase.Prelude

   Transform the computation inside a MaybeT.

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

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

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

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

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

10. mapMaybeReversed :: (a -> Maybe b) -> List a -> List b

    strict-list	StrictList

    Map and filter elements producing results in reversed order.

Page 23 of many | Previous | Next