We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
The library should have some version of a TakeWhile and/or TakeWhile1 character parser combinators.
TakeWhile
TakeWhile1
The combinator would return the longest continuous subset of the input that matched the provided predicate. It would likely have a prototype such as:
func TakeWhile[Input Bytes](input Input, predicate func(input rune)bool) gomme.Parser[Input, Input]
and be used like:
func separator() gomme.Parser[string, string] { return gomme.TakeWhile[string](isSeparator) } func isSeparator(c rune) bool { return c == '\t' || c == '\r' || c == '\n' }
Would fulfill the same contract as above, with the added condition that the predicate should be matched at least once.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
The library should have some version of a
TakeWhile
and/orTakeWhile1
character parser combinators.TakeWhile
The combinator would return the longest continuous subset of the input that matched the provided predicate. It would likely have a prototype such as:
and be used like:
TakeWhile1
Would fulfill the same contract as above, with the added condition that the predicate should be matched at least once.
The text was updated successfully, but these errors were encountered: