{"version":3,"file":"externals/@devsnc/fuzzy-search/29.0.1-polaris.19/index.min.js","mappings":";;eAAA,SAASA,IACP,OAAOC,EAAOC,QAAUF,EAAWG,OAAOC,OAASD,OAAOC,OAAOC,OAAS,SAAUC,GAClF,IAAK,IAAIC,EAAI,EAAGA,EAAIC,UAAUC,OAAQF,IAAK,CACzC,IAAIG,EAAIF,UAAUD,GAClB,IAAK,IAAII,KAAKD,GAAG,CAAG,GAAEE,eAAeC,KAAKH,EAAGC,KAAOL,EAAEK,GAAKD,EAAEC,GAC/D,CACA,OAAOL,CACT,EAAGL,EAAOC,QAAQY,YAAa,EAAMb,EAAOC,QAAiB,QAAID,EAAOC,QAASF,EAASe,MAAM,KAAMP,UACxG,CACAP,EAAOC,QAAUF,EAAUC,EAAOC,QAAQY,YAAa,EAAMb,EAAOC,QAAiB,QAAID,EAAOC,O,GCR5Fc,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBE,IAAjBD,EACH,OAAOA,EAAajB,QAGrB,IAAID,EAASe,EAAyBE,GAAY,CAGjDhB,QAAS,CAAC,GAOX,OAHAmB,EAAoBH,GAAUjB,EAAQA,EAAOC,QAASe,GAG/ChB,EAAOC,OACf,CCrBAe,EAAoBX,EAAKL,IACxB,IAAIqB,EAASrB,GAAUA,EAAOa,WAC7B,IAAOb,EAAiB,QACxB,IAAM,EAEP,OADAgB,EAAoBM,EAAED,EAAQ,CAAEE,EAAGF,IAC5BA,GCLRL,EAAoBM,EAAI,CAACrB,EAASuB,KACjC,IAAI,IAAIC,KAAOD,EACXR,EAAoBU,EAAEF,EAAYC,KAAST,EAAoBU,EAAEzB,EAASwB,IAC5EvB,OAAOyB,eAAe1B,EAASwB,EAAK,CAAEG,YAAY,EAAMC,IAAKL,EAAWC,MCJ3ET,EAAoBU,EAAI,CAACI,EAAKC,IAAU7B,OAAO8B,UAAUrB,eAAeC,KAAKkB,EAAKC,G,gDCElF,MAAM,EAFEE,KAAO,IAAIC,EAAI,CAAC,EAAgC,OAA7BlB,EAAoBM,EAAEY,EAAGD,GAAWC,GAE1BA,CAAE,CAAE,YAAiB,KACrD,MAAMC,EAAYC,EAA+FC,SAAWD,EAA+FvB,WAGpN,OAAIsB,EACHC,EAAwG,QAAEE,YAI3GF,EAA+FE,aAAeF,EAAwG,SAAKA,EAAwG,QAAEE,eCXpUC,EACR,CACHC,0BAA2B,8CCCvBC,EAAeC,IACpB,IAAIC,EAAM,EACNC,EAAQ,EAOZ,OANAF,EAAMG,QAAQ,CAACC,EAAQC,KAClBD,GAAUH,IACbA,EAAMG,EACNF,EAAQG,KAGH,CAACJ,MAAKC,UCTd,QDoBO,SACNI,EACAC,GAEC,IADDC,EAAS3C,UAAAC,OAAA,QAAAW,IAAAZ,UAAA,GAAAA,UAAA,IAAG+B,EAAAA,EAAAA,aAAYC,EAAaC,0BAA2B,IAEhE,MAAMW,EAAkBH,aAAM,EAANA,EAAQI,cAAcC,OACxCC,EAAkBL,aAAM,EAANA,EAAQG,cAChC,IAAKJ,IAAWC,EAAQ,OAAO,KAE/B,MAAMM,EAAY,CAACC,MAAO,EAAGC,aAAc,IAGrCC,EAASC,MAAMC,KAAK,CAACpD,OAAQ2C,EAAgB3C,QAAS,IAC3DmD,MAAMC,KAAK,CAACpD,OAAQ8C,EAAgB9C,QAAS,IAAM,IAG9CqD,EAAgBF,MAAMC,KAAK,CAACpD,OAAQ2C,EAAgB3C,QAAS,IAClEmD,MAAMC,KAAK,CAACpD,OAAQ8C,EAAgB9C,QAAS,IAAM,KAGpD,IACC,IAAIsD,EAAiB,EACrBA,EAAiBX,EAAgB3C,SAC/BsD,EAEF,IACC,IAAIC,EAAiB,EACrBA,EAAiBT,EAAgB9C,SAC/BuD,EAGF,GAAIT,EAAgBS,KAAoBZ,EAAgBW,GAEvD,GAAuB,IAAnBA,EACHJ,EAAOI,GAAgBC,GAAkB,EACzCF,EAAcC,GAAgBC,GAAkB,CAACA,GACjDR,EAAUC,MAAQ,EAClBD,EAAUE,aAAe,CAACK,QAEpB,GACNJ,EAAOI,EAAiB,GACtBE,MAAM,EAAGD,GACTE,KAAMC,GAAUA,GACjB,CACD,MAEMC,EAAmB,GADxBT,EAAOI,EAAiB,GAAGC,EAAiB,IAAM,GAE7CK,EAAsB3B,EAC3BiB,EAAOI,EAAiB,GAAGE,MAAM,EAAGD,EAAiB,IAEhDM,EACL,GAAKN,EAAiBK,EAAoBxB,OAC1CwB,EAAoBzB,IAGrB,IAAI2B,EAAkBC,EAClBJ,EAAmBE,GACtBC,EAAmBH,EACnBI,EAA8BR,EAAiB,IAE/CO,EAAmBD,EACnBE,EAA8BH,EAAoBxB,OAGnDc,EAAOI,GAAgBC,GAAkBO,EACzCT,EAAcC,GAAgBC,GAAkB,IAC5CF,EAAcC,EAAiB,GAAGS,GACrCR,GAEGR,EAAUC,MAAQc,IACrBf,EAAUC,MAAQc,EAClBf,EAAUE,aAAe,IACrBI,EAAcC,GAAgBC,IAGpC,CAKH,GAAIR,EAAUE,aAAajD,QAAU2C,EAAgB3C,OAAQ,OAAO,KAEpE,GAAI+C,EAAUC,OAASL,EAAgB3C,QAAU0C,EAAY,KAAM,CAClE,MAAMsB,EAAU,GAchB,OAbAjB,EAAUE,aAAaZ,QAASE,IAG3ByB,EAAQhE,QAAUgE,EAAQA,EAAQhE,OAAS,GAAGiE,MAAQ1B,EACzDyB,EAAQA,EAAQhE,OAAS,GAAET,IAAA,GACvByE,EAAQA,EAAQhE,OAAS,GAAE,CAC9BiE,IAAK1B,EAAM,IAIZyB,EAAQE,KAAK,CAACC,MAAO5B,EAAK0B,IAAK1B,EAAM,MAGhC,CAACC,SAAQQ,MAAOD,EAAUC,MAAOgB,UACzC,CAAO,OAAO,IACf,E","sources":["webpack:///@babel/runtime/7.25.7/helpers/extends.js","webpack:///webpack/bootstrap","webpack:///webpack/runtime/compat get default export","webpack:///webpack/runtime/define property getters","webpack:///webpack/runtime/hasOwnProperty shorthand","webpack:///external module \"/uxasset/externals/sn-uxpage-presource/26.0.0/index.jsdbx\"","webpack:///@devsnc/fuzzy-search/29.0.1-polaris.19/src/constants/index.js","webpack:///@devsnc/fuzzy-search/29.0.1-polaris.19/src/filter/hasana.js","webpack:///@devsnc/fuzzy-search/29.0.1-polaris.19/src/index.js"],"sourcesContent":["function _extends() {\n  return module.exports = _extends = Object.assign ? Object.assign.bind() : function (n) {\n    for (var e = 1; e < arguments.length; e++) {\n      var t = arguments[e];\n      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n    }\n    return n;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports, _extends.apply(null, arguments);\n}\nmodule.exports = _extends, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","var x = y => { var x = {}; __webpack_require__.d(x, y); return x; }\nvar y = x => () => x\nconst __WEBPACK_NAMESPACE_OBJECT__ = x({ [\"getProperty\"]: () => {\n\t\t\t\t\tconst cjsModule = __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__.default && __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__.__esModule\n\t\t\t\t\tif (cjsModule && 'getProperty' === 'default') {\n\t\t\t\t\t\treturn __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"] && __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"][\"default\"] ? __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"][\"default\"] : __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"];\n\t\t\t\t\t} else if (cjsModule)  {\n\t\t\t\t\t\treturn __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"].getProperty;\n\t\t\t\t\t} else if ('getProperty' === 'default') {\n\t\t\t\t\t\treturn __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"] ? (__WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"][\"default\"] ? __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"][\"default\"] : __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"]) : __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__;\n\t\t\t\t\t}\n\t\t\t\t\treturn __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__.getProperty || __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"] && __WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__[\"default\"].getProperty;\n\t\t\t\t} });","export const SYS_PROPS = {\n\tUI: {\n\t\tNAV_FILTER_ACCURACY_SCORE: 'glide.ui.polaris.nav_filter_accuracy_score'\n\t}\n};\n","import {getProperty} from 'sn-uxpage-presource';\nimport {SYS_PROPS} from '../constants';\n\nconst maxAndIndex = (array) => {\n\tlet max = 0;\n\tlet index = 0;\n\tarray.forEach((number, idx) => {\n\t\tif (number >= max) {\n\t\t\tmax = number;\n\t\t\tindex = idx;\n\t\t}\n\t});\n\treturn {max, index};\n};\n\n/**\n * Performs a fuzzy search on a target string, ranking matches based on character sequence alignment.\n *\n * @param {string} search - The search term.\n * @param {string} target - The text to be searched.\n * @param {number} [threshold=75] - The minimum score required. Defaults to the value from `glide.ui.polaris.nav_filter_accuracy_score` or 75.\n * @returns {Object|null} An object with { search, score, matches } if a match is found, otherwise null.\n */\nexport function fuzzyFilter(\n\tsearch,\n\ttarget,\n\tthreshold = getProperty(SYS_PROPS.UI.NAV_FILTER_ACCURACY_SCORE, 75)\n) {\n\tconst searchLowerCase = search?.toLowerCase().trim();\n\tconst targetLowerCase = target?.toLowerCase();\n\tif (!search || !target) return null;\n\n\tconst bestMatch = {score: 0, matchIndices: []};\n\n\t//initalize the matrix\n\tconst matrix = Array.from({length: searchLowerCase.length}, () =>\n\t\tArray.from({length: targetLowerCase.length}, () => 0)\n\t);\n\n\tconst indicesMatrix = Array.from({length: searchLowerCase.length}, () =>\n\t\tArray.from({length: targetLowerCase.length}, () => [])\n\t);\n\n\tfor (\n\t\tlet searchIterator = 0;\n\t\tsearchIterator < searchLowerCase.length;\n\t\t++searchIterator\n\t) {\n\t\tfor (\n\t\t\tlet targetIterator = 0;\n\t\t\ttargetIterator < targetLowerCase.length;\n\t\t\t++targetIterator\n\t\t) {\n\t\t\t// when there is a match for the current letter in the search term, add its score\n\t\t\tif (targetLowerCase[targetIterator] === searchLowerCase[searchIterator]) {\n\t\t\t\t// for the first array its going to be one\n\t\t\t\tif (searchIterator === 0) {\n\t\t\t\t\tmatrix[searchIterator][targetIterator] = 1;\n\t\t\t\t\tindicesMatrix[searchIterator][targetIterator] = [targetIterator];\n\t\t\t\t\tbestMatch.score = 1;\n\t\t\t\t\tbestMatch.matchIndices = [searchIterator];\n\t\t\t\t\t// else if there is a match for the letter before it, do some maths\n\t\t\t\t} else if (\n\t\t\t\t\tmatrix[searchIterator - 1]\n\t\t\t\t\t\t.slice(0, targetIterator)\n\t\t\t\t\t\t.find((match) => match)\n\t\t\t\t) {\n\t\t\t\t\tconst previousIndexScore =\n\t\t\t\t\t\tmatrix[searchIterator - 1][targetIterator - 1] || 0;\n\t\t\t\t\tconst consecutiveScore = 1 + previousIndexScore;\n\t\t\t\t\tconst previousMaxAndIndex = maxAndIndex(\n\t\t\t\t\t\tmatrix[searchIterator - 1].slice(0, targetIterator - 1)\n\t\t\t\t\t);\n\t\t\t\t\tconst maxWithBefore =\n\t\t\t\t\t\t1 / (targetIterator - previousMaxAndIndex.index) +\n\t\t\t\t\t\tpreviousMaxAndIndex.max;\n\n\t\t\t\t\t// check which score is best\n\t\t\t\t\tlet bestCurrentScore, bestCurrentScoreTargetIndex;\n\t\t\t\t\tif (consecutiveScore > maxWithBefore) {\n\t\t\t\t\t\tbestCurrentScore = consecutiveScore;\n\t\t\t\t\t\tbestCurrentScoreTargetIndex = targetIterator - 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbestCurrentScore = maxWithBefore;\n\t\t\t\t\t\tbestCurrentScoreTargetIndex = previousMaxAndIndex.index;\n\t\t\t\t\t}\n\n\t\t\t\t\tmatrix[searchIterator][targetIterator] = bestCurrentScore;\n\t\t\t\t\tindicesMatrix[searchIterator][targetIterator] = [\n\t\t\t\t\t\t...indicesMatrix[searchIterator - 1][bestCurrentScoreTargetIndex],\n\t\t\t\t\t\ttargetIterator\n\t\t\t\t\t];\n\t\t\t\t\tif (bestMatch.score < bestCurrentScore) {\n\t\t\t\t\t\tbestMatch.score = bestCurrentScore;\n\t\t\t\t\t\tbestMatch.matchIndices = [\n\t\t\t\t\t\t\t...indicesMatrix[searchIterator][targetIterator]\n\t\t\t\t\t\t];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (bestMatch.matchIndices.length != searchLowerCase.length) return null;\n\n\tif (bestMatch.score >= searchLowerCase.length * (threshold / 100)) {\n\t\tconst matches = [];\n\t\tbestMatch.matchIndices.forEach((idx) => {\n\t\t\t// if item already exists in matches array, check if we should add to it to continue\n\t\t\t// the consecutive match or not\n\t\t\tif (matches.length && matches[matches.length - 1].end === idx) {\n\t\t\t\tmatches[matches.length - 1] = {\n\t\t\t\t\t...matches[matches.length - 1],\n\t\t\t\t\tend: idx + 1\n\t\t\t\t};\n\t\t\t\t// when its not consecutive, add a new entry to the matches array\n\t\t\t} else {\n\t\t\t\tmatches.push({start: idx, end: idx + 1});\n\t\t\t}\n\t\t});\n\t\treturn {search, score: bestMatch.score, matches};\n\t} else return null;\n}\n","// Filtering\nimport {fuzzyFilter} from './filter';\n\nexport default fuzzyFilter;\n"],"names":["_extends","module","exports","Object","assign","bind","n","e","arguments","length","t","r","hasOwnProperty","call","__esModule","apply","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","undefined","__webpack_modules__","getter","d","a","definition","key","o","defineProperty","enumerable","get","obj","prop","prototype","y","x","cjsModule","__WEBPACK_EXTERNAL_MODULE__uxasset_externals_sn_uxpage_presource_26_0_0_index_jsdbx_30963244__","default","getProperty","SYS_PROPS","NAV_FILTER_ACCURACY_SCORE","maxAndIndex","array","max","index","forEach","number","idx","search","target","threshold","searchLowerCase","toLowerCase","trim","targetLowerCase","bestMatch","score","matchIndices","matrix","Array","from","indicesMatrix","searchIterator","targetIterator","slice","find","match","consecutiveScore","previousMaxAndIndex","maxWithBefore","bestCurrentScore","bestCurrentScoreTargetIndex","matches","end","push","start"]}