Reduce the number of allocations on the LevenshteinDistance function #38
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 makes the LevenshteinDistance function a bit faster for small strings, but most importantly reduces the number of allocations by allocating the column slice on the stack
Somehow for bigger strings it also reduced the allocation count by 1, I think the compiler recognizes this pattern of appending in a loop and optimizes it
For strings a bit bigger (but smaller than 64 runes) the speed improvement vanishes but the 0 alocation remains