@powerlines/plugin-automd 0.1.237 → 0.1.239

package/dist/dist-PXnBmevt.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"dist-PXnBmevt.mjs","names":["distance","deburr","ReturnTypeEnums","ThresholdTypeEnums"],"sources":["../../../node_modules/.pnpm/fastest-levenshtein@1.0.16/node_modules/fastest-levenshtein/mod.js","../../../node_modules/.pnpm/lodash.deburr@4.1.0/node_modules/lodash.deburr/index.js","../../../node_modules/.pnpm/didyoumean2@7.0.4/node_modules/didyoumean2/dist/index.mjs"],"sourcesContent":["\"use strict\";\nexports.__esModule = true;\nexports.distance = exports.closest = void 0;\nvar peq = new Uint32Array(0x10000);\nvar myers_32 = function (a, b) {\n    var n = a.length;\n    var m = b.length;\n    var lst = 1 << (n - 1);\n    var pv = -1;\n    var mv = 0;\n    var sc = n;\n    var i = n;\n    while (i--) {\n        peq[a.charCodeAt(i)] |= 1 << i;\n    }\n    for (i = 0; i < m; i++) {\n        var eq = peq[b.charCodeAt(i)];\n        var xv = eq | mv;\n        eq |= ((eq & pv) + pv) ^ pv;\n        mv |= ~(eq | pv);\n        pv &= eq;\n        if (mv & lst) {\n            sc++;\n        }\n        if (pv & lst) {\n            sc--;\n        }\n        mv = (mv << 1) | 1;\n        pv = (pv << 1) | ~(xv | mv);\n        mv &= xv;\n    }\n    i = n;\n    while (i--) {\n        peq[a.charCodeAt(i)] = 0;\n    }\n    return sc;\n};\nvar myers_x = function (b, a) {\n    var n = a.length;\n    var m = b.length;\n    var mhc = [];\n    var phc = [];\n    var hsize = Math.ceil(n / 32);\n    var vsize = Math.ceil(m / 32);\n    for (var i = 0; i < hsize; i++) {\n        phc[i] = -1;\n        mhc[i] = 0;\n    }\n    var j = 0;\n    for (; j < vsize - 1; j++) {\n        var mv_1 = 0;\n        var pv_1 = -1;\n        var start_1 = j * 32;\n        var vlen_1 = Math.min(32, m) + start_1;\n        for (var k = start_1; k < vlen_1; k++) {\n            peq[b.charCodeAt(k)] |= 1 << k;\n        }\n        for (var i = 0; i < n; i++) {\n            var eq = peq[a.charCodeAt(i)];\n            var pb = (phc[(i / 32) | 0] >>> i) & 1;\n            var mb = (mhc[(i / 32) | 0] >>> i) & 1;\n            var xv = eq | mv_1;\n            var xh = ((((eq | mb) & pv_1) + pv_1) ^ pv_1) | eq | mb;\n            var ph = mv_1 | ~(xh | pv_1);\n            var mh = pv_1 & xh;\n            if ((ph >>> 31) ^ pb) {\n                phc[(i / 32) | 0] ^= 1 << i;\n            }\n            if ((mh >>> 31) ^ mb) {\n                mhc[(i / 32) | 0] ^= 1 << i;\n            }\n            ph = (ph << 1) | pb;\n            mh = (mh << 1) | mb;\n            pv_1 = mh | ~(xv | ph);\n            mv_1 = ph & xv;\n        }\n        for (var k = start_1; k < vlen_1; k++) {\n            peq[b.charCodeAt(k)] = 0;\n        }\n    }\n    var mv = 0;\n    var pv = -1;\n    var start = j * 32;\n    var vlen = Math.min(32, m - start) + start;\n    for (var k = start; k < vlen; k++) {\n        peq[b.charCodeAt(k)] |= 1 << k;\n    }\n    var score = m;\n    for (var i = 0; i < n; i++) {\n        var eq = peq[a.charCodeAt(i)];\n        var pb = (phc[(i / 32) | 0] >>> i) & 1;\n        var mb = (mhc[(i / 32) | 0] >>> i) & 1;\n        var xv = eq | mv;\n        var xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;\n        var ph = mv | ~(xh | pv);\n        var mh = pv & xh;\n        score += (ph >>> (m - 1)) & 1;\n        score -= (mh >>> (m - 1)) & 1;\n        if ((ph >>> 31) ^ pb) {\n            phc[(i / 32) | 0] ^= 1 << i;\n        }\n        if ((mh >>> 31) ^ mb) {\n            mhc[(i / 32) | 0] ^= 1 << i;\n        }\n        ph = (ph << 1) | pb;\n        mh = (mh << 1) | mb;\n        pv = mh | ~(xv | ph);\n        mv = ph & xv;\n    }\n    for (var k = start; k < vlen; k++) {\n        peq[b.charCodeAt(k)] = 0;\n    }\n    return score;\n};\nvar distance = function (a, b) {\n    if (a.length < b.length) {\n        var tmp = b;\n        b = a;\n        a = tmp;\n    }\n    if (b.length === 0) {\n        return a.length;\n    }\n    if (a.length <= 32) {\n        return myers_32(a, b);\n    }\n    return myers_x(a, b);\n};\nexports.distance = distance;\nvar closest = function (str, arr) {\n    var min_distance = Infinity;\n    var min_index = 0;\n    for (var i = 0; i < arr.length; i++) {\n        var dist = distance(str, arr[i]);\n        if (dist < min_distance) {\n            min_distance = dist;\n            min_index = i;\n        }\n    }\n    return arr[min_index];\n};\nexports.closest = closest;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match Latin Unicode letters (excluding mathematical operators). */\nvar reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n/** Used to compose unicode character classes. */\nvar rsComboMarksRange = '\\\\u0300-\\\\u036f\\\\ufe20-\\\\ufe23',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20f0';\n\n/** Used to compose unicode capture groups. */\nvar rsCombo = '[' + rsComboMarksRange + rsComboSymbolsRange + ']';\n\n/**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\nvar reComboMark = RegExp(rsCombo, 'g');\n\n/** Used to map Latin Unicode letters to basic Latin letters. */\nvar deburredLetters = {\n  // Latin-1 Supplement block.\n  '\\xc0': 'A',  '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n  '\\xe0': 'a',  '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n  '\\xc7': 'C',  '\\xe7': 'c',\n  '\\xd0': 'D',  '\\xf0': 'd',\n  '\\xc8': 'E',  '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n  '\\xe8': 'e',  '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n  '\\xcc': 'I',  '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n  '\\xec': 'i',  '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n  '\\xd1': 'N',  '\\xf1': 'n',\n  '\\xd2': 'O',  '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n  '\\xf2': 'o',  '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n  '\\xd9': 'U',  '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n  '\\xf9': 'u',  '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n  '\\xdd': 'Y',  '\\xfd': 'y', '\\xff': 'y',\n  '\\xc6': 'Ae', '\\xe6': 'ae',\n  '\\xde': 'Th', '\\xfe': 'th',\n  '\\xdf': 'ss',\n  // Latin Extended-A block.\n  '\\u0100': 'A',  '\\u0102': 'A', '\\u0104': 'A',\n  '\\u0101': 'a',  '\\u0103': 'a', '\\u0105': 'a',\n  '\\u0106': 'C',  '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n  '\\u0107': 'c',  '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n  '\\u010e': 'D',  '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n  '\\u0112': 'E',  '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n  '\\u0113': 'e',  '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n  '\\u011c': 'G',  '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n  '\\u011d': 'g',  '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n  '\\u0124': 'H',  '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n  '\\u0128': 'I',  '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n  '\\u0129': 'i',  '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n  '\\u0134': 'J',  '\\u0135': 'j',\n  '\\u0136': 'K',  '\\u0137': 'k', '\\u0138': 'k',\n  '\\u0139': 'L',  '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n  '\\u013a': 'l',  '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n  '\\u0143': 'N',  '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n  '\\u0144': 'n',  '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n  '\\u014c': 'O',  '\\u014e': 'O', '\\u0150': 'O',\n  '\\u014d': 'o',  '\\u014f': 'o', '\\u0151': 'o',\n  '\\u0154': 'R',  '\\u0156': 'R', '\\u0158': 'R',\n  '\\u0155': 'r',  '\\u0157': 'r', '\\u0159': 'r',\n  '\\u015a': 'S',  '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n  '\\u015b': 's',  '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n  '\\u0162': 'T',  '\\u0164': 'T', '\\u0166': 'T',\n  '\\u0163': 't',  '\\u0165': 't', '\\u0167': 't',\n  '\\u0168': 'U',  '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n  '\\u0169': 'u',  '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n  '\\u0174': 'W',  '\\u0175': 'w',\n  '\\u0176': 'Y',  '\\u0177': 'y', '\\u0178': 'Y',\n  '\\u0179': 'Z',  '\\u017b': 'Z', '\\u017d': 'Z',\n  '\\u017a': 'z',  '\\u017c': 'z', '\\u017e': 'z',\n  '\\u0132': 'IJ', '\\u0133': 'ij',\n  '\\u0152': 'Oe', '\\u0153': 'oe',\n  '\\u0149': \"'n\", '\\u017f': 'ss'\n};\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyOf(object) {\n  return function(key) {\n    return object == null ? undefined : object[key];\n  };\n}\n\n/**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\nvar deburrLetter = basePropertyOf(deburredLetters);\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\n/**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * _.deburr('déjà vu');\n * // => 'deja vu'\n */\nfunction deburr(string) {\n  string = toString(string);\n  return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n}\n\nmodule.exports = deburr;\n","import { distance } from 'fastest-levenshtein';\nimport deburr from 'lodash.deburr';\n\nlet ReturnTypeEnums = /*#__PURE__*/function (ReturnTypeEnums) {\n  ReturnTypeEnums[\"ALL_CLOSEST_MATCHES\"] = \"all-closest-matches\";\n  ReturnTypeEnums[\"ALL_MATCHES\"] = \"all-matches\";\n  ReturnTypeEnums[\"ALL_SORTED_MATCHES\"] = \"all-sorted-matches\";\n  ReturnTypeEnums[\"FIRST_CLOSEST_MATCH\"] = \"first-closest-match\";\n  ReturnTypeEnums[\"FIRST_MATCH\"] = \"first-match\";\n  return ReturnTypeEnums;\n}({});\n\nlet ThresholdTypeEnums = /*#__PURE__*/function (ThresholdTypeEnums) {\n  ThresholdTypeEnums[\"EDIT_DISTANCE\"] = \"edit-distance\";\n  ThresholdTypeEnums[\"SIMILARITY\"] = \"similarity\";\n  return ThresholdTypeEnums;\n}({});\n\nconst fillDefaultOptions = options => {\n  const optionsWithDefaultValues = {\n    caseSensitive: false,\n    deburr: true,\n    matchPath: [],\n    returnType: ReturnTypeEnums.FIRST_CLOSEST_MATCH,\n    thresholdType: ThresholdTypeEnums.SIMILARITY,\n    trimSpaces: true,\n    ...options\n  };\n  if (!Object.values(ReturnTypeEnums).includes(optionsWithDefaultValues.returnType)) {\n    throw new TypeError('unknown returnType');\n  }\n  if (!Object.values(ThresholdTypeEnums).includes(optionsWithDefaultValues.thresholdType)) {\n    throw new TypeError('unknown thresholdType');\n  }\n  switch (optionsWithDefaultValues.thresholdType) {\n    case ThresholdTypeEnums.EDIT_DISTANCE:\n      return {\n        threshold: 20,\n        ...optionsWithDefaultValues\n      };\n    case ThresholdTypeEnums.SIMILARITY:\n      return {\n        threshold: 0.4,\n        ...optionsWithDefaultValues\n      };\n  }\n};\n\n/**\n * Using edit distance between `a` and `b` to calculate similarity\n *\n * @param {string} a - `input`\n * @param {string} b - String from `matchList`\n * @returns {number} similarity between `a` and `b`\n */\nconst getSimilarity = (a, b) => {\n  if (!a || !b) return 0;\n  if (a === b) return 1;\n  const editDistance = distance(a, b);\n  const longestLength = Math.max(a.length, b.length);\n  return (longestLength - editDistance) / longestLength;\n};\n\n/**\n * Normalize a string\n *\n * @param {string} str - any string\n * @param {object} options - options that allows you to modify the behavior\n * @returns {string} - normalized string\n */\nconst normalizeString = (str, options) => {\n  let s = str;\n  if (options.trimSpaces) {\n    s = s.trim().replaceAll(/\\s+/gu, ' ');\n  }\n  if (options.deburr) {\n    s = deburr(s);\n  }\n  if (!options.caseSensitive) {\n    s = s.toLowerCase();\n  }\n  return s;\n};\n\nconst getMatchItemStr = (matchItem, matchPath) => {\n  const matchItemStr = matchPath.length > 0 ? matchPath.reduce((acc, prop) => {\n    // @ts-expect-error skip redundant type check\n    return acc?.[prop];\n  }, matchItem) : matchItem;\n  if (typeof matchItemStr !== 'string') return '';\n  return matchItemStr;\n};\n\n/**\n * Process matchItem according to options\n *\n * @param {object | string} matchItem - Item for matching with `input`\n * @param {object} options - options that allows you to modify the behavior\n * @returns {string} - processed matchItem\n */\nconst matchItemProcessor = (matchItem, options) => {\n  const {\n    matchPath\n  } = options;\n  const matchItemStr = getMatchItemStr(matchItem, matchPath);\n  return normalizeString(matchItemStr, options);\n};\n\n/**\n * Generate result\n *\n * @param {object[] | string[]} matchList - List for matching with `input`\n * @param {number[]} matchedIndexes - indexes of matchList that need to be returned as result\n * @param {ReturnTypeEnums} returnType - how the result will response to user\n * @returns {Array | null | object | string} - matched result(s), return object if `match` is `{Object[]}`\n */\nconst resultProcessor = (matchList, matchedIndexes, returnType\n// eslint-disable-next-line functional/prefer-immutable-types\n) => {\n  switch (returnType) {\n    case ReturnTypeEnums.ALL_CLOSEST_MATCHES:\n    case ReturnTypeEnums.ALL_MATCHES:\n    case ReturnTypeEnums.ALL_SORTED_MATCHES:\n      return matchedIndexes.map(matchedIndex => matchList[matchedIndex]);\n    case ReturnTypeEnums.FIRST_CLOSEST_MATCH:\n    case ReturnTypeEnums.FIRST_MATCH:\n      {\n        const matchedIndex = matchedIndexes[0];\n        if (matchedIndex === undefined) return null;\n        return matchList[matchedIndex];\n      }\n  }\n};\n\n/**\n * Main function for didyoumean2\n *\n * @param {string} input - string that you are not sure and want to match with `matchList`\n * @param {object[] | string[]} matchList - List for matching with `input`\n * @param {null | object | undefined} options - options that allows you to modify the behavior\n * @returns {Array | null | object | string} - matched result(s), return object if `match` is `{Object[]}`\n */\nfunction didYouMean(input, matchList, options\n// eslint-disable-next-line functional/prefer-immutable-types\n) {\n  /*+++++++++++++++++++\n   + Initiate options +\n   +++++++++++++++++++*/\n\n  const optionsWithDefaults = fillDefaultOptions(options);\n  const {\n    returnType,\n    threshold,\n    thresholdType\n  } = optionsWithDefaults;\n\n  /*++++++++++++++++++++\n   + Deal with options +\n   ++++++++++++++++++++*/\n\n  const normalizedInput = normalizeString(input, optionsWithDefaults);\n  let checkIfMatched; // Validate if score is matched\n  let scoreProcessor; // Get score\n  switch (thresholdType) {\n    case ThresholdTypeEnums.EDIT_DISTANCE:\n      checkIfMatched = score => score <= threshold;\n      scoreProcessor = matchItem => distance(normalizedInput, matchItemProcessor(matchItem, optionsWithDefaults));\n      break;\n    case ThresholdTypeEnums.SIMILARITY:\n      checkIfMatched = score => score >= threshold;\n      scoreProcessor = matchItem => getSimilarity(normalizedInput, matchItemProcessor(matchItem, optionsWithDefaults));\n      break;\n  }\n\n  /*+++++++++++\n   + Matching +\n   +++++++++++*/\n\n  // eslint-disable-next-line functional/prefer-immutable-types\n  const matchedIndexes = [];\n  switch (returnType) {\n    case ReturnTypeEnums.ALL_CLOSEST_MATCHES:\n    case ReturnTypeEnums.FIRST_CLOSEST_MATCH:\n      {\n        // eslint-disable-next-line functional/prefer-immutable-types\n        const scores = [];\n        let marginValue;\n        switch (thresholdType) {\n          case ThresholdTypeEnums.EDIT_DISTANCE:\n            // Process score and save the smallest score\n            marginValue = Number.POSITIVE_INFINITY;\n            for (const matchItem of matchList) {\n              const score = scoreProcessor(matchItem);\n              if (marginValue > score) marginValue = score;\n              scores.push(score);\n            }\n            break;\n          case ThresholdTypeEnums.SIMILARITY:\n            // Process score and save the largest score\n            marginValue = 0;\n            for (const matchItem of matchList) {\n              const score = scoreProcessor(matchItem);\n              if (marginValue < score) marginValue = score;\n              scores.push(score);\n            }\n            break;\n        }\n        for (const [i, score] of scores.entries()) {\n          if (checkIfMatched(score) && score === marginValue) {\n            matchedIndexes.push(i);\n          }\n        }\n        break;\n      }\n    case ReturnTypeEnums.ALL_MATCHES:\n      for (const [i, matchItem] of matchList.entries()) {\n        const score = scoreProcessor(matchItem);\n\n        // save all indexes of matched scores\n        if (checkIfMatched(score)) {\n          matchedIndexes.push(i);\n        }\n      }\n      break;\n    case ReturnTypeEnums.ALL_SORTED_MATCHES:\n      {\n        // eslint-disable-next-line functional/prefer-immutable-types\n        const unsortedResults = [];\n        for (const [i, matchItem] of matchList.entries()) {\n          const score = scoreProcessor(matchItem);\n\n          // save all indexes of matched scores\n          if (checkIfMatched(score)) {\n            unsortedResults.push({\n              score,\n              index: i\n            });\n          }\n        }\n        switch (thresholdType) {\n          case ThresholdTypeEnums.EDIT_DISTANCE:\n            unsortedResults.sort((a, b) => a.score - b.score);\n            break;\n          case ThresholdTypeEnums.SIMILARITY:\n            unsortedResults.sort((a, b) => b.score - a.score);\n            break;\n        }\n        for (const unsortedResult of unsortedResults) {\n          matchedIndexes.push(unsortedResult.index);\n        }\n        break;\n      }\n    case ReturnTypeEnums.FIRST_MATCH:\n      for (const [i, matchItem] of matchList.entries()) {\n        const score = scoreProcessor(matchItem);\n\n        // Return once matched, performance is main target in this returnType\n        if (checkIfMatched(score)) {\n          matchedIndexes.push(i);\n          break;\n        }\n      }\n      break;\n  }\n\n  /*+++++++++++++++++++++++\n   + Process return value +\n   +++++++++++++++++++++++*/\n\n  return resultProcessor(matchList, matchedIndexes, returnType);\n}\n\nexport { ReturnTypeEnums, ThresholdTypeEnums, didYouMean as default };\n//# sourceMappingURL=index.mjs.map\n"],"x_google_ignoreList":[0,1,2],"mappings":";;;;AACA,SAAQ,aAAa;AACrB,SAAQ,WAAW,QAAQ,UAAU,KAAK;CAC1C,IAAI,MAAM,IAAI,YAAY,MAAQ;CAClC,IAAI,WAAW,SAAU,GAAG,GAAG;EAC3B,IAAI,IAAI,EAAE;EACV,IAAI,IAAI,EAAE;EACV,IAAI,MAAM,KAAM,IAAI;EACpB,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,IAAI;AACR,SAAO,IACH,KAAI,EAAE,WAAW,EAAE,KAAK,KAAK;AAEjC,OAAK,IAAI,GAAG,IAAI,GAAG,KAAK;GACpB,IAAI,KAAK,IAAI,EAAE,WAAW,EAAE;GAC5B,IAAI,KAAK,KAAK;AACd,UAAQ,KAAK,MAAM,KAAM;AACzB,SAAM,EAAE,KAAK;AACb,SAAM;AACN,OAAI,KAAK,IACL;AAEJ,OAAI,KAAK,IACL;AAEJ,QAAM,MAAM,IAAK;AACjB,QAAM,MAAM,IAAK,EAAE,KAAK;AACxB,SAAM;;AAEV,MAAI;AACJ,SAAO,IACH,KAAI,EAAE,WAAW,EAAE,IAAI;AAE3B,SAAO;;CAEX,IAAI,UAAU,SAAU,GAAG,GAAG;EAC1B,IAAI,IAAI,EAAE;EACV,IAAI,IAAI,EAAE;EACV,IAAI,MAAM,EAAE;EACZ,IAAI,MAAM,EAAE;EACZ,IAAI,QAAQ,KAAK,KAAK,IAAI,GAAG;EAC7B,IAAI,QAAQ,KAAK,KAAK,IAAI,GAAG;AAC7B,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;AAC5B,OAAI,KAAK;AACT,OAAI,KAAK;;EAEb,IAAI,IAAI;AACR,SAAO,IAAI,QAAQ,GAAG,KAAK;GACvB,IAAI,OAAO;GACX,IAAI,OAAO;GACX,IAAI,UAAU,IAAI;GAClB,IAAI,SAAS,KAAK,IAAI,IAAI,EAAE,GAAG;AAC/B,QAAK,IAAI,IAAI,SAAS,IAAI,QAAQ,IAC9B,KAAI,EAAE,WAAW,EAAE,KAAK,KAAK;AAEjC,QAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;IACxB,IAAI,KAAK,IAAI,EAAE,WAAW,EAAE;IAC5B,IAAI,KAAM,IAAK,IAAI,KAAM,OAAO,IAAK;IACrC,IAAI,KAAM,IAAK,IAAI,KAAM,OAAO,IAAK;IACrC,IAAI,KAAK,KAAK;IACd,IAAI,OAAS,KAAK,MAAM,QAAQ,OAAQ,OAAQ,KAAK;IACrD,IAAI,KAAK,OAAO,EAAE,KAAK;IACvB,IAAI,KAAK,OAAO;AAChB,QAAK,OAAO,KAAM,GACd,KAAK,IAAI,KAAM,MAAM,KAAK;AAE9B,QAAK,OAAO,KAAM,GACd,KAAK,IAAI,KAAM,MAAM,KAAK;AAE9B,SAAM,MAAM,IAAK;AACjB,SAAM,MAAM,IAAK;AACjB,WAAO,KAAK,EAAE,KAAK;AACnB,WAAO,KAAK;;AAEhB,QAAK,IAAI,IAAI,SAAS,IAAI,QAAQ,IAC9B,KAAI,EAAE,WAAW,EAAE,IAAI;;EAG/B,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,QAAQ,IAAI;EAChB,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI,MAAM,GAAG;AACrC,OAAK,IAAI,IAAI,OAAO,IAAI,MAAM,IAC1B,KAAI,EAAE,WAAW,EAAE,KAAK,KAAK;EAEjC,IAAI,QAAQ;AACZ,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GACxB,IAAI,KAAK,IAAI,EAAE,WAAW,EAAE;GAC5B,IAAI,KAAM,IAAK,IAAI,KAAM,OAAO,IAAK;GACrC,IAAI,KAAM,IAAK,IAAI,KAAM,OAAO,IAAK;GACrC,IAAI,KAAK,KAAK;GACd,IAAI,OAAS,KAAK,MAAM,MAAM,KAAM,KAAM,KAAK;GAC/C,IAAI,KAAK,KAAK,EAAE,KAAK;GACrB,IAAI,KAAK,KAAK;AACd,YAAU,OAAQ,IAAI,IAAM;AAC5B,YAAU,OAAQ,IAAI,IAAM;AAC5B,OAAK,OAAO,KAAM,GACd,KAAK,IAAI,KAAM,MAAM,KAAK;AAE9B,OAAK,OAAO,KAAM,GACd,KAAK,IAAI,KAAM,MAAM,KAAK;AAE9B,QAAM,MAAM,IAAK;AACjB,QAAM,MAAM,IAAK;AACjB,QAAK,KAAK,EAAE,KAAK;AACjB,QAAK,KAAK;;AAEd,OAAK,IAAI,IAAI,OAAO,IAAI,MAAM,IAC1B,KAAI,EAAE,WAAW,EAAE,IAAI;AAE3B,SAAO;;CAEX,IAAIA,aAAW,SAAU,GAAG,GAAG;AAC3B,MAAI,EAAE,SAAS,EAAE,QAAQ;GACrB,IAAI,MAAM;AACV,OAAI;AACJ,OAAI;;AAER,MAAI,EAAE,WAAW,EACb,QAAO,EAAE;AAEb,MAAI,EAAE,UAAU,GACZ,QAAO,SAAS,GAAG,EAAE;AAEzB,SAAO,QAAQ,GAAG,EAAE;;AAExB,SAAQ,WAAWA;CACnB,IAAI,UAAU,SAAU,KAAK,KAAK;EAC9B,IAAI,eAAe;EACnB,IAAI,YAAY;AAChB,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GACjC,IAAI,OAAOA,WAAS,KAAK,IAAI,GAAG;AAChC,OAAI,OAAO,cAAc;AACrB,mBAAe;AACf,gBAAY;;;AAGpB,SAAO,IAAI;;AAEf,SAAQ,UAAU;;;;;;;;;;;;;;;CCnIlB,IAAI,WAAW;;CAGf,IAAI,YAAY;;CAGhB,IAAI,UAAU;;;;;CAad,IAAI,cAAc,OANJ,mDAMoB,IAAI;;CAGtC,IAAI,kBAAkB;EAEpB,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAC1E,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAC1E,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAC1E,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAC1E,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EAAK,KAAQ;EAChD,KAAQ;EAAM,KAAQ;EAAK,KAAQ;EACnC,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAAM,KAAQ;EACtB,KAAQ;EAER,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAC1B,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACvE,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EACxD,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACtF,KAAU;EAAM,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EAAK,KAAU;EACtF,KAAU;EAAM,KAAU;EAC1B,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAAK,KAAU;EACzC,KAAU;EAAM,KAAU;EAC1B,KAAU;EAAM,KAAU;EAC1B,KAAU;EAAM,KAAU;EAC3B;;CAGD,IAAI,aAAa,OAAO,UAAU,YAAY,UAAU,OAAO,WAAW,UAAU;;CAGpF,IAAI,WAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU;;CAG5E,IAAI,OAAO,cAAc,YAAY,SAAS,cAAc,EAAE;;;;;;;;CAS9D,SAAS,eAAe,QAAQ;AAC9B,SAAO,SAAS,KAAK;AACnB,UAAO,UAAU,OAAO,SAAY,OAAO;;;;;;;;;;;CAY/C,IAAI,eAAe,eAAe,gBAAgB;;;;;;CAUlD,IAAI,iBAPc,OAAO,UAOQ;;CAGjC,IAAI,SAAS,KAAK;;CAGlB,IAAI,cAAc,SAAS,OAAO,YAAY,QAC1C,iBAAiB,cAAc,YAAY,WAAW;;;;;;;;;CAU1D,SAAS,aAAa,OAAO;AAE3B,MAAI,OAAO,SAAS,SAClB,QAAO;AAET,MAAI,SAAS,MAAM,CACjB,QAAO,iBAAiB,eAAe,KAAK,MAAM,GAAG;EAEvD,IAAI,SAAU,QAAQ;AACtB,SAAQ,UAAU,OAAQ,IAAI,SAAU,CAAC,WAAY,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;CA2B9D,SAAS,aAAa,OAAO;AAC3B,SAAO,CAAC,CAAC,SAAS,OAAO,SAAS;;;;;;;;;;;;;;;;;;;CAoBpC,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,SAAS,YACpB,aAAa,MAAM,IAAI,eAAe,KAAK,MAAM,IAAI;;;;;;;;;;;;;;;;;;;;;;;CAwB1D,SAAS,SAAS,OAAO;AACvB,SAAO,SAAS,OAAO,KAAK,aAAa,MAAM;;;;;;;;;;;;;;;;;;;;CAqBjD,SAASC,SAAO,QAAQ;AACtB,WAAS,SAAS,OAAO;AACzB,SAAO,UAAU,OAAO,QAAQ,SAAS,aAAa,CAAC,QAAQ,aAAa,GAAG;;AAGjF,QAAO,UAAUA;;;;;;;AC7PjB,IAAI,kBAA+B,yBAAU,mBAAiB;AAC5D,mBAAgB,yBAAyB;AACzC,mBAAgB,iBAAiB;AACjC,mBAAgB,wBAAwB;AACxC,mBAAgB,yBAAyB;AACzC,mBAAgB,iBAAiB;AACjC,QAAOC;EACP,EAAE,CAAC;AAEL,IAAI,qBAAkC,yBAAU,sBAAoB;AAClE,sBAAmB,mBAAmB;AACtC,sBAAmB,gBAAgB;AACnC,QAAOC;EACP,EAAE,CAAC;AAEL,MAAM,sBAAqB,YAAW;CACpC,MAAM,2BAA2B;EAC/B,eAAe;EACf,QAAQ;EACR,WAAW,EAAE;EACb,YAAY,gBAAgB;EAC5B,eAAe,mBAAmB;EAClC,YAAY;EACZ,GAAG;EACJ;AACD,KAAI,CAAC,OAAO,OAAO,gBAAgB,CAAC,SAAS,yBAAyB,WAAW,CAC/E,OAAM,IAAI,UAAU,qBAAqB;AAE3C,KAAI,CAAC,OAAO,OAAO,mBAAmB,CAAC,SAAS,yBAAyB,cAAc,CACrF,OAAM,IAAI,UAAU,wBAAwB;AAE9C,SAAQ,yBAAyB,eAAjC;EACE,KAAK,mBAAmB,cACtB,QAAO;GACL,WAAW;GACX,GAAG;GACJ;EACH,KAAK,mBAAmB,WACtB,QAAO;GACL,WAAW;GACX,GAAG;GACJ;;;;;;;;;;AAWP,MAAM,iBAAiB,GAAG,MAAM;AAC9B,KAAI,CAAC,KAAK,CAAC,EAAG,QAAO;AACrB,KAAI,MAAM,EAAG,QAAO;CACpB,MAAM,wDAAwB,GAAG,EAAE;CACnC,MAAM,gBAAgB,KAAK,IAAI,EAAE,QAAQ,EAAE,OAAO;AAClD,SAAQ,gBAAgB,gBAAgB;;;;;;;;;AAU1C,MAAM,mBAAmB,KAAK,YAAY;CACxC,IAAI,IAAI;AACR,KAAI,QAAQ,WACV,KAAI,EAAE,MAAM,CAAC,WAAW,SAAS,IAAI;AAEvC,KAAI,QAAQ,OACV,gCAAW,EAAE;AAEf,KAAI,CAAC,QAAQ,cACX,KAAI,EAAE,aAAa;AAErB,QAAO;;AAGT,MAAM,mBAAmB,WAAW,cAAc;CAChD,MAAM,eAAe,UAAU,SAAS,IAAI,UAAU,QAAQ,KAAK,SAAS;AAE1E,SAAO,MAAM;IACZ,UAAU,GAAG;AAChB,KAAI,OAAO,iBAAiB,SAAU,QAAO;AAC7C,QAAO;;;;;;;;;AAUT,MAAM,sBAAsB,WAAW,YAAY;CACjD,MAAM,EACJ,cACE;AAEJ,QAAO,gBADc,gBAAgB,WAAW,UAAU,EACrB,QAAQ;;;;;;;;;;AAW/C,MAAM,mBAAmB,WAAW,gBAAgB,eAE/C;AACH,SAAQ,YAAR;EACE,KAAK,gBAAgB;EACrB,KAAK,gBAAgB;EACrB,KAAK,gBAAgB,mBACnB,QAAO,eAAe,KAAI,iBAAgB,UAAU,cAAc;EACpE,KAAK,gBAAgB;EACrB,KAAK,gBAAgB,aACnB;GACE,MAAM,eAAe,eAAe;AACpC,OAAI,iBAAiB,OAAW,QAAO;AACvC,UAAO,UAAU;;;;;;;;;;;;AAazB,SAAS,WAAW,OAAO,WAAW,SAEpC;CAKA,MAAM,sBAAsB,mBAAmB,QAAQ;CACvD,MAAM,EACJ,YACA,WACA,kBACE;CAMJ,MAAM,kBAAkB,gBAAgB,OAAO,oBAAoB;CACnE,IAAI;CACJ,IAAI;AACJ,SAAQ,eAAR;EACE,KAAK,mBAAmB;AACtB,qBAAiB,UAAS,SAAS;AACnC,qBAAiB,uDAAsB,iBAAiB,mBAAmB,WAAW,oBAAoB,CAAC;AAC3G;EACF,KAAK,mBAAmB;AACtB,qBAAiB,UAAS,SAAS;AACnC,qBAAiB,cAAa,cAAc,iBAAiB,mBAAmB,WAAW,oBAAoB,CAAC;AAChH;;CAQJ,MAAM,iBAAiB,EAAE;AACzB,SAAQ,YAAR;EACE,KAAK,gBAAgB;EACrB,KAAK,gBAAgB,qBACnB;GAEE,MAAM,SAAS,EAAE;GACjB,IAAI;AACJ,WAAQ,eAAR;IACE,KAAK,mBAAmB;AAEtB,mBAAc,OAAO;AACrB,UAAK,MAAM,aAAa,WAAW;MACjC,MAAM,QAAQ,eAAe,UAAU;AACvC,UAAI,cAAc,MAAO,eAAc;AACvC,aAAO,KAAK,MAAM;;AAEpB;IACF,KAAK,mBAAmB;AAEtB,mBAAc;AACd,UAAK,MAAM,aAAa,WAAW;MACjC,MAAM,QAAQ,eAAe,UAAU;AACvC,UAAI,cAAc,MAAO,eAAc;AACvC,aAAO,KAAK,MAAM;;AAEpB;;AAEJ,QAAK,MAAM,CAAC,GAAG,UAAU,OAAO,SAAS,CACvC,KAAI,eAAe,MAAM,IAAI,UAAU,YACrC,gBAAe,KAAK,EAAE;AAG1B;;EAEJ,KAAK,gBAAgB;AACnB,QAAK,MAAM,CAAC,GAAG,cAAc,UAAU,SAAS,EAAE;IAChD,MAAM,QAAQ,eAAe,UAAU;AAGvC,QAAI,eAAe,MAAM,CACvB,gBAAe,KAAK,EAAE;;AAG1B;EACF,KAAK,gBAAgB,oBACnB;GAEE,MAAM,kBAAkB,EAAE;AAC1B,QAAK,MAAM,CAAC,GAAG,cAAc,UAAU,SAAS,EAAE;IAChD,MAAM,QAAQ,eAAe,UAAU;AAGvC,QAAI,eAAe,MAAM,CACvB,iBAAgB,KAAK;KACnB;KACA,OAAO;KACR,CAAC;;AAGN,WAAQ,eAAR;IACE,KAAK,mBAAmB;AACtB,qBAAgB,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AACjD;IACF,KAAK,mBAAmB;AACtB,qBAAgB,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AACjD;;AAEJ,QAAK,MAAM,kBAAkB,gBAC3B,gBAAe,KAAK,eAAe,MAAM;AAE3C;;EAEJ,KAAK,gBAAgB;AACnB,QAAK,MAAM,CAAC,GAAG,cAAc,UAAU,SAAS,EAAE;IAChD,MAAM,QAAQ,eAAe,UAAU;AAGvC,QAAI,eAAe,MAAM,EAAE;AACzB,oBAAe,KAAK,EAAE;AACtB;;;AAGJ;;AAOJ,QAAO,gBAAgB,WAAW,gBAAgB,WAAW"}

package/dist/index-B8OHl-c_.d.mts

@@ -0,0 +1 @@
+export { };

package/dist/index-CmCelmEL.d.cts

@@ -0,0 +1 @@
+export { };