Optimize finding slot for a given key count in a fenwick tree#12704
Merged
madolson merged 5 commits intoredis:unstablefrom Oct 28, 2023
Merged
Optimize finding slot for a given key count in a fenwick tree#12704madolson merged 5 commits intoredis:unstablefrom
madolson merged 5 commits intoredis:unstablefrom
Conversation
madolson
approved these changes
Oct 27, 2023
madolson
reviewed
Oct 27, 2023
2 tasks
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 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.
Related to #12654
This PR optimizes the time complexity of
findSlotByKeyIndexfrom O(log^2(N)) to O(log(N)).