From 5d309ff52cd399a6b71968a6b9a70c8ac0b98981 Mon Sep 17 00:00:00 2001
From: Joel Kronqvist <joel.h.kronqvist@gmail.com>
Date: Sat, 5 Mar 2022 19:02:27 +0200
Subject: Added node_modules for the updating to work properly.

---
 .../helper-validator-option/lib/find-suggestion.js | 45 ++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create 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
new file mode 100644
index 0000000..019ea93
--- /dev/null
+++ b/node_modules/@babel/helper-validator-option/lib/find-suggestion.js
@@ -0,0 +1,45 @@
+"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))];
+}
\ No newline at end of file
-- 
cgit v1.2.3