Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. module Text.ParserCombinators.HuttonMeijerWallace

   This library of monadic parser combinators is based on the ones defined by Graham Hutton and Erik Meijer. It has been extended by Malcolm Wallace to use an abstract token type (no longer just a string) as input, and to incorporate state in the monad, useful for symbol tables, macros, and so on. Basic facilities for error reporting have also been added, and later extended by Graham Klyne to return the errors through an Either type, rather than just calling error.

2. manyFinally :: PolyParse p => p a -> p z -> p [a]

   polyparse	Text.ParserCombinators.Poly.Base

   manyFinally e t parses a possibly-empty sequence of e's, terminated by a t. The final t is discarded. Any parse failures could be due either to a badly-formed terminator or a badly-formed element, so it raises both possible errors.

3. manyFinally' :: (PolyParse p, Show a) => p a -> p z -> p [a]

   polyparse	Text.ParserCombinators.Poly.Base

   manyFinally' is like manyFinally, except when the terminator parser overlaps with the element parser. In manyFinally e t, the parser t is tried only when parser e fails, whereas in manyFinally' e t, the parser t is always tried first, then parser e only if the terminator is not found. For instance, manyFinally (accept "01") (accept "0") on input "0101010" returns ["01","01","01"], whereas manyFinally' with the same arguments and input returns [].

4. manyFinally :: Parser s t a -> Parser s t z -> Parser s t [a]

   polyparse	Text.ParserCombinators.Poly.StateLazy

   No documentation available.

5. manyFinally' :: (PolyParse p, Show a) => p a -> p z -> p [a]

   polyparse	Text.ParserCombinators.Poly.StateLazy

   manyFinally' is like manyFinally, except when the terminator parser overlaps with the element parser. In manyFinally e t, the parser t is tried only when parser e fails, whereas in manyFinally' e t, the parser t is always tried first, then parser e only if the terminator is not found. For instance, manyFinally (accept "01") (accept "0") on input "0101010" returns ["01","01","01"], whereas manyFinally' with the same arguments and input returns [].

6. runSmallArrayST :: (forall s . () => ST s (SmallArray a)) -> SmallArray a

   run-st	Control.Monad.ST.Run

   No documentation available.

7. optionalLongMods :: forall (f :: Type -> Type) a . (HasMetavar f, HasName f, HasValue f) => String -> String -> String -> a -> Mod f a

   simple-cmd-args	SimpleCmdArgs

   optionalMods with only long option

   optionalLongMods "option" "METAVAR" "help description" default
   

8. optionalLongWith :: ReadM a -> String -> String -> String -> a -> Parser a

   simple-cmd-args	SimpleCmdArgs

   optionalWith with only long option

   optionalLongWith auto "option" "METAVAR" "help description" default
   

9. strOptionalLongWith :: String -> String -> String -> String -> Parser String

   simple-cmd-args	SimpleCmdArgs

   strOptionalWith with only long option

   strOptionalLongWith "option" "METAVAR" "help description" default
   

10. forAll :: (HasCallStack, Show a) => Gen a -> PropertyM a

    skeletest	Skeletest

    No documentation available.

Page 629 of many | Previous | Next