Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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)
many :: Alternative f => f a -> f [a]simple-cmd-args SimpleCmdArgs Zero or more.
Examples
>>> many (putStr "la") lalalalalalalalala... * goes on forever *
>>> many Nothing Just []
>>> take 5 <$> many (Just 1) * hangs forever *
Note that this function can be used with Parsers based on Applicatives. In that case many parser will attempt to parse parser zero or more times until it fails.indicesOfAny :: [ByteString] -> ByteString -> [(Int64, [Int])]stringsearch Data.ByteString.Lazy.Search.KarpRabin indicesOfAny finds all occurrences of any of several non-empty strict patterns in a lazy target string. If no non-empty patterns are given, the result is an empty list. Otherwise the result list contains the pairs of all indices where any of the (non-empty) patterns start and the list of all patterns starting at that index, the patterns being represented by their (zero-based) position in the pattern list. Empty patterns are filtered out before processing begins.
indicesOfAny :: [ByteString] -> ByteString -> [(Int, [Int])]stringsearch Data.ByteString.Search.KarpRabin indicesOfAny finds all occurrences of any of several non-empty patterns in a strict target string. If no non-empty patterns are given, the result is an empty list. Otherwise the result list contains the pairs of all indices where any of the (non-empty) patterns start and the list of all patterns starting at that index, the patterns being represented by their (zero-based) position in the pattern list. Empty patterns are filtered out before processing begins.