feat: optimize Suffix Tree performance to O(N)#10
Merged
Conversation
Owner
abahgat
commented
Feb 16, 2026
abahgat
commented
- Refactored Edge to use substring views instead of String copies.
- Optimized GeneralizedSuffixTree to use index arithmetic in canonize.
- Implemented geometric expansion for Node data array resizing to fix O(N^2) bottleneck in degenerate cases.
- Updated benchmarks to include degenerate test cases.
- Refactored Edge to use substring views instead of String copies. - Optimized GeneralizedSuffixTree to use index arithmetic in canonize. - Implemented geometric expansion for Node data array resizing to fix O(N^2) bottleneck in degenerate cases. - Updated benchmarks to include degenerate test cases.
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
1 participant
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.