microsoft / microsoft/gctoolkit
Parser rules improvements
Nobody has claimed this yet.
- Dominant language
- Java
- Stars
- 1.3k
- Forks
- 177
- Avg merge
- 1d 11h
- Merged PRs (30d)
- 3
Description
Currently the parser sends a log line through a set of (regex) rules to identify it to know how to safely process it. The proposal is to replace the list with a circular buffer in hopes that for well formed log files, the "next" log line will be the "next" rule which should hopefully reduce the number of rules to try before getting a hit. The worst case is still run to failure, failure being, the log line being passed in isn't recognized.
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 locating the parser's regex rule list and the code that tries rules against each log line. Review how rule ordering is maintained and how unrecognized lines are handled. Done means the parser uses a circular buffer to prefer the next rule for well-formed logs while preserving the existing failure behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- devtools, performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 32/100