levenshtein: Use the builtin function min

1 files changed, 0 insertions, 8 deletions

diff --git a/internal/levenshtein/levenshtein.go b/internal/levenshtein/levenshtein.go
index cf28607..68108bc 100644
--- a/internal/levenshtein/levenshtein.go
+++ b/internal/levenshtein/levenshtein.go
@@ -10,14 +10,6 @@ import (
 	"golang.org/x/text/unicode/norm"
 )
 
-// min returns the min of a and b
-func min(a, b int) int {
-	if a < b {
-		return a
-	}
-	return b
-}
-
 // levenshtein is an algorithm that returns the "distance" between two strings
 // the distance for hello and helloxd is 2 because it takes two inserts to go from hello to helloxd
 // the distance between hello and hello is 0 because the strings are equal