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. mapIncremental :: (Monoid s, Monoid a, Monoid b) => (a -> b) -> Parser p s a -> Parser p s b

   incremental-parser	Text.ParserCombinators.Incremental

   Like fmap, but capable of mapping partial results, being restricted to Monoid types only.

2. mapInput :: (Monoid s, Monoid s') => (s -> s') -> (s' -> s) -> Parser t s r -> Parser t s' r

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

3. mapMaybeInput :: (Monoid s, Monoid s') => (s -> Maybe s') -> (s' -> Maybe s) -> Parser t s r -> Parser t s' r

   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)
   

4. mapType :: (forall a . () => Parser t s a -> Parser b s a) -> Parser t s r -> Parser b s r

   incremental-parser	Text.ParserCombinators.Incremental

   Modifies the parser type

5. mapIncremental :: (Monoid s, Monoid a, Monoid b) => (a -> b) -> Parser p s a -> Parser p s b

   incremental-parser	Text.ParserCombinators.Incremental.LeftBiasedLocal

   Like fmap, but capable of mapping partial results, being restricted to Monoid types only.

6. mapInput :: (Monoid s, Monoid s') => (s -> s') -> (s' -> s) -> Parser t s r -> Parser t s' r

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

7. mapMaybeInput :: (Monoid s, Monoid s') => (s -> Maybe s') -> (s' -> Maybe s) -> Parser t s r -> Parser t s' r

   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)
   

8. mapType :: (forall a . () => Parser t s a -> Parser b s a) -> Parser t s r -> Parser b s r

   incremental-parser	Text.ParserCombinators.Incremental.LeftBiasedLocal

   Modifies the parser type

9. mapIncremental :: (Monoid s, Monoid a, Monoid b) => (a -> b) -> Parser p s a -> Parser p s b

   incremental-parser	Text.ParserCombinators.Incremental.Symmetric

   Like fmap, but capable of mapping partial results, being restricted to Monoid types only.

10. mapInput :: (Monoid s, Monoid s') => (s -> s') -> (s' -> s) -> Parser t s r -> Parser t s' r

    incremental-parser	Text.ParserCombinators.Incremental.Symmetric

    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
    

Page 242 of many | Previous | Next