Skip to content

Fix leftmost starts in reverse DFA searches - #64

Merged
willibrandon merged 1 commit into
mainfrom
issue-63-reverse-dfa-match-all
Aug 2, 2026
Merged

Fix leftmost starts in reverse DFA searches#64
willibrandon merged 1 commit into
mainfrom
issue-63-reverse-dfa-match-all

Conversation

@willibrandon

Copy link
Copy Markdown
Owner

Forward DFA searches keep leftmost-first priority, while anchored reverse searches retain all viable paths so lazy prefixes cannot replace the earliest start. This keeps DFA spans aligned with PikeVM and adds regression coverage for contextual and predicate-free searches, iteration, and cache fallback.

Fixes: #63

@willibrandon willibrandon added bug Something isn't working regex The byte-oriented finite-automata engine ported from Rust's regex labels Aug 2, 2026
@willibrandon willibrandon self-assigned this Aug 2, 2026
@willibrandon
willibrandon merged commit ac90c69 into main Aug 2, 2026
25 checks passed
@willibrandon
willibrandon deleted the issue-63-reverse-dfa-match-all branch August 2, 2026 10:05
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

bug Something isn't working regex The byte-oriented finite-automata engine ported from Rust's regex

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Lazy prefixes return a later start in unanchored DFA searches

1 participant