Hoogle Search
Within LTS Haskell 24.46 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
manySatisfy :: (Word8 -> Bool) -> Parser ByteStringpolyparse Text.ParserCombinators.Poly.ByteString manySatisfy p is a more efficient fused version of many (satisfy p)
many1Satisfy :: (Char -> Bool) -> Parser ByteStringpolyparse Text.ParserCombinators.Poly.ByteStringChar many1Satisfy p is a more efficient fused version of many1 (satisfy p)
manySatisfy :: (Char -> Bool) -> Parser ByteStringpolyparse Text.ParserCombinators.Poly.ByteStringChar manySatisfy p is a more efficient fused version of many (satisfy p)
many1 :: PolyParse p => p a -> p [a]polyparse Text.ParserCombinators.Poly.StateLazy Parse a non-empty list of items.
manyFinally :: Parser s t a -> Parser s t z -> Parser s t [a]polyparse Text.ParserCombinators.Poly.StateLazy No documentation available.
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 [].
many1Satisfy :: (Char -> Bool) -> Parser s Textpolyparse Text.ParserCombinators.Poly.StateText many1Satisfy p is a more efficient fused version of many1 (satisfy p)
manySatisfy :: (Char -> Bool) -> Parser s Textpolyparse Text.ParserCombinators.Poly.StateText manySatisfy p is a more efficient fused version of many (satisfy p)
many1Satisfy :: (Char -> Bool) -> Parser Textpolyparse Text.ParserCombinators.Poly.Text many1Satisfy p is a more efficient fused version of many1 (satisfy p)
manySatisfy :: (Char -> Bool) -> Parser Textpolyparse Text.ParserCombinators.Poly.Text manySatisfy p is a more efficient fused version of many (satisfy p)