@easyv/biz-components 0.0.52-beta.1 → 0.0.52-beta.2

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/equals.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"equals.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/equals.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport * as arrays from './arrays.js';\n/**\n * Compares two items for equality using strict equality.\n*/\nexport const strictEquals = (a, b) => a === b;\n/**\n * Checks if the items of two arrays are equal.\n * By default, strict equality is used to compare elements, but a custom equality comparer can be provided.\n */\nexport function itemsEquals(itemEquals = strictEquals) {\n    return (a, b) => arrays.equals(a, b, itemEquals);\n}\n/**\n * Uses `item.equals(other)` to determine equality.\n */\nexport function itemEquals() {\n    return (a, b) => a.equals(b);\n}\nexport function equalsIfDefined(equalsOrV1, v2, equals) {\n    if (equals !== undefined) {\n        const v1 = equalsOrV1;\n        if (v1 === undefined || v1 === null || v2 === undefined || v2 === null) {\n            return v2 === v1;\n        }\n        return equals(v1, v2);\n    }\n    else {\n        const equals = equalsOrV1;\n        return (v1, v2) => {\n            if (v1 === undefined || v1 === null || v2 === undefined || v2 === null) {\n                return v2 === v1;\n            }\n            return equals(v1, v2);\n        };\n    }\n}\n/**\n * Drills into arrays (items ordered) and objects (keys unordered) and uses strict equality on everything else.\n*/\nexport function structuralEquals(a, b) {\n    if (a === b) {\n        return true;\n    }\n    if (Array.isArray(a) && Array.isArray(b)) {\n        if (a.length !== b.length) {\n            return false;\n        }\n        for (let i = 0; i < a.length; i++) {\n            if (!structuralEquals(a[i], b[i])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    if (a && typeof a === 'object' && b && typeof b === 'object') {\n        if (Object.getPrototypeOf(a) === Object.prototype && Object.getPrototypeOf(b) === Object.prototype) {\n            const aObj = a;\n            const bObj = b;\n            const keysA = Object.keys(aObj);\n            const keysB = Object.keys(bObj);\n            const keysBSet = new Set(keysB);\n            if (keysA.length !== keysB.length) {\n                return false;\n            }\n            for (const key of keysA) {\n                if (!keysBSet.has(key)) {\n                    return false;\n                }\n                if (!structuralEquals(aObj[key], bObj[key])) {\n                    return false;\n                }\n            }\n            return true;\n        }\n    }\n    return false;\n}\nconst objIds = new WeakMap();\n"],"names":["itemEquals","arrays.equals","equals","v2"],"mappings":";AAQY,MAAC,eAAe,CAAC,GAAG,MAAM,MAAM;AAKrC,SAAS,YAAYA,cAAa,cAAc;AACnD,SAAO,CAAC,GAAG,MAAMC,OAAc,GAAG,GAAGD,WAAU;AACnD;AAIO,SAAS,aAAa;AACzB,SAAO,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC;AAC/B;AACO,SAAS,gBAAgB,YAAY,IAAIE,SAAQ;AACpD,MAAIA,YAAW,QAAW;AACtB,UAAM,KAAK;AACX,QAAI,OAAO,UAAa,OAAO,QAAQ,OAAO,UAAa,OAAO,MAAM;AACpE,aAAO,OAAO;AAAA,IAC1B;AACQ,WAAOA,QAAO,IAAI,EAAE;AAAA,EAC5B,OACS;AACD,UAAMA,UAAS;AACf,WAAO,CAAC,IAAIC,QAAO;AACf,UAAI,OAAO,UAAa,OAAO,QAAQA,QAAO,UAAaA,QAAO,MAAM;AACpE,eAAOA,QAAO;AAAA,MAC9B;AACY,aAAOD,QAAO,IAAIC,GAAE;AAAA,IACvB;AAAA,EACT;AACA;AAIO,SAAS,iBAAiB,GAAG,GAAG;AACnC,MAAI,MAAM,GAAG;AACT,WAAO;AAAA,EACf;AACI,MAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;AACtC,QAAI,EAAE,WAAW,EAAE,QAAQ;AACvB,aAAO;AAAA,IACnB;AACQ,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AAC/B,UAAI,CAAC,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG;AAC/B,eAAO;AAAA,MACvB;AAAA,IACA;AACQ,WAAO;AAAA,EACf;AACI,MAAI,KAAK,OAAO,MAAM,YAAY,KAAK,OAAO,MAAM,UAAU;AAC1D,QAAI,OAAO,eAAe,CAAC,MAAM,OAAO,aAAa,OAAO,eAAe,CAAC,MAAM,OAAO,WAAW;AAChG,YAAM,OAAO;AACb,YAAM,OAAO;AACb,YAAM,QAAQ,OAAO,KAAK,IAAI;AAC9B,YAAM,QAAQ,OAAO,KAAK,IAAI;AAC9B,YAAM,WAAW,IAAI,IAAI,KAAK;AAC9B,UAAI,MAAM,WAAW,MAAM,QAAQ;AAC/B,eAAO;AAAA,MACvB;AACY,iBAAW,OAAO,OAAO;AACrB,YAAI,CAAC,SAAS,IAAI,GAAG,GAAG;AACpB,iBAAO;AAAA,QAC3B;AACgB,YAAI,CAAC,iBAAiB,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC,GAAG;AACzC,iBAAO;AAAA,QAC3B;AAAA,MACA;AACY,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO;AACX;","x_google_ignoreList":[0]}
+{"version":3,"file":"equals.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/equals.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport * as arrays from './arrays.js';\n/**\n * Compares two items for equality using strict equality.\n*/\nexport const strictEquals = (a, b) => a === b;\n/**\n * Checks if the items of two arrays are equal.\n * By default, strict equality is used to compare elements, but a custom equality comparer can be provided.\n */\nexport function itemsEquals(itemEquals = strictEquals) {\n    return (a, b) => arrays.equals(a, b, itemEquals);\n}\n/**\n * Uses `item.equals(other)` to determine equality.\n */\nexport function itemEquals() {\n    return (a, b) => a.equals(b);\n}\nexport function equalsIfDefined(equalsOrV1, v2, equals) {\n    if (equals !== undefined) {\n        const v1 = equalsOrV1;\n        if (v1 === undefined || v1 === null || v2 === undefined || v2 === null) {\n            return v2 === v1;\n        }\n        return equals(v1, v2);\n    }\n    else {\n        const equals = equalsOrV1;\n        return (v1, v2) => {\n            if (v1 === undefined || v1 === null || v2 === undefined || v2 === null) {\n                return v2 === v1;\n            }\n            return equals(v1, v2);\n        };\n    }\n}\n/**\n * Drills into arrays (items ordered) and objects (keys unordered) and uses strict equality on everything else.\n*/\nexport function structuralEquals(a, b) {\n    if (a === b) {\n        return true;\n    }\n    if (Array.isArray(a) && Array.isArray(b)) {\n        if (a.length !== b.length) {\n            return false;\n        }\n        for (let i = 0; i < a.length; i++) {\n            if (!structuralEquals(a[i], b[i])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    if (a && typeof a === 'object' && b && typeof b === 'object') {\n        if (Object.getPrototypeOf(a) === Object.prototype && Object.getPrototypeOf(b) === Object.prototype) {\n            const aObj = a;\n            const bObj = b;\n            const keysA = Object.keys(aObj);\n            const keysB = Object.keys(bObj);\n            const keysBSet = new Set(keysB);\n            if (keysA.length !== keysB.length) {\n                return false;\n            }\n            for (const key of keysA) {\n                if (!keysBSet.has(key)) {\n                    return false;\n                }\n                if (!structuralEquals(aObj[key], bObj[key])) {\n                    return false;\n                }\n            }\n            return true;\n        }\n    }\n    return false;\n}\nconst objIds = new WeakMap();\n"],"names":["arrays.equals","equals","v2"],"mappings":";AAQY,MAAC,eAAe,CAAC,GAAG,MAAM,MAAM;AAKrC,SAAS,YAAY,aAAa,cAAc;AACnD,SAAO,CAAC,GAAG,MAAMA,OAAc,GAAG,GAAG,UAAU;AACnD;AAOO,SAAS,gBAAgB,YAAY,IAAIC,SAAQ;AAQ/C;AACD,UAAMA,UAAS;AACf,WAAO,CAAC,IAAIC,QAAO;AACf,UAAI,OAAO,UAAa,OAAO,QAAQA,QAAO,UAAaA,QAAO,MAAM;AACpE,eAAOA,QAAO;AAAA,MAC9B;AACY,aAAOD,QAAO,IAAIC,GAAE;AAAA,IACvB;AAAA,EACT;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/extpath.es.js

@@ -1,5 +1,5 @@
 import { sep, posix } from "./path.es.js";
