pub fn permutation<T>(parsers: T) -> Permutation<T>Expand description
This function takes in a tuple of 1 to 11 parsers. It returns a parser that
succeeds when all of the input parsers have succeeded in any order.
permutation((parser_1,parser_2)) will return (output_parser_1, output_parser_2),
regardless of the order they succeed in.
If none of the parsers succeed, this function will return an error.
When using FabError, the error returned will be the error of the parser that made the
furthest progress. When using a parser that doesn’t provide error locations, or in the event
of ties, FunnelParse makes no garuntees as to which child parser’s error will be returned.