many -package:streamly-core

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.

Parses zero or more occurrences of the given parser.

many p applies the parser p zero or more times. Returns a list of the returned values of p.

identifier  = do{ c  <- letter
; cs <- many (alphaNum <|> char '_')
; return (c:cs)
}

Collapse multiple values in to one.

Keep parsing elements as long as the parser returns Just.

many p applies the parser p zero or more times. Returns a list of the returned values of p.

identifier  = do{ c  <- letter
; cs <- many (alphaNum <|> char '_')
; return (c:cs)
}

Zero or more.

many p applies the parser p zero or more times and returns a list of the values returned by p.

identifier = (:) <$> letter <*> many (alphaNumChar <|> char '_')

Zero or more.

many m = some m <|> pure []

Deliver zero or more values of a.

Encode many displays into a single one. All will be output.

Parses zero or more occurrences of the given parser.

Aggregate a Query into a ListTable. If the supplied query returns 0 rows, this function will produce a Query that returns one row containing the empty ListTable. If the supplied Query does return rows, many will return exactly one row, with a ListTable collecting all returned rows. many is analogous to many from Control.Applicative.

many aggregates each entry with a particular key into a single entry with all of the values contained in a ListTable. order can be used to give this ListTable a defined order. The resulting Tabulation is "magic" in that the value 'Rel8.listTable []' exists at every possible key that wasn't in the given Tabulation.

Same as the usual many except a Format is no Functor, let alone Alternative.

Parse many of something. Behaves like * in regexes. This eats as much as it possibly can, if you want a minimal much rule, then use manyUntil which stops when a.