Hoogle Search
Within LTS Haskell 24.66 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()incipit-base Incipit.Foldable 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.
mapIncremental :: (Monoid s, Monoid a, Monoid b) => (a -> b) -> Parser p s a -> Parser p s bincremental-parser Text.ParserCombinators.Incremental Like fmap, but capable of mapping partial results, being restricted to Monoid types only.
mapInput :: (Monoid s, Monoid s') => (s -> s') -> (s' -> s) -> Parser t s r -> Parser t s' rincremental-parser Text.ParserCombinators.Incremental Converts a parser accepting one input type to another. The argument functions forth and back must be inverses of each other and they must distribute through <>:
f (s1 <> s2) == f s1 <> f s2
-
incremental-parser Text.ParserCombinators.Incremental Converts a parser accepting one input type to another, just like 'mapMaybeInput except the two argument functions can demand more input by returning Nothing. If 'mapMaybeInput is defined for the two input inputs, then
mapInput f g == mapMaybeInput (Just . f) (Just . g)
mapType :: (forall a . () => Parser t s a -> Parser b s a) -> Parser t s r -> Parser b s rincremental-parser Text.ParserCombinators.Incremental Modifies the parser type
mapIncremental :: (Monoid s, Monoid a, Monoid b) => (a -> b) -> Parser p s a -> Parser p s bincremental-parser Text.ParserCombinators.Incremental.LeftBiasedLocal Like fmap, but capable of mapping partial results, being restricted to Monoid types only.
mapInput :: (Monoid s, Monoid s') => (s -> s') -> (s' -> s) -> Parser t s r -> Parser t s' rincremental-parser Text.ParserCombinators.Incremental.LeftBiasedLocal Converts a parser accepting one input type to another. The argument functions forth and back must be inverses of each other and they must distribute through <>:
f (s1 <> s2) == f s1 <> f s2
-
incremental-parser Text.ParserCombinators.Incremental.LeftBiasedLocal Converts a parser accepting one input type to another, just like 'mapMaybeInput except the two argument functions can demand more input by returning Nothing. If 'mapMaybeInput is defined for the two input inputs, then
mapInput f g == mapMaybeInput (Just . f) (Just . g)
mapType :: (forall a . () => Parser t s a -> Parser b s a) -> Parser t s r -> Parser b s rincremental-parser Text.ParserCombinators.Incremental.LeftBiasedLocal Modifies the parser type
mapIncremental :: (Monoid s, Monoid a, Monoid b) => (a -> b) -> Parser p s a -> Parser p s bincremental-parser Text.ParserCombinators.Incremental.Symmetric Like fmap, but capable of mapping partial results, being restricted to Monoid types only.