From fc87c009806dcc98867f6b58efe29b042aa01dee Mon Sep 17 00:00:00 2001 From: littleblack111 Date: Mon, 18 May 2026 23:10:59 +0800 Subject: node: update --- .../helper-validator-option/lib/find-suggestion.js | 39 ---------------------- 1 file changed, 39 deletions(-) delete mode 100644 node_modules/@babel/helper-validator-option/lib/find-suggestion.js (limited to 'node_modules/@babel/helper-validator-option/lib/find-suggestion.js') diff --git a/node_modules/@babel/helper-validator-option/lib/find-suggestion.js b/node_modules/@babel/helper-validator-option/lib/find-suggestion.js deleted file mode 100644 index beada9a7..00000000 --- a/node_modules/@babel/helper-validator-option/lib/find-suggestion.js +++ /dev/null @@ -1,39 +0,0 @@ -"use strict"; - -Object.defineProperty(exports, "__esModule", { - value: true -}); -exports.findSuggestion = findSuggestion; -const { - min -} = Math; -function levenshtein(a, b) { - let t = [], - u = [], - i, - j; - const m = a.length, - n = b.length; - if (!m) { - return n; - } - if (!n) { - return m; - } - for (j = 0; j <= n; j++) { - t[j] = j; - } - for (i = 1; i <= m; i++) { - for (u = [i], j = 1; j <= n; j++) { - u[j] = a[i - 1] === b[j - 1] ? t[j - 1] : min(t[j - 1], t[j], u[j - 1]) + 1; - } - t = u; - } - return u[n]; -} -function findSuggestion(str, arr) { - const distances = arr.map(el => levenshtein(el, str)); - return arr[distances.indexOf(min(...distances))]; -} - -//# sourceMappingURL=find-suggestion.js.map -- cgit v1.2.3