Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

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

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

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

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

   dimensional	Numeric.Units.Dimensional.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.

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

   distribution-opensuse	OpenSuse.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.

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

    distribution-opensuse	OpenSuse.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.

Page 54 of many | Previous | Next