@foxford/ui 2.39.0-beta-22709eb-20240820 → 2.39.0-beta-8d52b2b-20240822

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/ChevronDown/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/ChevronDown/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ChevronDown = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction ChevronDown(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M5.47 8.47a.75.75 0 0 1 1.06 0L12 13.94l5.47-5.47a.75.75 0 1 1 1.06 1.06l-6 6a.75.75 0 0 1-1.06 0l-6-6a.75.75 0 0 1 0-1.06Z', clipRule: 'evenodd' }) }));\n}\nexports.ChevronDown = ChevronDown;\nexports.default = ChevronDown;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","ChevronDown_1","value","ChevronDown_2","ChevronDown","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"8HACAA,OAAOC,eAAeC,cAAS,aAAc,CAAEC,OAAO,IACnC,IAAAC,cAAAF,cAAAG,iBAAG,EACtB,MAAMC,cAAgBC,WACtB,SAASF,YAAYG,GACjB,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,8HAA+HC,SAAU,aAC1W,CACAjB,cAAmBF,cAAAG,YAAGA,YACPH,cAAAoB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/Close/index.js

@@ -1,2 +0,0 @@
-'use strict';var index=require('../../../../../../../../_virtual/index3.js');function _interopDefault(e){return e&&e.__esModule?e:{default:e}}var require$$0__default=_interopDefault(require('react/jsx-runtime'));Object.defineProperty(index.__exports,"__esModule",{value:!0}),exports.Close=index.__exports.Close=void 0;const jsx_runtime_1=require$$0__default.default;function Close(e){const{color:t,size:r,...l}=e;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:r,height:r,viewBox:'0 0 24 24',fill:t,...l,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M5.47 5.47a.75.75 0 0 1 1.06 0L12 10.94l5.47-5.47a.75.75 0 1 1 1.06 1.06L13.06 12l5.47 5.47a.75.75 0 1 1-1.06 1.06L12 13.06l-5.47 5.47a.75.75 0 0 1-1.06-1.06L10.94 12 5.47 6.53a.75.75 0 0 1 0-1.06Z',clipRule:'evenodd'})})}exports.Close=index.__exports.Close=Close,index.__exports.default=Close;
-//# sourceMappingURL=index.js.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/Close/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/Close/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Close = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction Close(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M5.47 5.47a.75.75 0 0 1 1.06 0L12 10.94l5.47-5.47a.75.75 0 1 1 1.06 1.06L13.06 12l5.47 5.47a.75.75 0 1 1-1.06 1.06L12 13.06l-5.47 5.47a.75.75 0 0 1-1.06-1.06L10.94 12 5.47 6.53a.75.75 0 0 1 0-1.06Z', clipRule: 'evenodd' }) }));\n}\nexports.Close = Close;\nexports.default = Close;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","Close_1","value","Close_2","__exports","Close","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"oNACAA,OAAOC,eAAeC,MAAAA,UAAS,aAAc,CAAEC,OAAO,IACzCC,QAAAA,MAAAF,MAAAG,UAAAC,WAAG,EAChB,MAAMC,cAAgBC,oBAAAA,QACtB,SAASF,MAAMG,GACX,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,wMAAyMC,SAAU,aACpb,CACAlB,QAAAA,MAAaF,MAAAG,UAAAC,MAAGA,MACDJ,MAAAG,UAAAkB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/Close/index.mjs

@@ -1,2 +0,0 @@
-import{__exports as Close$1}from'../../../../../../../../_virtual/index3.mjs';import require$$0 from'react/jsx-runtime';Object.defineProperty(Close$1,"__esModule",{value:!0});var Close_2=Close$1.Close=void 0;const jsx_runtime_1=require$$0;function Close(e){const{color:o,size:l,...s}=e;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:l,height:l,viewBox:'0 0 24 24',fill:o,...s,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M5.47 5.47a.75.75 0 0 1 1.06 0L12 10.94l5.47-5.47a.75.75 0 1 1 1.06 1.06L13.06 12l5.47 5.47a.75.75 0 1 1-1.06 1.06L12 13.06l-5.47 5.47a.75.75 0 0 1-1.06-1.06L10.94 12 5.47 6.53a.75.75 0 0 1 0-1.06Z',clipRule:'evenodd'})})}Close_2=Close$1.Close=Close,Close$1.default=Close;export{Close_2 as Close};
-//# sourceMappingURL=index.mjs.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/Close/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/Close/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Close = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction Close(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M5.47 5.47a.75.75 0 0 1 1.06 0L12 10.94l5.47-5.47a.75.75 0 1 1 1.06 1.06L13.06 12l5.47 5.47a.75.75 0 1 1-1.06 1.06L12 13.06l-5.47 5.47a.75.75 0 0 1-1.06-1.06L10.94 12 5.47 6.53a.75.75 0 0 1 0-1.06Z', clipRule: 'evenodd' }) }));\n}\nexports.Close = Close;\nexports.default = Close;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","Close_1","value","Close_2","Close","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"wHACAA,OAAOC,eAAeC,QAAS,aAAc,CAAEC,OAAO,IACzC,IAAAC,QAAAF,QAAAG,WAAG,EAChB,MAAMC,cAAgBC,WACtB,SAASF,MAAMG,GACX,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,wMAAyMC,SAAU,aACpb,CACAjB,QAAaF,QAAAG,MAAGA,MACDH,QAAAoB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/CloseCirlceFill/index.js

@@ -1,2 +0,0 @@
-'use strict';var index=require('../../../../../../../../_virtual/index4.js');function _interopDefault(e){return e&&e.__esModule?e:{default:e}}var require$$0__default=_interopDefault(require('react/jsx-runtime'));Object.defineProperty(index.__exports,"__esModule",{value:!0}),exports.CloseCirlceFill=index.__exports.CloseCirlceFill=void 0;const jsx_runtime_1=require$$0__default.default;function CloseCirlceFill(e){const{color:l,size:i,...r}=e;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:i,height:i,viewBox:'0 0 24 24',fill:l,...r,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M22 12c0 5.523-4.477 10-10 10S2 17.523 2 12 6.477 2 12 2s10 4.477 10 10ZM9.707 8.293a1 1 0 0 0-1.414 1.414L10.586 12l-2.293 2.293a1 1 0 1 0 1.414 1.414L12 13.414l2.293 2.293a1 1 0 0 0 1.414-1.414L13.414 12l2.293-2.293a1 1 0 0 0-1.414-1.414L12 10.586 9.707 8.293Z',clipRule:'evenodd'})})}exports.CloseCirlceFill=index.__exports.CloseCirlceFill=CloseCirlceFill,index.__exports.default=CloseCirlceFill;
-//# sourceMappingURL=index.js.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/CloseCirlceFill/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/CloseCirlceFill/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CloseCirlceFill = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction CloseCirlceFill(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M22 12c0 5.523-4.477 10-10 10S2 17.523 2 12 6.477 2 12 2s10 4.477 10 10ZM9.707 8.293a1 1 0 0 0-1.414 1.414L10.586 12l-2.293 2.293a1 1 0 1 0 1.414 1.414L12 13.414l2.293 2.293a1 1 0 0 0 1.414-1.414L13.414 12l2.293-2.293a1 1 0 0 0-1.414-1.414L12 10.586 9.707 8.293Z', clipRule: 'evenodd' }) }));\n}\nexports.CloseCirlceFill = CloseCirlceFill;\nexports.default = CloseCirlceFill;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","CloseCirlceFill_1","value","CloseCirlceFill_2","__exports","CloseCirlceFill","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"oNACAA,OAAOC,eAAeC,MAAAA,UAAS,aAAc,CAAEC,OAAO,IAC/BC,QAAAA,gBAAAF,MAAAG,UAAAC,qBAAG,EAC1B,MAAMC,cAAgBC,oBAAAA,QACtB,SAASF,gBAAgBG,GACrB,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,yQAA0QC,SAAU,aACrf,CACAlB,QAAAA,gBAAuBF,MAAAG,UAAAC,gBAAGA,gBACXJ,MAAAG,UAAAkB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/CloseCirlceFill/index.mjs

@@ -1,2 +0,0 @@
-import{__exports as CloseCirlceFill$1}from'../../../../../../../../_virtual/index4.mjs';import require$$0 from'react/jsx-runtime';Object.defineProperty(CloseCirlceFill$1,"__esModule",{value:!0});var CloseCirlceFill_2=CloseCirlceFill$1.CloseCirlceFill=void 0;const jsx_runtime_1=require$$0;function CloseCirlceFill(l){const{color:e,size:i,...r}=l;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:i,height:i,viewBox:'0 0 24 24',fill:e,...r,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M22 12c0 5.523-4.477 10-10 10S2 17.523 2 12 6.477 2 12 2s10 4.477 10 10ZM9.707 8.293a1 1 0 0 0-1.414 1.414L10.586 12l-2.293 2.293a1 1 0 1 0 1.414 1.414L12 13.414l2.293 2.293a1 1 0 0 0 1.414-1.414L13.414 12l2.293-2.293a1 1 0 0 0-1.414-1.414L12 10.586 9.707 8.293Z',clipRule:'evenodd'})})}CloseCirlceFill_2=CloseCirlceFill$1.CloseCirlceFill=CloseCirlceFill,CloseCirlceFill$1.default=CloseCirlceFill;export{CloseCirlceFill_2 as CloseCirlceFill};
-//# sourceMappingURL=index.mjs.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/CloseCirlceFill/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/CloseCirlceFill/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CloseCirlceFill = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction CloseCirlceFill(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M22 12c0 5.523-4.477 10-10 10S2 17.523 2 12 6.477 2 12 2s10 4.477 10 10ZM9.707 8.293a1 1 0 0 0-1.414 1.414L10.586 12l-2.293 2.293a1 1 0 1 0 1.414 1.414L12 13.414l2.293 2.293a1 1 0 0 0 1.414-1.414L13.414 12l2.293-2.293a1 1 0 0 0-1.414-1.414L12 10.586 9.707 8.293Z', clipRule: 'evenodd' }) }));\n}\nexports.CloseCirlceFill = CloseCirlceFill;\nexports.default = CloseCirlceFill;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","CloseCirlceFill_1","value","CloseCirlceFill_2","CloseCirlceFill","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"kIACAA,OAAOC,eAAeC,kBAAS,aAAc,CAAEC,OAAO,IAC/B,IAAAC,kBAAAF,kBAAAG,qBAAG,EAC1B,MAAMC,cAAgBC,WACtB,SAASF,gBAAgBG,GACrB,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,yQAA0QC,SAAU,aACrf,CACAjB,kBAAuBF,kBAAAG,gBAAGA,gBACXH,kBAAAoB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/LoaderFill/index.js

@@ -1,2 +0,0 @@
-'use strict';var index=require('../../../../../../../../_virtual/index5.js');function _interopDefault(e){return e&&e.__esModule?e:{default:e}}var require$$0__default=_interopDefault(require('react/jsx-runtime'));Object.defineProperty(index.__exports,"__esModule",{value:!0}),exports.LoaderFill=index.__exports.LoaderFill=void 0;const jsx_runtime_1=require$$0__default.default;function LoaderFill(e){const{color:l,size:r,...a}=e;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:r,height:r,viewBox:'0 0 24 24',fill:l,...a,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M12 1.5A1.5 1.5 0 0 1 13.5 3v3a1.5 1.5 0 0 1-3 0V3A1.5 1.5 0 0 1 12 1.5Zm7.426 3.074a1.5 1.5 0 0 1 0 2.121l-2.121 2.122a1.5 1.5 0 1 1-2.121-2.122l2.12-2.12a1.5 1.5 0 0 1 2.122 0Zm-14.85.002a1.5 1.5 0 0 1 2.121 0L8.82 6.7A1.5 1.5 0 0 1 6.7 8.82L4.575 6.697a1.5 1.5 0 0 1 0-2.12ZM1.5 12A1.5 1.5 0 0 1 3 10.5h3a1.5 1.5 0 0 1 0 3H3A1.5 1.5 0 0 1 1.5 12Zm15 0a1.5 1.5 0 0 1 1.5-1.5h3a1.5 1.5 0 0 1 0 3h-3a1.5 1.5 0 0 1-1.5-1.5Zm-7.682 3.181a1.5 1.5 0 0 1 0 2.122l-2.123 2.123a1.5 1.5 0 1 1-2.12-2.121l2.122-2.123a1.5 1.5 0 0 1 2.121 0Zm6.364 0a1.5 1.5 0 0 1 2.12 0l2.122 2.122a1.5 1.5 0 1 1-2.121 2.12l-2.122-2.12a1.5 1.5 0 0 1 0-2.122ZM12 16.5a1.5 1.5 0 0 1 1.5 1.5v3a1.5 1.5 0 0 1-3 0v-3a1.5 1.5 0 0 1 1.5-1.5Z',clipRule:'evenodd'})})}exports.LoaderFill=index.__exports.LoaderFill=LoaderFill,index.__exports.default=LoaderFill;
-//# sourceMappingURL=index.js.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/LoaderFill/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/LoaderFill/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.LoaderFill = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction LoaderFill(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M12 1.5A1.5 1.5 0 0 1 13.5 3v3a1.5 1.5 0 0 1-3 0V3A1.5 1.5 0 0 1 12 1.5Zm7.426 3.074a1.5 1.5 0 0 1 0 2.121l-2.121 2.122a1.5 1.5 0 1 1-2.121-2.122l2.12-2.12a1.5 1.5 0 0 1 2.122 0Zm-14.85.002a1.5 1.5 0 0 1 2.121 0L8.82 6.7A1.5 1.5 0 0 1 6.7 8.82L4.575 6.697a1.5 1.5 0 0 1 0-2.12ZM1.5 12A1.5 1.5 0 0 1 3 10.5h3a1.5 1.5 0 0 1 0 3H3A1.5 1.5 0 0 1 1.5 12Zm15 0a1.5 1.5 0 0 1 1.5-1.5h3a1.5 1.5 0 0 1 0 3h-3a1.5 1.5 0 0 1-1.5-1.5Zm-7.682 3.181a1.5 1.5 0 0 1 0 2.122l-2.123 2.123a1.5 1.5 0 1 1-2.12-2.121l2.122-2.123a1.5 1.5 0 0 1 2.121 0Zm6.364 0a1.5 1.5 0 0 1 2.12 0l2.122 2.122a1.5 1.5 0 1 1-2.121 2.12l-2.122-2.12a1.5 1.5 0 0 1 0-2.122ZM12 16.5a1.5 1.5 0 0 1 1.5 1.5v3a1.5 1.5 0 0 1-3 0v-3a1.5 1.5 0 0 1 1.5-1.5Z', clipRule: 'evenodd' }) }));\n}\nexports.LoaderFill = LoaderFill;\nexports.default = LoaderFill;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","LoaderFill_1","value","LoaderFill_2","__exports","LoaderFill","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"oNACAA,OAAOC,eAAeC,MAAAA,UAAS,aAAc,CAAEC,OAAO,IACpCC,QAAAA,WAAAF,MAAAG,UAAAC,gBAAG,EACrB,MAAMC,cAAgBC,oBAAAA,QACtB,SAASF,WAAWG,GAChB,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,ssBAAusBC,SAAU,aACl7B,CACAlB,QAAAA,WAAkBF,MAAAG,UAAAC,WAAGA,WACNJ,MAAAG,UAAAkB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/LoaderFill/index.mjs

@@ -1,2 +0,0 @@
-import{__exports as LoaderFill$1}from'../../../../../../../../_virtual/index5.mjs';import require$$0 from'react/jsx-runtime';Object.defineProperty(LoaderFill$1,"__esModule",{value:!0});var LoaderFill_2=LoaderFill$1.LoaderFill=void 0;const jsx_runtime_1=require$$0;function LoaderFill(l){const{color:e,size:a,...r}=l;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:a,height:a,viewBox:'0 0 24 24',fill:e,...r,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M12 1.5A1.5 1.5 0 0 1 13.5 3v3a1.5 1.5 0 0 1-3 0V3A1.5 1.5 0 0 1 12 1.5Zm7.426 3.074a1.5 1.5 0 0 1 0 2.121l-2.121 2.122a1.5 1.5 0 1 1-2.121-2.122l2.12-2.12a1.5 1.5 0 0 1 2.122 0Zm-14.85.002a1.5 1.5 0 0 1 2.121 0L8.82 6.7A1.5 1.5 0 0 1 6.7 8.82L4.575 6.697a1.5 1.5 0 0 1 0-2.12ZM1.5 12A1.5 1.5 0 0 1 3 10.5h3a1.5 1.5 0 0 1 0 3H3A1.5 1.5 0 0 1 1.5 12Zm15 0a1.5 1.5 0 0 1 1.5-1.5h3a1.5 1.5 0 0 1 0 3h-3a1.5 1.5 0 0 1-1.5-1.5Zm-7.682 3.181a1.5 1.5 0 0 1 0 2.122l-2.123 2.123a1.5 1.5 0 1 1-2.12-2.121l2.122-2.123a1.5 1.5 0 0 1 2.121 0Zm6.364 0a1.5 1.5 0 0 1 2.12 0l2.122 2.122a1.5 1.5 0 1 1-2.121 2.12l-2.122-2.12a1.5 1.5 0 0 1 0-2.122ZM12 16.5a1.5 1.5 0 0 1 1.5 1.5v3a1.5 1.5 0 0 1-3 0v-3a1.5 1.5 0 0 1 1.5-1.5Z',clipRule:'evenodd'})})}LoaderFill_2=LoaderFill$1.LoaderFill=LoaderFill,LoaderFill$1.default=LoaderFill;export{LoaderFill_2 as LoaderFill};
-//# sourceMappingURL=index.mjs.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/LoaderFill/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/LoaderFill/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.LoaderFill = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction LoaderFill(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M12 1.5A1.5 1.5 0 0 1 13.5 3v3a1.5 1.5 0 0 1-3 0V3A1.5 1.5 0 0 1 12 1.5Zm7.426 3.074a1.5 1.5 0 0 1 0 2.121l-2.121 2.122a1.5 1.5 0 1 1-2.121-2.122l2.12-2.12a1.5 1.5 0 0 1 2.122 0Zm-14.85.002a1.5 1.5 0 0 1 2.121 0L8.82 6.7A1.5 1.5 0 0 1 6.7 8.82L4.575 6.697a1.5 1.5 0 0 1 0-2.12ZM1.5 12A1.5 1.5 0 0 1 3 10.5h3a1.5 1.5 0 0 1 0 3H3A1.5 1.5 0 0 1 1.5 12Zm15 0a1.5 1.5 0 0 1 1.5-1.5h3a1.5 1.5 0 0 1 0 3h-3a1.5 1.5 0 0 1-1.5-1.5Zm-7.682 3.181a1.5 1.5 0 0 1 0 2.122l-2.123 2.123a1.5 1.5 0 1 1-2.12-2.121l2.122-2.123a1.5 1.5 0 0 1 2.121 0Zm6.364 0a1.5 1.5 0 0 1 2.12 0l2.122 2.122a1.5 1.5 0 1 1-2.121 2.12l-2.122-2.12a1.5 1.5 0 0 1 0-2.122ZM12 16.5a1.5 1.5 0 0 1 1.5 1.5v3a1.5 1.5 0 0 1-3 0v-3a1.5 1.5 0 0 1 1.5-1.5Z', clipRule: 'evenodd' }) }));\n}\nexports.LoaderFill = LoaderFill;\nexports.default = LoaderFill;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","LoaderFill_1","value","LoaderFill_2","LoaderFill","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"6HACAA,OAAOC,eAAeC,aAAS,aAAc,CAAEC,OAAO,IACpC,IAAAC,aAAAF,aAAAG,gBAAG,EACrB,MAAMC,cAAgBC,WACtB,SAASF,WAAWG,GAChB,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,ssBAAusBC,SAAU,aACl7B,CACAjB,aAAkBF,aAAAG,WAAGA,WACNH,aAAAoB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/NotifFill/index.js

@@ -1,2 +0,0 @@
-'use strict';var index=require('../../../../../../../../_virtual/index6.js');function _interopDefault(e){return e&&e.__esModule?e:{default:e}}var require$$0__default=_interopDefault(require('react/jsx-runtime'));Object.defineProperty(index.__exports,"__esModule",{value:!0}),exports.NotifFill=index.__exports.NotifFill=void 0;const jsx_runtime_1=require$$0__default.default;function NotifFill(e){const{color:i,size:t,...l}=e;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:t,height:t,viewBox:'0 0 24 24',fill:i,...l,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M13 3a1 1 0 1 0-2 0v1.071c-1.299.186-2.52.732-3.483 1.587C6.307 6.735 5.6 8.221 5.6 9.8c0 1.812-.408 3.124-.905 4.058l-.01.017a73.322 73.322 0 0 0-.83 1.586c-.094.19-.176.364-.235.513-.03.073-.061.161-.085.254a1.225 1.225 0 0 0-.035.465c.014.108.046.347.19.586.144.24.34.38.429.444.157.111.313.16.39.18.093.025.182.04.256.05.147.019.32.029.498.035C5.62 18 6.12 18 6.747 18h10.505c.629 0 1.127 0 1.484-.012a5.37 5.37 0 0 0 .499-.035c.074-.01.163-.025.255-.05.077-.02.234-.069.39-.18.09-.064.286-.204.43-.444.144-.24.175-.478.19-.586a1.223 1.223 0 0 0-.035-.465 2.176 2.176 0 0 0-.085-.254 7.149 7.149 0 0 0-.235-.513 73.24 73.24 0 0 0-.831-1.586l-.01-.017c-.496-.934-.904-2.246-.904-4.058 0-1.579-.707-3.065-1.917-4.142-.963-.855-2.185-1.401-3.483-1.587V3Zm-2.985 16.25a1 1 0 1 0-1.323 1.5 4.991 4.991 0 0 0 3.312 1.252c1.269 0 2.43-.474 3.312-1.252a1 1 0 1 0-1.324-1.5 2.992 2.992 0 0 1-1.988.752 2.992 2.992 0 0 1-1.989-.752Z',clipRule:'evenodd'})})}exports.NotifFill=index.__exports.NotifFill=NotifFill,index.__exports.default=NotifFill;
-//# sourceMappingURL=index.js.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/NotifFill/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/NotifFill/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.NotifFill = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction NotifFill(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M13 3a1 1 0 1 0-2 0v1.071c-1.299.186-2.52.732-3.483 1.587C6.307 6.735 5.6 8.221 5.6 9.8c0 1.812-.408 3.124-.905 4.058l-.01.017a73.322 73.322 0 0 0-.83 1.586c-.094.19-.176.364-.235.513-.03.073-.061.161-.085.254a1.225 1.225 0 0 0-.035.465c.014.108.046.347.19.586.144.24.34.38.429.444.157.111.313.16.39.18.093.025.182.04.256.05.147.019.32.029.498.035C5.62 18 6.12 18 6.747 18h10.505c.629 0 1.127 0 1.484-.012a5.37 5.37 0 0 0 .499-.035c.074-.01.163-.025.255-.05.077-.02.234-.069.39-.18.09-.064.286-.204.43-.444.144-.24.175-.478.19-.586a1.223 1.223 0 0 0-.035-.465 2.176 2.176 0 0 0-.085-.254 7.149 7.149 0 0 0-.235-.513 73.24 73.24 0 0 0-.831-1.586l-.01-.017c-.496-.934-.904-2.246-.904-4.058 0-1.579-.707-3.065-1.917-4.142-.963-.855-2.185-1.401-3.483-1.587V3Zm-2.985 16.25a1 1 0 1 0-1.323 1.5 4.991 4.991 0 0 0 3.312 1.252c1.269 0 2.43-.474 3.312-1.252a1 1 0 1 0-1.324-1.5 2.992 2.992 0 0 1-1.988.752 2.992 2.992 0 0 1-1.989-.752Z', clipRule: 'evenodd' }) }));\n}\nexports.NotifFill = NotifFill;\nexports.default = NotifFill;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","NotifFill_1","value","NotifFill_2","__exports","NotifFill","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"oNACAA,OAAOC,eAAeC,MAAAA,UAAS,aAAc,CAAEC,OAAO,IACrCC,QAAAA,UAAAF,MAAAG,UAAAC,eAAG,EACpB,MAAMC,cAAgBC,oBAAAA,QACtB,SAASF,UAAUG,GACf,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,i6BAAk6BC,SAAU,aAC7oC,CACAlB,QAAAA,UAAiBF,MAAAG,UAAAC,UAAGA,UACLJ,MAAAG,UAAAkB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/NotifFill/index.mjs

@@ -1,2 +0,0 @@
-import{__exports as NotifFill$1}from'../../../../../../../../_virtual/index6.mjs';import require$$0 from'react/jsx-runtime';Object.defineProperty(NotifFill$1,"__esModule",{value:!0});var NotifFill_2=NotifFill$1.NotifFill=void 0;const jsx_runtime_1=require$$0;function NotifFill(i){const{color:l,size:t,...o}=i;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:t,height:t,viewBox:'0 0 24 24',fill:l,...o,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M13 3a1 1 0 1 0-2 0v1.071c-1.299.186-2.52.732-3.483 1.587C6.307 6.735 5.6 8.221 5.6 9.8c0 1.812-.408 3.124-.905 4.058l-.01.017a73.322 73.322 0 0 0-.83 1.586c-.094.19-.176.364-.235.513-.03.073-.061.161-.085.254a1.225 1.225 0 0 0-.035.465c.014.108.046.347.19.586.144.24.34.38.429.444.157.111.313.16.39.18.093.025.182.04.256.05.147.019.32.029.498.035C5.62 18 6.12 18 6.747 18h10.505c.629 0 1.127 0 1.484-.012a5.37 5.37 0 0 0 .499-.035c.074-.01.163-.025.255-.05.077-.02.234-.069.39-.18.09-.064.286-.204.43-.444.144-.24.175-.478.19-.586a1.223 1.223 0 0 0-.035-.465 2.176 2.176 0 0 0-.085-.254 7.149 7.149 0 0 0-.235-.513 73.24 73.24 0 0 0-.831-1.586l-.01-.017c-.496-.934-.904-2.246-.904-4.058 0-1.579-.707-3.065-1.917-4.142-.963-.855-2.185-1.401-3.483-1.587V3Zm-2.985 16.25a1 1 0 1 0-1.323 1.5 4.991 4.991 0 0 0 3.312 1.252c1.269 0 2.43-.474 3.312-1.252a1 1 0 1 0-1.324-1.5 2.992 2.992 0 0 1-1.988.752 2.992 2.992 0 0 1-1.989-.752Z',clipRule:'evenodd'})})}NotifFill_2=NotifFill$1.NotifFill=NotifFill,NotifFill$1.default=NotifFill;export{NotifFill_2 as NotifFill};
-//# sourceMappingURL=index.mjs.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/NotifFill/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/NotifFill/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.NotifFill = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction NotifFill(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M13 3a1 1 0 1 0-2 0v1.071c-1.299.186-2.52.732-3.483 1.587C6.307 6.735 5.6 8.221 5.6 9.8c0 1.812-.408 3.124-.905 4.058l-.01.017a73.322 73.322 0 0 0-.83 1.586c-.094.19-.176.364-.235.513-.03.073-.061.161-.085.254a1.225 1.225 0 0 0-.035.465c.014.108.046.347.19.586.144.24.34.38.429.444.157.111.313.16.39.18.093.025.182.04.256.05.147.019.32.029.498.035C5.62 18 6.12 18 6.747 18h10.505c.629 0 1.127 0 1.484-.012a5.37 5.37 0 0 0 .499-.035c.074-.01.163-.025.255-.05.077-.02.234-.069.39-.18.09-.064.286-.204.43-.444.144-.24.175-.478.19-.586a1.223 1.223 0 0 0-.035-.465 2.176 2.176 0 0 0-.085-.254 7.149 7.149 0 0 0-.235-.513 73.24 73.24 0 0 0-.831-1.586l-.01-.017c-.496-.934-.904-2.246-.904-4.058 0-1.579-.707-3.065-1.917-4.142-.963-.855-2.185-1.401-3.483-1.587V3Zm-2.985 16.25a1 1 0 1 0-1.323 1.5 4.991 4.991 0 0 0 3.312 1.252c1.269 0 2.43-.474 3.312-1.252a1 1 0 1 0-1.324-1.5 2.992 2.992 0 0 1-1.988.752 2.992 2.992 0 0 1-1.989-.752Z', clipRule: 'evenodd' }) }));\n}\nexports.NotifFill = NotifFill;\nexports.default = NotifFill;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","NotifFill_1","value","NotifFill_2","NotifFill","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"4HACAA,OAAOC,eAAeC,YAAS,aAAc,CAAEC,OAAO,IACrC,IAAAC,YAAAF,YAAAG,eAAG,EACpB,MAAMC,cAAgBC,WACtB,SAASF,UAAUG,GACf,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,i6BAAk6BC,SAAU,aAC7oC,CACAjB,YAAiBF,YAAAG,UAAGA,UACLH,YAAAoB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/WarningTriangleFill/index.js

@@ -1,2 +0,0 @@
-'use strict';var index=require('../../../../../../../../_virtual/index7.js');function _interopDefault(e){return e&&e.__esModule?e:{default:e}}var require$$0__default=_interopDefault(require('react/jsx-runtime'));Object.defineProperty(index.__exports,"__esModule",{value:!0}),exports.WarningTriangleFill=index.__exports.WarningTriangleFill=void 0;const jsx_runtime_1=require$$0__default.default;function WarningTriangleFill(e){const{color:i,size:r,...n}=e;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:r,height:r,viewBox:'0 0 24 24',fill:i,...n,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M13.135 2.995a2.75 2.75 0 0 0-2.27 0c-.494.224-.855.64-1.18 1.116-.322.473-.678 1.115-1.12 1.908l-4.598 8.278c-.419.753-.758 1.365-.98 1.867-.224.508-.38 1.014-.32 1.537a2.75 2.75 0 0 0 1.127 1.913c.427.308.946.417 1.498.468.547.05 1.246.05 2.109.05h9.198c.863 0 1.562 0 2.11-.05.551-.051 1.07-.16 1.497-.468a2.75 2.75 0 0 0 1.126-1.913c.061-.523-.095-1.03-.319-1.537-.222-.502-.561-1.114-.98-1.867l-4.599-8.278c-.44-.793-.797-1.435-1.12-1.908-.324-.476-.685-.892-1.179-1.116ZM13 9.382a1 1 0 1 0-2 0v4a1 1 0 1 0 2 0v-4Zm-1 6a1 1 0 0 0 0 2h.01a1 1 0 1 0 0-2H12Z',clipRule:'evenodd'})})}exports.WarningTriangleFill=index.__exports.WarningTriangleFill=WarningTriangleFill,index.__exports.default=WarningTriangleFill;
-//# sourceMappingURL=index.js.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/WarningTriangleFill/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/WarningTriangleFill/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WarningTriangleFill = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction WarningTriangleFill(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M13.135 2.995a2.75 2.75 0 0 0-2.27 0c-.494.224-.855.64-1.18 1.116-.322.473-.678 1.115-1.12 1.908l-4.598 8.278c-.419.753-.758 1.365-.98 1.867-.224.508-.38 1.014-.32 1.537a2.75 2.75 0 0 0 1.127 1.913c.427.308.946.417 1.498.468.547.05 1.246.05 2.109.05h9.198c.863 0 1.562 0 2.11-.05.551-.051 1.07-.16 1.497-.468a2.75 2.75 0 0 0 1.126-1.913c.061-.523-.095-1.03-.319-1.537-.222-.502-.561-1.114-.98-1.867l-4.599-8.278c-.44-.793-.797-1.435-1.12-1.908-.324-.476-.685-.892-1.179-1.116ZM13 9.382a1 1 0 1 0-2 0v4a1 1 0 1 0 2 0v-4Zm-1 6a1 1 0 0 0 0 2h.01a1 1 0 1 0 0-2H12Z', clipRule: 'evenodd' }) }));\n}\nexports.WarningTriangleFill = WarningTriangleFill;\nexports.default = WarningTriangleFill;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","WarningTriangleFill_1","value","WarningTriangleFill_2","__exports","WarningTriangleFill","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"oNACAA,OAAOC,eAAeC,MAAAA,UAAS,aAAc,CAAEC,OAAO,IAC3BC,QAAAA,oBAAAF,MAAAG,UAAAC,yBAAG,EAC9B,MAAMC,cAAgBC,oBAAAA,QACtB,SAASF,oBAAoBG,GACzB,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,mjBAAojBC,SAAU,aAC/xB,CACAlB,QAAAA,oBAA2BF,MAAAG,UAAAC,oBAAGA,oBACfJ,MAAAG,UAAAkB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/WarningTriangleFill/index.mjs

@@ -1,2 +0,0 @@
-import{__exports as WarningTriangleFill$1}from'../../../../../../../../_virtual/index7.mjs';import require$$0 from'react/jsx-runtime';Object.defineProperty(WarningTriangleFill$1,"__esModule",{value:!0});var WarningTriangleFill_2=WarningTriangleFill$1.WarningTriangleFill=void 0;const jsx_runtime_1=require$$0;function WarningTriangleFill(i){const{color:l,size:n,...r}=i;return(0,jsx_runtime_1.jsx)("svg",{xmlns:'http://www.w3.org/2000/svg',width:n,height:n,viewBox:'0 0 24 24',fill:l,...r,children:(0,jsx_runtime_1.jsx)("path",{fillRule:'evenodd',d:'M13.135 2.995a2.75 2.75 0 0 0-2.27 0c-.494.224-.855.64-1.18 1.116-.322.473-.678 1.115-1.12 1.908l-4.598 8.278c-.419.753-.758 1.365-.98 1.867-.224.508-.38 1.014-.32 1.537a2.75 2.75 0 0 0 1.127 1.913c.427.308.946.417 1.498.468.547.05 1.246.05 2.109.05h9.198c.863 0 1.562 0 2.11-.05.551-.051 1.07-.16 1.497-.468a2.75 2.75 0 0 0 1.126-1.913c.061-.523-.095-1.03-.319-1.537-.222-.502-.561-1.114-.98-1.867l-4.599-8.278c-.44-.793-.797-1.435-1.12-1.908-.324-.476-.685-.892-1.179-1.116ZM13 9.382a1 1 0 1 0-2 0v4a1 1 0 1 0 2 0v-4Zm-1 6a1 1 0 0 0 0 2h.01a1 1 0 1 0 0-2H12Z',clipRule:'evenodd'})})}WarningTriangleFill_2=WarningTriangleFill$1.WarningTriangleFill=WarningTriangleFill,WarningTriangleFill$1.default=WarningTriangleFill;export{WarningTriangleFill_2 as WarningTriangleFill};
-//# sourceMappingURL=index.mjs.map

package/external/.pnpm/@foxford_icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/WarningTriangleFill/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/@foxford+icon-pack@0.6.3_react-dom@18.3.1_react@18.3.1__react@18.3.1/node_modules/@foxford/icon-pack/icons/WarningTriangleFill/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WarningTriangleFill = void 0;\nconst jsx_runtime_1 = require(\"react/jsx-runtime\");\nfunction WarningTriangleFill(props) {\n    const { color, size, ...otherProps } = props;\n    return ((0, jsx_runtime_1.jsx)(\"svg\", { xmlns: 'http://www.w3.org/2000/svg', width: size, height: size, viewBox: '0 0 24 24', fill: color, ...otherProps, children: (0, jsx_runtime_1.jsx)(\"path\", { fillRule: 'evenodd', d: 'M13.135 2.995a2.75 2.75 0 0 0-2.27 0c-.494.224-.855.64-1.18 1.116-.322.473-.678 1.115-1.12 1.908l-4.598 8.278c-.419.753-.758 1.365-.98 1.867-.224.508-.38 1.014-.32 1.537a2.75 2.75 0 0 0 1.127 1.913c.427.308.946.417 1.498.468.547.05 1.246.05 2.109.05h9.198c.863 0 1.562 0 2.11-.05.551-.051 1.07-.16 1.497-.468a2.75 2.75 0 0 0 1.126-1.913c.061-.523-.095-1.03-.319-1.537-.222-.502-.561-1.114-.98-1.867l-4.599-8.278c-.44-.793-.797-1.435-1.12-1.908-.324-.476-.685-.892-1.179-1.116ZM13 9.382a1 1 0 1 0-2 0v4a1 1 0 1 0 2 0v-4Zm-1 6a1 1 0 0 0 0 2h.01a1 1 0 1 0 0-2H12Z', clipRule: 'evenodd' }) }));\n}\nexports.WarningTriangleFill = WarningTriangleFill;\nexports.default = WarningTriangleFill;\n//# sourceMappingURL=index.js.map"],"names":["Object","defineProperty","WarningTriangleFill_1","value","WarningTriangleFill_2","WarningTriangleFill","jsx_runtime_1","require$$0","props","color","size","otherProps","jsx","xmlns","width","height","viewBox","fill","children","fillRule","d","clipRule","default"],"mappings":"sIACAA,OAAOC,eAAeC,sBAAS,aAAc,CAAEC,OAAO,IAC3B,IAAAC,sBAAAF,sBAAAG,yBAAG,EAC9B,MAAMC,cAAgBC,WACtB,SAASF,oBAAoBG,GACzB,MAAMC,MAAEA,EAAKC,KAAEA,KAASC,GAAeH,EACvC,OAAQ,EAAIF,cAAcM,KAAK,MAAO,CAAEC,MAAO,6BAA8BC,MAAOJ,EAAMK,OAAQL,EAAMM,QAAS,YAAaC,KAAMR,KAAUE,EAAYO,UAAU,EAAIZ,cAAcM,KAAK,OAAQ,CAAEO,SAAU,UAAWC,EAAG,mjBAAojBC,SAAU,aAC/xB,CACAjB,sBAA2BF,sBAAAG,oBAAGA,oBACfH,sBAAAoB,QAAGjB","x_google_ignoreList":[0]}

package/external/.pnpm/fuse.js@7.0.0/node_modules/fuse.js/dist/fuse.js

@@ -1,2 +0,0 @@
-'use strict';function isArray(e){return Array.isArray?Array.isArray(e):getTag(e)==='[object Array]'}function isString(e){return typeof e=='string'}function isNumber(e){return typeof e=='number'}function isObject(e){return typeof e=='object'}function isDefined(e){return e!==void 0&&e!==null}function isBlank(e){return!e.trim().length}function getTag(e){return e==null?e===void 0?'[object Undefined]':'[object Null]':{}.toString.call(e)}Object.defineProperty(exports,'__esModule',{value:!0});const MISSING_KEY_PROPERTY=e=>`Missing ${e} property in key`;const INVALID_KEY_WEIGHT_VALUE=e=>`Property 'weight' in key '${e}' must be a positive integer`;const hasOwn={}.hasOwnProperty;class KeyStore{constructor(e){this._keys=[],this._keyMap={};let t=0;e.forEach((e=>{let s=createKey(e);this._keys.push(s),this._keyMap[s.id]=s,t+=s.weight})),this._keys.forEach((e=>{e.weight/=t}))}get(e){return this._keyMap[e]}keys(){return this._keys}toJSON(){return JSON.stringify(this._keys)}}function createKey(e){let t=null;let s=null;let n=null;let i=1;let r=null;if(isString(e)||isArray(e))n=e,t=createKeyPath(e),s=createKeyId(e);else{if(!hasOwn.call(e,'name'))throw new Error(MISSING_KEY_PROPERTY('name'));const c=e.name;if(n=c,hasOwn.call(e,'weight')&&(i=e.weight,i<=0))throw new Error(INVALID_KEY_WEIGHT_VALUE(c));t=createKeyPath(c),s=createKeyId(c),r=e.getFn}return{path:t,id:s,weight:i,src:n,getFn:r}}function createKeyPath(e){return isArray(e)?e:e.split('.')}function createKeyId(e){return isArray(e)?e.join('.'):e}var Config={isCaseSensitive:!1,includeScore:!1,keys:[],shouldSort:!0,sortFn:(e,t)=>e.score===t.score?e.idx<t.idx?-1:1:e.score<t.score?-1:1,includeMatches:!1,findAllMatches:!1,minMatchCharLength:1,location:0,threshold:.6,distance:100,useExtendedSearch:!1,getFn:(e,t)=>{let s=[];let n=!1;const deepGet=(e,t,i)=>{if(isDefined(e))if(t[i]){const r=e[t[i]];if(!isDefined(r))return;if(i===t.length-1&&(isString(r)||isNumber(r)||(e=>e===!0||e===!1||(e=>isObject(e)&&e!==null)(e)&&getTag(e)=='[object Boolean]')(r)))s.push((e=>e==null?'':(e=>{if(typeof e=='string')return e;let t=e+'';return t=='0'&&1/e==-1/0?'-0':t})(e))(r));else if(isArray(r)){n=!0;for(let e=0,s=r.length;e<s;e+=1)deepGet(r[e],t,i+1)}else t.length&&deepGet(r,t,i+1)}else s.push(e)};return deepGet(e,isString(t)?t.split('.'):t,0),n?s:s[0]},ignoreLocation:!1,ignoreFieldNorm:!1,fieldNormWeight:1};const SPACE=/[^ ]+/g;class FuseIndex{constructor({getFn:e=Config.getFn,fieldNormWeight:t=Config.fieldNormWeight}={}){this.norm=((e=1,t=3)=>{const s=new Map;const n=Math.pow(10,t);return{get(t){const i=t.match(SPACE).length;if(s.has(i))return s.get(i);const r=1/Math.pow(i,.5*e);const c=parseFloat(Math.round(r*n)/n);return s.set(i,c),c},clear(){s.clear()}}})(t,3),this.getFn=e,this.isCreated=!1,this.setIndexRecords()}setSources(e=[]){this.docs=e}setIndexRecords(e=[]){this.records=e}setKeys(e=[]){this.keys=e,this._keysMap={},e.forEach(((e,t)=>{this._keysMap[e.id]=t}))}create(){!this.isCreated&&this.docs.length&&(this.isCreated=!0,isString(this.docs[0])?this.docs.forEach(((e,t)=>{this._addString(e,t)})):this.docs.forEach(((e,t)=>{this._addObject(e,t)})),this.norm.clear())}add(e){const t=this.size();isString(e)?this._addString(e,t):this._addObject(e,t)}removeAt(e){this.records.splice(e,1);for(let t=e,s=this.size();t<s;t+=1)this.records[t].i-=1}getValueForItemAtKeyId(e,t){return e[this._keysMap[t]]}size(){return this.records.length}_addString(e,t){if(!isDefined(e)||isBlank(e))return;let s={v:e,i:t,n:this.norm.get(e)};this.records.push(s)}_addObject(e,t){let s={i:t,$:{}};this.keys.forEach(((t,n)=>{let i=t.getFn?t.getFn(e):this.getFn(e,t.path);if(isDefined(i))if(isArray(i)){let e=[];const t=[{nestedArrIndex:-1,value:i}];for(;t.length;){const{nestedArrIndex:s,value:n}=t.pop();if(isDefined(n))if(isString(n)&&!isBlank(n)){let t={v:n,i:s,n:this.norm.get(n)};e.push(t)}else isArray(n)&&n.forEach(((e,s)=>{t.push({nestedArrIndex:s,value:e})}))}s.$[n]=e}else if(isString(i)&&!isBlank(i)){let e={v:i,n:this.norm.get(i)};s.$[n]=e}})),this.records.push(s)}toJSON(){return{keys:this.keys,records:this.records}}}function createIndex(e,t,{getFn:s=Config.getFn,fieldNormWeight:n=Config.fieldNormWeight}={}){const i=new FuseIndex({getFn:s,fieldNormWeight:n});return i.setKeys(e.map(createKey)),i.setSources(t),i.create(),i}function computeScore$1(e,{errors:t=0,currentLocation:s=0,expectedLocation:n=0,distance:i=Config.distance,ignoreLocation:r=Config.ignoreLocation}={}){const c=t/e.length;if(r)return c;const o=Math.abs(n-s);return i?c+o/i:o?1:c}function createPatternAlphabet(e){let t={};for(let s=0,n=e.length;s<n;s+=1){const i=e.charAt(s);t[i]=(t[i]||0)|1<<n-s-1}return t}class BitapSearch{constructor(e,{location:t=Config.location,threshold:s=Config.threshold,distance:n=Config.distance,includeMatches:i=Config.includeMatches,findAllMatches:r=Config.findAllMatches,minMatchCharLength:c=Config.minMatchCharLength,isCaseSensitive:o=Config.isCaseSensitive,ignoreLocation:a=Config.ignoreLocation}={}){if(this.options={location:t,threshold:s,distance:n,includeMatches:i,findAllMatches:r,minMatchCharLength:c,isCaseSensitive:o,ignoreLocation:a},this.pattern=o?e:e.toLowerCase(),this.chunks=[],!this.pattern.length)return;const addChunk=(e,t)=>{this.chunks.push({pattern:e,alphabet:createPatternAlphabet(e),startIndex:t})};const h=this.pattern.length;if(h>32){let e=0;const t=h%32;const s=h-t;for(;e<s;)addChunk(this.pattern.substr(e,32),e),e+=32;if(t){const e=h-32;addChunk(this.pattern.substr(e),e)}}else addChunk(this.pattern,0)}searchIn(e){const{isCaseSensitive:t,includeMatches:s}=this.options;if(t||(e=e.toLowerCase()),this.pattern===e){let t={isMatch:!0,score:0};return s&&(t.indices=[[0,e.length-1]]),t}const{location:n,distance:i,threshold:r,findAllMatches:c,minMatchCharLength:o,ignoreLocation:a}=this.options;let h=[];let l=0;let u=!1;this.chunks.forEach((({pattern:t,alphabet:d,startIndex:g})=>{const{isMatch:f,score:p,indices:M}=((e,t,s,{location:n=Config.location,distance:i=Config.distance,threshold:r=Config.threshold,findAllMatches:c=Config.findAllMatches,minMatchCharLength:o=Config.minMatchCharLength,includeMatches:a=Config.includeMatches,ignoreLocation:h=Config.ignoreLocation}={})=>{if(t.length>32)throw new Error("Pattern length exceeds max of 32.");const l=t.length;const u=e.length;const d=Math.max(0,Math.min(n,u));let g=r;let f=d;const p=o>1||a;const M=p?Array(u):[];let m;for(;(m=e.indexOf(t,f))>-1;){let e=computeScore$1(t,{currentLocation:m,expectedLocation:d,distance:i,ignoreLocation:h});if(g=Math.min(e,g),f=m+l,p){let e=0;for(;e<l;)M[m+e]=1,e+=1}}f=-1;let x=[];let y=1;let C=l+u;const S=1<<l-1;for(let n=0;n<l;n+=1){let r=0;let o=C;for(;r<o;)computeScore$1(t,{errors:n,currentLocation:d+o,expectedLocation:d,distance:i,ignoreLocation:h})<=g?r=o:C=o,o=Math.floor((C-r)/2+r);C=o;let a=Math.max(1,d-o+1);let m=c?u:Math.min(d+o,u)+l;let L=Array(m+2);L[m+1]=(1<<n)-1;for(let r=m;r>=a;r-=1){let c=r-1;let o=s[e.charAt(c)];if(p&&(M[c]=+!!o),L[r]=(L[r+1]<<1|1)&o,n&&(L[r]|=(x[r+1]|x[r])<<1|1|x[r+1]),L[r]&S&&(y=computeScore$1(t,{errors:n,currentLocation:c,expectedLocation:d,distance:i,ignoreLocation:h}),y<=g)){if(g=y,f=c,f<=d)break;a=Math.max(1,2*d-f)}}if(computeScore$1(t,{errors:n+1,currentLocation:d,expectedLocation:d,distance:i,ignoreLocation:h})>g)break;x=L}const L={isMatch:f>=0,score:Math.max(.001,y)};if(p){const e=((e=[],t=Config.minMatchCharLength)=>{let s=[];let n=-1;let i=-1;let r=0;for(let c=e.length;r<c;r+=1){let c=e[r];c&&n===-1?n=r:c||n===-1||(i=r-1,i-n+1>=t&&s.push([n,i]),n=-1)}return e[r-1]&&r-n>=t&&s.push([n,r-1]),s})(M,o);e.length?a&&(L.indices=e):L.isMatch=!1}return L})(e,t,d,{location:n+g,distance:i,threshold:r,findAllMatches:c,minMatchCharLength:o,includeMatches:s,ignoreLocation:a});f&&(u=!0),l+=p,f&&M&&(h=[...h,...M])}));let d={isMatch:u,score:u?l/this.chunks.length:1};return u&&s&&(d.indices=h),d}}class BaseMatch{constructor(e){this.pattern=e}static isMultiMatch(e){return getMatch(e,this.multiRegex)}static isSingleMatch(e){return getMatch(e,this.singleRegex)}search(){}}function getMatch(e,t){const s=e.match(t);return s?s[1]:null}class FuzzyMatch extends BaseMatch{constructor(e,{location:t=Config.location,threshold:s=Config.threshold,distance:n=Config.distance,includeMatches:i=Config.includeMatches,findAllMatches:r=Config.findAllMatches,minMatchCharLength:c=Config.minMatchCharLength,isCaseSensitive:o=Config.isCaseSensitive,ignoreLocation:a=Config.ignoreLocation}={}){super(e),this._bitapSearch=new BitapSearch(e,{location:t,threshold:s,distance:n,includeMatches:i,findAllMatches:r,minMatchCharLength:c,isCaseSensitive:o,ignoreLocation:a})}static get type(){return'fuzzy'}static get multiRegex(){return/^"(.*)"$/}static get singleRegex(){return/^(.*)$/}search(e){return this._bitapSearch.searchIn(e)}}class IncludeMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'include'}static get multiRegex(){return/^'"(.*)"$/}static get singleRegex(){return/^'(.*)$/}search(e){let t=0;let s;const n=[];const i=this.pattern.length;for(;(s=e.indexOf(this.pattern,t))>-1;)t=s+i,n.push([s,t-1]);const r=!!n.length;return{isMatch:r,score:r?0:1,indices:n}}}const searchers=[class ExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'exact'}static get multiRegex(){return/^="(.*)"$/}static get singleRegex(){return/^=(.*)$/}search(e){const t=e===this.pattern;return{isMatch:t,score:t?0:1,indices:[0,this.pattern.length-1]}}},IncludeMatch,class PrefixExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'prefix-exact'}static get multiRegex(){return/^\^"(.*)"$/}static get singleRegex(){return/^\^(.*)$/}search(e){const t=e.startsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,this.pattern.length-1]}}},class InversePrefixExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'inverse-prefix-exact'}static get multiRegex(){return/^!\^"(.*)"$/}static get singleRegex(){return/^!\^(.*)$/}search(e){const t=!e.startsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},class InverseSuffixExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'inverse-suffix-exact'}static get multiRegex(){return/^!"(.*)"\$$/}static get singleRegex(){return/^!(.*)\$$/}search(e){const t=!e.endsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},class SuffixExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'suffix-exact'}static get multiRegex(){return/^"(.*)"\$$/}static get singleRegex(){return/^(.*)\$$/}search(e){const t=e.endsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[e.length-this.pattern.length,e.length-1]}}},class InverseExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'inverse-exact'}static get multiRegex(){return/^!"(.*)"$/}static get singleRegex(){return/^!(.*)$/}search(e){const t=e.indexOf(this.pattern)===-1;return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},FuzzyMatch];const searchersLen=searchers.length;const SPACE_RE=/ +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/;const MultiMatchSet=new Set([FuzzyMatch.type,IncludeMatch.type]);const registeredSearchers=[];function createSearcher(e,t){for(let s=0,n=registeredSearchers.length;s<n;s+=1){let n=registeredSearchers[s];if(n.condition(e,t))return new n(e,t)}return new BitapSearch(e,t)}const LogicalOperator_AND='$and';const isExpression=e=>!(!e.$and&&!e.$or);const convertToExplicit=e=>({[LogicalOperator_AND]:Object.keys(e).map((t=>({[t]:e[t]})))});function parse(e,t,{auto:s=!0}={}){const next=e=>{let n=Object.keys(e);const i=(e=>!!e.$path)(e);if(!i&&n.length>1&&!isExpression(e))return next(convertToExplicit(e));if((e=>!isArray(e)&&isObject(e)&&!isExpression(e))(e)){const r=i?e.$path:n[0];const c=i?e.$val:e[r];if(!isString(c))throw new Error((e=>`Invalid value for key ${e}`)(r));const o={keyId:createKeyId(r),pattern:c};return s&&(o.searcher=createSearcher(c,t)),o}let r={children:[],operator:n[0]};return n.forEach((t=>{const s=e[t];isArray(s)&&s.forEach((e=>{r.children.push(next(e))}))})),r};return isExpression(e)||(e=convertToExplicit(e)),next(e)}function transformMatches(e,t){const s=e.matches;t.matches=[],isDefined(s)&&s.forEach((e=>{if(!isDefined(e.indices)||!e.indices.length)return;const{indices:s,value:n}=e;let i={indices:s,value:n};e.key&&(i.key=e.key.src),e.idx>-1&&(i.refIndex=e.idx),t.matches.push(i)}))}function transformScore(e,t){t.score=e.score}class Fuse{constructor(e,t={},s){this.options={...Config,...t},this._keyStore=new KeyStore(this.options.keys),this.setCollection(e,s)}setCollection(e,t){if(this._docs=e,t&&!(t instanceof FuseIndex))throw new Error("Incorrect 'index' type");this._myIndex=t||createIndex(this.options.keys,this._docs,{getFn:this.options.getFn,fieldNormWeight:this.options.fieldNormWeight})}add(e){isDefined(e)&&(this._docs.push(e),this._myIndex.add(e))}remove(e=()=>!1){const t=[];for(let s=0,n=this._docs.length;s<n;s+=1){const i=this._docs[s];e(i,s)&&(this.removeAt(s),s-=1,n-=1,t.push(i))}return t}removeAt(e){this._docs.splice(e,1),this._myIndex.removeAt(e)}getIndex(){return this._myIndex}search(e,{limit:t=-1}={}){const{includeMatches:s,includeScore:n,shouldSort:i,sortFn:r,ignoreFieldNorm:c}=this.options;let o=isString(e)?isString(this._docs[0])?this._searchStringList(e):this._searchObjectList(e):this._searchLogical(e);return((e,{ignoreFieldNorm:t=Config.ignoreFieldNorm})=>{e.forEach((e=>{let s=1;e.matches.forEach((({key:e,norm:n,score:i})=>{const r=e?e.weight:null;s*=Math.pow(i===0&&r?Number.EPSILON:i,(r||1)*(t?1:n))})),e.score=s}))})(o,{ignoreFieldNorm:c}),i&&o.sort(r),isNumber(t)&&t>-1&&(o=o.slice(0,t)),((e,t,{includeMatches:s=Config.includeMatches,includeScore:n=Config.includeScore}={})=>{const i=[];return s&&i.push(transformMatches),n&&i.push(transformScore),e.map((e=>{const{idx:s}=e;const n={item:t[s],refIndex:s};return i.length&&i.forEach((t=>{t(e,n)})),n}))})(o,this._docs,{includeMatches:s,includeScore:n})}_searchStringList(e){const t=createSearcher(e,this.options);const{records:s}=this._myIndex;const n=[];return s.forEach((({v:e,i:s,n:i})=>{if(!isDefined(e))return;const{isMatch:r,score:c,indices:o}=t.searchIn(e);r&&n.push({item:e,idx:s,matches:[{score:c,value:e,norm:i,indices:o}]})})),n}_searchLogical(e){const t=parse(e,this.options);const evaluate=(e,t,s)=>{if(!e.children){const{keyId:n,searcher:i}=e;const r=this._findMatches({key:this._keyStore.get(n),value:this._myIndex.getValueForItemAtKeyId(t,n),searcher:i});return r&&r.length?[{idx:s,item:t,matches:r}]:[]}const n=[];for(let i=0,r=e.children.length;i<r;i+=1){const r=evaluate(e.children[i],t,s);if(r.length)n.push(...r);else if(e.operator==="$and")return[]}return n};const s={};const n=[];return this._myIndex.records.forEach((({$:e,i})=>{if(isDefined(e)){let r=evaluate(t,e,i);r.length&&(s[i]||(s[i]={idx:i,item:e,matches:[]},n.push(s[i])),r.forEach((({matches:e})=>{s[i].matches.push(...e)})))}})),n}_searchObjectList(e){const t=createSearcher(e,this.options);const{keys:s,records:n}=this._myIndex;const i=[];return n.forEach((({$:e,i:n})=>{if(!isDefined(e))return;let r=[];s.forEach(((s,n)=>{r.push(...this._findMatches({key:s,value:e[n],searcher:t}))})),r.length&&i.push({idx:n,item:e,matches:r})})),i}_findMatches({key:e,value:t,searcher:s}){if(!isDefined(t))return[];let n=[];if(isArray(t))t.forEach((({v:t,i,n:r})=>{if(!isDefined(t))return;const{isMatch:c,score:o,indices:a}=s.searchIn(t);c&&n.push({score:o,key:e,value:t,idx:i,norm:r,indices:a})}));else{const{v:i,n:r}=t;const{isMatch:c,score:o,indices:a}=s.searchIn(i);c&&n.push({score:o,key:e,value:i,norm:r,indices:a})}return n}}Fuse.version='7.0.0',Fuse.createIndex=createIndex,Fuse.parseIndex=(e,{getFn:t=Config.getFn,fieldNormWeight:s=Config.fieldNormWeight}={})=>{const{keys:n,records:i}=e;const r=new FuseIndex({getFn:t,fieldNormWeight:s});return r.setKeys(n),r.setIndexRecords(i),r},Fuse.config=Config,Fuse.parseQuery=parse,registeredSearchers.push(class ExtendedSearch{constructor(e,{isCaseSensitive:t=Config.isCaseSensitive,includeMatches:s=Config.includeMatches,minMatchCharLength:n=Config.minMatchCharLength,ignoreLocation:i=Config.ignoreLocation,findAllMatches:r=Config.findAllMatches,location:c=Config.location,threshold:o=Config.threshold,distance:a=Config.distance}={}){this.query=null,this.options={isCaseSensitive:t,includeMatches:s,minMatchCharLength:n,findAllMatches:r,ignoreLocation:i,location:c,threshold:o,distance:a},this.pattern=t?e:e.toLowerCase(),this.query=((e,t={})=>this.pattern.split("|").map((e=>{let s=e.trim().split(SPACE_RE).filter((e=>e&&!!e.trim()));let n=[];for(let e=0,i=s.length;e<i;e+=1){const i=s[e];let r=!1;let c=-1;for(;!r&&++c<searchersLen;){const e=searchers[c];let s=e.isMultiMatch(i);s&&(n.push(new e(s,t)),r=!0)}if(!r)for(c=-1;++c<searchersLen;){const e=searchers[c];let s=e.isSingleMatch(i);if(s){n.push(new e(s,t));break}}}return n})))(0,this.options)}static condition(e,t){return t.useExtendedSearch}searchIn(e){const t=this.query;if(!t)return{isMatch:!1,score:1};const{includeMatches:s,isCaseSensitive:n}=this.options;e=n?e:e.toLowerCase();let i=0;let r=[];let c=0;for(let n=0,o=t.length;n<o;n+=1){const o=t[n];r.length=0,i=0;for(let t=0,n=o.length;t<n;t+=1){const n=o[t];const{isMatch:a,indices:h,score:l}=n.search(e);if(!a){c=0,i=0,r.length=0;break}i+=1,c+=l,s&&(MultiMatchSet.has(n.constructor.type)?r=[...r,...h]:r.push(h))}if(i){let e={isMatch:!0,score:c/i};return s&&(e.indices=r),e}}return{isMatch:!1,score:1}}}),exports.default=Fuse;
-//# sourceMappingURL=fuse.js.map

