Merge pull request #38 from harrison3000/faster_levenshtein

Reduce the number of allocations on the LevenshteinDistance function
lithammer · May 3, 2022 · 61128a1 · 61128a1
2 parents e2080d7 + 7734883
commit 61128a1
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/fuzzy/levenshtein.go b/fuzzy/levenshtein.go
@@ -10,10 +10,10 @@ package fuzzy
 // http://en.wikibooks.org/wiki/Algorithm_implementation/Strings/Levenshtein_distance#C
 func LevenshteinDistance(s, t string) int {
 	r1, r2 := []rune(s), []rune(t)
-	column := make([]int, len(r1)+1)
+	column := make([]int, 1, 64)
 
 	for y := 1; y <= len(r1); y++ {
-		column[y] = y
+		column = append(column, y)
 	}
 
 	for x := 1; x <= len(r2); x++ {