swiftlang / swiftlang/swift-experimental-string-processing
Preserve word boundary cache across multiple matches
Open
Nobody has claimed this yet.
- Dominant language
- Swift
- Stars
- 308
- Forks
- 52
- Avg merge
- 12h 45m
- Merged PRs (30d)
- 2
Description
Word boundary cache is valid state that can persist across multiple match invocations. We don't currently persist it, which means it will be recalculated and can yield a quadratic factor in the worst case.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by tracing the match invocations and the word boundary cache in the pattern-matching engine. Determine where cache state is created and discarded, then verify that it persists across multiple matches without repeated recalculation and that worst-case matching no longer adds the stated quadratic factor.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- swift
- Domain
- performance
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100