package/external/.pnpm/fuse.js@7.0.0/node_modules/fuse.js/dist/fuse.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fuse.js","sources":["../../../../../../../../node_modules/.pnpm/fuse.js@7.0.0/node_modules/fuse.js/dist/fuse.mjs"],"sourcesContent":["/**\n * Fuse.js v7.0.0 - Lightweight fuzzy-search (http://fusejs.io)\n *\n * Copyright (c) 2023 Kiro Risk (http://kiro.me)\n * All Rights Reserved. Apache Software License 2.0\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n */\n\nfunction isArray(value) {\n  return !Array.isArray\n    ? getTag(value) === '[object Array]'\n    : Array.isArray(value)\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/baseToString.js\nconst INFINITY = 1 / 0;\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  let result = value + '';\n  return result == '0' && 1 / value == -INFINITY ? '-0' : result\n}\n\nfunction toString(value) {\n  return value == null ? '' : baseToString(value)\n}\n\nfunction isString(value) {\n  return typeof value === 'string'\n}\n\nfunction isNumber(value) {\n  return typeof value === 'number'\n}\n\n// Adapted from: https://github.com/lodash/lodash/blob/master/isBoolean.js\nfunction isBoolean(value) {\n  return (\n    value === true ||\n    value === false ||\n    (isObjectLike(value) && getTag(value) == '[object Boolean]')\n  )\n}\n\nfunction isObject(value) {\n  return typeof value === 'object'\n}\n\n// Checks if `value` is object-like.\nfunction isObjectLike(value) {\n  return isObject(value) && value !== null\n}\n\nfunction isDefined(value) {\n  return value !== undefined && value !== null\n}\n\nfunction isBlank(value) {\n  return !value.trim().length\n}\n\n// Gets the `toStringTag` of `value`.\n// Adapted from: https://github.com/lodash/lodash/blob/master/.internal/getTag.js\nfunction getTag(value) {\n  return value == null\n    ? value === undefined\n      ? '[object Undefined]'\n      : '[object Null]'\n    : Object.prototype.toString.call(value)\n}\n\nconst EXTENDED_SEARCH_UNAVAILABLE = 'Extended search is not available';\n\nconst INCORRECT_INDEX_TYPE = \"Incorrect 'index' type\";\n\nconst LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY = (key) =>\n  `Invalid value for key ${key}`;\n\nconst PATTERN_LENGTH_TOO_LARGE = (max) =>\n  `Pattern length exceeds max of ${max}.`;\n\nconst MISSING_KEY_PROPERTY = (name) => `Missing ${name} property in key`;\n\nconst INVALID_KEY_WEIGHT_VALUE = (key) =>\n  `Property 'weight' in key '${key}' must be a positive integer`;\n\nconst hasOwn = Object.prototype.hasOwnProperty;\n\nclass KeyStore {\n  constructor(keys) {\n    this._keys = [];\n    this._keyMap = {};\n\n    let totalWeight = 0;\n\n    keys.forEach((key) => {\n      let obj = createKey(key);\n\n      this._keys.push(obj);\n      this._keyMap[obj.id] = obj;\n\n      totalWeight += obj.weight;\n    });\n\n    // Normalize weights so that their sum is equal to 1\n    this._keys.forEach((key) => {\n      key.weight /= totalWeight;\n    });\n  }\n  get(keyId) {\n    return this._keyMap[keyId]\n  }\n  keys() {\n    return this._keys\n  }\n  toJSON() {\n    return JSON.stringify(this._keys)\n  }\n}\n\nfunction createKey(key) {\n  let path = null;\n  let id = null;\n  let src = null;\n  let weight = 1;\n  let getFn = null;\n\n  if (isString(key) || isArray(key)) {\n    src = key;\n    path = createKeyPath(key);\n    id = createKeyId(key);\n  } else {\n    if (!hasOwn.call(key, 'name')) {\n      throw new Error(MISSING_KEY_PROPERTY('name'))\n    }\n\n    const name = key.name;\n    src = name;\n\n    if (hasOwn.call(key, 'weight')) {\n      weight = key.weight;\n\n      if (weight <= 0) {\n        throw new Error(INVALID_KEY_WEIGHT_VALUE(name))\n      }\n    }\n\n    path = createKeyPath(name);\n    id = createKeyId(name);\n    getFn = key.getFn;\n  }\n\n  return { path, id, weight, src, getFn }\n}\n\nfunction createKeyPath(key) {\n  return isArray(key) ? key : key.split('.')\n}\n\nfunction createKeyId(key) {\n  return isArray(key) ? key.join('.') : key\n}\n\nfunction get(obj, path) {\n  let list = [];\n  let arr = false;\n\n  const deepGet = (obj, path, index) => {\n    if (!isDefined(obj)) {\n      return\n    }\n    if (!path[index]) {\n      // If there's no path left, we've arrived at the object we care about.\n      list.push(obj);\n    } else {\n      let key = path[index];\n\n      const value = obj[key];\n\n      if (!isDefined(value)) {\n        return\n      }\n\n      // If we're at the last value in the path, and if it's a string/number/bool,\n      // add it to the list\n      if (\n        index === path.length - 1 &&\n        (isString(value) || isNumber(value) || isBoolean(value))\n      ) {\n        list.push(toString(value));\n      } else if (isArray(value)) {\n        arr = true;\n        // Search each item in the array.\n        for (let i = 0, len = value.length; i < len; i += 1) {\n          deepGet(value[i], path, index + 1);\n        }\n      } else if (path.length) {\n        // An object. Recurse further.\n        deepGet(value, path, index + 1);\n      }\n    }\n  };\n\n  // Backwards compatibility (since path used to be a string)\n  deepGet(obj, isString(path) ? path.split('.') : path, 0);\n\n  return arr ? list : list[0]\n}\n\nconst MatchOptions = {\n  // Whether the matches should be included in the result set. When `true`, each record in the result\n  // set will include the indices of the matched characters.\n  // These can consequently be used for highlighting purposes.\n  includeMatches: false,\n  // When `true`, the matching function will continue to the end of a search pattern even if\n  // a perfect match has already been located in the string.\n  findAllMatches: false,\n  // Minimum number of characters that must be matched before a result is considered a match\n  minMatchCharLength: 1\n};\n\nconst BasicOptions = {\n  // When `true`, the algorithm continues searching to the end of the input even if a perfect\n  // match is found before the end of the same input.\n  isCaseSensitive: false,\n  // When true, the matching function will continue to the end of a search pattern even if\n  includeScore: false,\n  // List of properties that will be searched. This also supports nested properties.\n  keys: [],\n  // Whether to sort the result list, by score\n  shouldSort: true,\n  // Default sort function: sort by ascending score, ascending index\n  sortFn: (a, b) =>\n    a.score === b.score ? (a.idx < b.idx ? -1 : 1) : a.score < b.score ? -1 : 1\n};\n\nconst FuzzyOptions = {\n  // Approximately where in the text is the pattern expected to be found?\n  location: 0,\n  // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match\n  // (of both letters and location), a threshold of '1.0' would match anything.\n  threshold: 0.6,\n  // Determines how close the match must be to the fuzzy location (specified above).\n  // An exact letter match which is 'distance' characters away from the fuzzy location\n  // would score as a complete mismatch. A distance of '0' requires the match be at\n  // the exact location specified, a threshold of '1000' would require a perfect match\n  // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.\n  distance: 100\n};\n\nconst AdvancedOptions = {\n  // When `true`, it enables the use of unix-like search commands\n  useExtendedSearch: false,\n  // The get function to use when fetching an object's properties.\n  // The default will search nested paths *ie foo.bar.baz*\n  getFn: get,\n  // When `true`, search will ignore `location` and `distance`, so it won't matter\n  // where in the string the pattern appears.\n  // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score\n  ignoreLocation: false,\n  // When `true`, the calculation for the relevance score (used for sorting) will\n  // ignore the field-length norm.\n  // More info: https://fusejs.io/concepts/scoring-theory.html#field-length-norm\n  ignoreFieldNorm: false,\n  // The weight to determine how much field length norm effects scoring.\n  fieldNormWeight: 1\n};\n\nvar Config = {\n  ...BasicOptions,\n  ...MatchOptions,\n  ...FuzzyOptions,\n  ...AdvancedOptions\n};\n\nconst SPACE = /[^ ]+/g;\n\n// Field-length norm: the shorter the field, the higher the weight.\n// Set to 3 decimals to reduce index size.\nfunction norm(weight = 1, mantissa = 3) {\n  const cache = new Map();\n  const m = Math.pow(10, mantissa);\n\n  return {\n    get(value) {\n      const numTokens = value.match(SPACE).length;\n\n      if (cache.has(numTokens)) {\n        return cache.get(numTokens)\n      }\n\n      // Default function is 1/sqrt(x), weight makes that variable\n      const norm = 1 / Math.pow(numTokens, 0.5 * weight);\n\n      // In place of `toFixed(mantissa)`, for faster computation\n      const n = parseFloat(Math.round(norm * m) / m);\n\n      cache.set(numTokens, n);\n\n      return n\n    },\n    clear() {\n      cache.clear();\n    }\n  }\n}\n\nclass FuseIndex {\n  constructor({\n    getFn = Config.getFn,\n    fieldNormWeight = Config.fieldNormWeight\n  } = {}) {\n    this.norm = norm(fieldNormWeight, 3);\n    this.getFn = getFn;\n    this.isCreated = false;\n\n    this.setIndexRecords();\n  }\n  setSources(docs = []) {\n    this.docs = docs;\n  }\n  setIndexRecords(records = []) {\n    this.records = records;\n  }\n  setKeys(keys = []) {\n    this.keys = keys;\n    this._keysMap = {};\n    keys.forEach((key, idx) => {\n      this._keysMap[key.id] = idx;\n    });\n  }\n  create() {\n    if (this.isCreated || !this.docs.length) {\n      return\n    }\n\n    this.isCreated = true;\n\n    // List is Array<String>\n    if (isString(this.docs[0])) {\n      this.docs.forEach((doc, docIndex) => {\n        this._addString(doc, docIndex);\n      });\n    } else {\n      // List is Array<Object>\n      this.docs.forEach((doc, docIndex) => {\n        this._addObject(doc, docIndex);\n      });\n    }\n\n    this.norm.clear();\n  }\n  // Adds a doc to the end of the index\n  add(doc) {\n    const idx = this.size();\n\n    if (isString(doc)) {\n      this._addString(doc, idx);\n    } else {\n      this._addObject(doc, idx);\n    }\n  }\n  // Removes the doc at the specified index of the index\n  removeAt(idx) {\n    this.records.splice(idx, 1);\n\n    // Change ref index of every subsquent doc\n    for (let i = idx, len = this.size(); i < len; i += 1) {\n      this.records[i].i -= 1;\n    }\n  }\n  getValueForItemAtKeyId(item, keyId) {\n    return item[this._keysMap[keyId]]\n  }\n  size() {\n    return this.records.length\n  }\n  _addString(doc, docIndex) {\n    if (!isDefined(doc) || isBlank(doc)) {\n      return\n    }\n\n    let record = {\n      v: doc,\n      i: docIndex,\n      n: this.norm.get(doc)\n    };\n\n    this.records.push(record);\n  }\n  _addObject(doc, docIndex) {\n    let record = { i: docIndex, $: {} };\n\n    // Iterate over every key (i.e, path), and fetch the value at that key\n    this.keys.forEach((key, keyIndex) => {\n      let value = key.getFn ? key.getFn(doc) : this.getFn(doc, key.path);\n\n      if (!isDefined(value)) {\n        return\n      }\n\n      if (isArray(value)) {\n        let subRecords = [];\n        const stack = [{ nestedArrIndex: -1, value }];\n\n        while (stack.length) {\n          const { nestedArrIndex, value } = stack.pop();\n\n          if (!isDefined(value)) {\n            continue\n          }\n\n          if (isString(value) && !isBlank(value)) {\n            let subRecord = {\n              v: value,\n              i: nestedArrIndex,\n              n: this.norm.get(value)\n            };\n\n            subRecords.push(subRecord);\n          } else if (isArray(value)) {\n            value.forEach((item, k) => {\n              stack.push({\n                nestedArrIndex: k,\n                value: item\n              });\n            });\n          } else ;\n        }\n        record.$[keyIndex] = subRecords;\n      } else if (isString(value) && !isBlank(value)) {\n        let subRecord = {\n          v: value,\n          n: this.norm.get(value)\n        };\n\n        record.$[keyIndex] = subRecord;\n      }\n    });\n\n    this.records.push(record);\n  }\n  toJSON() {\n    return {\n      keys: this.keys,\n      records: this.records\n    }\n  }\n}\n\nfunction createIndex(\n  keys,\n  docs,\n  { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n  const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n  myIndex.setKeys(keys.map(createKey));\n  myIndex.setSources(docs);\n  myIndex.create();\n  return myIndex\n}\n\nfunction parseIndex(\n  data,\n  { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}\n) {\n  const { keys, records } = data;\n  const myIndex = new FuseIndex({ getFn, fieldNormWeight });\n  myIndex.setKeys(keys);\n  myIndex.setIndexRecords(records);\n  return myIndex\n}\n\nfunction computeScore$1(\n  pattern,\n  {\n    errors = 0,\n    currentLocation = 0,\n    expectedLocation = 0,\n    distance = Config.distance,\n    ignoreLocation = Config.ignoreLocation\n  } = {}\n) {\n  const accuracy = errors / pattern.length;\n\n  if (ignoreLocation) {\n    return accuracy\n  }\n\n  const proximity = Math.abs(expectedLocation - currentLocation);\n\n  if (!distance) {\n    // Dodge divide by zero error.\n    return proximity ? 1.0 : accuracy\n  }\n\n  return accuracy + proximity / distance\n}\n\nfunction convertMaskToIndices(\n  matchmask = [],\n  minMatchCharLength = Config.minMatchCharLength\n) {\n  let indices = [];\n  let start = -1;\n  let end = -1;\n  let i = 0;\n\n  for (let len = matchmask.length; i < len; i += 1) {\n    let match = matchmask[i];\n    if (match && start === -1) {\n      start = i;\n    } else if (!match && start !== -1) {\n      end = i - 1;\n      if (end - start + 1 >= minMatchCharLength) {\n        indices.push([start, end]);\n      }\n      start = -1;\n    }\n  }\n\n  // (i-1 - start) + 1 => i - start\n  if (matchmask[i - 1] && i - start >= minMatchCharLength) {\n    indices.push([start, i - 1]);\n  }\n\n  return indices\n}\n\n// Machine word size\nconst MAX_BITS = 32;\n\nfunction search(\n  text,\n  pattern,\n  patternAlphabet,\n  {\n    location = Config.location,\n    distance = Config.distance,\n    threshold = Config.threshold,\n    findAllMatches = Config.findAllMatches,\n    minMatchCharLength = Config.minMatchCharLength,\n    includeMatches = Config.includeMatches,\n    ignoreLocation = Config.ignoreLocation\n  } = {}\n) {\n  if (pattern.length > MAX_BITS) {\n    throw new Error(PATTERN_LENGTH_TOO_LARGE(MAX_BITS))\n  }\n\n  const patternLen = pattern.length;\n  // Set starting location at beginning text and initialize the alphabet.\n  const textLen = text.length;\n  // Handle the case when location > text.length\n  const expectedLocation = Math.max(0, Math.min(location, textLen));\n  // Highest score beyond which we give up.\n  let currentThreshold = threshold;\n  // Is there a nearby exact match? (speedup)\n  let bestLocation = expectedLocation;\n\n  // Performance: only computer matches when the minMatchCharLength > 1\n  // OR if `includeMatches` is true.\n  const computeMatches = minMatchCharLength > 1 || includeMatches;\n  // A mask of the matches, used for building the indices\n  const matchMask = computeMatches ? Array(textLen) : [];\n\n  let index;\n\n  // Get all exact matches, here for speed up\n  while ((index = text.indexOf(pattern, bestLocation)) > -1) {\n    let score = computeScore$1(pattern, {\n      currentLocation: index,\n      expectedLocation,\n      distance,\n      ignoreLocation\n    });\n\n    currentThreshold = Math.min(score, currentThreshold);\n    bestLocation = index + patternLen;\n\n    if (computeMatches) {\n      let i = 0;\n      while (i < patternLen) {\n        matchMask[index + i] = 1;\n        i += 1;\n      }\n    }\n  }\n\n  // Reset the best location\n  bestLocation = -1;\n\n  let lastBitArr = [];\n  let finalScore = 1;\n  let binMax = patternLen + textLen;\n\n  const mask = 1 << (patternLen - 1);\n\n  for (let i = 0; i < patternLen; i += 1) {\n    // Scan for the best match; each iteration allows for one more error.\n    // Run a binary search to determine how far from the match location we can stray\n    // at this error level.\n    let binMin = 0;\n    let binMid = binMax;\n\n    while (binMin < binMid) {\n      const score = computeScore$1(pattern, {\n        errors: i,\n        currentLocation: expectedLocation + binMid,\n        expectedLocation,\n        distance,\n        ignoreLocation\n      });\n\n      if (score <= currentThreshold) {\n        binMin = binMid;\n      } else {\n        binMax = binMid;\n      }\n\n      binMid = Math.floor((binMax - binMin) / 2 + binMin);\n    }\n\n    // Use the result from this iteration as the maximum for the next.\n    binMax = binMid;\n\n    let start = Math.max(1, expectedLocation - binMid + 1);\n    let finish = findAllMatches\n      ? textLen\n      : Math.min(expectedLocation + binMid, textLen) + patternLen;\n\n    // Initialize the bit array\n    let bitArr = Array(finish + 2);\n\n    bitArr[finish + 1] = (1 << i) - 1;\n\n    for (let j = finish; j >= start; j -= 1) {\n      let currentLocation = j - 1;\n      let charMatch = patternAlphabet[text.charAt(currentLocation)];\n\n      if (computeMatches) {\n        // Speed up: quick bool to int conversion (i.e, `charMatch ? 1 : 0`)\n        matchMask[currentLocation] = +!!charMatch;\n      }\n\n      // First pass: exact match\n      bitArr[j] = ((bitArr[j + 1] << 1) | 1) & charMatch;\n\n      // Subsequent passes: fuzzy match\n      if (i) {\n        bitArr[j] |=\n          ((lastBitArr[j + 1] | lastBitArr[j]) << 1) | 1 | lastBitArr[j + 1];\n      }\n\n      if (bitArr[j] & mask) {\n        finalScore = computeScore$1(pattern, {\n          errors: i,\n          currentLocation,\n          expectedLocation,\n          distance,\n          ignoreLocation\n        });\n\n        // This match will almost certainly be better than any existing match.\n        // But check anyway.\n        if (finalScore <= currentThreshold) {\n          // Indeed it is\n          currentThreshold = finalScore;\n          bestLocation = currentLocation;\n\n          // Already passed `loc`, downhill from here on in.\n          if (bestLocation <= expectedLocation) {\n            break\n          }\n\n          // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.\n          start = Math.max(1, 2 * expectedLocation - bestLocation);\n        }\n      }\n    }\n\n    // No hope for a (better) match at greater error levels.\n    const score = computeScore$1(pattern, {\n      errors: i + 1,\n      currentLocation: expectedLocation,\n      expectedLocation,\n      distance,\n      ignoreLocation\n    });\n\n    if (score > currentThreshold) {\n      break\n    }\n\n    lastBitArr = bitArr;\n  }\n\n  const result = {\n    isMatch: bestLocation >= 0,\n    // Count exact matches (those with a score of 0) to be \"almost\" exact\n    score: Math.max(0.001, finalScore)\n  };\n\n  if (computeMatches) {\n    const indices = convertMaskToIndices(matchMask, minMatchCharLength);\n    if (!indices.length) {\n      result.isMatch = false;\n    } else if (includeMatches) {\n      result.indices = indices;\n    }\n  }\n\n  return result\n}\n\nfunction createPatternAlphabet(pattern) {\n  let mask = {};\n\n  for (let i = 0, len = pattern.length; i < len; i += 1) {\n    const char = pattern.charAt(i);\n    mask[char] = (mask[char] || 0) | (1 << (len - i - 1));\n  }\n\n  return mask\n}\n\nclass BitapSearch {\n  constructor(\n    pattern,\n    {\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance,\n      includeMatches = Config.includeMatches,\n      findAllMatches = Config.findAllMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    this.options = {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreLocation\n    };\n\n    this.pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n\n    this.chunks = [];\n\n    if (!this.pattern.length) {\n      return\n    }\n\n    const addChunk = (pattern, startIndex) => {\n      this.chunks.push({\n        pattern,\n        alphabet: createPatternAlphabet(pattern),\n        startIndex\n      });\n    };\n\n    const len = this.pattern.length;\n\n    if (len > MAX_BITS) {\n      let i = 0;\n      const remainder = len % MAX_BITS;\n      const end = len - remainder;\n\n      while (i < end) {\n        addChunk(this.pattern.substr(i, MAX_BITS), i);\n        i += MAX_BITS;\n      }\n\n      if (remainder) {\n        const startIndex = len - MAX_BITS;\n        addChunk(this.pattern.substr(startIndex), startIndex);\n      }\n    } else {\n      addChunk(this.pattern, 0);\n    }\n  }\n\n  searchIn(text) {\n    const { isCaseSensitive, includeMatches } = this.options;\n\n    if (!isCaseSensitive) {\n      text = text.toLowerCase();\n    }\n\n    // Exact match\n    if (this.pattern === text) {\n      let result = {\n        isMatch: true,\n        score: 0\n      };\n\n      if (includeMatches) {\n        result.indices = [[0, text.length - 1]];\n      }\n\n      return result\n    }\n\n    // Otherwise, use Bitap algorithm\n    const {\n      location,\n      distance,\n      threshold,\n      findAllMatches,\n      minMatchCharLength,\n      ignoreLocation\n    } = this.options;\n\n    let allIndices = [];\n    let totalScore = 0;\n    let hasMatches = false;\n\n    this.chunks.forEach(({ pattern, alphabet, startIndex }) => {\n      const { isMatch, score, indices } = search(text, pattern, alphabet, {\n        location: location + startIndex,\n        distance,\n        threshold,\n        findAllMatches,\n        minMatchCharLength,\n        includeMatches,\n        ignoreLocation\n      });\n\n      if (isMatch) {\n        hasMatches = true;\n      }\n\n      totalScore += score;\n\n      if (isMatch && indices) {\n        allIndices = [...allIndices, ...indices];\n      }\n    });\n\n    let result = {\n      isMatch: hasMatches,\n      score: hasMatches ? totalScore / this.chunks.length : 1\n    };\n\n    if (hasMatches && includeMatches) {\n      result.indices = allIndices;\n    }\n\n    return result\n  }\n}\n\nclass BaseMatch {\n  constructor(pattern) {\n    this.pattern = pattern;\n  }\n  static isMultiMatch(pattern) {\n    return getMatch(pattern, this.multiRegex)\n  }\n  static isSingleMatch(pattern) {\n    return getMatch(pattern, this.singleRegex)\n  }\n  search(/*text*/) {}\n}\n\nfunction getMatch(pattern, exp) {\n  const matches = pattern.match(exp);\n  return matches ? matches[1] : null\n}\n\n// Token: 'file\n\nclass ExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'exact'\n  }\n  static get multiRegex() {\n    return /^=\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^=(.*)$/\n  }\n  search(text) {\n    const isMatch = text === this.pattern;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    }\n  }\n}\n\n// Token: !fire\n\nclass InverseExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-exact'\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^!(.*)$/\n  }\n  search(text) {\n    const index = text.indexOf(this.pattern);\n    const isMatch = index === -1;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\n// Token: ^file\n\nclass PrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'prefix-exact'\n  }\n  static get multiRegex() {\n    return /^\\^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^\\^(.*)$/\n  }\n  search(text) {\n    const isMatch = text.startsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, this.pattern.length - 1]\n    }\n  }\n}\n\n// Token: !^fire\n\nclass InversePrefixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-prefix-exact'\n  }\n  static get multiRegex() {\n    return /^!\\^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^!\\^(.*)$/\n  }\n  search(text) {\n    const isMatch = !text.startsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\n// Token: .file$\n\nclass SuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'suffix-exact'\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"\\$$/\n  }\n  static get singleRegex() {\n    return /^(.*)\\$$/\n  }\n  search(text) {\n    const isMatch = text.endsWith(this.pattern);\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [text.length - this.pattern.length, text.length - 1]\n    }\n  }\n}\n\n// Token: !.file$\n\nclass InverseSuffixExactMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'inverse-suffix-exact'\n  }\n  static get multiRegex() {\n    return /^!\"(.*)\"\\$$/\n  }\n  static get singleRegex() {\n    return /^!(.*)\\$$/\n  }\n  search(text) {\n    const isMatch = !text.endsWith(this.pattern);\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices: [0, text.length - 1]\n    }\n  }\n}\n\nclass FuzzyMatch extends BaseMatch {\n  constructor(\n    pattern,\n    {\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance,\n      includeMatches = Config.includeMatches,\n      findAllMatches = Config.findAllMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      isCaseSensitive = Config.isCaseSensitive,\n      ignoreLocation = Config.ignoreLocation\n    } = {}\n  ) {\n    super(pattern);\n    this._bitapSearch = new BitapSearch(pattern, {\n      location,\n      threshold,\n      distance,\n      includeMatches,\n      findAllMatches,\n      minMatchCharLength,\n      isCaseSensitive,\n      ignoreLocation\n    });\n  }\n  static get type() {\n    return 'fuzzy'\n  }\n  static get multiRegex() {\n    return /^\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^(.*)$/\n  }\n  search(text) {\n    return this._bitapSearch.searchIn(text)\n  }\n}\n\n// Token: 'file\n\nclass IncludeMatch extends BaseMatch {\n  constructor(pattern) {\n    super(pattern);\n  }\n  static get type() {\n    return 'include'\n  }\n  static get multiRegex() {\n    return /^'\"(.*)\"$/\n  }\n  static get singleRegex() {\n    return /^'(.*)$/\n  }\n  search(text) {\n    let location = 0;\n    let index;\n\n    const indices = [];\n    const patternLen = this.pattern.length;\n\n    // Get all exact matches\n    while ((index = text.indexOf(this.pattern, location)) > -1) {\n      location = index + patternLen;\n      indices.push([index, location - 1]);\n    }\n\n    const isMatch = !!indices.length;\n\n    return {\n      isMatch,\n      score: isMatch ? 0 : 1,\n      indices\n    }\n  }\n}\n\n// ❗Order is important. DO NOT CHANGE.\nconst searchers = [\n  ExactMatch,\n  IncludeMatch,\n  PrefixExactMatch,\n  InversePrefixExactMatch,\n  InverseSuffixExactMatch,\n  SuffixExactMatch,\n  InverseExactMatch,\n  FuzzyMatch\n];\n\nconst searchersLen = searchers.length;\n\n// Regex to split by spaces, but keep anything in quotes together\nconst SPACE_RE = / +(?=(?:[^\\\"]*\\\"[^\\\"]*\\\")*[^\\\"]*$)/;\nconst OR_TOKEN = '|';\n\n// Return a 2D array representation of the query, for simpler parsing.\n// Example:\n// \"^core go$ | rb$ | py$ xy$\" => [[\"^core\", \"go$\"], [\"rb$\"], [\"py$\", \"xy$\"]]\nfunction parseQuery(pattern, options = {}) {\n  return pattern.split(OR_TOKEN).map((item) => {\n    let query = item\n      .trim()\n      .split(SPACE_RE)\n      .filter((item) => item && !!item.trim());\n\n    let results = [];\n    for (let i = 0, len = query.length; i < len; i += 1) {\n      const queryItem = query[i];\n\n      // 1. Handle multiple query match (i.e, once that are quoted, like `\"hello world\"`)\n      let found = false;\n      let idx = -1;\n      while (!found && ++idx < searchersLen) {\n        const searcher = searchers[idx];\n        let token = searcher.isMultiMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          found = true;\n        }\n      }\n\n      if (found) {\n        continue\n      }\n\n      // 2. Handle single query matches (i.e, once that are *not* quoted)\n      idx = -1;\n      while (++idx < searchersLen) {\n        const searcher = searchers[idx];\n        let token = searcher.isSingleMatch(queryItem);\n        if (token) {\n          results.push(new searcher(token, options));\n          break\n        }\n      }\n    }\n\n    return results\n  })\n}\n\n// These extended matchers can return an array of matches, as opposed\n// to a singl match\nconst MultiMatchSet = new Set([FuzzyMatch.type, IncludeMatch.type]);\n\n/**\n * Command-like searching\n * ======================\n *\n * Given multiple search terms delimited by spaces.e.g. `^jscript .python$ ruby !java`,\n * search in a given text.\n *\n * Search syntax:\n *\n * | Token       | Match type                 | Description                            |\n * | ----------- | -------------------------- | -------------------------------------- |\n * | `jscript`   | fuzzy-match                | Items that fuzzy match `jscript`       |\n * | `=scheme`   | exact-match                | Items that are `scheme`                |\n * | `'python`   | include-match              | Items that include `python`            |\n * | `!ruby`     | inverse-exact-match        | Items that do not include `ruby`       |\n * | `^java`     | prefix-exact-match         | Items that start with `java`           |\n * | `!^earlang` | inverse-prefix-exact-match | Items that do not start with `earlang` |\n * | `.js$`      | suffix-exact-match         | Items that end with `.js`              |\n * | `!.go$`     | inverse-suffix-exact-match | Items that do not end with `.go`       |\n *\n * A single pipe character acts as an OR operator. For example, the following\n * query matches entries that start with `core` and end with either`go`, `rb`,\n * or`py`.\n *\n * ```\n * ^core go$ | rb$ | py$\n * ```\n */\nclass ExtendedSearch {\n  constructor(\n    pattern,\n    {\n      isCaseSensitive = Config.isCaseSensitive,\n      includeMatches = Config.includeMatches,\n      minMatchCharLength = Config.minMatchCharLength,\n      ignoreLocation = Config.ignoreLocation,\n      findAllMatches = Config.findAllMatches,\n      location = Config.location,\n      threshold = Config.threshold,\n      distance = Config.distance\n    } = {}\n  ) {\n    this.query = null;\n    this.options = {\n      isCaseSensitive,\n      includeMatches,\n      minMatchCharLength,\n      findAllMatches,\n      ignoreLocation,\n      location,\n      threshold,\n      distance\n    };\n\n    this.pattern = isCaseSensitive ? pattern : pattern.toLowerCase();\n    this.query = parseQuery(this.pattern, this.options);\n  }\n\n  static condition(_, options) {\n    return options.useExtendedSearch\n  }\n\n  searchIn(text) {\n    const query = this.query;\n\n    if (!query) {\n      return {\n        isMatch: false,\n        score: 1\n      }\n    }\n\n    const { includeMatches, isCaseSensitive } = this.options;\n\n    text = isCaseSensitive ? text : text.toLowerCase();\n\n    let numMatches = 0;\n    let allIndices = [];\n    let totalScore = 0;\n\n    // ORs\n    for (let i = 0, qLen = query.length; i < qLen; i += 1) {\n      const searchers = query[i];\n\n      // Reset indices\n      allIndices.length = 0;\n      numMatches = 0;\n\n      // ANDs\n      for (let j = 0, pLen = searchers.length; j < pLen; j += 1) {\n        const searcher = searchers[j];\n        const { isMatch, indices, score } = searcher.search(text);\n\n        if (isMatch) {\n          numMatches += 1;\n          totalScore += score;\n          if (includeMatches) {\n            const type = searcher.constructor.type;\n            if (MultiMatchSet.has(type)) {\n              allIndices = [...allIndices, ...indices];\n            } else {\n              allIndices.push(indices);\n            }\n          }\n        } else {\n          totalScore = 0;\n          numMatches = 0;\n          allIndices.length = 0;\n          break\n        }\n      }\n\n      // OR condition, so if TRUE, return\n      if (numMatches) {\n        let result = {\n          isMatch: true,\n          score: totalScore / numMatches\n        };\n\n        if (includeMatches) {\n          result.indices = allIndices;\n        }\n\n        return result\n      }\n    }\n\n    // Nothing was matched\n    return {\n      isMatch: false,\n      score: 1\n    }\n  }\n}\n\nconst registeredSearchers = [];\n\nfunction register(...args) {\n  registeredSearchers.push(...args);\n}\n\nfunction createSearcher(pattern, options) {\n  for (let i = 0, len = registeredSearchers.length; i < len; i += 1) {\n    let searcherClass = registeredSearchers[i];\n    if (searcherClass.condition(pattern, options)) {\n      return new searcherClass(pattern, options)\n    }\n  }\n\n  return new BitapSearch(pattern, options)\n}\n\nconst LogicalOperator = {\n  AND: '$and',\n  OR: '$or'\n};\n\nconst KeyType = {\n  PATH: '$path',\n  PATTERN: '$val'\n};\n\nconst isExpression = (query) =>\n  !!(query[LogicalOperator.AND] || query[LogicalOperator.OR]);\n\nconst isPath = (query) => !!query[KeyType.PATH];\n\nconst isLeaf = (query) =>\n  !isArray(query) && isObject(query) && !isExpression(query);\n\nconst convertToExplicit = (query) => ({\n  [LogicalOperator.AND]: Object.keys(query).map((key) => ({\n    [key]: query[key]\n  }))\n});\n\n// When `auto` is `true`, the parse function will infer and initialize and add\n// the appropriate `Searcher` instance\nfunction parse(query, options, { auto = true } = {}) {\n  const next = (query) => {\n    let keys = Object.keys(query);\n\n    const isQueryPath = isPath(query);\n\n    if (!isQueryPath && keys.length > 1 && !isExpression(query)) {\n      return next(convertToExplicit(query))\n    }\n\n    if (isLeaf(query)) {\n      const key = isQueryPath ? query[KeyType.PATH] : keys[0];\n\n      const pattern = isQueryPath ? query[KeyType.PATTERN] : query[key];\n\n      if (!isString(pattern)) {\n        throw new Error(LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key))\n      }\n\n      const obj = {\n        keyId: createKeyId(key),\n        pattern\n      };\n\n      if (auto) {\n        obj.searcher = createSearcher(pattern, options);\n      }\n\n      return obj\n    }\n\n    let node = {\n      children: [],\n      operator: keys[0]\n    };\n\n    keys.forEach((key) => {\n      const value = query[key];\n\n      if (isArray(value)) {\n        value.forEach((item) => {\n          node.children.push(next(item));\n        });\n      }\n    });\n\n    return node\n  };\n\n  if (!isExpression(query)) {\n    query = convertToExplicit(query);\n  }\n\n  return next(query)\n}\n\n// Practical scoring function\nfunction computeScore(\n  results,\n  { ignoreFieldNorm = Config.ignoreFieldNorm }\n) {\n  results.forEach((result) => {\n    let totalScore = 1;\n\n    result.matches.forEach(({ key, norm, score }) => {\n      const weight = key ? key.weight : null;\n\n      totalScore *= Math.pow(\n        score === 0 && weight ? Number.EPSILON : score,\n        (weight || 1) * (ignoreFieldNorm ? 1 : norm)\n      );\n    });\n\n    result.score = totalScore;\n  });\n}\n\nfunction transformMatches(result, data) {\n  const matches = result.matches;\n  data.matches = [];\n\n  if (!isDefined(matches)) {\n    return\n  }\n\n  matches.forEach((match) => {\n    if (!isDefined(match.indices) || !match.indices.length) {\n      return\n    }\n\n    const { indices, value } = match;\n\n    let obj = {\n      indices,\n      value\n    };\n\n    if (match.key) {\n      obj.key = match.key.src;\n    }\n\n    if (match.idx > -1) {\n      obj.refIndex = match.idx;\n    }\n\n    data.matches.push(obj);\n  });\n}\n\nfunction transformScore(result, data) {\n  data.score = result.score;\n}\n\nfunction format(\n  results,\n  docs,\n  {\n    includeMatches = Config.includeMatches,\n    includeScore = Config.includeScore\n  } = {}\n) {\n  const transformers = [];\n\n  if (includeMatches) transformers.push(transformMatches);\n  if (includeScore) transformers.push(transformScore);\n\n  return results.map((result) => {\n    const { idx } = result;\n\n    const data = {\n      item: docs[idx],\n      refIndex: idx\n    };\n\n    if (transformers.length) {\n      transformers.forEach((transformer) => {\n        transformer(result, data);\n      });\n    }\n\n    return data\n  })\n}\n\nclass Fuse {\n  constructor(docs, options = {}, index) {\n    this.options = { ...Config, ...options };\n\n    if (\n      this.options.useExtendedSearch &&\n      !true\n    ) {\n      throw new Error(EXTENDED_SEARCH_UNAVAILABLE)\n    }\n\n    this._keyStore = new KeyStore(this.options.keys);\n\n    this.setCollection(docs, index);\n  }\n\n  setCollection(docs, index) {\n    this._docs = docs;\n\n    if (index && !(index instanceof FuseIndex)) {\n      throw new Error(INCORRECT_INDEX_TYPE)\n    }\n\n    this._myIndex =\n      index ||\n      createIndex(this.options.keys, this._docs, {\n        getFn: this.options.getFn,\n        fieldNormWeight: this.options.fieldNormWeight\n      });\n  }\n\n  add(doc) {\n    if (!isDefined(doc)) {\n      return\n    }\n\n    this._docs.push(doc);\n    this._myIndex.add(doc);\n  }\n\n  remove(predicate = (/* doc, idx */) => false) {\n    const results = [];\n\n    for (let i = 0, len = this._docs.length; i < len; i += 1) {\n      const doc = this._docs[i];\n      if (predicate(doc, i)) {\n        this.removeAt(i);\n        i -= 1;\n        len -= 1;\n\n        results.push(doc);\n      }\n    }\n\n    return results\n  }\n\n  removeAt(idx) {\n    this._docs.splice(idx, 1);\n    this._myIndex.removeAt(idx);\n  }\n\n  getIndex() {\n    return this._myIndex\n  }\n\n  search(query, { limit = -1 } = {}) {\n    const {\n      includeMatches,\n      includeScore,\n      shouldSort,\n      sortFn,\n      ignoreFieldNorm\n    } = this.options;\n\n    let results = isString(query)\n      ? isString(this._docs[0])\n        ? this._searchStringList(query)\n        : this._searchObjectList(query)\n      : this._searchLogical(query);\n\n    computeScore(results, { ignoreFieldNorm });\n\n    if (shouldSort) {\n      results.sort(sortFn);\n    }\n\n    if (isNumber(limit) && limit > -1) {\n      results = results.slice(0, limit);\n    }\n\n    return format(results, this._docs, {\n      includeMatches,\n      includeScore\n    })\n  }\n\n  _searchStringList(query) {\n    const searcher = createSearcher(query, this.options);\n    const { records } = this._myIndex;\n    const results = [];\n\n    // Iterate over every string in the index\n    records.forEach(({ v: text, i: idx, n: norm }) => {\n      if (!isDefined(text)) {\n        return\n      }\n\n      const { isMatch, score, indices } = searcher.searchIn(text);\n\n      if (isMatch) {\n        results.push({\n          item: text,\n          idx,\n          matches: [{ score, value: text, norm, indices }]\n        });\n      }\n    });\n\n    return results\n  }\n\n  _searchLogical(query) {\n\n    const expression = parse(query, this.options);\n\n    const evaluate = (node, item, idx) => {\n      if (!node.children) {\n        const { keyId, searcher } = node;\n\n        const matches = this._findMatches({\n          key: this._keyStore.get(keyId),\n          value: this._myIndex.getValueForItemAtKeyId(item, keyId),\n          searcher\n        });\n\n        if (matches && matches.length) {\n          return [\n            {\n              idx,\n              item,\n              matches\n            }\n          ]\n        }\n\n        return []\n      }\n\n      const res = [];\n      for (let i = 0, len = node.children.length; i < len; i += 1) {\n        const child = node.children[i];\n        const result = evaluate(child, item, idx);\n        if (result.length) {\n          res.push(...result);\n        } else if (node.operator === LogicalOperator.AND) {\n          return []\n        }\n      }\n      return res\n    };\n\n    const records = this._myIndex.records;\n    const resultMap = {};\n    const results = [];\n\n    records.forEach(({ $: item, i: idx }) => {\n      if (isDefined(item)) {\n        let expResults = evaluate(expression, item, idx);\n\n        if (expResults.length) {\n          // Dedupe when adding\n          if (!resultMap[idx]) {\n            resultMap[idx] = { idx, item, matches: [] };\n            results.push(resultMap[idx]);\n          }\n          expResults.forEach(({ matches }) => {\n            resultMap[idx].matches.push(...matches);\n          });\n        }\n      }\n    });\n\n    return results\n  }\n\n  _searchObjectList(query) {\n    const searcher = createSearcher(query, this.options);\n    const { keys, records } = this._myIndex;\n    const results = [];\n\n    // List is Array<Object>\n    records.forEach(({ $: item, i: idx }) => {\n      if (!isDefined(item)) {\n        return\n      }\n\n      let matches = [];\n\n      // Iterate over every key (i.e, path), and fetch the value at that key\n      keys.forEach((key, keyIndex) => {\n        matches.push(\n          ...this._findMatches({\n            key,\n            value: item[keyIndex],\n            searcher\n          })\n        );\n      });\n\n      if (matches.length) {\n        results.push({\n          idx,\n          item,\n          matches\n        });\n      }\n    });\n\n    return results\n  }\n  _findMatches({ key, value, searcher }) {\n    if (!isDefined(value)) {\n      return []\n    }\n\n    let matches = [];\n\n    if (isArray(value)) {\n      value.forEach(({ v: text, i: idx, n: norm }) => {\n        if (!isDefined(text)) {\n          return\n        }\n\n        const { isMatch, score, indices } = searcher.searchIn(text);\n\n        if (isMatch) {\n          matches.push({\n            score,\n            key,\n            value: text,\n            idx,\n            norm,\n            indices\n          });\n        }\n      });\n    } else {\n      const { v: text, n: norm } = value;\n\n      const { isMatch, score, indices } = searcher.searchIn(text);\n\n      if (isMatch) {\n        matches.push({ score, key, value: text, norm, indices });\n      }\n    }\n\n    return matches\n  }\n}\n\nFuse.version = '7.0.0';\nFuse.createIndex = createIndex;\nFuse.parseIndex = parseIndex;\nFuse.config = Config;\n\n{\n  Fuse.parseQuery = parse;\n}\n\n{\n  register(ExtendedSearch);\n}\n\nexport { Fuse as default };\n"],"names":["isArray","value","Array","getTag","isString","isNumber","isObject","isDefined","undefined","isBlank","trim","length","Object","prototype","toString","call","MISSING_KEY_PROPERTY","name","INVALID_KEY_WEIGHT_VALUE","key","hasOwn","hasOwnProperty","KeyStore","constructor","keys","this","_keys","_keyMap","totalWeight","forEach","obj","createKey","push","id","weight","get","keyId","toJSON","JSON","stringify","path","src","getFn","createKeyPath","createKeyId","Error","split","join","Config","isCaseSensitive","includeScore","shouldSort","sortFn","a","b","score","idx","includeMatches","findAllMatches","minMatchCharLength","location","threshold","distance","useExtendedSearch","list","arr","deepGet","index","isObjectLike","isBoolean","result","baseToString","i","len","ignoreLocation","ignoreFieldNorm","fieldNormWeight","SPACE","FuseIndex","norm","mantissa","cache","Map","m","Math","pow","numTokens","match","has","n","parseFloat","round","set","clear","isCreated","setIndexRecords","setSources","docs","records","setKeys","_keysMap","create","doc","docIndex","_addString","_addObject","add","size","removeAt","splice","getValueForItemAtKeyId","item","record","v","$","keyIndex","subRecords","stack","nestedArrIndex","pop","subRecord","k","createIndex","myIndex","map","computeScore$1","pattern","errors","currentLocation","expectedLocation","accuracy","proximity","abs","createPatternAlphabet","mask","char","charAt","BitapSearch","options","toLowerCase","chunks","addChunk","startIndex","alphabet","remainder","end","substr","searchIn","text","isMatch","indices","allIndices","totalScore","hasMatches","patternAlphabet","patternLen","textLen","max","min","currentThreshold","bestLocation","computeMatches","matchMask","indexOf","lastBitArr","finalScore","binMax","binMin","binMid","floor","start","finish","bitArr","j","charMatch","matchmask","convertMaskToIndices","search","BaseMatch","isMultiMatch","getMatch","multiRegex","isSingleMatch","singleRegex","exp","matches","FuzzyMatch","super","_bitapSearch","type","IncludeMatch","searchers","ExactMatch","PrefixExactMatch","startsWith","InversePrefixExactMatch","InverseSuffixExactMatch","endsWith","SuffixExactMatch","InverseExactMatch","searchersLen","SPACE_RE","MultiMatchSet","Set","registeredSearchers","createSearcher","searcherClass","condition","LogicalOperator","isExpression","query","convertToExplicit","LogicalOperator_AND","parse","auto","next","isQueryPath","isPath","isLeaf","LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY","searcher","node","children","operator","transformMatches","data","refIndex","transformScore","Fuse","_keyStore","setCollection","_docs","_myIndex","remove","predicate","results","getIndex","limit","_searchStringList","_searchObjectList","_searchLogical","Number","EPSILON","computeScore","sort","slice","transformers","transformer","format","expression","evaluate","_findMatches","res","resultMap","expResults","version","parseIndex","config","parseQuery","ExtendedSearch","filter","queryItem","found","token","_","numMatches","qLen","pLen"],"mappings":"aASA,SAASA,QAAQC,GACf,OAAQC,MAAMF,QAEVE,MAAMF,QAAQC,GADdE,OAAOF,KAAW,gBAExB,CAiBA,SAASG,SAASH,GAChB,cAAcA,GAAU,QAC1B,CAEA,SAASI,SAASJ,GAChB,cAAcA,GAAU,QAC1B,CAWA,SAASK,SAASL,GAChB,cAAcA,GAAU,QAC1B,CAOA,SAASM,UAAUN,GACjB,OAAOA,SAAUO,GAAaP,IAAU,IAC1C,CAEA,SAASQ,QAAQR,GACf,OAAQA,EAAMS,OAAOC,MACvB,CAIA,SAASR,OAAOF,GACd,OAAOA,GAAS,KACZA,SAAUO,EACR,qBACA,gBACFI,CAAOC,EAAUC,SAASC,KAAKd,EACrC,wDAYA,MAAMe,qBAAwBC,GAAS,WAAWA,oBAElD,MAAMC,yBAA4BC,GAChC,6BAA6BA,gCAE/B,MAAMC,OAASR,CAAOC,EAAUQ,eAEhC,MAAMC,SACJ,WAAAC,CAAYC,GACVC,KAAKC,MAAQ,GACbD,KAAKE,QAAU,GAEf,IAAIC,EAAc,EAElBJ,EAAKK,SAASV,IACZ,IAAIW,EAAMC,UAAUZ,GAEpBM,KAAKC,MAAMM,KAAKF,GAChBL,KAAKE,QAAQG,EAAIG,IAAMH,EAEvBF,GAAeE,EAAII,MAAM,IAI3BT,KAAKC,MAAMG,SAASV,IAClBA,EAAIe,QAAUN,CAAW,GAE5B,CACD,GAAAO,CAAIC,GACF,OAAOX,KAAKE,QAAQS,EACrB,CACD,IAAAZ,GACE,OAAOC,KAAKC,KACb,CACD,MAAAW,GACE,OAAOC,KAAKC,UAAUd,KAAKC,MAC5B,EAGH,SAASK,UAAUZ,GACjB,IAAIqB,EAAO,KACX,IAAIP,EAAK,KACT,IAAIQ,EAAM,KACV,IAAIP,EAAS,EACb,IAAIQ,EAAQ,KAEZ,GAAItC,SAASe,IAAQnB,QAAQmB,GAC3BsB,EAAMtB,EACNqB,EAAOG,cAAcxB,GACrBc,EAAKW,YAAYzB,OACZ,CACL,IAAKC,OAAOL,KAAKI,EAAK,QACpB,MAAM,IAAI0B,MAAM7B,qBAAqB,SAGvC,MAAMC,EAAOE,EAAIF,KAGjB,GAFAwB,EAAMxB,EAEFG,OAAOL,KAAKI,EAAK,YACnBe,EAASf,EAAIe,OAETA,GAAU,GACZ,MAAM,IAAIW,MAAM3B,yBAAyBD,IAI7CuB,EAAOG,cAAc1B,GACrBgB,EAAKW,YAAY3B,GACjByB,EAAQvB,EAAIuB,KACb,CAED,MAAO,CAAEF,OAAMP,KAAIC,SAAQO,MAAKC,QAClC,CAEA,SAASC,cAAcxB,GACrB,OAAOnB,QAAQmB,GAAOA,EAAMA,EAAI2B,MAAM,IACxC,CAEA,SAASF,YAAYzB,GACnB,OAAOnB,QAAQmB,GAAOA,EAAI4B,KAAK,KAAO5B,CACxC,CA2GA,IAAI6B,OAAS,CA5CXC,iBAAiB,EAEjBC,cAAc,EAEd1B,KAAM,GAEN2B,YAAY,EAEZC,OAAQ,CAACC,EAAGC,IACVD,EAAEE,QAAUD,EAAEC,MAASF,EAAEG,IAAMF,EAAEE,KAAO,EAAI,EAAKH,EAAEE,MAAQD,EAAEC,OAAS,EAAI,EApB5EE,gBAAgB,EAGhBC,gBAAgB,EAEhBC,mBAAoB,EAoBpBC,SAAU,EAGVC,UAAW,GAMXC,SAAU,IAKVC,mBAAmB,EAGnBrB,MA5FF,CAAaZ,EAAKU,KAChB,IAAIwB,EAAO,GACX,IAAIC,GAAM,EAEV,MAAMC,QAAU,CAACpC,EAAKU,EAAM2B,KAC1B,GAAK5D,UAAUuB,GAGf,GAAKU,EAAK2B,GAGH,CAGL,MAAMlE,EAAQ6B,EAFJU,EAAK2B,IAIf,IAAK5D,UAAUN,GACb,OAKF,GACEkE,IAAU3B,EAAK7B,OAAS,IACvBP,SAASH,IAAUI,SAASJ,IAvJrC,CAAmBA,GAEfA,KAAU,GACVA,KAAU,GAUd,CAAsBA,GACbK,SAASL,IAAUA,IAAU,KAVjCmE,CAAanE,IAAUE,OAAOF,IAAU,mBAmJEoE,CAAUpE,IAEjD+D,EAAKhC,KAtKb,CAAkB/B,GACTA,GAAS,KAAO,GAVzB,CAAsBA,IAEpB,UAAWA,GAAS,SAClB,OAAOA,EAET,IAAIqE,EAASrE,EAAQ,GACrB,OAAOqE,GAAU,KAAO,EAAIrE,IAAS,IAAY,KAAOqE,CAC1D,EAG8BC,CAAatE,GAqKzBa,CAASb,SACd,GAAID,QAAQC,GAAQ,CACzBgE,GAAM,EAEN,IAAK,IAAIO,EAAI,EAAGC,EAAMxE,EAAMU,OAAQ6D,EAAIC,EAAKD,GAAK,EAChDN,QAAQjE,EAAMuE,GAAIhC,EAAM2B,EAAQ,EAE1C,MAAiB3B,EAAK7B,QAEduD,QAAQjE,EAAOuC,EAAM2B,EAAQ,EAEhC,MA3BCH,EAAKhC,KAAKF,EA2BX,EAMH,OAFAoC,QAAQpC,EAAK1B,SAASoC,GAAQA,EAAKM,MAAM,KAAON,EAAM,GAE/CyB,EAAMD,EAAOA,EAAK,EAC3B,EAoDEU,gBAAgB,EAIhBC,iBAAiB,EAEjBC,gBAAiB,GAUnB,MAAMC,MAAQ,SAgCd,MAAMC,UACJ,WAAAvD,EAAYmB,MACVA,EAAQM,OAAON,MAAKkC,gBACpBA,EAAkB5B,OAAO4B,iBACvB,IACFnD,KAAKsD,KAjCT,EAAc7C,EAAS,EAAG8C,EAAW,KACnC,MAAMC,EAAQ,IAAIC,IAClB,MAAMC,EAAIC,KAAKC,IAAI,GAAIL,GAEvB,MAAO,CACL,GAAA7C,CAAIlC,GACF,MAAMqF,EAAYrF,EAAMsF,MAAMV,OAAOlE,OAErC,GAAIsE,EAAMO,IAAIF,GACZ,OAAOL,EAAM9C,IAAImD,GAInB,MAAMP,EAAO,EAAIK,KAAKC,IAAIC,EAAW,GAAMpD,GAG3C,MAAMuD,EAAIC,WAAWN,KAAKO,MAAMZ,EAAOI,GAAKA,GAI5C,OAFAF,EAAMW,IAAIN,EAAWG,GAEdA,CACR,EACD,KAAAI,GACEZ,EAAMY,OACP,EAEL,EAOgBd,CAAKH,EAAiB,GAClCnD,KAAKiB,MAAQA,EACbjB,KAAKqE,WAAY,EAEjBrE,KAAKsE,iBACN,CACD,UAAAC,CAAWC,EAAO,IAChBxE,KAAKwE,KAAOA,CACb,CACD,eAAAF,CAAgBG,EAAU,IACxBzE,KAAKyE,QAAUA,CAChB,CACD,OAAAC,CAAQ3E,EAAO,IACbC,KAAKD,KAAOA,EACZC,KAAK2E,SAAW,GAChB5E,EAAKK,SAAQ,CAACV,EAAKqC,KACjB/B,KAAK2E,SAASjF,EAAIc,IAAMuB,CAAG,GAE9B,CACD,MAAA6C,IACM5E,KAAKqE,WAAcrE,KAAKwE,KAAKtF,SAIjCc,KAAKqE,WAAY,EAGb1F,SAASqB,KAAKwE,KAAK,IACrBxE,KAAKwE,KAAKpE,SAAQ,CAACyE,EAAKC,KACtB9E,KAAK+E,WAAWF,EAAKC,EAAS,IAIhC9E,KAAKwE,KAAKpE,SAAQ,CAACyE,EAAKC,KACtB9E,KAAKgF,WAAWH,EAAKC,EAAS,IAIlC9E,KAAKsD,KAAKc,QACX,CAED,GAAAa,CAAIJ,GACF,MAAM9C,EAAM/B,KAAKkF,OAEbvG,SAASkG,GACX7E,KAAK+E,WAAWF,EAAK9C,GAErB/B,KAAKgF,WAAWH,EAAK9C,EAExB,CAED,QAAAoD,CAASpD,GACP/B,KAAKyE,QAAQW,OAAOrD,EAAK,GAGzB,IAAK,IAAIgB,EAAIhB,EAAKiB,EAAMhD,KAAKkF,OAAQnC,EAAIC,EAAKD,GAAK,EACjD/C,KAAKyE,QAAQ1B,GAAGA,GAAK,CAExB,CACD,sBAAAsC,CAAuBC,EAAM3E,GAC3B,OAAO2E,EAAKtF,KAAK2E,SAAShE,GAC3B,CACD,IAAAuE,GACE,OAAOlF,KAAKyE,QAAQvF,MACrB,CACD,UAAA6F,CAAWF,EAAKC,GACd,IAAKhG,UAAU+F,IAAQ7F,QAAQ6F,GAC7B,OAGF,IAAIU,EAAS,CACXC,EAAGX,EACH9B,EAAG+B,EACHd,EAAGhE,KAAKsD,KAAK5C,IAAImE,IAGnB7E,KAAKyE,QAAQlE,KAAKgF,EACnB,CACD,UAAAP,CAAWH,EAAKC,GACd,IAAIS,EAAS,CAAExC,EAAG+B,EAAUW,EAAG,CAAE,GAGjCzF,KAAKD,KAAKK,SAAQ,CAACV,EAAKgG,KACtB,IAAIlH,EAAQkB,EAAIuB,MAAQvB,EAAIuB,MAAM4D,GAAO7E,KAAKiB,MAAM4D,EAAKnF,EAAIqB,MAE7D,GAAKjC,UAAUN,GAIf,GAAID,QAAQC,GAAQ,CAClB,IAAImH,EAAa,GACjB,MAAMC,EAAQ,CAAC,CAAEC,gBAAiB,EAAGrH,UAErC,KAAOoH,EAAM1G,QAAQ,CACnB,MAAM2G,eAAEA,EAAcrH,MAAEA,GAAUoH,EAAME,MAExC,GAAKhH,UAAUN,GAIf,GAAIG,SAASH,KAAWQ,QAAQR,GAAQ,CACtC,IAAIuH,EAAY,CACdP,EAAGhH,EACHuE,EAAG8C,EACH7B,EAAGhE,KAAKsD,KAAK5C,IAAIlC,IAGnBmH,EAAWpF,KAAKwF,EAC5B,MAAqBxH,QAAQC,IACjBA,EAAM4B,SAAQ,CAACkF,EAAMU,KACnBJ,EAAMrF,KAAK,CACTsF,eAAgBG,EAChBxH,MAAO8G,GACP,GAGP,CACDC,EAAOE,EAAEC,GAAYC,CAC7B,MAAa,GAAIhH,SAASH,KAAWQ,QAAQR,GAAQ,CAC7C,IAAIuH,EAAY,CACdP,EAAGhH,EACHwF,EAAGhE,KAAKsD,KAAK5C,IAAIlC,IAGnB+G,EAAOE,EAAEC,GAAYK,CACtB,KAGH/F,KAAKyE,QAAQlE,KAAKgF,EACnB,CACD,MAAA3E,GACE,MAAO,CACLb,KAAMC,KAAKD,KACX0E,QAASzE,KAAKyE,QAEjB,EAGH,SAASwB,YACPlG,EACAyE,GACAvD,MAAEA,EAAQM,OAAON,MAAKkC,gBAAEA,EAAkB5B,OAAO4B,iBAAoB,CAAE,GAEvE,MAAM+C,EAAU,IAAI7C,UAAU,CAAEpC,QAAOkC,oBAIvC,OAHA+C,EAAQxB,QAAQ3E,EAAKoG,IAAI7F,YACzB4F,EAAQ3B,WAAWC,GACnB0B,EAAQtB,SACDsB,CACT,CAaA,SAASE,eACPC,GACAC,OACEA,EAAS,EAACC,gBACVA,EAAkB,EAACC,iBACnBA,EAAmB,EAACnE,SACpBA,EAAWd,OAAOc,SAAQY,eAC1BA,EAAiB1B,OAAO0B,gBACtB,CAAE,GAEN,MAAMwD,EAAWH,EAASD,EAAQnH,OAElC,GAAI+D,EACF,OAAOwD,EAGT,MAAMC,EAAY/C,KAAKgD,IAAIH,EAAmBD,GAE9C,OAAKlE,EAKEoE,EAAWC,EAAYrE,EAHrBqE,EAAY,EAAMD,CAI7B,CA0NA,SAASG,sBAAsBP,GAC7B,IAAIQ,EAAO,CAAA,EAEX,IAAK,IAAI9D,EAAI,EAAGC,EAAMqD,EAAQnH,OAAQ6D,EAAIC,EAAKD,GAAK,EAAG,CACrD,MAAM+D,EAAOT,EAAQU,OAAOhE,GAC5B8D,EAAKC,IAASD,EAAKC,IAAS,GAAM,GAAM9D,EAAMD,EAAI,CACnD,CAED,OAAO8D,CACT,CAEA,MAAMG,YACJ,WAAAlH,CACEuG,GACAlE,SACEA,EAAWZ,OAAOY,SAAQC,UAC1BA,EAAYb,OAAOa,UAASC,SAC5BA,EAAWd,OAAOc,SAAQL,eAC1BA,EAAiBT,OAAOS,eAAcC,eACtCA,EAAiBV,OAAOU,eAAcC,mBACtCA,EAAqBX,OAAOW,mBAAkBV,gBAC9CA,EAAkBD,OAAOC,gBAAeyB,eACxCA,EAAiB1B,OAAO0B,gBACtB,CAAE,GAiBN,GAfAjD,KAAKiH,QAAU,CACb9E,WACAC,YACAC,WACAL,iBACAC,iBACAC,qBACAV,kBACAyB,kBAGFjD,KAAKqG,QAAU7E,EAAkB6E,EAAUA,EAAQa,cAEnDlH,KAAKmH,OAAS,IAETnH,KAAKqG,QAAQnH,OAChB,OAGF,MAAMkI,SAAW,CAACf,EAASgB,KACzBrH,KAAKmH,OAAO5G,KAAK,CACf8F,UACAiB,SAAUV,sBAAsBP,GAChCgB,cACA,EAGJ,MAAMrE,EAAMhD,KAAKqG,QAAQnH,OAEzB,GAAI8D,EA/OS,GA+OO,CAClB,IAAID,EAAI,EACR,MAAMwE,EAAYvE,EAjPP,GAkPX,MAAMwE,EAAMxE,EAAMuE,EAElB,KAAOxE,EAAIyE,GACTJ,SAASpH,KAAKqG,QAAQoB,OAAO1E,EArPpB,IAqPkCA,GAC3CA,GAtPS,GAyPX,GAAIwE,EAAW,CACb,MAAMF,EAAarE,EA1PV,GA2PToE,SAASpH,KAAKqG,QAAQoB,OAAOJ,GAAaA,EAC3C,CACP,MACMD,SAASpH,KAAKqG,QAAS,EAE1B,CAED,QAAAqB,CAASC,GACP,MAAMnG,gBAAEA,EAAeQ,eAAEA,GAAmBhC,KAAKiH,QAOjD,GALKzF,IACHmG,EAAOA,EAAKT,eAIVlH,KAAKqG,UAAYsB,EAAM,CACzB,IAAI9E,EAAS,CACX+E,SAAS,EACT9F,MAAO,GAOT,OAJIE,IACFa,EAAOgF,QAAU,CAAC,CAAC,EAAGF,EAAKzI,OAAS,KAG/B2D,CACR,CAGD,MAAMV,SACJA,EAAQE,SACRA,EAAQD,UACRA,EAASH,eACTA,EAAcC,mBACdA,EAAkBe,eAClBA,GACEjD,KAAKiH,QAET,IAAIa,EAAa,GACjB,IAAIC,EAAa,EACjB,IAAIC,GAAa,EAEjBhI,KAAKmH,OAAO/G,SAAQ,EAAGiG,UAASiB,WAAUD,iBACxC,MAAMO,QAAEA,EAAO9F,MAAEA,EAAK+F,QAAEA,GApS9B,EACEF,EACAtB,EACA4B,GACA9F,SACEA,EAAWZ,OAAOY,SAAQE,SAC1BA,EAAWd,OAAOc,SAAQD,UAC1BA,EAAYb,OAAOa,UAASH,eAC5BA,EAAiBV,OAAOU,eAAcC,mBACtCA,EAAqBX,OAAOW,mBAAkBF,eAC9CA,EAAiBT,OAAOS,eAAciB,eACtCA,EAAiB1B,OAAO0B,gBACtB,CAAE,KAEN,GAAIoD,EAAQnH,OAhBG,GAiBb,MAAM,IAAIkC,MApdZ,qCAudA,MAAM8G,EAAa7B,EAAQnH,OAE3B,MAAMiJ,EAAUR,EAAKzI,OAErB,MAAMsH,EAAmB7C,KAAKyE,IAAI,EAAGzE,KAAK0E,IAAIlG,EAAUgG,IAExD,IAAIG,EAAmBlG,EAEvB,IAAImG,EAAe/B,EAInB,MAAMgC,EAAiBtG,EAAqB,GAAKF,EAEjD,MAAMyG,EAAYD,EAAiB/J,MAAM0J,GAAW,GAEpD,IAAIzF,EAGJ,MAAQA,EAAQiF,EAAKe,QAAQrC,EAASkC,KAAkB,GAAG,CACzD,IAAIzG,EAAQsE,eAAeC,EAAS,CAClCE,gBAAiB7D,EACjB8D,mBACAnE,WACAY,mBAMF,GAHAqF,EAAmB3E,KAAK0E,IAAIvG,EAAOwG,GACnCC,EAAe7F,EAAQwF,EAEnBM,EAAgB,CAClB,IAAIzF,EAAI,EACR,KAAOA,EAAImF,GACTO,EAAU/F,EAAQK,GAAK,EACvBA,GAAK,CAER,CACF,CAGDwF,GAAgB,EAEhB,IAAII,EAAa,GACjB,IAAIC,EAAa,EACjB,IAAIC,EAASX,EAAaC,EAE1B,MAAMtB,EAAO,GAAMqB,EAAa,EAEhC,IAAK,IAAInF,EAAI,EAAGA,EAAImF,EAAYnF,GAAK,EAAG,CAItC,IAAI+F,EAAS,EACb,IAAIC,EAASF,EAEb,KAAOC,EAASC,GACA3C,eAAeC,EAAS,CACpCC,OAAQvD,EACRwD,gBAAiBC,EAAmBuC,EACpCvC,mBACAnE,WACAY,oBAGWqF,EACXQ,EAASC,EAETF,EAASE,EAGXA,EAASpF,KAAKqF,OAAOH,EAASC,GAAU,EAAIA,GAI9CD,EAASE,EAET,IAAIE,EAAQtF,KAAKyE,IAAI,EAAG5B,EAAmBuC,EAAS,GACpD,IAAIG,EAASjH,EACTkG,EACAxE,KAAK0E,IAAI7B,EAAmBuC,EAAQZ,GAAWD,EAGnD,IAAIiB,EAAS1K,MAAMyK,EAAS,GAE5BC,EAAOD,EAAS,IAAM,GAAKnG,GAAK,EAEhC,IAAK,IAAIqG,EAAIF,EAAQE,GAAKH,EAAOG,GAAK,EAAG,CACvC,IAAI7C,EAAkB6C,EAAI,EAC1B,IAAIC,EAAYpB,EAAgBN,EAAKZ,OAAOR,IAgB5C,GAdIiC,IAEFC,EAAUlC,MAAsB8C,GAIlCF,EAAOC,IAAOD,EAAOC,EAAI,IAAM,EAAK,GAAKC,EAGrCtG,IACFoG,EAAOC,KACHT,EAAWS,EAAI,GAAKT,EAAWS,KAAO,EAAK,EAAIT,EAAWS,EAAI,IAGhED,EAAOC,GAAKvC,IACd+B,EAAaxC,eAAeC,EAAS,CACnCC,OAAQvD,EACRwD,kBACAC,mBACAnE,WACAY,mBAKE2F,GAAcN,GAAkB,CAMlC,GAJAA,EAAmBM,EACnBL,EAAehC,EAGXgC,GAAgB/B,EAClB,MAIFyC,EAAQtF,KAAKyE,IAAI,EAAG,EAAI5B,EAAmB+B,EAC5C,CAEJ,CAWD,GARcnC,eAAeC,EAAS,CACpCC,OAAQvD,EAAI,EACZwD,gBAAiBC,EACjBA,mBACAnE,WACAY,mBAGUqF,EACV,MAGFK,EAAaQ,CACd,CAED,MAAMtG,EAAS,CACb+E,QAASW,GAAgB,EAEzBzG,MAAO6B,KAAKyE,IAAI,KAAOQ,IAGzB,GAAIJ,EAAgB,CAClB,MAAMX,EA7MV,EACEyB,EAAY,GACZpH,EAAqBX,OAAOW,sBAE5B,IAAI2F,EAAU,GACd,IAAIoB,GAAS,EACb,IAAIzB,GAAO,EACX,IAAIzE,EAAI,EAER,IAAK,IAAIC,EAAMsG,EAAUpK,OAAQ6D,EAAIC,EAAKD,GAAK,EAAG,CAChD,IAAIe,EAAQwF,EAAUvG,GAClBe,GAASmF,KAAW,EACtBA,EAAQlG,EACEe,GAASmF,KAAW,IAC9BzB,EAAMzE,EAAI,EACNyE,EAAMyB,EAAQ,GAAK/G,GACrB2F,EAAQtH,KAAK,CAAC0I,EAAOzB,IAEvByB,GAAS,EAEZ,CAOD,OAJIK,EAAUvG,EAAI,IAAMA,EAAIkG,GAAS/G,GACnC2F,EAAQtH,KAAK,CAAC0I,EAAOlG,EAAI,IAGpB8E,CACT,EAiLoB0B,CAAqBd,EAAWvG,GAC3C2F,EAAQ3I,OAEF8C,IACTa,EAAOgF,QAAUA,GAFjBhF,EAAO+E,SAAU,CAIpB,CAED,OAAO/E,CACT,EA+G0C2G,CAAO7B,EAAMtB,EAASiB,EAAU,CAClEnF,SAAUA,EAAWkF,EACrBhF,WACAD,YACAH,iBACAC,qBACAF,iBACAiB,mBAGE2E,IACFI,GAAa,GAGfD,GAAcjG,EAEV8F,GAAWC,IACbC,EAAa,IAAIA,KAAeD,GACjC,IAGH,IAAIhF,EAAS,CACX+E,QAASI,EACTlG,MAAOkG,EAAaD,EAAa/H,KAAKmH,OAAOjI,OAAS,GAOxD,OAJI8I,GAAchG,IAChBa,EAAOgF,QAAUC,GAGZjF,CACR,EAGH,MAAM4G,UACJ,WAAA3J,CAAYuG,GACVrG,KAAKqG,QAAUA,CAChB,CACD,mBAAOqD,CAAarD,GAClB,OAAOsD,SAAStD,EAASrG,KAAK4J,WAC/B,CACD,oBAAOC,CAAcxD,GACnB,OAAOsD,SAAStD,EAASrG,KAAK8J,YAC/B,CACD,MAAAN,GAAmB,EAGrB,SAASG,SAAStD,EAAS0D,GACzB,MAAMC,EAAU3D,EAAQvC,MAAMiG,GAC9B,OAAOC,EAAUA,EAAQ,GAAK,IAChC,CA8JA,MAAMC,mBAAmBR,UACvB,WAAA3J,CACEuG,GACAlE,SACEA,EAAWZ,OAAOY,SAAQC,UAC1BA,EAAYb,OAAOa,UAASC,SAC5BA,EAAWd,OAAOc,SAAQL,eAC1BA,EAAiBT,OAAOS,eAAcC,eACtCA,EAAiBV,OAAOU,eAAcC,mBACtCA,EAAqBX,OAAOW,mBAAkBV,gBAC9CA,EAAkBD,OAAOC,gBAAeyB,eACxCA,EAAiB1B,OAAO0B,gBACtB,CAAE,GAENiH,MAAM7D,GACNrG,KAAKmK,aAAe,IAAInD,YAAYX,EAAS,CAC3ClE,WACAC,YACAC,WACAL,iBACAC,iBACAC,qBACAV,kBACAyB,kBAEH,CACD,eAAWmH,GACT,MAAO,OACR,CACD,qBAAWR,GACT,MAAO,UACR,CACD,sBAAWE,GACT,MAAO,QACR,CACD,MAAAN,CAAO7B,GACL,OAAO3H,KAAKmK,aAAazC,SAASC,EACnC,EAKH,MAAM0C,qBAAqBZ,UACzB,WAAA3J,CAAYuG,GACV6D,MAAM7D,EACP,CACD,eAAW+D,GACT,MAAO,SACR,CACD,qBAAWR,GACT,MAAO,WACR,CACD,sBAAWE,GACT,MAAO,SACR,CACD,MAAAN,CAAO7B,GACL,IAAIxF,EAAW,EACf,IAAIO,EAEJ,MAAMmF,EAAU,GAChB,MAAMK,EAAalI,KAAKqG,QAAQnH,OAGhC,MAAQwD,EAAQiF,EAAKe,QAAQ1I,KAAKqG,QAASlE,KAAc,GACvDA,EAAWO,EAAQwF,EACnBL,EAAQtH,KAAK,CAACmC,EAAOP,EAAW,IAGlC,MAAMyF,IAAYC,EAAQ3I,OAE1B,MAAO,CACL0I,UACA9F,MAAO8F,EAAU,EAAI,EACrBC,UAEH,EAIH,MAAMyC,UAAY,CAzOlB,MAAMC,mBAAmBd,UACvB,WAAA3J,CAAYuG,GACV6D,MAAM7D,EACP,CACD,eAAW+D,GACT,MAAO,OACR,CACD,qBAAWR,GACT,MAAO,WACR,CACD,sBAAWE,GACT,MAAO,SACR,CACD,MAAAN,CAAO7B,GACL,MAAMC,EAAUD,IAAS3H,KAAKqG,QAE9B,MAAO,CACLuB,UACA9F,MAAO8F,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAG7H,KAAKqG,QAAQnH,OAAS,GAEtC,GAsNDmL,aAtLF,MAAMG,yBAAyBf,UAC7B,WAAA3J,CAAYuG,GACV6D,MAAM7D,EACP,CACD,eAAW+D,GACT,MAAO,cACR,CACD,qBAAWR,GACT,MAAO,YACR,CACD,sBAAWE,GACT,MAAO,UACR,CACD,MAAAN,CAAO7B,GACL,MAAMC,EAAUD,EAAK8C,WAAWzK,KAAKqG,SAErC,MAAO,CACLuB,UACA9F,MAAO8F,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAG7H,KAAKqG,QAAQnH,OAAS,GAEtC,GAKH,MAAMwL,gCAAgCjB,UACpC,WAAA3J,CAAYuG,GACV6D,MAAM7D,EACP,CACD,eAAW+D,GACT,MAAO,sBACR,CACD,qBAAWR,GACT,MAAO,aACR,CACD,sBAAWE,GACT,MAAO,WACR,CACD,MAAAN,CAAO7B,GACL,MAAMC,GAAWD,EAAK8C,WAAWzK,KAAKqG,SAEtC,MAAO,CACLuB,UACA9F,MAAO8F,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAGF,EAAKzI,OAAS,GAE9B,GA+BH,MAAMyL,gCAAgClB,UACpC,WAAA3J,CAAYuG,GACV6D,MAAM7D,EACP,CACD,eAAW+D,GACT,MAAO,sBACR,CACD,qBAAWR,GACT,MAAO,aACR,CACD,sBAAWE,GACT,MAAO,WACR,CACD,MAAAN,CAAO7B,GACL,MAAMC,GAAWD,EAAKiD,SAAS5K,KAAKqG,SACpC,MAAO,CACLuB,UACA9F,MAAO8F,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAGF,EAAKzI,OAAS,GAE9B,GA9CH,MAAM2L,yBAAyBpB,UAC7B,WAAA3J,CAAYuG,GACV6D,MAAM7D,EACP,CACD,eAAW+D,GACT,MAAO,cACR,CACD,qBAAWR,GACT,MAAO,YACR,CACD,sBAAWE,GACT,MAAO,UACR,CACD,MAAAN,CAAO7B,GACL,MAAMC,EAAUD,EAAKiD,SAAS5K,KAAKqG,SAEnC,MAAO,CACLuB,UACA9F,MAAO8F,EAAU,EAAI,EACrBC,QAAS,CAACF,EAAKzI,OAASc,KAAKqG,QAAQnH,OAAQyI,EAAKzI,OAAS,GAE9D,GApGH,MAAM4L,0BAA0BrB,UAC9B,WAAA3J,CAAYuG,GACV6D,MAAM7D,EACP,CACD,eAAW+D,GACT,MAAO,eACR,CACD,qBAAWR,GACT,MAAO,WACR,CACD,sBAAWE,GACT,MAAO,SACR,CACD,MAAAN,CAAO7B,GAEL,MAAMC,EADQD,EAAKe,QAAQ1I,KAAKqG,YACL,EAE3B,MAAO,CACLuB,UACA9F,MAAO8F,EAAU,EAAI,EACrBC,QAAS,CAAC,EAAGF,EAAKzI,OAAS,GAE9B,GAiMD+K,YAGF,MAAMc,aAAeT,UAAUpL,OAG/B,MAAM8L,SAAW,qCAmDjB,MAAMC,cAAgB,IAAIC,IAAI,CAACjB,WAAWG,KAAMC,aAAaD,OAyI7D,MAAMe,oBAAsB,GAM5B,SAASC,eAAe/E,EAASY,GAC/B,IAAK,IAAIlE,EAAI,EAAGC,EAAMmI,oBAAoBjM,OAAQ6D,EAAIC,EAAKD,GAAK,EAAG,CACjE,IAAIsI,EAAgBF,oBAAoBpI,GACxC,GAAIsI,EAAcC,UAAUjF,EAASY,GACnC,OAAO,IAAIoE,EAAchF,EAASY,EAErC,CAED,OAAO,IAAID,YAAYX,EAASY,EAClC,CAEA,MAAMsE,oBACC,OASP,MAAMC,aAAgBC,MACjBA,EAAyB,OAAKA,EAAwB,KAO3D,MAAMC,kBAAqBD,IAAW,CACpCE,CAACJ,qBAAsBpM,OAAOY,KAAK0L,GAAOtF,KAAKzG,IAAS,CACtDA,CAACA,GAAM+L,EAAM/L,SAMjB,SAASkM,MAAMH,EAAOxE,GAAS4E,KAAEA,GAAO,GAAS,IAC/C,MAAMC,KAAQL,IACZ,IAAI1L,EAAOZ,OAAOY,KAAK0L,GAEvB,MAAMM,EAjBK,CAACN,KAAYA,EAAkB,MAiBtBO,CAAOP,GAE3B,IAAKM,GAAehM,EAAKb,OAAS,IAAMsM,aAAaC,GACnD,OAAOK,KAAKJ,kBAAkBD,IAGhC,GArBW,CAACA,IACblN,QAAQkN,IAAU5M,SAAS4M,KAAWD,aAAaC,GAoB9CQ,CAAOR,GAAQ,CACjB,MAAM/L,EAAMqM,EAAcN,EAAkB,MAAI1L,EAAK,GAErD,MAAMsG,EAAU0F,EAAcN,EAAqB,KAAIA,EAAM/L,GAE7D,IAAKf,SAAS0H,GACZ,MAAM,IAAIjF,MAjxC2B,CAAC1B,GAC5C,yBAAyBA,IAgxCHwM,CAAqCxM,IAGvD,MAAMW,EAAM,CACVM,MAAOQ,YAAYzB,GACnB2G,WAOF,OAJIwF,IACFxL,EAAI8L,SAAWf,eAAe/E,EAASY,IAGlC5G,CACR,CAED,IAAI+L,EAAO,CACTC,SAAU,GACVC,SAAUvM,EAAK,IAajB,OAVAA,EAAKK,SAASV,IACZ,MAAMlB,EAAQiN,EAAM/L,GAEhBnB,QAAQC,IACVA,EAAM4B,SAASkF,IACb8G,EAAKC,SAAS9L,KAAKuL,KAAKxG,GAAM,GAEjC,IAGI8G,GAOT,OAJKZ,aAAaC,KAChBA,EAAQC,kBAAkBD,IAGrBK,KAAKL,EACd,CAuBA,SAASc,iBAAiB1J,EAAQ2J,GAChC,MAAMxC,EAAUnH,EAAOmH,QACvBwC,EAAKxC,QAAU,GAEVlL,UAAUkL,IAIfA,EAAQ5J,SAAS0D,IACf,IAAKhF,UAAUgF,EAAM+D,WAAa/D,EAAM+D,QAAQ3I,OAC9C,OAGF,MAAM2I,QAAEA,EAAOrJ,MAAEA,GAAUsF,EAE3B,IAAIzD,EAAM,CACRwH,UACArJ,SAGEsF,EAAMpE,MACRW,EAAIX,IAAMoE,EAAMpE,IAAIsB,KAGlB8C,EAAM/B,KAAO,IACf1B,EAAIoM,SAAW3I,EAAM/B,KAGvByK,EAAKxC,QAAQzJ,KAAKF,EAAI,GAE1B,CAEA,SAASqM,eAAe7J,EAAQ2J,GAC9BA,EAAK1K,MAAQe,EAAOf,KACtB,CAiCA,MAAM6K,KACJ,WAAA7M,CAAY0E,EAAMyC,EAAU,CAAA,EAAIvE,GAC9B1C,KAAKiH,QAAU,IAAK1F,UAAW0F,GAS/BjH,KAAK4M,UAAY,IAAI/M,SAASG,KAAKiH,QAAQlH,MAE3CC,KAAK6M,cAAcrI,EAAM9B,EAC1B,CAED,aAAAmK,CAAcrI,EAAM9B,GAGlB,GAFA1C,KAAK8M,MAAQtI,EAET9B,KAAWA,aAAiBW,WAC9B,MAAM,IAAIjC,MAv6Ca,0BA06CzBpB,KAAK+M,SACHrK,GACAuD,YAAYjG,KAAKiH,QAAQlH,KAAMC,KAAK8M,MAAO,CACzC7L,MAAOjB,KAAKiH,QAAQhG,MACpBkC,gBAAiBnD,KAAKiH,QAAQ9D,iBAEnC,CAED,GAAA8B,CAAIJ,GACG/F,UAAU+F,KAIf7E,KAAK8M,MAAMvM,KAAKsE,GAChB7E,KAAK+M,SAAS9H,IAAIJ,GACnB,CAED,MAAAmI,CAAOC,EAAY,KAAoB,GACrC,MAAMC,EAAU,GAEhB,IAAK,IAAInK,EAAI,EAAGC,EAAMhD,KAAK8M,MAAM5N,OAAQ6D,EAAIC,EAAKD,GAAK,EAAG,CACxD,MAAM8B,EAAM7E,KAAK8M,MAAM/J,GACnBkK,EAAUpI,EAAK9B,KACjB/C,KAAKmF,SAASpC,GACdA,GAAK,EACLC,GAAO,EAEPkK,EAAQ3M,KAAKsE,GAEhB,CAED,OAAOqI,CACR,CAED,QAAA/H,CAASpD,GACP/B,KAAK8M,MAAM1H,OAAOrD,EAAK,GACvB/B,KAAK+M,SAAS5H,SAASpD,EACxB,CAED,QAAAoL,GACE,OAAOnN,KAAK+M,QACb,CAED,MAAAvD,CAAOiC,GAAO2B,MAAEA,GAAQ,GAAO,CAAA,GAC7B,MAAMpL,eACJA,EAAcP,aACdA,EAAYC,WACZA,EAAUC,OACVA,EAAMuB,gBACNA,GACElD,KAAKiH,QAET,IAAIiG,EAAUvO,SAAS8M,GACnB9M,SAASqB,KAAK8M,MAAM,IAClB9M,KAAKqN,kBAAkB5B,GACvBzL,KAAKsN,kBAAkB7B,GACzBzL,KAAKuN,eAAe9B,GAYxB,MAlLJ,EACEyB,GACAhK,gBAAEA,EAAkB3B,OAAO2B,oBAE3BgK,EAAQ9M,SAASyC,IACf,IAAIkF,EAAa,EAEjBlF,EAAOmH,QAAQ5J,SAAQ,EAAGV,MAAK4D,OAAMxB,YACnC,MAAMrB,EAASf,EAAMA,EAAIe,OAAS,KAElCsH,GAAcpE,KAAKC,IACjB9B,IAAU,GAAKrB,EAAS+M,OAAOC,QAAU3L,GACxCrB,GAAU,IAAMyC,EAAkB,EAAII,GACxC,IAGHT,EAAOf,MAAQiG,CAAU,GAE7B,EAsJI2F,CAAaR,EAAS,CAAEhK,oBAEpBxB,GACFwL,EAAQS,KAAKhM,GAGX/C,SAASwO,IAAUA,GAAS,IAC9BF,EAAUA,EAAQU,MAAM,EAAGR,IAvHjC,EACEF,EACA1I,GACAxC,eACEA,EAAiBT,OAAOS,eAAcP,aACtCA,EAAeF,OAAOE,cACpB,CAAE,KAEN,MAAMoM,EAAe,GAKrB,OAHI7L,GAAgB6L,EAAatN,KAAKgM,kBAClC9K,GAAcoM,EAAatN,KAAKmM,gBAE7BQ,EAAQ/G,KAAKtD,IAClB,MAAMd,IAAEA,GAAQc,EAEhB,MAAM2J,EAAO,CACXlH,KAAMd,EAAKzC,GACX0K,SAAU1K,GASZ,OANI8L,EAAa3O,QACf2O,EAAazN,SAAS0N,IACpBA,EAAYjL,EAAQ2J,EAAK,IAItBA,IAEX,EA6FWuB,CAAOb,EAASlN,KAAK8M,MAAO,CACjC9K,iBACAP,gBAEH,CAED,iBAAA4L,CAAkB5B,GAChB,MAAMU,EAAWf,eAAeK,EAAOzL,KAAKiH,SAC5C,MAAMxC,QAAEA,GAAYzE,KAAK+M,SACzB,MAAMG,EAAU,GAmBhB,OAhBAzI,EAAQrE,SAAQ,EAAGoF,EAAGmC,EAAM5E,EAAGhB,EAAKiC,EAAGV,MACrC,IAAKxE,UAAU6I,GACb,OAGF,MAAMC,QAAEA,EAAO9F,MAAEA,EAAK+F,QAAEA,GAAYsE,EAASzE,SAASC,GAElDC,GACFsF,EAAQ3M,KAAK,CACX+E,KAAMqC,EACN5F,MACAiI,QAAS,CAAC,CAAElI,QAAOtD,MAAOmJ,EAAMrE,OAAMuE,aAEzC,IAGIqF,CACR,CAED,cAAAK,CAAe9B,GAEb,MAAMuC,EAAapC,MAAMH,EAAOzL,KAAKiH,SAErC,MAAMgH,SAAW,CAAC7B,EAAM9G,EAAMvD,KAC5B,IAAKqK,EAAKC,SAAU,CAClB,MAAM1L,MAAEA,EAAKwL,SAAEA,GAAaC,EAE5B,MAAMpC,EAAUhK,KAAKkO,aAAa,CAChCxO,IAAKM,KAAK4M,UAAUlM,IAAIC,GACxBnC,MAAOwB,KAAK+M,SAAS1H,uBAAuBC,EAAM3E,GAClDwL,aAGF,OAAInC,GAAWA,EAAQ9K,OACd,CACL,CACE6C,MACAuD,OACA0E,YAKC,EACR,CAED,MAAMmE,EAAM,GACZ,IAAK,IAAIpL,EAAI,EAAGC,EAAMoJ,EAAKC,SAASnN,OAAQ6D,EAAIC,EAAKD,GAAK,EAAG,CAE3D,MAAMF,EAASoL,SADD7B,EAAKC,SAAStJ,GACGuC,EAAMvD,GACrC,GAAIc,EAAO3D,OACTiP,EAAI5N,QAAQsC,QACP,GAAIuJ,EAAKE,WApUjB,OAqUG,MAAO,EAEV,CACD,OAAO6B,GAIT,MAAMC,EAAY,CAAA,EAClB,MAAMlB,EAAU,GAmBhB,OArBgBlN,KAAK+M,SAAStI,QAItBrE,SAAQ,EAAGqF,EAAGH,EAAMvC,MAC1B,GAAIjE,UAAUwG,GAAO,CACnB,IAAI+I,EAAaJ,SAASD,EAAY1I,EAAMvD,GAExCsM,EAAWnP,SAERkP,EAAUrM,KACbqM,EAAUrM,GAAO,CAAEA,MAAKuD,OAAM0E,QAAS,IACvCkD,EAAQ3M,KAAK6N,EAAUrM,KAEzBsM,EAAWjO,SAAQ,EAAG4J,cACpBoE,EAAUrM,GAAKiI,QAAQzJ,QAAQyJ,EAAQ,IAG5C,KAGIkD,CACR,CAED,iBAAAI,CAAkB7B,GAChB,MAAMU,EAAWf,eAAeK,EAAOzL,KAAKiH,SAC5C,MAAMlH,KAAEA,EAAI0E,QAAEA,GAAYzE,KAAK+M,SAC/B,MAAMG,EAAU,GA8BhB,OA3BAzI,EAAQrE,SAAQ,EAAGqF,EAAGH,EAAMvC,EAAGhB,MAC7B,IAAKjD,UAAUwG,GACb,OAGF,IAAI0E,EAAU,GAGdjK,EAAKK,SAAQ,CAACV,EAAKgG,KACjBsE,EAAQzJ,QACHP,KAAKkO,aAAa,CACnBxO,MACAlB,MAAO8G,EAAKI,GACZyG,aAEH,IAGCnC,EAAQ9K,QACVgO,EAAQ3M,KAAK,CACXwB,MACAuD,OACA0E,WAEH,IAGIkD,CACR,CACD,YAAAgB,EAAaxO,IAAEA,EAAGlB,MAAEA,EAAK2N,SAAEA,IACzB,IAAKrN,UAAUN,GACb,MAAO,GAGT,IAAIwL,EAAU,GAEd,GAAIzL,QAAQC,GACVA,EAAM4B,SAAQ,EAAGoF,EAAGmC,EAAM5E,EAAQiB,EAAGV,MACnC,IAAKxE,UAAU6I,GACb,OAGF,MAAMC,QAAEA,EAAO9F,MAAEA,EAAK+F,QAAEA,GAAYsE,EAASzE,SAASC,GAElDC,GACFoC,EAAQzJ,KAAK,CACXuB,QACApC,MACAlB,MAAOmJ,EACP5F,MACAuB,OACAuE,WAEH,QAEE,CACL,MAAQrC,EAAGmC,EAAM3D,EAAGV,GAAS9E,EAE7B,MAAMoJ,QAAEA,EAAO9F,MAAEA,EAAK+F,QAAEA,GAAYsE,EAASzE,SAASC,GAElDC,GACFoC,EAAQzJ,KAAK,CAAEuB,QAAOpC,MAAKlB,MAAOmJ,EAAMrE,OAAMuE,WAEjD,CAED,OAAOmC,CACR,EAGH2C,KAAK2B,QAAU,QACf3B,KAAK1G,YAAcA,YACnB0G,KAAK4B,WArxCL,CACE/B,GACAvL,MAAEA,EAAQM,OAAON,MAAKkC,gBAAEA,EAAkB5B,OAAO4B,iBAAoB,CAAE,KAEvE,MAAMpD,KAAEA,EAAI0E,QAAEA,GAAY+H,EAC1B,MAAMtG,EAAU,IAAI7C,UAAU,CAAEpC,QAAOkC,oBAGvC,OAFA+C,EAAQxB,QAAQ3E,GAChBmG,EAAQ5B,gBAAgBG,GACjByB,CACT,EA6wCAyG,KAAK6B,OAASjN,OAGZoL,KAAK8B,WAAa7C,MAnclBT,oBAAoB5K,KA9GtB,MAAMmO,eACJ,WAAA5O,CACEuG,GACA7E,gBACEA,EAAkBD,OAAOC,gBAAeQ,eACxCA,EAAiBT,OAAOS,eAAcE,mBACtCA,EAAqBX,OAAOW,mBAAkBe,eAC9CA,EAAiB1B,OAAO0B,eAAchB,eACtCA,EAAiBV,OAAOU,eAAcE,SACtCA,EAAWZ,OAAOY,SAAQC,UAC1BA,EAAYb,OAAOa,UAASC,SAC5BA,EAAWd,OAAOc,UAChB,CAAE,GAENrC,KAAKyL,MAAQ,KACbzL,KAAKiH,QAAU,CACbzF,kBACAQ,iBACAE,qBACAD,iBACAgB,iBACAd,WACAC,YACAC,YAGFrC,KAAKqG,QAAU7E,EAAkB6E,EAAUA,EAAQa,cACnDlH,KAAKyL,MAtGT,EAAoBpF,EAASY,EAAU,KAsGXjH,KAAKqG,QArGhBhF,MANA,KAMgB8E,KAAKb,IAClC,IAAImG,EAAQnG,EACTrG,OACAoC,MAAM2J,UACN2D,QAAQrJ,GAASA,KAAUA,EAAKrG,SAEnC,IAAIiO,EAAU,GACd,IAAK,IAAInK,EAAI,EAAGC,EAAMyI,EAAMvM,OAAQ6D,EAAIC,EAAKD,GAAK,EAAG,CACnD,MAAM6L,EAAYnD,EAAM1I,GAGxB,IAAI8L,GAAQ,EACZ,IAAI9M,GAAO,EACX,MAAQ8M,KAAW9M,EAAMgJ,cAAc,CACrC,MAAMoB,EAAW7B,UAAUvI,GAC3B,IAAI+M,EAAQ3C,EAASzC,aAAakF,GAC9BE,IACF5B,EAAQ3M,KAAK,IAAI4L,EAAS2C,EAAO7H,IACjC4H,GAAQ,EAEX,CAED,IAAIA,EAMJ,IADA9M,GAAO,IACEA,EAAMgJ,cAAc,CAC3B,MAAMoB,EAAW7B,UAAUvI,GAC3B,IAAI+M,EAAQ3C,EAAStC,cAAc+E,GACnC,GAAIE,EAAO,CACT5B,EAAQ3M,KAAK,IAAI4L,EAAS2C,EAAO7H,IACjC,KACD,CACF,CACF,CAED,OAAOiG,KA+DMuB,CAAWzO,EAAcA,KAAKiH,QAC5C,CAED,gBAAOqE,CAAUyD,EAAG9H,GAClB,OAAOA,EAAQ3E,iBAChB,CAED,QAAAoF,CAASC,GACP,MAAM8D,EAAQzL,KAAKyL,MAEnB,IAAKA,EACH,MAAO,CACL7D,SAAS,EACT9F,MAAO,GAIX,MAAME,eAAEA,EAAcR,gBAAEA,GAAoBxB,KAAKiH,QAEjDU,EAAOnG,EAAkBmG,EAAOA,EAAKT,cAErC,IAAI8H,EAAa,EACjB,IAAIlH,EAAa,GACjB,IAAIC,EAAa,EAGjB,IAAK,IAAIhF,EAAI,EAAGkM,EAAOxD,EAAMvM,OAAQ6D,EAAIkM,EAAMlM,GAAK,EAAG,CACrD,MAAMuH,EAAYmB,EAAM1I,GAGxB+E,EAAW5I,OAAS,EACpB8P,EAAa,EAGb,IAAK,IAAI5F,EAAI,EAAG8F,EAAO5E,EAAUpL,OAAQkK,EAAI8F,EAAM9F,GAAK,EAAG,CACzD,MAAM+C,EAAW7B,EAAUlB,GAC3B,MAAMxB,QAAEA,EAAOC,QAAEA,EAAO/F,MAAEA,GAAUqK,EAAS3C,OAAO7B,GAEpD,IAAIC,EAWG,CACLG,EAAa,EACbiH,EAAa,EACblH,EAAW5I,OAAS,EACpB,KACD,CAfC8P,GAAc,EACdjH,GAAcjG,EACVE,IAEEiJ,cAAclH,IADLoI,EAASrM,YAAYsK,MAEhCtC,EAAa,IAAIA,KAAeD,GAEhCC,EAAWvH,KAAKsH,GASvB,CAGD,GAAImH,EAAY,CACd,IAAInM,EAAS,CACX+E,SAAS,EACT9F,MAAOiG,EAAaiH,GAOtB,OAJIhN,IACFa,EAAOgF,QAAUC,GAGZjF,CACR,CACF,CAGD,MAAO,CACL+E,SAAS,EACT9F,MAAO,EAEV","x_google_ignoreList":[0]}

