Conditions | 6 |
Paths | 8 |
Total Lines | 27 |
Lines | 0 |
Ratio | 0 % |
Changes | 0 |
1 | <?php |
||
9 | public static function findClosestMatch(array $strings, string $input, int $sensitivity = 4): ?string |
||
10 | { |
||
11 | $closestDistance = -1; |
||
12 | $closestMatch = null; |
||
13 | |||
14 | foreach ($strings as $string) { |
||
15 | $levenshteinDistance = levenshtein($input, $string); |
||
16 | |||
17 | if ($levenshteinDistance === 0) { |
||
18 | $closestMatch = $string; |
||
19 | $closestDistance = 0; |
||
20 | |||
21 | break; |
||
22 | } |
||
23 | |||
24 | if ($levenshteinDistance <= $closestDistance || $closestDistance < 0) { |
||
25 | $closestMatch = $string; |
||
26 | $closestDistance = $levenshteinDistance; |
||
27 | } |
||
28 | } |
||
29 | |||
30 | if ($closestDistance <= $sensitivity) { |
||
31 | return $closestMatch; |
||
32 | } |
||
33 | |||
34 | return null; |
||
35 | } |
||
36 | |||
52 |