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.

Exact lookup

1. mapMaybeAndRest :: (a -> Maybe b) -> [a] -> ([b], Suffix a)

   Agda	Agda.Utils.List

   Like mapMaybe, but additionally return the last partition of the list where the function always returns Nothing. O(n).

2. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

   Agda	Agda.Utils.Monad

   A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].

3. mapMaybeMM :: Monad m => (a -> m (Maybe b)) -> m [a] -> m [b]

   Agda	Agda.Utils.Monad

   A version of mapMaybeM with a computation for the input list.

4. mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]

   breakpoint	Debug.Breakpoint.GhcFacade

   Applicative version of mapMaybe

5. mapMaybeEdgeKeys :: (Edge e1, Ord n) => (e0 n -> Maybe (e1 n)) -> Graph e0 n el nl -> Graph e1 n el nl

   comfort-graph	Data.Graph.Comfort

   You may only use this for filtering edges and use more specialised types as a result. You must not alter source and target nodes of edges.

6. mapMaybeSerialized :: forall s t (m :: Type -> Type -> Type) (n :: Type -> Type) a . (Monoid s, Monoid t, InputParsing (m s), InputParsing (m t), s ~ ParserInput (m s), t ~ ParserInput (m t), InputMappableParsing m, Functor n) => (s -> Maybe t) -> (t -> Maybe s) -> Format (m s) n s a -> Format (m t) n t a

   construct	Construct

   Converts a format for serialized streams of type s so it works for streams of type t instead. The argument functions may return Nothing to indicate they have insuficient input to perform the conversion.

7. mapMaybeValue :: forall (m :: Type -> Type) a b (n :: Type -> Type) s . (Monad m, Parsing m, Show a, Show b, AlternativeFail n) => (a -> Maybe b) -> (b -> Maybe a) -> Format m n s a -> Format m n s b

   construct	Construct

   Converts a format for in-memory values of type a so it works for values of type b instead. The argument functions may signal conversion failure by returning Nothing.

8. mapMaybeParserInput :: (InputMappableParsing m, InputParsing (m s), s ~ ParserInput (m s), Monoid s, Monoid s') => (s -> Maybe s') -> (s' -> Maybe s) -> m s a -> m s' a

   construct	Construct.Classes

   Converts a parser accepting one input stream type to another just like mapParserInput, except the argument functions can return Nothing to indicate they need more input.

9. mapMaybeWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> Maybe (g v)) -> MonoidalDMap k2 f -> MonoidalDMap k2 g

   dependent-monoidal-map	Data.Dependent.Map.Monoidal

   O(n). Map keys/values and collect the Just results.

10. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

    distribution-opensuse	OpenSuse.Prelude

    A version of mapMaybe that works with a monadic predicate.

Page 25 of many | Previous | Next