Add new traversal variants to TreeCursor
#123
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
The first checks left-to-right walks, while the other checks right-to-left walks. Names were chosen to reflect this. Assertions in the two tests are therefore "mirrored". This was done to reduce the overall cognitive complexity of the old method.
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.
This PR introduces two new method that exploit the newly introduced tree-sitter APIs (tree-sitter/tree-sitter#2324). These include:
TreeCursor#gotoLastChildTreeCursor#gotoPrevSiblingNote that both methods exist purely for convenience, and as the JavaDoc notes, may perform worse than the existing methods.