some iteration optimizations #83
Closed
Conversation
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
|
Coverage increased (+0.001%) to 99.861% when pulling a09a88c713285704c17c8618a0811589e3fcffe0 on ThreeO:devel into 775477e on c0fec0de:devel. |
|
Coverage increased (+0.001%) to 99.862% when pulling ac5c72afff6cba5398f21a236b71976aa7b27c33 on ThreeO:devel into 775477e on c0fec0de:devel. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
replace some lists with iterators; also, add and use a generator for moving up the tree from a node, since looping list.insert(0, ...) is slower than creating the list from a generator and reversing it