Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

   calligraphy	Calligraphy.Prelude

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

2. mapMaybeVarEnv :: (a -> Maybe b) -> VarEnv a -> VarEnv b

   clash-lib	Clash.Core.VarEnv

   Apply a function to every element in the environment; values for which the function returns Nothing are removed from the environment

3. mapMaybe :: (a -> Maybe b) -> UniqMap a -> UniqMap b

   clash-lib	Clash.Data.UniqMap

   Apply a function to all elements in the map, keeping those where the result is not Nothing.

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

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

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

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

8. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

   control-monad-free	Control.Monad.Free

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

9. mapMonotonic :: (Integer -> Integer) -> IntegerInterval -> IntegerInterval

   data-interval	Data.IntegerInterval

   mapMonotonic f i is the image of i under f, where f must be a strict monotone function.

10. mapMonotonic :: (Ord a, Ord b) => (a -> b) -> Interval a -> Interval b

    data-interval	Data.Interval

    mapMonotonic f i is the image of i under f, where f must be a strict monotone function, preserving negative and positive infinities.

Page 54 of many | Previous | Next