Introduce partial prefix searching #3
Closed
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
When a given prefix is not fully present within the tree, instead of returning nil, return the current node which represents the largest prefix up until that point. This node can be used as a root to find all remaining entries that start with the prefix.
This was referenced Dec 12, 2015
|
Closing as this is not needed to accomplish your goal and can be done using the existing SeekPrefix. |
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 change aims to provide the necessary groundwork for hashicorp/nomad#54 and is related to hashicorp/go-memdb#8.
This change makes it possible to search for a partial prefix and generate all underlying entries from that node onwards. This does not yet include a full test for the new function. We would like to collaborate on providing that.