From b701d19e8b8b45226f6cb1090dd160eea989ca7e Mon Sep 17 00:00:00 2001 From: jwijenbergh Date: Thu, 21 Nov 2024 16:50:06 +0100 Subject: levenshtein: Use the builtin function min --- internal/levenshtein/levenshtein.go | 8 -------- 1 file changed, 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 -- cgit v1.2.3