23745589309

Committed 30 Mar 2026 12:50PM UTC coverage: 65.943% (+0.6%) from 65.361%

Build # 23745589309

Build Type

push

github

Committed by

MagicalTux

Commit Message

Reduce cyclomatic complexity in lexer, parser, and program

Extract lookup tables for escape sequences (charTypeEscapes,
anchorEscapes, simpleEscapes), POSIX classes (posixClasses), and
opcode names (opNames) to replace large switch statements.

lexEscape: 49 → 22, instString: 33 → 10, posixClassRanges: 15 → 2.
Remaining high-complexity functions are dispatch switches inherent
to the VM/parser/compiler architecture.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

Coverage Stats

27 of 50 new or added lines in 3 files covered. (54.0%)

1 existing line in 1 file now uncovered.

2674 of 4055 relevant lines covered (65.94%)

251.71 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/program.go

Build SHA Not Found

The commit SHA "8830ee9776e3053f767192b2680fb79be28c7798" was not found in your repository, so the file cannot be loaded. This may be because you posted from a local development environment, or your CI created an ephemeral commit.

KarpelesLab / gopcre2 / 23745589309

Source File Press 'n' to go to next uncovered line, 'b' for previous

Build SHA Not Found

Source File
Press 'n' to go to next uncovered line, 'b' for previous