Lazy-compile matcher regexes behind a substring prefilter - #3
Merged
Conversation
…g prefilter Unicode-property boundary regexes are expensive to construct (~0.3ms each; a 140-entry consumer paid ~40ms of pure startup). Each entry now compiles on first use, and matching prefilters with a cheap lowercase substring check; the regex only confirms or rejects those few candidates. A boundary match is always also a substring match, so the semantics are byte-for-byte the same — the existing fixtures pin that.
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
1 participant
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
Test plan
npm run checkgreen (all matcher fixtures unchanged and passing)