sovrin / unitas

100%

master: 100%

Pull #4

github

fix(combinators): stop non-advancing loops and correct edge cases

- manyTill, until, postfix, prefix, separatedBy, interleaved, chainLeft1,
  chainRight1 and optionalSeparatedBy stop when an iteration consumes no
  input, instead of looping until the process runs out of memory
- chainLeft/chainRight now succeed with null on zero terms, as their
  type and the zero-or-more naming promise, instead of duplicating the
  `1` variants
- grammar and lazy build each parser once, so memoize inside a rule
  actually caches
- separatedEndBy no longer consumes a separator that has no item before it
- optionalSeparatedBy keeps empty slots between separators as null
- oneOf docs now say first match wins, which is what the code and its
  tests always did; regex documents that only a leading ^ is stripped

BREAKING CHANGE: chainLeft and chainRight return { ok: true, value: null }
on input with no term, where they previously failed.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>

338 of 338 branches covered (100.0%)

Branch coverage included in aggregate %.

33 of 33 new or added lines in 14 files covered. (100.0%)

750 of 750 relevant lines covered (100.0%)

35.18 hits per line