Speed up levenshteinWithMax by reusing buffers #1823
Merged
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
There was a problem hiding this comment.
Pull Request Overview
This PR optimizes the levenshteinWithMax function by introducing buffer reuse through a sync.Pool to reduce memory allocations during Levenshtein distance calculations. This addresses performance issues identified in issue #1640 where the function was a top allocator during tests.
- Introduces a pooled buffer system to reuse slice allocations
- Replaces direct slice creation with buffer reuse from a sync.Pool
- Uses
slices.Growto efficiently resize reused buffers
dzbarsky
reviewed
Oct 12, 2025
RyanCavanaugh
approved these changes
Oct 22, 2025
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 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.
Closes #1640
This turns out to be a top allocator in tests too.