mbeditor 0.1.0

data/public/min-maps/vs/base/worker/workerMain.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["out-editor/vs/base/worker/fake","out-editor/vs/base/worker/vs/loader.js","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/worker/workerMain.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/arrays.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/arraysFind.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/cache.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/color.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/diff/diffChange.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/errors.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/assert.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/functional.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/iterator.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/keyCodes.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/lazy.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/lifecycle.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/linkedList.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/map.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/stopwatch.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/event.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/cancellation.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/strings.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/hash.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/diff/diff.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/symbols.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/types.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/codiconsUtil.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/codiconsLibrary.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/codicons.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/objects.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/uint.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/characterClassifier.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/offsetRange.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/position.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/range.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/lineRange.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/selection.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/textLength.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/positionToOffset.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/textEdit.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/wordCharacterClassifier.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/core/wordHelper.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/heuristicSequenceOptimizations.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/lineSequence.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/utils.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/dynamicProgrammingDiffing.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/linesDiffComputer.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/rangeMapping.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/computeMovedLines.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/defaultLinesDiffComputer/defaultLinesDiffComputer.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/legacyLinesDiffComputer.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/diff/linesDiffComputers.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/languages/defaultDocumentColorsComputer.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/languages/linkComputer.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/languages/supports/inplaceReplaceSupport.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/model.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/model/prefixSumComputer.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/model/mirrorTextModel.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/model/textModelSearch.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/services/editorWorkerHost.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/services/findSectionHeaders.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/services/unicodeTextModelHighlighter.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/standalone/standaloneEnums.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/tokenizationRegistry.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/nls.messages.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/nls.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/platform.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/async.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/process.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/path.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/uri.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/network.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/base/common/worker/simpleWorker.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/languages.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/services/editorBaseApi.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/services/textModelSync/textModelSync.impl.ts","out-editor/vs/base/worker/file:/mnt/vss/_work/1/s/dependencies/vscode/out-editor-src/vs/editor/common/services/editorSimpleWorker.ts"],"sourcesContent":["}).call(this);","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n'use strict';\n/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n/*---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n * Please make sure to make edits in the .ts file at https://github.com/microsoft/vscode-loader/\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *--------------------------------------------------------------------------------------------*/\nconst _amdLoaderGlobal = this;\nconst _commonjsGlobal = typeof global === 'object' ? global : {};\nvar AMDLoader;\n(function (AMDLoader) {\n\tAMDLoader.global = _amdLoaderGlobal;\n\tclass Environment {\n\t\tget isWindows() {\n\t\t\tthis._detect();\n\t\t\treturn this._isWindows;\n\t\t}\n\t\tget isNode() {\n\t\t\tthis._detect();\n\t\t\treturn this._isNode;\n\t\t}\n\t\tget isElectronRenderer() {\n\t\t\tthis._detect();\n\t\t\treturn this._isElectronRenderer;\n\t\t}\n\t\tget isWebWorker() {\n\t\t\tthis._detect();\n\t\t\treturn this._isWebWorker;\n\t\t}\n\t\tget isElectronNodeIntegrationWebWorker() {\n\t\t\tthis._detect();\n\t\t\treturn this._isElectronNodeIntegrationWebWorker;\n\t\t}\n\t\tconstructor() {\n\t\t\tthis._detected = false;\n\t\t\tthis._isWindows = false;\n\t\t\tthis._isNode = false;\n\t\t\tthis._isElectronRenderer = false;\n\t\t\tthis._isWebWorker = false;\n\t\t\tthis._isElectronNodeIntegrationWebWorker = false;\n\t\t}\n\t\t_detect() {\n\t\t\tif (this._detected) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis._detected = true;\n\t\t\tthis._isWindows = Environment._isWindows();\n\t\t\tthis._isNode = (typeof module !== 'undefined' && !!module.exports);\n\t\t\tthis._isElectronRenderer = (typeof process !== 'undefined' && typeof process.versions !== 'undefined' && typeof process.versions.electron !== 'undefined' && process.type === 'renderer');\n\t\t\tthis._isWebWorker = (typeof AMDLoader.global.importScripts === 'function');\n\t\t\tthis._isElectronNodeIntegrationWebWorker = this._isWebWorker && (typeof process !== 'undefined' && typeof process.versions !== 'undefined' && typeof process.versions.electron !== 'undefined' && process.type === 'worker');\n\t\t}\n\t\tstatic _isWindows() {\n\t\t\tif (typeof navigator !== 'undefined') {\n\t\t\t\tif (navigator.userAgent && navigator.userAgent.indexOf('Windows') >= 0) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (typeof process !== 'undefined') {\n\t\t\t\treturn (process.platform === 'win32');\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t}\n\tAMDLoader.Environment = Environment;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n\tclass LoaderEvent {\n\t\tconstructor(type, detail, timestamp) {\n\t\t\tthis.type = type;\n\t\t\tthis.detail = detail;\n\t\t\tthis.timestamp = timestamp;\n\t\t}\n\t}\n\tAMDLoader.LoaderEvent = LoaderEvent;\n\tclass LoaderEventRecorder {\n\t\tconstructor(loaderAvailableTimestamp) {\n\t\t\tthis._events = [new LoaderEvent(1 /* LoaderEventType.LoaderAvailable */, '', loaderAvailableTimestamp)];\n\t\t}\n\t\trecord(type, detail) {\n\t\t\tthis._events.push(new LoaderEvent(type, detail, AMDLoader.Utilities.getHighPerformanceTimestamp()));\n\t\t}\n\t\tgetEvents() {\n\t\t\treturn this._events;\n\t\t}\n\t}\n\tAMDLoader.LoaderEventRecorder = LoaderEventRecorder;\n\tclass NullLoaderEventRecorder {\n\t\trecord(type, detail) {\n\t\t\t// Nothing to do\n\t\t}\n\t\tgetEvents() {\n\t\t\treturn [];\n\t\t}\n\t}\n\tNullLoaderEventRecorder.INSTANCE = new NullLoaderEventRecorder();\n\tAMDLoader.NullLoaderEventRecorder = NullLoaderEventRecorder;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n\tclass Utilities {\n\t\t/**\n\t\t * This method does not take care of / vs \\\n\t\t */\n\t\tstatic fileUriToFilePath(isWindows, uri) {\n\t\t\turi = decodeURI(uri).replace(/%23/g, '#');\n\t\t\tif (isWindows) {\n\t\t\t\tif (/^file:\\/\\/\\//.test(uri)) {\n\t\t\t\t\t// This is a URI without a hostname => return only the path segment\n\t\t\t\t\treturn uri.substr(8);\n\t\t\t\t}\n\t\t\t\tif (/^file:\\/\\//.test(uri)) {\n\t\t\t\t\treturn uri.substr(5);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (/^file:\\/\\//.test(uri)) {\n\t\t\t\t\treturn uri.substr(7);\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Not sure...\n\t\t\treturn uri;\n\t\t}\n\t\tstatic startsWith(haystack, needle) {\n\t\t\treturn haystack.length >= needle.length && haystack.substr(0, needle.length) === needle;\n\t\t}\n\t\tstatic endsWith(haystack, needle) {\n\t\t\treturn haystack.length >= needle.length && haystack.substr(haystack.length - needle.length) === needle;\n\t\t}\n\t\t// only check for \"?\" before \"#\" to ensure that there is a real Query-String\n\t\tstatic containsQueryString(url) {\n\t\t\treturn /^[^\\#]*\\?/gi.test(url);\n\t\t}\n\t\t/**\n\t\t * Does `url` start with http:// or https:// or file:// or / ?\n\t\t */\n\t\tstatic isAbsolutePath(url) {\n\t\t\treturn /^((http:\\/\\/)|(https:\\/\\/)|(file:\\/\\/)|(\\/))/.test(url);\n\t\t}\n\t\tstatic forEachProperty(obj, callback) {\n\t\t\tif (obj) {\n\t\t\t\tlet key;\n\t\t\t\tfor (key in obj) {\n\t\t\t\t\tif (obj.hasOwnProperty(key)) {\n\t\t\t\t\t\tcallback(key, obj[key]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstatic isEmpty(obj) {\n\t\t\tlet isEmpty = true;\n\t\t\tUtilities.forEachProperty(obj, () => {\n\t\t\t\tisEmpty = false;\n\t\t\t});\n\t\t\treturn isEmpty;\n\t\t}\n\t\tstatic recursiveClone(obj) {\n\t\t\tif (!obj || typeof obj !== 'object' || obj instanceof RegExp) {\n\t\t\t\treturn obj;\n\t\t\t}\n\t\t\tif (!Array.isArray(obj) && Object.getPrototypeOf(obj) !== Object.prototype) {\n\t\t\t\t// only clone \"simple\" objects\n\t\t\t\treturn obj;\n\t\t\t}\n\t\t\tlet result = Array.isArray(obj) ? [] : {};\n\t\t\tUtilities.forEachProperty(obj, (key, value) => {\n\t\t\t\tif (value && typeof value === 'object') {\n\t\t\t\t\tresult[key] = Utilities.recursiveClone(value);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tresult[key] = value;\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn result;\n\t\t}\n\t\tstatic generateAnonymousModule() {\n\t\t\treturn '===anonymous' + (Utilities.NEXT_ANONYMOUS_ID++) + '===';\n\t\t}\n\t\tstatic isAnonymousModule(id) {\n\t\t\treturn Utilities.startsWith(id, '===anonymous');\n\t\t}\n\t\tstatic getHighPerformanceTimestamp() {\n\t\t\tif (!this.PERFORMANCE_NOW_PROBED) {\n\t\t\t\tthis.PERFORMANCE_NOW_PROBED = true;\n\t\t\t\tthis.HAS_PERFORMANCE_NOW = (AMDLoader.global.performance && typeof AMDLoader.global.performance.now === 'function');\n\t\t\t}\n\t\t\treturn (this.HAS_PERFORMANCE_NOW ? AMDLoader.global.performance.now() : Date.now());\n\t\t}\n\t}\n\tUtilities.NEXT_ANONYMOUS_ID = 1;\n\tUtilities.PERFORMANCE_NOW_PROBED = false;\n\tUtilities.HAS_PERFORMANCE_NOW = false;\n\tAMDLoader.Utilities = Utilities;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n\tfunction ensureError(err) {\n\t\tif (err instanceof Error) {\n\t\t\treturn err;\n\t\t}\n\t\tconst result = new Error(err.message || String(err) || 'Unknown Error');\n\t\tif (err.stack) {\n\t\t\tresult.stack = err.stack;\n\t\t}\n\t\treturn result;\n\t}\n\tAMDLoader.ensureError = ensureError;\n\t;\n\tclass ConfigurationOptionsUtil {\n\t\t/**\n\t\t * Ensure configuration options make sense\n\t\t */\n\t\tstatic validateConfigurationOptions(options) {\n\t\t\tfunction defaultOnError(err) {\n\t\t\t\tif (err.phase === 'loading') {\n\t\t\t\t\tconsole.error('Loading \"' + err.moduleId + '\" failed');\n\t\t\t\t\tconsole.error(err);\n\t\t\t\t\tconsole.error('Here are the modules that depend on it:');\n\t\t\t\t\tconsole.error(err.neededBy);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (err.phase === 'factory') {\n\t\t\t\t\tconsole.error('The factory function of \"' + err.moduleId + '\" has thrown an exception');\n\t\t\t\t\tconsole.error(err);\n\t\t\t\t\tconsole.error('Here are the modules that depend on it:');\n\t\t\t\t\tconsole.error(err.neededBy);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\toptions = options || {};\n\t\t\tif (typeof options.baseUrl !== 'string') {\n\t\t\t\toptions.baseUrl = '';\n\t\t\t}\n\t\t\tif (typeof options.isBuild !== 'boolean') {\n\t\t\t\toptions.isBuild = false;\n\t\t\t}\n\t\t\tif (typeof options.paths !== 'object') {\n\t\t\t\toptions.paths = {};\n\t\t\t}\n\t\t\tif (typeof options.config !== 'object') {\n\t\t\t\toptions.config = {};\n\t\t\t}\n\t\t\tif (typeof options.catchError === 'undefined') {\n\t\t\t\toptions.catchError = false;\n\t\t\t}\n\t\t\tif (typeof options.recordStats === 'undefined') {\n\t\t\t\toptions.recordStats = false;\n\t\t\t}\n\t\t\tif (typeof options.urlArgs !== 'string') {\n\t\t\t\toptions.urlArgs = '';\n\t\t\t}\n\t\t\tif (typeof options.onError !== 'function') {\n\t\t\t\toptions.onError = defaultOnError;\n\t\t\t}\n\t\t\tif (!Array.isArray(options.ignoreDuplicateModules)) {\n\t\t\t\toptions.ignoreDuplicateModules = [];\n\t\t\t}\n\t\t\tif (options.baseUrl.length > 0) {\n\t\t\t\tif (!AMDLoader.Utilities.endsWith(options.baseUrl, '/')) {\n\t\t\t\t\toptions.baseUrl += '/';\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (typeof options.cspNonce !== 'string') {\n\t\t\t\toptions.cspNonce = '';\n\t\t\t}\n\t\t\tif (typeof options.preferScriptTags === 'undefined') {\n\t\t\t\toptions.preferScriptTags = false;\n\t\t\t}\n\t\t\tif (options.nodeCachedData && typeof options.nodeCachedData === 'object') {\n\t\t\t\tif (typeof options.nodeCachedData.seed !== 'string') {\n\t\t\t\t\toptions.nodeCachedData.seed = 'seed';\n\t\t\t\t}\n\t\t\t\tif (typeof options.nodeCachedData.writeDelay !== 'number' || options.nodeCachedData.writeDelay < 0) {\n\t\t\t\t\toptions.nodeCachedData.writeDelay = 1000 * 7;\n\t\t\t\t}\n\t\t\t\tif (!options.nodeCachedData.path || typeof options.nodeCachedData.path !== 'string') {\n\t\t\t\t\tconst err = ensureError(new Error('INVALID cached data configuration, \\'path\\' MUST be set'));\n\t\t\t\t\terr.phase = 'configuration';\n\t\t\t\t\toptions.onError(err);\n\t\t\t\t\toptions.nodeCachedData = undefined;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn options;\n\t\t}\n\t\tstatic mergeConfigurationOptions(overwrite = null, base = null) {\n\t\t\tlet result = AMDLoader.Utilities.recursiveClone(base || {});\n\t\t\t// Merge known properties and overwrite the unknown ones\n\t\t\tAMDLoader.Utilities.forEachProperty(overwrite, (key, value) => {\n\t\t\t\tif (key === 'ignoreDuplicateModules' && typeof result.ignoreDuplicateModules !== 'undefined') {\n\t\t\t\t\tresult.ignoreDuplicateModules = result.ignoreDuplicateModules.concat(value);\n\t\t\t\t}\n\t\t\t\telse if (key === 'paths' && typeof result.paths !== 'undefined') {\n\t\t\t\t\tAMDLoader.Utilities.forEachProperty(value, (key2, value2) => result.paths[key2] = value2);\n\t\t\t\t}\n\t\t\t\telse if (key === 'config' && typeof result.config !== 'undefined') {\n\t\t\t\t\tAMDLoader.Utilities.forEachProperty(value, (key2, value2) => result.config[key2] = value2);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tresult[key] = AMDLoader.Utilities.recursiveClone(value);\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn ConfigurationOptionsUtil.validateConfigurationOptions(result);\n\t\t}\n\t}\n\tAMDLoader.ConfigurationOptionsUtil = ConfigurationOptionsUtil;\n\tclass Configuration {\n\t\tconstructor(env, options) {\n\t\t\tthis._env = env;\n\t\t\tthis.options = ConfigurationOptionsUtil.mergeConfigurationOptions(options);\n\t\t\tthis._createIgnoreDuplicateModulesMap();\n\t\t\tthis._createSortedPathsRules();\n\t\t\tif (this.options.baseUrl === '') {\n\t\t\t\tif (this.options.nodeRequire && this.options.nodeRequire.main && this.options.nodeRequire.main.filename && this._env.isNode) {\n\t\t\t\t\tlet nodeMain = this.options.nodeRequire.main.filename;\n\t\t\t\t\tlet dirnameIndex = Math.max(nodeMain.lastIndexOf('/'), nodeMain.lastIndexOf('\\\\'));\n\t\t\t\t\tthis.options.baseUrl = nodeMain.substring(0, dirnameIndex + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t_createIgnoreDuplicateModulesMap() {\n\t\t\t// Build a map out of the ignoreDuplicateModules array\n\t\t\tthis.ignoreDuplicateModulesMap = {};\n\t\t\tfor (let i = 0; i < this.options.ignoreDuplicateModules.length; i++) {\n\t\t\t\tthis.ignoreDuplicateModulesMap[this.options.ignoreDuplicateModules[i]] = true;\n\t\t\t}\n\t\t}\n\t\t_createSortedPathsRules() {\n\t\t\t// Create an array our of the paths rules, sorted descending by length to\n\t\t\t// result in a more specific -> less specific order\n\t\t\tthis.sortedPathsRules = [];\n\t\t\tAMDLoader.Utilities.forEachProperty(this.options.paths, (from, to) => {\n\t\t\t\tif (!Array.isArray(to)) {\n\t\t\t\t\tthis.sortedPathsRules.push({\n\t\t\t\t\t\tfrom: from,\n\t\t\t\t\t\tto: [to]\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthis.sortedPathsRules.push({\n\t\t\t\t\t\tfrom: from,\n\t\t\t\t\t\tto: to\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\t\t\tthis.sortedPathsRules.sort((a, b) => {\n\t\t\t\treturn b.from.length - a.from.length;\n\t\t\t});\n\t\t}\n\t\t/**\n\t\t * Clone current configuration and overwrite options selectively.\n\t\t * @param options The selective options to overwrite with.\n\t\t * @result A new configuration\n\t\t */\n\t\tcloneAndMerge(options) {\n\t\t\treturn new Configuration(this._env, ConfigurationOptionsUtil.mergeConfigurationOptions(options, this.options));\n\t\t}\n\t\t/**\n\t\t * Get current options bag. Useful for passing it forward to plugins.\n\t\t */\n\t\tgetOptionsLiteral() {\n\t\t\treturn this.options;\n\t\t}\n\t\t_applyPaths(moduleId) {\n\t\t\tlet pathRule;\n\t\t\tfor (let i = 0, len = this.sortedPathsRules.length; i < len; i++) {\n\t\t\t\tpathRule = this.sortedPathsRules[i];\n\t\t\t\tif (AMDLoader.Utilities.startsWith(moduleId, pathRule.from)) {\n\t\t\t\t\tlet result = [];\n\t\t\t\t\tfor (let j = 0, lenJ = pathRule.to.length; j < lenJ; j++) {\n\t\t\t\t\t\tresult.push(pathRule.to[j] + moduleId.substr(pathRule.from.length));\n\t\t\t\t\t}\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn [moduleId];\n\t\t}\n\t\t_addUrlArgsToUrl(url) {\n\t\t\tif (AMDLoader.Utilities.containsQueryString(url)) {\n\t\t\t\treturn url + '&' + this.options.urlArgs;\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn url + '?' + this.options.urlArgs;\n\t\t\t}\n\t\t}\n\t\t_addUrlArgsIfNecessaryToUrl(url) {\n\t\t\tif (this.options.urlArgs) {\n\t\t\t\treturn this._addUrlArgsToUrl(url);\n\t\t\t}\n\t\t\treturn url;\n\t\t}\n\t\t_addUrlArgsIfNecessaryToUrls(urls) {\n\t\t\tif (this.options.urlArgs) {\n\t\t\t\tfor (let i = 0, len = urls.length; i < len; i++) {\n\t\t\t\t\turls[i] = this._addUrlArgsToUrl(urls[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn urls;\n\t\t}\n\t\t/**\n\t\t * Transform a module id to a location. Appends .js to module ids\n\t\t */\n\t\tmoduleIdToPaths(moduleId) {\n\t\t\tif (this._env.isNode) {\n\t\t\t\tconst isNodeModule = (this.options.amdModulesPattern instanceof RegExp\n\t\t\t\t\t&& !this.options.amdModulesPattern.test(moduleId));\n\t\t\t\tif (isNodeModule) {\n\t\t\t\t\t// This is a node module...\n\t\t\t\t\tif (this.isBuild()) {\n\t\t\t\t\t\t// ...and we are at build time, drop it\n\t\t\t\t\t\treturn ['empty:'];\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\t// ...and at runtime we create a `shortcut`-path\n\t\t\t\t\t\treturn ['node|' + moduleId];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet result = moduleId;\n\t\t\tlet results;\n\t\t\tif (!AMDLoader.Utilities.endsWith(result, '.js') && !AMDLoader.Utilities.isAbsolutePath(result)) {\n\t\t\t\tresults = this._applyPaths(result);\n\t\t\t\tfor (let i = 0, len = results.length; i < len; i++) {\n\t\t\t\t\tif (this.isBuild() && results[i] === 'empty:') {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (!AMDLoader.Utilities.isAbsolutePath(results[i])) {\n\t\t\t\t\t\tresults[i] = this.options.baseUrl + results[i];\n\t\t\t\t\t}\n\t\t\t\t\tif (!AMDLoader.Utilities.endsWith(results[i], '.js') && !AMDLoader.Utilities.containsQueryString(results[i])) {\n\t\t\t\t\t\tresults[i] = results[i] + '.js';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (!AMDLoader.Utilities.endsWith(result, '.js') && !AMDLoader.Utilities.containsQueryString(result)) {\n\t\t\t\t\tresult = result + '.js';\n\t\t\t\t}\n\t\t\t\tresults = [result];\n\t\t\t}\n\t\t\treturn this._addUrlArgsIfNecessaryToUrls(results);\n\t\t}\n\t\t/**\n\t\t * Transform a module id or url to a location.\n\t\t */\n\t\trequireToUrl(url) {\n\t\t\tlet result = url;\n\t\t\tif (!AMDLoader.Utilities.isAbsolutePath(result)) {\n\t\t\t\tresult = this._applyPaths(result)[0];\n\t\t\t\tif (!AMDLoader.Utilities.isAbsolutePath(result)) {\n\t\t\t\t\tresult = this.options.baseUrl + result;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn this._addUrlArgsIfNecessaryToUrl(result);\n\t\t}\n\t\t/**\n\t\t * Flag to indicate if current execution is as part of a build.\n\t\t */\n\t\tisBuild() {\n\t\t\treturn this.options.isBuild;\n\t\t}\n\t\tshouldInvokeFactory(strModuleId) {\n\t\t\tif (!this.options.isBuild) {\n\t\t\t\t// outside of a build, all factories should be invoked\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t// during a build, only explicitly marked or anonymous modules get their factories invoked\n\t\t\tif (AMDLoader.Utilities.isAnonymousModule(strModuleId)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif (this.options.buildForceInvokeFactory && this.options.buildForceInvokeFactory[strModuleId]) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\t/**\n\t\t * Test if module `moduleId` is expected to be defined multiple times\n\t\t */\n\t\tisDuplicateMessageIgnoredFor(moduleId) {\n\t\t\treturn this.ignoreDuplicateModulesMap.hasOwnProperty(moduleId);\n\t\t}\n\t\t/**\n\t\t * Get the configuration settings for the provided module id\n\t\t */\n\t\tgetConfigForModule(moduleId) {\n\t\t\tif (this.options.config) {\n\t\t\t\treturn this.options.config[moduleId];\n\t\t\t}\n\t\t}\n\t\t/**\n\t\t * Should errors be caught when executing module factories?\n\t\t */\n\t\tshouldCatchError() {\n\t\t\treturn this.options.catchError;\n\t\t}\n\t\t/**\n\t\t * Should statistics be recorded?\n\t\t */\n\t\tshouldRecordStats() {\n\t\t\treturn this.options.recordStats;\n\t\t}\n\t\t/**\n\t\t * Forward an error to the error handler.\n\t\t */\n\t\tonError(err) {\n\t\t\tthis.options.onError(err);\n\t\t}\n\t}\n\tAMDLoader.Configuration = Configuration;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n\t/**\n\t * Load `scriptSrc` only once (avoid multiple <script> tags)\n\t */\n\tclass OnlyOnceScriptLoader {\n\t\tconstructor(env) {\n\t\t\tthis._env = env;\n\t\t\tthis._scriptLoader = null;\n\t\t\tthis._callbackMap = {};\n\t\t}\n\t\tload(moduleManager, scriptSrc, callback, errorback) {\n\t\t\tif (!this._scriptLoader) {\n\t\t\t\tif (this._env.isWebWorker) {\n\t\t\t\t\tthis._scriptLoader = new WorkerScriptLoader();\n\t\t\t\t}\n\t\t\t\telse if (this._env.isElectronRenderer) {\n\t\t\t\t\tconst { preferScriptTags } = moduleManager.getConfig().getOptionsLiteral();\n\t\t\t\t\tif (preferScriptTags) {\n\t\t\t\t\t\tthis._scriptLoader = new BrowserScriptLoader();\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tthis._scriptLoader = new NodeScriptLoader(this._env);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (this._env.isNode) {\n\t\t\t\t\tthis._scriptLoader = new NodeScriptLoader(this._env);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthis._scriptLoader = new BrowserScriptLoader();\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet scriptCallbacks = {\n\t\t\t\tcallback: callback,\n\t\t\t\terrorback: errorback\n\t\t\t};\n\t\t\tif (this._callbackMap.hasOwnProperty(scriptSrc)) {\n\t\t\t\tthis._callbackMap[scriptSrc].push(scriptCallbacks);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis._callbackMap[scriptSrc] = [scriptCallbacks];\n\t\t\tthis._scriptLoader.load(moduleManager, scriptSrc, () => this.triggerCallback(scriptSrc), (err) => this.triggerErrorback(scriptSrc, err));\n\t\t}\n\t\ttriggerCallback(scriptSrc) {\n\t\t\tlet scriptCallbacks = this._callbackMap[scriptSrc];\n\t\t\tdelete this._callbackMap[scriptSrc];\n\t\t\tfor (let i = 0; i < scriptCallbacks.length; i++) {\n\t\t\t\tscriptCallbacks[i].callback();\n\t\t\t}\n\t\t}\n\t\ttriggerErrorback(scriptSrc, err) {\n\t\t\tlet scriptCallbacks = this._callbackMap[scriptSrc];\n\t\t\tdelete this._callbackMap[scriptSrc];\n\t\t\tfor (let i = 0; i < scriptCallbacks.length; i++) {\n\t\t\t\tscriptCallbacks[i].errorback(err);\n\t\t\t}\n\t\t}\n\t}\n\tclass BrowserScriptLoader {\n\t\t/**\n\t\t * Attach load / error listeners to a script element and remove them when either one has fired.\n\t\t * Implemented for browsers supporting HTML5 standard 'load' and 'error' events.\n\t\t */\n\t\tattachListeners(script, callback, errorback) {\n\t\t\tlet unbind = () => {\n\t\t\t\tscript.removeEventListener('load', loadEventListener);\n\t\t\t\tscript.removeEventListener('error', errorEventListener);\n\t\t\t};\n\t\t\tlet loadEventListener = (e) => {\n\t\t\t\tunbind();\n\t\t\t\tcallback();\n\t\t\t};\n\t\t\tlet errorEventListener = (e) => {\n\t\t\t\tunbind();\n\t\t\t\terrorback(e);\n\t\t\t};\n\t\t\tscript.addEventListener('load', loadEventListener);\n\t\t\tscript.addEventListener('error', errorEventListener);\n\t\t}\n\t\tload(moduleManager, scriptSrc, callback, errorback) {\n\t\t\tif (/^node\\|/.test(scriptSrc)) {\n\t\t\t\tlet opts = moduleManager.getConfig().getOptionsLiteral();\n\t\t\t\tlet nodeRequire = ensureRecordedNodeRequire(moduleManager.getRecorder(), (opts.nodeRequire || AMDLoader.global.nodeRequire));\n\t\t\t\tlet pieces = scriptSrc.split('|');\n\t\t\t\tlet moduleExports = null;\n\t\t\t\ttry {\n\t\t\t\t\tmoduleExports = nodeRequire(pieces[1]);\n\t\t\t\t}\n\t\t\t\tcatch (err) {\n\t\t\t\t\terrorback(err);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tmoduleManager.enqueueDefineAnonymousModule([], () => moduleExports);\n\t\t\t\tcallback();\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlet script = document.createElement('script');\n\t\t\t\tscript.setAttribute('async', 'async');\n\t\t\t\tscript.setAttribute('type', 'text/javascript');\n\t\t\t\tthis.attachListeners(script, callback, errorback);\n\t\t\t\tconst { trustedTypesPolicy } = moduleManager.getConfig().getOptionsLiteral();\n\t\t\t\tif (trustedTypesPolicy) {\n\t\t\t\t\tscriptSrc = trustedTypesPolicy.createScriptURL(scriptSrc);\n\t\t\t\t}\n\t\t\t\tscript.setAttribute('src', scriptSrc);\n\t\t\t\t// Propagate CSP nonce to dynamically created script tag.\n\t\t\t\tconst { cspNonce } = moduleManager.getConfig().getOptionsLiteral();\n\t\t\t\tif (cspNonce) {\n\t\t\t\t\tscript.setAttribute('nonce', cspNonce);\n\t\t\t\t}\n\t\t\t\tdocument.getElementsByTagName('head')[0].appendChild(script);\n\t\t\t}\n\t\t}\n\t}\n\tfunction canUseEval(moduleManager) {\n\t\tconst { trustedTypesPolicy } = moduleManager.getConfig().getOptionsLiteral();\n\t\ttry {\n\t\t\tconst func = (trustedTypesPolicy\n\t\t\t\t? self.eval(trustedTypesPolicy.createScript('', 'true')) // CodeQL [SM01632] the loader is responsible with loading code, fetch + eval is used on the web worker instead of importScripts if possible because importScripts is synchronous and we observed deadlocks on Safari\n\t\t\t\t: new Function('true') // CodeQL [SM01632] the loader is responsible with loading code, fetch + eval is used on the web worker instead of importScripts if possible because importScripts is synchronous and we observed deadlocks on Safari\n\t\t\t);\n\t\t\tfunc.call(self);\n\t\t\treturn true;\n\t\t}\n\t\tcatch (err) {\n\t\t\treturn false;\n\t\t}\n\t}\n\tclass WorkerScriptLoader {\n\t\tconstructor() {\n\t\t\tthis._cachedCanUseEval = null;\n\t\t}\n\t\t_canUseEval(moduleManager) {\n\t\t\tif (this._cachedCanUseEval === null) {\n\t\t\t\tthis._cachedCanUseEval = canUseEval(moduleManager);\n\t\t\t}\n\t\t\treturn this._cachedCanUseEval;\n\t\t}\n\t\tload(moduleManager, scriptSrc, callback, errorback) {\n\t\t\tif (/^node\\|/.test(scriptSrc)) {\n\t\t\t\tconst opts = moduleManager.getConfig().getOptionsLiteral();\n\t\t\t\tconst nodeRequire = ensureRecordedNodeRequire(moduleManager.getRecorder(), (opts.nodeRequire || AMDLoader.global.nodeRequire));\n\t\t\t\tconst pieces = scriptSrc.split('|');\n\t\t\t\tlet moduleExports = null;\n\t\t\t\ttry {\n\t\t\t\t\tmoduleExports = nodeRequire(pieces[1]);\n\t\t\t\t}\n\t\t\t\tcatch (err) {\n\t\t\t\t\terrorback(err);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tmoduleManager.enqueueDefineAnonymousModule([], function () { return moduleExports; });\n\t\t\t\tcallback();\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst { trustedTypesPolicy } = moduleManager.getConfig().getOptionsLiteral();\n\t\t\t\tconst isCrossOrigin = (/^((http:)|(https:)|(file:))/.test(scriptSrc) && scriptSrc.substring(0, self.origin.length) !== self.origin);\n\t\t\t\tif (!isCrossOrigin && this._canUseEval(moduleManager)) {\n\t\t\t\t\t// use `fetch` if possible because `importScripts`\n\t\t\t\t\t// is synchronous and can lead to deadlocks on Safari\n\t\t\t\t\tfetch(scriptSrc).then((response) => {\n\t\t\t\t\t\tif (response.status !== 200) {\n\t\t\t\t\t\t\tthrow new Error(response.statusText);\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn response.text();\n\t\t\t\t\t}).then((text) => {\n\t\t\t\t\t\ttext = `${text}\\n//# sourceURL=${scriptSrc}`;\n\t\t\t\t\t\tconst func = (trustedTypesPolicy\n\t\t\t\t\t\t\t? self.eval(trustedTypesPolicy.createScript('', text)) // CodeQL [SM01632] the loader is responsible with loading code, fetch + eval is used on the web worker instead of importScripts if possible because importScripts is synchronous and we observed deadlocks on Safari\n\t\t\t\t\t\t\t: new Function(text) // CodeQL [SM01632] the loader is responsible with loading code, fetch + eval is used on the web worker instead of importScripts if possible because importScripts is synchronous and we observed deadlocks on Safari\n\t\t\t\t\t\t);\n\t\t\t\t\t\tfunc.call(self);\n\t\t\t\t\t\tcallback();\n\t\t\t\t\t}).then(undefined, errorback);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\ttry {\n\t\t\t\t\tif (trustedTypesPolicy) {\n\t\t\t\t\t\tscriptSrc = trustedTypesPolicy.createScriptURL(scriptSrc);\n\t\t\t\t\t}\n\t\t\t\t\timportScripts(scriptSrc);\n\t\t\t\t\tcallback();\n\t\t\t\t}\n\t\t\t\tcatch (e) {\n\t\t\t\t\terrorback(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tclass NodeScriptLoader {\n\t\tconstructor(env) {\n\t\t\tthis._env = env;\n\t\t\tthis._didInitialize = false;\n\t\t\tthis._didPatchNodeRequire = false;\n\t\t}\n\t\t_init(nodeRequire) {\n\t\t\tif (this._didInitialize) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis._didInitialize = true;\n\t\t\t// capture node modules\n\t\t\tthis._fs = nodeRequire('fs');\n\t\t\tthis._vm = nodeRequire('vm');\n\t\t\tthis._path = nodeRequire('path');\n\t\t\tthis._crypto = nodeRequire('crypto');\n\t\t}\n\t\t// patch require-function of nodejs such that we can manually create a script\n\t\t// from cached data. this is done by overriding the `Module._compile` function\n\t\t_initNodeRequire(nodeRequire, moduleManager) {\n\t\t\t// It is important to check for `nodeCachedData` first and then set `_didPatchNodeRequire`.\n\t\t\t// That's because `nodeCachedData` is set _after_ calling this for the first time...\n\t\t\tconst { nodeCachedData } = moduleManager.getConfig().getOptionsLiteral();\n\t\t\tif (!nodeCachedData) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (this._didPatchNodeRequire) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis._didPatchNodeRequire = true;\n\t\t\tconst that = this;\n\t\t\tconst Module = nodeRequire('module');\n\t\t\tfunction makeRequireFunction(mod) {\n\t\t\t\tconst Module = mod.constructor;\n\t\t\t\tlet require = function require(path) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\treturn mod.require(path);\n\t\t\t\t\t}\n\t\t\t\t\tfinally {\n\t\t\t\t\t\t// nothing\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\trequire.resolve = function resolve(request, options) {\n\t\t\t\t\treturn Module._resolveFilename(request, mod, false, options);\n\t\t\t\t};\n\t\t\t\trequire.resolve.paths = function paths(request) {\n\t\t\t\t\treturn Module._resolveLookupPaths(request, mod);\n\t\t\t\t};\n\t\t\t\trequire.main = process.mainModule;\n\t\t\t\trequire.extensions = Module._extensions;\n\t\t\t\trequire.cache = Module._cache;\n\t\t\t\treturn require;\n\t\t\t}\n\t\t\tModule.prototype._compile = function (content, filename) {\n\t\t\t\t// remove shebang and create wrapper function\n\t\t\t\tconst scriptSource = Module.wrap(content.replace(/^#!.*/, ''));\n\t\t\t\t// create script\n\t\t\t\tconst recorder = moduleManager.getRecorder();\n\t\t\t\tconst cachedDataPath = that._getCachedDataPath(nodeCachedData, filename);\n\t\t\t\tconst options = { filename };\n\t\t\t\tlet hashData;\n\t\t\t\ttry {\n\t\t\t\t\tconst data = that._fs.readFileSync(cachedDataPath);\n\t\t\t\t\thashData = data.slice(0, 16);\n\t\t\t\t\toptions.cachedData = data.slice(16);\n\t\t\t\t\trecorder.record(60 /* LoaderEventType.CachedDataFound */, cachedDataPath);\n\t\t\t\t}\n\t\t\t\tcatch (_e) {\n\t\t\t\t\trecorder.record(61 /* LoaderEventType.CachedDataMissed */, cachedDataPath);\n\t\t\t\t}\n\t\t\t\tconst script = new that._vm.Script(scriptSource, options);\n\t\t\t\tconst compileWrapper = script.runInThisContext(options);\n\t\t\t\t// run script\n\t\t\t\tconst dirname = that._path.dirname(filename);\n\t\t\t\tconst require = makeRequireFunction(this);\n\t\t\t\tconst args = [this.exports, require, this, filename, dirname, process, _commonjsGlobal, Buffer];\n\t\t\t\tconst result = compileWrapper.apply(this.exports, args);\n\t\t\t\t// cached data aftermath\n\t\t\t\tthat._handleCachedData(script, scriptSource, cachedDataPath, !options.cachedData, moduleManager);\n\t\t\t\tthat._verifyCachedData(script, scriptSource, cachedDataPath, hashData, moduleManager);\n\t\t\t\treturn result;\n\t\t\t};\n\t\t}\n\t\tload(moduleManager, scriptSrc, callback, errorback) {\n\t\t\tconst opts = moduleManager.getConfig().getOptionsLiteral();\n\t\t\tconst nodeRequire = ensureRecordedNodeRequire(moduleManager.getRecorder(), (opts.nodeRequire || AMDLoader.global.nodeRequire));\n\t\t\tconst nodeInstrumenter = (opts.nodeInstrumenter || function (c) { return c; });\n\t\t\tthis._init(nodeRequire);\n\t\t\tthis._initNodeRequire(nodeRequire, moduleManager);\n\t\t\tlet recorder = moduleManager.getRecorder();\n\t\t\tif (/^node\\|/.test(scriptSrc)) {\n\t\t\t\tlet pieces = scriptSrc.split('|');\n\t\t\t\tlet moduleExports = null;\n\t\t\t\ttry {\n\t\t\t\t\tmoduleExports = nodeRequire(pieces[1]);\n\t\t\t\t}\n\t\t\t\tcatch (err) {\n\t\t\t\t\terrorback(err);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tmoduleManager.enqueueDefineAnonymousModule([], () => moduleExports);\n\t\t\t\tcallback();\n\t\t\t}\n\t\t\telse {\n\t\t\t\tscriptSrc = AMDLoader.Utilities.fileUriToFilePath(this._env.isWindows, scriptSrc);\n\t\t\t\tconst normalizedScriptSrc = this._path.normalize(scriptSrc);\n\t\t\t\tconst vmScriptPathOrUri = this._getElectronRendererScriptPathOrUri(normalizedScriptSrc);\n\t\t\t\tconst wantsCachedData = Boolean(opts.nodeCachedData);\n\t\t\t\tconst cachedDataPath = wantsCachedData ? this._getCachedDataPath(opts.nodeCachedData, scriptSrc) : undefined;\n\t\t\t\tthis._readSourceAndCachedData(normalizedScriptSrc, cachedDataPath, recorder, (err, data, cachedData, hashData) => {\n\t\t\t\t\tif (err) {\n\t\t\t\t\t\terrorback(err);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tlet scriptSource;\n\t\t\t\t\tif (data.charCodeAt(0) === NodeScriptLoader._BOM) {\n\t\t\t\t\t\tscriptSource = NodeScriptLoader._PREFIX + data.substring(1) + NodeScriptLoader._SUFFIX;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tscriptSource = NodeScriptLoader._PREFIX + data + NodeScriptLoader._SUFFIX;\n\t\t\t\t\t}\n\t\t\t\t\tscriptSource = nodeInstrumenter(scriptSource, normalizedScriptSrc);\n\t\t\t\t\tconst scriptOpts = { filename: vmScriptPathOrUri, cachedData };\n\t\t\t\t\tconst script = this._createAndEvalScript(moduleManager, scriptSource, scriptOpts, callback, errorback);\n\t\t\t\t\tthis._handleCachedData(script, scriptSource, cachedDataPath, wantsCachedData && !cachedData, moduleManager);\n\t\t\t\t\tthis._verifyCachedData(script, scriptSource, cachedDataPath, hashData, moduleManager);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\t_createAndEvalScript(moduleManager, contents, options, callback, errorback) {\n\t\t\tconst recorder = moduleManager.getRecorder();\n\t\t\trecorder.record(31 /* LoaderEventType.NodeBeginEvaluatingScript */, options.filename);\n\t\t\tconst script = new this._vm.Script(contents, options);\n\t\t\tconst ret = script.runInThisContext(options);\n\t\t\tconst globalDefineFunc = moduleManager.getGlobalAMDDefineFunc();\n\t\t\tlet receivedDefineCall = false;\n\t\t\tconst localDefineFunc = function () {\n\t\t\t\treceivedDefineCall = true;\n\t\t\t\treturn globalDefineFunc.apply(null, arguments);\n\t\t\t};\n\t\t\tlocalDefineFunc.amd = globalDefineFunc.amd;\n\t\t\tret.call(AMDLoader.global, moduleManager.getGlobalAMDRequireFunc(), localDefineFunc, options.filename, this._path.dirname(options.filename));\n\t\t\trecorder.record(32 /* LoaderEventType.NodeEndEvaluatingScript */, options.filename);\n\t\t\tif (receivedDefineCall) {\n\t\t\t\tcallback();\n\t\t\t}\n\t\t\telse {\n\t\t\t\terrorback(new Error(`Didn't receive define call in ${options.filename}!`));\n\t\t\t}\n\t\t\treturn script;\n\t\t}\n\t\t_getElectronRendererScriptPathOrUri(path) {\n\t\t\tif (!this._env.isElectronRenderer) {\n\t\t\t\treturn path;\n\t\t\t}\n\t\t\tlet driveLetterMatch = path.match(/^([a-z])\\:(.*)/i);\n\t\t\tif (driveLetterMatch) {\n\t\t\t\t// windows\n\t\t\t\treturn `file:///${(driveLetterMatch[1].toUpperCase() + ':' + driveLetterMatch[2]).replace(/\\\\/g, '/')}`;\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// nix\n\t\t\t\treturn `file://${path}`;\n\t\t\t}\n\t\t}\n\t\t_getCachedDataPath(config, filename) {\n\t\t\tconst hash = this._crypto.createHash('md5').update(filename, 'utf8').update(config.seed, 'utf8').update(process.arch, '').digest('hex');\n\t\t\tconst basename = this._path.basename(filename).replace(/\\.js$/, '');\n\t\t\treturn this._path.join(config.path, `${basename}-${hash}.code`);\n\t\t}\n\t\t_handleCachedData(script, scriptSource, cachedDataPath, createCachedData, moduleManager) {\n\t\t\tif (script.cachedDataRejected) {\n\t\t\t\t// cached data got rejected -> delete and re-create\n\t\t\t\tthis._fs.unlink(cachedDataPath, err => {\n\t\t\t\t\tmoduleManager.getRecorder().record(62 /* LoaderEventType.CachedDataRejected */, cachedDataPath);\n\t\t\t\t\tthis._createAndWriteCachedData(script, scriptSource, cachedDataPath, moduleManager);\n\t\t\t\t\tif (err) {\n\t\t\t\t\t\tmoduleManager.getConfig().onError(err);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t\telse if (createCachedData) {\n\t\t\t\t// no cached data, but wanted\n\t\t\t\tthis._createAndWriteCachedData(script, scriptSource, cachedDataPath, moduleManager);\n\t\t\t}\n\t\t}\n\t\t// Cached data format: | SOURCE_HASH | V8_CACHED_DATA |\n\t\t// -SOURCE_HASH is the md5 hash of the JS source (always 16 bytes)\n\t\t// -V8_CACHED_DATA is what v8 produces\n\t\t_createAndWriteCachedData(script, scriptSource, cachedDataPath, moduleManager) {\n\t\t\tlet timeout = Math.ceil(moduleManager.getConfig().getOptionsLiteral().nodeCachedData.writeDelay * (1 + Math.random()));\n\t\t\tlet lastSize = -1;\n\t\t\tlet iteration = 0;\n\t\t\tlet hashData = undefined;\n\t\t\tconst createLoop = () => {\n\t\t\t\tsetTimeout(() => {\n\t\t\t\t\tif (!hashData) {\n\t\t\t\t\t\thashData = this._crypto.createHash('md5').update(scriptSource, 'utf8').digest();\n\t\t\t\t\t}\n\t\t\t\t\tconst cachedData = script.createCachedData();\n\t\t\t\t\tif (cachedData.length === 0 || cachedData.length === lastSize || iteration >= 5) {\n\t\t\t\t\t\t// done\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (cachedData.length < lastSize) {\n\t\t\t\t\t\t// less data than before: skip, try again next round\n\t\t\t\t\t\tcreateLoop();\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tlastSize = cachedData.length;\n\t\t\t\t\tthis._fs.writeFile(cachedDataPath, Buffer.concat([hashData, cachedData]), err => {\n\t\t\t\t\t\tif (err) {\n\t\t\t\t\t\t\tmoduleManager.getConfig().onError(err);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tmoduleManager.getRecorder().record(63 /* LoaderEventType.CachedDataCreated */, cachedDataPath);\n\t\t\t\t\t\tcreateLoop();\n\t\t\t\t\t});\n\t\t\t\t}, timeout * (Math.pow(4, iteration++)));\n\t\t\t};\n\t\t\t// with some delay (`timeout`) create cached data\n\t\t\t// and repeat that (with backoff delay) until the\n\t\t\t// data seems to be not changing anymore\n\t\t\tcreateLoop();\n\t\t}\n\t\t_readSourceAndCachedData(sourcePath, cachedDataPath, recorder, callback) {\n\t\t\tif (!cachedDataPath) {\n\t\t\t\t// no cached data case\n\t\t\t\tthis._fs.readFile(sourcePath, { encoding: 'utf8' }, callback);\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// cached data case: read both files in parallel\n\t\t\t\tlet source = undefined;\n\t\t\t\tlet cachedData = undefined;\n\t\t\t\tlet hashData = undefined;\n\t\t\t\tlet steps = 2;\n\t\t\t\tconst step = (err) => {\n\t\t\t\t\tif (err) {\n\t\t\t\t\t\tcallback(err);\n\t\t\t\t\t}\n\t\t\t\t\telse if (--steps === 0) {\n\t\t\t\t\t\tcallback(undefined, source, cachedData, hashData);\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tthis._fs.readFile(sourcePath, { encoding: 'utf8' }, (err, data) => {\n\t\t\t\t\tsource = data;\n\t\t\t\t\tstep(err);\n\t\t\t\t});\n\t\t\t\tthis._fs.readFile(cachedDataPath, (err, data) => {\n\t\t\t\t\tif (!err && data && data.length > 0) {\n\t\t\t\t\t\thashData = data.slice(0, 16);\n\t\t\t\t\t\tcachedData = data.slice(16);\n\t\t\t\t\t\trecorder.record(60 /* LoaderEventType.CachedDataFound */, cachedDataPath);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\trecorder.record(61 /* LoaderEventType.CachedDataMissed */, cachedDataPath);\n\t\t\t\t\t}\n\t\t\t\t\tstep(); // ignored: cached data is optional\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\t_verifyCachedData(script, scriptSource, cachedDataPath, hashData, moduleManager) {\n\t\t\tif (!hashData) {\n\t\t\t\t// nothing to do\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (script.cachedDataRejected) {\n\t\t\t\t// invalid anyways\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tsetTimeout(() => {\n\t\t\t\t// check source hash - the contract is that file paths change when file content\n\t\t\t\t// change (e.g use the commit or version id as cache path). this check is\n\t\t\t\t// for violations of this contract.\n\t\t\t\tconst hashDataNow = this._crypto.createHash('md5').update(scriptSource, 'utf8').digest();\n\t\t\t\tif (!hashData.equals(hashDataNow)) {\n\t\t\t\t\tmoduleManager.getConfig().onError(new Error(`FAILED TO VERIFY CACHED DATA, deleting stale '${cachedDataPath}' now, but a RESTART IS REQUIRED`));\n\t\t\t\t\tthis._fs.unlink(cachedDataPath, err => {\n\t\t\t\t\t\tif (err) {\n\t\t\t\t\t\t\tmoduleManager.getConfig().onError(err);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}, Math.ceil(5000 * (1 + Math.random())));\n\t\t}\n\t}\n\tNodeScriptLoader._BOM = 0xFEFF;\n\tNodeScriptLoader._PREFIX = '(function (require, define, __filename, __dirname) { ';\n\tNodeScriptLoader._SUFFIX = '\\n});';\n\tfunction ensureRecordedNodeRequire(recorder, _nodeRequire) {\n\t\tif (_nodeRequire.__$__isRecorded) {\n\t\t\t// it is already recorded\n\t\t\treturn _nodeRequire;\n\t\t}\n\t\tconst nodeRequire = function nodeRequire(what) {\n\t\t\trecorder.record(33 /* LoaderEventType.NodeBeginNativeRequire */, what);\n\t\t\ttry {\n\t\t\t\treturn _nodeRequire(what);\n\t\t\t}\n\t\t\tfinally {\n\t\t\t\trecorder.record(34 /* LoaderEventType.NodeEndNativeRequire */, what);\n\t\t\t}\n\t\t};\n\t\tnodeRequire.__$__isRecorded = true;\n\t\treturn nodeRequire;\n\t}\n\tAMDLoader.ensureRecordedNodeRequire = ensureRecordedNodeRequire;\n\tfunction createScriptLoader(env) {\n\t\treturn new OnlyOnceScriptLoader(env);\n\t}\n\tAMDLoader.createScriptLoader = createScriptLoader;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n\t// ------------------------------------------------------------------------\n\t// ModuleIdResolver\n\tclass ModuleIdResolver {\n\t\tconstructor(fromModuleId) {\n\t\t\tlet lastSlash = fromModuleId.lastIndexOf('/');\n\t\t\tif (lastSlash !== -1) {\n\t\t\t\tthis.fromModulePath = fromModuleId.substr(0, lastSlash + 1);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthis.fromModulePath = '';\n\t\t\t}\n\t\t}\n\t\t/**\n\t\t * Normalize 'a/../name' to 'name', etc.\n\t\t */\n\t\tstatic _normalizeModuleId(moduleId) {\n\t\t\tlet r = moduleId, pattern;\n\t\t\t// replace /./ => /\n\t\t\tpattern = /\\/\\.\\//;\n\t\t\twhile (pattern.test(r)) {\n\t\t\t\tr = r.replace(pattern, '/');\n\t\t\t}\n\t\t\t// replace ^./ => nothing\n\t\t\tr = r.replace(/^\\.\\//g, '');\n\t\t\t// replace /aa/../ => / (BUT IGNORE /../../)\n\t\t\tpattern = /\\/(([^\\/])|([^\\/][^\\/\\.])|([^\\/\\.][^\\/])|([^\\/][^\\/][^\\/]+))\\/\\.\\.\\//;\n\t\t\twhile (pattern.test(r)) {\n\t\t\t\tr = r.replace(pattern, '/');\n\t\t\t}\n\t\t\t// replace ^aa/../ => nothing (BUT IGNORE ../../)\n\t\t\tr = r.replace(/^(([^\\/])|([^\\/][^\\/\\.])|([^\\/\\.][^\\/])|([^\\/][^\\/][^\\/]+))\\/\\.\\.\\//, '');\n\t\t\treturn r;\n\t\t}\n\t\t/**\n\t\t * Resolve relative module ids\n\t\t */\n\t\tresolveModule(moduleId) {\n\t\t\tlet result = moduleId;\n\t\t\tif (!AMDLoader.Utilities.isAbsolutePath(result)) {\n\t\t\t\tif (AMDLoader.Utilities.startsWith(result, './') || AMDLoader.Utilities.startsWith(result, '../')) {\n\t\t\t\t\tresult = ModuleIdResolver._normalizeModuleId(this.fromModulePath + result);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t}\n\tModuleIdResolver.ROOT = new ModuleIdResolver('');\n\tAMDLoader.ModuleIdResolver = ModuleIdResolver;\n\t// ------------------------------------------------------------------------\n\t// Module\n\tclass Module {\n\t\tconstructor(id, strId, dependencies, callback, errorback, moduleIdResolver) {\n\t\t\tthis.id = id;\n\t\t\tthis.strId = strId;\n\t\t\tthis.dependencies = dependencies;\n\t\t\tthis._callback = callback;\n\t\t\tthis._errorback = errorback;\n\t\t\tthis.moduleIdResolver = moduleIdResolver;\n\t\t\tthis.exports = {};\n\t\t\tthis.error = null;\n\t\t\tthis.exportsPassedIn = false;\n\t\t\tthis.unresolvedDependenciesCount = this.dependencies.length;\n\t\t\tthis._isComplete = false;\n\t\t}\n\t\tstatic _safeInvokeFunction(callback, args) {\n\t\t\ttry {\n\t\t\t\treturn {\n\t\t\t\t\treturnedValue: callback.apply(AMDLoader.global, args),\n\t\t\t\t\tproducedError: null\n\t\t\t\t};\n\t\t\t}\n\t\t\tcatch (e) {\n\t\t\t\treturn {\n\t\t\t\t\treturnedValue: null,\n\t\t\t\t\tproducedError: e\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\t\tstatic _invokeFactory(config, strModuleId, callback, dependenciesValues) {\n\t\t\tif (!config.shouldInvokeFactory(strModuleId)) {\n\t\t\t\treturn {\n\t\t\t\t\treturnedValue: null,\n\t\t\t\t\tproducedError: null\n\t\t\t\t};\n\t\t\t}\n\t\t\tif (config.shouldCatchError()) {\n\t\t\t\treturn this._safeInvokeFunction(callback, dependenciesValues);\n\t\t\t}\n\t\t\treturn {\n\t\t\t\treturnedValue: callback.apply(AMDLoader.global, dependenciesValues),\n\t\t\t\tproducedError: null\n\t\t\t};\n\t\t}\n\t\tcomplete(recorder, config, dependenciesValues, inversedependenciesProvider) {\n\t\t\tthis._isComplete = true;\n\t\t\tlet producedError = null;\n\t\t\tif (this._callback) {\n\t\t\t\tif (typeof this._callback === 'function') {\n\t\t\t\t\trecorder.record(21 /* LoaderEventType.BeginInvokeFactory */, this.strId);\n\t\t\t\t\tlet r = Module._invokeFactory(config, this.strId, this._callback, dependenciesValues);\n\t\t\t\t\tproducedError = r.producedError;\n\t\t\t\t\trecorder.record(22 /* LoaderEventType.EndInvokeFactory */, this.strId);\n\t\t\t\t\tif (!producedError && typeof r.returnedValue !== 'undefined' && (!this.exportsPassedIn || AMDLoader.Utilities.isEmpty(this.exports))) {\n\t\t\t\t\t\tthis.exports = r.returnedValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthis.exports = this._callback;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (producedError) {\n\t\t\t\tlet err = AMDLoader.ensureError(producedError);\n\t\t\t\terr.phase = 'factory';\n\t\t\t\terr.moduleId = this.strId;\n\t\t\t\terr.neededBy = inversedependenciesProvider(this.id);\n\t\t\t\tthis.error = err;\n\t\t\t\tconfig.onError(err);\n\t\t\t}\n\t\t\tthis.dependencies = null;\n\t\t\tthis._callback = null;\n\t\t\tthis._errorback = null;\n\t\t\tthis.moduleIdResolver = null;\n\t\t}\n\t\t/**\n\t\t * One of the direct dependencies or a transitive dependency has failed to load.\n\t\t */\n\t\tonDependencyError(err) {\n\t\t\tthis._isComplete = true;\n\t\t\tthis.error = err;\n\t\t\tif (this._errorback) {\n\t\t\t\tthis._errorback(err);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\t/**\n\t\t * Is the current module complete?\n\t\t */\n\t\tisComplete() {\n\t\t\treturn this._isComplete;\n\t\t}\n\t}\n\tAMDLoader.Module = Module;\n\tclass ModuleIdProvider {\n\t\tconstructor() {\n\t\t\tthis._nextId = 0;\n\t\t\tthis._strModuleIdToIntModuleId = new Map();\n\t\t\tthis._intModuleIdToStrModuleId = [];\n\t\t\t// Ensure values 0, 1, 2 are assigned accordingly with ModuleId\n\t\t\tthis.getModuleId('exports');\n\t\t\tthis.getModuleId('module');\n\t\t\tthis.getModuleId('require');\n\t\t}\n\t\tgetMaxModuleId() {\n\t\t\treturn this._nextId;\n\t\t}\n\t\tgetModuleId(strModuleId) {\n\t\t\tlet id = this._strModuleIdToIntModuleId.get(strModuleId);\n\t\t\tif (typeof id === 'undefined') {\n\t\t\t\tid = this._nextId++;\n\t\t\t\tthis._strModuleIdToIntModuleId.set(strModuleId, id);\n\t\t\t\tthis._intModuleIdToStrModuleId[id] = strModuleId;\n\t\t\t}\n\t\t\treturn id;\n\t\t}\n\t\tgetStrModuleId(moduleId) {\n\t\t\treturn this._intModuleIdToStrModuleId[moduleId];\n\t\t}\n\t}\n\tclass RegularDependency {\n\t\tconstructor(id) {\n\t\t\tthis.id = id;\n\t\t}\n\t}\n\tRegularDependency.EXPORTS = new RegularDependency(0 /* ModuleId.EXPORTS */);\n\tRegularDependency.MODULE = new RegularDependency(1 /* ModuleId.MODULE */);\n\tRegularDependency.REQUIRE = new RegularDependency(2 /* ModuleId.REQUIRE */);\n\tAMDLoader.RegularDependency = RegularDependency;\n\tclass PluginDependency {\n\t\tconstructor(id, pluginId, pluginParam) {\n\t\t\tthis.id = id;\n\t\t\tthis.pluginId = pluginId;\n\t\t\tthis.pluginParam = pluginParam;\n\t\t}\n\t}\n\tAMDLoader.PluginDependency = PluginDependency;\n\tclass ModuleManager {\n\t\tconstructor(env, scriptLoader, defineFunc, requireFunc, loaderAvailableTimestamp = 0) {\n\t\t\tthis._env = env;\n\t\t\tthis._scriptLoader = scriptLoader;\n\t\t\tthis._loaderAvailableTimestamp = loaderAvailableTimestamp;\n\t\t\tthis._defineFunc = defineFunc;\n\t\t\tthis._requireFunc = requireFunc;\n\t\t\tthis._moduleIdProvider = new ModuleIdProvider();\n\t\t\tthis._config = new AMDLoader.Configuration(this._env);\n\t\t\tthis._hasDependencyCycle = false;\n\t\t\tthis._modules2 = [];\n\t\t\tthis._knownModules2 = [];\n\t\t\tthis._inverseDependencies2 = [];\n\t\t\tthis._inversePluginDependencies2 = new Map();\n\t\t\tthis._currentAnonymousDefineCall = null;\n\t\t\tthis._recorder = null;\n\t\t\tthis._buildInfoPath = [];\n\t\t\tthis._buildInfoDefineStack = [];\n\t\t\tthis._buildInfoDependencies = [];\n\t\t\tthis._requireFunc.moduleManager = this;\n\t\t}\n\t\treset() {\n\t\t\treturn new ModuleManager(this._env, this._scriptLoader, this._defineFunc, this._requireFunc, this._loaderAvailableTimestamp);\n\t\t}\n\t\tgetGlobalAMDDefineFunc() {\n\t\t\treturn this._defineFunc;\n\t\t}\n\t\tgetGlobalAMDRequireFunc() {\n\t\t\treturn this._requireFunc;\n\t\t}\n\t\tstatic _findRelevantLocationInStack(needle, stack) {\n\t\t\tlet normalize = (str) => str.replace(/\\\\/g, '/');\n\t\t\tlet normalizedPath = normalize(needle);\n\t\t\tlet stackPieces = stack.split(/\\n/);\n\t\t\tfor (let i = 0; i < stackPieces.length; i++) {\n\t\t\t\tlet m = stackPieces[i].match(/(.*):(\\d+):(\\d+)\\)?$/);\n\t\t\t\tif (m) {\n\t\t\t\t\tlet stackPath = m[1];\n\t\t\t\t\tlet stackLine = m[2];\n\t\t\t\t\tlet stackColumn = m[3];\n\t\t\t\t\tlet trimPathOffset = Math.max(stackPath.lastIndexOf(' ') + 1, stackPath.lastIndexOf('(') + 1);\n\t\t\t\t\tstackPath = stackPath.substr(trimPathOffset);\n\t\t\t\t\tstackPath = normalize(stackPath);\n\t\t\t\t\tif (stackPath === normalizedPath) {\n\t\t\t\t\t\tlet r = {\n\t\t\t\t\t\t\tline: parseInt(stackLine, 10),\n\t\t\t\t\t\t\tcol: parseInt(stackColumn, 10)\n\t\t\t\t\t\t};\n\t\t\t\t\t\tif (r.line === 1) {\n\t\t\t\t\t\t\tr.col -= '(function (require, define, __filename, __dirname) { '.length;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn r;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tthrow new Error('Could not correlate define call site for needle ' + needle);\n\t\t}\n\t\tgetBuildInfo() {\n\t\t\tif (!this._config.isBuild()) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tlet result = [], resultLen = 0;\n\t\t\tfor (let i = 0, len = this._modules2.length; i < len; i++) {\n\t\t\t\tlet m = this._modules2[i];\n\t\t\t\tif (!m) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tlet location = this._buildInfoPath[m.id] || null;\n\t\t\t\tlet defineStack = this._buildInfoDefineStack[m.id] || null;\n\t\t\t\tlet dependencies = this._buildInfoDependencies[m.id];\n\t\t\t\tresult[resultLen++] = {\n\t\t\t\t\tid: m.strId,\n\t\t\t\t\tpath: location,\n\t\t\t\t\tdefineLocation: (location && defineStack ? ModuleManager._findRelevantLocationInStack(location, defineStack) : null),\n\t\t\t\t\tdependencies: dependencies,\n\t\t\t\t\tshim: null,\n\t\t\t\t\texports: m.exports\n\t\t\t\t};\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t\tgetRecorder() {\n\t\t\tif (!this._recorder) {\n\t\t\t\tif (this._config.shouldRecordStats()) {\n\t\t\t\t\tthis._recorder = new AMDLoader.LoaderEventRecorder(this._loaderAvailableTimestamp);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthis._recorder = AMDLoader.NullLoaderEventRecorder.INSTANCE;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn this._recorder;\n\t\t}\n\t\tgetLoaderEvents() {\n\t\t\treturn this.getRecorder().getEvents();\n\t\t}\n\t\t/**\n\t\t * Defines an anonymous module (without an id). Its name will be resolved as we receive a callback from the scriptLoader.\n\t\t * @param dependencies @see defineModule\n\t\t * @param callback @see defineModule\n\t\t */\n\t\tenqueueDefineAnonymousModule(dependencies, callback) {\n\t\t\tif (this._currentAnonymousDefineCall !== null) {\n\t\t\t\tthrow new Error('Can only have one anonymous define call per script file');\n\t\t\t}\n\t\t\tlet stack = null;\n\t\t\tif (this._config.isBuild()) {\n\t\t\t\tstack = new Error('StackLocation').stack || null;\n\t\t\t}\n\t\t\tthis._currentAnonymousDefineCall = {\n\t\t\t\tstack: stack,\n\t\t\t\tdependencies: dependencies,\n\t\t\t\tcallback: callback\n\t\t\t};\n\t\t}\n\t\t/**\n\t\t * Creates a module and stores it in _modules. The manager will immediately begin resolving its dependencies.\n\t\t * @param strModuleId An unique and absolute id of the module. This must not collide with another module's id\n\t\t * @param dependencies An array with the dependencies of the module. Special keys are: \"require\", \"exports\" and \"module\"\n\t\t * @param callback if callback is a function, it will be called with the resolved dependencies. if callback is an object, it will be considered as the exports of the module.\n\t\t */\n\t\tdefineModule(strModuleId, dependencies, callback, errorback, stack, moduleIdResolver = new ModuleIdResolver(strModuleId)) {\n\t\t\tlet moduleId = this._moduleIdProvider.getModuleId(strModuleId);\n\t\t\tif (this._modules2[moduleId]) {\n\t\t\t\tif (!this._config.isDuplicateMessageIgnoredFor(strModuleId)) {\n\t\t\t\t\tconsole.warn('Duplicate definition of module \\'' + strModuleId + '\\'');\n\t\t\t\t}\n\t\t\t\t// Super important! Completely ignore duplicate module definition\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet m = new Module(moduleId, strModuleId, this._normalizeDependencies(dependencies, moduleIdResolver), callback, errorback, moduleIdResolver);\n\t\t\tthis._modules2[moduleId] = m;\n\t\t\tif (this._config.isBuild()) {\n\t\t\t\tthis._buildInfoDefineStack[moduleId] = stack;\n\t\t\t\tthis._buildInfoDependencies[moduleId] = (m.dependencies || []).map(dep => this._moduleIdProvider.getStrModuleId(dep.id));\n\t\t\t}\n\t\t\t// Resolving of dependencies is immediate (not in a timeout). If there's a need to support a packer that concatenates in an\n\t\t\t// unordered manner, in order to finish processing the file, execute the following method in a timeout\n\t\t\tthis._resolve(m);\n\t\t}\n\t\t_normalizeDependency(dependency, moduleIdResolver) {\n\t\t\tif (dependency === 'exports') {\n\t\t\t\treturn RegularDependency.EXPORTS;\n\t\t\t}\n\t\t\tif (dependency === 'module') {\n\t\t\t\treturn RegularDependency.MODULE;\n\t\t\t}\n\t\t\tif (dependency === 'require') {\n\t\t\t\treturn RegularDependency.REQUIRE;\n\t\t\t}\n\t\t\t// Normalize dependency and then request it from the manager\n\t\t\tlet bangIndex = dependency.indexOf('!');\n\t\t\tif (bangIndex >= 0) {\n\t\t\t\tlet strPluginId = moduleIdResolver.resolveModule(dependency.substr(0, bangIndex));\n\t\t\t\tlet pluginParam = moduleIdResolver.resolveModule(dependency.substr(bangIndex + 1));\n\t\t\t\tlet dependencyId = this._moduleIdProvider.getModuleId(strPluginId + '!' + pluginParam);\n\t\t\t\tlet pluginId = this._moduleIdProvider.getModuleId(strPluginId);\n\t\t\t\treturn new PluginDependency(dependencyId, pluginId, pluginParam);\n\t\t\t}\n\t\t\treturn new RegularDependency(this._moduleIdProvider.getModuleId(moduleIdResolver.resolveModule(dependency)));\n\t\t}\n\t\t_normalizeDependencies(dependencies, moduleIdResolver) {\n\t\t\tlet result = [], resultLen = 0;\n\t\t\tfor (let i = 0, len = dependencies.length; i < len; i++) {\n\t\t\t\tresult[resultLen++] = this._normalizeDependency(dependencies[i], moduleIdResolver);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\t\t_relativeRequire(moduleIdResolver, dependencies, callback, errorback) {\n\t\t\tif (typeof dependencies === 'string') {\n\t\t\t\treturn this.synchronousRequire(dependencies, moduleIdResolver);\n\t\t\t}\n\t\t\tthis.defineModule(AMDLoader.Utilities.generateAnonymousModule(), dependencies, callback, errorback, null, moduleIdResolver);\n\t\t}\n\t\t/**\n\t\t * Require synchronously a module by its absolute id. If the module is not loaded, an exception will be thrown.\n\t\t * @param id The unique and absolute id of the required module\n\t\t * @return The exports of module 'id'\n\t\t */\n\t\tsynchronousRequire(_strModuleId, moduleIdResolver = new ModuleIdResolver(_strModuleId)) {\n\t\t\tlet dependency = this._normalizeDependency(_strModuleId, moduleIdResolver);\n\t\t\tlet m = this._modules2[dependency.id];\n\t\t\tif (!m) {\n\t\t\t\tthrow new Error('Check dependency list! Synchronous require cannot resolve module \\'' + _strModuleId + '\\'. This is the first mention of this module!');\n\t\t\t}\n\t\t\tif (!m.isComplete()) {\n\t\t\t\tthrow new Error('Check dependency list! Synchronous require cannot resolve module \\'' + _strModuleId + '\\'. This module has not been resolved completely yet.');\n\t\t\t}\n\t\t\tif (m.error) {\n\t\t\t\tthrow m.error;\n\t\t\t}\n\t\t\treturn m.exports;\n\t\t}\n\t\tconfigure(params, shouldOverwrite) {\n\t\t\tlet oldShouldRecordStats = this._config.shouldRecordStats();\n\t\t\tif (shouldOverwrite) {\n\t\t\t\tthis._config = new AMDLoader.Configuration(this._env, params);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tthis._config = this._config.cloneAndMerge(params);\n\t\t\t}\n\t\t\tif (this._config.shouldRecordStats() && !oldShouldRecordStats) {\n\t\t\t\tthis._recorder = null;\n\t\t\t}\n\t\t}\n\t\tgetConfig() {\n\t\t\treturn this._config;\n\t\t}\n\t\t/**\n\t\t * Callback from the scriptLoader when a module has been loaded.\n\t\t * This means its code is available and has been executed.\n\t\t */\n\t\t_onLoad(moduleId) {\n\t\t\tif (this._currentAnonymousDefineCall !== null) {\n\t\t\t\tlet defineCall = this._currentAnonymousDefineCall;\n\t\t\t\tthis._currentAnonymousDefineCall = null;\n\t\t\t\t// Hit an anonymous define call\n\t\t\t\tthis.defineModule(this._moduleIdProvider.getStrModuleId(moduleId), defineCall.dependencies, defineCall.callback, null, defineCall.stack);\n\t\t\t}\n\t\t}\n\t\t_createLoadError(moduleId, _err) {\n\t\t\tlet strModuleId = this._moduleIdProvider.getStrModuleId(moduleId);\n\t\t\tlet neededBy = (this._inverseDependencies2[moduleId] || []).map((intModuleId) => this._moduleIdProvider.getStrModuleId(intModuleId));\n\t\t\tconst err = AMDLoader.ensureError(_err);\n\t\t\terr.phase = 'loading';\n\t\t\terr.moduleId = strModuleId;\n\t\t\terr.neededBy = neededBy;\n\t\t\treturn err;\n\t\t}\n\t\t/**\n\t\t * Callback from the scriptLoader when a module hasn't been loaded.\n\t\t * This means that the script was not found (e.g. 404) or there was an error in the script.\n\t\t */\n\t\t_onLoadError(moduleId, err) {\n\t\t\tconst error = this._createLoadError(moduleId, err);\n\t\t\tif (!this._modules2[moduleId]) {\n\t\t\t\tthis._modules2[moduleId] = new Module(moduleId, this._moduleIdProvider.getStrModuleId(moduleId), [], () => { }, null, null);\n\t\t\t}\n\t\t\t// Find any 'local' error handlers, walk the entire chain of inverse dependencies if necessary.\n\t\t\tlet seenModuleId = [];\n\t\t\tfor (let i = 0, len = this._moduleIdProvider.getMaxModuleId(); i < len; i++) {\n\t\t\t\tseenModuleId[i] = false;\n\t\t\t}\n\t\t\tlet someoneNotified = false;\n\t\t\tlet queue = [];\n\t\t\tqueue.push(moduleId);\n\t\t\tseenModuleId[moduleId] = true;\n\t\t\twhile (queue.length > 0) {\n\t\t\t\tlet queueElement = queue.shift();\n\t\t\t\tlet m = this._modules2[queueElement];\n\t\t\t\tif (m) {\n\t\t\t\t\tsomeoneNotified = m.onDependencyError(error) || someoneNotified;\n\t\t\t\t}\n\t\t\t\tlet inverseDeps = this._inverseDependencies2[queueElement];\n\t\t\t\tif (inverseDeps) {\n\t\t\t\t\tfor (let i = 0, len = inverseDeps.length; i < len; i++) {\n\t\t\t\t\t\tlet inverseDep = inverseDeps[i];\n\t\t\t\t\t\tif (!seenModuleId[inverseDep]) {\n\t\t\t\t\t\t\tqueue.push(inverseDep);\n\t\t\t\t\t\t\tseenModuleId[inverseDep] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!someoneNotified) {\n\t\t\t\tthis._config.onError(error);\n\t\t\t}\n\t\t}\n\t\t/**\n\t\t * Walks (recursively) the dependencies of 'from' in search of 'to'.\n\t\t * Returns true if there is such a path or false otherwise.\n\t\t * @param from Module id to start at\n\t\t * @param to Module id to look for\n\t\t */\n\t\t_hasDependencyPath(fromId, toId) {\n\t\t\tlet from = this._modules2[fromId];\n\t\t\tif (!from) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tlet inQueue = [];\n\t\t\tfor (let i = 0, len = this._moduleIdProvider.getMaxModuleId(); i < len; i++) {\n\t\t\t\tinQueue[i] = false;\n\t\t\t}\n\t\t\tlet queue = [];\n\t\t\t// Insert 'from' in queue\n\t\t\tqueue.push(from);\n\t\t\tinQueue[fromId] = true;\n\t\t\twhile (queue.length > 0) {\n\t\t\t\t// Pop first inserted element of queue\n\t\t\t\tlet element = queue.shift();\n\t\t\t\tlet dependencies = element.dependencies;\n\t\t\t\tif (dependencies) {\n\t\t\t\t\t// Walk the element's dependencies\n\t\t\t\t\tfor (let i = 0, len = dependencies.length; i < len; i++) {\n\t\t\t\t\t\tlet dependency = dependencies[i];\n\t\t\t\t\t\tif (dependency.id === toId) {\n\t\t\t\t\t\t\t// There is a path to 'to'\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlet dependencyModule = this._modules2[dependency.id];\n\t\t\t\t\t\tif (dependencyModule && !inQueue[dependency.id]) {\n\t\t\t\t\t\t\t// Insert 'dependency' in queue\n\t\t\t\t\t\t\tinQueue[dependency.id] = true;\n\t\t\t\t\t\t\tqueue.push(dependencyModule);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// There is no path to 'to'\n\t\t\treturn false;\n\t\t}\n\t\t/**\n\t\t * Walks (recursively) the dependencies of 'from' in search of 'to'.\n\t\t * Returns cycle as array.\n\t\t * @param from Module id to start at\n\t\t * @param to Module id to look for\n\t\t */\n\t\t_findCyclePath(fromId, toId, depth) {\n\t\t\tif (fromId === toId || depth === 50) {\n\t\t\t\treturn [fromId];\n\t\t\t}\n\t\t\tlet from = this._modules2[fromId];\n\t\t\tif (!from) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\t// Walk the element's dependencies\n\t\t\tlet dependencies = from.dependencies;\n\t\t\tif (dependencies) {\n\t\t\t\tfor (let i = 0, len = dependencies.length; i < len; i++) {\n\t\t\t\t\tlet path = this._findCyclePath(dependencies[i].id, toId, depth + 1);\n\t\t\t\t\tif (path !== null) {\n\t\t\t\t\t\tpath.push(fromId);\n\t\t\t\t\t\treturn path;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\t/**\n\t\t * Create the local 'require' that is passed into modules\n\t\t */\n\t\t_createRequire(moduleIdResolver) {\n\t\t\tlet result = ((dependencies, callback, errorback) => {\n\t\t\t\treturn this._relativeRequire(moduleIdResolver, dependencies, callback, errorback);\n\t\t\t});\n\t\t\tresult.toUrl = (id) => {\n\t\t\t\treturn this._config.requireToUrl(moduleIdResolver.resolveModule(id));\n\t\t\t};\n\t\t\tresult.getStats = () => {\n\t\t\t\treturn this.getLoaderEvents();\n\t\t\t};\n\t\t\tresult.hasDependencyCycle = () => {\n\t\t\t\treturn this._hasDependencyCycle;\n\t\t\t};\n\t\t\tresult.config = (params, shouldOverwrite = false) => {\n\t\t\t\tthis.configure(params, shouldOverwrite);\n\t\t\t};\n\t\t\tresult.__$__nodeRequire = AMDLoader.global.nodeRequire;\n\t\t\treturn result;\n\t\t}\n\t\t_loadModule(moduleId) {\n\t\t\tif (this._modules2[moduleId] || this._knownModules2[moduleId]) {\n\t\t\t\t// known module\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis._knownModules2[moduleId] = true;\n\t\t\tlet strModuleId = this._moduleIdProvider.getStrModuleId(moduleId);\n\t\t\tlet paths = this._config.moduleIdToPaths(strModuleId);\n\t\t\tlet scopedPackageRegex = /^@[^\\/]+\\/[^\\/]+$/; // matches @scope/package-name\n\t\t\tif (this._env.isNode && (strModuleId.indexOf('/') === -1 || scopedPackageRegex.test(strModuleId))) {\n\t\t\t\tpaths.push('node|' + strModuleId);\n\t\t\t}\n\t\t\tlet lastPathIndex = -1;\n\t\t\tlet loadNextPath = (err) => {\n\t\t\t\tlastPathIndex++;\n\t\t\t\tif (lastPathIndex >= paths.length) {\n\t\t\t\t\t// No more paths to try\n\t\t\t\t\tthis._onLoadError(moduleId, err);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tlet currentPath = paths[lastPathIndex];\n\t\t\t\t\tlet recorder = this.getRecorder();\n\t\t\t\t\tif (this._config.isBuild() && currentPath === 'empty:') {\n\t\t\t\t\t\tthis._buildInfoPath[moduleId] = currentPath;\n\t\t\t\t\t\tthis.defineModule(this._moduleIdProvider.getStrModuleId(moduleId), [], null, null, null);\n\t\t\t\t\t\tthis._onLoad(moduleId);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\trecorder.record(10 /* LoaderEventType.BeginLoadingScript */, currentPath);\n\t\t\t\t\tthis._scriptLoader.load(this, currentPath, () => {\n\t\t\t\t\t\tif (this._config.isBuild()) {\n\t\t\t\t\t\t\tthis._buildInfoPath[moduleId] = currentPath;\n\t\t\t\t\t\t}\n\t\t\t\t\t\trecorder.record(11 /* LoaderEventType.EndLoadingScriptOK */, currentPath);\n\t\t\t\t\t\tthis._onLoad(moduleId);\n\t\t\t\t\t}, (err) => {\n\t\t\t\t\t\trecorder.record(12 /* LoaderEventType.EndLoadingScriptError */, currentPath);\n\t\t\t\t\t\tloadNextPath(err);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t};\n\t\t\tloadNextPath(null);\n\t\t}\n\t\t/**\n\t\t * Resolve a plugin dependency with the plugin loaded & complete\n\t\t * @param module The module that has this dependency\n\t\t * @param pluginDependency The semi-normalized dependency that appears in the module. e.g. 'vs/css!./mycssfile'. Only the plugin part (before !) is normalized\n\t\t * @param plugin The plugin (what the plugin exports)\n\t\t */\n\t\t_loadPluginDependency(plugin, pluginDependency) {\n\t\t\tif (this._modules2[pluginDependency.id] || this._knownModules2[pluginDependency.id]) {\n\t\t\t\t// known module\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis._knownModules2[pluginDependency.id] = true;\n\t\t\t// Delegate the loading of the resource to the plugin\n\t\t\tlet load = ((value) => {\n\t\t\t\tthis.defineModule(this._moduleIdProvider.getStrModuleId(pluginDependency.id), [], value, null, null);\n\t\t\t});\n\t\t\tload.error = (err) => {\n\t\t\t\tthis._config.onError(this._createLoadError(pluginDependency.id, err));\n\t\t\t};\n\t\t\tplugin.load(pluginDependency.pluginParam, this._createRequire(ModuleIdResolver.ROOT), load, this._config.getOptionsLiteral());\n\t\t}\n\t\t/**\n\t\t * Examine the dependencies of module 'module' and resolve them as needed.\n\t\t */\n\t\t_resolve(module) {\n\t\t\tlet dependencies = module.dependencies;\n\t\t\tif (dependencies) {\n\t\t\t\tfor (let i = 0, len = dependencies.length; i < len; i++) {\n\t\t\t\t\tlet dependency = dependencies[i];\n\t\t\t\t\tif (dependency === RegularDependency.EXPORTS) {\n\t\t\t\t\t\tmodule.exportsPassedIn = true;\n\t\t\t\t\t\tmodule.unresolvedDependenciesCount--;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (dependency === RegularDependency.MODULE) {\n\t\t\t\t\t\tmodule.unresolvedDependenciesCount--;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (dependency === RegularDependency.REQUIRE) {\n\t\t\t\t\t\tmodule.unresolvedDependenciesCount--;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tlet dependencyModule = this._modules2[dependency.id];\n\t\t\t\t\tif (dependencyModule && dependencyModule.isComplete()) {\n\t\t\t\t\t\tif (dependencyModule.error) {\n\t\t\t\t\t\t\tmodule.onDependencyError(dependencyModule.error);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tmodule.unresolvedDependenciesCount--;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (this._hasDependencyPath(dependency.id, module.id)) {\n\t\t\t\t\t\tthis._hasDependencyCycle = true;\n\t\t\t\t\t\tconsole.warn('There is a dependency cycle between \\'' + this._moduleIdProvider.getStrModuleId(dependency.id) + '\\' and \\'' + this._moduleIdProvider.getStrModuleId(module.id) + '\\'. The cyclic path follows:');\n\t\t\t\t\t\tlet cyclePath = this._findCyclePath(dependency.id, module.id, 0) || [];\n\t\t\t\t\t\tcyclePath.reverse();\n\t\t\t\t\t\tcyclePath.push(dependency.id);\n\t\t\t\t\t\tconsole.warn(cyclePath.map(id => this._moduleIdProvider.getStrModuleId(id)).join(' => \\n'));\n\t\t\t\t\t\t// Break the cycle\n\t\t\t\t\t\tmodule.unresolvedDependenciesCount--;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\t// record inverse dependency\n\t\t\t\t\tthis._inverseDependencies2[dependency.id] = this._inverseDependencies2[dependency.id] || [];\n\t\t\t\t\tthis._inverseDependencies2[dependency.id].push(module.id);\n\t\t\t\t\tif (dependency instanceof PluginDependency) {\n\t\t\t\t\t\tlet plugin = this._modules2[dependency.pluginId];\n\t\t\t\t\t\tif (plugin && plugin.isComplete()) {\n\t\t\t\t\t\t\tthis._loadPluginDependency(plugin.exports, dependency);\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Record dependency for when the plugin gets loaded\n\t\t\t\t\t\tlet inversePluginDeps = this._inversePluginDependencies2.get(dependency.pluginId);\n\t\t\t\t\t\tif (!inversePluginDeps) {\n\t\t\t\t\t\t\tinversePluginDeps = [];\n\t\t\t\t\t\t\tthis._inversePluginDependencies2.set(dependency.pluginId, inversePluginDeps);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tinversePluginDeps.push(dependency);\n\t\t\t\t\t\tthis._loadModule(dependency.pluginId);\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tthis._loadModule(dependency.id);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (module.unresolvedDependenciesCount === 0) {\n\t\t\t\tthis._onModuleComplete(module);\n\t\t\t}\n\t\t}\n\t\t_onModuleComplete(module) {\n\t\t\tlet recorder = this.getRecorder();\n\t\t\tif (module.isComplete()) {\n\t\t\t\t// already done\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet dependencies = module.dependencies;\n\t\t\tlet dependenciesValues = [];\n\t\t\tif (dependencies) {\n\t\t\t\tfor (let i = 0, len = dependencies.length; i < len; i++) {\n\t\t\t\t\tlet dependency = dependencies[i];\n\t\t\t\t\tif (dependency === RegularDependency.EXPORTS) {\n\t\t\t\t\t\tdependenciesValues[i] = module.exports;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (dependency === RegularDependency.MODULE) {\n\t\t\t\t\t\tdependenciesValues[i] = {\n\t\t\t\t\t\t\tid: module.strId,\n\t\t\t\t\t\t\tconfig: () => {\n\t\t\t\t\t\t\t\treturn this._config.getConfigForModule(module.strId);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t};\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (dependency === RegularDependency.REQUIRE) {\n\t\t\t\t\t\tdependenciesValues[i] = this._createRequire(module.moduleIdResolver);\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tlet dependencyModule = this._modules2[dependency.id];\n\t\t\t\t\tif (dependencyModule) {\n\t\t\t\t\t\tdependenciesValues[i] = dependencyModule.exports;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tdependenciesValues[i] = null;\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst inversedependenciesProvider = (moduleId) => {\n\t\t\t\treturn (this._inverseDependencies2[moduleId] || []).map((intModuleId) => this._moduleIdProvider.getStrModuleId(intModuleId));\n\t\t\t};\n\t\t\tmodule.complete(recorder, this._config, dependenciesValues, inversedependenciesProvider);\n\t\t\t// Fetch and clear inverse dependencies\n\t\t\tlet inverseDeps = this._inverseDependencies2[module.id];\n\t\t\tthis._inverseDependencies2[module.id] = null;\n\t\t\tif (inverseDeps) {\n\t\t\t\t// Resolve one inverse dependency at a time, always\n\t\t\t\t// on the lookout for a completed module.\n\t\t\t\tfor (let i = 0, len = inverseDeps.length; i < len; i++) {\n\t\t\t\t\tlet inverseDependencyId = inverseDeps[i];\n\t\t\t\t\tlet inverseDependency = this._modules2[inverseDependencyId];\n\t\t\t\t\tinverseDependency.unresolvedDependenciesCount--;\n\t\t\t\t\tif (inverseDependency.unresolvedDependenciesCount === 0) {\n\t\t\t\t\t\tthis._onModuleComplete(inverseDependency);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet inversePluginDeps = this._inversePluginDependencies2.get(module.id);\n\t\t\tif (inversePluginDeps) {\n\t\t\t\t// This module is used as a plugin at least once\n\t\t\t\t// Fetch and clear these inverse plugin dependencies\n\t\t\t\tthis._inversePluginDependencies2.delete(module.id);\n\t\t\t\t// Resolve plugin dependencies one at a time\n\t\t\t\tfor (let i = 0, len = inversePluginDeps.length; i < len; i++) {\n\t\t\t\t\tthis._loadPluginDependency(module.exports, inversePluginDeps[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tAMDLoader.ModuleManager = ModuleManager;\n})(AMDLoader || (AMDLoader = {}));\nvar define;\nvar AMDLoader;\n(function (AMDLoader) {\n\tconst env = new AMDLoader.Environment();\n\tlet moduleManager = null;\n\tconst DefineFunc = function (id, dependencies, callback) {\n\t\tif (typeof id !== 'string') {\n\t\t\tcallback = dependencies;\n\t\t\tdependencies = id;\n\t\t\tid = null;\n\t\t}\n\t\tif (typeof dependencies !== 'object' || !Array.isArray(dependencies)) {\n\t\t\tcallback = dependencies;\n\t\t\tdependencies = null;\n\t\t}\n\t\tif (!dependencies) {\n\t\t\tdependencies = ['require', 'exports', 'module'];\n\t\t}\n\t\tif (id) {\n\t\t\tmoduleManager.defineModule(id, dependencies, callback, null, null);\n\t\t}\n\t\telse {\n\t\t\tmoduleManager.enqueueDefineAnonymousModule(dependencies, callback);\n\t\t}\n\t};\n\tDefineFunc.amd = {\n\t\tjQuery: true\n\t};\n\tconst _requireFunc_config = function (params, shouldOverwrite = false) {\n\t\tmoduleManager.configure(params, shouldOverwrite);\n\t};\n\tconst RequireFunc = function () {\n\t\tif (arguments.length === 1) {\n\t\t\tif ((arguments[0] instanceof Object) && !Array.isArray(arguments[0])) {\n\t\t\t\t_requireFunc_config(arguments[0]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (typeof arguments[0] === 'string') {\n\t\t\t\treturn moduleManager.synchronousRequire(arguments[0]);\n\t\t\t}\n\t\t}\n\t\tif (arguments.length === 2 || arguments.length === 3) {\n\t\t\tif (Array.isArray(arguments[0])) {\n\t\t\t\tmoduleManager.defineModule(AMDLoader.Utilities.generateAnonymousModule(), arguments[0], arguments[1], arguments[2], null);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tthrow new Error('Unrecognized require call');\n\t};\n\tRequireFunc.config = _requireFunc_config;\n\tRequireFunc.getConfig = function () {\n\t\treturn moduleManager.getConfig().getOptionsLiteral();\n\t};\n\tRequireFunc.reset = function () {\n\t\tmoduleManager = moduleManager.reset();\n\t};\n\tRequireFunc.getBuildInfo = function () {\n\t\treturn moduleManager.getBuildInfo();\n\t};\n\tRequireFunc.getStats = function () {\n\t\treturn moduleManager.getLoaderEvents();\n\t};\n\tRequireFunc.define = DefineFunc;\n\tfunction init() {\n\t\tif (typeof AMDLoader.global.require !== 'undefined' || typeof require !== 'undefined') {\n\t\t\tconst _nodeRequire = (AMDLoader.global.require || require);\n\t\t\tif (typeof _nodeRequire === 'function' && typeof _nodeRequire.resolve === 'function') {\n\t\t\t\t// re-expose node's require function\n\t\t\t\tconst nodeRequire = AMDLoader.ensureRecordedNodeRequire(moduleManager.getRecorder(), _nodeRequire);\n\t\t\t\tAMDLoader.global.nodeRequire = nodeRequire;\n\t\t\t\tRequireFunc.nodeRequire = nodeRequire;\n\t\t\t\tRequireFunc.__$__nodeRequire = nodeRequire;\n\t\t\t}\n\t\t}\n\t\tif (env.isNode && !env.isElectronRenderer && !env.isElectronNodeIntegrationWebWorker) {\n\t\t\tmodule.exports = RequireFunc;\n\t\t}\n\t\telse {\n\t\t\tif (!env.isElectronRenderer) {\n\t\t\t\tAMDLoader.global.define = DefineFunc;\n\t\t\t}\n\t\t\tAMDLoader.global.require = RequireFunc;\n\t\t}\n\t}\n\tAMDLoader.init = init;\n\tif (typeof AMDLoader.global.define !== 'function' || !AMDLoader.global.define.amd) {\n\t\tmoduleManager = new AMDLoader.ModuleManager(env, AMDLoader.createScriptLoader(env), DefineFunc, RequireFunc, AMDLoader.Utilities.getHighPerformanceTimestamp());\n\t\t// The global variable require can configure the loader\n\t\tif (typeof AMDLoader.global.require !== 'undefined' && typeof AMDLoader.global.require !== 'function') {\n\t\t\tRequireFunc.config(AMDLoader.global.require);\n\t\t}\n\t\t// This define is for the local closure defined in node in the case that the loader is concatenated\n\t\tdefine = function () {\n\t\t\treturn DefineFunc.apply(null, arguments);\n\t\t};\n\t\tdefine.amd = DefineFunc.amd;\n\t\tif (typeof doNotInitLoader === 'undefined') {\n\t\t\tinit();\n\t\t}\n\t}\n})(AMDLoader || (AMDLoader = {}));\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n(function () {\n\n\tinterface IMonacoEnvironment {\n\t\tbaseUrl?: string;\n\t\tcreateTrustedTypesPolicy<Options extends TrustedTypePolicyOptions>(\n\t\t\tpolicyName: string,\n\t\t\tpolicyOptions?: Options,\n\t\t): undefined | Pick<TrustedTypePolicy<Options>, 'name' | Extract<keyof Options, keyof TrustedTypePolicyOptions>>;\n\t}\n\tconst monacoEnvironment: IMonacoEnvironment | undefined = (globalThis as any).MonacoEnvironment;\n\n\tconst monacoBaseUrl = monacoEnvironment && monacoEnvironment.baseUrl ? monacoEnvironment.baseUrl : '../../../';\n\n\tfunction createTrustedTypesPolicy<Options extends TrustedTypePolicyOptions>(\n\t\tpolicyName: string,\n\t\tpolicyOptions?: Options,\n\t): undefined | Pick<TrustedTypePolicy<Options>, 'name' | Extract<keyof Options, keyof TrustedTypePolicyOptions>> {\n\n\t\tif (monacoEnvironment?.createTrustedTypesPolicy) {\n\t\t\ttry {\n\t\t\t\treturn monacoEnvironment.createTrustedTypesPolicy(policyName, policyOptions);\n\t\t\t} catch (err) {\n\t\t\t\tconsole.warn(err);\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t}\n\n\t\ttry {\n\t\t\treturn self.trustedTypes?.createPolicy(policyName, policyOptions);\n\t\t} catch (err) {\n\t\t\tconsole.warn(err);\n\t\t\treturn undefined;\n\t\t}\n\t}\n\n\tconst trustedTypesPolicy = createTrustedTypesPolicy('amdLoader', {\n\t\tcreateScriptURL: value => value,\n\t\tcreateScript: (_, ...args: string[]) => {\n\t\t\t// workaround a chrome issue not allowing to create new functions\n\t\t\t// see https://github.com/w3c/webappsec-trusted-types/wiki/Trusted-Types-for-function-constructor\n\t\t\tconst fnArgs = args.slice(0, -1).join(',');\n\t\t\tconst fnBody = args.pop()!.toString();\n\t\t\t// Do not add a new line to fnBody, as this will confuse source maps.\n\t\t\tconst body = `(function anonymous(${fnArgs}) { ${fnBody}\\n})`;\n\t\t\treturn body;\n\t\t}\n\t});\n\n\tfunction canUseEval(): boolean {\n\t\ttry {\n\t\t\tconst func = (\n\t\t\t\ttrustedTypesPolicy\n\t\t\t\t\t? globalThis.eval(<any>trustedTypesPolicy.createScript('', 'true')) // CodeQL [SM01632] fetch + eval is used on the web worker instead of importScripts if possible because importScripts is synchronous and we observed deadlocks on Safari\n\t\t\t\t\t: new Function('true') // CodeQL [SM01632] fetch + eval is used on the web worker instead of importScripts if possible because importScripts is synchronous and we observed deadlocks on Safari\n\t\t\t);\n\t\t\tfunc.call(globalThis);\n\t\t\treturn true;\n\t\t} catch (err) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tfunction loadAMDLoader() {\n\t\treturn new Promise<void>((resolve, reject) => {\n\t\t\tif (typeof (<any>globalThis).define === 'function' && (<any>globalThis).define.amd) {\n\t\t\t\treturn resolve();\n\t\t\t}\n\t\t\tconst loaderSrc: string | TrustedScriptURL = monacoBaseUrl + 'vs/loader.js';\n\n\t\t\tconst isCrossOrigin = (/^((http:)|(https:)|(file:))/.test(loaderSrc) && loaderSrc.substring(0, globalThis.origin.length) !== globalThis.origin);\n\t\t\tif (!isCrossOrigin && canUseEval()) {\n\t\t\t\t// use `fetch` if possible because `importScripts`\n\t\t\t\t// is synchronous and can lead to deadlocks on Safari\n\t\t\t\tfetch(loaderSrc).then((response) => {\n\t\t\t\t\tif (response.status !== 200) {\n\t\t\t\t\t\tthrow new Error(response.statusText);\n\t\t\t\t\t}\n\t\t\t\t\treturn response.text();\n\t\t\t\t}).then((text) => {\n\t\t\t\t\ttext = `${text}\\n//# sourceURL=${loaderSrc}`;\n\t\t\t\t\tconst func = (\n\t\t\t\t\t\ttrustedTypesPolicy\n\t\t\t\t\t\t\t? globalThis.eval(trustedTypesPolicy.createScript('', text) as unknown as string) // CodeQL [SM01632] fetch + eval is used on the web worker instead of importScripts if possible because importScripts is synchronous and we observed deadlocks on Safari\n\t\t\t\t\t\t\t: new Function(text) // CodeQL [SM01632] fetch + eval is used on the web worker instead of importScripts if possible because importScripts is synchronous and we observed deadlocks on Safari\n\t\t\t\t\t);\n\t\t\t\t\tfunc.call(globalThis);\n\t\t\t\t\tresolve();\n\t\t\t\t}).then(undefined, reject);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (trustedTypesPolicy) {\n\t\t\t\timportScripts(trustedTypesPolicy.createScriptURL(loaderSrc) as unknown as string);\n\t\t\t} else {\n\t\t\t\timportScripts(loaderSrc as string);\n\t\t\t}\n\t\t\tresolve();\n\t\t});\n\t}\n\n\tfunction configureAMDLoader() {\n\t\trequire.config({\n\t\t\tbaseUrl: monacoBaseUrl,\n\t\t\tcatchError: true,\n\t\t\ttrustedTypesPolicy,\n\t\t\tamdModulesPattern: /^vs\\//\n\t\t});\n\t}\n\n\tfunction loadCode(moduleId: string): Promise<SimpleWorkerModule> {\n\t\t// ESM-uncomment-begin\n\t\t// if (typeof loadAMDLoader === 'function') { /* fixes unused import, remove me */}\n\t\t// const moduleUrl = new URL(`${moduleId}.js`, globalThis._VSCODE_FILE_ROOT);\n\t\t// return import(moduleUrl.href);\n\t\t// ESM-uncomment-end\n\n\t\t// ESM-comment-begin\n\t\treturn loadAMDLoader().then(() => {\n\t\t\tconfigureAMDLoader();\n\t\t\treturn new Promise<SimpleWorkerModule>((resolve, reject) => {\n\t\t\t\trequire([moduleId], resolve, reject);\n\t\t\t});\n\t\t});\n\t\t// ESM-comment-end\n\t}\n\n\tinterface MessageHandler {\n\t\tonmessage(msg: any, ports: readonly MessagePort[]): void;\n\t}\n\n\t// shape of vs/base/common/worker/simpleWorker.ts\n\tinterface SimpleWorkerModule {\n\t\tcreate(postMessage: (msg: any, transfer?: Transferable[]) => void): MessageHandler;\n\t}\n\n\tfunction setupWorkerServer(ws: SimpleWorkerModule) {\n\t\tsetTimeout(function () {\n\t\t\tconst messageHandler = ws.create((msg: any, transfer?: Transferable[]) => {\n\t\t\t\t(<any>globalThis).postMessage(msg, transfer);\n\t\t\t});\n\n\t\t\tself.onmessage = (e: MessageEvent) => messageHandler.onmessage(e.data, e.ports);\n\t\t\twhile (beforeReadyMessages.length > 0) {\n\t\t\t\tself.onmessage(beforeReadyMessages.shift()!);\n\t\t\t}\n\t\t}, 0);\n\t}\n\n\t// If the loader is already defined, configure it immediately\n\t// This helps in the bundled case, where we must load nls files\n\t// and they need a correct baseUrl to be loaded.\n\tif (typeof (<any>globalThis).define === 'function' && (<any>globalThis).define.amd) {\n\t\tconfigureAMDLoader();\n\t}\n\n\tlet isFirstMessage = true;\n\tconst beforeReadyMessages: MessageEvent[] = [];\n\tglobalThis.onmessage = (message: MessageEvent) => {\n\t\tif (!isFirstMessage) {\n\t\t\tbeforeReadyMessages.push(message);\n\t\t\treturn;\n\t\t}\n\n\t\tisFirstMessage = false;\n\t\tloadCode(message.data).then((ws) => {\n\t\t\tsetupWorkerServer(ws);\n\t\t}, (err) => {\n\t\t\tconsole.error(err);\n\t\t});\n\t};\n})();\n","\n\n/**\n * Returns the last element of an array.\n * @param array The array.\n * @param n Which element from the end (default is zero).\n */\nexport function tail<T>(array: ArrayLike<T>, n: number = 0): T | undefined {\n\treturn array[array.length - (1 + n)];\n}\n\nexport function tail2<T>(arr: T[]): [T[], T] {\n\tif (arr.length === 0) {\n\t\tthrow new Error('Invalid tail call');\n\t}\n\n\treturn [arr.slice(0, arr.length - 1), arr[arr.length - 1]];\n}\n\nexport function equals<T>(one: ReadonlyArray<T> | undefined, other: ReadonlyArray<T> | undefined, itemEquals: (a: T, b: T) => boolean = (a, b) => a === b): boolean {\n\tif (one === other) {\n\t\treturn true;\n\t}\n\n\tif (!one || !other) {\n\t\treturn false;\n\t}\n\n\tif (one.length !== other.length) {\n\t\treturn false;\n\t}\n\n\tfor (let i = 0, len = one.length; i < len; i++) {\n\t\tif (!itemEquals(one[i], other[i])) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\n/**\n * Remove the element at `index` by replacing it with the last element. This is faster than `splice`\n * but changes the order of the array\n */\nexport function removeFastWithoutKeepingOrder<T>(array: T[], index: number) {\n\tconst last = array.length - 1;\n\tif (index < last) {\n\t\tarray[index] = array[last];\n\t}\n\tarray.pop();\n}\n\n/**\n * Performs a binary search algorithm over a sorted array.\n *\n * @param array The array being searched.\n * @param key The value we search for.\n * @param comparator A function that takes two array elements and returns zero\n *   if they are equal, a negative number if the first element precedes the\n *   second one in the sorting order, or a positive number if the second element\n *   precedes the first one.\n * @return See {@link binarySearch2}\n */\nexport function binarySearch<T>(array: ReadonlyArray<T>, key: T, comparator: (op1: T, op2: T) => number): number {\n\treturn binarySearch2(array.length, i => comparator(array[i], key));\n}\n\n/**\n * Performs a binary search algorithm over a sorted collection. Useful for cases\n * when we need to perform a binary search over something that isn't actually an\n * array, and converting data to an array would defeat the use of binary search\n * in the first place.\n *\n * @param length The collection length.\n * @param compareToKey A function that takes an index of an element in the\n *   collection and returns zero if the value at this index is equal to the\n *   search key, a negative number if the value precedes the search key in the\n *   sorting order, or a positive number if the search key precedes the value.\n * @return A non-negative index of an element, if found. If not found, the\n *   result is -(n+1) (or ~n, using bitwise notation), where n is the index\n *   where the key should be inserted to maintain the sorting order.\n */\nexport function binarySearch2(length: number, compareToKey: (index: number) => number): number {\n\tlet low = 0,\n\t\thigh = length - 1;\n\n\twhile (low <= high) {\n\t\tconst mid = ((low + high) / 2) | 0;\n\t\tconst comp = compareToKey(mid);\n\t\tif (comp < 0) {\n\t\t\tlow = mid + 1;\n\t\t} else if (comp > 0) {\n\t\t\thigh = mid - 1;\n\t\t} else {\n\t\t\treturn mid;\n\t\t}\n\t}\n\treturn -(low + 1);\n}\n\ntype Compare<T> = (a: T, b: T) => number;\n\n\nexport function quickSelect<T>(nth: number, data: T[], compare: Compare<T>): T {\n\n\tnth = nth | 0;\n\n\tif (nth >= data.length) {\n\t\tthrow new TypeError('invalid index');\n\t}\n\n\tconst pivotValue = data[Math.floor(data.length * Math.random())];\n\tconst lower: T[] = [];\n\tconst higher: T[] = [];\n\tconst pivots: T[] = [];\n\n\tfor (const value of data) {\n\t\tconst val = compare(value, pivotValue);\n\t\tif (val < 0) {\n\t\t\tlower.push(value);\n\t\t} else if (val > 0) {\n\t\t\thigher.push(value);\n\t\t} else {\n\t\t\tpivots.push(value);\n\t\t}\n\t}\n\n\tif (nth < lower.length) {\n\t\treturn quickSelect(nth, lower, compare);\n\t} else if (nth < lower.length + pivots.length) {\n\t\treturn pivots[0];\n\t} else {\n\t\treturn quickSelect(nth - (lower.length + pivots.length), higher, compare);\n\t}\n}\n\nexport function groupBy<T>(data: ReadonlyArray<T>, compare: (a: T, b: T) => number): T[][] {\n\tconst result: T[][] = [];\n\tlet currentGroup: T[] | undefined = undefined;\n\tfor (const element of data.slice(0).sort(compare)) {\n\t\tif (!currentGroup || compare(currentGroup[0], element) !== 0) {\n\t\t\tcurrentGroup = [element];\n\t\t\tresult.push(currentGroup);\n\t\t} else {\n\t\t\tcurrentGroup.push(element);\n\t\t}\n\t}\n\treturn result;\n}\n\n/**\n * Splits the given items into a list of (non-empty) groups.\n * `shouldBeGrouped` is used to decide if two consecutive items should be in the same group.\n * The order of the items is preserved.\n */\nexport function* groupAdjacentBy<T>(items: Iterable<T>, shouldBeGrouped: (item1: T, item2: T) => boolean): Iterable<T[]> {\n\tlet currentGroup: T[] | undefined;\n\tlet last: T | undefined;\n\tfor (const item of items) {\n\t\tif (last !== undefined && shouldBeGrouped(last, item)) {\n\t\t\tcurrentGroup!.push(item);\n\t\t} else {\n\t\t\tif (currentGroup) {\n\t\t\t\tyield currentGroup;\n\t\t\t}\n\t\t\tcurrentGroup = [item];\n\t\t}\n\t\tlast = item;\n\t}\n\tif (currentGroup) {\n\t\tyield currentGroup;\n\t}\n}\n\nexport function forEachAdjacent<T>(arr: T[], f: (item1: T | undefined, item2: T | undefined) => void): void {\n\tfor (let i = 0; i <= arr.length; i++) {\n\t\tf(i === 0 ? undefined : arr[i - 1], i === arr.length ? undefined : arr[i]);\n\t}\n}\n\nexport function forEachWithNeighbors<T>(arr: T[], f: (before: T | undefined, element: T, after: T | undefined) => void): void {\n\tfor (let i = 0; i < arr.length; i++) {\n\t\tf(i === 0 ? undefined : arr[i - 1], arr[i], i + 1 === arr.length ? undefined : arr[i + 1]);\n\t}\n}\n\n/**\n * @returns New array with all falsy values removed. The original array IS NOT modified.\n */\nexport function coalesce<T>(array: ReadonlyArray<T | undefined | null>): T[] {\n\treturn array.filter((e): e is T => !!e);\n}\n\n/**\n * Remove all falsy values from `array`. The original array IS modified.\n */\nexport function coalesceInPlace<T>(array: Array<T | undefined | null>): asserts array is Array<T> {\n\tlet to = 0;\n\tfor (let i = 0; i < array.length; i++) {\n\t\tif (!!array[i]) {\n\t\t\tarray[to] = array[i];\n\t\t\tto += 1;\n\t\t}\n\t}\n\tarray.length = to;\n}\n\n/**\n * @returns false if the provided object is an array and not empty.\n */\nexport function isFalsyOrEmpty(obj: any): boolean {\n\treturn !Array.isArray(obj) || obj.length === 0;\n}\n\n/**\n * @returns True if the provided object is an array and has at least one element.\n */\nexport function isNonEmptyArray<T>(obj: T[] | undefined | null): obj is T[];\nexport function isNonEmptyArray<T>(obj: readonly T[] | undefined | null): obj is readonly T[];\nexport function isNonEmptyArray<T>(obj: T[] | readonly T[] | undefined | null): obj is T[] | readonly T[] {\n\treturn Array.isArray(obj) && obj.length > 0;\n}\n\n/**\n * Removes duplicates from the given array. The optional keyFn allows to specify\n * how elements are checked for equality by returning an alternate value for each.\n */\nexport function distinct<T>(array: ReadonlyArray<T>, keyFn: (value: T) => any = value => value): T[] {\n\tconst seen = new Set<any>();\n\n\treturn array.filter(element => {\n\t\tconst key = keyFn!(element);\n\t\tif (seen.has(key)) {\n\t\t\treturn false;\n\t\t}\n\t\tseen.add(key);\n\t\treturn true;\n\t});\n}\n\nexport function firstOrDefault<T, NotFound = T>(array: ReadonlyArray<T>, notFoundValue: NotFound): T | NotFound;\nexport function firstOrDefault<T>(array: ReadonlyArray<T>): T | undefined;\nexport function firstOrDefault<T, NotFound = T>(array: ReadonlyArray<T>, notFoundValue?: NotFound): T | NotFound | undefined {\n\treturn array.length > 0 ? array[0] : notFoundValue;\n}\n\nexport function range(to: number): number[];\nexport function range(from: number, to: number): number[];\nexport function range(arg: number, to?: number): number[] {\n\tlet from = typeof to === 'number' ? arg : 0;\n\n\tif (typeof to === 'number') {\n\t\tfrom = arg;\n\t} else {\n\t\tfrom = 0;\n\t\tto = arg;\n\t}\n\n\tconst result: number[] = [];\n\n\tif (from <= to) {\n\t\tfor (let i = from; i < to; i++) {\n\t\t\tresult.push(i);\n\t\t}\n\t} else {\n\t\tfor (let i = from; i > to; i--) {\n\t\t\tresult.push(i);\n\t\t}\n\t}\n\n\treturn result;\n}\n\n/**\n * Insert `insertArr` inside `target` at `insertIndex`.\n * Please don't touch unless you understand https://jsperf.com/inserting-an-array-within-an-array\n */\nexport function arrayInsert<T>(target: T[], insertIndex: number, insertArr: T[]): T[] {\n\tconst before = target.slice(0, insertIndex);\n\tconst after = target.slice(insertIndex);\n\treturn before.concat(insertArr, after);\n}\n\n/**\n * Pushes an element to the start of the array, if found.\n */\nexport function pushToStart<T>(arr: T[], value: T): void {\n\tconst index = arr.indexOf(value);\n\n\tif (index > -1) {\n\t\tarr.splice(index, 1);\n\t\tarr.unshift(value);\n\t}\n}\n\n/**\n * Pushes an element to the end of the array, if found.\n */\nexport function pushToEnd<T>(arr: T[], value: T): void {\n\tconst index = arr.indexOf(value);\n\n\tif (index > -1) {\n\t\tarr.splice(index, 1);\n\t\tarr.push(value);\n\t}\n}\n\nexport function pushMany<T>(arr: T[], items: ReadonlyArray<T>): void {\n\tfor (const item of items) {\n\t\tarr.push(item);\n\t}\n}\n\nexport function asArray<T>(x: T | T[]): T[];\nexport function asArray<T>(x: T | readonly T[]): readonly T[];\nexport function asArray<T>(x: T | T[]): T[] {\n\treturn Array.isArray(x) ? x : [x];\n}\n\n/**\n * Insert the new items in the array.\n * @param array The original array.\n * @param start The zero-based location in the array from which to start inserting elements.\n * @param newItems The items to be inserted\n */\nexport function insertInto<T>(array: T[], start: number, newItems: T[]): void {\n\tconst startIdx = getActualStartIndex(array, start);\n\tconst originalLength = array.length;\n\tconst newItemsLength = newItems.length;\n\tarray.length = originalLength + newItemsLength;\n\t// Move the items after the start index, start from the end so that we don't overwrite any value.\n\tfor (let i = originalLength - 1; i >= startIdx; i--) {\n\t\tarray[i + newItemsLength] = array[i];\n\t}\n\n\tfor (let i = 0; i < newItemsLength; i++) {\n\t\tarray[i + startIdx] = newItems[i];\n\t}\n}\n\n/**\n * Removes elements from an array and inserts new elements in their place, returning the deleted elements. Alternative to the native Array.splice method, it\n * can only support limited number of items due to the maximum call stack size limit.\n * @param array The original array.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @returns An array containing the elements that were deleted.\n */\nexport function splice<T>(array: T[], start: number, deleteCount: number, newItems: T[]): T[] {\n\tconst index = getActualStartIndex(array, start);\n\tlet result = array.splice(index, deleteCount);\n\tif (result === undefined) {\n\t\t// see https://bugs.webkit.org/show_bug.cgi?id=261140\n\t\tresult = [];\n\t}\n\tinsertInto(array, index, newItems);\n\treturn result;\n}\n\n/**\n * Determine the actual start index (same logic as the native splice() or slice())\n * If greater than the length of the array, start will be set to the length of the array. In this case, no element will be deleted but the method will behave as an adding function, adding as many element as item[n*] provided.\n * If negative, it will begin that many elements from the end of the array. (In this case, the origin -1, meaning -n is the index of the nth last element, and is therefore equivalent to the index of array.length - n.) If array.length + start is less than 0, it will begin from index 0.\n * @param array The target array.\n * @param start The operation index.\n */\nfunction getActualStartIndex<T>(array: T[], start: number): number {\n\treturn start < 0 ? Math.max(start + array.length, 0) : Math.min(start, array.length);\n}\n\n/**\n * When comparing two values,\n * a negative number indicates that the first value is less than the second,\n * a positive number indicates that the first value is greater than the second,\n * and zero indicates that neither is the case.\n*/\nexport type CompareResult = number;\n\nexport namespace CompareResult {\n\texport function isLessThan(result: CompareResult): boolean {\n\t\treturn result < 0;\n\t}\n\n\texport function isLessThanOrEqual(result: CompareResult): boolean {\n\t\treturn result <= 0;\n\t}\n\n\texport function isGreaterThan(result: CompareResult): boolean {\n\t\treturn result > 0;\n\t}\n\n\texport function isNeitherLessOrGreaterThan(result: CompareResult): boolean {\n\t\treturn result === 0;\n\t}\n\n\texport const greaterThan = 1;\n\texport const lessThan = -1;\n\texport const neitherLessOrGreaterThan = 0;\n}\n\n/**\n * A comparator `c` defines a total order `<=` on `T` as following:\n * `c(a, b) <= 0` iff `a` <= `b`.\n * We also have `c(a, b) == 0` iff `c(b, a) == 0`.\n*/\nexport type Comparator<T> = (a: T, b: T) => CompareResult;\n\nexport function compareBy<TItem, TCompareBy>(selector: (item: TItem) => TCompareBy, comparator: Comparator<TCompareBy>): Comparator<TItem> {\n\treturn (a, b) => comparator(selector(a), selector(b));\n}\n\nexport function tieBreakComparators<TItem>(...comparators: Comparator<TItem>[]): Comparator<TItem> {\n\treturn (item1, item2) => {\n\t\tfor (const comparator of comparators) {\n\t\t\tconst result = comparator(item1, item2);\n\t\t\tif (!CompareResult.isNeitherLessOrGreaterThan(result)) {\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\t\treturn CompareResult.neitherLessOrGreaterThan;\n\t};\n}\n\n/**\n * The natural order on numbers.\n*/\nexport const numberComparator: Comparator<number> = (a, b) => a - b;\n\nexport const booleanComparator: Comparator<boolean> = (a, b) => numberComparator(a ? 1 : 0, b ? 1 : 0);\n\nexport function reverseOrder<TItem>(comparator: Comparator<TItem>): Comparator<TItem> {\n\treturn (a, b) => -comparator(a, b);\n}\n\nexport class ArrayQueue<T> {\n\tprivate firstIdx = 0;\n\tprivate lastIdx = this.items.length - 1;\n\n\t/**\n\t * Constructs a queue that is backed by the given array. Runtime is O(1).\n\t*/\n\tconstructor(private readonly items: readonly T[]) { }\n\n\tget length(): number {\n\t\treturn this.lastIdx - this.firstIdx + 1;\n\t}\n\n\t/**\n\t * Consumes elements from the beginning of the queue as long as the predicate returns true.\n\t * If no elements were consumed, `null` is returned. Has a runtime of O(result.length).\n\t*/\n\ttakeWhile(predicate: (value: T) => boolean): T[] | null {\n\t\t// P(k) := k <= this.lastIdx && predicate(this.items[k])\n\t\t// Find s := min { k | k >= this.firstIdx && !P(k) } and return this.data[this.firstIdx...s)\n\n\t\tlet startIdx = this.firstIdx;\n\t\twhile (startIdx < this.items.length && predicate(this.items[startIdx])) {\n\t\t\tstartIdx++;\n\t\t}\n\t\tconst result = startIdx === this.firstIdx ? null : this.items.slice(this.firstIdx, startIdx);\n\t\tthis.firstIdx = startIdx;\n\t\treturn result;\n\t}\n\n\t/**\n\t * Consumes elements from the end of the queue as long as the predicate returns true.\n\t * If no elements were consumed, `null` is returned.\n\t * The result has the same order as the underlying array!\n\t*/\n\ttakeFromEndWhile(predicate: (value: T) => boolean): T[] | null {\n\t\t// P(k) := this.firstIdx >= k && predicate(this.items[k])\n\t\t// Find s := max { k | k <= this.lastIdx && !P(k) } and return this.data(s...this.lastIdx]\n\n\t\tlet endIdx = this.lastIdx;\n\t\twhile (endIdx >= 0 && predicate(this.items[endIdx])) {\n\t\t\tendIdx--;\n\t\t}\n\t\tconst result = endIdx === this.lastIdx ? null : this.items.slice(endIdx + 1, this.lastIdx + 1);\n\t\tthis.lastIdx = endIdx;\n\t\treturn result;\n\t}\n\n\tpeek(): T | undefined {\n\t\tif (this.length === 0) {\n\t\t\treturn undefined;\n\t\t}\n\t\treturn this.items[this.firstIdx];\n\t}\n\n\tdequeue(): T | undefined {\n\t\tconst result = this.items[this.firstIdx];\n\t\tthis.firstIdx++;\n\t\treturn result;\n\t}\n\n\ttakeCount(count: number): T[] {\n\t\tconst result = this.items.slice(this.firstIdx, this.firstIdx + count);\n\t\tthis.firstIdx += count;\n\t\treturn result;\n\t}\n}\n\n/**\n * This class is faster than an iterator and array for lazy computed data.\n*/\nexport class CallbackIterable<T> {\n\tpublic static readonly empty = new CallbackIterable<never>(_callback => { });\n\n\tconstructor(\n\t\t/**\n\t\t * Calls the callback for every item.\n\t\t * Stops when the callback returns false.\n\t\t*/\n\t\tpublic readonly iterate: (callback: (item: T) => boolean) => void\n\t) {\n\t}\n\n\ttoArray(): T[] {\n\t\tconst result: T[] = [];\n\t\tthis.iterate(item => { result.push(item); return true; });\n\t\treturn result;\n\t}\n\n\tfilter(predicate: (item: T) => boolean): CallbackIterable<T> {\n\t\treturn new CallbackIterable(cb => this.iterate(item => predicate(item) ? cb(item) : true));\n\t}\n\n\tmap<TResult>(mapFn: (item: T) => TResult): CallbackIterable<TResult> {\n\t\treturn new CallbackIterable<TResult>(cb => this.iterate(item => cb(mapFn(item))));\n\t}\n\n\tfindLast(predicate: (item: T) => boolean): T | undefined {\n\t\tlet result: T | undefined;\n\t\tthis.iterate(item => {\n\t\t\tif (predicate(item)) {\n\t\t\t\tresult = item;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t\treturn result;\n\t}\n\n\tfindLastMaxBy(comparator: Comparator<T>): T | undefined {\n\t\tlet result: T | undefined;\n\t\tlet first = true;\n\t\tthis.iterate(item => {\n\t\t\tif (first || CompareResult.isGreaterThan(comparator(item, result!))) {\n\t\t\t\tfirst = false;\n\t\t\t\tresult = item;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t\treturn result;\n\t}\n}\n\n/**\n * Represents a re-arrangement of items in an array.\n */\nexport class Permutation {\n\tconstructor(private readonly _indexMap: readonly number[]) { }\n\n\t/**\n\t * Returns a permutation that sorts the given array according to the given compare function.\n\t */\n\tpublic static createSortPermutation<T>(arr: readonly T[], compareFn: (a: T, b: T) => number): Permutation {\n\t\tconst sortIndices = Array.from(arr.keys()).sort((index1, index2) => compareFn(arr[index1], arr[index2]));\n\t\treturn new Permutation(sortIndices);\n\t}\n\n\t/**\n\t * Returns a new array with the elements of the given array re-arranged according to this permutation.\n\t */\n\tapply<T>(arr: readonly T[]): T[] {\n\t\treturn arr.map((_, index) => arr[this._indexMap[index]]);\n\t}\n\n\t/**\n\t * Returns a new permutation that undoes the re-arrangement of this permutation.\n\t*/\n\tinverse(): Permutation {\n\t\tconst inverseIndexMap = this._indexMap.slice();\n\t\tfor (let i = 0; i < this._indexMap.length; i++) {\n\t\t\tinverseIndexMap[this._indexMap[i]] = i;\n\t\t}\n\t\treturn new Permutation(inverseIndexMap);\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { Comparator } from './arrays';\n\nexport function findLast<T>(array: readonly T[], predicate: (item: T) => boolean): T | undefined {\n\tconst idx = findLastIdx(array, predicate);\n\tif (idx === -1) {\n\t\treturn undefined;\n\t}\n\treturn array[idx];\n}\n\nexport function findLastIdx<T>(array: readonly T[], predicate: (item: T) => boolean, fromIndex = array.length - 1): number {\n\tfor (let i = fromIndex; i >= 0; i--) {\n\t\tconst element = array[i];\n\n\t\tif (predicate(element)) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n/**\n * Finds the last item where predicate is true using binary search.\n * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!\n *\n * @returns `undefined` if no item matches, otherwise the last item that matches the predicate.\n */\nexport function findLastMonotonous<T>(array: readonly T[], predicate: (item: T) => boolean): T | undefined {\n\tconst idx = findLastIdxMonotonous(array, predicate);\n\treturn idx === -1 ? undefined : array[idx];\n}\n\n/**\n * Finds the last item where predicate is true using binary search.\n * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!\n *\n * @returns `startIdx - 1` if predicate is false for all items, otherwise the index of the last item that matches the predicate.\n */\nexport function findLastIdxMonotonous<T>(array: readonly T[], predicate: (item: T) => boolean, startIdx = 0, endIdxEx = array.length): number {\n\tlet i = startIdx;\n\tlet j = endIdxEx;\n\twhile (i < j) {\n\t\tconst k = Math.floor((i + j) / 2);\n\t\tif (predicate(array[k])) {\n\t\t\ti = k + 1;\n\t\t} else {\n\t\t\tj = k;\n\t\t}\n\t}\n\treturn i - 1;\n}\n\n/**\n * Finds the first item where predicate is true using binary search.\n * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[false, ..., false, true, ..., true]`!\n *\n * @returns `undefined` if no item matches, otherwise the first item that matches the predicate.\n */\nexport function findFirstMonotonous<T>(array: readonly T[], predicate: (item: T) => boolean): T | undefined {\n\tconst idx = findFirstIdxMonotonousOrArrLen(array, predicate);\n\treturn idx === array.length ? undefined : array[idx];\n}\n\n/**\n * Finds the first item where predicate is true using binary search.\n * `predicate` must be monotonous, i.e. `arr.map(predicate)` must be like `[false, ..., false, true, ..., true]`!\n *\n * @returns `endIdxEx` if predicate is false for all items, otherwise the index of the first item that matches the predicate.\n */\nexport function findFirstIdxMonotonousOrArrLen<T>(array: readonly T[], predicate: (item: T) => boolean, startIdx = 0, endIdxEx = array.length): number {\n\tlet i = startIdx;\n\tlet j = endIdxEx;\n\twhile (i < j) {\n\t\tconst k = Math.floor((i + j) / 2);\n\t\tif (predicate(array[k])) {\n\t\t\tj = k;\n\t\t} else {\n\t\t\ti = k + 1;\n\t\t}\n\t}\n\treturn i;\n}\n\n/**\n * Use this when\n * * You have a sorted array\n * * You query this array with a monotonous predicate to find the last item that has a certain property.\n * * You query this array multiple times with monotonous predicates that get weaker and weaker.\n */\nexport class MonotonousArray<T> {\n\tpublic static assertInvariants = false;\n\n\tprivate _findLastMonotonousLastIdx = 0;\n\tprivate _prevFindLastPredicate: ((item: T) => boolean) | undefined;\n\n\tconstructor(private readonly _array: readonly T[]) {\n\t}\n\n\t/**\n\t * The predicate must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!\n\t * For subsequent calls, current predicate must be weaker than (or equal to) the previous predicate, i.e. more entries must be `true`.\n\t */\n\tfindLastMonotonous(predicate: (item: T) => boolean): T | undefined {\n\t\tif (MonotonousArray.assertInvariants) {\n\t\t\tif (this._prevFindLastPredicate) {\n\t\t\t\tfor (const item of this._array) {\n\t\t\t\t\tif (this._prevFindLastPredicate(item) && !predicate(item)) {\n\t\t\t\t\t\tthrow new Error('MonotonousArray: current predicate must be weaker than (or equal to) the previous predicate.');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis._prevFindLastPredicate = predicate;\n\t\t}\n\n\t\tconst idx = findLastIdxMonotonous(this._array, predicate, this._findLastMonotonousLastIdx);\n\t\tthis._findLastMonotonousLastIdx = idx + 1;\n\t\treturn idx === -1 ? undefined : this._array[idx];\n\t}\n}\n\n/**\n * Returns the first item that is equal to or greater than every other item.\n*/\nexport function findFirstMax<T>(array: readonly T[], comparator: Comparator<T>): T | undefined {\n\tif (array.length === 0) {\n\t\treturn undefined;\n\t}\n\n\tlet max = array[0];\n\tfor (let i = 1; i < array.length; i++) {\n\t\tconst item = array[i];\n\t\tif (comparator(item, max) > 0) {\n\t\t\tmax = item;\n\t\t}\n\t}\n\treturn max;\n}\n\n/**\n * Returns the last item that is equal to or greater than every other item.\n*/\nexport function findLastMax<T>(array: readonly T[], comparator: Comparator<T>): T | undefined {\n\tif (array.length === 0) {\n\t\treturn undefined;\n\t}\n\n\tlet max = array[0];\n\tfor (let i = 1; i < array.length; i++) {\n\t\tconst item = array[i];\n\t\tif (comparator(item, max) >= 0) {\n\t\t\tmax = item;\n\t\t}\n\t}\n\treturn max;\n}\n\n/**\n * Returns the first item that is equal to or less than every other item.\n*/\nexport function findFirstMin<T>(array: readonly T[], comparator: Comparator<T>): T | undefined {\n\treturn findFirstMax(array, (a, b) => -comparator(a, b));\n}\n\nexport function findMaxIdx<T>(array: readonly T[], comparator: Comparator<T>): number {\n\tif (array.length === 0) {\n\t\treturn -1;\n\t}\n\n\tlet maxIdx = 0;\n\tfor (let i = 1; i < array.length; i++) {\n\t\tconst item = array[i];\n\t\tif (comparator(item, array[maxIdx]) > 0) {\n\t\t\tmaxIdx = i;\n\t\t}\n\t}\n\treturn maxIdx;\n}\n\n/**\n * Returns the first mapped value of the array which is not undefined.\n */\nexport function mapFindFirst<T, R>(items: Iterable<T>, mapFn: (value: T) => R | undefined): R | undefined {\n\tfor (const value of items) {\n\t\tconst mapped = mapFn(value);\n\t\tif (mapped !== undefined) {\n\t\t\treturn mapped;\n\t\t}\n\t}\n\n\treturn undefined;\n}\n","\n\nexport function identity<T>(t: T): T {\n\treturn t;\n}\n\ninterface ICacheOptions<TArg> {\n\t/**\n\t * The cache key is used to identify the cache entry.\n\t * Strict equality is used to compare cache keys.\n\t*/\n\tgetCacheKey: (arg: TArg) => unknown;\n}\n\n/**\n * Uses a LRU cache to make a given parametrized function cached.\n * Caches just the last key/value.\n*/\nexport class LRUCachedFunction<TArg, TComputed> {\n\tprivate lastCache: TComputed | undefined = undefined;\n\tprivate lastArgKey: unknown | undefined = undefined;\n\n\tprivate readonly _fn: (arg: TArg) => TComputed;\n\tprivate readonly _computeKey: (arg: TArg) => unknown;\n\n\tconstructor(fn: (arg: TArg) => TComputed);\n\tconstructor(options: ICacheOptions<TArg>, fn: (arg: TArg) => TComputed);\n\tconstructor(arg1: ICacheOptions<TArg> | ((arg: TArg) => TComputed), arg2?: (arg: TArg) => TComputed) {\n\t\tif (typeof arg1 === 'function') {\n\t\t\tthis._fn = arg1;\n\t\t\tthis._computeKey = identity;\n\t\t} else {\n\t\t\tthis._fn = arg2!;\n\t\t\tthis._computeKey = arg1.getCacheKey;\n\t\t}\n\t}\n\n\tpublic get(arg: TArg): TComputed {\n\t\tconst key = this._computeKey(arg);\n\t\tif (this.lastArgKey !== key) {\n\t\t\tthis.lastArgKey = key;\n\t\t\tthis.lastCache = this._fn(arg);\n\t\t}\n\t\treturn this.lastCache!;\n\t}\n}\n\n/**\n * Uses an unbounded cache to memoize the results of the given function.\n*/\nexport class CachedFunction<TArg, TComputed> {\n\tprivate readonly _map = new Map<TArg, TComputed>();\n\tprivate readonly _map2 = new Map<unknown, TComputed>();\n\tpublic get cachedValues(): ReadonlyMap<TArg, TComputed> {\n\t\treturn this._map;\n\t}\n\n\tprivate readonly _fn: (arg: TArg) => TComputed;\n\tprivate readonly _computeKey: (arg: TArg) => unknown;\n\n\tconstructor(fn: (arg: TArg) => TComputed);\n\tconstructor(options: ICacheOptions<TArg>, fn: (arg: TArg) => TComputed);\n\tconstructor(arg1: ICacheOptions<TArg> | ((arg: TArg) => TComputed), arg2?: (arg: TArg) => TComputed) {\n\t\tif (typeof arg1 === 'function') {\n\t\t\tthis._fn = arg1;\n\t\t\tthis._computeKey = identity;\n\t\t} else {\n\t\t\tthis._fn = arg2!;\n\t\t\tthis._computeKey = arg1.getCacheKey;\n\t\t}\n\t}\n\n\tpublic get(arg: TArg): TComputed {\n\t\tconst key = this._computeKey(arg);\n\t\tif (this._map2.has(key)) {\n\t\t\treturn this._map2.get(key)!;\n\t\t}\n\n\t\tconst value = this._fn(arg);\n\t\tthis._map.set(arg, value);\n\t\tthis._map2.set(key, value);\n\t\treturn value;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\n\nfunction roundFloat(number: number, decimalPoints: number): number {\n\tconst decimal = Math.pow(10, decimalPoints);\n\treturn Math.round(number * decimal) / decimal;\n}\n\nexport class RGBA {\n\t_rgbaBrand: void = undefined;\n\n\t/**\n\t * Red: integer in [0-255]\n\t */\n\treadonly r: number;\n\n\t/**\n\t * Green: integer in [0-255]\n\t */\n\treadonly g: number;\n\n\t/**\n\t * Blue: integer in [0-255]\n\t */\n\treadonly b: number;\n\n\t/**\n\t * Alpha: float in [0-1]\n\t */\n\treadonly a: number;\n\n\tconstructor(r: number, g: number, b: number, a: number = 1) {\n\t\tthis.r = Math.min(255, Math.max(0, r)) | 0;\n\t\tthis.g = Math.min(255, Math.max(0, g)) | 0;\n\t\tthis.b = Math.min(255, Math.max(0, b)) | 0;\n\t\tthis.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n\t}\n\n\tstatic equals(a: RGBA, b: RGBA): boolean {\n\t\treturn a.r === b.r && a.g === b.g && a.b === b.b && a.a === b.a;\n\t}\n}\n\nexport class HSLA {\n\n\t_hslaBrand: void = undefined;\n\n\t/**\n\t * Hue: integer in [0, 360]\n\t */\n\treadonly h: number;\n\n\t/**\n\t * Saturation: float in [0, 1]\n\t */\n\treadonly s: number;\n\n\t/**\n\t * Luminosity: float in [0, 1]\n\t */\n\treadonly l: number;\n\n\t/**\n\t * Alpha: float in [0, 1]\n\t */\n\treadonly a: number;\n\n\tconstructor(h: number, s: number, l: number, a: number) {\n\t\tthis.h = Math.max(Math.min(360, h), 0) | 0;\n\t\tthis.s = roundFloat(Math.max(Math.min(1, s), 0), 3);\n\t\tthis.l = roundFloat(Math.max(Math.min(1, l), 0), 3);\n\t\tthis.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n\t}\n\n\tstatic equals(a: HSLA, b: HSLA): boolean {\n\t\treturn a.h === b.h && a.s === b.s && a.l === b.l && a.a === b.a;\n\t}\n\n\t/**\n\t * Converts an RGB color value to HSL. Conversion formula\n\t * adapted from http://en.wikipedia.org/wiki/HSL_color_space.\n\t * Assumes r, g, and b are contained in the set [0, 255] and\n\t * returns h in the set [0, 360], s, and l in the set [0, 1].\n\t */\n\tstatic fromRGBA(rgba: RGBA): HSLA {\n\t\tconst r = rgba.r / 255;\n\t\tconst g = rgba.g / 255;\n\t\tconst b = rgba.b / 255;\n\t\tconst a = rgba.a;\n\n\t\tconst max = Math.max(r, g, b);\n\t\tconst min = Math.min(r, g, b);\n\t\tlet h = 0;\n\t\tlet s = 0;\n\t\tconst l = (min + max) / 2;\n\t\tconst chroma = max - min;\n\n\t\tif (chroma > 0) {\n\t\t\ts = Math.min((l <= 0.5 ? chroma / (2 * l) : chroma / (2 - (2 * l))), 1);\n\n\t\t\tswitch (max) {\n\t\t\t\tcase r: h = (g - b) / chroma + (g < b ? 6 : 0); break;\n\t\t\t\tcase g: h = (b - r) / chroma + 2; break;\n\t\t\t\tcase b: h = (r - g) / chroma + 4; break;\n\t\t\t}\n\n\t\t\th *= 60;\n\t\t\th = Math.round(h);\n\t\t}\n\t\treturn new HSLA(h, s, l, a);\n\t}\n\n\tprivate static _hue2rgb(p: number, q: number, t: number): number {\n\t\tif (t < 0) {\n\t\t\tt += 1;\n\t\t}\n\t\tif (t > 1) {\n\t\t\tt -= 1;\n\t\t}\n\t\tif (t < 1 / 6) {\n\t\t\treturn p + (q - p) * 6 * t;\n\t\t}\n\t\tif (t < 1 / 2) {\n\t\t\treturn q;\n\t\t}\n\t\tif (t < 2 / 3) {\n\t\t\treturn p + (q - p) * (2 / 3 - t) * 6;\n\t\t}\n\t\treturn p;\n\t}\n\n\t/**\n\t * Converts an HSL color value to RGB. Conversion formula\n\t * adapted from http://en.wikipedia.org/wiki/HSL_color_space.\n\t * Assumes h in the set [0, 360] s, and l are contained in the set [0, 1] and\n\t * returns r, g, and b in the set [0, 255].\n\t */\n\tstatic toRGBA(hsla: HSLA): RGBA {\n\t\tconst h = hsla.h / 360;\n\t\tconst { s, l, a } = hsla;\n\t\tlet r: number, g: number, b: number;\n\n\t\tif (s === 0) {\n\t\t\tr = g = b = l; // achromatic\n\t\t} else {\n\t\t\tconst q = l < 0.5 ? l * (1 + s) : l + s - l * s;\n\t\t\tconst p = 2 * l - q;\n\t\t\tr = HSLA._hue2rgb(p, q, h + 1 / 3);\n\t\t\tg = HSLA._hue2rgb(p, q, h);\n\t\t\tb = HSLA._hue2rgb(p, q, h - 1 / 3);\n\t\t}\n\n\t\treturn new RGBA(Math.round(r * 255), Math.round(g * 255), Math.round(b * 255), a);\n\t}\n}\n\nexport class HSVA {\n\n\t_hsvaBrand: void = undefined;\n\n\t/**\n\t * Hue: integer in [0, 360]\n\t */\n\treadonly h: number;\n\n\t/**\n\t * Saturation: float in [0, 1]\n\t */\n\treadonly s: number;\n\n\t/**\n\t * Value: float in [0, 1]\n\t */\n\treadonly v: number;\n\n\t/**\n\t * Alpha: float in [0, 1]\n\t */\n\treadonly a: number;\n\n\tconstructor(h: number, s: number, v: number, a: number) {\n\t\tthis.h = Math.max(Math.min(360, h), 0) | 0;\n\t\tthis.s = roundFloat(Math.max(Math.min(1, s), 0), 3);\n\t\tthis.v = roundFloat(Math.max(Math.min(1, v), 0), 3);\n\t\tthis.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n\t}\n\n\tstatic equals(a: HSVA, b: HSVA): boolean {\n\t\treturn a.h === b.h && a.s === b.s && a.v === b.v && a.a === b.a;\n\t}\n\n\t// from http://www.rapidtables.com/convert/color/rgb-to-hsv.htm\n\tstatic fromRGBA(rgba: RGBA): HSVA {\n\t\tconst r = rgba.r / 255;\n\t\tconst g = rgba.g / 255;\n\t\tconst b = rgba.b / 255;\n\t\tconst cmax = Math.max(r, g, b);\n\t\tconst cmin = Math.min(r, g, b);\n\t\tconst delta = cmax - cmin;\n\t\tconst s = cmax === 0 ? 0 : (delta / cmax);\n\t\tlet m: number;\n\n\t\tif (delta === 0) {\n\t\t\tm = 0;\n\t\t} else if (cmax === r) {\n\t\t\tm = ((((g - b) / delta) % 6) + 6) % 6;\n\t\t} else if (cmax === g) {\n\t\t\tm = ((b - r) / delta) + 2;\n\t\t} else {\n\t\t\tm = ((r - g) / delta) + 4;\n\t\t}\n\n\t\treturn new HSVA(Math.round(m * 60), s, cmax, rgba.a);\n\t}\n\n\t// from http://www.rapidtables.com/convert/color/hsv-to-rgb.htm\n\tstatic toRGBA(hsva: HSVA): RGBA {\n\t\tconst { h, s, v, a } = hsva;\n\t\tconst c = v * s;\n\t\tconst x = c * (1 - Math.abs((h / 60) % 2 - 1));\n\t\tconst m = v - c;\n\t\tlet [r, g, b] = [0, 0, 0];\n\n\t\tif (h < 60) {\n\t\t\tr = c;\n\t\t\tg = x;\n\t\t} else if (h < 120) {\n\t\t\tr = x;\n\t\t\tg = c;\n\t\t} else if (h < 180) {\n\t\t\tg = c;\n\t\t\tb = x;\n\t\t} else if (h < 240) {\n\t\t\tg = x;\n\t\t\tb = c;\n\t\t} else if (h < 300) {\n\t\t\tr = x;\n\t\t\tb = c;\n\t\t} else if (h <= 360) {\n\t\t\tr = c;\n\t\t\tb = x;\n\t\t}\n\n\t\tr = Math.round((r + m) * 255);\n\t\tg = Math.round((g + m) * 255);\n\t\tb = Math.round((b + m) * 255);\n\n\t\treturn new RGBA(r, g, b, a);\n\t}\n}\n\nexport class Color {\n\n\tstatic fromHex(hex: string): Color {\n\t\treturn Color.Format.CSS.parseHex(hex) || Color.red;\n\t}\n\n\tstatic equals(a: Color | null, b: Color | null): boolean {\n\t\tif (!a && !b) {\n\t\t\treturn true;\n\t\t}\n\t\tif (!a || !b) {\n\t\t\treturn false;\n\t\t}\n\t\treturn a.equals(b);\n\t}\n\n\treadonly rgba: RGBA;\n\tprivate _hsla?: HSLA;\n\tget hsla(): HSLA {\n\t\tif (this._hsla) {\n\t\t\treturn this._hsla;\n\t\t} else {\n\t\t\treturn HSLA.fromRGBA(this.rgba);\n\t\t}\n\t}\n\n\tprivate _hsva?: HSVA;\n\tget hsva(): HSVA {\n\t\tif (this._hsva) {\n\t\t\treturn this._hsva;\n\t\t}\n\t\treturn HSVA.fromRGBA(this.rgba);\n\t}\n\n\tconstructor(arg: RGBA | HSLA | HSVA) {\n\t\tif (!arg) {\n\t\t\tthrow new Error('Color needs a value');\n\t\t} else if (arg instanceof RGBA) {\n\t\t\tthis.rgba = arg;\n\t\t} else if (arg instanceof HSLA) {\n\t\t\tthis._hsla = arg;\n\t\t\tthis.rgba = HSLA.toRGBA(arg);\n\t\t} else if (arg instanceof HSVA) {\n\t\t\tthis._hsva = arg;\n\t\t\tthis.rgba = HSVA.toRGBA(arg);\n\t\t} else {\n\t\t\tthrow new Error('Invalid color ctor argument');\n\t\t}\n\t}\n\n\tequals(other: Color | null): boolean {\n\t\treturn !!other && RGBA.equals(this.rgba, other.rgba) && HSLA.equals(this.hsla, other.hsla) && HSVA.equals(this.hsva, other.hsva);\n\t}\n\n\t/**\n\t * http://www.w3.org/TR/WCAG20/#relativeluminancedef\n\t * Returns the number in the set [0, 1]. O => Darkest Black. 1 => Lightest white.\n\t */\n\tgetRelativeLuminance(): number {\n\t\tconst R = Color._relativeLuminanceForComponent(this.rgba.r);\n\t\tconst G = Color._relativeLuminanceForComponent(this.rgba.g);\n\t\tconst B = Color._relativeLuminanceForComponent(this.rgba.b);\n\t\tconst luminance = 0.2126 * R + 0.7152 * G + 0.0722 * B;\n\n\t\treturn roundFloat(luminance, 4);\n\t}\n\n\tprivate static _relativeLuminanceForComponent(color: number): number {\n\t\tconst c = color / 255;\n\t\treturn (c <= 0.03928) ? c / 12.92 : Math.pow(((c + 0.055) / 1.055), 2.4);\n\t}\n\n\t/**\n\t *\thttp://24ways.org/2010/calculating-color-contrast\n\t *  Return 'true' if lighter color otherwise 'false'\n\t */\n\tisLighter(): boolean {\n\t\tconst yiq = (this.rgba.r * 299 + this.rgba.g * 587 + this.rgba.b * 114) / 1000;\n\t\treturn yiq >= 128;\n\t}\n\n\tisLighterThan(another: Color): boolean {\n\t\tconst lum1 = this.getRelativeLuminance();\n\t\tconst lum2 = another.getRelativeLuminance();\n\t\treturn lum1 > lum2;\n\t}\n\n\tisDarkerThan(another: Color): boolean {\n\t\tconst lum1 = this.getRelativeLuminance();\n\t\tconst lum2 = another.getRelativeLuminance();\n\t\treturn lum1 < lum2;\n\t}\n\n\tlighten(factor: number): Color {\n\t\treturn new Color(new HSLA(this.hsla.h, this.hsla.s, this.hsla.l + this.hsla.l * factor, this.hsla.a));\n\t}\n\n\tdarken(factor: number): Color {\n\t\treturn new Color(new HSLA(this.hsla.h, this.hsla.s, this.hsla.l - this.hsla.l * factor, this.hsla.a));\n\t}\n\n\ttransparent(factor: number): Color {\n\t\tconst { r, g, b, a } = this.rgba;\n\t\treturn new Color(new RGBA(r, g, b, a * factor));\n\t}\n\n\tisTransparent(): boolean {\n\t\treturn this.rgba.a === 0;\n\t}\n\n\tisOpaque(): boolean {\n\t\treturn this.rgba.a === 1;\n\t}\n\n\topposite(): Color {\n\t\treturn new Color(new RGBA(255 - this.rgba.r, 255 - this.rgba.g, 255 - this.rgba.b, this.rgba.a));\n\t}\n\n\tmakeOpaque(opaqueBackground: Color): Color {\n\t\tif (this.isOpaque() || opaqueBackground.rgba.a !== 1) {\n\t\t\t// only allow to blend onto a non-opaque color onto a opaque color\n\t\t\treturn this;\n\t\t}\n\n\t\tconst { r, g, b, a } = this.rgba;\n\n\t\t// https://stackoverflow.com/questions/12228548/finding-equivalent-color-with-opacity\n\t\treturn new Color(new RGBA(\n\t\t\topaqueBackground.rgba.r - a * (opaqueBackground.rgba.r - r),\n\t\t\topaqueBackground.rgba.g - a * (opaqueBackground.rgba.g - g),\n\t\t\topaqueBackground.rgba.b - a * (opaqueBackground.rgba.b - b),\n\t\t\t1\n\t\t));\n\t}\n\n\tprivate _toString?: string;\n\ttoString(): string {\n\t\tif (!this._toString) {\n\t\t\tthis._toString = Color.Format.CSS.format(this);\n\t\t}\n\t\treturn this._toString;\n\t}\n\n\tstatic getLighterColor(of: Color, relative: Color, factor?: number): Color {\n\t\tif (of.isLighterThan(relative)) {\n\t\t\treturn of;\n\t\t}\n\t\tfactor = factor ? factor : 0.5;\n\t\tconst lum1 = of.getRelativeLuminance();\n\t\tconst lum2 = relative.getRelativeLuminance();\n\t\tfactor = factor * (lum2 - lum1) / lum2;\n\t\treturn of.lighten(factor);\n\t}\n\n\tstatic getDarkerColor(of: Color, relative: Color, factor?: number): Color {\n\t\tif (of.isDarkerThan(relative)) {\n\t\t\treturn of;\n\t\t}\n\t\tfactor = factor ? factor : 0.5;\n\t\tconst lum1 = of.getRelativeLuminance();\n\t\tconst lum2 = relative.getRelativeLuminance();\n\t\tfactor = factor * (lum1 - lum2) / lum1;\n\t\treturn of.darken(factor);\n\t}\n\n\tstatic readonly white = new Color(new RGBA(255, 255, 255, 1));\n\tstatic readonly black = new Color(new RGBA(0, 0, 0, 1));\n\tstatic readonly red = new Color(new RGBA(255, 0, 0, 1));\n\tstatic readonly blue = new Color(new RGBA(0, 0, 255, 1));\n\tstatic readonly green = new Color(new RGBA(0, 255, 0, 1));\n\tstatic readonly cyan = new Color(new RGBA(0, 255, 255, 1));\n\tstatic readonly lightgrey = new Color(new RGBA(211, 211, 211, 1));\n\tstatic readonly transparent = new Color(new RGBA(0, 0, 0, 0));\n}\n\nexport namespace Color {\n\texport namespace Format {\n\t\texport namespace CSS {\n\n\t\t\texport function formatRGB(color: Color): string {\n\t\t\t\tif (color.rgba.a === 1) {\n\t\t\t\t\treturn `rgb(${color.rgba.r}, ${color.rgba.g}, ${color.rgba.b})`;\n\t\t\t\t}\n\n\t\t\t\treturn Color.Format.CSS.formatRGBA(color);\n\t\t\t}\n\n\t\t\texport function formatRGBA(color: Color): string {\n\t\t\t\treturn `rgba(${color.rgba.r}, ${color.rgba.g}, ${color.rgba.b}, ${+(color.rgba.a).toFixed(2)})`;\n\t\t\t}\n\n\t\t\texport function formatHSL(color: Color): string {\n\t\t\t\tif (color.hsla.a === 1) {\n\t\t\t\t\treturn `hsl(${color.hsla.h}, ${(color.hsla.s * 100).toFixed(2)}%, ${(color.hsla.l * 100).toFixed(2)}%)`;\n\t\t\t\t}\n\n\t\t\t\treturn Color.Format.CSS.formatHSLA(color);\n\t\t\t}\n\n\t\t\texport function formatHSLA(color: Color): string {\n\t\t\t\treturn `hsla(${color.hsla.h}, ${(color.hsla.s * 100).toFixed(2)}%, ${(color.hsla.l * 100).toFixed(2)}%, ${color.hsla.a.toFixed(2)})`;\n\t\t\t}\n\n\t\t\tfunction _toTwoDigitHex(n: number): string {\n\t\t\t\tconst r = n.toString(16);\n\t\t\t\treturn r.length !== 2 ? '0' + r : r;\n\t\t\t}\n\n\t\t\t/**\n\t\t\t * Formats the color as #RRGGBB\n\t\t\t */\n\t\t\texport function formatHex(color: Color): string {\n\t\t\t\treturn `#${_toTwoDigitHex(color.rgba.r)}${_toTwoDigitHex(color.rgba.g)}${_toTwoDigitHex(color.rgba.b)}`;\n\t\t\t}\n\n\t\t\t/**\n\t\t\t * Formats the color as #RRGGBBAA\n\t\t\t * If 'compact' is set, colors without transparancy will be printed as #RRGGBB\n\t\t\t */\n\t\t\texport function formatHexA(color: Color, compact = false): string {\n\t\t\t\tif (compact && color.rgba.a === 1) {\n\t\t\t\t\treturn Color.Format.CSS.formatHex(color);\n\t\t\t\t}\n\n\t\t\t\treturn `#${_toTwoDigitHex(color.rgba.r)}${_toTwoDigitHex(color.rgba.g)}${_toTwoDigitHex(color.rgba.b)}${_toTwoDigitHex(Math.round(color.rgba.a * 255))}`;\n\t\t\t}\n\n\t\t\t/**\n\t\t\t * The default format will use HEX if opaque and RGBA otherwise.\n\t\t\t */\n\t\t\texport function format(color: Color): string {\n\t\t\t\tif (color.isOpaque()) {\n\t\t\t\t\treturn Color.Format.CSS.formatHex(color);\n\t\t\t\t}\n\n\t\t\t\treturn Color.Format.CSS.formatRGBA(color);\n\t\t\t}\n\n\t\t\t/**\n\t\t\t * Converts an Hex color value to a Color.\n\t\t\t * returns r, g, and b are contained in the set [0, 255]\n\t\t\t * @param hex string (#RGB, #RGBA, #RRGGBB or #RRGGBBAA).\n\t\t\t */\n\t\t\texport function parseHex(hex: string): Color | null {\n\t\t\t\tconst length = hex.length;\n\n\t\t\t\tif (length === 0) {\n\t\t\t\t\t// Invalid color\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\n\t\t\t\tif (hex.charCodeAt(0) !== CharCode.Hash) {\n\t\t\t\t\t// Does not begin with a #\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\n\t\t\t\tif (length === 7) {\n\t\t\t\t\t// #RRGGBB format\n\t\t\t\t\tconst r = 16 * _parseHexDigit(hex.charCodeAt(1)) + _parseHexDigit(hex.charCodeAt(2));\n\t\t\t\t\tconst g = 16 * _parseHexDigit(hex.charCodeAt(3)) + _parseHexDigit(hex.charCodeAt(4));\n\t\t\t\t\tconst b = 16 * _parseHexDigit(hex.charCodeAt(5)) + _parseHexDigit(hex.charCodeAt(6));\n\t\t\t\t\treturn new Color(new RGBA(r, g, b, 1));\n\t\t\t\t}\n\n\t\t\t\tif (length === 9) {\n\t\t\t\t\t// #RRGGBBAA format\n\t\t\t\t\tconst r = 16 * _parseHexDigit(hex.charCodeAt(1)) + _parseHexDigit(hex.charCodeAt(2));\n\t\t\t\t\tconst g = 16 * _parseHexDigit(hex.charCodeAt(3)) + _parseHexDigit(hex.charCodeAt(4));\n\t\t\t\t\tconst b = 16 * _parseHexDigit(hex.charCodeAt(5)) + _parseHexDigit(hex.charCodeAt(6));\n\t\t\t\t\tconst a = 16 * _parseHexDigit(hex.charCodeAt(7)) + _parseHexDigit(hex.charCodeAt(8));\n\t\t\t\t\treturn new Color(new RGBA(r, g, b, a / 255));\n\t\t\t\t}\n\n\t\t\t\tif (length === 4) {\n\t\t\t\t\t// #RGB format\n\t\t\t\t\tconst r = _parseHexDigit(hex.charCodeAt(1));\n\t\t\t\t\tconst g = _parseHexDigit(hex.charCodeAt(2));\n\t\t\t\t\tconst b = _parseHexDigit(hex.charCodeAt(3));\n\t\t\t\t\treturn new Color(new RGBA(16 * r + r, 16 * g + g, 16 * b + b));\n\t\t\t\t}\n\n\t\t\t\tif (length === 5) {\n\t\t\t\t\t// #RGBA format\n\t\t\t\t\tconst r = _parseHexDigit(hex.charCodeAt(1));\n\t\t\t\t\tconst g = _parseHexDigit(hex.charCodeAt(2));\n\t\t\t\t\tconst b = _parseHexDigit(hex.charCodeAt(3));\n\t\t\t\t\tconst a = _parseHexDigit(hex.charCodeAt(4));\n\t\t\t\t\treturn new Color(new RGBA(16 * r + r, 16 * g + g, 16 * b + b, (16 * a + a) / 255));\n\t\t\t\t}\n\n\t\t\t\t// Invalid color\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\tfunction _parseHexDigit(charCode: CharCode): number {\n\t\t\t\tswitch (charCode) {\n\t\t\t\t\tcase CharCode.Digit0: return 0;\n\t\t\t\t\tcase CharCode.Digit1: return 1;\n\t\t\t\t\tcase CharCode.Digit2: return 2;\n\t\t\t\t\tcase CharCode.Digit3: return 3;\n\t\t\t\t\tcase CharCode.Digit4: return 4;\n\t\t\t\t\tcase CharCode.Digit5: return 5;\n\t\t\t\t\tcase CharCode.Digit6: return 6;\n\t\t\t\t\tcase CharCode.Digit7: return 7;\n\t\t\t\t\tcase CharCode.Digit8: return 8;\n\t\t\t\t\tcase CharCode.Digit9: return 9;\n\t\t\t\t\tcase CharCode.a: return 10;\n\t\t\t\t\tcase CharCode.A: return 10;\n\t\t\t\t\tcase CharCode.b: return 11;\n\t\t\t\t\tcase CharCode.B: return 11;\n\t\t\t\t\tcase CharCode.c: return 12;\n\t\t\t\t\tcase CharCode.C: return 12;\n\t\t\t\t\tcase CharCode.d: return 13;\n\t\t\t\t\tcase CharCode.D: return 13;\n\t\t\t\t\tcase CharCode.e: return 14;\n\t\t\t\t\tcase CharCode.E: return 14;\n\t\t\t\t\tcase CharCode.f: return 15;\n\t\t\t\t\tcase CharCode.F: return 15;\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n/**\n * Represents information about a specific difference between two sequences.\n */\nexport class DiffChange {\n\n\t/**\n\t * The position of the first element in the original sequence which\n\t * this change affects.\n\t */\n\tpublic originalStart: number;\n\n\t/**\n\t * The number of elements from the original sequence which were\n\t * affected.\n\t */\n\tpublic originalLength: number;\n\n\t/**\n\t * The position of the first element in the modified sequence which\n\t * this change affects.\n\t */\n\tpublic modifiedStart: number;\n\n\t/**\n\t * The number of elements from the modified sequence which were\n\t * affected (added).\n\t */\n\tpublic modifiedLength: number;\n\n\t/**\n\t * Constructs a new DiffChange with the given sequence information\n\t * and content.\n\t */\n\tconstructor(originalStart: number, originalLength: number, modifiedStart: number, modifiedLength: number) {\n\t\t//Debug.Assert(originalLength > 0 || modifiedLength > 0, \"originalLength and modifiedLength cannot both be <= 0\");\n\t\tthis.originalStart = originalStart;\n\t\tthis.originalLength = originalLength;\n\t\tthis.modifiedStart = modifiedStart;\n\t\tthis.modifiedLength = modifiedLength;\n\t}\n\n\t/**\n\t * The end point (exclusive) of the change in the original sequence.\n\t */\n\tpublic getOriginalEnd() {\n\t\treturn this.originalStart + this.originalLength;\n\t}\n\n\t/**\n\t * The end point (exclusive) of the change in the modified sequence.\n\t */\n\tpublic getModifiedEnd() {\n\t\treturn this.modifiedStart + this.modifiedLength;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nexport interface ErrorListenerCallback {\n\t(error: any): void;\n}\n\n// Avoid circular dependency on EventEmitter by implementing a subset of the interface.\nexport class ErrorHandler {\n\tprivate unexpectedErrorHandler: (e: any) => void;\n\tprivate listeners: ErrorListenerCallback[];\n\n\tconstructor() {\n\n\t\tthis.listeners = [];\n\n\t\tthis.unexpectedErrorHandler = function (e: any) {\n\t\t\tsetTimeout(() => {\n\t\t\t\tif (e.stack) {\n\t\t\t\t\tif (ErrorNoTelemetry.isErrorNoTelemetry(e)) {\n\t\t\t\t\t\tthrow new ErrorNoTelemetry(e.message + '\\n\\n' + e.stack);\n\t\t\t\t\t}\n\n\t\t\t\t\tthrow new Error(e.message + '\\n\\n' + e.stack);\n\t\t\t\t}\n\n\t\t\t\tthrow e;\n\t\t\t}, 0);\n\t\t};\n\t}\n\n\tprivate emit(e: any): void {\n\t\tthis.listeners.forEach((listener) => {\n\t\t\tlistener(e);\n\t\t});\n\t}\n\n\tonUnexpectedError(e: any): void {\n\t\tthis.unexpectedErrorHandler(e);\n\t\tthis.emit(e);\n\t}\n\n\t// For external errors, we don't want the listeners to be called\n\tonUnexpectedExternalError(e: any): void {\n\t\tthis.unexpectedErrorHandler(e);\n\t}\n}\n\nexport const errorHandler = new ErrorHandler();\n\nexport function onUnexpectedError(e: any): undefined {\n\t// ignore errors from cancelled promises\n\tif (!isCancellationError(e)) {\n\t\terrorHandler.onUnexpectedError(e);\n\t}\n\treturn undefined;\n}\n\nexport function onUnexpectedExternalError(e: any): undefined {\n\t// ignore errors from cancelled promises\n\tif (!isCancellationError(e)) {\n\t\terrorHandler.onUnexpectedExternalError(e);\n\t}\n\treturn undefined;\n}\n\nexport interface SerializedError {\n}\n\nexport function transformErrorForSerialization(error: Error): SerializedError;\nexport function transformErrorForSerialization(error: any): any;\nexport function transformErrorForSerialization(error: any): any {\n\tif (error instanceof Error) {\n\t\tconst { name, message } = error;\n\t\tconst stack: string = (<any>error).stacktrace || (<any>error).stack;\n\t\treturn {\n\t\t\t$isError: true,\n\t\t\tname,\n\t\t\tmessage,\n\t\t\tstack,\n\t\t\tnoTelemetry: ErrorNoTelemetry.isErrorNoTelemetry(error)\n\t\t};\n\t}\n\n\t// return as is\n\treturn error;\n}\n\nconst canceledName = 'Canceled';\n\n/**\n * Checks if the given error is a promise in canceled state\n */\nexport function isCancellationError(error: any): boolean {\n\tif (error instanceof CancellationError) {\n\t\treturn true;\n\t}\n\treturn error instanceof Error && error.name === canceledName && error.message === canceledName;\n}\n\n// !!!IMPORTANT!!!\n// Do NOT change this class because it is also used as an API-type.\nexport class CancellationError extends Error {\n\tconstructor() {\n\t\tsuper(canceledName);\n\t\tthis.name = this.message;\n\t}\n}\n\n/**\n * @deprecated use {@link CancellationError `new CancellationError()`} instead\n */\nexport function canceled(): Error {\n\tconst error = new Error(canceledName);\n\terror.name = error.message;\n\treturn error;\n}\n\nexport function illegalArgument(name?: string): Error {\n\tif (name) {\n\t\treturn new Error(`Illegal argument: ${name}`);\n\t} else {\n\t\treturn new Error('Illegal argument');\n\t}\n}\n\nexport function illegalState(name?: string): Error {\n\tif (name) {\n\t\treturn new Error(`Illegal state: ${name}`);\n\t} else {\n\t\treturn new Error('Illegal state');\n\t}\n}\n\nexport class NotSupportedError extends Error {\n\tconstructor(message?: string) {\n\t\tsuper('NotSupported');\n\t\tif (message) {\n\t\t\tthis.message = message;\n\t\t}\n\t}\n}\n\n/**\n * Error that when thrown won't be logged in telemetry as an unhandled error.\n */\nexport class ErrorNoTelemetry extends Error {\n\toverride readonly name: string;\n\n\tconstructor(msg?: string) {\n\t\tsuper(msg);\n\t\tthis.name = 'CodeExpectedError';\n\t}\n\n\tpublic static fromError(err: Error): ErrorNoTelemetry {\n\t\tif (err instanceof ErrorNoTelemetry) {\n\t\t\treturn err;\n\t\t}\n\n\t\tconst result = new ErrorNoTelemetry();\n\t\tresult.message = err.message;\n\t\tresult.stack = err.stack;\n\t\treturn result;\n\t}\n\n\tpublic static isErrorNoTelemetry(err: Error): err is ErrorNoTelemetry {\n\t\treturn err.name === 'CodeExpectedError';\n\t}\n}\n\n/**\n * This error indicates a bug.\n * Do not throw this for invalid user input.\n * Only catch this error to recover gracefully from bugs.\n */\nexport class BugIndicatingError extends Error {\n\tconstructor(message?: string) {\n\t\tsuper(message || 'An unexpected bug occurred.');\n\t\tObject.setPrototypeOf(this, BugIndicatingError.prototype);\n\n\t\t// Because we know for sure only buggy code throws this,\n\t\t// we definitely want to break here and fix the bug.\n\t\t// eslint-disable-next-line no-debugger\n\t\t// debugger;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { BugIndicatingError, onUnexpectedError } from 'vs/base/common/errors';\n\n/**\n * Throws an error with the provided message if the provided value does not evaluate to a true Javascript value.\n *\n * @deprecated Use `assert(...)` instead.\n * This method is usually used like this:\n * ```ts\n * import * as assert from 'vs/base/common/assert';\n * assert.ok(...);\n * ```\n *\n * However, `assert` in that example is a user chosen name.\n * There is no tooling for generating such an import statement.\n * Thus, the `assert(...)` function should be used instead.\n */\nexport function ok(value?: unknown, message?: string) {\n\tif (!value) {\n\t\tthrow new Error(message ? `Assertion failed (${message})` : 'Assertion Failed');\n\t}\n}\n\nexport function assertNever(value: never, message = 'Unreachable'): never {\n\tthrow new Error(message);\n}\n\n/**\n * Like assert, but doesn't throw.\n */\nexport function softAssert(condition: boolean): void {\n\tif (!condition) {\n\t\tonUnexpectedError(new BugIndicatingError('Soft Assertion Failed'));\n\t}\n}\n\n/**\n * condition must be side-effect free!\n */\nexport function assertFn(condition: () => boolean): void {\n\tif (!condition()) {\n\t\t// eslint-disable-next-line no-debugger\n\t\tdebugger;\n\t\t// Reevaluate `condition` again to make debugging easier\n\t\tcondition();\n\t\tonUnexpectedError(new BugIndicatingError('Assertion Failed'));\n\t}\n}\n\nexport function checkAdjacentItems<T>(items: readonly T[], predicate: (item1: T, item2: T) => boolean): boolean {\n\tlet i = 0;\n\twhile (i < items.length - 1) {\n\t\tconst a = items[i];\n\t\tconst b = items[i + 1];\n\t\tif (!predicate(a, b)) {\n\t\t\treturn false;\n\t\t}\n\t\ti++;\n\t}\n\treturn true;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n/**\n * Given a function, returns a function that is only calling that function once.\n */\nexport function createSingleCallFunction<T extends Function>(this: unknown, fn: T, fnDidRunCallback?: () => void): T {\n\tconst _this = this;\n\tlet didCall = false;\n\tlet result: unknown;\n\n\treturn function () {\n\t\tif (didCall) {\n\t\t\treturn result;\n\t\t}\n\n\t\tdidCall = true;\n\t\tif (fnDidRunCallback) {\n\t\t\ttry {\n\t\t\t\tresult = fn.apply(_this, arguments);\n\t\t\t} finally {\n\t\t\t\tfnDidRunCallback();\n\t\t\t}\n\t\t} else {\n\t\t\tresult = fn.apply(_this, arguments);\n\t\t}\n\n\t\treturn result;\n\t} as unknown as T;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nexport namespace Iterable {\n\n\texport function is<T = any>(thing: any): thing is Iterable<T> {\n\t\treturn thing && typeof thing === 'object' && typeof thing[Symbol.iterator] === 'function';\n\t}\n\n\tconst _empty: Iterable<any> = Object.freeze([]);\n\texport function empty<T = any>(): Iterable<T> {\n\t\treturn _empty;\n\t}\n\n\texport function* single<T>(element: T): Iterable<T> {\n\t\tyield element;\n\t}\n\n\texport function wrap<T>(iterableOrElement: Iterable<T> | T): Iterable<T> {\n\t\tif (is(iterableOrElement)) {\n\t\t\treturn iterableOrElement;\n\t\t} else {\n\t\t\treturn single(iterableOrElement);\n\t\t}\n\t}\n\n\texport function from<T>(iterable: Iterable<T> | undefined | null): Iterable<T> {\n\t\treturn iterable || _empty;\n\t}\n\n\texport function* reverse<T>(array: Array<T>): Iterable<T> {\n\t\tfor (let i = array.length - 1; i >= 0; i--) {\n\t\t\tyield array[i];\n\t\t}\n\t}\n\n\texport function isEmpty<T>(iterable: Iterable<T> | undefined | null): boolean {\n\t\treturn !iterable || iterable[Symbol.iterator]().next().done === true;\n\t}\n\n\texport function first<T>(iterable: Iterable<T>): T | undefined {\n\t\treturn iterable[Symbol.iterator]().next().value;\n\t}\n\n\texport function some<T>(iterable: Iterable<T>, predicate: (t: T, i: number) => unknown): boolean {\n\t\tlet i = 0;\n\t\tfor (const element of iterable) {\n\t\t\tif (predicate(element, i++)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\texport function find<T, R extends T>(iterable: Iterable<T>, predicate: (t: T) => t is R): R | undefined;\n\texport function find<T>(iterable: Iterable<T>, predicate: (t: T) => boolean): T | undefined;\n\texport function find<T>(iterable: Iterable<T>, predicate: (t: T) => boolean): T | undefined {\n\t\tfor (const element of iterable) {\n\t\t\tif (predicate(element)) {\n\t\t\t\treturn element;\n\t\t\t}\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\texport function filter<T, R extends T>(iterable: Iterable<T>, predicate: (t: T) => t is R): Iterable<R>;\n\texport function filter<T>(iterable: Iterable<T>, predicate: (t: T) => boolean): Iterable<T>;\n\texport function* filter<T>(iterable: Iterable<T>, predicate: (t: T) => boolean): Iterable<T> {\n\t\tfor (const element of iterable) {\n\t\t\tif (predicate(element)) {\n\t\t\t\tyield element;\n\t\t\t}\n\t\t}\n\t}\n\n\texport function* map<T, R>(iterable: Iterable<T>, fn: (t: T, index: number) => R): Iterable<R> {\n\t\tlet index = 0;\n\t\tfor (const element of iterable) {\n\t\t\tyield fn(element, index++);\n\t\t}\n\t}\n\n\texport function* flatMap<T, R>(iterable: Iterable<T>, fn: (t: T, index: number) => Iterable<R>): Iterable<R> {\n\t\tlet index = 0;\n\t\tfor (const element of iterable) {\n\t\t\tyield* fn(element, index++);\n\t\t}\n\t}\n\n\texport function* concat<T>(...iterables: Iterable<T>[]): Iterable<T> {\n\t\tfor (const iterable of iterables) {\n\t\t\tyield* iterable;\n\t\t}\n\t}\n\n\texport function reduce<T, R>(iterable: Iterable<T>, reducer: (previousValue: R, currentValue: T) => R, initialValue: R): R {\n\t\tlet value = initialValue;\n\t\tfor (const element of iterable) {\n\t\t\tvalue = reducer(value, element);\n\t\t}\n\t\treturn value;\n\t}\n\n\t/**\n\t * Returns an iterable slice of the array, with the same semantics as `array.slice()`.\n\t */\n\texport function* slice<T>(arr: ReadonlyArray<T>, from: number, to = arr.length): Iterable<T> {\n\t\tif (from < 0) {\n\t\t\tfrom += arr.length;\n\t\t}\n\n\t\tif (to < 0) {\n\t\t\tto += arr.length;\n\t\t} else if (to > arr.length) {\n\t\t\tto = arr.length;\n\t\t}\n\n\t\tfor (; from < to; from++) {\n\t\t\tyield arr[from];\n\t\t}\n\t}\n\n\t/**\n\t * Consumes `atMost` elements from iterable and returns the consumed elements,\n\t * and an iterable for the rest of the elements.\n\t */\n\texport function consume<T>(iterable: Iterable<T>, atMost: number = Number.POSITIVE_INFINITY): [T[], Iterable<T>] {\n\t\tconst consumed: T[] = [];\n\n\t\tif (atMost === 0) {\n\t\t\treturn [consumed, iterable];\n\t\t}\n\n\t\tconst iterator = iterable[Symbol.iterator]();\n\n\t\tfor (let i = 0; i < atMost; i++) {\n\t\t\tconst next = iterator.next();\n\n\t\t\tif (next.done) {\n\t\t\t\treturn [consumed, Iterable.empty()];\n\t\t\t}\n\n\t\t\tconsumed.push(next.value);\n\t\t}\n\n\t\treturn [consumed, { [Symbol.iterator]() { return iterator; } }];\n\t}\n\n\texport async function asyncToArray<T>(iterable: AsyncIterable<T>): Promise<T[]> {\n\t\tconst result: T[] = [];\n\t\tfor await (const item of iterable) {\n\t\t\tresult.push(item);\n\t\t}\n\t\treturn Promise.resolve(result);\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n/**\n * Virtual Key Codes, the value does not hold any inherent meaning.\n * Inspired somewhat from https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx\n * But these are \"more general\", as they should work across browsers & OS`s.\n */\nexport const enum KeyCode {\n\tDependsOnKbLayout = -1,\n\n\t/**\n\t * Placed first to cover the 0 value of the enum.\n\t */\n\tUnknown = 0,\n\n\tBackspace,\n\tTab,\n\tEnter,\n\tShift,\n\tCtrl,\n\tAlt,\n\tPauseBreak,\n\tCapsLock,\n\tEscape,\n\tSpace,\n\tPageUp,\n\tPageDown,\n\tEnd,\n\tHome,\n\tLeftArrow,\n\tUpArrow,\n\tRightArrow,\n\tDownArrow,\n\tInsert,\n\tDelete,\n\n\tDigit0,\n\tDigit1,\n\tDigit2,\n\tDigit3,\n\tDigit4,\n\tDigit5,\n\tDigit6,\n\tDigit7,\n\tDigit8,\n\tDigit9,\n\n\tKeyA,\n\tKeyB,\n\tKeyC,\n\tKeyD,\n\tKeyE,\n\tKeyF,\n\tKeyG,\n\tKeyH,\n\tKeyI,\n\tKeyJ,\n\tKeyK,\n\tKeyL,\n\tKeyM,\n\tKeyN,\n\tKeyO,\n\tKeyP,\n\tKeyQ,\n\tKeyR,\n\tKeyS,\n\tKeyT,\n\tKeyU,\n\tKeyV,\n\tKeyW,\n\tKeyX,\n\tKeyY,\n\tKeyZ,\n\n\tMeta,\n\tContextMenu,\n\n\tF1,\n\tF2,\n\tF3,\n\tF4,\n\tF5,\n\tF6,\n\tF7,\n\tF8,\n\tF9,\n\tF10,\n\tF11,\n\tF12,\n\tF13,\n\tF14,\n\tF15,\n\tF16,\n\tF17,\n\tF18,\n\tF19,\n\tF20,\n\tF21,\n\tF22,\n\tF23,\n\tF24,\n\n\tNumLock,\n\tScrollLock,\n\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the ';:' key\n\t */\n\tSemicolon,\n\t/**\n\t * For any country/region, the '+' key\n\t * For the US standard keyboard, the '=+' key\n\t */\n\tEqual,\n\t/**\n\t * For any country/region, the ',' key\n\t * For the US standard keyboard, the ',<' key\n\t */\n\tComma,\n\t/**\n\t * For any country/region, the '-' key\n\t * For the US standard keyboard, the '-_' key\n\t */\n\tMinus,\n\t/**\n\t * For any country/region, the '.' key\n\t * For the US standard keyboard, the '.>' key\n\t */\n\tPeriod,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the '/?' key\n\t */\n\tSlash,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the '`~' key\n\t */\n\tBackquote,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the '[{' key\n\t */\n\tBracketLeft,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the '\\|' key\n\t */\n\tBackslash,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the ']}' key\n\t */\n\tBracketRight,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the ''\"' key\n\t */\n\tQuote,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t */\n\tOEM_8,\n\t/**\n\t * Either the angle bracket key or the backslash key on the RT 102-key keyboard.\n\t */\n\tIntlBackslash,\n\n\tNumpad0, // VK_NUMPAD0, 0x60, Numeric keypad 0 key\n\tNumpad1, // VK_NUMPAD1, 0x61, Numeric keypad 1 key\n\tNumpad2, // VK_NUMPAD2, 0x62, Numeric keypad 2 key\n\tNumpad3, // VK_NUMPAD3, 0x63, Numeric keypad 3 key\n\tNumpad4, // VK_NUMPAD4, 0x64, Numeric keypad 4 key\n\tNumpad5, // VK_NUMPAD5, 0x65, Numeric keypad 5 key\n\tNumpad6, // VK_NUMPAD6, 0x66, Numeric keypad 6 key\n\tNumpad7, // VK_NUMPAD7, 0x67, Numeric keypad 7 key\n\tNumpad8, // VK_NUMPAD8, 0x68, Numeric keypad 8 key\n\tNumpad9, // VK_NUMPAD9, 0x69, Numeric keypad 9 key\n\n\tNumpadMultiply,\t// VK_MULTIPLY, 0x6A, Multiply key\n\tNumpadAdd,\t\t// VK_ADD, 0x6B, Add key\n\tNUMPAD_SEPARATOR,\t// VK_SEPARATOR, 0x6C, Separator key\n\tNumpadSubtract,\t// VK_SUBTRACT, 0x6D, Subtract key\n\tNumpadDecimal,\t// VK_DECIMAL, 0x6E, Decimal key\n\tNumpadDivide,\t// VK_DIVIDE, 0x6F,\n\n\t/**\n\t * Cover all key codes when IME is processing input.\n\t */\n\tKEY_IN_COMPOSITION,\n\n\tABNT_C1, // Brazilian (ABNT) Keyboard\n\tABNT_C2, // Brazilian (ABNT) Keyboard\n\n\tAudioVolumeMute,\n\tAudioVolumeUp,\n\tAudioVolumeDown,\n\n\tBrowserSearch,\n\tBrowserHome,\n\tBrowserBack,\n\tBrowserForward,\n\n\tMediaTrackNext,\n\tMediaTrackPrevious,\n\tMediaStop,\n\tMediaPlayPause,\n\tLaunchMediaPlayer,\n\tLaunchMail,\n\tLaunchApp2,\n\n\t/**\n\t * VK_CLEAR, 0x0C, CLEAR key\n\t */\n\tClear,\n\n\t/**\n\t * Placed last to cover the length of the enum.\n\t * Please do not depend on this value!\n\t */\n\tMAX_VALUE\n}\n\n/**\n * keyboardEvent.code\n */\nexport const enum ScanCode {\n\tDependsOnKbLayout = -1,\n\tNone,\n\tHyper,\n\tSuper,\n\tFn,\n\tFnLock,\n\tSuspend,\n\tResume,\n\tTurbo,\n\tSleep,\n\tWakeUp,\n\tKeyA,\n\tKeyB,\n\tKeyC,\n\tKeyD,\n\tKeyE,\n\tKeyF,\n\tKeyG,\n\tKeyH,\n\tKeyI,\n\tKeyJ,\n\tKeyK,\n\tKeyL,\n\tKeyM,\n\tKeyN,\n\tKeyO,\n\tKeyP,\n\tKeyQ,\n\tKeyR,\n\tKeyS,\n\tKeyT,\n\tKeyU,\n\tKeyV,\n\tKeyW,\n\tKeyX,\n\tKeyY,\n\tKeyZ,\n\tDigit1,\n\tDigit2,\n\tDigit3,\n\tDigit4,\n\tDigit5,\n\tDigit6,\n\tDigit7,\n\tDigit8,\n\tDigit9,\n\tDigit0,\n\tEnter,\n\tEscape,\n\tBackspace,\n\tTab,\n\tSpace,\n\tMinus,\n\tEqual,\n\tBracketLeft,\n\tBracketRight,\n\tBackslash,\n\tIntlHash,\n\tSemicolon,\n\tQuote,\n\tBackquote,\n\tComma,\n\tPeriod,\n\tSlash,\n\tCapsLock,\n\tF1,\n\tF2,\n\tF3,\n\tF4,\n\tF5,\n\tF6,\n\tF7,\n\tF8,\n\tF9,\n\tF10,\n\tF11,\n\tF12,\n\tPrintScreen,\n\tScrollLock,\n\tPause,\n\tInsert,\n\tHome,\n\tPageUp,\n\tDelete,\n\tEnd,\n\tPageDown,\n\tArrowRight,\n\tArrowLeft,\n\tArrowDown,\n\tArrowUp,\n\tNumLock,\n\tNumpadDivide,\n\tNumpadMultiply,\n\tNumpadSubtract,\n\tNumpadAdd,\n\tNumpadEnter,\n\tNumpad1,\n\tNumpad2,\n\tNumpad3,\n\tNumpad4,\n\tNumpad5,\n\tNumpad6,\n\tNumpad7,\n\tNumpad8,\n\tNumpad9,\n\tNumpad0,\n\tNumpadDecimal,\n\tIntlBackslash,\n\tContextMenu,\n\tPower,\n\tNumpadEqual,\n\tF13,\n\tF14,\n\tF15,\n\tF16,\n\tF17,\n\tF18,\n\tF19,\n\tF20,\n\tF21,\n\tF22,\n\tF23,\n\tF24,\n\tOpen,\n\tHelp,\n\tSelect,\n\tAgain,\n\tUndo,\n\tCut,\n\tCopy,\n\tPaste,\n\tFind,\n\tAudioVolumeMute,\n\tAudioVolumeUp,\n\tAudioVolumeDown,\n\tNumpadComma,\n\tIntlRo,\n\tKanaMode,\n\tIntlYen,\n\tConvert,\n\tNonConvert,\n\tLang1,\n\tLang2,\n\tLang3,\n\tLang4,\n\tLang5,\n\tAbort,\n\tProps,\n\tNumpadParenLeft,\n\tNumpadParenRight,\n\tNumpadBackspace,\n\tNumpadMemoryStore,\n\tNumpadMemoryRecall,\n\tNumpadMemoryClear,\n\tNumpadMemoryAdd,\n\tNumpadMemorySubtract,\n\tNumpadClear,\n\tNumpadClearEntry,\n\tControlLeft,\n\tShiftLeft,\n\tAltLeft,\n\tMetaLeft,\n\tControlRight,\n\tShiftRight,\n\tAltRight,\n\tMetaRight,\n\tBrightnessUp,\n\tBrightnessDown,\n\tMediaPlay,\n\tMediaRecord,\n\tMediaFastForward,\n\tMediaRewind,\n\tMediaTrackNext,\n\tMediaTrackPrevious,\n\tMediaStop,\n\tEject,\n\tMediaPlayPause,\n\tMediaSelect,\n\tLaunchMail,\n\tLaunchApp2,\n\tLaunchApp1,\n\tSelectTask,\n\tLaunchScreenSaver,\n\tBrowserSearch,\n\tBrowserHome,\n\tBrowserBack,\n\tBrowserForward,\n\tBrowserStop,\n\tBrowserRefresh,\n\tBrowserFavorites,\n\tZoomToggle,\n\tMailReply,\n\tMailForward,\n\tMailSend,\n\n\tMAX_VALUE\n}\n\nclass KeyCodeStrMap {\n\n\tpublic _keyCodeToStr: string[];\n\tpublic _strToKeyCode: { [str: string]: KeyCode };\n\n\tconstructor() {\n\t\tthis._keyCodeToStr = [];\n\t\tthis._strToKeyCode = Object.create(null);\n\t}\n\n\tdefine(keyCode: KeyCode, str: string): void {\n\t\tthis._keyCodeToStr[keyCode] = str;\n\t\tthis._strToKeyCode[str.toLowerCase()] = keyCode;\n\t}\n\n\tkeyCodeToStr(keyCode: KeyCode): string {\n\t\treturn this._keyCodeToStr[keyCode];\n\t}\n\n\tstrToKeyCode(str: string): KeyCode {\n\t\treturn this._strToKeyCode[str.toLowerCase()] || KeyCode.Unknown;\n\t}\n}\n\nconst uiMap = new KeyCodeStrMap();\nconst userSettingsUSMap = new KeyCodeStrMap();\nconst userSettingsGeneralMap = new KeyCodeStrMap();\nexport const EVENT_KEY_CODE_MAP: { [keyCode: number]: KeyCode } = new Array(230);\nexport const NATIVE_WINDOWS_KEY_CODE_TO_KEY_CODE: { [nativeKeyCode: string]: KeyCode } = {};\nconst scanCodeIntToStr: string[] = [];\nconst scanCodeStrToInt: { [code: string]: number } = Object.create(null);\nconst scanCodeLowerCaseStrToInt: { [code: string]: number } = Object.create(null);\n\n/**\n * -1 if a ScanCode => KeyCode mapping depends on kb layout.\n */\nexport const IMMUTABLE_CODE_TO_KEY_CODE: KeyCode[] = [];\n\n/**\n * -1 if a KeyCode => ScanCode mapping depends on kb layout.\n */\nexport const IMMUTABLE_KEY_CODE_TO_CODE: ScanCode[] = [];\n\nfor (let i = 0; i <= ScanCode.MAX_VALUE; i++) {\n\tIMMUTABLE_CODE_TO_KEY_CODE[i] = KeyCode.DependsOnKbLayout;\n}\n\nfor (let i = 0; i <= KeyCode.MAX_VALUE; i++) {\n\tIMMUTABLE_KEY_CODE_TO_CODE[i] = ScanCode.DependsOnKbLayout;\n}\n\n(function () {\n\n\t// See https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx\n\t// See https://github.com/microsoft/node-native-keymap/blob/88c0b0e5/deps/chromium/keyboard_codes_win.h\n\n\tconst empty = '';\n\ttype IMappingEntry = [0 | 1, ScanCode, string, KeyCode, string, number, string, string, string];\n\tconst mappings: IMappingEntry[] = [\n\t\t// immutable, scanCode, scanCodeStr, keyCode, keyCodeStr, eventKeyCode, vkey, usUserSettingsLabel, generalUserSettingsLabel\n\t\t[1, ScanCode.None, 'None', KeyCode.Unknown, 'unknown', 0, 'VK_UNKNOWN', empty, empty],\n\t\t[1, ScanCode.Hyper, 'Hyper', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Super, 'Super', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Fn, 'Fn', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.FnLock, 'FnLock', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Suspend, 'Suspend', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Resume, 'Resume', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Turbo, 'Turbo', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Sleep, 'Sleep', KeyCode.Unknown, empty, 0, 'VK_SLEEP', empty, empty],\n\t\t[1, ScanCode.WakeUp, 'WakeUp', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[0, ScanCode.KeyA, 'KeyA', KeyCode.KeyA, 'A', 65, 'VK_A', empty, empty],\n\t\t[0, ScanCode.KeyB, 'KeyB', KeyCode.KeyB, 'B', 66, 'VK_B', empty, empty],\n\t\t[0, ScanCode.KeyC, 'KeyC', KeyCode.KeyC, 'C', 67, 'VK_C', empty, empty],\n\t\t[0, ScanCode.KeyD, 'KeyD', KeyCode.KeyD, 'D', 68, 'VK_D', empty, empty],\n\t\t[0, ScanCode.KeyE, 'KeyE', KeyCode.KeyE, 'E', 69, 'VK_E', empty, empty],\n\t\t[0, ScanCode.KeyF, 'KeyF', KeyCode.KeyF, 'F', 70, 'VK_F', empty, empty],\n\t\t[0, ScanCode.KeyG, 'KeyG', KeyCode.KeyG, 'G', 71, 'VK_G', empty, empty],\n\t\t[0, ScanCode.KeyH, 'KeyH', KeyCode.KeyH, 'H', 72, 'VK_H', empty, empty],\n\t\t[0, ScanCode.KeyI, 'KeyI', KeyCode.KeyI, 'I', 73, 'VK_I', empty, empty],\n\t\t[0, ScanCode.KeyJ, 'KeyJ', KeyCode.KeyJ, 'J', 74, 'VK_J', empty, empty],\n\t\t[0, ScanCode.KeyK, 'KeyK', KeyCode.KeyK, 'K', 75, 'VK_K', empty, empty],\n\t\t[0, ScanCode.KeyL, 'KeyL', KeyCode.KeyL, 'L', 76, 'VK_L', empty, empty],\n\t\t[0, ScanCode.KeyM, 'KeyM', KeyCode.KeyM, 'M', 77, 'VK_M', empty, empty],\n\t\t[0, ScanCode.KeyN, 'KeyN', KeyCode.KeyN, 'N', 78, 'VK_N', empty, empty],\n\t\t[0, ScanCode.KeyO, 'KeyO', KeyCode.KeyO, 'O', 79, 'VK_O', empty, empty],\n\t\t[0, ScanCode.KeyP, 'KeyP', KeyCode.KeyP, 'P', 80, 'VK_P', empty, empty],\n\t\t[0, ScanCode.KeyQ, 'KeyQ', KeyCode.KeyQ, 'Q', 81, 'VK_Q', empty, empty],\n\t\t[0, ScanCode.KeyR, 'KeyR', KeyCode.KeyR, 'R', 82, 'VK_R', empty, empty],\n\t\t[0, ScanCode.KeyS, 'KeyS', KeyCode.KeyS, 'S', 83, 'VK_S', empty, empty],\n\t\t[0, ScanCode.KeyT, 'KeyT', KeyCode.KeyT, 'T', 84, 'VK_T', empty, empty],\n\t\t[0, ScanCode.KeyU, 'KeyU', KeyCode.KeyU, 'U', 85, 'VK_U', empty, empty],\n\t\t[0, ScanCode.KeyV, 'KeyV', KeyCode.KeyV, 'V', 86, 'VK_V', empty, empty],\n\t\t[0, ScanCode.KeyW, 'KeyW', KeyCode.KeyW, 'W', 87, 'VK_W', empty, empty],\n\t\t[0, ScanCode.KeyX, 'KeyX', KeyCode.KeyX, 'X', 88, 'VK_X', empty, empty],\n\t\t[0, ScanCode.KeyY, 'KeyY', KeyCode.KeyY, 'Y', 89, 'VK_Y', empty, empty],\n\t\t[0, ScanCode.KeyZ, 'KeyZ', KeyCode.KeyZ, 'Z', 90, 'VK_Z', empty, empty],\n\t\t[0, ScanCode.Digit1, 'Digit1', KeyCode.Digit1, '1', 49, 'VK_1', empty, empty],\n\t\t[0, ScanCode.Digit2, 'Digit2', KeyCode.Digit2, '2', 50, 'VK_2', empty, empty],\n\t\t[0, ScanCode.Digit3, 'Digit3', KeyCode.Digit3, '3', 51, 'VK_3', empty, empty],\n\t\t[0, ScanCode.Digit4, 'Digit4', KeyCode.Digit4, '4', 52, 'VK_4', empty, empty],\n\t\t[0, ScanCode.Digit5, 'Digit5', KeyCode.Digit5, '5', 53, 'VK_5', empty, empty],\n\t\t[0, ScanCode.Digit6, 'Digit6', KeyCode.Digit6, '6', 54, 'VK_6', empty, empty],\n\t\t[0, ScanCode.Digit7, 'Digit7', KeyCode.Digit7, '7', 55, 'VK_7', empty, empty],\n\t\t[0, ScanCode.Digit8, 'Digit8', KeyCode.Digit8, '8', 56, 'VK_8', empty, empty],\n\t\t[0, ScanCode.Digit9, 'Digit9', KeyCode.Digit9, '9', 57, 'VK_9', empty, empty],\n\t\t[0, ScanCode.Digit0, 'Digit0', KeyCode.Digit0, '0', 48, 'VK_0', empty, empty],\n\t\t[1, ScanCode.Enter, 'Enter', KeyCode.Enter, 'Enter', 13, 'VK_RETURN', empty, empty],\n\t\t[1, ScanCode.Escape, 'Escape', KeyCode.Escape, 'Escape', 27, 'VK_ESCAPE', empty, empty],\n\t\t[1, ScanCode.Backspace, 'Backspace', KeyCode.Backspace, 'Backspace', 8, 'VK_BACK', empty, empty],\n\t\t[1, ScanCode.Tab, 'Tab', KeyCode.Tab, 'Tab', 9, 'VK_TAB', empty, empty],\n\t\t[1, ScanCode.Space, 'Space', KeyCode.Space, 'Space', 32, 'VK_SPACE', empty, empty],\n\t\t[0, ScanCode.Minus, 'Minus', KeyCode.Minus, '-', 189, 'VK_OEM_MINUS', '-', 'OEM_MINUS'],\n\t\t[0, ScanCode.Equal, 'Equal', KeyCode.Equal, '=', 187, 'VK_OEM_PLUS', '=', 'OEM_PLUS'],\n\t\t[0, ScanCode.BracketLeft, 'BracketLeft', KeyCode.BracketLeft, '[', 219, 'VK_OEM_4', '[', 'OEM_4'],\n\t\t[0, ScanCode.BracketRight, 'BracketRight', KeyCode.BracketRight, ']', 221, 'VK_OEM_6', ']', 'OEM_6'],\n\t\t[0, ScanCode.Backslash, 'Backslash', KeyCode.Backslash, '\\\\', 220, 'VK_OEM_5', '\\\\', 'OEM_5'],\n\t\t[0, ScanCode.IntlHash, 'IntlHash', KeyCode.Unknown, empty, 0, empty, empty, empty], // has been dropped from the w3c spec\n\t\t[0, ScanCode.Semicolon, 'Semicolon', KeyCode.Semicolon, ';', 186, 'VK_OEM_1', ';', 'OEM_1'],\n\t\t[0, ScanCode.Quote, 'Quote', KeyCode.Quote, '\\'', 222, 'VK_OEM_7', '\\'', 'OEM_7'],\n\t\t[0, ScanCode.Backquote, 'Backquote', KeyCode.Backquote, '`', 192, 'VK_OEM_3', '`', 'OEM_3'],\n\t\t[0, ScanCode.Comma, 'Comma', KeyCode.Comma, ',', 188, 'VK_OEM_COMMA', ',', 'OEM_COMMA'],\n\t\t[0, ScanCode.Period, 'Period', KeyCode.Period, '.', 190, 'VK_OEM_PERIOD', '.', 'OEM_PERIOD'],\n\t\t[0, ScanCode.Slash, 'Slash', KeyCode.Slash, '/', 191, 'VK_OEM_2', '/', 'OEM_2'],\n\t\t[1, ScanCode.CapsLock, 'CapsLock', KeyCode.CapsLock, 'CapsLock', 20, 'VK_CAPITAL', empty, empty],\n\t\t[1, ScanCode.F1, 'F1', KeyCode.F1, 'F1', 112, 'VK_F1', empty, empty],\n\t\t[1, ScanCode.F2, 'F2', KeyCode.F2, 'F2', 113, 'VK_F2', empty, empty],\n\t\t[1, ScanCode.F3, 'F3', KeyCode.F3, 'F3', 114, 'VK_F3', empty, empty],\n\t\t[1, ScanCode.F4, 'F4', KeyCode.F4, 'F4', 115, 'VK_F4', empty, empty],\n\t\t[1, ScanCode.F5, 'F5', KeyCode.F5, 'F5', 116, 'VK_F5', empty, empty],\n\t\t[1, ScanCode.F6, 'F6', KeyCode.F6, 'F6', 117, 'VK_F6', empty, empty],\n\t\t[1, ScanCode.F7, 'F7', KeyCode.F7, 'F7', 118, 'VK_F7', empty, empty],\n\t\t[1, ScanCode.F8, 'F8', KeyCode.F8, 'F8', 119, 'VK_F8', empty, empty],\n\t\t[1, ScanCode.F9, 'F9', KeyCode.F9, 'F9', 120, 'VK_F9', empty, empty],\n\t\t[1, ScanCode.F10, 'F10', KeyCode.F10, 'F10', 121, 'VK_F10', empty, empty],\n\t\t[1, ScanCode.F11, 'F11', KeyCode.F11, 'F11', 122, 'VK_F11', empty, empty],\n\t\t[1, ScanCode.F12, 'F12', KeyCode.F12, 'F12', 123, 'VK_F12', empty, empty],\n\t\t[1, ScanCode.PrintScreen, 'PrintScreen', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.ScrollLock, 'ScrollLock', KeyCode.ScrollLock, 'ScrollLock', 145, 'VK_SCROLL', empty, empty],\n\t\t[1, ScanCode.Pause, 'Pause', KeyCode.PauseBreak, 'PauseBreak', 19, 'VK_PAUSE', empty, empty],\n\t\t[1, ScanCode.Insert, 'Insert', KeyCode.Insert, 'Insert', 45, 'VK_INSERT', empty, empty],\n\t\t[1, ScanCode.Home, 'Home', KeyCode.Home, 'Home', 36, 'VK_HOME', empty, empty],\n\t\t[1, ScanCode.PageUp, 'PageUp', KeyCode.PageUp, 'PageUp', 33, 'VK_PRIOR', empty, empty],\n\t\t[1, ScanCode.Delete, 'Delete', KeyCode.Delete, 'Delete', 46, 'VK_DELETE', empty, empty],\n\t\t[1, ScanCode.End, 'End', KeyCode.End, 'End', 35, 'VK_END', empty, empty],\n\t\t[1, ScanCode.PageDown, 'PageDown', KeyCode.PageDown, 'PageDown', 34, 'VK_NEXT', empty, empty],\n\t\t[1, ScanCode.ArrowRight, 'ArrowRight', KeyCode.RightArrow, 'RightArrow', 39, 'VK_RIGHT', 'Right', empty],\n\t\t[1, ScanCode.ArrowLeft, 'ArrowLeft', KeyCode.LeftArrow, 'LeftArrow', 37, 'VK_LEFT', 'Left', empty],\n\t\t[1, ScanCode.ArrowDown, 'ArrowDown', KeyCode.DownArrow, 'DownArrow', 40, 'VK_DOWN', 'Down', empty],\n\t\t[1, ScanCode.ArrowUp, 'ArrowUp', KeyCode.UpArrow, 'UpArrow', 38, 'VK_UP', 'Up', empty],\n\t\t[1, ScanCode.NumLock, 'NumLock', KeyCode.NumLock, 'NumLock', 144, 'VK_NUMLOCK', empty, empty],\n\t\t[1, ScanCode.NumpadDivide, 'NumpadDivide', KeyCode.NumpadDivide, 'NumPad_Divide', 111, 'VK_DIVIDE', empty, empty],\n\t\t[1, ScanCode.NumpadMultiply, 'NumpadMultiply', KeyCode.NumpadMultiply, 'NumPad_Multiply', 106, 'VK_MULTIPLY', empty, empty],\n\t\t[1, ScanCode.NumpadSubtract, 'NumpadSubtract', KeyCode.NumpadSubtract, 'NumPad_Subtract', 109, 'VK_SUBTRACT', empty, empty],\n\t\t[1, ScanCode.NumpadAdd, 'NumpadAdd', KeyCode.NumpadAdd, 'NumPad_Add', 107, 'VK_ADD', empty, empty],\n\t\t[1, ScanCode.NumpadEnter, 'NumpadEnter', KeyCode.Enter, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Numpad1, 'Numpad1', KeyCode.Numpad1, 'NumPad1', 97, 'VK_NUMPAD1', empty, empty],\n\t\t[1, ScanCode.Numpad2, 'Numpad2', KeyCode.Numpad2, 'NumPad2', 98, 'VK_NUMPAD2', empty, empty],\n\t\t[1, ScanCode.Numpad3, 'Numpad3', KeyCode.Numpad3, 'NumPad3', 99, 'VK_NUMPAD3', empty, empty],\n\t\t[1, ScanCode.Numpad4, 'Numpad4', KeyCode.Numpad4, 'NumPad4', 100, 'VK_NUMPAD4', empty, empty],\n\t\t[1, ScanCode.Numpad5, 'Numpad5', KeyCode.Numpad5, 'NumPad5', 101, 'VK_NUMPAD5', empty, empty],\n\t\t[1, ScanCode.Numpad6, 'Numpad6', KeyCode.Numpad6, 'NumPad6', 102, 'VK_NUMPAD6', empty, empty],\n\t\t[1, ScanCode.Numpad7, 'Numpad7', KeyCode.Numpad7, 'NumPad7', 103, 'VK_NUMPAD7', empty, empty],\n\t\t[1, ScanCode.Numpad8, 'Numpad8', KeyCode.Numpad8, 'NumPad8', 104, 'VK_NUMPAD8', empty, empty],\n\t\t[1, ScanCode.Numpad9, 'Numpad9', KeyCode.Numpad9, 'NumPad9', 105, 'VK_NUMPAD9', empty, empty],\n\t\t[1, ScanCode.Numpad0, 'Numpad0', KeyCode.Numpad0, 'NumPad0', 96, 'VK_NUMPAD0', empty, empty],\n\t\t[1, ScanCode.NumpadDecimal, 'NumpadDecimal', KeyCode.NumpadDecimal, 'NumPad_Decimal', 110, 'VK_DECIMAL', empty, empty],\n\t\t[0, ScanCode.IntlBackslash, 'IntlBackslash', KeyCode.IntlBackslash, 'OEM_102', 226, 'VK_OEM_102', empty, empty],\n\t\t[1, ScanCode.ContextMenu, 'ContextMenu', KeyCode.ContextMenu, 'ContextMenu', 93, empty, empty, empty],\n\t\t[1, ScanCode.Power, 'Power', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadEqual, 'NumpadEqual', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.F13, 'F13', KeyCode.F13, 'F13', 124, 'VK_F13', empty, empty],\n\t\t[1, ScanCode.F14, 'F14', KeyCode.F14, 'F14', 125, 'VK_F14', empty, empty],\n\t\t[1, ScanCode.F15, 'F15', KeyCode.F15, 'F15', 126, 'VK_F15', empty, empty],\n\t\t[1, ScanCode.F16, 'F16', KeyCode.F16, 'F16', 127, 'VK_F16', empty, empty],\n\t\t[1, ScanCode.F17, 'F17', KeyCode.F17, 'F17', 128, 'VK_F17', empty, empty],\n\t\t[1, ScanCode.F18, 'F18', KeyCode.F18, 'F18', 129, 'VK_F18', empty, empty],\n\t\t[1, ScanCode.F19, 'F19', KeyCode.F19, 'F19', 130, 'VK_F19', empty, empty],\n\t\t[1, ScanCode.F20, 'F20', KeyCode.F20, 'F20', 131, 'VK_F20', empty, empty],\n\t\t[1, ScanCode.F21, 'F21', KeyCode.F21, 'F21', 132, 'VK_F21', empty, empty],\n\t\t[1, ScanCode.F22, 'F22', KeyCode.F22, 'F22', 133, 'VK_F22', empty, empty],\n\t\t[1, ScanCode.F23, 'F23', KeyCode.F23, 'F23', 134, 'VK_F23', empty, empty],\n\t\t[1, ScanCode.F24, 'F24', KeyCode.F24, 'F24', 135, 'VK_F24', empty, empty],\n\t\t[1, ScanCode.Open, 'Open', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Help, 'Help', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Select, 'Select', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Again, 'Again', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Undo, 'Undo', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Cut, 'Cut', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Copy, 'Copy', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Paste, 'Paste', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Find, 'Find', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.AudioVolumeMute, 'AudioVolumeMute', KeyCode.AudioVolumeMute, 'AudioVolumeMute', 173, 'VK_VOLUME_MUTE', empty, empty],\n\t\t[1, ScanCode.AudioVolumeUp, 'AudioVolumeUp', KeyCode.AudioVolumeUp, 'AudioVolumeUp', 175, 'VK_VOLUME_UP', empty, empty],\n\t\t[1, ScanCode.AudioVolumeDown, 'AudioVolumeDown', KeyCode.AudioVolumeDown, 'AudioVolumeDown', 174, 'VK_VOLUME_DOWN', empty, empty],\n\t\t[1, ScanCode.NumpadComma, 'NumpadComma', KeyCode.NUMPAD_SEPARATOR, 'NumPad_Separator', 108, 'VK_SEPARATOR', empty, empty],\n\t\t[0, ScanCode.IntlRo, 'IntlRo', KeyCode.ABNT_C1, 'ABNT_C1', 193, 'VK_ABNT_C1', empty, empty],\n\t\t[1, ScanCode.KanaMode, 'KanaMode', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[0, ScanCode.IntlYen, 'IntlYen', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Convert, 'Convert', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NonConvert, 'NonConvert', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Lang1, 'Lang1', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Lang2, 'Lang2', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Lang3, 'Lang3', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Lang4, 'Lang4', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Lang5, 'Lang5', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Abort, 'Abort', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.Props, 'Props', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadParenLeft, 'NumpadParenLeft', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadParenRight, 'NumpadParenRight', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadBackspace, 'NumpadBackspace', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadMemoryStore, 'NumpadMemoryStore', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadMemoryRecall, 'NumpadMemoryRecall', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadMemoryClear, 'NumpadMemoryClear', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadMemoryAdd, 'NumpadMemoryAdd', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadMemorySubtract, 'NumpadMemorySubtract', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.NumpadClear, 'NumpadClear', KeyCode.Clear, 'Clear', 12, 'VK_CLEAR', empty, empty],\n\t\t[1, ScanCode.NumpadClearEntry, 'NumpadClearEntry', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Ctrl, 'Ctrl', 17, 'VK_CONTROL', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Shift, 'Shift', 16, 'VK_SHIFT', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Alt, 'Alt', 18, 'VK_MENU', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Meta, 'Meta', 91, 'VK_COMMAND', empty, empty],\n\t\t[1, ScanCode.ControlLeft, 'ControlLeft', KeyCode.Ctrl, empty, 0, 'VK_LCONTROL', empty, empty],\n\t\t[1, ScanCode.ShiftLeft, 'ShiftLeft', KeyCode.Shift, empty, 0, 'VK_LSHIFT', empty, empty],\n\t\t[1, ScanCode.AltLeft, 'AltLeft', KeyCode.Alt, empty, 0, 'VK_LMENU', empty, empty],\n\t\t[1, ScanCode.MetaLeft, 'MetaLeft', KeyCode.Meta, empty, 0, 'VK_LWIN', empty, empty],\n\t\t[1, ScanCode.ControlRight, 'ControlRight', KeyCode.Ctrl, empty, 0, 'VK_RCONTROL', empty, empty],\n\t\t[1, ScanCode.ShiftRight, 'ShiftRight', KeyCode.Shift, empty, 0, 'VK_RSHIFT', empty, empty],\n\t\t[1, ScanCode.AltRight, 'AltRight', KeyCode.Alt, empty, 0, 'VK_RMENU', empty, empty],\n\t\t[1, ScanCode.MetaRight, 'MetaRight', KeyCode.Meta, empty, 0, 'VK_RWIN', empty, empty],\n\t\t[1, ScanCode.BrightnessUp, 'BrightnessUp', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.BrightnessDown, 'BrightnessDown', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MediaPlay, 'MediaPlay', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MediaRecord, 'MediaRecord', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MediaFastForward, 'MediaFastForward', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MediaRewind, 'MediaRewind', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MediaTrackNext, 'MediaTrackNext', KeyCode.MediaTrackNext, 'MediaTrackNext', 176, 'VK_MEDIA_NEXT_TRACK', empty, empty],\n\t\t[1, ScanCode.MediaTrackPrevious, 'MediaTrackPrevious', KeyCode.MediaTrackPrevious, 'MediaTrackPrevious', 177, 'VK_MEDIA_PREV_TRACK', empty, empty],\n\t\t[1, ScanCode.MediaStop, 'MediaStop', KeyCode.MediaStop, 'MediaStop', 178, 'VK_MEDIA_STOP', empty, empty],\n\t\t[1, ScanCode.Eject, 'Eject', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MediaPlayPause, 'MediaPlayPause', KeyCode.MediaPlayPause, 'MediaPlayPause', 179, 'VK_MEDIA_PLAY_PAUSE', empty, empty],\n\t\t[1, ScanCode.MediaSelect, 'MediaSelect', KeyCode.LaunchMediaPlayer, 'LaunchMediaPlayer', 181, 'VK_MEDIA_LAUNCH_MEDIA_SELECT', empty, empty],\n\t\t[1, ScanCode.LaunchMail, 'LaunchMail', KeyCode.LaunchMail, 'LaunchMail', 180, 'VK_MEDIA_LAUNCH_MAIL', empty, empty],\n\t\t[1, ScanCode.LaunchApp2, 'LaunchApp2', KeyCode.LaunchApp2, 'LaunchApp2', 183, 'VK_MEDIA_LAUNCH_APP2', empty, empty],\n\t\t[1, ScanCode.LaunchApp1, 'LaunchApp1', KeyCode.Unknown, empty, 0, 'VK_MEDIA_LAUNCH_APP1', empty, empty],\n\t\t[1, ScanCode.SelectTask, 'SelectTask', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.LaunchScreenSaver, 'LaunchScreenSaver', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.BrowserSearch, 'BrowserSearch', KeyCode.BrowserSearch, 'BrowserSearch', 170, 'VK_BROWSER_SEARCH', empty, empty],\n\t\t[1, ScanCode.BrowserHome, 'BrowserHome', KeyCode.BrowserHome, 'BrowserHome', 172, 'VK_BROWSER_HOME', empty, empty],\n\t\t[1, ScanCode.BrowserBack, 'BrowserBack', KeyCode.BrowserBack, 'BrowserBack', 166, 'VK_BROWSER_BACK', empty, empty],\n\t\t[1, ScanCode.BrowserForward, 'BrowserForward', KeyCode.BrowserForward, 'BrowserForward', 167, 'VK_BROWSER_FORWARD', empty, empty],\n\t\t[1, ScanCode.BrowserStop, 'BrowserStop', KeyCode.Unknown, empty, 0, 'VK_BROWSER_STOP', empty, empty],\n\t\t[1, ScanCode.BrowserRefresh, 'BrowserRefresh', KeyCode.Unknown, empty, 0, 'VK_BROWSER_REFRESH', empty, empty],\n\t\t[1, ScanCode.BrowserFavorites, 'BrowserFavorites', KeyCode.Unknown, empty, 0, 'VK_BROWSER_FAVORITES', empty, empty],\n\t\t[1, ScanCode.ZoomToggle, 'ZoomToggle', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MailReply, 'MailReply', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MailForward, 'MailForward', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\t\t[1, ScanCode.MailSend, 'MailSend', KeyCode.Unknown, empty, 0, empty, empty, empty],\n\n\t\t// See https://lists.w3.org/Archives/Public/www-dom/2010JulSep/att-0182/keyCode-spec.html\n\t\t// If an Input Method Editor is processing key input and the event is keydown, return 229.\n\t\t[1, ScanCode.None, empty, KeyCode.KEY_IN_COMPOSITION, 'KeyInComposition', 229, empty, empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.ABNT_C2, 'ABNT_C2', 194, 'VK_ABNT_C2', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.OEM_8, 'OEM_8', 223, 'VK_OEM_8', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_KANA', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_HANGUL', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_JUNJA', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_FINAL', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_HANJA', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_KANJI', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_CONVERT', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_NONCONVERT', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_ACCEPT', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_MODECHANGE', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_SELECT', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_PRINT', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_EXECUTE', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_SNAPSHOT', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_HELP', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_APPS', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_PROCESSKEY', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_PACKET', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_DBE_SBCSCHAR', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_DBE_DBCSCHAR', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_ATTN', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_CRSEL', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_EXSEL', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_EREOF', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_PLAY', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_ZOOM', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_NONAME', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_PA1', empty, empty],\n\t\t[1, ScanCode.None, empty, KeyCode.Unknown, empty, 0, 'VK_OEM_CLEAR', empty, empty],\n\t];\n\n\tconst seenKeyCode: boolean[] = [];\n\tconst seenScanCode: boolean[] = [];\n\tfor (const mapping of mappings) {\n\t\tconst [immutable, scanCode, scanCodeStr, keyCode, keyCodeStr, eventKeyCode, vkey, usUserSettingsLabel, generalUserSettingsLabel] = mapping;\n\t\tif (!seenScanCode[scanCode]) {\n\t\t\tseenScanCode[scanCode] = true;\n\t\t\tscanCodeIntToStr[scanCode] = scanCodeStr;\n\t\t\tscanCodeStrToInt[scanCodeStr] = scanCode;\n\t\t\tscanCodeLowerCaseStrToInt[scanCodeStr.toLowerCase()] = scanCode;\n\t\t\tif (immutable) {\n\t\t\t\tIMMUTABLE_CODE_TO_KEY_CODE[scanCode] = keyCode;\n\t\t\t\tif (\n\t\t\t\t\t(keyCode !== KeyCode.Unknown)\n\t\t\t\t\t&& (keyCode !== KeyCode.Enter)\n\t\t\t\t\t&& (keyCode !== KeyCode.Ctrl)\n\t\t\t\t\t&& (keyCode !== KeyCode.Shift)\n\t\t\t\t\t&& (keyCode !== KeyCode.Alt)\n\t\t\t\t\t&& (keyCode !== KeyCode.Meta)\n\t\t\t\t) {\n\t\t\t\t\tIMMUTABLE_KEY_CODE_TO_CODE[keyCode] = scanCode;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!seenKeyCode[keyCode]) {\n\t\t\tseenKeyCode[keyCode] = true;\n\t\t\tif (!keyCodeStr) {\n\t\t\t\tthrow new Error(`String representation missing for key code ${keyCode} around scan code ${scanCodeStr}`);\n\t\t\t}\n\t\t\tuiMap.define(keyCode, keyCodeStr);\n\t\t\tuserSettingsUSMap.define(keyCode, usUserSettingsLabel || keyCodeStr);\n\t\t\tuserSettingsGeneralMap.define(keyCode, generalUserSettingsLabel || usUserSettingsLabel || keyCodeStr);\n\t\t}\n\t\tif (eventKeyCode) {\n\t\t\tEVENT_KEY_CODE_MAP[eventKeyCode] = keyCode;\n\t\t}\n\t\tif (vkey) {\n\t\t\tNATIVE_WINDOWS_KEY_CODE_TO_KEY_CODE[vkey] = keyCode;\n\t\t}\n\t}\n\t// Manually added due to the exclusion above (due to duplication with NumpadEnter)\n\tIMMUTABLE_KEY_CODE_TO_CODE[KeyCode.Enter] = ScanCode.Enter;\n\n})();\n\nexport namespace KeyCodeUtils {\n\texport function toString(keyCode: KeyCode): string {\n\t\treturn uiMap.keyCodeToStr(keyCode);\n\t}\n\texport function fromString(key: string): KeyCode {\n\t\treturn uiMap.strToKeyCode(key);\n\t}\n\n\texport function toUserSettingsUS(keyCode: KeyCode): string {\n\t\treturn userSettingsUSMap.keyCodeToStr(keyCode);\n\t}\n\texport function toUserSettingsGeneral(keyCode: KeyCode): string {\n\t\treturn userSettingsGeneralMap.keyCodeToStr(keyCode);\n\t}\n\texport function fromUserSettings(key: string): KeyCode {\n\t\treturn userSettingsUSMap.strToKeyCode(key) || userSettingsGeneralMap.strToKeyCode(key);\n\t}\n\n\texport function toElectronAccelerator(keyCode: KeyCode): string | null {\n\t\tif (keyCode >= KeyCode.Numpad0 && keyCode <= KeyCode.NumpadDivide) {\n\t\t\t// [Electron Accelerators] Electron is able to parse numpad keys, but unfortunately it\n\t\t\t// renders them just as regular keys in menus. For example, num0 is rendered as \"0\",\n\t\t\t// numdiv is rendered as \"/\", numsub is rendered as \"-\".\n\t\t\t//\n\t\t\t// This can lead to incredible confusion, as it makes numpad based keybindings indistinguishable\n\t\t\t// from keybindings based on regular keys.\n\t\t\t//\n\t\t\t// We therefore need to fall back to custom rendering for numpad keys.\n\t\t\treturn null;\n\t\t}\n\n\t\tswitch (keyCode) {\n\t\t\tcase KeyCode.UpArrow:\n\t\t\t\treturn 'Up';\n\t\t\tcase KeyCode.DownArrow:\n\t\t\t\treturn 'Down';\n\t\t\tcase KeyCode.LeftArrow:\n\t\t\t\treturn 'Left';\n\t\t\tcase KeyCode.RightArrow:\n\t\t\t\treturn 'Right';\n\t\t}\n\n\t\treturn uiMap.keyCodeToStr(keyCode);\n\t}\n}\n\nexport const enum KeyMod {\n\tCtrlCmd = (1 << 11) >>> 0,\n\tShift = (1 << 10) >>> 0,\n\tAlt = (1 << 9) >>> 0,\n\tWinCtrl = (1 << 8) >>> 0,\n}\n\nexport function KeyChord(firstPart: number, secondPart: number): number {\n\tconst chordPart = ((secondPart & 0x0000FFFF) << 16) >>> 0;\n\treturn (firstPart | chordPart) >>> 0;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nexport class Lazy<T> {\n\n\tprivate _didRun: boolean = false;\n\tprivate _value?: T;\n\tprivate _error: Error | undefined;\n\n\tconstructor(\n\t\tprivate readonly executor: () => T,\n\t) { }\n\n\t/**\n\t * Get the wrapped value.\n\t *\n\t * This will force evaluation of the lazy value if it has not been resolved yet. Lazy values are only\n\t * resolved once. `getValue` will re-throw exceptions that are hit while resolving the value\n\t */\n\tget value(): T {\n\t\tif (!this._didRun) {\n\t\t\ttry {\n\t\t\t\tthis._value = this.executor();\n\t\t\t} catch (err) {\n\t\t\t\tthis._error = err;\n\t\t\t} finally {\n\t\t\t\tthis._didRun = true;\n\t\t\t}\n\t\t}\n\t\tif (this._error) {\n\t\t\tthrow this._error;\n\t\t}\n\t\treturn this._value!;\n\t}\n\n\t/**\n\t * Get the wrapped value without forcing evaluation.\n\t */\n\tget rawValue(): T | undefined { return this._value; }\n}\n","\nimport { createSingleCallFunction } from 'vs/base/common/functional';\nimport { Iterable } from 'vs/base/common/iterator';\n\n// #region Disposable Tracking\n\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: IDisposableTracker | null = null;\n\nexport interface IDisposableTracker {\n\t/**\n\t * Is called on construction of a disposable.\n\t*/\n\ttrackDisposable(disposable: IDisposable): void;\n\n\t/**\n\t * Is called when a disposable is registered as child of another disposable (e.g. {@link DisposableStore}).\n\t * If parent is `null`, the disposable is removed from its former parent.\n\t*/\n\tsetParent(child: IDisposable, parent: IDisposable | null): void;\n\n\t/**\n\t * Is called after a disposable is disposed.\n\t*/\n\tmarkAsDisposed(disposable: IDisposable): void;\n\n\t/**\n\t * Indicates that the given object is a singleton which does not need to be disposed.\n\t*/\n\tmarkAsSingleton(disposable: IDisposable): void;\n}\n\nexport function setDisposableTracker(tracker: IDisposableTracker | null): void {\n\tdisposableTracker = tracker;\n}\n\nif (TRACK_DISPOSABLES) {\n\tconst __is_disposable_tracked__ = '__is_disposable_tracked__';\n\tsetDisposableTracker(new class implements IDisposableTracker {\n\t\ttrackDisposable(x: IDisposable): void {\n\t\t\tconst stack = new Error('Potentially leaked disposable').stack!;\n\t\t\tsetTimeout(() => {\n\t\t\t\tif (!(x as any)[__is_disposable_tracked__]) {\n\t\t\t\t\tconsole.log(stack);\n\t\t\t\t}\n\t\t\t}, 3000);\n\t\t}\n\n\t\tsetParent(child: IDisposable, parent: IDisposable | null): void {\n\t\t\tif (child && child !== Disposable.None) {\n\t\t\t\ttry {\n\t\t\t\t\t(child as any)[__is_disposable_tracked__] = true;\n\t\t\t\t} catch {\n\t\t\t\t\t// noop\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tmarkAsDisposed(disposable: IDisposable): void {\n\t\t\tif (disposable && disposable !== Disposable.None) {\n\t\t\t\ttry {\n\t\t\t\t\t(disposable as any)[__is_disposable_tracked__] = true;\n\t\t\t\t} catch {\n\t\t\t\t\t// noop\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmarkAsSingleton(disposable: IDisposable): void { }\n\t});\n}\n\nexport function trackDisposable<T extends IDisposable>(x: T): T {\n\tdisposableTracker?.trackDisposable(x);\n\treturn x;\n}\n\nexport function markAsDisposed(disposable: IDisposable): void {\n\tdisposableTracker?.markAsDisposed(disposable);\n}\n\nfunction setParentOfDisposable(child: IDisposable, parent: IDisposable | null): void {\n\tdisposableTracker?.setParent(child, parent);\n}\n\nfunction setParentOfDisposables(children: IDisposable[], parent: IDisposable | null): void {\n\tif (!disposableTracker) {\n\t\treturn;\n\t}\n\tfor (const child of children) {\n\t\tdisposableTracker.setParent(child, parent);\n\t}\n}\n\n/**\n * Indicates that the given object is a singleton which does not need to be disposed.\n*/\nexport function markAsSingleton<T extends IDisposable>(singleton: T): T {\n\tdisposableTracker?.markAsSingleton(singleton);\n\treturn singleton;\n}\n\n// #endregion\n\n/**\n * An object that performs a cleanup operation when `.dispose()` is called.\n *\n * Some examples of how disposables are used:\n *\n * - An event listener that removes itself when `.dispose()` is called.\n * - A resource such as a file system watcher that cleans up the resource when `.dispose()` is called.\n * - The return value from registering a provider. When `.dispose()` is called, the provider is unregistered.\n */\nexport interface IDisposable {\n\tdispose(): void;\n}\n\n/**\n * Check if `thing` is {@link IDisposable disposable}.\n */\nexport function isDisposable<E extends any>(thing: E): thing is E & IDisposable {\n\treturn typeof thing === 'object' && thing !== null && typeof (<IDisposable><any>thing).dispose === 'function' && (<IDisposable><any>thing).dispose.length === 0;\n}\n\n/**\n * Disposes of the value(s) passed in.\n */\nexport function dispose<T extends IDisposable>(disposable: T): T;\nexport function dispose<T extends IDisposable>(disposable: T | undefined): T | undefined;\nexport function dispose<T extends IDisposable, A extends Iterable<T> = Iterable<T>>(disposables: A): A;\nexport function dispose<T extends IDisposable>(disposables: Array<T>): Array<T>;\nexport function dispose<T extends IDisposable>(disposables: ReadonlyArray<T>): ReadonlyArray<T>;\nexport function dispose<T extends IDisposable>(arg: T | Iterable<T> | undefined): any {\n\tif (Iterable.is(arg)) {\n\t\tconst errors: any[] = [];\n\n\t\tfor (const d of arg) {\n\t\t\tif (d) {\n\t\t\t\ttry {\n\t\t\t\t\td.dispose();\n\t\t\t\t} catch (e) {\n\t\t\t\t\terrors.push(e);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (errors.length === 1) {\n\t\t\tthrow errors[0];\n\t\t} else if (errors.length > 1) {\n\t\t\tthrow new AggregateError(errors, 'Encountered errors while disposing of store');\n\t\t}\n\n\t\treturn Array.isArray(arg) ? [] : arg;\n\t} else if (arg) {\n\t\targ.dispose();\n\t\treturn arg;\n\t}\n}\n\n/**\n * Combine multiple disposable values into a single {@link IDisposable}.\n */\nexport function combinedDisposable(...disposables: IDisposable[]): IDisposable {\n\tconst parent = toDisposable(() => dispose(disposables));\n\tsetParentOfDisposables(disposables, parent);\n\treturn parent;\n}\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: () => void): IDisposable {\n\tconst self = trackDisposable({\n\t\tdispose: createSingleCallFunction(() => {\n\t\t\tmarkAsDisposed(self);\n\t\t\tfn();\n\t\t})\n\t});\n\treturn self;\n}\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 implements IDisposable {\n\n\tstatic DISABLE_DISPOSED_WARNING = false;\n\n\tprivate readonly _toDispose = new Set<IDisposable>();\n\tprivate _isDisposed = false;\n\n\tconstructor() {\n\t\ttrackDisposable(this);\n\t}\n\n\t/**\n\t * Dispose of all registered disposables and mark this object as disposed.\n\t *\n\t * Any future disposables added to this object will be disposed of on `add`.\n\t */\n\tpublic dispose(): void {\n\t\tif (this._isDisposed) {\n\t\t\treturn;\n\t\t}\n\n\t\tmarkAsDisposed(this);\n\t\tthis._isDisposed = true;\n\t\tthis.clear();\n\t}\n\n\t/**\n\t * @return `true` if this object has been disposed of.\n\t */\n\tpublic get isDisposed(): boolean {\n\t\treturn this._isDisposed;\n\t}\n\n\t/**\n\t * Dispose of all registered disposables but do not mark this object as disposed.\n\t */\n\tpublic clear(): void {\n\t\tif (this._toDispose.size === 0) {\n\t\t\treturn;\n\t\t}\n\n\t\ttry {\n\t\t\tdispose(this._toDispose);\n\t\t} finally {\n\t\t\tthis._toDispose.clear();\n\t\t}\n\t}\n\n\t/**\n\t * Add a new {@link IDisposable disposable} to the collection.\n\t */\n\tpublic add<T extends IDisposable>(o: T): T {\n\t\tif (!o) {\n\t\t\treturn o;\n\t\t}\n\t\tif ((o as unknown as DisposableStore) === this) {\n\t\t\tthrow new Error('Cannot register a disposable on itself!');\n\t\t}\n\n\t\tsetParentOfDisposable(o, this);\n\t\tif (this._isDisposed) {\n\t\t\tif (!DisposableStore.DISABLE_DISPOSED_WARNING) {\n\t\t\t\tconsole.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\t\t\t}\n\t\t} else {\n\t\t\tthis._toDispose.add(o);\n\t\t}\n\n\t\treturn o;\n\t}\n\n\t/**\n\t * Deletes the value from the store, but does not dispose it.\n\t */\n\tpublic deleteAndLeak<T extends IDisposable>(o: T): void {\n\t\tif (!o) {\n\t\t\treturn;\n\t\t}\n\t\tif (this._toDispose.has(o)) {\n\t\t\tthis._toDispose.delete(o);\n\t\t\tsetParentOfDisposable(o, null);\n\t\t}\n\t}\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 abstract class Disposable implements IDisposable {\n\n\t/**\n\t * A disposable that does nothing when it is disposed of.\n\t *\n\t * TODO: This should not be a static property.\n\t */\n\tstatic readonly None = Object.freeze<IDisposable>({ dispose() { } });\n\n\tprotected readonly _store = new DisposableStore();\n\n\tconstructor() {\n\t\ttrackDisposable(this);\n\t\tsetParentOfDisposable(this._store, this);\n\t}\n\n\tpublic dispose(): void {\n\t\tmarkAsDisposed(this);\n\n\t\tthis._store.dispose();\n\t}\n\n\t/**\n\t * Adds `o` to the collection of disposables managed by this object.\n\t */\n\tprotected _register<T extends IDisposable>(o: T): T {\n\t\tif ((o as unknown as Disposable) === this) {\n\t\t\tthrow new Error('Cannot register a disposable on itself!');\n\t\t}\n\t\treturn this._store.add(o);\n\t}\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<T extends IDisposable> implements IDisposable {\n\tprivate _value?: T;\n\tprivate _isDisposed = false;\n\n\tconstructor() {\n\t\ttrackDisposable(this);\n\t}\n\n\tget value(): T | undefined {\n\t\treturn this._isDisposed ? undefined : this._value;\n\t}\n\n\tset value(value: T | undefined) {\n\t\tif (this._isDisposed || value === this._value) {\n\t\t\treturn;\n\t\t}\n\n\t\tthis._value?.dispose();\n\t\tif (value) {\n\t\t\tsetParentOfDisposable(value, this);\n\t\t}\n\t\tthis._value = value;\n\t}\n\n\t/**\n\t * Resets the stored value and disposed of the previously stored value.\n\t */\n\tclear(): void {\n\t\tthis.value = undefined;\n\t}\n\n\tdispose(): void {\n\t\tthis._isDisposed = true;\n\t\tmarkAsDisposed(this);\n\t\tthis._value?.dispose();\n\t\tthis._value = undefined;\n\t}\n}\n\nexport class RefCountedDisposable {\n\n\tprivate _counter: number = 1;\n\n\tconstructor(\n\t\tprivate readonly _disposable: IDisposable,\n\t) { }\n\n\tacquire() {\n\t\tthis._counter++;\n\t\treturn this;\n\t}\n\n\trelease() {\n\t\tif (--this._counter === 0) {\n\t\t\tthis._disposable.dispose();\n\t\t}\n\t\treturn this;\n\t}\n}\n\nexport interface IReference<T> extends IDisposable {\n\treadonly object: T;\n}\n\nexport class ImmortalReference<T> implements IReference<T> {\n\tconstructor(public object: T) { }\n\tdispose(): void { /* noop */ }\n}\n\n/**\n * A map the manages the lifecycle of the values that it stores.\n */\nexport class DisposableMap<K, V extends IDisposable = IDisposable> implements IDisposable {\n\n\tprivate readonly _store = new Map<K, V>();\n\tprivate _isDisposed = false;\n\n\tconstructor() {\n\t\ttrackDisposable(this);\n\t}\n\n\t/**\n\t * Disposes of all stored values and mark this object as disposed.\n\t *\n\t * Trying to use this object after it has been disposed of is an error.\n\t */\n\tdispose(): void {\n\t\tmarkAsDisposed(this);\n\t\tthis._isDisposed = true;\n\t\tthis.clearAndDisposeAll();\n\t}\n\n\t/**\n\t * Disposes of all stored values and clear the map, but DO NOT mark this object as disposed.\n\t */\n\tclearAndDisposeAll(): void {\n\t\tif (!this._store.size) {\n\t\t\treturn;\n\t\t}\n\n\t\ttry {\n\t\t\tdispose(this._store.values());\n\t\t} finally {\n\t\t\tthis._store.clear();\n\t\t}\n\t}\n\n\tget(key: K): V | undefined {\n\t\treturn this._store.get(key);\n\t}\n\n\tset(key: K, value: V, skipDisposeOnOverwrite = false): void {\n\t\tif (this._isDisposed) {\n\t\t\tconsole.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\t\t}\n\n\t\tif (!skipDisposeOnOverwrite) {\n\t\t\tthis._store.get(key)?.dispose();\n\t\t}\n\n\t\tthis._store.set(key, value);\n\t}\n\n\t/**\n\t * Delete the value stored for `key` from this map and also dispose of it.\n\t */\n\tdeleteAndDispose(key: K): void {\n\t\tthis._store.get(key)?.dispose();\n\t\tthis._store.delete(key);\n\t}\n\n\t[Symbol.iterator](): IterableIterator<[K, V]> {\n\t\treturn this._store[Symbol.iterator]();\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nclass Node<E> {\n\n\tstatic readonly Undefined = new Node<any>(undefined);\n\n\telement: E;\n\tnext: Node<E>;\n\tprev: Node<E>;\n\n\tconstructor(element: E) {\n\t\tthis.element = element;\n\t\tthis.next = Node.Undefined;\n\t\tthis.prev = Node.Undefined;\n\t}\n}\n\nexport class LinkedList<E> {\n\n\tprivate _first: Node<E> = Node.Undefined;\n\tprivate _last: Node<E> = Node.Undefined;\n\tprivate _size: number = 0;\n\n\tget size(): number {\n\t\treturn this._size;\n\t}\n\n\tisEmpty(): boolean {\n\t\treturn this._first === Node.Undefined;\n\t}\n\n\tclear(): void {\n\t\tlet node = this._first;\n\t\twhile (node !== Node.Undefined) {\n\t\t\tconst next = node.next;\n\t\t\tnode.prev = Node.Undefined;\n\t\t\tnode.next = Node.Undefined;\n\t\t\tnode = next;\n\t\t}\n\n\t\tthis._first = Node.Undefined;\n\t\tthis._last = Node.Undefined;\n\t\tthis._size = 0;\n\t}\n\n\tunshift(element: E): () => void {\n\t\treturn this._insert(element, false);\n\t}\n\n\tpush(element: E): () => void {\n\t\treturn this._insert(element, true);\n\t}\n\n\tprivate _insert(element: E, atTheEnd: boolean): () => void {\n\t\tconst newNode = new Node(element);\n\t\tif (this._first === Node.Undefined) {\n\t\t\tthis._first = newNode;\n\t\t\tthis._last = newNode;\n\n\t\t} else if (atTheEnd) {\n\t\t\t// push\n\t\t\tconst oldLast = this._last;\n\t\t\tthis._last = newNode;\n\t\t\tnewNode.prev = oldLast;\n\t\t\toldLast.next = newNode;\n\n\t\t} else {\n\t\t\t// unshift\n\t\t\tconst oldFirst = this._first;\n\t\t\tthis._first = newNode;\n\t\t\tnewNode.next = oldFirst;\n\t\t\toldFirst.prev = newNode;\n\t\t}\n\t\tthis._size += 1;\n\n\t\tlet didRemove = false;\n\t\treturn () => {\n\t\t\tif (!didRemove) {\n\t\t\t\tdidRemove = true;\n\t\t\t\tthis._remove(newNode);\n\t\t\t}\n\t\t};\n\t}\n\n\tshift(): E | undefined {\n\t\tif (this._first === Node.Undefined) {\n\t\t\treturn undefined;\n\t\t} else {\n\t\t\tconst res = this._first.element;\n\t\t\tthis._remove(this._first);\n\t\t\treturn res;\n\t\t}\n\t}\n\n\tpop(): E | undefined {\n\t\tif (this._last === Node.Undefined) {\n\t\t\treturn undefined;\n\t\t} else {\n\t\t\tconst res = this._last.element;\n\t\t\tthis._remove(this._last);\n\t\t\treturn res;\n\t\t}\n\t}\n\n\tprivate _remove(node: Node<E>): void {\n\t\tif (node.prev !== Node.Undefined && node.next !== Node.Undefined) {\n\t\t\t// middle\n\t\t\tconst anchor = node.prev;\n\t\t\tanchor.next = node.next;\n\t\t\tnode.next.prev = anchor;\n\n\t\t} else if (node.prev === Node.Undefined && node.next === Node.Undefined) {\n\t\t\t// only node\n\t\t\tthis._first = Node.Undefined;\n\t\t\tthis._last = Node.Undefined;\n\n\t\t} else if (node.next === Node.Undefined) {\n\t\t\t// last\n\t\t\tthis._last = this._last.prev!;\n\t\t\tthis._last.next = Node.Undefined;\n\n\t\t} else if (node.prev === Node.Undefined) {\n\t\t\t// first\n\t\t\tthis._first = this._first.next!;\n\t\t\tthis._first.prev = Node.Undefined;\n\t\t}\n\n\t\t// done\n\t\tthis._size -= 1;\n\t}\n\n\t*[Symbol.iterator](): Iterator<E> {\n\t\tlet node = this._first;\n\t\twhile (node !== Node.Undefined) {\n\t\t\tyield node.element;\n\t\t\tnode = node.next;\n\t\t}\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { URI } from 'vs/base/common/uri';\n\ninterface ResourceMapKeyFn {\n\t(resource: URI): string;\n}\n\nclass ResourceMapEntry<T> {\n\tconstructor(readonly uri: URI, readonly value: T) { }\n}\n\nfunction isEntries<T>(arg: ResourceMap<T> | ResourceMapKeyFn | readonly (readonly [URI, T])[] | undefined): arg is readonly (readonly [URI, T])[] {\n\treturn Array.isArray(arg);\n}\n\nexport class ResourceMap<T> implements Map<URI, T> {\n\n\tprivate static readonly defaultToKey = (resource: URI) => resource.toString();\n\n\treadonly [Symbol.toStringTag] = 'ResourceMap';\n\n\tprivate readonly map: Map<string, ResourceMapEntry<T>>;\n\tprivate readonly toKey: ResourceMapKeyFn;\n\n\t/**\n\t *\n\t * @param toKey Custom uri identity function, e.g use an existing `IExtUri#getComparison`-util\n\t */\n\tconstructor(toKey?: ResourceMapKeyFn);\n\n\t/**\n\t *\n\t * @param other Another resource which this maps is created from\n\t * @param toKey Custom uri identity function, e.g use an existing `IExtUri#getComparison`-util\n\t */\n\tconstructor(other?: ResourceMap<T>, toKey?: ResourceMapKeyFn);\n\n\t/**\n\t *\n\t * @param other Another resource which this maps is created from\n\t * @param toKey Custom uri identity function, e.g use an existing `IExtUri#getComparison`-util\n\t */\n\tconstructor(entries?: readonly (readonly [URI, T])[], toKey?: ResourceMapKeyFn);\n\n\tconstructor(arg?: ResourceMap<T> | ResourceMapKeyFn | readonly (readonly [URI, T])[], toKey?: ResourceMapKeyFn) {\n\t\tif (arg instanceof ResourceMap) {\n\t\t\tthis.map = new Map(arg.map);\n\t\t\tthis.toKey = toKey ?? ResourceMap.defaultToKey;\n\t\t} else if (isEntries(arg)) {\n\t\t\tthis.map = new Map();\n\t\t\tthis.toKey = toKey ?? ResourceMap.defaultToKey;\n\n\t\t\tfor (const [resource, value] of arg) {\n\t\t\t\tthis.set(resource, value);\n\t\t\t}\n\t\t} else {\n\t\t\tthis.map = new Map();\n\t\t\tthis.toKey = arg ?? ResourceMap.defaultToKey;\n\t\t}\n\t}\n\n\tset(resource: URI, value: T): this {\n\t\tthis.map.set(this.toKey(resource), new ResourceMapEntry(resource, value));\n\t\treturn this;\n\t}\n\n\tget(resource: URI): T | undefined {\n\t\treturn this.map.get(this.toKey(resource))?.value;\n\t}\n\n\thas(resource: URI): boolean {\n\t\treturn this.map.has(this.toKey(resource));\n\t}\n\n\tget size(): number {\n\t\treturn this.map.size;\n\t}\n\n\tclear(): void {\n\t\tthis.map.clear();\n\t}\n\n\tdelete(resource: URI): boolean {\n\t\treturn this.map.delete(this.toKey(resource));\n\t}\n\n\tforEach(clb: (value: T, key: URI, map: Map<URI, T>) => void, thisArg?: any): void {\n\t\tif (typeof thisArg !== 'undefined') {\n\t\t\tclb = clb.bind(thisArg);\n\t\t}\n\t\tfor (const [_, entry] of this.map) {\n\t\t\tclb(entry.value, entry.uri, <any>this);\n\t\t}\n\t}\n\n\t*values(): IterableIterator<T> {\n\t\tfor (const entry of this.map.values()) {\n\t\t\tyield entry.value;\n\t\t}\n\t}\n\n\t*keys(): IterableIterator<URI> {\n\t\tfor (const entry of this.map.values()) {\n\t\t\tyield entry.uri;\n\t\t}\n\t}\n\n\t*entries(): IterableIterator<[URI, T]> {\n\t\tfor (const entry of this.map.values()) {\n\t\t\tyield [entry.uri, entry.value];\n\t\t}\n\t}\n\n\t*[Symbol.iterator](): IterableIterator<[URI, T]> {\n\t\tfor (const [, entry] of this.map) {\n\t\t\tyield [entry.uri, entry.value];\n\t\t}\n\t}\n}\n\n\ninterface Item<K, V> {\n\tprevious: Item<K, V> | undefined;\n\tnext: Item<K, V> | undefined;\n\tkey: K;\n\tvalue: V;\n}\n\nexport const enum Touch {\n\tNone = 0,\n\tAsOld = 1,\n\tAsNew = 2\n}\n\nexport class LinkedMap<K, V> implements Map<K, V> {\n\n\treadonly [Symbol.toStringTag] = 'LinkedMap';\n\n\tprivate _map: Map<K, Item<K, V>>;\n\tprivate _head: Item<K, V> | undefined;\n\tprivate _tail: Item<K, V> | undefined;\n\tprivate _size: number;\n\n\tprivate _state: number;\n\n\tconstructor() {\n\t\tthis._map = new Map<K, Item<K, V>>();\n\t\tthis._head = undefined;\n\t\tthis._tail = undefined;\n\t\tthis._size = 0;\n\t\tthis._state = 0;\n\t}\n\n\tclear(): void {\n\t\tthis._map.clear();\n\t\tthis._head = undefined;\n\t\tthis._tail = undefined;\n\t\tthis._size = 0;\n\t\tthis._state++;\n\t}\n\n\tisEmpty(): boolean {\n\t\treturn !this._head && !this._tail;\n\t}\n\n\tget size(): number {\n\t\treturn this._size;\n\t}\n\n\tget first(): V | undefined {\n\t\treturn this._head?.value;\n\t}\n\n\tget last(): V | undefined {\n\t\treturn this._tail?.value;\n\t}\n\n\thas(key: K): boolean {\n\t\treturn this._map.has(key);\n\t}\n\n\tget(key: K, touch: Touch = Touch.None): V | undefined {\n\t\tconst item = this._map.get(key);\n\t\tif (!item) {\n\t\t\treturn undefined;\n\t\t}\n\t\tif (touch !== Touch.None) {\n\t\t\tthis.touch(item, touch);\n\t\t}\n\t\treturn item.value;\n\t}\n\n\tset(key: K, value: V, touch: Touch = Touch.None): this {\n\t\tlet item = this._map.get(key);\n\t\tif (item) {\n\t\t\titem.value = value;\n\t\t\tif (touch !== Touch.None) {\n\t\t\t\tthis.touch(item, touch);\n\t\t\t}\n\t\t} else {\n\t\t\titem = { key, value, next: undefined, previous: undefined };\n\t\t\tswitch (touch) {\n\t\t\t\tcase Touch.None:\n\t\t\t\t\tthis.addItemLast(item);\n\t\t\t\t\tbreak;\n\t\t\t\tcase Touch.AsOld:\n\t\t\t\t\tthis.addItemFirst(item);\n\t\t\t\t\tbreak;\n\t\t\t\tcase Touch.AsNew:\n\t\t\t\t\tthis.addItemLast(item);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tthis.addItemLast(item);\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tthis._map.set(key, item);\n\t\t\tthis._size++;\n\t\t}\n\t\treturn this;\n\t}\n\n\tdelete(key: K): boolean {\n\t\treturn !!this.remove(key);\n\t}\n\n\tremove(key: K): V | undefined {\n\t\tconst item = this._map.get(key);\n\t\tif (!item) {\n\t\t\treturn undefined;\n\t\t}\n\t\tthis._map.delete(key);\n\t\tthis.removeItem(item);\n\t\tthis._size--;\n\t\treturn item.value;\n\t}\n\n\tshift(): V | undefined {\n\t\tif (!this._head && !this._tail) {\n\t\t\treturn undefined;\n\t\t}\n\t\tif (!this._head || !this._tail) {\n\t\t\tthrow new Error('Invalid list');\n\t\t}\n\t\tconst item = this._head;\n\t\tthis._map.delete(item.key);\n\t\tthis.removeItem(item);\n\t\tthis._size--;\n\t\treturn item.value;\n\t}\n\n\tforEach(callbackfn: (value: V, key: K, map: LinkedMap<K, V>) => void, thisArg?: any): void {\n\t\tconst state = this._state;\n\t\tlet current = this._head;\n\t\twhile (current) {\n\t\t\tif (thisArg) {\n\t\t\t\tcallbackfn.bind(thisArg)(current.value, current.key, this);\n\t\t\t} else {\n\t\t\t\tcallbackfn(current.value, current.key, this);\n\t\t\t}\n\t\t\tif (this._state !== state) {\n\t\t\t\tthrow new Error(`LinkedMap got modified during iteration.`);\n\t\t\t}\n\t\t\tcurrent = current.next;\n\t\t}\n\t}\n\n\tkeys(): IterableIterator<K> {\n\t\tconst map = this;\n\t\tconst state = this._state;\n\t\tlet current = this._head;\n\t\tconst iterator: IterableIterator<K> = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn iterator;\n\t\t\t},\n\t\t\tnext(): IteratorResult<K> {\n\t\t\t\tif (map._state !== state) {\n\t\t\t\t\tthrow new Error(`LinkedMap got modified during iteration.`);\n\t\t\t\t}\n\t\t\t\tif (current) {\n\t\t\t\t\tconst result = { value: current.key, done: false };\n\t\t\t\t\tcurrent = current.next;\n\t\t\t\t\treturn result;\n\t\t\t\t} else {\n\t\t\t\t\treturn { value: undefined, done: true };\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\treturn iterator;\n\t}\n\n\tvalues(): IterableIterator<V> {\n\t\tconst map = this;\n\t\tconst state = this._state;\n\t\tlet current = this._head;\n\t\tconst iterator: IterableIterator<V> = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn iterator;\n\t\t\t},\n\t\t\tnext(): IteratorResult<V> {\n\t\t\t\tif (map._state !== state) {\n\t\t\t\t\tthrow new Error(`LinkedMap got modified during iteration.`);\n\t\t\t\t}\n\t\t\t\tif (current) {\n\t\t\t\t\tconst result = { value: current.value, done: false };\n\t\t\t\t\tcurrent = current.next;\n\t\t\t\t\treturn result;\n\t\t\t\t} else {\n\t\t\t\t\treturn { value: undefined, done: true };\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\treturn iterator;\n\t}\n\n\tentries(): IterableIterator<[K, V]> {\n\t\tconst map = this;\n\t\tconst state = this._state;\n\t\tlet current = this._head;\n\t\tconst iterator: IterableIterator<[K, V]> = {\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn iterator;\n\t\t\t},\n\t\t\tnext(): IteratorResult<[K, V]> {\n\t\t\t\tif (map._state !== state) {\n\t\t\t\t\tthrow new Error(`LinkedMap got modified during iteration.`);\n\t\t\t\t}\n\t\t\t\tif (current) {\n\t\t\t\t\tconst result: IteratorResult<[K, V]> = { value: [current.key, current.value], done: false };\n\t\t\t\t\tcurrent = current.next;\n\t\t\t\t\treturn result;\n\t\t\t\t} else {\n\t\t\t\t\treturn { value: undefined, done: true };\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\treturn iterator;\n\t}\n\n\t[Symbol.iterator](): IterableIterator<[K, V]> {\n\t\treturn this.entries();\n\t}\n\n\tprotected trimOld(newSize: number) {\n\t\tif (newSize >= this.size) {\n\t\t\treturn;\n\t\t}\n\t\tif (newSize === 0) {\n\t\t\tthis.clear();\n\t\t\treturn;\n\t\t}\n\t\tlet current = this._head;\n\t\tlet currentSize = this.size;\n\t\twhile (current && currentSize > newSize) {\n\t\t\tthis._map.delete(current.key);\n\t\t\tcurrent = current.next;\n\t\t\tcurrentSize--;\n\t\t}\n\t\tthis._head = current;\n\t\tthis._size = currentSize;\n\t\tif (current) {\n\t\t\tcurrent.previous = undefined;\n\t\t}\n\t\tthis._state++;\n\t}\n\n\tprotected trimNew(newSize: number) {\n\t\tif (newSize >= this.size) {\n\t\t\treturn;\n\t\t}\n\t\tif (newSize === 0) {\n\t\t\tthis.clear();\n\t\t\treturn;\n\t\t}\n\t\tlet current = this._tail;\n\t\tlet currentSize = this.size;\n\t\twhile (current && currentSize > newSize) {\n\t\t\tthis._map.delete(current.key);\n\t\t\tcurrent = current.previous;\n\t\t\tcurrentSize--;\n\t\t}\n\t\tthis._tail = current;\n\t\tthis._size = currentSize;\n\t\tif (current) {\n\t\t\tcurrent.next = undefined;\n\t\t}\n\t\tthis._state++;\n\t}\n\n\tprivate addItemFirst(item: Item<K, V>): void {\n\t\t// First time Insert\n\t\tif (!this._head && !this._tail) {\n\t\t\tthis._tail = item;\n\t\t} else if (!this._head) {\n\t\t\tthrow new Error('Invalid list');\n\t\t} else {\n\t\t\titem.next = this._head;\n\t\t\tthis._head.previous = item;\n\t\t}\n\t\tthis._head = item;\n\t\tthis._state++;\n\t}\n\n\tprivate addItemLast(item: Item<K, V>): void {\n\t\t// First time Insert\n\t\tif (!this._head && !this._tail) {\n\t\t\tthis._head = item;\n\t\t} else if (!this._tail) {\n\t\t\tthrow new Error('Invalid list');\n\t\t} else {\n\t\t\titem.previous = this._tail;\n\t\t\tthis._tail.next = item;\n\t\t}\n\t\tthis._tail = item;\n\t\tthis._state++;\n\t}\n\n\tprivate removeItem(item: Item<K, V>): void {\n\t\tif (item === this._head && item === this._tail) {\n\t\t\tthis._head = undefined;\n\t\t\tthis._tail = undefined;\n\t\t}\n\t\telse if (item === this._head) {\n\t\t\t// This can only happen if size === 1 which is handled\n\t\t\t// by the case above.\n\t\t\tif (!item.next) {\n\t\t\t\tthrow new Error('Invalid list');\n\t\t\t}\n\t\t\titem.next.previous = undefined;\n\t\t\tthis._head = item.next;\n\t\t}\n\t\telse if (item === this._tail) {\n\t\t\t// This can only happen if size === 1 which is handled\n\t\t\t// by the case above.\n\t\t\tif (!item.previous) {\n\t\t\t\tthrow new Error('Invalid list');\n\t\t\t}\n\t\t\titem.previous.next = undefined;\n\t\t\tthis._tail = item.previous;\n\t\t}\n\t\telse {\n\t\t\tconst next = item.next;\n\t\t\tconst previous = item.previous;\n\t\t\tif (!next || !previous) {\n\t\t\t\tthrow new Error('Invalid list');\n\t\t\t}\n\t\t\tnext.previous = previous;\n\t\t\tprevious.next = next;\n\t\t}\n\t\titem.next = undefined;\n\t\titem.previous = undefined;\n\t\tthis._state++;\n\t}\n\n\tprivate touch(item: Item<K, V>, touch: Touch): void {\n\t\tif (!this._head || !this._tail) {\n\t\t\tthrow new Error('Invalid list');\n\t\t}\n\t\tif ((touch !== Touch.AsOld && touch !== Touch.AsNew)) {\n\t\t\treturn;\n\t\t}\n\n\t\tif (touch === Touch.AsOld) {\n\t\t\tif (item === this._head) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst next = item.next;\n\t\t\tconst previous = item.previous;\n\n\t\t\t// Unlink the item\n\t\t\tif (item === this._tail) {\n\t\t\t\t// previous must be defined since item was not head but is tail\n\t\t\t\t// So there are more than on item in the map\n\t\t\t\tprevious!.next = undefined;\n\t\t\t\tthis._tail = previous;\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// Both next and previous are not undefined since item was neither head nor tail.\n\t\t\t\tnext!.previous = previous;\n\t\t\t\tprevious!.next = next;\n\t\t\t}\n\n\t\t\t// Insert the node at head\n\t\t\titem.previous = undefined;\n\t\t\titem.next = this._head;\n\t\t\tthis._head.previous = item;\n\t\t\tthis._head = item;\n\t\t\tthis._state++;\n\t\t} else if (touch === Touch.AsNew) {\n\t\t\tif (item === this._tail) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst next = item.next;\n\t\t\tconst previous = item.previous;\n\n\t\t\t// Unlink the item.\n\t\t\tif (item === this._head) {\n\t\t\t\t// next must be defined since item was not tail but is head\n\t\t\t\t// So there are more than on item in the map\n\t\t\t\tnext!.previous = undefined;\n\t\t\t\tthis._head = next;\n\t\t\t} else {\n\t\t\t\t// Both next and previous are not undefined since item was neither head nor tail.\n\t\t\t\tnext!.previous = previous;\n\t\t\t\tprevious!.next = next;\n\t\t\t}\n\t\t\titem.next = undefined;\n\t\t\titem.previous = this._tail;\n\t\t\tthis._tail.next = item;\n\t\t\tthis._tail = item;\n\t\t\tthis._state++;\n\t\t}\n\t}\n\n\ttoJSON(): [K, V][] {\n\t\tconst data: [K, V][] = [];\n\n\t\tthis.forEach((value, key) => {\n\t\t\tdata.push([key, value]);\n\t\t});\n\n\t\treturn data;\n\t}\n\n\tfromJSON(data: [K, V][]): void {\n\t\tthis.clear();\n\n\t\tfor (const [key, value] of data) {\n\t\t\tthis.set(key, value);\n\t\t}\n\t}\n}\n\nabstract class Cache<K, V> extends LinkedMap<K, V> {\n\n\tprotected _limit: number;\n\tprotected _ratio: number;\n\n\tconstructor(limit: number, ratio: number = 1) {\n\t\tsuper();\n\t\tthis._limit = limit;\n\t\tthis._ratio = Math.min(Math.max(0, ratio), 1);\n\t}\n\n\tget limit(): number {\n\t\treturn this._limit;\n\t}\n\n\tset limit(limit: number) {\n\t\tthis._limit = limit;\n\t\tthis.checkTrim();\n\t}\n\n\toverride get(key: K, touch: Touch = Touch.AsNew): V | undefined {\n\t\treturn super.get(key, touch);\n\t}\n\n\tpeek(key: K): V | undefined {\n\t\treturn super.get(key, Touch.None);\n\t}\n\n\toverride set(key: K, value: V): this {\n\t\tsuper.set(key, value, Touch.AsNew);\n\t\treturn this;\n\t}\n\n\tprotected checkTrim() {\n\t\tif (this.size > this._limit) {\n\t\t\tthis.trim(Math.round(this._limit * this._ratio));\n\t\t}\n\t}\n\n\tprotected abstract trim(newSize: number): void;\n}\n\nexport class LRUCache<K, V> extends Cache<K, V> {\n\n\tconstructor(limit: number, ratio: number = 1) {\n\t\tsuper(limit, ratio);\n\t}\n\n\tprotected override trim(newSize: number) {\n\t\tthis.trimOld(newSize);\n\t}\n\n\toverride set(key: K, value: V): this {\n\t\tsuper.set(key, value);\n\t\tthis.checkTrim();\n\t\treturn this;\n\t}\n}\n\n/**\n * A map that allows access both by keys and values.\n * **NOTE**: values need to be unique.\n */\nexport class BidirectionalMap<K, V> {\n\n\tprivate readonly _m1 = new Map<K, V>();\n\tprivate readonly _m2 = new Map<V, K>();\n\n\tconstructor(entries?: readonly (readonly [K, V])[]) {\n\t\tif (entries) {\n\t\t\tfor (const [key, value] of entries) {\n\t\t\t\tthis.set(key, value);\n\t\t\t}\n\t\t}\n\t}\n\n\tclear(): void {\n\t\tthis._m1.clear();\n\t\tthis._m2.clear();\n\t}\n\n\tset(key: K, value: V): void {\n\t\tthis._m1.set(key, value);\n\t\tthis._m2.set(value, key);\n\t}\n\n\tget(key: K): V | undefined {\n\t\treturn this._m1.get(key);\n\t}\n\n\tgetKey(value: V): K | undefined {\n\t\treturn this._m2.get(value);\n\t}\n\n\tdelete(key: K): boolean {\n\t\tconst value = this._m1.get(key);\n\t\tif (value === undefined) {\n\t\t\treturn false;\n\t\t}\n\t\tthis._m1.delete(key);\n\t\tthis._m2.delete(value);\n\t\treturn true;\n\t}\n\n\tkeys(): IterableIterator<K> {\n\t\treturn this._m1.keys();\n\t}\n\n\tvalues(): IterableIterator<V> {\n\t\treturn this._m1.values();\n\t}\n}\n\nexport class SetMap<K, V> {\n\n\tprivate map = new Map<K, Set<V>>();\n\n\tadd(key: K, value: V): void {\n\t\tlet values = this.map.get(key);\n\n\t\tif (!values) {\n\t\t\tvalues = new Set<V>();\n\t\t\tthis.map.set(key, values);\n\t\t}\n\n\t\tvalues.add(value);\n\t}\n\n\tdelete(key: K, value: V): void {\n\t\tconst values = this.map.get(key);\n\n\t\tif (!values) {\n\t\t\treturn;\n\t\t}\n\n\t\tvalues.delete(value);\n\n\t\tif (values.size === 0) {\n\t\t\tthis.map.delete(key);\n\t\t}\n\t}\n\n\tforEach(key: K, fn: (value: V) => void): void {\n\t\tconst values = this.map.get(key);\n\n\t\tif (!values) {\n\t\t\treturn;\n\t\t}\n\n\t\tvalues.forEach(fn);\n\t}\n\n\tget(key: K): ReadonlySet<V> {\n\t\tconst values = this.map.get(key);\n\t\tif (!values) {\n\t\t\treturn new Set<V>();\n\t\t}\n\t\treturn values;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n// fake definition so that the valid layers check won't trip on this\ndeclare const globalThis: { performance?: { now(): number } };\n\nconst hasPerformanceNow = (globalThis.performance && typeof globalThis.performance.now === 'function');\n\nexport class StopWatch {\n\n\tprivate _startTime: number;\n\tprivate _stopTime: number;\n\n\tprivate readonly _now: () => number;\n\n\tpublic static create(highResolution?: boolean): StopWatch {\n\t\treturn new StopWatch(highResolution);\n\t}\n\n\tconstructor(highResolution?: boolean) {\n\t\tthis._now = hasPerformanceNow && highResolution === false ? Date.now : globalThis.performance!.now.bind(globalThis.performance);\n\t\tthis._startTime = this._now();\n\t\tthis._stopTime = -1;\n\t}\n\n\tpublic stop(): void {\n\t\tthis._stopTime = this._now();\n\t}\n\n\tpublic reset(): void {\n\t\tthis._startTime = this._now();\n\t\tthis._stopTime = -1;\n\t}\n\n\tpublic elapsed(): number {\n\t\tif (this._stopTime !== -1) {\n\t\t\treturn this._stopTime - this._startTime;\n\t\t}\n\t\treturn this._now() - this._startTime;\n\t}\n}\n","\nimport { onUnexpectedError } from 'vs/base/common/errors';\nimport { createSingleCallFunction } from 'vs/base/common/functional';\nimport { combinedDisposable, Disposable, DisposableStore, IDisposable, toDisposable } from 'vs/base/common/lifecycle';\nimport { LinkedList } from 'vs/base/common/linkedList';\nimport { IObservable, IObserver } from 'vs/base/common/observable';\nimport { StopWatch } from 'vs/base/common/stopwatch';\nimport { MicrotaskDelay } from 'vs/base/common/symbols';\n\n\n// -----------------------------------------------------------------------------------------------------------------------\n// Uncomment the next line to print warnings whenever a listener is GC'ed without having been disposed. This is a LEAK.\n// -----------------------------------------------------------------------------------------------------------------------\nconst _enableListenerGCedWarning = false\n\t// || Boolean(\"TRUE\") // causes a linter warning so that it cannot be pushed\n\t;\n\n// -----------------------------------------------------------------------------------------------------------------------\n// Uncomment the next line to print warnings whenever an emitter with listeners is disposed. That is a sign of code smell.\n// -----------------------------------------------------------------------------------------------------------------------\nconst _enableDisposeWithListenerWarning = false\n\t// || Boolean(\"TRUE\") // causes a linter warning so that it cannot be pushed\n\t;\n\n\n// -----------------------------------------------------------------------------------------------------------------------\n// Uncomment the next line to print warnings whenever a snapshotted event is used repeatedly without cleanup.\n// See https://github.com/microsoft/vscode/issues/142851\n// -----------------------------------------------------------------------------------------------------------------------\nconst _enableSnapshotPotentialLeakWarning = false\n\t// || Boolean(\"TRUE\") // causes a linter warning so that it cannot be pushed\n\t;\n\n/**\n * An event with zero or one parameters that can be subscribed to. The event is a function itself.\n */\nexport interface Event<T> {\n\t(listener: (e: T) => any, thisArgs?: any, disposables?: IDisposable[] | DisposableStore): IDisposable;\n}\n\nexport namespace Event {\n\texport const None: Event<any> = () => Disposable.None;\n\n\tfunction _addLeakageTraceLogic(options: EmitterOptions) {\n\t\tif (_enableSnapshotPotentialLeakWarning) {\n\t\t\tconst { onDidAddListener: origListenerDidAdd } = options;\n\t\t\tconst stack = Stacktrace.create();\n\t\t\tlet count = 0;\n\t\t\toptions.onDidAddListener = () => {\n\t\t\t\tif (++count === 2) {\n\t\t\t\t\tconsole.warn('snapshotted emitter LIKELY used public and SHOULD HAVE BEEN created with DisposableStore. snapshotted here');\n\t\t\t\t\tstack.print();\n\t\t\t\t}\n\t\t\t\torigListenerDidAdd?.();\n\t\t\t};\n\t\t}\n\t}\n\n\t/**\n\t * Given an event, returns another event which debounces calls and defers the listeners to a later task via a shared\n\t * `setTimeout`. The event is converted into a signal (`Event<void>`) to avoid additional object creation as a\n\t * result of merging events and to try prevent race conditions that could arise when using related deferred and\n\t * non-deferred events.\n\t *\n\t * This is useful for deferring non-critical work (eg. general UI updates) to ensure it does not block critical work\n\t * (eg. latency of keypress to text rendered).\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t *\n\t * @param event The event source for the new event.\n\t * @param disposable A disposable store to add the new EventEmitter to.\n\t */\n\texport function defer(event: Event<unknown>, disposable?: DisposableStore): Event<void> {\n\t\treturn debounce<unknown, void>(event, () => void 0, 0, undefined, true, undefined, disposable);\n\t}\n\n\t/**\n\t * Given an event, returns another event which only fires once.\n\t *\n\t * @param event The event source for the new event.\n\t */\n\texport function once<T>(event: Event<T>): Event<T> {\n\t\treturn (listener, thisArgs = null, disposables?) => {\n\t\t\t// we need this, in case the event fires during the listener call\n\t\t\tlet didFire = false;\n\t\t\tlet result: IDisposable | undefined = undefined;\n\t\t\tresult = event(e => {\n\t\t\t\tif (didFire) {\n\t\t\t\t\treturn;\n\t\t\t\t} else if (result) {\n\t\t\t\t\tresult.dispose();\n\t\t\t\t} else {\n\t\t\t\t\tdidFire = true;\n\t\t\t\t}\n\n\t\t\t\treturn listener.call(thisArgs, e);\n\t\t\t}, null, disposables);\n\n\t\t\tif (didFire) {\n\t\t\t\tresult.dispose();\n\t\t\t}\n\n\t\t\treturn result;\n\t\t};\n\t}\n\n\t/**\n\t * Given an event, returns another event which only fires once, and only when the condition is met.\n\t *\n\t * @param event The event source for the new event.\n\t */\n\texport function onceIf<T>(event: Event<T>, condition: (e: T) => boolean): Event<T> {\n\t\treturn Event.once(Event.filter(event, condition));\n\t}\n\n\t/**\n\t * Maps an event of one type into an event of another type using a mapping function, similar to how\n\t * `Array.prototype.map` works.\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t *\n\t * @param event The event source for the new event.\n\t * @param map The mapping function.\n\t * @param disposable A disposable store to add the new EventEmitter to.\n\t */\n\texport function map<I, O>(event: Event<I>, map: (i: I) => O, disposable?: DisposableStore): Event<O> {\n\t\treturn snapshot((listener, thisArgs = null, disposables?) => event(i => listener.call(thisArgs, map(i)), null, disposables), disposable);\n\t}\n\n\t/**\n\t * Wraps an event in another event that performs some function on the event object before firing.\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t *\n\t * @param event The event source for the new event.\n\t * @param each The function to perform on the event object.\n\t * @param disposable A disposable store to add the new EventEmitter to.\n\t */\n\texport function forEach<I>(event: Event<I>, each: (i: I) => void, disposable?: DisposableStore): Event<I> {\n\t\treturn snapshot((listener, thisArgs = null, disposables?) => event(i => { each(i); listener.call(thisArgs, i); }, null, disposables), disposable);\n\t}\n\n\t/**\n\t * Wraps an event in another event that fires only when some condition is met.\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t *\n\t * @param event The event source for the new event.\n\t * @param filter The filter function that defines the condition. The event will fire for the object if this function\n\t * returns true.\n\t * @param disposable A disposable store to add the new EventEmitter to.\n\t */\n\texport function filter<T, U>(event: Event<T | U>, filter: (e: T | U) => e is T, disposable?: DisposableStore): Event<T>;\n\texport function filter<T>(event: Event<T>, filter: (e: T) => boolean, disposable?: DisposableStore): Event<T>;\n\texport function filter<T, R>(event: Event<T | R>, filter: (e: T | R) => e is R, disposable?: DisposableStore): Event<R>;\n\texport function filter<T>(event: Event<T>, filter: (e: T) => boolean, disposable?: DisposableStore): Event<T> {\n\t\treturn snapshot((listener, thisArgs = null, disposables?) => event(e => filter(e) && listener.call(thisArgs, e), null, disposables), disposable);\n\t}\n\n\t/**\n\t * Given an event, returns the same event but typed as `Event<void>`.\n\t */\n\texport function signal<T>(event: Event<T>): Event<void> {\n\t\treturn event as Event<any> as Event<void>;\n\t}\n\n\t/**\n\t * Given a collection of events, returns a single event which emits whenever any of the provided events emit.\n\t */\n\texport function any<T>(...events: Event<T>[]): Event<T>;\n\texport function any(...events: Event<any>[]): Event<void>;\n\texport function any<T>(...events: Event<T>[]): Event<T> {\n\t\treturn (listener, thisArgs = null, disposables?) => {\n\t\t\tconst disposable = combinedDisposable(...events.map(event => event(e => listener.call(thisArgs, e))));\n\t\t\treturn addAndReturnDisposable(disposable, disposables);\n\t\t};\n\t}\n\n\t/**\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t */\n\texport function reduce<I, O>(event: Event<I>, merge: (last: O | undefined, event: I) => O, initial?: O, disposable?: DisposableStore): Event<O> {\n\t\tlet output: O | undefined = initial;\n\n\t\treturn map<I, O>(event, e => {\n\t\t\toutput = merge(output, e);\n\t\t\treturn output;\n\t\t}, disposable);\n\t}\n\n\tfunction snapshot<T>(event: Event<T>, disposable: DisposableStore | undefined): Event<T> {\n\t\tlet listener: IDisposable | undefined;\n\n\t\tconst options: EmitterOptions | undefined = {\n\t\t\tonWillAddFirstListener() {\n\t\t\t\tlistener = event(emitter.fire, emitter);\n\t\t\t},\n\t\t\tonDidRemoveLastListener() {\n\t\t\t\tlistener?.dispose();\n\t\t\t}\n\t\t};\n\n\t\tif (!disposable) {\n\t\t\t_addLeakageTraceLogic(options);\n\t\t}\n\n\t\tconst emitter = new Emitter<T>(options);\n\n\t\tdisposable?.add(emitter);\n\n\t\treturn emitter.event;\n\t}\n\n\t/**\n\t * Adds the IDisposable to the store if it's set, and returns it. Useful to\n\t * Event function implementation.\n\t */\n\tfunction addAndReturnDisposable<T extends IDisposable>(d: T, store: DisposableStore | IDisposable[] | undefined): T {\n\t\tif (store instanceof Array) {\n\t\t\tstore.push(d);\n\t\t} else if (store) {\n\t\t\tstore.add(d);\n\t\t}\n\t\treturn d;\n\t}\n\n\t/**\n\t * Given an event, creates a new emitter that event that will debounce events based on {@link delay} and give an\n\t * array event object of all events that fired.\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t *\n\t * @param event The original event to debounce.\n\t * @param merge A function that reduces all events into a single event.\n\t * @param delay The number of milliseconds to debounce.\n\t * @param leading Whether to fire a leading event without debouncing.\n\t * @param flushOnListenerRemove Whether to fire all debounced events when a listener is removed. If this is not\n\t * specified, some events could go missing. Use this if it's important that all events are processed, even if the\n\t * listener gets disposed before the debounced event fires.\n\t * @param leakWarningThreshold See {@link EmitterOptions.leakWarningThreshold}.\n\t * @param disposable A disposable store to register the debounce emitter to.\n\t */\n\texport function debounce<T>(event: Event<T>, merge: (last: T | undefined, event: T) => T, delay?: number | typeof MicrotaskDelay, leading?: boolean, flushOnListenerRemove?: boolean, leakWarningThreshold?: number, disposable?: DisposableStore): Event<T>;\n\texport function debounce<I, O>(event: Event<I>, merge: (last: O | undefined, event: I) => O, delay?: number | typeof MicrotaskDelay, leading?: boolean, flushOnListenerRemove?: boolean, leakWarningThreshold?: number, disposable?: DisposableStore): Event<O>;\n\texport function debounce<I, O>(event: Event<I>, merge: (last: O | undefined, event: I) => O, delay: number | typeof MicrotaskDelay = 100, leading = false, flushOnListenerRemove = false, leakWarningThreshold?: number, disposable?: DisposableStore): Event<O> {\n\t\tlet subscription: IDisposable;\n\t\tlet output: O | undefined = undefined;\n\t\tlet handle: any = undefined;\n\t\tlet numDebouncedCalls = 0;\n\t\tlet doFire: (() => void) | undefined;\n\n\t\tconst options: EmitterOptions | undefined = {\n\t\t\tleakWarningThreshold,\n\t\t\tonWillAddFirstListener() {\n\t\t\t\tsubscription = event(cur => {\n\t\t\t\t\tnumDebouncedCalls++;\n\t\t\t\t\toutput = merge(output, cur);\n\n\t\t\t\t\tif (leading && !handle) {\n\t\t\t\t\t\temitter.fire(output);\n\t\t\t\t\t\toutput = undefined;\n\t\t\t\t\t}\n\n\t\t\t\t\tdoFire = () => {\n\t\t\t\t\t\tconst _output = output;\n\t\t\t\t\t\toutput = undefined;\n\t\t\t\t\t\thandle = undefined;\n\t\t\t\t\t\tif (!leading || numDebouncedCalls > 1) {\n\t\t\t\t\t\t\temitter.fire(_output!);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tnumDebouncedCalls = 0;\n\t\t\t\t\t};\n\n\t\t\t\t\tif (typeof delay === 'number') {\n\t\t\t\t\t\tclearTimeout(handle);\n\t\t\t\t\t\thandle = setTimeout(doFire, delay);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (handle === undefined) {\n\t\t\t\t\t\t\thandle = 0;\n\t\t\t\t\t\t\tqueueMicrotask(doFire);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t},\n\t\t\tonWillRemoveListener() {\n\t\t\t\tif (flushOnListenerRemove && numDebouncedCalls > 0) {\n\t\t\t\t\tdoFire?.();\n\t\t\t\t}\n\t\t\t},\n\t\t\tonDidRemoveLastListener() {\n\t\t\t\tdoFire = undefined;\n\t\t\t\tsubscription.dispose();\n\t\t\t}\n\t\t};\n\n\t\tif (!disposable) {\n\t\t\t_addLeakageTraceLogic(options);\n\t\t}\n\n\t\tconst emitter = new Emitter<O>(options);\n\n\t\tdisposable?.add(emitter);\n\n\t\treturn emitter.event;\n\t}\n\n\t/**\n\t * Debounces an event, firing after some delay (default=0) with an array of all event original objects.\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t */\n\texport function accumulate<T>(event: Event<T>, delay: number = 0, disposable?: DisposableStore): Event<T[]> {\n\t\treturn Event.debounce<T, T[]>(event, (last, e) => {\n\t\t\tif (!last) {\n\t\t\t\treturn [e];\n\t\t\t}\n\t\t\tlast.push(e);\n\t\t\treturn last;\n\t\t}, delay, undefined, true, undefined, disposable);\n\t}\n\n\t/**\n\t * Filters an event such that some condition is _not_ met more than once in a row, effectively ensuring duplicate\n\t * event objects from different sources do not fire the same event object.\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t *\n\t * @param event The event source for the new event.\n\t * @param equals The equality condition.\n\t * @param disposable A disposable store to add the new EventEmitter to.\n\t *\n\t * @example\n\t * ```\n\t * // Fire only one time when a single window is opened or focused\n\t * Event.latch(Event.any(onDidOpenWindow, onDidFocusWindow))\n\t * ```\n\t */\n\texport function latch<T>(event: Event<T>, equals: (a: T, b: T) => boolean = (a, b) => a === b, disposable?: DisposableStore): Event<T> {\n\t\tlet firstCall = true;\n\t\tlet cache: T;\n\n\t\treturn filter(event, value => {\n\t\t\tconst shouldEmit = firstCall || !equals(value, cache);\n\t\t\tfirstCall = false;\n\t\t\tcache = value;\n\t\t\treturn shouldEmit;\n\t\t}, disposable);\n\t}\n\n\t/**\n\t * Splits an event whose parameter is a union type into 2 separate events for each type in the union.\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t *\n\t * @example\n\t * ```\n\t * const event = new EventEmitter<number | undefined>().event;\n\t * const [numberEvent, undefinedEvent] = Event.split(event, isUndefined);\n\t * ```\n\t *\n\t * @param event The event source for the new event.\n\t * @param isT A function that determines what event is of the first type.\n\t * @param disposable A disposable store to add the new EventEmitter to.\n\t */\n\texport function split<T, U>(event: Event<T | U>, isT: (e: T | U) => e is T, disposable?: DisposableStore): [Event<T>, Event<U>] {\n\t\treturn [\n\t\t\tEvent.filter(event, isT, disposable),\n\t\t\tEvent.filter(event, e => !isT(e), disposable) as Event<U>,\n\t\t];\n\t}\n\n\t/**\n\t * Buffers an event until it has a listener attached.\n\t *\n\t * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n\t * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n\t * returned event causes this utility to leak a listener on the original event.\n\t *\n\t * @param event The event source for the new event.\n\t * @param flushAfterTimeout Determines whether to flush the buffer after a timeout immediately or after a\n\t * `setTimeout` when the first event listener is added.\n\t * @param _buffer Internal: A source event array used for tests.\n\t *\n\t * @example\n\t * ```\n\t * // Start accumulating events, when the first listener is attached, flush\n\t * // the event after a timeout such that multiple listeners attached before\n\t * // the timeout would receive the event\n\t * this.onInstallExtension = Event.buffer(service.onInstallExtension, true);\n\t * ```\n\t */\n\texport function buffer<T>(event: Event<T>, flushAfterTimeout = false, _buffer: T[] = [], disposable?: DisposableStore): Event<T> {\n\t\tlet buffer: T[] | null = _buffer.slice();\n\n\t\tlet listener: IDisposable | null = event(e => {\n\t\t\tif (buffer) {\n\t\t\t\tbuffer.push(e);\n\t\t\t} else {\n\t\t\t\temitter.fire(e);\n\t\t\t}\n\t\t});\n\n\t\tif (disposable) {\n\t\t\tdisposable.add(listener);\n\t\t}\n\n\t\tconst flush = () => {\n\t\t\tbuffer?.forEach(e => emitter.fire(e));\n\t\t\tbuffer = null;\n\t\t};\n\n\t\tconst emitter = new Emitter<T>({\n\t\t\tonWillAddFirstListener() {\n\t\t\t\tif (!listener) {\n\t\t\t\t\tlistener = event(e => emitter.fire(e));\n\t\t\t\t\tif (disposable) {\n\t\t\t\t\t\tdisposable.add(listener);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\n\t\t\tonDidAddFirstListener() {\n\t\t\t\tif (buffer) {\n\t\t\t\t\tif (flushAfterTimeout) {\n\t\t\t\t\t\tsetTimeout(flush);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tflush();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\n\t\t\tonDidRemoveLastListener() {\n\t\t\t\tif (listener) {\n\t\t\t\t\tlistener.dispose();\n\t\t\t\t}\n\t\t\t\tlistener = null;\n\t\t\t}\n\t\t});\n\n\t\tif (disposable) {\n\t\t\tdisposable.add(emitter);\n\t\t}\n\n\t\treturn emitter.event;\n\t}\n\t/**\n\t * Wraps the event in an {@link IChainableEvent}, allowing a more functional programming style.\n\t *\n\t * @example\n\t * ```\n\t * // Normal\n\t * const onEnterPressNormal = Event.filter(\n\t *   Event.map(onKeyPress.event, e => new StandardKeyboardEvent(e)),\n\t *   e.keyCode === KeyCode.Enter\n\t * ).event;\n\t *\n\t * // Using chain\n\t * const onEnterPressChain = Event.chain(onKeyPress.event, $ => $\n\t *   .map(e => new StandardKeyboardEvent(e))\n\t *   .filter(e => e.keyCode === KeyCode.Enter)\n\t * );\n\t * ```\n\t */\n\texport function chain<T, R>(event: Event<T>, sythensize: ($: IChainableSythensis<T>) => IChainableSythensis<R>): Event<R> {\n\t\tconst fn: Event<R> = (listener, thisArgs, disposables) => {\n\t\t\tconst cs = sythensize(new ChainableSynthesis()) as ChainableSynthesis;\n\t\t\treturn event(function (value) {\n\t\t\t\tconst result = cs.evaluate(value);\n\t\t\t\tif (result !== HaltChainable) {\n\t\t\t\t\tlistener.call(thisArgs, result);\n\t\t\t\t}\n\t\t\t}, undefined, disposables);\n\t\t};\n\n\t\treturn fn;\n\t}\n\n\tconst HaltChainable = Symbol('HaltChainable');\n\n\tclass ChainableSynthesis implements IChainableSythensis<any> {\n\t\tprivate readonly steps: ((input: any) => any)[] = [];\n\n\t\tmap<O>(fn: (i: any) => O): this {\n\t\t\tthis.steps.push(fn);\n\t\t\treturn this;\n\t\t}\n\n\t\tforEach(fn: (i: any) => void): this {\n\t\t\tthis.steps.push(v => {\n\t\t\t\tfn(v);\n\t\t\t\treturn v;\n\t\t\t});\n\t\t\treturn this;\n\t\t}\n\n\t\tfilter(fn: (e: any) => boolean): this {\n\t\t\tthis.steps.push(v => fn(v) ? v : HaltChainable);\n\t\t\treturn this;\n\t\t}\n\n\t\treduce<R>(merge: (last: R | undefined, event: any) => R, initial?: R | undefined): this {\n\t\t\tlet last = initial;\n\t\t\tthis.steps.push(v => {\n\t\t\t\tlast = merge(last, v);\n\t\t\t\treturn last;\n\t\t\t});\n\t\t\treturn this;\n\t\t}\n\n\t\tlatch(equals: (a: any, b: any) => boolean = (a, b) => a === b): ChainableSynthesis {\n\t\t\tlet firstCall = true;\n\t\t\tlet cache: any;\n\t\t\tthis.steps.push(value => {\n\t\t\t\tconst shouldEmit = firstCall || !equals(value, cache);\n\t\t\t\tfirstCall = false;\n\t\t\t\tcache = value;\n\t\t\t\treturn shouldEmit ? value : HaltChainable;\n\t\t\t});\n\n\t\t\treturn this;\n\t\t}\n\n\t\tpublic evaluate(value: any) {\n\t\t\tfor (const step of this.steps) {\n\t\t\t\tvalue = step(value);\n\t\t\t\tif (value === HaltChainable) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn value;\n\t\t}\n\t}\n\n\texport interface IChainableSythensis<T> {\n\t\tmap<O>(fn: (i: T) => O): IChainableSythensis<O>;\n\t\tforEach(fn: (i: T) => void): IChainableSythensis<T>;\n\t\tfilter<R extends T>(fn: (e: T) => e is R): IChainableSythensis<R>;\n\t\tfilter(fn: (e: T) => boolean): IChainableSythensis<T>;\n\t\treduce<R>(merge: (last: R, event: T) => R, initial: R): IChainableSythensis<R>;\n\t\treduce<R>(merge: (last: R | undefined, event: T) => R): IChainableSythensis<R>;\n\t\tlatch(equals?: (a: T, b: T) => boolean): IChainableSythensis<T>;\n\t}\n\n\texport interface NodeEventEmitter {\n\t\ton(event: string | symbol, listener: Function): unknown;\n\t\tremoveListener(event: string | symbol, listener: Function): unknown;\n\t}\n\n\t/**\n\t * Creates an {@link Event} from a node event emitter.\n\t */\n\texport function fromNodeEventEmitter<T>(emitter: NodeEventEmitter, eventName: string, map: (...args: any[]) => T = id => id): Event<T> {\n\t\tconst fn = (...args: any[]) => result.fire(map(...args));\n\t\tconst onFirstListenerAdd = () => emitter.on(eventName, fn);\n\t\tconst onLastListenerRemove = () => emitter.removeListener(eventName, fn);\n\t\tconst result = new Emitter<T>({ onWillAddFirstListener: onFirstListenerAdd, onDidRemoveLastListener: onLastListenerRemove });\n\n\t\treturn result.event;\n\t}\n\n\texport interface DOMEventEmitter {\n\t\taddEventListener(event: string | symbol, listener: Function): void;\n\t\tremoveEventListener(event: string | symbol, listener: Function): void;\n\t}\n\n\t/**\n\t * Creates an {@link Event} from a DOM event emitter.\n\t */\n\texport function fromDOMEventEmitter<T>(emitter: DOMEventEmitter, eventName: string, map: (...args: any[]) => T = id => id): Event<T> {\n\t\tconst fn = (...args: any[]) => result.fire(map(...args));\n\t\tconst onFirstListenerAdd = () => emitter.addEventListener(eventName, fn);\n\t\tconst onLastListenerRemove = () => emitter.removeEventListener(eventName, fn);\n\t\tconst result = new Emitter<T>({ onWillAddFirstListener: onFirstListenerAdd, onDidRemoveLastListener: onLastListenerRemove });\n\n\t\treturn result.event;\n\t}\n\n\t/**\n\t * Creates a promise out of an event, using the {@link Event.once} helper.\n\t */\n\texport function toPromise<T>(event: Event<T>): Promise<T> {\n\t\treturn new Promise(resolve => once(event)(resolve));\n\t}\n\n\t/**\n\t * Creates an event out of a promise that fires once when the promise is\n\t * resolved with the result of the promise or `undefined`.\n\t */\n\texport function fromPromise<T>(promise: Promise<T>): Event<T | undefined> {\n\t\tconst result = new Emitter<T | undefined>();\n\n\t\tpromise.then(res => {\n\t\t\tresult.fire(res);\n\t\t}, () => {\n\t\t\tresult.fire(undefined);\n\t\t}).finally(() => {\n\t\t\tresult.dispose();\n\t\t});\n\n\t\treturn result.event;\n\t}\n\n\t/**\n\t * A convenience function for forwarding an event to another emitter which\n\t * improves readability.\n\t *\n\t * This is similar to {@link Relay} but allows instantiating and forwarding\n\t * on a single line and also allows for multiple source events.\n\t * @param from The event to forward.\n\t * @param to The emitter to forward the event to.\n\t * @example\n\t * Event.forward(event, emitter);\n\t * // equivalent to\n\t * event(e => emitter.fire(e));\n\t * // equivalent to\n\t * event(emitter.fire, emitter);\n\t */\n\texport function forward<T>(from: Event<T>, to: Emitter<T>): IDisposable {\n\t\treturn from(e => to.fire(e));\n\t}\n\n\t/**\n\t * Adds a listener to an event and calls the listener immediately with undefined as the event object.\n\t *\n\t * @example\n\t * ```\n\t * // Initialize the UI and update it when dataChangeEvent fires\n\t * runAndSubscribe(dataChangeEvent, () => this._updateUI());\n\t * ```\n\t */\n\texport function runAndSubscribe<T>(event: Event<T>, handler: (e: T) => any, initial: T): IDisposable;\n\texport function runAndSubscribe<T>(event: Event<T>, handler: (e: T | undefined) => any): IDisposable;\n\texport function runAndSubscribe<T>(event: Event<T>, handler: (e: T | undefined) => any, initial?: T): IDisposable {\n\t\thandler(initial);\n\t\treturn event(e => handler(e));\n\t}\n\n\tclass EmitterObserver<T> implements IObserver {\n\n\t\treadonly emitter: Emitter<T>;\n\n\t\tprivate _counter = 0;\n\t\tprivate _hasChanged = false;\n\n\t\tconstructor(readonly _observable: IObservable<T, any>, store: DisposableStore | undefined) {\n\t\t\tconst options: EmitterOptions = {\n\t\t\t\tonWillAddFirstListener: () => {\n\t\t\t\t\t_observable.addObserver(this);\n\n\t\t\t\t\t// Communicate to the observable that we received its current value and would like to be notified about future changes.\n\t\t\t\t\tthis._observable.reportChanges();\n\t\t\t\t},\n\t\t\t\tonDidRemoveLastListener: () => {\n\t\t\t\t\t_observable.removeObserver(this);\n\t\t\t\t}\n\t\t\t};\n\t\t\tif (!store) {\n\t\t\t\t_addLeakageTraceLogic(options);\n\t\t\t}\n\t\t\tthis.emitter = new Emitter<T>(options);\n\t\t\tif (store) {\n\t\t\t\tstore.add(this.emitter);\n\t\t\t}\n\t\t}\n\n\t\tbeginUpdate<T>(_observable: IObservable<T, void>): void {\n\t\t\t// assert(_observable === this.obs);\n\t\t\tthis._counter++;\n\t\t}\n\n\t\thandlePossibleChange<T>(_observable: IObservable<T, unknown>): void {\n\t\t\t// assert(_observable === this.obs);\n\t\t}\n\n\t\thandleChange<T, TChange>(_observable: IObservable<T, TChange>, _change: TChange): void {\n\t\t\t// assert(_observable === this.obs);\n\t\t\tthis._hasChanged = true;\n\t\t}\n\n\t\tendUpdate<T>(_observable: IObservable<T, void>): void {\n\t\t\t// assert(_observable === this.obs);\n\t\t\tthis._counter--;\n\t\t\tif (this._counter === 0) {\n\t\t\t\tthis._observable.reportChanges();\n\t\t\t\tif (this._hasChanged) {\n\t\t\t\t\tthis._hasChanged = false;\n\t\t\t\t\tthis.emitter.fire(this._observable.get());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Creates an event emitter that is fired when the observable changes.\n\t * Each listeners subscribes to the emitter.\n\t */\n\texport function fromObservable<T>(obs: IObservable<T, any>, store?: DisposableStore): Event<T> {\n\t\tconst observer = new EmitterObserver(obs, store);\n\t\treturn observer.emitter.event;\n\t}\n\n\t/**\n\t * Each listener is attached to the observable directly.\n\t */\n\texport function fromObservableLight(observable: IObservable<any>): Event<void> {\n\t\treturn (listener, thisArgs, disposables) => {\n\t\t\tlet count = 0;\n\t\t\tlet didChange = false;\n\t\t\tconst observer: IObserver = {\n\t\t\t\tbeginUpdate() {\n\t\t\t\t\tcount++;\n\t\t\t\t},\n\t\t\t\tendUpdate() {\n\t\t\t\t\tcount--;\n\t\t\t\t\tif (count === 0) {\n\t\t\t\t\t\tobservable.reportChanges();\n\t\t\t\t\t\tif (didChange) {\n\t\t\t\t\t\t\tdidChange = false;\n\t\t\t\t\t\t\tlistener.call(thisArgs);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\thandlePossibleChange() {\n\t\t\t\t\t// noop\n\t\t\t\t},\n\t\t\t\thandleChange() {\n\t\t\t\t\tdidChange = true;\n\t\t\t\t}\n\t\t\t};\n\t\t\tobservable.addObserver(observer);\n\t\t\tobservable.reportChanges();\n\t\t\tconst disposable = {\n\t\t\t\tdispose() {\n\t\t\t\t\tobservable.removeObserver(observer);\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tif (disposables instanceof DisposableStore) {\n\t\t\t\tdisposables.add(disposable);\n\t\t\t} else if (Array.isArray(disposables)) {\n\t\t\t\tdisposables.push(disposable);\n\t\t\t}\n\n\t\t\treturn disposable;\n\t\t};\n\t}\n}\n\nexport interface EmitterOptions {\n\t/**\n\t * Optional function that's called *before* the very first listener is added\n\t */\n\tonWillAddFirstListener?: Function;\n\t/**\n\t * Optional function that's called *after* the very first listener is added\n\t */\n\tonDidAddFirstListener?: Function;\n\t/**\n\t * Optional function that's called after a listener is added\n\t */\n\tonDidAddListener?: Function;\n\t/**\n\t * Optional function that's called *after* remove the very last listener\n\t */\n\tonDidRemoveLastListener?: Function;\n\t/**\n\t * Optional function that's called *before* a listener is removed\n\t */\n\tonWillRemoveListener?: Function;\n\t/**\n\t * Optional function that's called when a listener throws an error. Defaults to\n\t * {@link onUnexpectedError}\n\t */\n\tonListenerError?: (e: any) => void;\n\t/**\n\t * Number of listeners that are allowed before assuming a leak. Default to\n\t * a globally configured value\n\t *\n\t * @see setGlobalLeakWarningThreshold\n\t */\n\tleakWarningThreshold?: number;\n\t/**\n\t * Pass in a delivery queue, which is useful for ensuring\n\t * in order event delivery across multiple emitters.\n\t */\n\tdeliveryQueue?: EventDeliveryQueue;\n\n\t/** ONLY enable this during development */\n\t_profName?: string;\n}\n\n\nexport class EventProfiling {\n\n\tstatic readonly all = new Set<EventProfiling>();\n\n\tprivate static _idPool = 0;\n\n\treadonly name: string;\n\tpublic listenerCount: number = 0;\n\tpublic invocationCount = 0;\n\tpublic elapsedOverall = 0;\n\tpublic durations: number[] = [];\n\n\tprivate _stopWatch?: StopWatch;\n\n\tconstructor(name: string) {\n\t\tthis.name = `${name}_${EventProfiling._idPool++}`;\n\t\tEventProfiling.all.add(this);\n\t}\n\n\tstart(listenerCount: number): void {\n\t\tthis._stopWatch = new StopWatch();\n\t\tthis.listenerCount = listenerCount;\n\t}\n\n\tstop(): void {\n\t\tif (this._stopWatch) {\n\t\t\tconst elapsed = this._stopWatch.elapsed();\n\t\t\tthis.durations.push(elapsed);\n\t\t\tthis.elapsedOverall += elapsed;\n\t\t\tthis.invocationCount += 1;\n\t\t\tthis._stopWatch = undefined;\n\t\t}\n\t}\n}\n\nlet _globalLeakWarningThreshold = -1;\n\nclass LeakageMonitor {\n\n\tprivate static _idPool = 1;\n\n\tprivate _stacks: Map<string, number> | undefined;\n\tprivate _warnCountdown: number = 0;\n\n\tconstructor(\n\t\tprivate readonly _errorHandler: (err: Error) => void,\n\t\treadonly threshold: number,\n\t\treadonly name: string = (LeakageMonitor._idPool++).toString(16).padStart(3, '0')\n\t) { }\n\n\tdispose(): void {\n\t\tthis._stacks?.clear();\n\t}\n\n\tcheck(stack: Stacktrace, listenerCount: number): undefined | (() => void) {\n\n\t\tconst threshold = this.threshold;\n\t\tif (threshold <= 0 || listenerCount < threshold) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tif (!this._stacks) {\n\t\t\tthis._stacks = new Map();\n\t\t}\n\t\tconst count = (this._stacks.get(stack.value) || 0);\n\t\tthis._stacks.set(stack.value, count + 1);\n\t\tthis._warnCountdown -= 1;\n\n\t\tif (this._warnCountdown <= 0) {\n\t\t\t// only warn on first exceed and then every time the limit\n\t\t\t// is exceeded by 50% again\n\t\t\tthis._warnCountdown = threshold * 0.5;\n\n\t\t\tconst [topStack, topCount] = this.getMostFrequentStack()!;\n\t\t\tconst message = `[${this.name}] potential listener LEAK detected, having ${listenerCount} listeners already. MOST frequent listener (${topCount}):`;\n\t\t\tconsole.warn(message);\n\t\t\tconsole.warn(topStack!);\n\n\t\t\tconst error = new ListenerLeakError(message, topStack);\n\t\t\tthis._errorHandler(error);\n\t\t}\n\n\t\treturn () => {\n\t\t\tconst count = (this._stacks!.get(stack.value) || 0);\n\t\t\tthis._stacks!.set(stack.value, count - 1);\n\t\t};\n\t}\n\n\tgetMostFrequentStack(): [string, number] | undefined {\n\t\tif (!this._stacks) {\n\t\t\treturn undefined;\n\t\t}\n\t\tlet topStack: [string, number] | undefined;\n\t\tlet topCount: number = 0;\n\t\tfor (const [stack, count] of this._stacks) {\n\t\t\tif (!topStack || topCount < count) {\n\t\t\t\ttopStack = [stack, count];\n\t\t\t\ttopCount = count;\n\t\t\t}\n\t\t}\n\t\treturn topStack;\n\t}\n}\n\nclass Stacktrace {\n\n\tstatic create() {\n\t\tconst err = new Error();\n\t\treturn new Stacktrace(err.stack ?? '');\n\t}\n\n\tprivate constructor(readonly value: string) { }\n\n\tprint() {\n\t\tconsole.warn(this.value.split('\\n').slice(2).join('\\n'));\n\t}\n}\n\n// error that is logged when going over the configured listener threshold\nexport class ListenerLeakError extends Error {\n\tconstructor(message: string, stack: string) {\n\t\tsuper(message);\n\t\tthis.name = 'ListenerLeakError';\n\t\tthis.stack = stack;\n\t}\n}\n\n// SEVERE error that is logged when having gone way over the configured listener\n// threshold so that the emitter refuses to accept more listeners\nexport class ListenerRefusalError extends Error {\n\tconstructor(message: string, stack: string) {\n\t\tsuper(message);\n\t\tthis.name = 'ListenerRefusalError';\n\t\tthis.stack = stack;\n\t}\n}\nclass UniqueContainer<T> {\n\tstack?: Stacktrace;\n\tconstructor(public readonly value: T) { }\n}\nconst compactionThreshold = 2;\n\ntype ListenerContainer<T> = UniqueContainer<(data: T) => void>;\ntype ListenerOrListeners<T> = (ListenerContainer<T> | undefined)[] | ListenerContainer<T>;\n\nconst forEachListener = <T>(listeners: ListenerOrListeners<T>, fn: (c: ListenerContainer<T>) => void) => {\n\tif (listeners instanceof UniqueContainer) {\n\t\tfn(listeners);\n\t} else {\n\t\tfor (let i = 0; i < listeners.length; i++) {\n\t\t\tconst l = listeners[i];\n\t\t\tif (l) {\n\t\t\t\tfn(l);\n\t\t\t}\n\t\t}\n\t}\n};\n\n\nlet _listenerFinalizers: FinalizationRegistry<string> | undefined;\n\nif (_enableListenerGCedWarning) {\n\tconst leaks: string[] = [];\n\n\tsetInterval(() => {\n\t\tif (leaks.length === 0) {\n\t\t\treturn;\n\t\t}\n\t\tconsole.warn('[LEAKING LISTENERS] GC\\'ed these listeners that were NOT yet disposed:');\n\t\tconsole.warn(leaks.join('\\n'));\n\t\tleaks.length = 0;\n\t}, 3000);\n\n\t_listenerFinalizers = new FinalizationRegistry(heldValue => {\n\t\tif (typeof heldValue === 'string') {\n\t\t\tleaks.push(heldValue);\n\t\t}\n\t});\n}\n\n/**\n * The Emitter can be used to expose an Event to the public\n * to fire it from the insides.\n * Sample:\n\tclass Document {\n\n\t\tprivate readonly _onDidChange = new Emitter<(value:string)=>any>();\n\n\t\tpublic onDidChange = this._onDidChange.event;\n\n\t\t// getter-style\n\t\t// get onDidChange(): Event<(value:string)=>any> {\n\t\t// \treturn this._onDidChange.event;\n\t\t// }\n\n\t\tprivate _doIt() {\n\t\t\t//...\n\t\t\tthis._onDidChange.fire(value);\n\t\t}\n\t}\n */\nexport class Emitter<T> {\n\n\tprivate readonly _options?: EmitterOptions;\n\tprivate readonly _leakageMon?: LeakageMonitor;\n\tprivate readonly _perfMon?: EventProfiling;\n\tprivate _disposed?: true;\n\tprivate _event?: Event<T>;\n\n\t/**\n\t * A listener, or list of listeners. A single listener is the most common\n\t * for event emitters (#185789), so we optimize that special case to avoid\n\t * wrapping it in an array (just like Node.js itself.)\n\t *\n\t * A list of listeners never 'downgrades' back to a plain function if\n\t * listeners are removed, for two reasons:\n\t *\n\t *  1. That's complicated (especially with the deliveryQueue)\n\t *  2. A listener with >1 listener is likely to have >1 listener again at\n\t *     some point, and swapping between arrays and functions may[citation needed]\n\t *     introduce unnecessary work and garbage.\n\t *\n\t * The array listeners can be 'sparse', to avoid reallocating the array\n\t * whenever any listener is added or removed. If more than `1 / compactionThreshold`\n\t * of the array is empty, only then is it resized.\n\t */\n\tprotected _listeners?: ListenerOrListeners<T>;\n\n\t/**\n\t * Always to be defined if _listeners is an array. It's no longer a true\n\t * queue, but holds the dispatching 'state'. If `fire()` is called on an\n\t * emitter, any work left in the _deliveryQueue is finished first.\n\t */\n\tprivate _deliveryQueue?: EventDeliveryQueuePrivate;\n\tprotected _size = 0;\n\n\tconstructor(options?: EmitterOptions) {\n\t\tthis._options = options;\n\t\tthis._leakageMon = (_globalLeakWarningThreshold > 0 || this._options?.leakWarningThreshold)\n\t\t\t? new LeakageMonitor(options?.onListenerError ?? onUnexpectedError, this._options?.leakWarningThreshold ?? _globalLeakWarningThreshold) :\n\t\t\tundefined;\n\t\tthis._perfMon = this._options?._profName ? new EventProfiling(this._options._profName) : undefined;\n\t\tthis._deliveryQueue = this._options?.deliveryQueue as EventDeliveryQueuePrivate | undefined;\n\t}\n\n\tdispose() {\n\t\tif (!this._disposed) {\n\t\t\tthis._disposed = true;\n\n\t\t\t// It is bad to have listeners at the time of disposing an emitter, it is worst to have listeners keep the emitter\n\t\t\t// alive via the reference that's embedded in their disposables. Therefore we loop over all remaining listeners and\n\t\t\t// unset their subscriptions/disposables. Looping and blaming remaining listeners is done on next tick because the\n\t\t\t// the following programming pattern is very popular:\n\t\t\t//\n\t\t\t// const someModel = this._disposables.add(new ModelObject()); // (1) create and register model\n\t\t\t// this._disposables.add(someModel.onDidChange(() => { ... }); // (2) subscribe and register model-event listener\n\t\t\t// ...later...\n\t\t\t// this._disposables.dispose(); disposes (1) then (2): don't warn after (1) but after the \"overall dispose\" is done\n\n\t\t\tif (this._deliveryQueue?.current === this) {\n\t\t\t\tthis._deliveryQueue.reset();\n\t\t\t}\n\t\t\tif (this._listeners) {\n\t\t\t\tif (_enableDisposeWithListenerWarning) {\n\t\t\t\t\tconst listeners = this._listeners;\n\t\t\t\t\tqueueMicrotask(() => {\n\t\t\t\t\t\tforEachListener(listeners, l => l.stack?.print());\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tthis._listeners = undefined;\n\t\t\t\tthis._size = 0;\n\t\t\t}\n\t\t\tthis._options?.onDidRemoveLastListener?.();\n\t\t\tthis._leakageMon?.dispose();\n\t\t}\n\t}\n\n\t/**\n\t * For the public to allow to subscribe\n\t * to events from this Emitter\n\t */\n\tget event(): Event<T> {\n\t\tthis._event ??= (callback: (e: T) => any, thisArgs?: any, disposables?: IDisposable[] | DisposableStore) => {\n\t\t\tif (this._leakageMon && this._size > this._leakageMon.threshold ** 2) {\n\t\t\t\tconst message = `[${this._leakageMon.name}] REFUSES to accept new listeners because it exceeded its threshold by far (${this._size} vs ${this._leakageMon.threshold})`;\n\t\t\t\tconsole.warn(message);\n\n\t\t\t\tconst tuple = this._leakageMon.getMostFrequentStack() ?? ['UNKNOWN stack', -1];\n\t\t\t\tconst error = new ListenerRefusalError(`${message}. HINT: Stack shows most frequent listener (${tuple[1]}-times)`, tuple[0]);\n\t\t\t\tconst errorHandler = this._options?.onListenerError || onUnexpectedError;\n\t\t\t\terrorHandler(error);\n\n\t\t\t\treturn Disposable.None;\n\t\t\t}\n\n\t\t\tif (this._disposed) {\n\t\t\t\t// todo: should we warn if a listener is added to a disposed emitter? This happens often\n\t\t\t\treturn Disposable.None;\n\t\t\t}\n\n\t\t\tif (thisArgs) {\n\t\t\t\tcallback = callback.bind(thisArgs);\n\t\t\t}\n\n\t\t\tconst contained = new UniqueContainer(callback);\n\n\t\t\tlet removeMonitor: Function | undefined;\n\t\t\tlet stack: Stacktrace | undefined;\n\t\t\tif (this._leakageMon && this._size >= Math.ceil(this._leakageMon.threshold * 0.2)) {\n\t\t\t\t// check and record this emitter for potential leakage\n\t\t\t\tcontained.stack = Stacktrace.create();\n\t\t\t\tremoveMonitor = this._leakageMon.check(contained.stack, this._size + 1);\n\t\t\t}\n\n\t\t\tif (_enableDisposeWithListenerWarning) {\n\t\t\t\tcontained.stack = stack ?? Stacktrace.create();\n\t\t\t}\n\n\t\t\tif (!this._listeners) {\n\t\t\t\tthis._options?.onWillAddFirstListener?.(this);\n\t\t\t\tthis._listeners = contained;\n\t\t\t\tthis._options?.onDidAddFirstListener?.(this);\n\t\t\t} else if (this._listeners instanceof UniqueContainer) {\n\t\t\t\tthis._deliveryQueue ??= new EventDeliveryQueuePrivate();\n\t\t\t\tthis._listeners = [this._listeners, contained];\n\t\t\t} else {\n\t\t\t\tthis._listeners.push(contained);\n\t\t\t}\n\n\t\t\tthis._size++;\n\n\n\t\t\tconst result = toDisposable(() => {\n\t\t\t\t_listenerFinalizers?.unregister(result);\n\t\t\t\tremoveMonitor?.();\n\t\t\t\tthis._removeListener(contained);\n\t\t\t});\n\t\t\tif (disposables instanceof DisposableStore) {\n\t\t\t\tdisposables.add(result);\n\t\t\t} else if (Array.isArray(disposables)) {\n\t\t\t\tdisposables.push(result);\n\t\t\t}\n\n\t\t\tif (_listenerFinalizers) {\n\t\t\t\tconst stack = new Error().stack!.split('\\n').slice(2, 3).join('\\n').trim();\n\t\t\t\tconst match = /(file:|vscode-file:\\/\\/vscode-app)?(\\/[^:]*:\\d+:\\d+)/.exec(stack);\n\t\t\t\t_listenerFinalizers.register(result, match?.[2] ?? stack, result);\n\t\t\t}\n\n\t\t\treturn result;\n\t\t};\n\n\t\treturn this._event;\n\t}\n\n\tprivate _removeListener(listener: ListenerContainer<T>) {\n\t\tthis._options?.onWillRemoveListener?.(this);\n\n\t\tif (!this._listeners) {\n\t\t\treturn; // expected if a listener gets disposed\n\t\t}\n\n\t\tif (this._size === 1) {\n\t\t\tthis._listeners = undefined;\n\t\t\tthis._options?.onDidRemoveLastListener?.(this);\n\t\t\tthis._size = 0;\n\t\t\treturn;\n\t\t}\n\n\t\t// size > 1 which requires that listeners be a list:\n\t\tconst listeners = this._listeners as (ListenerContainer<T> | undefined)[];\n\n\t\tconst index = listeners.indexOf(listener);\n\t\tif (index === -1) {\n\t\t\tconsole.log('disposed?', this._disposed);\n\t\t\tconsole.log('size?', this._size);\n\t\t\tconsole.log('arr?', JSON.stringify(this._listeners));\n\t\t\tthrow new Error('Attempted to dispose unknown listener');\n\t\t}\n\n\t\tthis._size--;\n\t\tlisteners[index] = undefined;\n\n\t\tconst adjustDeliveryQueue = this._deliveryQueue!.current === this;\n\t\tif (this._size * compactionThreshold <= listeners.length) {\n\t\t\tlet n = 0;\n\t\t\tfor (let i = 0; i < listeners.length; i++) {\n\t\t\t\tif (listeners[i]) {\n\t\t\t\t\tlisteners[n++] = listeners[i];\n\t\t\t\t} else if (adjustDeliveryQueue) {\n\t\t\t\t\tthis._deliveryQueue!.end--;\n\t\t\t\t\tif (n < this._deliveryQueue!.i) {\n\t\t\t\t\t\tthis._deliveryQueue!.i--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tlisteners.length = n;\n\t\t}\n\t}\n\n\tprivate _deliver(listener: undefined | UniqueContainer<(value: T) => void>, value: T) {\n\t\tif (!listener) {\n\t\t\treturn;\n\t\t}\n\n\t\tconst errorHandler = this._options?.onListenerError || onUnexpectedError;\n\t\tif (!errorHandler) {\n\t\t\tlistener.value(value);\n\t\t\treturn;\n\t\t}\n\n\t\ttry {\n\t\t\tlistener.value(value);\n\t\t} catch (e) {\n\t\t\terrorHandler(e);\n\t\t}\n\t}\n\n\t/** Delivers items in the queue. Assumes the queue is ready to go. */\n\tprivate _deliverQueue(dq: EventDeliveryQueuePrivate) {\n\t\tconst listeners = dq.current!._listeners! as (ListenerContainer<T> | undefined)[];\n\t\twhile (dq.i < dq.end) {\n\t\t\t// important: dq.i is incremented before calling deliver() because it might reenter deliverQueue()\n\t\t\tthis._deliver(listeners[dq.i++], dq.value as T);\n\t\t}\n\t\tdq.reset();\n\t}\n\n\t/**\n\t * To be kept private to fire an event to\n\t * subscribers\n\t */\n\tfire(event: T): void {\n\t\tif (this._deliveryQueue?.current) {\n\t\t\tthis._deliverQueue(this._deliveryQueue);\n\t\t\tthis._perfMon?.stop(); // last fire() will have starting perfmon, stop it before starting the next dispatch\n\t\t}\n\n\t\tthis._perfMon?.start(this._size);\n\n\t\tif (!this._listeners) {\n\t\t\t// no-op\n\t\t} else if (this._listeners instanceof UniqueContainer) {\n\t\t\tthis._deliver(this._listeners, event);\n\t\t} else {\n\t\t\tconst dq = this._deliveryQueue!;\n\t\t\tdq.enqueue(this, event, this._listeners.length);\n\t\t\tthis._deliverQueue(dq);\n\t\t}\n\n\t\tthis._perfMon?.stop();\n\t}\n\n\thasListeners(): boolean {\n\t\treturn this._size > 0;\n\t}\n}\n\nexport interface EventDeliveryQueue {\n}\n\nexport const createEventDeliveryQueue = (): EventDeliveryQueue => new EventDeliveryQueuePrivate();\n\nclass EventDeliveryQueuePrivate implements EventDeliveryQueue {\n\n\t/**\n\t * Index in current's listener list.\n\t */\n\tpublic i = -1;\n\n\t/**\n\t * The last index in the listener's list to deliver.\n\t */\n\tpublic end = 0;\n\n\t/**\n\t * Emitter currently being dispatched on. Emitter._listeners is always an array.\n\t */\n\tpublic current?: Emitter<any>;\n\t/**\n\t * Currently emitting value. Defined whenever `current` is.\n\t */\n\tpublic value?: unknown;\n\n\tpublic enqueue<T>(emitter: Emitter<T>, value: T, end: number) {\n\t\tthis.i = 0;\n\t\tthis.end = end;\n\t\tthis.current = emitter;\n\t\tthis.value = value;\n\t}\n\n\tpublic reset() {\n\t\tthis.i = this.end; // force any current emission loop to stop, mainly for during dispose\n\t\tthis.current = undefined;\n\t\tthis.value = undefined;\n\t}\n}\n\n\nexport class PauseableEmitter<T> extends Emitter<T> {\n\n\tprivate _isPaused = 0;\n\tprotected _eventQueue = new LinkedList<T>();\n\tprivate _mergeFn?: (input: T[]) => T;\n\n\tconstructor(options?: EmitterOptions & { merge?: (input: T[]) => T }) {\n\t\tsuper(options);\n\t\tthis._mergeFn = options?.merge;\n\t}\n\n\tpause(): void {\n\t\tthis._isPaused++;\n\t}\n\n\tresume(): void {\n\t\tif (this._isPaused !== 0 && --this._isPaused === 0) {\n\t\t\tif (this._mergeFn) {\n\t\t\t\t// use the merge function to create a single composite\n\t\t\t\t// event. make a copy in case firing pauses this emitter\n\t\t\t\tif (this._eventQueue.size > 0) {\n\t\t\t\t\tconst events = Array.from(this._eventQueue);\n\t\t\t\t\tthis._eventQueue.clear();\n\t\t\t\t\tsuper.fire(this._mergeFn(events));\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\t// no merging, fire each event individually and test\n\t\t\t\t// that this emitter isn't paused halfway through\n\t\t\t\twhile (!this._isPaused && this._eventQueue.size !== 0) {\n\t\t\t\t\tsuper.fire(this._eventQueue.shift()!);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\toverride fire(event: T): void {\n\t\tif (this._size) {\n\t\t\tif (this._isPaused !== 0) {\n\t\t\t\tthis._eventQueue.push(event);\n\t\t\t} else {\n\t\t\t\tsuper.fire(event);\n\t\t\t}\n\t\t}\n\t}\n}\n\nexport class DebounceEmitter<T> extends PauseableEmitter<T> {\n\n\tprivate readonly _delay: number;\n\tprivate _handle: any | undefined;\n\n\tconstructor(options: EmitterOptions & { merge: (input: T[]) => T; delay?: number }) {\n\t\tsuper(options);\n\t\tthis._delay = options.delay ?? 100;\n\t}\n\n\toverride fire(event: T): void {\n\t\tif (!this._handle) {\n\t\t\tthis.pause();\n\t\t\tthis._handle = setTimeout(() => {\n\t\t\t\tthis._handle = undefined;\n\t\t\t\tthis.resume();\n\t\t\t}, this._delay);\n\t\t}\n\t\tsuper.fire(event);\n\t}\n}\n\n/**\n * An emitter which queue all events and then process them at the\n * end of the event loop.\n */\nexport class MicrotaskEmitter<T> extends Emitter<T> {\n\tprivate _queuedEvents: T[] = [];\n\tprivate _mergeFn?: (input: T[]) => T;\n\n\tconstructor(options?: EmitterOptions & { merge?: (input: T[]) => T }) {\n\t\tsuper(options);\n\t\tthis._mergeFn = options?.merge;\n\t}\n\toverride fire(event: T): void {\n\n\t\tif (!this.hasListeners()) {\n\t\t\treturn;\n\t\t}\n\n\t\tthis._queuedEvents.push(event);\n\t\tif (this._queuedEvents.length === 1) {\n\t\t\tqueueMicrotask(() => {\n\t\t\t\tif (this._mergeFn) {\n\t\t\t\t\tsuper.fire(this._mergeFn(this._queuedEvents));\n\t\t\t\t} else {\n\t\t\t\t\tthis._queuedEvents.forEach(e => super.fire(e));\n\t\t\t\t}\n\t\t\t\tthis._queuedEvents = [];\n\t\t\t});\n\t\t}\n\t}\n}\n\n/**\n * An event emitter that multiplexes many events into a single event.\n *\n * @example Listen to the `onData` event of all `Thing`s, dynamically adding and removing `Thing`s\n * to the multiplexer as needed.\n *\n * ```typescript\n * const anythingDataMultiplexer = new EventMultiplexer<{ data: string }>();\n *\n * const thingListeners = DisposableMap<Thing, IDisposable>();\n *\n * thingService.onDidAddThing(thing => {\n *   thingListeners.set(thing, anythingDataMultiplexer.add(thing.onData);\n * });\n * thingService.onDidRemoveThing(thing => {\n *   thingListeners.deleteAndDispose(thing);\n * });\n *\n * anythingDataMultiplexer.event(e => {\n *   console.log('Something fired data ' + e.data)\n * });\n * ```\n */\nexport class EventMultiplexer<T> implements IDisposable {\n\n\tprivate readonly emitter: Emitter<T>;\n\tprivate hasListeners = false;\n\tprivate events: { event: Event<T>; listener: IDisposable | null }[] = [];\n\n\tconstructor() {\n\t\tthis.emitter = new Emitter<T>({\n\t\t\tonWillAddFirstListener: () => this.onFirstListenerAdd(),\n\t\t\tonDidRemoveLastListener: () => this.onLastListenerRemove()\n\t\t});\n\t}\n\n\tget event(): Event<T> {\n\t\treturn this.emitter.event;\n\t}\n\n\tadd(event: Event<T>): IDisposable {\n\t\tconst e = { event: event, listener: null };\n\t\tthis.events.push(e);\n\n\t\tif (this.hasListeners) {\n\t\t\tthis.hook(e);\n\t\t}\n\n\t\tconst dispose = () => {\n\t\t\tif (this.hasListeners) {\n\t\t\t\tthis.unhook(e);\n\t\t\t}\n\n\t\t\tconst idx = this.events.indexOf(e);\n\t\t\tthis.events.splice(idx, 1);\n\t\t};\n\n\t\treturn toDisposable(createSingleCallFunction(dispose));\n\t}\n\n\tprivate onFirstListenerAdd(): void {\n\t\tthis.hasListeners = true;\n\t\tthis.events.forEach(e => this.hook(e));\n\t}\n\n\tprivate onLastListenerRemove(): void {\n\t\tthis.hasListeners = false;\n\t\tthis.events.forEach(e => this.unhook(e));\n\t}\n\n\tprivate hook(e: { event: Event<T>; listener: IDisposable | null }): void {\n\t\te.listener = e.event(r => this.emitter.fire(r));\n\t}\n\n\tprivate unhook(e: { event: Event<T>; listener: IDisposable | null }): void {\n\t\te.listener?.dispose();\n\t\te.listener = null;\n\t}\n\n\tdispose(): void {\n\t\tthis.emitter.dispose();\n\n\t\tfor (const e of this.events) {\n\t\t\te.listener?.dispose();\n\t\t}\n\t\tthis.events = [];\n\t}\n}\n\n/**\n * The EventBufferer is useful in situations in which you want\n * to delay firing your events during some code.\n * You can wrap that code and be sure that the event will not\n * be fired during that wrap.\n *\n * ```\n * const emitter: Emitter;\n * const delayer = new EventDelayer();\n * const delayedEvent = delayer.wrapEvent(emitter.event);\n *\n * delayedEvent(console.log);\n *\n * delayer.bufferEvents(() => {\n *   emitter.fire(); // event will not be fired yet\n * });\n *\n * // event will only be fired at this point\n * ```\n */\nexport class EventBufferer {\n\n\tprivate data: { buffers: Function[] }[] = [];\n\n\twrapEvent<T>(event: Event<T>): Event<T>;\n\twrapEvent<T>(event: Event<T>, reduce: (last: T | undefined, event: T) => T): Event<T>;\n\twrapEvent<T, O>(event: Event<T>, reduce: (last: O | undefined, event: T) => O, initial: O): Event<O>;\n\twrapEvent<T, O>(event: Event<T>, reduce?: (last: T | O | undefined, event: T) => T | O, initial?: O): Event<O | T> {\n\t\treturn (listener, thisArgs?, disposables?) => {\n\t\t\treturn event(i => {\n\t\t\t\tconst data = this.data[this.data.length - 1];\n\n\t\t\t\t// Non-reduce scenario\n\t\t\t\tif (!reduce) {\n\t\t\t\t\t// Buffering case\n\t\t\t\t\tif (data) {\n\t\t\t\t\t\tdata.buffers.push(() => listener.call(thisArgs, i));\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Not buffering case\n\t\t\t\t\t\tlistener.call(thisArgs, i);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\t// Reduce scenario\n\t\t\t\tconst reduceData = data as typeof data & {\n\t\t\t\t\t/**\n\t\t\t\t\t * The accumulated items that will be reduced.\n\t\t\t\t\t */\n\t\t\t\t\titems?: T[];\n\t\t\t\t\t/**\n\t\t\t\t\t * The reduced result cached to be shared with other listeners.\n\t\t\t\t\t */\n\t\t\t\t\treducedResult?: T | O;\n\t\t\t\t};\n\n\t\t\t\t// Not buffering case\n\t\t\t\tif (!reduceData) {\n\t\t\t\t\t// TODO: Is there a way to cache this reduce call for all listeners?\n\t\t\t\t\tlistener.call(thisArgs, reduce(initial, i));\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\t// Buffering case\n\t\t\t\treduceData.items ??= [];\n\t\t\t\treduceData.items.push(i);\n\t\t\t\tif (reduceData.buffers.length === 0) {\n\t\t\t\t\t// Include a single buffered function that will reduce all events when we're done buffering events\n\t\t\t\t\tdata.buffers.push(() => {\n\t\t\t\t\t\t// cache the reduced result so that the value can be shared across all listeners\n\t\t\t\t\t\treduceData.reducedResult ??= initial\n\t\t\t\t\t\t\t? reduceData.items!.reduce(reduce as (last: O | undefined, event: T) => O, initial)\n\t\t\t\t\t\t\t: reduceData.items!.reduce(reduce as (last: T | undefined, event: T) => T);\n\t\t\t\t\t\tlistener.call(thisArgs, reduceData.reducedResult);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}, undefined, disposables);\n\t\t};\n\t}\n\n\tbufferEvents<R = void>(fn: () => R): R {\n\t\tconst data = { buffers: new Array<Function>() };\n\t\tthis.data.push(data);\n\t\tconst r = fn();\n\t\tthis.data.pop();\n\t\tdata.buffers.forEach(flush => flush());\n\t\treturn r;\n\t}\n}\n\n/**\n * A Relay is an event forwarder which functions as a replugabble event pipe.\n * Once created, you can connect an input event to it and it will simply forward\n * events from that input event through its own `event` property. The `input`\n * can be changed at any point in time.\n */\nexport class Relay<T> implements IDisposable {\n\n\tprivate listening = false;\n\tprivate inputEvent: Event<T> = Event.None;\n\tprivate inputEventListener: IDisposable = Disposable.None;\n\n\tprivate readonly emitter = new Emitter<T>({\n\t\tonDidAddFirstListener: () => {\n\t\t\tthis.listening = true;\n\t\t\tthis.inputEventListener = this.inputEvent(this.emitter.fire, this.emitter);\n\t\t},\n\t\tonDidRemoveLastListener: () => {\n\t\t\tthis.listening = false;\n\t\t\tthis.inputEventListener.dispose();\n\t\t}\n\t});\n\n\treadonly event: Event<T> = this.emitter.event;\n\n\tset input(event: Event<T>) {\n\t\tthis.inputEvent = event;\n\n\t\tif (this.listening) {\n\t\t\tthis.inputEventListener.dispose();\n\t\t\tthis.inputEventListener = event(this.emitter.fire, this.emitter);\n\t\t}\n\t}\n\n\tdispose() {\n\t\tthis.inputEventListener.dispose();\n\t\tthis.emitter.dispose();\n\t}\n}\n\nexport interface IValueWithChangeEvent<T> {\n\treadonly onDidChange: Event<void>;\n\tget value(): T;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { Emitter, Event } from 'vs/base/common/event';\nimport { DisposableStore, IDisposable } from 'vs/base/common/lifecycle';\n\nexport interface CancellationToken {\n\n\t/**\n\t * A flag signalling is cancellation has been requested.\n\t */\n\treadonly isCancellationRequested: boolean;\n\n\t/**\n\t * An event which fires when cancellation is requested. This event\n\t * only ever fires `once` as cancellation can only happen once. Listeners\n\t * that are registered after cancellation will be called (next event loop run),\n\t * but also only once.\n\t *\n\t * @event\n\t */\n\treadonly onCancellationRequested: (listener: (e: any) => any, thisArgs?: any, disposables?: IDisposable[]) => IDisposable;\n}\n\nconst shortcutEvent: Event<any> = Object.freeze(function (callback, context?): IDisposable {\n\tconst handle = setTimeout(callback.bind(context), 0);\n\treturn { dispose() { clearTimeout(handle); } };\n});\n\nexport namespace CancellationToken {\n\n\texport function isCancellationToken(thing: unknown): thing is CancellationToken {\n\t\tif (thing === CancellationToken.None || thing === CancellationToken.Cancelled) {\n\t\t\treturn true;\n\t\t}\n\t\tif (thing instanceof MutableToken) {\n\t\t\treturn true;\n\t\t}\n\t\tif (!thing || typeof thing !== 'object') {\n\t\t\treturn false;\n\t\t}\n\t\treturn typeof (thing as CancellationToken).isCancellationRequested === 'boolean'\n\t\t\t&& typeof (thing as CancellationToken).onCancellationRequested === 'function';\n\t}\n\n\n\texport const None = Object.freeze<CancellationToken>({\n\t\tisCancellationRequested: false,\n\t\tonCancellationRequested: Event.None\n\t});\n\n\texport const Cancelled = Object.freeze<CancellationToken>({\n\t\tisCancellationRequested: true,\n\t\tonCancellationRequested: shortcutEvent\n\t});\n}\n\nclass MutableToken implements CancellationToken {\n\n\tprivate _isCancelled: boolean = false;\n\tprivate _emitter: Emitter<any> | null = null;\n\n\tpublic cancel() {\n\t\tif (!this._isCancelled) {\n\t\t\tthis._isCancelled = true;\n\t\t\tif (this._emitter) {\n\t\t\t\tthis._emitter.fire(undefined);\n\t\t\t\tthis.dispose();\n\t\t\t}\n\t\t}\n\t}\n\n\tget isCancellationRequested(): boolean {\n\t\treturn this._isCancelled;\n\t}\n\n\tget onCancellationRequested(): Event<any> {\n\t\tif (this._isCancelled) {\n\t\t\treturn shortcutEvent;\n\t\t}\n\t\tif (!this._emitter) {\n\t\t\tthis._emitter = new Emitter<any>();\n\t\t}\n\t\treturn this._emitter.event;\n\t}\n\n\tpublic dispose(): void {\n\t\tif (this._emitter) {\n\t\t\tthis._emitter.dispose();\n\t\t\tthis._emitter = null;\n\t\t}\n\t}\n}\n\nexport class CancellationTokenSource {\n\n\tprivate _token?: CancellationToken = undefined;\n\tprivate _parentListener?: IDisposable = undefined;\n\n\tconstructor(parent?: CancellationToken) {\n\t\tthis._parentListener = parent && parent.onCancellationRequested(this.cancel, this);\n\t}\n\n\tget token(): CancellationToken {\n\t\tif (!this._token) {\n\t\t\t// be lazy and create the token only when\n\t\t\t// actually needed\n\t\t\tthis._token = new MutableToken();\n\t\t}\n\t\treturn this._token;\n\t}\n\n\tcancel(): void {\n\t\tif (!this._token) {\n\t\t\t// save an object by returning the default\n\t\t\t// cancelled token when cancellation happens\n\t\t\t// before someone asks for the token\n\t\t\tthis._token = CancellationToken.Cancelled;\n\n\t\t} else if (this._token instanceof MutableToken) {\n\t\t\t// actually cancel\n\t\t\tthis._token.cancel();\n\t\t}\n\t}\n\n\tdispose(cancel: boolean = false): void {\n\t\tif (cancel) {\n\t\t\tthis.cancel();\n\t\t}\n\t\tthis._parentListener?.dispose();\n\t\tif (!this._token) {\n\t\t\t// ensure to initialize with an empty token if we had none\n\t\t\tthis._token = CancellationToken.None;\n\n\t\t} else if (this._token instanceof MutableToken) {\n\t\t\t// actually dispose\n\t\t\tthis._token.dispose();\n\t\t}\n\t}\n}\n\nexport function cancelOnDispose(store: DisposableStore): CancellationToken {\n\tconst source = new CancellationTokenSource();\n\tstore.add({ dispose() { source.cancel(); } });\n\treturn source.token;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { LRUCachedFunction } from 'vs/base/common/cache';\nimport { CharCode } from 'vs/base/common/charCode';\nimport { Lazy } from 'vs/base/common/lazy';\nimport { Constants } from 'vs/base/common/uint';\n\nexport function isFalsyOrWhitespace(str: string | undefined): boolean {\n\tif (!str || typeof str !== 'string') {\n\t\treturn true;\n\t}\n\treturn str.trim().length === 0;\n}\n\nconst _formatRegexp = /{(\\d+)}/g;\n\n/**\n * Helper to produce a string with a variable number of arguments. Insert variable segments\n * into the string using the {n} notation where N is the index of the argument following the string.\n * @param value string to which formatting is applied\n * @param args replacements for {n}-entries\n */\nexport function format(value: string, ...args: any[]): string {\n\tif (args.length === 0) {\n\t\treturn value;\n\t}\n\treturn value.replace(_formatRegexp, function (match, group) {\n\t\tconst idx = parseInt(group, 10);\n\t\treturn isNaN(idx) || idx < 0 || idx >= args.length ?\n\t\t\tmatch :\n\t\t\targs[idx];\n\t});\n}\n\n/**\n * Encodes the given value so that it can be used as literal value in html attributes.\n *\n * In other words, computes `$val`, such that `attr` in `<div attr=\"$val\" />` has the runtime value `value`.\n * This prevents XSS injection.\n */\nexport function htmlAttributeEncodeValue(value: string): string {\n\treturn value.replace(/[<>\"'&]/g, ch => {\n\t\tswitch (ch) {\n\t\t\tcase '<': return '&lt;';\n\t\t\tcase '>': return '&gt;';\n\t\t\tcase '\"': return '&quot;';\n\t\t\tcase '\\'': return '&apos;';\n\t\t\tcase '&': return '&amp;';\n\t\t}\n\t\treturn ch;\n\t});\n}\n\n/**\n * Converts HTML characters inside the string to use entities instead. Makes the string safe from\n * being used e.g. in HTMLElement.innerHTML.\n */\nexport function escape(html: string): string {\n\treturn html.replace(/[<>&]/g, function (match) {\n\t\tswitch (match) {\n\t\t\tcase '<': return '&lt;';\n\t\t\tcase '>': return '&gt;';\n\t\t\tcase '&': return '&amp;';\n\t\t\tdefault: return match;\n\t\t}\n\t});\n}\n\n/**\n * Escapes regular expression characters in a given string\n */\nexport function escapeRegExpCharacters(value: string): string {\n\treturn value.replace(/[\\\\\\{\\}\\*\\+\\?\\|\\^\\$\\.\\[\\]\\(\\)]/g, '\\\\$&');\n}\n\n/**\n * Removes all occurrences of needle from the beginning and end of haystack.\n * @param haystack string to trim\n * @param needle the thing to trim (default is a blank)\n */\nexport function trim(haystack: string, needle: string = ' '): string {\n\tconst trimmed = ltrim(haystack, needle);\n\treturn rtrim(trimmed, needle);\n}\n\n/**\n * Removes all occurrences of needle from the beginning of haystack.\n * @param haystack string to trim\n * @param needle the thing to trim\n */\nexport function ltrim(haystack: string, needle: string): string {\n\tif (!haystack || !needle) {\n\t\treturn haystack;\n\t}\n\n\tconst needleLen = needle.length;\n\tif (needleLen === 0 || haystack.length === 0) {\n\t\treturn haystack;\n\t}\n\n\tlet offset = 0;\n\n\twhile (haystack.indexOf(needle, offset) === offset) {\n\t\toffset = offset + needleLen;\n\t}\n\treturn haystack.substring(offset);\n}\n\n/**\n * Removes all occurrences of needle from the end of haystack.\n * @param haystack string to trim\n * @param needle the thing to trim\n */\nexport function rtrim(haystack: string, needle: string): string {\n\tif (!haystack || !needle) {\n\t\treturn haystack;\n\t}\n\n\tconst needleLen = needle.length,\n\t\thaystackLen = haystack.length;\n\n\tif (needleLen === 0 || haystackLen === 0) {\n\t\treturn haystack;\n\t}\n\n\tlet offset = haystackLen,\n\t\tidx = -1;\n\n\twhile (true) {\n\t\tidx = haystack.lastIndexOf(needle, offset - 1);\n\t\tif (idx === -1 || idx + needleLen !== offset) {\n\t\t\tbreak;\n\t\t}\n\t\tif (idx === 0) {\n\t\t\treturn '';\n\t\t}\n\t\toffset = idx;\n\t}\n\n\treturn haystack.substring(0, offset);\n}\n\nexport function convertSimple2RegExpPattern(pattern: string): string {\n\treturn pattern.replace(/[\\-\\\\\\{\\}\\+\\?\\|\\^\\$\\.\\,\\[\\]\\(\\)\\#\\s]/g, '\\\\$&').replace(/[\\*]/g, '.*');\n}\n\nexport function stripWildcards(pattern: string): string {\n\treturn pattern.replace(/\\*/g, '');\n}\n\nexport interface RegExpOptions {\n\tmatchCase?: boolean;\n\twholeWord?: boolean;\n\tmultiline?: boolean;\n\tglobal?: boolean;\n\tunicode?: boolean;\n}\n\nexport function createRegExp(searchString: string, isRegex: boolean, options: RegExpOptions = {}): RegExp {\n\tif (!searchString) {\n\t\tthrow new Error('Cannot create regex from empty string');\n\t}\n\tif (!isRegex) {\n\t\tsearchString = escapeRegExpCharacters(searchString);\n\t}\n\tif (options.wholeWord) {\n\t\tif (!/\\B/.test(searchString.charAt(0))) {\n\t\t\tsearchString = '\\\\b' + searchString;\n\t\t}\n\t\tif (!/\\B/.test(searchString.charAt(searchString.length - 1))) {\n\t\t\tsearchString = searchString + '\\\\b';\n\t\t}\n\t}\n\tlet modifiers = '';\n\tif (options.global) {\n\t\tmodifiers += 'g';\n\t}\n\tif (!options.matchCase) {\n\t\tmodifiers += 'i';\n\t}\n\tif (options.multiline) {\n\t\tmodifiers += 'm';\n\t}\n\tif (options.unicode) {\n\t\tmodifiers += 'u';\n\t}\n\n\treturn new RegExp(searchString, modifiers);\n}\n\nexport function regExpLeadsToEndlessLoop(regexp: RegExp): boolean {\n\t// Exit early if it's one of these special cases which are meant to match\n\t// against an empty string\n\tif (regexp.source === '^' || regexp.source === '^$' || regexp.source === '$' || regexp.source === '^\\\\s*$') {\n\t\treturn false;\n\t}\n\n\t// We check against an empty string. If the regular expression doesn't advance\n\t// (e.g. ends in an endless loop) it will match an empty string.\n\tconst match = regexp.exec('');\n\treturn !!(match && regexp.lastIndex === 0);\n}\n\nexport function splitLines(str: string): string[] {\n\treturn str.split(/\\r\\n|\\r|\\n/);\n}\n\nexport function splitLinesIncludeSeparators(str: string): string[] {\n\tconst linesWithSeparators: string[] = [];\n\tconst splitLinesAndSeparators = str.split(/(\\r\\n|\\r|\\n)/);\n\tfor (let i = 0; i < Math.ceil(splitLinesAndSeparators.length / 2); i++) {\n\t\tlinesWithSeparators.push(splitLinesAndSeparators[2 * i] + (splitLinesAndSeparators[2 * i + 1] ?? ''));\n\t}\n\treturn linesWithSeparators;\n}\n\n/**\n * Returns first index of the string that is not whitespace.\n * If string is empty or contains only whitespaces, returns -1\n */\nexport function firstNonWhitespaceIndex(str: string): number {\n\tfor (let i = 0, len = str.length; i < len; i++) {\n\t\tconst chCode = str.charCodeAt(i);\n\t\tif (chCode !== CharCode.Space && chCode !== CharCode.Tab) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n/**\n * Returns the leading whitespace of the string.\n * If the string contains only whitespaces, returns entire string\n */\nexport function getLeadingWhitespace(str: string, start: number = 0, end: number = str.length): string {\n\tfor (let i = start; i < end; i++) {\n\t\tconst chCode = str.charCodeAt(i);\n\t\tif (chCode !== CharCode.Space && chCode !== CharCode.Tab) {\n\t\t\treturn str.substring(start, i);\n\t\t}\n\t}\n\treturn str.substring(start, end);\n}\n\n/**\n * Returns last index of the string that is not whitespace.\n * If string is empty or contains only whitespaces, returns -1\n */\nexport function lastNonWhitespaceIndex(str: string, startIndex: number = str.length - 1): number {\n\tfor (let i = startIndex; i >= 0; i--) {\n\t\tconst chCode = str.charCodeAt(i);\n\t\tif (chCode !== CharCode.Space && chCode !== CharCode.Tab) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\nexport function compare(a: string, b: string): number {\n\tif (a < b) {\n\t\treturn -1;\n\t} else if (a > b) {\n\t\treturn 1;\n\t} else {\n\t\treturn 0;\n\t}\n}\n\nexport function compareSubstring(a: string, b: string, aStart: number = 0, aEnd: number = a.length, bStart: number = 0, bEnd: number = b.length): number {\n\tfor (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {\n\t\tconst codeA = a.charCodeAt(aStart);\n\t\tconst codeB = b.charCodeAt(bStart);\n\t\tif (codeA < codeB) {\n\t\t\treturn -1;\n\t\t} else if (codeA > codeB) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\tconst aLen = aEnd - aStart;\n\tconst bLen = bEnd - bStart;\n\tif (aLen < bLen) {\n\t\treturn -1;\n\t} else if (aLen > bLen) {\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\nexport function compareIgnoreCase(a: string, b: string): number {\n\treturn compareSubstringIgnoreCase(a, b, 0, a.length, 0, b.length);\n}\n\nexport function compareSubstringIgnoreCase(a: string, b: string, aStart: number = 0, aEnd: number = a.length, bStart: number = 0, bEnd: number = b.length): number {\n\n\tfor (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {\n\n\t\tlet codeA = a.charCodeAt(aStart);\n\t\tlet codeB = b.charCodeAt(bStart);\n\n\t\tif (codeA === codeB) {\n\t\t\t// equal\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (codeA >= 128 || codeB >= 128) {\n\t\t\t// not ASCII letters -> fallback to lower-casing strings\n\t\t\treturn compareSubstring(a.toLowerCase(), b.toLowerCase(), aStart, aEnd, bStart, bEnd);\n\t\t}\n\n\t\t// mapper lower-case ascii letter onto upper-case varinats\n\t\t// [97-122] (lower ascii) --> [65-90] (upper ascii)\n\t\tif (isLowerAsciiLetter(codeA)) {\n\t\t\tcodeA -= 32;\n\t\t}\n\t\tif (isLowerAsciiLetter(codeB)) {\n\t\t\tcodeB -= 32;\n\t\t}\n\n\t\t// compare both code points\n\t\tconst diff = codeA - codeB;\n\t\tif (diff === 0) {\n\t\t\tcontinue;\n\t\t}\n\n\t\treturn diff;\n\t}\n\n\tconst aLen = aEnd - aStart;\n\tconst bLen = bEnd - bStart;\n\n\tif (aLen < bLen) {\n\t\treturn -1;\n\t} else if (aLen > bLen) {\n\t\treturn 1;\n\t}\n\n\treturn 0;\n}\n\nexport function isAsciiDigit(code: number): boolean {\n\treturn code >= CharCode.Digit0 && code <= CharCode.Digit9;\n}\n\nexport function isLowerAsciiLetter(code: number): boolean {\n\treturn code >= CharCode.a && code <= CharCode.z;\n}\n\nexport function isUpperAsciiLetter(code: number): boolean {\n\treturn code >= CharCode.A && code <= CharCode.Z;\n}\n\nexport function equalsIgnoreCase(a: string, b: string): boolean {\n\treturn a.length === b.length && compareSubstringIgnoreCase(a, b) === 0;\n}\n\nexport function startsWithIgnoreCase(str: string, candidate: string): boolean {\n\tconst candidateLength = candidate.length;\n\tif (candidate.length > str.length) {\n\t\treturn false;\n\t}\n\n\treturn compareSubstringIgnoreCase(str, candidate, 0, candidateLength) === 0;\n}\n\n/**\n * @returns the length of the common prefix of the two strings.\n */\nexport function commonPrefixLength(a: string, b: string): number {\n\n\tconst len = Math.min(a.length, b.length);\n\tlet i: number;\n\n\tfor (i = 0; i < len; i++) {\n\t\tif (a.charCodeAt(i) !== b.charCodeAt(i)) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn len;\n}\n\n/**\n * @returns the length of the common suffix of the two strings.\n */\nexport function commonSuffixLength(a: string, b: string): number {\n\n\tconst len = Math.min(a.length, b.length);\n\tlet i: number;\n\n\tconst aLastIndex = a.length - 1;\n\tconst bLastIndex = b.length - 1;\n\n\tfor (i = 0; i < len; i++) {\n\t\tif (a.charCodeAt(aLastIndex - i) !== b.charCodeAt(bLastIndex - i)) {\n\t\t\treturn i;\n\t\t}\n\t}\n\n\treturn len;\n}\n\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nexport function isHighSurrogate(charCode: number): boolean {\n\treturn (0xD800 <= charCode && charCode <= 0xDBFF);\n}\n\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nexport function isLowSurrogate(charCode: number): boolean {\n\treturn (0xDC00 <= charCode && charCode <= 0xDFFF);\n}\n\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nexport function computeCodePoint(highSurrogate: number, lowSurrogate: number): number {\n\treturn ((highSurrogate - 0xD800) << 10) + (lowSurrogate - 0xDC00) + 0x10000;\n}\n\n/**\n * get the code point that begins at offset `offset`\n */\nexport function getNextCodePoint(str: string, len: number, offset: number): number {\n\tconst charCode = str.charCodeAt(offset);\n\tif (isHighSurrogate(charCode) && offset + 1 < len) {\n\t\tconst nextCharCode = str.charCodeAt(offset + 1);\n\t\tif (isLowSurrogate(nextCharCode)) {\n\t\t\treturn computeCodePoint(charCode, nextCharCode);\n\t\t}\n\t}\n\treturn charCode;\n}\n\n/**\n * get the code point that ends right before offset `offset`\n */\nfunction getPrevCodePoint(str: string, offset: number): number {\n\tconst charCode = str.charCodeAt(offset - 1);\n\tif (isLowSurrogate(charCode) && offset > 1) {\n\t\tconst prevCharCode = str.charCodeAt(offset - 2);\n\t\tif (isHighSurrogate(prevCharCode)) {\n\t\t\treturn computeCodePoint(prevCharCode, charCode);\n\t\t}\n\t}\n\treturn charCode;\n}\n\nexport class CodePointIterator {\n\n\tprivate readonly _str: string;\n\tprivate readonly _len: number;\n\tprivate _offset: number;\n\n\tpublic get offset(): number {\n\t\treturn this._offset;\n\t}\n\n\tconstructor(str: string, offset: number = 0) {\n\t\tthis._str = str;\n\t\tthis._len = str.length;\n\t\tthis._offset = offset;\n\t}\n\n\tpublic setOffset(offset: number): void {\n\t\tthis._offset = offset;\n\t}\n\n\tpublic prevCodePoint(): number {\n\t\tconst codePoint = getPrevCodePoint(this._str, this._offset);\n\t\tthis._offset -= (codePoint >= Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN ? 2 : 1);\n\t\treturn codePoint;\n\t}\n\n\tpublic nextCodePoint(): number {\n\t\tconst codePoint = getNextCodePoint(this._str, this._len, this._offset);\n\t\tthis._offset += (codePoint >= Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN ? 2 : 1);\n\t\treturn codePoint;\n\t}\n\n\tpublic eol(): boolean {\n\t\treturn (this._offset >= this._len);\n\t}\n}\n\nexport class GraphemeIterator {\n\n\tprivate readonly _iterator: CodePointIterator;\n\n\tpublic get offset(): number {\n\t\treturn this._iterator.offset;\n\t}\n\n\tconstructor(str: string, offset: number = 0) {\n\t\tthis._iterator = new CodePointIterator(str, offset);\n\t}\n\n\tpublic nextGraphemeLength(): number {\n\t\tconst graphemeBreakTree = GraphemeBreakTree.getInstance();\n\t\tconst iterator = this._iterator;\n\t\tconst initialOffset = iterator.offset;\n\n\t\tlet graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.nextCodePoint());\n\t\twhile (!iterator.eol()) {\n\t\t\tconst offset = iterator.offset;\n\t\t\tconst nextGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.nextCodePoint());\n\t\t\tif (breakBetweenGraphemeBreakType(graphemeBreakType, nextGraphemeBreakType)) {\n\t\t\t\t// move iterator back\n\t\t\t\titerator.setOffset(offset);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tgraphemeBreakType = nextGraphemeBreakType;\n\t\t}\n\t\treturn (iterator.offset - initialOffset);\n\t}\n\n\tpublic prevGraphemeLength(): number {\n\t\tconst graphemeBreakTree = GraphemeBreakTree.getInstance();\n\t\tconst iterator = this._iterator;\n\t\tconst initialOffset = iterator.offset;\n\n\t\tlet graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.prevCodePoint());\n\t\twhile (iterator.offset > 0) {\n\t\t\tconst offset = iterator.offset;\n\t\t\tconst prevGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.prevCodePoint());\n\t\t\tif (breakBetweenGraphemeBreakType(prevGraphemeBreakType, graphemeBreakType)) {\n\t\t\t\t// move iterator back\n\t\t\t\titerator.setOffset(offset);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tgraphemeBreakType = prevGraphemeBreakType;\n\t\t}\n\t\treturn (initialOffset - iterator.offset);\n\t}\n\n\tpublic eol(): boolean {\n\t\treturn this._iterator.eol();\n\t}\n}\n\nexport function nextCharLength(str: string, initialOffset: number): number {\n\tconst iterator = new GraphemeIterator(str, initialOffset);\n\treturn iterator.nextGraphemeLength();\n}\n\nexport function prevCharLength(str: string, initialOffset: number): number {\n\tconst iterator = new GraphemeIterator(str, initialOffset);\n\treturn iterator.prevGraphemeLength();\n}\n\nexport function getCharContainingOffset(str: string, offset: number): [number, number] {\n\tif (offset > 0 && isLowSurrogate(str.charCodeAt(offset))) {\n\t\toffset--;\n\t}\n\tconst endOffset = offset + nextCharLength(str, offset);\n\tconst startOffset = endOffset - prevCharLength(str, endOffset);\n\treturn [startOffset, endOffset];\n}\n\nlet CONTAINS_RTL: RegExp | undefined = undefined;\n\nfunction makeContainsRtl() {\n\t// Generated using https://github.com/alexdima/unicode-utils/blob/main/rtl-test.js\n\treturn /(?:[\\u05BE\\u05C0\\u05C3\\u05C6\\u05D0-\\u05F4\\u0608\\u060B\\u060D\\u061B-\\u064A\\u066D-\\u066F\\u0671-\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1-\\u07EA\\u07F4\\u07F5\\u07FA\\u07FE-\\u0815\\u081A\\u0824\\u0828\\u0830-\\u0858\\u085E-\\u088E\\u08A0-\\u08C9\\u200F\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFD3D\\uFD50-\\uFDC7\\uFDF0-\\uFDFC\\uFE70-\\uFEFC]|\\uD802[\\uDC00-\\uDD1B\\uDD20-\\uDE00\\uDE10-\\uDE35\\uDE40-\\uDEE4\\uDEEB-\\uDF35\\uDF40-\\uDFFF]|\\uD803[\\uDC00-\\uDD23\\uDE80-\\uDEA9\\uDEAD-\\uDF45\\uDF51-\\uDF81\\uDF86-\\uDFF6]|\\uD83A[\\uDC00-\\uDCCF\\uDD00-\\uDD43\\uDD4B-\\uDFFF]|\\uD83B[\\uDC00-\\uDEBB])/;\n}\n\n/**\n * Returns true if `str` contains any Unicode character that is classified as \"R\" or \"AL\".\n */\nexport function containsRTL(str: string): boolean {\n\tif (!CONTAINS_RTL) {\n\t\tCONTAINS_RTL = makeContainsRtl();\n\t}\n\n\treturn CONTAINS_RTL.test(str);\n}\n\nconst IS_BASIC_ASCII = /^[\\t\\n\\r\\x20-\\x7E]*$/;\n/**\n * Returns true if `str` contains only basic ASCII characters in the range 32 - 126 (including 32 and 126) or \\n, \\r, \\t\n */\nexport function isBasicASCII(str: string): boolean {\n\treturn IS_BASIC_ASCII.test(str);\n}\n\nexport const UNUSUAL_LINE_TERMINATORS = /[\\u2028\\u2029]/; // LINE SEPARATOR (LS) or PARAGRAPH SEPARATOR (PS)\n/**\n * Returns true if `str` contains unusual line terminators, like LS or PS\n */\nexport function containsUnusualLineTerminators(str: string): boolean {\n\treturn UNUSUAL_LINE_TERMINATORS.test(str);\n}\n\nexport function isFullWidthCharacter(charCode: number): boolean {\n\t// Do a cheap trick to better support wrapping of wide characters, treat them as 2 columns\n\t// http://jrgraphix.net/research/unicode_blocks.php\n\t//          2E80 - 2EFF   CJK Radicals Supplement\n\t//          2F00 - 2FDF   Kangxi Radicals\n\t//          2FF0 - 2FFF   Ideographic Description Characters\n\t//          3000 - 303F   CJK Symbols and Punctuation\n\t//          3040 - 309F   Hiragana\n\t//          30A0 - 30FF   Katakana\n\t//          3100 - 312F   Bopomofo\n\t//          3130 - 318F   Hangul Compatibility Jamo\n\t//          3190 - 319F   Kanbun\n\t//          31A0 - 31BF   Bopomofo Extended\n\t//          31F0 - 31FF   Katakana Phonetic Extensions\n\t//          3200 - 32FF   Enclosed CJK Letters and Months\n\t//          3300 - 33FF   CJK Compatibility\n\t//          3400 - 4DBF   CJK Unified Ideographs Extension A\n\t//          4DC0 - 4DFF   Yijing Hexagram Symbols\n\t//          4E00 - 9FFF   CJK Unified Ideographs\n\t//          A000 - A48F   Yi Syllables\n\t//          A490 - A4CF   Yi Radicals\n\t//          AC00 - D7AF   Hangul Syllables\n\t// [IGNORE] D800 - DB7F   High Surrogates\n\t// [IGNORE] DB80 - DBFF   High Private Use Surrogates\n\t// [IGNORE] DC00 - DFFF   Low Surrogates\n\t// [IGNORE] E000 - F8FF   Private Use Area\n\t//          F900 - FAFF   CJK Compatibility Ideographs\n\t// [IGNORE] FB00 - FB4F   Alphabetic Presentation Forms\n\t// [IGNORE] FB50 - FDFF   Arabic Presentation Forms-A\n\t// [IGNORE] FE00 - FE0F   Variation Selectors\n\t// [IGNORE] FE20 - FE2F   Combining Half Marks\n\t// [IGNORE] FE30 - FE4F   CJK Compatibility Forms\n\t// [IGNORE] FE50 - FE6F   Small Form Variants\n\t// [IGNORE] FE70 - FEFF   Arabic Presentation Forms-B\n\t//          FF00 - FFEF   Halfwidth and Fullwidth Forms\n\t//               [https://en.wikipedia.org/wiki/Halfwidth_and_fullwidth_forms]\n\t//               of which FF01 - FF5E fullwidth ASCII of 21 to 7E\n\t// [IGNORE]    and FF65 - FFDC halfwidth of Katakana and Hangul\n\t// [IGNORE] FFF0 - FFFF   Specials\n\treturn (\n\t\t(charCode >= 0x2E80 && charCode <= 0xD7AF)\n\t\t|| (charCode >= 0xF900 && charCode <= 0xFAFF)\n\t\t|| (charCode >= 0xFF01 && charCode <= 0xFF5E)\n\t);\n}\n\n/**\n * A fast function (therefore imprecise) to check if code points are emojis.\n * Generated using https://github.com/alexdima/unicode-utils/blob/main/emoji-test.js\n */\nexport function isEmojiImprecise(x: number): boolean {\n\treturn (\n\t\t(x >= 0x1F1E6 && x <= 0x1F1FF) || (x === 8986) || (x === 8987) || (x === 9200)\n\t\t|| (x === 9203) || (x >= 9728 && x <= 10175) || (x === 11088) || (x === 11093)\n\t\t|| (x >= 127744 && x <= 128591) || (x >= 128640 && x <= 128764)\n\t\t|| (x >= 128992 && x <= 129008) || (x >= 129280 && x <= 129535)\n\t\t|| (x >= 129648 && x <= 129782)\n\t);\n}\n\n\n// -- UTF-8 BOM\n\nexport const UTF8_BOM_CHARACTER = String.fromCharCode(CharCode.UTF8_BOM);\n\nexport function startsWithUTF8BOM(str: string): boolean {\n\treturn !!(str && str.length > 0 && str.charCodeAt(0) === CharCode.UTF8_BOM);\n}\n\nexport function containsUppercaseCharacter(target: string, ignoreEscapedChars = false): boolean {\n\tif (!target) {\n\t\treturn false;\n\t}\n\n\tif (ignoreEscapedChars) {\n\t\ttarget = target.replace(/\\\\./g, '');\n\t}\n\n\treturn target.toLowerCase() !== target;\n}\n\n/**\n * Produces 'a'-'z', followed by 'A'-'Z'... followed by 'a'-'z', etc.\n */\nexport function singleLetterHash(n: number): string {\n\tconst LETTERS_CNT = (CharCode.Z - CharCode.A + 1);\n\n\tn = n % (2 * LETTERS_CNT);\n\n\tif (n < LETTERS_CNT) {\n\t\treturn String.fromCharCode(CharCode.a + n);\n\t}\n\n\treturn String.fromCharCode(CharCode.A + n - LETTERS_CNT);\n}\n\nfunction breakBetweenGraphemeBreakType(breakTypeA: GraphemeBreakType, breakTypeB: GraphemeBreakType): boolean {\n\t// http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundary_Rules\n\n\t// !!! Let's make the common case a bit faster\n\tif (breakTypeA === GraphemeBreakType.Other) {\n\t\t// see https://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakTest-13.0.0d10.html#table\n\t\treturn (breakTypeB !== GraphemeBreakType.Extend && breakTypeB !== GraphemeBreakType.SpacingMark);\n\t}\n\n\t// Do not break between a CR and LF. Otherwise, break before and after controls.\n\t// GB3                                        CR × LF\n\t// GB4                       (Control | CR | LF) ÷\n\t// GB5                                           ÷ (Control | CR | LF)\n\tif (breakTypeA === GraphemeBreakType.CR) {\n\t\tif (breakTypeB === GraphemeBreakType.LF) {\n\t\t\treturn false; // GB3\n\t\t}\n\t}\n\tif (breakTypeA === GraphemeBreakType.Control || breakTypeA === GraphemeBreakType.CR || breakTypeA === GraphemeBreakType.LF) {\n\t\treturn true; // GB4\n\t}\n\tif (breakTypeB === GraphemeBreakType.Control || breakTypeB === GraphemeBreakType.CR || breakTypeB === GraphemeBreakType.LF) {\n\t\treturn true; // GB5\n\t}\n\n\t// Do not break Hangul syllable sequences.\n\t// GB6                                         L × (L | V | LV | LVT)\n\t// GB7                                  (LV | V) × (V | T)\n\t// GB8                                 (LVT | T) × T\n\tif (breakTypeA === GraphemeBreakType.L) {\n\t\tif (breakTypeB === GraphemeBreakType.L || breakTypeB === GraphemeBreakType.V || breakTypeB === GraphemeBreakType.LV || breakTypeB === GraphemeBreakType.LVT) {\n\t\t\treturn false; // GB6\n\t\t}\n\t}\n\tif (breakTypeA === GraphemeBreakType.LV || breakTypeA === GraphemeBreakType.V) {\n\t\tif (breakTypeB === GraphemeBreakType.V || breakTypeB === GraphemeBreakType.T) {\n\t\t\treturn false; // GB7\n\t\t}\n\t}\n\tif (breakTypeA === GraphemeBreakType.LVT || breakTypeA === GraphemeBreakType.T) {\n\t\tif (breakTypeB === GraphemeBreakType.T) {\n\t\t\treturn false; // GB8\n\t\t}\n\t}\n\n\t// Do not break before extending characters or ZWJ.\n\t// GB9                                           × (Extend | ZWJ)\n\tif (breakTypeB === GraphemeBreakType.Extend || breakTypeB === GraphemeBreakType.ZWJ) {\n\t\treturn false; // GB9\n\t}\n\n\t// The GB9a and GB9b rules only apply to extended grapheme clusters:\n\t// Do not break before SpacingMarks, or after Prepend characters.\n\t// GB9a                                          × SpacingMark\n\t// GB9b                                  Prepend ×\n\tif (breakTypeB === GraphemeBreakType.SpacingMark) {\n\t\treturn false; // GB9a\n\t}\n\tif (breakTypeA === GraphemeBreakType.Prepend) {\n\t\treturn false; // GB9b\n\t}\n\n\t// Do not break within emoji modifier sequences or emoji zwj sequences.\n\t// GB11    \\p{Extended_Pictographic} Extend* ZWJ × \\p{Extended_Pictographic}\n\tif (breakTypeA === GraphemeBreakType.ZWJ && breakTypeB === GraphemeBreakType.Extended_Pictographic) {\n\t\t// Note: we are not implementing the rule entirely here to avoid introducing states\n\t\treturn false; // GB11\n\t}\n\n\t// GB12                          sot (RI RI)* RI × RI\n\t// GB13                        [^RI] (RI RI)* RI × RI\n\tif (breakTypeA === GraphemeBreakType.Regional_Indicator && breakTypeB === GraphemeBreakType.Regional_Indicator) {\n\t\t// Note: we are not implementing the rule entirely here to avoid introducing states\n\t\treturn false; // GB12 & GB13\n\t}\n\n\t// GB999                                     Any ÷ Any\n\treturn true;\n}\n\nexport const enum GraphemeBreakType {\n\tOther = 0,\n\tPrepend = 1,\n\tCR = 2,\n\tLF = 3,\n\tControl = 4,\n\tExtend = 5,\n\tRegional_Indicator = 6,\n\tSpacingMark = 7,\n\tL = 8,\n\tV = 9,\n\tT = 10,\n\tLV = 11,\n\tLVT = 12,\n\tZWJ = 13,\n\tExtended_Pictographic = 14\n}\n\nclass GraphemeBreakTree {\n\n\tprivate static _INSTANCE: GraphemeBreakTree | null = null;\n\tpublic static getInstance(): GraphemeBreakTree {\n\t\tif (!GraphemeBreakTree._INSTANCE) {\n\t\t\tGraphemeBreakTree._INSTANCE = new GraphemeBreakTree();\n\t\t}\n\t\treturn GraphemeBreakTree._INSTANCE;\n\t}\n\n\tprivate readonly _data: number[];\n\n\tconstructor() {\n\t\tthis._data = getGraphemeBreakRawData();\n\t}\n\n\tpublic getGraphemeBreakType(codePoint: number): GraphemeBreakType {\n\t\t// !!! Let's make 7bit ASCII a bit faster: 0..31\n\t\tif (codePoint < 32) {\n\t\t\tif (codePoint === CharCode.LineFeed) {\n\t\t\t\treturn GraphemeBreakType.LF;\n\t\t\t}\n\t\t\tif (codePoint === CharCode.CarriageReturn) {\n\t\t\t\treturn GraphemeBreakType.CR;\n\t\t\t}\n\t\t\treturn GraphemeBreakType.Control;\n\t\t}\n\t\t// !!! Let's make 7bit ASCII a bit faster: 32..126\n\t\tif (codePoint < 127) {\n\t\t\treturn GraphemeBreakType.Other;\n\t\t}\n\n\t\tconst data = this._data;\n\t\tconst nodeCount = data.length / 3;\n\t\tlet nodeIndex = 1;\n\t\twhile (nodeIndex <= nodeCount) {\n\t\t\tif (codePoint < data[3 * nodeIndex]) {\n\t\t\t\t// go left\n\t\t\t\tnodeIndex = 2 * nodeIndex;\n\t\t\t} else if (codePoint > data[3 * nodeIndex + 1]) {\n\t\t\t\t// go right\n\t\t\t\tnodeIndex = 2 * nodeIndex + 1;\n\t\t\t} else {\n\t\t\t\t// hit\n\t\t\t\treturn data[3 * nodeIndex + 2];\n\t\t\t}\n\t\t}\n\n\t\treturn GraphemeBreakType.Other;\n\t}\n}\n\nfunction getGraphemeBreakRawData(): number[] {\n\t// generated using https://github.com/alexdima/unicode-utils/blob/main/grapheme-break.js\n\treturn JSON.parse('[0,0,0,51229,51255,12,44061,44087,12,127462,127487,6,7083,7085,5,47645,47671,12,54813,54839,12,128678,128678,14,3270,3270,5,9919,9923,14,45853,45879,12,49437,49463,12,53021,53047,12,71216,71218,7,128398,128399,14,129360,129374,14,2519,2519,5,4448,4519,9,9742,9742,14,12336,12336,14,44957,44983,12,46749,46775,12,48541,48567,12,50333,50359,12,52125,52151,12,53917,53943,12,69888,69890,5,73018,73018,5,127990,127990,14,128558,128559,14,128759,128760,14,129653,129655,14,2027,2035,5,2891,2892,7,3761,3761,5,6683,6683,5,8293,8293,4,9825,9826,14,9999,9999,14,43452,43453,5,44509,44535,12,45405,45431,12,46301,46327,12,47197,47223,12,48093,48119,12,48989,49015,12,49885,49911,12,50781,50807,12,51677,51703,12,52573,52599,12,53469,53495,12,54365,54391,12,65279,65279,4,70471,70472,7,72145,72147,7,119173,119179,5,127799,127818,14,128240,128244,14,128512,128512,14,128652,128652,14,128721,128722,14,129292,129292,14,129445,129450,14,129734,129743,14,1476,1477,5,2366,2368,7,2750,2752,7,3076,3076,5,3415,3415,5,4141,4144,5,6109,6109,5,6964,6964,5,7394,7400,5,9197,9198,14,9770,9770,14,9877,9877,14,9968,9969,14,10084,10084,14,43052,43052,5,43713,43713,5,44285,44311,12,44733,44759,12,45181,45207,12,45629,45655,12,46077,46103,12,46525,46551,12,46973,46999,12,47421,47447,12,47869,47895,12,48317,48343,12,48765,48791,12,49213,49239,12,49661,49687,12,50109,50135,12,50557,50583,12,51005,51031,12,51453,51479,12,51901,51927,12,52349,52375,12,52797,52823,12,53245,53271,12,53693,53719,12,54141,54167,12,54589,54615,12,55037,55063,12,69506,69509,5,70191,70193,5,70841,70841,7,71463,71467,5,72330,72342,5,94031,94031,5,123628,123631,5,127763,127765,14,127941,127941,14,128043,128062,14,128302,128317,14,128465,128467,14,128539,128539,14,128640,128640,14,128662,128662,14,128703,128703,14,128745,128745,14,129004,129007,14,129329,129330,14,129402,129402,14,129483,129483,14,129686,129704,14,130048,131069,14,173,173,4,1757,1757,1,2200,2207,5,2434,2435,7,2631,2632,5,2817,2817,5,3008,3008,5,3201,3201,5,3387,3388,5,3542,3542,5,3902,3903,7,4190,4192,5,6002,6003,5,6439,6440,5,6765,6770,7,7019,7027,5,7154,7155,7,8205,8205,13,8505,8505,14,9654,9654,14,9757,9757,14,9792,9792,14,9852,9853,14,9890,9894,14,9937,9937,14,9981,9981,14,10035,10036,14,11035,11036,14,42654,42655,5,43346,43347,7,43587,43587,5,44006,44007,7,44173,44199,12,44397,44423,12,44621,44647,12,44845,44871,12,45069,45095,12,45293,45319,12,45517,45543,12,45741,45767,12,45965,45991,12,46189,46215,12,46413,46439,12,46637,46663,12,46861,46887,12,47085,47111,12,47309,47335,12,47533,47559,12,47757,47783,12,47981,48007,12,48205,48231,12,48429,48455,12,48653,48679,12,48877,48903,12,49101,49127,12,49325,49351,12,49549,49575,12,49773,49799,12,49997,50023,12,50221,50247,12,50445,50471,12,50669,50695,12,50893,50919,12,51117,51143,12,51341,51367,12,51565,51591,12,51789,51815,12,52013,52039,12,52237,52263,12,52461,52487,12,52685,52711,12,52909,52935,12,53133,53159,12,53357,53383,12,53581,53607,12,53805,53831,12,54029,54055,12,54253,54279,12,54477,54503,12,54701,54727,12,54925,54951,12,55149,55175,12,68101,68102,5,69762,69762,7,70067,70069,7,70371,70378,5,70720,70721,7,71087,71087,5,71341,71341,5,71995,71996,5,72249,72249,7,72850,72871,5,73109,73109,5,118576,118598,5,121505,121519,5,127245,127247,14,127568,127569,14,127777,127777,14,127872,127891,14,127956,127967,14,128015,128016,14,128110,128172,14,128259,128259,14,128367,128368,14,128424,128424,14,128488,128488,14,128530,128532,14,128550,128551,14,128566,128566,14,128647,128647,14,128656,128656,14,128667,128673,14,128691,128693,14,128715,128715,14,128728,128732,14,128752,128752,14,128765,128767,14,129096,129103,14,129311,129311,14,129344,129349,14,129394,129394,14,129413,129425,14,129466,129471,14,129511,129535,14,129664,129666,14,129719,129722,14,129760,129767,14,917536,917631,5,13,13,2,1160,1161,5,1564,1564,4,1807,1807,1,2085,2087,5,2307,2307,7,2382,2383,7,2497,2500,5,2563,2563,7,2677,2677,5,2763,2764,7,2879,2879,5,2914,2915,5,3021,3021,5,3142,3144,5,3263,3263,5,3285,3286,5,3398,3400,7,3530,3530,5,3633,3633,5,3864,3865,5,3974,3975,5,4155,4156,7,4229,4230,5,5909,5909,7,6078,6085,7,6277,6278,5,6451,6456,7,6744,6750,5,6846,6846,5,6972,6972,5,7074,7077,5,7146,7148,7,7222,7223,5,7416,7417,5,8234,8238,4,8417,8417,5,9000,9000,14,9203,9203,14,9730,9731,14,9748,9749,14,9762,9763,14,9776,9783,14,9800,9811,14,9831,9831,14,9872,9873,14,9882,9882,14,9900,9903,14,9929,9933,14,9941,9960,14,9974,9974,14,9989,9989,14,10006,10006,14,10062,10062,14,10160,10160,14,11647,11647,5,12953,12953,14,43019,43019,5,43232,43249,5,43443,43443,5,43567,43568,7,43696,43696,5,43765,43765,7,44013,44013,5,44117,44143,12,44229,44255,12,44341,44367,12,44453,44479,12,44565,44591,12,44677,44703,12,44789,44815,12,44901,44927,12,45013,45039,12,45125,45151,12,45237,45263,12,45349,45375,12,45461,45487,12,45573,45599,12,45685,45711,12,45797,45823,12,45909,45935,12,46021,46047,12,46133,46159,12,46245,46271,12,46357,46383,12,46469,46495,12,46581,46607,12,46693,46719,12,46805,46831,12,46917,46943,12,47029,47055,12,47141,47167,12,47253,47279,12,47365,47391,12,47477,47503,12,47589,47615,12,47701,47727,12,47813,47839,12,47925,47951,12,48037,48063,12,48149,48175,12,48261,48287,12,48373,48399,12,48485,48511,12,48597,48623,12,48709,48735,12,48821,48847,12,48933,48959,12,49045,49071,12,49157,49183,12,49269,49295,12,49381,49407,12,49493,49519,12,49605,49631,12,49717,49743,12,49829,49855,12,49941,49967,12,50053,50079,12,50165,50191,12,50277,50303,12,50389,50415,12,50501,50527,12,50613,50639,12,50725,50751,12,50837,50863,12,50949,50975,12,51061,51087,12,51173,51199,12,51285,51311,12,51397,51423,12,51509,51535,12,51621,51647,12,51733,51759,12,51845,51871,12,51957,51983,12,52069,52095,12,52181,52207,12,52293,52319,12,52405,52431,12,52517,52543,12,52629,52655,12,52741,52767,12,52853,52879,12,52965,52991,12,53077,53103,12,53189,53215,12,53301,53327,12,53413,53439,12,53525,53551,12,53637,53663,12,53749,53775,12,53861,53887,12,53973,53999,12,54085,54111,12,54197,54223,12,54309,54335,12,54421,54447,12,54533,54559,12,54645,54671,12,54757,54783,12,54869,54895,12,54981,55007,12,55093,55119,12,55243,55291,10,66045,66045,5,68325,68326,5,69688,69702,5,69817,69818,5,69957,69958,7,70089,70092,5,70198,70199,5,70462,70462,5,70502,70508,5,70750,70750,5,70846,70846,7,71100,71101,5,71230,71230,7,71351,71351,5,71737,71738,5,72000,72000,7,72160,72160,5,72273,72278,5,72752,72758,5,72882,72883,5,73031,73031,5,73461,73462,7,94192,94193,7,119149,119149,7,121403,121452,5,122915,122916,5,126980,126980,14,127358,127359,14,127535,127535,14,127759,127759,14,127771,127771,14,127792,127793,14,127825,127867,14,127897,127899,14,127945,127945,14,127985,127986,14,128000,128007,14,128021,128021,14,128066,128100,14,128184,128235,14,128249,128252,14,128266,128276,14,128335,128335,14,128379,128390,14,128407,128419,14,128444,128444,14,128481,128481,14,128499,128499,14,128526,128526,14,128536,128536,14,128543,128543,14,128556,128556,14,128564,128564,14,128577,128580,14,128643,128645,14,128649,128649,14,128654,128654,14,128660,128660,14,128664,128664,14,128675,128675,14,128686,128689,14,128695,128696,14,128705,128709,14,128717,128719,14,128725,128725,14,128736,128741,14,128747,128748,14,128755,128755,14,128762,128762,14,128981,128991,14,129009,129023,14,129160,129167,14,129296,129304,14,129320,129327,14,129340,129342,14,129356,129356,14,129388,129392,14,129399,129400,14,129404,129407,14,129432,129442,14,129454,129455,14,129473,129474,14,129485,129487,14,129648,129651,14,129659,129660,14,129671,129679,14,129709,129711,14,129728,129730,14,129751,129753,14,129776,129782,14,917505,917505,4,917760,917999,5,10,10,3,127,159,4,768,879,5,1471,1471,5,1536,1541,1,1648,1648,5,1767,1768,5,1840,1866,5,2070,2073,5,2137,2139,5,2274,2274,1,2363,2363,7,2377,2380,7,2402,2403,5,2494,2494,5,2507,2508,7,2558,2558,5,2622,2624,7,2641,2641,5,2691,2691,7,2759,2760,5,2786,2787,5,2876,2876,5,2881,2884,5,2901,2902,5,3006,3006,5,3014,3016,7,3072,3072,5,3134,3136,5,3157,3158,5,3260,3260,5,3266,3266,5,3274,3275,7,3328,3329,5,3391,3392,7,3405,3405,5,3457,3457,5,3536,3537,7,3551,3551,5,3636,3642,5,3764,3772,5,3895,3895,5,3967,3967,7,3993,4028,5,4146,4151,5,4182,4183,7,4226,4226,5,4253,4253,5,4957,4959,5,5940,5940,7,6070,6070,7,6087,6088,7,6158,6158,4,6432,6434,5,6448,6449,7,6679,6680,5,6742,6742,5,6754,6754,5,6783,6783,5,6912,6915,5,6966,6970,5,6978,6978,5,7042,7042,7,7080,7081,5,7143,7143,7,7150,7150,7,7212,7219,5,7380,7392,5,7412,7412,5,8203,8203,4,8232,8232,4,8265,8265,14,8400,8412,5,8421,8432,5,8617,8618,14,9167,9167,14,9200,9200,14,9410,9410,14,9723,9726,14,9733,9733,14,9745,9745,14,9752,9752,14,9760,9760,14,9766,9766,14,9774,9774,14,9786,9786,14,9794,9794,14,9823,9823,14,9828,9828,14,9833,9850,14,9855,9855,14,9875,9875,14,9880,9880,14,9885,9887,14,9896,9897,14,9906,9916,14,9926,9927,14,9935,9935,14,9939,9939,14,9962,9962,14,9972,9972,14,9978,9978,14,9986,9986,14,9997,9997,14,10002,10002,14,10017,10017,14,10055,10055,14,10071,10071,14,10133,10135,14,10548,10549,14,11093,11093,14,12330,12333,5,12441,12442,5,42608,42610,5,43010,43010,5,43045,43046,5,43188,43203,7,43302,43309,5,43392,43394,5,43446,43449,5,43493,43493,5,43571,43572,7,43597,43597,7,43703,43704,5,43756,43757,5,44003,44004,7,44009,44010,7,44033,44059,12,44089,44115,12,44145,44171,12,44201,44227,12,44257,44283,12,44313,44339,12,44369,44395,12,44425,44451,12,44481,44507,12,44537,44563,12,44593,44619,12,44649,44675,12,44705,44731,12,44761,44787,12,44817,44843,12,44873,44899,12,44929,44955,12,44985,45011,12,45041,45067,12,45097,45123,12,45153,45179,12,45209,45235,12,45265,45291,12,45321,45347,12,45377,45403,12,45433,45459,12,45489,45515,12,45545,45571,12,45601,45627,12,45657,45683,12,45713,45739,12,45769,45795,12,45825,45851,12,45881,45907,12,45937,45963,12,45993,46019,12,46049,46075,12,46105,46131,12,46161,46187,12,46217,46243,12,46273,46299,12,46329,46355,12,46385,46411,12,46441,46467,12,46497,46523,12,46553,46579,12,46609,46635,12,46665,46691,12,46721,46747,12,46777,46803,12,46833,46859,12,46889,46915,12,46945,46971,12,47001,47027,12,47057,47083,12,47113,47139,12,47169,47195,12,47225,47251,12,47281,47307,12,47337,47363,12,47393,47419,12,47449,47475,12,47505,47531,12,47561,47587,12,47617,47643,12,47673,47699,12,47729,47755,12,47785,47811,12,47841,47867,12,47897,47923,12,47953,47979,12,48009,48035,12,48065,48091,12,48121,48147,12,48177,48203,12,48233,48259,12,48289,48315,12,48345,48371,12,48401,48427,12,48457,48483,12,48513,48539,12,48569,48595,12,48625,48651,12,48681,48707,12,48737,48763,12,48793,48819,12,48849,48875,12,48905,48931,12,48961,48987,12,49017,49043,12,49073,49099,12,49129,49155,12,49185,49211,12,49241,49267,12,49297,49323,12,49353,49379,12,49409,49435,12,49465,49491,12,49521,49547,12,49577,49603,12,49633,49659,12,49689,49715,12,49745,49771,12,49801,49827,12,49857,49883,12,49913,49939,12,49969,49995,12,50025,50051,12,50081,50107,12,50137,50163,12,50193,50219,12,50249,50275,12,50305,50331,12,50361,50387,12,50417,50443,12,50473,50499,12,50529,50555,12,50585,50611,12,50641,50667,12,50697,50723,12,50753,50779,12,50809,50835,12,50865,50891,12,50921,50947,12,50977,51003,12,51033,51059,12,51089,51115,12,51145,51171,12,51201,51227,12,51257,51283,12,51313,51339,12,51369,51395,12,51425,51451,12,51481,51507,12,51537,51563,12,51593,51619,12,51649,51675,12,51705,51731,12,51761,51787,12,51817,51843,12,51873,51899,12,51929,51955,12,51985,52011,12,52041,52067,12,52097,52123,12,52153,52179,12,52209,52235,12,52265,52291,12,52321,52347,12,52377,52403,12,52433,52459,12,52489,52515,12,52545,52571,12,52601,52627,12,52657,52683,12,52713,52739,12,52769,52795,12,52825,52851,12,52881,52907,12,52937,52963,12,52993,53019,12,53049,53075,12,53105,53131,12,53161,53187,12,53217,53243,12,53273,53299,12,53329,53355,12,53385,53411,12,53441,53467,12,53497,53523,12,53553,53579,12,53609,53635,12,53665,53691,12,53721,53747,12,53777,53803,12,53833,53859,12,53889,53915,12,53945,53971,12,54001,54027,12,54057,54083,12,54113,54139,12,54169,54195,12,54225,54251,12,54281,54307,12,54337,54363,12,54393,54419,12,54449,54475,12,54505,54531,12,54561,54587,12,54617,54643,12,54673,54699,12,54729,54755,12,54785,54811,12,54841,54867,12,54897,54923,12,54953,54979,12,55009,55035,12,55065,55091,12,55121,55147,12,55177,55203,12,65024,65039,5,65520,65528,4,66422,66426,5,68152,68154,5,69291,69292,5,69633,69633,5,69747,69748,5,69811,69814,5,69826,69826,5,69932,69932,7,70016,70017,5,70079,70080,7,70095,70095,5,70196,70196,5,70367,70367,5,70402,70403,7,70464,70464,5,70487,70487,5,70709,70711,7,70725,70725,7,70833,70834,7,70843,70844,7,70849,70849,7,71090,71093,5,71103,71104,5,71227,71228,7,71339,71339,5,71344,71349,5,71458,71461,5,71727,71735,5,71985,71989,7,71998,71998,5,72002,72002,7,72154,72155,5,72193,72202,5,72251,72254,5,72281,72283,5,72344,72345,5,72766,72766,7,72874,72880,5,72885,72886,5,73023,73029,5,73104,73105,5,73111,73111,5,92912,92916,5,94095,94098,5,113824,113827,4,119142,119142,7,119155,119162,4,119362,119364,5,121476,121476,5,122888,122904,5,123184,123190,5,125252,125258,5,127183,127183,14,127340,127343,14,127377,127386,14,127491,127503,14,127548,127551,14,127744,127756,14,127761,127761,14,127769,127769,14,127773,127774,14,127780,127788,14,127796,127797,14,127820,127823,14,127869,127869,14,127894,127895,14,127902,127903,14,127943,127943,14,127947,127950,14,127972,127972,14,127988,127988,14,127992,127994,14,128009,128011,14,128019,128019,14,128023,128041,14,128064,128064,14,128102,128107,14,128174,128181,14,128238,128238,14,128246,128247,14,128254,128254,14,128264,128264,14,128278,128299,14,128329,128330,14,128348,128359,14,128371,128377,14,128392,128393,14,128401,128404,14,128421,128421,14,128433,128434,14,128450,128452,14,128476,128478,14,128483,128483,14,128495,128495,14,128506,128506,14,128519,128520,14,128528,128528,14,128534,128534,14,128538,128538,14,128540,128542,14,128544,128549,14,128552,128555,14,128557,128557,14,128560,128563,14,128565,128565,14,128567,128576,14,128581,128591,14,128641,128642,14,128646,128646,14,128648,128648,14,128650,128651,14,128653,128653,14,128655,128655,14,128657,128659,14,128661,128661,14,128663,128663,14,128665,128666,14,128674,128674,14,128676,128677,14,128679,128685,14,128690,128690,14,128694,128694,14,128697,128702,14,128704,128704,14,128710,128714,14,128716,128716,14,128720,128720,14,128723,128724,14,128726,128727,14,128733,128735,14,128742,128744,14,128746,128746,14,128749,128751,14,128753,128754,14,128756,128758,14,128761,128761,14,128763,128764,14,128884,128895,14,128992,129003,14,129008,129008,14,129036,129039,14,129114,129119,14,129198,129279,14,129293,129295,14,129305,129310,14,129312,129319,14,129328,129328,14,129331,129338,14,129343,129343,14,129351,129355,14,129357,129359,14,129375,129387,14,129393,129393,14,129395,129398,14,129401,129401,14,129403,129403,14,129408,129412,14,129426,129431,14,129443,129444,14,129451,129453,14,129456,129465,14,129472,129472,14,129475,129482,14,129484,129484,14,129488,129510,14,129536,129647,14,129652,129652,14,129656,129658,14,129661,129663,14,129667,129670,14,129680,129685,14,129705,129708,14,129712,129718,14,129723,129727,14,129731,129733,14,129744,129750,14,129754,129759,14,129768,129775,14,129783,129791,14,917504,917504,4,917506,917535,4,917632,917759,4,918000,921599,4,0,9,4,11,12,4,14,31,4,169,169,14,174,174,14,1155,1159,5,1425,1469,5,1473,1474,5,1479,1479,5,1552,1562,5,1611,1631,5,1750,1756,5,1759,1764,5,1770,1773,5,1809,1809,5,1958,1968,5,2045,2045,5,2075,2083,5,2089,2093,5,2192,2193,1,2250,2273,5,2275,2306,5,2362,2362,5,2364,2364,5,2369,2376,5,2381,2381,5,2385,2391,5,2433,2433,5,2492,2492,5,2495,2496,7,2503,2504,7,2509,2509,5,2530,2531,5,2561,2562,5,2620,2620,5,2625,2626,5,2635,2637,5,2672,2673,5,2689,2690,5,2748,2748,5,2753,2757,5,2761,2761,7,2765,2765,5,2810,2815,5,2818,2819,7,2878,2878,5,2880,2880,7,2887,2888,7,2893,2893,5,2903,2903,5,2946,2946,5,3007,3007,7,3009,3010,7,3018,3020,7,3031,3031,5,3073,3075,7,3132,3132,5,3137,3140,7,3146,3149,5,3170,3171,5,3202,3203,7,3262,3262,7,3264,3265,7,3267,3268,7,3271,3272,7,3276,3277,5,3298,3299,5,3330,3331,7,3390,3390,5,3393,3396,5,3402,3404,7,3406,3406,1,3426,3427,5,3458,3459,7,3535,3535,5,3538,3540,5,3544,3550,7,3570,3571,7,3635,3635,7,3655,3662,5,3763,3763,7,3784,3789,5,3893,3893,5,3897,3897,5,3953,3966,5,3968,3972,5,3981,3991,5,4038,4038,5,4145,4145,7,4153,4154,5,4157,4158,5,4184,4185,5,4209,4212,5,4228,4228,7,4237,4237,5,4352,4447,8,4520,4607,10,5906,5908,5,5938,5939,5,5970,5971,5,6068,6069,5,6071,6077,5,6086,6086,5,6089,6099,5,6155,6157,5,6159,6159,5,6313,6313,5,6435,6438,7,6441,6443,7,6450,6450,5,6457,6459,5,6681,6682,7,6741,6741,7,6743,6743,7,6752,6752,5,6757,6764,5,6771,6780,5,6832,6845,5,6847,6862,5,6916,6916,7,6965,6965,5,6971,6971,7,6973,6977,7,6979,6980,7,7040,7041,5,7073,7073,7,7078,7079,7,7082,7082,7,7142,7142,5,7144,7145,5,7149,7149,5,7151,7153,5,7204,7211,7,7220,7221,7,7376,7378,5,7393,7393,7,7405,7405,5,7415,7415,7,7616,7679,5,8204,8204,5,8206,8207,4,8233,8233,4,8252,8252,14,8288,8292,4,8294,8303,4,8413,8416,5,8418,8420,5,8482,8482,14,8596,8601,14,8986,8987,14,9096,9096,14,9193,9196,14,9199,9199,14,9201,9202,14,9208,9210,14,9642,9643,14,9664,9664,14,9728,9729,14,9732,9732,14,9735,9741,14,9743,9744,14,9746,9746,14,9750,9751,14,9753,9756,14,9758,9759,14,9761,9761,14,9764,9765,14,9767,9769,14,9771,9773,14,9775,9775,14,9784,9785,14,9787,9791,14,9793,9793,14,9795,9799,14,9812,9822,14,9824,9824,14,9827,9827,14,9829,9830,14,9832,9832,14,9851,9851,14,9854,9854,14,9856,9861,14,9874,9874,14,9876,9876,14,9878,9879,14,9881,9881,14,9883,9884,14,9888,9889,14,9895,9895,14,9898,9899,14,9904,9905,14,9917,9918,14,9924,9925,14,9928,9928,14,9934,9934,14,9936,9936,14,9938,9938,14,9940,9940,14,9961,9961,14,9963,9967,14,9970,9971,14,9973,9973,14,9975,9977,14,9979,9980,14,9982,9985,14,9987,9988,14,9992,9996,14,9998,9998,14,10000,10001,14,10004,10004,14,10013,10013,14,10024,10024,14,10052,10052,14,10060,10060,14,10067,10069,14,10083,10083,14,10085,10087,14,10145,10145,14,10175,10175,14,11013,11015,14,11088,11088,14,11503,11505,5,11744,11775,5,12334,12335,5,12349,12349,14,12951,12951,14,42607,42607,5,42612,42621,5,42736,42737,5,43014,43014,5,43043,43044,7,43047,43047,7,43136,43137,7,43204,43205,5,43263,43263,5,43335,43345,5,43360,43388,8,43395,43395,7,43444,43445,7,43450,43451,7,43454,43456,7,43561,43566,5,43569,43570,5,43573,43574,5,43596,43596,5,43644,43644,5,43698,43700,5,43710,43711,5,43755,43755,7,43758,43759,7,43766,43766,5,44005,44005,5,44008,44008,5,44012,44012,7,44032,44032,11,44060,44060,11,44088,44088,11,44116,44116,11,44144,44144,11,44172,44172,11,44200,44200,11,44228,44228,11,44256,44256,11,44284,44284,11,44312,44312,11,44340,44340,11,44368,44368,11,44396,44396,11,44424,44424,11,44452,44452,11,44480,44480,11,44508,44508,11,44536,44536,11,44564,44564,11,44592,44592,11,44620,44620,11,44648,44648,11,44676,44676,11,44704,44704,11,44732,44732,11,44760,44760,11,44788,44788,11,44816,44816,11,44844,44844,11,44872,44872,11,44900,44900,11,44928,44928,11,44956,44956,11,44984,44984,11,45012,45012,11,45040,45040,11,45068,45068,11,45096,45096,11,45124,45124,11,45152,45152,11,45180,45180,11,45208,45208,11,45236,45236,11,45264,45264,11,45292,45292,11,45320,45320,11,45348,45348,11,45376,45376,11,45404,45404,11,45432,45432,11,45460,45460,11,45488,45488,11,45516,45516,11,45544,45544,11,45572,45572,11,45600,45600,11,45628,45628,11,45656,45656,11,45684,45684,11,45712,45712,11,45740,45740,11,45768,45768,11,45796,45796,11,45824,45824,11,45852,45852,11,45880,45880,11,45908,45908,11,45936,45936,11,45964,45964,11,45992,45992,11,46020,46020,11,46048,46048,11,46076,46076,11,46104,46104,11,46132,46132,11,46160,46160,11,46188,46188,11,46216,46216,11,46244,46244,11,46272,46272,11,46300,46300,11,46328,46328,11,46356,46356,11,46384,46384,11,46412,46412,11,46440,46440,11,46468,46468,11,46496,46496,11,46524,46524,11,46552,46552,11,46580,46580,11,46608,46608,11,46636,46636,11,46664,46664,11,46692,46692,11,46720,46720,11,46748,46748,11,46776,46776,11,46804,46804,11,46832,46832,11,46860,46860,11,46888,46888,11,46916,46916,11,46944,46944,11,46972,46972,11,47000,47000,11,47028,47028,11,47056,47056,11,47084,47084,11,47112,47112,11,47140,47140,11,47168,47168,11,47196,47196,11,47224,47224,11,47252,47252,11,47280,47280,11,47308,47308,11,47336,47336,11,47364,47364,11,47392,47392,11,47420,47420,11,47448,47448,11,47476,47476,11,47504,47504,11,47532,47532,11,47560,47560,11,47588,47588,11,47616,47616,11,47644,47644,11,47672,47672,11,47700,47700,11,47728,47728,11,47756,47756,11,47784,47784,11,47812,47812,11,47840,47840,11,47868,47868,11,47896,47896,11,47924,47924,11,47952,47952,11,47980,47980,11,48008,48008,11,48036,48036,11,48064,48064,11,48092,48092,11,48120,48120,11,48148,48148,11,48176,48176,11,48204,48204,11,48232,48232,11,48260,48260,11,48288,48288,11,48316,48316,11,48344,48344,11,48372,48372,11,48400,48400,11,48428,48428,11,48456,48456,11,48484,48484,11,48512,48512,11,48540,48540,11,48568,48568,11,48596,48596,11,48624,48624,11,48652,48652,11,48680,48680,11,48708,48708,11,48736,48736,11,48764,48764,11,48792,48792,11,48820,48820,11,48848,48848,11,48876,48876,11,48904,48904,11,48932,48932,11,48960,48960,11,48988,48988,11,49016,49016,11,49044,49044,11,49072,49072,11,49100,49100,11,49128,49128,11,49156,49156,11,49184,49184,11,49212,49212,11,49240,49240,11,49268,49268,11,49296,49296,11,49324,49324,11,49352,49352,11,49380,49380,11,49408,49408,11,49436,49436,11,49464,49464,11,49492,49492,11,49520,49520,11,49548,49548,11,49576,49576,11,49604,49604,11,49632,49632,11,49660,49660,11,49688,49688,11,49716,49716,11,49744,49744,11,49772,49772,11,49800,49800,11,49828,49828,11,49856,49856,11,49884,49884,11,49912,49912,11,49940,49940,11,49968,49968,11,49996,49996,11,50024,50024,11,50052,50052,11,50080,50080,11,50108,50108,11,50136,50136,11,50164,50164,11,50192,50192,11,50220,50220,11,50248,50248,11,50276,50276,11,50304,50304,11,50332,50332,11,50360,50360,11,50388,50388,11,50416,50416,11,50444,50444,11,50472,50472,11,50500,50500,11,50528,50528,11,50556,50556,11,50584,50584,11,50612,50612,11,50640,50640,11,50668,50668,11,50696,50696,11,50724,50724,11,50752,50752,11,50780,50780,11,50808,50808,11,50836,50836,11,50864,50864,11,50892,50892,11,50920,50920,11,50948,50948,11,50976,50976,11,51004,51004,11,51032,51032,11,51060,51060,11,51088,51088,11,51116,51116,11,51144,51144,11,51172,51172,11,51200,51200,11,51228,51228,11,51256,51256,11,51284,51284,11,51312,51312,11,51340,51340,11,51368,51368,11,51396,51396,11,51424,51424,11,51452,51452,11,51480,51480,11,51508,51508,11,51536,51536,11,51564,51564,11,51592,51592,11,51620,51620,11,51648,51648,11,51676,51676,11,51704,51704,11,51732,51732,11,51760,51760,11,51788,51788,11,51816,51816,11,51844,51844,11,51872,51872,11,51900,51900,11,51928,51928,11,51956,51956,11,51984,51984,11,52012,52012,11,52040,52040,11,52068,52068,11,52096,52096,11,52124,52124,11,52152,52152,11,52180,52180,11,52208,52208,11,52236,52236,11,52264,52264,11,52292,52292,11,52320,52320,11,52348,52348,11,52376,52376,11,52404,52404,11,52432,52432,11,52460,52460,11,52488,52488,11,52516,52516,11,52544,52544,11,52572,52572,11,52600,52600,11,52628,52628,11,52656,52656,11,52684,52684,11,52712,52712,11,52740,52740,11,52768,52768,11,52796,52796,11,52824,52824,11,52852,52852,11,52880,52880,11,52908,52908,11,52936,52936,11,52964,52964,11,52992,52992,11,53020,53020,11,53048,53048,11,53076,53076,11,53104,53104,11,53132,53132,11,53160,53160,11,53188,53188,11,53216,53216,11,53244,53244,11,53272,53272,11,53300,53300,11,53328,53328,11,53356,53356,11,53384,53384,11,53412,53412,11,53440,53440,11,53468,53468,11,53496,53496,11,53524,53524,11,53552,53552,11,53580,53580,11,53608,53608,11,53636,53636,11,53664,53664,11,53692,53692,11,53720,53720,11,53748,53748,11,53776,53776,11,53804,53804,11,53832,53832,11,53860,53860,11,53888,53888,11,53916,53916,11,53944,53944,11,53972,53972,11,54000,54000,11,54028,54028,11,54056,54056,11,54084,54084,11,54112,54112,11,54140,54140,11,54168,54168,11,54196,54196,11,54224,54224,11,54252,54252,11,54280,54280,11,54308,54308,11,54336,54336,11,54364,54364,11,54392,54392,11,54420,54420,11,54448,54448,11,54476,54476,11,54504,54504,11,54532,54532,11,54560,54560,11,54588,54588,11,54616,54616,11,54644,54644,11,54672,54672,11,54700,54700,11,54728,54728,11,54756,54756,11,54784,54784,11,54812,54812,11,54840,54840,11,54868,54868,11,54896,54896,11,54924,54924,11,54952,54952,11,54980,54980,11,55008,55008,11,55036,55036,11,55064,55064,11,55092,55092,11,55120,55120,11,55148,55148,11,55176,55176,11,55216,55238,9,64286,64286,5,65056,65071,5,65438,65439,5,65529,65531,4,66272,66272,5,68097,68099,5,68108,68111,5,68159,68159,5,68900,68903,5,69446,69456,5,69632,69632,7,69634,69634,7,69744,69744,5,69759,69761,5,69808,69810,7,69815,69816,7,69821,69821,1,69837,69837,1,69927,69931,5,69933,69940,5,70003,70003,5,70018,70018,7,70070,70078,5,70082,70083,1,70094,70094,7,70188,70190,7,70194,70195,7,70197,70197,7,70206,70206,5,70368,70370,7,70400,70401,5,70459,70460,5,70463,70463,7,70465,70468,7,70475,70477,7,70498,70499,7,70512,70516,5,70712,70719,5,70722,70724,5,70726,70726,5,70832,70832,5,70835,70840,5,70842,70842,5,70845,70845,5,70847,70848,5,70850,70851,5,71088,71089,7,71096,71099,7,71102,71102,7,71132,71133,5,71219,71226,5,71229,71229,5,71231,71232,5,71340,71340,7,71342,71343,7,71350,71350,7,71453,71455,5,71462,71462,7,71724,71726,7,71736,71736,7,71984,71984,5,71991,71992,7,71997,71997,7,71999,71999,1,72001,72001,1,72003,72003,5,72148,72151,5,72156,72159,7,72164,72164,7,72243,72248,5,72250,72250,1,72263,72263,5,72279,72280,7,72324,72329,1,72343,72343,7,72751,72751,7,72760,72765,5,72767,72767,5,72873,72873,7,72881,72881,7,72884,72884,7,73009,73014,5,73020,73021,5,73030,73030,1,73098,73102,7,73107,73108,7,73110,73110,7,73459,73460,5,78896,78904,4,92976,92982,5,94033,94087,7,94180,94180,5,113821,113822,5,118528,118573,5,119141,119141,5,119143,119145,5,119150,119154,5,119163,119170,5,119210,119213,5,121344,121398,5,121461,121461,5,121499,121503,5,122880,122886,5,122907,122913,5,122918,122922,5,123566,123566,5,125136,125142,5,126976,126979,14,126981,127182,14,127184,127231,14,127279,127279,14,127344,127345,14,127374,127374,14,127405,127461,14,127489,127490,14,127514,127514,14,127538,127546,14,127561,127567,14,127570,127743,14,127757,127758,14,127760,127760,14,127762,127762,14,127766,127768,14,127770,127770,14,127772,127772,14,127775,127776,14,127778,127779,14,127789,127791,14,127794,127795,14,127798,127798,14,127819,127819,14,127824,127824,14,127868,127868,14,127870,127871,14,127892,127893,14,127896,127896,14,127900,127901,14,127904,127940,14,127942,127942,14,127944,127944,14,127946,127946,14,127951,127955,14,127968,127971,14,127973,127984,14,127987,127987,14,127989,127989,14,127991,127991,14,127995,127999,5,128008,128008,14,128012,128014,14,128017,128018,14,128020,128020,14,128022,128022,14,128042,128042,14,128063,128063,14,128065,128065,14,128101,128101,14,128108,128109,14,128173,128173,14,128182,128183,14,128236,128237,14,128239,128239,14,128245,128245,14,128248,128248,14,128253,128253,14,128255,128258,14,128260,128263,14,128265,128265,14,128277,128277,14,128300,128301,14,128326,128328,14,128331,128334,14,128336,128347,14,128360,128366,14,128369,128370,14,128378,128378,14,128391,128391,14,128394,128397,14,128400,128400,14,128405,128406,14,128420,128420,14,128422,128423,14,128425,128432,14,128435,128443,14,128445,128449,14,128453,128464,14,128468,128475,14,128479,128480,14,128482,128482,14,128484,128487,14,128489,128494,14,128496,128498,14,128500,128505,14,128507,128511,14,128513,128518,14,128521,128525,14,128527,128527,14,128529,128529,14,128533,128533,14,128535,128535,14,128537,128537,14]');\n}\n\n//#endregion\n\n/**\n * Computes the offset after performing a left delete on the given string,\n * while considering unicode grapheme/emoji rules.\n*/\nexport function getLeftDeleteOffset(offset: number, str: string): number {\n\tif (offset === 0) {\n\t\treturn 0;\n\t}\n\n\t// Try to delete emoji part.\n\tconst emojiOffset = getOffsetBeforeLastEmojiComponent(offset, str);\n\tif (emojiOffset !== undefined) {\n\t\treturn emojiOffset;\n\t}\n\n\t// Otherwise, just skip a single code point.\n\tconst iterator = new CodePointIterator(str, offset);\n\titerator.prevCodePoint();\n\treturn iterator.offset;\n}\n\nfunction getOffsetBeforeLastEmojiComponent(initialOffset: number, str: string): number | undefined {\n\t// See https://www.unicode.org/reports/tr51/tr51-14.html#EBNF_and_Regex for the\n\t// structure of emojis.\n\tconst iterator = new CodePointIterator(str, initialOffset);\n\tlet codePoint = iterator.prevCodePoint();\n\n\t// Skip modifiers\n\twhile ((isEmojiModifier(codePoint) || codePoint === CodePoint.emojiVariantSelector || codePoint === CodePoint.enclosingKeyCap)) {\n\t\tif (iterator.offset === 0) {\n\t\t\t// Cannot skip modifier, no preceding emoji base.\n\t\t\treturn undefined;\n\t\t}\n\t\tcodePoint = iterator.prevCodePoint();\n\t}\n\n\t// Expect base emoji\n\tif (!isEmojiImprecise(codePoint)) {\n\t\t// Unexpected code point, not a valid emoji.\n\t\treturn undefined;\n\t}\n\n\tlet resultOffset = iterator.offset;\n\n\tif (resultOffset > 0) {\n\t\t// Skip optional ZWJ code points that combine multiple emojis.\n\t\t// In theory, we should check if that ZWJ actually combines multiple emojis\n\t\t// to prevent deleting ZWJs in situations we didn't account for.\n\t\tconst optionalZwjCodePoint = iterator.prevCodePoint();\n\t\tif (optionalZwjCodePoint === CodePoint.zwj) {\n\t\t\tresultOffset = iterator.offset;\n\t\t}\n\t}\n\n\treturn resultOffset;\n}\n\nfunction isEmojiModifier(codePoint: number): boolean {\n\treturn 0x1F3FB <= codePoint && codePoint <= 0x1F3FF;\n}\n\nconst enum CodePoint {\n\tzwj = 0x200D,\n\n\t/**\n\t * Variation Selector-16 (VS16)\n\t*/\n\temojiVariantSelector = 0xFE0F,\n\n\t/**\n\t * Combining Enclosing Keycap\n\t */\n\tenclosingKeyCap = 0x20E3,\n}\n\nexport const noBreakWhitespace = '\\xa0';\n\nexport class AmbiguousCharacters {\n\tprivate static readonly ambiguousCharacterData = new Lazy<\n\t\tRecord<\n\t\t\tstring | '_common' | '_default',\n\t\t\t/* code point -> ascii code point */ number[]\n\t\t>\n\t>(() => {\n\t\t// Generated using https://github.com/hediet/vscode-unicode-data\n\t\t// Stored as key1, value1, key2, value2, ...\n\t\treturn JSON.parse(\n\t\t\t'{\\\"_common\\\":[8232,32,8233,32,5760,32,8192,32,8193,32,8194,32,8195,32,8196,32,8197,32,8198,32,8200,32,8201,32,8202,32,8287,32,8199,32,8239,32,2042,95,65101,95,65102,95,65103,95,8208,45,8209,45,8210,45,65112,45,1748,45,8259,45,727,45,8722,45,10134,45,11450,45,1549,44,1643,44,8218,44,184,44,42233,44,894,59,2307,58,2691,58,1417,58,1795,58,1796,58,5868,58,65072,58,6147,58,6153,58,8282,58,1475,58,760,58,42889,58,8758,58,720,58,42237,58,451,33,11601,33,660,63,577,63,2429,63,5038,63,42731,63,119149,46,8228,46,1793,46,1794,46,42510,46,68176,46,1632,46,1776,46,42232,46,1373,96,65287,96,8219,96,8242,96,1370,96,1523,96,8175,96,65344,96,900,96,8189,96,8125,96,8127,96,8190,96,697,96,884,96,712,96,714,96,715,96,756,96,699,96,701,96,700,96,702,96,42892,96,1497,96,2036,96,2037,96,5194,96,5836,96,94033,96,94034,96,65339,91,10088,40,10098,40,12308,40,64830,40,65341,93,10089,41,10099,41,12309,41,64831,41,10100,123,119060,123,10101,125,65342,94,8270,42,1645,42,8727,42,66335,42,5941,47,8257,47,8725,47,8260,47,9585,47,10187,47,10744,47,119354,47,12755,47,12339,47,11462,47,20031,47,12035,47,65340,92,65128,92,8726,92,10189,92,10741,92,10745,92,119311,92,119355,92,12756,92,20022,92,12034,92,42872,38,708,94,710,94,5869,43,10133,43,66203,43,8249,60,10094,60,706,60,119350,60,5176,60,5810,60,5120,61,11840,61,12448,61,42239,61,8250,62,10095,62,707,62,119351,62,5171,62,94015,62,8275,126,732,126,8128,126,8764,126,65372,124,65293,45,120784,50,120794,50,120804,50,120814,50,120824,50,130034,50,42842,50,423,50,1000,50,42564,50,5311,50,42735,50,119302,51,120785,51,120795,51,120805,51,120815,51,120825,51,130035,51,42923,51,540,51,439,51,42858,51,11468,51,1248,51,94011,51,71882,51,120786,52,120796,52,120806,52,120816,52,120826,52,130036,52,5070,52,71855,52,120787,53,120797,53,120807,53,120817,53,120827,53,130037,53,444,53,71867,53,120788,54,120798,54,120808,54,120818,54,120828,54,130038,54,11474,54,5102,54,71893,54,119314,55,120789,55,120799,55,120809,55,120819,55,120829,55,130039,55,66770,55,71878,55,2819,56,2538,56,2666,56,125131,56,120790,56,120800,56,120810,56,120820,56,120830,56,130040,56,547,56,546,56,66330,56,2663,57,2920,57,2541,57,3437,57,120791,57,120801,57,120811,57,120821,57,120831,57,130041,57,42862,57,11466,57,71884,57,71852,57,71894,57,9082,97,65345,97,119834,97,119886,97,119938,97,119990,97,120042,97,120094,97,120146,97,120198,97,120250,97,120302,97,120354,97,120406,97,120458,97,593,97,945,97,120514,97,120572,97,120630,97,120688,97,120746,97,65313,65,119808,65,119860,65,119912,65,119964,65,120016,65,120068,65,120120,65,120172,65,120224,65,120276,65,120328,65,120380,65,120432,65,913,65,120488,65,120546,65,120604,65,120662,65,120720,65,5034,65,5573,65,42222,65,94016,65,66208,65,119835,98,119887,98,119939,98,119991,98,120043,98,120095,98,120147,98,120199,98,120251,98,120303,98,120355,98,120407,98,120459,98,388,98,5071,98,5234,98,5551,98,65314,66,8492,66,119809,66,119861,66,119913,66,120017,66,120069,66,120121,66,120173,66,120225,66,120277,66,120329,66,120381,66,120433,66,42932,66,914,66,120489,66,120547,66,120605,66,120663,66,120721,66,5108,66,5623,66,42192,66,66178,66,66209,66,66305,66,65347,99,8573,99,119836,99,119888,99,119940,99,119992,99,120044,99,120096,99,120148,99,120200,99,120252,99,120304,99,120356,99,120408,99,120460,99,7428,99,1010,99,11429,99,43951,99,66621,99,128844,67,71922,67,71913,67,65315,67,8557,67,8450,67,8493,67,119810,67,119862,67,119914,67,119966,67,120018,67,120174,67,120226,67,120278,67,120330,67,120382,67,120434,67,1017,67,11428,67,5087,67,42202,67,66210,67,66306,67,66581,67,66844,67,8574,100,8518,100,119837,100,119889,100,119941,100,119993,100,120045,100,120097,100,120149,100,120201,100,120253,100,120305,100,120357,100,120409,100,120461,100,1281,100,5095,100,5231,100,42194,100,8558,68,8517,68,119811,68,119863,68,119915,68,119967,68,120019,68,120071,68,120123,68,120175,68,120227,68,120279,68,120331,68,120383,68,120435,68,5024,68,5598,68,5610,68,42195,68,8494,101,65349,101,8495,101,8519,101,119838,101,119890,101,119942,101,120046,101,120098,101,120150,101,120202,101,120254,101,120306,101,120358,101,120410,101,120462,101,43826,101,1213,101,8959,69,65317,69,8496,69,119812,69,119864,69,119916,69,120020,69,120072,69,120124,69,120176,69,120228,69,120280,69,120332,69,120384,69,120436,69,917,69,120492,69,120550,69,120608,69,120666,69,120724,69,11577,69,5036,69,42224,69,71846,69,71854,69,66182,69,119839,102,119891,102,119943,102,119995,102,120047,102,120099,102,120151,102,120203,102,120255,102,120307,102,120359,102,120411,102,120463,102,43829,102,42905,102,383,102,7837,102,1412,102,119315,70,8497,70,119813,70,119865,70,119917,70,120021,70,120073,70,120125,70,120177,70,120229,70,120281,70,120333,70,120385,70,120437,70,42904,70,988,70,120778,70,5556,70,42205,70,71874,70,71842,70,66183,70,66213,70,66853,70,65351,103,8458,103,119840,103,119892,103,119944,103,120048,103,120100,103,120152,103,120204,103,120256,103,120308,103,120360,103,120412,103,120464,103,609,103,7555,103,397,103,1409,103,119814,71,119866,71,119918,71,119970,71,120022,71,120074,71,120126,71,120178,71,120230,71,120282,71,120334,71,120386,71,120438,71,1292,71,5056,71,5107,71,42198,71,65352,104,8462,104,119841,104,119945,104,119997,104,120049,104,120101,104,120153,104,120205,104,120257,104,120309,104,120361,104,120413,104,120465,104,1211,104,1392,104,5058,104,65320,72,8459,72,8460,72,8461,72,119815,72,119867,72,119919,72,120023,72,120179,72,120231,72,120283,72,120335,72,120387,72,120439,72,919,72,120494,72,120552,72,120610,72,120668,72,120726,72,11406,72,5051,72,5500,72,42215,72,66255,72,731,105,9075,105,65353,105,8560,105,8505,105,8520,105,119842,105,119894,105,119946,105,119998,105,120050,105,120102,105,120154,105,120206,105,120258,105,120310,105,120362,105,120414,105,120466,105,120484,105,618,105,617,105,953,105,8126,105,890,105,120522,105,120580,105,120638,105,120696,105,120754,105,1110,105,42567,105,1231,105,43893,105,5029,105,71875,105,65354,106,8521,106,119843,106,119895,106,119947,106,119999,106,120051,106,120103,106,120155,106,120207,106,120259,106,120311,106,120363,106,120415,106,120467,106,1011,106,1112,106,65322,74,119817,74,119869,74,119921,74,119973,74,120025,74,120077,74,120129,74,120181,74,120233,74,120285,74,120337,74,120389,74,120441,74,42930,74,895,74,1032,74,5035,74,5261,74,42201,74,119844,107,119896,107,119948,107,120000,107,120052,107,120104,107,120156,107,120208,107,120260,107,120312,107,120364,107,120416,107,120468,107,8490,75,65323,75,119818,75,119870,75,119922,75,119974,75,120026,75,120078,75,120130,75,120182,75,120234,75,120286,75,120338,75,120390,75,120442,75,922,75,120497,75,120555,75,120613,75,120671,75,120729,75,11412,75,5094,75,5845,75,42199,75,66840,75,1472,108,8739,73,9213,73,65512,73,1633,108,1777,73,66336,108,125127,108,120783,73,120793,73,120803,73,120813,73,120823,73,130033,73,65321,73,8544,73,8464,73,8465,73,119816,73,119868,73,119920,73,120024,73,120128,73,120180,73,120232,73,120284,73,120336,73,120388,73,120440,73,65356,108,8572,73,8467,108,119845,108,119897,108,119949,108,120001,108,120053,108,120105,73,120157,73,120209,73,120261,73,120313,73,120365,73,120417,73,120469,73,448,73,120496,73,120554,73,120612,73,120670,73,120728,73,11410,73,1030,73,1216,73,1493,108,1503,108,1575,108,126464,108,126592,108,65166,108,65165,108,1994,108,11599,73,5825,73,42226,73,93992,73,66186,124,66313,124,119338,76,8556,76,8466,76,119819,76,119871,76,119923,76,120027,76,120079,76,120131,76,120183,76,120235,76,120287,76,120339,76,120391,76,120443,76,11472,76,5086,76,5290,76,42209,76,93974,76,71843,76,71858,76,66587,76,66854,76,65325,77,8559,77,8499,77,119820,77,119872,77,119924,77,120028,77,120080,77,120132,77,120184,77,120236,77,120288,77,120340,77,120392,77,120444,77,924,77,120499,77,120557,77,120615,77,120673,77,120731,77,1018,77,11416,77,5047,77,5616,77,5846,77,42207,77,66224,77,66321,77,119847,110,119899,110,119951,110,120003,110,120055,110,120107,110,120159,110,120211,110,120263,110,120315,110,120367,110,120419,110,120471,110,1400,110,1404,110,65326,78,8469,78,119821,78,119873,78,119925,78,119977,78,120029,78,120081,78,120185,78,120237,78,120289,78,120341,78,120393,78,120445,78,925,78,120500,78,120558,78,120616,78,120674,78,120732,78,11418,78,42208,78,66835,78,3074,111,3202,111,3330,111,3458,111,2406,111,2662,111,2790,111,3046,111,3174,111,3302,111,3430,111,3664,111,3792,111,4160,111,1637,111,1781,111,65359,111,8500,111,119848,111,119900,111,119952,111,120056,111,120108,111,120160,111,120212,111,120264,111,120316,111,120368,111,120420,111,120472,111,7439,111,7441,111,43837,111,959,111,120528,111,120586,111,120644,111,120702,111,120760,111,963,111,120532,111,120590,111,120648,111,120706,111,120764,111,11423,111,4351,111,1413,111,1505,111,1607,111,126500,111,126564,111,126596,111,65259,111,65260,111,65258,111,65257,111,1726,111,64428,111,64429,111,64427,111,64426,111,1729,111,64424,111,64425,111,64423,111,64422,111,1749,111,3360,111,4125,111,66794,111,71880,111,71895,111,66604,111,1984,79,2534,79,2918,79,12295,79,70864,79,71904,79,120782,79,120792,79,120802,79,120812,79,120822,79,130032,79,65327,79,119822,79,119874,79,119926,79,119978,79,120030,79,120082,79,120134,79,120186,79,120238,79,120290,79,120342,79,120394,79,120446,79,927,79,120502,79,120560,79,120618,79,120676,79,120734,79,11422,79,1365,79,11604,79,4816,79,2848,79,66754,79,42227,79,71861,79,66194,79,66219,79,66564,79,66838,79,9076,112,65360,112,119849,112,119901,112,119953,112,120005,112,120057,112,120109,112,120161,112,120213,112,120265,112,120317,112,120369,112,120421,112,120473,112,961,112,120530,112,120544,112,120588,112,120602,112,120646,112,120660,112,120704,112,120718,112,120762,112,120776,112,11427,112,65328,80,8473,80,119823,80,119875,80,119927,80,119979,80,120031,80,120083,80,120187,80,120239,80,120291,80,120343,80,120395,80,120447,80,929,80,120504,80,120562,80,120620,80,120678,80,120736,80,11426,80,5090,80,5229,80,42193,80,66197,80,119850,113,119902,113,119954,113,120006,113,120058,113,120110,113,120162,113,120214,113,120266,113,120318,113,120370,113,120422,113,120474,113,1307,113,1379,113,1382,113,8474,81,119824,81,119876,81,119928,81,119980,81,120032,81,120084,81,120188,81,120240,81,120292,81,120344,81,120396,81,120448,81,11605,81,119851,114,119903,114,119955,114,120007,114,120059,114,120111,114,120163,114,120215,114,120267,114,120319,114,120371,114,120423,114,120475,114,43847,114,43848,114,7462,114,11397,114,43905,114,119318,82,8475,82,8476,82,8477,82,119825,82,119877,82,119929,82,120033,82,120189,82,120241,82,120293,82,120345,82,120397,82,120449,82,422,82,5025,82,5074,82,66740,82,5511,82,42211,82,94005,82,65363,115,119852,115,119904,115,119956,115,120008,115,120060,115,120112,115,120164,115,120216,115,120268,115,120320,115,120372,115,120424,115,120476,115,42801,115,445,115,1109,115,43946,115,71873,115,66632,115,65331,83,119826,83,119878,83,119930,83,119982,83,120034,83,120086,83,120138,83,120190,83,120242,83,120294,83,120346,83,120398,83,120450,83,1029,83,1359,83,5077,83,5082,83,42210,83,94010,83,66198,83,66592,83,119853,116,119905,116,119957,116,120009,116,120061,116,120113,116,120165,116,120217,116,120269,116,120321,116,120373,116,120425,116,120477,116,8868,84,10201,84,128872,84,65332,84,119827,84,119879,84,119931,84,119983,84,120035,84,120087,84,120139,84,120191,84,120243,84,120295,84,120347,84,120399,84,120451,84,932,84,120507,84,120565,84,120623,84,120681,84,120739,84,11430,84,5026,84,42196,84,93962,84,71868,84,66199,84,66225,84,66325,84,119854,117,119906,117,119958,117,120010,117,120062,117,120114,117,120166,117,120218,117,120270,117,120322,117,120374,117,120426,117,120478,117,42911,117,7452,117,43854,117,43858,117,651,117,965,117,120534,117,120592,117,120650,117,120708,117,120766,117,1405,117,66806,117,71896,117,8746,85,8899,85,119828,85,119880,85,119932,85,119984,85,120036,85,120088,85,120140,85,120192,85,120244,85,120296,85,120348,85,120400,85,120452,85,1357,85,4608,85,66766,85,5196,85,42228,85,94018,85,71864,85,8744,118,8897,118,65366,118,8564,118,119855,118,119907,118,119959,118,120011,118,120063,118,120115,118,120167,118,120219,118,120271,118,120323,118,120375,118,120427,118,120479,118,7456,118,957,118,120526,118,120584,118,120642,118,120700,118,120758,118,1141,118,1496,118,71430,118,43945,118,71872,118,119309,86,1639,86,1783,86,8548,86,119829,86,119881,86,119933,86,119985,86,120037,86,120089,86,120141,86,120193,86,120245,86,120297,86,120349,86,120401,86,120453,86,1140,86,11576,86,5081,86,5167,86,42719,86,42214,86,93960,86,71840,86,66845,86,623,119,119856,119,119908,119,119960,119,120012,119,120064,119,120116,119,120168,119,120220,119,120272,119,120324,119,120376,119,120428,119,120480,119,7457,119,1121,119,1309,119,1377,119,71434,119,71438,119,71439,119,43907,119,71919,87,71910,87,119830,87,119882,87,119934,87,119986,87,120038,87,120090,87,120142,87,120194,87,120246,87,120298,87,120350,87,120402,87,120454,87,1308,87,5043,87,5076,87,42218,87,5742,120,10539,120,10540,120,10799,120,65368,120,8569,120,119857,120,119909,120,119961,120,120013,120,120065,120,120117,120,120169,120,120221,120,120273,120,120325,120,120377,120,120429,120,120481,120,5441,120,5501,120,5741,88,9587,88,66338,88,71916,88,65336,88,8553,88,119831,88,119883,88,119935,88,119987,88,120039,88,120091,88,120143,88,120195,88,120247,88,120299,88,120351,88,120403,88,120455,88,42931,88,935,88,120510,88,120568,88,120626,88,120684,88,120742,88,11436,88,11613,88,5815,88,42219,88,66192,88,66228,88,66327,88,66855,88,611,121,7564,121,65369,121,119858,121,119910,121,119962,121,120014,121,120066,121,120118,121,120170,121,120222,121,120274,121,120326,121,120378,121,120430,121,120482,121,655,121,7935,121,43866,121,947,121,8509,121,120516,121,120574,121,120632,121,120690,121,120748,121,1199,121,4327,121,71900,121,65337,89,119832,89,119884,89,119936,89,119988,89,120040,89,120092,89,120144,89,120196,89,120248,89,120300,89,120352,89,120404,89,120456,89,933,89,978,89,120508,89,120566,89,120624,89,120682,89,120740,89,11432,89,1198,89,5033,89,5053,89,42220,89,94019,89,71844,89,66226,89,119859,122,119911,122,119963,122,120015,122,120067,122,120119,122,120171,122,120223,122,120275,122,120327,122,120379,122,120431,122,120483,122,7458,122,43923,122,71876,122,66293,90,71909,90,65338,90,8484,90,8488,90,119833,90,119885,90,119937,90,119989,90,120041,90,120197,90,120249,90,120301,90,120353,90,120405,90,120457,90,918,90,120493,90,120551,90,120609,90,120667,90,120725,90,5059,90,42204,90,71849,90,65282,34,65284,36,65285,37,65286,38,65290,42,65291,43,65294,46,65295,47,65296,48,65297,49,65298,50,65299,51,65300,52,65301,53,65302,54,65303,55,65304,56,65305,57,65308,60,65309,61,65310,62,65312,64,65316,68,65318,70,65319,71,65324,76,65329,81,65330,82,65333,85,65334,86,65335,87,65343,95,65346,98,65348,100,65350,102,65355,107,65357,109,65358,110,65361,113,65362,114,65364,116,65365,117,65367,119,65370,122,65371,123,65373,125,119846,109],\\\"_default\\\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"cs\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"de\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"es\\\":[8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"fr\\\":[65374,126,65306,58,65281,33,8216,96,8245,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"it\\\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"ja\\\":[8211,45,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65292,44,65307,59],\\\"ko\\\":[8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"pl\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"pt-BR\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"qps-ploc\\\":[160,32,8211,45,65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"ru\\\":[65374,126,65306,58,65281,33,8216,96,8217,96,8245,96,180,96,12494,47,305,105,921,73,1009,112,215,120,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"tr\\\":[160,32,8211,45,65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65288,40,65289,41,65292,44,65307,59,65311,63],\\\"zh-hans\\\":[65374,126,65306,58,65281,33,8245,96,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65288,40,65289,41],\\\"zh-hant\\\":[8211,45,65374,126,180,96,12494,47,1047,51,1073,54,1072,97,1040,65,1068,98,1042,66,1089,99,1057,67,1077,101,1045,69,1053,72,305,105,1050,75,921,73,1052,77,1086,111,1054,79,1009,112,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65283,35,65307,59]}'\n\t\t);\n\t});\n\n\tprivate static readonly cache = new LRUCachedFunction<\n\t\tstring[],\n\t\tAmbiguousCharacters\n\t>({ getCacheKey: JSON.stringify }, (locales) => {\n\t\tfunction arrayToMap(arr: number[]): Map<number, number> {\n\t\t\tconst result = new Map<number, number>();\n\t\t\tfor (let i = 0; i < arr.length; i += 2) {\n\t\t\t\tresult.set(arr[i], arr[i + 1]);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tfunction mergeMaps(\n\t\t\tmap1: Map<number, number>,\n\t\t\tmap2: Map<number, number>\n\t\t): Map<number, number> {\n\t\t\tconst result = new Map<number, number>(map1);\n\t\t\tfor (const [key, value] of map2) {\n\t\t\t\tresult.set(key, value);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tfunction intersectMaps(\n\t\t\tmap1: Map<number, number> | undefined,\n\t\t\tmap2: Map<number, number>\n\t\t) {\n\t\t\tif (!map1) {\n\t\t\t\treturn map2;\n\t\t\t}\n\t\t\tconst result = new Map<number, number>();\n\t\t\tfor (const [key, value] of map1) {\n\t\t\t\tif (map2.has(key)) {\n\t\t\t\t\tresult.set(key, value);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tconst data = this.ambiguousCharacterData.value;\n\n\t\tlet filteredLocales = locales.filter(\n\t\t\t(l) => !l.startsWith('_') && l in data\n\t\t);\n\t\tif (filteredLocales.length === 0) {\n\t\t\tfilteredLocales = ['_default'];\n\t\t}\n\n\t\tlet languageSpecificMap: Map<number, number> | undefined = undefined;\n\t\tfor (const locale of filteredLocales) {\n\t\t\tconst map = arrayToMap(data[locale]);\n\t\t\tlanguageSpecificMap = intersectMaps(languageSpecificMap, map);\n\t\t}\n\n\t\tconst commonMap = arrayToMap(data['_common']);\n\t\tconst map = mergeMaps(commonMap, languageSpecificMap!);\n\n\t\treturn new AmbiguousCharacters(map);\n\t});\n\n\tpublic static getInstance(locales: Set<string>): AmbiguousCharacters {\n\t\treturn AmbiguousCharacters.cache.get(Array.from(locales));\n\t}\n\n\tprivate static _locales = new Lazy<string[]>(() =>\n\t\tObject.keys(AmbiguousCharacters.ambiguousCharacterData.value).filter(\n\t\t\t(k) => !k.startsWith('_')\n\t\t)\n\t);\n\tpublic static getLocales(): string[] {\n\t\treturn AmbiguousCharacters._locales.value;\n\t}\n\n\tprivate constructor(\n\t\tprivate readonly confusableDictionary: Map<number, number>\n\t) { }\n\n\tpublic isAmbiguous(codePoint: number): boolean {\n\t\treturn this.confusableDictionary.has(codePoint);\n\t}\n\n\t/**\n\t * Returns the non basic ASCII code point that the given code point can be confused,\n\t * or undefined if such code point does note exist.\n\t */\n\tpublic getPrimaryConfusable(codePoint: number): number | undefined {\n\t\treturn this.confusableDictionary.get(codePoint);\n\t}\n\n\tpublic getConfusableCodePoints(): ReadonlySet<number> {\n\t\treturn new Set(this.confusableDictionary.keys());\n\t}\n}\n\nexport class InvisibleCharacters {\n\tprivate static getRawData(): number[] {\n\t\t// Generated using https://github.com/hediet/vscode-unicode-data\n\t\treturn JSON.parse('[9,10,11,12,13,32,127,160,173,847,1564,4447,4448,6068,6069,6155,6156,6157,6158,7355,7356,8192,8193,8194,8195,8196,8197,8198,8199,8200,8201,8202,8203,8204,8205,8206,8207,8234,8235,8236,8237,8238,8239,8287,8288,8289,8290,8291,8292,8293,8294,8295,8296,8297,8298,8299,8300,8301,8302,8303,10240,12288,12644,65024,65025,65026,65027,65028,65029,65030,65031,65032,65033,65034,65035,65036,65037,65038,65039,65279,65440,65520,65521,65522,65523,65524,65525,65526,65527,65528,65532,78844,119155,119156,119157,119158,119159,119160,119161,119162,917504,917505,917506,917507,917508,917509,917510,917511,917512,917513,917514,917515,917516,917517,917518,917519,917520,917521,917522,917523,917524,917525,917526,917527,917528,917529,917530,917531,917532,917533,917534,917535,917536,917537,917538,917539,917540,917541,917542,917543,917544,917545,917546,917547,917548,917549,917550,917551,917552,917553,917554,917555,917556,917557,917558,917559,917560,917561,917562,917563,917564,917565,917566,917567,917568,917569,917570,917571,917572,917573,917574,917575,917576,917577,917578,917579,917580,917581,917582,917583,917584,917585,917586,917587,917588,917589,917590,917591,917592,917593,917594,917595,917596,917597,917598,917599,917600,917601,917602,917603,917604,917605,917606,917607,917608,917609,917610,917611,917612,917613,917614,917615,917616,917617,917618,917619,917620,917621,917622,917623,917624,917625,917626,917627,917628,917629,917630,917631,917760,917761,917762,917763,917764,917765,917766,917767,917768,917769,917770,917771,917772,917773,917774,917775,917776,917777,917778,917779,917780,917781,917782,917783,917784,917785,917786,917787,917788,917789,917790,917791,917792,917793,917794,917795,917796,917797,917798,917799,917800,917801,917802,917803,917804,917805,917806,917807,917808,917809,917810,917811,917812,917813,917814,917815,917816,917817,917818,917819,917820,917821,917822,917823,917824,917825,917826,917827,917828,917829,917830,917831,917832,917833,917834,917835,917836,917837,917838,917839,917840,917841,917842,917843,917844,917845,917846,917847,917848,917849,917850,917851,917852,917853,917854,917855,917856,917857,917858,917859,917860,917861,917862,917863,917864,917865,917866,917867,917868,917869,917870,917871,917872,917873,917874,917875,917876,917877,917878,917879,917880,917881,917882,917883,917884,917885,917886,917887,917888,917889,917890,917891,917892,917893,917894,917895,917896,917897,917898,917899,917900,917901,917902,917903,917904,917905,917906,917907,917908,917909,917910,917911,917912,917913,917914,917915,917916,917917,917918,917919,917920,917921,917922,917923,917924,917925,917926,917927,917928,917929,917930,917931,917932,917933,917934,917935,917936,917937,917938,917939,917940,917941,917942,917943,917944,917945,917946,917947,917948,917949,917950,917951,917952,917953,917954,917955,917956,917957,917958,917959,917960,917961,917962,917963,917964,917965,917966,917967,917968,917969,917970,917971,917972,917973,917974,917975,917976,917977,917978,917979,917980,917981,917982,917983,917984,917985,917986,917987,917988,917989,917990,917991,917992,917993,917994,917995,917996,917997,917998,917999]');\n\t}\n\n\tprivate static _data: Set<number> | undefined = undefined;\n\n\tprivate static getData() {\n\t\tif (!this._data) {\n\t\t\tthis._data = new Set(InvisibleCharacters.getRawData());\n\t\t}\n\t\treturn this._data;\n\t}\n\n\tpublic static isInvisibleCharacter(codePoint: number): boolean {\n\t\treturn InvisibleCharacters.getData().has(codePoint);\n\t}\n\n\tpublic static get codePoints(): ReadonlySet<number> {\n\t\treturn InvisibleCharacters.getData();\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport * as strings from 'vs/base/common/strings';\n\n/**\n * Return a hash value for an object.\n */\nexport function hash(obj: any): number {\n\treturn doHash(obj, 0);\n}\n\nexport function doHash(obj: any, hashVal: number): number {\n\tswitch (typeof obj) {\n\t\tcase 'object':\n\t\t\tif (obj === null) {\n\t\t\t\treturn numberHash(349, hashVal);\n\t\t\t} else if (Array.isArray(obj)) {\n\t\t\t\treturn arrayHash(obj, hashVal);\n\t\t\t}\n\t\t\treturn objectHash(obj, hashVal);\n\t\tcase 'string':\n\t\t\treturn stringHash(obj, hashVal);\n\t\tcase 'boolean':\n\t\t\treturn booleanHash(obj, hashVal);\n\t\tcase 'number':\n\t\t\treturn numberHash(obj, hashVal);\n\t\tcase 'undefined':\n\t\t\treturn numberHash(937, hashVal);\n\t\tdefault:\n\t\t\treturn numberHash(617, hashVal);\n\t}\n}\n\nexport function numberHash(val: number, initialHashVal: number): number {\n\treturn (((initialHashVal << 5) - initialHashVal) + val) | 0;  // hashVal * 31 + ch, keep as int32\n}\n\nfunction booleanHash(b: boolean, initialHashVal: number): number {\n\treturn numberHash(b ? 433 : 863, initialHashVal);\n}\n\nexport function stringHash(s: string, hashVal: number) {\n\thashVal = numberHash(149417, hashVal);\n\tfor (let i = 0, length = s.length; i < length; i++) {\n\t\thashVal = numberHash(s.charCodeAt(i), hashVal);\n\t}\n\treturn hashVal;\n}\n\nfunction arrayHash(arr: any[], initialHashVal: number): number {\n\tinitialHashVal = numberHash(104579, initialHashVal);\n\treturn arr.reduce((hashVal, item) => doHash(item, hashVal), initialHashVal);\n}\n\nfunction objectHash(obj: any, initialHashVal: number): number {\n\tinitialHashVal = numberHash(181387, initialHashVal);\n\treturn Object.keys(obj).sort().reduce((hashVal, key) => {\n\t\thashVal = stringHash(key, hashVal);\n\t\treturn doHash(obj[key], hashVal);\n\t}, initialHashVal);\n}\n\nconst enum SHA1Constant {\n\tBLOCK_SIZE = 64, // 512 / 8\n\tUNICODE_REPLACEMENT = 0xFFFD,\n}\n\nfunction leftRotate(value: number, bits: number, totalBits: number = 32): number {\n\t// delta + bits = totalBits\n\tconst delta = totalBits - bits;\n\n\t// All ones, expect `delta` zeros aligned to the right\n\tconst mask = ~((1 << delta) - 1);\n\n\t// Join (value left-shifted `bits` bits) with (masked value right-shifted `delta` bits)\n\treturn ((value << bits) | ((mask & value) >>> delta)) >>> 0;\n}\n\nfunction fill(dest: Uint8Array, index: number = 0, count: number = dest.byteLength, value: number = 0): void {\n\tfor (let i = 0; i < count; i++) {\n\t\tdest[index + i] = value;\n\t}\n}\n\nfunction leftPad(value: string, length: number, char: string = '0'): string {\n\twhile (value.length < length) {\n\t\tvalue = char + value;\n\t}\n\treturn value;\n}\n\nexport function toHexString(buffer: ArrayBuffer): string;\nexport function toHexString(value: number, bitsize?: number): string;\nexport function toHexString(bufferOrValue: ArrayBuffer | number, bitsize: number = 32): string {\n\tif (bufferOrValue instanceof ArrayBuffer) {\n\t\treturn Array.from(new Uint8Array(bufferOrValue)).map(b => b.toString(16).padStart(2, '0')).join('');\n\t}\n\n\treturn leftPad((bufferOrValue >>> 0).toString(16), bitsize / 4);\n}\n\n/**\n * A SHA1 implementation that works with strings and does not allocate.\n */\nexport class StringSHA1 {\n\tprivate static _bigBlock32 = new DataView(new ArrayBuffer(320)); // 80 * 4 = 320\n\n\tprivate _h0 = 0x67452301;\n\tprivate _h1 = 0xEFCDAB89;\n\tprivate _h2 = 0x98BADCFE;\n\tprivate _h3 = 0x10325476;\n\tprivate _h4 = 0xC3D2E1F0;\n\n\tprivate readonly _buff: Uint8Array;\n\tprivate readonly _buffDV: DataView;\n\tprivate _buffLen: number;\n\tprivate _totalLen: number;\n\tprivate _leftoverHighSurrogate: number;\n\tprivate _finished: boolean;\n\n\tconstructor() {\n\t\tthis._buff = new Uint8Array(SHA1Constant.BLOCK_SIZE + 3 /* to fit any utf-8 */);\n\t\tthis._buffDV = new DataView(this._buff.buffer);\n\t\tthis._buffLen = 0;\n\t\tthis._totalLen = 0;\n\t\tthis._leftoverHighSurrogate = 0;\n\t\tthis._finished = false;\n\t}\n\n\tpublic update(str: string): void {\n\t\tconst strLen = str.length;\n\t\tif (strLen === 0) {\n\t\t\treturn;\n\t\t}\n\n\t\tconst buff = this._buff;\n\t\tlet buffLen = this._buffLen;\n\t\tlet leftoverHighSurrogate = this._leftoverHighSurrogate;\n\t\tlet charCode: number;\n\t\tlet offset: number;\n\n\t\tif (leftoverHighSurrogate !== 0) {\n\t\t\tcharCode = leftoverHighSurrogate;\n\t\t\toffset = -1;\n\t\t\tleftoverHighSurrogate = 0;\n\t\t} else {\n\t\t\tcharCode = str.charCodeAt(0);\n\t\t\toffset = 0;\n\t\t}\n\n\t\twhile (true) {\n\t\t\tlet codePoint = charCode;\n\t\t\tif (strings.isHighSurrogate(charCode)) {\n\t\t\t\tif (offset + 1 < strLen) {\n\t\t\t\t\tconst nextCharCode = str.charCodeAt(offset + 1);\n\t\t\t\t\tif (strings.isLowSurrogate(nextCharCode)) {\n\t\t\t\t\t\toffset++;\n\t\t\t\t\t\tcodePoint = strings.computeCodePoint(charCode, nextCharCode);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// illegal => unicode replacement character\n\t\t\t\t\t\tcodePoint = SHA1Constant.UNICODE_REPLACEMENT;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// last character is a surrogate pair\n\t\t\t\t\tleftoverHighSurrogate = charCode;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else if (strings.isLowSurrogate(charCode)) {\n\t\t\t\t// illegal => unicode replacement character\n\t\t\t\tcodePoint = SHA1Constant.UNICODE_REPLACEMENT;\n\t\t\t}\n\n\t\t\tbuffLen = this._push(buff, buffLen, codePoint);\n\t\t\toffset++;\n\t\t\tif (offset < strLen) {\n\t\t\t\tcharCode = str.charCodeAt(offset);\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tthis._buffLen = buffLen;\n\t\tthis._leftoverHighSurrogate = leftoverHighSurrogate;\n\t}\n\n\tprivate _push(buff: Uint8Array, buffLen: number, codePoint: number): number {\n\t\tif (codePoint < 0x0080) {\n\t\t\tbuff[buffLen++] = codePoint;\n\t\t} else if (codePoint < 0x0800) {\n\t\t\tbuff[buffLen++] = 0b11000000 | ((codePoint & 0b00000000000000000000011111000000) >>> 6);\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n\t\t} else if (codePoint < 0x10000) {\n\t\t\tbuff[buffLen++] = 0b11100000 | ((codePoint & 0b00000000000000001111000000000000) >>> 12);\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n\t\t} else {\n\t\t\tbuff[buffLen++] = 0b11110000 | ((codePoint & 0b00000000000111000000000000000000) >>> 18);\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000111111000000000000) >>> 12);\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n\t\t}\n\n\t\tif (buffLen >= SHA1Constant.BLOCK_SIZE) {\n\t\t\tthis._step();\n\t\t\tbuffLen -= SHA1Constant.BLOCK_SIZE;\n\t\t\tthis._totalLen += SHA1Constant.BLOCK_SIZE;\n\t\t\t// take last 3 in case of UTF8 overflow\n\t\t\tbuff[0] = buff[SHA1Constant.BLOCK_SIZE + 0];\n\t\t\tbuff[1] = buff[SHA1Constant.BLOCK_SIZE + 1];\n\t\t\tbuff[2] = buff[SHA1Constant.BLOCK_SIZE + 2];\n\t\t}\n\n\t\treturn buffLen;\n\t}\n\n\tpublic digest(): string {\n\t\tif (!this._finished) {\n\t\t\tthis._finished = true;\n\t\t\tif (this._leftoverHighSurrogate) {\n\t\t\t\t// illegal => unicode replacement character\n\t\t\t\tthis._leftoverHighSurrogate = 0;\n\t\t\t\tthis._buffLen = this._push(this._buff, this._buffLen, SHA1Constant.UNICODE_REPLACEMENT);\n\t\t\t}\n\t\t\tthis._totalLen += this._buffLen;\n\t\t\tthis._wrapUp();\n\t\t}\n\n\t\treturn toHexString(this._h0) + toHexString(this._h1) + toHexString(this._h2) + toHexString(this._h3) + toHexString(this._h4);\n\t}\n\n\tprivate _wrapUp(): void {\n\t\tthis._buff[this._buffLen++] = 0x80;\n\t\tfill(this._buff, this._buffLen);\n\n\t\tif (this._buffLen > 56) {\n\t\t\tthis._step();\n\t\t\tfill(this._buff);\n\t\t}\n\n\t\t// this will fit because the mantissa can cover up to 52 bits\n\t\tconst ml = 8 * this._totalLen;\n\n\t\tthis._buffDV.setUint32(56, Math.floor(ml / 4294967296), false);\n\t\tthis._buffDV.setUint32(60, ml % 4294967296, false);\n\n\t\tthis._step();\n\t}\n\n\tprivate _step(): void {\n\t\tconst bigBlock32 = StringSHA1._bigBlock32;\n\t\tconst data = this._buffDV;\n\n\t\tfor (let j = 0; j < 64 /* 16*4 */; j += 4) {\n\t\t\tbigBlock32.setUint32(j, data.getUint32(j, false), false);\n\t\t}\n\n\t\tfor (let j = 64; j < 320 /* 80*4 */; j += 4) {\n\t\t\tbigBlock32.setUint32(j, leftRotate((bigBlock32.getUint32(j - 12, false) ^ bigBlock32.getUint32(j - 32, false) ^ bigBlock32.getUint32(j - 56, false) ^ bigBlock32.getUint32(j - 64, false)), 1), false);\n\t\t}\n\n\t\tlet a = this._h0;\n\t\tlet b = this._h1;\n\t\tlet c = this._h2;\n\t\tlet d = this._h3;\n\t\tlet e = this._h4;\n\n\t\tlet f: number, k: number;\n\t\tlet temp: number;\n\n\t\tfor (let j = 0; j < 80; j++) {\n\t\t\tif (j < 20) {\n\t\t\t\tf = (b & c) | ((~b) & d);\n\t\t\t\tk = 0x5A827999;\n\t\t\t} else if (j < 40) {\n\t\t\t\tf = b ^ c ^ d;\n\t\t\t\tk = 0x6ED9EBA1;\n\t\t\t} else if (j < 60) {\n\t\t\t\tf = (b & c) | (b & d) | (c & d);\n\t\t\t\tk = 0x8F1BBCDC;\n\t\t\t} else {\n\t\t\t\tf = b ^ c ^ d;\n\t\t\t\tk = 0xCA62C1D6;\n\t\t\t}\n\n\t\t\ttemp = (leftRotate(a, 5) + f + e + k + bigBlock32.getUint32(j * 4, false)) & 0xffffffff;\n\t\t\te = d;\n\t\t\td = c;\n\t\t\tc = leftRotate(b, 30);\n\t\t\tb = a;\n\t\t\ta = temp;\n\t\t}\n\n\t\tthis._h0 = (this._h0 + a) & 0xffffffff;\n\t\tthis._h1 = (this._h1 + b) & 0xffffffff;\n\t\tthis._h2 = (this._h2 + c) & 0xffffffff;\n\t\tthis._h3 = (this._h3 + d) & 0xffffffff;\n\t\tthis._h4 = (this._h4 + e) & 0xffffffff;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { DiffChange } from 'vs/base/common/diff/diffChange';\nimport { stringHash } from 'vs/base/common/hash';\nimport { Constants } from 'vs/base/common/uint';\n\nexport class StringDiffSequence implements ISequence {\n\n\tconstructor(private source: string) { }\n\n\tgetElements(): Int32Array | number[] | string[] {\n\t\tconst source = this.source;\n\t\tconst characters = new Int32Array(source.length);\n\t\tfor (let i = 0, len = source.length; i < len; i++) {\n\t\t\tcharacters[i] = source.charCodeAt(i);\n\t\t}\n\t\treturn characters;\n\t}\n}\n\nexport function stringDiff(original: string, modified: string, pretty: boolean): IDiffChange[] {\n\treturn new LcsDiff(new StringDiffSequence(original), new StringDiffSequence(modified)).ComputeDiff(pretty).changes;\n}\n\nexport interface ISequence {\n\tgetElements(): Int32Array | number[] | string[];\n\tgetStrictElement?(index: number): string;\n}\n\nexport interface IDiffChange {\n\t/**\n\t * The position of the first element in the original sequence which\n\t * this change affects.\n\t */\n\toriginalStart: number;\n\n\t/**\n\t * The number of elements from the original sequence which were\n\t * affected.\n\t */\n\toriginalLength: number;\n\n\t/**\n\t * The position of the first element in the modified sequence which\n\t * this change affects.\n\t */\n\tmodifiedStart: number;\n\n\t/**\n\t * The number of elements from the modified sequence which were\n\t * affected (added).\n\t */\n\tmodifiedLength: number;\n}\n\nexport interface IContinueProcessingPredicate {\n\t(furthestOriginalIndex: number, matchLengthOfLongest: number): boolean;\n}\n\nexport interface IDiffResult {\n\tquitEarly: boolean;\n\tchanges: IDiffChange[];\n}\n\n//\n// The code below has been ported from a C# implementation in VS\n//\n\nclass Debug {\n\n\tpublic static Assert(condition: boolean, message: string): void {\n\t\tif (!condition) {\n\t\t\tthrow new Error(message);\n\t\t}\n\t}\n}\n\nclass MyArray {\n\t/**\n\t * Copies a range of elements from an Array starting at the specified source index and pastes\n\t * them to another Array starting at the specified destination index. The length and the indexes\n\t * are specified as 64-bit integers.\n\t * sourceArray:\n\t *\t\tThe Array that contains the data to copy.\n\t * sourceIndex:\n\t *\t\tA 64-bit integer that represents the index in the sourceArray at which copying begins.\n\t * destinationArray:\n\t *\t\tThe Array that receives the data.\n\t * destinationIndex:\n\t *\t\tA 64-bit integer that represents the index in the destinationArray at which storing begins.\n\t * length:\n\t *\t\tA 64-bit integer that represents the number of elements to copy.\n\t */\n\tpublic static Copy(sourceArray: any[], sourceIndex: number, destinationArray: any[], destinationIndex: number, length: number) {\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tdestinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];\n\t\t}\n\t}\n\tpublic static Copy2(sourceArray: Int32Array, sourceIndex: number, destinationArray: Int32Array, destinationIndex: number, length: number) {\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tdestinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];\n\t\t}\n\t}\n}\n\n//*****************************************************************************\n// LcsDiff.cs\n//\n// An implementation of the difference algorithm described in\n// \"An O(ND) Difference Algorithm and its variations\" by Eugene W. Myers\n//\n// Copyright (C) 2008 Microsoft Corporation @minifier_do_not_preserve\n//*****************************************************************************\n\n// Our total memory usage for storing history is (worst-case):\n// 2 * [(MaxDifferencesHistory + 1) * (MaxDifferencesHistory + 1) - 1] * sizeof(int)\n// 2 * [1448*1448 - 1] * 4 = 16773624 = 16MB\nconst enum LocalConstants {\n\tMaxDifferencesHistory = 1447\n}\n\n/**\n * A utility class which helps to create the set of DiffChanges from\n * a difference operation. This class accepts original DiffElements and\n * modified DiffElements that are involved in a particular change. The\n * MarkNextChange() method can be called to mark the separation between\n * distinct changes. At the end, the Changes property can be called to retrieve\n * the constructed changes.\n */\nclass DiffChangeHelper {\n\n\tprivate m_changes: DiffChange[];\n\tprivate m_originalStart: number;\n\tprivate m_modifiedStart: number;\n\tprivate m_originalCount: number;\n\tprivate m_modifiedCount: number;\n\n\t/**\n\t * Constructs a new DiffChangeHelper for the given DiffSequences.\n\t */\n\tconstructor() {\n\t\tthis.m_changes = [];\n\t\tthis.m_originalStart = Constants.MAX_SAFE_SMALL_INTEGER;\n\t\tthis.m_modifiedStart = Constants.MAX_SAFE_SMALL_INTEGER;\n\t\tthis.m_originalCount = 0;\n\t\tthis.m_modifiedCount = 0;\n\t}\n\n\t/**\n\t * Marks the beginning of the next change in the set of differences.\n\t */\n\tpublic MarkNextChange(): void {\n\t\t// Only add to the list if there is something to add\n\t\tif (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n\t\t\t// Add the new change to our list\n\t\t\tthis.m_changes.push(new DiffChange(this.m_originalStart, this.m_originalCount,\n\t\t\t\tthis.m_modifiedStart, this.m_modifiedCount));\n\t\t}\n\n\t\t// Reset for the next change\n\t\tthis.m_originalCount = 0;\n\t\tthis.m_modifiedCount = 0;\n\t\tthis.m_originalStart = Constants.MAX_SAFE_SMALL_INTEGER;\n\t\tthis.m_modifiedStart = Constants.MAX_SAFE_SMALL_INTEGER;\n\t}\n\n\t/**\n\t * Adds the original element at the given position to the elements\n\t * affected by the current change. The modified index gives context\n\t * to the change position with respect to the original sequence.\n\t * @param originalIndex The index of the original element to add.\n\t * @param modifiedIndex The index of the modified element that provides corresponding position in the modified sequence.\n\t */\n\tpublic AddOriginalElement(originalIndex: number, modifiedIndex: number) {\n\t\t// The 'true' start index is the smallest of the ones we've seen\n\t\tthis.m_originalStart = Math.min(this.m_originalStart, originalIndex);\n\t\tthis.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex);\n\n\t\tthis.m_originalCount++;\n\t}\n\n\t/**\n\t * Adds the modified element at the given position to the elements\n\t * affected by the current change. The original index gives context\n\t * to the change position with respect to the modified sequence.\n\t * @param originalIndex The index of the original element that provides corresponding position in the original sequence.\n\t * @param modifiedIndex The index of the modified element to add.\n\t */\n\tpublic AddModifiedElement(originalIndex: number, modifiedIndex: number): void {\n\t\t// The 'true' start index is the smallest of the ones we've seen\n\t\tthis.m_originalStart = Math.min(this.m_originalStart, originalIndex);\n\t\tthis.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex);\n\n\t\tthis.m_modifiedCount++;\n\t}\n\n\t/**\n\t * Retrieves all of the changes marked by the class.\n\t */\n\tpublic getChanges(): DiffChange[] {\n\t\tif (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n\t\t\t// Finish up on whatever is left\n\t\t\tthis.MarkNextChange();\n\t\t}\n\n\t\treturn this.m_changes;\n\t}\n\n\t/**\n\t * Retrieves all of the changes marked by the class in the reverse order\n\t */\n\tpublic getReverseChanges(): DiffChange[] {\n\t\tif (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n\t\t\t// Finish up on whatever is left\n\t\t\tthis.MarkNextChange();\n\t\t}\n\n\t\tthis.m_changes.reverse();\n\t\treturn this.m_changes;\n\t}\n\n}\n\n/**\n * An implementation of the difference algorithm described in\n * \"An O(ND) Difference Algorithm and its variations\" by Eugene W. Myers\n */\nexport class LcsDiff {\n\n\tprivate readonly ContinueProcessingPredicate: IContinueProcessingPredicate | null;\n\n\tprivate readonly _originalSequence: ISequence;\n\tprivate readonly _modifiedSequence: ISequence;\n\tprivate readonly _hasStrings: boolean;\n\tprivate readonly _originalStringElements: string[];\n\tprivate readonly _originalElementsOrHash: Int32Array;\n\tprivate readonly _modifiedStringElements: string[];\n\tprivate readonly _modifiedElementsOrHash: Int32Array;\n\n\tprivate m_forwardHistory: Int32Array[];\n\tprivate m_reverseHistory: Int32Array[];\n\n\t/**\n\t * Constructs the DiffFinder\n\t */\n\tconstructor(originalSequence: ISequence, modifiedSequence: ISequence, continueProcessingPredicate: IContinueProcessingPredicate | null = null) {\n\t\tthis.ContinueProcessingPredicate = continueProcessingPredicate;\n\n\t\tthis._originalSequence = originalSequence;\n\t\tthis._modifiedSequence = modifiedSequence;\n\n\t\tconst [originalStringElements, originalElementsOrHash, originalHasStrings] = LcsDiff._getElements(originalSequence);\n\t\tconst [modifiedStringElements, modifiedElementsOrHash, modifiedHasStrings] = LcsDiff._getElements(modifiedSequence);\n\n\t\tthis._hasStrings = (originalHasStrings && modifiedHasStrings);\n\t\tthis._originalStringElements = originalStringElements;\n\t\tthis._originalElementsOrHash = originalElementsOrHash;\n\t\tthis._modifiedStringElements = modifiedStringElements;\n\t\tthis._modifiedElementsOrHash = modifiedElementsOrHash;\n\n\t\tthis.m_forwardHistory = [];\n\t\tthis.m_reverseHistory = [];\n\t}\n\n\tprivate static _isStringArray(arr: Int32Array | number[] | string[]): arr is string[] {\n\t\treturn (arr.length > 0 && typeof arr[0] === 'string');\n\t}\n\n\tprivate static _getElements(sequence: ISequence): [string[], Int32Array, boolean] {\n\t\tconst elements = sequence.getElements();\n\n\t\tif (LcsDiff._isStringArray(elements)) {\n\t\t\tconst hashes = new Int32Array(elements.length);\n\t\t\tfor (let i = 0, len = elements.length; i < len; i++) {\n\t\t\t\thashes[i] = stringHash(elements[i], 0);\n\t\t\t}\n\t\t\treturn [elements, hashes, true];\n\t\t}\n\n\t\tif (elements instanceof Int32Array) {\n\t\t\treturn [[], elements, false];\n\t\t}\n\n\t\treturn [[], new Int32Array(elements), false];\n\t}\n\n\tprivate ElementsAreEqual(originalIndex: number, newIndex: number): boolean {\n\t\tif (this._originalElementsOrHash[originalIndex] !== this._modifiedElementsOrHash[newIndex]) {\n\t\t\treturn false;\n\t\t}\n\t\treturn (this._hasStrings ? this._originalStringElements[originalIndex] === this._modifiedStringElements[newIndex] : true);\n\t}\n\n\tprivate ElementsAreStrictEqual(originalIndex: number, newIndex: number): boolean {\n\t\tif (!this.ElementsAreEqual(originalIndex, newIndex)) {\n\t\t\treturn false;\n\t\t}\n\t\tconst originalElement = LcsDiff._getStrictElement(this._originalSequence, originalIndex);\n\t\tconst modifiedElement = LcsDiff._getStrictElement(this._modifiedSequence, newIndex);\n\t\treturn (originalElement === modifiedElement);\n\t}\n\n\tprivate static _getStrictElement(sequence: ISequence, index: number): string | null {\n\t\tif (typeof sequence.getStrictElement === 'function') {\n\t\t\treturn sequence.getStrictElement(index);\n\t\t}\n\t\treturn null;\n\t}\n\n\tprivate OriginalElementsAreEqual(index1: number, index2: number): boolean {\n\t\tif (this._originalElementsOrHash[index1] !== this._originalElementsOrHash[index2]) {\n\t\t\treturn false;\n\t\t}\n\t\treturn (this._hasStrings ? this._originalStringElements[index1] === this._originalStringElements[index2] : true);\n\t}\n\n\tprivate ModifiedElementsAreEqual(index1: number, index2: number): boolean {\n\t\tif (this._modifiedElementsOrHash[index1] !== this._modifiedElementsOrHash[index2]) {\n\t\t\treturn false;\n\t\t}\n\t\treturn (this._hasStrings ? this._modifiedStringElements[index1] === this._modifiedStringElements[index2] : true);\n\t}\n\n\tpublic ComputeDiff(pretty: boolean): IDiffResult {\n\t\treturn this._ComputeDiff(0, this._originalElementsOrHash.length - 1, 0, this._modifiedElementsOrHash.length - 1, pretty);\n\t}\n\n\t/**\n\t * Computes the differences between the original and modified input\n\t * sequences on the bounded range.\n\t * @returns An array of the differences between the two input sequences.\n\t */\n\tprivate _ComputeDiff(originalStart: number, originalEnd: number, modifiedStart: number, modifiedEnd: number, pretty: boolean): IDiffResult {\n\t\tconst quitEarlyArr = [false];\n\t\tlet changes = this.ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr);\n\n\t\tif (pretty) {\n\t\t\t// We have to clean up the computed diff to be more intuitive\n\t\t\t// but it turns out this cannot be done correctly until the entire set\n\t\t\t// of diffs have been computed\n\t\t\tchanges = this.PrettifyChanges(changes);\n\t\t}\n\n\t\treturn {\n\t\t\tquitEarly: quitEarlyArr[0],\n\t\t\tchanges: changes\n\t\t};\n\t}\n\n\t/**\n\t * Private helper method which computes the differences on the bounded range\n\t * recursively.\n\t * @returns An array of the differences between the two input sequences.\n\t */\n\tprivate ComputeDiffRecursive(originalStart: number, originalEnd: number, modifiedStart: number, modifiedEnd: number, quitEarlyArr: boolean[]): DiffChange[] {\n\t\tquitEarlyArr[0] = false;\n\n\t\t// Find the start of the differences\n\t\twhile (originalStart <= originalEnd && modifiedStart <= modifiedEnd && this.ElementsAreEqual(originalStart, modifiedStart)) {\n\t\t\toriginalStart++;\n\t\t\tmodifiedStart++;\n\t\t}\n\n\t\t// Find the end of the differences\n\t\twhile (originalEnd >= originalStart && modifiedEnd >= modifiedStart && this.ElementsAreEqual(originalEnd, modifiedEnd)) {\n\t\t\toriginalEnd--;\n\t\t\tmodifiedEnd--;\n\t\t}\n\n\t\t// In the special case where we either have all insertions or all deletions or the sequences are identical\n\t\tif (originalStart > originalEnd || modifiedStart > modifiedEnd) {\n\t\t\tlet changes: DiffChange[];\n\n\t\t\tif (modifiedStart <= modifiedEnd) {\n\t\t\t\tDebug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd');\n\n\t\t\t\t// All insertions\n\t\t\t\tchanges = [\n\t\t\t\t\tnew DiffChange(originalStart, 0, modifiedStart, modifiedEnd - modifiedStart + 1)\n\t\t\t\t];\n\t\t\t} else if (originalStart <= originalEnd) {\n\t\t\t\tDebug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd');\n\n\t\t\t\t// All deletions\n\t\t\t\tchanges = [\n\t\t\t\t\tnew DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, 0)\n\t\t\t\t];\n\t\t\t} else {\n\t\t\t\tDebug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd');\n\t\t\t\tDebug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd');\n\n\t\t\t\t// Identical sequences - No differences\n\t\t\t\tchanges = [];\n\t\t\t}\n\n\t\t\treturn changes;\n\t\t}\n\n\t\t// This problem can be solved using the Divide-And-Conquer technique.\n\t\tconst midOriginalArr = [0];\n\t\tconst midModifiedArr = [0];\n\t\tconst result = this.ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr);\n\n\t\tconst midOriginal = midOriginalArr[0];\n\t\tconst midModified = midModifiedArr[0];\n\n\t\tif (result !== null) {\n\t\t\t// Result is not-null when there was enough memory to compute the changes while\n\t\t\t// searching for the recursion point\n\t\t\treturn result;\n\t\t} else if (!quitEarlyArr[0]) {\n\t\t\t// We can break the problem down recursively by finding the changes in the\n\t\t\t// First Half:   (originalStart, modifiedStart) to (midOriginal, midModified)\n\t\t\t// Second Half:  (midOriginal + 1, minModified + 1) to (originalEnd, modifiedEnd)\n\t\t\t// NOTE: ComputeDiff() is inclusive, therefore the second range starts on the next point\n\n\t\t\tconst leftChanges = this.ComputeDiffRecursive(originalStart, midOriginal, modifiedStart, midModified, quitEarlyArr);\n\t\t\tlet rightChanges: DiffChange[] = [];\n\n\t\t\tif (!quitEarlyArr[0]) {\n\t\t\t\trightChanges = this.ComputeDiffRecursive(midOriginal + 1, originalEnd, midModified + 1, modifiedEnd, quitEarlyArr);\n\t\t\t} else {\n\t\t\t\t// We didn't have time to finish the first half, so we don't have time to compute this half.\n\t\t\t\t// Consider the entire rest of the sequence different.\n\t\t\t\trightChanges = [\n\t\t\t\t\tnew DiffChange(midOriginal + 1, originalEnd - (midOriginal + 1) + 1, midModified + 1, modifiedEnd - (midModified + 1) + 1)\n\t\t\t\t];\n\t\t\t}\n\n\t\t\treturn this.ConcatenateChanges(leftChanges, rightChanges);\n\t\t}\n\n\t\t// If we hit here, we quit early, and so can't return anything meaningful\n\t\treturn [\n\t\t\tnew DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1)\n\t\t];\n\t}\n\n\tprivate WALKTRACE(diagonalForwardBase: number, diagonalForwardStart: number, diagonalForwardEnd: number, diagonalForwardOffset: number,\n\t\tdiagonalReverseBase: number, diagonalReverseStart: number, diagonalReverseEnd: number, diagonalReverseOffset: number,\n\t\tforwardPoints: Int32Array, reversePoints: Int32Array,\n\t\toriginalIndex: number, originalEnd: number, midOriginalArr: number[],\n\t\tmodifiedIndex: number, modifiedEnd: number, midModifiedArr: number[],\n\t\tdeltaIsEven: boolean, quitEarlyArr: boolean[]\n\t): DiffChange[] {\n\t\tlet forwardChanges: DiffChange[] | null = null;\n\t\tlet reverseChanges: DiffChange[] | null = null;\n\n\t\t// First, walk backward through the forward diagonals history\n\t\tlet changeHelper = new DiffChangeHelper();\n\t\tlet diagonalMin = diagonalForwardStart;\n\t\tlet diagonalMax = diagonalForwardEnd;\n\t\tlet diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalForwardOffset;\n\t\tlet lastOriginalIndex = Constants.MIN_SAFE_SMALL_INTEGER;\n\t\tlet historyIndex = this.m_forwardHistory.length - 1;\n\n\t\tdo {\n\t\t\t// Get the diagonal index from the relative diagonal number\n\t\t\tconst diagonal = diagonalRelative + diagonalForwardBase;\n\n\t\t\t// Figure out where we came from\n\t\t\tif (diagonal === diagonalMin || (diagonal < diagonalMax && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) {\n\t\t\t\t// Vertical line (the element is an insert)\n\t\t\t\toriginalIndex = forwardPoints[diagonal + 1];\n\t\t\t\tmodifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset;\n\t\t\t\tif (originalIndex < lastOriginalIndex) {\n\t\t\t\t\tchangeHelper.MarkNextChange();\n\t\t\t\t}\n\t\t\t\tlastOriginalIndex = originalIndex;\n\t\t\t\tchangeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex);\n\t\t\t\tdiagonalRelative = (diagonal + 1) - diagonalForwardBase; //Setup for the next iteration\n\t\t\t} else {\n\t\t\t\t// Horizontal line (the element is a deletion)\n\t\t\t\toriginalIndex = forwardPoints[diagonal - 1] + 1;\n\t\t\t\tmodifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset;\n\t\t\t\tif (originalIndex < lastOriginalIndex) {\n\t\t\t\t\tchangeHelper.MarkNextChange();\n\t\t\t\t}\n\t\t\t\tlastOriginalIndex = originalIndex - 1;\n\t\t\t\tchangeHelper.AddOriginalElement(originalIndex, modifiedIndex + 1);\n\t\t\t\tdiagonalRelative = (diagonal - 1) - diagonalForwardBase; //Setup for the next iteration\n\t\t\t}\n\n\t\t\tif (historyIndex >= 0) {\n\t\t\t\tforwardPoints = this.m_forwardHistory[historyIndex];\n\t\t\t\tdiagonalForwardBase = forwardPoints[0]; //We stored this in the first spot\n\t\t\t\tdiagonalMin = 1;\n\t\t\t\tdiagonalMax = forwardPoints.length - 1;\n\t\t\t}\n\t\t} while (--historyIndex >= -1);\n\n\t\t// Ironically, we get the forward changes as the reverse of the\n\t\t// order we added them since we technically added them backwards\n\t\tforwardChanges = changeHelper.getReverseChanges();\n\n\t\tif (quitEarlyArr[0]) {\n\t\t\t// TODO: Calculate a partial from the reverse diagonals.\n\t\t\t//       For now, just assume everything after the midOriginal/midModified point is a diff\n\n\t\t\tlet originalStartPoint = midOriginalArr[0] + 1;\n\t\t\tlet modifiedStartPoint = midModifiedArr[0] + 1;\n\n\t\t\tif (forwardChanges !== null && forwardChanges.length > 0) {\n\t\t\t\tconst lastForwardChange = forwardChanges[forwardChanges.length - 1];\n\t\t\t\toriginalStartPoint = Math.max(originalStartPoint, lastForwardChange.getOriginalEnd());\n\t\t\t\tmodifiedStartPoint = Math.max(modifiedStartPoint, lastForwardChange.getModifiedEnd());\n\t\t\t}\n\n\t\t\treverseChanges = [\n\t\t\t\tnew DiffChange(originalStartPoint, originalEnd - originalStartPoint + 1,\n\t\t\t\t\tmodifiedStartPoint, modifiedEnd - modifiedStartPoint + 1)\n\t\t\t];\n\t\t} else {\n\t\t\t// Now walk backward through the reverse diagonals history\n\t\t\tchangeHelper = new DiffChangeHelper();\n\t\t\tdiagonalMin = diagonalReverseStart;\n\t\t\tdiagonalMax = diagonalReverseEnd;\n\t\t\tdiagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalReverseOffset;\n\t\t\tlastOriginalIndex = Constants.MAX_SAFE_SMALL_INTEGER;\n\t\t\thistoryIndex = (deltaIsEven) ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2;\n\n\t\t\tdo {\n\t\t\t\t// Get the diagonal index from the relative diagonal number\n\t\t\t\tconst diagonal = diagonalRelative + diagonalReverseBase;\n\n\t\t\t\t// Figure out where we came from\n\t\t\t\tif (diagonal === diagonalMin || (diagonal < diagonalMax && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) {\n\t\t\t\t\t// Horizontal line (the element is a deletion))\n\t\t\t\t\toriginalIndex = reversePoints[diagonal + 1] - 1;\n\t\t\t\t\tmodifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset;\n\t\t\t\t\tif (originalIndex > lastOriginalIndex) {\n\t\t\t\t\t\tchangeHelper.MarkNextChange();\n\t\t\t\t\t}\n\t\t\t\t\tlastOriginalIndex = originalIndex + 1;\n\t\t\t\t\tchangeHelper.AddOriginalElement(originalIndex + 1, modifiedIndex + 1);\n\t\t\t\t\tdiagonalRelative = (diagonal + 1) - diagonalReverseBase; //Setup for the next iteration\n\t\t\t\t} else {\n\t\t\t\t\t// Vertical line (the element is an insertion)\n\t\t\t\t\toriginalIndex = reversePoints[diagonal - 1];\n\t\t\t\t\tmodifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset;\n\t\t\t\t\tif (originalIndex > lastOriginalIndex) {\n\t\t\t\t\t\tchangeHelper.MarkNextChange();\n\t\t\t\t\t}\n\t\t\t\t\tlastOriginalIndex = originalIndex;\n\t\t\t\t\tchangeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex + 1);\n\t\t\t\t\tdiagonalRelative = (diagonal - 1) - diagonalReverseBase; //Setup for the next iteration\n\t\t\t\t}\n\n\t\t\t\tif (historyIndex >= 0) {\n\t\t\t\t\treversePoints = this.m_reverseHistory[historyIndex];\n\t\t\t\t\tdiagonalReverseBase = reversePoints[0]; //We stored this in the first spot\n\t\t\t\t\tdiagonalMin = 1;\n\t\t\t\t\tdiagonalMax = reversePoints.length - 1;\n\t\t\t\t}\n\t\t\t} while (--historyIndex >= -1);\n\n\t\t\t// There are cases where the reverse history will find diffs that\n\t\t\t// are correct, but not intuitive, so we need shift them.\n\t\t\treverseChanges = changeHelper.getChanges();\n\t\t}\n\n\t\treturn this.ConcatenateChanges(forwardChanges, reverseChanges);\n\t}\n\n\t/**\n\t * Given the range to compute the diff on, this method finds the point:\n\t * (midOriginal, midModified)\n\t * that exists in the middle of the LCS of the two sequences and\n\t * is the point at which the LCS problem may be broken down recursively.\n\t * This method will try to keep the LCS trace in memory. If the LCS recursion\n\t * point is calculated and the full trace is available in memory, then this method\n\t * will return the change list.\n\t * @param originalStart The start bound of the original sequence range\n\t * @param originalEnd The end bound of the original sequence range\n\t * @param modifiedStart The start bound of the modified sequence range\n\t * @param modifiedEnd The end bound of the modified sequence range\n\t * @param midOriginal The middle point of the original sequence range\n\t * @param midModified The middle point of the modified sequence range\n\t * @returns The diff changes, if available, otherwise null\n\t */\n\tprivate ComputeRecursionPoint(originalStart: number, originalEnd: number, modifiedStart: number, modifiedEnd: number, midOriginalArr: number[], midModifiedArr: number[], quitEarlyArr: boolean[]) {\n\t\tlet originalIndex = 0, modifiedIndex = 0;\n\t\tlet diagonalForwardStart = 0, diagonalForwardEnd = 0;\n\t\tlet diagonalReverseStart = 0, diagonalReverseEnd = 0;\n\n\t\t// To traverse the edit graph and produce the proper LCS, our actual\n\t\t// start position is just outside the given boundary\n\t\toriginalStart--;\n\t\tmodifiedStart--;\n\n\t\t// We set these up to make the compiler happy, but they will\n\t\t// be replaced before we return with the actual recursion point\n\t\tmidOriginalArr[0] = 0;\n\t\tmidModifiedArr[0] = 0;\n\n\t\t// Clear out the history\n\t\tthis.m_forwardHistory = [];\n\t\tthis.m_reverseHistory = [];\n\n\t\t// Each cell in the two arrays corresponds to a diagonal in the edit graph.\n\t\t// The integer value in the cell represents the originalIndex of the furthest\n\t\t// reaching point found so far that ends in that diagonal.\n\t\t// The modifiedIndex can be computed mathematically from the originalIndex and the diagonal number.\n\t\tconst maxDifferences = (originalEnd - originalStart) + (modifiedEnd - modifiedStart);\n\t\tconst numDiagonals = maxDifferences + 1;\n\t\tconst forwardPoints = new Int32Array(numDiagonals);\n\t\tconst reversePoints = new Int32Array(numDiagonals);\n\t\t// diagonalForwardBase: Index into forwardPoints of the diagonal which passes through (originalStart, modifiedStart)\n\t\t// diagonalReverseBase: Index into reversePoints of the diagonal which passes through (originalEnd, modifiedEnd)\n\t\tconst diagonalForwardBase = (modifiedEnd - modifiedStart);\n\t\tconst diagonalReverseBase = (originalEnd - originalStart);\n\t\t// diagonalForwardOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the\n\t\t//    diagonal number (relative to diagonalForwardBase)\n\t\t// diagonalReverseOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the\n\t\t//    diagonal number (relative to diagonalReverseBase)\n\t\tconst diagonalForwardOffset = (originalStart - modifiedStart);\n\t\tconst diagonalReverseOffset = (originalEnd - modifiedEnd);\n\n\t\t// delta: The difference between the end diagonal and the start diagonal. This is used to relate diagonal numbers\n\t\t//   relative to the start diagonal with diagonal numbers relative to the end diagonal.\n\t\t// The Even/Oddn-ness of this delta is important for determining when we should check for overlap\n\t\tconst delta = diagonalReverseBase - diagonalForwardBase;\n\t\tconst deltaIsEven = (delta % 2 === 0);\n\n\t\t// Here we set up the start and end points as the furthest points found so far\n\t\t// in both the forward and reverse directions, respectively\n\t\tforwardPoints[diagonalForwardBase] = originalStart;\n\t\treversePoints[diagonalReverseBase] = originalEnd;\n\n\t\t// Remember if we quit early, and thus need to do a best-effort result instead of a real result.\n\t\tquitEarlyArr[0] = false;\n\n\n\n\t\t// A couple of points:\n\t\t// --With this method, we iterate on the number of differences between the two sequences.\n\t\t//   The more differences there actually are, the longer this will take.\n\t\t// --Also, as the number of differences increases, we have to search on diagonals further\n\t\t//   away from the reference diagonal (which is diagonalForwardBase for forward, diagonalReverseBase for reverse).\n\t\t// --We extend on even diagonals (relative to the reference diagonal) only when numDifferences\n\t\t//   is even and odd diagonals only when numDifferences is odd.\n\t\tfor (let numDifferences = 1; numDifferences <= (maxDifferences / 2) + 1; numDifferences++) {\n\t\t\tlet furthestOriginalIndex = 0;\n\t\t\tlet furthestModifiedIndex = 0;\n\n\t\t\t// Run the algorithm in the forward direction\n\t\t\tdiagonalForwardStart = this.ClipDiagonalBound(diagonalForwardBase - numDifferences, numDifferences, diagonalForwardBase, numDiagonals);\n\t\t\tdiagonalForwardEnd = this.ClipDiagonalBound(diagonalForwardBase + numDifferences, numDifferences, diagonalForwardBase, numDiagonals);\n\t\t\tfor (let diagonal = diagonalForwardStart; diagonal <= diagonalForwardEnd; diagonal += 2) {\n\t\t\t\t// STEP 1: We extend the furthest reaching point in the present diagonal\n\t\t\t\t// by looking at the diagonals above and below and picking the one whose point\n\t\t\t\t// is further away from the start point (originalStart, modifiedStart)\n\t\t\t\tif (diagonal === diagonalForwardStart || (diagonal < diagonalForwardEnd && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) {\n\t\t\t\t\toriginalIndex = forwardPoints[diagonal + 1];\n\t\t\t\t} else {\n\t\t\t\t\toriginalIndex = forwardPoints[diagonal - 1] + 1;\n\t\t\t\t}\n\t\t\t\tmodifiedIndex = originalIndex - (diagonal - diagonalForwardBase) - diagonalForwardOffset;\n\n\t\t\t\t// Save the current originalIndex so we can test for false overlap in step 3\n\t\t\t\tconst tempOriginalIndex = originalIndex;\n\n\t\t\t\t// STEP 2: We can continue to extend the furthest reaching point in the present diagonal\n\t\t\t\t// so long as the elements are equal.\n\t\t\t\twhile (originalIndex < originalEnd && modifiedIndex < modifiedEnd && this.ElementsAreEqual(originalIndex + 1, modifiedIndex + 1)) {\n\t\t\t\t\toriginalIndex++;\n\t\t\t\t\tmodifiedIndex++;\n\t\t\t\t}\n\t\t\t\tforwardPoints[diagonal] = originalIndex;\n\n\t\t\t\tif (originalIndex + modifiedIndex > furthestOriginalIndex + furthestModifiedIndex) {\n\t\t\t\t\tfurthestOriginalIndex = originalIndex;\n\t\t\t\t\tfurthestModifiedIndex = modifiedIndex;\n\t\t\t\t}\n\n\t\t\t\t// STEP 3: If delta is odd (overlap first happens on forward when delta is odd)\n\t\t\t\t// and diagonal is in the range of reverse diagonals computed for numDifferences-1\n\t\t\t\t// (the previous iteration; we haven't computed reverse diagonals for numDifferences yet)\n\t\t\t\t// then check for overlap.\n\t\t\t\tif (!deltaIsEven && Math.abs(diagonal - diagonalReverseBase) <= (numDifferences - 1)) {\n\t\t\t\t\tif (originalIndex >= reversePoints[diagonal]) {\n\t\t\t\t\t\tmidOriginalArr[0] = originalIndex;\n\t\t\t\t\t\tmidModifiedArr[0] = modifiedIndex;\n\n\t\t\t\t\t\tif (tempOriginalIndex <= reversePoints[diagonal] && LocalConstants.MaxDifferencesHistory > 0 && numDifferences <= (LocalConstants.MaxDifferencesHistory + 1)) {\n\t\t\t\t\t\t\t// BINGO! We overlapped, and we have the full trace in memory!\n\t\t\t\t\t\t\treturn this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset,\n\t\t\t\t\t\t\t\tdiagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset,\n\t\t\t\t\t\t\t\tforwardPoints, reversePoints,\n\t\t\t\t\t\t\t\toriginalIndex, originalEnd, midOriginalArr,\n\t\t\t\t\t\t\t\tmodifiedIndex, modifiedEnd, midModifiedArr,\n\t\t\t\t\t\t\t\tdeltaIsEven, quitEarlyArr\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Either false overlap, or we didn't have enough memory for the full trace\n\t\t\t\t\t\t\t// Just return the recursion point\n\t\t\t\t\t\t\treturn null;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Check to see if we should be quitting early, before moving on to the next iteration.\n\t\t\tconst matchLengthOfLongest = ((furthestOriginalIndex - originalStart) + (furthestModifiedIndex - modifiedStart) - numDifferences) / 2;\n\n\t\t\tif (this.ContinueProcessingPredicate !== null && !this.ContinueProcessingPredicate(furthestOriginalIndex, matchLengthOfLongest)) {\n\t\t\t\t// We can't finish, so skip ahead to generating a result from what we have.\n\t\t\t\tquitEarlyArr[0] = true;\n\n\t\t\t\t// Use the furthest distance we got in the forward direction.\n\t\t\t\tmidOriginalArr[0] = furthestOriginalIndex;\n\t\t\t\tmidModifiedArr[0] = furthestModifiedIndex;\n\n\t\t\t\tif (matchLengthOfLongest > 0 && LocalConstants.MaxDifferencesHistory > 0 && numDifferences <= (LocalConstants.MaxDifferencesHistory + 1)) {\n\t\t\t\t\t// Enough of the history is in memory to walk it backwards\n\t\t\t\t\treturn this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset,\n\t\t\t\t\t\tdiagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset,\n\t\t\t\t\t\tforwardPoints, reversePoints,\n\t\t\t\t\t\toriginalIndex, originalEnd, midOriginalArr,\n\t\t\t\t\t\tmodifiedIndex, modifiedEnd, midModifiedArr,\n\t\t\t\t\t\tdeltaIsEven, quitEarlyArr\n\t\t\t\t\t);\n\t\t\t\t} else {\n\t\t\t\t\t// We didn't actually remember enough of the history.\n\n\t\t\t\t\t//Since we are quitting the diff early, we need to shift back the originalStart and modified start\n\t\t\t\t\t//back into the boundary limits since we decremented their value above beyond the boundary limit.\n\t\t\t\t\toriginalStart++;\n\t\t\t\t\tmodifiedStart++;\n\n\t\t\t\t\treturn [\n\t\t\t\t\t\tnew DiffChange(originalStart, originalEnd - originalStart + 1,\n\t\t\t\t\t\t\tmodifiedStart, modifiedEnd - modifiedStart + 1)\n\t\t\t\t\t];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Run the algorithm in the reverse direction\n\t\t\tdiagonalReverseStart = this.ClipDiagonalBound(diagonalReverseBase - numDifferences, numDifferences, diagonalReverseBase, numDiagonals);\n\t\t\tdiagonalReverseEnd = this.ClipDiagonalBound(diagonalReverseBase + numDifferences, numDifferences, diagonalReverseBase, numDiagonals);\n\t\t\tfor (let diagonal = diagonalReverseStart; diagonal <= diagonalReverseEnd; diagonal += 2) {\n\t\t\t\t// STEP 1: We extend the furthest reaching point in the present diagonal\n\t\t\t\t// by looking at the diagonals above and below and picking the one whose point\n\t\t\t\t// is further away from the start point (originalEnd, modifiedEnd)\n\t\t\t\tif (diagonal === diagonalReverseStart || (diagonal < diagonalReverseEnd && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) {\n\t\t\t\t\toriginalIndex = reversePoints[diagonal + 1] - 1;\n\t\t\t\t} else {\n\t\t\t\t\toriginalIndex = reversePoints[diagonal - 1];\n\t\t\t\t}\n\t\t\t\tmodifiedIndex = originalIndex - (diagonal - diagonalReverseBase) - diagonalReverseOffset;\n\n\t\t\t\t// Save the current originalIndex so we can test for false overlap\n\t\t\t\tconst tempOriginalIndex = originalIndex;\n\n\t\t\t\t// STEP 2: We can continue to extend the furthest reaching point in the present diagonal\n\t\t\t\t// as long as the elements are equal.\n\t\t\t\twhile (originalIndex > originalStart && modifiedIndex > modifiedStart && this.ElementsAreEqual(originalIndex, modifiedIndex)) {\n\t\t\t\t\toriginalIndex--;\n\t\t\t\t\tmodifiedIndex--;\n\t\t\t\t}\n\t\t\t\treversePoints[diagonal] = originalIndex;\n\n\t\t\t\t// STEP 4: If delta is even (overlap first happens on reverse when delta is even)\n\t\t\t\t// and diagonal is in the range of forward diagonals computed for numDifferences\n\t\t\t\t// then check for overlap.\n\t\t\t\tif (deltaIsEven && Math.abs(diagonal - diagonalForwardBase) <= numDifferences) {\n\t\t\t\t\tif (originalIndex <= forwardPoints[diagonal]) {\n\t\t\t\t\t\tmidOriginalArr[0] = originalIndex;\n\t\t\t\t\t\tmidModifiedArr[0] = modifiedIndex;\n\n\t\t\t\t\t\tif (tempOriginalIndex >= forwardPoints[diagonal] && LocalConstants.MaxDifferencesHistory > 0 && numDifferences <= (LocalConstants.MaxDifferencesHistory + 1)) {\n\t\t\t\t\t\t\t// BINGO! We overlapped, and we have the full trace in memory!\n\t\t\t\t\t\t\treturn this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset,\n\t\t\t\t\t\t\t\tdiagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset,\n\t\t\t\t\t\t\t\tforwardPoints, reversePoints,\n\t\t\t\t\t\t\t\toriginalIndex, originalEnd, midOriginalArr,\n\t\t\t\t\t\t\t\tmodifiedIndex, modifiedEnd, midModifiedArr,\n\t\t\t\t\t\t\t\tdeltaIsEven, quitEarlyArr\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Either false overlap, or we didn't have enough memory for the full trace\n\t\t\t\t\t\t\t// Just return the recursion point\n\t\t\t\t\t\t\treturn null;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Save current vectors to history before the next iteration\n\t\t\tif (numDifferences <= LocalConstants.MaxDifferencesHistory) {\n\t\t\t\t// We are allocating space for one extra int, which we fill with\n\t\t\t\t// the index of the diagonal base index\n\t\t\t\tlet temp = new Int32Array(diagonalForwardEnd - diagonalForwardStart + 2);\n\t\t\t\ttemp[0] = diagonalForwardBase - diagonalForwardStart + 1;\n\t\t\t\tMyArray.Copy2(forwardPoints, diagonalForwardStart, temp, 1, diagonalForwardEnd - diagonalForwardStart + 1);\n\t\t\t\tthis.m_forwardHistory.push(temp);\n\n\t\t\t\ttemp = new Int32Array(diagonalReverseEnd - diagonalReverseStart + 2);\n\t\t\t\ttemp[0] = diagonalReverseBase - diagonalReverseStart + 1;\n\t\t\t\tMyArray.Copy2(reversePoints, diagonalReverseStart, temp, 1, diagonalReverseEnd - diagonalReverseStart + 1);\n\t\t\t\tthis.m_reverseHistory.push(temp);\n\t\t\t}\n\n\t\t}\n\n\t\t// If we got here, then we have the full trace in history. We just have to convert it to a change list\n\t\t// NOTE: This part is a bit messy\n\t\treturn this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset,\n\t\t\tdiagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset,\n\t\t\tforwardPoints, reversePoints,\n\t\t\toriginalIndex, originalEnd, midOriginalArr,\n\t\t\tmodifiedIndex, modifiedEnd, midModifiedArr,\n\t\t\tdeltaIsEven, quitEarlyArr\n\t\t);\n\t}\n\n\t/**\n\t * Shifts the given changes to provide a more intuitive diff.\n\t * While the first element in a diff matches the first element after the diff,\n\t * we shift the diff down.\n\t *\n\t * @param changes The list of changes to shift\n\t * @returns The shifted changes\n\t */\n\tprivate PrettifyChanges(changes: DiffChange[]): DiffChange[] {\n\n\t\t// Shift all the changes down first\n\t\tfor (let i = 0; i < changes.length; i++) {\n\t\t\tconst change = changes[i];\n\t\t\tconst originalStop = (i < changes.length - 1) ? changes[i + 1].originalStart : this._originalElementsOrHash.length;\n\t\t\tconst modifiedStop = (i < changes.length - 1) ? changes[i + 1].modifiedStart : this._modifiedElementsOrHash.length;\n\t\t\tconst checkOriginal = change.originalLength > 0;\n\t\t\tconst checkModified = change.modifiedLength > 0;\n\n\t\t\twhile (\n\t\t\t\tchange.originalStart + change.originalLength < originalStop\n\t\t\t\t&& change.modifiedStart + change.modifiedLength < modifiedStop\n\t\t\t\t&& (!checkOriginal || this.OriginalElementsAreEqual(change.originalStart, change.originalStart + change.originalLength))\n\t\t\t\t&& (!checkModified || this.ModifiedElementsAreEqual(change.modifiedStart, change.modifiedStart + change.modifiedLength))\n\t\t\t) {\n\t\t\t\tconst startStrictEqual = this.ElementsAreStrictEqual(change.originalStart, change.modifiedStart);\n\t\t\t\tconst endStrictEqual = this.ElementsAreStrictEqual(change.originalStart + change.originalLength, change.modifiedStart + change.modifiedLength);\n\t\t\t\tif (endStrictEqual && !startStrictEqual) {\n\t\t\t\t\t// moving the change down would create an equal change, but the elements are not strict equal\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tchange.originalStart++;\n\t\t\t\tchange.modifiedStart++;\n\t\t\t}\n\n\t\t\tconst mergedChangeArr: Array<DiffChange | null> = [null];\n\t\t\tif (i < changes.length - 1 && this.ChangesOverlap(changes[i], changes[i + 1], mergedChangeArr)) {\n\t\t\t\tchanges[i] = mergedChangeArr[0]!;\n\t\t\t\tchanges.splice(i + 1, 1);\n\t\t\t\ti--;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\t// Shift changes back up until we hit empty or whitespace-only lines\n\t\tfor (let i = changes.length - 1; i >= 0; i--) {\n\t\t\tconst change = changes[i];\n\n\t\t\tlet originalStop = 0;\n\t\t\tlet modifiedStop = 0;\n\t\t\tif (i > 0) {\n\t\t\t\tconst prevChange = changes[i - 1];\n\t\t\t\toriginalStop = prevChange.originalStart + prevChange.originalLength;\n\t\t\t\tmodifiedStop = prevChange.modifiedStart + prevChange.modifiedLength;\n\t\t\t}\n\n\t\t\tconst checkOriginal = change.originalLength > 0;\n\t\t\tconst checkModified = change.modifiedLength > 0;\n\n\t\t\tlet bestDelta = 0;\n\t\t\tlet bestScore = this._boundaryScore(change.originalStart, change.originalLength, change.modifiedStart, change.modifiedLength);\n\n\t\t\tfor (let delta = 1; ; delta++) {\n\t\t\t\tconst originalStart = change.originalStart - delta;\n\t\t\t\tconst modifiedStart = change.modifiedStart - delta;\n\n\t\t\t\tif (originalStart < originalStop || modifiedStart < modifiedStop) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (checkOriginal && !this.OriginalElementsAreEqual(originalStart, originalStart + change.originalLength)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (checkModified && !this.ModifiedElementsAreEqual(modifiedStart, modifiedStart + change.modifiedLength)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tconst touchingPreviousChange = (originalStart === originalStop && modifiedStart === modifiedStop);\n\t\t\t\tconst score = (\n\t\t\t\t\t(touchingPreviousChange ? 5 : 0)\n\t\t\t\t\t+ this._boundaryScore(originalStart, change.originalLength, modifiedStart, change.modifiedLength)\n\t\t\t\t);\n\n\t\t\t\tif (score > bestScore) {\n\t\t\t\t\tbestScore = score;\n\t\t\t\t\tbestDelta = delta;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tchange.originalStart -= bestDelta;\n\t\t\tchange.modifiedStart -= bestDelta;\n\n\t\t\tconst mergedChangeArr: Array<DiffChange | null> = [null];\n\t\t\tif (i > 0 && this.ChangesOverlap(changes[i - 1], changes[i], mergedChangeArr)) {\n\t\t\t\tchanges[i - 1] = mergedChangeArr[0]!;\n\t\t\t\tchanges.splice(i, 1);\n\t\t\t\ti++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\t// There could be multiple longest common substrings.\n\t\t// Give preference to the ones containing longer lines\n\t\tif (this._hasStrings) {\n\t\t\tfor (let i = 1, len = changes.length; i < len; i++) {\n\t\t\t\tconst aChange = changes[i - 1];\n\t\t\t\tconst bChange = changes[i];\n\t\t\t\tconst matchedLength = bChange.originalStart - aChange.originalStart - aChange.originalLength;\n\t\t\t\tconst aOriginalStart = aChange.originalStart;\n\t\t\t\tconst bOriginalEnd = bChange.originalStart + bChange.originalLength;\n\t\t\t\tconst abOriginalLength = bOriginalEnd - aOriginalStart;\n\t\t\t\tconst aModifiedStart = aChange.modifiedStart;\n\t\t\t\tconst bModifiedEnd = bChange.modifiedStart + bChange.modifiedLength;\n\t\t\t\tconst abModifiedLength = bModifiedEnd - aModifiedStart;\n\t\t\t\t// Avoid wasting a lot of time with these searches\n\t\t\t\tif (matchedLength < 5 && abOriginalLength < 20 && abModifiedLength < 20) {\n\t\t\t\t\tconst t = this._findBetterContiguousSequence(\n\t\t\t\t\t\taOriginalStart, abOriginalLength,\n\t\t\t\t\t\taModifiedStart, abModifiedLength,\n\t\t\t\t\t\tmatchedLength\n\t\t\t\t\t);\n\t\t\t\t\tif (t) {\n\t\t\t\t\t\tconst [originalMatchStart, modifiedMatchStart] = t;\n\t\t\t\t\t\tif (originalMatchStart !== aChange.originalStart + aChange.originalLength || modifiedMatchStart !== aChange.modifiedStart + aChange.modifiedLength) {\n\t\t\t\t\t\t\t// switch to another sequence that has a better score\n\t\t\t\t\t\t\taChange.originalLength = originalMatchStart - aChange.originalStart;\n\t\t\t\t\t\t\taChange.modifiedLength = modifiedMatchStart - aChange.modifiedStart;\n\t\t\t\t\t\t\tbChange.originalStart = originalMatchStart + matchedLength;\n\t\t\t\t\t\t\tbChange.modifiedStart = modifiedMatchStart + matchedLength;\n\t\t\t\t\t\t\tbChange.originalLength = bOriginalEnd - bChange.originalStart;\n\t\t\t\t\t\t\tbChange.modifiedLength = bModifiedEnd - bChange.modifiedStart;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn changes;\n\t}\n\n\tprivate _findBetterContiguousSequence(originalStart: number, originalLength: number, modifiedStart: number, modifiedLength: number, desiredLength: number): [number, number] | null {\n\t\tif (originalLength < desiredLength || modifiedLength < desiredLength) {\n\t\t\treturn null;\n\t\t}\n\t\tconst originalMax = originalStart + originalLength - desiredLength + 1;\n\t\tconst modifiedMax = modifiedStart + modifiedLength - desiredLength + 1;\n\t\tlet bestScore = 0;\n\t\tlet bestOriginalStart = 0;\n\t\tlet bestModifiedStart = 0;\n\t\tfor (let i = originalStart; i < originalMax; i++) {\n\t\t\tfor (let j = modifiedStart; j < modifiedMax; j++) {\n\t\t\t\tconst score = this._contiguousSequenceScore(i, j, desiredLength);\n\t\t\t\tif (score > 0 && score > bestScore) {\n\t\t\t\t\tbestScore = score;\n\t\t\t\t\tbestOriginalStart = i;\n\t\t\t\t\tbestModifiedStart = j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (bestScore > 0) {\n\t\t\treturn [bestOriginalStart, bestModifiedStart];\n\t\t}\n\t\treturn null;\n\t}\n\n\tprivate _contiguousSequenceScore(originalStart: number, modifiedStart: number, length: number): number {\n\t\tlet score = 0;\n\t\tfor (let l = 0; l < length; l++) {\n\t\t\tif (!this.ElementsAreEqual(originalStart + l, modifiedStart + l)) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tscore += this._originalStringElements[originalStart + l].length;\n\t\t}\n\t\treturn score;\n\t}\n\n\tprivate _OriginalIsBoundary(index: number): boolean {\n\t\tif (index <= 0 || index >= this._originalElementsOrHash.length - 1) {\n\t\t\treturn true;\n\t\t}\n\t\treturn (this._hasStrings && /^\\s*$/.test(this._originalStringElements[index]));\n\t}\n\n\tprivate _OriginalRegionIsBoundary(originalStart: number, originalLength: number): boolean {\n\t\tif (this._OriginalIsBoundary(originalStart) || this._OriginalIsBoundary(originalStart - 1)) {\n\t\t\treturn true;\n\t\t}\n\t\tif (originalLength > 0) {\n\t\t\tconst originalEnd = originalStart + originalLength;\n\t\t\tif (this._OriginalIsBoundary(originalEnd - 1) || this._OriginalIsBoundary(originalEnd)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\tprivate _ModifiedIsBoundary(index: number): boolean {\n\t\tif (index <= 0 || index >= this._modifiedElementsOrHash.length - 1) {\n\t\t\treturn true;\n\t\t}\n\t\treturn (this._hasStrings && /^\\s*$/.test(this._modifiedStringElements[index]));\n\t}\n\n\tprivate _ModifiedRegionIsBoundary(modifiedStart: number, modifiedLength: number): boolean {\n\t\tif (this._ModifiedIsBoundary(modifiedStart) || this._ModifiedIsBoundary(modifiedStart - 1)) {\n\t\t\treturn true;\n\t\t}\n\t\tif (modifiedLength > 0) {\n\t\t\tconst modifiedEnd = modifiedStart + modifiedLength;\n\t\t\tif (this._ModifiedIsBoundary(modifiedEnd - 1) || this._ModifiedIsBoundary(modifiedEnd)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\tprivate _boundaryScore(originalStart: number, originalLength: number, modifiedStart: number, modifiedLength: number): number {\n\t\tconst originalScore = (this._OriginalRegionIsBoundary(originalStart, originalLength) ? 1 : 0);\n\t\tconst modifiedScore = (this._ModifiedRegionIsBoundary(modifiedStart, modifiedLength) ? 1 : 0);\n\t\treturn (originalScore + modifiedScore);\n\t}\n\n\t/**\n\t * Concatenates the two input DiffChange lists and returns the resulting\n\t * list.\n\t * @param The left changes\n\t * @param The right changes\n\t * @returns The concatenated list\n\t */\n\tprivate ConcatenateChanges(left: DiffChange[], right: DiffChange[]): DiffChange[] {\n\t\tconst mergedChangeArr: DiffChange[] = [];\n\n\t\tif (left.length === 0 || right.length === 0) {\n\t\t\treturn (right.length > 0) ? right : left;\n\t\t} else if (this.ChangesOverlap(left[left.length - 1], right[0], mergedChangeArr)) {\n\t\t\t// Since we break the problem down recursively, it is possible that we\n\t\t\t// might recurse in the middle of a change thereby splitting it into\n\t\t\t// two changes. Here in the combining stage, we detect and fuse those\n\t\t\t// changes back together\n\t\t\tconst result = new Array<DiffChange>(left.length + right.length - 1);\n\t\t\tMyArray.Copy(left, 0, result, 0, left.length - 1);\n\t\t\tresult[left.length - 1] = mergedChangeArr[0];\n\t\t\tMyArray.Copy(right, 1, result, left.length, right.length - 1);\n\n\t\t\treturn result;\n\t\t} else {\n\t\t\tconst result = new Array<DiffChange>(left.length + right.length);\n\t\t\tMyArray.Copy(left, 0, result, 0, left.length);\n\t\t\tMyArray.Copy(right, 0, result, left.length, right.length);\n\n\t\t\treturn result;\n\t\t}\n\t}\n\n\t/**\n\t * Returns true if the two changes overlap and can be merged into a single\n\t * change\n\t * @param left The left change\n\t * @param right The right change\n\t * @param mergedChange The merged change if the two overlap, null otherwise\n\t * @returns True if the two changes overlap\n\t */\n\tprivate ChangesOverlap(left: DiffChange, right: DiffChange, mergedChangeArr: Array<DiffChange | null>): boolean {\n\t\tDebug.Assert(left.originalStart <= right.originalStart, 'Left change is not less than or equal to right change');\n\t\tDebug.Assert(left.modifiedStart <= right.modifiedStart, 'Left change is not less than or equal to right change');\n\n\t\tif (left.originalStart + left.originalLength >= right.originalStart || left.modifiedStart + left.modifiedLength >= right.modifiedStart) {\n\t\t\tconst originalStart = left.originalStart;\n\t\t\tlet originalLength = left.originalLength;\n\t\t\tconst modifiedStart = left.modifiedStart;\n\t\t\tlet modifiedLength = left.modifiedLength;\n\n\t\t\tif (left.originalStart + left.originalLength >= right.originalStart) {\n\t\t\t\toriginalLength = right.originalStart + right.originalLength - left.originalStart;\n\t\t\t}\n\t\t\tif (left.modifiedStart + left.modifiedLength >= right.modifiedStart) {\n\t\t\t\tmodifiedLength = right.modifiedStart + right.modifiedLength - left.modifiedStart;\n\t\t\t}\n\n\t\t\tmergedChangeArr[0] = new DiffChange(originalStart, originalLength, modifiedStart, modifiedLength);\n\t\t\treturn true;\n\t\t} else {\n\t\t\tmergedChangeArr[0] = null;\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/**\n\t * Helper method used to clip a diagonal index to the range of valid\n\t * diagonals. This also decides whether or not the diagonal index,\n\t * if it exceeds the boundary, should be clipped to the boundary or clipped\n\t * one inside the boundary depending on the Even/Odd status of the boundary\n\t * and numDifferences.\n\t * @param diagonal The index of the diagonal to clip.\n\t * @param numDifferences The current number of differences being iterated upon.\n\t * @param diagonalBaseIndex The base reference diagonal.\n\t * @param numDiagonals The total number of diagonals.\n\t * @returns The clipped diagonal index.\n\t */\n\tprivate ClipDiagonalBound(diagonal: number, numDifferences: number, diagonalBaseIndex: number, numDiagonals: number): number {\n\t\tif (diagonal >= 0 && diagonal < numDiagonals) {\n\t\t\t// Nothing to clip, its in range\n\t\t\treturn diagonal;\n\t\t}\n\n\t\t// diagonalsBelow: The number of diagonals below the reference diagonal\n\t\t// diagonalsAbove: The number of diagonals above the reference diagonal\n\t\tconst diagonalsBelow = diagonalBaseIndex;\n\t\tconst diagonalsAbove = numDiagonals - diagonalBaseIndex - 1;\n\t\tconst diffEven = (numDifferences % 2 === 0);\n\n\t\tif (diagonal < 0) {\n\t\t\tconst lowerBoundEven = (diagonalsBelow % 2 === 0);\n\t\t\treturn (diffEven === lowerBoundEven) ? 0 : 1;\n\t\t} else {\n\t\t\tconst upperBoundEven = (diagonalsAbove % 2 === 0);\n\t\t\treturn (diffEven === upperBoundEven) ? numDiagonals - 1 : numDiagonals - 2;\n\t\t}\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n/**\n * Can be passed into the Delayed to defer using a microtask\n * */\nexport const MicrotaskDelay = Symbol('MicrotaskDelay');\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n/**\n * @returns whether the provided parameter is a JavaScript String or not.\n */\nexport function isString(str: unknown): str is string {\n\treturn (typeof str === 'string');\n}\n\n/**\n * @returns whether the provided parameter is of type `object` but **not**\n *\t`null`, an `array`, a `regexp`, nor a `date`.\n */\nexport function isObject(obj: unknown): obj is Object {\n\t// The method can't do a type cast since there are type (like strings) which\n\t// are subclasses of any put not positvely matched by the function. Hence type\n\t// narrowing results in wrong results.\n\treturn typeof obj === 'object'\n\t\t&& obj !== null\n\t\t&& !Array.isArray(obj)\n\t\t&& !(obj instanceof RegExp)\n\t\t&& !(obj instanceof Date);\n}\n\n/**\n * @returns whether the provided parameter is of type `Buffer` or Uint8Array dervived type\n */\nexport function isTypedArray(obj: unknown): obj is Object {\n\tconst TypedArray = Object.getPrototypeOf(Uint8Array);\n\treturn typeof obj === 'object'\n\t\t&& obj instanceof TypedArray;\n}\n\n/**\n * In **contrast** to just checking `typeof` this will return `false` for `NaN`.\n * @returns whether the provided parameter is a JavaScript Number or not.\n */\nexport function isNumber(obj: unknown): obj is number {\n\treturn (typeof obj === 'number' && !isNaN(obj));\n}\n\n/**\n * @returns whether the provided parameter is an Iterable, casting to the given generic\n */\nexport function isIterable<T>(obj: unknown): obj is Iterable<T> {\n\treturn !!obj && typeof (obj as any)[Symbol.iterator] === 'function';\n}\n\n/**\n * @returns whether the provided parameter is a JavaScript Boolean or not.\n */\nexport function isBoolean(obj: unknown): obj is boolean {\n\treturn (obj === true || obj === false);\n}\n\n/**\n * @returns whether the provided parameter is undefined.\n */\nexport function isUndefined(obj: unknown): obj is undefined {\n\treturn (typeof obj === 'undefined');\n}\n\n/**\n * @returns whether the provided parameter is defined.\n */\nexport function isDefined<T>(arg: T | null | undefined): arg is T {\n\treturn !isUndefinedOrNull(arg);\n}\n\n/**\n * @returns whether the provided parameter is undefined or null.\n */\nexport function isUndefinedOrNull(obj: unknown): obj is undefined | null {\n\treturn (isUndefined(obj) || obj === null);\n}\n\n\nexport function assertType(condition: unknown, type?: string): asserts condition {\n\tif (!condition) {\n\t\tthrow new Error(type ? `Unexpected type, expected '${type}'` : 'Unexpected type');\n\t}\n}\n\n/**\n * Asserts that the argument passed in is neither undefined nor null.\n */\nexport function assertIsDefined<T>(arg: T | null | undefined): T {\n\tif (isUndefinedOrNull(arg)) {\n\t\tthrow new Error('Assertion Failed: argument is undefined or null');\n\t}\n\n\treturn arg;\n}\n\n/**\n * @returns whether the provided parameter is a JavaScript Function or not.\n */\nexport function isFunction(obj: unknown): obj is Function {\n\treturn (typeof obj === 'function');\n}\n\nexport type TypeConstraint = string | Function;\n\nexport function validateConstraints(args: unknown[], constraints: Array<TypeConstraint | undefined>): void {\n\tconst len = Math.min(args.length, constraints.length);\n\tfor (let i = 0; i < len; i++) {\n\t\tvalidateConstraint(args[i], constraints[i]);\n\t}\n}\n\nexport function validateConstraint(arg: unknown, constraint: TypeConstraint | undefined): void {\n\n\tif (isString(constraint)) {\n\t\tif (typeof arg !== constraint) {\n\t\t\tthrow new Error(`argument does not match constraint: typeof ${constraint}`);\n\t\t}\n\t} else if (isFunction(constraint)) {\n\t\ttry {\n\t\t\tif (arg instanceof constraint) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t} catch {\n\t\t\t// ignore\n\t\t}\n\t\tif (!isUndefinedOrNull(arg) && (arg as any).constructor === constraint) {\n\t\t\treturn;\n\t\t}\n\t\tif (constraint.length === 1 && constraint.call(undefined, arg) === true) {\n\t\t\treturn;\n\t\t}\n\t\tthrow new Error(`argument does not match one of these constraints: arg instanceof constraint, arg.constructor === constraint, nor constraint(arg) === true`);\n\t}\n}\n\n/**\n * Only picks the non-optional properties of a type.\n */\nexport type OmitOptional<T> = { [K in keyof T as T[K] extends Required<T>[K] ? K : never]: T[K] };\n\n/**\n * A type that removed readonly-less from all properties of `T`\n */\nexport type Mutable<T> = {\n\t-readonly [P in keyof T]: T[P]\n};\n\n/**\n * Represents a type that is a partial version of a given type `T`, except a subset.\n */\nexport type PartialExcept<T, K extends keyof T> = Partial<Omit<T, K>> & Pick<T, K>;\n","/*---------------------------------------------------------------------------------------------\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 { ThemeIcon } from 'vs/base/common/themables';\nimport { isString } from 'vs/base/common/types';\n\n\nconst _codiconFontCharacters: { [id: string]: number } = Object.create(null);\n\nexport function register(id: string, fontCharacter: number | string): ThemeIcon {\n\tif (isString(fontCharacter)) {\n\t\tconst val = _codiconFontCharacters[fontCharacter];\n\t\tif (val === undefined) {\n\t\t\tthrow new Error(`${id} references an unknown codicon: ${fontCharacter}`);\n\t\t}\n\t\tfontCharacter = val;\n\t}\n\t_codiconFontCharacters[id] = fontCharacter;\n\treturn { id };\n}\n\n/**\n * Only to be used by the iconRegistry.\n */\nexport function getCodiconFontCharacters(): { [id: string]: number } {\n\treturn _codiconFontCharacters;\n}\n","/*---------------------------------------------------------------------------------------------\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 { register } from 'vs/base/common/codiconsUtil';\n\n\n// This file is automatically generated by (microsoft/vscode-codicons)/scripts/export-to-ts.js\n// Please don't edit it, as your changes will be overwritten.\n// Instead, add mappings to codiconsDerived in codicons.ts.\nexport const codiconsLibrary = {\n\tadd: register('add', 0xea60),\n\tplus: register('plus', 0xea60),\n\tgistNew: register('gist-new', 0xea60),\n\trepoCreate: register('repo-create', 0xea60),\n\tlightbulb: register('lightbulb', 0xea61),\n\tlightBulb: register('light-bulb', 0xea61),\n\trepo: register('repo', 0xea62),\n\trepoDelete: register('repo-delete', 0xea62),\n\tgistFork: register('gist-fork', 0xea63),\n\trepoForked: register('repo-forked', 0xea63),\n\tgitPullRequest: register('git-pull-request', 0xea64),\n\tgitPullRequestAbandoned: register('git-pull-request-abandoned', 0xea64),\n\trecordKeys: register('record-keys', 0xea65),\n\tkeyboard: register('keyboard', 0xea65),\n\ttag: register('tag', 0xea66),\n\tgitPullRequestLabel: register('git-pull-request-label', 0xea66),\n\ttagAdd: register('tag-add', 0xea66),\n\ttagRemove: register('tag-remove', 0xea66),\n\tperson: register('person', 0xea67),\n\tpersonFollow: register('person-follow', 0xea67),\n\tpersonOutline: register('person-outline', 0xea67),\n\tpersonFilled: register('person-filled', 0xea67),\n\tgitBranch: register('git-branch', 0xea68),\n\tgitBranchCreate: register('git-branch-create', 0xea68),\n\tgitBranchDelete: register('git-branch-delete', 0xea68),\n\tsourceControl: register('source-control', 0xea68),\n\tmirror: register('mirror', 0xea69),\n\tmirrorPublic: register('mirror-public', 0xea69),\n\tstar: register('star', 0xea6a),\n\tstarAdd: register('star-add', 0xea6a),\n\tstarDelete: register('star-delete', 0xea6a),\n\tstarEmpty: register('star-empty', 0xea6a),\n\tcomment: register('comment', 0xea6b),\n\tcommentAdd: register('comment-add', 0xea6b),\n\talert: register('alert', 0xea6c),\n\twarning: register('warning', 0xea6c),\n\tsearch: register('search', 0xea6d),\n\tsearchSave: register('search-save', 0xea6d),\n\tlogOut: register('log-out', 0xea6e),\n\tsignOut: register('sign-out', 0xea6e),\n\tlogIn: register('log-in', 0xea6f),\n\tsignIn: register('sign-in', 0xea6f),\n\teye: register('eye', 0xea70),\n\teyeUnwatch: register('eye-unwatch', 0xea70),\n\teyeWatch: register('eye-watch', 0xea70),\n\tcircleFilled: register('circle-filled', 0xea71),\n\tprimitiveDot: register('primitive-dot', 0xea71),\n\tcloseDirty: register('close-dirty', 0xea71),\n\tdebugBreakpoint: register('debug-breakpoint', 0xea71),\n\tdebugBreakpointDisabled: register('debug-breakpoint-disabled', 0xea71),\n\tdebugHint: register('debug-hint', 0xea71),\n\tterminalDecorationSuccess: register('terminal-decoration-success', 0xea71),\n\tprimitiveSquare: register('primitive-square', 0xea72),\n\tedit: register('edit', 0xea73),\n\tpencil: register('pencil', 0xea73),\n\tinfo: register('info', 0xea74),\n\tissueOpened: register('issue-opened', 0xea74),\n\tgistPrivate: register('gist-private', 0xea75),\n\tgitForkPrivate: register('git-fork-private', 0xea75),\n\tlock: register('lock', 0xea75),\n\tmirrorPrivate: register('mirror-private', 0xea75),\n\tclose: register('close', 0xea76),\n\tremoveClose: register('remove-close', 0xea76),\n\tx: register('x', 0xea76),\n\trepoSync: register('repo-sync', 0xea77),\n\tsync: register('sync', 0xea77),\n\tclone: register('clone', 0xea78),\n\tdesktopDownload: register('desktop-download', 0xea78),\n\tbeaker: register('beaker', 0xea79),\n\tmicroscope: register('microscope', 0xea79),\n\tvm: register('vm', 0xea7a),\n\tdeviceDesktop: register('device-desktop', 0xea7a),\n\tfile: register('file', 0xea7b),\n\tfileText: register('file-text', 0xea7b),\n\tmore: register('more', 0xea7c),\n\tellipsis: register('ellipsis', 0xea7c),\n\tkebabHorizontal: register('kebab-horizontal', 0xea7c),\n\tmailReply: register('mail-reply', 0xea7d),\n\treply: register('reply', 0xea7d),\n\torganization: register('organization', 0xea7e),\n\torganizationFilled: register('organization-filled', 0xea7e),\n\torganizationOutline: register('organization-outline', 0xea7e),\n\tnewFile: register('new-file', 0xea7f),\n\tfileAdd: register('file-add', 0xea7f),\n\tnewFolder: register('new-folder', 0xea80),\n\tfileDirectoryCreate: register('file-directory-create', 0xea80),\n\ttrash: register('trash', 0xea81),\n\ttrashcan: register('trashcan', 0xea81),\n\thistory: register('history', 0xea82),\n\tclock: register('clock', 0xea82),\n\tfolder: register('folder', 0xea83),\n\tfileDirectory: register('file-directory', 0xea83),\n\tsymbolFolder: register('symbol-folder', 0xea83),\n\tlogoGithub: register('logo-github', 0xea84),\n\tmarkGithub: register('mark-github', 0xea84),\n\tgithub: register('github', 0xea84),\n\tterminal: register('terminal', 0xea85),\n\tconsole: register('console', 0xea85),\n\trepl: register('repl', 0xea85),\n\tzap: register('zap', 0xea86),\n\tsymbolEvent: register('symbol-event', 0xea86),\n\terror: register('error', 0xea87),\n\tstop: register('stop', 0xea87),\n\tvariable: register('variable', 0xea88),\n\tsymbolVariable: register('symbol-variable', 0xea88),\n\tarray: register('array', 0xea8a),\n\tsymbolArray: register('symbol-array', 0xea8a),\n\tsymbolModule: register('symbol-module', 0xea8b),\n\tsymbolPackage: register('symbol-package', 0xea8b),\n\tsymbolNamespace: register('symbol-namespace', 0xea8b),\n\tsymbolObject: register('symbol-object', 0xea8b),\n\tsymbolMethod: register('symbol-method', 0xea8c),\n\tsymbolFunction: register('symbol-function', 0xea8c),\n\tsymbolConstructor: register('symbol-constructor', 0xea8c),\n\tsymbolBoolean: register('symbol-boolean', 0xea8f),\n\tsymbolNull: register('symbol-null', 0xea8f),\n\tsymbolNumeric: register('symbol-numeric', 0xea90),\n\tsymbolNumber: register('symbol-number', 0xea90),\n\tsymbolStructure: register('symbol-structure', 0xea91),\n\tsymbolStruct: register('symbol-struct', 0xea91),\n\tsymbolParameter: register('symbol-parameter', 0xea92),\n\tsymbolTypeParameter: register('symbol-type-parameter', 0xea92),\n\tsymbolKey: register('symbol-key', 0xea93),\n\tsymbolText: register('symbol-text', 0xea93),\n\tsymbolReference: register('symbol-reference', 0xea94),\n\tgoToFile: register('go-to-file', 0xea94),\n\tsymbolEnum: register('symbol-enum', 0xea95),\n\tsymbolValue: register('symbol-value', 0xea95),\n\tsymbolRuler: register('symbol-ruler', 0xea96),\n\tsymbolUnit: register('symbol-unit', 0xea96),\n\tactivateBreakpoints: register('activate-breakpoints', 0xea97),\n\tarchive: register('archive', 0xea98),\n\tarrowBoth: register('arrow-both', 0xea99),\n\tarrowDown: register('arrow-down', 0xea9a),\n\tarrowLeft: register('arrow-left', 0xea9b),\n\tarrowRight: register('arrow-right', 0xea9c),\n\tarrowSmallDown: register('arrow-small-down', 0xea9d),\n\tarrowSmallLeft: register('arrow-small-left', 0xea9e),\n\tarrowSmallRight: register('arrow-small-right', 0xea9f),\n\tarrowSmallUp: register('arrow-small-up', 0xeaa0),\n\tarrowUp: register('arrow-up', 0xeaa1),\n\tbell: register('bell', 0xeaa2),\n\tbold: register('bold', 0xeaa3),\n\tbook: register('book', 0xeaa4),\n\tbookmark: register('bookmark', 0xeaa5),\n\tdebugBreakpointConditionalUnverified: register('debug-breakpoint-conditional-unverified', 0xeaa6),\n\tdebugBreakpointConditional: register('debug-breakpoint-conditional', 0xeaa7),\n\tdebugBreakpointConditionalDisabled: register('debug-breakpoint-conditional-disabled', 0xeaa7),\n\tdebugBreakpointDataUnverified: register('debug-breakpoint-data-unverified', 0xeaa8),\n\tdebugBreakpointData: register('debug-breakpoint-data', 0xeaa9),\n\tdebugBreakpointDataDisabled: register('debug-breakpoint-data-disabled', 0xeaa9),\n\tdebugBreakpointLogUnverified: register('debug-breakpoint-log-unverified', 0xeaaa),\n\tdebugBreakpointLog: register('debug-breakpoint-log', 0xeaab),\n\tdebugBreakpointLogDisabled: register('debug-breakpoint-log-disabled', 0xeaab),\n\tbriefcase: register('briefcase', 0xeaac),\n\tbroadcast: register('broadcast', 0xeaad),\n\tbrowser: register('browser', 0xeaae),\n\tbug: register('bug', 0xeaaf),\n\tcalendar: register('calendar', 0xeab0),\n\tcaseSensitive: register('case-sensitive', 0xeab1),\n\tcheck: register('check', 0xeab2),\n\tchecklist: register('checklist', 0xeab3),\n\tchevronDown: register('chevron-down', 0xeab4),\n\tchevronLeft: register('chevron-left', 0xeab5),\n\tchevronRight: register('chevron-right', 0xeab6),\n\tchevronUp: register('chevron-up', 0xeab7),\n\tchromeClose: register('chrome-close', 0xeab8),\n\tchromeMaximize: register('chrome-maximize', 0xeab9),\n\tchromeMinimize: register('chrome-minimize', 0xeaba),\n\tchromeRestore: register('chrome-restore', 0xeabb),\n\tcircleOutline: register('circle-outline', 0xeabc),\n\tcircle: register('circle', 0xeabc),\n\tdebugBreakpointUnverified: register('debug-breakpoint-unverified', 0xeabc),\n\tterminalDecorationIncomplete: register('terminal-decoration-incomplete', 0xeabc),\n\tcircleSlash: register('circle-slash', 0xeabd),\n\tcircuitBoard: register('circuit-board', 0xeabe),\n\tclearAll: register('clear-all', 0xeabf),\n\tclippy: register('clippy', 0xeac0),\n\tcloseAll: register('close-all', 0xeac1),\n\tcloudDownload: register('cloud-download', 0xeac2),\n\tcloudUpload: register('cloud-upload', 0xeac3),\n\tcode: register('code', 0xeac4),\n\tcollapseAll: register('collapse-all', 0xeac5),\n\tcolorMode: register('color-mode', 0xeac6),\n\tcommentDiscussion: register('comment-discussion', 0xeac7),\n\tcreditCard: register('credit-card', 0xeac9),\n\tdash: register('dash', 0xeacc),\n\tdashboard: register('dashboard', 0xeacd),\n\tdatabase: register('database', 0xeace),\n\tdebugContinue: register('debug-continue', 0xeacf),\n\tdebugDisconnect: register('debug-disconnect', 0xead0),\n\tdebugPause: register('debug-pause', 0xead1),\n\tdebugRestart: register('debug-restart', 0xead2),\n\tdebugStart: register('debug-start', 0xead3),\n\tdebugStepInto: register('debug-step-into', 0xead4),\n\tdebugStepOut: register('debug-step-out', 0xead5),\n\tdebugStepOver: register('debug-step-over', 0xead6),\n\tdebugStop: register('debug-stop', 0xead7),\n\tdebug: register('debug', 0xead8),\n\tdeviceCameraVideo: register('device-camera-video', 0xead9),\n\tdeviceCamera: register('device-camera', 0xeada),\n\tdeviceMobile: register('device-mobile', 0xeadb),\n\tdiffAdded: register('diff-added', 0xeadc),\n\tdiffIgnored: register('diff-ignored', 0xeadd),\n\tdiffModified: register('diff-modified', 0xeade),\n\tdiffRemoved: register('diff-removed', 0xeadf),\n\tdiffRenamed: register('diff-renamed', 0xeae0),\n\tdiff: register('diff', 0xeae1),\n\tdiffSidebyside: register('diff-sidebyside', 0xeae1),\n\tdiscard: register('discard', 0xeae2),\n\teditorLayout: register('editor-layout', 0xeae3),\n\temptyWindow: register('empty-window', 0xeae4),\n\texclude: register('exclude', 0xeae5),\n\textensions: register('extensions', 0xeae6),\n\teyeClosed: register('eye-closed', 0xeae7),\n\tfileBinary: register('file-binary', 0xeae8),\n\tfileCode: register('file-code', 0xeae9),\n\tfileMedia: register('file-media', 0xeaea),\n\tfilePdf: register('file-pdf', 0xeaeb),\n\tfileSubmodule: register('file-submodule', 0xeaec),\n\tfileSymlinkDirectory: register('file-symlink-directory', 0xeaed),\n\tfileSymlinkFile: register('file-symlink-file', 0xeaee),\n\tfileZip: register('file-zip', 0xeaef),\n\tfiles: register('files', 0xeaf0),\n\tfilter: register('filter', 0xeaf1),\n\tflame: register('flame', 0xeaf2),\n\tfoldDown: register('fold-down', 0xeaf3),\n\tfoldUp: register('fold-up', 0xeaf4),\n\tfold: register('fold', 0xeaf5),\n\tfolderActive: register('folder-active', 0xeaf6),\n\tfolderOpened: register('folder-opened', 0xeaf7),\n\tgear: register('gear', 0xeaf8),\n\tgift: register('gift', 0xeaf9),\n\tgistSecret: register('gist-secret', 0xeafa),\n\tgist: register('gist', 0xeafb),\n\tgitCommit: register('git-commit', 0xeafc),\n\tgitCompare: register('git-compare', 0xeafd),\n\tcompareChanges: register('compare-changes', 0xeafd),\n\tgitMerge: register('git-merge', 0xeafe),\n\tgithubAction: register('github-action', 0xeaff),\n\tgithubAlt: register('github-alt', 0xeb00),\n\tglobe: register('globe', 0xeb01),\n\tgrabber: register('grabber', 0xeb02),\n\tgraph: register('graph', 0xeb03),\n\tgripper: register('gripper', 0xeb04),\n\theart: register('heart', 0xeb05),\n\thome: register('home', 0xeb06),\n\thorizontalRule: register('horizontal-rule', 0xeb07),\n\thubot: register('hubot', 0xeb08),\n\tinbox: register('inbox', 0xeb09),\n\tissueReopened: register('issue-reopened', 0xeb0b),\n\tissues: register('issues', 0xeb0c),\n\titalic: register('italic', 0xeb0d),\n\tjersey: register('jersey', 0xeb0e),\n\tjson: register('json', 0xeb0f),\n\tkebabVertical: register('kebab-vertical', 0xeb10),\n\tkey: register('key', 0xeb11),\n\tlaw: register('law', 0xeb12),\n\tlightbulbAutofix: register('lightbulb-autofix', 0xeb13),\n\tlinkExternal: register('link-external', 0xeb14),\n\tlink: register('link', 0xeb15),\n\tlistOrdered: register('list-ordered', 0xeb16),\n\tlistUnordered: register('list-unordered', 0xeb17),\n\tliveShare: register('live-share', 0xeb18),\n\tloading: register('loading', 0xeb19),\n\tlocation: register('location', 0xeb1a),\n\tmailRead: register('mail-read', 0xeb1b),\n\tmail: register('mail', 0xeb1c),\n\tmarkdown: register('markdown', 0xeb1d),\n\tmegaphone: register('megaphone', 0xeb1e),\n\tmention: register('mention', 0xeb1f),\n\tmilestone: register('milestone', 0xeb20),\n\tgitPullRequestMilestone: register('git-pull-request-milestone', 0xeb20),\n\tmortarBoard: register('mortar-board', 0xeb21),\n\tmove: register('move', 0xeb22),\n\tmultipleWindows: register('multiple-windows', 0xeb23),\n\tmute: register('mute', 0xeb24),\n\tnoNewline: register('no-newline', 0xeb25),\n\tnote: register('note', 0xeb26),\n\toctoface: register('octoface', 0xeb27),\n\topenPreview: register('open-preview', 0xeb28),\n\tpackage: register('package', 0xeb29),\n\tpaintcan: register('paintcan', 0xeb2a),\n\tpin: register('pin', 0xeb2b),\n\tplay: register('play', 0xeb2c),\n\trun: register('run', 0xeb2c),\n\tplug: register('plug', 0xeb2d),\n\tpreserveCase: register('preserve-case', 0xeb2e),\n\tpreview: register('preview', 0xeb2f),\n\tproject: register('project', 0xeb30),\n\tpulse: register('pulse', 0xeb31),\n\tquestion: register('question', 0xeb32),\n\tquote: register('quote', 0xeb33),\n\tradioTower: register('radio-tower', 0xeb34),\n\treactions: register('reactions', 0xeb35),\n\treferences: register('references', 0xeb36),\n\trefresh: register('refresh', 0xeb37),\n\tregex: register('regex', 0xeb38),\n\tremoteExplorer: register('remote-explorer', 0xeb39),\n\tremote: register('remote', 0xeb3a),\n\tremove: register('remove', 0xeb3b),\n\treplaceAll: register('replace-all', 0xeb3c),\n\treplace: register('replace', 0xeb3d),\n\trepoClone: register('repo-clone', 0xeb3e),\n\trepoForcePush: register('repo-force-push', 0xeb3f),\n\trepoPull: register('repo-pull', 0xeb40),\n\trepoPush: register('repo-push', 0xeb41),\n\treport: register('report', 0xeb42),\n\trequestChanges: register('request-changes', 0xeb43),\n\trocket: register('rocket', 0xeb44),\n\trootFolderOpened: register('root-folder-opened', 0xeb45),\n\trootFolder: register('root-folder', 0xeb46),\n\trss: register('rss', 0xeb47),\n\truby: register('ruby', 0xeb48),\n\tsaveAll: register('save-all', 0xeb49),\n\tsaveAs: register('save-as', 0xeb4a),\n\tsave: register('save', 0xeb4b),\n\tscreenFull: register('screen-full', 0xeb4c),\n\tscreenNormal: register('screen-normal', 0xeb4d),\n\tsearchStop: register('search-stop', 0xeb4e),\n\tserver: register('server', 0xeb50),\n\tsettingsGear: register('settings-gear', 0xeb51),\n\tsettings: register('settings', 0xeb52),\n\tshield: register('shield', 0xeb53),\n\tsmiley: register('smiley', 0xeb54),\n\tsortPrecedence: register('sort-precedence', 0xeb55),\n\tsplitHorizontal: register('split-horizontal', 0xeb56),\n\tsplitVertical: register('split-vertical', 0xeb57),\n\tsquirrel: register('squirrel', 0xeb58),\n\tstarFull: register('star-full', 0xeb59),\n\tstarHalf: register('star-half', 0xeb5a),\n\tsymbolClass: register('symbol-class', 0xeb5b),\n\tsymbolColor: register('symbol-color', 0xeb5c),\n\tsymbolConstant: register('symbol-constant', 0xeb5d),\n\tsymbolEnumMember: register('symbol-enum-member', 0xeb5e),\n\tsymbolField: register('symbol-field', 0xeb5f),\n\tsymbolFile: register('symbol-file', 0xeb60),\n\tsymbolInterface: register('symbol-interface', 0xeb61),\n\tsymbolKeyword: register('symbol-keyword', 0xeb62),\n\tsymbolMisc: register('symbol-misc', 0xeb63),\n\tsymbolOperator: register('symbol-operator', 0xeb64),\n\tsymbolProperty: register('symbol-property', 0xeb65),\n\twrench: register('wrench', 0xeb65),\n\twrenchSubaction: register('wrench-subaction', 0xeb65),\n\tsymbolSnippet: register('symbol-snippet', 0xeb66),\n\ttasklist: register('tasklist', 0xeb67),\n\ttelescope: register('telescope', 0xeb68),\n\ttextSize: register('text-size', 0xeb69),\n\tthreeBars: register('three-bars', 0xeb6a),\n\tthumbsdown: register('thumbsdown', 0xeb6b),\n\tthumbsup: register('thumbsup', 0xeb6c),\n\ttools: register('tools', 0xeb6d),\n\ttriangleDown: register('triangle-down', 0xeb6e),\n\ttriangleLeft: register('triangle-left', 0xeb6f),\n\ttriangleRight: register('triangle-right', 0xeb70),\n\ttriangleUp: register('triangle-up', 0xeb71),\n\ttwitter: register('twitter', 0xeb72),\n\tunfold: register('unfold', 0xeb73),\n\tunlock: register('unlock', 0xeb74),\n\tunmute: register('unmute', 0xeb75),\n\tunverified: register('unverified', 0xeb76),\n\tverified: register('verified', 0xeb77),\n\tversions: register('versions', 0xeb78),\n\tvmActive: register('vm-active', 0xeb79),\n\tvmOutline: register('vm-outline', 0xeb7a),\n\tvmRunning: register('vm-running', 0xeb7b),\n\twatch: register('watch', 0xeb7c),\n\twhitespace: register('whitespace', 0xeb7d),\n\twholeWord: register('whole-word', 0xeb7e),\n\twindow: register('window', 0xeb7f),\n\twordWrap: register('word-wrap', 0xeb80),\n\tzoomIn: register('zoom-in', 0xeb81),\n\tzoomOut: register('zoom-out', 0xeb82),\n\tlistFilter: register('list-filter', 0xeb83),\n\tlistFlat: register('list-flat', 0xeb84),\n\tlistSelection: register('list-selection', 0xeb85),\n\tselection: register('selection', 0xeb85),\n\tlistTree: register('list-tree', 0xeb86),\n\tdebugBreakpointFunctionUnverified: register('debug-breakpoint-function-unverified', 0xeb87),\n\tdebugBreakpointFunction: register('debug-breakpoint-function', 0xeb88),\n\tdebugBreakpointFunctionDisabled: register('debug-breakpoint-function-disabled', 0xeb88),\n\tdebugStackframeActive: register('debug-stackframe-active', 0xeb89),\n\tcircleSmallFilled: register('circle-small-filled', 0xeb8a),\n\tdebugStackframeDot: register('debug-stackframe-dot', 0xeb8a),\n\tterminalDecorationMark: register('terminal-decoration-mark', 0xeb8a),\n\tdebugStackframe: register('debug-stackframe', 0xeb8b),\n\tdebugStackframeFocused: register('debug-stackframe-focused', 0xeb8b),\n\tdebugBreakpointUnsupported: register('debug-breakpoint-unsupported', 0xeb8c),\n\tsymbolString: register('symbol-string', 0xeb8d),\n\tdebugReverseContinue: register('debug-reverse-continue', 0xeb8e),\n\tdebugStepBack: register('debug-step-back', 0xeb8f),\n\tdebugRestartFrame: register('debug-restart-frame', 0xeb90),\n\tdebugAlt: register('debug-alt', 0xeb91),\n\tcallIncoming: register('call-incoming', 0xeb92),\n\tcallOutgoing: register('call-outgoing', 0xeb93),\n\tmenu: register('menu', 0xeb94),\n\texpandAll: register('expand-all', 0xeb95),\n\tfeedback: register('feedback', 0xeb96),\n\tgitPullRequestReviewer: register('git-pull-request-reviewer', 0xeb96),\n\tgroupByRefType: register('group-by-ref-type', 0xeb97),\n\tungroupByRefType: register('ungroup-by-ref-type', 0xeb98),\n\taccount: register('account', 0xeb99),\n\tgitPullRequestAssignee: register('git-pull-request-assignee', 0xeb99),\n\tbellDot: register('bell-dot', 0xeb9a),\n\tdebugConsole: register('debug-console', 0xeb9b),\n\tlibrary: register('library', 0xeb9c),\n\toutput: register('output', 0xeb9d),\n\trunAll: register('run-all', 0xeb9e),\n\tsyncIgnored: register('sync-ignored', 0xeb9f),\n\tpinned: register('pinned', 0xeba0),\n\tgithubInverted: register('github-inverted', 0xeba1),\n\tserverProcess: register('server-process', 0xeba2),\n\tserverEnvironment: register('server-environment', 0xeba3),\n\tpass: register('pass', 0xeba4),\n\tissueClosed: register('issue-closed', 0xeba4),\n\tstopCircle: register('stop-circle', 0xeba5),\n\tplayCircle: register('play-circle', 0xeba6),\n\trecord: register('record', 0xeba7),\n\tdebugAltSmall: register('debug-alt-small', 0xeba8),\n\tvmConnect: register('vm-connect', 0xeba9),\n\tcloud: register('cloud', 0xebaa),\n\tmerge: register('merge', 0xebab),\n\texport: register('export', 0xebac),\n\tgraphLeft: register('graph-left', 0xebad),\n\tmagnet: register('magnet', 0xebae),\n\tnotebook: register('notebook', 0xebaf),\n\tredo: register('redo', 0xebb0),\n\tcheckAll: register('check-all', 0xebb1),\n\tpinnedDirty: register('pinned-dirty', 0xebb2),\n\tpassFilled: register('pass-filled', 0xebb3),\n\tcircleLargeFilled: register('circle-large-filled', 0xebb4),\n\tcircleLarge: register('circle-large', 0xebb5),\n\tcircleLargeOutline: register('circle-large-outline', 0xebb5),\n\tcombine: register('combine', 0xebb6),\n\tgather: register('gather', 0xebb6),\n\ttable: register('table', 0xebb7),\n\tvariableGroup: register('variable-group', 0xebb8),\n\ttypeHierarchy: register('type-hierarchy', 0xebb9),\n\ttypeHierarchySub: register('type-hierarchy-sub', 0xebba),\n\ttypeHierarchySuper: register('type-hierarchy-super', 0xebbb),\n\tgitPullRequestCreate: register('git-pull-request-create', 0xebbc),\n\trunAbove: register('run-above', 0xebbd),\n\trunBelow: register('run-below', 0xebbe),\n\tnotebookTemplate: register('notebook-template', 0xebbf),\n\tdebugRerun: register('debug-rerun', 0xebc0),\n\tworkspaceTrusted: register('workspace-trusted', 0xebc1),\n\tworkspaceUntrusted: register('workspace-untrusted', 0xebc2),\n\tworkspaceUnknown: register('workspace-unknown', 0xebc3),\n\tterminalCmd: register('terminal-cmd', 0xebc4),\n\tterminalDebian: register('terminal-debian', 0xebc5),\n\tterminalLinux: register('terminal-linux', 0xebc6),\n\tterminalPowershell: register('terminal-powershell', 0xebc7),\n\tterminalTmux: register('terminal-tmux', 0xebc8),\n\tterminalUbuntu: register('terminal-ubuntu', 0xebc9),\n\tterminalBash: register('terminal-bash', 0xebca),\n\tarrowSwap: register('arrow-swap', 0xebcb),\n\tcopy: register('copy', 0xebcc),\n\tpersonAdd: register('person-add', 0xebcd),\n\tfilterFilled: register('filter-filled', 0xebce),\n\twand: register('wand', 0xebcf),\n\tdebugLineByLine: register('debug-line-by-line', 0xebd0),\n\tinspect: register('inspect', 0xebd1),\n\tlayers: register('layers', 0xebd2),\n\tlayersDot: register('layers-dot', 0xebd3),\n\tlayersActive: register('layers-active', 0xebd4),\n\tcompass: register('compass', 0xebd5),\n\tcompassDot: register('compass-dot', 0xebd6),\n\tcompassActive: register('compass-active', 0xebd7),\n\tazure: register('azure', 0xebd8),\n\tissueDraft: register('issue-draft', 0xebd9),\n\tgitPullRequestClosed: register('git-pull-request-closed', 0xebda),\n\tgitPullRequestDraft: register('git-pull-request-draft', 0xebdb),\n\tdebugAll: register('debug-all', 0xebdc),\n\tdebugCoverage: register('debug-coverage', 0xebdd),\n\trunErrors: register('run-errors', 0xebde),\n\tfolderLibrary: register('folder-library', 0xebdf),\n\tdebugContinueSmall: register('debug-continue-small', 0xebe0),\n\tbeakerStop: register('beaker-stop', 0xebe1),\n\tgraphLine: register('graph-line', 0xebe2),\n\tgraphScatter: register('graph-scatter', 0xebe3),\n\tpieChart: register('pie-chart', 0xebe4),\n\tbracket: register('bracket', 0xeb0f),\n\tbracketDot: register('bracket-dot', 0xebe5),\n\tbracketError: register('bracket-error', 0xebe6),\n\tlockSmall: register('lock-small', 0xebe7),\n\tazureDevops: register('azure-devops', 0xebe8),\n\tverifiedFilled: register('verified-filled', 0xebe9),\n\tnewline: register('newline', 0xebea),\n\tlayout: register('layout', 0xebeb),\n\tlayoutActivitybarLeft: register('layout-activitybar-left', 0xebec),\n\tlayoutActivitybarRight: register('layout-activitybar-right', 0xebed),\n\tlayoutPanelLeft: register('layout-panel-left', 0xebee),\n\tlayoutPanelCenter: register('layout-panel-center', 0xebef),\n\tlayoutPanelJustify: register('layout-panel-justify', 0xebf0),\n\tlayoutPanelRight: register('layout-panel-right', 0xebf1),\n\tlayoutPanel: register('layout-panel', 0xebf2),\n\tlayoutSidebarLeft: register('layout-sidebar-left', 0xebf3),\n\tlayoutSidebarRight: register('layout-sidebar-right', 0xebf4),\n\tlayoutStatusbar: register('layout-statusbar', 0xebf5),\n\tlayoutMenubar: register('layout-menubar', 0xebf6),\n\tlayoutCentered: register('layout-centered', 0xebf7),\n\ttarget: register('target', 0xebf8),\n\tindent: register('indent', 0xebf9),\n\trecordSmall: register('record-small', 0xebfa),\n\terrorSmall: register('error-small', 0xebfb),\n\tterminalDecorationError: register('terminal-decoration-error', 0xebfb),\n\tarrowCircleDown: register('arrow-circle-down', 0xebfc),\n\tarrowCircleLeft: register('arrow-circle-left', 0xebfd),\n\tarrowCircleRight: register('arrow-circle-right', 0xebfe),\n\tarrowCircleUp: register('arrow-circle-up', 0xebff),\n\tlayoutSidebarRightOff: register('layout-sidebar-right-off', 0xec00),\n\tlayoutPanelOff: register('layout-panel-off', 0xec01),\n\tlayoutSidebarLeftOff: register('layout-sidebar-left-off', 0xec02),\n\tblank: register('blank', 0xec03),\n\theartFilled: register('heart-filled', 0xec04),\n\tmap: register('map', 0xec05),\n\tmapHorizontal: register('map-horizontal', 0xec05),\n\tfoldHorizontal: register('fold-horizontal', 0xec05),\n\tmapFilled: register('map-filled', 0xec06),\n\tmapHorizontalFilled: register('map-horizontal-filled', 0xec06),\n\tfoldHorizontalFilled: register('fold-horizontal-filled', 0xec06),\n\tcircleSmall: register('circle-small', 0xec07),\n\tbellSlash: register('bell-slash', 0xec08),\n\tbellSlashDot: register('bell-slash-dot', 0xec09),\n\tcommentUnresolved: register('comment-unresolved', 0xec0a),\n\tgitPullRequestGoToChanges: register('git-pull-request-go-to-changes', 0xec0b),\n\tgitPullRequestNewChanges: register('git-pull-request-new-changes', 0xec0c),\n\tsearchFuzzy: register('search-fuzzy', 0xec0d),\n\tcommentDraft: register('comment-draft', 0xec0e),\n\tsend: register('send', 0xec0f),\n\tsparkle: register('sparkle', 0xec10),\n\tinsert: register('insert', 0xec11),\n\tmic: register('mic', 0xec12),\n\tthumbsdownFilled: register('thumbsdown-filled', 0xec13),\n\tthumbsupFilled: register('thumbsup-filled', 0xec14),\n\tcoffee: register('coffee', 0xec15),\n\tsnake: register('snake', 0xec16),\n\tgame: register('game', 0xec17),\n\tvr: register('vr', 0xec18),\n\tchip: register('chip', 0xec19),\n\tpiano: register('piano', 0xec1a),\n\tmusic: register('music', 0xec1b),\n\tmicFilled: register('mic-filled', 0xec1c),\n\trepoFetch: register('repo-fetch', 0xec1d),\n\tcopilot: register('copilot', 0xec1e),\n\tlightbulbSparkle: register('lightbulb-sparkle', 0xec1f),\n\trobot: register('robot', 0xec20),\n\tsparkleFilled: register('sparkle-filled', 0xec21),\n\tdiffSingle: register('diff-single', 0xec22),\n\tdiffMultiple: register('diff-multiple', 0xec23),\n\tsurroundWith: register('surround-with', 0xec24),\n\tshare: register('share', 0xec25),\n\tgitStash: register('git-stash', 0xec26),\n\tgitStashApply: register('git-stash-apply', 0xec27),\n\tgitStashPop: register('git-stash-pop', 0xec28),\n\tvscode: register('vscode', 0xec29),\n\tvscodeInsiders: register('vscode-insiders', 0xec2a),\n\tcodeOss: register('code-oss', 0xec2b),\n\trunCoverage: register('run-coverage', 0xec2c),\n\trunAllCoverage: register('run-all-coverage', 0xec2d),\n\tcoverage: register('coverage', 0xec2e),\n\tgithubProject: register('github-project', 0xec2f),\n\tmapVertical: register('map-vertical', 0xec30),\n\tfoldVertical: register('fold-vertical', 0xec30),\n\tmapVerticalFilled: register('map-vertical-filled', 0xec31),\n\tfoldVerticalFilled: register('fold-vertical-filled', 0xec31),\n\tgoToSearch: register('go-to-search', 0xec32),\n\tpercentage: register('percentage', 0xec33),\n\tsortPercentage: register('sort-percentage', 0xec33),\n\tattach: register('attach', 0xec34),\n} as const;\n","\nimport { register } from 'vs/base/common/codiconsUtil';\nimport { codiconsLibrary } from 'vs/base/common/codiconsLibrary';\n\n/**\n * Derived icons, that could become separate icons.\n * These mappings should be moved into the mapping file in the vscode-codicons repo at some point.\n */\nexport const codiconsDerived = {\n\tdialogError: register('dialog-error', 'error'),\n\tdialogWarning: register('dialog-warning', 'warning'),\n\tdialogInfo: register('dialog-info', 'info'),\n\tdialogClose: register('dialog-close', 'close'),\n\ttreeItemExpanded: register('tree-item-expanded', 'chevron-down'), // collapsed is done with rotation\n\ttreeFilterOnTypeOn: register('tree-filter-on-type-on', 'list-filter'),\n\ttreeFilterOnTypeOff: register('tree-filter-on-type-off', 'list-selection'),\n\ttreeFilterClear: register('tree-filter-clear', 'close'),\n\ttreeItemLoading: register('tree-item-loading', 'loading'),\n\tmenuSelection: register('menu-selection', 'check'),\n\tmenuSubmenu: register('menu-submenu', 'chevron-right'),\n\tmenuBarMore: register('menubar-more', 'more'),\n\tscrollbarButtonLeft: register('scrollbar-button-left', 'triangle-left'),\n\tscrollbarButtonRight: register('scrollbar-button-right', 'triangle-right'),\n\tscrollbarButtonUp: register('scrollbar-button-up', 'triangle-up'),\n\tscrollbarButtonDown: register('scrollbar-button-down', 'triangle-down'),\n\ttoolBarMore: register('toolbar-more', 'more'),\n\tquickInputBack: register('quick-input-back', 'arrow-left'),\n\tdropDownButton: register('drop-down-button', 0xeab4),\n\tsymbolCustomColor: register('symbol-customcolor', 0xeb5c),\n\texportIcon: register('export', 0xebac),\n\tworkspaceUnspecified: register('workspace-unspecified', 0xebc3),\n\tnewLine: register('newline', 0xebea),\n\tthumbsDownFilled: register('thumbsdown-filled', 0xec13),\n\tthumbsUpFilled: register('thumbsup-filled', 0xec14),\n\tgitFetch: register('git-fetch', 0xec1d),\n\tlightbulbSparkleAutofix: register('lightbulb-sparkle-autofix', 0xec1f),\n\tdebugBreakpointPending: register('debug-breakpoint-pending', 0xebd9),\n\n} as const;\n\n/**\n * The Codicon library is a set of default icons that are built-in in VS Code.\n *\n * In the product (outside of base) Codicons should only be used as defaults. In order to have all icons in VS Code\n * themeable, component should define new, UI component specific icons using `iconRegistry.registerIcon`.\n * In that call a Codicon can be named as default.\n */\nexport const Codicon = {\n\t...codiconsLibrary,\n\t...codiconsDerived\n\n} as const;\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { isTypedArray, isObject, isUndefinedOrNull } from 'vs/base/common/types';\n\nexport function deepClone<T>(obj: T): T {\n\tif (!obj || typeof obj !== 'object') {\n\t\treturn obj;\n\t}\n\tif (obj instanceof RegExp) {\n\t\treturn obj;\n\t}\n\tconst result: any = Array.isArray(obj) ? [] : {};\n\tObject.entries(obj).forEach(([key, value]) => {\n\t\tresult[key] = value && typeof value === 'object' ? deepClone(value) : value;\n\t});\n\treturn result;\n}\n\nexport function deepFreeze<T>(obj: T): T {\n\tif (!obj || typeof obj !== 'object') {\n\t\treturn obj;\n\t}\n\tconst stack: any[] = [obj];\n\twhile (stack.length > 0) {\n\t\tconst obj = stack.shift();\n\t\tObject.freeze(obj);\n\t\tfor (const key in obj) {\n\t\t\tif (_hasOwnProperty.call(obj, key)) {\n\t\t\t\tconst prop = obj[key];\n\t\t\t\tif (typeof prop === 'object' && !Object.isFrozen(prop) && !isTypedArray(prop)) {\n\t\t\t\t\tstack.push(prop);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn obj;\n}\n\nconst _hasOwnProperty = Object.prototype.hasOwnProperty;\n\n\nexport function cloneAndChange(obj: any, changer: (orig: any) => any): any {\n\treturn _cloneAndChange(obj, changer, new Set());\n}\n\nfunction _cloneAndChange(obj: any, changer: (orig: any) => any, seen: Set<any>): any {\n\tif (isUndefinedOrNull(obj)) {\n\t\treturn obj;\n\t}\n\n\tconst changed = changer(obj);\n\tif (typeof changed !== 'undefined') {\n\t\treturn changed;\n\t}\n\n\tif (Array.isArray(obj)) {\n\t\tconst r1: any[] = [];\n\t\tfor (const e of obj) {\n\t\t\tr1.push(_cloneAndChange(e, changer, seen));\n\t\t}\n\t\treturn r1;\n\t}\n\n\tif (isObject(obj)) {\n\t\tif (seen.has(obj)) {\n\t\t\tthrow new Error('Cannot clone recursive data-structure');\n\t\t}\n\t\tseen.add(obj);\n\t\tconst r2 = {};\n\t\tfor (const i2 in obj) {\n\t\t\tif (_hasOwnProperty.call(obj, i2)) {\n\t\t\t\t(r2 as any)[i2] = _cloneAndChange(obj[i2], changer, seen);\n\t\t\t}\n\t\t}\n\t\tseen.delete(obj);\n\t\treturn r2;\n\t}\n\n\treturn obj;\n}\n\n/**\n * Copies all properties of source into destination. The optional parameter \"overwrite\" allows to control\n * if existing properties on the destination should be overwritten or not. Defaults to true (overwrite).\n */\nexport function mixin(destination: any, source: any, overwrite: boolean = true): any {\n\tif (!isObject(destination)) {\n\t\treturn source;\n\t}\n\n\tif (isObject(source)) {\n\t\tObject.keys(source).forEach(key => {\n\t\t\tif (key in destination) {\n\t\t\t\tif (overwrite) {\n\t\t\t\t\tif (isObject(destination[key]) && isObject(source[key])) {\n\t\t\t\t\t\tmixin(destination[key], source[key], overwrite);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tdestination[key] = source[key];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tdestination[key] = source[key];\n\t\t\t}\n\t\t});\n\t}\n\treturn destination;\n}\n\nexport function equals(one: any, other: any): boolean {\n\tif (one === other) {\n\t\treturn true;\n\t}\n\tif (one === null || one === undefined || other === null || other === undefined) {\n\t\treturn false;\n\t}\n\tif (typeof one !== typeof other) {\n\t\treturn false;\n\t}\n\tif (typeof one !== 'object') {\n\t\treturn false;\n\t}\n\tif ((Array.isArray(one)) !== (Array.isArray(other))) {\n\t\treturn false;\n\t}\n\n\tlet i: number;\n\tlet key: string;\n\n\tif (Array.isArray(one)) {\n\t\tif (one.length !== other.length) {\n\t\t\treturn false;\n\t\t}\n\t\tfor (i = 0; i < one.length; i++) {\n\t\t\tif (!equals(one[i], other[i])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tconst oneKeys: string[] = [];\n\n\t\tfor (key in one) {\n\t\t\toneKeys.push(key);\n\t\t}\n\t\toneKeys.sort();\n\t\tconst otherKeys: string[] = [];\n\t\tfor (key in other) {\n\t\t\totherKeys.push(key);\n\t\t}\n\t\totherKeys.sort();\n\t\tif (!equals(oneKeys, otherKeys)) {\n\t\t\treturn false;\n\t\t}\n\t\tfor (i = 0; i < oneKeys.length; i++) {\n\t\t\tif (!equals(one[oneKeys[i]], other[oneKeys[i]])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nexport function getAllPropertyNames(obj: object): string[] {\n\tlet res: string[] = [];\n\twhile (Object.prototype !== obj) {\n\t\tres = res.concat(Object.getOwnPropertyNames(obj));\n\t\tobj = Object.getPrototypeOf(obj);\n\t}\n\treturn res;\n}\n\nexport function getAllMethodNames(obj: object): string[] {\n\tconst methods: string[] = [];\n\tfor (const prop of getAllPropertyNames(obj)) {\n\t\tif (typeof (obj as any)[prop] === 'function') {\n\t\t\tmethods.push(prop);\n\t\t}\n\t}\n\treturn methods;\n}\n\nexport function createProxyObject<T extends object>(methodNames: string[], invoke: (method: string, args: unknown[]) => unknown): T {\n\tconst createProxyMethod = (method: string): () => unknown => {\n\t\treturn function () {\n\t\t\tconst args = Array.prototype.slice.call(arguments, 0);\n\t\t\treturn invoke(method, args);\n\t\t};\n\t};\n\n\tconst result = {} as T;\n\tfor (const methodName of methodNames) {\n\t\t(<any>result)[methodName] = createProxyMethod(methodName);\n\t}\n\treturn result;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nexport const enum Constants {\n\t/**\n\t * MAX SMI (SMall Integer) as defined in v8.\n\t * one bit is lost for boxing/unboxing flag.\n\t * one bit is lost for sign flag.\n\t * See https://thibaultlaurens.github.io/javascript/2013/04/29/how-the-v8-engine-works/#tagged-values\n\t */\n\tMAX_SAFE_SMALL_INTEGER = 1 << 30,\n\n\t/**\n\t * MIN SMI (SMall Integer) as defined in v8.\n\t * one bit is lost for boxing/unboxing flag.\n\t * one bit is lost for sign flag.\n\t * See https://thibaultlaurens.github.io/javascript/2013/04/29/how-the-v8-engine-works/#tagged-values\n\t */\n\tMIN_SAFE_SMALL_INTEGER = -(1 << 30),\n\n\t/**\n\t * Max unsigned integer that fits on 8 bits.\n\t */\n\tMAX_UINT_8 = 255, // 2^8 - 1\n\n\t/**\n\t * Max unsigned integer that fits on 16 bits.\n\t */\n\tMAX_UINT_16 = 65535, // 2^16 - 1\n\n\t/**\n\t * Max unsigned integer that fits on 32 bits.\n\t */\n\tMAX_UINT_32 = 4294967295, // 2^32 - 1\n\n\tUNICODE_SUPPLEMENTARY_PLANE_BEGIN = 0x010000\n}\n\nexport function toUint8(v: number): number {\n\tif (v < 0) {\n\t\treturn 0;\n\t}\n\tif (v > Constants.MAX_UINT_8) {\n\t\treturn Constants.MAX_UINT_8;\n\t}\n\treturn v | 0;\n}\n\nexport function toUint32(v: number): number {\n\tif (v < 0) {\n\t\treturn 0;\n\t}\n\tif (v > Constants.MAX_UINT_32) {\n\t\treturn Constants.MAX_UINT_32;\n\t}\n\treturn v | 0;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { toUint8 } from 'vs/base/common/uint';\n\n/**\n * A fast character classifier that uses a compact array for ASCII values.\n */\nexport class CharacterClassifier<T extends number> {\n\t/**\n\t * Maintain a compact (fully initialized ASCII map for quickly classifying ASCII characters - used more often in code).\n\t */\n\tprotected readonly _asciiMap: Uint8Array;\n\n\t/**\n\t * The entire map (sparse array).\n\t */\n\tprotected readonly _map: Map<number, number>;\n\n\tprotected readonly _defaultValue: number;\n\n\tconstructor(_defaultValue: T) {\n\t\tconst defaultValue = toUint8(_defaultValue);\n\n\t\tthis._defaultValue = defaultValue;\n\t\tthis._asciiMap = CharacterClassifier._createAsciiMap(defaultValue);\n\t\tthis._map = new Map<number, number>();\n\t}\n\n\tprivate static _createAsciiMap(defaultValue: number): Uint8Array {\n\t\tconst asciiMap = new Uint8Array(256);\n\t\tasciiMap.fill(defaultValue);\n\t\treturn asciiMap;\n\t}\n\n\tpublic set(charCode: number, _value: T): void {\n\t\tconst value = toUint8(_value);\n\n\t\tif (charCode >= 0 && charCode < 256) {\n\t\t\tthis._asciiMap[charCode] = value;\n\t\t} else {\n\t\t\tthis._map.set(charCode, value);\n\t\t}\n\t}\n\n\tpublic get(charCode: number): T {\n\t\tif (charCode >= 0 && charCode < 256) {\n\t\t\treturn <T>this._asciiMap[charCode];\n\t\t} else {\n\t\t\treturn <T>(this._map.get(charCode) || this._defaultValue);\n\t\t}\n\t}\n\n\tpublic clear() {\n\t\tthis._asciiMap.fill(this._defaultValue);\n\t\tthis._map.clear();\n\t}\n}\n\nconst enum Boolean {\n\tFalse = 0,\n\tTrue = 1\n}\n\nexport class CharacterSet {\n\n\tprivate readonly _actual: CharacterClassifier<Boolean>;\n\n\tconstructor() {\n\t\tthis._actual = new CharacterClassifier<Boolean>(Boolean.False);\n\t}\n\n\tpublic add(charCode: number): void {\n\t\tthis._actual.set(charCode, Boolean.True);\n\t}\n\n\tpublic has(charCode: number): boolean {\n\t\treturn (this._actual.get(charCode) === Boolean.True);\n\t}\n\n\tpublic clear(): void {\n\t\treturn this._actual.clear();\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { BugIndicatingError } from 'vs/base/common/errors';\n\nexport interface IOffsetRange {\n}\n\n/**\n * A range of offsets (0-based).\n*/\nexport class OffsetRange implements IOffsetRange {\n\tpublic static addRange(range: OffsetRange, sortedRanges: OffsetRange[]): void {\n\t\tlet i = 0;\n\t\twhile (i < sortedRanges.length && sortedRanges[i].endExclusive < range.start) {\n\t\t\ti++;\n\t\t}\n\t\tlet j = i;\n\t\twhile (j < sortedRanges.length && sortedRanges[j].start <= range.endExclusive) {\n\t\t\tj++;\n\t\t}\n\t\tif (i === j) {\n\t\t\tsortedRanges.splice(i, 0, range);\n\t\t} else {\n\t\t\tconst start = Math.min(range.start, sortedRanges[i].start);\n\t\t\tconst end = Math.max(range.endExclusive, sortedRanges[j - 1].endExclusive);\n\t\t\tsortedRanges.splice(i, j - i, new OffsetRange(start, end));\n\t\t}\n\t}\n\n\tpublic static tryCreate(start: number, endExclusive: number): OffsetRange | undefined {\n\t\tif (start > endExclusive) {\n\t\t\treturn undefined;\n\t\t}\n\t\treturn new OffsetRange(start, endExclusive);\n\t}\n\n\tpublic static ofLength(length: number): OffsetRange {\n\t\treturn new OffsetRange(0, length);\n\t}\n\n\tpublic static ofStartAndLength(start: number, length: number): OffsetRange {\n\t\treturn new OffsetRange(start, start + length);\n\t}\n\n\tconstructor(public readonly start: number, public readonly endExclusive: number) {\n\t\tif (start > endExclusive) {\n\t\t\tthrow new BugIndicatingError(`Invalid range: ${this.toString()}`);\n\t\t}\n\t}\n\n\tget isEmpty(): boolean {\n\t\treturn this.start === this.endExclusive;\n\t}\n\n\tpublic delta(offset: number): OffsetRange {\n\t\treturn new OffsetRange(this.start + offset, this.endExclusive + offset);\n\t}\n\n\tpublic deltaStart(offset: number): OffsetRange {\n\t\treturn new OffsetRange(this.start + offset, this.endExclusive);\n\t}\n\n\tpublic deltaEnd(offset: number): OffsetRange {\n\t\treturn new OffsetRange(this.start, this.endExclusive + offset);\n\t}\n\n\tpublic get length(): number {\n\t\treturn this.endExclusive - this.start;\n\t}\n\n\tpublic toString() {\n\t\treturn `[${this.start}, ${this.endExclusive})`;\n\t}\n\n\tpublic contains(offset: number): boolean {\n\t\treturn this.start <= offset && offset < this.endExclusive;\n\t}\n\n\t/**\n\t * for all numbers n: range1.contains(n) or range2.contains(n) => range1.join(range2).contains(n)\n\t * The joined range is the smallest range that contains both ranges.\n\t */\n\tpublic join(other: OffsetRange): OffsetRange {\n\t\treturn new OffsetRange(Math.min(this.start, other.start), Math.max(this.endExclusive, other.endExclusive));\n\t}\n\n\t/**\n\t * for all numbers n: range1.contains(n) and range2.contains(n) <=> range1.intersect(range2).contains(n)\n\t *\n\t * The resulting range is empty if the ranges do not intersect, but touch.\n\t * If the ranges don't even touch, the result is undefined.\n\t */\n\tpublic intersect(other: OffsetRange): OffsetRange | undefined {\n\t\tconst start = Math.max(this.start, other.start);\n\t\tconst end = Math.min(this.endExclusive, other.endExclusive);\n\t\tif (start <= end) {\n\t\t\treturn new OffsetRange(start, end);\n\t\t}\n\t\treturn undefined;\n\t}\n\n\tpublic intersects(other: OffsetRange): boolean {\n\t\tconst start = Math.max(this.start, other.start);\n\t\tconst end = Math.min(this.endExclusive, other.endExclusive);\n\t\treturn start < end;\n\t}\n\n\tpublic isBefore(other: OffsetRange): boolean {\n\t\treturn this.endExclusive <= other.start;\n\t}\n\n\tpublic isAfter(other: OffsetRange): boolean {\n\t\treturn this.start >= other.endExclusive;\n\t}\n\n\tpublic slice<T>(arr: T[]): T[] {\n\t\treturn arr.slice(this.start, this.endExclusive);\n\t}\n\n\tpublic substring(str: string): string {\n\t\treturn str.substring(this.start, this.endExclusive);\n\t}\n\n\t/**\n\t * Returns the given value if it is contained in this instance, otherwise the closest value that is contained.\n\t * The range must not be empty.\n\t */\n\tpublic clip(value: number): number {\n\t\tif (this.isEmpty) {\n\t\t\tthrow new BugIndicatingError(`Invalid clipping range: ${this.toString()}`);\n\t\t}\n\t\treturn Math.max(this.start, Math.min(this.endExclusive - 1, value));\n\t}\n\n\t/**\n\t * Returns `r := value + k * length` such that `r` is contained in this range.\n\t * The range must not be empty.\n\t *\n\t * E.g. `[5, 10).clipCyclic(10) === 5`, `[5, 10).clipCyclic(11) === 6` and `[5, 10).clipCyclic(4) === 9`.\n\t */\n\tpublic clipCyclic(value: number): number {\n\t\tif (this.isEmpty) {\n\t\t\tthrow new BugIndicatingError(`Invalid clipping range: ${this.toString()}`);\n\t\t}\n\t\tif (value < this.start) {\n\t\t\treturn this.endExclusive - ((this.start - value) % this.length);\n\t\t}\n\t\tif (value >= this.endExclusive) {\n\t\t\treturn this.start + ((value - this.start) % this.length);\n\t\t}\n\t\treturn value;\n\t}\n\n\tpublic forEach(f: (offset: number) => void): void {\n\t\tfor (let i = this.start; i < this.endExclusive; i++) {\n\t\t\tf(i);\n\t\t}\n\t}\n}\n\nexport class OffsetRangeSet {\n\tprivate readonly _sortedRanges: OffsetRange[] = [];\n\n\tpublic addRange(range: OffsetRange): void {\n\t\tlet i = 0;\n\t\twhile (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive < range.start) {\n\t\t\ti++;\n\t\t}\n\t\tlet j = i;\n\t\twhile (j < this._sortedRanges.length && this._sortedRanges[j].start <= range.endExclusive) {\n\t\t\tj++;\n\t\t}\n\t\tif (i === j) {\n\t\t\tthis._sortedRanges.splice(i, 0, range);\n\t\t} else {\n\t\t\tconst start = Math.min(range.start, this._sortedRanges[i].start);\n\t\t\tconst end = Math.max(range.endExclusive, this._sortedRanges[j - 1].endExclusive);\n\t\t\tthis._sortedRanges.splice(i, j - i, new OffsetRange(start, end));\n\t\t}\n\t}\n\n\tpublic toString(): string {\n\t\treturn this._sortedRanges.map(r => r.toString()).join(', ');\n\t}\n\n\t/**\n\t * Returns of there is a value that is contained in this instance and the given range.\n\t */\n\tpublic intersectsStrict(other: OffsetRange): boolean {\n\t\t// TODO use binary search\n\t\tlet i = 0;\n\t\twhile (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive <= other.start) {\n\t\t\ti++;\n\t\t}\n\t\treturn i < this._sortedRanges.length && this._sortedRanges[i].start < other.endExclusive;\n\t}\n\n\tpublic intersectWithRange(other: OffsetRange): OffsetRangeSet {\n\t\t// TODO use binary search + slice\n\t\tconst result = new OffsetRangeSet();\n\t\tfor (const range of this._sortedRanges) {\n\t\t\tconst intersection = range.intersect(other);\n\t\t\tif (intersection) {\n\t\t\t\tresult.addRange(intersection);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic intersectWithRangeLength(other: OffsetRange): number {\n\t\treturn this.intersectWithRange(other).length;\n\t}\n\n\tpublic get length(): number {\n\t\treturn this._sortedRanges.reduce((prev, cur) => prev + cur.length, 0);\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n/**\n * A position in the editor. This interface is suitable for serialization.\n */\nexport interface IPosition {\n\t/**\n\t * line number (starts at 1)\n\t */\n\treadonly lineNumber: number;\n\t/**\n\t * column (the first character in a line is between column 1 and column 2)\n\t */\n\treadonly column: number;\n}\n\n/**\n * A position in the editor.\n */\nexport class Position {\n\t/**\n\t * line number (starts at 1)\n\t */\n\tpublic readonly lineNumber: number;\n\t/**\n\t * column (the first character in a line is between column 1 and column 2)\n\t */\n\tpublic readonly column: number;\n\n\tconstructor(lineNumber: number, column: number) {\n\t\tthis.lineNumber = lineNumber;\n\t\tthis.column = column;\n\t}\n\n\t/**\n\t * Create a new position from this position.\n\t *\n\t * @param newLineNumber new line number\n\t * @param newColumn new column\n\t */\n\twith(newLineNumber: number = this.lineNumber, newColumn: number = this.column): Position {\n\t\tif (newLineNumber === this.lineNumber && newColumn === this.column) {\n\t\t\treturn this;\n\t\t} else {\n\t\t\treturn new Position(newLineNumber, newColumn);\n\t\t}\n\t}\n\n\t/**\n\t * Derive a new position from this position.\n\t *\n\t * @param deltaLineNumber line number delta\n\t * @param deltaColumn column delta\n\t */\n\tdelta(deltaLineNumber: number = 0, deltaColumn: number = 0): Position {\n\t\treturn this.with(this.lineNumber + deltaLineNumber, this.column + deltaColumn);\n\t}\n\n\t/**\n\t * Test if this position equals other position\n\t */\n\tpublic equals(other: IPosition): boolean {\n\t\treturn Position.equals(this, other);\n\t}\n\n\t/**\n\t * Test if position `a` equals position `b`\n\t */\n\tpublic static equals(a: IPosition | null, b: IPosition | null): boolean {\n\t\tif (!a && !b) {\n\t\t\treturn true;\n\t\t}\n\t\treturn (\n\t\t\t!!a &&\n\t\t\t!!b &&\n\t\t\ta.lineNumber === b.lineNumber &&\n\t\t\ta.column === b.column\n\t\t);\n\t}\n\n\t/**\n\t * Test if this position is before other position.\n\t * If the two positions are equal, the result will be false.\n\t */\n\tpublic isBefore(other: IPosition): boolean {\n\t\treturn Position.isBefore(this, other);\n\t}\n\n\t/**\n\t * Test if position `a` is before position `b`.\n\t * If the two positions are equal, the result will be false.\n\t */\n\tpublic static isBefore(a: IPosition, b: IPosition): boolean {\n\t\tif (a.lineNumber < b.lineNumber) {\n\t\t\treturn true;\n\t\t}\n\t\tif (b.lineNumber < a.lineNumber) {\n\t\t\treturn false;\n\t\t}\n\t\treturn a.column < b.column;\n\t}\n\n\t/**\n\t * Test if this position is before other position.\n\t * If the two positions are equal, the result will be true.\n\t */\n\tpublic isBeforeOrEqual(other: IPosition): boolean {\n\t\treturn Position.isBeforeOrEqual(this, other);\n\t}\n\n\t/**\n\t * Test if position `a` is before position `b`.\n\t * If the two positions are equal, the result will be true.\n\t */\n\tpublic static isBeforeOrEqual(a: IPosition, b: IPosition): boolean {\n\t\tif (a.lineNumber < b.lineNumber) {\n\t\t\treturn true;\n\t\t}\n\t\tif (b.lineNumber < a.lineNumber) {\n\t\t\treturn false;\n\t\t}\n\t\treturn a.column <= b.column;\n\t}\n\n\t/**\n\t * A function that compares positions, useful for sorting\n\t */\n\tpublic static compare(a: IPosition, b: IPosition): number {\n\t\tconst aLineNumber = a.lineNumber | 0;\n\t\tconst bLineNumber = b.lineNumber | 0;\n\n\t\tif (aLineNumber === bLineNumber) {\n\t\t\tconst aColumn = a.column | 0;\n\t\t\tconst bColumn = b.column | 0;\n\t\t\treturn aColumn - bColumn;\n\t\t}\n\n\t\treturn aLineNumber - bLineNumber;\n\t}\n\n\t/**\n\t * Clone this position.\n\t */\n\tpublic clone(): Position {\n\t\treturn new Position(this.lineNumber, this.column);\n\t}\n\n\t/**\n\t * Convert to a human-readable representation.\n\t */\n\tpublic toString(): string {\n\t\treturn '(' + this.lineNumber + ',' + this.column + ')';\n\t}\n\n\t// ---\n\n\t/**\n\t * Create a `Position` from an `IPosition`.\n\t */\n\tpublic static lift(pos: IPosition): Position {\n\t\treturn new Position(pos.lineNumber, pos.column);\n\t}\n\n\t/**\n\t * Test if `obj` is an `IPosition`.\n\t */\n\tpublic static isIPosition(obj: any): obj is IPosition {\n\t\treturn (\n\t\t\tobj\n\t\t\t&& (typeof obj.lineNumber === 'number')\n\t\t\t&& (typeof obj.column === 'number')\n\t\t);\n\t}\n\n\tpublic toJSON(): IPosition {\n\t\treturn {\n\t\t\tlineNumber: this.lineNumber,\n\t\t\tcolumn: this.column\n\t\t};\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { IPosition, Position } from 'vs/editor/common/core/position';\n\n/**\n * A range in the editor. This interface is suitable for serialization.\n */\nexport interface IRange {\n\t/**\n\t * Line number on which the range starts (starts at 1).\n\t */\n\treadonly startLineNumber: number;\n\t/**\n\t * Column on which the range starts in line `startLineNumber` (starts at 1).\n\t */\n\treadonly startColumn: number;\n\t/**\n\t * Line number on which the range ends.\n\t */\n\treadonly endLineNumber: number;\n\t/**\n\t * Column on which the range ends in line `endLineNumber`.\n\t */\n\treadonly endColumn: number;\n}\n\n/**\n * A range in the editor. (startLineNumber,startColumn) is <= (endLineNumber,endColumn)\n */\nexport class Range {\n\n\t/**\n\t * Line number on which the range starts (starts at 1).\n\t */\n\tpublic readonly startLineNumber: number;\n\t/**\n\t * Column on which the range starts in line `startLineNumber` (starts at 1).\n\t */\n\tpublic readonly startColumn: number;\n\t/**\n\t * Line number on which the range ends.\n\t */\n\tpublic readonly endLineNumber: number;\n\t/**\n\t * Column on which the range ends in line `endLineNumber`.\n\t */\n\tpublic readonly endColumn: number;\n\n\tconstructor(startLineNumber: number, startColumn: number, endLineNumber: number, endColumn: number) {\n\t\tif ((startLineNumber > endLineNumber) || (startLineNumber === endLineNumber && startColumn > endColumn)) {\n\t\t\tthis.startLineNumber = endLineNumber;\n\t\t\tthis.startColumn = endColumn;\n\t\t\tthis.endLineNumber = startLineNumber;\n\t\t\tthis.endColumn = startColumn;\n\t\t} else {\n\t\t\tthis.startLineNumber = startLineNumber;\n\t\t\tthis.startColumn = startColumn;\n\t\t\tthis.endLineNumber = endLineNumber;\n\t\t\tthis.endColumn = endColumn;\n\t\t}\n\t}\n\n\t/**\n\t * Test if this range is empty.\n\t */\n\tpublic isEmpty(): boolean {\n\t\treturn Range.isEmpty(this);\n\t}\n\n\t/**\n\t * Test if `range` is empty.\n\t */\n\tpublic static isEmpty(range: IRange): boolean {\n\t\treturn (range.startLineNumber === range.endLineNumber && range.startColumn === range.endColumn);\n\t}\n\n\t/**\n\t * Test if position is in this range. If the position is at the edges, will return true.\n\t */\n\tpublic containsPosition(position: IPosition): boolean {\n\t\treturn Range.containsPosition(this, position);\n\t}\n\n\t/**\n\t * Test if `position` is in `range`. If the position is at the edges, will return true.\n\t */\n\tpublic static containsPosition(range: IRange, position: IPosition): boolean {\n\t\tif (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) {\n\t\t\treturn false;\n\t\t}\n\t\tif (position.lineNumber === range.startLineNumber && position.column < range.startColumn) {\n\t\t\treturn false;\n\t\t}\n\t\tif (position.lineNumber === range.endLineNumber && position.column > range.endColumn) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\t/**\n\t * Test if `position` is in `range`. If the position is at the edges, will return false.\n\t * @internal\n\t */\n\tpublic static strictContainsPosition(range: IRange, position: IPosition): boolean {\n\t\tif (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) {\n\t\t\treturn false;\n\t\t}\n\t\tif (position.lineNumber === range.startLineNumber && position.column <= range.startColumn) {\n\t\t\treturn false;\n\t\t}\n\t\tif (position.lineNumber === range.endLineNumber && position.column >= range.endColumn) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\t/**\n\t * Test if range is in this range. If the range is equal to this range, will return true.\n\t */\n\tpublic containsRange(range: IRange): boolean {\n\t\treturn Range.containsRange(this, range);\n\t}\n\n\t/**\n\t * Test if `otherRange` is in `range`. If the ranges are equal, will return true.\n\t */\n\tpublic static containsRange(range: IRange, otherRange: IRange): boolean {\n\t\tif (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) {\n\t\t\treturn false;\n\t\t}\n\t\tif (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) {\n\t\t\treturn false;\n\t\t}\n\t\tif (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn < range.startColumn) {\n\t\t\treturn false;\n\t\t}\n\t\tif (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn > range.endColumn) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\t/**\n\t * Test if `range` is strictly in this range. `range` must start after and end before this range for the result to be true.\n\t */\n\tpublic strictContainsRange(range: IRange): boolean {\n\t\treturn Range.strictContainsRange(this, range);\n\t}\n\n\t/**\n\t * Test if `otherRange` is strictly in `range` (must start after, and end before). If the ranges are equal, will return false.\n\t */\n\tpublic static strictContainsRange(range: IRange, otherRange: IRange): boolean {\n\t\tif (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) {\n\t\t\treturn false;\n\t\t}\n\t\tif (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) {\n\t\t\treturn false;\n\t\t}\n\t\tif (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn <= range.startColumn) {\n\t\t\treturn false;\n\t\t}\n\t\tif (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn >= range.endColumn) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\t/**\n\t * A reunion of the two ranges.\n\t * The smallest position will be used as the start point, and the largest one as the end point.\n\t */\n\tpublic plusRange(range: IRange): Range {\n\t\treturn Range.plusRange(this, range);\n\t}\n\n\t/**\n\t * A reunion of the two ranges.\n\t * The smallest position will be used as the start point, and the largest one as the end point.\n\t */\n\tpublic static plusRange(a: IRange, b: IRange): Range {\n\t\tlet startLineNumber: number;\n\t\tlet startColumn: number;\n\t\tlet endLineNumber: number;\n\t\tlet endColumn: number;\n\n\t\tif (b.startLineNumber < a.startLineNumber) {\n\t\t\tstartLineNumber = b.startLineNumber;\n\t\t\tstartColumn = b.startColumn;\n\t\t} else if (b.startLineNumber === a.startLineNumber) {\n\t\t\tstartLineNumber = b.startLineNumber;\n\t\t\tstartColumn = Math.min(b.startColumn, a.startColumn);\n\t\t} else {\n\t\t\tstartLineNumber = a.startLineNumber;\n\t\t\tstartColumn = a.startColumn;\n\t\t}\n\n\t\tif (b.endLineNumber > a.endLineNumber) {\n\t\t\tendLineNumber = b.endLineNumber;\n\t\t\tendColumn = b.endColumn;\n\t\t} else if (b.endLineNumber === a.endLineNumber) {\n\t\t\tendLineNumber = b.endLineNumber;\n\t\t\tendColumn = Math.max(b.endColumn, a.endColumn);\n\t\t} else {\n\t\t\tendLineNumber = a.endLineNumber;\n\t\t\tendColumn = a.endColumn;\n\t\t}\n\n\t\treturn new Range(startLineNumber, startColumn, endLineNumber, endColumn);\n\t}\n\n\t/**\n\t * A intersection of the two ranges.\n\t */\n\tpublic intersectRanges(range: IRange): Range | null {\n\t\treturn Range.intersectRanges(this, range);\n\t}\n\n\t/**\n\t * A intersection of the two ranges.\n\t */\n\tpublic static intersectRanges(a: IRange, b: IRange): Range | null {\n\t\tlet resultStartLineNumber = a.startLineNumber;\n\t\tlet resultStartColumn = a.startColumn;\n\t\tlet resultEndLineNumber = a.endLineNumber;\n\t\tlet resultEndColumn = a.endColumn;\n\t\tconst otherStartLineNumber = b.startLineNumber;\n\t\tconst otherStartColumn = b.startColumn;\n\t\tconst otherEndLineNumber = b.endLineNumber;\n\t\tconst otherEndColumn = b.endColumn;\n\n\t\tif (resultStartLineNumber < otherStartLineNumber) {\n\t\t\tresultStartLineNumber = otherStartLineNumber;\n\t\t\tresultStartColumn = otherStartColumn;\n\t\t} else if (resultStartLineNumber === otherStartLineNumber) {\n\t\t\tresultStartColumn = Math.max(resultStartColumn, otherStartColumn);\n\t\t}\n\n\t\tif (resultEndLineNumber > otherEndLineNumber) {\n\t\t\tresultEndLineNumber = otherEndLineNumber;\n\t\t\tresultEndColumn = otherEndColumn;\n\t\t} else if (resultEndLineNumber === otherEndLineNumber) {\n\t\t\tresultEndColumn = Math.min(resultEndColumn, otherEndColumn);\n\t\t}\n\n\t\t// Check if selection is now empty\n\t\tif (resultStartLineNumber > resultEndLineNumber) {\n\t\t\treturn null;\n\t\t}\n\t\tif (resultStartLineNumber === resultEndLineNumber && resultStartColumn > resultEndColumn) {\n\t\t\treturn null;\n\t\t}\n\t\treturn new Range(resultStartLineNumber, resultStartColumn, resultEndLineNumber, resultEndColumn);\n\t}\n\n\t/**\n\t * Test if this range equals other.\n\t */\n\tpublic equalsRange(other: IRange | null | undefined): boolean {\n\t\treturn Range.equalsRange(this, other);\n\t}\n\n\t/**\n\t * Test if range `a` equals `b`.\n\t */\n\tpublic static equalsRange(a: IRange | null | undefined, b: IRange | null | undefined): boolean {\n\t\tif (!a && !b) {\n\t\t\treturn true;\n\t\t}\n\t\treturn (\n\t\t\t!!a &&\n\t\t\t!!b &&\n\t\t\ta.startLineNumber === b.startLineNumber &&\n\t\t\ta.startColumn === b.startColumn &&\n\t\t\ta.endLineNumber === b.endLineNumber &&\n\t\t\ta.endColumn === b.endColumn\n\t\t);\n\t}\n\n\t/**\n\t * Return the end position (which will be after or equal to the start position)\n\t */\n\tpublic getEndPosition(): Position {\n\t\treturn Range.getEndPosition(this);\n\t}\n\n\t/**\n\t * Return the end position (which will be after or equal to the start position)\n\t */\n\tpublic static getEndPosition(range: IRange): Position {\n\t\treturn new Position(range.endLineNumber, range.endColumn);\n\t}\n\n\t/**\n\t * Return the start position (which will be before or equal to the end position)\n\t */\n\tpublic getStartPosition(): Position {\n\t\treturn Range.getStartPosition(this);\n\t}\n\n\t/**\n\t * Return the start position (which will be before or equal to the end position)\n\t */\n\tpublic static getStartPosition(range: IRange): Position {\n\t\treturn new Position(range.startLineNumber, range.startColumn);\n\t}\n\n\t/**\n\t * Transform to a user presentable string representation.\n\t */\n\tpublic toString(): string {\n\t\treturn '[' + this.startLineNumber + ',' + this.startColumn + ' -> ' + this.endLineNumber + ',' + this.endColumn + ']';\n\t}\n\n\t/**\n\t * Create a new range using this range's start position, and using endLineNumber and endColumn as the end position.\n\t */\n\tpublic setEndPosition(endLineNumber: number, endColumn: number): Range {\n\t\treturn new Range(this.startLineNumber, this.startColumn, endLineNumber, endColumn);\n\t}\n\n\t/**\n\t * Create a new range using this range's end position, and using startLineNumber and startColumn as the start position.\n\t */\n\tpublic setStartPosition(startLineNumber: number, startColumn: number): Range {\n\t\treturn new Range(startLineNumber, startColumn, this.endLineNumber, this.endColumn);\n\t}\n\n\t/**\n\t * Create a new empty range using this range's start position.\n\t */\n\tpublic collapseToStart(): Range {\n\t\treturn Range.collapseToStart(this);\n\t}\n\n\t/**\n\t * Create a new empty range using this range's start position.\n\t */\n\tpublic static collapseToStart(range: IRange): Range {\n\t\treturn new Range(range.startLineNumber, range.startColumn, range.startLineNumber, range.startColumn);\n\t}\n\n\t/**\n\t * Create a new empty range using this range's end position.\n\t */\n\tpublic collapseToEnd(): Range {\n\t\treturn Range.collapseToEnd(this);\n\t}\n\n\t/**\n\t * Create a new empty range using this range's end position.\n\t */\n\tpublic static collapseToEnd(range: IRange): Range {\n\t\treturn new Range(range.endLineNumber, range.endColumn, range.endLineNumber, range.endColumn);\n\t}\n\n\t/**\n\t * Moves the range by the given amount of lines.\n\t */\n\tpublic delta(lineCount: number): Range {\n\t\treturn new Range(this.startLineNumber + lineCount, this.startColumn, this.endLineNumber + lineCount, this.endColumn);\n\t}\n\n\t// ---\n\n\tpublic static fromPositions(start: IPosition, end: IPosition = start): Range {\n\t\treturn new Range(start.lineNumber, start.column, end.lineNumber, end.column);\n\t}\n\n\t/**\n\t * Create a `Range` from an `IRange`.\n\t */\n\tpublic static lift(range: undefined | null): null;\n\tpublic static lift(range: IRange): Range;\n\tpublic static lift(range: IRange | undefined | null): Range | null;\n\tpublic static lift(range: IRange | undefined | null): Range | null {\n\t\tif (!range) {\n\t\t\treturn null;\n\t\t}\n\t\treturn new Range(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);\n\t}\n\n\t/**\n\t * Test if `obj` is an `IRange`.\n\t */\n\tpublic static isIRange(obj: any): obj is IRange {\n\t\treturn (\n\t\t\tobj\n\t\t\t&& (typeof obj.startLineNumber === 'number')\n\t\t\t&& (typeof obj.startColumn === 'number')\n\t\t\t&& (typeof obj.endLineNumber === 'number')\n\t\t\t&& (typeof obj.endColumn === 'number')\n\t\t);\n\t}\n\n\t/**\n\t * Test if the two ranges are touching in any way.\n\t */\n\tpublic static areIntersectingOrTouching(a: IRange, b: IRange): boolean {\n\t\t// Check if `a` is before `b`\n\t\tif (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn < b.startColumn)) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Check if `b` is before `a`\n\t\tif (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn < a.startColumn)) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// These ranges must intersect\n\t\treturn true;\n\t}\n\n\t/**\n\t * Test if the two ranges are intersecting. If the ranges are touching it returns true.\n\t */\n\tpublic static areIntersecting(a: IRange, b: IRange): boolean {\n\t\t// Check if `a` is before `b`\n\t\tif (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn <= b.startColumn)) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Check if `b` is before `a`\n\t\tif (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn <= a.startColumn)) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// These ranges must intersect\n\t\treturn true;\n\t}\n\n\t/**\n\t * A function that compares ranges, useful for sorting ranges\n\t * It will first compare ranges on the startPosition and then on the endPosition\n\t */\n\tpublic static compareRangesUsingStarts(a: IRange | null | undefined, b: IRange | null | undefined): number {\n\t\tif (a && b) {\n\t\t\tconst aStartLineNumber = a.startLineNumber | 0;\n\t\t\tconst bStartLineNumber = b.startLineNumber | 0;\n\n\t\t\tif (aStartLineNumber === bStartLineNumber) {\n\t\t\t\tconst aStartColumn = a.startColumn | 0;\n\t\t\t\tconst bStartColumn = b.startColumn | 0;\n\n\t\t\t\tif (aStartColumn === bStartColumn) {\n\t\t\t\t\tconst aEndLineNumber = a.endLineNumber | 0;\n\t\t\t\t\tconst bEndLineNumber = b.endLineNumber | 0;\n\n\t\t\t\t\tif (aEndLineNumber === bEndLineNumber) {\n\t\t\t\t\t\tconst aEndColumn = a.endColumn | 0;\n\t\t\t\t\t\tconst bEndColumn = b.endColumn | 0;\n\t\t\t\t\t\treturn aEndColumn - bEndColumn;\n\t\t\t\t\t}\n\t\t\t\t\treturn aEndLineNumber - bEndLineNumber;\n\t\t\t\t}\n\t\t\t\treturn aStartColumn - bStartColumn;\n\t\t\t}\n\t\t\treturn aStartLineNumber - bStartLineNumber;\n\t\t}\n\t\tconst aExists = (a ? 1 : 0);\n\t\tconst bExists = (b ? 1 : 0);\n\t\treturn aExists - bExists;\n\t}\n\n\t/**\n\t * A function that compares ranges, useful for sorting ranges\n\t * It will first compare ranges on the endPosition and then on the startPosition\n\t */\n\tpublic static compareRangesUsingEnds(a: IRange, b: IRange): number {\n\t\tif (a.endLineNumber === b.endLineNumber) {\n\t\t\tif (a.endColumn === b.endColumn) {\n\t\t\t\tif (a.startLineNumber === b.startLineNumber) {\n\t\t\t\t\treturn a.startColumn - b.startColumn;\n\t\t\t\t}\n\t\t\t\treturn a.startLineNumber - b.startLineNumber;\n\t\t\t}\n\t\t\treturn a.endColumn - b.endColumn;\n\t\t}\n\t\treturn a.endLineNumber - b.endLineNumber;\n\t}\n\n\t/**\n\t * Test if the range spans multiple lines.\n\t */\n\tpublic static spansMultipleLines(range: IRange): boolean {\n\t\treturn range.endLineNumber > range.startLineNumber;\n\t}\n\n\tpublic toJSON(): IRange {\n\t\treturn this;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { BugIndicatingError } from 'vs/base/common/errors';\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\nimport { Range } from 'vs/editor/common/core/range';\nimport { findFirstIdxMonotonousOrArrLen, findLastIdxMonotonous, findLastMonotonous } from 'vs/base/common/arraysFind';\n\n/**\n * A range of lines (1-based).\n */\nexport class LineRange {\n\n\tpublic static fromRangeInclusive(range: Range): LineRange {\n\t\treturn new LineRange(range.startLineNumber, range.endLineNumber + 1);\n\t}\n\n\t/**\n\t * @param lineRanges An array of sorted line ranges.\n\t */\n\tpublic static joinMany(lineRanges: readonly (readonly LineRange[])[]): readonly LineRange[] {\n\t\tif (lineRanges.length === 0) {\n\t\t\treturn [];\n\t\t}\n\t\tlet result = new LineRangeSet(lineRanges[0].slice());\n\t\tfor (let i = 1; i < lineRanges.length; i++) {\n\t\t\tresult = result.getUnion(new LineRangeSet(lineRanges[i].slice()));\n\t\t}\n\t\treturn result.ranges;\n\t}\n\n\tpublic static join(lineRanges: LineRange[]): LineRange {\n\t\tif (lineRanges.length === 0) {\n\t\t\tthrow new BugIndicatingError('lineRanges cannot be empty');\n\t\t}\n\t\tlet startLineNumber = lineRanges[0].startLineNumber;\n\t\tlet endLineNumberExclusive = lineRanges[0].endLineNumberExclusive;\n\t\tfor (let i = 1; i < lineRanges.length; i++) {\n\t\t\tstartLineNumber = Math.min(startLineNumber, lineRanges[i].startLineNumber);\n\t\t\tendLineNumberExclusive = Math.max(endLineNumberExclusive, lineRanges[i].endLineNumberExclusive);\n\t\t}\n\t\treturn new LineRange(startLineNumber, endLineNumberExclusive);\n\t}\n\n\tpublic static ofLength(startLineNumber: number, length: number): LineRange {\n\t\treturn new LineRange(startLineNumber, startLineNumber + length);\n\t}\n\n\t/**\n\t * @internal\n\t */\n\tpublic static deserialize(lineRange: ISerializedLineRange): LineRange {\n\t\treturn new LineRange(lineRange[0], lineRange[1]);\n\t}\n\n\t/**\n\t * The start line number.\n\t */\n\tpublic readonly startLineNumber: number;\n\n\t/**\n\t * The end line number (exclusive).\n\t */\n\tpublic readonly endLineNumberExclusive: number;\n\n\tconstructor(\n\t\tstartLineNumber: number,\n\t\tendLineNumberExclusive: number,\n\t) {\n\t\tif (startLineNumber > endLineNumberExclusive) {\n\t\t\tthrow new BugIndicatingError(`startLineNumber ${startLineNumber} cannot be after endLineNumberExclusive ${endLineNumberExclusive}`);\n\t\t}\n\t\tthis.startLineNumber = startLineNumber;\n\t\tthis.endLineNumberExclusive = endLineNumberExclusive;\n\t}\n\n\t/**\n\t * Indicates if this line range contains the given line number.\n\t */\n\tpublic contains(lineNumber: number): boolean {\n\t\treturn this.startLineNumber <= lineNumber && lineNumber < this.endLineNumberExclusive;\n\t}\n\n\t/**\n\t * Indicates if this line range is empty.\n\t */\n\tget isEmpty(): boolean {\n\t\treturn this.startLineNumber === this.endLineNumberExclusive;\n\t}\n\n\t/**\n\t * Moves this line range by the given offset of line numbers.\n\t */\n\tpublic delta(offset: number): LineRange {\n\t\treturn new LineRange(this.startLineNumber + offset, this.endLineNumberExclusive + offset);\n\t}\n\n\tpublic deltaLength(offset: number): LineRange {\n\t\treturn new LineRange(this.startLineNumber, this.endLineNumberExclusive + offset);\n\t}\n\n\t/**\n\t * The number of lines this line range spans.\n\t */\n\tpublic get length(): number {\n\t\treturn this.endLineNumberExclusive - this.startLineNumber;\n\t}\n\n\t/**\n\t * Creates a line range that combines this and the given line range.\n\t */\n\tpublic join(other: LineRange): LineRange {\n\t\treturn new LineRange(\n\t\t\tMath.min(this.startLineNumber, other.startLineNumber),\n\t\t\tMath.max(this.endLineNumberExclusive, other.endLineNumberExclusive)\n\t\t);\n\t}\n\n\tpublic toString(): string {\n\t\treturn `[${this.startLineNumber},${this.endLineNumberExclusive})`;\n\t}\n\n\t/**\n\t * The resulting range is empty if the ranges do not intersect, but touch.\n\t * If the ranges don't even touch, the result is undefined.\n\t */\n\tpublic intersect(other: LineRange): LineRange | undefined {\n\t\tconst startLineNumber = Math.max(this.startLineNumber, other.startLineNumber);\n\t\tconst endLineNumberExclusive = Math.min(this.endLineNumberExclusive, other.endLineNumberExclusive);\n\t\tif (startLineNumber <= endLineNumberExclusive) {\n\t\t\treturn new LineRange(startLineNumber, endLineNumberExclusive);\n\t\t}\n\t\treturn undefined;\n\t}\n\n\tpublic intersectsStrict(other: LineRange): boolean {\n\t\treturn this.startLineNumber < other.endLineNumberExclusive && other.startLineNumber < this.endLineNumberExclusive;\n\t}\n\n\tpublic overlapOrTouch(other: LineRange): boolean {\n\t\treturn this.startLineNumber <= other.endLineNumberExclusive && other.startLineNumber <= this.endLineNumberExclusive;\n\t}\n\n\tpublic equals(b: LineRange): boolean {\n\t\treturn this.startLineNumber === b.startLineNumber && this.endLineNumberExclusive === b.endLineNumberExclusive;\n\t}\n\n\tpublic toInclusiveRange(): Range | null {\n\t\tif (this.isEmpty) {\n\t\t\treturn null;\n\t\t}\n\t\treturn new Range(this.startLineNumber, 1, this.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER);\n\t}\n\n\t/**\n\t * @deprecated Using this function is discouraged because it might lead to bugs: The end position is not guaranteed to be a valid position!\n\t*/\n\tpublic toExclusiveRange(): Range {\n\t\treturn new Range(this.startLineNumber, 1, this.endLineNumberExclusive, 1);\n\t}\n\n\tpublic mapToLineArray<T>(f: (lineNumber: number) => T): T[] {\n\t\tconst result: T[] = [];\n\t\tfor (let lineNumber = this.startLineNumber; lineNumber < this.endLineNumberExclusive; lineNumber++) {\n\t\t\tresult.push(f(lineNumber));\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic forEach(f: (lineNumber: number) => void): void {\n\t\tfor (let lineNumber = this.startLineNumber; lineNumber < this.endLineNumberExclusive; lineNumber++) {\n\t\t\tf(lineNumber);\n\t\t}\n\t}\n\n\t/**\n\t * @internal\n\t */\n\tpublic serialize(): ISerializedLineRange {\n\t\treturn [this.startLineNumber, this.endLineNumberExclusive];\n\t}\n\n\tpublic includes(lineNumber: number): boolean {\n\t\treturn this.startLineNumber <= lineNumber && lineNumber < this.endLineNumberExclusive;\n\t}\n\n\t/**\n\t * Converts this 1-based line range to a 0-based offset range (subtracts 1!).\n\t * @internal\n\t */\n\tpublic toOffsetRange(): OffsetRange {\n\t\treturn new OffsetRange(this.startLineNumber - 1, this.endLineNumberExclusive - 1);\n\t}\n}\n\nexport type ISerializedLineRange = [startLineNumber: number, endLineNumberExclusive: number];\n\n\nexport class LineRangeSet {\n\tconstructor(\n\t\t/**\n\t\t * Sorted by start line number.\n\t\t * No two line ranges are touching or intersecting.\n\t\t */\n\t\tprivate readonly _normalizedRanges: LineRange[] = []\n\t) {\n\t}\n\n\tget ranges(): readonly LineRange[] {\n\t\treturn this._normalizedRanges;\n\t}\n\n\taddRange(range: LineRange): void {\n\t\tif (range.length === 0) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Idea: Find joinRange such that:\n\t\t// replaceRange = _normalizedRanges.replaceRange(joinRange, range.joinAll(joinRange.map(idx => this._normalizedRanges[idx])))\n\n\t\t// idx of first element that touches range or that is after range\n\t\tconst joinRangeStartIdx = findFirstIdxMonotonousOrArrLen(this._normalizedRanges, r => r.endLineNumberExclusive >= range.startLineNumber);\n\t\t// idx of element after { last element that touches range or that is before range }\n\t\tconst joinRangeEndIdxExclusive = findLastIdxMonotonous(this._normalizedRanges, r => r.startLineNumber <= range.endLineNumberExclusive) + 1;\n\n\t\tif (joinRangeStartIdx === joinRangeEndIdxExclusive) {\n\t\t\t// If there is no element that touches range, then joinRangeStartIdx === joinRangeEndIdxExclusive and that value is the index of the element after range\n\t\t\tthis._normalizedRanges.splice(joinRangeStartIdx, 0, range);\n\t\t} else if (joinRangeStartIdx === joinRangeEndIdxExclusive - 1) {\n\t\t\t// Else, there is an element that touches range and in this case it is both the first and last element. Thus we can replace it\n\t\t\tconst joinRange = this._normalizedRanges[joinRangeStartIdx];\n\t\t\tthis._normalizedRanges[joinRangeStartIdx] = joinRange.join(range);\n\t\t} else {\n\t\t\t// First and last element are different - we need to replace the entire range\n\t\t\tconst joinRange = this._normalizedRanges[joinRangeStartIdx].join(this._normalizedRanges[joinRangeEndIdxExclusive - 1]).join(range);\n\t\t\tthis._normalizedRanges.splice(joinRangeStartIdx, joinRangeEndIdxExclusive - joinRangeStartIdx, joinRange);\n\t\t}\n\t}\n\n\tcontains(lineNumber: number): boolean {\n\t\tconst rangeThatStartsBeforeEnd = findLastMonotonous(this._normalizedRanges, r => r.startLineNumber <= lineNumber);\n\t\treturn !!rangeThatStartsBeforeEnd && rangeThatStartsBeforeEnd.endLineNumberExclusive > lineNumber;\n\t}\n\n\tintersects(range: LineRange): boolean {\n\t\tconst rangeThatStartsBeforeEnd = findLastMonotonous(this._normalizedRanges, r => r.startLineNumber < range.endLineNumberExclusive);\n\t\treturn !!rangeThatStartsBeforeEnd && rangeThatStartsBeforeEnd.endLineNumberExclusive > range.startLineNumber;\n\t}\n\n\tgetUnion(other: LineRangeSet): LineRangeSet {\n\t\tif (this._normalizedRanges.length === 0) {\n\t\t\treturn other;\n\t\t}\n\t\tif (other._normalizedRanges.length === 0) {\n\t\t\treturn this;\n\t\t}\n\n\t\tconst result: LineRange[] = [];\n\t\tlet i1 = 0;\n\t\tlet i2 = 0;\n\t\tlet current: LineRange | null = null;\n\t\twhile (i1 < this._normalizedRanges.length || i2 < other._normalizedRanges.length) {\n\t\t\tlet next: LineRange | null = null;\n\t\t\tif (i1 < this._normalizedRanges.length && i2 < other._normalizedRanges.length) {\n\t\t\t\tconst lineRange1 = this._normalizedRanges[i1];\n\t\t\t\tconst lineRange2 = other._normalizedRanges[i2];\n\t\t\t\tif (lineRange1.startLineNumber < lineRange2.startLineNumber) {\n\t\t\t\t\tnext = lineRange1;\n\t\t\t\t\ti1++;\n\t\t\t\t} else {\n\t\t\t\t\tnext = lineRange2;\n\t\t\t\t\ti2++;\n\t\t\t\t}\n\t\t\t} else if (i1 < this._normalizedRanges.length) {\n\t\t\t\tnext = this._normalizedRanges[i1];\n\t\t\t\ti1++;\n\t\t\t} else {\n\t\t\t\tnext = other._normalizedRanges[i2];\n\t\t\t\ti2++;\n\t\t\t}\n\n\t\t\tif (current === null) {\n\t\t\t\tcurrent = next;\n\t\t\t} else {\n\t\t\t\tif (current.endLineNumberExclusive >= next.startLineNumber) {\n\t\t\t\t\t// merge\n\t\t\t\t\tcurrent = new LineRange(current.startLineNumber, Math.max(current.endLineNumberExclusive, next.endLineNumberExclusive));\n\t\t\t\t} else {\n\t\t\t\t\t// push\n\t\t\t\t\tresult.push(current);\n\t\t\t\t\tcurrent = next;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (current !== null) {\n\t\t\tresult.push(current);\n\t\t}\n\t\treturn new LineRangeSet(result);\n\t}\n\n\t/**\n\t * Subtracts all ranges in this set from `range` and returns the result.\n\t */\n\tsubtractFrom(range: LineRange): LineRangeSet {\n\t\t// idx of first element that touches range or that is after range\n\t\tconst joinRangeStartIdx = findFirstIdxMonotonousOrArrLen(this._normalizedRanges, r => r.endLineNumberExclusive >= range.startLineNumber);\n\t\t// idx of element after { last element that touches range or that is before range }\n\t\tconst joinRangeEndIdxExclusive = findLastIdxMonotonous(this._normalizedRanges, r => r.startLineNumber <= range.endLineNumberExclusive) + 1;\n\n\t\tif (joinRangeStartIdx === joinRangeEndIdxExclusive) {\n\t\t\treturn new LineRangeSet([range]);\n\t\t}\n\n\t\tconst result: LineRange[] = [];\n\t\tlet startLineNumber = range.startLineNumber;\n\t\tfor (let i = joinRangeStartIdx; i < joinRangeEndIdxExclusive; i++) {\n\t\t\tconst r = this._normalizedRanges[i];\n\t\t\tif (r.startLineNumber > startLineNumber) {\n\t\t\t\tresult.push(new LineRange(startLineNumber, r.startLineNumber));\n\t\t\t}\n\t\t\tstartLineNumber = r.endLineNumberExclusive;\n\t\t}\n\t\tif (startLineNumber < range.endLineNumberExclusive) {\n\t\t\tresult.push(new LineRange(startLineNumber, range.endLineNumberExclusive));\n\t\t}\n\n\t\treturn new LineRangeSet(result);\n\t}\n\n\ttoString() {\n\t\treturn this._normalizedRanges.map(r => r.toString()).join(', ');\n\t}\n\n\tgetIntersection(other: LineRangeSet): LineRangeSet {\n\t\tconst result: LineRange[] = [];\n\n\t\tlet i1 = 0;\n\t\tlet i2 = 0;\n\t\twhile (i1 < this._normalizedRanges.length && i2 < other._normalizedRanges.length) {\n\t\t\tconst r1 = this._normalizedRanges[i1];\n\t\t\tconst r2 = other._normalizedRanges[i2];\n\n\t\t\tconst i = r1.intersect(r2);\n\t\t\tif (i && !i.isEmpty) {\n\t\t\t\tresult.push(i);\n\t\t\t}\n\n\t\t\tif (r1.endLineNumberExclusive < r2.endLineNumberExclusive) {\n\t\t\t\ti1++;\n\t\t\t} else {\n\t\t\t\ti2++;\n\t\t\t}\n\t\t}\n\n\t\treturn new LineRangeSet(result);\n\t}\n\n\tgetWithDelta(value: number): LineRangeSet {\n\t\treturn new LineRangeSet(this._normalizedRanges.map(r => r.delta(value)));\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { IPosition, Position } from 'vs/editor/common/core/position';\nimport { Range } from 'vs/editor/common/core/range';\n\n/**\n * A selection in the editor.\n * The selection is a range that has an orientation.\n */\nexport interface ISelection {\n\t/**\n\t * The line number on which the selection has started.\n\t */\n\treadonly selectionStartLineNumber: number;\n\t/**\n\t * The column on `selectionStartLineNumber` where the selection has started.\n\t */\n\treadonly selectionStartColumn: number;\n\t/**\n\t * The line number on which the selection has ended.\n\t */\n\treadonly positionLineNumber: number;\n\t/**\n\t * The column on `positionLineNumber` where the selection has ended.\n\t */\n\treadonly positionColumn: number;\n}\n\n/**\n * The direction of a selection.\n */\nexport const enum SelectionDirection {\n\t/**\n\t * The selection starts above where it ends.\n\t */\n\tLTR,\n\t/**\n\t * The selection starts below where it ends.\n\t */\n\tRTL\n}\n\n/**\n * A selection in the editor.\n * The selection is a range that has an orientation.\n */\nexport class Selection extends Range {\n\t/**\n\t * The line number on which the selection has started.\n\t */\n\tpublic readonly selectionStartLineNumber: number;\n\t/**\n\t * The column on `selectionStartLineNumber` where the selection has started.\n\t */\n\tpublic readonly selectionStartColumn: number;\n\t/**\n\t * The line number on which the selection has ended.\n\t */\n\tpublic readonly positionLineNumber: number;\n\t/**\n\t * The column on `positionLineNumber` where the selection has ended.\n\t */\n\tpublic readonly positionColumn: number;\n\n\tconstructor(selectionStartLineNumber: number, selectionStartColumn: number, positionLineNumber: number, positionColumn: number) {\n\t\tsuper(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn);\n\t\tthis.selectionStartLineNumber = selectionStartLineNumber;\n\t\tthis.selectionStartColumn = selectionStartColumn;\n\t\tthis.positionLineNumber = positionLineNumber;\n\t\tthis.positionColumn = positionColumn;\n\t}\n\n\t/**\n\t * Transform to a human-readable representation.\n\t */\n\tpublic override toString(): string {\n\t\treturn '[' + this.selectionStartLineNumber + ',' + this.selectionStartColumn + ' -> ' + this.positionLineNumber + ',' + this.positionColumn + ']';\n\t}\n\n\t/**\n\t * Test if equals other selection.\n\t */\n\tpublic equalsSelection(other: ISelection): boolean {\n\t\treturn (\n\t\t\tSelection.selectionsEqual(this, other)\n\t\t);\n\t}\n\n\t/**\n\t * Test if the two selections are equal.\n\t */\n\tpublic static selectionsEqual(a: ISelection, b: ISelection): boolean {\n\t\treturn (\n\t\t\ta.selectionStartLineNumber === b.selectionStartLineNumber &&\n\t\t\ta.selectionStartColumn === b.selectionStartColumn &&\n\t\t\ta.positionLineNumber === b.positionLineNumber &&\n\t\t\ta.positionColumn === b.positionColumn\n\t\t);\n\t}\n\n\t/**\n\t * Get directions (LTR or RTL).\n\t */\n\tpublic getDirection(): SelectionDirection {\n\t\tif (this.selectionStartLineNumber === this.startLineNumber && this.selectionStartColumn === this.startColumn) {\n\t\t\treturn SelectionDirection.LTR;\n\t\t}\n\t\treturn SelectionDirection.RTL;\n\t}\n\n\t/**\n\t * Create a new selection with a different `positionLineNumber` and `positionColumn`.\n\t */\n\tpublic override setEndPosition(endLineNumber: number, endColumn: number): Selection {\n\t\tif (this.getDirection() === SelectionDirection.LTR) {\n\t\t\treturn new Selection(this.startLineNumber, this.startColumn, endLineNumber, endColumn);\n\t\t}\n\t\treturn new Selection(endLineNumber, endColumn, this.startLineNumber, this.startColumn);\n\t}\n\n\t/**\n\t * Get the position at `positionLineNumber` and `positionColumn`.\n\t */\n\tpublic getPosition(): Position {\n\t\treturn new Position(this.positionLineNumber, this.positionColumn);\n\t}\n\n\t/**\n\t * Get the position at the start of the selection.\n\t*/\n\tpublic getSelectionStart(): Position {\n\t\treturn new Position(this.selectionStartLineNumber, this.selectionStartColumn);\n\t}\n\n\t/**\n\t * Create a new selection with a different `selectionStartLineNumber` and `selectionStartColumn`.\n\t */\n\tpublic override setStartPosition(startLineNumber: number, startColumn: number): Selection {\n\t\tif (this.getDirection() === SelectionDirection.LTR) {\n\t\t\treturn new Selection(startLineNumber, startColumn, this.endLineNumber, this.endColumn);\n\t\t}\n\t\treturn new Selection(this.endLineNumber, this.endColumn, startLineNumber, startColumn);\n\t}\n\n\t// ----\n\n\t/**\n\t * Create a `Selection` from one or two positions\n\t */\n\tpublic static override fromPositions(start: IPosition, end: IPosition = start): Selection {\n\t\treturn new Selection(start.lineNumber, start.column, end.lineNumber, end.column);\n\t}\n\n\t/**\n\t * Creates a `Selection` from a range, given a direction.\n\t */\n\tpublic static fromRange(range: Range, direction: SelectionDirection): Selection {\n\t\tif (direction === SelectionDirection.LTR) {\n\t\t\treturn new Selection(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);\n\t\t} else {\n\t\t\treturn new Selection(range.endLineNumber, range.endColumn, range.startLineNumber, range.startColumn);\n\t\t}\n\t}\n\n\t/**\n\t * Create a `Selection` from an `ISelection`.\n\t */\n\tpublic static liftSelection(sel: ISelection): Selection {\n\t\treturn new Selection(sel.selectionStartLineNumber, sel.selectionStartColumn, sel.positionLineNumber, sel.positionColumn);\n\t}\n\n\t/**\n\t * `a` equals `b`.\n\t */\n\tpublic static selectionsArrEqual(a: ISelection[], b: ISelection[]): boolean {\n\t\tif (a && !b || !a && b) {\n\t\t\treturn false;\n\t\t}\n\t\tif (!a && !b) {\n\t\t\treturn true;\n\t\t}\n\t\tif (a.length !== b.length) {\n\t\t\treturn false;\n\t\t}\n\t\tfor (let i = 0, len = a.length; i < len; i++) {\n\t\t\tif (!this.selectionsEqual(a[i], b[i])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t/**\n\t * Test if `obj` is an `ISelection`.\n\t */\n\tpublic static isISelection(obj: any): obj is ISelection {\n\t\treturn (\n\t\t\tobj\n\t\t\t&& (typeof obj.selectionStartLineNumber === 'number')\n\t\t\t&& (typeof obj.selectionStartColumn === 'number')\n\t\t\t&& (typeof obj.positionLineNumber === 'number')\n\t\t\t&& (typeof obj.positionColumn === 'number')\n\t\t);\n\t}\n\n\t/**\n\t * Create with a direction.\n\t */\n\tpublic static createWithDirection(startLineNumber: number, startColumn: number, endLineNumber: number, endColumn: number, direction: SelectionDirection): Selection {\n\n\t\tif (direction === SelectionDirection.LTR) {\n\t\t\treturn new Selection(startLineNumber, startColumn, endLineNumber, endColumn);\n\t\t}\n\n\t\treturn new Selection(endLineNumber, endColumn, startLineNumber, startColumn);\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 { Position } from 'vs/editor/common/core/position';\nimport { Range } from 'vs/editor/common/core/range';\n\n/**\n * Represents a non-negative length of text in terms of line and column count.\n*/\nexport class TextLength {\n\tpublic static zero = new TextLength(0, 0);\n\n\tpublic static betweenPositions(position1: Position, position2: Position): TextLength {\n\t\tif (position1.lineNumber === position2.lineNumber) {\n\t\t\treturn new TextLength(0, position2.column - position1.column);\n\t\t} else {\n\t\t\treturn new TextLength(position2.lineNumber - position1.lineNumber, position2.column - 1);\n\t\t}\n\t}\n\n\tpublic static ofRange(range: Range) {\n\t\treturn TextLength.betweenPositions(range.getStartPosition(), range.getEndPosition());\n\t}\n\n\tpublic static ofText(text: string): TextLength {\n\t\tlet line = 0;\n\t\tlet column = 0;\n\t\tfor (const c of text) {\n\t\t\tif (c === '\\n') {\n\t\t\t\tline++;\n\t\t\t\tcolumn = 0;\n\t\t\t} else {\n\t\t\t\tcolumn++;\n\t\t\t}\n\t\t}\n\t\treturn new TextLength(line, column);\n\t}\n\n\tconstructor(\n\t\tpublic readonly lineCount: number,\n\t\tpublic readonly columnCount: number\n\t) { }\n\n\tpublic isGreaterThanOrEqualTo(other: TextLength): boolean {\n\t\tif (this.lineCount !== other.lineCount) {\n\t\t\treturn this.lineCount > other.lineCount;\n\t\t}\n\t\treturn this.columnCount >= other.columnCount;\n\t}\n\n\tpublic createRange(startPosition: Position): Range {\n\t\tif (this.lineCount === 0) {\n\t\t\treturn new Range(startPosition.lineNumber, startPosition.column, startPosition.lineNumber, startPosition.column + this.columnCount);\n\t\t} else {\n\t\t\treturn new Range(startPosition.lineNumber, startPosition.column, startPosition.lineNumber + this.lineCount, this.columnCount + 1);\n\t\t}\n\t}\n\n\tpublic addToPosition(position: Position): Position {\n\t\tif (this.lineCount === 0) {\n\t\t\treturn new Position(position.lineNumber, position.column + this.columnCount);\n\t\t} else {\n\t\t\treturn new Position(position.lineNumber + this.lineCount, this.columnCount + 1);\n\t\t}\n\t}\n\n\ttoString() {\n\t\treturn `${this.lineCount},${this.columnCount}`;\n\t}\n}\n","\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\nimport { Position } from 'vs/editor/common/core/position';\nimport { Range } from 'vs/editor/common/core/range';\nimport { TextLength } from 'vs/editor/common/core/textLength';\n\nexport class PositionOffsetTransformer {\n\tprivate readonly lineStartOffsetByLineIdx: number[];\n\n\tconstructor(public readonly text: string) {\n\t\tthis.lineStartOffsetByLineIdx = [];\n\t\tthis.lineStartOffsetByLineIdx.push(0);\n\t\tfor (let i = 0; i < text.length; i++) {\n\t\t\tif (text.charAt(i) === '\\n') {\n\t\t\t\tthis.lineStartOffsetByLineIdx.push(i + 1);\n\t\t\t}\n\t\t}\n\t}\n\n\tgetOffset(position: Position): number {\n\t\treturn this.lineStartOffsetByLineIdx[position.lineNumber - 1] + position.column - 1;\n\t}\n\n\tgetOffsetRange(range: Range): OffsetRange {\n\t\treturn new OffsetRange(\n\t\t\tthis.getOffset(range.getStartPosition()),\n\t\t\tthis.getOffset(range.getEndPosition())\n\t\t);\n\t}\n\n\tget textLength(): TextLength {\n\t\tconst lineIdx = this.lineStartOffsetByLineIdx.length - 1;\n\t\treturn new TextLength(lineIdx, this.text.length - this.lineStartOffsetByLineIdx[lineIdx]);\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { assertFn, checkAdjacentItems } from 'vs/base/common/assert';\nimport { BugIndicatingError } from 'vs/base/common/errors';\nimport { ISingleEditOperation } from 'vs/editor/common/core/editOperation';\nimport { Position } from 'vs/editor/common/core/position';\nimport { PositionOffsetTransformer } from 'vs/editor/common/core/positionToOffset';\nimport { Range } from 'vs/editor/common/core/range';\nimport { TextLength } from 'vs/editor/common/core/textLength';\n\nexport class TextEdit {\n\n\tconstructor(public readonly edits: readonly SingleTextEdit[]) {\n\t\tassertFn(() => checkAdjacentItems(edits, (a, b) => a.range.getEndPosition().isBeforeOrEqual(b.range.getStartPosition())));\n\t}\n\n\tapply(text: AbstractText): string {\n\t\tlet result = '';\n\t\tlet lastEditEnd = new Position(1, 1);\n\t\tfor (const edit of this.edits) {\n\t\t\tconst editRange = edit.range;\n\t\t\tconst editStart = editRange.getStartPosition();\n\t\t\tconst editEnd = editRange.getEndPosition();\n\n\t\t\tconst r = rangeFromPositions(lastEditEnd, editStart);\n\t\t\tif (!r.isEmpty()) {\n\t\t\t\tresult += text.getValueOfRange(r);\n\t\t\t}\n\t\t\tresult += edit.text;\n\t\t\tlastEditEnd = editEnd;\n\t\t}\n\t\tconst r = rangeFromPositions(lastEditEnd, text.endPositionExclusive);\n\t\tif (!r.isEmpty()) {\n\t\t\tresult += text.getValueOfRange(r);\n\t\t}\n\t\treturn result;\n\t}\n\n\tapplyToString(str: string): string {\n\t\tconst strText = new StringText(str);\n\t\treturn this.apply(strText);\n\t}\n\n\tgetNewRanges(): Range[] {\n\t\tconst newRanges: Range[] = [];\n\t\tlet previousEditEndLineNumber = 0;\n\t\tlet lineOffset = 0;\n\t\tlet columnOffset = 0;\n\t\tfor (const edit of this.edits) {\n\t\t\tconst textLength = TextLength.ofText(edit.text);\n\t\t\tconst newRangeStart = Position.lift({\n\t\t\t\tlineNumber: edit.range.startLineNumber + lineOffset,\n\t\t\t\tcolumn: edit.range.startColumn + (edit.range.startLineNumber === previousEditEndLineNumber ? columnOffset : 0)\n\t\t\t});\n\t\t\tconst newRange = textLength.createRange(newRangeStart);\n\t\t\tnewRanges.push(newRange);\n\t\t\tlineOffset = newRange.endLineNumber - edit.range.endLineNumber;\n\t\t\tcolumnOffset = newRange.endColumn - edit.range.endColumn;\n\t\t\tpreviousEditEndLineNumber = edit.range.endLineNumber;\n\t\t}\n\t\treturn newRanges;\n\t}\n}\n\nexport class SingleTextEdit {\n\tconstructor(\n\t\tpublic readonly range: Range,\n\t\tpublic readonly text: string,\n\t) {\n\t}\n\n\tpublic toSingleEditOperation(): ISingleEditOperation {\n\t\treturn {\n\t\t\trange: this.range,\n\t\t\ttext: this.text,\n\t\t};\n\t}\n}\n\nfunction rangeFromPositions(start: Position, end: Position): Range {\n\tif (start.lineNumber === end.lineNumber && start.column === Number.MAX_SAFE_INTEGER) {\n\t\treturn Range.fromPositions(end, end);\n\t} else if (!start.isBeforeOrEqual(end)) {\n\t\tthrow new BugIndicatingError('start must be before end');\n\t}\n\treturn new Range(start.lineNumber, start.column, end.lineNumber, end.column);\n}\n\nexport abstract class AbstractText {\n\tabstract getValueOfRange(range: Range): string;\n\tabstract readonly length: TextLength;\n\n\tget endPositionExclusive(): Position {\n\t\treturn this.length.addToPosition(new Position(1, 1));\n\t}\n}\n\nexport class StringText extends AbstractText {\n\tprivate readonly _t = new PositionOffsetTransformer(this.value);\n\n\tconstructor(public readonly value: string) {\n\t\tsuper();\n\t}\n\n\tgetValueOfRange(range: Range): string {\n\t\treturn this._t.getOffsetRange(range).substring(this.value);\n\t}\n\n\tget length(): TextLength {\n\t\treturn this._t.textLength;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\nimport { LRUCache } from 'vs/base/common/map';\nimport { CharacterClassifier } from 'vs/editor/common/core/characterClassifier';\n\nexport const enum WordCharacterClass {\n\tRegular = 0,\n\tWhitespace = 1,\n\tWordSeparator = 2\n}\n\nexport class WordCharacterClassifier extends CharacterClassifier<WordCharacterClass> {\n\n\tpublic readonly intlSegmenterLocales: Intl.UnicodeBCP47LocaleIdentifier[];\n\tprivate readonly _segmenter: Intl.Segmenter | null = null;\n\tprivate _cachedLine: string | null = null;\n\tprivate _cachedSegments: IntlWordSegmentData[] = [];\n\n\tconstructor(wordSeparators: string, intlSegmenterLocales: Intl.UnicodeBCP47LocaleIdentifier[]) {\n\t\tsuper(WordCharacterClass.Regular);\n\t\tthis.intlSegmenterLocales = intlSegmenterLocales;\n\t\tif (this.intlSegmenterLocales.length > 0) {\n\t\t\tthis._segmenter = new Intl.Segmenter(this.intlSegmenterLocales, { granularity: 'word' });\n\t\t} else {\n\t\t\tthis._segmenter = null;\n\t\t}\n\n\t\tfor (let i = 0, len = wordSeparators.length; i < len; i++) {\n\t\t\tthis.set(wordSeparators.charCodeAt(i), WordCharacterClass.WordSeparator);\n\t\t}\n\n\t\tthis.set(CharCode.Space, WordCharacterClass.Whitespace);\n\t\tthis.set(CharCode.Tab, WordCharacterClass.Whitespace);\n\t}\n\n\tpublic findPrevIntlWordBeforeOrAtOffset(line: string, offset: number): IntlWordSegmentData | null {\n\t\tlet candidate: IntlWordSegmentData | null = null;\n\t\tfor (const segment of this._getIntlSegmenterWordsOnLine(line)) {\n\t\t\tif (segment.index > offset) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcandidate = segment;\n\t\t}\n\t\treturn candidate;\n\t}\n\n\tpublic findNextIntlWordAtOrAfterOffset(lineContent: string, offset: number): IntlWordSegmentData | null {\n\t\tfor (const segment of this._getIntlSegmenterWordsOnLine(lineContent)) {\n\t\t\tif (segment.index < offset) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn segment;\n\t\t}\n\t\treturn null;\n\t}\n\n\tprivate _getIntlSegmenterWordsOnLine(line: string): IntlWordSegmentData[] {\n\t\tif (!this._segmenter) {\n\t\t\treturn [];\n\t\t}\n\n\t\t// Check if the line has changed from the previous call\n\t\tif (this._cachedLine === line) {\n\t\t\treturn this._cachedSegments;\n\t\t}\n\n\t\t// Update the cache with the new line\n\t\tthis._cachedLine = line;\n\t\tthis._cachedSegments = this._filterWordSegments(this._segmenter.segment(line));\n\n\t\treturn this._cachedSegments;\n\t}\n\n\tprivate _filterWordSegments(segments: Intl.Segments): IntlWordSegmentData[] {\n\t\tconst result: IntlWordSegmentData[] = [];\n\t\tfor (const segment of segments) {\n\t\t\tif (this._isWordLike(segment)) {\n\t\t\t\tresult.push(segment);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tprivate _isWordLike(segment: Intl.SegmentData): segment is IntlWordSegmentData {\n\t\tif (segment.isWordLike) {\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n}\n\nexport interface IntlWordSegmentData extends Intl.SegmentData {\n\tisWordLike: true;\n}\n\nconst wordClassifierCache = new LRUCache<string, WordCharacterClassifier>(10);\n\nexport function getMapForWordSeparators(wordSeparators: string, intlSegmenterLocales: Intl.UnicodeBCP47LocaleIdentifier[]): WordCharacterClassifier {\n\tconst key = `${wordSeparators}/${intlSegmenterLocales.join(',')}`;\n\tlet result = wordClassifierCache.get(key)!;\n\tif (!result) {\n\t\tresult = new WordCharacterClassifier(wordSeparators, intlSegmenterLocales);\n\t\twordClassifierCache.set(key, result);\n\t}\n\treturn result;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { Iterable } from 'vs/base/common/iterator';\nimport { LinkedList } from 'vs/base/common/linkedList';\n\nexport const USUAL_WORD_SEPARATORS = '`~!@#$%^&*()-=+[{]}\\\\|;:\\'\",.<>/?';\n\n/**\n * Word inside a model.\n */\nexport interface IWordAtPosition {\n\t/**\n\t * The word.\n\t */\n\treadonly word: string;\n\t/**\n\t * The column where the word starts.\n\t */\n\treadonly startColumn: number;\n\t/**\n\t * The column where the word ends.\n\t */\n\treadonly endColumn: number;\n}\n\n/**\n * Create a word definition regular expression based on default word separators.\n * Optionally provide allowed separators that should be included in words.\n *\n * The default would look like this:\n * /(-?\\d*\\.\\d\\w*)|([^\\`\\~\\!\\@\\#\\$\\%\\^\\&\\*\\(\\)\\-\\=\\+\\[\\{\\]\\}\\\\\\|\\;\\:\\'\\\"\\,\\.\\<\\>\\/\\?\\s]+)/g\n */\nfunction createWordRegExp(allowInWords: string = ''): RegExp {\n\tlet source = '(-?\\\\d*\\\\.\\\\d\\\\w*)|([^';\n\tfor (const sep of USUAL_WORD_SEPARATORS) {\n\t\tif (allowInWords.indexOf(sep) >= 0) {\n\t\t\tcontinue;\n\t\t}\n\t\tsource += '\\\\' + sep;\n\t}\n\tsource += '\\\\s]+)';\n\treturn new RegExp(source, 'g');\n}\n\n// catches numbers (including floating numbers) in the first group, and alphanum in the second\nexport const DEFAULT_WORD_REGEXP = createWordRegExp();\n\nexport function ensureValidWordDefinition(wordDefinition?: RegExp | null): RegExp {\n\tlet result: RegExp = DEFAULT_WORD_REGEXP;\n\n\tif (wordDefinition && (wordDefinition instanceof RegExp)) {\n\t\tif (!wordDefinition.global) {\n\t\t\tlet flags = 'g';\n\t\t\tif (wordDefinition.ignoreCase) {\n\t\t\t\tflags += 'i';\n\t\t\t}\n\t\t\tif (wordDefinition.multiline) {\n\t\t\t\tflags += 'm';\n\t\t\t}\n\t\t\tif (wordDefinition.unicode) {\n\t\t\t\tflags += 'u';\n\t\t\t}\n\t\t\tresult = new RegExp(wordDefinition.source, flags);\n\t\t} else {\n\t\t\tresult = wordDefinition;\n\t\t}\n\t}\n\n\tresult.lastIndex = 0;\n\n\treturn result;\n}\n\n\nexport interface IGetWordAtTextConfig {\n\tmaxLen: number;\n\twindowSize: number;\n\ttimeBudget: number;\n}\n\n\nconst _defaultConfig = new LinkedList<IGetWordAtTextConfig>();\n_defaultConfig.unshift({\n\tmaxLen: 1000,\n\twindowSize: 15,\n\ttimeBudget: 150\n});\n\nexport function getWordAtText(column: number, wordDefinition: RegExp, text: string, textOffset: number, config?: IGetWordAtTextConfig): IWordAtPosition | null {\n\t// Ensure the regex has the 'g' flag, otherwise this will loop forever\n\twordDefinition = ensureValidWordDefinition(wordDefinition);\n\n\tif (!config) {\n\t\tconfig = Iterable.first(_defaultConfig)!;\n\t}\n\n\tif (text.length > config.maxLen) {\n\t\t// don't throw strings that long at the regexp\n\t\t// but use a sub-string in which a word must occur\n\t\tlet start = column - config.maxLen / 2;\n\t\tif (start < 0) {\n\t\t\tstart = 0;\n\t\t} else {\n\t\t\ttextOffset += start;\n\t\t}\n\t\ttext = text.substring(start, column + config.maxLen / 2);\n\t\treturn getWordAtText(column, wordDefinition, text, textOffset, config);\n\t}\n\n\tconst t1 = Date.now();\n\tconst pos = column - 1 - textOffset;\n\n\tlet prevRegexIndex = -1;\n\tlet match: RegExpExecArray | null = null;\n\n\tfor (let i = 1; ; i++) {\n\t\t// check time budget\n\t\tif (Date.now() - t1 >= config.timeBudget) {\n\t\t\tbreak;\n\t\t}\n\n\t\t// reset the index at which the regexp should start matching, also know where it\n\t\t// should stop so that subsequent search don't repeat previous searches\n\t\tconst regexIndex = pos - config.windowSize * i;\n\t\twordDefinition.lastIndex = Math.max(0, regexIndex);\n\t\tconst thisMatch = _findRegexMatchEnclosingPosition(wordDefinition, text, pos, prevRegexIndex);\n\n\t\tif (!thisMatch && match) {\n\t\t\t// stop: we have something\n\t\t\tbreak;\n\t\t}\n\n\t\tmatch = thisMatch;\n\n\t\t// stop: searched at start\n\t\tif (regexIndex <= 0) {\n\t\t\tbreak;\n\t\t}\n\t\tprevRegexIndex = regexIndex;\n\t}\n\n\tif (match) {\n\t\tconst result = {\n\t\t\tword: match[0],\n\t\t\tstartColumn: textOffset + 1 + match.index,\n\t\t\tendColumn: textOffset + 1 + match.index + match[0].length\n\t\t};\n\t\twordDefinition.lastIndex = 0;\n\t\treturn result;\n\t}\n\n\treturn null;\n}\n\nfunction _findRegexMatchEnclosingPosition(wordDefinition: RegExp, text: string, pos: number, stopPos: number): RegExpExecArray | null {\n\tlet match: RegExpExecArray | null;\n\twhile (match = wordDefinition.exec(text)) {\n\t\tconst matchIndex = match.index || 0;\n\t\tif (matchIndex <= pos && wordDefinition.lastIndex >= pos) {\n\t\t\treturn match;\n\t\t} else if (stopPos > 0 && matchIndex > stopPos) {\n\t\t\treturn null;\n\t\t}\n\t}\n\treturn null;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { forEachAdjacent } from 'vs/base/common/arrays';\nimport { BugIndicatingError } from 'vs/base/common/errors';\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\n\n/**\n * Represents a synchronous diff algorithm. Should be executed in a worker.\n*/\nexport interface IDiffAlgorithm {\n}\n\nexport class DiffAlgorithmResult {\n\tstatic trivial(seq1: ISequence, seq2: ISequence): DiffAlgorithmResult {\n\t\treturn new DiffAlgorithmResult([new SequenceDiff(OffsetRange.ofLength(seq1.length), OffsetRange.ofLength(seq2.length))], false);\n\t}\n\n\tstatic trivialTimedOut(seq1: ISequence, seq2: ISequence): DiffAlgorithmResult {\n\t\treturn new DiffAlgorithmResult([new SequenceDiff(OffsetRange.ofLength(seq1.length), OffsetRange.ofLength(seq2.length))], true);\n\t}\n\n\tconstructor(\n\t\tpublic readonly diffs: SequenceDiff[],\n\t\t/**\n\t\t * Indicates if the time out was reached.\n\t\t * In that case, the diffs might be an approximation and the user should be asked to rerun the diff with more time.\n\t\t */\n\t\tpublic readonly hitTimeout: boolean,\n\t) { }\n}\n\nexport class SequenceDiff {\n\tpublic static invert(sequenceDiffs: SequenceDiff[], doc1Length: number): SequenceDiff[] {\n\t\tconst result: SequenceDiff[] = [];\n\t\tforEachAdjacent(sequenceDiffs, (a, b) => {\n\t\t\tresult.push(SequenceDiff.fromOffsetPairs(\n\t\t\t\ta ? a.getEndExclusives() : OffsetPair.zero,\n\t\t\t\tb ? b.getStarts() : new OffsetPair(doc1Length, (a ? a.seq2Range.endExclusive - a.seq1Range.endExclusive : 0) + doc1Length)\n\t\t\t));\n\t\t});\n\t\treturn result;\n\t}\n\n\tpublic static fromOffsetPairs(start: OffsetPair, endExclusive: OffsetPair): SequenceDiff {\n\t\treturn new SequenceDiff(\n\t\t\tnew OffsetRange(start.offset1, endExclusive.offset1),\n\t\t\tnew OffsetRange(start.offset2, endExclusive.offset2),\n\t\t);\n\t}\n\n\tpublic static assertSorted(sequenceDiffs: SequenceDiff[]): void {\n\t\tlet last: SequenceDiff | undefined = undefined;\n\t\tfor (const cur of sequenceDiffs) {\n\t\t\tif (last) {\n\t\t\t\tif (!(last.seq1Range.endExclusive <= cur.seq1Range.start && last.seq2Range.endExclusive <= cur.seq2Range.start)) {\n\t\t\t\t\tthrow new BugIndicatingError('Sequence diffs must be sorted');\n\t\t\t\t}\n\t\t\t}\n\t\t\tlast = cur;\n\t\t}\n\t}\n\n\tconstructor(\n\t\tpublic readonly seq1Range: OffsetRange,\n\t\tpublic readonly seq2Range: OffsetRange,\n\t) { }\n\n\tpublic swap(): SequenceDiff {\n\t\treturn new SequenceDiff(this.seq2Range, this.seq1Range);\n\t}\n\n\tpublic toString(): string {\n\t\treturn `${this.seq1Range} <-> ${this.seq2Range}`;\n\t}\n\n\tpublic join(other: SequenceDiff): SequenceDiff {\n\t\treturn new SequenceDiff(this.seq1Range.join(other.seq1Range), this.seq2Range.join(other.seq2Range));\n\t}\n\n\tpublic delta(offset: number): SequenceDiff {\n\t\tif (offset === 0) {\n\t\t\treturn this;\n\t\t}\n\t\treturn new SequenceDiff(this.seq1Range.delta(offset), this.seq2Range.delta(offset));\n\t}\n\n\tpublic deltaStart(offset: number): SequenceDiff {\n\t\tif (offset === 0) {\n\t\t\treturn this;\n\t\t}\n\t\treturn new SequenceDiff(this.seq1Range.deltaStart(offset), this.seq2Range.deltaStart(offset));\n\t}\n\n\tpublic deltaEnd(offset: number): SequenceDiff {\n\t\tif (offset === 0) {\n\t\t\treturn this;\n\t\t}\n\t\treturn new SequenceDiff(this.seq1Range.deltaEnd(offset), this.seq2Range.deltaEnd(offset));\n\t}\n\n\tpublic intersect(other: SequenceDiff): SequenceDiff | undefined {\n\t\tconst i1 = this.seq1Range.intersect(other.seq1Range);\n\t\tconst i2 = this.seq2Range.intersect(other.seq2Range);\n\t\tif (!i1 || !i2) {\n\t\t\treturn undefined;\n\t\t}\n\t\treturn new SequenceDiff(i1, i2);\n\t}\n\n\tpublic getStarts(): OffsetPair {\n\t\treturn new OffsetPair(this.seq1Range.start, this.seq2Range.start);\n\t}\n\n\tpublic getEndExclusives(): OffsetPair {\n\t\treturn new OffsetPair(this.seq1Range.endExclusive, this.seq2Range.endExclusive);\n\t}\n}\n\nexport class OffsetPair {\n\tpublic static readonly zero = new OffsetPair(0, 0);\n\tpublic static readonly max = new OffsetPair(Number.MAX_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);\n\n\tconstructor(\n\t\tpublic readonly offset1: number,\n\t\tpublic readonly offset2: number,\n\t) {\n\t}\n\n\tpublic toString(): string {\n\t\treturn `${this.offset1} <-> ${this.offset2}`;\n\t}\n\n\tpublic delta(offset: number): OffsetPair {\n\t\tif (offset === 0) {\n\t\t\treturn this;\n\t\t}\n\t\treturn new OffsetPair(this.offset1 + offset, this.offset2 + offset);\n\t}\n\n\tpublic equals(other: OffsetPair): boolean {\n\t\treturn this.offset1 === other.offset1 && this.offset2 === other.offset2;\n\t}\n}\n\nexport interface ISequence {\n\tgetElement(offset: number): number;\n\tget length(): number;\n\n\t/**\n\t * The higher the score, the better that offset can be used to split the sequence.\n\t * Is used to optimize insertions.\n\t * Must not be negative.\n\t*/\n\tgetBoundaryScore?(length: number): number;\n\n\t/**\n\t * For line sequences, getElement returns a number representing trimmed lines.\n\t * This however checks equality for the original lines.\n\t * It prevents shifting to less matching lines.\n\t */\n\tisStronglyEqual(offset1: number, offset2: number): boolean;\n}\n\nexport interface ITimeout {\n\tisValid(): boolean;\n}\n\nexport class InfiniteTimeout implements ITimeout {\n\tpublic static instance = new InfiniteTimeout();\n\n\tisValid(): boolean {\n\t\treturn true;\n\t}\n}\n\nexport class DateTimeout implements ITimeout {\n\tprivate readonly startTime = Date.now();\n\tprivate valid = true;\n\n\tconstructor(private timeout: number) {\n\t\tif (timeout <= 0) {\n\t\t\tthrow new BugIndicatingError('timeout must be positive');\n\t\t}\n\t}\n\n\t// Recommendation: Set a log-point `{this.disable()}` in the body\n\tpublic isValid(): boolean {\n\t\tconst valid = Date.now() - this.startTime < this.timeout;\n\t\tif (!valid && this.valid) {\n\t\t\tthis.valid = false; // timeout reached\n\t\t\t// eslint-disable-next-line no-debugger\n\t\t\tdebugger; // WARNING: Most likely debugging caused the timeout. Call `this.disable()` to continue without timing out.\n\t\t}\n\t\treturn this.valid;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\nimport { DiffAlgorithmResult, IDiffAlgorithm, ISequence, ITimeout, InfiniteTimeout, SequenceDiff } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm';\n\n/**\n * An O(ND) diff algorithm that has a quadratic space worst-case complexity.\n*/\nexport class MyersDiffAlgorithm implements IDiffAlgorithm {\n\tcompute(seq1: ISequence, seq2: ISequence, timeout: ITimeout = InfiniteTimeout.instance): DiffAlgorithmResult {\n\t\t// These are common special cases.\n\t\t// The early return improves performance dramatically.\n\t\tif (seq1.length === 0 || seq2.length === 0) {\n\t\t\treturn DiffAlgorithmResult.trivial(seq1, seq2);\n\t\t}\n\n\t\tconst seqX = seq1; // Text on the x axis\n\t\tconst seqY = seq2; // Text on the y axis\n\n\t\tfunction getXAfterSnake(x: number, y: number): number {\n\t\t\twhile (x < seqX.length && y < seqY.length && seqX.getElement(x) === seqY.getElement(y)) {\n\t\t\t\tx++;\n\t\t\t\ty++;\n\t\t\t}\n\t\t\treturn x;\n\t\t}\n\n\t\tlet d = 0;\n\t\t// V[k]: X value of longest d-line that ends in diagonal k.\n\t\t// d-line: path from (0,0) to (x,y) that uses exactly d non-diagonals.\n\t\t// diagonal k: Set of points (x,y) with x-y = k.\n\t\t// k=1 -> (1,0),(2,1)\n\t\tconst V = new FastInt32Array();\n\t\tV.set(0, getXAfterSnake(0, 0));\n\n\t\tconst paths = new FastArrayNegativeIndices<SnakePath | null>();\n\t\tpaths.set(0, V.get(0) === 0 ? null : new SnakePath(null, 0, 0, V.get(0)));\n\n\t\tlet k = 0;\n\n\t\tloop: while (true) {\n\t\t\td++;\n\t\t\tif (!timeout.isValid()) {\n\t\t\t\treturn DiffAlgorithmResult.trivialTimedOut(seqX, seqY);\n\t\t\t}\n\t\t\t// The paper has `for (k = -d; k <= d; k += 2)`, but we can ignore diagonals that cannot influence the result.\n\t\t\tconst lowerBound = -Math.min(d, seqY.length + (d % 2));\n\t\t\tconst upperBound = Math.min(d, seqX.length + (d % 2));\n\t\t\tfor (k = lowerBound; k <= upperBound; k += 2) {\n\t\t\t\tlet step = 0;\n\t\t\t\t// We can use the X values of (d-1)-lines to compute X value of the longest d-lines.\n\t\t\t\tconst maxXofDLineTop = k === upperBound ? -1 : V.get(k + 1); // We take a vertical non-diagonal (add a symbol in seqX)\n\t\t\t\tconst maxXofDLineLeft = k === lowerBound ? -1 : V.get(k - 1) + 1; // We take a horizontal non-diagonal (+1 x) (delete a symbol in seqX)\n\t\t\t\tstep++;\n\t\t\t\tconst x = Math.min(Math.max(maxXofDLineTop, maxXofDLineLeft), seqX.length);\n\t\t\t\tconst y = x - k;\n\t\t\t\tstep++;\n\t\t\t\tif (x > seqX.length || y > seqY.length) {\n\t\t\t\t\t// This diagonal is irrelevant for the result.\n\t\t\t\t\t// TODO: Don't pay the cost for this in the next iteration.\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst newMaxX = getXAfterSnake(x, y);\n\t\t\t\tV.set(k, newMaxX);\n\t\t\t\tconst lastPath = x === maxXofDLineTop ? paths.get(k + 1) : paths.get(k - 1);\n\t\t\t\tpaths.set(k, newMaxX !== x ? new SnakePath(lastPath, x, y, newMaxX - x) : lastPath);\n\n\t\t\t\tif (V.get(k) === seqX.length && V.get(k) - k === seqY.length) {\n\t\t\t\t\tbreak loop;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlet path = paths.get(k);\n\t\tconst result: SequenceDiff[] = [];\n\t\tlet lastAligningPosS1: number = seqX.length;\n\t\tlet lastAligningPosS2: number = seqY.length;\n\n\t\twhile (true) {\n\t\t\tconst endX = path ? path.x + path.length : 0;\n\t\t\tconst endY = path ? path.y + path.length : 0;\n\n\t\t\tif (endX !== lastAligningPosS1 || endY !== lastAligningPosS2) {\n\t\t\t\tresult.push(new SequenceDiff(\n\t\t\t\t\tnew OffsetRange(endX, lastAligningPosS1),\n\t\t\t\t\tnew OffsetRange(endY, lastAligningPosS2),\n\t\t\t\t));\n\t\t\t}\n\t\t\tif (!path) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tlastAligningPosS1 = path.x;\n\t\t\tlastAligningPosS2 = path.y;\n\n\t\t\tpath = path.prev;\n\t\t}\n\n\t\tresult.reverse();\n\t\treturn new DiffAlgorithmResult(result, false);\n\t}\n}\n\nclass SnakePath {\n\tconstructor(\n\t\tpublic readonly prev: SnakePath | null,\n\t\tpublic readonly x: number,\n\t\tpublic readonly y: number,\n\t\tpublic readonly length: number\n\t) {\n\t}\n}\n\n/**\n * An array that supports fast negative indices.\n*/\nclass FastInt32Array {\n\tprivate positiveArr: Int32Array = new Int32Array(10);\n\tprivate negativeArr: Int32Array = new Int32Array(10);\n\n\tget(idx: number): number {\n\t\tif (idx < 0) {\n\t\t\tidx = -idx - 1;\n\t\t\treturn this.negativeArr[idx];\n\t\t} else {\n\t\t\treturn this.positiveArr[idx];\n\t\t}\n\t}\n\n\tset(idx: number, value: number): void {\n\t\tif (idx < 0) {\n\t\t\tidx = -idx - 1;\n\t\t\tif (idx >= this.negativeArr.length) {\n\t\t\t\tconst arr = this.negativeArr;\n\t\t\t\tthis.negativeArr = new Int32Array(arr.length * 2);\n\t\t\t\tthis.negativeArr.set(arr);\n\t\t\t}\n\t\t\tthis.negativeArr[idx] = value;\n\t\t} else {\n\t\t\tif (idx >= this.positiveArr.length) {\n\t\t\t\tconst arr = this.positiveArr;\n\t\t\t\tthis.positiveArr = new Int32Array(arr.length * 2);\n\t\t\t\tthis.positiveArr.set(arr);\n\t\t\t}\n\t\t\tthis.positiveArr[idx] = value;\n\t\t}\n\t}\n}\n\n/**\n * An array that supports fast negative indices.\n*/\nclass FastArrayNegativeIndices<T> {\n\tprivate readonly positiveArr: T[] = [];\n\tprivate readonly negativeArr: T[] = [];\n\n\tget(idx: number): T {\n\t\tif (idx < 0) {\n\t\t\tidx = -idx - 1;\n\t\t\treturn this.negativeArr[idx];\n\t\t} else {\n\t\t\treturn this.positiveArr[idx];\n\t\t}\n\t}\n\n\tset(idx: number, value: T): void {\n\t\tif (idx < 0) {\n\t\t\tidx = -idx - 1;\n\t\t\tthis.negativeArr[idx] = value;\n\t\t} else {\n\t\t\tthis.positiveArr[idx] = value;\n\t\t}\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { forEachWithNeighbors } from 'vs/base/common/arrays';\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\nimport { ISequence, OffsetPair, SequenceDiff } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm';\nimport { LineSequence } from 'vs/editor/common/diff/defaultLinesDiffComputer/lineSequence';\nimport { LinesSliceCharSequence } from 'vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence';\n\nexport function optimizeSequenceDiffs(sequence1: ISequence, sequence2: ISequence, sequenceDiffs: SequenceDiff[]): SequenceDiff[] {\n\tlet result = sequenceDiffs;\n\tresult = joinSequenceDiffsByShifting(sequence1, sequence2, result);\n\t// Sometimes, calling this function twice improves the result.\n\t// Uncomment the second invocation and run the tests to see the difference.\n\tresult = joinSequenceDiffsByShifting(sequence1, sequence2, result);\n\tresult = shiftSequenceDiffs(sequence1, sequence2, result);\n\treturn result;\n}\n\n/**\n * This function fixes issues like this:\n * ```\n * import { Baz, Bar } from \"foo\";\n * ```\n * <->\n * ```\n * import { Baz, Bar, Foo } from \"foo\";\n * ```\n * Computed diff: [ {Add \",\" after Bar}, {Add \"Foo \" after space} }\n * Improved diff: [{Add \", Foo\" after Bar}]\n */\nfunction joinSequenceDiffsByShifting(sequence1: ISequence, sequence2: ISequence, sequenceDiffs: SequenceDiff[]): SequenceDiff[] {\n\tif (sequenceDiffs.length === 0) {\n\t\treturn sequenceDiffs;\n\t}\n\n\tconst result: SequenceDiff[] = [];\n\tresult.push(sequenceDiffs[0]);\n\n\t// First move them all to the left as much as possible and join them if possible\n\tfor (let i = 1; i < sequenceDiffs.length; i++) {\n\t\tconst prevResult = result[result.length - 1];\n\t\tlet cur = sequenceDiffs[i];\n\n\t\tif (cur.seq1Range.isEmpty || cur.seq2Range.isEmpty) {\n\t\t\tconst length = cur.seq1Range.start - prevResult.seq1Range.endExclusive;\n\t\t\tlet d;\n\t\t\tfor (d = 1; d <= length; d++) {\n\t\t\t\tif (\n\t\t\t\t\tsequence1.getElement(cur.seq1Range.start - d) !== sequence1.getElement(cur.seq1Range.endExclusive - d) ||\n\t\t\t\t\tsequence2.getElement(cur.seq2Range.start - d) !== sequence2.getElement(cur.seq2Range.endExclusive - d)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\td--;\n\n\t\t\tif (d === length) {\n\t\t\t\t// Merge previous and current diff\n\t\t\t\tresult[result.length - 1] = new SequenceDiff(\n\t\t\t\t\tnew OffsetRange(prevResult.seq1Range.start, cur.seq1Range.endExclusive - length),\n\t\t\t\t\tnew OffsetRange(prevResult.seq2Range.start, cur.seq2Range.endExclusive - length),\n\t\t\t\t);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tcur = cur.delta(-d);\n\t\t}\n\n\t\tresult.push(cur);\n\t}\n\n\tconst result2: SequenceDiff[] = [];\n\t// Then move them all to the right and join them again if possible\n\tfor (let i = 0; i < result.length - 1; i++) {\n\t\tconst nextResult = result[i + 1];\n\t\tlet cur = result[i];\n\n\t\tif (cur.seq1Range.isEmpty || cur.seq2Range.isEmpty) {\n\t\t\tconst length = nextResult.seq1Range.start - cur.seq1Range.endExclusive;\n\t\t\tlet d;\n\t\t\tfor (d = 0; d < length; d++) {\n\t\t\t\tif (\n\t\t\t\t\t!sequence1.isStronglyEqual(cur.seq1Range.start + d, cur.seq1Range.endExclusive + d) ||\n\t\t\t\t\t!sequence2.isStronglyEqual(cur.seq2Range.start + d, cur.seq2Range.endExclusive + d)\n\t\t\t\t) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (d === length) {\n\t\t\t\t// Merge previous and current diff, write to result!\n\t\t\t\tresult[i + 1] = new SequenceDiff(\n\t\t\t\t\tnew OffsetRange(cur.seq1Range.start + length, nextResult.seq1Range.endExclusive),\n\t\t\t\t\tnew OffsetRange(cur.seq2Range.start + length, nextResult.seq2Range.endExclusive),\n\t\t\t\t);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (d > 0) {\n\t\t\t\tcur = cur.delta(d);\n\t\t\t}\n\t\t}\n\n\t\tresult2.push(cur);\n\t}\n\n\tif (result.length > 0) {\n\t\tresult2.push(result[result.length - 1]);\n\t}\n\n\treturn result2;\n}\n\n// align character level diffs at whitespace characters\n// import { IBar } from \"foo\";\n// import { I[Arr, I]Bar } from \"foo\";\n// ->\n// import { [IArr, ]IBar } from \"foo\";\n\n// import { ITransaction, observableValue, transaction } from 'vs/base/common/observable';\n// import { ITransaction, observable[FromEvent, observable]Value, transaction } from 'vs/base/common/observable';\n// ->\n// import { ITransaction, [observableFromEvent, ]observableValue, transaction } from 'vs/base/common/observable';\n\n// collectBrackets(level + 1, levelPerBracketType);\n// collectBrackets(level + 1, levelPerBracket[ + 1, levelPerBracket]Type);\n// ->\n// collectBrackets(level + 1, [levelPerBracket + 1, ]levelPerBracketType);\n\nfunction shiftSequenceDiffs(sequence1: ISequence, sequence2: ISequence, sequenceDiffs: SequenceDiff[]): SequenceDiff[] {\n\tif (!sequence1.getBoundaryScore || !sequence2.getBoundaryScore) {\n\t\treturn sequenceDiffs;\n\t}\n\n\tfor (let i = 0; i < sequenceDiffs.length; i++) {\n\t\tconst prevDiff = (i > 0 ? sequenceDiffs[i - 1] : undefined);\n\t\tconst diff = sequenceDiffs[i];\n\t\tconst nextDiff = (i + 1 < sequenceDiffs.length ? sequenceDiffs[i + 1] : undefined);\n\n\t\tconst seq1ValidRange = new OffsetRange(prevDiff ? prevDiff.seq1Range.endExclusive + 1 : 0, nextDiff ? nextDiff.seq1Range.start - 1 : sequence1.length);\n\t\tconst seq2ValidRange = new OffsetRange(prevDiff ? prevDiff.seq2Range.endExclusive + 1 : 0, nextDiff ? nextDiff.seq2Range.start - 1 : sequence2.length);\n\n\t\tif (diff.seq1Range.isEmpty) {\n\t\t\tsequenceDiffs[i] = shiftDiffToBetterPosition(diff, sequence1, sequence2, seq1ValidRange, seq2ValidRange);\n\t\t} else if (diff.seq2Range.isEmpty) {\n\t\t\tsequenceDiffs[i] = shiftDiffToBetterPosition(diff.swap(), sequence2, sequence1, seq2ValidRange, seq1ValidRange).swap();\n\t\t}\n\t}\n\n\treturn sequenceDiffs;\n}\n\nfunction shiftDiffToBetterPosition(diff: SequenceDiff, sequence1: ISequence, sequence2: ISequence, seq1ValidRange: OffsetRange, seq2ValidRange: OffsetRange,) {\n\tconst maxShiftLimit = 100; // To prevent performance issues\n\n\t// don't touch previous or next!\n\tlet deltaBefore = 1;\n\twhile (\n\t\tdiff.seq1Range.start - deltaBefore >= seq1ValidRange.start &&\n\t\tdiff.seq2Range.start - deltaBefore >= seq2ValidRange.start &&\n\t\tsequence2.isStronglyEqual(diff.seq2Range.start - deltaBefore, diff.seq2Range.endExclusive - deltaBefore) && deltaBefore < maxShiftLimit\n\t) {\n\t\tdeltaBefore++;\n\t}\n\tdeltaBefore--;\n\n\tlet deltaAfter = 0;\n\twhile (\n\t\tdiff.seq1Range.start + deltaAfter < seq1ValidRange.endExclusive &&\n\t\tdiff.seq2Range.endExclusive + deltaAfter < seq2ValidRange.endExclusive &&\n\t\tsequence2.isStronglyEqual(diff.seq2Range.start + deltaAfter, diff.seq2Range.endExclusive + deltaAfter) && deltaAfter < maxShiftLimit\n\t) {\n\t\tdeltaAfter++;\n\t}\n\n\tif (deltaBefore === 0 && deltaAfter === 0) {\n\t\treturn diff;\n\t}\n\n\t// Visualize `[sequence1.text, diff.seq1Range.start + deltaAfter]`\n\t// and `[sequence2.text, diff.seq2Range.start + deltaAfter, diff.seq2Range.endExclusive + deltaAfter]`\n\n\tlet bestDelta = 0;\n\tlet bestScore = -1;\n\t// find best scored delta\n\tfor (let delta = -deltaBefore; delta <= deltaAfter; delta++) {\n\t\tconst seq2OffsetStart = diff.seq2Range.start + delta;\n\t\tconst seq2OffsetEndExclusive = diff.seq2Range.endExclusive + delta;\n\t\tconst seq1Offset = diff.seq1Range.start + delta;\n\n\t\tconst score = sequence1.getBoundaryScore!(seq1Offset) + sequence2.getBoundaryScore!(seq2OffsetStart) + sequence2.getBoundaryScore!(seq2OffsetEndExclusive);\n\t\tif (score > bestScore) {\n\t\t\tbestScore = score;\n\t\t\tbestDelta = delta;\n\t\t}\n\t}\n\n\treturn diff.delta(bestDelta);\n}\n\nexport function removeShortMatches(sequence1: ISequence, sequence2: ISequence, sequenceDiffs: SequenceDiff[]): SequenceDiff[] {\n\tconst result: SequenceDiff[] = [];\n\tfor (const s of sequenceDiffs) {\n\t\tconst last = result[result.length - 1];\n\t\tif (!last) {\n\t\t\tresult.push(s);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (s.seq1Range.start - last.seq1Range.endExclusive <= 2 || s.seq2Range.start - last.seq2Range.endExclusive <= 2) {\n\t\t\tresult[result.length - 1] = new SequenceDiff(last.seq1Range.join(s.seq1Range), last.seq2Range.join(s.seq2Range));\n\t\t} else {\n\t\t\tresult.push(s);\n\t\t}\n\t}\n\n\treturn result;\n}\n\nexport function extendDiffsToEntireWordIfAppropriate(sequence1: LinesSliceCharSequence, sequence2: LinesSliceCharSequence, sequenceDiffs: SequenceDiff[]): SequenceDiff[] {\n\tconst equalMappings = SequenceDiff.invert(sequenceDiffs, sequence1.length);\n\n\tconst additional: SequenceDiff[] = [];\n\n\tlet lastPoint = new OffsetPair(0, 0);\n\n\tfunction scanWord(pair: OffsetPair, equalMapping: SequenceDiff) {\n\t\tif (pair.offset1 < lastPoint.offset1 || pair.offset2 < lastPoint.offset2) {\n\t\t\treturn;\n\t\t}\n\n\t\tconst w1 = sequence1.findWordContaining(pair.offset1);\n\t\tconst w2 = sequence2.findWordContaining(pair.offset2);\n\t\tif (!w1 || !w2) {\n\t\t\treturn;\n\t\t}\n\t\tlet w = new SequenceDiff(w1, w2);\n\t\tconst equalPart = w.intersect(equalMapping)!;\n\n\t\tlet equalChars1 = equalPart.seq1Range.length;\n\t\tlet equalChars2 = equalPart.seq2Range.length;\n\n\t\t// The words do not touch previous equals mappings, as we would have processed them already.\n\t\t// But they might touch the next ones.\n\n\t\twhile (equalMappings.length > 0) {\n\t\t\tconst next = equalMappings[0];\n\t\t\tconst intersects = next.seq1Range.intersects(w.seq1Range) || next.seq2Range.intersects(w.seq2Range);\n\t\t\tif (!intersects) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst v1 = sequence1.findWordContaining(next.seq1Range.start);\n\t\t\tconst v2 = sequence2.findWordContaining(next.seq2Range.start);\n\t\t\t// Because there is an intersection, we know that the words are not empty.\n\t\t\tconst v = new SequenceDiff(v1!, v2!);\n\t\t\tconst equalPart = v.intersect(next)!;\n\n\t\t\tequalChars1 += equalPart.seq1Range.length;\n\t\t\tequalChars2 += equalPart.seq2Range.length;\n\n\t\t\tw = w.join(v);\n\n\t\t\tif (w.seq1Range.endExclusive >= next.seq1Range.endExclusive) {\n\t\t\t\t// The word extends beyond the next equal mapping.\n\t\t\t\tequalMappings.shift();\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (equalChars1 + equalChars2 < (w.seq1Range.length + w.seq2Range.length) * 2 / 3) {\n\t\t\tadditional.push(w);\n\t\t}\n\n\t\tlastPoint = w.getEndExclusives();\n\t}\n\n\twhile (equalMappings.length > 0) {\n\t\tconst next = equalMappings.shift()!;\n\t\tif (next.seq1Range.isEmpty) {\n\t\t\tcontinue;\n\t\t}\n\t\tscanWord(next.getStarts(), next);\n\t\t// The equal parts are not empty, so -1 gives us a character that is equal in both parts.\n\t\tscanWord(next.getEndExclusives().delta(-1), next);\n\t}\n\n\tconst merged = mergeSequenceDiffs(sequenceDiffs, additional);\n\treturn merged;\n}\n\nfunction mergeSequenceDiffs(sequenceDiffs1: SequenceDiff[], sequenceDiffs2: SequenceDiff[]): SequenceDiff[] {\n\tconst result: SequenceDiff[] = [];\n\n\twhile (sequenceDiffs1.length > 0 || sequenceDiffs2.length > 0) {\n\t\tconst sd1 = sequenceDiffs1[0];\n\t\tconst sd2 = sequenceDiffs2[0];\n\n\t\tlet next: SequenceDiff;\n\t\tif (sd1 && (!sd2 || sd1.seq1Range.start < sd2.seq1Range.start)) {\n\t\t\tnext = sequenceDiffs1.shift()!;\n\t\t} else {\n\t\t\tnext = sequenceDiffs2.shift()!;\n\t\t}\n\n\t\tif (result.length > 0 && result[result.length - 1].seq1Range.endExclusive >= next.seq1Range.start) {\n\t\t\tresult[result.length - 1] = result[result.length - 1].join(next);\n\t\t} else {\n\t\t\tresult.push(next);\n\t\t}\n\t}\n\n\treturn result;\n}\n\nexport function removeVeryShortMatchingLinesBetweenDiffs(sequence1: LineSequence, _sequence2: LineSequence, sequenceDiffs: SequenceDiff[]): SequenceDiff[] {\n\tlet diffs = sequenceDiffs;\n\tif (diffs.length === 0) {\n\t\treturn diffs;\n\t}\n\n\tlet counter = 0;\n\tlet shouldRepeat: boolean;\n\tdo {\n\t\tshouldRepeat = false;\n\n\t\tconst result: SequenceDiff[] = [\n\t\t\tdiffs[0]\n\t\t];\n\n\t\tfor (let i = 1; i < diffs.length; i++) {\n\t\t\tconst cur = diffs[i];\n\t\t\tconst lastResult = result[result.length - 1];\n\n\t\t\tfunction shouldJoinDiffs(before: SequenceDiff, after: SequenceDiff): boolean {\n\t\t\t\tconst unchangedRange = new OffsetRange(lastResult.seq1Range.endExclusive, cur.seq1Range.start);\n\n\t\t\t\tconst unchangedText = sequence1.getText(unchangedRange);\n\t\t\t\tconst unchangedTextWithoutWs = unchangedText.replace(/\\s/g, '');\n\t\t\t\tif (unchangedTextWithoutWs.length <= 4\n\t\t\t\t\t&& (before.seq1Range.length + before.seq2Range.length > 5 || after.seq1Range.length + after.seq2Range.length > 5)) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tconst shouldJoin = shouldJoinDiffs(lastResult, cur);\n\t\t\tif (shouldJoin) {\n\t\t\t\tshouldRepeat = true;\n\t\t\t\tresult[result.length - 1] = result[result.length - 1].join(cur);\n\t\t\t} else {\n\t\t\t\tresult.push(cur);\n\t\t\t}\n\t\t}\n\n\t\tdiffs = result;\n\t} while (counter++ < 10 && shouldRepeat);\n\n\treturn diffs;\n}\n\nexport function removeVeryShortMatchingTextBetweenLongDiffs(sequence1: LinesSliceCharSequence, sequence2: LinesSliceCharSequence, sequenceDiffs: SequenceDiff[]): SequenceDiff[] {\n\tlet diffs = sequenceDiffs;\n\tif (diffs.length === 0) {\n\t\treturn diffs;\n\t}\n\n\tlet counter = 0;\n\tlet shouldRepeat: boolean;\n\tdo {\n\t\tshouldRepeat = false;\n\n\t\tconst result: SequenceDiff[] = [\n\t\t\tdiffs[0]\n\t\t];\n\n\t\tfor (let i = 1; i < diffs.length; i++) {\n\t\t\tconst cur = diffs[i];\n\t\t\tconst lastResult = result[result.length - 1];\n\n\t\t\tfunction shouldJoinDiffs(before: SequenceDiff, after: SequenceDiff): boolean {\n\t\t\t\tconst unchangedRange = new OffsetRange(lastResult.seq1Range.endExclusive, cur.seq1Range.start);\n\n\t\t\t\tconst unchangedLineCount = sequence1.countLinesIn(unchangedRange);\n\t\t\t\tif (unchangedLineCount > 5 || unchangedRange.length > 500) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tconst unchangedText = sequence1.getText(unchangedRange).trim();\n\t\t\t\tif (unchangedText.length > 20 || unchangedText.split(/\\r\\n|\\r|\\n/).length > 1) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\tconst beforeLineCount1 = sequence1.countLinesIn(before.seq1Range);\n\t\t\t\tconst beforeSeq1Length = before.seq1Range.length;\n\t\t\t\tconst beforeLineCount2 = sequence2.countLinesIn(before.seq2Range);\n\t\t\t\tconst beforeSeq2Length = before.seq2Range.length;\n\n\t\t\t\tconst afterLineCount1 = sequence1.countLinesIn(after.seq1Range);\n\t\t\t\tconst afterSeq1Length = after.seq1Range.length;\n\t\t\t\tconst afterLineCount2 = sequence2.countLinesIn(after.seq2Range);\n\t\t\t\tconst afterSeq2Length = after.seq2Range.length;\n\n\t\t\t\t// TODO: Maybe a neural net can be used to derive the result from these numbers\n\n\t\t\t\tconst max = 2 * 40 + 50;\n\t\t\t\tfunction cap(v: number): number {\n\t\t\t\t\treturn Math.min(v, max);\n\t\t\t\t}\n\n\t\t\t\tif (Math.pow(Math.pow(cap(beforeLineCount1 * 40 + beforeSeq1Length), 1.5) + Math.pow(cap(beforeLineCount2 * 40 + beforeSeq2Length), 1.5), 1.5)\n\t\t\t\t\t+ Math.pow(Math.pow(cap(afterLineCount1 * 40 + afterSeq1Length), 1.5) + Math.pow(cap(afterLineCount2 * 40 + afterSeq2Length), 1.5), 1.5) > ((max ** 1.5) ** 1.5) * 1.3) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tconst shouldJoin = shouldJoinDiffs(lastResult, cur);\n\t\t\tif (shouldJoin) {\n\t\t\t\tshouldRepeat = true;\n\t\t\t\tresult[result.length - 1] = result[result.length - 1].join(cur);\n\t\t\t} else {\n\t\t\t\tresult.push(cur);\n\t\t\t}\n\t\t}\n\n\t\tdiffs = result;\n\t} while (counter++ < 10 && shouldRepeat);\n\n\tconst newDiffs: SequenceDiff[] = [];\n\n\t// Remove short suffixes/prefixes\n\tforEachWithNeighbors(diffs, (prev, cur, next) => {\n\t\tlet newDiff = cur;\n\n\t\tfunction shouldMarkAsChanged(text: string): boolean {\n\t\t\treturn text.length > 0 && text.trim().length <= 3 && cur.seq1Range.length + cur.seq2Range.length > 100;\n\t\t}\n\n\t\tconst fullRange1 = sequence1.extendToFullLines(cur.seq1Range);\n\t\tconst prefix = sequence1.getText(new OffsetRange(fullRange1.start, cur.seq1Range.start));\n\t\tif (shouldMarkAsChanged(prefix)) {\n\t\t\tnewDiff = newDiff.deltaStart(-prefix.length);\n\t\t}\n\t\tconst suffix = sequence1.getText(new OffsetRange(cur.seq1Range.endExclusive, fullRange1.endExclusive));\n\t\tif (shouldMarkAsChanged(suffix)) {\n\t\t\tnewDiff = newDiff.deltaEnd(suffix.length);\n\t\t}\n\n\t\tconst availableSpace = SequenceDiff.fromOffsetPairs(\n\t\t\tprev ? prev.getEndExclusives() : OffsetPair.zero,\n\t\t\tnext ? next.getStarts() : OffsetPair.max,\n\t\t);\n\t\tconst result = newDiff.intersect(availableSpace)!;\n\t\tif (newDiffs.length > 0 && result.getStarts().equals(newDiffs[newDiffs.length - 1].getEndExclusives())) {\n\t\t\tnewDiffs[newDiffs.length - 1] = newDiffs[newDiffs.length - 1].join(result);\n\t\t} else {\n\t\t\tnewDiffs.push(result);\n\t\t}\n\t});\n\n\treturn newDiffs;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\nimport { ISequence } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm';\n\nexport class LineSequence implements ISequence {\n\tconstructor(\n\t\tprivate readonly trimmedHash: number[],\n\t\tprivate readonly lines: string[]\n\t) { }\n\n\tgetElement(offset: number): number {\n\t\treturn this.trimmedHash[offset];\n\t}\n\n\tget length(): number {\n\t\treturn this.trimmedHash.length;\n\t}\n\n\tgetBoundaryScore(length: number): number {\n\t\tconst indentationBefore = length === 0 ? 0 : getIndentation(this.lines[length - 1]);\n\t\tconst indentationAfter = length === this.lines.length ? 0 : getIndentation(this.lines[length]);\n\t\treturn 1000 - (indentationBefore + indentationAfter);\n\t}\n\n\tgetText(range: OffsetRange): string {\n\t\treturn this.lines.slice(range.start, range.endExclusive).join('\\n');\n\t}\n\n\tisStronglyEqual(offset1: number, offset2: number): boolean {\n\t\treturn this.lines[offset1] === this.lines[offset2];\n\t}\n}\n\nfunction getIndentation(str: string): number {\n\tlet i = 0;\n\twhile (i < str.length && (str.charCodeAt(i) === CharCode.Space || str.charCodeAt(i) === CharCode.Tab)) {\n\t\ti++;\n\t}\n\treturn i;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\nimport { LineRange } from 'vs/editor/common/core/lineRange';\nimport { DetailedLineRangeMapping } from 'vs/editor/common/diff/rangeMapping';\n\nexport class Array2D<T> {\n\tprivate readonly array: T[] = [];\n\n\tconstructor(public readonly width: number, public readonly height: number) {\n\t\tthis.array = new Array<T>(width * height);\n\t}\n\n\tget(x: number, y: number): T {\n\t\treturn this.array[x + y * this.width];\n\t}\n\n\tset(x: number, y: number, value: T): void {\n\t\tthis.array[x + y * this.width] = value;\n\t}\n}\n\nexport function isSpace(charCode: number): boolean {\n\treturn charCode === CharCode.Space || charCode === CharCode.Tab;\n}\n\nexport class LineRangeFragment {\n\tprivate static chrKeys = new Map<string, number>();\n\n\tprivate static getKey(chr: string): number {\n\t\tlet key = this.chrKeys.get(chr);\n\t\tif (key === undefined) {\n\t\t\tkey = this.chrKeys.size;\n\t\t\tthis.chrKeys.set(chr, key);\n\t\t}\n\t\treturn key;\n\t}\n\n\tprivate readonly totalCount: number;\n\tprivate readonly histogram: number[] = [];\n\tconstructor(\n\t\tpublic readonly range: LineRange,\n\t\tpublic readonly lines: string[],\n\t\tpublic readonly source: DetailedLineRangeMapping,\n\t) {\n\t\tlet counter = 0;\n\t\tfor (let i = range.startLineNumber - 1; i < range.endLineNumberExclusive - 1; i++) {\n\t\t\tconst line = lines[i];\n\t\t\tfor (let j = 0; j < line.length; j++) {\n\t\t\t\tcounter++;\n\t\t\t\tconst chr = line[j];\n\t\t\t\tconst key = LineRangeFragment.getKey(chr);\n\t\t\t\tthis.histogram[key] = (this.histogram[key] || 0) + 1;\n\t\t\t}\n\t\t\tcounter++;\n\t\t\tconst key = LineRangeFragment.getKey('\\n');\n\t\t\tthis.histogram[key] = (this.histogram[key] || 0) + 1;\n\t\t}\n\n\t\tthis.totalCount = counter;\n\t}\n\n\tpublic computeSimilarity(other: LineRangeFragment): number {\n\t\tlet sumDifferences = 0;\n\t\tconst maxLength = Math.max(this.histogram.length, other.histogram.length);\n\t\tfor (let i = 0; i < maxLength; i++) {\n\t\t\tsumDifferences += Math.abs((this.histogram[i] ?? 0) - (other.histogram[i] ?? 0));\n\t\t}\n\t\treturn 1 - (sumDifferences / (this.totalCount + other.totalCount));\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\nimport { IDiffAlgorithm, SequenceDiff, ISequence, ITimeout, InfiniteTimeout, DiffAlgorithmResult } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm';\nimport { Array2D } from 'vs/editor/common/diff/defaultLinesDiffComputer/utils';\n\n/**\n * A O(MN) diffing algorithm that supports a score function.\n * The algorithm can be improved by processing the 2d array diagonally.\n*/\nexport class DynamicProgrammingDiffing implements IDiffAlgorithm {\n\tcompute(sequence1: ISequence, sequence2: ISequence, timeout: ITimeout = InfiniteTimeout.instance, equalityScore?: (offset1: number, offset2: number) => number): DiffAlgorithmResult {\n\t\tif (sequence1.length === 0 || sequence2.length === 0) {\n\t\t\treturn DiffAlgorithmResult.trivial(sequence1, sequence2);\n\t\t}\n\n\t\t/**\n\t\t * lcsLengths.get(i, j): Length of the longest common subsequence of sequence1.substring(0, i + 1) and sequence2.substring(0, j + 1).\n\t\t */\n\t\tconst lcsLengths = new Array2D<number>(sequence1.length, sequence2.length);\n\t\tconst directions = new Array2D<number>(sequence1.length, sequence2.length);\n\t\tconst lengths = new Array2D<number>(sequence1.length, sequence2.length);\n\n\t\t// ==== Initializing lcsLengths ====\n\t\tfor (let s1 = 0; s1 < sequence1.length; s1++) {\n\t\t\tfor (let s2 = 0; s2 < sequence2.length; s2++) {\n\t\t\t\tif (!timeout.isValid()) {\n\t\t\t\t\treturn DiffAlgorithmResult.trivialTimedOut(sequence1, sequence2);\n\t\t\t\t}\n\n\t\t\t\tconst horizontalLen = s1 === 0 ? 0 : lcsLengths.get(s1 - 1, s2);\n\t\t\t\tconst verticalLen = s2 === 0 ? 0 : lcsLengths.get(s1, s2 - 1);\n\n\t\t\t\tlet extendedSeqScore: number;\n\t\t\t\tif (sequence1.getElement(s1) === sequence2.getElement(s2)) {\n\t\t\t\t\tif (s1 === 0 || s2 === 0) {\n\t\t\t\t\t\textendedSeqScore = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\textendedSeqScore = lcsLengths.get(s1 - 1, s2 - 1);\n\t\t\t\t\t}\n\t\t\t\t\tif (s1 > 0 && s2 > 0 && directions.get(s1 - 1, s2 - 1) === 3) {\n\t\t\t\t\t\t// Prefer consecutive diagonals\n\t\t\t\t\t\textendedSeqScore += lengths.get(s1 - 1, s2 - 1);\n\t\t\t\t\t}\n\t\t\t\t\textendedSeqScore += (equalityScore ? equalityScore(s1, s2) : 1);\n\t\t\t\t} else {\n\t\t\t\t\textendedSeqScore = -1;\n\t\t\t\t}\n\n\t\t\t\tconst newValue = Math.max(horizontalLen, verticalLen, extendedSeqScore);\n\n\t\t\t\tif (newValue === extendedSeqScore) {\n\t\t\t\t\t// Prefer diagonals\n\t\t\t\t\tconst prevLen = s1 > 0 && s2 > 0 ? lengths.get(s1 - 1, s2 - 1) : 0;\n\t\t\t\t\tlengths.set(s1, s2, prevLen + 1);\n\t\t\t\t\tdirections.set(s1, s2, 3);\n\t\t\t\t} else if (newValue === horizontalLen) {\n\t\t\t\t\tlengths.set(s1, s2, 0);\n\t\t\t\t\tdirections.set(s1, s2, 1);\n\t\t\t\t} else if (newValue === verticalLen) {\n\t\t\t\t\tlengths.set(s1, s2, 0);\n\t\t\t\t\tdirections.set(s1, s2, 2);\n\t\t\t\t}\n\n\t\t\t\tlcsLengths.set(s1, s2, newValue);\n\t\t\t}\n\t\t}\n\n\t\t// ==== Backtracking ====\n\t\tconst result: SequenceDiff[] = [];\n\t\tlet lastAligningPosS1: number = sequence1.length;\n\t\tlet lastAligningPosS2: number = sequence2.length;\n\n\t\tfunction reportDecreasingAligningPositions(s1: number, s2: number): void {\n\t\t\tif (s1 + 1 !== lastAligningPosS1 || s2 + 1 !== lastAligningPosS2) {\n\t\t\t\tresult.push(new SequenceDiff(\n\t\t\t\t\tnew OffsetRange(s1 + 1, lastAligningPosS1),\n\t\t\t\t\tnew OffsetRange(s2 + 1, lastAligningPosS2),\n\t\t\t\t));\n\t\t\t}\n\t\t\tlastAligningPosS1 = s1;\n\t\t\tlastAligningPosS2 = s2;\n\t\t}\n\n\t\tlet s1 = sequence1.length - 1;\n\t\tlet s2 = sequence2.length - 1;\n\t\twhile (s1 >= 0 && s2 >= 0) {\n\t\t\tif (directions.get(s1, s2) === 3) {\n\t\t\t\treportDecreasingAligningPositions(s1, s2);\n\t\t\t\ts1--;\n\t\t\t\ts2--;\n\t\t\t} else {\n\t\t\t\tif (directions.get(s1, s2) === 1) {\n\t\t\t\t\ts1--;\n\t\t\t\t} else {\n\t\t\t\t\ts2--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treportDecreasingAligningPositions(-1, -1);\n\t\tresult.reverse();\n\t\treturn new DiffAlgorithmResult(result, false);\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { findLastIdxMonotonous, findLastMonotonous, findFirstMonotonous } from 'vs/base/common/arraysFind';\nimport { CharCode } from 'vs/base/common/charCode';\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\nimport { Position } from 'vs/editor/common/core/position';\nimport { Range } from 'vs/editor/common/core/range';\nimport { ISequence } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm';\nimport { isSpace } from 'vs/editor/common/diff/defaultLinesDiffComputer/utils';\n\nexport class LinesSliceCharSequence implements ISequence {\n\tprivate readonly elements: number[] = [];\n\tprivate readonly firstElementOffsetByLineIdx: number[] = [];\n\tprivate readonly lineStartOffsets: number[] = [];\n\tprivate readonly trimmedWsLengthsByLineIdx: number[] = [];\n\n\tconstructor(public readonly lines: string[], private readonly range: Range, public readonly considerWhitespaceChanges: boolean) {\n\t\tthis.firstElementOffsetByLineIdx.push(0);\n\t\tfor (let lineNumber = this.range.startLineNumber; lineNumber <= this.range.endLineNumber; lineNumber++) {\n\t\t\tlet line = lines[lineNumber - 1];\n\t\t\tlet lineStartOffset = 0;\n\t\t\tif (lineNumber === this.range.startLineNumber && this.range.startColumn > 1) {\n\t\t\t\tlineStartOffset = this.range.startColumn - 1;\n\t\t\t\tline = line.substring(lineStartOffset);\n\t\t\t}\n\t\t\tthis.lineStartOffsets.push(lineStartOffset);\n\n\t\t\tlet trimmedWsLength = 0;\n\t\t\tif (!considerWhitespaceChanges) {\n\t\t\t\tconst trimmedStartLine = line.trimStart();\n\t\t\t\ttrimmedWsLength = line.length - trimmedStartLine.length;\n\t\t\t\tline = trimmedStartLine.trimEnd();\n\t\t\t}\n\t\t\tthis.trimmedWsLengthsByLineIdx.push(trimmedWsLength);\n\n\t\t\tconst lineLength = lineNumber === this.range.endLineNumber ? Math.min(this.range.endColumn - 1 - lineStartOffset - trimmedWsLength, line.length) : line.length;\n\t\t\tfor (let i = 0; i < lineLength; i++) {\n\t\t\t\tthis.elements.push(line.charCodeAt(i));\n\t\t\t}\n\n\t\t\tif (lineNumber < this.range.endLineNumber) {\n\t\t\t\tthis.elements.push('\\n'.charCodeAt(0));\n\t\t\t\tthis.firstElementOffsetByLineIdx.push(this.elements.length);\n\t\t\t}\n\t\t}\n\t}\n\n\ttoString() {\n\t\treturn `Slice: \"${this.text}\"`;\n\t}\n\n\tget text(): string {\n\t\treturn this.getText(new OffsetRange(0, this.length));\n\t}\n\n\tgetText(range: OffsetRange): string {\n\t\treturn this.elements.slice(range.start, range.endExclusive).map(e => String.fromCharCode(e)).join('');\n\t}\n\n\tgetElement(offset: number): number {\n\t\treturn this.elements[offset];\n\t}\n\n\tget length(): number {\n\t\treturn this.elements.length;\n\t}\n\n\tpublic getBoundaryScore(length: number): number {\n\t\t//   a   b   c   ,           d   e   f\n\t\t// 11  0   0   12  15  6   13  0   0   11\n\n\t\tconst prevCategory = getCategory(length > 0 ? this.elements[length - 1] : -1);\n\t\tconst nextCategory = getCategory(length < this.elements.length ? this.elements[length] : -1);\n\n\t\tif (prevCategory === CharBoundaryCategory.LineBreakCR && nextCategory === CharBoundaryCategory.LineBreakLF) {\n\t\t\t// don't break between \\r and \\n\n\t\t\treturn 0;\n\t\t}\n\t\tif (prevCategory === CharBoundaryCategory.LineBreakLF) {\n\t\t\t// prefer the linebreak before the change\n\t\t\treturn 150;\n\t\t}\n\n\t\tlet score = 0;\n\t\tif (prevCategory !== nextCategory) {\n\t\t\tscore += 10;\n\t\t\tif (prevCategory === CharBoundaryCategory.WordLower && nextCategory === CharBoundaryCategory.WordUpper) {\n\t\t\t\tscore += 1;\n\t\t\t}\n\t\t}\n\n\t\tscore += getCategoryBoundaryScore(prevCategory);\n\t\tscore += getCategoryBoundaryScore(nextCategory);\n\n\t\treturn score;\n\t}\n\n\tpublic translateOffset(offset: number, preference: 'left' | 'right' = 'right'): Position {\n\t\t// find smallest i, so that lineBreakOffsets[i] <= offset using binary search\n\t\tconst i = findLastIdxMonotonous(this.firstElementOffsetByLineIdx, (value) => value <= offset);\n\t\tconst lineOffset = offset - this.firstElementOffsetByLineIdx[i];\n\t\treturn new Position(\n\t\t\tthis.range.startLineNumber + i,\n\t\t\t1 + this.lineStartOffsets[i] + lineOffset + ((lineOffset === 0 && preference === 'left') ? 0 : this.trimmedWsLengthsByLineIdx[i])\n\t\t);\n\t}\n\n\tpublic translateRange(range: OffsetRange): Range {\n\t\tconst pos1 = this.translateOffset(range.start, 'right');\n\t\tconst pos2 = this.translateOffset(range.endExclusive, 'left');\n\t\tif (pos2.isBefore(pos1)) {\n\t\t\treturn Range.fromPositions(pos2, pos2);\n\t\t}\n\t\treturn Range.fromPositions(pos1, pos2);\n\t}\n\n\t/**\n\t * Finds the word that contains the character at the given offset\n\t */\n\tpublic findWordContaining(offset: number): OffsetRange | undefined {\n\t\tif (offset < 0 || offset >= this.elements.length) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tif (!isWordChar(this.elements[offset])) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t// find start\n\t\tlet start = offset;\n\t\twhile (start > 0 && isWordChar(this.elements[start - 1])) {\n\t\t\tstart--;\n\t\t}\n\n\t\t// find end\n\t\tlet end = offset;\n\t\twhile (end < this.elements.length && isWordChar(this.elements[end])) {\n\t\t\tend++;\n\t\t}\n\n\t\treturn new OffsetRange(start, end);\n\t}\n\n\tpublic countLinesIn(range: OffsetRange): number {\n\t\treturn this.translateOffset(range.endExclusive).lineNumber - this.translateOffset(range.start).lineNumber;\n\t}\n\n\tpublic isStronglyEqual(offset1: number, offset2: number): boolean {\n\t\treturn this.elements[offset1] === this.elements[offset2];\n\t}\n\n\tpublic extendToFullLines(range: OffsetRange): OffsetRange {\n\t\tconst start = findLastMonotonous(this.firstElementOffsetByLineIdx, x => x <= range.start) ?? 0;\n\t\tconst end = findFirstMonotonous(this.firstElementOffsetByLineIdx, x => range.endExclusive <= x) ?? this.elements.length;\n\t\treturn new OffsetRange(start, end);\n\t}\n}\n\nfunction isWordChar(charCode: number): boolean {\n\treturn charCode >= CharCode.a && charCode <= CharCode.z\n\t\t|| charCode >= CharCode.A && charCode <= CharCode.Z\n\t\t|| charCode >= CharCode.Digit0 && charCode <= CharCode.Digit9;\n}\n\nconst enum CharBoundaryCategory {\n\tWordLower,\n\tWordUpper,\n\tWordNumber,\n\tEnd,\n\tOther,\n\tSeparator,\n\tSpace,\n\tLineBreakCR,\n\tLineBreakLF,\n}\n\nconst score: Record<CharBoundaryCategory, number> = {\n\t[CharBoundaryCategory.WordLower]: 0,\n\t[CharBoundaryCategory.WordUpper]: 0,\n\t[CharBoundaryCategory.WordNumber]: 0,\n\t[CharBoundaryCategory.End]: 10,\n\t[CharBoundaryCategory.Other]: 2,\n\t[CharBoundaryCategory.Separator]: 30,\n\t[CharBoundaryCategory.Space]: 3,\n\t[CharBoundaryCategory.LineBreakCR]: 10,\n\t[CharBoundaryCategory.LineBreakLF]: 10,\n};\n\nfunction getCategoryBoundaryScore(category: CharBoundaryCategory): number {\n\treturn score[category];\n}\n\nfunction getCategory(charCode: number): CharBoundaryCategory {\n\tif (charCode === CharCode.LineFeed) {\n\t\treturn CharBoundaryCategory.LineBreakLF;\n\t} else if (charCode === CharCode.CarriageReturn) {\n\t\treturn CharBoundaryCategory.LineBreakCR;\n\t} else if (isSpace(charCode)) {\n\t\treturn CharBoundaryCategory.Space;\n\t} else if (charCode >= CharCode.a && charCode <= CharCode.z) {\n\t\treturn CharBoundaryCategory.WordLower;\n\t} else if (charCode >= CharCode.A && charCode <= CharCode.Z) {\n\t\treturn CharBoundaryCategory.WordUpper;\n\t} else if (charCode >= CharCode.Digit0 && charCode <= CharCode.Digit9) {\n\t\treturn CharBoundaryCategory.WordNumber;\n\t} else if (charCode === -1) {\n\t\treturn CharBoundaryCategory.End;\n\t} else if (charCode === CharCode.Comma || charCode === CharCode.Semicolon) {\n\t\treturn CharBoundaryCategory.Separator;\n\t} else {\n\t\treturn CharBoundaryCategory.Other;\n\t}\n}\n\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { DetailedLineRangeMapping, LineRangeMapping } from './rangeMapping';\n\nexport interface ILinesDiffComputer {\n\tcomputeDiff(originalLines: string[], modifiedLines: string[], options: ILinesDiffComputerOptions): LinesDiff;\n}\n\nexport interface ILinesDiffComputerOptions {\n\treadonly ignoreTrimWhitespace: boolean;\n\treadonly maxComputationTimeMs: number;\n\treadonly computeMoves: boolean;\n}\n\nexport class LinesDiff {\n\tconstructor(\n\t\treadonly changes: readonly DetailedLineRangeMapping[],\n\n\t\t/**\n\t\t * Sorted by original line ranges.\n\t\t * The original line ranges and the modified line ranges must be disjoint (but can be touching).\n\t\t */\n\t\treadonly moves: readonly MovedText[],\n\n\t\t/**\n\t\t * Indicates if the time out was reached.\n\t\t * In that case, the diffs might be an approximation and the user should be asked to rerun the diff with more time.\n\t\t */\n\t\treadonly hitTimeout: boolean,\n\t) {\n\t}\n}\n\nexport class MovedText {\n\tpublic readonly lineRangeMapping: LineRangeMapping;\n\n\t/**\n\t * The diff from the original text to the moved text.\n\t * Must be contained in the original/modified line range.\n\t * Can be empty if the text didn't change (only moved).\n\t */\n\tpublic readonly changes: readonly DetailedLineRangeMapping[];\n\n\tconstructor(\n\t\tlineRangeMapping: LineRangeMapping,\n\t\tchanges: readonly DetailedLineRangeMapping[],\n\t) {\n\t\tthis.lineRangeMapping = lineRangeMapping;\n\t\tthis.changes = changes;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { BugIndicatingError } from 'vs/base/common/errors';\nimport { LineRange } from 'vs/editor/common/core/lineRange';\nimport { Position } from 'vs/editor/common/core/position';\nimport { Range } from 'vs/editor/common/core/range';\nimport { AbstractText, SingleTextEdit } from 'vs/editor/common/core/textEdit';\n\n/**\n * Maps a line range in the original text model to a line range in the modified text model.\n */\nexport class LineRangeMapping {\n\tpublic static inverse(mapping: readonly LineRangeMapping[], originalLineCount: number, modifiedLineCount: number): LineRangeMapping[] {\n\t\tconst result: LineRangeMapping[] = [];\n\t\tlet lastOriginalEndLineNumber = 1;\n\t\tlet lastModifiedEndLineNumber = 1;\n\n\t\tfor (const m of mapping) {\n\t\t\tconst r = new LineRangeMapping(\n\t\t\t\tnew LineRange(lastOriginalEndLineNumber, m.original.startLineNumber),\n\t\t\t\tnew LineRange(lastModifiedEndLineNumber, m.modified.startLineNumber),\n\t\t\t);\n\t\t\tif (!r.modified.isEmpty) {\n\t\t\t\tresult.push(r);\n\t\t\t}\n\t\t\tlastOriginalEndLineNumber = m.original.endLineNumberExclusive;\n\t\t\tlastModifiedEndLineNumber = m.modified.endLineNumberExclusive;\n\t\t}\n\t\tconst r = new LineRangeMapping(\n\t\t\tnew LineRange(lastOriginalEndLineNumber, originalLineCount + 1),\n\t\t\tnew LineRange(lastModifiedEndLineNumber, modifiedLineCount + 1),\n\t\t);\n\t\tif (!r.modified.isEmpty) {\n\t\t\tresult.push(r);\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic static clip(mapping: readonly LineRangeMapping[], originalRange: LineRange, modifiedRange: LineRange): LineRangeMapping[] {\n\t\tconst result: LineRangeMapping[] = [];\n\t\tfor (const m of mapping) {\n\t\t\tconst original = m.original.intersect(originalRange);\n\t\t\tconst modified = m.modified.intersect(modifiedRange);\n\t\t\tif (original && !original.isEmpty && modified && !modified.isEmpty) {\n\t\t\t\tresult.push(new LineRangeMapping(original, modified));\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * The line range in the original text model.\n\t */\n\tpublic readonly original: LineRange;\n\n\t/**\n\t * The line range in the modified text model.\n\t */\n\tpublic readonly modified: LineRange;\n\n\tconstructor(\n\t\toriginalRange: LineRange,\n\t\tmodifiedRange: LineRange\n\t) {\n\t\tthis.original = originalRange;\n\t\tthis.modified = modifiedRange;\n\t}\n\n\n\tpublic toString(): string {\n\t\treturn `{${this.original.toString()}->${this.modified.toString()}}`;\n\t}\n\n\tpublic flip(): LineRangeMapping {\n\t\treturn new LineRangeMapping(this.modified, this.original);\n\t}\n\n\tpublic join(other: LineRangeMapping): LineRangeMapping {\n\t\treturn new LineRangeMapping(\n\t\t\tthis.original.join(other.original),\n\t\t\tthis.modified.join(other.modified)\n\t\t);\n\t}\n\n\t/**\n\t * This method assumes that the LineRangeMapping describes a valid diff!\n\t * I.e. if one range is empty, the other range cannot be the entire document.\n\t * It avoids various problems when the line range points to non-existing line-numbers.\n\t*/\n\tpublic toRangeMapping(): RangeMapping {\n\t\tconst origInclusiveRange = this.original.toInclusiveRange();\n\t\tconst modInclusiveRange = this.modified.toInclusiveRange();\n\t\tif (origInclusiveRange && modInclusiveRange) {\n\t\t\treturn new RangeMapping(origInclusiveRange, modInclusiveRange);\n\t\t} else if (this.original.startLineNumber === 1 || this.modified.startLineNumber === 1) {\n\t\t\tif (!(this.modified.startLineNumber === 1 && this.original.startLineNumber === 1)) {\n\t\t\t\t// If one line range starts at 1, the other one must start at 1 as well.\n\t\t\t\tthrow new BugIndicatingError('not a valid diff');\n\t\t\t}\n\n\t\t\t// Because one range is empty and both ranges start at line 1, none of the ranges can cover all lines.\n\t\t\t// Thus, `endLineNumberExclusive` is a valid line number.\n\t\t\treturn new RangeMapping(\n\t\t\t\tnew Range(this.original.startLineNumber, 1, this.original.endLineNumberExclusive, 1),\n\t\t\t\tnew Range(this.modified.startLineNumber, 1, this.modified.endLineNumberExclusive, 1),\n\t\t\t);\n\t\t} else {\n\t\t\t// We can assume here that both startLineNumbers are greater than 1.\n\t\t\treturn new RangeMapping(\n\t\t\t\tnew Range(this.original.startLineNumber - 1, Number.MAX_SAFE_INTEGER, this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER),\n\t\t\t\tnew Range(this.modified.startLineNumber - 1, Number.MAX_SAFE_INTEGER, this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER),\n\t\t\t);\n\t\t}\n\t}\n\n\t/**\n\t * This method assumes that the LineRangeMapping describes a valid diff!\n\t * I.e. if one range is empty, the other range cannot be the entire document.\n\t * It avoids various problems when the line range points to non-existing line-numbers.\n\t*/\n\tpublic toRangeMapping2(original: string[], modified: string[]): RangeMapping {\n\t\tif (isValidLineNumber(this.original.endLineNumberExclusive, original)\n\t\t\t&& isValidLineNumber(this.modified.endLineNumberExclusive, modified)) {\n\t\t\treturn new RangeMapping(\n\t\t\t\tnew Range(this.original.startLineNumber, 1, this.original.endLineNumberExclusive, 1),\n\t\t\t\tnew Range(this.modified.startLineNumber, 1, this.modified.endLineNumberExclusive, 1),\n\t\t\t);\n\t\t}\n\n\t\tif (!this.original.isEmpty && !this.modified.isEmpty) {\n\t\t\treturn new RangeMapping(\n\t\t\t\tRange.fromPositions(\n\t\t\t\t\tnew Position(this.original.startLineNumber, 1),\n\t\t\t\t\tnormalizePosition(new Position(this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), original)\n\t\t\t\t),\n\t\t\t\tRange.fromPositions(\n\t\t\t\t\tnew Position(this.modified.startLineNumber, 1),\n\t\t\t\t\tnormalizePosition(new Position(this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), modified)\n\t\t\t\t),\n\t\t\t);\n\t\t}\n\n\t\tif (this.original.startLineNumber > 1 && this.modified.startLineNumber > 1) {\n\t\t\treturn new RangeMapping(\n\t\t\t\tRange.fromPositions(\n\t\t\t\t\tnormalizePosition(new Position(this.original.startLineNumber - 1, Number.MAX_SAFE_INTEGER), original),\n\t\t\t\t\tnormalizePosition(new Position(this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), original)\n\t\t\t\t),\n\t\t\t\tRange.fromPositions(\n\t\t\t\t\tnormalizePosition(new Position(this.modified.startLineNumber - 1, Number.MAX_SAFE_INTEGER), modified),\n\t\t\t\t\tnormalizePosition(new Position(this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), modified)\n\t\t\t\t),\n\t\t\t);\n\t\t}\n\n\t\t// Situation now: one range is empty and one range touches the last line and one range starts at line 1.\n\t\t// I don't think this can happen.\n\n\t\tthrow new BugIndicatingError();\n\t}\n}\n\nfunction normalizePosition(position: Position, content: string[]): Position {\n\tif (position.lineNumber < 1) {\n\t\treturn new Position(1, 1);\n\t}\n\tif (position.lineNumber > content.length) {\n\t\treturn new Position(content.length, content[content.length - 1].length + 1);\n\t}\n\tconst line = content[position.lineNumber - 1];\n\tif (position.column > line.length + 1) {\n\t\treturn new Position(position.lineNumber, line.length + 1);\n\t}\n\treturn position;\n}\n\nfunction isValidLineNumber(lineNumber: number, lines: string[]): boolean {\n\treturn lineNumber >= 1 && lineNumber <= lines.length;\n}\n\n/**\n * Maps a line range in the original text model to a line range in the modified text model.\n * Also contains inner range mappings.\n */\nexport class DetailedLineRangeMapping extends LineRangeMapping {\n\tpublic static fromRangeMappings(rangeMappings: RangeMapping[]): DetailedLineRangeMapping {\n\t\tconst originalRange = LineRange.join(rangeMappings.map(r => LineRange.fromRangeInclusive(r.originalRange)));\n\t\tconst modifiedRange = LineRange.join(rangeMappings.map(r => LineRange.fromRangeInclusive(r.modifiedRange)));\n\t\treturn new DetailedLineRangeMapping(originalRange, modifiedRange, rangeMappings);\n\t}\n\n\t/**\n\t * If inner changes have not been computed, this is set to undefined.\n\t * Otherwise, it represents the character-level diff in this line range.\n\t * The original range of each range mapping should be contained in the original line range (same for modified), exceptions are new-lines.\n\t * Must not be an empty array.\n\t */\n\tpublic readonly innerChanges: RangeMapping[] | undefined;\n\n\tconstructor(\n\t\toriginalRange: LineRange,\n\t\tmodifiedRange: LineRange,\n\t\tinnerChanges: RangeMapping[] | undefined\n\t) {\n\t\tsuper(originalRange, modifiedRange);\n\t\tthis.innerChanges = innerChanges;\n\t}\n\n\tpublic override flip(): DetailedLineRangeMapping {\n\t\treturn new DetailedLineRangeMapping(this.modified, this.original, this.innerChanges?.map(c => c.flip()));\n\t}\n\n\tpublic withInnerChangesFromLineRanges(): DetailedLineRangeMapping {\n\t\treturn new DetailedLineRangeMapping(this.original, this.modified, [this.toRangeMapping()]);\n\t}\n}\n\n/**\n * Maps a range in the original text model to a range in the modified text model.\n */\nexport class RangeMapping {\n\tpublic static assertSorted(rangeMappings: RangeMapping[]): void {\n\t\tfor (let i = 1; i < rangeMappings.length; i++) {\n\t\t\tconst previous = rangeMappings[i - 1];\n\t\t\tconst current = rangeMappings[i];\n\t\t\tif (!(\n\t\t\t\tprevious.originalRange.getEndPosition().isBeforeOrEqual(current.originalRange.getStartPosition())\n\t\t\t\t&& previous.modifiedRange.getEndPosition().isBeforeOrEqual(current.modifiedRange.getStartPosition())\n\t\t\t)) {\n\t\t\t\tthrow new BugIndicatingError('Range mappings must be sorted');\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * The original range.\n\t */\n\treadonly originalRange: Range;\n\n\t/**\n\t * The modified range.\n\t */\n\treadonly modifiedRange: Range;\n\n\tconstructor(\n\t\toriginalRange: Range,\n\t\tmodifiedRange: Range\n\t) {\n\t\tthis.originalRange = originalRange;\n\t\tthis.modifiedRange = modifiedRange;\n\t}\n\n\tpublic toString(): string {\n\t\treturn `{${this.originalRange.toString()}->${this.modifiedRange.toString()}}`;\n\t}\n\n\tpublic flip(): RangeMapping {\n\t\treturn new RangeMapping(this.modifiedRange, this.originalRange);\n\t}\n\n\t/**\n\t * Creates a single text edit that describes the change from the original to the modified text.\n\t*/\n\tpublic toTextEdit(modified: AbstractText): SingleTextEdit {\n\t\tconst newText = modified.getValueOfRange(this.modifiedRange);\n\t\treturn new SingleTextEdit(this.originalRange, newText);\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { ITimeout, SequenceDiff } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm';\nimport { DetailedLineRangeMapping, LineRangeMapping } from '../rangeMapping';\nimport { pushMany, compareBy, numberComparator, reverseOrder } from 'vs/base/common/arrays';\nimport { MonotonousArray, findLastMonotonous } from 'vs/base/common/arraysFind';\nimport { SetMap } from 'vs/base/common/map';\nimport { LineRange, LineRangeSet } from 'vs/editor/common/core/lineRange';\nimport { LinesSliceCharSequence } from 'vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence';\nimport { LineRangeFragment, isSpace } from 'vs/editor/common/diff/defaultLinesDiffComputer/utils';\nimport { MyersDiffAlgorithm } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm';\nimport { Range } from 'vs/editor/common/core/range';\n\nexport function computeMovedLines(\n\tchanges: DetailedLineRangeMapping[],\n\toriginalLines: string[],\n\tmodifiedLines: string[],\n\thashedOriginalLines: number[],\n\thashedModifiedLines: number[],\n\ttimeout: ITimeout\n): LineRangeMapping[] {\n\tlet { moves, excludedChanges } = computeMovesFromSimpleDeletionsToSimpleInsertions(changes, originalLines, modifiedLines, timeout);\n\n\tif (!timeout.isValid()) { return []; }\n\n\tconst filteredChanges = changes.filter(c => !excludedChanges.has(c));\n\tconst unchangedMoves = computeUnchangedMoves(filteredChanges, hashedOriginalLines, hashedModifiedLines, originalLines, modifiedLines, timeout);\n\tpushMany(moves, unchangedMoves);\n\n\tmoves = joinCloseConsecutiveMoves(moves);\n\t// Ignore too short moves\n\tmoves = moves.filter(current => {\n\t\tconst lines = current.original.toOffsetRange().slice(originalLines).map(l => l.trim());\n\t\tconst originalText = lines.join('\\n');\n\t\treturn originalText.length >= 15 && countWhere(lines, l => l.length >= 2) >= 2;\n\t});\n\tmoves = removeMovesInSameDiff(changes, moves);\n\n\treturn moves;\n}\n\nfunction countWhere<T>(arr: T[], predicate: (t: T) => boolean): number {\n\tlet count = 0;\n\tfor (const t of arr) {\n\t\tif (predicate(t)) {\n\t\t\tcount++;\n\t\t}\n\t}\n\treturn count;\n}\n\nfunction computeMovesFromSimpleDeletionsToSimpleInsertions(\n\tchanges: DetailedLineRangeMapping[],\n\toriginalLines: string[],\n\tmodifiedLines: string[],\n\ttimeout: ITimeout,\n) {\n\tconst moves: LineRangeMapping[] = [];\n\n\tconst deletions = changes\n\t\t.filter(c => c.modified.isEmpty && c.original.length >= 3)\n\t\t.map(d => new LineRangeFragment(d.original, originalLines, d));\n\tconst insertions = new Set(changes\n\t\t.filter(c => c.original.isEmpty && c.modified.length >= 3)\n\t\t.map(d => new LineRangeFragment(d.modified, modifiedLines, d)));\n\n\tconst excludedChanges = new Set<DetailedLineRangeMapping>();\n\n\tfor (const deletion of deletions) {\n\t\tlet highestSimilarity = -1;\n\t\tlet best: LineRangeFragment | undefined;\n\t\tfor (const insertion of insertions) {\n\t\t\tconst similarity = deletion.computeSimilarity(insertion);\n\t\t\tif (similarity > highestSimilarity) {\n\t\t\t\thighestSimilarity = similarity;\n\t\t\t\tbest = insertion;\n\t\t\t}\n\t\t}\n\n\t\tif (highestSimilarity > 0.90 && best) {\n\t\t\tinsertions.delete(best);\n\t\t\tmoves.push(new LineRangeMapping(deletion.range, best.range));\n\t\t\texcludedChanges.add(deletion.source);\n\t\t\texcludedChanges.add(best.source);\n\t\t}\n\n\t\tif (!timeout.isValid()) {\n\t\t\treturn { moves, excludedChanges };\n\t\t}\n\t}\n\n\treturn { moves, excludedChanges };\n}\n\nfunction computeUnchangedMoves(\n\tchanges: DetailedLineRangeMapping[],\n\thashedOriginalLines: number[],\n\thashedModifiedLines: number[],\n\toriginalLines: string[],\n\tmodifiedLines: string[],\n\ttimeout: ITimeout,\n) {\n\tconst moves: LineRangeMapping[] = [];\n\n\tconst original3LineHashes = new SetMap<string, { range: LineRange }>();\n\n\tfor (const change of changes) {\n\t\tfor (let i = change.original.startLineNumber; i < change.original.endLineNumberExclusive - 2; i++) {\n\t\t\tconst key = `${hashedOriginalLines[i - 1]}:${hashedOriginalLines[i + 1 - 1]}:${hashedOriginalLines[i + 2 - 1]}`;\n\t\t\toriginal3LineHashes.add(key, { range: new LineRange(i, i + 3) });\n\t\t}\n\t}\n\n\tinterface PossibleMapping {\n\t\tmodifiedLineRange: LineRange;\n\t\toriginalLineRange: LineRange;\n\t}\n\n\tconst possibleMappings: PossibleMapping[] = [];\n\n\tchanges.sort(compareBy(c => c.modified.startLineNumber, numberComparator));\n\n\tfor (const change of changes) {\n\t\tlet lastMappings: PossibleMapping[] = [];\n\t\tfor (let i = change.modified.startLineNumber; i < change.modified.endLineNumberExclusive - 2; i++) {\n\t\t\tconst key = `${hashedModifiedLines[i - 1]}:${hashedModifiedLines[i + 1 - 1]}:${hashedModifiedLines[i + 2 - 1]}`;\n\t\t\tconst currentModifiedRange = new LineRange(i, i + 3);\n\n\t\t\tconst nextMappings: PossibleMapping[] = [];\n\t\t\toriginal3LineHashes.forEach(key, ({ range }) => {\n\t\t\t\tfor (const lastMapping of lastMappings) {\n\t\t\t\t\t// does this match extend some last match?\n\t\t\t\t\tif (lastMapping.originalLineRange.endLineNumberExclusive + 1 === range.endLineNumberExclusive &&\n\t\t\t\t\t\tlastMapping.modifiedLineRange.endLineNumberExclusive + 1 === currentModifiedRange.endLineNumberExclusive) {\n\t\t\t\t\t\tlastMapping.originalLineRange = new LineRange(lastMapping.originalLineRange.startLineNumber, range.endLineNumberExclusive);\n\t\t\t\t\t\tlastMapping.modifiedLineRange = new LineRange(lastMapping.modifiedLineRange.startLineNumber, currentModifiedRange.endLineNumberExclusive);\n\t\t\t\t\t\tnextMappings.push(lastMapping);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tconst mapping: PossibleMapping = {\n\t\t\t\t\tmodifiedLineRange: currentModifiedRange,\n\t\t\t\t\toriginalLineRange: range,\n\t\t\t\t};\n\t\t\t\tpossibleMappings.push(mapping);\n\t\t\t\tnextMappings.push(mapping);\n\t\t\t});\n\t\t\tlastMappings = nextMappings;\n\t\t}\n\n\t\tif (!timeout.isValid()) {\n\t\t\treturn [];\n\t\t}\n\t}\n\n\tpossibleMappings.sort(reverseOrder(compareBy(m => m.modifiedLineRange.length, numberComparator)));\n\n\tconst modifiedSet = new LineRangeSet();\n\tconst originalSet = new LineRangeSet();\n\n\tfor (const mapping of possibleMappings) {\n\n\t\tconst diffOrigToMod = mapping.modifiedLineRange.startLineNumber - mapping.originalLineRange.startLineNumber;\n\t\tconst modifiedSections = modifiedSet.subtractFrom(mapping.modifiedLineRange);\n\t\tconst originalTranslatedSections = originalSet.subtractFrom(mapping.originalLineRange).getWithDelta(diffOrigToMod);\n\n\t\tconst modifiedIntersectedSections = modifiedSections.getIntersection(originalTranslatedSections);\n\n\t\tfor (const s of modifiedIntersectedSections.ranges) {\n\t\t\tif (s.length < 3) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst modifiedLineRange = s;\n\t\t\tconst originalLineRange = s.delta(-diffOrigToMod);\n\n\t\t\tmoves.push(new LineRangeMapping(originalLineRange, modifiedLineRange));\n\n\t\t\tmodifiedSet.addRange(modifiedLineRange);\n\t\t\toriginalSet.addRange(originalLineRange);\n\t\t}\n\t}\n\n\tmoves.sort(compareBy(m => m.original.startLineNumber, numberComparator));\n\n\tconst monotonousChanges = new MonotonousArray(changes);\n\tfor (let i = 0; i < moves.length; i++) {\n\t\tconst move = moves[i];\n\t\tconst firstTouchingChangeOrig = monotonousChanges.findLastMonotonous(c => c.original.startLineNumber <= move.original.startLineNumber)!;\n\t\tconst firstTouchingChangeMod = findLastMonotonous(changes, c => c.modified.startLineNumber <= move.modified.startLineNumber)!;\n\t\tconst linesAbove = Math.max(\n\t\t\tmove.original.startLineNumber - firstTouchingChangeOrig.original.startLineNumber,\n\t\t\tmove.modified.startLineNumber - firstTouchingChangeMod.modified.startLineNumber\n\t\t);\n\n\t\tconst lastTouchingChangeOrig = monotonousChanges.findLastMonotonous(c => c.original.startLineNumber < move.original.endLineNumberExclusive)!;\n\t\tconst lastTouchingChangeMod = findLastMonotonous(changes, c => c.modified.startLineNumber < move.modified.endLineNumberExclusive)!;\n\t\tconst linesBelow = Math.max(\n\t\t\tlastTouchingChangeOrig.original.endLineNumberExclusive - move.original.endLineNumberExclusive,\n\t\t\tlastTouchingChangeMod.modified.endLineNumberExclusive - move.modified.endLineNumberExclusive\n\t\t);\n\n\t\tlet extendToTop: number;\n\t\tfor (extendToTop = 0; extendToTop < linesAbove; extendToTop++) {\n\t\t\tconst origLine = move.original.startLineNumber - extendToTop - 1;\n\t\t\tconst modLine = move.modified.startLineNumber - extendToTop - 1;\n\t\t\tif (origLine > originalLines.length || modLine > modifiedLines.length) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (modifiedSet.contains(modLine) || originalSet.contains(origLine)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (!areLinesSimilar(originalLines[origLine - 1], modifiedLines[modLine - 1], timeout)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (extendToTop > 0) {\n\t\t\toriginalSet.addRange(new LineRange(move.original.startLineNumber - extendToTop, move.original.startLineNumber));\n\t\t\tmodifiedSet.addRange(new LineRange(move.modified.startLineNumber - extendToTop, move.modified.startLineNumber));\n\t\t}\n\n\t\tlet extendToBottom: number;\n\t\tfor (extendToBottom = 0; extendToBottom < linesBelow; extendToBottom++) {\n\t\t\tconst origLine = move.original.endLineNumberExclusive + extendToBottom;\n\t\t\tconst modLine = move.modified.endLineNumberExclusive + extendToBottom;\n\t\t\tif (origLine > originalLines.length || modLine > modifiedLines.length) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (modifiedSet.contains(modLine) || originalSet.contains(origLine)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (!areLinesSimilar(originalLines[origLine - 1], modifiedLines[modLine - 1], timeout)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (extendToBottom > 0) {\n\t\t\toriginalSet.addRange(new LineRange(move.original.endLineNumberExclusive, move.original.endLineNumberExclusive + extendToBottom));\n\t\t\tmodifiedSet.addRange(new LineRange(move.modified.endLineNumberExclusive, move.modified.endLineNumberExclusive + extendToBottom));\n\t\t}\n\n\t\tif (extendToTop > 0 || extendToBottom > 0) {\n\t\t\tmoves[i] = new LineRangeMapping(\n\t\t\t\tnew LineRange(move.original.startLineNumber - extendToTop, move.original.endLineNumberExclusive + extendToBottom),\n\t\t\t\tnew LineRange(move.modified.startLineNumber - extendToTop, move.modified.endLineNumberExclusive + extendToBottom),\n\t\t\t);\n\t\t}\n\t}\n\n\treturn moves;\n}\n\nfunction areLinesSimilar(line1: string, line2: string, timeout: ITimeout): boolean {\n\tif (line1.trim() === line2.trim()) { return true; }\n\tif (line1.length > 300 && line2.length > 300) { return false; }\n\n\tconst myersDiffingAlgorithm = new MyersDiffAlgorithm();\n\tconst result = myersDiffingAlgorithm.compute(\n\t\tnew LinesSliceCharSequence([line1], new Range(1, 1, 1, line1.length), false),\n\t\tnew LinesSliceCharSequence([line2], new Range(1, 1, 1, line2.length), false),\n\t\ttimeout\n\t);\n\tlet commonNonSpaceCharCount = 0;\n\tconst inverted = SequenceDiff.invert(result.diffs, line1.length);\n\tfor (const seq of inverted) {\n\t\tseq.seq1Range.forEach(idx => {\n\t\t\tif (!isSpace(line1.charCodeAt(idx))) {\n\t\t\t\tcommonNonSpaceCharCount++;\n\t\t\t}\n\t\t});\n\t}\n\n\tfunction countNonWsChars(str: string): number {\n\t\tlet count = 0;\n\t\tfor (let i = 0; i < line1.length; i++) {\n\t\t\tif (!isSpace(str.charCodeAt(i))) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\treturn count;\n\t}\n\n\tconst longerLineLength = countNonWsChars(line1.length > line2.length ? line1 : line2);\n\tconst r = commonNonSpaceCharCount / longerLineLength > 0.6 && longerLineLength > 10;\n\treturn r;\n}\n\nfunction joinCloseConsecutiveMoves(moves: LineRangeMapping[]): LineRangeMapping[] {\n\tif (moves.length === 0) {\n\t\treturn moves;\n\t}\n\n\tmoves.sort(compareBy(m => m.original.startLineNumber, numberComparator));\n\n\tconst result = [moves[0]];\n\tfor (let i = 1; i < moves.length; i++) {\n\t\tconst last = result[result.length - 1];\n\t\tconst current = moves[i];\n\n\t\tconst originalDist = current.original.startLineNumber - last.original.endLineNumberExclusive;\n\t\tconst modifiedDist = current.modified.startLineNumber - last.modified.endLineNumberExclusive;\n\t\tconst currentMoveAfterLast = originalDist >= 0 && modifiedDist >= 0;\n\n\t\tif (currentMoveAfterLast && originalDist + modifiedDist <= 2) {\n\t\t\tresult[result.length - 1] = last.join(current);\n\t\t\tcontinue;\n\t\t}\n\n\t\tresult.push(current);\n\t}\n\treturn result;\n}\n\nfunction removeMovesInSameDiff(changes: DetailedLineRangeMapping[], moves: LineRangeMapping[]) {\n\tconst changesMonotonous = new MonotonousArray(changes);\n\tmoves = moves.filter(m => {\n\t\tconst diffBeforeEndOfMoveOriginal = changesMonotonous.findLastMonotonous(c => c.original.startLineNumber < m.original.endLineNumberExclusive)\n\t\t\t|| new LineRangeMapping(new LineRange(1, 1), new LineRange(1, 1));\n\t\tconst diffBeforeEndOfMoveModified = findLastMonotonous(changes, c => c.modified.startLineNumber < m.modified.endLineNumberExclusive);\n\n\t\tconst differentDiffs = diffBeforeEndOfMoveOriginal !== diffBeforeEndOfMoveModified;\n\t\treturn differentDiffs;\n\t});\n\treturn moves;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { equals, groupAdjacentBy } from 'vs/base/common/arrays';\nimport { assertFn, checkAdjacentItems } from 'vs/base/common/assert';\nimport { LineRange } from 'vs/editor/common/core/lineRange';\nimport { OffsetRange } from 'vs/editor/common/core/offsetRange';\nimport { Position } from 'vs/editor/common/core/position';\nimport { Range } from 'vs/editor/common/core/range';\nimport { DateTimeout, ITimeout, InfiniteTimeout, SequenceDiff } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm';\nimport { DynamicProgrammingDiffing } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/dynamicProgrammingDiffing';\nimport { MyersDiffAlgorithm } from 'vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm';\nimport { computeMovedLines } from 'vs/editor/common/diff/defaultLinesDiffComputer/computeMovedLines';\nimport { extendDiffsToEntireWordIfAppropriate, optimizeSequenceDiffs, removeShortMatches, removeVeryShortMatchingLinesBetweenDiffs, removeVeryShortMatchingTextBetweenLongDiffs } from 'vs/editor/common/diff/defaultLinesDiffComputer/heuristicSequenceOptimizations';\nimport { LineSequence } from 'vs/editor/common/diff/defaultLinesDiffComputer/lineSequence';\nimport { LinesSliceCharSequence } from 'vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence';\nimport { ILinesDiffComputer, ILinesDiffComputerOptions, LinesDiff, MovedText } from 'vs/editor/common/diff/linesDiffComputer';\nimport { DetailedLineRangeMapping, LineRangeMapping, RangeMapping } from '../rangeMapping';\n\nexport class DefaultLinesDiffComputer implements ILinesDiffComputer {\n\tprivate readonly dynamicProgrammingDiffing = new DynamicProgrammingDiffing();\n\tprivate readonly myersDiffingAlgorithm = new MyersDiffAlgorithm();\n\n\tcomputeDiff(originalLines: string[], modifiedLines: string[], options: ILinesDiffComputerOptions): LinesDiff {\n\t\tif (originalLines.length <= 1 && equals(originalLines, modifiedLines, (a, b) => a === b)) {\n\t\t\treturn new LinesDiff([], [], false);\n\t\t}\n\n\t\tif (originalLines.length === 1 && originalLines[0].length === 0 || modifiedLines.length === 1 && modifiedLines[0].length === 0) {\n\t\t\treturn new LinesDiff([\n\t\t\t\tnew DetailedLineRangeMapping(\n\t\t\t\t\tnew LineRange(1, originalLines.length + 1),\n\t\t\t\t\tnew LineRange(1, modifiedLines.length + 1),\n\t\t\t\t\t[\n\t\t\t\t\t\tnew RangeMapping(\n\t\t\t\t\t\t\tnew Range(1, 1, originalLines.length, originalLines[originalLines.length - 1].length + 1),\n\t\t\t\t\t\t\tnew Range(1, 1, modifiedLines.length, modifiedLines[modifiedLines.length - 1].length + 1),\n\t\t\t\t\t\t)\n\t\t\t\t\t]\n\t\t\t\t)\n\t\t\t], [], false);\n\t\t}\n\n\t\tconst timeout = options.maxComputationTimeMs === 0 ? InfiniteTimeout.instance : new DateTimeout(options.maxComputationTimeMs);\n\t\tconst considerWhitespaceChanges = !options.ignoreTrimWhitespace;\n\n\t\tconst perfectHashes = new Map<string, number>();\n\t\tfunction getOrCreateHash(text: string): number {\n\t\t\tlet hash = perfectHashes.get(text);\n\t\t\tif (hash === undefined) {\n\t\t\t\thash = perfectHashes.size;\n\t\t\t\tperfectHashes.set(text, hash);\n\t\t\t}\n\t\t\treturn hash;\n\t\t}\n\n\t\tconst originalLinesHashes = originalLines.map((l) => getOrCreateHash(l.trim()));\n\t\tconst modifiedLinesHashes = modifiedLines.map((l) => getOrCreateHash(l.trim()));\n\n\t\tconst sequence1 = new LineSequence(originalLinesHashes, originalLines);\n\t\tconst sequence2 = new LineSequence(modifiedLinesHashes, modifiedLines);\n\n\t\tconst lineAlignmentResult = (() => {\n\t\t\tif (sequence1.length + sequence2.length < 1700) {\n\t\t\t\t// Use the improved algorithm for small files\n\t\t\t\treturn this.dynamicProgrammingDiffing.compute(\n\t\t\t\t\tsequence1,\n\t\t\t\t\tsequence2,\n\t\t\t\t\ttimeout,\n\t\t\t\t\t(offset1, offset2) =>\n\t\t\t\t\t\toriginalLines[offset1] === modifiedLines[offset2]\n\t\t\t\t\t\t\t? modifiedLines[offset2].length === 0\n\t\t\t\t\t\t\t\t? 0.1\n\t\t\t\t\t\t\t\t: 1 + Math.log(1 + modifiedLines[offset2].length)\n\t\t\t\t\t\t\t: 0.99\n\t\t\t\t);\n\t\t\t}\n\n\t\t\treturn this.myersDiffingAlgorithm.compute(\n\t\t\t\tsequence1,\n\t\t\t\tsequence2,\n\t\t\t\ttimeout\n\t\t\t);\n\t\t})();\n\n\t\tlet lineAlignments = lineAlignmentResult.diffs;\n\t\tlet hitTimeout = lineAlignmentResult.hitTimeout;\n\t\tlineAlignments = optimizeSequenceDiffs(sequence1, sequence2, lineAlignments);\n\t\tlineAlignments = removeVeryShortMatchingLinesBetweenDiffs(sequence1, sequence2, lineAlignments);\n\n\t\tconst alignments: RangeMapping[] = [];\n\n\t\tconst scanForWhitespaceChanges = (equalLinesCount: number) => {\n\t\t\tif (!considerWhitespaceChanges) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tfor (let i = 0; i < equalLinesCount; i++) {\n\t\t\t\tconst seq1Offset = seq1LastStart + i;\n\t\t\t\tconst seq2Offset = seq2LastStart + i;\n\t\t\t\tif (originalLines[seq1Offset] !== modifiedLines[seq2Offset]) {\n\t\t\t\t\t// This is because of whitespace changes, diff these lines\n\t\t\t\t\tconst characterDiffs = this.refineDiff(originalLines, modifiedLines, new SequenceDiff(\n\t\t\t\t\t\tnew OffsetRange(seq1Offset, seq1Offset + 1),\n\t\t\t\t\t\tnew OffsetRange(seq2Offset, seq2Offset + 1),\n\t\t\t\t\t), timeout, considerWhitespaceChanges);\n\t\t\t\t\tfor (const a of characterDiffs.mappings) {\n\t\t\t\t\t\talignments.push(a);\n\t\t\t\t\t}\n\t\t\t\t\tif (characterDiffs.hitTimeout) {\n\t\t\t\t\t\thitTimeout = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\t\tlet seq1LastStart = 0;\n\t\tlet seq2LastStart = 0;\n\n\t\tfor (const diff of lineAlignments) {\n\t\t\tassertFn(() => diff.seq1Range.start - seq1LastStart === diff.seq2Range.start - seq2LastStart);\n\n\t\t\tconst equalLinesCount = diff.seq1Range.start - seq1LastStart;\n\n\t\t\tscanForWhitespaceChanges(equalLinesCount);\n\n\t\t\tseq1LastStart = diff.seq1Range.endExclusive;\n\t\t\tseq2LastStart = diff.seq2Range.endExclusive;\n\n\t\t\tconst characterDiffs = this.refineDiff(originalLines, modifiedLines, diff, timeout, considerWhitespaceChanges);\n\t\t\tif (characterDiffs.hitTimeout) {\n\t\t\t\thitTimeout = true;\n\t\t\t}\n\t\t\tfor (const a of characterDiffs.mappings) {\n\t\t\t\talignments.push(a);\n\t\t\t}\n\t\t}\n\n\t\tscanForWhitespaceChanges(originalLines.length - seq1LastStart);\n\n\t\tconst changes = lineRangeMappingFromRangeMappings(alignments, originalLines, modifiedLines);\n\n\t\tlet moves: MovedText[] = [];\n\t\tif (options.computeMoves) {\n\t\t\tmoves = this.computeMoves(changes, originalLines, modifiedLines, originalLinesHashes, modifiedLinesHashes, timeout, considerWhitespaceChanges);\n\t\t}\n\n\t\t// Make sure all ranges are valid\n\t\tassertFn(() => {\n\t\t\tfunction validatePosition(pos: Position, lines: string[]): boolean {\n\t\t\t\tif (pos.lineNumber < 1 || pos.lineNumber > lines.length) { return false; }\n\t\t\t\tconst line = lines[pos.lineNumber - 1];\n\t\t\t\tif (pos.column < 1 || pos.column > line.length + 1) { return false; }\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\tfunction validateRange(range: LineRange, lines: string[]): boolean {\n\t\t\t\tif (range.startLineNumber < 1 || range.startLineNumber > lines.length + 1) { return false; }\n\t\t\t\tif (range.endLineNumberExclusive < 1 || range.endLineNumberExclusive > lines.length + 1) { return false; }\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\tfor (const c of changes) {\n\t\t\t\tif (!c.innerChanges) { return false; }\n\t\t\t\tfor (const ic of c.innerChanges) {\n\t\t\t\t\tconst valid = validatePosition(ic.modifiedRange.getStartPosition(), modifiedLines) && validatePosition(ic.modifiedRange.getEndPosition(), modifiedLines) &&\n\t\t\t\t\t\tvalidatePosition(ic.originalRange.getStartPosition(), originalLines) && validatePosition(ic.originalRange.getEndPosition(), originalLines);\n\t\t\t\t\tif (!valid) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!validateRange(c.modified, modifiedLines) || !validateRange(c.original, originalLines)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\n\t\treturn new LinesDiff(changes, moves, hitTimeout);\n\t}\n\n\tprivate computeMoves(\n\t\tchanges: DetailedLineRangeMapping[],\n\t\toriginalLines: string[],\n\t\tmodifiedLines: string[],\n\t\thashedOriginalLines: number[],\n\t\thashedModifiedLines: number[],\n\t\ttimeout: ITimeout,\n\t\tconsiderWhitespaceChanges: boolean,\n\t): MovedText[] {\n\t\tconst moves = computeMovedLines(\n\t\t\tchanges,\n\t\t\toriginalLines,\n\t\t\tmodifiedLines,\n\t\t\thashedOriginalLines,\n\t\t\thashedModifiedLines,\n\t\t\ttimeout,\n\t\t);\n\t\tconst movesWithDiffs = moves.map(m => {\n\t\t\tconst moveChanges = this.refineDiff(originalLines, modifiedLines, new SequenceDiff(\n\t\t\t\tm.original.toOffsetRange(),\n\t\t\t\tm.modified.toOffsetRange(),\n\t\t\t), timeout, considerWhitespaceChanges);\n\t\t\tconst mappings = lineRangeMappingFromRangeMappings(moveChanges.mappings, originalLines, modifiedLines, true);\n\t\t\treturn new MovedText(m, mappings);\n\t\t});\n\t\treturn movesWithDiffs;\n\t}\n\n\tprivate refineDiff(originalLines: string[], modifiedLines: string[], diff: SequenceDiff, timeout: ITimeout, considerWhitespaceChanges: boolean): { mappings: RangeMapping[]; hitTimeout: boolean } {\n\t\tconst lineRangeMapping = toLineRangeMapping(diff);\n\t\tconst rangeMapping = lineRangeMapping.toRangeMapping2(originalLines, modifiedLines);\n\n\t\tconst slice1 = new LinesSliceCharSequence(originalLines, rangeMapping.originalRange, considerWhitespaceChanges);\n\t\tconst slice2 = new LinesSliceCharSequence(modifiedLines, rangeMapping.modifiedRange, considerWhitespaceChanges);\n\n\t\tconst diffResult = slice1.length + slice2.length < 500\n\t\t\t? this.dynamicProgrammingDiffing.compute(slice1, slice2, timeout)\n\t\t\t: this.myersDiffingAlgorithm.compute(slice1, slice2, timeout);\n\n\t\tconst check = false;\n\n\t\tlet diffs = diffResult.diffs;\n\t\tif (check) { SequenceDiff.assertSorted(diffs); }\n\t\tdiffs = optimizeSequenceDiffs(slice1, slice2, diffs);\n\t\tif (check) { SequenceDiff.assertSorted(diffs); }\n\t\tdiffs = extendDiffsToEntireWordIfAppropriate(slice1, slice2, diffs);\n\t\tif (check) { SequenceDiff.assertSorted(diffs); }\n\t\tdiffs = removeShortMatches(slice1, slice2, diffs);\n\t\tif (check) { SequenceDiff.assertSorted(diffs); }\n\t\tdiffs = removeVeryShortMatchingTextBetweenLongDiffs(slice1, slice2, diffs);\n\t\tif (check) { SequenceDiff.assertSorted(diffs); }\n\n\t\tconst result = diffs.map(\n\t\t\t(d) =>\n\t\t\t\tnew RangeMapping(\n\t\t\t\t\tslice1.translateRange(d.seq1Range),\n\t\t\t\t\tslice2.translateRange(d.seq2Range)\n\t\t\t\t)\n\t\t);\n\n\t\tif (check) { RangeMapping.assertSorted(result); }\n\n\t\t// Assert: result applied on original should be the same as diff applied to original\n\n\t\treturn {\n\t\t\tmappings: result,\n\t\t\thitTimeout: diffResult.hitTimeout,\n\t\t};\n\t}\n}\n\nexport function lineRangeMappingFromRangeMappings(alignments: RangeMapping[], originalLines: string[], modifiedLines: string[], dontAssertStartLine: boolean = false): DetailedLineRangeMapping[] {\n\tconst changes: DetailedLineRangeMapping[] = [];\n\tfor (const g of groupAdjacentBy(\n\t\talignments.map(a => getLineRangeMapping(a, originalLines, modifiedLines)),\n\t\t(a1, a2) =>\n\t\t\ta1.original.overlapOrTouch(a2.original)\n\t\t\t|| a1.modified.overlapOrTouch(a2.modified)\n\t)) {\n\t\tconst first = g[0];\n\t\tconst last = g[g.length - 1];\n\n\t\tchanges.push(new DetailedLineRangeMapping(\n\t\t\tfirst.original.join(last.original),\n\t\t\tfirst.modified.join(last.modified),\n\t\t\tg.map(a => a.innerChanges![0]),\n\t\t));\n\t}\n\n\tassertFn(() => {\n\t\tif (!dontAssertStartLine && changes.length > 0) {\n\t\t\tif (changes[0].modified.startLineNumber !== changes[0].original.startLineNumber) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (modifiedLines.length - changes[changes.length - 1].modified.endLineNumberExclusive !== originalLines.length - changes[changes.length - 1].original.endLineNumberExclusive) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn checkAdjacentItems(changes,\n\t\t\t(m1, m2) => m2.original.startLineNumber - m1.original.endLineNumberExclusive === m2.modified.startLineNumber - m1.modified.endLineNumberExclusive &&\n\t\t\t\t// There has to be an unchanged line in between (otherwise both diffs should have been joined)\n\t\t\t\tm1.original.endLineNumberExclusive < m2.original.startLineNumber &&\n\t\t\t\tm1.modified.endLineNumberExclusive < m2.modified.startLineNumber,\n\t\t);\n\t});\n\n\treturn changes;\n}\n\nexport function getLineRangeMapping(rangeMapping: RangeMapping, originalLines: string[], modifiedLines: string[]): DetailedLineRangeMapping {\n\tlet lineStartDelta = 0;\n\tlet lineEndDelta = 0;\n\n\t// rangeMapping describes the edit that replaces `rangeMapping.originalRange` with `newText := getText(modifiedLines, rangeMapping.modifiedRange)`.\n\n\t// original: ]xxx \\n <- this line is not modified\n\t// modified: ]xx  \\n\n\tif (rangeMapping.modifiedRange.endColumn === 1 && rangeMapping.originalRange.endColumn === 1\n\t\t&& rangeMapping.originalRange.startLineNumber + lineStartDelta <= rangeMapping.originalRange.endLineNumber\n\t\t&& rangeMapping.modifiedRange.startLineNumber + lineStartDelta <= rangeMapping.modifiedRange.endLineNumber) {\n\t\t// We can only do this if the range is not empty yet\n\t\tlineEndDelta = -1;\n\t}\n\n\t// original: xxx[ \\n <- this line is not modified\n\t// modified: xxx[ \\n\n\tif (rangeMapping.modifiedRange.startColumn - 1 >= modifiedLines[rangeMapping.modifiedRange.startLineNumber - 1].length\n\t\t&& rangeMapping.originalRange.startColumn - 1 >= originalLines[rangeMapping.originalRange.startLineNumber - 1].length\n\t\t&& rangeMapping.originalRange.startLineNumber <= rangeMapping.originalRange.endLineNumber + lineEndDelta\n\t\t&& rangeMapping.modifiedRange.startLineNumber <= rangeMapping.modifiedRange.endLineNumber + lineEndDelta) {\n\t\t// We can only do this if the range is not empty yet\n\t\tlineStartDelta = 1;\n\t}\n\n\tconst originalLineRange = new LineRange(\n\t\trangeMapping.originalRange.startLineNumber + lineStartDelta,\n\t\trangeMapping.originalRange.endLineNumber + 1 + lineEndDelta\n\t);\n\tconst modifiedLineRange = new LineRange(\n\t\trangeMapping.modifiedRange.startLineNumber + lineStartDelta,\n\t\trangeMapping.modifiedRange.endLineNumber + 1 + lineEndDelta\n\t);\n\n\treturn new DetailedLineRangeMapping(originalLineRange, modifiedLineRange, [rangeMapping]);\n}\n\nfunction toLineRangeMapping(sequenceDiff: SequenceDiff) {\n\treturn new LineRangeMapping(\n\t\tnew LineRange(sequenceDiff.seq1Range.start + 1, sequenceDiff.seq1Range.endExclusive + 1),\n\t\tnew LineRange(sequenceDiff.seq2Range.start + 1, sequenceDiff.seq2Range.endExclusive + 1),\n\t);\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\nimport { IDiffChange, ISequence, LcsDiff, IDiffResult } from 'vs/base/common/diff/diff';\nimport { ILinesDiffComputer, ILinesDiffComputerOptions, LinesDiff } from 'vs/editor/common/diff/linesDiffComputer';\nimport { RangeMapping, DetailedLineRangeMapping } from './rangeMapping';\nimport * as strings from 'vs/base/common/strings';\nimport { Range } from 'vs/editor/common/core/range';\nimport { assertFn, checkAdjacentItems } from 'vs/base/common/assert';\nimport { LineRange } from 'vs/editor/common/core/lineRange';\n\nconst MINIMUM_MATCHING_CHARACTER_LENGTH = 3;\n\nexport class LegacyLinesDiffComputer implements ILinesDiffComputer {\n\tcomputeDiff(originalLines: string[], modifiedLines: string[], options: ILinesDiffComputerOptions): LinesDiff {\n\t\tconst diffComputer = new DiffComputer(originalLines, modifiedLines, {\n\t\t\tmaxComputationTime: options.maxComputationTimeMs,\n\t\t\tshouldIgnoreTrimWhitespace: options.ignoreTrimWhitespace,\n\t\t\tshouldComputeCharChanges: true,\n\t\t\tshouldMakePrettyDiff: true,\n\t\t\tshouldPostProcessCharChanges: true,\n\t\t});\n\t\tconst result = diffComputer.computeDiff();\n\t\tconst changes: DetailedLineRangeMapping[] = [];\n\t\tlet lastChange: DetailedLineRangeMapping | null = null;\n\n\n\t\tfor (const c of result.changes) {\n\t\t\tlet originalRange: LineRange;\n\t\t\tif (c.originalEndLineNumber === 0) {\n\t\t\t\t// Insertion\n\t\t\t\toriginalRange = new LineRange(c.originalStartLineNumber + 1, c.originalStartLineNumber + 1);\n\t\t\t} else {\n\t\t\t\toriginalRange = new LineRange(c.originalStartLineNumber, c.originalEndLineNumber + 1);\n\t\t\t}\n\n\t\t\tlet modifiedRange: LineRange;\n\t\t\tif (c.modifiedEndLineNumber === 0) {\n\t\t\t\t// Deletion\n\t\t\t\tmodifiedRange = new LineRange(c.modifiedStartLineNumber + 1, c.modifiedStartLineNumber + 1);\n\t\t\t} else {\n\t\t\t\tmodifiedRange = new LineRange(c.modifiedStartLineNumber, c.modifiedEndLineNumber + 1);\n\t\t\t}\n\n\t\t\tlet change = new DetailedLineRangeMapping(originalRange, modifiedRange, c.charChanges?.map(c => new RangeMapping(\n\t\t\t\tnew Range(c.originalStartLineNumber, c.originalStartColumn, c.originalEndLineNumber, c.originalEndColumn),\n\t\t\t\tnew Range(c.modifiedStartLineNumber, c.modifiedStartColumn, c.modifiedEndLineNumber, c.modifiedEndColumn),\n\t\t\t)));\n\t\t\tif (lastChange) {\n\t\t\t\tif (lastChange.modified.endLineNumberExclusive === change.modified.startLineNumber\n\t\t\t\t\t|| lastChange.original.endLineNumberExclusive === change.original.startLineNumber) {\n\t\t\t\t\t// join touching diffs. Probably moving diffs up/down in the algorithm causes touching diffs.\n\t\t\t\t\tchange = new DetailedLineRangeMapping(\n\t\t\t\t\t\tlastChange.original.join(change.original),\n\t\t\t\t\t\tlastChange.modified.join(change.modified),\n\t\t\t\t\t\tlastChange.innerChanges && change.innerChanges ?\n\t\t\t\t\t\t\tlastChange.innerChanges.concat(change.innerChanges) : undefined\n\t\t\t\t\t);\n\t\t\t\t\tchanges.pop();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tchanges.push(change);\n\t\t\tlastChange = change;\n\t\t}\n\n\t\tassertFn(() => {\n\t\t\treturn checkAdjacentItems(changes,\n\t\t\t\t(m1, m2) => m2.original.startLineNumber - m1.original.endLineNumberExclusive === m2.modified.startLineNumber - m1.modified.endLineNumberExclusive &&\n\t\t\t\t\t// There has to be an unchanged line in between (otherwise both diffs should have been joined)\n\t\t\t\t\tm1.original.endLineNumberExclusive < m2.original.startLineNumber &&\n\t\t\t\t\tm1.modified.endLineNumberExclusive < m2.modified.startLineNumber,\n\t\t\t);\n\t\t});\n\n\t\treturn new LinesDiff(changes, [], result.quitEarly);\n\t}\n}\n\n/**\n * A change\n */\nexport interface IChange {\n\treadonly originalStartLineNumber: number;\n\treadonly originalEndLineNumber: number;\n\treadonly modifiedStartLineNumber: number;\n\treadonly modifiedEndLineNumber: number;\n}\n\n/**\n * A character level change.\n */\nexport interface ICharChange extends IChange {\n\treadonly originalStartColumn: number;\n\treadonly originalEndColumn: number;\n\treadonly modifiedStartColumn: number;\n\treadonly modifiedEndColumn: number;\n}\n\n/**\n * A line change\n */\nexport interface ILineChange extends IChange {\n\treadonly charChanges: ICharChange[] | undefined;\n}\n\nexport interface IDiffComputerResult {\n\tquitEarly: boolean;\n\tchanges: ILineChange[];\n}\n\nfunction computeDiff(originalSequence: ISequence, modifiedSequence: ISequence, continueProcessingPredicate: () => boolean, pretty: boolean): IDiffResult {\n\tconst diffAlgo = new LcsDiff(originalSequence, modifiedSequence, continueProcessingPredicate);\n\treturn diffAlgo.ComputeDiff(pretty);\n}\n\nclass LineSequence implements ISequence {\n\n\tpublic readonly lines: string[];\n\tprivate readonly _startColumns: number[];\n\tprivate readonly _endColumns: number[];\n\n\tconstructor(lines: string[]) {\n\t\tconst startColumns: number[] = [];\n\t\tconst endColumns: number[] = [];\n\t\tfor (let i = 0, length = lines.length; i < length; i++) {\n\t\t\tstartColumns[i] = getFirstNonBlankColumn(lines[i], 1);\n\t\t\tendColumns[i] = getLastNonBlankColumn(lines[i], 1);\n\t\t}\n\t\tthis.lines = lines;\n\t\tthis._startColumns = startColumns;\n\t\tthis._endColumns = endColumns;\n\t}\n\n\tpublic getElements(): Int32Array | number[] | string[] {\n\t\tconst elements: string[] = [];\n\t\tfor (let i = 0, len = this.lines.length; i < len; i++) {\n\t\t\telements[i] = this.lines[i].substring(this._startColumns[i] - 1, this._endColumns[i] - 1);\n\t\t}\n\t\treturn elements;\n\t}\n\n\tpublic getStrictElement(index: number): string {\n\t\treturn this.lines[index];\n\t}\n\n\tpublic getStartLineNumber(i: number): number {\n\t\treturn i + 1;\n\t}\n\n\tpublic getEndLineNumber(i: number): number {\n\t\treturn i + 1;\n\t}\n\n\tpublic createCharSequence(shouldIgnoreTrimWhitespace: boolean, startIndex: number, endIndex: number): CharSequence {\n\t\tconst charCodes: number[] = [];\n\t\tconst lineNumbers: number[] = [];\n\t\tconst columns: number[] = [];\n\t\tlet len = 0;\n\t\tfor (let index = startIndex; index <= endIndex; index++) {\n\t\t\tconst lineContent = this.lines[index];\n\t\t\tconst startColumn = (shouldIgnoreTrimWhitespace ? this._startColumns[index] : 1);\n\t\t\tconst endColumn = (shouldIgnoreTrimWhitespace ? this._endColumns[index] : lineContent.length + 1);\n\t\t\tfor (let col = startColumn; col < endColumn; col++) {\n\t\t\t\tcharCodes[len] = lineContent.charCodeAt(col - 1);\n\t\t\t\tlineNumbers[len] = index + 1;\n\t\t\t\tcolumns[len] = col;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t\tif (!shouldIgnoreTrimWhitespace && index < endIndex) {\n\t\t\t\t// Add \\n if trim whitespace is not ignored\n\t\t\t\tcharCodes[len] = CharCode.LineFeed;\n\t\t\t\tlineNumbers[len] = index + 1;\n\t\t\t\tcolumns[len] = lineContent.length + 1;\n\t\t\t\tlen++;\n\t\t\t}\n\t\t}\n\t\treturn new CharSequence(charCodes, lineNumbers, columns);\n\t}\n}\n\nclass CharSequence implements ISequence {\n\n\tprivate readonly _charCodes: number[];\n\tprivate readonly _lineNumbers: number[];\n\tprivate readonly _columns: number[];\n\n\tconstructor(charCodes: number[], lineNumbers: number[], columns: number[]) {\n\t\tthis._charCodes = charCodes;\n\t\tthis._lineNumbers = lineNumbers;\n\t\tthis._columns = columns;\n\t}\n\n\tpublic toString() {\n\t\treturn (\n\t\t\t'[' + this._charCodes.map((s, idx) => (s === CharCode.LineFeed ? '\\\\n' : String.fromCharCode(s)) + `-(${this._lineNumbers[idx]},${this._columns[idx]})`).join(', ') + ']'\n\t\t);\n\t}\n\n\tprivate _assertIndex(index: number, arr: number[]): void {\n\t\tif (index < 0 || index >= arr.length) {\n\t\t\tthrow new Error(`Illegal index`);\n\t\t}\n\t}\n\n\tpublic getElements(): Int32Array | number[] | string[] {\n\t\treturn this._charCodes;\n\t}\n\n\tpublic getStartLineNumber(i: number): number {\n\t\tif (i > 0 && i === this._lineNumbers.length) {\n\t\t\t// the start line number of the element after the last element\n\t\t\t// is the end line number of the last element\n\t\t\treturn this.getEndLineNumber(i - 1);\n\t\t}\n\t\tthis._assertIndex(i, this._lineNumbers);\n\n\t\treturn this._lineNumbers[i];\n\t}\n\n\tpublic getEndLineNumber(i: number): number {\n\t\tif (i === -1) {\n\t\t\t// the end line number of the element before the first element\n\t\t\t// is the start line number of the first element\n\t\t\treturn this.getStartLineNumber(i + 1);\n\t\t}\n\t\tthis._assertIndex(i, this._lineNumbers);\n\n\t\tif (this._charCodes[i] === CharCode.LineFeed) {\n\t\t\treturn this._lineNumbers[i] + 1;\n\t\t}\n\t\treturn this._lineNumbers[i];\n\t}\n\n\tpublic getStartColumn(i: number): number {\n\t\tif (i > 0 && i === this._columns.length) {\n\t\t\t// the start column of the element after the last element\n\t\t\t// is the end column of the last element\n\t\t\treturn this.getEndColumn(i - 1);\n\t\t}\n\t\tthis._assertIndex(i, this._columns);\n\t\treturn this._columns[i];\n\t}\n\n\tpublic getEndColumn(i: number): number {\n\t\tif (i === -1) {\n\t\t\t// the end column of the element before the first element\n\t\t\t// is the start column of the first element\n\t\t\treturn this.getStartColumn(i + 1);\n\t\t}\n\t\tthis._assertIndex(i, this._columns);\n\n\t\tif (this._charCodes[i] === CharCode.LineFeed) {\n\t\t\treturn 1;\n\t\t}\n\t\treturn this._columns[i] + 1;\n\t}\n}\n\nclass CharChange implements ICharChange {\n\n\tpublic originalStartLineNumber: number;\n\tpublic originalStartColumn: number;\n\tpublic originalEndLineNumber: number;\n\tpublic originalEndColumn: number;\n\n\tpublic modifiedStartLineNumber: number;\n\tpublic modifiedStartColumn: number;\n\tpublic modifiedEndLineNumber: number;\n\tpublic modifiedEndColumn: number;\n\n\tconstructor(\n\t\toriginalStartLineNumber: number,\n\t\toriginalStartColumn: number,\n\t\toriginalEndLineNumber: number,\n\t\toriginalEndColumn: number,\n\t\tmodifiedStartLineNumber: number,\n\t\tmodifiedStartColumn: number,\n\t\tmodifiedEndLineNumber: number,\n\t\tmodifiedEndColumn: number\n\t) {\n\t\tthis.originalStartLineNumber = originalStartLineNumber;\n\t\tthis.originalStartColumn = originalStartColumn;\n\t\tthis.originalEndLineNumber = originalEndLineNumber;\n\t\tthis.originalEndColumn = originalEndColumn;\n\t\tthis.modifiedStartLineNumber = modifiedStartLineNumber;\n\t\tthis.modifiedStartColumn = modifiedStartColumn;\n\t\tthis.modifiedEndLineNumber = modifiedEndLineNumber;\n\t\tthis.modifiedEndColumn = modifiedEndColumn;\n\t}\n\n\tpublic static createFromDiffChange(diffChange: IDiffChange, originalCharSequence: CharSequence, modifiedCharSequence: CharSequence): CharChange {\n\t\tconst originalStartLineNumber = originalCharSequence.getStartLineNumber(diffChange.originalStart);\n\t\tconst originalStartColumn = originalCharSequence.getStartColumn(diffChange.originalStart);\n\t\tconst originalEndLineNumber = originalCharSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);\n\t\tconst originalEndColumn = originalCharSequence.getEndColumn(diffChange.originalStart + diffChange.originalLength - 1);\n\n\t\tconst modifiedStartLineNumber = modifiedCharSequence.getStartLineNumber(diffChange.modifiedStart);\n\t\tconst modifiedStartColumn = modifiedCharSequence.getStartColumn(diffChange.modifiedStart);\n\t\tconst modifiedEndLineNumber = modifiedCharSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n\t\tconst modifiedEndColumn = modifiedCharSequence.getEndColumn(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n\n\t\treturn new CharChange(\n\t\t\toriginalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn,\n\t\t\tmodifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn,\n\t\t);\n\t}\n}\n\nfunction postProcessCharChanges(rawChanges: IDiffChange[]): IDiffChange[] {\n\tif (rawChanges.length <= 1) {\n\t\treturn rawChanges;\n\t}\n\n\tconst result = [rawChanges[0]];\n\tlet prevChange = result[0];\n\n\tfor (let i = 1, len = rawChanges.length; i < len; i++) {\n\t\tconst currChange = rawChanges[i];\n\n\t\tconst originalMatchingLength = currChange.originalStart - (prevChange.originalStart + prevChange.originalLength);\n\t\tconst modifiedMatchingLength = currChange.modifiedStart - (prevChange.modifiedStart + prevChange.modifiedLength);\n\t\t// Both of the above should be equal, but the continueProcessingPredicate may prevent this from being true\n\t\tconst matchingLength = Math.min(originalMatchingLength, modifiedMatchingLength);\n\n\t\tif (matchingLength < MINIMUM_MATCHING_CHARACTER_LENGTH) {\n\t\t\t// Merge the current change into the previous one\n\t\t\tprevChange.originalLength = (currChange.originalStart + currChange.originalLength) - prevChange.originalStart;\n\t\t\tprevChange.modifiedLength = (currChange.modifiedStart + currChange.modifiedLength) - prevChange.modifiedStart;\n\t\t} else {\n\t\t\t// Add the current change\n\t\t\tresult.push(currChange);\n\t\t\tprevChange = currChange;\n\t\t}\n\t}\n\n\treturn result;\n}\n\nclass LineChange implements ILineChange {\n\tpublic originalStartLineNumber: number;\n\tpublic originalEndLineNumber: number;\n\tpublic modifiedStartLineNumber: number;\n\tpublic modifiedEndLineNumber: number;\n\tpublic charChanges: CharChange[] | undefined;\n\n\tconstructor(\n\t\toriginalStartLineNumber: number,\n\t\toriginalEndLineNumber: number,\n\t\tmodifiedStartLineNumber: number,\n\t\tmodifiedEndLineNumber: number,\n\t\tcharChanges: CharChange[] | undefined\n\t) {\n\t\tthis.originalStartLineNumber = originalStartLineNumber;\n\t\tthis.originalEndLineNumber = originalEndLineNumber;\n\t\tthis.modifiedStartLineNumber = modifiedStartLineNumber;\n\t\tthis.modifiedEndLineNumber = modifiedEndLineNumber;\n\t\tthis.charChanges = charChanges;\n\t}\n\n\tpublic static createFromDiffResult(shouldIgnoreTrimWhitespace: boolean, diffChange: IDiffChange, originalLineSequence: LineSequence, modifiedLineSequence: LineSequence, continueCharDiff: () => boolean, shouldComputeCharChanges: boolean, shouldPostProcessCharChanges: boolean): LineChange {\n\t\tlet originalStartLineNumber: number;\n\t\tlet originalEndLineNumber: number;\n\t\tlet modifiedStartLineNumber: number;\n\t\tlet modifiedEndLineNumber: number;\n\t\tlet charChanges: CharChange[] | undefined = undefined;\n\n\t\tif (diffChange.originalLength === 0) {\n\t\t\toriginalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart) - 1;\n\t\t\toriginalEndLineNumber = 0;\n\t\t} else {\n\t\t\toriginalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart);\n\t\t\toriginalEndLineNumber = originalLineSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);\n\t\t}\n\n\t\tif (diffChange.modifiedLength === 0) {\n\t\t\tmodifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart) - 1;\n\t\t\tmodifiedEndLineNumber = 0;\n\t\t} else {\n\t\t\tmodifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart);\n\t\t\tmodifiedEndLineNumber = modifiedLineSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n\t\t}\n\n\t\tif (shouldComputeCharChanges && diffChange.originalLength > 0 && diffChange.originalLength < 20 && diffChange.modifiedLength > 0 && diffChange.modifiedLength < 20 && continueCharDiff()) {\n\t\t\t// Compute character changes for diff chunks of at most 20 lines...\n\t\t\tconst originalCharSequence = originalLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.originalStart, diffChange.originalStart + diffChange.originalLength - 1);\n\t\t\tconst modifiedCharSequence = modifiedLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.modifiedStart, diffChange.modifiedStart + diffChange.modifiedLength - 1);\n\n\t\t\tif (originalCharSequence.getElements().length > 0 && modifiedCharSequence.getElements().length > 0) {\n\t\t\t\tlet rawChanges = computeDiff(originalCharSequence, modifiedCharSequence, continueCharDiff, true).changes;\n\n\t\t\t\tif (shouldPostProcessCharChanges) {\n\t\t\t\t\trawChanges = postProcessCharChanges(rawChanges);\n\t\t\t\t}\n\n\t\t\t\tcharChanges = [];\n\t\t\t\tfor (let i = 0, length = rawChanges.length; i < length; i++) {\n\t\t\t\t\tcharChanges.push(CharChange.createFromDiffChange(rawChanges[i], originalCharSequence, modifiedCharSequence));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn new LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges);\n\t}\n}\n\nexport interface IDiffComputerOpts {\n\tshouldComputeCharChanges: boolean;\n\tshouldPostProcessCharChanges: boolean;\n\tshouldIgnoreTrimWhitespace: boolean;\n\tshouldMakePrettyDiff: boolean;\n\tmaxComputationTime: number;\n}\n\nexport class DiffComputer {\n\n\tprivate readonly shouldComputeCharChanges: boolean;\n\tprivate readonly shouldPostProcessCharChanges: boolean;\n\tprivate readonly shouldIgnoreTrimWhitespace: boolean;\n\tprivate readonly shouldMakePrettyDiff: boolean;\n\tprivate readonly originalLines: string[];\n\tprivate readonly modifiedLines: string[];\n\tprivate readonly original: LineSequence;\n\tprivate readonly modified: LineSequence;\n\tprivate readonly continueLineDiff: () => boolean;\n\tprivate readonly continueCharDiff: () => boolean;\n\n\tconstructor(originalLines: string[], modifiedLines: string[], opts: IDiffComputerOpts) {\n\t\tthis.shouldComputeCharChanges = opts.shouldComputeCharChanges;\n\t\tthis.shouldPostProcessCharChanges = opts.shouldPostProcessCharChanges;\n\t\tthis.shouldIgnoreTrimWhitespace = opts.shouldIgnoreTrimWhitespace;\n\t\tthis.shouldMakePrettyDiff = opts.shouldMakePrettyDiff;\n\t\tthis.originalLines = originalLines;\n\t\tthis.modifiedLines = modifiedLines;\n\t\tthis.original = new LineSequence(originalLines);\n\t\tthis.modified = new LineSequence(modifiedLines);\n\n\t\tthis.continueLineDiff = createContinueProcessingPredicate(opts.maxComputationTime);\n\t\tthis.continueCharDiff = createContinueProcessingPredicate(opts.maxComputationTime === 0 ? 0 : Math.min(opts.maxComputationTime, 5000)); // never run after 5s for character changes...\n\t}\n\n\tpublic computeDiff(): IDiffComputerResult {\n\n\t\tif (this.original.lines.length === 1 && this.original.lines[0].length === 0) {\n\t\t\t// empty original => fast path\n\t\t\tif (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) {\n\t\t\t\treturn {\n\t\t\t\t\tquitEarly: false,\n\t\t\t\t\tchanges: []\n\t\t\t\t};\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tquitEarly: false,\n\t\t\t\tchanges: [{\n\t\t\t\t\toriginalStartLineNumber: 1,\n\t\t\t\t\toriginalEndLineNumber: 1,\n\t\t\t\t\tmodifiedStartLineNumber: 1,\n\t\t\t\t\tmodifiedEndLineNumber: this.modified.lines.length,\n\t\t\t\t\tcharChanges: undefined\n\t\t\t\t}]\n\t\t\t};\n\t\t}\n\n\t\tif (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) {\n\t\t\t// empty modified => fast path\n\t\t\treturn {\n\t\t\t\tquitEarly: false,\n\t\t\t\tchanges: [{\n\t\t\t\t\toriginalStartLineNumber: 1,\n\t\t\t\t\toriginalEndLineNumber: this.original.lines.length,\n\t\t\t\t\tmodifiedStartLineNumber: 1,\n\t\t\t\t\tmodifiedEndLineNumber: 1,\n\t\t\t\t\tcharChanges: undefined\n\t\t\t\t}]\n\t\t\t};\n\t\t}\n\n\t\tconst diffResult = computeDiff(this.original, this.modified, this.continueLineDiff, this.shouldMakePrettyDiff);\n\t\tconst rawChanges = diffResult.changes;\n\t\tconst quitEarly = diffResult.quitEarly;\n\n\t\t// The diff is always computed with ignoring trim whitespace\n\t\t// This ensures we get the prettiest diff\n\n\t\tif (this.shouldIgnoreTrimWhitespace) {\n\t\t\tconst lineChanges: LineChange[] = [];\n\t\t\tfor (let i = 0, length = rawChanges.length; i < length; i++) {\n\t\t\t\tlineChanges.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, rawChanges[i], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));\n\t\t\t}\n\t\t\treturn {\n\t\t\t\tquitEarly: quitEarly,\n\t\t\t\tchanges: lineChanges\n\t\t\t};\n\t\t}\n\n\t\t// Need to post-process and introduce changes where the trim whitespace is different\n\t\t// Note that we are looping starting at -1 to also cover the lines before the first change\n\t\tconst result: LineChange[] = [];\n\n\t\tlet originalLineIndex = 0;\n\t\tlet modifiedLineIndex = 0;\n\t\tfor (let i = -1 /* !!!! */, len = rawChanges.length; i < len; i++) {\n\t\t\tconst nextChange = (i + 1 < len ? rawChanges[i + 1] : null);\n\t\t\tconst originalStop = (nextChange ? nextChange.originalStart : this.originalLines.length);\n\t\t\tconst modifiedStop = (nextChange ? nextChange.modifiedStart : this.modifiedLines.length);\n\n\t\t\twhile (originalLineIndex < originalStop && modifiedLineIndex < modifiedStop) {\n\t\t\t\tconst originalLine = this.originalLines[originalLineIndex];\n\t\t\t\tconst modifiedLine = this.modifiedLines[modifiedLineIndex];\n\n\t\t\t\tif (originalLine !== modifiedLine) {\n\t\t\t\t\t// These lines differ only in trim whitespace\n\n\t\t\t\t\t// Check the leading whitespace\n\t\t\t\t\t{\n\t\t\t\t\t\tlet originalStartColumn = getFirstNonBlankColumn(originalLine, 1);\n\t\t\t\t\t\tlet modifiedStartColumn = getFirstNonBlankColumn(modifiedLine, 1);\n\t\t\t\t\t\twhile (originalStartColumn > 1 && modifiedStartColumn > 1) {\n\t\t\t\t\t\t\tconst originalChar = originalLine.charCodeAt(originalStartColumn - 2);\n\t\t\t\t\t\t\tconst modifiedChar = modifiedLine.charCodeAt(modifiedStartColumn - 2);\n\t\t\t\t\t\t\tif (originalChar !== modifiedChar) {\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\toriginalStartColumn--;\n\t\t\t\t\t\t\tmodifiedStartColumn--;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (originalStartColumn > 1 || modifiedStartColumn > 1) {\n\t\t\t\t\t\t\tthis._pushTrimWhitespaceCharChange(result,\n\t\t\t\t\t\t\t\toriginalLineIndex + 1, 1, originalStartColumn,\n\t\t\t\t\t\t\t\tmodifiedLineIndex + 1, 1, modifiedStartColumn\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\t// Check the trailing whitespace\n\t\t\t\t\t{\n\t\t\t\t\t\tlet originalEndColumn = getLastNonBlankColumn(originalLine, 1);\n\t\t\t\t\t\tlet modifiedEndColumn = getLastNonBlankColumn(modifiedLine, 1);\n\t\t\t\t\t\tconst originalMaxColumn = originalLine.length + 1;\n\t\t\t\t\t\tconst modifiedMaxColumn = modifiedLine.length + 1;\n\t\t\t\t\t\twhile (originalEndColumn < originalMaxColumn && modifiedEndColumn < modifiedMaxColumn) {\n\t\t\t\t\t\t\tconst originalChar = originalLine.charCodeAt(originalEndColumn - 1);\n\t\t\t\t\t\t\tconst modifiedChar = originalLine.charCodeAt(modifiedEndColumn - 1);\n\t\t\t\t\t\t\tif (originalChar !== modifiedChar) {\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\toriginalEndColumn++;\n\t\t\t\t\t\t\tmodifiedEndColumn++;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (originalEndColumn < originalMaxColumn || modifiedEndColumn < modifiedMaxColumn) {\n\t\t\t\t\t\t\tthis._pushTrimWhitespaceCharChange(result,\n\t\t\t\t\t\t\t\toriginalLineIndex + 1, originalEndColumn, originalMaxColumn,\n\t\t\t\t\t\t\t\tmodifiedLineIndex + 1, modifiedEndColumn, modifiedMaxColumn\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\toriginalLineIndex++;\n\t\t\t\tmodifiedLineIndex++;\n\t\t\t}\n\n\t\t\tif (nextChange) {\n\t\t\t\t// Emit the actual change\n\t\t\t\tresult.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, nextChange, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));\n\n\t\t\t\toriginalLineIndex += nextChange.originalLength;\n\t\t\t\tmodifiedLineIndex += nextChange.modifiedLength;\n\t\t\t}\n\t\t}\n\n\t\treturn {\n\t\t\tquitEarly: quitEarly,\n\t\t\tchanges: result\n\t\t};\n\t}\n\n\tprivate _pushTrimWhitespaceCharChange(\n\t\tresult: LineChange[],\n\t\toriginalLineNumber: number, originalStartColumn: number, originalEndColumn: number,\n\t\tmodifiedLineNumber: number, modifiedStartColumn: number, modifiedEndColumn: number\n\t): void {\n\t\tif (this._mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn)) {\n\t\t\t// Merged into previous\n\t\t\treturn;\n\t\t}\n\n\t\tlet charChanges: CharChange[] | undefined = undefined;\n\t\tif (this.shouldComputeCharChanges) {\n\t\t\tcharChanges = [new CharChange(\n\t\t\t\toriginalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn,\n\t\t\t\tmodifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn\n\t\t\t)];\n\t\t}\n\t\tresult.push(new LineChange(\n\t\t\toriginalLineNumber, originalLineNumber,\n\t\t\tmodifiedLineNumber, modifiedLineNumber,\n\t\t\tcharChanges\n\t\t));\n\t}\n\n\tprivate _mergeTrimWhitespaceCharChange(\n\t\tresult: LineChange[],\n\t\toriginalLineNumber: number, originalStartColumn: number, originalEndColumn: number,\n\t\tmodifiedLineNumber: number, modifiedStartColumn: number, modifiedEndColumn: number\n\t): boolean {\n\t\tconst len = result.length;\n\t\tif (len === 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tconst prevChange = result[len - 1];\n\n\t\tif (prevChange.originalEndLineNumber === 0 || prevChange.modifiedEndLineNumber === 0) {\n\t\t\t// Don't merge with inserts/deletes\n\t\t\treturn false;\n\t\t}\n\n\t\tif (prevChange.originalEndLineNumber === originalLineNumber && prevChange.modifiedEndLineNumber === modifiedLineNumber) {\n\t\t\tif (this.shouldComputeCharChanges && prevChange.charChanges) {\n\t\t\t\tprevChange.charChanges.push(new CharChange(\n\t\t\t\t\toriginalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn,\n\t\t\t\t\tmodifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn\n\t\t\t\t));\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tif (prevChange.originalEndLineNumber + 1 === originalLineNumber && prevChange.modifiedEndLineNumber + 1 === modifiedLineNumber) {\n\t\t\tprevChange.originalEndLineNumber = originalLineNumber;\n\t\t\tprevChange.modifiedEndLineNumber = modifiedLineNumber;\n\t\t\tif (this.shouldComputeCharChanges && prevChange.charChanges) {\n\t\t\t\tprevChange.charChanges.push(new CharChange(\n\t\t\t\t\toriginalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn,\n\t\t\t\t\tmodifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn\n\t\t\t\t));\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n}\n\nfunction getFirstNonBlankColumn(txt: string, defaultValue: number): number {\n\tconst r = strings.firstNonWhitespaceIndex(txt);\n\tif (r === -1) {\n\t\treturn defaultValue;\n\t}\n\treturn r + 1;\n}\n\nfunction getLastNonBlankColumn(txt: string, defaultValue: number): number {\n\tconst r = strings.lastNonWhitespaceIndex(txt);\n\tif (r === -1) {\n\t\treturn defaultValue;\n\t}\n\treturn r + 2;\n}\n\nfunction createContinueProcessingPredicate(maximumRuntime: number): () => boolean {\n\tif (maximumRuntime === 0) {\n\t\treturn () => true;\n\t}\n\n\tconst startTime = Date.now();\n\treturn () => {\n\t\treturn Date.now() - startTime < maximumRuntime;\n\t};\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { LegacyLinesDiffComputer } from 'vs/editor/common/diff/legacyLinesDiffComputer';\nimport { DefaultLinesDiffComputer } from 'vs/editor/common/diff/defaultLinesDiffComputer/defaultLinesDiffComputer';\nimport { ILinesDiffComputer } from 'vs/editor/common/diff/linesDiffComputer';\n\nexport const linesDiffComputers = {\n\tgetLegacy: () => new LegacyLinesDiffComputer(),\n\tgetDefault: () => new DefaultLinesDiffComputer(),\n} satisfies Record<string, () => ILinesDiffComputer>;\n","/*---------------------------------------------------------------------------------------------\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 { Color, HSLA } from 'vs/base/common/color';\nimport { IPosition } from 'vs/editor/common/core/position';\nimport { IRange } from 'vs/editor/common/core/range';\nimport { IColor, IColorInformation } from 'vs/editor/common/languages';\n\nexport interface IDocumentColorComputerTarget {\n\tgetValue(): string;\n\tpositionAt(offset: number): IPosition;\n\tfindMatches(regex: RegExp): RegExpMatchArray[];\n}\n\nfunction _parseCaptureGroups(captureGroups: IterableIterator<string>) {\n\tconst values = [];\n\tfor (const captureGroup of captureGroups) {\n\t\tconst parsedNumber = Number(captureGroup);\n\t\tif (parsedNumber || parsedNumber === 0 && captureGroup.replace(/\\s/g, '') !== '') {\n\t\t\tvalues.push(parsedNumber);\n\t\t}\n\t}\n\treturn values;\n}\n\nfunction _toIColor(r: number, g: number, b: number, a: number): IColor {\n\treturn {\n\t\tred: r / 255,\n\t\tblue: b / 255,\n\t\tgreen: g / 255,\n\t\talpha: a\n\t};\n}\n\nfunction _findRange(model: IDocumentColorComputerTarget, match: RegExpMatchArray): IRange | undefined {\n\tconst index = match.index;\n\tconst length = match[0].length;\n\tif (!index) {\n\t\treturn;\n\t}\n\tconst startPosition = model.positionAt(index);\n\tconst range: IRange = {\n\t\tstartLineNumber: startPosition.lineNumber,\n\t\tstartColumn: startPosition.column,\n\t\tendLineNumber: startPosition.lineNumber,\n\t\tendColumn: startPosition.column + length\n\t};\n\treturn range;\n}\n\nfunction _findHexColorInformation(range: IRange | undefined, hexValue: string) {\n\tif (!range) {\n\t\treturn;\n\t}\n\tconst parsedHexColor = Color.Format.CSS.parseHex(hexValue);\n\tif (!parsedHexColor) {\n\t\treturn;\n\t}\n\treturn {\n\t\trange: range,\n\t\tcolor: _toIColor(parsedHexColor.rgba.r, parsedHexColor.rgba.g, parsedHexColor.rgba.b, parsedHexColor.rgba.a)\n\t};\n}\n\nfunction _findRGBColorInformation(range: IRange | undefined, matches: RegExpMatchArray[], isAlpha: boolean) {\n\tif (!range || matches.length !== 1) {\n\t\treturn;\n\t}\n\tconst match = matches[0]!;\n\tconst captureGroups = match.values();\n\tconst parsedRegex = _parseCaptureGroups(captureGroups);\n\treturn {\n\t\trange: range,\n\t\tcolor: _toIColor(parsedRegex[0], parsedRegex[1], parsedRegex[2], isAlpha ? parsedRegex[3] : 1)\n\t};\n}\n\nfunction _findHSLColorInformation(range: IRange | undefined, matches: RegExpMatchArray[], isAlpha: boolean) {\n\tif (!range || matches.length !== 1) {\n\t\treturn;\n\t}\n\tconst match = matches[0]!;\n\tconst captureGroups = match.values();\n\tconst parsedRegex = _parseCaptureGroups(captureGroups);\n\tconst colorEquivalent = new Color(new HSLA(parsedRegex[0], parsedRegex[1] / 100, parsedRegex[2] / 100, isAlpha ? parsedRegex[3] : 1));\n\treturn {\n\t\trange: range,\n\t\tcolor: _toIColor(colorEquivalent.rgba.r, colorEquivalent.rgba.g, colorEquivalent.rgba.b, colorEquivalent.rgba.a)\n\t};\n}\n\nfunction _findMatches(model: IDocumentColorComputerTarget | string, regex: RegExp): RegExpMatchArray[] {\n\tif (typeof model === 'string') {\n\t\treturn [...model.matchAll(regex)];\n\t} else {\n\t\treturn model.findMatches(regex);\n\t}\n}\n\nfunction computeColors(model: IDocumentColorComputerTarget): IColorInformation[] {\n\tconst result: IColorInformation[] = [];\n\t// Early validation for RGB and HSL\n\tconst initialValidationRegex = /\\b(rgb|rgba|hsl|hsla)(\\([0-9\\s,.\\%]*\\))|(#)([A-Fa-f0-9]{3})\\b|(#)([A-Fa-f0-9]{4})\\b|(#)([A-Fa-f0-9]{6})\\b|(#)([A-Fa-f0-9]{8})\\b/gm;\n\tconst initialValidationMatches = _findMatches(model, initialValidationRegex);\n\n\t// Potential colors have been found, validate the parameters\n\tif (initialValidationMatches.length > 0) {\n\t\tfor (const initialMatch of initialValidationMatches) {\n\t\t\tconst initialCaptureGroups = initialMatch.filter(captureGroup => captureGroup !== undefined);\n\t\t\tconst colorScheme = initialCaptureGroups[1];\n\t\t\tconst colorParameters = initialCaptureGroups[2];\n\t\t\tif (!colorParameters) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tlet colorInformation;\n\t\t\tif (colorScheme === 'rgb') {\n\t\t\t\tconst regexParameters = /^\\(\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*\\)$/gm;\n\t\t\t\tcolorInformation = _findRGBColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), false);\n\t\t\t} else if (colorScheme === 'rgba') {\n\t\t\t\tconst regexParameters = /^\\(\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\\s*,\\s*(0[.][0-9]+|[.][0-9]+|[01][.]|[01])\\s*\\)$/gm;\n\t\t\t\tcolorInformation = _findRGBColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), true);\n\t\t\t} else if (colorScheme === 'hsl') {\n\t\t\t\tconst regexParameters = /^\\(\\s*(36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])\\s*,\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*,\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*\\)$/gm;\n\t\t\t\tcolorInformation = _findHSLColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), false);\n\t\t\t} else if (colorScheme === 'hsla') {\n\t\t\t\tconst regexParameters = /^\\(\\s*(36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])\\s*,\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*,\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*,\\s*(0[.][0-9]+|[.][0-9]+|[01][.]|[01])\\s*\\)$/gm;\n\t\t\t\tcolorInformation = _findHSLColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), true);\n\t\t\t} else if (colorScheme === '#') {\n\t\t\t\tcolorInformation = _findHexColorInformation(_findRange(model, initialMatch), colorScheme + colorParameters);\n\t\t\t}\n\t\t\tif (colorInformation) {\n\t\t\t\tresult.push(colorInformation);\n\t\t\t}\n\t\t}\n\t}\n\treturn result;\n}\n\n/**\n * Returns an array of all default document colors in the provided document\n */\nexport function computeDefaultDocumentColors(model: IDocumentColorComputerTarget): IColorInformation[] {\n\tif (!model || typeof model.getValue !== 'function' || typeof model.positionAt !== 'function') {\n\t\t// Unknown caller!\n\t\treturn [];\n\t}\n\treturn computeColors(model);\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\nimport { CharacterClassifier } from 'vs/editor/common/core/characterClassifier';\nimport { ILink } from 'vs/editor/common/languages';\n\nexport interface ILinkComputerTarget {\n\tgetLineCount(): number;\n\tgetLineContent(lineNumber: number): string;\n}\n\nexport const enum State {\n\tInvalid = 0,\n\tStart = 1,\n\tH = 2,\n\tHT = 3,\n\tHTT = 4,\n\tHTTP = 5,\n\tF = 6,\n\tFI = 7,\n\tFIL = 8,\n\tBeforeColon = 9,\n\tAfterColon = 10,\n\tAlmostThere = 11,\n\tEnd = 12,\n\tAccept = 13,\n\tLastKnownState = 14 // marker, custom states may follow\n}\n\nexport type Edge = [State, number, State];\n\nclass Uint8Matrix {\n\n\tprivate readonly _data: Uint8Array;\n\tpublic readonly rows: number;\n\tpublic readonly cols: number;\n\n\tconstructor(rows: number, cols: number, defaultValue: number) {\n\t\tconst data = new Uint8Array(rows * cols);\n\t\tfor (let i = 0, len = rows * cols; i < len; i++) {\n\t\t\tdata[i] = defaultValue;\n\t\t}\n\n\t\tthis._data = data;\n\t\tthis.rows = rows;\n\t\tthis.cols = cols;\n\t}\n\n\tpublic get(row: number, col: number): number {\n\t\treturn this._data[row * this.cols + col];\n\t}\n\n\tpublic set(row: number, col: number, value: number): void {\n\t\tthis._data[row * this.cols + col] = value;\n\t}\n}\n\nexport class StateMachine {\n\n\tprivate readonly _states: Uint8Matrix;\n\tprivate readonly _maxCharCode: number;\n\n\tconstructor(edges: Edge[]) {\n\t\tlet maxCharCode = 0;\n\t\tlet maxState = State.Invalid;\n\t\tfor (let i = 0, len = edges.length; i < len; i++) {\n\t\t\tconst [from, chCode, to] = edges[i];\n\t\t\tif (chCode > maxCharCode) {\n\t\t\t\tmaxCharCode = chCode;\n\t\t\t}\n\t\t\tif (from > maxState) {\n\t\t\t\tmaxState = from;\n\t\t\t}\n\t\t\tif (to > maxState) {\n\t\t\t\tmaxState = to;\n\t\t\t}\n\t\t}\n\n\t\tmaxCharCode++;\n\t\tmaxState++;\n\n\t\tconst states = new Uint8Matrix(maxState, maxCharCode, State.Invalid);\n\t\tfor (let i = 0, len = edges.length; i < len; i++) {\n\t\t\tconst [from, chCode, to] = edges[i];\n\t\t\tstates.set(from, chCode, to);\n\t\t}\n\n\t\tthis._states = states;\n\t\tthis._maxCharCode = maxCharCode;\n\t}\n\n\tpublic nextState(currentState: State, chCode: number): State {\n\t\tif (chCode < 0 || chCode >= this._maxCharCode) {\n\t\t\treturn State.Invalid;\n\t\t}\n\t\treturn this._states.get(currentState, chCode);\n\t}\n}\n\n// State machine for http:// or https:// or file://\nlet _stateMachine: StateMachine | null = null;\nfunction getStateMachine(): StateMachine {\n\tif (_stateMachine === null) {\n\t\t_stateMachine = new StateMachine([\n\t\t\t[State.Start, CharCode.h, State.H],\n\t\t\t[State.Start, CharCode.H, State.H],\n\t\t\t[State.Start, CharCode.f, State.F],\n\t\t\t[State.Start, CharCode.F, State.F],\n\n\t\t\t[State.H, CharCode.t, State.HT],\n\t\t\t[State.H, CharCode.T, State.HT],\n\n\t\t\t[State.HT, CharCode.t, State.HTT],\n\t\t\t[State.HT, CharCode.T, State.HTT],\n\n\t\t\t[State.HTT, CharCode.p, State.HTTP],\n\t\t\t[State.HTT, CharCode.P, State.HTTP],\n\n\t\t\t[State.HTTP, CharCode.s, State.BeforeColon],\n\t\t\t[State.HTTP, CharCode.S, State.BeforeColon],\n\t\t\t[State.HTTP, CharCode.Colon, State.AfterColon],\n\n\t\t\t[State.F, CharCode.i, State.FI],\n\t\t\t[State.F, CharCode.I, State.FI],\n\n\t\t\t[State.FI, CharCode.l, State.FIL],\n\t\t\t[State.FI, CharCode.L, State.FIL],\n\n\t\t\t[State.FIL, CharCode.e, State.BeforeColon],\n\t\t\t[State.FIL, CharCode.E, State.BeforeColon],\n\n\t\t\t[State.BeforeColon, CharCode.Colon, State.AfterColon],\n\n\t\t\t[State.AfterColon, CharCode.Slash, State.AlmostThere],\n\n\t\t\t[State.AlmostThere, CharCode.Slash, State.End],\n\t\t]);\n\t}\n\treturn _stateMachine;\n}\n\n\nconst enum CharacterClass {\n\tNone = 0,\n\tForceTermination = 1,\n\tCannotEndIn = 2\n}\n\nlet _classifier: CharacterClassifier<CharacterClass> | null = null;\nfunction getClassifier(): CharacterClassifier<CharacterClass> {\n\tif (_classifier === null) {\n\t\t_classifier = new CharacterClassifier<CharacterClass>(CharacterClass.None);\n\n\t\t// allow-any-unicode-next-line\n\t\tconst FORCE_TERMINATION_CHARACTERS = ' \\t<>\\'\\\"、。｡､，．：；‘〈「『〔（［｛｢｣｝］）〕』」〉’｀～…';\n\t\tfor (let i = 0; i < FORCE_TERMINATION_CHARACTERS.length; i++) {\n\t\t\t_classifier.set(FORCE_TERMINATION_CHARACTERS.charCodeAt(i), CharacterClass.ForceTermination);\n\t\t}\n\n\t\tconst CANNOT_END_WITH_CHARACTERS = '.,;:';\n\t\tfor (let i = 0; i < CANNOT_END_WITH_CHARACTERS.length; i++) {\n\t\t\t_classifier.set(CANNOT_END_WITH_CHARACTERS.charCodeAt(i), CharacterClass.CannotEndIn);\n\t\t}\n\t}\n\treturn _classifier;\n}\n\nexport class LinkComputer {\n\n\tprivate static _createLink(classifier: CharacterClassifier<CharacterClass>, line: string, lineNumber: number, linkBeginIndex: number, linkEndIndex: number): ILink {\n\t\t// Do not allow to end link in certain characters...\n\t\tlet lastIncludedCharIndex = linkEndIndex - 1;\n\t\tdo {\n\t\t\tconst chCode = line.charCodeAt(lastIncludedCharIndex);\n\t\t\tconst chClass = classifier.get(chCode);\n\t\t\tif (chClass !== CharacterClass.CannotEndIn) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tlastIncludedCharIndex--;\n\t\t} while (lastIncludedCharIndex > linkBeginIndex);\n\n\t\t// Handle links enclosed in parens, square brackets and curlys.\n\t\tif (linkBeginIndex > 0) {\n\t\t\tconst charCodeBeforeLink = line.charCodeAt(linkBeginIndex - 1);\n\t\t\tconst lastCharCodeInLink = line.charCodeAt(lastIncludedCharIndex);\n\n\t\t\tif (\n\t\t\t\t(charCodeBeforeLink === CharCode.OpenParen && lastCharCodeInLink === CharCode.CloseParen)\n\t\t\t\t|| (charCodeBeforeLink === CharCode.OpenSquareBracket && lastCharCodeInLink === CharCode.CloseSquareBracket)\n\t\t\t\t|| (charCodeBeforeLink === CharCode.OpenCurlyBrace && lastCharCodeInLink === CharCode.CloseCurlyBrace)\n\t\t\t) {\n\t\t\t\t// Do not end in ) if ( is before the link start\n\t\t\t\t// Do not end in ] if [ is before the link start\n\t\t\t\t// Do not end in } if { is before the link start\n\t\t\t\tlastIncludedCharIndex--;\n\t\t\t}\n\t\t}\n\n\t\treturn {\n\t\t\trange: {\n\t\t\t\tstartLineNumber: lineNumber,\n\t\t\t\tstartColumn: linkBeginIndex + 1,\n\t\t\t\tendLineNumber: lineNumber,\n\t\t\t\tendColumn: lastIncludedCharIndex + 2\n\t\t\t},\n\t\t\turl: line.substring(linkBeginIndex, lastIncludedCharIndex + 1)\n\t\t};\n\t}\n\n\tpublic static computeLinks(model: ILinkComputerTarget, stateMachine: StateMachine = getStateMachine()): ILink[] {\n\t\tconst classifier = getClassifier();\n\n\t\tconst result: ILink[] = [];\n\t\tfor (let i = 1, lineCount = model.getLineCount(); i <= lineCount; i++) {\n\t\t\tconst line = model.getLineContent(i);\n\t\t\tconst len = line.length;\n\n\t\t\tlet j = 0;\n\t\t\tlet linkBeginIndex = 0;\n\t\t\tlet linkBeginChCode = 0;\n\t\t\tlet state = State.Start;\n\t\t\tlet hasOpenParens = false;\n\t\t\tlet hasOpenSquareBracket = false;\n\t\t\tlet inSquareBrackets = false;\n\t\t\tlet hasOpenCurlyBracket = false;\n\n\t\t\twhile (j < len) {\n\n\t\t\t\tlet resetStateMachine = false;\n\t\t\t\tconst chCode = line.charCodeAt(j);\n\n\t\t\t\tif (state === State.Accept) {\n\t\t\t\t\tlet chClass: CharacterClass;\n\t\t\t\t\tswitch (chCode) {\n\t\t\t\t\t\tcase CharCode.OpenParen:\n\t\t\t\t\t\t\thasOpenParens = true;\n\t\t\t\t\t\t\tchClass = CharacterClass.None;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase CharCode.CloseParen:\n\t\t\t\t\t\t\tchClass = (hasOpenParens ? CharacterClass.None : CharacterClass.ForceTermination);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase CharCode.OpenSquareBracket:\n\t\t\t\t\t\t\tinSquareBrackets = true;\n\t\t\t\t\t\t\thasOpenSquareBracket = true;\n\t\t\t\t\t\t\tchClass = CharacterClass.None;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase CharCode.CloseSquareBracket:\n\t\t\t\t\t\t\tinSquareBrackets = false;\n\t\t\t\t\t\t\tchClass = (hasOpenSquareBracket ? CharacterClass.None : CharacterClass.ForceTermination);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase CharCode.OpenCurlyBrace:\n\t\t\t\t\t\t\thasOpenCurlyBracket = true;\n\t\t\t\t\t\t\tchClass = CharacterClass.None;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase CharCode.CloseCurlyBrace:\n\t\t\t\t\t\t\tchClass = (hasOpenCurlyBracket ? CharacterClass.None : CharacterClass.ForceTermination);\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t// The following three rules make it that ' or \" or ` are allowed inside links\n\t\t\t\t\t\t// only if the link is wrapped by some other quote character\n\t\t\t\t\t\tcase CharCode.SingleQuote:\n\t\t\t\t\t\tcase CharCode.DoubleQuote:\n\t\t\t\t\t\tcase CharCode.BackTick:\n\t\t\t\t\t\t\tif (linkBeginChCode === chCode) {\n\t\t\t\t\t\t\t\tchClass = CharacterClass.ForceTermination;\n\t\t\t\t\t\t\t} else if (linkBeginChCode === CharCode.SingleQuote || linkBeginChCode === CharCode.DoubleQuote || linkBeginChCode === CharCode.BackTick) {\n\t\t\t\t\t\t\t\tchClass = CharacterClass.None;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tchClass = CharacterClass.ForceTermination;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase CharCode.Asterisk:\n\t\t\t\t\t\t\t// `*` terminates a link if the link began with `*`\n\t\t\t\t\t\t\tchClass = (linkBeginChCode === CharCode.Asterisk) ? CharacterClass.ForceTermination : CharacterClass.None;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase CharCode.Pipe:\n\t\t\t\t\t\t\t// `|` terminates a link if the link began with `|`\n\t\t\t\t\t\t\tchClass = (linkBeginChCode === CharCode.Pipe) ? CharacterClass.ForceTermination : CharacterClass.None;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase CharCode.Space:\n\t\t\t\t\t\t\t// ` ` allow space in between [ and ]\n\t\t\t\t\t\t\tchClass = (inSquareBrackets ? CharacterClass.None : CharacterClass.ForceTermination);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tchClass = classifier.get(chCode);\n\t\t\t\t\t}\n\n\t\t\t\t\t// Check if character terminates link\n\t\t\t\t\tif (chClass === CharacterClass.ForceTermination) {\n\t\t\t\t\t\tresult.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, j));\n\t\t\t\t\t\tresetStateMachine = true;\n\t\t\t\t\t}\n\t\t\t\t} else if (state === State.End) {\n\n\t\t\t\t\tlet chClass: CharacterClass;\n\t\t\t\t\tif (chCode === CharCode.OpenSquareBracket) {\n\t\t\t\t\t\t// Allow for the authority part to contain ipv6 addresses which contain [ and ]\n\t\t\t\t\t\thasOpenSquareBracket = true;\n\t\t\t\t\t\tchClass = CharacterClass.None;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tchClass = classifier.get(chCode);\n\t\t\t\t\t}\n\n\t\t\t\t\t// Check if character terminates link\n\t\t\t\t\tif (chClass === CharacterClass.ForceTermination) {\n\t\t\t\t\t\tresetStateMachine = true;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstate = State.Accept;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tstate = stateMachine.nextState(state, chCode);\n\t\t\t\t\tif (state === State.Invalid) {\n\t\t\t\t\t\tresetStateMachine = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (resetStateMachine) {\n\t\t\t\t\tstate = State.Start;\n\t\t\t\t\thasOpenParens = false;\n\t\t\t\t\thasOpenSquareBracket = false;\n\t\t\t\t\thasOpenCurlyBracket = false;\n\n\t\t\t\t\t// Record where the link started\n\t\t\t\t\tlinkBeginIndex = j + 1;\n\t\t\t\t\tlinkBeginChCode = chCode;\n\t\t\t\t}\n\n\t\t\t\tj++;\n\t\t\t}\n\n\t\t\tif (state === State.Accept) {\n\t\t\t\tresult.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, len));\n\t\t\t}\n\n\t\t}\n\n\t\treturn result;\n\t}\n}\n\n/**\n * Returns an array of all links contains in the provided\n * document. *Note* that this operation is computational\n * expensive and should not run in the UI thread.\n */\nexport function computeLinks(model: ILinkComputerTarget | null): ILink[] {\n\tif (!model || typeof model.getLineCount !== 'function' || typeof model.getLineContent !== 'function') {\n\t\t// Unknown caller!\n\t\treturn [];\n\t}\n\treturn LinkComputer.computeLinks(model);\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { IRange } from 'vs/editor/common/core/range';\nimport { IInplaceReplaceSupportResult } from 'vs/editor/common/languages';\n\nexport class BasicInplaceReplace {\n\n\tpublic static readonly INSTANCE = new BasicInplaceReplace();\n\n\tpublic navigateValueSet(range1: IRange, text1: string, range2: IRange, text2: string | null, up: boolean): IInplaceReplaceSupportResult | null {\n\n\t\tif (range1 && text1) {\n\t\t\tconst result = this.doNavigateValueSet(text1, up);\n\t\t\tif (result) {\n\t\t\t\treturn {\n\t\t\t\t\trange: range1,\n\t\t\t\t\tvalue: result\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\tif (range2 && text2) {\n\t\t\tconst result = this.doNavigateValueSet(text2, up);\n\t\t\tif (result) {\n\t\t\t\treturn {\n\t\t\t\t\trange: range2,\n\t\t\t\t\tvalue: result\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate doNavigateValueSet(text: string, up: boolean): string | null {\n\t\tconst numberResult = this.numberReplace(text, up);\n\t\tif (numberResult !== null) {\n\t\t\treturn numberResult;\n\t\t}\n\t\treturn this.textReplace(text, up);\n\t}\n\n\tprivate numberReplace(value: string, up: boolean): string | null {\n\t\tconst precision = Math.pow(10, value.length - (value.lastIndexOf('.') + 1));\n\t\tlet n1 = Number(value);\n\t\tconst n2 = parseFloat(value);\n\n\t\tif (!isNaN(n1) && !isNaN(n2) && n1 === n2) {\n\n\t\t\tif (n1 === 0 && !up) {\n\t\t\t\treturn null; // don't do negative\n\t\t\t\t//\t\t\t} else if(n1 === 9 && up) {\n\t\t\t\t//\t\t\t\treturn null; // don't insert 10 into a number\n\t\t\t} else {\n\t\t\t\tn1 = Math.floor(n1 * precision);\n\t\t\t\tn1 += up ? precision : -precision;\n\t\t\t\treturn String(n1 / precision);\n\t\t\t}\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate readonly _defaultValueSet: string[][] = [\n\t\t['true', 'false'],\n\t\t['True', 'False'],\n\t\t['Private', 'Public', 'Friend', 'ReadOnly', 'Partial', 'Protected', 'WriteOnly'],\n\t\t['public', 'protected', 'private'],\n\t];\n\n\tprivate textReplace(value: string, up: boolean): string | null {\n\t\treturn this.valueSetsReplace(this._defaultValueSet, value, up);\n\t}\n\n\tprivate valueSetsReplace(valueSets: string[][], value: string, up: boolean): string | null {\n\t\tlet result: string | null = null;\n\t\tfor (let i = 0, len = valueSets.length; result === null && i < len; i++) {\n\t\t\tresult = this.valueSetReplace(valueSets[i], value, up);\n\t\t}\n\t\treturn result;\n\t}\n\n\tprivate valueSetReplace(valueSet: string[], value: string, up: boolean): string | null {\n\t\tlet idx = valueSet.indexOf(value);\n\t\tif (idx >= 0) {\n\t\t\tidx += up ? +1 : -1;\n\t\t\tif (idx < 0) {\n\t\t\t\tidx = valueSet.length - 1;\n\t\t\t} else {\n\t\t\t\tidx %= valueSet.length;\n\t\t\t}\n\t\t\treturn valueSet[idx];\n\t\t}\n\t\treturn null;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { Event } from 'vs/base/common/event';\nimport { IMarkdownString } from 'vs/base/common/htmlContent';\nimport { IDisposable } from 'vs/base/common/lifecycle';\nimport { equals } from 'vs/base/common/objects';\nimport { ThemeColor } from 'vs/base/common/themables';\nimport { URI } from 'vs/base/common/uri';\nimport { ISingleEditOperation } from 'vs/editor/common/core/editOperation';\nimport { IPosition, Position } from 'vs/editor/common/core/position';\nimport { IRange, Range } from 'vs/editor/common/core/range';\nimport { Selection } from 'vs/editor/common/core/selection';\nimport { TextChange } from 'vs/editor/common/core/textChange';\nimport { WordCharacterClassifier } from 'vs/editor/common/core/wordCharacterClassifier';\nimport { IWordAtPosition } from 'vs/editor/common/core/wordHelper';\nimport { FormattingOptions } from 'vs/editor/common/languages';\nimport { ILanguageSelection } from 'vs/editor/common/languages/language';\nimport { IBracketPairsTextModelPart } from 'vs/editor/common/textModelBracketPairs';\nimport { IModelContentChange, IModelContentChangedEvent, IModelDecorationsChangedEvent, IModelLanguageChangedEvent, IModelLanguageConfigurationChangedEvent, IModelOptionsChangedEvent, IModelTokensChangedEvent, InternalModelContentChangeEvent, ModelInjectedTextChangedEvent } from 'vs/editor/common/textModelEvents';\nimport { IGuidesTextModelPart } from 'vs/editor/common/textModelGuides';\nimport { ITokenizationTextModelPart } from 'vs/editor/common/tokenizationTextModelPart';\nimport { UndoRedoGroup } from 'vs/platform/undoRedo/common/undoRedo';\n\n/**\n * Vertical Lane in the overview ruler of the editor.\n */\nexport enum OverviewRulerLane {\n\tLeft = 1,\n\tCenter = 2,\n\tRight = 4,\n\tFull = 7\n}\n\n/**\n * Vertical Lane in the glyph margin of the editor.\n */\nexport enum GlyphMarginLane {\n\tLeft = 1,\n\tCenter = 2,\n\tRight = 3,\n}\n\nexport interface IGlyphMarginLanesModel {\n\t/**\n\t * The number of lanes that should be rendered in the editor.\n\t */\n\treadonly requiredLanes: number;\n\n\t/**\n\t * Gets the lanes that should be rendered starting at a given line number.\n\t */\n\tgetLanesAtLine(lineNumber: number): GlyphMarginLane[];\n\n\t/**\n\t * Resets the model and ensures it can contain at least `maxLine` lines.\n\t */\n\treset(maxLine: number): void;\n\n\t/**\n\t * Registers that a lane should be visible at the Range in the model.\n\t * @param persist - if true, notes that the lane should always be visible,\n\t * even on lines where there's no specific request for that lane.\n\t */\n\tpush(lane: GlyphMarginLane, range: Range, persist?: boolean): void;\n}\n\n/**\n * Position in the minimap to render the decoration.\n */\nexport const enum MinimapPosition {\n\tInline = 1,\n\tGutter = 2\n}\n\n/**\n * Section header style.\n */\nexport const enum MinimapSectionHeaderStyle {\n\tNormal = 1,\n\tUnderlined = 2\n}\n\nexport interface IDecorationOptions {\n\t/**\n\t * CSS color to render.\n\t * e.g.: rgba(100, 100, 100, 0.5) or a color from the color registry\n\t */\n\tcolor: string | ThemeColor | undefined;\n\t/**\n\t * CSS color to render.\n\t * e.g.: rgba(100, 100, 100, 0.5) or a color from the color registry\n\t */\n\tdarkColor?: string | ThemeColor;\n}\n\nexport interface IModelDecorationGlyphMarginOptions {\n\t/**\n\t * The position in the glyph margin.\n\t */\n\tposition: GlyphMarginLane;\n\n\t/**\n\t * Whether the glyph margin lane in {@link position} should be rendered even\n\t * outside of this decoration's range.\n\t */\n\tpersistLane?: boolean;\n}\n\n/**\n * Options for rendering a model decoration in the overview ruler.\n */\nexport interface IModelDecorationOverviewRulerOptions extends IDecorationOptions {\n\t/**\n\t * The position in the overview ruler.\n\t */\n\tposition: OverviewRulerLane;\n}\n\n/**\n * Options for rendering a model decoration in the minimap.\n */\nexport interface IModelDecorationMinimapOptions extends IDecorationOptions {\n\t/**\n\t * The position in the minimap.\n\t */\n\tposition: MinimapPosition;\n\t/**\n\t * If the decoration is for a section header, which header style.\n\t */\n\tsectionHeaderStyle?: MinimapSectionHeaderStyle | null;\n\t/**\n\t * If the decoration is for a section header, the header text.\n\t */\n\tsectionHeaderText?: string | null;\n}\n\n/**\n * Options for a model decoration.\n */\nexport interface IModelDecorationOptions {\n\t/**\n\t * A debug description that can be used for inspecting model decorations.\n\t * @internal\n\t */\n\tdescription: string;\n\t/**\n\t * Customize the growing behavior of the decoration when typing at the edges of the decoration.\n\t * Defaults to TrackedRangeStickiness.AlwaysGrowsWhenTypingAtEdges\n\t */\n\tstickiness?: TrackedRangeStickiness;\n\t/**\n\t * CSS class name describing the decoration.\n\t */\n\tclassName?: string | null;\n\t/**\n\t * Indicates whether the decoration should span across the entire line when it continues onto the next line.\n\t */\n\tshouldFillLineOnLineBreak?: boolean | null;\n\tblockClassName?: string | null;\n\t/**\n\t * Indicates if this block should be rendered after the last line.\n\t * In this case, the range must be empty and set to the last line.\n\t */\n\tblockIsAfterEnd?: boolean | null;\n\tblockDoesNotCollapse?: boolean | null;\n\tblockPadding?: [top: number, right: number, bottom: number, left: number] | null;\n\n\t/**\n\t * Message to be rendered when hovering over the glyph margin decoration.\n\t */\n\tglyphMarginHoverMessage?: IMarkdownString | IMarkdownString[] | null;\n\t/**\n\t * Array of MarkdownString to render as the decoration message.\n\t */\n\thoverMessage?: IMarkdownString | IMarkdownString[] | null;\n\t/**\n\t * Array of MarkdownString to render as the line number message.\n\t */\n\tlineNumberHoverMessage?: IMarkdownString | IMarkdownString[] | null;\n\t/**\n\t * Should the decoration expand to encompass a whole line.\n\t */\n\tisWholeLine?: boolean;\n\t/**\n\t * Always render the decoration (even when the range it encompasses is collapsed).\n\t */\n\tshowIfCollapsed?: boolean;\n\t/**\n\t * Collapse the decoration if its entire range is being replaced via an edit.\n\t * @internal\n\t */\n\tcollapseOnReplaceEdit?: boolean;\n\t/**\n\t * Specifies the stack order of a decoration.\n\t * A decoration with greater stack order is always in front of a decoration with\n\t * a lower stack order when the decorations are on the same line.\n\t */\n\tzIndex?: number;\n\t/**\n\t * If set, render this decoration in the overview ruler.\n\t */\n\toverviewRuler?: IModelDecorationOverviewRulerOptions | null;\n\t/**\n\t * If set, render this decoration in the minimap.\n\t */\n\tminimap?: IModelDecorationMinimapOptions | null;\n\t/**\n\t * If set, the decoration will be rendered in the glyph margin with this CSS class name.\n\t */\n\tglyphMarginClassName?: string | null;\n\t/**\n\t * If set and the decoration has {@link glyphMarginClassName} set, render this decoration\n\t * with the specified {@link IModelDecorationGlyphMarginOptions} in the glyph margin.\n\t */\n\tglyphMargin?: IModelDecorationGlyphMarginOptions | null;\n\t/**\n\t * If set, the decoration will be rendered in the lines decorations with this CSS class name.\n\t */\n\tlinesDecorationsClassName?: string | null;\n\t/**\n\t * Controls the tooltip text of the line decoration.\n\t */\n\tlinesDecorationsTooltip?: string | null;\n\t/**\n\t * If set, the decoration will be rendered on the line number.\n\t */\n\tlineNumberClassName?: string | null;\n\t/**\n\t * If set, the decoration will be rendered in the lines decorations with this CSS class name, but only for the first line in case of line wrapping.\n\t */\n\tfirstLineDecorationClassName?: string | null;\n\t/**\n\t * If set, the decoration will be rendered in the margin (covering its full width) with this CSS class name.\n\t */\n\tmarginClassName?: string | null;\n\t/**\n\t * If set, the decoration will be rendered inline with the text with this CSS class name.\n\t * Please use this only for CSS rules that must impact the text. For example, use `className`\n\t * to have a background color decoration.\n\t */\n\tinlineClassName?: string | null;\n\t/**\n\t * If there is an `inlineClassName` which affects letter spacing.\n\t */\n\tinlineClassNameAffectsLetterSpacing?: boolean;\n\t/**\n\t * If set, the decoration will be rendered before the text with this CSS class name.\n\t */\n\tbeforeContentClassName?: string | null;\n\t/**\n\t * If set, the decoration will be rendered after the text with this CSS class name.\n\t */\n\tafterContentClassName?: string | null;\n\t/**\n\t * If set, text will be injected in the view after the range.\n\t */\n\tafter?: InjectedTextOptions | null;\n\n\t/**\n\t * If set, text will be injected in the view before the range.\n\t */\n\tbefore?: InjectedTextOptions | null;\n\n\t/**\n\t * If set, this decoration will not be rendered for comment tokens.\n\t * @internal\n\t*/\n\thideInCommentTokens?: boolean | null;\n\n\t/**\n\t * If set, this decoration will not be rendered for string tokens.\n\t * @internal\n\t*/\n\thideInStringTokens?: boolean | null;\n}\n\n/**\n * Configures text that is injected into the view without changing the underlying document.\n*/\nexport interface InjectedTextOptions {\n\t/**\n\t * Sets the text to inject. Must be a single line.\n\t */\n\treadonly content: string;\n\n\t/**\n\t * If set, the decoration will be rendered inline with the text with this CSS class name.\n\t */\n\treadonly inlineClassName?: string | null;\n\n\t/**\n\t * If there is an `inlineClassName` which affects letter spacing.\n\t */\n\treadonly inlineClassNameAffectsLetterSpacing?: boolean;\n\n\t/**\n\t * This field allows to attach data to this injected text.\n\t * The data can be read when injected texts at a given position are queried.\n\t */\n\treadonly attachedData?: unknown;\n\n\t/**\n\t * Configures cursor stops around injected text.\n\t * Defaults to {@link InjectedTextCursorStops.Both}.\n\t*/\n\treadonly cursorStops?: InjectedTextCursorStops | null;\n}\n\nexport enum InjectedTextCursorStops {\n\tBoth,\n\tRight,\n\tLeft,\n\tNone\n}\n\n/**\n * New model decorations.\n */\nexport interface IModelDeltaDecoration {\n\t/**\n\t * Range that this decoration covers.\n\t */\n\trange: IRange;\n\t/**\n\t * Options associated with this decoration.\n\t */\n\toptions: IModelDecorationOptions;\n}\n\n/**\n * A decoration in the model.\n */\nexport interface IModelDecoration {\n\t/**\n\t * Identifier for a decoration.\n\t */\n\treadonly id: string;\n\t/**\n\t * Identifier for a decoration's owner.\n\t */\n\treadonly ownerId: number;\n\t/**\n\t * Range that this decoration covers.\n\t */\n\treadonly range: Range;\n\t/**\n\t * Options associated with this decoration.\n\t */\n\treadonly options: IModelDecorationOptions;\n}\n\n/**\n * An accessor that can add, change or remove model decorations.\n * @internal\n */\nexport interface IModelDecorationsChangeAccessor {\n\t/**\n\t * Add a new decoration.\n\t * @param range Range that this decoration covers.\n\t * @param options Options associated with this decoration.\n\t * @return An unique identifier associated with this decoration.\n\t */\n\taddDecoration(range: IRange, options: IModelDecorationOptions): string;\n\t/**\n\t * Change the range that an existing decoration covers.\n\t * @param id The unique identifier associated with the decoration.\n\t * @param newRange The new range that this decoration covers.\n\t */\n\tchangeDecoration(id: string, newRange: IRange): void;\n\t/**\n\t * Change the options associated with an existing decoration.\n\t * @param id The unique identifier associated with the decoration.\n\t * @param newOptions The new options associated with this decoration.\n\t */\n\tchangeDecorationOptions(id: string, newOptions: IModelDecorationOptions): void;\n\t/**\n\t * Remove an existing decoration.\n\t * @param id The unique identifier associated with the decoration.\n\t */\n\tremoveDecoration(id: string): void;\n\t/**\n\t * Perform a minimum amount of operations, in order to transform the decorations\n\t * identified by `oldDecorations` to the decorations described by `newDecorations`\n\t * and returns the new identifiers associated with the resulting decorations.\n\t *\n\t * @param oldDecorations Array containing previous decorations identifiers.\n\t * @param newDecorations Array describing what decorations should result after the call.\n\t * @return An array containing the new decorations identifiers.\n\t */\n\tdeltaDecorations(oldDecorations: readonly string[], newDecorations: readonly IModelDeltaDecoration[]): string[];\n}\n\n/**\n * End of line character preference.\n */\nexport const enum EndOfLinePreference {\n\t/**\n\t * Use the end of line character identified in the text buffer.\n\t */\n\tTextDefined = 0,\n\t/**\n\t * Use line feed (\\n) as the end of line character.\n\t */\n\tLF = 1,\n\t/**\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\n\t */\n\tCRLF = 2\n}\n\n/**\n * The default end of line to use when instantiating models.\n */\nexport const enum DefaultEndOfLine {\n\t/**\n\t * Use line feed (\\n) as the end of line character.\n\t */\n\tLF = 1,\n\t/**\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\n\t */\n\tCRLF = 2\n}\n\n/**\n * End of line character preference.\n */\nexport const enum EndOfLineSequence {\n\t/**\n\t * Use line feed (\\n) as the end of line character.\n\t */\n\tLF = 0,\n\t/**\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\n\t */\n\tCRLF = 1\n}\n\n/**\n * An identifier for a single edit operation.\n * @internal\n */\nexport interface ISingleEditOperationIdentifier {\n\t/**\n\t * Identifier major\n\t */\n\tmajor: number;\n\t/**\n\t * Identifier minor\n\t */\n\tminor: number;\n}\n\n/**\n * A single edit operation, that has an identifier.\n */\nexport interface IIdentifiedSingleEditOperation extends ISingleEditOperation {\n\t/**\n\t * An identifier associated with this single edit operation.\n\t * @internal\n\t */\n\tidentifier?: ISingleEditOperationIdentifier | null;\n\t/**\n\t * This indicates that this operation is inserting automatic whitespace\n\t * that can be removed on next model edit operation if `config.trimAutoWhitespace` is true.\n\t * @internal\n\t */\n\tisAutoWhitespaceEdit?: boolean;\n\t/**\n\t * This indicates that this operation is in a set of operations that are tracked and should not be \"simplified\".\n\t * @internal\n\t */\n\t_isTracked?: boolean;\n}\n\nexport interface IValidEditOperation {\n\t/**\n\t * An identifier associated with this single edit operation.\n\t * @internal\n\t */\n\tidentifier: ISingleEditOperationIdentifier | null;\n\t/**\n\t * The range to replace. This can be empty to emulate a simple insert.\n\t */\n\trange: Range;\n\t/**\n\t * The text to replace with. This can be empty to emulate a simple delete.\n\t */\n\ttext: string;\n\t/**\n\t * @internal\n\t */\n\ttextChange: TextChange;\n}\n\n/**\n * A callback that can compute the cursor state after applying a series of edit operations.\n */\nexport interface ICursorStateComputer {\n\t/**\n\t * A callback that can compute the resulting cursors state after some edit operations have been executed.\n\t */\n\t(inverseEditOperations: IValidEditOperation[]): Selection[] | null;\n}\n\nexport class TextModelResolvedOptions {\n\t_textModelResolvedOptionsBrand: void = undefined;\n\n\treadonly tabSize: number;\n\treadonly indentSize: number;\n\tprivate readonly _indentSizeIsTabSize: boolean;\n\treadonly insertSpaces: boolean;\n\treadonly defaultEOL: DefaultEndOfLine;\n\treadonly trimAutoWhitespace: boolean;\n\treadonly bracketPairColorizationOptions: BracketPairColorizationOptions;\n\n\tpublic get originalIndentSize(): number | 'tabSize' {\n\t\treturn this._indentSizeIsTabSize ? 'tabSize' : this.indentSize;\n\t}\n\n\t/**\n\t * @internal\n\t */\n\tconstructor(src: {\n\t\ttabSize: number;\n\t\tindentSize: number | 'tabSize';\n\t\tinsertSpaces: boolean;\n\t\tdefaultEOL: DefaultEndOfLine;\n\t\ttrimAutoWhitespace: boolean;\n\t\tbracketPairColorizationOptions: BracketPairColorizationOptions;\n\t}) {\n\t\tthis.tabSize = Math.max(1, src.tabSize | 0);\n\t\tif (src.indentSize === 'tabSize') {\n\t\t\tthis.indentSize = this.tabSize;\n\t\t\tthis._indentSizeIsTabSize = true;\n\t\t} else {\n\t\t\tthis.indentSize = Math.max(1, src.indentSize | 0);\n\t\t\tthis._indentSizeIsTabSize = false;\n\t\t}\n\t\tthis.insertSpaces = Boolean(src.insertSpaces);\n\t\tthis.defaultEOL = src.defaultEOL | 0;\n\t\tthis.trimAutoWhitespace = Boolean(src.trimAutoWhitespace);\n\t\tthis.bracketPairColorizationOptions = src.bracketPairColorizationOptions;\n\t}\n\n\t/**\n\t * @internal\n\t */\n\tpublic equals(other: TextModelResolvedOptions): boolean {\n\t\treturn (\n\t\t\tthis.tabSize === other.tabSize\n\t\t\t&& this._indentSizeIsTabSize === other._indentSizeIsTabSize\n\t\t\t&& this.indentSize === other.indentSize\n\t\t\t&& this.insertSpaces === other.insertSpaces\n\t\t\t&& this.defaultEOL === other.defaultEOL\n\t\t\t&& this.trimAutoWhitespace === other.trimAutoWhitespace\n\t\t\t&& equals(this.bracketPairColorizationOptions, other.bracketPairColorizationOptions)\n\t\t);\n\t}\n\n\t/**\n\t * @internal\n\t */\n\tpublic createChangeEvent(newOpts: TextModelResolvedOptions): IModelOptionsChangedEvent {\n\t\treturn {\n\t\t\ttabSize: this.tabSize !== newOpts.tabSize,\n\t\t\tindentSize: this.indentSize !== newOpts.indentSize,\n\t\t\tinsertSpaces: this.insertSpaces !== newOpts.insertSpaces,\n\t\t\ttrimAutoWhitespace: this.trimAutoWhitespace !== newOpts.trimAutoWhitespace,\n\t\t};\n\t}\n}\n\n/**\n * @internal\n */\nexport interface ITextModelCreationOptions {\n\ttabSize: number;\n\tindentSize: number | 'tabSize';\n\tinsertSpaces: boolean;\n\tdetectIndentation: boolean;\n\ttrimAutoWhitespace: boolean;\n\tdefaultEOL: DefaultEndOfLine;\n\tisForSimpleWidget: boolean;\n\tlargeFileOptimizations: boolean;\n\tbracketPairColorizationOptions: BracketPairColorizationOptions;\n}\n\nexport interface BracketPairColorizationOptions {\n\tenabled: boolean;\n\tindependentColorPoolPerBracketType: boolean;\n}\n\nexport interface ITextModelUpdateOptions {\n\ttabSize?: number;\n\tindentSize?: number | 'tabSize';\n\tinsertSpaces?: boolean;\n\ttrimAutoWhitespace?: boolean;\n\tbracketColorizationOptions?: BracketPairColorizationOptions;\n}\n\nexport class FindMatch {\n\t_findMatchBrand: void = undefined;\n\n\tpublic readonly range: Range;\n\tpublic readonly matches: string[] | null;\n\n\t/**\n\t * @internal\n\t */\n\tconstructor(range: Range, matches: string[] | null) {\n\t\tthis.range = range;\n\t\tthis.matches = matches;\n\t}\n}\n\n/**\n * Describes the behavior of decorations when typing/editing near their edges.\n * Note: Please do not edit the values, as they very carefully match `DecorationRangeBehavior`\n */\nexport const enum TrackedRangeStickiness {\n\tAlwaysGrowsWhenTypingAtEdges = 0,\n\tNeverGrowsWhenTypingAtEdges = 1,\n\tGrowsOnlyWhenTypingBefore = 2,\n\tGrowsOnlyWhenTypingAfter = 3,\n}\n\n/**\n * Text snapshot that works like an iterator.\n * Will try to return chunks of roughly ~64KB size.\n * Will return null when finished.\n */\nexport interface ITextSnapshot {\n\tread(): string | null;\n}\n\n/**\n * @internal\n */\nexport function isITextSnapshot(obj: any): obj is ITextSnapshot {\n\treturn (obj && typeof obj.read === 'function');\n}\n\n/**\n * A model.\n */\nexport interface ITextModel {\n\n\t/**\n\t * Gets the resource associated with this editor model.\n\t */\n\treadonly uri: URI;\n\n\t/**\n\t * A unique identifier associated with this model.\n\t */\n\treadonly id: string;\n\n\t/**\n\t * This model is constructed for a simple widget code editor.\n\t * @internal\n\t */\n\treadonly isForSimpleWidget: boolean;\n\n\t/**\n\t * If true, the text model might contain RTL.\n\t * If false, the text model **contains only** contain LTR.\n\t * @internal\n\t */\n\tmightContainRTL(): boolean;\n\n\t/**\n\t * If true, the text model might contain LINE SEPARATOR (LS), PARAGRAPH SEPARATOR (PS).\n\t * If false, the text model definitely does not contain these.\n\t * @internal\n\t */\n\tmightContainUnusualLineTerminators(): boolean;\n\n\t/**\n\t * @internal\n\t */\n\tremoveUnusualLineTerminators(selections?: Selection[]): void;\n\n\t/**\n\t * If true, the text model might contain non basic ASCII.\n\t * If false, the text model **contains only** basic ASCII.\n\t * @internal\n\t */\n\tmightContainNonBasicASCII(): boolean;\n\n\t/**\n\t * Get the resolved options for this model.\n\t */\n\tgetOptions(): TextModelResolvedOptions;\n\n\t/**\n\t * Get the formatting options for this model.\n\t * @internal\n\t */\n\tgetFormattingOptions(): FormattingOptions;\n\n\t/**\n\t * Get the current version id of the model.\n\t * Anytime a change happens to the model (even undo/redo),\n\t * the version id is incremented.\n\t */\n\tgetVersionId(): number;\n\n\t/**\n\t * Get the alternative version id of the model.\n\t * This alternative version id is not always incremented,\n\t * it will return the same values in the case of undo-redo.\n\t */\n\tgetAlternativeVersionId(): number;\n\n\t/**\n\t * Replace the entire text buffer value contained in this model.\n\t */\n\tsetValue(newValue: string | ITextSnapshot): void;\n\n\t/**\n\t * Get the text stored in this model.\n\t * @param eol The end of line character preference. Defaults to `EndOfLinePreference.TextDefined`.\n\t * @param preserverBOM Preserve a BOM character if it was detected when the model was constructed.\n\t * @return The text.\n\t */\n\tgetValue(eol?: EndOfLinePreference, preserveBOM?: boolean): string;\n\n\t/**\n\t * Get the text stored in this model.\n\t * @param preserverBOM Preserve a BOM character if it was detected when the model was constructed.\n\t * @return The text snapshot (it is safe to consume it asynchronously).\n\t */\n\tcreateSnapshot(preserveBOM?: boolean): ITextSnapshot;\n\n\t/**\n\t * Get the length of the text stored in this model.\n\t */\n\tgetValueLength(eol?: EndOfLinePreference, preserveBOM?: boolean): number;\n\n\t/**\n\t * Get the text in a certain range.\n\t * @param range The range describing what text to get.\n\t * @param eol The end of line character preference. This will only be used for multiline ranges. Defaults to `EndOfLinePreference.TextDefined`.\n\t * @return The text.\n\t */\n\tgetValueInRange(range: IRange, eol?: EndOfLinePreference): string;\n\n\t/**\n\t * Get the length of text in a certain range.\n\t * @param range The range describing what text length to get.\n\t * @return The text length.\n\t */\n\tgetValueLengthInRange(range: IRange, eol?: EndOfLinePreference): number;\n\n\t/**\n\t * Get the character count of text in a certain range.\n\t * @param range The range describing what text length to get.\n\t */\n\tgetCharacterCountInRange(range: IRange, eol?: EndOfLinePreference): number;\n\n\t/**\n\t * Splits characters in two buckets. First bucket (A) is of characters that\n\t * sit in lines with length < `LONG_LINE_BOUNDARY`. Second bucket (B) is of\n\t * characters that sit in lines with length >= `LONG_LINE_BOUNDARY`.\n\t * If count(B) > count(A) return true. Returns false otherwise.\n\t * @internal\n\t */\n\tisDominatedByLongLines(): boolean;\n\n\t/**\n\t * Get the number of lines in the model.\n\t */\n\tgetLineCount(): number;\n\n\t/**\n\t * Get the text for a certain line.\n\t */\n\tgetLineContent(lineNumber: number): string;\n\n\t/**\n\t * Get the text length for a certain line.\n\t */\n\tgetLineLength(lineNumber: number): number;\n\n\t/**\n\t * Get the text for all lines.\n\t */\n\tgetLinesContent(): string[];\n\n\t/**\n\t * Get the end of line sequence predominantly used in the text buffer.\n\t * @return EOL char sequence (e.g.: '\\n' or '\\r\\n').\n\t */\n\tgetEOL(): string;\n\n\t/**\n\t * Get the end of line sequence predominantly used in the text buffer.\n\t */\n\tgetEndOfLineSequence(): EndOfLineSequence;\n\n\t/**\n\t * Get the minimum legal column for line at `lineNumber`\n\t */\n\tgetLineMinColumn(lineNumber: number): number;\n\n\t/**\n\t * Get the maximum legal column for line at `lineNumber`\n\t */\n\tgetLineMaxColumn(lineNumber: number): number;\n\n\t/**\n\t * Returns the column before the first non whitespace character for line at `lineNumber`.\n\t * Returns 0 if line is empty or contains only whitespace.\n\t */\n\tgetLineFirstNonWhitespaceColumn(lineNumber: number): number;\n\n\t/**\n\t * Returns the column after the last non whitespace character for line at `lineNumber`.\n\t * Returns 0 if line is empty or contains only whitespace.\n\t */\n\tgetLineLastNonWhitespaceColumn(lineNumber: number): number;\n\n\t/**\n\t * Create a valid position.\n\t */\n\tvalidatePosition(position: IPosition): Position;\n\n\t/**\n\t * Advances the given position by the given offset (negative offsets are also accepted)\n\t * and returns it as a new valid position.\n\t *\n\t * If the offset and position are such that their combination goes beyond the beginning or\n\t * end of the model, throws an exception.\n\t *\n\t * If the offset is such that the new position would be in the middle of a multi-byte\n\t * line terminator, throws an exception.\n\t */\n\tmodifyPosition(position: IPosition, offset: number): Position;\n\n\t/**\n\t * Create a valid range.\n\t */\n\tvalidateRange(range: IRange): Range;\n\n\t/**\n\t * Converts the position to a zero-based offset.\n\t *\n\t * The position will be [adjusted](#TextDocument.validatePosition).\n\t *\n\t * @param position A position.\n\t * @return A valid zero-based offset.\n\t */\n\tgetOffsetAt(position: IPosition): number;\n\n\t/**\n\t * Converts a zero-based offset to a position.\n\t *\n\t * @param offset A zero-based offset.\n\t * @return A valid [position](#Position).\n\t */\n\tgetPositionAt(offset: number): Position;\n\n\t/**\n\t * Get a range covering the entire model.\n\t */\n\tgetFullModelRange(): Range;\n\n\t/**\n\t * Returns if the model was disposed or not.\n\t */\n\tisDisposed(): boolean;\n\n\t/**\n\t * This model is so large that it would not be a good idea to sync it over\n\t * to web workers or other places.\n\t * @internal\n\t */\n\tisTooLargeForSyncing(): boolean;\n\n\t/**\n\t * The file is so large, that even tokenization is disabled.\n\t * @internal\n\t */\n\tisTooLargeForTokenization(): boolean;\n\n\t/**\n\t * The file is so large, that operations on it might be too large for heap\n\t * and can lead to OOM crashes so they should be disabled.\n\t * @internal\n\t */\n\tisTooLargeForHeapOperation(): boolean;\n\n\t/**\n\t * Search the model.\n\t * @param searchString The string used to search. If it is a regular expression, set `isRegex` to true.\n\t * @param searchOnlyEditableRange Limit the searching to only search inside the editable range of the model.\n\t * @param isRegex Used to indicate that `searchString` is a regular expression.\n\t * @param matchCase Force the matching to match lower/upper case exactly.\n\t * @param wordSeparators Force the matching to match entire words only. Pass null otherwise.\n\t * @param captureMatches The result will contain the captured groups.\n\t * @param limitResultCount Limit the number of results\n\t * @return The ranges where the matches are. It is empty if not matches have been found.\n\t */\n\tfindMatches(searchString: string, searchOnlyEditableRange: boolean, isRegex: boolean, matchCase: boolean, wordSeparators: string | null, captureMatches: boolean, limitResultCount?: number): FindMatch[];\n\t/**\n\t * Search the model.\n\t * @param searchString The string used to search. If it is a regular expression, set `isRegex` to true.\n\t * @param searchScope Limit the searching to only search inside these ranges.\n\t * @param isRegex Used to indicate that `searchString` is a regular expression.\n\t * @param matchCase Force the matching to match lower/upper case exactly.\n\t * @param wordSeparators Force the matching to match entire words only. Pass null otherwise.\n\t * @param captureMatches The result will contain the captured groups.\n\t * @param limitResultCount Limit the number of results\n\t * @return The ranges where the matches are. It is empty if no matches have been found.\n\t */\n\tfindMatches(searchString: string, searchScope: IRange | IRange[], isRegex: boolean, matchCase: boolean, wordSeparators: string | null, captureMatches: boolean, limitResultCount?: number): FindMatch[];\n\t/**\n\t * Search the model for the next match. Loops to the beginning of the model if needed.\n\t * @param searchString The string used to search. If it is a regular expression, set `isRegex` to true.\n\t * @param searchStart Start the searching at the specified position.\n\t * @param isRegex Used to indicate that `searchString` is a regular expression.\n\t * @param matchCase Force the matching to match lower/upper case exactly.\n\t * @param wordSeparators Force the matching to match entire words only. Pass null otherwise.\n\t * @param captureMatches The result will contain the captured groups.\n\t * @return The range where the next match is. It is null if no next match has been found.\n\t */\n\tfindNextMatch(searchString: string, searchStart: IPosition, isRegex: boolean, matchCase: boolean, wordSeparators: string | null, captureMatches: boolean): FindMatch | null;\n\t/**\n\t * Search the model for the previous match. Loops to the end of the model if needed.\n\t * @param searchString The string used to search. If it is a regular expression, set `isRegex` to true.\n\t * @param searchStart Start the searching at the specified position.\n\t * @param isRegex Used to indicate that `searchString` is a regular expression.\n\t * @param matchCase Force the matching to match lower/upper case exactly.\n\t * @param wordSeparators Force the matching to match entire words only. Pass null otherwise.\n\t * @param captureMatches The result will contain the captured groups.\n\t * @return The range where the previous match is. It is null if no previous match has been found.\n\t */\n\tfindPreviousMatch(searchString: string, searchStart: IPosition, isRegex: boolean, matchCase: boolean, wordSeparators: string | null, captureMatches: boolean): FindMatch | null;\n\n\n\t/**\n\t * Get the language associated with this model.\n\t */\n\tgetLanguageId(): string;\n\n\t/**\n\t * Set the current language mode associated with the model.\n\t * @param languageId The new language.\n\t * @param source The source of the call that set the language.\n\t * @internal\n\t */\n\tsetLanguage(languageId: string, source?: string): void;\n\n\t/**\n\t * Set the current language mode associated with the model.\n\t * @param languageSelection The new language selection.\n\t * @param source The source of the call that set the language.\n\t * @internal\n\t */\n\tsetLanguage(languageSelection: ILanguageSelection, source?: string): void;\n\n\t/**\n\t * Returns the real (inner-most) language mode at a given position.\n\t * The result might be inaccurate. Use `forceTokenization` to ensure accurate tokens.\n\t * @internal\n\t */\n\tgetLanguageIdAtPosition(lineNumber: number, column: number): string;\n\n\t/**\n\t * Get the word under or besides `position`.\n\t * @param position The position to look for a word.\n\t * @return The word under or besides `position`. Might be null.\n\t */\n\tgetWordAtPosition(position: IPosition): IWordAtPosition | null;\n\n\t/**\n\t * Get the word under or besides `position` trimmed to `position`.column\n\t * @param position The position to look for a word.\n\t * @return The word under or besides `position`. Will never be null.\n\t */\n\tgetWordUntilPosition(position: IPosition): IWordAtPosition;\n\n\t/**\n\t * Change the decorations. The callback will be called with a change accessor\n\t * that becomes invalid as soon as the callback finishes executing.\n\t * This allows for all events to be queued up until the change\n\t * is completed. Returns whatever the callback returns.\n\t * @param ownerId Identifies the editor id in which these decorations should appear. If no `ownerId` is provided, the decorations will appear in all editors that attach this model.\n\t * @internal\n\t */\n\tchangeDecorations<T>(callback: (changeAccessor: IModelDecorationsChangeAccessor) => T, ownerId?: number): T | null;\n\n\t/**\n\t * Perform a minimum amount of operations, in order to transform the decorations\n\t * identified by `oldDecorations` to the decorations described by `newDecorations`\n\t * and returns the new identifiers associated with the resulting decorations.\n\t *\n\t * @param oldDecorations Array containing previous decorations identifiers.\n\t * @param newDecorations Array describing what decorations should result after the call.\n\t * @param ownerId Identifies the editor id in which these decorations should appear. If no `ownerId` is provided, the decorations will appear in all editors that attach this model.\n\t * @return An array containing the new decorations identifiers.\n\t */\n\tdeltaDecorations(oldDecorations: string[], newDecorations: IModelDeltaDecoration[], ownerId?: number): string[];\n\n\t/**\n\t * Remove all decorations that have been added with this specific ownerId.\n\t * @param ownerId The owner id to search for.\n\t * @internal\n\t */\n\tremoveAllDecorationsWithOwnerId(ownerId: number): void;\n\n\t/**\n\t * Get the options associated with a decoration.\n\t * @param id The decoration id.\n\t * @return The decoration options or null if the decoration was not found.\n\t */\n\tgetDecorationOptions(id: string): IModelDecorationOptions | null;\n\n\t/**\n\t * Get the range associated with a decoration.\n\t * @param id The decoration id.\n\t * @return The decoration range or null if the decoration was not found.\n\t */\n\tgetDecorationRange(id: string): Range | null;\n\n\t/**\n\t * Gets all the decorations for the line `lineNumber` as an array.\n\t * @param lineNumber The line number\n\t * @param ownerId If set, it will ignore decorations belonging to other owners.\n\t * @param filterOutValidation If set, it will ignore decorations specific to validation (i.e. warnings, errors).\n\t * @return An array with the decorations\n\t */\n\tgetLineDecorations(lineNumber: number, ownerId?: number, filterOutValidation?: boolean): IModelDecoration[];\n\n\t/**\n\t * Gets all the decorations for the lines between `startLineNumber` and `endLineNumber` as an array.\n\t * @param startLineNumber The start line number\n\t * @param endLineNumber The end line number\n\t * @param ownerId If set, it will ignore decorations belonging to other owners.\n\t * @param filterOutValidation If set, it will ignore decorations specific to validation (i.e. warnings, errors).\n\t * @return An array with the decorations\n\t */\n\tgetLinesDecorations(startLineNumber: number, endLineNumber: number, ownerId?: number, filterOutValidation?: boolean): IModelDecoration[];\n\n\t/**\n\t * Gets all the decorations in a range as an array. Only `startLineNumber` and `endLineNumber` from `range` are used for filtering.\n\t * So for now it returns all the decorations on the same line as `range`.\n\t * @param range The range to search in\n\t * @param ownerId If set, it will ignore decorations belonging to other owners.\n\t * @param filterOutValidation If set, it will ignore decorations specific to validation (i.e. warnings, errors).\n\t * @param onlyMinimapDecorations If set, it will return only decorations that render in the minimap.\n\t * @param onlyMarginDecorations If set, it will return only decorations that render in the glyph margin.\n\t * @return An array with the decorations\n\t */\n\tgetDecorationsInRange(range: IRange, ownerId?: number, filterOutValidation?: boolean, onlyMinimapDecorations?: boolean, onlyMarginDecorations?: boolean): IModelDecoration[];\n\n\t/**\n\t * Gets all the decorations as an array.\n\t * @param ownerId If set, it will ignore decorations belonging to other owners.\n\t * @param filterOutValidation If set, it will ignore decorations specific to validation (i.e. warnings, errors).\n\t */\n\tgetAllDecorations(ownerId?: number, filterOutValidation?: boolean): IModelDecoration[];\n\n\t/**\n\t * Gets all decorations that render in the glyph margin as an array.\n\t * @param ownerId If set, it will ignore decorations belonging to other owners.\n\t */\n\tgetAllMarginDecorations(ownerId?: number): IModelDecoration[];\n\n\t/**\n\t * Gets all the decorations that should be rendered in the overview ruler as an array.\n\t * @param ownerId If set, it will ignore decorations belonging to other owners.\n\t * @param filterOutValidation If set, it will ignore decorations specific to validation (i.e. warnings, errors).\n\t */\n\tgetOverviewRulerDecorations(ownerId?: number, filterOutValidation?: boolean): IModelDecoration[];\n\n\t/**\n\t * Gets all the decorations that contain injected text.\n\t * @param ownerId If set, it will ignore decorations belonging to other owners.\n\t */\n\tgetInjectedTextDecorations(ownerId?: number): IModelDecoration[];\n\n\t/**\n\t * @internal\n\t */\n\t_getTrackedRange(id: string): Range | null;\n\n\t/**\n\t * @internal\n\t */\n\t_setTrackedRange(id: string | null, newRange: null, newStickiness: TrackedRangeStickiness): null;\n\t/**\n\t * @internal\n\t */\n\t_setTrackedRange(id: string | null, newRange: Range, newStickiness: TrackedRangeStickiness): string;\n\n\t/**\n\t * Normalize a string containing whitespace according to indentation rules (converts to spaces or to tabs).\n\t */\n\tnormalizeIndentation(str: string): string;\n\n\t/**\n\t * Change the options of this model.\n\t */\n\tupdateOptions(newOpts: ITextModelUpdateOptions): void;\n\n\t/**\n\t * Detect the indentation options for this model from its content.\n\t */\n\tdetectIndentation(defaultInsertSpaces: boolean, defaultTabSize: number): void;\n\n\t/**\n\t * Close the current undo-redo element.\n\t * This offers a way to create an undo/redo stop point.\n\t */\n\tpushStackElement(): void;\n\n\t/**\n\t * Open the current undo-redo element.\n\t * This offers a way to remove the current undo/redo stop point.\n\t */\n\tpopStackElement(): void;\n\n\t/**\n\t * Push edit operations, basically editing the model. This is the preferred way\n\t * of editing the model. The edit operations will land on the undo stack.\n\t * @param beforeCursorState The cursor state before the edit operations. This cursor state will be returned when `undo` or `redo` are invoked.\n\t * @param editOperations The edit operations.\n\t * @param cursorStateComputer A callback that can compute the resulting cursors state after the edit operations have been executed.\n\t * @return The cursor state returned by the `cursorStateComputer`.\n\t */\n\tpushEditOperations(beforeCursorState: Selection[] | null, editOperations: IIdentifiedSingleEditOperation[], cursorStateComputer: ICursorStateComputer): Selection[] | null;\n\t/**\n\t * @internal\n\t */\n\tpushEditOperations(beforeCursorState: Selection[] | null, editOperations: IIdentifiedSingleEditOperation[], cursorStateComputer: ICursorStateComputer, group?: UndoRedoGroup): Selection[] | null;\n\n\t/**\n\t * Change the end of line sequence. This is the preferred way of\n\t * changing the eol sequence. This will land on the undo stack.\n\t */\n\tpushEOL(eol: EndOfLineSequence): void;\n\n\t/**\n\t * Edit the model without adding the edits to the undo stack.\n\t * This can have dire consequences on the undo stack! See @pushEditOperations for the preferred way.\n\t * @param operations The edit operations.\n\t * @return If desired, the inverse edit operations, that, when applied, will bring the model back to the previous state.\n\t */\n\tapplyEdits(operations: IIdentifiedSingleEditOperation[]): void;\n\tapplyEdits(operations: IIdentifiedSingleEditOperation[], computeUndoEdits: false): void;\n\tapplyEdits(operations: IIdentifiedSingleEditOperation[], computeUndoEdits: true): IValidEditOperation[];\n\n\t/**\n\t * Change the end of line sequence without recording in the undo stack.\n\t * This can have dire consequences on the undo stack! See @pushEOL for the preferred way.\n\t */\n\tsetEOL(eol: EndOfLineSequence): void;\n\n\t/**\n\t * @internal\n\t */\n\t_applyUndo(changes: TextChange[], eol: EndOfLineSequence, resultingAlternativeVersionId: number, resultingSelection: Selection[] | null): void;\n\n\t/**\n\t * @internal\n\t */\n\t_applyRedo(changes: TextChange[], eol: EndOfLineSequence, resultingAlternativeVersionId: number, resultingSelection: Selection[] | null): void;\n\n\t/**\n\t * Undo edit operations until the previous undo/redo point.\n\t * The inverse edit operations will be pushed on the redo stack.\n\t * @internal\n\t */\n\tundo(): void | Promise<void>;\n\n\t/**\n\t * Is there anything in the undo stack?\n\t * @internal\n\t */\n\tcanUndo(): boolean;\n\n\t/**\n\t * Redo edit operations until the next undo/redo point.\n\t * The inverse edit operations will be pushed on the undo stack.\n\t * @internal\n\t */\n\tredo(): void | Promise<void>;\n\n\t/**\n\t * Is there anything in the redo stack?\n\t * @internal\n\t */\n\tcanRedo(): boolean;\n\n\t/**\n\t * @deprecated Please use `onDidChangeContent` instead.\n\t * An event emitted when the contents of the model have changed.\n\t * @internal\n\t * @event\n\t */\n\treadonly onDidChangeContentOrInjectedText: Event<InternalModelContentChangeEvent | ModelInjectedTextChangedEvent>;\n\t/**\n\t * An event emitted when the contents of the model have changed.\n\t * @event\n\t */\n\tonDidChangeContent(listener: (e: IModelContentChangedEvent) => void): IDisposable;\n\t/**\n\t * An event emitted when decorations of the model have changed.\n\t * @event\n\t */\n\treadonly onDidChangeDecorations: Event<IModelDecorationsChangedEvent>;\n\t/**\n\t * An event emitted when the model options have changed.\n\t * @event\n\t */\n\treadonly onDidChangeOptions: Event<IModelOptionsChangedEvent>;\n\t/**\n\t * An event emitted when the language associated with the model has changed.\n\t * @event\n\t */\n\treadonly onDidChangeLanguage: Event<IModelLanguageChangedEvent>;\n\t/**\n\t * An event emitted when the language configuration associated with the model has changed.\n\t * @event\n\t */\n\treadonly onDidChangeLanguageConfiguration: Event<IModelLanguageConfigurationChangedEvent>;\n\t/**\n\t * An event emitted when the tokens associated with the model have changed.\n\t * @event\n\t * @internal\n\t */\n\treadonly onDidChangeTokens: Event<IModelTokensChangedEvent>;\n\t/**\n\t * An event emitted when the model has been attached to the first editor or detached from the last editor.\n\t * @event\n\t */\n\treadonly onDidChangeAttached: Event<void>;\n\t/**\n\t * An event emitted right before disposing the model.\n\t * @event\n\t */\n\treadonly onWillDispose: Event<void>;\n\n\t/**\n\t * Destroy this model.\n\t */\n\tdispose(): void;\n\n\t/**\n\t * @internal\n\t */\n\tonBeforeAttached(): IAttachedView;\n\n\t/**\n\t * @internal\n\t */\n\tonBeforeDetached(view: IAttachedView): void;\n\n\t/**\n\t * Returns if this model is attached to an editor or not.\n\t */\n\tisAttachedToEditor(): boolean;\n\n\t/**\n\t * Returns the count of editors this model is attached to.\n\t * @internal\n\t */\n\tgetAttachedEditorCount(): number;\n\n\t/**\n\t * Among all positions that are projected to the same position in the underlying text model as\n\t * the given position, select a unique position as indicated by the affinity.\n\t *\n\t * PositionAffinity.Left:\n\t * The normalized position must be equal or left to the requested position.\n\t *\n\t * PositionAffinity.Right:\n\t * The normalized position must be equal or right to the requested position.\n\t *\n\t * @internal\n\t */\n\tnormalizePosition(position: Position, affinity: PositionAffinity): Position;\n\n\t/**\n\t * Gets the column at which indentation stops at a given line.\n\t * @internal\n\t*/\n\tgetLineIndentColumn(lineNumber: number): number;\n\n\t/**\n\t * Returns an object that can be used to query brackets.\n\t * @internal\n\t*/\n\treadonly bracketPairs: IBracketPairsTextModelPart;\n\n\t/**\n\t * Returns an object that can be used to query indent guides.\n\t * @internal\n\t*/\n\treadonly guides: IGuidesTextModelPart;\n\n\t/**\n\t * @internal\n\t */\n\treadonly tokenization: ITokenizationTextModelPart;\n}\n\n/**\n * @internal\n */\nexport interface IAttachedView {\n\t/**\n\t * @param stabilized Indicates if the visible lines are probably going to change soon or can be considered stable.\n\t * Is true on reveal range and false on scroll.\n\t * Tokenizers should tokenize synchronously if stabilized is true.\n\t */\n\tsetVisibleLines(visibleLines: { startLineNumber: number; endLineNumber: number }[], stabilized: boolean): void;\n}\n\nexport const enum PositionAffinity {\n\t/**\n\t * Prefers the left most position.\n\t*/\n\tLeft = 0,\n\n\t/**\n\t * Prefers the right most position.\n\t*/\n\tRight = 1,\n\n\t/**\n\t * No preference.\n\t*/\n\tNone = 2,\n\n\t/**\n\t * If the given position is on injected text, prefers the position left of it.\n\t*/\n\tLeftOfInjectedText = 3,\n\n\t/**\n\t * If the given position is on injected text, prefers the position right of it.\n\t*/\n\tRightOfInjectedText = 4,\n}\n\n/**\n * @internal\n */\nexport interface ITextBufferBuilder {\n}\n\n/**\n * @internal\n */\nexport interface ITextBufferFactory {\n\tcreate(defaultEOL: DefaultEndOfLine): { textBuffer: ITextBuffer; disposable: IDisposable };\n}\n\n/**\n * @internal\n */\nexport class ValidAnnotatedEditOperation implements IIdentifiedSingleEditOperation {\n\tconstructor(\n\t\tpublic readonly identifier: ISingleEditOperationIdentifier | null,\n\t\tpublic readonly range: Range,\n\t\tpublic readonly text: string | null,\n\t\tpublic readonly forceMoveMarkers: boolean,\n\t\tpublic readonly isAutoWhitespaceEdit: boolean,\n\t\tpublic readonly _isTracked: boolean,\n\t) { }\n}\n\n/**\n * @internal\n *\n * `lineNumber` is 1 based.\n */\nexport interface IReadonlyTextBuffer {\n\tmightContainRTL(): boolean;\n\tmightContainUnusualLineTerminators(): boolean;\n\tresetMightContainUnusualLineTerminators(): void;\n\tmightContainNonBasicASCII(): boolean;\n\tgetBOM(): string;\n\tgetEOL(): string;\n\n\tgetOffsetAt(lineNumber: number, column: number): number;\n\tgetPositionAt(offset: number): Position;\n\tgetRangeAt(offset: number, length: number): Range;\n\n\tgetValueInRange(range: Range, eol: EndOfLinePreference): string;\n\tcreateSnapshot(preserveBOM: boolean): ITextSnapshot;\n\tgetValueLengthInRange(range: Range, eol: EndOfLinePreference): number;\n\tgetCharacterCountInRange(range: Range, eol: EndOfLinePreference): number;\n\tgetLength(): number;\n\tgetLineCount(): number;\n\tgetLinesContent(): string[];\n\tgetLineContent(lineNumber: number): string;\n\tgetLineCharCode(lineNumber: number, index: number): number;\n\tgetLineLength(lineNumber: number): number;\n\tgetLineFirstNonWhitespaceColumn(lineNumber: number): number;\n\tgetLineLastNonWhitespaceColumn(lineNumber: number): number;\n\tfindMatchesLineByLine(searchRange: Range, searchData: SearchData, captureMatches: boolean, limitResultCount: number): FindMatch[];\n}\n\n/**\n * @internal\n */\nexport class SearchData {\n\n\t/**\n\t * The regex to search for. Always defined.\n\t */\n\tpublic readonly regex: RegExp;\n\t/**\n\t * The word separator classifier.\n\t */\n\tpublic readonly wordSeparators: WordCharacterClassifier | null;\n\t/**\n\t * The simple string to search for (if possible).\n\t */\n\tpublic readonly simpleSearch: string | null;\n\n\tconstructor(regex: RegExp, wordSeparators: WordCharacterClassifier | null, simpleSearch: string | null) {\n\t\tthis.regex = regex;\n\t\tthis.wordSeparators = wordSeparators;\n\t\tthis.simpleSearch = simpleSearch;\n\t}\n}\n\n/**\n * @internal\n */\nexport interface ITextBuffer extends IReadonlyTextBuffer, IDisposable {\n\tsetEOL(newEOL: '\\r\\n' | '\\n'): void;\n\tapplyEdits(rawOperations: ValidAnnotatedEditOperation[], recordTrimAutoWhitespace: boolean, computeUndoEdits: boolean): ApplyEditsResult;\n}\n\n/**\n * @internal\n */\nexport class ApplyEditsResult {\n\n\tconstructor(\n\t\tpublic readonly reverseEdits: IValidEditOperation[] | null,\n\t\tpublic readonly changes: IInternalModelContentChange[],\n\t\tpublic readonly trimAutoWhitespaceLineNumbers: number[] | null\n\t) { }\n\n}\n\n/**\n * @internal\n */\nexport interface IInternalModelContentChange extends IModelContentChange {\n\trange: Range;\n\tforceMoveMarkers: boolean;\n}\n\n/**\n * @internal\n */\nexport function shouldSynchronizeModel(model: ITextModel): boolean {\n\treturn (\n\t\t!model.isTooLargeForSyncing() && !model.isForSimpleWidget\n\t);\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { arrayInsert } from 'vs/base/common/arrays';\nimport { toUint32 } from 'vs/base/common/uint';\n\nexport class PrefixSumComputer {\n\n\t/**\n\t * values[i] is the value at index i\n\t */\n\tprivate values: Uint32Array;\n\n\t/**\n\t * prefixSum[i] = SUM(heights[j]), 0 <= j <= i\n\t */\n\tprivate prefixSum: Uint32Array;\n\n\t/**\n\t * prefixSum[i], 0 <= i <= prefixSumValidIndex can be trusted\n\t */\n\tprivate readonly prefixSumValidIndex: Int32Array;\n\n\tconstructor(values: Uint32Array) {\n\t\tthis.values = values;\n\t\tthis.prefixSum = new Uint32Array(values.length);\n\t\tthis.prefixSumValidIndex = new Int32Array(1);\n\t\tthis.prefixSumValidIndex[0] = -1;\n\t}\n\n\tpublic insertValues(insertIndex: number, insertValues: Uint32Array): boolean {\n\t\tinsertIndex = toUint32(insertIndex);\n\t\tconst oldValues = this.values;\n\t\tconst oldPrefixSum = this.prefixSum;\n\t\tconst insertValuesLen = insertValues.length;\n\n\t\tif (insertValuesLen === 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tthis.values = new Uint32Array(oldValues.length + insertValuesLen);\n\t\tthis.values.set(oldValues.subarray(0, insertIndex), 0);\n\t\tthis.values.set(oldValues.subarray(insertIndex), insertIndex + insertValuesLen);\n\t\tthis.values.set(insertValues, insertIndex);\n\n\t\tif (insertIndex - 1 < this.prefixSumValidIndex[0]) {\n\t\t\tthis.prefixSumValidIndex[0] = insertIndex - 1;\n\t\t}\n\n\t\tthis.prefixSum = new Uint32Array(this.values.length);\n\t\tif (this.prefixSumValidIndex[0] >= 0) {\n\t\t\tthis.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic setValue(index: number, value: number): boolean {\n\t\tindex = toUint32(index);\n\t\tvalue = toUint32(value);\n\n\t\tif (this.values[index] === value) {\n\t\t\treturn false;\n\t\t}\n\t\tthis.values[index] = value;\n\t\tif (index - 1 < this.prefixSumValidIndex[0]) {\n\t\t\tthis.prefixSumValidIndex[0] = index - 1;\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic removeValues(startIndex: number, count: number): boolean {\n\t\tstartIndex = toUint32(startIndex);\n\t\tcount = toUint32(count);\n\n\t\tconst oldValues = this.values;\n\t\tconst oldPrefixSum = this.prefixSum;\n\n\t\tif (startIndex >= oldValues.length) {\n\t\t\treturn false;\n\t\t}\n\n\t\tconst maxCount = oldValues.length - startIndex;\n\t\tif (count >= maxCount) {\n\t\t\tcount = maxCount;\n\t\t}\n\n\t\tif (count === 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tthis.values = new Uint32Array(oldValues.length - count);\n\t\tthis.values.set(oldValues.subarray(0, startIndex), 0);\n\t\tthis.values.set(oldValues.subarray(startIndex + count), startIndex);\n\n\t\tthis.prefixSum = new Uint32Array(this.values.length);\n\t\tif (startIndex - 1 < this.prefixSumValidIndex[0]) {\n\t\t\tthis.prefixSumValidIndex[0] = startIndex - 1;\n\t\t}\n\t\tif (this.prefixSumValidIndex[0] >= 0) {\n\t\t\tthis.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));\n\t\t}\n\t\treturn true;\n\t}\n\n\tpublic getTotalSum(): number {\n\t\tif (this.values.length === 0) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn this._getPrefixSum(this.values.length - 1);\n\t}\n\n\t/**\n\t * Returns the sum of the first `index + 1` many items.\n\t * @returns `SUM(0 <= j <= index, values[j])`.\n\t */\n\tpublic getPrefixSum(index: number): number {\n\t\tif (index < 0) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tindex = toUint32(index);\n\t\treturn this._getPrefixSum(index);\n\t}\n\n\tprivate _getPrefixSum(index: number): number {\n\t\tif (index <= this.prefixSumValidIndex[0]) {\n\t\t\treturn this.prefixSum[index];\n\t\t}\n\n\t\tlet startIndex = this.prefixSumValidIndex[0] + 1;\n\t\tif (startIndex === 0) {\n\t\t\tthis.prefixSum[0] = this.values[0];\n\t\t\tstartIndex++;\n\t\t}\n\n\t\tif (index >= this.values.length) {\n\t\t\tindex = this.values.length - 1;\n\t\t}\n\n\t\tfor (let i = startIndex; i <= index; i++) {\n\t\t\tthis.prefixSum[i] = this.prefixSum[i - 1] + this.values[i];\n\t\t}\n\t\tthis.prefixSumValidIndex[0] = Math.max(this.prefixSumValidIndex[0], index);\n\t\treturn this.prefixSum[index];\n\t}\n\n\tpublic getIndexOf(sum: number): PrefixSumIndexOfResult {\n\t\tsum = Math.floor(sum);\n\n\t\t// Compute all sums (to get a fully valid prefixSum)\n\t\tthis.getTotalSum();\n\n\t\tlet low = 0;\n\t\tlet high = this.values.length - 1;\n\t\tlet mid = 0;\n\t\tlet midStop = 0;\n\t\tlet midStart = 0;\n\n\t\twhile (low <= high) {\n\t\t\tmid = low + ((high - low) / 2) | 0;\n\n\t\t\tmidStop = this.prefixSum[mid];\n\t\t\tmidStart = midStop - this.values[mid];\n\n\t\t\tif (sum < midStart) {\n\t\t\t\thigh = mid - 1;\n\t\t\t} else if (sum >= midStop) {\n\t\t\t\tlow = mid + 1;\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\treturn new PrefixSumIndexOfResult(mid, sum - midStart);\n\t}\n}\n\n/**\n * {@link getIndexOf} has an amortized runtime complexity of O(1).\n *\n * ({@link PrefixSumComputer.getIndexOf} is just  O(log n))\n*/\nexport class ConstantTimePrefixSumComputer {\n\tprivate _values: number[];\n\tprivate _isValid: boolean;\n\tprivate _validEndIndex: number;\n\n\t/**\n\t * _prefixSum[i] = SUM(values[j]), 0 <= j <= i\n\t */\n\tprivate _prefixSum: number[];\n\n\t/**\n\t * _indexBySum[sum] = idx => _prefixSum[idx - 1] <= sum < _prefixSum[idx]\n\t*/\n\tprivate _indexBySum: number[];\n\n\tconstructor(values: number[]) {\n\t\tthis._values = values;\n\t\tthis._isValid = false;\n\t\tthis._validEndIndex = -1;\n\t\tthis._prefixSum = [];\n\t\tthis._indexBySum = [];\n\t}\n\n\t/**\n\t * @returns SUM(0 <= j < values.length, values[j])\n\t */\n\tpublic getTotalSum(): number {\n\t\tthis._ensureValid();\n\t\treturn this._indexBySum.length;\n\t}\n\n\t/**\n\t * Returns the sum of the first `count` many items.\n\t * @returns `SUM(0 <= j < count, values[j])`.\n\t */\n\tpublic getPrefixSum(count: number): number {\n\t\tthis._ensureValid();\n\t\tif (count === 0) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn this._prefixSum[count - 1];\n\t}\n\n\t/**\n\t * @returns `result`, such that `getPrefixSum(result.index) + result.remainder = sum`\n\t */\n\tpublic getIndexOf(sum: number): PrefixSumIndexOfResult {\n\t\tthis._ensureValid();\n\t\tconst idx = this._indexBySum[sum];\n\t\tconst viewLinesAbove = idx > 0 ? this._prefixSum[idx - 1] : 0;\n\t\treturn new PrefixSumIndexOfResult(idx, sum - viewLinesAbove);\n\t}\n\n\tpublic removeValues(start: number, deleteCount: number): void {\n\t\tthis._values.splice(start, deleteCount);\n\t\tthis._invalidate(start);\n\t}\n\n\tpublic insertValues(insertIndex: number, insertArr: number[]): void {\n\t\tthis._values = arrayInsert(this._values, insertIndex, insertArr);\n\t\tthis._invalidate(insertIndex);\n\t}\n\n\tprivate _invalidate(index: number): void {\n\t\tthis._isValid = false;\n\t\tthis._validEndIndex = Math.min(this._validEndIndex, index - 1);\n\t}\n\n\tprivate _ensureValid(): void {\n\t\tif (this._isValid) {\n\t\t\treturn;\n\t\t}\n\n\t\tfor (let i = this._validEndIndex + 1, len = this._values.length; i < len; i++) {\n\t\t\tconst value = this._values[i];\n\t\t\tconst sumAbove = i > 0 ? this._prefixSum[i - 1] : 0;\n\n\t\t\tthis._prefixSum[i] = sumAbove + value;\n\t\t\tfor (let j = 0; j < value; j++) {\n\t\t\t\tthis._indexBySum[sumAbove + j] = i;\n\t\t\t}\n\t\t}\n\n\t\t// trim things\n\t\tthis._prefixSum.length = this._values.length;\n\t\tthis._indexBySum.length = this._prefixSum[this._prefixSum.length - 1];\n\n\t\t// mark as valid\n\t\tthis._isValid = true;\n\t\tthis._validEndIndex = this._values.length - 1;\n\t}\n\n\tpublic setValue(index: number, value: number): void {\n\t\tif (this._values[index] === value) {\n\t\t\t// no change\n\t\t\treturn;\n\t\t}\n\t\tthis._values[index] = value;\n\t\tthis._invalidate(index);\n\t}\n}\n\n\nexport class PrefixSumIndexOfResult {\n\t_prefixSumIndexOfResultBrand: void = undefined;\n\n\tconstructor(\n\t\tpublic readonly index: number,\n\t\tpublic readonly remainder: number\n\t) {\n\t\tthis.index = index;\n\t\tthis.remainder = remainder;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { splitLines } from 'vs/base/common/strings';\nimport { URI } from 'vs/base/common/uri';\nimport { Position } from 'vs/editor/common/core/position';\nimport { IRange } from 'vs/editor/common/core/range';\nimport { IModelContentChange } from 'vs/editor/common/textModelEvents';\nimport { PrefixSumComputer } from 'vs/editor/common/model/prefixSumComputer';\n\nexport interface IModelChangedEvent {\n\t/**\n\t * The actual changes.\n\t */\n\treadonly changes: IModelContentChange[];\n\t/**\n\t * The (new) end-of-line character.\n\t */\n\treadonly eol: string;\n\t/**\n\t * The new version id the model has transitioned to.\n\t */\n\treadonly versionId: number;\n}\n\nexport interface IMirrorTextModel {\n\treadonly version: number;\n}\n\nexport class MirrorTextModel implements IMirrorTextModel {\n\n\tprotected _uri: URI;\n\tprotected _lines: string[];\n\tprotected _eol: string;\n\tprotected _versionId: number;\n\tprotected _lineStarts: PrefixSumComputer | null;\n\tprivate _cachedTextValue: string | null;\n\n\tconstructor(uri: URI, lines: string[], eol: string, versionId: number) {\n\t\tthis._uri = uri;\n\t\tthis._lines = lines;\n\t\tthis._eol = eol;\n\t\tthis._versionId = versionId;\n\t\tthis._lineStarts = null;\n\t\tthis._cachedTextValue = null;\n\t}\n\n\tdispose(): void {\n\t\tthis._lines.length = 0;\n\t}\n\n\tget version(): number {\n\t\treturn this._versionId;\n\t}\n\n\tgetText(): string {\n\t\tif (this._cachedTextValue === null) {\n\t\t\tthis._cachedTextValue = this._lines.join(this._eol);\n\t\t}\n\t\treturn this._cachedTextValue;\n\t}\n\n\tonEvents(e: IModelChangedEvent): void {\n\t\tif (e.eol && e.eol !== this._eol) {\n\t\t\tthis._eol = e.eol;\n\t\t\tthis._lineStarts = null;\n\t\t}\n\n\t\t// Update my lines\n\t\tconst changes = e.changes;\n\t\tfor (const change of changes) {\n\t\t\tthis._acceptDeleteRange(change.range);\n\t\t\tthis._acceptInsertText(new Position(change.range.startLineNumber, change.range.startColumn), change.text);\n\t\t}\n\n\t\tthis._versionId = e.versionId;\n\t\tthis._cachedTextValue = null;\n\t}\n\n\tprotected _ensureLineStarts(): void {\n\t\tif (!this._lineStarts) {\n\t\t\tconst eolLength = this._eol.length;\n\t\t\tconst linesLength = this._lines.length;\n\t\t\tconst lineStartValues = new Uint32Array(linesLength);\n\t\t\tfor (let i = 0; i < linesLength; i++) {\n\t\t\t\tlineStartValues[i] = this._lines[i].length + eolLength;\n\t\t\t}\n\t\t\tthis._lineStarts = new PrefixSumComputer(lineStartValues);\n\t\t}\n\t}\n\n\t/**\n\t * All changes to a line's text go through this method\n\t */\n\tprivate _setLineText(lineIndex: number, newValue: string): void {\n\t\tthis._lines[lineIndex] = newValue;\n\t\tif (this._lineStarts) {\n\t\t\t// update prefix sum\n\t\t\tthis._lineStarts.setValue(lineIndex, this._lines[lineIndex].length + this._eol.length);\n\t\t}\n\t}\n\n\tprivate _acceptDeleteRange(range: IRange): void {\n\n\t\tif (range.startLineNumber === range.endLineNumber) {\n\t\t\tif (range.startColumn === range.endColumn) {\n\t\t\t\t// Nothing to delete\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Delete text on the affected line\n\t\t\tthis._setLineText(range.startLineNumber - 1,\n\t\t\t\tthis._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1)\n\t\t\t\t+ this._lines[range.startLineNumber - 1].substring(range.endColumn - 1)\n\t\t\t);\n\t\t\treturn;\n\t\t}\n\n\t\t// Take remaining text on last line and append it to remaining text on first line\n\t\tthis._setLineText(range.startLineNumber - 1,\n\t\t\tthis._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1)\n\t\t\t+ this._lines[range.endLineNumber - 1].substring(range.endColumn - 1)\n\t\t);\n\n\t\t// Delete middle lines\n\t\tthis._lines.splice(range.startLineNumber, range.endLineNumber - range.startLineNumber);\n\t\tif (this._lineStarts) {\n\t\t\t// update prefix sum\n\t\t\tthis._lineStarts.removeValues(range.startLineNumber, range.endLineNumber - range.startLineNumber);\n\t\t}\n\t}\n\n\tprivate _acceptInsertText(position: Position, insertText: string): void {\n\t\tif (insertText.length === 0) {\n\t\t\t// Nothing to insert\n\t\t\treturn;\n\t\t}\n\t\tconst insertLines = splitLines(insertText);\n\t\tif (insertLines.length === 1) {\n\t\t\t// Inserting text on one line\n\t\t\tthis._setLineText(position.lineNumber - 1,\n\t\t\t\tthis._lines[position.lineNumber - 1].substring(0, position.column - 1)\n\t\t\t\t+ insertLines[0]\n\t\t\t\t+ this._lines[position.lineNumber - 1].substring(position.column - 1)\n\t\t\t);\n\t\t\treturn;\n\t\t}\n\n\t\t// Append overflowing text from first line to the end of text to insert\n\t\tinsertLines[insertLines.length - 1] += this._lines[position.lineNumber - 1].substring(position.column - 1);\n\n\t\t// Delete overflowing text from first line and insert text on first line\n\t\tthis._setLineText(position.lineNumber - 1,\n\t\t\tthis._lines[position.lineNumber - 1].substring(0, position.column - 1)\n\t\t\t+ insertLines[0]\n\t\t);\n\n\t\t// Insert new lines & store lengths\n\t\tconst newLengths = new Uint32Array(insertLines.length - 1);\n\t\tfor (let i = 1; i < insertLines.length; i++) {\n\t\t\tthis._lines.splice(position.lineNumber + i - 1, 0, insertLines[i]);\n\t\t\tnewLengths[i - 1] = insertLines[i].length + this._eol.length;\n\t\t}\n\n\t\tif (this._lineStarts) {\n\t\t\t// update prefix sum\n\t\t\tthis._lineStarts.insertValues(position.lineNumber, newLengths);\n\t\t}\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\nimport * as strings from 'vs/base/common/strings';\nimport { WordCharacterClass, WordCharacterClassifier, getMapForWordSeparators } from 'vs/editor/common/core/wordCharacterClassifier';\nimport { Position } from 'vs/editor/common/core/position';\nimport { Range } from 'vs/editor/common/core/range';\nimport { EndOfLinePreference, FindMatch, SearchData } from 'vs/editor/common/model';\nimport { TextModel } from 'vs/editor/common/model/textModel';\n\nconst LIMIT_FIND_COUNT = 999;\n\nexport class SearchParams {\n\tpublic readonly searchString: string;\n\tpublic readonly isRegex: boolean;\n\tpublic readonly matchCase: boolean;\n\tpublic readonly wordSeparators: string | null;\n\n\tconstructor(searchString: string, isRegex: boolean, matchCase: boolean, wordSeparators: string | null) {\n\t\tthis.searchString = searchString;\n\t\tthis.isRegex = isRegex;\n\t\tthis.matchCase = matchCase;\n\t\tthis.wordSeparators = wordSeparators;\n\t}\n\n\tpublic parseSearchRequest(): SearchData | null {\n\t\tif (this.searchString === '') {\n\t\t\treturn null;\n\t\t}\n\n\t\t// Try to create a RegExp out of the params\n\t\tlet multiline: boolean;\n\t\tif (this.isRegex) {\n\t\t\tmultiline = isMultilineRegexSource(this.searchString);\n\t\t} else {\n\t\t\tmultiline = (this.searchString.indexOf('\\n') >= 0);\n\t\t}\n\n\t\tlet regex: RegExp | null = null;\n\t\ttry {\n\t\t\tregex = strings.createRegExp(this.searchString, this.isRegex, {\n\t\t\t\tmatchCase: this.matchCase,\n\t\t\t\twholeWord: false,\n\t\t\t\tmultiline: multiline,\n\t\t\t\tglobal: true,\n\t\t\t\tunicode: true\n\t\t\t});\n\t\t} catch (err) {\n\t\t\treturn null;\n\t\t}\n\n\t\tif (!regex) {\n\t\t\treturn null;\n\t\t}\n\n\t\tlet canUseSimpleSearch = (!this.isRegex && !multiline);\n\t\tif (canUseSimpleSearch && this.searchString.toLowerCase() !== this.searchString.toUpperCase()) {\n\t\t\t// casing might make a difference\n\t\t\tcanUseSimpleSearch = this.matchCase;\n\t\t}\n\n\t\treturn new SearchData(regex, this.wordSeparators ? getMapForWordSeparators(this.wordSeparators, []) : null, canUseSimpleSearch ? this.searchString : null);\n\t}\n}\n\nexport function isMultilineRegexSource(searchString: string): boolean {\n\tif (!searchString || searchString.length === 0) {\n\t\treturn false;\n\t}\n\n\tfor (let i = 0, len = searchString.length; i < len; i++) {\n\t\tconst chCode = searchString.charCodeAt(i);\n\n\t\tif (chCode === CharCode.LineFeed) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (chCode === CharCode.Backslash) {\n\n\t\t\t// move to next char\n\t\t\ti++;\n\n\t\t\tif (i >= len) {\n\t\t\t\t// string ends with a \\\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst nextChCode = searchString.charCodeAt(i);\n\t\t\tif (nextChCode === CharCode.n || nextChCode === CharCode.r || nextChCode === CharCode.W) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false;\n}\n\nexport function createFindMatch(range: Range, rawMatches: RegExpExecArray, captureMatches: boolean): FindMatch {\n\tif (!captureMatches) {\n\t\treturn new FindMatch(range, null);\n\t}\n\tconst matches: string[] = [];\n\tfor (let i = 0, len = rawMatches.length; i < len; i++) {\n\t\tmatches[i] = rawMatches[i];\n\t}\n\treturn new FindMatch(range, matches);\n}\n\nclass LineFeedCounter {\n\n\tprivate readonly _lineFeedsOffsets: number[];\n\n\tconstructor(text: string) {\n\t\tconst lineFeedsOffsets: number[] = [];\n\t\tlet lineFeedsOffsetsLen = 0;\n\t\tfor (let i = 0, textLen = text.length; i < textLen; i++) {\n\t\t\tif (text.charCodeAt(i) === CharCode.LineFeed) {\n\t\t\t\tlineFeedsOffsets[lineFeedsOffsetsLen++] = i;\n\t\t\t}\n\t\t}\n\t\tthis._lineFeedsOffsets = lineFeedsOffsets;\n\t}\n\n\tpublic findLineFeedCountBeforeOffset(offset: number): number {\n\t\tconst lineFeedsOffsets = this._lineFeedsOffsets;\n\t\tlet min = 0;\n\t\tlet max = lineFeedsOffsets.length - 1;\n\n\t\tif (max === -1) {\n\t\t\t// no line feeds\n\t\t\treturn 0;\n\t\t}\n\n\t\tif (offset <= lineFeedsOffsets[0]) {\n\t\t\t// before first line feed\n\t\t\treturn 0;\n\t\t}\n\n\t\twhile (min < max) {\n\t\t\tconst mid = min + ((max - min) / 2 >> 0);\n\n\t\t\tif (lineFeedsOffsets[mid] >= offset) {\n\t\t\t\tmax = mid - 1;\n\t\t\t} else {\n\t\t\t\tif (lineFeedsOffsets[mid + 1] >= offset) {\n\t\t\t\t\t// bingo!\n\t\t\t\t\tmin = mid;\n\t\t\t\t\tmax = mid;\n\t\t\t\t} else {\n\t\t\t\t\tmin = mid + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn min + 1;\n\t}\n}\n\nexport class TextModelSearch {\n\n\tpublic static findMatches(model: TextModel, searchParams: SearchParams, searchRange: Range, captureMatches: boolean, limitResultCount: number): FindMatch[] {\n\t\tconst searchData = searchParams.parseSearchRequest();\n\t\tif (!searchData) {\n\t\t\treturn [];\n\t\t}\n\n\t\tif (searchData.regex.multiline) {\n\t\t\treturn this._doFindMatchesMultiline(model, searchRange, new Searcher(searchData.wordSeparators, searchData.regex), captureMatches, limitResultCount);\n\t\t}\n\t\treturn this._doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount);\n\t}\n\n\t/**\n\t * Multiline search always executes on the lines concatenated with \\n.\n\t * We must therefore compensate for the count of \\n in case the model is CRLF\n\t */\n\tprivate static _getMultilineMatchRange(model: TextModel, deltaOffset: number, text: string, lfCounter: LineFeedCounter | null, matchIndex: number, match0: string): Range {\n\t\tlet startOffset: number;\n\t\tlet lineFeedCountBeforeMatch = 0;\n\t\tif (lfCounter) {\n\t\t\tlineFeedCountBeforeMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex);\n\t\t\tstartOffset = deltaOffset + matchIndex + lineFeedCountBeforeMatch /* add as many \\r as there were \\n */;\n\t\t} else {\n\t\t\tstartOffset = deltaOffset + matchIndex;\n\t\t}\n\n\t\tlet endOffset: number;\n\t\tif (lfCounter) {\n\t\t\tconst lineFeedCountBeforeEndOfMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex + match0.length);\n\t\t\tconst lineFeedCountInMatch = lineFeedCountBeforeEndOfMatch - lineFeedCountBeforeMatch;\n\t\t\tendOffset = startOffset + match0.length + lineFeedCountInMatch /* add as many \\r as there were \\n */;\n\t\t} else {\n\t\t\tendOffset = startOffset + match0.length;\n\t\t}\n\n\t\tconst startPosition = model.getPositionAt(startOffset);\n\t\tconst endPosition = model.getPositionAt(endOffset);\n\t\treturn new Range(startPosition.lineNumber, startPosition.column, endPosition.lineNumber, endPosition.column);\n\t}\n\n\tprivate static _doFindMatchesMultiline(model: TextModel, searchRange: Range, searcher: Searcher, captureMatches: boolean, limitResultCount: number): FindMatch[] {\n\t\tconst deltaOffset = model.getOffsetAt(searchRange.getStartPosition());\n\t\t// We always execute multiline search over the lines joined with \\n\n\t\t// This makes it that \\n will match the EOL for both CRLF and LF models\n\t\t// We compensate for offset errors in `_getMultilineMatchRange`\n\t\tconst text = model.getValueInRange(searchRange, EndOfLinePreference.LF);\n\t\tconst lfCounter = (model.getEOL() === '\\r\\n' ? new LineFeedCounter(text) : null);\n\n\t\tconst result: FindMatch[] = [];\n\t\tlet counter = 0;\n\n\t\tlet m: RegExpExecArray | null;\n\t\tsearcher.reset(0);\n\t\twhile ((m = searcher.next(text))) {\n\t\t\tresult[counter++] = createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);\n\t\t\tif (counter >= limitResultCount) {\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n\n\tprivate static _doFindMatchesLineByLine(model: TextModel, searchRange: Range, searchData: SearchData, captureMatches: boolean, limitResultCount: number): FindMatch[] {\n\t\tconst result: FindMatch[] = [];\n\t\tlet resultLen = 0;\n\n\t\t// Early case for a search range that starts & stops on the same line number\n\t\tif (searchRange.startLineNumber === searchRange.endLineNumber) {\n\t\t\tconst text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1, searchRange.endColumn - 1);\n\t\t\tresultLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resultLen, result, captureMatches, limitResultCount);\n\t\t\treturn result;\n\t\t}\n\n\t\t// Collect results from first line\n\t\tconst text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1);\n\t\tresultLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resultLen, result, captureMatches, limitResultCount);\n\n\t\t// Collect results from middle lines\n\t\tfor (let lineNumber = searchRange.startLineNumber + 1; lineNumber < searchRange.endLineNumber && resultLen < limitResultCount; lineNumber++) {\n\t\t\tresultLen = this._findMatchesInLine(searchData, model.getLineContent(lineNumber), lineNumber, 0, resultLen, result, captureMatches, limitResultCount);\n\t\t}\n\n\t\t// Collect results from last line\n\t\tif (resultLen < limitResultCount) {\n\t\t\tconst text = model.getLineContent(searchRange.endLineNumber).substring(0, searchRange.endColumn - 1);\n\t\t\tresultLen = this._findMatchesInLine(searchData, text, searchRange.endLineNumber, 0, resultLen, result, captureMatches, limitResultCount);\n\t\t}\n\n\t\treturn result;\n\t}\n\n\tprivate static _findMatchesInLine(searchData: SearchData, text: string, lineNumber: number, deltaOffset: number, resultLen: number, result: FindMatch[], captureMatches: boolean, limitResultCount: number): number {\n\t\tconst wordSeparators = searchData.wordSeparators;\n\t\tif (!captureMatches && searchData.simpleSearch) {\n\t\t\tconst searchString = searchData.simpleSearch;\n\t\t\tconst searchStringLen = searchString.length;\n\t\t\tconst textLength = text.length;\n\n\t\t\tlet lastMatchIndex = -searchStringLen;\n\t\t\twhile ((lastMatchIndex = text.indexOf(searchString, lastMatchIndex + searchStringLen)) !== -1) {\n\t\t\t\tif (!wordSeparators || isValidMatch(wordSeparators, text, textLength, lastMatchIndex, searchStringLen)) {\n\t\t\t\t\tresult[resultLen++] = new FindMatch(new Range(lineNumber, lastMatchIndex + 1 + deltaOffset, lineNumber, lastMatchIndex + 1 + searchStringLen + deltaOffset), null);\n\t\t\t\t\tif (resultLen >= limitResultCount) {\n\t\t\t\t\t\treturn resultLen;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn resultLen;\n\t\t}\n\n\t\tconst searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n\t\tlet m: RegExpExecArray | null;\n\t\t// Reset regex to search from the beginning\n\t\tsearcher.reset(0);\n\t\tdo {\n\t\t\tm = searcher.next(text);\n\t\t\tif (m) {\n\t\t\t\tresult[resultLen++] = createFindMatch(new Range(lineNumber, m.index + 1 + deltaOffset, lineNumber, m.index + 1 + m[0].length + deltaOffset), m, captureMatches);\n\t\t\t\tif (resultLen >= limitResultCount) {\n\t\t\t\t\treturn resultLen;\n\t\t\t\t}\n\t\t\t}\n\t\t} while (m);\n\t\treturn resultLen;\n\t}\n\n\tpublic static findNextMatch(model: TextModel, searchParams: SearchParams, searchStart: Position, captureMatches: boolean): FindMatch | null {\n\t\tconst searchData = searchParams.parseSearchRequest();\n\t\tif (!searchData) {\n\t\t\treturn null;\n\t\t}\n\n\t\tconst searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n\n\t\tif (searchData.regex.multiline) {\n\t\t\treturn this._doFindNextMatchMultiline(model, searchStart, searcher, captureMatches);\n\t\t}\n\t\treturn this._doFindNextMatchLineByLine(model, searchStart, searcher, captureMatches);\n\t}\n\n\tprivate static _doFindNextMatchMultiline(model: TextModel, searchStart: Position, searcher: Searcher, captureMatches: boolean): FindMatch | null {\n\t\tconst searchTextStart = new Position(searchStart.lineNumber, 1);\n\t\tconst deltaOffset = model.getOffsetAt(searchTextStart);\n\t\tconst lineCount = model.getLineCount();\n\t\t// We always execute multiline search over the lines joined with \\n\n\t\t// This makes it that \\n will match the EOL for both CRLF and LF models\n\t\t// We compensate for offset errors in `_getMultilineMatchRange`\n\t\tconst text = model.getValueInRange(new Range(searchTextStart.lineNumber, searchTextStart.column, lineCount, model.getLineMaxColumn(lineCount)), EndOfLinePreference.LF);\n\t\tconst lfCounter = (model.getEOL() === '\\r\\n' ? new LineFeedCounter(text) : null);\n\t\tsearcher.reset(searchStart.column - 1);\n\t\tconst m = searcher.next(text);\n\t\tif (m) {\n\t\t\treturn createFindMatch(\n\t\t\t\tthis._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]),\n\t\t\t\tm,\n\t\t\t\tcaptureMatches\n\t\t\t);\n\t\t}\n\n\t\tif (searchStart.lineNumber !== 1 || searchStart.column !== 1) {\n\t\t\t// Try again from the top\n\t\t\treturn this._doFindNextMatchMultiline(model, new Position(1, 1), searcher, captureMatches);\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate static _doFindNextMatchLineByLine(model: TextModel, searchStart: Position, searcher: Searcher, captureMatches: boolean): FindMatch | null {\n\t\tconst lineCount = model.getLineCount();\n\t\tconst startLineNumber = searchStart.lineNumber;\n\n\t\t// Look in first line\n\t\tconst text = model.getLineContent(startLineNumber);\n\t\tconst r = this._findFirstMatchInLine(searcher, text, startLineNumber, searchStart.column, captureMatches);\n\t\tif (r) {\n\t\t\treturn r;\n\t\t}\n\n\t\tfor (let i = 1; i <= lineCount; i++) {\n\t\t\tconst lineIndex = (startLineNumber + i - 1) % lineCount;\n\t\t\tconst text = model.getLineContent(lineIndex + 1);\n\t\t\tconst r = this._findFirstMatchInLine(searcher, text, lineIndex + 1, 1, captureMatches);\n\t\t\tif (r) {\n\t\t\t\treturn r;\n\t\t\t}\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate static _findFirstMatchInLine(searcher: Searcher, text: string, lineNumber: number, fromColumn: number, captureMatches: boolean): FindMatch | null {\n\t\t// Set regex to search from column\n\t\tsearcher.reset(fromColumn - 1);\n\t\tconst m: RegExpExecArray | null = searcher.next(text);\n\t\tif (m) {\n\t\t\treturn createFindMatch(\n\t\t\t\tnew Range(lineNumber, m.index + 1, lineNumber, m.index + 1 + m[0].length),\n\t\t\t\tm,\n\t\t\t\tcaptureMatches\n\t\t\t);\n\t\t}\n\t\treturn null;\n\t}\n\n\tpublic static findPreviousMatch(model: TextModel, searchParams: SearchParams, searchStart: Position, captureMatches: boolean): FindMatch | null {\n\t\tconst searchData = searchParams.parseSearchRequest();\n\t\tif (!searchData) {\n\t\t\treturn null;\n\t\t}\n\n\t\tconst searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n\n\t\tif (searchData.regex.multiline) {\n\t\t\treturn this._doFindPreviousMatchMultiline(model, searchStart, searcher, captureMatches);\n\t\t}\n\t\treturn this._doFindPreviousMatchLineByLine(model, searchStart, searcher, captureMatches);\n\t}\n\n\tprivate static _doFindPreviousMatchMultiline(model: TextModel, searchStart: Position, searcher: Searcher, captureMatches: boolean): FindMatch | null {\n\t\tconst matches = this._doFindMatchesMultiline(model, new Range(1, 1, searchStart.lineNumber, searchStart.column), searcher, captureMatches, 10 * LIMIT_FIND_COUNT);\n\t\tif (matches.length > 0) {\n\t\t\treturn matches[matches.length - 1];\n\t\t}\n\n\t\tconst lineCount = model.getLineCount();\n\t\tif (searchStart.lineNumber !== lineCount || searchStart.column !== model.getLineMaxColumn(lineCount)) {\n\t\t\t// Try again with all content\n\t\t\treturn this._doFindPreviousMatchMultiline(model, new Position(lineCount, model.getLineMaxColumn(lineCount)), searcher, captureMatches);\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate static _doFindPreviousMatchLineByLine(model: TextModel, searchStart: Position, searcher: Searcher, captureMatches: boolean): FindMatch | null {\n\t\tconst lineCount = model.getLineCount();\n\t\tconst startLineNumber = searchStart.lineNumber;\n\n\t\t// Look in first line\n\t\tconst text = model.getLineContent(startLineNumber).substring(0, searchStart.column - 1);\n\t\tconst r = this._findLastMatchInLine(searcher, text, startLineNumber, captureMatches);\n\t\tif (r) {\n\t\t\treturn r;\n\t\t}\n\n\t\tfor (let i = 1; i <= lineCount; i++) {\n\t\t\tconst lineIndex = (lineCount + startLineNumber - i - 1) % lineCount;\n\t\t\tconst text = model.getLineContent(lineIndex + 1);\n\t\t\tconst r = this._findLastMatchInLine(searcher, text, lineIndex + 1, captureMatches);\n\t\t\tif (r) {\n\t\t\t\treturn r;\n\t\t\t}\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate static _findLastMatchInLine(searcher: Searcher, text: string, lineNumber: number, captureMatches: boolean): FindMatch | null {\n\t\tlet bestResult: FindMatch | null = null;\n\t\tlet m: RegExpExecArray | null;\n\t\tsearcher.reset(0);\n\t\twhile ((m = searcher.next(text))) {\n\t\t\tbestResult = createFindMatch(new Range(lineNumber, m.index + 1, lineNumber, m.index + 1 + m[0].length), m, captureMatches);\n\t\t}\n\t\treturn bestResult;\n\t}\n}\n\nfunction leftIsWordBounday(wordSeparators: WordCharacterClassifier, text: string, textLength: number, matchStartIndex: number, matchLength: number): boolean {\n\tif (matchStartIndex === 0) {\n\t\t// Match starts at start of string\n\t\treturn true;\n\t}\n\n\tconst charBefore = text.charCodeAt(matchStartIndex - 1);\n\tif (wordSeparators.get(charBefore) !== WordCharacterClass.Regular) {\n\t\t// The character before the match is a word separator\n\t\treturn true;\n\t}\n\n\tif (charBefore === CharCode.CarriageReturn || charBefore === CharCode.LineFeed) {\n\t\t// The character before the match is line break or carriage return.\n\t\treturn true;\n\t}\n\n\tif (matchLength > 0) {\n\t\tconst firstCharInMatch = text.charCodeAt(matchStartIndex);\n\t\tif (wordSeparators.get(firstCharInMatch) !== WordCharacterClass.Regular) {\n\t\t\t// The first character inside the match is a word separator\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nfunction rightIsWordBounday(wordSeparators: WordCharacterClassifier, text: string, textLength: number, matchStartIndex: number, matchLength: number): boolean {\n\tif (matchStartIndex + matchLength === textLength) {\n\t\t// Match ends at end of string\n\t\treturn true;\n\t}\n\n\tconst charAfter = text.charCodeAt(matchStartIndex + matchLength);\n\tif (wordSeparators.get(charAfter) !== WordCharacterClass.Regular) {\n\t\t// The character after the match is a word separator\n\t\treturn true;\n\t}\n\n\tif (charAfter === CharCode.CarriageReturn || charAfter === CharCode.LineFeed) {\n\t\t// The character after the match is line break or carriage return.\n\t\treturn true;\n\t}\n\n\tif (matchLength > 0) {\n\t\tconst lastCharInMatch = text.charCodeAt(matchStartIndex + matchLength - 1);\n\t\tif (wordSeparators.get(lastCharInMatch) !== WordCharacterClass.Regular) {\n\t\t\t// The last character in the match is a word separator\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nexport function isValidMatch(wordSeparators: WordCharacterClassifier, text: string, textLength: number, matchStartIndex: number, matchLength: number): boolean {\n\treturn (\n\t\tleftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength)\n\t\t&& rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength)\n\t);\n}\n\nexport class Searcher {\n\tpublic readonly _wordSeparators: WordCharacterClassifier | null;\n\tprivate readonly _searchRegex: RegExp;\n\tprivate _prevMatchStartIndex: number;\n\tprivate _prevMatchLength: number;\n\n\tconstructor(wordSeparators: WordCharacterClassifier | null, searchRegex: RegExp,) {\n\t\tthis._wordSeparators = wordSeparators;\n\t\tthis._searchRegex = searchRegex;\n\t\tthis._prevMatchStartIndex = -1;\n\t\tthis._prevMatchLength = 0;\n\t}\n\n\tpublic reset(lastIndex: number): void {\n\t\tthis._searchRegex.lastIndex = lastIndex;\n\t\tthis._prevMatchStartIndex = -1;\n\t\tthis._prevMatchLength = 0;\n\t}\n\n\tpublic next(text: string): RegExpExecArray | null {\n\t\tconst textLength = text.length;\n\n\t\tlet m: RegExpExecArray | null;\n\t\tdo {\n\t\t\tif (this._prevMatchStartIndex + this._prevMatchLength === textLength) {\n\t\t\t\t// Reached the end of the line\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\tm = this._searchRegex.exec(text);\n\t\t\tif (!m) {\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\tconst matchStartIndex = m.index;\n\t\t\tconst matchLength = m[0].length;\n\t\t\tif (matchStartIndex === this._prevMatchStartIndex && matchLength === this._prevMatchLength) {\n\t\t\t\tif (matchLength === 0) {\n\t\t\t\t\t// the search result is an empty string and won't advance `regex.lastIndex`, so `regex.exec` will stuck here\n\t\t\t\t\t// we attempt to recover from that by advancing by two if surrogate pair found and by one otherwise\n\t\t\t\t\tif (strings.getNextCodePoint(text, textLength, this._searchRegex.lastIndex) > 0xFFFF) {\n\t\t\t\t\t\tthis._searchRegex.lastIndex += 2;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthis._searchRegex.lastIndex += 1;\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t// Exit early if the regex matches the same range twice\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tthis._prevMatchStartIndex = matchStartIndex;\n\t\t\tthis._prevMatchLength = matchLength;\n\n\t\t\tif (!this._wordSeparators || isValidMatch(this._wordSeparators, text, textLength, matchStartIndex, matchLength)) {\n\t\t\t\treturn m;\n\t\t\t}\n\n\t\t} while (m);\n\n\t\treturn null;\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { IWorkerServer, IWorkerClient } from 'vs/base/common/worker/simpleWorker';\n\nexport abstract class EditorWorkerHost {\n\tpublic static CHANNEL_NAME = 'editorWorkerHost';\n\tpublic static getChannel(workerServer: IWorkerServer): EditorWorkerHost {\n\t\treturn workerServer.getChannel<EditorWorkerHost>(EditorWorkerHost.CHANNEL_NAME);\n\t}\n\tpublic static setChannel(workerClient: IWorkerClient<any>, obj: EditorWorkerHost): void {\n\t\tworkerClient.setChannel<EditorWorkerHost>(EditorWorkerHost.CHANNEL_NAME, obj);\n\t}\n\n\t// foreign host request\n\tabstract $fhr(method: string, args: any[]): Promise<any>;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { IRange } from 'vs/editor/common/core/range';\nimport { FoldingRules } from 'vs/editor/common/languages/languageConfiguration';\n\nexport interface ISectionHeaderFinderTarget {\n\tgetLineCount(): number;\n\tgetLineContent(lineNumber: number): string;\n}\n\nexport interface FindSectionHeaderOptions {\n\tfoldingRules?: FoldingRules;\n\tfindRegionSectionHeaders: boolean;\n\tfindMarkSectionHeaders: boolean;\n}\n\nexport interface SectionHeader {\n\t/**\n\t * The location of the header text in the text model.\n\t */\n\trange: IRange;\n\t/**\n\t * The section header text.\n\t */\n\ttext: string;\n\t/**\n\t * Whether the section header includes a separator line.\n\t */\n\thasSeparatorLine: boolean;\n\t/**\n\t * This section should be omitted before rendering if it's not in a comment.\n\t */\n\tshouldBeInComments: boolean;\n}\n\nconst markRegex = new RegExp('\\\\bMARK:\\\\s*(.*)$', 'd');\nconst trimDashesRegex = /^-+|-+$/g;\n\n/**\n * Find section headers in the model.\n *\n * @param model the text model to search in\n * @param options options to search with\n * @returns an array of section headers\n */\nexport function findSectionHeaders(model: ISectionHeaderFinderTarget, options: FindSectionHeaderOptions): SectionHeader[] {\n\tlet headers: SectionHeader[] = [];\n\tif (options.findRegionSectionHeaders && options.foldingRules?.markers) {\n\t\tconst regionHeaders = collectRegionHeaders(model, options);\n\t\theaders = headers.concat(regionHeaders);\n\t}\n\tif (options.findMarkSectionHeaders) {\n\t\tconst markHeaders = collectMarkHeaders(model);\n\t\theaders = headers.concat(markHeaders);\n\t}\n\treturn headers;\n}\n\nfunction collectRegionHeaders(model: ISectionHeaderFinderTarget, options: FindSectionHeaderOptions): SectionHeader[] {\n\tconst regionHeaders: SectionHeader[] = [];\n\tconst endLineNumber = model.getLineCount();\n\tfor (let lineNumber = 1; lineNumber <= endLineNumber; lineNumber++) {\n\t\tconst lineContent = model.getLineContent(lineNumber);\n\t\tconst match = lineContent.match(options.foldingRules!.markers!.start);\n\t\tif (match) {\n\t\t\tconst range = { startLineNumber: lineNumber, startColumn: match[0].length + 1, endLineNumber: lineNumber, endColumn: lineContent.length + 1 };\n\t\t\tif (range.endColumn > range.startColumn) {\n\t\t\t\tconst sectionHeader = {\n\t\t\t\t\trange,\n\t\t\t\t\t...getHeaderText(lineContent.substring(match[0].length)),\n\t\t\t\t\tshouldBeInComments: false\n\t\t\t\t};\n\t\t\t\tif (sectionHeader.text || sectionHeader.hasSeparatorLine) {\n\t\t\t\t\tregionHeaders.push(sectionHeader);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn regionHeaders;\n}\n\nfunction collectMarkHeaders(model: ISectionHeaderFinderTarget): SectionHeader[] {\n\tconst markHeaders: SectionHeader[] = [];\n\tconst endLineNumber = model.getLineCount();\n\tfor (let lineNumber = 1; lineNumber <= endLineNumber; lineNumber++) {\n\t\tconst lineContent = model.getLineContent(lineNumber);\n\t\taddMarkHeaderIfFound(lineContent, lineNumber, markHeaders);\n\t}\n\treturn markHeaders;\n}\n\nfunction addMarkHeaderIfFound(lineContent: string, lineNumber: number, sectionHeaders: SectionHeader[]) {\n\tmarkRegex.lastIndex = 0;\n\tconst match = markRegex.exec(lineContent);\n\tif (match) {\n\t\tconst column = match.indices![1][0] + 1;\n\t\tconst endColumn = match.indices![1][1] + 1;\n\t\tconst range = { startLineNumber: lineNumber, startColumn: column, endLineNumber: lineNumber, endColumn: endColumn };\n\t\tif (range.endColumn > range.startColumn) {\n\t\t\tconst sectionHeader = {\n\t\t\t\trange,\n\t\t\t\t...getHeaderText(match[1]),\n\t\t\t\tshouldBeInComments: true\n\t\t\t};\n\t\t\tif (sectionHeader.text || sectionHeader.hasSeparatorLine) {\n\t\t\t\tsectionHeaders.push(sectionHeader);\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction getHeaderText(text: string): { text: string; hasSeparatorLine: boolean } {\n\ttext = text.trim();\n\tconst hasSeparatorLine = text.startsWith('-');\n\ttext = text.replace(trimDashesRegex, '');\n\treturn { text, hasSeparatorLine };\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { IRange, Range } from 'vs/editor/common/core/range';\nimport { Searcher } from 'vs/editor/common/model/textModelSearch';\nimport * as strings from 'vs/base/common/strings';\nimport { IUnicodeHighlightsResult } from 'vs/editor/common/services/editorWorker';\nimport { assertNever } from 'vs/base/common/assert';\nimport { DEFAULT_WORD_REGEXP, getWordAtText } from 'vs/editor/common/core/wordHelper';\n\nexport class UnicodeTextModelHighlighter {\n\tpublic static computeUnicodeHighlights(model: IUnicodeCharacterSearcherTarget, options: UnicodeHighlighterOptions, range?: IRange): IUnicodeHighlightsResult {\n\t\tconst startLine = range ? range.startLineNumber : 1;\n\t\tconst endLine = range ? range.endLineNumber : model.getLineCount();\n\n\t\tconst codePointHighlighter = new CodePointHighlighter(options);\n\n\t\tconst candidates = codePointHighlighter.getCandidateCodePoints();\n\t\tlet regex: RegExp;\n\t\tif (candidates === 'allNonBasicAscii') {\n\t\t\tregex = new RegExp('[^\\\\t\\\\n\\\\r\\\\x20-\\\\x7E]', 'g');\n\t\t} else {\n\t\t\tregex = new RegExp(`${buildRegExpCharClassExpr(Array.from(candidates))}`, 'g');\n\t\t}\n\n\t\tconst searcher = new Searcher(null, regex);\n\t\tconst ranges: Range[] = [];\n\t\tlet hasMore = false;\n\t\tlet m: RegExpExecArray | null;\n\n\t\tlet ambiguousCharacterCount = 0;\n\t\tlet invisibleCharacterCount = 0;\n\t\tlet nonBasicAsciiCharacterCount = 0;\n\n\t\tforLoop:\n\t\tfor (let lineNumber = startLine, lineCount = endLine; lineNumber <= lineCount; lineNumber++) {\n\t\t\tconst lineContent = model.getLineContent(lineNumber);\n\t\t\tconst lineLength = lineContent.length;\n\n\t\t\t// Reset regex to search from the beginning\n\t\t\tsearcher.reset(0);\n\t\t\tdo {\n\t\t\t\tm = searcher.next(lineContent);\n\t\t\t\tif (m) {\n\t\t\t\t\tlet startIndex = m.index;\n\t\t\t\t\tlet endIndex = m.index + m[0].length;\n\n\t\t\t\t\t// Extend range to entire code point\n\t\t\t\t\tif (startIndex > 0) {\n\t\t\t\t\t\tconst charCodeBefore = lineContent.charCodeAt(startIndex - 1);\n\t\t\t\t\t\tif (strings.isHighSurrogate(charCodeBefore)) {\n\t\t\t\t\t\t\tstartIndex--;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (endIndex + 1 < lineLength) {\n\t\t\t\t\t\tconst charCodeBefore = lineContent.charCodeAt(endIndex - 1);\n\t\t\t\t\t\tif (strings.isHighSurrogate(charCodeBefore)) {\n\t\t\t\t\t\t\tendIndex++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tconst str = lineContent.substring(startIndex, endIndex);\n\t\t\t\t\tlet word = getWordAtText(startIndex + 1, DEFAULT_WORD_REGEXP, lineContent, 0);\n\t\t\t\t\tif (word && word.endColumn <= startIndex + 1) {\n\t\t\t\t\t\t// The word does not include the problematic character, ignore the word\n\t\t\t\t\t\tword = null;\n\t\t\t\t\t}\n\t\t\t\t\tconst highlightReason = codePointHighlighter.shouldHighlightNonBasicASCII(str, word ? word.word : null);\n\n\t\t\t\t\tif (highlightReason !== SimpleHighlightReason.None) {\n\t\t\t\t\t\tif (highlightReason === SimpleHighlightReason.Ambiguous) {\n\t\t\t\t\t\t\tambiguousCharacterCount++;\n\t\t\t\t\t\t} else if (highlightReason === SimpleHighlightReason.Invisible) {\n\t\t\t\t\t\t\tinvisibleCharacterCount++;\n\t\t\t\t\t\t} else if (highlightReason === SimpleHighlightReason.NonBasicASCII) {\n\t\t\t\t\t\t\tnonBasicAsciiCharacterCount++;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tassertNever(highlightReason);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tconst MAX_RESULT_LENGTH = 1000;\n\t\t\t\t\t\tif (ranges.length >= MAX_RESULT_LENGTH) {\n\t\t\t\t\t\t\thasMore = true;\n\t\t\t\t\t\t\tbreak forLoop;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tranges.push(new Range(lineNumber, startIndex + 1, lineNumber, endIndex + 1));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} while (m);\n\t\t}\n\t\treturn {\n\t\t\tranges,\n\t\t\thasMore,\n\t\t\tambiguousCharacterCount,\n\t\t\tinvisibleCharacterCount,\n\t\t\tnonBasicAsciiCharacterCount\n\t\t};\n\t}\n\n\tpublic static computeUnicodeHighlightReason(char: string, options: UnicodeHighlighterOptions): UnicodeHighlighterReason | null {\n\t\tconst codePointHighlighter = new CodePointHighlighter(options);\n\n\t\tconst reason = codePointHighlighter.shouldHighlightNonBasicASCII(char, null);\n\t\tswitch (reason) {\n\t\t\tcase SimpleHighlightReason.None:\n\t\t\t\treturn null;\n\t\t\tcase SimpleHighlightReason.Invisible:\n\t\t\t\treturn { kind: UnicodeHighlighterReasonKind.Invisible };\n\n\t\t\tcase SimpleHighlightReason.Ambiguous: {\n\t\t\t\tconst codePoint = char.codePointAt(0)!;\n\t\t\t\tconst primaryConfusable = codePointHighlighter.ambiguousCharacters.getPrimaryConfusable(codePoint)!;\n\t\t\t\tconst notAmbiguousInLocales =\n\t\t\t\t\tstrings.AmbiguousCharacters.getLocales().filter(\n\t\t\t\t\t\t(l) =>\n\t\t\t\t\t\t\t!strings.AmbiguousCharacters.getInstance(\n\t\t\t\t\t\t\t\tnew Set([...options.allowedLocales, l])\n\t\t\t\t\t\t\t).isAmbiguous(codePoint)\n\t\t\t\t\t);\n\t\t\t\treturn { kind: UnicodeHighlighterReasonKind.Ambiguous, confusableWith: String.fromCodePoint(primaryConfusable), notAmbiguousInLocales };\n\t\t\t}\n\t\t\tcase SimpleHighlightReason.NonBasicASCII:\n\t\t\t\treturn { kind: UnicodeHighlighterReasonKind.NonBasicAscii };\n\t\t}\n\t}\n}\n\nfunction buildRegExpCharClassExpr(codePoints: number[], flags?: string): string {\n\tconst src = `[${strings.escapeRegExpCharacters(\n\t\tcodePoints.map((i) => String.fromCodePoint(i)).join('')\n\t)}]`;\n\treturn src;\n}\n\nexport const enum UnicodeHighlighterReasonKind {\n\tAmbiguous, Invisible, NonBasicAscii\n}\n\nexport type UnicodeHighlighterReason = {\n\tkind: UnicodeHighlighterReasonKind.Ambiguous;\n\tconfusableWith: string;\n\tnotAmbiguousInLocales: string[];\n} | {\n\tkind: UnicodeHighlighterReasonKind.Invisible;\n} | {\n\tkind: UnicodeHighlighterReasonKind.NonBasicAscii;\n};\n\nclass CodePointHighlighter {\n\tprivate readonly allowedCodePoints: Set<number>;\n\tpublic readonly ambiguousCharacters: strings.AmbiguousCharacters;\n\tconstructor(private readonly options: UnicodeHighlighterOptions) {\n\t\tthis.allowedCodePoints = new Set(options.allowedCodePoints);\n\t\tthis.ambiguousCharacters = strings.AmbiguousCharacters.getInstance(new Set(options.allowedLocales));\n\t}\n\n\tpublic getCandidateCodePoints(): Set<number> | 'allNonBasicAscii' {\n\t\tif (this.options.nonBasicASCII) {\n\t\t\treturn 'allNonBasicAscii';\n\t\t}\n\n\t\tconst set = new Set<number>();\n\n\t\tif (this.options.invisibleCharacters) {\n\t\t\tfor (const cp of strings.InvisibleCharacters.codePoints) {\n\t\t\t\tif (!isAllowedInvisibleCharacter(String.fromCodePoint(cp))) {\n\t\t\t\t\tset.add(cp);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (this.options.ambiguousCharacters) {\n\t\t\tfor (const cp of this.ambiguousCharacters.getConfusableCodePoints()) {\n\t\t\t\tset.add(cp);\n\t\t\t}\n\t\t}\n\n\t\tfor (const cp of this.allowedCodePoints) {\n\t\t\tset.delete(cp);\n\t\t}\n\n\t\treturn set;\n\t}\n\n\tpublic shouldHighlightNonBasicASCII(character: string, wordContext: string | null): SimpleHighlightReason {\n\t\tconst codePoint = character.codePointAt(0)!;\n\n\t\tif (this.allowedCodePoints.has(codePoint)) {\n\t\t\treturn SimpleHighlightReason.None;\n\t\t}\n\n\t\tif (this.options.nonBasicASCII) {\n\t\t\treturn SimpleHighlightReason.NonBasicASCII;\n\t\t}\n\n\t\tlet hasBasicASCIICharacters = false;\n\t\tlet hasNonConfusableNonBasicAsciiCharacter = false;\n\t\tif (wordContext) {\n\t\t\tfor (const char of wordContext) {\n\t\t\t\tconst codePoint = char.codePointAt(0)!;\n\t\t\t\tconst isBasicASCII = strings.isBasicASCII(char);\n\t\t\t\thasBasicASCIICharacters = hasBasicASCIICharacters || isBasicASCII;\n\n\t\t\t\tif (\n\t\t\t\t\t!isBasicASCII &&\n\t\t\t\t\t!this.ambiguousCharacters.isAmbiguous(codePoint) &&\n\t\t\t\t\t!strings.InvisibleCharacters.isInvisibleCharacter(codePoint)\n\t\t\t\t) {\n\t\t\t\t\thasNonConfusableNonBasicAsciiCharacter = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (\n\t\t\t/* Don't allow mixing weird looking characters with ASCII */ !hasBasicASCIICharacters &&\n\t\t\t/* Is there an obviously weird looking character? */ hasNonConfusableNonBasicAsciiCharacter\n\t\t) {\n\t\t\treturn SimpleHighlightReason.None;\n\t\t}\n\n\t\tif (this.options.invisibleCharacters) {\n\t\t\t// TODO check for emojis\n\t\t\tif (!isAllowedInvisibleCharacter(character) && strings.InvisibleCharacters.isInvisibleCharacter(codePoint)) {\n\t\t\t\treturn SimpleHighlightReason.Invisible;\n\t\t\t}\n\t\t}\n\n\t\tif (this.options.ambiguousCharacters) {\n\t\t\tif (this.ambiguousCharacters.isAmbiguous(codePoint)) {\n\t\t\t\treturn SimpleHighlightReason.Ambiguous;\n\t\t\t}\n\t\t}\n\n\t\treturn SimpleHighlightReason.None;\n\t}\n}\n\nfunction isAllowedInvisibleCharacter(character: string): boolean {\n\treturn character === ' ' || character === '\\n' || character === '\\t';\n}\n\nconst enum SimpleHighlightReason {\n\tNone,\n\tNonBasicASCII,\n\tInvisible,\n\tAmbiguous\n}\n\nexport interface IUnicodeCharacterSearcherTarget {\n\tgetLineCount(): number;\n\tgetLineContent(lineNumber: number): string;\n}\n\nexport interface UnicodeHighlighterOptions {\n\tnonBasicASCII: boolean;\n\tambiguousCharacters: boolean;\n\tinvisibleCharacters: boolean;\n\tincludeComments: boolean;\n\tincludeStrings: boolean;\n\tallowedCodePoints: number[];\n\tallowedLocales: string[];\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n// THIS IS A GENERATED FILE. DO NOT EDIT DIRECTLY.\n\n\nexport enum AccessibilitySupport {\n\t/**\n\t * This should be the browser case where it is not known if a screen reader is attached or no.\n\t */\n\tUnknown = 0,\n\tDisabled = 1,\n\tEnabled = 2\n}\n\nexport enum CodeActionTriggerType {\n\tInvoke = 1,\n\tAuto = 2\n}\n\nexport enum CompletionItemInsertTextRule {\n\tNone = 0,\n\t/**\n\t * Adjust whitespace/indentation of multiline insert texts to\n\t * match the current line indentation.\n\t */\n\tKeepWhitespace = 1,\n\t/**\n\t * `insertText` is a snippet.\n\t */\n\tInsertAsSnippet = 4\n}\n\nexport enum CompletionItemKind {\n\tMethod = 0,\n\tFunction = 1,\n\tConstructor = 2,\n\tField = 3,\n\tVariable = 4,\n\tClass = 5,\n\tStruct = 6,\n\tInterface = 7,\n\tModule = 8,\n\tProperty = 9,\n\tEvent = 10,\n\tOperator = 11,\n\tUnit = 12,\n\tValue = 13,\n\tConstant = 14,\n\tEnum = 15,\n\tEnumMember = 16,\n\tKeyword = 17,\n\tText = 18,\n\tColor = 19,\n\tFile = 20,\n\tReference = 21,\n\tCustomcolor = 22,\n\tFolder = 23,\n\tTypeParameter = 24,\n\tUser = 25,\n\tIssue = 26,\n\tSnippet = 27\n}\n\nexport enum CompletionItemTag {\n\tDeprecated = 1\n}\n\n/**\n * How a suggest provider was triggered.\n */\nexport enum CompletionTriggerKind {\n\tInvoke = 0,\n\tTriggerCharacter = 1,\n\tTriggerForIncompleteCompletions = 2\n}\n\n/**\n * A positioning preference for rendering content widgets.\n */\nexport enum ContentWidgetPositionPreference {\n\t/**\n\t * Place the content widget exactly at a position\n\t */\n\tEXACT = 0,\n\t/**\n\t * Place the content widget above a position\n\t */\n\tABOVE = 1,\n\t/**\n\t * Place the content widget below a position\n\t */\n\tBELOW = 2\n}\n\n/**\n * Describes the reason the cursor has changed its position.\n */\nexport enum CursorChangeReason {\n\t/**\n\t * Unknown or not set.\n\t */\n\tNotSet = 0,\n\t/**\n\t * A `model.setValue()` was called.\n\t */\n\tContentFlush = 1,\n\t/**\n\t * The `model` has been changed outside of this cursor and the cursor recovers its position from associated markers.\n\t */\n\tRecoverFromMarkers = 2,\n\t/**\n\t * There was an explicit user gesture.\n\t */\n\tExplicit = 3,\n\t/**\n\t * There was a Paste.\n\t */\n\tPaste = 4,\n\t/**\n\t * There was an Undo.\n\t */\n\tUndo = 5,\n\t/**\n\t * There was a Redo.\n\t */\n\tRedo = 6\n}\n\n/**\n * The default end of line to use when instantiating models.\n */\nexport enum DefaultEndOfLine {\n\t/**\n\t * Use line feed (\\n) as the end of line character.\n\t */\n\tLF = 1,\n\t/**\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\n\t */\n\tCRLF = 2\n}\n\n/**\n * A document highlight kind.\n */\nexport enum DocumentHighlightKind {\n\t/**\n\t * A textual occurrence.\n\t */\n\tText = 0,\n\t/**\n\t * Read-access of a symbol, like reading a variable.\n\t */\n\tRead = 1,\n\t/**\n\t * Write-access of a symbol, like writing to a variable.\n\t */\n\tWrite = 2\n}\n\n/**\n * Configuration options for auto indentation in the editor\n */\nexport enum EditorAutoIndentStrategy {\n\tNone = 0,\n\tKeep = 1,\n\tBrackets = 2,\n\tAdvanced = 3,\n\tFull = 4\n}\n\nexport enum EditorOption {\n\tacceptSuggestionOnCommitCharacter = 0,\n\tacceptSuggestionOnEnter = 1,\n\taccessibilitySupport = 2,\n\taccessibilityPageSize = 3,\n\tariaLabel = 4,\n\tariaRequired = 5,\n\tautoClosingBrackets = 6,\n\tautoClosingComments = 7,\n\tscreenReaderAnnounceInlineSuggestion = 8,\n\tautoClosingDelete = 9,\n\tautoClosingOvertype = 10,\n\tautoClosingQuotes = 11,\n\tautoIndent = 12,\n\tautomaticLayout = 13,\n\tautoSurround = 14,\n\tbracketPairColorization = 15,\n\tguides = 16,\n\tcodeLens = 17,\n\tcodeLensFontFamily = 18,\n\tcodeLensFontSize = 19,\n\tcolorDecorators = 20,\n\tcolorDecoratorsLimit = 21,\n\tcolumnSelection = 22,\n\tcomments = 23,\n\tcontextmenu = 24,\n\tcopyWithSyntaxHighlighting = 25,\n\tcursorBlinking = 26,\n\tcursorSmoothCaretAnimation = 27,\n\tcursorStyle = 28,\n\tcursorSurroundingLines = 29,\n\tcursorSurroundingLinesStyle = 30,\n\tcursorWidth = 31,\n\tdisableLayerHinting = 32,\n\tdisableMonospaceOptimizations = 33,\n\tdomReadOnly = 34,\n\tdragAndDrop = 35,\n\tdropIntoEditor = 36,\n\temptySelectionClipboard = 37,\n\texperimentalWhitespaceRendering = 38,\n\textraEditorClassName = 39,\n\tfastScrollSensitivity = 40,\n\tfind = 41,\n\tfixedOverflowWidgets = 42,\n\tfolding = 43,\n\tfoldingStrategy = 44,\n\tfoldingHighlight = 45,\n\tfoldingImportsByDefault = 46,\n\tfoldingMaximumRegions = 47,\n\tunfoldOnClickAfterEndOfLine = 48,\n\tfontFamily = 49,\n\tfontInfo = 50,\n\tfontLigatures = 51,\n\tfontSize = 52,\n\tfontWeight = 53,\n\tfontVariations = 54,\n\tformatOnPaste = 55,\n\tformatOnType = 56,\n\tglyphMargin = 57,\n\tgotoLocation = 58,\n\thideCursorInOverviewRuler = 59,\n\thover = 60,\n\tinDiffEditor = 61,\n\tinlineSuggest = 62,\n\tinlineEdit = 63,\n\tletterSpacing = 64,\n\tlightbulb = 65,\n\tlineDecorationsWidth = 66,\n\tlineHeight = 67,\n\tlineNumbers = 68,\n\tlineNumbersMinChars = 69,\n\tlinkedEditing = 70,\n\tlinks = 71,\n\tmatchBrackets = 72,\n\tminimap = 73,\n\tmouseStyle = 74,\n\tmouseWheelScrollSensitivity = 75,\n\tmouseWheelZoom = 76,\n\tmultiCursorMergeOverlapping = 77,\n\tmultiCursorModifier = 78,\n\tmultiCursorPaste = 79,\n\tmultiCursorLimit = 80,\n\toccurrencesHighlight = 81,\n\toverviewRulerBorder = 82,\n\toverviewRulerLanes = 83,\n\tpadding = 84,\n\tpasteAs = 85,\n\tparameterHints = 86,\n\tpeekWidgetDefaultFocus = 87,\n\tplaceholder = 88,\n\tdefinitionLinkOpensInPeek = 89,\n\tquickSuggestions = 90,\n\tquickSuggestionsDelay = 91,\n\treadOnly = 92,\n\treadOnlyMessage = 93,\n\trenameOnType = 94,\n\trenderControlCharacters = 95,\n\trenderFinalNewline = 96,\n\trenderLineHighlight = 97,\n\trenderLineHighlightOnlyWhenFocus = 98,\n\trenderValidationDecorations = 99,\n\trenderWhitespace = 100,\n\trevealHorizontalRightPadding = 101,\n\troundedSelection = 102,\n\trulers = 103,\n\tscrollbar = 104,\n\tscrollBeyondLastColumn = 105,\n\tscrollBeyondLastLine = 106,\n\tscrollPredominantAxis = 107,\n\tselectionClipboard = 108,\n\tselectionHighlight = 109,\n\tselectOnLineNumbers = 110,\n\tshowFoldingControls = 111,\n\tshowUnused = 112,\n\tsnippetSuggestions = 113,\n\tsmartSelect = 114,\n\tsmoothScrolling = 115,\n\tstickyScroll = 116,\n\tstickyTabStops = 117,\n\tstopRenderingLineAfter = 118,\n\tsuggest = 119,\n\tsuggestFontSize = 120,\n\tsuggestLineHeight = 121,\n\tsuggestOnTriggerCharacters = 122,\n\tsuggestSelection = 123,\n\ttabCompletion = 124,\n\ttabIndex = 125,\n\tunicodeHighlighting = 126,\n\tunusualLineTerminators = 127,\n\tuseShadowDOM = 128,\n\tuseTabStops = 129,\n\twordBreak = 130,\n\twordSegmenterLocales = 131,\n\twordSeparators = 132,\n\twordWrap = 133,\n\twordWrapBreakAfterCharacters = 134,\n\twordWrapBreakBeforeCharacters = 135,\n\twordWrapColumn = 136,\n\twordWrapOverride1 = 137,\n\twordWrapOverride2 = 138,\n\twrappingIndent = 139,\n\twrappingStrategy = 140,\n\tshowDeprecated = 141,\n\tinlayHints = 142,\n\teditorClassName = 143,\n\tpixelRatio = 144,\n\ttabFocusMode = 145,\n\tlayoutInfo = 146,\n\twrappingInfo = 147,\n\tdefaultColorDecorators = 148,\n\tcolorDecoratorsActivatedOn = 149,\n\tinlineCompletionsAccessibilityVerbose = 150\n}\n\n/**\n * End of line character preference.\n */\nexport enum EndOfLinePreference {\n\t/**\n\t * Use the end of line character identified in the text buffer.\n\t */\n\tTextDefined = 0,\n\t/**\n\t * Use line feed (\\n) as the end of line character.\n\t */\n\tLF = 1,\n\t/**\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\n\t */\n\tCRLF = 2\n}\n\n/**\n * End of line character preference.\n */\nexport enum EndOfLineSequence {\n\t/**\n\t * Use line feed (\\n) as the end of line character.\n\t */\n\tLF = 0,\n\t/**\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\n\t */\n\tCRLF = 1\n}\n\n/**\n * Vertical Lane in the glyph margin of the editor.\n */\nexport enum GlyphMarginLane {\n\tLeft = 1,\n\tCenter = 2,\n\tRight = 3\n}\n\nexport enum HoverVerbosityAction {\n\t/**\n\t * Increase the verbosity of the hover\n\t */\n\tIncrease = 0,\n\t/**\n\t * Decrease the verbosity of the hover\n\t */\n\tDecrease = 1\n}\n\n/**\n * Describes what to do with the indentation when pressing Enter.\n */\nexport enum IndentAction {\n\t/**\n\t * Insert new line and copy the previous line's indentation.\n\t */\n\tNone = 0,\n\t/**\n\t * Insert new line and indent once (relative to the previous line's indentation).\n\t */\n\tIndent = 1,\n\t/**\n\t * Insert two new lines:\n\t *  - the first one indented which will hold the cursor\n\t *  - the second one at the same indentation level\n\t */\n\tIndentOutdent = 2,\n\t/**\n\t * Insert new line and outdent once (relative to the previous line's indentation).\n\t */\n\tOutdent = 3\n}\n\nexport enum InjectedTextCursorStops {\n\tBoth = 0,\n\tRight = 1,\n\tLeft = 2,\n\tNone = 3\n}\n\nexport enum InlayHintKind {\n\tType = 1,\n\tParameter = 2\n}\n\n/**\n * How an {@link InlineCompletionsProvider inline completion provider} was triggered.\n */\nexport enum InlineCompletionTriggerKind {\n\t/**\n\t * Completion was triggered automatically while editing.\n\t * It is sufficient to return a single completion item in this case.\n\t */\n\tAutomatic = 0,\n\t/**\n\t * Completion was triggered explicitly by a user gesture.\n\t * Return multiple completion items to enable cycling through them.\n\t */\n\tExplicit = 1\n}\n\nexport enum InlineEditTriggerKind {\n\tInvoke = 0,\n\tAutomatic = 1\n}\n/**\n * Virtual Key Codes, the value does not hold any inherent meaning.\n * Inspired somewhat from https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx\n * But these are \"more general\", as they should work across browsers & OS`s.\n */\nexport enum KeyCode {\n\tDependsOnKbLayout = -1,\n\t/**\n\t * Placed first to cover the 0 value of the enum.\n\t */\n\tUnknown = 0,\n\tBackspace = 1,\n\tTab = 2,\n\tEnter = 3,\n\tShift = 4,\n\tCtrl = 5,\n\tAlt = 6,\n\tPauseBreak = 7,\n\tCapsLock = 8,\n\tEscape = 9,\n\tSpace = 10,\n\tPageUp = 11,\n\tPageDown = 12,\n\tEnd = 13,\n\tHome = 14,\n\tLeftArrow = 15,\n\tUpArrow = 16,\n\tRightArrow = 17,\n\tDownArrow = 18,\n\tInsert = 19,\n\tDelete = 20,\n\tDigit0 = 21,\n\tDigit1 = 22,\n\tDigit2 = 23,\n\tDigit3 = 24,\n\tDigit4 = 25,\n\tDigit5 = 26,\n\tDigit6 = 27,\n\tDigit7 = 28,\n\tDigit8 = 29,\n\tDigit9 = 30,\n\tKeyA = 31,\n\tKeyB = 32,\n\tKeyC = 33,\n\tKeyD = 34,\n\tKeyE = 35,\n\tKeyF = 36,\n\tKeyG = 37,\n\tKeyH = 38,\n\tKeyI = 39,\n\tKeyJ = 40,\n\tKeyK = 41,\n\tKeyL = 42,\n\tKeyM = 43,\n\tKeyN = 44,\n\tKeyO = 45,\n\tKeyP = 46,\n\tKeyQ = 47,\n\tKeyR = 48,\n\tKeyS = 49,\n\tKeyT = 50,\n\tKeyU = 51,\n\tKeyV = 52,\n\tKeyW = 53,\n\tKeyX = 54,\n\tKeyY = 55,\n\tKeyZ = 56,\n\tMeta = 57,\n\tContextMenu = 58,\n\tF1 = 59,\n\tF2 = 60,\n\tF3 = 61,\n\tF4 = 62,\n\tF5 = 63,\n\tF6 = 64,\n\tF7 = 65,\n\tF8 = 66,\n\tF9 = 67,\n\tF10 = 68,\n\tF11 = 69,\n\tF12 = 70,\n\tF13 = 71,\n\tF14 = 72,\n\tF15 = 73,\n\tF16 = 74,\n\tF17 = 75,\n\tF18 = 76,\n\tF19 = 77,\n\tF20 = 78,\n\tF21 = 79,\n\tF22 = 80,\n\tF23 = 81,\n\tF24 = 82,\n\tNumLock = 83,\n\tScrollLock = 84,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the ';:' key\n\t */\n\tSemicolon = 85,\n\t/**\n\t * For any country/region, the '+' key\n\t * For the US standard keyboard, the '=+' key\n\t */\n\tEqual = 86,\n\t/**\n\t * For any country/region, the ',' key\n\t * For the US standard keyboard, the ',<' key\n\t */\n\tComma = 87,\n\t/**\n\t * For any country/region, the '-' key\n\t * For the US standard keyboard, the '-_' key\n\t */\n\tMinus = 88,\n\t/**\n\t * For any country/region, the '.' key\n\t * For the US standard keyboard, the '.>' key\n\t */\n\tPeriod = 89,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the '/?' key\n\t */\n\tSlash = 90,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the '`~' key\n\t */\n\tBackquote = 91,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the '[{' key\n\t */\n\tBracketLeft = 92,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the '\\|' key\n\t */\n\tBackslash = 93,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the ']}' key\n\t */\n\tBracketRight = 94,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t * For the US standard keyboard, the ''\"' key\n\t */\n\tQuote = 95,\n\t/**\n\t * Used for miscellaneous characters; it can vary by keyboard.\n\t */\n\tOEM_8 = 96,\n\t/**\n\t * Either the angle bracket key or the backslash key on the RT 102-key keyboard.\n\t */\n\tIntlBackslash = 97,\n\tNumpad0 = 98,// VK_NUMPAD0, 0x60, Numeric keypad 0 key\n\tNumpad1 = 99,// VK_NUMPAD1, 0x61, Numeric keypad 1 key\n\tNumpad2 = 100,// VK_NUMPAD2, 0x62, Numeric keypad 2 key\n\tNumpad3 = 101,// VK_NUMPAD3, 0x63, Numeric keypad 3 key\n\tNumpad4 = 102,// VK_NUMPAD4, 0x64, Numeric keypad 4 key\n\tNumpad5 = 103,// VK_NUMPAD5, 0x65, Numeric keypad 5 key\n\tNumpad6 = 104,// VK_NUMPAD6, 0x66, Numeric keypad 6 key\n\tNumpad7 = 105,// VK_NUMPAD7, 0x67, Numeric keypad 7 key\n\tNumpad8 = 106,// VK_NUMPAD8, 0x68, Numeric keypad 8 key\n\tNumpad9 = 107,// VK_NUMPAD9, 0x69, Numeric keypad 9 key\n\tNumpadMultiply = 108,// VK_MULTIPLY, 0x6A, Multiply key\n\tNumpadAdd = 109,// VK_ADD, 0x6B, Add key\n\tNUMPAD_SEPARATOR = 110,// VK_SEPARATOR, 0x6C, Separator key\n\tNumpadSubtract = 111,// VK_SUBTRACT, 0x6D, Subtract key\n\tNumpadDecimal = 112,// VK_DECIMAL, 0x6E, Decimal key\n\tNumpadDivide = 113,// VK_DIVIDE, 0x6F,\n\t/**\n\t * Cover all key codes when IME is processing input.\n\t */\n\tKEY_IN_COMPOSITION = 114,\n\tABNT_C1 = 115,// Brazilian (ABNT) Keyboard\n\tABNT_C2 = 116,// Brazilian (ABNT) Keyboard\n\tAudioVolumeMute = 117,\n\tAudioVolumeUp = 118,\n\tAudioVolumeDown = 119,\n\tBrowserSearch = 120,\n\tBrowserHome = 121,\n\tBrowserBack = 122,\n\tBrowserForward = 123,\n\tMediaTrackNext = 124,\n\tMediaTrackPrevious = 125,\n\tMediaStop = 126,\n\tMediaPlayPause = 127,\n\tLaunchMediaPlayer = 128,\n\tLaunchMail = 129,\n\tLaunchApp2 = 130,\n\t/**\n\t * VK_CLEAR, 0x0C, CLEAR key\n\t */\n\tClear = 131,\n\t/**\n\t * Placed last to cover the length of the enum.\n\t * Please do not depend on this value!\n\t */\n\tMAX_VALUE = 132\n}\n\nexport enum MarkerSeverity {\n\tHint = 1,\n\tInfo = 2,\n\tWarning = 4,\n\tError = 8\n}\n\nexport enum MarkerTag {\n\tUnnecessary = 1,\n\tDeprecated = 2\n}\n\n/**\n * Position in the minimap to render the decoration.\n */\nexport enum MinimapPosition {\n\tInline = 1,\n\tGutter = 2\n}\n\n/**\n * Section header style.\n */\nexport enum MinimapSectionHeaderStyle {\n\tNormal = 1,\n\tUnderlined = 2\n}\n\n/**\n * Type of hit element with the mouse in the editor.\n */\nexport enum MouseTargetType {\n\t/**\n\t * Mouse is on top of an unknown element.\n\t */\n\tUNKNOWN = 0,\n\t/**\n\t * Mouse is on top of the textarea used for input.\n\t */\n\tTEXTAREA = 1,\n\t/**\n\t * Mouse is on top of the glyph margin\n\t */\n\tGUTTER_GLYPH_MARGIN = 2,\n\t/**\n\t * Mouse is on top of the line numbers\n\t */\n\tGUTTER_LINE_NUMBERS = 3,\n\t/**\n\t * Mouse is on top of the line decorations\n\t */\n\tGUTTER_LINE_DECORATIONS = 4,\n\t/**\n\t * Mouse is on top of the whitespace left in the gutter by a view zone.\n\t */\n\tGUTTER_VIEW_ZONE = 5,\n\t/**\n\t * Mouse is on top of text in the content.\n\t */\n\tCONTENT_TEXT = 6,\n\t/**\n\t * Mouse is on top of empty space in the content (e.g. after line text or below last line)\n\t */\n\tCONTENT_EMPTY = 7,\n\t/**\n\t * Mouse is on top of a view zone in the content.\n\t */\n\tCONTENT_VIEW_ZONE = 8,\n\t/**\n\t * Mouse is on top of a content widget.\n\t */\n\tCONTENT_WIDGET = 9,\n\t/**\n\t * Mouse is on top of the decorations overview ruler.\n\t */\n\tOVERVIEW_RULER = 10,\n\t/**\n\t * Mouse is on top of a scrollbar.\n\t */\n\tSCROLLBAR = 11,\n\t/**\n\t * Mouse is on top of an overlay widget.\n\t */\n\tOVERLAY_WIDGET = 12,\n\t/**\n\t * Mouse is outside of the editor.\n\t */\n\tOUTSIDE_EDITOR = 13\n}\n\nexport enum NewSymbolNameTag {\n\tAIGenerated = 1\n}\n\nexport enum NewSymbolNameTriggerKind {\n\tInvoke = 0,\n\tAutomatic = 1\n}\n\n/**\n * A positioning preference for rendering overlay widgets.\n */\nexport enum OverlayWidgetPositionPreference {\n\t/**\n\t * Position the overlay widget in the top right corner\n\t */\n\tTOP_RIGHT_CORNER = 0,\n\t/**\n\t * Position the overlay widget in the bottom right corner\n\t */\n\tBOTTOM_RIGHT_CORNER = 1,\n\t/**\n\t * Position the overlay widget in the top center\n\t */\n\tTOP_CENTER = 2\n}\n\n/**\n * Vertical Lane in the overview ruler of the editor.\n */\nexport enum OverviewRulerLane {\n\tLeft = 1,\n\tCenter = 2,\n\tRight = 4,\n\tFull = 7\n}\n\n/**\n * How a partial acceptance was triggered.\n */\nexport enum PartialAcceptTriggerKind {\n\tWord = 0,\n\tLine = 1,\n\tSuggest = 2\n}\n\nexport enum PositionAffinity {\n\t/**\n\t * Prefers the left most position.\n\t*/\n\tLeft = 0,\n\t/**\n\t * Prefers the right most position.\n\t*/\n\tRight = 1,\n\t/**\n\t * No preference.\n\t*/\n\tNone = 2,\n\t/**\n\t * If the given position is on injected text, prefers the position left of it.\n\t*/\n\tLeftOfInjectedText = 3,\n\t/**\n\t * If the given position is on injected text, prefers the position right of it.\n\t*/\n\tRightOfInjectedText = 4\n}\n\nexport enum RenderLineNumbersType {\n\tOff = 0,\n\tOn = 1,\n\tRelative = 2,\n\tInterval = 3,\n\tCustom = 4\n}\n\nexport enum RenderMinimap {\n\tNone = 0,\n\tText = 1,\n\tBlocks = 2\n}\n\nexport enum ScrollType {\n\tSmooth = 0,\n\tImmediate = 1\n}\n\nexport enum ScrollbarVisibility {\n\tAuto = 1,\n\tHidden = 2,\n\tVisible = 3\n}\n\n/**\n * The direction of a selection.\n */\nexport enum SelectionDirection {\n\t/**\n\t * The selection starts above where it ends.\n\t */\n\tLTR = 0,\n\t/**\n\t * The selection starts below where it ends.\n\t */\n\tRTL = 1\n}\n\nexport enum ShowLightbulbIconMode {\n\tOff = 'off',\n\tOnCode = 'onCode',\n\tOn = 'on'\n}\n\nexport enum SignatureHelpTriggerKind {\n\tInvoke = 1,\n\tTriggerCharacter = 2,\n\tContentChange = 3\n}\n\n/**\n * A symbol kind.\n */\nexport enum SymbolKind {\n\tFile = 0,\n\tModule = 1,\n\tNamespace = 2,\n\tPackage = 3,\n\tClass = 4,\n\tMethod = 5,\n\tProperty = 6,\n\tField = 7,\n\tConstructor = 8,\n\tEnum = 9,\n\tInterface = 10,\n\tFunction = 11,\n\tVariable = 12,\n\tConstant = 13,\n\tString = 14,\n\tNumber = 15,\n\tBoolean = 16,\n\tArray = 17,\n\tObject = 18,\n\tKey = 19,\n\tNull = 20,\n\tEnumMember = 21,\n\tStruct = 22,\n\tEvent = 23,\n\tOperator = 24,\n\tTypeParameter = 25\n}\n\nexport enum SymbolTag {\n\tDeprecated = 1\n}\n\n/**\n * The kind of animation in which the editor's cursor should be rendered.\n */\nexport enum TextEditorCursorBlinkingStyle {\n\t/**\n\t * Hidden\n\t */\n\tHidden = 0,\n\t/**\n\t * Blinking\n\t */\n\tBlink = 1,\n\t/**\n\t * Blinking with smooth fading\n\t */\n\tSmooth = 2,\n\t/**\n\t * Blinking with prolonged filled state and smooth fading\n\t */\n\tPhase = 3,\n\t/**\n\t * Expand collapse animation on the y axis\n\t */\n\tExpand = 4,\n\t/**\n\t * No-Blinking\n\t */\n\tSolid = 5\n}\n\n/**\n * The style in which the editor's cursor should be rendered.\n */\nexport enum TextEditorCursorStyle {\n\t/**\n\t * As a vertical line (sitting between two characters).\n\t */\n\tLine = 1,\n\t/**\n\t * As a block (sitting on top of a character).\n\t */\n\tBlock = 2,\n\t/**\n\t * As a horizontal line (sitting under a character).\n\t */\n\tUnderline = 3,\n\t/**\n\t * As a thin vertical line (sitting between two characters).\n\t */\n\tLineThin = 4,\n\t/**\n\t * As an outlined block (sitting on top of a character).\n\t */\n\tBlockOutline = 5,\n\t/**\n\t * As a thin horizontal line (sitting under a character).\n\t */\n\tUnderlineThin = 6\n}\n\n/**\n * Describes the behavior of decorations when typing/editing near their edges.\n * Note: Please do not edit the values, as they very carefully match `DecorationRangeBehavior`\n */\nexport enum TrackedRangeStickiness {\n\tAlwaysGrowsWhenTypingAtEdges = 0,\n\tNeverGrowsWhenTypingAtEdges = 1,\n\tGrowsOnlyWhenTypingBefore = 2,\n\tGrowsOnlyWhenTypingAfter = 3\n}\n\n/**\n * Describes how to indent wrapped lines.\n */\nexport enum WrappingIndent {\n\t/**\n\t * No indentation => wrapped lines begin at column 1.\n\t */\n\tNone = 0,\n\t/**\n\t * Same => wrapped lines get the same indentation as the parent.\n\t */\n\tSame = 1,\n\t/**\n\t * Indent => wrapped lines get +1 indentation toward the parent.\n\t */\n\tIndent = 2,\n\t/**\n\t * DeepIndent => wrapped lines get +2 indentation toward the parent.\n\t */\n\tDeepIndent = 3\n}","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { Color } from 'vs/base/common/color';\nimport { Emitter, Event } from 'vs/base/common/event';\nimport { Disposable, IDisposable, toDisposable } from 'vs/base/common/lifecycle';\nimport { ITokenizationRegistry, ITokenizationSupportChangedEvent, ILazyTokenizationSupport } from 'vs/editor/common/languages';\nimport { ColorId } from 'vs/editor/common/encodedTokenAttributes';\n\nexport class TokenizationRegistry<TSupport> implements ITokenizationRegistry<TSupport> {\n\n\tprivate readonly _tokenizationSupports = new Map<string, TSupport>();\n\tprivate readonly _factories = new Map<string, TokenizationSupportFactoryData<TSupport>>();\n\n\tprivate readonly _onDidChange = new Emitter<ITokenizationSupportChangedEvent>();\n\tpublic readonly onDidChange: Event<ITokenizationSupportChangedEvent> = this._onDidChange.event;\n\n\tprivate _colorMap: Color[] | null;\n\n\tconstructor() {\n\t\tthis._colorMap = null;\n\t}\n\n\tpublic handleChange(languageIds: string[]): void {\n\t\tthis._onDidChange.fire({\n\t\t\tchangedLanguages: languageIds,\n\t\t\tchangedColorMap: false\n\t\t});\n\t}\n\n\tpublic register(languageId: string, support: TSupport): IDisposable {\n\t\tthis._tokenizationSupports.set(languageId, support);\n\t\tthis.handleChange([languageId]);\n\t\treturn toDisposable(() => {\n\t\t\tif (this._tokenizationSupports.get(languageId) !== support) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis._tokenizationSupports.delete(languageId);\n\t\t\tthis.handleChange([languageId]);\n\t\t});\n\t}\n\n\tpublic get(languageId: string): TSupport | null {\n\t\treturn this._tokenizationSupports.get(languageId) || null;\n\t}\n\n\tpublic registerFactory(languageId: string, factory: ILazyTokenizationSupport<TSupport>): IDisposable {\n\t\tthis._factories.get(languageId)?.dispose();\n\t\tconst myData = new TokenizationSupportFactoryData(this, languageId, factory);\n\t\tthis._factories.set(languageId, myData);\n\t\treturn toDisposable(() => {\n\t\t\tconst v = this._factories.get(languageId);\n\t\t\tif (!v || v !== myData) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis._factories.delete(languageId);\n\t\t\tv.dispose();\n\t\t});\n\t}\n\n\tpublic async getOrCreate(languageId: string): Promise<TSupport | null> {\n\t\t// check first if the support is already set\n\t\tconst tokenizationSupport = this.get(languageId);\n\t\tif (tokenizationSupport) {\n\t\t\treturn tokenizationSupport;\n\t\t}\n\n\t\tconst factory = this._factories.get(languageId);\n\t\tif (!factory || factory.isResolved) {\n\t\t\t// no factory or factory.resolve already finished\n\t\t\treturn null;\n\t\t}\n\n\t\tawait factory.resolve();\n\n\t\treturn this.get(languageId);\n\t}\n\n\tpublic isResolved(languageId: string): boolean {\n\t\tconst tokenizationSupport = this.get(languageId);\n\t\tif (tokenizationSupport) {\n\t\t\treturn true;\n\t\t}\n\n\t\tconst factory = this._factories.get(languageId);\n\t\tif (!factory || factory.isResolved) {\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tpublic setColorMap(colorMap: Color[]): void {\n\t\tthis._colorMap = colorMap;\n\t\tthis._onDidChange.fire({\n\t\t\tchangedLanguages: Array.from(this._tokenizationSupports.keys()),\n\t\t\tchangedColorMap: true\n\t\t});\n\t}\n\n\tpublic getColorMap(): Color[] | null {\n\t\treturn this._colorMap;\n\t}\n\n\tpublic getDefaultBackground(): Color | null {\n\t\tif (this._colorMap && this._colorMap.length > ColorId.DefaultBackground) {\n\t\t\treturn this._colorMap[ColorId.DefaultBackground];\n\t\t}\n\t\treturn null;\n\t}\n}\n\nclass TokenizationSupportFactoryData<TSupport> extends Disposable {\n\n\tprivate _isDisposed: boolean = false;\n\tprivate _resolvePromise: Promise<void> | null = null;\n\tprivate _isResolved: boolean = false;\n\n\tpublic get isResolved(): boolean {\n\t\treturn this._isResolved;\n\t}\n\n\tconstructor(\n\t\tprivate readonly _registry: TokenizationRegistry<TSupport>,\n\t\tprivate readonly _languageId: string,\n\t\tprivate readonly _factory: ILazyTokenizationSupport<TSupport>,\n\t) {\n\t\tsuper();\n\t}\n\n\tpublic override dispose(): void {\n\t\tthis._isDisposed = true;\n\t\tsuper.dispose();\n\t}\n\n\tpublic async resolve(): Promise<void> {\n\t\tif (!this._resolvePromise) {\n\t\t\tthis._resolvePromise = this._create();\n\t\t}\n\t\treturn this._resolvePromise;\n\t}\n\n\tprivate async _create(): Promise<void> {\n\t\tconst value = await this._factory.tokenizationSupport;\n\t\tthis._isResolved = true;\n\t\tif (value && !this._isDisposed) {\n\t\t\tthis._register(this._registry.register(this._languageId, value));\n\t\t}\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n/*\n * This module exists so that the AMD build of the monaco editor can replace this with an async loader plugin.\n * If you add new functions to this module make sure that they are also provided in the AMD build of the monaco editor.\n */\n\nexport function getNLSMessages(): string[] {\n\treturn globalThis._VSCODE_NLS_MESSAGES;\n}\n\nexport function getNLSLanguage(): string | undefined {\n\treturn globalThis._VSCODE_NLS_LANGUAGE;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n// eslint-disable-next-line local/code-import-patterns\nimport { getNLSLanguage, getNLSMessages } from 'vs/nls.messages';\n// eslint-disable-next-line local/code-import-patterns\nexport { getNLSLanguage, getNLSMessages } from 'vs/nls.messages';\n\nconst isPseudo = getNLSLanguage() === 'pseudo' || (typeof document !== 'undefined' && document.location && document.location.hash.indexOf('pseudo=true') >= 0);\n\nexport interface ILocalizeInfo {\n\tkey: string;\n\tcomment: string[];\n}\n\nexport interface ILocalizedString {\n\toriginal: string;\n\tvalue: string;\n}\n\nfunction _format(message: string, args: (string | number | boolean | undefined | null)[]): string {\n\tlet result: string;\n\n\tif (args.length === 0) {\n\t\tresult = message;\n\t} else {\n\t\tresult = message.replace(/\\{(\\d+)\\}/g, (match, rest) => {\n\t\t\tconst index = rest[0];\n\t\t\tconst arg = args[index];\n\t\t\tlet result = match;\n\t\t\tif (typeof arg === 'string') {\n\t\t\t\tresult = arg;\n\t\t\t} else if (typeof arg === 'number' || typeof arg === 'boolean' || arg === void 0 || arg === null) {\n\t\t\t\tresult = String(arg);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\n\tif (isPseudo) {\n\t\t// FF3B and FF3D is the Unicode zenkaku representation for [ and ]\n\t\tresult = '\\uFF3B' + result.replace(/[aouei]/g, '$&$&') + '\\uFF3D';\n\t}\n\n\treturn result;\n}\n\n/**\n * Marks a string to be localized. Returns the localized string.\n *\n * @param info The {@linkcode ILocalizeInfo} which describes the id and comments associated with the localized string.\n * @param message The string to localize\n * @param args The arguments to the string\n *\n * @note `message` can contain `{n}` notation where it is replaced by the nth value in `...args`\n * @example `localize({ key: 'sayHello', comment: ['Welcomes user'] }, 'hello {0}', name)`\n *\n * @returns string The localized string.\n */\nexport function localize(info: ILocalizeInfo, message: string, ...args: (string | number | boolean | undefined | null)[]): string;\n\n/**\n * Marks a string to be localized. Returns the localized string.\n *\n * @param key The key to use for localizing the string\n * @param message The string to localize\n * @param args The arguments to the string\n *\n * @note `message` can contain `{n}` notation where it is replaced by the nth value in `...args`\n * @example For example, `localize('sayHello', 'hello {0}', name)`\n *\n * @returns string The localized string.\n */\nexport function localize(key: string, message: string, ...args: (string | number | boolean | undefined | null)[]): string;\n\n/**\n * @skipMangle\n */\nexport function localize(data: ILocalizeInfo | string /* | number when built */, message: string /* | null when built */, ...args: (string | number | boolean | undefined | null)[]): string {\n\tif (typeof data === 'number') {\n\t\treturn _format(lookupMessage(data, message), args);\n\t}\n\treturn _format(message, args);\n}\n\n/**\n * Only used when built: Looks up the message in the global NLS table.\n * This table is being made available as a global through bootstrapping\n * depending on the target context.\n */\nfunction lookupMessage(index: number, fallback: string | null): string {\n\tconst message = getNLSMessages()?.[index];\n\tif (typeof message !== 'string') {\n\t\tif (typeof fallback === 'string') {\n\t\t\treturn fallback;\n\t\t}\n\t\tthrow new Error(`!!! NLS MISSING: ${index} !!!`);\n\t}\n\treturn message;\n}\n\n/**\n * Marks a string to be localized. Returns an {@linkcode ILocalizedString}\n * which contains the localized string and the original string.\n *\n * @param info The {@linkcode ILocalizeInfo} which describes the id and comments associated with the localized string.\n * @param message The string to localize\n * @param args The arguments to the string\n *\n * @note `message` can contain `{n}` notation where it is replaced by the nth value in `...args`\n * @example `localize2({ key: 'sayHello', comment: ['Welcomes user'] }, 'hello {0}', name)`\n *\n * @returns ILocalizedString which contains the localized string and the original string.\n */\nexport function localize2(info: ILocalizeInfo, message: string, ...args: (string | number | boolean | undefined | null)[]): ILocalizedString;\n\n/**\n * Marks a string to be localized. Returns an {@linkcode ILocalizedString}\n * which contains the localized string and the original string.\n *\n * @param key The key to use for localizing the string\n * @param message The string to localize\n * @param args The arguments to the string\n *\n * @note `message` can contain `{n}` notation where it is replaced by the nth value in `...args`\n * @example `localize('sayHello', 'hello {0}', name)`\n *\n * @returns ILocalizedString which contains the localized string and the original string.\n */\nexport function localize2(key: string, message: string, ...args: (string | number | boolean | undefined | null)[]): ILocalizedString;\n\n/**\n * @skipMangle\n */\nexport function localize2(data: ILocalizeInfo | string /* | number when built */, originalMessage: string, ...args: (string | number | boolean | undefined | null)[]): ILocalizedString {\n\tlet message: string;\n\tif (typeof data === 'number') {\n\t\tmessage = lookupMessage(data, originalMessage);\n\t} else {\n\t\tmessage = originalMessage;\n\t}\n\n\tconst value = _format(message, args);\n\n\treturn {\n\t\tvalue,\n\t\toriginal: originalMessage === message ? value : _format(originalMessage, args)\n\t};\n}\n\nexport interface INLSLanguagePackConfiguration {\n\n\t/**\n\t * The path to the translations config file that contains pointers to\n\t * all message bundles for `main` and extensions.\n\t */\n\treadonly translationsConfigFile: string;\n}\n\nexport interface INLSConfiguration {\n\n\t/**\n\t * Locale as defined in `argv.json` or `app.getLocale()`.\n\t */\n\treadonly userLocale: string;\n\n\t/**\n\t * Locale as defined by the OS (e.g. `app.getPreferredSystemLanguages()`).\n\t */\n\treadonly osLocale: string;\n\n\t/**\n\t * The actual language of the UI that ends up being used considering `userLocale`\n\t * and `osLocale`.\n\t */\n\treadonly resolvedLanguage: string;\n\n\t/**\n\t * Defined if a language pack is used that is not the\n\t * default english language pack. This requires a language\n\t * pack to be installed as extension.\n\t */\n\treadonly languagePack?: INLSLanguagePackConfiguration;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport * as nls from 'vs/nls';\n\nexport const LANGUAGE_DEFAULT = 'en';\n\nlet _isWindows = false;\nlet _isMacintosh = false;\nlet _isLinux = false;\nlet _isLinuxSnap = false;\nlet _isNative = false;\nlet _isWeb = false;\nlet _isElectron = false;\nlet _isIOS = false;\nlet _isCI = false;\nlet _isMobile = false;\nlet _locale: string | undefined = undefined;\nlet _language: string = LANGUAGE_DEFAULT;\nlet _platformLocale: string = LANGUAGE_DEFAULT;\nlet _translationsConfigFile: string | undefined = undefined;\nlet _userAgent: string | undefined = undefined;\n\nexport interface IProcessEnvironment {\n\t[key: string]: string | undefined;\n}\n\n/**\n * This interface is intentionally not identical to node.js\n * process because it also works in sandboxed environments\n * where the process object is implemented differently. We\n * define the properties here that we need for `platform`\n * to work and nothing else.\n */\nexport interface INodeProcess {\n\tplatform: string;\n\tarch: string;\n\tenv: IProcessEnvironment;\n\tversions?: {\n\t\tnode?: string;\n\t\telectron?: string;\n\t\tchrome?: string;\n\t};\n\ttype?: string;\n\tcwd: () => string;\n}\n\ndeclare const process: INodeProcess;\n\nconst $globalThis: any = globalThis;\n\nlet nodeProcess: INodeProcess | undefined = undefined;\nif (typeof $globalThis.vscode !== 'undefined' && typeof $globalThis.vscode.process !== 'undefined') {\n\t// Native environment (sandboxed)\n\tnodeProcess = $globalThis.vscode.process;\n} else if (typeof process !== 'undefined' && typeof process?.versions?.node === 'string') {\n\t// Native environment (non-sandboxed)\n\tnodeProcess = process;\n}\n\nconst isElectronProcess = typeof nodeProcess?.versions?.electron === 'string';\nconst isElectronRenderer = isElectronProcess && nodeProcess?.type === 'renderer';\n\ninterface INavigator {\n\tuserAgent: string;\n\tmaxTouchPoints?: number;\n\tlanguage: string;\n}\ndeclare const navigator: INavigator;\n\n// Native environment\nif (typeof nodeProcess === 'object') {\n\t_isWindows = (nodeProcess.platform === 'win32');\n\t_isMacintosh = (nodeProcess.platform === 'darwin');\n\t_isLinux = (nodeProcess.platform === 'linux');\n\t_isLinuxSnap = _isLinux && !!nodeProcess.env['SNAP'] && !!nodeProcess.env['SNAP_REVISION'];\n\t_isElectron = isElectronProcess;\n\t_isCI = !!nodeProcess.env['CI'] || !!nodeProcess.env['BUILD_ARTIFACTSTAGINGDIRECTORY'];\n\t_locale = LANGUAGE_DEFAULT;\n\t_language = LANGUAGE_DEFAULT;\n\tconst rawNlsConfig = nodeProcess.env['VSCODE_NLS_CONFIG'];\n\tif (rawNlsConfig) {\n\t\ttry {\n\t\t\tconst nlsConfig: nls.INLSConfiguration = JSON.parse(rawNlsConfig);\n\t\t\t_locale = nlsConfig.userLocale;\n\t\t\t_platformLocale = nlsConfig.osLocale;\n\t\t\t_language = nlsConfig.resolvedLanguage || LANGUAGE_DEFAULT;\n\t\t\t_translationsConfigFile = nlsConfig.languagePack?.translationsConfigFile;\n\t\t} catch (e) {\n\t\t}\n\t}\n\t_isNative = true;\n}\n\n// Web environment\nelse if (typeof navigator === 'object' && !isElectronRenderer) {\n\t_userAgent = navigator.userAgent;\n\t_isWindows = _userAgent.indexOf('Windows') >= 0;\n\t_isMacintosh = _userAgent.indexOf('Macintosh') >= 0;\n\t_isIOS = (_userAgent.indexOf('Macintosh') >= 0 || _userAgent.indexOf('iPad') >= 0 || _userAgent.indexOf('iPhone') >= 0) && !!navigator.maxTouchPoints && navigator.maxTouchPoints > 0;\n\t_isLinux = _userAgent.indexOf('Linux') >= 0;\n\t_isMobile = _userAgent?.indexOf('Mobi') >= 0;\n\t_isWeb = true;\n\t_language = nls.getNLSLanguage() || LANGUAGE_DEFAULT;\n\t_locale = navigator.language.toLowerCase();\n\t_platformLocale = _locale;\n}\n\n// Unknown environment\nelse {\n\tconsole.error('Unable to resolve platform.');\n}\n\nexport const enum Platform {\n\tWeb,\n\tMac,\n\tLinux,\n\tWindows\n}\n\nlet _platform: Platform = Platform.Web;\nif (_isMacintosh) {\n\t_platform = Platform.Mac;\n} else if (_isWindows) {\n\t_platform = Platform.Windows;\n} else if (_isLinux) {\n\t_platform = Platform.Linux;\n}\n\nexport const isWindows = _isWindows;\nexport const isMacintosh = _isMacintosh;\nexport const isLinux = _isLinux;\nexport const isNative = _isNative;\nexport const isWeb = _isWeb;\nexport const isWebWorker = (_isWeb && typeof $globalThis.importScripts === 'function');\nexport const webWorkerOrigin = isWebWorker ? $globalThis.origin : undefined;\nexport const isIOS = _isIOS;\nexport const isMobile = _isMobile;\nexport const userAgent = _userAgent;\n\n/**\n * The language used for the user interface. The format of\n * the string is all lower case (e.g. zh-tw for Traditional\n * Chinese or de for German)\n */\nexport const language = _language;\n\nexport const setTimeout0IsFaster = (typeof $globalThis.postMessage === 'function' && !$globalThis.importScripts);\n\n/**\n * See https://html.spec.whatwg.org/multipage/timers-and-user-prompts.html#:~:text=than%204%2C%20then-,set%20timeout%20to%204,-.\n *\n * Works similarly to `setTimeout(0)` but doesn't suffer from the 4ms artificial delay\n * that browsers set when the nesting level is > 5.\n */\nexport const setTimeout0 = (() => {\n\tif (setTimeout0IsFaster) {\n\t\tinterface IQueueElement {\n\t\t\tid: number;\n\t\t\tcallback: () => void;\n\t\t}\n\t\tconst pending: IQueueElement[] = [];\n\n\t\t$globalThis.addEventListener('message', (e: any) => {\n\t\t\tif (e.data && e.data.vscodeScheduleAsyncWork) {\n\t\t\t\tfor (let i = 0, len = pending.length; i < len; i++) {\n\t\t\t\t\tconst candidate = pending[i];\n\t\t\t\t\tif (candidate.id === e.data.vscodeScheduleAsyncWork) {\n\t\t\t\t\t\tpending.splice(i, 1);\n\t\t\t\t\t\tcandidate.callback();\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\tlet lastId = 0;\n\t\treturn (callback: () => void) => {\n\t\t\tconst myId = ++lastId;\n\t\t\tpending.push({\n\t\t\t\tid: myId,\n\t\t\t\tcallback: callback\n\t\t\t});\n\t\t\t$globalThis.postMessage({ vscodeScheduleAsyncWork: myId }, '*');\n\t\t};\n\t}\n\treturn (callback: () => void) => setTimeout(callback);\n})();\n\nexport const enum OperatingSystem {\n\tWindows = 1,\n\tMacintosh = 2,\n\tLinux = 3\n}\nexport const OS = (_isMacintosh || _isIOS ? OperatingSystem.Macintosh : (_isWindows ? OperatingSystem.Windows : OperatingSystem.Linux));\n\nlet _isLittleEndian = true;\nlet _isLittleEndianComputed = false;\nexport function isLittleEndian(): boolean {\n\tif (!_isLittleEndianComputed) {\n\t\t_isLittleEndianComputed = true;\n\t\tconst test = new Uint8Array(2);\n\t\ttest[0] = 1;\n\t\ttest[1] = 2;\n\t\tconst view = new Uint16Array(test.buffer);\n\t\t_isLittleEndian = (view[0] === (2 << 8) + 1);\n\t}\n\treturn _isLittleEndian;\n}\n\nexport const isChrome = !!(userAgent && userAgent.indexOf('Chrome') >= 0);\nexport const isFirefox = !!(userAgent && userAgent.indexOf('Firefox') >= 0);\nexport const isSafari = !!(!isChrome && (userAgent && userAgent.indexOf('Safari') >= 0));\nexport const isEdge = !!(userAgent && userAgent.indexOf('Edg/') >= 0);\nexport const isAndroid = !!(userAgent && userAgent.indexOf('Android') >= 0);\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CancellationToken, CancellationTokenSource } from 'vs/base/common/cancellation';\nimport { BugIndicatingError, CancellationError } from 'vs/base/common/errors';\nimport { Emitter, Event } from 'vs/base/common/event';\nimport { DisposableStore, IDisposable, toDisposable } from 'vs/base/common/lifecycle';\nimport { setTimeout0 } from 'vs/base/common/platform';\nimport { MicrotaskDelay } from './symbols';\n\nexport function isThenable<T>(obj: unknown): obj is Promise<T> {\n\treturn !!obj && typeof (obj as unknown as Promise<T>).then === 'function';\n}\n\nexport interface CancelablePromise<T> extends Promise<T> {\n\tcancel(): void;\n}\n\nexport function createCancelablePromise<T>(callback: (token: CancellationToken) => Promise<T>): CancelablePromise<T> {\n\tconst source = new CancellationTokenSource();\n\n\tconst thenable = callback(source.token);\n\tconst promise = new Promise<T>((resolve, reject) => {\n\t\tconst subscription = source.token.onCancellationRequested(() => {\n\t\t\tsubscription.dispose();\n\t\t\treject(new CancellationError());\n\t\t});\n\t\tPromise.resolve(thenable).then(value => {\n\t\t\tsubscription.dispose();\n\t\t\tsource.dispose();\n\t\t\tresolve(value);\n\t\t}, err => {\n\t\t\tsubscription.dispose();\n\t\t\tsource.dispose();\n\t\t\treject(err);\n\t\t});\n\t});\n\n\treturn <CancelablePromise<T>>new class {\n\t\tcancel() {\n\t\t\tsource.cancel();\n\t\t\tsource.dispose();\n\t\t}\n\t\tthen<TResult1 = T, TResult2 = never>(resolve?: ((value: T) => TResult1 | Promise<TResult1>) | undefined | null, reject?: ((reason: any) => TResult2 | Promise<TResult2>) | undefined | null): Promise<TResult1 | TResult2> {\n\t\t\treturn promise.then(resolve, reject);\n\t\t}\n\t\tcatch<TResult = never>(reject?: ((reason: any) => TResult | Promise<TResult>) | undefined | null): Promise<T | TResult> {\n\t\t\treturn this.then(undefined, reject);\n\t\t}\n\t\tfinally(onfinally?: (() => void) | undefined | null): Promise<T> {\n\t\t\treturn promise.finally(onfinally);\n\t\t}\n\t};\n}\n\n/**\n * Returns a promise that resolves with `undefined` as soon as the passed token is cancelled.\n * @see {@link raceCancellationError}\n */\nexport function raceCancellation<T>(promise: Promise<T>, token: CancellationToken): Promise<T | undefined>;\n\n/**\n * Returns a promise that resolves with `defaultValue` as soon as the passed token is cancelled.\n * @see {@link raceCancellationError}\n */\nexport function raceCancellation<T>(promise: Promise<T>, token: CancellationToken, defaultValue: T): Promise<T>;\n\nexport function raceCancellation<T>(promise: Promise<T>, token: CancellationToken, defaultValue?: T): Promise<T | undefined> {\n\treturn new Promise((resolve, reject) => {\n\t\tconst ref = token.onCancellationRequested(() => {\n\t\t\tref.dispose();\n\t\t\tresolve(defaultValue);\n\t\t});\n\t\tpromise.then(resolve, reject).finally(() => ref.dispose());\n\t});\n}\n\nexport interface ITask<T> {\n\t(): T;\n}\n\n/**\n * A helper to prevent accumulation of sequential async tasks.\n *\n * Imagine a mail man with the sole task of delivering letters. As soon as\n * a letter submitted for delivery, he drives to the destination, delivers it\n * and returns to his base. Imagine that during the trip, N more letters were submitted.\n * When the mail man returns, he picks those N letters and delivers them all in a\n * single trip. Even though N+1 submissions occurred, only 2 deliveries were made.\n *\n * The throttler implements this via the queue() method, by providing it a task\n * factory. Following the example:\n *\n * \t\tconst throttler = new Throttler();\n * \t\tconst letters = [];\n *\n * \t\tfunction deliver() {\n * \t\t\tconst lettersToDeliver = letters;\n * \t\t\tletters = [];\n * \t\t\treturn makeTheTrip(lettersToDeliver);\n * \t\t}\n *\n * \t\tfunction onLetterReceived(l) {\n * \t\t\tletters.push(l);\n * \t\t\tthrottler.queue(deliver);\n * \t\t}\n */\nexport class Throttler implements IDisposable {\n\n\tprivate activePromise: Promise<any> | null;\n\tprivate queuedPromise: Promise<any> | null;\n\tprivate queuedPromiseFactory: ITask<Promise<any>> | null;\n\n\tprivate isDisposed = false;\n\n\tconstructor() {\n\t\tthis.activePromise = null;\n\t\tthis.queuedPromise = null;\n\t\tthis.queuedPromiseFactory = null;\n\t}\n\n\tqueue<T>(promiseFactory: ITask<Promise<T>>): Promise<T> {\n\t\tif (this.isDisposed) {\n\t\t\treturn Promise.reject(new Error('Throttler is disposed'));\n\t\t}\n\n\t\tif (this.activePromise) {\n\t\t\tthis.queuedPromiseFactory = promiseFactory;\n\n\t\t\tif (!this.queuedPromise) {\n\t\t\t\tconst onComplete = () => {\n\t\t\t\t\tthis.queuedPromise = null;\n\n\t\t\t\t\tif (this.isDisposed) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\tconst result = this.queue(this.queuedPromiseFactory!);\n\t\t\t\t\tthis.queuedPromiseFactory = null;\n\n\t\t\t\t\treturn result;\n\t\t\t\t};\n\n\t\t\t\tthis.queuedPromise = new Promise(resolve => {\n\t\t\t\t\tthis.activePromise!.then(onComplete, onComplete).then(resolve);\n\t\t\t\t});\n\t\t\t}\n\n\t\t\treturn new Promise((resolve, reject) => {\n\t\t\t\tthis.queuedPromise!.then(resolve, reject);\n\t\t\t});\n\t\t}\n\n\t\tthis.activePromise = promiseFactory();\n\n\t\treturn new Promise((resolve, reject) => {\n\t\t\tthis.activePromise!.then((result: T) => {\n\t\t\t\tthis.activePromise = null;\n\t\t\t\tresolve(result);\n\t\t\t}, (err: unknown) => {\n\t\t\t\tthis.activePromise = null;\n\t\t\t\treject(err);\n\t\t\t});\n\t\t});\n\t}\n\n\tdispose(): void {\n\t\tthis.isDisposed = true;\n\t}\n}\n\ninterface IScheduledLater extends IDisposable {\n\tisTriggered(): boolean;\n}\n\nconst timeoutDeferred = (timeout: number, fn: () => void): IScheduledLater => {\n\tlet scheduled = true;\n\tconst handle = setTimeout(() => {\n\t\tscheduled = false;\n\t\tfn();\n\t}, timeout);\n\treturn {\n\t\tisTriggered: () => scheduled,\n\t\tdispose: () => {\n\t\t\tclearTimeout(handle);\n\t\t\tscheduled = false;\n\t\t},\n\t};\n};\n\nconst microtaskDeferred = (fn: () => void): IScheduledLater => {\n\tlet scheduled = true;\n\tqueueMicrotask(() => {\n\t\tif (scheduled) {\n\t\t\tscheduled = false;\n\t\t\tfn();\n\t\t}\n\t});\n\n\treturn {\n\t\tisTriggered: () => scheduled,\n\t\tdispose: () => { scheduled = false; },\n\t};\n};\n\n/**\n * A helper to delay (debounce) execution of a task that is being requested often.\n *\n * Following the throttler, now imagine the mail man wants to optimize the number of\n * trips proactively. The trip itself can be long, so he decides not to make the trip\n * as soon as a letter is submitted. Instead he waits a while, in case more\n * letters are submitted. After said waiting period, if no letters were submitted, he\n * decides to make the trip. Imagine that N more letters were submitted after the first\n * one, all within a short period of time between each other. Even though N+1\n * submissions occurred, only 1 delivery was made.\n *\n * The delayer offers this behavior via the trigger() method, into which both the task\n * to be executed and the waiting period (delay) must be passed in as arguments. Following\n * the example:\n *\n * \t\tconst delayer = new Delayer(WAITING_PERIOD);\n * \t\tconst letters = [];\n *\n * \t\tfunction letterReceived(l) {\n * \t\t\tletters.push(l);\n * \t\t\tdelayer.trigger(() => { return makeTheTrip(); });\n * \t\t}\n */\nexport class Delayer<T> implements IDisposable {\n\n\tprivate deferred: IScheduledLater | null;\n\tprivate completionPromise: Promise<any> | null;\n\tprivate doResolve: ((value?: any | Promise<any>) => void) | null;\n\tprivate doReject: ((err: any) => void) | null;\n\tprivate task: ITask<T | Promise<T>> | null;\n\n\tconstructor(public defaultDelay: number | typeof MicrotaskDelay) {\n\t\tthis.deferred = null;\n\t\tthis.completionPromise = null;\n\t\tthis.doResolve = null;\n\t\tthis.doReject = null;\n\t\tthis.task = null;\n\t}\n\n\ttrigger(task: ITask<T | Promise<T>>, delay = this.defaultDelay): Promise<T> {\n\t\tthis.task = task;\n\t\tthis.cancelTimeout();\n\n\t\tif (!this.completionPromise) {\n\t\t\tthis.completionPromise = new Promise((resolve, reject) => {\n\t\t\t\tthis.doResolve = resolve;\n\t\t\t\tthis.doReject = reject;\n\t\t\t}).then(() => {\n\t\t\t\tthis.completionPromise = null;\n\t\t\t\tthis.doResolve = null;\n\t\t\t\tif (this.task) {\n\t\t\t\t\tconst task = this.task;\n\t\t\t\t\tthis.task = null;\n\t\t\t\t\treturn task();\n\t\t\t\t}\n\t\t\t\treturn undefined;\n\t\t\t});\n\t\t}\n\n\t\tconst fn = () => {\n\t\t\tthis.deferred = null;\n\t\t\tthis.doResolve?.(null);\n\t\t};\n\n\t\tthis.deferred = delay === MicrotaskDelay ? microtaskDeferred(fn) : timeoutDeferred(delay, fn);\n\n\t\treturn this.completionPromise;\n\t}\n\n\tisTriggered(): boolean {\n\t\treturn !!this.deferred?.isTriggered();\n\t}\n\n\tcancel(): void {\n\t\tthis.cancelTimeout();\n\n\t\tif (this.completionPromise) {\n\t\t\tthis.doReject?.(new CancellationError());\n\t\t\tthis.completionPromise = null;\n\t\t}\n\t}\n\n\tprivate cancelTimeout(): void {\n\t\tthis.deferred?.dispose();\n\t\tthis.deferred = null;\n\t}\n\n\tdispose(): void {\n\t\tthis.cancel();\n\t}\n}\n\n/**\n * A helper to delay execution of a task that is being requested often, while\n * preventing accumulation of consecutive executions, while the task runs.\n *\n * The mail man is clever and waits for a certain amount of time, before going\n * out to deliver letters. While the mail man is going out, more letters arrive\n * and can only be delivered once he is back. Once he is back the mail man will\n * do one more trip to deliver the letters that have accumulated while he was out.\n */\nexport class ThrottledDelayer<T> {\n\n\tprivate delayer: Delayer<Promise<T>>;\n\tprivate throttler: Throttler;\n\n\tconstructor(defaultDelay: number) {\n\t\tthis.delayer = new Delayer(defaultDelay);\n\t\tthis.throttler = new Throttler();\n\t}\n\n\ttrigger(promiseFactory: ITask<Promise<T>>, delay?: number): Promise<T> {\n\t\treturn this.delayer.trigger(() => this.throttler.queue(promiseFactory), delay) as unknown as Promise<T>;\n\t}\n\n\tcancel(): void {\n\t\tthis.delayer.cancel();\n\t}\n\n\tdispose(): void {\n\t\tthis.delayer.dispose();\n\t\tthis.throttler.dispose();\n\t}\n}\n\nexport function timeout(millis: number): CancelablePromise<void>;\nexport function timeout(millis: number, token: CancellationToken): Promise<void>;\nexport function timeout(millis: number, token?: CancellationToken): CancelablePromise<void> | Promise<void> {\n\tif (!token) {\n\t\treturn createCancelablePromise(token => timeout(millis, token));\n\t}\n\n\treturn new Promise((resolve, reject) => {\n\t\tconst handle = setTimeout(() => {\n\t\t\tdisposable.dispose();\n\t\t\tresolve();\n\t\t}, millis);\n\t\tconst disposable = token.onCancellationRequested(() => {\n\t\t\tclearTimeout(handle);\n\t\t\tdisposable.dispose();\n\t\t\treject(new CancellationError());\n\t\t});\n\t});\n}\n\n/**\n * Creates a timeout that can be disposed using its returned value.\n * @param handler The timeout handler.\n * @param timeout An optional timeout in milliseconds.\n * @param store An optional {@link DisposableStore} that will have the timeout disposable managed automatically.\n *\n * @example\n * const store = new DisposableStore;\n * // Call the timeout after 1000ms at which point it will be automatically\n * // evicted from the store.\n * const timeoutDisposable = disposableTimeout(() => {}, 1000, store);\n *\n * if (foo) {\n *   // Cancel the timeout and evict it from store.\n *   timeoutDisposable.dispose();\n * }\n */\nexport function disposableTimeout(handler: () => void, timeout = 0, store?: DisposableStore): IDisposable {\n\tconst timer = setTimeout(() => {\n\t\thandler();\n\t\tif (store) {\n\t\t\tdisposable.dispose();\n\t\t}\n\t}, timeout);\n\tconst disposable = toDisposable(() => {\n\t\tclearTimeout(timer);\n\t\tstore?.deleteAndLeak(disposable);\n\t});\n\tstore?.add(disposable);\n\treturn disposable;\n}\n\nexport function first<T>(promiseFactories: ITask<Promise<T>>[], shouldStop: (t: T) => boolean = t => !!t, defaultValue: T | null = null): Promise<T | null> {\n\tlet index = 0;\n\tconst len = promiseFactories.length;\n\n\tconst loop: () => Promise<T | null> = () => {\n\t\tif (index >= len) {\n\t\t\treturn Promise.resolve(defaultValue);\n\t\t}\n\n\t\tconst factory = promiseFactories[index++];\n\t\tconst promise = Promise.resolve(factory());\n\n\t\treturn promise.then(result => {\n\t\t\tif (shouldStop(result)) {\n\t\t\t\treturn Promise.resolve(result);\n\t\t\t}\n\n\t\t\treturn loop();\n\t\t});\n\t};\n\n\treturn loop();\n}\n\nexport class TimeoutTimer implements IDisposable {\n\tprivate _token: any;\n\tprivate _isDisposed = false;\n\n\tconstructor();\n\tconstructor(runner: () => void, timeout: number);\n\tconstructor(runner?: () => void, timeout?: number) {\n\t\tthis._token = -1;\n\n\t\tif (typeof runner === 'function' && typeof timeout === 'number') {\n\t\t\tthis.setIfNotSet(runner, timeout);\n\t\t}\n\t}\n\n\tdispose(): void {\n\t\tthis.cancel();\n\t\tthis._isDisposed = true;\n\t}\n\n\tcancel(): void {\n\t\tif (this._token !== -1) {\n\t\t\tclearTimeout(this._token);\n\t\t\tthis._token = -1;\n\t\t}\n\t}\n\n\tcancelAndSet(runner: () => void, timeout: number): void {\n\t\tif (this._isDisposed) {\n\t\t\tthrow new BugIndicatingError(`Calling 'cancelAndSet' on a disposed TimeoutTimer`);\n\t\t}\n\n\t\tthis.cancel();\n\t\tthis._token = setTimeout(() => {\n\t\t\tthis._token = -1;\n\t\t\trunner();\n\t\t}, timeout);\n\t}\n\n\tsetIfNotSet(runner: () => void, timeout: number): void {\n\t\tif (this._isDisposed) {\n\t\t\tthrow new BugIndicatingError(`Calling 'setIfNotSet' on a disposed TimeoutTimer`);\n\t\t}\n\n\t\tif (this._token !== -1) {\n\t\t\t// timer is already set\n\t\t\treturn;\n\t\t}\n\t\tthis._token = setTimeout(() => {\n\t\t\tthis._token = -1;\n\t\t\trunner();\n\t\t}, timeout);\n\t}\n}\n\nexport class IntervalTimer implements IDisposable {\n\n\tprivate disposable: IDisposable | undefined = undefined;\n\tprivate isDisposed = false;\n\n\tcancel(): void {\n\t\tthis.disposable?.dispose();\n\t\tthis.disposable = undefined;\n\t}\n\n\tcancelAndSet(runner: () => void, interval: number, context = globalThis): void {\n\t\tif (this.isDisposed) {\n\t\t\tthrow new BugIndicatingError(`Calling 'cancelAndSet' on a disposed IntervalTimer`);\n\t\t}\n\n\t\tthis.cancel();\n\t\tconst handle = context.setInterval(() => {\n\t\t\trunner();\n\t\t}, interval);\n\n\t\tthis.disposable = toDisposable(() => {\n\t\t\tcontext.clearInterval(handle);\n\t\t\tthis.disposable = undefined;\n\t\t});\n\t}\n\n\tdispose(): void {\n\t\tthis.cancel();\n\t\tthis.isDisposed = true;\n\t}\n}\n\nexport class RunOnceScheduler implements IDisposable {\n\n\tprotected runner: ((...args: unknown[]) => void) | null;\n\n\tprivate timeoutToken: any;\n\tprivate timeout: number;\n\tprivate timeoutHandler: () => void;\n\n\tconstructor(runner: (...args: any[]) => void, delay: number) {\n\t\tthis.timeoutToken = -1;\n\t\tthis.runner = runner;\n\t\tthis.timeout = delay;\n\t\tthis.timeoutHandler = this.onTimeout.bind(this);\n\t}\n\n\t/**\n\t * Dispose RunOnceScheduler\n\t */\n\tdispose(): void {\n\t\tthis.cancel();\n\t\tthis.runner = null;\n\t}\n\n\t/**\n\t * Cancel current scheduled runner (if any).\n\t */\n\tcancel(): void {\n\t\tif (this.isScheduled()) {\n\t\t\tclearTimeout(this.timeoutToken);\n\t\t\tthis.timeoutToken = -1;\n\t\t}\n\t}\n\n\t/**\n\t * Cancel previous runner (if any) & schedule a new runner.\n\t */\n\tschedule(delay = this.timeout): void {\n\t\tthis.cancel();\n\t\tthis.timeoutToken = setTimeout(this.timeoutHandler, delay);\n\t}\n\n\tget delay(): number {\n\t\treturn this.timeout;\n\t}\n\n\tset delay(value: number) {\n\t\tthis.timeout = value;\n\t}\n\n\t/**\n\t * Returns true if scheduled.\n\t */\n\tisScheduled(): boolean {\n\t\treturn this.timeoutToken !== -1;\n\t}\n\n\tprivate onTimeout() {\n\t\tthis.timeoutToken = -1;\n\t\tif (this.runner) {\n\t\t\tthis.doRun();\n\t\t}\n\t}\n\n\tprotected doRun(): void {\n\t\tthis.runner?.();\n\t}\n}\n\n//#region -- run on idle tricks ------------\n\nexport interface IdleDeadline {\n\treadonly didTimeout: boolean;\n\ttimeRemaining(): number;\n}\n\ntype IdleApi = Pick<typeof globalThis, 'requestIdleCallback' | 'cancelIdleCallback'>;\n\n\n/**\n * Execute the callback the next time the browser is idle, returning an\n * {@link IDisposable} that will cancel the callback when disposed. This wraps\n * [requestIdleCallback] so it will fallback to [setTimeout] if the environment\n * doesn't support it.\n *\n * @param callback The callback to run when idle, this includes an\n * [IdleDeadline] that provides the time alloted for the idle callback by the\n * browser. Not respecting this deadline will result in a degraded user\n * experience.\n * @param timeout A timeout at which point to queue no longer wait for an idle\n * callback but queue it on the regular event loop (like setTimeout). Typically\n * this should not be used.\n *\n * [IdleDeadline]: https://developer.mozilla.org/en-US/docs/Web/API/IdleDeadline\n * [requestIdleCallback]: https://developer.mozilla.org/en-US/docs/Web/API/Window/requestIdleCallback\n * [setTimeout]: https://developer.mozilla.org/en-US/docs/Web/API/Window/setTimeout\n *\n * **Note** that there is `dom.ts#runWhenWindowIdle` which is better suited when running inside a browser\n * context\n */\nexport let runWhenGlobalIdle: (callback: (idle: IdleDeadline) => void, timeout?: number) => IDisposable;\n\nexport let _runWhenIdle: (targetWindow: IdleApi, callback: (idle: IdleDeadline) => void, timeout?: number) => IDisposable;\n\n(function () {\n\tif (typeof globalThis.requestIdleCallback !== 'function' || typeof globalThis.cancelIdleCallback !== 'function') {\n\t\t_runWhenIdle = (_targetWindow, runner) => {\n\t\t\tsetTimeout0(() => {\n\t\t\t\tif (disposed) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst end = Date.now() + 15; // one frame at 64fps\n\t\t\t\tconst deadline: IdleDeadline = {\n\t\t\t\t\tdidTimeout: true,\n\t\t\t\t\ttimeRemaining() {\n\t\t\t\t\t\treturn Math.max(0, end - Date.now());\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\trunner(Object.freeze(deadline));\n\t\t\t});\n\t\t\tlet disposed = false;\n\t\t\treturn {\n\t\t\t\tdispose() {\n\t\t\t\t\tif (disposed) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tdisposed = true;\n\t\t\t\t}\n\t\t\t};\n\t\t};\n\t} else {\n\t\t_runWhenIdle = (targetWindow: IdleApi, runner, timeout?) => {\n\t\t\tconst handle: number = targetWindow.requestIdleCallback(runner, typeof timeout === 'number' ? { timeout } : undefined);\n\t\t\tlet disposed = false;\n\t\t\treturn {\n\t\t\t\tdispose() {\n\t\t\t\t\tif (disposed) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tdisposed = true;\n\t\t\t\t\ttargetWindow.cancelIdleCallback(handle);\n\t\t\t\t}\n\t\t\t};\n\t\t};\n\t}\n\trunWhenGlobalIdle = (runner) => _runWhenIdle(globalThis, runner);\n})();\n\nexport abstract class AbstractIdleValue<T> {\n\n\tprivate readonly _executor: () => void;\n\tprivate readonly _handle: IDisposable;\n\n\tprivate _didRun: boolean = false;\n\tprivate _value?: T;\n\tprivate _error: unknown;\n\n\tconstructor(targetWindow: IdleApi, executor: () => T) {\n\t\tthis._executor = () => {\n\t\t\ttry {\n\t\t\t\tthis._value = executor();\n\t\t\t} catch (err) {\n\t\t\t\tthis._error = err;\n\t\t\t} finally {\n\t\t\t\tthis._didRun = true;\n\t\t\t}\n\t\t};\n\t\tthis._handle = _runWhenIdle(targetWindow, () => this._executor());\n\t}\n\n\tdispose(): void {\n\t\tthis._handle.dispose();\n\t}\n\n\tget value(): T {\n\t\tif (!this._didRun) {\n\t\t\tthis._handle.dispose();\n\t\t\tthis._executor();\n\t\t}\n\t\tif (this._error) {\n\t\t\tthrow this._error;\n\t\t}\n\t\treturn this._value!;\n\t}\n\n\tget isInitialized(): boolean {\n\t\treturn this._didRun;\n\t}\n}\n\n/**\n * An `IdleValue` that always uses the current window (which might be throttled or inactive)\n *\n * **Note** that there is `dom.ts#WindowIdleValue` which is better suited when running inside a browser\n * context\n */\nexport class GlobalIdleValue<T> extends AbstractIdleValue<T> {\n\n\tconstructor(executor: () => T) {\n\t\tsuper(globalThis, executor);\n\t}\n}\n\n//#endregion\n\n//#region\n\nexport type ValueCallback<T = unknown> = (value: T | Promise<T>) => void;\n\nconst enum DeferredOutcome {\n\tResolved,\n\tRejected\n}\n\n/**\n * Creates a promise whose resolution or rejection can be controlled imperatively.\n */\nexport class DeferredPromise<T> {\n\n\tprivate completeCallback!: ValueCallback<T>;\n\tprivate errorCallback!: (err: unknown) => void;\n\tprivate outcome?: { outcome: DeferredOutcome.Rejected; value: any } | { outcome: DeferredOutcome.Resolved; value: T };\n\n\tpublic get isRejected() {\n\t\treturn this.outcome?.outcome === DeferredOutcome.Rejected;\n\t}\n\n\tpublic get isSettled() {\n\t\treturn !!this.outcome;\n\t}\n\n\tpublic readonly p: Promise<T>;\n\n\tconstructor() {\n\t\tthis.p = new Promise<T>((c, e) => {\n\t\t\tthis.completeCallback = c;\n\t\t\tthis.errorCallback = e;\n\t\t});\n\t}\n\n\tpublic complete(value: T) {\n\t\treturn new Promise<void>(resolve => {\n\t\t\tthis.completeCallback(value);\n\t\t\tthis.outcome = { outcome: DeferredOutcome.Resolved, value };\n\t\t\tresolve();\n\t\t});\n\t}\n\n\tpublic error(err: unknown) {\n\t\treturn new Promise<void>(resolve => {\n\t\t\tthis.errorCallback(err);\n\t\t\tthis.outcome = { outcome: DeferredOutcome.Rejected, value: err };\n\t\t\tresolve();\n\t\t});\n\t}\n\n\tpublic cancel() {\n\t\treturn this.error(new CancellationError());\n\t}\n}\n\n//#endregion\n\n//#region Promises\n\nexport namespace Promises {\n\n\t/**\n\t * A drop-in replacement for `Promise.all` with the only difference\n\t * that the method awaits every promise to either fulfill or reject.\n\t *\n\t * Similar to `Promise.all`, only the first error will be returned\n\t * if any.\n\t */\n\texport async function settled<T>(promises: Promise<T>[]): Promise<T[]> {\n\t\tlet firstError: Error | undefined = undefined;\n\n\t\tconst result = await Promise.all(promises.map(promise => promise.then(value => value, error => {\n\t\t\tif (!firstError) {\n\t\t\t\tfirstError = error;\n\t\t\t}\n\n\t\t\treturn undefined; // do not rethrow so that other promises can settle\n\t\t})));\n\n\t\tif (typeof firstError !== 'undefined') {\n\t\t\tthrow firstError;\n\t\t}\n\n\t\treturn result as unknown as T[]; // cast is needed and protected by the `throw` above\n\t}\n\n\t/**\n\t * A helper to create a new `Promise<T>` with a body that is a promise\n\t * itself. By default, an error that raises from the async body will\n\t * end up as a unhandled rejection, so this utility properly awaits the\n\t * body and rejects the promise as a normal promise does without async\n\t * body.\n\t *\n\t * This method should only be used in rare cases where otherwise `async`\n\t * cannot be used (e.g. when callbacks are involved that require this).\n\t */\n\texport function withAsyncBody<T, E = Error>(bodyFn: (resolve: (value: T) => unknown, reject: (error: E) => unknown) => Promise<unknown>): Promise<T> {\n\t\t// eslint-disable-next-line no-async-promise-executor\n\t\treturn new Promise<T>(async (resolve, reject) => {\n\t\t\ttry {\n\t\t\t\tawait bodyFn(resolve, reject);\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t}\n\t\t});\n\t}\n}\n\n//#endregion\n\n//#region\n\nconst enum AsyncIterableSourceState {\n\tInitial,\n\tDoneOK,\n\tDoneError,\n}\n\n/**\n * An object that allows to emit async values asynchronously or bring the iterable to an error state using `reject()`.\n * This emitter is valid only for the duration of the executor (until the promise returned by the executor settles).\n */\nexport interface AsyncIterableEmitter<T> {\n\t/**\n\t * The value will be appended at the end.\n\t *\n\t * **NOTE** If `reject()` has already been called, this method has no effect.\n\t */\n\temitOne(value: T): void;\n\t/**\n\t * The values will be appended at the end.\n\t *\n\t * **NOTE** If `reject()` has already been called, this method has no effect.\n\t */\n\temitMany(values: T[]): void;\n\t/**\n\t * Writing an error will permanently invalidate this iterable.\n\t * The current users will receive an error thrown, as will all future users.\n\t *\n\t * **NOTE** If `reject()` have already been called, this method has no effect.\n\t */\n\treject(error: Error): void;\n}\n\n/**\n * An executor for the `AsyncIterableObject` that has access to an emitter.\n */\nexport interface AsyncIterableExecutor<T> {\n\t/**\n\t * @param emitter An object that allows to emit async values valid only for the duration of the executor.\n\t */\n\t(emitter: AsyncIterableEmitter<T>): void | Promise<void>;\n}\n\n/**\n * A rich implementation for an `AsyncIterable<T>`.\n */\nexport class AsyncIterableObject<T> implements AsyncIterable<T> {\n\n\tpublic static fromArray<T>(items: T[]): AsyncIterableObject<T> {\n\t\treturn new AsyncIterableObject<T>((writer) => {\n\t\t\twriter.emitMany(items);\n\t\t});\n\t}\n\n\tpublic static fromPromise<T>(promise: Promise<T[]>): AsyncIterableObject<T> {\n\t\treturn new AsyncIterableObject<T>(async (emitter) => {\n\t\t\temitter.emitMany(await promise);\n\t\t});\n\t}\n\n\tpublic static fromPromises<T>(promises: Promise<T>[]): AsyncIterableObject<T> {\n\t\treturn new AsyncIterableObject<T>(async (emitter) => {\n\t\t\tawait Promise.all(promises.map(async (p) => emitter.emitOne(await p)));\n\t\t});\n\t}\n\n\tpublic static merge<T>(iterables: AsyncIterable<T>[]): AsyncIterableObject<T> {\n\t\treturn new AsyncIterableObject(async (emitter) => {\n\t\t\tawait Promise.all(iterables.map(async (iterable) => {\n\t\t\t\tfor await (const item of iterable) {\n\t\t\t\t\temitter.emitOne(item);\n\t\t\t\t}\n\t\t\t}));\n\t\t});\n\t}\n\n\tpublic static EMPTY = AsyncIterableObject.fromArray<any>([]);\n\n\tprivate _state: AsyncIterableSourceState;\n\tprivate _results: T[];\n\tprivate _error: Error | null;\n\tprivate readonly _onReturn?: () => void | Promise<void>;\n\tprivate readonly _onStateChanged: Emitter<void>;\n\n\tconstructor(executor: AsyncIterableExecutor<T>, onReturn?: () => void | Promise<void>) {\n\t\tthis._state = AsyncIterableSourceState.Initial;\n\t\tthis._results = [];\n\t\tthis._error = null;\n\t\tthis._onReturn = onReturn;\n\t\tthis._onStateChanged = new Emitter<void>();\n\n\t\tqueueMicrotask(async () => {\n\t\t\tconst writer: AsyncIterableEmitter<T> = {\n\t\t\t\temitOne: (item) => this.emitOne(item),\n\t\t\t\temitMany: (items) => this.emitMany(items),\n\t\t\t\treject: (error) => this.reject(error)\n\t\t\t};\n\t\t\ttry {\n\t\t\t\tawait Promise.resolve(executor(writer));\n\t\t\t\tthis.resolve();\n\t\t\t} catch (err) {\n\t\t\t\tthis.reject(err);\n\t\t\t} finally {\n\t\t\t\twriter.emitOne = undefined!;\n\t\t\t\twriter.emitMany = undefined!;\n\t\t\t\twriter.reject = undefined!;\n\t\t\t}\n\t\t});\n\t}\n\n\t[Symbol.asyncIterator](): AsyncIterator<T, undefined, undefined> {\n\t\tlet i = 0;\n\t\treturn {\n\t\t\tnext: async () => {\n\t\t\t\tdo {\n\t\t\t\t\tif (this._state === AsyncIterableSourceState.DoneError) {\n\t\t\t\t\t\tthrow this._error;\n\t\t\t\t\t}\n\t\t\t\t\tif (i < this._results.length) {\n\t\t\t\t\t\treturn { done: false, value: this._results[i++] };\n\t\t\t\t\t}\n\t\t\t\t\tif (this._state === AsyncIterableSourceState.DoneOK) {\n\t\t\t\t\t\treturn { done: true, value: undefined };\n\t\t\t\t\t}\n\t\t\t\t\tawait Event.toPromise(this._onStateChanged.event);\n\t\t\t\t} while (true);\n\t\t\t},\n\t\t\treturn: async () => {\n\t\t\t\tthis._onReturn?.();\n\t\t\t\treturn { done: true, value: undefined };\n\t\t\t}\n\t\t};\n\t}\n\n\tpublic static map<T, R>(iterable: AsyncIterable<T>, mapFn: (item: T) => R): AsyncIterableObject<R> {\n\t\treturn new AsyncIterableObject<R>(async (emitter) => {\n\t\t\tfor await (const item of iterable) {\n\t\t\t\temitter.emitOne(mapFn(item));\n\t\t\t}\n\t\t});\n\t}\n\n\tpublic map<R>(mapFn: (item: T) => R): AsyncIterableObject<R> {\n\t\treturn AsyncIterableObject.map(this, mapFn);\n\t}\n\n\tpublic static filter<T>(iterable: AsyncIterable<T>, filterFn: (item: T) => boolean): AsyncIterableObject<T> {\n\t\treturn new AsyncIterableObject<T>(async (emitter) => {\n\t\t\tfor await (const item of iterable) {\n\t\t\t\tif (filterFn(item)) {\n\t\t\t\t\temitter.emitOne(item);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t}\n\n\tpublic filter(filterFn: (item: T) => boolean): AsyncIterableObject<T> {\n\t\treturn AsyncIterableObject.filter(this, filterFn);\n\t}\n\n\tpublic static coalesce<T>(iterable: AsyncIterable<T | undefined | null>): AsyncIterableObject<T> {\n\t\treturn <AsyncIterableObject<T>>AsyncIterableObject.filter(iterable, item => !!item);\n\t}\n\n\tpublic coalesce(): AsyncIterableObject<NonNullable<T>> {\n\t\treturn AsyncIterableObject.coalesce(this) as AsyncIterableObject<NonNullable<T>>;\n\t}\n\n\tpublic static async toPromise<T>(iterable: AsyncIterable<T>): Promise<T[]> {\n\t\tconst result: T[] = [];\n\t\tfor await (const item of iterable) {\n\t\t\tresult.push(item);\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic toPromise(): Promise<T[]> {\n\t\treturn AsyncIterableObject.toPromise(this);\n\t}\n\n\t/**\n\t * The value will be appended at the end.\n\t *\n\t * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n\t */\n\tprivate emitOne(value: T): void {\n\t\tif (this._state !== AsyncIterableSourceState.Initial) {\n\t\t\treturn;\n\t\t}\n\t\t// it is important to add new values at the end,\n\t\t// as we may have iterators already running on the array\n\t\tthis._results.push(value);\n\t\tthis._onStateChanged.fire();\n\t}\n\n\t/**\n\t * The values will be appended at the end.\n\t *\n\t * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n\t */\n\tprivate emitMany(values: T[]): void {\n\t\tif (this._state !== AsyncIterableSourceState.Initial) {\n\t\t\treturn;\n\t\t}\n\t\t// it is important to add new values at the end,\n\t\t// as we may have iterators already running on the array\n\t\tthis._results = this._results.concat(values);\n\t\tthis._onStateChanged.fire();\n\t}\n\n\t/**\n\t * Calling `resolve()` will mark the result array as complete.\n\t *\n\t * **NOTE** `resolve()` must be called, otherwise all consumers of this iterable will hang indefinitely, similar to a non-resolved promise.\n\t * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n\t */\n\tprivate resolve(): void {\n\t\tif (this._state !== AsyncIterableSourceState.Initial) {\n\t\t\treturn;\n\t\t}\n\t\tthis._state = AsyncIterableSourceState.DoneOK;\n\t\tthis._onStateChanged.fire();\n\t}\n\n\t/**\n\t * Writing an error will permanently invalidate this iterable.\n\t * The current users will receive an error thrown, as will all future users.\n\t *\n\t * **NOTE** If `resolve()` or `reject()` have already been called, this method has no effect.\n\t */\n\tprivate reject(error: Error) {\n\t\tif (this._state !== AsyncIterableSourceState.Initial) {\n\t\t\treturn;\n\t\t}\n\t\tthis._state = AsyncIterableSourceState.DoneError;\n\t\tthis._error = error;\n\t\tthis._onStateChanged.fire();\n\t}\n}\n\nexport class CancelableAsyncIterableObject<T> extends AsyncIterableObject<T> {\n\tconstructor(\n\t\tprivate readonly _source: CancellationTokenSource,\n\t\texecutor: AsyncIterableExecutor<T>\n\t) {\n\t\tsuper(executor);\n\t}\n\n\tcancel(): void {\n\t\tthis._source.cancel();\n\t}\n}\n\nexport function createCancelableAsyncIterable<T>(callback: (token: CancellationToken) => AsyncIterable<T>): CancelableAsyncIterableObject<T> {\n\tconst source = new CancellationTokenSource();\n\tconst innerIterable = callback(source.token);\n\n\treturn new CancelableAsyncIterableObject<T>(source, async (emitter) => {\n\t\tconst subscription = source.token.onCancellationRequested(() => {\n\t\t\tsubscription.dispose();\n\t\t\tsource.dispose();\n\t\t\temitter.reject(new CancellationError());\n\t\t});\n\t\ttry {\n\t\t\tfor await (const item of innerIterable) {\n\t\t\t\tif (source.token.isCancellationRequested) {\n\t\t\t\t\t// canceled in the meantime\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\temitter.emitOne(item);\n\t\t\t}\n\t\t\tsubscription.dispose();\n\t\t\tsource.dispose();\n\t\t} catch (err) {\n\t\t\tsubscription.dispose();\n\t\t\tsource.dispose();\n\t\t\temitter.reject(err);\n\t\t}\n\t});\n}\n\n//#endregion\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { INodeProcess, isMacintosh, isWindows } from 'vs/base/common/platform';\n\nlet safeProcess: Omit<INodeProcess, 'arch'> & { arch: string | undefined };\ndeclare const process: INodeProcess;\n\n// Native sandbox environment\nconst vscodeGlobal = (globalThis as any).vscode;\nif (typeof vscodeGlobal !== 'undefined' && typeof vscodeGlobal.process !== 'undefined') {\n\tconst sandboxProcess: INodeProcess = vscodeGlobal.process;\n\tsafeProcess = {\n\t\tget platform() { return sandboxProcess.platform; },\n\t\tget arch() { return sandboxProcess.arch; },\n\t\tget env() { return sandboxProcess.env; },\n\t\tcwd() { return sandboxProcess.cwd(); }\n\t};\n}\n\n// Native node.js environment\nelse if (typeof process !== 'undefined' && typeof process?.versions?.node === 'string') {\n\tsafeProcess = {\n\t\tget platform() { return process.platform; },\n\t\tget arch() { return process.arch; },\n\t\tget env() { return process.env; },\n\t\tcwd() { return process.env['VSCODE_CWD'] || process.cwd(); }\n\t};\n}\n\n// Web environment\nelse {\n\tsafeProcess = {\n\n\t\t// Supported\n\t\tget platform() { return isWindows ? 'win32' : isMacintosh ? 'darwin' : 'linux'; },\n\t\tget arch() { return undefined; /* arch is undefined in web */ },\n\n\t\t// Unsupported\n\t\tget env() { return {}; },\n\t\tcwd() { return '/'; }\n\t};\n}\n\n/**\n * Provides safe access to the `cwd` property in node.js, sandboxed or web\n * environments.\n *\n * Note: in web, this property is hardcoded to be `/`.\n *\n * @skipMangle\n */\nexport const cwd = safeProcess.cwd;\n\n/**\n * Provides safe access to the `env` property in node.js, sandboxed or web\n * environments.\n *\n * Note: in web, this property is hardcoded to be `{}`.\n */\nexport const env = safeProcess.env;\n\n/**\n * Provides safe access to the `platform` property in node.js, sandboxed or web\n * environments.\n */\nexport const platform = safeProcess.platform;\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\n// NOTE: VSCode's copy of nodejs path library to be usable in common (non-node) namespace\n// Copied from: https://github.com/nodejs/node/commits/v20.9.0/lib/path.js\n// Excluding: the change that adds primordials\n// (https://github.com/nodejs/node/commit/187a862d221dec42fa9a5c4214e7034d9092792f and others)\n\n/**\n * Copyright Joyent, Inc. and other Node contributors.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and/or sell copies of the Software, and to permit\n * persons to whom the Software is furnished to do so, subject to the\n * following conditions:\n *\n * The above copyright notice and this permission notice shall be included\n * in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n * NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n * USE OR OTHER DEALINGS IN THE SOFTWARE.\n */\n\nimport * as process from 'vs/base/common/process';\n\nconst CHAR_UPPERCASE_A = 65;/* A */\nconst CHAR_LOWERCASE_A = 97; /* a */\nconst CHAR_UPPERCASE_Z = 90; /* Z */\nconst CHAR_LOWERCASE_Z = 122; /* z */\nconst CHAR_DOT = 46; /* . */\nconst CHAR_FORWARD_SLASH = 47; /* / */\nconst CHAR_BACKWARD_SLASH = 92; /* \\ */\nconst CHAR_COLON = 58; /* : */\nconst CHAR_QUESTION_MARK = 63; /* ? */\n\nclass ErrorInvalidArgType extends Error {\n\tcode: 'ERR_INVALID_ARG_TYPE';\n\tconstructor(name: string, expected: string, actual: unknown) {\n\t\t// determiner: 'must be' or 'must not be'\n\t\tlet determiner;\n\t\tif (typeof expected === 'string' && expected.indexOf('not ') === 0) {\n\t\t\tdeterminer = 'must not be';\n\t\t\texpected = expected.replace(/^not /, '');\n\t\t} else {\n\t\t\tdeterminer = 'must be';\n\t\t}\n\n\t\tconst type = name.indexOf('.') !== -1 ? 'property' : 'argument';\n\t\tlet msg = `The \"${name}\" ${type} ${determiner} of type ${expected}`;\n\n\t\tmsg += `. Received type ${typeof actual}`;\n\t\tsuper(msg);\n\n\t\tthis.code = 'ERR_INVALID_ARG_TYPE';\n\t}\n}\n\nfunction validateObject(pathObject: object, name: string) {\n\tif (pathObject === null || typeof pathObject !== 'object') {\n\t\tthrow new ErrorInvalidArgType(name, 'Object', pathObject);\n\t}\n}\n\nfunction validateString(value: string, name: string) {\n\tif (typeof value !== 'string') {\n\t\tthrow new ErrorInvalidArgType(name, 'string', value);\n\t}\n}\n\nconst platformIsWin32 = (process.platform === 'win32');\n\nfunction isPathSeparator(code: number | undefined) {\n\treturn code === CHAR_FORWARD_SLASH || code === CHAR_BACKWARD_SLASH;\n}\n\nfunction isPosixPathSeparator(code: number | undefined) {\n\treturn code === CHAR_FORWARD_SLASH;\n}\n\nfunction isWindowsDeviceRoot(code: number) {\n\treturn (code >= CHAR_UPPERCASE_A && code <= CHAR_UPPERCASE_Z) ||\n\t\t(code >= CHAR_LOWERCASE_A && code <= CHAR_LOWERCASE_Z);\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeString(path: string, allowAboveRoot: boolean, separator: string, isPathSeparator: (code?: number) => boolean) {\n\tlet res = '';\n\tlet lastSegmentLength = 0;\n\tlet lastSlash = -1;\n\tlet dots = 0;\n\tlet code = 0;\n\tfor (let i = 0; i <= path.length; ++i) {\n\t\tif (i < path.length) {\n\t\t\tcode = path.charCodeAt(i);\n\t\t}\n\t\telse if (isPathSeparator(code)) {\n\t\t\tbreak;\n\t\t}\n\t\telse {\n\t\t\tcode = CHAR_FORWARD_SLASH;\n\t\t}\n\n\t\tif (isPathSeparator(code)) {\n\t\t\tif (lastSlash === i - 1 || dots === 1) {\n\t\t\t\t// NOOP\n\t\t\t} else if (dots === 2) {\n\t\t\t\tif (res.length < 2 || lastSegmentLength !== 2 ||\n\t\t\t\t\tres.charCodeAt(res.length - 1) !== CHAR_DOT ||\n\t\t\t\t\tres.charCodeAt(res.length - 2) !== CHAR_DOT) {\n\t\t\t\t\tif (res.length > 2) {\n\t\t\t\t\t\tconst lastSlashIndex = res.lastIndexOf(separator);\n\t\t\t\t\t\tif (lastSlashIndex === -1) {\n\t\t\t\t\t\t\tres = '';\n\t\t\t\t\t\t\tlastSegmentLength = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tres = res.slice(0, lastSlashIndex);\n\t\t\t\t\t\t\tlastSegmentLength = res.length - 1 - res.lastIndexOf(separator);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlastSlash = i;\n\t\t\t\t\t\tdots = 0;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t} else if (res.length !== 0) {\n\t\t\t\t\t\tres = '';\n\t\t\t\t\t\tlastSegmentLength = 0;\n\t\t\t\t\t\tlastSlash = i;\n\t\t\t\t\t\tdots = 0;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (allowAboveRoot) {\n\t\t\t\t\tres += res.length > 0 ? `${separator}..` : '..';\n\t\t\t\t\tlastSegmentLength = 2;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (res.length > 0) {\n\t\t\t\t\tres += `${separator}${path.slice(lastSlash + 1, i)}`;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tres = path.slice(lastSlash + 1, i);\n\t\t\t\t}\n\t\t\t\tlastSegmentLength = i - lastSlash - 1;\n\t\t\t}\n\t\t\tlastSlash = i;\n\t\t\tdots = 0;\n\t\t} else if (code === CHAR_DOT && dots !== -1) {\n\t\t\t++dots;\n\t\t} else {\n\t\t\tdots = -1;\n\t\t}\n\t}\n\treturn res;\n}\n\nfunction formatExt(ext: string): string {\n\treturn ext ? `${ext[0] === '.' ? '' : '.'}${ext}` : '';\n}\n\nfunction _format(sep: string, pathObject: ParsedPath) {\n\tvalidateObject(pathObject, 'pathObject');\n\tconst dir = pathObject.dir || pathObject.root;\n\tconst base = pathObject.base ||\n\t\t`${pathObject.name || ''}${formatExt(pathObject.ext)}`;\n\tif (!dir) {\n\t\treturn base;\n\t}\n\treturn dir === pathObject.root ? `${dir}${base}` : `${dir}${sep}${base}`;\n}\n\nexport interface ParsedPath {\n\troot: string;\n\tdir: string;\n\tbase: string;\n\text: string;\n\tname: string;\n}\n\nexport interface IPath {\n\tnormalize(path: string): string;\n\tisAbsolute(path: string): boolean;\n\tjoin(...paths: string[]): string;\n\tresolve(...pathSegments: string[]): string;\n\trelative(from: string, to: string): string;\n\tdirname(path: string): string;\n\tbasename(path: string, suffix?: string): string;\n\textname(path: string): string;\n\tformat(pathObject: ParsedPath): string;\n\tparse(path: string): ParsedPath;\n\ttoNamespacedPath(path: string): string;\n\tsep: '\\\\' | '/';\n\tdelimiter: string;\n\twin32: IPath | null;\n\tposix: IPath | null;\n}\n\nexport const win32: IPath = {\n\t// path.resolve([from ...], to)\n\tresolve(...pathSegments: string[]): string {\n\t\tlet resolvedDevice = '';\n\t\tlet resolvedTail = '';\n\t\tlet resolvedAbsolute = false;\n\n\t\tfor (let i = pathSegments.length - 1; i >= -1; i--) {\n\t\t\tlet path;\n\t\t\tif (i >= 0) {\n\t\t\t\tpath = pathSegments[i];\n\t\t\t\tvalidateString(path, `paths[${i}]`);\n\n\t\t\t\t// Skip empty entries\n\t\t\t\tif (path.length === 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t} else if (resolvedDevice.length === 0) {\n\t\t\t\tpath = process.cwd();\n\t\t\t} else {\n\t\t\t\t// Windows has the concept of drive-specific current working\n\t\t\t\t// directories. If we've resolved a drive letter but not yet an\n\t\t\t\t// absolute path, get cwd for that drive, or the process cwd if\n\t\t\t\t// the drive cwd is not available. We're sure the device is not\n\t\t\t\t// a UNC path at this points, because UNC paths are always absolute.\n\t\t\t\tpath = process.env[`=${resolvedDevice}`] || process.cwd();\n\n\t\t\t\t// Verify that a cwd was found and that it actually points\n\t\t\t\t// to our drive. If not, default to the drive's root.\n\t\t\t\tif (path === undefined ||\n\t\t\t\t\t(path.slice(0, 2).toLowerCase() !== resolvedDevice.toLowerCase() &&\n\t\t\t\t\t\tpath.charCodeAt(2) === CHAR_BACKWARD_SLASH)) {\n\t\t\t\t\tpath = `${resolvedDevice}\\\\`;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst len = path.length;\n\t\t\tlet rootEnd = 0;\n\t\t\tlet device = '';\n\t\t\tlet isAbsolute = false;\n\t\t\tconst code = path.charCodeAt(0);\n\n\t\t\t// Try to match a root\n\t\t\tif (len === 1) {\n\t\t\t\tif (isPathSeparator(code)) {\n\t\t\t\t\t// `path` contains just a path separator\n\t\t\t\t\trootEnd = 1;\n\t\t\t\t\tisAbsolute = true;\n\t\t\t\t}\n\t\t\t} else if (isPathSeparator(code)) {\n\t\t\t\t// Possible UNC root\n\n\t\t\t\t// If we started with a separator, we know we at least have an\n\t\t\t\t// absolute path of some kind (UNC or otherwise)\n\t\t\t\tisAbsolute = true;\n\n\t\t\t\tif (isPathSeparator(path.charCodeAt(1))) {\n\t\t\t\t\t// Matched double path separator at beginning\n\t\t\t\t\tlet j = 2;\n\t\t\t\t\tlet last = j;\n\t\t\t\t\t// Match 1 or more non-path separators\n\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t\tif (j < len && j !== last) {\n\t\t\t\t\t\tconst firstPart = path.slice(last, j);\n\t\t\t\t\t\t// Matched!\n\t\t\t\t\t\tlast = j;\n\t\t\t\t\t\t// Match 1 or more path separators\n\t\t\t\t\t\twhile (j < len && isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (j < len && j !== last) {\n\t\t\t\t\t\t\t// Matched!\n\t\t\t\t\t\t\tlast = j;\n\t\t\t\t\t\t\t// Match 1 or more non-path separators\n\t\t\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (j === len || j !== last) {\n\t\t\t\t\t\t\t\t// We matched a UNC root\n\t\t\t\t\t\t\t\tdevice = `\\\\\\\\${firstPart}\\\\${path.slice(last, j)}`;\n\t\t\t\t\t\t\t\trootEnd = j;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\trootEnd = 1;\n\t\t\t\t}\n\t\t\t} else if (isWindowsDeviceRoot(code) &&\n\t\t\t\tpath.charCodeAt(1) === CHAR_COLON) {\n\t\t\t\t// Possible device root\n\t\t\t\tdevice = path.slice(0, 2);\n\t\t\t\trootEnd = 2;\n\t\t\t\tif (len > 2 && isPathSeparator(path.charCodeAt(2))) {\n\t\t\t\t\t// Treat separator following drive name as an absolute path\n\t\t\t\t\t// indicator\n\t\t\t\t\tisAbsolute = true;\n\t\t\t\t\trootEnd = 3;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (device.length > 0) {\n\t\t\t\tif (resolvedDevice.length > 0) {\n\t\t\t\t\tif (device.toLowerCase() !== resolvedDevice.toLowerCase()) {\n\t\t\t\t\t\t// This path points to another device so it is not applicable\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tresolvedDevice = device;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (resolvedAbsolute) {\n\t\t\t\tif (resolvedDevice.length > 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tresolvedTail = `${path.slice(rootEnd)}\\\\${resolvedTail}`;\n\t\t\t\tresolvedAbsolute = isAbsolute;\n\t\t\t\tif (isAbsolute && resolvedDevice.length > 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// At this point the path should be resolved to a full absolute path,\n\t\t// but handle relative paths to be safe (might happen when process.cwd()\n\t\t// fails)\n\n\t\t// Normalize the tail path\n\t\tresolvedTail = normalizeString(resolvedTail, !resolvedAbsolute, '\\\\',\n\t\t\tisPathSeparator);\n\n\t\treturn resolvedAbsolute ?\n\t\t\t`${resolvedDevice}\\\\${resolvedTail}` :\n\t\t\t`${resolvedDevice}${resolvedTail}` || '.';\n\t},\n\n\tnormalize(path: string): string {\n\t\tvalidateString(path, 'path');\n\t\tconst len = path.length;\n\t\tif (len === 0) {\n\t\t\treturn '.';\n\t\t}\n\t\tlet rootEnd = 0;\n\t\tlet device;\n\t\tlet isAbsolute = false;\n\t\tconst code = path.charCodeAt(0);\n\n\t\t// Try to match a root\n\t\tif (len === 1) {\n\t\t\t// `path` contains just a single char, exit early to avoid\n\t\t\t// unnecessary work\n\t\t\treturn isPosixPathSeparator(code) ? '\\\\' : path;\n\t\t}\n\t\tif (isPathSeparator(code)) {\n\t\t\t// Possible UNC root\n\n\t\t\t// If we started with a separator, we know we at least have an absolute\n\t\t\t// path of some kind (UNC or otherwise)\n\t\t\tisAbsolute = true;\n\n\t\t\tif (isPathSeparator(path.charCodeAt(1))) {\n\t\t\t\t// Matched double path separator at beginning\n\t\t\t\tlet j = 2;\n\t\t\t\tlet last = j;\n\t\t\t\t// Match 1 or more non-path separators\n\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif (j < len && j !== last) {\n\t\t\t\t\tconst firstPart = path.slice(last, j);\n\t\t\t\t\t// Matched!\n\t\t\t\t\tlast = j;\n\t\t\t\t\t// Match 1 or more path separators\n\t\t\t\t\twhile (j < len && isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t\tif (j < len && j !== last) {\n\t\t\t\t\t\t// Matched!\n\t\t\t\t\t\tlast = j;\n\t\t\t\t\t\t// Match 1 or more non-path separators\n\t\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (j === len) {\n\t\t\t\t\t\t\t// We matched a UNC root only\n\t\t\t\t\t\t\t// Return the normalized version of the UNC root since there\n\t\t\t\t\t\t\t// is nothing left to process\n\t\t\t\t\t\t\treturn `\\\\\\\\${firstPart}\\\\${path.slice(last)}\\\\`;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (j !== last) {\n\t\t\t\t\t\t\t// We matched a UNC root with leftovers\n\t\t\t\t\t\t\tdevice = `\\\\\\\\${firstPart}\\\\${path.slice(last, j)}`;\n\t\t\t\t\t\t\trootEnd = j;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\trootEnd = 1;\n\t\t\t}\n\t\t} else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n\t\t\t// Possible device root\n\t\t\tdevice = path.slice(0, 2);\n\t\t\trootEnd = 2;\n\t\t\tif (len > 2 && isPathSeparator(path.charCodeAt(2))) {\n\t\t\t\t// Treat separator following drive name as an absolute path\n\t\t\t\t// indicator\n\t\t\t\tisAbsolute = true;\n\t\t\t\trootEnd = 3;\n\t\t\t}\n\t\t}\n\n\t\tlet tail = rootEnd < len ?\n\t\t\tnormalizeString(path.slice(rootEnd), !isAbsolute, '\\\\', isPathSeparator) :\n\t\t\t'';\n\t\tif (tail.length === 0 && !isAbsolute) {\n\t\t\ttail = '.';\n\t\t}\n\t\tif (tail.length > 0 && isPathSeparator(path.charCodeAt(len - 1))) {\n\t\t\ttail += '\\\\';\n\t\t}\n\t\tif (device === undefined) {\n\t\t\treturn isAbsolute ? `\\\\${tail}` : tail;\n\t\t}\n\t\treturn isAbsolute ? `${device}\\\\${tail}` : `${device}${tail}`;\n\t},\n\n\tisAbsolute(path: string): boolean {\n\t\tvalidateString(path, 'path');\n\t\tconst len = path.length;\n\t\tif (len === 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tconst code = path.charCodeAt(0);\n\t\treturn isPathSeparator(code) ||\n\t\t\t// Possible device root\n\t\t\t(len > 2 &&\n\t\t\t\tisWindowsDeviceRoot(code) &&\n\t\t\t\tpath.charCodeAt(1) === CHAR_COLON &&\n\t\t\t\tisPathSeparator(path.charCodeAt(2)));\n\t},\n\n\tjoin(...paths: string[]): string {\n\t\tif (paths.length === 0) {\n\t\t\treturn '.';\n\t\t}\n\n\t\tlet joined;\n\t\tlet firstPart: string | undefined;\n\t\tfor (let i = 0; i < paths.length; ++i) {\n\t\t\tconst arg = paths[i];\n\t\t\tvalidateString(arg, 'path');\n\t\t\tif (arg.length > 0) {\n\t\t\t\tif (joined === undefined) {\n\t\t\t\t\tjoined = firstPart = arg;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tjoined += `\\\\${arg}`;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (joined === undefined) {\n\t\t\treturn '.';\n\t\t}\n\n\t\t// Make sure that the joined path doesn't start with two slashes, because\n\t\t// normalize() will mistake it for a UNC path then.\n\t\t//\n\t\t// This step is skipped when it is very clear that the user actually\n\t\t// intended to point at a UNC path. This is assumed when the first\n\t\t// non-empty string arguments starts with exactly two slashes followed by\n\t\t// at least one more non-slash character.\n\t\t//\n\t\t// Note that for normalize() to treat a path as a UNC path it needs to\n\t\t// have at least 2 components, so we don't filter for that here.\n\t\t// This means that the user can use join to construct UNC paths from\n\t\t// a server name and a share name; for example:\n\t\t//   path.join('//server', 'share') -> '\\\\\\\\server\\\\share\\\\')\n\t\tlet needsReplace = true;\n\t\tlet slashCount = 0;\n\t\tif (typeof firstPart === 'string' && isPathSeparator(firstPart.charCodeAt(0))) {\n\t\t\t++slashCount;\n\t\t\tconst firstLen = firstPart.length;\n\t\t\tif (firstLen > 1 && isPathSeparator(firstPart.charCodeAt(1))) {\n\t\t\t\t++slashCount;\n\t\t\t\tif (firstLen > 2) {\n\t\t\t\t\tif (isPathSeparator(firstPart.charCodeAt(2))) {\n\t\t\t\t\t\t++slashCount;\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// We matched a UNC path in the first part\n\t\t\t\t\t\tneedsReplace = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (needsReplace) {\n\t\t\t// Find any more consecutive slashes we need to replace\n\t\t\twhile (slashCount < joined.length &&\n\t\t\t\tisPathSeparator(joined.charCodeAt(slashCount))) {\n\t\t\t\tslashCount++;\n\t\t\t}\n\n\t\t\t// Replace the slashes if needed\n\t\t\tif (slashCount >= 2) {\n\t\t\t\tjoined = `\\\\${joined.slice(slashCount)}`;\n\t\t\t}\n\t\t}\n\n\t\treturn win32.normalize(joined);\n\t},\n\n\n\t// It will solve the relative path from `from` to `to`, for instance:\n\t//  from = 'C:\\\\orandea\\\\test\\\\aaa'\n\t//  to = 'C:\\\\orandea\\\\impl\\\\bbb'\n\t// The output of the function should be: '..\\\\..\\\\impl\\\\bbb'\n\trelative(from: string, to: string): string {\n\t\tvalidateString(from, 'from');\n\t\tvalidateString(to, 'to');\n\n\t\tif (from === to) {\n\t\t\treturn '';\n\t\t}\n\n\t\tconst fromOrig = win32.resolve(from);\n\t\tconst toOrig = win32.resolve(to);\n\n\t\tif (fromOrig === toOrig) {\n\t\t\treturn '';\n\t\t}\n\n\t\tfrom = fromOrig.toLowerCase();\n\t\tto = toOrig.toLowerCase();\n\n\t\tif (from === to) {\n\t\t\treturn '';\n\t\t}\n\n\t\t// Trim any leading backslashes\n\t\tlet fromStart = 0;\n\t\twhile (fromStart < from.length &&\n\t\t\tfrom.charCodeAt(fromStart) === CHAR_BACKWARD_SLASH) {\n\t\t\tfromStart++;\n\t\t}\n\t\t// Trim trailing backslashes (applicable to UNC paths only)\n\t\tlet fromEnd = from.length;\n\t\twhile (fromEnd - 1 > fromStart &&\n\t\t\tfrom.charCodeAt(fromEnd - 1) === CHAR_BACKWARD_SLASH) {\n\t\t\tfromEnd--;\n\t\t}\n\t\tconst fromLen = fromEnd - fromStart;\n\n\t\t// Trim any leading backslashes\n\t\tlet toStart = 0;\n\t\twhile (toStart < to.length &&\n\t\t\tto.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {\n\t\t\ttoStart++;\n\t\t}\n\t\t// Trim trailing backslashes (applicable to UNC paths only)\n\t\tlet toEnd = to.length;\n\t\twhile (toEnd - 1 > toStart &&\n\t\t\tto.charCodeAt(toEnd - 1) === CHAR_BACKWARD_SLASH) {\n\t\t\ttoEnd--;\n\t\t}\n\t\tconst toLen = toEnd - toStart;\n\n\t\t// Compare paths to find the longest common path from root\n\t\tconst length = fromLen < toLen ? fromLen : toLen;\n\t\tlet lastCommonSep = -1;\n\t\tlet i = 0;\n\t\tfor (; i < length; i++) {\n\t\t\tconst fromCode = from.charCodeAt(fromStart + i);\n\t\t\tif (fromCode !== to.charCodeAt(toStart + i)) {\n\t\t\t\tbreak;\n\t\t\t} else if (fromCode === CHAR_BACKWARD_SLASH) {\n\t\t\t\tlastCommonSep = i;\n\t\t\t}\n\t\t}\n\n\t\t// We found a mismatch before the first common path separator was seen, so\n\t\t// return the original `to`.\n\t\tif (i !== length) {\n\t\t\tif (lastCommonSep === -1) {\n\t\t\t\treturn toOrig;\n\t\t\t}\n\t\t} else {\n\t\t\tif (toLen > length) {\n\t\t\t\tif (to.charCodeAt(toStart + i) === CHAR_BACKWARD_SLASH) {\n\t\t\t\t\t// We get here if `from` is the exact base path for `to`.\n\t\t\t\t\t// For example: from='C:\\\\foo\\\\bar'; to='C:\\\\foo\\\\bar\\\\baz'\n\t\t\t\t\treturn toOrig.slice(toStart + i + 1);\n\t\t\t\t}\n\t\t\t\tif (i === 2) {\n\t\t\t\t\t// We get here if `from` is the device root.\n\t\t\t\t\t// For example: from='C:\\\\'; to='C:\\\\foo'\n\t\t\t\t\treturn toOrig.slice(toStart + i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (fromLen > length) {\n\t\t\t\tif (from.charCodeAt(fromStart + i) === CHAR_BACKWARD_SLASH) {\n\t\t\t\t\t// We get here if `to` is the exact base path for `from`.\n\t\t\t\t\t// For example: from='C:\\\\foo\\\\bar'; to='C:\\\\foo'\n\t\t\t\t\tlastCommonSep = i;\n\t\t\t\t} else if (i === 2) {\n\t\t\t\t\t// We get here if `to` is the device root.\n\t\t\t\t\t// For example: from='C:\\\\foo\\\\bar'; to='C:\\\\'\n\t\t\t\t\tlastCommonSep = 3;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (lastCommonSep === -1) {\n\t\t\t\tlastCommonSep = 0;\n\t\t\t}\n\t\t}\n\n\t\tlet out = '';\n\t\t// Generate the relative path based on the path difference between `to` and\n\t\t// `from`\n\t\tfor (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n\t\t\tif (i === fromEnd || from.charCodeAt(i) === CHAR_BACKWARD_SLASH) {\n\t\t\t\tout += out.length === 0 ? '..' : '\\\\..';\n\t\t\t}\n\t\t}\n\n\t\ttoStart += lastCommonSep;\n\n\t\t// Lastly, append the rest of the destination (`to`) path that comes after\n\t\t// the common path parts\n\t\tif (out.length > 0) {\n\t\t\treturn `${out}${toOrig.slice(toStart, toEnd)}`;\n\t\t}\n\n\t\tif (toOrig.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {\n\t\t\t++toStart;\n\t\t}\n\n\t\treturn toOrig.slice(toStart, toEnd);\n\t},\n\n\ttoNamespacedPath(path: string): string {\n\t\t// Note: this will *probably* throw somewhere.\n\t\tif (typeof path !== 'string' || path.length === 0) {\n\t\t\treturn path;\n\t\t}\n\n\t\tconst resolvedPath = win32.resolve(path);\n\n\t\tif (resolvedPath.length <= 2) {\n\t\t\treturn path;\n\t\t}\n\n\t\tif (resolvedPath.charCodeAt(0) === CHAR_BACKWARD_SLASH) {\n\t\t\t// Possible UNC root\n\t\t\tif (resolvedPath.charCodeAt(1) === CHAR_BACKWARD_SLASH) {\n\t\t\t\tconst code = resolvedPath.charCodeAt(2);\n\t\t\t\tif (code !== CHAR_QUESTION_MARK && code !== CHAR_DOT) {\n\t\t\t\t\t// Matched non-long UNC root, convert the path to a long UNC path\n\t\t\t\t\treturn `\\\\\\\\?\\\\UNC\\\\${resolvedPath.slice(2)}`;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (isWindowsDeviceRoot(resolvedPath.charCodeAt(0)) &&\n\t\t\tresolvedPath.charCodeAt(1) === CHAR_COLON &&\n\t\t\tresolvedPath.charCodeAt(2) === CHAR_BACKWARD_SLASH) {\n\t\t\t// Matched device root, convert the path to a long UNC path\n\t\t\treturn `\\\\\\\\?\\\\${resolvedPath}`;\n\t\t}\n\n\t\treturn path;\n\t},\n\n\tdirname(path: string): string {\n\t\tvalidateString(path, 'path');\n\t\tconst len = path.length;\n\t\tif (len === 0) {\n\t\t\treturn '.';\n\t\t}\n\t\tlet rootEnd = -1;\n\t\tlet offset = 0;\n\t\tconst code = path.charCodeAt(0);\n\n\t\tif (len === 1) {\n\t\t\t// `path` contains just a path separator, exit early to avoid\n\t\t\t// unnecessary work or a dot.\n\t\t\treturn isPathSeparator(code) ? path : '.';\n\t\t}\n\n\t\t// Try to match a root\n\t\tif (isPathSeparator(code)) {\n\t\t\t// Possible UNC root\n\n\t\t\trootEnd = offset = 1;\n\n\t\t\tif (isPathSeparator(path.charCodeAt(1))) {\n\t\t\t\t// Matched double path separator at beginning\n\t\t\t\tlet j = 2;\n\t\t\t\tlet last = j;\n\t\t\t\t// Match 1 or more non-path separators\n\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif (j < len && j !== last) {\n\t\t\t\t\t// Matched!\n\t\t\t\t\tlast = j;\n\t\t\t\t\t// Match 1 or more path separators\n\t\t\t\t\twhile (j < len && isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t\tif (j < len && j !== last) {\n\t\t\t\t\t\t// Matched!\n\t\t\t\t\t\tlast = j;\n\t\t\t\t\t\t// Match 1 or more non-path separators\n\t\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (j === len) {\n\t\t\t\t\t\t\t// We matched a UNC root only\n\t\t\t\t\t\t\treturn path;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (j !== last) {\n\t\t\t\t\t\t\t// We matched a UNC root with leftovers\n\n\t\t\t\t\t\t\t// Offset by 1 to include the separator after the UNC root to\n\t\t\t\t\t\t\t// treat it as a \"normal root\" on top of a (UNC) root\n\t\t\t\t\t\t\trootEnd = offset = j + 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Possible device root\n\t\t} else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n\t\t\trootEnd = len > 2 && isPathSeparator(path.charCodeAt(2)) ? 3 : 2;\n\t\t\toffset = rootEnd;\n\t\t}\n\n\t\tlet end = -1;\n\t\tlet matchedSlash = true;\n\t\tfor (let i = len - 1; i >= offset; --i) {\n\t\t\tif (isPathSeparator(path.charCodeAt(i))) {\n\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\tend = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// We saw the first non-path separator\n\t\t\t\tmatchedSlash = false;\n\t\t\t}\n\t\t}\n\n\t\tif (end === -1) {\n\t\t\tif (rootEnd === -1) {\n\t\t\t\treturn '.';\n\t\t\t}\n\n\t\t\tend = rootEnd;\n\t\t}\n\t\treturn path.slice(0, end);\n\t},\n\n\tbasename(path: string, suffix?: string): string {\n\t\tif (suffix !== undefined) {\n\t\t\tvalidateString(suffix, 'suffix');\n\t\t}\n\t\tvalidateString(path, 'path');\n\t\tlet start = 0;\n\t\tlet end = -1;\n\t\tlet matchedSlash = true;\n\t\tlet i;\n\n\t\t// Check for a drive letter prefix so as not to mistake the following\n\t\t// path separator as an extra separator at the end of the path that can be\n\t\t// disregarded\n\t\tif (path.length >= 2 &&\n\t\t\tisWindowsDeviceRoot(path.charCodeAt(0)) &&\n\t\t\tpath.charCodeAt(1) === CHAR_COLON) {\n\t\t\tstart = 2;\n\t\t}\n\n\t\tif (suffix !== undefined && suffix.length > 0 && suffix.length <= path.length) {\n\t\t\tif (suffix === path) {\n\t\t\t\treturn '';\n\t\t\t}\n\t\t\tlet extIdx = suffix.length - 1;\n\t\t\tlet firstNonSlashEnd = -1;\n\t\t\tfor (i = path.length - 1; i >= start; --i) {\n\t\t\t\tconst code = path.charCodeAt(i);\n\t\t\t\tif (isPathSeparator(code)) {\n\t\t\t\t\t// If we reached a path separator that was not part of a set of path\n\t\t\t\t\t// separators at the end of the string, stop now\n\t\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\t\tstart = i + 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (firstNonSlashEnd === -1) {\n\t\t\t\t\t\t// We saw the first non-path separator, remember this index in case\n\t\t\t\t\t\t// we need it if the extension ends up not matching\n\t\t\t\t\t\tmatchedSlash = false;\n\t\t\t\t\t\tfirstNonSlashEnd = i + 1;\n\t\t\t\t\t}\n\t\t\t\t\tif (extIdx >= 0) {\n\t\t\t\t\t\t// Try to match the explicit extension\n\t\t\t\t\t\tif (code === suffix.charCodeAt(extIdx)) {\n\t\t\t\t\t\t\tif (--extIdx === -1) {\n\t\t\t\t\t\t\t\t// We matched the extension, so mark this as the end of our path\n\t\t\t\t\t\t\t\t// component\n\t\t\t\t\t\t\t\tend = i;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Extension does not match, so our result is the entire path\n\t\t\t\t\t\t\t// component\n\t\t\t\t\t\t\textIdx = -1;\n\t\t\t\t\t\t\tend = firstNonSlashEnd;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (start === end) {\n\t\t\t\tend = firstNonSlashEnd;\n\t\t\t} else if (end === -1) {\n\t\t\t\tend = path.length;\n\t\t\t}\n\t\t\treturn path.slice(start, end);\n\t\t}\n\t\tfor (i = path.length - 1; i >= start; --i) {\n\t\t\tif (isPathSeparator(path.charCodeAt(i))) {\n\t\t\t\t// If we reached a path separator that was not part of a set of path\n\t\t\t\t// separators at the end of the string, stop now\n\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\tstart = i + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else if (end === -1) {\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\n\t\t\t\t// path component\n\t\t\t\tmatchedSlash = false;\n\t\t\t\tend = i + 1;\n\t\t\t}\n\t\t}\n\n\t\tif (end === -1) {\n\t\t\treturn '';\n\t\t}\n\t\treturn path.slice(start, end);\n\t},\n\n\textname(path: string): string {\n\t\tvalidateString(path, 'path');\n\t\tlet start = 0;\n\t\tlet startDot = -1;\n\t\tlet startPart = 0;\n\t\tlet end = -1;\n\t\tlet matchedSlash = true;\n\t\t// Track the state of characters (if any) we see before our first dot and\n\t\t// after any path separator we find\n\t\tlet preDotState = 0;\n\n\t\t// Check for a drive letter prefix so as not to mistake the following\n\t\t// path separator as an extra separator at the end of the path that can be\n\t\t// disregarded\n\n\t\tif (path.length >= 2 &&\n\t\t\tpath.charCodeAt(1) === CHAR_COLON &&\n\t\t\tisWindowsDeviceRoot(path.charCodeAt(0))) {\n\t\t\tstart = startPart = 2;\n\t\t}\n\n\t\tfor (let i = path.length - 1; i >= start; --i) {\n\t\t\tconst code = path.charCodeAt(i);\n\t\t\tif (isPathSeparator(code)) {\n\t\t\t\t// If we reached a path separator that was not part of a set of path\n\t\t\t\t// separators at the end of the string, stop now\n\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\tstartPart = i + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (end === -1) {\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\n\t\t\t\t// extension\n\t\t\t\tmatchedSlash = false;\n\t\t\t\tend = i + 1;\n\t\t\t}\n\t\t\tif (code === CHAR_DOT) {\n\t\t\t\t// If this is our first dot, mark it as the start of our extension\n\t\t\t\tif (startDot === -1) {\n\t\t\t\t\tstartDot = i;\n\t\t\t\t}\n\t\t\t\telse if (preDotState !== 1) {\n\t\t\t\t\tpreDotState = 1;\n\t\t\t\t}\n\t\t\t} else if (startDot !== -1) {\n\t\t\t\t// We saw a non-dot and non-path separator before our dot, so we should\n\t\t\t\t// have a good chance at having a non-empty extension\n\t\t\t\tpreDotState = -1;\n\t\t\t}\n\t\t}\n\n\t\tif (startDot === -1 ||\n\t\t\tend === -1 ||\n\t\t\t// We saw a non-dot character immediately before the dot\n\t\t\tpreDotState === 0 ||\n\t\t\t// The (right-most) trimmed path component is exactly '..'\n\t\t\t(preDotState === 1 &&\n\t\t\t\tstartDot === end - 1 &&\n\t\t\t\tstartDot === startPart + 1)) {\n\t\t\treturn '';\n\t\t}\n\t\treturn path.slice(startDot, end);\n\t},\n\n\tformat: _format.bind(null, '\\\\'),\n\n\tparse(path) {\n\t\tvalidateString(path, 'path');\n\n\t\tconst ret = { root: '', dir: '', base: '', ext: '', name: '' };\n\t\tif (path.length === 0) {\n\t\t\treturn ret;\n\t\t}\n\n\t\tconst len = path.length;\n\t\tlet rootEnd = 0;\n\t\tlet code = path.charCodeAt(0);\n\n\t\tif (len === 1) {\n\t\t\tif (isPathSeparator(code)) {\n\t\t\t\t// `path` contains just a path separator, exit early to avoid\n\t\t\t\t// unnecessary work\n\t\t\t\tret.root = ret.dir = path;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tret.base = ret.name = path;\n\t\t\treturn ret;\n\t\t}\n\t\t// Try to match a root\n\t\tif (isPathSeparator(code)) {\n\t\t\t// Possible UNC root\n\n\t\t\trootEnd = 1;\n\t\t\tif (isPathSeparator(path.charCodeAt(1))) {\n\t\t\t\t// Matched double path separator at beginning\n\t\t\t\tlet j = 2;\n\t\t\t\tlet last = j;\n\t\t\t\t// Match 1 or more non-path separators\n\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t\tif (j < len && j !== last) {\n\t\t\t\t\t// Matched!\n\t\t\t\t\tlast = j;\n\t\t\t\t\t// Match 1 or more path separators\n\t\t\t\t\twhile (j < len && isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t\tif (j < len && j !== last) {\n\t\t\t\t\t\t// Matched!\n\t\t\t\t\t\tlast = j;\n\t\t\t\t\t\t// Match 1 or more non-path separators\n\t\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\n\t\t\t\t\t\t\tj++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (j === len) {\n\t\t\t\t\t\t\t// We matched a UNC root only\n\t\t\t\t\t\t\trootEnd = j;\n\t\t\t\t\t\t} else if (j !== last) {\n\t\t\t\t\t\t\t// We matched a UNC root with leftovers\n\t\t\t\t\t\t\trootEnd = j + 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n\t\t\t// Possible device root\n\t\t\tif (len <= 2) {\n\t\t\t\t// `path` contains just a drive root, exit early to avoid\n\t\t\t\t// unnecessary work\n\t\t\t\tret.root = ret.dir = path;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\trootEnd = 2;\n\t\t\tif (isPathSeparator(path.charCodeAt(2))) {\n\t\t\t\tif (len === 3) {\n\t\t\t\t\t// `path` contains just a drive root, exit early to avoid\n\t\t\t\t\t// unnecessary work\n\t\t\t\t\tret.root = ret.dir = path;\n\t\t\t\t\treturn ret;\n\t\t\t\t}\n\t\t\t\trootEnd = 3;\n\t\t\t}\n\t\t}\n\t\tif (rootEnd > 0) {\n\t\t\tret.root = path.slice(0, rootEnd);\n\t\t}\n\n\t\tlet startDot = -1;\n\t\tlet startPart = rootEnd;\n\t\tlet end = -1;\n\t\tlet matchedSlash = true;\n\t\tlet i = path.length - 1;\n\n\t\t// Track the state of characters (if any) we see before our first dot and\n\t\t// after any path separator we find\n\t\tlet preDotState = 0;\n\n\t\t// Get non-dir info\n\t\tfor (; i >= rootEnd; --i) {\n\t\t\tcode = path.charCodeAt(i);\n\t\t\tif (isPathSeparator(code)) {\n\t\t\t\t// If we reached a path separator that was not part of a set of path\n\t\t\t\t// separators at the end of the string, stop now\n\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\tstartPart = i + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (end === -1) {\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\n\t\t\t\t// extension\n\t\t\t\tmatchedSlash = false;\n\t\t\t\tend = i + 1;\n\t\t\t}\n\t\t\tif (code === CHAR_DOT) {\n\t\t\t\t// If this is our first dot, mark it as the start of our extension\n\t\t\t\tif (startDot === -1) {\n\t\t\t\t\tstartDot = i;\n\t\t\t\t} else if (preDotState !== 1) {\n\t\t\t\t\tpreDotState = 1;\n\t\t\t\t}\n\t\t\t} else if (startDot !== -1) {\n\t\t\t\t// We saw a non-dot and non-path separator before our dot, so we should\n\t\t\t\t// have a good chance at having a non-empty extension\n\t\t\t\tpreDotState = -1;\n\t\t\t}\n\t\t}\n\n\t\tif (end !== -1) {\n\t\t\tif (startDot === -1 ||\n\t\t\t\t// We saw a non-dot character immediately before the dot\n\t\t\t\tpreDotState === 0 ||\n\t\t\t\t// The (right-most) trimmed path component is exactly '..'\n\t\t\t\t(preDotState === 1 &&\n\t\t\t\t\tstartDot === end - 1 &&\n\t\t\t\t\tstartDot === startPart + 1)) {\n\t\t\t\tret.base = ret.name = path.slice(startPart, end);\n\t\t\t} else {\n\t\t\t\tret.name = path.slice(startPart, startDot);\n\t\t\t\tret.base = path.slice(startPart, end);\n\t\t\t\tret.ext = path.slice(startDot, end);\n\t\t\t}\n\t\t}\n\n\t\t// If the directory is the root, use the entire root as the `dir` including\n\t\t// the trailing slash if any (`C:\\abc` -> `C:\\`). Otherwise, strip out the\n\t\t// trailing slash (`C:\\abc\\def` -> `C:\\abc`).\n\t\tif (startPart > 0 && startPart !== rootEnd) {\n\t\t\tret.dir = path.slice(0, startPart - 1);\n\t\t} else {\n\t\t\tret.dir = ret.root;\n\t\t}\n\n\t\treturn ret;\n\t},\n\n\tsep: '\\\\',\n\tdelimiter: ';',\n\twin32: null,\n\tposix: null\n};\n\nconst posixCwd = (() => {\n\tif (platformIsWin32) {\n\t\t// Converts Windows' backslash path separators to POSIX forward slashes\n\t\t// and truncates any drive indicator\n\t\tconst regexp = /\\\\/g;\n\t\treturn () => {\n\t\t\tconst cwd = process.cwd().replace(regexp, '/');\n\t\t\treturn cwd.slice(cwd.indexOf('/'));\n\t\t};\n\t}\n\n\t// We're already on POSIX, no need for any transformations\n\treturn () => process.cwd();\n})();\n\nexport const posix: IPath = {\n\t// path.resolve([from ...], to)\n\tresolve(...pathSegments: string[]): string {\n\t\tlet resolvedPath = '';\n\t\tlet resolvedAbsolute = false;\n\n\t\tfor (let i = pathSegments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n\t\t\tconst path = i >= 0 ? pathSegments[i] : posixCwd();\n\n\t\t\tvalidateString(path, `paths[${i}]`);\n\n\t\t\t// Skip empty entries\n\t\t\tif (path.length === 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tresolvedPath = `${path}/${resolvedPath}`;\n\t\t\tresolvedAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n\t\t}\n\n\t\t// At this point the path should be resolved to a full absolute path, but\n\t\t// handle relative paths to be safe (might happen when process.cwd() fails)\n\n\t\t// Normalize the path\n\t\tresolvedPath = normalizeString(resolvedPath, !resolvedAbsolute, '/',\n\t\t\tisPosixPathSeparator);\n\n\t\tif (resolvedAbsolute) {\n\t\t\treturn `/${resolvedPath}`;\n\t\t}\n\t\treturn resolvedPath.length > 0 ? resolvedPath : '.';\n\t},\n\n\tnormalize(path: string): string {\n\t\tvalidateString(path, 'path');\n\n\t\tif (path.length === 0) {\n\t\t\treturn '.';\n\t\t}\n\n\t\tconst isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n\t\tconst trailingSeparator =\n\t\t\tpath.charCodeAt(path.length - 1) === CHAR_FORWARD_SLASH;\n\n\t\t// Normalize the path\n\t\tpath = normalizeString(path, !isAbsolute, '/', isPosixPathSeparator);\n\n\t\tif (path.length === 0) {\n\t\t\tif (isAbsolute) {\n\t\t\t\treturn '/';\n\t\t\t}\n\t\t\treturn trailingSeparator ? './' : '.';\n\t\t}\n\t\tif (trailingSeparator) {\n\t\t\tpath += '/';\n\t\t}\n\n\t\treturn isAbsolute ? `/${path}` : path;\n\t},\n\n\tisAbsolute(path: string): boolean {\n\t\tvalidateString(path, 'path');\n\t\treturn path.length > 0 && path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n\t},\n\n\tjoin(...paths: string[]): string {\n\t\tif (paths.length === 0) {\n\t\t\treturn '.';\n\t\t}\n\t\tlet joined;\n\t\tfor (let i = 0; i < paths.length; ++i) {\n\t\t\tconst arg = paths[i];\n\t\t\tvalidateString(arg, 'path');\n\t\t\tif (arg.length > 0) {\n\t\t\t\tif (joined === undefined) {\n\t\t\t\t\tjoined = arg;\n\t\t\t\t} else {\n\t\t\t\t\tjoined += `/${arg}`;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (joined === undefined) {\n\t\t\treturn '.';\n\t\t}\n\t\treturn posix.normalize(joined);\n\t},\n\n\trelative(from: string, to: string): string {\n\t\tvalidateString(from, 'from');\n\t\tvalidateString(to, 'to');\n\n\t\tif (from === to) {\n\t\t\treturn '';\n\t\t}\n\n\t\t// Trim leading forward slashes.\n\t\tfrom = posix.resolve(from);\n\t\tto = posix.resolve(to);\n\n\t\tif (from === to) {\n\t\t\treturn '';\n\t\t}\n\n\t\tconst fromStart = 1;\n\t\tconst fromEnd = from.length;\n\t\tconst fromLen = fromEnd - fromStart;\n\t\tconst toStart = 1;\n\t\tconst toLen = to.length - toStart;\n\n\t\t// Compare paths to find the longest common path from root\n\t\tconst length = (fromLen < toLen ? fromLen : toLen);\n\t\tlet lastCommonSep = -1;\n\t\tlet i = 0;\n\t\tfor (; i < length; i++) {\n\t\t\tconst fromCode = from.charCodeAt(fromStart + i);\n\t\t\tif (fromCode !== to.charCodeAt(toStart + i)) {\n\t\t\t\tbreak;\n\t\t\t} else if (fromCode === CHAR_FORWARD_SLASH) {\n\t\t\t\tlastCommonSep = i;\n\t\t\t}\n\t\t}\n\t\tif (i === length) {\n\t\t\tif (toLen > length) {\n\t\t\t\tif (to.charCodeAt(toStart + i) === CHAR_FORWARD_SLASH) {\n\t\t\t\t\t// We get here if `from` is the exact base path for `to`.\n\t\t\t\t\t// For example: from='/foo/bar'; to='/foo/bar/baz'\n\t\t\t\t\treturn to.slice(toStart + i + 1);\n\t\t\t\t}\n\t\t\t\tif (i === 0) {\n\t\t\t\t\t// We get here if `from` is the root\n\t\t\t\t\t// For example: from='/'; to='/foo'\n\t\t\t\t\treturn to.slice(toStart + i);\n\t\t\t\t}\n\t\t\t} else if (fromLen > length) {\n\t\t\t\tif (from.charCodeAt(fromStart + i) === CHAR_FORWARD_SLASH) {\n\t\t\t\t\t// We get here if `to` is the exact base path for `from`.\n\t\t\t\t\t// For example: from='/foo/bar/baz'; to='/foo/bar'\n\t\t\t\t\tlastCommonSep = i;\n\t\t\t\t} else if (i === 0) {\n\t\t\t\t\t// We get here if `to` is the root.\n\t\t\t\t\t// For example: from='/foo/bar'; to='/'\n\t\t\t\t\tlastCommonSep = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlet out = '';\n\t\t// Generate the relative path based on the path difference between `to`\n\t\t// and `from`.\n\t\tfor (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n\t\t\tif (i === fromEnd || from.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n\t\t\t\tout += out.length === 0 ? '..' : '/..';\n\t\t\t}\n\t\t}\n\n\t\t// Lastly, append the rest of the destination (`to`) path that comes after\n\t\t// the common path parts.\n\t\treturn `${out}${to.slice(toStart + lastCommonSep)}`;\n\t},\n\n\ttoNamespacedPath(path: string): string {\n\t\t// Non-op on posix systems\n\t\treturn path;\n\t},\n\n\tdirname(path: string): string {\n\t\tvalidateString(path, 'path');\n\t\tif (path.length === 0) {\n\t\t\treturn '.';\n\t\t}\n\t\tconst hasRoot = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n\t\tlet end = -1;\n\t\tlet matchedSlash = true;\n\t\tfor (let i = path.length - 1; i >= 1; --i) {\n\t\t\tif (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\tend = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// We saw the first non-path separator\n\t\t\t\tmatchedSlash = false;\n\t\t\t}\n\t\t}\n\n\t\tif (end === -1) {\n\t\t\treturn hasRoot ? '/' : '.';\n\t\t}\n\t\tif (hasRoot && end === 1) {\n\t\t\treturn '//';\n\t\t}\n\t\treturn path.slice(0, end);\n\t},\n\n\tbasename(path: string, suffix?: string): string {\n\t\tif (suffix !== undefined) {\n\t\t\tvalidateString(suffix, 'ext');\n\t\t}\n\t\tvalidateString(path, 'path');\n\n\t\tlet start = 0;\n\t\tlet end = -1;\n\t\tlet matchedSlash = true;\n\t\tlet i;\n\n\t\tif (suffix !== undefined && suffix.length > 0 && suffix.length <= path.length) {\n\t\t\tif (suffix === path) {\n\t\t\t\treturn '';\n\t\t\t}\n\t\t\tlet extIdx = suffix.length - 1;\n\t\t\tlet firstNonSlashEnd = -1;\n\t\t\tfor (i = path.length - 1; i >= 0; --i) {\n\t\t\t\tconst code = path.charCodeAt(i);\n\t\t\t\tif (code === CHAR_FORWARD_SLASH) {\n\t\t\t\t\t// If we reached a path separator that was not part of a set of path\n\t\t\t\t\t// separators at the end of the string, stop now\n\t\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\t\tstart = i + 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif (firstNonSlashEnd === -1) {\n\t\t\t\t\t\t// We saw the first non-path separator, remember this index in case\n\t\t\t\t\t\t// we need it if the extension ends up not matching\n\t\t\t\t\t\tmatchedSlash = false;\n\t\t\t\t\t\tfirstNonSlashEnd = i + 1;\n\t\t\t\t\t}\n\t\t\t\t\tif (extIdx >= 0) {\n\t\t\t\t\t\t// Try to match the explicit extension\n\t\t\t\t\t\tif (code === suffix.charCodeAt(extIdx)) {\n\t\t\t\t\t\t\tif (--extIdx === -1) {\n\t\t\t\t\t\t\t\t// We matched the extension, so mark this as the end of our path\n\t\t\t\t\t\t\t\t// component\n\t\t\t\t\t\t\t\tend = i;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Extension does not match, so our result is the entire path\n\t\t\t\t\t\t\t// component\n\t\t\t\t\t\t\textIdx = -1;\n\t\t\t\t\t\t\tend = firstNonSlashEnd;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (start === end) {\n\t\t\t\tend = firstNonSlashEnd;\n\t\t\t} else if (end === -1) {\n\t\t\t\tend = path.length;\n\t\t\t}\n\t\t\treturn path.slice(start, end);\n\t\t}\n\t\tfor (i = path.length - 1; i >= 0; --i) {\n\t\t\tif (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n\t\t\t\t// If we reached a path separator that was not part of a set of path\n\t\t\t\t// separators at the end of the string, stop now\n\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\tstart = i + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else if (end === -1) {\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\n\t\t\t\t// path component\n\t\t\t\tmatchedSlash = false;\n\t\t\t\tend = i + 1;\n\t\t\t}\n\t\t}\n\n\t\tif (end === -1) {\n\t\t\treturn '';\n\t\t}\n\t\treturn path.slice(start, end);\n\t},\n\n\textname(path: string): string {\n\t\tvalidateString(path, 'path');\n\t\tlet startDot = -1;\n\t\tlet startPart = 0;\n\t\tlet end = -1;\n\t\tlet matchedSlash = true;\n\t\t// Track the state of characters (if any) we see before our first dot and\n\t\t// after any path separator we find\n\t\tlet preDotState = 0;\n\t\tfor (let i = path.length - 1; i >= 0; --i) {\n\t\t\tconst code = path.charCodeAt(i);\n\t\t\tif (code === CHAR_FORWARD_SLASH) {\n\t\t\t\t// If we reached a path separator that was not part of a set of path\n\t\t\t\t// separators at the end of the string, stop now\n\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\tstartPart = i + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (end === -1) {\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\n\t\t\t\t// extension\n\t\t\t\tmatchedSlash = false;\n\t\t\t\tend = i + 1;\n\t\t\t}\n\t\t\tif (code === CHAR_DOT) {\n\t\t\t\t// If this is our first dot, mark it as the start of our extension\n\t\t\t\tif (startDot === -1) {\n\t\t\t\t\tstartDot = i;\n\t\t\t\t}\n\t\t\t\telse if (preDotState !== 1) {\n\t\t\t\t\tpreDotState = 1;\n\t\t\t\t}\n\t\t\t} else if (startDot !== -1) {\n\t\t\t\t// We saw a non-dot and non-path separator before our dot, so we should\n\t\t\t\t// have a good chance at having a non-empty extension\n\t\t\t\tpreDotState = -1;\n\t\t\t}\n\t\t}\n\n\t\tif (startDot === -1 ||\n\t\t\tend === -1 ||\n\t\t\t// We saw a non-dot character immediately before the dot\n\t\t\tpreDotState === 0 ||\n\t\t\t// The (right-most) trimmed path component is exactly '..'\n\t\t\t(preDotState === 1 &&\n\t\t\t\tstartDot === end - 1 &&\n\t\t\t\tstartDot === startPart + 1)) {\n\t\t\treturn '';\n\t\t}\n\t\treturn path.slice(startDot, end);\n\t},\n\n\tformat: _format.bind(null, '/'),\n\n\tparse(path: string): ParsedPath {\n\t\tvalidateString(path, 'path');\n\n\t\tconst ret = { root: '', dir: '', base: '', ext: '', name: '' };\n\t\tif (path.length === 0) {\n\t\t\treturn ret;\n\t\t}\n\t\tconst isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n\t\tlet start;\n\t\tif (isAbsolute) {\n\t\t\tret.root = '/';\n\t\t\tstart = 1;\n\t\t} else {\n\t\t\tstart = 0;\n\t\t}\n\t\tlet startDot = -1;\n\t\tlet startPart = 0;\n\t\tlet end = -1;\n\t\tlet matchedSlash = true;\n\t\tlet i = path.length - 1;\n\n\t\t// Track the state of characters (if any) we see before our first dot and\n\t\t// after any path separator we find\n\t\tlet preDotState = 0;\n\n\t\t// Get non-dir info\n\t\tfor (; i >= start; --i) {\n\t\t\tconst code = path.charCodeAt(i);\n\t\t\tif (code === CHAR_FORWARD_SLASH) {\n\t\t\t\t// If we reached a path separator that was not part of a set of path\n\t\t\t\t// separators at the end of the string, stop now\n\t\t\t\tif (!matchedSlash) {\n\t\t\t\t\tstartPart = i + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (end === -1) {\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\n\t\t\t\t// extension\n\t\t\t\tmatchedSlash = false;\n\t\t\t\tend = i + 1;\n\t\t\t}\n\t\t\tif (code === CHAR_DOT) {\n\t\t\t\t// If this is our first dot, mark it as the start of our extension\n\t\t\t\tif (startDot === -1) {\n\t\t\t\t\tstartDot = i;\n\t\t\t\t} else if (preDotState !== 1) {\n\t\t\t\t\tpreDotState = 1;\n\t\t\t\t}\n\t\t\t} else if (startDot !== -1) {\n\t\t\t\t// We saw a non-dot and non-path separator before our dot, so we should\n\t\t\t\t// have a good chance at having a non-empty extension\n\t\t\t\tpreDotState = -1;\n\t\t\t}\n\t\t}\n\n\t\tif (end !== -1) {\n\t\t\tconst start = startPart === 0 && isAbsolute ? 1 : startPart;\n\t\t\tif (startDot === -1 ||\n\t\t\t\t// We saw a non-dot character immediately before the dot\n\t\t\t\tpreDotState === 0 ||\n\t\t\t\t// The (right-most) trimmed path component is exactly '..'\n\t\t\t\t(preDotState === 1 &&\n\t\t\t\t\tstartDot === end - 1 &&\n\t\t\t\t\tstartDot === startPart + 1)) {\n\t\t\t\tret.base = ret.name = path.slice(start, end);\n\t\t\t} else {\n\t\t\t\tret.name = path.slice(start, startDot);\n\t\t\t\tret.base = path.slice(start, end);\n\t\t\t\tret.ext = path.slice(startDot, end);\n\t\t\t}\n\t\t}\n\n\t\tif (startPart > 0) {\n\t\t\tret.dir = path.slice(0, startPart - 1);\n\t\t} else if (isAbsolute) {\n\t\t\tret.dir = '/';\n\t\t}\n\n\t\treturn ret;\n\t},\n\n\tsep: '/',\n\tdelimiter: ':',\n\twin32: null,\n\tposix: null\n};\n\nposix.win32 = win32.win32 = win32;\nposix.posix = win32.posix = posix;\n\nexport const normalize = (platformIsWin32 ? win32.normalize : posix.normalize);\nexport const join = (platformIsWin32 ? win32.join : posix.join);\nexport const resolve = (platformIsWin32 ? win32.resolve : posix.resolve);\nexport const relative = (platformIsWin32 ? win32.relative : posix.relative);\nexport const dirname = (platformIsWin32 ? win32.dirname : posix.dirname);\nexport const basename = (platformIsWin32 ? win32.basename : posix.basename);\nexport const extname = (platformIsWin32 ? win32.extname : posix.extname);\nexport const sep = (platformIsWin32 ? win32.sep : posix.sep);\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\nimport { MarshalledId } from 'vs/base/common/marshallingIds';\nimport * as paths from 'vs/base/common/path';\nimport { isWindows } from 'vs/base/common/platform';\n\nconst _schemePattern = /^\\w[\\w\\d+.-]*$/;\nconst _singleSlashStart = /^\\//;\nconst _doubleSlashStart = /^\\/\\//;\n\nfunction _validateUri(ret: URI, _strict?: boolean): void {\n\n\t// scheme, must be set\n\tif (!ret.scheme && _strict) {\n\t\tthrow new Error(`[UriError]: Scheme is missing: {scheme: \"\", authority: \"${ret.authority}\", path: \"${ret.path}\", query: \"${ret.query}\", fragment: \"${ret.fragment}\"}`);\n\t}\n\n\t// scheme, https://tools.ietf.org/html/rfc3986#section-3.1\n\t// ALPHA *( ALPHA / DIGIT / \"+\" / \"-\" / \".\" )\n\tif (ret.scheme && !_schemePattern.test(ret.scheme)) {\n\t\tthrow new Error('[UriError]: Scheme contains illegal characters.');\n\t}\n\n\t// path, http://tools.ietf.org/html/rfc3986#section-3.3\n\t// If a URI contains an authority component, then the path component\n\t// must either be empty or begin with a slash (\"/\") character.  If a URI\n\t// does not contain an authority component, then the path cannot begin\n\t// with two slash characters (\"//\").\n\tif (ret.path) {\n\t\tif (ret.authority) {\n\t\t\tif (!_singleSlashStart.test(ret.path)) {\n\t\t\t\tthrow new Error('[UriError]: If a URI contains an authority component, then the path component must either be empty or begin with a slash (\"/\") character');\n\t\t\t}\n\t\t} else {\n\t\t\tif (_doubleSlashStart.test(ret.path)) {\n\t\t\t\tthrow new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters (\"//\")');\n\t\t\t}\n\t\t}\n\t}\n}\n\n// for a while we allowed uris *without* schemes and this is the migration\n// for them, e.g. an uri without scheme and without strict-mode warns and falls\n// back to the file-scheme. that should cause the least carnage and still be a\n// clear warning\nfunction _schemeFix(scheme: string, _strict: boolean): string {\n\tif (!scheme && !_strict) {\n\t\treturn 'file';\n\t}\n\treturn scheme;\n}\n\n// implements a bit of https://tools.ietf.org/html/rfc3986#section-5\nfunction _referenceResolution(scheme: string, path: string): string {\n\n\t// the slash-character is our 'default base' as we don't\n\t// support constructing URIs relative to other URIs. This\n\t// also means that we alter and potentially break paths.\n\t// see https://tools.ietf.org/html/rfc3986#section-5.1.4\n\tswitch (scheme) {\n\t\tcase 'https':\n\t\tcase 'http':\n\t\tcase 'file':\n\t\t\tif (!path) {\n\t\t\t\tpath = _slash;\n\t\t\t} else if (path[0] !== _slash) {\n\t\t\t\tpath = _slash + path;\n\t\t\t}\n\t\t\tbreak;\n\t}\n\treturn path;\n}\n\nconst _empty = '';\nconst _slash = '/';\nconst _regexp = /^(([^:/?#]+?):)?(\\/\\/([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?/;\n\n/**\n * Uniform Resource Identifier (URI) http://tools.ietf.org/html/rfc3986.\n * This class is a simple parser which creates the basic component parts\n * (http://tools.ietf.org/html/rfc3986#section-3) with minimal validation\n * and encoding.\n *\n * ```txt\n *       foo://example.com:8042/over/there?name=ferret#nose\n *       \\_/   \\______________/\\_________/ \\_________/ \\__/\n *        |           |            |            |        |\n *     scheme     authority       path        query   fragment\n *        |   _____________________|__\n *       / \\ /                        \\\n *       urn:example:animal:ferret:nose\n * ```\n */\nexport class URI implements UriComponents {\n\n\tstatic isUri(thing: any): thing is URI {\n\t\tif (thing instanceof URI) {\n\t\t\treturn true;\n\t\t}\n\t\tif (!thing) {\n\t\t\treturn false;\n\t\t}\n\t\treturn typeof (<URI>thing).authority === 'string'\n\t\t\t&& typeof (<URI>thing).fragment === 'string'\n\t\t\t&& typeof (<URI>thing).path === 'string'\n\t\t\t&& typeof (<URI>thing).query === 'string'\n\t\t\t&& typeof (<URI>thing).scheme === 'string'\n\t\t\t&& typeof (<URI>thing).fsPath === 'string'\n\t\t\t&& typeof (<URI>thing).with === 'function'\n\t\t\t&& typeof (<URI>thing).toString === 'function';\n\t}\n\n\t/**\n\t * scheme is the 'http' part of 'http://www.example.com/some/path?query#fragment'.\n\t * The part before the first colon.\n\t */\n\treadonly scheme: string;\n\n\t/**\n\t * authority is the 'www.example.com' part of 'http://www.example.com/some/path?query#fragment'.\n\t * The part between the first double slashes and the next slash.\n\t */\n\treadonly authority: string;\n\n\t/**\n\t * path is the '/some/path' part of 'http://www.example.com/some/path?query#fragment'.\n\t */\n\treadonly path: string;\n\n\t/**\n\t * query is the 'query' part of 'http://www.example.com/some/path?query#fragment'.\n\t */\n\treadonly query: string;\n\n\t/**\n\t * fragment is the 'fragment' part of 'http://www.example.com/some/path?query#fragment'.\n\t */\n\treadonly fragment: string;\n\n\t/**\n\t * @internal\n\t */\n\tprotected constructor(scheme: string, authority?: string, path?: string, query?: string, fragment?: string, _strict?: boolean);\n\n\t/**\n\t * @internal\n\t */\n\tprotected constructor(components: UriComponents);\n\n\t/**\n\t * @internal\n\t */\n\tprotected constructor(schemeOrData: string | UriComponents, authority?: string, path?: string, query?: string, fragment?: string, _strict: boolean = false) {\n\n\t\tif (typeof schemeOrData === 'object') {\n\t\t\tthis.scheme = schemeOrData.scheme || _empty;\n\t\t\tthis.authority = schemeOrData.authority || _empty;\n\t\t\tthis.path = schemeOrData.path || _empty;\n\t\t\tthis.query = schemeOrData.query || _empty;\n\t\t\tthis.fragment = schemeOrData.fragment || _empty;\n\t\t\t// no validation because it's this URI\n\t\t\t// that creates uri components.\n\t\t\t// _validateUri(this);\n\t\t} else {\n\t\t\tthis.scheme = _schemeFix(schemeOrData, _strict);\n\t\t\tthis.authority = authority || _empty;\n\t\t\tthis.path = _referenceResolution(this.scheme, path || _empty);\n\t\t\tthis.query = query || _empty;\n\t\t\tthis.fragment = fragment || _empty;\n\n\t\t\t_validateUri(this, _strict);\n\t\t}\n\t}\n\n\t// ---- filesystem path -----------------------\n\n\t/**\n\t * Returns a string representing the corresponding file system path of this URI.\n\t * Will handle UNC paths, normalizes windows drive letters to lower-case, and uses the\n\t * platform specific path separator.\n\t *\n\t * * Will *not* validate the path for invalid characters and semantics.\n\t * * Will *not* look at the scheme of this URI.\n\t * * The result shall *not* be used for display purposes but for accessing a file on disk.\n\t *\n\t *\n\t * The *difference* to `URI#path` is the use of the platform specific separator and the handling\n\t * of UNC paths. See the below sample of a file-uri with an authority (UNC path).\n\t *\n\t * ```ts\n\t\tconst u = URI.parse('file://server/c$/folder/file.txt')\n\t\tu.authority === 'server'\n\t\tu.path === '/shares/c$/file.txt'\n\t\tu.fsPath === '\\\\server\\c$\\folder\\file.txt'\n\t```\n\t *\n\t * Using `URI#path` to read a file (using fs-apis) would not be enough because parts of the path,\n\t * namely the server name, would be missing. Therefore `URI#fsPath` exists - it's sugar to ease working\n\t * with URIs that represent files on disk (`file` scheme).\n\t */\n\tget fsPath(): string {\n\t\t// if (this.scheme !== 'file') {\n\t\t// \tconsole.warn(`[UriError] calling fsPath with scheme ${this.scheme}`);\n\t\t// }\n\t\treturn uriToFsPath(this, false);\n\t}\n\n\t// ---- modify to new -------------------------\n\n\twith(change: { scheme?: string; authority?: string | null; path?: string | null; query?: string | null; fragment?: string | null }): URI {\n\n\t\tif (!change) {\n\t\t\treturn this;\n\t\t}\n\n\t\tlet { scheme, authority, path, query, fragment } = change;\n\t\tif (scheme === undefined) {\n\t\t\tscheme = this.scheme;\n\t\t} else if (scheme === null) {\n\t\t\tscheme = _empty;\n\t\t}\n\t\tif (authority === undefined) {\n\t\t\tauthority = this.authority;\n\t\t} else if (authority === null) {\n\t\t\tauthority = _empty;\n\t\t}\n\t\tif (path === undefined) {\n\t\t\tpath = this.path;\n\t\t} else if (path === null) {\n\t\t\tpath = _empty;\n\t\t}\n\t\tif (query === undefined) {\n\t\t\tquery = this.query;\n\t\t} else if (query === null) {\n\t\t\tquery = _empty;\n\t\t}\n\t\tif (fragment === undefined) {\n\t\t\tfragment = this.fragment;\n\t\t} else if (fragment === null) {\n\t\t\tfragment = _empty;\n\t\t}\n\n\t\tif (scheme === this.scheme\n\t\t\t&& authority === this.authority\n\t\t\t&& path === this.path\n\t\t\t&& query === this.query\n\t\t\t&& fragment === this.fragment) {\n\n\t\t\treturn this;\n\t\t}\n\n\t\treturn new Uri(scheme, authority, path, query, fragment);\n\t}\n\n\t// ---- parse & validate ------------------------\n\n\t/**\n\t * Creates a new URI from a string, e.g. `http://www.example.com/some/path`,\n\t * `file:///usr/home`, or `scheme:with/path`.\n\t *\n\t * @param value A string which represents an URI (see `URI#toString`).\n\t */\n\tstatic parse(value: string, _strict: boolean = false): URI {\n\t\tconst match = _regexp.exec(value);\n\t\tif (!match) {\n\t\t\treturn new Uri(_empty, _empty, _empty, _empty, _empty);\n\t\t}\n\t\treturn new Uri(\n\t\t\tmatch[2] || _empty,\n\t\t\tpercentDecode(match[4] || _empty),\n\t\t\tpercentDecode(match[5] || _empty),\n\t\t\tpercentDecode(match[7] || _empty),\n\t\t\tpercentDecode(match[9] || _empty),\n\t\t\t_strict\n\t\t);\n\t}\n\n\t/**\n\t * Creates a new URI from a file system path, e.g. `c:\\my\\files`,\n\t * `/usr/home`, or `\\\\server\\share\\some\\path`.\n\t *\n\t * The *difference* between `URI#parse` and `URI#file` is that the latter treats the argument\n\t * as path, not as stringified-uri. E.g. `URI.file(path)` is **not the same as**\n\t * `URI.parse('file://' + path)` because the path might contain characters that are\n\t * interpreted (# and ?). See the following sample:\n\t * ```ts\n\tconst good = URI.file('/coding/c#/project1');\n\tgood.scheme === 'file';\n\tgood.path === '/coding/c#/project1';\n\tgood.fragment === '';\n\tconst bad = URI.parse('file://' + '/coding/c#/project1');\n\tbad.scheme === 'file';\n\tbad.path === '/coding/c'; // path is now broken\n\tbad.fragment === '/project1';\n\t```\n\t *\n\t * @param path A file system path (see `URI#fsPath`)\n\t */\n\tstatic file(path: string): URI {\n\n\t\tlet authority = _empty;\n\n\t\t// normalize to fwd-slashes on windows,\n\t\t// on other systems bwd-slashes are valid\n\t\t// filename character, eg /f\\oo/ba\\r.txt\n\t\tif (isWindows) {\n\t\t\tpath = path.replace(/\\\\/g, _slash);\n\t\t}\n\n\t\t// check for authority as used in UNC shares\n\t\t// or use the path as given\n\t\tif (path[0] === _slash && path[1] === _slash) {\n\t\t\tconst idx = path.indexOf(_slash, 2);\n\t\t\tif (idx === -1) {\n\t\t\t\tauthority = path.substring(2);\n\t\t\t\tpath = _slash;\n\t\t\t} else {\n\t\t\t\tauthority = path.substring(2, idx);\n\t\t\t\tpath = path.substring(idx) || _slash;\n\t\t\t}\n\t\t}\n\n\t\treturn new Uri('file', authority, path, _empty, _empty);\n\t}\n\n\t/**\n\t * Creates new URI from uri components.\n\t *\n\t * Unless `strict` is `true` the scheme is defaults to be `file`. This function performs\n\t * validation and should be used for untrusted uri components retrieved from storage,\n\t * user input, command arguments etc\n\t */\n\tstatic from(components: UriComponents, strict?: boolean): URI {\n\t\tconst result = new Uri(\n\t\t\tcomponents.scheme,\n\t\t\tcomponents.authority,\n\t\t\tcomponents.path,\n\t\t\tcomponents.query,\n\t\t\tcomponents.fragment,\n\t\t\tstrict\n\t\t);\n\t\treturn result;\n\t}\n\n\t/**\n\t * Join a URI path with path fragments and normalizes the resulting path.\n\t *\n\t * @param uri The input URI.\n\t * @param pathFragment The path fragment to add to the URI path.\n\t * @returns The resulting URI.\n\t */\n\tstatic joinPath(uri: URI, ...pathFragment: string[]): URI {\n\t\tif (!uri.path) {\n\t\t\tthrow new Error(`[UriError]: cannot call joinPath on URI without path`);\n\t\t}\n\t\tlet newPath: string;\n\t\tif (isWindows && uri.scheme === 'file') {\n\t\t\tnewPath = URI.file(paths.win32.join(uriToFsPath(uri, true), ...pathFragment)).path;\n\t\t} else {\n\t\t\tnewPath = paths.posix.join(uri.path, ...pathFragment);\n\t\t}\n\t\treturn uri.with({ path: newPath });\n\t}\n\n\t// ---- printing/externalize ---------------------------\n\n\t/**\n\t * Creates a string representation for this URI. It's guaranteed that calling\n\t * `URI.parse` with the result of this function creates an URI which is equal\n\t * to this URI.\n\t *\n\t * * The result shall *not* be used for display purposes but for externalization or transport.\n\t * * The result will be encoded using the percentage encoding and encoding happens mostly\n\t * ignore the scheme-specific encoding rules.\n\t *\n\t * @param skipEncoding Do not encode the result, default is `false`\n\t */\n\ttoString(skipEncoding: boolean = false): string {\n\t\treturn _asFormatted(this, skipEncoding);\n\t}\n\n\ttoJSON(): UriComponents {\n\t\treturn this;\n\t}\n\n\t/**\n\t * A helper function to revive URIs.\n\t *\n\t * **Note** that this function should only be used when receiving URI#toJSON generated data\n\t * and that it doesn't do any validation. Use {@link URI.from} when received \"untrusted\"\n\t * uri components such as command arguments or data from storage.\n\t *\n\t * @param data The URI components or URI to revive.\n\t * @returns The revived URI or undefined or null.\n\t */\n\tstatic revive(data: UriComponents | URI): URI;\n\tstatic revive(data: UriComponents | URI | undefined): URI | undefined;\n\tstatic revive(data: UriComponents | URI | null): URI | null;\n\tstatic revive(data: UriComponents | URI | undefined | null): URI | undefined | null;\n\tstatic revive(data: UriComponents | URI | undefined | null): URI | undefined | null {\n\t\tif (!data) {\n\t\t\treturn data;\n\t\t} else if (data instanceof URI) {\n\t\t\treturn data;\n\t\t} else {\n\t\t\tconst result = new Uri(data);\n\t\t\tresult._formatted = (<UriState>data).external ?? null;\n\t\t\tresult._fsPath = (<UriState>data)._sep === _pathSepMarker ? (<UriState>data).fsPath ?? null : null;\n\t\t\treturn result;\n\t\t}\n\t}\n}\n\nexport interface UriComponents {\n\tscheme: string;\n\tauthority?: string;\n\tpath?: string;\n\tquery?: string;\n\tfragment?: string;\n}\n\ninterface UriState extends UriComponents {\n\t$mid: MarshalledId.Uri;\n\texternal?: string;\n\tfsPath?: string;\n\t_sep?: 1;\n}\n\nconst _pathSepMarker = isWindows ? 1 : undefined;\n\n// This class exists so that URI is compatible with vscode.Uri (API).\nclass Uri extends URI {\n\n\t_formatted: string | null = null;\n\t_fsPath: string | null = null;\n\n\toverride get fsPath(): string {\n\t\tif (!this._fsPath) {\n\t\t\tthis._fsPath = uriToFsPath(this, false);\n\t\t}\n\t\treturn this._fsPath;\n\t}\n\n\toverride toString(skipEncoding: boolean = false): string {\n\t\tif (!skipEncoding) {\n\t\t\tif (!this._formatted) {\n\t\t\t\tthis._formatted = _asFormatted(this, false);\n\t\t\t}\n\t\t\treturn this._formatted;\n\t\t} else {\n\t\t\t// we don't cache that\n\t\t\treturn _asFormatted(this, true);\n\t\t}\n\t}\n\n\toverride toJSON(): UriComponents {\n\t\tconst res = <UriState>{\n\t\t\t$mid: MarshalledId.Uri\n\t\t};\n\t\t// cached state\n\t\tif (this._fsPath) {\n\t\t\tres.fsPath = this._fsPath;\n\t\t\tres._sep = _pathSepMarker;\n\t\t}\n\t\tif (this._formatted) {\n\t\t\tres.external = this._formatted;\n\t\t}\n\t\t//--- uri components\n\t\tif (this.path) {\n\t\t\tres.path = this.path;\n\t\t}\n\t\t// TODO\n\t\t// this isn't correct and can violate the UriComponents contract but\n\t\t// this is part of the vscode.Uri API and we shouldn't change how that\n\t\t// works anymore\n\t\tif (this.scheme) {\n\t\t\tres.scheme = this.scheme;\n\t\t}\n\t\tif (this.authority) {\n\t\t\tres.authority = this.authority;\n\t\t}\n\t\tif (this.query) {\n\t\t\tres.query = this.query;\n\t\t}\n\t\tif (this.fragment) {\n\t\t\tres.fragment = this.fragment;\n\t\t}\n\t\treturn res;\n\t}\n}\n\n// reserved characters: https://tools.ietf.org/html/rfc3986#section-2.2\nconst encodeTable: { [ch: number]: string } = {\n\t[CharCode.Colon]: '%3A', // gen-delims\n\t[CharCode.Slash]: '%2F',\n\t[CharCode.QuestionMark]: '%3F',\n\t[CharCode.Hash]: '%23',\n\t[CharCode.OpenSquareBracket]: '%5B',\n\t[CharCode.CloseSquareBracket]: '%5D',\n\t[CharCode.AtSign]: '%40',\n\n\t[CharCode.ExclamationMark]: '%21', // sub-delims\n\t[CharCode.DollarSign]: '%24',\n\t[CharCode.Ampersand]: '%26',\n\t[CharCode.SingleQuote]: '%27',\n\t[CharCode.OpenParen]: '%28',\n\t[CharCode.CloseParen]: '%29',\n\t[CharCode.Asterisk]: '%2A',\n\t[CharCode.Plus]: '%2B',\n\t[CharCode.Comma]: '%2C',\n\t[CharCode.Semicolon]: '%3B',\n\t[CharCode.Equals]: '%3D',\n\n\t[CharCode.Space]: '%20',\n};\n\nfunction encodeURIComponentFast(uriComponent: string, isPath: boolean, isAuthority: boolean): string {\n\tlet res: string | undefined = undefined;\n\tlet nativeEncodePos = -1;\n\n\tfor (let pos = 0; pos < uriComponent.length; pos++) {\n\t\tconst code = uriComponent.charCodeAt(pos);\n\n\t\t// unreserved characters: https://tools.ietf.org/html/rfc3986#section-2.3\n\t\tif (\n\t\t\t(code >= CharCode.a && code <= CharCode.z)\n\t\t\t|| (code >= CharCode.A && code <= CharCode.Z)\n\t\t\t|| (code >= CharCode.Digit0 && code <= CharCode.Digit9)\n\t\t\t|| code === CharCode.Dash\n\t\t\t|| code === CharCode.Period\n\t\t\t|| code === CharCode.Underline\n\t\t\t|| code === CharCode.Tilde\n\t\t\t|| (isPath && code === CharCode.Slash)\n\t\t\t|| (isAuthority && code === CharCode.OpenSquareBracket)\n\t\t\t|| (isAuthority && code === CharCode.CloseSquareBracket)\n\t\t\t|| (isAuthority && code === CharCode.Colon)\n\t\t) {\n\t\t\t// check if we are delaying native encode\n\t\t\tif (nativeEncodePos !== -1) {\n\t\t\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\n\t\t\t\tnativeEncodePos = -1;\n\t\t\t}\n\t\t\t// check if we write into a new string (by default we try to return the param)\n\t\t\tif (res !== undefined) {\n\t\t\t\tres += uriComponent.charAt(pos);\n\t\t\t}\n\n\t\t} else {\n\t\t\t// encoding needed, we need to allocate a new string\n\t\t\tif (res === undefined) {\n\t\t\t\tres = uriComponent.substr(0, pos);\n\t\t\t}\n\n\t\t\t// check with default table first\n\t\t\tconst escaped = encodeTable[code];\n\t\t\tif (escaped !== undefined) {\n\n\t\t\t\t// check if we are delaying native encode\n\t\t\t\tif (nativeEncodePos !== -1) {\n\t\t\t\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\n\t\t\t\t\tnativeEncodePos = -1;\n\t\t\t\t}\n\n\t\t\t\t// append escaped variant to result\n\t\t\t\tres += escaped;\n\n\t\t\t} else if (nativeEncodePos === -1) {\n\t\t\t\t// use native encode only when needed\n\t\t\t\tnativeEncodePos = pos;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (nativeEncodePos !== -1) {\n\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos));\n\t}\n\n\treturn res !== undefined ? res : uriComponent;\n}\n\nfunction encodeURIComponentMinimal(path: string): string {\n\tlet res: string | undefined = undefined;\n\tfor (let pos = 0; pos < path.length; pos++) {\n\t\tconst code = path.charCodeAt(pos);\n\t\tif (code === CharCode.Hash || code === CharCode.QuestionMark) {\n\t\t\tif (res === undefined) {\n\t\t\t\tres = path.substr(0, pos);\n\t\t\t}\n\t\t\tres += encodeTable[code];\n\t\t} else {\n\t\t\tif (res !== undefined) {\n\t\t\t\tres += path[pos];\n\t\t\t}\n\t\t}\n\t}\n\treturn res !== undefined ? res : path;\n}\n\n/**\n * Compute `fsPath` for the given uri\n */\nexport function uriToFsPath(uri: URI, keepDriveLetterCasing: boolean): string {\n\n\tlet value: string;\n\tif (uri.authority && uri.path.length > 1 && uri.scheme === 'file') {\n\t\t// unc path: file://shares/c$/far/boo\n\t\tvalue = `//${uri.authority}${uri.path}`;\n\t} else if (\n\t\turi.path.charCodeAt(0) === CharCode.Slash\n\t\t&& (uri.path.charCodeAt(1) >= CharCode.A && uri.path.charCodeAt(1) <= CharCode.Z || uri.path.charCodeAt(1) >= CharCode.a && uri.path.charCodeAt(1) <= CharCode.z)\n\t\t&& uri.path.charCodeAt(2) === CharCode.Colon\n\t) {\n\t\tif (!keepDriveLetterCasing) {\n\t\t\t// windows drive letter: file:///c:/far/boo\n\t\t\tvalue = uri.path[1].toLowerCase() + uri.path.substr(2);\n\t\t} else {\n\t\t\tvalue = uri.path.substr(1);\n\t\t}\n\t} else {\n\t\t// other path\n\t\tvalue = uri.path;\n\t}\n\tif (isWindows) {\n\t\tvalue = value.replace(/\\//g, '\\\\');\n\t}\n\treturn value;\n}\n\n/**\n * Create the external version of a uri\n */\nfunction _asFormatted(uri: URI, skipEncoding: boolean): string {\n\n\tconst encoder = !skipEncoding\n\t\t? encodeURIComponentFast\n\t\t: encodeURIComponentMinimal;\n\n\tlet res = '';\n\tlet { scheme, authority, path, query, fragment } = uri;\n\tif (scheme) {\n\t\tres += scheme;\n\t\tres += ':';\n\t}\n\tif (authority || scheme === 'file') {\n\t\tres += _slash;\n\t\tres += _slash;\n\t}\n\tif (authority) {\n\t\tlet idx = authority.indexOf('@');\n\t\tif (idx !== -1) {\n\t\t\t// <user>@<auth>\n\t\t\tconst userinfo = authority.substr(0, idx);\n\t\t\tauthority = authority.substr(idx + 1);\n\t\t\tidx = userinfo.lastIndexOf(':');\n\t\t\tif (idx === -1) {\n\t\t\t\tres += encoder(userinfo, false, false);\n\t\t\t} else {\n\t\t\t\t// <user>:<pass>@<auth>\n\t\t\t\tres += encoder(userinfo.substr(0, idx), false, false);\n\t\t\t\tres += ':';\n\t\t\t\tres += encoder(userinfo.substr(idx + 1), false, true);\n\t\t\t}\n\t\t\tres += '@';\n\t\t}\n\t\tauthority = authority.toLowerCase();\n\t\tidx = authority.lastIndexOf(':');\n\t\tif (idx === -1) {\n\t\t\tres += encoder(authority, false, true);\n\t\t} else {\n\t\t\t// <auth>:<port>\n\t\t\tres += encoder(authority.substr(0, idx), false, true);\n\t\t\tres += authority.substr(idx);\n\t\t}\n\t}\n\tif (path) {\n\t\t// lower-case windows drive letters in /C:/fff or C:/fff\n\t\tif (path.length >= 3 && path.charCodeAt(0) === CharCode.Slash && path.charCodeAt(2) === CharCode.Colon) {\n\t\t\tconst code = path.charCodeAt(1);\n\t\t\tif (code >= CharCode.A && code <= CharCode.Z) {\n\t\t\t\tpath = `/${String.fromCharCode(code + 32)}:${path.substr(3)}`; // \"/c:\".length === 3\n\t\t\t}\n\t\t} else if (path.length >= 2 && path.charCodeAt(1) === CharCode.Colon) {\n\t\t\tconst code = path.charCodeAt(0);\n\t\t\tif (code >= CharCode.A && code <= CharCode.Z) {\n\t\t\t\tpath = `${String.fromCharCode(code + 32)}:${path.substr(2)}`; // \"/c:\".length === 3\n\t\t\t}\n\t\t}\n\t\t// encode the rest of the path\n\t\tres += encoder(path, true, false);\n\t}\n\tif (query) {\n\t\tres += '?';\n\t\tres += encoder(query, false, false);\n\t}\n\tif (fragment) {\n\t\tres += '#';\n\t\tres += !skipEncoding ? encodeURIComponentFast(fragment, false, false) : fragment;\n\t}\n\treturn res;\n}\n\n// --- decode\n\nfunction decodeURIComponentGraceful(str: string): string {\n\ttry {\n\t\treturn decodeURIComponent(str);\n\t} catch {\n\t\tif (str.length > 3) {\n\t\t\treturn str.substr(0, 3) + decodeURIComponentGraceful(str.substr(3));\n\t\t} else {\n\t\t\treturn str;\n\t\t}\n\t}\n}\n\nconst _rEncodedAsHex = /(%[0-9A-Za-z][0-9A-Za-z])+/g;\n\nfunction percentDecode(str: string): string {\n\tif (!str.match(_rEncodedAsHex)) {\n\t\treturn str;\n\t}\n\treturn str.replace(_rEncodedAsHex, (match) => decodeURIComponentGraceful(match));\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport * as errors from 'vs/base/common/errors';\nimport * as platform from 'vs/base/common/platform';\nimport { equalsIgnoreCase, startsWithIgnoreCase } from 'vs/base/common/strings';\nimport { URI } from 'vs/base/common/uri';\nimport * as paths from 'vs/base/common/path';\n\nexport namespace Schemas {\n\n\t/**\n\t * A schema that is used for models that exist in memory\n\t * only and that have no correspondence on a server or such.\n\t */\n\texport const inMemory = 'inmemory';\n\n\t/**\n\t * A schema that is used for setting files\n\t */\n\texport const vscode = 'vscode';\n\n\t/**\n\t * A schema that is used for internal private files\n\t */\n\texport const internal = 'private';\n\n\t/**\n\t * A walk-through document.\n\t */\n\texport const walkThrough = 'walkThrough';\n\n\t/**\n\t * An embedded code snippet.\n\t */\n\texport const walkThroughSnippet = 'walkThroughSnippet';\n\n\texport const http = 'http';\n\n\texport const https = 'https';\n\n\texport const file = 'file';\n\n\texport const mailto = 'mailto';\n\n\texport const untitled = 'untitled';\n\n\texport const data = 'data';\n\n\texport const command = 'command';\n\n\texport const vscodeRemote = 'vscode-remote';\n\n\texport const vscodeRemoteResource = 'vscode-remote-resource';\n\n\texport const vscodeManagedRemoteResource = 'vscode-managed-remote-resource';\n\n\texport const vscodeUserData = 'vscode-userdata';\n\n\texport const vscodeCustomEditor = 'vscode-custom-editor';\n\n\texport const vscodeNotebookCell = 'vscode-notebook-cell';\n\texport const vscodeNotebookCellMetadata = 'vscode-notebook-cell-metadata';\n\texport const vscodeNotebookCellMetadataDiff = 'vscode-notebook-cell-metadata-diff';\n\texport const vscodeNotebookCellOutput = 'vscode-notebook-cell-output';\n\texport const vscodeNotebookCellOutputDiff = 'vscode-notebook-cell-output-diff';\n\texport const vscodeNotebookMetadata = 'vscode-notebook-metadata';\n\texport const vscodeInteractiveInput = 'vscode-interactive-input';\n\n\texport const vscodeSettings = 'vscode-settings';\n\n\texport const vscodeWorkspaceTrust = 'vscode-workspace-trust';\n\n\texport const vscodeTerminal = 'vscode-terminal';\n\n\t/** Scheme used for code blocks in chat. */\n\texport const vscodeChatCodeBlock = 'vscode-chat-code-block';\n\n\t/** Scheme used for LHS of code compare (aka diff) blocks in chat. */\n\texport const vscodeChatCodeCompareBlock = 'vscode-chat-code-compare-block';\n\n\t/** Scheme used for the chat input editor. */\n\texport const vscodeChatSesssion = 'vscode-chat-editor';\n\n\t/**\n\t * Scheme used internally for webviews that aren't linked to a resource (i.e. not custom editors)\n\t */\n\texport const webviewPanel = 'webview-panel';\n\n\t/**\n\t * Scheme used for loading the wrapper html and script in webviews.\n\t */\n\texport const vscodeWebview = 'vscode-webview';\n\n\t/**\n\t * Scheme used for extension pages\n\t */\n\texport const extension = 'extension';\n\n\t/**\n\t * Scheme used as a replacement of `file` scheme to load\n\t * files with our custom protocol handler (desktop only).\n\t */\n\texport const vscodeFileResource = 'vscode-file';\n\n\t/**\n\t * Scheme used for temporary resources\n\t */\n\texport const tmp = 'tmp';\n\n\t/**\n\t * Scheme used vs live share\n\t */\n\texport const vsls = 'vsls';\n\n\t/**\n\t * Scheme used for the Source Control commit input's text document\n\t */\n\texport const vscodeSourceControl = 'vscode-scm';\n\n\t/**\n\t * Scheme used for input box for creating comments.\n\t */\n\texport const commentsInput = 'comment';\n\n\t/**\n\t * Scheme used for special rendering of settings in the release notes\n\t */\n\texport const codeSetting = 'code-setting';\n\n\t/**\n\t * Scheme used for output panel resources\n\t */\n\texport const outputChannel = 'output';\n}\n\nexport function matchesScheme(target: URI | string, scheme: string): boolean {\n\tif (URI.isUri(target)) {\n\t\treturn equalsIgnoreCase(target.scheme, scheme);\n\t} else {\n\t\treturn startsWithIgnoreCase(target, scheme + ':');\n\t}\n}\n\nexport function matchesSomeScheme(target: URI | string, ...schemes: string[]): boolean {\n\treturn schemes.some(scheme => matchesScheme(target, scheme));\n}\nexport const connectionTokenQueryName = 'tkn';\n\nclass RemoteAuthoritiesImpl {\n\tprivate readonly _hosts: { [authority: string]: string | undefined } = Object.create(null);\n\tprivate readonly _ports: { [authority: string]: number | undefined } = Object.create(null);\n\tprivate readonly _connectionTokens: { [authority: string]: string | undefined } = Object.create(null);\n\tprivate _preferredWebSchema: 'http' | 'https' = 'http';\n\tprivate _delegate: ((uri: URI) => URI) | null = null;\n\tprivate _serverRootPath: string = '/';\n\n\tsetPreferredWebSchema(schema: 'http' | 'https') {\n\t\tthis._preferredWebSchema = schema;\n\t}\n\n\tprivate get _remoteResourcesPath(): string {\n\t\treturn paths.posix.join(this._serverRootPath, Schemas.vscodeRemoteResource);\n\t}\n\n\trewrite(uri: URI): URI {\n\t\tif (this._delegate) {\n\t\t\ttry {\n\t\t\t\treturn this._delegate(uri);\n\t\t\t} catch (err) {\n\t\t\t\terrors.onUnexpectedError(err);\n\t\t\t\treturn uri;\n\t\t\t}\n\t\t}\n\t\tconst authority = uri.authority;\n\t\tlet host = this._hosts[authority];\n\t\tif (host && host.indexOf(':') !== -1 && host.indexOf('[') === -1) {\n\t\t\thost = `[${host}]`;\n\t\t}\n\t\tconst port = this._ports[authority];\n\t\tconst connectionToken = this._connectionTokens[authority];\n\t\tlet query = `path=${encodeURIComponent(uri.path)}`;\n\t\tif (typeof connectionToken === 'string') {\n\t\t\tquery += `&${connectionTokenQueryName}=${encodeURIComponent(connectionToken)}`;\n\t\t}\n\t\treturn URI.from({\n\t\t\tscheme: platform.isWeb ? this._preferredWebSchema : Schemas.vscodeRemoteResource,\n\t\t\tauthority: `${host}:${port}`,\n\t\t\tpath: this._remoteResourcesPath,\n\t\t\tquery\n\t\t});\n\t}\n}\n\nexport const RemoteAuthorities = new RemoteAuthoritiesImpl();\n\n/**\n * A string pointing to a path inside the app. It should not begin with ./ or ../\n */\nexport type AppResourcePath = (\n\t`a${string}` | `b${string}` | `c${string}` | `d${string}` | `e${string}` | `f${string}`\n\t| `g${string}` | `h${string}` | `i${string}` | `j${string}` | `k${string}` | `l${string}`\n\t| `m${string}` | `n${string}` | `o${string}` | `p${string}` | `q${string}` | `r${string}`\n\t| `s${string}` | `t${string}` | `u${string}` | `v${string}` | `w${string}` | `x${string}`\n\t| `y${string}` | `z${string}`\n);\n\nexport const VSCODE_AUTHORITY = 'vscode-app';\n\nclass FileAccessImpl {\n\n\tprivate static readonly FALLBACK_AUTHORITY = VSCODE_AUTHORITY;\n\n\t/**\n\t * Returns a URI to use in contexts where the browser is responsible\n\t * for loading (e.g. fetch()) or when used within the DOM.\n\t *\n\t * **Note:** use `dom.ts#asCSSUrl` whenever the URL is to be used in CSS context.\n\t */\n\tasBrowserUri(resourcePath: AppResourcePath | ''): URI {\n\t\t// ESM-comment-begin\n\t\tconst uri = this.toUri(resourcePath, require);\n\t\t// ESM-comment-end\n\t\t// ESM-uncomment-begin\n\t\t// const uri = this.toUri(resourcePath);\n\t\t// ESM-uncomment-end\n\t\treturn this.uriToBrowserUri(uri);\n\t}\n\n\t/**\n\t * Returns a URI to use in contexts where the browser is responsible\n\t * for loading (e.g. fetch()) or when used within the DOM.\n\t *\n\t * **Note:** use `dom.ts#asCSSUrl` whenever the URL is to be used in CSS context.\n\t */\n\turiToBrowserUri(uri: URI): URI {\n\t\t// Handle remote URIs via `RemoteAuthorities`\n\t\tif (uri.scheme === Schemas.vscodeRemote) {\n\t\t\treturn RemoteAuthorities.rewrite(uri);\n\t\t}\n\n\t\t// Convert to `vscode-file` resource..\n\t\tif (\n\t\t\t// ...only ever for `file` resources\n\t\t\turi.scheme === Schemas.file &&\n\t\t\t(\n\t\t\t\t// ...and we run in native environments\n\t\t\t\tplatform.isNative ||\n\t\t\t\t// ...or web worker extensions on desktop\n\t\t\t\t(platform.webWorkerOrigin === `${Schemas.vscodeFileResource}://${FileAccessImpl.FALLBACK_AUTHORITY}`)\n\t\t\t)\n\t\t) {\n\t\t\treturn uri.with({\n\t\t\t\tscheme: Schemas.vscodeFileResource,\n\t\t\t\t// We need to provide an authority here so that it can serve\n\t\t\t\t// as origin for network and loading matters in chromium.\n\t\t\t\t// If the URI is not coming with an authority already, we\n\t\t\t\t// add our own\n\t\t\t\tauthority: uri.authority || FileAccessImpl.FALLBACK_AUTHORITY,\n\t\t\t\tquery: null,\n\t\t\t\tfragment: null\n\t\t\t});\n\t\t}\n\n\t\treturn uri;\n\t}\n\n\tprivate toUri(uriOrModule: URI | string, moduleIdToUrl?: { toUrl(moduleId: string): string }): URI {\n\t\tif (URI.isUri(uriOrModule)) {\n\t\t\treturn uriOrModule;\n\t\t}\n\n\t\tif (globalThis._VSCODE_FILE_ROOT) {\n\t\t\tconst rootUriOrPath = globalThis._VSCODE_FILE_ROOT;\n\n\t\t\t// File URL (with scheme)\n\t\t\tif (/^\\w[\\w\\d+.-]*:\\/\\//.test(rootUriOrPath)) {\n\t\t\t\treturn URI.joinPath(URI.parse(rootUriOrPath, true), uriOrModule);\n\t\t\t}\n\n\t\t\t// File Path (no scheme)\n\t\t\tconst modulePath = paths.join(rootUriOrPath, uriOrModule);\n\t\t\treturn URI.file(modulePath);\n\t\t}\n\n\t\treturn URI.parse(moduleIdToUrl!.toUrl(uriOrModule));\n\t}\n}\n\nexport const FileAccess = new FileAccessImpl();\n\n\nexport namespace COI {\n\n\tconst coiHeaders = new Map<'3' | '2' | '1' | string, Record<string, string>>([\n\t\t['1', { 'Cross-Origin-Opener-Policy': 'same-origin' }],\n\t\t['2', { 'Cross-Origin-Embedder-Policy': 'require-corp' }],\n\t\t['3', { 'Cross-Origin-Opener-Policy': 'same-origin', 'Cross-Origin-Embedder-Policy': 'require-corp' }],\n\t]);\n\n\texport const CoopAndCoep = Object.freeze(coiHeaders.get('3'));\n\n\tconst coiSearchParamName = 'vscode-coi';\n\n\t/**\n\t * Extract desired headers from `vscode-coi` invocation\n\t */\n\texport function getHeadersFromQuery(url: string | URI | URL): Record<string, string> | undefined {\n\t\tlet params: URLSearchParams | undefined;\n\t\tif (typeof url === 'string') {\n\t\t\tparams = new URL(url).searchParams;\n\t\t} else if (url instanceof URL) {\n\t\t\tparams = url.searchParams;\n\t\t} else if (URI.isUri(url)) {\n\t\t\tparams = new URL(url.toString(true)).searchParams;\n\t\t}\n\t\tconst value = params?.get(coiSearchParamName);\n\t\tif (!value) {\n\t\t\treturn undefined;\n\t\t}\n\t\treturn coiHeaders.get(value);\n\t}\n\n\t/**\n\t * Add the `vscode-coi` query attribute based on wanting `COOP` and `COEP`. Will be a noop when `crossOriginIsolated`\n\t * isn't enabled the current context\n\t */\n\texport function addSearchParam(urlOrSearch: URLSearchParams | Record<string, string>, coop: boolean, coep: boolean): void {\n\t\tif (!(<any>globalThis).crossOriginIsolated) {\n\t\t\t// depends on the current context being COI\n\t\t\treturn;\n\t\t}\n\t\tconst value = coop && coep ? '3' : coep ? '2' : '1';\n\t\tif (urlOrSearch instanceof URLSearchParams) {\n\t\t\turlOrSearch.set(coiSearchParamName, value);\n\t\t} else {\n\t\t\t(<Record<string, string>>urlOrSearch)[coiSearchParamName] = value;\n\t\t}\n\t}\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CharCode } from 'vs/base/common/charCode';\nimport { onUnexpectedError, transformErrorForSerialization } from 'vs/base/common/errors';\nimport { Emitter, Event } from 'vs/base/common/event';\nimport { Disposable, IDisposable } from 'vs/base/common/lifecycle';\nimport { AppResourcePath, FileAccess } from 'vs/base/common/network';\nimport { isWeb } from 'vs/base/common/platform';\nimport * as strings from 'vs/base/common/strings';\nimport { URI } from 'vs/base/common/uri';\n\n// ESM-comment-begin\nconst isESM = false;\n// ESM-comment-end\n// ESM-uncomment-begin\n// const isESM = true;\n// ESM-uncomment-end\n\nconst DEFAULT_CHANNEL = 'default';\nconst INITIALIZE = '$initialize';\n\nexport interface IWorker extends IDisposable {\n\tgetId(): number;\n\tpostMessage(message: Message, transfer: ArrayBuffer[]): void;\n}\n\nexport interface IWorkerCallback {\n\t(message: Message): void;\n}\n\nexport interface IWorkerFactory {\n\tcreate(modules: IWorkerDescriptor, callback: IWorkerCallback, onErrorCallback: (err: any) => void): IWorker;\n}\n\nexport interface IWorkerDescriptor {\n\treadonly amdModuleId: string;\n\treadonly esmModuleLocation: URI | undefined;\n\treadonly label: string | undefined;\n}\n\nlet webWorkerWarningLogged = false;\nexport function logOnceWebWorkerWarning(err: any): void {\n\tif (!isWeb) {\n\t\t// running tests\n\t\treturn;\n\t}\n\tif (!webWorkerWarningLogged) {\n\t\twebWorkerWarningLogged = true;\n\t\tconsole.warn('Could not create web worker(s). Falling back to loading web worker code in main thread, which might cause UI freezes. Please see https://github.com/microsoft/monaco-editor#faq');\n\t}\n\tconsole.warn(err.message);\n}\n\nconst enum MessageType {\n\tRequest,\n\tReply,\n\tSubscribeEvent,\n\tEvent,\n\tUnsubscribeEvent\n}\nclass RequestMessage {\n\tpublic readonly type = MessageType.Request;\n\tconstructor(\n\t\tpublic readonly vsWorker: number,\n\t\tpublic readonly req: string,\n\t\tpublic readonly channel: string,\n\t\tpublic readonly method: string,\n\t\tpublic readonly args: any[]\n\t) { }\n}\nclass ReplyMessage {\n\tpublic readonly type = MessageType.Reply;\n\tconstructor(\n\t\tpublic readonly vsWorker: number,\n\t\tpublic readonly seq: string,\n\t\tpublic readonly res: any,\n\t\tpublic readonly err: any\n\t) { }\n}\nclass SubscribeEventMessage {\n\tpublic readonly type = MessageType.SubscribeEvent;\n\tconstructor(\n\t\tpublic readonly vsWorker: number,\n\t\tpublic readonly req: string,\n\t\tpublic readonly channel: string,\n\t\tpublic readonly eventName: string,\n\t\tpublic readonly arg: any\n\t) { }\n}\nclass EventMessage {\n\tpublic readonly type = MessageType.Event;\n\tconstructor(\n\t\tpublic readonly vsWorker: number,\n\t\tpublic readonly req: string,\n\t\tpublic readonly event: any\n\t) { }\n}\nclass UnsubscribeEventMessage {\n\tpublic readonly type = MessageType.UnsubscribeEvent;\n\tconstructor(\n\t\tpublic readonly vsWorker: number,\n\t\tpublic readonly req: string\n\t) { }\n}\ntype Message = RequestMessage | ReplyMessage | SubscribeEventMessage | EventMessage | UnsubscribeEventMessage;\n\ninterface IMessageReply {\n\tresolve: (value?: any) => void;\n\treject: (error?: any) => void;\n}\n\ninterface IMessageHandler {\n\tsendMessage(msg: any, transfer?: ArrayBuffer[]): void;\n\thandleMessage(channel: string, method: string, args: any[]): Promise<any>;\n\thandleEvent(channel: string, eventName: string, arg: any): Event<any>;\n}\n\nclass SimpleWorkerProtocol {\n\n\tprivate _workerId: number;\n\tprivate _lastSentReq: number;\n\tprivate _pendingReplies: { [req: string]: IMessageReply };\n\tprivate _pendingEmitters: Map<string, Emitter<any>>;\n\tprivate _pendingEvents: Map<string, IDisposable>;\n\tprivate _handler: IMessageHandler;\n\n\tconstructor(handler: IMessageHandler) {\n\t\tthis._workerId = -1;\n\t\tthis._handler = handler;\n\t\tthis._lastSentReq = 0;\n\t\tthis._pendingReplies = Object.create(null);\n\t\tthis._pendingEmitters = new Map<string, Emitter<any>>();\n\t\tthis._pendingEvents = new Map<string, IDisposable>();\n\t}\n\n\tpublic setWorkerId(workerId: number): void {\n\t\tthis._workerId = workerId;\n\t}\n\n\tpublic sendMessage(channel: string, method: string, args: any[]): Promise<any> {\n\t\tconst req = String(++this._lastSentReq);\n\t\treturn new Promise<any>((resolve, reject) => {\n\t\t\tthis._pendingReplies[req] = {\n\t\t\t\tresolve: resolve,\n\t\t\t\treject: reject\n\t\t\t};\n\t\t\tthis._send(new RequestMessage(this._workerId, req, channel, method, args));\n\t\t});\n\t}\n\n\tpublic listen(channel: string, eventName: string, arg: any): Event<any> {\n\t\tlet req: string | null = null;\n\t\tconst emitter = new Emitter<any>({\n\t\t\tonWillAddFirstListener: () => {\n\t\t\t\treq = String(++this._lastSentReq);\n\t\t\t\tthis._pendingEmitters.set(req, emitter);\n\t\t\t\tthis._send(new SubscribeEventMessage(this._workerId, req, channel, eventName, arg));\n\t\t\t},\n\t\t\tonDidRemoveLastListener: () => {\n\t\t\t\tthis._pendingEmitters.delete(req!);\n\t\t\t\tthis._send(new UnsubscribeEventMessage(this._workerId, req!));\n\t\t\t\treq = null;\n\t\t\t}\n\t\t});\n\t\treturn emitter.event;\n\t}\n\n\tpublic handleMessage(message: Message): void {\n\t\tif (!message || !message.vsWorker) {\n\t\t\treturn;\n\t\t}\n\t\tif (this._workerId !== -1 && message.vsWorker !== this._workerId) {\n\t\t\treturn;\n\t\t}\n\t\tthis._handleMessage(message);\n\t}\n\n\tpublic createProxyToRemoteChannel<T extends object>(channel: string, sendMessageBarrier?: () => Promise<void>): T {\n\t\tconst handler = {\n\t\t\tget: (target: any, name: PropertyKey) => {\n\t\t\t\tif (typeof name === 'string' && !target[name]) {\n\t\t\t\t\tif (propertyIsDynamicEvent(name)) { // onDynamic...\n\t\t\t\t\t\ttarget[name] = (arg: any): Event<any> => {\n\t\t\t\t\t\t\treturn this.listen(channel, name, arg);\n\t\t\t\t\t\t};\n\t\t\t\t\t} else if (propertyIsEvent(name)) { // on...\n\t\t\t\t\t\ttarget[name] = this.listen(channel, name, undefined);\n\t\t\t\t\t} else if (name.charCodeAt(0) === CharCode.DollarSign) { // $...\n\t\t\t\t\t\ttarget[name] = async (...myArgs: any[]) => {\n\t\t\t\t\t\t\tawait sendMessageBarrier?.();\n\t\t\t\t\t\t\treturn this.sendMessage(channel, name, myArgs);\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn target[name];\n\t\t\t}\n\t\t};\n\t\treturn new Proxy(Object.create(null), handler);\n\t}\n\n\tprivate _handleMessage(msg: Message): void {\n\t\tswitch (msg.type) {\n\t\t\tcase MessageType.Reply:\n\t\t\t\treturn this._handleReplyMessage(msg);\n\t\t\tcase MessageType.Request:\n\t\t\t\treturn this._handleRequestMessage(msg);\n\t\t\tcase MessageType.SubscribeEvent:\n\t\t\t\treturn this._handleSubscribeEventMessage(msg);\n\t\t\tcase MessageType.Event:\n\t\t\t\treturn this._handleEventMessage(msg);\n\t\t\tcase MessageType.UnsubscribeEvent:\n\t\t\t\treturn this._handleUnsubscribeEventMessage(msg);\n\t\t}\n\t}\n\n\tprivate _handleReplyMessage(replyMessage: ReplyMessage): void {\n\t\tif (!this._pendingReplies[replyMessage.seq]) {\n\t\t\tconsole.warn('Got reply to unknown seq');\n\t\t\treturn;\n\t\t}\n\n\t\tconst reply = this._pendingReplies[replyMessage.seq];\n\t\tdelete this._pendingReplies[replyMessage.seq];\n\n\t\tif (replyMessage.err) {\n\t\t\tlet err = replyMessage.err;\n\t\t\tif (replyMessage.err.$isError) {\n\t\t\t\terr = new Error();\n\t\t\t\terr.name = replyMessage.err.name;\n\t\t\t\terr.message = replyMessage.err.message;\n\t\t\t\terr.stack = replyMessage.err.stack;\n\t\t\t}\n\t\t\treply.reject(err);\n\t\t\treturn;\n\t\t}\n\n\t\treply.resolve(replyMessage.res);\n\t}\n\n\tprivate _handleRequestMessage(requestMessage: RequestMessage): void {\n\t\tconst req = requestMessage.req;\n\t\tconst result = this._handler.handleMessage(requestMessage.channel, requestMessage.method, requestMessage.args);\n\t\tresult.then((r) => {\n\t\t\tthis._send(new ReplyMessage(this._workerId, req, r, undefined));\n\t\t}, (e) => {\n\t\t\tif (e.detail instanceof Error) {\n\t\t\t\t// Loading errors have a detail property that points to the actual error\n\t\t\t\te.detail = transformErrorForSerialization(e.detail);\n\t\t\t}\n\t\t\tthis._send(new ReplyMessage(this._workerId, req, undefined, transformErrorForSerialization(e)));\n\t\t});\n\t}\n\n\tprivate _handleSubscribeEventMessage(msg: SubscribeEventMessage): void {\n\t\tconst req = msg.req;\n\t\tconst disposable = this._handler.handleEvent(msg.channel, msg.eventName, msg.arg)((event) => {\n\t\t\tthis._send(new EventMessage(this._workerId, req, event));\n\t\t});\n\t\tthis._pendingEvents.set(req, disposable);\n\t}\n\n\tprivate _handleEventMessage(msg: EventMessage): void {\n\t\tif (!this._pendingEmitters.has(msg.req)) {\n\t\t\tconsole.warn('Got event for unknown req');\n\t\t\treturn;\n\t\t}\n\t\tthis._pendingEmitters.get(msg.req)!.fire(msg.event);\n\t}\n\n\tprivate _handleUnsubscribeEventMessage(msg: UnsubscribeEventMessage): void {\n\t\tif (!this._pendingEvents.has(msg.req)) {\n\t\t\tconsole.warn('Got unsubscribe for unknown req');\n\t\t\treturn;\n\t\t}\n\t\tthis._pendingEvents.get(msg.req)!.dispose();\n\t\tthis._pendingEvents.delete(msg.req);\n\t}\n\n\tprivate _send(msg: Message): void {\n\t\tconst transfer: ArrayBuffer[] = [];\n\t\tif (msg.type === MessageType.Request) {\n\t\t\tfor (let i = 0; i < msg.args.length; i++) {\n\t\t\t\tif (msg.args[i] instanceof ArrayBuffer) {\n\t\t\t\t\ttransfer.push(msg.args[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (msg.type === MessageType.Reply) {\n\t\t\tif (msg.res instanceof ArrayBuffer) {\n\t\t\t\ttransfer.push(msg.res);\n\t\t\t}\n\t\t}\n\t\tthis._handler.sendMessage(msg, transfer);\n\t}\n}\n\ntype ProxiedMethodName = (`$${string}` | `on${string}`);\n\nexport type Proxied<T> = { [K in keyof T]: T[K] extends (...args: infer A) => infer R\n\t? (\n\t\tK extends ProxiedMethodName\n\t\t? (...args: A) => Promise<Awaited<R>>\n\t\t: never\n\t)\n\t: never\n};\n\nexport interface IWorkerClient<W> {\n\tproxy: Proxied<W>;\n\tdispose(): void;\n\tsetChannel<T extends object>(channel: string, handler: T): void;\n}\n\nexport interface IWorkerServer {\n\tgetChannel<T extends object>(channel: string): Proxied<T>;\n}\n\n/**\n * Main thread side\n */\nexport class SimpleWorkerClient<W extends object> extends Disposable implements IWorkerClient<W> {\n\n\tprivate readonly _worker: IWorker;\n\tprivate readonly _onModuleLoaded: Promise<void>;\n\tprivate readonly _protocol: SimpleWorkerProtocol;\n\tpublic readonly proxy: Proxied<W>;\n\tprivate readonly _localChannels: Map<string, object> = new Map();\n\n\tconstructor(\n\t\tworkerFactory: IWorkerFactory,\n\t\tworkerDescriptor: IWorkerDescriptor,\n\t) {\n\t\tsuper();\n\n\t\tthis._worker = this._register(workerFactory.create(\n\t\t\t{\n\t\t\t\tamdModuleId: 'vs/base/common/worker/simpleWorker',\n\t\t\t\tesmModuleLocation: workerDescriptor.esmModuleLocation,\n\t\t\t\tlabel: workerDescriptor.label\n\t\t\t},\n\t\t\t(msg: Message) => {\n\t\t\t\tthis._protocol.handleMessage(msg);\n\t\t\t},\n\t\t\t(err: any) => {\n\t\t\t\t// in Firefox, web workers fail lazily :(\n\t\t\t\t// we will reject the proxy\n\t\t\t\tonUnexpectedError(err);\n\t\t\t}\n\t\t));\n\n\t\tthis._protocol = new SimpleWorkerProtocol({\n\t\t\tsendMessage: (msg: any, transfer: ArrayBuffer[]): void => {\n\t\t\t\tthis._worker.postMessage(msg, transfer);\n\t\t\t},\n\t\t\thandleMessage: (channel: string, method: string, args: any[]): Promise<any> => {\n\t\t\t\treturn this._handleMessage(channel, method, args);\n\t\t\t},\n\t\t\thandleEvent: (channel: string, eventName: string, arg: any): Event<any> => {\n\t\t\t\treturn this._handleEvent(channel, eventName, arg);\n\t\t\t}\n\t\t});\n\t\tthis._protocol.setWorkerId(this._worker.getId());\n\n\t\t// Gather loader configuration\n\t\tlet loaderConfiguration: any = null;\n\n\t\tconst globalRequire: { getConfig?(): object } | undefined = (globalThis as any).require;\n\t\tif (typeof globalRequire !== 'undefined' && typeof globalRequire.getConfig === 'function') {\n\t\t\t// Get the configuration from the Monaco AMD Loader\n\t\t\tloaderConfiguration = globalRequire.getConfig();\n\t\t} else if (typeof (globalThis as any).requirejs !== 'undefined') {\n\t\t\t// Get the configuration from requirejs\n\t\t\tloaderConfiguration = (globalThis as any).requirejs.s.contexts._.config;\n\t\t}\n\n\t\t// Send initialize message\n\t\tthis._onModuleLoaded = this._protocol.sendMessage(DEFAULT_CHANNEL, INITIALIZE, [\n\t\t\tthis._worker.getId(),\n\t\t\tJSON.parse(JSON.stringify(loaderConfiguration)),\n\t\t\tworkerDescriptor.amdModuleId,\n\t\t]);\n\n\t\tthis.proxy = this._protocol.createProxyToRemoteChannel(DEFAULT_CHANNEL, async () => { await this._onModuleLoaded; });\n\t\tthis._onModuleLoaded.catch((e) => {\n\t\t\tthis._onError('Worker failed to load ' + workerDescriptor.amdModuleId, e);\n\t\t});\n\t}\n\n\tprivate _handleMessage(channelName: string, method: string, args: any[]): Promise<any> {\n\t\tconst channel: object | undefined = this._localChannels.get(channelName);\n\t\tif (!channel) {\n\t\t\treturn Promise.reject(new Error(`Missing channel ${channelName} on main thread`));\n\t\t}\n\t\tif (typeof (channel as any)[method] !== 'function') {\n\t\t\treturn Promise.reject(new Error(`Missing method ${method} on main thread channel ${channelName}`));\n\t\t}\n\n\t\ttry {\n\t\t\treturn Promise.resolve((channel as any)[method].apply(channel, args));\n\t\t} catch (e) {\n\t\t\treturn Promise.reject(e);\n\t\t}\n\t}\n\n\tprivate _handleEvent(channelName: string, eventName: string, arg: any): Event<any> {\n\t\tconst channel: object | undefined = this._localChannels.get(channelName);\n\t\tif (!channel) {\n\t\t\tthrow new Error(`Missing channel ${channelName} on main thread`);\n\t\t}\n\t\tif (propertyIsDynamicEvent(eventName)) {\n\t\t\tconst event = (channel as any)[eventName].call(channel, arg);\n\t\t\tif (typeof event !== 'function') {\n\t\t\t\tthrow new Error(`Missing dynamic event ${eventName} on main thread channel ${channelName}.`);\n\t\t\t}\n\t\t\treturn event;\n\t\t}\n\t\tif (propertyIsEvent(eventName)) {\n\t\t\tconst event = (channel as any)[eventName];\n\t\t\tif (typeof event !== 'function') {\n\t\t\t\tthrow new Error(`Missing event ${eventName} on main thread channel ${channelName}.`);\n\t\t\t}\n\t\t\treturn event;\n\t\t}\n\t\tthrow new Error(`Malformed event name ${eventName}`);\n\t}\n\n\tpublic setChannel<T extends object>(channel: string, handler: T): void {\n\t\tthis._localChannels.set(channel, handler);\n\t}\n\n\tprivate _onError(message: string, error?: any): void {\n\t\tconsole.error(message);\n\t\tconsole.info(error);\n\t}\n}\n\nfunction propertyIsEvent(name: string): boolean {\n\t// Assume a property is an event if it has a form of \"onSomething\"\n\treturn name[0] === 'o' && name[1] === 'n' && strings.isUpperAsciiLetter(name.charCodeAt(2));\n}\n\nfunction propertyIsDynamicEvent(name: string): boolean {\n\t// Assume a property is a dynamic event (a method that returns an event) if it has a form of \"onDynamicSomething\"\n\treturn /^onDynamic/.test(name) && strings.isUpperAsciiLetter(name.charCodeAt(9));\n}\n\nexport interface IRequestHandler {\n\t_requestHandlerBrand: any;\n\t[prop: string]: any;\n}\n\nexport interface IRequestHandlerFactory {\n\t(workerServer: IWorkerServer): IRequestHandler;\n}\n\n/**\n * Worker side\n */\nexport class SimpleWorkerServer implements IWorkerServer {\n\n\tprivate _requestHandlerFactory: IRequestHandlerFactory | null;\n\tprivate _requestHandler: IRequestHandler | null;\n\tprivate _protocol: SimpleWorkerProtocol;\n\tprivate readonly _localChannels: Map<string, object> = new Map();\n\tprivate readonly _remoteChannels: Map<string, object> = new Map();\n\n\tconstructor(postMessage: (msg: Message, transfer?: ArrayBuffer[]) => void, requestHandlerFactory: IRequestHandlerFactory | null) {\n\t\tthis._requestHandlerFactory = requestHandlerFactory;\n\t\tthis._requestHandler = null;\n\t\tthis._protocol = new SimpleWorkerProtocol({\n\t\t\tsendMessage: (msg: any, transfer: ArrayBuffer[]): void => {\n\t\t\t\tpostMessage(msg, transfer);\n\t\t\t},\n\t\t\thandleMessage: (channel: string, method: string, args: any[]): Promise<any> => this._handleMessage(channel, method, args),\n\t\t\thandleEvent: (channel: string, eventName: string, arg: any): Event<any> => this._handleEvent(channel, eventName, arg)\n\t\t});\n\t}\n\n\tpublic onmessage(msg: any): void {\n\t\tthis._protocol.handleMessage(msg);\n\t}\n\n\tprivate _handleMessage(channel: string, method: string, args: any[]): Promise<any> {\n\t\tif (channel === DEFAULT_CHANNEL && method === INITIALIZE) {\n\t\t\treturn this.initialize(<number>args[0], <any>args[1], <string>args[2]);\n\t\t}\n\n\t\tconst requestHandler: object | null | undefined = (channel === DEFAULT_CHANNEL ? this._requestHandler : this._localChannels.get(channel));\n\t\tif (!requestHandler) {\n\t\t\treturn Promise.reject(new Error(`Missing channel ${channel} on worker thread`));\n\t\t}\n\t\tif (typeof (requestHandler as any)[method] !== 'function') {\n\t\t\treturn Promise.reject(new Error(`Missing method ${method} on worker thread channel ${channel}`));\n\t\t}\n\n\t\ttry {\n\t\t\treturn Promise.resolve((requestHandler as any)[method].apply(requestHandler, args));\n\t\t} catch (e) {\n\t\t\treturn Promise.reject(e);\n\t\t}\n\t}\n\n\tprivate _handleEvent(channel: string, eventName: string, arg: any): Event<any> {\n\t\tconst requestHandler: object | null | undefined = (channel === DEFAULT_CHANNEL ? this._requestHandler : this._localChannels.get(channel));\n\t\tif (!requestHandler) {\n\t\t\tthrow new Error(`Missing channel ${channel} on worker thread`);\n\t\t}\n\t\tif (propertyIsDynamicEvent(eventName)) {\n\t\t\tconst event = (requestHandler as any)[eventName].call(requestHandler, arg);\n\t\t\tif (typeof event !== 'function') {\n\t\t\t\tthrow new Error(`Missing dynamic event ${eventName} on request handler.`);\n\t\t\t}\n\t\t\treturn event;\n\t\t}\n\t\tif (propertyIsEvent(eventName)) {\n\t\t\tconst event = (requestHandler as any)[eventName];\n\t\t\tif (typeof event !== 'function') {\n\t\t\t\tthrow new Error(`Missing event ${eventName} on request handler.`);\n\t\t\t}\n\t\t\treturn event;\n\t\t}\n\t\tthrow new Error(`Malformed event name ${eventName}`);\n\t}\n\n\tpublic getChannel<T extends object>(channel: string): Proxied<T> {\n\t\tif (!this._remoteChannels.has(channel)) {\n\t\t\tconst inst = this._protocol.createProxyToRemoteChannel(channel);\n\t\t\tthis._remoteChannels.set(channel, inst);\n\t\t}\n\t\treturn this._remoteChannels.get(channel) as Proxied<T>;\n\t}\n\n\tprivate async initialize(workerId: number, loaderConfig: any, moduleId: string): Promise<void> {\n\t\tthis._protocol.setWorkerId(workerId);\n\n\t\tif (this._requestHandlerFactory) {\n\t\t\t// static request handler\n\t\t\tthis._requestHandler = this._requestHandlerFactory(this);\n\t\t\treturn;\n\t\t}\n\n\t\tif (loaderConfig) {\n\t\t\t// Remove 'baseUrl', handling it is beyond scope for now\n\t\t\tif (typeof loaderConfig.baseUrl !== 'undefined') {\n\t\t\t\tdelete loaderConfig['baseUrl'];\n\t\t\t}\n\t\t\tif (typeof loaderConfig.paths !== 'undefined') {\n\t\t\t\tif (typeof loaderConfig.paths.vs !== 'undefined') {\n\t\t\t\t\tdelete loaderConfig.paths['vs'];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (typeof loaderConfig.trustedTypesPolicy !== 'undefined') {\n\t\t\t\t// don't use, it has been destroyed during serialize\n\t\t\t\tdelete loaderConfig['trustedTypesPolicy'];\n\t\t\t}\n\n\t\t\t// Since this is in a web worker, enable catching errors\n\t\t\tloaderConfig.catchError = true;\n\t\t\tglobalThis.require.config(loaderConfig);\n\t\t}\n\n\t\tif (isESM) {\n\t\t\tconst url = FileAccess.asBrowserUri(`${moduleId}.js` as AppResourcePath).toString(true);\n\t\t\treturn import(`${url}`).then((module: { create: IRequestHandlerFactory }) => {\n\t\t\t\tthis._requestHandler = module.create(this);\n\n\t\t\t\tif (!this._requestHandler) {\n\t\t\t\t\tthrow new Error(`No RequestHandler!`);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\n\t\treturn new Promise<void>((resolve, reject) => {\n\t\t\t// Use the global require to be sure to get the global config\n\n\t\t\t// ESM-comment-begin\n\t\t\tconst req = (globalThis.require || require);\n\t\t\t// ESM-comment-end\n\t\t\t// ESM-uncomment-begin\n\t\t\t// const req = globalThis.require;\n\t\t\t// ESM-uncomment-end\n\n\t\t\treq([moduleId], (module: { create: IRequestHandlerFactory }) => {\n\t\t\t\tthis._requestHandler = module.create(this);\n\n\t\t\t\tif (!this._requestHandler) {\n\t\t\t\t\treject(new Error(`No RequestHandler!`));\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tresolve();\n\t\t\t}, reject);\n\t\t});\n\t}\n}\n\n/**\n * Defines the worker entry point. Must be exported and named `create`.\n * @skipMangle\n */\nexport function create(postMessage: (msg: Message, transfer?: ArrayBuffer[]) => void): SimpleWorkerServer {\n\treturn new SimpleWorkerServer(postMessage, null);\n}\n","\nimport { CancellationToken } from 'vs/base/common/cancellation';\nimport { Codicon } from 'vs/base/common/codicons';\nimport { Color } from 'vs/base/common/color';\nimport { IReadonlyVSDataTransfer } from 'vs/base/common/dataTransfer';\nimport { Event } from 'vs/base/common/event';\nimport { HierarchicalKind } from 'vs/base/common/hierarchicalKind';\nimport { IMarkdownString } from 'vs/base/common/htmlContent';\nimport { IDisposable } from 'vs/base/common/lifecycle';\nimport { ThemeIcon } from 'vs/base/common/themables';\nimport { URI, UriComponents } from 'vs/base/common/uri';\nimport { ISingleEditOperation } from 'vs/editor/common/core/editOperation';\nimport { IPosition, Position } from 'vs/editor/common/core/position';\nimport { IRange, Range } from 'vs/editor/common/core/range';\nimport { Selection } from 'vs/editor/common/core/selection';\nimport { LanguageId } from 'vs/editor/common/encodedTokenAttributes';\nimport { LanguageSelector } from 'vs/editor/common/languageSelector';\nimport * as model from 'vs/editor/common/model';\nimport { TokenizationRegistry as TokenizationRegistryImpl } from 'vs/editor/common/tokenizationRegistry';\nimport { ContiguousMultilineTokens } from 'vs/editor/common/tokens/contiguousMultilineTokens';\nimport { localize } from 'vs/nls';\nimport { ExtensionIdentifier } from 'vs/platform/extensions/common/extensions';\nimport { IMarkerData } from 'vs/platform/markers/common/markers';\n\n/**\n * @internal\n */\nexport interface ILanguageIdCodec {\n\tencodeLanguageId(languageId: string): LanguageId;\n\tdecodeLanguageId(languageId: LanguageId): string;\n}\n\nexport class Token {\n\t_tokenBrand: void = undefined;\n\n\tconstructor(\n\t\tpublic readonly offset: number,\n\t\tpublic readonly type: string,\n\t\tpublic readonly language: string,\n\t) {\n\t}\n\n\tpublic toString(): string {\n\t\treturn '(' + this.offset + ', ' + this.type + ')';\n\t}\n}\n\n/**\n * @internal\n */\nexport class TokenizationResult {\n\t_tokenizationResultBrand: void = undefined;\n\n\tconstructor(\n\t\tpublic readonly tokens: Token[],\n\t\tpublic readonly endState: IState,\n\t) {\n\t}\n}\n\n/**\n * @internal\n */\nexport class EncodedTokenizationResult {\n\t_encodedTokenizationResultBrand: void = undefined;\n\n\tconstructor(\n\t\t/**\n\t\t * The tokens in binary format. Each token occupies two array indices. For token i:\n\t\t *  - at offset 2*i => startIndex\n\t\t *  - at offset 2*i + 1 => metadata\n\t\t *\n\t\t */\n\t\tpublic readonly tokens: Uint32Array,\n\t\tpublic readonly endState: IState,\n\t) {\n\t}\n}\n\n/**\n * An intermediate interface for scaffolding the new tree sitter tokenization support. Not final.\n * @internal\n */\nexport interface ITreeSitterTokenizationSupport {\n\ttokenizeEncoded(lineNumber: number, textModel: model.ITextModel): Uint32Array | undefined;\n}\n\n/**\n * @internal\n */\nexport interface ITokenizationSupport {\n\t/**\n\t * If true, the background tokenizer will only be used to verify tokens against the default background tokenizer.\n\t * Used for debugging.\n\t */\n\treadonly backgroundTokenizerShouldOnlyVerifyTokens?: boolean;\n\n\tgetInitialState(): IState;\n\n\ttokenize(line: string, hasEOL: boolean, state: IState): TokenizationResult;\n\n\ttokenizeEncoded(line: string, hasEOL: boolean, state: IState): EncodedTokenizationResult;\n\n\t/**\n\t * Can be/return undefined if default background tokenization should be used.\n\t */\n\tcreateBackgroundTokenizer?(textModel: model.ITextModel, store: IBackgroundTokenizationStore): IBackgroundTokenizer | undefined;\n}\n\n/**\n * @internal\n */\nexport interface IBackgroundTokenizer extends IDisposable {\n\t/**\n\t * Instructs the background tokenizer to set the tokens for the given range again.\n\t *\n\t * This might be necessary if the renderer overwrote those tokens with heuristically computed ones for some viewport,\n\t * when the change does not even propagate to that viewport.\n\t */\n\trequestTokens(startLineNumber: number, endLineNumberExclusive: number): void;\n\n\treportMismatchingTokens?(lineNumber: number): void;\n}\n\n/**\n * @internal\n */\nexport interface IBackgroundTokenizationStore {\n\tsetTokens(tokens: ContiguousMultilineTokens[]): void;\n\n\tsetEndState(lineNumber: number, state: IState): void;\n\n\t/**\n\t * Should be called to indicate that the background tokenization has finished for now.\n\t * (This triggers bracket pair colorization to re-parse the bracket pairs with token information)\n\t */\n\tbackgroundTokenizationFinished(): void;\n}\n\n/**\n * The state of the tokenizer between two lines.\n * It is useful to store flags such as in multiline comment, etc.\n * The model will clone the previous line's state and pass it in to tokenize the next line.\n */\nexport interface IState {\n\tclone(): IState;\n\tequals(other: IState): boolean;\n}\n\n/**\n * A provider result represents the values a provider, like the {@link HoverProvider},\n * may return. For once this is the actual result type `T`, like `Hover`, or a thenable that resolves\n * to that type `T`. In addition, `null` and `undefined` can be returned - either directly or from a\n * thenable.\n */\nexport type ProviderResult<T> = T | undefined | null | Thenable<T | undefined | null>;\n\n/**\n * A hover represents additional information for a symbol or word. Hovers are\n * rendered in a tooltip-like widget.\n */\nexport interface Hover {\n\t/**\n\t * The contents of this hover.\n\t */\n\tcontents: IMarkdownString[];\n\n\t/**\n\t * The range to which this hover applies. When missing, the\n\t * editor will use the range at the current position or the\n\t * current position itself.\n\t */\n\trange?: IRange;\n\n\t/**\n\t * Can increase the verbosity of the hover\n\t */\n\tcanIncreaseVerbosity?: boolean;\n\n\t/**\n\t * Can decrease the verbosity of the hover\n\t */\n\tcanDecreaseVerbosity?: boolean;\n}\n\n/**\n * The hover provider interface defines the contract between extensions and\n * the [hover](https://code.visualstudio.com/docs/editor/intellisense)-feature.\n */\nexport interface HoverProvider<THover = Hover> {\n\t/**\n\t * Provide a hover for the given position, context and document. Multiple hovers at the same\n\t * position will be merged by the editor. A hover can have a range which defaults\n\t * to the word range at the position when omitted.\n\t */\n\tprovideHover(model: model.ITextModel, position: Position, token: CancellationToken, context?: HoverContext<THover>): ProviderResult<THover>;\n}\n\nexport interface HoverContext<THover = Hover> {\n\t/**\n\t * Hover verbosity request\n\t */\n\tverbosityRequest?: HoverVerbosityRequest<THover>;\n}\n\nexport interface HoverVerbosityRequest<THover = Hover> {\n\t/**\n\t * The delta by which to increase/decrease the hover verbosity level\n\t */\n\tverbosityDelta: number;\n\t/**\n\t * The previous hover for the same position\n\t */\n\tpreviousHover: THover;\n}\n\nexport enum HoverVerbosityAction {\n\t/**\n\t * Increase the verbosity of the hover\n\t */\n\tIncrease,\n\t/**\n\t * Decrease the verbosity of the hover\n\t */\n\tDecrease\n}\n\nexport const enum CompletionItemKind {\n\tMethod,\n\tFunction,\n\tConstructor,\n\tField,\n\tVariable,\n\tClass,\n\tStruct,\n\tInterface,\n\tModule,\n\tProperty,\n\tEvent,\n\tOperator,\n\tUnit,\n\tValue,\n\tConstant,\n\tEnum,\n\tEnumMember,\n\tKeyword,\n\tText,\n\tColor,\n\tFile,\n\tReference,\n\tCustomcolor,\n\tFolder,\n\tTypeParameter,\n\tUser,\n\tIssue,\n\tSnippet, // <- highest value (used for compare!)\n}\n\n/**\n * @internal\n */\nexport namespace CompletionItemKinds {\n\n\tconst byKind = new Map<CompletionItemKind, ThemeIcon>();\n\tbyKind.set(CompletionItemKind.Method, Codicon.symbolMethod);\n\tbyKind.set(CompletionItemKind.Function, Codicon.symbolFunction);\n\tbyKind.set(CompletionItemKind.Constructor, Codicon.symbolConstructor);\n\tbyKind.set(CompletionItemKind.Field, Codicon.symbolField);\n\tbyKind.set(CompletionItemKind.Variable, Codicon.symbolVariable);\n\tbyKind.set(CompletionItemKind.Class, Codicon.symbolClass);\n\tbyKind.set(CompletionItemKind.Struct, Codicon.symbolStruct);\n\tbyKind.set(CompletionItemKind.Interface, Codicon.symbolInterface);\n\tbyKind.set(CompletionItemKind.Module, Codicon.symbolModule);\n\tbyKind.set(CompletionItemKind.Property, Codicon.symbolProperty);\n\tbyKind.set(CompletionItemKind.Event, Codicon.symbolEvent);\n\tbyKind.set(CompletionItemKind.Operator, Codicon.symbolOperator);\n\tbyKind.set(CompletionItemKind.Unit, Codicon.symbolUnit);\n\tbyKind.set(CompletionItemKind.Value, Codicon.symbolValue);\n\tbyKind.set(CompletionItemKind.Enum, Codicon.symbolEnum);\n\tbyKind.set(CompletionItemKind.Constant, Codicon.symbolConstant);\n\tbyKind.set(CompletionItemKind.Enum, Codicon.symbolEnum);\n\tbyKind.set(CompletionItemKind.EnumMember, Codicon.symbolEnumMember);\n\tbyKind.set(CompletionItemKind.Keyword, Codicon.symbolKeyword);\n\tbyKind.set(CompletionItemKind.Snippet, Codicon.symbolSnippet);\n\tbyKind.set(CompletionItemKind.Text, Codicon.symbolText);\n\tbyKind.set(CompletionItemKind.Color, Codicon.symbolColor);\n\tbyKind.set(CompletionItemKind.File, Codicon.symbolFile);\n\tbyKind.set(CompletionItemKind.Reference, Codicon.symbolReference);\n\tbyKind.set(CompletionItemKind.Customcolor, Codicon.symbolCustomColor);\n\tbyKind.set(CompletionItemKind.Folder, Codicon.symbolFolder);\n\tbyKind.set(CompletionItemKind.TypeParameter, Codicon.symbolTypeParameter);\n\tbyKind.set(CompletionItemKind.User, Codicon.account);\n\tbyKind.set(CompletionItemKind.Issue, Codicon.issues);\n\n\t/**\n\t * @internal\n\t */\n\texport function toIcon(kind: CompletionItemKind): ThemeIcon {\n\t\tlet codicon = byKind.get(kind);\n\t\tif (!codicon) {\n\t\t\tconsole.info('No codicon found for CompletionItemKind ' + kind);\n\t\t\tcodicon = Codicon.symbolProperty;\n\t\t}\n\t\treturn codicon;\n\t}\n\n\tconst data = new Map<string, CompletionItemKind>();\n\tdata.set('method', CompletionItemKind.Method);\n\tdata.set('function', CompletionItemKind.Function);\n\tdata.set('constructor', <any>CompletionItemKind.Constructor);\n\tdata.set('field', CompletionItemKind.Field);\n\tdata.set('variable', CompletionItemKind.Variable);\n\tdata.set('class', CompletionItemKind.Class);\n\tdata.set('struct', CompletionItemKind.Struct);\n\tdata.set('interface', CompletionItemKind.Interface);\n\tdata.set('module', CompletionItemKind.Module);\n\tdata.set('property', CompletionItemKind.Property);\n\tdata.set('event', CompletionItemKind.Event);\n\tdata.set('operator', CompletionItemKind.Operator);\n\tdata.set('unit', CompletionItemKind.Unit);\n\tdata.set('value', CompletionItemKind.Value);\n\tdata.set('constant', CompletionItemKind.Constant);\n\tdata.set('enum', CompletionItemKind.Enum);\n\tdata.set('enum-member', CompletionItemKind.EnumMember);\n\tdata.set('enumMember', CompletionItemKind.EnumMember);\n\tdata.set('keyword', CompletionItemKind.Keyword);\n\tdata.set('snippet', CompletionItemKind.Snippet);\n\tdata.set('text', CompletionItemKind.Text);\n\tdata.set('color', CompletionItemKind.Color);\n\tdata.set('file', CompletionItemKind.File);\n\tdata.set('reference', CompletionItemKind.Reference);\n\tdata.set('customcolor', CompletionItemKind.Customcolor);\n\tdata.set('folder', CompletionItemKind.Folder);\n\tdata.set('type-parameter', CompletionItemKind.TypeParameter);\n\tdata.set('typeParameter', CompletionItemKind.TypeParameter);\n\tdata.set('account', CompletionItemKind.User);\n\tdata.set('issue', CompletionItemKind.Issue);\n\n\t/**\n\t * @internal\n\t */\n\texport function fromString(value: string): CompletionItemKind;\n\t/**\n\t * @internal\n\t */\n\texport function fromString(value: string, strict: true): CompletionItemKind | undefined;\n\t/**\n\t * @internal\n\t */\n\texport function fromString(value: string, strict?: boolean): CompletionItemKind | undefined {\n\t\tlet res = data.get(value);\n\t\tif (typeof res === 'undefined' && !strict) {\n\t\t\tres = CompletionItemKind.Property;\n\t\t}\n\t\treturn res;\n\t}\n}\n\nexport interface CompletionItemLabel {\n\tlabel: string;\n\tdetail?: string;\n\tdescription?: string;\n}\n\nexport const enum CompletionItemTag {\n\tDeprecated = 1\n}\n\nexport const enum CompletionItemInsertTextRule {\n\tNone = 0,\n\n\t/**\n\t * Adjust whitespace/indentation of multiline insert texts to\n\t * match the current line indentation.\n\t */\n\tKeepWhitespace = 0b001,\n\n\t/**\n\t * `insertText` is a snippet.\n\t */\n\tInsertAsSnippet = 0b100,\n}\n\nexport interface CompletionItemRanges {\n\tinsert: IRange;\n\treplace: IRange;\n}\n\n/**\n * A completion item represents a text snippet that is\n * proposed to complete text that is being typed.\n */\nexport interface CompletionItem {\n\t/**\n\t * The label of this completion item. By default\n\t * this is also the text that is inserted when selecting\n\t * this completion.\n\t */\n\tlabel: string | CompletionItemLabel;\n\t/**\n\t * The kind of this completion item. Based on the kind\n\t * an icon is chosen by the editor.\n\t */\n\tkind: CompletionItemKind;\n\t/**\n\t * A modifier to the `kind` which affect how the item\n\t * is rendered, e.g. Deprecated is rendered with a strikeout\n\t */\n\ttags?: ReadonlyArray<CompletionItemTag>;\n\t/**\n\t * A human-readable string with additional information\n\t * about this item, like type or symbol information.\n\t */\n\tdetail?: string;\n\t/**\n\t * A human-readable string that represents a doc-comment.\n\t */\n\tdocumentation?: string | IMarkdownString;\n\t/**\n\t * A string that should be used when comparing this item\n\t * with other items. When `falsy` the {@link CompletionItem.label label}\n\t * is used.\n\t */\n\tsortText?: string;\n\t/**\n\t * A string that should be used when filtering a set of\n\t * completion items. When `falsy` the {@link CompletionItem.label label}\n\t * is used.\n\t */\n\tfilterText?: string;\n\t/**\n\t * Select this item when showing. *Note* that only one completion item can be selected and\n\t * that the editor decides which item that is. The rule is that the *first* item of those\n\t * that match best is selected.\n\t */\n\tpreselect?: boolean;\n\t/**\n\t * A string or snippet that should be inserted in a document when selecting\n\t * this completion.\n\t */\n\tinsertText: string;\n\t/**\n\t * Additional rules (as bitmask) that should be applied when inserting\n\t * this completion.\n\t */\n\tinsertTextRules?: CompletionItemInsertTextRule;\n\t/**\n\t * A range of text that should be replaced by this completion item.\n\t *\n\t * Defaults to a range from the start of the {@link TextDocument.getWordRangeAtPosition current word} to the\n\t * current position.\n\t *\n\t * *Note:* The range must be a {@link Range.isSingleLine single line} and it must\n\t * {@link Range.contains contain} the position at which completion has been {@link CompletionItemProvider.provideCompletionItems requested}.\n\t */\n\trange: IRange | CompletionItemRanges;\n\t/**\n\t * An optional set of characters that when pressed while this completion is active will accept it first and\n\t * then type that character. *Note* that all commit characters should have `length=1` and that superfluous\n\t * characters will be ignored.\n\t */\n\tcommitCharacters?: string[];\n\t/**\n\t * An optional array of additional text edits that are applied when\n\t * selecting this completion. Edits must not overlap with the main edit\n\t * nor with themselves.\n\t */\n\tadditionalTextEdits?: ISingleEditOperation[];\n\t/**\n\t * A command that should be run upon acceptance of this item.\n\t */\n\tcommand?: Command;\n\t/**\n\t * @internal\n\t */\n\textensionId?: ExtensionIdentifier;\n}\n\nexport interface CompletionList {\n\tsuggestions: CompletionItem[];\n\tincomplete?: boolean;\n\tdispose?(): void;\n\n\t/**\n\t * @internal\n\t */\n\tduration?: number;\n}\n\n/**\n * Info provided on partial acceptance.\n */\nexport interface PartialAcceptInfo {\n\tkind: PartialAcceptTriggerKind;\n}\n\n/**\n * How a partial acceptance was triggered.\n */\nexport const enum PartialAcceptTriggerKind {\n\tWord = 0,\n\tLine = 1,\n\tSuggest = 2,\n}\n\n/**\n * How a suggest provider was triggered.\n */\nexport const enum CompletionTriggerKind {\n\tInvoke = 0,\n\tTriggerCharacter = 1,\n\tTriggerForIncompleteCompletions = 2\n}\n/**\n * Contains additional information about the context in which\n * {@link CompletionItemProvider.provideCompletionItems completion provider} is triggered.\n */\nexport interface CompletionContext {\n\t/**\n\t * How the completion was triggered.\n\t */\n\ttriggerKind: CompletionTriggerKind;\n\t/**\n\t * Character that triggered the completion item provider.\n\t *\n\t * `undefined` if provider was not triggered by a character.\n\t */\n\ttriggerCharacter?: string;\n}\n/**\n * The completion item provider interface defines the contract between extensions and\n * the [IntelliSense](https://code.visualstudio.com/docs/editor/intellisense).\n *\n * When computing *complete* completion items is expensive, providers can optionally implement\n * the `resolveCompletionItem`-function. In that case it is enough to return completion\n * items with a {@link CompletionItem.label label} from the\n * {@link CompletionItemProvider.provideCompletionItems provideCompletionItems}-function. Subsequently,\n * when a completion item is shown in the UI and gains focus this provider is asked to resolve\n * the item, like adding {@link CompletionItem.documentation doc-comment} or {@link CompletionItem.detail details}.\n */\nexport interface CompletionItemProvider {\n\n\t/**\n\t * Used to identify completions in the (debug) UI and telemetry. This isn't the extension identifier because extensions\n\t * often contribute multiple completion item providers.\n\t *\n\t * @internal\n\t */\n\t_debugDisplayName: string;\n\n\ttriggerCharacters?: string[];\n\t/**\n\t * Provide completion items for the given position and document.\n\t */\n\tprovideCompletionItems(model: model.ITextModel, position: Position, context: CompletionContext, token: CancellationToken): ProviderResult<CompletionList>;\n\n\t/**\n\t * Given a completion item fill in more data, like {@link CompletionItem.documentation doc-comment}\n\t * or {@link CompletionItem.detail details}.\n\t *\n\t * The editor will only resolve a completion item once.\n\t */\n\tresolveCompletionItem?(item: CompletionItem, token: CancellationToken): ProviderResult<CompletionItem>;\n}\n\n/**\n * How an {@link InlineCompletionsProvider inline completion provider} was triggered.\n */\nexport enum InlineCompletionTriggerKind {\n\t/**\n\t * Completion was triggered automatically while editing.\n\t * It is sufficient to return a single completion item in this case.\n\t */\n\tAutomatic = 0,\n\n\t/**\n\t * Completion was triggered explicitly by a user gesture.\n\t * Return multiple completion items to enable cycling through them.\n\t */\n\tExplicit = 1,\n}\n\nexport interface InlineCompletionContext {\n\n\t/**\n\t * How the completion was triggered.\n\t */\n\treadonly triggerKind: InlineCompletionTriggerKind;\n\treadonly selectedSuggestionInfo: SelectedSuggestionInfo | undefined;\n\t/**\n\t * @experimental\n\t * @internal\n\t*/\n\treadonly userPrompt?: string | undefined;\n}\n\nexport class SelectedSuggestionInfo {\n\tconstructor(\n\t\tpublic readonly range: IRange,\n\t\tpublic readonly text: string,\n\t\tpublic readonly completionKind: CompletionItemKind,\n\t\tpublic readonly isSnippetText: boolean,\n\t) {\n\t}\n\n\tpublic equals(other: SelectedSuggestionInfo) {\n\t\treturn Range.lift(this.range).equalsRange(other.range)\n\t\t\t&& this.text === other.text\n\t\t\t&& this.completionKind === other.completionKind\n\t\t\t&& this.isSnippetText === other.isSnippetText;\n\t}\n}\n\nexport interface InlineCompletion {\n\t/**\n\t * The text to insert.\n\t * If the text contains a line break, the range must end at the end of a line.\n\t * If existing text should be replaced, the existing text must be a prefix of the text to insert.\n\t *\n\t * The text can also be a snippet. In that case, a preview with default parameters is shown.\n\t * When accepting the suggestion, the full snippet is inserted.\n\t*/\n\treadonly insertText: string | { snippet: string };\n\n\t/**\n\t * A text that is used to decide if this inline completion should be shown.\n\t * An inline completion is shown if the text to replace is a subword of the filter text.\n\t */\n\treadonly filterText?: string;\n\n\t/**\n\t * An optional array of additional text edits that are applied when\n\t * selecting this completion. Edits must not overlap with the main edit\n\t * nor with themselves.\n\t */\n\treadonly additionalTextEdits?: ISingleEditOperation[];\n\n\t/**\n\t * The range to replace.\n\t * Must begin and end on the same line.\n\t*/\n\treadonly range?: IRange;\n\n\treadonly command?: Command;\n\n\t/**\n\t * If set to `true`, unopened closing brackets are removed and unclosed opening brackets are closed.\n\t * Defaults to `false`.\n\t*/\n\treadonly completeBracketPairs?: boolean;\n}\n\nexport interface InlineCompletions<TItem extends InlineCompletion = InlineCompletion> {\n\treadonly items: readonly TItem[];\n\t/**\n\t * A list of commands associated with the inline completions of this list.\n\t */\n\treadonly commands?: Command[];\n\n\treadonly suppressSuggestions?: boolean | undefined;\n\n\t/**\n\t * When set and the user types a suggestion without derivating from it, the inline suggestion is not updated.\n\t */\n\treadonly enableForwardStability?: boolean | undefined;\n}\n\nexport type InlineCompletionProviderGroupId = string;\n\nexport interface InlineCompletionsProvider<T extends InlineCompletions = InlineCompletions> {\n\tprovideInlineCompletions(model: model.ITextModel, position: Position, context: InlineCompletionContext, token: CancellationToken): ProviderResult<T>;\n\n\t/**\n\t * @experimental\n\t * @internal\n\t*/\n\tprovideInlineEdits?(model: model.ITextModel, range: Range, context: InlineCompletionContext, token: CancellationToken): ProviderResult<T>;\n\n\t/**\n\t * Will be called when an item is shown.\n\t * @param updatedInsertText Is useful to understand bracket completion.\n\t*/\n\thandleItemDidShow?(completions: T, item: T['items'][number], updatedInsertText: string): void;\n\n\t/**\n\t * Will be called when an item is partially accepted.\n\t */\n\thandlePartialAccept?(completions: T, item: T['items'][number], acceptedCharacters: number, info: PartialAcceptInfo): void;\n\n\t/**\n\t * Will be called when a completions list is no longer in use and can be garbage-collected.\n\t*/\n\tfreeInlineCompletions(completions: T): void;\n\n\t/**\n\t * Only used for {@link yieldsToGroupIds}.\n\t * Multiple providers can have the same group id.\n\t */\n\tgroupId?: InlineCompletionProviderGroupId;\n\n\t/**\n\t * Returns a list of preferred provider {@link groupId}s.\n\t * The current provider is only requested for completions if no provider with a preferred group id returned a result.\n\t */\n\tyieldsToGroupIds?: InlineCompletionProviderGroupId[];\n\n\ttoString?(): string;\n}\n\nexport interface CodeAction {\n\ttitle: string;\n\tcommand?: Command;\n\tedit?: WorkspaceEdit;\n\tdiagnostics?: IMarkerData[];\n\tkind?: string;\n\tisPreferred?: boolean;\n\tisAI?: boolean;\n\tdisabled?: string;\n\tranges?: IRange[];\n}\n\nexport const enum CodeActionTriggerType {\n\tInvoke = 1,\n\tAuto = 2,\n}\n\n/**\n * @internal\n */\nexport interface CodeActionContext {\n\tonly?: string;\n\ttrigger: CodeActionTriggerType;\n}\n\nexport interface CodeActionList extends IDisposable {\n\treadonly actions: ReadonlyArray<CodeAction>;\n}\n\n/**\n * The code action interface defines the contract between extensions and\n * the [light bulb](https://code.visualstudio.com/docs/editor/editingevolved#_code-action) feature.\n * @internal\n */\nexport interface CodeActionProvider {\n\n\t/**\n\t * Provide commands for the given document and range.\n\t */\n\tprovideCodeActions(model: model.ITextModel, range: Range | Selection, context: CodeActionContext, token: CancellationToken): ProviderResult<CodeActionList>;\n\n\t/**\n\t * Given a code action fill in the edit. Will only invoked when missing.\n\t */\n\tresolveCodeAction?(codeAction: CodeAction, token: CancellationToken): ProviderResult<CodeAction>;\n\n\t/**\n\t * Optional list of CodeActionKinds that this provider returns.\n\t */\n\treadonly providedCodeActionKinds?: ReadonlyArray<string>;\n\n\treadonly documentation?: ReadonlyArray<{ readonly kind: string; readonly command: Command }>;\n\n\t/**\n\t * @internal\n\t */\n\t_getAdditionalMenuItems?(context: CodeActionContext, actions: readonly CodeAction[]): Command[];\n}\n\n/**\n * @internal\n */\nexport interface DocumentPasteEdit {\n\treadonly title: string;\n\treadonly kind: HierarchicalKind;\n\treadonly handledMimeType?: string;\n\treadonly yieldTo?: readonly DropYieldTo[];\n\tinsertText: string | { readonly snippet: string };\n\tadditionalEdit?: WorkspaceEdit;\n}\n\n/**\n * @internal\n */\nexport enum DocumentPasteTriggerKind {\n\tAutomatic = 0,\n\tPasteAs = 1,\n}\n\n/**\n * @internal\n */\nexport interface DocumentPasteContext {\n\treadonly only?: HierarchicalKind;\n\treadonly triggerKind: DocumentPasteTriggerKind;\n}\n\n/**\n * @internal\n */\nexport interface DocumentPasteEditsSession {\n\tedits: readonly DocumentPasteEdit[];\n\tdispose(): void;\n}\n\n/**\n * @internal\n */\nexport interface DocumentPasteEditProvider {\n\treadonly id?: string;\n\treadonly copyMimeTypes?: readonly string[];\n\treadonly pasteMimeTypes?: readonly string[];\n\treadonly providedPasteEditKinds?: readonly HierarchicalKind[];\n\n\tprepareDocumentPaste?(model: model.ITextModel, ranges: readonly IRange[], dataTransfer: IReadonlyVSDataTransfer, token: CancellationToken): Promise<undefined | IReadonlyVSDataTransfer>;\n\n\tprovideDocumentPasteEdits?(model: model.ITextModel, ranges: readonly IRange[], dataTransfer: IReadonlyVSDataTransfer, context: DocumentPasteContext, token: CancellationToken): Promise<DocumentPasteEditsSession | undefined>;\n\n\tresolveDocumentPasteEdit?(edit: DocumentPasteEdit, token: CancellationToken): Promise<DocumentPasteEdit>;\n}\n\n/**\n * Represents a parameter of a callable-signature. A parameter can\n * have a label and a doc-comment.\n */\nexport interface ParameterInformation {\n\t/**\n\t * The label of this signature. Will be shown in\n\t * the UI.\n\t */\n\tlabel: string | [number, number];\n\t/**\n\t * The human-readable doc-comment of this signature. Will be shown\n\t * in the UI but can be omitted.\n\t */\n\tdocumentation?: string | IMarkdownString;\n}\n/**\n * Represents the signature of something callable. A signature\n * can have a label, like a function-name, a doc-comment, and\n * a set of parameters.\n */\nexport interface SignatureInformation {\n\t/**\n\t * The label of this signature. Will be shown in\n\t * the UI.\n\t */\n\tlabel: string;\n\t/**\n\t * The human-readable doc-comment of this signature. Will be shown\n\t * in the UI but can be omitted.\n\t */\n\tdocumentation?: string | IMarkdownString;\n\t/**\n\t * The parameters of this signature.\n\t */\n\tparameters: ParameterInformation[];\n\t/**\n\t * Index of the active parameter.\n\t *\n\t * If provided, this is used in place of `SignatureHelp.activeSignature`.\n\t */\n\tactiveParameter?: number;\n}\n/**\n * Signature help represents the signature of something\n * callable. There can be multiple signatures but only one\n * active and only one active parameter.\n */\nexport interface SignatureHelp {\n\t/**\n\t * One or more signatures.\n\t */\n\tsignatures: SignatureInformation[];\n\t/**\n\t * The active signature.\n\t */\n\tactiveSignature: number;\n\t/**\n\t * The active parameter of the active signature.\n\t */\n\tactiveParameter: number;\n}\n\nexport interface SignatureHelpResult extends IDisposable {\n\tvalue: SignatureHelp;\n}\n\nexport enum SignatureHelpTriggerKind {\n\tInvoke = 1,\n\tTriggerCharacter = 2,\n\tContentChange = 3,\n}\n\nexport interface SignatureHelpContext {\n\treadonly triggerKind: SignatureHelpTriggerKind;\n\treadonly triggerCharacter?: string;\n\treadonly isRetrigger: boolean;\n\treadonly activeSignatureHelp?: SignatureHelp;\n}\n\n/**\n * The signature help provider interface defines the contract between extensions and\n * the [parameter hints](https://code.visualstudio.com/docs/editor/intellisense)-feature.\n */\nexport interface SignatureHelpProvider {\n\n\treadonly signatureHelpTriggerCharacters?: ReadonlyArray<string>;\n\treadonly signatureHelpRetriggerCharacters?: ReadonlyArray<string>;\n\n\t/**\n\t * Provide help for the signature at the given position and document.\n\t */\n\tprovideSignatureHelp(model: model.ITextModel, position: Position, token: CancellationToken, context: SignatureHelpContext): ProviderResult<SignatureHelpResult>;\n}\n\n/**\n * A document highlight kind.\n */\nexport enum DocumentHighlightKind {\n\t/**\n\t * A textual occurrence.\n\t */\n\tText,\n\t/**\n\t * Read-access of a symbol, like reading a variable.\n\t */\n\tRead,\n\t/**\n\t * Write-access of a symbol, like writing to a variable.\n\t */\n\tWrite\n}\n/**\n * A document highlight is a range inside a text document which deserves\n * special attention. Usually a document highlight is visualized by changing\n * the background color of its range.\n */\nexport interface DocumentHighlight {\n\t/**\n\t * The range this highlight applies to.\n\t */\n\trange: IRange;\n\t/**\n\t * The highlight kind, default is {@link DocumentHighlightKind.Text text}.\n\t */\n\tkind?: DocumentHighlightKind;\n}\n\n/**\n * Represents a set of document highlights for a specific URI.\n */\nexport interface MultiDocumentHighlight {\n\t/**\n\t * The URI of the document that the highlights belong to.\n\t */\n\turi: URI;\n\n\t/**\n\t * The set of highlights for the document.\n\t */\n\thighlights: DocumentHighlight[];\n}\n\n/**\n * The document highlight provider interface defines the contract between extensions and\n * the word-highlight-feature.\n */\nexport interface DocumentHighlightProvider {\n\t/**\n\t * Provide a set of document highlights, like all occurrences of a variable or\n\t * all exit-points of a function.\n\t */\n\tprovideDocumentHighlights(model: model.ITextModel, position: Position, token: CancellationToken): ProviderResult<DocumentHighlight[]>;\n}\n\n/**\n * A provider that can provide document highlights across multiple documents.\n */\nexport interface MultiDocumentHighlightProvider {\n\treadonly selector: LanguageSelector;\n\n\t/**\n\t * Provide a Map of URI --> document highlights, like all occurrences of a variable or\n\t * all exit-points of a function.\n\t *\n\t * Used in cases such as split view, notebooks, etc. where there can be multiple documents\n\t * with shared symbols.\n\t *\n\t * @param primaryModel The primary text model.\n\t * @param position The position at which to provide document highlights.\n\t * @param otherModels The other text models to search for document highlights.\n\t * @param token A cancellation token.\n\t * @returns A map of URI to document highlights.\n\t */\n\tprovideMultiDocumentHighlights(primaryModel: model.ITextModel, position: Position, otherModels: model.ITextModel[], token: CancellationToken): ProviderResult<Map<URI, DocumentHighlight[]>>;\n}\n\n/**\n * The linked editing range provider interface defines the contract between extensions and\n * the linked editing feature.\n */\nexport interface LinkedEditingRangeProvider {\n\n\t/**\n\t * Provide a list of ranges that can be edited together.\n\t */\n\tprovideLinkedEditingRanges(model: model.ITextModel, position: Position, token: CancellationToken): ProviderResult<LinkedEditingRanges>;\n}\n\n/**\n * Represents a list of ranges that can be edited together along with a word pattern to describe valid contents.\n */\nexport interface LinkedEditingRanges {\n\t/**\n\t * A list of ranges that can be edited together. The ranges must have\n\t * identical length and text content. The ranges cannot overlap\n\t */\n\tranges: IRange[];\n\n\t/**\n\t * An optional word pattern that describes valid contents for the given ranges.\n\t * If no pattern is provided, the language configuration's word pattern will be used.\n\t */\n\twordPattern?: RegExp;\n}\n\n/**\n * Value-object that contains additional information when\n * requesting references.\n */\nexport interface ReferenceContext {\n\t/**\n\t * Include the declaration of the current symbol.\n\t */\n\tincludeDeclaration: boolean;\n}\n/**\n * The reference provider interface defines the contract between extensions and\n * the [find references](https://code.visualstudio.com/docs/editor/editingevolved#_peek)-feature.\n */\nexport interface ReferenceProvider {\n\t/**\n\t * Provide a set of project-wide references for the given position and document.\n\t */\n\tprovideReferences(model: model.ITextModel, position: Position, context: ReferenceContext, token: CancellationToken): ProviderResult<Location[]>;\n}\n\n/**\n * Represents a location inside a resource, such as a line\n * inside a text file.\n */\nexport interface Location {\n\t/**\n\t * The resource identifier of this location.\n\t */\n\turi: URI;\n\t/**\n\t * The document range of this locations.\n\t */\n\trange: IRange;\n}\n\nexport interface LocationLink {\n\t/**\n\t * A range to select where this link originates from.\n\t */\n\toriginSelectionRange?: IRange;\n\n\t/**\n\t * The target uri this link points to.\n\t */\n\turi: URI;\n\n\t/**\n\t * The full range this link points to.\n\t */\n\trange: IRange;\n\n\t/**\n\t * A range to select this link points to. Must be contained\n\t * in `LocationLink.range`.\n\t */\n\ttargetSelectionRange?: IRange;\n}\n\n/**\n * @internal\n */\nexport function isLocationLink(thing: any): thing is LocationLink {\n\treturn thing\n\t\t&& URI.isUri((thing as LocationLink).uri)\n\t\t&& Range.isIRange((thing as LocationLink).range)\n\t\t&& (Range.isIRange((thing as LocationLink).originSelectionRange) || Range.isIRange((thing as LocationLink).targetSelectionRange));\n}\n\nexport type Definition = Location | Location[] | LocationLink[];\n\n/**\n * The definition provider interface defines the contract between extensions and\n * the [go to definition](https://code.visualstudio.com/docs/editor/editingevolved#_go-to-definition)\n * and peek definition features.\n */\nexport interface DefinitionProvider {\n\t/**\n\t * Provide the definition of the symbol at the given position and document.\n\t */\n\tprovideDefinition(model: model.ITextModel, position: Position, token: CancellationToken): ProviderResult<Definition | LocationLink[]>;\n}\n\n/**\n * The definition provider interface defines the contract between extensions and\n * the [go to definition](https://code.visualstudio.com/docs/editor/editingevolved#_go-to-definition)\n * and peek definition features.\n */\nexport interface DeclarationProvider {\n\t/**\n\t * Provide the declaration of the symbol at the given position and document.\n\t */\n\tprovideDeclaration(model: model.ITextModel, position: Position, token: CancellationToken): ProviderResult<Definition | LocationLink[]>;\n}\n\n/**\n * The implementation provider interface defines the contract between extensions and\n * the go to implementation feature.\n */\nexport interface ImplementationProvider {\n\t/**\n\t * Provide the implementation of the symbol at the given position and document.\n\t */\n\tprovideImplementation(model: model.ITextModel, position: Position, token: CancellationToken): ProviderResult<Definition | LocationLink[]>;\n}\n\n/**\n * The type definition provider interface defines the contract between extensions and\n * the go to type definition feature.\n */\nexport interface TypeDefinitionProvider {\n\t/**\n\t * Provide the type definition of the symbol at the given position and document.\n\t */\n\tprovideTypeDefinition(model: model.ITextModel, position: Position, token: CancellationToken): ProviderResult<Definition | LocationLink[]>;\n}\n\n/**\n * A symbol kind.\n */\nexport const enum SymbolKind {\n\tFile = 0,\n\tModule = 1,\n\tNamespace = 2,\n\tPackage = 3,\n\tClass = 4,\n\tMethod = 5,\n\tProperty = 6,\n\tField = 7,\n\tConstructor = 8,\n\tEnum = 9,\n\tInterface = 10,\n\tFunction = 11,\n\tVariable = 12,\n\tConstant = 13,\n\tString = 14,\n\tNumber = 15,\n\tBoolean = 16,\n\tArray = 17,\n\tObject = 18,\n\tKey = 19,\n\tNull = 20,\n\tEnumMember = 21,\n\tStruct = 22,\n\tEvent = 23,\n\tOperator = 24,\n\tTypeParameter = 25\n}\n\n/**\n * @internal\n */\nexport const symbolKindNames: { [symbol: number]: string } = {\n\t[SymbolKind.Array]: localize('Array', \"array\"),\n\t[SymbolKind.Boolean]: localize('Boolean', \"boolean\"),\n\t[SymbolKind.Class]: localize('Class', \"class\"),\n\t[SymbolKind.Constant]: localize('Constant', \"constant\"),\n\t[SymbolKind.Constructor]: localize('Constructor', \"constructor\"),\n\t[SymbolKind.Enum]: localize('Enum', \"enumeration\"),\n\t[SymbolKind.EnumMember]: localize('EnumMember', \"enumeration member\"),\n\t[SymbolKind.Event]: localize('Event', \"event\"),\n\t[SymbolKind.Field]: localize('Field', \"field\"),\n\t[SymbolKind.File]: localize('File', \"file\"),\n\t[SymbolKind.Function]: localize('Function', \"function\"),\n\t[SymbolKind.Interface]: localize('Interface', \"interface\"),\n\t[SymbolKind.Key]: localize('Key', \"key\"),\n\t[SymbolKind.Method]: localize('Method', \"method\"),\n\t[SymbolKind.Module]: localize('Module', \"module\"),\n\t[SymbolKind.Namespace]: localize('Namespace', \"namespace\"),\n\t[SymbolKind.Null]: localize('Null', \"null\"),\n\t[SymbolKind.Number]: localize('Number', \"number\"),\n\t[SymbolKind.Object]: localize('Object', \"object\"),\n\t[SymbolKind.Operator]: localize('Operator', \"operator\"),\n\t[SymbolKind.Package]: localize('Package', \"package\"),\n\t[SymbolKind.Property]: localize('Property', \"property\"),\n\t[SymbolKind.String]: localize('String', \"string\"),\n\t[SymbolKind.Struct]: localize('Struct', \"struct\"),\n\t[SymbolKind.TypeParameter]: localize('TypeParameter', \"type parameter\"),\n\t[SymbolKind.Variable]: localize('Variable', \"variable\"),\n};\n\n/**\n * @internal\n */\nexport function getAriaLabelForSymbol(symbolName: string, kind: SymbolKind): string {\n\treturn localize('symbolAriaLabel', '{0} ({1})', symbolName, symbolKindNames[kind]);\n}\n\nexport const enum SymbolTag {\n\tDeprecated = 1,\n}\n\n/**\n * @internal\n */\nexport namespace SymbolKinds {\n\n\tconst byKind = new Map<SymbolKind, ThemeIcon>();\n\tbyKind.set(SymbolKind.File, Codicon.symbolFile);\n\tbyKind.set(SymbolKind.Module, Codicon.symbolModule);\n\tbyKind.set(SymbolKind.Namespace, Codicon.symbolNamespace);\n\tbyKind.set(SymbolKind.Package, Codicon.symbolPackage);\n\tbyKind.set(SymbolKind.Class, Codicon.symbolClass);\n\tbyKind.set(SymbolKind.Method, Codicon.symbolMethod);\n\tbyKind.set(SymbolKind.Property, Codicon.symbolProperty);\n\tbyKind.set(SymbolKind.Field, Codicon.symbolField);\n\tbyKind.set(SymbolKind.Constructor, Codicon.symbolConstructor);\n\tbyKind.set(SymbolKind.Enum, Codicon.symbolEnum);\n\tbyKind.set(SymbolKind.Interface, Codicon.symbolInterface);\n\tbyKind.set(SymbolKind.Function, Codicon.symbolFunction);\n\tbyKind.set(SymbolKind.Variable, Codicon.symbolVariable);\n\tbyKind.set(SymbolKind.Constant, Codicon.symbolConstant);\n\tbyKind.set(SymbolKind.String, Codicon.symbolString);\n\tbyKind.set(SymbolKind.Number, Codicon.symbolNumber);\n\tbyKind.set(SymbolKind.Boolean, Codicon.symbolBoolean);\n\tbyKind.set(SymbolKind.Array, Codicon.symbolArray);\n\tbyKind.set(SymbolKind.Object, Codicon.symbolObject);\n\tbyKind.set(SymbolKind.Key, Codicon.symbolKey);\n\tbyKind.set(SymbolKind.Null, Codicon.symbolNull);\n\tbyKind.set(SymbolKind.EnumMember, Codicon.symbolEnumMember);\n\tbyKind.set(SymbolKind.Struct, Codicon.symbolStruct);\n\tbyKind.set(SymbolKind.Event, Codicon.symbolEvent);\n\tbyKind.set(SymbolKind.Operator, Codicon.symbolOperator);\n\tbyKind.set(SymbolKind.TypeParameter, Codicon.symbolTypeParameter);\n\t/**\n\t * @internal\n\t */\n\texport function toIcon(kind: SymbolKind): ThemeIcon {\n\t\tlet icon = byKind.get(kind);\n\t\tif (!icon) {\n\t\t\tconsole.info('No codicon found for SymbolKind ' + kind);\n\t\t\ticon = Codicon.symbolProperty;\n\t\t}\n\t\treturn icon;\n\t}\n}\n\nexport interface DocumentSymbol {\n\tname: string;\n\tdetail: string;\n\tkind: SymbolKind;\n\ttags: ReadonlyArray<SymbolTag>;\n\tcontainerName?: string;\n\trange: IRange;\n\tselectionRange: IRange;\n\tchildren?: DocumentSymbol[];\n}\n\n/**\n * The document symbol provider interface defines the contract between extensions and\n * the [go to symbol](https://code.visualstudio.com/docs/editor/editingevolved#_go-to-symbol)-feature.\n */\nexport interface DocumentSymbolProvider {\n\n\tdisplayName?: string;\n\n\t/**\n\t * Provide symbol information for the given document.\n\t */\n\tprovideDocumentSymbols(model: model.ITextModel, token: CancellationToken): ProviderResult<DocumentSymbol[]>;\n}\n\nexport interface TextEdit {\n\trange: IRange;\n\ttext: string;\n\teol?: model.EndOfLineSequence;\n}\n\n/** @internal */\nexport abstract class TextEdit {\n}\n\n/**\n * Interface used to format a model\n */\nexport interface FormattingOptions {\n\t/**\n\t * Size of a tab in spaces.\n\t */\n\ttabSize: number;\n\t/**\n\t * Prefer spaces over tabs.\n\t */\n\tinsertSpaces: boolean;\n}\n/**\n * The document formatting provider interface defines the contract between extensions and\n * the formatting-feature.\n */\nexport interface DocumentFormattingEditProvider {\n\n\t/**\n\t * @internal\n\t */\n\treadonly extensionId?: ExtensionIdentifier;\n\n\treadonly displayName?: string;\n\n\t/**\n\t * Provide formatting edits for a whole document.\n\t */\n\tprovideDocumentFormattingEdits(model: model.ITextModel, options: FormattingOptions, token: CancellationToken): ProviderResult<TextEdit[]>;\n}\n/**\n * The document formatting provider interface defines the contract between extensions and\n * the formatting-feature.\n */\nexport interface DocumentRangeFormattingEditProvider {\n\t/**\n\t * @internal\n\t */\n\treadonly extensionId?: ExtensionIdentifier;\n\n\treadonly displayName?: string;\n\n\t/**\n\t * Provide formatting edits for a range in a document.\n\t *\n\t * The given range is a hint and providers can decide to format a smaller\n\t * or larger range. Often this is done by adjusting the start and end\n\t * of the range to full syntax nodes.\n\t */\n\tprovideDocumentRangeFormattingEdits(model: model.ITextModel, range: Range, options: FormattingOptions, token: CancellationToken): ProviderResult<TextEdit[]>;\n\n\tprovideDocumentRangesFormattingEdits?(model: model.ITextModel, ranges: Range[], options: FormattingOptions, token: CancellationToken): ProviderResult<TextEdit[]>;\n}\n/**\n * The document formatting provider interface defines the contract between extensions and\n * the formatting-feature.\n */\nexport interface OnTypeFormattingEditProvider {\n\n\tautoFormatTriggerCharacters: string[];\n\n\t/**\n\t * Provide formatting edits after a character has been typed.\n\t *\n\t * The given position and character should hint to the provider\n\t * what range the position to expand to, like find the matching `{`\n\t * when `}` has been entered.\n\t */\n\tprovideOnTypeFormattingEdits(model: model.ITextModel, position: Position, ch: string, options: FormattingOptions, token: CancellationToken): ProviderResult<TextEdit[]>;\n}\n\n/**\n * @internal\n */\nexport interface IInplaceReplaceSupportResult {\n\tvalue: string;\n\trange: IRange;\n}\n\n/**\n * A link inside the editor.\n */\nexport interface ILink {\n\trange: IRange;\n\turl?: URI | string;\n\ttooltip?: string;\n}\n\nexport interface ILinksList {\n\tlinks: ILink[];\n\tdispose?(): void;\n}\n/**\n * A provider of links.\n */\nexport interface LinkProvider {\n\tprovideLinks(model: model.ITextModel, token: CancellationToken): ProviderResult<ILinksList>;\n\tresolveLink?: (link: ILink, token: CancellationToken) => ProviderResult<ILink>;\n}\n\n/**\n * A color in RGBA format.\n */\nexport interface IColor {\n\n\t/**\n\t * The red component in the range [0-1].\n\t */\n\treadonly red: number;\n\n\t/**\n\t * The green component in the range [0-1].\n\t */\n\treadonly green: number;\n\n\t/**\n\t * The blue component in the range [0-1].\n\t */\n\treadonly blue: number;\n\n\t/**\n\t * The alpha component in the range [0-1].\n\t */\n\treadonly alpha: number;\n}\n\n/**\n * String representations for a color\n */\nexport interface IColorPresentation {\n\t/**\n\t * The label of this color presentation. It will be shown on the color\n\t * picker header. By default this is also the text that is inserted when selecting\n\t * this color presentation.\n\t */\n\tlabel: string;\n\t/**\n\t * An {@link TextEdit edit} which is applied to a document when selecting\n\t * this presentation for the color.\n\t */\n\ttextEdit?: TextEdit;\n\t/**\n\t * An optional array of additional {@link TextEdit text edits} that are applied when\n\t * selecting this color presentation.\n\t */\n\tadditionalTextEdits?: TextEdit[];\n}\n\n/**\n * A color range is a range in a text model which represents a color.\n */\nexport interface IColorInformation {\n\n\t/**\n\t * The range within the model.\n\t */\n\trange: IRange;\n\n\t/**\n\t * The color represented in this range.\n\t */\n\tcolor: IColor;\n}\n\n/**\n * A provider of colors for editor models.\n */\nexport interface DocumentColorProvider {\n\t/**\n\t * Provides the color ranges for a specific model.\n\t */\n\tprovideDocumentColors(model: model.ITextModel, token: CancellationToken): ProviderResult<IColorInformation[]>;\n\t/**\n\t * Provide the string representations for a color.\n\t */\n\tprovideColorPresentations(model: model.ITextModel, colorInfo: IColorInformation, token: CancellationToken): ProviderResult<IColorPresentation[]>;\n}\n\nexport interface SelectionRange {\n\trange: IRange;\n}\n\nexport interface SelectionRangeProvider {\n\t/**\n\t * Provide ranges that should be selected from the given position.\n\t */\n\tprovideSelectionRanges(model: model.ITextModel, positions: Position[], token: CancellationToken): ProviderResult<SelectionRange[][]>;\n}\n\nexport interface FoldingContext {\n}\n/**\n * A provider of folding ranges for editor models.\n */\nexport interface FoldingRangeProvider {\n\n\t/**\n\t * An optional event to signal that the folding ranges from this provider have changed.\n\t */\n\tonDidChange?: Event<this>;\n\n\t/**\n\t * Provides the folding ranges for a specific model.\n\t */\n\tprovideFoldingRanges(model: model.ITextModel, context: FoldingContext, token: CancellationToken): ProviderResult<FoldingRange[]>;\n}\n\nexport interface FoldingRange {\n\n\t/**\n\t * The one-based start line of the range to fold. The folded area starts after the line's last character.\n\t */\n\tstart: number;\n\n\t/**\n\t * The one-based end line of the range to fold. The folded area ends with the line's last character.\n\t */\n\tend: number;\n\n\t/**\n\t * Describes the {@link FoldingRangeKind Kind} of the folding range such as {@link FoldingRangeKind.Comment Comment} or\n\t * {@link FoldingRangeKind.Region Region}. The kind is used to categorize folding ranges and used by commands\n\t * like 'Fold all comments'. See\n\t * {@link FoldingRangeKind} for an enumeration of standardized kinds.\n\t */\n\tkind?: FoldingRangeKind;\n}\nexport class FoldingRangeKind {\n\t/**\n\t * Kind for folding range representing a comment. The value of the kind is 'comment'.\n\t */\n\tstatic readonly Comment = new FoldingRangeKind('comment');\n\t/**\n\t * Kind for folding range representing a import. The value of the kind is 'imports'.\n\t */\n\tstatic readonly Imports = new FoldingRangeKind('imports');\n\t/**\n\t * Kind for folding range representing regions (for example marked by `#region`, `#endregion`).\n\t * The value of the kind is 'region'.\n\t */\n\tstatic readonly Region = new FoldingRangeKind('region');\n\n\t/**\n\t * Returns a {@link FoldingRangeKind} for the given value.\n\t *\n\t * @param value of the kind.\n\t */\n\tstatic fromValue(value: string) {\n\t\tswitch (value) {\n\t\t\tcase 'comment': return FoldingRangeKind.Comment;\n\t\t\tcase 'imports': return FoldingRangeKind.Imports;\n\t\t\tcase 'region': return FoldingRangeKind.Region;\n\t\t}\n\t\treturn new FoldingRangeKind(value);\n\t}\n\n\t/**\n\t * Creates a new {@link FoldingRangeKind}.\n\t *\n\t * @param value of the kind.\n\t */\n\tpublic constructor(public value: string) {\n\t}\n}\n\n\nexport interface WorkspaceEditMetadata {\n\tneedsConfirmation: boolean;\n\tlabel: string;\n\tdescription?: string;\n}\n\nexport interface WorkspaceFileEditOptions {\n\toverwrite?: boolean;\n\tignoreIfNotExists?: boolean;\n\tignoreIfExists?: boolean;\n\trecursive?: boolean;\n\tcopy?: boolean;\n\tfolder?: boolean;\n\tskipTrashBin?: boolean;\n\tmaxSize?: number;\n}\n\nexport interface IWorkspaceFileEdit {\n\toldResource?: URI;\n\tnewResource?: URI;\n\toptions?: WorkspaceFileEditOptions;\n\tmetadata?: WorkspaceEditMetadata;\n}\n\nexport interface IWorkspaceTextEdit {\n\tresource: URI;\n\ttextEdit: TextEdit & { insertAsSnippet?: boolean };\n\tversionId: number | undefined;\n\tmetadata?: WorkspaceEditMetadata;\n}\n\nexport interface WorkspaceEdit {\n\tedits: Array<IWorkspaceTextEdit | IWorkspaceFileEdit>;\n}\n\nexport interface Rejection {\n\trejectReason?: string;\n}\nexport interface RenameLocation {\n\trange: IRange;\n\ttext: string;\n}\n\nexport interface RenameProvider {\n\tprovideRenameEdits(model: model.ITextModel, position: Position, newName: string, token: CancellationToken): ProviderResult<WorkspaceEdit & Rejection>;\n\tresolveRenameLocation?(model: model.ITextModel, position: Position, token: CancellationToken): ProviderResult<RenameLocation & Rejection>;\n}\n\nexport enum NewSymbolNameTag {\n\tAIGenerated = 1\n}\n\nexport enum NewSymbolNameTriggerKind {\n\tInvoke = 0,\n\tAutomatic = 1,\n}\n\nexport interface NewSymbolName {\n\treadonly newSymbolName: string;\n\treadonly tags?: readonly NewSymbolNameTag[];\n}\n\nexport interface NewSymbolNamesProvider {\n\tsupportsAutomaticNewSymbolNamesTriggerKind?: Promise<boolean | undefined>;\n\tprovideNewSymbolNames(model: model.ITextModel, range: IRange, triggerKind: NewSymbolNameTriggerKind, token: CancellationToken): ProviderResult<NewSymbolName[]>;\n}\n\nexport interface Command {\n\tid: string;\n\ttitle: string;\n\ttooltip?: string;\n\targuments?: any[];\n}\n\n/**\n * @internal\n */\nexport namespace Command {\n\n\t/**\n\t * @internal\n\t */\n\texport function is(obj: any): obj is Command {\n\t\tif (!obj || typeof obj !== 'object') {\n\t\t\treturn false;\n\t\t}\n\t\treturn typeof (<Command>obj).id === 'string' &&\n\t\t\ttypeof (<Command>obj).title === 'string';\n\t}\n}\n\nexport interface CommentThreadRevealOptions {\n\tpreserveFocus: boolean;\n\tfocusReply: boolean;\n}\n\nexport interface CommentAuthorInformation {\n\tname: string;\n\ticonPath?: UriComponents;\n\n}\n\nexport interface PendingCommentThread {\n\tbody: string;\n\trange: IRange | undefined;\n\turi: URI;\n\tuniqueOwner: string;\n\tisReply: boolean;\n}\n\nexport interface CodeLens {\n\trange: IRange;\n\tid?: string;\n\tcommand?: Command;\n}\n\nexport interface CodeLensList {\n\tlenses: CodeLens[];\n\tdispose(): void;\n}\n\nexport interface CodeLensProvider {\n\tonDidChange?: Event<this>;\n\tprovideCodeLenses(model: model.ITextModel, token: CancellationToken): ProviderResult<CodeLensList>;\n\tresolveCodeLens?(model: model.ITextModel, codeLens: CodeLens, token: CancellationToken): ProviderResult<CodeLens>;\n}\n\n\nexport enum InlayHintKind {\n\tType = 1,\n\tParameter = 2,\n}\n\nexport interface InlayHintLabelPart {\n\tlabel: string;\n\ttooltip?: string | IMarkdownString;\n\t// collapsible?: boolean;\n\tcommand?: Command;\n\tlocation?: Location;\n}\n\nexport interface InlayHint {\n\tlabel: string | InlayHintLabelPart[];\n\ttooltip?: string | IMarkdownString;\n\ttextEdits?: TextEdit[];\n\tposition: IPosition;\n\tkind?: InlayHintKind;\n\tpaddingLeft?: boolean;\n\tpaddingRight?: boolean;\n}\n\nexport interface InlayHintList {\n\thints: InlayHint[];\n\tdispose(): void;\n}\n\nexport interface InlayHintsProvider {\n\tdisplayName?: string;\n\tonDidChangeInlayHints?: Event<void>;\n\tprovideInlayHints(model: model.ITextModel, range: Range, token: CancellationToken): ProviderResult<InlayHintList>;\n\tresolveInlayHint?(hint: InlayHint, token: CancellationToken): ProviderResult<InlayHint>;\n}\n\nexport interface SemanticTokensLegend {\n\treadonly tokenTypes: string[];\n\treadonly tokenModifiers: string[];\n}\n\nexport interface SemanticTokens {\n\treadonly resultId?: string;\n\treadonly data: Uint32Array;\n}\n\nexport interface SemanticTokensEdit {\n\treadonly start: number;\n\treadonly deleteCount: number;\n\treadonly data?: Uint32Array;\n}\n\nexport interface SemanticTokensEdits {\n\treadonly resultId?: string;\n\treadonly edits: SemanticTokensEdit[];\n}\n\nexport interface DocumentSemanticTokensProvider {\n\tonDidChange?: Event<void>;\n\tgetLegend(): SemanticTokensLegend;\n\tprovideDocumentSemanticTokens(model: model.ITextModel, lastResultId: string | null, token: CancellationToken): ProviderResult<SemanticTokens | SemanticTokensEdits>;\n\treleaseDocumentSemanticTokens(resultId: string | undefined): void;\n}\n\nexport interface DocumentRangeSemanticTokensProvider {\n\tgetLegend(): SemanticTokensLegend;\n\tprovideDocumentRangeSemanticTokens(model: model.ITextModel, range: Range, token: CancellationToken): ProviderResult<SemanticTokens>;\n}\n\n/**\n * @internal\n */\nexport interface ITokenizationSupportChangedEvent {\n\tchangedLanguages: string[];\n\tchangedColorMap: boolean;\n}\n\n/**\n * @internal\n */\nexport interface ILazyTokenizationSupport<TSupport> {\n\tget tokenizationSupport(): Promise<TSupport | null>;\n}\n\n/**\n * @internal\n */\nexport class LazyTokenizationSupport<TSupport = ITokenizationSupport> implements IDisposable, ILazyTokenizationSupport<TSupport> {\n\tprivate _tokenizationSupport: Promise<TSupport & IDisposable | null> | null = null;\n\n\tconstructor(private readonly createSupport: () => Promise<TSupport & IDisposable | null>) {\n\t}\n\n\tdispose(): void {\n\t\tif (this._tokenizationSupport) {\n\t\t\tthis._tokenizationSupport.then((support) => {\n\t\t\t\tif (support) {\n\t\t\t\t\tsupport.dispose();\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t}\n\n\tget tokenizationSupport(): Promise<TSupport | null> {\n\t\tif (!this._tokenizationSupport) {\n\t\t\tthis._tokenizationSupport = this.createSupport();\n\t\t}\n\t\treturn this._tokenizationSupport;\n\t}\n}\n\n/**\n * @internal\n */\nexport interface ITokenizationRegistry<TSupport> {\n\n\t/**\n\t * An event triggered when:\n\t *  - a tokenization support is registered, unregistered or changed.\n\t *  - the color map is changed.\n\t */\n\tonDidChange: Event<ITokenizationSupportChangedEvent>;\n\n\t/**\n\t * Fire a change event for a language.\n\t * This is useful for languages that embed other languages.\n\t */\n\thandleChange(languageIds: string[]): void;\n\n\t/**\n\t * Register a tokenization support.\n\t */\n\tregister(languageId: string, support: TSupport): IDisposable;\n\n\t/**\n\t * Register a tokenization support factory.\n\t */\n\tregisterFactory(languageId: string, factory: ILazyTokenizationSupport<TSupport>): IDisposable;\n\n\t/**\n\t * Get or create the tokenization support for a language.\n\t * Returns `null` if not found.\n\t */\n\tgetOrCreate(languageId: string): Promise<TSupport | null>;\n\n\t/**\n\t * Get the tokenization support for a language.\n\t * Returns `null` if not found.\n\t */\n\tget(languageId: string): TSupport | null;\n\n\t/**\n\t * Returns false if a factory is still pending.\n\t */\n\tisResolved(languageId: string): boolean;\n\n\t/**\n\t * Set the new color map that all tokens will use in their ColorId binary encoded bits for foreground and background.\n\t */\n\tsetColorMap(colorMap: Color[]): void;\n\n\tgetColorMap(): Color[] | null;\n\n\tgetDefaultBackground(): Color | null;\n}\n\n/**\n * @internal\n */\nexport const TokenizationRegistry: ITokenizationRegistry<ITokenizationSupport> = new TokenizationRegistryImpl();\n\n/**\n * @internal\n */\nexport const TreeSitterTokenizationRegistry: ITokenizationRegistry<ITreeSitterTokenizationSupport> = new TokenizationRegistryImpl();\n\n/**\n * @internal\n */\nexport type DropYieldTo = { readonly kind: HierarchicalKind } | { readonly mimeType: string };\n\n/**\n * @internal\n */\nexport interface DocumentDropEdit {\n\treadonly title: string;\n\treadonly kind: HierarchicalKind | undefined;\n\treadonly handledMimeType?: string;\n\treadonly yieldTo?: readonly DropYieldTo[];\n\tinsertText: string | { readonly snippet: string };\n\tadditionalEdit?: WorkspaceEdit;\n}\n\n/**\n * @internal\n */\nexport interface DocumentDropEditsSession {\n\tedits: readonly DocumentDropEdit[];\n\tdispose(): void;\n}\n\n/**\n * @internal\n */\nexport interface DocumentDropEditProvider {\n\treadonly id?: string;\n\treadonly dropMimeTypes?: readonly string[];\n\n\tprovideDocumentDropEdits(model: model.ITextModel, position: IPosition, dataTransfer: IReadonlyVSDataTransfer, token: CancellationToken): ProviderResult<DocumentDropEditsSession>;\n}\n\nexport interface DocumentContextItem {\n\treadonly uri: URI;\n\treadonly version: number;\n\treadonly ranges: IRange[];\n}\n\nexport interface MappedEditsContext {\n\t/** The outer array is sorted by priority - from highest to lowest. The inner arrays contain elements of the same priority. */\n\tdocuments: DocumentContextItem[][];\n}\n\nexport interface MappedEditsProvider { // internal\n\n\t/**\n\t * Provider maps code blocks from the chat into a workspace edit.\n\t *\n\t * @param document The document to provide mapped edits for.\n\t * @param codeBlocks Code blocks that come from an LLM's reply.\n\t * \t\t\t\t\t\t\"Apply in Editor\" in the panel chat only sends one edit that the user clicks on, but inline chat can send multiple blocks and let the lang server decide what to do with them.\n\t * @param context The context for providing mapped edits.\n\t * @param token A cancellation token.\n\t * @returns A provider result of text edits.\n\t */\n\tprovideMappedEdits(\n\t\tdocument: model.ITextModel,\n\t\tcodeBlocks: string[],\n\t\tcontext: MappedEditsContext,\n\t\ttoken: CancellationToken\n\t): Promise<WorkspaceEdit | null>;\n}\n\nexport interface IInlineEdit {\n\ttext: string;\n\trange: IRange;\n\taccepted?: Command;\n\trejected?: Command;\n}\n\nexport interface IInlineEditContext {\n\ttriggerKind: InlineEditTriggerKind;\n}\n\nexport enum InlineEditTriggerKind {\n\tInvoke = 0,\n\tAutomatic = 1,\n}\n\nexport interface InlineEditProvider<T extends IInlineEdit = IInlineEdit> {\n\tprovideInlineEdit(model: model.ITextModel, context: IInlineEditContext, token: CancellationToken): ProviderResult<T>;\n\tfreeInlineEdit(edit: T): void;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { CancellationTokenSource } from 'vs/base/common/cancellation';\nimport { Emitter } from 'vs/base/common/event';\nimport { KeyChord, KeyMod as ConstKeyMod } from 'vs/base/common/keyCodes';\nimport { URI } from 'vs/base/common/uri';\nimport { Position } from 'vs/editor/common/core/position';\nimport { Range } from 'vs/editor/common/core/range';\nimport { Selection } from 'vs/editor/common/core/selection';\nimport { Token } from 'vs/editor/common/languages';\nimport * as standaloneEnums from 'vs/editor/common/standalone/standaloneEnums';\n\nexport class KeyMod {\n\tpublic static readonly CtrlCmd: number = ConstKeyMod.CtrlCmd;\n\tpublic static readonly Shift: number = ConstKeyMod.Shift;\n\tpublic static readonly Alt: number = ConstKeyMod.Alt;\n\tpublic static readonly WinCtrl: number = ConstKeyMod.WinCtrl;\n\n\tpublic static chord(firstPart: number, secondPart: number): number {\n\t\treturn KeyChord(firstPart, secondPart);\n\t}\n}\n\nexport function createMonacoBaseAPI(): typeof monaco {\n\treturn {\n\t\teditor: undefined!, // undefined override expected here\n\t\tlanguages: undefined!, // undefined override expected here\n\t\tCancellationTokenSource: CancellationTokenSource,\n\t\tEmitter: Emitter,\n\t\tKeyCode: standaloneEnums.KeyCode,\n\t\tKeyMod: KeyMod,\n\t\tPosition: Position,\n\t\tRange: Range,\n\t\tSelection: <any>Selection,\n\t\tSelectionDirection: standaloneEnums.SelectionDirection,\n\t\tMarkerSeverity: standaloneEnums.MarkerSeverity,\n\t\tMarkerTag: standaloneEnums.MarkerTag,\n\t\tUri: <any>URI,\n\t\tToken: Token\n\t};\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { IntervalTimer } from 'vs/base/common/async';\nimport { Disposable, DisposableStore, dispose, IDisposable, toDisposable } from 'vs/base/common/lifecycle';\nimport { URI } from 'vs/base/common/uri';\nimport { IPosition, Position } from 'vs/editor/common/core/position';\nimport { IRange, Range } from 'vs/editor/common/core/range';\nimport { ensureValidWordDefinition, getWordAtText, IWordAtPosition } from 'vs/editor/common/core/wordHelper';\nimport { IDocumentColorComputerTarget } from 'vs/editor/common/languages/defaultDocumentColorsComputer';\nimport { ILinkComputerTarget } from 'vs/editor/common/languages/linkComputer';\nimport { MirrorTextModel as BaseMirrorModel, IModelChangedEvent } from 'vs/editor/common/model/mirrorTextModel';\nimport { IMirrorModel, IWordRange } from 'vs/editor/common/services/editorSimpleWorker';\nimport { IModelService } from 'vs/editor/common/services/model';\nimport { IRawModelData, IWorkerTextModelSyncChannelServer } from 'vs/editor/common/services/textModelSync/textModelSync.protocol';\n\n/**\n * Stop syncing a model to the worker if it was not needed for 1 min.\n */\nexport const STOP_SYNC_MODEL_DELTA_TIME_MS = 60 * 1000;\n\nexport class WorkerTextModelSyncClient extends Disposable {\n\n\tprivate readonly _proxy: IWorkerTextModelSyncChannelServer;\n\tprivate readonly _modelService: IModelService;\n\tprivate _syncedModels: { [modelUrl: string]: IDisposable } = Object.create(null);\n\tprivate _syncedModelsLastUsedTime: { [modelUrl: string]: number } = Object.create(null);\n\n\tconstructor(proxy: IWorkerTextModelSyncChannelServer, modelService: IModelService, keepIdleModels: boolean = false) {\n\t\tsuper();\n\t\tthis._proxy = proxy;\n\t\tthis._modelService = modelService;\n\n\t\tif (!keepIdleModels) {\n\t\t\tconst timer = new IntervalTimer();\n\t\t\ttimer.cancelAndSet(() => this._checkStopModelSync(), Math.round(STOP_SYNC_MODEL_DELTA_TIME_MS / 2));\n\t\t\tthis._register(timer);\n\t\t}\n\t}\n\n\tpublic override dispose(): void {\n\t\tfor (const modelUrl in this._syncedModels) {\n\t\t\tdispose(this._syncedModels[modelUrl]);\n\t\t}\n\t\tthis._syncedModels = Object.create(null);\n\t\tthis._syncedModelsLastUsedTime = Object.create(null);\n\t\tsuper.dispose();\n\t}\n\n\tpublic ensureSyncedResources(resources: URI[], forceLargeModels: boolean = false): void {\n\t\tfor (const resource of resources) {\n\t\t\tconst resourceStr = resource.toString();\n\n\t\t\tif (!this._syncedModels[resourceStr]) {\n\t\t\t\tthis._beginModelSync(resource, forceLargeModels);\n\t\t\t}\n\t\t\tif (this._syncedModels[resourceStr]) {\n\t\t\t\tthis._syncedModelsLastUsedTime[resourceStr] = (new Date()).getTime();\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate _checkStopModelSync(): void {\n\t\tconst currentTime = (new Date()).getTime();\n\n\t\tconst toRemove: string[] = [];\n\t\tfor (const modelUrl in this._syncedModelsLastUsedTime) {\n\t\t\tconst elapsedTime = currentTime - this._syncedModelsLastUsedTime[modelUrl];\n\t\t\tif (elapsedTime > STOP_SYNC_MODEL_DELTA_TIME_MS) {\n\t\t\t\ttoRemove.push(modelUrl);\n\t\t\t}\n\t\t}\n\n\t\tfor (const e of toRemove) {\n\t\t\tthis._stopModelSync(e);\n\t\t}\n\t}\n\n\tprivate _beginModelSync(resource: URI, forceLargeModels: boolean): void {\n\t\tconst model = this._modelService.getModel(resource);\n\t\tif (!model) {\n\t\t\treturn;\n\t\t}\n\t\tif (!forceLargeModels && model.isTooLargeForSyncing()) {\n\t\t\treturn;\n\t\t}\n\n\t\tconst modelUrl = resource.toString();\n\n\t\tthis._proxy.$acceptNewModel({\n\t\t\turl: model.uri.toString(),\n\t\t\tlines: model.getLinesContent(),\n\t\t\tEOL: model.getEOL(),\n\t\t\tversionId: model.getVersionId()\n\t\t});\n\n\t\tconst toDispose = new DisposableStore();\n\t\ttoDispose.add(model.onDidChangeContent((e) => {\n\t\t\tthis._proxy.$acceptModelChanged(modelUrl.toString(), e);\n\t\t}));\n\t\ttoDispose.add(model.onWillDispose(() => {\n\t\t\tthis._stopModelSync(modelUrl);\n\t\t}));\n\t\ttoDispose.add(toDisposable(() => {\n\t\t\tthis._proxy.$acceptRemovedModel(modelUrl);\n\t\t}));\n\n\t\tthis._syncedModels[modelUrl] = toDispose;\n\t}\n\n\tprivate _stopModelSync(modelUrl: string): void {\n\t\tconst toDispose = this._syncedModels[modelUrl];\n\t\tdelete this._syncedModels[modelUrl];\n\t\tdelete this._syncedModelsLastUsedTime[modelUrl];\n\t\tdispose(toDispose);\n\t}\n}\n\nexport class WorkerTextModelSyncServer implements IWorkerTextModelSyncChannelServer {\n\n\tprivate readonly _models: { [uri: string]: MirrorModel };\n\n\tconstructor() {\n\t\tthis._models = Object.create(null);\n\t}\n\n\tpublic getModel(uri: string): ICommonModel | undefined {\n\t\treturn this._models[uri];\n\t}\n\n\tpublic getModels(): ICommonModel[] {\n\t\tconst all: MirrorModel[] = [];\n\t\tObject.keys(this._models).forEach((key) => all.push(this._models[key]));\n\t\treturn all;\n\t}\n\n\t$acceptNewModel(data: IRawModelData): void {\n\t\tthis._models[data.url] = new MirrorModel(URI.parse(data.url), data.lines, data.EOL, data.versionId);\n\t}\n\n\t$acceptModelChanged(uri: string, e: IModelChangedEvent): void {\n\t\tif (!this._models[uri]) {\n\t\t\treturn;\n\t\t}\n\t\tconst model = this._models[uri];\n\t\tmodel.onEvents(e);\n\t}\n\n\t$acceptRemovedModel(uri: string): void {\n\t\tif (!this._models[uri]) {\n\t\t\treturn;\n\t\t}\n\t\tdelete this._models[uri];\n\t}\n}\n\nexport class MirrorModel extends BaseMirrorModel implements ICommonModel {\n\n\tpublic get uri(): URI {\n\t\treturn this._uri;\n\t}\n\n\tpublic get eol(): string {\n\t\treturn this._eol;\n\t}\n\n\tpublic getValue(): string {\n\t\treturn this.getText();\n\t}\n\n\tpublic findMatches(regex: RegExp): RegExpMatchArray[] {\n\t\tconst matches = [];\n\t\tfor (let i = 0; i < this._lines.length; i++) {\n\t\t\tconst line = this._lines[i];\n\t\t\tconst offsetToAdd = this.offsetAt(new Position(i + 1, 1));\n\t\t\tconst iteratorOverMatches = line.matchAll(regex);\n\t\t\tfor (const match of iteratorOverMatches) {\n\t\t\t\tif (match.index || match.index === 0) {\n\t\t\t\t\tmatch.index = match.index + offsetToAdd;\n\t\t\t\t}\n\t\t\t\tmatches.push(match);\n\t\t\t}\n\t\t}\n\t\treturn matches;\n\t}\n\n\tpublic getLinesContent(): string[] {\n\t\treturn this._lines.slice(0);\n\t}\n\n\tpublic getLineCount(): number {\n\t\treturn this._lines.length;\n\t}\n\n\tpublic getLineContent(lineNumber: number): string {\n\t\treturn this._lines[lineNumber - 1];\n\t}\n\n\tpublic getWordAtPosition(position: IPosition, wordDefinition: RegExp): Range | null {\n\n\t\tconst wordAtText = getWordAtText(\n\t\t\tposition.column,\n\t\t\tensureValidWordDefinition(wordDefinition),\n\t\t\tthis._lines[position.lineNumber - 1],\n\t\t\t0\n\t\t);\n\n\t\tif (wordAtText) {\n\t\t\treturn new Range(position.lineNumber, wordAtText.startColumn, position.lineNumber, wordAtText.endColumn);\n\t\t}\n\n\t\treturn null;\n\t}\n\n\n\tpublic words(wordDefinition: RegExp): Iterable<string> {\n\n\t\tconst lines = this._lines;\n\t\tconst wordenize = this._wordenize.bind(this);\n\n\t\tlet lineNumber = 0;\n\t\tlet lineText = '';\n\t\tlet wordRangesIdx = 0;\n\t\tlet wordRanges: IWordRange[] = [];\n\n\t\treturn {\n\t\t\t*[Symbol.iterator]() {\n\t\t\t\twhile (true) {\n\t\t\t\t\tif (wordRangesIdx < wordRanges.length) {\n\t\t\t\t\t\tconst value = lineText.substring(wordRanges[wordRangesIdx].start, wordRanges[wordRangesIdx].end);\n\t\t\t\t\t\twordRangesIdx += 1;\n\t\t\t\t\t\tyield value;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (lineNumber < lines.length) {\n\t\t\t\t\t\t\tlineText = lines[lineNumber];\n\t\t\t\t\t\t\twordRanges = wordenize(lineText, wordDefinition);\n\t\t\t\t\t\t\twordRangesIdx = 0;\n\t\t\t\t\t\t\tlineNumber += 1;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t}\n\n\tpublic getLineWords(lineNumber: number, wordDefinition: RegExp): IWordAtPosition[] {\n\t\tconst content = this._lines[lineNumber - 1];\n\t\tconst ranges = this._wordenize(content, wordDefinition);\n\t\tconst words: IWordAtPosition[] = [];\n\t\tfor (const range of ranges) {\n\t\t\twords.push({\n\t\t\t\tword: content.substring(range.start, range.end),\n\t\t\t\tstartColumn: range.start + 1,\n\t\t\t\tendColumn: range.end + 1\n\t\t\t});\n\t\t}\n\t\treturn words;\n\t}\n\n\tprivate _wordenize(content: string, wordDefinition: RegExp): IWordRange[] {\n\t\tconst result: IWordRange[] = [];\n\t\tlet match: RegExpExecArray | null;\n\n\t\twordDefinition.lastIndex = 0; // reset lastIndex just to be sure\n\n\t\twhile (match = wordDefinition.exec(content)) {\n\t\t\tif (match[0].length === 0) {\n\t\t\t\t// it did match the empty string\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tresult.push({ start: match.index, end: match.index + match[0].length });\n\t\t}\n\t\treturn result;\n\t}\n\n\tpublic getValueInRange(range: IRange): string {\n\t\trange = this._validateRange(range);\n\n\t\tif (range.startLineNumber === range.endLineNumber) {\n\t\t\treturn this._lines[range.startLineNumber - 1].substring(range.startColumn - 1, range.endColumn - 1);\n\t\t}\n\n\t\tconst lineEnding = this._eol;\n\t\tconst startLineIndex = range.startLineNumber - 1;\n\t\tconst endLineIndex = range.endLineNumber - 1;\n\t\tconst resultLines: string[] = [];\n\n\t\tresultLines.push(this._lines[startLineIndex].substring(range.startColumn - 1));\n\t\tfor (let i = startLineIndex + 1; i < endLineIndex; i++) {\n\t\t\tresultLines.push(this._lines[i]);\n\t\t}\n\t\tresultLines.push(this._lines[endLineIndex].substring(0, range.endColumn - 1));\n\n\t\treturn resultLines.join(lineEnding);\n\t}\n\n\tpublic offsetAt(position: IPosition): number {\n\t\tposition = this._validatePosition(position);\n\t\tthis._ensureLineStarts();\n\t\treturn this._lineStarts!.getPrefixSum(position.lineNumber - 2) + (position.column - 1);\n\t}\n\n\tpublic positionAt(offset: number): IPosition {\n\t\toffset = Math.floor(offset);\n\t\toffset = Math.max(0, offset);\n\n\t\tthis._ensureLineStarts();\n\t\tconst out = this._lineStarts!.getIndexOf(offset);\n\t\tconst lineLength = this._lines[out.index].length;\n\n\t\t// Ensure we return a valid position\n\t\treturn {\n\t\t\tlineNumber: 1 + out.index,\n\t\t\tcolumn: 1 + Math.min(out.remainder, lineLength)\n\t\t};\n\t}\n\n\tprivate _validateRange(range: IRange): IRange {\n\n\t\tconst start = this._validatePosition({ lineNumber: range.startLineNumber, column: range.startColumn });\n\t\tconst end = this._validatePosition({ lineNumber: range.endLineNumber, column: range.endColumn });\n\n\t\tif (start.lineNumber !== range.startLineNumber\n\t\t\t|| start.column !== range.startColumn\n\t\t\t|| end.lineNumber !== range.endLineNumber\n\t\t\t|| end.column !== range.endColumn) {\n\n\t\t\treturn {\n\t\t\t\tstartLineNumber: start.lineNumber,\n\t\t\t\tstartColumn: start.column,\n\t\t\t\tendLineNumber: end.lineNumber,\n\t\t\t\tendColumn: end.column\n\t\t\t};\n\t\t}\n\n\t\treturn range;\n\t}\n\n\tprivate _validatePosition(position: IPosition): IPosition {\n\t\tif (!Position.isIPosition(position)) {\n\t\t\tthrow new Error('bad position');\n\t\t}\n\t\tlet { lineNumber, column } = position;\n\t\tlet hasChanged = false;\n\n\t\tif (lineNumber < 1) {\n\t\t\tlineNumber = 1;\n\t\t\tcolumn = 1;\n\t\t\thasChanged = true;\n\n\t\t} else if (lineNumber > this._lines.length) {\n\t\t\tlineNumber = this._lines.length;\n\t\t\tcolumn = this._lines[lineNumber - 1].length + 1;\n\t\t\thasChanged = true;\n\n\t\t} else {\n\t\t\tconst maxCharacter = this._lines[lineNumber - 1].length + 1;\n\t\t\tif (column < 1) {\n\t\t\t\tcolumn = 1;\n\t\t\t\thasChanged = true;\n\t\t\t}\n\t\t\telse if (column > maxCharacter) {\n\t\t\t\tcolumn = maxCharacter;\n\t\t\t\thasChanged = true;\n\t\t\t}\n\t\t}\n\n\t\tif (!hasChanged) {\n\t\t\treturn position;\n\t\t} else {\n\t\t\treturn { lineNumber, column };\n\t\t}\n\t}\n}\n\nexport interface ICommonModel extends ILinkComputerTarget, IDocumentColorComputerTarget, IMirrorModel {\n\teol: string;\n\n\tgetLinesContent(): string[];\n\tgetLineCount(): number;\n\tgetLineContent(lineNumber: number): string;\n\tgetLineWords(lineNumber: number, wordDefinition: RegExp): IWordAtPosition[];\n\twords(wordDefinition: RegExp): Iterable<string>;\n\tgetValueInRange(range: IRange): string;\n\tgetWordAtPosition(position: IPosition, wordDefinition: RegExp): Range | null;\n\toffsetAt(position: IPosition): number;\n\tpositionAt(offset: number): IPosition;\n}\n","/*---------------------------------------------------------------------------------------------\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 *--------------------------------------------------------------------------------------------*/\n\nimport { stringDiff } from 'vs/base/common/diff/diff';\nimport { IDisposable } from 'vs/base/common/lifecycle';\nimport { URI } from 'vs/base/common/uri';\nimport { IRequestHandler, IWorkerServer } from 'vs/base/common/worker/simpleWorker';\nimport { IRange, Range } from 'vs/editor/common/core/range';\nimport { EndOfLineSequence, ITextModel } from 'vs/editor/common/model';\nimport { IMirrorTextModel, IModelChangedEvent } from 'vs/editor/common/model/mirrorTextModel';\nimport { IColorInformation, IInplaceReplaceSupportResult, ILink, TextEdit } from 'vs/editor/common/languages';\nimport { computeLinks } from 'vs/editor/common/languages/linkComputer';\nimport { BasicInplaceReplace } from 'vs/editor/common/languages/supports/inplaceReplaceSupport';\nimport { DiffAlgorithmName, IDiffComputationResult, ILineChange, IUnicodeHighlightsResult } from 'vs/editor/common/services/editorWorker';\nimport { createMonacoBaseAPI } from 'vs/editor/common/services/editorBaseApi';\nimport { EditorWorkerHost } from './editorWorkerHost';\nimport { StopWatch } from 'vs/base/common/stopwatch';\nimport { UnicodeTextModelHighlighter, UnicodeHighlighterOptions } from 'vs/editor/common/services/unicodeTextModelHighlighter';\nimport { ILinesDiffComputer } from 'vs/editor/common/diff/linesDiffComputer';\nimport { DetailedLineRangeMapping } from '../diff/rangeMapping';\nimport { linesDiffComputers } from 'vs/editor/common/diff/linesDiffComputers';\nimport { createProxyObject, getAllMethodNames } from 'vs/base/common/objects';\nimport { IDocumentDiffProviderOptions } from 'vs/editor/common/diff/documentDiffProvider';\nimport { AppResourcePath, FileAccess } from 'vs/base/common/network';\nimport { computeDefaultDocumentColors } from 'vs/editor/common/languages/defaultDocumentColorsComputer';\nimport { FindSectionHeaderOptions, SectionHeader, findSectionHeaders } from 'vs/editor/common/services/findSectionHeaders';\nimport { IRawModelData, IWorkerTextModelSyncChannelServer } from './textModelSync/textModelSync.protocol';\nimport { ICommonModel, WorkerTextModelSyncServer } from 'vs/editor/common/services/textModelSync/textModelSync.impl';\n\n// ESM-comment-begin\nconst isESM = false;\n// ESM-comment-end\n// ESM-uncomment-begin\n// const isESM = true;\n// ESM-uncomment-end\n\nexport interface IMirrorModel extends IMirrorTextModel {\n\treadonly uri: URI;\n\treadonly version: number;\n\tgetValue(): string;\n}\n\nexport interface IWorkerContext<H = undefined> {\n\t/**\n\t * A proxy to the main thread host object.\n\t */\n\thost: H;\n\t/**\n\t * Get all available mirror models in this worker.\n\t */\n\tgetMirrorModels(): IMirrorModel[];\n}\n\n/**\n * Range of a word inside a model.\n * @internal\n */\nexport interface IWordRange {\n\t/**\n\t * The index where the word starts.\n\t */\n\treadonly start: number;\n\t/**\n\t * The index where the word ends.\n\t */\n\treadonly end: number;\n}\n\n/**\n * @internal\n */\nexport interface IForeignModuleFactory {\n\t(ctx: IWorkerContext, createData: any): any;\n}\n\ndeclare const require: any;\n\n/**\n * @internal\n */\nexport class BaseEditorSimpleWorker implements IDisposable, IWorkerTextModelSyncChannelServer, IRequestHandler {\n\t_requestHandlerBrand: any;\n\n\tprivate readonly _workerTextModelSyncServer = new WorkerTextModelSyncServer();\n\n\tconstructor() {\n\t}\n\n\tdispose(): void {\n\t}\n\n\tprotected _getModel(uri: string): ICommonModel | undefined {\n\t\treturn this._workerTextModelSyncServer.getModel(uri);\n\t}\n\n\tprotected _getModels(): ICommonModel[] {\n\t\treturn this._workerTextModelSyncServer.getModels();\n\t}\n\n\tpublic $acceptNewModel(data: IRawModelData): void {\n\t\tthis._workerTextModelSyncServer.$acceptNewModel(data);\n\t}\n\n\tpublic $acceptModelChanged(uri: string, e: IModelChangedEvent): void {\n\t\tthis._workerTextModelSyncServer.$acceptModelChanged(uri, e);\n\t}\n\n\tpublic $acceptRemovedModel(uri: string): void {\n\t\tthis._workerTextModelSyncServer.$acceptRemovedModel(uri);\n\t}\n\n\tpublic async $computeUnicodeHighlights(url: string, options: UnicodeHighlighterOptions, range?: IRange): Promise<IUnicodeHighlightsResult> {\n\t\tconst model = this._getModel(url);\n\t\tif (!model) {\n\t\t\treturn { ranges: [], hasMore: false, ambiguousCharacterCount: 0, invisibleCharacterCount: 0, nonBasicAsciiCharacterCount: 0 };\n\t\t}\n\t\treturn UnicodeTextModelHighlighter.computeUnicodeHighlights(model, options, range);\n\t}\n\n\tpublic async $findSectionHeaders(url: string, options: FindSectionHeaderOptions): Promise<SectionHeader[]> {\n\t\tconst model = this._getModel(url);\n\t\tif (!model) {\n\t\t\treturn [];\n\t\t}\n\t\treturn findSectionHeaders(model, options);\n\t}\n\n\t// ---- BEGIN diff --------------------------------------------------------------------------\n\n\tpublic async $computeDiff(originalUrl: string, modifiedUrl: string, options: IDocumentDiffProviderOptions, algorithm: DiffAlgorithmName): Promise<IDiffComputationResult | null> {\n\t\tconst original = this._getModel(originalUrl);\n\t\tconst modified = this._getModel(modifiedUrl);\n\t\tif (!original || !modified) {\n\t\t\treturn null;\n\t\t}\n\n\t\tconst result = EditorSimpleWorker.computeDiff(original, modified, options, algorithm);\n\t\treturn result;\n\t}\n\n\tprivate static computeDiff(originalTextModel: ICommonModel | ITextModel, modifiedTextModel: ICommonModel | ITextModel, options: IDocumentDiffProviderOptions, algorithm: DiffAlgorithmName): IDiffComputationResult {\n\t\tconst diffAlgorithm: ILinesDiffComputer = algorithm === 'advanced' ? linesDiffComputers.getDefault() : linesDiffComputers.getLegacy();\n\n\t\tconst originalLines = originalTextModel.getLinesContent();\n\t\tconst modifiedLines = modifiedTextModel.getLinesContent();\n\n\t\tconst result = diffAlgorithm.computeDiff(originalLines, modifiedLines, options);\n\n\t\tconst identical = (result.changes.length > 0 ? false : this._modelsAreIdentical(originalTextModel, modifiedTextModel));\n\n\t\tfunction getLineChanges(changes: readonly DetailedLineRangeMapping[]): ILineChange[] {\n\t\t\treturn changes.map(m => ([m.original.startLineNumber, m.original.endLineNumberExclusive, m.modified.startLineNumber, m.modified.endLineNumberExclusive, m.innerChanges?.map(m => [\n\t\t\t\tm.originalRange.startLineNumber,\n\t\t\t\tm.originalRange.startColumn,\n\t\t\t\tm.originalRange.endLineNumber,\n\t\t\t\tm.originalRange.endColumn,\n\t\t\t\tm.modifiedRange.startLineNumber,\n\t\t\t\tm.modifiedRange.startColumn,\n\t\t\t\tm.modifiedRange.endLineNumber,\n\t\t\t\tm.modifiedRange.endColumn,\n\t\t\t])]));\n\t\t}\n\n\t\treturn {\n\t\t\tidentical,\n\t\t\tquitEarly: result.hitTimeout,\n\t\t\tchanges: getLineChanges(result.changes),\n\t\t\tmoves: result.moves.map(m => ([\n\t\t\t\tm.lineRangeMapping.original.startLineNumber,\n\t\t\t\tm.lineRangeMapping.original.endLineNumberExclusive,\n\t\t\t\tm.lineRangeMapping.modified.startLineNumber,\n\t\t\t\tm.lineRangeMapping.modified.endLineNumberExclusive,\n\t\t\t\tgetLineChanges(m.changes)\n\t\t\t])),\n\t\t};\n\t}\n\n\tprivate static _modelsAreIdentical(original: ICommonModel | ITextModel, modified: ICommonModel | ITextModel): boolean {\n\t\tconst originalLineCount = original.getLineCount();\n\t\tconst modifiedLineCount = modified.getLineCount();\n\t\tif (originalLineCount !== modifiedLineCount) {\n\t\t\treturn false;\n\t\t}\n\t\tfor (let line = 1; line <= originalLineCount; line++) {\n\t\t\tconst originalLine = original.getLineContent(line);\n\t\t\tconst modifiedLine = modified.getLineContent(line);\n\t\t\tif (originalLine !== modifiedLine) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t// ---- END diff --------------------------------------------------------------------------\n\n\n\t// ---- BEGIN minimal edits ---------------------------------------------------------------\n\n\tprivate static readonly _diffLimit = 100000;\n\n\tpublic async $computeMoreMinimalEdits(modelUrl: string, edits: TextEdit[], pretty: boolean): Promise<TextEdit[]> {\n\t\tconst model = this._getModel(modelUrl);\n\t\tif (!model) {\n\t\t\treturn edits;\n\t\t}\n\n\t\tconst result: TextEdit[] = [];\n\t\tlet lastEol: EndOfLineSequence | undefined = undefined;\n\n\t\tedits = edits.slice(0).sort((a, b) => {\n\t\t\tif (a.range && b.range) {\n\t\t\t\treturn Range.compareRangesUsingStarts(a.range, b.range);\n\t\t\t}\n\t\t\t// eol only changes should go to the end\n\t\t\tconst aRng = a.range ? 0 : 1;\n\t\t\tconst bRng = b.range ? 0 : 1;\n\t\t\treturn aRng - bRng;\n\t\t});\n\n\t\t// merge adjacent edits\n\t\tlet writeIndex = 0;\n\t\tfor (let readIndex = 1; readIndex < edits.length; readIndex++) {\n\t\t\tif (Range.getEndPosition(edits[writeIndex].range).equals(Range.getStartPosition(edits[readIndex].range))) {\n\t\t\t\tedits[writeIndex].range = Range.fromPositions(Range.getStartPosition(edits[writeIndex].range), Range.getEndPosition(edits[readIndex].range));\n\t\t\t\tedits[writeIndex].text += edits[readIndex].text;\n\t\t\t} else {\n\t\t\t\twriteIndex++;\n\t\t\t\tedits[writeIndex] = edits[readIndex];\n\t\t\t}\n\t\t}\n\t\tedits.length = writeIndex + 1;\n\n\t\tfor (let { range, text, eol } of edits) {\n\n\t\t\tif (typeof eol === 'number') {\n\t\t\t\tlastEol = eol;\n\t\t\t}\n\n\t\t\tif (Range.isEmpty(range) && !text) {\n\t\t\t\t// empty change\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst original = model.getValueInRange(range);\n\t\t\ttext = text.replace(/\\r\\n|\\n|\\r/g, model.eol);\n\n\t\t\tif (original === text) {\n\t\t\t\t// noop\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// make sure diff won't take too long\n\t\t\tif (Math.max(text.length, original.length) > EditorSimpleWorker._diffLimit) {\n\t\t\t\tresult.push({ range, text });\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// compute diff between original and edit.text\n\t\t\tconst changes = stringDiff(original, text, pretty);\n\t\t\tconst editOffset = model.offsetAt(Range.lift(range).getStartPosition());\n\n\t\t\tfor (const change of changes) {\n\t\t\t\tconst start = model.positionAt(editOffset + change.originalStart);\n\t\t\t\tconst end = model.positionAt(editOffset + change.originalStart + change.originalLength);\n\t\t\t\tconst newEdit: TextEdit = {\n\t\t\t\t\ttext: text.substr(change.modifiedStart, change.modifiedLength),\n\t\t\t\t\trange: { startLineNumber: start.lineNumber, startColumn: start.column, endLineNumber: end.lineNumber, endColumn: end.column }\n\t\t\t\t};\n\n\t\t\t\tif (model.getValueInRange(newEdit.range) !== newEdit.text) {\n\t\t\t\t\tresult.push(newEdit);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (typeof lastEol === 'number') {\n\t\t\tresult.push({ eol: lastEol, text: '', range: { startLineNumber: 0, startColumn: 0, endLineNumber: 0, endColumn: 0 } });\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t// ---- END minimal edits ---------------------------------------------------------------\n\n\tpublic async $computeLinks(modelUrl: string): Promise<ILink[] | null> {\n\t\tconst model = this._getModel(modelUrl);\n\t\tif (!model) {\n\t\t\treturn null;\n\t\t}\n\n\t\treturn computeLinks(model);\n\t}\n\n\t// --- BEGIN default document colors -----------------------------------------------------------\n\n\tpublic async $computeDefaultDocumentColors(modelUrl: string): Promise<IColorInformation[] | null> {\n\t\tconst model = this._getModel(modelUrl);\n\t\tif (!model) {\n\t\t\treturn null;\n\t\t}\n\t\treturn computeDefaultDocumentColors(model);\n\t}\n\n\t// ---- BEGIN suggest --------------------------------------------------------------------------\n\n\tprivate static readonly _suggestionsLimit = 10000;\n\n\tpublic async $textualSuggest(modelUrls: string[], leadingWord: string | undefined, wordDef: string, wordDefFlags: string): Promise<{ words: string[]; duration: number } | null> {\n\n\t\tconst sw = new StopWatch();\n\t\tconst wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n\t\tconst seen = new Set<string>();\n\n\t\touter: for (const url of modelUrls) {\n\t\t\tconst model = this._getModel(url);\n\t\t\tif (!model) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tfor (const word of model.words(wordDefRegExp)) {\n\t\t\t\tif (word === leadingWord || !isNaN(Number(word))) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tseen.add(word);\n\t\t\t\tif (seen.size > EditorSimpleWorker._suggestionsLimit) {\n\t\t\t\t\tbreak outer;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn { words: Array.from(seen), duration: sw.elapsed() };\n\t}\n\n\n\t// ---- END suggest --------------------------------------------------------------------------\n\n\t//#region -- word ranges --\n\n\tpublic async $computeWordRanges(modelUrl: string, range: IRange, wordDef: string, wordDefFlags: string): Promise<{ [word: string]: IRange[] }> {\n\t\tconst model = this._getModel(modelUrl);\n\t\tif (!model) {\n\t\t\treturn Object.create(null);\n\t\t}\n\t\tconst wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n\t\tconst result: { [word: string]: IRange[] } = Object.create(null);\n\t\tfor (let line = range.startLineNumber; line < range.endLineNumber; line++) {\n\t\t\tconst words = model.getLineWords(line, wordDefRegExp);\n\t\t\tfor (const word of words) {\n\t\t\t\tif (!isNaN(Number(word.word))) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tlet array = result[word.word];\n\t\t\t\tif (!array) {\n\t\t\t\t\tarray = [];\n\t\t\t\t\tresult[word.word] = array;\n\t\t\t\t}\n\t\t\t\tarray.push({\n\t\t\t\t\tstartLineNumber: line,\n\t\t\t\t\tstartColumn: word.startColumn,\n\t\t\t\t\tendLineNumber: line,\n\t\t\t\t\tendColumn: word.endColumn\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\t//#endregion\n\n\tpublic async $navigateValueSet(modelUrl: string, range: IRange, up: boolean, wordDef: string, wordDefFlags: string): Promise<IInplaceReplaceSupportResult | null> {\n\t\tconst model = this._getModel(modelUrl);\n\t\tif (!model) {\n\t\t\treturn null;\n\t\t}\n\n\t\tconst wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n\n\t\tif (range.startColumn === range.endColumn) {\n\t\t\trange = {\n\t\t\t\tstartLineNumber: range.startLineNumber,\n\t\t\t\tstartColumn: range.startColumn,\n\t\t\t\tendLineNumber: range.endLineNumber,\n\t\t\t\tendColumn: range.endColumn + 1\n\t\t\t};\n\t\t}\n\n\t\tconst selectionText = model.getValueInRange(range);\n\n\t\tconst wordRange = model.getWordAtPosition({ lineNumber: range.startLineNumber, column: range.startColumn }, wordDefRegExp);\n\t\tif (!wordRange) {\n\t\t\treturn null;\n\t\t}\n\t\tconst word = model.getValueInRange(wordRange);\n\t\tconst result = BasicInplaceReplace.INSTANCE.navigateValueSet(range, selectionText, wordRange, word, up);\n\t\treturn result;\n\t}\n}\n\n/**\n * @internal\n */\nexport class EditorSimpleWorker extends BaseEditorSimpleWorker {\n\n\tprivate _foreignModule: any = null;\n\n\tconstructor(\n\t\tprivate readonly _host: EditorWorkerHost,\n\t\tprivate readonly _foreignModuleFactory: IForeignModuleFactory | null\n\t) {\n\t\tsuper();\n\t}\n\n\tpublic async $ping() {\n\t\treturn 'pong';\n\t}\n\n\t// ---- BEGIN foreign module support --------------------------------------------------------------------------\n\n\tpublic $loadForeignModule(moduleId: string, createData: any, foreignHostMethods: string[]): Promise<string[]> {\n\t\tconst proxyMethodRequest = (method: string, args: any[]): Promise<any> => {\n\t\t\treturn this._host.$fhr(method, args);\n\t\t};\n\n\t\tconst foreignHost = createProxyObject(foreignHostMethods, proxyMethodRequest);\n\n\t\tconst ctx: IWorkerContext<any> = {\n\t\t\thost: foreignHost,\n\t\t\tgetMirrorModels: (): IMirrorModel[] => {\n\t\t\t\treturn this._getModels();\n\t\t\t}\n\t\t};\n\n\t\tif (this._foreignModuleFactory) {\n\t\t\tthis._foreignModule = this._foreignModuleFactory(ctx, createData);\n\t\t\t// static foreing module\n\t\t\treturn Promise.resolve(getAllMethodNames(this._foreignModule));\n\t\t}\n\n\t\treturn new Promise<any>((resolve, reject) => {\n\n\t\t\tconst onModuleCallback = (foreignModule: { create: IForeignModuleFactory }) => {\n\t\t\t\tthis._foreignModule = foreignModule.create(ctx, createData);\n\t\t\t\tresolve(getAllMethodNames(this._foreignModule));\n\t\t\t};\n\n\t\t\tif (!isESM) {\n\t\t\t\trequire([`${moduleId}`], onModuleCallback, reject);\n\t\t\t} else {\n\t\t\t\tconst url = FileAccess.asBrowserUri(`${moduleId}.js` as AppResourcePath).toString(true);\n\t\t\t\timport(`${url}`).then(onModuleCallback).catch(reject);\n\t\t\t}\n\t\t});\n\t}\n\n\t// foreign method request\n\tpublic $fmr(method: string, args: any[]): Promise<any> {\n\t\tif (!this._foreignModule || typeof this._foreignModule[method] !== 'function') {\n\t\t\treturn Promise.reject(new Error('Missing requestHandler or method: ' + method));\n\t\t}\n\n\t\ttry {\n\t\t\treturn Promise.resolve(this._foreignModule[method].apply(this._foreignModule, args));\n\t\t} catch (e) {\n\t\t\treturn Promise.reject(e);\n\t\t}\n\t}\n\n\t// ---- END foreign module support --------------------------------------------------------------------------\n}\n\n/**\n * Defines the worker entry point. Must be exported and named `create`.\n * @skipMangle\n * @internal\n */\nexport function create(workerServer: IWorkerServer): IRequestHandler {\n\treturn new EditorSimpleWorker(EditorWorkerHost.getChannel(workerServer), null);\n}\n\n// This is only available in a Web Worker\ndeclare function importScripts(...urls: string[]): void;\n\nif (typeof importScripts === 'function') {\n\t// Running in a web worker\n\tglobalThis.monaco = createMonacoBaseAPI();\n}\n"],"mappings":"AAAA;;;;;gEAAA,UAAA,CACA,IAAAA,EAAA,CAAA,UAAA,UAAA,8BAAA,wBAAA,iCAAA,oCAAA,yBAAA,wBAAA,2BAAA,uBAAA,0EAAA,0BAAA,wBAAA,kCAAA,qBAAA,4BAAA,uDAAA,qCAAA,4BAAA,0BAAA,4BAAA,qBAAA,2BAAA,8BAAA,2BAAA,uBAAA,8BAAA,yBAAA,sBAAA,4CAAA,mCAAA,mCAAA,+EAAA,wEAAA,0CAAA,kBAAA,SAAA,sBAAA,yBAAA,uBAAA,uBAAA,iCAAA,0BAAA,sBAAA,sBAAA,yBAAA,iCAAA,0BAAA,kCAAA,yCAAA,iCAAA,gDAAA,gFAAA,8DAAA,sFAAA,mEAAA,0EAAA,gDAAA,2CAAA,2DAAA,0CAAA,4DAAA,yBAAA,2CAAA,yCAAA,yCAAA,6CAAA,+CAAA,wDAAA,8CAAA,wCAAA,uBAAA,yBAAA,6BAAA,0CAAA,6DAAA,qCAAA,8CAAA,EACAC,EAAA,SAAAC,EAAA,CAEA,QADAC,EAAA,CAAA,EACA,EAAA,EAAAC,EAAAF,EAAA,OAAA,EAAAE,EAAA,IACAD,EAAA,CAAA,EAAAH,EAAAE,EAAA,CAAA,CAAA,EAEA,OAAAC,CACA,ECYA,MAAAE,GAAA,KACAC,GAAA,OAAA,QAAA,SAAA,OAAA,CAAA,EACA,IAAAC,IACA,SAAAA,EAAA,CACAA,EAAA,OAAAF,GACA,MAAAG,CAAA,CACA,IAAA,WAAA,CACA,YAAA,QAAA,EACA,KAAA,UACA,CACA,IAAA,QAAA,CACA,YAAA,QAAA,EACA,KAAA,OACA,CACA,IAAA,oBAAA,CACA,YAAA,QAAA,EACA,KAAA,mBACA,CACA,IAAA,aAAA,CACA,YAAA,QAAA,EACA,KAAA,YACA,CACA,IAAA,oCAAA,CACA,YAAA,QAAA,EACA,KAAA,mCACA,CACA,aAAA,CACA,KAAA,UAAA,GACA,KAAA,WAAA,GACA,KAAA,QAAA,GACA,KAAA,oBAAA,GACA,KAAA,aAAA,GACA,KAAA,oCAAA,EACA,CACA,SAAA,CACA,KAAA,YAGA,KAAA,UAAA,GACA,KAAA,WAAAA,EAAA,WAAA,EACA,KAAA,QAAA,OAAA,OAAA,KAAA,CAAA,CAAA,OAAA,QACA,KAAA,oBAAA,OAAA,QAAA,KAAA,OAAA,QAAA,SAAA,KAAA,OAAA,QAAA,SAAA,SAAA,KAAA,QAAA,OAAA,WACA,KAAA,aAAA,OAAAD,EAAA,OAAA,eAAA,WACA,KAAA,oCAAA,KAAA,cAAA,OAAA,QAAA,KAAA,OAAA,QAAA,SAAA,KAAA,OAAA,QAAA,SAAA,SAAA,KAAA,QAAA,OAAA,SACA,CACA,OAAA,YAAA,CACA,OAAA,OAAA,UAAA,KACA,UAAA,WAAA,UAAA,UAAA,QAAA,SAAA,GAAA,EACA,GAGA,OAAA,QAAA,IACA,QAAA,WAAA,QAEA,EACA,CACA,CACAA,EAAA,YAAAC,CACA,GAAAD,KAAAA,GAAA,CAAA,EAAA,EAKA,IAAAA,IACA,SAAAA,EAAA,CACA,MAAAE,CAAA,CACA,YAAAC,EAAAC,EAAAC,EAAA,CACA,KAAA,KAAAF,EACA,KAAA,OAAAC,EACA,KAAA,UAAAC,CACA,CACA,CACAL,EAAA,YAAAE,EACA,MAAAI,CAAA,CACA,YAAAC,EAAA,CACA,KAAA,QAAA,CAAA,IAAAL,EAAA,EAAA,GAAAK,CAAA,CAAA,CACA,CACA,OAAAJ,EAAAC,EAAA,CACA,KAAA,QAAA,KAAA,IAAAF,EAAAC,EAAAC,EAAAJ,EAAA,UAAA,4BAAA,CAAA,CAAA,CACA,CACA,WAAA,CACA,OAAA,KAAA,OACA,CACA,CACAA,EAAA,oBAAAM,EACA,MAAAE,CAAA,CACA,OAAAL,EAAAC,EAAA,CAEA,CACA,WAAA,CACA,MAAA,CAAA,CACA,CACA,CACAI,EAAA,SAAA,IAAAA,EACAR,EAAA,wBAAAQ,CACA,GAAAR,KAAAA,GAAA,CAAA,EAAA,EAKA,IAAAA,IACA,SAAAA,EAAA,CACA,MAAAS,CAAA,CAIA,OAAA,kBAAAC,EAAAC,EAAA,CAEA,GADAA,EAAA,UAAAA,CAAA,EAAA,QAAA,OAAA,GAAA,EACAD,EAAA,CACA,GAAA,eAAA,KAAAC,CAAA,EAEA,OAAAA,EAAA,OAAA,CAAA,EAEA,GAAA,aAAA,KAAAA,CAAA,EACA,OAAAA,EAAA,OAAA,CAAA,CAEA,SAEA,aAAA,KAAAA,CAAA,EACA,OAAAA,EAAA,OAAA,CAAA,EAIA,OAAAA,CACA,CACA,OAAA,WAAAC,EAAAC,EAAA,CACA,OAAAD,EAAA,QAAAC,EAAA,QAAAD,EAAA,OAAA,EAAAC,EAAA,MAAA,IAAAA,CACA,CACA,OAAA,SAAAD,EAAAC,EAAA,CACA,OAAAD,EAAA,QAAAC,EAAA,QAAAD,EAAA,OAAAA,EAAA,OAAAC,EAAA,MAAA,IAAAA,CACA,CAEA,OAAA,oBAAAC,EAAA,CACA,MAAA,cAAA,KAAAA,CAAA,CACA,CAIA,OAAA,eAAAA,EAAA,CACA,MAAA,+CAAA,KAAAA,CAAA,CACA,CACA,OAAA,gBAAAC,EAAAC,EAAA,CACA,GAAAD,EAAA,CACA,IAAAE,EACA,IAAAA,KAAAF,EACAA,EAAA,eAAAE,CAAA,GACAD,EAAAC,EAAAF,EAAAE,CAAA,CAAA,CAGA,CACA,CACA,OAAA,QAAAF,EAAA,CACA,IAAAG,EAAA,GACA,OAAAT,EAAA,gBAAAM,EAAA,IAAA,CACAG,EAAA,EACA,CAAA,EACAA,CACA,CACA,OAAA,eAAAH,EAAA,CAIA,GAHA,CAAAA,GAAA,OAAAA,GAAA,UAAAA,aAAA,QAGA,CAAA,MAAA,QAAAA,CAAA,GAAA,OAAA,eAAAA,CAAA,IAAA,OAAA,UAEA,OAAAA,EAEA,IAAAnB,EAAA,MAAA,QAAAmB,CAAA,EAAA,CAAA,EAAA,CAAA,EACA,OAAAN,EAAA,gBAAAM,EAAA,CAAAE,EAAAE,IAAA,CACAA,GAAA,OAAAA,GAAA,SACAvB,EAAAqB,CAAA,EAAAR,EAAA,eAAAU,CAAA,EAGAvB,EAAAqB,CAAA,EAAAE,CAEA,CAAA,EACAvB,CACA,CACA,OAAA,yBAAA,CACA,MAAA,eAAAa,EAAA,oBAAA,KACA,CACA,OAAA,kBAAAW,EAAA,CACA,OAAAX,EAAA,WAAAW,EAAA,cAAA,CACA,CACA,OAAA,6BAAA,CACA,OAAA,KAAA,yBACA,KAAA,uBAAA,GACA,KAAA,oBAAApB,EAAA,OAAA,aAAA,OAAAA,EAAA,OAAA,YAAA,KAAA,YAEA,KAAA,oBAAAA,EAAA,OAAA,YAAA,IAAA,EAAA,KAAA,IAAA,CACA,CACA,CACAS,EAAA,kBAAA,EACAA,EAAA,uBAAA,GACAA,EAAA,oBAAA,GACAT,EAAA,UAAAS,CACA,GAAAT,KAAAA,GAAA,CAAA,EAAA,EAKA,IAAAA,IACA,SAAAA,EAAA,CACA,SAAAqB,EAAAC,EAAA,CACA,GAAAA,aAAA,MACA,OAAAA,EAEA,MAAA1B,EAAA,IAAA,MAAA0B,EAAA,SAAA,OAAAA,CAAA,GAAA,eAAA,EACA,OAAAA,EAAA,QACA1B,EAAA,MAAA0B,EAAA,OAEA1B,CACA,CACAI,EAAA,YAAAqB,EAEA,MAAAE,CAAA,CAIA,OAAA,6BAAAC,EAAA,CACA,SAAAC,EAAAH,EAAA,CACA,GAAAA,EAAA,QAAA,UAAA,CACA,QAAA,MAAA,YAAAA,EAAA,SAAA,UAAA,EACA,QAAA,MAAAA,CAAA,EACA,QAAA,MAAA,yCAAA,EACA,QAAA,MAAAA,EAAA,QAAA,EACA,MACA,CACA,GAAAA,EAAA,QAAA,UAAA,CACA,QAAA,MAAA,4BAAAA,EAAA,SAAA,2BAAA,EACA,QAAA,MAAAA,CAAA,EACA,QAAA,MAAA,yCAAA,EACA,QAAA,MAAAA,EAAA,QAAA,EACA,MACA,CACA,CAwCA,GAvCAE,EAAAA,GAAA,CAAA,EACA,OAAAA,EAAA,SAAA,WACAA,EAAA,QAAA,IAEA,OAAAA,EAAA,SAAA,YACAA,EAAA,QAAA,IAEA,OAAAA,EAAA,OAAA,WACAA,EAAA,MAAA,CAAA,GAEA,OAAAA,EAAA,QAAA,WACAA,EAAA,OAAA,CAAA,GAEA,OAAAA,EAAA,WAAA,MACAA,EAAA,WAAA,IAEA,OAAAA,EAAA,YAAA,MACAA,EAAA,YAAA,IAEA,OAAAA,EAAA,SAAA,WACAA,EAAA,QAAA,IAEA,OAAAA,EAAA,SAAA,aACAA,EAAA,QAAAC,GAEA,MAAA,QAAAD,EAAA,sBAAA,IACAA,EAAA,uBAAA,CAAA,GAEAA,EAAA,QAAA,OAAA,IACAxB,EAAA,UAAA,SAAAwB,EAAA,QAAA,GAAA,IACAA,EAAA,SAAA,MAGA,OAAAA,EAAA,UAAA,WACAA,EAAA,SAAA,IAEA,OAAAA,EAAA,iBAAA,MACAA,EAAA,iBAAA,IAEAA,EAAA,gBAAA,OAAAA,EAAA,gBAAA,WACA,OAAAA,EAAA,eAAA,MAAA,WACAA,EAAA,eAAA,KAAA,SAEA,OAAAA,EAAA,eAAA,YAAA,UAAAA,EAAA,eAAA,WAAA,KACAA,EAAA,eAAA,WAAA,IAAA,GAEA,CAAAA,EAAA,eAAA,MAAA,OAAAA,EAAA,eAAA,MAAA,UAAA,CACA,MAAAF,EAAAD,EAAA,IAAA,MAAA,uDAAA,CAAA,EACAC,EAAA,MAAA,gBACAE,EAAA,QAAAF,CAAA,EACAE,EAAA,eAAA,MACA,CAEA,OAAAA,CACA,CACA,OAAA,0BAAAE,EAAA,KAAAC,EAAA,KAAA,CACA,IAAA/B,EAAAI,EAAA,UAAA,eAAA2B,GAAA,CAAA,CAAA,EAEA,OAAA3B,EAAA,UAAA,gBAAA0B,EAAA,CAAAT,EAAAE,IAAA,CACAF,IAAA,0BAAA,OAAArB,EAAA,uBAAA,IACAA,EAAA,uBAAAA,EAAA,uBAAA,OAAAuB,CAAA,EAEAF,IAAA,SAAA,OAAArB,EAAA,MAAA,IACAI,EAAA,UAAA,gBAAAmB,EAAA,CAAAS,EAAAC,IAAAjC,EAAA,MAAAgC,CAAA,EAAAC,CAAA,EAEAZ,IAAA,UAAA,OAAArB,EAAA,OAAA,IACAI,EAAA,UAAA,gBAAAmB,EAAA,CAAAS,EAAAC,IAAAjC,EAAA,OAAAgC,CAAA,EAAAC,CAAA,EAGAjC,EAAAqB,CAAA,EAAAjB,EAAA,UAAA,eAAAmB,CAAA,CAEA,CAAA,EACAI,EAAA,6BAAA3B,CAAA,CACA,CACA,CACAI,EAAA,yBAAAuB,EACA,MAAAO,CAAA,CACA,YAAAC,EAAAP,EAAA,CAKA,GAJA,KAAA,KAAAO,EACA,KAAA,QAAAR,EAAA,0BAAAC,CAAA,EACA,KAAA,iCAAA,EACA,KAAA,wBAAA,EACA,KAAA,QAAA,UAAA,IACA,KAAA,QAAA,aAAA,KAAA,QAAA,YAAA,MAAA,KAAA,QAAA,YAAA,KAAA,UAAA,KAAA,KAAA,OAAA,CACA,IAAAQ,EAAA,KAAA,QAAA,YAAA,KAAA,SACAC,EAAA,KAAA,IAAAD,EAAA,YAAA,GAAA,EAAAA,EAAA,YAAA,IAAA,CAAA,EACA,KAAA,QAAA,QAAAA,EAAA,UAAA,EAAAC,EAAA,CAAA,CACA,CAEA,CACA,kCAAA,CAEA,KAAA,0BAAA,CAAA,EACA,QAAAC,EAAA,EAAAA,EAAA,KAAA,QAAA,uBAAA,OAAAA,IACA,KAAA,0BAAA,KAAA,QAAA,uBAAAA,CAAA,CAAA,EAAA,EAEA,CACA,yBAAA,CAGA,KAAA,iBAAA,CAAA,EACAlC,EAAA,UAAA,gBAAA,KAAA,QAAA,MAAA,CAAAmC,EAAAC,IAAA,CACA,MAAA,QAAAA,CAAA,EAOA,KAAA,iBAAA,KAAA,CACA,KAAAD,EACA,GAAAC,CACA,CAAA,EATA,KAAA,iBAAA,KAAA,CACA,KAAAD,EACA,GAAA,CAAAC,CAAA,CACA,CAAA,CAQA,CAAA,EACA,KAAA,iBAAA,KAAA,CAAAC,EAAAC,IACAA,EAAA,KAAA,OAAAD,EAAA,KAAA,MACA,CACA,CAMA,cAAAb,EAAA,CACA,OAAA,IAAAM,EAAA,KAAA,KAAAP,EAAA,0BAAAC,EAAA,KAAA,OAAA,CAAA,CACA,CAIA,mBAAA,CACA,OAAA,KAAA,OACA,CACA,YAAAe,EAAA,CACA,IAAAC,EACA,QAAAN,EAAA,EAAArC,EAAA,KAAA,iBAAA,OAAAqC,EAAArC,EAAAqC,IAEA,GADAM,EAAA,KAAA,iBAAAN,CAAA,EACAlC,EAAA,UAAA,WAAAuC,EAAAC,EAAA,IAAA,EAAA,CACA,IAAA5C,EAAA,CAAA,EACA,QAAA6C,EAAA,EAAAC,EAAAF,EAAA,GAAA,OAAAC,EAAAC,EAAAD,IACA7C,EAAA,KAAA4C,EAAA,GAAAC,CAAA,EAAAF,EAAA,OAAAC,EAAA,KAAA,MAAA,CAAA,EAEA,OAAA5C,CACA,CAEA,MAAA,CAAA2C,CAAA,CACA,CACA,iBAAAzB,EAAA,CACA,OAAAd,EAAA,UAAA,oBAAAc,CAAA,EACAA,EAAA,IAAA,KAAA,QAAA,QAGAA,EAAA,IAAA,KAAA,QAAA,OAEA,CACA,4BAAAA,EAAA,CACA,OAAA,KAAA,QAAA,QACA,KAAA,iBAAAA,CAAA,EAEAA,CACA,CACA,6BAAA6B,EAAA,CACA,GAAA,KAAA,QAAA,QACA,QAAAT,EAAA,EAAArC,EAAA8C,EAAA,OAAAT,EAAArC,EAAAqC,IACAS,EAAAT,CAAA,EAAA,KAAA,iBAAAS,EAAAT,CAAA,CAAA,EAGA,OAAAS,CACA,CAIA,gBAAAJ,EAAA,CACA,GAAA,KAAA,KAAA,QACA,KAAA,QAAA,6BAAA,QACA,CAAA,KAAA,QAAA,kBAAA,KAAAA,CAAA,EAGA,OAAA,KAAA,QAAA,EAEA,CAAA,QAAA,EAIA,CAAA,QAAAA,CAAA,EAIA,IAAA3C,EAAA2C,EACAK,EACA,GAAA,CAAA5C,EAAA,UAAA,SAAAJ,EAAA,KAAA,GAAA,CAAAI,EAAA,UAAA,eAAAJ,CAAA,EAAA,CACAgD,EAAA,KAAA,YAAAhD,CAAA,EACA,QAAAsC,EAAA,EAAArC,EAAA+C,EAAA,OAAAV,EAAArC,EAAAqC,IACA,KAAA,QAAA,GAAAU,EAAAV,CAAA,IAAA,WAGAlC,EAAA,UAAA,eAAA4C,EAAAV,CAAA,CAAA,IACAU,EAAAV,CAAA,EAAA,KAAA,QAAA,QAAAU,EAAAV,CAAA,GAEA,CAAAlC,EAAA,UAAA,SAAA4C,EAAAV,CAAA,EAAA,KAAA,GAAA,CAAAlC,EAAA,UAAA,oBAAA4C,EAAAV,CAAA,CAAA,IACAU,EAAAV,CAAA,EAAAU,EAAAV,CAAA,EAAA,OAGA,KAEA,CAAAlC,EAAA,UAAA,SAAAJ,EAAA,KAAA,GAAA,CAAAI,EAAA,UAAA,oBAAAJ,CAAA,IACAA,EAAAA,EAAA,OAEAgD,EAAA,CAAAhD,CAAA,EAEA,OAAA,KAAA,6BAAAgD,CAAA,CACA,CAIA,aAAA9B,EAAA,CACA,IAAAlB,EAAAkB,EACA,OAAAd,EAAA,UAAA,eAAAJ,CAAA,IACAA,EAAA,KAAA,YAAAA,CAAA,EAAA,CAAA,EACAI,EAAA,UAAA,eAAAJ,CAAA,IACAA,EAAA,KAAA,QAAA,QAAAA,IAGA,KAAA,4BAAAA,CAAA,CACA,CAIA,SAAA,CACA,OAAA,KAAA,QAAA,OACA,CACA,oBAAAiD,EAAA,CASA,MARA,IAAA,KAAA,QAAA,SAKA7C,EAAA,UAAA,kBAAA6C,CAAA,GAGA,KAAA,QAAA,yBAAA,KAAA,QAAA,wBAAAA,CAAA,EAIA,CAIA,6BAAAN,EAAA,CACA,OAAA,KAAA,0BAAA,eAAAA,CAAA,CACA,CAIA,mBAAAA,EAAA,CACA,GAAA,KAAA,QAAA,OACA,OAAA,KAAA,QAAA,OAAAA,CAAA,CAEA,CAIA,kBAAA,CACA,OAAA,KAAA,QAAA,UACA,CAIA,mBAAA,CACA,OAAA,KAAA,QAAA,WACA,CAIA,QAAAjB,EAAA,CACA,KAAA,QAAA,QAAAA,CAAA,CACA,CACA,CACAtB,EAAA,cAAA8B,CACA,GAAA9B,KAAAA,GAAA,CAAA,EAAA,EAKA,IAAAA,IACA,SAAAA,EAAA,CAIA,MAAA8C,CAAA,CACA,YAAAf,EAAA,CACA,KAAA,KAAAA,EACA,KAAA,cAAA,KACA,KAAA,aAAA,CAAA,CACA,CACA,KAAAgB,EAAAC,EAAAhC,EAAAiC,EAAA,CACA,GAAA,CAAA,KAAA,cACA,GAAA,KAAA,KAAA,YACA,KAAA,cAAA,IAAAC,UAEA,KAAA,KAAA,mBAAA,CACA,KAAA,CAAA,iBAAAC,CAAA,EAAAJ,EAAA,UAAA,EAAA,kBAAA,EACAI,EACA,KAAA,cAAA,IAAAC,EAGA,KAAA,cAAA,IAAAC,EAAA,KAAA,IAAA,CAEA,MACA,KAAA,KAAA,OACA,KAAA,cAAA,IAAAA,EAAA,KAAA,IAAA,EAGA,KAAA,cAAA,IAAAD,EAGA,IAAAE,EAAA,CACA,SAAAtC,EACA,UAAAiC,CACA,EACA,GAAA,KAAA,aAAA,eAAAD,CAAA,EAAA,CACA,KAAA,aAAAA,CAAA,EAAA,KAAAM,CAAA,EACA,MACA,CACA,KAAA,aAAAN,CAAA,EAAA,CAAAM,CAAA,EACA,KAAA,cAAA,KAAAP,EAAAC,EAAA,IAAA,KAAA,gBAAAA,CAAA,EAAA1B,GAAA,KAAA,iBAAA0B,EAAA1B,CAAA,CAAA,CACA,CACA,gBAAA0B,EAAA,CACA,IAAAM,EAAA,KAAA,aAAAN,CAAA,EACA,OAAA,KAAA,aAAAA,CAAA,EACA,QAAAd,EAAA,EAAAA,EAAAoB,EAAA,OAAApB,IACAoB,EAAApB,CAAA,EAAA,SAAA,CAEA,CACA,iBAAAc,EAAA1B,EAAA,CACA,IAAAgC,EAAA,KAAA,aAAAN,CAAA,EACA,OAAA,KAAA,aAAAA,CAAA,EACA,QAAAd,EAAA,EAAAA,EAAAoB,EAAA,OAAApB,IACAoB,EAAApB,CAAA,EAAA,UAAAZ,CAAA,CAEA,CACA,CACA,MAAA8B,CAAA,CAKA,gBAAAG,EAAAvC,EAAAiC,EAAA,CACA,IAAAO,EAAA,IAAA,CACAD,EAAA,oBAAA,OAAAE,CAAA,EACAF,EAAA,oBAAA,QAAAG,CAAA,CACA,EACAD,EAAAE,GAAA,CACAH,EAAA,EACAxC,EAAA,CACA,EACA0C,EAAAC,GAAA,CACAH,EAAA,EACAP,EAAAU,CAAA,CACA,EACAJ,EAAA,iBAAA,OAAAE,CAAA,EACAF,EAAA,iBAAA,QAAAG,CAAA,CACA,CACA,KAAAX,EAAAC,EAAAhC,EAAAiC,EAAA,CACA,GAAA,UAAA,KAAAD,CAAA,EAAA,CACA,IAAAY,EAAAb,EAAA,UAAA,EAAA,kBAAA,EACAc,EAAAC,EAAAf,EAAA,YAAA,EAAAa,EAAA,aAAA5D,EAAA,OAAA,WAAA,EACA+D,EAAAf,EAAA,MAAA,GAAA,EACAgB,EAAA,KACA,GAAA,CACAA,EAAAH,EAAAE,EAAA,CAAA,CAAA,CACA,OACAzC,EAAA,CACA2B,EAAA3B,CAAA,EACA,MACA,CACAyB,EAAA,6BAAA,CAAA,EAAA,IAAAiB,CAAA,EACAhD,EAAA,CACA,KACA,CACA,IAAAuC,EAAA,SAAA,cAAA,QAAA,EACAA,EAAA,aAAA,QAAA,OAAA,EACAA,EAAA,aAAA,OAAA,iBAAA,EACA,KAAA,gBAAAA,EAAAvC,EAAAiC,CAAA,EACA,KAAA,CAAA,mBAAAgB,CAAA,EAAAlB,EAAA,UAAA,EAAA,kBAAA,EACAkB,IACAjB,EAAAiB,EAAA,gBAAAjB,CAAA,GAEAO,EAAA,aAAA,MAAAP,CAAA,EAEA,KAAA,CAAA,SAAAkB,CAAA,EAAAnB,EAAA,UAAA,EAAA,kBAAA,EACAmB,GACAX,EAAA,aAAA,QAAAW,CAAA,EAEA,SAAA,qBAAA,MAAA,EAAA,CAAA,EAAA,YAAAX,CAAA,CACA,CACA,CACA,CACA,SAAAY,EAAApB,EAAA,CACA,KAAA,CAAA,mBAAAkB,CAAA,EAAAlB,EAAA,UAAA,EAAA,kBAAA,EACA,GAAA,CAKA,OAJAkB,EACA,KAAA,KAAAA,EAAA,aAAA,GAAA,MAAA,CAAA,EACA,IAAA,SAAA,MAAA,GAEA,KAAA,IAAA,EACA,EACA,MACA,CACA,MAAA,EACA,CACA,CACA,MAAAf,CAAA,CACA,aAAA,CACA,KAAA,kBAAA,IACA,CACA,YAAAH,EAAA,CACA,OAAA,KAAA,oBAAA,OACA,KAAA,kBAAAoB,EAAApB,CAAA,GAEA,KAAA,iBACA,CACA,KAAAA,EAAAC,EAAAhC,EAAAiC,EAAA,CACA,GAAA,UAAA,KAAAD,CAAA,EAAA,CACA,MAAAY,EAAAb,EAAA,UAAA,EAAA,kBAAA,EACAc,EAAAC,EAAAf,EAAA,YAAA,EAAAa,EAAA,aAAA5D,EAAA,OAAA,WAAA,EACA+D,EAAAf,EAAA,MAAA,GAAA,EACA,IAAAgB,EAAA,KACA,GAAA,CACAA,EAAAH,EAAAE,EAAA,CAAA,CAAA,CACA,OACAzC,EAAA,CACA2B,EAAA3B,CAAA,EACA,MACA,CACAyB,EAAA,6BAAA,CAAA,EAAA,UAAA,CAAA,OAAAiB,CAAA,CAAA,EACAhD,EAAA,CACA,KACA,CACA,KAAA,CAAA,mBAAAiD,CAAA,EAAAlB,EAAA,UAAA,EAAA,kBAAA,EAEA,GAAA,EADA,8BAAA,KAAAC,CAAA,GAAAA,EAAA,UAAA,EAAA,KAAA,OAAA,MAAA,IAAA,KAAA,SACA,KAAA,YAAAD,CAAA,EAAA,CAGA,MAAAC,CAAA,EAAA,KAAAoB,GAAA,CACA,GAAAA,EAAA,SAAA,IACA,MAAA,IAAA,MAAAA,EAAA,UAAA,EAEA,OAAAA,EAAA,KAAA,CACA,CAAA,EAAA,KAAAC,GAAA,CACAA,EAAA,GAAAA,CAAA;gBAAArB,CAAA,IACAiB,EACA,KAAA,KAAAA,EAAA,aAAA,GAAAI,CAAA,CAAA,EACA,IAAA,SAAAA,CAAA,GAEA,KAAA,IAAA,EACArD,EAAA,CACA,CAAA,EAAA,KAAA,OAAAiC,CAAA,EACA,MACA,CACA,GAAA,CACAgB,IACAjB,EAAAiB,EAAA,gBAAAjB,CAAA,GAEA,cAAAA,CAAA,EACAhC,EAAA,CACA,OACA2C,EAAA,CACAV,EAAAU,CAAA,CACA,CACA,CACA,CACA,CACA,MAAAN,CAAA,CACA,YAAAtB,EAAA,CACA,KAAA,KAAAA,EACA,KAAA,eAAA,GACA,KAAA,qBAAA,EACA,CACA,MAAA8B,EAAA,CACA,KAAA,iBAGA,KAAA,eAAA,GAEA,KAAA,IAAAA,EAAA,IAAA,EACA,KAAA,IAAAA,EAAA,IAAA,EACA,KAAA,MAAAA,EAAA,MAAA,EACA,KAAA,QAAAA,EAAA,QAAA,EACA,CAGA,iBAAAA,EAAAd,EAAA,CAGA,KAAA,CAAA,eAAAuB,CAAA,EAAAvB,EAAA,UAAA,EAAA,kBAAA,EAIA,GAHA,CAAAuB,GAGA,KAAA,qBACA,OAEA,KAAA,qBAAA,GACA,MAAAC,EAAA,KACAC,EAAAX,EAAA,QAAA,EACA,SAAAY,EAAAC,EAAA,CACA,MAAAF,EAAAE,EAAA,YACA,IAAAC,EAAA,SAAAC,EAAA,CACA,GAAA,CACA,OAAAF,EAAA,QAAAE,CAAA,CACA,QACA,CAEA,CACA,EACA,OAAAD,EAAA,QAAA,SAAAE,EAAArD,EAAA,CACA,OAAAgD,EAAA,iBAAAK,EAAAH,EAAA,GAAAlD,CAAA,CACA,EACAmD,EAAA,QAAA,MAAA,SAAAE,EAAA,CACA,OAAAL,EAAA,oBAAAK,EAAAH,CAAA,CACA,EACAC,EAAA,KAAA,QAAA,WACAA,EAAA,WAAAH,EAAA,YACAG,EAAA,MAAAH,EAAA,OACAG,CACA,CACAH,EAAA,UAAA,SAAA,SAAAM,EAAAC,EAAA,CAEA,MAAAC,EAAAR,EAAA,KAAAM,EAAA,QAAA,QAAA,EAAA,CAAA,EAEAG,EAAAlC,EAAA,YAAA,EACAmC,EAAAX,EAAA,mBAAAD,EAAAS,CAAA,EACAvD,EAAA,CAAA,SAAAuD,CAAA,EACA,IAAAI,EACA,GAAA,CACA,MAAAC,EAAAb,EAAA,IAAA,aAAAW,CAAA,EACAC,EAAAC,EAAA,MAAA,EAAA,EAAA,EACA5D,EAAA,WAAA4D,EAAA,MAAA,EAAA,EACAH,EAAA,OAAA,GAAAC,CAAA,CACA,MACA,CACAD,EAAA,OAAA,GAAAC,CAAA,CACA,CACA,MAAA3B,EAAA,IAAAgB,EAAA,IAAA,OAAAS,EAAAxD,CAAA,EACA6D,EAAA9B,EAAA,iBAAA/B,CAAA,EAEA8D,EAAAf,EAAA,MAAA,QAAAQ,CAAA,EACAJ,EAAAF,EAAA,IAAA,EACAc,EAAA,CAAA,KAAA,QAAAZ,EAAA,KAAAI,EAAAO,EAAA,QAAAvF,GAAA,MAAA,EACAH,EAAAyF,EAAA,MAAA,KAAA,QAAAE,CAAA,EAEA,OAAAhB,EAAA,kBAAAhB,EAAAyB,EAAAE,EAAA,CAAA1D,EAAA,WAAAuB,CAAA,EACAwB,EAAA,kBAAAhB,EAAAyB,EAAAE,EAAAC,EAAApC,CAAA,EACAnD,CACA,CACA,CACA,KAAAmD,EAAAC,EAAAhC,EAAAiC,EAAA,CACA,MAAAW,EAAAb,EAAA,UAAA,EAAA,kBAAA,EACAc,EAAAC,EAAAf,EAAA,YAAA,EAAAa,EAAA,aAAA5D,EAAA,OAAA,WAAA,EACAwF,EAAA5B,EAAA,kBAAA,SAAA6B,EAAA,CAAA,OAAAA,CAAA,EACA,KAAA,MAAA5B,CAAA,EACA,KAAA,iBAAAA,EAAAd,CAAA,EACA,IAAAkC,EAAAlC,EAAA,YAAA,EACA,GAAA,UAAA,KAAAC,CAAA,EAAA,CACA,IAAAe,EAAAf,EAAA,MAAA,GAAA,EACAgB,EAAA,KACA,GAAA,CACAA,EAAAH,EAAAE,EAAA,CAAA,CAAA,CACA,OACAzC,EAAA,CACA2B,EAAA3B,CAAA,EACA,MACA,CACAyB,EAAA,6BAAA,CAAA,EAAA,IAAAiB,CAAA,EACAhD,EAAA,CACA,KACA,CACAgC,EAAAhD,EAAA,UAAA,kBAAA,KAAA,KAAA,UAAAgD,CAAA,EACA,MAAA0C,EAAA,KAAA,MAAA,UAAA1C,CAAA,EACA2C,EAAA,KAAA,oCAAAD,CAAA,EACAE,EAAA,EAAAhC,EAAA,eACAsB,EAAAU,EAAA,KAAA,mBAAAhC,EAAA,eAAAZ,CAAA,EAAA,OACA,KAAA,yBAAA0C,EAAAR,EAAAD,EAAA,CAAA3D,EAAA8D,EAAAS,EAAAV,IAAA,CACA,GAAA7D,EAAA,CACA2B,EAAA3B,CAAA,EACA,MACA,CACA,IAAA0D,EACAI,EAAA,WAAA,CAAA,IAAA/B,EAAA,KACA2B,EAAA3B,EAAA,QAAA+B,EAAA,UAAA,CAAA,EAAA/B,EAAA,QAGA2B,EAAA3B,EAAA,QAAA+B,EAAA/B,EAAA,QAEA2B,EAAAQ,EAAAR,EAAAU,CAAA,EACA,MAAAI,EAAA,CAAA,SAAAH,EAAA,WAAAE,CAAA,EACAtC,EAAA,KAAA,qBAAAR,EAAAiC,EAAAc,EAAA9E,EAAAiC,CAAA,EACA,KAAA,kBAAAM,EAAAyB,EAAAE,EAAAU,GAAA,CAAAC,EAAA9C,CAAA,EACA,KAAA,kBAAAQ,EAAAyB,EAAAE,EAAAC,EAAApC,CAAA,CACA,CAAA,CACA,CACA,CACA,qBAAAA,EAAAgD,EAAAvE,EAAAR,EAAAiC,EAAA,CACA,MAAAgC,EAAAlC,EAAA,YAAA,EACAkC,EAAA,OAAA,GAAAzD,EAAA,QAAA,EACA,MAAA+B,EAAA,IAAA,KAAA,IAAA,OAAAwC,EAAAvE,CAAA,EACAwE,EAAAzC,EAAA,iBAAA/B,CAAA,EACAyE,EAAAlD,EAAA,uBAAA,EACA,IAAAmD,EAAA,GACA,MAAAC,EAAA,UAAA,CACA,OAAAD,EAAA,GACAD,EAAA,MAAA,KAAA,SAAA,CACA,EACA,OAAAE,EAAA,IAAAF,EAAA,IACAD,EAAA,KAAAhG,EAAA,OAAA+C,EAAA,wBAAA,EAAAoD,EAAA3E,EAAA,SAAA,KAAA,MAAA,QAAAA,EAAA,QAAA,CAAA,EACAyD,EAAA,OAAA,GAAAzD,EAAA,QAAA,EACA0E,EACAlF,EAAA,EAGAiC,EAAA,IAAA,MAAA,iCAAAzB,EAAA,QAAA,GAAA,CAAA,EAEA+B,CACA,CACA,oCAAAqB,EAAA,CACA,GAAA,CAAA,KAAA,KAAA,mBACA,OAAAA,EAEA,IAAAwB,EAAAxB,EAAA,MAAA,iBAAA,EACA,OAAAwB,EAEA,YAAAA,EAAA,CAAA,EAAA,YAAA,EAAA,IAAAA,EAAA,CAAA,GAAA,QAAA,MAAA,GAAA,CAAA,GAIA,UAAAxB,CAAA,EAEA,CACA,mBAAAyB,EAAAtB,EAAA,CACA,MAAAuB,EAAA,KAAA,QAAA,WAAA,KAAA,EAAA,OAAAvB,EAAA,MAAA,EAAA,OAAAsB,EAAA,KAAA,MAAA,EAAA,OAAA,QAAA,KAAA,EAAA,EAAA,OAAA,KAAA,EACAE,EAAA,KAAA,MAAA,SAAAxB,CAAA,EAAA,QAAA,QAAA,EAAA,EACA,OAAA,KAAA,MAAA,KAAAsB,EAAA,KAAA,GAAAE,CAAA,IAAAD,CAAA,OAAA,CACA,CACA,kBAAA/C,EAAAyB,EAAAE,EAAAsB,EAAAzD,EAAA,CACAQ,EAAA,mBAEA,KAAA,IAAA,OAAA2B,EAAA5D,GAAA,CACAyB,EAAA,YAAA,EAAA,OAAA,GAAAmC,CAAA,EACA,KAAA,0BAAA3B,EAAAyB,EAAAE,EAAAnC,CAAA,EACAzB,GACAyB,EAAA,UAAA,EAAA,QAAAzB,CAAA,CAEA,CAAA,EAEAkF,GAEA,KAAA,0BAAAjD,EAAAyB,EAAAE,EAAAnC,CAAA,CAEA,CAIA,0BAAAQ,EAAAyB,EAAAE,EAAAnC,EAAA,CACA,IAAA0D,EAAA,KAAA,KAAA1D,EAAA,UAAA,EAAA,kBAAA,EAAA,eAAA,YAAA,EAAA,KAAA,OAAA,EAAA,EACA2D,EAAA,GACAC,EAAA,EACAxB,EACA,MAAAyB,EAAA,IAAA,CACA,WAAA,IAAA,CACAzB,IACAA,EAAA,KAAA,QAAA,WAAA,KAAA,EAAA,OAAAH,EAAA,MAAA,EAAA,OAAA,GAEA,MAAAa,EAAAtC,EAAA,iBAAA,EACA,GAAA,EAAAsC,EAAA,SAAA,GAAAA,EAAA,SAAAa,GAAAC,GAAA,GAIA,IAAAd,EAAA,OAAAa,EAAA,CAEAE,EAAA,EACA,MACA,CACAF,EAAAb,EAAA,OACA,KAAA,IAAA,UAAAX,EAAA,OAAA,OAAA,CAAAC,EAAAU,CAAA,CAAA,EAAAvE,GAAA,CACAA,GACAyB,EAAA,UAAA,EAAA,QAAAzB,CAAA,EAEAyB,EAAA,YAAA,EAAA,OAAA,GAAAmC,CAAA,EACA0B,EAAA,CACA,CAAA,EACA,EAAAH,EAAA,KAAA,IAAA,EAAAE,GAAA,CAAA,CACA,EAIAC,EAAA,CACA,CACA,yBAAAC,EAAA3B,EAAAD,EAAAjE,EAAA,CACA,GAAA,CAAAkE,EAEA,KAAA,IAAA,SAAA2B,EAAA,CAAA,SAAA,MAAA,EAAA7F,CAAA,MAEA,CAEA,IAAA8F,EACAjB,EACAV,EACA4B,EAAA,EACA,MAAAC,EAAA1F,GAAA,CACAA,EACAN,EAAAM,CAAA,EAEA,EAAAyF,IAAA,GACA/F,EAAA,OAAA8F,EAAAjB,EAAAV,CAAA,CAEA,EACA,KAAA,IAAA,SAAA0B,EAAA,CAAA,SAAA,MAAA,EAAA,CAAAvF,EAAA8D,IAAA,CACA0B,EAAA1B,EACA4B,EAAA1F,CAAA,CACA,CAAA,EACA,KAAA,IAAA,SAAA4D,EAAA,CAAA5D,EAAA8D,IAAA,CACA,CAAA9D,GAAA8D,GAAAA,EAAA,OAAA,GACAD,EAAAC,EAAA,MAAA,EAAA,EAAA,EACAS,EAAAT,EAAA,MAAA,EAAA,EACAH,EAAA,OAAA,GAAAC,CAAA,GAGAD,EAAA,OAAA,GAAAC,CAAA,EAEA8B,EAAA,CACA,CAAA,CACA,CACA,CACA,kBAAAzD,EAAAyB,EAAAE,EAAAC,EAAApC,EAAA,CACAoC,IAIA5B,EAAA,oBAIA,WAAA,IAAA,CAIA,MAAA0D,EAAA,KAAA,QAAA,WAAA,KAAA,EAAA,OAAAjC,EAAA,MAAA,EAAA,OAAA,EACAG,EAAA,OAAA8B,CAAA,IACAlE,EAAA,UAAA,EAAA,QAAA,IAAA,MAAA,iDAAAmC,CAAA,kCAAA,CAAA,EACA,KAAA,IAAA,OAAAA,EAAA5D,GAAA,CACAA,GACAyB,EAAA,UAAA,EAAA,QAAAzB,CAAA,CAEA,CAAA,EAEA,EAAA,KAAA,KAAA,KAAA,EAAA,KAAA,OAAA,EAAA,CAAA,EACA,CACA,CACA+B,EAAA,KAAA,MACAA,EAAA,QAAA,wDACAA,EAAA,QAAA;KACA,SAAAS,EAAAmB,EAAAiC,EAAA,CACA,GAAAA,EAAA,gBAEA,OAAAA,EAEA,MAAArD,EAAA,SAAAsD,EAAA,CACAlC,EAAA,OAAA,GAAAkC,CAAA,EACA,GAAA,CACA,OAAAD,EAAAC,CAAA,CACA,QACA,CACAlC,EAAA,OAAA,GAAAkC,CAAA,CACA,CACA,EACA,OAAAtD,EAAA,gBAAA,GACAA,CACA,CACA7D,EAAA,0BAAA8D,EACA,SAAAsD,EAAArF,EAAA,CACA,OAAA,IAAAe,EAAAf,CAAA,CACA,CACA/B,EAAA,mBAAAoH,CACA,GAAApH,KAAAA,GAAA,CAAA,EAAA,EAKA,IAAAA,IACA,SAAAA,EAAA,CAGA,MAAAqH,CAAA,CACA,YAAAC,EAAA,CACA,IAAAC,EAAAD,EAAA,YAAA,GAAA,EACAC,IAAA,GACA,KAAA,eAAAD,EAAA,OAAA,EAAAC,EAAA,CAAA,EAGA,KAAA,eAAA,EAEA,CAIA,OAAA,mBAAAhF,EAAA,CACA,IAAAiF,EAAAjF,EAAAkF,EAGA,IADAA,EAAA,SACAA,EAAA,KAAAD,CAAA,GACAA,EAAAA,EAAA,QAAAC,EAAA,GAAA,EAMA,IAHAD,EAAAA,EAAA,QAAA,SAAA,EAAA,EAEAC,EAAA,uEACAA,EAAA,KAAAD,CAAA,GACAA,EAAAA,EAAA,QAAAC,EAAA,GAAA,EAGA,OAAAD,EAAAA,EAAA,QAAA,sEAAA,EAAA,EACAA,CACA,CAIA,cAAAjF,EAAA,CACA,IAAA3C,EAAA2C,EACA,OAAAvC,EAAA,UAAA,eAAAJ,CAAA,IACAI,EAAA,UAAA,WAAAJ,EAAA,IAAA,GAAAI,EAAA,UAAA,WAAAJ,EAAA,KAAA,KACAA,EAAAyH,EAAA,mBAAA,KAAA,eAAAzH,CAAA,GAGAA,CACA,CACA,CACAyH,EAAA,KAAA,IAAAA,EAAA,EAAA,EACArH,EAAA,iBAAAqH,EAGA,MAAA7C,CAAA,CACA,YAAApD,EAAAsG,EAAAC,EAAA3G,EAAAiC,EAAA2E,EAAA,CACA,KAAA,GAAAxG,EACA,KAAA,MAAAsG,EACA,KAAA,aAAAC,EACA,KAAA,UAAA3G,EACA,KAAA,WAAAiC,EACA,KAAA,iBAAA2E,EACA,KAAA,QAAA,CAAA,EACA,KAAA,MAAA,KACA,KAAA,gBAAA,GACA,KAAA,4BAAA,KAAA,aAAA,OACA,KAAA,YAAA,EACA,CACA,OAAA,oBAAA5G,EAAAuE,EAAA,CACA,GAAA,CACA,MAAA,CACA,cAAAvE,EAAA,MAAAhB,EAAA,OAAAuF,CAAA,EACA,cAAA,IACA,CACA,OACA5B,EAAA,CACA,MAAA,CACA,cAAA,KACA,cAAAA,CACA,CACA,CACA,CACA,OAAA,eAAA0C,EAAAxD,EAAA7B,EAAA6G,EAAA,CACA,OAAAxB,EAAA,oBAAAxD,CAAA,EAMAwD,EAAA,iBAAA,EACA,KAAA,oBAAArF,EAAA6G,CAAA,EAEA,CACA,cAAA7G,EAAA,MAAAhB,EAAA,OAAA6H,CAAA,EACA,cAAA,IACA,EAXA,CACA,cAAA,KACA,cAAA,IACA,CASA,CACA,SAAA5C,EAAAoB,EAAAwB,EAAAC,EAAA,CACA,KAAA,YAAA,GACA,IAAAC,EAAA,KACA,GAAA,KAAA,UACA,GAAA,OAAA,KAAA,WAAA,WAAA,CACA9C,EAAA,OAAA,GAAA,KAAA,KAAA,EACA,IAAA,EAAAT,EAAA,eAAA6B,EAAA,KAAA,MAAA,KAAA,UAAAwB,CAAA,EACAE,EAAA,EAAA,cACA9C,EAAA,OAAA,GAAA,KAAA,KAAA,EACA,CAAA8C,GAAA,OAAA,EAAA,cAAA,MAAA,CAAA,KAAA,iBAAA/H,EAAA,UAAA,QAAA,KAAA,OAAA,KACA,KAAA,QAAA,EAAA,cAEA,MAEA,KAAA,QAAA,KAAA,UAGA,GAAA+H,EAAA,CACA,IAAAzG,EAAAtB,EAAA,YAAA+H,CAAA,EACAzG,EAAA,MAAA,UACAA,EAAA,SAAA,KAAA,MACAA,EAAA,SAAAwG,EAAA,KAAA,EAAA,EACA,KAAA,MAAAxG,EACA+E,EAAA,QAAA/E,CAAA,CACA,CACA,KAAA,aAAA,KACA,KAAA,UAAA,KACA,KAAA,WAAA,KACA,KAAA,iBAAA,IACA,CAIA,kBAAAA,EAAA,CAGA,OAFA,KAAA,YAAA,GACA,KAAA,MAAAA,EACA,KAAA,YACA,KAAA,WAAAA,CAAA,EACA,IAEA,EACA,CAIA,YAAA,CACA,OAAA,KAAA,WACA,CACA,CACAtB,EAAA,OAAAwE,EACA,MAAAwD,CAAA,CACA,aAAA,CACA,KAAA,QAAA,EACA,KAAA,0BAAA,IAAA,IACA,KAAA,0BAAA,CAAA,EAEA,KAAA,YAAA,SAAA,EACA,KAAA,YAAA,QAAA,EACA,KAAA,YAAA,SAAA,CACA,CACA,gBAAA,CACA,OAAA,KAAA,OACA,CACA,YAAAnF,EAAA,CACA,IAAAzB,EAAA,KAAA,0BAAA,IAAAyB,CAAA,EACA,OAAA,OAAAzB,EAAA,MACAA,EAAA,KAAA,UACA,KAAA,0BAAA,IAAAyB,EAAAzB,CAAA,EACA,KAAA,0BAAAA,CAAA,EAAAyB,GAEAzB,CACA,CACA,eAAAmB,EAAA,CACA,OAAA,KAAA,0BAAAA,CAAA,CACA,CACA,CACA,MAAA0F,CAAA,CACA,YAAA7G,EAAA,CACA,KAAA,GAAAA,CACA,CACA,CACA6G,EAAA,QAAA,IAAAA,EAAA,CAAA,EACAA,EAAA,OAAA,IAAAA,EAAA,CAAA,EACAA,EAAA,QAAA,IAAAA,EAAA,CAAA,EACAjI,EAAA,kBAAAiI,EACA,MAAAC,CAAA,CACA,YAAA9G,EAAA+G,EAAAC,EAAA,CACA,KAAA,GAAAhH,EACA,KAAA,SAAA+G,EACA,KAAA,YAAAC,CACA,CACA,CACApI,EAAA,iBAAAkI,EACA,MAAAG,CAAA,CACA,YAAAtG,EAAAuG,EAAAC,EAAAC,EAAAjI,EAAA,EAAA,CACA,KAAA,KAAAwB,EACA,KAAA,cAAAuG,EACA,KAAA,0BAAA/H,EACA,KAAA,YAAAgI,EACA,KAAA,aAAAC,EACA,KAAA,kBAAA,IAAAR,EACA,KAAA,QAAA,IAAAhI,EAAA,cAAA,KAAA,IAAA,EACA,KAAA,oBAAA,GACA,KAAA,UAAA,CAAA,EACA,KAAA,eAAA,CAAA,EACA,KAAA,sBAAA,CAAA,EACA,KAAA,4BAAA,IAAA,IACA,KAAA,4BAAA,KACA,KAAA,UAAA,KACA,KAAA,eAAA,CAAA,EACA,KAAA,sBAAA,CAAA,EACA,KAAA,uBAAA,CAAA,EACA,KAAA,aAAA,cAAA,IACA,CACA,OAAA,CACA,OAAA,IAAAqI,EAAA,KAAA,KAAA,KAAA,cAAA,KAAA,YAAA,KAAA,aAAA,KAAA,yBAAA,CACA,CACA,wBAAA,CACA,OAAA,KAAA,WACA,CACA,yBAAA,CACA,OAAA,KAAA,YACA,CACA,OAAA,6BAAAxH,EAAA4H,EAAA,CACA,IAAAC,EAAAC,GAAAA,EAAA,QAAA,MAAA,GAAA,EACAC,EAAAF,EAAA7H,CAAA,EACAgI,EAAAJ,EAAA,MAAA,IAAA,EACA,QAAAvG,EAAA,EAAAA,EAAA2G,EAAA,OAAA3G,IAAA,CACA,IAAA4G,EAAAD,EAAA3G,CAAA,EAAA,MAAA,sBAAA,EACA,GAAA4G,EAAA,CACA,IAAAC,EAAAD,EAAA,CAAA,EACAE,EAAAF,EAAA,CAAA,EACAG,EAAAH,EAAA,CAAA,EACAI,EAAA,KAAA,IAAAH,EAAA,YAAA,GAAA,EAAA,EAAAA,EAAA,YAAA,GAAA,EAAA,CAAA,EAGA,GAFAA,EAAAA,EAAA,OAAAG,CAAA,EACAH,EAAAL,EAAAK,CAAA,EACAA,IAAAH,EAAA,CACA,IAAApB,EAAA,CACA,KAAA,SAAAwB,EAAA,EAAA,EACA,IAAA,SAAAC,EAAA,EAAA,CACA,EACA,OAAAzB,EAAA,OAAA,IACAA,EAAA,KAAA,IAEAA,CACA,CACA,CACA,CACA,MAAA,IAAA,MAAA,mDAAA3G,CAAA,CACA,CACA,cAAA,CACA,GAAA,CAAA,KAAA,QAAA,QAAA,EACA,OAAA,KAEA,IAAAjB,EAAA,CAAA,EAAAuJ,EAAA,EACA,QAAAjH,EAAA,EAAArC,EAAA,KAAA,UAAA,OAAAqC,EAAArC,EAAAqC,IAAA,CACA,IAAA4G,EAAA,KAAA,UAAA5G,CAAA,EACA,GAAA,CAAA4G,EACA,SAEA,IAAAM,EAAA,KAAA,eAAAN,EAAA,EAAA,GAAA,KACAO,EAAA,KAAA,sBAAAP,EAAA,EAAA,GAAA,KACAnB,EAAA,KAAA,uBAAAmB,EAAA,EAAA,EACAlJ,EAAAuJ,GAAA,EAAA,CACA,GAAAL,EAAA,MACA,KAAAM,EACA,eAAAA,GAAAC,EAAAhB,EAAA,6BAAAe,EAAAC,CAAA,EAAA,KACA,aAAA1B,EACA,KAAA,KACA,QAAAmB,EAAA,OACA,CACA,CACA,OAAAlJ,CACA,CACA,aAAA,CACA,OAAA,KAAA,YACA,KAAA,QAAA,kBAAA,EACA,KAAA,UAAA,IAAAI,EAAA,oBAAA,KAAA,yBAAA,EAGA,KAAA,UAAAA,EAAA,wBAAA,UAGA,KAAA,SACA,CACA,iBAAA,CACA,OAAA,KAAA,YAAA,EAAA,UAAA,CACA,CAMA,6BAAA2H,EAAA3G,EAAA,CACA,GAAA,KAAA,8BAAA,KACA,MAAA,IAAA,MAAA,yDAAA,EAEA,IAAAyH,EAAA,KACA,KAAA,QAAA,QAAA,IACAA,EAAA,IAAA,MAAA,eAAA,EAAA,OAAA,MAEA,KAAA,4BAAA,CACA,MAAAA,EACA,aAAAd,EACA,SAAA3G,CACA,CACA,CAOA,aAAA6B,EAAA8E,EAAA3G,EAAAiC,EAAAwF,EAAAb,EAAA,IAAAP,EAAAxE,CAAA,EAAA,CACA,IAAAN,EAAA,KAAA,kBAAA,YAAAM,CAAA,EACA,GAAA,KAAA,UAAAN,CAAA,EAAA,CACA,KAAA,QAAA,6BAAAM,CAAA,GACA,QAAA,KAAA,mCAAAA,EAAA,GAAA,EAGA,MACA,CACA,IAAAiG,EAAA,IAAAtE,EAAAjC,EAAAM,EAAA,KAAA,uBAAA8E,EAAAC,CAAA,EAAA5G,EAAAiC,EAAA2E,CAAA,EACA,KAAA,UAAArF,CAAA,EAAAuG,EACA,KAAA,QAAA,QAAA,IACA,KAAA,sBAAAvG,CAAA,EAAAkG,EACA,KAAA,uBAAAlG,CAAA,GAAAuG,EAAA,cAAA,CAAA,GAAA,IAAAQ,GAAA,KAAA,kBAAA,eAAAA,EAAA,EAAA,CAAA,GAIA,KAAA,SAAAR,CAAA,CACA,CACA,qBAAAS,EAAA3B,EAAA,CACA,GAAA2B,IAAA,UACA,OAAAtB,EAAA,QAEA,GAAAsB,IAAA,SACA,OAAAtB,EAAA,OAEA,GAAAsB,IAAA,UACA,OAAAtB,EAAA,QAGA,IAAAuB,EAAAD,EAAA,QAAA,GAAA,EACA,GAAAC,GAAA,EAAA,CACA,IAAAC,EAAA7B,EAAA,cAAA2B,EAAA,OAAA,EAAAC,CAAA,CAAA,EACApB,EAAAR,EAAA,cAAA2B,EAAA,OAAAC,EAAA,CAAA,CAAA,EACAE,EAAA,KAAA,kBAAA,YAAAD,EAAA,IAAArB,CAAA,EACAD,EAAA,KAAA,kBAAA,YAAAsB,CAAA,EACA,OAAA,IAAAvB,EAAAwB,EAAAvB,EAAAC,CAAA,CACA,CACA,OAAA,IAAAH,EAAA,KAAA,kBAAA,YAAAL,EAAA,cAAA2B,CAAA,CAAA,CAAA,CACA,CACA,uBAAA5B,EAAAC,EAAA,CACA,IAAAhI,EAAA,CAAA,EAAAuJ,EAAA,EACA,QAAAjH,EAAA,EAAArC,EAAA8H,EAAA,OAAAzF,EAAArC,EAAAqC,IACAtC,EAAAuJ,GAAA,EAAA,KAAA,qBAAAxB,EAAAzF,CAAA,EAAA0F,CAAA,EAEA,OAAAhI,CACA,CACA,iBAAAgI,EAAAD,EAAA3G,EAAAiC,EAAA,CACA,GAAA,OAAA0E,GAAA,SACA,OAAA,KAAA,mBAAAA,EAAAC,CAAA,EAEA,KAAA,aAAA5H,EAAA,UAAA,wBAAA,EAAA2H,EAAA3G,EAAAiC,EAAA,KAAA2E,CAAA,CACA,CAMA,mBAAA+B,EAAA/B,EAAA,IAAAP,EAAAsC,CAAA,EAAA,CACA,IAAAJ,EAAA,KAAA,qBAAAI,EAAA/B,CAAA,EACAkB,EAAA,KAAA,UAAAS,EAAA,EAAA,EACA,GAAA,CAAAT,EACA,MAAA,IAAA,MAAA,qEAAAa,EAAA,8CAAA,EAEA,GAAA,CAAAb,EAAA,WAAA,EACA,MAAA,IAAA,MAAA,qEAAAa,EAAA,sDAAA,EAEA,GAAAb,EAAA,MACA,MAAAA,EAAA,MAEA,OAAAA,EAAA,OACA,CACA,UAAAc,EAAAC,EAAA,CACA,IAAAC,EAAA,KAAA,QAAA,kBAAA,EACAD,EACA,KAAA,QAAA,IAAA7J,EAAA,cAAA,KAAA,KAAA4J,CAAA,EAGA,KAAA,QAAA,KAAA,QAAA,cAAAA,CAAA,EAEA,KAAA,QAAA,kBAAA,GAAA,CAAAE,IACA,KAAA,UAAA,KAEA,CACA,WAAA,CACA,OAAA,KAAA,OACA,CAKA,QAAAvH,EAAA,CACA,GAAA,KAAA,8BAAA,KAAA,CACA,IAAAwH,EAAA,KAAA,4BACA,KAAA,4BAAA,KAEA,KAAA,aAAA,KAAA,kBAAA,eAAAxH,CAAA,EAAAwH,EAAA,aAAAA,EAAA,SAAA,KAAAA,EAAA,KAAA,CACA,CACA,CACA,iBAAAxH,EAAAyH,EAAA,CACA,IAAAnH,EAAA,KAAA,kBAAA,eAAAN,CAAA,EACA0H,GAAA,KAAA,sBAAA1H,CAAA,GAAA,CAAA,GAAA,IAAA2H,GAAA,KAAA,kBAAA,eAAAA,CAAA,CAAA,EACA,MAAA5I,EAAAtB,EAAA,YAAAgK,CAAA,EACA,OAAA1I,EAAA,MAAA,UACAA,EAAA,SAAAuB,EACAvB,EAAA,SAAA2I,EACA3I,CACA,CAKA,aAAAiB,EAAAjB,EAAA,CACA,MAAA6I,EAAA,KAAA,iBAAA5H,EAAAjB,CAAA,EACA,KAAA,UAAAiB,CAAA,IACA,KAAA,UAAAA,CAAA,EAAA,IAAAiC,EAAAjC,EAAA,KAAA,kBAAA,eAAAA,CAAA,EAAA,CAAA,EAAA,IAAA,CAAA,EAAA,KAAA,IAAA,GAGA,IAAA6H,EAAA,CAAA,EACA,QAAAlI,EAAA,EAAArC,EAAA,KAAA,kBAAA,eAAA,EAAAqC,EAAArC,EAAAqC,IACAkI,EAAAlI,CAAA,EAAA,GAEA,IAAAmI,EAAA,GACAC,EAAA,CAAA,EAGA,IAFAA,EAAA,KAAA/H,CAAA,EACA6H,EAAA7H,CAAA,EAAA,GACA+H,EAAA,OAAA,GAAA,CACA,IAAAC,EAAAD,EAAA,MAAA,EACAxB,EAAA,KAAA,UAAAyB,CAAA,EACAzB,IACAuB,EAAAvB,EAAA,kBAAAqB,CAAA,GAAAE,GAEA,IAAAG,EAAA,KAAA,sBAAAD,CAAA,EACA,GAAAC,EACA,QAAAtI,EAAA,EAAArC,EAAA2K,EAAA,OAAAtI,EAAArC,EAAAqC,IAAA,CACA,IAAAuI,EAAAD,EAAAtI,CAAA,EACAkI,EAAAK,CAAA,IACAH,EAAA,KAAAG,CAAA,EACAL,EAAAK,CAAA,EAAA,GAEA,CAEA,CACAJ,GACA,KAAA,QAAA,QAAAF,CAAA,CAEA,CAOA,mBAAAO,EAAAC,EAAA,CACA,IAAAxI,EAAA,KAAA,UAAAuI,CAAA,EACA,GAAA,CAAAvI,EACA,MAAA,GAEA,IAAAyI,EAAA,CAAA,EACA,QAAA1I,EAAA,EAAArC,EAAA,KAAA,kBAAA,eAAA,EAAAqC,EAAArC,EAAAqC,IACA0I,EAAA1I,CAAA,EAAA,GAEA,IAAAoI,EAAA,CAAA,EAIA,IAFAA,EAAA,KAAAnI,CAAA,EACAyI,EAAAF,CAAA,EAAA,GACAJ,EAAA,OAAA,GAAA,CAGA,IAAA3C,EADA2C,EAAA,MAAA,EACA,aACA,GAAA3C,EAEA,QAAAzF,EAAA,EAAArC,EAAA8H,EAAA,OAAAzF,EAAArC,EAAAqC,IAAA,CACA,IAAAqH,EAAA5B,EAAAzF,CAAA,EACA,GAAAqH,EAAA,KAAAoB,EAEA,MAAA,GAEA,IAAAE,EAAA,KAAA,UAAAtB,EAAA,EAAA,EACAsB,GAAA,CAAAD,EAAArB,EAAA,EAAA,IAEAqB,EAAArB,EAAA,EAAA,EAAA,GACAe,EAAA,KAAAO,CAAA,EAEA,CAEA,CAEA,MAAA,EACA,CAOA,eAAAH,EAAAC,EAAAG,EAAA,CACA,GAAAJ,IAAAC,GAAAG,IAAA,GACA,MAAA,CAAAJ,CAAA,EAEA,IAAAvI,EAAA,KAAA,UAAAuI,CAAA,EACA,GAAA,CAAAvI,EACA,OAAA,KAGA,IAAAwF,EAAAxF,EAAA,aACA,GAAAwF,EACA,QAAAzF,EAAA,EAAArC,EAAA8H,EAAA,OAAAzF,EAAArC,EAAAqC,IAAA,CACA,IAAA0C,EAAA,KAAA,eAAA+C,EAAAzF,CAAA,EAAA,GAAAyI,EAAAG,EAAA,CAAA,EACA,GAAAlG,IAAA,KACA,OAAAA,EAAA,KAAA8F,CAAA,EACA9F,CAEA,CAEA,OAAA,IACA,CAIA,eAAAgD,EAAA,CACA,IAAAhI,EAAA,CAAA+H,EAAA3G,EAAAiC,IACA,KAAA,iBAAA2E,EAAAD,EAAA3G,EAAAiC,CAAA,EAEA,OAAArD,EAAA,MAAAwB,GACA,KAAA,QAAA,aAAAwG,EAAA,cAAAxG,CAAA,CAAA,EAEAxB,EAAA,SAAA,IACA,KAAA,gBAAA,EAEAA,EAAA,mBAAA,IACA,KAAA,oBAEAA,EAAA,OAAA,CAAAgK,EAAAC,EAAA,KAAA,CACA,KAAA,UAAAD,EAAAC,CAAA,CACA,EACAjK,EAAA,iBAAAI,EAAA,OAAA,YACAJ,CACA,CACA,YAAA2C,EAAA,CACA,GAAA,KAAA,UAAAA,CAAA,GAAA,KAAA,eAAAA,CAAA,EAEA,OAEA,KAAA,eAAAA,CAAA,EAAA,GACA,IAAAM,EAAA,KAAA,kBAAA,eAAAN,CAAA,EACAwI,EAAA,KAAA,QAAA,gBAAAlI,CAAA,EACAmI,EAAA,oBACA,KAAA,KAAA,SAAAnI,EAAA,QAAA,GAAA,IAAA,IAAAmI,EAAA,KAAAnI,CAAA,IACAkI,EAAA,KAAA,QAAAlI,CAAA,EAEA,IAAAoI,EAAA,GACAC,EAAA5J,GAAA,CAEA,GADA2J,IACAA,GAAAF,EAAA,OAEA,KAAA,aAAAxI,EAAAjB,CAAA,MAEA,CACA,IAAA6J,EAAAJ,EAAAE,CAAA,EACAhG,EAAA,KAAA,YAAA,EACA,GAAA,KAAA,QAAA,QAAA,GAAAkG,IAAA,SAAA,CACA,KAAA,eAAA5I,CAAA,EAAA4I,EACA,KAAA,aAAA,KAAA,kBAAA,eAAA5I,CAAA,EAAA,CAAA,EAAA,KAAA,KAAA,IAAA,EACA,KAAA,QAAAA,CAAA,EACA,MACA,CACA0C,EAAA,OAAA,GAAAkG,CAAA,EACA,KAAA,cAAA,KAAA,KAAAA,EAAA,IAAA,CACA,KAAA,QAAA,QAAA,IACA,KAAA,eAAA5I,CAAA,EAAA4I,GAEAlG,EAAA,OAAA,GAAAkG,CAAA,EACA,KAAA,QAAA5I,CAAA,CACA,EAAAjB,GAAA,CACA2D,EAAA,OAAA,GAAAkG,CAAA,EACAD,EAAA5J,CAAA,CACA,CAAA,CACA,CACA,EACA4J,EAAA,IAAA,CACA,CAOA,sBAAAE,EAAAC,EAAA,CACA,GAAA,KAAA,UAAAA,EAAA,EAAA,GAAA,KAAA,eAAAA,EAAA,EAAA,EAEA,OAEA,KAAA,eAAAA,EAAA,EAAA,EAAA,GAEA,IAAAC,EAAAnK,GAAA,CACA,KAAA,aAAA,KAAA,kBAAA,eAAAkK,EAAA,EAAA,EAAA,CAAA,EAAAlK,EAAA,KAAA,IAAA,CACA,EACAmK,EAAA,MAAAhK,GAAA,CACA,KAAA,QAAA,QAAA,KAAA,iBAAA+J,EAAA,GAAA/J,CAAA,CAAA,CACA,EACA8J,EAAA,KAAAC,EAAA,YAAA,KAAA,eAAAhE,EAAA,IAAA,EAAAiE,EAAA,KAAA,QAAA,kBAAA,CAAA,CACA,CAIA,SAAAC,EAAA,CACA,IAAA5D,EAAA4D,EAAA,aACA,GAAA5D,EACA,QAAAzF,EAAA,EAAArC,EAAA8H,EAAA,OAAAzF,EAAArC,EAAAqC,IAAA,CACA,IAAAqH,EAAA5B,EAAAzF,CAAA,EACA,GAAAqH,IAAAtB,EAAA,QAAA,CACAsD,EAAA,gBAAA,GACAA,EAAA,8BACA,QACA,CACA,GAAAhC,IAAAtB,EAAA,OAAA,CACAsD,EAAA,8BACA,QACA,CACA,GAAAhC,IAAAtB,EAAA,QAAA,CACAsD,EAAA,8BACA,QACA,CACA,IAAAV,EAAA,KAAA,UAAAtB,EAAA,EAAA,EACA,GAAAsB,GAAAA,EAAA,WAAA,EAAA,CACA,GAAAA,EAAA,MAAA,CACAU,EAAA,kBAAAV,EAAA,KAAA,EACA,MACA,CACAU,EAAA,8BACA,QACA,CACA,GAAA,KAAA,mBAAAhC,EAAA,GAAAgC,EAAA,EAAA,EAAA,CACA,KAAA,oBAAA,GACA,QAAA,KAAA,wCAAA,KAAA,kBAAA,eAAAhC,EAAA,EAAA,EAAA,UAAA,KAAA,kBAAA,eAAAgC,EAAA,EAAA,EAAA,6BAAA,EACA,IAAAC,EAAA,KAAA,eAAAjC,EAAA,GAAAgC,EAAA,GAAA,CAAA,GAAA,CAAA,EACAC,EAAA,QAAA,EACAA,EAAA,KAAAjC,EAAA,EAAA,EACA,QAAA,KAAAiC,EAAA,IAAApK,GAAA,KAAA,kBAAA,eAAAA,CAAA,CAAA,EAAA,KAAA;CAAA,CAAA,EAEAmK,EAAA,8BACA,QACA,CAIA,GAFA,KAAA,sBAAAhC,EAAA,EAAA,EAAA,KAAA,sBAAAA,EAAA,EAAA,GAAA,CAAA,EACA,KAAA,sBAAAA,EAAA,EAAA,EAAA,KAAAgC,EAAA,EAAA,EACAhC,aAAArB,EAAA,CACA,IAAAkD,EAAA,KAAA,UAAA7B,EAAA,QAAA,EACA,GAAA6B,GAAAA,EAAA,WAAA,EAAA,CACA,KAAA,sBAAAA,EAAA,QAAA7B,CAAA,EACA,QACA,CAEA,IAAAkC,EAAA,KAAA,4BAAA,IAAAlC,EAAA,QAAA,EACAkC,IACAA,EAAA,CAAA,EACA,KAAA,4BAAA,IAAAlC,EAAA,SAAAkC,CAAA,GAEAA,EAAA,KAAAlC,CAAA,EACA,KAAA,YAAAA,EAAA,QAAA,EACA,QACA,CACA,KAAA,YAAAA,EAAA,EAAA,CACA,CAEAgC,EAAA,8BAAA,GACA,KAAA,kBAAAA,CAAA,CAEA,CACA,kBAAAA,EAAA,CACA,IAAAtG,EAAA,KAAA,YAAA,EACA,GAAAsG,EAAA,WAAA,EAEA,OAEA,IAAA5D,EAAA4D,EAAA,aACA1D,EAAA,CAAA,EACA,GAAAF,EACA,QAAAzF,EAAA,EAAArC,EAAA8H,EAAA,OAAAzF,EAAArC,EAAAqC,IAAA,CACA,IAAAqH,EAAA5B,EAAAzF,CAAA,EACA,GAAAqH,IAAAtB,EAAA,QAAA,CACAJ,EAAA3F,CAAA,EAAAqJ,EAAA,QACA,QACA,CACA,GAAAhC,IAAAtB,EAAA,OAAA,CACAJ,EAAA3F,CAAA,EAAA,CACA,GAAAqJ,EAAA,MACA,OAAA,IACA,KAAA,QAAA,mBAAAA,EAAA,KAAA,CAEA,EACA,QACA,CACA,GAAAhC,IAAAtB,EAAA,QAAA,CACAJ,EAAA3F,CAAA,EAAA,KAAA,eAAAqJ,EAAA,gBAAA,EACA,QACA,CACA,IAAAV,EAAA,KAAA,UAAAtB,EAAA,EAAA,EACA,GAAAsB,EAAA,CACAhD,EAAA3F,CAAA,EAAA2I,EAAA,QACA,QACA,CACAhD,EAAA3F,CAAA,EAAA,IACA,CAEA,MAAA4F,EAAAvF,IACA,KAAA,sBAAAA,CAAA,GAAA,CAAA,GAAA,IAAA2H,GAAA,KAAA,kBAAA,eAAAA,CAAA,CAAA,EAEAqB,EAAA,SAAAtG,EAAA,KAAA,QAAA4C,EAAAC,CAAA,EAEA,IAAA0C,EAAA,KAAA,sBAAAe,EAAA,EAAA,EAEA,GADA,KAAA,sBAAAA,EAAA,EAAA,EAAA,KACAf,EAGA,QAAAtI,EAAA,EAAArC,EAAA2K,EAAA,OAAAtI,EAAArC,EAAAqC,IAAA,CACA,IAAAwJ,EAAAlB,EAAAtI,CAAA,EACAyJ,EAAA,KAAA,UAAAD,CAAA,EACAC,EAAA,8BACAA,EAAA,8BAAA,GACA,KAAA,kBAAAA,CAAA,CAEA,CAEA,IAAAF,EAAA,KAAA,4BAAA,IAAAF,EAAA,EAAA,EACA,GAAAE,EAAA,CAGA,KAAA,4BAAA,OAAAF,EAAA,EAAA,EAEA,QAAArJ,EAAA,EAAArC,EAAA4L,EAAA,OAAAvJ,EAAArC,EAAAqC,IACA,KAAA,sBAAAqJ,EAAA,QAAAE,EAAAvJ,CAAA,CAAA,CAEA,CACA,CACA,CACAlC,EAAA,cAAAqI,CACA,GAAArI,KAAAA,GAAA,CAAA,EAAA,EACA,IAAA4L,EACA5L,IACA,SAAAA,EAAA,CACA,MAAA+B,EAAA,IAAA/B,EAAA,YACA,IAAA+C,EAAA,KACA,MAAA8I,EAAA,SAAAzK,EAAAuG,EAAA3G,EAAA,CACA,OAAAI,GAAA,WACAJ,EAAA2G,EACAA,EAAAvG,EACAA,EAAA,OAEA,OAAAuG,GAAA,UAAA,CAAA,MAAA,QAAAA,CAAA,KACA3G,EAAA2G,EACAA,EAAA,MAEAA,IACAA,EAAA,CAAA,UAAA,UAAA,QAAA,GAEAvG,EACA2B,EAAA,aAAA3B,EAAAuG,EAAA3G,EAAA,KAAA,IAAA,EAGA+B,EAAA,6BAAA4E,EAAA3G,CAAA,CAEA,EACA6K,EAAA,IAAA,CACA,OAAA,EACA,EACA,MAAAC,EAAA,SAAAlC,EAAAC,EAAA,GAAA,CACA9G,EAAA,UAAA6G,EAAAC,CAAA,CACA,EACAkC,EAAA,UAAA,CACA,GAAA,UAAA,SAAA,EAAA,CACA,GAAA,UAAA,CAAA,YAAA,QAAA,CAAA,MAAA,QAAA,UAAA,CAAA,CAAA,EAAA,CACAD,EAAA,UAAA,CAAA,CAAA,EACA,MACA,CACA,GAAA,OAAA,UAAA,CAAA,GAAA,SACA,OAAA/I,EAAA,mBAAA,UAAA,CAAA,CAAA,CAEA,CACA,IAAA,UAAA,SAAA,GAAA,UAAA,SAAA,IACA,MAAA,QAAA,UAAA,CAAA,CAAA,EAAA,CACAA,EAAA,aAAA/C,EAAA,UAAA,wBAAA,EAAA,UAAA,CAAA,EAAA,UAAA,CAAA,EAAA,UAAA,CAAA,EAAA,IAAA,EACA,MACA,CAEA,MAAA,IAAA,MAAA,2BAAA,CACA,EACA+L,EAAA,OAAAD,EACAC,EAAA,UAAA,UAAA,CACA,OAAAhJ,EAAA,UAAA,EAAA,kBAAA,CACA,EACAgJ,EAAA,MAAA,UAAA,CACAhJ,EAAAA,EAAA,MAAA,CACA,EACAgJ,EAAA,aAAA,UAAA,CACA,OAAAhJ,EAAA,aAAA,CACA,EACAgJ,EAAA,SAAA,UAAA,CACA,OAAAhJ,EAAA,gBAAA,CACA,EACAgJ,EAAA,OAAAF,EACA,SAAAG,GAAA,CACA,GAAA,OAAAhM,EAAA,OAAA,QAAA,KAAA,OAAA,QAAA,IAAA,CACA,MAAAkH,EAAAlH,EAAA,OAAA,SAAA,QACA,GAAA,OAAAkH,GAAA,YAAA,OAAAA,EAAA,SAAA,WAAA,CAEA,MAAArD,EAAA7D,EAAA,0BAAA+C,EAAA,YAAA,EAAAmE,CAAA,EACAlH,EAAA,OAAA,YAAA6D,EACAkI,EAAA,YAAAlI,EACAkI,EAAA,iBAAAlI,CACA,CACA,CACA9B,EAAA,QAAA,CAAAA,EAAA,oBAAA,CAAAA,EAAA,mCACA,OAAA,QAAAgK,GAGAhK,EAAA,qBACA/B,EAAA,OAAA,OAAA6L,GAEA7L,EAAA,OAAA,QAAA+L,EAEA,CACA/L,EAAA,KAAAgM,GACA,OAAAhM,EAAA,OAAA,QAAA,YAAA,CAAAA,EAAA,OAAA,OAAA,OACA+C,EAAA,IAAA/C,EAAA,cAAA+B,EAAA/B,EAAA,mBAAA+B,CAAA,EAAA8J,EAAAE,EAAA/L,EAAA,UAAA,4BAAA,CAAA,EAEA,OAAAA,EAAA,OAAA,QAAA,KAAA,OAAAA,EAAA,OAAA,SAAA,YACA+L,EAAA,OAAA/L,EAAA,OAAA,OAAA,EAGA4L,EAAA,UAAA,CACA,OAAAC,EAAA,MAAA,KAAA,SAAA,CACA,EACAD,EAAA,IAAAC,EAAA,IACA,OAAA,gBAAA,KACAG,EAAA,EAGA,GAAAhM,KAAAA,GAAA,CAAA,EAAA,EC71DC,UAAA,CASA,MAAMiM,EAAqD,WAAmB,kBAExEC,EAAgBD,GAAqBA,EAAkB,QAAUA,EAAkB,QAAU,YAEnG,SAASE,EACRC,EACAC,EAAuB,CAGvB,GAAIJ,GAAmB,yBACtB,GAAI,CACH,OAAOA,EAAkB,yBAAyBG,EAAYC,CAAa,CAC5E,OAAS/K,EAAK,CACb,QAAQ,KAAKA,CAAG,EAChB,MACD,CAGD,GAAI,CACH,OAAO,KAAK,cAAc,aAAa8K,EAAYC,CAAa,CACjE,OAAS/K,EAAK,CACb,QAAQ,KAAKA,CAAG,EAChB,MACD,CACD,CAEA,MAAM2C,EAAqBkI,EAAyB,YAAa,CAChE,gBAAiBhL,GAASA,EAC1B,aAAc,CAACmL,KAAM/G,IAAkB,CAGtC,MAAMgH,EAAShH,EAAK,MAAM,EAAG,EAAE,EAAE,KAAK,GAAG,EACnCiH,EAASjH,EAAK,IAAG,EAAI,SAAQ,EAGnC,MADa,uBAAuBgH,CAAM,OAAOC,CAAM;GAExD,EACA,EAED,SAASrI,GAAU,CAClB,GAAI,CAMH,OAJCF,EACG,WAAW,KAAUA,EAAmB,aAAa,GAAI,MAAM,CAAC,EAChE,IAAI,SAAS,MAAM,GAElB,KAAK,UAAU,EACb,EACR,MAAc,CACb,MAAO,EACR,CACD,CAEA,SAASwI,GAAa,CACrB,OAAO,IAAI,QAAc,CAACC,EAASC,IAAU,CAC5C,GAAI,OAAa,WAAY,QAAW,YAAoB,WAAY,OAAO,IAC9E,OAAOD,EAAO,EAEf,MAAME,EAAuCV,EAAgB,eAG7D,GAAI,EADmB,8BAA8B,KAAKU,CAAS,GAAKA,EAAU,UAAU,EAAG,WAAW,OAAO,MAAM,IAAM,WAAW,SAClHzI,EAAU,EAAI,CAGnC,MAAMyI,CAAS,EAAE,KAAMxI,GAAY,CAClC,GAAIA,EAAS,SAAW,IACvB,MAAM,IAAI,MAAMA,EAAS,UAAU,EAEpC,OAAOA,EAAS,KAAI,CACrB,CAAC,EAAE,KAAMC,GAAQ,CAChBA,EAAO,GAAGA,CAAI;gBAAmBuI,CAAS,IAEzC3I,EACG,WAAW,KAAKA,EAAmB,aAAa,GAAII,CAAI,CAAsB,EAC9E,IAAI,SAASA,CAAI,GAEhB,KAAK,UAAU,EACpBqI,EAAO,CACR,CAAC,EAAE,KAAK,OAAWC,CAAM,EACzB,MACD,CAEI1I,EACH,cAAcA,EAAmB,gBAAgB2I,CAAS,CAAsB,EAEhF,cAAcA,CAAmB,EAElCF,EAAO,CACR,CAAC,CACF,CAEA,SAASG,GAAkB,CAC1B,QAAQ,OAAO,CACd,QAASX,EACT,WAAY,GACZ,mBAAAjI,EACA,kBAAmB,QACnB,CACF,CAEA,SAAS6I,EAASvK,EAAgB,CAQjC,OAAOkK,EAAa,EAAG,KAAK,KAC3BI,EAAkB,EACX,IAAI,QAA4B,CAACH,EAASC,IAAU,CAC1D,QAAQ,CAACpK,CAAQ,EAAGmK,EAASC,CAAM,CACpC,CAAC,EACD,CAEF,CAWA,SAASI,EAAkBC,EAAsB,CAChD,WAAW,UAAA,CACV,MAAMC,EAAiBD,EAAG,OAAO,CAACE,EAAUC,IAA6B,CAClE,WAAY,YAAYD,EAAKC,CAAQ,CAC5C,CAAC,EAGD,IADA,KAAK,UAAaxJ,GAAoBsJ,EAAe,UAAUtJ,EAAE,KAAMA,EAAE,KAAK,EACvEyJ,EAAoB,OAAS,GACnC,KAAK,UAAUA,EAAoB,MAAK,CAAG,CAE7C,EAAG,CAAC,CACL,CAKI,OAAa,WAAY,QAAW,YAAoB,WAAY,OAAO,KAC9EP,EAAkB,EAGnB,IAAIQ,EAAiB,GACrB,MAAMD,EAAsC,CAAA,EAC5C,WAAW,UAAaE,GAAyB,CAChD,GAAI,CAACD,EAAgB,CACpBD,EAAoB,KAAKE,CAAO,EAChC,MACD,CAEAD,EAAiB,GACjBP,EAASQ,EAAQ,IAAI,EAAE,KAAMN,GAAM,CAClCD,EAAkBC,CAAE,CACrB,EAAI1L,GAAO,CACV,QAAQ,MAAMA,CAAG,CAClB,CAAC,CACF,CACD,EAAE,0MCxKFiM,EAAA,KAAAC,EAIAD,EAAA,MAAAE,EAQAF,EAAA,OAAAG,EA0BAH,EAAA,8BAAAI,EAmBAJ,EAAA,aAAAK,EAmBAL,EAAA,cAAAM,EAqBAN,EAAA,YAAAO,EAiCAP,EAAA,QAAAQ,EAmBAR,EAAA,gBAAAS,EAmBAT,EAAA,gBAAAU,EAMAV,EAAA,qBAAAW,EASAX,EAAA,SAAAY,EAOAZ,EAAA,gBAAAa,EAcAb,EAAA,eAAAc,EASAd,EAAA,gBAAAe,EAQAf,EAAA,SAAAgB,EAeAhB,EAAA,eAAAiB,EAMAjB,EAAA,MAAAkB,EA6BAlB,EAAA,YAAAmB,EASAnB,EAAA,YAAAoB,EAYApB,EAAA,UAAAqB,EASArB,EAAA,SAAAsB,EAQAtB,EAAA,QAAAuB,EAUAvB,EAAA,WAAAwB,EAuBAxB,EAAA,OAAAyB,EA2DAzB,EAAA,UAAA0B,EAIA1B,EAAA,oBAAA2B,EAmBA3B,EAAA,aAAA4B,EAxaA,SAAgB3B,EAAQ4B,EAAqBC,EAAY,EAAC,CACzD,OAAOD,EAAMA,EAAM,QAAU,EAAIC,EAAE,CACpC,CAEA,SAAgB5B,EAAS6B,EAAQ,CAChC,GAAIA,EAAI,SAAW,EAClB,MAAM,IAAI,MAAM,mBAAmB,EAGpC,MAAO,CAACA,EAAI,MAAM,EAAGA,EAAI,OAAS,CAAC,EAAGA,EAAIA,EAAI,OAAS,CAAC,CAAC,CAC1D,CAEA,SAAgB5B,EAAU6B,EAAmCC,EAAqCC,EAAsC,CAACpN,EAAGC,IAAMD,IAAMC,EAAC,CACxJ,GAAIiN,IAAQC,EACX,MAAO,GAOR,GAJI,CAACD,GAAO,CAACC,GAITD,EAAI,SAAWC,EAAM,OACxB,MAAO,GAGR,QAAStN,EAAI,EAAGrC,EAAM0P,EAAI,OAAQrN,EAAIrC,EAAKqC,IAC1C,GAAI,CAACuN,EAAWF,EAAIrN,CAAC,EAAGsN,EAAMtN,CAAC,CAAC,EAC/B,MAAO,GAIT,MAAO,EACR,CAMA,SAAgByL,EAAiCyB,EAAYM,EAAa,CACzE,MAAMC,EAAOP,EAAM,OAAS,EACxBM,EAAQC,IACXP,EAAMM,CAAK,EAAIN,EAAMO,CAAI,GAE1BP,EAAM,IAAG,CACV,CAaA,SAAgBxB,EAAgBwB,EAAyBnO,EAAQ2O,EAAsC,CACtG,OAAO/B,EAAcuB,EAAM,OAAQlN,GAAK0N,EAAWR,EAAMlN,CAAC,EAAGjB,CAAG,CAAC,CAClE,CAiBA,SAAgB4M,EAAcgC,EAAgBC,EAAuC,CACpF,IAAIC,EAAM,EACTC,EAAOH,EAAS,EAEjB,KAAOE,GAAOC,GAAM,CACnB,MAAMC,GAAQF,EAAMC,GAAQ,EAAK,EAC3BE,EAAOJ,EAAaG,CAAG,EAC7B,GAAIC,EAAO,EACVH,EAAME,EAAM,UACFC,EAAO,EACjBF,EAAOC,EAAM,MAEb,QAAOA,CAET,CACA,MAAO,EAAEF,EAAM,EAChB,CAKA,SAAgBjC,EAAeqC,EAAa/K,EAAWgL,EAAmB,CAIzE,GAFAD,EAAMA,EAAM,EAERA,GAAO/K,EAAK,OACf,MAAM,IAAI,UAAU,eAAe,EAGpC,MAAMiL,EAAajL,EAAK,KAAK,MAAMA,EAAK,OAAS,KAAK,OAAM,CAAE,CAAC,EACzDkL,EAAa,CAAA,EACbC,EAAc,CAAA,EACdC,GAAc,CAAA,EAEpB,UAAWrP,MAASiE,EAAM,CACzB,MAAMqL,GAAML,EAAQjP,GAAOkP,CAAU,EACjCI,GAAM,EACTH,EAAM,KAAKnP,EAAK,EACNsP,GAAM,EAChBF,EAAO,KAAKpP,EAAK,EAEjBqP,GAAO,KAAKrP,EAAK,CAEnB,CAEA,OAAIgP,EAAMG,EAAM,OACRxC,EAAYqC,EAAKG,EAAOF,CAAO,EAC5BD,EAAMG,EAAM,OAASE,GAAO,OAC/BA,GAAO,CAAC,EAER1C,EAAYqC,GAAOG,EAAM,OAASE,GAAO,QAASD,EAAQH,CAAO,CAE1E,CAEA,SAAgBrC,EAAW3I,EAAwBgL,EAA+B,CACjF,MAAMxQ,EAAgB,CAAA,EACtB,IAAI8Q,EACJ,UAAWC,KAAWvL,EAAK,MAAM,CAAC,EAAE,KAAKgL,CAAO,EAC3C,CAACM,GAAgBN,EAAQM,EAAa,CAAC,EAAGC,CAAO,IAAM,GAC1DD,EAAe,CAACC,CAAO,EACvB/Q,EAAO,KAAK8Q,CAAY,GAExBA,EAAa,KAAKC,CAAO,EAG3B,OAAO/Q,CACR,CAOA,SAAiBoO,EAAmB4C,EAAoBC,EAAgD,CACvG,IAAIH,EACAf,EACJ,UAAWmB,KAAQF,EACdjB,IAAS,QAAakB,EAAgBlB,EAAMmB,CAAI,EACnDJ,EAAc,KAAKI,CAAI,GAEnBJ,IACH,MAAMA,GAEPA,EAAe,CAACI,CAAI,GAErBnB,EAAOmB,EAEJJ,IACH,MAAMA,EAER,CAEA,SAAgBzC,EAAmBqB,EAAUyB,EAAuD,CACnG,QAAS7O,EAAI,EAAGA,GAAKoN,EAAI,OAAQpN,IAChC6O,EAAE7O,IAAM,EAAI,OAAYoN,EAAIpN,EAAI,CAAC,EAAGA,IAAMoN,EAAI,OAAS,OAAYA,EAAIpN,CAAC,CAAC,CAE3E,CAEA,SAAgBgM,EAAwBoB,EAAUyB,EAAoE,CACrH,QAAS7O,EAAI,EAAGA,EAAIoN,EAAI,OAAQpN,IAC/B6O,EAAE7O,IAAM,EAAI,OAAYoN,EAAIpN,EAAI,CAAC,EAAGoN,EAAIpN,CAAC,EAAGA,EAAI,IAAMoN,EAAI,OAAS,OAAYA,EAAIpN,EAAI,CAAC,CAAC,CAE3F,CAKA,SAAgBiM,EAAYiB,EAA0C,CACrE,OAAOA,EAAM,OAAQzL,GAAc,CAAC,CAACA,CAAC,CACvC,CAKA,SAAgByK,EAAmBgB,EAAkC,CACpE,IAAIhN,EAAK,EACT,QAASF,EAAI,EAAGA,EAAIkN,EAAM,OAAQlN,IAC3BkN,EAAMlN,CAAC,IACZkN,EAAMhN,CAAE,EAAIgN,EAAMlN,CAAC,EACnBE,GAAM,GAGRgN,EAAM,OAAShN,CAChB,CAKA,SAAgBiM,EAAetN,EAAQ,CACtC,MAAO,CAAC,MAAM,QAAQA,CAAG,GAAKA,EAAI,SAAW,CAC9C,CAOA,SAAgBuN,EAAmBvN,EAA0C,CAC5E,OAAO,MAAM,QAAQA,CAAG,GAAKA,EAAI,OAAS,CAC3C,CAMA,SAAgBwN,EAAYa,EAAyB4B,EAA2B7P,GAASA,EAAK,CAC7F,MAAM8P,EAAO,IAAI,IAEjB,OAAO7B,EAAM,OAAOuB,GAAU,CAC7B,MAAM1P,EAAM+P,EAAOL,CAAO,EAC1B,OAAIM,EAAK,IAAIhQ,CAAG,EACR,IAERgQ,EAAK,IAAIhQ,CAAG,EACL,GACR,CAAC,CACF,CAIA,SAAgBuN,EAAgCY,EAAyB8B,EAAwB,CAChG,OAAO9B,EAAM,OAAS,EAAIA,EAAM,CAAC,EAAI8B,CACtC,CAIA,SAAgBzC,EAAM0C,EAAa/O,EAAW,CAC7C,IAAID,EAAO,OAAOC,GAAO,SAAW+O,EAAM,EAEtC,OAAO/O,GAAO,SACjBD,EAAOgP,GAEPhP,EAAO,EACPC,EAAK+O,GAGN,MAAMvR,EAAmB,CAAA,EAEzB,GAAIuC,GAAQC,EACX,QAASF,EAAIC,EAAMD,EAAIE,EAAIF,IAC1BtC,EAAO,KAAKsC,CAAC,MAGd,SAASA,EAAIC,EAAMD,EAAIE,EAAIF,IAC1BtC,EAAO,KAAKsC,CAAC,EAIf,OAAOtC,CACR,CAMA,SAAgB8O,EAAe0C,EAAaC,EAAqBC,EAAc,CAC9E,MAAMC,EAASH,EAAO,MAAM,EAAGC,CAAW,EACpCG,EAAQJ,EAAO,MAAMC,CAAW,EACtC,OAAOE,EAAO,OAAOD,EAAWE,CAAK,CACtC,CAKA,SAAgB7C,EAAeW,EAAUnO,EAAQ,CAChD,MAAMuO,EAAQJ,EAAI,QAAQnO,CAAK,EAE3BuO,EAAQ,KACXJ,EAAI,OAAOI,EAAO,CAAC,EACnBJ,EAAI,QAAQnO,CAAK,EAEnB,CAKA,SAAgByN,EAAaU,EAAUnO,EAAQ,CAC9C,MAAMuO,EAAQJ,EAAI,QAAQnO,CAAK,EAE3BuO,EAAQ,KACXJ,EAAI,OAAOI,EAAO,CAAC,EACnBJ,EAAI,KAAKnO,CAAK,EAEhB,CAEA,SAAgB0N,EAAYS,EAAUsB,EAAuB,CAC5D,UAAWE,KAAQF,EAClBtB,EAAI,KAAKwB,CAAI,CAEf,CAIA,SAAgBhC,EAAW2C,EAAU,CACpC,OAAO,MAAM,QAAQA,CAAC,EAAIA,EAAI,CAACA,CAAC,CACjC,CAQA,SAAgB1C,EAAcK,EAAYsC,EAAeC,EAAa,CACrE,MAAMC,EAAWC,EAAoBzC,EAAOsC,CAAK,EAC3CI,EAAiB1C,EAAM,OACvB2C,EAAiBJ,EAAS,OAChCvC,EAAM,OAAS0C,EAAiBC,EAEhC,QAAS7P,GAAI4P,EAAiB,EAAG5P,IAAK0P,EAAU1P,KAC/CkN,EAAMlN,GAAI6P,CAAc,EAAI3C,EAAMlN,EAAC,EAGpC,QAASA,GAAI,EAAGA,GAAI6P,EAAgB7P,KACnCkN,EAAMlN,GAAI0P,CAAQ,EAAID,EAASzP,EAAC,CAElC,CAUA,SAAgB8M,EAAUI,EAAYsC,EAAeM,EAAqBL,EAAa,CACtF,MAAMjC,EAAQmC,EAAoBzC,EAAOsC,CAAK,EAC9C,IAAI9R,EAASwP,EAAM,OAAOM,EAAOsC,CAAW,EAC5C,OAAIpS,IAAW,SAEdA,EAAS,CAAA,GAEVmP,EAAWK,EAAOM,EAAOiC,CAAQ,EAC1B/R,CACR,CASA,SAASiS,EAAuBzC,EAAYsC,EAAa,CACxD,OAAOA,EAAQ,EAAI,KAAK,IAAIA,EAAQtC,EAAM,OAAQ,CAAC,EAAI,KAAK,IAAIsC,EAAOtC,EAAM,MAAM,CACpF,CAUA,IAAiB6C,GAAjB,SAAiBA,EAAa,CAC7B,SAAgBC,EAAWtS,EAAqB,CAC/C,OAAOA,EAAS,CACjB,CAFgBqS,EAAA,WAAUC,EAI1B,SAAgBC,EAAkBvS,EAAqB,CACtD,OAAOA,GAAU,CAClB,CAFgBqS,EAAA,kBAAiBE,EAIjC,SAAgBC,EAAcxS,EAAqB,CAClD,OAAOA,EAAS,CACjB,CAFgBqS,EAAA,cAAaG,EAI7B,SAAgBC,EAA2BzS,EAAqB,CAC/D,OAAOA,IAAW,CACnB,CAFgBqS,EAAA,2BAA0BI,EAI7BJ,EAAA,YAAc,EACdA,EAAA,SAAW,GACXA,EAAA,yBAA2B,CACzC,GApBiBA,IAAa1E,EAAA,cAAb0E,EAAa,CAAA,EAAA,EA6B9B,SAAgBhD,EAA6BqD,EAAuC1C,EAAkC,CACrH,MAAO,CAACvN,EAAGC,IAAMsN,EAAW0C,EAASjQ,CAAC,EAAGiQ,EAAShQ,CAAC,CAAC,CACrD,CAEA,SAAgB4M,KAA8BqD,EAAgC,CAC7E,MAAO,CAACC,EAAOC,IAAS,CACvB,UAAW7C,KAAc2C,EAAa,CACrC,MAAM3S,EAASgQ,EAAW4C,EAAOC,CAAK,EACtC,GAAI,CAACR,EAAc,2BAA2BrS,CAAM,EACnD,OAAOA,CAET,CACA,OAAOqS,EAAc,wBACtB,CACD,CAKO,MAAMS,EAAuC,CAACrQ,EAAGC,IAAMD,EAAIC,EAArDiL,EAAA,iBAAgBmF,EAEtB,MAAMC,EAAyC,CAACtQ,EAAGC,OAAMiL,EAAA,kBAAiBlL,EAAI,EAAI,EAAGC,EAAI,EAAI,CAAC,EAAxFiL,EAAA,kBAAiBoF,EAE9B,SAAgBxD,EAAoBS,EAA6B,CAChE,MAAO,CAACvN,EAAGC,IAAM,CAACsN,EAAWvN,EAAGC,CAAC,CAClC,CAEA,MAAasQ,CAAU,CAOtB,YAA6BhC,EAAmB,CAAnB,KAAA,MAAAA,EANrB,KAAA,SAAW,EACX,KAAA,QAAU,KAAK,MAAM,OAAS,CAKc,CAEpD,IAAI,QAAM,CACT,OAAO,KAAK,QAAU,KAAK,SAAW,CACvC,CAMA,UAAUiC,EAAgC,CAIzC,IAAIjB,EAAW,KAAK,SACpB,KAAOA,EAAW,KAAK,MAAM,QAAUiB,EAAU,KAAK,MAAMjB,CAAQ,CAAC,GACpEA,IAED,MAAMhS,EAASgS,IAAa,KAAK,SAAW,KAAO,KAAK,MAAM,MAAM,KAAK,SAAUA,CAAQ,EAC3F,YAAK,SAAWA,EACThS,CACR,CAOA,iBAAiBiT,EAAgC,CAIhD,IAAIC,EAAS,KAAK,QAClB,KAAOA,GAAU,GAAKD,EAAU,KAAK,MAAMC,CAAM,CAAC,GACjDA,IAED,MAAMlT,EAASkT,IAAW,KAAK,QAAU,KAAO,KAAK,MAAM,MAAMA,EAAS,EAAG,KAAK,QAAU,CAAC,EAC7F,YAAK,QAAUA,EACRlT,CACR,CAEA,MAAI,CACH,GAAI,KAAK,SAAW,EAGpB,OAAO,KAAK,MAAM,KAAK,QAAQ,CAChC,CAEA,SAAO,CACN,MAAMA,EAAS,KAAK,MAAM,KAAK,QAAQ,EACvC,YAAK,WACEA,CACR,CAEA,UAAUmT,EAAa,CACtB,MAAMnT,EAAS,KAAK,MAAM,MAAM,KAAK,SAAU,KAAK,SAAWmT,CAAK,EACpE,YAAK,UAAYA,EACVnT,CACR,EAjED2N,EAAA,WAAAqF,EAuEA,MAAaI,CAAgB,QACL,KAAA,MAAQ,IAAIA,EAAwBC,GAAY,CAAG,CAAC,CAAE,CAE7E,YAKiBC,EAAiD,CAAjD,KAAA,QAAAA,CAEjB,CAEA,SAAO,CACN,MAAMtT,EAAc,CAAA,EACpB,YAAK,QAAQkR,IAAUlR,EAAO,KAAKkR,CAAI,EAAU,GAAO,EACjDlR,CACR,CAEA,OAAOiT,EAA+B,CACrC,OAAO,IAAIG,EAAiBG,GAAM,KAAK,QAAQrC,GAAQ+B,EAAU/B,CAAI,EAAIqC,EAAGrC,CAAI,EAAI,EAAI,CAAC,CAC1F,CAEA,IAAasC,EAA2B,CACvC,OAAO,IAAIJ,EAA0BG,GAAM,KAAK,QAAQrC,GAAQqC,EAAGC,EAAMtC,CAAI,CAAC,CAAC,CAAC,CACjF,CAEA,SAAS+B,EAA+B,CACvC,IAAIjT,EACJ,YAAK,QAAQkR,IACR+B,EAAU/B,CAAI,IACjBlR,EAASkR,GAEH,GACP,EACMlR,CACR,CAEA,cAAcgQ,EAAyB,CACtC,IAAIhQ,EACAyT,EAAQ,GACZ,YAAK,QAAQvC,KACRuC,GAASpB,EAAc,cAAcrC,EAAWkB,EAAMlR,CAAO,CAAC,KACjEyT,EAAQ,GACRzT,EAASkR,GAEH,GACP,EACMlR,CACR,EAhDD2N,EAAA,iBAAAyF,EAsDA,MAAaM,CAAW,CACvB,YAA6BC,EAA4B,CAA5B,KAAA,UAAAA,CAAgC,CAKtD,OAAO,sBAAyBjE,EAAmBkE,EAAiC,CAC1F,MAAMC,EAAc,MAAM,KAAKnE,EAAI,KAAI,CAAE,EAAE,KAAK,CAACoE,EAAQC,IAAWH,EAAUlE,EAAIoE,CAAM,EAAGpE,EAAIqE,CAAM,CAAC,CAAC,EACvG,OAAO,IAAIL,EAAYG,CAAW,CACnC,CAKA,MAASnE,EAAiB,CACzB,OAAOA,EAAI,IAAI,CAAChD,EAAGoD,IAAUJ,EAAI,KAAK,UAAUI,CAAK,CAAC,CAAC,CACxD,CAKA,SAAO,CACN,MAAMkE,EAAkB,KAAK,UAAU,MAAK,EAC5C,QAAS1R,EAAI,EAAGA,EAAI,KAAK,UAAU,OAAQA,IAC1C0R,EAAgB,KAAK,UAAU1R,CAAC,CAAC,EAAIA,EAEtC,OAAO,IAAIoR,EAAYM,CAAe,CACvC,EA3BDrG,EAAA,YAAA+F,0HCziBA/F,EAAA,SAAAsG,EAQAtG,EAAA,YAAAuG,EAkBAvG,EAAA,mBAAAwG,EAWAxG,EAAA,sBAAAyG,EAoBAzG,EAAA,oBAAA0G,EAWA1G,EAAA,+BAAA2G,EAsDA3G,EAAA,aAAA4G,EAkBA5G,EAAA,YAAA6G,EAkBA7G,EAAA,aAAA8G,EAIA9G,EAAA,WAAA+G,EAkBA/G,EAAA,aAAAgH,EApLA,SAAgBV,EAAYzE,EAAqByD,EAA+B,CAC/E,MAAM2B,EAAMV,EAAY1E,EAAOyD,CAAS,EACxC,GAAI2B,IAAQ,GAGZ,OAAOpF,EAAMoF,CAAG,CACjB,CAEA,SAAgBV,EAAe1E,EAAqByD,EAAiC4B,EAAYrF,EAAM,OAAS,EAAC,CAChH,QAASlN,EAAIuS,EAAWvS,GAAK,EAAGA,IAAK,CACpC,MAAMyO,EAAUvB,EAAMlN,CAAC,EAEvB,GAAI2Q,EAAUlC,CAAO,EACpB,OAAOzO,CAET,CAEA,MAAO,EACR,CAQA,SAAgB6R,EAAsB3E,EAAqByD,EAA+B,CACzF,MAAM2B,EAAMR,EAAsB5E,EAAOyD,CAAS,EAClD,OAAO2B,IAAQ,GAAK,OAAYpF,EAAMoF,CAAG,CAC1C,CAQA,SAAgBR,EAAyB5E,EAAqByD,EAAiCjB,EAAW,EAAG8C,EAAWtF,EAAM,OAAM,CACnI,IAAIlN,EAAI0P,EACJnP,EAAIiS,EACR,KAAOxS,EAAIO,GAAG,CACb,MAAMkS,EAAI,KAAK,OAAOzS,EAAIO,GAAK,CAAC,EAC5BoQ,EAAUzD,EAAMuF,CAAC,CAAC,EACrBzS,EAAIyS,EAAI,EAERlS,EAAIkS,CAEN,CACA,OAAOzS,EAAI,CACZ,CAQA,SAAgB+R,EAAuB7E,EAAqByD,EAA+B,CAC1F,MAAM2B,EAAMN,EAA+B9E,EAAOyD,CAAS,EAC3D,OAAO2B,IAAQpF,EAAM,OAAS,OAAYA,EAAMoF,CAAG,CACpD,CAQA,SAAgBN,EAAkC9E,EAAqByD,EAAiCjB,EAAW,EAAG8C,EAAWtF,EAAM,OAAM,CAC5I,IAAIlN,EAAI0P,EACJnP,EAAIiS,EACR,KAAOxS,EAAIO,GAAG,CACb,MAAMkS,EAAI,KAAK,OAAOzS,EAAIO,GAAK,CAAC,EAC5BoQ,EAAUzD,EAAMuF,CAAC,CAAC,EACrBlS,EAAIkS,EAEJzS,EAAIyS,EAAI,CAEV,CACA,OAAOzS,CACR,CAQA,MAAa0S,CAAe,QACb,KAAA,iBAAmB,EAAM,CAKvC,YAA6BC,EAAoB,CAApB,KAAA,OAAAA,EAHrB,KAAA,2BAA6B,CAIrC,CAMA,mBAAmBhC,EAA+B,CACjD,GAAI+B,EAAgB,iBAAkB,CACrC,GAAI,KAAK,wBACR,UAAW9D,KAAQ,KAAK,OACvB,GAAI,KAAK,uBAAuBA,CAAI,GAAK,CAAC+B,EAAU/B,CAAI,EACvD,MAAM,IAAI,MAAM,8FAA8F,EAIjH,KAAK,uBAAyB+B,CAC/B,CAEA,MAAM2B,EAAMR,EAAsB,KAAK,OAAQnB,EAAW,KAAK,0BAA0B,EACzF,YAAK,2BAA6B2B,EAAM,EACjCA,IAAQ,GAAK,OAAY,KAAK,OAAOA,CAAG,CAChD,EA5BDjH,EAAA,gBAAAqH,EAkCA,SAAgBT,EAAgB/E,EAAqBQ,EAAyB,CAC7E,GAAIR,EAAM,SAAW,EACpB,OAGD,IAAI0F,EAAM1F,EAAM,CAAC,EACjB,QAASlN,EAAI,EAAGA,EAAIkN,EAAM,OAAQlN,IAAK,CACtC,MAAM4O,EAAO1B,EAAMlN,CAAC,EAChB0N,EAAWkB,EAAMgE,CAAG,EAAI,IAC3BA,EAAMhE,EAER,CACA,OAAOgE,CACR,CAKA,SAAgBV,EAAehF,EAAqBQ,EAAyB,CAC5E,GAAIR,EAAM,SAAW,EACpB,OAGD,IAAI0F,EAAM1F,EAAM,CAAC,EACjB,QAASlN,EAAI,EAAGA,EAAIkN,EAAM,OAAQlN,IAAK,CACtC,MAAM4O,EAAO1B,EAAMlN,CAAC,EAChB0N,EAAWkB,EAAMgE,CAAG,GAAK,IAC5BA,EAAMhE,EAER,CACA,OAAOgE,CACR,CAKA,SAAgBT,EAAgBjF,EAAqBQ,EAAyB,CAC7E,OAAOuE,EAAa/E,EAAO,CAAC/M,EAAGC,IAAM,CAACsN,EAAWvN,EAAGC,CAAC,CAAC,CACvD,CAEA,SAAgBgS,EAAclF,EAAqBQ,EAAyB,CAC3E,GAAIR,EAAM,SAAW,EACpB,MAAO,GAGR,IAAI2F,EAAS,EACb,QAAS7S,EAAI,EAAGA,EAAIkN,EAAM,OAAQlN,IAAK,CACtC,MAAM4O,EAAO1B,EAAMlN,CAAC,EAChB0N,EAAWkB,EAAM1B,EAAM2F,CAAM,CAAC,EAAI,IACrCA,EAAS7S,EAEX,CACA,OAAO6S,CACR,CAKA,SAAgBR,EAAmB3D,EAAoBwC,EAAkC,CACxF,UAAWjS,KAASyP,EAAO,CAC1B,MAAMoE,EAAS5B,EAAMjS,CAAK,EAC1B,GAAI6T,IAAW,OACd,OAAOA,CAET,CAGD,6IClMAzH,EAAA,SAAA0H,EAAA,SAAgBA,EAAYC,EAAI,CAC/B,OAAOA,CACR,CAcA,MAAaC,CAAiB,CAS7B,YAAYC,EAAwDC,EAA+B,CAR3F,KAAA,UAAmC,OACnC,KAAA,WAAkC,OAQrC,OAAOD,GAAS,YACnB,KAAK,IAAMA,EACX,KAAK,YAAcH,IAEnB,KAAK,IAAMI,EACX,KAAK,YAAcD,EAAK,YAE1B,CAEO,IAAIjE,EAAS,CACnB,MAAMlQ,EAAM,KAAK,YAAYkQ,CAAG,EAChC,OAAI,KAAK,aAAelQ,IACvB,KAAK,WAAaA,EAClB,KAAK,UAAY,KAAK,IAAIkQ,CAAG,GAEvB,KAAK,SACb,EA1BD5D,EAAA,kBAAA4H,EAgCA,MAAaG,CAAc,CAG1B,IAAW,cAAY,CACtB,OAAO,KAAK,IACb,CAOA,YAAYF,EAAwDC,EAA+B,CAXlF,KAAA,KAAO,IAAI,IACX,KAAA,MAAQ,IAAI,IAWxB,OAAOD,GAAS,YACnB,KAAK,IAAMA,EACX,KAAK,YAAcH,IAEnB,KAAK,IAAMI,EACX,KAAK,YAAcD,EAAK,YAE1B,CAEO,IAAIjE,EAAS,CACnB,MAAMlQ,EAAM,KAAK,YAAYkQ,CAAG,EAChC,GAAI,KAAK,MAAM,IAAIlQ,CAAG,EACrB,OAAO,KAAK,MAAM,IAAIA,CAAG,EAG1B,MAAME,EAAQ,KAAK,IAAIgQ,CAAG,EAC1B,YAAK,KAAK,IAAIA,EAAKhQ,CAAK,EACxB,KAAK,MAAM,IAAIF,EAAKE,CAAK,EAClBA,CACR,EAhCDoM,EAAA,eAAA+H,qIC3CA,SAASC,EAAWC,EAAgBC,EAAqB,CACxD,MAAMC,EAAU,KAAK,IAAI,GAAID,CAAa,EAC1C,OAAO,KAAK,MAAMD,EAASE,CAAO,EAAIA,CACvC,CAEA,MAAaC,CAAI,CAuBhB,YAAYnO,EAAWoO,EAAWtT,EAAWD,EAAY,EAAC,CAtB1D,KAAA,WAAmB,OAuBlB,KAAK,EAAI,KAAK,IAAI,IAAK,KAAK,IAAI,EAAGmF,CAAC,CAAC,EAAI,EACzC,KAAK,EAAI,KAAK,IAAI,IAAK,KAAK,IAAI,EAAGoO,CAAC,CAAC,EAAI,EACzC,KAAK,EAAI,KAAK,IAAI,IAAK,KAAK,IAAI,EAAGtT,CAAC,CAAC,EAAI,EACzC,KAAK,EAAIiT,EAAW,KAAK,IAAI,KAAK,IAAI,EAAGlT,CAAC,EAAG,CAAC,EAAG,CAAC,CACnD,CAEA,OAAO,OAAOA,EAASC,EAAO,CAC7B,OAAOD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,CAC/D,EAhCDiL,EAAA,KAAAoI,EAmCA,MAAaE,CAAI,CAwBhB,YAAYC,EAAWC,EAAWC,EAAW3T,EAAS,CAtBtD,KAAA,WAAmB,OAuBlB,KAAK,EAAI,KAAK,IAAI,KAAK,IAAI,IAAKyT,CAAC,EAAG,CAAC,EAAI,EACzC,KAAK,EAAIP,EAAW,KAAK,IAAI,KAAK,IAAI,EAAGQ,CAAC,EAAG,CAAC,EAAG,CAAC,EAClD,KAAK,EAAIR,EAAW,KAAK,IAAI,KAAK,IAAI,EAAGS,CAAC,EAAG,CAAC,EAAG,CAAC,EAClD,KAAK,EAAIT,EAAW,KAAK,IAAI,KAAK,IAAI,EAAGlT,CAAC,EAAG,CAAC,EAAG,CAAC,CACnD,CAEA,OAAO,OAAOA,EAASC,EAAO,CAC7B,OAAOD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,CAC/D,CAQA,OAAO,SAAS2T,EAAU,CACzB,MAAMzO,EAAIyO,EAAK,EAAI,IACbL,EAAIK,EAAK,EAAI,IACb3T,EAAI2T,EAAK,EAAI,IACb5T,EAAI4T,EAAK,EAETnB,EAAM,KAAK,IAAItN,EAAGoO,EAAGtT,CAAC,EACtB4T,EAAM,KAAK,IAAI1O,EAAGoO,EAAGtT,CAAC,EAC5B,IAAIwT,EAAI,EACJC,EAAI,EACR,MAAMC,GAAKE,EAAMpB,GAAO,EAClBqB,EAASrB,EAAMoB,EAErB,GAAIC,EAAS,EAAG,CAGf,OAFAJ,EAAI,KAAK,IAAKC,GAAK,GAAMG,GAAU,EAAIH,GAAKG,GAAU,EAAK,EAAIH,GAAM,CAAC,EAE9DlB,EAAK,CACZ,KAAKtN,EAAGsO,GAAKF,EAAItT,GAAK6T,GAAUP,EAAItT,EAAI,EAAI,GAAI,MAChD,KAAKsT,EAAGE,GAAKxT,EAAIkF,GAAK2O,EAAS,EAAG,MAClC,KAAK7T,EAAGwT,GAAKtO,EAAIoO,GAAKO,EAAS,EAAG,KACnC,CAEAL,GAAK,GACLA,EAAI,KAAK,MAAMA,CAAC,CACjB,CACA,OAAO,IAAID,EAAKC,EAAGC,EAAGC,EAAG3T,CAAC,CAC3B,CAEQ,OAAO,SAAS+T,EAAWC,EAAWnB,EAAS,CAOtD,OANIA,EAAI,IACPA,GAAK,GAEFA,EAAI,IACPA,GAAK,GAEFA,EAAI,EAAI,EACJkB,GAAKC,EAAID,GAAK,EAAIlB,EAEtBA,EAAI,EAAI,EACJmB,EAEJnB,EAAI,EAAI,EACJkB,GAAKC,EAAID,IAAM,EAAI,EAAIlB,GAAK,EAE7BkB,CACR,CAQA,OAAO,OAAOE,EAAU,CACvB,MAAMR,EAAIQ,EAAK,EAAI,IACb,CAAE,EAAAP,EAAG,EAAAC,EAAG,EAAA3T,CAAC,EAAKiU,EACpB,IAAI,EAAWV,EAAWtT,EAE1B,GAAIyT,IAAM,EACT,EAAIH,EAAItT,EAAI0T,MACN,CACN,MAAMK,EAAIL,EAAI,GAAMA,GAAK,EAAID,GAAKC,EAAID,EAAIC,EAAID,EACxCK,EAAI,EAAIJ,EAAIK,EAClB,EAAIR,EAAK,SAASO,EAAGC,EAAGP,EAAI,EAAI,CAAC,EACjCF,EAAIC,EAAK,SAASO,EAAGC,EAAGP,CAAC,EACzBxT,EAAIuT,EAAK,SAASO,EAAGC,EAAGP,EAAI,EAAI,CAAC,CAClC,CAEA,OAAO,IAAIH,EAAK,KAAK,MAAM,EAAI,GAAG,EAAG,KAAK,MAAMC,EAAI,GAAG,EAAG,KAAK,MAAMtT,EAAI,GAAG,EAAGD,CAAC,CACjF,EA9GDkL,EAAA,KAAAsI,EAiHA,MAAaU,CAAI,CAwBhB,YAAYT,EAAWC,EAAWS,EAAWnU,EAAS,CAtBtD,KAAA,WAAmB,OAuBlB,KAAK,EAAI,KAAK,IAAI,KAAK,IAAI,IAAKyT,CAAC,EAAG,CAAC,EAAI,EACzC,KAAK,EAAIP,EAAW,KAAK,IAAI,KAAK,IAAI,EAAGQ,CAAC,EAAG,CAAC,EAAG,CAAC,EAClD,KAAK,EAAIR,EAAW,KAAK,IAAI,KAAK,IAAI,EAAGiB,CAAC,EAAG,CAAC,EAAG,CAAC,EAClD,KAAK,EAAIjB,EAAW,KAAK,IAAI,KAAK,IAAI,EAAGlT,CAAC,EAAG,CAAC,EAAG,CAAC,CACnD,CAEA,OAAO,OAAOA,EAASC,EAAO,CAC7B,OAAOD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,CAC/D,CAGA,OAAO,SAAS2T,EAAU,CACzB,MAAMzO,EAAIyO,EAAK,EAAI,IACbL,EAAIK,EAAK,EAAI,IACb3T,EAAI2T,EAAK,EAAI,IACbQ,EAAO,KAAK,IAAIjP,EAAGoO,EAAGtT,CAAC,EACvBoU,EAAO,KAAK,IAAIlP,EAAGoO,EAAGtT,CAAC,EACvBqU,EAAQF,EAAOC,EACfX,EAAIU,IAAS,EAAI,EAAKE,EAAQF,EACpC,IAAI3N,EAEJ,OAAI6N,IAAU,EACb7N,EAAI,EACM2N,IAASjP,EACnBsB,IAAQ8M,EAAItT,GAAKqU,EAAS,EAAK,GAAK,EAC1BF,IAASb,EACnB9M,GAAMxG,EAAIkF,GAAKmP,EAAS,EAExB7N,GAAMtB,EAAIoO,GAAKe,EAAS,EAGlB,IAAIJ,EAAK,KAAK,MAAMzN,EAAI,EAAE,EAAGiN,EAAGU,EAAMR,EAAK,CAAC,CACpD,CAGA,OAAO,OAAOW,EAAU,CACvB,KAAM,CAAE,EAAAd,EAAG,EAAAC,EAAG,EAAAS,EAAG,EAAAnU,CAAC,EAAKuU,EACjBnR,EAAI+Q,EAAIT,EACRtE,EAAIhM,GAAK,EAAI,KAAK,IAAKqQ,EAAI,GAAM,EAAI,CAAC,GACtChN,EAAI0N,EAAI/Q,EACd,GAAI,CAAC+B,EAAGoO,EAAGtT,CAAC,EAAI,CAAC,EAAG,EAAG,CAAC,EAExB,OAAIwT,EAAI,IACPtO,EAAI/B,EACJmQ,EAAInE,GACMqE,EAAI,KACdtO,EAAIiK,EACJmE,EAAInQ,GACMqQ,EAAI,KACdF,EAAInQ,EACJnD,EAAImP,GACMqE,EAAI,KACdF,EAAInE,EACJnP,EAAImD,GACMqQ,EAAI,KACdtO,EAAIiK,EACJnP,EAAImD,GACMqQ,GAAK,MACftO,EAAI/B,EACJnD,EAAImP,GAGLjK,EAAI,KAAK,OAAOA,EAAIsB,GAAK,GAAG,EAC5B8M,EAAI,KAAK,OAAOA,EAAI9M,GAAK,GAAG,EAC5BxG,EAAI,KAAK,OAAOA,EAAIwG,GAAK,GAAG,EAErB,IAAI6M,EAAKnO,EAAGoO,EAAGtT,EAAGD,CAAC,CAC3B,EA5FDkL,EAAA,KAAAgJ,EA+FA,MAAaM,CAAK,CAEjB,OAAO,QAAQC,EAAW,CACzB,OAAOD,EAAM,OAAO,IAAI,SAASC,CAAG,GAAKD,EAAM,GAChD,CAEA,OAAO,OAAOxU,EAAiBC,EAAe,CAC7C,MAAI,CAACD,GAAK,CAACC,EACH,GAEJ,CAACD,GAAK,CAACC,EACH,GAEDD,EAAE,OAAOC,CAAC,CAClB,CAIA,IAAI,MAAI,CACP,OAAI,KAAK,MACD,KAAK,MAELuT,EAAK,SAAS,KAAK,IAAI,CAEhC,CAGA,IAAI,MAAI,CACP,OAAI,KAAK,MACD,KAAK,MAENU,EAAK,SAAS,KAAK,IAAI,CAC/B,CAEA,YAAYpF,EAAuB,CAClC,GAAKA,EAEE,GAAIA,aAAewE,EACzB,KAAK,KAAOxE,UACFA,aAAe0E,EACzB,KAAK,MAAQ1E,EACb,KAAK,KAAO0E,EAAK,OAAO1E,CAAG,UACjBA,aAAeoF,EACzB,KAAK,MAAQpF,EACb,KAAK,KAAOoF,EAAK,OAAOpF,CAAG,MAE3B,OAAM,IAAI,MAAM,6BAA6B,MAV7C,OAAM,IAAI,MAAM,qBAAqB,CAYvC,CAEA,OAAO3B,EAAmB,CACzB,MAAO,CAAC,CAACA,GAASmG,EAAK,OAAO,KAAK,KAAMnG,EAAM,IAAI,GAAKqG,EAAK,OAAO,KAAK,KAAMrG,EAAM,IAAI,GAAK+G,EAAK,OAAO,KAAK,KAAM/G,EAAM,IAAI,CAChI,CAMA,sBAAoB,CACnB,MAAMuH,EAAIF,EAAM,+BAA+B,KAAK,KAAK,CAAC,EACpDG,EAAIH,EAAM,+BAA+B,KAAK,KAAK,CAAC,EACpDI,EAAIJ,EAAM,+BAA+B,KAAK,KAAK,CAAC,EACpDK,EAAY,MAASH,EAAI,MAASC,EAAI,MAASC,EAErD,OAAO1B,EAAW2B,EAAW,CAAC,CAC/B,CAEQ,OAAO,+BAA+BC,EAAa,CAC1D,MAAM1R,EAAI0R,EAAQ,IAClB,OAAQ1R,GAAK,OAAWA,EAAI,MAAQ,KAAK,KAAMA,EAAI,MAAS,MAAQ,GAAG,CACxE,CAMA,WAAS,CAER,OADa,KAAK,KAAK,EAAI,IAAM,KAAK,KAAK,EAAI,IAAM,KAAK,KAAK,EAAI,KAAO,KAC5D,GACf,CAEA,cAAc2R,EAAc,CAC3B,MAAMC,EAAO,KAAK,qBAAoB,EAChCC,EAAOF,EAAQ,qBAAoB,EACzC,OAAOC,EAAOC,CACf,CAEA,aAAaF,EAAc,CAC1B,MAAMC,EAAO,KAAK,qBAAoB,EAChCC,EAAOF,EAAQ,qBAAoB,EACzC,OAAOC,EAAOC,CACf,CAEA,QAAQC,EAAc,CACrB,OAAO,IAAIV,EAAM,IAAIhB,EAAK,KAAK,KAAK,EAAG,KAAK,KAAK,EAAG,KAAK,KAAK,EAAI,KAAK,KAAK,EAAI0B,EAAQ,KAAK,KAAK,CAAC,CAAC,CACrG,CAEA,OAAOA,EAAc,CACpB,OAAO,IAAIV,EAAM,IAAIhB,EAAK,KAAK,KAAK,EAAG,KAAK,KAAK,EAAG,KAAK,KAAK,EAAI,KAAK,KAAK,EAAI0B,EAAQ,KAAK,KAAK,CAAC,CAAC,CACrG,CAEA,YAAYA,EAAc,CACzB,KAAM,CAAE,EAAA/P,EAAG,EAAAoO,EAAG,EAAAtT,EAAG,EAAAD,CAAC,EAAK,KAAK,KAC5B,OAAO,IAAIwU,EAAM,IAAIlB,EAAKnO,EAAGoO,EAAGtT,EAAGD,EAAIkV,CAAM,CAAC,CAC/C,CAEA,eAAa,CACZ,OAAO,KAAK,KAAK,IAAM,CACxB,CAEA,UAAQ,CACP,OAAO,KAAK,KAAK,IAAM,CACxB,CAEA,UAAQ,CACP,OAAO,IAAIV,EAAM,IAAIlB,EAAK,IAAM,KAAK,KAAK,EAAG,IAAM,KAAK,KAAK,EAAG,IAAM,KAAK,KAAK,EAAG,KAAK,KAAK,CAAC,CAAC,CAChG,CAEA,WAAW6B,EAAuB,CACjC,GAAI,KAAK,SAAQ,GAAMA,EAAiB,KAAK,IAAM,EAElD,OAAO,KAGR,KAAM,CAAE,EAAAhQ,EAAG,EAAAoO,EAAG,EAAAtT,EAAG,EAAAD,CAAC,EAAK,KAAK,KAG5B,OAAO,IAAIwU,EAAM,IAAIlB,EACpB6B,EAAiB,KAAK,EAAInV,GAAKmV,EAAiB,KAAK,EAAIhQ,GACzDgQ,EAAiB,KAAK,EAAInV,GAAKmV,EAAiB,KAAK,EAAI5B,GACzD4B,EAAiB,KAAK,EAAInV,GAAKmV,EAAiB,KAAK,EAAIlV,GACzD,CAAC,CACD,CACF,CAGA,UAAQ,CACP,OAAK,KAAK,YACT,KAAK,UAAYuU,EAAM,OAAO,IAAI,OAAO,IAAI,GAEvC,KAAK,SACb,CAEA,OAAO,gBAAgBY,EAAWC,EAAiBH,EAAe,CACjE,GAAIE,EAAG,cAAcC,CAAQ,EAC5B,OAAOD,EAERF,EAASA,GAAkB,GAC3B,MAAMF,EAAOI,EAAG,qBAAoB,EAC9BH,EAAOI,EAAS,qBAAoB,EAC1C,OAAAH,EAASA,GAAUD,EAAOD,GAAQC,EAC3BG,EAAG,QAAQF,CAAM,CACzB,CAEA,OAAO,eAAeE,EAAWC,EAAiBH,EAAe,CAChE,GAAIE,EAAG,aAAaC,CAAQ,EAC3B,OAAOD,EAERF,EAASA,GAAkB,GAC3B,MAAMF,EAAOI,EAAG,qBAAoB,EAC9BH,EAAOI,EAAS,qBAAoB,EAC1C,OAAAH,EAASA,GAAUF,EAAOC,GAAQD,EAC3BI,EAAG,OAAOF,CAAM,CACxB,QAEgB,KAAA,MAAQ,IAAIV,EAAM,IAAIlB,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,CAAE,QAC9C,KAAA,MAAQ,IAAIkB,EAAM,IAAIlB,EAAK,EAAG,EAAG,EAAG,CAAC,CAAC,CAAE,QACxC,KAAA,IAAM,IAAIkB,EAAM,IAAIlB,EAAK,IAAK,EAAG,EAAG,CAAC,CAAC,CAAE,QACxC,KAAA,KAAO,IAAIkB,EAAM,IAAIlB,EAAK,EAAG,EAAG,IAAK,CAAC,CAAC,CAAE,QACzC,KAAA,MAAQ,IAAIkB,EAAM,IAAIlB,EAAK,EAAG,IAAK,EAAG,CAAC,CAAC,CAAE,QAC1C,KAAA,KAAO,IAAIkB,EAAM,IAAIlB,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,CAAE,QAC3C,KAAA,UAAY,IAAIkB,EAAM,IAAIlB,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,CAAE,QAClD,KAAA,YAAc,IAAIkB,EAAM,IAAIlB,EAAK,EAAG,EAAG,EAAG,CAAC,CAAC,CAAE,EA5K/DpI,EAAA,MAAAsJ,EA+KA,SAAiBA,EAAK,CACrB,IAAiBc,GAAjB,SAAiBA,EAAM,CACtB,IAAiBC,GAAjB,SAAiBA,EAAG,CAEnB,SAAgBC,EAAUV,EAAY,CACrC,OAAIA,EAAM,KAAK,IAAM,EACb,OAAOA,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,IAGtDN,EAAM,OAAO,IAAI,WAAWM,CAAK,CACzC,CANgBS,EAAA,UAASC,EAQzB,SAAgBC,EAAWX,EAAY,CACtC,MAAO,QAAQA,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,KAAK,CAAEA,EAAM,KAAK,EAAG,QAAQ,CAAC,CAAC,GAC7F,CAFgBS,EAAA,WAAUE,EAI1B,SAAgBC,EAAUZ,EAAY,CACrC,OAAIA,EAAM,KAAK,IAAM,EACb,OAAOA,EAAM,KAAK,CAAC,MAAMA,EAAM,KAAK,EAAI,KAAK,QAAQ,CAAC,CAAC,OAAOA,EAAM,KAAK,EAAI,KAAK,QAAQ,CAAC,CAAC,KAG7FN,EAAM,OAAO,IAAI,WAAWM,CAAK,CACzC,CANgBS,EAAA,UAASG,EAQzB,SAAgBC,EAAWb,EAAY,CACtC,MAAO,QAAQA,EAAM,KAAK,CAAC,MAAMA,EAAM,KAAK,EAAI,KAAK,QAAQ,CAAC,CAAC,OAAOA,EAAM,KAAK,EAAI,KAAK,QAAQ,CAAC,CAAC,MAAMA,EAAM,KAAK,EAAE,QAAQ,CAAC,CAAC,GAClI,CAFgBS,EAAA,WAAUI,EAI1B,SAASC,EAAe5I,EAAS,CAChC,MAAM7H,EAAI6H,EAAE,SAAS,EAAE,EACvB,OAAO7H,EAAE,SAAW,EAAI,IAAMA,EAAIA,CACnC,CAKA,SAAgB0Q,EAAUf,EAAY,CACrC,MAAO,IAAIc,EAAed,EAAM,KAAK,CAAC,CAAC,GAAGc,EAAed,EAAM,KAAK,CAAC,CAAC,GAAGc,EAAed,EAAM,KAAK,CAAC,CAAC,EACtG,CAFgBS,EAAA,UAASM,EAQzB,SAAgBC,EAAWhB,EAAciB,EAAU,GAAK,CACvD,OAAIA,GAAWjB,EAAM,KAAK,IAAM,EACxBN,EAAM,OAAO,IAAI,UAAUM,CAAK,EAGjC,IAAIc,EAAed,EAAM,KAAK,CAAC,CAAC,GAAGc,EAAed,EAAM,KAAK,CAAC,CAAC,GAAGc,EAAed,EAAM,KAAK,CAAC,CAAC,GAAGc,EAAe,KAAK,MAAMd,EAAM,KAAK,EAAI,GAAG,CAAC,CAAC,EACvJ,CANgBS,EAAA,WAAUO,EAW1B,SAAgBE,EAAOlB,EAAY,CAClC,OAAIA,EAAM,SAAQ,EACVN,EAAM,OAAO,IAAI,UAAUM,CAAK,EAGjCN,EAAM,OAAO,IAAI,WAAWM,CAAK,CACzC,CANgBS,EAAA,OAAMS,EAatB,SAAgBC,EAASxB,EAAW,CACnC,MAAMjH,EAASiH,EAAI,OAOnB,GALIjH,IAAW,GAKXiH,EAAI,WAAW,CAAC,IAAC,GAEpB,OAAO,KAGR,GAAIjH,IAAW,EAAG,CAEjB,MAAMrI,EAAI,GAAK+Q,EAAezB,EAAI,WAAW,CAAC,CAAC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EAC7E,EAAI,GAAKyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EAC7ExU,EAAI,GAAKiW,EAAezB,EAAI,WAAW,CAAC,CAAC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EACnF,OAAO,IAAID,EAAM,IAAIlB,EAAKnO,EAAG,EAAGlF,EAAG,CAAC,CAAC,CACtC,CAEA,GAAIuN,IAAW,EAAG,CAEjB,MAAMrI,EAAI,GAAK+Q,EAAezB,EAAI,WAAW,CAAC,CAAC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EAC7E,EAAI,GAAKyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EAC7ExU,EAAI,GAAKiW,EAAezB,EAAI,WAAW,CAAC,CAAC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EAC7EzU,EAAI,GAAKkW,EAAezB,EAAI,WAAW,CAAC,CAAC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EACnF,OAAO,IAAID,EAAM,IAAIlB,EAAKnO,EAAG,EAAGlF,EAAGD,EAAI,GAAG,CAAC,CAC5C,CAEA,GAAIwN,IAAW,EAAG,CAEjB,MAAMrI,EAAI+Q,EAAezB,EAAI,WAAW,CAAC,CAAC,EACpC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EACpCxU,EAAIiW,EAAezB,EAAI,WAAW,CAAC,CAAC,EAC1C,OAAO,IAAID,EAAM,IAAIlB,EAAK,GAAKnO,EAAIA,EAAG,GAAK,EAAI,EAAG,GAAKlF,EAAIA,CAAC,CAAC,CAC9D,CAEA,GAAIuN,IAAW,EAAG,CAEjB,MAAMrI,EAAI+Q,EAAezB,EAAI,WAAW,CAAC,CAAC,EACpC,EAAIyB,EAAezB,EAAI,WAAW,CAAC,CAAC,EACpCxU,EAAIiW,EAAezB,EAAI,WAAW,CAAC,CAAC,EACpCzU,EAAIkW,EAAezB,EAAI,WAAW,CAAC,CAAC,EAC1C,OAAO,IAAID,EAAM,IAAIlB,EAAK,GAAKnO,EAAIA,EAAG,GAAK,EAAI,EAAG,GAAKlF,EAAIA,GAAI,GAAKD,EAAIA,GAAK,GAAG,CAAC,CAClF,CAGA,OAAO,IACR,CAjDgBuV,EAAA,SAAQU,EAmDxB,SAASC,EAAeC,EAAkB,CACzC,OAAQA,EAAU,CACjB,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAsB,MAAO,GAC7B,IAAA,IAAiB,MAAO,IACxB,IAAA,IAAiB,MAAO,IACxB,IAAA,IAAiB,MAAO,IACxB,IAAA,IAAiB,MAAO,IACxB,IAAA,IAAiB,MAAO,IACxB,IAAA,IAAiB,MAAO,IACxB,IAAA,KAAiB,MAAO,IACxB,IAAA,IAAiB,MAAO,IACxB,IAAA,KAAiB,MAAO,IACxB,IAAA,IAAiB,MAAO,IACxB,IAAA,KAAiB,MAAO,IACxB,IAAA,IAAiB,MAAO,GACzB,CACA,MAAO,EACR,CACD,GAhJiBZ,EAAAD,EAAA,MAAAA,EAAA,IAAG,CAAA,EAAA,CAiJrB,GAlJiBA,EAAAd,EAAA,SAAAA,EAAA,OAAM,CAAA,EAAA,CAmJxB,EApJiBA,IAAKtJ,EAAA,MAALsJ,EAAK,CAAA,EAAA,qHCtatB,MAAa4B,CAAU,CA8BtB,YAAYC,EAAuB5G,EAAwB6G,EAAuBC,EAAsB,CAEvG,KAAK,cAAgBF,EACrB,KAAK,eAAiB5G,EACtB,KAAK,cAAgB6G,EACrB,KAAK,eAAiBC,CACvB,CAKO,gBAAc,CACpB,OAAO,KAAK,cAAgB,KAAK,cAClC,CAKO,gBAAc,CACpB,OAAO,KAAK,cAAgB,KAAK,cAClC,EAlDDrL,EAAA,WAAAkL,qNC4CAlL,EAAA,kBAAAsL,EAQAtL,EAAA,0BAAAuL,EAaAvL,EAAA,+BAAAwL,EAsBAxL,EAAA,oBAAAyL,EAmBAzL,EAAA,SAAA0L,EAMA1L,EAAA,gBAAA2L,EAQA3L,EAAA,aAAA4L,EAtHA,MAAaC,CAAY,CAIxB,aAAA,CAEC,KAAK,UAAY,CAAA,EAEjB,KAAK,uBAAyB,SAAUzV,EAAM,CAC7C,WAAW,IAAK,CACf,MAAIA,EAAE,MACD0V,EAAiB,mBAAmB1V,CAAC,EAClC,IAAI0V,EAAiB1V,EAAE,QAAU;;EAASA,EAAE,KAAK,EAGlD,IAAI,MAAMA,EAAE,QAAU;;EAASA,EAAE,KAAK,EAGvCA,CACP,EAAG,CAAC,CACL,CACD,CAEQ,KAAKA,EAAM,CAClB,KAAK,UAAU,QAAS2V,GAAY,CACnCA,EAAS3V,CAAC,CACX,CAAC,CACF,CAEA,kBAAkBA,EAAM,CACvB,KAAK,uBAAuBA,CAAC,EAC7B,KAAK,KAAKA,CAAC,CACZ,CAGA,0BAA0BA,EAAM,CAC/B,KAAK,uBAAuBA,CAAC,CAC9B,EArCD4J,EAAA,aAAA6L,EAwCa7L,EAAA,aAAe,IAAI6L,EAEhC,SAAgBP,EAAkBlV,EAAM,CAElCqV,EAAoBrV,CAAC,GACzB4J,EAAA,aAAa,kBAAkB5J,CAAC,CAGlC,CAEA,SAAgBmV,EAA0BnV,EAAM,CAE1CqV,EAAoBrV,CAAC,GACzB4J,EAAA,aAAa,0BAA0B5J,CAAC,CAG1C,CAOA,SAAgBoV,EAA+B5O,EAAU,CACxD,GAAIA,aAAiB,MAAO,CAC3B,KAAM,CAAE,KAAAoP,EAAM,QAAAjM,CAAO,EAAKnD,EACpB1B,EAAsB0B,EAAO,YAAoBA,EAAO,MAC9D,MAAO,CACN,SAAU,GACV,KAAAoP,EACA,QAAAjM,EACA,MAAA7E,EACA,YAAa4Q,EAAiB,mBAAmBlP,CAAK,EAExD,CAGA,OAAOA,CACR,CAEA,MAAMqP,EAAe,WAKrB,SAAgBR,EAAoB7O,EAAU,CAC7C,OAAIA,aAAiBsP,EACb,GAEDtP,aAAiB,OAASA,EAAM,OAASqP,GAAgBrP,EAAM,UAAYqP,CACnF,CAIA,MAAaC,UAA0B,KAAK,CAC3C,aAAA,CACC,MAAMD,CAAY,EAClB,KAAK,KAAO,KAAK,OAClB,EAJDjM,EAAA,kBAAAkM,EAUA,SAAgBR,GAAQ,CACvB,MAAM9O,EAAQ,IAAI,MAAMqP,CAAY,EACpC,OAAArP,EAAM,KAAOA,EAAM,QACZA,CACR,CAEA,SAAgB+O,EAAgBK,EAAa,CAC5C,OAAIA,EACI,IAAI,MAAM,qBAAqBA,CAAI,EAAE,EAErC,IAAI,MAAM,kBAAkB,CAErC,CAEA,SAAgBJ,EAAaI,EAAa,CACzC,OAAIA,EACI,IAAI,MAAM,kBAAkBA,CAAI,EAAE,EAElC,IAAI,MAAM,eAAe,CAElC,CAEA,MAAaG,UAA0B,KAAK,CAC3C,YAAYpM,EAAgB,CAC3B,MAAM,cAAc,EAChBA,IACH,KAAK,QAAUA,EAEjB,EANDC,EAAA,kBAAAmM,EAYA,MAAaL,UAAyB,KAAK,CAG1C,YAAYnM,EAAY,CACvB,MAAMA,CAAG,EACT,KAAK,KAAO,mBACb,CAEO,OAAO,UAAU5L,EAAU,CACjC,GAAIA,aAAe+X,EAClB,OAAO/X,EAGR,MAAM1B,EAAS,IAAIyZ,EACnB,OAAAzZ,EAAO,QAAU0B,EAAI,QACrB1B,EAAO,MAAQ0B,EAAI,MACZ1B,CACR,CAEO,OAAO,mBAAmB0B,EAAU,CAC1C,OAAOA,EAAI,OAAS,mBACrB,EArBDiM,EAAA,iBAAA8L,EA6BA,MAAaM,UAA2B,KAAK,CAC5C,YAAYrM,EAAgB,CAC3B,MAAMA,GAAW,6BAA6B,EAC9C,OAAO,eAAe,KAAMqM,EAAmB,SAAS,CAMzD,EATDpM,EAAA,mBAAAoM,qGC5JApM,EAAA,GAAAqM,EAMArM,EAAA,YAAAsM,EAOAtM,EAAA,WAAAuM,EASAvM,EAAA,SAAAwM,EAUAxM,EAAA,mBAAAyM,EAhCA,SAAgBJ,EAAGzY,EAAiBmM,EAAgB,CACnD,GAAI,CAACnM,EACJ,MAAM,IAAI,MAAMmM,EAAU,qBAAqBA,CAAO,IAAM,kBAAkB,CAEhF,CAEA,SAAgBuM,EAAY1Y,EAAcmM,EAAU,cAAa,CAChE,MAAM,IAAI,MAAMA,CAAO,CACxB,CAKA,SAAgBwM,EAAWG,EAAkB,CACvCA,MACJC,EAAA,mBAAkB,IAAIA,EAAA,mBAAmB,uBAAuB,CAAC,CAEnE,CAKA,SAAgBH,EAASE,EAAwB,CAChD,GAAI,CAACA,EAAS,EAAI,CAEjB,SAEAA,EAAS,KACTC,EAAA,mBAAkB,IAAIA,EAAA,mBAAmB,kBAAkB,CAAC,CAC7D,CACD,CAEA,SAAgBF,EAAsBpJ,EAAqBiC,EAA0C,CACpG,IAAI3Q,EAAI,EACR,KAAOA,EAAI0O,EAAM,OAAS,GAAG,CAC5B,MAAMvO,EAAIuO,EAAM1O,CAAC,EACXI,EAAIsO,EAAM1O,EAAI,CAAC,EACrB,GAAI,CAAC2Q,EAAUxQ,EAAGC,CAAC,EAClB,MAAO,GAERJ,GACD,CACA,MAAO,EACR,iGCxDAqL,EAAA,yBAAA4M,EAAA,SAAgBA,EAA4DC,EAAOC,EAA6B,CAC/G,MAAMC,EAAQ,KACd,IAAIC,EAAU,GACV3a,EAEJ,OAAO,UAAA,CACN,GAAI2a,EACH,OAAO3a,EAIR,GADA2a,EAAU,GACNF,EACH,GAAI,CACHza,EAASwa,EAAG,MAAME,EAAO,SAAS,CACnC,SACCD,EAAgB,CACjB,MAEAza,EAASwa,EAAG,MAAME,EAAO,SAAS,EAGnC,OAAO1a,CACR,CACD,mHC1BA,IAAiB4a,GAAjB,SAAiBA,EAAQ,CAExB,SAAgBC,EAAYC,EAAU,CACrC,OAAOA,GAAS,OAAOA,GAAU,UAAY,OAAOA,EAAM,OAAO,QAAQ,GAAM,UAChF,CAFgBF,EAAA,GAAEC,EAIlB,MAAME,EAAwB,OAAO,OAAO,CAAA,CAAE,EAC9C,SAAgBC,GAAK,CACpB,OAAOD,CACR,CAFgBH,EAAA,MAAKI,EAIrB,SAAiBC,EAAUlK,EAAU,CACpC,MAAMA,CACP,CAFiB6J,EAAA,OAAMK,EAIvB,SAAgBC,EAAQC,EAAkC,CACzD,OAAIN,EAAGM,CAAiB,EAChBA,EAEAF,EAAOE,CAAiB,CAEjC,CANgBP,EAAA,KAAIM,EAQpB,SAAgB3Y,EAAQ6Y,EAAwC,CAC/D,OAAOA,GAAYL,CACpB,CAFgBH,EAAA,KAAIrY,EAIpB,SAAiB8Y,EAAW7L,EAAe,CAC1C,QAASlN,EAAIkN,EAAM,OAAS,EAAGlN,GAAK,EAAGA,IACtC,MAAMkN,EAAMlN,CAAC,CAEf,CAJiBsY,EAAA,QAAOS,EAMxB,SAAgB/Z,EAAW8Z,EAAwC,CAClE,MAAO,CAACA,GAAYA,EAAS,OAAO,QAAQ,EAAC,EAAG,KAAI,EAAG,OAAS,EACjE,CAFgBR,EAAA,QAAOtZ,EAIvB,SAAgBmS,EAAS2H,EAAqB,CAC7C,OAAOA,EAAS,OAAO,QAAQ,EAAC,EAAG,KAAI,EAAG,KAC3C,CAFgBR,EAAA,MAAKnH,EAIrB,SAAgB6H,EAAQF,EAAuBnI,EAAuC,CACrF,IAAI3Q,EAAI,EACR,UAAWyO,KAAWqK,EACrB,GAAInI,EAAUlC,EAASzO,GAAG,EACzB,MAAO,GAGT,MAAO,EACR,CARgBsY,EAAA,KAAIU,EAYpB,SAAgBC,EAAQH,EAAuBnI,EAA4B,CAC1E,UAAWlC,KAAWqK,EACrB,GAAInI,EAAUlC,CAAO,EACpB,OAAOA,CAKV,CARgB6J,EAAA,KAAIW,EAYpB,SAAiBC,EAAUJ,EAAuBnI,EAA4B,CAC7E,UAAWlC,KAAWqK,EACjBnI,EAAUlC,CAAO,IACpB,MAAMA,EAGT,CANiB6J,EAAA,OAAMY,EAQvB,SAAiBC,EAAUL,EAAuBZ,EAA8B,CAC/E,IAAI1K,EAAQ,EACZ,UAAWiB,KAAWqK,EACrB,MAAMZ,EAAGzJ,EAASjB,GAAO,CAE3B,CALiB8K,EAAA,IAAGa,EAOpB,SAAiBC,EAAcN,EAAuBZ,EAAwC,CAC7F,IAAI1K,EAAQ,EACZ,UAAWiB,KAAWqK,EACrB,MAAOZ,EAAGzJ,EAASjB,GAAO,CAE5B,CALiB8K,EAAA,QAAOc,EAOxB,SAAiBC,KAAaC,EAAwB,CACrD,UAAWR,KAAYQ,EACtB,MAAOR,CAET,CAJiBR,EAAA,OAAMe,EAMvB,SAAgBE,EAAaT,EAAuBU,EAAmDC,EAAe,CACrH,IAAIxa,EAAQwa,EACZ,UAAWhL,KAAWqK,EACrB7Z,EAAQua,EAAQva,EAAOwP,CAAO,EAE/B,OAAOxP,CACR,CANgBqZ,EAAA,OAAMiB,EAWtB,SAAiBG,EAAStM,EAAuBnN,EAAcC,EAAKkN,EAAI,OAAM,CAW7E,IAVInN,EAAO,IACVA,GAAQmN,EAAI,QAGTlN,EAAK,EACRA,GAAMkN,EAAI,OACAlN,EAAKkN,EAAI,SACnBlN,EAAKkN,EAAI,QAGHnN,EAAOC,EAAID,IACjB,MAAMmN,EAAInN,CAAI,CAEhB,CAdiBqY,EAAA,MAAKoB,EAoBtB,SAAgBC,EAAWb,EAAuBc,EAAiB,OAAO,kBAAiB,CAC1F,MAAMC,EAAgB,CAAA,EAEtB,GAAID,IAAW,EACd,MAAO,CAACC,EAAUf,CAAQ,EAG3B,MAAMgB,EAAWhB,EAAS,OAAO,QAAQ,EAAC,EAE1C,QAAS9Y,EAAI,EAAGA,EAAI4Z,EAAQ5Z,IAAK,CAChC,MAAM+Z,EAAOD,EAAS,KAAI,EAE1B,GAAIC,EAAK,KACR,MAAO,CAACF,EAAUvB,EAAS,MAAK,CAAE,EAGnCuB,EAAS,KAAKE,EAAK,KAAK,CACzB,CAEA,MAAO,CAACF,EAAU,CAAE,CAAC,OAAO,QAAQ,GAAC,CAAK,OAAOC,CAAU,CAAC,CAAE,CAC/D,CApBgBxB,EAAA,QAAOqB,EAsBhB,eAAeK,EAAgBlB,EAA0B,CAC/D,MAAMpb,EAAc,CAAA,EACpB,gBAAiBkR,KAAQkK,EACxBpb,EAAO,KAAKkR,CAAI,EAEjB,OAAO,QAAQ,QAAQlR,CAAM,CAC9B,CANsB4a,EAAA,aAAY0B,CAOnC,GAzJiB1B,IAAQjN,EAAA,SAARiN,EAAQ,CAAA,EAAA,4OC+yBzBjN,EAAA,SAAA4O,EAvYA,MAAMC,CAAa,CAKlB,aAAA,CACC,KAAK,cAAgB,CAAA,EACrB,KAAK,cAAgB,OAAO,OAAO,IAAI,CACxC,CAEA,OAAOC,EAAkB1T,EAAW,CACnC,KAAK,cAAc0T,CAAO,EAAI1T,EAC9B,KAAK,cAAcA,EAAI,YAAW,CAAE,EAAI0T,CACzC,CAEA,aAAaA,EAAgB,CAC5B,OAAO,KAAK,cAAcA,CAAO,CAClC,CAEA,aAAa1T,EAAW,CACvB,OAAO,KAAK,cAAcA,EAAI,YAAW,CAAE,GAAC,CAC7C,EAGD,MAAM2T,EAAQ,IAAIF,EACZG,EAAoB,IAAIH,EACxBI,EAAyB,IAAIJ,EACtB7O,EAAA,mBAAqD,IAAI,MAAM,GAAG,EAClEA,EAAA,oCAA4E,CAAA,EACzF,MAAMkP,EAA6B,CAAA,EAC7BC,EAA+C,OAAO,OAAO,IAAI,EACjEC,EAAwD,OAAO,OAAO,IAAI,EAKnEpP,EAAA,2BAAwC,CAAA,EAKxCA,EAAA,2BAAyC,CAAA,EAEtD,QAASrL,EAAI,EAAGA,GAAC,IAAwBA,IACxCqL,EAAA,2BAA2BrL,CAAC,EAAC,GAG9B,QAASA,EAAI,EAAGA,GAAC,IAAuBA,IACvCqL,EAAA,2BAA2BrL,CAAC,EAAC,IAG7B,UAAA,CAKA,MAAM0Y,EAAQ,GAERgC,EAA4B,CAEjC,CAAC,EAAC,EAAiB,OAAM,EAAmB,UAAW,EAAG,aAAchC,EAAOA,CAAK,EACpF,CAAC,EAAC,EAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,EAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,EAAe,KAAI,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACrE,CAAC,EAAC,EAAmB,SAAQ,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAoB,UAAS,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC/E,CAAC,EAAC,EAAmB,SAAQ,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,EAAkB,QAAO,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAChF,CAAC,EAAC,EAAmB,SAAQ,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC7E,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAiB,OAAM,GAAgB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,GAAI,OAAQA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAkB,QAAO,EAAiB,QAAS,GAAI,YAAaA,EAAOA,CAAK,EAClF,CAAC,EAAC,GAAmB,SAAQ,EAAkB,SAAU,GAAI,YAAaA,EAAOA,CAAK,EACtF,CAAC,EAAC,GAAsB,YAAW,EAAqB,YAAa,EAAG,UAAWA,EAAOA,CAAK,EAC/F,CAAC,EAAC,GAAgB,MAAK,EAAe,MAAO,EAAG,SAAUA,EAAOA,CAAK,EACtE,CAAC,EAAC,GAAkB,QAAO,GAAiB,QAAS,GAAI,WAAYA,EAAOA,CAAK,EACjF,CAAC,EAAC,GAAkB,QAAO,GAAiB,IAAK,IAAK,eAAgB,IAAK,WAAW,EACtF,CAAC,EAAC,GAAkB,QAAO,GAAiB,IAAK,IAAK,cAAe,IAAK,UAAU,EACpF,CAAC,EAAC,GAAwB,cAAa,GAAuB,IAAK,IAAK,WAAY,IAAK,OAAO,EAChG,CAAC,EAAC,GAAyB,eAAc,GAAwB,IAAK,IAAK,WAAY,IAAK,OAAO,EACnG,CAAC,EAAC,GAAsB,YAAW,GAAqB,KAAM,IAAK,WAAY,KAAM,OAAO,EAC5F,CAAC,EAAC,GAAqB,WAAU,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACjF,CAAC,EAAC,GAAsB,YAAW,GAAqB,IAAK,IAAK,WAAY,IAAK,OAAO,EAC1F,CAAC,EAAC,GAAkB,QAAO,GAAiB,IAAM,IAAK,WAAY,IAAM,OAAO,EAChF,CAAC,EAAC,GAAsB,YAAW,GAAqB,IAAK,IAAK,WAAY,IAAK,OAAO,EAC1F,CAAC,EAAC,GAAkB,QAAO,GAAiB,IAAK,IAAK,eAAgB,IAAK,WAAW,EACtF,CAAC,EAAC,GAAmB,SAAQ,GAAkB,IAAK,IAAK,gBAAiB,IAAK,YAAY,EAC3F,CAAC,EAAC,GAAkB,QAAO,GAAiB,IAAK,IAAK,WAAY,IAAK,OAAO,EAC9E,CAAC,EAAC,GAAqB,WAAU,EAAoB,WAAY,GAAI,aAAcA,EAAOA,CAAK,EAC/F,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAe,KAAI,GAAc,KAAM,IAAK,QAASA,EAAOA,CAAK,EACnE,CAAC,EAAC,GAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,GAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,GAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,GAAwB,cAAa,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACvF,CAAC,EAAC,GAAuB,aAAY,GAAsB,aAAc,IAAK,YAAaA,EAAOA,CAAK,EACvG,CAAC,EAAC,GAAkB,QAAO,EAAsB,aAAc,GAAI,WAAYA,EAAOA,CAAK,EAC3F,CAAC,EAAC,GAAmB,SAAQ,GAAkB,SAAU,GAAI,YAAaA,EAAOA,CAAK,EACtF,CAAC,EAAC,GAAiB,OAAM,GAAgB,OAAQ,GAAI,UAAWA,EAAOA,CAAK,EAC5E,CAAC,EAAC,GAAmB,SAAQ,GAAkB,SAAU,GAAI,WAAYA,EAAOA,CAAK,EACrF,CAAC,EAAC,GAAmB,SAAQ,GAAkB,SAAU,GAAI,YAAaA,EAAOA,CAAK,EACtF,CAAC,EAAC,GAAgB,MAAK,GAAe,MAAO,GAAI,SAAUA,EAAOA,CAAK,EACvE,CAAC,EAAC,GAAqB,WAAU,GAAoB,WAAY,GAAI,UAAWA,EAAOA,CAAK,EAC5F,CAAC,EAAC,GAAuB,aAAY,GAAsB,aAAc,GAAI,WAAY,QAASA,CAAK,EACvG,CAAC,EAAC,GAAsB,YAAW,GAAqB,YAAa,GAAI,UAAW,OAAQA,CAAK,EACjG,CAAC,EAAC,GAAsB,YAAW,GAAqB,YAAa,GAAI,UAAW,OAAQA,CAAK,EACjG,CAAC,EAAC,GAAoB,UAAS,GAAmB,UAAW,GAAI,QAAS,KAAMA,CAAK,EACrF,CAAC,EAAC,GAAoB,UAAS,GAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC5F,CAAC,EAAC,GAAyB,eAAc,IAAwB,gBAAiB,IAAK,YAAaA,EAAOA,CAAK,EAChH,CAAC,EAAC,GAA2B,iBAAgB,IAA0B,kBAAmB,IAAK,cAAeA,EAAOA,CAAK,EAC1H,CAAC,EAAC,GAA2B,iBAAgB,IAA0B,kBAAmB,IAAK,cAAeA,EAAOA,CAAK,EAC1H,CAAC,EAAC,GAAsB,YAAW,IAAqB,aAAc,IAAK,SAAUA,EAAOA,CAAK,EACjG,CAAC,EAAC,GAAwB,cAAa,EAAiBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACrF,CAAC,EAAC,GAAoB,UAAS,GAAmB,UAAW,GAAI,aAAcA,EAAOA,CAAK,EAC3F,CAAC,EAAC,GAAoB,UAAS,IAAmB,UAAW,GAAI,aAAcA,EAAOA,CAAK,EAC3F,CAAC,EAAC,GAAoB,UAAS,IAAmB,UAAW,GAAI,aAAcA,EAAOA,CAAK,EAC3F,CAAC,EAAC,GAAoB,UAAS,IAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC5F,CAAC,EAAC,GAAoB,UAAS,IAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC5F,CAAC,EAAC,IAAoB,UAAS,IAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC5F,CAAC,EAAC,IAAoB,UAAS,IAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC5F,CAAC,EAAC,IAAoB,UAAS,IAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC5F,CAAC,EAAC,IAAoB,UAAS,IAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC5F,CAAC,EAAC,IAAoB,UAAS,GAAmB,UAAW,GAAI,aAAcA,EAAOA,CAAK,EAC3F,CAAC,EAAC,IAA0B,gBAAe,IAAyB,iBAAkB,IAAK,aAAcA,EAAOA,CAAK,EACrH,CAAC,EAAC,IAA0B,gBAAe,GAAyB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC9G,CAAC,EAAC,IAAwB,cAAa,GAAuB,cAAe,GAAIA,EAAOA,EAAOA,CAAK,EACpG,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAwB,cAAa,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACvF,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAgB,MAAK,GAAe,MAAO,IAAK,SAAUA,EAAOA,CAAK,EACxE,CAAC,EAAC,IAAiB,OAAM,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACzE,CAAC,EAAC,IAAiB,OAAM,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACzE,CAAC,EAAC,IAAmB,SAAQ,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC7E,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAiB,OAAM,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACzE,CAAC,EAAC,IAAgB,MAAK,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACvE,CAAC,EAAC,IAAiB,OAAM,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACzE,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAiB,OAAM,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACzE,CAAC,EAAC,IAA4B,kBAAiB,IAA2B,kBAAmB,IAAK,iBAAkBA,EAAOA,CAAK,EAChI,CAAC,EAAC,IAA0B,gBAAe,IAAyB,gBAAiB,IAAK,eAAgBA,EAAOA,CAAK,EACtH,CAAC,EAAC,IAA4B,kBAAiB,IAA2B,kBAAmB,IAAK,iBAAkBA,EAAOA,CAAK,EAChI,CAAC,EAAC,IAAwB,cAAa,IAA4B,mBAAoB,IAAK,eAAgBA,EAAOA,CAAK,EACxH,CAAC,EAAC,IAAmB,SAAQ,IAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EAC1F,CAAC,EAAC,IAAqB,WAAU,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACjF,CAAC,EAAC,IAAoB,UAAS,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC/E,CAAC,EAAC,IAAoB,UAAS,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC/E,CAAC,EAAC,IAAuB,aAAY,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACrF,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAA4B,kBAAiB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC/F,CAAC,EAAC,IAA6B,mBAAkB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACjG,CAAC,EAAC,IAA4B,kBAAiB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC/F,CAAC,EAAC,IAA8B,oBAAmB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACnG,CAAC,EAAC,IAA+B,qBAAoB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACrG,CAAC,EAAC,IAA8B,oBAAmB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACnG,CAAC,EAAC,IAA4B,kBAAiB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC/F,CAAC,EAAC,IAAiC,uBAAsB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACzG,CAAC,EAAC,IAAwB,cAAa,IAAiB,QAAS,GAAI,WAAYA,EAAOA,CAAK,EAC7F,CAAC,EAAC,IAA6B,mBAAkB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACjG,CAAC,EAAC,EAAiBA,EAAK,EAAgB,OAAQ,GAAI,aAAcA,EAAOA,CAAK,EAC9E,CAAC,EAAC,EAAiBA,EAAK,EAAiB,QAAS,GAAI,WAAYA,EAAOA,CAAK,EAC9E,CAAC,EAAC,EAAiBA,EAAK,EAAe,MAAO,GAAI,UAAWA,EAAOA,CAAK,EACzE,CAAC,EAAC,EAAiBA,EAAK,GAAgB,OAAQ,GAAI,aAAcA,EAAOA,CAAK,EAC9E,CAAC,EAAC,IAAwB,cAAa,EAAgBA,EAAO,EAAG,cAAeA,EAAOA,CAAK,EAC5F,CAAC,EAAC,IAAsB,YAAW,EAAiBA,EAAO,EAAG,YAAaA,EAAOA,CAAK,EACvF,CAAC,EAAC,IAAoB,UAAS,EAAeA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAChF,CAAC,EAAC,IAAqB,WAAU,GAAgBA,EAAO,EAAG,UAAWA,EAAOA,CAAK,EAClF,CAAC,EAAC,IAAyB,eAAc,EAAgBA,EAAO,EAAG,cAAeA,EAAOA,CAAK,EAC9F,CAAC,EAAC,IAAuB,aAAY,EAAiBA,EAAO,EAAG,YAAaA,EAAOA,CAAK,EACzF,CAAC,EAAC,IAAqB,WAAU,EAAeA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAClF,CAAC,EAAC,IAAsB,YAAW,GAAgBA,EAAO,EAAG,UAAWA,EAAOA,CAAK,EACpF,CAAC,EAAC,IAAyB,eAAc,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACzF,CAAC,EAAC,IAA2B,iBAAgB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC7F,CAAC,EAAC,IAAsB,YAAW,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACnF,CAAC,EAAC,IAAwB,cAAa,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACvF,CAAC,EAAC,IAA6B,mBAAkB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACjG,CAAC,EAAC,IAAwB,cAAa,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACvF,CAAC,EAAC,IAA2B,iBAAgB,IAA0B,iBAAkB,IAAK,sBAAuBA,EAAOA,CAAK,EACjI,CAAC,EAAC,IAA+B,qBAAoB,IAA8B,qBAAsB,IAAK,sBAAuBA,EAAOA,CAAK,EACjJ,CAAC,EAAC,IAAsB,YAAW,IAAqB,YAAa,IAAK,gBAAiBA,EAAOA,CAAK,EACvG,CAAC,EAAC,IAAkB,QAAO,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAC3E,CAAC,EAAC,IAA2B,iBAAgB,IAA0B,iBAAkB,IAAK,sBAAuBA,EAAOA,CAAK,EACjI,CAAC,EAAC,IAAwB,cAAa,IAA6B,oBAAqB,IAAK,+BAAgCA,EAAOA,CAAK,EAC1I,CAAC,EAAC,IAAuB,aAAY,IAAsB,aAAc,IAAK,uBAAwBA,EAAOA,CAAK,EAClH,CAAC,EAAC,IAAuB,aAAY,IAAsB,aAAc,IAAK,uBAAwBA,EAAOA,CAAK,EAClH,CAAC,EAAC,IAAuB,aAAY,EAAmBA,EAAO,EAAG,uBAAwBA,EAAOA,CAAK,EACtG,CAAC,EAAC,IAAuB,aAAY,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACrF,CAAC,EAAC,IAA8B,oBAAmB,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACnG,CAAC,EAAC,IAA0B,gBAAe,IAAyB,gBAAiB,IAAK,oBAAqBA,EAAOA,CAAK,EAC3H,CAAC,EAAC,IAAwB,cAAa,IAAuB,cAAe,IAAK,kBAAmBA,EAAOA,CAAK,EACjH,CAAC,EAAC,IAAwB,cAAa,IAAuB,cAAe,IAAK,kBAAmBA,EAAOA,CAAK,EACjH,CAAC,EAAC,IAA2B,iBAAgB,IAA0B,iBAAkB,IAAK,qBAAsBA,EAAOA,CAAK,EAChI,CAAC,EAAC,IAAwB,cAAa,EAAmBA,EAAO,EAAG,kBAAmBA,EAAOA,CAAK,EACnG,CAAC,EAAC,IAA2B,iBAAgB,EAAmBA,EAAO,EAAG,qBAAsBA,EAAOA,CAAK,EAC5G,CAAC,EAAC,IAA6B,mBAAkB,EAAmBA,EAAO,EAAG,uBAAwBA,EAAOA,CAAK,EAClH,CAAC,EAAC,IAAuB,aAAY,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACrF,CAAC,EAAC,IAAsB,YAAW,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACnF,CAAC,EAAC,IAAwB,cAAa,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EACvF,CAAC,EAAC,IAAqB,WAAU,EAAmBA,EAAO,EAAGA,EAAOA,EAAOA,CAAK,EAIjF,CAAC,EAAC,EAAiBA,EAAK,IAA8B,mBAAoB,IAAKA,EAAOA,EAAOA,CAAK,EAClG,CAAC,EAAC,EAAiBA,EAAK,IAAmB,UAAW,IAAK,aAAcA,EAAOA,CAAK,EACrF,CAAC,EAAC,EAAiBA,EAAK,GAAiB,QAAS,IAAK,WAAYA,EAAOA,CAAK,EAC/E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,UAAWA,EAAOA,CAAK,EAC5E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,YAAaA,EAAOA,CAAK,EAC9E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,aAAcA,EAAOA,CAAK,EAC/E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,gBAAiBA,EAAOA,CAAK,EAClF,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,YAAaA,EAAOA,CAAK,EAC9E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,gBAAiBA,EAAOA,CAAK,EAClF,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,YAAaA,EAAOA,CAAK,EAC9E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,aAAcA,EAAOA,CAAK,EAC/E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,cAAeA,EAAOA,CAAK,EAChF,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,UAAWA,EAAOA,CAAK,EAC5E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,UAAWA,EAAOA,CAAK,EAC5E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,gBAAiBA,EAAOA,CAAK,EAClF,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,YAAaA,EAAOA,CAAK,EAC9E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,kBAAmBA,EAAOA,CAAK,EACpF,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,kBAAmBA,EAAOA,CAAK,EACpF,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,UAAWA,EAAOA,CAAK,EAC5E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,WAAYA,EAAOA,CAAK,EAC7E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,UAAWA,EAAOA,CAAK,EAC5E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,UAAWA,EAAOA,CAAK,EAC5E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,YAAaA,EAAOA,CAAK,EAC9E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,SAAUA,EAAOA,CAAK,EAC3E,CAAC,EAAC,EAAiBA,EAAK,EAAmBA,EAAO,EAAG,eAAgBA,EAAOA,CAAK,GAG5EiC,EAAyB,CAAA,EACzBC,EAA0B,CAAA,EAChC,UAAWC,KAAWH,EAAU,CAC/B,KAAM,CAACI,EAAWC,EAAUC,EAAab,EAASc,EAAYC,EAAcC,EAAMC,EAAqBC,CAAwB,EAAIR,EAoBnI,GAnBKD,EAAaG,CAAQ,IACzBH,EAAaG,CAAQ,EAAI,GACzBR,EAAiBQ,CAAQ,EAAIC,EAC7BR,EAAiBQ,CAAW,EAAID,EAChCN,EAA0BO,EAAY,YAAW,CAAE,EAAID,EACnDD,IACHzP,EAAA,2BAA2B0P,CAAQ,EAAIZ,EAErCA,IAAO,GACJA,IAAO,GACPA,IAAO,GACPA,IAAO,GACPA,IAAO,GACPA,IAAO,KAEX9O,EAAA,2BAA2B8O,CAAO,EAAIY,KAIrC,CAACJ,EAAYR,CAAO,EAAG,CAE1B,GADAQ,EAAYR,CAAO,EAAI,GACnB,CAACc,EACJ,MAAM,IAAI,MAAM,8CAA8Cd,CAAO,qBAAqBa,CAAW,EAAE,EAExGZ,EAAM,OAAOD,EAASc,CAAU,EAChCZ,EAAkB,OAAOF,EAASiB,GAAuBH,CAAU,EACnEX,EAAuB,OAAOH,EAASkB,GAA4BD,GAAuBH,CAAU,CACrG,CACIC,IACH7P,EAAA,mBAAmB6P,CAAY,EAAIf,GAEhCgB,IACH9P,EAAA,oCAAoC8P,CAAI,EAAIhB,EAE9C,CAEA9O,EAAA,2BAA0B,CAAA,EAAe,EAE1C,GAAE,EAEF,IAAiBiQ,GAAjB,SAAiBA,EAAY,CAC5B,SAAgBC,EAASpB,EAAgB,CACxC,OAAOC,EAAM,aAAaD,CAAO,CAClC,CAFgBmB,EAAA,SAAQC,EAGxB,SAAgBC,EAAWzc,EAAW,CACrC,OAAOqb,EAAM,aAAarb,CAAG,CAC9B,CAFgBuc,EAAA,WAAUE,EAI1B,SAAgBC,EAAiBtB,EAAgB,CAChD,OAAOE,EAAkB,aAAaF,CAAO,CAC9C,CAFgBmB,EAAA,iBAAgBG,EAGhC,SAAgBC,EAAsBvB,EAAgB,CACrD,OAAOG,EAAuB,aAAaH,CAAO,CACnD,CAFgBmB,EAAA,sBAAqBI,EAGrC,SAAgBC,EAAiB5c,EAAW,CAC3C,OAAOsb,EAAkB,aAAatb,CAAG,GAAKub,EAAuB,aAAavb,CAAG,CACtF,CAFgBuc,EAAA,iBAAgBK,EAIhC,SAAgBC,EAAsBzB,EAAgB,CACrD,GAAIA,GAAO,IAAuBA,GAAO,IASxC,OAAO,KAGR,OAAQA,EAAS,CAChB,IAAA,IACC,MAAO,KACR,IAAA,IACC,MAAO,OACR,IAAA,IACC,MAAO,OACR,IAAA,IACC,MAAO,OACT,CAEA,OAAOC,EAAM,aAAaD,CAAO,CAClC,CAzBgBmB,EAAA,sBAAqBM,CA0BtC,GA5CiBN,IAAYjQ,EAAA,aAAZiQ,EAAY,CAAA,EAAA,EAqD7B,SAAgBrB,EAAS4B,EAAmBC,EAAkB,CAC7D,MAAMC,GAAcD,EAAa,QAAe,KAAQ,EACxD,OAAQD,EAAYE,KAAe,CACpC,+GClzBA,MAAaC,CAAI,CAMhB,YACkBC,EAAiB,CAAjB,KAAA,SAAAA,EALV,KAAA,QAAmB,EAMvB,CAQJ,IAAI,OAAK,CACR,GAAI,CAAC,KAAK,QACT,GAAI,CACH,KAAK,OAAS,KAAK,SAAQ,CAC5B,OAAS7c,EAAK,CACb,KAAK,OAASA,CACf,SACC,KAAK,QAAU,EAChB,CAED,GAAI,KAAK,OACR,MAAM,KAAK,OAEZ,OAAO,KAAK,MACb,CAKA,IAAI,UAAQ,CAAoB,OAAO,KAAK,MAAQ,EAnCrDiM,EAAA,KAAA2Q,+NCkCA3Q,EAAA,qBAAA6Q,EAuCA7Q,EAAA,gBAAA8Q,EAKA9Q,EAAA,eAAA+Q,EAoBA/Q,EAAA,gBAAAgR,EAuBAhR,EAAA,aAAAiR,EAYAjR,EAAA,QAAAkR,EA8BAlR,EAAA,mBAAAmR,EAWAnR,EAAA,aAAAoR,EAtKA,MAAMC,EAAoB,GAC1B,IAAIC,EAA+C,KAyBnD,SAAgBT,EAAqBU,EAAkC,CACtED,EAAoBC,CACrB,CAEA,GAAIF,EAAmB,CACtB,MAAMG,EAA4B,4BAClCX,EAAqB,IAAI,KAAA,CACxB,gBAAgB3M,EAAc,CAC7B,MAAMhJ,EAAQ,IAAI,MAAM,+BAA+B,EAAE,MACzD,WAAW,IAAK,CACTgJ,EAAUsN,CAAyB,GACxC,QAAQ,IAAItW,CAAK,CAEnB,EAAG,GAAI,CACR,CAEA,UAAUuW,EAAoBC,EAA0B,CACvD,GAAID,GAASA,IAAUE,EAAW,KACjC,GAAI,CACFF,EAAcD,CAAyB,EAAI,EAC7C,MAAQ,CAER,CAEF,CAEA,eAAeI,EAAuB,CACrC,GAAIA,GAAcA,IAAeD,EAAW,KAC3C,GAAI,CACFC,EAAmBJ,CAAyB,EAAI,EAClD,MAAQ,CAER,CAEF,CACA,gBAAgBI,EAAuB,CAAU,EACjD,CACF,CAEA,SAAgBd,EAAuC5M,EAAI,CAC1D,OAAAoN,GAAmB,gBAAgBpN,CAAC,EAC7BA,CACR,CAEA,SAAgB6M,EAAea,EAAuB,CACrDN,GAAmB,eAAeM,CAAU,CAC7C,CAEA,SAASC,EAAsBJ,EAAoBC,EAA0B,CAC5EJ,GAAmB,UAAUG,EAAOC,CAAM,CAC3C,CAEA,SAASI,EAAuBC,EAAyBL,EAA0B,CAClF,GAAKJ,EAGL,UAAWG,KAASM,EACnBT,EAAkB,UAAUG,EAAOC,CAAM,CAE3C,CAKA,SAAgBV,EAAuCgB,EAAY,CAClE,OAAAV,GAAmB,gBAAgBU,CAAS,EACrCA,CACR,CAoBA,SAAgBf,EAA4B9D,EAAQ,CACnD,OAAO,OAAOA,GAAU,UAAYA,IAAU,MAAQ,OAA0BA,EAAO,SAAY,YAAiCA,EAAO,QAAQ,SAAW,CAC/J,CAUA,SAAgB+D,EAA+BtN,EAAgC,CAC9E,GAAIqO,EAAA,SAAS,GAAGrO,CAAG,EAAG,CACrB,MAAMsO,EAAgB,CAAA,EAEtB,UAAWC,KAAKvO,EACf,GAAIuO,EACH,GAAI,CACHA,EAAE,QAAO,CACV,OAAS/b,EAAG,CACX8b,EAAO,KAAK9b,CAAC,CACd,CAIF,GAAI8b,EAAO,SAAW,EACrB,MAAMA,EAAO,CAAC,EACR,GAAIA,EAAO,OAAS,EAC1B,MAAM,IAAI,eAAeA,EAAQ,6CAA6C,EAG/E,OAAO,MAAM,QAAQtO,CAAG,EAAI,CAAA,EAAKA,CAClC,SAAWA,EACV,OAAAA,EAAI,QAAO,EACJA,CAET,CAKA,SAAgBuN,KAAsBiB,EAA0B,CAC/D,MAAMV,EAASN,EAAa,IAAMF,EAAQkB,CAAW,CAAC,EACtD,OAAAN,EAAuBM,EAAaV,CAAM,EACnCA,CACR,CAOA,SAAgBN,EAAavE,EAAc,CAC1C,MAAMwF,EAAOvB,EAAgB,CAC5B,WAASwB,EAAA,0BAAyB,IAAK,CACtCvB,EAAesB,CAAI,EACnBxF,EAAE,CACH,CAAC,EACD,EACD,OAAOwF,CACR,CASA,MAAaE,CAAe,QAEpB,KAAA,yBAA2B,EAAM,CAKxC,aAAA,CAHiB,KAAA,WAAa,IAAI,IAC1B,KAAA,YAAc,GAGrBzB,EAAgB,IAAI,CACrB,CAOO,SAAO,CACT,KAAK,cAITC,EAAe,IAAI,EACnB,KAAK,YAAc,GACnB,KAAK,MAAK,EACX,CAKA,IAAW,YAAU,CACpB,OAAO,KAAK,WACb,CAKO,OAAK,CACX,GAAI,KAAK,WAAW,OAAS,EAI7B,GAAI,CACHG,EAAQ,KAAK,UAAU,CACxB,SACC,KAAK,WAAW,MAAK,CACtB,CACD,CAKO,IAA2BsB,EAAI,CACrC,GAAI,CAACA,EACJ,OAAOA,EAER,GAAKA,IAAqC,KACzC,MAAM,IAAI,MAAM,yCAAyC,EAG1D,OAAAX,EAAsBW,EAAG,IAAI,EACzB,KAAK,YACHD,EAAgB,0BACpB,QAAQ,KAAK,IAAI,MAAM,qHAAqH,EAAE,KAAK,EAGpJ,KAAK,WAAW,IAAIC,CAAC,EAGfA,CACR,CAKO,cAAqCA,EAAI,CAC1CA,GAGD,KAAK,WAAW,IAAIA,CAAC,IACxB,KAAK,WAAW,OAAOA,CAAC,EACxBX,EAAsBW,EAAG,IAAI,EAE/B,EAlFDxS,EAAA,gBAAAuS,EA0FA,MAAsBZ,CAAU,QAOf,KAAA,KAAO,OAAO,OAAoB,CAAE,SAAO,CAAK,CAAC,CAAE,CAAE,CAIrE,aAAA,CAFmB,KAAA,OAAS,IAAIY,EAG/BzB,EAAgB,IAAI,EACpBe,EAAsB,KAAK,OAAQ,IAAI,CACxC,CAEO,SAAO,CACbd,EAAe,IAAI,EAEnB,KAAK,OAAO,QAAO,CACpB,CAKU,UAAiCyB,EAAI,CAC9C,GAAKA,IAAgC,KACpC,MAAM,IAAI,MAAM,yCAAyC,EAE1D,OAAO,KAAK,OAAO,IAAIA,CAAC,CACzB,EA9BDxS,EAAA,WAAA2R,EAuCA,MAAac,CAAiB,CAI7B,aAAA,CAFQ,KAAA,YAAc,GAGrB3B,EAAgB,IAAI,CACrB,CAEA,IAAI,OAAK,CACR,OAAO,KAAK,YAAc,OAAY,KAAK,MAC5C,CAEA,IAAI,MAAMld,EAAoB,CACzB,KAAK,aAAeA,IAAU,KAAK,SAIvC,KAAK,QAAQ,QAAO,EAChBA,GACHie,EAAsBje,EAAO,IAAI,EAElC,KAAK,OAASA,EACf,CAKA,OAAK,CACJ,KAAK,MAAQ,MACd,CAEA,SAAO,CACN,KAAK,YAAc,GACnBmd,EAAe,IAAI,EACnB,KAAK,QAAQ,QAAO,EACpB,KAAK,OAAS,MACf,EApCD/Q,EAAA,kBAAAyS,EAuCA,MAAaC,CAAoB,CAIhC,YACkBC,EAAwB,CAAxB,KAAA,YAAAA,EAHV,KAAA,SAAmB,CAIvB,CAEJ,SAAO,CACN,YAAK,WACE,IACR,CAEA,SAAO,CACN,MAAI,EAAE,KAAK,WAAa,GACvB,KAAK,YAAY,QAAO,EAElB,IACR,EAlBD3S,EAAA,qBAAA0S,EAyBA,MAAaE,CAAiB,CAC7B,YAAmBC,EAAS,CAAT,KAAA,OAAAA,CAAa,CAChC,SAAO,CAAsB,EAF9B7S,EAAA,kBAAA4S,EAQA,MAAaE,CAAa,CAKzB,aAAA,CAHiB,KAAA,OAAS,IAAI,IACtB,KAAA,YAAc,GAGrBhC,EAAgB,IAAI,CACrB,CAOA,SAAO,CACNC,EAAe,IAAI,EACnB,KAAK,YAAc,GACnB,KAAK,mBAAkB,CACxB,CAKA,oBAAkB,CACjB,GAAK,KAAK,OAAO,KAIjB,GAAI,CACHG,EAAQ,KAAK,OAAO,OAAM,CAAE,CAC7B,SACC,KAAK,OAAO,MAAK,CAClB,CACD,CAEA,IAAIxd,EAAM,CACT,OAAO,KAAK,OAAO,IAAIA,CAAG,CAC3B,CAEA,IAAIA,EAAQE,EAAUmf,EAAyB,GAAK,CAC/C,KAAK,aACR,QAAQ,KAAK,IAAI,MAAM,mHAAmH,EAAE,KAAK,EAG7IA,GACJ,KAAK,OAAO,IAAIrf,CAAG,GAAG,QAAO,EAG9B,KAAK,OAAO,IAAIA,EAAKE,CAAK,CAC3B,CAKA,iBAAiBF,EAAM,CACtB,KAAK,OAAO,IAAIA,CAAG,GAAG,QAAO,EAC7B,KAAK,OAAO,OAAOA,CAAG,CACvB,CAEA,CAAC,OAAO,QAAQ,GAAC,CAChB,OAAO,KAAK,OAAO,OAAO,QAAQ,EAAC,CACpC,EA7DDsM,EAAA,cAAA8S,qHCxYA,MAAME,CAAI,QAEO,KAAA,UAAY,IAAIA,EAAU,MAAS,CAAE,CAMrD,YAAY5P,EAAU,CACrB,KAAK,QAAUA,EACf,KAAK,KAAO4P,EAAK,UACjB,KAAK,KAAOA,EAAK,SAClB,EAGD,MAAaC,CAAU,CAAvB,aAAA,CAES,KAAA,OAAkBD,EAAK,UACvB,KAAA,MAAiBA,EAAK,UACtB,KAAA,MAAgB,CAqHzB,CAnHC,IAAI,MAAI,CACP,OAAO,KAAK,KACb,CAEA,SAAO,CACN,OAAO,KAAK,SAAWA,EAAK,SAC7B,CAEA,OAAK,CACJ,IAAIE,EAAO,KAAK,OAChB,KAAOA,IAASF,EAAK,WAAW,CAC/B,MAAMtE,EAAOwE,EAAK,KAClBA,EAAK,KAAOF,EAAK,UACjBE,EAAK,KAAOF,EAAK,UACjBE,EAAOxE,CACR,CAEA,KAAK,OAASsE,EAAK,UACnB,KAAK,MAAQA,EAAK,UAClB,KAAK,MAAQ,CACd,CAEA,QAAQ5P,EAAU,CACjB,OAAO,KAAK,QAAQA,EAAS,EAAK,CACnC,CAEA,KAAKA,EAAU,CACd,OAAO,KAAK,QAAQA,EAAS,EAAI,CAClC,CAEQ,QAAQA,EAAY+P,EAAiB,CAC5C,MAAMC,EAAU,IAAIJ,EAAK5P,CAAO,EAChC,GAAI,KAAK,SAAW4P,EAAK,UACxB,KAAK,OAASI,EACd,KAAK,MAAQA,UAEHD,EAAU,CAEpB,MAAME,EAAU,KAAK,MACrB,KAAK,MAAQD,EACbA,EAAQ,KAAOC,EACfA,EAAQ,KAAOD,CAEhB,KAAO,CAEN,MAAME,EAAW,KAAK,OACtB,KAAK,OAASF,EACdA,EAAQ,KAAOE,EACfA,EAAS,KAAOF,CACjB,CACA,KAAK,OAAS,EAEd,IAAIG,EAAY,GAChB,MAAO,IAAK,CACNA,IACJA,EAAY,GACZ,KAAK,QAAQH,CAAO,EAEtB,CACD,CAEA,OAAK,CACJ,GAAI,KAAK,SAAWJ,EAAK,UAElB,CACN,MAAMQ,EAAM,KAAK,OAAO,QACxB,YAAK,QAAQ,KAAK,MAAM,EACjBA,CACR,CACD,CAEA,KAAG,CACF,GAAI,KAAK,QAAUR,EAAK,UAEjB,CACN,MAAMQ,EAAM,KAAK,MAAM,QACvB,YAAK,QAAQ,KAAK,KAAK,EAChBA,CACR,CACD,CAEQ,QAAQN,EAAa,CAC5B,GAAIA,EAAK,OAASF,EAAK,WAAaE,EAAK,OAASF,EAAK,UAAW,CAEjE,MAAMS,EAASP,EAAK,KACpBO,EAAO,KAAOP,EAAK,KACnBA,EAAK,KAAK,KAAOO,CAElB,MAAWP,EAAK,OAASF,EAAK,WAAaE,EAAK,OAASF,EAAK,WAE7D,KAAK,OAASA,EAAK,UACnB,KAAK,MAAQA,EAAK,WAERE,EAAK,OAASF,EAAK,WAE7B,KAAK,MAAQ,KAAK,MAAM,KACxB,KAAK,MAAM,KAAOA,EAAK,WAEbE,EAAK,OAASF,EAAK,YAE7B,KAAK,OAAS,KAAK,OAAO,KAC1B,KAAK,OAAO,KAAOA,EAAK,WAIzB,KAAK,OAAS,CACf,CAEA,EAAE,OAAO,QAAQ,GAAC,CACjB,IAAIE,EAAO,KAAK,OAChB,KAAOA,IAASF,EAAK,WACpB,MAAME,EAAK,QACXA,EAAOA,EAAK,IAEd,EAxHDlT,EAAA,WAAAiT,iLCTA,MAAMS,CAAgB,CACrB,YAAqBtgB,EAAmBQ,EAAQ,CAA3B,KAAA,IAAAR,EAAmB,KAAA,MAAAQ,CAAY,EAGrD,SAAS+f,EAAa/P,EAAmF,CACxG,OAAO,MAAM,QAAQA,CAAG,CACzB,CAEA,MAAagQ,CAAW,QAEC,KAAA,aAAgBC,GAAkBA,EAAS,SAAQ,CAAG,CA2B9E,YAAYjQ,EAA0EkQ,EAAwB,CAC7G,GA1BQ,KAAAC,CAAA,EAAuB,cA0B3BnQ,aAAegQ,EAClB,KAAK,IAAM,IAAI,IAAIhQ,EAAI,GAAG,EAC1B,KAAK,MAAQkQ,GAASF,EAAY,qBACxBD,EAAU/P,CAAG,EAAG,CAC1B,KAAK,IAAM,IAAI,IACf,KAAK,MAAQkQ,GAASF,EAAY,aAElC,SAAW,CAACC,EAAUjgB,CAAK,IAAKgQ,EAC/B,KAAK,IAAIiQ,EAAUjgB,CAAK,CAE1B,MACC,KAAK,IAAM,IAAI,IACf,KAAK,MAAQgQ,GAAOgQ,EAAY,YAElC,CAEA,IAAIC,EAAejgB,EAAQ,CAC1B,YAAK,IAAI,IAAI,KAAK,MAAMigB,CAAQ,EAAG,IAAIH,EAAiBG,EAAUjgB,CAAK,CAAC,EACjE,IACR,CAEA,IAAIigB,EAAa,CAChB,OAAO,KAAK,IAAI,IAAI,KAAK,MAAMA,CAAQ,CAAC,GAAG,KAC5C,CAEA,IAAIA,EAAa,CAChB,OAAO,KAAK,IAAI,IAAI,KAAK,MAAMA,CAAQ,CAAC,CACzC,CAEA,IAAI,MAAI,CACP,OAAO,KAAK,IAAI,IACjB,CAEA,OAAK,CACJ,KAAK,IAAI,MAAK,CACf,CAEA,OAAOA,EAAa,CACnB,OAAO,KAAK,IAAI,OAAO,KAAK,MAAMA,CAAQ,CAAC,CAC5C,CAEA,QAAQG,EAAqDC,EAAa,CACrE,OAAOA,EAAY,MACtBD,EAAMA,EAAI,KAAKC,CAAO,GAEvB,SAAW,CAAClV,EAAGmV,CAAK,IAAK,KAAK,IAC7BF,EAAIE,EAAM,MAAOA,EAAM,IAAU,IAAI,CAEvC,CAEA,CAAC,QAAM,CACN,UAAWA,KAAS,KAAK,IAAI,OAAM,EAClC,MAAMA,EAAM,KAEd,CAEA,CAAC,MAAI,CACJ,UAAWA,KAAS,KAAK,IAAI,OAAM,EAClC,MAAMA,EAAM,GAEd,CAEA,CAAC,SAAO,CACP,UAAWA,KAAS,KAAK,IAAI,OAAM,EAClC,KAAM,CAACA,EAAM,IAAKA,EAAM,KAAK,CAE/B,CAEA,GAACH,EA9FS,OAAO,YA8Ff,OAAO,SAAQ,GAAC,CACjB,SAAW,CAAC,CAAEG,CAAK,IAAK,KAAK,IAC5B,KAAM,CAACA,EAAM,IAAKA,EAAM,KAAK,CAE/B,EAtGDlU,EAAA,YAAA4T,EAuHA,MAAaO,CAAS,CAWrB,aAAA,CATS,KAAAC,CAAA,EAAuB,YAU/B,KAAK,KAAO,IAAI,IAChB,KAAK,MAAQ,OACb,KAAK,MAAQ,OACb,KAAK,MAAQ,EACb,KAAK,OAAS,CACf,CAEA,OAAK,CACJ,KAAK,KAAK,MAAK,EACf,KAAK,MAAQ,OACb,KAAK,MAAQ,OACb,KAAK,MAAQ,EACb,KAAK,QACN,CAEA,SAAO,CACN,MAAO,CAAC,KAAK,OAAS,CAAC,KAAK,KAC7B,CAEA,IAAI,MAAI,CACP,OAAO,KAAK,KACb,CAEA,IAAI,OAAK,CACR,OAAO,KAAK,OAAO,KACpB,CAEA,IAAI,MAAI,CACP,OAAO,KAAK,OAAO,KACpB,CAEA,IAAI1gB,EAAM,CACT,OAAO,KAAK,KAAK,IAAIA,CAAG,CACzB,CAEA,IAAIA,EAAQ2gB,EAAA,EAAyB,CACpC,MAAM9Q,EAAO,KAAK,KAAK,IAAI7P,CAAG,EAC9B,GAAK6P,EAGL,OAAI8Q,IAAK,GACR,KAAK,MAAM9Q,EAAM8Q,CAAK,EAEhB9Q,EAAK,KACb,CAEA,IAAI7P,EAAQE,EAAUygB,EAAA,EAAyB,CAC9C,IAAI9Q,EAAO,KAAK,KAAK,IAAI7P,CAAG,EAC5B,GAAI6P,EACHA,EAAK,MAAQ3P,EACTygB,IAAK,GACR,KAAK,MAAM9Q,EAAM8Q,CAAK,MAEjB,CAEN,OADA9Q,EAAO,CAAE,IAAA7P,EAAK,MAAAE,EAAO,KAAM,OAAW,SAAU,MAAS,EACjDygB,EAAO,CACd,IAAA,GACC,KAAK,YAAY9Q,CAAI,EACrB,MACD,IAAA,GACC,KAAK,aAAaA,CAAI,EACtB,MACD,IAAA,GACC,KAAK,YAAYA,CAAI,EACrB,MACD,QACC,KAAK,YAAYA,CAAI,EACrB,KACF,CACA,KAAK,KAAK,IAAI7P,EAAK6P,CAAI,EACvB,KAAK,OACN,CACA,OAAO,IACR,CAEA,OAAO7P,EAAM,CACZ,MAAO,CAAC,CAAC,KAAK,OAAOA,CAAG,CACzB,CAEA,OAAOA,EAAM,CACZ,MAAM6P,EAAO,KAAK,KAAK,IAAI7P,CAAG,EAC9B,GAAK6P,EAGL,YAAK,KAAK,OAAO7P,CAAG,EACpB,KAAK,WAAW6P,CAAI,EACpB,KAAK,QACEA,EAAK,KACb,CAEA,OAAK,CACJ,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACxB,OAED,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACxB,MAAM,IAAI,MAAM,cAAc,EAE/B,MAAMA,EAAO,KAAK,MAClB,YAAK,KAAK,OAAOA,EAAK,GAAG,EACzB,KAAK,WAAWA,CAAI,EACpB,KAAK,QACEA,EAAK,KACb,CAEA,QAAQ+Q,EAA8DL,EAAa,CAClF,MAAMM,EAAQ,KAAK,OACnB,IAAIC,EAAU,KAAK,MACnB,KAAOA,GAAS,CAMf,GALIP,EACHK,EAAW,KAAKL,CAAO,EAAEO,EAAQ,MAAOA,EAAQ,IAAK,IAAI,EAEzDF,EAAWE,EAAQ,MAAOA,EAAQ,IAAK,IAAI,EAExC,KAAK,SAAWD,EACnB,MAAM,IAAI,MAAM,0CAA0C,EAE3DC,EAAUA,EAAQ,IACnB,CACD,CAEA,MAAI,CACH,MAAM1G,EAAM,KACNyG,EAAQ,KAAK,OACnB,IAAIC,EAAU,KAAK,MACnB,MAAM/F,EAAgC,CACrC,CAAC,OAAO,QAAQ,GAAC,CAChB,OAAOA,CACR,EACA,MAAI,CACH,GAAIX,EAAI,SAAWyG,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAE3D,GAAIC,EAAS,CACZ,MAAMniB,EAAS,CAAE,MAAOmiB,EAAQ,IAAK,KAAM,EAAK,EAChD,OAAAA,EAAUA,EAAQ,KACXniB,CACR,KACC,OAAO,CAAE,MAAO,OAAW,KAAM,EAAI,CAEvC,GAED,OAAOoc,CACR,CAEA,QAAM,CACL,MAAMX,EAAM,KACNyG,EAAQ,KAAK,OACnB,IAAIC,EAAU,KAAK,MACnB,MAAM/F,EAAgC,CACrC,CAAC,OAAO,QAAQ,GAAC,CAChB,OAAOA,CACR,EACA,MAAI,CACH,GAAIX,EAAI,SAAWyG,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAE3D,GAAIC,EAAS,CACZ,MAAMniB,EAAS,CAAE,MAAOmiB,EAAQ,MAAO,KAAM,EAAK,EAClD,OAAAA,EAAUA,EAAQ,KACXniB,CACR,KACC,OAAO,CAAE,MAAO,OAAW,KAAM,EAAI,CAEvC,GAED,OAAOoc,CACR,CAEA,SAAO,CACN,MAAMX,EAAM,KACNyG,EAAQ,KAAK,OACnB,IAAIC,EAAU,KAAK,MACnB,MAAM/F,EAAqC,CAC1C,CAAC,OAAO,QAAQ,GAAC,CAChB,OAAOA,CACR,EACA,MAAI,CACH,GAAIX,EAAI,SAAWyG,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAE3D,GAAIC,EAAS,CACZ,MAAMniB,EAAiC,CAAE,MAAO,CAACmiB,EAAQ,IAAKA,EAAQ,KAAK,EAAG,KAAM,EAAK,EACzF,OAAAA,EAAUA,EAAQ,KACXniB,CACR,KACC,OAAO,CAAE,MAAO,OAAW,KAAM,EAAI,CAEvC,GAED,OAAOoc,CACR,CAEA,EAAA2F,EA1MU,OAAO,YA0MhB,OAAO,SAAQ,GAAC,CAChB,OAAO,KAAK,QAAO,CACpB,CAEU,QAAQK,EAAe,CAChC,GAAIA,GAAW,KAAK,KACnB,OAED,GAAIA,IAAY,EAAG,CAClB,KAAK,MAAK,EACV,MACD,CACA,IAAID,EAAU,KAAK,MACfE,EAAc,KAAK,KACvB,KAAOF,GAAWE,EAAcD,GAC/B,KAAK,KAAK,OAAOD,EAAQ,GAAG,EAC5BA,EAAUA,EAAQ,KAClBE,IAED,KAAK,MAAQF,EACb,KAAK,MAAQE,EACTF,IACHA,EAAQ,SAAW,QAEpB,KAAK,QACN,CAEU,QAAQC,EAAe,CAChC,GAAIA,GAAW,KAAK,KACnB,OAED,GAAIA,IAAY,EAAG,CAClB,KAAK,MAAK,EACV,MACD,CACA,IAAID,EAAU,KAAK,MACfE,EAAc,KAAK,KACvB,KAAOF,GAAWE,EAAcD,GAC/B,KAAK,KAAK,OAAOD,EAAQ,GAAG,EAC5BA,EAAUA,EAAQ,SAClBE,IAED,KAAK,MAAQF,EACb,KAAK,MAAQE,EACTF,IACHA,EAAQ,KAAO,QAEhB,KAAK,QACN,CAEQ,aAAajR,EAAgB,CAEpC,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACxB,KAAK,MAAQA,UACF,KAAK,MAGhBA,EAAK,KAAO,KAAK,MACjB,KAAK,MAAM,SAAWA,MAHtB,OAAM,IAAI,MAAM,cAAc,EAK/B,KAAK,MAAQA,EACb,KAAK,QACN,CAEQ,YAAYA,EAAgB,CAEnC,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACxB,KAAK,MAAQA,UACF,KAAK,MAGhBA,EAAK,SAAW,KAAK,MACrB,KAAK,MAAM,KAAOA,MAHlB,OAAM,IAAI,MAAM,cAAc,EAK/B,KAAK,MAAQA,EACb,KAAK,QACN,CAEQ,WAAWA,EAAgB,CAClC,GAAIA,IAAS,KAAK,OAASA,IAAS,KAAK,MACxC,KAAK,MAAQ,OACb,KAAK,MAAQ,eAELA,IAAS,KAAK,MAAO,CAG7B,GAAI,CAACA,EAAK,KACT,MAAM,IAAI,MAAM,cAAc,EAE/BA,EAAK,KAAK,SAAW,OACrB,KAAK,MAAQA,EAAK,IACnB,SACSA,IAAS,KAAK,MAAO,CAG7B,GAAI,CAACA,EAAK,SACT,MAAM,IAAI,MAAM,cAAc,EAE/BA,EAAK,SAAS,KAAO,OACrB,KAAK,MAAQA,EAAK,QACnB,KACK,CACJ,MAAMmL,EAAOnL,EAAK,KACZoR,EAAWpR,EAAK,SACtB,GAAI,CAACmL,GAAQ,CAACiG,EACb,MAAM,IAAI,MAAM,cAAc,EAE/BjG,EAAK,SAAWiG,EAChBA,EAAS,KAAOjG,CACjB,CACAnL,EAAK,KAAO,OACZA,EAAK,SAAW,OAChB,KAAK,QACN,CAEQ,MAAMA,EAAkB8Q,EAAY,CAC3C,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACxB,MAAM,IAAI,MAAM,cAAc,EAE/B,GAAK,EAAAA,IAAK,GAAoBA,IAAK,IAInC,GAAIA,IAAK,EAAkB,CAC1B,GAAI9Q,IAAS,KAAK,MACjB,OAGD,MAAMmL,EAAOnL,EAAK,KACZoR,EAAWpR,EAAK,SAGlBA,IAAS,KAAK,OAGjBoR,EAAU,KAAO,OACjB,KAAK,MAAQA,IAIbjG,EAAM,SAAWiG,EACjBA,EAAU,KAAOjG,GAIlBnL,EAAK,SAAW,OAChBA,EAAK,KAAO,KAAK,MACjB,KAAK,MAAM,SAAWA,EACtB,KAAK,MAAQA,EACb,KAAK,QACN,SAAW8Q,IAAK,EAAkB,CACjC,GAAI9Q,IAAS,KAAK,MACjB,OAGD,MAAMmL,EAAOnL,EAAK,KACZoR,EAAWpR,EAAK,SAGlBA,IAAS,KAAK,OAGjBmL,EAAM,SAAW,OACjB,KAAK,MAAQA,IAGbA,EAAM,SAAWiG,EACjBA,EAAU,KAAOjG,GAElBnL,EAAK,KAAO,OACZA,EAAK,SAAW,KAAK,MACrB,KAAK,MAAM,KAAOA,EAClB,KAAK,MAAQA,EACb,KAAK,QACN,EACD,CAEA,QAAM,CACL,MAAM1L,EAAiB,CAAA,EAEvB,YAAK,QAAQ,CAACjE,EAAOF,IAAO,CAC3BmE,EAAK,KAAK,CAACnE,EAAKE,CAAK,CAAC,CACvB,CAAC,EAEMiE,CACR,CAEA,SAASA,EAAc,CACtB,KAAK,MAAK,EAEV,SAAW,CAACnE,EAAKE,CAAK,IAAKiE,EAC1B,KAAK,IAAInE,EAAKE,CAAK,CAErB,EA7YDoM,EAAA,UAAAmU,EAgZA,MAAeS,UAAoBT,CAAe,CAKjD,YAAYU,EAAeC,EAAgB,EAAC,CAC3C,MAAK,EACL,KAAK,OAASD,EACd,KAAK,OAAS,KAAK,IAAI,KAAK,IAAI,EAAGC,CAAK,EAAG,CAAC,CAC7C,CAEA,IAAI,OAAK,CACR,OAAO,KAAK,MACb,CAEA,IAAI,MAAMD,EAAa,CACtB,KAAK,OAASA,EACd,KAAK,UAAS,CACf,CAES,IAAInhB,EAAQ2gB,EAAA,EAA0B,CAC9C,OAAO,MAAM,IAAI3gB,EAAK2gB,CAAK,CAC5B,CAEA,KAAK3gB,EAAM,CACV,OAAO,MAAM,IAAIA,EAAG,CAAA,CACrB,CAES,IAAIA,EAAQE,EAAQ,CAC5B,aAAM,IAAIF,EAAKE,EAAK,CAAA,EACb,IACR,CAEU,WAAS,CACd,KAAK,KAAO,KAAK,QACpB,KAAK,KAAK,KAAK,MAAM,KAAK,OAAS,KAAK,MAAM,CAAC,CAEjD,EAKD,MAAamhB,UAAuBH,CAAW,CAE9C,YAAYC,EAAeC,EAAgB,EAAC,CAC3C,MAAMD,EAAOC,CAAK,CACnB,CAEmB,KAAKL,EAAe,CACtC,KAAK,QAAQA,CAAO,CACrB,CAES,IAAI/gB,EAAQE,EAAQ,CAC5B,aAAM,IAAIF,EAAKE,CAAK,EACpB,KAAK,UAAS,EACP,IACR,EAdDoM,EAAA,SAAA+U,EAqBA,MAAaC,CAAgB,CAK5B,YAAYC,EAAsC,CACjD,GAJgB,KAAA,IAAM,IAAI,IACV,KAAA,IAAM,IAAI,IAGtBA,EACH,SAAW,CAACvhB,EAAKE,CAAK,IAAKqhB,EAC1B,KAAK,IAAIvhB,EAAKE,CAAK,CAGtB,CAEA,OAAK,CACJ,KAAK,IAAI,MAAK,EACd,KAAK,IAAI,MAAK,CACf,CAEA,IAAIF,EAAQE,EAAQ,CACnB,KAAK,IAAI,IAAIF,EAAKE,CAAK,EACvB,KAAK,IAAI,IAAIA,EAAOF,CAAG,CACxB,CAEA,IAAIA,EAAM,CACT,OAAO,KAAK,IAAI,IAAIA,CAAG,CACxB,CAEA,OAAOE,EAAQ,CACd,OAAO,KAAK,IAAI,IAAIA,CAAK,CAC1B,CAEA,OAAOF,EAAM,CACZ,MAAME,EAAQ,KAAK,IAAI,IAAIF,CAAG,EAC9B,OAAIE,IAAU,OACN,IAER,KAAK,IAAI,OAAOF,CAAG,EACnB,KAAK,IAAI,OAAOE,CAAK,EACd,GACR,CAEA,MAAI,CACH,OAAO,KAAK,IAAI,KAAI,CACrB,CAEA,QAAM,CACL,OAAO,KAAK,IAAI,OAAM,CACvB,EA/CDoM,EAAA,iBAAAgV,EAkDA,MAAaE,CAAM,CAAnB,aAAA,CAES,KAAA,IAAM,IAAI,GA4CnB,CA1CC,IAAIxhB,EAAQE,EAAQ,CACnB,IAAIuhB,EAAS,KAAK,IAAI,IAAIzhB,CAAG,EAExByhB,IACJA,EAAS,IAAI,IACb,KAAK,IAAI,IAAIzhB,EAAKyhB,CAAM,GAGzBA,EAAO,IAAIvhB,CAAK,CACjB,CAEA,OAAOF,EAAQE,EAAQ,CACtB,MAAMuhB,EAAS,KAAK,IAAI,IAAIzhB,CAAG,EAE1ByhB,IAILA,EAAO,OAAOvhB,CAAK,EAEfuhB,EAAO,OAAS,GACnB,KAAK,IAAI,OAAOzhB,CAAG,EAErB,CAEA,QAAQA,EAAQmZ,EAAsB,CACrC,MAAMsI,EAAS,KAAK,IAAI,IAAIzhB,CAAG,EAE1ByhB,GAILA,EAAO,QAAQtI,CAAE,CAClB,CAEA,IAAInZ,EAAM,CACT,MAAMyhB,EAAS,KAAK,IAAI,IAAIzhB,CAAG,EAC/B,OAAKyhB,GACG,IAAI,GAGb,EA7CDnV,EAAA,OAAAkV,oHCnoBA,MAAME,EAAqB,WAAW,aAAe,OAAO,WAAW,YAAY,KAAQ,WAE3F,MAAaC,CAAS,CAOd,OAAO,OAAOC,EAAwB,CAC5C,OAAO,IAAID,EAAUC,CAAc,CACpC,CAEA,YAAYA,EAAwB,CACnC,KAAK,KAAOF,GAAqBE,IAAmB,GAAQ,KAAK,IAAM,WAAW,YAAa,IAAI,KAAK,WAAW,WAAW,EAC9H,KAAK,WAAa,KAAK,KAAI,EAC3B,KAAK,UAAY,EAClB,CAEO,MAAI,CACV,KAAK,UAAY,KAAK,KAAI,CAC3B,CAEO,OAAK,CACX,KAAK,WAAa,KAAK,KAAI,EAC3B,KAAK,UAAY,EAClB,CAEO,SAAO,CACb,OAAI,KAAK,YAAc,GACf,KAAK,UAAY,KAAK,WAEvB,KAAK,KAAI,EAAK,KAAK,UAC3B,EA/BDtV,EAAA,UAAAqV,0UCGA,MAAME,EAA6B,GAO7BC,EAAoC,GASpCC,EAAsC,GAW5C,IAAiBC,GAAjB,SAAiBA,EAAK,CACRA,EAAA,KAAmB,IAAMC,EAAA,WAAW,KAEjD,SAASC,EAAsB3hB,EAAuB,CACrD,GAAIwhB,EAAqC,CACxC,KAAM,CAAE,iBAAkBI,CAAkB,EAAK5hB,EAC3CiH,EAAQ4a,EAAW,OAAM,EAC/B,IAAItQ,EAAQ,EACZvR,EAAQ,iBAAmB,IAAK,CAC3B,EAAEuR,IAAU,IACf,QAAQ,KAAK,4GAA4G,EACzHtK,EAAM,MAAK,GAEZ2a,IAAoB,CACrB,CACD,CACD,CAkBA,SAAgBE,EAAMC,EAAuBpE,EAA4B,CACxE,OAAOqE,GAAwBD,EAAO,IAAG,GAAW,EAAG,OAAW,GAAM,OAAWpE,CAAU,CAC9F,CAFgB8D,EAAA,MAAKK,EASrB,SAAgBG,EAAQF,EAAe,CACtC,MAAO,CAACjK,EAAUoK,EAAW,KAAM/D,IAAgB,CAElD,IAAIgE,EAAU,GACV/jB,EACJ,OAAAA,EAAS2jB,EAAM5f,GAAI,CAClB,GAAI,CAAAggB,EAEG,OAAI/jB,EACVA,EAAO,QAAO,EAEd+jB,EAAU,GAGJrK,EAAS,KAAKoK,EAAU/f,CAAC,CACjC,EAAG,KAAMgc,CAAW,EAEhBgE,GACH/jB,EAAO,QAAO,EAGRA,CACR,CACD,CAvBgBqjB,EAAA,KAAIQ,EA8BpB,SAAgBG,EAAUL,EAAiBtJ,EAA4B,CACtE,OAAOgJ,EAAM,KAAKA,EAAM,OAAOM,EAAOtJ,CAAS,CAAC,CACjD,CAFgBgJ,EAAA,OAAMW,EAgBtB,SAAgBvI,EAAUkI,EAAiBlI,EAAkB8D,EAA4B,CACxF,OAAO0E,EAAS,CAACvK,EAAUoK,EAAW,KAAM/D,IAAiB4D,EAAMrhB,GAAKoX,EAAS,KAAKoK,EAAUrI,EAAInZ,CAAC,CAAC,EAAG,KAAMyd,CAAW,EAAGR,CAAU,CACxI,CAFgB8D,EAAA,IAAG5H,EAenB,SAAgByI,EAAWP,EAAiBQ,EAAsB5E,EAA4B,CAC7F,OAAO0E,EAAS,CAACvK,EAAUoK,EAAW,KAAM/D,IAAiB4D,EAAMrhB,GAAI,CAAG6hB,EAAK7hB,CAAC,EAAGoX,EAAS,KAAKoK,EAAUxhB,CAAC,CAAG,EAAG,KAAMyd,CAAW,EAAGR,CAAU,CACjJ,CAFgB8D,EAAA,QAAOa,EAmBvB,SAAgB1I,EAAUmI,EAAiBnI,EAA2B+D,EAA4B,CACjG,OAAO0E,EAAS,CAACvK,EAAUoK,EAAW,KAAM/D,IAAiB4D,EAAM5f,GAAKyX,EAAOzX,CAAC,GAAK2V,EAAS,KAAKoK,EAAU/f,CAAC,EAAG,KAAMgc,CAAW,EAAGR,CAAU,CAChJ,CAFgB8D,EAAA,OAAM7H,EAOtB,SAAgB4I,EAAUT,EAAe,CACxC,OAAOA,CACR,CAFgBN,EAAA,OAAMe,EAStB,SAAgBC,KAAUC,EAAkB,CAC3C,MAAO,CAAC5K,EAAUoK,EAAW,KAAM/D,IAAgB,CAClD,MAAMR,KAAa+D,EAAA,oBAAmB,GAAGgB,EAAO,IAAIX,GAASA,EAAM5f,GAAK2V,EAAS,KAAKoK,EAAU/f,CAAC,CAAC,CAAC,CAAC,EACpG,OAAOwgB,EAAuBhF,EAAYQ,CAAW,CACtD,CACD,CALgBsD,EAAA,IAAGgB,EAYnB,SAAgBxI,EAAa8H,EAAiBa,EAA6CC,EAAalF,EAA4B,CACnI,IAAImF,EAAwBD,EAE5B,OAAOhJ,EAAUkI,EAAO5f,IACvB2gB,EAASF,EAAME,EAAQ3gB,CAAC,EACjB2gB,GACLnF,CAAU,CACd,CAPgB8D,EAAA,OAAMxH,EAStB,SAASoI,EAAYN,EAAiBpE,EAAuC,CAC5E,IAAI7F,EAEJ,MAAM9X,EAAsC,CAC3C,wBAAsB,CACrB8X,EAAWiK,EAAMgB,EAAQ,KAAMA,CAAO,CACvC,EACA,yBAAuB,CACtBjL,GAAU,QAAO,CAClB,GAGI6F,GACJgE,EAAsB3hB,CAAO,EAG9B,MAAM+iB,EAAU,IAAIC,EAAWhjB,CAAO,EAEtC,OAAA2d,GAAY,IAAIoF,CAAO,EAEhBA,EAAQ,KAChB,CAMA,SAASJ,EAA8CzE,EAAM+E,EAAkD,CAC9G,OAAIA,aAAiB,MACpBA,EAAM,KAAK/E,CAAC,EACF+E,GACVA,EAAM,IAAI/E,CAAC,EAELA,CACR,CAsBA,SAAgB8D,GAAeD,EAAiBa,EAA6CM,EAAwC,IAAKC,EAAU,GAAOC,EAAwB,GAAOC,EAA+B1F,EAA4B,CACpP,IAAI2F,GACAR,GACAS,GACAC,GAAoB,EACpBC,GAEJ,MAAMzjB,GAAsC,CAC3C,qBAAAqjB,EACA,wBAAsB,CACrBC,GAAevB,EAAM2B,IAAM,CAC1BF,KACAV,GAASF,EAAME,GAAQY,EAAG,EAEtBP,GAAW,CAACI,KACfR,GAAQ,KAAKD,EAAM,EACnBA,GAAS,QAGVW,GAAS,IAAK,CACb,MAAME,GAAUb,GAChBA,GAAS,OACTS,GAAS,QACL,CAACJ,GAAWK,GAAoB,IACnCT,GAAQ,KAAKY,EAAQ,EAEtBH,GAAoB,CACrB,EAEI,OAAON,GAAU,UACpB,aAAaK,EAAM,EACnBA,GAAS,WAAWE,GAAQP,CAAK,GAE7BK,KAAW,SACdA,GAAS,EACT,eAAeE,EAAM,EAGxB,CAAC,CACF,EACA,sBAAoB,CACfL,GAAyBI,GAAoB,GAChDC,KAAQ,CAEV,EACA,yBAAuB,CACtBA,GAAS,OACTH,GAAa,QAAO,CACrB,GAGI3F,GACJgE,EAAsB3hB,EAAO,EAG9B,MAAM+iB,GAAU,IAAIC,EAAWhjB,EAAO,EAEtC,OAAA2d,GAAY,IAAIoF,EAAO,EAEhBA,GAAQ,KAChB,CA5DgBtB,EAAA,SAAQO,GAqExB,SAAgB4B,GAAc7B,EAAiBmB,EAAgB,EAAGvF,EAA4B,CAC7F,OAAO8D,EAAM,SAAiBM,EAAO,CAAC5T,EAAMhM,IACtCgM,GAGLA,EAAK,KAAKhM,CAAC,EACJgM,GAHC,CAAChM,CAAC,EAIR+gB,EAAO,OAAW,GAAM,OAAWvF,CAAU,CACjD,CARgB8D,EAAA,WAAUmC,GA4B1B,SAAgBC,GAAS9B,EAAiB7V,EAAkC,CAACrL,EAAGC,IAAMD,IAAMC,EAAG6c,EAA4B,CAC1H,IAAImG,EAAY,GACZC,EAEJ,OAAOnK,EAAOmI,EAAOpiB,GAAQ,CAC5B,MAAMqkB,EAAaF,GAAa,CAAC5X,EAAOvM,EAAOokB,CAAK,EACpD,OAAAD,EAAY,GACZC,EAAQpkB,EACDqkB,CACR,EAAGrG,CAAU,CACd,CAVgB8D,EAAA,MAAKoC,GA6BrB,SAAgBI,GAAYlC,EAAqBmC,EAA2BvG,EAA4B,CACvG,MAAO,CACN8D,EAAM,OAAOM,EAAOmC,EAAKvG,CAAU,EACnC8D,EAAM,OAAOM,EAAO5f,GAAK,CAAC+hB,EAAI/hB,CAAC,EAAGwb,CAAU,EAE9C,CALgB8D,EAAA,MAAKwC,GA2BrB,SAAgBE,GAAUpC,EAAiBqC,EAAoB,GAAOC,EAAe,CAAA,EAAI1G,EAA4B,CACpH,IAAIwG,EAAqBE,EAAQ,MAAK,EAElCvM,EAA+BiK,EAAM5f,IAAI,CACxCgiB,EACHA,EAAO,KAAKhiB,EAAC,EAEb4gB,GAAQ,KAAK5gB,EAAC,CAEhB,CAAC,EAEGwb,GACHA,EAAW,IAAI7F,CAAQ,EAGxB,MAAMwM,EAAQ,IAAK,CAClBH,GAAQ,QAAQhiB,IAAK4gB,GAAQ,KAAK5gB,EAAC,CAAC,EACpCgiB,EAAS,IACV,EAEMpB,GAAU,IAAIC,EAAW,CAC9B,wBAAsB,CAChBlL,IACJA,EAAWiK,EAAM5f,IAAK4gB,GAAQ,KAAK5gB,EAAC,CAAC,EACjCwb,GACHA,EAAW,IAAI7F,CAAQ,EAG1B,EAEA,uBAAqB,CAChBqM,IACCC,EACH,WAAWE,CAAK,EAEhBA,EAAK,EAGR,EAEA,yBAAuB,CAClBxM,GACHA,EAAS,QAAO,EAEjBA,EAAW,IACZ,EACA,EAED,OAAI6F,GACHA,EAAW,IAAIoF,EAAO,EAGhBA,GAAQ,KAChB,CArDgBtB,EAAA,OAAM0C,GAwEtB,SAAgBI,EAAYxC,EAAiByC,EAAiE,CAW7G,MAVqB,CAAC1M,EAAUoK,EAAU/D,IAAe,CACxD,MAAMsG,EAAKD,EAAW,IAAIE,EAAoB,EAC9C,OAAO3C,EAAM,SAAUpiB,GAAK,CAC3B,MAAMvB,GAASqmB,EAAG,SAAS9kB,EAAK,EAC5BvB,KAAWumB,IACd7M,EAAS,KAAKoK,EAAU9jB,EAAM,CAEhC,EAAG,OAAW+f,CAAW,CAC1B,CAGD,CAZgBsD,EAAA,MAAK8C,EAcrB,MAAMI,GAAgB,OAAO,eAAe,EAE5C,MAAMD,EAAkB,CAAxB,aAAA,CACkB,KAAA,MAAiC,CAAA,CAoDnD,CAlDC,IAAO9L,EAAiB,CACvB,YAAK,MAAM,KAAKA,CAAE,EACX,IACR,CAEA,QAAQA,EAAoB,CAC3B,YAAK,MAAM,KAAK5D,IACf4D,EAAG5D,CAAC,EACGA,EACP,EACM,IACR,CAEA,OAAO4D,EAAuB,CAC7B,YAAK,MAAM,KAAK5D,GAAK4D,EAAG5D,CAAC,EAAIA,EAAI2P,EAAa,EACvC,IACR,CAEA,OAAU/B,EAA+CC,EAAuB,CAC/E,IAAI1U,EAAO0U,EACX,YAAK,MAAM,KAAK7N,IACf7G,EAAOyU,EAAMzU,EAAM6G,CAAC,EACb7G,EACP,EACM,IACR,CAEA,MAAMjC,EAAsC,CAACrL,EAAGC,IAAMD,IAAMC,EAAC,CAC5D,IAAIgjB,EAAY,GACZC,EACJ,YAAK,MAAM,KAAKpkB,GAAQ,CACvB,MAAMqkB,EAAaF,GAAa,CAAC5X,EAAOvM,EAAOokB,CAAK,EACpD,OAAAD,EAAY,GACZC,EAAQpkB,EACDqkB,EAAarkB,EAAQglB,EAC7B,CAAC,EAEM,IACR,CAEO,SAAShlB,EAAU,CACzB,UAAW6F,KAAQ,KAAK,MAEvB,GADA7F,EAAQ6F,EAAK7F,CAAK,EACdA,IAAUglB,GACb,MAIF,OAAOhlB,CACR,EAqBD,SAAgBilB,GAAwB7B,EAA2B8B,EAAmBhL,EAA6Bja,GAAMA,EAAE,CAC1H,MAAMgZ,EAAK,IAAI7U,KAAgB3F,EAAO,KAAKyb,EAAI,GAAG9V,EAAI,CAAC,EACjD+gB,EAAqB,IAAM/B,EAAQ,GAAG8B,EAAWjM,CAAE,EACnDmM,EAAuB,IAAMhC,EAAQ,eAAe8B,EAAWjM,CAAE,EACjExa,EAAS,IAAI4kB,EAAW,CAAE,uBAAwB8B,EAAoB,wBAAyBC,CAAoB,CAAE,EAE3H,OAAO3mB,EAAO,KACf,CAPgBqjB,EAAA,qBAAoBmD,GAiBpC,SAAgBI,GAAuBjC,EAA0B8B,EAAmBhL,EAA6Bja,GAAMA,EAAE,CACxH,MAAMgZ,EAAK,IAAI7U,KAAgB3F,EAAO,KAAKyb,EAAI,GAAG9V,EAAI,CAAC,EACjD+gB,EAAqB,IAAM/B,EAAQ,iBAAiB8B,EAAWjM,CAAE,EACjEmM,EAAuB,IAAMhC,EAAQ,oBAAoB8B,EAAWjM,CAAE,EACtExa,EAAS,IAAI4kB,EAAW,CAAE,uBAAwB8B,EAAoB,wBAAyBC,CAAoB,CAAE,EAE3H,OAAO3mB,EAAO,KACf,CAPgBqjB,EAAA,oBAAmBuD,GAYnC,SAAgBC,GAAalD,EAAe,CAC3C,OAAO,IAAI,QAAQ7W,GAAW+W,EAAKF,CAAK,EAAE7W,CAAO,CAAC,CACnD,CAFgBuW,EAAA,UAASwD,GAQzB,SAAgBC,GAAeC,EAAmB,CACjD,MAAM/mB,EAAS,IAAI4kB,EAEnB,OAAAmC,EAAQ,KAAK5F,GAAM,CAClBnhB,EAAO,KAAKmhB,CAAG,CAChB,EAAG,IAAK,CACPnhB,EAAO,KAAK,MAAS,CACtB,CAAC,EAAE,QAAQ,IAAK,CACfA,EAAO,QAAO,CACf,CAAC,EAEMA,EAAO,KACf,CAZgBqjB,EAAA,YAAWyD,GA6B3B,SAAgBE,GAAWzkB,EAAgBC,EAAc,CACxD,OAAOD,EAAKwB,GAAKvB,EAAG,KAAKuB,CAAC,CAAC,CAC5B,CAFgBsf,EAAA,QAAO2D,GAevB,SAAgBC,GAAmBtD,EAAiBuD,EAAoCzC,EAAW,CAClG,OAAAyC,EAAQzC,CAAO,EACRd,EAAM5f,GAAKmjB,EAAQnjB,CAAC,CAAC,CAC7B,CAHgBsf,EAAA,gBAAe4D,GAK/B,MAAME,EAAe,CAOpB,YAAqBC,EAAkCvC,EAAkC,CAApE,KAAA,YAAAuC,EAHb,KAAA,SAAW,EACX,KAAA,YAAc,GAGrB,MAAMxlB,EAA0B,CAC/B,uBAAwB,IAAK,CAC5BwlB,EAAY,YAAY,IAAI,EAG5B,KAAK,YAAY,cAAa,CAC/B,EACA,wBAAyB,IAAK,CAC7BA,EAAY,eAAe,IAAI,CAChC,GAEIvC,GACJtB,EAAsB3hB,CAAO,EAE9B,KAAK,QAAU,IAAIgjB,EAAWhjB,CAAO,EACjCijB,GACHA,EAAM,IAAI,KAAK,OAAO,CAExB,CAEA,YAAeuC,EAAiC,CAE/C,KAAK,UACN,CAEA,qBAAwBA,EAAoC,CAE5D,CAEA,aAAyBA,EAAsCC,EAAgB,CAE9E,KAAK,YAAc,EACpB,CAEA,UAAaD,EAAiC,CAE7C,KAAK,WACD,KAAK,WAAa,IACrB,KAAK,YAAY,cAAa,EAC1B,KAAK,cACR,KAAK,YAAc,GACnB,KAAK,QAAQ,KAAK,KAAK,YAAY,IAAG,CAAE,GAG3C,EAOD,SAAgBE,GAAkBC,EAA0B1C,EAAuB,CAElF,OADiB,IAAIsC,GAAgBI,EAAK1C,CAAK,EAC/B,QAAQ,KACzB,CAHgBxB,EAAA,eAAciE,GAQ9B,SAAgBE,GAAoBC,EAA4B,CAC/D,MAAO,CAAC/N,EAAUoK,EAAU/D,IAAe,CAC1C,IAAI5M,EAAQ,EACRuU,EAAY,GAChB,MAAMC,EAAsB,CAC3B,aAAW,CACVxU,GACD,EACA,WAAS,CACRA,IACIA,IAAU,IACbsU,EAAW,cAAa,EACpBC,IACHA,EAAY,GACZhO,EAAS,KAAKoK,CAAQ,GAGzB,EACA,sBAAoB,CAEpB,EACA,cAAY,CACX4D,EAAY,EACb,GAEDD,EAAW,YAAYE,CAAQ,EAC/BF,EAAW,cAAa,EACxB,MAAMlI,GAAa,CAClB,SAAO,CACNkI,EAAW,eAAeE,CAAQ,CACnC,GAGD,OAAI5H,aAAuBuD,EAAA,gBAC1BvD,EAAY,IAAIR,EAAU,EAChB,MAAM,QAAQQ,CAAW,GACnCA,EAAY,KAAKR,EAAU,EAGrBA,EACR,CACD,CAzCgB8D,EAAA,oBAAmBmE,EA0CpC,GArtBiBnE,IAAK1V,EAAA,MAAL0V,EAAK,CAAA,EAAA,EAmwBtB,MAAauE,CAAc,QAEV,KAAA,IAAM,IAAI,GAAsB,QAEjC,KAAA,QAAU,CAAE,CAU3B,YAAYjO,EAAY,CAPjB,KAAA,cAAwB,EACxB,KAAA,gBAAkB,EAClB,KAAA,eAAiB,EACjB,KAAA,UAAsB,CAAA,EAK5B,KAAK,KAAO,GAAGA,CAAI,IAAIiO,EAAe,SAAS,GAC/CA,EAAe,IAAI,IAAI,IAAI,CAC5B,CAEA,MAAMC,EAAqB,CAC1B,KAAK,WAAa,IAAIC,EAAA,UACtB,KAAK,cAAgBD,CACtB,CAEA,MAAI,CACH,GAAI,KAAK,WAAY,CACpB,MAAME,EAAU,KAAK,WAAW,QAAO,EACvC,KAAK,UAAU,KAAKA,CAAO,EAC3B,KAAK,gBAAkBA,EACvB,KAAK,iBAAmB,EACxB,KAAK,WAAa,MACnB,CACD,EAhCDpa,EAAA,eAAAia,EAmCA,IAAII,EAA8B,GAElC,MAAMC,CAAc,QAEJ,KAAA,QAAU,CAAE,CAK3B,YACkBC,EACRC,EACAxO,GAAgBsO,EAAe,WAAW,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAAC,CAF/D,KAAA,cAAAC,EACR,KAAA,UAAAC,EACA,KAAA,KAAAxO,EALF,KAAA,eAAyB,CAM7B,CAEJ,SAAO,CACN,KAAK,SAAS,MAAK,CACpB,CAEA,MAAM9Q,EAAmBgf,EAAqB,CAE7C,MAAMM,EAAY,KAAK,UACvB,GAAIA,GAAa,GAAKN,EAAgBM,EACrC,OAGI,KAAK,UACT,KAAK,QAAU,IAAI,KAEpB,MAAMhV,EAAS,KAAK,QAAQ,IAAItK,EAAM,KAAK,GAAK,EAIhD,GAHA,KAAK,QAAQ,IAAIA,EAAM,MAAOsK,EAAQ,CAAC,EACvC,KAAK,gBAAkB,EAEnB,KAAK,gBAAkB,EAAG,CAG7B,KAAK,eAAiBgV,EAAY,GAElC,KAAM,CAACC,EAAUC,CAAQ,EAAI,KAAK,qBAAoB,EAChD3a,EAAU,IAAI,KAAK,IAAI,8CAA8Cma,CAAa,+CAA+CQ,CAAQ,KAC/I,QAAQ,KAAK3a,CAAO,EACpB,QAAQ,KAAK0a,CAAS,EAEtB,MAAM7d,EAAQ,IAAI+d,EAAkB5a,EAAS0a,CAAQ,EACrD,KAAK,cAAc7d,CAAK,CACzB,CAEA,MAAO,IAAK,CACX,MAAM4I,EAAS,KAAK,QAAS,IAAItK,EAAM,KAAK,GAAK,EACjD,KAAK,QAAS,IAAIA,EAAM,MAAOsK,EAAQ,CAAC,CACzC,CACD,CAEA,sBAAoB,CACnB,GAAI,CAAC,KAAK,QACT,OAED,IAAIiV,EACAC,EAAmB,EACvB,SAAW,CAACxf,EAAOsK,CAAK,IAAK,KAAK,SAC7B,CAACiV,GAAYC,EAAWlV,KAC3BiV,EAAW,CAACvf,EAAOsK,CAAK,EACxBkV,EAAWlV,GAGb,OAAOiV,CACR,EAGD,MAAM3E,CAAU,CAEf,OAAO,QAAM,CACZ,MAAM/hB,EAAM,IAAI,MAChB,OAAO,IAAI+hB,EAAW/hB,EAAI,OAAS,EAAE,CACtC,CAEA,YAA6BH,EAAa,CAAb,KAAA,MAAAA,CAAiB,CAE9C,OAAK,CACJ,QAAQ,KAAK,KAAK,MAAM,MAAM;CAAI,EAAE,MAAM,CAAC,EAAE,KAAK;CAAI,CAAC,CACxD,EAID,MAAa+mB,UAA0B,KAAK,CAC3C,YAAY5a,EAAiB7E,EAAa,CACzC,MAAM6E,CAAO,EACb,KAAK,KAAO,oBACZ,KAAK,MAAQ7E,CACd,EALD8E,EAAA,kBAAA2a,EAUA,MAAaC,UAA6B,KAAK,CAC9C,YAAY7a,EAAiB7E,EAAa,CACzC,MAAM6E,CAAO,EACb,KAAK,KAAO,uBACZ,KAAK,MAAQ7E,CACd,EALD8E,EAAA,qBAAA4a,EAOA,MAAMC,CAAe,CAEpB,YAA4BjnB,EAAQ,CAAR,KAAA,MAAAA,CAAY,EAEzC,MAAMknB,EAAsB,EAKtBC,EAAkB,CAAIC,EAAmCnO,IAAyC,CACvG,GAAImO,aAAqBH,EACxBhO,EAAGmO,CAAS,MAEZ,SAASrmB,EAAI,EAAGA,EAAIqmB,EAAU,OAAQrmB,IAAK,CAC1C,MAAM8T,EAAIuS,EAAUrmB,CAAC,EACjB8T,GACHoE,EAAGpE,CAAC,CAEN,CAEF,EAGA,IAAIwS,EAEJ,GAAI1F,EAA4B,CAC/B,MAAM2F,EAAkB,CAAA,EAExB,YAAY,IAAK,CACZA,EAAM,SAAW,IAGrB,QAAQ,KAAK,uEAAwE,EACrF,QAAQ,KAAKA,EAAM,KAAK;CAAI,CAAC,EAC7BA,EAAM,OAAS,EAChB,EAAG,GAAI,EAEPD,EAAsB,IAAI,qBAAqBE,GAAY,CACtD,OAAOA,GAAc,UACxBD,EAAM,KAAKC,CAAS,CAEtB,CAAC,CACF,CAuBA,MAAalE,CAAO,CAmCnB,YAAYhjB,EAAwB,CAF1B,KAAA,MAAQ,EAGjB,KAAK,SAAWA,EAChB,KAAK,YAAeomB,EAA8B,GAAK,KAAK,UAAU,qBACnE,IAAIC,EAAermB,GAAS,iBAAmB0Y,EAAA,kBAAmB,KAAK,UAAU,sBAAwB0N,CAA2B,EACtI,OACD,KAAK,SAAW,KAAK,UAAU,UAAY,IAAIJ,EAAe,KAAK,SAAS,SAAS,EAAI,OACzF,KAAK,eAAiB,KAAK,UAAU,aACtC,CAEA,SAAO,CACN,GAAI,CAAC,KAAK,UAAW,CAgBpB,GAfA,KAAK,UAAY,GAYb,KAAK,gBAAgB,UAAY,MACpC,KAAK,eAAe,MAAK,EAEtB,KAAK,WAAY,CACpB,GAAIzE,EAAmC,CACtC,MAAMwF,EAAY,KAAK,WACvB,eAAe,IAAK,CACnBD,EAAgBC,EAAWvS,GAAKA,EAAE,OAAO,MAAK,CAAE,CACjD,CAAC,CACF,CAEA,KAAK,WAAa,OAClB,KAAK,MAAQ,CACd,CACA,KAAK,UAAU,0BAAyB,EACxC,KAAK,aAAa,QAAO,CAC1B,CACD,CAMA,IAAI,OAAK,CACR,YAAK,SAAW,CAAChV,EAAyB0iB,EAAgB/D,IAAiD,CAC1G,GAAI,KAAK,aAAe,KAAK,MAAQ,KAAK,YAAY,WAAa,EAAG,CACrE,MAAMrS,EAAU,IAAI,KAAK,YAAY,IAAI,+EAA+E,KAAK,KAAK,OAAO,KAAK,YAAY,SAAS,IACnK,QAAQ,KAAKA,CAAO,EAEpB,MAAMqb,EAAQ,KAAK,YAAY,qBAAoB,GAAM,CAAC,gBAAiB,EAAE,EACvExe,EAAQ,IAAIge,EAAqB,GAAG7a,CAAO,+CAA+Cqb,EAAM,CAAC,CAAC,UAAWA,EAAM,CAAC,CAAC,EAE3H,OADqB,KAAK,UAAU,iBAAmBzO,EAAA,mBAC1C/P,CAAK,EAEX+Y,EAAA,WAAW,IACnB,CAEA,GAAI,KAAK,UAER,OAAOA,EAAA,WAAW,KAGfQ,IACH1iB,EAAWA,EAAS,KAAK0iB,CAAQ,GAGlC,MAAMkF,EAAY,IAAIR,EAAgBpnB,CAAQ,EAE9C,IAAI6nB,EACApgB,EACA,KAAK,aAAe,KAAK,OAAS,KAAK,KAAK,KAAK,YAAY,UAAY,EAAG,IAE/EmgB,EAAU,MAAQvF,EAAW,OAAM,EACnCwF,EAAgB,KAAK,YAAY,MAAMD,EAAU,MAAO,KAAK,MAAQ,CAAC,GAGnE7F,IACH6F,EAAU,MAAQngB,GAAS4a,EAAW,OAAM,GAGxC,KAAK,WAIC,KAAK,sBAAsB+E,GACrC,KAAK,iBAAmB,IAAIU,EAC5B,KAAK,WAAa,CAAC,KAAK,WAAYF,CAAS,GAE7C,KAAK,WAAW,KAAKA,CAAS,GAP9B,KAAK,UAAU,yBAAyB,IAAI,EAC5C,KAAK,WAAaA,EAClB,KAAK,UAAU,wBAAwB,IAAI,GAQ5C,KAAK,QAGL,MAAMhpB,KAASsjB,EAAA,cAAa,IAAK,CAChCsF,GAAqB,WAAW5oB,CAAM,EACtCipB,IAAe,EACf,KAAK,gBAAgBD,CAAS,CAC/B,CAAC,EAOD,GANIjJ,aAAuBuD,EAAA,gBAC1BvD,EAAY,IAAI/f,CAAM,EACZ,MAAM,QAAQ+f,CAAW,GACnCA,EAAY,KAAK/f,CAAM,EAGpB4oB,EAAqB,CACxB,MAAM/f,EAAQ,IAAI,MAAK,EAAG,MAAO,MAAM;CAAI,EAAE,MAAM,EAAG,CAAC,EAAE,KAAK;CAAI,EAAE,KAAI,EAClEsgB,EAAQ,uDAAuD,KAAKtgB,CAAK,EAC/E+f,EAAoB,SAAS5oB,EAAQmpB,IAAQ,CAAC,GAAKtgB,EAAO7I,CAAM,CACjE,CAEA,OAAOA,CACR,EAEO,KAAK,MACb,CAEQ,gBAAgB0Z,EAA8B,CAGrD,GAFA,KAAK,UAAU,uBAAuB,IAAI,EAEtC,CAAC,KAAK,WACT,OAGD,GAAI,KAAK,QAAU,EAAG,CACrB,KAAK,WAAa,OAClB,KAAK,UAAU,0BAA0B,IAAI,EAC7C,KAAK,MAAQ,EACb,MACD,CAGA,MAAMiP,EAAY,KAAK,WAEjB7Y,EAAQ6Y,EAAU,QAAQjP,CAAQ,EACxC,GAAI5J,IAAU,GACb,cAAQ,IAAI,YAAa,KAAK,SAAS,EACvC,QAAQ,IAAI,QAAS,KAAK,KAAK,EAC/B,QAAQ,IAAI,OAAQ,KAAK,UAAU,KAAK,UAAU,CAAC,EAC7C,IAAI,MAAM,uCAAuC,EAGxD,KAAK,QACL6Y,EAAU7Y,CAAK,EAAI,OAEnB,MAAMsZ,EAAsB,KAAK,eAAgB,UAAY,KAC7D,GAAI,KAAK,MAAQX,GAAuBE,EAAU,OAAQ,CACzD,IAAIlZ,EAAI,EACR,QAASnN,EAAI,EAAGA,EAAIqmB,EAAU,OAAQrmB,IACjCqmB,EAAUrmB,CAAC,EACdqmB,EAAUlZ,GAAG,EAAIkZ,EAAUrmB,CAAC,EAClB8mB,IACV,KAAK,eAAgB,MACjB3Z,EAAI,KAAK,eAAgB,GAC5B,KAAK,eAAgB,KAIxBkZ,EAAU,OAASlZ,CACpB,CACD,CAEQ,SAASiK,EAA2DnY,EAAQ,CACnF,GAAI,CAACmY,EACJ,OAGD,MAAM2P,EAAe,KAAK,UAAU,iBAAmB/O,EAAA,kBACvD,GAAI,CAAC+O,EAAc,CAClB3P,EAAS,MAAMnY,CAAK,EACpB,MACD,CAEA,GAAI,CACHmY,EAAS,MAAMnY,CAAK,CACrB,OAASwC,EAAG,CACXslB,EAAatlB,CAAC,CACf,CACD,CAGQ,cAAculB,EAA6B,CAClD,MAAMX,EAAYW,EAAG,QAAS,WAC9B,KAAOA,EAAG,EAAIA,EAAG,KAEhB,KAAK,SAASX,EAAUW,EAAG,GAAG,EAAGA,EAAG,KAAU,EAE/CA,EAAG,MAAK,CACT,CAMA,KAAK3F,EAAQ,CAQZ,GAPI,KAAK,gBAAgB,UACxB,KAAK,cAAc,KAAK,cAAc,EACtC,KAAK,UAAU,KAAI,GAGpB,KAAK,UAAU,MAAM,KAAK,KAAK,EAE1B,KAAK,WAEH,GAAI,KAAK,sBAAsB6E,EACrC,KAAK,SAAS,KAAK,WAAY7E,CAAK,MAC9B,CACN,MAAM2F,EAAK,KAAK,eAChBA,EAAG,QAAQ,KAAM3F,EAAO,KAAK,WAAW,MAAM,EAC9C,KAAK,cAAc2F,CAAE,CACtB,CAEA,KAAK,UAAU,KAAI,CACpB,CAEA,cAAY,CACX,OAAO,KAAK,MAAQ,CACrB,EA/PD3b,EAAA,QAAAiX,EAqQO,MAAM2E,EAA2B,IAA0B,IAAIL,EAAzDvb,EAAA,yBAAwB4b,EAErC,MAAML,CAAyB,CAA/B,aAAA,CAKQ,KAAA,EAAI,GAKJ,KAAA,IAAM,CAuBd,CAZQ,QAAWvE,EAAqBpjB,EAAUioB,EAAW,CAC3D,KAAK,EAAI,EACT,KAAK,IAAMA,EACX,KAAK,QAAU7E,EACf,KAAK,MAAQpjB,CACd,CAEO,OAAK,CACX,KAAK,EAAI,KAAK,IACd,KAAK,QAAU,OACf,KAAK,MAAQ,MACd,EAID,MAAakoB,UAA4B7E,CAAU,CAMlD,YAAYhjB,EAAwD,CACnE,MAAMA,CAAO,EALN,KAAA,UAAY,EACV,KAAA,YAAc,IAAI8nB,EAAA,WAK3B,KAAK,SAAW9nB,GAAS,KAC1B,CAEA,OAAK,CACJ,KAAK,WACN,CAEA,QAAM,CACL,GAAI,KAAK,YAAc,GAAK,EAAE,KAAK,YAAc,EAChD,GAAI,KAAK,UAGR,GAAI,KAAK,YAAY,KAAO,EAAG,CAC9B,MAAM0iB,EAAS,MAAM,KAAK,KAAK,WAAW,EAC1C,KAAK,YAAY,MAAK,EACtB,MAAM,KAAK,KAAK,SAASA,CAAM,CAAC,CACjC,MAKA,MAAO,CAAC,KAAK,WAAa,KAAK,YAAY,OAAS,GACnD,MAAM,KAAK,KAAK,YAAY,MAAK,CAAG,CAIxC,CAES,KAAKX,EAAQ,CACjB,KAAK,QACJ,KAAK,YAAc,EACtB,KAAK,YAAY,KAAKA,CAAK,EAE3B,MAAM,KAAKA,CAAK,EAGnB,EA5CDhW,EAAA,iBAAA8b,EA+CA,MAAaE,UAA2BF,CAAmB,CAK1D,YAAY7nB,EAAsE,CACjF,MAAMA,CAAO,EACb,KAAK,OAASA,EAAQ,OAAS,GAChC,CAES,KAAK+hB,EAAQ,CAChB,KAAK,UACT,KAAK,MAAK,EACV,KAAK,QAAU,WAAW,IAAK,CAC9B,KAAK,QAAU,OACf,KAAK,OAAM,CACZ,EAAG,KAAK,MAAM,GAEf,MAAM,KAAKA,CAAK,CACjB,EAnBDhW,EAAA,gBAAAgc,EA0BA,MAAaC,UAA4BhF,CAAU,CAIlD,YAAYhjB,EAAwD,CACnE,MAAMA,CAAO,EAJN,KAAA,cAAqB,CAAA,EAK5B,KAAK,SAAWA,GAAS,KAC1B,CACS,KAAK+hB,EAAQ,CAEhB,KAAK,aAAY,IAItB,KAAK,cAAc,KAAKA,CAAK,EACzB,KAAK,cAAc,SAAW,GACjC,eAAe,IAAK,CACf,KAAK,SACR,MAAM,KAAK,KAAK,SAAS,KAAK,aAAa,CAAC,EAE5C,KAAK,cAAc,QAAQ5f,GAAK,MAAM,KAAKA,CAAC,CAAC,EAE9C,KAAK,cAAgB,CAAA,CACtB,CAAC,EAEH,EAzBD4J,EAAA,iBAAAic,EAmDA,MAAaC,CAAgB,CAM5B,aAAA,CAHQ,KAAA,aAAe,GACf,KAAA,OAA8D,CAAA,EAGrE,KAAK,QAAU,IAAIjF,EAAW,CAC7B,uBAAwB,IAAM,KAAK,mBAAkB,EACrD,wBAAyB,IAAM,KAAK,qBAAoB,EACxD,CACF,CAEA,IAAI,OAAK,CACR,OAAO,KAAK,QAAQ,KACrB,CAEA,IAAIjB,EAAe,CAClB,MAAM5f,EAAI,CAAE,MAAO4f,EAAO,SAAU,IAAI,EACxC,KAAK,OAAO,KAAK5f,CAAC,EAEd,KAAK,cACR,KAAK,KAAKA,CAAC,EAGZ,MAAM8a,EAAU,IAAK,CAChB,KAAK,cACR,KAAK,OAAO9a,CAAC,EAGd,MAAM6Q,EAAM,KAAK,OAAO,QAAQ7Q,CAAC,EACjC,KAAK,OAAO,OAAO6Q,EAAK,CAAC,CAC1B,EAEA,SAAO0O,EAAA,iBAAarD,EAAA,0BAAyBpB,CAAO,CAAC,CACtD,CAEQ,oBAAkB,CACzB,KAAK,aAAe,GACpB,KAAK,OAAO,QAAQ9a,GAAK,KAAK,KAAKA,CAAC,CAAC,CACtC,CAEQ,sBAAoB,CAC3B,KAAK,aAAe,GACpB,KAAK,OAAO,QAAQA,GAAK,KAAK,OAAOA,CAAC,CAAC,CACxC,CAEQ,KAAKA,EAAoD,CAChEA,EAAE,SAAWA,EAAE,MAAM6D,GAAK,KAAK,QAAQ,KAAKA,CAAC,CAAC,CAC/C,CAEQ,OAAO7D,EAAoD,CAClEA,EAAE,UAAU,QAAO,EACnBA,EAAE,SAAW,IACd,CAEA,SAAO,CACN,KAAK,QAAQ,QAAO,EAEpB,UAAWA,KAAK,KAAK,OACpBA,EAAE,UAAU,QAAO,EAEpB,KAAK,OAAS,CAAA,CACf,EA/DD4J,EAAA,iBAAAkc,EAsFA,MAAaC,CAAa,CAA1B,aAAA,CAES,KAAA,KAAkC,CAAA,CAkE3C,CA7DC,UAAgBnG,EAAiB9H,EAAuD4I,EAAW,CAClG,MAAO,CAAC/K,EAAUoK,EAAW/D,IACrB4D,EAAMrhB,GAAI,CAChB,MAAMkD,EAAO,KAAK,KAAK,KAAK,KAAK,OAAS,CAAC,EAG3C,GAAI,CAACqW,EAAQ,CAERrW,EACHA,EAAK,QAAQ,KAAK,IAAMkU,EAAS,KAAKoK,EAAUxhB,CAAC,CAAC,EAGlDoX,EAAS,KAAKoK,EAAUxhB,CAAC,EAE1B,MACD,CAGA,MAAMynB,EAAavkB,EAYnB,GAAI,CAACukB,EAAY,CAEhBrQ,EAAS,KAAKoK,EAAUjI,EAAO4I,EAASniB,CAAC,CAAC,EAC1C,MACD,CAGAynB,EAAW,QAAU,CAAA,EACrBA,EAAW,MAAM,KAAKznB,CAAC,EACnBynB,EAAW,QAAQ,SAAW,GAEjCvkB,EAAK,QAAQ,KAAK,IAAK,CAEtBukB,EAAW,gBAAkBtF,EAC1BsF,EAAW,MAAO,OAAOlO,EAAgD4I,CAAO,EAChFsF,EAAW,MAAO,OAAOlO,CAA8C,EAC1EnC,EAAS,KAAKoK,EAAUiG,EAAW,aAAa,CACjD,CAAC,CAEH,EAAG,OAAWhK,CAAW,CAE3B,CAEA,aAAuBvF,EAAW,CACjC,MAAMhV,EAAO,CAAE,QAAS,IAAI,KAAiB,EAC7C,KAAK,KAAK,KAAKA,CAAI,EACnB,MAAMoC,EAAI4S,EAAE,EACZ,YAAK,KAAK,IAAG,EACbhV,EAAK,QAAQ,QAAQ0gB,GAASA,EAAK,CAAE,EAC9Bte,CACR,EAnED+F,EAAA,cAAAmc,EA4EA,MAAaE,CAAK,CAAlB,aAAA,CAES,KAAA,UAAY,GACZ,KAAA,WAAuB3G,EAAM,KAC7B,KAAA,mBAAkCC,EAAA,WAAW,KAEpC,KAAA,QAAU,IAAIsB,EAAW,CACzC,sBAAuB,IAAK,CAC3B,KAAK,UAAY,GACjB,KAAK,mBAAqB,KAAK,WAAW,KAAK,QAAQ,KAAM,KAAK,OAAO,CAC1E,EACA,wBAAyB,IAAK,CAC7B,KAAK,UAAY,GACjB,KAAK,mBAAmB,QAAO,CAChC,EACA,EAEQ,KAAA,MAAkB,KAAK,QAAQ,KAezC,CAbC,IAAI,MAAMjB,EAAe,CACxB,KAAK,WAAaA,EAEd,KAAK,YACR,KAAK,mBAAmB,QAAO,EAC/B,KAAK,mBAAqBA,EAAM,KAAK,QAAQ,KAAM,KAAK,OAAO,EAEjE,CAEA,SAAO,CACN,KAAK,mBAAmB,QAAO,EAC/B,KAAK,QAAQ,QAAO,CACrB,EA/BDhW,EAAA,MAAAqc,0JC96CArc,EAAA,gBAAAsc,EArHA,MAAMC,EAA4B,OAAO,OAAO,SAAU9oB,EAAU+oB,EAAQ,CAC3E,MAAMhF,EAAS,WAAW/jB,EAAS,KAAK+oB,CAAO,EAAG,CAAC,EACnD,MAAO,CAAE,SAAO,CAAK,aAAahF,CAAM,CAAG,CAAC,CAC7C,CAAC,EAED,IAAiBiF,GAAjB,SAAiBA,EAAiB,CAEjC,SAAgBC,EAAoBvP,EAAc,CAIjD,OAHIA,IAAUsP,EAAkB,MAAQtP,IAAUsP,EAAkB,WAGhEtP,aAAiBwP,EACb,GAEJ,CAACxP,GAAS,OAAOA,GAAU,SACvB,GAED,OAAQA,EAA4B,yBAA4B,WACnE,OAAQA,EAA4B,yBAA4B,UACrE,CAZgBsP,EAAA,oBAAmBC,EAetBD,EAAA,KAAO,OAAO,OAA0B,CACpD,wBAAyB,GACzB,wBAAyBG,EAAA,MAAM,KAC/B,EAEYH,EAAA,UAAY,OAAO,OAA0B,CACzD,wBAAyB,GACzB,wBAAyBF,EACzB,CACF,GA1BiBE,IAAiBzc,EAAA,kBAAjByc,EAAiB,CAAA,EAAA,EA4BlC,MAAME,CAAY,CAAlB,aAAA,CAES,KAAA,aAAwB,GACxB,KAAA,SAAgC,IAgCzC,CA9BQ,QAAM,CACP,KAAK,eACT,KAAK,aAAe,GAChB,KAAK,WACR,KAAK,SAAS,KAAK,MAAS,EAC5B,KAAK,QAAO,GAGf,CAEA,IAAI,yBAAuB,CAC1B,OAAO,KAAK,YACb,CAEA,IAAI,yBAAuB,CAC1B,OAAI,KAAK,aACDJ,GAEH,KAAK,WACT,KAAK,SAAW,IAAIK,EAAA,SAEd,KAAK,SAAS,MACtB,CAEO,SAAO,CACT,KAAK,WACR,KAAK,SAAS,QAAO,EACrB,KAAK,SAAW,KAElB,EAGD,MAAaC,CAAuB,CAKnC,YAAYnL,EAA0B,CAH9B,KAAA,OAA6B,OAC7B,KAAA,gBAAgC,OAGvC,KAAK,gBAAkBA,GAAUA,EAAO,wBAAwB,KAAK,OAAQ,IAAI,CAClF,CAEA,IAAI,OAAK,CACR,OAAK,KAAK,SAGT,KAAK,OAAS,IAAIiL,GAEZ,KAAK,MACb,CAEA,QAAM,CACA,KAAK,OAMC,KAAK,kBAAkBA,GAEjC,KAAK,OAAO,OAAM,EAJlB,KAAK,OAASF,EAAkB,SAMlC,CAEA,QAAQK,EAAkB,GAAK,CAC1BA,GACH,KAAK,OAAM,EAEZ,KAAK,iBAAiB,QAAO,EACxB,KAAK,OAIC,KAAK,kBAAkBH,GAEjC,KAAK,OAAO,QAAO,EAJnB,KAAK,OAASF,EAAkB,IAMlC,EA5CDzc,EAAA,wBAAA6c,EA+CA,SAAgBP,EAAgBpF,EAAsB,CACrD,MAAM3d,EAAS,IAAIsjB,EACnB,OAAA3F,EAAM,IAAI,CAAE,SAAO,CAAK3d,EAAO,OAAM,CAAI,CAAC,CAAE,EACrCA,EAAO,KACf,wQCzIAyG,EAAA,oBAAA+c,EAeA/c,EAAA,OAAA8K,EAkBA9K,EAAA,yBAAAgd,EAiBAhd,EAAA,OAAAid,EAcAjd,EAAA,uBAAAkd,EASAld,EAAA,KAAAmd,EAUAnd,EAAA,MAAAod,EAuBApd,EAAA,MAAAqd,EA6BArd,EAAA,4BAAAsd,EAIAtd,EAAA,eAAAud,EAYAvd,EAAA,aAAAwd,EAgCAxd,EAAA,yBAAAyd,EAaAzd,EAAA,WAAA0d,EAIA1d,EAAA,4BAAA2d,EAaA3d,EAAA,wBAAA4d,EAcA5d,EAAA,qBAAA6d,EAcA7d,EAAA,uBAAA8d,EAUA9d,EAAA,QAAA6C,EAUA7C,EAAA,iBAAA+d,EAoBA/d,EAAA,kBAAAge,EAIAhe,EAAA,2BAAAie,EA+CAje,EAAA,aAAAke,EAIAle,EAAA,mBAAAme,EAIAne,EAAA,mBAAAoe,EAIApe,EAAA,iBAAAqe,EAIAre,EAAA,qBAAAse,EAYAte,EAAA,mBAAAue,EAiBAve,EAAA,mBAAAwe,EAoBAxe,EAAA,gBAAAye,EAOAze,EAAA,eAAA0e,EAOA1e,EAAA,iBAAA2e,EAOA3e,EAAA,iBAAA4e,EAqHA5e,EAAA,eAAA6e,EAKA7e,EAAA,eAAA8e,EAKA9e,EAAA,wBAAA+e,EAmBA/e,EAAA,YAAAgf,GAYAhf,EAAA,aAAAif,GAQAjf,EAAA,+BAAAkf,EAIAlf,EAAA,qBAAAmf,GAkDAnf,EAAA,iBAAAof,GAeApf,EAAA,kBAAAqf,GAIArf,EAAA,2BAAAsf,GAeAtf,EAAA,iBAAAuf,GA6KAvf,EAAA,oBAAAwf,GA70BA,SAAgBzC,EAAoB3hB,EAAuB,CAC1D,MAAI,CAACA,GAAO,OAAOA,GAAQ,SACnB,GAEDA,EAAI,KAAI,EAAG,SAAW,CAC9B,CAEA,MAAMqkB,EAAgB,WAQtB,SAAgB3U,EAAOlX,KAAkBoE,EAAW,CACnD,OAAIA,EAAK,SAAW,EACZpE,EAEDA,EAAM,QAAQ6rB,EAAe,SAAUjE,EAAOkE,EAAK,CACzD,MAAMzY,EAAM,SAASyY,EAAO,EAAE,EAC9B,OAAO,MAAMzY,CAAG,GAAKA,EAAM,GAAKA,GAAOjP,EAAK,OAC3CwjB,EACAxjB,EAAKiP,CAAG,CACV,CAAC,CACF,CAQA,SAAgB+V,EAAyBppB,EAAa,CACrD,OAAOA,EAAM,QAAQ,WAAY+rB,GAAK,CACrC,OAAQA,EAAI,CACX,IAAK,IAAK,MAAO,OACjB,IAAK,IAAK,MAAO,OACjB,IAAK,IAAK,MAAO,SACjB,IAAK,IAAM,MAAO,SAClB,IAAK,IAAK,MAAO,OAClB,CACA,OAAOA,CACR,CAAC,CACF,CAMA,SAAgB1C,EAAO2C,EAAY,CAClC,OAAOA,EAAK,QAAQ,SAAU,SAAUpE,EAAK,CAC5C,OAAQA,EAAO,CACd,IAAK,IAAK,MAAO,OACjB,IAAK,IAAK,MAAO,OACjB,IAAK,IAAK,MAAO,QACjB,QAAS,OAAOA,CACjB,CACD,CAAC,CACF,CAKA,SAAgB0B,EAAuBtpB,EAAa,CACnD,OAAOA,EAAM,QAAQ,kCAAmC,MAAM,CAC/D,CAOA,SAAgBupB,EAAK9pB,EAAkBC,EAAiB,IAAG,CAC1D,MAAMusB,EAAUzC,EAAM/pB,EAAUC,CAAM,EACtC,OAAO+pB,EAAMwC,EAASvsB,CAAM,CAC7B,CAOA,SAAgB8pB,EAAM/pB,EAAkBC,EAAc,CACrD,GAAI,CAACD,GAAY,CAACC,EACjB,OAAOD,EAGR,MAAMysB,EAAYxsB,EAAO,OACzB,GAAIwsB,IAAc,GAAKzsB,EAAS,SAAW,EAC1C,OAAOA,EAGR,IAAI0sB,EAAS,EAEb,KAAO1sB,EAAS,QAAQC,EAAQysB,CAAM,IAAMA,GAC3CA,EAASA,EAASD,EAEnB,OAAOzsB,EAAS,UAAU0sB,CAAM,CACjC,CAOA,SAAgB1C,EAAMhqB,EAAkBC,EAAc,CACrD,GAAI,CAACD,GAAY,CAACC,EACjB,OAAOD,EAGR,MAAMysB,EAAYxsB,EAAO,OACxB0sB,EAAc3sB,EAAS,OAExB,GAAIysB,IAAc,GAAKE,IAAgB,EACtC,OAAO3sB,EAGR,IAAI0sB,EAASC,EACZ/Y,GAAM,GAEP,KACCA,GAAM5T,EAAS,YAAYC,EAAQysB,EAAS,CAAC,EACzC,EAAA9Y,KAAQ,IAAMA,GAAM6Y,IAAcC,IAF1B,CAKZ,GAAI9Y,KAAQ,EACX,MAAO,GAER8Y,EAAS9Y,EACV,CAEA,OAAO5T,EAAS,UAAU,EAAG0sB,CAAM,CACpC,CAEA,SAAgBzC,EAA4BpjB,EAAe,CAC1D,OAAOA,EAAQ,QAAQ,wCAAyC,MAAM,EAAE,QAAQ,QAAS,IAAI,CAC9F,CAEA,SAAgBqjB,EAAerjB,EAAe,CAC7C,OAAOA,EAAQ,QAAQ,MAAO,EAAE,CACjC,CAUA,SAAgBsjB,EAAayC,EAAsBC,EAAkBjsB,EAAyB,CAAA,EAAE,CAC/F,GAAI,CAACgsB,EACJ,MAAM,IAAI,MAAM,uCAAuC,EAEnDC,IACJD,EAAe/C,EAAuB+C,CAAY,GAE/ChsB,EAAQ,YACN,KAAK,KAAKgsB,EAAa,OAAO,CAAC,CAAC,IACpCA,EAAe,MAAQA,GAEnB,KAAK,KAAKA,EAAa,OAAOA,EAAa,OAAS,CAAC,CAAC,IAC1DA,EAAeA,EAAe,QAGhC,IAAIE,EAAY,GAChB,OAAIlsB,EAAQ,SACXksB,GAAa,KAETlsB,EAAQ,YACZksB,GAAa,KAEVlsB,EAAQ,YACXksB,GAAa,KAEVlsB,EAAQ,UACXksB,GAAa,KAGP,IAAI,OAAOF,EAAcE,CAAS,CAC1C,CAEA,SAAgB1C,EAAyB2C,EAAc,CAGtD,OAAIA,EAAO,SAAW,KAAOA,EAAO,SAAW,MAAQA,EAAO,SAAW,KAAOA,EAAO,SAAW,SAC1F,GAMD,CAAC,EADMA,EAAO,KAAK,EAAE,GACTA,EAAO,YAAc,EACzC,CAEA,SAAgB1C,EAAWtiB,EAAW,CACrC,OAAOA,EAAI,MAAM,YAAY,CAC9B,CAEA,SAAgBuiB,EAA4BviB,EAAW,CACtD,MAAMilB,EAAgC,CAAA,EAChCC,EAA0BllB,EAAI,MAAM,cAAc,EACxD,QAASzG,EAAI,EAAGA,EAAI,KAAK,KAAK2rB,EAAwB,OAAS,CAAC,EAAG3rB,IAClE0rB,EAAoB,KAAKC,EAAwB,EAAI3rB,CAAC,GAAK2rB,EAAwB,EAAI3rB,EAAI,CAAC,GAAK,GAAG,EAErG,OAAO0rB,CACR,CAMA,SAAgBzC,EAAwBxiB,EAAW,CAClD,QAASzG,EAAI,EAAGrC,EAAM8I,EAAI,OAAQzG,EAAIrC,EAAKqC,IAAK,CAC/C,MAAM4rB,EAASnlB,EAAI,WAAWzG,CAAC,EAC/B,GAAI4rB,IAAM,IAAuBA,IAAM,EACtC,OAAO5rB,CAET,CACA,MAAO,EACR,CAMA,SAAgBkpB,EAAqBziB,EAAa+I,EAAgB,EAAG0X,EAAczgB,EAAI,OAAM,CAC5F,QAASzG,EAAIwP,EAAOxP,EAAIknB,EAAKlnB,IAAK,CACjC,MAAM4rB,EAASnlB,EAAI,WAAWzG,CAAC,EAC/B,GAAI4rB,IAAM,IAAuBA,IAAM,EACtC,OAAOnlB,EAAI,UAAU+I,EAAOxP,CAAC,CAE/B,CACA,OAAOyG,EAAI,UAAU+I,EAAO0X,CAAG,CAChC,CAMA,SAAgBiC,EAAuB1iB,EAAaolB,EAAqBplB,EAAI,OAAS,EAAC,CACtF,QAASzG,EAAI6rB,EAAY7rB,GAAK,EAAGA,IAAK,CACrC,MAAM4rB,EAASnlB,EAAI,WAAWzG,CAAC,EAC/B,GAAI4rB,IAAM,IAAuBA,IAAM,EACtC,OAAO5rB,CAET,CACA,MAAO,EACR,CAEA,SAAgBkO,EAAQ/N,EAAWC,EAAS,CAC3C,OAAID,EAAIC,EACA,GACGD,EAAIC,EACP,EAEA,CAET,CAEA,SAAgBgpB,EAAiBjpB,EAAWC,EAAW0rB,EAAiB,EAAGC,EAAe5rB,EAAE,OAAQ6rB,EAAiB,EAAGC,GAAe7rB,EAAE,OAAM,CAC9I,KAAO0rB,EAASC,GAAQC,EAASC,GAAMH,IAAUE,IAAU,CAC1D,MAAME,GAAQ/rB,EAAE,WAAW2rB,CAAM,EAC3BK,GAAQ/rB,EAAE,WAAW4rB,CAAM,EACjC,GAAIE,GAAQC,GACX,MAAO,GACD,GAAID,GAAQC,GAClB,MAAO,EAET,CACA,MAAMC,GAAOL,EAAOD,EACdO,GAAOJ,GAAOD,EACpB,OAAII,GAAOC,GACH,GACGD,GAAOC,GACV,EAED,CACR,CAEA,SAAgBhD,EAAkBlpB,EAAWC,EAAS,CACrD,OAAOkpB,EAA2BnpB,EAAGC,EAAG,EAAGD,EAAE,OAAQ,EAAGC,EAAE,MAAM,CACjE,CAEA,SAAgBkpB,EAA2BnpB,EAAWC,EAAW0rB,EAAiB,EAAGC,EAAe5rB,EAAE,OAAQ6rB,EAAiB,EAAGC,GAAe7rB,EAAE,OAAM,CAExJ,KAAO0rB,EAASC,GAAQC,EAASC,GAAMH,IAAUE,IAAU,CAE1D,IAAIE,GAAQ/rB,EAAE,WAAW2rB,CAAM,EAC3BK,GAAQ/rB,EAAE,WAAW4rB,CAAM,EAE/B,GAAIE,KAAUC,GAEb,SAGD,GAAID,IAAS,KAAOC,IAAS,IAE5B,OAAO/C,EAAiBjpB,EAAE,YAAW,EAAIC,EAAE,YAAW,EAAI0rB,EAAQC,EAAMC,EAAQC,EAAI,EAKjFzC,EAAmB0C,EAAK,IAC3BA,IAAS,IAEN1C,EAAmB2C,EAAK,IAC3BA,IAAS,IAIV,MAAMG,GAAOJ,GAAQC,GACrB,GAAIG,KAAS,EAIb,OAAOA,EACR,CAEA,MAAMF,GAAOL,EAAOD,EACdO,GAAOJ,GAAOD,EAEpB,OAAII,GAAOC,GACH,GACGD,GAAOC,GACV,EAGD,CACR,CAEA,SAAgB9C,EAAagD,EAAY,CACxC,OAAOA,GAAI,IAAuBA,GAAI,EACvC,CAEA,SAAgB/C,EAAmB+C,EAAY,CAC9C,OAAOA,GAAI,IAAkBA,GAAI,GAClC,CAEA,SAAgB9C,EAAmB8C,EAAY,CAC9C,OAAOA,GAAI,IAAkBA,GAAI,EAClC,CAEA,SAAgB7C,EAAiBvpB,EAAWC,EAAS,CACpD,OAAOD,EAAE,SAAWC,EAAE,QAAUkpB,EAA2BnpB,EAAGC,CAAC,IAAM,CACtE,CAEA,SAAgBupB,EAAqBljB,EAAa+lB,EAAiB,CAClE,MAAMC,EAAkBD,EAAU,OAClC,OAAIA,EAAU,OAAS/lB,EAAI,OACnB,GAGD6iB,EAA2B7iB,EAAK+lB,EAAW,EAAGC,CAAe,IAAM,CAC3E,CAKA,SAAgB7C,EAAmBzpB,EAAWC,EAAS,CAEtD,MAAMzC,EAAM,KAAK,IAAIwC,EAAE,OAAQC,EAAE,MAAM,EACvC,IAAIJ,EAEJ,IAAKA,EAAI,EAAGA,EAAIrC,EAAKqC,IACpB,GAAIG,EAAE,WAAWH,CAAC,IAAMI,EAAE,WAAWJ,CAAC,EACrC,OAAOA,EAIT,OAAOrC,CACR,CAKA,SAAgBksB,EAAmB1pB,EAAWC,EAAS,CAEtD,MAAMzC,EAAM,KAAK,IAAIwC,EAAE,OAAQC,EAAE,MAAM,EACvC,IAAIJ,EAEJ,MAAM0sB,EAAavsB,EAAE,OAAS,EACxBwsB,GAAavsB,EAAE,OAAS,EAE9B,IAAKJ,EAAI,EAAGA,EAAIrC,EAAKqC,IACpB,GAAIG,EAAE,WAAWusB,EAAa1sB,CAAC,IAAMI,EAAE,WAAWusB,GAAa3sB,CAAC,EAC/D,OAAOA,EAIT,OAAOrC,CACR,CAKA,SAAgBmsB,EAAgBxT,EAAgB,CAC/C,MAAQ,QAAUA,GAAYA,GAAY,KAC3C,CAKA,SAAgByT,EAAezT,EAAgB,CAC9C,MAAQ,QAAUA,GAAYA,GAAY,KAC3C,CAKA,SAAgB0T,EAAiB4C,EAAuBC,EAAoB,CAC3E,OAASD,EAAgB,OAAW,KAAOC,EAAe,OAAU,KACrE,CAKA,SAAgB5C,EAAiBxjB,EAAa9I,EAAaytB,EAAc,CACxE,MAAM9U,EAAW7P,EAAI,WAAW2kB,CAAM,EACtC,GAAItB,EAAgBxT,CAAQ,GAAK8U,EAAS,EAAIztB,EAAK,CAClD,MAAMmvB,EAAermB,EAAI,WAAW2kB,EAAS,CAAC,EAC9C,GAAIrB,EAAe+C,CAAY,EAC9B,OAAO9C,EAAiB1T,EAAUwW,CAAY,CAEhD,CACA,OAAOxW,CACR,CAKA,SAASyW,EAAiBtmB,EAAa2kB,EAAc,CACpD,MAAM9U,EAAW7P,EAAI,WAAW2kB,EAAS,CAAC,EAC1C,GAAIrB,EAAezT,CAAQ,GAAK8U,EAAS,EAAG,CAC3C,MAAM4B,EAAevmB,EAAI,WAAW2kB,EAAS,CAAC,EAC9C,GAAItB,EAAgBkD,CAAY,EAC/B,OAAOhD,EAAiBgD,EAAc1W,CAAQ,CAEhD,CACA,OAAOA,CACR,CAEA,MAAa2W,CAAiB,CAM7B,IAAW,QAAM,CAChB,OAAO,KAAK,OACb,CAEA,YAAYxmB,EAAa2kB,EAAiB,EAAC,CAC1C,KAAK,KAAO3kB,EACZ,KAAK,KAAOA,EAAI,OAChB,KAAK,QAAU2kB,CAChB,CAEO,UAAUA,EAAc,CAC9B,KAAK,QAAUA,CAChB,CAEO,eAAa,CACnB,MAAM8B,EAAYH,EAAiB,KAAK,KAAM,KAAK,OAAO,EAC1D,YAAK,SAAYG,GAAS,MAAkD,EAAI,EACzEA,CACR,CAEO,eAAa,CACnB,MAAMA,EAAYjD,EAAiB,KAAK,KAAM,KAAK,KAAM,KAAK,OAAO,EACrE,YAAK,SAAYiD,GAAS,MAAkD,EAAI,EACzEA,CACR,CAEO,KAAG,CACT,OAAQ,KAAK,SAAW,KAAK,IAC9B,EAlCD7hB,EAAA,kBAAA4hB,EAqCA,MAAaE,CAAgB,CAI5B,IAAW,QAAM,CAChB,OAAO,KAAK,UAAU,MACvB,CAEA,YAAY1mB,EAAa2kB,EAAiB,EAAC,CAC1C,KAAK,UAAY,IAAI6B,EAAkBxmB,EAAK2kB,CAAM,CACnD,CAEO,oBAAkB,CACxB,MAAMgC,EAAoBC,GAAkB,YAAW,EACjDvT,EAAW,KAAK,UAChBwT,EAAgBxT,EAAS,OAE/B,IAAIyT,EAAoBH,EAAkB,qBAAqBtT,EAAS,cAAa,CAAE,EACvF,KAAO,CAACA,EAAS,IAAG,GAAI,CACvB,MAAMsR,GAAStR,EAAS,OAClB0T,GAAwBJ,EAAkB,qBAAqBtT,EAAS,cAAa,CAAE,EAC7F,GAAI2T,GAA8BF,EAAmBC,EAAqB,EAAG,CAE5E1T,EAAS,UAAUsR,EAAM,EACzB,KACD,CACAmC,EAAoBC,EACrB,CACA,OAAQ1T,EAAS,OAASwT,CAC3B,CAEO,oBAAkB,CACxB,MAAMF,EAAoBC,GAAkB,YAAW,EACjDvT,EAAW,KAAK,UAChBwT,EAAgBxT,EAAS,OAE/B,IAAIyT,EAAoBH,EAAkB,qBAAqBtT,EAAS,cAAa,CAAE,EACvF,KAAOA,EAAS,OAAS,GAAG,CAC3B,MAAMsR,GAAStR,EAAS,OAClB4T,GAAwBN,EAAkB,qBAAqBtT,EAAS,cAAa,CAAE,EAC7F,GAAI2T,GAA8BC,GAAuBH,CAAiB,EAAG,CAE5EzT,EAAS,UAAUsR,EAAM,EACzB,KACD,CACAmC,EAAoBG,EACrB,CACA,OAAQJ,EAAgBxT,EAAS,MAClC,CAEO,KAAG,CACT,OAAO,KAAK,UAAU,IAAG,CAC1B,EApDDzO,EAAA,iBAAA8hB,EAuDA,SAAgBjD,EAAezjB,EAAa6mB,EAAqB,CAEhE,OADiB,IAAIH,EAAiB1mB,EAAK6mB,CAAa,EACxC,mBAAkB,CACnC,CAEA,SAAgBnD,EAAe1jB,EAAa6mB,EAAqB,CAEhE,OADiB,IAAIH,EAAiB1mB,EAAK6mB,CAAa,EACxC,mBAAkB,CACnC,CAEA,SAAgBlD,EAAwB3jB,EAAa2kB,EAAc,CAC9DA,EAAS,GAAKrB,EAAetjB,EAAI,WAAW2kB,CAAM,CAAC,GACtDA,IAED,MAAMuC,EAAYvC,EAASlB,EAAezjB,EAAK2kB,CAAM,EAErD,MAAO,CADauC,EAAYxD,EAAe1jB,EAAKknB,CAAS,EACxCA,CAAS,CAC/B,CAEA,IAAIC,GAEJ,SAASC,IAAe,CAEvB,MAAO,8jBACR,CAKA,SAAgBxD,GAAY5jB,EAAW,CACtC,OAAKmnB,KACJA,GAAeC,GAAe,GAGxBD,GAAa,KAAKnnB,CAAG,CAC7B,CAEA,MAAMqnB,GAAiB,uBAIvB,SAAgBxD,GAAa7jB,EAAW,CACvC,OAAOqnB,GAAe,KAAKrnB,CAAG,CAC/B,CAEa4E,EAAA,yBAA2B,iBAIxC,SAAgBkf,EAA+B9jB,EAAW,CACzD,OAAO4E,EAAA,yBAAyB,KAAK5E,CAAG,CACzC,CAEA,SAAgB+jB,GAAqBlU,EAAgB,CAuCpD,OACEA,GAAY,OAAUA,GAAY,OAC/BA,GAAY,OAAUA,GAAY,OAClCA,GAAY,OAAUA,GAAY,KAExC,CAMA,SAAgBmU,GAAiBlb,EAAS,CACzC,OACEA,GAAK,QAAWA,GAAK,QAAaA,IAAM,MAAUA,IAAM,MAAUA,IAAM,MACrEA,IAAM,MAAUA,GAAK,MAAQA,GAAK,OAAWA,IAAM,OAAWA,IAAM,OACpEA,GAAK,QAAUA,GAAK,QAAYA,GAAK,QAAUA,GAAK,QACpDA,GAAK,QAAUA,GAAK,QAAYA,GAAK,QAAUA,GAAK,QACpDA,GAAK,QAAUA,GAAK,MAE1B,CAKalE,EAAA,mBAAqB,SAElC,SAAgBqf,GAAkBjkB,EAAW,CAC5C,MAAO,CAAC,EAAEA,GAAOA,EAAI,OAAS,GAAKA,EAAI,WAAW,CAAC,IAAC,MACrD,CAEA,SAAgBkkB,GAA2Bzb,EAAgB6e,EAAqB,GAAK,CACpF,OAAK7e,GAID6e,IACH7e,EAASA,EAAO,QAAQ,OAAQ,EAAE,GAG5BA,EAAO,YAAW,IAAOA,GAPxB,EAQT,CAKA,SAAgB0b,GAAiBzd,EAAS,CAKzC,OAFAA,EAAIA,GAAK,EAAI,IAETA,EAAI,GACA,OAAO,aAAa,GAAaA,CAAC,EAGnC,OAAO,aAAa,GAAaA,EAAI,EAAW,CACxD,CAEA,SAASsgB,GAA8BO,EAA+BC,EAA6B,CAIlG,OAAID,IAAU,EAELC,IAAU,GAAiCA,IAAU,EAO1DD,IAAU,GACTC,IAAU,EACN,GAGLD,IAAU,GAAkCA,IAAU,GAA6BA,IAAU,GAG7FC,IAAU,GAAkCA,IAAU,GAA6BA,IAAU,EACzF,GAOJ,EAAAD,IAAU,IACTC,IAAU,GAA4BA,IAAU,GAA4BA,IAAU,IAA6BA,IAAU,MAI9HD,IAAU,IAA6BA,IAAU,KAChDC,IAAU,GAA4BA,IAAU,MAIjDD,IAAU,IAA8BA,IAAU,KACjDC,IAAU,IAOXA,IAAU,GAAiCA,IAAU,IAQrDA,IAAU,GAGVD,IAAU,GAMVA,IAAU,IAA8BC,IAAU,IAOlDD,IAAU,GAA6CC,IAAU,EAOtE,CAoBA,MAAMZ,EAAiB,QAEP,KAAA,UAAsC,IAAK,CACnD,OAAO,aAAW,CACxB,OAAKA,GAAkB,YACtBA,GAAkB,UAAY,IAAIA,IAE5BA,GAAkB,SAC1B,CAIA,aAAA,CACC,KAAK,MAAQa,GAAuB,CACrC,CAEO,qBAAqBhB,EAAiB,CAE5C,GAAIA,EAAY,GACf,OAAIA,IAAS,GACZ,EAEGA,IAAS,GACZ,EAED,EAGD,GAAIA,EAAY,IACf,MAAA,GAGD,MAAMhqB,EAAO,KAAK,MACZirB,EAAYjrB,EAAK,OAAS,EAChC,IAAIkrB,EAAY,EAChB,KAAOA,GAAaD,GACnB,GAAIjB,EAAYhqB,EAAK,EAAIkrB,CAAS,EAEjCA,EAAY,EAAIA,UACNlB,EAAYhqB,EAAK,EAAIkrB,EAAY,CAAC,EAE5CA,EAAY,EAAIA,EAAY,MAG5B,QAAOlrB,EAAK,EAAIkrB,EAAY,CAAC,EAI/B,MAAA,EACD,EAGD,SAASF,IAAuB,CAE/B,OAAO,KAAK,MAAM,y31BAAy31B,CAC541B,CAQA,SAAgBrD,GAAoBO,EAAgB3kB,EAAW,CAC9D,GAAI2kB,IAAW,EACd,MAAO,GAIR,MAAMiD,EAAcC,GAAkClD,EAAQ3kB,CAAG,EACjE,GAAI4nB,IAAgB,OACnB,OAAOA,EAIR,MAAMvU,EAAW,IAAImT,EAAkBxmB,EAAK2kB,CAAM,EAClD,OAAAtR,EAAS,cAAa,EACfA,EAAS,MACjB,CAEA,SAASwU,GAAkChB,EAAuB7mB,EAAW,CAG5E,MAAMqT,EAAW,IAAImT,EAAkBxmB,EAAK6mB,CAAa,EACzD,IAAIJ,EAAYpT,EAAS,cAAa,EAGtC,KAAQyU,GAAgBrB,CAAS,GAAKA,IAAS,OAAuCA,IAAS,MAAiC,CAC/H,GAAIpT,EAAS,SAAW,EAEvB,OAEDoT,EAAYpT,EAAS,cAAa,CACnC,CAGA,GAAI,CAAC2Q,GAAiByC,CAAS,EAE9B,OAGD,IAAIsB,EAAe1U,EAAS,OAE5B,OAAI0U,EAAe,GAIW1U,EAAS,cAAa,IAC3B,OACvB0U,EAAe1U,EAAS,QAInB0U,CACR,CAEA,SAASD,GAAgBrB,EAAiB,CACzC,MAAO,SAAWA,GAAaA,GAAa,MAC7C,CAgBa7hB,EAAA,kBAAoB,OAEjC,MAAaojB,CAAmB,QACP,KAAA,uBAAyB,IAAIC,EAAA,KAKnD,IAGM,KAAK,MACX,wvmBAAwxmB,CAEzxmB,CAAE,QAEqB,KAAA,MAAQ,IAAIC,EAAA,kBAGlC,CAAE,YAAa,KAAK,SAAS,EAAKC,GAAW,CAC9C,SAASC,EAAWzhB,GAAa,CAChC,MAAM1P,GAAS,IAAI,IACnB,QAASsC,GAAI,EAAGA,GAAIoN,GAAI,OAAQpN,IAAK,EACpCtC,GAAO,IAAI0P,GAAIpN,EAAC,EAAGoN,GAAIpN,GAAI,CAAC,CAAC,EAE9B,OAAOtC,EACR,CAEA,SAASoxB,EACRC,GACAC,GAAyB,CAEzB,MAAMtxB,GAAS,IAAI,IAAoBqxB,EAAI,EAC3C,SAAW,CAAChwB,GAAKE,EAAK,IAAK+vB,GAC1BtxB,GAAO,IAAIqB,GAAKE,EAAK,EAEtB,OAAOvB,EACR,CAEA,SAASuxB,EACRF,GACAC,GAAyB,CAEzB,GAAI,CAACD,GACJ,OAAOC,GAER,MAAMtxB,GAAS,IAAI,IACnB,SAAW,CAACqB,GAAKE,EAAK,IAAK8vB,GACtBC,GAAK,IAAIjwB,EAAG,GACfrB,GAAO,IAAIqB,GAAKE,EAAK,EAGvB,OAAOvB,EACR,CAEA,MAAMwF,GAAO,KAAK,uBAAuB,MAEzC,IAAIgsB,GAAkBN,EAAQ,OAC5B9a,IAAM,CAACA,GAAE,WAAW,GAAG,GAAKA,MAAK5Q,EAAI,EAEnCgsB,GAAgB,SAAW,IAC9BA,GAAkB,CAAC,UAAU,GAG9B,IAAIC,GACJ,UAAWC,MAAUF,GAAiB,CACrC,MAAM/V,GAAM0V,EAAW3rB,GAAKksB,EAAM,CAAC,EACnCD,GAAsBF,EAAcE,GAAqBhW,EAAG,CAC7D,CAEA,MAAMkW,GAAYR,EAAW3rB,GAAK,OAAU,EACtCiW,GAAM2V,EAAUO,GAAWF,EAAoB,EAErD,OAAO,IAAIV,EAAoBtV,EAAG,CACnC,CAAC,CAAE,CAEI,OAAO,YAAYyV,EAAoB,CAC7C,OAAOH,EAAoB,MAAM,IAAI,MAAM,KAAKG,CAAO,CAAC,CACzD,QAEe,KAAA,SAAW,IAAIF,EAAA,KAAe,IAC5C,OAAO,KAAKD,EAAoB,uBAAuB,KAAK,EAAE,OAC5Dhc,GAAM,CAACA,EAAE,WAAW,GAAG,CAAC,CACzB,CACA,CACK,OAAO,YAAU,CACvB,OAAOgc,EAAoB,SAAS,KACrC,CAEA,YACkBa,EAAyC,CAAzC,KAAA,qBAAAA,CACd,CAEG,YAAYpC,EAAiB,CACnC,OAAO,KAAK,qBAAqB,IAAIA,CAAS,CAC/C,CAMO,qBAAqBA,EAAiB,CAC5C,OAAO,KAAK,qBAAqB,IAAIA,CAAS,CAC/C,CAEO,yBAAuB,CAC7B,OAAO,IAAI,IAAI,KAAK,qBAAqB,KAAI,CAAE,CAChD,EAzGD7hB,EAAA,oBAAAojB,EA4GA,MAAac,CAAmB,CACvB,OAAO,YAAU,CAExB,OAAO,KAAK,MAAM,siGAAsiG,CACzjG,QAEe,KAAA,MAAiC,MAAU,CAElD,OAAO,SAAO,CACrB,OAAK,KAAK,QACT,KAAK,MAAQ,IAAI,IAAIA,EAAoB,WAAU,CAAE,GAE/C,KAAK,KACb,CAEO,OAAO,qBAAqBrC,EAAiB,CACnD,OAAOqC,EAAoB,QAAO,EAAG,IAAIrC,CAAS,CACnD,CAEO,WAAW,YAAU,CAC3B,OAAOqC,EAAoB,QAAO,CACnC,EArBDlkB,EAAA,oBAAAkkB,yHClgCAlkB,EAAA,KAAAjH,EAIAiH,EAAA,OAAAmkB,EAsBAnkB,EAAA,WAAAokB,EAQApkB,EAAA,WAAAqkB,EAoDArkB,EAAA,YAAAskB,EAtFA,SAAgBvrB,EAAKvF,EAAQ,CAC5B,OAAO2wB,EAAO3wB,EAAK,CAAC,CACrB,CAEA,SAAgB2wB,EAAO3wB,EAAU+wB,EAAe,CAC/C,OAAQ,OAAO/wB,EAAK,CACnB,IAAK,SACJ,OAAIA,IAAQ,KACJ4wB,EAAW,IAAKG,CAAO,EACpB,MAAM,QAAQ/wB,CAAG,EACpBgxB,EAAUhxB,EAAK+wB,CAAO,EAEvBE,EAAWjxB,EAAK+wB,CAAO,EAC/B,IAAK,SACJ,OAAOF,EAAW7wB,EAAK+wB,CAAO,EAC/B,IAAK,UACJ,OAAOG,EAAYlxB,EAAK+wB,CAAO,EAChC,IAAK,SACJ,OAAOH,EAAW5wB,EAAK+wB,CAAO,EAC/B,IAAK,YACJ,OAAOH,EAAW,IAAKG,CAAO,EAC/B,QACC,OAAOH,EAAW,IAAKG,CAAO,CAChC,CACD,CAEA,SAAgBH,EAAWlhB,EAAayhB,EAAsB,CAC7D,OAAUA,GAAkB,GAAKA,EAAkBzhB,EAAO,CAC3D,CAEA,SAASwhB,EAAY3vB,EAAY4vB,EAAsB,CACtD,OAAOP,EAAWrvB,EAAI,IAAM,IAAK4vB,CAAc,CAChD,CAEA,SAAgBN,EAAW7b,EAAW+b,EAAe,CACpDA,EAAUH,EAAW,OAAQG,CAAO,EACpC,QAAS5vB,EAAI,EAAG2N,EAASkG,EAAE,OAAQ7T,EAAI2N,EAAQ3N,IAC9C4vB,EAAUH,EAAW5b,EAAE,WAAW7T,CAAC,EAAG4vB,CAAO,EAE9C,OAAOA,CACR,CAEA,SAASC,EAAUziB,EAAY4iB,EAAsB,CACpD,OAAAA,EAAiBP,EAAW,OAAQO,CAAc,EAC3C5iB,EAAI,OAAO,CAACwiB,EAAShhB,IAAS4gB,EAAO5gB,EAAMghB,CAAO,EAAGI,CAAc,CAC3E,CAEA,SAASF,EAAWjxB,EAAUmxB,EAAsB,CACnD,OAAAA,EAAiBP,EAAW,OAAQO,CAAc,EAC3C,OAAO,KAAKnxB,CAAG,EAAE,KAAI,EAAG,OAAO,CAAC+wB,EAAS7wB,KAC/C6wB,EAAUF,EAAW3wB,EAAK6wB,CAAO,EAC1BJ,EAAO3wB,EAAIE,CAAG,EAAG6wB,CAAO,GAC7BI,CAAc,CAClB,CAOA,SAASC,EAAWhxB,EAAeixB,EAAcC,EAAoB,GAAE,CAEtE,MAAM1b,EAAQ0b,EAAYD,EAGpBE,EAAO,GAAG,GAAK3b,GAAS,GAG9B,OAASxV,GAASixB,GAAUE,EAAOnxB,KAAWwV,KAAY,CAC3D,CAEA,SAAS4b,EAAKC,EAAkB9iB,EAAgB,EAAGqD,EAAgByf,EAAK,WAAYrxB,EAAgB,EAAC,CACpG,QAASe,EAAI,EAAGA,EAAI6Q,EAAO7Q,IAC1BswB,EAAK9iB,EAAQxN,CAAC,EAAIf,CAEpB,CAEA,SAASsxB,EAAQtxB,EAAe0O,EAAgB6iB,EAAe,IAAG,CACjE,KAAOvxB,EAAM,OAAS0O,GACrB1O,EAAQuxB,EAAOvxB,EAEhB,OAAOA,CACR,CAIA,SAAgB0wB,EAAYc,EAAqCC,EAAkB,GAAE,CACpF,OAAID,aAAyB,YACrB,MAAM,KAAK,IAAI,WAAWA,CAAa,CAAC,EAAE,IAAIrwB,GAAKA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAAE,KAAK,EAAE,EAG5FmwB,GAASE,IAAkB,GAAG,SAAS,EAAE,EAAGC,EAAU,CAAC,CAC/D,CAKA,MAAaC,CAAU,QACP,KAAA,YAAc,IAAI,SAAS,IAAI,YAAY,GAAG,CAAC,CAAE,CAehE,aAAA,CAbQ,KAAA,IAAM,WACN,KAAA,IAAM,WACN,KAAA,IAAM,WACN,KAAA,IAAM,UACN,KAAA,IAAM,WAUb,KAAK,MAAQ,IAAI,WAAW,EAAkD,EAC9E,KAAK,QAAU,IAAI,SAAS,KAAK,MAAM,MAAM,EAC7C,KAAK,SAAW,EAChB,KAAK,UAAY,EACjB,KAAK,uBAAyB,EAC9B,KAAK,UAAY,EAClB,CAEO,OAAOlqB,EAAW,CACxB,MAAMmqB,EAASnqB,EAAI,OACnB,GAAImqB,IAAW,EACd,OAGD,MAAMC,EAAO,KAAK,MAClB,IAAIC,EAAU,KAAK,SACfC,EAAwB,KAAK,uBAC7Bza,EACA8U,EAWJ,IATI2F,IAA0B,GAC7Bza,EAAWya,EACX3F,EAAS,GACT2F,EAAwB,IAExBza,EAAW7P,EAAI,WAAW,CAAC,EAC3B2kB,EAAS,KAGG,CACZ,IAAI8B,EAAY5W,EAChB,GAAI0a,EAAQ,gBAAgB1a,CAAQ,EACnC,GAAI8U,EAAS,EAAIwF,EAAQ,CACxB,MAAM9D,EAAermB,EAAI,WAAW2kB,EAAS,CAAC,EAC1C4F,EAAQ,eAAelE,CAAY,GACtC1B,IACA8B,EAAY8D,EAAQ,iBAAiB1a,EAAUwW,CAAY,GAG3DI,EAAS,KAEX,KAAO,CAEN6D,EAAwBza,EACxB,KACD,MACU0a,EAAQ,eAAe1a,CAAQ,IAEzC4W,EAAS,OAKV,GAFA4D,EAAU,KAAK,MAAMD,EAAMC,EAAS5D,CAAS,EAC7C9B,IACIA,EAASwF,EACZta,EAAW7P,EAAI,WAAW2kB,CAAM,MAEhC,MAEF,CAEA,KAAK,SAAW0F,EAChB,KAAK,uBAAyBC,CAC/B,CAEQ,MAAMF,EAAkBC,EAAiB5D,EAAiB,CACjE,OAAIA,EAAY,IACf2D,EAAKC,GAAS,EAAI5D,EACRA,EAAY,MACtB2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,QAAwC,EACrF2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,MAAwC,GAC3EA,EAAY,OACtB2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,SAAwC,GACrF2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,QAAwC,EACrF2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,MAAwC,IAErF2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,WAAwC,GACrF2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,UAAwC,GACrF2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,QAAwC,EACrF2D,EAAKC,GAAS,EAAI,KAAe5D,EAAY,MAAwC,GAGlF4D,GAAO,KACV,KAAK,MAAK,EACVA,GAAO,GACP,KAAK,WAAS,GAEdD,EAAK,CAAC,EAAIA,EAAK,EAA2B,EAC1CA,EAAK,CAAC,EAAIA,EAAK,EAA2B,EAC1CA,EAAK,CAAC,EAAIA,EAAK,EAA2B,GAGpCC,CACR,CAEO,QAAM,CACZ,OAAK,KAAK,YACT,KAAK,UAAY,GACb,KAAK,yBAER,KAAK,uBAAyB,EAC9B,KAAK,SAAW,KAAK,MAAM,KAAK,MAAO,KAAK,SAAQ,KAAA,GAErD,KAAK,WAAa,KAAK,SACvB,KAAK,QAAO,GAGNnB,EAAY,KAAK,GAAG,EAAIA,EAAY,KAAK,GAAG,EAAIA,EAAY,KAAK,GAAG,EAAIA,EAAY,KAAK,GAAG,EAAIA,EAAY,KAAK,GAAG,CAC5H,CAEQ,SAAO,CACd,KAAK,MAAM,KAAK,UAAU,EAAI,IAC9BU,EAAK,KAAK,MAAO,KAAK,QAAQ,EAE1B,KAAK,SAAW,KACnB,KAAK,MAAK,EACVA,EAAK,KAAK,KAAK,GAIhB,MAAMY,EAAK,EAAI,KAAK,UAEpB,KAAK,QAAQ,UAAU,GAAI,KAAK,MAAMA,EAAK,UAAU,EAAG,EAAK,EAC7D,KAAK,QAAQ,UAAU,GAAIA,EAAK,WAAY,EAAK,EAEjD,KAAK,MAAK,CACX,CAEQ,OAAK,CACZ,MAAMC,EAAaP,EAAW,YACxBztB,EAAO,KAAK,QAElB,QAAS3C,EAAI,EAAGA,EAAI,GAAeA,GAAK,EACvC2wB,EAAW,UAAU3wB,EAAG2C,EAAK,UAAU3C,EAAG,EAAK,EAAG,EAAK,EAGxD,QAASA,EAAI,GAAIA,EAAI,IAAgBA,GAAK,EACzC2wB,EAAW,UAAU3wB,EAAG0vB,EAAYiB,EAAW,UAAU3wB,EAAI,GAAI,EAAK,EAAI2wB,EAAW,UAAU3wB,EAAI,GAAI,EAAK,EAAI2wB,EAAW,UAAU3wB,EAAI,GAAI,EAAK,EAAI2wB,EAAW,UAAU3wB,EAAI,GAAI,EAAK,EAAI,CAAC,EAAG,EAAK,EAGtM,IAAIJ,EAAI,KAAK,IACTC,EAAI,KAAK,IACTmD,EAAI,KAAK,IACTia,EAAI,KAAK,IACT/b,EAAI,KAAK,IAEToN,EAAW4D,EACX0e,EAEJ,QAAS5wB,EAAI,EAAGA,EAAI,GAAIA,IACnBA,EAAI,IACPsO,EAAKzO,EAAImD,EAAO,CAACnD,EAAKod,EACtB/K,EAAI,YACMlS,EAAI,IACdsO,EAAIzO,EAAImD,EAAIia,EACZ/K,EAAI,YACMlS,EAAI,IACdsO,EAAKzO,EAAImD,EAAMnD,EAAIod,EAAMja,EAAIia,EAC7B/K,EAAI,aAEJ5D,EAAIzO,EAAImD,EAAIia,EACZ/K,EAAI,YAGL0e,EAAQlB,EAAW9vB,EAAG,CAAC,EAAI0O,EAAIpN,EAAIgR,EAAIye,EAAW,UAAU3wB,EAAI,EAAG,EAAK,EAAK,WAC7EkB,EAAI+b,EACJA,EAAIja,EACJA,EAAI0sB,EAAW7vB,EAAG,EAAE,EACpBA,EAAID,EACJA,EAAIgxB,EAGL,KAAK,IAAO,KAAK,IAAMhxB,EAAK,WAC5B,KAAK,IAAO,KAAK,IAAMC,EAAK,WAC5B,KAAK,IAAO,KAAK,IAAMmD,EAAK,WAC5B,KAAK,IAAO,KAAK,IAAMia,EAAK,WAC5B,KAAK,IAAO,KAAK,IAAM/b,EAAK,UAC7B,EAjMD4J,EAAA,WAAAslB,iJCpFAtlB,EAAA,WAAA+lB,EAdA,MAAaC,CAAkB,CAE9B,YAAoBzsB,EAAc,CAAd,KAAA,OAAAA,CAAkB,CAEtC,aAAW,CACV,MAAMA,EAAS,KAAK,OACd0sB,EAAa,IAAI,WAAW1sB,EAAO,MAAM,EAC/C,QAAS5E,EAAI,EAAGrC,EAAMiH,EAAO,OAAQ5E,EAAIrC,EAAKqC,IAC7CsxB,EAAWtxB,CAAC,EAAI4E,EAAO,WAAW5E,CAAC,EAEpC,OAAOsxB,CACR,EAXDjmB,EAAA,mBAAAgmB,EAcA,SAAgBD,EAAWG,EAAkBC,EAAkBC,EAAe,CAC7E,OAAO,IAAIC,EAAQ,IAAIL,EAAmBE,CAAQ,EAAG,IAAIF,EAAmBG,CAAQ,CAAC,EAAE,YAAYC,CAAM,EAAE,OAC5G,CA8CA,MAAME,CAAK,CAEH,OAAO,OAAO5Z,EAAoB3M,EAAe,CACvD,GAAI,CAAC2M,EACJ,MAAM,IAAI,MAAM3M,CAAO,CAEzB,EAGD,MAAMwmB,CAAO,CAgBL,OAAO,KAAKC,EAAoBC,EAAqBC,EAAyBC,EAA0BrkB,EAAc,CAC5H,QAAS3N,EAAI,EAAGA,EAAI2N,EAAQ3N,IAC3B+xB,EAAiBC,EAAmBhyB,CAAC,EAAI6xB,EAAYC,EAAc9xB,CAAC,CAEtE,CACO,OAAO,MAAM6xB,EAAyBC,EAAqBC,EAA8BC,EAA0BrkB,EAAc,CACvI,QAAS3N,EAAI,EAAGA,EAAI2N,EAAQ3N,IAC3B+xB,EAAiBC,EAAmBhyB,CAAC,EAAI6xB,EAAYC,EAAc9xB,CAAC,CAEtE,EA2BD,MAAMiyB,CAAgB,CAWrB,aAAA,CACC,KAAK,UAAY,CAAA,EACjB,KAAK,gBAAe,WACpB,KAAK,gBAAe,WACpB,KAAK,gBAAkB,EACvB,KAAK,gBAAkB,CACxB,CAKO,gBAAc,EAEhB,KAAK,gBAAkB,GAAK,KAAK,gBAAkB,IAEtD,KAAK,UAAU,KAAK,IAAIC,EAAA,WAAW,KAAK,gBAAiB,KAAK,gBAC7D,KAAK,gBAAiB,KAAK,eAAe,CAAC,EAI7C,KAAK,gBAAkB,EACvB,KAAK,gBAAkB,EACvB,KAAK,gBAAe,WACpB,KAAK,gBAAe,UACrB,CASO,mBAAmBC,EAAuBC,EAAqB,CAErE,KAAK,gBAAkB,KAAK,IAAI,KAAK,gBAAiBD,CAAa,EACnE,KAAK,gBAAkB,KAAK,IAAI,KAAK,gBAAiBC,CAAa,EAEnE,KAAK,iBACN,CASO,mBAAmBD,EAAuBC,EAAqB,CAErE,KAAK,gBAAkB,KAAK,IAAI,KAAK,gBAAiBD,CAAa,EACnE,KAAK,gBAAkB,KAAK,IAAI,KAAK,gBAAiBC,CAAa,EAEnE,KAAK,iBACN,CAKO,YAAU,CAChB,OAAI,KAAK,gBAAkB,GAAK,KAAK,gBAAkB,IAEtD,KAAK,eAAc,EAGb,KAAK,SACb,CAKO,mBAAiB,CACvB,OAAI,KAAK,gBAAkB,GAAK,KAAK,gBAAkB,IAEtD,KAAK,eAAc,EAGpB,KAAK,UAAU,QAAO,EACf,KAAK,SACb,EAQD,MAAaV,CAAO,CAkBnB,YAAYW,EAA6BC,EAA6BC,EAAmE,KAAI,CAC5I,KAAK,4BAA8BA,EAEnC,KAAK,kBAAoBF,EACzB,KAAK,kBAAoBC,EAEzB,KAAM,CAACE,EAAwBC,EAAwBC,CAAkB,EAAIhB,EAAQ,aAAaW,CAAgB,EAC5G,CAACM,EAAwBC,EAAwBC,CAAkB,EAAInB,EAAQ,aAAaY,CAAgB,EAElH,KAAK,YAAeI,GAAsBG,EAC1C,KAAK,wBAA0BL,EAC/B,KAAK,wBAA0BC,EAC/B,KAAK,wBAA0BE,EAC/B,KAAK,wBAA0BC,EAE/B,KAAK,iBAAmB,CAAA,EACxB,KAAK,iBAAmB,CAAA,CACzB,CAEQ,OAAO,eAAexlB,EAAqC,CAClE,OAAQA,EAAI,OAAS,GAAK,OAAOA,EAAI,CAAC,GAAM,QAC7C,CAEQ,OAAO,aAAa0lB,EAAmB,CAC9C,MAAMC,EAAWD,EAAS,YAAW,EAErC,GAAIpB,EAAQ,eAAeqB,CAAQ,EAAG,CACrC,MAAMC,EAAS,IAAI,WAAWD,EAAS,MAAM,EAC7C,QAAS/yB,EAAI,EAAGrC,EAAMo1B,EAAS,OAAQ/yB,EAAIrC,EAAKqC,IAC/CgzB,EAAOhzB,CAAC,KAAIizB,EAAA,YAAWF,EAAS/yB,CAAC,EAAG,CAAC,EAEtC,MAAO,CAAC+yB,EAAUC,EAAQ,EAAI,CAC/B,CAEA,OAAID,aAAoB,WAChB,CAAC,CAAA,EAAIA,EAAU,EAAK,EAGrB,CAAC,CAAA,EAAI,IAAI,WAAWA,CAAQ,EAAG,EAAK,CAC5C,CAEQ,iBAAiBZ,EAAuBe,EAAgB,CAC/D,OAAI,KAAK,wBAAwBf,CAAa,IAAM,KAAK,wBAAwBe,CAAQ,EACjF,GAEA,KAAK,YAAc,KAAK,wBAAwBf,CAAa,IAAM,KAAK,wBAAwBe,CAAQ,EAAI,EACrH,CAEQ,uBAAuBf,EAAuBe,EAAgB,CACrE,GAAI,CAAC,KAAK,iBAAiBf,EAAee,CAAQ,EACjD,MAAO,GAER,MAAMC,EAAkBzB,EAAQ,kBAAkB,KAAK,kBAAmBS,CAAa,EACjFiB,EAAkB1B,EAAQ,kBAAkB,KAAK,kBAAmBwB,CAAQ,EAClF,OAAQC,IAAoBC,CAC7B,CAEQ,OAAO,kBAAkBN,EAAqBtlB,EAAa,CAClE,OAAI,OAAOslB,EAAS,kBAAqB,WACjCA,EAAS,iBAAiBtlB,CAAK,EAEhC,IACR,CAEQ,yBAAyBgE,EAAgBC,EAAc,CAC9D,OAAI,KAAK,wBAAwBD,CAAM,IAAM,KAAK,wBAAwBC,CAAM,EACxE,GAEA,KAAK,YAAc,KAAK,wBAAwBD,CAAM,IAAM,KAAK,wBAAwBC,CAAM,EAAI,EAC5G,CAEQ,yBAAyBD,EAAgBC,EAAc,CAC9D,OAAI,KAAK,wBAAwBD,CAAM,IAAM,KAAK,wBAAwBC,CAAM,EACxE,GAEA,KAAK,YAAc,KAAK,wBAAwBD,CAAM,IAAM,KAAK,wBAAwBC,CAAM,EAAI,EAC5G,CAEO,YAAYggB,EAAe,CACjC,OAAO,KAAK,aAAa,EAAG,KAAK,wBAAwB,OAAS,EAAG,EAAG,KAAK,wBAAwB,OAAS,EAAGA,CAAM,CACxH,CAOQ,aAAajb,EAAuB6c,EAAqB5c,EAAuB6c,EAAqB7B,EAAe,CAC3H,MAAM8B,EAAe,CAAC,EAAK,EAC3B,IAAIC,EAAU,KAAK,qBAAqBhd,EAAe6c,EAAa5c,EAAe6c,EAAaC,CAAY,EAE5G,OAAI9B,IAIH+B,EAAU,KAAK,gBAAgBA,CAAO,GAGhC,CACN,UAAWD,EAAa,CAAC,EACzB,QAASC,EAEX,CAOQ,qBAAqBhd,EAAuB6c,EAAqB5c,EAAuB6c,EAAqBC,EAAuB,CAI3I,IAHAA,EAAa,CAAC,EAAI,GAGX/c,GAAiB6c,GAAe5c,GAAiB6c,GAAe,KAAK,iBAAiB9c,EAAeC,CAAa,GACxHD,IACAC,IAID,KAAO4c,GAAe7c,GAAiB8c,GAAe7c,GAAiB,KAAK,iBAAiB4c,EAAaC,CAAW,GACpHD,IACAC,IAID,GAAI9c,EAAgB6c,GAAe5c,EAAgB6c,EAAa,CAC/D,IAAIE,EAEJ,OAAI/c,GAAiB6c,GACpB3B,EAAM,OAAOnb,IAAkB6c,EAAc,EAAG,wDAAwD,EAGxGG,EAAU,CACT,IAAItB,EAAA,WAAW1b,EAAe,EAAGC,EAAe6c,EAAc7c,EAAgB,CAAC,IAEtED,GAAiB6c,GAC3B1B,EAAM,OAAOlb,IAAkB6c,EAAc,EAAG,wDAAwD,EAGxGE,EAAU,CACT,IAAItB,EAAA,WAAW1b,EAAe6c,EAAc7c,EAAgB,EAAGC,EAAe,CAAC,KAGhFkb,EAAM,OAAOnb,IAAkB6c,EAAc,EAAG,wDAAwD,EACxG1B,EAAM,OAAOlb,IAAkB6c,EAAc,EAAG,wDAAwD,EAGxGE,EAAU,CAAA,GAGJA,CACR,CAGA,MAAMC,EAAiB,CAAC,CAAC,EACnBC,EAAiB,CAAC,CAAC,EACnBh2B,EAAS,KAAK,sBAAsB8Y,EAAe6c,EAAa5c,EAAe6c,EAAaG,EAAgBC,EAAgBH,CAAY,EAExII,EAAcF,EAAe,CAAC,EAC9BG,EAAcF,EAAe,CAAC,EAEpC,GAAIh2B,IAAW,KAGd,OAAOA,EACD,GAAI,CAAC61B,EAAa,CAAC,EAAG,CAM5B,MAAMM,EAAc,KAAK,qBAAqBrd,EAAemd,EAAald,EAAemd,EAAaL,CAAY,EAClH,IAAIO,EAA6B,CAAA,EAEjC,OAAKP,EAAa,CAAC,EAKlBO,EAAe,CACd,IAAI5B,EAAA,WAAWyB,EAAc,EAAGN,GAAeM,EAAc,GAAK,EAAGC,EAAc,EAAGN,GAAeM,EAAc,GAAK,CAAC,GAL1HE,EAAe,KAAK,qBAAqBH,EAAc,EAAGN,EAAaO,EAAc,EAAGN,EAAaC,CAAY,EAS3G,KAAK,mBAAmBM,EAAaC,CAAY,CACzD,CAGA,MAAO,CACN,IAAI5B,EAAA,WAAW1b,EAAe6c,EAAc7c,EAAgB,EAAGC,EAAe6c,EAAc7c,EAAgB,CAAC,EAE/G,CAEQ,UAAUsd,EAA6BC,EAA8BC,EAA4BC,EACxGC,EAA6BC,EAA8BC,EAA4BC,EACvFC,EAA2BC,EAC3BrC,EAAuBkB,EAAqBI,EAC5CrB,EAAuBkB,EAAqBI,EAC5Ce,EAAsBlB,EAAuB,CAE7C,IAAImB,EAAsC,KACtCC,EAAsC,KAGtCC,EAAe,IAAI3C,EACnB4C,EAAcb,EACdc,EAAcb,EACdc,EAAoBtB,EAAe,CAAC,EAAIC,EAAe,CAAC,EAAKQ,EAC7Dc,EAAiB,YACjBC,EAAe,KAAK,iBAAiB,OAAS,EAElD,EAAG,CAEF,MAAMC,EAAWH,EAAmBhB,EAGhCmB,IAAaL,GAAgBK,EAAWJ,GAAeP,EAAcW,EAAW,CAAC,EAAIX,EAAcW,EAAW,CAAC,GAElH/C,EAAgBoC,EAAcW,EAAW,CAAC,EAC1C9C,EAAgBD,EAAgB4C,EAAmBb,EAC/C/B,EAAgB6C,GACnBJ,EAAa,eAAc,EAE5BI,EAAoB7C,EACpByC,EAAa,mBAAmBzC,EAAgB,EAAGC,CAAa,EAChE2C,EAAoBG,EAAW,EAAKnB,IAGpC5B,EAAgBoC,EAAcW,EAAW,CAAC,EAAI,EAC9C9C,EAAgBD,EAAgB4C,EAAmBb,EAC/C/B,EAAgB6C,GACnBJ,EAAa,eAAc,EAE5BI,EAAoB7C,EAAgB,EACpCyC,EAAa,mBAAmBzC,EAAeC,EAAgB,CAAC,EAChE2C,EAAoBG,EAAW,EAAKnB,GAGjCkB,GAAgB,IACnBV,EAAgB,KAAK,iBAAiBU,CAAY,EAClDlB,EAAsBQ,EAAc,CAAC,EACrCM,EAAc,EACdC,EAAcP,EAAc,OAAS,EAEvC,OAAS,EAAEU,GAAgB,IAM3B,GAFAP,EAAiBE,EAAa,kBAAiB,EAE3CrB,EAAa,CAAC,EAAG,CAIpB,IAAI4B,EAAqB1B,EAAe,CAAC,EAAI,EACzC2B,EAAqB1B,EAAe,CAAC,EAAI,EAE7C,GAAIgB,IAAmB,MAAQA,EAAe,OAAS,EAAG,CACzD,MAAMW,EAAoBX,EAAeA,EAAe,OAAS,CAAC,EAClES,EAAqB,KAAK,IAAIA,EAAoBE,EAAkB,eAAc,CAAE,EACpFD,EAAqB,KAAK,IAAIA,EAAoBC,EAAkB,eAAc,CAAE,CACrF,CAEAV,EAAiB,CAChB,IAAIzC,EAAA,WAAWiD,EAAoB9B,EAAc8B,EAAqB,EACrEC,EAAoB9B,EAAc8B,EAAqB,CAAC,EAE3D,KAAO,CAENR,EAAe,IAAI3C,EACnB4C,EAAcT,EACdU,EAAcT,EACdU,EAAoBtB,EAAe,CAAC,EAAIC,EAAe,CAAC,EAAKY,EAC7DU,EAAiB,WACjBC,EAAgBR,EAAe,KAAK,iBAAiB,OAAS,EAAI,KAAK,iBAAiB,OAAS,EAEjG,EAAG,CAEF,MAAMS,EAAWH,EAAmBZ,EAGhCe,IAAaL,GAAgBK,EAAWJ,GAAeN,EAAcU,EAAW,CAAC,GAAKV,EAAcU,EAAW,CAAC,GAEnH/C,EAAgBqC,EAAcU,EAAW,CAAC,EAAI,EAC9C9C,EAAgBD,EAAgB4C,EAAmBT,EAC/CnC,EAAgB6C,GACnBJ,EAAa,eAAc,EAE5BI,EAAoB7C,EAAgB,EACpCyC,EAAa,mBAAmBzC,EAAgB,EAAGC,EAAgB,CAAC,EACpE2C,EAAoBG,EAAW,EAAKf,IAGpChC,EAAgBqC,EAAcU,EAAW,CAAC,EAC1C9C,EAAgBD,EAAgB4C,EAAmBT,EAC/CnC,EAAgB6C,GACnBJ,EAAa,eAAc,EAE5BI,EAAoB7C,EACpByC,EAAa,mBAAmBzC,EAAgB,EAAGC,EAAgB,CAAC,EACpE2C,EAAoBG,EAAW,EAAKf,GAGjCc,GAAgB,IACnBT,EAAgB,KAAK,iBAAiBS,CAAY,EAClDd,EAAsBK,EAAc,CAAC,EACrCK,EAAc,EACdC,EAAcN,EAAc,OAAS,EAEvC,OAAS,EAAES,GAAgB,IAI3BN,EAAiBC,EAAa,WAAU,CACzC,CAEA,OAAO,KAAK,mBAAmBF,EAAgBC,CAAc,CAC9D,CAkBQ,sBAAsBne,EAAuB6c,EAAqB5c,EAAuB6c,EAAqBG,EAA0BC,EAA0BH,EAAuB,CAChM,IAAIpB,EAAgB,EAAGC,EAAgB,EACnC4B,EAAuB,EAAGC,EAAqB,EAC/CG,EAAuB,EAAGC,EAAqB,EAInD7d,IACAC,IAIAgd,EAAe,CAAC,EAAI,EACpBC,EAAe,CAAC,EAAI,EAGpB,KAAK,iBAAmB,CAAA,EACxB,KAAK,iBAAmB,CAAA,EAMxB,MAAM4B,EAAkBjC,EAAc7c,GAAkB8c,EAAc7c,GAChE8e,EAAeD,EAAiB,EAChCf,EAAgB,IAAI,WAAWgB,CAAY,EAC3Cf,EAAgB,IAAI,WAAWe,CAAY,EAG3CxB,EAAuBT,EAAc7c,EACrC0d,EAAuBd,EAAc7c,EAKrC0d,EAAyB1d,EAAgBC,EACzC6d,EAAyBjB,EAAcC,EAMvCmB,GADQN,EAAsBJ,GACP,IAAM,EAInCQ,EAAcR,CAAmB,EAAIvd,EACrCge,EAAcL,CAAmB,EAAId,EAGrCE,EAAa,CAAC,EAAI,GAWlB,QAASiC,EAAiB,EAAGA,GAAmBF,EAAiB,EAAK,EAAGE,IAAkB,CAC1F,IAAIC,EAAwB,EACxBC,EAAwB,EAG5B1B,EAAuB,KAAK,kBAAkBD,EAAsByB,EAAgBA,EAAgBzB,EAAqBwB,CAAY,EACrItB,EAAqB,KAAK,kBAAkBF,EAAsByB,EAAgBA,EAAgBzB,EAAqBwB,CAAY,EACnI,QAASL,EAAWlB,EAAsBkB,GAAYjB,EAAoBiB,GAAY,EAAG,CAIpFA,IAAalB,GAAyBkB,EAAWjB,GAAsBM,EAAcW,EAAW,CAAC,EAAIX,EAAcW,EAAW,CAAC,EAClI/C,EAAgBoC,EAAcW,EAAW,CAAC,EAE1C/C,EAAgBoC,EAAcW,EAAW,CAAC,EAAI,EAE/C9C,EAAgBD,GAAiB+C,EAAWnB,GAAuBG,EAGnE,MAAMyB,EAAoBxD,EAI1B,KAAOA,EAAgBkB,GAAejB,EAAgBkB,GAAe,KAAK,iBAAiBnB,EAAgB,EAAGC,EAAgB,CAAC,GAC9HD,IACAC,IAaD,GAXAmC,EAAcW,CAAQ,EAAI/C,EAEtBA,EAAgBC,EAAgBqD,EAAwBC,IAC3DD,EAAwBtD,EACxBuD,EAAwBtD,GAOrB,CAACqC,GAAe,KAAK,IAAIS,EAAWf,CAAmB,GAAMqB,EAAiB,GAC7ErD,GAAiBqC,EAAcU,CAAQ,EAI1C,OAHAzB,EAAe,CAAC,EAAItB,EACpBuB,EAAe,CAAC,EAAItB,EAEhBuD,GAAqBnB,EAAcU,CAAQ,GAAiDM,GAAmB,KAE3G,KAAK,UAAUzB,EAAqBC,EAAsBC,EAAoBC,EACpFC,EAAqBC,EAAsBC,EAAoBC,EAC/DC,EAAeC,EACfrC,EAAekB,EAAaI,EAC5BrB,EAAekB,EAAaI,EAC5Be,EAAalB,CAAY,EAKnB,IAIX,CAGA,MAAMqC,GAAyBH,EAAwBjf,GAAkBkf,EAAwBjf,GAAiB+e,GAAkB,EAEpI,GAAI,KAAK,8BAAgC,MAAQ,CAAC,KAAK,4BAA4BC,EAAuBG,CAAoB,EAQ7H,OANArC,EAAa,CAAC,EAAI,GAGlBE,EAAe,CAAC,EAAIgC,EACpB/B,EAAe,CAAC,EAAIgC,EAEhBE,EAAuB,GAAiDJ,GAAmB,KAEvF,KAAK,UAAUzB,EAAqBC,EAAsBC,EAAoBC,EACpFC,EAAqBC,EAAsBC,EAAoBC,EAC/DC,EAAeC,EACfrC,EAAekB,EAAaI,EAC5BrB,EAAekB,EAAaI,EAC5Be,EAAalB,CAAY,GAO1B/c,IACAC,IAEO,CACN,IAAIyb,EAAA,WAAW1b,EAAe6c,EAAc7c,EAAgB,EAC3DC,EAAe6c,EAAc7c,EAAgB,CAAC,IAMlD2d,EAAuB,KAAK,kBAAkBD,EAAsBqB,EAAgBA,EAAgBrB,EAAqBoB,CAAY,EACrIlB,EAAqB,KAAK,kBAAkBF,EAAsBqB,EAAgBA,EAAgBrB,EAAqBoB,CAAY,EACnI,QAASL,EAAWd,EAAsBc,GAAYb,EAAoBa,GAAY,EAAG,CAIpFA,IAAad,GAAyBc,EAAWb,GAAsBG,EAAcU,EAAW,CAAC,GAAKV,EAAcU,EAAW,CAAC,EACnI/C,EAAgBqC,EAAcU,EAAW,CAAC,EAAI,EAE9C/C,EAAgBqC,EAAcU,EAAW,CAAC,EAE3C9C,EAAgBD,GAAiB+C,EAAWf,GAAuBG,EAGnE,MAAMqB,EAAoBxD,EAI1B,KAAOA,EAAgB3b,GAAiB4b,EAAgB3b,GAAiB,KAAK,iBAAiB0b,EAAeC,CAAa,GAC1HD,IACAC,IAOD,GALAoC,EAAcU,CAAQ,EAAI/C,EAKtBsC,GAAe,KAAK,IAAIS,EAAWnB,CAAmB,GAAKyB,GAC1DrD,GAAiBoC,EAAcW,CAAQ,EAI1C,OAHAzB,EAAe,CAAC,EAAItB,EACpBuB,EAAe,CAAC,EAAItB,EAEhBuD,GAAqBpB,EAAcW,CAAQ,GAAiDM,GAAmB,KAE3G,KAAK,UAAUzB,EAAqBC,EAAsBC,EAAoBC,EACpFC,EAAqBC,EAAsBC,EAAoBC,EAC/DC,EAAeC,EACfrC,EAAekB,EAAaI,EAC5BrB,EAAekB,EAAaI,EAC5Be,EAAalB,CAAY,EAKnB,IAIX,CAGA,GAAIiC,GAAc,KAA0C,CAG3D,IAAIrE,EAAO,IAAI,WAAW8C,EAAqBD,EAAuB,CAAC,EACvE7C,EAAK,CAAC,EAAI4C,EAAsBC,EAAuB,EACvDpC,EAAQ,MAAM2C,EAAeP,EAAsB7C,EAAM,EAAG8C,EAAqBD,EAAuB,CAAC,EACzG,KAAK,iBAAiB,KAAK7C,CAAI,EAE/BA,EAAO,IAAI,WAAWkD,EAAqBD,EAAuB,CAAC,EACnEjD,EAAK,CAAC,EAAIgD,EAAsBC,EAAuB,EACvDxC,EAAQ,MAAM4C,EAAeJ,EAAsBjD,EAAM,EAAGkD,EAAqBD,EAAuB,CAAC,EACzG,KAAK,iBAAiB,KAAKjD,CAAI,CAChC,CAED,CAIA,OAAO,KAAK,UAAU4C,EAAqBC,EAAsBC,EAAoBC,EACpFC,EAAqBC,EAAsBC,EAAoBC,EAC/DC,EAAeC,EACfrC,EAAekB,EAAaI,EAC5BrB,EAAekB,EAAaI,EAC5Be,EAAalB,CAAY,CAE3B,CAUQ,gBAAgBC,EAAqB,CAG5C,QAASxzB,EAAI,EAAGA,EAAIwzB,EAAQ,OAAQxzB,IAAK,CACxC,MAAM61B,EAASrC,EAAQxzB,CAAC,EAClB81B,EAAgB91B,EAAIwzB,EAAQ,OAAS,EAAKA,EAAQxzB,EAAI,CAAC,EAAE,cAAgB,KAAK,wBAAwB,OACtG+1B,EAAgB/1B,EAAIwzB,EAAQ,OAAS,EAAKA,EAAQxzB,EAAI,CAAC,EAAE,cAAgB,KAAK,wBAAwB,OACtGg2B,EAAgBH,EAAO,eAAiB,EACxCI,EAAgBJ,EAAO,eAAiB,EAE9C,KACCA,EAAO,cAAgBA,EAAO,eAAiBC,GAC5CD,EAAO,cAAgBA,EAAO,eAAiBE,IAC9C,CAACC,GAAiB,KAAK,yBAAyBH,EAAO,cAAeA,EAAO,cAAgBA,EAAO,cAAc,KAClH,CAACI,GAAiB,KAAK,yBAAyBJ,EAAO,cAAeA,EAAO,cAAgBA,EAAO,cAAc,IACrH,CACD,MAAMK,EAAmB,KAAK,uBAAuBL,EAAO,cAAeA,EAAO,aAAa,EAE/F,GADuB,KAAK,uBAAuBA,EAAO,cAAgBA,EAAO,eAAgBA,EAAO,cAAgBA,EAAO,cAAc,GACvH,CAACK,EAEtB,MAEDL,EAAO,gBACPA,EAAO,eACR,CAEA,MAAMM,EAA4C,CAAC,IAAI,EACvD,GAAIn2B,EAAIwzB,EAAQ,OAAS,GAAK,KAAK,eAAeA,EAAQxzB,CAAC,EAAGwzB,EAAQxzB,EAAI,CAAC,EAAGm2B,CAAe,EAAG,CAC/F3C,EAAQxzB,CAAC,EAAIm2B,EAAgB,CAAC,EAC9B3C,EAAQ,OAAOxzB,EAAI,EAAG,CAAC,EACvBA,IACA,QACD,CACD,CAGA,QAASA,EAAIwzB,EAAQ,OAAS,EAAGxzB,GAAK,EAAGA,IAAK,CAC7C,MAAM61B,EAASrC,EAAQxzB,CAAC,EAExB,IAAI81B,EAAe,EACfC,EAAe,EACnB,GAAI/1B,EAAI,EAAG,CACV,MAAMo2B,EAAa5C,EAAQxzB,EAAI,CAAC,EAChC81B,EAAeM,EAAW,cAAgBA,EAAW,eACrDL,EAAeK,EAAW,cAAgBA,EAAW,cACtD,CAEA,MAAMJ,EAAgBH,EAAO,eAAiB,EACxCI,EAAgBJ,EAAO,eAAiB,EAE9C,IAAIQ,EAAY,EACZC,EAAY,KAAK,eAAeT,EAAO,cAAeA,EAAO,eAAgBA,EAAO,cAAeA,EAAO,cAAc,EAE5H,QAASphB,EAAQ,GAAKA,IAAS,CAC9B,MAAM+B,EAAgBqf,EAAO,cAAgBphB,EACvCgC,EAAgBof,EAAO,cAAgBphB,EAU7C,GARI+B,EAAgBsf,GAAgBrf,EAAgBsf,GAIhDC,GAAiB,CAAC,KAAK,yBAAyBxf,EAAeA,EAAgBqf,EAAO,cAAc,GAIpGI,GAAiB,CAAC,KAAK,yBAAyBxf,EAAeA,EAAgBof,EAAO,cAAc,EACvG,MAID,MAAMU,GAD0B/f,IAAkBsf,GAAgBrf,IAAkBsf,EAEzD,EAAI,GAC5B,KAAK,eAAevf,EAAeqf,EAAO,eAAgBpf,EAAeof,EAAO,cAAc,EAG7FU,EAAQD,IACXA,EAAYC,EACZF,EAAY5hB,EAEd,CAEAohB,EAAO,eAAiBQ,EACxBR,EAAO,eAAiBQ,EAExB,MAAMF,EAA4C,CAAC,IAAI,EACvD,GAAIn2B,EAAI,GAAK,KAAK,eAAewzB,EAAQxzB,EAAI,CAAC,EAAGwzB,EAAQxzB,CAAC,EAAGm2B,CAAe,EAAG,CAC9E3C,EAAQxzB,EAAI,CAAC,EAAIm2B,EAAgB,CAAC,EAClC3C,EAAQ,OAAOxzB,EAAG,CAAC,EACnBA,IACA,QACD,CACD,CAIA,GAAI,KAAK,YACR,QAASA,EAAI,EAAGrC,EAAM61B,EAAQ,OAAQxzB,EAAIrC,EAAKqC,IAAK,CACnD,MAAMw2B,EAAUhD,EAAQxzB,EAAI,CAAC,EACvBy2B,EAAUjD,EAAQxzB,CAAC,EACnB02B,EAAgBD,EAAQ,cAAgBD,EAAQ,cAAgBA,EAAQ,eACxEG,EAAiBH,EAAQ,cACzBI,EAAeH,EAAQ,cAAgBA,EAAQ,eAC/CI,EAAmBD,EAAeD,EAClCG,EAAiBN,EAAQ,cACzBO,EAAeN,EAAQ,cAAgBA,EAAQ,eAC/CO,EAAmBD,EAAeD,EAExC,GAAIJ,EAAgB,GAAKG,EAAmB,IAAMG,EAAmB,GAAI,CACxE,MAAMhkB,EAAI,KAAK,8BACd2jB,EAAgBE,EAChBC,EAAgBE,EAChBN,CAAa,EAEd,GAAI1jB,EAAG,CACN,KAAM,CAACikB,EAAoBC,CAAkB,EAAIlkB,GAC7CikB,IAAuBT,EAAQ,cAAgBA,EAAQ,gBAAkBU,IAAuBV,EAAQ,cAAgBA,EAAQ,kBAEnIA,EAAQ,eAAiBS,EAAqBT,EAAQ,cACtDA,EAAQ,eAAiBU,EAAqBV,EAAQ,cACtDC,EAAQ,cAAgBQ,EAAqBP,EAC7CD,EAAQ,cAAgBS,EAAqBR,EAC7CD,EAAQ,eAAiBG,EAAeH,EAAQ,cAChDA,EAAQ,eAAiBM,EAAeN,EAAQ,cAElD,CACD,CACD,CAGD,OAAOjD,CACR,CAEQ,8BAA8Bhd,EAAuB5G,EAAwB6G,EAAuBC,EAAwBygB,EAAqB,CACxJ,GAAIvnB,EAAiBunB,GAAiBzgB,EAAiBygB,EACtD,OAAO,KAER,MAAMC,EAAc5gB,EAAgB5G,EAAiBunB,EAAgB,EAC/DE,EAAc5gB,EAAgBC,EAAiBygB,EAAgB,EACrE,IAAIb,EAAY,EACZgB,EAAoB,EACpBC,EAAoB,EACxB,QAASv3B,EAAIwW,EAAexW,EAAIo3B,EAAap3B,IAC5C,QAASO,EAAIkW,EAAelW,EAAI82B,EAAa92B,IAAK,CACjD,MAAMg2B,EAAQ,KAAK,yBAAyBv2B,EAAGO,EAAG42B,CAAa,EAC3DZ,EAAQ,GAAKA,EAAQD,IACxBA,EAAYC,EACZe,EAAoBt3B,EACpBu3B,EAAoBh3B,EAEtB,CAED,OAAI+1B,EAAY,EACR,CAACgB,EAAmBC,CAAiB,EAEtC,IACR,CAEQ,yBAAyB/gB,EAAuBC,EAAuB9I,EAAc,CAC5F,IAAI4oB,EAAQ,EACZ,QAASziB,EAAI,EAAGA,EAAInG,EAAQmG,IAAK,CAChC,GAAI,CAAC,KAAK,iBAAiB0C,EAAgB1C,EAAG2C,EAAgB3C,CAAC,EAC9D,MAAO,GAERyiB,GAAS,KAAK,wBAAwB/f,EAAgB1C,CAAC,EAAE,MAC1D,CACA,OAAOyiB,CACR,CAEQ,oBAAoB/oB,EAAa,CACxC,OAAIA,GAAS,GAAKA,GAAS,KAAK,wBAAwB,OAAS,EACzD,GAEA,KAAK,aAAe,QAAQ,KAAK,KAAK,wBAAwBA,CAAK,CAAC,CAC7E,CAEQ,0BAA0BgJ,EAAuB5G,EAAsB,CAC9E,GAAI,KAAK,oBAAoB4G,CAAa,GAAK,KAAK,oBAAoBA,EAAgB,CAAC,EACxF,MAAO,GAER,GAAI5G,EAAiB,EAAG,CACvB,MAAMyjB,EAAc7c,EAAgB5G,EACpC,GAAI,KAAK,oBAAoByjB,EAAc,CAAC,GAAK,KAAK,oBAAoBA,CAAW,EACpF,MAAO,EAET,CACA,MAAO,EACR,CAEQ,oBAAoB7lB,EAAa,CACxC,OAAIA,GAAS,GAAKA,GAAS,KAAK,wBAAwB,OAAS,EACzD,GAEA,KAAK,aAAe,QAAQ,KAAK,KAAK,wBAAwBA,CAAK,CAAC,CAC7E,CAEQ,0BAA0BiJ,EAAuBC,EAAsB,CAC9E,GAAI,KAAK,oBAAoBD,CAAa,GAAK,KAAK,oBAAoBA,EAAgB,CAAC,EACxF,MAAO,GAER,GAAIC,EAAiB,EAAG,CACvB,MAAM4c,EAAc7c,EAAgBC,EACpC,GAAI,KAAK,oBAAoB4c,EAAc,CAAC,GAAK,KAAK,oBAAoBA,CAAW,EACpF,MAAO,EAET,CACA,MAAO,EACR,CAEQ,eAAe9c,EAAuB5G,EAAwB6G,EAAuBC,EAAsB,CAClH,MAAM8gB,EAAiB,KAAK,0BAA0BhhB,EAAe5G,CAAc,EAAI,EAAI,EACrF6nB,EAAiB,KAAK,0BAA0BhhB,EAAeC,CAAc,EAAI,EAAI,EAC3F,OAAQ8gB,EAAgBC,CACzB,CASQ,mBAAmBC,EAAoBC,EAAmB,CACjE,MAAMxB,EAAgC,CAAA,EAEtC,GAAIuB,EAAK,SAAW,GAAKC,EAAM,SAAW,EACzC,OAAQA,EAAM,OAAS,EAAKA,EAAQD,EAC9B,GAAI,KAAK,eAAeA,EAAKA,EAAK,OAAS,CAAC,EAAGC,EAAM,CAAC,EAAGxB,CAAe,EAAG,CAKjF,MAAMz4B,EAAS,IAAI,MAAkBg6B,EAAK,OAASC,EAAM,OAAS,CAAC,EACnE,OAAA/F,EAAQ,KAAK8F,EAAM,EAAGh6B,EAAQ,EAAGg6B,EAAK,OAAS,CAAC,EAChDh6B,EAAOg6B,EAAK,OAAS,CAAC,EAAIvB,EAAgB,CAAC,EAC3CvE,EAAQ,KAAK+F,EAAO,EAAGj6B,EAAQg6B,EAAK,OAAQC,EAAM,OAAS,CAAC,EAErDj6B,CACR,KAAO,CACN,MAAMA,EAAS,IAAI,MAAkBg6B,EAAK,OAASC,EAAM,MAAM,EAC/D,OAAA/F,EAAQ,KAAK8F,EAAM,EAAGh6B,EAAQ,EAAGg6B,EAAK,MAAM,EAC5C9F,EAAQ,KAAK+F,EAAO,EAAGj6B,EAAQg6B,EAAK,OAAQC,EAAM,MAAM,EAEjDj6B,CACR,CACD,CAUQ,eAAeg6B,EAAkBC,EAAmBxB,EAAyC,CAIpG,GAHAxE,EAAM,OAAO+F,EAAK,eAAiBC,EAAM,cAAe,uDAAuD,EAC/GhG,EAAM,OAAO+F,EAAK,eAAiBC,EAAM,cAAe,uDAAuD,EAE3GD,EAAK,cAAgBA,EAAK,gBAAkBC,EAAM,eAAiBD,EAAK,cAAgBA,EAAK,gBAAkBC,EAAM,cAAe,CACvI,MAAMnhB,EAAgBkhB,EAAK,cAC3B,IAAI9nB,EAAiB8nB,EAAK,eAC1B,MAAMjhB,EAAgBihB,EAAK,cAC3B,IAAIhhB,EAAiBghB,EAAK,eAE1B,OAAIA,EAAK,cAAgBA,EAAK,gBAAkBC,EAAM,gBACrD/nB,EAAiB+nB,EAAM,cAAgBA,EAAM,eAAiBD,EAAK,eAEhEA,EAAK,cAAgBA,EAAK,gBAAkBC,EAAM,gBACrDjhB,EAAiBihB,EAAM,cAAgBA,EAAM,eAAiBD,EAAK,eAGpEvB,EAAgB,CAAC,EAAI,IAAIjE,EAAA,WAAW1b,EAAe5G,EAAgB6G,EAAeC,CAAc,EACzF,EACR,KACC,QAAAyf,EAAgB,CAAC,EAAI,KACd,EAET,CAcQ,kBAAkBjB,EAAkBM,EAAwBoC,EAA2BrC,EAAoB,CAClH,GAAIL,GAAY,GAAKA,EAAWK,EAE/B,OAAOL,EAKR,MAAM2C,EAAiBD,EACjBE,EAAiBvC,EAAeqC,EAAoB,EACpDG,EAAYvC,EAAiB,IAAM,EAEzC,GAAIN,EAAW,EAAG,CACjB,MAAM8C,EAAkBH,EAAiB,IAAM,EAC/C,OAAQE,IAAaC,EAAkB,EAAI,CAC5C,KAAO,CACN,MAAMC,EAAkBH,EAAiB,IAAM,EAC/C,OAAQC,IAAaE,EAAkB1C,EAAe,EAAIA,EAAe,CAC1E,CACD,EA34BDlqB,EAAA,QAAAqmB,yHC9NarmB,EAAA,eAAiB,OAAO,gBAAgB,iGCArDA,EAAA,SAAA6sB,EAQA7sB,EAAA,SAAA8sB,EAcA9sB,EAAA,aAAA+sB,EAUA/sB,EAAA,SAAAgtB,EAOAhtB,EAAA,WAAAitB,EAOAjtB,EAAA,UAAAktB,EAOAltB,EAAA,YAAAmtB,EAOAntB,EAAA,UAAAotB,EAOAptB,EAAA,kBAAAqtB,EAKArtB,EAAA,WAAAstB,EASAttB,EAAA,gBAAAutB,EAWAvtB,EAAA,WAAAwtB,EAMAxtB,EAAA,oBAAAytB,EAOAztB,EAAA,mBAAA0tB,EAzGA,SAAgBb,EAASzxB,EAAY,CACpC,OAAQ,OAAOA,GAAQ,QACxB,CAMA,SAAgB0xB,EAASt5B,EAAY,CAIpC,OAAO,OAAOA,GAAQ,UAClBA,IAAQ,MACR,CAAC,MAAM,QAAQA,CAAG,GAClB,EAAEA,aAAe,SACjB,EAAEA,aAAe,KACtB,CAKA,SAAgBu5B,EAAav5B,EAAY,CACxC,MAAMm6B,EAAa,OAAO,eAAe,UAAU,EACnD,OAAO,OAAOn6B,GAAQ,UAClBA,aAAem6B,CACpB,CAMA,SAAgBX,EAASx5B,EAAY,CACpC,OAAQ,OAAOA,GAAQ,UAAY,CAAC,MAAMA,CAAG,CAC9C,CAKA,SAAgBy5B,EAAcz5B,EAAY,CACzC,MAAO,CAAC,CAACA,GAAO,OAAQA,EAAY,OAAO,QAAQ,GAAM,UAC1D,CAKA,SAAgB05B,EAAU15B,EAAY,CACrC,OAAQA,IAAQ,IAAQA,IAAQ,EACjC,CAKA,SAAgB25B,EAAY35B,EAAY,CACvC,OAAQ,OAAOA,EAAQ,GACxB,CAKA,SAAgB45B,EAAaxpB,EAAyB,CACrD,MAAO,CAACypB,EAAkBzpB,CAAG,CAC9B,CAKA,SAAgBypB,EAAkB75B,EAAY,CAC7C,OAAQ25B,EAAY35B,CAAG,GAAKA,IAAQ,IACrC,CAGA,SAAgB85B,EAAW5gB,EAAoB9Z,EAAa,CAC3D,GAAI,CAAC8Z,EACJ,MAAM,IAAI,MAAM9Z,EAAO,8BAA8BA,CAAI,IAAM,iBAAiB,CAElF,CAKA,SAAgB26B,EAAmB3pB,EAAyB,CAC3D,GAAIypB,EAAkBzpB,CAAG,EACxB,MAAM,IAAI,MAAM,iDAAiD,EAGlE,OAAOA,CACR,CAKA,SAAgB4pB,EAAWh6B,EAAY,CACtC,OAAQ,OAAOA,GAAQ,UACxB,CAIA,SAAgBi6B,EAAoBz1B,EAAiB41B,EAA8C,CAClG,MAAMt7B,EAAM,KAAK,IAAI0F,EAAK,OAAQ41B,EAAY,MAAM,EACpD,QAASj5B,EAAI,EAAGA,EAAIrC,EAAKqC,IACxB+4B,EAAmB11B,EAAKrD,CAAC,EAAGi5B,EAAYj5B,CAAC,CAAC,CAE5C,CAEA,SAAgB+4B,EAAmB9pB,EAAciqB,EAAsC,CAEtF,GAAIhB,EAASgB,CAAU,GACtB,GAAI,OAAOjqB,IAAQiqB,EAClB,MAAM,IAAI,MAAM,8CAA8CA,CAAU,EAAE,UAEjEL,EAAWK,CAAU,EAAG,CAClC,GAAI,CACH,GAAIjqB,aAAeiqB,EAClB,MAEF,MAAQ,CAER,CAIA,GAHI,CAACR,EAAkBzpB,CAAG,GAAMA,EAAY,cAAgBiqB,GAGxDA,EAAW,SAAW,GAAKA,EAAW,KAAK,OAAWjqB,CAAG,IAAM,GAClE,OAED,MAAM,IAAI,MAAM,2IAA2I,CAC5J,CACD,sGC7HA5D,EAAA,SAAA8tB,EAeA9tB,EAAA,yBAAA+tB,EAjBA,MAAMC,EAAmD,OAAO,OAAO,IAAI,EAE3E,SAAgBF,EAASj6B,EAAYo6B,EAA8B,CAClE,MAAIC,EAAA,UAASD,CAAa,EAAG,CAC5B,MAAM/qB,EAAM8qB,EAAuBC,CAAa,EAChD,GAAI/qB,IAAQ,OACX,MAAM,IAAI,MAAM,GAAGrP,CAAE,mCAAmCo6B,CAAa,EAAE,EAExEA,EAAgB/qB,CACjB,CACA,OAAA8qB,EAAuBn6B,CAAE,EAAIo6B,EACtB,CAAE,GAAAp6B,CAAE,CACZ,CAKA,SAAgBk6B,GAAwB,CACvC,OAAOC,CACR,+HCjBahuB,EAAA,gBAAkB,CAC9B,OAAKmuB,EAAA,UAAS,MAAO,GAAM,EAC3B,QAAMA,EAAA,UAAS,OAAQ,GAAM,EAC7B,WAASA,EAAA,UAAS,WAAY,GAAM,EACpC,cAAYA,EAAA,UAAS,cAAe,GAAM,EAC1C,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,kBAAgBA,EAAA,UAAS,mBAAoB,KAAM,EACnD,2BAAyBA,EAAA,UAAS,6BAA8B,KAAM,EACtE,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,uBAAqBA,EAAA,UAAS,yBAA0B,KAAM,EAC9D,UAAQA,EAAA,UAAS,UAAW,KAAM,EAClC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,mBAAiBA,EAAA,UAAS,oBAAqB,KAAM,EACrD,mBAAiBA,EAAA,UAAS,oBAAqB,KAAM,EACrD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,UAAQA,EAAA,UAAS,UAAW,KAAM,EAClC,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,SAAOA,EAAA,UAAS,SAAU,KAAM,EAChC,UAAQA,EAAA,UAAS,UAAW,KAAM,EAClC,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,2BAAyBA,EAAA,UAAS,4BAA6B,KAAM,EACrE,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,6BAA2BA,EAAA,UAAS,8BAA+B,KAAM,EACzE,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,kBAAgBA,EAAA,UAAS,mBAAoB,KAAM,EACnD,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,KAAGA,EAAA,UAAS,IAAK,KAAM,EACvB,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,cAAYA,EAAA,UAAS,aAAc,KAAM,EACzC,MAAIA,EAAA,UAAS,KAAM,KAAM,EACzB,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,gBAAcA,EAAA,UAAS,eAAgB,KAAM,EAC7C,sBAAoBA,EAAA,UAAS,sBAAuB,KAAM,EAC1D,uBAAqBA,EAAA,UAAS,uBAAwB,KAAM,EAC5D,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,uBAAqBA,EAAA,UAAS,wBAAyB,KAAM,EAC7D,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,qBAAmBA,EAAA,UAAS,qBAAsB,KAAM,EACxD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,uBAAqBA,EAAA,UAAS,wBAAyB,KAAM,EAC7D,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,YAAUA,EAAA,UAAS,aAAc,KAAM,EACvC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,uBAAqBA,EAAA,UAAS,uBAAwB,KAAM,EAC5D,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,kBAAgBA,EAAA,UAAS,mBAAoB,KAAM,EACnD,kBAAgBA,EAAA,UAAS,mBAAoB,KAAM,EACnD,mBAAiBA,EAAA,UAAS,oBAAqB,KAAM,EACrD,gBAAcA,EAAA,UAAS,iBAAkB,KAAM,EAC/C,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,wCAAsCA,EAAA,UAAS,0CAA2C,KAAM,EAChG,8BAA4BA,EAAA,UAAS,+BAAgC,KAAM,EAC3E,sCAAoCA,EAAA,UAAS,wCAAyC,KAAM,EAC5F,iCAA+BA,EAAA,UAAS,mCAAoC,KAAM,EAClF,uBAAqBA,EAAA,UAAS,wBAAyB,KAAM,EAC7D,+BAA6BA,EAAA,UAAS,iCAAkC,KAAM,EAC9E,gCAA8BA,EAAA,UAAS,kCAAmC,KAAM,EAChF,sBAAoBA,EAAA,UAAS,uBAAwB,KAAM,EAC3D,8BAA4BA,EAAA,UAAS,gCAAiC,KAAM,EAC5E,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,6BAA2BA,EAAA,UAAS,8BAA+B,KAAM,EACzE,gCAA8BA,EAAA,UAAS,iCAAkC,KAAM,EAC/E,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,qBAAmBA,EAAA,UAAS,qBAAsB,KAAM,EACxD,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,iBAAeA,EAAA,UAAS,kBAAmB,KAAM,EACjD,gBAAcA,EAAA,UAAS,iBAAkB,KAAM,EAC/C,iBAAeA,EAAA,UAAS,kBAAmB,KAAM,EACjD,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,qBAAmBA,EAAA,UAAS,sBAAuB,KAAM,EACzD,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,cAAYA,EAAA,UAAS,aAAc,KAAM,EACzC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,wBAAsBA,EAAA,UAAS,yBAA0B,KAAM,EAC/D,mBAAiBA,EAAA,UAAS,oBAAqB,KAAM,EACrD,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,UAAQA,EAAA,UAAS,UAAW,KAAM,EAClC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,oBAAkBA,EAAA,UAAS,oBAAqB,KAAM,EACtD,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,2BAAyBA,EAAA,UAAS,6BAA8B,KAAM,EACtE,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,cAAYA,EAAA,UAAS,aAAc,KAAM,EACzC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,iBAAeA,EAAA,UAAS,kBAAmB,KAAM,EACjD,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,oBAAkBA,EAAA,UAAS,qBAAsB,KAAM,EACvD,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,UAAQA,EAAA,UAAS,UAAW,KAAM,EAClC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,oBAAkBA,EAAA,UAAS,qBAAsB,KAAM,EACvD,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,cAAYA,EAAA,UAAS,aAAc,KAAM,EACzC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,cAAYA,EAAA,UAAS,aAAc,KAAM,EACzC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,cAAYA,EAAA,UAAS,aAAc,KAAM,EACzC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,UAAQA,EAAA,UAAS,UAAW,KAAM,EAClC,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,aAAWA,EAAA,UAAS,YAAa,KAAM,EACvC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,qCAAmCA,EAAA,UAAS,uCAAwC,KAAM,EAC1F,2BAAyBA,EAAA,UAAS,4BAA6B,KAAM,EACrE,mCAAiCA,EAAA,UAAS,qCAAsC,KAAM,EACtF,yBAAuBA,EAAA,UAAS,0BAA2B,KAAM,EACjE,qBAAmBA,EAAA,UAAS,sBAAuB,KAAM,EACzD,sBAAoBA,EAAA,UAAS,uBAAwB,KAAM,EAC3D,0BAAwBA,EAAA,UAAS,2BAA4B,KAAM,EACnE,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,0BAAwBA,EAAA,UAAS,2BAA4B,KAAM,EACnE,8BAA4BA,EAAA,UAAS,+BAAgC,KAAM,EAC3E,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,wBAAsBA,EAAA,UAAS,yBAA0B,KAAM,EAC/D,iBAAeA,EAAA,UAAS,kBAAmB,KAAM,EACjD,qBAAmBA,EAAA,UAAS,sBAAuB,KAAM,EACzD,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,0BAAwBA,EAAA,UAAS,4BAA6B,KAAM,EACpE,kBAAgBA,EAAA,UAAS,oBAAqB,KAAM,EACpD,oBAAkBA,EAAA,UAAS,sBAAuB,KAAM,EACxD,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,0BAAwBA,EAAA,UAAS,4BAA6B,KAAM,EACpE,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,UAAQA,EAAA,UAAS,UAAW,KAAM,EAClC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,qBAAmBA,EAAA,UAAS,qBAAsB,KAAM,EACxD,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,iBAAeA,EAAA,UAAS,kBAAmB,KAAM,EACjD,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,qBAAmBA,EAAA,UAAS,sBAAuB,KAAM,EACzD,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,sBAAoBA,EAAA,UAAS,uBAAwB,KAAM,EAC3D,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,oBAAkBA,EAAA,UAAS,qBAAsB,KAAM,EACvD,sBAAoBA,EAAA,UAAS,uBAAwB,KAAM,EAC3D,wBAAsBA,EAAA,UAAS,0BAA2B,KAAM,EAChE,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,oBAAkBA,EAAA,UAAS,oBAAqB,KAAM,EACtD,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,oBAAkBA,EAAA,UAAS,oBAAqB,KAAM,EACtD,sBAAoBA,EAAA,UAAS,sBAAuB,KAAM,EAC1D,oBAAkBA,EAAA,UAAS,oBAAqB,KAAM,EACtD,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,sBAAoBA,EAAA,UAAS,sBAAuB,KAAM,EAC1D,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,mBAAiBA,EAAA,UAAS,qBAAsB,KAAM,EACtD,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,wBAAsBA,EAAA,UAAS,0BAA2B,KAAM,EAChE,uBAAqBA,EAAA,UAAS,yBAA0B,KAAM,EAC9D,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,sBAAoBA,EAAA,UAAS,uBAAwB,KAAM,EAC3D,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,yBAAuBA,EAAA,UAAS,0BAA2B,KAAM,EACjE,0BAAwBA,EAAA,UAAS,2BAA4B,KAAM,EACnE,mBAAiBA,EAAA,UAAS,oBAAqB,KAAM,EACrD,qBAAmBA,EAAA,UAAS,sBAAuB,KAAM,EACzD,sBAAoBA,EAAA,UAAS,uBAAwB,KAAM,EAC3D,oBAAkBA,EAAA,UAAS,qBAAsB,KAAM,EACvD,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,qBAAmBA,EAAA,UAAS,sBAAuB,KAAM,EACzD,sBAAoBA,EAAA,UAAS,uBAAwB,KAAM,EAC3D,mBAAiBA,EAAA,UAAS,mBAAoB,KAAM,EACpD,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,2BAAyBA,EAAA,UAAS,4BAA6B,KAAM,EACrE,mBAAiBA,EAAA,UAAS,oBAAqB,KAAM,EACrD,mBAAiBA,EAAA,UAAS,oBAAqB,KAAM,EACrD,oBAAkBA,EAAA,UAAS,qBAAsB,KAAM,EACvD,iBAAeA,EAAA,UAAS,kBAAmB,KAAM,EACjD,yBAAuBA,EAAA,UAAS,2BAA4B,KAAM,EAClE,kBAAgBA,EAAA,UAAS,mBAAoB,KAAM,EACnD,wBAAsBA,EAAA,UAAS,0BAA2B,KAAM,EAChE,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,uBAAqBA,EAAA,UAAS,wBAAyB,KAAM,EAC7D,wBAAsBA,EAAA,UAAS,yBAA0B,KAAM,EAC/D,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,gBAAcA,EAAA,UAAS,iBAAkB,KAAM,EAC/C,qBAAmBA,EAAA,UAAS,qBAAsB,KAAM,EACxD,6BAA2BA,EAAA,UAAS,iCAAkC,KAAM,EAC5E,4BAA0BA,EAAA,UAAS,+BAAgC,KAAM,EACzE,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,OAAKA,EAAA,UAAS,MAAO,KAAM,EAC3B,oBAAkBA,EAAA,UAAS,oBAAqB,KAAM,EACtD,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,MAAIA,EAAA,UAAS,KAAM,KAAM,EACzB,QAAMA,EAAA,UAAS,OAAQ,KAAM,EAC7B,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,aAAWA,EAAA,UAAS,aAAc,KAAM,EACxC,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,oBAAkBA,EAAA,UAAS,oBAAqB,KAAM,EACtD,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,cAAYA,EAAA,UAAS,cAAe,KAAM,EAC1C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,SAAOA,EAAA,UAAS,QAAS,KAAM,EAC/B,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,iBAAeA,EAAA,UAAS,kBAAmB,KAAM,EACjD,eAAaA,EAAA,UAAS,gBAAiB,KAAM,EAC7C,UAAQA,EAAA,UAAS,SAAU,KAAM,EACjC,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,WAASA,EAAA,UAAS,WAAY,KAAM,EACpC,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,kBAAgBA,EAAA,UAAS,mBAAoB,KAAM,EACnD,YAAUA,EAAA,UAAS,WAAY,KAAM,EACrC,iBAAeA,EAAA,UAAS,iBAAkB,KAAM,EAChD,eAAaA,EAAA,UAAS,eAAgB,KAAM,EAC5C,gBAAcA,EAAA,UAAS,gBAAiB,KAAM,EAC9C,qBAAmBA,EAAA,UAAS,sBAAuB,KAAM,EACzD,sBAAoBA,EAAA,UAAS,uBAAwB,KAAM,EAC3D,cAAYA,EAAA,UAAS,eAAgB,KAAM,EAC3C,cAAYA,EAAA,UAAS,aAAc,KAAM,EACzC,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,UAAQA,EAAA,UAAS,SAAU,KAAM,+IC5jBrBnuB,EAAA,gBAAkB,CAC9B,eAAamuB,EAAA,UAAS,eAAgB,OAAO,EAC7C,iBAAeA,EAAA,UAAS,iBAAkB,SAAS,EACnD,cAAYA,EAAA,UAAS,cAAe,MAAM,EAC1C,eAAaA,EAAA,UAAS,eAAgB,OAAO,EAC7C,oBAAkBA,EAAA,UAAS,qBAAsB,cAAc,EAC/D,sBAAoBA,EAAA,UAAS,yBAA0B,aAAa,EACpE,uBAAqBA,EAAA,UAAS,0BAA2B,gBAAgB,EACzE,mBAAiBA,EAAA,UAAS,oBAAqB,OAAO,EACtD,mBAAiBA,EAAA,UAAS,oBAAqB,SAAS,EACxD,iBAAeA,EAAA,UAAS,iBAAkB,OAAO,EACjD,eAAaA,EAAA,UAAS,eAAgB,eAAe,EACrD,eAAaA,EAAA,UAAS,eAAgB,MAAM,EAC5C,uBAAqBA,EAAA,UAAS,wBAAyB,eAAe,EACtE,wBAAsBA,EAAA,UAAS,yBAA0B,gBAAgB,EACzE,qBAAmBA,EAAA,UAAS,sBAAuB,aAAa,EAChE,uBAAqBA,EAAA,UAAS,wBAAyB,eAAe,EACtE,eAAaA,EAAA,UAAS,eAAgB,MAAM,EAC5C,kBAAgBA,EAAA,UAAS,mBAAoB,YAAY,EACzD,kBAAgBA,EAAA,UAAS,mBAAoB,KAAM,EACnD,qBAAmBA,EAAA,UAAS,qBAAsB,KAAM,EACxD,cAAYA,EAAA,UAAS,SAAU,KAAM,EACrC,wBAAsBA,EAAA,UAAS,wBAAyB,KAAM,EAC9D,WAASA,EAAA,UAAS,UAAW,KAAM,EACnC,oBAAkBA,EAAA,UAAS,oBAAqB,KAAM,EACtD,kBAAgBA,EAAA,UAAS,kBAAmB,KAAM,EAClD,YAAUA,EAAA,UAAS,YAAa,KAAM,EACtC,2BAAyBA,EAAA,UAAS,4BAA6B,KAAM,EACrE,0BAAwBA,EAAA,UAAS,2BAA4B,KAAM,GAWvDnuB,EAAA,QAAU,CACtB,GAAGouB,EAAA,gBACH,GAAGpuB,EAAA,qHC1CJA,EAAA,UAAAquB,EAcAruB,EAAA,WAAAsuB,EAuBAtuB,EAAA,eAAAuuB,EA4CAvuB,EAAA,MAAAwuB,EAuBAxuB,EAAA,OAAAG,EAqDAH,EAAA,oBAAAyuB,EASAzuB,EAAA,kBAAA0uB,EAUA1uB,EAAA,kBAAA2uB,EAhLA,SAAgBN,EAAa76B,EAAM,CAIlC,GAHI,CAACA,GAAO,OAAOA,GAAQ,UAGvBA,aAAe,OAClB,OAAOA,EAER,MAAMnB,EAAc,MAAM,QAAQmB,CAAG,EAAI,CAAA,EAAK,CAAA,EAC9C,cAAO,QAAQA,CAAG,EAAE,QAAQ,CAAC,CAACE,EAAKE,CAAK,IAAK,CAC5CvB,EAAOqB,CAAG,EAAIE,GAAS,OAAOA,GAAU,SAAWy6B,EAAUz6B,CAAK,EAAIA,CACvE,CAAC,EACMvB,CACR,CAEA,SAAgBi8B,EAAc96B,EAAM,CACnC,GAAI,CAACA,GAAO,OAAOA,GAAQ,SAC1B,OAAOA,EAER,MAAM0H,EAAe,CAAC1H,CAAG,EACzB,KAAO0H,EAAM,OAAS,GAAG,CACxB,MAAM1H,EAAM0H,EAAM,MAAK,EACvB,OAAO,OAAO1H,CAAG,EACjB,UAAWE,KAAOF,EACjB,GAAIo7B,EAAgB,KAAKp7B,EAAKE,CAAG,EAAG,CACnC,MAAMm7B,EAAOr7B,EAAIE,CAAG,EAChB,OAAOm7B,GAAS,UAAY,CAAC,OAAO,SAASA,CAAI,GAAK,IAACX,EAAA,cAAaW,CAAI,GAC3E3zB,EAAM,KAAK2zB,CAAI,CAEjB,CAEF,CACA,OAAOr7B,CACR,CAEA,MAAMo7B,EAAkB,OAAO,UAAU,eAGzC,SAAgBL,EAAe/6B,EAAUs7B,EAA2B,CACnE,OAAOC,EAAgBv7B,EAAKs7B,EAAS,IAAI,GAAK,CAC/C,CAEA,SAASC,EAAgBv7B,EAAUs7B,EAA6BprB,EAAc,CAC7E,MAAIwqB,EAAA,mBAAkB16B,CAAG,EACxB,OAAOA,EAGR,MAAMw7B,EAAUF,EAAQt7B,CAAG,EAC3B,GAAI,OAAOw7B,EAAY,IACtB,OAAOA,EAGR,GAAI,MAAM,QAAQx7B,CAAG,EAAG,CACvB,MAAMy7B,EAAY,CAAA,EAClB,UAAW74B,KAAK5C,EACfy7B,EAAG,KAAKF,EAAgB34B,EAAG04B,EAASprB,CAAI,CAAC,EAE1C,OAAOurB,CACR,CAEA,MAAIf,EAAA,UAAS16B,CAAG,EAAG,CAClB,GAAIkQ,EAAK,IAAIlQ,CAAG,EACf,MAAM,IAAI,MAAM,uCAAuC,EAExDkQ,EAAK,IAAIlQ,CAAG,EACZ,MAAM07B,EAAK,CAAA,EACX,UAAWC,KAAM37B,EACZo7B,EAAgB,KAAKp7B,EAAK27B,CAAE,IAC9BD,EAAWC,CAAE,EAAIJ,EAAgBv7B,EAAI27B,CAAE,EAAGL,EAASprB,CAAI,GAG1D,OAAAA,EAAK,OAAOlQ,CAAG,EACR07B,CACR,CAEA,OAAO17B,CACR,CAMA,SAAgBg7B,EAAMY,EAAkB71B,EAAapF,EAAqB,GAAI,CAC7E,SAAK+5B,EAAA,UAASkB,CAAW,MAIrBlB,EAAA,UAAS30B,CAAM,GAClB,OAAO,KAAKA,CAAM,EAAE,QAAQ7F,GAAM,CAC7BA,KAAO07B,EACNj7B,OACC+5B,EAAA,UAASkB,EAAY17B,CAAG,CAAC,MAAKw6B,EAAA,UAAS30B,EAAO7F,CAAG,CAAC,EACrD86B,EAAMY,EAAY17B,CAAG,EAAG6F,EAAO7F,CAAG,EAAGS,CAAS,EAE9Ci7B,EAAY17B,CAAG,EAAI6F,EAAO7F,CAAG,GAI/B07B,EAAY17B,CAAG,EAAI6F,EAAO7F,CAAG,CAE/B,CAAC,EAEK07B,GAlBC71B,CAmBT,CAEA,SAAgB4G,EAAO6B,EAAUC,EAAU,CAC1C,GAAID,IAAQC,EACX,MAAO,GAWR,GATID,GAAQ,MAA6BC,IAAU,MAAQA,IAAU,QAGjE,OAAOD,GAAQ,OAAOC,GAGtB,OAAOD,GAAQ,UAGd,MAAM,QAAQA,CAAG,IAAQ,MAAM,QAAQC,CAAK,EAChD,MAAO,GAGR,IAAItN,EACAjB,EAEJ,GAAI,MAAM,QAAQsO,CAAG,EAAG,CACvB,GAAIA,EAAI,SAAWC,EAAM,OACxB,MAAO,GAER,IAAKtN,EAAI,EAAGA,EAAIqN,EAAI,OAAQrN,IAC3B,GAAI,CAACwL,EAAO6B,EAAIrN,CAAC,EAAGsN,EAAMtN,CAAC,CAAC,EAC3B,MAAO,EAGV,KAAO,CACN,MAAM06B,EAAoB,CAAA,EAE1B,IAAK37B,KAAOsO,EACXqtB,EAAQ,KAAK37B,CAAG,EAEjB27B,EAAQ,KAAI,EACZ,MAAMC,EAAsB,CAAA,EAC5B,IAAK57B,KAAOuO,EACXqtB,EAAU,KAAK57B,CAAG,EAGnB,GADA47B,EAAU,KAAI,EACV,CAACnvB,EAAOkvB,EAASC,CAAS,EAC7B,MAAO,GAER,IAAK36B,EAAI,EAAGA,EAAI06B,EAAQ,OAAQ16B,IAC/B,GAAI,CAACwL,EAAO6B,EAAIqtB,EAAQ16B,CAAC,CAAC,EAAGsN,EAAMotB,EAAQ16B,CAAC,CAAC,CAAC,EAC7C,MAAO,EAGV,CACA,MAAO,EACR,CAEA,SAAgB85B,EAAoBj7B,EAAW,CAC9C,IAAIggB,EAAgB,CAAA,EACpB,KAAO,OAAO,YAAchgB,GAC3BggB,EAAMA,EAAI,OAAO,OAAO,oBAAoBhgB,CAAG,CAAC,EAChDA,EAAM,OAAO,eAAeA,CAAG,EAEhC,OAAOggB,CACR,CAEA,SAAgBkb,EAAkBl7B,EAAW,CAC5C,MAAM+7B,EAAoB,CAAA,EAC1B,UAAWV,KAAQJ,EAAoBj7B,CAAG,EACrC,OAAQA,EAAYq7B,CAAI,GAAM,YACjCU,EAAQ,KAAKV,CAAI,EAGnB,OAAOU,CACR,CAEA,SAAgBZ,EAAoCa,EAAuBC,EAAoD,CAC9H,MAAMC,EAAqBC,GACnB,UAAA,CACN,MAAM33B,EAAO,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EACpD,OAAOy3B,EAAOE,EAAQ33B,CAAI,CAC3B,EAGK3F,EAAS,CAAA,EACf,UAAWu9B,KAAcJ,EAClBn9B,EAAQu9B,CAAU,EAAIF,EAAkBE,CAAU,EAEzD,OAAOv9B,CACR,iGC5JA2N,EAAA,QAAA6vB,EAUA7vB,EAAA,SAAA8vB,EAVA,SAAgBD,EAAQ5mB,EAAS,CAChC,OAAIA,EAAI,EACA,EAEJA,EAAC,IACJ,IAEMA,EAAI,CACZ,CAEA,SAAgB6mB,EAAS7mB,EAAS,CACjC,OAAIA,EAAI,EACA,EAEJA,EAAC,WACJ,WAEMA,EAAI,CACZ,kJChDA,MAAa8mB,CAAmB,CAa/B,YAAYC,EAAgB,CAC3B,MAAMC,KAAeC,EAAA,SAAQF,CAAa,EAE1C,KAAK,cAAgBC,EACrB,KAAK,UAAYF,EAAoB,gBAAgBE,CAAY,EACjE,KAAK,KAAO,IAAI,GACjB,CAEQ,OAAO,gBAAgBA,EAAoB,CAClD,MAAME,EAAW,IAAI,WAAW,GAAG,EACnC,OAAAA,EAAS,KAAKF,CAAY,EACnBE,CACR,CAEO,IAAIllB,EAAkBmlB,EAAS,CACrC,MAAMx8B,KAAQs8B,EAAA,SAAQE,CAAM,EAExBnlB,GAAY,GAAKA,EAAW,IAC/B,KAAK,UAAUA,CAAQ,EAAIrX,EAE3B,KAAK,KAAK,IAAIqX,EAAUrX,CAAK,CAE/B,CAEO,IAAIqX,EAAgB,CAC1B,OAAIA,GAAY,GAAKA,EAAW,IACrB,KAAK,UAAUA,CAAQ,EAEtB,KAAK,KAAK,IAAIA,CAAQ,GAAK,KAAK,aAE7C,CAEO,OAAK,CACX,KAAK,UAAU,KAAK,KAAK,aAAa,EACtC,KAAK,KAAK,MAAK,CAChB,EAhDDjL,EAAA,oBAAA+vB,EAwDA,MAAaM,CAAY,CAIxB,aAAA,CACC,KAAK,QAAU,IAAIN,EAAmB,CAAA,CACvC,CAEO,IAAI9kB,EAAgB,CAC1B,KAAK,QAAQ,IAAIA,EAAQ,CAAA,CAC1B,CAEO,IAAIA,EAAgB,CAC1B,OAAQ,KAAK,QAAQ,IAAIA,CAAQ,IAAC,CACnC,CAEO,OAAK,CACX,OAAO,KAAK,QAAQ,MAAK,CAC1B,EAlBDjL,EAAA,aAAAqwB,0ICrDA,MAAaC,CAAW,CAChB,OAAO,SAASpvB,EAAoBqvB,EAA2B,CACrE,IAAI57B,EAAI,EACR,KAAOA,EAAI47B,EAAa,QAAUA,EAAa57B,CAAC,EAAE,aAAeuM,EAAM,OACtEvM,IAED,IAAIO,EAAIP,EACR,KAAOO,EAAIq7B,EAAa,QAAUA,EAAar7B,CAAC,EAAE,OAASgM,EAAM,cAChEhM,IAED,GAAIP,IAAMO,EACTq7B,EAAa,OAAO57B,EAAG,EAAGuM,CAAK,MACzB,CACN,MAAMiD,EAAQ,KAAK,IAAIjD,EAAM,MAAOqvB,EAAa57B,CAAC,EAAE,KAAK,EACnDknB,EAAM,KAAK,IAAI3a,EAAM,aAAcqvB,EAAar7B,EAAI,CAAC,EAAE,YAAY,EACzEq7B,EAAa,OAAO57B,EAAGO,EAAIP,EAAG,IAAI27B,EAAYnsB,EAAO0X,CAAG,CAAC,CAC1D,CACD,CAEO,OAAO,UAAU1X,EAAeqsB,EAAoB,CAC1D,GAAI,EAAArsB,EAAQqsB,GAGZ,OAAO,IAAIF,EAAYnsB,EAAOqsB,CAAY,CAC3C,CAEO,OAAO,SAASluB,EAAc,CACpC,OAAO,IAAIguB,EAAY,EAAGhuB,CAAM,CACjC,CAEO,OAAO,iBAAiB6B,EAAe7B,EAAc,CAC3D,OAAO,IAAIguB,EAAYnsB,EAAOA,EAAQ7B,CAAM,CAC7C,CAEA,YAA4B6B,EAA+BqsB,EAAoB,CAC9E,GAD2B,KAAA,MAAArsB,EAA+B,KAAA,aAAAqsB,EACtDrsB,EAAQqsB,EACX,MAAM,IAAI7jB,EAAA,mBAAmB,kBAAkB,KAAK,SAAQ,CAAE,EAAE,CAElE,CAEA,IAAI,SAAO,CACV,OAAO,KAAK,QAAU,KAAK,YAC5B,CAEO,MAAMoT,EAAc,CAC1B,OAAO,IAAIuQ,EAAY,KAAK,MAAQvQ,EAAQ,KAAK,aAAeA,CAAM,CACvE,CAEO,WAAWA,EAAc,CAC/B,OAAO,IAAIuQ,EAAY,KAAK,MAAQvQ,EAAQ,KAAK,YAAY,CAC9D,CAEO,SAASA,EAAc,CAC7B,OAAO,IAAIuQ,EAAY,KAAK,MAAO,KAAK,aAAevQ,CAAM,CAC9D,CAEA,IAAW,QAAM,CAChB,OAAO,KAAK,aAAe,KAAK,KACjC,CAEO,UAAQ,CACd,MAAO,IAAI,KAAK,KAAK,KAAK,KAAK,YAAY,GAC5C,CAEO,SAASA,EAAc,CAC7B,OAAO,KAAK,OAASA,GAAUA,EAAS,KAAK,YAC9C,CAMO,KAAK9d,EAAkB,CAC7B,OAAO,IAAIquB,EAAY,KAAK,IAAI,KAAK,MAAOruB,EAAM,KAAK,EAAG,KAAK,IAAI,KAAK,aAAcA,EAAM,YAAY,CAAC,CAC1G,CAQO,UAAUA,EAAkB,CAClC,MAAMkC,EAAQ,KAAK,IAAI,KAAK,MAAOlC,EAAM,KAAK,EACxC4Z,EAAM,KAAK,IAAI,KAAK,aAAc5Z,EAAM,YAAY,EAC1D,GAAIkC,GAAS0X,EACZ,OAAO,IAAIyU,EAAYnsB,EAAO0X,CAAG,CAGnC,CAEO,WAAW5Z,EAAkB,CACnC,MAAMkC,EAAQ,KAAK,IAAI,KAAK,MAAOlC,EAAM,KAAK,EACxC4Z,EAAM,KAAK,IAAI,KAAK,aAAc5Z,EAAM,YAAY,EAC1D,OAAOkC,EAAQ0X,CAChB,CAEO,SAAS5Z,EAAkB,CACjC,OAAO,KAAK,cAAgBA,EAAM,KACnC,CAEO,QAAQA,EAAkB,CAChC,OAAO,KAAK,OAASA,EAAM,YAC5B,CAEO,MAASF,EAAQ,CACvB,OAAOA,EAAI,MAAM,KAAK,MAAO,KAAK,YAAY,CAC/C,CAEO,UAAU3G,EAAW,CAC3B,OAAOA,EAAI,UAAU,KAAK,MAAO,KAAK,YAAY,CACnD,CAMO,KAAKxH,EAAa,CACxB,GAAI,KAAK,QACR,MAAM,IAAI+Y,EAAA,mBAAmB,2BAA2B,KAAK,SAAQ,CAAE,EAAE,EAE1E,OAAO,KAAK,IAAI,KAAK,MAAO,KAAK,IAAI,KAAK,aAAe,EAAG/Y,CAAK,CAAC,CACnE,CAQO,WAAWA,EAAa,CAC9B,GAAI,KAAK,QACR,MAAM,IAAI+Y,EAAA,mBAAmB,2BAA2B,KAAK,SAAQ,CAAE,EAAE,EAE1E,OAAI/Y,EAAQ,KAAK,MACT,KAAK,cAAiB,KAAK,MAAQA,GAAS,KAAK,OAErDA,GAAS,KAAK,aACV,KAAK,OAAUA,EAAQ,KAAK,OAAS,KAAK,OAE3CA,CACR,CAEO,QAAQ,EAA2B,CACzC,QAASe,EAAI,KAAK,MAAOA,EAAI,KAAK,aAAcA,IAC/C,EAAEA,CAAC,CAEL,EAnJDqL,EAAA,YAAAswB,EAsJA,MAAaG,CAAc,CAA3B,aAAA,CACkB,KAAA,cAA+B,CAAA,CAuDjD,CArDQ,SAASvvB,EAAkB,CACjC,IAAIvM,EAAI,EACR,KAAOA,EAAI,KAAK,cAAc,QAAU,KAAK,cAAcA,CAAC,EAAE,aAAeuM,EAAM,OAClFvM,IAED,IAAIO,EAAIP,EACR,KAAOO,EAAI,KAAK,cAAc,QAAU,KAAK,cAAcA,CAAC,EAAE,OAASgM,EAAM,cAC5EhM,IAED,GAAIP,IAAMO,EACT,KAAK,cAAc,OAAOP,EAAG,EAAGuM,CAAK,MAC/B,CACN,MAAMiD,EAAQ,KAAK,IAAIjD,EAAM,MAAO,KAAK,cAAcvM,CAAC,EAAE,KAAK,EACzDknB,EAAM,KAAK,IAAI3a,EAAM,aAAc,KAAK,cAAchM,EAAI,CAAC,EAAE,YAAY,EAC/E,KAAK,cAAc,OAAOP,EAAGO,EAAIP,EAAG,IAAI27B,EAAYnsB,EAAO0X,CAAG,CAAC,CAChE,CACD,CAEO,UAAQ,CACd,OAAO,KAAK,cAAc,IAAI5hB,GAAKA,EAAE,SAAQ,CAAE,EAAE,KAAK,IAAI,CAC3D,CAKO,iBAAiBgI,EAAkB,CAEzC,IAAItN,EAAI,EACR,KAAOA,EAAI,KAAK,cAAc,QAAU,KAAK,cAAcA,CAAC,EAAE,cAAgBsN,EAAM,OACnFtN,IAED,OAAOA,EAAI,KAAK,cAAc,QAAU,KAAK,cAAcA,CAAC,EAAE,MAAQsN,EAAM,YAC7E,CAEO,mBAAmBA,EAAkB,CAE3C,MAAM5P,EAAS,IAAIo+B,EACnB,UAAWvvB,KAAS,KAAK,cAAe,CACvC,MAAMwvB,EAAexvB,EAAM,UAAUe,CAAK,EACtCyuB,GACHr+B,EAAO,SAASq+B,CAAY,CAE9B,CACA,OAAOr+B,CACR,CAEO,yBAAyB4P,EAAkB,CACjD,OAAO,KAAK,mBAAmBA,CAAK,EAAE,MACvC,CAEA,IAAW,QAAM,CAChB,OAAO,KAAK,cAAc,OAAO,CAAC0uB,EAAMhZ,IAAQgZ,EAAOhZ,EAAI,OAAQ,CAAC,CACrE,EAvDD3X,EAAA,eAAAywB,kHC7IA,MAAaG,CAAQ,CAUpB,YAAYC,EAAoBC,EAAc,CAC7C,KAAK,WAAaD,EAClB,KAAK,OAASC,CACf,CAQA,KAAKC,EAAwB,KAAK,WAAYC,EAAoB,KAAK,OAAM,CAC5E,OAAID,IAAkB,KAAK,YAAcC,IAAc,KAAK,OACpD,KAEA,IAAIJ,EAASG,EAAeC,CAAS,CAE9C,CAQA,MAAMC,EAA0B,EAAGC,EAAsB,EAAC,CACzD,OAAO,KAAK,KAAK,KAAK,WAAaD,EAAiB,KAAK,OAASC,CAAW,CAC9E,CAKO,OAAOjvB,EAAgB,CAC7B,OAAO2uB,EAAS,OAAO,KAAM3uB,CAAK,CACnC,CAKO,OAAO,OAAOnN,EAAqBC,EAAmB,CAC5D,MAAI,CAACD,GAAK,CAACC,EACH,GAGP,CAAC,CAACD,GACF,CAAC,CAACC,GACFD,EAAE,aAAeC,EAAE,YACnBD,EAAE,SAAWC,EAAE,MAEjB,CAMO,SAASkN,EAAgB,CAC/B,OAAO2uB,EAAS,SAAS,KAAM3uB,CAAK,CACrC,CAMO,OAAO,SAASnN,EAAcC,EAAY,CAChD,OAAID,EAAE,WAAaC,EAAE,WACb,GAEJA,EAAE,WAAaD,EAAE,WACb,GAEDA,EAAE,OAASC,EAAE,MACrB,CAMO,gBAAgBkN,EAAgB,CACtC,OAAO2uB,EAAS,gBAAgB,KAAM3uB,CAAK,CAC5C,CAMO,OAAO,gBAAgBnN,EAAcC,EAAY,CACvD,OAAID,EAAE,WAAaC,EAAE,WACb,GAEJA,EAAE,WAAaD,EAAE,WACb,GAEDA,EAAE,QAAUC,EAAE,MACtB,CAKO,OAAO,QAAQD,EAAcC,EAAY,CAC/C,MAAMo8B,EAAcr8B,EAAE,WAAa,EAC7Bs8B,EAAcr8B,EAAE,WAAa,EAEnC,GAAIo8B,IAAgBC,EAAa,CAChC,MAAMC,EAAUv8B,EAAE,OAAS,EACrBw8B,EAAUv8B,EAAE,OAAS,EAC3B,OAAOs8B,EAAUC,CAClB,CAEA,OAAOH,EAAcC,CACtB,CAKO,OAAK,CACX,OAAO,IAAIR,EAAS,KAAK,WAAY,KAAK,MAAM,CACjD,CAKO,UAAQ,CACd,MAAO,IAAM,KAAK,WAAa,IAAM,KAAK,OAAS,GACpD,CAOO,OAAO,KAAKW,EAAc,CAChC,OAAO,IAAIX,EAASW,EAAI,WAAYA,EAAI,MAAM,CAC/C,CAKO,OAAO,YAAY/9B,EAAQ,CACjC,OACCA,GACI,OAAOA,EAAI,YAAe,UAC1B,OAAOA,EAAI,QAAW,QAE5B,CAEO,QAAM,CACZ,MAAO,CACN,WAAY,KAAK,WACjB,OAAQ,KAAK,OAEf,EAhKDwM,EAAA,SAAA4wB,mHCUA,MAAaY,CAAK,CAmBjB,YAAYC,EAAyBC,EAAqBC,EAAuBC,EAAiB,CAC5FH,EAAkBE,GAAmBF,IAAoBE,GAAiBD,EAAcE,GAC5F,KAAK,gBAAkBD,EACvB,KAAK,YAAcC,EACnB,KAAK,cAAgBH,EACrB,KAAK,UAAYC,IAEjB,KAAK,gBAAkBD,EACvB,KAAK,YAAcC,EACnB,KAAK,cAAgBC,EACrB,KAAK,UAAYC,EAEnB,CAKO,SAAO,CACb,OAAOJ,EAAM,QAAQ,IAAI,CAC1B,CAKO,OAAO,QAAQtwB,EAAa,CAClC,OAAQA,EAAM,kBAAoBA,EAAM,eAAiBA,EAAM,cAAgBA,EAAM,SACtF,CAKO,iBAAiB2wB,EAAmB,CAC1C,OAAOL,EAAM,iBAAiB,KAAMK,CAAQ,CAC7C,CAKO,OAAO,iBAAiB3wB,EAAe2wB,EAAmB,CAOhE,MANI,EAAAA,EAAS,WAAa3wB,EAAM,iBAAmB2wB,EAAS,WAAa3wB,EAAM,eAG3E2wB,EAAS,aAAe3wB,EAAM,iBAAmB2wB,EAAS,OAAS3wB,EAAM,aAGzE2wB,EAAS,aAAe3wB,EAAM,eAAiB2wB,EAAS,OAAS3wB,EAAM,UAI5E,CAMO,OAAO,uBAAuBA,EAAe2wB,EAAmB,CAOtE,MANI,EAAAA,EAAS,WAAa3wB,EAAM,iBAAmB2wB,EAAS,WAAa3wB,EAAM,eAG3E2wB,EAAS,aAAe3wB,EAAM,iBAAmB2wB,EAAS,QAAU3wB,EAAM,aAG1E2wB,EAAS,aAAe3wB,EAAM,eAAiB2wB,EAAS,QAAU3wB,EAAM,UAI7E,CAKO,cAAcA,EAAa,CACjC,OAAOswB,EAAM,cAAc,KAAMtwB,CAAK,CACvC,CAKO,OAAO,cAAcA,EAAe4wB,EAAkB,CAU5D,MATI,EAAAA,EAAW,gBAAkB5wB,EAAM,iBAAmB4wB,EAAW,cAAgB5wB,EAAM,iBAGvF4wB,EAAW,gBAAkB5wB,EAAM,eAAiB4wB,EAAW,cAAgB5wB,EAAM,eAGrF4wB,EAAW,kBAAoB5wB,EAAM,iBAAmB4wB,EAAW,YAAc5wB,EAAM,aAGvF4wB,EAAW,gBAAkB5wB,EAAM,eAAiB4wB,EAAW,UAAY5wB,EAAM,UAItF,CAKO,oBAAoBA,EAAa,CACvC,OAAOswB,EAAM,oBAAoB,KAAMtwB,CAAK,CAC7C,CAKO,OAAO,oBAAoBA,EAAe4wB,EAAkB,CAUlE,MATI,EAAAA,EAAW,gBAAkB5wB,EAAM,iBAAmB4wB,EAAW,cAAgB5wB,EAAM,iBAGvF4wB,EAAW,gBAAkB5wB,EAAM,eAAiB4wB,EAAW,cAAgB5wB,EAAM,eAGrF4wB,EAAW,kBAAoB5wB,EAAM,iBAAmB4wB,EAAW,aAAe5wB,EAAM,aAGxF4wB,EAAW,gBAAkB5wB,EAAM,eAAiB4wB,EAAW,WAAa5wB,EAAM,UAIvF,CAMO,UAAUA,EAAa,CAC7B,OAAOswB,EAAM,UAAU,KAAMtwB,CAAK,CACnC,CAMO,OAAO,UAAUpM,EAAWC,EAAS,CAC3C,IAAI08B,EACAC,EACAC,EACAC,EAEJ,OAAI78B,EAAE,gBAAkBD,EAAE,iBACzB28B,EAAkB18B,EAAE,gBACpB28B,EAAc38B,EAAE,aACNA,EAAE,kBAAoBD,EAAE,iBAClC28B,EAAkB18B,EAAE,gBACpB28B,EAAc,KAAK,IAAI38B,EAAE,YAAaD,EAAE,WAAW,IAEnD28B,EAAkB38B,EAAE,gBACpB48B,EAAc58B,EAAE,aAGbC,EAAE,cAAgBD,EAAE,eACvB68B,EAAgB58B,EAAE,cAClB68B,EAAY78B,EAAE,WACJA,EAAE,gBAAkBD,EAAE,eAChC68B,EAAgB58B,EAAE,cAClB68B,EAAY,KAAK,IAAI78B,EAAE,UAAWD,EAAE,SAAS,IAE7C68B,EAAgB78B,EAAE,cAClB88B,EAAY98B,EAAE,WAGR,IAAI08B,EAAMC,EAAiBC,EAAaC,EAAeC,CAAS,CACxE,CAKO,gBAAgB1wB,EAAa,CACnC,OAAOswB,EAAM,gBAAgB,KAAMtwB,CAAK,CACzC,CAKO,OAAO,gBAAgBpM,EAAWC,EAAS,CACjD,IAAIg9B,EAAwBj9B,EAAE,gBAC1Bk9B,EAAoBl9B,EAAE,YACtBm9B,EAAsBn9B,EAAE,cACxBo9B,EAAkBp9B,EAAE,UACxB,MAAMq9B,EAAuBp9B,EAAE,gBACzBq9B,EAAmBr9B,EAAE,YACrBs9B,EAAqBt9B,EAAE,cACvBu9B,EAAiBv9B,EAAE,UAoBzB,OAlBIg9B,EAAwBI,GAC3BJ,EAAwBI,EACxBH,EAAoBI,GACVL,IAA0BI,IACpCH,EAAoB,KAAK,IAAIA,EAAmBI,CAAgB,GAG7DH,EAAsBI,GACzBJ,EAAsBI,EACtBH,EAAkBI,GACRL,IAAwBI,IAClCH,EAAkB,KAAK,IAAIA,EAAiBI,CAAc,GAIvDP,EAAwBE,GAGxBF,IAA0BE,GAAuBD,EAAoBE,EACjE,KAED,IAAIV,EAAMO,EAAuBC,EAAmBC,EAAqBC,CAAe,CAChG,CAKO,YAAYjwB,EAAgC,CAClD,OAAOuvB,EAAM,YAAY,KAAMvvB,CAAK,CACrC,CAKO,OAAO,YAAYnN,EAA8BC,EAA4B,CACnF,MAAI,CAACD,GAAK,CAACC,EACH,GAGP,CAAC,CAACD,GACF,CAAC,CAACC,GACFD,EAAE,kBAAoBC,EAAE,iBACxBD,EAAE,cAAgBC,EAAE,aACpBD,EAAE,gBAAkBC,EAAE,eACtBD,EAAE,YAAcC,EAAE,SAEpB,CAKO,gBAAc,CACpB,OAAOy8B,EAAM,eAAe,IAAI,CACjC,CAKO,OAAO,eAAetwB,EAAa,CACzC,OAAO,IAAIqxB,EAAA,SAASrxB,EAAM,cAAeA,EAAM,SAAS,CACzD,CAKO,kBAAgB,CACtB,OAAOswB,EAAM,iBAAiB,IAAI,CACnC,CAKO,OAAO,iBAAiBtwB,EAAa,CAC3C,OAAO,IAAIqxB,EAAA,SAASrxB,EAAM,gBAAiBA,EAAM,WAAW,CAC7D,CAKO,UAAQ,CACd,MAAO,IAAM,KAAK,gBAAkB,IAAM,KAAK,YAAc,OAAS,KAAK,cAAgB,IAAM,KAAK,UAAY,GACnH,CAKO,eAAeywB,EAAuBC,EAAiB,CAC7D,OAAO,IAAIJ,EAAM,KAAK,gBAAiB,KAAK,YAAaG,EAAeC,CAAS,CAClF,CAKO,iBAAiBH,EAAyBC,EAAmB,CACnE,OAAO,IAAIF,EAAMC,EAAiBC,EAAa,KAAK,cAAe,KAAK,SAAS,CAClF,CAKO,iBAAe,CACrB,OAAOF,EAAM,gBAAgB,IAAI,CAClC,CAKO,OAAO,gBAAgBtwB,EAAa,CAC1C,OAAO,IAAIswB,EAAMtwB,EAAM,gBAAiBA,EAAM,YAAaA,EAAM,gBAAiBA,EAAM,WAAW,CACpG,CAKO,eAAa,CACnB,OAAOswB,EAAM,cAAc,IAAI,CAChC,CAKO,OAAO,cAActwB,EAAa,CACxC,OAAO,IAAIswB,EAAMtwB,EAAM,cAAeA,EAAM,UAAWA,EAAM,cAAeA,EAAM,SAAS,CAC5F,CAKO,MAAMsxB,EAAiB,CAC7B,OAAO,IAAIhB,EAAM,KAAK,gBAAkBgB,EAAW,KAAK,YAAa,KAAK,cAAgBA,EAAW,KAAK,SAAS,CACpH,CAIO,OAAO,cAAcruB,EAAkB0X,EAAiB1X,EAAK,CACnE,OAAO,IAAIqtB,EAAMrtB,EAAM,WAAYA,EAAM,OAAQ0X,EAAI,WAAYA,EAAI,MAAM,CAC5E,CAQO,OAAO,KAAK3a,EAAgC,CAClD,OAAKA,EAGE,IAAIswB,EAAMtwB,EAAM,gBAAiBA,EAAM,YAAaA,EAAM,cAAeA,EAAM,SAAS,EAFvF,IAGT,CAKO,OAAO,SAAS1N,EAAQ,CAC9B,OACCA,GACI,OAAOA,EAAI,iBAAoB,UAC/B,OAAOA,EAAI,aAAgB,UAC3B,OAAOA,EAAI,eAAkB,UAC7B,OAAOA,EAAI,WAAc,QAE/B,CAKO,OAAO,0BAA0BsB,EAAWC,EAAS,CAO3D,MALI,EAAAD,EAAE,cAAgBC,EAAE,iBAAoBD,EAAE,gBAAkBC,EAAE,iBAAmBD,EAAE,UAAYC,EAAE,aAKjGA,EAAE,cAAgBD,EAAE,iBAAoBC,EAAE,gBAAkBD,EAAE,iBAAmBC,EAAE,UAAYD,EAAE,YAMtG,CAKO,OAAO,gBAAgBA,EAAWC,EAAS,CAOjD,MALI,EAAAD,EAAE,cAAgBC,EAAE,iBAAoBD,EAAE,gBAAkBC,EAAE,iBAAmBD,EAAE,WAAaC,EAAE,aAKlGA,EAAE,cAAgBD,EAAE,iBAAoBC,EAAE,gBAAkBD,EAAE,iBAAmBC,EAAE,WAAaD,EAAE,YAMvG,CAMO,OAAO,yBAAyBA,EAA8BC,EAA4B,CAChG,GAAID,GAAKC,EAAG,CACX,MAAM09B,EAAmB39B,EAAE,gBAAkB,EACvC49B,EAAmB39B,EAAE,gBAAkB,EAE7C,GAAI09B,IAAqBC,EAAkB,CAC1C,MAAMC,EAAe79B,EAAE,YAAc,EAC/B89B,EAAe79B,EAAE,YAAc,EAErC,GAAI49B,IAAiBC,EAAc,CAClC,MAAMC,EAAiB/9B,EAAE,cAAgB,EACnCg+B,EAAiB/9B,EAAE,cAAgB,EAEzC,GAAI89B,IAAmBC,EAAgB,CACtC,MAAMC,EAAaj+B,EAAE,UAAY,EAC3Bk+B,EAAaj+B,EAAE,UAAY,EACjC,OAAOg+B,EAAaC,CACrB,CACA,OAAOH,EAAiBC,CACzB,CACA,OAAOH,EAAeC,CACvB,CACA,OAAOH,EAAmBC,CAC3B,CAGA,OAFiB59B,EAAI,EAAI,IACRC,EAAI,EAAI,EAE1B,CAMO,OAAO,uBAAuBD,EAAWC,EAAS,CACxD,OAAID,EAAE,gBAAkBC,EAAE,cACrBD,EAAE,YAAcC,EAAE,UACjBD,EAAE,kBAAoBC,EAAE,gBACpBD,EAAE,YAAcC,EAAE,YAEnBD,EAAE,gBAAkBC,EAAE,gBAEvBD,EAAE,UAAYC,EAAE,UAEjBD,EAAE,cAAgBC,EAAE,aAC5B,CAKO,OAAO,mBAAmBmM,EAAa,CAC7C,OAAOA,EAAM,cAAgBA,EAAM,eACpC,CAEO,QAAM,CACZ,OAAO,IACR,EA7cDlB,EAAA,MAAAwxB,oJCnBA,MAAayB,CAAS,CAEd,OAAO,mBAAmB/xB,EAAY,CAC5C,OAAO,IAAI+xB,EAAU/xB,EAAM,gBAAiBA,EAAM,cAAgB,CAAC,CACpE,CAKO,OAAO,SAASgyB,EAA6C,CACnE,GAAIA,EAAW,SAAW,EACzB,MAAO,CAAA,EAER,IAAI7gC,EAAS,IAAI8gC,EAAaD,EAAW,CAAC,EAAE,MAAK,CAAE,EACnD,QAASv+B,EAAI,EAAGA,EAAIu+B,EAAW,OAAQv+B,IACtCtC,EAASA,EAAO,SAAS,IAAI8gC,EAAaD,EAAWv+B,CAAC,EAAE,MAAK,CAAE,CAAC,EAEjE,OAAOtC,EAAO,MACf,CAEO,OAAO,KAAK6gC,EAAuB,CACzC,GAAIA,EAAW,SAAW,EACzB,MAAM,IAAIvmB,EAAA,mBAAmB,4BAA4B,EAE1D,IAAI8kB,EAAkByB,EAAW,CAAC,EAAE,gBAChCE,EAAyBF,EAAW,CAAC,EAAE,uBAC3C,QAASv+B,EAAI,EAAGA,EAAIu+B,EAAW,OAAQv+B,IACtC88B,EAAkB,KAAK,IAAIA,EAAiByB,EAAWv+B,CAAC,EAAE,eAAe,EACzEy+B,EAAyB,KAAK,IAAIA,EAAwBF,EAAWv+B,CAAC,EAAE,sBAAsB,EAE/F,OAAO,IAAIs+B,EAAUxB,EAAiB2B,CAAsB,CAC7D,CAEO,OAAO,SAAS3B,EAAyBnvB,EAAc,CAC7D,OAAO,IAAI2wB,EAAUxB,EAAiBA,EAAkBnvB,CAAM,CAC/D,CAKO,OAAO,YAAY+wB,EAA+B,CACxD,OAAO,IAAIJ,EAAUI,EAAU,CAAC,EAAGA,EAAU,CAAC,CAAC,CAChD,CAYA,YACC5B,EACA2B,EAA8B,CAE9B,GAAI3B,EAAkB2B,EACrB,MAAM,IAAIzmB,EAAA,mBAAmB,mBAAmB8kB,CAAe,2CAA2C2B,CAAsB,EAAE,EAEnI,KAAK,gBAAkB3B,EACvB,KAAK,uBAAyB2B,CAC/B,CAKO,SAASvC,EAAkB,CACjC,OAAO,KAAK,iBAAmBA,GAAcA,EAAa,KAAK,sBAChE,CAKA,IAAI,SAAO,CACV,OAAO,KAAK,kBAAoB,KAAK,sBACtC,CAKO,MAAM9Q,EAAc,CAC1B,OAAO,IAAIkT,EAAU,KAAK,gBAAkBlT,EAAQ,KAAK,uBAAyBA,CAAM,CACzF,CAEO,YAAYA,EAAc,CAChC,OAAO,IAAIkT,EAAU,KAAK,gBAAiB,KAAK,uBAAyBlT,CAAM,CAChF,CAKA,IAAW,QAAM,CAChB,OAAO,KAAK,uBAAyB,KAAK,eAC3C,CAKO,KAAK9d,EAAgB,CAC3B,OAAO,IAAIgxB,EACV,KAAK,IAAI,KAAK,gBAAiBhxB,EAAM,eAAe,EACpD,KAAK,IAAI,KAAK,uBAAwBA,EAAM,sBAAsB,CAAC,CAErE,CAEO,UAAQ,CACd,MAAO,IAAI,KAAK,eAAe,IAAI,KAAK,sBAAsB,GAC/D,CAMO,UAAUA,EAAgB,CAChC,MAAMwvB,EAAkB,KAAK,IAAI,KAAK,gBAAiBxvB,EAAM,eAAe,EACtEmxB,EAAyB,KAAK,IAAI,KAAK,uBAAwBnxB,EAAM,sBAAsB,EACjG,GAAIwvB,GAAmB2B,EACtB,OAAO,IAAIH,EAAUxB,EAAiB2B,CAAsB,CAG9D,CAEO,iBAAiBnxB,EAAgB,CACvC,OAAO,KAAK,gBAAkBA,EAAM,wBAA0BA,EAAM,gBAAkB,KAAK,sBAC5F,CAEO,eAAeA,EAAgB,CACrC,OAAO,KAAK,iBAAmBA,EAAM,wBAA0BA,EAAM,iBAAmB,KAAK,sBAC9F,CAEO,OAAOlN,EAAY,CACzB,OAAO,KAAK,kBAAoBA,EAAE,iBAAmB,KAAK,yBAA2BA,EAAE,sBACxF,CAEO,kBAAgB,CACtB,OAAI,KAAK,QACD,KAED,IAAIu+B,EAAA,MAAM,KAAK,gBAAiB,EAAG,KAAK,uBAAyB,EAAG,OAAO,gBAAgB,CACnG,CAKO,kBAAgB,CACtB,OAAO,IAAIA,EAAA,MAAM,KAAK,gBAAiB,EAAG,KAAK,uBAAwB,CAAC,CACzE,CAEO,eAAkB9vB,EAA4B,CACpD,MAAMnR,EAAc,CAAA,EACpB,QAASw+B,EAAa,KAAK,gBAAiBA,EAAa,KAAK,uBAAwBA,IACrFx+B,EAAO,KAAKmR,EAAEqtB,CAAU,CAAC,EAE1B,OAAOx+B,CACR,CAEO,QAAQmR,EAA+B,CAC7C,QAASqtB,EAAa,KAAK,gBAAiBA,EAAa,KAAK,uBAAwBA,IACrFrtB,EAAEqtB,CAAU,CAEd,CAKO,WAAS,CACf,MAAO,CAAC,KAAK,gBAAiB,KAAK,sBAAsB,CAC1D,CAEO,SAASA,EAAkB,CACjC,OAAO,KAAK,iBAAmBA,GAAcA,EAAa,KAAK,sBAChE,CAMO,eAAa,CACnB,OAAO,IAAI0C,EAAA,YAAY,KAAK,gBAAkB,EAAG,KAAK,uBAAyB,CAAC,CACjF,EArLDvzB,EAAA,UAAAizB,EA2LA,MAAaE,CAAY,CACxB,YAKkBK,EAAiC,CAAA,EAAE,CAAnC,KAAA,kBAAAA,CAElB,CAEA,IAAI,QAAM,CACT,OAAO,KAAK,iBACb,CAEA,SAAStyB,EAAgB,CACxB,GAAIA,EAAM,SAAW,EACpB,OAOD,MAAMuyB,KAAoBC,EAAA,gCAA+B,KAAK,kBAAmBz5B,GAAKA,EAAE,wBAA0BiH,EAAM,eAAe,EAEjIyyB,KAA2BD,EAAA,uBAAsB,KAAK,kBAAmBz5B,GAAKA,EAAE,iBAAmBiH,EAAM,sBAAsB,EAAI,EAEzI,GAAIuyB,IAAsBE,EAEzB,KAAK,kBAAkB,OAAOF,EAAmB,EAAGvyB,CAAK,UAC/CuyB,IAAsBE,EAA2B,EAAG,CAE9D,MAAMC,EAAY,KAAK,kBAAkBH,CAAiB,EAC1D,KAAK,kBAAkBA,CAAiB,EAAIG,EAAU,KAAK1yB,CAAK,CACjE,KAAO,CAEN,MAAM0yB,EAAY,KAAK,kBAAkBH,CAAiB,EAAE,KAAK,KAAK,kBAAkBE,EAA2B,CAAC,CAAC,EAAE,KAAKzyB,CAAK,EACjI,KAAK,kBAAkB,OAAOuyB,EAAmBE,EAA2BF,EAAmBG,CAAS,CACzG,CACD,CAEA,SAAS/C,EAAkB,CAC1B,MAAMgD,KAA2BH,EAAA,oBAAmB,KAAK,kBAAmBz5B,GAAKA,EAAE,iBAAmB42B,CAAU,EAChH,MAAO,CAAC,CAACgD,GAA4BA,EAAyB,uBAAyBhD,CACxF,CAEA,WAAW3vB,EAAgB,CAC1B,MAAM2yB,KAA2BH,EAAA,oBAAmB,KAAK,kBAAmBz5B,GAAKA,EAAE,gBAAkBiH,EAAM,sBAAsB,EACjI,MAAO,CAAC,CAAC2yB,GAA4BA,EAAyB,uBAAyB3yB,EAAM,eAC9F,CAEA,SAASe,EAAmB,CAC3B,GAAI,KAAK,kBAAkB,SAAW,EACrC,OAAOA,EAER,GAAIA,EAAM,kBAAkB,SAAW,EACtC,OAAO,KAGR,MAAM5P,EAAsB,CAAA,EAC5B,IAAIyhC,EAAK,EACL3E,EAAK,EACL3a,EAA4B,KAChC,KAAOsf,EAAK,KAAK,kBAAkB,QAAU3E,EAAKltB,EAAM,kBAAkB,QAAQ,CACjF,IAAIyM,EAAyB,KAC7B,GAAIolB,EAAK,KAAK,kBAAkB,QAAU3E,EAAKltB,EAAM,kBAAkB,OAAQ,CAC9E,MAAM8xB,EAAa,KAAK,kBAAkBD,CAAE,EACtCE,EAAa/xB,EAAM,kBAAkBktB,CAAE,EACzC4E,EAAW,gBAAkBC,EAAW,iBAC3CtlB,EAAOqlB,EACPD,MAEAplB,EAAOslB,EACP7E,IAEF,MAAW2E,EAAK,KAAK,kBAAkB,QACtCplB,EAAO,KAAK,kBAAkBolB,CAAE,EAChCA,MAEAplB,EAAOzM,EAAM,kBAAkBktB,CAAE,EACjCA,KAGG3a,IAAY,KACfA,EAAU9F,EAEN8F,EAAQ,wBAA0B9F,EAAK,gBAE1C8F,EAAU,IAAIye,EAAUze,EAAQ,gBAAiB,KAAK,IAAIA,EAAQ,uBAAwB9F,EAAK,sBAAsB,CAAC,GAGtHrc,EAAO,KAAKmiB,CAAO,EACnBA,EAAU9F,EAGb,CACA,OAAI8F,IAAY,MACfniB,EAAO,KAAKmiB,CAAO,EAEb,IAAI2e,EAAa9gC,CAAM,CAC/B,CAKA,aAAa6O,EAAgB,CAE5B,MAAMuyB,KAAoBC,EAAA,gCAA+B,KAAK,kBAAmBz5B,GAAKA,EAAE,wBAA0BiH,EAAM,eAAe,EAEjIyyB,KAA2BD,EAAA,uBAAsB,KAAK,kBAAmBz5B,GAAKA,EAAE,iBAAmBiH,EAAM,sBAAsB,EAAI,EAEzI,GAAIuyB,IAAsBE,EACzB,OAAO,IAAIR,EAAa,CAACjyB,CAAK,CAAC,EAGhC,MAAM7O,EAAsB,CAAA,EAC5B,IAAIo/B,EAAkBvwB,EAAM,gBAC5B,QAASvM,EAAI8+B,EAAmB9+B,EAAIg/B,EAA0Bh/B,IAAK,CAClE,MAAMsF,EAAI,KAAK,kBAAkBtF,CAAC,EAC9BsF,EAAE,gBAAkBw3B,GACvBp/B,EAAO,KAAK,IAAI4gC,EAAUxB,EAAiBx3B,EAAE,eAAe,CAAC,EAE9Dw3B,EAAkBx3B,EAAE,sBACrB,CACA,OAAIw3B,EAAkBvwB,EAAM,wBAC3B7O,EAAO,KAAK,IAAI4gC,EAAUxB,EAAiBvwB,EAAM,sBAAsB,CAAC,EAGlE,IAAIiyB,EAAa9gC,CAAM,CAC/B,CAEA,UAAQ,CACP,OAAO,KAAK,kBAAkB,IAAI4H,GAAKA,EAAE,SAAQ,CAAE,EAAE,KAAK,IAAI,CAC/D,CAEA,gBAAgBgI,EAAmB,CAClC,MAAM5P,EAAsB,CAAA,EAE5B,IAAIyhC,EAAK,EACL3E,EAAK,EACT,KAAO2E,EAAK,KAAK,kBAAkB,QAAU3E,EAAKltB,EAAM,kBAAkB,QAAQ,CACjF,MAAMgtB,EAAK,KAAK,kBAAkB6E,CAAE,EAC9B5E,EAAKjtB,EAAM,kBAAkBktB,CAAE,EAE/Bx6B,EAAIs6B,EAAG,UAAUC,CAAE,EACrBv6B,GAAK,CAACA,EAAE,SACXtC,EAAO,KAAKsC,CAAC,EAGVs6B,EAAG,uBAAyBC,EAAG,uBAClC4E,IAEA3E,GAEF,CAEA,OAAO,IAAIgE,EAAa9gC,CAAM,CAC/B,CAEA,aAAauB,EAAa,CACzB,OAAO,IAAIu/B,EAAa,KAAK,kBAAkB,IAAIl5B,GAAKA,EAAE,MAAMrG,CAAK,CAAC,CAAC,CACxE,EAjKDoM,EAAA,aAAAmzB,4HCvJA,MAAac,UAAkBX,EAAA,KAAK,CAkBnC,YAAYY,EAAkCC,EAA8BC,EAA4BC,EAAsB,CAC7H,MAAMH,EAA0BC,EAAsBC,EAAoBC,CAAc,EACxF,KAAK,yBAA2BH,EAChC,KAAK,qBAAuBC,EAC5B,KAAK,mBAAqBC,EAC1B,KAAK,eAAiBC,CACvB,CAKgB,UAAQ,CACvB,MAAO,IAAM,KAAK,yBAA2B,IAAM,KAAK,qBAAuB,OAAS,KAAK,mBAAqB,IAAM,KAAK,eAAiB,GAC/I,CAKO,gBAAgBpyB,EAAiB,CACvC,OACCgyB,EAAU,gBAAgB,KAAMhyB,CAAK,CAEvC,CAKO,OAAO,gBAAgBnN,EAAeC,EAAa,CACzD,OACCD,EAAE,2BAA6BC,EAAE,0BACjCD,EAAE,uBAAyBC,EAAE,sBAC7BD,EAAE,qBAAuBC,EAAE,oBAC3BD,EAAE,iBAAmBC,EAAE,cAEzB,CAKO,cAAY,CAClB,OAAI,KAAK,2BAA6B,KAAK,iBAAmB,KAAK,uBAAyB,KAAK,YAChG,EAED,CACD,CAKgB,eAAe48B,EAAuBC,EAAiB,CACtE,OAAI,KAAK,aAAY,IAAE,EACf,IAAIqC,EAAU,KAAK,gBAAiB,KAAK,YAAatC,EAAeC,CAAS,EAE/E,IAAIqC,EAAUtC,EAAeC,EAAW,KAAK,gBAAiB,KAAK,WAAW,CACtF,CAKO,aAAW,CACjB,OAAO,IAAIW,EAAA,SAAS,KAAK,mBAAoB,KAAK,cAAc,CACjE,CAKO,mBAAiB,CACvB,OAAO,IAAIA,EAAA,SAAS,KAAK,yBAA0B,KAAK,oBAAoB,CAC7E,CAKgB,iBAAiBd,EAAyBC,EAAmB,CAC5E,OAAI,KAAK,aAAY,IAAE,EACf,IAAIuC,EAAUxC,EAAiBC,EAAa,KAAK,cAAe,KAAK,SAAS,EAE/E,IAAIuC,EAAU,KAAK,cAAe,KAAK,UAAWxC,EAAiBC,CAAW,CACtF,CAOO,OAAgB,cAAcvtB,EAAkB0X,EAAiB1X,EAAK,CAC5E,OAAO,IAAI8vB,EAAU9vB,EAAM,WAAYA,EAAM,OAAQ0X,EAAI,WAAYA,EAAI,MAAM,CAChF,CAKO,OAAO,UAAU3a,EAAcozB,EAA6B,CAClE,OAAIA,IAAS,EACL,IAAIL,EAAU/yB,EAAM,gBAAiBA,EAAM,YAAaA,EAAM,cAAeA,EAAM,SAAS,EAE5F,IAAI+yB,EAAU/yB,EAAM,cAAeA,EAAM,UAAWA,EAAM,gBAAiBA,EAAM,WAAW,CAErG,CAKO,OAAO,cAAcqzB,EAAe,CAC1C,OAAO,IAAIN,EAAUM,EAAI,yBAA0BA,EAAI,qBAAsBA,EAAI,mBAAoBA,EAAI,cAAc,CACxH,CAKO,OAAO,mBAAmBz/B,EAAiBC,EAAe,CAChE,GAAID,GAAK,CAACC,GAAK,CAACD,GAAKC,EACpB,MAAO,GAER,GAAI,CAACD,GAAK,CAACC,EACV,MAAO,GAER,GAAID,EAAE,SAAWC,EAAE,OAClB,MAAO,GAER,QAASJ,EAAI,EAAGrC,EAAMwC,EAAE,OAAQH,EAAIrC,EAAKqC,IACxC,GAAI,CAAC,KAAK,gBAAgBG,EAAEH,CAAC,EAAGI,EAAEJ,CAAC,CAAC,EACnC,MAAO,GAGT,MAAO,EACR,CAKO,OAAO,aAAanB,EAAQ,CAClC,OACCA,GACI,OAAOA,EAAI,0BAA6B,UACxC,OAAOA,EAAI,sBAAyB,UACpC,OAAOA,EAAI,oBAAuB,UAClC,OAAOA,EAAI,gBAAmB,QAEpC,CAKO,OAAO,oBAAoBi+B,EAAyBC,EAAqBC,EAAuBC,EAAmB0C,EAA6B,CAEtJ,OAAIA,IAAS,EACL,IAAIL,EAAUxC,EAAiBC,EAAaC,EAAeC,CAAS,EAGrE,IAAIqC,EAAUtC,EAAeC,EAAWH,EAAiBC,CAAW,CAC5E,EAzKD1xB,EAAA,UAAAi0B,6HCvCA,MAAaO,CAAU,QACR,KAAA,KAAO,IAAIA,EAAW,EAAG,CAAC,CAAE,CAEnC,OAAO,iBAAiBC,EAAqBC,EAAmB,CACtE,OAAID,EAAU,aAAeC,EAAU,WAC/B,IAAIF,EAAW,EAAGE,EAAU,OAASD,EAAU,MAAM,EAErD,IAAID,EAAWE,EAAU,WAAaD,EAAU,WAAYC,EAAU,OAAS,CAAC,CAEzF,CAEO,OAAO,QAAQxzB,EAAY,CACjC,OAAOszB,EAAW,iBAAiBtzB,EAAM,iBAAgB,EAAIA,EAAM,eAAc,CAAE,CACpF,CAEO,OAAO,OAAOpK,EAAY,CAChC,IAAI69B,EAAO,EACP7D,EAAS,EACb,UAAW54B,KAAKpB,EACXoB,IAAM;GACTy8B,IACA7D,EAAS,GAETA,IAGF,OAAO,IAAI0D,EAAWG,EAAM7D,CAAM,CACnC,CAEA,YACiB0B,EACAoC,EAAmB,CADnB,KAAA,UAAApC,EACA,KAAA,YAAAoC,CACb,CAEG,uBAAuB3yB,EAAiB,CAC9C,OAAI,KAAK,YAAcA,EAAM,UACrB,KAAK,UAAYA,EAAM,UAExB,KAAK,aAAeA,EAAM,WAClC,CAEO,YAAY4yB,EAAuB,CACzC,OAAI,KAAK,YAAc,EACf,IAAIvB,EAAA,MAAMuB,EAAc,WAAYA,EAAc,OAAQA,EAAc,WAAYA,EAAc,OAAS,KAAK,WAAW,EAE3H,IAAIvB,EAAA,MAAMuB,EAAc,WAAYA,EAAc,OAAQA,EAAc,WAAa,KAAK,UAAW,KAAK,YAAc,CAAC,CAElI,CAEO,cAAchD,EAAkB,CACtC,OAAI,KAAK,YAAc,EACf,IAAIU,EAAA,SAASV,EAAS,WAAYA,EAAS,OAAS,KAAK,WAAW,EAEpE,IAAIU,EAAA,SAASV,EAAS,WAAa,KAAK,UAAW,KAAK,YAAc,CAAC,CAEhF,CAEA,UAAQ,CACP,MAAO,GAAG,KAAK,SAAS,IAAI,KAAK,WAAW,EAC7C,EA3DD7xB,EAAA,WAAAw0B,6ICJA,MAAaM,CAAyB,CAGrC,YAA4Bh+B,EAAY,CAAZ,KAAA,KAAAA,EAC3B,KAAK,yBAA2B,CAAA,EAChC,KAAK,yBAAyB,KAAK,CAAC,EACpC,QAASnC,EAAI,EAAGA,EAAImC,EAAK,OAAQnC,IAC5BmC,EAAK,OAAOnC,CAAC,IAAM;GACtB,KAAK,yBAAyB,KAAKA,EAAI,CAAC,CAG3C,CAEA,UAAUk9B,EAAkB,CAC3B,OAAO,KAAK,yBAAyBA,EAAS,WAAa,CAAC,EAAIA,EAAS,OAAS,CACnF,CAEA,eAAe3wB,EAAY,CAC1B,OAAO,IAAIqyB,EAAA,YACV,KAAK,UAAUryB,EAAM,iBAAgB,CAAE,EACvC,KAAK,UAAUA,EAAM,eAAc,CAAE,CAAC,CAExC,CAEA,IAAI,YAAU,CACb,MAAM6zB,EAAU,KAAK,yBAAyB,OAAS,EACvD,OAAO,IAAIC,EAAA,WAAWD,EAAS,KAAK,KAAK,OAAS,KAAK,yBAAyBA,CAAO,CAAC,CACzF,EA3BD/0B,EAAA,0BAAA80B,2LCOA,MAAaG,CAAQ,CAEpB,YAA4BC,EAAgC,CAAhC,KAAA,MAAAA,KAC3BC,EAAA,UAAS,OAAMA,EAAA,oBAAmBD,EAAO,CAACpgC,EAAGC,IAAMD,EAAE,MAAM,eAAc,EAAG,gBAAgBC,EAAE,MAAM,iBAAgB,CAAE,CAAC,CAAC,CACzH,CAEA,MAAM+B,EAAkB,CACvB,IAAIzE,EAAS,GACT+iC,EAAc,IAAI7C,EAAA,SAAS,EAAG,CAAC,EACnC,UAAW8C,KAAQ,KAAK,MAAO,CAC9B,MAAMC,EAAYD,EAAK,MACjBE,EAAYD,EAAU,iBAAgB,EACtCE,EAAUF,EAAU,eAAc,EAElCr7B,EAAIw7B,EAAmBL,EAAaG,CAAS,EAC9Ct7B,EAAE,QAAO,IACb5H,GAAUyE,EAAK,gBAAgBmD,CAAC,GAEjC5H,GAAUgjC,EAAK,KACfD,EAAcI,CACf,CACA,MAAMv7B,EAAIw7B,EAAmBL,EAAat+B,EAAK,oBAAoB,EACnE,OAAKmD,EAAE,QAAO,IACb5H,GAAUyE,EAAK,gBAAgBmD,CAAC,GAE1B5H,CACR,CAEA,cAAc+I,EAAW,CACxB,MAAMs6B,EAAU,IAAIC,EAAWv6B,CAAG,EAClC,OAAO,KAAK,MAAMs6B,CAAO,CAC1B,CAEA,cAAY,CACX,MAAME,EAAqB,CAAA,EAC3B,IAAIC,EAA4B,EAC5BC,EAAa,EACbC,EAAe,EACnB,UAAWV,KAAQ,KAAK,MAAO,CAC9B,MAAMW,EAAahB,EAAA,WAAW,OAAOK,EAAK,IAAI,EACxCY,EAAgB1D,EAAA,SAAS,KAAK,CACnC,WAAY8C,EAAK,MAAM,gBAAkBS,EACzC,OAAQT,EAAK,MAAM,aAAeA,EAAK,MAAM,kBAAoBQ,EAA4BE,EAAe,GAC5G,EACKG,EAAWF,EAAW,YAAYC,CAAa,EACrDL,EAAU,KAAKM,CAAQ,EACvBJ,EAAaI,EAAS,cAAgBb,EAAK,MAAM,cACjDU,EAAeG,EAAS,UAAYb,EAAK,MAAM,UAC/CQ,EAA4BR,EAAK,MAAM,aACxC,CACA,OAAOO,CACR,EAnDD51B,EAAA,SAAAi1B,EAsDA,MAAakB,CAAc,CAC1B,YACiBj1B,EACApK,EAAY,CADZ,KAAA,MAAAoK,EACA,KAAA,KAAApK,CAEjB,CAEO,uBAAqB,CAC3B,MAAO,CACN,MAAO,KAAK,MACZ,KAAM,KAAK,KAEb,EAZDkJ,EAAA,eAAAm2B,EAeA,SAASV,EAAmBtxB,EAAiB0X,EAAa,CACzD,GAAI1X,EAAM,aAAe0X,EAAI,YAAc1X,EAAM,SAAW,OAAO,iBAClE,OAAOmvB,EAAA,MAAM,cAAczX,EAAKA,CAAG,EAC7B,GAAI,CAAC1X,EAAM,gBAAgB0X,CAAG,EACpC,MAAM,IAAIlP,EAAA,mBAAmB,0BAA0B,EAExD,OAAO,IAAI2mB,EAAA,MAAMnvB,EAAM,WAAYA,EAAM,OAAQ0X,EAAI,WAAYA,EAAI,MAAM,CAC5E,CAEA,MAAsBua,CAAY,CAIjC,IAAI,sBAAoB,CACvB,OAAO,KAAK,OAAO,cAAc,IAAI7D,EAAA,SAAS,EAAG,CAAC,CAAC,CACpD,EANDvyB,EAAA,aAAAo2B,EASA,MAAaT,UAAmBS,CAAY,CAG3C,YAA4BxiC,EAAa,CACxC,MAAK,EADsB,KAAA,MAAAA,EAFX,KAAA,GAAK,IAAIyiC,EAAA,0BAA0B,KAAK,KAAK,CAI9D,CAEA,gBAAgBn1B,EAAY,CAC3B,OAAO,KAAK,GAAG,eAAeA,CAAK,EAAE,UAAU,KAAK,KAAK,CAC1D,CAEA,IAAI,QAAM,CACT,OAAO,KAAK,GAAG,UAChB,EAbDlB,EAAA,WAAA21B,4ICCA31B,EAAA,wBAAAs2B,EAtFA,MAAaC,UAAgCC,EAAA,mBAAuC,CAOnF,YAAYC,EAAwBC,EAAyD,CAC5F,MAAK,CAAA,EALW,KAAA,WAAoC,KAC7C,KAAA,YAA6B,KAC7B,KAAA,gBAAyC,CAAA,EAIhD,KAAK,qBAAuBA,EACxB,KAAK,qBAAqB,OAAS,EACtC,KAAK,WAAa,IAAI,KAAK,UAAU,KAAK,qBAAsB,CAAE,YAAa,MAAM,CAAE,EAEvF,KAAK,WAAa,KAGnB,QAAS/hC,EAAI,EAAGrC,EAAMmkC,EAAe,OAAQ9hC,EAAIrC,EAAKqC,IACrD,KAAK,IAAI8hC,EAAe,WAAW9hC,CAAC,EAAC,CAAA,EAGtC,KAAK,IAAG,GAAA,CAAA,EACR,KAAK,IAAG,EAAA,CAAA,CACT,CAEO,iCAAiCggC,EAAc5U,EAAc,CACnE,IAAIoB,EAAwC,KAC5C,UAAWwV,KAAW,KAAK,6BAA6BhC,CAAI,EAAG,CAC9D,GAAIgC,EAAQ,MAAQ5W,EACnB,MAEDoB,EAAYwV,CACb,CACA,OAAOxV,CACR,CAEO,gCAAgCyV,EAAqB7W,EAAc,CACzE,UAAW4W,KAAW,KAAK,6BAA6BC,CAAW,EAClE,GAAI,EAAAD,EAAQ,MAAQ5W,GAGpB,OAAO4W,EAER,OAAO,IACR,CAEQ,6BAA6BhC,EAAY,CAChD,OAAK,KAAK,WAKN,KAAK,cAAgBA,EACjB,KAAK,iBAIb,KAAK,YAAcA,EACnB,KAAK,gBAAkB,KAAK,oBAAoB,KAAK,WAAW,QAAQA,CAAI,CAAC,EAEtE,KAAK,iBAZJ,CAAA,CAaT,CAEQ,oBAAoBkC,EAAuB,CAClD,MAAMxkC,EAAgC,CAAA,EACtC,UAAWskC,KAAWE,EACjB,KAAK,YAAYF,CAAO,GAC3BtkC,EAAO,KAAKskC,CAAO,EAGrB,OAAOtkC,CACR,CAEQ,YAAYskC,EAAyB,CAC5C,MAAI,EAAAA,EAAQ,UAIb,EA7ED32B,EAAA,wBAAAu2B,EAoFA,MAAMO,EAAsB,IAAIC,EAAA,SAA0C,EAAE,EAE5E,SAAgBT,EAAwBG,EAAwBC,EAAyD,CACxH,MAAMhjC,EAAM,GAAG+iC,CAAc,IAAIC,EAAqB,KAAK,GAAG,CAAC,GAC/D,IAAIrkC,EAASykC,EAAoB,IAAIpjC,CAAG,EACxC,OAAKrB,IACJA,EAAS,IAAIkkC,EAAwBE,EAAgBC,CAAoB,EACzEI,EAAoB,IAAIpjC,EAAKrB,CAAM,GAE7BA,CACR,gKC3DA2N,EAAA,0BAAAg3B,EAyCAh3B,EAAA,cAAAi3B,EAnFaj3B,EAAA,sBAAwB,oCA2BrC,SAASk3B,EAAiBC,EAAuB,GAAE,CAClD,IAAI59B,EAAS,yBACb,UAAW69B,KAAOp3B,EAAA,sBACbm3B,EAAa,QAAQC,CAAG,GAAK,IAGjC79B,GAAU,KAAO69B,GAElB,OAAA79B,GAAU,SACH,IAAI,OAAOA,EAAQ,GAAG,CAC9B,CAGayG,EAAA,oBAAsBk3B,EAAgB,EAEnD,SAAgBF,EAA0BK,EAA8B,CACvE,IAAIhlC,EAAiB2N,EAAA,oBAErB,GAAIq3B,GAAmBA,aAA0B,OAChD,GAAKA,EAAe,OAanBhlC,EAASglC,MAbkB,CAC3B,IAAIC,EAAQ,IACRD,EAAe,aAClBC,GAAS,KAEND,EAAe,YAClBC,GAAS,KAEND,EAAe,UAClBC,GAAS,KAEVjlC,EAAS,IAAI,OAAOglC,EAAe,OAAQC,CAAK,CACjD,CAKD,OAAAjlC,EAAO,UAAY,EAEZA,CACR,CAUA,MAAMklC,EAAiB,IAAIxb,EAAA,WAC3Bwb,EAAe,QAAQ,CACtB,OAAQ,IACR,WAAY,GACZ,WAAY,IACZ,EAED,SAAgBN,EAAcnG,EAAgBuG,EAAwBvgC,EAAc0gC,EAAoB1+B,EAA6B,CAQpI,GANAu+B,EAAiBL,EAA0BK,CAAc,EAEpDv+B,IACJA,EAASmZ,EAAA,SAAS,MAAMslB,CAAc,GAGnCzgC,EAAK,OAASgC,EAAO,OAAQ,CAGhC,IAAIqL,EAAQ2sB,EAASh4B,EAAO,OAAS,EACrC,OAAIqL,EAAQ,EACXA,EAAQ,EAERqzB,GAAcrzB,EAEfrN,EAAOA,EAAK,UAAUqN,EAAO2sB,EAASh4B,EAAO,OAAS,CAAC,EAChDm+B,EAAcnG,EAAQuG,EAAgBvgC,EAAM0gC,EAAY1+B,CAAM,CACtE,CAEA,MAAM2+B,EAAK,KAAK,IAAG,EACblG,EAAMT,EAAS,EAAI0G,EAEzB,IAAIE,EAAiB,GACjBlc,EAAgC,KAEpC,QAAS7mB,EAAI,EAER,OAAK,IAAG,EAAK8iC,GAAM3+B,EAAO,YAFbnE,IAAK,CAQtB,MAAMgjC,EAAapG,EAAMz4B,EAAO,WAAanE,EAC7C0iC,EAAe,UAAY,KAAK,IAAI,EAAGM,CAAU,EACjD,MAAMC,EAAYC,EAAiCR,EAAgBvgC,EAAMy6B,EAAKmG,CAAc,EAU5F,GARI,CAACE,GAAapc,IAKlBA,EAAQoc,EAGJD,GAAc,GACjB,MAEDD,EAAiBC,CAClB,CAEA,GAAInc,EAAO,CACV,MAAMnpB,EAAS,CACd,KAAMmpB,EAAM,CAAC,EACb,YAAagc,EAAa,EAAIhc,EAAM,MACpC,UAAWgc,EAAa,EAAIhc,EAAM,MAAQA,EAAM,CAAC,EAAE,QAEpD,OAAA6b,EAAe,UAAY,EACpBhlC,CACR,CAEA,OAAO,IACR,CAEA,SAASwlC,EAAiCR,EAAwBvgC,EAAcy6B,EAAauG,EAAe,CAC3G,IAAItc,EACJ,KAAOA,EAAQ6b,EAAe,KAAKvgC,CAAI,GAAG,CACzC,MAAMihC,EAAavc,EAAM,OAAS,EAClC,GAAIuc,GAAcxG,GAAO8F,EAAe,WAAa9F,EACpD,OAAO/V,EACD,GAAIsc,EAAU,GAAKC,EAAaD,EACtC,OAAO,IAET,CACA,OAAO,IACR,sMCzJA,MAAaE,CAAmB,CAC/B,OAAO,QAAQC,EAAiBC,EAAe,CAC9C,OAAO,IAAIF,EAAoB,CAAC,IAAIG,EAAa5E,EAAA,YAAY,SAAS0E,EAAK,MAAM,EAAG1E,EAAA,YAAY,SAAS2E,EAAK,MAAM,CAAC,CAAC,EAAG,EAAK,CAC/H,CAEA,OAAO,gBAAgBD,EAAiBC,EAAe,CACtD,OAAO,IAAIF,EAAoB,CAAC,IAAIG,EAAa5E,EAAA,YAAY,SAAS0E,EAAK,MAAM,EAAG1E,EAAA,YAAY,SAAS2E,EAAK,MAAM,CAAC,CAAC,EAAG,EAAI,CAC9H,CAEA,YACiBE,EAKAC,EAAmB,CALnB,KAAA,MAAAD,EAKA,KAAA,WAAAC,CACb,EAhBLr4B,EAAA,oBAAAg4B,EAmBA,MAAaG,CAAY,CACjB,OAAO,OAAOG,EAA+BC,EAAkB,CACrE,MAAMlmC,EAAyB,CAAA,EAC/B,SAAAmmC,EAAA,iBAAgBF,EAAe,CAACxjC,EAAGC,IAAK,CACvC1C,EAAO,KAAK8lC,EAAa,gBACxBrjC,EAAIA,EAAE,iBAAgB,EAAK2jC,EAAW,KACtC1jC,EAAIA,EAAE,UAAS,EAAK,IAAI0jC,EAAWF,GAAazjC,EAAIA,EAAE,UAAU,aAAeA,EAAE,UAAU,aAAe,GAAKyjC,CAAU,CAAC,CAC1H,CACF,CAAC,EACMlmC,CACR,CAEO,OAAO,gBAAgB8R,EAAmBqsB,EAAwB,CACxE,OAAO,IAAI2H,EACV,IAAI5E,EAAA,YAAYpvB,EAAM,QAASqsB,EAAa,OAAO,EACnD,IAAI+C,EAAA,YAAYpvB,EAAM,QAASqsB,EAAa,OAAO,CAAC,CAEtD,CAEO,OAAO,aAAa8H,EAA6B,CACvD,IAAIl2B,EACJ,UAAWuV,KAAO2gB,EAAe,CAChC,GAAIl2B,GACC,EAAEA,EAAK,UAAU,cAAgBuV,EAAI,UAAU,OAASvV,EAAK,UAAU,cAAgBuV,EAAI,UAAU,OACxG,MAAM,IAAIhL,EAAA,mBAAmB,+BAA+B,EAG9DvK,EAAOuV,CACR,CACD,CAEA,YACiB+gB,EACAC,EAAsB,CADtB,KAAA,UAAAD,EACA,KAAA,UAAAC,CACb,CAEG,MAAI,CACV,OAAO,IAAIR,EAAa,KAAK,UAAW,KAAK,SAAS,CACvD,CAEO,UAAQ,CACd,MAAO,GAAG,KAAK,SAAS,QAAQ,KAAK,SAAS,EAC/C,CAEO,KAAKl2B,EAAmB,CAC9B,OAAO,IAAIk2B,EAAa,KAAK,UAAU,KAAKl2B,EAAM,SAAS,EAAG,KAAK,UAAU,KAAKA,EAAM,SAAS,CAAC,CACnG,CAEO,MAAM8d,EAAc,CAC1B,OAAIA,IAAW,EACP,KAED,IAAIoY,EAAa,KAAK,UAAU,MAAMpY,CAAM,EAAG,KAAK,UAAU,MAAMA,CAAM,CAAC,CACnF,CAEO,WAAWA,EAAc,CAC/B,OAAIA,IAAW,EACP,KAED,IAAIoY,EAAa,KAAK,UAAU,WAAWpY,CAAM,EAAG,KAAK,UAAU,WAAWA,CAAM,CAAC,CAC7F,CAEO,SAASA,EAAc,CAC7B,OAAIA,IAAW,EACP,KAED,IAAIoY,EAAa,KAAK,UAAU,SAASpY,CAAM,EAAG,KAAK,UAAU,SAASA,CAAM,CAAC,CACzF,CAEO,UAAU9d,EAAmB,CACnC,MAAM6xB,EAAK,KAAK,UAAU,UAAU7xB,EAAM,SAAS,EAC7CktB,EAAK,KAAK,UAAU,UAAUltB,EAAM,SAAS,EACnD,GAAI,GAAC6xB,GAAM,CAAC3E,GAGZ,OAAO,IAAIgJ,EAAarE,EAAI3E,CAAE,CAC/B,CAEO,WAAS,CACf,OAAO,IAAIsJ,EAAW,KAAK,UAAU,MAAO,KAAK,UAAU,KAAK,CACjE,CAEO,kBAAgB,CACtB,OAAO,IAAIA,EAAW,KAAK,UAAU,aAAc,KAAK,UAAU,YAAY,CAC/E,EApFDz4B,EAAA,aAAAm4B,EAuFA,MAAaM,CAAU,QACC,KAAA,KAAO,IAAIA,EAAW,EAAG,CAAC,CAAE,QAC5B,KAAA,IAAM,IAAIA,EAAW,OAAO,iBAAkB,OAAO,gBAAgB,CAAE,CAE9F,YACiBG,EACAC,EAAe,CADf,KAAA,QAAAD,EACA,KAAA,QAAAC,CAEjB,CAEO,UAAQ,CACd,MAAO,GAAG,KAAK,OAAO,QAAQ,KAAK,OAAO,EAC3C,CAEO,MAAM9Y,EAAc,CAC1B,OAAIA,IAAW,EACP,KAED,IAAI0Y,EAAW,KAAK,QAAU1Y,EAAQ,KAAK,QAAUA,CAAM,CACnE,CAEO,OAAO9d,EAAiB,CAC9B,OAAO,KAAK,UAAYA,EAAM,SAAW,KAAK,UAAYA,EAAM,OACjE,EAvBDjC,EAAA,WAAAy4B,EAiDA,MAAaK,CAAe,QACb,KAAA,SAAW,IAAIA,CAAkB,CAE/C,SAAO,CACN,MAAO,EACR,EALD94B,EAAA,gBAAA84B,EAQA,MAAaC,CAAW,CAIvB,YAAoB7/B,EAAe,CAClC,GADmB,KAAA,QAAAA,EAHH,KAAA,UAAY,KAAK,IAAG,EAC7B,KAAA,MAAQ,GAGXA,GAAW,EACd,MAAM,IAAIyT,EAAA,mBAAmB,0BAA0B,CAEzD,CAGO,SAAO,CAEb,GAAI,EADU,KAAK,IAAG,EAAK,KAAK,UAAY,KAAK,UACnC,KAAK,MAAO,CACzB,KAAK,MAAQ,GAEb,QACD,CACA,OAAO,KAAK,KACb,EAnBD3M,EAAA,YAAA+4B,sICvKA,MAAaC,CAAkB,CAC9B,QAAQf,EAAiBC,EAAiBh/B,EAAoB+/B,EAAA,gBAAgB,SAAQ,CAGrF,GAAIhB,EAAK,SAAW,GAAKC,EAAK,SAAW,EACxC,OAAOe,EAAA,oBAAoB,QAAQhB,EAAMC,CAAI,EAG9C,MAAMgB,EAAOjB,EACPkB,EAAOjB,EAEb,SAASkB,EAAel1B,EAAWm1B,EAAS,CAC3C,KAAOn1B,EAAIg1B,EAAK,QAAUG,EAAIF,EAAK,QAAUD,EAAK,WAAWh1B,CAAC,IAAMi1B,EAAK,WAAWE,CAAC,GACpFn1B,IACAm1B,IAED,OAAOn1B,CACR,CAEA,IAAIiO,EAAI,EAKR,MAAMmnB,EAAI,IAAIC,EACdD,EAAE,IAAI,EAAGF,EAAe,EAAG,CAAC,CAAC,EAE7B,MAAM57B,EAAQ,IAAIg8B,EAClBh8B,EAAM,IAAI,EAAG87B,EAAE,IAAI,CAAC,IAAM,EAAI,KAAO,IAAIG,EAAU,KAAM,EAAG,EAAGH,EAAE,IAAI,CAAC,CAAC,CAAC,EAExE,IAAIlyB,EAAI,EAERsyB,EAAM,OAAa,CAElB,GADAvnB,IACI,CAACjZ,EAAQ,QAAO,EACnB,OAAO+/B,EAAA,oBAAoB,gBAAgBC,EAAMC,CAAI,EAGtD,MAAMQ,EAAa,CAAC,KAAK,IAAIxnB,EAAGgnB,EAAK,OAAUhnB,EAAI,CAAE,EAC/CynB,EAAa,KAAK,IAAIznB,EAAG+mB,EAAK,OAAU/mB,EAAI,CAAE,EACpD,IAAK/K,EAAIuyB,EAAYvyB,GAAKwyB,EAAYxyB,GAAK,EAAG,CAC7C,IAAI3N,EAAO,EAEX,MAAMogC,EAAiBzyB,IAAMwyB,EAAa,GAAKN,EAAE,IAAIlyB,EAAI,CAAC,EACpD0yB,EAAkB1yB,IAAMuyB,EAAa,GAAKL,EAAE,IAAIlyB,EAAI,CAAC,EAAI,EAC/D3N,IACA,MAAMyK,EAAI,KAAK,IAAI,KAAK,IAAI21B,EAAgBC,CAAe,EAAGZ,EAAK,MAAM,EACnEG,EAAIn1B,EAAIkD,EAEd,GADA3N,IACIyK,EAAIg1B,EAAK,QAAUG,EAAIF,EAAK,OAG/B,SAED,MAAMY,EAAUX,EAAel1B,EAAGm1B,CAAC,EACnCC,EAAE,IAAIlyB,EAAG2yB,CAAO,EAChB,MAAMC,EAAW91B,IAAM21B,EAAiBr8B,EAAM,IAAI4J,EAAI,CAAC,EAAI5J,EAAM,IAAI4J,EAAI,CAAC,EAG1E,GAFA5J,EAAM,IAAI4J,EAAG2yB,IAAY71B,EAAI,IAAIu1B,EAAUO,EAAU91B,EAAGm1B,EAAGU,EAAU71B,CAAC,EAAI81B,CAAQ,EAE9EV,EAAE,IAAIlyB,CAAC,IAAM8xB,EAAK,QAAUI,EAAE,IAAIlyB,CAAC,EAAIA,IAAM+xB,EAAK,OACrD,MAAMO,CAER,CACD,CAEA,IAAIriC,EAAOmG,EAAM,IAAI4J,CAAC,EACtB,MAAM/U,EAAyB,CAAA,EAC/B,IAAI4nC,EAA4Bf,EAAK,OACjCgB,EAA4Bf,EAAK,OAErC,OAAa,CACZ,MAAMgB,EAAO9iC,EAAOA,EAAK,EAAIA,EAAK,OAAS,EACrC+iC,EAAO/iC,EAAOA,EAAK,EAAIA,EAAK,OAAS,EAQ3C,IANI8iC,IAASF,GAAqBG,IAASF,IAC1C7nC,EAAO,KAAK,IAAI4mC,EAAA,aACf,IAAI1F,EAAA,YAAY4G,EAAMF,CAAiB,EACvC,IAAI1G,EAAA,YAAY6G,EAAMF,CAAiB,CAAC,CACxC,EAEE,CAAC7iC,EACJ,MAED4iC,EAAoB5iC,EAAK,EACzB6iC,EAAoB7iC,EAAK,EAEzBA,EAAOA,EAAK,IACb,CAEA,OAAAhF,EAAO,QAAO,EACP,IAAI4mC,EAAA,oBAAoB5mC,EAAQ,EAAK,CAC7C,EA3FD2N,EAAA,mBAAAg5B,EA8FA,MAAMS,CAAS,CACd,YACiB9I,EACAzsB,EACAm1B,EACA/2B,EAAc,CAHd,KAAA,KAAAquB,EACA,KAAA,EAAAzsB,EACA,KAAA,EAAAm1B,EACA,KAAA,OAAA/2B,CAEjB,EAMD,MAAMi3B,CAAc,CAApB,aAAA,CACS,KAAA,YAA0B,IAAI,WAAW,EAAE,EAC3C,KAAA,YAA0B,IAAI,WAAW,EAAE,CA6BpD,CA3BC,IAAItyB,EAAW,CACd,OAAIA,EAAM,GACTA,EAAM,CAACA,EAAM,EACN,KAAK,YAAYA,CAAG,GAEpB,KAAK,YAAYA,CAAG,CAE7B,CAEA,IAAIA,EAAarT,EAAa,CAC7B,GAAIqT,EAAM,EAAG,CAEZ,GADAA,EAAM,CAACA,EAAM,EACTA,GAAO,KAAK,YAAY,OAAQ,CACnC,MAAMlF,EAAM,KAAK,YACjB,KAAK,YAAc,IAAI,WAAWA,EAAI,OAAS,CAAC,EAChD,KAAK,YAAY,IAAIA,CAAG,CACzB,CACA,KAAK,YAAYkF,CAAG,EAAIrT,CACzB,KAAO,CACN,GAAIqT,GAAO,KAAK,YAAY,OAAQ,CACnC,MAAMlF,EAAM,KAAK,YACjB,KAAK,YAAc,IAAI,WAAWA,EAAI,OAAS,CAAC,EAChD,KAAK,YAAY,IAAIA,CAAG,CACzB,CACA,KAAK,YAAYkF,CAAG,EAAIrT,CACzB,CACD,EAMD,MAAM4lC,CAAwB,CAA9B,aAAA,CACkB,KAAA,YAAmB,CAAA,EACnB,KAAA,YAAmB,CAAA,CAmBrC,CAjBC,IAAIvyB,EAAW,CACd,OAAIA,EAAM,GACTA,EAAM,CAACA,EAAM,EACN,KAAK,YAAYA,CAAG,GAEpB,KAAK,YAAYA,CAAG,CAE7B,CAEA,IAAIA,EAAarT,EAAQ,CACpBqT,EAAM,GACTA,EAAM,CAACA,EAAM,EACb,KAAK,YAAYA,CAAG,EAAIrT,GAExB,KAAK,YAAYqT,CAAG,EAAIrT,CAE1B,+GCnKDoM,EAAA,sBAAAq6B,EA+LAr6B,EAAA,mBAAAs6B,EAmBAt6B,EAAA,qCAAAu6B,EAiGAv6B,EAAA,yCAAAw6B,EA+CAx6B,EAAA,4CAAAy6B,EAlWA,SAAgBJ,EAAsBK,EAAsBC,EAAsBrC,EAA6B,CAC9G,IAAIjmC,EAASimC,EACb,OAAAjmC,EAASuoC,EAA4BF,EAAWC,EAAWtoC,CAAM,EAGjEA,EAASuoC,EAA4BF,EAAWC,EAAWtoC,CAAM,EACjEA,EAASwoC,EAAmBH,EAAWC,EAAWtoC,CAAM,EACjDA,CACR,CAcA,SAASuoC,EAA4BF,EAAsBC,EAAsBrC,EAA6B,CAC7G,GAAIA,EAAc,SAAW,EAC5B,OAAOA,EAGR,MAAMjmC,EAAyB,CAAA,EAC/BA,EAAO,KAAKimC,EAAc,CAAC,CAAC,EAG5B,QAAS3jC,EAAI,EAAGA,EAAI2jC,EAAc,OAAQ3jC,IAAK,CAC9C,MAAMmmC,EAAazoC,EAAOA,EAAO,OAAS,CAAC,EAC3C,IAAIslB,EAAM2gB,EAAc3jC,CAAC,EAEzB,GAAIgjB,EAAI,UAAU,SAAWA,EAAI,UAAU,QAAS,CACnD,MAAMrV,EAASqV,EAAI,UAAU,MAAQmjB,EAAW,UAAU,aAC1D,IAAI3oB,EACJ,IAAKA,EAAI,EAAGA,GAAK7P,GAEf,EAAAo4B,EAAU,WAAW/iB,EAAI,UAAU,MAAQxF,CAAC,IAAMuoB,EAAU,WAAW/iB,EAAI,UAAU,aAAexF,CAAC,GACrGwoB,EAAU,WAAWhjB,EAAI,UAAU,MAAQxF,CAAC,IAAMwoB,EAAU,WAAWhjB,EAAI,UAAU,aAAexF,CAAC,GAH9EA,IACxB,CAQD,GAFAA,IAEIA,IAAM7P,EAAQ,CAEjBjQ,EAAOA,EAAO,OAAS,CAAC,EAAI,IAAI4mC,EAAA,aAC/B,IAAI1F,EAAA,YAAYuH,EAAW,UAAU,MAAOnjB,EAAI,UAAU,aAAerV,CAAM,EAC/E,IAAIixB,EAAA,YAAYuH,EAAW,UAAU,MAAOnjB,EAAI,UAAU,aAAerV,CAAM,CAAC,EAEjF,QACD,CAEAqV,EAAMA,EAAI,MAAM,CAACxF,CAAC,CACnB,CAEA9f,EAAO,KAAKslB,CAAG,CAChB,CAEA,MAAMojB,EAA0B,CAAA,EAEhC,QAASpmC,EAAI,EAAGA,EAAItC,EAAO,OAAS,EAAGsC,IAAK,CAC3C,MAAMqmC,EAAa3oC,EAAOsC,EAAI,CAAC,EAC/B,IAAIgjB,EAAMtlB,EAAOsC,CAAC,EAElB,GAAIgjB,EAAI,UAAU,SAAWA,EAAI,UAAU,QAAS,CACnD,MAAMrV,EAAS04B,EAAW,UAAU,MAAQrjB,EAAI,UAAU,aAC1D,IAAIxF,EACJ,IAAKA,EAAI,EAAGA,EAAI7P,GAEd,GAACo4B,EAAU,gBAAgB/iB,EAAI,UAAU,MAAQxF,EAAGwF,EAAI,UAAU,aAAexF,CAAC,GAClF,CAACwoB,EAAU,gBAAgBhjB,EAAI,UAAU,MAAQxF,EAAGwF,EAAI,UAAU,aAAexF,CAAC,GAH5DA,IACvB,CAQD,GAAIA,IAAM7P,EAAQ,CAEjBjQ,EAAOsC,EAAI,CAAC,EAAI,IAAIskC,EAAA,aACnB,IAAI1F,EAAA,YAAY5b,EAAI,UAAU,MAAQrV,EAAQ04B,EAAW,UAAU,YAAY,EAC/E,IAAIzH,EAAA,YAAY5b,EAAI,UAAU,MAAQrV,EAAQ04B,EAAW,UAAU,YAAY,CAAC,EAEjF,QACD,CAEI7oB,EAAI,IACPwF,EAAMA,EAAI,MAAMxF,CAAC,EAEnB,CAEA4oB,EAAQ,KAAKpjB,CAAG,CACjB,CAEA,OAAItlB,EAAO,OAAS,GACnB0oC,EAAQ,KAAK1oC,EAAOA,EAAO,OAAS,CAAC,CAAC,EAGhC0oC,CACR,CAkBA,SAASF,EAAmBH,EAAsBC,EAAsBrC,EAA6B,CACpG,GAAI,CAACoC,EAAU,kBAAoB,CAACC,EAAU,iBAC7C,OAAOrC,EAGR,QAAS3jC,EAAI,EAAGA,EAAI2jC,EAAc,OAAQ3jC,IAAK,CAC9C,MAAMsmC,EAAYtmC,EAAI,EAAI2jC,EAAc3jC,EAAI,CAAC,EAAI,OAC3CssB,EAAOqX,EAAc3jC,CAAC,EACtBumC,EAAYvmC,EAAI,EAAI2jC,EAAc,OAASA,EAAc3jC,EAAI,CAAC,EAAI,OAElEwmC,EAAiB,IAAI5H,EAAA,YAAY0H,EAAWA,EAAS,UAAU,aAAe,EAAI,EAAGC,EAAWA,EAAS,UAAU,MAAQ,EAAIR,EAAU,MAAM,EAC/IU,EAAiB,IAAI7H,EAAA,YAAY0H,EAAWA,EAAS,UAAU,aAAe,EAAI,EAAGC,EAAWA,EAAS,UAAU,MAAQ,EAAIP,EAAU,MAAM,EAEjJ1Z,EAAK,UAAU,QAClBqX,EAAc3jC,CAAC,EAAI0mC,EAA0Bpa,EAAMyZ,EAAWC,EAAWQ,EAAgBC,CAAc,EAC7Fna,EAAK,UAAU,UACzBqX,EAAc3jC,CAAC,EAAI0mC,EAA0Bpa,EAAK,KAAI,EAAI0Z,EAAWD,EAAWU,EAAgBD,CAAc,EAAE,KAAI,EAEtH,CAEA,OAAO7C,CACR,CAEA,SAAS+C,EAA0Bpa,EAAoByZ,EAAsBC,EAAsBQ,EAA6BC,EAA2B,CAI1J,IAAIE,EAAc,EAClB,KACCra,EAAK,UAAU,MAAQqa,GAAeH,EAAe,OACrDla,EAAK,UAAU,MAAQqa,GAAeF,EAAe,OACrDT,EAAU,gBAAgB1Z,EAAK,UAAU,MAAQqa,EAAara,EAAK,UAAU,aAAeqa,CAAW,GAAKA,EAAc,KAE1HA,IAEDA,IAEA,IAAIC,EAAa,EACjB,KACCta,EAAK,UAAU,MAAQsa,EAAaJ,EAAe,cACnDla,EAAK,UAAU,aAAesa,EAAaH,EAAe,cAC1DT,EAAU,gBAAgB1Z,EAAK,UAAU,MAAQsa,EAAYta,EAAK,UAAU,aAAesa,CAAU,GAAKA,EAAa,KAEvHA,IAGD,GAAID,IAAgB,GAAKC,IAAe,EACvC,OAAOta,EAMR,IAAI+J,EAAY,EACZC,EAAY,GAEhB,QAAS7hB,EAAQ,CAACkyB,EAAalyB,GAASmyB,EAAYnyB,IAAS,CAC5D,MAAMoyB,EAAkBva,EAAK,UAAU,MAAQ7X,EACzCqyB,EAAyBxa,EAAK,UAAU,aAAe7X,EACvDsyB,EAAaza,EAAK,UAAU,MAAQ7X,EAEpC8hB,EAAQwP,EAAU,iBAAkBgB,CAAU,EAAIf,EAAU,iBAAkBa,CAAe,EAAIb,EAAU,iBAAkBc,CAAsB,EACrJvQ,EAAQD,IACXA,EAAYC,EACZF,EAAY5hB,EAEd,CAEA,OAAO6X,EAAK,MAAM+J,CAAS,CAC5B,CAEA,SAAgBsP,EAAmBI,EAAsBC,EAAsBrC,EAA6B,CAC3G,MAAMjmC,EAAyB,CAAA,EAC/B,UAAWmW,KAAK8vB,EAAe,CAC9B,MAAMl2B,EAAO/P,EAAOA,EAAO,OAAS,CAAC,EACrC,GAAI,CAAC+P,EAAM,CACV/P,EAAO,KAAKmW,CAAC,EACb,QACD,CAEIA,EAAE,UAAU,MAAQpG,EAAK,UAAU,cAAgB,GAAKoG,EAAE,UAAU,MAAQpG,EAAK,UAAU,cAAgB,EAC9G/P,EAAOA,EAAO,OAAS,CAAC,EAAI,IAAI4mC,EAAA,aAAa72B,EAAK,UAAU,KAAKoG,EAAE,SAAS,EAAGpG,EAAK,UAAU,KAAKoG,EAAE,SAAS,CAAC,EAE/GnW,EAAO,KAAKmW,CAAC,CAEf,CAEA,OAAOnW,CACR,CAEA,SAAgBkoC,EAAqCG,EAAmCC,EAAmCrC,EAA6B,CACvJ,MAAMqD,EAAgB1C,EAAA,aAAa,OAAOX,EAAeoC,EAAU,MAAM,EAEnEkB,EAA6B,CAAA,EAEnC,IAAIC,EAAY,IAAI5C,EAAA,WAAW,EAAG,CAAC,EAEnC,SAAS6C,EAASC,EAAkBC,EAA0B,CAC7D,GAAID,EAAK,QAAUF,EAAU,SAAWE,EAAK,QAAUF,EAAU,QAChE,OAGD,MAAMI,EAAKvB,EAAU,mBAAmBqB,EAAK,OAAO,EAC9CG,EAAKvB,EAAU,mBAAmBoB,EAAK,OAAO,EACpD,GAAI,CAACE,GAAM,CAACC,EACX,OAED,IAAI,EAAI,IAAIjD,EAAA,aAAagD,EAAIC,CAAE,EAC/B,MAAMC,EAAY,EAAE,UAAUH,CAAY,EAE1C,IAAII,EAAcD,EAAU,UAAU,OAClCE,EAAcF,EAAU,UAAU,OAKtC,KAAOR,EAAc,OAAS,GAAG,CAChC,MAAMjtB,EAAOitB,EAAc,CAAC,EAE5B,GAAI,EADejtB,EAAK,UAAU,WAAW,EAAE,SAAS,GAAKA,EAAK,UAAU,WAAW,EAAE,SAAS,GAEjG,MAGD,MAAM4tB,EAAK5B,EAAU,mBAAmBhsB,EAAK,UAAU,KAAK,EACtD6tB,EAAK5B,EAAU,mBAAmBjsB,EAAK,UAAU,KAAK,EAEtDzF,EAAI,IAAIgwB,EAAA,aAAaqD,EAAKC,CAAG,EAC7BJ,EAAYlzB,EAAE,UAAUyF,CAAI,EAOlC,GALA0tB,GAAeD,EAAU,UAAU,OACnCE,GAAeF,EAAU,UAAU,OAEnC,EAAI,EAAE,KAAKlzB,CAAC,EAER,EAAE,UAAU,cAAgByF,EAAK,UAAU,aAE9CitB,EAAc,MAAK,MAEnB,MAEF,CAEIS,EAAcC,GAAe,EAAE,UAAU,OAAS,EAAE,UAAU,QAAU,EAAI,GAC/ET,EAAW,KAAK,CAAC,EAGlBC,EAAY,EAAE,iBAAgB,CAC/B,CAEA,KAAOF,EAAc,OAAS,GAAG,CAChC,MAAMjtB,EAAOitB,EAAc,MAAK,EAC5BjtB,EAAK,UAAU,UAGnBotB,EAASptB,EAAK,UAAS,EAAIA,CAAI,EAE/BotB,EAASptB,EAAK,iBAAgB,EAAG,MAAM,EAAE,EAAGA,CAAI,EACjD,CAGA,OADe8tB,EAAmBlE,EAAesD,CAAU,CAE5D,CAEA,SAASY,EAAmBC,EAAgCC,EAA8B,CACzF,MAAMrqC,EAAyB,CAAA,EAE/B,KAAOoqC,EAAe,OAAS,GAAKC,EAAe,OAAS,GAAG,CAC9D,MAAMC,EAAMF,EAAe,CAAC,EACtBG,EAAMF,EAAe,CAAC,EAE5B,IAAIhuB,EACAiuB,IAAQ,CAACC,GAAOD,EAAI,UAAU,MAAQC,EAAI,UAAU,OACvDluB,EAAO+tB,EAAe,MAAK,EAE3B/tB,EAAOguB,EAAe,MAAK,EAGxBrqC,EAAO,OAAS,GAAKA,EAAOA,EAAO,OAAS,CAAC,EAAE,UAAU,cAAgBqc,EAAK,UAAU,MAC3Frc,EAAOA,EAAO,OAAS,CAAC,EAAIA,EAAOA,EAAO,OAAS,CAAC,EAAE,KAAKqc,CAAI,EAE/Drc,EAAO,KAAKqc,CAAI,CAElB,CAEA,OAAOrc,CACR,CAEA,SAAgBmoC,EAAyCE,EAAyBmC,EAA0BvE,EAA6B,CACxI,IAAIF,EAAQE,EACZ,GAAIF,EAAM,SAAW,EACpB,OAAOA,EAGR,IAAI0E,EAAU,EACVC,EACJ,EAAG,CACFA,EAAe,GAEf,MAAM1qC,EAAyB,CAC9B+lC,EAAM,CAAC,GAGR,QAASzjC,EAAI,EAAGA,EAAIyjC,EAAM,OAAQzjC,IAAK,CAItC,IAASqoC,EAAT,SAAyBh5B,EAAsBC,EAAmB,CACjE,MAAMg5B,EAAiB,IAAI1J,EAAA,YAAY2J,EAAW,UAAU,aAAcvlB,EAAI,UAAU,KAAK,EAI7F,OAFsB+iB,EAAU,QAAQuC,CAAc,EACT,QAAQ,MAAO,EAAE,EACnC,QAAU,IAChCj5B,EAAO,UAAU,OAASA,EAAO,UAAU,OAAS,GAAKC,EAAM,UAAU,OAASA,EAAM,UAAU,OAAS,EAKjH,EAdA,MAAM0T,EAAMygB,EAAMzjC,CAAC,EACbuoC,EAAa7qC,EAAOA,EAAO,OAAS,CAAC,EAexB2qC,EAAgBE,EAAYvlB,CAAG,GAEjDolB,EAAe,GACf1qC,EAAOA,EAAO,OAAS,CAAC,EAAIA,EAAOA,EAAO,OAAS,CAAC,EAAE,KAAKslB,CAAG,GAE9DtlB,EAAO,KAAKslB,CAAG,CAEjB,CAEAygB,EAAQ/lC,CACT,OAASyqC,IAAY,IAAMC,GAE3B,OAAO3E,CACR,CAEA,SAAgBqC,EAA4CC,EAAmCC,EAAmCrC,EAA6B,CAC9J,IAAIF,EAAQE,EACZ,GAAIF,EAAM,SAAW,EACpB,OAAOA,EAGR,IAAI0E,EAAU,EACVC,EACJ,EAAG,CACFA,EAAe,GAEf,MAAM1qC,EAAyB,CAC9B+lC,EAAM,CAAC,GAGR,QAASzjC,EAAI,EAAGA,EAAIyjC,EAAM,OAAQzjC,IAAK,CAItC,IAASqoC,EAAT,SAAyBh5B,EAAsBC,EAAmB,CACjE,MAAMg5B,EAAiB,IAAI1J,EAAA,YAAY2J,EAAW,UAAU,aAAcvlB,EAAI,UAAU,KAAK,EAG7F,GAD2B+iB,EAAU,aAAauC,CAAc,EACvC,GAAKA,EAAe,OAAS,IACrD,MAAO,GAGR,MAAME,EAAgBzC,EAAU,QAAQuC,CAAc,EAAE,KAAI,EAC5D,GAAIE,EAAc,OAAS,IAAMA,EAAc,MAAM,YAAY,EAAE,OAAS,EAC3E,MAAO,GAGR,MAAMC,EAAmB1C,EAAU,aAAa12B,EAAO,SAAS,EAC1Dq5B,EAAmBr5B,EAAO,UAAU,OACpCs5B,EAAmB3C,EAAU,aAAa32B,EAAO,SAAS,EAC1Du5B,EAAmBv5B,EAAO,UAAU,OAEpCw5B,EAAkB9C,EAAU,aAAaz2B,EAAM,SAAS,EACxDw5B,EAAkBx5B,EAAM,UAAU,OAClCy5B,EAAkB/C,EAAU,aAAa12B,EAAM,SAAS,EACxD05B,EAAkB15B,EAAM,UAAU,OAIlCsD,EAAM,EAAI,GAAK,GACrB,SAASq2B,EAAI30B,EAAS,CACrB,OAAO,KAAK,IAAIA,EAAG1B,CAAG,CACvB,CAEA,OAAI,KAAK,IAAI,KAAK,IAAIq2B,EAAIR,EAAmB,GAAKC,CAAgB,EAAG,GAAG,EAAI,KAAK,IAAIO,EAAIN,EAAmB,GAAKC,CAAgB,EAAG,GAAG,EAAG,GAAG,EAC1I,KAAK,IAAI,KAAK,IAAIK,EAAIJ,EAAkB,GAAKC,CAAe,EAAG,GAAG,EAAI,KAAK,IAAIG,EAAIF,EAAkB,GAAKC,CAAe,EAAG,GAAG,EAAG,GAAG,GAAMp2B,GAAO,MAAQ,IAAO,GAIrK,EAtCA,MAAMoQ,EAAMygB,EAAMzjC,CAAC,EACbuoC,EAAa7qC,EAAOA,EAAO,OAAS,CAAC,EAuCxB2qC,EAAgBE,EAAYvlB,CAAG,GAEjDolB,EAAe,GACf1qC,EAAOA,EAAO,OAAS,CAAC,EAAIA,EAAOA,EAAO,OAAS,CAAC,EAAE,KAAKslB,CAAG,GAE9DtlB,EAAO,KAAKslB,CAAG,CAEjB,CAEAygB,EAAQ/lC,CACT,OAASyqC,IAAY,IAAMC,GAE3B,MAAMc,EAA2B,CAAA,EAGjC,SAAArF,EAAA,sBAAqBJ,EAAO,CAACzH,EAAMhZ,EAAKjJ,IAAQ,CAC/C,IAAIovB,EAAUnmB,EAEd,SAASomB,EAAoBjnC,EAAY,CACxC,OAAOA,EAAK,OAAS,GAAKA,EAAK,KAAI,EAAG,QAAU,GAAK6gB,EAAI,UAAU,OAASA,EAAI,UAAU,OAAS,GACpG,CAEA,MAAMqmB,EAAatD,EAAU,kBAAkB/iB,EAAI,SAAS,EACtDsmB,EAASvD,EAAU,QAAQ,IAAInH,EAAA,YAAYyK,EAAW,MAAOrmB,EAAI,UAAU,KAAK,CAAC,EACnFomB,EAAoBE,CAAM,IAC7BH,EAAUA,EAAQ,WAAW,CAACG,EAAO,MAAM,GAE5C,MAAMC,EAASxD,EAAU,QAAQ,IAAInH,EAAA,YAAY5b,EAAI,UAAU,aAAcqmB,EAAW,YAAY,CAAC,EACjGD,EAAoBG,CAAM,IAC7BJ,EAAUA,EAAQ,SAASI,EAAO,MAAM,GAGzC,MAAMC,EAAiBlF,EAAA,aAAa,gBACnCtI,EAAOA,EAAK,iBAAgB,EAAKsI,EAAA,WAAW,KAC5CvqB,EAAOA,EAAK,UAAS,EAAKuqB,EAAA,WAAW,GAAG,EAEnC5mC,EAASyrC,EAAQ,UAAUK,CAAc,EAC3CN,EAAS,OAAS,GAAKxrC,EAAO,UAAS,EAAG,OAAOwrC,EAASA,EAAS,OAAS,CAAC,EAAE,iBAAgB,CAAE,EACpGA,EAASA,EAAS,OAAS,CAAC,EAAIA,EAASA,EAAS,OAAS,CAAC,EAAE,KAAKxrC,CAAM,EAEzEwrC,EAAS,KAAKxrC,CAAM,CAEtB,CAAC,EAEMwrC,CACR,uHCzcA,MAAaO,CAAY,CACxB,YACkBC,EACAC,EAAe,CADf,KAAA,YAAAD,EACA,KAAA,MAAAC,CACd,CAEJ,WAAWve,EAAc,CACxB,OAAO,KAAK,YAAYA,CAAM,CAC/B,CAEA,IAAI,QAAM,CACT,OAAO,KAAK,YAAY,MACzB,CAEA,iBAAiBzd,EAAc,CAC9B,MAAMi8B,EAAoBj8B,IAAW,EAAI,EAAIk8B,EAAe,KAAK,MAAMl8B,EAAS,CAAC,CAAC,EAC5Em8B,EAAmBn8B,IAAW,KAAK,MAAM,OAAS,EAAIk8B,EAAe,KAAK,MAAMl8B,CAAM,CAAC,EAC7F,MAAO,MAAQi8B,EAAoBE,EACpC,CAEA,QAAQv9B,EAAkB,CACzB,OAAO,KAAK,MAAM,MAAMA,EAAM,MAAOA,EAAM,YAAY,EAAE,KAAK;CAAI,CACnE,CAEA,gBAAgB03B,EAAiBC,EAAe,CAC/C,OAAO,KAAK,MAAMD,CAAO,IAAM,KAAK,MAAMC,CAAO,CAClD,EA1BD74B,EAAA,aAAAo+B,EA6BA,SAASI,EAAepjC,EAAW,CAClC,IAAIzG,EAAI,EACR,KAAOA,EAAIyG,EAAI,SAAWA,EAAI,WAAWzG,CAAC,IAAC,IAAuByG,EAAI,WAAWzG,CAAC,IAAC,IAClFA,IAED,OAAOA,CACR,sICnBAqL,EAAA,QAAA0+B,EAhBA,MAAaC,CAAO,CAGnB,YAA4BC,EAA+BC,EAAc,CAA7C,KAAA,MAAAD,EAA+B,KAAA,OAAAC,EAF1C,KAAA,MAAa,CAAA,EAG7B,KAAK,MAAQ,IAAI,MAASD,EAAQC,CAAM,CACzC,CAEA,IAAI36B,EAAWm1B,EAAS,CACvB,OAAO,KAAK,MAAMn1B,EAAIm1B,EAAI,KAAK,KAAK,CACrC,CAEA,IAAIn1B,EAAWm1B,EAAWzlC,EAAQ,CACjC,KAAK,MAAMsQ,EAAIm1B,EAAI,KAAK,KAAK,EAAIzlC,CAClC,EAbDoM,EAAA,QAAA2+B,EAgBA,SAAgBD,EAAQzzB,EAAgB,CACvC,OAAOA,IAAQ,IAAuBA,IAAQ,CAC/C,CAEA,MAAa6zB,CAAiB,QACd,KAAA,QAAU,IAAI,GAAsB,CAE3C,OAAO,OAAOC,EAAW,CAChC,IAAIrrC,EAAM,KAAK,QAAQ,IAAIqrC,CAAG,EAC9B,OAAIrrC,IAAQ,SACXA,EAAM,KAAK,QAAQ,KACnB,KAAK,QAAQ,IAAIqrC,EAAKrrC,CAAG,GAEnBA,CACR,CAIA,YACiBwN,EACAo9B,EACA/kC,EAAgC,CAFhC,KAAA,MAAA2H,EACA,KAAA,MAAAo9B,EACA,KAAA,OAAA/kC,EAJA,KAAA,UAAsB,CAAA,EAMtC,IAAIujC,EAAU,EACd,QAASnoC,EAAIuM,EAAM,gBAAkB,EAAGvM,EAAIuM,EAAM,uBAAyB,EAAGvM,IAAK,CAClF,MAAMggC,EAAO2J,EAAM3pC,CAAC,EACpB,QAASO,EAAI,EAAGA,EAAIy/B,EAAK,OAAQz/B,IAAK,CACrC4nC,IACA,MAAMiC,EAAMpK,EAAKz/B,CAAC,EACZxB,EAAMorC,EAAkB,OAAOC,CAAG,EACxC,KAAK,UAAUrrC,CAAG,GAAK,KAAK,UAAUA,CAAG,GAAK,GAAK,CACpD,CACAopC,IACA,MAAMppC,EAAMorC,EAAkB,OAAO;CAAI,EACzC,KAAK,UAAUprC,CAAG,GAAK,KAAK,UAAUA,CAAG,GAAK,GAAK,CACpD,CAEA,KAAK,WAAaopC,CACnB,CAEO,kBAAkB76B,EAAwB,CAChD,IAAI+8B,EAAiB,EACrB,MAAMC,EAAY,KAAK,IAAI,KAAK,UAAU,OAAQh9B,EAAM,UAAU,MAAM,EACxE,QAAStN,EAAI,EAAGA,EAAIsqC,EAAWtqC,IAC9BqqC,GAAkB,KAAK,KAAK,KAAK,UAAUrqC,CAAC,GAAK,IAAMsN,EAAM,UAAUtN,CAAC,GAAK,EAAE,EAEhF,MAAO,GAAKqqC,GAAkB,KAAK,WAAa/8B,EAAM,WACvD,EA3CDjC,EAAA,kBAAA8+B,kJChBA,MAAaI,CAAyB,CACrC,QAAQxE,EAAsBC,EAAsBzhC,EAAoB+/B,EAAA,gBAAgB,SAAUkG,EAA4D,CAC7J,GAAIzE,EAAU,SAAW,GAAKC,EAAU,SAAW,EAClD,OAAO1B,EAAA,oBAAoB,QAAQyB,EAAWC,CAAS,EAMxD,MAAMyE,EAAa,IAAIC,EAAA,QAAgB3E,EAAU,OAAQC,EAAU,MAAM,EACnE2E,EAAa,IAAID,EAAA,QAAgB3E,EAAU,OAAQC,EAAU,MAAM,EACnE4E,EAAU,IAAIF,EAAA,QAAgB3E,EAAU,OAAQC,EAAU,MAAM,EAGtE,QAAS6E,EAAK,EAAGA,EAAK9E,EAAU,OAAQ8E,IACvC,QAASC,EAAK,EAAGA,EAAK9E,EAAU,OAAQ8E,IAAM,CAC7C,GAAI,CAACvmC,EAAQ,QAAO,EACnB,OAAO+/B,EAAA,oBAAoB,gBAAgByB,EAAWC,CAAS,EAGhE,MAAM+E,EAAgBF,IAAO,EAAI,EAAIJ,EAAW,IAAII,EAAK,EAAGC,CAAE,EACxDE,EAAcF,IAAO,EAAI,EAAIL,EAAW,IAAII,EAAIC,EAAK,CAAC,EAE5D,IAAIG,EACAlF,EAAU,WAAW8E,CAAE,IAAM7E,EAAU,WAAW8E,CAAE,GACnDD,IAAO,GAAKC,IAAO,EACtBG,EAAmB,EAEnBA,EAAmBR,EAAW,IAAII,EAAK,EAAGC,EAAK,CAAC,EAE7CD,EAAK,GAAKC,EAAK,GAAKH,EAAW,IAAIE,EAAK,EAAGC,EAAK,CAAC,IAAM,IAE1DG,GAAoBL,EAAQ,IAAIC,EAAK,EAAGC,EAAK,CAAC,GAE/CG,GAAqBT,EAAgBA,EAAcK,EAAIC,CAAE,EAAI,GAE7DG,EAAmB,GAGpB,MAAMC,EAAW,KAAK,IAAIH,EAAeC,EAAaC,CAAgB,EAEtE,GAAIC,IAAaD,EAAkB,CAElC,MAAME,EAAUN,EAAK,GAAKC,EAAK,EAAIF,EAAQ,IAAIC,EAAK,EAAGC,EAAK,CAAC,EAAI,EACjEF,EAAQ,IAAIC,EAAIC,EAAIK,EAAU,CAAC,EAC/BR,EAAW,IAAIE,EAAIC,EAAI,CAAC,CACzB,MAAWI,IAAaH,GACvBH,EAAQ,IAAIC,EAAIC,EAAI,CAAC,EACrBH,EAAW,IAAIE,EAAIC,EAAI,CAAC,GACdI,IAAaF,IACvBJ,EAAQ,IAAIC,EAAIC,EAAI,CAAC,EACrBH,EAAW,IAAIE,EAAIC,EAAI,CAAC,GAGzBL,EAAW,IAAII,EAAIC,EAAII,CAAQ,CAChC,CAID,MAAMxtC,EAAyB,CAAA,EAC/B,IAAI4nC,EAA4BS,EAAU,OACtCR,EAA4BS,EAAU,OAE1C,SAASoF,EAAkCP,EAAYC,EAAU,EAC5DD,EAAK,IAAMvF,GAAqBwF,EAAK,IAAMvF,IAC9C7nC,EAAO,KAAK,IAAI4mC,EAAA,aACf,IAAI1F,EAAA,YAAYiM,EAAK,EAAGvF,CAAiB,EACzC,IAAI1G,EAAA,YAAYkM,EAAK,EAAGvF,CAAiB,CAAC,CAC1C,EAEFD,EAAoBuF,EACpBtF,EAAoBuF,CACrB,CAEA,IAAID,EAAK9E,EAAU,OAAS,EACxB+E,EAAK9E,EAAU,OAAS,EAC5B,KAAO6E,GAAM,GAAKC,GAAM,GACnBH,EAAW,IAAIE,EAAIC,CAAE,IAAM,GAC9BM,EAAkCP,EAAIC,CAAE,EACxCD,IACAC,KAEIH,EAAW,IAAIE,EAAIC,CAAE,IAAM,EAC9BD,IAEAC,IAIH,OAAAM,EAAkC,GAAI,EAAE,EACxC1tC,EAAO,QAAO,EACP,IAAI4mC,EAAA,oBAAoB5mC,EAAQ,EAAK,CAC7C,EA5FD2N,EAAA,0BAAAk/B,uJCAA,MAAac,CAAsB,CAMlC,YAA4B1B,EAAkCp9B,EAA8B++B,EAAkC,CAAlG,KAAA,MAAA3B,EAAkC,KAAA,MAAAp9B,EAA8B,KAAA,0BAAA++B,EAL3E,KAAA,SAAqB,CAAA,EACrB,KAAA,4BAAwC,CAAA,EACxC,KAAA,iBAA6B,CAAA,EAC7B,KAAA,0BAAsC,CAAA,EAGtD,KAAK,4BAA4B,KAAK,CAAC,EACvC,QAASpP,EAAa,KAAK,MAAM,gBAAiBA,GAAc,KAAK,MAAM,cAAeA,IAAc,CACvG,IAAI8D,EAAO2J,EAAMzN,EAAa,CAAC,EAC3BqP,EAAkB,EAClBrP,IAAe,KAAK,MAAM,iBAAmB,KAAK,MAAM,YAAc,IACzEqP,EAAkB,KAAK,MAAM,YAAc,EAC3CvL,EAAOA,EAAK,UAAUuL,CAAe,GAEtC,KAAK,iBAAiB,KAAKA,CAAe,EAE1C,IAAIC,EAAkB,EACtB,GAAI,CAACF,EAA2B,CAC/B,MAAMG,EAAmBzL,EAAK,UAAS,EACvCwL,EAAkBxL,EAAK,OAASyL,EAAiB,OACjDzL,EAAOyL,EAAiB,QAAO,CAChC,CACA,KAAK,0BAA0B,KAAKD,CAAe,EAEnD,MAAME,EAAaxP,IAAe,KAAK,MAAM,cAAgB,KAAK,IAAI,KAAK,MAAM,UAAY,EAAIqP,EAAkBC,EAAiBxL,EAAK,MAAM,EAAIA,EAAK,OACxJ,QAAShgC,EAAI,EAAGA,EAAI0rC,EAAY1rC,IAC/B,KAAK,SAAS,KAAKggC,EAAK,WAAWhgC,CAAC,CAAC,EAGlCk8B,EAAa,KAAK,MAAM,gBAC3B,KAAK,SAAS,KAAK,EAAkB,EACrC,KAAK,4BAA4B,KAAK,KAAK,SAAS,MAAM,EAE5D,CACD,CAEA,UAAQ,CACP,MAAO,WAAW,KAAK,IAAI,GAC5B,CAEA,IAAI,MAAI,CACP,OAAO,KAAK,QAAQ,IAAI0C,EAAA,YAAY,EAAG,KAAK,MAAM,CAAC,CACpD,CAEA,QAAQryB,EAAkB,CACzB,OAAO,KAAK,SAAS,MAAMA,EAAM,MAAOA,EAAM,YAAY,EAAE,IAAI9K,GAAK,OAAO,aAAaA,CAAC,CAAC,EAAE,KAAK,EAAE,CACrG,CAEA,WAAW2pB,EAAc,CACxB,OAAO,KAAK,SAASA,CAAM,CAC5B,CAEA,IAAI,QAAM,CACT,OAAO,KAAK,SAAS,MACtB,CAEO,iBAAiBzd,EAAc,CAIrC,MAAMg+B,EAAeC,EAAYj+B,EAAS,EAAI,KAAK,SAASA,EAAS,CAAC,EAAI,EAAE,EACtEk+B,EAAeD,EAAYj+B,EAAS,KAAK,SAAS,OAAS,KAAK,SAASA,CAAM,EAAI,EAAE,EAE3F,GAAIg+B,IAAY,GAAyCE,IAAY,EAEpE,MAAO,GAER,GAAIF,IAAY,EAEf,MAAO,KAGR,IAAIpV,EAAQ,EACZ,OAAIoV,IAAiBE,IACpBtV,GAAS,GACLoV,IAAY,GAAuCE,IAAY,IAClEtV,GAAS,IAIXA,GAASuV,EAAyBH,CAAY,EAC9CpV,GAASuV,EAAyBD,CAAY,EAEvCtV,CACR,CAEO,gBAAgBnL,EAAgB2gB,EAA+B,QAAO,CAE5E,MAAM/rC,KAAI++B,EAAA,uBAAsB,KAAK,4BAA8B9/B,GAAUA,GAASmsB,CAAM,EACtF+V,EAAa/V,EAAS,KAAK,4BAA4BprB,CAAC,EAC9D,OAAO,IAAI49B,EAAA,SACV,KAAK,MAAM,gBAAkB59B,EAC7B,EAAI,KAAK,iBAAiBA,CAAC,EAAImhC,GAAeA,IAAe,GAAK4K,IAAe,OAAU,EAAI,KAAK,0BAA0B/rC,CAAC,EAAE,CAEnI,CAEO,eAAeuM,EAAkB,CACvC,MAAMy/B,EAAO,KAAK,gBAAgBz/B,EAAM,MAAO,OAAO,EAChD0/B,EAAO,KAAK,gBAAgB1/B,EAAM,aAAc,MAAM,EAC5D,OAAI0/B,EAAK,SAASD,CAAI,EACdrN,EAAA,MAAM,cAAcsN,EAAMA,CAAI,EAE/BtN,EAAA,MAAM,cAAcqN,EAAMC,CAAI,CACtC,CAKO,mBAAmB7gB,EAAc,CAKvC,GAJIA,EAAS,GAAKA,GAAU,KAAK,SAAS,QAItC,CAAC8gB,EAAW,KAAK,SAAS9gB,CAAM,CAAC,EACpC,OAID,IAAI5b,EAAQ4b,EACZ,KAAO5b,EAAQ,GAAK08B,EAAW,KAAK,SAAS18B,EAAQ,CAAC,CAAC,GACtDA,IAID,IAAI0X,EAAMkE,EACV,KAAOlE,EAAM,KAAK,SAAS,QAAUglB,EAAW,KAAK,SAAShlB,CAAG,CAAC,GACjEA,IAGD,OAAO,IAAI0X,EAAA,YAAYpvB,EAAO0X,CAAG,CAClC,CAEO,aAAa3a,EAAkB,CACrC,OAAO,KAAK,gBAAgBA,EAAM,YAAY,EAAE,WAAa,KAAK,gBAAgBA,EAAM,KAAK,EAAE,UAChG,CAEO,gBAAgB03B,EAAiBC,EAAe,CACtD,OAAO,KAAK,SAASD,CAAO,IAAM,KAAK,SAASC,CAAO,CACxD,CAEO,kBAAkB33B,EAAkB,CAC1C,MAAMiD,KAAQuvB,EAAA,oBAAmB,KAAK,4BAA6BxvB,GAAKA,GAAKhD,EAAM,KAAK,GAAK,EACvF2a,KAAM6X,EAAA,qBAAoB,KAAK,4BAA6BxvB,GAAKhD,EAAM,cAAgBgD,CAAC,GAAK,KAAK,SAAS,OACjH,OAAO,IAAIqvB,EAAA,YAAYpvB,EAAO0X,CAAG,CAClC,EAjJD7b,EAAA,uBAAAggC,EAoJA,SAASa,EAAW51B,EAAgB,CACnC,OAAOA,GAAQ,IAAkBA,GAAQ,KACrCA,GAAQ,IAAkBA,GAAQ,IAClCA,GAAQ,IAAuBA,GAAQ,EAC5C,CAcA,MAAMigB,EAA8C,CACnD,EAAkC,EAClC,EAAkC,EAClC,EAAmC,EACnC,EAA4B,GAC5B,EAA8B,EAC9B,EAAkC,GAClC,EAA8B,EAC9B,EAAoC,GACpC,EAAoC,IAGrC,SAASuV,EAAyBK,EAA8B,CAC/D,OAAO5V,EAAM4V,CAAQ,CACtB,CAEA,SAASP,EAAYt1B,EAAgB,CACpC,OAAIA,IAAQ,GACX,EACUA,IAAQ,GAClB,KACUo0B,EAAA,SAAQp0B,CAAQ,EAC1B,EACUA,GAAQ,IAAkBA,GAAQ,IAC5C,EACUA,GAAQ,IAAkBA,GAAQ,GAC5C,EACUA,GAAQ,IAAuBA,GAAQ,GACjD,EACUA,IAAa,GACvB,EACUA,IAAQ,IAAuBA,IAAQ,GACjD,EAEA,CAEF,gICtMA,MAAa81B,CAAS,CACrB,YACU5Y,EAMA6Y,EAMA3I,EAAmB,CAZnB,KAAA,QAAAlQ,EAMA,KAAA,MAAA6Y,EAMA,KAAA,WAAA3I,CAEV,EAhBDr4B,EAAA,UAAA+gC,EAmBA,MAAaE,CAAS,CAUrB,YACCC,EACA/Y,EAA4C,CAE5C,KAAK,iBAAmB+Y,EACxB,KAAK,QAAU/Y,CAChB,EAhBDnoB,EAAA,UAAAihC,2LCtBA,MAAaE,CAAgB,CACrB,OAAO,QAAQ3xB,EAAsC4xB,EAA2BC,EAAyB,CAC/G,MAAMhvC,EAA6B,CAAA,EACnC,IAAIivC,EAA4B,EAC5BC,EAA4B,EAEhC,UAAWhmC,KAAKiU,EAAS,CACxB,MAAMvV,EAAI,IAAIknC,EACb,IAAIK,EAAA,UAAUF,EAA2B/lC,EAAE,SAAS,eAAe,EACnE,IAAIimC,EAAA,UAAUD,EAA2BhmC,EAAE,SAAS,eAAe,CAAC,EAEhEtB,EAAE,SAAS,SACf5H,EAAO,KAAK4H,CAAC,EAEdqnC,EAA4B/lC,EAAE,SAAS,uBACvCgmC,EAA4BhmC,EAAE,SAAS,sBACxC,CACA,MAAMtB,EAAI,IAAIknC,EACb,IAAIK,EAAA,UAAUF,EAA2BF,EAAoB,CAAC,EAC9D,IAAII,EAAA,UAAUD,EAA2BF,EAAoB,CAAC,CAAC,EAEhE,OAAKpnC,EAAE,SAAS,SACf5H,EAAO,KAAK4H,CAAC,EAEP5H,CACR,CAEO,OAAO,KAAKmd,EAAsCiyB,EAA0BC,EAAwB,CAC1G,MAAMrvC,EAA6B,CAAA,EACnC,UAAWkJ,KAAKiU,EAAS,CACxB,MAAM0W,EAAW3qB,EAAE,SAAS,UAAUkmC,CAAa,EAC7Ctb,EAAW5qB,EAAE,SAAS,UAAUmmC,CAAa,EAC/Cxb,GAAY,CAACA,EAAS,SAAWC,GAAY,CAACA,EAAS,SAC1D9zB,EAAO,KAAK,IAAI8uC,EAAiBjb,EAAUC,CAAQ,CAAC,CAEtD,CACA,OAAO9zB,CACR,CAYA,YACCovC,EACAC,EAAwB,CAExB,KAAK,SAAWD,EAChB,KAAK,SAAWC,CACjB,CAGO,UAAQ,CACd,MAAO,IAAI,KAAK,SAAS,SAAQ,CAAE,KAAK,KAAK,SAAS,SAAQ,CAAE,GACjE,CAEO,MAAI,CACV,OAAO,IAAIP,EAAiB,KAAK,SAAU,KAAK,QAAQ,CACzD,CAEO,KAAKl/B,EAAuB,CAClC,OAAO,IAAIk/B,EACV,KAAK,SAAS,KAAKl/B,EAAM,QAAQ,EACjC,KAAK,SAAS,KAAKA,EAAM,QAAQ,CAAC,CAEpC,CAOO,gBAAc,CACpB,MAAM0/B,EAAqB,KAAK,SAAS,iBAAgB,EACnDC,EAAoB,KAAK,SAAS,iBAAgB,EACxD,GAAID,GAAsBC,EACzB,OAAO,IAAIC,EAAaF,EAAoBC,CAAiB,EACvD,GAAI,KAAK,SAAS,kBAAoB,GAAK,KAAK,SAAS,kBAAoB,EAAG,CACtF,GAAI,EAAE,KAAK,SAAS,kBAAoB,GAAK,KAAK,SAAS,kBAAoB,GAE9E,MAAM,IAAIj1B,EAAA,mBAAmB,kBAAkB,EAKhD,OAAO,IAAIk1B,EACV,IAAIvO,EAAA,MAAM,KAAK,SAAS,gBAAiB,EAAG,KAAK,SAAS,uBAAwB,CAAC,EACnF,IAAIA,EAAA,MAAM,KAAK,SAAS,gBAAiB,EAAG,KAAK,SAAS,uBAAwB,CAAC,CAAC,CAEtF,KAEC,QAAO,IAAIuO,EACV,IAAIvO,EAAA,MAAM,KAAK,SAAS,gBAAkB,EAAG,OAAO,iBAAkB,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EACvI,IAAIA,EAAA,MAAM,KAAK,SAAS,gBAAkB,EAAG,OAAO,iBAAkB,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,CAAC,CAG3I,CAOO,gBAAgBpN,EAAoBC,EAAkB,CAC5D,GAAI2b,EAAkB,KAAK,SAAS,uBAAwB5b,CAAQ,GAChE4b,EAAkB,KAAK,SAAS,uBAAwB3b,CAAQ,EACnE,OAAO,IAAI0b,EACV,IAAIvO,EAAA,MAAM,KAAK,SAAS,gBAAiB,EAAG,KAAK,SAAS,uBAAwB,CAAC,EACnF,IAAIA,EAAA,MAAM,KAAK,SAAS,gBAAiB,EAAG,KAAK,SAAS,uBAAwB,CAAC,CAAC,EAItF,GAAI,CAAC,KAAK,SAAS,SAAW,CAAC,KAAK,SAAS,QAC5C,OAAO,IAAIuO,EACVvO,EAAA,MAAM,cACL,IAAIf,EAAA,SAAS,KAAK,SAAS,gBAAiB,CAAC,EAC7CwP,EAAkB,IAAIxP,EAAA,SAAS,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAGrM,CAAQ,CAAC,EAE7GoN,EAAA,MAAM,cACL,IAAIf,EAAA,SAAS,KAAK,SAAS,gBAAiB,CAAC,EAC7CwP,EAAkB,IAAIxP,EAAA,SAAS,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAGpM,CAAQ,CAAC,CAC5G,EAIH,GAAI,KAAK,SAAS,gBAAkB,GAAK,KAAK,SAAS,gBAAkB,EACxE,OAAO,IAAI0b,EACVvO,EAAA,MAAM,cACLyO,EAAkB,IAAIxP,EAAA,SAAS,KAAK,SAAS,gBAAkB,EAAG,OAAO,gBAAgB,EAAGrM,CAAQ,EACpG6b,EAAkB,IAAIxP,EAAA,SAAS,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAGrM,CAAQ,CAAC,EAE7GoN,EAAA,MAAM,cACLyO,EAAkB,IAAIxP,EAAA,SAAS,KAAK,SAAS,gBAAkB,EAAG,OAAO,gBAAgB,EAAGpM,CAAQ,EACpG4b,EAAkB,IAAIxP,EAAA,SAAS,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAGpM,CAAQ,CAAC,CAC5G,EAOH,MAAM,IAAIxZ,EAAA,kBACX,EApJD3M,EAAA,iBAAAmhC,EAuJA,SAASY,EAAkBlQ,EAAoBt6B,EAAiB,CAC/D,GAAIs6B,EAAS,WAAa,EACzB,OAAO,IAAIU,EAAA,SAAS,EAAG,CAAC,EAEzB,GAAIV,EAAS,WAAat6B,EAAQ,OACjC,OAAO,IAAIg7B,EAAA,SAASh7B,EAAQ,OAAQA,EAAQA,EAAQ,OAAS,CAAC,EAAE,OAAS,CAAC,EAE3E,MAAMo9B,EAAOp9B,EAAQs6B,EAAS,WAAa,CAAC,EAC5C,OAAIA,EAAS,OAAS8C,EAAK,OAAS,EAC5B,IAAIpC,EAAA,SAASV,EAAS,WAAY8C,EAAK,OAAS,CAAC,EAElD9C,CACR,CAEA,SAASiQ,EAAkBjR,EAAoByN,EAAe,CAC7D,OAAOzN,GAAc,GAAKA,GAAcyN,EAAM,MAC/C,CAMA,MAAa0D,UAAiCb,CAAgB,CACtD,OAAO,kBAAkBc,EAA6B,CAC5D,MAAMR,EAAgBD,EAAA,UAAU,KAAKS,EAAc,IAAIhoC,GAAKunC,EAAA,UAAU,mBAAmBvnC,EAAE,aAAa,CAAC,CAAC,EACpGynC,EAAgBF,EAAA,UAAU,KAAKS,EAAc,IAAIhoC,GAAKunC,EAAA,UAAU,mBAAmBvnC,EAAE,aAAa,CAAC,CAAC,EAC1G,OAAO,IAAI+nC,EAAyBP,EAAeC,EAAeO,CAAa,CAChF,CAUA,YACCR,EACAC,EACAQ,EAAwC,CAExC,MAAMT,EAAeC,CAAa,EAClC,KAAK,aAAeQ,CACrB,CAEgB,MAAI,CACnB,OAAO,IAAIF,EAAyB,KAAK,SAAU,KAAK,SAAU,KAAK,cAAc,IAAI9pC,GAAKA,EAAE,KAAI,CAAE,CAAC,CACxG,CAEO,gCAA8B,CACpC,OAAO,IAAI8pC,EAAyB,KAAK,SAAU,KAAK,SAAU,CAAC,KAAK,eAAc,CAAE,CAAC,CAC1F,EA9BDhiC,EAAA,yBAAAgiC,EAoCA,MAAaH,CAAY,CACjB,OAAO,aAAaI,EAA6B,CACvD,QAASttC,EAAI,EAAGA,EAAIstC,EAAc,OAAQttC,IAAK,CAC9C,MAAMggB,EAAWstB,EAActtC,EAAI,CAAC,EAC9B6f,EAAUytB,EAActtC,CAAC,EAC/B,GAAI,EACHggB,EAAS,cAAc,eAAc,EAAG,gBAAgBH,EAAQ,cAAc,iBAAgB,CAAE,GAC7FG,EAAS,cAAc,eAAc,EAAG,gBAAgBH,EAAQ,cAAc,iBAAgB,CAAE,GAEnG,MAAM,IAAI7H,EAAA,mBAAmB,+BAA+B,CAE9D,CACD,CAYA,YACC80B,EACAC,EAAoB,CAEpB,KAAK,cAAgBD,EACrB,KAAK,cAAgBC,CACtB,CAEO,UAAQ,CACd,MAAO,IAAI,KAAK,cAAc,SAAQ,CAAE,KAAK,KAAK,cAAc,SAAQ,CAAE,GAC3E,CAEO,MAAI,CACV,OAAO,IAAIG,EAAa,KAAK,cAAe,KAAK,aAAa,CAC/D,CAKO,WAAW1b,EAAsB,CACvC,MAAMgc,EAAUhc,EAAS,gBAAgB,KAAK,aAAa,EAC3D,OAAO,IAAIic,EAAA,eAAe,KAAK,cAAeD,CAAO,CACtD,EA9CDniC,EAAA,aAAA6hC,iJC/MA7hC,EAAA,kBAAAqiC,EAAA,SAAgBA,EACfla,EACAma,EACAC,EACAC,EACAC,EACAvpC,EAAiB,CAEjB,GAAI,CAAE,MAAA8nC,EAAO,gBAAA0B,CAAe,EAAKC,EAAkDxa,EAASma,EAAeC,EAAerpC,CAAO,EAEjI,GAAI,CAACA,EAAQ,QAAO,EAAM,MAAO,CAAA,EAEjC,MAAM0pC,EAAkBza,EAAQ,OAAOjwB,GAAK,CAACwqC,EAAgB,IAAIxqC,CAAC,CAAC,EAC7D2qC,EAAiBC,EAAsBF,EAAiBJ,EAAqBC,EAAqBH,EAAeC,EAAerpC,CAAO,EAC7I,SAAAs/B,EAAA,UAASwI,EAAO6B,CAAc,EAE9B7B,EAAQ+B,EAA0B/B,CAAK,EAEvCA,EAAQA,EAAM,OAAOxsB,GAAU,CAC9B,MAAM8pB,EAAQ9pB,EAAQ,SAAS,cAAa,EAAG,MAAM8tB,CAAa,EAAE,IAAI75B,GAAKA,EAAE,KAAI,CAAE,EAErF,OADqB61B,EAAM,KAAK;CAAI,EAChB,QAAU,IAAM0E,EAAW1E,EAAO71B,GAAKA,EAAE,QAAU,CAAC,GAAK,CAC9E,CAAC,EACDu4B,EAAQiC,EAAsB9a,EAAS6Y,CAAK,EAErCA,CACR,CAEA,SAASgC,EAAcjhC,EAAUuD,EAA4B,CAC5D,IAAIE,EAAQ,EACZ,UAAWmC,KAAK5F,EACXuD,EAAUqC,CAAC,GACdnC,IAGF,OAAOA,CACR,CAEA,SAASm9B,EACRxa,EACAma,EACAC,EACArpC,EAAiB,CAEjB,MAAM8nC,EAA4B,CAAA,EAE5BkC,EAAY/a,EAChB,OAAOjwB,GAAKA,EAAE,SAAS,SAAWA,EAAE,SAAS,QAAU,CAAC,EACxD,IAAIia,GAAK,IAAIktB,EAAA,kBAAkBltB,EAAE,SAAUmwB,EAAenwB,CAAC,CAAC,EACxDgxB,EAAa,IAAI,IAAIhb,EACzB,OAAOjwB,GAAKA,EAAE,SAAS,SAAWA,EAAE,SAAS,QAAU,CAAC,EACxD,IAAIia,GAAK,IAAIktB,EAAA,kBAAkBltB,EAAE,SAAUowB,EAAepwB,CAAC,CAAC,CAAC,EAEzDuwB,EAAkB,IAAI,IAE5B,UAAWU,KAAYF,EAAW,CACjC,IAAIG,EAAoB,GACpBC,EACJ,UAAWC,KAAaJ,EAAY,CACnC,MAAMK,EAAaJ,EAAS,kBAAkBG,CAAS,EACnDC,EAAaH,IAChBA,EAAoBG,EACpBF,EAAOC,EAET,CASA,GAPIF,EAAoB,IAAQC,IAC/BH,EAAW,OAAOG,CAAI,EACtBtC,EAAM,KAAK,IAAIyC,EAAA,iBAAiBL,EAAS,MAAOE,EAAK,KAAK,CAAC,EAC3DZ,EAAgB,IAAIU,EAAS,MAAM,EACnCV,EAAgB,IAAIY,EAAK,MAAM,GAG5B,CAACpqC,EAAQ,QAAO,EACnB,MAAO,CAAE,MAAA8nC,EAAO,gBAAA0B,CAAe,CAEjC,CAEA,MAAO,CAAE,MAAA1B,EAAO,gBAAA0B,CAAe,CAChC,CAEA,SAASI,EACR3a,EACAqa,EACAC,EACAH,EACAC,EACArpC,EAAiB,CAEjB,MAAM8nC,EAA4B,CAAA,EAE5B0C,EAAsB,IAAI3M,EAAA,OAEhC,UAAWvM,KAAUrC,EACpB,QAASxzB,EAAI61B,EAAO,SAAS,gBAAiB71B,EAAI61B,EAAO,SAAS,uBAAyB,EAAG71B,IAAK,CAClG,MAAMjB,EAAM,GAAG8uC,EAAoB7tC,EAAI,CAAC,CAAC,IAAI6tC,EAAoB7tC,EAAI,EAAI,CAAC,CAAC,IAAI6tC,EAAoB7tC,EAAI,EAAI,CAAC,CAAC,GAC7G+uC,EAAoB,IAAIhwC,EAAK,CAAE,MAAO,IAAI8tC,EAAA,UAAU7sC,EAAGA,EAAI,CAAC,CAAC,CAAE,CAChE,CAQD,MAAMgvC,EAAsC,CAAA,EAE5Cxb,EAAQ,QAAKqQ,EAAA,WAAUtgC,GAAKA,EAAE,SAAS,gBAAiBsgC,EAAA,gBAAgB,CAAC,EAEzE,UAAWhO,KAAUrC,EAAS,CAC7B,IAAIyb,EAAkC,CAAA,EACtC,QAASjvC,EAAI61B,EAAO,SAAS,gBAAiB71B,EAAI61B,EAAO,SAAS,uBAAyB,EAAG71B,IAAK,CAClG,MAAMjB,EAAM,GAAG+uC,EAAoB9tC,EAAI,CAAC,CAAC,IAAI8tC,EAAoB9tC,EAAI,EAAI,CAAC,CAAC,IAAI8tC,EAAoB9tC,EAAI,EAAI,CAAC,CAAC,GACvGkvC,EAAuB,IAAIrC,EAAA,UAAU7sC,EAAGA,EAAI,CAAC,EAE7CmvC,EAAkC,CAAA,EACxCJ,EAAoB,QAAQhwC,EAAK,CAAC,CAAE,MAAAwN,CAAK,IAAM,CAC9C,UAAW6iC,KAAeH,EAEzB,GAAIG,EAAY,kBAAkB,uBAAyB,IAAM7iC,EAAM,wBACtE6iC,EAAY,kBAAkB,uBAAyB,IAAMF,EAAqB,uBAAwB,CAC1GE,EAAY,kBAAoB,IAAIvC,EAAA,UAAUuC,EAAY,kBAAkB,gBAAiB7iC,EAAM,sBAAsB,EACzH6iC,EAAY,kBAAoB,IAAIvC,EAAA,UAAUuC,EAAY,kBAAkB,gBAAiBF,EAAqB,sBAAsB,EACxIC,EAAa,KAAKC,CAAW,EAC7B,MACD,CAGD,MAAMv0B,EAA2B,CAChC,kBAAmBq0B,EACnB,kBAAmB3iC,GAEpByiC,EAAiB,KAAKn0B,CAAO,EAC7Bs0B,EAAa,KAAKt0B,CAAO,CAC1B,CAAC,EACDo0B,EAAeE,CAChB,CAEA,GAAI,CAAC5qC,EAAQ,QAAO,EACnB,MAAO,CAAA,CAET,CAEAyqC,EAAiB,QAAKnL,EAAA,iBAAaA,EAAA,WAAUj9B,GAAKA,EAAE,kBAAkB,OAAQi9B,EAAA,gBAAgB,CAAC,CAAC,EAEhG,MAAMwL,EAAc,IAAIxC,EAAA,aAClByC,EAAc,IAAIzC,EAAA,aAExB,UAAWhyB,KAAWm0B,EAAkB,CAEvC,MAAMO,EAAgB10B,EAAQ,kBAAkB,gBAAkBA,EAAQ,kBAAkB,gBACtF20B,EAAmBH,EAAY,aAAax0B,EAAQ,iBAAiB,EACrE40B,EAA6BH,EAAY,aAAaz0B,EAAQ,iBAAiB,EAAE,aAAa00B,CAAa,EAE3GG,EAA8BF,EAAiB,gBAAgBC,CAA0B,EAE/F,UAAW57B,KAAK67B,EAA4B,OAAQ,CACnD,GAAI77B,EAAE,OAAS,EACd,SAED,MAAM87B,EAAoB97B,EACpB+7B,EAAoB/7B,EAAE,MAAM,CAAC07B,CAAa,EAEhDlD,EAAM,KAAK,IAAIyC,EAAA,iBAAiBc,EAAmBD,CAAiB,CAAC,EAErEN,EAAY,SAASM,CAAiB,EACtCL,EAAY,SAASM,CAAiB,CACvC,CACD,CAEAvD,EAAM,QAAKxI,EAAA,WAAUj9B,GAAKA,EAAE,SAAS,gBAAiBi9B,EAAA,gBAAgB,CAAC,EAEvE,MAAMgM,EAAoB,IAAI9Q,EAAA,gBAAgBvL,CAAO,EACrD,QAASxzB,EAAI,EAAGA,EAAIqsC,EAAM,OAAQrsC,IAAK,CACtC,MAAM8vC,EAAOzD,EAAMrsC,CAAC,EACd+vC,EAA0BF,EAAkB,mBAAmBtsC,GAAKA,EAAE,SAAS,iBAAmBusC,EAAK,SAAS,eAAe,EAC/HE,KAAyBjR,EAAA,oBAAmBvL,EAASjwB,GAAKA,EAAE,SAAS,iBAAmBusC,EAAK,SAAS,eAAe,EACrHG,EAAa,KAAK,IACvBH,EAAK,SAAS,gBAAkBC,EAAwB,SAAS,gBACjED,EAAK,SAAS,gBAAkBE,EAAuB,SAAS,eAAe,EAG1EE,EAAyBL,EAAkB,mBAAmBtsC,GAAKA,EAAE,SAAS,gBAAkBusC,EAAK,SAAS,sBAAsB,EACpIK,KAAwBpR,EAAA,oBAAmBvL,EAASjwB,GAAKA,EAAE,SAAS,gBAAkBusC,EAAK,SAAS,sBAAsB,EAC1HM,EAAa,KAAK,IACvBF,EAAuB,SAAS,uBAAyBJ,EAAK,SAAS,uBACvEK,EAAsB,SAAS,uBAAyBL,EAAK,SAAS,sBAAsB,EAG7F,IAAIO,EACJ,IAAKA,EAAc,EAAGA,EAAcJ,EAAYI,IAAe,CAC9D,MAAMC,EAAWR,EAAK,SAAS,gBAAkBO,EAAc,EACzDE,EAAUT,EAAK,SAAS,gBAAkBO,EAAc,EAO9D,GANIC,EAAW3C,EAAc,QAAU4C,EAAU3C,EAAc,QAG3DyB,EAAY,SAASkB,CAAO,GAAKjB,EAAY,SAASgB,CAAQ,GAG9D,CAACE,EAAgB7C,EAAc2C,EAAW,CAAC,EAAG1C,EAAc2C,EAAU,CAAC,EAAGhsC,CAAO,EACpF,KAEF,CAEI8rC,EAAc,IACjBf,EAAY,SAAS,IAAIzC,EAAA,UAAUiD,EAAK,SAAS,gBAAkBO,EAAaP,EAAK,SAAS,eAAe,CAAC,EAC9GT,EAAY,SAAS,IAAIxC,EAAA,UAAUiD,EAAK,SAAS,gBAAkBO,EAAaP,EAAK,SAAS,eAAe,CAAC,GAG/G,IAAIW,EACJ,IAAKA,EAAiB,EAAGA,EAAiBL,EAAYK,IAAkB,CACvE,MAAMH,EAAWR,EAAK,SAAS,uBAAyBW,EAClDF,EAAUT,EAAK,SAAS,uBAAyBW,EAOvD,GANIH,EAAW3C,EAAc,QAAU4C,EAAU3C,EAAc,QAG3DyB,EAAY,SAASkB,CAAO,GAAKjB,EAAY,SAASgB,CAAQ,GAG9D,CAACE,EAAgB7C,EAAc2C,EAAW,CAAC,EAAG1C,EAAc2C,EAAU,CAAC,EAAGhsC,CAAO,EACpF,KAEF,CAEIksC,EAAiB,IACpBnB,EAAY,SAAS,IAAIzC,EAAA,UAAUiD,EAAK,SAAS,uBAAwBA,EAAK,SAAS,uBAAyBW,CAAc,CAAC,EAC/HpB,EAAY,SAAS,IAAIxC,EAAA,UAAUiD,EAAK,SAAS,uBAAwBA,EAAK,SAAS,uBAAyBW,CAAc,CAAC,IAG5HJ,EAAc,GAAKI,EAAiB,KACvCpE,EAAMrsC,CAAC,EAAI,IAAI8uC,EAAA,iBACd,IAAIjC,EAAA,UAAUiD,EAAK,SAAS,gBAAkBO,EAAaP,EAAK,SAAS,uBAAyBW,CAAc,EAChH,IAAI5D,EAAA,UAAUiD,EAAK,SAAS,gBAAkBO,EAAaP,EAAK,SAAS,uBAAyBW,CAAc,CAAC,EAGpH,CAEA,OAAOpE,CACR,CAEA,SAASmE,EAAgBE,EAAeC,EAAepsC,EAAiB,CACvE,GAAImsC,EAAM,KAAI,IAAOC,EAAM,KAAI,EAAM,MAAO,GAC5C,GAAID,EAAM,OAAS,KAAOC,EAAM,OAAS,IAAO,MAAO,GAGvD,MAAMjzC,EADwB,IAAIkzC,EAAA,mBAAkB,EACf,QACpC,IAAIC,EAAA,uBAAuB,CAACH,CAAK,EAAG,IAAI/R,EAAA,MAAM,EAAG,EAAG,EAAG+R,EAAM,MAAM,EAAG,EAAK,EAC3E,IAAIG,EAAA,uBAAuB,CAACF,CAAK,EAAG,IAAIhS,EAAA,MAAM,EAAG,EAAG,EAAGgS,EAAM,MAAM,EAAG,EAAK,EAC3EpsC,CAAO,EAER,IAAIusC,EAA0B,EAC9B,MAAMC,EAAWzM,EAAA,aAAa,OAAO5mC,EAAO,MAAOgzC,EAAM,MAAM,EAC/D,UAAWM,KAAOD,EACjBC,EAAI,UAAU,QAAQ1+B,GAAM,IACtBo4B,EAAA,SAAQgG,EAAM,WAAWp+B,CAAG,CAAC,GACjCw+B,GAEF,CAAC,EAGF,SAASG,EAAgBxqC,EAAW,CACnC,IAAIoK,EAAQ,EACZ,QAAS7Q,EAAI,EAAGA,EAAI0wC,EAAM,OAAQ1wC,OAC5B0qC,EAAA,SAAQjkC,EAAI,WAAWzG,CAAC,CAAC,GAC7B6Q,IAGF,OAAOA,CACR,CAEA,MAAMqgC,EAAmBD,EAAgBP,EAAM,OAASC,EAAM,OAASD,EAAQC,CAAK,EAEpF,OADUG,EAA0BI,EAAmB,IAAOA,EAAmB,EAElF,CAEA,SAAS9C,EAA0B/B,EAAyB,CAC3D,GAAIA,EAAM,SAAW,EACpB,OAAOA,EAGRA,EAAM,QAAKxI,EAAA,WAAUj9B,GAAKA,EAAE,SAAS,gBAAiBi9B,EAAA,gBAAgB,CAAC,EAEvE,MAAMnmC,EAAS,CAAC2uC,EAAM,CAAC,CAAC,EACxB,QAASrsC,EAAI,EAAGA,EAAIqsC,EAAM,OAAQrsC,IAAK,CACtC,MAAMyN,EAAO/P,EAAOA,EAAO,OAAS,CAAC,EAC/BmiB,EAAUwsB,EAAMrsC,CAAC,EAEjBmxC,EAAetxB,EAAQ,SAAS,gBAAkBpS,EAAK,SAAS,uBAChE2jC,EAAevxB,EAAQ,SAAS,gBAAkBpS,EAAK,SAAS,uBAGtE,GAF6B0jC,GAAgB,GAAKC,GAAgB,GAEtCD,EAAeC,GAAgB,EAAG,CAC7D1zC,EAAOA,EAAO,OAAS,CAAC,EAAI+P,EAAK,KAAKoS,CAAO,EAC7C,QACD,CAEAniB,EAAO,KAAKmiB,CAAO,CACpB,CACA,OAAOniB,CACR,CAEA,SAAS4wC,EAAsB9a,EAAqC6Y,EAAyB,CAC5F,MAAMgF,EAAoB,IAAItS,EAAA,gBAAgBvL,CAAO,EACrD,OAAA6Y,EAAQA,EAAM,OAAOzlC,GAAI,CACxB,MAAM0qC,EAA8BD,EAAkB,mBAAmB9tC,GAAKA,EAAE,SAAS,gBAAkBqD,EAAE,SAAS,sBAAsB,GACxI,IAAIkoC,EAAA,iBAAiB,IAAIjC,EAAA,UAAU,EAAG,CAAC,EAAG,IAAIA,EAAA,UAAU,EAAG,CAAC,CAAC,EAC3D0E,KAA8BxS,EAAA,oBAAmBvL,EAASjwB,GAAKA,EAAE,SAAS,gBAAkBqD,EAAE,SAAS,sBAAsB,EAGnI,OADuB0qC,IAAgCC,CAExD,CAAC,EACMlF,CACR,sMC1EAhhC,EAAA,kCAAAmmC,EAsCAnmC,EAAA,oBAAAomC,EA/QA,MAAaC,CAAwB,CAArC,aAAA,CACkB,KAAA,0BAA4B,IAAIC,EAAA,0BAChC,KAAA,sBAAwB,IAAIf,EAAA,kBAqO9C,CAnOC,YAAYjD,EAAyBC,EAAyBtuC,EAAkC,CAC/F,GAAIquC,EAAc,QAAU,MAAK9J,EAAA,QAAO8J,EAAeC,EAAe,CAACztC,EAAGC,IAAMD,IAAMC,CAAC,EACtF,OAAO,IAAIwxC,EAAA,UAAU,CAAA,EAAI,CAAA,EAAI,EAAK,EAGnC,GAAIjE,EAAc,SAAW,GAAKA,EAAc,CAAC,EAAE,SAAW,GAAKC,EAAc,SAAW,GAAKA,EAAc,CAAC,EAAE,SAAW,EAC5H,OAAO,IAAIgE,EAAA,UAAU,CACpB,IAAI9C,EAAA,yBACH,IAAIjC,EAAA,UAAU,EAAGc,EAAc,OAAS,CAAC,EACzC,IAAId,EAAA,UAAU,EAAGe,EAAc,OAAS,CAAC,EACzC,CACC,IAAIkB,EAAA,aACH,IAAInQ,EAAA,MAAM,EAAG,EAAGgP,EAAc,OAAQA,EAAcA,EAAc,OAAS,CAAC,EAAE,OAAS,CAAC,EACxF,IAAIhP,EAAA,MAAM,EAAG,EAAGiP,EAAc,OAAQA,EAAcA,EAAc,OAAS,CAAC,EAAE,OAAS,CAAC,CAAC,EAE1F,GAEA,CAAA,EAAI,EAAK,EAGb,MAAMrpC,EAAUjF,EAAQ,uBAAyB,EAAIglC,EAAA,gBAAgB,SAAW,IAAIA,EAAA,YAAYhlC,EAAQ,oBAAoB,EACtHgsC,EAA4B,CAAChsC,EAAQ,qBAErCuyC,EAAgB,IAAI,IAC1B,SAASC,EAAgB3vC,EAAY,CACpC,IAAIiC,EAAOytC,EAAc,IAAI1vC,CAAI,EACjC,OAAIiC,IAAS,SACZA,EAAOytC,EAAc,KACrBA,EAAc,IAAI1vC,EAAMiC,CAAI,GAEtBA,CACR,CAEA,MAAM2tC,EAAsBpE,EAAc,IAAK75B,GAAMg+B,EAAgBh+B,EAAE,KAAI,CAAE,CAAC,EACxEk+B,EAAsBpE,EAAc,IAAK95B,GAAMg+B,EAAgBh+B,EAAE,KAAI,CAAE,CAAC,EAExEiyB,EAAY,IAAIkM,EAAA,aAAaF,EAAqBpE,CAAa,EAC/D3H,EAAY,IAAIiM,EAAA,aAAaD,EAAqBpE,CAAa,EAE/DsE,EACDnM,EAAU,OAASC,EAAU,OAAS,KAElC,KAAK,0BAA0B,QACrCD,EACAC,EACAzhC,EACA,CAAC0/B,EAASC,IACTyJ,EAAc1J,CAAO,IAAM2J,EAAc1J,CAAO,EAC7C0J,EAAc1J,CAAO,EAAE,SAAW,EACjC,GACA,EAAI,KAAK,IAAI,EAAI0J,EAAc1J,CAAO,EAAE,MAAM,EAC/C,GAAI,EAIH,KAAK,sBAAsB,QACjC6B,EACAC,EACAzhC,CAAO,EAIT,IAAI4tC,EAAiBD,EAAoB,MACrCxO,EAAawO,EAAoB,WACrCC,KAAiBC,EAAA,uBAAsBrM,EAAWC,EAAWmM,CAAc,EAC3EA,KAAiBC,EAAA,0CAAyCrM,EAAWC,EAAWmM,CAAc,EAE9F,MAAME,EAA6B,CAAA,EAE7BC,EAA4BC,GAA2B,CAC5D,GAAKjH,EAIL,QAAStrC,EAAI,EAAGA,EAAIuyC,EAAiBvyC,IAAK,CACzC,MAAM+mC,GAAayL,EAAgBxyC,EAC7ByyC,GAAaC,EAAgB1yC,EACnC,GAAI2tC,EAAc5G,EAAU,IAAM6G,EAAc6E,EAAU,EAAG,CAE5D,MAAME,GAAiB,KAAK,WAAWhF,EAAeC,EAAe,IAAItJ,EAAA,aACxE,IAAI1F,EAAA,YAAYmI,GAAYA,GAAa,CAAC,EAC1C,IAAInI,EAAA,YAAY6T,GAAYA,GAAa,CAAC,CAAC,EACzCluC,EAAS+mC,CAAyB,EACrC,UAAWnrC,MAAKwyC,GAAe,SAC9BN,EAAW,KAAKlyC,EAAC,EAEdwyC,GAAe,aAClBjP,EAAa,GAEf,CACD,CACD,EAEA,IAAI8O,EAAgB,EAChBE,EAAgB,EAEpB,UAAWpmB,KAAQ6lB,EAAgB,IAClC3R,EAAA,UAAS,IAAMlU,EAAK,UAAU,MAAQkmB,IAAkBlmB,EAAK,UAAU,MAAQomB,CAAa,EAE5F,MAAMH,EAAkBjmB,EAAK,UAAU,MAAQkmB,EAE/CF,EAAyBC,CAAe,EAExCC,EAAgBlmB,EAAK,UAAU,aAC/BomB,EAAgBpmB,EAAK,UAAU,aAE/B,MAAMqmB,GAAiB,KAAK,WAAWhF,EAAeC,EAAethB,EAAM/nB,EAAS+mC,CAAyB,EACzGqH,GAAe,aAClBjP,EAAa,IAEd,UAAWvjC,MAAKwyC,GAAe,SAC9BN,EAAW,KAAKlyC,EAAC,CAEnB,CAEAmyC,EAAyB3E,EAAc,OAAS6E,CAAa,EAE7D,MAAMhf,EAAUge,EAAkCa,EAAY1E,EAAeC,CAAa,EAE1F,IAAIvB,EAAqB,CAAA,EACzB,OAAI/sC,EAAQ,eACX+sC,EAAQ,KAAK,aAAa7Y,EAASma,EAAeC,EAAemE,EAAqBC,EAAqBztC,EAAS+mC,CAAyB,MAI9I9K,EAAA,UAAS,IAAK,CACb,SAASoS,EAAiBhW,GAAe+M,GAAe,CACvD,GAAI/M,GAAI,WAAa,GAAKA,GAAI,WAAa+M,GAAM,OAAU,MAAO,GAClE,MAAM3J,GAAO2J,GAAM/M,GAAI,WAAa,CAAC,EACrC,MAAI,EAAAA,GAAI,OAAS,GAAKA,GAAI,OAASoD,GAAK,OAAS,EAElD,CAEA,SAAS6S,EAActmC,GAAkBo9B,GAAe,CAEvD,MADI,EAAAp9B,GAAM,gBAAkB,GAAKA,GAAM,gBAAkBo9B,GAAM,OAAS,GACpEp9B,GAAM,uBAAyB,GAAKA,GAAM,uBAAyBo9B,GAAM,OAAS,EAEvF,CAEA,UAAWpmC,MAAKiwB,EAAS,CACxB,GAAI,CAACjwB,GAAE,aAAgB,MAAO,GAC9B,UAAWuvC,MAAMvvC,GAAE,aAGlB,GAAI,EAFUqvC,EAAiBE,GAAG,cAAc,iBAAgB,EAAIlF,CAAa,GAAKgF,EAAiBE,GAAG,cAAc,eAAc,EAAIlF,CAAa,GACtJgF,EAAiBE,GAAG,cAAc,iBAAgB,EAAInF,CAAa,GAAKiF,EAAiBE,GAAG,cAAc,eAAc,EAAInF,CAAa,GAEzI,MAAO,GAGT,GAAI,CAACkF,EAActvC,GAAE,SAAUqqC,CAAa,GAAK,CAACiF,EAActvC,GAAE,SAAUoqC,CAAa,EACxF,MAAO,EAET,CACA,MAAO,EACR,CAAC,EAEM,IAAIiE,EAAA,UAAUpe,EAAS6Y,EAAO3I,CAAU,CAChD,CAEQ,aACPlQ,EACAma,EACAC,EACAC,EACAC,EACAvpC,EACA+mC,EAAkC,CAkBlC,SAhBcyH,EAAA,mBACbvf,EACAma,EACAC,EACAC,EACAC,EACAvpC,CAAO,EAEqB,IAAIqC,GAAI,CACpC,MAAMosC,EAAc,KAAK,WAAWrF,EAAeC,EAAe,IAAItJ,EAAA,aACrE19B,EAAE,SAAS,cAAa,EACxBA,EAAE,SAAS,cAAa,CAAE,EACxBrC,EAAS+mC,CAAyB,EAC/B5wB,EAAW82B,EAAkCwB,EAAY,SAAUrF,EAAeC,EAAe,EAAI,EAC3G,OAAO,IAAIgE,EAAA,UAAUhrC,EAAG8T,CAAQ,CACjC,CAAC,CAEF,CAEQ,WAAWizB,EAAyBC,EAAyBthB,EAAoB/nB,EAAmB+mC,EAAkC,CAE7I,MAAM2H,EADmBC,EAAmB5mB,CAAI,EACV,gBAAgBqhB,EAAeC,CAAa,EAE5EuF,EAAS,IAAItC,EAAA,uBAAuBlD,EAAesF,EAAa,cAAe3H,CAAyB,EACxG8H,EAAS,IAAIvC,EAAA,uBAAuBjD,EAAeqF,EAAa,cAAe3H,CAAyB,EAExG+H,EAAaF,EAAO,OAASC,EAAO,OAAS,IAChD,KAAK,0BAA0B,QAAQD,EAAQC,EAAQ7uC,CAAO,EAC9D,KAAK,sBAAsB,QAAQ4uC,EAAQC,EAAQ7uC,CAAO,EAEvD+uC,EAAQ,GAEd,IAAI7P,EAAQ4P,EAAW,MACnBC,GAAShP,EAAA,aAAa,aAAab,CAAK,EAC5CA,KAAQ2O,EAAA,uBAAsBe,EAAQC,EAAQ3P,CAAK,EAC/C6P,GAAShP,EAAA,aAAa,aAAab,CAAK,EAC5CA,KAAQ2O,EAAA,sCAAqCe,EAAQC,EAAQ3P,CAAK,EAC9D6P,GAAShP,EAAA,aAAa,aAAab,CAAK,EAC5CA,KAAQ2O,EAAA,oBAAmBe,EAAQC,EAAQ3P,CAAK,EAC5C6P,GAAShP,EAAA,aAAa,aAAab,CAAK,EAC5CA,KAAQ2O,EAAA,6CAA4Ce,EAAQC,EAAQ3P,CAAK,EACrE6P,GAAShP,EAAA,aAAa,aAAab,CAAK,EAE5C,MAAM/lC,EAAS+lC,EAAM,IACnBjmB,GACA,IAAIsxB,EAAA,aACHqE,EAAO,eAAe31B,EAAE,SAAS,EACjC41B,EAAO,eAAe51B,EAAE,SAAS,CAAC,CAClC,EAGH,OAAI81B,GAASxE,EAAA,aAAa,aAAapxC,CAAM,EAItC,CACN,SAAUA,EACV,WAAY21C,EAAW,WAEzB,EAtODhoC,EAAA,yBAAAqmC,EAyOA,SAAgBF,EAAkCa,EAA4B1E,EAAyBC,EAAyB2F,EAA+B,GAAK,CACnK,MAAM/f,EAAsC,CAAA,EAC5C,UAAW,OAAKqQ,EAAA,iBACfwO,EAAW,IAAIlyC,GAAKsxC,EAAoBtxC,EAAGwtC,EAAeC,CAAa,CAAC,EACxE,CAAC4F,EAAIC,IACJD,EAAG,SAAS,eAAeC,EAAG,QAAQ,GACnCD,EAAG,SAAS,eAAeC,EAAG,QAAQ,CAAC,EACzC,CACF,MAAMtiC,EAAQ,EAAE,CAAC,EACX1D,EAAO,EAAE,EAAE,OAAS,CAAC,EAE3B+lB,EAAQ,KAAK,IAAIsb,EAAA,yBAChB39B,EAAM,SAAS,KAAK1D,EAAK,QAAQ,EACjC0D,EAAM,SAAS,KAAK1D,EAAK,QAAQ,EACjC,EAAE,IAAItN,GAAKA,EAAE,aAAc,CAAC,CAAC,CAAC,CAC9B,CACF,CAEA,SAAAqgC,EAAA,UAAS,IACJ,CAAC+S,GAAuB/f,EAAQ,OAAS,IACxCA,EAAQ,CAAC,EAAE,SAAS,kBAAoBA,EAAQ,CAAC,EAAE,SAAS,iBAG5Doa,EAAc,OAASpa,EAAQA,EAAQ,OAAS,CAAC,EAAE,SAAS,yBAA2Bma,EAAc,OAASna,EAAQA,EAAQ,OAAS,CAAC,EAAE,SAAS,wBAC/I,MAGFgN,EAAA,oBAAmBhN,EACzB,CAACkgB,EAAIC,IAAOA,EAAG,SAAS,gBAAkBD,EAAG,SAAS,yBAA2BC,EAAG,SAAS,gBAAkBD,EAAG,SAAS,wBAE1HA,EAAG,SAAS,uBAAyBC,EAAG,SAAS,iBACjDD,EAAG,SAAS,uBAAyBC,EAAG,SAAS,eAAe,CAElE,EAEMngB,CACR,CAEA,SAAgBie,EAAoBwB,EAA4BtF,EAAyBC,EAAuB,CAC/G,IAAIgG,EAAiB,EACjBC,EAAe,EAMfZ,EAAa,cAAc,YAAc,GAAKA,EAAa,cAAc,YAAc,GACvFA,EAAa,cAAc,gBAAkBW,GAAkBX,EAAa,cAAc,eAC1FA,EAAa,cAAc,gBAAkBW,GAAkBX,EAAa,cAAc,gBAE7FY,EAAe,IAKZZ,EAAa,cAAc,YAAc,GAAKrF,EAAcqF,EAAa,cAAc,gBAAkB,CAAC,EAAE,QAC5GA,EAAa,cAAc,YAAc,GAAKtF,EAAcsF,EAAa,cAAc,gBAAkB,CAAC,EAAE,QAC5GA,EAAa,cAAc,iBAAmBA,EAAa,cAAc,cAAgBY,GACzFZ,EAAa,cAAc,iBAAmBA,EAAa,cAAc,cAAgBY,IAE5FD,EAAiB,GAGlB,MAAMhE,EAAoB,IAAI/C,EAAA,UAC7BoG,EAAa,cAAc,gBAAkBW,EAC7CX,EAAa,cAAc,cAAgB,EAAIY,CAAY,EAEtDlE,EAAoB,IAAI9C,EAAA,UAC7BoG,EAAa,cAAc,gBAAkBW,EAC7CX,EAAa,cAAc,cAAgB,EAAIY,CAAY,EAG5D,OAAO,IAAI/E,EAAA,yBAAyBc,EAAmBD,EAAmB,CAACsD,CAAY,CAAC,CACzF,CAEA,SAASC,EAAmBY,EAA0B,CACrD,OAAO,IAAIhF,EAAA,iBACV,IAAIjC,EAAA,UAAUiH,EAAa,UAAU,MAAQ,EAAGA,EAAa,UAAU,aAAe,CAAC,EACvF,IAAIjH,EAAA,UAAUiH,EAAa,UAAU,MAAQ,EAAGA,EAAa,UAAU,aAAe,CAAC,CAAC,CAE1F,kLChUA,MAAMC,EAAoC,EAE1C,MAAaC,CAAuB,CACnC,YAAYrG,EAAyBC,EAAyBtuC,EAAkC,CAQ/F,MAAM5B,EAPe,IAAIu2C,EAAatG,EAAeC,EAAe,CACnE,mBAAoBtuC,EAAQ,qBAC5B,2BAA4BA,EAAQ,qBACpC,yBAA0B,GAC1B,qBAAsB,GACtB,6BAA8B,GAC9B,EAC2B,YAAW,EACjCk0B,EAAsC,CAAA,EAC5C,IAAI0gB,EAA8C,KAGlD,UAAW3wC,KAAK7F,EAAO,QAAS,CAC/B,IAAIovC,EACAvpC,EAAE,wBAA0B,EAE/BupC,EAAgB,IAAID,EAAA,UAAUtpC,EAAE,wBAA0B,EAAGA,EAAE,wBAA0B,CAAC,EAE1FupC,EAAgB,IAAID,EAAA,UAAUtpC,EAAE,wBAAyBA,EAAE,sBAAwB,CAAC,EAGrF,IAAIwpC,EACAxpC,EAAE,wBAA0B,EAE/BwpC,EAAgB,IAAIF,EAAA,UAAUtpC,EAAE,wBAA0B,EAAGA,EAAE,wBAA0B,CAAC,EAE1FwpC,EAAgB,IAAIF,EAAA,UAAUtpC,EAAE,wBAAyBA,EAAE,sBAAwB,CAAC,EAGrF,IAAIsyB,EAAS,IAAIiZ,EAAA,yBAAyBhC,EAAeC,EAAexpC,EAAE,aAAa,IAAIA,GAAK,IAAIurC,EAAA,aACnG,IAAInQ,EAAA,MAAMp7B,EAAE,wBAAyBA,EAAE,oBAAqBA,EAAE,sBAAuBA,EAAE,iBAAiB,EACxG,IAAIo7B,EAAA,MAAMp7B,EAAE,wBAAyBA,EAAE,oBAAqBA,EAAE,sBAAuBA,EAAE,iBAAiB,CAAC,CACzG,CAAC,EACE2wC,IACCA,EAAW,SAAS,yBAA2Bre,EAAO,SAAS,iBAC/Dqe,EAAW,SAAS,yBAA2Bre,EAAO,SAAS,mBAElEA,EAAS,IAAIiZ,EAAA,yBACZoF,EAAW,SAAS,KAAKre,EAAO,QAAQ,EACxCqe,EAAW,SAAS,KAAKre,EAAO,QAAQ,EACxCqe,EAAW,cAAgBre,EAAO,aACjCqe,EAAW,aAAa,OAAOre,EAAO,YAAY,EAAI,MAAS,EAEjErC,EAAQ,IAAG,GAIbA,EAAQ,KAAKqC,CAAM,EACnBqe,EAAare,CACd,CAEA,SAAA2K,EAAA,UAAS,OACDA,EAAA,oBAAmBhN,EACzB,CAACkgB,EAAIC,IAAOA,EAAG,SAAS,gBAAkBD,EAAG,SAAS,yBAA2BC,EAAG,SAAS,gBAAkBD,EAAG,SAAS,wBAE1HA,EAAG,SAAS,uBAAyBC,EAAG,SAAS,iBACjDD,EAAG,SAAS,uBAAyBC,EAAG,SAAS,eAAe,CAElE,EAEM,IAAI/B,EAAA,UAAUpe,EAAS,CAAA,EAAI91B,EAAO,SAAS,CACnD,EA/DD2N,EAAA,wBAAA2oC,EAkGA,SAASG,EAAY9hB,EAA6BC,EAA6BC,EAA4Cd,EAAe,CAEzI,OADiB,IAAI2iB,EAAA,QAAQ/hB,EAAkBC,EAAkBC,CAA2B,EAC5E,YAAYd,CAAM,CACnC,CAEA,MAAMgY,CAAY,CAMjB,YAAYE,EAAe,CAC1B,MAAM0K,EAAyB,CAAA,EACzBC,EAAuB,CAAA,EAC7B,QAASt0C,EAAI,EAAG2N,EAASg8B,EAAM,OAAQ3pC,EAAI2N,EAAQ3N,IAClDq0C,EAAar0C,CAAC,EAAIu0C,EAAuB5K,EAAM3pC,CAAC,EAAG,CAAC,EACpDs0C,EAAWt0C,CAAC,EAAIw0C,EAAsB7K,EAAM3pC,CAAC,EAAG,CAAC,EAElD,KAAK,MAAQ2pC,EACb,KAAK,cAAgB0K,EACrB,KAAK,YAAcC,CACpB,CAEO,aAAW,CACjB,MAAMvhB,EAAqB,CAAA,EAC3B,QAAS/yB,EAAI,EAAGrC,EAAM,KAAK,MAAM,OAAQqC,EAAIrC,EAAKqC,IACjD+yB,EAAS/yB,CAAC,EAAI,KAAK,MAAMA,CAAC,EAAE,UAAU,KAAK,cAAcA,CAAC,EAAI,EAAG,KAAK,YAAYA,CAAC,EAAI,CAAC,EAEzF,OAAO+yB,CACR,CAEO,iBAAiBvlB,EAAa,CACpC,OAAO,KAAK,MAAMA,CAAK,CACxB,CAEO,mBAAmBxN,EAAS,CAClC,OAAOA,EAAI,CACZ,CAEO,iBAAiBA,EAAS,CAChC,OAAOA,EAAI,CACZ,CAEO,mBAAmBy0C,EAAqC5oB,EAAoB6oB,EAAgB,CAClG,MAAMC,EAAsB,CAAA,EACtBC,EAAwB,CAAA,EACxBC,EAAoB,CAAA,EAC1B,IAAIl3C,EAAM,EACV,QAAS6P,EAAQqe,EAAYre,GAASknC,EAAUlnC,IAAS,CACxD,MAAMy0B,EAAc,KAAK,MAAMz0B,CAAK,EAC9BuvB,EAAe0X,EAA6B,KAAK,cAAcjnC,CAAK,EAAI,EACxEyvB,EAAawX,EAA6B,KAAK,YAAYjnC,CAAK,EAAIy0B,EAAY,OAAS,EAC/F,QAAS6S,EAAM/X,EAAa+X,EAAM7X,EAAW6X,IAC5CH,EAAUh3C,CAAG,EAAIskC,EAAY,WAAW6S,EAAM,CAAC,EAC/CF,EAAYj3C,CAAG,EAAI6P,EAAQ,EAC3BqnC,EAAQl3C,CAAG,EAAIm3C,EACfn3C,IAEG,CAAC82C,GAA8BjnC,EAAQknC,IAE1CC,EAAUh3C,CAAG,EAAC,GACdi3C,EAAYj3C,CAAG,EAAI6P,EAAQ,EAC3BqnC,EAAQl3C,CAAG,EAAIskC,EAAY,OAAS,EACpCtkC,IAEF,CACA,OAAO,IAAIo3C,EAAaJ,EAAWC,EAAaC,CAAO,CACxD,EAGD,MAAME,CAAY,CAMjB,YAAYJ,EAAqBC,EAAuBC,EAAiB,CACxE,KAAK,WAAaF,EAClB,KAAK,aAAeC,EACpB,KAAK,SAAWC,CACjB,CAEO,UAAQ,CACd,MACC,IAAM,KAAK,WAAW,IAAI,CAAChhC,EAAGvB,KAASuB,IAAC,GAAyB,MAAQ,OAAO,aAAaA,CAAC,GAAK,KAAK,KAAK,aAAavB,CAAG,CAAC,IAAI,KAAK,SAASA,CAAG,CAAC,GAAG,EAAE,KAAK,IAAI,EAAI,GAExK,CAEQ,aAAa9E,EAAeJ,EAAa,CAChD,GAAII,EAAQ,GAAKA,GAASJ,EAAI,OAC7B,MAAM,IAAI,MAAM,eAAe,CAEjC,CAEO,aAAW,CACjB,OAAO,KAAK,UACb,CAEO,mBAAmBpN,EAAS,CAClC,OAAIA,EAAI,GAAKA,IAAM,KAAK,aAAa,OAG7B,KAAK,iBAAiBA,EAAI,CAAC,GAEnC,KAAK,aAAaA,EAAG,KAAK,YAAY,EAE/B,KAAK,aAAaA,CAAC,EAC3B,CAEO,iBAAiBA,EAAS,CAChC,OAAIA,IAAM,GAGF,KAAK,mBAAmBA,EAAI,CAAC,GAErC,KAAK,aAAaA,EAAG,KAAK,YAAY,EAElC,KAAK,WAAWA,CAAC,IAAC,GACd,KAAK,aAAaA,CAAC,EAAI,EAExB,KAAK,aAAaA,CAAC,EAC3B,CAEO,eAAeA,EAAS,CAC9B,OAAIA,EAAI,GAAKA,IAAM,KAAK,SAAS,OAGzB,KAAK,aAAaA,EAAI,CAAC,GAE/B,KAAK,aAAaA,EAAG,KAAK,QAAQ,EAC3B,KAAK,SAASA,CAAC,EACvB,CAEO,aAAaA,EAAS,CAC5B,OAAIA,IAAM,GAGF,KAAK,eAAeA,EAAI,CAAC,GAEjC,KAAK,aAAaA,EAAG,KAAK,QAAQ,EAE9B,KAAK,WAAWA,CAAC,IAAC,GACd,EAED,KAAK,SAASA,CAAC,EAAI,EAC3B,EAGD,MAAMg1C,CAAU,CAYf,YACCC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAyB,CAEzB,KAAK,wBAA0BP,EAC/B,KAAK,oBAAsBC,EAC3B,KAAK,sBAAwBC,EAC7B,KAAK,kBAAoBC,EACzB,KAAK,wBAA0BC,EAC/B,KAAK,oBAAsBC,EAC3B,KAAK,sBAAwBC,EAC7B,KAAK,kBAAoBC,CAC1B,CAEO,OAAO,qBAAqBC,EAAyBC,EAAoCC,EAAkC,CACjI,MAAMV,EAA0BS,EAAqB,mBAAmBD,EAAW,aAAa,EAC1FP,EAAsBQ,EAAqB,eAAeD,EAAW,aAAa,EAClFN,EAAwBO,EAAqB,iBAAiBD,EAAW,cAAgBA,EAAW,eAAiB,CAAC,EACtHL,EAAoBM,EAAqB,aAAaD,EAAW,cAAgBA,EAAW,eAAiB,CAAC,EAE9GJ,EAA0BM,EAAqB,mBAAmBF,EAAW,aAAa,EAC1FH,EAAsBK,EAAqB,eAAeF,EAAW,aAAa,EAClFF,EAAwBI,EAAqB,iBAAiBF,EAAW,cAAgBA,EAAW,eAAiB,CAAC,EACtHD,EAAoBG,EAAqB,aAAaF,EAAW,cAAgBA,EAAW,eAAiB,CAAC,EAEpH,OAAO,IAAIT,EACVC,EAAyBC,EAAqBC,EAAuBC,EACrEC,EAAyBC,EAAqBC,EAAuBC,CAAiB,CAExF,EAGD,SAASI,EAAuBC,EAAyB,CACxD,GAAIA,EAAW,QAAU,EACxB,OAAOA,EAGR,MAAMn4C,EAAS,CAACm4C,EAAW,CAAC,CAAC,EAC7B,IAAIzf,EAAa14B,EAAO,CAAC,EAEzB,QAASsC,EAAI,EAAGrC,EAAMk4C,EAAW,OAAQ71C,EAAIrC,EAAKqC,IAAK,CACtD,MAAM81C,EAAaD,EAAW71C,CAAC,EAEzB+1C,EAAyBD,EAAW,eAAiB1f,EAAW,cAAgBA,EAAW,gBAC3F4f,EAAyBF,EAAW,eAAiB1f,EAAW,cAAgBA,EAAW,gBAE1E,KAAK,IAAI2f,EAAwBC,CAAsB,EAEzDjC,GAEpB3d,EAAW,eAAkB0f,EAAW,cAAgBA,EAAW,eAAkB1f,EAAW,cAChGA,EAAW,eAAkB0f,EAAW,cAAgBA,EAAW,eAAkB1f,EAAW,gBAGhG14B,EAAO,KAAKo4C,CAAU,EACtB1f,EAAa0f,EAEf,CAEA,OAAOp4C,CACR,CAEA,MAAMu4C,CAAU,CAOf,YACChB,EACAE,EACAE,EACAE,EACAW,EAAqC,CAErC,KAAK,wBAA0BjB,EAC/B,KAAK,sBAAwBE,EAC7B,KAAK,wBAA0BE,EAC/B,KAAK,sBAAwBE,EAC7B,KAAK,YAAcW,CACpB,CAEO,OAAO,qBAAqBzB,EAAqCgB,EAAyBU,EAAoCC,EAAoCC,EAAiCC,EAAmCC,EAAqC,CACjR,IAAItB,EACAE,EACAE,EACAE,EACAW,EAkBJ,GAhBIT,EAAW,iBAAmB,GACjCR,EAA0BkB,EAAqB,mBAAmBV,EAAW,aAAa,EAAI,EAC9FN,EAAwB,IAExBF,EAA0BkB,EAAqB,mBAAmBV,EAAW,aAAa,EAC1FN,EAAwBgB,EAAqB,iBAAiBV,EAAW,cAAgBA,EAAW,eAAiB,CAAC,GAGnHA,EAAW,iBAAmB,GACjCJ,EAA0Be,EAAqB,mBAAmBX,EAAW,aAAa,EAAI,EAC9FF,EAAwB,IAExBF,EAA0Be,EAAqB,mBAAmBX,EAAW,aAAa,EAC1FF,EAAwBa,EAAqB,iBAAiBX,EAAW,cAAgBA,EAAW,eAAiB,CAAC,GAGnHa,GAA4Bb,EAAW,eAAiB,GAAKA,EAAW,eAAiB,IAAMA,EAAW,eAAiB,GAAKA,EAAW,eAAiB,IAAMY,EAAgB,EAAI,CAEzL,MAAMX,EAAuBS,EAAqB,mBAAmB1B,EAA4BgB,EAAW,cAAeA,EAAW,cAAgBA,EAAW,eAAiB,CAAC,EAC7KE,EAAuBS,EAAqB,mBAAmB3B,EAA4BgB,EAAW,cAAeA,EAAW,cAAgBA,EAAW,eAAiB,CAAC,EAEnL,GAAIC,EAAqB,YAAW,EAAG,OAAS,GAAKC,EAAqB,YAAW,EAAG,OAAS,EAAG,CACnG,IAAIE,EAAa1B,EAAYuB,EAAsBC,EAAsBU,EAAkB,EAAI,EAAE,QAE7FE,IACHV,EAAaD,EAAuBC,CAAU,GAG/CK,EAAc,CAAA,EACd,QAASl2C,EAAI,EAAG2N,EAASkoC,EAAW,OAAQ71C,EAAI2N,EAAQ3N,IACvDk2C,EAAY,KAAKlB,EAAW,qBAAqBa,EAAW71C,CAAC,EAAG01C,EAAsBC,CAAoB,CAAC,CAE7G,CACD,CAEA,OAAO,IAAIM,EAAWhB,EAAyBE,EAAuBE,EAAyBE,EAAuBW,CAAW,CAClI,EAWD,MAAajC,CAAY,CAaxB,YAAYtG,EAAyBC,EAAyBlsC,EAAuB,CACpF,KAAK,yBAA2BA,EAAK,yBACrC,KAAK,6BAA+BA,EAAK,6BACzC,KAAK,2BAA6BA,EAAK,2BACvC,KAAK,qBAAuBA,EAAK,qBACjC,KAAK,cAAgBisC,EACrB,KAAK,cAAgBC,EACrB,KAAK,SAAW,IAAInE,EAAakE,CAAa,EAC9C,KAAK,SAAW,IAAIlE,EAAamE,CAAa,EAE9C,KAAK,iBAAmB4I,EAAkC90C,EAAK,kBAAkB,EACjF,KAAK,iBAAmB80C,EAAkC90C,EAAK,qBAAuB,EAAI,EAAI,KAAK,IAAIA,EAAK,mBAAoB,GAAI,CAAC,CACtI,CAEO,aAAW,CAEjB,GAAI,KAAK,SAAS,MAAM,SAAW,GAAK,KAAK,SAAS,MAAM,CAAC,EAAE,SAAW,EAEzE,OAAI,KAAK,SAAS,MAAM,SAAW,GAAK,KAAK,SAAS,MAAM,CAAC,EAAE,SAAW,EAClE,CACN,UAAW,GACX,QAAS,CAAA,GAIJ,CACN,UAAW,GACX,QAAS,CAAC,CACT,wBAAyB,EACzB,sBAAuB,EACvB,wBAAyB,EACzB,sBAAuB,KAAK,SAAS,MAAM,OAC3C,YAAa,OACb,GAIH,GAAI,KAAK,SAAS,MAAM,SAAW,GAAK,KAAK,SAAS,MAAM,CAAC,EAAE,SAAW,EAEzE,MAAO,CACN,UAAW,GACX,QAAS,CAAC,CACT,wBAAyB,EACzB,sBAAuB,KAAK,SAAS,MAAM,OAC3C,wBAAyB,EACzB,sBAAuB,EACvB,YAAa,OACb,GAIH,MAAM2xC,EAAac,EAAY,KAAK,SAAU,KAAK,SAAU,KAAK,iBAAkB,KAAK,oBAAoB,EACvG0B,EAAaxC,EAAW,QACxBoD,EAAYpD,EAAW,UAK7B,GAAI,KAAK,2BAA4B,CACpC,MAAMqD,EAA4B,CAAA,EAClC,QAAS12C,EAAI,EAAG2N,EAASkoC,EAAW,OAAQ71C,EAAI2N,EAAQ3N,IACvD02C,EAAY,KAAKT,EAAW,qBAAqB,KAAK,2BAA4BJ,EAAW71C,CAAC,EAAG,KAAK,SAAU,KAAK,SAAU,KAAK,iBAAkB,KAAK,yBAA0B,KAAK,4BAA4B,CAAC,EAExN,MAAO,CACN,UAAWy2C,EACX,QAASC,EAEX,CAIA,MAAMh5C,EAAuB,CAAA,EAE7B,IAAIi5C,EAAoB,EACpBC,EAAoB,EACxB,QAAS52C,EAAI,GAAerC,EAAMk4C,EAAW,OAAQ71C,EAAIrC,EAAKqC,IAAK,CAClE,MAAM62C,EAAc72C,EAAI,EAAIrC,EAAMk4C,EAAW71C,EAAI,CAAC,EAAI,KAChD81B,EAAgB+gB,EAAaA,EAAW,cAAgB,KAAK,cAAc,OAC3E9gB,EAAgB8gB,EAAaA,EAAW,cAAgB,KAAK,cAAc,OAEjF,KAAOF,EAAoB7gB,GAAgB8gB,EAAoB7gB,GAAc,CAC5E,MAAM+gB,EAAe,KAAK,cAAcH,CAAiB,EACnDI,EAAe,KAAK,cAAcH,CAAiB,EAEzD,GAAIE,IAAiBC,EAAc,CAIlC,CACC,IAAI7B,EAAsBX,EAAuBuC,EAAc,CAAC,EAC5DxB,EAAsBf,EAAuBwC,EAAc,CAAC,EAChE,KAAO7B,EAAsB,GAAKI,EAAsB,GAAG,CAC1D,MAAM0B,EAAeF,EAAa,WAAW5B,EAAsB,CAAC,EAC9D+B,EAAeF,EAAa,WAAWzB,EAAsB,CAAC,EACpE,GAAI0B,IAAiBC,EACpB,MAED/B,IACAI,GACD,EAEIJ,EAAsB,GAAKI,EAAsB,IACpD,KAAK,8BAA8B53C,EAClCi5C,EAAoB,EAAG,EAAGzB,EAC1B0B,EAAoB,EAAG,EAAGtB,CAAmB,CAGhD,CAGA,CACC,IAAIF,EAAoBZ,EAAsBsC,EAAc,CAAC,EACzDtB,EAAoBhB,EAAsBuC,EAAc,CAAC,EAC7D,MAAMG,EAAoBJ,EAAa,OAAS,EAC1CK,EAAoBJ,EAAa,OAAS,EAChD,KAAO3B,EAAoB8B,GAAqB1B,EAAoB2B,GAAmB,CACtF,MAAMH,EAAeF,EAAa,WAAW1B,EAAoB,CAAC,EAC5D6B,EAAeH,EAAa,WAAWtB,EAAoB,CAAC,EAClE,GAAIwB,IAAiBC,EACpB,MAED7B,IACAI,GACD,EAEIJ,EAAoB8B,GAAqB1B,EAAoB2B,IAChE,KAAK,8BAA8Bz5C,EAClCi5C,EAAoB,EAAGvB,EAAmB8B,EAC1CN,EAAoB,EAAGpB,EAAmB2B,CAAiB,CAG9D,CACD,CACAR,IACAC,GACD,CAEIC,IAEHn5C,EAAO,KAAKu4C,EAAW,qBAAqB,KAAK,2BAA4BY,EAAY,KAAK,SAAU,KAAK,SAAU,KAAK,iBAAkB,KAAK,yBAA0B,KAAK,4BAA4B,CAAC,EAE/MF,GAAqBE,EAAW,eAChCD,GAAqBC,EAAW,eAElC,CAEA,MAAO,CACN,UAAWJ,EACX,QAAS/4C,EAEX,CAEQ,8BACPA,EACA05C,EAA4BlC,EAA6BE,EACzDiC,EAA4B/B,EAA6BE,EAAyB,CAElF,GAAI,KAAK,+BAA+B93C,EAAQ05C,EAAoBlC,EAAqBE,EAAmBiC,EAAoB/B,EAAqBE,CAAiB,EAErK,OAGD,IAAIU,EACA,KAAK,2BACRA,EAAc,CAAC,IAAIlB,EAClBoC,EAAoBlC,EAAqBkC,EAAoBhC,EAC7DiC,EAAoB/B,EAAqB+B,EAAoB7B,CAAiB,CAC9E,GAEF93C,EAAO,KAAK,IAAIu4C,EACfmB,EAAoBA,EACpBC,EAAoBA,EACpBnB,CAAW,CACX,CACF,CAEQ,+BACPx4C,EACA05C,EAA4BlC,EAA6BE,EACzDiC,EAA4B/B,EAA6BE,EAAyB,CAElF,MAAM73C,EAAMD,EAAO,OACnB,GAAIC,IAAQ,EACX,MAAO,GAGR,MAAMy4B,EAAa14B,EAAOC,EAAM,CAAC,EAEjC,OAAIy4B,EAAW,wBAA0B,GAAKA,EAAW,wBAA0B,EAE3E,GAGJA,EAAW,wBAA0BghB,GAAsBhhB,EAAW,wBAA0BihB,GAC/F,KAAK,0BAA4BjhB,EAAW,aAC/CA,EAAW,YAAY,KAAK,IAAI4e,EAC/BoC,EAAoBlC,EAAqBkC,EAAoBhC,EAC7DiC,EAAoB/B,EAAqB+B,EAAoB7B,CAAiB,CAC9E,EAEK,IAGJpf,EAAW,sBAAwB,IAAMghB,GAAsBhhB,EAAW,sBAAwB,IAAMihB,GAC3GjhB,EAAW,sBAAwBghB,EACnChhB,EAAW,sBAAwBihB,EAC/B,KAAK,0BAA4BjhB,EAAW,aAC/CA,EAAW,YAAY,KAAK,IAAI4e,EAC/BoC,EAAoBlC,EAAqBkC,EAAoBhC,EAC7DiC,EAAoB/B,EAAqB+B,EAAoB7B,CAAiB,CAC9E,EAEK,IAGD,EACR,EArODnqC,EAAA,aAAA4oC,EAwOA,SAASM,EAAuB+C,EAAahc,EAAoB,CAChE,MAAMh2B,EAAI0rB,EAAQ,wBAAwBsmB,CAAG,EAC7C,OAAIhyC,IAAM,GACFg2B,EAEDh2B,EAAI,CACZ,CAEA,SAASkvC,EAAsB8C,EAAahc,EAAoB,CAC/D,MAAMh2B,EAAI0rB,EAAQ,uBAAuBsmB,CAAG,EAC5C,OAAIhyC,IAAM,GACFg2B,EAEDh2B,EAAI,CACZ,CAEA,SAASkxC,EAAkCe,EAAsB,CAChE,GAAIA,IAAmB,EACtB,MAAO,IAAM,GAGd,MAAMC,EAAY,KAAK,IAAG,EAC1B,MAAO,IACC,KAAK,IAAG,EAAKA,EAAYD,CAElC,uICzpBalsC,EAAA,mBAAqB,CACjC,UAAW,IAAM,IAAIosC,EAAA,wBACrB,WAAY,IAAM,IAAIC,EAAA,8HCmIvBrsC,EAAA,6BAAAssC,EA/HA,SAASC,EAAoBC,EAAuC,CACnE,MAAMr3B,EAAS,CAAA,EACf,UAAWs3B,KAAgBD,EAAe,CACzC,MAAME,EAAe,OAAOD,CAAY,GACpCC,GAAgBA,IAAiB,GAAKD,EAAa,QAAQ,MAAO,EAAE,IAAM,KAC7Et3B,EAAO,KAAKu3B,CAAY,CAE1B,CACA,OAAOv3B,CACR,CAEA,SAASw3B,EAAU1yC,EAAWoO,EAAWtT,EAAWD,EAAS,CAC5D,MAAO,CACN,IAAKmF,EAAI,IACT,KAAMlF,EAAI,IACV,MAAOsT,EAAI,IACX,MAAOvT,EAET,CAEA,SAAS83C,EAAWC,EAAqCrxB,EAAuB,CAC/E,MAAMrZ,EAAQqZ,EAAM,MACdlZ,EAASkZ,EAAM,CAAC,EAAE,OACxB,GAAI,CAACrZ,EACJ,OAED,MAAM0yB,EAAgBgY,EAAM,WAAW1qC,CAAK,EAO5C,MANsB,CACrB,gBAAiB0yB,EAAc,WAC/B,YAAaA,EAAc,OAC3B,cAAeA,EAAc,WAC7B,UAAWA,EAAc,OAASvyB,EAGpC,CAEA,SAASwqC,EAAyB5rC,EAA2B6rC,EAAgB,CAC5E,GAAI,CAAC7rC,EACJ,OAED,MAAM8rC,EAAiBC,EAAA,MAAM,OAAO,IAAI,SAASF,CAAQ,EACzD,GAAKC,EAGL,MAAO,CACN,MAAO9rC,EACP,MAAOyrC,EAAUK,EAAe,KAAK,EAAGA,EAAe,KAAK,EAAGA,EAAe,KAAK,EAAGA,EAAe,KAAK,CAAC,EAE7G,CAEA,SAASE,EAAyBhsC,EAA2BisC,EAA6BC,EAAgB,CACzG,GAAI,CAAClsC,GAASisC,EAAQ,SAAW,EAChC,OAGD,MAAMX,EADQW,EAAQ,CAAC,EACK,OAAM,EAC5BE,EAAcd,EAAoBC,CAAa,EACrD,MAAO,CACN,MAAOtrC,EACP,MAAOyrC,EAAUU,EAAY,CAAC,EAAGA,EAAY,CAAC,EAAGA,EAAY,CAAC,EAAGD,EAAUC,EAAY,CAAC,EAAI,CAAC,EAE/F,CAEA,SAASC,EAAyBpsC,EAA2BisC,EAA6BC,EAAgB,CACzG,GAAI,CAAClsC,GAASisC,EAAQ,SAAW,EAChC,OAGD,MAAMX,EADQW,EAAQ,CAAC,EACK,OAAM,EAC5BE,EAAcd,EAAoBC,CAAa,EAC/Ce,EAAkB,IAAIN,EAAA,MAAM,IAAIA,EAAA,KAAKI,EAAY,CAAC,EAAGA,EAAY,CAAC,EAAI,IAAKA,EAAY,CAAC,EAAI,IAAKD,EAAUC,EAAY,CAAC,EAAI,CAAC,CAAC,EACpI,MAAO,CACN,MAAOnsC,EACP,MAAOyrC,EAAUY,EAAgB,KAAK,EAAGA,EAAgB,KAAK,EAAGA,EAAgB,KAAK,EAAGA,EAAgB,KAAK,CAAC,EAEjH,CAEA,SAASC,EAAaX,EAA8CY,EAAa,CAChF,OAAI,OAAOZ,GAAU,SACb,CAAC,GAAGA,EAAM,SAASY,CAAK,CAAC,EAEzBZ,EAAM,YAAYY,CAAK,CAEhC,CAEA,SAASC,EAAcb,EAAmC,CACzD,MAAMx6C,EAA8B,CAAA,EAG9Bs7C,EAA2BH,EAAaX,EADf,mIAC4C,EAG3E,GAAIc,EAAyB,OAAS,EACrC,UAAWC,KAAgBD,EAA0B,CACpD,MAAME,EAAuBD,EAAa,OAAOnB,GAAgBA,IAAiB,MAAS,EACrFqB,EAAcD,EAAqB,CAAC,EACpCE,EAAkBF,EAAqB,CAAC,EAC9C,GAAI,CAACE,EACJ,SAED,IAAIC,EACJ,GAAIF,IAAgB,MAAO,CAC1B,MAAMG,EAAkB,+KACxBD,EAAmBd,EAAyBN,EAAWC,EAAOe,CAAY,EAAGJ,EAAaO,EAAiBE,CAAe,EAAG,EAAK,CACnI,SAAWH,IAAgB,OAAQ,CAClC,MAAMG,EAAkB,yNACxBD,EAAmBd,EAAyBN,EAAWC,EAAOe,CAAY,EAAGJ,EAAaO,EAAiBE,CAAe,EAAG,EAAI,CAClI,SAAWH,IAAgB,MAAO,CACjC,MAAMG,EAAkB,qIACxBD,EAAmBV,EAAyBV,EAAWC,EAAOe,CAAY,EAAGJ,EAAaO,EAAiBE,CAAe,EAAG,EAAK,CACnI,SAAWH,IAAgB,OAAQ,CAClC,MAAMG,EAAkB,+KACxBD,EAAmBV,EAAyBV,EAAWC,EAAOe,CAAY,EAAGJ,EAAaO,EAAiBE,CAAe,EAAG,EAAI,CAClI,MAAWH,IAAgB,MAC1BE,EAAmBlB,EAAyBF,EAAWC,EAAOe,CAAY,EAAGE,EAAcC,CAAe,GAEvGC,GACH37C,EAAO,KAAK27C,CAAgB,CAE9B,CAED,OAAO37C,CACR,CAKA,SAAgBi6C,EAA6BO,EAAmC,CAC/E,MAAI,CAACA,GAAS,OAAOA,EAAM,UAAa,YAAc,OAAOA,EAAM,YAAe,WAE1E,CAAA,EAEDa,EAAcb,CAAK,CAC3B,2ICwMA7sC,EAAA,aAAAkuC,EA1TA,MAAMC,CAAW,CAMhB,YAAYC,EAAcC,EAAcpe,EAAoB,CAC3D,MAAMp4B,EAAO,IAAI,WAAWu2C,EAAOC,CAAI,EACvC,QAAS15C,EAAI,EAAGrC,EAAM87C,EAAOC,EAAM15C,EAAIrC,EAAKqC,IAC3CkD,EAAKlD,CAAC,EAAIs7B,EAGX,KAAK,MAAQp4B,EACb,KAAK,KAAOu2C,EACZ,KAAK,KAAOC,CACb,CAEO,IAAIC,EAAa7E,EAAW,CAClC,OAAO,KAAK,MAAM6E,EAAM,KAAK,KAAO7E,CAAG,CACxC,CAEO,IAAI6E,EAAa7E,EAAa71C,EAAa,CACjD,KAAK,MAAM06C,EAAM,KAAK,KAAO7E,CAAG,EAAI71C,CACrC,EAGD,MAAa26C,CAAY,CAKxB,YAAYC,EAAa,CACxB,IAAIC,EAAc,EACdC,EAAQ,EACZ,QAAS/5C,EAAI,EAAGrC,EAAMk8C,EAAM,OAAQ75C,EAAIrC,EAAKqC,IAAK,CACjD,KAAM,CAACC,EAAM2rB,EAAQ1rB,CAAE,EAAI25C,EAAM75C,CAAC,EAC9B4rB,EAASkuB,IACZA,EAAcluB,GAEX3rB,EAAO85C,IACVA,EAAW95C,GAERC,EAAK65C,IACRA,EAAW75C,EAEb,CAEA45C,IACAC,IAEA,MAAMC,EAAS,IAAIR,EAAYO,EAAUD,EAAW,CAAA,EACpD,QAAS95C,EAAI,EAAGrC,EAAMk8C,EAAM,OAAQ75C,EAAIrC,EAAKqC,IAAK,CACjD,KAAM,CAACC,EAAM2rB,EAAQ1rB,CAAE,EAAI25C,EAAM75C,CAAC,EAClCg6C,EAAO,IAAI/5C,EAAM2rB,EAAQ1rB,CAAE,CAC5B,CAEA,KAAK,QAAU85C,EACf,KAAK,aAAeF,CACrB,CAEO,UAAUG,EAAqBruB,EAAc,CACnD,OAAIA,EAAS,GAAKA,GAAU,KAAK,aAChC,EAEM,KAAK,QAAQ,IAAIquB,EAAcruB,CAAM,CAC7C,EAvCDvgB,EAAA,aAAAuuC,EA2CA,IAAIM,EAAqC,KACzC,SAASC,GAAe,CACvB,OAAID,IAAkB,OACrBA,EAAgB,IAAIN,EAAa,CAChC,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EACA,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EAEA,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EAEA,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EAEA,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EAEA,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EACA,CAAA,EAAA,GAAA,EAAA,EAEA,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EAEA,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EAEA,CAAA,EAAA,IAAA,CAAA,EACA,CAAA,EAAA,GAAA,CAAA,EAEA,CAAA,EAAA,GAAA,EAAA,EAEA,CAAA,GAAA,GAAA,EAAA,EAEA,CAAA,GAAA,GAAA,EAAA,EACA,GAEKM,CACR,CASA,IAAIE,EAA0D,KAC9D,SAASC,GAAa,CACrB,GAAID,IAAgB,KAAM,CACzBA,EAAc,IAAIvY,EAAA,oBAAmB,CAAA,EAGrC,MAAMyY,EAA+B,uLACrC,QAASt6C,EAAI,EAAGA,EAAIs6C,EAA6B,OAAQt6C,IACxDo6C,EAAY,IAAIE,EAA6B,WAAWt6C,CAAC,EAAC,CAAA,EAG3D,MAAMu6C,EAA6B,OACnC,QAASv6C,EAAI,EAAGA,EAAIu6C,EAA2B,OAAQv6C,IACtDo6C,EAAY,IAAIG,EAA2B,WAAWv6C,CAAC,EAAC,CAAA,CAE1D,CACA,OAAOo6C,CACR,CAEA,MAAaI,CAAY,CAEhB,OAAO,YAAYC,EAAiDza,EAAc9D,EAAoBwe,EAAwBC,EAAoB,CAEzJ,IAAIC,EAAwBD,EAAe,EAC3C,EAAG,CACF,MAAM/uB,EAASoU,EAAK,WAAW4a,CAAqB,EAEpD,GADgBH,EAAW,IAAI7uB,CAAM,IAC1B,EACV,MAEDgvB,GACD,OAASA,EAAwBF,GAGjC,GAAIA,EAAiB,EAAG,CACvB,MAAMG,EAAqB7a,EAAK,WAAW0a,EAAiB,CAAC,EACvDI,EAAqB9a,EAAK,WAAW4a,CAAqB,GAG9DC,IAAkB,IAA2BC,IAAkB,IAC5DD,IAAkB,IAAmCC,IAAkB,IACvED,IAAkB,KAAgCC,IAAkB,MAKxEF,GAEF,CAEA,MAAO,CACN,MAAO,CACN,gBAAiB1e,EACjB,YAAawe,EAAiB,EAC9B,cAAexe,EACf,UAAW0e,EAAwB,GAEpC,IAAK5a,EAAK,UAAU0a,EAAgBE,EAAwB,CAAC,EAE/D,CAEO,OAAO,aAAa1C,EAA4B6C,EAA6BZ,EAAe,EAAE,CACpG,MAAMM,EAAaJ,EAAa,EAE1B38C,EAAkB,CAAA,EACxB,QAASsC,EAAI,EAAG69B,EAAYqa,EAAM,aAAY,EAAIl4C,GAAK69B,EAAW79B,IAAK,CACtE,MAAMggC,EAAOkY,EAAM,eAAel4C,CAAC,EAC7BrC,EAAMqiC,EAAK,OAEjB,IAAIz/B,EAAI,EACJm6C,EAAiB,EACjBM,EAAkB,EAClBp7B,EAAK,EACLq7B,EAAgB,GAChBC,EAAuB,GACvBC,EAAmB,GACnBC,EAAsB,GAE1B,KAAO76C,EAAI5C,GAAK,CAEf,IAAI09C,EAAoB,GACxB,MAAMzvB,EAASoU,EAAK,WAAWz/B,CAAC,EAEhC,GAAIqf,IAAK,GAAmB,CAC3B,IAAI07B,EACJ,OAAQ1vB,EAAQ,CACf,IAAA,IACCqvB,EAAgB,GAChBK,EAAO,EACP,MACD,IAAA,IACCA,EAAWL,EAAe,EAAsB,EAChD,MACD,IAAA,IACCE,EAAmB,GACnBD,EAAuB,GACvBI,EAAO,EACP,MACD,IAAA,IACCH,EAAmB,GACnBG,EAAWJ,EAAsB,EAAsB,EACvD,MACD,IAAA,KACCE,EAAsB,GACtBE,EAAO,EACP,MACD,IAAA,KACCA,EAAWF,EAAqB,EAAsB,EACtD,MAID,IAAA,IACA,IAAA,IACA,IAAA,IACKJ,IAAoBpvB,EACvB0vB,EAAO,EACGN,IAAe,IAA6BA,IAAe,IAA6BA,IAAe,GACjHM,EAAO,EAEPA,EAAO,EAER,MACD,IAAA,IAECA,EAAWN,IAAe,GAAyB,EAAkC,EACrF,MACD,IAAA,KAECM,EAAWN,IAAe,IAAqB,EAAkC,EACjF,MACD,IAAA,IAECM,EAAWH,EAAkB,EAAsB,EACnD,MACD,QACCG,EAAUb,EAAW,IAAI7uB,CAAM,CACjC,CAGI0vB,IAAO,IACV59C,EAAO,KAAK88C,EAAa,YAAYC,EAAYza,EAAMhgC,EAAG06C,EAAgBn6C,CAAC,CAAC,EAC5E86C,EAAoB,GAEtB,SAAWz7B,IAAK,GAAgB,CAE/B,IAAI07B,EACA1vB,IAAM,IAETsvB,EAAuB,GACvBI,EAAO,GAEPA,EAAUb,EAAW,IAAI7uB,CAAM,EAI5B0vB,IAAO,EACVD,EAAoB,GAEpBz7B,EAAK,EAEP,MACCA,EAAQm7B,EAAa,UAAUn7B,EAAOgM,CAAM,EACxChM,IAAK,IACRy7B,EAAoB,IAIlBA,IACHz7B,EAAK,EACLq7B,EAAgB,GAChBC,EAAuB,GACvBE,EAAsB,GAGtBV,EAAiBn6C,EAAI,EACrBy6C,EAAkBpvB,GAGnBrrB,GACD,CAEIqf,IAAK,IACRliB,EAAO,KAAK88C,EAAa,YAAYC,EAAYza,EAAMhgC,EAAG06C,EAAgB/8C,CAAG,CAAC,CAGhF,CAEA,OAAOD,CACR,EA1KD2N,EAAA,aAAAmvC,EAkLA,SAAgBjB,EAAarB,EAAiC,CAC7D,MAAI,CAACA,GAAS,OAAOA,EAAM,cAAiB,YAAc,OAAOA,EAAM,gBAAmB,WAElF,CAAA,EAEDsC,EAAa,aAAatC,CAAK,CACvC,8HC1VA,MAAaqD,CAAmB,CAAhC,aAAA,CA0DkB,KAAA,iBAA+B,CAC/C,CAAC,OAAQ,OAAO,EAChB,CAAC,OAAQ,OAAO,EAChB,CAAC,UAAW,SAAU,SAAU,WAAY,UAAW,YAAa,WAAW,EAC/E,CAAC,SAAU,YAAa,SAAS,EA4BnC,QAxFwB,KAAA,SAAW,IAAIA,CAAsB,CAErD,iBAAiBC,EAAgBC,EAAeC,EAAgBC,EAAsBC,EAAW,CAEvG,GAAIJ,GAAUC,EAAO,CACpB,MAAM/9C,EAAS,KAAK,mBAAmB+9C,EAAOG,CAAE,EAChD,GAAIl+C,EACH,MAAO,CACN,MAAO89C,EACP,MAAO99C,EAGV,CAEA,GAAIg+C,GAAUC,EAAO,CACpB,MAAMj+C,EAAS,KAAK,mBAAmBi+C,EAAOC,CAAE,EAChD,GAAIl+C,EACH,MAAO,CACN,MAAOg+C,EACP,MAAOh+C,EAGV,CAEA,OAAO,IACR,CAEQ,mBAAmByE,EAAcy5C,EAAW,CACnD,MAAMC,EAAe,KAAK,cAAc15C,EAAMy5C,CAAE,EAChD,OAAIC,IAAiB,KACbA,EAED,KAAK,YAAY15C,EAAMy5C,CAAE,CACjC,CAEQ,cAAc38C,EAAe28C,EAAW,CAC/C,MAAME,EAAY,KAAK,IAAI,GAAI78C,EAAM,QAAUA,EAAM,YAAY,GAAG,EAAI,EAAE,EAC1E,IAAI88C,EAAK,OAAO98C,CAAK,EACrB,MAAM+8C,EAAK,WAAW/8C,CAAK,EAE3B,MAAI,CAAC,MAAM88C,CAAE,GAAK,CAAC,MAAMC,CAAE,GAAKD,IAAOC,EAElCD,IAAO,GAAK,CAACH,EACT,MAIPG,EAAK,KAAK,MAAMA,EAAKD,CAAS,EAC9BC,GAAMH,EAAKE,EAAY,CAACA,EACjB,OAAOC,EAAKD,CAAS,GAIvB,IACR,CASQ,YAAY78C,EAAe28C,EAAW,CAC7C,OAAO,KAAK,iBAAiB,KAAK,iBAAkB38C,EAAO28C,CAAE,CAC9D,CAEQ,iBAAiBK,EAAuBh9C,EAAe28C,EAAW,CACzE,IAAIl+C,EAAwB,KAC5B,QAASsC,EAAI,EAAGrC,EAAMs+C,EAAU,OAAQv+C,IAAW,MAAQsC,EAAIrC,EAAKqC,IACnEtC,EAAS,KAAK,gBAAgBu+C,EAAUj8C,CAAC,EAAGf,EAAO28C,CAAE,EAEtD,OAAOl+C,CACR,CAEQ,gBAAgBw+C,EAAoBj9C,EAAe28C,EAAW,CACrE,IAAItpC,EAAM4pC,EAAS,QAAQj9C,CAAK,EAChC,OAAIqT,GAAO,GACVA,GAAOspC,EAAK,EAAK,GACbtpC,EAAM,EACTA,EAAM4pC,EAAS,OAAS,EAExB5pC,GAAO4pC,EAAS,OAEVA,EAAS5pC,CAAG,GAEb,IACR,EAzFDjH,EAAA,oBAAAkwC,kRC0nBAlwC,EAAA,gBAAA8wC,EAyzBA9wC,EAAA,uBAAA+wC,EA95CA,IAAYC,GAAZ,SAAYA,EAAiB,CAC5BA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GALYA,IAAiBhxC,EAAA,kBAAjBgxC,EAAiB,CAAA,EAAA,EAU7B,IAAYC,GAAZ,SAAYA,EAAe,CAC1BA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,OACD,GAJYA,IAAejxC,EAAA,gBAAfixC,EAAe,CAAA,EAAA,EAgR3B,IAAYC,GAAZ,SAAYA,EAAuB,CAClCA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GALYA,IAAuBlxC,EAAA,wBAAvBkxC,EAAuB,CAAA,EAAA,EAqMnC,MAAaC,CAAwB,CAWpC,IAAW,oBAAkB,CAC5B,OAAO,KAAK,qBAAuB,UAAY,KAAK,UACrD,CAKA,YAAYC,EAOX,CAxBD,KAAA,+BAAuC,OAyBtC,KAAK,QAAU,KAAK,IAAI,EAAGA,EAAI,QAAU,CAAC,EACtCA,EAAI,aAAe,WACtB,KAAK,WAAa,KAAK,QACvB,KAAK,qBAAuB,KAE5B,KAAK,WAAa,KAAK,IAAI,EAAGA,EAAI,WAAa,CAAC,EAChD,KAAK,qBAAuB,IAE7B,KAAK,aAAe,EAAQA,EAAI,aAChC,KAAK,WAAaA,EAAI,WAAa,EACnC,KAAK,mBAAqB,EAAQA,EAAI,mBACtC,KAAK,+BAAiCA,EAAI,8BAC3C,CAKO,OAAOnvC,EAA+B,CAC5C,OACC,KAAK,UAAYA,EAAM,SACpB,KAAK,uBAAyBA,EAAM,sBACpC,KAAK,aAAeA,EAAM,YAC1B,KAAK,eAAiBA,EAAM,cAC5B,KAAK,aAAeA,EAAM,YAC1B,KAAK,qBAAuBA,EAAM,uBAClCovC,EAAA,QAAO,KAAK,+BAAgCpvC,EAAM,8BAA8B,CAErF,CAKO,kBAAkBqvC,EAAiC,CACzD,MAAO,CACN,QAAS,KAAK,UAAYA,EAAQ,QAClC,WAAY,KAAK,aAAeA,EAAQ,WACxC,aAAc,KAAK,eAAiBA,EAAQ,aAC5C,mBAAoB,KAAK,qBAAuBA,EAAQ,mBAE1D,EAjEDtxC,EAAA,yBAAAmxC,EAgGA,MAAaI,CAAS,CASrB,YAAYrwC,EAAcisC,EAAwB,CARlD,KAAA,gBAAwB,OASvB,KAAK,MAAQjsC,EACb,KAAK,QAAUisC,CAChB,EAZDntC,EAAA,UAAAuxC,EAsCA,SAAgBT,EAAgBt9C,EAAQ,CACvC,OAAQA,GAAO,OAAOA,EAAI,MAAS,UACpC,CAmtBA,MAAag+C,CAA2B,CACvC,YACiBC,EACAvwC,EACApK,EACA46C,EACAC,EACAC,EAAmB,CALnB,KAAA,WAAAH,EACA,KAAA,MAAAvwC,EACA,KAAA,KAAApK,EACA,KAAA,iBAAA46C,EACA,KAAA,qBAAAC,EACA,KAAA,WAAAC,CACb,EARL5xC,EAAA,4BAAAwxC,EA8CA,MAAaK,CAAU,CAetB,YAAYpE,EAAehX,EAAgDqb,EAA2B,CACrG,KAAK,MAAQrE,EACb,KAAK,eAAiBhX,EACtB,KAAK,aAAeqb,CACrB,EAnBD9xC,EAAA,WAAA6xC,EAiCA,MAAaE,CAAgB,CAE5B,YACiBC,EACA7pB,EACA8pB,EAA8C,CAF9C,KAAA,aAAAD,EACA,KAAA,QAAA7pB,EACA,KAAA,8BAAA8pB,CACb,EANLjyC,EAAA,iBAAA+xC,EAqBA,SAAgBhB,EAAuBlE,EAAiB,CACvD,MACC,CAACA,EAAM,qBAAoB,GAAM,CAACA,EAAM,iBAE1C,8LCv7CA,MAAaqF,CAAiB,CAiB7B,YAAY/8B,EAAmB,CAC9B,KAAK,OAASA,EACd,KAAK,UAAY,IAAI,YAAYA,EAAO,MAAM,EAC9C,KAAK,oBAAsB,IAAI,WAAW,CAAC,EAC3C,KAAK,oBAAoB,CAAC,EAAI,EAC/B,CAEO,aAAarR,EAAqBquC,EAAyB,CACjEruC,KAAcosB,EAAA,UAASpsB,CAAW,EAClC,MAAMsuC,EAAY,KAAK,OACjBC,EAAe,KAAK,UACpBC,EAAkBH,EAAa,OAErC,OAAIG,IAAoB,EAChB,IAGR,KAAK,OAAS,IAAI,YAAYF,EAAU,OAASE,CAAe,EAChE,KAAK,OAAO,IAAIF,EAAU,SAAS,EAAGtuC,CAAW,EAAG,CAAC,EACrD,KAAK,OAAO,IAAIsuC,EAAU,SAAStuC,CAAW,EAAGA,EAAcwuC,CAAe,EAC9E,KAAK,OAAO,IAAIH,EAAcruC,CAAW,EAErCA,EAAc,EAAI,KAAK,oBAAoB,CAAC,IAC/C,KAAK,oBAAoB,CAAC,EAAIA,EAAc,GAG7C,KAAK,UAAY,IAAI,YAAY,KAAK,OAAO,MAAM,EAC/C,KAAK,oBAAoB,CAAC,GAAK,GAClC,KAAK,UAAU,IAAIuuC,EAAa,SAAS,EAAG,KAAK,oBAAoB,CAAC,EAAI,CAAC,CAAC,EAEtE,GACR,CAEO,SAASlwC,EAAevO,EAAa,CAI3C,OAHAuO,KAAQ+tB,EAAA,UAAS/tB,CAAK,EACtBvO,KAAQs8B,EAAA,UAASt8B,CAAK,EAElB,KAAK,OAAOuO,CAAK,IAAMvO,EACnB,IAER,KAAK,OAAOuO,CAAK,EAAIvO,EACjBuO,EAAQ,EAAI,KAAK,oBAAoB,CAAC,IACzC,KAAK,oBAAoB,CAAC,EAAIA,EAAQ,GAEhC,GACR,CAEO,aAAaqe,EAAoBhb,EAAa,CACpDgb,KAAa0P,EAAA,UAAS1P,CAAU,EAChChb,KAAQ0qB,EAAA,UAAS1qB,CAAK,EAEtB,MAAM4sC,EAAY,KAAK,OACjBC,EAAe,KAAK,UAE1B,GAAI7xB,GAAc4xB,EAAU,OAC3B,MAAO,GAGR,MAAMG,EAAWH,EAAU,OAAS5xB,EAKpC,OAJIhb,GAAS+sC,IACZ/sC,EAAQ+sC,GAGL/sC,IAAU,EACN,IAGR,KAAK,OAAS,IAAI,YAAY4sC,EAAU,OAAS5sC,CAAK,EACtD,KAAK,OAAO,IAAI4sC,EAAU,SAAS,EAAG5xB,CAAU,EAAG,CAAC,EACpD,KAAK,OAAO,IAAI4xB,EAAU,SAAS5xB,EAAahb,CAAK,EAAGgb,CAAU,EAElE,KAAK,UAAY,IAAI,YAAY,KAAK,OAAO,MAAM,EAC/CA,EAAa,EAAI,KAAK,oBAAoB,CAAC,IAC9C,KAAK,oBAAoB,CAAC,EAAIA,EAAa,GAExC,KAAK,oBAAoB,CAAC,GAAK,GAClC,KAAK,UAAU,IAAI6xB,EAAa,SAAS,EAAG,KAAK,oBAAoB,CAAC,EAAI,CAAC,CAAC,EAEtE,GACR,CAEO,aAAW,CACjB,OAAI,KAAK,OAAO,SAAW,EACnB,EAED,KAAK,cAAc,KAAK,OAAO,OAAS,CAAC,CACjD,CAMO,aAAalwC,EAAa,CAChC,OAAIA,EAAQ,EACJ,GAGRA,KAAQ+tB,EAAA,UAAS/tB,CAAK,EACf,KAAK,cAAcA,CAAK,EAChC,CAEQ,cAAcA,EAAa,CAClC,GAAIA,GAAS,KAAK,oBAAoB,CAAC,EACtC,OAAO,KAAK,UAAUA,CAAK,EAG5B,IAAIqe,EAAa,KAAK,oBAAoB,CAAC,EAAI,EAC3CA,IAAe,IAClB,KAAK,UAAU,CAAC,EAAI,KAAK,OAAO,CAAC,EACjCA,KAGGre,GAAS,KAAK,OAAO,SACxBA,EAAQ,KAAK,OAAO,OAAS,GAG9B,QAASxN,EAAI6rB,EAAY7rB,GAAKwN,EAAOxN,IACpC,KAAK,UAAUA,CAAC,EAAI,KAAK,UAAUA,EAAI,CAAC,EAAI,KAAK,OAAOA,CAAC,EAE1D,YAAK,oBAAoB,CAAC,EAAI,KAAK,IAAI,KAAK,oBAAoB,CAAC,EAAGwN,CAAK,EAClE,KAAK,UAAUA,CAAK,CAC5B,CAEO,WAAWqwC,EAAW,CAC5BA,EAAM,KAAK,MAAMA,CAAG,EAGpB,KAAK,YAAW,EAEhB,IAAIhwC,EAAM,EACNC,EAAO,KAAK,OAAO,OAAS,EAC5BC,EAAM,EACN+vC,EAAU,EACVC,EAAW,EAEf,KAAOlwC,GAAOC,GAMb,GALAC,EAAMF,GAAQC,EAAOD,GAAO,EAAK,EAEjCiwC,EAAU,KAAK,UAAU/vC,CAAG,EAC5BgwC,EAAWD,EAAU,KAAK,OAAO/vC,CAAG,EAEhC8vC,EAAME,EACTjwC,EAAOC,EAAM,UACH8vC,GAAOC,EACjBjwC,EAAME,EAAM,MAEZ,OAIF,OAAO,IAAIiwC,EAAuBjwC,EAAK8vC,EAAME,CAAQ,CACtD,EAxKD1yC,EAAA,kBAAAkyC,EAgLA,MAAaU,CAA6B,CAezC,YAAYz9B,EAAgB,CAC3B,KAAK,QAAUA,EACf,KAAK,SAAW,GAChB,KAAK,eAAiB,GACtB,KAAK,WAAa,CAAA,EAClB,KAAK,YAAc,CAAA,CACpB,CAKO,aAAW,CACjB,YAAK,aAAY,EACV,KAAK,YAAY,MACzB,CAMO,aAAa3P,EAAa,CAEhC,OADA,KAAK,aAAY,EACbA,IAAU,EACN,EAED,KAAK,WAAWA,EAAQ,CAAC,CACjC,CAKO,WAAWgtC,EAAW,CAC5B,KAAK,aAAY,EACjB,MAAMvrC,EAAM,KAAK,YAAYurC,CAAG,EAC1BK,EAAiB5rC,EAAM,EAAI,KAAK,WAAWA,EAAM,CAAC,EAAI,EAC5D,OAAO,IAAI0rC,EAAuB1rC,EAAKurC,EAAMK,CAAc,CAC5D,CAEO,aAAa1uC,EAAeM,EAAmB,CACrD,KAAK,QAAQ,OAAON,EAAOM,CAAW,EACtC,KAAK,YAAYN,CAAK,CACvB,CAEO,aAAaL,EAAqBC,EAAmB,CAC3D,KAAK,WAAUy0B,EAAA,aAAY,KAAK,QAAS10B,EAAaC,CAAS,EAC/D,KAAK,YAAYD,CAAW,CAC7B,CAEQ,YAAY3B,EAAa,CAChC,KAAK,SAAW,GAChB,KAAK,eAAiB,KAAK,IAAI,KAAK,eAAgBA,EAAQ,CAAC,CAC9D,CAEQ,cAAY,CACnB,GAAI,MAAK,SAIT,SAASxN,EAAI,KAAK,eAAiB,EAAGrC,EAAM,KAAK,QAAQ,OAAQqC,EAAIrC,EAAKqC,IAAK,CAC9E,MAAMf,EAAQ,KAAK,QAAQe,CAAC,EACtBm+C,EAAWn+C,EAAI,EAAI,KAAK,WAAWA,EAAI,CAAC,EAAI,EAElD,KAAK,WAAWA,CAAC,EAAIm+C,EAAWl/C,EAChC,QAASsB,EAAI,EAAGA,EAAItB,EAAOsB,IAC1B,KAAK,YAAY49C,EAAW59C,CAAC,EAAIP,CAEnC,CAGA,KAAK,WAAW,OAAS,KAAK,QAAQ,OACtC,KAAK,YAAY,OAAS,KAAK,WAAW,KAAK,WAAW,OAAS,CAAC,EAGpE,KAAK,SAAW,GAChB,KAAK,eAAiB,KAAK,QAAQ,OAAS,EAC7C,CAEO,SAASwN,EAAevO,EAAa,CACvC,KAAK,QAAQuO,CAAK,IAAMvO,IAI5B,KAAK,QAAQuO,CAAK,EAAIvO,EACtB,KAAK,YAAYuO,CAAK,EACvB,EAnGDnC,EAAA,8BAAA4yC,EAuGA,MAAaD,CAAsB,CAGlC,YACiBxwC,EACA4wC,EAAiB,CADjB,KAAA,MAAA5wC,EACA,KAAA,UAAA4wC,EAJjB,KAAA,6BAAqC,OAMpC,KAAK,MAAQ5wC,EACb,KAAK,UAAY4wC,CAClB,EATD/yC,EAAA,uBAAA2yC,uIChQA,MAAaK,CAAe,CAS3B,YAAY5/C,EAAUkrC,EAAiB2U,EAAaC,EAAiB,CACpE,KAAK,KAAO9/C,EACZ,KAAK,OAASkrC,EACd,KAAK,KAAO2U,EACZ,KAAK,WAAaC,EAClB,KAAK,YAAc,KACnB,KAAK,iBAAmB,IACzB,CAEA,SAAO,CACN,KAAK,OAAO,OAAS,CACtB,CAEA,IAAI,SAAO,CACV,OAAO,KAAK,UACb,CAEA,SAAO,CACN,OAAI,KAAK,mBAAqB,OAC7B,KAAK,iBAAmB,KAAK,OAAO,KAAK,KAAK,IAAI,GAE5C,KAAK,gBACb,CAEA,SAAS98C,EAAqB,CACzBA,EAAE,KAAOA,EAAE,MAAQ,KAAK,OAC3B,KAAK,KAAOA,EAAE,IACd,KAAK,YAAc,MAIpB,MAAM+xB,EAAU/xB,EAAE,QAClB,UAAWo0B,KAAUrC,EACpB,KAAK,mBAAmBqC,EAAO,KAAK,EACpC,KAAK,kBAAkB,IAAI+H,EAAA,SAAS/H,EAAO,MAAM,gBAAiBA,EAAO,MAAM,WAAW,EAAGA,EAAO,IAAI,EAGzG,KAAK,WAAap0B,EAAE,UACpB,KAAK,iBAAmB,IACzB,CAEU,mBAAiB,CAC1B,GAAI,CAAC,KAAK,YAAa,CACtB,MAAM+8C,EAAY,KAAK,KAAK,OACtBC,EAAc,KAAK,OAAO,OAC1BC,EAAkB,IAAI,YAAYD,CAAW,EACnD,QAASz+C,EAAI,EAAGA,EAAIy+C,EAAaz+C,IAChC0+C,EAAgB1+C,CAAC,EAAI,KAAK,OAAOA,CAAC,EAAE,OAASw+C,EAE9C,KAAK,YAAc,IAAIG,EAAA,kBAAkBD,CAAe,CACzD,CACD,CAKQ,aAAaE,EAAmB1T,EAAgB,CACvD,KAAK,OAAO0T,CAAS,EAAI1T,EACrB,KAAK,aAER,KAAK,YAAY,SAAS0T,EAAW,KAAK,OAAOA,CAAS,EAAE,OAAS,KAAK,KAAK,MAAM,CAEvF,CAEQ,mBAAmBryC,EAAa,CAEvC,GAAIA,EAAM,kBAAoBA,EAAM,cAAe,CAClD,GAAIA,EAAM,cAAgBA,EAAM,UAE/B,OAGD,KAAK,aAAaA,EAAM,gBAAkB,EACzC,KAAK,OAAOA,EAAM,gBAAkB,CAAC,EAAE,UAAU,EAAGA,EAAM,YAAc,CAAC,EACvE,KAAK,OAAOA,EAAM,gBAAkB,CAAC,EAAE,UAAUA,EAAM,UAAY,CAAC,CAAC,EAExE,MACD,CAGA,KAAK,aAAaA,EAAM,gBAAkB,EACzC,KAAK,OAAOA,EAAM,gBAAkB,CAAC,EAAE,UAAU,EAAGA,EAAM,YAAc,CAAC,EACvE,KAAK,OAAOA,EAAM,cAAgB,CAAC,EAAE,UAAUA,EAAM,UAAY,CAAC,CAAC,EAItE,KAAK,OAAO,OAAOA,EAAM,gBAAiBA,EAAM,cAAgBA,EAAM,eAAe,EACjF,KAAK,aAER,KAAK,YAAY,aAAaA,EAAM,gBAAiBA,EAAM,cAAgBA,EAAM,eAAe,CAElG,CAEQ,kBAAkB2wB,EAAoB2hB,EAAkB,CAC/D,GAAIA,EAAW,SAAW,EAEzB,OAED,MAAMC,KAAcC,EAAA,YAAWF,CAAU,EACzC,GAAIC,EAAY,SAAW,EAAG,CAE7B,KAAK,aAAa5hB,EAAS,WAAa,EACvC,KAAK,OAAOA,EAAS,WAAa,CAAC,EAAE,UAAU,EAAGA,EAAS,OAAS,CAAC,EACnE4hB,EAAY,CAAC,EACb,KAAK,OAAO5hB,EAAS,WAAa,CAAC,EAAE,UAAUA,EAAS,OAAS,CAAC,CAAC,EAEtE,MACD,CAGA4hB,EAAYA,EAAY,OAAS,CAAC,GAAK,KAAK,OAAO5hB,EAAS,WAAa,CAAC,EAAE,UAAUA,EAAS,OAAS,CAAC,EAGzG,KAAK,aAAaA,EAAS,WAAa,EACvC,KAAK,OAAOA,EAAS,WAAa,CAAC,EAAE,UAAU,EAAGA,EAAS,OAAS,CAAC,EACnE4hB,EAAY,CAAC,CAAC,EAIjB,MAAME,EAAa,IAAI,YAAYF,EAAY,OAAS,CAAC,EACzD,QAAS9+C,EAAI,EAAGA,EAAI8+C,EAAY,OAAQ9+C,IACvC,KAAK,OAAO,OAAOk9B,EAAS,WAAal9B,EAAI,EAAG,EAAG8+C,EAAY9+C,CAAC,CAAC,EACjEg/C,EAAWh/C,EAAI,CAAC,EAAI8+C,EAAY9+C,CAAC,EAAE,OAAS,KAAK,KAAK,OAGnD,KAAK,aAER,KAAK,YAAY,aAAak9B,EAAS,WAAY8hB,CAAU,CAE/D,EA1ID3zC,EAAA,gBAAAgzC,0KCqCAhzC,EAAA,uBAAA4zC,EAgCA5zC,EAAA,gBAAA6zC,EAkYA7zC,EAAA,aAAA8zC,EAzdA,MAAMC,EAAmB,IAEzB,MAAaC,CAAY,CAMxB,YAAY/zB,EAAsBC,EAAkB+zB,EAAoBxd,EAA6B,CACpG,KAAK,aAAexW,EACpB,KAAK,QAAUC,EACf,KAAK,UAAY+zB,EACjB,KAAK,eAAiBxd,CACvB,CAEO,oBAAkB,CACxB,GAAI,KAAK,eAAiB,GACzB,OAAO,KAIR,IAAIyd,EACA,KAAK,QACRA,EAAYN,EAAuB,KAAK,YAAY,EAEpDM,EAAa,KAAK,aAAa,QAAQ;CAAI,GAAK,EAGjD,IAAIzG,EAAuB,KAC3B,GAAI,CACHA,EAAQ9nB,EAAQ,aAAa,KAAK,aAAc,KAAK,QAAS,CAC7D,UAAW,KAAK,UAChB,UAAW,GACX,UAAWuuB,EACX,OAAQ,GACR,QAAS,GACT,CACF,MAAc,CACb,OAAO,IACR,CAEA,GAAI,CAACzG,EACJ,OAAO,KAGR,IAAI0G,EAAsB,CAAC,KAAK,SAAW,CAACD,EAC5C,OAAIC,GAAsB,KAAK,aAAa,YAAW,IAAO,KAAK,aAAa,YAAW,IAE1FA,EAAqB,KAAK,WAGpB,IAAIC,EAAA,WAAW3G,EAAO,KAAK,kBAAiB4G,EAAA,yBAAwB,KAAK,eAAgB,CAAA,CAAE,EAAI,KAAMF,EAAqB,KAAK,aAAe,IAAI,CAC1J,EAlDDn0C,EAAA,aAAAg0C,EAqDA,SAAgBJ,EAAuB3zB,EAAoB,CAC1D,GAAI,CAACA,GAAgBA,EAAa,SAAW,EAC5C,MAAO,GAGR,QAAStrB,EAAI,EAAGrC,EAAM2tB,EAAa,OAAQtrB,EAAIrC,EAAKqC,IAAK,CACxD,MAAM4rB,EAASN,EAAa,WAAWtrB,CAAC,EAExC,GAAI4rB,IAAM,GACT,MAAO,GAGR,GAAIA,IAAM,GAAyB,CAKlC,GAFA5rB,IAEIA,GAAKrC,EAER,MAGD,MAAMgiD,EAAar0B,EAAa,WAAWtrB,CAAC,EAC5C,GAAI2/C,IAAU,KAAmBA,IAAU,KAAmBA,IAAU,GACvE,MAAO,EAET,CACD,CAEA,MAAO,EACR,CAEA,SAAgBT,EAAgB3yC,EAAcqzC,EAA6BC,EAAuB,CACjG,GAAI,CAACA,EACJ,OAAO,IAAIJ,EAAA,UAAUlzC,EAAO,IAAI,EAEjC,MAAMisC,EAAoB,CAAA,EAC1B,QAASx4C,EAAI,EAAGrC,EAAMiiD,EAAW,OAAQ5/C,EAAIrC,EAAKqC,IACjDw4C,EAAQx4C,CAAC,EAAI4/C,EAAW5/C,CAAC,EAE1B,OAAO,IAAIy/C,EAAA,UAAUlzC,EAAOisC,CAAO,CACpC,CAEA,MAAMsH,CAAe,CAIpB,YAAY39C,EAAY,CACvB,MAAM49C,EAA6B,CAAA,EACnC,IAAIC,EAAsB,EAC1B,QAAShgD,EAAI,EAAGigD,EAAU99C,EAAK,OAAQnC,EAAIigD,EAASjgD,IAC/CmC,EAAK,WAAWnC,CAAC,IAAC,KACrB+/C,EAAiBC,GAAqB,EAAIhgD,GAG5C,KAAK,kBAAoB+/C,CAC1B,CAEO,8BAA8B30B,EAAc,CAClD,MAAM20B,EAAmB,KAAK,kBAC9B,IAAI/rC,EAAM,EACNpB,EAAMmtC,EAAiB,OAAS,EAOpC,GALIntC,IAAQ,IAKRwY,GAAU20B,EAAiB,CAAC,EAE/B,MAAO,GAGR,KAAO/rC,EAAMpB,GAAK,CACjB,MAAM7E,EAAMiG,IAAQpB,EAAMoB,GAAO,GAAK,GAElC+rC,EAAiBhyC,CAAG,GAAKqd,EAC5BxY,EAAM7E,EAAM,EAERgyC,EAAiBhyC,EAAM,CAAC,GAAKqd,GAEhCpX,EAAMjG,EACN6E,EAAM7E,GAENiG,EAAMjG,EAAM,CAGf,CACA,OAAOiG,EAAM,CACd,EAGD,MAAaksC,CAAe,CAEpB,OAAO,YAAYhI,EAAkBiI,EAA4BC,EAAoBP,EAAyBQ,EAAwB,CAC5I,MAAMC,EAAaH,EAAa,mBAAkB,EAClD,OAAKG,EAIDA,EAAW,MAAM,UACb,KAAK,wBAAwBpI,EAAOkI,EAAa,IAAIG,EAASD,EAAW,eAAgBA,EAAW,KAAK,EAAGT,EAAgBQ,CAAgB,EAE7I,KAAK,yBAAyBnI,EAAOkI,EAAaE,EAAYT,EAAgBQ,CAAgB,EAN7F,CAAA,CAOT,CAMQ,OAAO,wBAAwBnI,EAAkBsI,EAAqBr+C,EAAcs+C,EAAmCrd,EAAoBsd,EAAc,CAChK,IAAIC,EACAC,EAA2B,EAC3BH,GACHG,EAA2BH,EAAU,8BAA8Brd,CAAU,EAC7Eud,EAAcH,EAAcpd,EAAawd,GAEzCD,EAAcH,EAAcpd,EAG7B,IAAIzV,EACJ,GAAI8yB,EAAW,CAEd,MAAMI,EADgCJ,EAAU,8BAA8Brd,EAAasd,EAAO,MAAM,EAC3CE,EAC7DjzB,EAAYgzB,EAAcD,EAAO,OAASG,CAC3C,MACClzB,EAAYgzB,EAAcD,EAAO,OAGlC,MAAMxgB,EAAgBgY,EAAM,cAAcyI,CAAW,EAC/CG,EAAc5I,EAAM,cAAcvqB,CAAS,EACjD,OAAO,IAAIgR,EAAA,MAAMuB,EAAc,WAAYA,EAAc,OAAQ4gB,EAAY,WAAYA,EAAY,MAAM,CAC5G,CAEQ,OAAO,wBAAwB5I,EAAkBkI,EAAoBW,EAAoBlB,EAAyBQ,EAAwB,CACjJ,MAAMG,EAActI,EAAM,YAAYkI,EAAY,iBAAgB,CAAE,EAI9Dj+C,EAAO+1C,EAAM,gBAAgBkI,EAAW,CAAA,EACxCK,EAAavI,EAAM,OAAM,IAAO;EAAS,IAAI4H,EAAgB39C,CAAI,EAAI,KAErEzE,EAAsB,CAAA,EAC5B,IAAIyqC,EAAU,EAEVvhC,EAEJ,IADAm6C,EAAS,MAAM,CAAC,EACRn6C,EAAIm6C,EAAS,KAAK5+C,CAAI,GAE7B,GADAzE,EAAOyqC,GAAS,EAAI+W,EAAgB,KAAK,wBAAwBhH,EAAOsI,EAAar+C,EAAMs+C,EAAW75C,EAAE,MAAOA,EAAE,CAAC,CAAC,EAAGA,EAAGi5C,CAAc,EACnI1X,GAAWkY,EACd,OAAO3iD,EAIT,OAAOA,CACR,CAEQ,OAAO,yBAAyBw6C,EAAkBkI,EAAoBE,EAAwBT,EAAyBQ,EAAwB,CACtJ,MAAM3iD,EAAsB,CAAA,EAC5B,IAAIuJ,EAAY,EAGhB,GAAIm5C,EAAY,kBAAoBA,EAAY,cAAe,CAC9D,MAAMj+C,EAAO+1C,EAAM,eAAekI,EAAY,eAAe,EAAE,UAAUA,EAAY,YAAc,EAAGA,EAAY,UAAY,CAAC,EAC/H,OAAAn5C,EAAY,KAAK,mBAAmBq5C,EAAYn+C,EAAMi+C,EAAY,gBAAiBA,EAAY,YAAc,EAAGn5C,EAAWvJ,EAAQmiD,EAAgBQ,CAAgB,EAC5J3iD,CACR,CAGA,MAAMyE,EAAO+1C,EAAM,eAAekI,EAAY,eAAe,EAAE,UAAUA,EAAY,YAAc,CAAC,EACpGn5C,EAAY,KAAK,mBAAmBq5C,EAAYn+C,EAAMi+C,EAAY,gBAAiBA,EAAY,YAAc,EAAGn5C,EAAWvJ,EAAQmiD,EAAgBQ,CAAgB,EAGnK,QAASnkB,EAAakkB,EAAY,gBAAkB,EAAGlkB,EAAakkB,EAAY,eAAiBn5C,EAAYo5C,EAAkBnkB,IAC9Hj1B,EAAY,KAAK,mBAAmBq5C,EAAYpI,EAAM,eAAehc,CAAU,EAAGA,EAAY,EAAGj1B,EAAWvJ,EAAQmiD,EAAgBQ,CAAgB,EAIrJ,GAAIp5C,EAAYo5C,EAAkB,CACjC,MAAMl+C,EAAO+1C,EAAM,eAAekI,EAAY,aAAa,EAAE,UAAU,EAAGA,EAAY,UAAY,CAAC,EACnGn5C,EAAY,KAAK,mBAAmBq5C,EAAYn+C,EAAMi+C,EAAY,cAAe,EAAGn5C,EAAWvJ,EAAQmiD,EAAgBQ,CAAgB,CACxI,CAEA,OAAO3iD,CACR,CAEQ,OAAO,mBAAmB4iD,EAAwBn+C,EAAc+5B,EAAoBskB,EAAqBv5C,EAAmBvJ,EAAqBmiD,EAAyBQ,EAAwB,CACzM,MAAMve,EAAiBwe,EAAW,eAClC,GAAI,CAACT,GAAkBS,EAAW,aAAc,CAC/C,MAAMh1B,EAAeg1B,EAAW,aAC1BU,EAAkB11B,EAAa,OAC/B+V,EAAal/B,EAAK,OAExB,IAAI8+C,EAAiB,CAACD,EACtB,MAAQC,EAAiB9+C,EAAK,QAAQmpB,EAAc21B,EAAiBD,CAAe,KAAO,IAC1F,IAAI,CAAClf,GAAkBqd,EAAard,EAAgB3/B,EAAMk/B,EAAY4f,EAAgBD,CAAe,KACpGtjD,EAAOuJ,GAAW,EAAI,IAAIw4C,EAAA,UAAU,IAAI9gB,EAAA,MAAMzC,EAAY+kB,EAAiB,EAAIT,EAAatkB,EAAY+kB,EAAiB,EAAID,EAAkBR,CAAW,EAAG,IAAI,EAC7Jv5C,GAAao5C,GAChB,OAAOp5C,EAIV,OAAOA,CACR,CAEA,MAAM85C,EAAW,IAAIR,EAASD,EAAW,eAAgBA,EAAW,KAAK,EACzE,IAAI15C,EAEJm6C,EAAS,MAAM,CAAC,EAChB,EAEC,IADAn6C,EAAIm6C,EAAS,KAAK5+C,CAAI,EAClByE,IACHlJ,EAAOuJ,GAAW,EAAIi4C,EAAgB,IAAIvgB,EAAA,MAAMzC,EAAYt1B,EAAE,MAAQ,EAAI45C,EAAatkB,EAAYt1B,EAAE,MAAQ,EAAIA,EAAE,CAAC,EAAE,OAAS45C,CAAW,EAAG55C,EAAGi5C,CAAc,EAC1J54C,GAAao5C,GAChB,OAAOp5C,QAGDL,GACT,OAAOK,CACR,CAEO,OAAO,cAAcixC,EAAkBiI,EAA4Be,EAAuBrB,EAAuB,CACvH,MAAMS,EAAaH,EAAa,mBAAkB,EAClD,GAAI,CAACG,EACJ,OAAO,KAGR,MAAMS,EAAW,IAAIR,EAASD,EAAW,eAAgBA,EAAW,KAAK,EAEzE,OAAIA,EAAW,MAAM,UACb,KAAK,0BAA0BpI,EAAOgJ,EAAaH,EAAUlB,CAAc,EAE5E,KAAK,2BAA2B3H,EAAOgJ,EAAaH,EAAUlB,CAAc,CACpF,CAEQ,OAAO,0BAA0B3H,EAAkBgJ,EAAuBH,EAAoBlB,EAAuB,CAC5H,MAAMsB,EAAkB,IAAIvjB,EAAA,SAASsjB,EAAY,WAAY,CAAC,EACxDV,EAActI,EAAM,YAAYiJ,CAAe,EAC/CtjB,EAAYqa,EAAM,aAAY,EAI9B/1C,EAAO+1C,EAAM,gBAAgB,IAAIvZ,EAAA,MAAMwiB,EAAgB,WAAYA,EAAgB,OAAQtjB,EAAWqa,EAAM,iBAAiBra,CAAS,CAAC,EAAC,CAAA,EACxI4iB,EAAavI,EAAM,OAAM,IAAO;EAAS,IAAI4H,EAAgB39C,CAAI,EAAI,KAC3E4+C,EAAS,MAAMG,EAAY,OAAS,CAAC,EACrC,MAAMt6C,EAAIm6C,EAAS,KAAK5+C,CAAI,EAC5B,OAAIyE,EACIs4C,EACN,KAAK,wBAAwBhH,EAAOsI,EAAar+C,EAAMs+C,EAAW75C,EAAE,MAAOA,EAAE,CAAC,CAAC,EAC/EA,EACAi5C,CAAc,EAIZqB,EAAY,aAAe,GAAKA,EAAY,SAAW,EAEnD,KAAK,0BAA0BhJ,EAAO,IAAIta,EAAA,SAAS,EAAG,CAAC,EAAGmjB,EAAUlB,CAAc,EAGnF,IACR,CAEQ,OAAO,2BAA2B3H,EAAkBgJ,EAAuBH,EAAoBlB,EAAuB,CAC7H,MAAMhiB,EAAYqa,EAAM,aAAY,EAC9Bpb,EAAkBokB,EAAY,WAG9B/+C,EAAO+1C,EAAM,eAAepb,CAAe,EAC3Cx3B,EAAI,KAAK,sBAAsBy7C,EAAU5+C,EAAM26B,EAAiBokB,EAAY,OAAQrB,CAAc,EACxG,GAAIv6C,EACH,OAAOA,EAGR,QAAStF,EAAI,EAAGA,GAAK69B,EAAW79B,IAAK,CACpC,MAAM4+C,GAAa9hB,EAAkB98B,EAAI,GAAK69B,EACxC17B,EAAO+1C,EAAM,eAAe0G,EAAY,CAAC,EACzCt5C,EAAI,KAAK,sBAAsBy7C,EAAU5+C,EAAMy8C,EAAY,EAAG,EAAGiB,CAAc,EACrF,GAAIv6C,EACH,OAAOA,CAET,CAEA,OAAO,IACR,CAEQ,OAAO,sBAAsBy7C,EAAoB5+C,EAAc+5B,EAAoBklB,EAAoBvB,EAAuB,CAErIkB,EAAS,MAAMK,EAAa,CAAC,EAC7B,MAAMx6C,EAA4Bm6C,EAAS,KAAK5+C,CAAI,EACpD,OAAIyE,EACIs4C,EACN,IAAIvgB,EAAA,MAAMzC,EAAYt1B,EAAE,MAAQ,EAAGs1B,EAAYt1B,EAAE,MAAQ,EAAIA,EAAE,CAAC,EAAE,MAAM,EACxEA,EACAi5C,CAAc,EAGT,IACR,CAEO,OAAO,kBAAkB3H,EAAkBiI,EAA4Be,EAAuBrB,EAAuB,CAC3H,MAAMS,EAAaH,EAAa,mBAAkB,EAClD,GAAI,CAACG,EACJ,OAAO,KAGR,MAAMS,EAAW,IAAIR,EAASD,EAAW,eAAgBA,EAAW,KAAK,EAEzE,OAAIA,EAAW,MAAM,UACb,KAAK,8BAA8BpI,EAAOgJ,EAAaH,EAAUlB,CAAc,EAEhF,KAAK,+BAA+B3H,EAAOgJ,EAAaH,EAAUlB,CAAc,CACxF,CAEQ,OAAO,8BAA8B3H,EAAkBgJ,EAAuBH,EAAoBlB,EAAuB,CAChI,MAAMrH,EAAU,KAAK,wBAAwBN,EAAO,IAAIvZ,EAAA,MAAM,EAAG,EAAGuiB,EAAY,WAAYA,EAAY,MAAM,EAAGH,EAAUlB,EAAgB,GAAKT,CAAgB,EAChK,GAAI5G,EAAQ,OAAS,EACpB,OAAOA,EAAQA,EAAQ,OAAS,CAAC,EAGlC,MAAM3a,EAAYqa,EAAM,aAAY,EACpC,OAAIgJ,EAAY,aAAerjB,GAAaqjB,EAAY,SAAWhJ,EAAM,iBAAiBra,CAAS,EAE3F,KAAK,8BAA8Bqa,EAAO,IAAIta,EAAA,SAASC,EAAWqa,EAAM,iBAAiBra,CAAS,CAAC,EAAGkjB,EAAUlB,CAAc,EAG/H,IACR,CAEQ,OAAO,+BAA+B3H,EAAkBgJ,EAAuBH,EAAoBlB,EAAuB,CACjI,MAAMhiB,EAAYqa,EAAM,aAAY,EAC9Bpb,EAAkBokB,EAAY,WAG9B/+C,EAAO+1C,EAAM,eAAepb,CAAe,EAAE,UAAU,EAAGokB,EAAY,OAAS,CAAC,EAChF57C,EAAI,KAAK,qBAAqBy7C,EAAU5+C,EAAM26B,EAAiB+iB,CAAc,EACnF,GAAIv6C,EACH,OAAOA,EAGR,QAAStF,EAAI,EAAGA,GAAK69B,EAAW79B,IAAK,CACpC,MAAM4+C,GAAa/gB,EAAYf,EAAkB98B,EAAI,GAAK69B,EACpD17B,EAAO+1C,EAAM,eAAe0G,EAAY,CAAC,EACzCt5C,EAAI,KAAK,qBAAqBy7C,EAAU5+C,EAAMy8C,EAAY,EAAGiB,CAAc,EACjF,GAAIv6C,EACH,OAAOA,CAET,CAEA,OAAO,IACR,CAEQ,OAAO,qBAAqBy7C,EAAoB5+C,EAAc+5B,EAAoB2jB,EAAuB,CAChH,IAAIwB,EAA+B,KAC/Bz6C,EAEJ,IADAm6C,EAAS,MAAM,CAAC,EACRn6C,EAAIm6C,EAAS,KAAK5+C,CAAI,GAC7Bk/C,EAAanC,EAAgB,IAAIvgB,EAAA,MAAMzC,EAAYt1B,EAAE,MAAQ,EAAGs1B,EAAYt1B,EAAE,MAAQ,EAAIA,EAAE,CAAC,EAAE,MAAM,EAAGA,EAAGi5C,CAAc,EAE1H,OAAOwB,CACR,EA3QDh2C,EAAA,gBAAA60C,EA8QA,SAASoB,EAAkBxf,EAAyC3/B,EAAck/B,EAAoBkgB,EAAyBC,EAAmB,CACjJ,GAAID,IAAoB,EAEvB,MAAO,GAGR,MAAME,EAAat/C,EAAK,WAAWo/C,EAAkB,CAAC,EAMtD,GALIzf,EAAe,IAAI2f,CAAU,IAAC,GAK9BA,IAAU,IAAgCA,IAAU,GAEvD,MAAO,GAGR,GAAID,EAAc,EAAG,CACpB,MAAME,EAAmBv/C,EAAK,WAAWo/C,CAAe,EACxD,GAAIzf,EAAe,IAAI4f,CAAgB,IAAC,EAEvC,MAAO,EAET,CAEA,MAAO,EACR,CAEA,SAASC,EAAmB7f,EAAyC3/B,EAAck/B,EAAoBkgB,EAAyBC,EAAmB,CAClJ,GAAID,EAAkBC,IAAgBngB,EAErC,MAAO,GAGR,MAAMugB,EAAYz/C,EAAK,WAAWo/C,EAAkBC,CAAW,EAM/D,GALI1f,EAAe,IAAI8f,CAAS,IAAC,GAK7BA,IAAS,IAAgCA,IAAS,GAErD,MAAO,GAGR,GAAIJ,EAAc,EAAG,CACpB,MAAMK,EAAkB1/C,EAAK,WAAWo/C,EAAkBC,EAAc,CAAC,EACzE,GAAI1f,EAAe,IAAI+f,CAAe,IAAC,EAEtC,MAAO,EAET,CAEA,MAAO,EACR,CAEA,SAAgB1C,EAAard,EAAyC3/B,EAAck/B,EAAoBkgB,EAAyBC,EAAmB,CACnJ,OACCF,EAAkBxf,EAAgB3/B,EAAMk/B,EAAYkgB,EAAiBC,CAAW,GAC7EG,EAAmB7f,EAAgB3/B,EAAMk/B,EAAYkgB,EAAiBC,CAAW,CAEtF,CAEA,MAAajB,CAAQ,CAMpB,YAAYze,EAAgDggB,EAAmB,CAC9E,KAAK,gBAAkBhgB,EACvB,KAAK,aAAeggB,EACpB,KAAK,qBAAuB,GAC5B,KAAK,iBAAmB,CACzB,CAEO,MAAMC,EAAiB,CAC7B,KAAK,aAAa,UAAYA,EAC9B,KAAK,qBAAuB,GAC5B,KAAK,iBAAmB,CACzB,CAEO,KAAK5/C,EAAY,CACvB,MAAMk/B,EAAal/B,EAAK,OAExB,IAAIyE,EACJ,EAAG,CAOF,GANI,KAAK,qBAAuB,KAAK,mBAAqBy6B,IAK1Dz6B,EAAI,KAAK,aAAa,KAAKzE,CAAI,EAC3B,CAACyE,GACJ,OAAO,KAGR,MAAM26C,EAAkB36C,EAAE,MACpB46C,EAAc56C,EAAE,CAAC,EAAE,OACzB,GAAI26C,IAAoB,KAAK,sBAAwBC,IAAgB,KAAK,iBAAkB,CAC3F,GAAIA,IAAgB,EAAG,CAGlBxwB,EAAQ,iBAAiB7uB,EAAMk/B,EAAY,KAAK,aAAa,SAAS,EAAI,MAC7E,KAAK,aAAa,WAAa,EAE/B,KAAK,aAAa,WAAa,EAEhC,QACD,CAEA,OAAO,IACR,CAIA,GAHA,KAAK,qBAAuBkgB,EAC5B,KAAK,iBAAmBC,EAEpB,CAAC,KAAK,iBAAmBrC,EAAa,KAAK,gBAAiBh9C,EAAMk/B,EAAYkgB,EAAiBC,CAAW,EAC7G,OAAO56C,CAGT,OAASA,GAET,OAAO,IACR,EA5DDyE,EAAA,SAAAk1C,2HCteA,MAAsByB,CAAgB,QACvB,KAAA,aAAe,kBAAmB,CACzC,OAAO,WAAWC,EAA2B,CACnD,OAAOA,EAAa,WAA6BD,EAAiB,YAAY,CAC/E,CACO,OAAO,WAAWE,EAAkCrjD,EAAqB,CAC/EqjD,EAAa,WAA6BF,EAAiB,aAAcnjD,CAAG,CAC7E,EAPDwM,EAAA,iBAAA22C,iGCyCA32C,EAAA,mBAAA82C,EAVA,MAAMC,EAAY,IAAI,OAAO,oBAAqB,GAAG,EAC/CC,EAAkB,WASxB,SAAgBF,EAAmBjK,EAAmC54C,EAAiC,CACtG,IAAIgjD,EAA2B,CAAA,EAC/B,GAAIhjD,EAAQ,0BAA4BA,EAAQ,cAAc,QAAS,CACtE,MAAMijD,EAAgBC,EAAqBtK,EAAO54C,CAAO,EACzDgjD,EAAUA,EAAQ,OAAOC,CAAa,CACvC,CACA,GAAIjjD,EAAQ,uBAAwB,CACnC,MAAMmjD,EAAcC,EAAmBxK,CAAK,EAC5CoK,EAAUA,EAAQ,OAAOG,CAAW,CACrC,CACA,OAAOH,CACR,CAEA,SAASE,EAAqBtK,EAAmC54C,EAAiC,CACjG,MAAMijD,EAAiC,CAAA,EACjCvlB,EAAgBkb,EAAM,aAAY,EACxC,QAAShc,EAAa,EAAGA,GAAcc,EAAed,IAAc,CACnE,MAAM+F,EAAciW,EAAM,eAAehc,CAAU,EAC7CrV,EAAQob,EAAY,MAAM3iC,EAAQ,aAAc,QAAS,KAAK,EACpE,GAAIunB,EAAO,CACV,MAAMta,EAAQ,CAAE,gBAAiB2vB,EAAY,YAAarV,EAAM,CAAC,EAAE,OAAS,EAAG,cAAeqV,EAAY,UAAW+F,EAAY,OAAS,CAAC,EAC3I,GAAI11B,EAAM,UAAYA,EAAM,YAAa,CACxC,MAAMo2C,EAAgB,CACrB,MAAAp2C,EACA,GAAGq2C,EAAc3gB,EAAY,UAAUpb,EAAM,CAAC,EAAE,MAAM,CAAC,EACvD,mBAAoB,KAEjB87B,EAAc,MAAQA,EAAc,mBACvCJ,EAAc,KAAKI,CAAa,CAElC,CACD,CACD,CACA,OAAOJ,CACR,CAEA,SAASG,EAAmBxK,EAAiC,CAC5D,MAAMuK,EAA+B,CAAA,EAC/BzlB,EAAgBkb,EAAM,aAAY,EACxC,QAAShc,EAAa,EAAGA,GAAcc,EAAed,IAAc,CACnE,MAAM+F,EAAciW,EAAM,eAAehc,CAAU,EACnD2mB,EAAqB5gB,EAAa/F,EAAYumB,CAAW,CAC1D,CACA,OAAOA,CACR,CAEA,SAASI,EAAqB5gB,EAAqB/F,EAAoB4mB,EAA+B,CACrGV,EAAU,UAAY,EACtB,MAAMv7B,EAAQu7B,EAAU,KAAKngB,CAAW,EACxC,GAAIpb,EAAO,CACV,MAAMsV,EAAStV,EAAM,QAAS,CAAC,EAAE,CAAC,EAAI,EAChCoW,EAAYpW,EAAM,QAAS,CAAC,EAAE,CAAC,EAAI,EACnCta,EAAQ,CAAE,gBAAiB2vB,EAAY,YAAaC,EAAQ,cAAeD,EAAY,UAAWe,CAAS,EACjH,GAAI1wB,EAAM,UAAYA,EAAM,YAAa,CACxC,MAAMo2C,EAAgB,CACrB,MAAAp2C,EACA,GAAGq2C,EAAc/7B,EAAM,CAAC,CAAC,EACzB,mBAAoB,KAEjB87B,EAAc,MAAQA,EAAc,mBACvCG,EAAe,KAAKH,CAAa,CAEnC,CACD,CACD,CAEA,SAASC,EAAczgD,EAAY,CAClCA,EAAOA,EAAK,KAAI,EAChB,MAAM4gD,EAAmB5gD,EAAK,WAAW,GAAG,EAC5C,OAAAA,EAAOA,EAAK,QAAQkgD,EAAiB,EAAE,EAChC,CAAE,KAAAlgD,EAAM,iBAAA4gD,CAAgB,CAChC,6JC3GA,MAAaC,CAA2B,CAChC,OAAO,yBAAyB9K,EAAwC54C,EAAoCiN,EAAc,CAChI,MAAM02C,EAAY12C,EAAQA,EAAM,gBAAkB,EAC5C22C,EAAU32C,EAAQA,EAAM,cAAgB2rC,EAAM,aAAY,EAE1DiL,EAAuB,IAAIC,EAAqB9jD,CAAO,EAEvD+jD,EAAaF,EAAqB,uBAAsB,EAC9D,IAAIrK,EACAuK,IAAe,mBAClBvK,EAAQ,IAAI,OAAO,0BAA2B,GAAG,EAEjDA,EAAQ,IAAI,OAAO,GAAGwK,EAAyB,MAAM,KAAKD,CAAU,CAAC,CAAC,GAAI,GAAG,EAG9E,MAAMtC,EAAW,IAAIwC,EAAA,SAAS,KAAMzK,CAAK,EACnC0K,EAAkB,CAAA,EACxB,IAAIC,EAAU,GACV78C,EAEA88C,EAA0B,EAC1BC,EAA0B,EAC1BC,EAA8B,EAElCC,EACA,QAAS3nB,EAAa+mB,EAAWplB,EAAYqlB,EAAShnB,GAAc2B,EAAW3B,IAAc,CAC5F,MAAM+F,EAAciW,EAAM,eAAehc,CAAU,EAC7CwP,EAAazJ,EAAY,OAG/B8e,EAAS,MAAM,CAAC,EAChB,EAEC,IADAn6C,EAAIm6C,EAAS,KAAK9e,CAAW,EACzBr7B,EAAG,CACN,IAAIilB,EAAajlB,EAAE,MACf8tC,EAAW9tC,EAAE,MAAQA,EAAE,CAAC,EAAE,OAG9B,GAAIilB,EAAa,EAAG,CACnB,MAAMi4B,EAAiB7hB,EAAY,WAAWpW,EAAa,CAAC,EACxDmF,EAAQ,gBAAgB8yB,CAAc,GACzCj4B,GAEF,CACA,GAAI6oB,EAAW,EAAIhJ,EAAY,CAC9B,MAAMoY,EAAiB7hB,EAAY,WAAWyS,EAAW,CAAC,EACtD1jB,EAAQ,gBAAgB8yB,CAAc,GACzCpP,GAEF,CACA,MAAMjuC,EAAMw7B,EAAY,UAAUpW,EAAY6oB,CAAQ,EACtD,IAAIqP,KAAOC,EAAA,eAAcn4B,EAAa,EAAGm4B,EAAA,oBAAqB/hB,EAAa,CAAC,EACxE8hB,GAAQA,EAAK,WAAal4B,EAAa,IAE1Ck4B,EAAO,MAER,MAAME,EAAkBd,EAAqB,6BAA6B18C,EAAKs9C,EAAOA,EAAK,KAAO,IAAI,EAEtG,GAAIE,IAAe,EAAiC,CAYnD,GAXIA,IAAe,EAClBP,IACUO,IAAe,EACzBN,IACUM,IAAe,EACzBL,OAEApjB,EAAA,aAAYyjB,CAAe,EAIxBT,EAAO,QADe,IACc,CACvCC,EAAU,GACV,MAAMI,CACP,CAEAL,EAAO,KAAK,IAAI7kB,EAAA,MAAMzC,EAAYrQ,EAAa,EAAGqQ,EAAYwY,EAAW,CAAC,CAAC,CAC5E,CACD,OACQ9tC,EACV,CACA,MAAO,CACN,OAAA48C,EACA,QAAAC,EACA,wBAAAC,EACA,wBAAAC,EACA,4BAAAC,EAEF,CAEO,OAAO,8BAA8BpzB,EAAclxB,EAAkC,CAC3F,MAAM6jD,EAAuB,IAAIC,EAAqB9jD,CAAO,EAG7D,OADe6jD,EAAqB,6BAA6B3yB,EAAM,IAAI,EAC3D,CACf,IAAA,GACC,OAAO,KACR,IAAA,GACC,MAAO,CAAE,KAAI,CAAwC,EAEtD,IAAA,GAAsC,CACrC,MAAMtD,EAAYsD,EAAK,YAAY,CAAC,EAC9B0zB,EAAoBf,EAAqB,oBAAoB,qBAAqBj2B,CAAS,EAC3Fi3B,EACLnzB,EAAQ,oBAAoB,WAAU,EAAG,OACvCld,GACA,CAACkd,EAAQ,oBAAoB,YAC5B,IAAI,IAAI,CAAC,GAAG1xB,EAAQ,eAAgBwU,CAAC,CAAC,CAAC,EACtC,YAAYoZ,CAAS,CAAC,EAE3B,MAAO,CAAE,KAAI,EAA0C,eAAgB,OAAO,cAAcg3B,CAAiB,EAAG,sBAAAC,CAAqB,CACtI,CACA,IAAA,GACC,MAAO,CAAE,KAAI,CAA4C,CAC3D,CACD,EAlHD94C,EAAA,4BAAA23C,EAqHA,SAASM,EAAyBc,EAAsBzhB,EAAc,CAIrE,MAHY,IAAI3R,EAAQ,uBACvBozB,EAAW,IAAKpkD,GAAM,OAAO,cAAcA,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CACvD,GAEF,CAgBA,MAAMojD,CAAoB,CAGzB,YAA6B9jD,EAAkC,CAAlC,KAAA,QAAAA,EAC5B,KAAK,kBAAoB,IAAI,IAAIA,EAAQ,iBAAiB,EAC1D,KAAK,oBAAsB0xB,EAAQ,oBAAoB,YAAY,IAAI,IAAI1xB,EAAQ,cAAc,CAAC,CACnG,CAEO,wBAAsB,CAC5B,GAAI,KAAK,QAAQ,cAChB,MAAO,mBAGR,MAAM+kD,EAAM,IAAI,IAEhB,GAAI,KAAK,QAAQ,oBAChB,UAAWC,KAAMtzB,EAAQ,oBAAoB,WACvCuzB,EAA4B,OAAO,cAAcD,CAAE,CAAC,GACxDD,EAAI,IAAIC,CAAE,EAKb,GAAI,KAAK,QAAQ,oBAChB,UAAWA,KAAM,KAAK,oBAAoB,wBAAuB,EAChED,EAAI,IAAIC,CAAE,EAIZ,UAAWA,KAAM,KAAK,kBACrBD,EAAI,OAAOC,CAAE,EAGd,OAAOD,CACR,CAEO,6BAA6BG,EAAmBC,EAA0B,CAChF,MAAMv3B,EAAYs3B,EAAU,YAAY,CAAC,EAEzC,GAAI,KAAK,kBAAkB,IAAIt3B,CAAS,EACvC,MAAA,GAGD,GAAI,KAAK,QAAQ,cAChB,MAAA,GAGD,IAAIw3B,EAA0B,GAC1BC,EAAyC,GAC7C,GAAIF,EACH,UAAWj0B,KAAQi0B,EAAa,CAC/B,MAAMv3B,EAAYsD,EAAK,YAAY,CAAC,EAC9BlG,EAAe0G,EAAQ,aAAaR,CAAI,EAC9Ck0B,EAA0BA,GAA2Bp6B,EAGpD,CAACA,GACD,CAAC,KAAK,oBAAoB,YAAY4C,CAAS,GAC/C,CAAC8D,EAAQ,oBAAoB,qBAAqB9D,CAAS,IAE3Dy3B,EAAyC,GAE3C,CAGD,MAC8D,CAACD,GACTC,EAErD,EAGG,KAAK,QAAQ,qBAEZ,CAACJ,EAA4BC,CAAS,GAAKxzB,EAAQ,oBAAoB,qBAAqB9D,CAAS,EACxG,EAIE,KAAK,QAAQ,qBACZ,KAAK,oBAAoB,YAAYA,CAAS,EACjD,EAIF,CACD,EAGD,SAASq3B,EAA4BC,EAAiB,CACrD,OAAOA,IAAc,KAAOA,IAAc;GAAQA,IAAc,GACjE,4kCCzOA,IAAYI,GAAZ,SAAYA,EAAoB,CAI/BA,EAAAA,EAAA,QAAA,CAAA,EAAA,UACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,QAAA,CAAA,EAAA,SACD,GAPYA,IAAoBv5C,EAAA,qBAApBu5C,EAAoB,CAAA,EAAA,EAShC,IAAYC,GAAZ,SAAYA,EAAqB,CAChCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GAHYA,IAAqBx5C,EAAA,sBAArBw5C,EAAqB,CAAA,EAAA,EAKjC,IAAYC,GAAZ,SAAYA,EAA4B,CACvCA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAKAA,EAAAA,EAAA,eAAA,CAAA,EAAA,iBAIAA,EAAAA,EAAA,gBAAA,CAAA,EAAA,iBACD,GAXYA,IAA4Bz5C,EAAA,6BAA5By5C,EAA4B,CAAA,EAAA,EAaxC,IAAYC,GAAZ,SAAYA,EAAkB,CAC7BA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,YAAA,CAAA,EAAA,cACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,YACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,SACD,GA7BYA,IAAkB15C,EAAA,mBAAlB05C,EAAkB,CAAA,EAAA,EA+B9B,IAAYC,GAAZ,SAAYA,EAAiB,CAC5BA,EAAAA,EAAA,WAAA,CAAA,EAAA,YACD,GAFYA,IAAiB35C,EAAA,kBAAjB25C,EAAiB,CAAA,EAAA,EAO7B,IAAYC,GAAZ,SAAYA,EAAqB,CAChCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,iBAAA,CAAA,EAAA,mBACAA,EAAAA,EAAA,gCAAA,CAAA,EAAA,iCACD,GAJYA,IAAqB55C,EAAA,sBAArB45C,EAAqB,CAAA,EAAA,EASjC,IAAYC,GAAZ,SAAYA,EAA+B,CAI1CA,EAAAA,EAAA,MAAA,CAAA,EAAA,QAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,OACD,GAbYA,IAA+B75C,EAAA,gCAA/B65C,EAA+B,CAAA,EAAA,EAkB3C,IAAYC,GAAZ,SAAYA,EAAkB,CAI7BA,EAAAA,EAAA,OAAA,CAAA,EAAA,SAIAA,EAAAA,EAAA,aAAA,CAAA,EAAA,eAIAA,EAAAA,EAAA,mBAAA,CAAA,EAAA,qBAIAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GA7BYA,IAAkB95C,EAAA,mBAAlB85C,EAAkB,CAAA,EAAA,EAkC9B,IAAYC,GAAZ,SAAYA,EAAgB,CAI3BA,EAAAA,EAAA,GAAA,CAAA,EAAA,KAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GATYA,IAAgB/5C,EAAA,iBAAhB+5C,EAAgB,CAAA,EAAA,EAc5B,IAAYC,GAAZ,SAAYA,EAAqB,CAIhCA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,OACD,GAbYA,IAAqBh6C,EAAA,sBAArBg6C,EAAqB,CAAA,EAAA,EAkBjC,IAAYC,GAAZ,SAAYA,EAAwB,CACnCA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GANYA,IAAwBj6C,EAAA,yBAAxBi6C,EAAwB,CAAA,EAAA,EAQpC,IAAYC,GAAZ,SAAYA,EAAY,CACvBA,EAAAA,EAAA,kCAAA,CAAA,EAAA,oCACAA,EAAAA,EAAA,wBAAA,CAAA,EAAA,0BACAA,EAAAA,EAAA,qBAAA,CAAA,EAAA,uBACAA,EAAAA,EAAA,sBAAA,CAAA,EAAA,wBACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,YACAA,EAAAA,EAAA,aAAA,CAAA,EAAA,eACAA,EAAAA,EAAA,oBAAA,CAAA,EAAA,sBACAA,EAAAA,EAAA,oBAAA,CAAA,EAAA,sBACAA,EAAAA,EAAA,qCAAA,CAAA,EAAA,uCACAA,EAAAA,EAAA,kBAAA,CAAA,EAAA,oBACAA,EAAAA,EAAA,oBAAA,EAAA,EAAA,sBACAA,EAAAA,EAAA,kBAAA,EAAA,EAAA,oBACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,gBAAA,EAAA,EAAA,kBACAA,EAAAA,EAAA,aAAA,EAAA,EAAA,eACAA,EAAAA,EAAA,wBAAA,EAAA,EAAA,0BACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,mBAAA,EAAA,EAAA,qBACAA,EAAAA,EAAA,iBAAA,EAAA,EAAA,mBACAA,EAAAA,EAAA,gBAAA,EAAA,EAAA,kBACAA,EAAAA,EAAA,qBAAA,EAAA,EAAA,uBACAA,EAAAA,EAAA,gBAAA,EAAA,EAAA,kBACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,2BAAA,EAAA,EAAA,6BACAA,EAAAA,EAAA,eAAA,EAAA,EAAA,iBACAA,EAAAA,EAAA,2BAAA,EAAA,EAAA,6BACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,uBAAA,EAAA,EAAA,yBACAA,EAAAA,EAAA,4BAAA,EAAA,EAAA,8BACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,oBAAA,EAAA,EAAA,sBACAA,EAAAA,EAAA,8BAAA,EAAA,EAAA,gCACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,eAAA,EAAA,EAAA,iBACAA,EAAAA,EAAA,wBAAA,EAAA,EAAA,0BACAA,EAAAA,EAAA,gCAAA,EAAA,EAAA,kCACAA,EAAAA,EAAA,qBAAA,EAAA,EAAA,uBACAA,EAAAA,EAAA,sBAAA,EAAA,EAAA,wBACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,qBAAA,EAAA,EAAA,uBACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,gBAAA,EAAA,EAAA,kBACAA,EAAAA,EAAA,iBAAA,EAAA,EAAA,mBACAA,EAAAA,EAAA,wBAAA,EAAA,EAAA,0BACAA,EAAAA,EAAA,sBAAA,EAAA,EAAA,wBACAA,EAAAA,EAAA,4BAAA,EAAA,EAAA,8BACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,eAAA,EAAA,EAAA,iBACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,aAAA,EAAA,EAAA,eACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,aAAA,EAAA,EAAA,eACAA,EAAAA,EAAA,0BAAA,EAAA,EAAA,4BACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,aAAA,EAAA,EAAA,eACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,qBAAA,EAAA,EAAA,uBACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,oBAAA,EAAA,EAAA,sBACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,4BAAA,EAAA,EAAA,8BACAA,EAAAA,EAAA,eAAA,EAAA,EAAA,iBACAA,EAAAA,EAAA,4BAAA,EAAA,EAAA,8BACAA,EAAAA,EAAA,oBAAA,EAAA,EAAA,sBACAA,EAAAA,EAAA,iBAAA,EAAA,EAAA,mBACAA,EAAAA,EAAA,iBAAA,EAAA,EAAA,mBACAA,EAAAA,EAAA,qBAAA,EAAA,EAAA,uBACAA,EAAAA,EAAA,oBAAA,EAAA,EAAA,sBACAA,EAAAA,EAAA,mBAAA,EAAA,EAAA,qBACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,eAAA,EAAA,EAAA,iBACAA,EAAAA,EAAA,uBAAA,EAAA,EAAA,yBACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,0BAAA,EAAA,EAAA,4BACAA,EAAAA,EAAA,iBAAA,EAAA,EAAA,mBACAA,EAAAA,EAAA,sBAAA,EAAA,EAAA,wBACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,gBAAA,EAAA,EAAA,kBACAA,EAAAA,EAAA,aAAA,EAAA,EAAA,eACAA,EAAAA,EAAA,wBAAA,EAAA,EAAA,0BACAA,EAAAA,EAAA,mBAAA,EAAA,EAAA,qBACAA,EAAAA,EAAA,oBAAA,EAAA,EAAA,sBACAA,EAAAA,EAAA,iCAAA,EAAA,EAAA,mCACAA,EAAAA,EAAA,4BAAA,EAAA,EAAA,8BACAA,EAAAA,EAAA,iBAAA,GAAA,EAAA,mBACAA,EAAAA,EAAA,6BAAA,GAAA,EAAA,+BACAA,EAAAA,EAAA,iBAAA,GAAA,EAAA,mBACAA,EAAAA,EAAA,OAAA,GAAA,EAAA,SACAA,EAAAA,EAAA,UAAA,GAAA,EAAA,YACAA,EAAAA,EAAA,uBAAA,GAAA,EAAA,yBACAA,EAAAA,EAAA,qBAAA,GAAA,EAAA,uBACAA,EAAAA,EAAA,sBAAA,GAAA,EAAA,wBACAA,EAAAA,EAAA,mBAAA,GAAA,EAAA,qBACAA,EAAAA,EAAA,mBAAA,GAAA,EAAA,qBACAA,EAAAA,EAAA,oBAAA,GAAA,EAAA,sBACAA,EAAAA,EAAA,oBAAA,GAAA,EAAA,sBACAA,EAAAA,EAAA,WAAA,GAAA,EAAA,aACAA,EAAAA,EAAA,mBAAA,GAAA,EAAA,qBACAA,EAAAA,EAAA,YAAA,GAAA,EAAA,cACAA,EAAAA,EAAA,gBAAA,GAAA,EAAA,kBACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,uBAAA,GAAA,EAAA,yBACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,gBAAA,GAAA,EAAA,kBACAA,EAAAA,EAAA,kBAAA,GAAA,EAAA,oBACAA,EAAAA,EAAA,2BAAA,GAAA,EAAA,6BACAA,EAAAA,EAAA,iBAAA,GAAA,EAAA,mBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,SAAA,GAAA,EAAA,WACAA,EAAAA,EAAA,oBAAA,GAAA,EAAA,sBACAA,EAAAA,EAAA,uBAAA,GAAA,EAAA,yBACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,YAAA,GAAA,EAAA,cACAA,EAAAA,EAAA,UAAA,GAAA,EAAA,YACAA,EAAAA,EAAA,qBAAA,GAAA,EAAA,uBACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,SAAA,GAAA,EAAA,WACAA,EAAAA,EAAA,6BAAA,GAAA,EAAA,+BACAA,EAAAA,EAAA,8BAAA,GAAA,EAAA,gCACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,kBAAA,GAAA,EAAA,oBACAA,EAAAA,EAAA,kBAAA,GAAA,EAAA,oBACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,iBAAA,GAAA,EAAA,mBACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,WAAA,GAAA,EAAA,aACAA,EAAAA,EAAA,gBAAA,GAAA,EAAA,kBACAA,EAAAA,EAAA,WAAA,GAAA,EAAA,aACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,WAAA,GAAA,EAAA,aACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,uBAAA,GAAA,EAAA,yBACAA,EAAAA,EAAA,2BAAA,GAAA,EAAA,6BACAA,EAAAA,EAAA,sCAAA,GAAA,EAAA,uCACD,GAxJYA,IAAYl6C,EAAA,aAAZk6C,EAAY,CAAA,EAAA,EA6JxB,IAAYC,GAAZ,SAAYA,EAAmB,CAI9BA,EAAAA,EAAA,YAAA,CAAA,EAAA,cAIAA,EAAAA,EAAA,GAAA,CAAA,EAAA,KAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GAbYA,IAAmBn6C,EAAA,oBAAnBm6C,EAAmB,CAAA,EAAA,EAkB/B,IAAYC,GAAZ,SAAYA,EAAiB,CAI5BA,EAAAA,EAAA,GAAA,CAAA,EAAA,KAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GATYA,IAAiBp6C,EAAA,kBAAjBo6C,EAAiB,CAAA,EAAA,EAc7B,IAAYnJ,GAAZ,SAAYA,EAAe,CAC1BA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,OACD,GAJYA,IAAejxC,EAAA,gBAAfixC,EAAe,CAAA,EAAA,EAM3B,IAAYoJ,GAAZ,SAAYA,EAAoB,CAI/BA,EAAAA,EAAA,SAAA,CAAA,EAAA,WAIAA,EAAAA,EAAA,SAAA,CAAA,EAAA,UACD,GATYA,IAAoBr6C,EAAA,qBAApBq6C,EAAoB,CAAA,EAAA,EAchC,IAAYC,GAAZ,SAAYA,EAAY,CAIvBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SAMAA,EAAAA,EAAA,cAAA,CAAA,EAAA,gBAIAA,EAAAA,EAAA,QAAA,CAAA,EAAA,SACD,GAnBYA,IAAYt6C,EAAA,aAAZs6C,EAAY,CAAA,EAAA,EAqBxB,IAAYpJ,GAAZ,SAAYA,EAAuB,CAClCA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GALYA,IAAuBlxC,EAAA,wBAAvBkxC,EAAuB,CAAA,EAAA,EAOnC,IAAYqJ,GAAZ,SAAYA,EAAa,CACxBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,WACD,GAHYA,IAAav6C,EAAA,cAAbu6C,EAAa,CAAA,EAAA,EAQzB,IAAYC,GAAZ,SAAYA,EAA2B,CAKtCA,EAAAA,EAAA,UAAA,CAAA,EAAA,YAKAA,EAAAA,EAAA,SAAA,CAAA,EAAA,UACD,GAXYA,IAA2Bx6C,EAAA,4BAA3Bw6C,EAA2B,CAAA,EAAA,EAavC,IAAYC,GAAZ,SAAYA,EAAqB,CAChCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,WACD,GAHYA,IAAqBz6C,EAAA,sBAArBy6C,EAAqB,CAAA,EAAA,EASjC,IAAYC,GAAZ,SAAYA,EAAO,CAClBA,EAAAA,EAAA,kBAAA,EAAA,EAAA,oBAIAA,EAAAA,EAAA,QAAA,CAAA,EAAA,UACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,YACAA,EAAAA,EAAA,IAAA,CAAA,EAAA,MACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,IAAA,CAAA,EAAA,MACAA,EAAAA,EAAA,WAAA,CAAA,EAAA,aACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,GAAA,EAAA,EAAA,KACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aAKAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YAKAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QAKAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QAKAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QAKAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SAKAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QAKAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YAKAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cAKAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YAKAA,EAAAA,EAAA,aAAA,EAAA,EAAA,eAKAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QAIAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QAIAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,UAAA,GAAA,EAAA,YACAA,EAAAA,EAAA,iBAAA,GAAA,EAAA,mBACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eAIAA,EAAAA,EAAA,mBAAA,GAAA,EAAA,qBACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,QAAA,GAAA,EAAA,UACAA,EAAAA,EAAA,gBAAA,GAAA,EAAA,kBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,gBAAA,GAAA,EAAA,kBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,YAAA,GAAA,EAAA,cACAA,EAAAA,EAAA,YAAA,GAAA,EAAA,cACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,mBAAA,GAAA,EAAA,qBACAA,EAAAA,EAAA,UAAA,GAAA,EAAA,YACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,kBAAA,GAAA,EAAA,oBACAA,EAAAA,EAAA,WAAA,GAAA,EAAA,aACAA,EAAAA,EAAA,WAAA,GAAA,EAAA,aAIAA,EAAAA,EAAA,MAAA,GAAA,EAAA,QAKAA,EAAAA,EAAA,UAAA,GAAA,EAAA,WACD,GAtMYA,IAAO16C,EAAA,QAAP06C,EAAO,CAAA,EAAA,EAwMnB,IAAYC,GAAZ,SAAYA,EAAc,CACzBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,QAAA,CAAA,EAAA,UACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,OACD,GALYA,IAAc36C,EAAA,eAAd26C,EAAc,CAAA,EAAA,EAO1B,IAAYC,GAAZ,SAAYA,EAAS,CACpBA,EAAAA,EAAA,YAAA,CAAA,EAAA,cACAA,EAAAA,EAAA,WAAA,CAAA,EAAA,YACD,GAHYA,IAAS56C,EAAA,UAAT46C,EAAS,CAAA,EAAA,EAQrB,IAAYC,GAAZ,SAAYA,EAAe,CAC1BA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,QACD,GAHYA,IAAe76C,EAAA,gBAAf66C,EAAe,CAAA,EAAA,EAQ3B,IAAYC,GAAZ,SAAYA,EAAyB,CACpCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,WAAA,CAAA,EAAA,YACD,GAHYA,IAAyB96C,EAAA,0BAAzB86C,EAAyB,CAAA,EAAA,EAQrC,IAAYC,GAAZ,SAAYA,EAAe,CAI1BA,EAAAA,EAAA,QAAA,CAAA,EAAA,UAIAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WAIAA,EAAAA,EAAA,oBAAA,CAAA,EAAA,sBAIAA,EAAAA,EAAA,oBAAA,CAAA,EAAA,sBAIAA,EAAAA,EAAA,wBAAA,CAAA,EAAA,0BAIAA,EAAAA,EAAA,iBAAA,CAAA,EAAA,mBAIAA,EAAAA,EAAA,aAAA,CAAA,EAAA,eAIAA,EAAAA,EAAA,cAAA,CAAA,EAAA,gBAIAA,EAAAA,EAAA,kBAAA,CAAA,EAAA,oBAIAA,EAAAA,EAAA,eAAA,CAAA,EAAA,iBAIAA,EAAAA,EAAA,eAAA,EAAA,EAAA,iBAIAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YAIAA,EAAAA,EAAA,eAAA,EAAA,EAAA,iBAIAA,EAAAA,EAAA,eAAA,EAAA,EAAA,gBACD,GAzDYA,IAAe/6C,EAAA,gBAAf+6C,EAAe,CAAA,EAAA,EA2D3B,IAAYC,GAAZ,SAAYA,EAAgB,CAC3BA,EAAAA,EAAA,YAAA,CAAA,EAAA,aACD,GAFYA,IAAgBh7C,EAAA,iBAAhBg7C,EAAgB,CAAA,EAAA,EAI5B,IAAYC,GAAZ,SAAYA,EAAwB,CACnCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,WACD,GAHYA,IAAwBj7C,EAAA,yBAAxBi7C,EAAwB,CAAA,EAAA,EAQpC,IAAYC,GAAZ,SAAYA,EAA+B,CAI1CA,EAAAA,EAAA,iBAAA,CAAA,EAAA,mBAIAA,EAAAA,EAAA,oBAAA,CAAA,EAAA,sBAIAA,EAAAA,EAAA,WAAA,CAAA,EAAA,YACD,GAbYA,IAA+Bl7C,EAAA,gCAA/Bk7C,EAA+B,CAAA,EAAA,EAkB3C,IAAYlK,GAAZ,SAAYA,EAAiB,CAC5BA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,MACD,GALYA,IAAiBhxC,EAAA,kBAAjBgxC,EAAiB,CAAA,EAAA,EAU7B,IAAYmK,GAAZ,SAAYA,EAAwB,CACnCA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,QAAA,CAAA,EAAA,SACD,GAJYA,IAAwBn7C,EAAA,yBAAxBm7C,EAAwB,CAAA,EAAA,EAMpC,IAAYC,GAAZ,SAAYA,EAAgB,CAI3BA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,mBAAA,CAAA,EAAA,qBAIAA,EAAAA,EAAA,oBAAA,CAAA,EAAA,qBACD,GArBYA,IAAgBp7C,EAAA,iBAAhBo7C,EAAgB,CAAA,EAAA,EAuB5B,IAAYC,GAAZ,SAAYA,EAAqB,CAChCA,EAAAA,EAAA,IAAA,CAAA,EAAA,MACAA,EAAAA,EAAA,GAAA,CAAA,EAAA,KACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,QACD,GANYA,IAAqBr7C,EAAA,sBAArBq7C,EAAqB,CAAA,EAAA,EAQjC,IAAYC,GAAZ,SAAYA,EAAa,CACxBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,QACD,GAJYA,IAAat7C,EAAA,cAAbs7C,EAAa,CAAA,EAAA,EAMzB,IAAYC,GAAZ,SAAYA,EAAU,CACrBA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,WACD,GAHYA,IAAUv7C,EAAA,WAAVu7C,EAAU,CAAA,EAAA,EAKtB,IAAYC,GAAZ,SAAYA,EAAmB,CAC9BA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,QAAA,CAAA,EAAA,SACD,GAJYA,IAAmBx7C,EAAA,oBAAnBw7C,EAAmB,CAAA,EAAA,EAS/B,IAAYC,GAAZ,SAAYA,EAAkB,CAI7BA,EAAAA,EAAA,IAAA,CAAA,EAAA,MAIAA,EAAAA,EAAA,IAAA,CAAA,EAAA,KACD,GATYA,IAAkBz7C,EAAA,mBAAlBy7C,EAAkB,CAAA,EAAA,EAW9B,IAAYC,GAAZ,SAAYA,EAAqB,CAChCA,EAAA,IAAA,MACAA,EAAA,OAAA,SACAA,EAAA,GAAA,IACD,GAJYA,IAAqB17C,EAAA,sBAArB07C,EAAqB,CAAA,EAAA,EAMjC,IAAYC,GAAZ,SAAYA,EAAwB,CACnCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,iBAAA,CAAA,EAAA,mBACAA,EAAAA,EAAA,cAAA,CAAA,EAAA,eACD,GAJYA,IAAwB37C,EAAA,yBAAxB27C,EAAwB,CAAA,EAAA,EASpC,IAAYC,GAAZ,SAAYA,EAAU,CACrBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,YACAA,EAAAA,EAAA,QAAA,CAAA,EAAA,UACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QACAA,EAAAA,EAAA,YAAA,CAAA,EAAA,cACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,IAAA,EAAA,EAAA,MACAA,EAAAA,EAAA,KAAA,EAAA,EAAA,OACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,OAAA,EAAA,EAAA,SACAA,EAAAA,EAAA,MAAA,EAAA,EAAA,QACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,eACD,GA3BYA,IAAU57C,EAAA,WAAV47C,EAAU,CAAA,EAAA,EA6BtB,IAAYC,IAAZ,SAAYA,EAAS,CACpBA,EAAAA,EAAA,WAAA,CAAA,EAAA,YACD,GAFYA,KAAS77C,EAAA,UAAT67C,GAAS,CAAA,EAAA,EAOrB,IAAYC,IAAZ,SAAYA,EAA6B,CAIxCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QAIAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QAIAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,OACD,GAzBYA,KAA6B97C,EAAA,8BAA7B87C,GAA6B,CAAA,EAAA,EA8BzC,IAAYC,IAAZ,SAAYA,EAAqB,CAIhCA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,QAIAA,EAAAA,EAAA,UAAA,CAAA,EAAA,YAIAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WAIAA,EAAAA,EAAA,aAAA,CAAA,EAAA,eAIAA,EAAAA,EAAA,cAAA,CAAA,EAAA,eACD,GAzBYA,KAAqB/7C,EAAA,sBAArB+7C,GAAqB,CAAA,EAAA,EA+BjC,IAAYC,IAAZ,SAAYA,EAAsB,CACjCA,EAAAA,EAAA,6BAAA,CAAA,EAAA,+BACAA,EAAAA,EAAA,4BAAA,CAAA,EAAA,8BACAA,EAAAA,EAAA,0BAAA,CAAA,EAAA,4BACAA,EAAAA,EAAA,yBAAA,CAAA,EAAA,0BACD,GALYA,KAAsBh8C,EAAA,uBAAtBg8C,GAAsB,CAAA,EAAA,EAUlC,IAAYC,IAAZ,SAAYA,EAAc,CAIzBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,OAAA,CAAA,EAAA,SAIAA,EAAAA,EAAA,WAAA,CAAA,EAAA,YACD,GAjBYA,KAAcj8C,EAAA,eAAdi8C,GAAc,CAAA,EAAA,uICt7B1B,MAAaC,CAAoB,CAUhC,aAAA,CARiB,KAAA,sBAAwB,IAAI,IAC5B,KAAA,WAAa,IAAI,IAEjB,KAAA,aAAe,IAAIt/B,EAAA,QACpB,KAAA,YAAuD,KAAK,aAAa,MAKxF,KAAK,UAAY,IAClB,CAEO,aAAau/B,EAAqB,CACxC,KAAK,aAAa,KAAK,CACtB,iBAAkBA,EAClB,gBAAiB,GACjB,CACF,CAEO,SAASC,EAAoBC,EAAiB,CACpD,YAAK,sBAAsB,IAAID,EAAYC,CAAO,EAClD,KAAK,aAAa,CAACD,CAAU,CAAC,KACvBzmC,EAAA,cAAa,IAAK,CACpB,KAAK,sBAAsB,IAAIymC,CAAU,IAAMC,IAGnD,KAAK,sBAAsB,OAAOD,CAAU,EAC5C,KAAK,aAAa,CAACA,CAAU,CAAC,EAC/B,CAAC,CACF,CAEO,IAAIA,EAAkB,CAC5B,OAAO,KAAK,sBAAsB,IAAIA,CAAU,GAAK,IACtD,CAEO,gBAAgBA,EAAoBE,EAA2C,CACrF,KAAK,WAAW,IAAIF,CAAU,GAAG,QAAO,EACxC,MAAMG,EAAS,IAAIC,EAA+B,KAAMJ,EAAYE,CAAO,EAC3E,YAAK,WAAW,IAAIF,EAAYG,CAAM,KAC/B5mC,EAAA,cAAa,IAAK,CACxB,MAAM1M,EAAI,KAAK,WAAW,IAAImzC,CAAU,EACpC,CAACnzC,GAAKA,IAAMszC,IAGhB,KAAK,WAAW,OAAOH,CAAU,EACjCnzC,EAAE,QAAO,EACV,CAAC,CACF,CAEO,MAAM,YAAYmzC,EAAkB,CAE1C,MAAMK,EAAsB,KAAK,IAAIL,CAAU,EAC/C,GAAIK,EACH,OAAOA,EAGR,MAAMH,EAAU,KAAK,WAAW,IAAIF,CAAU,EAC9C,MAAI,CAACE,GAAWA,EAAQ,WAEhB,MAGR,MAAMA,EAAQ,QAAO,EAEd,KAAK,IAAIF,CAAU,EAC3B,CAEO,WAAWA,EAAkB,CAEnC,GAD4B,KAAK,IAAIA,CAAU,EAE9C,MAAO,GAGR,MAAME,EAAU,KAAK,WAAW,IAAIF,CAAU,EAC9C,MAAI,IAACE,GAAWA,EAAQ,WAKzB,CAEO,YAAYI,EAAiB,CACnC,KAAK,UAAYA,EACjB,KAAK,aAAa,KAAK,CACtB,iBAAkB,MAAM,KAAK,KAAK,sBAAsB,KAAI,CAAE,EAC9D,gBAAiB,GACjB,CACF,CAEO,aAAW,CACjB,OAAO,KAAK,SACb,CAEO,sBAAoB,CAC1B,OAAI,KAAK,WAAa,KAAK,UAAU,OAAM,EACnC,KAAK,UAAS,CAAA,EAEf,IACR,EApGD18C,EAAA,qBAAAk8C,EAuGA,MAAMM,UAAiD7mC,EAAA,UAAU,CAMhE,IAAW,YAAU,CACpB,OAAO,KAAK,WACb,CAEA,YACkBgnC,EACAC,EACAC,EAA4C,CAE7D,MAAK,EAJY,KAAA,UAAAF,EACA,KAAA,YAAAC,EACA,KAAA,SAAAC,EAXV,KAAA,YAAuB,GACvB,KAAA,gBAAwC,KACxC,KAAA,YAAuB,EAY/B,CAEgB,SAAO,CACtB,KAAK,YAAc,GACnB,MAAM,QAAO,CACd,CAEO,MAAM,SAAO,CACnB,OAAK,KAAK,kBACT,KAAK,gBAAkB,KAAK,QAAO,GAE7B,KAAK,eACb,CAEQ,MAAM,SAAO,CACpB,MAAMjpD,EAAQ,MAAM,KAAK,SAAS,oBAClC,KAAK,YAAc,GACfA,GAAS,CAAC,KAAK,aAClB,KAAK,UAAU,KAAK,UAAU,SAAS,KAAK,YAAaA,CAAK,CAAC,CAEjE,kGC5IDoM,EAAA,eAAA88C,EAIA98C,EAAA,eAAA+8C,EAJA,SAAgBD,GAAc,CAC7B,OAAO,WAAW,oBACnB,CAEA,SAAgBC,GAAc,CAC7B,OAAO,WAAW,oBACnB,oJCgEA/8C,EAAA,SAAAg9C,EAwDAh9C,EAAA,UAAAi9C,EAhIS,OAAA,eAAAj9C,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,OAAAk9C,EAAA,cAAc,CAAA,CAAA,EAAE,OAAA,eAAAl9C,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,OAAAk9C,EAAA,cAAc,CAAA,CAAA,EAEvC,MAAMC,KAAWC,EAAA,gBAAc,IAAO,UAAa,OAAO,SAAa,KAAe,SAAS,UAAY,SAAS,SAAS,KAAK,QAAQ,aAAa,GAAK,EAY5J,SAASC,EAAQt9C,EAAiB/H,EAAsD,CACvF,IAAI3F,EAEJ,OAAI2F,EAAK,SAAW,EACnB3F,EAAS0N,EAET1N,EAAS0N,EAAQ,QAAQ,aAAc,CAACyb,EAAO8hC,IAAQ,CACtD,MAAMn7C,EAAQm7C,EAAK,CAAC,EACd15C,EAAM5L,EAAKmK,CAAK,EACtB,IAAI9P,EAASmpB,EACb,OAAI,OAAO5X,GAAQ,SAClBvR,EAASuR,GACC,OAAOA,GAAQ,UAAY,OAAOA,GAAQ,WAAaA,IAAQ,QAAUA,IAAQ,QAC3FvR,EAAS,OAAOuR,CAAG,GAEbvR,CACR,CAAC,EAGE8qD,IAEH9qD,EAAS,SAAWA,EAAO,QAAQ,WAAY,MAAM,EAAI,UAGnDA,CACR,CAiCA,SAAgB2qD,EAASnlD,EAAwDkI,KAA4C/H,EAAsD,CAClL,OACQqlD,EADJ,OAAOxlD,GAAS,SACJ0lD,EAAc1lD,EAAMkI,CAAO,EAE5BA,EAF+B/H,CAAI,CAGnD,CAOA,SAASulD,EAAcp7C,EAAeq7C,EAAuB,CAC5D,MAAMz9C,KAAUq9C,EAAA,gBAAc,IAAKj7C,CAAK,EACxC,GAAI,OAAOpC,GAAY,SAAU,CAChC,GAAI,OAAOy9C,GAAa,SACvB,OAAOA,EAER,MAAM,IAAI,MAAM,oBAAoBr7C,CAAK,MAAM,CAChD,CACA,OAAOpC,CACR,CAmCA,SAAgBk9C,EAAUplD,EAAwD4lD,KAA4BzlD,EAAsD,CACnK,IAAI+H,EACA,OAAOlI,GAAS,SACnBkI,EAAUw9C,EAAc1lD,EAAM4lD,CAAe,EAE7C19C,EAAU09C,EAGX,MAAM7pD,EAAQypD,EAAQt9C,EAAS/H,CAAI,EAEnC,MAAO,CACN,MAAApE,EACA,SAAU6pD,IAAoB19C,EAAUnM,EAAQypD,EAAQI,EAAiBzlD,CAAI,EAE/E,iWCiDAgI,EAAA,eAAA09C,EAhMa19C,EAAA,iBAAmB,KAEhC,IAAI29C,EAAa,GACbC,EAAe,GACfC,EAAW,GACXC,EAAe,GACfC,EAAY,GACZC,EAAS,GACTC,EAAc,GACdC,EAAS,GACTC,EAAQ,GACRC,EAAY,GACZC,EACAC,EAAoBt+C,EAAA,iBACpBu+C,EAA0Bv+C,EAAA,iBAC1Bw+C,EACAC,EA4BJ,MAAMC,EAAmB,WAEzB,IAAIC,EACA,OAAOD,EAAY,OAAW,KAAe,OAAOA,EAAY,OAAO,QAAY,IAEtFC,EAAcD,EAAY,OAAO,QACvB,OAAO,QAAY,KAAe,OAAO,SAAS,UAAU,MAAS,WAE/EC,EAAc,SAGf,MAAMC,EAAoB,OAAOD,GAAa,UAAU,UAAa,SAC/DE,EAAqBD,GAAqBD,GAAa,OAAS,WAUtE,GAAI,OAAOA,GAAgB,SAAU,CACpChB,EAAcgB,EAAY,WAAa,QACvCf,EAAgBe,EAAY,WAAa,SACzCd,EAAYc,EAAY,WAAa,QACrCb,EAAeD,GAAY,CAAC,CAACc,EAAY,IAAI,MAAW,CAAC,CAACA,EAAY,IAAI,cAC1EV,EAAcW,EACdT,EAAQ,CAAC,CAACQ,EAAY,IAAI,IAAS,CAAC,CAACA,EAAY,IAAI,+BACrDN,EAAUr+C,EAAA,iBACVs+C,EAAYt+C,EAAA,iBACZ,MAAM8+C,EAAeH,EAAY,IAAI,kBACrC,GAAIG,EACH,GAAI,CACH,MAAMC,EAAmC,KAAK,MAAMD,CAAY,EAChET,EAAUU,EAAU,WACpBR,EAAkBQ,EAAU,SAC5BT,EAAYS,EAAU,kBAAoB/+C,EAAA,iBAC1Cw+C,EAA0BO,EAAU,cAAc,sBACnD,MAAY,CACZ,CAEDhB,EAAY,EACb,MAGS,OAAO,WAAc,UAAY,CAACc,GAC1CJ,EAAa,UAAU,UACvBd,EAAac,EAAW,QAAQ,SAAS,GAAK,EAC9Cb,EAAea,EAAW,QAAQ,WAAW,GAAK,EAClDP,GAAUO,EAAW,QAAQ,WAAW,GAAK,GAAKA,EAAW,QAAQ,MAAM,GAAK,GAAKA,EAAW,QAAQ,QAAQ,GAAK,IAAM,CAAC,CAAC,UAAU,gBAAkB,UAAU,eAAiB,EACpLZ,EAAWY,EAAW,QAAQ,OAAO,GAAK,EAC1CL,EAAYK,GAAY,QAAQ,MAAM,GAAK,EAC3CT,EAAS,GACTM,EAAYU,EAAI,eAAc,GAAMh/C,EAAA,iBACpCq+C,EAAU,UAAU,SAAS,YAAW,EACxCE,EAAkBF,GAKlB,QAAQ,MAAM,6BAA6B,EAU5C,IAAIY,EAAS,EACTrB,EACHqB,EAAS,EACCtB,EACVsB,EAAS,EACCpB,IACVoB,EAAS,GAGGj/C,EAAA,UAAY29C,EACZ39C,EAAA,YAAc49C,EACd59C,EAAA,QAAU69C,EACV79C,EAAA,SAAW+9C,EACX/9C,EAAA,MAAQg+C,EACRh+C,EAAA,YAAeg+C,GAAU,OAAOU,EAAY,eAAkB,WAC9D1+C,EAAA,gBAAkBA,EAAA,YAAc0+C,EAAY,OAAS,OACrD1+C,EAAA,MAAQk+C,EACRl+C,EAAA,SAAWo+C,EACXp+C,EAAA,UAAYy+C,EAOZz+C,EAAA,SAAWs+C,EAEXt+C,EAAA,oBAAuB,OAAO0+C,EAAY,aAAgB,YAAc,CAACA,EAAY,cAQrF1+C,EAAA,aAAe,IAAK,CAChC,GAAIA,EAAA,oBAAqB,CAKxB,MAAMk/C,EAA2B,CAAA,EAEjCR,EAAY,iBAAiB,UAAYtoD,GAAU,CAClD,GAAIA,EAAE,MAAQA,EAAE,KAAK,wBACpB,QAASzB,EAAI,EAAGrC,EAAM4sD,EAAQ,OAAQvqD,EAAIrC,EAAKqC,IAAK,CACnD,MAAMwsB,EAAY+9B,EAAQvqD,CAAC,EAC3B,GAAIwsB,EAAU,KAAO/qB,EAAE,KAAK,wBAAyB,CACpD8oD,EAAQ,OAAOvqD,EAAG,CAAC,EACnBwsB,EAAU,SAAQ,EAClB,MACD,CACD,CAEF,CAAC,EACD,IAAIg+B,EAAS,EACb,OAAQ1rD,GAAwB,CAC/B,MAAM2rD,EAAO,EAAED,EACfD,EAAQ,KAAK,CACZ,GAAIE,EACJ,SAAU3rD,EACV,EACDirD,EAAY,YAAY,CAAE,wBAAyBU,CAAI,EAAI,GAAG,CAC/D,CACD,CACA,OAAQ3rD,GAAyB,WAAWA,CAAQ,CACrD,GAAE,EAOWuM,EAAA,GAAM49C,GAAgBM,EAAQ,EAA8BP,EAAY,EAA0B,EAE/G,IAAI0B,EAAkB,GAClBC,EAA0B,GAC9B,SAAgB5B,GAAc,CAC7B,GAAI,CAAC4B,EAAyB,CAC7BA,EAA0B,GAC1B,MAAMC,EAAO,IAAI,WAAW,CAAC,EAC7BA,EAAK,CAAC,EAAI,EACVA,EAAK,CAAC,EAAI,EAEVF,EADa,IAAI,YAAYE,EAAK,MAAM,EAChB,CAAC,IAAO,GACjC,CACA,OAAOF,CACR,CAEar/C,EAAA,SAAW,CAAC,EAAEA,EAAA,WAAaA,EAAA,UAAU,QAAQ,QAAQ,GAAK,GAC1DA,EAAA,UAAY,CAAC,EAAEA,EAAA,WAAaA,EAAA,UAAU,QAAQ,SAAS,GAAK,GAC5DA,EAAA,SAAW,CAAC,EAAE,CAACA,EAAA,UAAaA,EAAA,WAAaA,EAAA,UAAU,QAAQ,QAAQ,GAAK,GACxEA,EAAA,OAAS,CAAC,EAAEA,EAAA,WAAaA,EAAA,UAAU,QAAQ,MAAM,GAAK,GACtDA,EAAA,UAAY,CAAC,EAAEA,EAAA,WAAaA,EAAA,UAAU,QAAQ,SAAS,GAAK,2XC3MzEA,EAAA,WAAAw/C,EAQAx/C,EAAA,wBAAAy/C,EAiDAz/C,EAAA,iBAAA0/C,EAyQA1/C,EAAA,QAAA9G,EAmCA8G,EAAA,kBAAA2/C,EAeA3/C,EAAA,MAAA8F,EAuqBA9F,EAAA,8BAAA4/C,EA3hCA,SAAgBJ,EAAchsD,EAAY,CACzC,MAAO,CAAC,CAACA,GAAO,OAAQA,EAA8B,MAAS,UAChE,CAMA,SAAgBisD,EAA2BhsD,EAAkD,CAC5F,MAAM8F,EAAS,IAAIsmD,EAAA,wBAEbC,EAAWrsD,EAAS8F,EAAO,KAAK,EAChC6f,EAAU,IAAI,QAAW,CAACja,EAASC,IAAU,CAClD,MAAMmY,EAAehe,EAAO,MAAM,wBAAwB,IAAK,CAC9Dge,EAAa,QAAO,EACpBnY,EAAO,IAAIuN,EAAA,iBAAmB,CAC/B,CAAC,EACD,QAAQ,QAAQmzC,CAAQ,EAAE,KAAKlsD,GAAQ,CACtC2jB,EAAa,QAAO,EACpBhe,EAAO,QAAO,EACd4F,EAAQvL,CAAK,CACd,EAAGG,GAAM,CACRwjB,EAAa,QAAO,EACpBhe,EAAO,QAAO,EACd6F,EAAOrL,CAAG,CACX,CAAC,CACF,CAAC,EAED,OAA6B,IAAI,KAAA,CAChC,QAAM,CACLwF,EAAO,OAAM,EACbA,EAAO,QAAO,CACf,CACA,KAAqC4F,EAA2EC,EAA2E,CAC1L,OAAOga,EAAQ,KAAKja,EAASC,CAAM,CACpC,CACA,MAAuBA,EAAyE,CAC/F,OAAO,KAAK,KAAK,OAAWA,CAAM,CACnC,CACA,QAAQ2gD,EAA2C,CAClD,OAAO3mC,EAAQ,QAAQ2mC,CAAS,CACjC,EAEF,CAcA,SAAgBL,EAAoBtmC,EAAqB4mC,EAA0B/vB,EAAgB,CAClG,OAAO,IAAI,QAAQ,CAAC9wB,EAASC,IAAU,CACtC,MAAM6gD,EAAMD,EAAM,wBAAwB,IAAK,CAC9CC,EAAI,QAAO,EACX9gD,EAAQ8wB,CAAY,CACrB,CAAC,EACD7W,EAAQ,KAAKja,EAASC,CAAM,EAAE,QAAQ,IAAM6gD,EAAI,QAAO,CAAE,CAC1D,CAAC,CACF,CAgCA,MAAaC,CAAS,CAQrB,aAAA,CAFQ,KAAA,WAAa,GAGpB,KAAK,cAAgB,KACrB,KAAK,cAAgB,KACrB,KAAK,qBAAuB,IAC7B,CAEA,MAASC,EAAiC,CACzC,GAAI,KAAK,WACR,OAAO,QAAQ,OAAO,IAAI,MAAM,uBAAuB,CAAC,EAGzD,GAAI,KAAK,cAAe,CAGvB,GAFA,KAAK,qBAAuBA,EAExB,CAAC,KAAK,cAAe,CACxB,MAAMC,EAAa,IAAK,CAGvB,GAFA,KAAK,cAAgB,KAEjB,KAAK,WACR,OAGD,MAAM/tD,EAAS,KAAK,MAAM,KAAK,oBAAqB,EACpD,YAAK,qBAAuB,KAErBA,CACR,EAEA,KAAK,cAAgB,IAAI,QAAQ8M,GAAU,CAC1C,KAAK,cAAe,KAAKihD,EAAYA,CAAU,EAAE,KAAKjhD,CAAO,CAC9D,CAAC,CACF,CAEA,OAAO,IAAI,QAAQ,CAACA,EAASC,IAAU,CACtC,KAAK,cAAe,KAAKD,EAASC,CAAM,CACzC,CAAC,CACF,CAEA,YAAK,cAAgB+gD,EAAc,EAE5B,IAAI,QAAQ,CAAChhD,EAASC,IAAU,CACtC,KAAK,cAAe,KAAM/M,GAAa,CACtC,KAAK,cAAgB,KACrB8M,EAAQ9M,CAAM,CACf,EAAI0B,GAAgB,CACnB,KAAK,cAAgB,KACrBqL,EAAOrL,CAAG,CACX,CAAC,CACF,CAAC,CACF,CAEA,SAAO,CACN,KAAK,WAAa,EACnB,EA7DDiM,EAAA,UAAAkgD,EAoEA,MAAMG,EAAkB,CAACnnD,EAAiB2T,IAAmC,CAC5E,IAAIyzC,EAAY,GAChB,MAAM9oC,EAAS,WAAW,IAAK,CAC9B8oC,EAAY,GACZzzC,EAAE,CACH,EAAG3T,CAAO,EACV,MAAO,CACN,YAAa,IAAMonD,EACnB,QAAS,IAAK,CACb,aAAa9oC,CAAM,EACnB8oC,EAAY,EACb,EAEF,EAEMC,EAAqB1zC,GAAmC,CAC7D,IAAIyzC,EAAY,GAChB,sBAAe,IAAK,CACfA,IACHA,EAAY,GACZzzC,EAAE,EAEJ,CAAC,EAEM,CACN,YAAa,IAAMyzC,EACnB,QAAS,IAAK,CAAGA,EAAY,EAAO,EAEtC,EAyBA,MAAaE,CAAO,CAQnB,YAAmBC,EAA4C,CAA5C,KAAA,aAAAA,EAClB,KAAK,SAAW,KAChB,KAAK,kBAAoB,KACzB,KAAK,UAAY,KACjB,KAAK,SAAW,KAChB,KAAK,KAAO,IACb,CAEA,QAAQC,EAA6BvpC,EAAQ,KAAK,aAAY,CAC7D,KAAK,KAAOupC,EACZ,KAAK,cAAa,EAEb,KAAK,oBACT,KAAK,kBAAoB,IAAI,QAAQ,CAACvhD,EAASC,IAAU,CACxD,KAAK,UAAYD,EACjB,KAAK,SAAWC,CACjB,CAAC,EAAE,KAAK,IAAK,CAGZ,GAFA,KAAK,kBAAoB,KACzB,KAAK,UAAY,KACb,KAAK,KAAM,CACd,MAAMshD,EAAO,KAAK,KAClB,YAAK,KAAO,KACLA,EAAI,CACZ,CAED,CAAC,GAGF,MAAM7zC,EAAK,IAAK,CACf,KAAK,SAAW,KAChB,KAAK,YAAY,IAAI,CACtB,EAEA,YAAK,SAAWsK,IAAUwpC,EAAA,eAAiBJ,EAAkB1zC,CAAE,EAAIwzC,EAAgBlpC,EAAOtK,CAAE,EAErF,KAAK,iBACb,CAEA,aAAW,CACV,MAAO,CAAC,CAAC,KAAK,UAAU,YAAW,CACpC,CAEA,QAAM,CACL,KAAK,cAAa,EAEd,KAAK,oBACR,KAAK,WAAW,IAAIF,EAAA,iBAAmB,EACvC,KAAK,kBAAoB,KAE3B,CAEQ,eAAa,CACpB,KAAK,UAAU,QAAO,EACtB,KAAK,SAAW,IACjB,CAEA,SAAO,CACN,KAAK,OAAM,CACZ,EAlED3M,EAAA,QAAAwgD,EA8EA,MAAaI,CAAgB,CAK5B,YAAYH,EAAoB,CAC/B,KAAK,QAAU,IAAID,EAAQC,CAAY,EACvC,KAAK,UAAY,IAAIP,CACtB,CAEA,QAAQC,EAAmChpC,EAAc,CACxD,OAAO,KAAK,QAAQ,QAAQ,IAAM,KAAK,UAAU,MAAMgpC,CAAc,EAAGhpC,CAAK,CAC9E,CAEA,QAAM,CACL,KAAK,QAAQ,OAAM,CACpB,CAEA,SAAO,CACN,KAAK,QAAQ,QAAO,EACpB,KAAK,UAAU,QAAO,CACvB,EArBDnX,EAAA,iBAAA4gD,EA0BA,SAAgB1nD,EAAQ2nD,EAAgBb,EAAyB,CAChE,OAAKA,EAIE,IAAI,QAAQ,CAAC7gD,EAASC,IAAU,CACtC,MAAMoY,EAAS,WAAW,IAAK,CAC9B5F,EAAW,QAAO,EAClBzS,EAAO,CACR,EAAG0hD,CAAM,EACHjvC,EAAaouC,EAAM,wBAAwB,IAAK,CACrD,aAAaxoC,CAAM,EACnB5F,EAAW,QAAO,EAClBxS,EAAO,IAAIuN,EAAA,iBAAmB,CAC/B,CAAC,CACF,CAAC,EAbO8yC,EAAwBO,GAAS9mD,EAAQ2nD,EAAQb,CAAK,CAAC,CAchE,CAmBA,SAAgBL,EAAkBpmC,EAAqBrgB,EAAU,EAAGge,EAAuB,CAC1F,MAAM4pC,EAAQ,WAAW,IAAK,CAC7BvnC,EAAO,EACHrC,GACHtF,EAAW,QAAO,CAEpB,EAAG1Y,CAAO,EACJ0Y,KAAa+D,EAAA,cAAa,IAAK,CACpC,aAAamrC,CAAK,EAClB5pC,GAAO,cAActF,CAAU,CAChC,CAAC,EACD,OAAAsF,GAAO,IAAItF,CAAU,EACdA,CACR,CAEA,SAAgB9L,EAASi7C,EAAuCC,EAAgCr5C,GAAK,CAAC,CAACA,EAAGsoB,EAAyB,KAAI,CACtI,IAAI9tB,EAAQ,EACZ,MAAM7P,EAAMyuD,EAAiB,OAEvBrnB,EAAgC,IAAK,CAC1C,GAAIv3B,GAAS7P,EACZ,OAAO,QAAQ,QAAQ29B,CAAY,EAGpC,MAAMqsB,EAAUyE,EAAiB5+C,GAAO,EAGxC,OAFgB,QAAQ,QAAQm6C,EAAO,CAAE,EAE1B,KAAKjqD,GACf2uD,EAAW3uD,CAAM,EACb,QAAQ,QAAQA,CAAM,EAGvBqnC,EAAI,CACX,CACF,EAEA,OAAOA,EAAI,CACZ,CAEA,MAAaunB,CAAY,CAMxB,YAAYC,EAAqBhoD,EAAgB,CAJzC,KAAA,YAAc,GAKrB,KAAK,OAAS,GAEV,OAAOgoD,GAAW,YAAc,OAAOhoD,GAAY,UACtD,KAAK,YAAYgoD,EAAQhoD,CAAO,CAElC,CAEA,SAAO,CACN,KAAK,OAAM,EACX,KAAK,YAAc,EACpB,CAEA,QAAM,CACD,KAAK,SAAW,KACnB,aAAa,KAAK,MAAM,EACxB,KAAK,OAAS,GAEhB,CAEA,aAAagoD,EAAoBhoD,EAAe,CAC/C,GAAI,KAAK,YACR,MAAM,IAAIyT,EAAA,mBAAmB,mDAAmD,EAGjF,KAAK,OAAM,EACX,KAAK,OAAS,WAAW,IAAK,CAC7B,KAAK,OAAS,GACdu0C,EAAM,CACP,EAAGhoD,CAAO,CACX,CAEA,YAAYgoD,EAAoBhoD,EAAe,CAC9C,GAAI,KAAK,YACR,MAAM,IAAIyT,EAAA,mBAAmB,kDAAkD,EAG5E,KAAK,SAAW,KAIpB,KAAK,OAAS,WAAW,IAAK,CAC7B,KAAK,OAAS,GACdu0C,EAAM,CACP,EAAGhoD,CAAO,EACX,EAnDD8G,EAAA,aAAAihD,EAsDA,MAAaE,CAAa,CAA1B,aAAA,CAES,KAAA,WAAsC,OACtC,KAAA,WAAa,EA2BtB,CAzBC,QAAM,CACL,KAAK,YAAY,QAAO,EACxB,KAAK,WAAa,MACnB,CAEA,aAAaD,EAAoBE,EAAkB5kC,EAAU,WAAU,CACtE,GAAI,KAAK,WACR,MAAM,IAAI7P,EAAA,mBAAmB,oDAAoD,EAGlF,KAAK,OAAM,EACX,MAAM6K,EAASgF,EAAQ,YAAY,IAAK,CACvC0kC,EAAM,CACP,EAAGE,CAAQ,EAEX,KAAK,cAAazrC,EAAA,cAAa,IAAK,CACnC6G,EAAQ,cAAchF,CAAM,EAC5B,KAAK,WAAa,MACnB,CAAC,CACF,CAEA,SAAO,CACN,KAAK,OAAM,EACX,KAAK,WAAa,EACnB,EA7BDxX,EAAA,cAAAmhD,EAgCA,MAAaE,CAAgB,CAQ5B,YAAYH,EAAkC/pC,EAAa,CAC1D,KAAK,aAAe,GACpB,KAAK,OAAS+pC,EACd,KAAK,QAAU/pC,EACf,KAAK,eAAiB,KAAK,UAAU,KAAK,IAAI,CAC/C,CAKA,SAAO,CACN,KAAK,OAAM,EACX,KAAK,OAAS,IACf,CAKA,QAAM,CACD,KAAK,YAAW,IACnB,aAAa,KAAK,YAAY,EAC9B,KAAK,aAAe,GAEtB,CAKA,SAASA,EAAQ,KAAK,QAAO,CAC5B,KAAK,OAAM,EACX,KAAK,aAAe,WAAW,KAAK,eAAgBA,CAAK,CAC1D,CAEA,IAAI,OAAK,CACR,OAAO,KAAK,OACb,CAEA,IAAI,MAAMvjB,EAAa,CACtB,KAAK,QAAUA,CAChB,CAKA,aAAW,CACV,OAAO,KAAK,eAAiB,EAC9B,CAEQ,WAAS,CAChB,KAAK,aAAe,GAChB,KAAK,QACR,KAAK,MAAK,CAEZ,CAEU,OAAK,CACd,KAAK,SAAQ,CACd,EAjEDoM,EAAA,iBAAAqhD,EAuGC,UAAA,CACI,OAAO,WAAW,qBAAwB,YAAc,OAAO,WAAW,oBAAuB,WACpGrhD,EAAA,aAAe,CAACshD,EAAeJ,IAAU,IACxCK,EAAA,aAAY,IAAK,CAChB,GAAIC,EACH,OAED,MAAM3lC,EAAM,KAAK,IAAG,EAAK,GAOzBqlC,EAAO,OAAO,OANiB,CAC9B,WAAY,GACZ,eAAa,CACZ,OAAO,KAAK,IAAI,EAAGrlC,EAAM,KAAK,IAAG,CAAE,CACpC,EAE4B,CAAC,CAC/B,CAAC,EACD,IAAI2lC,EAAW,GACf,MAAO,CACN,SAAO,CACFA,IAGJA,EAAW,GACZ,EAEF,EAEAxhD,EAAA,aAAe,CAACyhD,EAAuBP,EAAQhoD,IAAY,CAC1D,MAAMse,EAAiBiqC,EAAa,oBAAoBP,EAAQ,OAAOhoD,GAAY,SAAW,CAAE,QAAAA,CAAO,EAAK,MAAS,EACrH,IAAIsoD,EAAW,GACf,MAAO,CACN,SAAO,CACFA,IAGJA,EAAW,GACXC,EAAa,mBAAmBjqC,CAAM,EACvC,EAEF,EAEDxX,EAAA,kBAAqBkhD,MAAWlhD,EAAA,cAAa,WAAYkhD,CAAM,CAChE,EAAE,EAEF,MAAsBQ,CAAiB,CAStC,YAAYD,EAAuB7wC,EAAiB,CAJ5C,KAAA,QAAmB,GAK1B,KAAK,UAAY,IAAK,CACrB,GAAI,CACH,KAAK,OAASA,EAAQ,CACvB,OAAS7c,EAAK,CACb,KAAK,OAASA,CACf,SACC,KAAK,QAAU,EAChB,CACD,EACA,KAAK,WAAUiM,EAAA,cAAayhD,EAAc,IAAM,KAAK,UAAS,CAAE,CACjE,CAEA,SAAO,CACN,KAAK,QAAQ,QAAO,CACrB,CAEA,IAAI,OAAK,CAKR,GAJK,KAAK,UACT,KAAK,QAAQ,QAAO,EACpB,KAAK,UAAS,GAEX,KAAK,OACR,MAAM,KAAK,OAEZ,OAAO,KAAK,MACb,CAEA,IAAI,eAAa,CAChB,OAAO,KAAK,OACb,EAvCDzhD,EAAA,kBAAA0hD,EAgDA,MAAaC,UAA2BD,CAAoB,CAE3D,YAAY9wC,EAAiB,CAC5B,MAAM,WAAYA,CAAQ,CAC3B,EAJD5Q,EAAA,gBAAA2hD,EAqBA,MAAaC,CAAe,CAM3B,IAAW,YAAU,CACpB,OAAO,KAAK,SAAS,UAAO,CAC7B,CAEA,IAAW,WAAS,CACnB,MAAO,CAAC,CAAC,KAAK,OACf,CAIA,aAAA,CACC,KAAK,EAAI,IAAI,QAAW,CAAC1pD,EAAG9B,IAAK,CAChC,KAAK,iBAAmB8B,EACxB,KAAK,cAAgB9B,CACtB,CAAC,CACF,CAEO,SAASxC,EAAQ,CACvB,OAAO,IAAI,QAAcuL,GAAU,CAClC,KAAK,iBAAiBvL,CAAK,EAC3B,KAAK,QAAU,CAAE,QAAO,EAA4B,MAAAA,CAAK,EACzDuL,EAAO,CACR,CAAC,CACF,CAEO,MAAMpL,EAAY,CACxB,OAAO,IAAI,QAAcoL,GAAU,CAClC,KAAK,cAAcpL,CAAG,EACtB,KAAK,QAAU,CAAE,QAAO,EAA4B,MAAOA,CAAG,EAC9DoL,EAAO,CACR,CAAC,CACF,CAEO,QAAM,CACZ,OAAO,KAAK,MAAM,IAAIwN,EAAA,iBAAmB,CAC1C,EAzCD3M,EAAA,gBAAA4hD,EAgDA,IAAiBC,GAAjB,SAAiBA,EAAQ,CASjB,eAAeC,EAAWC,EAAsB,CACtD,IAAIC,EAEJ,MAAM3vD,EAAS,MAAM,QAAQ,IAAI0vD,EAAS,IAAI3oC,GAAWA,EAAQ,KAAKxlB,GAASA,EAAOgJ,GAAQ,CACxFolD,IACJA,EAAaplD,EAIf,CAAC,CAAC,CAAC,EAEH,GAAI,OAAOolD,EAAe,IACzB,MAAMA,EAGP,OAAO3vD,CACR,CAhBsBwvD,EAAA,QAAOC,EA4B7B,SAAgBG,EAA4BC,EAA2F,CAEtI,OAAO,IAAI,QAAW,MAAO/iD,EAASC,IAAU,CAC/C,GAAI,CACH,MAAM8iD,EAAO/iD,EAASC,CAAM,CAC7B,OAASxC,EAAO,CACfwC,EAAOxC,CAAK,CACb,CACD,CAAC,CACF,CATgBilD,EAAA,cAAaI,CAU9B,GA/CiBJ,IAAQ7hD,EAAA,SAAR6hD,EAAQ,CAAA,EAAA,EAkGzB,MAAaM,CAAmB,CAExB,OAAO,UAAa9+C,EAAU,CACpC,OAAO,IAAI8+C,EAAwBC,GAAU,CAC5CA,EAAO,SAAS/+C,CAAK,CACtB,CAAC,CACF,CAEO,OAAO,YAAe+V,EAAqB,CACjD,OAAO,IAAI+oC,EAAuB,MAAOnrC,GAAW,CACnDA,EAAQ,SAAS,MAAMoC,CAAO,CAC/B,CAAC,CACF,CAEO,OAAO,aAAgB2oC,EAAsB,CACnD,OAAO,IAAII,EAAuB,MAAOnrC,GAAW,CACnD,MAAM,QAAQ,IAAI+qC,EAAS,IAAI,MAAOl5C,GAAMmO,EAAQ,QAAQ,MAAMnO,CAAC,CAAC,CAAC,CACtE,CAAC,CACF,CAEO,OAAO,MAASoF,EAA6B,CACnD,OAAO,IAAIk0C,EAAoB,MAAOnrC,GAAW,CAChD,MAAM,QAAQ,IAAI/I,EAAU,IAAI,MAAOR,GAAY,CAClD,gBAAiBlK,KAAQkK,EACxBuJ,EAAQ,QAAQzT,CAAI,CAEtB,CAAC,CAAC,CACH,CAAC,CACF,QAEc,KAAA,MAAQ4+C,EAAoB,UAAe,CAAA,CAAE,CAAE,CAQ7D,YAAYvxC,EAAoCyxC,EAAqC,CACpF,KAAK,OAAM,EACX,KAAK,SAAW,CAAA,EAChB,KAAK,OAAS,KACd,KAAK,UAAYA,EACjB,KAAK,gBAAkB,IAAIzlC,EAAA,QAE3B,eAAe,SAAW,CACzB,MAAMwlC,EAAkC,CACvC,QAAU7+C,GAAS,KAAK,QAAQA,CAAI,EACpC,SAAWF,GAAU,KAAK,SAASA,CAAK,EACxC,OAASzG,GAAU,KAAK,OAAOA,CAAK,GAErC,GAAI,CACH,MAAM,QAAQ,QAAQgU,EAASwxC,CAAM,CAAC,EACtC,KAAK,QAAO,CACb,OAASruD,EAAK,CACb,KAAK,OAAOA,CAAG,CAChB,SACCquD,EAAO,QAAU,OACjBA,EAAO,SAAW,OAClBA,EAAO,OAAS,MACjB,CACD,CAAC,CACF,CAEA,CAAC,OAAO,aAAa,GAAC,CACrB,IAAIztD,EAAI,EACR,MAAO,CACN,KAAM,SAAW,CAChB,EAAG,CACF,GAAI,KAAK,SAAM,EACd,MAAM,KAAK,OAEZ,GAAIA,EAAI,KAAK,SAAS,OACrB,MAAO,CAAE,KAAM,GAAO,MAAO,KAAK,SAASA,GAAG,CAAC,EAEhD,GAAI,KAAK,SAAM,EACd,MAAO,CAAE,KAAM,GAAM,MAAO,MAAS,EAEtC,MAAMioB,EAAA,MAAM,UAAU,KAAK,gBAAgB,KAAK,CACjD,OAAS,GACV,EACA,OAAQ,UACP,KAAK,YAAW,EACT,CAAE,KAAM,GAAM,MAAO,MAAS,GAGxC,CAEO,OAAO,IAAUnP,EAA4B5H,EAAqB,CACxE,OAAO,IAAIs8C,EAAuB,MAAOnrC,GAAW,CACnD,gBAAiBzT,KAAQkK,EACxBuJ,EAAQ,QAAQnR,EAAMtC,CAAI,CAAC,CAE7B,CAAC,CACF,CAEO,IAAOsC,EAAqB,CAClC,OAAOs8C,EAAoB,IAAI,KAAMt8C,CAAK,CAC3C,CAEO,OAAO,OAAU4H,EAA4B60C,EAA8B,CACjF,OAAO,IAAIH,EAAuB,MAAOnrC,GAAW,CACnD,gBAAiBzT,KAAQkK,EACpB60C,EAAS/+C,CAAI,GAChByT,EAAQ,QAAQzT,CAAI,CAGvB,CAAC,CACF,CAEO,OAAO++C,EAA8B,CAC3C,OAAOH,EAAoB,OAAO,KAAMG,CAAQ,CACjD,CAEO,OAAO,SAAY70C,EAA6C,CACtE,OAA+B00C,EAAoB,OAAO10C,EAAUlK,GAAQ,CAAC,CAACA,CAAI,CACnF,CAEO,UAAQ,CACd,OAAO4+C,EAAoB,SAAS,IAAI,CACzC,CAEO,aAAa,UAAa10C,EAA0B,CAC1D,MAAMpb,EAAc,CAAA,EACpB,gBAAiBkR,KAAQkK,EACxBpb,EAAO,KAAKkR,CAAI,EAEjB,OAAOlR,CACR,CAEO,WAAS,CACf,OAAO8vD,EAAoB,UAAU,IAAI,CAC1C,CAOQ,QAAQvuD,EAAQ,CACnB,KAAK,SAAM,IAKf,KAAK,SAAS,KAAKA,CAAK,EACxB,KAAK,gBAAgB,KAAI,EAC1B,CAOQ,SAASuhB,EAAW,CACvB,KAAK,SAAM,IAKf,KAAK,SAAW,KAAK,SAAS,OAAOA,CAAM,EAC3C,KAAK,gBAAgB,KAAI,EAC1B,CAQQ,SAAO,CACV,KAAK,SAAM,IAGf,KAAK,OAAM,EACX,KAAK,gBAAgB,KAAI,EAC1B,CAQQ,OAAOvY,EAAY,CACtB,KAAK,SAAM,IAGf,KAAK,OAAM,EACX,KAAK,OAASA,EACd,KAAK,gBAAgB,KAAI,EAC1B,EA/LDoD,EAAA,oBAAAmiD,EAkMA,MAAaI,UAAyCJ,CAAsB,CAC3E,YACkBK,EACjB5xC,EAAkC,CAElC,MAAMA,CAAQ,EAHG,KAAA,QAAA4xC,CAIlB,CAEA,QAAM,CACL,KAAK,QAAQ,OAAM,CACpB,EAVDxiD,EAAA,8BAAAuiD,EAaA,SAAgB3C,EAAiCnsD,EAAwD,CACxG,MAAM8F,EAAS,IAAIsmD,EAAA,wBACb4C,EAAgBhvD,EAAS8F,EAAO,KAAK,EAE3C,OAAO,IAAIgpD,EAAiChpD,EAAQ,MAAOyd,GAAW,CACrE,MAAMO,EAAehe,EAAO,MAAM,wBAAwB,IAAK,CAC9Dge,EAAa,QAAO,EACpBhe,EAAO,QAAO,EACdyd,EAAQ,OAAO,IAAIrK,EAAA,iBAAmB,CACvC,CAAC,EACD,GAAI,CACH,gBAAiBpJ,KAAQk/C,EAAe,CACvC,GAAIlpD,EAAO,MAAM,wBAEhB,OAEDyd,EAAQ,QAAQzT,CAAI,CACrB,CACAgU,EAAa,QAAO,EACpBhe,EAAO,QAAO,CACf,OAASxF,EAAK,CACbwjB,EAAa,QAAO,EACpBhe,EAAO,QAAO,EACdyd,EAAQ,OAAOjjB,CAAG,CACnB,CACD,CAAC,CACF,oIC1jCA,IAAI2uD,EAIJ,MAAMC,EAAgB,WAAmB,OACzC,GAAI,OAAOA,EAAiB,KAAe,OAAOA,EAAa,QAAY,IAAa,CACvF,MAAMC,EAA+BD,EAAa,QAClDD,EAAc,CACb,IAAI,UAAQ,CAAK,OAAOE,EAAe,QAAU,EACjD,IAAI,MAAI,CAAK,OAAOA,EAAe,IAAM,EACzC,IAAI,KAAG,CAAK,OAAOA,EAAe,GAAK,EACvC,KAAG,CAAK,OAAOA,EAAe,IAAG,CAAI,EAEvC,MAGS,OAAO,QAAY,KAAe,OAAO,SAAS,UAAU,MAAS,SAC7EF,EAAc,CACb,IAAI,UAAQ,CAAK,OAAO,QAAQ,QAAU,EAC1C,IAAI,MAAI,CAAK,OAAO,QAAQ,IAAM,EAClC,IAAI,KAAG,CAAK,OAAO,QAAQ,GAAK,EAChC,KAAG,CAAK,OAAO,QAAQ,IAAI,YAAiB,QAAQ,IAAG,CAAI,GAM5DA,EAAc,CAGb,IAAI,UAAQ,CAAK,OAAOnB,EAAA,UAAY,QAAUA,EAAA,YAAc,SAAW,OAAS,EAChF,IAAI,MAAI,CAAsD,EAG9D,IAAI,KAAG,CAAK,MAAO,CAAA,CAAI,EACvB,KAAG,CAAK,MAAO,GAAK,GAYTvhD,EAAA,IAAM0iD,EAAY,IAQlB1iD,EAAA,IAAM0iD,EAAY,IAMlB1iD,EAAA,SAAW0iD,EAAY,iNCjCpC,MAAMG,EAAmB,GACnBC,EAAmB,GACnBC,EAAmB,GACnBC,EAAmB,IACnBC,EAAW,GACXC,EAAqB,GACrBC,EAAsB,GACtBC,EAAa,GACbC,EAAqB,GAE3B,MAAMC,UAA4B,KAAK,CAEtC,YAAYt3C,EAAcu3C,EAAkBC,EAAe,CAE1D,IAAIC,EACA,OAAOF,GAAa,UAAYA,EAAS,QAAQ,MAAM,IAAM,GAChEE,EAAa,cACbF,EAAWA,EAAS,QAAQ,QAAS,EAAE,GAEvCE,EAAa,UAGd,MAAM7wD,EAAOoZ,EAAK,QAAQ,GAAG,IAAM,GAAK,WAAa,WACrD,IAAIrM,EAAM,QAAQqM,CAAI,KAAKpZ,CAAI,IAAI6wD,CAAU,YAAYF,CAAQ,GAEjE5jD,GAAO,mBAAmB,OAAO6jD,CAAM,GACvC,MAAM7jD,CAAG,EAET,KAAK,KAAO,sBACb,EAGD,SAAS+jD,EAAeC,EAAoB33C,EAAY,CACvD,GAAI23C,IAAe,MAAQ,OAAOA,GAAe,SAChD,MAAM,IAAIL,EAAoBt3C,EAAM,SAAU23C,CAAU,CAE1D,CAEA,SAASC,EAAehwD,EAAeoY,EAAY,CAClD,GAAI,OAAOpY,GAAU,SACpB,MAAM,IAAI0vD,EAAoBt3C,EAAM,SAAUpY,CAAK,CAErD,CAEA,MAAMiwD,EAAmBC,EAAQ,WAAa,QAE9C,SAASC,EAAgB7iC,EAAwB,CAChD,OAAOA,IAASgiC,GAAsBhiC,IAASiiC,CAChD,CAEA,SAASa,EAAqB9iC,EAAwB,CACrD,OAAOA,IAASgiC,CACjB,CAEA,SAASe,EAAoB/iC,EAAY,CACxC,OAAQA,GAAQ2hC,GAAoB3hC,GAAQ6hC,GAC1C7hC,GAAQ4hC,GAAoB5hC,GAAQ8hC,CACvC,CAGA,SAASkB,EAAgB7sD,EAAc8sD,EAAyBC,EAAmBL,EAA2C,CAC7H,IAAIvwC,EAAM,GACN6wC,EAAoB,EACpBrqD,EAAY,GACZsqD,EAAO,EACPpjC,EAAO,EACX,QAASvsB,EAAI,EAAGA,GAAK0C,EAAK,OAAQ,EAAE1C,EAAG,CACtC,GAAIA,EAAI0C,EAAK,OACZ6pB,EAAO7pB,EAAK,WAAW1C,CAAC,MAEpB,IAAIovD,EAAgB7iC,CAAI,EAC5B,MAGAA,EAAOgiC,EAGR,GAAIa,EAAgB7iC,CAAI,EAAG,CAC1B,GAAI,EAAAlnB,IAAcrF,EAAI,GAAK2vD,IAAS,GAE7B,GAAIA,IAAS,EAAG,CACtB,GAAI9wC,EAAI,OAAS,GAAK6wC,IAAsB,GAC3C7wC,EAAI,WAAWA,EAAI,OAAS,CAAC,IAAMyvC,GACnCzvC,EAAI,WAAWA,EAAI,OAAS,CAAC,IAAMyvC,GACnC,GAAIzvC,EAAI,OAAS,EAAG,CACnB,MAAM+wC,EAAiB/wC,EAAI,YAAY4wC,CAAS,EAC5CG,IAAmB,IACtB/wC,EAAM,GACN6wC,EAAoB,IAEpB7wC,EAAMA,EAAI,MAAM,EAAG+wC,CAAc,EACjCF,EAAoB7wC,EAAI,OAAS,EAAIA,EAAI,YAAY4wC,CAAS,GAE/DpqD,EAAYrF,EACZ2vD,EAAO,EACP,QACD,SAAW9wC,EAAI,SAAW,EAAG,CAC5BA,EAAM,GACN6wC,EAAoB,EACpBrqD,EAAYrF,EACZ2vD,EAAO,EACP,QACD,EAEGH,IACH3wC,GAAOA,EAAI,OAAS,EAAI,GAAG4wC,CAAS,KAAO,KAC3CC,EAAoB,EAEtB,MACK7wC,EAAI,OAAS,EAChBA,GAAO,GAAG4wC,CAAS,GAAG/sD,EAAK,MAAM2C,EAAY,EAAGrF,CAAC,CAAC,GAGlD6e,EAAMnc,EAAK,MAAM2C,EAAY,EAAGrF,CAAC,EAElC0vD,EAAoB1vD,EAAIqF,EAAY,EAErCA,EAAYrF,EACZ2vD,EAAO,CACR,MAAWpjC,IAAS+hC,GAAYqB,IAAS,GACxC,EAAEA,EAEFA,EAAO,EAET,CACA,OAAO9wC,CACR,CAEA,SAASgxC,EAAUC,EAAW,CAC7B,OAAOA,EAAM,GAAGA,EAAI,CAAC,IAAM,IAAM,GAAK,GAAG,GAAGA,CAAG,GAAK,EACrD,CAEA,SAASpH,EAAQjmB,EAAausB,EAAsB,CACnDD,EAAeC,EAAY,YAAY,EACvC,MAAMe,EAAMf,EAAW,KAAOA,EAAW,KACnCvvD,EAAOuvD,EAAW,MACvB,GAAGA,EAAW,MAAQ,EAAE,GAAGa,EAAUb,EAAW,GAAG,CAAC,GACrD,OAAKe,EAGEA,IAAQf,EAAW,KAAO,GAAGe,CAAG,GAAGtwD,CAAI,GAAK,GAAGswD,CAAG,GAAGttB,CAAG,GAAGhjC,CAAI,GAF9DA,CAGT,CA4Ba4L,EAAA,MAAe,CAE3B,WAAW2kD,EAAsB,CAChC,IAAIC,EAAiB,GACjBC,EAAe,GACfC,EAAmB,GAEvB,QAASnwD,EAAIgwD,EAAa,OAAS,EAAGhwD,GAAK,GAAIA,IAAK,CACnD,IAAI0C,EACJ,GAAI1C,GAAK,GAKR,GAJA0C,EAAOstD,EAAahwD,CAAC,EACrBivD,EAAevsD,EAAM,SAAS1C,CAAC,GAAG,EAG9B0C,EAAK,SAAW,EACnB,cAESutD,EAAe,SAAW,EACpCvtD,EAAOysD,EAAQ,IAAG,GAOlBzsD,EAAOysD,EAAQ,IAAI,IAAIc,CAAc,EAAE,GAAKd,EAAQ,IAAG,GAInDzsD,IAAS,QACXA,EAAK,MAAM,EAAG,CAAC,EAAE,YAAW,IAAOutD,EAAe,YAAW,GAC7DvtD,EAAK,WAAW,CAAC,IAAM8rD,KACxB9rD,EAAO,GAAGutD,CAAc,OAI1B,MAAMtyD,EAAM+E,EAAK,OACjB,IAAI0tD,EAAU,EACVC,EAAS,GACTC,EAAa,GACjB,MAAM/jC,EAAO7pB,EAAK,WAAW,CAAC,EAG9B,GAAI/E,IAAQ,EACPyxD,EAAgB7iC,CAAI,IAEvB6jC,EAAU,EACVE,EAAa,YAEJlB,EAAgB7iC,CAAI,EAO9B,GAFA+jC,EAAa,GAETlB,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,EAAG,CAExC,IAAInC,EAAI,EACJkN,EAAOlN,EAEX,KAAOA,EAAI5C,GAAO,CAACyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACpDA,IAED,GAAIA,EAAI5C,GAAO4C,IAAMkN,EAAM,CAC1B,MAAMoO,EAAYnZ,EAAK,MAAM+K,EAAMlN,CAAC,EAIpC,IAFAkN,EAAOlN,EAEAA,EAAI5C,GAAOyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACnDA,IAED,GAAIA,EAAI5C,GAAO4C,IAAMkN,EAAM,CAI1B,IAFAA,EAAOlN,EAEAA,EAAI5C,GAAO,CAACyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACpDA,KAEGA,IAAM5C,GAAO4C,IAAMkN,KAEtB4iD,EAAS,OAAOx0C,CAAS,KAAKnZ,EAAK,MAAM+K,EAAMlN,CAAC,CAAC,GACjD6vD,EAAU7vD,EAEZ,CACD,CACD,MACC6vD,EAAU,OAEDd,EAAoB/iC,CAAI,GAClC7pB,EAAK,WAAW,CAAC,IAAM+rD,IAEvB4B,EAAS3tD,EAAK,MAAM,EAAG,CAAC,EACxB0tD,EAAU,EACNzyD,EAAM,GAAKyxD,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,IAGhD4tD,EAAa,GACbF,EAAU,IAIZ,GAAIC,EAAO,OAAS,EACnB,GAAIJ,EAAe,OAAS,GAC3B,GAAII,EAAO,YAAW,IAAOJ,EAAe,YAAW,EAEtD,cAGDA,EAAiBI,EAInB,GAAIF,GACH,GAAIF,EAAe,OAAS,EAC3B,cAGDC,EAAe,GAAGxtD,EAAK,MAAM0tD,CAAO,CAAC,KAAKF,CAAY,GACtDC,EAAmBG,EACfA,GAAcL,EAAe,OAAS,EACzC,KAGH,CAOA,OAAAC,EAAeX,EAAgBW,EAAc,CAACC,EAAkB,KAC/Df,CAAe,EAETe,EACN,GAAGF,CAAc,KAAKC,CAAY,GAClC,GAAGD,CAAc,GAAGC,CAAY,IAAM,GACxC,EAEA,UAAUxtD,EAAY,CACrBusD,EAAevsD,EAAM,MAAM,EAC3B,MAAM/E,EAAM+E,EAAK,OACjB,GAAI/E,IAAQ,EACX,MAAO,IAER,IAAIyyD,EAAU,EACVC,EACAC,EAAa,GACjB,MAAM/jC,EAAO7pB,EAAK,WAAW,CAAC,EAG9B,GAAI/E,IAAQ,EAGX,OAAO0xD,EAAqB9iC,CAAI,EAAI,KAAO7pB,EAE5C,GAAI0sD,EAAgB7iC,CAAI,EAOvB,GAFA+jC,EAAa,GAETlB,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,EAAG,CAExC,IAAInC,EAAI,EACJkN,EAAOlN,EAEX,KAAOA,EAAI5C,GAAO,CAACyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACpDA,IAED,GAAIA,EAAI5C,GAAO4C,IAAMkN,EAAM,CAC1B,MAAMoO,EAAYnZ,EAAK,MAAM+K,EAAMlN,CAAC,EAIpC,IAFAkN,EAAOlN,EAEAA,EAAI5C,GAAOyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACnDA,IAED,GAAIA,EAAI5C,GAAO4C,IAAMkN,EAAM,CAI1B,IAFAA,EAAOlN,EAEAA,EAAI5C,GAAO,CAACyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACpDA,IAED,GAAIA,IAAM5C,EAIT,MAAO,OAAOke,CAAS,KAAKnZ,EAAK,MAAM+K,CAAI,CAAC,KAEzClN,IAAMkN,IAET4iD,EAAS,OAAOx0C,CAAS,KAAKnZ,EAAK,MAAM+K,EAAMlN,CAAC,CAAC,GACjD6vD,EAAU7vD,EAEZ,CACD,CACD,MACC6vD,EAAU,OAEDd,EAAoB/iC,CAAI,GAAK7pB,EAAK,WAAW,CAAC,IAAM+rD,IAE9D4B,EAAS3tD,EAAK,MAAM,EAAG,CAAC,EACxB0tD,EAAU,EACNzyD,EAAM,GAAKyxD,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,IAGhD4tD,EAAa,GACbF,EAAU,IAIZ,IAAI9kD,EAAO8kD,EAAUzyD,EACpB4xD,EAAgB7sD,EAAK,MAAM0tD,CAAO,EAAG,CAACE,EAAY,KAAMlB,CAAe,EACvE,GAOD,OANI9jD,EAAK,SAAW,GAAK,CAACglD,IACzBhlD,EAAO,KAEJA,EAAK,OAAS,GAAK8jD,EAAgB1sD,EAAK,WAAW/E,EAAM,CAAC,CAAC,IAC9D2N,GAAQ,MAEL+kD,IAAW,OACPC,EAAa,KAAKhlD,CAAI,GAAKA,EAE5BglD,EAAa,GAAGD,CAAM,KAAK/kD,CAAI,GAAK,GAAG+kD,CAAM,GAAG/kD,CAAI,EAC5D,EAEA,WAAW5I,EAAY,CACtBusD,EAAevsD,EAAM,MAAM,EAC3B,MAAM/E,EAAM+E,EAAK,OACjB,GAAI/E,IAAQ,EACX,MAAO,GAGR,MAAM4uB,EAAO7pB,EAAK,WAAW,CAAC,EAC9B,OAAO0sD,EAAgB7iC,CAAI,GAEzB5uB,EAAM,GACN2xD,EAAoB/iC,CAAI,GACxB7pB,EAAK,WAAW,CAAC,IAAM+rD,GACvBW,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,CACrC,EAEA,QAAQmG,EAAe,CACtB,GAAIA,EAAM,SAAW,EACpB,MAAO,IAGR,IAAI0nD,EACA10C,EACJ,QAAS7b,EAAI,EAAGA,EAAI6I,EAAM,OAAQ,EAAE7I,EAAG,CACtC,MAAMiP,EAAMpG,EAAM7I,CAAC,EACnBivD,EAAehgD,EAAK,MAAM,EACtBA,EAAI,OAAS,IACZshD,IAAW,OACdA,EAAS10C,EAAY5M,EAGrBshD,GAAU,KAAKthD,CAAG,GAGrB,CAEA,GAAIshD,IAAW,OACd,MAAO,IAgBR,IAAIC,EAAe,GACfC,EAAa,EACjB,GAAI,OAAO50C,GAAc,UAAYuzC,EAAgBvzC,EAAU,WAAW,CAAC,CAAC,EAAG,CAC9E,EAAE40C,EACF,MAAMC,EAAW70C,EAAU,OACvB60C,EAAW,GAAKtB,EAAgBvzC,EAAU,WAAW,CAAC,CAAC,IAC1D,EAAE40C,EACEC,EAAW,IACVtB,EAAgBvzC,EAAU,WAAW,CAAC,CAAC,EAC1C,EAAE40C,EAGFD,EAAe,IAInB,CACA,GAAIA,EAAc,CAEjB,KAAOC,EAAaF,EAAO,QAC1BnB,EAAgBmB,EAAO,WAAWE,CAAU,CAAC,GAC7CA,IAIGA,GAAc,IACjBF,EAAS,KAAKA,EAAO,MAAME,CAAU,CAAC,GAExC,CAEA,OAAOplD,EAAA,MAAM,UAAUklD,CAAM,CAC9B,EAOA,SAAStwD,EAAcC,EAAU,CAIhC,GAHA+uD,EAAehvD,EAAM,MAAM,EAC3BgvD,EAAe/uD,EAAI,IAAI,EAEnBD,IAASC,EACZ,MAAO,GAGR,MAAMywD,EAAWtlD,EAAA,MAAM,QAAQpL,CAAI,EAC7B2wD,EAASvlD,EAAA,MAAM,QAAQnL,CAAE,EAS/B,GAPIywD,IAAaC,IAIjB3wD,EAAO0wD,EAAS,YAAW,EAC3BzwD,EAAK0wD,EAAO,YAAW,EAEnB3wD,IAASC,GACZ,MAAO,GAIR,IAAI2wD,EAAY,EAChB,KAAOA,EAAY5wD,EAAK,QACvBA,EAAK,WAAW4wD,CAAS,IAAMrC,GAC/BqC,IAGD,IAAIC,EAAU7wD,EAAK,OACnB,KAAO6wD,EAAU,EAAID,GACpB5wD,EAAK,WAAW6wD,EAAU,CAAC,IAAMtC,GACjCsC,IAED,MAAMC,EAAUD,EAAUD,EAG1B,IAAIG,EAAU,EACd,KAAOA,EAAU9wD,EAAG,QACnBA,EAAG,WAAW8wD,CAAO,IAAMxC,GAC3BwC,IAGD,IAAIC,EAAQ/wD,EAAG,OACf,KAAO+wD,EAAQ,EAAID,GAClB9wD,EAAG,WAAW+wD,EAAQ,CAAC,IAAMzC,GAC7ByC,IAED,MAAMC,EAAQD,EAAQD,EAGhBrjD,EAASojD,EAAUG,EAAQH,EAAUG,EAC3C,IAAIC,EAAgB,GAChBnxD,EAAI,EACR,KAAOA,EAAI2N,EAAQ3N,IAAK,CACvB,MAAMoxD,EAAWnxD,EAAK,WAAW4wD,EAAY7wD,CAAC,EAC9C,GAAIoxD,IAAalxD,EAAG,WAAW8wD,EAAUhxD,CAAC,EACzC,MACUoxD,IAAa5C,IACvB2C,EAAgBnxD,EAElB,CAIA,GAAIA,IAAM2N,GACT,GAAIwjD,IAAkB,GACrB,OAAOP,MAEF,CACN,GAAIM,EAAQvjD,EAAQ,CACnB,GAAIzN,EAAG,WAAW8wD,EAAUhxD,CAAC,IAAMwuD,EAGlC,OAAOoC,EAAO,MAAMI,EAAUhxD,EAAI,CAAC,EAEpC,GAAIA,IAAM,EAGT,OAAO4wD,EAAO,MAAMI,EAAUhxD,CAAC,CAEjC,CACI+wD,EAAUpjD,IACT1N,EAAK,WAAW4wD,EAAY7wD,CAAC,IAAMwuD,EAGtC2C,EAAgBnxD,EACNA,IAAM,IAGhBmxD,EAAgB,IAGdA,IAAkB,KACrBA,EAAgB,EAElB,CAEA,IAAIE,EAAM,GAGV,IAAKrxD,EAAI6wD,EAAYM,EAAgB,EAAGnxD,GAAK8wD,EAAS,EAAE9wD,GACnDA,IAAM8wD,GAAW7wD,EAAK,WAAWD,CAAC,IAAMwuD,KAC3C6C,GAAOA,EAAI,SAAW,EAAI,KAAO,QAQnC,OAJAL,GAAWG,EAIPE,EAAI,OAAS,EACT,GAAGA,CAAG,GAAGT,EAAO,MAAMI,EAASC,CAAK,CAAC,IAGzCL,EAAO,WAAWI,CAAO,IAAMxC,GAClC,EAAEwC,EAGIJ,EAAO,MAAMI,EAASC,CAAK,EACnC,EAEA,iBAAiBvuD,EAAY,CAE5B,GAAI,OAAOA,GAAS,UAAYA,EAAK,SAAW,EAC/C,OAAOA,EAGR,MAAM4uD,EAAejmD,EAAA,MAAM,QAAQ3I,CAAI,EAEvC,GAAI4uD,EAAa,QAAU,EAC1B,OAAO5uD,EAGR,GAAI4uD,EAAa,WAAW,CAAC,IAAM9C,GAElC,GAAI8C,EAAa,WAAW,CAAC,IAAM9C,EAAqB,CACvD,MAAMjiC,EAAO+kC,EAAa,WAAW,CAAC,EACtC,GAAI/kC,IAASmiC,GAAsBniC,IAAS+hC,EAE3C,MAAO,eAAegD,EAAa,MAAM,CAAC,CAAC,EAE7C,UACUhC,EAAoBgC,EAAa,WAAW,CAAC,CAAC,GACxDA,EAAa,WAAW,CAAC,IAAM7C,GAC/B6C,EAAa,WAAW,CAAC,IAAM9C,EAE/B,MAAO,UAAU8C,CAAY,GAG9B,OAAO5uD,CACR,EAEA,QAAQA,EAAY,CACnBusD,EAAevsD,EAAM,MAAM,EAC3B,MAAM/E,EAAM+E,EAAK,OACjB,GAAI/E,IAAQ,EACX,MAAO,IAER,IAAIyyD,EAAU,GACVhlC,EAAS,EACb,MAAMmB,EAAO7pB,EAAK,WAAW,CAAC,EAE9B,GAAI/E,IAAQ,EAGX,OAAOyxD,EAAgB7iC,CAAI,EAAI7pB,EAAO,IAIvC,GAAI0sD,EAAgB7iC,CAAI,GAKvB,GAFA6jC,EAAUhlC,EAAS,EAEfgkC,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,EAAG,CAExC,IAAInC,EAAI,EACJkN,EAAOlN,EAEX,KAAOA,EAAI5C,GAAO,CAACyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACpDA,IAED,GAAIA,EAAI5C,GAAO4C,IAAMkN,EAAM,CAI1B,IAFAA,EAAOlN,EAEAA,EAAI5C,GAAOyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACnDA,IAED,GAAIA,EAAI5C,GAAO4C,IAAMkN,EAAM,CAI1B,IAFAA,EAAOlN,EAEAA,EAAI5C,GAAO,CAACyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACpDA,IAED,GAAIA,IAAM5C,EAET,OAAO+E,EAEJnC,IAAMkN,IAKT2iD,EAAUhlC,EAAS7qB,EAAI,EAEzB,CACD,CACD,OAEU+uD,EAAoB/iC,CAAI,GAAK7pB,EAAK,WAAW,CAAC,IAAM+rD,IAC9D2B,EAAUzyD,EAAM,GAAKyxD,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,EAAI,EAAI,EAC/D0oB,EAASglC,GAGV,IAAIlpC,EAAM,GACNqqC,EAAe,GACnB,QAASvxD,EAAIrC,EAAM,EAAGqC,GAAKorB,EAAQ,EAAEprB,EACpC,GAAIovD,EAAgB1sD,EAAK,WAAW1C,CAAC,CAAC,GACrC,GAAI,CAACuxD,EAAc,CAClBrqC,EAAMlnB,EACN,KACD,OAGAuxD,EAAe,GAIjB,GAAIrqC,IAAQ,GAAI,CACf,GAAIkpC,IAAY,GACf,MAAO,IAGRlpC,EAAMkpC,CACP,CACA,OAAO1tD,EAAK,MAAM,EAAGwkB,CAAG,CACzB,EAEA,SAASxkB,EAAc6mC,EAAe,CACjCA,IAAW,QACd0lB,EAAe1lB,EAAQ,QAAQ,EAEhC0lB,EAAevsD,EAAM,MAAM,EAC3B,IAAI8M,EAAQ,EACR0X,EAAM,GACNqqC,EAAe,GACfvxD,EAWJ,GANI0C,EAAK,QAAU,GAClB4sD,EAAoB5sD,EAAK,WAAW,CAAC,CAAC,GACtCA,EAAK,WAAW,CAAC,IAAM+rD,IACvBj/C,EAAQ,GAGL+5B,IAAW,QAAaA,EAAO,OAAS,GAAKA,EAAO,QAAU7mC,EAAK,OAAQ,CAC9E,GAAI6mC,IAAW7mC,EACd,MAAO,GAER,IAAI8uD,EAASjoB,EAAO,OAAS,EACzBkoB,EAAmB,GACvB,IAAKzxD,EAAI0C,EAAK,OAAS,EAAG1C,GAAKwP,EAAO,EAAExP,EAAG,CAC1C,MAAMusB,EAAO7pB,EAAK,WAAW1C,CAAC,EAC9B,GAAIovD,EAAgB7iC,CAAI,GAGvB,GAAI,CAACglC,EAAc,CAClB/hD,EAAQxP,EAAI,EACZ,KACD,OAEIyxD,IAAqB,KAGxBF,EAAe,GACfE,EAAmBzxD,EAAI,GAEpBwxD,GAAU,IAETjlC,IAASgd,EAAO,WAAWioB,CAAM,EAChC,EAAEA,IAAW,KAGhBtqC,EAAMlnB,IAKPwxD,EAAS,GACTtqC,EAAMuqC,GAIV,CAEA,OAAIjiD,IAAU0X,EACbA,EAAMuqC,EACIvqC,IAAQ,KAClBA,EAAMxkB,EAAK,QAELA,EAAK,MAAM8M,EAAO0X,CAAG,CAC7B,CACA,IAAKlnB,EAAI0C,EAAK,OAAS,EAAG1C,GAAKwP,EAAO,EAAExP,EACvC,GAAIovD,EAAgB1sD,EAAK,WAAW1C,CAAC,CAAC,GAGrC,GAAI,CAACuxD,EAAc,CAClB/hD,EAAQxP,EAAI,EACZ,KACD,OACUknB,IAAQ,KAGlBqqC,EAAe,GACfrqC,EAAMlnB,EAAI,GAIZ,OAAIknB,IAAQ,GACJ,GAEDxkB,EAAK,MAAM8M,EAAO0X,CAAG,CAC7B,EAEA,QAAQxkB,EAAY,CACnBusD,EAAevsD,EAAM,MAAM,EAC3B,IAAI8M,EAAQ,EACRkiD,EAAW,GACXC,EAAY,EACZzqC,EAAM,GACNqqC,EAAe,GAGfK,EAAc,EAMdlvD,EAAK,QAAU,GAClBA,EAAK,WAAW,CAAC,IAAM+rD,GACvBa,EAAoB5sD,EAAK,WAAW,CAAC,CAAC,IACtC8M,EAAQmiD,EAAY,GAGrB,QAAS3xD,EAAI0C,EAAK,OAAS,EAAG1C,GAAKwP,EAAO,EAAExP,EAAG,CAC9C,MAAMusB,EAAO7pB,EAAK,WAAW1C,CAAC,EAC9B,GAAIovD,EAAgB7iC,CAAI,EAAG,CAG1B,GAAI,CAACglC,EAAc,CAClBI,EAAY3xD,EAAI,EAChB,KACD,CACA,QACD,CACIknB,IAAQ,KAGXqqC,EAAe,GACfrqC,EAAMlnB,EAAI,GAEPusB,IAAS+hC,EAERoD,IAAa,GAChBA,EAAW1xD,EAEH4xD,IAAgB,IACxBA,EAAc,GAELF,IAAa,KAGvBE,EAAc,GAEhB,CAEA,OAAIF,IAAa,IAChBxqC,IAAQ,IAER0qC,IAAgB,GAEfA,IAAgB,GAChBF,IAAaxqC,EAAM,GACnBwqC,IAAaC,EAAY,EACnB,GAEDjvD,EAAK,MAAMgvD,EAAUxqC,CAAG,CAChC,EAEA,OAAQwhC,EAAQ,KAAK,KAAM,IAAI,EAE/B,MAAMhmD,EAAI,CACTusD,EAAevsD,EAAM,MAAM,EAE3B,MAAMoB,EAAM,CAAE,KAAM,GAAI,IAAK,GAAI,KAAM,GAAI,IAAK,GAAI,KAAM,EAAE,EAC5D,GAAIpB,EAAK,SAAW,EACnB,OAAOoB,EAGR,MAAMnG,EAAM+E,EAAK,OACjB,IAAI0tD,EAAU,EACV7jC,EAAO7pB,EAAK,WAAW,CAAC,EAE5B,GAAI/E,IAAQ,EACX,OAAIyxD,EAAgB7iC,CAAI,GAGvBzoB,EAAI,KAAOA,EAAI,IAAMpB,EACdoB,IAERA,EAAI,KAAOA,EAAI,KAAOpB,EACfoB,GAGR,GAAIsrD,EAAgB7iC,CAAI,GAIvB,GADA6jC,EAAU,EACNhB,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,EAAG,CAExC,IAAInC,EAAI,EACJkN,EAAOlN,EAEX,KAAOA,EAAI5C,GAAO,CAACyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACpDA,IAED,GAAIA,EAAI5C,GAAO4C,IAAMkN,EAAM,CAI1B,IAFAA,EAAOlN,EAEAA,EAAI5C,GAAOyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACnDA,IAED,GAAIA,EAAI5C,GAAO4C,IAAMkN,EAAM,CAI1B,IAFAA,EAAOlN,EAEAA,EAAI5C,GAAO,CAACyxD,EAAgB1sD,EAAK,WAAWnC,CAAC,CAAC,GACpDA,IAEGA,IAAM5C,EAETyyD,EAAU7vD,EACAA,IAAMkN,IAEhB2iD,EAAU7vD,EAAI,EAEhB,CACD,CACD,UACU+uD,EAAoB/iC,CAAI,GAAK7pB,EAAK,WAAW,CAAC,IAAM+rD,EAAY,CAE1E,GAAI9wD,GAAO,EAGV,OAAAmG,EAAI,KAAOA,EAAI,IAAMpB,EACdoB,EAGR,GADAssD,EAAU,EACNhB,EAAgB1sD,EAAK,WAAW,CAAC,CAAC,EAAG,CACxC,GAAI/E,IAAQ,EAGX,OAAAmG,EAAI,KAAOA,EAAI,IAAMpB,EACdoB,EAERssD,EAAU,CACX,CACD,CACIA,EAAU,IACbtsD,EAAI,KAAOpB,EAAK,MAAM,EAAG0tD,CAAO,GAGjC,IAAIsB,EAAW,GACXC,EAAYvB,EACZlpC,EAAM,GACNqqC,EAAe,GACfvxD,EAAI0C,EAAK,OAAS,EAIlBkvD,EAAc,EAGlB,KAAO5xD,GAAKowD,EAAS,EAAEpwD,EAAG,CAEzB,GADAusB,EAAO7pB,EAAK,WAAW1C,CAAC,EACpBovD,EAAgB7iC,CAAI,EAAG,CAG1B,GAAI,CAACglC,EAAc,CAClBI,EAAY3xD,EAAI,EAChB,KACD,CACA,QACD,CACIknB,IAAQ,KAGXqqC,EAAe,GACfrqC,EAAMlnB,EAAI,GAEPusB,IAAS+hC,EAERoD,IAAa,GAChBA,EAAW1xD,EACD4xD,IAAgB,IAC1BA,EAAc,GAELF,IAAa,KAGvBE,EAAc,GAEhB,CAEA,OAAI1qC,IAAQ,KACPwqC,IAAa,IAEhBE,IAAgB,GAEfA,IAAgB,GAChBF,IAAaxqC,EAAM,GACnBwqC,IAAaC,EAAY,EAC1B7tD,EAAI,KAAOA,EAAI,KAAOpB,EAAK,MAAMivD,EAAWzqC,CAAG,GAE/CpjB,EAAI,KAAOpB,EAAK,MAAMivD,EAAWD,CAAQ,EACzC5tD,EAAI,KAAOpB,EAAK,MAAMivD,EAAWzqC,CAAG,EACpCpjB,EAAI,IAAMpB,EAAK,MAAMgvD,EAAUxqC,CAAG,IAOhCyqC,EAAY,GAAKA,IAAcvB,EAClCtsD,EAAI,IAAMpB,EAAK,MAAM,EAAGivD,EAAY,CAAC,EAErC7tD,EAAI,IAAMA,EAAI,KAGRA,CACR,EAEA,IAAK,KACL,UAAW,IACX,MAAO,KACP,MAAO,MAGR,MAAM+tD,GAAY,IAAK,CACtB,GAAI3C,EAAiB,CAGpB,MAAMzjC,EAAS,MACf,MAAO,IAAK,CACX,MAAMqmC,EAAM3C,EAAQ,IAAG,EAAG,QAAQ1jC,EAAQ,GAAG,EAC7C,OAAOqmC,EAAI,MAAMA,EAAI,QAAQ,GAAG,CAAC,CAClC,CACD,CAGA,MAAO,IAAM3C,EAAQ,IAAG,CACzB,GAAE,EAEW9jD,EAAA,MAAe,CAE3B,WAAW2kD,EAAsB,CAChC,IAAIsB,EAAe,GACfnB,EAAmB,GAEvB,QAASnwD,EAAIgwD,EAAa,OAAS,EAAGhwD,GAAK,IAAM,CAACmwD,EAAkBnwD,IAAK,CACxE,MAAM0C,EAAO1C,GAAK,EAAIgwD,EAAahwD,CAAC,EAAI6xD,EAAQ,EAEhD5C,EAAevsD,EAAM,SAAS1C,CAAC,GAAG,EAG9B0C,EAAK,SAAW,IAIpB4uD,EAAe,GAAG5uD,CAAI,IAAI4uD,CAAY,GACtCnB,EAAmBztD,EAAK,WAAW,CAAC,IAAM6rD,EAC3C,CASA,OAHA+C,EAAe/B,EAAgB+B,EAAc,CAACnB,EAAkB,IAC/Dd,CAAoB,EAEjBc,EACI,IAAImB,CAAY,GAEjBA,EAAa,OAAS,EAAIA,EAAe,GACjD,EAEA,UAAU5uD,EAAY,CAGrB,GAFAusD,EAAevsD,EAAM,MAAM,EAEvBA,EAAK,SAAW,EACnB,MAAO,IAGR,MAAM4tD,EAAa5tD,EAAK,WAAW,CAAC,IAAM6rD,EACpCwD,EACLrvD,EAAK,WAAWA,EAAK,OAAS,CAAC,IAAM6rD,EAKtC,OAFA7rD,EAAO6sD,EAAgB7sD,EAAM,CAAC4tD,EAAY,IAAKjB,CAAoB,EAE/D3sD,EAAK,SAAW,EACf4tD,EACI,IAEDyB,EAAoB,KAAO,KAE/BA,IACHrvD,GAAQ,KAGF4tD,EAAa,IAAI5tD,CAAI,GAAKA,EAClC,EAEA,WAAWA,EAAY,CACtB,OAAAusD,EAAevsD,EAAM,MAAM,EACpBA,EAAK,OAAS,GAAKA,EAAK,WAAW,CAAC,IAAM6rD,CAClD,EAEA,QAAQ1lD,EAAe,CACtB,GAAIA,EAAM,SAAW,EACpB,MAAO,IAER,IAAI0nD,EACJ,QAASvwD,EAAI,EAAGA,EAAI6I,EAAM,OAAQ,EAAE7I,EAAG,CACtC,MAAMiP,EAAMpG,EAAM7I,CAAC,EACnBivD,EAAehgD,EAAK,MAAM,EACtBA,EAAI,OAAS,IACZshD,IAAW,OACdA,EAASthD,EAETshD,GAAU,IAAIthD,CAAG,GAGpB,CACA,OAAIshD,IAAW,OACP,IAEDllD,EAAA,MAAM,UAAUklD,CAAM,CAC9B,EAEA,SAAStwD,EAAcC,EAAU,CAYhC,GAXA+uD,EAAehvD,EAAM,MAAM,EAC3BgvD,EAAe/uD,EAAI,IAAI,EAEnBD,IAASC,IAKbD,EAAOoL,EAAA,MAAM,QAAQpL,CAAI,EACzBC,EAAKmL,EAAA,MAAM,QAAQnL,CAAE,EAEjBD,IAASC,GACZ,MAAO,GAGR,MAAM2wD,EAAY,EACZC,EAAU7wD,EAAK,OACf8wD,EAAUD,EAAUD,EACpBG,EAAU,EACVE,EAAQhxD,EAAG,OAAS8wD,EAGpBrjD,EAAUojD,EAAUG,EAAQH,EAAUG,EAC5C,IAAIC,EAAgB,GAChBnxD,EAAI,EACR,KAAOA,EAAI2N,EAAQ3N,IAAK,CACvB,MAAMoxD,EAAWnxD,EAAK,WAAW4wD,EAAY7wD,CAAC,EAC9C,GAAIoxD,IAAalxD,EAAG,WAAW8wD,EAAUhxD,CAAC,EACzC,MACUoxD,IAAa7C,IACvB4C,EAAgBnxD,EAElB,CACA,GAAIA,IAAM2N,EACT,GAAIujD,EAAQvjD,EAAQ,CACnB,GAAIzN,EAAG,WAAW8wD,EAAUhxD,CAAC,IAAMuuD,EAGlC,OAAOruD,EAAG,MAAM8wD,EAAUhxD,EAAI,CAAC,EAEhC,GAAIA,IAAM,EAGT,OAAOE,EAAG,MAAM8wD,EAAUhxD,CAAC,CAE7B,MAAW+wD,EAAUpjD,IAChB1N,EAAK,WAAW4wD,EAAY7wD,CAAC,IAAMuuD,EAGtC4C,EAAgBnxD,EACNA,IAAM,IAGhBmxD,EAAgB,IAKnB,IAAIE,EAAM,GAGV,IAAKrxD,EAAI6wD,EAAYM,EAAgB,EAAGnxD,GAAK8wD,EAAS,EAAE9wD,GACnDA,IAAM8wD,GAAW7wD,EAAK,WAAWD,CAAC,IAAMuuD,KAC3C8C,GAAOA,EAAI,SAAW,EAAI,KAAO,OAMnC,MAAO,GAAGA,CAAG,GAAGnxD,EAAG,MAAM8wD,EAAUG,CAAa,CAAC,EAClD,EAEA,iBAAiBzuD,EAAY,CAE5B,OAAOA,CACR,EAEA,QAAQA,EAAY,CAEnB,GADAusD,EAAevsD,EAAM,MAAM,EACvBA,EAAK,SAAW,EACnB,MAAO,IAER,MAAMsvD,EAAUtvD,EAAK,WAAW,CAAC,IAAM6rD,EACvC,IAAIrnC,EAAM,GACNqqC,EAAe,GACnB,QAASvxD,EAAI0C,EAAK,OAAS,EAAG1C,GAAK,EAAG,EAAEA,EACvC,GAAI0C,EAAK,WAAW1C,CAAC,IAAMuuD,GAC1B,GAAI,CAACgD,EAAc,CAClBrqC,EAAMlnB,EACN,KACD,OAGAuxD,EAAe,GAIjB,OAAIrqC,IAAQ,GACJ8qC,EAAU,IAAM,IAEpBA,GAAW9qC,IAAQ,EACf,KAEDxkB,EAAK,MAAM,EAAGwkB,CAAG,CACzB,EAEA,SAASxkB,EAAc6mC,EAAe,CACjCA,IAAW,QACd0lB,EAAe1lB,EAAQ,KAAK,EAE7B0lB,EAAevsD,EAAM,MAAM,EAE3B,IAAI8M,EAAQ,EACR0X,EAAM,GACNqqC,EAAe,GACfvxD,EAEJ,GAAIupC,IAAW,QAAaA,EAAO,OAAS,GAAKA,EAAO,QAAU7mC,EAAK,OAAQ,CAC9E,GAAI6mC,IAAW7mC,EACd,MAAO,GAER,IAAI8uD,EAASjoB,EAAO,OAAS,EACzBkoB,EAAmB,GACvB,IAAKzxD,EAAI0C,EAAK,OAAS,EAAG1C,GAAK,EAAG,EAAEA,EAAG,CACtC,MAAMusB,EAAO7pB,EAAK,WAAW1C,CAAC,EAC9B,GAAIusB,IAASgiC,GAGZ,GAAI,CAACgD,EAAc,CAClB/hD,EAAQxP,EAAI,EACZ,KACD,OAEIyxD,IAAqB,KAGxBF,EAAe,GACfE,EAAmBzxD,EAAI,GAEpBwxD,GAAU,IAETjlC,IAASgd,EAAO,WAAWioB,CAAM,EAChC,EAAEA,IAAW,KAGhBtqC,EAAMlnB,IAKPwxD,EAAS,GACTtqC,EAAMuqC,GAIV,CAEA,OAAIjiD,IAAU0X,EACbA,EAAMuqC,EACIvqC,IAAQ,KAClBA,EAAMxkB,EAAK,QAELA,EAAK,MAAM8M,EAAO0X,CAAG,CAC7B,CACA,IAAKlnB,EAAI0C,EAAK,OAAS,EAAG1C,GAAK,EAAG,EAAEA,EACnC,GAAI0C,EAAK,WAAW1C,CAAC,IAAMuuD,GAG1B,GAAI,CAACgD,EAAc,CAClB/hD,EAAQxP,EAAI,EACZ,KACD,OACUknB,IAAQ,KAGlBqqC,EAAe,GACfrqC,EAAMlnB,EAAI,GAIZ,OAAIknB,IAAQ,GACJ,GAEDxkB,EAAK,MAAM8M,EAAO0X,CAAG,CAC7B,EAEA,QAAQxkB,EAAY,CACnBusD,EAAevsD,EAAM,MAAM,EAC3B,IAAIgvD,EAAW,GACXC,EAAY,EACZzqC,EAAM,GACNqqC,EAAe,GAGfK,EAAc,EAClB,QAAS5xD,EAAI0C,EAAK,OAAS,EAAG1C,GAAK,EAAG,EAAEA,EAAG,CAC1C,MAAMusB,EAAO7pB,EAAK,WAAW1C,CAAC,EAC9B,GAAIusB,IAASgiC,EAAoB,CAGhC,GAAI,CAACgD,EAAc,CAClBI,EAAY3xD,EAAI,EAChB,KACD,CACA,QACD,CACIknB,IAAQ,KAGXqqC,EAAe,GACfrqC,EAAMlnB,EAAI,GAEPusB,IAAS+hC,EAERoD,IAAa,GAChBA,EAAW1xD,EAEH4xD,IAAgB,IACxBA,EAAc,GAELF,IAAa,KAGvBE,EAAc,GAEhB,CAEA,OAAIF,IAAa,IAChBxqC,IAAQ,IAER0qC,IAAgB,GAEfA,IAAgB,GAChBF,IAAaxqC,EAAM,GACnBwqC,IAAaC,EAAY,EACnB,GAEDjvD,EAAK,MAAMgvD,EAAUxqC,CAAG,CAChC,EAEA,OAAQwhC,EAAQ,KAAK,KAAM,GAAG,EAE9B,MAAMhmD,EAAY,CACjBusD,EAAevsD,EAAM,MAAM,EAE3B,MAAMoB,EAAM,CAAE,KAAM,GAAI,IAAK,GAAI,KAAM,GAAI,IAAK,GAAI,KAAM,EAAE,EAC5D,GAAIpB,EAAK,SAAW,EACnB,OAAOoB,EAER,MAAMwsD,EAAa5tD,EAAK,WAAW,CAAC,IAAM6rD,EAC1C,IAAI/+C,EACA8gD,GACHxsD,EAAI,KAAO,IACX0L,EAAQ,GAERA,EAAQ,EAET,IAAIkiD,EAAW,GACXC,EAAY,EACZzqC,EAAM,GACNqqC,EAAe,GACfvxD,EAAI0C,EAAK,OAAS,EAIlBkvD,EAAc,EAGlB,KAAO5xD,GAAKwP,EAAO,EAAExP,EAAG,CACvB,MAAMusB,EAAO7pB,EAAK,WAAW1C,CAAC,EAC9B,GAAIusB,IAASgiC,EAAoB,CAGhC,GAAI,CAACgD,EAAc,CAClBI,EAAY3xD,EAAI,EAChB,KACD,CACA,QACD,CACIknB,IAAQ,KAGXqqC,EAAe,GACfrqC,EAAMlnB,EAAI,GAEPusB,IAAS+hC,EAERoD,IAAa,GAChBA,EAAW1xD,EACD4xD,IAAgB,IAC1BA,EAAc,GAELF,IAAa,KAGvBE,EAAc,GAEhB,CAEA,GAAI1qC,IAAQ,GAAI,CACf,MAAM1X,EAAQmiD,IAAc,GAAKrB,EAAa,EAAIqB,EAC9CD,IAAa,IAEhBE,IAAgB,GAEfA,IAAgB,GAChBF,IAAaxqC,EAAM,GACnBwqC,IAAaC,EAAY,EAC1B7tD,EAAI,KAAOA,EAAI,KAAOpB,EAAK,MAAM8M,EAAO0X,CAAG,GAE3CpjB,EAAI,KAAOpB,EAAK,MAAM8M,EAAOkiD,CAAQ,EACrC5tD,EAAI,KAAOpB,EAAK,MAAM8M,EAAO0X,CAAG,EAChCpjB,EAAI,IAAMpB,EAAK,MAAMgvD,EAAUxqC,CAAG,EAEpC,CAEA,OAAIyqC,EAAY,EACf7tD,EAAI,IAAMpB,EAAK,MAAM,EAAGivD,EAAY,CAAC,EAC3BrB,IACVxsD,EAAI,IAAM,KAGJA,CACR,EAEA,IAAK,IACL,UAAW,IACX,MAAO,KACP,MAAO,MAGRuH,EAAA,MAAM,MAAQA,EAAA,MAAM,MAAQA,EAAA,MAC5BA,EAAA,MAAM,MAAQA,EAAA,MAAM,MAAQA,EAAA,MAEfA,EAAA,UAAa6jD,EAAkB7jD,EAAA,MAAM,UAAYA,EAAA,MAAM,UACvDA,EAAA,KAAQ6jD,EAAkB7jD,EAAA,MAAM,KAAOA,EAAA,MAAM,KAC7CA,EAAA,QAAW6jD,EAAkB7jD,EAAA,MAAM,QAAUA,EAAA,MAAM,QACnDA,EAAA,SAAY6jD,EAAkB7jD,EAAA,MAAM,SAAWA,EAAA,MAAM,SACrDA,EAAA,QAAW6jD,EAAkB7jD,EAAA,MAAM,QAAUA,EAAA,MAAM,QACnDA,EAAA,SAAY6jD,EAAkB7jD,EAAA,MAAM,SAAWA,EAAA,MAAM,SACrDA,EAAA,QAAW6jD,EAAkB7jD,EAAA,MAAM,QAAUA,EAAA,MAAM,QACnDA,EAAA,IAAO6jD,EAAkB7jD,EAAA,MAAM,IAAMA,EAAA,MAAM,0HCt5BxDA,EAAA,YAAA4mD,EAnlBA,MAAMC,EAAiB,iBACjBC,EAAoB,MACpBC,EAAoB,QAE1B,SAASC,EAAavuD,EAAUwuD,EAAiB,CAGhD,GAAI,CAACxuD,EAAI,QAAUwuD,EAClB,MAAM,IAAI,MAAM,2DAA2DxuD,EAAI,SAAS,aAAaA,EAAI,IAAI,cAAcA,EAAI,KAAK,iBAAiBA,EAAI,QAAQ,IAAI,EAKtK,GAAIA,EAAI,QAAU,CAACouD,EAAe,KAAKpuD,EAAI,MAAM,EAChD,MAAM,IAAI,MAAM,iDAAiD,EAQlE,GAAIA,EAAI,MACP,GAAIA,EAAI,WACP,GAAI,CAACquD,EAAkB,KAAKruD,EAAI,IAAI,EACnC,MAAM,IAAI,MAAM,0IAA0I,UAGvJsuD,EAAkB,KAAKtuD,EAAI,IAAI,EAClC,MAAM,IAAI,MAAM,2HAA2H,EAI/I,CAMA,SAASyuD,EAAWC,EAAgBF,EAAgB,CACnD,MAAI,CAACE,GAAU,CAACF,EACR,OAEDE,CACR,CAGA,SAASC,EAAqBD,EAAgB9vD,EAAY,CAMzD,OAAQ8vD,EAAQ,CACf,IAAK,QACL,IAAK,OACL,IAAK,OACC9vD,EAEMA,EAAK,CAAC,IAAMgwD,IACtBhwD,EAAOgwD,EAAShwD,GAFhBA,EAAOgwD,EAIR,KACF,CACA,OAAOhwD,CACR,CAEA,MAAM+V,EAAS,GACTi6C,EAAS,IACTC,EAAU,+DAkBhB,MAAaC,CAAG,CAEf,OAAO,MAAMp6C,EAAU,CACtB,OAAIA,aAAiBo6C,EACb,GAEHp6C,EAGE,OAAaA,EAAO,WAAc,UACrC,OAAaA,EAAO,UAAa,UACjC,OAAaA,EAAO,MAAS,UAC7B,OAAaA,EAAO,OAAU,UAC9B,OAAaA,EAAO,QAAW,UAC/B,OAAaA,EAAO,QAAW,UAC/B,OAAaA,EAAO,MAAS,YAC7B,OAAaA,EAAO,UAAa,WAT7B,EAUT,CA0CA,YAAsBq6C,EAAsCC,EAAoBpwD,EAAeqwD,EAAgBC,EAAmBV,EAAmB,GAAK,CAErJ,OAAOO,GAAiB,UAC3B,KAAK,OAASA,EAAa,QAAUp6C,EACrC,KAAK,UAAYo6C,EAAa,WAAap6C,EAC3C,KAAK,KAAOo6C,EAAa,MAAQp6C,EACjC,KAAK,MAAQo6C,EAAa,OAASp6C,EACnC,KAAK,SAAWo6C,EAAa,UAAYp6C,IAKzC,KAAK,OAAS85C,EAAWM,EAAcP,CAAO,EAC9C,KAAK,UAAYQ,GAAar6C,EAC9B,KAAK,KAAOg6C,EAAqB,KAAK,OAAQ/vD,GAAQ+V,CAAM,EAC5D,KAAK,MAAQs6C,GAASt6C,EACtB,KAAK,SAAWu6C,GAAYv6C,EAE5B45C,EAAa,KAAMC,CAAO,EAE5B,CA4BA,IAAI,QAAM,CAIT,OAAOL,EAAY,KAAM,EAAK,CAC/B,CAIA,KAAKp8B,EAA6H,CAEjI,GAAI,CAACA,EACJ,OAAO,KAGR,GAAI,CAAE,OAAA28B,EAAQ,UAAAM,EAAW,KAAApwD,EAAM,MAAAqwD,EAAO,SAAAC,CAAQ,EAAKn9B,EA2BnD,OA1BI28B,IAAW,OACdA,EAAS,KAAK,OACJA,IAAW,OACrBA,EAAS/5C,GAENq6C,IAAc,OACjBA,EAAY,KAAK,UACPA,IAAc,OACxBA,EAAYr6C,GAET/V,IAAS,OACZA,EAAO,KAAK,KACFA,IAAS,OACnBA,EAAO+V,GAEJs6C,IAAU,OACbA,EAAQ,KAAK,MACHA,IAAU,OACpBA,EAAQt6C,GAELu6C,IAAa,OAChBA,EAAW,KAAK,SACNA,IAAa,OACvBA,EAAWv6C,GAGR+5C,IAAW,KAAK,QAChBM,IAAc,KAAK,WACnBpwD,IAAS,KAAK,MACdqwD,IAAU,KAAK,OACfC,IAAa,KAAK,SAEd,KAGD,IAAIC,EAAIT,EAAQM,EAAWpwD,EAAMqwD,EAAOC,CAAQ,CACxD,CAUA,OAAO,MAAM/zD,EAAeqzD,EAAmB,GAAK,CACnD,MAAMzrC,EAAQ8rC,EAAQ,KAAK1zD,CAAK,EAChC,OAAK4nB,EAGE,IAAIosC,EACVpsC,EAAM,CAAC,GAAKpO,EACZy6C,EAAcrsC,EAAM,CAAC,GAAKpO,CAAM,EAChCy6C,EAAcrsC,EAAM,CAAC,GAAKpO,CAAM,EAChCy6C,EAAcrsC,EAAM,CAAC,GAAKpO,CAAM,EAChCy6C,EAAcrsC,EAAM,CAAC,GAAKpO,CAAM,EAChC65C,CAAO,EARA,IAAIW,EAAIx6C,EAAQA,EAAQA,EAAQA,EAAQA,CAAM,CAUvD,CAuBA,OAAO,KAAK/V,EAAY,CAEvB,IAAIowD,EAAYr6C,EAWhB,GANIm0C,EAAA,YACHlqD,EAAOA,EAAK,QAAQ,MAAOgwD,CAAM,GAK9BhwD,EAAK,CAAC,IAAMgwD,GAAUhwD,EAAK,CAAC,IAAMgwD,EAAQ,CAC7C,MAAMpgD,EAAM5P,EAAK,QAAQgwD,EAAQ,CAAC,EAC9BpgD,IAAQ,IACXwgD,EAAYpwD,EAAK,UAAU,CAAC,EAC5BA,EAAOgwD,IAEPI,EAAYpwD,EAAK,UAAU,EAAG4P,CAAG,EACjC5P,EAAOA,EAAK,UAAU4P,CAAG,GAAKogD,EAEhC,CAEA,OAAO,IAAIO,EAAI,OAAQH,EAAWpwD,EAAM+V,EAAQA,CAAM,CACvD,CASA,OAAO,KAAK06C,EAA2BC,EAAgB,CAStD,OARe,IAAIH,EAClBE,EAAW,OACXA,EAAW,UACXA,EAAW,KACXA,EAAW,MACXA,EAAW,SACXC,CAAM,CAGR,CASA,OAAO,SAAS30D,KAAa40D,EAAsB,CAClD,GAAI,CAAC50D,EAAI,KACR,MAAM,IAAI,MAAM,sDAAsD,EAEvE,IAAI60D,EACJ,OAAI1G,EAAA,WAAanuD,EAAI,SAAW,OAC/B60D,EAAUV,EAAI,KAAK/pD,EAAM,MAAM,KAAKopD,EAAYxzD,EAAK,EAAI,EAAG,GAAG40D,CAAY,CAAC,EAAE,KAE9EC,EAAUzqD,EAAM,MAAM,KAAKpK,EAAI,KAAM,GAAG40D,CAAY,EAE9C50D,EAAI,KAAK,CAAE,KAAM60D,CAAO,CAAE,CAClC,CAeA,SAASC,EAAwB,GAAK,CACrC,OAAOC,EAAa,KAAMD,CAAY,CACvC,CAEA,QAAM,CACL,OAAO,IACR,CAgBA,OAAO,OAAOrwD,EAA4C,CACzD,GAAKA,EAEE,IAAIA,aAAgB0vD,EAC1B,OAAO1vD,EACD,CACN,MAAMxF,EAAS,IAAIu1D,EAAI/vD,CAAI,EAC3B,OAAAxF,EAAO,WAAwBwF,EAAM,UAAY,KACjDxF,EAAO,QAAqBwF,EAAM,OAASuwD,EAA4BvwD,EAAM,QAAU,KAAO,KACvFxF,CACR,MARC,QAAOwF,CAST,EA7TDmI,EAAA,IAAAunD,EA+UA,MAAMa,EAAiB7G,EAAA,UAAY,EAAI,OAGvC,MAAMqG,UAAYL,CAAG,CAArB,aAAA,qBAEC,KAAA,WAA4B,KAC5B,KAAA,QAAyB,IAuD1B,CArDC,IAAa,QAAM,CAClB,OAAK,KAAK,UACT,KAAK,QAAUX,EAAY,KAAM,EAAK,GAEhC,KAAK,OACb,CAES,SAASsB,EAAwB,GAAK,CAC9C,OAAKA,EAOGC,EAAa,KAAM,EAAI,GANzB,KAAK,aACT,KAAK,WAAaA,EAAa,KAAM,EAAK,GAEpC,KAAK,WAKd,CAES,QAAM,CACd,MAAM30C,EAAgB,CACrB,KAAI,GAGL,OAAI,KAAK,UACRA,EAAI,OAAS,KAAK,QAClBA,EAAI,KAAO40C,GAER,KAAK,aACR50C,EAAI,SAAW,KAAK,YAGjB,KAAK,OACRA,EAAI,KAAO,KAAK,MAMb,KAAK,SACRA,EAAI,OAAS,KAAK,QAEf,KAAK,YACRA,EAAI,UAAY,KAAK,WAElB,KAAK,QACRA,EAAI,MAAQ,KAAK,OAEd,KAAK,WACRA,EAAI,SAAW,KAAK,UAEdA,CACR,EAID,MAAM60C,EAAwC,CAC7C,GAAkB,MAClB,GAAkB,MAClB,GAAyB,MACzB,GAAiB,MACjB,GAA8B,MAC9B,GAA+B,MAC/B,GAAmB,MAEnB,GAA4B,MAC5B,GAAuB,MACvB,GAAsB,MACtB,GAAwB,MACxB,GAAsB,MACtB,GAAuB,MACvB,GAAqB,MACrB,GAAiB,MACjB,GAAkB,MAClB,GAAsB,MACtB,GAAmB,MAEnB,GAAkB,OAGnB,SAASC,EAAuBC,EAAsBC,EAAiBC,EAAoB,CAC1F,IAAIj1C,EACAk1C,EAAkB,GAEtB,QAASn3B,EAAM,EAAGA,EAAMg3B,EAAa,OAAQh3B,IAAO,CACnD,MAAMrQ,EAAOqnC,EAAa,WAAWh3B,CAAG,EAGxC,GACErQ,GAAI,IAAkBA,GAAI,KACvBA,GAAI,IAAkBA,GAAI,IAC1BA,GAAI,IAAuBA,GAAI,IAChCA,IAAI,IACJA,IAAI,IACJA,IAAI,IACJA,IAAI,KACHsnC,GAAUtnC,IAAI,IACdunC,GAAevnC,IAAI,IACnBunC,GAAevnC,IAAI,IACnBunC,GAAevnC,IAAI,GAGnBwnC,IAAoB,KACvBl1C,GAAO,mBAAmB+0C,EAAa,UAAUG,EAAiBn3B,CAAG,CAAC,EACtEm3B,EAAkB,IAGfl1C,IAAQ,SACXA,GAAO+0C,EAAa,OAAOh3B,CAAG,OAGzB,CAEF/d,IAAQ,SACXA,EAAM+0C,EAAa,OAAO,EAAGh3B,CAAG,GAIjC,MAAMo3B,EAAUN,EAAYnnC,CAAI,EAC5BynC,IAAY,QAGXD,IAAoB,KACvBl1C,GAAO,mBAAmB+0C,EAAa,UAAUG,EAAiBn3B,CAAG,CAAC,EACtEm3B,EAAkB,IAInBl1C,GAAOm1C,GAEGD,IAAoB,KAE9BA,EAAkBn3B,EAEpB,CACD,CAEA,OAAIm3B,IAAoB,KACvBl1C,GAAO,mBAAmB+0C,EAAa,UAAUG,CAAe,CAAC,GAG3Dl1C,IAAQ,OAAYA,EAAM+0C,CAClC,CAEA,SAASK,EAA0BvxD,EAAY,CAC9C,IAAImc,EACJ,QAAS+d,EAAM,EAAGA,EAAMl6B,EAAK,OAAQk6B,IAAO,CAC3C,MAAMrQ,EAAO7pB,EAAK,WAAWk6B,CAAG,EAC5BrQ,IAAI,IAAsBA,IAAI,IAC7B1N,IAAQ,SACXA,EAAMnc,EAAK,OAAO,EAAGk6B,CAAG,GAEzB/d,GAAO60C,EAAYnnC,CAAI,GAEnB1N,IAAQ,SACXA,GAAOnc,EAAKk6B,CAAG,EAGlB,CACA,OAAO/d,IAAQ,OAAYA,EAAMnc,CAClC,CAKA,SAAgBuvD,EAAYxzD,EAAUy1D,EAA8B,CAEnE,IAAIj1D,EACJ,OAAIR,EAAI,WAAaA,EAAI,KAAK,OAAS,GAAKA,EAAI,SAAW,OAE1DQ,EAAQ,KAAKR,EAAI,SAAS,GAAGA,EAAI,IAAI,GAErCA,EAAI,KAAK,WAAW,CAAC,IAAC,KAClBA,EAAI,KAAK,WAAW,CAAC,GAAC,IAAkBA,EAAI,KAAK,WAAW,CAAC,GAAC,IAAkBA,EAAI,KAAK,WAAW,CAAC,GAAC,IAAkBA,EAAI,KAAK,WAAW,CAAC,GAAC,MAC/IA,EAAI,KAAK,WAAW,CAAC,IAAC,GAEpBy1D,EAIJj1D,EAAQR,EAAI,KAAK,OAAO,CAAC,EAFzBQ,EAAQR,EAAI,KAAK,CAAC,EAAE,YAAW,EAAKA,EAAI,KAAK,OAAO,CAAC,EAMtDQ,EAAQR,EAAI,KAETmuD,EAAA,YACH3tD,EAAQA,EAAM,QAAQ,MAAO,IAAI,GAE3BA,CACR,CAKA,SAASu0D,EAAa/0D,EAAU80D,EAAqB,CAEpD,MAAMY,EAAWZ,EAEdU,EADAN,EAGH,IAAI90C,EAAM,GACN,CAAE,OAAA2zC,EAAQ,UAAAM,EAAW,KAAApwD,EAAM,MAAAqwD,EAAO,SAAAC,CAAQ,EAAKv0D,EASnD,GARI+zD,IACH3zC,GAAO2zC,EACP3zC,GAAO,MAEJi0C,GAAaN,IAAW,UAC3B3zC,GAAO6zC,EACP7zC,GAAO6zC,GAEJI,EAAW,CACd,IAAIxgD,EAAMwgD,EAAU,QAAQ,GAAG,EAC/B,GAAIxgD,IAAQ,GAAI,CAEf,MAAM8hD,EAAWtB,EAAU,OAAO,EAAGxgD,CAAG,EACxCwgD,EAAYA,EAAU,OAAOxgD,EAAM,CAAC,EACpCA,EAAM8hD,EAAS,YAAY,GAAG,EAC1B9hD,IAAQ,GACXuM,GAAOs1C,EAAQC,EAAU,GAAO,EAAK,GAGrCv1C,GAAOs1C,EAAQC,EAAS,OAAO,EAAG9hD,CAAG,EAAG,GAAO,EAAK,EACpDuM,GAAO,IACPA,GAAOs1C,EAAQC,EAAS,OAAO9hD,EAAM,CAAC,EAAG,GAAO,EAAI,GAErDuM,GAAO,GACR,CACAi0C,EAAYA,EAAU,YAAW,EACjCxgD,EAAMwgD,EAAU,YAAY,GAAG,EAC3BxgD,IAAQ,GACXuM,GAAOs1C,EAAQrB,EAAW,GAAO,EAAI,GAGrCj0C,GAAOs1C,EAAQrB,EAAU,OAAO,EAAGxgD,CAAG,EAAG,GAAO,EAAI,EACpDuM,GAAOi0C,EAAU,OAAOxgD,CAAG,EAE7B,CACA,GAAI5P,EAAM,CAET,GAAIA,EAAK,QAAU,GAAKA,EAAK,WAAW,CAAC,IAAC,IAAuBA,EAAK,WAAW,CAAC,IAAC,GAAqB,CACvG,MAAM6pB,EAAO7pB,EAAK,WAAW,CAAC,EAC1B6pB,GAAI,IAAkBA,GAAI,KAC7B7pB,EAAO,IAAI,OAAO,aAAa6pB,EAAO,EAAE,CAAC,IAAI7pB,EAAK,OAAO,CAAC,CAAC,GAE7D,SAAWA,EAAK,QAAU,GAAKA,EAAK,WAAW,CAAC,IAAC,GAAqB,CACrE,MAAM6pB,EAAO7pB,EAAK,WAAW,CAAC,EAC1B6pB,GAAI,IAAkBA,GAAI,KAC7B7pB,EAAO,GAAG,OAAO,aAAa6pB,EAAO,EAAE,CAAC,IAAI7pB,EAAK,OAAO,CAAC,CAAC,GAE5D,CAEAmc,GAAOs1C,EAAQzxD,EAAM,GAAM,EAAK,CACjC,CACA,OAAIqwD,IACHl0C,GAAO,IACPA,GAAOs1C,EAAQpB,EAAO,GAAO,EAAK,GAE/BC,IACHn0C,GAAO,IACPA,GAAQ00C,EAAgEP,EAAjDW,EAAuBX,EAAU,GAAO,EAAK,GAE9Dn0C,CACR,CAIA,SAASw1C,EAA2B5tD,EAAW,CAC9C,GAAI,CACH,OAAO,mBAAmBA,CAAG,CAC9B,MAAQ,CACP,OAAIA,EAAI,OAAS,EACTA,EAAI,OAAO,EAAG,CAAC,EAAI4tD,EAA2B5tD,EAAI,OAAO,CAAC,CAAC,EAE3DA,CAET,CACD,CAEA,MAAM6tD,EAAiB,8BAEvB,SAASpB,EAAczsD,EAAW,CACjC,OAAKA,EAAI,MAAM6tD,CAAc,EAGtB7tD,EAAI,QAAQ6tD,EAAiBztC,GAAUwtC,EAA2BxtC,CAAK,CAAC,EAFvEpgB,CAGT,8NC5kBA4E,EAAA,cAAAkpD,EAQAlpD,EAAA,kBAAAmpD,EAvIA,IAAiBC,GAAjB,SAAiBA,EAAO,CAMVA,EAAA,SAAW,WAKXA,EAAA,OAAS,SAKTA,EAAA,SAAW,UAKXA,EAAA,YAAc,cAKdA,EAAA,mBAAqB,qBAErBA,EAAA,KAAO,OAEPA,EAAA,MAAQ,QAERA,EAAA,KAAO,OAEPA,EAAA,OAAS,SAETA,EAAA,SAAW,WAEXA,EAAA,KAAO,OAEPA,EAAA,QAAU,UAEVA,EAAA,aAAe,gBAEfA,EAAA,qBAAuB,yBAEvBA,EAAA,4BAA8B,iCAE9BA,EAAA,eAAiB,kBAEjBA,EAAA,mBAAqB,uBAErBA,EAAA,mBAAqB,uBACrBA,EAAA,2BAA6B,gCAC7BA,EAAA,+BAAiC,qCACjCA,EAAA,yBAA2B,8BAC3BA,EAAA,6BAA+B,mCAC/BA,EAAA,uBAAyB,2BACzBA,EAAA,uBAAyB,2BAEzBA,EAAA,eAAiB,kBAEjBA,EAAA,qBAAuB,yBAEvBA,EAAA,eAAiB,kBAGjBA,EAAA,oBAAsB,yBAGtBA,EAAA,2BAA6B,iCAG7BA,EAAA,mBAAqB,qBAKrBA,EAAA,aAAe,gBAKfA,EAAA,cAAgB,iBAKhBA,EAAA,UAAY,YAMZA,EAAA,mBAAqB,cAKrBA,EAAA,IAAM,MAKNA,EAAA,KAAO,OAKPA,EAAA,oBAAsB,aAKtBA,EAAA,cAAgB,UAKhBA,EAAA,YAAc,eAKdA,EAAA,cAAgB,QAC9B,GA7HiBA,IAAOppD,EAAA,QAAPopD,EAAO,CAAA,EAAA,EA+HxB,SAAgBF,EAAcrlD,EAAsBsjD,EAAc,CACjE,OAAIkC,EAAA,IAAI,MAAMxlD,CAAM,KACZ6vC,EAAA,kBAAiB7vC,EAAO,OAAQsjD,CAAM,KAEtCzT,EAAA,sBAAqB7vC,EAAQsjD,EAAS,GAAG,CAElD,CAEA,SAAgBgC,EAAkBtlD,KAAyBylD,EAAiB,CAC3E,OAAOA,EAAQ,KAAKnC,GAAU+B,EAAcrlD,EAAQsjD,CAAM,CAAC,CAC5D,CACannD,EAAA,yBAA2B,MAExC,MAAMupD,CAAqB,CAA3B,aAAA,CACkB,KAAA,OAAsD,OAAO,OAAO,IAAI,EACxE,KAAA,OAAsD,OAAO,OAAO,IAAI,EACxE,KAAA,kBAAiE,OAAO,OAAO,IAAI,EAC5F,KAAA,oBAAwC,OACxC,KAAA,UAAwC,KACxC,KAAA,gBAA0B,GAqCnC,CAnCC,sBAAsBC,EAAwB,CAC7C,KAAK,oBAAsBA,CAC5B,CAEA,IAAY,sBAAoB,CAC/B,OAAOhsD,EAAM,MAAM,KAAK,KAAK,gBAAiB4rD,EAAQ,oBAAoB,CAC3E,CAEA,QAAQh2D,EAAQ,CACf,GAAI,KAAK,UACR,GAAI,CACH,OAAO,KAAK,UAAUA,CAAG,CAC1B,OAASW,EAAK,CACb,OAAAme,EAAO,kBAAkBne,CAAG,EACrBX,CACR,CAED,MAAMq0D,EAAYr0D,EAAI,UACtB,IAAIq2D,EAAO,KAAK,OAAOhC,CAAS,EAC5BgC,GAAQA,EAAK,QAAQ,GAAG,IAAM,IAAMA,EAAK,QAAQ,GAAG,IAAM,KAC7DA,EAAO,IAAIA,CAAI,KAEhB,MAAMC,EAAO,KAAK,OAAOjC,CAAS,EAC5BkC,EAAkB,KAAK,kBAAkBlC,CAAS,EACxD,IAAIC,EAAQ,QAAQ,mBAAmBt0D,EAAI,IAAI,CAAC,GAChD,OAAI,OAAOu2D,GAAoB,WAC9BjC,GAAS,IAAI1nD,EAAA,wBAAwB,IAAI,mBAAmB2pD,CAAe,CAAC,IAEtEN,EAAA,IAAI,KAAK,CACf,OAAQO,EAAS,MAAQ,KAAK,oBAAsBR,EAAQ,qBAC5D,UAAW,GAAGK,CAAI,IAAIC,CAAI,GAC1B,KAAM,KAAK,qBACX,MAAAhC,EACA,CACF,EAGY1nD,EAAA,kBAAoB,IAAIupD,EAaxBvpD,EAAA,iBAAmB,aAEhC,MAAM6pD,CAAc,QAEK,KAAA,mBAAqB7pD,EAAA,gBAAiB,CAQ9D,aAAa8pD,EAAkC,CAE9C,MAAM12D,EAAM,KAAK,MAAM02D,EAAc1yD,CAAO,EAK5C,OAAO,KAAK,gBAAgBhE,CAAG,CAChC,CAQA,gBAAgBA,EAAQ,CAEvB,OAAIA,EAAI,SAAWg2D,EAAQ,aACnBppD,EAAA,kBAAkB,QAAQ5M,CAAG,EAMpCA,EAAI,SAAWg2D,EAAQ,OAGtBQ,EAAS,UAERA,EAAS,kBAAoB,GAAGR,EAAQ,kBAAkB,MAAMS,EAAe,kBAAkB,IAG5Fz2D,EAAI,KAAK,CACf,OAAQg2D,EAAQ,mBAKhB,UAAWh2D,EAAI,WAAay2D,EAAe,mBAC3C,MAAO,KACP,SAAU,KACV,EAGKz2D,CACR,CAEQ,MAAM22D,EAA2BC,EAAmD,CAC3F,GAAIX,EAAA,IAAI,MAAMU,CAAW,EACxB,OAAOA,EAGR,GAAI,WAAW,kBAAmB,CACjC,MAAME,EAAgB,WAAW,kBAGjC,GAAI,qBAAqB,KAAKA,CAAa,EAC1C,OAAOZ,EAAA,IAAI,SAASA,EAAA,IAAI,MAAMY,EAAe,EAAI,EAAGF,CAAW,EAIhE,MAAMG,EAAa1sD,EAAM,KAAKysD,EAAeF,CAAW,EACxD,OAAOV,EAAA,IAAI,KAAKa,CAAU,CAC3B,CAEA,OAAOb,EAAA,IAAI,MAAMW,EAAe,MAAMD,CAAW,CAAC,CACnD,EAGY/pD,EAAA,WAAa,IAAI6pD,EAG9B,IAAiBM,GAAjB,SAAiBA,EAAG,CAEnB,MAAMC,EAAa,IAAI,IAAsD,CAC5E,CAAC,IAAK,CAAE,6BAA8B,aAAa,CAAE,EACrD,CAAC,IAAK,CAAE,+BAAgC,cAAc,CAAE,EACxD,CAAC,IAAK,CAAE,6BAA8B,cAAe,+BAAgC,cAAc,CAAE,EACrG,EAEYD,EAAA,YAAc,OAAO,OAAOC,EAAW,IAAI,GAAG,CAAC,EAE5D,MAAMC,EAAqB,aAK3B,SAAgBC,EAAoB/2D,EAAuB,CAC1D,IAAI8I,EACA,OAAO9I,GAAQ,SAClB8I,EAAS,IAAI,IAAI9I,CAAG,EAAE,aACZA,aAAe,IACzB8I,EAAS9I,EAAI,aACH81D,EAAA,IAAI,MAAM91D,CAAG,IACvB8I,EAAS,IAAI,IAAI9I,EAAI,SAAS,EAAI,CAAC,EAAE,cAEtC,MAAMK,EAAQyI,GAAQ,IAAIguD,CAAkB,EAC5C,GAAKz2D,EAGL,OAAOw2D,EAAW,IAAIx2D,CAAK,CAC5B,CAdgBu2D,EAAA,oBAAmBG,EAoBnC,SAAgBC,EAAeC,EAAuDC,EAAeC,EAAa,CACjH,GAAI,CAAO,WAAY,oBAEtB,OAED,MAAM92D,EAAQ62D,GAAQC,EAAO,IAAMA,EAAO,IAAM,IAC5CF,aAAuB,gBAC1BA,EAAY,IAAIH,EAAoBz2D,CAAK,EAEhB42D,EAAaH,CAAkB,EAAIz2D,CAE9D,CAXgBu2D,EAAA,eAAcI,CAY/B,GA/CiBJ,IAAGnqD,EAAA,IAAHmqD,EAAG,CAAA,EAAA,4KC1PpBnqD,EAAA,wBAAA2qD,EA8iBA3qD,EAAA,OAAA4qD,EA3kBA,MAAMC,EAAQ,GAMRC,EAAkB,UAClBC,EAAa,cAqBnB,IAAIC,EAAyB,GAC7B,SAAgBL,EAAwB52D,EAAQ,CAC1CwtD,EAAA,QAIAyJ,IACJA,EAAyB,GACzB,QAAQ,KAAK,iLAAiL,GAE/L,QAAQ,KAAKj3D,EAAI,OAAO,EACzB,CASA,MAAMk3D,CAAc,CAEnB,YACiBC,EACAC,EACAC,EACAz7B,EACA33B,EAAW,CAJX,KAAA,SAAAkzD,EACA,KAAA,IAAAC,EACA,KAAA,QAAAC,EACA,KAAA,OAAAz7B,EACA,KAAA,KAAA33B,EAND,KAAA,KAAI,CAOhB,EAEL,MAAMqzD,CAAY,CAEjB,YACiBH,EACAvlB,EACAnyB,EACAzf,EAAQ,CAHR,KAAA,SAAAm3D,EACA,KAAA,IAAAvlB,EACA,KAAA,IAAAnyB,EACA,KAAA,IAAAzf,EALD,KAAA,KAAI,CAMhB,EAEL,MAAMu3D,CAAqB,CAE1B,YACiBJ,EACAC,EACAC,EACAtyC,EACAlV,EAAQ,CAJR,KAAA,SAAAsnD,EACA,KAAA,IAAAC,EACA,KAAA,QAAAC,EACA,KAAA,UAAAtyC,EACA,KAAA,IAAAlV,EAND,KAAA,KAAI,CAOhB,EAEL,MAAM2nD,CAAY,CAEjB,YACiBL,EACAC,EACAn1C,EAAU,CAFV,KAAA,SAAAk1C,EACA,KAAA,IAAAC,EACA,KAAA,MAAAn1C,EAJD,KAAA,KAAI,CAKhB,EAEL,MAAMw1C,CAAuB,CAE5B,YACiBN,EACAC,EAAW,CADX,KAAA,SAAAD,EACA,KAAA,IAAAC,EAHD,KAAA,KAAI,CAIhB,EAeL,MAAMM,CAAoB,CASzB,YAAYlyC,EAAwB,CACnC,KAAK,UAAY,GACjB,KAAK,SAAWA,EAChB,KAAK,aAAe,EACpB,KAAK,gBAAkB,OAAO,OAAO,IAAI,EACzC,KAAK,iBAAmB,IAAI,IAC5B,KAAK,eAAiB,IAAI,GAC3B,CAEO,YAAYmyC,EAAgB,CAClC,KAAK,UAAYA,CAClB,CAEO,YAAYN,EAAiBz7B,EAAgB33B,EAAW,CAC9D,MAAMmzD,EAAM,OAAO,EAAE,KAAK,YAAY,EACtC,OAAO,IAAI,QAAa,CAAChsD,EAASC,IAAU,CAC3C,KAAK,gBAAgB+rD,CAAG,EAAI,CAC3B,QAAShsD,EACT,OAAQC,GAET,KAAK,MAAM,IAAI6rD,EAAe,KAAK,UAAWE,EAAKC,EAASz7B,EAAQ33B,CAAI,CAAC,CAC1E,CAAC,CACF,CAEO,OAAOozD,EAAiBtyC,EAAmBlV,EAAQ,CACzD,IAAIunD,EAAqB,KACzB,MAAMn0C,EAAU,IAAI4F,EAAA,QAAa,CAChC,uBAAwB,IAAK,CAC5BuuC,EAAM,OAAO,EAAE,KAAK,YAAY,EAChC,KAAK,iBAAiB,IAAIA,EAAKn0C,CAAO,EACtC,KAAK,MAAM,IAAIs0C,EAAsB,KAAK,UAAWH,EAAKC,EAAStyC,EAAWlV,CAAG,CAAC,CACnF,EACA,wBAAyB,IAAK,CAC7B,KAAK,iBAAiB,OAAOunD,CAAI,EACjC,KAAK,MAAM,IAAIK,EAAwB,KAAK,UAAWL,CAAI,CAAC,EAC5DA,EAAM,IACP,EACA,EACD,OAAOn0C,EAAQ,KAChB,CAEO,cAAcjX,EAAgB,CAChC,CAACA,GAAW,CAACA,EAAQ,UAGrB,KAAK,YAAc,IAAMA,EAAQ,WAAa,KAAK,WAGvD,KAAK,eAAeA,CAAO,CAC5B,CAEO,2BAA6CqrD,EAAiBO,EAAwC,CAC5G,MAAMpyC,EAAU,CACf,IAAK,CAAC1V,EAAamI,KACd,OAAOA,GAAS,UAAY,CAACnI,EAAOmI,CAAI,IACvC4/C,EAAuB5/C,CAAI,EAC9BnI,EAAOmI,CAAI,EAAKpI,GACR,KAAK,OAAOwnD,EAASp/C,EAAMpI,CAAG,EAE5BioD,EAAgB7/C,CAAI,EAC9BnI,EAAOmI,CAAI,EAAI,KAAK,OAAOo/C,EAASp/C,EAAM,MAAS,EACzCA,EAAK,WAAW,CAAC,IAAC,KAC5BnI,EAAOmI,CAAI,EAAI,SAAU8/C,KACxB,MAAMH,IAAoB,EACnB,KAAK,YAAYP,EAASp/C,EAAM8/C,CAAM,KAIzCjoD,EAAOmI,CAAI,IAGpB,OAAO,IAAI,MAAM,OAAO,OAAO,IAAI,EAAGuN,CAAO,CAC9C,CAEQ,eAAe5Z,EAAY,CAClC,OAAQA,EAAI,KAAM,CACjB,IAAA,GACC,OAAO,KAAK,oBAAoBA,CAAG,EACpC,IAAA,GACC,OAAO,KAAK,sBAAsBA,CAAG,EACtC,IAAA,GACC,OAAO,KAAK,6BAA6BA,CAAG,EAC7C,IAAA,GACC,OAAO,KAAK,oBAAoBA,CAAG,EACpC,IAAA,GACC,OAAO,KAAK,+BAA+BA,CAAG,CAChD,CACD,CAEQ,oBAAoBosD,EAA0B,CACrD,GAAI,CAAC,KAAK,gBAAgBA,EAAa,GAAG,EAAG,CAC5C,QAAQ,KAAK,0BAA0B,EACvC,MACD,CAEA,MAAMC,EAAQ,KAAK,gBAAgBD,EAAa,GAAG,EAGnD,GAFA,OAAO,KAAK,gBAAgBA,EAAa,GAAG,EAExCA,EAAa,IAAK,CACrB,IAAIh4D,EAAMg4D,EAAa,IACnBA,EAAa,IAAI,WACpBh4D,EAAM,IAAI,MACVA,EAAI,KAAOg4D,EAAa,IAAI,KAC5Bh4D,EAAI,QAAUg4D,EAAa,IAAI,QAC/Bh4D,EAAI,MAAQg4D,EAAa,IAAI,OAE9BC,EAAM,OAAOj4D,CAAG,EAChB,MACD,CAEAi4D,EAAM,QAAQD,EAAa,GAAG,CAC/B,CAEQ,sBAAsBE,EAA8B,CAC3D,MAAMd,EAAMc,EAAe,IACZ,KAAK,SAAS,cAAcA,EAAe,QAASA,EAAe,OAAQA,EAAe,IAAI,EACtG,KAAMhyD,GAAK,CACjB,KAAK,MAAM,IAAIoxD,EAAa,KAAK,UAAWF,EAAKlxD,EAAG,MAAS,CAAC,CAC/D,EAAI7D,GAAK,CACJA,EAAE,kBAAkB,QAEvBA,EAAE,UAASuW,EAAA,gCAA+BvW,EAAE,MAAM,GAEnD,KAAK,MAAM,IAAIi1D,EAAa,KAAK,UAAWF,EAAK,UAAWx+C,EAAA,gCAA+BvW,CAAC,CAAC,CAAC,CAC/F,CAAC,CACF,CAEQ,6BAA6BuJ,EAA0B,CAC9D,MAAMwrD,EAAMxrD,EAAI,IACViS,EAAa,KAAK,SAAS,YAAYjS,EAAI,QAASA,EAAI,UAAWA,EAAI,GAAG,EAAGqW,GAAS,CAC3F,KAAK,MAAM,IAAIu1C,EAAa,KAAK,UAAWJ,EAAKn1C,CAAK,CAAC,CACxD,CAAC,EACD,KAAK,eAAe,IAAIm1C,EAAKv5C,CAAU,CACxC,CAEQ,oBAAoBjS,EAAiB,CAC5C,GAAI,CAAC,KAAK,iBAAiB,IAAIA,EAAI,GAAG,EAAG,CACxC,QAAQ,KAAK,2BAA2B,EACxC,MACD,CACA,KAAK,iBAAiB,IAAIA,EAAI,GAAG,EAAG,KAAKA,EAAI,KAAK,CACnD,CAEQ,+BAA+BA,EAA4B,CAClE,GAAI,CAAC,KAAK,eAAe,IAAIA,EAAI,GAAG,EAAG,CACtC,QAAQ,KAAK,iCAAiC,EAC9C,MACD,CACA,KAAK,eAAe,IAAIA,EAAI,GAAG,EAAG,QAAO,EACzC,KAAK,eAAe,OAAOA,EAAI,GAAG,CACnC,CAEQ,MAAMA,EAAY,CACzB,MAAMC,EAA0B,CAAA,EAChC,GAAID,EAAI,OAAI,EACX,QAAShL,EAAI,EAAGA,EAAIgL,EAAI,KAAK,OAAQhL,IAChCgL,EAAI,KAAKhL,CAAC,YAAa,aAC1BiL,EAAS,KAAKD,EAAI,KAAKhL,CAAC,CAAC,OAGjBgL,EAAI,OAAI,GACdA,EAAI,eAAe,aACtBC,EAAS,KAAKD,EAAI,GAAG,EAGvB,KAAK,SAAS,YAAYA,EAAKC,CAAQ,CACxC,EA2BD,MAAassD,UAA6Cv2C,EAAA,UAAU,CAQnE,YACCw2C,EACAC,EAAmC,CAEnC,MAAK,EANW,KAAA,eAAsC,IAAI,IAQ1D,KAAK,QAAU,KAAK,UAAUD,EAAc,OAC3C,CACC,YAAa,qCACb,kBAAmBC,EAAiB,kBACpC,MAAOA,EAAiB,OAExBzsD,GAAgB,CAChB,KAAK,UAAU,cAAcA,CAAG,CACjC,EACC5L,GAAY,IAGZ4Y,EAAA,mBAAkB5Y,CAAG,CACtB,CAAC,CACD,EAED,KAAK,UAAY,IAAI03D,EAAqB,CACzC,YAAa,CAAC9rD,EAAUC,IAAiC,CACxD,KAAK,QAAQ,YAAYD,EAAKC,CAAQ,CACvC,EACA,cAAe,CAACwrD,EAAiBz7B,EAAgB33B,IACzC,KAAK,eAAeozD,EAASz7B,EAAQ33B,CAAI,EAEjD,YAAa,CAACozD,EAAiBtyC,EAAmBlV,IAC1C,KAAK,aAAawnD,EAAStyC,EAAWlV,CAAG,EAEjD,EACD,KAAK,UAAU,YAAY,KAAK,QAAQ,MAAK,CAAE,EAG/C,IAAIyoD,EAA2B,KAE/B,MAAMC,EAAuD,WAAmB,QAC5E,OAAOA,EAAkB,KAAe,OAAOA,EAAc,WAAc,WAE9ED,EAAsBC,EAAc,UAAS,EACnC,OAAQ,WAAmB,UAAc,MAEnDD,EAAuB,WAAmB,UAAU,EAAE,SAAS,EAAE,QAIlE,KAAK,gBAAkB,KAAK,UAAU,YAAYvB,EAAiBC,EAAY,CAC9E,KAAK,QAAQ,MAAK,EAClB,KAAK,MAAM,KAAK,UAAUsB,CAAmB,CAAC,EAC9CD,EAAiB,YACjB,EAED,KAAK,MAAQ,KAAK,UAAU,2BAA2BtB,EAAiB,SAAW,CAAG,MAAM,KAAK,eAAiB,CAAC,EACnH,KAAK,gBAAgB,MAAO10D,GAAK,CAChC,KAAK,SAAS,yBAA2Bg2D,EAAiB,YAAah2D,CAAC,CACzE,CAAC,CACF,CAEQ,eAAem2D,EAAqB58B,EAAgB33B,EAAW,CACtE,MAAMozD,EAA8B,KAAK,eAAe,IAAImB,CAAW,EACvE,GAAI,CAACnB,EACJ,OAAO,QAAQ,OAAO,IAAI,MAAM,mBAAmBmB,CAAW,iBAAiB,CAAC,EAEjF,GAAI,OAAQnB,EAAgBz7B,CAAM,GAAM,WACvC,OAAO,QAAQ,OAAO,IAAI,MAAM,kBAAkBA,CAAM,2BAA2B48B,CAAW,EAAE,CAAC,EAGlG,GAAI,CACH,OAAO,QAAQ,QAASnB,EAAgBz7B,CAAM,EAAE,MAAMy7B,EAASpzD,CAAI,CAAC,CACrE,OAAS5B,EAAG,CACX,OAAO,QAAQ,OAAOA,CAAC,CACxB,CACD,CAEQ,aAAam2D,EAAqBzzC,EAAmBlV,EAAQ,CACpE,MAAMwnD,EAA8B,KAAK,eAAe,IAAImB,CAAW,EACvE,GAAI,CAACnB,EACJ,MAAM,IAAI,MAAM,mBAAmBmB,CAAW,iBAAiB,EAEhE,GAAIX,EAAuB9yC,CAAS,EAAG,CACtC,MAAM9C,EAASo1C,EAAgBtyC,CAAS,EAAE,KAAKsyC,EAASxnD,CAAG,EAC3D,GAAI,OAAOoS,GAAU,WACpB,MAAM,IAAI,MAAM,yBAAyB8C,CAAS,2BAA2ByzC,CAAW,GAAG,EAE5F,OAAOv2C,CACR,CACA,GAAI61C,EAAgB/yC,CAAS,EAAG,CAC/B,MAAM9C,EAASo1C,EAAgBtyC,CAAS,EACxC,GAAI,OAAO9C,GAAU,WACpB,MAAM,IAAI,MAAM,iBAAiB8C,CAAS,2BAA2ByzC,CAAW,GAAG,EAEpF,OAAOv2C,CACR,CACA,MAAM,IAAI,MAAM,wBAAwB8C,CAAS,EAAE,CACpD,CAEO,WAA6BsyC,EAAiB7xC,EAAU,CAC9D,KAAK,eAAe,IAAI6xC,EAAS7xC,CAAO,CACzC,CAEQ,SAASxZ,EAAiBnD,EAAW,CAC5C,QAAQ,MAAMmD,CAAO,EACrB,QAAQ,KAAKnD,CAAK,CACnB,EAjHDoD,EAAA,mBAAAksD,EAoHA,SAASL,EAAgB7/C,EAAY,CAEpC,OAAOA,EAAK,CAAC,IAAM,KAAOA,EAAK,CAAC,IAAM,KAAO2Z,EAAQ,mBAAmB3Z,EAAK,WAAW,CAAC,CAAC,CAC3F,CAEA,SAAS4/C,EAAuB5/C,EAAY,CAE3C,MAAO,aAAa,KAAKA,CAAI,GAAK2Z,EAAQ,mBAAmB3Z,EAAK,WAAW,CAAC,CAAC,CAChF,CAcA,MAAawgD,CAAkB,CAQ9B,YAAYC,EAA+DC,EAAoD,CAH9G,KAAA,eAAsC,IAAI,IAC1C,KAAA,gBAAuC,IAAI,IAG3D,KAAK,uBAAyBA,EAC9B,KAAK,gBAAkB,KACvB,KAAK,UAAY,IAAIjB,EAAqB,CACzC,YAAa,CAAC9rD,EAAUC,IAAiC,CACxD6sD,EAAY9sD,EAAKC,CAAQ,CAC1B,EACA,cAAe,CAACwrD,EAAiBz7B,EAAgB33B,IAA8B,KAAK,eAAeozD,EAASz7B,EAAQ33B,CAAI,EACxH,YAAa,CAACozD,EAAiBtyC,EAAmBlV,IAAyB,KAAK,aAAawnD,EAAStyC,EAAWlV,CAAG,EACpH,CACF,CAEO,UAAUjE,EAAQ,CACxB,KAAK,UAAU,cAAcA,CAAG,CACjC,CAEQ,eAAeyrD,EAAiBz7B,EAAgB33B,EAAW,CAClE,GAAIozD,IAAYN,GAAmBn7B,IAAWo7B,EAC7C,OAAO,KAAK,WAAmB/yD,EAAK,CAAC,EAAQA,EAAK,CAAC,EAAWA,EAAK,CAAC,CAAC,EAGtE,MAAM20D,EAA6CvB,IAAYN,EAAkB,KAAK,gBAAkB,KAAK,eAAe,IAAIM,CAAO,EACvI,GAAI,CAACuB,EACJ,OAAO,QAAQ,OAAO,IAAI,MAAM,mBAAmBvB,CAAO,mBAAmB,CAAC,EAE/E,GAAI,OAAQuB,EAAuBh9B,CAAM,GAAM,WAC9C,OAAO,QAAQ,OAAO,IAAI,MAAM,kBAAkBA,CAAM,6BAA6By7B,CAAO,EAAE,CAAC,EAGhG,GAAI,CACH,OAAO,QAAQ,QAASuB,EAAuBh9B,CAAM,EAAE,MAAMg9B,EAAgB30D,CAAI,CAAC,CACnF,OAAS5B,EAAG,CACX,OAAO,QAAQ,OAAOA,CAAC,CACxB,CACD,CAEQ,aAAag1D,EAAiBtyC,EAAmBlV,EAAQ,CAChE,MAAM+oD,EAA6CvB,IAAYN,EAAkB,KAAK,gBAAkB,KAAK,eAAe,IAAIM,CAAO,EACvI,GAAI,CAACuB,EACJ,MAAM,IAAI,MAAM,mBAAmBvB,CAAO,mBAAmB,EAE9D,GAAIQ,EAAuB9yC,CAAS,EAAG,CACtC,MAAM9C,EAAS22C,EAAuB7zC,CAAS,EAAE,KAAK6zC,EAAgB/oD,CAAG,EACzE,GAAI,OAAOoS,GAAU,WACpB,MAAM,IAAI,MAAM,yBAAyB8C,CAAS,sBAAsB,EAEzE,OAAO9C,CACR,CACA,GAAI61C,EAAgB/yC,CAAS,EAAG,CAC/B,MAAM9C,EAAS22C,EAAuB7zC,CAAS,EAC/C,GAAI,OAAO9C,GAAU,WACpB,MAAM,IAAI,MAAM,iBAAiB8C,CAAS,sBAAsB,EAEjE,OAAO9C,CACR,CACA,MAAM,IAAI,MAAM,wBAAwB8C,CAAS,EAAE,CACpD,CAEO,WAA6BsyC,EAAe,CAClD,GAAI,CAAC,KAAK,gBAAgB,IAAIA,CAAO,EAAG,CACvC,MAAMwB,EAAO,KAAK,UAAU,2BAA2BxB,CAAO,EAC9D,KAAK,gBAAgB,IAAIA,EAASwB,CAAI,CACvC,CACA,OAAO,KAAK,gBAAgB,IAAIxB,CAAO,CACxC,CAEQ,MAAM,WAAWM,EAAkBmB,EAAmB73D,EAAgB,CAG7E,GAFA,KAAK,UAAU,YAAY02D,CAAQ,EAE/B,KAAK,uBAAwB,CAEhC,KAAK,gBAAkB,KAAK,uBAAuB,IAAI,EACvD,MACD,CAsBA,GApBImB,IAEC,OAAOA,EAAa,QAAY,KACnC,OAAOA,EAAa,QAEjB,OAAOA,EAAa,MAAU,KAC7B,OAAOA,EAAa,MAAM,GAAO,KACpC,OAAOA,EAAa,MAAM,GAGxB,OAAOA,EAAa,mBAAuB,KAE9C,OAAOA,EAAa,mBAIrBA,EAAa,WAAa,GAC1B,WAAW,QAAQ,OAAOA,CAAY,GAGnChC,EAAO,CACV,MAAMt3D,EAAMu5D,EAAA,WAAW,aAAa,GAAG93D,CAAQ,KAAwB,EAAE,SAAS,EAAI,EACtF,OAAO,IAAA,QAAA,CAAA+3D,EAAAC,IAAA,CAAA51D,EAAA,CAAO,GAAG7D,CAAG,EAAE,EAAAw5D,EAAAC,CAAA,CAAA,CAAA,EAAE,KAAMhvD,GAA8C,CAG3E,GAFA,KAAK,gBAAkBA,EAAO,OAAO,IAAI,EAErC,CAAC,KAAK,gBACT,MAAM,IAAI,MAAM,oBAAoB,CAEtC,CAAC,CACF,CAEA,OAAO,IAAI,QAAc,CAACmB,EAASC,IAAU,EAI/B,WAAW,SAAWhI,GAM/B,CAACpC,CAAQ,EAAIgJ,GAA8C,CAG9D,GAFA,KAAK,gBAAkBA,EAAO,OAAO,IAAI,EAErC,CAAC,KAAK,gBAAiB,CAC1BoB,EAAO,IAAI,MAAM,oBAAoB,CAAC,EACtC,MACD,CAEAD,EAAO,CACR,EAAGC,CAAM,CACV,CAAC,CACF,EAvIDY,EAAA,mBAAAwsD,EA8IA,SAAgB5B,EAAO6B,EAA6D,CACnF,OAAO,IAAID,EAAmBC,EAAa,IAAI,CAChD,2lBCoeAzsD,EAAA,eAAAitD,EA0HAjtD,EAAA,sBAAAktD,EA1pCA,MAAaC,CAAK,CAGjB,YACiBptC,EACAntB,EACAw6D,EAAgB,CAFhB,KAAA,OAAArtC,EACA,KAAA,KAAAntB,EACA,KAAA,SAAAw6D,EALjB,KAAA,YAAoB,MAOpB,CAEO,UAAQ,CACd,MAAO,IAAM,KAAK,OAAS,KAAO,KAAK,KAAO,GAC/C,EAZDptD,EAAA,MAAAmtD,EAkBA,MAAaE,CAAkB,CAG9B,YACiBC,EACAC,EAAgB,CADhB,KAAA,OAAAD,EACA,KAAA,SAAAC,EAJjB,KAAA,yBAAiC,MAMjC,EAPDvtD,EAAA,mBAAAqtD,EAaA,MAAaG,CAAyB,CAGrC,YAOiBF,EACAC,EAAgB,CADhB,KAAA,OAAAD,EACA,KAAA,SAAAC,EAVjB,KAAA,gCAAwC,MAYxC,EAbDvtD,EAAA,0BAAAwtD,EAyJA,IAAYnT,GAAZ,SAAYA,EAAoB,CAI/BA,EAAAA,EAAA,SAAA,CAAA,EAAA,WAIAA,EAAAA,EAAA,SAAA,CAAA,EAAA,UACD,GATYA,IAAoBr6C,EAAA,qBAApBq6C,EAAoB,CAAA,EAAA,EA6ChC,IAAiBoT,GAAjB,SAAiBA,EAAmB,CAEnC,MAAMC,EAAS,IAAI,IACnBA,EAAO,IAAG,EAA4BC,EAAA,QAAQ,YAAY,EAC1DD,EAAO,IAAG,EAA8BC,EAAA,QAAQ,cAAc,EAC9DD,EAAO,IAAG,EAAiCC,EAAA,QAAQ,iBAAiB,EACpED,EAAO,IAAG,EAA2BC,EAAA,QAAQ,WAAW,EACxDD,EAAO,IAAG,EAA8BC,EAAA,QAAQ,cAAc,EAC9DD,EAAO,IAAG,EAA2BC,EAAA,QAAQ,WAAW,EACxDD,EAAO,IAAG,EAA4BC,EAAA,QAAQ,YAAY,EAC1DD,EAAO,IAAG,EAA+BC,EAAA,QAAQ,eAAe,EAChED,EAAO,IAAG,EAA4BC,EAAA,QAAQ,YAAY,EAC1DD,EAAO,IAAG,EAA8BC,EAAA,QAAQ,cAAc,EAC9DD,EAAO,IAAG,GAA2BC,EAAA,QAAQ,WAAW,EACxDD,EAAO,IAAG,GAA8BC,EAAA,QAAQ,cAAc,EAC9DD,EAAO,IAAG,GAA0BC,EAAA,QAAQ,UAAU,EACtDD,EAAO,IAAG,GAA2BC,EAAA,QAAQ,WAAW,EACxDD,EAAO,IAAG,GAA0BC,EAAA,QAAQ,UAAU,EACtDD,EAAO,IAAG,GAA8BC,EAAA,QAAQ,cAAc,EAC9DD,EAAO,IAAG,GAA0BC,EAAA,QAAQ,UAAU,EACtDD,EAAO,IAAG,GAAgCC,EAAA,QAAQ,gBAAgB,EAClED,EAAO,IAAG,GAA6BC,EAAA,QAAQ,aAAa,EAC5DD,EAAO,IAAG,GAA6BC,EAAA,QAAQ,aAAa,EAC5DD,EAAO,IAAG,GAA0BC,EAAA,QAAQ,UAAU,EACtDD,EAAO,IAAG,GAA2BC,EAAA,QAAQ,WAAW,EACxDD,EAAO,IAAG,GAA0BC,EAAA,QAAQ,UAAU,EACtDD,EAAO,IAAG,GAA+BC,EAAA,QAAQ,eAAe,EAChED,EAAO,IAAG,GAAiCC,EAAA,QAAQ,iBAAiB,EACpED,EAAO,IAAG,GAA4BC,EAAA,QAAQ,YAAY,EAC1DD,EAAO,IAAG,GAAmCC,EAAA,QAAQ,mBAAmB,EACxED,EAAO,IAAG,GAA0BC,EAAA,QAAQ,OAAO,EACnDD,EAAO,IAAG,GAA2BC,EAAA,QAAQ,MAAM,EAKnD,SAAgBC,EAAOC,EAAwB,CAC9C,IAAIC,EAAUJ,EAAO,IAAIG,CAAI,EAC7B,OAAKC,IACJ,QAAQ,KAAK,2CAA6CD,CAAI,EAC9DC,EAAUH,EAAA,QAAQ,gBAEZG,CACR,CAPgBL,EAAA,OAAMG,EAStB,MAAM/1D,EAAO,IAAI,IACjBA,EAAK,IAAI,SAAQ,CAAA,EACjBA,EAAK,IAAI,WAAU,CAAA,EACnBA,EAAK,IAAI,cAAe,CAAmC,EAC3DA,EAAK,IAAI,QAAO,CAAA,EAChBA,EAAK,IAAI,WAAU,CAAA,EACnBA,EAAK,IAAI,QAAO,CAAA,EAChBA,EAAK,IAAI,SAAQ,CAAA,EACjBA,EAAK,IAAI,YAAW,CAAA,EACpBA,EAAK,IAAI,SAAQ,CAAA,EACjBA,EAAK,IAAI,WAAU,CAAA,EACnBA,EAAK,IAAI,QAAO,EAAA,EAChBA,EAAK,IAAI,WAAU,EAAA,EACnBA,EAAK,IAAI,OAAM,EAAA,EACfA,EAAK,IAAI,QAAO,EAAA,EAChBA,EAAK,IAAI,WAAU,EAAA,EACnBA,EAAK,IAAI,OAAM,EAAA,EACfA,EAAK,IAAI,cAAa,EAAA,EACtBA,EAAK,IAAI,aAAY,EAAA,EACrBA,EAAK,IAAI,UAAS,EAAA,EAClBA,EAAK,IAAI,UAAS,EAAA,EAClBA,EAAK,IAAI,OAAM,EAAA,EACfA,EAAK,IAAI,QAAO,EAAA,EAChBA,EAAK,IAAI,OAAM,EAAA,EACfA,EAAK,IAAI,YAAW,EAAA,EACpBA,EAAK,IAAI,cAAa,EAAA,EACtBA,EAAK,IAAI,SAAQ,EAAA,EACjBA,EAAK,IAAI,iBAAgB,EAAA,EACzBA,EAAK,IAAI,gBAAe,EAAA,EACxBA,EAAK,IAAI,UAAS,EAAA,EAClBA,EAAK,IAAI,QAAO,EAAA,EAahB,SAAgBsY,EAAWvc,EAAem0D,EAAgB,CACzD,IAAIv0C,EAAM3b,EAAK,IAAIjE,CAAK,EACxB,OAAI,OAAO4f,EAAQ,KAAe,CAACu0C,IAClCv0C,EAAG,GAEGA,CACR,CANgBi6C,EAAA,WAAUt9C,CAO3B,GA/FiBs9C,IAAmBztD,EAAA,oBAAnBytD,EAAmB,CAAA,EAAA,EAmTpC,IAAYjT,GAAZ,SAAYA,EAA2B,CAKtCA,EAAAA,EAAA,UAAA,CAAA,EAAA,YAMAA,EAAAA,EAAA,SAAA,CAAA,EAAA,UACD,GAZYA,IAA2Bx6C,EAAA,4BAA3Bw6C,EAA2B,CAAA,EAAA,EA4BvC,MAAauT,CAAsB,CAClC,YACiB7sD,EACApK,EACAk3D,EACAC,EAAsB,CAHtB,KAAA,MAAA/sD,EACA,KAAA,KAAApK,EACA,KAAA,eAAAk3D,EACA,KAAA,cAAAC,CAEjB,CAEO,OAAOhsD,EAA6B,CAC1C,OAAOqxB,EAAA,MAAM,KAAK,KAAK,KAAK,EAAE,YAAYrxB,EAAM,KAAK,GACjD,KAAK,OAASA,EAAM,MACpB,KAAK,iBAAmBA,EAAM,gBAC9B,KAAK,gBAAkBA,EAAM,aAClC,EAdDjC,EAAA,uBAAA+tD,EA2LA,IAAYG,GAAZ,SAAYA,EAAwB,CACnCA,EAAAA,EAAA,UAAA,CAAA,EAAA,YACAA,EAAAA,EAAA,QAAA,CAAA,EAAA,SACD,GAHYA,IAAwBluD,EAAA,yBAAxBkuD,EAAwB,CAAA,EAAA,EAwGpC,IAAYvS,GAAZ,SAAYA,EAAwB,CACnCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,iBAAA,CAAA,EAAA,mBACAA,EAAAA,EAAA,cAAA,CAAA,EAAA,eACD,GAJYA,IAAwB37C,EAAA,yBAAxB27C,EAAwB,CAAA,EAAA,EA+BpC,IAAY3B,GAAZ,SAAYA,EAAqB,CAIhCA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OAIAA,EAAAA,EAAA,MAAA,CAAA,EAAA,OACD,GAbYA,IAAqBh6C,EAAA,sBAArBg6C,EAAqB,CAAA,EAAA,EA0KjC,SAAgBiT,EAAe9/C,EAAU,CACxC,OAAOA,GACHk8C,EAAA,IAAI,MAAOl8C,EAAuB,GAAG,GACrCmmB,EAAA,MAAM,SAAUnmB,EAAuB,KAAK,IAC3CmmB,EAAA,MAAM,SAAUnmB,EAAuB,oBAAoB,GAAKmmB,EAAA,MAAM,SAAUnmB,EAAuB,oBAAoB,EACjI,CAqFanN,EAAA,gBAAgD,CAC5D,MAAoBmuD,EAAA,UAAS,IAAS,OAAO,EAC7C,MAAsBA,EAAA,UAAS,IAAW,SAAS,EACnD,KAAoBA,EAAA,UAAS,IAAS,OAAO,EAC7C,MAAuBA,EAAA,UAAS,IAAY,UAAU,EACtD,KAA0BA,EAAA,UAAS,IAAe,aAAa,EAC/D,KAAmBA,EAAA,UAAS,IAAQ,aAAa,EACjD,MAAyBA,EAAA,UAAS,IAAc,oBAAoB,EACpE,MAAoBA,EAAA,UAAS,IAAS,OAAO,EAC7C,KAAoBA,EAAA,UAAS,IAAS,OAAO,EAC7C,KAAmBA,EAAA,UAAS,IAAQ,MAAM,EAC1C,MAAuBA,EAAA,UAAS,IAAY,UAAU,EACtD,MAAwBA,EAAA,UAAS,IAAa,WAAW,EACzD,MAAkBA,EAAA,UAAS,IAAO,KAAK,EACvC,KAAqBA,EAAA,UAAS,IAAU,QAAQ,EAChD,KAAqBA,EAAA,UAAS,IAAU,QAAQ,EAChD,KAAwBA,EAAA,UAAS,IAAa,WAAW,EACzD,MAAmBA,EAAA,UAAS,IAAQ,MAAM,EAC1C,MAAqBA,EAAA,UAAS,IAAU,QAAQ,EAChD,MAAqBA,EAAA,UAAS,IAAU,QAAQ,EAChD,MAAuBA,EAAA,UAAS,IAAY,UAAU,EACtD,KAAsBA,EAAA,UAAS,IAAW,SAAS,EACnD,KAAuBA,EAAA,UAAS,IAAY,UAAU,EACtD,MAAqBA,EAAA,UAAS,IAAU,QAAQ,EAChD,MAAqBA,EAAA,UAAS,IAAU,QAAQ,EAChD,MAA4BA,EAAA,UAAS,IAAiB,gBAAgB,EACtE,MAAuBA,EAAA,UAAS,IAAY,UAAU,GAMvD,SAAgBjB,EAAsBkB,EAAoBP,EAAgB,CACzE,SAAOM,EAAA,UAAS,IAAmB,YAAaC,EAAYpuD,EAAA,gBAAgB6tD,CAAI,CAAC,CAClF,CASA,IAAiBQ,GAAjB,SAAiBA,EAAW,CAE3B,MAAMX,EAAS,IAAI,IACnBA,EAAO,IAAG,EAAkBC,EAAA,QAAQ,UAAU,EAC9CD,EAAO,IAAG,EAAoBC,EAAA,QAAQ,YAAY,EAClDD,EAAO,IAAG,EAAuBC,EAAA,QAAQ,eAAe,EACxDD,EAAO,IAAG,EAAqBC,EAAA,QAAQ,aAAa,EACpDD,EAAO,IAAG,EAAmBC,EAAA,QAAQ,WAAW,EAChDD,EAAO,IAAG,EAAoBC,EAAA,QAAQ,YAAY,EAClDD,EAAO,IAAG,EAAsBC,EAAA,QAAQ,cAAc,EACtDD,EAAO,IAAG,EAAmBC,EAAA,QAAQ,WAAW,EAChDD,EAAO,IAAG,EAAyBC,EAAA,QAAQ,iBAAiB,EAC5DD,EAAO,IAAG,EAAkBC,EAAA,QAAQ,UAAU,EAC9CD,EAAO,IAAG,GAAuBC,EAAA,QAAQ,eAAe,EACxDD,EAAO,IAAG,GAAsBC,EAAA,QAAQ,cAAc,EACtDD,EAAO,IAAG,GAAsBC,EAAA,QAAQ,cAAc,EACtDD,EAAO,IAAG,GAAsBC,EAAA,QAAQ,cAAc,EACtDD,EAAO,IAAG,GAAoBC,EAAA,QAAQ,YAAY,EAClDD,EAAO,IAAG,GAAoBC,EAAA,QAAQ,YAAY,EAClDD,EAAO,IAAG,GAAqBC,EAAA,QAAQ,aAAa,EACpDD,EAAO,IAAG,GAAmBC,EAAA,QAAQ,WAAW,EAChDD,EAAO,IAAG,GAAoBC,EAAA,QAAQ,YAAY,EAClDD,EAAO,IAAG,GAAiBC,EAAA,QAAQ,SAAS,EAC5CD,EAAO,IAAG,GAAkBC,EAAA,QAAQ,UAAU,EAC9CD,EAAO,IAAG,GAAwBC,EAAA,QAAQ,gBAAgB,EAC1DD,EAAO,IAAG,GAAoBC,EAAA,QAAQ,YAAY,EAClDD,EAAO,IAAG,GAAmBC,EAAA,QAAQ,WAAW,EAChDD,EAAO,IAAG,GAAsBC,EAAA,QAAQ,cAAc,EACtDD,EAAO,IAAG,GAA2BC,EAAA,QAAQ,mBAAmB,EAIhE,SAAgBC,EAAOC,EAAgB,CACtC,IAAIS,EAAOZ,EAAO,IAAIG,CAAI,EAC1B,OAAKS,IACJ,QAAQ,KAAK,mCAAqCT,CAAI,EACtDS,EAAOX,EAAA,QAAQ,gBAETW,CACR,CAPgBD,EAAA,OAAMT,CAQvB,GAxCiBS,IAAWruD,EAAA,YAAXquD,EAAW,CAAA,EAAA,EA0E5B,MAAsBp5B,CAAQ,EAA9Bj1B,EAAA,SAAAi1B,EAuOA,MAAas5B,CAAgB,QAIZ,KAAA,QAAU,IAAIA,EAAiB,SAAS,CAAE,QAI1C,KAAA,QAAU,IAAIA,EAAiB,SAAS,CAAE,QAK1C,KAAA,OAAS,IAAIA,EAAiB,QAAQ,CAAE,CAOxD,OAAO,UAAU36D,EAAa,CAC7B,OAAQA,EAAO,CACd,IAAK,UAAW,OAAO26D,EAAiB,QACxC,IAAK,UAAW,OAAOA,EAAiB,QACxC,IAAK,SAAU,OAAOA,EAAiB,MACxC,CACA,OAAO,IAAIA,EAAiB36D,CAAK,CAClC,CAOA,YAA0BA,EAAa,CAAb,KAAA,MAAAA,CAC1B,EAnCDoM,EAAA,iBAAAuuD,EAuFA,IAAYvT,GAAZ,SAAYA,EAAgB,CAC3BA,EAAAA,EAAA,YAAA,CAAA,EAAA,aACD,GAFYA,IAAgBh7C,EAAA,iBAAhBg7C,EAAgB,CAAA,EAAA,EAI5B,IAAYC,GAAZ,SAAYA,EAAwB,CACnCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,WACD,GAHYA,IAAwBj7C,EAAA,yBAAxBi7C,EAAwB,CAAA,EAAA,EAyBpC,IAAiBuT,GAAjB,SAAiBA,EAAO,CAKvB,SAAgBthD,EAAG1Z,EAAQ,CAC1B,MAAI,CAACA,GAAO,OAAOA,GAAQ,SACnB,GAED,OAAiBA,EAAK,IAAO,UACnC,OAAiBA,EAAK,OAAU,QAClC,CANgBg7D,EAAA,GAAEthD,CAOnB,GAZiBshD,IAAOxuD,EAAA,QAAPwuD,EAAO,CAAA,EAAA,EAmDxB,IAAYjU,GAAZ,SAAYA,EAAa,CACxBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,WACD,GAHYA,IAAav6C,EAAA,cAAbu6C,EAAa,CAAA,EAAA,EAsFzB,MAAakU,CAAuB,CAGnC,YAA6BC,EAA2D,CAA3D,KAAA,cAAAA,EAFrB,KAAA,qBAAsE,IAG9E,CAEA,SAAO,CACF,KAAK,sBACR,KAAK,qBAAqB,KAAMrS,GAAW,CACtCA,GACHA,EAAQ,QAAO,CAEjB,CAAC,CAEH,CAEA,IAAI,qBAAmB,CACtB,OAAK,KAAK,uBACT,KAAK,qBAAuB,KAAK,cAAa,GAExC,KAAK,oBACb,EArBDr8C,EAAA,wBAAAyuD,EAkFazuD,EAAA,qBAAoE,IAAI2uD,EAAA,qBAKxE3uD,EAAA,+BAAwF,IAAI2uD,EAAA,qBA+EzG,IAAYlU,GAAZ,SAAYA,EAAqB,CAChCA,EAAAA,EAAA,OAAA,CAAA,EAAA,SACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,WACD,GAHYA,IAAqBz6C,EAAA,sBAArBy6C,EAAqB,CAAA,EAAA,2JC/3DjCz6C,EAAA,oBAAA4uD,EAXA,MAAaC,CAAM,QACK,KAAA,QAAO,IAA+B,QACtC,KAAA,MAAK,IAA6B,QAClC,KAAA,IAAG,GAA2B,QAC9B,KAAA,QAAO,GAA+B,CAEtD,OAAO,MAAMr+C,EAAmBC,EAAkB,CACxD,SAAOq+C,EAAA,UAASt+C,EAAWC,CAAU,CACtC,EARDzQ,EAAA,OAAA6uD,EAWA,SAAgBD,GAAmB,CAClC,MAAO,CACN,OAAQ,OACR,UAAW,OACX,wBAAyB/O,EAAA,wBACzB,QAASjjC,EAAA,QACT,QAASmyC,EAAgB,QACzB,OAAQF,EACR,SAAUt8B,EAAA,SACV,MAAOe,EAAA,MACP,UAAgB07B,EAAA,UAChB,mBAAoBD,EAAgB,mBACpC,eAAgBA,EAAgB,eAChC,UAAWA,EAAgB,UAC3B,IAAU1F,EAAA,IACV,MAAO4F,EAAA,MAET,8OCtBajvD,EAAA,8BAAgC,GAAK,IAElD,MAAakvD,UAAkCv5C,EAAA,UAAU,CAOxD,YAAYw5C,EAA0CC,EAA6BC,EAA0B,GAAK,CAKjH,GAJA,MAAK,EAJE,KAAA,cAAqD,OAAO,OAAO,IAAI,EACvE,KAAA,0BAA4D,OAAO,OAAO,IAAI,EAIrF,KAAK,OAASF,EACd,KAAK,cAAgBC,EAEjB,CAACC,EAAgB,CACpB,MAAMvO,EAAQ,IAAIwO,EAAA,cAClBxO,EAAM,aAAa,IAAM,KAAK,oBAAmB,EAAI,KAAK,MAAM9gD,EAAA,8BAAgC,CAAC,CAAC,EAClG,KAAK,UAAU8gD,CAAK,CACrB,CACD,CAEgB,SAAO,CACtB,UAAWyO,KAAY,KAAK,iBAC3B55C,EAAA,SAAQ,KAAK,cAAc45C,CAAQ,CAAC,EAErC,KAAK,cAAgB,OAAO,OAAO,IAAI,EACvC,KAAK,0BAA4B,OAAO,OAAO,IAAI,EACnD,MAAM,QAAO,CACd,CAEO,sBAAsBC,EAAkBC,EAA4B,GAAK,CAC/E,UAAW57C,KAAY27C,EAAW,CACjC,MAAME,EAAc77C,EAAS,SAAQ,EAEhC,KAAK,cAAc67C,CAAW,GAClC,KAAK,gBAAgB77C,EAAU47C,CAAgB,EAE5C,KAAK,cAAcC,CAAW,IACjC,KAAK,0BAA0BA,CAAW,EAAK,IAAI,KAAI,EAAI,QAAO,EAEpE,CACD,CAEQ,qBAAmB,CAC1B,MAAMC,EAAe,IAAI,KAAI,EAAI,QAAO,EAElCC,EAAqB,CAAA,EAC3B,UAAWL,KAAY,KAAK,0BACPI,EAAc,KAAK,0BAA0BJ,CAAQ,EACvDvvD,EAAA,+BACjB4vD,EAAS,KAAKL,CAAQ,EAIxB,UAAWn5D,KAAKw5D,EACf,KAAK,eAAex5D,CAAC,CAEvB,CAEQ,gBAAgByd,EAAe47C,EAAyB,CAC/D,MAAM5iB,EAAQ,KAAK,cAAc,SAASh5B,CAAQ,EAIlD,GAHI,CAACg5B,GAGD,CAAC4iB,GAAoB5iB,EAAM,qBAAoB,EAClD,OAGD,MAAM0iB,EAAW17C,EAAS,SAAQ,EAElC,KAAK,OAAO,gBAAgB,CAC3B,IAAKg5B,EAAM,IAAI,SAAQ,EACvB,MAAOA,EAAM,gBAAe,EAC5B,IAAKA,EAAM,OAAM,EACjB,UAAWA,EAAM,aAAY,EAC7B,EAED,MAAMgjB,EAAY,IAAIl6C,EAAA,gBACtBk6C,EAAU,IAAIhjB,EAAM,mBAAoBz2C,GAAK,CAC5C,KAAK,OAAO,oBAAoBm5D,EAAS,SAAQ,EAAIn5D,CAAC,CACvD,CAAC,CAAC,EACFy5D,EAAU,IAAIhjB,EAAM,cAAc,IAAK,CACtC,KAAK,eAAe0iB,CAAQ,CAC7B,CAAC,CAAC,EACFM,EAAU,OAAIl6C,EAAA,cAAa,IAAK,CAC/B,KAAK,OAAO,oBAAoB45C,CAAQ,CACzC,CAAC,CAAC,EAEF,KAAK,cAAcA,CAAQ,EAAIM,CAChC,CAEQ,eAAeN,EAAgB,CACtC,MAAMM,EAAY,KAAK,cAAcN,CAAQ,EAC7C,OAAO,KAAK,cAAcA,CAAQ,EAClC,OAAO,KAAK,0BAA0BA,CAAQ,KAC9C55C,EAAA,SAAQk6C,CAAS,CAClB,EA9FD7vD,EAAA,0BAAAkvD,EAiGA,MAAaY,CAAyB,CAIrC,aAAA,CACC,KAAK,QAAU,OAAO,OAAO,IAAI,CAClC,CAEO,SAAS18D,EAAW,CAC1B,OAAO,KAAK,QAAQA,CAAG,CACxB,CAEO,WAAS,CACf,MAAM28D,EAAqB,CAAA,EAC3B,cAAO,KAAK,KAAK,OAAO,EAAE,QAASr8D,GAAQq8D,EAAI,KAAK,KAAK,QAAQr8D,CAAG,CAAC,CAAC,EAC/Dq8D,CACR,CAEA,gBAAgBl4D,EAAmB,CAClC,KAAK,QAAQA,EAAK,GAAG,EAAI,IAAIm4D,EAAY3G,EAAA,IAAI,MAAMxxD,EAAK,GAAG,EAAGA,EAAK,MAAOA,EAAK,IAAKA,EAAK,SAAS,CACnG,CAEA,oBAAoBzE,EAAagD,EAAqB,CACrD,GAAI,CAAC,KAAK,QAAQhD,CAAG,EACpB,OAEa,KAAK,QAAQA,CAAG,EACxB,SAASgD,CAAC,CACjB,CAEA,oBAAoBhD,EAAW,CACzB,KAAK,QAAQA,CAAG,GAGrB,OAAO,KAAK,QAAQA,CAAG,CACxB,EAnCD4M,EAAA,0BAAA8vD,EAsCA,MAAaE,UAAoBC,EAAA,eAAe,CAE/C,IAAW,KAAG,CACb,OAAO,KAAK,IACb,CAEA,IAAW,KAAG,CACb,OAAO,KAAK,IACb,CAEO,UAAQ,CACd,OAAO,KAAK,QAAO,CACpB,CAEO,YAAYxiB,EAAa,CAC/B,MAAMN,EAAU,CAAA,EAChB,QAASx4C,EAAI,EAAGA,EAAI,KAAK,OAAO,OAAQA,IAAK,CAC5C,MAAMggC,EAAO,KAAK,OAAOhgC,CAAC,EACpBu7D,EAAc,KAAK,SAAS,IAAI39B,EAAA,SAAS59B,EAAI,EAAG,CAAC,CAAC,EAClDw7D,EAAsBx7B,EAAK,SAAS8Y,CAAK,EAC/C,UAAWjyB,KAAS20C,GACf30C,EAAM,OAASA,EAAM,QAAU,KAClCA,EAAM,MAAQA,EAAM,MAAQ00C,GAE7B/iB,EAAQ,KAAK3xB,CAAK,CAEpB,CACA,OAAO2xB,CACR,CAEO,iBAAe,CACrB,OAAO,KAAK,OAAO,MAAM,CAAC,CAC3B,CAEO,cAAY,CAClB,OAAO,KAAK,OAAO,MACpB,CAEO,eAAetc,EAAkB,CACvC,OAAO,KAAK,OAAOA,EAAa,CAAC,CAClC,CAEO,kBAAkBgB,EAAqBwF,EAAsB,CAEnE,MAAM+4B,KAAazX,EAAA,eAClB9mB,EAAS,UACT8mB,EAAA,2BAA0BthB,CAAc,EACxC,KAAK,OAAOxF,EAAS,WAAa,CAAC,EACnC,CAAC,EAGF,OAAIu+B,EACI,IAAI98B,EAAA,MAAMzB,EAAS,WAAYu+B,EAAW,YAAav+B,EAAS,WAAYu+B,EAAW,SAAS,EAGjG,IACR,CAGO,MAAM/4B,EAAsB,CAElC,MAAMiH,EAAQ,KAAK,OACb+xB,EAAY,KAAK,WAAW,KAAK,IAAI,EAE3C,IAAIx/B,EAAa,EACby/B,EAAW,GACXC,EAAgB,EAChBC,EAA2B,CAAA,EAE/B,MAAO,CACN,EAAE,OAAO,QAAQ,GAAC,CACjB,OACC,GAAID,EAAgBC,EAAW,OAAQ,CACtC,MAAM58D,EAAQ08D,EAAS,UAAUE,EAAWD,CAAa,EAAE,MAAOC,EAAWD,CAAa,EAAE,GAAG,EAC/FA,GAAiB,EACjB,MAAM38D,CACP,SACKi9B,EAAayN,EAAM,OACtBgyB,EAAWhyB,EAAMzN,CAAU,EAC3B2/B,EAAaH,EAAUC,EAAUj5B,CAAc,EAC/Ck5B,EAAgB,EAChB1/B,GAAc,MAEd,MAIJ,EAEF,CAEO,aAAaA,EAAoBwG,EAAsB,CAC7D,MAAM9/B,EAAU,KAAK,OAAOs5B,EAAa,CAAC,EACpCsnB,EAAS,KAAK,WAAW5gD,EAAS8/B,CAAc,EAChDo5B,EAA2B,CAAA,EACjC,UAAWvvD,KAASi3C,EACnBsY,EAAM,KAAK,CACV,KAAMl5D,EAAQ,UAAU2J,EAAM,MAAOA,EAAM,GAAG,EAC9C,YAAaA,EAAM,MAAQ,EAC3B,UAAWA,EAAM,IAAM,EACvB,EAEF,OAAOuvD,CACR,CAEQ,WAAWl5D,EAAiB8/B,EAAsB,CACzD,MAAMhlC,EAAuB,CAAA,EAC7B,IAAImpB,EAIJ,IAFA6b,EAAe,UAAY,GAEpB7b,EAAQ6b,EAAe,KAAK9/B,CAAO,IACrCikB,EAAM,CAAC,EAAE,SAAW,GAIxBnpB,EAAO,KAAK,CAAE,MAAOmpB,EAAM,MAAO,IAAKA,EAAM,MAAQA,EAAM,CAAC,EAAE,MAAM,CAAE,EAEvE,OAAOnpB,CACR,CAEO,gBAAgB6O,EAAa,CAGnC,GAFAA,EAAQ,KAAK,eAAeA,CAAK,EAE7BA,EAAM,kBAAoBA,EAAM,cACnC,OAAO,KAAK,OAAOA,EAAM,gBAAkB,CAAC,EAAE,UAAUA,EAAM,YAAc,EAAGA,EAAM,UAAY,CAAC,EAGnG,MAAMwvD,EAAa,KAAK,KAClBC,EAAiBzvD,EAAM,gBAAkB,EACzC0vD,EAAe1vD,EAAM,cAAgB,EACrC2vD,EAAwB,CAAA,EAE9BA,EAAY,KAAK,KAAK,OAAOF,CAAc,EAAE,UAAUzvD,EAAM,YAAc,CAAC,CAAC,EAC7E,QAASvM,EAAIg8D,EAAiB,EAAGh8D,EAAIi8D,EAAcj8D,IAClDk8D,EAAY,KAAK,KAAK,OAAOl8D,CAAC,CAAC,EAEhC,OAAAk8D,EAAY,KAAK,KAAK,OAAOD,CAAY,EAAE,UAAU,EAAG1vD,EAAM,UAAY,CAAC,CAAC,EAErE2vD,EAAY,KAAKH,CAAU,CACnC,CAEO,SAAS7+B,EAAmB,CAClC,OAAAA,EAAW,KAAK,kBAAkBA,CAAQ,EAC1C,KAAK,kBAAiB,EACf,KAAK,YAAa,aAAaA,EAAS,WAAa,CAAC,GAAKA,EAAS,OAAS,EACrF,CAEO,WAAW9R,EAAc,CAC/BA,EAAS,KAAK,MAAMA,CAAM,EAC1BA,EAAS,KAAK,IAAI,EAAGA,CAAM,EAE3B,KAAK,kBAAiB,EACtB,MAAMimC,EAAM,KAAK,YAAa,WAAWjmC,CAAM,EACzCsgB,EAAa,KAAK,OAAO2lB,EAAI,KAAK,EAAE,OAG1C,MAAO,CACN,WAAY,EAAIA,EAAI,MACpB,OAAQ,EAAI,KAAK,IAAIA,EAAI,UAAW3lB,CAAU,EAEhD,CAEQ,eAAen/B,EAAa,CAEnC,MAAMiD,EAAQ,KAAK,kBAAkB,CAAE,WAAYjD,EAAM,gBAAiB,OAAQA,EAAM,WAAW,CAAE,EAC/F2a,EAAM,KAAK,kBAAkB,CAAE,WAAY3a,EAAM,cAAe,OAAQA,EAAM,SAAS,CAAE,EAE/F,OAAIiD,EAAM,aAAejD,EAAM,iBAC3BiD,EAAM,SAAWjD,EAAM,aACvB2a,EAAI,aAAe3a,EAAM,eACzB2a,EAAI,SAAW3a,EAAM,UAEjB,CACN,gBAAiBiD,EAAM,WACvB,YAAaA,EAAM,OACnB,cAAe0X,EAAI,WACnB,UAAWA,EAAI,QAIV3a,CACR,CAEQ,kBAAkB2wB,EAAmB,CAC5C,GAAI,CAACU,EAAA,SAAS,YAAYV,CAAQ,EACjC,MAAM,IAAI,MAAM,cAAc,EAE/B,GAAI,CAAE,WAAAhB,EAAY,OAAAC,CAAM,EAAKe,EACzBi/B,EAAa,GAEjB,GAAIjgC,EAAa,EAChBA,EAAa,EACbC,EAAS,EACTggC,EAAa,WAEHjgC,EAAa,KAAK,OAAO,OACnCA,EAAa,KAAK,OAAO,OACzBC,EAAS,KAAK,OAAOD,EAAa,CAAC,EAAE,OAAS,EAC9CigC,EAAa,OAEP,CACN,MAAMC,EAAe,KAAK,OAAOlgC,EAAa,CAAC,EAAE,OAAS,EACtDC,EAAS,GACZA,EAAS,EACTggC,EAAa,IAELhgC,EAASigC,IACjBjgC,EAASigC,EACTD,EAAa,GAEf,CAEA,OAAKA,EAGG,CAAE,WAAAjgC,EAAY,OAAAC,CAAM,EAFpBe,CAIT,EA1ND7xB,EAAA,YAAAgwD,2NC+TAhwD,EAAA,OAAA4qD,EA7bA,MAAMC,EAAQ,GAkDd,MAAamG,CAAsB,CAKlC,aAAA,CAFiB,KAAA,2BAA6B,IAAIC,EAAA,yBAGlD,CAEA,SAAO,CACP,CAEU,UAAU79D,EAAW,CAC9B,OAAO,KAAK,2BAA2B,SAASA,CAAG,CACpD,CAEU,YAAU,CACnB,OAAO,KAAK,2BAA2B,UAAS,CACjD,CAEO,gBAAgByE,EAAmB,CACzC,KAAK,2BAA2B,gBAAgBA,CAAI,CACrD,CAEO,oBAAoBzE,EAAagD,EAAqB,CAC5D,KAAK,2BAA2B,oBAAoBhD,EAAKgD,CAAC,CAC3D,CAEO,oBAAoBhD,EAAW,CACrC,KAAK,2BAA2B,oBAAoBA,CAAG,CACxD,CAEO,MAAM,0BAA0BG,EAAaU,EAAoCiN,EAAc,CACrG,MAAM2rC,EAAQ,KAAK,UAAUt5C,CAAG,EAChC,OAAKs5C,EAGEqkB,EAAA,4BAA4B,yBAAyBrkB,EAAO54C,EAASiN,CAAK,EAFzE,CAAE,OAAQ,CAAA,EAAI,QAAS,GAAO,wBAAyB,EAAG,wBAAyB,EAAG,4BAA6B,CAAC,CAG7H,CAEO,MAAM,oBAAoB3N,EAAaU,EAAiC,CAC9E,MAAM44C,EAAQ,KAAK,UAAUt5C,CAAG,EAChC,OAAKs5C,KAGEskB,EAAA,oBAAmBtkB,EAAO54C,CAAO,EAFhC,CAAA,CAGT,CAIO,MAAM,aAAam9D,EAAqBC,EAAqBp9D,EAAuCq9D,EAA4B,CACtI,MAAMprC,EAAW,KAAK,UAAUkrC,CAAW,EACrCjrC,EAAW,KAAK,UAAUkrC,CAAW,EAC3C,MAAI,CAACnrC,GAAY,CAACC,EACV,KAGOorC,EAAmB,YAAYrrC,EAAUC,EAAUlyB,EAASq9D,CAAS,CAErF,CAEQ,OAAO,YAAYE,EAA8CC,EAA8Cx9D,EAAuCq9D,EAA4B,CACzL,MAAMI,EAAoCJ,IAAc,WAAaK,EAAA,mBAAmB,WAAU,EAAKA,EAAA,mBAAmB,UAAS,EAE7HrvB,EAAgBkvB,EAAkB,gBAAe,EACjDjvB,EAAgBkvB,EAAkB,gBAAe,EAEjDp/D,EAASq/D,EAAc,YAAYpvB,EAAeC,EAAetuC,CAAO,EAExE29D,EAAav/D,EAAO,QAAQ,OAAS,EAAI,GAAQ,KAAK,oBAAoBm/D,EAAmBC,CAAiB,EAEpH,SAASI,EAAe1pC,EAA4C,CACnE,OAAOA,EAAQ,IAAI5sB,GAAM,CAACA,EAAE,SAAS,gBAAiBA,EAAE,SAAS,uBAAwBA,EAAE,SAAS,gBAAiBA,EAAE,SAAS,uBAAwBA,EAAE,cAAc,IAAIA,GAAK,CAChLA,EAAE,cAAc,gBAChBA,EAAE,cAAc,YAChBA,EAAE,cAAc,cAChBA,EAAE,cAAc,UAChBA,EAAE,cAAc,gBAChBA,EAAE,cAAc,YAChBA,EAAE,cAAc,cAChBA,EAAE,cAAc,UAChB,CAAC,CAAE,CACL,CAEA,MAAO,CACN,UAAAq2D,EACA,UAAWv/D,EAAO,WAClB,QAASw/D,EAAex/D,EAAO,OAAO,EACtC,MAAOA,EAAO,MAAM,IAAIkJ,GAAM,CAC7BA,EAAE,iBAAiB,SAAS,gBAC5BA,EAAE,iBAAiB,SAAS,uBAC5BA,EAAE,iBAAiB,SAAS,gBAC5BA,EAAE,iBAAiB,SAAS,uBAC5Bs2D,EAAet2D,EAAE,OAAO,EACvB,EAEJ,CAEQ,OAAO,oBAAoB2qB,EAAqCC,EAAmC,CAC1G,MAAMib,EAAoBlb,EAAS,aAAY,EACzCmb,EAAoBlb,EAAS,aAAY,EAC/C,GAAIib,IAAsBC,EACzB,MAAO,GAER,QAAS1M,EAAO,EAAGA,GAAQyM,EAAmBzM,IAAQ,CACrD,MAAM8W,EAAevlB,EAAS,eAAeyO,CAAI,EAC3C+W,EAAevlB,EAAS,eAAewO,CAAI,EACjD,GAAI8W,IAAiBC,EACpB,MAAO,EAET,CACA,MAAO,EACR,QAOwB,KAAA,WAAa,GAAO,CAErC,MAAM,yBAAyB6jB,EAAkBr6B,EAAmB9O,EAAe,CACzF,MAAMymB,EAAQ,KAAK,UAAU0iB,CAAQ,EACrC,GAAI,CAAC1iB,EACJ,OAAO3X,EAGR,MAAM7iC,EAAqB,CAAA,EAC3B,IAAIy/D,EAEJ58B,EAAQA,EAAM,MAAM,CAAC,EAAE,KAAK,CAACpgC,EAAGC,IAAK,CACpC,GAAID,EAAE,OAASC,EAAE,MAChB,OAAOu+B,EAAA,MAAM,yBAAyBx+B,EAAE,MAAOC,EAAE,KAAK,EAGvD,MAAMg9D,EAAOj9D,EAAE,MAAQ,EAAI,EACrBk9D,EAAOj9D,EAAE,MAAQ,EAAI,EAC3B,OAAOg9D,EAAOC,CACf,CAAC,EAGD,IAAIC,EAAa,EACjB,QAASC,EAAY,EAAGA,EAAYh9B,EAAM,OAAQg9B,IAC7C5+B,EAAA,MAAM,eAAe4B,EAAM+8B,CAAU,EAAE,KAAK,EAAE,OAAO3+B,EAAA,MAAM,iBAAiB4B,EAAMg9B,CAAS,EAAE,KAAK,CAAC,GACtGh9B,EAAM+8B,CAAU,EAAE,MAAQ3+B,EAAA,MAAM,cAAcA,EAAA,MAAM,iBAAiB4B,EAAM+8B,CAAU,EAAE,KAAK,EAAG3+B,EAAA,MAAM,eAAe4B,EAAMg9B,CAAS,EAAE,KAAK,CAAC,EAC3Ih9B,EAAM+8B,CAAU,EAAE,MAAQ/8B,EAAMg9B,CAAS,EAAE,OAE3CD,IACA/8B,EAAM+8B,CAAU,EAAI/8B,EAAMg9B,CAAS,GAGrCh9B,EAAM,OAAS+8B,EAAa,EAE5B,OAAS,CAAE,MAAA/wD,EAAO,KAAApK,EAAM,IAAAm8C,CAAG,IAAM/d,EAAO,CAMvC,GAJI,OAAO+d,GAAQ,WAClB6e,EAAU7e,GAGP3f,EAAA,MAAM,QAAQpyB,CAAK,GAAK,CAACpK,EAE5B,SAGD,MAAMovB,EAAW2mB,EAAM,gBAAgB3rC,CAAK,EAG5C,GAFApK,EAAOA,EAAK,QAAQ,cAAe+1C,EAAM,GAAG,EAExC3mB,IAAapvB,EAEhB,SAID,GAAI,KAAK,IAAIA,EAAK,OAAQovB,EAAS,MAAM,EAAIqrC,EAAmB,WAAY,CAC3El/D,EAAO,KAAK,CAAE,MAAA6O,EAAO,KAAApK,CAAI,CAAE,EAC3B,QACD,CAGA,MAAMqxB,KAAU4gB,EAAA,YAAW7iB,EAAUpvB,EAAMsvB,CAAM,EAC3C+rC,EAAatlB,EAAM,SAASvZ,EAAA,MAAM,KAAKpyB,CAAK,EAAE,iBAAgB,CAAE,EAEtE,UAAWspB,KAAUrC,EAAS,CAC7B,MAAMhkB,EAAQ0oC,EAAM,WAAWslB,EAAa3nC,EAAO,aAAa,EAC1D3O,EAAMgxB,EAAM,WAAWslB,EAAa3nC,EAAO,cAAgBA,EAAO,cAAc,EAChF4nC,EAAoB,CACzB,KAAMt7D,EAAK,OAAO0zB,EAAO,cAAeA,EAAO,cAAc,EAC7D,MAAO,CAAE,gBAAiBrmB,EAAM,WAAY,YAAaA,EAAM,OAAQ,cAAe0X,EAAI,WAAY,UAAWA,EAAI,MAAM,GAGxHgxB,EAAM,gBAAgBulB,EAAQ,KAAK,IAAMA,EAAQ,MACpD//D,EAAO,KAAK+/D,CAAO,CAErB,CACD,CAEA,OAAI,OAAON,GAAY,UACtBz/D,EAAO,KAAK,CAAE,IAAKy/D,EAAS,KAAM,GAAI,MAAO,CAAE,gBAAiB,EAAG,YAAa,EAAG,cAAe,EAAG,UAAW,CAAC,CAAE,CAAE,EAG/Gz/D,CACR,CAIO,MAAM,cAAck9D,EAAgB,CAC1C,MAAM1iB,EAAQ,KAAK,UAAU0iB,CAAQ,EACrC,OAAK1iB,KAIEwlB,EAAA,cAAaxlB,CAAK,EAHjB,IAIT,CAIO,MAAM,8BAA8B0iB,EAAgB,CAC1D,MAAM1iB,EAAQ,KAAK,UAAU0iB,CAAQ,EACrC,OAAK1iB,KAGEylB,EAAA,8BAA6BzlB,CAAK,EAFjC,IAGT,QAIwB,KAAA,kBAAoB,GAAM,CAE3C,MAAM,gBAAgB0lB,EAAqBC,EAAiCC,EAAiBC,EAAoB,CAEvH,MAAMC,EAAK,IAAIx4C,EAAA,UACTy4C,EAAgB,IAAI,OAAOH,EAASC,CAAY,EAChDhvD,EAAO,IAAI,IAEjBmvD,EAAO,UAAWt/D,KAAOg/D,EAAW,CACnC,MAAM1lB,EAAQ,KAAK,UAAUt5C,CAAG,EAChC,GAAKs5C,GAIL,UAAW6L,KAAQ7L,EAAM,MAAM+lB,CAAa,EAC3C,GAAI,EAAAla,IAAS8Z,GAAe,CAAC,MAAM,OAAO9Z,CAAI,CAAC,KAG/Ch1C,EAAK,IAAIg1C,CAAI,EACTh1C,EAAK,KAAO6tD,EAAmB,mBAClC,MAAMsB,EAGT,CAEA,MAAO,CAAE,MAAO,MAAM,KAAKnvD,CAAI,EAAG,SAAUivD,EAAG,QAAO,CAAE,CACzD,CAOO,MAAM,mBAAmBpD,EAAkBruD,EAAeuxD,EAAiBC,EAAoB,CACrG,MAAM7lB,EAAQ,KAAK,UAAU0iB,CAAQ,EACrC,GAAI,CAAC1iB,EACJ,OAAO,OAAO,OAAO,IAAI,EAE1B,MAAM+lB,EAAgB,IAAI,OAAOH,EAASC,CAAY,EAChDrgE,EAAuC,OAAO,OAAO,IAAI,EAC/D,QAASsiC,EAAOzzB,EAAM,gBAAiByzB,EAAOzzB,EAAM,cAAeyzB,IAAQ,CAC1E,MAAM87B,EAAQ5jB,EAAM,aAAalY,EAAMi+B,CAAa,EACpD,UAAWla,KAAQ+X,EAAO,CACzB,GAAI,CAAC,MAAM,OAAO/X,EAAK,IAAI,CAAC,EAC3B,SAED,IAAI72C,EAAQxP,EAAOqmD,EAAK,IAAI,EACvB72C,IACJA,EAAQ,CAAA,EACRxP,EAAOqmD,EAAK,IAAI,EAAI72C,GAErBA,EAAM,KAAK,CACV,gBAAiB8yB,EACjB,YAAa+jB,EAAK,YAClB,cAAe/jB,EACf,UAAW+jB,EAAK,UAChB,CACF,CACD,CACA,OAAOrmD,CACR,CAIO,MAAM,kBAAkBk9D,EAAkBruD,EAAeqvC,EAAakiB,EAAiBC,EAAoB,CACjH,MAAM7lB,EAAQ,KAAK,UAAU0iB,CAAQ,EACrC,GAAI,CAAC1iB,EACJ,OAAO,KAGR,MAAM+lB,EAAgB,IAAI,OAAOH,EAASC,CAAY,EAElDxxD,EAAM,cAAgBA,EAAM,YAC/BA,EAAQ,CACP,gBAAiBA,EAAM,gBACvB,YAAaA,EAAM,YACnB,cAAeA,EAAM,cACrB,UAAWA,EAAM,UAAY,IAI/B,MAAM4xD,EAAgBjmB,EAAM,gBAAgB3rC,CAAK,EAE3C6xD,EAAYlmB,EAAM,kBAAkB,CAAE,WAAY3rC,EAAM,gBAAiB,OAAQA,EAAM,WAAW,EAAI0xD,CAAa,EACzH,GAAI,CAACG,EACJ,OAAO,KAER,MAAMra,EAAO7L,EAAM,gBAAgBkmB,CAAS,EAE5C,OADeC,EAAA,oBAAoB,SAAS,iBAAiB9xD,EAAO4xD,EAAeC,EAAWra,EAAMnI,CAAE,CAEvG,EA3TDvwC,EAAA,uBAAAgxD,EAiUA,MAAaO,UAA2BP,CAAsB,CAI7D,YACkBiC,EACAC,EAAmD,CAEpE,MAAK,EAHY,KAAA,MAAAD,EACA,KAAA,sBAAAC,EAJV,KAAA,eAAsB,IAO9B,CAEO,MAAM,OAAK,CACjB,MAAO,MACR,CAIO,mBAAmBl+D,EAAkBm+D,EAAiBC,EAA4B,CACxF,MAAMC,EAAqB,CAAC1jC,EAAgB33B,IACpC,KAAK,MAAM,KAAK23B,EAAQ33B,CAAI,EAK9Bs7D,EAA2B,CAChC,QAHmBjiB,EAAA,mBAAkB+hB,EAAoBC,CAAkB,EAI3E,gBAAiB,IACT,KAAK,WAAU,GAIxB,OAAI,KAAK,uBACR,KAAK,eAAiB,KAAK,sBAAsBC,EAAKH,CAAU,EAEzD,QAAQ,WAAQ9hB,EAAA,mBAAkB,KAAK,cAAc,CAAC,GAGvD,IAAI,QAAa,CAAClyC,EAASC,IAAU,CAE3C,MAAMm0D,EAAoBC,GAAoD,CAC7E,KAAK,eAAiBA,EAAc,OAAOF,EAAKH,CAAU,EAC1Dh0D,KAAQkyC,EAAA,mBAAkB,KAAK,cAAc,CAAC,CAC/C,EAEA,GAAI,CAACwZ,EACJzzD,EAAQ,CAAC,GAAGpC,CAAQ,EAAE,EAAGu+D,EAAkBn0D,CAAM,MAC3C,CACN,MAAM7L,EAAMu5D,EAAA,WAAW,aAAa,GAAG93D,CAAQ,KAAwB,EAAE,SAAS,EAAI,EACtF,IAAA,QAAA,CAAA+3D,EAAAC,IAAA,CAAA51D,EAAA,CAAO,GAAG7D,CAAG,EAAE,EAAAw5D,EAAAC,CAAA,CAAA,CAAA,EAAE,KAAKuG,CAAgB,EAAE,MAAMn0D,CAAM,CACrD,CACD,CAAC,CACF,CAGO,KAAKuwB,EAAgB33B,EAAW,CACtC,GAAI,CAAC,KAAK,gBAAkB,OAAO,KAAK,eAAe23B,CAAM,GAAM,WAClE,OAAO,QAAQ,OAAO,IAAI,MAAM,qCAAuCA,CAAM,CAAC,EAG/E,GAAI,CACH,OAAO,QAAQ,QAAQ,KAAK,eAAeA,CAAM,EAAE,MAAM,KAAK,eAAgB33B,CAAI,CAAC,CACpF,OAAS5B,EAAG,CACX,OAAO,QAAQ,OAAOA,CAAC,CACxB,CACD,EAhED4J,EAAA,mBAAAuxD,EA0EA,SAAgB3G,EAAOhU,EAA2B,CACjD,OAAO,IAAI2a,EAAmBkC,EAAA,iBAAiB,WAAW7c,CAAY,EAAG,IAAI,CAC9E,CAKI,OAAO,eAAkB,aAE5B,WAAW,UAAS8c,EAAA,qBAAmB,I9EtexC,GAAA,KAAA,IAAA","names":["__m","__M","deps","result","len","_amdLoaderGlobal","_commonjsGlobal","AMDLoader","Environment","LoaderEvent","type","detail","timestamp","LoaderEventRecorder","loaderAvailableTimestamp","NullLoaderEventRecorder","Utilities","isWindows","uri","haystack","needle","url","obj","callback","key","isEmpty","value","id","ensureError","err","ConfigurationOptionsUtil","options","defaultOnError","overwrite","base","key2","value2","Configuration","env","nodeMain","dirnameIndex","i","from","to","a","b","moduleId","pathRule","j","lenJ","urls","results","strModuleId","OnlyOnceScriptLoader","moduleManager","scriptSrc","errorback","WorkerScriptLoader","preferScriptTags","BrowserScriptLoader","NodeScriptLoader","scriptCallbacks","script","unbind","loadEventListener","errorEventListener","e","opts","nodeRequire","ensureRecordedNodeRequire","pieces","moduleExports","trustedTypesPolicy","cspNonce","canUseEval","response","text","nodeCachedData","that","Module","makeRequireFunction","mod","require","path","request","content","filename","scriptSource","recorder","cachedDataPath","hashData","data","compileWrapper","dirname","args","nodeInstrumenter","c","normalizedScriptSrc","vmScriptPathOrUri","wantsCachedData","cachedData","scriptOpts","contents","ret","globalDefineFunc","receivedDefineCall","localDefineFunc","driveLetterMatch","config","hash","basename","createCachedData","timeout","lastSize","iteration","createLoop","sourcePath","source","steps","step","hashDataNow","_nodeRequire","what","createScriptLoader","ModuleIdResolver","fromModuleId","lastSlash","r","pattern","strId","dependencies","moduleIdResolver","dependenciesValues","inversedependenciesProvider","producedError","ModuleIdProvider","RegularDependency","PluginDependency","pluginId","pluginParam","ModuleManager","scriptLoader","defineFunc","requireFunc","stack","normalize","str","normalizedPath","stackPieces","m","stackPath","stackLine","stackColumn","trimPathOffset","resultLen","location","defineStack","dep","dependency","bangIndex","strPluginId","dependencyId","_strModuleId","params","shouldOverwrite","oldShouldRecordStats","defineCall","_err","neededBy","intModuleId","error","seenModuleId","someoneNotified","queue","queueElement","inverseDeps","inverseDep","fromId","toId","inQueue","dependencyModule","depth","paths","scopedPackageRegex","lastPathIndex","loadNextPath","currentPath","plugin","pluginDependency","load","module","cyclePath","inversePluginDeps","inverseDependencyId","inverseDependency","define","DefineFunc","_requireFunc_config","RequireFunc","init","monacoEnvironment","monacoBaseUrl","createTrustedTypesPolicy","policyName","policyOptions","_","fnArgs","fnBody","loadAMDLoader","resolve","reject","loaderSrc","configureAMDLoader","loadCode","setupWorkerServer","ws","messageHandler","msg","transfer","beforeReadyMessages","isFirstMessage","message","exports","tail","tail2","equals","removeFastWithoutKeepingOrder","binarySearch","binarySearch2","quickSelect","groupBy","groupAdjacentBy","forEachAdjacent","forEachWithNeighbors","coalesce","coalesceInPlace","isFalsyOrEmpty","isNonEmptyArray","distinct","firstOrDefault","range","arrayInsert","pushToStart","pushToEnd","pushMany","asArray","insertInto","splice","compareBy","tieBreakComparators","reverseOrder","array","n","arr","one","other","itemEquals","index","last","comparator","length","compareToKey","low","high","mid","comp","nth","compare","pivotValue","lower","higher","pivots","val","currentGroup","element","items","shouldBeGrouped","item","f","keyFn","seen","notFoundValue","arg","target","insertIndex","insertArr","before","after","x","start","newItems","startIdx","getActualStartIndex","originalLength","newItemsLength","deleteCount","CompareResult","isLessThan","isLessThanOrEqual","isGreaterThan","isNeitherLessOrGreaterThan","selector","comparators","item1","item2","numberComparator","booleanComparator","ArrayQueue","predicate","endIdx","count","CallbackIterable","_callback","iterate","cb","mapFn","first","Permutation","_indexMap","compareFn","sortIndices","index1","index2","inverseIndexMap","findLast","findLastIdx","findLastMonotonous","findLastIdxMonotonous","findFirstMonotonous","findFirstIdxMonotonousOrArrLen","findFirstMax","findLastMax","findFirstMin","findMaxIdx","mapFindFirst","idx","fromIndex","endIdxEx","k","MonotonousArray","_array","max","maxIdx","mapped","identity","t","LRUCachedFunction","arg1","arg2","CachedFunction","roundFloat","number","decimalPoints","decimal","RGBA","g","HSLA","h","s","l","rgba","min","chroma","p","q","hsla","HSVA","v","cmax","cmin","delta","hsva","Color","hex","R","G","B","luminance","color","another","lum1","lum2","factor","opaqueBackground","of","relative","Format","CSS","formatRGB","formatRGBA","formatHSL","formatHSLA","_toTwoDigitHex","formatHex","formatHexA","compact","format","parseHex","_parseHexDigit","charCode","DiffChange","originalStart","modifiedStart","modifiedLength","onUnexpectedError","onUnexpectedExternalError","transformErrorForSerialization","isCancellationError","canceled","illegalArgument","illegalState","ErrorHandler","ErrorNoTelemetry","listener","name","canceledName","CancellationError","NotSupportedError","BugIndicatingError","ok","assertNever","softAssert","assertFn","checkAdjacentItems","condition","errors_1","createSingleCallFunction","fn","fnDidRunCallback","_this","didCall","Iterable","is","thing","_empty","empty","single","wrap","iterableOrElement","iterable","reverse","some","find","filter","map","flatMap","concat","iterables","reduce","reducer","initialValue","slice","consume","atMost","consumed","iterator","next","asyncToArray","KeyChord","KeyCodeStrMap","keyCode","uiMap","userSettingsUSMap","userSettingsGeneralMap","scanCodeIntToStr","scanCodeStrToInt","scanCodeLowerCaseStrToInt","mappings","seenKeyCode","seenScanCode","mapping","immutable","scanCode","scanCodeStr","keyCodeStr","eventKeyCode","vkey","usUserSettingsLabel","generalUserSettingsLabel","KeyCodeUtils","toString","fromString","toUserSettingsUS","toUserSettingsGeneral","fromUserSettings","toElectronAccelerator","firstPart","secondPart","chordPart","Lazy","executor","setDisposableTracker","trackDisposable","markAsDisposed","markAsSingleton","isDisposable","dispose","combinedDisposable","toDisposable","TRACK_DISPOSABLES","disposableTracker","tracker","__is_disposable_tracked__","child","parent","Disposable","disposable","setParentOfDisposable","setParentOfDisposables","children","singleton","iterator_1","errors","d","disposables","self","functional_1","DisposableStore","o","MutableDisposable","RefCountedDisposable","_disposable","ImmortalReference","object","DisposableMap","skipDisposeOnOverwrite","Node","LinkedList","node","atTheEnd","newNode","oldLast","oldFirst","didRemove","res","anchor","ResourceMapEntry","isEntries","ResourceMap","resource","toKey","_a","clb","thisArg","entry","LinkedMap","_b","touch","callbackfn","state","current","newSize","currentSize","previous","Cache","limit","ratio","LRUCache","BidirectionalMap","entries","SetMap","values","hasPerformanceNow","StopWatch","highResolution","_enableListenerGCedWarning","_enableDisposeWithListenerWarning","_enableSnapshotPotentialLeakWarning","Event","lifecycle_1","_addLeakageTraceLogic","origListenerDidAdd","Stacktrace","defer","event","debounce","once","thisArgs","didFire","onceIf","snapshot","forEach","each","signal","any","events","addAndReturnDisposable","merge","initial","output","emitter","Emitter","store","delay","leading","flushOnListenerRemove","leakWarningThreshold","subscription","handle","numDebouncedCalls","doFire","cur","_output","accumulate","latch","firstCall","cache","shouldEmit","split","isT","buffer","flushAfterTimeout","_buffer","flush","chain","sythensize","cs","ChainableSynthesis","HaltChainable","fromNodeEventEmitter","eventName","onFirstListenerAdd","onLastListenerRemove","fromDOMEventEmitter","toPromise","fromPromise","promise","forward","runAndSubscribe","handler","EmitterObserver","_observable","_change","fromObservable","obs","fromObservableLight","observable","didChange","observer","EventProfiling","listenerCount","stopwatch_1","elapsed","_globalLeakWarningThreshold","LeakageMonitor","_errorHandler","threshold","topStack","topCount","ListenerLeakError","ListenerRefusalError","UniqueContainer","compactionThreshold","forEachListener","listeners","_listenerFinalizers","leaks","heldValue","tuple","contained","removeMonitor","EventDeliveryQueuePrivate","match","adjustDeliveryQueue","errorHandler","dq","createEventDeliveryQueue","end","PauseableEmitter","linkedList_1","DebounceEmitter","MicrotaskEmitter","EventMultiplexer","EventBufferer","reduceData","Relay","cancelOnDispose","shortcutEvent","context","CancellationToken","isCancellationToken","MutableToken","event_1","CancellationTokenSource","cancel","isFalsyOrWhitespace","htmlAttributeEncodeValue","escape","escapeRegExpCharacters","trim","ltrim","rtrim","convertSimple2RegExpPattern","stripWildcards","createRegExp","regExpLeadsToEndlessLoop","splitLines","splitLinesIncludeSeparators","firstNonWhitespaceIndex","getLeadingWhitespace","lastNonWhitespaceIndex","compareSubstring","compareIgnoreCase","compareSubstringIgnoreCase","isAsciiDigit","isLowerAsciiLetter","isUpperAsciiLetter","equalsIgnoreCase","startsWithIgnoreCase","commonPrefixLength","commonSuffixLength","isHighSurrogate","isLowSurrogate","computeCodePoint","getNextCodePoint","nextCharLength","prevCharLength","getCharContainingOffset","containsRTL","isBasicASCII","containsUnusualLineTerminators","isFullWidthCharacter","isEmojiImprecise","startsWithUTF8BOM","containsUppercaseCharacter","singleLetterHash","getLeftDeleteOffset","_formatRegexp","group","ch","html","trimmed","needleLen","offset","haystackLen","searchString","isRegex","modifiers","regexp","linesWithSeparators","splitLinesAndSeparators","chCode","startIndex","aStart","aEnd","bStart","bEnd","codeA","codeB","aLen","bLen","diff","code","candidate","candidateLength","aLastIndex","bLastIndex","highSurrogate","lowSurrogate","nextCharCode","getPrevCodePoint","prevCharCode","CodePointIterator","codePoint","GraphemeIterator","graphemeBreakTree","GraphemeBreakTree","initialOffset","graphemeBreakType","nextGraphemeBreakType","breakBetweenGraphemeBreakType","prevGraphemeBreakType","endOffset","CONTAINS_RTL","makeContainsRtl","IS_BASIC_ASCII","ignoreEscapedChars","breakTypeA","breakTypeB","getGraphemeBreakRawData","nodeCount","nodeIndex","emojiOffset","getOffsetBeforeLastEmojiComponent","isEmojiModifier","resultOffset","AmbiguousCharacters","lazy_1","cache_1","locales","arrayToMap","mergeMaps","map1","map2","intersectMaps","filteredLocales","languageSpecificMap","locale","commonMap","confusableDictionary","InvisibleCharacters","doHash","numberHash","stringHash","toHexString","hashVal","arrayHash","objectHash","booleanHash","initialHashVal","leftRotate","bits","totalBits","mask","fill","dest","leftPad","char","bufferOrValue","bitsize","StringSHA1","strLen","buff","buffLen","leftoverHighSurrogate","strings","ml","bigBlock32","temp","stringDiff","StringDiffSequence","characters","original","modified","pretty","LcsDiff","Debug","MyArray","sourceArray","sourceIndex","destinationArray","destinationIndex","DiffChangeHelper","diffChange_1","originalIndex","modifiedIndex","originalSequence","modifiedSequence","continueProcessingPredicate","originalStringElements","originalElementsOrHash","originalHasStrings","modifiedStringElements","modifiedElementsOrHash","modifiedHasStrings","sequence","elements","hashes","hash_1","newIndex","originalElement","modifiedElement","originalEnd","modifiedEnd","quitEarlyArr","changes","midOriginalArr","midModifiedArr","midOriginal","midModified","leftChanges","rightChanges","diagonalForwardBase","diagonalForwardStart","diagonalForwardEnd","diagonalForwardOffset","diagonalReverseBase","diagonalReverseStart","diagonalReverseEnd","diagonalReverseOffset","forwardPoints","reversePoints","deltaIsEven","forwardChanges","reverseChanges","changeHelper","diagonalMin","diagonalMax","diagonalRelative","lastOriginalIndex","historyIndex","diagonal","originalStartPoint","modifiedStartPoint","lastForwardChange","maxDifferences","numDiagonals","numDifferences","furthestOriginalIndex","furthestModifiedIndex","tempOriginalIndex","matchLengthOfLongest","change","originalStop","modifiedStop","checkOriginal","checkModified","startStrictEqual","mergedChangeArr","prevChange","bestDelta","bestScore","score","aChange","bChange","matchedLength","aOriginalStart","bOriginalEnd","abOriginalLength","aModifiedStart","bModifiedEnd","abModifiedLength","originalMatchStart","modifiedMatchStart","desiredLength","originalMax","modifiedMax","bestOriginalStart","bestModifiedStart","originalScore","modifiedScore","left","right","diagonalBaseIndex","diagonalsBelow","diagonalsAbove","diffEven","lowerBoundEven","upperBoundEven","isString","isObject","isTypedArray","isNumber","isIterable","isBoolean","isUndefined","isDefined","isUndefinedOrNull","assertType","assertIsDefined","isFunction","validateConstraints","validateConstraint","TypedArray","constraints","constraint","register","getCodiconFontCharacters","_codiconFontCharacters","fontCharacter","types_1","codiconsUtil_1","codiconsLibrary_1","deepClone","deepFreeze","cloneAndChange","mixin","getAllPropertyNames","getAllMethodNames","createProxyObject","_hasOwnProperty","prop","changer","_cloneAndChange","changed","r1","r2","i2","destination","oneKeys","otherKeys","methods","methodNames","invoke","createProxyMethod","method","methodName","toUint8","toUint32","CharacterClassifier","_defaultValue","defaultValue","uint_1","asciiMap","_value","CharacterSet","OffsetRange","sortedRanges","endExclusive","OffsetRangeSet","intersection","prev","Position","lineNumber","column","newLineNumber","newColumn","deltaLineNumber","deltaColumn","aLineNumber","bLineNumber","aColumn","bColumn","pos","Range","startLineNumber","startColumn","endLineNumber","endColumn","position","otherRange","resultStartLineNumber","resultStartColumn","resultEndLineNumber","resultEndColumn","otherStartLineNumber","otherStartColumn","otherEndLineNumber","otherEndColumn","position_1","lineCount","aStartLineNumber","bStartLineNumber","aStartColumn","bStartColumn","aEndLineNumber","bEndLineNumber","aEndColumn","bEndColumn","LineRange","lineRanges","LineRangeSet","endLineNumberExclusive","lineRange","range_1","offsetRange_1","_normalizedRanges","joinRangeStartIdx","arraysFind_1","joinRangeEndIdxExclusive","joinRange","rangeThatStartsBeforeEnd","i1","lineRange1","lineRange2","Selection","selectionStartLineNumber","selectionStartColumn","positionLineNumber","positionColumn","direction","sel","TextLength","position1","position2","line","columnCount","startPosition","PositionOffsetTransformer","lineIdx","textLength_1","TextEdit","edits","assert_1","lastEditEnd","edit","editRange","editStart","editEnd","rangeFromPositions","strText","StringText","newRanges","previousEditEndLineNumber","lineOffset","columnOffset","textLength","newRangeStart","newRange","SingleTextEdit","AbstractText","positionToOffset_1","getMapForWordSeparators","WordCharacterClassifier","characterClassifier_1","wordSeparators","intlSegmenterLocales","segment","lineContent","segments","wordClassifierCache","map_1","ensureValidWordDefinition","getWordAtText","createWordRegExp","allowInWords","sep","wordDefinition","flags","_defaultConfig","textOffset","t1","prevRegexIndex","regexIndex","thisMatch","_findRegexMatchEnclosingPosition","stopPos","matchIndex","DiffAlgorithmResult","seq1","seq2","SequenceDiff","diffs","hitTimeout","sequenceDiffs","doc1Length","arrays_1","OffsetPair","seq1Range","seq2Range","offset1","offset2","InfiniteTimeout","DateTimeout","MyersDiffAlgorithm","diffAlgorithm_1","seqX","seqY","getXAfterSnake","y","V","FastInt32Array","FastArrayNegativeIndices","SnakePath","loop","lowerBound","upperBound","maxXofDLineTop","maxXofDLineLeft","newMaxX","lastPath","lastAligningPosS1","lastAligningPosS2","endX","endY","optimizeSequenceDiffs","removeShortMatches","extendDiffsToEntireWordIfAppropriate","removeVeryShortMatchingLinesBetweenDiffs","removeVeryShortMatchingTextBetweenLongDiffs","sequence1","sequence2","joinSequenceDiffsByShifting","shiftSequenceDiffs","prevResult","result2","nextResult","prevDiff","nextDiff","seq1ValidRange","seq2ValidRange","shiftDiffToBetterPosition","deltaBefore","deltaAfter","seq2OffsetStart","seq2OffsetEndExclusive","seq1Offset","equalMappings","additional","lastPoint","scanWord","pair","equalMapping","w1","w2","equalPart","equalChars1","equalChars2","v1","v2","mergeSequenceDiffs","sequenceDiffs1","sequenceDiffs2","sd1","sd2","_sequence2","counter","shouldRepeat","shouldJoinDiffs","unchangedRange","lastResult","unchangedText","beforeLineCount1","beforeSeq1Length","beforeLineCount2","beforeSeq2Length","afterLineCount1","afterSeq1Length","afterLineCount2","afterSeq2Length","cap","newDiffs","newDiff","shouldMarkAsChanged","fullRange1","prefix","suffix","availableSpace","LineSequence","trimmedHash","lines","indentationBefore","getIndentation","indentationAfter","isSpace","Array2D","width","height","LineRangeFragment","chr","sumDifferences","maxLength","DynamicProgrammingDiffing","equalityScore","lcsLengths","utils_1","directions","lengths","s1","s2","horizontalLen","verticalLen","extendedSeqScore","newValue","prevLen","reportDecreasingAligningPositions","LinesSliceCharSequence","considerWhitespaceChanges","lineStartOffset","trimmedWsLength","trimmedStartLine","lineLength","prevCategory","getCategory","nextCategory","getCategoryBoundaryScore","preference","pos1","pos2","isWordChar","category","LinesDiff","moves","MovedText","lineRangeMapping","LineRangeMapping","originalLineCount","modifiedLineCount","lastOriginalEndLineNumber","lastModifiedEndLineNumber","lineRange_1","originalRange","modifiedRange","origInclusiveRange","modInclusiveRange","RangeMapping","isValidLineNumber","normalizePosition","DetailedLineRangeMapping","rangeMappings","innerChanges","newText","textEdit_1","computeMovedLines","originalLines","modifiedLines","hashedOriginalLines","hashedModifiedLines","excludedChanges","computeMovesFromSimpleDeletionsToSimpleInsertions","filteredChanges","unchangedMoves","computeUnchangedMoves","joinCloseConsecutiveMoves","countWhere","removeMovesInSameDiff","deletions","insertions","deletion","highestSimilarity","best","insertion","similarity","rangeMapping_1","original3LineHashes","possibleMappings","lastMappings","currentModifiedRange","nextMappings","lastMapping","modifiedSet","originalSet","diffOrigToMod","modifiedSections","originalTranslatedSections","modifiedIntersectedSections","modifiedLineRange","originalLineRange","monotonousChanges","move","firstTouchingChangeOrig","firstTouchingChangeMod","linesAbove","lastTouchingChangeOrig","lastTouchingChangeMod","linesBelow","extendToTop","origLine","modLine","areLinesSimilar","extendToBottom","line1","line2","myersDiffAlgorithm_1","linesSliceCharSequence_1","commonNonSpaceCharCount","inverted","seq","countNonWsChars","longerLineLength","originalDist","modifiedDist","changesMonotonous","diffBeforeEndOfMoveOriginal","diffBeforeEndOfMoveModified","lineRangeMappingFromRangeMappings","getLineRangeMapping","DefaultLinesDiffComputer","dynamicProgrammingDiffing_1","linesDiffComputer_1","perfectHashes","getOrCreateHash","originalLinesHashes","modifiedLinesHashes","lineSequence_1","lineAlignmentResult","lineAlignments","heuristicSequenceOptimizations_1","alignments","scanForWhitespaceChanges","equalLinesCount","seq1LastStart","seq2Offset","seq2LastStart","characterDiffs","validatePosition","validateRange","ic","computeMovedLines_1","moveChanges","rangeMapping","toLineRangeMapping","slice1","slice2","diffResult","check","dontAssertStartLine","a1","a2","m1","m2","lineStartDelta","lineEndDelta","sequenceDiff","MINIMUM_MATCHING_CHARACTER_LENGTH","LegacyLinesDiffComputer","DiffComputer","lastChange","computeDiff","diff_1","startColumns","endColumns","getFirstNonBlankColumn","getLastNonBlankColumn","shouldIgnoreTrimWhitespace","endIndex","charCodes","lineNumbers","columns","col","CharSequence","CharChange","originalStartLineNumber","originalStartColumn","originalEndLineNumber","originalEndColumn","modifiedStartLineNumber","modifiedStartColumn","modifiedEndLineNumber","modifiedEndColumn","diffChange","originalCharSequence","modifiedCharSequence","postProcessCharChanges","rawChanges","currChange","originalMatchingLength","modifiedMatchingLength","LineChange","charChanges","originalLineSequence","modifiedLineSequence","continueCharDiff","shouldComputeCharChanges","shouldPostProcessCharChanges","createContinueProcessingPredicate","quitEarly","lineChanges","originalLineIndex","modifiedLineIndex","nextChange","originalLine","modifiedLine","originalChar","modifiedChar","originalMaxColumn","modifiedMaxColumn","originalLineNumber","modifiedLineNumber","txt","maximumRuntime","startTime","legacyLinesDiffComputer_1","defaultLinesDiffComputer_1","computeDefaultDocumentColors","_parseCaptureGroups","captureGroups","captureGroup","parsedNumber","_toIColor","_findRange","model","_findHexColorInformation","hexValue","parsedHexColor","color_1","_findRGBColorInformation","matches","isAlpha","parsedRegex","_findHSLColorInformation","colorEquivalent","_findMatches","regex","computeColors","initialValidationMatches","initialMatch","initialCaptureGroups","colorScheme","colorParameters","colorInformation","regexParameters","computeLinks","Uint8Matrix","rows","cols","row","StateMachine","edges","maxCharCode","maxState","states","currentState","_stateMachine","getStateMachine","_classifier","getClassifier","FORCE_TERMINATION_CHARACTERS","CANNOT_END_WITH_CHARACTERS","LinkComputer","classifier","linkBeginIndex","linkEndIndex","lastIncludedCharIndex","charCodeBeforeLink","lastCharCodeInLink","stateMachine","linkBeginChCode","hasOpenParens","hasOpenSquareBracket","inSquareBrackets","hasOpenCurlyBracket","resetStateMachine","chClass","BasicInplaceReplace","range1","text1","range2","text2","up","numberResult","precision","n1","n2","valueSets","valueSet","isITextSnapshot","shouldSynchronizeModel","OverviewRulerLane","GlyphMarginLane","InjectedTextCursorStops","TextModelResolvedOptions","src","objects_1","newOpts","FindMatch","ValidAnnotatedEditOperation","identifier","forceMoveMarkers","isAutoWhitespaceEdit","_isTracked","SearchData","simpleSearch","ApplyEditsResult","reverseEdits","trimAutoWhitespaceLineNumbers","PrefixSumComputer","insertValues","oldValues","oldPrefixSum","insertValuesLen","maxCount","sum","midStop","midStart","PrefixSumIndexOfResult","ConstantTimePrefixSumComputer","viewLinesAbove","sumAbove","remainder","MirrorTextModel","eol","versionId","eolLength","linesLength","lineStartValues","prefixSumComputer_1","lineIndex","insertText","insertLines","strings_1","newLengths","isMultilineRegexSource","createFindMatch","isValidMatch","LIMIT_FIND_COUNT","SearchParams","matchCase","multiline","canUseSimpleSearch","model_1","wordCharacterClassifier_1","nextChCode","rawMatches","captureMatches","LineFeedCounter","lineFeedsOffsets","lineFeedsOffsetsLen","textLen","TextModelSearch","searchParams","searchRange","limitResultCount","searchData","Searcher","deltaOffset","lfCounter","match0","startOffset","lineFeedCountBeforeMatch","lineFeedCountInMatch","endPosition","searcher","searchStringLen","lastMatchIndex","searchStart","searchTextStart","fromColumn","bestResult","leftIsWordBounday","matchStartIndex","matchLength","charBefore","firstCharInMatch","rightIsWordBounday","charAfter","lastCharInMatch","searchRegex","lastIndex","EditorWorkerHost","workerServer","workerClient","findSectionHeaders","markRegex","trimDashesRegex","headers","regionHeaders","collectRegionHeaders","markHeaders","collectMarkHeaders","sectionHeader","getHeaderText","addMarkHeaderIfFound","sectionHeaders","hasSeparatorLine","UnicodeTextModelHighlighter","startLine","endLine","codePointHighlighter","CodePointHighlighter","candidates","buildRegExpCharClassExpr","textModelSearch_1","ranges","hasMore","ambiguousCharacterCount","invisibleCharacterCount","nonBasicAsciiCharacterCount","forLoop","charCodeBefore","word","wordHelper_1","highlightReason","primaryConfusable","notAmbiguousInLocales","codePoints","set","cp","isAllowedInvisibleCharacter","character","wordContext","hasBasicASCIICharacters","hasNonConfusableNonBasicAsciiCharacter","AccessibilitySupport","CodeActionTriggerType","CompletionItemInsertTextRule","CompletionItemKind","CompletionItemTag","CompletionTriggerKind","ContentWidgetPositionPreference","CursorChangeReason","DefaultEndOfLine","DocumentHighlightKind","EditorAutoIndentStrategy","EditorOption","EndOfLinePreference","EndOfLineSequence","HoverVerbosityAction","IndentAction","InlayHintKind","InlineCompletionTriggerKind","InlineEditTriggerKind","KeyCode","MarkerSeverity","MarkerTag","MinimapPosition","MinimapSectionHeaderStyle","MouseTargetType","NewSymbolNameTag","NewSymbolNameTriggerKind","OverlayWidgetPositionPreference","PartialAcceptTriggerKind","PositionAffinity","RenderLineNumbersType","RenderMinimap","ScrollType","ScrollbarVisibility","SelectionDirection","ShowLightbulbIconMode","SignatureHelpTriggerKind","SymbolKind","SymbolTag","TextEditorCursorBlinkingStyle","TextEditorCursorStyle","TrackedRangeStickiness","WrappingIndent","TokenizationRegistry","languageIds","languageId","support","factory","myData","TokenizationSupportFactoryData","tokenizationSupport","colorMap","_registry","_languageId","_factory","getNLSMessages","getNLSLanguage","localize","localize2","nls_messages_2","isPseudo","nls_messages_1","_format","rest","lookupMessage","fallback","originalMessage","isLittleEndian","_isWindows","_isMacintosh","_isLinux","_isLinuxSnap","_isNative","_isWeb","_isElectron","_isIOS","_isCI","_isMobile","_locale","_language","_platformLocale","_translationsConfigFile","_userAgent","$globalThis","nodeProcess","isElectronProcess","isElectronRenderer","rawNlsConfig","nlsConfig","nls","_platform","pending","lastId","myId","_isLittleEndian","_isLittleEndianComputed","test","isThenable","createCancelablePromise","raceCancellation","disposableTimeout","createCancelableAsyncIterable","cancellation_1","thenable","onfinally","token","ref","Throttler","promiseFactory","onComplete","timeoutDeferred","scheduled","microtaskDeferred","Delayer","defaultDelay","task","symbols_1","ThrottledDelayer","millis","timer","promiseFactories","shouldStop","TimeoutTimer","runner","IntervalTimer","interval","RunOnceScheduler","_targetWindow","platform_1","disposed","targetWindow","AbstractIdleValue","GlobalIdleValue","DeferredPromise","Promises","settled","promises","firstError","withAsyncBody","bodyFn","AsyncIterableObject","writer","onReturn","filterFn","CancelableAsyncIterableObject","_source","innerIterable","safeProcess","vscodeGlobal","sandboxProcess","CHAR_UPPERCASE_A","CHAR_LOWERCASE_A","CHAR_UPPERCASE_Z","CHAR_LOWERCASE_Z","CHAR_DOT","CHAR_FORWARD_SLASH","CHAR_BACKWARD_SLASH","CHAR_COLON","CHAR_QUESTION_MARK","ErrorInvalidArgType","expected","actual","determiner","validateObject","pathObject","validateString","platformIsWin32","process","isPathSeparator","isPosixPathSeparator","isWindowsDeviceRoot","normalizeString","allowAboveRoot","separator","lastSegmentLength","dots","lastSlashIndex","formatExt","ext","dir","pathSegments","resolvedDevice","resolvedTail","resolvedAbsolute","rootEnd","device","isAbsolute","joined","needsReplace","slashCount","firstLen","fromOrig","toOrig","fromStart","fromEnd","fromLen","toStart","toEnd","toLen","lastCommonSep","fromCode","out","resolvedPath","matchedSlash","extIdx","firstNonSlashEnd","startDot","startPart","preDotState","posixCwd","cwd","trailingSeparator","hasRoot","uriToFsPath","_schemePattern","_singleSlashStart","_doubleSlashStart","_validateUri","_strict","_schemeFix","scheme","_referenceResolution","_slash","_regexp","URI","schemeOrData","authority","query","fragment","Uri","percentDecode","components","strict","pathFragment","newPath","skipEncoding","_asFormatted","_pathSepMarker","encodeTable","encodeURIComponentFast","uriComponent","isPath","isAuthority","nativeEncodePos","escaped","encodeURIComponentMinimal","keepDriveLetterCasing","encoder","userinfo","decodeURIComponentGraceful","_rEncodedAsHex","matchesScheme","matchesSomeScheme","Schemas","uri_1","schemes","RemoteAuthoritiesImpl","schema","host","port","connectionToken","platform","FileAccessImpl","resourcePath","uriOrModule","moduleIdToUrl","rootUriOrPath","modulePath","COI","coiHeaders","coiSearchParamName","getHeadersFromQuery","addSearchParam","urlOrSearch","coop","coep","logOnceWebWorkerWarning","create","isESM","DEFAULT_CHANNEL","INITIALIZE","webWorkerWarningLogged","RequestMessage","vsWorker","req","channel","ReplyMessage","SubscribeEventMessage","EventMessage","UnsubscribeEventMessage","SimpleWorkerProtocol","workerId","sendMessageBarrier","propertyIsDynamicEvent","propertyIsEvent","myArgs","replyMessage","reply","requestMessage","SimpleWorkerClient","workerFactory","workerDescriptor","loaderConfiguration","globalRequire","channelName","SimpleWorkerServer","postMessage","requestHandlerFactory","requestHandler","inst","loaderConfig","network_1","resolve_1","reject_1","isLocationLink","getAriaLabelForSymbol","Token","language","TokenizationResult","tokens","endState","EncodedTokenizationResult","CompletionItemKinds","byKind","codicons_1","toIcon","kind","codicon","SelectedSuggestionInfo","completionKind","isSnippetText","DocumentPasteTriggerKind","nls_1","symbolName","SymbolKinds","icon","FoldingRangeKind","Command","LazyTokenizationSupport","createSupport","tokenizationRegistry_1","createMonacoBaseAPI","KeyMod","keyCodes_1","standaloneEnums","selection_1","languages_1","WorkerTextModelSyncClient","proxy","modelService","keepIdleModels","async_1","modelUrl","resources","forceLargeModels","resourceStr","currentTime","toRemove","toDispose","WorkerTextModelSyncServer","all","MirrorModel","mirrorTextModel_1","offsetToAdd","iteratorOverMatches","wordAtText","wordenize","lineText","wordRangesIdx","wordRanges","words","lineEnding","startLineIndex","endLineIndex","resultLines","hasChanged","maxCharacter","BaseEditorSimpleWorker","textModelSync_impl_1","unicodeTextModelHighlighter_1","findSectionHeaders_1","originalUrl","modifiedUrl","algorithm","EditorSimpleWorker","originalTextModel","modifiedTextModel","diffAlgorithm","linesDiffComputers_1","identical","getLineChanges","lastEol","aRng","bRng","writeIndex","readIndex","editOffset","newEdit","linkComputer_1","defaultDocumentColorsComputer_1","modelUrls","leadingWord","wordDef","wordDefFlags","sw","wordDefRegExp","outer","selectionText","wordRange","inplaceReplaceSupport_1","_host","_foreignModuleFactory","createData","foreignHostMethods","proxyMethodRequest","ctx","onModuleCallback","foreignModule","editorWorkerHost_1","editorBaseApi_1"],"file":"workerMain.js"}