Parse a token stream that starts with start and ends with end, returning
all of the tokens in between. The tokens in between must match cond.
Succeeds even if there are no tokens between start and end.
Parse a token stream that starts with start and ends with end, returning
all of the tokens in between. The tokens in between must match cond. There
must be at least one token between start and end.
Consumes tokens while cond matches on a window of tokens of size n and
returns them. Fails if there aren’t at least n tokens or if no tokens
match, otherwise returns all of the tokens before the first failure.
Consumes tokens while cond matches on a window of tokens of size n and
returns them. Fails if there no tokens match, otherwise returns all of the
tokens before the first failure.
Consumes tokens while cond matches on a continously growing slice
beginning at a length of 0 and ending when cond fails. Returns the slice
between 0 and cond failing. Errors if no such slice exists.
Consumes tokens while cond matches on a window of tokens of size n and
returns them. Fails if there aren’t at least n tokens, otherwise always
otherwise always succeeds. If no tokens match, the result will be empty.
Consumes tokens while cond matches on a window of tokens of size n and
returns all of the tokens prior to the first failure to match. For example,
given a string of “aaab” and a size 2 window predicate of window == "aa",
the return value is "aa" as the first failure to match is at "ab".