-import { isWindows } from "./platform.es.js";
+import "./platform.es.js";
 import { startsWithIgnoreCase } from "./strings.es.js";
 function isPathSeparator(code) {
   return code === 47 || code === 92;
@@ -95,15 +95,8 @@ function isEqualOrParent(base, parentCandidate, ignoreCase, separator = sep) {
 function isWindowsDriveLetter(char0) {
   return char0 >= 65 && char0 <= 90 || char0 >= 97 && char0 <= 122;
 }
-function hasDriveLetter(path, isWindowsOS = isWindows) {
-  if (isWindowsOS) {
-    return isWindowsDriveLetter(path.charCodeAt(0)) && path.charCodeAt(1) === 58;
-  }
-  return false;
-}
 export {
   getRoot,
-  hasDriveLetter,
   isEqualOrParent,
   isPathSeparator,
   isWindowsDriveLetter,

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/extpath.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"extpath.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/extpath.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { posix, sep } from './path.js';\nimport { isWindows } from './platform.js';\nimport { startsWithIgnoreCase } from './strings.js';\nexport function isPathSeparator(code) {\n    return code === 47 /* CharCode.Slash */ || code === 92 /* CharCode.Backslash */;\n}\n/**\n * Takes a Windows OS path and changes backward slashes to forward slashes.\n * This should only be done for OS paths from Windows (or user provided paths potentially from Windows).\n * Using it on a Linux or MaxOS path might change it.\n */\nexport function toSlashes(osPath) {\n    return osPath.replace(/[\\\\/]/g, posix.sep);\n}\n/**\n * Takes a Windows OS path (using backward or forward slashes) and turns it into a posix path:\n * - turns backward slashes into forward slashes\n * - makes it absolute if it starts with a drive letter\n * This should only be done for OS paths from Windows (or user provided paths potentially from Windows).\n * Using it on a Linux or MaxOS path might change it.\n */\nexport function toPosixPath(osPath) {\n    if (osPath.indexOf('/') === -1) {\n        osPath = toSlashes(osPath);\n    }\n    if (/^[a-zA-Z]:(\\/|$)/.test(osPath)) { // starts with a drive letter\n        osPath = '/' + osPath;\n    }\n    return osPath;\n}\n/**\n * Computes the _root_ this path, like `getRoot('c:\\files') === c:\\`,\n * `getRoot('files:///files/path') === files:///`,\n * or `getRoot('\\\\server\\shares\\path') === \\\\server\\shares\\`\n */\nexport function getRoot(path, sep = posix.sep) {\n    if (!path) {\n        return '';\n    }\n    const len = path.length;\n    const firstLetter = path.charCodeAt(0);\n    if (isPathSeparator(firstLetter)) {\n        if (isPathSeparator(path.charCodeAt(1))) {\n            // UNC candidate \\\\localhost\\shares\\ddd\n            //               ^^^^^^^^^^^^^^^^^^^\n            if (!isPathSeparator(path.charCodeAt(2))) {\n                let pos = 3;\n                const start = pos;\n                for (; pos < len; pos++) {\n                    if (isPathSeparator(path.charCodeAt(pos))) {\n                        break;\n                    }\n                }\n                if (start !== pos && !isPathSeparator(path.charCodeAt(pos + 1))) {\n                    pos += 1;\n                    for (; pos < len; pos++) {\n                        if (isPathSeparator(path.charCodeAt(pos))) {\n                            return path.slice(0, pos + 1) // consume this separator\n                                .replace(/[\\\\/]/g, sep);\n                        }\n                    }\n                }\n            }\n        }\n        // /user/far\n        // ^\n        return sep;\n    }\n    else if (isWindowsDriveLetter(firstLetter)) {\n        // check for windows drive letter c:\\ or c:\n        if (path.charCodeAt(1) === 58 /* CharCode.Colon */) {\n            if (isPathSeparator(path.charCodeAt(2))) {\n                // C:\\fff\n                // ^^^\n                return path.slice(0, 2) + sep;\n            }\n            else {\n                // C:\n                // ^^\n                return path.slice(0, 2);\n            }\n        }\n    }\n    // check for URI\n    // scheme://authority/path\n    // ^^^^^^^^^^^^^^^^^^^\n    let pos = path.indexOf('://');\n    if (pos !== -1) {\n        pos += 3; // 3 -> \"://\".length\n        for (; pos < len; pos++) {\n            if (isPathSeparator(path.charCodeAt(pos))) {\n                return path.slice(0, pos + 1); // consume this separator\n            }\n        }\n    }\n    return '';\n}\n/**\n * @deprecated please use `IUriIdentityService.extUri.isEqualOrParent` instead. If\n * you are in a context without services, consider to pass down the `extUri` from the\n * outside, or use `extUriBiasedIgnorePathCase` if you know what you are doing.\n */\nexport function isEqualOrParent(base, parentCandidate, ignoreCase, separator = sep) {\n    if (base === parentCandidate) {\n        return true;\n    }\n    if (!base || !parentCandidate) {\n        return false;\n    }\n    if (parentCandidate.length > base.length) {\n        return false;\n    }\n    if (ignoreCase) {\n        const beginsWith = startsWithIgnoreCase(base, parentCandidate);\n        if (!beginsWith) {\n            return false;\n        }\n        if (parentCandidate.length === base.length) {\n            return true; // same path, different casing\n        }\n        let sepOffset = parentCandidate.length;\n        if (parentCandidate.charAt(parentCandidate.length - 1) === separator) {\n            sepOffset--; // adjust the expected sep offset in case our candidate already ends in separator character\n        }\n        return base.charAt(sepOffset) === separator;\n    }\n    if (parentCandidate.charAt(parentCandidate.length - 1) !== separator) {\n        parentCandidate += separator;\n    }\n    return base.indexOf(parentCandidate) === 0;\n}\nexport function isWindowsDriveLetter(char0) {\n    return char0 >= 65 /* CharCode.A */ && char0 <= 90 /* CharCode.Z */ || char0 >= 97 /* CharCode.a */ && char0 <= 122 /* CharCode.z */;\n}\nexport function hasDriveLetter(path, isWindowsOS = isWindows) {\n    if (isWindowsOS) {\n        return isWindowsDriveLetter(path.charCodeAt(0)) && path.charCodeAt(1) === 58 /* CharCode.Colon */;\n    }\n    return false;\n}\n"],"names":["sep","pos"],"mappings":";;;AAOO,SAAS,gBAAgB,MAAM;AAClC,SAAO,SAAS,MAA2B,SAAS;AACxD;AAMO,SAAS,UAAU,QAAQ;AAC9B,SAAO,OAAO,QAAQ,UAAU,MAAM,GAAG;AAC7C;AAQO,SAAS,YAAY,QAAQ;AAChC,MAAI,OAAO,QAAQ,GAAG,MAAM,IAAI;AAC5B,aAAS,UAAU,MAAM;AAAA,EACjC;AACI,MAAI,mBAAmB,KAAK,MAAM,GAAG;AACjC,aAAS,MAAM;AAAA,EACvB;AACI,SAAO;AACX;AAMO,SAAS,QAAQ,MAAMA,OAAM,MAAM,KAAK;AAC3C,MAAI,CAAC,MAAM;AACP,WAAO;AAAA,EACf;AACI,QAAM,MAAM,KAAK;AACjB,QAAM,cAAc,KAAK,WAAW,CAAC;AACrC,MAAI,gBAAgB,WAAW,GAAG;AAC9B,QAAI,gBAAgB,KAAK,WAAW,CAAC,CAAC,GAAG;AAGrC,UAAI,CAAC,gBAAgB,KAAK,WAAW,CAAC,CAAC,GAAG;AACtC,YAAIC,OAAM;AACV,cAAM,QAAQA;AACd,eAAOA,OAAM,KAAKA,QAAO;AACrB,cAAI,gBAAgB,KAAK,WAAWA,IAAG,CAAC,GAAG;AACvC;AAAA,UACxB;AAAA,QACA;AACgB,YAAI,UAAUA,QAAO,CAAC,gBAAgB,KAAK,WAAWA,OAAM,CAAC,CAAC,GAAG;AAC7D,UAAAA,QAAO;AACP,iBAAOA,OAAM,KAAKA,QAAO;AACrB,gBAAI,gBAAgB,KAAK,WAAWA,IAAG,CAAC,GAAG;AACvC,qBAAO,KAAK,MAAM,GAAGA,OAAM,CAAC,EACvB,QAAQ,UAAUD,IAAG;AAAA,YACtD;AAAA,UACA;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAGQ,WAAOA;AAAA,EACf,WACa,qBAAqB,WAAW,GAAG;AAExC,QAAI,KAAK,WAAW,CAAC,MAAM,IAAyB;AAChD,UAAI,gBAAgB,KAAK,WAAW,CAAC,CAAC,GAAG;AAGrC,eAAO,KAAK,MAAM,GAAG,CAAC,IAAIA;AAAA,MAC1C,OACiB;AAGD,eAAO,KAAK,MAAM,GAAG,CAAC;AAAA,MACtC;AAAA,IACA;AAAA,EACA;AAII,MAAI,MAAM,KAAK,QAAQ,KAAK;AAC5B,MAAI,QAAQ,IAAI;AACZ,WAAO;AACP,WAAO,MAAM,KAAK,OAAO;AACrB,UAAI,gBAAgB,KAAK,WAAW,GAAG,CAAC,GAAG;AACvC,eAAO,KAAK,MAAM,GAAG,MAAM,CAAC;AAAA,MAC5C;AAAA,IACA;AAAA,EACA;AACI,SAAO;AACX;AAMO,SAAS,gBAAgB,MAAM,iBAAiB,YAAY,YAAY,KAAK;AAChF,MAAI,SAAS,iBAAiB;AAC1B,WAAO;AAAA,EACf;AACI,MAAI,CAAC,QAAQ,CAAC,iBAAiB;AAC3B,WAAO;AAAA,EACf;AACI,MAAI,gBAAgB,SAAS,KAAK,QAAQ;AACtC,WAAO;AAAA,EACf;AACI,MAAI,YAAY;AACZ,UAAM,aAAa,qBAAqB,MAAM,eAAe;AAC7D,QAAI,CAAC,YAAY;AACb,aAAO;AAAA,IACnB;AACQ,QAAI,gBAAgB,WAAW,KAAK,QAAQ;AACxC,aAAO;AAAA,IACnB;AACQ,QAAI,YAAY,gBAAgB;AAChC,QAAI,gBAAgB,OAAO,gBAAgB,SAAS,CAAC,MAAM,WAAW;AAClE;AAAA,IACZ;AACQ,WAAO,KAAK,OAAO,SAAS,MAAM;AAAA,EAC1C;AACI,MAAI,gBAAgB,OAAO,gBAAgB,SAAS,CAAC,MAAM,WAAW;AAClE,uBAAmB;AAAA,EAC3B;AACI,SAAO,KAAK,QAAQ,eAAe,MAAM;AAC7C;AACO,SAAS,qBAAqB,OAAO;AACxC,SAAO,SAAS,MAAuB,SAAS,MAAuB,SAAS,MAAuB,SAAS;AACpH;AACO,SAAS,eAAe,MAAM,cAAc,WAAW;AAC1D,MAAI,aAAa;AACb,WAAO,qBAAqB,KAAK,WAAW,CAAC,CAAC,KAAK,KAAK,WAAW,CAAC,MAAM;AAAA,EAClF;AACI,SAAO;AACX;","x_google_ignoreList":[0]}
+{"version":3,"file":"extpath.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/extpath.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { posix, sep } from './path.js';\nimport { isWindows } from './platform.js';\nimport { startsWithIgnoreCase } from './strings.js';\nexport function isPathSeparator(code) {\n    return code === 47 /* CharCode.Slash */ || code === 92 /* CharCode.Backslash */;\n}\n/**\n * Takes a Windows OS path and changes backward slashes to forward slashes.\n * This should only be done for OS paths from Windows (or user provided paths potentially from Windows).\n * Using it on a Linux or MaxOS path might change it.\n */\nexport function toSlashes(osPath) {\n    return osPath.replace(/[\\\\/]/g, posix.sep);\n}\n/**\n * Takes a Windows OS path (using backward or forward slashes) and turns it into a posix path:\n * - turns backward slashes into forward slashes\n * - makes it absolute if it starts with a drive letter\n * This should only be done for OS paths from Windows (or user provided paths potentially from Windows).\n * Using it on a Linux or MaxOS path might change it.\n */\nexport function toPosixPath(osPath) {\n    if (osPath.indexOf('/') === -1) {\n        osPath = toSlashes(osPath);\n    }\n    if (/^[a-zA-Z]:(\\/|$)/.test(osPath)) { // starts with a drive letter\n        osPath = '/' + osPath;\n    }\n    return osPath;\n}\n/**\n * Computes the _root_ this path, like `getRoot('c:\\files') === c:\\`,\n * `getRoot('files:///files/path') === files:///`,\n * or `getRoot('\\\\server\\shares\\path') === \\\\server\\shares\\`\n */\nexport function getRoot(path, sep = posix.sep) {\n    if (!path) {\n        return '';\n    }\n    const len = path.length;\n    const firstLetter = path.charCodeAt(0);\n    if (isPathSeparator(firstLetter)) {\n        if (isPathSeparator(path.charCodeAt(1))) {\n            // UNC candidate \\\\localhost\\shares\\ddd\n            //               ^^^^^^^^^^^^^^^^^^^\n            if (!isPathSeparator(path.charCodeAt(2))) {\n                let pos = 3;\n                const start = pos;\n                for (; pos < len; pos++) {\n                    if (isPathSeparator(path.charCodeAt(pos))) {\n                        break;\n                    }\n                }\n                if (start !== pos && !isPathSeparator(path.charCodeAt(pos + 1))) {\n                    pos += 1;\n                    for (; pos < len; pos++) {\n                        if (isPathSeparator(path.charCodeAt(pos))) {\n                            return path.slice(0, pos + 1) // consume this separator\n                                .replace(/[\\\\/]/g, sep);\n                        }\n                    }\n                }\n            }\n        }\n        // /user/far\n        // ^\n        return sep;\n    }\n    else if (isWindowsDriveLetter(firstLetter)) {\n        // check for windows drive letter c:\\ or c:\n        if (path.charCodeAt(1) === 58 /* CharCode.Colon */) {\n            if (isPathSeparator(path.charCodeAt(2))) {\n                // C:\\fff\n                // ^^^\n                return path.slice(0, 2) + sep;\n            }\n            else {\n                // C:\n                // ^^\n                return path.slice(0, 2);\n            }\n        }\n    }\n    // check for URI\n    // scheme://authority/path\n    // ^^^^^^^^^^^^^^^^^^^\n    let pos = path.indexOf('://');\n    if (pos !== -1) {\n        pos += 3; // 3 -> \"://\".length\n        for (; pos < len; pos++) {\n            if (isPathSeparator(path.charCodeAt(pos))) {\n                return path.slice(0, pos + 1); // consume this separator\n            }\n        }\n    }\n    return '';\n}\n/**\n * @deprecated please use `IUriIdentityService.extUri.isEqualOrParent` instead. If\n * you are in a context without services, consider to pass down the `extUri` from the\n * outside, or use `extUriBiasedIgnorePathCase` if you know what you are doing.\n */\nexport function isEqualOrParent(base, parentCandidate, ignoreCase, separator = sep) {\n    if (base === parentCandidate) {\n        return true;\n    }\n    if (!base || !parentCandidate) {\n        return false;\n    }\n    if (parentCandidate.length > base.length) {\n        return false;\n    }\n    if (ignoreCase) {\n        const beginsWith = startsWithIgnoreCase(base, parentCandidate);\n        if (!beginsWith) {\n            return false;\n        }\n        if (parentCandidate.length === base.length) {\n            return true; // same path, different casing\n        }\n        let sepOffset = parentCandidate.length;\n        if (parentCandidate.charAt(parentCandidate.length - 1) === separator) {\n            sepOffset--; // adjust the expected sep offset in case our candidate already ends in separator character\n        }\n        return base.charAt(sepOffset) === separator;\n    }\n    if (parentCandidate.charAt(parentCandidate.length - 1) !== separator) {\n        parentCandidate += separator;\n    }\n    return base.indexOf(parentCandidate) === 0;\n}\nexport function isWindowsDriveLetter(char0) {\n    return char0 >= 65 /* CharCode.A */ && char0 <= 90 /* CharCode.Z */ || char0 >= 97 /* CharCode.a */ && char0 <= 122 /* CharCode.z */;\n}\nexport function hasDriveLetter(path, isWindowsOS = isWindows) {\n    if (isWindowsOS) {\n        return isWindowsDriveLetter(path.charCodeAt(0)) && path.charCodeAt(1) === 58 /* CharCode.Colon */;\n    }\n    return false;\n}\n"],"names":["sep","pos"],"mappings":";;;AAOO,SAAS,gBAAgB,MAAM;AAClC,SAAO,SAAS,MAA2B,SAAS;AACxD;AAMO,SAAS,UAAU,QAAQ;AAC9B,SAAO,OAAO,QAAQ,UAAU,MAAM,GAAG;AAC7C;AAQO,SAAS,YAAY,QAAQ;AAChC,MAAI,OAAO,QAAQ,GAAG,MAAM,IAAI;AAC5B,aAAS,UAAU,MAAM;AAAA,EACjC;AACI,MAAI,mBAAmB,KAAK,MAAM,GAAG;AACjC,aAAS,MAAM;AAAA,EACvB;AACI,SAAO;AACX;AAMO,SAAS,QAAQ,MAAMA,OAAM,MAAM,KAAK;AAC3C,MAAI,CAAC,MAAM;AACP,WAAO;AAAA,EACf;AACI,QAAM,MAAM,KAAK;AACjB,QAAM,cAAc,KAAK,WAAW,CAAC;AACrC,MAAI,gBAAgB,WAAW,GAAG;AAC9B,QAAI,gBAAgB,KAAK,WAAW,CAAC,CAAC,GAAG;AAGrC,UAAI,CAAC,gBAAgB,KAAK,WAAW,CAAC,CAAC,GAAG;AACtC,YAAIC,OAAM;AACV,cAAM,QAAQA;AACd,eAAOA,OAAM,KAAKA,QAAO;AACrB,cAAI,gBAAgB,KAAK,WAAWA,IAAG,CAAC,GAAG;AACvC;AAAA,UACxB;AAAA,QACA;AACgB,YAAI,UAAUA,QAAO,CAAC,gBAAgB,KAAK,WAAWA,OAAM,CAAC,CAAC,GAAG;AAC7D,UAAAA,QAAO;AACP,iBAAOA,OAAM,KAAKA,QAAO;AACrB,gBAAI,gBAAgB,KAAK,WAAWA,IAAG,CAAC,GAAG;AACvC,qBAAO,KAAK,MAAM,GAAGA,OAAM,CAAC,EACvB,QAAQ,UAAUD,IAAG;AAAA,YACtD;AAAA,UACA;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAGQ,WAAOA;AAAA,EACf,WACa,qBAAqB,WAAW,GAAG;AAExC,QAAI,KAAK,WAAW,CAAC,MAAM,IAAyB;AAChD,UAAI,gBAAgB,KAAK,WAAW,CAAC,CAAC,GAAG;AAGrC,eAAO,KAAK,MAAM,GAAG,CAAC,IAAIA;AAAA,MAC1C,OACiB;AAGD,eAAO,KAAK,MAAM,GAAG,CAAC;AAAA,MACtC;AAAA,IACA;AAAA,EACA;AAII,MAAI,MAAM,KAAK,QAAQ,KAAK;AAC5B,MAAI,QAAQ,IAAI;AACZ,WAAO;AACP,WAAO,MAAM,KAAK,OAAO;AACrB,UAAI,gBAAgB,KAAK,WAAW,GAAG,CAAC,GAAG;AACvC,eAAO,KAAK,MAAM,GAAG,MAAM,CAAC;AAAA,MAC5C;AAAA,IACA;AAAA,EACA;AACI,SAAO;AACX;AAMO,SAAS,gBAAgB,MAAM,iBAAiB,YAAY,YAAY,KAAK;AAChF,MAAI,SAAS,iBAAiB;AAC1B,WAAO;AAAA,EACf;AACI,MAAI,CAAC,QAAQ,CAAC,iBAAiB;AAC3B,WAAO;AAAA,EACf;AACI,MAAI,gBAAgB,SAAS,KAAK,QAAQ;AACtC,WAAO;AAAA,EACf;AACI,MAAI,YAAY;AACZ,UAAM,aAAa,qBAAqB,MAAM,eAAe;AAC7D,QAAI,CAAC,YAAY;AACb,aAAO;AAAA,IACnB;AACQ,QAAI,gBAAgB,WAAW,KAAK,QAAQ;AACxC,aAAO;AAAA,IACnB;AACQ,QAAI,YAAY,gBAAgB;AAChC,QAAI,gBAAgB,OAAO,gBAAgB,SAAS,CAAC,MAAM,WAAW;AAClE;AAAA,IACZ;AACQ,WAAO,KAAK,OAAO,SAAS,MAAM;AAAA,EAC1C;AACI,MAAI,gBAAgB,OAAO,gBAAgB,SAAS,CAAC,MAAM,WAAW;AAClE,uBAAmB;AAAA,EAC3B;AACI,SAAO,KAAK,QAAQ,eAAe,MAAM;AAC7C;AACO,SAAS,qBAAqB,OAAO;AACxC,SAAO,SAAS,MAAuB,SAAS,MAAuB,SAAS,MAAuB,SAAS;AACpH;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/filters.es.js

@@ -210,16 +210,6 @@ function matchesFuzzy2(pattern, word) {
   const score = fuzzyScore(pattern, pattern.toLowerCase(), 0, word, word.toLowerCase(), 0, { firstMatchCanBeWeak: true, boostFullMatch: true });
   return score ? createMatches(score) : null;
 }
-function anyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos) {
-  const max = Math.min(13, pattern.length);
-  for (; patternPos < max; patternPos++) {
-    const result = fuzzyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos, { firstMatchCanBeWeak: true, boostFullMatch: true });
-    if (result) {
-      return result;
-    }
-  }
-  return [0, wordPos];
-}
 function createMatches(score) {
   if (typeof score === "undefined") {
     return [];
@@ -482,49 +472,11 @@ function _doScore(pattern, patternLow, patternPos, patternStart, word, wordLow,
   }
   return score;
 }
-function fuzzyScoreGracefulAggressive(pattern, lowPattern, patternPos, word, lowWord, wordPos, options) {
-  return fuzzyScoreWithPermutations(pattern, lowPattern, patternPos, word, lowWord, wordPos, true, options);
-}
-function fuzzyScoreWithPermutations(pattern, lowPattern, patternPos, word, lowWord, wordPos, aggressive, options) {
-  let top = fuzzyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos, options);
-  if (top && false) {
-    return top;
-  }
-  if (pattern.length >= 3) {
-    const tries = Math.min(7, pattern.length - 1);
-    for (let movingPatternPos = patternPos + 1; movingPatternPos < tries; movingPatternPos++) {
-      const newPattern = nextTypoPermutation(pattern, movingPatternPos);
-      if (newPattern) {
-        const candidate = fuzzyScore(newPattern, newPattern.toLowerCase(), patternPos, word, lowWord, wordPos, options);
-        if (candidate) {
-          candidate[0] -= 3;
-          if (!top || candidate[0] > top[0]) {
-            top = candidate;
-          }
-        }
-      }
-    }
-  }
-  return top;
-}
-function nextTypoPermutation(pattern, patternPos) {
-  if (patternPos + 1 >= pattern.length) {
-    return void 0;
-  }
-  const swap1 = pattern[patternPos];
-  const swap2 = pattern[patternPos + 1];
-  if (swap1 === swap2) {
-    return void 0;
-  }
-  return pattern.slice(0, patternPos) + swap2 + swap1 + pattern.slice(patternPos + 2);
-}
 export {
   FuzzyScore,
   FuzzyScoreOptions,
-  anyScore,
   createMatches,
   fuzzyScore,
-  fuzzyScoreGracefulAggressive,
   isPatternInWord,
   isUpper,
   matchesCamelCase,

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/filters.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"filters.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/filters.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { LRUCache } from './map.js';\nimport { getKoreanAltChars } from './naturalLanguage/korean.js';\nimport * as strings from './strings.js';\n// Combined filters\n/**\n * @returns A filter which combines the provided set\n * of filters with an or. The *first* filters that\n * matches defined the return value of the returned\n * filter.\n */\nexport function or(...filter) {\n    return function (word, wordToMatchAgainst) {\n        for (let i = 0, len = filter.length; i < len; i++) {\n            const match = filter[i](word, wordToMatchAgainst);\n            if (match) {\n                return match;\n            }\n        }\n        return null;\n    };\n}\n// Prefix\nexport const matchesStrictPrefix = _matchesPrefix.bind(undefined, false);\nexport const matchesPrefix = _matchesPrefix.bind(undefined, true);\nfunction _matchesPrefix(ignoreCase, word, wordToMatchAgainst) {\n    if (!wordToMatchAgainst || wordToMatchAgainst.length < word.length) {\n        return null;\n    }\n    let matches;\n    if (ignoreCase) {\n        matches = strings.startsWithIgnoreCase(wordToMatchAgainst, word);\n    }\n    else {\n        matches = wordToMatchAgainst.indexOf(word) === 0;\n    }\n    if (!matches) {\n        return null;\n    }\n    return word.length > 0 ? [{ start: 0, end: word.length }] : [];\n}\n// Contiguous Substring\nexport function matchesContiguousSubString(word, wordToMatchAgainst) {\n    const index = wordToMatchAgainst.toLowerCase().indexOf(word.toLowerCase());\n    if (index === -1) {\n        return null;\n    }\n    return [{ start: index, end: index + word.length }];\n}\n// Substring\nexport function matchesSubString(word, wordToMatchAgainst) {\n    return _matchesSubString(word.toLowerCase(), wordToMatchAgainst.toLowerCase(), 0, 0);\n}\nfunction _matchesSubString(word, wordToMatchAgainst, i, j) {\n    if (i === word.length) {\n        return [];\n    }\n    else if (j === wordToMatchAgainst.length) {\n        return null;\n    }\n    else {\n        if (word[i] === wordToMatchAgainst[j]) {\n            let result = null;\n            if (result = _matchesSubString(word, wordToMatchAgainst, i + 1, j + 1)) {\n                return join({ start: j, end: j + 1 }, result);\n            }\n            return null;\n        }\n        return _matchesSubString(word, wordToMatchAgainst, i, j + 1);\n    }\n}\n// CamelCase\nfunction isLower(code) {\n    return 97 /* CharCode.a */ <= code && code <= 122 /* CharCode.z */;\n}\nexport function isUpper(code) {\n    return 65 /* CharCode.A */ <= code && code <= 90 /* CharCode.Z */;\n}\nfunction isNumber(code) {\n    return 48 /* CharCode.Digit0 */ <= code && code <= 57 /* CharCode.Digit9 */;\n}\nfunction isWhitespace(code) {\n    return (code === 32 /* CharCode.Space */\n        || code === 9 /* CharCode.Tab */\n        || code === 10 /* CharCode.LineFeed */\n        || code === 13 /* CharCode.CarriageReturn */);\n}\nconst wordSeparators = new Set();\n// These are chosen as natural word separators based on writen text.\n// It is a subset of the word separators used by the monaco editor.\n'()[]{}<>`\\'\"-/;:,.?!'\n    .split('')\n    .forEach(s => wordSeparators.add(s.charCodeAt(0)));\nfunction isWordSeparator(code) {\n    return isWhitespace(code) || wordSeparators.has(code);\n}\nfunction charactersMatch(codeA, codeB) {\n    return (codeA === codeB) || (isWordSeparator(codeA) && isWordSeparator(codeB));\n}\nconst alternateCharsCache = new Map();\n/**\n * Gets alternative codes to the character code passed in. This comes in the\n * form of an array of character codes, all of which must match _in order_ to\n * successfully match.\n *\n * @param code The character code to check.\n */\nfunction getAlternateCodes(code) {\n    if (alternateCharsCache.has(code)) {\n        return alternateCharsCache.get(code);\n    }\n    // NOTE: This function is written in such a way that it can be extended in\n    // the future, but right now the return type takes into account it's only\n    // supported by a single \"alt codes provider\".\n    // `ArrayLike<ArrayLike<number>>` is a more appropriate type if changed.\n    let result;\n    const codes = getKoreanAltChars(code);\n    if (codes) {\n        result = codes;\n    }\n    alternateCharsCache.set(code, result);\n    return result;\n}\nfunction isAlphanumeric(code) {\n    return isLower(code) || isUpper(code) || isNumber(code);\n}\nfunction join(head, tail) {\n    if (tail.length === 0) {\n        tail = [head];\n    }\n    else if (head.end === tail[0].start) {\n        tail[0].start = head.start;\n    }\n    else {\n        tail.unshift(head);\n    }\n    return tail;\n}\nfunction nextAnchor(camelCaseWord, start) {\n    for (let i = start; i < camelCaseWord.length; i++) {\n        const c = camelCaseWord.charCodeAt(i);\n        if (isUpper(c) || isNumber(c) || (i > 0 && !isAlphanumeric(camelCaseWord.charCodeAt(i - 1)))) {\n            return i;\n        }\n    }\n    return camelCaseWord.length;\n}\nfunction _matchesCamelCase(word, camelCaseWord, i, j) {\n    if (i === word.length) {\n        return [];\n    }\n    else if (j === camelCaseWord.length) {\n        return null;\n    }\n    else if (word[i] !== camelCaseWord[j].toLowerCase()) {\n        return null;\n    }\n    else {\n        let result = null;\n        let nextUpperIndex = j + 1;\n        result = _matchesCamelCase(word, camelCaseWord, i + 1, j + 1);\n        while (!result && (nextUpperIndex = nextAnchor(camelCaseWord, nextUpperIndex)) < camelCaseWord.length) {\n            result = _matchesCamelCase(word, camelCaseWord, i + 1, nextUpperIndex);\n            nextUpperIndex++;\n        }\n        return result === null ? null : join({ start: j, end: j + 1 }, result);\n    }\n}\n// Heuristic to avoid computing camel case matcher for words that don't\n// look like camelCaseWords.\nfunction analyzeCamelCaseWord(word) {\n    let upper = 0, lower = 0, alpha = 0, numeric = 0, code = 0;\n    for (let i = 0; i < word.length; i++) {\n        code = word.charCodeAt(i);\n        if (isUpper(code)) {\n            upper++;\n        }\n        if (isLower(code)) {\n            lower++;\n        }\n        if (isAlphanumeric(code)) {\n            alpha++;\n        }\n        if (isNumber(code)) {\n            numeric++;\n        }\n    }\n    const upperPercent = upper / word.length;\n    const lowerPercent = lower / word.length;\n    const alphaPercent = alpha / word.length;\n    const numericPercent = numeric / word.length;\n    return { upperPercent, lowerPercent, alphaPercent, numericPercent };\n}\nfunction isUpperCaseWord(analysis) {\n    const { upperPercent, lowerPercent } = analysis;\n    return lowerPercent === 0 && upperPercent > 0.6;\n}\nfunction isCamelCaseWord(analysis) {\n    const { upperPercent, lowerPercent, alphaPercent, numericPercent } = analysis;\n    return lowerPercent > 0.2 && upperPercent < 0.8 && alphaPercent > 0.6 && numericPercent < 0.2;\n}\n// Heuristic to avoid computing camel case matcher for words that don't\n// look like camel case patterns.\nfunction isCamelCasePattern(word) {\n    let upper = 0, lower = 0, code = 0, whitespace = 0;\n    for (let i = 0; i < word.length; i++) {\n        code = word.charCodeAt(i);\n        if (isUpper(code)) {\n            upper++;\n        }\n        if (isLower(code)) {\n            lower++;\n        }\n        if (isWhitespace(code)) {\n            whitespace++;\n        }\n    }\n    if ((upper === 0 || lower === 0) && whitespace === 0) {\n        return word.length <= 30;\n    }\n    else {\n        return upper <= 5;\n    }\n}\nexport function matchesCamelCase(word, camelCaseWord) {\n    if (!camelCaseWord) {\n        return null;\n    }\n    camelCaseWord = camelCaseWord.trim();\n    if (camelCaseWord.length === 0) {\n        return null;\n    }\n    if (!isCamelCasePattern(word)) {\n        return null;\n    }\n    // TODO: Consider removing this check\n    if (camelCaseWord.length > 60) {\n        camelCaseWord = camelCaseWord.substring(0, 60);\n    }\n    const analysis = analyzeCamelCaseWord(camelCaseWord);\n    if (!isCamelCaseWord(analysis)) {\n        if (!isUpperCaseWord(analysis)) {\n            return null;\n        }\n        camelCaseWord = camelCaseWord.toLowerCase();\n    }\n    let result = null;\n    let i = 0;\n    word = word.toLowerCase();\n    while (i < camelCaseWord.length && (result = _matchesCamelCase(word, camelCaseWord, 0, i)) === null) {\n        i = nextAnchor(camelCaseWord, i + 1);\n    }\n    return result;\n}\n// Matches beginning of words supporting non-ASCII languages\n// If `contiguous` is true then matches word with beginnings of the words in the target. E.g. \"pul\" will match \"Git: Pull\"\n// Otherwise also matches sub string of the word with beginnings of the words in the target. E.g. \"gp\" or \"g p\" will match \"Git: Pull\"\n// Useful in cases where the target is words (e.g. command labels)\nexport function matchesWords(word, target, contiguous = false) {\n    if (!target || target.length === 0) {\n        return null;\n    }\n    let result = null;\n    let targetIndex = 0;\n    word = word.toLowerCase();\n    target = target.toLowerCase();\n    while (targetIndex < target.length) {\n        result = _matchesWords(word, target, 0, targetIndex, contiguous);\n        if (result !== null) {\n            break;\n        }\n        targetIndex = nextWord(target, targetIndex + 1);\n    }\n    return result;\n}\nfunction _matchesWords(word, target, wordIndex, targetIndex, contiguous) {\n    let targetIndexOffset = 0;\n    if (wordIndex === word.length) {\n        return [];\n    }\n    else if (targetIndex === target.length) {\n        return null;\n    }\n    else if (!charactersMatch(word.charCodeAt(wordIndex), target.charCodeAt(targetIndex))) {\n        // Verify alternate characters before exiting\n        const altChars = getAlternateCodes(word.charCodeAt(wordIndex));\n        if (!altChars) {\n            return null;\n        }\n        for (let k = 0; k < altChars.length; k++) {\n            if (!charactersMatch(altChars[k], target.charCodeAt(targetIndex + k))) {\n                return null;\n            }\n        }\n        targetIndexOffset += altChars.length - 1;\n    }\n    let result = null;\n    let nextWordIndex = targetIndex + targetIndexOffset + 1;\n    result = _matchesWords(word, target, wordIndex + 1, nextWordIndex, contiguous);\n    if (!contiguous) {\n        while (!result && (nextWordIndex = nextWord(target, nextWordIndex)) < target.length) {\n            result = _matchesWords(word, target, wordIndex + 1, nextWordIndex, contiguous);\n            nextWordIndex++;\n        }\n    }\n    if (!result) {\n        return null;\n    }\n    // If the characters don't exactly match, then they must be word separators (see charactersMatch(...)).\n    // We don't want to include this in the matches but we don't want to throw the target out all together so we return `result`.\n    if (word.charCodeAt(wordIndex) !== target.charCodeAt(targetIndex)) {\n        // Verify alternate characters before exiting\n        const altChars = getAlternateCodes(word.charCodeAt(wordIndex));\n        if (!altChars) {\n            return result;\n        }\n        for (let k = 0; k < altChars.length; k++) {\n            if (altChars[k] !== target.charCodeAt(targetIndex + k)) {\n                return result;\n            }\n        }\n    }\n    return join({ start: targetIndex, end: targetIndex + targetIndexOffset + 1 }, result);\n}\nfunction nextWord(word, start) {\n    for (let i = start; i < word.length; i++) {\n        if (isWordSeparator(word.charCodeAt(i)) ||\n            (i > 0 && isWordSeparator(word.charCodeAt(i - 1)))) {\n            return i;\n        }\n    }\n    return word.length;\n}\n// Fuzzy\nconst fuzzyContiguousFilter = or(matchesPrefix, matchesCamelCase, matchesContiguousSubString);\nconst fuzzySeparateFilter = or(matchesPrefix, matchesCamelCase, matchesSubString);\nconst fuzzyRegExpCache = new LRUCache(10000); // bounded to 10000 elements\nexport function matchesFuzzy(word, wordToMatchAgainst, enableSeparateSubstringMatching = false) {\n    if (typeof word !== 'string' || typeof wordToMatchAgainst !== 'string') {\n        return null; // return early for invalid input\n    }\n    // Form RegExp for wildcard matches\n    let regexp = fuzzyRegExpCache.get(word);\n    if (!regexp) {\n        regexp = new RegExp(strings.convertSimple2RegExpPattern(word), 'i');\n        fuzzyRegExpCache.set(word, regexp);\n    }\n    // RegExp Filter\n    const match = regexp.exec(wordToMatchAgainst);\n    if (match) {\n        return [{ start: match.index, end: match.index + match[0].length }];\n    }\n    // Default Filter\n    return enableSeparateSubstringMatching ? fuzzySeparateFilter(word, wordToMatchAgainst) : fuzzyContiguousFilter(word, wordToMatchAgainst);\n}\n/**\n * Match pattern against word in a fuzzy way. As in IntelliSense and faster and more\n * powerful than `matchesFuzzy`\n */\nexport function matchesFuzzy2(pattern, word) {\n    const score = fuzzyScore(pattern, pattern.toLowerCase(), 0, word, word.toLowerCase(), 0, { firstMatchCanBeWeak: true, boostFullMatch: true });\n    return score ? createMatches(score) : null;\n}\nexport function anyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos) {\n    const max = Math.min(13, pattern.length);\n    for (; patternPos < max; patternPos++) {\n        const result = fuzzyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos, { firstMatchCanBeWeak: true, boostFullMatch: true });\n        if (result) {\n            return result;\n        }\n    }\n    return [0, wordPos];\n}\n//#region --- fuzzyScore ---\nexport function createMatches(score) {\n    if (typeof score === 'undefined') {\n        return [];\n    }\n    const res = [];\n    const wordPos = score[1];\n    for (let i = score.length - 1; i > 1; i--) {\n        const pos = score[i] + wordPos;\n        const last = res[res.length - 1];\n        if (last && last.end === pos) {\n            last.end = pos + 1;\n        }\n        else {\n            res.push({ start: pos, end: pos + 1 });\n        }\n    }\n    return res;\n}\nconst _maxLen = 128;\nfunction initTable() {\n    const table = [];\n    const row = [];\n    for (let i = 0; i <= _maxLen; i++) {\n        row[i] = 0;\n    }\n    for (let i = 0; i <= _maxLen; i++) {\n        table.push(row.slice(0));\n    }\n    return table;\n}\nfunction initArr(maxLen) {\n    const row = [];\n    for (let i = 0; i <= maxLen; i++) {\n        row[i] = 0;\n    }\n    return row;\n}\nconst _minWordMatchPos = initArr(2 * _maxLen); // min word position for a certain pattern position\nconst _maxWordMatchPos = initArr(2 * _maxLen); // max word position for a certain pattern position\nconst _diag = initTable(); // the length of a contiguous diagonal match\nconst _table = initTable();\nconst _arrows = initTable();\nconst _debug = false;\nfunction printTable(table, pattern, patternLen, word, wordLen) {\n    function pad(s, n, pad = ' ') {\n        while (s.length < n) {\n            s = pad + s;\n        }\n        return s;\n    }\n    let ret = ` |   |${word.split('').map(c => pad(c, 3)).join('|')}\\n`;\n    for (let i = 0; i <= patternLen; i++) {\n        if (i === 0) {\n            ret += ' |';\n        }\n        else {\n            ret += `${pattern[i - 1]}|`;\n        }\n        ret += table[i].slice(0, wordLen + 1).map(n => pad(n.toString(), 3)).join('|') + '\\n';\n    }\n    return ret;\n}\nfunction printTables(pattern, patternStart, word, wordStart) {\n    pattern = pattern.substr(patternStart);\n    word = word.substr(wordStart);\n    console.log(printTable(_table, pattern, pattern.length, word, word.length));\n    console.log(printTable(_arrows, pattern, pattern.length, word, word.length));\n    console.log(printTable(_diag, pattern, pattern.length, word, word.length));\n}\nfunction isSeparatorAtPos(value, index) {\n    if (index < 0 || index >= value.length) {\n        return false;\n    }\n    const code = value.codePointAt(index);\n    switch (code) {\n        case 95 /* CharCode.Underline */:\n        case 45 /* CharCode.Dash */:\n        case 46 /* CharCode.Period */:\n        case 32 /* CharCode.Space */:\n        case 47 /* CharCode.Slash */:\n        case 92 /* CharCode.Backslash */:\n        case 39 /* CharCode.SingleQuote */:\n        case 34 /* CharCode.DoubleQuote */:\n        case 58 /* CharCode.Colon */:\n        case 36 /* CharCode.DollarSign */:\n        case 60 /* CharCode.LessThan */:\n        case 62 /* CharCode.GreaterThan */:\n        case 40 /* CharCode.OpenParen */:\n        case 41 /* CharCode.CloseParen */:\n        case 91 /* CharCode.OpenSquareBracket */:\n        case 93 /* CharCode.CloseSquareBracket */:\n        case 123 /* CharCode.OpenCurlyBrace */:\n        case 125 /* CharCode.CloseCurlyBrace */:\n            return true;\n        case undefined:\n            return false;\n        default:\n            if (strings.isEmojiImprecise(code)) {\n                return true;\n            }\n            return false;\n    }\n}\nfunction isWhitespaceAtPos(value, index) {\n    if (index < 0 || index >= value.length) {\n        return false;\n    }\n    const code = value.charCodeAt(index);\n    switch (code) {\n        case 32 /* CharCode.Space */:\n        case 9 /* CharCode.Tab */:\n            return true;\n        default:\n            return false;\n    }\n}\nfunction isUpperCaseAtPos(pos, word, wordLow) {\n    return word[pos] !== wordLow[pos];\n}\nexport function isPatternInWord(patternLow, patternPos, patternLen, wordLow, wordPos, wordLen, fillMinWordPosArr = false) {\n    while (patternPos < patternLen && wordPos < wordLen) {\n        if (patternLow[patternPos] === wordLow[wordPos]) {\n            if (fillMinWordPosArr) {\n                // Remember the min word position for each pattern position\n                _minWordMatchPos[patternPos] = wordPos;\n            }\n            patternPos += 1;\n        }\n        wordPos += 1;\n    }\n    return patternPos === patternLen; // pattern must be exhausted\n}\nexport var FuzzyScore;\n(function (FuzzyScore) {\n    /**\n     * No matches and value `-100`\n     */\n    FuzzyScore.Default = ([-100, 0]);\n    function isDefault(score) {\n        return !score || (score.length === 2 && score[0] === -100 && score[1] === 0);\n    }\n    FuzzyScore.isDefault = isDefault;\n})(FuzzyScore || (FuzzyScore = {}));\nexport class FuzzyScoreOptions {\n    static { this.default = { boostFullMatch: true, firstMatchCanBeWeak: false }; }\n    constructor(firstMatchCanBeWeak, boostFullMatch) {\n        this.firstMatchCanBeWeak = firstMatchCanBeWeak;\n        this.boostFullMatch = boostFullMatch;\n    }\n}\nexport function fuzzyScore(pattern, patternLow, patternStart, word, wordLow, wordStart, options = FuzzyScoreOptions.default) {\n    const patternLen = pattern.length > _maxLen ? _maxLen : pattern.length;\n    const wordLen = word.length > _maxLen ? _maxLen : word.length;\n    if (patternStart >= patternLen || wordStart >= wordLen || (patternLen - patternStart) > (wordLen - wordStart)) {\n        return undefined;\n    }\n    // Run a simple check if the characters of pattern occur\n    // (in order) at all in word. If that isn't the case we\n    // stop because no match will be possible\n    if (!isPatternInWord(patternLow, patternStart, patternLen, wordLow, wordStart, wordLen, true)) {\n        return undefined;\n    }\n    // Find the max matching word position for each pattern position\n    // NOTE: the min matching word position was filled in above, in the `isPatternInWord` call\n    _fillInMaxWordMatchPos(patternLen, wordLen, patternStart, wordStart, patternLow, wordLow);\n    let row = 1;\n    let column = 1;\n    let patternPos = patternStart;\n    let wordPos = wordStart;\n    const hasStrongFirstMatch = [false];\n    // There will be a match, fill in tables\n    for (row = 1, patternPos = patternStart; patternPos < patternLen; row++, patternPos++) {\n        // Reduce search space to possible matching word positions and to possible access from next row\n        const minWordMatchPos = _minWordMatchPos[patternPos];\n        const maxWordMatchPos = _maxWordMatchPos[patternPos];\n        const nextMaxWordMatchPos = (patternPos + 1 < patternLen ? _maxWordMatchPos[patternPos + 1] : wordLen);\n        for (column = minWordMatchPos - wordStart + 1, wordPos = minWordMatchPos; wordPos < nextMaxWordMatchPos; column++, wordPos++) {\n            let score = Number.MIN_SAFE_INTEGER;\n            let canComeDiag = false;\n            if (wordPos <= maxWordMatchPos) {\n                score = _doScore(pattern, patternLow, patternPos, patternStart, word, wordLow, wordPos, wordLen, wordStart, _diag[row - 1][column - 1] === 0, hasStrongFirstMatch);\n            }\n            let diagScore = 0;\n            if (score !== Number.MAX_SAFE_INTEGER) {\n                canComeDiag = true;\n                diagScore = score + _table[row - 1][column - 1];\n            }\n            const canComeLeft = wordPos > minWordMatchPos;\n            const leftScore = canComeLeft ? _table[row][column - 1] + (_diag[row][column - 1] > 0 ? -5 : 0) : 0; // penalty for a gap start\n            const canComeLeftLeft = wordPos > minWordMatchPos + 1 && _diag[row][column - 1] > 0;\n            const leftLeftScore = canComeLeftLeft ? _table[row][column - 2] + (_diag[row][column - 2] > 0 ? -5 : 0) : 0; // penalty for a gap start\n            if (canComeLeftLeft && (!canComeLeft || leftLeftScore >= leftScore) && (!canComeDiag || leftLeftScore >= diagScore)) {\n                // always prefer choosing left left to jump over a diagonal because that means a match is earlier in the word\n                _table[row][column] = leftLeftScore;\n                _arrows[row][column] = 3 /* Arrow.LeftLeft */;\n                _diag[row][column] = 0;\n            }\n            else if (canComeLeft && (!canComeDiag || leftScore >= diagScore)) {\n                // always prefer choosing left since that means a match is earlier in the word\n                _table[row][column] = leftScore;\n                _arrows[row][column] = 2 /* Arrow.Left */;\n                _diag[row][column] = 0;\n            }\n            else if (canComeDiag) {\n                _table[row][column] = diagScore;\n                _arrows[row][column] = 1 /* Arrow.Diag */;\n                _diag[row][column] = _diag[row - 1][column - 1] + 1;\n            }\n            else {\n                throw new Error(`not possible`);\n            }\n        }\n    }\n    if (_debug) {\n        printTables(pattern, patternStart, word, wordStart);\n    }\n    if (!hasStrongFirstMatch[0] && !options.firstMatchCanBeWeak) {\n        return undefined;\n    }\n    row--;\n    column--;\n    const result = [_table[row][column], wordStart];\n    let backwardsDiagLength = 0;\n    let maxMatchColumn = 0;\n    while (row >= 1) {\n        // Find the column where we go diagonally up\n        let diagColumn = column;\n        do {\n            const arrow = _arrows[row][diagColumn];\n            if (arrow === 3 /* Arrow.LeftLeft */) {\n                diagColumn = diagColumn - 2;\n            }\n            else if (arrow === 2 /* Arrow.Left */) {\n                diagColumn = diagColumn - 1;\n            }\n            else {\n                // found the diagonal\n                break;\n            }\n        } while (diagColumn >= 1);\n        // Overturn the \"forwards\" decision if keeping the \"backwards\" diagonal would give a better match\n        if (backwardsDiagLength > 1 // only if we would have a contiguous match of 3 characters\n            && patternLow[patternStart + row - 1] === wordLow[wordStart + column - 1] // only if we can do a contiguous match diagonally\n            && !isUpperCaseAtPos(diagColumn + wordStart - 1, word, wordLow) // only if the forwards chose diagonal is not an uppercase\n            && backwardsDiagLength + 1 > _diag[row][diagColumn] // only if our contiguous match would be longer than the \"forwards\" contiguous match\n        ) {\n            diagColumn = column;\n        }\n        if (diagColumn === column) {\n            // this is a contiguous match\n            backwardsDiagLength++;\n        }\n        else {\n            backwardsDiagLength = 1;\n        }\n        if (!maxMatchColumn) {\n            // remember the last matched column\n            maxMatchColumn = diagColumn;\n        }\n        row--;\n        column = diagColumn - 1;\n        result.push(column);\n    }\n    if (wordLen - wordStart === patternLen && options.boostFullMatch) {\n        // the word matches the pattern with all characters!\n        // giving the score a total match boost (to come up ahead other words)\n        result[0] += 2;\n    }\n    // Add 1 penalty for each skipped character in the word\n    const skippedCharsCount = maxMatchColumn - patternLen;\n    result[0] -= skippedCharsCount;\n    return result;\n}\nfunction _fillInMaxWordMatchPos(patternLen, wordLen, patternStart, wordStart, patternLow, wordLow) {\n    let patternPos = patternLen - 1;\n    let wordPos = wordLen - 1;\n    while (patternPos >= patternStart && wordPos >= wordStart) {\n        if (patternLow[patternPos] === wordLow[wordPos]) {\n            _maxWordMatchPos[patternPos] = wordPos;\n            patternPos--;\n        }\n        wordPos--;\n    }\n}\nfunction _doScore(pattern, patternLow, patternPos, patternStart, word, wordLow, wordPos, wordLen, wordStart, newMatchStart, outFirstMatchStrong) {\n    if (patternLow[patternPos] !== wordLow[wordPos]) {\n        return Number.MIN_SAFE_INTEGER;\n    }\n    let score = 1;\n    let isGapLocation = false;\n    if (wordPos === (patternPos - patternStart)) {\n        // common prefix: `foobar <-> foobaz`\n        //                            ^^^^^\n        score = pattern[patternPos] === word[wordPos] ? 7 : 5;\n    }\n    else if (isUpperCaseAtPos(wordPos, word, wordLow) && (wordPos === 0 || !isUpperCaseAtPos(wordPos - 1, word, wordLow))) {\n        // hitting upper-case: `foo <-> forOthers`\n        //                              ^^ ^\n        score = pattern[patternPos] === word[wordPos] ? 7 : 5;\n        isGapLocation = true;\n    }\n    else if (isSeparatorAtPos(wordLow, wordPos) && (wordPos === 0 || !isSeparatorAtPos(wordLow, wordPos - 1))) {\n        // hitting a separator: `. <-> foo.bar`\n        //                                ^\n        score = 5;\n    }\n    else if (isSeparatorAtPos(wordLow, wordPos - 1) || isWhitespaceAtPos(wordLow, wordPos - 1)) {\n        // post separator: `foo <-> bar_foo`\n        //                              ^^^\n        score = 5;\n        isGapLocation = true;\n    }\n    if (score > 1 && patternPos === patternStart) {\n        outFirstMatchStrong[0] = true;\n    }\n    if (!isGapLocation) {\n        isGapLocation = isUpperCaseAtPos(wordPos, word, wordLow) || isSeparatorAtPos(wordLow, wordPos - 1) || isWhitespaceAtPos(wordLow, wordPos - 1);\n    }\n    //\n    if (patternPos === patternStart) { // first character in pattern\n        if (wordPos > wordStart) {\n            // the first pattern character would match a word character that is not at the word start\n            // so introduce a penalty to account for the gap preceding this match\n            score -= isGapLocation ? 3 : 5;\n        }\n    }\n    else {\n        if (newMatchStart) {\n            // this would be the beginning of a new match (i.e. there would be a gap before this location)\n            score += isGapLocation ? 2 : 0;\n        }\n        else {\n            // this is part of a contiguous match, so give it a slight bonus, but do so only if it would not be a preferred gap location\n            score += isGapLocation ? 0 : 1;\n        }\n    }\n    if (wordPos + 1 === wordLen) {\n        // we always penalize gaps, but this gives unfair advantages to a match that would match the last character in the word\n        // so pretend there is a gap after the last character in the word to normalize things\n        score -= isGapLocation ? 3 : 5;\n    }\n    return score;\n}\n//#endregion\n//#region --- graceful ---\nexport function fuzzyScoreGracefulAggressive(pattern, lowPattern, patternPos, word, lowWord, wordPos, options) {\n    return fuzzyScoreWithPermutations(pattern, lowPattern, patternPos, word, lowWord, wordPos, true, options);\n}\nfunction fuzzyScoreWithPermutations(pattern, lowPattern, patternPos, word, lowWord, wordPos, aggressive, options) {\n    let top = fuzzyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos, options);\n    if (top && !aggressive) {\n        // when using the original pattern yield a result we`\n        // return it unless we are aggressive and try to find\n        // a better alignment, e.g. `cno` -> `^co^ns^ole` or `^c^o^nsole`.\n        return top;\n    }\n    if (pattern.length >= 3) {\n        // When the pattern is long enough then try a few (max 7)\n        // permutations of the pattern to find a better match. The\n        // permutations only swap neighbouring characters, e.g\n        // `cnoso` becomes `conso`, `cnsoo`, `cnoos`.\n        const tries = Math.min(7, pattern.length - 1);\n        for (let movingPatternPos = patternPos + 1; movingPatternPos < tries; movingPatternPos++) {\n            const newPattern = nextTypoPermutation(pattern, movingPatternPos);\n            if (newPattern) {\n                const candidate = fuzzyScore(newPattern, newPattern.toLowerCase(), patternPos, word, lowWord, wordPos, options);\n                if (candidate) {\n                    candidate[0] -= 3; // permutation penalty\n                    if (!top || candidate[0] > top[0]) {\n                        top = candidate;\n                    }\n                }\n            }\n        }\n    }\n    return top;\n}\nfunction nextTypoPermutation(pattern, patternPos) {\n    if (patternPos + 1 >= pattern.length) {\n        return undefined;\n    }\n    const swap1 = pattern[patternPos];\n    const swap2 = pattern[patternPos + 1];\n    if (swap1 === swap2) {\n        return undefined;\n    }\n    return pattern.slice(0, patternPos)\n        + swap2\n        + swap1\n        + pattern.slice(patternPos + 2);\n}\n//#endregion\n"],"names":["strings.startsWithIgnoreCase","strings.convertSimple2RegExpPattern","strings.isEmojiImprecise","FuzzyScore"],"mappings":";;AAcO,SAAS,MAAM,QAAQ;AAC1B,SAAO,SAAU,MAAM,oBAAoB;AACvC,aAAS,IAAI,GAAG,MAAM,OAAO,QAAQ,IAAI,KAAK,KAAK;AAC/C,YAAM,QAAQ,OAAO,CAAC,EAAE,MAAM,kBAAkB;AAChD,UAAI,OAAO;AACP,eAAO;AAAA,MACvB;AAAA,IACA;AACQ,WAAO;AAAA,EACV;AACL;AAEmC,eAAe,KAAK,QAAW,KAAK;AAC3D,MAAC,gBAAgB,eAAe,KAAK,QAAW,IAAI;AAChE,SAAS,eAAe,YAAY,MAAM,oBAAoB;AAC1D,MAAI,CAAC,sBAAsB,mBAAmB,SAAS,KAAK,QAAQ;AAChE,WAAO;AAAA,EACf;AACI,MAAI;AACJ,MAAI,YAAY;AACZ,cAAUA,qBAA6B,oBAAoB,IAAI;AAAA,EACvE,OACS;AACD,cAAU,mBAAmB,QAAQ,IAAI,MAAM;AAAA,EACvD;AACI,MAAI,CAAC,SAAS;AACV,WAAO;AAAA,EACf;AACI,SAAO,KAAK,SAAS,IAAI,CAAC,EAAE,OAAO,GAAG,KAAK,KAAK,OAAM,CAAE,IAAI,CAAE;AAClE;AAEO,SAAS,2BAA2B,MAAM,oBAAoB;AACjE,QAAM,QAAQ,mBAAmB,YAAW,EAAG,QAAQ,KAAK,aAAa;AACzE,MAAI,UAAU,IAAI;AACd,WAAO;AAAA,EACf;AACI,SAAO,CAAC,EAAE,OAAO,OAAO,KAAK,QAAQ,KAAK,QAAQ;AACtD;AAEO,SAAS,iBAAiB,MAAM,oBAAoB;AACvD,SAAO,kBAAkB,KAAK,YAAa,GAAE,mBAAmB,YAAa,GAAE,GAAG,CAAC;AACvF;AACA,SAAS,kBAAkB,MAAM,oBAAoB,GAAG,GAAG;AACvD,MAAI,MAAM,KAAK,QAAQ;AACnB,WAAO,CAAE;AAAA,EACjB,WACa,MAAM,mBAAmB,QAAQ;AACtC,WAAO;AAAA,EACf,OACS;AACD,QAAI,KAAK,CAAC,MAAM,mBAAmB,CAAC,GAAG;AACnC,UAAI,SAAS;AACb,UAAI,SAAS,kBAAkB,MAAM,oBAAoB,IAAI,GAAG,IAAI,CAAC,GAAG;AACpE,eAAO,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,EAAG,GAAE,MAAM;AAAA,MAC5D;AACY,aAAO;AAAA,IACnB;AACQ,WAAO,kBAAkB,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAAA,EACnE;AACA;AAEA,SAAS,QAAQ,MAAM;AACnB,SAAO,MAAuB,QAAQ,QAAQ;AAClD;AACO,SAAS,QAAQ,MAAM;AAC1B,SAAO,MAAuB,QAAQ,QAAQ;AAClD;AACA,SAAS,SAAS,MAAM;AACpB,SAAO,MAA4B,QAAQ,QAAQ;AACvD;AACA,SAAS,aAAa,MAAM;AACxB,SAAQ,SAAS,MACV,SAAS,KACT,SAAS,MACT,SAAS;AACpB;AACA,MAAM,iBAAiB,oBAAI,IAAK;AAGhC,uBACK,MAAM,EAAE,EACR,QAAQ,OAAK,eAAe,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;AA+BrD,SAAS,eAAe,MAAM;AAC1B,SAAO,QAAQ,IAAI,KAAK,QAAQ,IAAI,KAAK,SAAS,IAAI;AAC1D;AACA,SAAS,KAAK,MAAM,MAAM;AACtB,MAAI,KAAK,WAAW,GAAG;AACnB,WAAO,CAAC,IAAI;AAAA,EACpB,WACa,KAAK,QAAQ,KAAK,CAAC,EAAE,OAAO;AACjC,SAAK,CAAC,EAAE,QAAQ,KAAK;AAAA,EAC7B,OACS;AACD,SAAK,QAAQ,IAAI;AAAA,EACzB;AACI,SAAO;AACX;AACA,SAAS,WAAW,eAAe,OAAO;AACtC,WAAS,IAAI,OAAO,IAAI,cAAc,QAAQ,KAAK;AAC/C,UAAM,IAAI,cAAc,WAAW,CAAC;AACpC,QAAI,QAAQ,CAAC,KAAK,SAAS,CAAC,KAAM,IAAI,KAAK,CAAC,eAAe,cAAc,WAAW,IAAI,CAAC,CAAC,GAAI;AAC1F,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO,cAAc;AACzB;AACA,SAAS,kBAAkB,MAAM,eAAe,GAAG,GAAG;AAClD,MAAI,MAAM,KAAK,QAAQ;AACnB,WAAO,CAAE;AAAA,EACjB,WACa,MAAM,cAAc,QAAQ;AACjC,WAAO;AAAA,EACf,WACa,KAAK,CAAC,MAAM,cAAc,CAAC,EAAE,eAAe;AACjD,WAAO;AAAA,EACf,OACS;AACD,QAAI,SAAS;AACb,QAAI,iBAAiB,IAAI;AACzB,aAAS,kBAAkB,MAAM,eAAe,IAAI,GAAG,IAAI,CAAC;AAC5D,WAAO,CAAC,WAAW,iBAAiB,WAAW,eAAe,cAAc,KAAK,cAAc,QAAQ;AACnG,eAAS,kBAAkB,MAAM,eAAe,IAAI,GAAG,cAAc;AACrE;AAAA,IACZ;AACQ,WAAO,WAAW,OAAO,OAAO,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,EAAC,GAAI,MAAM;AAAA,EAC7E;AACA;AAGA,SAAS,qBAAqB,MAAM;AAChC,MAAI,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,UAAU,GAAG,OAAO;AACzD,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,WAAO,KAAK,WAAW,CAAC;AACxB,QAAI,QAAQ,IAAI,GAAG;AACf;AAAA,IACZ;AACQ,QAAI,QAAQ,IAAI,GAAG;AACf;AAAA,IACZ;AACQ,QAAI,eAAe,IAAI,GAAG;AACtB;AAAA,IACZ;AACQ,QAAI,SAAS,IAAI,GAAG;AAChB;AAAA,IACZ;AAAA,EACA;AACI,QAAM,eAAe,QAAQ,KAAK;AAClC,QAAM,eAAe,QAAQ,KAAK;AAClC,QAAM,eAAe,QAAQ,KAAK;AAClC,QAAM,iBAAiB,UAAU,KAAK;AACtC,SAAO,EAAE,cAAc,cAAc,cAAc,eAAgB;AACvE;AACA,SAAS,gBAAgB,UAAU;AAC/B,QAAM,EAAE,cAAc,aAAY,IAAK;AACvC,SAAO,iBAAiB,KAAK,eAAe;AAChD;AACA,SAAS,gBAAgB,UAAU;AAC/B,QAAM,EAAE,cAAc,cAAc,cAAc,eAAgB,IAAG;AACrE,SAAO,eAAe,OAAO,eAAe,OAAO,eAAe,OAAO,iBAAiB;AAC9F;AAGA,SAAS,mBAAmB,MAAM;AAC9B,MAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,aAAa;AACjD,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,WAAO,KAAK,WAAW,CAAC;AACxB,QAAI,QAAQ,IAAI,GAAG;AACf;AAAA,IACZ;AACQ,QAAI,QAAQ,IAAI,GAAG;AACf;AAAA,IACZ;AACQ,QAAI,aAAa,IAAI,GAAG;AACpB;AAAA,IACZ;AAAA,EACA;AACI,OAAK,UAAU,KAAK,UAAU,MAAM,eAAe,GAAG;AAClD,WAAO,KAAK,UAAU;AAAA,EAC9B,OACS;AACD,WAAO,SAAS;AAAA,EACxB;AACA;AACO,SAAS,iBAAiB,MAAM,eAAe;AAClD,MAAI,CAAC,eAAe;AAChB,WAAO;AAAA,EACf;AACI,kBAAgB,cAAc,KAAM;AACpC,MAAI,cAAc,WAAW,GAAG;AAC5B,WAAO;AAAA,EACf;AACI,MAAI,CAAC,mBAAmB,IAAI,GAAG;AAC3B,WAAO;AAAA,EACf;AAEI,MAAI,cAAc,SAAS,IAAI;AAC3B,oBAAgB,cAAc,UAAU,GAAG,EAAE;AAAA,EACrD;AACI,QAAM,WAAW,qBAAqB,aAAa;AACnD,MAAI,CAAC,gBAAgB,QAAQ,GAAG;AAC5B,QAAI,CAAC,gBAAgB,QAAQ,GAAG;AAC5B,aAAO;AAAA,IACnB;AACQ,oBAAgB,cAAc,YAAa;AAAA,EACnD;AACI,MAAI,SAAS;AACb,MAAI,IAAI;AACR,SAAO,KAAK,YAAa;AACzB,SAAO,IAAI,cAAc,WAAW,SAAS,kBAAkB,MAAM,eAAe,GAAG,CAAC,OAAO,MAAM;AACjG,QAAI,WAAW,eAAe,IAAI,CAAC;AAAA,EAC3C;AACI,SAAO;AACX;AAiFA,MAAM,wBAAwB,GAAG,eAAe,kBAAkB,0BAA0B;AAC5F,MAAM,sBAAsB,GAAG,eAAe,kBAAkB,gBAAgB;AAChF,MAAM,mBAAmB,IAAI,SAAS,GAAK;AACpC,SAAS,aAAa,MAAM,oBAAoB,kCAAkC,OAAO;AAC5F,MAAI,OAAO,SAAS,YAAY,OAAO,uBAAuB,UAAU;AACpE,WAAO;AAAA,EACf;AAEI,MAAI,SAAS,iBAAiB,IAAI,IAAI;AACtC,MAAI,CAAC,QAAQ;AACT,aAAS,IAAI,OAAOC,4BAAoC,IAAI,GAAG,GAAG;AAClE,qBAAiB,IAAI,MAAM,MAAM;AAAA,EACzC;AAEI,QAAM,QAAQ,OAAO,KAAK,kBAAkB;AAC5C,MAAI,OAAO;AACP,WAAO,CAAC,EAAE,OAAO,MAAM,OAAO,KAAK,MAAM,QAAQ,MAAM,CAAC,EAAE,OAAM,CAAE;AAAA,EAC1E;AAEI,SAAO,kCAAkC,oBAAoB,MAAM,kBAAkB,IAAI,sBAAsB,MAAM,kBAAkB;AAC3I;AAKO,SAAS,cAAc,SAAS,MAAM;AACzC,QAAM,QAAQ,WAAW,SAAS,QAAQ,YAAW,GAAI,GAAG,MAAM,KAAK,YAAW,GAAI,GAAG,EAAE,qBAAqB,MAAM,gBAAgB,MAAM;AAC5I,SAAO,QAAQ,cAAc,KAAK,IAAI;AAC1C;AACO,SAAS,SAAS,SAAS,YAAY,YAAY,MAAM,SAAS,SAAS;AAC9E,QAAM,MAAM,KAAK,IAAI,IAAI,QAAQ,MAAM;AACvC,SAAO,aAAa,KAAK,cAAc;AACnC,UAAM,SAAS,WAAW,SAAS,YAAY,YAAY,MAAM,SAAS,SAAS,EAAE,qBAAqB,MAAM,gBAAgB,KAAI,CAAE;AACtI,QAAI,QAAQ;AACR,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO,CAAC,GAAG,OAAO;AACtB;AAEO,SAAS,cAAc,OAAO;AACjC,MAAI,OAAO,UAAU,aAAa;AAC9B,WAAO,CAAE;AAAA,EACjB;AACI,QAAM,MAAM,CAAE;AACd,QAAM,UAAU,MAAM,CAAC;AACvB,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACvC,UAAM,MAAM,MAAM,CAAC,IAAI;AACvB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAI,QAAQ,KAAK,QAAQ,KAAK;AAC1B,WAAK,MAAM,MAAM;AAAA,IAC7B,OACa;AACD,UAAI,KAAK,EAAE,OAAO,KAAK,KAAK,MAAM,GAAG;AAAA,IACjD;AAAA,EACA;AACI,SAAO;AACX;AACA,MAAM,UAAU;AAChB,SAAS,YAAY;AACjB,QAAM,QAAQ,CAAE;AAChB,QAAM,MAAM,CAAE;AACd,WAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AAC/B,QAAI,CAAC,IAAI;AAAA,EACjB;AACI,WAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AAC/B,UAAM,KAAK,IAAI,MAAM,CAAC,CAAC;AAAA,EAC/B;AACI,SAAO;AACX;AACA,SAAS,QAAQ,QAAQ;AACrB,QAAM,MAAM,CAAE;AACd,WAAS,IAAI,GAAG,KAAK,QAAQ,KAAK;AAC9B,QAAI,CAAC,IAAI;AAAA,EACjB;AACI,SAAO;AACX;AACA,MAAM,mBAAmB,QAAQ,IAAI,OAAO;AAC5C,MAAM,mBAAmB,QAAQ,IAAI,OAAO;AAC5C,MAAM,QAAQ,UAAS;AACvB,MAAM,SAAS,UAAW;AAC1B,MAAM,UAAU,UAAW;AA4B3B,SAAS,iBAAiB,OAAO,OAAO;AACpC,MAAI,QAAQ,KAAK,SAAS,MAAM,QAAQ;AACpC,WAAO;AAAA,EACf;AACI,QAAM,OAAO,MAAM,YAAY,KAAK;AACpC,UAAQ,MAAI;AAAA,IACR,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX;AACI,UAAIC,iBAAyB,IAAI,GAAG;AAChC,eAAO;AAAA,MACvB;AACY,aAAO;AAAA,EACnB;AACA;AACA,SAAS,kBAAkB,OAAO,OAAO;AACrC,MAAI,QAAQ,KAAK,SAAS,MAAM,QAAQ;AACpC,WAAO;AAAA,EACf;AACI,QAAM,OAAO,MAAM,WAAW,KAAK;AACnC,UAAQ,MAAI;AAAA,IACR,KAAK;AAAA,IACL,KAAK;AACD,aAAO;AAAA,IACX;AACI,aAAO;AAAA,EACnB;AACA;AACA,SAAS,iBAAiB,KAAK,MAAM,SAAS;AAC1C,SAAO,KAAK,GAAG,MAAM,QAAQ,GAAG;AACpC;AACO,SAAS,gBAAgB,YAAY,YAAY,YAAY,SAAS,SAAS,SAAS,oBAAoB,OAAO;AACtH,SAAO,aAAa,cAAc,UAAU,SAAS;AACjD,QAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,GAAG;AAC7C,UAAI,mBAAmB;AAEnB,yBAAiB,UAAU,IAAI;AAAA,MAC/C;AACY,oBAAc;AAAA,IAC1B;AACQ,eAAW;AAAA,EACnB;AACI,SAAO,eAAe;AAC1B;AACU,IAAC;AAAA,CACV,SAAUC,aAAY;AAInB,EAAAA,YAAW,UAAW,CAAC,MAAM,CAAC;AAC9B,WAAS,UAAU,OAAO;AACtB,WAAO,CAAC,SAAU,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,QAAQ,MAAM,CAAC,MAAM;AAAA,EAClF;AACI,EAAAA,YAAW,YAAY;AAC3B,GAAG,eAAe,aAAa,CAAA,EAAG;AAC3B,MAAM,qBAAN,MAAM,mBAAkB;AAAA,EAE3B,YAAY,qBAAqB,gBAAgB;AAC7C,SAAK,sBAAsB;AAC3B,SAAK,iBAAiB;AAAA,EAC9B;AACA;AALa,mBAAK,UAAU,EAAE,gBAAgB,MAAM,qBAAqB;AADlE,IAAM,oBAAN;AAOA,SAAS,WAAW,SAAS,YAAY,cAAc,MAAM,SAAS,WAAW,UAAU,kBAAkB,SAAS;AACzH,QAAM,aAAa,QAAQ,SAAS,UAAU,UAAU,QAAQ;AAChE,QAAM,UAAU,KAAK,SAAS,UAAU,UAAU,KAAK;AACvD,MAAI,gBAAgB,cAAc,aAAa,WAAY,aAAa,eAAiB,UAAU,WAAY;AAC3G,WAAO;AAAA,EACf;AAII,MAAI,CAAC,gBAAgB,YAAY,cAAc,YAAY,SAAS,WAAW,SAAS,IAAI,GAAG;AAC3F,WAAO;AAAA,EACf;AAGI,yBAAuB,YAAY,SAAS,cAAc,WAAW,YAAY,OAAO;AACxF,MAAI,MAAM;AACV,MAAI,SAAS;AACb,MAAI,aAAa;AACjB,MAAI,UAAU;AACd,QAAM,sBAAsB,CAAC,KAAK;AAElC,OAAK,MAAM,GAAG,aAAa,cAAc,aAAa,YAAY,OAAO,cAAc;AAEnF,UAAM,kBAAkB,iBAAiB,UAAU;AACnD,UAAM,kBAAkB,iBAAiB,UAAU;AACnD,UAAM,sBAAuB,aAAa,IAAI,aAAa,iBAAiB,aAAa,CAAC,IAAI;AAC9F,SAAK,SAAS,kBAAkB,YAAY,GAAG,UAAU,iBAAiB,UAAU,qBAAqB,UAAU,WAAW;AAC1H,UAAI,QAAQ,OAAO;AACnB,UAAI,cAAc;AAClB,UAAI,WAAW,iBAAiB;AAC5B,gBAAQ,SAAS,SAAS,YAAY,YAAY,cAAc,MAAM,SAAS,SAAS,SAAS,WAAW,MAAM,MAAM,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,mBAAmB;AAAA,MACjL;AACY,UAAI,YAAY;AAChB,UAAI,UAAU,OAAO,kBAAkB;AACnC,sBAAc;AACd,oBAAY,QAAQ,OAAO,MAAM,CAAC,EAAE,SAAS,CAAC;AAAA,MAC9D;AACY,YAAM,cAAc,UAAU;AAC9B,YAAM,YAAY,cAAc,OAAO,GAAG,EAAE,SAAS,CAAC,KAAK,MAAM,GAAG,EAAE,SAAS,CAAC,IAAI,IAAI,KAAK,KAAK;AAClG,YAAM,kBAAkB,UAAU,kBAAkB,KAAK,MAAM,GAAG,EAAE,SAAS,CAAC,IAAI;AAClF,YAAM,gBAAgB,kBAAkB,OAAO,GAAG,EAAE,SAAS,CAAC,KAAK,MAAM,GAAG,EAAE,SAAS,CAAC,IAAI,IAAI,KAAK,KAAK;AAC1G,UAAI,oBAAoB,CAAC,eAAe,iBAAiB,eAAe,CAAC,eAAe,iBAAiB,YAAY;AAEjH,eAAO,GAAG,EAAE,MAAM,IAAI;AACtB,gBAAQ,GAAG,EAAE,MAAM,IAAI;AACvB,cAAM,GAAG,EAAE,MAAM,IAAI;AAAA,MACrC,WACqB,gBAAgB,CAAC,eAAe,aAAa,YAAY;AAE9D,eAAO,GAAG,EAAE,MAAM,IAAI;AACtB,gBAAQ,GAAG,EAAE,MAAM,IAAI;AACvB,cAAM,GAAG,EAAE,MAAM,IAAI;AAAA,MACrC,WACqB,aAAa;AAClB,eAAO,GAAG,EAAE,MAAM,IAAI;AACtB,gBAAQ,GAAG,EAAE,MAAM,IAAI;AACvB,cAAM,GAAG,EAAE,MAAM,IAAI,MAAM,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI;AAAA,MAClE,OACiB;AACD,cAAM,IAAI,MAAM,cAAc;AAAA,MAC9C;AAAA,IACA;AAAA,EACA;AAII,MAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,QAAQ,qBAAqB;AACzD,WAAO;AAAA,EACf;AACI;AACA;AACA,QAAM,SAAS,CAAC,OAAO,GAAG,EAAE,MAAM,GAAG,SAAS;AAC9C,MAAI,sBAAsB;AAC1B,MAAI,iBAAiB;AACrB,SAAO,OAAO,GAAG;AAEb,QAAI,aAAa;AACjB,OAAG;AACC,YAAM,QAAQ,QAAQ,GAAG,EAAE,UAAU;AACrC,UAAI,UAAU,GAAwB;AAClC,qBAAa,aAAa;AAAA,MAC1C,WACqB,UAAU,GAAoB;AACnC,qBAAa,aAAa;AAAA,MAC1C,OACiB;AAED;AAAA,MAChB;AAAA,IACS,SAAQ,cAAc;AAEvB,QAAI,sBAAsB,KACnB,WAAW,eAAe,MAAM,CAAC,MAAM,QAAQ,YAAY,SAAS,CAAC,KACrE,CAAC,iBAAiB,aAAa,YAAY,GAAG,MAAM,OAAO,KAC3D,sBAAsB,IAAI,MAAM,GAAG,EAAE,UAAU,GACpD;AACE,mBAAa;AAAA,IACzB;AACQ,QAAI,eAAe,QAAQ;AAEvB;AAAA,IACZ,OACa;AACD,4BAAsB;AAAA,IAClC;AACQ,QAAI,CAAC,gBAAgB;AAEjB,uBAAiB;AAAA,IAC7B;AACQ;AACA,aAAS,aAAa;AACtB,WAAO,KAAK,MAAM;AAAA,EAC1B;AACI,MAAI,UAAU,cAAc,cAAc,QAAQ,gBAAgB;AAG9D,WAAO,CAAC,KAAK;AAAA,EACrB;AAEI,QAAM,oBAAoB,iBAAiB;AAC3C,SAAO,CAAC,KAAK;AACb,SAAO;AACX;AACA,SAAS,uBAAuB,YAAY,SAAS,cAAc,WAAW,YAAY,SAAS;AAC/F,MAAI,aAAa,aAAa;AAC9B,MAAI,UAAU,UAAU;AACxB,SAAO,cAAc,gBAAgB,WAAW,WAAW;AACvD,QAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,GAAG;AAC7C,uBAAiB,UAAU,IAAI;AAC/B;AAAA,IACZ;AACQ;AAAA,EACR;AACA;AACA,SAAS,SAAS,SAAS,YAAY,YAAY,cAAc,MAAM,SAAS,SAAS,SAAS,WAAW,eAAe,qBAAqB;AAC7I,MAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,GAAG;AAC7C,WAAO,OAAO;AAAA,EACtB;AACI,MAAI,QAAQ;AACZ,MAAI,gBAAgB;AACpB,MAAI,YAAa,aAAa,cAAe;AAGzC,YAAQ,QAAQ,UAAU,MAAM,KAAK,OAAO,IAAI,IAAI;AAAA,EAC5D,WACa,iBAAiB,SAAS,MAAM,OAAO,MAAM,YAAY,KAAK,CAAC,iBAAiB,UAAU,GAAG,MAAM,OAAO,IAAI;AAGnH,YAAQ,QAAQ,UAAU,MAAM,KAAK,OAAO,IAAI,IAAI;AACpD,oBAAgB;AAAA,EACxB,WACa,iBAAiB,SAAS,OAAO,MAAM,YAAY,KAAK,CAAC,iBAAiB,SAAS,UAAU,CAAC,IAAI;AAGvG,YAAQ;AAAA,EAChB,WACa,iBAAiB,SAAS,UAAU,CAAC,KAAK,kBAAkB,SAAS,UAAU,CAAC,GAAG;AAGxF,YAAQ;AACR,oBAAgB;AAAA,EACxB;AACI,MAAI,QAAQ,KAAK,eAAe,cAAc;AAC1C,wBAAoB,CAAC,IAAI;AAAA,EACjC;AACI,MAAI,CAAC,eAAe;AAChB,oBAAgB,iBAAiB,SAAS,MAAM,OAAO,KAAK,iBAAiB,SAAS,UAAU,CAAC,KAAK,kBAAkB,SAAS,UAAU,CAAC;AAAA,EACpJ;AAEI,MAAI,eAAe,cAAc;AAC7B,QAAI,UAAU,WAAW;AAGrB,eAAS,gBAAgB,IAAI;AAAA,IACzC;AAAA,EACA,OACS;AACD,QAAI,eAAe;AAEf,eAAS,gBAAgB,IAAI;AAAA,IACzC,OACa;AAED,eAAS,gBAAgB,IAAI;AAAA,IACzC;AAAA,EACA;AACI,MAAI,UAAU,MAAM,SAAS;AAGzB,aAAS,gBAAgB,IAAI;AAAA,EACrC;AACI,SAAO;AACX;AAGO,SAAS,6BAA6B,SAAS,YAAY,YAAY,MAAM,SAAS,SAAS,SAAS;AAC3G,SAAO,2BAA2B,SAAS,YAAY,YAAY,MAAM,SAAS,SAAS,MAAM,OAAO;AAC5G;AACA,SAAS,2BAA2B,SAAS,YAAY,YAAY,MAAM,SAAS,SAAS,YAAY,SAAS;AAC9G,MAAI,MAAM,WAAW,SAAS,YAAY,YAAY,MAAM,SAAS,SAAS,OAAO;AACrF,MAAI,OAAO,OAAa;AAIpB,WAAO;AAAA,EACf;AACI,MAAI,QAAQ,UAAU,GAAG;AAKrB,UAAM,QAAQ,KAAK,IAAI,GAAG,QAAQ,SAAS,CAAC;AAC5C,aAAS,mBAAmB,aAAa,GAAG,mBAAmB,OAAO,oBAAoB;AACtF,YAAM,aAAa,oBAAoB,SAAS,gBAAgB;AAChE,UAAI,YAAY;AACZ,cAAM,YAAY,WAAW,YAAY,WAAW,eAAe,YAAY,MAAM,SAAS,SAAS,OAAO;AAC9G,YAAI,WAAW;AACX,oBAAU,CAAC,KAAK;AAChB,cAAI,CAAC,OAAO,UAAU,CAAC,IAAI,IAAI,CAAC,GAAG;AAC/B,kBAAM;AAAA,UAC9B;AAAA,QACA;AAAA,MACA;AAAA,IACA;AAAA,EACA;AACI,SAAO;AACX;AACA,SAAS,oBAAoB,SAAS,YAAY;AAC9C,MAAI,aAAa,KAAK,QAAQ,QAAQ;AAClC,WAAO;AAAA,EACf;AACI,QAAM,QAAQ,QAAQ,UAAU;AAChC,QAAM,QAAQ,QAAQ,aAAa,CAAC;AACpC,MAAI,UAAU,OAAO;AACjB,WAAO;AAAA,EACf;AACI,SAAO,QAAQ,MAAM,GAAG,UAAU,IAC5B,QACA,QACA,QAAQ,MAAM,aAAa,CAAC;AACtC;","x_google_ignoreList":[0]}
+{"version":3,"file":"filters.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/filters.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { LRUCache } from './map.js';\nimport { getKoreanAltChars } from './naturalLanguage/korean.js';\nimport * as strings from './strings.js';\n// Combined filters\n/**\n * @returns A filter which combines the provided set\n * of filters with an or. The *first* filters that\n * matches defined the return value of the returned\n * filter.\n */\nexport function or(...filter) {\n    return function (word, wordToMatchAgainst) {\n        for (let i = 0, len = filter.length; i < len; i++) {\n            const match = filter[i](word, wordToMatchAgainst);\n            if (match) {\n                return match;\n            }\n        }\n        return null;\n    };\n}\n// Prefix\nexport const matchesStrictPrefix = _matchesPrefix.bind(undefined, false);\nexport const matchesPrefix = _matchesPrefix.bind(undefined, true);\nfunction _matchesPrefix(ignoreCase, word, wordToMatchAgainst) {\n    if (!wordToMatchAgainst || wordToMatchAgainst.length < word.length) {\n        return null;\n    }\n    let matches;\n    if (ignoreCase) {\n        matches = strings.startsWithIgnoreCase(wordToMatchAgainst, word);\n    }\n    else {\n        matches = wordToMatchAgainst.indexOf(word) === 0;\n    }\n    if (!matches) {\n        return null;\n    }\n    return word.length > 0 ? [{ start: 0, end: word.length }] : [];\n}\n// Contiguous Substring\nexport function matchesContiguousSubString(word, wordToMatchAgainst) {\n    const index = wordToMatchAgainst.toLowerCase().indexOf(word.toLowerCase());\n    if (index === -1) {\n        return null;\n    }\n    return [{ start: index, end: index + word.length }];\n}\n// Substring\nexport function matchesSubString(word, wordToMatchAgainst) {\n    return _matchesSubString(word.toLowerCase(), wordToMatchAgainst.toLowerCase(), 0, 0);\n}\nfunction _matchesSubString(word, wordToMatchAgainst, i, j) {\n    if (i === word.length) {\n        return [];\n    }\n    else if (j === wordToMatchAgainst.length) {\n        return null;\n    }\n    else {\n        if (word[i] === wordToMatchAgainst[j]) {\n            let result = null;\n            if (result = _matchesSubString(word, wordToMatchAgainst, i + 1, j + 1)) {\n                return join({ start: j, end: j + 1 }, result);\n            }\n            return null;\n        }\n        return _matchesSubString(word, wordToMatchAgainst, i, j + 1);\n    }\n}\n// CamelCase\nfunction isLower(code) {\n    return 97 /* CharCode.a */ <= code && code <= 122 /* CharCode.z */;\n}\nexport function isUpper(code) {\n    return 65 /* CharCode.A */ <= code && code <= 90 /* CharCode.Z */;\n}\nfunction isNumber(code) {\n    return 48 /* CharCode.Digit0 */ <= code && code <= 57 /* CharCode.Digit9 */;\n}\nfunction isWhitespace(code) {\n    return (code === 32 /* CharCode.Space */\n        || code === 9 /* CharCode.Tab */\n        || code === 10 /* CharCode.LineFeed */\n        || code === 13 /* CharCode.CarriageReturn */);\n}\nconst wordSeparators = new Set();\n// These are chosen as natural word separators based on writen text.\n// It is a subset of the word separators used by the monaco editor.\n'()[]{}<>`\\'\"-/;:,.?!'\n    .split('')\n    .forEach(s => wordSeparators.add(s.charCodeAt(0)));\nfunction isWordSeparator(code) {\n    return isWhitespace(code) || wordSeparators.has(code);\n}\nfunction charactersMatch(codeA, codeB) {\n    return (codeA === codeB) || (isWordSeparator(codeA) && isWordSeparator(codeB));\n}\nconst alternateCharsCache = new Map();\n/**\n * Gets alternative codes to the character code passed in. This comes in the\n * form of an array of character codes, all of which must match _in order_ to\n * successfully match.\n *\n * @param code The character code to check.\n */\nfunction getAlternateCodes(code) {\n    if (alternateCharsCache.has(code)) {\n        return alternateCharsCache.get(code);\n    }\n    // NOTE: This function is written in such a way that it can be extended in\n    // the future, but right now the return type takes into account it's only\n    // supported by a single \"alt codes provider\".\n    // `ArrayLike<ArrayLike<number>>` is a more appropriate type if changed.\n    let result;\n    const codes = getKoreanAltChars(code);\n    if (codes) {\n        result = codes;\n    }\n    alternateCharsCache.set(code, result);\n    return result;\n}\nfunction isAlphanumeric(code) {\n    return isLower(code) || isUpper(code) || isNumber(code);\n}\nfunction join(head, tail) {\n    if (tail.length === 0) {\n        tail = [head];\n    }\n    else if (head.end === tail[0].start) {\n        tail[0].start = head.start;\n    }\n    else {\n        tail.unshift(head);\n    }\n    return tail;\n}\nfunction nextAnchor(camelCaseWord, start) {\n    for (let i = start; i < camelCaseWord.length; i++) {\n        const c = camelCaseWord.charCodeAt(i);\n        if (isUpper(c) || isNumber(c) || (i > 0 && !isAlphanumeric(camelCaseWord.charCodeAt(i - 1)))) {\n            return i;\n        }\n    }\n    return camelCaseWord.length;\n}\nfunction _matchesCamelCase(word, camelCaseWord, i, j) {\n    if (i === word.length) {\n        return [];\n    }\n    else if (j === camelCaseWord.length) {\n        return null;\n    }\n    else if (word[i] !== camelCaseWord[j].toLowerCase()) {\n        return null;\n    }\n    else {\n        let result = null;\n        let nextUpperIndex = j + 1;\n        result = _matchesCamelCase(word, camelCaseWord, i + 1, j + 1);\n        while (!result && (nextUpperIndex = nextAnchor(camelCaseWord, nextUpperIndex)) < camelCaseWord.length) {\n            result = _matchesCamelCase(word, camelCaseWord, i + 1, nextUpperIndex);\n            nextUpperIndex++;\n        }\n        return result === null ? null : join({ start: j, end: j + 1 }, result);\n    }\n}\n// Heuristic to avoid computing camel case matcher for words that don't\n// look like camelCaseWords.\nfunction analyzeCamelCaseWord(word) {\n    let upper = 0, lower = 0, alpha = 0, numeric = 0, code = 0;\n    for (let i = 0; i < word.length; i++) {\n        code = word.charCodeAt(i);\n        if (isUpper(code)) {\n            upper++;\n        }\n        if (isLower(code)) {\n            lower++;\n        }\n        if (isAlphanumeric(code)) {\n            alpha++;\n        }\n        if (isNumber(code)) {\n            numeric++;\n        }\n    }\n    const upperPercent = upper / word.length;\n    const lowerPercent = lower / word.length;\n    const alphaPercent = alpha / word.length;\n    const numericPercent = numeric / word.length;\n    return { upperPercent, lowerPercent, alphaPercent, numericPercent };\n}\nfunction isUpperCaseWord(analysis) {\n    const { upperPercent, lowerPercent } = analysis;\n    return lowerPercent === 0 && upperPercent > 0.6;\n}\nfunction isCamelCaseWord(analysis) {\n    const { upperPercent, lowerPercent, alphaPercent, numericPercent } = analysis;\n    return lowerPercent > 0.2 && upperPercent < 0.8 && alphaPercent > 0.6 && numericPercent < 0.2;\n}\n// Heuristic to avoid computing camel case matcher for words that don't\n// look like camel case patterns.\nfunction isCamelCasePattern(word) {\n    let upper = 0, lower = 0, code = 0, whitespace = 0;\n    for (let i = 0; i < word.length; i++) {\n        code = word.charCodeAt(i);\n        if (isUpper(code)) {\n            upper++;\n        }\n        if (isLower(code)) {\n            lower++;\n        }\n        if (isWhitespace(code)) {\n            whitespace++;\n        }\n    }\n    if ((upper === 0 || lower === 0) && whitespace === 0) {\n        return word.length <= 30;\n    }\n    else {\n        return upper <= 5;\n    }\n}\nexport function matchesCamelCase(word, camelCaseWord) {\n    if (!camelCaseWord) {\n        return null;\n    }\n    camelCaseWord = camelCaseWord.trim();\n    if (camelCaseWord.length === 0) {\n        return null;\n    }\n    if (!isCamelCasePattern(word)) {\n        return null;\n    }\n    // TODO: Consider removing this check\n    if (camelCaseWord.length > 60) {\n        camelCaseWord = camelCaseWord.substring(0, 60);\n    }\n    const analysis = analyzeCamelCaseWord(camelCaseWord);\n    if (!isCamelCaseWord(analysis)) {\n        if (!isUpperCaseWord(analysis)) {\n            return null;\n        }\n        camelCaseWord = camelCaseWord.toLowerCase();\n    }\n    let result = null;\n    let i = 0;\n    word = word.toLowerCase();\n    while (i < camelCaseWord.length && (result = _matchesCamelCase(word, camelCaseWord, 0, i)) === null) {\n        i = nextAnchor(camelCaseWord, i + 1);\n    }\n    return result;\n}\n// Matches beginning of words supporting non-ASCII languages\n// If `contiguous` is true then matches word with beginnings of the words in the target. E.g. \"pul\" will match \"Git: Pull\"\n// Otherwise also matches sub string of the word with beginnings of the words in the target. E.g. \"gp\" or \"g p\" will match \"Git: Pull\"\n// Useful in cases where the target is words (e.g. command labels)\nexport function matchesWords(word, target, contiguous = false) {\n    if (!target || target.length === 0) {\n        return null;\n    }\n    let result = null;\n    let targetIndex = 0;\n    word = word.toLowerCase();\n    target = target.toLowerCase();\n    while (targetIndex < target.length) {\n        result = _matchesWords(word, target, 0, targetIndex, contiguous);\n        if (result !== null) {\n            break;\n        }\n        targetIndex = nextWord(target, targetIndex + 1);\n    }\n    return result;\n}\nfunction _matchesWords(word, target, wordIndex, targetIndex, contiguous) {\n    let targetIndexOffset = 0;\n    if (wordIndex === word.length) {\n        return [];\n    }\n    else if (targetIndex === target.length) {\n        return null;\n    }\n    else if (!charactersMatch(word.charCodeAt(wordIndex), target.charCodeAt(targetIndex))) {\n        // Verify alternate characters before exiting\n        const altChars = getAlternateCodes(word.charCodeAt(wordIndex));\n        if (!altChars) {\n            return null;\n        }\n        for (let k = 0; k < altChars.length; k++) {\n            if (!charactersMatch(altChars[k], target.charCodeAt(targetIndex + k))) {\n                return null;\n            }\n        }\n        targetIndexOffset += altChars.length - 1;\n    }\n    let result = null;\n    let nextWordIndex = targetIndex + targetIndexOffset + 1;\n    result = _matchesWords(word, target, wordIndex + 1, nextWordIndex, contiguous);\n    if (!contiguous) {\n        while (!result && (nextWordIndex = nextWord(target, nextWordIndex)) < target.length) {\n            result = _matchesWords(word, target, wordIndex + 1, nextWordIndex, contiguous);\n            nextWordIndex++;\n        }\n    }\n    if (!result) {\n        return null;\n    }\n    // If the characters don't exactly match, then they must be word separators (see charactersMatch(...)).\n    // We don't want to include this in the matches but we don't want to throw the target out all together so we return `result`.\n    if (word.charCodeAt(wordIndex) !== target.charCodeAt(targetIndex)) {\n        // Verify alternate characters before exiting\n        const altChars = getAlternateCodes(word.charCodeAt(wordIndex));\n        if (!altChars) {\n            return result;\n        }\n        for (let k = 0; k < altChars.length; k++) {\n            if (altChars[k] !== target.charCodeAt(targetIndex + k)) {\n                return result;\n            }\n        }\n    }\n    return join({ start: targetIndex, end: targetIndex + targetIndexOffset + 1 }, result);\n}\nfunction nextWord(word, start) {\n    for (let i = start; i < word.length; i++) {\n        if (isWordSeparator(word.charCodeAt(i)) ||\n            (i > 0 && isWordSeparator(word.charCodeAt(i - 1)))) {\n            return i;\n        }\n    }\n    return word.length;\n}\n// Fuzzy\nconst fuzzyContiguousFilter = or(matchesPrefix, matchesCamelCase, matchesContiguousSubString);\nconst fuzzySeparateFilter = or(matchesPrefix, matchesCamelCase, matchesSubString);\nconst fuzzyRegExpCache = new LRUCache(10000); // bounded to 10000 elements\nexport function matchesFuzzy(word, wordToMatchAgainst, enableSeparateSubstringMatching = false) {\n    if (typeof word !== 'string' || typeof wordToMatchAgainst !== 'string') {\n        return null; // return early for invalid input\n    }\n    // Form RegExp for wildcard matches\n    let regexp = fuzzyRegExpCache.get(word);\n    if (!regexp) {\n        regexp = new RegExp(strings.convertSimple2RegExpPattern(word), 'i');\n        fuzzyRegExpCache.set(word, regexp);\n    }\n    // RegExp Filter\n    const match = regexp.exec(wordToMatchAgainst);\n    if (match) {\n        return [{ start: match.index, end: match.index + match[0].length }];\n    }\n    // Default Filter\n    return enableSeparateSubstringMatching ? fuzzySeparateFilter(word, wordToMatchAgainst) : fuzzyContiguousFilter(word, wordToMatchAgainst);\n}\n/**\n * Match pattern against word in a fuzzy way. As in IntelliSense and faster and more\n * powerful than `matchesFuzzy`\n */\nexport function matchesFuzzy2(pattern, word) {\n    const score = fuzzyScore(pattern, pattern.toLowerCase(), 0, word, word.toLowerCase(), 0, { firstMatchCanBeWeak: true, boostFullMatch: true });\n    return score ? createMatches(score) : null;\n}\nexport function anyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos) {\n    const max = Math.min(13, pattern.length);\n    for (; patternPos < max; patternPos++) {\n        const result = fuzzyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos, { firstMatchCanBeWeak: true, boostFullMatch: true });\n        if (result) {\n            return result;\n        }\n    }\n    return [0, wordPos];\n}\n//#region --- fuzzyScore ---\nexport function createMatches(score) {\n    if (typeof score === 'undefined') {\n        return [];\n    }\n    const res = [];\n    const wordPos = score[1];\n    for (let i = score.length - 1; i > 1; i--) {\n        const pos = score[i] + wordPos;\n        const last = res[res.length - 1];\n        if (last && last.end === pos) {\n            last.end = pos + 1;\n        }\n        else {\n            res.push({ start: pos, end: pos + 1 });\n        }\n    }\n    return res;\n}\nconst _maxLen = 128;\nfunction initTable() {\n    const table = [];\n    const row = [];\n    for (let i = 0; i <= _maxLen; i++) {\n        row[i] = 0;\n    }\n    for (let i = 0; i <= _maxLen; i++) {\n        table.push(row.slice(0));\n    }\n    return table;\n}\nfunction initArr(maxLen) {\n    const row = [];\n    for (let i = 0; i <= maxLen; i++) {\n        row[i] = 0;\n    }\n    return row;\n}\nconst _minWordMatchPos = initArr(2 * _maxLen); // min word position for a certain pattern position\nconst _maxWordMatchPos = initArr(2 * _maxLen); // max word position for a certain pattern position\nconst _diag = initTable(); // the length of a contiguous diagonal match\nconst _table = initTable();\nconst _arrows = initTable();\nconst _debug = false;\nfunction printTable(table, pattern, patternLen, word, wordLen) {\n    function pad(s, n, pad = ' ') {\n        while (s.length < n) {\n            s = pad + s;\n        }\n        return s;\n    }\n    let ret = ` |   |${word.split('').map(c => pad(c, 3)).join('|')}\\n`;\n    for (let i = 0; i <= patternLen; i++) {\n        if (i === 0) {\n            ret += ' |';\n        }\n        else {\n            ret += `${pattern[i - 1]}|`;\n        }\n        ret += table[i].slice(0, wordLen + 1).map(n => pad(n.toString(), 3)).join('|') + '\\n';\n    }\n    return ret;\n}\nfunction printTables(pattern, patternStart, word, wordStart) {\n    pattern = pattern.substr(patternStart);\n    word = word.substr(wordStart);\n    console.log(printTable(_table, pattern, pattern.length, word, word.length));\n    console.log(printTable(_arrows, pattern, pattern.length, word, word.length));\n    console.log(printTable(_diag, pattern, pattern.length, word, word.length));\n}\nfunction isSeparatorAtPos(value, index) {\n    if (index < 0 || index >= value.length) {\n        return false;\n    }\n    const code = value.codePointAt(index);\n    switch (code) {\n        case 95 /* CharCode.Underline */:\n        case 45 /* CharCode.Dash */:\n        case 46 /* CharCode.Period */:\n        case 32 /* CharCode.Space */:\n        case 47 /* CharCode.Slash */:\n        case 92 /* CharCode.Backslash */:\n        case 39 /* CharCode.SingleQuote */:\n        case 34 /* CharCode.DoubleQuote */:\n        case 58 /* CharCode.Colon */:\n        case 36 /* CharCode.DollarSign */:\n        case 60 /* CharCode.LessThan */:\n        case 62 /* CharCode.GreaterThan */:\n        case 40 /* CharCode.OpenParen */:\n        case 41 /* CharCode.CloseParen */:\n        case 91 /* CharCode.OpenSquareBracket */:\n        case 93 /* CharCode.CloseSquareBracket */:\n        case 123 /* CharCode.OpenCurlyBrace */:\n        case 125 /* CharCode.CloseCurlyBrace */:\n            return true;\n        case undefined:\n            return false;\n        default:\n            if (strings.isEmojiImprecise(code)) {\n                return true;\n            }\n            return false;\n    }\n}\nfunction isWhitespaceAtPos(value, index) {\n    if (index < 0 || index >= value.length) {\n        return false;\n    }\n    const code = value.charCodeAt(index);\n    switch (code) {\n        case 32 /* CharCode.Space */:\n        case 9 /* CharCode.Tab */:\n            return true;\n        default:\n            return false;\n    }\n}\nfunction isUpperCaseAtPos(pos, word, wordLow) {\n    return word[pos] !== wordLow[pos];\n}\nexport function isPatternInWord(patternLow, patternPos, patternLen, wordLow, wordPos, wordLen, fillMinWordPosArr = false) {\n    while (patternPos < patternLen && wordPos < wordLen) {\n        if (patternLow[patternPos] === wordLow[wordPos]) {\n            if (fillMinWordPosArr) {\n                // Remember the min word position for each pattern position\n                _minWordMatchPos[patternPos] = wordPos;\n            }\n            patternPos += 1;\n        }\n        wordPos += 1;\n    }\n    return patternPos === patternLen; // pattern must be exhausted\n}\nexport var FuzzyScore;\n(function (FuzzyScore) {\n    /**\n     * No matches and value `-100`\n     */\n    FuzzyScore.Default = ([-100, 0]);\n    function isDefault(score) {\n        return !score || (score.length === 2 && score[0] === -100 && score[1] === 0);\n    }\n    FuzzyScore.isDefault = isDefault;\n})(FuzzyScore || (FuzzyScore = {}));\nexport class FuzzyScoreOptions {\n    static { this.default = { boostFullMatch: true, firstMatchCanBeWeak: false }; }\n    constructor(firstMatchCanBeWeak, boostFullMatch) {\n        this.firstMatchCanBeWeak = firstMatchCanBeWeak;\n        this.boostFullMatch = boostFullMatch;\n    }\n}\nexport function fuzzyScore(pattern, patternLow, patternStart, word, wordLow, wordStart, options = FuzzyScoreOptions.default) {\n    const patternLen = pattern.length > _maxLen ? _maxLen : pattern.length;\n    const wordLen = word.length > _maxLen ? _maxLen : word.length;\n    if (patternStart >= patternLen || wordStart >= wordLen || (patternLen - patternStart) > (wordLen - wordStart)) {\n        return undefined;\n    }\n    // Run a simple check if the characters of pattern occur\n    // (in order) at all in word. If that isn't the case we\n    // stop because no match will be possible\n    if (!isPatternInWord(patternLow, patternStart, patternLen, wordLow, wordStart, wordLen, true)) {\n        return undefined;\n    }\n    // Find the max matching word position for each pattern position\n    // NOTE: the min matching word position was filled in above, in the `isPatternInWord` call\n    _fillInMaxWordMatchPos(patternLen, wordLen, patternStart, wordStart, patternLow, wordLow);\n    let row = 1;\n    let column = 1;\n    let patternPos = patternStart;\n    let wordPos = wordStart;\n    const hasStrongFirstMatch = [false];\n    // There will be a match, fill in tables\n    for (row = 1, patternPos = patternStart; patternPos < patternLen; row++, patternPos++) {\n        // Reduce search space to possible matching word positions and to possible access from next row\n        const minWordMatchPos = _minWordMatchPos[patternPos];\n        const maxWordMatchPos = _maxWordMatchPos[patternPos];\n        const nextMaxWordMatchPos = (patternPos + 1 < patternLen ? _maxWordMatchPos[patternPos + 1] : wordLen);\n        for (column = minWordMatchPos - wordStart + 1, wordPos = minWordMatchPos; wordPos < nextMaxWordMatchPos; column++, wordPos++) {\n            let score = Number.MIN_SAFE_INTEGER;\n            let canComeDiag = false;\n            if (wordPos <= maxWordMatchPos) {\n                score = _doScore(pattern, patternLow, patternPos, patternStart, word, wordLow, wordPos, wordLen, wordStart, _diag[row - 1][column - 1] === 0, hasStrongFirstMatch);\n            }\n            let diagScore = 0;\n            if (score !== Number.MAX_SAFE_INTEGER) {\n                canComeDiag = true;\n                diagScore = score + _table[row - 1][column - 1];\n            }\n            const canComeLeft = wordPos > minWordMatchPos;\n            const leftScore = canComeLeft ? _table[row][column - 1] + (_diag[row][column - 1] > 0 ? -5 : 0) : 0; // penalty for a gap start\n            const canComeLeftLeft = wordPos > minWordMatchPos + 1 && _diag[row][column - 1] > 0;\n            const leftLeftScore = canComeLeftLeft ? _table[row][column - 2] + (_diag[row][column - 2] > 0 ? -5 : 0) : 0; // penalty for a gap start\n            if (canComeLeftLeft && (!canComeLeft || leftLeftScore >= leftScore) && (!canComeDiag || leftLeftScore >= diagScore)) {\n                // always prefer choosing left left to jump over a diagonal because that means a match is earlier in the word\n                _table[row][column] = leftLeftScore;\n                _arrows[row][column] = 3 /* Arrow.LeftLeft */;\n                _diag[row][column] = 0;\n            }\n            else if (canComeLeft && (!canComeDiag || leftScore >= diagScore)) {\n                // always prefer choosing left since that means a match is earlier in the word\n                _table[row][column] = leftScore;\n                _arrows[row][column] = 2 /* Arrow.Left */;\n                _diag[row][column] = 0;\n            }\n            else if (canComeDiag) {\n                _table[row][column] = diagScore;\n                _arrows[row][column] = 1 /* Arrow.Diag */;\n                _diag[row][column] = _diag[row - 1][column - 1] + 1;\n            }\n            else {\n                throw new Error(`not possible`);\n            }\n        }\n    }\n    if (_debug) {\n        printTables(pattern, patternStart, word, wordStart);\n    }\n    if (!hasStrongFirstMatch[0] && !options.firstMatchCanBeWeak) {\n        return undefined;\n    }\n    row--;\n    column--;\n    const result = [_table[row][column], wordStart];\n    let backwardsDiagLength = 0;\n    let maxMatchColumn = 0;\n    while (row >= 1) {\n        // Find the column where we go diagonally up\n        let diagColumn = column;\n        do {\n            const arrow = _arrows[row][diagColumn];\n            if (arrow === 3 /* Arrow.LeftLeft */) {\n                diagColumn = diagColumn - 2;\n            }\n            else if (arrow === 2 /* Arrow.Left */) {\n                diagColumn = diagColumn - 1;\n            }\n            else {\n                // found the diagonal\n                break;\n            }\n        } while (diagColumn >= 1);\n        // Overturn the \"forwards\" decision if keeping the \"backwards\" diagonal would give a better match\n        if (backwardsDiagLength > 1 // only if we would have a contiguous match of 3 characters\n            && patternLow[patternStart + row - 1] === wordLow[wordStart + column - 1] // only if we can do a contiguous match diagonally\n            && !isUpperCaseAtPos(diagColumn + wordStart - 1, word, wordLow) // only if the forwards chose diagonal is not an uppercase\n            && backwardsDiagLength + 1 > _diag[row][diagColumn] // only if our contiguous match would be longer than the \"forwards\" contiguous match\n        ) {\n            diagColumn = column;\n        }\n        if (diagColumn === column) {\n            // this is a contiguous match\n            backwardsDiagLength++;\n        }\n        else {\n            backwardsDiagLength = 1;\n        }\n        if (!maxMatchColumn) {\n            // remember the last matched column\n            maxMatchColumn = diagColumn;\n        }\n        row--;\n        column = diagColumn - 1;\n        result.push(column);\n    }\n    if (wordLen - wordStart === patternLen && options.boostFullMatch) {\n        // the word matches the pattern with all characters!\n        // giving the score a total match boost (to come up ahead other words)\n        result[0] += 2;\n    }\n    // Add 1 penalty for each skipped character in the word\n    const skippedCharsCount = maxMatchColumn - patternLen;\n    result[0] -= skippedCharsCount;\n    return result;\n}\nfunction _fillInMaxWordMatchPos(patternLen, wordLen, patternStart, wordStart, patternLow, wordLow) {\n    let patternPos = patternLen - 1;\n    let wordPos = wordLen - 1;\n    while (patternPos >= patternStart && wordPos >= wordStart) {\n        if (patternLow[patternPos] === wordLow[wordPos]) {\n            _maxWordMatchPos[patternPos] = wordPos;\n            patternPos--;\n        }\n        wordPos--;\n    }\n}\nfunction _doScore(pattern, patternLow, patternPos, patternStart, word, wordLow, wordPos, wordLen, wordStart, newMatchStart, outFirstMatchStrong) {\n    if (patternLow[patternPos] !== wordLow[wordPos]) {\n        return Number.MIN_SAFE_INTEGER;\n    }\n    let score = 1;\n    let isGapLocation = false;\n    if (wordPos === (patternPos - patternStart)) {\n        // common prefix: `foobar <-> foobaz`\n        //                            ^^^^^\n        score = pattern[patternPos] === word[wordPos] ? 7 : 5;\n    }\n    else if (isUpperCaseAtPos(wordPos, word, wordLow) && (wordPos === 0 || !isUpperCaseAtPos(wordPos - 1, word, wordLow))) {\n        // hitting upper-case: `foo <-> forOthers`\n        //                              ^^ ^\n        score = pattern[patternPos] === word[wordPos] ? 7 : 5;\n        isGapLocation = true;\n    }\n    else if (isSeparatorAtPos(wordLow, wordPos) && (wordPos === 0 || !isSeparatorAtPos(wordLow, wordPos - 1))) {\n        // hitting a separator: `. <-> foo.bar`\n        //                                ^\n        score = 5;\n    }\n    else if (isSeparatorAtPos(wordLow, wordPos - 1) || isWhitespaceAtPos(wordLow, wordPos - 1)) {\n        // post separator: `foo <-> bar_foo`\n        //                              ^^^\n        score = 5;\n        isGapLocation = true;\n    }\n    if (score > 1 && patternPos === patternStart) {\n        outFirstMatchStrong[0] = true;\n    }\n    if (!isGapLocation) {\n        isGapLocation = isUpperCaseAtPos(wordPos, word, wordLow) || isSeparatorAtPos(wordLow, wordPos - 1) || isWhitespaceAtPos(wordLow, wordPos - 1);\n    }\n    //\n    if (patternPos === patternStart) { // first character in pattern\n        if (wordPos > wordStart) {\n            // the first pattern character would match a word character that is not at the word start\n            // so introduce a penalty to account for the gap preceding this match\n            score -= isGapLocation ? 3 : 5;\n        }\n    }\n    else {\n        if (newMatchStart) {\n            // this would be the beginning of a new match (i.e. there would be a gap before this location)\n            score += isGapLocation ? 2 : 0;\n        }\n        else {\n            // this is part of a contiguous match, so give it a slight bonus, but do so only if it would not be a preferred gap location\n            score += isGapLocation ? 0 : 1;\n        }\n    }\n    if (wordPos + 1 === wordLen) {\n        // we always penalize gaps, but this gives unfair advantages to a match that would match the last character in the word\n        // so pretend there is a gap after the last character in the word to normalize things\n        score -= isGapLocation ? 3 : 5;\n    }\n    return score;\n}\n//#endregion\n//#region --- graceful ---\nexport function fuzzyScoreGracefulAggressive(pattern, lowPattern, patternPos, word, lowWord, wordPos, options) {\n    return fuzzyScoreWithPermutations(pattern, lowPattern, patternPos, word, lowWord, wordPos, true, options);\n}\nfunction fuzzyScoreWithPermutations(pattern, lowPattern, patternPos, word, lowWord, wordPos, aggressive, options) {\n    let top = fuzzyScore(pattern, lowPattern, patternPos, word, lowWord, wordPos, options);\n    if (top && !aggressive) {\n        // when using the original pattern yield a result we`\n        // return it unless we are aggressive and try to find\n        // a better alignment, e.g. `cno` -> `^co^ns^ole` or `^c^o^nsole`.\n        return top;\n    }\n    if (pattern.length >= 3) {\n        // When the pattern is long enough then try a few (max 7)\n        // permutations of the pattern to find a better match. The\n        // permutations only swap neighbouring characters, e.g\n        // `cnoso` becomes `conso`, `cnsoo`, `cnoos`.\n        const tries = Math.min(7, pattern.length - 1);\n        for (let movingPatternPos = patternPos + 1; movingPatternPos < tries; movingPatternPos++) {\n            const newPattern = nextTypoPermutation(pattern, movingPatternPos);\n            if (newPattern) {\n                const candidate = fuzzyScore(newPattern, newPattern.toLowerCase(), patternPos, word, lowWord, wordPos, options);\n                if (candidate) {\n                    candidate[0] -= 3; // permutation penalty\n                    if (!top || candidate[0] > top[0]) {\n                        top = candidate;\n                    }\n                }\n            }\n        }\n    }\n    return top;\n}\nfunction nextTypoPermutation(pattern, patternPos) {\n    if (patternPos + 1 >= pattern.length) {\n        return undefined;\n    }\n    const swap1 = pattern[patternPos];\n    const swap2 = pattern[patternPos + 1];\n    if (swap1 === swap2) {\n        return undefined;\n    }\n    return pattern.slice(0, patternPos)\n        + swap2\n        + swap1\n        + pattern.slice(patternPos + 2);\n}\n//#endregion\n"],"names":["strings.startsWithIgnoreCase","strings.convertSimple2RegExpPattern","strings.isEmojiImprecise","FuzzyScore"],"mappings":";;AAcO,SAAS,MAAM,QAAQ;AAC1B,SAAO,SAAU,MAAM,oBAAoB;AACvC,aAAS,IAAI,GAAG,MAAM,OAAO,QAAQ,IAAI,KAAK,KAAK;AAC/C,YAAM,QAAQ,OAAO,CAAC,EAAE,MAAM,kBAAkB;AAChD,UAAI,OAAO;AACP,eAAO;AAAA,MACvB;AAAA,IACA;AACQ,WAAO;AAAA,EACV;AACL;AAEmC,eAAe,KAAK,QAAW,KAAK;AAC3D,MAAC,gBAAgB,eAAe,KAAK,QAAW,IAAI;AAChE,SAAS,eAAe,YAAY,MAAM,oBAAoB;AAC1D,MAAI,CAAC,sBAAsB,mBAAmB,SAAS,KAAK,QAAQ;AAChE,WAAO;AAAA,EACf;AACI,MAAI;AACJ,MAAI,YAAY;AACZ,cAAUA,qBAA6B,oBAAoB,IAAI;AAAA,EACvE,OACS;AACD,cAAU,mBAAmB,QAAQ,IAAI,MAAM;AAAA,EACvD;AACI,MAAI,CAAC,SAAS;AACV,WAAO;AAAA,EACf;AACI,SAAO,KAAK,SAAS,IAAI,CAAC,EAAE,OAAO,GAAG,KAAK,KAAK,OAAM,CAAE,IAAI,CAAE;AAClE;AAEO,SAAS,2BAA2B,MAAM,oBAAoB;AACjE,QAAM,QAAQ,mBAAmB,YAAW,EAAG,QAAQ,KAAK,aAAa;AACzE,MAAI,UAAU,IAAI;AACd,WAAO;AAAA,EACf;AACI,SAAO,CAAC,EAAE,OAAO,OAAO,KAAK,QAAQ,KAAK,QAAQ;AACtD;AAEO,SAAS,iBAAiB,MAAM,oBAAoB;AACvD,SAAO,kBAAkB,KAAK,YAAa,GAAE,mBAAmB,YAAa,GAAE,GAAG,CAAC;AACvF;AACA,SAAS,kBAAkB,MAAM,oBAAoB,GAAG,GAAG;AACvD,MAAI,MAAM,KAAK,QAAQ;AACnB,WAAO,CAAE;AAAA,EACjB,WACa,MAAM,mBAAmB,QAAQ;AACtC,WAAO;AAAA,EACf,OACS;AACD,QAAI,KAAK,CAAC,MAAM,mBAAmB,CAAC,GAAG;AACnC,UAAI,SAAS;AACb,UAAI,SAAS,kBAAkB,MAAM,oBAAoB,IAAI,GAAG,IAAI,CAAC,GAAG;AACpE,eAAO,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,EAAG,GAAE,MAAM;AAAA,MAC5D;AACY,aAAO;AAAA,IACnB;AACQ,WAAO,kBAAkB,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAAA,EACnE;AACA;AAEA,SAAS,QAAQ,MAAM;AACnB,SAAO,MAAuB,QAAQ,QAAQ;AAClD;AACO,SAAS,QAAQ,MAAM;AAC1B,SAAO,MAAuB,QAAQ,QAAQ;AAClD;AACA,SAAS,SAAS,MAAM;AACpB,SAAO,MAA4B,QAAQ,QAAQ;AACvD;AACA,SAAS,aAAa,MAAM;AACxB,SAAQ,SAAS,MACV,SAAS,KACT,SAAS,MACT,SAAS;AACpB;AACA,MAAM,iBAAiB,oBAAI,IAAK;AAGhC,uBACK,MAAM,EAAE,EACR,QAAQ,OAAK,eAAe,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;AA+BrD,SAAS,eAAe,MAAM;AAC1B,SAAO,QAAQ,IAAI,KAAK,QAAQ,IAAI,KAAK,SAAS,IAAI;AAC1D;AACA,SAAS,KAAK,MAAM,MAAM;AACtB,MAAI,KAAK,WAAW,GAAG;AACnB,WAAO,CAAC,IAAI;AAAA,EACpB,WACa,KAAK,QAAQ,KAAK,CAAC,EAAE,OAAO;AACjC,SAAK,CAAC,EAAE,QAAQ,KAAK;AAAA,EAC7B,OACS;AACD,SAAK,QAAQ,IAAI;AAAA,EACzB;AACI,SAAO;AACX;AACA,SAAS,WAAW,eAAe,OAAO;AACtC,WAAS,IAAI,OAAO,IAAI,cAAc,QAAQ,KAAK;AAC/C,UAAM,IAAI,cAAc,WAAW,CAAC;AACpC,QAAI,QAAQ,CAAC,KAAK,SAAS,CAAC,KAAM,IAAI,KAAK,CAAC,eAAe,cAAc,WAAW,IAAI,CAAC,CAAC,GAAI;AAC1F,aAAO;AAAA,IACnB;AAAA,EACA;AACI,SAAO,cAAc;AACzB;AACA,SAAS,kBAAkB,MAAM,eAAe,GAAG,GAAG;AAClD,MAAI,MAAM,KAAK,QAAQ;AACnB,WAAO,CAAE;AAAA,EACjB,WACa,MAAM,cAAc,QAAQ;AACjC,WAAO;AAAA,EACf,WACa,KAAK,CAAC,MAAM,cAAc,CAAC,EAAE,eAAe;AACjD,WAAO;AAAA,EACf,OACS;AACD,QAAI,SAAS;AACb,QAAI,iBAAiB,IAAI;AACzB,aAAS,kBAAkB,MAAM,eAAe,IAAI,GAAG,IAAI,CAAC;AAC5D,WAAO,CAAC,WAAW,iBAAiB,WAAW,eAAe,cAAc,KAAK,cAAc,QAAQ;AACnG,eAAS,kBAAkB,MAAM,eAAe,IAAI,GAAG,cAAc;AACrE;AAAA,IACZ;AACQ,WAAO,WAAW,OAAO,OAAO,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,EAAC,GAAI,MAAM;AAAA,EAC7E;AACA;AAGA,SAAS,qBAAqB,MAAM;AAChC,MAAI,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,UAAU,GAAG,OAAO;AACzD,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,WAAO,KAAK,WAAW,CAAC;AACxB,QAAI,QAAQ,IAAI,GAAG;AACf;AAAA,IACZ;AACQ,QAAI,QAAQ,IAAI,GAAG;AACf;AAAA,IACZ;AACQ,QAAI,eAAe,IAAI,GAAG;AACtB;AAAA,IACZ;AACQ,QAAI,SAAS,IAAI,GAAG;AAChB;AAAA,IACZ;AAAA,EACA;AACI,QAAM,eAAe,QAAQ,KAAK;AAClC,QAAM,eAAe,QAAQ,KAAK;AAClC,QAAM,eAAe,QAAQ,KAAK;AAClC,QAAM,iBAAiB,UAAU,KAAK;AACtC,SAAO,EAAE,cAAc,cAAc,cAAc,eAAgB;AACvE;AACA,SAAS,gBAAgB,UAAU;AAC/B,QAAM,EAAE,cAAc,aAAY,IAAK;AACvC,SAAO,iBAAiB,KAAK,eAAe;AAChD;AACA,SAAS,gBAAgB,UAAU;AAC/B,QAAM,EAAE,cAAc,cAAc,cAAc,eAAgB,IAAG;AACrE,SAAO,eAAe,OAAO,eAAe,OAAO,eAAe,OAAO,iBAAiB;AAC9F;AAGA,SAAS,mBAAmB,MAAM;AAC9B,MAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,aAAa;AACjD,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,WAAO,KAAK,WAAW,CAAC;AACxB,QAAI,QAAQ,IAAI,GAAG;AACf;AAAA,IACZ;AACQ,QAAI,QAAQ,IAAI,GAAG;AACf;AAAA,IACZ;AACQ,QAAI,aAAa,IAAI,GAAG;AACpB;AAAA,IACZ;AAAA,EACA;AACI,OAAK,UAAU,KAAK,UAAU,MAAM,eAAe,GAAG;AAClD,WAAO,KAAK,UAAU;AAAA,EAC9B,OACS;AACD,WAAO,SAAS;AAAA,EACxB;AACA;AACO,SAAS,iBAAiB,MAAM,eAAe;AAClD,MAAI,CAAC,eAAe;AAChB,WAAO;AAAA,EACf;AACI,kBAAgB,cAAc,KAAM;AACpC,MAAI,cAAc,WAAW,GAAG;AAC5B,WAAO;AAAA,EACf;AACI,MAAI,CAAC,mBAAmB,IAAI,GAAG;AAC3B,WAAO;AAAA,EACf;AAEI,MAAI,cAAc,SAAS,IAAI;AAC3B,oBAAgB,cAAc,UAAU,GAAG,EAAE;AAAA,EACrD;AACI,QAAM,WAAW,qBAAqB,aAAa;AACnD,MAAI,CAAC,gBAAgB,QAAQ,GAAG;AAC5B,QAAI,CAAC,gBAAgB,QAAQ,GAAG;AAC5B,aAAO;AAAA,IACnB;AACQ,oBAAgB,cAAc,YAAa;AAAA,EACnD;AACI,MAAI,SAAS;AACb,MAAI,IAAI;AACR,SAAO,KAAK,YAAa;AACzB,SAAO,IAAI,cAAc,WAAW,SAAS,kBAAkB,MAAM,eAAe,GAAG,CAAC,OAAO,MAAM;AACjG,QAAI,WAAW,eAAe,IAAI,CAAC;AAAA,EAC3C;AACI,SAAO;AACX;AAiFA,MAAM,wBAAwB,GAAG,eAAe,kBAAkB,0BAA0B;AAC5F,MAAM,sBAAsB,GAAG,eAAe,kBAAkB,gBAAgB;AAChF,MAAM,mBAAmB,IAAI,SAAS,GAAK;AACpC,SAAS,aAAa,MAAM,oBAAoB,kCAAkC,OAAO;AAC5F,MAAI,OAAO,SAAS,YAAY,OAAO,uBAAuB,UAAU;AACpE,WAAO;AAAA,EACf;AAEI,MAAI,SAAS,iBAAiB,IAAI,IAAI;AACtC,MAAI,CAAC,QAAQ;AACT,aAAS,IAAI,OAAOC,4BAAoC,IAAI,GAAG,GAAG;AAClE,qBAAiB,IAAI,MAAM,MAAM;AAAA,EACzC;AAEI,QAAM,QAAQ,OAAO,KAAK,kBAAkB;AAC5C,MAAI,OAAO;AACP,WAAO,CAAC,EAAE,OAAO,MAAM,OAAO,KAAK,MAAM,QAAQ,MAAM,CAAC,EAAE,OAAM,CAAE;AAAA,EAC1E;AAEI,SAAO,kCAAkC,oBAAoB,MAAM,kBAAkB,IAAI,sBAAsB,MAAM,kBAAkB;AAC3I;AAKO,SAAS,cAAc,SAAS,MAAM;AACzC,QAAM,QAAQ,WAAW,SAAS,QAAQ,YAAW,GAAI,GAAG,MAAM,KAAK,YAAW,GAAI,GAAG,EAAE,qBAAqB,MAAM,gBAAgB,MAAM;AAC5I,SAAO,QAAQ,cAAc,KAAK,IAAI;AAC1C;AAYO,SAAS,cAAc,OAAO;AACjC,MAAI,OAAO,UAAU,aAAa;AAC9B,WAAO,CAAE;AAAA,EACjB;AACI,QAAM,MAAM,CAAE;AACd,QAAM,UAAU,MAAM,CAAC;AACvB,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACvC,UAAM,MAAM,MAAM,CAAC,IAAI;AACvB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAI,QAAQ,KAAK,QAAQ,KAAK;AAC1B,WAAK,MAAM,MAAM;AAAA,IAC7B,OACa;AACD,UAAI,KAAK,EAAE,OAAO,KAAK,KAAK,MAAM,GAAG;AAAA,IACjD;AAAA,EACA;AACI,SAAO;AACX;AACA,MAAM,UAAU;AAChB,SAAS,YAAY;AACjB,QAAM,QAAQ,CAAE;AAChB,QAAM,MAAM,CAAE;AACd,WAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AAC/B,QAAI,CAAC,IAAI;AAAA,EACjB;AACI,WAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AAC/B,UAAM,KAAK,IAAI,MAAM,CAAC,CAAC;AAAA,EAC/B;AACI,SAAO;AACX;AACA,SAAS,QAAQ,QAAQ;AACrB,QAAM,MAAM,CAAE;AACd,WAAS,IAAI,GAAG,KAAK,QAAQ,KAAK;AAC9B,QAAI,CAAC,IAAI;AAAA,EACjB;AACI,SAAO;AACX;AACA,MAAM,mBAAmB,QAAQ,IAAI,OAAO;AAC5C,MAAM,mBAAmB,QAAQ,IAAI,OAAO;AAC5C,MAAM,QAAQ,UAAS;AACvB,MAAM,SAAS,UAAW;AAC1B,MAAM,UAAU,UAAW;AA4B3B,SAAS,iBAAiB,OAAO,OAAO;AACpC,MAAI,QAAQ,KAAK,SAAS,MAAM,QAAQ;AACpC,WAAO;AAAA,EACf;AACI,QAAM,OAAO,MAAM,YAAY,KAAK;AACpC,UAAQ,MAAI;AAAA,IACR,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX;AACI,UAAIC,iBAAyB,IAAI,GAAG;AAChC,eAAO;AAAA,MACvB;AACY,aAAO;AAAA,EACnB;AACA;AACA,SAAS,kBAAkB,OAAO,OAAO;AACrC,MAAI,QAAQ,KAAK,SAAS,MAAM,QAAQ;AACpC,WAAO;AAAA,EACf;AACI,QAAM,OAAO,MAAM,WAAW,KAAK;AACnC,UAAQ,MAAI;AAAA,IACR,KAAK;AAAA,IACL,KAAK;AACD,aAAO;AAAA,IACX;AACI,aAAO;AAAA,EACnB;AACA;AACA,SAAS,iBAAiB,KAAK,MAAM,SAAS;AAC1C,SAAO,KAAK,GAAG,MAAM,QAAQ,GAAG;AACpC;AACO,SAAS,gBAAgB,YAAY,YAAY,YAAY,SAAS,SAAS,SAAS,oBAAoB,OAAO;AACtH,SAAO,aAAa,cAAc,UAAU,SAAS;AACjD,QAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,GAAG;AAC7C,UAAI,mBAAmB;AAEnB,yBAAiB,UAAU,IAAI;AAAA,MAC/C;AACY,oBAAc;AAAA,IAC1B;AACQ,eAAW;AAAA,EACnB;AACI,SAAO,eAAe;AAC1B;AACU,IAAC;AAAA,CACV,SAAUC,aAAY;AAInB,EAAAA,YAAW,UAAW,CAAC,MAAM,CAAC;AAC9B,WAAS,UAAU,OAAO;AACtB,WAAO,CAAC,SAAU,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,QAAQ,MAAM,CAAC,MAAM;AAAA,EAClF;AACI,EAAAA,YAAW,YAAY;AAC3B,GAAG,eAAe,aAAa,CAAA,EAAG;AAC3B,MAAM,qBAAN,MAAM,mBAAkB;AAAA,EAE3B,YAAY,qBAAqB,gBAAgB;AAC7C,SAAK,sBAAsB;AAC3B,SAAK,iBAAiB;AAAA,EAC9B;AACA;AALa,mBAAK,UAAU,EAAE,gBAAgB,MAAM,qBAAqB;AADlE,IAAM,oBAAN;AAOA,SAAS,WAAW,SAAS,YAAY,cAAc,MAAM,SAAS,WAAW,UAAU,kBAAkB,SAAS;AACzH,QAAM,aAAa,QAAQ,SAAS,UAAU,UAAU,QAAQ;AAChE,QAAM,UAAU,KAAK,SAAS,UAAU,UAAU,KAAK;AACvD,MAAI,gBAAgB,cAAc,aAAa,WAAY,aAAa,eAAiB,UAAU,WAAY;AAC3G,WAAO;AAAA,EACf;AAII,MAAI,CAAC,gBAAgB,YAAY,cAAc,YAAY,SAAS,WAAW,SAAS,IAAI,GAAG;AAC3F,WAAO;AAAA,EACf;AAGI,yBAAuB,YAAY,SAAS,cAAc,WAAW,YAAY,OAAO;AACxF,MAAI,MAAM;AACV,MAAI,SAAS;AACb,MAAI,aAAa;AACjB,MAAI,UAAU;AACd,QAAM,sBAAsB,CAAC,KAAK;AAElC,OAAK,MAAM,GAAG,aAAa,cAAc,aAAa,YAAY,OAAO,cAAc;AAEnF,UAAM,kBAAkB,iBAAiB,UAAU;AACnD,UAAM,kBAAkB,iBAAiB,UAAU;AACnD,UAAM,sBAAuB,aAAa,IAAI,aAAa,iBAAiB,aAAa,CAAC,IAAI;AAC9F,SAAK,SAAS,kBAAkB,YAAY,GAAG,UAAU,iBAAiB,UAAU,qBAAqB,UAAU,WAAW;AAC1H,UAAI,QAAQ,OAAO;AACnB,UAAI,cAAc;AAClB,UAAI,WAAW,iBAAiB;AAC5B,gBAAQ,SAAS,SAAS,YAAY,YAAY,cAAc,MAAM,SAAS,SAAS,SAAS,WAAW,MAAM,MAAM,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,mBAAmB;AAAA,MACjL;AACY,UAAI,YAAY;AAChB,UAAI,UAAU,OAAO,kBAAkB;AACnC,sBAAc;AACd,oBAAY,QAAQ,OAAO,MAAM,CAAC,EAAE,SAAS,CAAC;AAAA,MAC9D;AACY,YAAM,cAAc,UAAU;AAC9B,YAAM,YAAY,cAAc,OAAO,GAAG,EAAE,SAAS,CAAC,KAAK,MAAM,GAAG,EAAE,SAAS,CAAC,IAAI,IAAI,KAAK,KAAK;AAClG,YAAM,kBAAkB,UAAU,kBAAkB,KAAK,MAAM,GAAG,EAAE,SAAS,CAAC,IAAI;AAClF,YAAM,gBAAgB,kBAAkB,OAAO,GAAG,EAAE,SAAS,CAAC,KAAK,MAAM,GAAG,EAAE,SAAS,CAAC,IAAI,IAAI,KAAK,KAAK;AAC1G,UAAI,oBAAoB,CAAC,eAAe,iBAAiB,eAAe,CAAC,eAAe,iBAAiB,YAAY;AAEjH,eAAO,GAAG,EAAE,MAAM,IAAI;AACtB,gBAAQ,GAAG,EAAE,MAAM,IAAI;AACvB,cAAM,GAAG,EAAE,MAAM,IAAI;AAAA,MACrC,WACqB,gBAAgB,CAAC,eAAe,aAAa,YAAY;AAE9D,eAAO,GAAG,EAAE,MAAM,IAAI;AACtB,gBAAQ,GAAG,EAAE,MAAM,IAAI;AACvB,cAAM,GAAG,EAAE,MAAM,IAAI;AAAA,MACrC,WACqB,aAAa;AAClB,eAAO,GAAG,EAAE,MAAM,IAAI;AACtB,gBAAQ,GAAG,EAAE,MAAM,IAAI;AACvB,cAAM,GAAG,EAAE,MAAM,IAAI,MAAM,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI;AAAA,MAClE,OACiB;AACD,cAAM,IAAI,MAAM,cAAc;AAAA,MAC9C;AAAA,IACA;AAAA,EACA;AAII,MAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,QAAQ,qBAAqB;AACzD,WAAO;AAAA,EACf;AACI;AACA;AACA,QAAM,SAAS,CAAC,OAAO,GAAG,EAAE,MAAM,GAAG,SAAS;AAC9C,MAAI,sBAAsB;AAC1B,MAAI,iBAAiB;AACrB,SAAO,OAAO,GAAG;AAEb,QAAI,aAAa;AACjB,OAAG;AACC,YAAM,QAAQ,QAAQ,GAAG,EAAE,UAAU;AACrC,UAAI,UAAU,GAAwB;AAClC,qBAAa,aAAa;AAAA,MAC1C,WACqB,UAAU,GAAoB;AACnC,qBAAa,aAAa;AAAA,MAC1C,OACiB;AAED;AAAA,MAChB;AAAA,IACS,SAAQ,cAAc;AAEvB,QAAI,sBAAsB,KACnB,WAAW,eAAe,MAAM,CAAC,MAAM,QAAQ,YAAY,SAAS,CAAC,KACrE,CAAC,iBAAiB,aAAa,YAAY,GAAG,MAAM,OAAO,KAC3D,sBAAsB,IAAI,MAAM,GAAG,EAAE,UAAU,GACpD;AACE,mBAAa;AAAA,IACzB;AACQ,QAAI,eAAe,QAAQ;AAEvB;AAAA,IACZ,OACa;AACD,4BAAsB;AAAA,IAClC;AACQ,QAAI,CAAC,gBAAgB;AAEjB,uBAAiB;AAAA,IAC7B;AACQ;AACA,aAAS,aAAa;AACtB,WAAO,KAAK,MAAM;AAAA,EAC1B;AACI,MAAI,UAAU,cAAc,cAAc,QAAQ,gBAAgB;AAG9D,WAAO,CAAC,KAAK;AAAA,EACrB;AAEI,QAAM,oBAAoB,iBAAiB;AAC3C,SAAO,CAAC,KAAK;AACb,SAAO;AACX;AACA,SAAS,uBAAuB,YAAY,SAAS,cAAc,WAAW,YAAY,SAAS;AAC/F,MAAI,aAAa,aAAa;AAC9B,MAAI,UAAU,UAAU;AACxB,SAAO,cAAc,gBAAgB,WAAW,WAAW;AACvD,QAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,GAAG;AAC7C,uBAAiB,UAAU,IAAI;AAC/B;AAAA,IACZ;AACQ;AAAA,EACR;AACA;AACA,SAAS,SAAS,SAAS,YAAY,YAAY,cAAc,MAAM,SAAS,SAAS,SAAS,WAAW,eAAe,qBAAqB;AAC7I,MAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,GAAG;AAC7C,WAAO,OAAO;AAAA,EACtB;AACI,MAAI,QAAQ;AACZ,MAAI,gBAAgB;AACpB,MAAI,YAAa,aAAa,cAAe;AAGzC,YAAQ,QAAQ,UAAU,MAAM,KAAK,OAAO,IAAI,IAAI;AAAA,EAC5D,WACa,iBAAiB,SAAS,MAAM,OAAO,MAAM,YAAY,KAAK,CAAC,iBAAiB,UAAU,GAAG,MAAM,OAAO,IAAI;AAGnH,YAAQ,QAAQ,UAAU,MAAM,KAAK,OAAO,IAAI,IAAI;AACpD,oBAAgB;AAAA,EACxB,WACa,iBAAiB,SAAS,OAAO,MAAM,YAAY,KAAK,CAAC,iBAAiB,SAAS,UAAU,CAAC,IAAI;AAGvG,YAAQ;AAAA,EAChB,WACa,iBAAiB,SAAS,UAAU,CAAC,KAAK,kBAAkB,SAAS,UAAU,CAAC,GAAG;AAGxF,YAAQ;AACR,oBAAgB;AAAA,EACxB;AACI,MAAI,QAAQ,KAAK,eAAe,cAAc;AAC1C,wBAAoB,CAAC,IAAI;AAAA,EACjC;AACI,MAAI,CAAC,eAAe;AAChB,oBAAgB,iBAAiB,SAAS,MAAM,OAAO,KAAK,iBAAiB,SAAS,UAAU,CAAC,KAAK,kBAAkB,SAAS,UAAU,CAAC;AAAA,EACpJ;AAEI,MAAI,eAAe,cAAc;AAC7B,QAAI,UAAU,WAAW;AAGrB,eAAS,gBAAgB,IAAI;AAAA,IACzC;AAAA,EACA,OACS;AACD,QAAI,eAAe;AAEf,eAAS,gBAAgB,IAAI;AAAA,IACzC,OACa;AAED,eAAS,gBAAgB,IAAI;AAAA,IACzC;AAAA,EACA;AACI,MAAI,UAAU,MAAM,SAAS;AAGzB,aAAS,gBAAgB,IAAI;AAAA,EACrC;AACI,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/htmlContent.es.js

