-
Notifications
You must be signed in to change notification settings - Fork 19
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Index and other optimisations #922
Merged
Merged
Conversation
This file contains 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
Take advantage of the label hash global precalc, and use hash aliases instead of refs.
Might as well avoid any recursion overheads.
And stop throwing errors when ref is undefined in get_basedata_ref.
This was we avoid cloning basedata refs, analysis args and the like.
No need to find the index names when they are in the base_list_ref already. Also use refaliasing to avoid some derefs and declutter loop variables.
Passing in the base list allows fewer grep comparisons. This makes a large difference when there are many lists with many keys.
Passing in the base list allows fewer grep comparisons. This makes a large difference when there are many lists with many keys.
This allows future optimisations when calculating indices for cluster trees.
This allows several indices to be optimised when calculated for cluster nodes, providing they are done starting from the tips. PE has been optimised in this commit.
Avoids a lot of hash creation and deletion with large datasets.
Speeds up PD calcs for cluster trees.
Use a treenode method that caches, rather than repeatedly calling methods to get the same answer.
It is cleaner to pack the node and child names in their own structure. That also enables later additions without adding yet more top level arguments.
Use direct assignment if starting with empty list.
Avoids a lot of copying.
This can be a _very_ hot loop so even small differences add up.
These are cleared as we go to avoid leakage.
If the second neighbour set is empty then the whole and central variants return the same results. So short circuit in these cases.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
A set of optimisations to several index and related calculations.
Summary of main changes: