perf: PikeVM sparse-dispatch for dot patterns — 2.8-4.8x speedup (#132)#134
Merged
perf: PikeVM sparse-dispatch for dot patterns — 2.8-4.8x speedup (#132)#134
Conversation
NFA compiler generated ~9 split states chaining UTF-8 byte-range alternation branches for each '.' (AnyCharNotNL). PikeVM DFS-traversed the entire split chain at every byte position. New compileUTF8AnySparse() compiles '.' as a single sparse state mapping each leading byte range directly to its continuation chain — O(1) dispatch instead of O(branches) split-chain traversal. Same approach as Rust regex State::Sparse. Closes #132
Benchmark ComparisonComparing Summary:
|
Codecov Report❌ Patch coverage is
📢 Thoughts on this report? Let us know! |
This was referenced Mar 10, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
.(AnyCharNotNL). PikeVM had to DFS-traverse the entire split chain at every byte position — O(branches) work per byte.compileUTF8AnySparse()compiles.as a single sparse state mapping each leading byte range directly to its continuation chain — O(1) dispatch instead of O(branches) split-chain traversal. Same approach as Rust regex'sState::Sparse.runeNFA) compiled only for patterns containing.. PikeVM and BoundedBacktracker use it; DFA continues with byte-level NFA (unaffected)..*?,.+,.*).Reported by @kostya via LangArena benchmarks (Issue #124). Closes #132.
Test plan
go test ./...— all 11 packages passgofmt -l .— cleangolangci-lint run— 0 issuesBenchmarkFind— no regressions