/var/www/flurhymez/vendor/nette/utils/src/Utils
NameSizeModeActions
ArrayHash.php18290644editdlrm
ArrayList.php26280644editdlrm
Arrays.php107680644editdlrm
Callback.php48070644editdlrm
DateTime.php33010644editdlrm
exceptions.php12030644editdlrm
FileSystem.php74360644editdlrm
Floats.php21200644editdlrm
Helpers.php20660644editdlrm
Html.php206110644editdlrm
Image.php212110644editdlrm
Json.php16100644editdlrm
ObjectHelpers.php69790644editdlrm
ObjectMixin.php9220644editdlrm
Paginator.php42350644editdlrm
Random.php10740644editdlrm
Reflection.php118840644editdlrm
Strings.php186820644editdlrm
Type.php61770644editdlrm
Validators.php94220644editdlrm
Edit: /var/www/flurhymez/vendor/nette/utils/src/Utils/Helpers.php (2066B)
$max) { throw new \InvalidArgumentException("Minimum ($min) is not less than maximum ($max)."); } return min(max($value, $min), $max); } /** * Looks for a string from possibilities that is most similar to value, but not the same (for 8-bit encoding). * @param string[] $possibilities */ public static function getSuggestion(array $possibilities, string $value): ?string { $best = null; $min = (strlen($value) / 4 + 1) * 10 + .1; foreach (array_unique($possibilities) as $item) { if ($item !== $value && ($len = levenshtein($item, $value, 10, 11, 10)) < $min) { $min = $len; $best = $item; } } return $best; } }