Increase performance of reorder-endnotes #116
Stop looking for more endnotes if we’ve made some changes and run out
The original loop is naïve and will keep on looking for endnotes in a situation where there definitely won’t be any (assuming that the endnote structure is correct). If we’ve already found one or more endnotes and made changes then if we fail to find the next in the loop we can assume that the rest don’t exist. Against current Pepys and incrementing all endnotes by one this commit drops the total time from 31.5s to 14.5s(!).
- Loading branch information...
ProTip! Use n and p to navigate between commits in a pull request.
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.