package/external/.pnpm/fuse.js@7.0.0/node_modules/fuse.js/dist/fuse.mjs

@@ -1,2 +0,0 @@
-function isArray(e){return Array.isArray?Array.isArray(e):getTag(e)==='[object Array]'}function isString(e){return typeof e=='string'}function isNumber(e){return typeof e=='number'}function isObject(e){return typeof e=='object'}function isDefined(e){return e!==void 0&&e!==null}function isBlank(e){return!e.trim().length}function getTag(e){return e==null?e===void 0?'[object Undefined]':'[object Null]':{}.toString.call(e)}const MISSING_KEY_PROPERTY=e=>`Missing ${e} property in key`;const INVALID_KEY_WEIGHT_VALUE=e=>`Property 'weight' in key '${e}' must be a positive integer`;const hasOwn={}.hasOwnProperty;class KeyStore{constructor(e){this._keys=[],this._keyMap={};let t=0;e.forEach((e=>{let s=createKey(e);this._keys.push(s),this._keyMap[s.id]=s,t+=s.weight})),this._keys.forEach((e=>{e.weight/=t}))}get(e){return this._keyMap[e]}keys(){return this._keys}toJSON(){return JSON.stringify(this._keys)}}function createKey(e){let t=null;let s=null;let n=null;let i=1;let r=null;if(isString(e)||isArray(e))n=e,t=createKeyPath(e),s=createKeyId(e);else{if(!hasOwn.call(e,'name'))throw new Error(MISSING_KEY_PROPERTY('name'));const c=e.name;if(n=c,hasOwn.call(e,'weight')&&(i=e.weight,i<=0))throw new Error(INVALID_KEY_WEIGHT_VALUE(c));t=createKeyPath(c),s=createKeyId(c),r=e.getFn}return{path:t,id:s,weight:i,src:n,getFn:r}}function createKeyPath(e){return isArray(e)?e:e.split('.')}function createKeyId(e){return isArray(e)?e.join('.'):e}var Config={isCaseSensitive:!1,includeScore:!1,keys:[],shouldSort:!0,sortFn:(e,t)=>e.score===t.score?e.idx<t.idx?-1:1:e.score<t.score?-1:1,includeMatches:!1,findAllMatches:!1,minMatchCharLength:1,location:0,threshold:.6,distance:100,useExtendedSearch:!1,getFn:(e,t)=>{let s=[];let n=!1;const deepGet=(e,t,i)=>{if(isDefined(e))if(t[i]){const r=e[t[i]];if(!isDefined(r))return;if(i===t.length-1&&(isString(r)||isNumber(r)||(e=>e===!0||e===!1||(e=>isObject(e)&&e!==null)(e)&&getTag(e)=='[object Boolean]')(r)))s.push((e=>e==null?'':(e=>{if(typeof e=='string')return e;let t=e+'';return t=='0'&&1/e==-1/0?'-0':t})(e))(r));else if(isArray(r)){n=!0;for(let e=0,s=r.length;e<s;e+=1)deepGet(r[e],t,i+1)}else t.length&&deepGet(r,t,i+1)}else s.push(e)};return deepGet(e,isString(t)?t.split('.'):t,0),n?s:s[0]},ignoreLocation:!1,ignoreFieldNorm:!1,fieldNormWeight:1};const SPACE=/[^ ]+/g;class FuseIndex{constructor({getFn:e=Config.getFn,fieldNormWeight:t=Config.fieldNormWeight}={}){this.norm=((e=1,t=3)=>{const s=new Map;const n=Math.pow(10,t);return{get(t){const i=t.match(SPACE).length;if(s.has(i))return s.get(i);const r=1/Math.pow(i,.5*e);const c=parseFloat(Math.round(r*n)/n);return s.set(i,c),c},clear(){s.clear()}}})(t,3),this.getFn=e,this.isCreated=!1,this.setIndexRecords()}setSources(e=[]){this.docs=e}setIndexRecords(e=[]){this.records=e}setKeys(e=[]){this.keys=e,this._keysMap={},e.forEach(((e,t)=>{this._keysMap[e.id]=t}))}create(){!this.isCreated&&this.docs.length&&(this.isCreated=!0,isString(this.docs[0])?this.docs.forEach(((e,t)=>{this._addString(e,t)})):this.docs.forEach(((e,t)=>{this._addObject(e,t)})),this.norm.clear())}add(e){const t=this.size();isString(e)?this._addString(e,t):this._addObject(e,t)}removeAt(e){this.records.splice(e,1);for(let t=e,s=this.size();t<s;t+=1)this.records[t].i-=1}getValueForItemAtKeyId(e,t){return e[this._keysMap[t]]}size(){return this.records.length}_addString(e,t){if(!isDefined(e)||isBlank(e))return;let s={v:e,i:t,n:this.norm.get(e)};this.records.push(s)}_addObject(e,t){let s={i:t,$:{}};this.keys.forEach(((t,n)=>{let i=t.getFn?t.getFn(e):this.getFn(e,t.path);if(isDefined(i))if(isArray(i)){let e=[];const t=[{nestedArrIndex:-1,value:i}];for(;t.length;){const{nestedArrIndex:s,value:n}=t.pop();if(isDefined(n))if(isString(n)&&!isBlank(n)){let t={v:n,i:s,n:this.norm.get(n)};e.push(t)}else isArray(n)&&n.forEach(((e,s)=>{t.push({nestedArrIndex:s,value:e})}))}s.$[n]=e}else if(isString(i)&&!isBlank(i)){let e={v:i,n:this.norm.get(i)};s.$[n]=e}})),this.records.push(s)}toJSON(){return{keys:this.keys,records:this.records}}}function createIndex(e,t,{getFn:s=Config.getFn,fieldNormWeight:n=Config.fieldNormWeight}={}){const i=new FuseIndex({getFn:s,fieldNormWeight:n});return i.setKeys(e.map(createKey)),i.setSources(t),i.create(),i}function computeScore$1(e,{errors:t=0,currentLocation:s=0,expectedLocation:n=0,distance:i=Config.distance,ignoreLocation:r=Config.ignoreLocation}={}){const c=t/e.length;if(r)return c;const o=Math.abs(n-s);return i?c+o/i:o?1:c}function createPatternAlphabet(e){let t={};for(let s=0,n=e.length;s<n;s+=1){const i=e.charAt(s);t[i]=(t[i]||0)|1<<n-s-1}return t}class BitapSearch{constructor(e,{location:t=Config.location,threshold:s=Config.threshold,distance:n=Config.distance,includeMatches:i=Config.includeMatches,findAllMatches:r=Config.findAllMatches,minMatchCharLength:c=Config.minMatchCharLength,isCaseSensitive:o=Config.isCaseSensitive,ignoreLocation:a=Config.ignoreLocation}={}){if(this.options={location:t,threshold:s,distance:n,includeMatches:i,findAllMatches:r,minMatchCharLength:c,isCaseSensitive:o,ignoreLocation:a},this.pattern=o?e:e.toLowerCase(),this.chunks=[],!this.pattern.length)return;const addChunk=(e,t)=>{this.chunks.push({pattern:e,alphabet:createPatternAlphabet(e),startIndex:t})};const h=this.pattern.length;if(h>32){let e=0;const t=h%32;const s=h-t;for(;e<s;)addChunk(this.pattern.substr(e,32),e),e+=32;if(t){const e=h-32;addChunk(this.pattern.substr(e),e)}}else addChunk(this.pattern,0)}searchIn(e){const{isCaseSensitive:t,includeMatches:s}=this.options;if(t||(e=e.toLowerCase()),this.pattern===e){let t={isMatch:!0,score:0};return s&&(t.indices=[[0,e.length-1]]),t}const{location:n,distance:i,threshold:r,findAllMatches:c,minMatchCharLength:o,ignoreLocation:a}=this.options;let h=[];let l=0;let u=!1;this.chunks.forEach((({pattern:t,alphabet:d,startIndex:g})=>{const{isMatch:f,score:p,indices:M}=((e,t,s,{location:n=Config.location,distance:i=Config.distance,threshold:r=Config.threshold,findAllMatches:c=Config.findAllMatches,minMatchCharLength:o=Config.minMatchCharLength,includeMatches:a=Config.includeMatches,ignoreLocation:h=Config.ignoreLocation}={})=>{if(t.length>32)throw new Error("Pattern length exceeds max of 32.");const l=t.length;const u=e.length;const d=Math.max(0,Math.min(n,u));let g=r;let f=d;const p=o>1||a;const M=p?Array(u):[];let m;for(;(m=e.indexOf(t,f))>-1;){let e=computeScore$1(t,{currentLocation:m,expectedLocation:d,distance:i,ignoreLocation:h});if(g=Math.min(e,g),f=m+l,p){let e=0;for(;e<l;)M[m+e]=1,e+=1}}f=-1;let x=[];let y=1;let C=l+u;const S=1<<l-1;for(let n=0;n<l;n+=1){let r=0;let o=C;for(;r<o;)computeScore$1(t,{errors:n,currentLocation:d+o,expectedLocation:d,distance:i,ignoreLocation:h})<=g?r=o:C=o,o=Math.floor((C-r)/2+r);C=o;let a=Math.max(1,d-o+1);let m=c?u:Math.min(d+o,u)+l;let L=Array(m+2);L[m+1]=(1<<n)-1;for(let r=m;r>=a;r-=1){let c=r-1;let o=s[e.charAt(c)];if(p&&(M[c]=+!!o),L[r]=(L[r+1]<<1|1)&o,n&&(L[r]|=(x[r+1]|x[r])<<1|1|x[r+1]),L[r]&S&&(y=computeScore$1(t,{errors:n,currentLocation:c,expectedLocation:d,distance:i,ignoreLocation:h}),y<=g)){if(g=y,f=c,f<=d)break;a=Math.max(1,2*d-f)}}if(computeScore$1(t,{errors:n+1,currentLocation:d,expectedLocation:d,distance:i,ignoreLocation:h})>g)break;x=L}const L={isMatch:f>=0,score:Math.max(.001,y)};if(p){const e=((e=[],t=Config.minMatchCharLength)=>{let s=[];let n=-1;let i=-1;let r=0;for(let c=e.length;r<c;r+=1){let c=e[r];c&&n===-1?n=r:c||n===-1||(i=r-1,i-n+1>=t&&s.push([n,i]),n=-1)}return e[r-1]&&r-n>=t&&s.push([n,r-1]),s})(M,o);e.length?a&&(L.indices=e):L.isMatch=!1}return L})(e,t,d,{location:n+g,distance:i,threshold:r,findAllMatches:c,minMatchCharLength:o,includeMatches:s,ignoreLocation:a});f&&(u=!0),l+=p,f&&M&&(h=[...h,...M])}));let d={isMatch:u,score:u?l/this.chunks.length:1};return u&&s&&(d.indices=h),d}}class BaseMatch{constructor(e){this.pattern=e}static isMultiMatch(e){return getMatch(e,this.multiRegex)}static isSingleMatch(e){return getMatch(e,this.singleRegex)}search(){}}function getMatch(e,t){const s=e.match(t);return s?s[1]:null}class FuzzyMatch extends BaseMatch{constructor(e,{location:t=Config.location,threshold:s=Config.threshold,distance:n=Config.distance,includeMatches:i=Config.includeMatches,findAllMatches:r=Config.findAllMatches,minMatchCharLength:c=Config.minMatchCharLength,isCaseSensitive:o=Config.isCaseSensitive,ignoreLocation:a=Config.ignoreLocation}={}){super(e),this._bitapSearch=new BitapSearch(e,{location:t,threshold:s,distance:n,includeMatches:i,findAllMatches:r,minMatchCharLength:c,isCaseSensitive:o,ignoreLocation:a})}static get type(){return'fuzzy'}static get multiRegex(){return/^"(.*)"$/}static get singleRegex(){return/^(.*)$/}search(e){return this._bitapSearch.searchIn(e)}}class IncludeMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'include'}static get multiRegex(){return/^'"(.*)"$/}static get singleRegex(){return/^'(.*)$/}search(e){let t=0;let s;const n=[];const i=this.pattern.length;for(;(s=e.indexOf(this.pattern,t))>-1;)t=s+i,n.push([s,t-1]);const r=!!n.length;return{isMatch:r,score:r?0:1,indices:n}}}const searchers=[class ExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'exact'}static get multiRegex(){return/^="(.*)"$/}static get singleRegex(){return/^=(.*)$/}search(e){const t=e===this.pattern;return{isMatch:t,score:t?0:1,indices:[0,this.pattern.length-1]}}},IncludeMatch,class PrefixExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'prefix-exact'}static get multiRegex(){return/^\^"(.*)"$/}static get singleRegex(){return/^\^(.*)$/}search(e){const t=e.startsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,this.pattern.length-1]}}},class InversePrefixExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'inverse-prefix-exact'}static get multiRegex(){return/^!\^"(.*)"$/}static get singleRegex(){return/^!\^(.*)$/}search(e){const t=!e.startsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},class InverseSuffixExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'inverse-suffix-exact'}static get multiRegex(){return/^!"(.*)"\$$/}static get singleRegex(){return/^!(.*)\$$/}search(e){const t=!e.endsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},class SuffixExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'suffix-exact'}static get multiRegex(){return/^"(.*)"\$$/}static get singleRegex(){return/^(.*)\$$/}search(e){const t=e.endsWith(this.pattern);return{isMatch:t,score:t?0:1,indices:[e.length-this.pattern.length,e.length-1]}}},class InverseExactMatch extends BaseMatch{constructor(e){super(e)}static get type(){return'inverse-exact'}static get multiRegex(){return/^!"(.*)"$/}static get singleRegex(){return/^!(.*)$/}search(e){const t=e.indexOf(this.pattern)===-1;return{isMatch:t,score:t?0:1,indices:[0,e.length-1]}}},FuzzyMatch];const searchersLen=searchers.length;const SPACE_RE=/ +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/;const MultiMatchSet=new Set([FuzzyMatch.type,IncludeMatch.type]);const registeredSearchers=[];function createSearcher(e,t){for(let s=0,n=registeredSearchers.length;s<n;s+=1){let n=registeredSearchers[s];if(n.condition(e,t))return new n(e,t)}return new BitapSearch(e,t)}const LogicalOperator_AND='$and';const isExpression=e=>!(!e.$and&&!e.$or);const convertToExplicit=e=>({[LogicalOperator_AND]:Object.keys(e).map((t=>({[t]:e[t]})))});function parse(e,t,{auto:s=!0}={}){const next=e=>{let n=Object.keys(e);const i=(e=>!!e.$path)(e);if(!i&&n.length>1&&!isExpression(e))return next(convertToExplicit(e));if((e=>!isArray(e)&&isObject(e)&&!isExpression(e))(e)){const r=i?e.$path:n[0];const c=i?e.$val:e[r];if(!isString(c))throw new Error((e=>`Invalid value for key ${e}`)(r));const o={keyId:createKeyId(r),pattern:c};return s&&(o.searcher=createSearcher(c,t)),o}let r={children:[],operator:n[0]};return n.forEach((t=>{const s=e[t];isArray(s)&&s.forEach((e=>{r.children.push(next(e))}))})),r};return isExpression(e)||(e=convertToExplicit(e)),next(e)}function transformMatches(e,t){const s=e.matches;t.matches=[],isDefined(s)&&s.forEach((e=>{if(!isDefined(e.indices)||!e.indices.length)return;const{indices:s,value:n}=e;let i={indices:s,value:n};e.key&&(i.key=e.key.src),e.idx>-1&&(i.refIndex=e.idx),t.matches.push(i)}))}function transformScore(e,t){t.score=e.score}class Fuse{constructor(e,t={},s){this.options={...Config,...t},this._keyStore=new KeyStore(this.options.keys),this.setCollection(e,s)}setCollection(e,t){if(this._docs=e,t&&!(t instanceof FuseIndex))throw new Error("Incorrect 'index' type");this._myIndex=t||createIndex(this.options.keys,this._docs,{getFn:this.options.getFn,fieldNormWeight:this.options.fieldNormWeight})}add(e){isDefined(e)&&(this._docs.push(e),this._myIndex.add(e))}remove(e=()=>!1){const t=[];for(let s=0,n=this._docs.length;s<n;s+=1){const i=this._docs[s];e(i,s)&&(this.removeAt(s),s-=1,n-=1,t.push(i))}return t}removeAt(e){this._docs.splice(e,1),this._myIndex.removeAt(e)}getIndex(){return this._myIndex}search(e,{limit:t=-1}={}){const{includeMatches:s,includeScore:n,shouldSort:i,sortFn:r,ignoreFieldNorm:c}=this.options;let o=isString(e)?isString(this._docs[0])?this._searchStringList(e):this._searchObjectList(e):this._searchLogical(e);return((e,{ignoreFieldNorm:t=Config.ignoreFieldNorm})=>{e.forEach((e=>{let s=1;e.matches.forEach((({key:e,norm:n,score:i})=>{const r=e?e.weight:null;s*=Math.pow(i===0&&r?Number.EPSILON:i,(r||1)*(t?1:n))})),e.score=s}))})(o,{ignoreFieldNorm:c}),i&&o.sort(r),isNumber(t)&&t>-1&&(o=o.slice(0,t)),((e,t,{includeMatches:s=Config.includeMatches,includeScore:n=Config.includeScore}={})=>{const i=[];return s&&i.push(transformMatches),n&&i.push(transformScore),e.map((e=>{const{idx:s}=e;const n={item:t[s],refIndex:s};return i.length&&i.forEach((t=>{t(e,n)})),n}))})(o,this._docs,{includeMatches:s,includeScore:n})}_searchStringList(e){const t=createSearcher(e,this.options);const{records:s}=this._myIndex;const n=[];return s.forEach((({v:e,i:s,n:i})=>{if(!isDefined(e))return;const{isMatch:r,score:c,indices:o}=t.searchIn(e);r&&n.push({item:e,idx:s,matches:[{score:c,value:e,norm:i,indices:o}]})})),n}_searchLogical(e){const t=parse(e,this.options);const evaluate=(e,t,s)=>{if(!e.children){const{keyId:n,searcher:i}=e;const r=this._findMatches({key:this._keyStore.get(n),value:this._myIndex.getValueForItemAtKeyId(t,n),searcher:i});return r&&r.length?[{idx:s,item:t,matches:r}]:[]}const n=[];for(let i=0,r=e.children.length;i<r;i+=1){const r=evaluate(e.children[i],t,s);if(r.length)n.push(...r);else if(e.operator==="$and")return[]}return n};const s={};const n=[];return this._myIndex.records.forEach((({$:e,i})=>{if(isDefined(e)){let r=evaluate(t,e,i);r.length&&(s[i]||(s[i]={idx:i,item:e,matches:[]},n.push(s[i])),r.forEach((({matches:e})=>{s[i].matches.push(...e)})))}})),n}_searchObjectList(e){const t=createSearcher(e,this.options);const{keys:s,records:n}=this._myIndex;const i=[];return n.forEach((({$:e,i:n})=>{if(!isDefined(e))return;let r=[];s.forEach(((s,n)=>{r.push(...this._findMatches({key:s,value:e[n],searcher:t}))})),r.length&&i.push({idx:n,item:e,matches:r})})),i}_findMatches({key:e,value:t,searcher:s}){if(!isDefined(t))return[];let n=[];if(isArray(t))t.forEach((({v:t,i,n:r})=>{if(!isDefined(t))return;const{isMatch:c,score:o,indices:a}=s.searchIn(t);c&&n.push({score:o,key:e,value:t,idx:i,norm:r,indices:a})}));else{const{v:i,n:r}=t;const{isMatch:c,score:o,indices:a}=s.searchIn(i);c&&n.push({score:o,key:e,value:i,norm:r,indices:a})}return n}}Fuse.version='7.0.0',Fuse.createIndex=createIndex,Fuse.parseIndex=(e,{getFn:t=Config.getFn,fieldNormWeight:s=Config.fieldNormWeight}={})=>{const{keys:n,records:i}=e;const r=new FuseIndex({getFn:t,fieldNormWeight:s});return r.setKeys(n),r.setIndexRecords(i),r},Fuse.config=Config,Fuse.parseQuery=parse,registeredSearchers.push(class ExtendedSearch{constructor(e,{isCaseSensitive:t=Config.isCaseSensitive,includeMatches:s=Config.includeMatches,minMatchCharLength:n=Config.minMatchCharLength,ignoreLocation:i=Config.ignoreLocation,findAllMatches:r=Config.findAllMatches,location:c=Config.location,threshold:o=Config.threshold,distance:a=Config.distance}={}){this.query=null,this.options={isCaseSensitive:t,includeMatches:s,minMatchCharLength:n,findAllMatches:r,ignoreLocation:i,location:c,threshold:o,distance:a},this.pattern=t?e:e.toLowerCase(),this.query=((e,t={})=>this.pattern.split("|").map((e=>{let s=e.trim().split(SPACE_RE).filter((e=>e&&!!e.trim()));let n=[];for(let e=0,i=s.length;e<i;e+=1){const i=s[e];let r=!1;let c=-1;for(;!r&&++c<searchersLen;){const e=searchers[c];let s=e.isMultiMatch(i);s&&(n.push(new e(s,t)),r=!0)}if(!r)for(c=-1;++c<searchersLen;){const e=searchers[c];let s=e.isSingleMatch(i);if(s){n.push(new e(s,t));break}}}return n})))(0,this.options)}static condition(e,t){return t.useExtendedSearch}searchIn(e){const t=this.query;if(!t)return{isMatch:!1,score:1};const{includeMatches:s,isCaseSensitive:n}=this.options;e=n?e:e.toLowerCase();let i=0;let r=[];let c=0;for(let n=0,o=t.length;n<o;n+=1){const o=t[n];r.length=0,i=0;for(let t=0,n=o.length;t<n;t+=1){const n=o[t];const{isMatch:a,indices:h,score:l}=n.search(e);if(!a){c=0,i=0,r.length=0;break}i+=1,c+=l,s&&(MultiMatchSet.has(n.constructor.type)?r=[...r,...h]:r.push(h))}if(i){let e={isMatch:!0,score:c/i};return s&&(e.indices=r),e}}return{isMatch:!1,score:1}}});export{Fuse as default};
-//# sourceMappingURL=fuse.mjs.map