Make peg$computePosDetails a little faster #439
Merged
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.
Some grammars seem to spend a lot of time in
peg$computePosDetails
.examples/xml.peggy
is one example. According to the VSCode profiler, it's the single most expensive self-time function, and with typical data seems to take about 20% of the total time.This change takes advantage of the fact that generally, calls to
peg$computePosDetails
that don't hit in the cache will actually be beyond the last element (because in general parsing proceeds from the start of the file to the end), so we can usepeg$posDetailsCache.length
to find the previous element, rather than walking backwards testing each element.In my tests, I get a 5-10% speedup (depending on the input) for the parser generated from
examples/xml.peggy
. Other grammars I've tested get significantly smaller wins, but I can generally still see an observable win in the profiler.