@@ -55,15 +55,6 @@ ${appendEscapedMarkdownCodeBlockFence(code, langId)}
     });
   }
 }
-function isEmptyMarkdownString(oneOrMany) {
-  if (isMarkdownString(oneOrMany)) {
-    return !oneOrMany.value;
-  } else if (Array.isArray(oneOrMany)) {
-    return oneOrMany.every(isEmptyMarkdownString);
-  } else {
-    return true;
-  }
-}
 function isMarkdownString(thing) {
   if (thing instanceof MarkdownString) {
     return true;
@@ -129,7 +120,6 @@ export {
   appendEscapedMarkdownCodeBlockFence,
   escapeDoubleQuotes,
   escapeMarkdownSyntaxTokens,
-  isEmptyMarkdownString,
   isMarkdownString,
   markdownStringEqual,
   parseHrefAndDimensions,

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/htmlContent.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"htmlContent.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/htmlContent.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { illegalArgument } from './errors.js';\nimport { escapeIcons } from './iconLabels.js';\nimport { isEqual } from './resources.js';\nimport { escapeRegExpCharacters } from './strings.js';\nimport { URI } from './uri.js';\nexport class MarkdownString {\n    constructor(value = '', isTrustedOrOptions = false) {\n        this.value = value;\n        if (typeof this.value !== 'string') {\n            throw illegalArgument('value');\n        }\n        if (typeof isTrustedOrOptions === 'boolean') {\n            this.isTrusted = isTrustedOrOptions;\n            this.supportThemeIcons = false;\n            this.supportHtml = false;\n        }\n        else {\n            this.isTrusted = isTrustedOrOptions.isTrusted ?? undefined;\n            this.supportThemeIcons = isTrustedOrOptions.supportThemeIcons ?? false;\n            this.supportHtml = isTrustedOrOptions.supportHtml ?? false;\n        }\n    }\n    appendText(value, newlineStyle = 0 /* MarkdownStringTextNewlineStyle.Paragraph */) {\n        this.value += escapeMarkdownSyntaxTokens(this.supportThemeIcons ? escapeIcons(value) : value) // CodeQL [SM02383] The Markdown is fully sanitized after being rendered.\n            .replace(/([ \\t]+)/g, (_match, g1) => ' '.repeat(g1.length)) // CodeQL [SM02383] The Markdown is fully sanitized after being rendered.\n            .replace(/\\>/gm, '\\\\>') // CodeQL [SM02383] The Markdown is fully sanitized after being rendered.\n            .replace(/\\n/g, newlineStyle === 1 /* MarkdownStringTextNewlineStyle.Break */ ? '\\\\\\n' : '\\n\\n'); // CodeQL [SM02383] The Markdown is fully sanitized after being rendered.\n        return this;\n    }\n    appendMarkdown(value) {\n        this.value += value;\n        return this;\n    }\n    appendCodeblock(langId, code) {\n        this.value += `\\n${appendEscapedMarkdownCodeBlockFence(code, langId)}\\n`;\n        return this;\n    }\n    appendLink(target, label, title) {\n        this.value += '[';\n        this.value += this._escape(label, ']');\n        this.value += '](';\n        this.value += this._escape(String(target), ')');\n        if (title) {\n            this.value += ` \"${this._escape(this._escape(title, '\"'), ')')}\"`;\n        }\n        this.value += ')';\n        return this;\n    }\n    _escape(value, ch) {\n        const r = new RegExp(escapeRegExpCharacters(ch), 'g');\n        return value.replace(r, (match, offset) => {\n            if (value.charAt(offset - 1) !== '\\\\') {\n                return `\\\\${match}`;\n            }\n            else {\n                return match;\n            }\n        });\n    }\n}\nexport function isEmptyMarkdownString(oneOrMany) {\n    if (isMarkdownString(oneOrMany)) {\n        return !oneOrMany.value;\n    }\n    else if (Array.isArray(oneOrMany)) {\n        return oneOrMany.every(isEmptyMarkdownString);\n    }\n    else {\n        return true;\n    }\n}\nexport function isMarkdownString(thing) {\n    if (thing instanceof MarkdownString) {\n        return true;\n    }\n    else if (thing && typeof thing === 'object') {\n        return typeof thing.value === 'string'\n            && (typeof thing.isTrusted === 'boolean' || typeof thing.isTrusted === 'object' || thing.isTrusted === undefined)\n            && (typeof thing.supportThemeIcons === 'boolean' || thing.supportThemeIcons === undefined);\n    }\n    return false;\n}\nexport function markdownStringEqual(a, b) {\n    if (a === b) {\n        return true;\n    }\n    else if (!a || !b) {\n        return false;\n    }\n    else {\n        return a.value === b.value\n            && a.isTrusted === b.isTrusted\n            && a.supportThemeIcons === b.supportThemeIcons\n            && a.supportHtml === b.supportHtml\n            && (a.baseUri === b.baseUri || !!a.baseUri && !!b.baseUri && isEqual(URI.from(a.baseUri), URI.from(b.baseUri)));\n    }\n}\nexport function escapeMarkdownSyntaxTokens(text) {\n    // escape markdown syntax tokens: http://daringfireball.net/projects/markdown/syntax#backslash\n    return text.replace(/[\\\\`*_{}[\\]()#+\\-!~]/g, '\\\\$&'); // CodeQL [SM02383] Backslash is escaped in the character class\n}\n/**\n * @see https://github.com/microsoft/vscode/issues/193746\n */\nexport function appendEscapedMarkdownCodeBlockFence(code, langId) {\n    const longestFenceLength = code.match(/^`+/gm)?.reduce((a, b) => (a.length > b.length ? a : b)).length ??\n        0;\n    const desiredFenceLength = longestFenceLength >= 3 ? longestFenceLength + 1 : 3;\n    // the markdown result\n    return [\n        `${'`'.repeat(desiredFenceLength)}${langId}`,\n        code,\n        `${'`'.repeat(desiredFenceLength)}`,\n    ].join('\\n');\n}\nexport function escapeDoubleQuotes(input) {\n    return input.replace(/\"/g, '"');\n}\nexport function removeMarkdownEscapes(text) {\n    if (!text) {\n        return text;\n    }\n    return text.replace(/\\\\([\\\\`*_{}[\\]()#+\\-.!~])/g, '$1');\n}\nexport function parseHrefAndDimensions(href) {\n    const dimensions = [];\n    const splitted = href.split('|').map(s => s.trim());\n    href = splitted[0];\n    const parameters = splitted[1];\n    if (parameters) {\n        const heightFromParams = /height=(\\d+)/.exec(parameters);\n        const widthFromParams = /width=(\\d+)/.exec(parameters);\n        const height = heightFromParams ? heightFromParams[1] : '';\n        const width = widthFromParams ? widthFromParams[1] : '';\n        const widthIsFinite = isFinite(parseInt(width));\n        const heightIsFinite = isFinite(parseInt(height));\n        if (widthIsFinite) {\n            dimensions.push(`width=\"${width}\"`);\n        }\n        if (heightIsFinite) {\n            dimensions.push(`height=\"${height}\"`);\n        }\n    }\n    return { href, dimensions };\n}\n"],"names":[],"mappings":";;;;;AASO,MAAM,eAAe;AAAA,EACxB,YAAY,QAAQ,IAAI,qBAAqB,OAAO;AAChD,SAAK,QAAQ;AACb,QAAI,OAAO,KAAK,UAAU,UAAU;AAChC,YAAM,gBAAgB,OAAO;AAAA,IACzC;AACQ,QAAI,OAAO,uBAAuB,WAAW;AACzC,WAAK,YAAY;AACjB,WAAK,oBAAoB;AACzB,WAAK,cAAc;AAAA,IAC/B,OACa;AACD,WAAK,YAAY,mBAAmB,aAAa;AACjD,WAAK,oBAAoB,mBAAmB,qBAAqB;AACjE,WAAK,cAAc,mBAAmB,eAAe;AAAA,IACjE;AAAA,EACA;AAAA,EACI,WAAW,OAAO,eAAe,GAAkD;AAC/E,SAAK,SAAS,2BAA2B,KAAK,oBAAoB,YAAY,KAAK,IAAI,KAAK,EACvF,QAAQ,aAAa,CAAC,QAAQ,OAAO,SAAS,OAAO,GAAG,MAAM,CAAC,EAC/D,QAAQ,QAAQ,KAAK,EACrB,QAAQ,OAAO,iBAAiB,IAA+C,SAAS,MAAM;AACnG,WAAO;AAAA,EACf;AAAA,EACI,eAAe,OAAO;AAClB,SAAK,SAAS;AACd,WAAO;AAAA,EACf;AAAA,EACI,gBAAgB,QAAQ,MAAM;AAC1B,SAAK,SAAS;AAAA,EAAK,oCAAoC,MAAM,MAAM,CAAC;AAAA;AACpE,WAAO;AAAA,EACf;AAAA,EACI,WAAW,QAAQ,OAAO,OAAO;AAC7B,SAAK,SAAS;AACd,SAAK,SAAS,KAAK,QAAQ,OAAO,GAAG;AACrC,SAAK,SAAS;AACd,SAAK,SAAS,KAAK,QAAQ,OAAO,MAAM,GAAG,GAAG;AAC9C,QAAI,OAAO;AACP,WAAK,SAAS,KAAK,KAAK,QAAQ,KAAK,QAAQ,OAAO,GAAG,GAAG,GAAG,CAAC;AAAA,IAC1E;AACQ,SAAK,SAAS;AACd,WAAO;AAAA,EACf;AAAA,EACI,QAAQ,OAAO,IAAI;AACf,UAAM,IAAI,IAAI,OAAO,uBAAuB,EAAE,GAAG,GAAG;AACpD,WAAO,MAAM,QAAQ,GAAG,CAAC,OAAO,WAAW;AACvC,UAAI,MAAM,OAAO,SAAS,CAAC,MAAM,MAAM;AACnC,eAAO,KAAK,KAAK;AAAA,MACjC,OACiB;AACD,eAAO;AAAA,MACvB;AAAA,IACA,CAAS;AAAA,EACT;AACA;AACO,SAAS,sBAAsB,WAAW;AAC7C,MAAI,iBAAiB,SAAS,GAAG;AAC7B,WAAO,CAAC,UAAU;AAAA,EAC1B,WACa,MAAM,QAAQ,SAAS,GAAG;AAC/B,WAAO,UAAU,MAAM,qBAAqB;AAAA,EACpD,OACS;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,iBAAiB,OAAO;AACpC,MAAI,iBAAiB,gBAAgB;AACjC,WAAO;AAAA,EACf,WACa,SAAS,OAAO,UAAU,UAAU;AACzC,WAAO,OAAO,MAAM,UAAU,aACtB,OAAO,MAAM,cAAc,aAAa,OAAO,MAAM,cAAc,YAAY,MAAM,cAAc,YACnG,OAAO,MAAM,sBAAsB,aAAa,MAAM,sBAAsB;AAAA,EAC5F;AACI,SAAO;AACX;AACO,SAAS,oBAAoB,GAAG,GAAG;AACtC,MAAI,MAAM,GAAG;AACT,WAAO;AAAA,EACf,WACa,CAAC,KAAK,CAAC,GAAG;AACf,WAAO;AAAA,EACf,OACS;AACD,WAAO,EAAE,UAAU,EAAE,SACd,EAAE,cAAc,EAAE,aAClB,EAAE,sBAAsB,EAAE,qBAC1B,EAAE,gBAAgB,EAAE,gBACnB,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,WAAW,QAAQ,IAAI,KAAK,EAAE,OAAO,GAAG,IAAI,KAAK,EAAE,OAAO,CAAC;AAAA,EACzH;AACA;AACO,SAAS,2BAA2B,MAAM;AAE7C,SAAO,KAAK,QAAQ,yBAAyB,MAAM;AACvD;AAIO,SAAS,oCAAoC,MAAM,QAAQ;;AAC9D,QAAM,uBAAqB,UAAK,MAAM,OAAO,MAAlB,mBAAqB,OAAO,CAAC,GAAG,MAAO,EAAE,SAAS,EAAE,SAAS,IAAI,GAAI,WAC5F;AACJ,QAAM,qBAAqB,sBAAsB,IAAI,qBAAqB,IAAI;AAE9E,SAAO;AAAA,IACH,GAAG,IAAI,OAAO,kBAAkB,CAAC,GAAG,MAAM;AAAA,IAC1C;AAAA,IACA,GAAG,IAAI,OAAO,kBAAkB,CAAC;AAAA,EACzC,EAAM,KAAK,IAAI;AACf;AACO,SAAS,mBAAmB,OAAO;AACtC,SAAO,MAAM,QAAQ,MAAM,QAAQ;AACvC;AACO,SAAS,sBAAsB,MAAM;AACxC,MAAI,CAAC,MAAM;AACP,WAAO;AAAA,EACf;AACI,SAAO,KAAK,QAAQ,8BAA8B,IAAI;AAC1D;AACO,SAAS,uBAAuB,MAAM;AACzC,QAAM,aAAa,CAAE;AACrB,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,MAAM;AAClD,SAAO,SAAS,CAAC;AACjB,QAAM,aAAa,SAAS,CAAC;AAC7B,MAAI,YAAY;AACZ,UAAM,mBAAmB,eAAe,KAAK,UAAU;AACvD,UAAM,kBAAkB,cAAc,KAAK,UAAU;AACrD,UAAM,SAAS,mBAAmB,iBAAiB,CAAC,IAAI;AACxD,UAAM,QAAQ,kBAAkB,gBAAgB,CAAC,IAAI;AACrD,UAAM,gBAAgB,SAAS,SAAS,KAAK,CAAC;AAC9C,UAAM,iBAAiB,SAAS,SAAS,MAAM,CAAC;AAChD,QAAI,eAAe;AACf,iBAAW,KAAK,UAAU,KAAK,GAAG;AAAA,IAC9C;AACQ,QAAI,gBAAgB;AAChB,iBAAW,KAAK,WAAW,MAAM,GAAG;AAAA,IAChD;AAAA,EACA;AACI,SAAO,EAAE,MAAM,WAAY;AAC/B;","x_google_ignoreList":[0]}
+{"version":3,"file":"htmlContent.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/htmlContent.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nimport { illegalArgument } from './errors.js';\nimport { escapeIcons } from './iconLabels.js';\nimport { isEqual } from './resources.js';\nimport { escapeRegExpCharacters } from './strings.js';\nimport { URI } from './uri.js';\nexport class MarkdownString {\n    constructor(value = '', isTrustedOrOptions = false) {\n        this.value = value;\n        if (typeof this.value !== 'string') {\n            throw illegalArgument('value');\n        }\n        if (typeof isTrustedOrOptions === 'boolean') {\n            this.isTrusted = isTrustedOrOptions;\n            this.supportThemeIcons = false;\n            this.supportHtml = false;\n        }\n        else {\n            this.isTrusted = isTrustedOrOptions.isTrusted ?? undefined;\n            this.supportThemeIcons = isTrustedOrOptions.supportThemeIcons ?? false;\n            this.supportHtml = isTrustedOrOptions.supportHtml ?? false;\n        }\n    }\n    appendText(value, newlineStyle = 0 /* MarkdownStringTextNewlineStyle.Paragraph */) {\n        this.value += escapeMarkdownSyntaxTokens(this.supportThemeIcons ? escapeIcons(value) : value) // CodeQL [SM02383] The Markdown is fully sanitized after being rendered.\n            .replace(/([ \\t]+)/g, (_match, g1) => ' '.repeat(g1.length)) // CodeQL [SM02383] The Markdown is fully sanitized after being rendered.\n            .replace(/\\>/gm, '\\\\>') // CodeQL [SM02383] The Markdown is fully sanitized after being rendered.\n            .replace(/\\n/g, newlineStyle === 1 /* MarkdownStringTextNewlineStyle.Break */ ? '\\\\\\n' : '\\n\\n'); // CodeQL [SM02383] The Markdown is fully sanitized after being rendered.\n        return this;\n    }\n    appendMarkdown(value) {\n        this.value += value;\n        return this;\n    }\n    appendCodeblock(langId, code) {\n        this.value += `\\n${appendEscapedMarkdownCodeBlockFence(code, langId)}\\n`;\n        return this;\n    }\n    appendLink(target, label, title) {\n        this.value += '[';\n        this.value += this._escape(label, ']');\n        this.value += '](';\n        this.value += this._escape(String(target), ')');\n        if (title) {\n            this.value += ` \"${this._escape(this._escape(title, '\"'), ')')}\"`;\n        }\n        this.value += ')';\n        return this;\n    }\n    _escape(value, ch) {\n        const r = new RegExp(escapeRegExpCharacters(ch), 'g');\n        return value.replace(r, (match, offset) => {\n            if (value.charAt(offset - 1) !== '\\\\') {\n                return `\\\\${match}`;\n            }\n            else {\n                return match;\n            }\n        });\n    }\n}\nexport function isEmptyMarkdownString(oneOrMany) {\n    if (isMarkdownString(oneOrMany)) {\n        return !oneOrMany.value;\n    }\n    else if (Array.isArray(oneOrMany)) {\n        return oneOrMany.every(isEmptyMarkdownString);\n    }\n    else {\n        return true;\n    }\n}\nexport function isMarkdownString(thing) {\n    if (thing instanceof MarkdownString) {\n        return true;\n    }\n    else if (thing && typeof thing === 'object') {\n        return typeof thing.value === 'string'\n            && (typeof thing.isTrusted === 'boolean' || typeof thing.isTrusted === 'object' || thing.isTrusted === undefined)\n            && (typeof thing.supportThemeIcons === 'boolean' || thing.supportThemeIcons === undefined);\n    }\n    return false;\n}\nexport function markdownStringEqual(a, b) {\n    if (a === b) {\n        return true;\n    }\n    else if (!a || !b) {\n        return false;\n    }\n    else {\n        return a.value === b.value\n            && a.isTrusted === b.isTrusted\n            && a.supportThemeIcons === b.supportThemeIcons\n            && a.supportHtml === b.supportHtml\n            && (a.baseUri === b.baseUri || !!a.baseUri && !!b.baseUri && isEqual(URI.from(a.baseUri), URI.from(b.baseUri)));\n    }\n}\nexport function escapeMarkdownSyntaxTokens(text) {\n    // escape markdown syntax tokens: http://daringfireball.net/projects/markdown/syntax#backslash\n    return text.replace(/[\\\\`*_{}[\\]()#+\\-!~]/g, '\\\\$&'); // CodeQL [SM02383] Backslash is escaped in the character class\n}\n/**\n * @see https://github.com/microsoft/vscode/issues/193746\n */\nexport function appendEscapedMarkdownCodeBlockFence(code, langId) {\n    const longestFenceLength = code.match(/^`+/gm)?.reduce((a, b) => (a.length > b.length ? a : b)).length ??\n        0;\n    const desiredFenceLength = longestFenceLength >= 3 ? longestFenceLength + 1 : 3;\n    // the markdown result\n    return [\n        `${'`'.repeat(desiredFenceLength)}${langId}`,\n        code,\n        `${'`'.repeat(desiredFenceLength)}`,\n    ].join('\\n');\n}\nexport function escapeDoubleQuotes(input) {\n    return input.replace(/\"/g, '"');\n}\nexport function removeMarkdownEscapes(text) {\n    if (!text) {\n        return text;\n    }\n    return text.replace(/\\\\([\\\\`*_{}[\\]()#+\\-.!~])/g, '$1');\n}\nexport function parseHrefAndDimensions(href) {\n    const dimensions = [];\n    const splitted = href.split('|').map(s => s.trim());\n    href = splitted[0];\n    const parameters = splitted[1];\n    if (parameters) {\n        const heightFromParams = /height=(\\d+)/.exec(parameters);\n        const widthFromParams = /width=(\\d+)/.exec(parameters);\n        const height = heightFromParams ? heightFromParams[1] : '';\n        const width = widthFromParams ? widthFromParams[1] : '';\n        const widthIsFinite = isFinite(parseInt(width));\n        const heightIsFinite = isFinite(parseInt(height));\n        if (widthIsFinite) {\n            dimensions.push(`width=\"${width}\"`);\n        }\n        if (heightIsFinite) {\n            dimensions.push(`height=\"${height}\"`);\n        }\n    }\n    return { href, dimensions };\n}\n"],"names":[],"mappings":";;;;;AASO,MAAM,eAAe;AAAA,EACxB,YAAY,QAAQ,IAAI,qBAAqB,OAAO;AAChD,SAAK,QAAQ;AACb,QAAI,OAAO,KAAK,UAAU,UAAU;AAChC,YAAM,gBAAgB,OAAO;AAAA,IACzC;AACQ,QAAI,OAAO,uBAAuB,WAAW;AACzC,WAAK,YAAY;AACjB,WAAK,oBAAoB;AACzB,WAAK,cAAc;AAAA,IAC/B,OACa;AACD,WAAK,YAAY,mBAAmB,aAAa;AACjD,WAAK,oBAAoB,mBAAmB,qBAAqB;AACjE,WAAK,cAAc,mBAAmB,eAAe;AAAA,IACjE;AAAA,EACA;AAAA,EACI,WAAW,OAAO,eAAe,GAAkD;AAC/E,SAAK,SAAS,2BAA2B,KAAK,oBAAoB,YAAY,KAAK,IAAI,KAAK,EACvF,QAAQ,aAAa,CAAC,QAAQ,OAAO,SAAS,OAAO,GAAG,MAAM,CAAC,EAC/D,QAAQ,QAAQ,KAAK,EACrB,QAAQ,OAAO,iBAAiB,IAA+C,SAAS,MAAM;AACnG,WAAO;AAAA,EACf;AAAA,EACI,eAAe,OAAO;AAClB,SAAK,SAAS;AACd,WAAO;AAAA,EACf;AAAA,EACI,gBAAgB,QAAQ,MAAM;AAC1B,SAAK,SAAS;AAAA,EAAK,oCAAoC,MAAM,MAAM,CAAC;AAAA;AACpE,WAAO;AAAA,EACf;AAAA,EACI,WAAW,QAAQ,OAAO,OAAO;AAC7B,SAAK,SAAS;AACd,SAAK,SAAS,KAAK,QAAQ,OAAO,GAAG;AACrC,SAAK,SAAS;AACd,SAAK,SAAS,KAAK,QAAQ,OAAO,MAAM,GAAG,GAAG;AAC9C,QAAI,OAAO;AACP,WAAK,SAAS,KAAK,KAAK,QAAQ,KAAK,QAAQ,OAAO,GAAG,GAAG,GAAG,CAAC;AAAA,IAC1E;AACQ,SAAK,SAAS;AACd,WAAO;AAAA,EACf;AAAA,EACI,QAAQ,OAAO,IAAI;AACf,UAAM,IAAI,IAAI,OAAO,uBAAuB,EAAE,GAAG,GAAG;AACpD,WAAO,MAAM,QAAQ,GAAG,CAAC,OAAO,WAAW;AACvC,UAAI,MAAM,OAAO,SAAS,CAAC,MAAM,MAAM;AACnC,eAAO,KAAK,KAAK;AAAA,MACjC,OACiB;AACD,eAAO;AAAA,MACvB;AAAA,IACA,CAAS;AAAA,EACT;AACA;AAYO,SAAS,iBAAiB,OAAO;AACpC,MAAI,iBAAiB,gBAAgB;AACjC,WAAO;AAAA,EACf,WACa,SAAS,OAAO,UAAU,UAAU;AACzC,WAAO,OAAO,MAAM,UAAU,aACtB,OAAO,MAAM,cAAc,aAAa,OAAO,MAAM,cAAc,YAAY,MAAM,cAAc,YACnG,OAAO,MAAM,sBAAsB,aAAa,MAAM,sBAAsB;AAAA,EAC5F;AACI,SAAO;AACX;AACO,SAAS,oBAAoB,GAAG,GAAG;AACtC,MAAI,MAAM,GAAG;AACT,WAAO;AAAA,EACf,WACa,CAAC,KAAK,CAAC,GAAG;AACf,WAAO;AAAA,EACf,OACS;AACD,WAAO,EAAE,UAAU,EAAE,SACd,EAAE,cAAc,EAAE,aAClB,EAAE,sBAAsB,EAAE,qBAC1B,EAAE,gBAAgB,EAAE,gBACnB,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,WAAW,QAAQ,IAAI,KAAK,EAAE,OAAO,GAAG,IAAI,KAAK,EAAE,OAAO,CAAC;AAAA,EACzH;AACA;AACO,SAAS,2BAA2B,MAAM;AAE7C,SAAO,KAAK,QAAQ,yBAAyB,MAAM;AACvD;AAIO,SAAS,oCAAoC,MAAM,QAAQ;;AAC9D,QAAM,uBAAqB,UAAK,MAAM,OAAO,MAAlB,mBAAqB,OAAO,CAAC,GAAG,MAAO,EAAE,SAAS,EAAE,SAAS,IAAI,GAAI,WAC5F;AACJ,QAAM,qBAAqB,sBAAsB,IAAI,qBAAqB,IAAI;AAE9E,SAAO;AAAA,IACH,GAAG,IAAI,OAAO,kBAAkB,CAAC,GAAG,MAAM;AAAA,IAC1C;AAAA,IACA,GAAG,IAAI,OAAO,kBAAkB,CAAC;AAAA,EACzC,EAAM,KAAK,IAAI;AACf;AACO,SAAS,mBAAmB,OAAO;AACtC,SAAO,MAAM,QAAQ,MAAM,QAAQ;AACvC;AACO,SAAS,sBAAsB,MAAM;AACxC,MAAI,CAAC,MAAM;AACP,WAAO;AAAA,EACf;AACI,SAAO,KAAK,QAAQ,8BAA8B,IAAI;AAC1D;AACO,SAAS,uBAAuB,MAAM;AACzC,QAAM,aAAa,CAAE;AACrB,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,IAAI,OAAK,EAAE,MAAM;AAClD,SAAO,SAAS,CAAC;AACjB,QAAM,aAAa,SAAS,CAAC;AAC7B,MAAI,YAAY;AACZ,UAAM,mBAAmB,eAAe,KAAK,UAAU;AACvD,UAAM,kBAAkB,cAAc,KAAK,UAAU;AACrD,UAAM,SAAS,mBAAmB,iBAAiB,CAAC,IAAI;AACxD,UAAM,QAAQ,kBAAkB,gBAAgB,CAAC,IAAI;AACrD,UAAM,gBAAgB,SAAS,SAAS,KAAK,CAAC;AAC9C,UAAM,iBAAiB,SAAS,SAAS,MAAM,CAAC;AAChD,QAAI,eAAe;AACf,iBAAW,KAAK,UAAU,KAAK,GAAG;AAAA,IAC9C;AACQ,QAAI,gBAAgB;AAChB,iBAAW,KAAK,WAAW,MAAM,GAAG;AAAA,IAChD;AAAA,EACA;AACI,SAAO,EAAE,MAAM,WAAY;AAC/B;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/lifecycle.es.js

@@ -164,22 +164,6 @@ class MutableDisposable {
     this._value = void 0;
   }
 }
-class RefCountedDisposable {
-  constructor(_disposable) {
-    this._disposable = _disposable;
-    this._counter = 1;
-  }
-  acquire() {
-    this._counter++;
-    return this;
-  }
-  release() {
-    if (--this._counter === 0) {
-      this._disposable.dispose();
-    }
-    return this;
-  }
-}
 class ImmortalReference {
   constructor(object) {
     this.object = object;
@@ -245,7 +229,6 @@ export {
   DisposableStore,
   ImmortalReference,
   MutableDisposable,
-  RefCountedDisposable,
   combinedDisposable,
   dispose,
   isDisposable,

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/lifecycle.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"lifecycle.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/lifecycle.js"],"sourcesContent":["import { createSingleCallFunction } from './functional.js';\nimport { Iterable } from './iterator.js';\n// #region Disposable Tracking\n/**\n * Enables logging of potentially leaked disposables.\n *\n * A disposable is considered leaked if it is not disposed or not registered as the child of\n * another disposable. This tracking is very simple an only works for classes that either\n * extend Disposable or use a DisposableStore. This means there are a lot of false positives.\n */\nconst TRACK_DISPOSABLES = false;\nlet disposableTracker = null;\nexport function setDisposableTracker(tracker) {\n    disposableTracker = tracker;\n}\nif (TRACK_DISPOSABLES) {\n    const __is_disposable_tracked__ = '__is_disposable_tracked__';\n    setDisposableTracker(new class {\n        trackDisposable(x) {\n            const stack = new Error('Potentially leaked disposable').stack;\n            setTimeout(() => {\n                if (!x[__is_disposable_tracked__]) {\n                    console.log(stack);\n                }\n            }, 3000);\n        }\n        setParent(child, parent) {\n            if (child && child !== Disposable.None) {\n                try {\n                    child[__is_disposable_tracked__] = true;\n                }\n                catch {\n                    // noop\n                }\n            }\n        }\n        markAsDisposed(disposable) {\n            if (disposable && disposable !== Disposable.None) {\n                try {\n                    disposable[__is_disposable_tracked__] = true;\n                }\n                catch {\n                    // noop\n                }\n            }\n        }\n        markAsSingleton(disposable) { }\n    });\n}\nexport function trackDisposable(x) {\n    disposableTracker?.trackDisposable(x);\n    return x;\n}\nexport function markAsDisposed(disposable) {\n    disposableTracker?.markAsDisposed(disposable);\n}\nfunction setParentOfDisposable(child, parent) {\n    disposableTracker?.setParent(child, parent);\n}\nfunction setParentOfDisposables(children, parent) {\n    if (!disposableTracker) {\n        return;\n    }\n    for (const child of children) {\n        disposableTracker.setParent(child, parent);\n    }\n}\n/**\n * Indicates that the given object is a singleton which does not need to be disposed.\n*/\nexport function markAsSingleton(singleton) {\n    disposableTracker?.markAsSingleton(singleton);\n    return singleton;\n}\n/**\n * Check if `thing` is {@link IDisposable disposable}.\n */\nexport function isDisposable(thing) {\n    return typeof thing === 'object' && thing !== null && typeof thing.dispose === 'function' && thing.dispose.length === 0;\n}\nexport function dispose(arg) {\n    if (Iterable.is(arg)) {\n        const errors = [];\n        for (const d of arg) {\n            if (d) {\n                try {\n                    d.dispose();\n                }\n                catch (e) {\n                    errors.push(e);\n                }\n            }\n        }\n        if (errors.length === 1) {\n            throw errors[0];\n        }\n        else if (errors.length > 1) {\n            throw new AggregateError(errors, 'Encountered errors while disposing of store');\n        }\n        return Array.isArray(arg) ? [] : arg;\n    }\n    else if (arg) {\n        arg.dispose();\n        return arg;\n    }\n}\n/**\n * Combine multiple disposable values into a single {@link IDisposable}.\n */\nexport function combinedDisposable(...disposables) {\n    const parent = toDisposable(() => dispose(disposables));\n    setParentOfDisposables(disposables, parent);\n    return parent;\n}\n/**\n * Turn a function that implements dispose into an {@link IDisposable}.\n *\n * @param fn Clean up function, guaranteed to be called only **once**.\n */\nexport function toDisposable(fn) {\n    const self = trackDisposable({\n        dispose: createSingleCallFunction(() => {\n            markAsDisposed(self);\n            fn();\n        })\n    });\n    return self;\n}\n/**\n * Manages a collection of disposable values.\n *\n * This is the preferred way to manage multiple disposables. A `DisposableStore` is safer to work with than an\n * `IDisposable[]` as it considers edge cases, such as registering the same value multiple times or adding an item to a\n * store that has already been disposed of.\n */\nexport class DisposableStore {\n    static { this.DISABLE_DISPOSED_WARNING = false; }\n    constructor() {\n        this._toDispose = new Set();\n        this._isDisposed = false;\n        trackDisposable(this);\n    }\n    /**\n     * Dispose of all registered disposables and mark this object as disposed.\n     *\n     * Any future disposables added to this object will be disposed of on `add`.\n     */\n    dispose() {\n        if (this._isDisposed) {\n            return;\n        }\n        markAsDisposed(this);\n        this._isDisposed = true;\n        this.clear();\n    }\n    /**\n     * @return `true` if this object has been disposed of.\n     */\n    get isDisposed() {\n        return this._isDisposed;\n    }\n    /**\n     * Dispose of all registered disposables but do not mark this object as disposed.\n     */\n    clear() {\n        if (this._toDispose.size === 0) {\n            return;\n        }\n        try {\n            dispose(this._toDispose);\n        }\n        finally {\n            this._toDispose.clear();\n        }\n    }\n    /**\n     * Add a new {@link IDisposable disposable} to the collection.\n     */\n    add(o) {\n        if (!o) {\n            return o;\n        }\n        if (o === this) {\n            throw new Error('Cannot register a disposable on itself!');\n        }\n        setParentOfDisposable(o, this);\n        if (this._isDisposed) {\n            if (!DisposableStore.DISABLE_DISPOSED_WARNING) {\n                console.warn(new Error('Trying to add a disposable to a DisposableStore that has already been disposed of. The added object will be leaked!').stack);\n            }\n        }\n        else {\n            this._toDispose.add(o);\n        }\n        return o;\n    }\n    /**\n     * Deletes the value from the store, but does not dispose it.\n     */\n    deleteAndLeak(o) {\n        if (!o) {\n            return;\n        }\n        if (this._toDispose.has(o)) {\n            this._toDispose.delete(o);\n            setParentOfDisposable(o, null);\n        }\n    }\n}\n/**\n * Abstract base class for a {@link IDisposable disposable} object.\n *\n * Subclasses can {@linkcode _register} disposables that will be automatically cleaned up when this object is disposed of.\n */\nexport class Disposable {\n    /**\n     * A disposable that does nothing when it is disposed of.\n     *\n     * TODO: This should not be a static property.\n     */\n    static { this.None = Object.freeze({ dispose() { } }); }\n    constructor() {\n        this._store = new DisposableStore();\n        trackDisposable(this);\n        setParentOfDisposable(this._store, this);\n    }\n    dispose() {\n        markAsDisposed(this);\n        this._store.dispose();\n    }\n    /**\n     * Adds `o` to the collection of disposables managed by this object.\n     */\n    _register(o) {\n        if (o === this) {\n            throw new Error('Cannot register a disposable on itself!');\n        }\n        return this._store.add(o);\n    }\n}\n/**\n * Manages the lifecycle of a disposable value that may be changed.\n *\n * This ensures that when the disposable value is changed, the previously held disposable is disposed of. You can\n * also register a `MutableDisposable` on a `Disposable` to ensure it is automatically cleaned up.\n */\nexport class MutableDisposable {\n    constructor() {\n        this._isDisposed = false;\n        trackDisposable(this);\n    }\n    get value() {\n        return this._isDisposed ? undefined : this._value;\n    }\n    set value(value) {\n        if (this._isDisposed || value === this._value) {\n            return;\n        }\n        this._value?.dispose();\n        if (value) {\n            setParentOfDisposable(value, this);\n        }\n        this._value = value;\n    }\n    /**\n     * Resets the stored value and disposed of the previously stored value.\n     */\n    clear() {\n        this.value = undefined;\n    }\n    dispose() {\n        this._isDisposed = true;\n        markAsDisposed(this);\n        this._value?.dispose();\n        this._value = undefined;\n    }\n}\nexport class RefCountedDisposable {\n    constructor(_disposable) {\n        this._disposable = _disposable;\n        this._counter = 1;\n    }\n    acquire() {\n        this._counter++;\n        return this;\n    }\n    release() {\n        if (--this._counter === 0) {\n            this._disposable.dispose();\n        }\n        return this;\n    }\n}\nexport class ImmortalReference {\n    constructor(object) {\n        this.object = object;\n    }\n    dispose() { }\n}\n/**\n * A map the manages the lifecycle of the values that it stores.\n */\nexport class DisposableMap {\n    constructor() {\n        this._store = new Map();\n        this._isDisposed = false;\n        trackDisposable(this);\n    }\n    /**\n     * Disposes of all stored values and mark this object as disposed.\n     *\n     * Trying to use this object after it has been disposed of is an error.\n     */\n    dispose() {\n        markAsDisposed(this);\n        this._isDisposed = true;\n        this.clearAndDisposeAll();\n    }\n    /**\n     * Disposes of all stored values and clear the map, but DO NOT mark this object as disposed.\n     */\n    clearAndDisposeAll() {\n        if (!this._store.size) {\n            return;\n        }\n        try {\n            dispose(this._store.values());\n        }\n        finally {\n            this._store.clear();\n        }\n    }\n    get(key) {\n        return this._store.get(key);\n    }\n    set(key, value, skipDisposeOnOverwrite = false) {\n        if (this._isDisposed) {\n            console.warn(new Error('Trying to add a disposable to a DisposableMap that has already been disposed of. The added object will be leaked!').stack);\n        }\n        if (!skipDisposeOnOverwrite) {\n            this._store.get(key)?.dispose();\n        }\n        this._store.set(key, value);\n    }\n    /**\n     * Delete the value stored for `key` from this map and also dispose of it.\n     */\n    deleteAndDispose(key) {\n        this._store.get(key)?.dispose();\n        this._store.delete(key);\n    }\n    [Symbol.iterator]() {\n        return this._store[Symbol.iterator]();\n    }\n}\n"],"names":[],"mappings":";;AAiDO,SAAS,gBAAgB,GAAG;AAE/B,SAAO;AACX;AAIA,SAAS,sBAAsB,OAAO,QAAQ;AAE9C;AAYO,SAAS,gBAAgB,WAAW;AAEvC,SAAO;AACX;AAIO,SAAS,aAAa,OAAO;AAChC,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,YAAY,cAAc,MAAM,QAAQ,WAAW;AAC1H;AACO,SAAS,QAAQ,KAAK;AACzB,MAAI,SAAS,GAAG,GAAG,GAAG;AAClB,UAAM,SAAS,CAAE;AACjB,eAAW,KAAK,KAAK;AACjB,UAAI,GAAG;AACH,YAAI;AACA,YAAE,QAAS;AAAA,QAC/B,SACuB,GAAG;AACN,iBAAO,KAAK,CAAC;AAAA,QACjC;AAAA,MACA;AAAA,IACA;AACQ,QAAI,OAAO,WAAW,GAAG;AACrB,YAAM,OAAO,CAAC;AAAA,IAC1B,WACiB,OAAO,SAAS,GAAG;AACxB,YAAM,IAAI,eAAe,QAAQ,6CAA6C;AAAA,IAC1F;AACQ,WAAO,MAAM,QAAQ,GAAG,IAAI,CAAE,IAAG;AAAA,EACzC,WACa,KAAK;AACV,QAAI,QAAS;AACb,WAAO;AAAA,EACf;AACA;AAIO,SAAS,sBAAsB,aAAa;AAC/C,QAAM,SAAS,aAAa,MAAM,QAAQ,WAAW,CAAC;AAEtD,SAAO;AACX;AAMO,SAAS,aAAa,IAAI;AAC7B,QAAM,OAAO,gBAAgB;AAAA,IACzB,SAAS,yBAAyB,MAAM;AAEpC,SAAI;AAAA,IACP,CAAA;AAAA,EACT,CAAK;AACD,SAAO;AACX;AAQO,MAAM,mBAAN,MAAM,iBAAgB;AAAA,EAEzB,cAAc;AACV,SAAK,aAAa,oBAAI,IAAK;AAC3B,SAAK,cAAc;AAAA,EAE3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,UAAU;AACN,QAAI,KAAK,aAAa;AAClB;AAAA,IACZ;AAEQ,SAAK,cAAc;AACnB,SAAK,MAAO;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAII,IAAI,aAAa;AACb,WAAO,KAAK;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAII,QAAQ;AACJ,QAAI,KAAK,WAAW,SAAS,GAAG;AAC5B;AAAA,IACZ;AACQ,QAAI;AACA,cAAQ,KAAK,UAAU;AAAA,IACnC,UACgB;AACJ,WAAK,WAAW,MAAO;AAAA,IACnC;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EAII,IAAI,GAAG;AACH,QAAI,CAAC,GAAG;AACJ,aAAO;AAAA,IACnB;AACQ,QAAI,MAAM,MAAM;AACZ,YAAM,IAAI,MAAM,yCAAyC;AAAA,IACrE;AAEQ,QAAI,KAAK,aAAa;AAClB,UAAI,CAAC,iBAAgB,0BAA0B;AAC3C,gBAAQ,KAAK,IAAI,MAAM,qHAAqH,EAAE,KAAK;AAAA,MACnK;AAAA,IACA,OACa;AACD,WAAK,WAAW,IAAI,CAAC;AAAA,IACjC;AACQ,WAAO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAII,cAAc,GAAG;AACb,QAAI,CAAC,GAAG;AACJ;AAAA,IACZ;AACQ,QAAI,KAAK,WAAW,IAAI,CAAC,GAAG;AACxB,WAAK,WAAW,OAAO,CAAC;AAAA,IAEpC;AAAA,EACA;AACA;AAxEa,iBAAK,2BAA2B;AADtC,IAAM,kBAAN;AA+EA,MAAM,cAAN,MAAM,YAAW;AAAA,EAOpB,cAAc;AACV,SAAK,SAAS,IAAI,gBAAiB;AAEnC,0BAAsB,KAAK,MAAY;AAAA,EAC/C;AAAA,EACI,UAAU;AAEN,SAAK,OAAO,QAAS;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAII,UAAU,GAAG;AACT,QAAI,MAAM,MAAM;AACZ,YAAM,IAAI,MAAM,yCAAyC;AAAA,IACrE;AACQ,WAAO,KAAK,OAAO,IAAI,CAAC;AAAA,EAChC;AACA;AAnBa,YAAK,OAAO,OAAO,OAAO,EAAE,UAAU;AAAG,EAAA,CAAE;AANjD,IAAM,aAAN;AAgCA,MAAM,kBAAkB;AAAA,EAC3B,cAAc;AACV,SAAK,cAAc;AAAA,EAE3B;AAAA,EACI,IAAI,QAAQ;AACR,WAAO,KAAK,cAAc,SAAY,KAAK;AAAA,EACnD;AAAA,EACI,IAAI,MAAM,OAAO;;AACb,QAAI,KAAK,eAAe,UAAU,KAAK,QAAQ;AAC3C;AAAA,IACZ;AACQ,eAAK,WAAL,mBAAa;AAIb,SAAK,SAAS;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAII,QAAQ;AACJ,SAAK,QAAQ;AAAA,EACrB;AAAA,EACI,UAAU;;AACN,SAAK,cAAc;AAEnB,eAAK,WAAL,mBAAa;AACb,SAAK,SAAS;AAAA,EACtB;AACA;AACO,MAAM,qBAAqB;AAAA,EAC9B,YAAY,aAAa;AACrB,SAAK,cAAc;AACnB,SAAK,WAAW;AAAA,EACxB;AAAA,EACI,UAAU;AACN,SAAK;AACL,WAAO;AAAA,EACf;AAAA,EACI,UAAU;AACN,QAAI,EAAE,KAAK,aAAa,GAAG;AACvB,WAAK,YAAY,QAAS;AAAA,IACtC;AACQ,WAAO;AAAA,EACf;AACA;AACO,MAAM,kBAAkB;AAAA,EAC3B,YAAY,QAAQ;AAChB,SAAK,SAAS;AAAA,EACtB;AAAA,EACI,UAAU;AAAA,EAAA;AACd;AAIO,MAAM,cAAc;AAAA,EACvB,cAAc;AACV,SAAK,SAAS,oBAAI,IAAK;AACvB,SAAK,cAAc;AAAA,EAE3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,UAAU;AAEN,SAAK,cAAc;AACnB,SAAK,mBAAoB;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA,EAII,qBAAqB;AACjB,QAAI,CAAC,KAAK,OAAO,MAAM;AACnB;AAAA,IACZ;AACQ,QAAI;AACA,cAAQ,KAAK,OAAO,QAAQ;AAAA,IACxC,UACgB;AACJ,WAAK,OAAO,MAAO;AAAA,IAC/B;AAAA,EACA;AAAA,EACI,IAAI,KAAK;AACL,WAAO,KAAK,OAAO,IAAI,GAAG;AAAA,EAClC;AAAA,EACI,IAAI,KAAK,OAAO,yBAAyB,OAAO;;AAC5C,QAAI,KAAK,aAAa;AAClB,cAAQ,KAAK,IAAI,MAAM,mHAAmH,EAAE,KAAK;AAAA,IAC7J;AACQ,QAAI,CAAC,wBAAwB;AACzB,iBAAK,OAAO,IAAI,GAAG,MAAnB,mBAAsB;AAAA,IAClC;AACQ,SAAK,OAAO,IAAI,KAAK,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAII,iBAAiB,KAAK;;AAClB,eAAK,OAAO,IAAI,GAAG,MAAnB,mBAAsB;AACtB,SAAK,OAAO,OAAO,GAAG;AAAA,EAC9B;AAAA,EACI,CAAC,OAAO,QAAQ,IAAI;AAChB,WAAO,KAAK,OAAO,OAAO,QAAQ,EAAG;AAAA,EAC7C;AACA;","x_google_ignoreList":[0]}
+{"version":3,"file":"lifecycle.es.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/lifecycle.js"],"sourcesContent":["import { createSingleCallFunction } from './functional.js';\nimport { Iterable } from './iterator.js';\n// #region Disposable Tracking\n/**\n * Enables logging of potentially leaked disposables.\n *\n * A disposable is considered leaked if it is not disposed or not registered as the child of\n * another disposable. This tracking is very simple an only works for classes that either\n * extend Disposable or use a DisposableStore. This means there are a lot of false positives.\n */\nconst TRACK_DISPOSABLES = false;\nlet disposableTracker = null;\nexport function setDisposableTracker(tracker) {\n    disposableTracker = tracker;\n}\nif (TRACK_DISPOSABLES) {\n    const __is_disposable_tracked__ = '__is_disposable_tracked__';\n    setDisposableTracker(new class {\n        trackDisposable(x) {\n            const stack = new Error('Potentially leaked disposable').stack;\n            setTimeout(() => {\n                if (!x[__is_disposable_tracked__]) {\n                    console.log(stack);\n                }\n            }, 3000);\n        }\n        setParent(child, parent) {\n            if (child && child !== Disposable.None) {\n                try {\n                    child[__is_disposable_tracked__] = true;\n                }\n                catch {\n                    // noop\n                }\n            }\n        }\n        markAsDisposed(disposable) {\n            if (disposable && disposable !== Disposable.None) {\n                try {\n                    disposable[__is_disposable_tracked__] = true;\n                }\n                catch {\n                    // noop\n                }\n            }\n        }\n        markAsSingleton(disposable) { }\n    });\n}\nexport function trackDisposable(x) {\n    disposableTracker?.trackDisposable(x);\n    return x;\n}\nexport function markAsDisposed(disposable) {\n    disposableTracker?.markAsDisposed(disposable);\n}\nfunction setParentOfDisposable(child, parent) {\n    disposableTracker?.setParent(child, parent);\n}\nfunction setParentOfDisposables(children, parent) {\n    if (!disposableTracker) {\n        return;\n    }\n    for (const child of children) {\n        disposableTracker.setParent(child, parent);\n    }\n}\n/**\n * Indicates that the given object is a singleton which does not need to be disposed.\n*/\nexport function markAsSingleton(singleton) {\n    disposableTracker?.markAsSingleton(singleton);\n    return singleton;\n}\n/**\n * Check if `thing` is {@link IDisposable disposable}.\n */\nexport function isDisposable(thing) {\n    return typeof thing === 'object' && thing !== null && typeof thing.dispose === 'function' && thing.dispose.length === 0;\n}\nexport function dispose(arg) {\n    if (Iterable.is(arg)) {\n        const errors = [];\n        for (const d of arg) {\n            if (d) {\n                try {\n                    d.dispose();\n                }\n                catch (e) {\n                    errors.push(e);\n                }\n            }\n        }\n        if (errors.length === 1) {\n            throw errors[0];\n        }\n        else if (errors.length > 1) {\n            throw new AggregateError(errors, 'Encountered errors while disposing of store');\n        }\n        return Array.isArray(arg) ? [] : arg;\n    }\n    else if (arg) {\n        arg.dispose();\n        return arg;\n    }\n}\n/**\n * Combine multiple disposable values into a single {@link IDisposable}.\n */\nexport function combinedDisposable(...disposables) {\n    const parent = toDisposable(() => dispose(disposables));\n    setParentOfDisposables(disposables, parent);\n    return parent;\n}\n/**\n * Turn a function that implements dispose into an {@link IDisposable}.\n *\n * @param fn Clean up function, guaranteed to be called only **once**.\n */\nexport function toDisposable(fn) {\n    const self = trackDisposable({\n        dispose: createSingleCallFunction(() => {\n            markAsDisposed(self);\n            fn();\n        })\n    });\n    return self;\n}\n/**\n * Manages a collection of disposable values.\n *\n * This is the preferred way to manage multiple disposables. A `DisposableStore` is safer to work with than an\n * `IDisposable[]` as it considers edge cases, such as registering the same value multiple times or adding an item to a\n * store that has already been disposed of.\n */\nexport class DisposableStore {\n    static { this.DISABLE_DISPOSED_WARNING = false; }\n    constructor() {\n        this._toDispose = new Set();\n        this._isDisposed = false;\n        trackDisposable(this);\n    }\n    /**\n     * Dispose of all registered disposables and mark this object as disposed.\n     *\n     * Any future disposables added to this object will be disposed of on `add`.\n     */\n    dispose() {\n        if (this._isDisposed) {\n            return;\n        }\n        markAsDisposed(this);\n        this._isDisposed = true;\n        this.clear();\n    }\n    /**\n     * @return `true` if this object has been disposed of.\n     */\n    get isDisposed() {\n        return this._isDisposed;\n    }\n    /**\n     * Dispose of all registered disposables but do not mark this object as disposed.\n     */\n    clear() {\n        if (this._toDispose.size === 0) {\n            return;\n        }\n        try {\n            dispose(this._toDispose);\n        }\n        finally {\n            this._toDispose.clear();\n        }\n    }\n    /**\n     * Add a new {@link IDisposable disposable} to the collection.\n     */\n    add(o) {\n        if (!o) {\n            return o;\n        }\n        if (o === this) {\n            throw new Error('Cannot register a disposable on itself!');\n        }\n        setParentOfDisposable(o, this);\n        if (this._isDisposed) {\n            if (!DisposableStore.DISABLE_DISPOSED_WARNING) {\n                console.warn(new Error('Trying to add a disposable to a DisposableStore that has already been disposed of. The added object will be leaked!').stack);\n            }\n        }\n        else {\n            this._toDispose.add(o);\n        }\n        return o;\n    }\n    /**\n     * Deletes the value from the store, but does not dispose it.\n     */\n    deleteAndLeak(o) {\n        if (!o) {\n            return;\n        }\n        if (this._toDispose.has(o)) {\n            this._toDispose.delete(o);\n            setParentOfDisposable(o, null);\n        }\n    }\n}\n/**\n * Abstract base class for a {@link IDisposable disposable} object.\n *\n * Subclasses can {@linkcode _register} disposables that will be automatically cleaned up when this object is disposed of.\n */\nexport class Disposable {\n    /**\n     * A disposable that does nothing when it is disposed of.\n     *\n     * TODO: This should not be a static property.\n     */\n    static { this.None = Object.freeze({ dispose() { } }); }\n    constructor() {\n        this._store = new DisposableStore();\n        trackDisposable(this);\n        setParentOfDisposable(this._store, this);\n    }\n    dispose() {\n        markAsDisposed(this);\n        this._store.dispose();\n    }\n    /**\n     * Adds `o` to the collection of disposables managed by this object.\n     */\n    _register(o) {\n        if (o === this) {\n            throw new Error('Cannot register a disposable on itself!');\n        }\n        return this._store.add(o);\n    }\n}\n/**\n * Manages the lifecycle of a disposable value that may be changed.\n *\n * This ensures that when the disposable value is changed, the previously held disposable is disposed of. You can\n * also register a `MutableDisposable` on a `Disposable` to ensure it is automatically cleaned up.\n */\nexport class MutableDisposable {\n    constructor() {\n        this._isDisposed = false;\n        trackDisposable(this);\n    }\n    get value() {\n        return this._isDisposed ? undefined : this._value;\n    }\n    set value(value) {\n        if (this._isDisposed || value === this._value) {\n            return;\n        }\n        this._value?.dispose();\n        if (value) {\n            setParentOfDisposable(value, this);\n        }\n        this._value = value;\n    }\n    /**\n     * Resets the stored value and disposed of the previously stored value.\n     */\n    clear() {\n        this.value = undefined;\n    }\n    dispose() {\n        this._isDisposed = true;\n        markAsDisposed(this);\n        this._value?.dispose();\n        this._value = undefined;\n    }\n}\nexport class RefCountedDisposable {\n    constructor(_disposable) {\n        this._disposable = _disposable;\n        this._counter = 1;\n    }\n    acquire() {\n        this._counter++;\n        return this;\n    }\n    release() {\n        if (--this._counter === 0) {\n            this._disposable.dispose();\n        }\n        return this;\n    }\n}\nexport class ImmortalReference {\n    constructor(object) {\n        this.object = object;\n    }\n    dispose() { }\n}\n/**\n * A map the manages the lifecycle of the values that it stores.\n */\nexport class DisposableMap {\n    constructor() {\n        this._store = new Map();\n        this._isDisposed = false;\n        trackDisposable(this);\n    }\n    /**\n     * Disposes of all stored values and mark this object as disposed.\n     *\n     * Trying to use this object after it has been disposed of is an error.\n     */\n    dispose() {\n        markAsDisposed(this);\n        this._isDisposed = true;\n        this.clearAndDisposeAll();\n    }\n    /**\n     * Disposes of all stored values and clear the map, but DO NOT mark this object as disposed.\n     */\n    clearAndDisposeAll() {\n        if (!this._store.size) {\n            return;\n        }\n        try {\n            dispose(this._store.values());\n        }\n        finally {\n            this._store.clear();\n        }\n    }\n    get(key) {\n        return this._store.get(key);\n    }\n    set(key, value, skipDisposeOnOverwrite = false) {\n        if (this._isDisposed) {\n            console.warn(new Error('Trying to add a disposable to a DisposableMap that has already been disposed of. The added object will be leaked!').stack);\n        }\n        if (!skipDisposeOnOverwrite) {\n            this._store.get(key)?.dispose();\n        }\n        this._store.set(key, value);\n    }\n    /**\n     * Delete the value stored for `key` from this map and also dispose of it.\n     */\n    deleteAndDispose(key) {\n        this._store.get(key)?.dispose();\n        this._store.delete(key);\n    }\n    [Symbol.iterator]() {\n        return this._store[Symbol.iterator]();\n    }\n}\n"],"names":[],"mappings":";;AAiDO,SAAS,gBAAgB,GAAG;AAE/B,SAAO;AACX;AAIA,SAAS,sBAAsB,OAAO,QAAQ;AAE9C;AAYO,SAAS,gBAAgB,WAAW;AAEvC,SAAO;AACX;AAIO,SAAS,aAAa,OAAO;AAChC,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,YAAY,cAAc,MAAM,QAAQ,WAAW;AAC1H;AACO,SAAS,QAAQ,KAAK;AACzB,MAAI,SAAS,GAAG,GAAG,GAAG;AAClB,UAAM,SAAS,CAAE;AACjB,eAAW,KAAK,KAAK;AACjB,UAAI,GAAG;AACH,YAAI;AACA,YAAE,QAAS;AAAA,QAC/B,SACuB,GAAG;AACN,iBAAO,KAAK,CAAC;AAAA,QACjC;AAAA,MACA;AAAA,IACA;AACQ,QAAI,OAAO,WAAW,GAAG;AACrB,YAAM,OAAO,CAAC;AAAA,IAC1B,WACiB,OAAO,SAAS,GAAG;AACxB,YAAM,IAAI,eAAe,QAAQ,6CAA6C;AAAA,IAC1F;AACQ,WAAO,MAAM,QAAQ,GAAG,IAAI,CAAE,IAAG;AAAA,EACzC,WACa,KAAK;AACV,QAAI,QAAS;AACb,WAAO;AAAA,EACf;AACA;AAIO,SAAS,sBAAsB,aAAa;AAC/C,QAAM,SAAS,aAAa,MAAM,QAAQ,WAAW,CAAC;AAEtD,SAAO;AACX;AAMO,SAAS,aAAa,IAAI;AAC7B,QAAM,OAAO,gBAAgB;AAAA,IACzB,SAAS,yBAAyB,MAAM;AAEpC,SAAI;AAAA,IACP,CAAA;AAAA,EACT,CAAK;AACD,SAAO;AACX;AAQO,MAAM,mBAAN,MAAM,iBAAgB;AAAA,EAEzB,cAAc;AACV,SAAK,aAAa,oBAAI,IAAK;AAC3B,SAAK,cAAc;AAAA,EAE3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,UAAU;AACN,QAAI,KAAK,aAAa;AAClB;AAAA,IACZ;AAEQ,SAAK,cAAc;AACnB,SAAK,MAAO;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAII,IAAI,aAAa;AACb,WAAO,KAAK;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAII,QAAQ;AACJ,QAAI,KAAK,WAAW,SAAS,GAAG;AAC5B;AAAA,IACZ;AACQ,QAAI;AACA,cAAQ,KAAK,UAAU;AAAA,IACnC,UACgB;AACJ,WAAK,WAAW,MAAO;AAAA,IACnC;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EAII,IAAI,GAAG;AACH,QAAI,CAAC,GAAG;AACJ,aAAO;AAAA,IACnB;AACQ,QAAI,MAAM,MAAM;AACZ,YAAM,IAAI,MAAM,yCAAyC;AAAA,IACrE;AAEQ,QAAI,KAAK,aAAa;AAClB,UAAI,CAAC,iBAAgB,0BAA0B;AAC3C,gBAAQ,KAAK,IAAI,MAAM,qHAAqH,EAAE,KAAK;AAAA,MACnK;AAAA,IACA,OACa;AACD,WAAK,WAAW,IAAI,CAAC;AAAA,IACjC;AACQ,WAAO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAII,cAAc,GAAG;AACb,QAAI,CAAC,GAAG;AACJ;AAAA,IACZ;AACQ,QAAI,KAAK,WAAW,IAAI,CAAC,GAAG;AACxB,WAAK,WAAW,OAAO,CAAC;AAAA,IAEpC;AAAA,EACA;AACA;AAxEa,iBAAK,2BAA2B;AADtC,IAAM,kBAAN;AA+EA,MAAM,cAAN,MAAM,YAAW;AAAA,EAOpB,cAAc;AACV,SAAK,SAAS,IAAI,gBAAiB;AAEnC,0BAAsB,KAAK,MAAY;AAAA,EAC/C;AAAA,EACI,UAAU;AAEN,SAAK,OAAO,QAAS;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAII,UAAU,GAAG;AACT,QAAI,MAAM,MAAM;AACZ,YAAM,IAAI,MAAM,yCAAyC;AAAA,IACrE;AACQ,WAAO,KAAK,OAAO,IAAI,CAAC;AAAA,EAChC;AACA;AAnBa,YAAK,OAAO,OAAO,OAAO,EAAE,UAAU;AAAG,EAAA,CAAE;AANjD,IAAM,aAAN;AAgCA,MAAM,kBAAkB;AAAA,EAC3B,cAAc;AACV,SAAK,cAAc;AAAA,EAE3B;AAAA,EACI,IAAI,QAAQ;AACR,WAAO,KAAK,cAAc,SAAY,KAAK;AAAA,EACnD;AAAA,EACI,IAAI,MAAM,OAAO;;AACb,QAAI,KAAK,eAAe,UAAU,KAAK,QAAQ;AAC3C;AAAA,IACZ;AACQ,eAAK,WAAL,mBAAa;AAIb,SAAK,SAAS;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAII,QAAQ;AACJ,SAAK,QAAQ;AAAA,EACrB;AAAA,EACI,UAAU;;AACN,SAAK,cAAc;AAEnB,eAAK,WAAL,mBAAa;AACb,SAAK,SAAS;AAAA,EACtB;AACA;AAiBO,MAAM,kBAAkB;AAAA,EAC3B,YAAY,QAAQ;AAChB,SAAK,SAAS;AAAA,EACtB;AAAA,EACI,UAAU;AAAA,EAAA;AACd;AAIO,MAAM,cAAc;AAAA,EACvB,cAAc;AACV,SAAK,SAAS,oBAAI,IAAK;AACvB,SAAK,cAAc;AAAA,EAE3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMI,UAAU;AAEN,SAAK,cAAc;AACnB,SAAK,mBAAoB;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA,EAII,qBAAqB;AACjB,QAAI,CAAC,KAAK,OAAO,MAAM;AACnB;AAAA,IACZ;AACQ,QAAI;AACA,cAAQ,KAAK,OAAO,QAAQ;AAAA,IACxC,UACgB;AACJ,WAAK,OAAO,MAAO;AAAA,IAC/B;AAAA,EACA;AAAA,EACI,IAAI,KAAK;AACL,WAAO,KAAK,OAAO,IAAI,GAAG;AAAA,EAClC;AAAA,EACI,IAAI,KAAK,OAAO,yBAAyB,OAAO;;AAC5C,QAAI,KAAK,aAAa;AAClB,cAAQ,KAAK,IAAI,MAAM,mHAAmH,EAAE,KAAK;AAAA,IAC7J;AACQ,QAAI,CAAC,wBAAwB;AACzB,iBAAK,OAAO,IAAI,GAAG,MAAnB,mBAAsB;AAAA,IAClC;AACQ,SAAK,OAAO,IAAI,KAAK,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAII,iBAAiB,KAAK;;AAClB,eAAK,OAAO,IAAI,GAAG,MAAnB,mBAAsB;AACtB,SAAK,OAAO,OAAO,GAAG;AAAA,EAC9B;AAAA,EACI,CAAC,OAAO,QAAQ,IAAI;AAChB,WAAO,KAAK,OAAO,OAAO,QAAQ,EAAG;AAAA,EAC7C;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/monaco-editor@0.52.2/node_modules/monaco-editor/esm/vs/base/common/objects.es.js

@@ -66,27 +66,6 @@ function _cloneAndChange(obj, changer, seen) {
   }
   return obj;
 }
-function mixin(destination, source, overwrite = true) {
-  if (!isObject(destination)) {
-    return source;
-  }
-  if (isObject(source)) {
-    Object.keys(source).forEach((key) => {
-      if (key in destination) {
-        if (overwrite) {
-          if (isObject(destination[key]) && isObject(source[key])) {
-            mixin(destination[key], source[key], overwrite);
-          } else {
-            destination[key] = source[key];
-          }
-        }
-      } else {
-        destination[key] = source[key];
-      }
-    });
-  }
-  return destination;
-}
 function equals(one, other) {
   if (one === other) {
     return true;
@@ -173,7 +152,6 @@ export {
   deepFreeze,
   equals,
   getAllMethodNames,
-  getAllPropertyNames,
-  mixin
+  getAllPropertyNames
 };
 //# sourceMappingURL=objects.es.js.map