Speed-up determining the position of a node in the path.#4
Merged
kzu merged 1 commit intodevlooped:masterfrom Jun 10, 2016
Merged
Speed-up determining the position of a node in the path.#4kzu merged 1 commit intodevlooped:masterfrom
kzu merged 1 commit intodevlooped:masterfrom
Conversation
Member
|
Awesome improvement! |
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 subscribe to this conversation on GitHub.
Already have an account?
Sign in.
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.
When a node of a type that is tested by a schematron rule, has many (tens of thousands) preceding siblings (of the same type), determining the position among the siblings was slow. This made the computation of the
<path>in the schematron report very slow.The proposed change speeds up computing the
<path>a lot. On one large file (~50000 items) the processing time went from 8 minutes to 10 seconds.