@stonecrop/code-editor 0.13.2 → 0.13.4

package/dist/assets/json.worker-DKiEKt88.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json.worker-DKiEKt88.js","sources":["../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/errors.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/assert.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/types.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/iterator.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/lifecycle.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/linkedList.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/stopwatch.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/event.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/nls.messages.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/nls.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/platform.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/cache.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/lazy.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/strings.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/worker/webWorker.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/worker/webWorkerBootstrap.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/diff/diffChange.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/buffer.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/hash.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/diff/diff.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/position.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/range.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/uint.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/characterClassifier.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/languages/linkComputer.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/languages/supports/inplaceReplaceSupport.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/cancellation.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/keyCodes.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/process.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/path.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/uri.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/selection.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/codiconsUtil.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/codiconsLibrary.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/codicons.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/tokenizationRegistry.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/languages.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/standalone/standaloneEnums.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/services/editorBaseApi.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/map.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/wordCharacterClassifier.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/model.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/model/textModelSearch.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/wordHelper.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/services/unicodeTextModelHighlighter.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputer.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/arrays.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/ranges/offsetRange.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/arraysFind.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/ranges/lineRange.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/text/textLength.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/text/positionToOffsetImpl.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/text/abstractText.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/core/edits/textEdit.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/rangeMapping.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/legacyLinesDiffComputer.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/diffAlgorithm.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/utils.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/dynamicProgrammingDiffing.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/algorithms/myersDiffAlgorithm.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/linesSliceCharSequence.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/computeMovedLines.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/heuristicSequenceOptimizations.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/lineSequence.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/defaultLinesDiffComputer/defaultLinesDiffComputer.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/diff/linesDiffComputers.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/color.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/languages/defaultDocumentColorsComputer.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/services/findSectionHeaders.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/base/common/async.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/model/prefixSumComputer.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/model/mirrorTextModel.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/services/textModelSync/textModelSync.impl.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/services/editorWebWorker.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/common/services/editorWorkerHost.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/editor/editor.worker.start.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/common/initialize.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/jsonc-parser/lib/esm/impl/scanner.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/jsonc-parser/lib/esm/impl/string-intern.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/jsonc-parser/lib/esm/impl/format.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/jsonc-parser/lib/esm/impl/parser.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/jsonc-parser/lib/esm/main.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/utils/objects.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/utils/strings.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-languageserver-types/lib/esm/main.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-languageserver-textdocument/lib/esm/main.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/jsonLanguageTypes.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/@vscode/l10n/dist/browser.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/parser/jsonParser.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/utils/json.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/jsonCompletion.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/jsonHover.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/jsonValidation.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/utils/colors.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/jsonDocumentSymbols.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/configuration.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-uri/lib/esm/index.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/utils/glob.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/jsonSchemaService.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/jsonFolding.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/jsonSelectionRanges.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/utils/format.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/utils/propertyTree.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/utils/sort.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/services/jsonLinks.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/external/vscode-json-languageservice/lib/esm/jsonLanguageService.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/language/json/jsonWorker.js","../../common/temp/node_modules/.pnpm/monaco-editor@0.55.1/node_modules/monaco-editor/esm/vs/language/json/json.worker.js"],"sourcesContent":["/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n// Avoid circular dependency on EventEmitter by implementing a subset of the interface.\nclass ErrorHandler {\n    constructor() {\n        this.listeners = [];\n        this.unexpectedErrorHandler = function (e) {\n            setTimeout(() => {\n                if (e.stack) {\n                    if (ErrorNoTelemetry.isErrorNoTelemetry(e)) {\n                        throw new ErrorNoTelemetry(e.message + '\\n\\n' + e.stack);\n                    }\n                    throw new Error(e.message + '\\n\\n' + e.stack);\n                }\n                throw e;\n            }, 0);\n        };\n    }\n    emit(e) {\n        this.listeners.forEach((listener) => {\n            listener(e);\n        });\n    }\n    onUnexpectedError(e) {\n        this.unexpectedErrorHandler(e);\n        this.emit(e);\n    }\n    // For external errors, we don't want the listeners to be called\n    onUnexpectedExternalError(e) {\n        this.unexpectedErrorHandler(e);\n    }\n}\nconst errorHandler = new ErrorHandler();\n/**\n * This function should only be called with errors that indicate a bug in the product.\n * E.g. buggy extensions/invalid user-input/network issues should not be able to trigger this code path.\n * If they are, this indicates there is also a bug in the product.\n*/\nfunction onBugIndicatingError(e) {\n    errorHandler.onUnexpectedError(e);\n    return undefined;\n}\nfunction onUnexpectedError(e) {\n    // ignore errors from cancelled promises\n    if (!isCancellationError(e)) {\n        errorHandler.onUnexpectedError(e);\n    }\n    return undefined;\n}\nfunction onUnexpectedExternalError(e) {\n    // ignore errors from cancelled promises\n    if (!isCancellationError(e)) {\n        errorHandler.onUnexpectedExternalError(e);\n    }\n    return undefined;\n}\nfunction transformErrorForSerialization(error) {\n    if (error instanceof Error) {\n        const { name, message, cause } = error;\n        // eslint-disable-next-line local/code-no-any-casts\n        const stack = error.stacktrace || error.stack;\n        return {\n            $isError: true,\n            name,\n            message,\n            stack,\n            noTelemetry: ErrorNoTelemetry.isErrorNoTelemetry(error),\n            cause: cause ? transformErrorForSerialization(cause) : undefined,\n            code: error.code\n        };\n    }\n    // return as is\n    return error;\n}\nconst canceledName = 'Canceled';\n/**\n * Checks if the given error is a promise in canceled state\n */\nfunction isCancellationError(error) {\n    if (error instanceof CancellationError) {\n        return true;\n    }\n    return error instanceof Error && error.name === canceledName && error.message === canceledName;\n}\n// !!!IMPORTANT!!!\n// Do NOT change this class because it is also used as an API-type.\nclass CancellationError extends Error {\n    constructor() {\n        super(canceledName);\n        this.name = this.message;\n    }\n}\n/**\n * @deprecated use {@link CancellationError `new CancellationError()`} instead\n */\nfunction canceled() {\n    const error = new Error(canceledName);\n    error.name = error.message;\n    return error;\n}\nfunction illegalArgument(name) {\n    if (name) {\n        return new Error(`Illegal argument: ${name}`);\n    }\n    else {\n        return new Error('Illegal argument');\n    }\n}\nfunction illegalState(name) {\n    if (name) {\n        return new Error(`Illegal state: ${name}`);\n    }\n    else {\n        return new Error('Illegal state');\n    }\n}\nclass NotSupportedError extends Error {\n    constructor(message) {\n        super('NotSupported');\n        if (message) {\n            this.message = message;\n        }\n    }\n}\n/**\n * Error that when thrown won't be logged in telemetry as an unhandled error.\n */\nclass ErrorNoTelemetry extends Error {\n    constructor(msg) {\n        super(msg);\n        this.name = 'CodeExpectedError';\n    }\n    static fromError(err) {\n        if (err instanceof ErrorNoTelemetry) {\n            return err;\n        }\n        const result = new ErrorNoTelemetry();\n        result.message = err.message;\n        result.stack = err.stack;\n        return result;\n    }\n    static isErrorNoTelemetry(err) {\n        return err.name === 'CodeExpectedError';\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 */\nclass BugIndicatingError extends Error {\n    constructor(message) {\n        super(message || 'An unexpected bug occurred.');\n        Object.setPrototypeOf(this, BugIndicatingError.prototype);\n        // Because we know for sure only buggy code throws this,\n        // we definitely want to break here and fix the bug.\n        // debugger;\n    }\n}\n\nexport { BugIndicatingError, CancellationError, ErrorHandler, ErrorNoTelemetry, NotSupportedError, canceled, canceledName, errorHandler, illegalArgument, illegalState, isCancellationError, onBugIndicatingError, onUnexpectedError, onUnexpectedExternalError, transformErrorForSerialization };\n","import { onUnexpectedError, BugIndicatingError } from './errors.js';\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 * 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 */\nfunction ok(value, message) {\n    if (!value) {\n        throw new Error(message ? `Assertion failed (${message})` : 'Assertion Failed');\n    }\n}\nfunction assertNever(value, message = 'Unreachable') {\n    throw new Error(message);\n}\n/**\n * Asserts that a condition is `truthy`.\n *\n * @throws provided {@linkcode messageOrError} if the {@linkcode condition} is `falsy`.\n *\n * @param condition The condition to assert.\n * @param messageOrError An error message or error object to throw if condition is `falsy`.\n */\nfunction assert(condition, messageOrError = 'unexpected state') {\n    if (!condition) {\n        // if error instance is provided, use it, otherwise create a new one\n        const errorToThrow = typeof messageOrError === 'string'\n            ? new BugIndicatingError(`Assertion Failed: ${messageOrError}`)\n            : messageOrError;\n        throw errorToThrow;\n    }\n}\n/**\n * Like assert, but doesn't throw.\n */\nfunction softAssert(condition, message = 'Soft Assertion Failed') {\n    if (!condition) {\n        onUnexpectedError(new BugIndicatingError(message));\n    }\n}\n/**\n * condition must be side-effect free!\n */\nfunction assertFn(condition) {\n    if (!condition()) {\n        // eslint-disable-next-line no-debugger\n        debugger;\n        // Reevaluate `condition` again to make debugging easier\n        condition();\n        onUnexpectedError(new BugIndicatingError('Assertion Failed'));\n    }\n}\nfunction checkAdjacentItems(items, predicate) {\n    let i = 0;\n    while (i < items.length - 1) {\n        const a = items[i];\n        const b = items[i + 1];\n        if (!predicate(a, b)) {\n            return false;\n        }\n        i++;\n    }\n    return true;\n}\n\nexport { assert, assertFn, assertNever, checkAdjacentItems, ok, softAssert };\n","import { assert } from './assert.js';\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 * @returns whether the provided parameter is a JavaScript String or not.\n */\nfunction isString(str) {\n    return (typeof str === 'string');\n}\n/**\n * @returns whether the provided parameter is a JavaScript Array and each element in the array satisfies the provided type guard.\n */\nfunction isArrayOf(value, check) {\n    return Array.isArray(value) && value.every(check);\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 */\nfunction isObject(obj) {\n    // The method can't do a type cast since there are type (like strings) which\n    // are subclasses of any put not positvely matched by the function. Hence type\n    // narrowing results in wrong results.\n    return typeof obj === 'object'\n        && obj !== null\n        && !Array.isArray(obj)\n        && !(obj instanceof RegExp)\n        && !(obj instanceof Date);\n}\n/**\n * @returns whether the provided parameter is of type `Buffer` or Uint8Array dervived type\n */\nfunction isTypedArray(obj) {\n    const TypedArray = Object.getPrototypeOf(Uint8Array);\n    return typeof obj === 'object'\n        && obj instanceof TypedArray;\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 */\nfunction isNumber(obj) {\n    return (typeof obj === 'number' && !isNaN(obj));\n}\n/**\n * @returns whether the provided parameter is an Iterable, casting to the given generic\n */\nfunction isIterable(obj) {\n    // eslint-disable-next-line local/code-no-any-casts\n    return !!obj && typeof obj[Symbol.iterator] === 'function';\n}\n/**\n * @returns whether the provided parameter is a JavaScript Boolean or not.\n */\nfunction isBoolean(obj) {\n    return (obj === true || obj === false);\n}\n/**\n * @returns whether the provided parameter is undefined.\n */\nfunction isUndefined(obj) {\n    return (typeof obj === 'undefined');\n}\n/**\n * @returns whether the provided parameter is defined.\n */\nfunction isDefined(arg) {\n    return !isUndefinedOrNull(arg);\n}\n/**\n * @returns whether the provided parameter is undefined or null.\n */\nfunction isUndefinedOrNull(obj) {\n    return (isUndefined(obj) || obj === null);\n}\nfunction assertType(condition, type) {\n    if (!condition) {\n        throw new Error(type ? `Unexpected type, expected '${type}'` : 'Unexpected type');\n    }\n}\n/**\n * Asserts that the argument passed in is neither undefined nor null.\n *\n * @see {@link assertDefined} for a similar utility that leverages TS assertion functions to narrow down the type of `arg` to be non-nullable.\n */\nfunction assertReturnsDefined(arg) {\n    assert(arg !== null && arg !== undefined, 'Argument is `undefined` or `null`.');\n    return arg;\n}\n/**\n * @returns whether the provided parameter is a JavaScript Function or not.\n */\nfunction isFunction(obj) {\n    return (typeof obj === 'function');\n}\nfunction validateConstraints(args, constraints) {\n    const len = Math.min(args.length, constraints.length);\n    for (let i = 0; i < len; i++) {\n        validateConstraint(args[i], constraints[i]);\n    }\n}\nfunction validateConstraint(arg, constraint) {\n    if (isString(constraint)) {\n        if (typeof arg !== constraint) {\n            throw new Error(`argument does not match constraint: typeof ${constraint}`);\n        }\n    }\n    else if (isFunction(constraint)) {\n        try {\n            if (arg instanceof constraint) {\n                return;\n            }\n        }\n        catch {\n            // ignore\n        }\n        // eslint-disable-next-line local/code-no-any-casts\n        if (!isUndefinedOrNull(arg) && arg.constructor === constraint) {\n            return;\n        }\n        if (constraint.length === 1 && constraint.call(undefined, arg) === true) {\n            return;\n        }\n        throw new Error(`argument does not match one of these constraints: arg instanceof constraint, arg.constructor === constraint, nor constraint(arg) === true`);\n    }\n}\n/**\n * Helper type assertion that safely upcasts a type to a supertype.\n *\n * This can be used to make sure the argument correctly conforms to the subtype while still being able to pass it\n * to contexts that expects the supertype.\n */\nfunction upcast(x) {\n    return x;\n}\n\nexport { assertReturnsDefined, assertType, isArrayOf, isBoolean, isDefined, isFunction, isIterable, isNumber, isObject, isString, isTypedArray, isUndefined, isUndefinedOrNull, upcast, validateConstraint, validateConstraints };\n","import { isIterable } from './types.js';\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 *--------------------------------------------------------------------------------------------*/\nvar Iterable;\n(function (Iterable) {\n    function is(thing) {\n        return !!thing && typeof thing === 'object' && typeof thing[Symbol.iterator] === 'function';\n    }\n    Iterable.is = is;\n    const _empty = Object.freeze([]);\n    function empty() {\n        return _empty;\n    }\n    Iterable.empty = empty;\n    function* single(element) {\n        yield element;\n    }\n    Iterable.single = single;\n    function wrap(iterableOrElement) {\n        if (is(iterableOrElement)) {\n            return iterableOrElement;\n        }\n        else {\n            return single(iterableOrElement);\n        }\n    }\n    Iterable.wrap = wrap;\n    function from(iterable) {\n        return iterable || _empty;\n    }\n    Iterable.from = from;\n    function* reverse(array) {\n        for (let i = array.length - 1; i >= 0; i--) {\n            yield array[i];\n        }\n    }\n    Iterable.reverse = reverse;\n    function isEmpty(iterable) {\n        return !iterable || iterable[Symbol.iterator]().next().done === true;\n    }\n    Iterable.isEmpty = isEmpty;\n    function first(iterable) {\n        return iterable[Symbol.iterator]().next().value;\n    }\n    Iterable.first = first;\n    function some(iterable, predicate) {\n        let i = 0;\n        for (const element of iterable) {\n            if (predicate(element, i++)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    Iterable.some = some;\n    function every(iterable, predicate) {\n        let i = 0;\n        for (const element of iterable) {\n            if (!predicate(element, i++)) {\n                return false;\n            }\n        }\n        return true;\n    }\n    Iterable.every = every;\n    function find(iterable, predicate) {\n        for (const element of iterable) {\n            if (predicate(element)) {\n                return element;\n            }\n        }\n        return undefined;\n    }\n    Iterable.find = find;\n    function* filter(iterable, predicate) {\n        for (const element of iterable) {\n            if (predicate(element)) {\n                yield element;\n            }\n        }\n    }\n    Iterable.filter = filter;\n    function* map(iterable, fn) {\n        let index = 0;\n        for (const element of iterable) {\n            yield fn(element, index++);\n        }\n    }\n    Iterable.map = map;\n    function* flatMap(iterable, fn) {\n        let index = 0;\n        for (const element of iterable) {\n            yield* fn(element, index++);\n        }\n    }\n    Iterable.flatMap = flatMap;\n    function* concat(...iterables) {\n        for (const item of iterables) {\n            if (isIterable(item)) {\n                yield* item;\n            }\n            else {\n                yield item;\n            }\n        }\n    }\n    Iterable.concat = concat;\n    function reduce(iterable, reducer, initialValue) {\n        let value = initialValue;\n        for (const element of iterable) {\n            value = reducer(value, element);\n        }\n        return value;\n    }\n    Iterable.reduce = reduce;\n    function length(iterable) {\n        let count = 0;\n        for (const _ of iterable) {\n            count++;\n        }\n        return count;\n    }\n    Iterable.length = length;\n    /**\n     * Returns an iterable slice of the array, with the same semantics as `array.slice()`.\n     */\n    function* slice(arr, from, to = arr.length) {\n        if (from < -arr.length) {\n            from = 0;\n        }\n        if (from < 0) {\n            from += arr.length;\n        }\n        if (to < 0) {\n            to += arr.length;\n        }\n        else if (to > arr.length) {\n            to = arr.length;\n        }\n        for (; from < to; from++) {\n            yield arr[from];\n        }\n    }\n    Iterable.slice = slice;\n    /**\n     * Consumes `atMost` elements from iterable and returns the consumed elements,\n     * and an iterable for the rest of the elements.\n     */\n    function consume(iterable, atMost = Number.POSITIVE_INFINITY) {\n        const consumed = [];\n        if (atMost === 0) {\n            return [consumed, iterable];\n        }\n        const iterator = iterable[Symbol.iterator]();\n        for (let i = 0; i < atMost; i++) {\n            const next = iterator.next();\n            if (next.done) {\n                return [consumed, Iterable.empty()];\n            }\n            consumed.push(next.value);\n        }\n        return [consumed, { [Symbol.iterator]() { return iterator; } }];\n    }\n    Iterable.consume = consume;\n    async function asyncToArray(iterable) {\n        const result = [];\n        for await (const item of iterable) {\n            result.push(item);\n        }\n        return result;\n    }\n    Iterable.asyncToArray = asyncToArray;\n    async function asyncToArrayFlat(iterable) {\n        let result = [];\n        for await (const item of iterable) {\n            result = result.concat(item);\n        }\n        return result;\n    }\n    Iterable.asyncToArrayFlat = asyncToArrayFlat;\n})(Iterable || (Iterable = {}));\n\nexport { Iterable };\n","import { Iterable } from './iterator.js';\n\nfunction setParentOfDisposable(child, parent) {\n}\n/**\n * Indicates that the given object is a singleton which does not need to be disposed.\n*/\nfunction markAsSingleton(singleton) {\n    return singleton;\n}\n/**\n * Check if `thing` is {@link IDisposable disposable}.\n */\nfunction isDisposable(thing) {\n    // eslint-disable-next-line local/code-no-any-casts\n    return typeof thing === 'object' && thing !== null && typeof thing.dispose === 'function' && thing.dispose.length === 0;\n}\nfunction dispose(arg) {\n    if (Iterable.is(arg)) {\n        const errors = [];\n        for (const d of arg) {\n            if (d) {\n                try {\n                    d.dispose();\n                }\n                catch (e) {\n                    errors.push(e);\n                }\n            }\n        }\n        if (errors.length === 1) {\n            throw errors[0];\n        }\n        else if (errors.length > 1) {\n            throw new AggregateError(errors, 'Encountered errors while disposing of store');\n        }\n        return Array.isArray(arg) ? [] : arg;\n    }\n    else if (arg) {\n        arg.dispose();\n        return arg;\n    }\n}\n/**\n * Combine multiple disposable values into a single {@link IDisposable}.\n */\nfunction combinedDisposable(...disposables) {\n    const parent = toDisposable(() => dispose(disposables));\n    return parent;\n}\nclass FunctionDisposable {\n    constructor(fn) {\n        this._isDisposed = false;\n        this._fn = fn;\n    }\n    dispose() {\n        if (this._isDisposed) {\n            return;\n        }\n        if (!this._fn) {\n            throw new Error(`Unbound disposable context: Need to use an arrow function to preserve the value of this`);\n        }\n        this._isDisposed = true;\n        this._fn();\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 */\nfunction toDisposable(fn) {\n    return new FunctionDisposable(fn);\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 */\nclass DisposableStore {\n    static { this.DISABLE_DISPOSED_WARNING = false; }\n    constructor() {\n        this._toDispose = new Set();\n        this._isDisposed = false;\n    }\n    /**\n     * Dispose of all registered disposables and mark this object as disposed.\n     *\n     * Any future disposables added to this object will be disposed of on `add`.\n     */\n    dispose() {\n        if (this._isDisposed) {\n            return;\n        }\n        this._isDisposed = true;\n        this.clear();\n    }\n    /**\n     * @return `true` if this object has been disposed of.\n     */\n    get isDisposed() {\n        return this._isDisposed;\n    }\n    /**\n     * Dispose of all registered disposables but do not mark this object as disposed.\n     */\n    clear() {\n        if (this._toDispose.size === 0) {\n            return;\n        }\n        try {\n            dispose(this._toDispose);\n        }\n        finally {\n            this._toDispose.clear();\n        }\n    }\n    /**\n     * Add a new {@link IDisposable disposable} to the collection.\n     */\n    add(o) {\n        if (!o || o === Disposable.None) {\n            return o;\n        }\n        if (o === this) {\n            throw new Error('Cannot register a disposable on itself!');\n        }\n        if (this._isDisposed) {\n            if (!DisposableStore.DISABLE_DISPOSED_WARNING) {\n                console.warn(new Error('Trying to add a disposable to a DisposableStore that has already been disposed of. The added object will be leaked!').stack);\n            }\n        }\n        else {\n            this._toDispose.add(o);\n        }\n        return o;\n    }\n    /**\n     * Deletes a disposable from store and disposes of it. This will not throw or warn and proceed to dispose the\n     * disposable even when the disposable is not part in the store.\n     */\n    delete(o) {\n        if (!o) {\n            return;\n        }\n        if (o === this) {\n            throw new Error('Cannot dispose a disposable on itself!');\n        }\n        this._toDispose.delete(o);\n        o.dispose();\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 */\nclass Disposable {\n    /**\n     * A disposable that does nothing when it is disposed of.\n     *\n     * TODO: This should not be a static property.\n     */\n    static { this.None = Object.freeze({ dispose() { } }); }\n    constructor() {\n        this._store = new DisposableStore();\n        setParentOfDisposable(this._store);\n    }\n    dispose() {\n        this._store.dispose();\n    }\n    /**\n     * Adds `o` to the collection of disposables managed by this object.\n     */\n    _register(o) {\n        if (o === this) {\n            throw new Error('Cannot register a disposable on itself!');\n        }\n        return this._store.add(o);\n    }\n}\n/**\n * Manages the lifecycle of a disposable value that may be changed.\n *\n * This ensures that when the disposable value is changed, the previously held disposable is disposed of. You can\n * also register a `MutableDisposable` on a `Disposable` to ensure it is automatically cleaned up.\n */\nclass MutableDisposable {\n    constructor() {\n        this._isDisposed = false;\n    }\n    /**\n     * Get the currently held disposable value, or `undefined` if this MutableDisposable has been disposed\n     */\n    get value() {\n        return this._isDisposed ? undefined : this._value;\n    }\n    /**\n     * Set a new disposable value.\n     *\n     * Behaviour:\n     * - If the MutableDisposable has been disposed, the setter is a no-op.\n     * - If the new value is strictly equal to the current value, the setter is a no-op.\n     * - Otherwise the previous value (if any) is disposed and the new value is stored.\n     *\n     * Related helpers:\n     * - clear() resets the value to `undefined` (and disposes the previous value).\n     * - clearAndLeak() returns the old value without disposing it and removes its parent.\n     */\n    set value(value) {\n        if (this._isDisposed || value === this._value) {\n            return;\n        }\n        this._value?.dispose();\n        this._value = value;\n    }\n    /**\n     * Resets the stored value and disposed of the previously stored value.\n     */\n    clear() {\n        this.value = undefined;\n    }\n    dispose() {\n        this._isDisposed = true;\n        this._value?.dispose();\n        this._value = undefined;\n    }\n}\nclass RefCountedDisposable {\n    constructor(_disposable) {\n        this._disposable = _disposable;\n        this._counter = 1;\n    }\n    acquire() {\n        this._counter++;\n        return this;\n    }\n    release() {\n        if (--this._counter === 0) {\n            this._disposable.dispose();\n        }\n        return this;\n    }\n}\nclass ImmortalReference {\n    constructor(object) {\n        this.object = object;\n    }\n    dispose() { }\n}\n/**\n * A map the manages the lifecycle of the values that it stores.\n */\nclass DisposableMap {\n    constructor() {\n        this._store = new Map();\n        this._isDisposed = false;\n    }\n    /**\n     * Disposes of all stored values and mark this object as disposed.\n     *\n     * Trying to use this object after it has been disposed of is an error.\n     */\n    dispose() {\n        this._isDisposed = true;\n        this.clearAndDisposeAll();\n    }\n    /**\n     * Disposes of all stored values and clear the map, but DO NOT mark this object as disposed.\n     */\n    clearAndDisposeAll() {\n        if (!this._store.size) {\n            return;\n        }\n        try {\n            dispose(this._store.values());\n        }\n        finally {\n            this._store.clear();\n        }\n    }\n    get(key) {\n        return this._store.get(key);\n    }\n    set(key, value, skipDisposeOnOverwrite = false) {\n        if (this._isDisposed) {\n            console.warn(new Error('Trying to add a disposable to a DisposableMap that has already been disposed of. The added object will be leaked!').stack);\n        }\n        if (!skipDisposeOnOverwrite) {\n            this._store.get(key)?.dispose();\n        }\n        this._store.set(key, value);\n    }\n    /**\n     * Delete the value stored for `key` from this map and also dispose of it.\n     */\n    deleteAndDispose(key) {\n        this._store.get(key)?.dispose();\n        this._store.delete(key);\n    }\n    values() {\n        return this._store.values();\n    }\n    [Symbol.iterator]() {\n        return this._store[Symbol.iterator]();\n    }\n}\n\nexport { Disposable, DisposableMap, DisposableStore, ImmortalReference, MutableDisposable, RefCountedDisposable, combinedDisposable, dispose, isDisposable, markAsSingleton, toDisposable };\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 *--------------------------------------------------------------------------------------------*/\nclass Node {\n    static { this.Undefined = new Node(undefined); }\n    constructor(element) {\n        this.element = element;\n        this.next = Node.Undefined;\n        this.prev = Node.Undefined;\n    }\n}\nclass LinkedList {\n    constructor() {\n        this._first = Node.Undefined;\n        this._last = Node.Undefined;\n        this._size = 0;\n    }\n    get size() {\n        return this._size;\n    }\n    isEmpty() {\n        return this._first === Node.Undefined;\n    }\n    clear() {\n        let node = this._first;\n        while (node !== Node.Undefined) {\n            const next = node.next;\n            node.prev = Node.Undefined;\n            node.next = Node.Undefined;\n            node = next;\n        }\n        this._first = Node.Undefined;\n        this._last = Node.Undefined;\n        this._size = 0;\n    }\n    unshift(element) {\n        return this._insert(element, false);\n    }\n    push(element) {\n        return this._insert(element, true);\n    }\n    _insert(element, atTheEnd) {\n        const newNode = new Node(element);\n        if (this._first === Node.Undefined) {\n            this._first = newNode;\n            this._last = newNode;\n        }\n        else if (atTheEnd) {\n            // push\n            const oldLast = this._last;\n            this._last = newNode;\n            newNode.prev = oldLast;\n            oldLast.next = newNode;\n        }\n        else {\n            // unshift\n            const oldFirst = this._first;\n            this._first = newNode;\n            newNode.next = oldFirst;\n            oldFirst.prev = newNode;\n        }\n        this._size += 1;\n        let didRemove = false;\n        return () => {\n            if (!didRemove) {\n                didRemove = true;\n                this._remove(newNode);\n            }\n        };\n    }\n    shift() {\n        if (this._first === Node.Undefined) {\n            return undefined;\n        }\n        else {\n            const res = this._first.element;\n            this._remove(this._first);\n            return res;\n        }\n    }\n    pop() {\n        if (this._last === Node.Undefined) {\n            return undefined;\n        }\n        else {\n            const res = this._last.element;\n            this._remove(this._last);\n            return res;\n        }\n    }\n    _remove(node) {\n        if (node.prev !== Node.Undefined && node.next !== Node.Undefined) {\n            // middle\n            const anchor = node.prev;\n            anchor.next = node.next;\n            node.next.prev = anchor;\n        }\n        else if (node.prev === Node.Undefined && node.next === Node.Undefined) {\n            // only node\n            this._first = Node.Undefined;\n            this._last = Node.Undefined;\n        }\n        else if (node.next === Node.Undefined) {\n            // last\n            this._last = this._last.prev;\n            this._last.next = Node.Undefined;\n        }\n        else if (node.prev === Node.Undefined) {\n            // first\n            this._first = this._first.next;\n            this._first.prev = Node.Undefined;\n        }\n        // done\n        this._size -= 1;\n    }\n    *[Symbol.iterator]() {\n        let node = this._first;\n        while (node !== Node.Undefined) {\n            yield node.element;\n            node = node.next;\n        }\n    }\n}\n\nexport { LinkedList };\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 *--------------------------------------------------------------------------------------------*/\nconst performanceNow = globalThis.performance.now.bind(globalThis.performance);\nclass StopWatch {\n    static create(highResolution) {\n        return new StopWatch(highResolution);\n    }\n    constructor(highResolution) {\n        this._now = highResolution === false ? Date.now : performanceNow;\n        this._startTime = this._now();\n        this._stopTime = -1;\n    }\n    stop() {\n        this._stopTime = this._now();\n    }\n    reset() {\n        this._startTime = this._now();\n        this._stopTime = -1;\n    }\n    elapsed() {\n        if (this._stopTime !== -1) {\n            return this._stopTime - this._startTime;\n        }\n        return this._now() - this._startTime;\n    }\n}\n\nexport { StopWatch };\n","import { onUnexpectedError } from './errors.js';\nimport { createSingleCallFunction } from './functional.js';\nimport { Disposable, combinedDisposable, DisposableStore, toDisposable } from './lifecycle.js';\nimport { LinkedList } from './linkedList.js';\nimport { StopWatch } from './stopwatch.js';\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 *--------------------------------------------------------------------------------------------*/\nvar Event;\n(function (Event) {\n    Event.None = () => Disposable.None;\n    /**\n     * Given an event, returns another event which debounces calls and defers the listeners to a later task via a shared\n     * `setTimeout`. The event is converted into a signal (`Event<void>`) to avoid additional object creation as a\n     * result of merging events and to try prevent race conditions that could arise when using related deferred and\n     * non-deferred events.\n     *\n     * This is useful for deferring non-critical work (eg. general UI updates) to ensure it does not block critical work\n     * (eg. latency of keypress to text rendered).\n     *\n     * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n     * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n     * returned event causes this utility to leak a listener on the original event.\n     *\n     * @param event The event source for the new event.\n     * @param disposable A disposable store to add the new EventEmitter to.\n     */\n    function defer(event, disposable) {\n        return debounce(event, () => void 0, 0, undefined, true, undefined, disposable);\n    }\n    Event.defer = defer;\n    /**\n     * Given an event, returns another event which only fires once.\n     *\n     * @param event The event source for the new event.\n     */\n    function once(event) {\n        return (listener, thisArgs = null, disposables) => {\n            // we need this, in case the event fires during the listener call\n            let didFire = false;\n            let result = undefined;\n            result = event(e => {\n                if (didFire) {\n                    return;\n                }\n                else if (result) {\n                    result.dispose();\n                }\n                else {\n                    didFire = true;\n                }\n                return listener.call(thisArgs, e);\n            }, null, disposables);\n            if (didFire) {\n                result.dispose();\n            }\n            return result;\n        };\n    }\n    Event.once = once;\n    /**\n     * Given an event, returns another event which only fires once, and only when the condition is met.\n     *\n     * @param event The event source for the new event.\n     */\n    function onceIf(event, condition) {\n        return Event.once(Event.filter(event, condition));\n    }\n    Event.onceIf = onceIf;\n    /**\n     * Maps an event of one type into an event of another type using a mapping function, similar to how\n     * `Array.prototype.map` works.\n     *\n     * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n     * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n     * returned event causes this utility to leak a listener on the original event.\n     *\n     * @param event The event source for the new event.\n     * @param map The mapping function.\n     * @param disposable A disposable store to add the new EventEmitter to.\n     */\n    function map(event, map, disposable) {\n        return snapshot((listener, thisArgs = null, disposables) => event(i => listener.call(thisArgs, map(i)), null, disposables), disposable);\n    }\n    Event.map = map;\n    /**\n     * Wraps an event in another event that performs some function on the event object before firing.\n     *\n     * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n     * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n     * returned event causes this utility to leak a listener on the original event.\n     *\n     * @param event The event source for the new event.\n     * @param each The function to perform on the event object.\n     * @param disposable A disposable store to add the new EventEmitter to.\n     */\n    function forEach(event, each, disposable) {\n        return snapshot((listener, thisArgs = null, disposables) => event(i => { each(i); listener.call(thisArgs, i); }, null, disposables), disposable);\n    }\n    Event.forEach = forEach;\n    function filter(event, filter, disposable) {\n        return snapshot((listener, thisArgs = null, disposables) => event(e => filter(e) && listener.call(thisArgs, e), null, disposables), disposable);\n    }\n    Event.filter = filter;\n    /**\n     * Given an event, returns the same event but typed as `Event<void>`.\n     */\n    function signal(event) {\n        return event;\n    }\n    Event.signal = signal;\n    function any(...events) {\n        return (listener, thisArgs = null, disposables) => {\n            const disposable = combinedDisposable(...events.map(event => event(e => listener.call(thisArgs, e))));\n            return addAndReturnDisposable(disposable, disposables);\n        };\n    }\n    Event.any = any;\n    /**\n     * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n     * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n     * returned event causes this utility to leak a listener on the original event.\n     */\n    function reduce(event, merge, initial, disposable) {\n        let output = initial;\n        return map(event, e => {\n            output = merge(output, e);\n            return output;\n        }, disposable);\n    }\n    Event.reduce = reduce;\n    function snapshot(event, disposable) {\n        let listener;\n        const options = {\n            onWillAddFirstListener() {\n                listener = event(emitter.fire, emitter);\n            },\n            onDidRemoveLastListener() {\n                listener?.dispose();\n            }\n        };\n        const emitter = new Emitter(options);\n        disposable?.add(emitter);\n        return emitter.event;\n    }\n    /**\n     * Adds the IDisposable to the store if it's set, and returns it. Useful to\n     * Event function implementation.\n     */\n    function addAndReturnDisposable(d, store) {\n        if (store instanceof Array) {\n            store.push(d);\n        }\n        else if (store) {\n            store.add(d);\n        }\n        return d;\n    }\n    function debounce(event, merge, delay = 100, leading = false, flushOnListenerRemove = false, leakWarningThreshold, disposable) {\n        let subscription;\n        let output = undefined;\n        let handle = undefined;\n        let numDebouncedCalls = 0;\n        let doFire;\n        const options = {\n            leakWarningThreshold,\n            onWillAddFirstListener() {\n                subscription = event(cur => {\n                    numDebouncedCalls++;\n                    output = merge(output, cur);\n                    if (leading && !handle) {\n                        emitter.fire(output);\n                        output = undefined;\n                    }\n                    doFire = () => {\n                        const _output = output;\n                        output = undefined;\n                        handle = undefined;\n                        if (!leading || numDebouncedCalls > 1) {\n                            emitter.fire(_output);\n                        }\n                        numDebouncedCalls = 0;\n                    };\n                    if (typeof delay === 'number') {\n                        if (handle) {\n                            clearTimeout(handle);\n                        }\n                        handle = setTimeout(doFire, delay);\n                    }\n                    else {\n                        if (handle === undefined) {\n                            handle = null;\n                            queueMicrotask(doFire);\n                        }\n                    }\n                });\n            },\n            onWillRemoveListener() {\n                if (flushOnListenerRemove && numDebouncedCalls > 0) {\n                    doFire?.();\n                }\n            },\n            onDidRemoveLastListener() {\n                doFire = undefined;\n                subscription.dispose();\n            }\n        };\n        const emitter = new Emitter(options);\n        disposable?.add(emitter);\n        return emitter.event;\n    }\n    Event.debounce = debounce;\n    /**\n     * Debounces an event, firing after some delay (default=0) with an array of all event original objects.\n     *\n     * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n     * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n     * returned event causes this utility to leak a listener on the original event.\n     */\n    function accumulate(event, delay = 0, disposable) {\n        return Event.debounce(event, (last, e) => {\n            if (!last) {\n                return [e];\n            }\n            last.push(e);\n            return last;\n        }, delay, undefined, true, undefined, disposable);\n    }\n    Event.accumulate = accumulate;\n    /**\n     * Filters an event such that some condition is _not_ met more than once in a row, effectively ensuring duplicate\n     * event objects from different sources do not fire the same event object.\n     *\n     * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n     * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n     * returned event causes this utility to leak a listener on the original event.\n     *\n     * @param event The event source for the new event.\n     * @param equals The equality condition.\n     * @param disposable A disposable store to add the new EventEmitter to.\n     *\n     * @example\n     * ```\n     * // Fire only one time when a single window is opened or focused\n     * Event.latch(Event.any(onDidOpenWindow, onDidFocusWindow))\n     * ```\n     */\n    function latch(event, equals = (a, b) => a === b, disposable) {\n        let firstCall = true;\n        let cache;\n        return filter(event, value => {\n            const shouldEmit = firstCall || !equals(value, cache);\n            firstCall = false;\n            cache = value;\n            return shouldEmit;\n        }, disposable);\n    }\n    Event.latch = latch;\n    /**\n     * Splits an event whose parameter is a union type into 2 separate events for each type in the union.\n     *\n     * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n     * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n     * returned event causes this utility to leak a listener on the original event.\n     *\n     * @example\n     * ```\n     * const event = new EventEmitter<number | undefined>().event;\n     * const [numberEvent, undefinedEvent] = Event.split(event, isUndefined);\n     * ```\n     *\n     * @param event The event source for the new event.\n     * @param isT A function that determines what event is of the first type.\n     * @param disposable A disposable store to add the new EventEmitter to.\n     */\n    function split(event, isT, disposable) {\n        return [\n            Event.filter(event, isT, disposable),\n            Event.filter(event, e => !isT(e), disposable),\n        ];\n    }\n    Event.split = split;\n    /**\n     * Buffers an event until it has a listener attached.\n     *\n     * *NOTE* that this function returns an `Event` and it MUST be called with a `DisposableStore` whenever the returned\n     * event is accessible to \"third parties\", e.g the event is a public property. Otherwise a leaked listener on the\n     * returned event causes this utility to leak a listener on the original event.\n     *\n     * @param event The event source for the new event.\n     * @param flushAfterTimeout Determines whether to flush the buffer after a timeout immediately or after a\n     * `setTimeout` when the first event listener is added.\n     * @param _buffer Internal: A source event array used for tests.\n     *\n     * @example\n     * ```\n     * // Start accumulating events, when the first listener is attached, flush\n     * // the event after a timeout such that multiple listeners attached before\n     * // the timeout would receive the event\n     * this.onInstallExtension = Event.buffer(service.onInstallExtension, true);\n     * ```\n     */\n    function buffer(event, flushAfterTimeout = false, _buffer = [], disposable) {\n        let buffer = _buffer.slice();\n        let listener = event(e => {\n            if (buffer) {\n                buffer.push(e);\n            }\n            else {\n                emitter.fire(e);\n            }\n        });\n        if (disposable) {\n            disposable.add(listener);\n        }\n        const flush = () => {\n            buffer?.forEach(e => emitter.fire(e));\n            buffer = null;\n        };\n        const emitter = new Emitter({\n            onWillAddFirstListener() {\n                if (!listener) {\n                    listener = event(e => emitter.fire(e));\n                    if (disposable) {\n                        disposable.add(listener);\n                    }\n                }\n            },\n            onDidAddFirstListener() {\n                if (buffer) {\n                    if (flushAfterTimeout) {\n                        setTimeout(flush);\n                    }\n                    else {\n                        flush();\n                    }\n                }\n            },\n            onDidRemoveLastListener() {\n                if (listener) {\n                    listener.dispose();\n                }\n                listener = null;\n            }\n        });\n        if (disposable) {\n            disposable.add(emitter);\n        }\n        return emitter.event;\n    }\n    Event.buffer = buffer;\n    /**\n     * Wraps the event in an {@link IChainableEvent}, allowing a more functional programming style.\n     *\n     * @example\n     * ```\n     * // Normal\n     * const onEnterPressNormal = Event.filter(\n     *   Event.map(onKeyPress.event, e => new StandardKeyboardEvent(e)),\n     *   e.keyCode === KeyCode.Enter\n     * ).event;\n     *\n     * // Using chain\n     * const onEnterPressChain = Event.chain(onKeyPress.event, $ => $\n     *   .map(e => new StandardKeyboardEvent(e))\n     *   .filter(e => e.keyCode === KeyCode.Enter)\n     * );\n     * ```\n     */\n    function chain(event, sythensize) {\n        const fn = (listener, thisArgs, disposables) => {\n            const cs = sythensize(new ChainableSynthesis());\n            return event(function (value) {\n                const result = cs.evaluate(value);\n                if (result !== HaltChainable) {\n                    listener.call(thisArgs, result);\n                }\n            }, undefined, disposables);\n        };\n        return fn;\n    }\n    Event.chain = chain;\n    const HaltChainable = Symbol('HaltChainable');\n    class ChainableSynthesis {\n        constructor() {\n            this.steps = [];\n        }\n        map(fn) {\n            this.steps.push(fn);\n            return this;\n        }\n        forEach(fn) {\n            this.steps.push(v => {\n                fn(v);\n                return v;\n            });\n            return this;\n        }\n        filter(fn) {\n            this.steps.push(v => fn(v) ? v : HaltChainable);\n            return this;\n        }\n        reduce(merge, initial) {\n            let last = initial;\n            this.steps.push(v => {\n                last = merge(last, v);\n                return last;\n            });\n            return this;\n        }\n        latch(equals = (a, b) => a === b) {\n            let firstCall = true;\n            let cache;\n            this.steps.push(value => {\n                const shouldEmit = firstCall || !equals(value, cache);\n                firstCall = false;\n                cache = value;\n                return shouldEmit ? value : HaltChainable;\n            });\n            return this;\n        }\n        evaluate(value) {\n            for (const step of this.steps) {\n                value = step(value);\n                if (value === HaltChainable) {\n                    break;\n                }\n            }\n            return value;\n        }\n    }\n    /**\n     * Creates an {@link Event} from a node event emitter.\n     */\n    function fromNodeEventEmitter(emitter, eventName, map = id => id) {\n        const fn = (...args) => result.fire(map(...args));\n        const onFirstListenerAdd = () => emitter.on(eventName, fn);\n        const onLastListenerRemove = () => emitter.removeListener(eventName, fn);\n        const result = new Emitter({ onWillAddFirstListener: onFirstListenerAdd, onDidRemoveLastListener: onLastListenerRemove });\n        return result.event;\n    }\n    Event.fromNodeEventEmitter = fromNodeEventEmitter;\n    /**\n     * Creates an {@link Event} from a DOM event emitter.\n     */\n    function fromDOMEventEmitter(emitter, eventName, map = id => id) {\n        const fn = (...args) => result.fire(map(...args));\n        const onFirstListenerAdd = () => emitter.addEventListener(eventName, fn);\n        const onLastListenerRemove = () => emitter.removeEventListener(eventName, fn);\n        const result = new Emitter({ onWillAddFirstListener: onFirstListenerAdd, onDidRemoveLastListener: onLastListenerRemove });\n        return result.event;\n    }\n    Event.fromDOMEventEmitter = fromDOMEventEmitter;\n    /**\n     * Creates a promise out of an event, using the {@link Event.once} helper.\n     */\n    function toPromise(event, disposables) {\n        let cancelRef;\n        const promise = new Promise((resolve, reject) => {\n            const listener = once(event)(resolve, null, disposables);\n            // not resolved, matching the behavior of a normal disposal\n            cancelRef = () => listener.dispose();\n        });\n        promise.cancel = cancelRef;\n        return promise;\n    }\n    Event.toPromise = toPromise;\n    /**\n     * A convenience function for forwarding an event to another emitter which\n     * improves readability.\n     *\n     * This is similar to {@link Relay} but allows instantiating and forwarding\n     * on a single line and also allows for multiple source events.\n     * @param from The event to forward.\n     * @param to The emitter to forward the event to.\n     * @example\n     * Event.forward(event, emitter);\n     * // equivalent to\n     * event(e => emitter.fire(e));\n     * // equivalent to\n     * event(emitter.fire, emitter);\n     */\n    function forward(from, to) {\n        return from(e => to.fire(e));\n    }\n    Event.forward = forward;\n    function runAndSubscribe(event, handler, initial) {\n        handler(initial);\n        return event(e => handler(e));\n    }\n    Event.runAndSubscribe = runAndSubscribe;\n    class EmitterObserver {\n        constructor(_observable, store) {\n            this._observable = _observable;\n            this._counter = 0;\n            this._hasChanged = false;\n            const options = {\n                onWillAddFirstListener: () => {\n                    _observable.addObserver(this);\n                    // Communicate to the observable that we received its current value and would like to be notified about future changes.\n                    this._observable.reportChanges();\n                },\n                onDidRemoveLastListener: () => {\n                    _observable.removeObserver(this);\n                }\n            };\n            this.emitter = new Emitter(options);\n            if (store) {\n                store.add(this.emitter);\n            }\n        }\n        beginUpdate(_observable) {\n            // assert(_observable === this.obs);\n            this._counter++;\n        }\n        handlePossibleChange(_observable) {\n            // assert(_observable === this.obs);\n        }\n        handleChange(_observable, _change) {\n            // assert(_observable === this.obs);\n            this._hasChanged = true;\n        }\n        endUpdate(_observable) {\n            // assert(_observable === this.obs);\n            this._counter--;\n            if (this._counter === 0) {\n                this._observable.reportChanges();\n                if (this._hasChanged) {\n                    this._hasChanged = false;\n                    this.emitter.fire(this._observable.get());\n                }\n            }\n        }\n    }\n    /**\n     * Creates an event emitter that is fired when the observable changes.\n     * Each listeners subscribes to the emitter.\n     */\n    function fromObservable(obs, store) {\n        const observer = new EmitterObserver(obs, store);\n        return observer.emitter.event;\n    }\n    Event.fromObservable = fromObservable;\n    /**\n     * Each listener is attached to the observable directly.\n     */\n    function fromObservableLight(observable) {\n        return (listener, thisArgs, disposables) => {\n            let count = 0;\n            let didChange = false;\n            const observer = {\n                beginUpdate() {\n                    count++;\n                },\n                endUpdate() {\n                    count--;\n                    if (count === 0) {\n                        observable.reportChanges();\n                        if (didChange) {\n                            didChange = false;\n                            listener.call(thisArgs);\n                        }\n                    }\n                },\n                handlePossibleChange() {\n                    // noop\n                },\n                handleChange() {\n                    didChange = true;\n                }\n            };\n            observable.addObserver(observer);\n            observable.reportChanges();\n            const disposable = {\n                dispose() {\n                    observable.removeObserver(observer);\n                }\n            };\n            if (disposables instanceof DisposableStore) {\n                disposables.add(disposable);\n            }\n            else if (Array.isArray(disposables)) {\n                disposables.push(disposable);\n            }\n            return disposable;\n        };\n    }\n    Event.fromObservableLight = fromObservableLight;\n})(Event || (Event = {}));\nclass EventProfiling {\n    static { this.all = new Set(); }\n    static { this._idPool = 0; }\n    constructor(name) {\n        this.listenerCount = 0;\n        this.invocationCount = 0;\n        this.elapsedOverall = 0;\n        this.durations = [];\n        this.name = `${name}_${EventProfiling._idPool++}`;\n        EventProfiling.all.add(this);\n    }\n    start(listenerCount) {\n        this._stopWatch = new StopWatch();\n        this.listenerCount = listenerCount;\n    }\n    stop() {\n        if (this._stopWatch) {\n            const elapsed = this._stopWatch.elapsed();\n            this.durations.push(elapsed);\n            this.elapsedOverall += elapsed;\n            this.invocationCount += 1;\n            this._stopWatch = undefined;\n        }\n    }\n}\nlet _globalLeakWarningThreshold = -1;\nclass LeakageMonitor {\n    static { this._idPool = 1; }\n    constructor(_errorHandler, threshold, name = (LeakageMonitor._idPool++).toString(16).padStart(3, '0')) {\n        this._errorHandler = _errorHandler;\n        this.threshold = threshold;\n        this.name = name;\n        this._warnCountdown = 0;\n    }\n    dispose() {\n        this._stacks?.clear();\n    }\n    check(stack, listenerCount) {\n        const threshold = this.threshold;\n        if (threshold <= 0 || listenerCount < threshold) {\n            return undefined;\n        }\n        if (!this._stacks) {\n            this._stacks = new Map();\n        }\n        const count = (this._stacks.get(stack.value) || 0);\n        this._stacks.set(stack.value, count + 1);\n        this._warnCountdown -= 1;\n        if (this._warnCountdown <= 0) {\n            // only warn on first exceed and then every time the limit\n            // is exceeded by 50% again\n            this._warnCountdown = threshold * 0.5;\n            const [topStack, topCount] = this.getMostFrequentStack();\n            const message = `[${this.name}] potential listener LEAK detected, having ${listenerCount} listeners already. MOST frequent listener (${topCount}):`;\n            console.warn(message);\n            console.warn(topStack);\n            const error = new ListenerLeakError(message, topStack);\n            this._errorHandler(error);\n        }\n        return () => {\n            const count = (this._stacks.get(stack.value) || 0);\n            this._stacks.set(stack.value, count - 1);\n        };\n    }\n    getMostFrequentStack() {\n        if (!this._stacks) {\n            return undefined;\n        }\n        let topStack;\n        let topCount = 0;\n        for (const [stack, count] of this._stacks) {\n            if (!topStack || topCount < count) {\n                topStack = [stack, count];\n                topCount = count;\n            }\n        }\n        return topStack;\n    }\n}\nclass Stacktrace {\n    static create() {\n        const err = new Error();\n        return new Stacktrace(err.stack ?? '');\n    }\n    constructor(value) {\n        this.value = value;\n    }\n    print() {\n        console.warn(this.value.split('\\n').slice(2).join('\\n'));\n    }\n}\n// error that is logged when going over the configured listener threshold\nclass ListenerLeakError extends Error {\n    constructor(message, stack) {\n        super(message);\n        this.name = 'ListenerLeakError';\n        this.stack = stack;\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\nclass ListenerRefusalError extends Error {\n    constructor(message, stack) {\n        super(message);\n        this.name = 'ListenerRefusalError';\n        this.stack = stack;\n    }\n}\nclass UniqueContainer {\n    constructor(value) {\n        this.value = value;\n    }\n}\nconst compactionThreshold = 2;\n/**\n * The Emitter can be used to expose an Event to the public\n * to fire it from the insides.\n * Sample:\n    class Document {\n\n        private readonly _onDidChange = new Emitter<(value:string)=>any>();\n\n        public onDidChange = this._onDidChange.event;\n\n        // getter-style\n        // get onDidChange(): Event<(value:string)=>any> {\n        // \treturn this._onDidChange.event;\n        // }\n\n        private _doIt() {\n            //...\n            this._onDidChange.fire(value);\n        }\n    }\n */\nclass Emitter {\n    constructor(options) {\n        this._size = 0;\n        this._options = options;\n        this._leakageMon = (this._options?.leakWarningThreshold)\n            ? new LeakageMonitor(options?.onListenerError ?? onUnexpectedError, this._options?.leakWarningThreshold ?? _globalLeakWarningThreshold) :\n            undefined;\n        this._perfMon = this._options?._profName ? new EventProfiling(this._options._profName) : undefined;\n        this._deliveryQueue = this._options?.deliveryQueue;\n    }\n    dispose() {\n        if (!this._disposed) {\n            this._disposed = true;\n            // It is bad to have listeners at the time of disposing an emitter, it is worst to have listeners keep the emitter\n            // alive via the reference that's embedded in their disposables. Therefore we loop over all remaining listeners and\n            // unset their subscriptions/disposables. Looping and blaming remaining listeners is done on next tick because the\n            // the following programming pattern is very popular:\n            //\n            // const someModel = this._disposables.add(new ModelObject()); // (1) create and register model\n            // this._disposables.add(someModel.onDidChange(() => { ... }); // (2) subscribe and register model-event listener\n            // ...later...\n            // this._disposables.dispose(); disposes (1) then (2): don't warn after (1) but after the \"overall dispose\" is done\n            if (this._deliveryQueue?.current === this) {\n                this._deliveryQueue.reset();\n            }\n            if (this._listeners) {\n                this._listeners = undefined;\n                this._size = 0;\n            }\n            this._options?.onDidRemoveLastListener?.();\n            this._leakageMon?.dispose();\n        }\n    }\n    /**\n     * For the public to allow to subscribe\n     * to events from this Emitter\n     */\n    get event() {\n        this._event ??= (callback, thisArgs, disposables) => {\n            if (this._leakageMon && this._size > this._leakageMon.threshold ** 2) {\n                const message = `[${this._leakageMon.name}] REFUSES to accept new listeners because it exceeded its threshold by far (${this._size} vs ${this._leakageMon.threshold})`;\n                console.warn(message);\n                const tuple = this._leakageMon.getMostFrequentStack() ?? ['UNKNOWN stack', -1];\n                const error = new ListenerRefusalError(`${message}. HINT: Stack shows most frequent listener (${tuple[1]}-times)`, tuple[0]);\n                const errorHandler = this._options?.onListenerError || onUnexpectedError;\n                errorHandler(error);\n                return Disposable.None;\n            }\n            if (this._disposed) {\n                // todo: should we warn if a listener is added to a disposed emitter? This happens often\n                return Disposable.None;\n            }\n            if (thisArgs) {\n                callback = callback.bind(thisArgs);\n            }\n            const contained = new UniqueContainer(callback);\n            let removeMonitor;\n            if (this._leakageMon && this._size >= Math.ceil(this._leakageMon.threshold * 0.2)) {\n                // check and record this emitter for potential leakage\n                contained.stack = Stacktrace.create();\n                removeMonitor = this._leakageMon.check(contained.stack, this._size + 1);\n            }\n            if (!this._listeners) {\n                this._options?.onWillAddFirstListener?.(this);\n                this._listeners = contained;\n                this._options?.onDidAddFirstListener?.(this);\n            }\n            else if (this._listeners instanceof UniqueContainer) {\n                this._deliveryQueue ??= new EventDeliveryQueuePrivate();\n                this._listeners = [this._listeners, contained];\n            }\n            else {\n                this._listeners.push(contained);\n            }\n            this._options?.onDidAddListener?.(this);\n            this._size++;\n            const result = toDisposable(() => {\n                removeMonitor?.();\n                this._removeListener(contained);\n            });\n            if (disposables instanceof DisposableStore) {\n                disposables.add(result);\n            }\n            else if (Array.isArray(disposables)) {\n                disposables.push(result);\n            }\n            return result;\n        };\n        return this._event;\n    }\n    _removeListener(listener) {\n        this._options?.onWillRemoveListener?.(this);\n        if (!this._listeners) {\n            return; // expected if a listener gets disposed\n        }\n        if (this._size === 1) {\n            this._listeners = undefined;\n            this._options?.onDidRemoveLastListener?.(this);\n            this._size = 0;\n            return;\n        }\n        // size > 1 which requires that listeners be a list:\n        const listeners = this._listeners;\n        const index = listeners.indexOf(listener);\n        if (index === -1) {\n            console.log('disposed?', this._disposed);\n            console.log('size?', this._size);\n            console.log('arr?', JSON.stringify(this._listeners));\n            throw new Error('Attempted to dispose unknown listener');\n        }\n        this._size--;\n        listeners[index] = undefined;\n        const adjustDeliveryQueue = this._deliveryQueue.current === this;\n        if (this._size * compactionThreshold <= listeners.length) {\n            let n = 0;\n            for (let i = 0; i < listeners.length; i++) {\n                if (listeners[i]) {\n                    listeners[n++] = listeners[i];\n                }\n                else if (adjustDeliveryQueue && n < this._deliveryQueue.end) {\n                    this._deliveryQueue.end--;\n                    if (n < this._deliveryQueue.i) {\n                        this._deliveryQueue.i--;\n                    }\n                }\n            }\n            listeners.length = n;\n        }\n    }\n    _deliver(listener, value) {\n        if (!listener) {\n            return;\n        }\n        const errorHandler = this._options?.onListenerError || onUnexpectedError;\n        if (!errorHandler) {\n            listener.value(value);\n            return;\n        }\n        try {\n            listener.value(value);\n        }\n        catch (e) {\n            errorHandler(e);\n        }\n    }\n    /** Delivers items in the queue. Assumes the queue is ready to go. */\n    _deliverQueue(dq) {\n        const listeners = dq.current._listeners;\n        while (dq.i < dq.end) {\n            // important: dq.i is incremented before calling deliver() because it might reenter deliverQueue()\n            this._deliver(listeners[dq.i++], dq.value);\n        }\n        dq.reset();\n    }\n    /**\n     * To be kept private to fire an event to\n     * subscribers\n     */\n    fire(event) {\n        if (this._deliveryQueue?.current) {\n            this._deliverQueue(this._deliveryQueue);\n            this._perfMon?.stop(); // last fire() will have starting perfmon, stop it before starting the next dispatch\n        }\n        this._perfMon?.start(this._size);\n        if (!this._listeners) ;\n        else if (this._listeners instanceof UniqueContainer) {\n            this._deliver(this._listeners, event);\n        }\n        else {\n            const dq = this._deliveryQueue;\n            dq.enqueue(this, event, this._listeners.length);\n            this._deliverQueue(dq);\n        }\n        this._perfMon?.stop();\n    }\n    hasListeners() {\n        return this._size > 0;\n    }\n}\nconst createEventDeliveryQueue = () => new EventDeliveryQueuePrivate();\nclass EventDeliveryQueuePrivate {\n    constructor() {\n        /**\n         * Index in current's listener list.\n         */\n        this.i = -1;\n        /**\n         * The last index in the listener's list to deliver.\n         */\n        this.end = 0;\n    }\n    enqueue(emitter, value, end) {\n        this.i = 0;\n        this.end = end;\n        this.current = emitter;\n        this.value = value;\n    }\n    reset() {\n        this.i = this.end; // force any current emission loop to stop, mainly for during dispose\n        this.current = undefined;\n        this.value = undefined;\n    }\n}\nclass PauseableEmitter extends Emitter {\n    constructor(options) {\n        super(options);\n        this._isPaused = 0;\n        this._eventQueue = new LinkedList();\n        this._mergeFn = options?.merge;\n    }\n    pause() {\n        this._isPaused++;\n    }\n    resume() {\n        if (this._isPaused !== 0 && --this._isPaused === 0) {\n            if (this._mergeFn) {\n                // use the merge function to create a single composite\n                // event. make a copy in case firing pauses this emitter\n                if (this._eventQueue.size > 0) {\n                    const events = Array.from(this._eventQueue);\n                    this._eventQueue.clear();\n                    super.fire(this._mergeFn(events));\n                }\n            }\n            else {\n                // no merging, fire each event individually and test\n                // that this emitter isn't paused halfway through\n                while (!this._isPaused && this._eventQueue.size !== 0) {\n                    super.fire(this._eventQueue.shift());\n                }\n            }\n        }\n    }\n    fire(event) {\n        if (this._size) {\n            if (this._isPaused !== 0) {\n                this._eventQueue.push(event);\n            }\n            else {\n                super.fire(event);\n            }\n        }\n    }\n}\nclass DebounceEmitter extends PauseableEmitter {\n    constructor(options) {\n        super(options);\n        this._delay = options.delay ?? 100;\n    }\n    fire(event) {\n        if (!this._handle) {\n            this.pause();\n            this._handle = setTimeout(() => {\n                this._handle = undefined;\n                this.resume();\n            }, this._delay);\n        }\n        super.fire(event);\n    }\n}\n/**\n * An emitter which queue all events and then process them at the\n * end of the event loop.\n */\nclass MicrotaskEmitter extends Emitter {\n    constructor(options) {\n        super(options);\n        this._queuedEvents = [];\n        this._mergeFn = options?.merge;\n    }\n    fire(event) {\n        if (!this.hasListeners()) {\n            return;\n        }\n        this._queuedEvents.push(event);\n        if (this._queuedEvents.length === 1) {\n            queueMicrotask(() => {\n                if (this._mergeFn) {\n                    super.fire(this._mergeFn(this._queuedEvents));\n                }\n                else {\n                    this._queuedEvents.forEach(e => super.fire(e));\n                }\n                this._queuedEvents = [];\n            });\n        }\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 */\nclass EventMultiplexer {\n    constructor() {\n        this.hasListeners = false;\n        this.events = [];\n        this.emitter = new Emitter({\n            onWillAddFirstListener: () => this.onFirstListenerAdd(),\n            onDidRemoveLastListener: () => this.onLastListenerRemove()\n        });\n    }\n    get event() {\n        return this.emitter.event;\n    }\n    add(event) {\n        const e = { event: event, listener: null };\n        this.events.push(e);\n        if (this.hasListeners) {\n            this.hook(e);\n        }\n        const dispose = () => {\n            if (this.hasListeners) {\n                this.unhook(e);\n            }\n            const idx = this.events.indexOf(e);\n            this.events.splice(idx, 1);\n        };\n        return toDisposable(createSingleCallFunction(dispose));\n    }\n    onFirstListenerAdd() {\n        this.hasListeners = true;\n        this.events.forEach(e => this.hook(e));\n    }\n    onLastListenerRemove() {\n        this.hasListeners = false;\n        this.events.forEach(e => this.unhook(e));\n    }\n    hook(e) {\n        e.listener = e.event(r => this.emitter.fire(r));\n    }\n    unhook(e) {\n        e.listener?.dispose();\n        e.listener = null;\n    }\n    dispose() {\n        this.emitter.dispose();\n        for (const e of this.events) {\n            e.listener?.dispose();\n        }\n        this.events = [];\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 */\nclass EventBufferer {\n    constructor() {\n        this.data = [];\n    }\n    wrapEvent(event, reduce, initial) {\n        return (listener, thisArgs, disposables) => {\n            return event(i => {\n                const data = this.data[this.data.length - 1];\n                // Non-reduce scenario\n                if (!reduce) {\n                    // Buffering case\n                    if (data) {\n                        data.buffers.push(() => listener.call(thisArgs, i));\n                    }\n                    else {\n                        // Not buffering case\n                        listener.call(thisArgs, i);\n                    }\n                    return;\n                }\n                // Reduce scenario\n                const reduceData = data;\n                // Not buffering case\n                if (!reduceData) {\n                    // TODO: Is there a way to cache this reduce call for all listeners?\n                    listener.call(thisArgs, reduce(initial, i));\n                    return;\n                }\n                // Buffering case\n                reduceData.items ??= [];\n                reduceData.items.push(i);\n                if (reduceData.buffers.length === 0) {\n                    // Include a single buffered function that will reduce all events when we're done buffering events\n                    data.buffers.push(() => {\n                        // cache the reduced result so that the value can be shared across all listeners\n                        reduceData.reducedResult ??= initial\n                            ? reduceData.items.reduce(reduce, initial)\n                            : reduceData.items.reduce(reduce);\n                        listener.call(thisArgs, reduceData.reducedResult);\n                    });\n                }\n            }, undefined, disposables);\n        };\n    }\n    bufferEvents(fn) {\n        const data = { buffers: new Array() };\n        this.data.push(data);\n        const r = fn();\n        this.data.pop();\n        data.buffers.forEach(flush => flush());\n        return r;\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 */\nclass Relay {\n    constructor() {\n        this.listening = false;\n        this.inputEvent = Event.None;\n        this.inputEventListener = Disposable.None;\n        this.emitter = new Emitter({\n            onDidAddFirstListener: () => {\n                this.listening = true;\n                this.inputEventListener = this.inputEvent(this.emitter.fire, this.emitter);\n            },\n            onDidRemoveLastListener: () => {\n                this.listening = false;\n                this.inputEventListener.dispose();\n            }\n        });\n        this.event = this.emitter.event;\n    }\n    set input(event) {\n        this.inputEvent = event;\n        if (this.listening) {\n            this.inputEventListener.dispose();\n            this.inputEventListener = event(this.emitter.fire, this.emitter);\n        }\n    }\n    dispose() {\n        this.inputEventListener.dispose();\n        this.emitter.dispose();\n    }\n}\n\nexport { DebounceEmitter, Emitter, Event, EventBufferer, EventMultiplexer, EventProfiling, ListenerLeakError, ListenerRefusalError, MicrotaskEmitter, PauseableEmitter, Relay, createEventDeliveryQueue };\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 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 * TODO@esm remove me once we no longer ship an AMD build.\n */\nfunction getNLSMessages() {\n    return globalThis._VSCODE_NLS_MESSAGES;\n}\nfunction getNLSLanguage() {\n    return globalThis._VSCODE_NLS_LANGUAGE;\n}\n\nexport { getNLSLanguage, getNLSMessages };\n","import { getNLSLanguage, getNLSMessages } from './nls.messages.js';\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// eslint-disable-next-line local/code-import-patterns\nconst isPseudo = getNLSLanguage() === 'pseudo' || (typeof document !== 'undefined' && document.location && typeof document.location.hash === 'string' && document.location.hash.indexOf('pseudo=true') >= 0);\nfunction _format(message, args) {\n    let result;\n    if (args.length === 0) {\n        result = message;\n    }\n    else {\n        result = message.replace(/\\{(\\d+)\\}/g, (match, rest) => {\n            const index = rest[0];\n            const arg = args[index];\n            let result = match;\n            if (typeof arg === 'string') {\n                result = arg;\n            }\n            else if (typeof arg === 'number' || typeof arg === 'boolean' || arg === void 0 || arg === null) {\n                result = String(arg);\n            }\n            return result;\n        });\n    }\n    if (isPseudo) {\n        // FF3B and FF3D is the Unicode zenkaku representation for [ and ]\n        result = '\\uFF3B' + result.replace(/[aouei]/g, '$&$&') + '\\uFF3D';\n    }\n    return result;\n}\n/**\n * @skipMangle\n */\nfunction localize(data /* | number when built */, message /* | null when built */, ...args) {\n    if (typeof data === 'number') {\n        return _format(lookupMessage(data, message), args);\n    }\n    return _format(message, args);\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, fallback) {\n    const message = getNLSMessages()?.[index];\n    if (typeof message !== 'string') {\n        if (typeof fallback === 'string') {\n            return fallback;\n        }\n        throw new Error(`!!! NLS MISSING: ${index} !!!`);\n    }\n    return message;\n}\n/**\n * @skipMangle\n */\nfunction localize2(data /* | number when built */, originalMessage, ...args) {\n    let message;\n    if (typeof data === 'number') {\n        message = lookupMessage(data, originalMessage);\n    }\n    else {\n        message = originalMessage;\n    }\n    const value = _format(message, args);\n    return {\n        value,\n        original: originalMessage === message ? value : _format(originalMessage, args)\n    };\n}\n\nexport { getNLSLanguage, getNLSMessages, localize, localize2 };\n","import '../../nls.js';\nimport { getNLSLanguage } from '../../nls.messages.js';\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 *--------------------------------------------------------------------------------------------*/\nconst LANGUAGE_DEFAULT = 'en';\nlet _isWindows = false;\nlet _isMacintosh = false;\nlet _isLinux = false;\nlet _isNative = false;\nlet _isWeb = false;\nlet _isIOS = false;\nlet _isMobile = false;\nlet _locale = undefined;\nlet _language = LANGUAGE_DEFAULT;\nlet _platformLocale = LANGUAGE_DEFAULT;\nlet _translationsConfigFile = undefined;\nlet _userAgent = undefined;\nconst $globalThis = globalThis;\nlet nodeProcess = undefined;\nif (typeof $globalThis.vscode !== 'undefined' && typeof $globalThis.vscode.process !== 'undefined') {\n    // Native environment (sandboxed)\n    nodeProcess = $globalThis.vscode.process;\n}\nelse if (typeof process !== 'undefined' && typeof process?.versions?.node === 'string') {\n    // Native environment (non-sandboxed)\n    nodeProcess = process;\n}\nconst isElectronProcess = typeof nodeProcess?.versions?.electron === 'string';\nconst isElectronRenderer = isElectronProcess && nodeProcess?.type === 'renderer';\n// Native environment\nif (typeof nodeProcess === 'object') {\n    _isWindows = (nodeProcess.platform === 'win32');\n    _isMacintosh = (nodeProcess.platform === 'darwin');\n    _isLinux = (nodeProcess.platform === 'linux');\n    _isLinux && !!nodeProcess.env['SNAP'] && !!nodeProcess.env['SNAP_REVISION'];\n    !!nodeProcess.env['CI'] || !!nodeProcess.env['BUILD_ARTIFACTSTAGINGDIRECTORY'] || !!nodeProcess.env['GITHUB_WORKSPACE'];\n    _locale = LANGUAGE_DEFAULT;\n    _language = LANGUAGE_DEFAULT;\n    const rawNlsConfig = nodeProcess.env['VSCODE_NLS_CONFIG'];\n    if (rawNlsConfig) {\n        try {\n            const nlsConfig = JSON.parse(rawNlsConfig);\n            _locale = nlsConfig.userLocale;\n            _platformLocale = nlsConfig.osLocale;\n            _language = nlsConfig.resolvedLanguage || LANGUAGE_DEFAULT;\n            _translationsConfigFile = nlsConfig.languagePack?.translationsConfigFile;\n        }\n        catch (e) {\n        }\n    }\n    _isNative = true;\n}\n// Web environment\nelse if (typeof navigator === 'object' && !isElectronRenderer) {\n    _userAgent = navigator.userAgent;\n    _isWindows = _userAgent.indexOf('Windows') >= 0;\n    _isMacintosh = _userAgent.indexOf('Macintosh') >= 0;\n    _isIOS = (_userAgent.indexOf('Macintosh') >= 0 || _userAgent.indexOf('iPad') >= 0 || _userAgent.indexOf('iPhone') >= 0) && !!navigator.maxTouchPoints && navigator.maxTouchPoints > 0;\n    _isLinux = _userAgent.indexOf('Linux') >= 0;\n    _isMobile = _userAgent?.indexOf('Mobi') >= 0;\n    _isWeb = true;\n    _language = getNLSLanguage() || LANGUAGE_DEFAULT;\n    _locale = navigator.language.toLowerCase();\n    _platformLocale = _locale;\n}\n// Unknown environment\nelse {\n    console.error('Unable to resolve platform.');\n}\nlet _platform = 0 /* Platform.Web */;\nif (_isMacintosh) {\n    _platform = 1 /* Platform.Mac */;\n}\nelse if (_isWindows) {\n    _platform = 3 /* Platform.Windows */;\n}\nelse if (_isLinux) {\n    _platform = 2 /* Platform.Linux */;\n}\nconst isWindows = _isWindows;\nconst isMacintosh = _isMacintosh;\nconst isLinux = _isLinux;\nconst isNative = _isNative;\nconst isWeb = _isWeb;\nconst isWebWorker = (_isWeb && typeof $globalThis.importScripts === 'function');\nconst webWorkerOrigin = isWebWorker ? $globalThis.origin : undefined;\nconst isIOS = _isIOS;\nconst isMobile = _isMobile;\nconst platform = _platform;\nconst userAgent = _userAgent;\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 */\nconst language = _language;\nconst setTimeout0IsFaster = (typeof $globalThis.postMessage === 'function' && !$globalThis.importScripts);\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 */\nconst setTimeout0 = (() => {\n    if (setTimeout0IsFaster) {\n        const pending = [];\n        $globalThis.addEventListener('message', (e) => {\n            if (e.data && e.data.vscodeScheduleAsyncWork) {\n                for (let i = 0, len = pending.length; i < len; i++) {\n                    const candidate = pending[i];\n                    if (candidate.id === e.data.vscodeScheduleAsyncWork) {\n                        pending.splice(i, 1);\n                        candidate.callback();\n                        return;\n                    }\n                }\n            }\n        });\n        let lastId = 0;\n        return (callback) => {\n            const myId = ++lastId;\n            pending.push({\n                id: myId,\n                callback: callback\n            });\n            $globalThis.postMessage({ vscodeScheduleAsyncWork: myId }, '*');\n        };\n    }\n    return (callback) => setTimeout(callback);\n})();\nconst OS = (_isMacintosh || _isIOS ? 2 /* OperatingSystem.Macintosh */ : (_isWindows ? 1 /* OperatingSystem.Windows */ : 3 /* OperatingSystem.Linux */));\nlet _isLittleEndian = true;\nlet _isLittleEndianComputed = false;\nfunction isLittleEndian() {\n    if (!_isLittleEndianComputed) {\n        _isLittleEndianComputed = true;\n        const test = new Uint8Array(2);\n        test[0] = 1;\n        test[1] = 2;\n        const view = new Uint16Array(test.buffer);\n        _isLittleEndian = (view[0] === (2 << 8) + 1);\n    }\n    return _isLittleEndian;\n}\nconst isChrome = !!(userAgent && userAgent.indexOf('Chrome') >= 0);\nconst isFirefox = !!(userAgent && userAgent.indexOf('Firefox') >= 0);\nconst isSafari = !!(!isChrome && (userAgent && userAgent.indexOf('Safari') >= 0));\nconst isEdge = !!(userAgent && userAgent.indexOf('Edg/') >= 0);\nconst isAndroid = !!(userAgent && userAgent.indexOf('Android') >= 0);\n\nexport { LANGUAGE_DEFAULT, OS, isAndroid, isChrome, isEdge, isFirefox, isIOS, isLinux, isLittleEndian, isMacintosh, isMobile, isNative, isSafari, isWeb, isWebWorker, isWindows, language, platform, setTimeout0, setTimeout0IsFaster, userAgent, webWorkerOrigin };\n","function identity(t) {\n    return t;\n}\n/**\n * Uses a LRU cache to make a given parametrized function cached.\n * Caches just the last key/value.\n*/\nclass LRUCachedFunction {\n    constructor(arg1, arg2) {\n        this.lastCache = undefined;\n        this.lastArgKey = undefined;\n        if (typeof arg1 === 'function') {\n            this._fn = arg1;\n            this._computeKey = identity;\n        }\n        else {\n            this._fn = arg2;\n            this._computeKey = arg1.getCacheKey;\n        }\n    }\n    get(arg) {\n        const key = this._computeKey(arg);\n        if (this.lastArgKey !== key) {\n            this.lastArgKey = key;\n            this.lastCache = this._fn(arg);\n        }\n        return this.lastCache;\n    }\n}\n/**\n * Uses an unbounded cache to memoize the results of the given function.\n*/\nclass CachedFunction {\n    get cachedValues() {\n        return this._map;\n    }\n    constructor(arg1, arg2) {\n        this._map = new Map();\n        this._map2 = new Map();\n        if (typeof arg1 === 'function') {\n            this._fn = arg1;\n            this._computeKey = identity;\n        }\n        else {\n            this._fn = arg2;\n            this._computeKey = arg1.getCacheKey;\n        }\n    }\n    get(arg) {\n        const key = this._computeKey(arg);\n        if (this._map2.has(key)) {\n            return this._map2.get(key);\n        }\n        const value = this._fn(arg);\n        this._map.set(arg, value);\n        this._map2.set(key, value);\n        return value;\n    }\n}\n\nexport { CachedFunction, LRUCachedFunction, identity };\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 LazyValueState;\n(function (LazyValueState) {\n    LazyValueState[LazyValueState[\"Uninitialized\"] = 0] = \"Uninitialized\";\n    LazyValueState[LazyValueState[\"Running\"] = 1] = \"Running\";\n    LazyValueState[LazyValueState[\"Completed\"] = 2] = \"Completed\";\n})(LazyValueState || (LazyValueState = {}));\nclass Lazy {\n    constructor(executor) {\n        this.executor = executor;\n        this._state = LazyValueState.Uninitialized;\n    }\n    /**\n     * Get the wrapped value.\n     *\n     * This will force evaluation of the lazy value if it has not been resolved yet. Lazy values are only\n     * resolved once. `getValue` will re-throw exceptions that are hit while resolving the value\n     */\n    get value() {\n        if (this._state === LazyValueState.Uninitialized) {\n            this._state = LazyValueState.Running;\n            try {\n                this._value = this.executor();\n            }\n            catch (err) {\n                this._error = err;\n            }\n            finally {\n                this._state = LazyValueState.Completed;\n            }\n        }\n        else if (this._state === LazyValueState.Running) {\n            throw new Error('Cannot read the value of a lazy that is being initialized');\n        }\n        if (this._error) {\n            throw this._error;\n        }\n        return this._value;\n    }\n    /**\n     * Get the wrapped value without forcing evaluation.\n     */\n    get rawValue() { return this._value; }\n}\n\nexport { Lazy };\n","import { LRUCachedFunction } from './cache.js';\nimport { Lazy } from './lazy.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction isFalsyOrWhitespace(str) {\n    if (!str || typeof str !== 'string') {\n        return true;\n    }\n    return str.trim().length === 0;\n}\nconst _formatRegexp = /{(\\d+)}/g;\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 */\nfunction format(value, ...args) {\n    if (args.length === 0) {\n        return value;\n    }\n    return value.replace(_formatRegexp, function (match, group) {\n        const idx = parseInt(group, 10);\n        return isNaN(idx) || idx < 0 || idx >= args.length ?\n            match :\n            args[idx];\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 */\nfunction htmlAttributeEncodeValue(value) {\n    return value.replace(/[<>\"'&]/g, ch => {\n        switch (ch) {\n            case '<': return '&lt;';\n            case '>': return '&gt;';\n            case '\"': return '&quot;';\n            case '\\'': return '&apos;';\n            case '&': return '&amp;';\n        }\n        return ch;\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 */\nfunction escape(html) {\n    return html.replace(/[<>&]/g, function (match) {\n        switch (match) {\n            case '<': return '&lt;';\n            case '>': return '&gt;';\n            case '&': return '&amp;';\n            default: return match;\n        }\n    });\n}\n/**\n * Escapes regular expression characters in a given string\n */\nfunction escapeRegExpCharacters(value) {\n    return value.replace(/[\\\\\\{\\}\\*\\+\\?\\|\\^\\$\\.\\[\\]\\(\\)]/g, '\\\\$&');\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 */\nfunction trim(haystack, needle = ' ') {\n    const trimmed = ltrim(haystack, needle);\n    return rtrim(trimmed, needle);\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 */\nfunction ltrim(haystack, needle) {\n    if (!haystack || !needle) {\n        return haystack;\n    }\n    const needleLen = needle.length;\n    if (needleLen === 0 || haystack.length === 0) {\n        return haystack;\n    }\n    let offset = 0;\n    while (haystack.indexOf(needle, offset) === offset) {\n        offset = offset + needleLen;\n    }\n    return haystack.substring(offset);\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 */\nfunction rtrim(haystack, needle) {\n    if (!haystack || !needle) {\n        return haystack;\n    }\n    const needleLen = needle.length, haystackLen = haystack.length;\n    if (needleLen === 0 || haystackLen === 0) {\n        return haystack;\n    }\n    let offset = haystackLen, idx = -1;\n    while (true) {\n        idx = haystack.lastIndexOf(needle, offset - 1);\n        if (idx === -1 || idx + needleLen !== offset) {\n            break;\n        }\n        if (idx === 0) {\n            return '';\n        }\n        offset = idx;\n    }\n    return haystack.substring(0, offset);\n}\nfunction convertSimple2RegExpPattern(pattern) {\n    return pattern.replace(/[\\-\\\\\\{\\}\\+\\?\\|\\^\\$\\.\\,\\[\\]\\(\\)\\#\\s]/g, '\\\\$&').replace(/[\\*]/g, '.*');\n}\nfunction createRegExp(searchString, isRegex, options = {}) {\n    if (!searchString) {\n        throw new Error('Cannot create regex from empty string');\n    }\n    if (!isRegex) {\n        searchString = escapeRegExpCharacters(searchString);\n    }\n    if (options.wholeWord) {\n        if (!/\\B/.test(searchString.charAt(0))) {\n            searchString = '\\\\b' + searchString;\n        }\n        if (!/\\B/.test(searchString.charAt(searchString.length - 1))) {\n            searchString = searchString + '\\\\b';\n        }\n    }\n    let modifiers = '';\n    if (options.global) {\n        modifiers += 'g';\n    }\n    if (!options.matchCase) {\n        modifiers += 'i';\n    }\n    if (options.multiline) {\n        modifiers += 'm';\n    }\n    if (options.unicode) {\n        modifiers += 'u';\n    }\n    return new RegExp(searchString, modifiers);\n}\nfunction regExpLeadsToEndlessLoop(regexp) {\n    // Exit early if it's one of these special cases which are meant to match\n    // against an empty string\n    if (regexp.source === '^' || regexp.source === '^$' || regexp.source === '$' || regexp.source === '^\\\\s*$') {\n        return false;\n    }\n    // We check against an empty string. If the regular expression doesn't advance\n    // (e.g. ends in an endless loop) it will match an empty string.\n    const match = regexp.exec('');\n    return !!(match && regexp.lastIndex === 0);\n}\nfunction splitLines(str) {\n    return str.split(/\\r\\n|\\r|\\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 */\nfunction firstNonWhitespaceIndex(str) {\n    for (let i = 0, len = str.length; i < len; i++) {\n        const chCode = str.charCodeAt(i);\n        if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.Tab */) {\n            return i;\n        }\n    }\n    return -1;\n}\n/**\n * Returns the leading whitespace of the string.\n * If the string contains only whitespaces, returns entire string\n */\nfunction getLeadingWhitespace(str, start = 0, end = str.length) {\n    for (let i = start; i < end; i++) {\n        const chCode = str.charCodeAt(i);\n        if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.Tab */) {\n            return str.substring(start, i);\n        }\n    }\n    return str.substring(start, end);\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 */\nfunction lastNonWhitespaceIndex(str, startIndex = str.length - 1) {\n    for (let i = startIndex; i >= 0; i--) {\n        const chCode = str.charCodeAt(i);\n        if (chCode !== 32 /* CharCode.Space */ && chCode !== 9 /* CharCode.Tab */) {\n            return i;\n        }\n    }\n    return -1;\n}\nfunction compare(a, b) {\n    if (a < b) {\n        return -1;\n    }\n    else if (a > b) {\n        return 1;\n    }\n    else {\n        return 0;\n    }\n}\nfunction compareSubstring(a, b, aStart = 0, aEnd = a.length, bStart = 0, bEnd = b.length) {\n    for (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {\n        const codeA = a.charCodeAt(aStart);\n        const codeB = b.charCodeAt(bStart);\n        if (codeA < codeB) {\n            return -1;\n        }\n        else if (codeA > codeB) {\n            return 1;\n        }\n    }\n    const aLen = aEnd - aStart;\n    const bLen = bEnd - bStart;\n    if (aLen < bLen) {\n        return -1;\n    }\n    else if (aLen > bLen) {\n        return 1;\n    }\n    return 0;\n}\nfunction compareIgnoreCase(a, b) {\n    return compareSubstringIgnoreCase(a, b, 0, a.length, 0, b.length);\n}\nfunction compareSubstringIgnoreCase(a, b, aStart = 0, aEnd = a.length, bStart = 0, bEnd = b.length) {\n    for (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {\n        let codeA = a.charCodeAt(aStart);\n        let codeB = b.charCodeAt(bStart);\n        if (codeA === codeB) {\n            // equal\n            continue;\n        }\n        if (codeA >= 128 || codeB >= 128) {\n            // not ASCII letters -> fallback to lower-casing strings\n            return compareSubstring(a.toLowerCase(), b.toLowerCase(), aStart, aEnd, bStart, bEnd);\n        }\n        // mapper lower-case ascii letter onto upper-case varinats\n        // [97-122] (lower ascii) --> [65-90] (upper ascii)\n        if (isLowerAsciiLetter(codeA)) {\n            codeA -= 32;\n        }\n        if (isLowerAsciiLetter(codeB)) {\n            codeB -= 32;\n        }\n        // compare both code points\n        const diff = codeA - codeB;\n        if (diff === 0) {\n            continue;\n        }\n        return diff;\n    }\n    const aLen = aEnd - aStart;\n    const bLen = bEnd - bStart;\n    if (aLen < bLen) {\n        return -1;\n    }\n    else if (aLen > bLen) {\n        return 1;\n    }\n    return 0;\n}\nfunction isAsciiDigit(code) {\n    return code >= 48 /* CharCode.Digit0 */ && code <= 57 /* CharCode.Digit9 */;\n}\nfunction isLowerAsciiLetter(code) {\n    return code >= 97 /* CharCode.a */ && code <= 122 /* CharCode.z */;\n}\nfunction isUpperAsciiLetter(code) {\n    return code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */;\n}\nfunction equalsIgnoreCase(a, b) {\n    return a.length === b.length && compareSubstringIgnoreCase(a, b) === 0;\n}\nfunction startsWithIgnoreCase(str, candidate) {\n    const len = candidate.length;\n    return len <= str.length && compareSubstringIgnoreCase(str, candidate, 0, len) === 0;\n}\nfunction endsWithIgnoreCase(str, candidate) {\n    const len = str.length;\n    const start = len - candidate.length;\n    return start >= 0 && compareSubstringIgnoreCase(str, candidate, start, len) === 0;\n}\n/**\n * @returns the length of the common prefix of the two strings.\n */\nfunction commonPrefixLength(a, b) {\n    const len = Math.min(a.length, b.length);\n    let i;\n    for (i = 0; i < len; i++) {\n        if (a.charCodeAt(i) !== b.charCodeAt(i)) {\n            return i;\n        }\n    }\n    return len;\n}\n/**\n * @returns the length of the common suffix of the two strings.\n */\nfunction commonSuffixLength(a, b) {\n    const len = Math.min(a.length, b.length);\n    let i;\n    const aLastIndex = a.length - 1;\n    const bLastIndex = b.length - 1;\n    for (i = 0; i < len; i++) {\n        if (a.charCodeAt(aLastIndex - i) !== b.charCodeAt(bLastIndex - i)) {\n            return i;\n        }\n    }\n    return len;\n}\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nfunction isHighSurrogate(charCode) {\n    return (0xD800 <= charCode && charCode <= 0xDBFF);\n}\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nfunction isLowSurrogate(charCode) {\n    return (0xDC00 <= charCode && charCode <= 0xDFFF);\n}\n/**\n * See http://en.wikipedia.org/wiki/Surrogate_pair\n */\nfunction computeCodePoint(highSurrogate, lowSurrogate) {\n    return ((highSurrogate - 0xD800) << 10) + (lowSurrogate - 0xDC00) + 0x10000;\n}\n/**\n * get the code point that begins at offset `offset`\n */\nfunction getNextCodePoint(str, len, offset) {\n    const charCode = str.charCodeAt(offset);\n    if (isHighSurrogate(charCode) && offset + 1 < len) {\n        const nextCharCode = str.charCodeAt(offset + 1);\n        if (isLowSurrogate(nextCharCode)) {\n            return computeCodePoint(charCode, nextCharCode);\n        }\n    }\n    return charCode;\n}\n/**\n * get the code point that ends right before offset `offset`\n */\nfunction getPrevCodePoint(str, offset) {\n    const charCode = str.charCodeAt(offset - 1);\n    if (isLowSurrogate(charCode) && offset > 1) {\n        const prevCharCode = str.charCodeAt(offset - 2);\n        if (isHighSurrogate(prevCharCode)) {\n            return computeCodePoint(prevCharCode, charCode);\n        }\n    }\n    return charCode;\n}\nclass CodePointIterator {\n    get offset() {\n        return this._offset;\n    }\n    constructor(str, offset = 0) {\n        this._str = str;\n        this._len = str.length;\n        this._offset = offset;\n    }\n    setOffset(offset) {\n        this._offset = offset;\n    }\n    prevCodePoint() {\n        const codePoint = getPrevCodePoint(this._str, this._offset);\n        this._offset -= (codePoint >= 65536 /* Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1);\n        return codePoint;\n    }\n    nextCodePoint() {\n        const codePoint = getNextCodePoint(this._str, this._len, this._offset);\n        this._offset += (codePoint >= 65536 /* Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN */ ? 2 : 1);\n        return codePoint;\n    }\n    eol() {\n        return (this._offset >= this._len);\n    }\n}\nclass GraphemeIterator {\n    get offset() {\n        return this._iterator.offset;\n    }\n    constructor(str, offset = 0) {\n        this._iterator = new CodePointIterator(str, offset);\n    }\n    nextGraphemeLength() {\n        const graphemeBreakTree = GraphemeBreakTree.getInstance();\n        const iterator = this._iterator;\n        const initialOffset = iterator.offset;\n        let graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.nextCodePoint());\n        while (!iterator.eol()) {\n            const offset = iterator.offset;\n            const nextGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.nextCodePoint());\n            if (breakBetweenGraphemeBreakType(graphemeBreakType, nextGraphemeBreakType)) {\n                // move iterator back\n                iterator.setOffset(offset);\n                break;\n            }\n            graphemeBreakType = nextGraphemeBreakType;\n        }\n        return (iterator.offset - initialOffset);\n    }\n    prevGraphemeLength() {\n        const graphemeBreakTree = GraphemeBreakTree.getInstance();\n        const iterator = this._iterator;\n        const initialOffset = iterator.offset;\n        let graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.prevCodePoint());\n        while (iterator.offset > 0) {\n            const offset = iterator.offset;\n            const prevGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(iterator.prevCodePoint());\n            if (breakBetweenGraphemeBreakType(prevGraphemeBreakType, graphemeBreakType)) {\n                // move iterator back\n                iterator.setOffset(offset);\n                break;\n            }\n            graphemeBreakType = prevGraphemeBreakType;\n        }\n        return (initialOffset - iterator.offset);\n    }\n    eol() {\n        return this._iterator.eol();\n    }\n}\nfunction nextCharLength(str, initialOffset) {\n    const iterator = new GraphemeIterator(str, initialOffset);\n    return iterator.nextGraphemeLength();\n}\nfunction prevCharLength(str, initialOffset) {\n    const iterator = new GraphemeIterator(str, initialOffset);\n    return iterator.prevGraphemeLength();\n}\nfunction getCharContainingOffset(str, offset) {\n    if (offset > 0 && isLowSurrogate(str.charCodeAt(offset))) {\n        offset--;\n    }\n    const endOffset = offset + nextCharLength(str, offset);\n    const startOffset = endOffset - prevCharLength(str, endOffset);\n    return [startOffset, endOffset];\n}\nlet CONTAINS_RTL = undefined;\nfunction makeContainsRtl() {\n    // Generated using https://github.com/alexdima/unicode-utils/blob/main/rtl-test.js\n    return /(?:[\\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 * Returns true if `str` contains any Unicode character that is classified as \"R\" or \"AL\".\n */\nfunction containsRTL(str) {\n    if (!CONTAINS_RTL) {\n        CONTAINS_RTL = makeContainsRtl();\n    }\n    return CONTAINS_RTL.test(str);\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 */\nfunction isBasicASCII(str) {\n    return IS_BASIC_ASCII.test(str);\n}\nconst 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 */\nfunction containsUnusualLineTerminators(str) {\n    return UNUSUAL_LINE_TERMINATORS.test(str);\n}\nfunction isFullWidthCharacter(charCode) {\n    // Do a cheap trick to better support wrapping of wide characters, treat them as 2 columns\n    // http://jrgraphix.net/research/unicode_blocks.php\n    //          2E80 - 2EFF   CJK Radicals Supplement\n    //          2F00 - 2FDF   Kangxi Radicals\n    //          2FF0 - 2FFF   Ideographic Description Characters\n    //          3000 - 303F   CJK Symbols and Punctuation\n    //          3040 - 309F   Hiragana\n    //          30A0 - 30FF   Katakana\n    //          3100 - 312F   Bopomofo\n    //          3130 - 318F   Hangul Compatibility Jamo\n    //          3190 - 319F   Kanbun\n    //          31A0 - 31BF   Bopomofo Extended\n    //          31F0 - 31FF   Katakana Phonetic Extensions\n    //          3200 - 32FF   Enclosed CJK Letters and Months\n    //          3300 - 33FF   CJK Compatibility\n    //          3400 - 4DBF   CJK Unified Ideographs Extension A\n    //          4DC0 - 4DFF   Yijing Hexagram Symbols\n    //          4E00 - 9FFF   CJK Unified Ideographs\n    //          A000 - A48F   Yi Syllables\n    //          A490 - A4CF   Yi Radicals\n    //          AC00 - D7AF   Hangul Syllables\n    // [IGNORE] D800 - DB7F   High Surrogates\n    // [IGNORE] DB80 - DBFF   High Private Use Surrogates\n    // [IGNORE] DC00 - DFFF   Low Surrogates\n    // [IGNORE] E000 - F8FF   Private Use Area\n    //          F900 - FAFF   CJK Compatibility Ideographs\n    // [IGNORE] FB00 - FB4F   Alphabetic Presentation Forms\n    // [IGNORE] FB50 - FDFF   Arabic Presentation Forms-A\n    // [IGNORE] FE00 - FE0F   Variation Selectors\n    // [IGNORE] FE20 - FE2F   Combining Half Marks\n    // [IGNORE] FE30 - FE4F   CJK Compatibility Forms\n    // [IGNORE] FE50 - FE6F   Small Form Variants\n    // [IGNORE] FE70 - FEFF   Arabic Presentation Forms-B\n    //          FF00 - FFEF   Halfwidth and Fullwidth Forms\n    //               [https://en.wikipedia.org/wiki/Halfwidth_and_fullwidth_forms]\n    //               of which FF01 - FF5E fullwidth ASCII of 21 to 7E\n    // [IGNORE]    and FF65 - FFDC halfwidth of Katakana and Hangul\n    // [IGNORE] FFF0 - FFFF   Specials\n    return ((charCode >= 0x2E80 && charCode <= 0xD7AF)\n        || (charCode >= 0xF900 && charCode <= 0xFAFF)\n        || (charCode >= 0xFF01 && charCode <= 0xFF5E));\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 */\nfunction isEmojiImprecise(x) {\n    return ((x >= 0x1F1E6 && x <= 0x1F1FF) || (x === 8986) || (x === 8987) || (x === 9200)\n        || (x === 9203) || (x >= 9728 && x <= 10175) || (x === 11088) || (x === 11093)\n        || (x >= 127744 && x <= 128591) || (x >= 128640 && x <= 128764)\n        || (x >= 128992 && x <= 129008) || (x >= 129280 && x <= 129535)\n        || (x >= 129648 && x <= 129782));\n}\n// -- UTF-8 BOM\nconst UTF8_BOM_CHARACTER = String.fromCharCode(65279 /* CharCode.UTF8_BOM */);\nfunction startsWithUTF8BOM(str) {\n    return !!(str && str.length > 0 && str.charCodeAt(0) === 65279 /* CharCode.UTF8_BOM */);\n}\nfunction containsUppercaseCharacter(target, ignoreEscapedChars = false) {\n    if (!target) {\n        return false;\n    }\n    if (ignoreEscapedChars) {\n        target = target.replace(/\\\\./g, '');\n    }\n    return target.toLowerCase() !== target;\n}\n/**\n * Produces 'a'-'z', followed by 'A'-'Z'... followed by 'a'-'z', etc.\n */\nfunction singleLetterHash(n) {\n    const LETTERS_CNT = (90 /* CharCode.Z */ - 65 /* CharCode.A */ + 1);\n    n = n % (2 * LETTERS_CNT);\n    if (n < LETTERS_CNT) {\n        return String.fromCharCode(97 /* CharCode.a */ + n);\n    }\n    return String.fromCharCode(65 /* CharCode.A */ + n - LETTERS_CNT);\n}\nfunction breakBetweenGraphemeBreakType(breakTypeA, breakTypeB) {\n    // http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundary_Rules\n    // !!! Let's make the common case a bit faster\n    if (breakTypeA === 0 /* GraphemeBreakType.Other */) {\n        // see https://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakTest-13.0.0d10.html#table\n        return (breakTypeB !== 5 /* GraphemeBreakType.Extend */ && breakTypeB !== 7 /* GraphemeBreakType.SpacingMark */);\n    }\n    // Do not break between a CR and LF. Otherwise, break before and after controls.\n    // GB3                                        CR × LF\n    // GB4                       (Control | CR | LF) ÷\n    // GB5                                           ÷ (Control | CR | LF)\n    if (breakTypeA === 2 /* GraphemeBreakType.CR */) {\n        if (breakTypeB === 3 /* GraphemeBreakType.LF */) {\n            return false; // GB3\n        }\n    }\n    if (breakTypeA === 4 /* GraphemeBreakType.Control */ || breakTypeA === 2 /* GraphemeBreakType.CR */ || breakTypeA === 3 /* GraphemeBreakType.LF */) {\n        return true; // GB4\n    }\n    if (breakTypeB === 4 /* GraphemeBreakType.Control */ || breakTypeB === 2 /* GraphemeBreakType.CR */ || breakTypeB === 3 /* GraphemeBreakType.LF */) {\n        return true; // GB5\n    }\n    // Do not break Hangul syllable sequences.\n    // GB6                                         L × (L | V | LV | LVT)\n    // GB7                                  (LV | V) × (V | T)\n    // GB8                                 (LVT | T) × T\n    if (breakTypeA === 8 /* GraphemeBreakType.L */) {\n        if (breakTypeB === 8 /* GraphemeBreakType.L */ || breakTypeB === 9 /* GraphemeBreakType.V */ || breakTypeB === 11 /* GraphemeBreakType.LV */ || breakTypeB === 12 /* GraphemeBreakType.LVT */) {\n            return false; // GB6\n        }\n    }\n    if (breakTypeA === 11 /* GraphemeBreakType.LV */ || breakTypeA === 9 /* GraphemeBreakType.V */) {\n        if (breakTypeB === 9 /* GraphemeBreakType.V */ || breakTypeB === 10 /* GraphemeBreakType.T */) {\n            return false; // GB7\n        }\n    }\n    if (breakTypeA === 12 /* GraphemeBreakType.LVT */ || breakTypeA === 10 /* GraphemeBreakType.T */) {\n        if (breakTypeB === 10 /* GraphemeBreakType.T */) {\n            return false; // GB8\n        }\n    }\n    // Do not break before extending characters or ZWJ.\n    // GB9                                           × (Extend | ZWJ)\n    if (breakTypeB === 5 /* GraphemeBreakType.Extend */ || breakTypeB === 13 /* GraphemeBreakType.ZWJ */) {\n        return false; // GB9\n    }\n    // The GB9a and GB9b rules only apply to extended grapheme clusters:\n    // Do not break before SpacingMarks, or after Prepend characters.\n    // GB9a                                          × SpacingMark\n    // GB9b                                  Prepend ×\n    if (breakTypeB === 7 /* GraphemeBreakType.SpacingMark */) {\n        return false; // GB9a\n    }\n    if (breakTypeA === 1 /* GraphemeBreakType.Prepend */) {\n        return false; // GB9b\n    }\n    // Do not break within emoji modifier sequences or emoji zwj sequences.\n    // GB11    \\p{Extended_Pictographic} Extend* ZWJ × \\p{Extended_Pictographic}\n    if (breakTypeA === 13 /* GraphemeBreakType.ZWJ */ && breakTypeB === 14 /* GraphemeBreakType.Extended_Pictographic */) {\n        // Note: we are not implementing the rule entirely here to avoid introducing states\n        return false; // GB11\n    }\n    // GB12                          sot (RI RI)* RI × RI\n    // GB13                        [^RI] (RI RI)* RI × RI\n    if (breakTypeA === 6 /* GraphemeBreakType.Regional_Indicator */ && breakTypeB === 6 /* GraphemeBreakType.Regional_Indicator */) {\n        // Note: we are not implementing the rule entirely here to avoid introducing states\n        return false; // GB12 & GB13\n    }\n    // GB999                                     Any ÷ Any\n    return true;\n}\nclass GraphemeBreakTree {\n    static { this._INSTANCE = null; }\n    static getInstance() {\n        if (!GraphemeBreakTree._INSTANCE) {\n            GraphemeBreakTree._INSTANCE = new GraphemeBreakTree();\n        }\n        return GraphemeBreakTree._INSTANCE;\n    }\n    constructor() {\n        this._data = getGraphemeBreakRawData();\n    }\n    getGraphemeBreakType(codePoint) {\n        // !!! Let's make 7bit ASCII a bit faster: 0..31\n        if (codePoint < 32) {\n            if (codePoint === 10 /* CharCode.LineFeed */) {\n                return 3 /* GraphemeBreakType.LF */;\n            }\n            if (codePoint === 13 /* CharCode.CarriageReturn */) {\n                return 2 /* GraphemeBreakType.CR */;\n            }\n            return 4 /* GraphemeBreakType.Control */;\n        }\n        // !!! Let's make 7bit ASCII a bit faster: 32..126\n        if (codePoint < 127) {\n            return 0 /* GraphemeBreakType.Other */;\n        }\n        const data = this._data;\n        const nodeCount = data.length / 3;\n        let nodeIndex = 1;\n        while (nodeIndex <= nodeCount) {\n            if (codePoint < data[3 * nodeIndex]) {\n                // go left\n                nodeIndex = 2 * nodeIndex;\n            }\n            else if (codePoint > data[3 * nodeIndex + 1]) {\n                // go right\n                nodeIndex = 2 * nodeIndex + 1;\n            }\n            else {\n                // hit\n                return data[3 * nodeIndex + 2];\n            }\n        }\n        return 0 /* GraphemeBreakType.Other */;\n    }\n}\nfunction getGraphemeBreakRawData() {\n    // generated using https://github.com/alexdima/unicode-utils/blob/main/grapheme-break.js\n    return 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//#endregion\n/**\n * Computes the offset after performing a left delete on the given string,\n * while considering unicode grapheme/emoji rules.\n*/\nfunction getLeftDeleteOffset(offset, str) {\n    if (offset === 0) {\n        return 0;\n    }\n    // Try to delete emoji part.\n    const emojiOffset = getOffsetBeforeLastEmojiComponent(offset, str);\n    if (emojiOffset !== undefined) {\n        return emojiOffset;\n    }\n    // Otherwise, just skip a single code point.\n    const iterator = new CodePointIterator(str, offset);\n    iterator.prevCodePoint();\n    return iterator.offset;\n}\nfunction getOffsetBeforeLastEmojiComponent(initialOffset, str) {\n    // See https://www.unicode.org/reports/tr51/tr51-14.html#EBNF_and_Regex for the\n    // structure of emojis.\n    const iterator = new CodePointIterator(str, initialOffset);\n    let codePoint = iterator.prevCodePoint();\n    // Skip modifiers\n    while ((isEmojiModifier(codePoint) || codePoint === 65039 /* CodePoint.emojiVariantSelector */ || codePoint === 8419 /* CodePoint.enclosingKeyCap */)) {\n        if (iterator.offset === 0) {\n            // Cannot skip modifier, no preceding emoji base.\n            return undefined;\n        }\n        codePoint = iterator.prevCodePoint();\n    }\n    // Expect base emoji\n    if (!isEmojiImprecise(codePoint)) {\n        // Unexpected code point, not a valid emoji.\n        return undefined;\n    }\n    let resultOffset = iterator.offset;\n    if (resultOffset > 0) {\n        // Skip optional ZWJ code points that combine multiple emojis.\n        // In theory, we should check if that ZWJ actually combines multiple emojis\n        // to prevent deleting ZWJs in situations we didn't account for.\n        const optionalZwjCodePoint = iterator.prevCodePoint();\n        if (optionalZwjCodePoint === 8205 /* CodePoint.zwj */) {\n            resultOffset = iterator.offset;\n        }\n    }\n    return resultOffset;\n}\nfunction isEmojiModifier(codePoint) {\n    return 0x1F3FB <= codePoint && codePoint <= 0x1F3FF;\n}\nconst noBreakWhitespace = '\\xa0';\nclass AmbiguousCharacters {\n    static { this.ambiguousCharacterData = new Lazy(() => {\n        // Generated using https://github.com/hediet/vscode-unicode-data\n        // Stored as key1, value1, key2, value2, ...\n        return JSON.parse('{\\\"_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,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,1523,96,8242,96,1370,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,118002,50,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,118003,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,118004,52,120786,52,120796,52,120806,52,120816,52,120826,52,130036,52,5070,52,71855,52,118005,53,120787,53,120797,53,120807,53,120817,53,120827,53,130037,53,444,53,71867,53,118006,54,120788,54,120798,54,120808,54,120818,54,120828,54,130038,54,11474,54,5102,54,71893,54,119314,55,118007,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,118008,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,118009,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,117974,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,117975,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,71913,67,71922,67,65315,67,8557,67,8450,67,8493,67,117976,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,117977,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,117978,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,117979,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,117980,71,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,117981,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,117983,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,117984,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,118001,108,120783,73,120793,73,120803,73,120813,73,120823,73,130033,73,65321,73,8544,73,8464,73,8465,73,117982,108,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,117985,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,117986,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,117987,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,118000,79,120782,79,120792,79,120802,79,120812,79,120822,79,130032,79,65327,79,117988,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,117989,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,117990,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,117991,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,117992,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,117993,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,117994,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,117995,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,71910,87,71919,87,117996,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,117997,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,117998,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,71909,90,66293,90,65338,90,8484,90,8488,90,117999,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,65283,35,65284,36,65285,37,65286,38,65290,42,65291,43,65294,46,65295,47,65296,48,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,8218,44,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,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"cs\\\":[65374,126,8218,44,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,1093,120,1061,88,1091,121,1059,89,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"de\\\":[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,1093,120,1061,88,1091,121,1059,89,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"es\\\":[8211,45,65374,126,8218,44,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,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"fr\\\":[65374,126,8218,44,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,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"it\\\":[160,32,8211,45,65374,126,8218,44,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,65292,44,65297,49,65307,59,65311,63],\\\"ja\\\":[8211,45,8218,44,65281,33,8216,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,65292,44,65297,49,65307,59],\\\"ko\\\":[8211,45,65374,126,8218,44,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,65292,44,65297,49,65307,59,65311,63],\\\"pl\\\":[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,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"pt-BR\\\":[65374,126,8218,44,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,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"qps-ploc\\\":[160,32,8211,45,65374,126,8218,44,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,1088,112,1056,80,1075,114,1058,84,215,120,1093,120,1061,88,1091,121,1059,89,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"ru\\\":[65374,126,8218,44,65306,58,65281,33,8216,96,8245,96,180,96,12494,47,305,105,921,73,1009,112,215,120,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"tr\\\":[160,32,8211,45,65374,126,8218,44,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,65288,40,65289,41,65292,44,65297,49,65307,59,65311,63],\\\"zh-hans\\\":[160,32,65374,126,8218,44,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,65297,49],\\\"zh-hant\\\":[8211,45,65374,126,8218,44,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]}');\n    }); }\n    static { this.cache = new LRUCachedFunction({ getCacheKey: JSON.stringify }, (locales) => {\n        function arrayToMap(arr) {\n            const result = new Map();\n            for (let i = 0; i < arr.length; i += 2) {\n                result.set(arr[i], arr[i + 1]);\n            }\n            return result;\n        }\n        function mergeMaps(map1, map2) {\n            const result = new Map(map1);\n            for (const [key, value] of map2) {\n                result.set(key, value);\n            }\n            return result;\n        }\n        function intersectMaps(map1, map2) {\n            if (!map1) {\n                return map2;\n            }\n            const result = new Map();\n            for (const [key, value] of map1) {\n                if (map2.has(key)) {\n                    result.set(key, value);\n                }\n            }\n            return result;\n        }\n        const data = this.ambiguousCharacterData.value;\n        let filteredLocales = locales.filter((l) => !l.startsWith('_') && Object.hasOwn(data, l));\n        if (filteredLocales.length === 0) {\n            filteredLocales = ['_default'];\n        }\n        let languageSpecificMap = undefined;\n        for (const locale of filteredLocales) {\n            const map = arrayToMap(data[locale]);\n            languageSpecificMap = intersectMaps(languageSpecificMap, map);\n        }\n        const commonMap = arrayToMap(data['_common']);\n        const map = mergeMaps(commonMap, languageSpecificMap);\n        return new AmbiguousCharacters(map);\n    }); }\n    static getInstance(locales) {\n        return AmbiguousCharacters.cache.get(Array.from(locales));\n    }\n    static { this._locales = new Lazy(() => Object.keys(AmbiguousCharacters.ambiguousCharacterData.value).filter((k) => !k.startsWith('_'))); }\n    static getLocales() {\n        return AmbiguousCharacters._locales.value;\n    }\n    constructor(confusableDictionary) {\n        this.confusableDictionary = confusableDictionary;\n    }\n    isAmbiguous(codePoint) {\n        return this.confusableDictionary.has(codePoint);\n    }\n    /**\n     * Returns the non basic ASCII code point that the given code point can be confused,\n     * or undefined if such code point does note exist.\n     */\n    getPrimaryConfusable(codePoint) {\n        return this.confusableDictionary.get(codePoint);\n    }\n    getConfusableCodePoints() {\n        return new Set(this.confusableDictionary.keys());\n    }\n}\nclass InvisibleCharacters {\n    static getRawData() {\n        // Generated using https://github.com/hediet/vscode-unicode-data\n        return JSON.parse('{\\\"_common\\\":[11,12,13,127,847,1564,4447,4448,6068,6069,6155,6156,6157,6158,7355,7356,8192,8193,8194,8195,8196,8197,8198,8199,8200,8201,8202,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,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],\\\"cs\\\":[173,8203,12288],\\\"de\\\":[173,8203,12288],\\\"es\\\":[8203,12288],\\\"fr\\\":[173,8203,12288],\\\"it\\\":[160,173,12288],\\\"ja\\\":[173],\\\"ko\\\":[173,12288],\\\"pl\\\":[173,8203,12288],\\\"pt-BR\\\":[173,8203,12288],\\\"qps-ploc\\\":[160,173,8203,12288],\\\"ru\\\":[173,12288],\\\"tr\\\":[160,173,8203,12288],\\\"zh-hans\\\":[160,173,8203,12288],\\\"zh-hant\\\":[173,12288]}');\n    }\n    static { this._data = undefined; }\n    static getData() {\n        if (!this._data) {\n            this._data = new Set([...Object.values(InvisibleCharacters.getRawData())].flat());\n        }\n        return this._data;\n    }\n    static isInvisibleCharacter(codePoint) {\n        return InvisibleCharacters.getData().has(codePoint);\n    }\n    static get codePoints() {\n        return InvisibleCharacters.getData();\n    }\n}\n\nexport { AmbiguousCharacters, CodePointIterator, GraphemeIterator, InvisibleCharacters, UNUSUAL_LINE_TERMINATORS, UTF8_BOM_CHARACTER, commonPrefixLength, commonSuffixLength, compare, compareIgnoreCase, compareSubstring, compareSubstringIgnoreCase, computeCodePoint, containsRTL, containsUnusualLineTerminators, containsUppercaseCharacter, convertSimple2RegExpPattern, createRegExp, endsWithIgnoreCase, equalsIgnoreCase, escape, escapeRegExpCharacters, firstNonWhitespaceIndex, format, getCharContainingOffset, getLeadingWhitespace, getLeftDeleteOffset, getNextCodePoint, htmlAttributeEncodeValue, isAsciiDigit, isBasicASCII, isEmojiImprecise, isFalsyOrWhitespace, isFullWidthCharacter, isHighSurrogate, isLowSurrogate, isLowerAsciiLetter, isUpperAsciiLetter, lastNonWhitespaceIndex, ltrim, nextCharLength, noBreakWhitespace, prevCharLength, regExpLeadsToEndlessLoop, rtrim, singleLetterHash, splitLines, startsWithIgnoreCase, startsWithUTF8BOM, trim };\n","import { onUnexpectedError, transformErrorForSerialization } from '../errors.js';\nimport { Emitter } from '../event.js';\nimport { Disposable } from '../lifecycle.js';\nimport { isWeb } from '../platform.js';\nimport { isUpperAsciiLetter } from '../strings.js';\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 *--------------------------------------------------------------------------------------------*/\nconst DEFAULT_CHANNEL = 'default';\nconst INITIALIZE = '$initialize';\nlet webWorkerWarningLogged = false;\nfunction logOnceWebWorkerWarning(err) {\n    if (!isWeb) {\n        // running tests\n        return;\n    }\n    if (!webWorkerWarningLogged) {\n        webWorkerWarningLogged = true;\n        console.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    }\n    console.warn(err.message);\n}\nclass RequestMessage {\n    constructor(vsWorker, req, channel, method, args) {\n        this.vsWorker = vsWorker;\n        this.req = req;\n        this.channel = channel;\n        this.method = method;\n        this.args = args;\n        this.type = 0 /* MessageType.Request */;\n    }\n}\nclass ReplyMessage {\n    constructor(vsWorker, seq, res, err) {\n        this.vsWorker = vsWorker;\n        this.seq = seq;\n        this.res = res;\n        this.err = err;\n        this.type = 1 /* MessageType.Reply */;\n    }\n}\nclass SubscribeEventMessage {\n    constructor(vsWorker, req, channel, eventName, arg) {\n        this.vsWorker = vsWorker;\n        this.req = req;\n        this.channel = channel;\n        this.eventName = eventName;\n        this.arg = arg;\n        this.type = 2 /* MessageType.SubscribeEvent */;\n    }\n}\nclass EventMessage {\n    constructor(vsWorker, req, event) {\n        this.vsWorker = vsWorker;\n        this.req = req;\n        this.event = event;\n        this.type = 3 /* MessageType.Event */;\n    }\n}\nclass UnsubscribeEventMessage {\n    constructor(vsWorker, req) {\n        this.vsWorker = vsWorker;\n        this.req = req;\n        this.type = 4 /* MessageType.UnsubscribeEvent */;\n    }\n}\nclass WebWorkerProtocol {\n    constructor(handler) {\n        this._workerId = -1;\n        this._handler = handler;\n        this._lastSentReq = 0;\n        this._pendingReplies = Object.create(null);\n        this._pendingEmitters = new Map();\n        this._pendingEvents = new Map();\n    }\n    setWorkerId(workerId) {\n        this._workerId = workerId;\n    }\n    async sendMessage(channel, method, args) {\n        const req = String(++this._lastSentReq);\n        return new Promise((resolve, reject) => {\n            this._pendingReplies[req] = {\n                resolve: resolve,\n                reject: reject\n            };\n            this._send(new RequestMessage(this._workerId, req, channel, method, args));\n        });\n    }\n    listen(channel, eventName, arg) {\n        let req = null;\n        const emitter = new Emitter({\n            onWillAddFirstListener: () => {\n                req = String(++this._lastSentReq);\n                this._pendingEmitters.set(req, emitter);\n                this._send(new SubscribeEventMessage(this._workerId, req, channel, eventName, arg));\n            },\n            onDidRemoveLastListener: () => {\n                this._pendingEmitters.delete(req);\n                this._send(new UnsubscribeEventMessage(this._workerId, req));\n                req = null;\n            }\n        });\n        return emitter.event;\n    }\n    handleMessage(message) {\n        if (!message || !message.vsWorker) {\n            return;\n        }\n        if (this._workerId !== -1 && message.vsWorker !== this._workerId) {\n            return;\n        }\n        this._handleMessage(message);\n    }\n    createProxyToRemoteChannel(channel, sendMessageBarrier) {\n        const handler = {\n            get: (target, name) => {\n                if (typeof name === 'string' && !target[name]) {\n                    if (propertyIsDynamicEvent(name)) { // onDynamic...\n                        target[name] = (arg) => {\n                            return this.listen(channel, name, arg);\n                        };\n                    }\n                    else if (propertyIsEvent(name)) { // on...\n                        target[name] = this.listen(channel, name, undefined);\n                    }\n                    else if (name.charCodeAt(0) === 36 /* CharCode.DollarSign */) { // $...\n                        target[name] = async (...myArgs) => {\n                            await sendMessageBarrier?.();\n                            return this.sendMessage(channel, name, myArgs);\n                        };\n                    }\n                }\n                return target[name];\n            }\n        };\n        return new Proxy(Object.create(null), handler);\n    }\n    _handleMessage(msg) {\n        switch (msg.type) {\n            case 1 /* MessageType.Reply */:\n                return this._handleReplyMessage(msg);\n            case 0 /* MessageType.Request */:\n                return this._handleRequestMessage(msg);\n            case 2 /* MessageType.SubscribeEvent */:\n                return this._handleSubscribeEventMessage(msg);\n            case 3 /* MessageType.Event */:\n                return this._handleEventMessage(msg);\n            case 4 /* MessageType.UnsubscribeEvent */:\n                return this._handleUnsubscribeEventMessage(msg);\n        }\n    }\n    _handleReplyMessage(replyMessage) {\n        if (!this._pendingReplies[replyMessage.seq]) {\n            console.warn('Got reply to unknown seq');\n            return;\n        }\n        const reply = this._pendingReplies[replyMessage.seq];\n        delete this._pendingReplies[replyMessage.seq];\n        if (replyMessage.err) {\n            let err = replyMessage.err;\n            if (replyMessage.err.$isError) {\n                const newErr = new Error();\n                newErr.name = replyMessage.err.name;\n                newErr.message = replyMessage.err.message;\n                newErr.stack = replyMessage.err.stack;\n                err = newErr;\n            }\n            reply.reject(err);\n            return;\n        }\n        reply.resolve(replyMessage.res);\n    }\n    _handleRequestMessage(requestMessage) {\n        const req = requestMessage.req;\n        const result = this._handler.handleMessage(requestMessage.channel, requestMessage.method, requestMessage.args);\n        result.then((r) => {\n            this._send(new ReplyMessage(this._workerId, req, r, undefined));\n        }, (e) => {\n            if (e.detail instanceof Error) {\n                // Loading errors have a detail property that points to the actual error\n                e.detail = transformErrorForSerialization(e.detail);\n            }\n            this._send(new ReplyMessage(this._workerId, req, undefined, transformErrorForSerialization(e)));\n        });\n    }\n    _handleSubscribeEventMessage(msg) {\n        const req = msg.req;\n        const disposable = this._handler.handleEvent(msg.channel, msg.eventName, msg.arg)((event) => {\n            this._send(new EventMessage(this._workerId, req, event));\n        });\n        this._pendingEvents.set(req, disposable);\n    }\n    _handleEventMessage(msg) {\n        if (!this._pendingEmitters.has(msg.req)) {\n            console.warn('Got event for unknown req');\n            return;\n        }\n        this._pendingEmitters.get(msg.req).fire(msg.event);\n    }\n    _handleUnsubscribeEventMessage(msg) {\n        if (!this._pendingEvents.has(msg.req)) {\n            console.warn('Got unsubscribe for unknown req');\n            return;\n        }\n        this._pendingEvents.get(msg.req).dispose();\n        this._pendingEvents.delete(msg.req);\n    }\n    _send(msg) {\n        const transfer = [];\n        if (msg.type === 0 /* MessageType.Request */) {\n            for (let i = 0; i < msg.args.length; i++) {\n                const arg = msg.args[i];\n                if (arg instanceof ArrayBuffer) {\n                    transfer.push(arg);\n                }\n            }\n        }\n        else if (msg.type === 1 /* MessageType.Reply */) {\n            if (msg.res instanceof ArrayBuffer) {\n                transfer.push(msg.res);\n            }\n        }\n        this._handler.sendMessage(msg, transfer);\n    }\n}\n/**\n * Main thread side\n */\nclass WebWorkerClient extends Disposable {\n    constructor(worker) {\n        super();\n        this._localChannels = new Map();\n        this._worker = this._register(worker);\n        this._register(this._worker.onMessage((msg) => {\n            this._protocol.handleMessage(msg);\n        }));\n        this._register(this._worker.onError((err) => {\n            logOnceWebWorkerWarning(err);\n            onUnexpectedError(err);\n        }));\n        this._protocol = new WebWorkerProtocol({\n            sendMessage: (msg, transfer) => {\n                this._worker.postMessage(msg, transfer);\n            },\n            handleMessage: (channel, method, args) => {\n                return this._handleMessage(channel, method, args);\n            },\n            handleEvent: (channel, eventName, arg) => {\n                return this._handleEvent(channel, eventName, arg);\n            }\n        });\n        this._protocol.setWorkerId(this._worker.getId());\n        // Send initialize message\n        this._onModuleLoaded = this._protocol.sendMessage(DEFAULT_CHANNEL, INITIALIZE, [\n            this._worker.getId(),\n        ]).then(() => { });\n        this.proxy = this._protocol.createProxyToRemoteChannel(DEFAULT_CHANNEL, async () => { await this._onModuleLoaded; });\n        this._onModuleLoaded.catch((e) => {\n            this._onError('Worker failed to load ', e);\n        });\n    }\n    _handleMessage(channelName, method, args) {\n        const channel = this._localChannels.get(channelName);\n        if (!channel) {\n            return Promise.reject(new Error(`Missing channel ${channelName} on main thread`));\n        }\n        const fn = channel[method];\n        if (typeof fn !== 'function') {\n            return Promise.reject(new Error(`Missing method ${method} on main thread channel ${channelName}`));\n        }\n        try {\n            return Promise.resolve(fn.apply(channel, args));\n        }\n        catch (e) {\n            return Promise.reject(e);\n        }\n    }\n    _handleEvent(channelName, eventName, arg) {\n        const channel = this._localChannels.get(channelName);\n        if (!channel) {\n            throw new Error(`Missing channel ${channelName} on main thread`);\n        }\n        if (propertyIsDynamicEvent(eventName)) {\n            const fn = channel[eventName];\n            if (typeof fn !== 'function') {\n                throw new Error(`Missing dynamic event ${eventName} on main thread channel ${channelName}.`);\n            }\n            const event = fn.call(channel, arg);\n            if (typeof event !== 'function') {\n                throw new Error(`Missing dynamic event ${eventName} on main thread channel ${channelName}.`);\n            }\n            return event;\n        }\n        if (propertyIsEvent(eventName)) {\n            const event = channel[eventName];\n            if (typeof event !== 'function') {\n                throw new Error(`Missing event ${eventName} on main thread channel ${channelName}.`);\n            }\n            return event;\n        }\n        throw new Error(`Malformed event name ${eventName}`);\n    }\n    setChannel(channel, handler) {\n        this._localChannels.set(channel, handler);\n    }\n    _onError(message, error) {\n        console.error(message);\n        console.info(error);\n    }\n}\nfunction propertyIsEvent(name) {\n    // Assume a property is an event if it has a form of \"onSomething\"\n    return name[0] === 'o' && name[1] === 'n' && isUpperAsciiLetter(name.charCodeAt(2));\n}\nfunction propertyIsDynamicEvent(name) {\n    // Assume a property is a dynamic event (a method that returns an event) if it has a form of \"onDynamicSomething\"\n    return /^onDynamic/.test(name) && isUpperAsciiLetter(name.charCodeAt(9));\n}\n/**\n * Worker side\n */\nclass WebWorkerServer {\n    constructor(postMessage, requestHandlerFactory) {\n        this._localChannels = new Map();\n        this._remoteChannels = new Map();\n        this._protocol = new WebWorkerProtocol({\n            sendMessage: (msg, transfer) => {\n                postMessage(msg, transfer);\n            },\n            handleMessage: (channel, method, args) => this._handleMessage(channel, method, args),\n            handleEvent: (channel, eventName, arg) => this._handleEvent(channel, eventName, arg)\n        });\n        this.requestHandler = requestHandlerFactory(this);\n    }\n    onmessage(msg) {\n        this._protocol.handleMessage(msg);\n    }\n    _handleMessage(channel, method, args) {\n        if (channel === DEFAULT_CHANNEL && method === INITIALIZE) {\n            return this.initialize(args[0]);\n        }\n        const requestHandler = (channel === DEFAULT_CHANNEL ? this.requestHandler : this._localChannels.get(channel));\n        if (!requestHandler) {\n            return Promise.reject(new Error(`Missing channel ${channel} on worker thread`));\n        }\n        const fn = requestHandler[method];\n        if (typeof fn !== 'function') {\n            return Promise.reject(new Error(`Missing method ${method} on worker thread channel ${channel}`));\n        }\n        try {\n            return Promise.resolve(fn.apply(requestHandler, args));\n        }\n        catch (e) {\n            return Promise.reject(e);\n        }\n    }\n    _handleEvent(channel, eventName, arg) {\n        const requestHandler = (channel === DEFAULT_CHANNEL ? this.requestHandler : this._localChannels.get(channel));\n        if (!requestHandler) {\n            throw new Error(`Missing channel ${channel} on worker thread`);\n        }\n        if (propertyIsDynamicEvent(eventName)) {\n            const fn = requestHandler[eventName];\n            if (typeof fn !== 'function') {\n                throw new Error(`Missing dynamic event ${eventName} on request handler.`);\n            }\n            const event = fn.call(requestHandler, arg);\n            if (typeof event !== 'function') {\n                throw new Error(`Missing dynamic event ${eventName} on request handler.`);\n            }\n            return event;\n        }\n        if (propertyIsEvent(eventName)) {\n            const event = requestHandler[eventName];\n            if (typeof event !== 'function') {\n                throw new Error(`Missing event ${eventName} on request handler.`);\n            }\n            return event;\n        }\n        throw new Error(`Malformed event name ${eventName}`);\n    }\n    getChannel(channel) {\n        if (!this._remoteChannels.has(channel)) {\n            const inst = this._protocol.createProxyToRemoteChannel(channel);\n            this._remoteChannels.set(channel, inst);\n        }\n        return this._remoteChannels.get(channel);\n    }\n    async initialize(workerId) {\n        this._protocol.setWorkerId(workerId);\n    }\n}\n\nexport { WebWorkerClient, WebWorkerServer, logOnceWebWorkerWarning };\n","import { WebWorkerServer } from './webWorker.js';\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 *--------------------------------------------------------------------------------------------*/\nlet initialized = false;\nfunction initialize(factory) {\n    if (initialized) {\n        throw new Error('WebWorker already initialized!');\n    }\n    initialized = true;\n    const webWorkerServer = new WebWorkerServer(msg => globalThis.postMessage(msg), (workerServer) => factory(workerServer));\n    globalThis.onmessage = (e) => {\n        webWorkerServer.onmessage(e.data);\n    };\n    return webWorkerServer;\n}\n\nexport { initialize };\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 * Represents information about a specific difference between two sequences.\n */\nclass DiffChange {\n    /**\n     * Constructs a new DiffChange with the given sequence information\n     * and content.\n     */\n    constructor(originalStart, originalLength, modifiedStart, modifiedLength) {\n        //Debug.Assert(originalLength > 0 || modifiedLength > 0, \"originalLength and modifiedLength cannot both be <= 0\");\n        this.originalStart = originalStart;\n        this.originalLength = originalLength;\n        this.modifiedStart = modifiedStart;\n        this.modifiedLength = modifiedLength;\n    }\n    /**\n     * The end point (exclusive) of the change in the original sequence.\n     */\n    getOriginalEnd() {\n        return this.originalStart + this.originalLength;\n    }\n    /**\n     * The end point (exclusive) of the change in the modified sequence.\n     */\n    getModifiedEnd() {\n        return this.modifiedStart + this.modifiedLength;\n    }\n}\n\nexport { DiffChange };\n","import { Lazy } from './lazy.js';\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 *--------------------------------------------------------------------------------------------*/\nconst hasBuffer = (typeof Buffer !== 'undefined');\nnew Lazy(() => new Uint8Array(256));\nlet textDecoder;\nclass VSBuffer {\n    /**\n     * When running in a nodejs context, if `actual` is not a nodejs Buffer, the backing store for\n     * the returned `VSBuffer` instance might use a nodejs Buffer allocated from node's Buffer pool,\n     * which is not transferrable.\n     */\n    static wrap(actual) {\n        if (hasBuffer && !(Buffer.isBuffer(actual))) {\n            // https://nodejs.org/dist/latest-v10.x/docs/api/buffer.html#buffer_class_method_buffer_from_arraybuffer_byteoffset_length\n            // Create a zero-copy Buffer wrapper around the ArrayBuffer pointed to by the Uint8Array\n            actual = Buffer.from(actual.buffer, actual.byteOffset, actual.byteLength);\n        }\n        return new VSBuffer(actual);\n    }\n    constructor(buffer) {\n        this.buffer = buffer;\n        this.byteLength = this.buffer.byteLength;\n    }\n    toString() {\n        if (hasBuffer) {\n            return this.buffer.toString();\n        }\n        else {\n            if (!textDecoder) {\n                textDecoder = new TextDecoder();\n            }\n            return textDecoder.decode(this.buffer);\n        }\n    }\n}\nfunction readUInt16LE(source, offset) {\n    return (((source[offset + 0] << 0) >>> 0) |\n        ((source[offset + 1] << 8) >>> 0));\n}\nfunction writeUInt16LE(destination, value, offset) {\n    destination[offset + 0] = (value & 0b11111111);\n    value = value >>> 8;\n    destination[offset + 1] = (value & 0b11111111);\n}\nfunction readUInt32BE(source, offset) {\n    return (source[offset] * 2 ** 24\n        + source[offset + 1] * 2 ** 16\n        + source[offset + 2] * 2 ** 8\n        + source[offset + 3]);\n}\nfunction writeUInt32BE(destination, value, offset) {\n    destination[offset + 3] = value;\n    value = value >>> 8;\n    destination[offset + 2] = value;\n    value = value >>> 8;\n    destination[offset + 1] = value;\n    value = value >>> 8;\n    destination[offset] = value;\n}\nfunction readUInt8(source, offset) {\n    return source[offset];\n}\nfunction writeUInt8(destination, value, offset) {\n    destination[offset] = value;\n}\nconst hexChars = '0123456789abcdef';\nfunction encodeHex({ buffer }) {\n    let result = '';\n    for (let i = 0; i < buffer.length; i++) {\n        const byte = buffer[i];\n        result += hexChars[byte >>> 4];\n        result += hexChars[byte & 0x0f];\n    }\n    return result;\n}\n\nexport { VSBuffer, encodeHex, readUInt16LE, readUInt32BE, readUInt8, writeUInt16LE, writeUInt32BE, writeUInt8 };\n","import { encodeHex, VSBuffer } from './buffer.js';\nimport { isHighSurrogate, isLowSurrogate, computeCodePoint } from './strings.js';\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 * Return a hash value for an object.\n *\n * Note that this should not be used for binary data types. Instead,\n * prefer {@link hashAsync}.\n */\nfunction hash(obj) {\n    return doHash(obj, 0);\n}\nfunction doHash(obj, hashVal) {\n    switch (typeof obj) {\n        case 'object':\n            if (obj === null) {\n                return numberHash(349, hashVal);\n            }\n            else if (Array.isArray(obj)) {\n                return arrayHash(obj, hashVal);\n            }\n            return objectHash(obj, hashVal);\n        case 'string':\n            return stringHash(obj, hashVal);\n        case 'boolean':\n            return booleanHash(obj, hashVal);\n        case 'number':\n            return numberHash(obj, hashVal);\n        case 'undefined':\n            return numberHash(937, hashVal);\n        default:\n            return numberHash(617, hashVal);\n    }\n}\nfunction numberHash(val, initialHashVal) {\n    return (((initialHashVal << 5) - initialHashVal) + val) | 0; // hashVal * 31 + ch, keep as int32\n}\nfunction booleanHash(b, initialHashVal) {\n    return numberHash(b ? 433 : 863, initialHashVal);\n}\nfunction stringHash(s, hashVal) {\n    hashVal = numberHash(149417, hashVal);\n    for (let i = 0, length = s.length; i < length; i++) {\n        hashVal = numberHash(s.charCodeAt(i), hashVal);\n    }\n    return hashVal;\n}\nfunction arrayHash(arr, initialHashVal) {\n    initialHashVal = numberHash(104579, initialHashVal);\n    return arr.reduce((hashVal, item) => doHash(item, hashVal), initialHashVal);\n}\nfunction objectHash(obj, initialHashVal) {\n    initialHashVal = numberHash(181387, initialHashVal);\n    return Object.keys(obj).sort().reduce((hashVal, key) => {\n        hashVal = stringHash(key, hashVal);\n        return doHash(obj[key], hashVal);\n    }, initialHashVal);\n}\nfunction leftRotate(value, bits, totalBits = 32) {\n    // delta + bits = totalBits\n    const delta = totalBits - bits;\n    // All ones, expect `delta` zeros aligned to the right\n    const mask = ~((1 << delta) - 1);\n    // Join (value left-shifted `bits` bits) with (masked value right-shifted `delta` bits)\n    return ((value << bits) | ((mask & value) >>> delta)) >>> 0;\n}\nfunction toHexString(bufferOrValue, bitsize = 32) {\n    if (bufferOrValue instanceof ArrayBuffer) {\n        return encodeHex(VSBuffer.wrap(new Uint8Array(bufferOrValue)));\n    }\n    return (bufferOrValue >>> 0).toString(16).padStart(bitsize / 4, '0');\n}\n/**\n * A SHA1 implementation that works with strings and does not allocate.\n *\n * Prefer to use {@link hashAsync} in async contexts\n */\nclass StringSHA1 {\n    static { this._bigBlock32 = new DataView(new ArrayBuffer(320)); } // 80 * 4 = 320\n    constructor() {\n        this._h0 = 0x67452301;\n        this._h1 = 0xEFCDAB89;\n        this._h2 = 0x98BADCFE;\n        this._h3 = 0x10325476;\n        this._h4 = 0xC3D2E1F0;\n        this._buff = new Uint8Array(64 /* SHA1Constant.BLOCK_SIZE */ + 3 /* to fit any utf-8 */);\n        this._buffDV = new DataView(this._buff.buffer);\n        this._buffLen = 0;\n        this._totalLen = 0;\n        this._leftoverHighSurrogate = 0;\n        this._finished = false;\n    }\n    update(str) {\n        const strLen = str.length;\n        if (strLen === 0) {\n            return;\n        }\n        const buff = this._buff;\n        let buffLen = this._buffLen;\n        let leftoverHighSurrogate = this._leftoverHighSurrogate;\n        let charCode;\n        let offset;\n        if (leftoverHighSurrogate !== 0) {\n            charCode = leftoverHighSurrogate;\n            offset = -1;\n            leftoverHighSurrogate = 0;\n        }\n        else {\n            charCode = str.charCodeAt(0);\n            offset = 0;\n        }\n        while (true) {\n            let codePoint = charCode;\n            if (isHighSurrogate(charCode)) {\n                if (offset + 1 < strLen) {\n                    const nextCharCode = str.charCodeAt(offset + 1);\n                    if (isLowSurrogate(nextCharCode)) {\n                        offset++;\n                        codePoint = computeCodePoint(charCode, nextCharCode);\n                    }\n                    else {\n                        // illegal => unicode replacement character\n                        codePoint = 65533 /* SHA1Constant.UNICODE_REPLACEMENT */;\n                    }\n                }\n                else {\n                    // last character is a surrogate pair\n                    leftoverHighSurrogate = charCode;\n                    break;\n                }\n            }\n            else if (isLowSurrogate(charCode)) {\n                // illegal => unicode replacement character\n                codePoint = 65533 /* SHA1Constant.UNICODE_REPLACEMENT */;\n            }\n            buffLen = this._push(buff, buffLen, codePoint);\n            offset++;\n            if (offset < strLen) {\n                charCode = str.charCodeAt(offset);\n            }\n            else {\n                break;\n            }\n        }\n        this._buffLen = buffLen;\n        this._leftoverHighSurrogate = leftoverHighSurrogate;\n    }\n    _push(buff, buffLen, codePoint) {\n        if (codePoint < 0x0080) {\n            buff[buffLen++] = codePoint;\n        }\n        else if (codePoint < 0x0800) {\n            buff[buffLen++] = 0b11000000 | ((codePoint & 0b00000000000000000000011111000000) >>> 6);\n            buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n        }\n        else if (codePoint < 0x10000) {\n            buff[buffLen++] = 0b11100000 | ((codePoint & 0b00000000000000001111000000000000) >>> 12);\n            buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);\n            buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n        }\n        else {\n            buff[buffLen++] = 0b11110000 | ((codePoint & 0b00000000000111000000000000000000) >>> 18);\n            buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000111111000000000000) >>> 12);\n            buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);\n            buff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\n        }\n        if (buffLen >= 64 /* SHA1Constant.BLOCK_SIZE */) {\n            this._step();\n            buffLen -= 64 /* SHA1Constant.BLOCK_SIZE */;\n            this._totalLen += 64 /* SHA1Constant.BLOCK_SIZE */;\n            // take last 3 in case of UTF8 overflow\n            buff[0] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 0];\n            buff[1] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 1];\n            buff[2] = buff[64 /* SHA1Constant.BLOCK_SIZE */ + 2];\n        }\n        return buffLen;\n    }\n    digest() {\n        if (!this._finished) {\n            this._finished = true;\n            if (this._leftoverHighSurrogate) {\n                // illegal => unicode replacement character\n                this._leftoverHighSurrogate = 0;\n                this._buffLen = this._push(this._buff, this._buffLen, 65533 /* SHA1Constant.UNICODE_REPLACEMENT */);\n            }\n            this._totalLen += this._buffLen;\n            this._wrapUp();\n        }\n        return toHexString(this._h0) + toHexString(this._h1) + toHexString(this._h2) + toHexString(this._h3) + toHexString(this._h4);\n    }\n    _wrapUp() {\n        this._buff[this._buffLen++] = 0x80;\n        this._buff.subarray(this._buffLen).fill(0);\n        if (this._buffLen > 56) {\n            this._step();\n            this._buff.fill(0);\n        }\n        // this will fit because the mantissa can cover up to 52 bits\n        const ml = 8 * this._totalLen;\n        this._buffDV.setUint32(56, Math.floor(ml / 4294967296), false);\n        this._buffDV.setUint32(60, ml % 4294967296, false);\n        this._step();\n    }\n    _step() {\n        const bigBlock32 = StringSHA1._bigBlock32;\n        const data = this._buffDV;\n        for (let j = 0; j < 64 /* 16*4 */; j += 4) {\n            bigBlock32.setUint32(j, data.getUint32(j, false), false);\n        }\n        for (let j = 64; j < 320 /* 80*4 */; j += 4) {\n            bigBlock32.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        }\n        let a = this._h0;\n        let b = this._h1;\n        let c = this._h2;\n        let d = this._h3;\n        let e = this._h4;\n        let f, k;\n        let temp;\n        for (let j = 0; j < 80; j++) {\n            if (j < 20) {\n                f = (b & c) | ((~b) & d);\n                k = 0x5A827999;\n            }\n            else if (j < 40) {\n                f = b ^ c ^ d;\n                k = 0x6ED9EBA1;\n            }\n            else if (j < 60) {\n                f = (b & c) | (b & d) | (c & d);\n                k = 0x8F1BBCDC;\n            }\n            else {\n                f = b ^ c ^ d;\n                k = 0xCA62C1D6;\n            }\n            temp = (leftRotate(a, 5) + f + e + k + bigBlock32.getUint32(j * 4, false)) & 0xffffffff;\n            e = d;\n            d = c;\n            c = leftRotate(b, 30);\n            b = a;\n            a = temp;\n        }\n        this._h0 = (this._h0 + a) & 0xffffffff;\n        this._h1 = (this._h1 + b) & 0xffffffff;\n        this._h2 = (this._h2 + c) & 0xffffffff;\n        this._h3 = (this._h3 + d) & 0xffffffff;\n        this._h4 = (this._h4 + e) & 0xffffffff;\n    }\n}\n\nexport { StringSHA1, doHash, hash, numberHash, stringHash };\n","import { DiffChange } from './diffChange.js';\nimport { stringHash } from '../hash.js';\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 *--------------------------------------------------------------------------------------------*/\nclass StringDiffSequence {\n    constructor(source) {\n        this.source = source;\n    }\n    getElements() {\n        const source = this.source;\n        const characters = new Int32Array(source.length);\n        for (let i = 0, len = source.length; i < len; i++) {\n            characters[i] = source.charCodeAt(i);\n        }\n        return characters;\n    }\n}\nfunction stringDiff(original, modified, pretty) {\n    return new LcsDiff(new StringDiffSequence(original), new StringDiffSequence(modified)).ComputeDiff(pretty).changes;\n}\n//\n// The code below has been ported from a C# implementation in VS\n//\nclass Debug {\n    static Assert(condition, message) {\n        if (!condition) {\n            throw new Error(message);\n        }\n    }\n}\nclass MyArray {\n    /**\n     * Copies a range of elements from an Array starting at the specified source index and pastes\n     * them to another Array starting at the specified destination index. The length and the indexes\n     * are specified as 64-bit integers.\n     * sourceArray:\n     *\t\tThe Array that contains the data to copy.\n     * sourceIndex:\n     *\t\tA 64-bit integer that represents the index in the sourceArray at which copying begins.\n     * destinationArray:\n     *\t\tThe Array that receives the data.\n     * destinationIndex:\n     *\t\tA 64-bit integer that represents the index in the destinationArray at which storing begins.\n     * length:\n     *\t\tA 64-bit integer that represents the number of elements to copy.\n     */\n    static Copy(sourceArray, sourceIndex, destinationArray, destinationIndex, length) {\n        for (let i = 0; i < length; i++) {\n            destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];\n        }\n    }\n    static Copy2(sourceArray, sourceIndex, destinationArray, destinationIndex, length) {\n        for (let i = 0; i < length; i++) {\n            destinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];\n        }\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     * Constructs a new DiffChangeHelper for the given DiffSequences.\n     */\n    constructor() {\n        this.m_changes = [];\n        this.m_originalStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n        this.m_modifiedStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n        this.m_originalCount = 0;\n        this.m_modifiedCount = 0;\n    }\n    /**\n     * Marks the beginning of the next change in the set of differences.\n     */\n    MarkNextChange() {\n        // Only add to the list if there is something to add\n        if (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n            // Add the new change to our list\n            this.m_changes.push(new DiffChange(this.m_originalStart, this.m_originalCount, this.m_modifiedStart, this.m_modifiedCount));\n        }\n        // Reset for the next change\n        this.m_originalCount = 0;\n        this.m_modifiedCount = 0;\n        this.m_originalStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n        this.m_modifiedStart = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n    }\n    /**\n     * Adds the original element at the given position to the elements\n     * affected by the current change. The modified index gives context\n     * to the change position with respect to the original sequence.\n     * @param originalIndex The index of the original element to add.\n     * @param modifiedIndex The index of the modified element that provides corresponding position in the modified sequence.\n     */\n    AddOriginalElement(originalIndex, modifiedIndex) {\n        // The 'true' start index is the smallest of the ones we've seen\n        this.m_originalStart = Math.min(this.m_originalStart, originalIndex);\n        this.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex);\n        this.m_originalCount++;\n    }\n    /**\n     * Adds the modified element at the given position to the elements\n     * affected by the current change. The original index gives context\n     * to the change position with respect to the modified sequence.\n     * @param originalIndex The index of the original element that provides corresponding position in the original sequence.\n     * @param modifiedIndex The index of the modified element to add.\n     */\n    AddModifiedElement(originalIndex, modifiedIndex) {\n        // The 'true' start index is the smallest of the ones we've seen\n        this.m_originalStart = Math.min(this.m_originalStart, originalIndex);\n        this.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex);\n        this.m_modifiedCount++;\n    }\n    /**\n     * Retrieves all of the changes marked by the class.\n     */\n    getChanges() {\n        if (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n            // Finish up on whatever is left\n            this.MarkNextChange();\n        }\n        return this.m_changes;\n    }\n    /**\n     * Retrieves all of the changes marked by the class in the reverse order\n     */\n    getReverseChanges() {\n        if (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\n            // Finish up on whatever is left\n            this.MarkNextChange();\n        }\n        this.m_changes.reverse();\n        return this.m_changes;\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 */\nclass LcsDiff {\n    /**\n     * Constructs the DiffFinder\n     */\n    constructor(originalSequence, modifiedSequence, continueProcessingPredicate = null) {\n        this.ContinueProcessingPredicate = continueProcessingPredicate;\n        this._originalSequence = originalSequence;\n        this._modifiedSequence = modifiedSequence;\n        const [originalStringElements, originalElementsOrHash, originalHasStrings] = LcsDiff._getElements(originalSequence);\n        const [modifiedStringElements, modifiedElementsOrHash, modifiedHasStrings] = LcsDiff._getElements(modifiedSequence);\n        this._hasStrings = (originalHasStrings && modifiedHasStrings);\n        this._originalStringElements = originalStringElements;\n        this._originalElementsOrHash = originalElementsOrHash;\n        this._modifiedStringElements = modifiedStringElements;\n        this._modifiedElementsOrHash = modifiedElementsOrHash;\n        this.m_forwardHistory = [];\n        this.m_reverseHistory = [];\n    }\n    static _isStringArray(arr) {\n        return (arr.length > 0 && typeof arr[0] === 'string');\n    }\n    static _getElements(sequence) {\n        const elements = sequence.getElements();\n        if (LcsDiff._isStringArray(elements)) {\n            const hashes = new Int32Array(elements.length);\n            for (let i = 0, len = elements.length; i < len; i++) {\n                hashes[i] = stringHash(elements[i], 0);\n            }\n            return [elements, hashes, true];\n        }\n        if (elements instanceof Int32Array) {\n            return [[], elements, false];\n        }\n        return [[], new Int32Array(elements), false];\n    }\n    ElementsAreEqual(originalIndex, newIndex) {\n        if (this._originalElementsOrHash[originalIndex] !== this._modifiedElementsOrHash[newIndex]) {\n            return false;\n        }\n        return (this._hasStrings ? this._originalStringElements[originalIndex] === this._modifiedStringElements[newIndex] : true);\n    }\n    ElementsAreStrictEqual(originalIndex, newIndex) {\n        if (!this.ElementsAreEqual(originalIndex, newIndex)) {\n            return false;\n        }\n        const originalElement = LcsDiff._getStrictElement(this._originalSequence, originalIndex);\n        const modifiedElement = LcsDiff._getStrictElement(this._modifiedSequence, newIndex);\n        return (originalElement === modifiedElement);\n    }\n    static _getStrictElement(sequence, index) {\n        if (typeof sequence.getStrictElement === 'function') {\n            return sequence.getStrictElement(index);\n        }\n        return null;\n    }\n    OriginalElementsAreEqual(index1, index2) {\n        if (this._originalElementsOrHash[index1] !== this._originalElementsOrHash[index2]) {\n            return false;\n        }\n        return (this._hasStrings ? this._originalStringElements[index1] === this._originalStringElements[index2] : true);\n    }\n    ModifiedElementsAreEqual(index1, index2) {\n        if (this._modifiedElementsOrHash[index1] !== this._modifiedElementsOrHash[index2]) {\n            return false;\n        }\n        return (this._hasStrings ? this._modifiedStringElements[index1] === this._modifiedStringElements[index2] : true);\n    }\n    ComputeDiff(pretty) {\n        return this._ComputeDiff(0, this._originalElementsOrHash.length - 1, 0, this._modifiedElementsOrHash.length - 1, pretty);\n    }\n    /**\n     * Computes the differences between the original and modified input\n     * sequences on the bounded range.\n     * @returns An array of the differences between the two input sequences.\n     */\n    _ComputeDiff(originalStart, originalEnd, modifiedStart, modifiedEnd, pretty) {\n        const quitEarlyArr = [false];\n        let changes = this.ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr);\n        if (pretty) {\n            // We have to clean up the computed diff to be more intuitive\n            // but it turns out this cannot be done correctly until the entire set\n            // of diffs have been computed\n            changes = this.PrettifyChanges(changes);\n        }\n        return {\n            quitEarly: quitEarlyArr[0],\n            changes: changes\n        };\n    }\n    /**\n     * Private helper method which computes the differences on the bounded range\n     * recursively.\n     * @returns An array of the differences between the two input sequences.\n     */\n    ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr) {\n        quitEarlyArr[0] = false;\n        // Find the start of the differences\n        while (originalStart <= originalEnd && modifiedStart <= modifiedEnd && this.ElementsAreEqual(originalStart, modifiedStart)) {\n            originalStart++;\n            modifiedStart++;\n        }\n        // Find the end of the differences\n        while (originalEnd >= originalStart && modifiedEnd >= modifiedStart && this.ElementsAreEqual(originalEnd, modifiedEnd)) {\n            originalEnd--;\n            modifiedEnd--;\n        }\n        // In the special case where we either have all insertions or all deletions or the sequences are identical\n        if (originalStart > originalEnd || modifiedStart > modifiedEnd) {\n            let changes;\n            if (modifiedStart <= modifiedEnd) {\n                Debug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd');\n                // All insertions\n                changes = [\n                    new DiffChange(originalStart, 0, modifiedStart, modifiedEnd - modifiedStart + 1)\n                ];\n            }\n            else if (originalStart <= originalEnd) {\n                Debug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd');\n                // All deletions\n                changes = [\n                    new DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, 0)\n                ];\n            }\n            else {\n                Debug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd');\n                Debug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd');\n                // Identical sequences - No differences\n                changes = [];\n            }\n            return changes;\n        }\n        // This problem can be solved using the Divide-And-Conquer technique.\n        const midOriginalArr = [0];\n        const midModifiedArr = [0];\n        const result = this.ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr);\n        const midOriginal = midOriginalArr[0];\n        const midModified = midModifiedArr[0];\n        if (result !== null) {\n            // Result is not-null when there was enough memory to compute the changes while\n            // searching for the recursion point\n            return result;\n        }\n        else if (!quitEarlyArr[0]) {\n            // We can break the problem down recursively by finding the changes in the\n            // First Half:   (originalStart, modifiedStart) to (midOriginal, midModified)\n            // Second Half:  (midOriginal + 1, minModified + 1) to (originalEnd, modifiedEnd)\n            // NOTE: ComputeDiff() is inclusive, therefore the second range starts on the next point\n            const leftChanges = this.ComputeDiffRecursive(originalStart, midOriginal, modifiedStart, midModified, quitEarlyArr);\n            let rightChanges = [];\n            if (!quitEarlyArr[0]) {\n                rightChanges = this.ComputeDiffRecursive(midOriginal + 1, originalEnd, midModified + 1, modifiedEnd, quitEarlyArr);\n            }\n            else {\n                // We didn't have time to finish the first half, so we don't have time to compute this half.\n                // Consider the entire rest of the sequence different.\n                rightChanges = [\n                    new DiffChange(midOriginal + 1, originalEnd - (midOriginal + 1) + 1, midModified + 1, modifiedEnd - (midModified + 1) + 1)\n                ];\n            }\n            return this.ConcatenateChanges(leftChanges, rightChanges);\n        }\n        // If we hit here, we quit early, and so can't return anything meaningful\n        return [\n            new DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1)\n        ];\n    }\n    WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr) {\n        let forwardChanges = null;\n        let reverseChanges = null;\n        // First, walk backward through the forward diagonals history\n        let changeHelper = new DiffChangeHelper();\n        let diagonalMin = diagonalForwardStart;\n        let diagonalMax = diagonalForwardEnd;\n        let diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalForwardOffset;\n        let lastOriginalIndex = -1073741824 /* Constants.MIN_SAFE_SMALL_INTEGER */;\n        let historyIndex = this.m_forwardHistory.length - 1;\n        do {\n            // Get the diagonal index from the relative diagonal number\n            const diagonal = diagonalRelative + diagonalForwardBase;\n            // Figure out where we came from\n            if (diagonal === diagonalMin || (diagonal < diagonalMax && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) {\n                // Vertical line (the element is an insert)\n                originalIndex = forwardPoints[diagonal + 1];\n                modifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset;\n                if (originalIndex < lastOriginalIndex) {\n                    changeHelper.MarkNextChange();\n                }\n                lastOriginalIndex = originalIndex;\n                changeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex);\n                diagonalRelative = (diagonal + 1) - diagonalForwardBase; //Setup for the next iteration\n            }\n            else {\n                // Horizontal line (the element is a deletion)\n                originalIndex = forwardPoints[diagonal - 1] + 1;\n                modifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset;\n                if (originalIndex < lastOriginalIndex) {\n                    changeHelper.MarkNextChange();\n                }\n                lastOriginalIndex = originalIndex - 1;\n                changeHelper.AddOriginalElement(originalIndex, modifiedIndex + 1);\n                diagonalRelative = (diagonal - 1) - diagonalForwardBase; //Setup for the next iteration\n            }\n            if (historyIndex >= 0) {\n                forwardPoints = this.m_forwardHistory[historyIndex];\n                diagonalForwardBase = forwardPoints[0]; //We stored this in the first spot\n                diagonalMin = 1;\n                diagonalMax = forwardPoints.length - 1;\n            }\n        } while (--historyIndex >= -1);\n        // Ironically, we get the forward changes as the reverse of the\n        // order we added them since we technically added them backwards\n        forwardChanges = changeHelper.getReverseChanges();\n        if (quitEarlyArr[0]) {\n            // TODO: Calculate a partial from the reverse diagonals.\n            //       For now, just assume everything after the midOriginal/midModified point is a diff\n            let originalStartPoint = midOriginalArr[0] + 1;\n            let modifiedStartPoint = midModifiedArr[0] + 1;\n            if (forwardChanges !== null && forwardChanges.length > 0) {\n                const lastForwardChange = forwardChanges[forwardChanges.length - 1];\n                originalStartPoint = Math.max(originalStartPoint, lastForwardChange.getOriginalEnd());\n                modifiedStartPoint = Math.max(modifiedStartPoint, lastForwardChange.getModifiedEnd());\n            }\n            reverseChanges = [\n                new DiffChange(originalStartPoint, originalEnd - originalStartPoint + 1, modifiedStartPoint, modifiedEnd - modifiedStartPoint + 1)\n            ];\n        }\n        else {\n            // Now walk backward through the reverse diagonals history\n            changeHelper = new DiffChangeHelper();\n            diagonalMin = diagonalReverseStart;\n            diagonalMax = diagonalReverseEnd;\n            diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalReverseOffset;\n            lastOriginalIndex = 1073741824 /* Constants.MAX_SAFE_SMALL_INTEGER */;\n            historyIndex = (deltaIsEven) ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2;\n            do {\n                // Get the diagonal index from the relative diagonal number\n                const diagonal = diagonalRelative + diagonalReverseBase;\n                // Figure out where we came from\n                if (diagonal === diagonalMin || (diagonal < diagonalMax && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) {\n                    // Horizontal line (the element is a deletion))\n                    originalIndex = reversePoints[diagonal + 1] - 1;\n                    modifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset;\n                    if (originalIndex > lastOriginalIndex) {\n                        changeHelper.MarkNextChange();\n                    }\n                    lastOriginalIndex = originalIndex + 1;\n                    changeHelper.AddOriginalElement(originalIndex + 1, modifiedIndex + 1);\n                    diagonalRelative = (diagonal + 1) - diagonalReverseBase; //Setup for the next iteration\n                }\n                else {\n                    // Vertical line (the element is an insertion)\n                    originalIndex = reversePoints[diagonal - 1];\n                    modifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset;\n                    if (originalIndex > lastOriginalIndex) {\n                        changeHelper.MarkNextChange();\n                    }\n                    lastOriginalIndex = originalIndex;\n                    changeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex + 1);\n                    diagonalRelative = (diagonal - 1) - diagonalReverseBase; //Setup for the next iteration\n                }\n                if (historyIndex >= 0) {\n                    reversePoints = this.m_reverseHistory[historyIndex];\n                    diagonalReverseBase = reversePoints[0]; //We stored this in the first spot\n                    diagonalMin = 1;\n                    diagonalMax = reversePoints.length - 1;\n                }\n            } while (--historyIndex >= -1);\n            // There are cases where the reverse history will find diffs that\n            // are correct, but not intuitive, so we need shift them.\n            reverseChanges = changeHelper.getChanges();\n        }\n        return this.ConcatenateChanges(forwardChanges, reverseChanges);\n    }\n    /**\n     * Given the range to compute the diff on, this method finds the point:\n     * (midOriginal, midModified)\n     * that exists in the middle of the LCS of the two sequences and\n     * is the point at which the LCS problem may be broken down recursively.\n     * This method will try to keep the LCS trace in memory. If the LCS recursion\n     * point is calculated and the full trace is available in memory, then this method\n     * will return the change list.\n     * @param originalStart The start bound of the original sequence range\n     * @param originalEnd The end bound of the original sequence range\n     * @param modifiedStart The start bound of the modified sequence range\n     * @param modifiedEnd The end bound of the modified sequence range\n     * @param midOriginal The middle point of the original sequence range\n     * @param midModified The middle point of the modified sequence range\n     * @returns The diff changes, if available, otherwise null\n     */\n    ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr) {\n        let originalIndex = 0, modifiedIndex = 0;\n        let diagonalForwardStart = 0, diagonalForwardEnd = 0;\n        let diagonalReverseStart = 0, diagonalReverseEnd = 0;\n        // To traverse the edit graph and produce the proper LCS, our actual\n        // start position is just outside the given boundary\n        originalStart--;\n        modifiedStart--;\n        // We set these up to make the compiler happy, but they will\n        // be replaced before we return with the actual recursion point\n        midOriginalArr[0] = 0;\n        midModifiedArr[0] = 0;\n        // Clear out the history\n        this.m_forwardHistory = [];\n        this.m_reverseHistory = [];\n        // Each cell in the two arrays corresponds to a diagonal in the edit graph.\n        // The integer value in the cell represents the originalIndex of the furthest\n        // reaching point found so far that ends in that diagonal.\n        // The modifiedIndex can be computed mathematically from the originalIndex and the diagonal number.\n        const maxDifferences = (originalEnd - originalStart) + (modifiedEnd - modifiedStart);\n        const numDiagonals = maxDifferences + 1;\n        const forwardPoints = new Int32Array(numDiagonals);\n        const reversePoints = new Int32Array(numDiagonals);\n        // diagonalForwardBase: Index into forwardPoints of the diagonal which passes through (originalStart, modifiedStart)\n        // diagonalReverseBase: Index into reversePoints of the diagonal which passes through (originalEnd, modifiedEnd)\n        const diagonalForwardBase = (modifiedEnd - modifiedStart);\n        const diagonalReverseBase = (originalEnd - originalStart);\n        // diagonalForwardOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the\n        //    diagonal number (relative to diagonalForwardBase)\n        // diagonalReverseOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the\n        //    diagonal number (relative to diagonalReverseBase)\n        const diagonalForwardOffset = (originalStart - modifiedStart);\n        const diagonalReverseOffset = (originalEnd - modifiedEnd);\n        // delta: The difference between the end diagonal and the start diagonal. This is used to relate diagonal numbers\n        //   relative to the start diagonal with diagonal numbers relative to the end diagonal.\n        // The Even/Oddn-ness of this delta is important for determining when we should check for overlap\n        const delta = diagonalReverseBase - diagonalForwardBase;\n        const deltaIsEven = (delta % 2 === 0);\n        // Here we set up the start and end points as the furthest points found so far\n        // in both the forward and reverse directions, respectively\n        forwardPoints[diagonalForwardBase] = originalStart;\n        reversePoints[diagonalReverseBase] = originalEnd;\n        // Remember if we quit early, and thus need to do a best-effort result instead of a real result.\n        quitEarlyArr[0] = false;\n        // A couple of points:\n        // --With this method, we iterate on the number of differences between the two sequences.\n        //   The more differences there actually are, the longer this will take.\n        // --Also, as the number of differences increases, we have to search on diagonals further\n        //   away from the reference diagonal (which is diagonalForwardBase for forward, diagonalReverseBase for reverse).\n        // --We extend on even diagonals (relative to the reference diagonal) only when numDifferences\n        //   is even and odd diagonals only when numDifferences is odd.\n        for (let numDifferences = 1; numDifferences <= (maxDifferences / 2) + 1; numDifferences++) {\n            let furthestOriginalIndex = 0;\n            let furthestModifiedIndex = 0;\n            // Run the algorithm in the forward direction\n            diagonalForwardStart = this.ClipDiagonalBound(diagonalForwardBase - numDifferences, numDifferences, diagonalForwardBase, numDiagonals);\n            diagonalForwardEnd = this.ClipDiagonalBound(diagonalForwardBase + numDifferences, numDifferences, diagonalForwardBase, numDiagonals);\n            for (let diagonal = diagonalForwardStart; diagonal <= diagonalForwardEnd; diagonal += 2) {\n                // STEP 1: We extend the furthest reaching point in the present diagonal\n                // by looking at the diagonals above and below and picking the one whose point\n                // is further away from the start point (originalStart, modifiedStart)\n                if (diagonal === diagonalForwardStart || (diagonal < diagonalForwardEnd && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) {\n                    originalIndex = forwardPoints[diagonal + 1];\n                }\n                else {\n                    originalIndex = forwardPoints[diagonal - 1] + 1;\n                }\n                modifiedIndex = originalIndex - (diagonal - diagonalForwardBase) - diagonalForwardOffset;\n                // Save the current originalIndex so we can test for false overlap in step 3\n                const tempOriginalIndex = originalIndex;\n                // STEP 2: We can continue to extend the furthest reaching point in the present diagonal\n                // so long as the elements are equal.\n                while (originalIndex < originalEnd && modifiedIndex < modifiedEnd && this.ElementsAreEqual(originalIndex + 1, modifiedIndex + 1)) {\n                    originalIndex++;\n                    modifiedIndex++;\n                }\n                forwardPoints[diagonal] = originalIndex;\n                if (originalIndex + modifiedIndex > furthestOriginalIndex + furthestModifiedIndex) {\n                    furthestOriginalIndex = originalIndex;\n                    furthestModifiedIndex = modifiedIndex;\n                }\n                // STEP 3: If delta is odd (overlap first happens on forward when delta is odd)\n                // and diagonal is in the range of reverse diagonals computed for numDifferences-1\n                // (the previous iteration; we haven't computed reverse diagonals for numDifferences yet)\n                // then check for overlap.\n                if (!deltaIsEven && Math.abs(diagonal - diagonalReverseBase) <= (numDifferences - 1)) {\n                    if (originalIndex >= reversePoints[diagonal]) {\n                        midOriginalArr[0] = originalIndex;\n                        midModifiedArr[0] = modifiedIndex;\n                        if (tempOriginalIndex <= reversePoints[diagonal] && 1447 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.MaxDifferencesHistory */ + 1)) {\n                            // BINGO! We overlapped, and we have the full trace in memory!\n                            return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr);\n                        }\n                        else {\n                            // Either false overlap, or we didn't have enough memory for the full trace\n                            // Just return the recursion point\n                            return null;\n                        }\n                    }\n                }\n            }\n            // Check to see if we should be quitting early, before moving on to the next iteration.\n            const matchLengthOfLongest = ((furthestOriginalIndex - originalStart) + (furthestModifiedIndex - modifiedStart) - numDifferences) / 2;\n            if (this.ContinueProcessingPredicate !== null && !this.ContinueProcessingPredicate(furthestOriginalIndex, matchLengthOfLongest)) {\n                // We can't finish, so skip ahead to generating a result from what we have.\n                quitEarlyArr[0] = true;\n                // Use the furthest distance we got in the forward direction.\n                midOriginalArr[0] = furthestOriginalIndex;\n                midModifiedArr[0] = furthestModifiedIndex;\n                if (matchLengthOfLongest > 0 && 1447 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.MaxDifferencesHistory */ + 1)) {\n                    // Enough of the history is in memory to walk it backwards\n                    return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr);\n                }\n                else {\n                    // We didn't actually remember enough of the history.\n                    //Since we are quitting the diff early, we need to shift back the originalStart and modified start\n                    //back into the boundary limits since we decremented their value above beyond the boundary limit.\n                    originalStart++;\n                    modifiedStart++;\n                    return [\n                        new DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1)\n                    ];\n                }\n            }\n            // Run the algorithm in the reverse direction\n            diagonalReverseStart = this.ClipDiagonalBound(diagonalReverseBase - numDifferences, numDifferences, diagonalReverseBase, numDiagonals);\n            diagonalReverseEnd = this.ClipDiagonalBound(diagonalReverseBase + numDifferences, numDifferences, diagonalReverseBase, numDiagonals);\n            for (let diagonal = diagonalReverseStart; diagonal <= diagonalReverseEnd; diagonal += 2) {\n                // STEP 1: We extend the furthest reaching point in the present diagonal\n                // by looking at the diagonals above and below and picking the one whose point\n                // is further away from the start point (originalEnd, modifiedEnd)\n                if (diagonal === diagonalReverseStart || (diagonal < diagonalReverseEnd && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) {\n                    originalIndex = reversePoints[diagonal + 1] - 1;\n                }\n                else {\n                    originalIndex = reversePoints[diagonal - 1];\n                }\n                modifiedIndex = originalIndex - (diagonal - diagonalReverseBase) - diagonalReverseOffset;\n                // Save the current originalIndex so we can test for false overlap\n                const tempOriginalIndex = originalIndex;\n                // STEP 2: We can continue to extend the furthest reaching point in the present diagonal\n                // as long as the elements are equal.\n                while (originalIndex > originalStart && modifiedIndex > modifiedStart && this.ElementsAreEqual(originalIndex, modifiedIndex)) {\n                    originalIndex--;\n                    modifiedIndex--;\n                }\n                reversePoints[diagonal] = originalIndex;\n                // STEP 4: If delta is even (overlap first happens on reverse when delta is even)\n                // and diagonal is in the range of forward diagonals computed for numDifferences\n                // then check for overlap.\n                if (deltaIsEven && Math.abs(diagonal - diagonalForwardBase) <= numDifferences) {\n                    if (originalIndex <= forwardPoints[diagonal]) {\n                        midOriginalArr[0] = originalIndex;\n                        midModifiedArr[0] = modifiedIndex;\n                        if (tempOriginalIndex >= forwardPoints[diagonal] && 1447 /* LocalConstants.MaxDifferencesHistory */ > 0 && numDifferences <= (1447 /* LocalConstants.MaxDifferencesHistory */ + 1)) {\n                            // BINGO! We overlapped, and we have the full trace in memory!\n                            return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr);\n                        }\n                        else {\n                            // Either false overlap, or we didn't have enough memory for the full trace\n                            // Just return the recursion point\n                            return null;\n                        }\n                    }\n                }\n            }\n            // Save current vectors to history before the next iteration\n            if (numDifferences <= 1447 /* LocalConstants.MaxDifferencesHistory */) {\n                // We are allocating space for one extra int, which we fill with\n                // the index of the diagonal base index\n                let temp = new Int32Array(diagonalForwardEnd - diagonalForwardStart + 2);\n                temp[0] = diagonalForwardBase - diagonalForwardStart + 1;\n                MyArray.Copy2(forwardPoints, diagonalForwardStart, temp, 1, diagonalForwardEnd - diagonalForwardStart + 1);\n                this.m_forwardHistory.push(temp);\n                temp = new Int32Array(diagonalReverseEnd - diagonalReverseStart + 2);\n                temp[0] = diagonalReverseBase - diagonalReverseStart + 1;\n                MyArray.Copy2(reversePoints, diagonalReverseStart, temp, 1, diagonalReverseEnd - diagonalReverseStart + 1);\n                this.m_reverseHistory.push(temp);\n            }\n        }\n        // If we got here, then we have the full trace in history. We just have to convert it to a change list\n        // NOTE: This part is a bit messy\n        return this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset, diagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset, forwardPoints, reversePoints, originalIndex, originalEnd, midOriginalArr, modifiedIndex, modifiedEnd, midModifiedArr, deltaIsEven, quitEarlyArr);\n    }\n    /**\n     * Shifts the given changes to provide a more intuitive diff.\n     * While the first element in a diff matches the first element after the diff,\n     * we shift the diff down.\n     *\n     * @param changes The list of changes to shift\n     * @returns The shifted changes\n     */\n    PrettifyChanges(changes) {\n        // Shift all the changes down first\n        for (let i = 0; i < changes.length; i++) {\n            const change = changes[i];\n            const originalStop = (i < changes.length - 1) ? changes[i + 1].originalStart : this._originalElementsOrHash.length;\n            const modifiedStop = (i < changes.length - 1) ? changes[i + 1].modifiedStart : this._modifiedElementsOrHash.length;\n            const checkOriginal = change.originalLength > 0;\n            const checkModified = change.modifiedLength > 0;\n            while (change.originalStart + change.originalLength < originalStop\n                && change.modifiedStart + change.modifiedLength < modifiedStop\n                && (!checkOriginal || this.OriginalElementsAreEqual(change.originalStart, change.originalStart + change.originalLength))\n                && (!checkModified || this.ModifiedElementsAreEqual(change.modifiedStart, change.modifiedStart + change.modifiedLength))) {\n                const startStrictEqual = this.ElementsAreStrictEqual(change.originalStart, change.modifiedStart);\n                const endStrictEqual = this.ElementsAreStrictEqual(change.originalStart + change.originalLength, change.modifiedStart + change.modifiedLength);\n                if (endStrictEqual && !startStrictEqual) {\n                    // moving the change down would create an equal change, but the elements are not strict equal\n                    break;\n                }\n                change.originalStart++;\n                change.modifiedStart++;\n            }\n            const mergedChangeArr = [null];\n            if (i < changes.length - 1 && this.ChangesOverlap(changes[i], changes[i + 1], mergedChangeArr)) {\n                changes[i] = mergedChangeArr[0];\n                changes.splice(i + 1, 1);\n                i--;\n                continue;\n            }\n        }\n        // Shift changes back up until we hit empty or whitespace-only lines\n        for (let i = changes.length - 1; i >= 0; i--) {\n            const change = changes[i];\n            let originalStop = 0;\n            let modifiedStop = 0;\n            if (i > 0) {\n                const prevChange = changes[i - 1];\n                originalStop = prevChange.originalStart + prevChange.originalLength;\n                modifiedStop = prevChange.modifiedStart + prevChange.modifiedLength;\n            }\n            const checkOriginal = change.originalLength > 0;\n            const checkModified = change.modifiedLength > 0;\n            let bestDelta = 0;\n            let bestScore = this._boundaryScore(change.originalStart, change.originalLength, change.modifiedStart, change.modifiedLength);\n            for (let delta = 1;; delta++) {\n                const originalStart = change.originalStart - delta;\n                const modifiedStart = change.modifiedStart - delta;\n                if (originalStart < originalStop || modifiedStart < modifiedStop) {\n                    break;\n                }\n                if (checkOriginal && !this.OriginalElementsAreEqual(originalStart, originalStart + change.originalLength)) {\n                    break;\n                }\n                if (checkModified && !this.ModifiedElementsAreEqual(modifiedStart, modifiedStart + change.modifiedLength)) {\n                    break;\n                }\n                const touchingPreviousChange = (originalStart === originalStop && modifiedStart === modifiedStop);\n                const score = ((touchingPreviousChange ? 5 : 0)\n                    + this._boundaryScore(originalStart, change.originalLength, modifiedStart, change.modifiedLength));\n                if (score > bestScore) {\n                    bestScore = score;\n                    bestDelta = delta;\n                }\n            }\n            change.originalStart -= bestDelta;\n            change.modifiedStart -= bestDelta;\n            const mergedChangeArr = [null];\n            if (i > 0 && this.ChangesOverlap(changes[i - 1], changes[i], mergedChangeArr)) {\n                changes[i - 1] = mergedChangeArr[0];\n                changes.splice(i, 1);\n                i++;\n                continue;\n            }\n        }\n        // There could be multiple longest common substrings.\n        // Give preference to the ones containing longer lines\n        if (this._hasStrings) {\n            for (let i = 1, len = changes.length; i < len; i++) {\n                const aChange = changes[i - 1];\n                const bChange = changes[i];\n                const matchedLength = bChange.originalStart - aChange.originalStart - aChange.originalLength;\n                const aOriginalStart = aChange.originalStart;\n                const bOriginalEnd = bChange.originalStart + bChange.originalLength;\n                const abOriginalLength = bOriginalEnd - aOriginalStart;\n                const aModifiedStart = aChange.modifiedStart;\n                const bModifiedEnd = bChange.modifiedStart + bChange.modifiedLength;\n                const abModifiedLength = bModifiedEnd - aModifiedStart;\n                // Avoid wasting a lot of time with these searches\n                if (matchedLength < 5 && abOriginalLength < 20 && abModifiedLength < 20) {\n                    const t = this._findBetterContiguousSequence(aOriginalStart, abOriginalLength, aModifiedStart, abModifiedLength, matchedLength);\n                    if (t) {\n                        const [originalMatchStart, modifiedMatchStart] = t;\n                        if (originalMatchStart !== aChange.originalStart + aChange.originalLength || modifiedMatchStart !== aChange.modifiedStart + aChange.modifiedLength) {\n                            // switch to another sequence that has a better score\n                            aChange.originalLength = originalMatchStart - aChange.originalStart;\n                            aChange.modifiedLength = modifiedMatchStart - aChange.modifiedStart;\n                            bChange.originalStart = originalMatchStart + matchedLength;\n                            bChange.modifiedStart = modifiedMatchStart + matchedLength;\n                            bChange.originalLength = bOriginalEnd - bChange.originalStart;\n                            bChange.modifiedLength = bModifiedEnd - bChange.modifiedStart;\n                        }\n                    }\n                }\n            }\n        }\n        return changes;\n    }\n    _findBetterContiguousSequence(originalStart, originalLength, modifiedStart, modifiedLength, desiredLength) {\n        if (originalLength < desiredLength || modifiedLength < desiredLength) {\n            return null;\n        }\n        const originalMax = originalStart + originalLength - desiredLength + 1;\n        const modifiedMax = modifiedStart + modifiedLength - desiredLength + 1;\n        let bestScore = 0;\n        let bestOriginalStart = 0;\n        let bestModifiedStart = 0;\n        for (let i = originalStart; i < originalMax; i++) {\n            for (let j = modifiedStart; j < modifiedMax; j++) {\n                const score = this._contiguousSequenceScore(i, j, desiredLength);\n                if (score > 0 && score > bestScore) {\n                    bestScore = score;\n                    bestOriginalStart = i;\n                    bestModifiedStart = j;\n                }\n            }\n        }\n        if (bestScore > 0) {\n            return [bestOriginalStart, bestModifiedStart];\n        }\n        return null;\n    }\n    _contiguousSequenceScore(originalStart, modifiedStart, length) {\n        let score = 0;\n        for (let l = 0; l < length; l++) {\n            if (!this.ElementsAreEqual(originalStart + l, modifiedStart + l)) {\n                return 0;\n            }\n            score += this._originalStringElements[originalStart + l].length;\n        }\n        return score;\n    }\n    _OriginalIsBoundary(index) {\n        if (index <= 0 || index >= this._originalElementsOrHash.length - 1) {\n            return true;\n        }\n        return (this._hasStrings && /^\\s*$/.test(this._originalStringElements[index]));\n    }\n    _OriginalRegionIsBoundary(originalStart, originalLength) {\n        if (this._OriginalIsBoundary(originalStart) || this._OriginalIsBoundary(originalStart - 1)) {\n            return true;\n        }\n        if (originalLength > 0) {\n            const originalEnd = originalStart + originalLength;\n            if (this._OriginalIsBoundary(originalEnd - 1) || this._OriginalIsBoundary(originalEnd)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    _ModifiedIsBoundary(index) {\n        if (index <= 0 || index >= this._modifiedElementsOrHash.length - 1) {\n            return true;\n        }\n        return (this._hasStrings && /^\\s*$/.test(this._modifiedStringElements[index]));\n    }\n    _ModifiedRegionIsBoundary(modifiedStart, modifiedLength) {\n        if (this._ModifiedIsBoundary(modifiedStart) || this._ModifiedIsBoundary(modifiedStart - 1)) {\n            return true;\n        }\n        if (modifiedLength > 0) {\n            const modifiedEnd = modifiedStart + modifiedLength;\n            if (this._ModifiedIsBoundary(modifiedEnd - 1) || this._ModifiedIsBoundary(modifiedEnd)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    _boundaryScore(originalStart, originalLength, modifiedStart, modifiedLength) {\n        const originalScore = (this._OriginalRegionIsBoundary(originalStart, originalLength) ? 1 : 0);\n        const modifiedScore = (this._ModifiedRegionIsBoundary(modifiedStart, modifiedLength) ? 1 : 0);\n        return (originalScore + modifiedScore);\n    }\n    /**\n     * Concatenates the two input DiffChange lists and returns the resulting\n     * list.\n     * @param The left changes\n     * @param The right changes\n     * @returns The concatenated list\n     */\n    ConcatenateChanges(left, right) {\n        const mergedChangeArr = [];\n        if (left.length === 0 || right.length === 0) {\n            return (right.length > 0) ? right : left;\n        }\n        else if (this.ChangesOverlap(left[left.length - 1], right[0], mergedChangeArr)) {\n            // Since we break the problem down recursively, it is possible that we\n            // might recurse in the middle of a change thereby splitting it into\n            // two changes. Here in the combining stage, we detect and fuse those\n            // changes back together\n            const result = new Array(left.length + right.length - 1);\n            MyArray.Copy(left, 0, result, 0, left.length - 1);\n            result[left.length - 1] = mergedChangeArr[0];\n            MyArray.Copy(right, 1, result, left.length, right.length - 1);\n            return result;\n        }\n        else {\n            const result = new Array(left.length + right.length);\n            MyArray.Copy(left, 0, result, 0, left.length);\n            MyArray.Copy(right, 0, result, left.length, right.length);\n            return result;\n        }\n    }\n    /**\n     * Returns true if the two changes overlap and can be merged into a single\n     * change\n     * @param left The left change\n     * @param right The right change\n     * @param mergedChange The merged change if the two overlap, null otherwise\n     * @returns True if the two changes overlap\n     */\n    ChangesOverlap(left, right, mergedChangeArr) {\n        Debug.Assert(left.originalStart <= right.originalStart, 'Left change is not less than or equal to right change');\n        Debug.Assert(left.modifiedStart <= right.modifiedStart, 'Left change is not less than or equal to right change');\n        if (left.originalStart + left.originalLength >= right.originalStart || left.modifiedStart + left.modifiedLength >= right.modifiedStart) {\n            const originalStart = left.originalStart;\n            let originalLength = left.originalLength;\n            const modifiedStart = left.modifiedStart;\n            let modifiedLength = left.modifiedLength;\n            if (left.originalStart + left.originalLength >= right.originalStart) {\n                originalLength = right.originalStart + right.originalLength - left.originalStart;\n            }\n            if (left.modifiedStart + left.modifiedLength >= right.modifiedStart) {\n                modifiedLength = right.modifiedStart + right.modifiedLength - left.modifiedStart;\n            }\n            mergedChangeArr[0] = new DiffChange(originalStart, originalLength, modifiedStart, modifiedLength);\n            return true;\n        }\n        else {\n            mergedChangeArr[0] = null;\n            return false;\n        }\n    }\n    /**\n     * Helper method used to clip a diagonal index to the range of valid\n     * diagonals. This also decides whether or not the diagonal index,\n     * if it exceeds the boundary, should be clipped to the boundary or clipped\n     * one inside the boundary depending on the Even/Odd status of the boundary\n     * and numDifferences.\n     * @param diagonal The index of the diagonal to clip.\n     * @param numDifferences The current number of differences being iterated upon.\n     * @param diagonalBaseIndex The base reference diagonal.\n     * @param numDiagonals The total number of diagonals.\n     * @returns The clipped diagonal index.\n     */\n    ClipDiagonalBound(diagonal, numDifferences, diagonalBaseIndex, numDiagonals) {\n        if (diagonal >= 0 && diagonal < numDiagonals) {\n            // Nothing to clip, its in range\n            return diagonal;\n        }\n        // diagonalsBelow: The number of diagonals below the reference diagonal\n        // diagonalsAbove: The number of diagonals above the reference diagonal\n        const diagonalsBelow = diagonalBaseIndex;\n        const diagonalsAbove = numDiagonals - diagonalBaseIndex - 1;\n        const diffEven = (numDifferences % 2 === 0);\n        if (diagonal < 0) {\n            const lowerBoundEven = (diagonalsBelow % 2 === 0);\n            return (diffEven === lowerBoundEven) ? 0 : 1;\n        }\n        else {\n            const upperBoundEven = (diagonalsAbove % 2 === 0);\n            return (diffEven === upperBoundEven) ? numDiagonals - 1 : numDiagonals - 2;\n        }\n    }\n}\n\nexport { LcsDiff, StringDiffSequence, stringDiff };\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 * A position in the editor.\n */\nclass Position {\n    constructor(lineNumber, column) {\n        this.lineNumber = lineNumber;\n        this.column = column;\n    }\n    /**\n     * Create a new position from this position.\n     *\n     * @param newLineNumber new line number\n     * @param newColumn new column\n     */\n    with(newLineNumber = this.lineNumber, newColumn = this.column) {\n        if (newLineNumber === this.lineNumber && newColumn === this.column) {\n            return this;\n        }\n        else {\n            return new Position(newLineNumber, newColumn);\n        }\n    }\n    /**\n     * Derive a new position from this position.\n     *\n     * @param deltaLineNumber line number delta\n     * @param deltaColumn column delta\n     */\n    delta(deltaLineNumber = 0, deltaColumn = 0) {\n        return this.with(Math.max(1, this.lineNumber + deltaLineNumber), Math.max(1, this.column + deltaColumn));\n    }\n    /**\n     * Test if this position equals other position\n     */\n    equals(other) {\n        return Position.equals(this, other);\n    }\n    /**\n     * Test if position `a` equals position `b`\n     */\n    static equals(a, b) {\n        if (!a && !b) {\n            return true;\n        }\n        return (!!a &&\n            !!b &&\n            a.lineNumber === b.lineNumber &&\n            a.column === b.column);\n    }\n    /**\n     * Test if this position is before other position.\n     * If the two positions are equal, the result will be false.\n     */\n    isBefore(other) {\n        return Position.isBefore(this, other);\n    }\n    /**\n     * Test if position `a` is before position `b`.\n     * If the two positions are equal, the result will be false.\n     */\n    static isBefore(a, b) {\n        if (a.lineNumber < b.lineNumber) {\n            return true;\n        }\n        if (b.lineNumber < a.lineNumber) {\n            return false;\n        }\n        return a.column < b.column;\n    }\n    /**\n     * Test if this position is before other position.\n     * If the two positions are equal, the result will be true.\n     */\n    isBeforeOrEqual(other) {\n        return Position.isBeforeOrEqual(this, other);\n    }\n    /**\n     * Test if position `a` is before position `b`.\n     * If the two positions are equal, the result will be true.\n     */\n    static isBeforeOrEqual(a, b) {\n        if (a.lineNumber < b.lineNumber) {\n            return true;\n        }\n        if (b.lineNumber < a.lineNumber) {\n            return false;\n        }\n        return a.column <= b.column;\n    }\n    /**\n     * A function that compares positions, useful for sorting\n     */\n    static compare(a, b) {\n        const aLineNumber = a.lineNumber | 0;\n        const bLineNumber = b.lineNumber | 0;\n        if (aLineNumber === bLineNumber) {\n            const aColumn = a.column | 0;\n            const bColumn = b.column | 0;\n            return aColumn - bColumn;\n        }\n        return aLineNumber - bLineNumber;\n    }\n    /**\n     * Clone this position.\n     */\n    clone() {\n        return new Position(this.lineNumber, this.column);\n    }\n    /**\n     * Convert to a human-readable representation.\n     */\n    toString() {\n        return '(' + this.lineNumber + ',' + this.column + ')';\n    }\n    // ---\n    /**\n     * Create a `Position` from an `IPosition`.\n     */\n    static lift(pos) {\n        return new Position(pos.lineNumber, pos.column);\n    }\n    /**\n     * Test if `obj` is an `IPosition`.\n     */\n    static isIPosition(obj) {\n        return (!!obj\n            && (typeof obj.lineNumber === 'number')\n            && (typeof obj.column === 'number'));\n    }\n    toJSON() {\n        return {\n            lineNumber: this.lineNumber,\n            column: this.column\n        };\n    }\n}\n\nexport { Position };\n","import { Position } from './position.js';\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 * A range in the editor. (startLineNumber,startColumn) is <= (endLineNumber,endColumn)\n */\nclass Range {\n    constructor(startLineNumber, startColumn, endLineNumber, endColumn) {\n        if ((startLineNumber > endLineNumber) || (startLineNumber === endLineNumber && startColumn > endColumn)) {\n            this.startLineNumber = endLineNumber;\n            this.startColumn = endColumn;\n            this.endLineNumber = startLineNumber;\n            this.endColumn = startColumn;\n        }\n        else {\n            this.startLineNumber = startLineNumber;\n            this.startColumn = startColumn;\n            this.endLineNumber = endLineNumber;\n            this.endColumn = endColumn;\n        }\n    }\n    /**\n     * Test if this range is empty.\n     */\n    isEmpty() {\n        return Range.isEmpty(this);\n    }\n    /**\n     * Test if `range` is empty.\n     */\n    static isEmpty(range) {\n        return (range.startLineNumber === range.endLineNumber && range.startColumn === range.endColumn);\n    }\n    /**\n     * Test if position is in this range. If the position is at the edges, will return true.\n     */\n    containsPosition(position) {\n        return Range.containsPosition(this, position);\n    }\n    /**\n     * Test if `position` is in `range`. If the position is at the edges, will return true.\n     */\n    static containsPosition(range, position) {\n        if (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) {\n            return false;\n        }\n        if (position.lineNumber === range.startLineNumber && position.column < range.startColumn) {\n            return false;\n        }\n        if (position.lineNumber === range.endLineNumber && position.column > range.endColumn) {\n            return false;\n        }\n        return true;\n    }\n    /**\n     * Test if `position` is in `range`. If the position is at the edges, will return false.\n     * @internal\n     */\n    static strictContainsPosition(range, position) {\n        if (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) {\n            return false;\n        }\n        if (position.lineNumber === range.startLineNumber && position.column <= range.startColumn) {\n            return false;\n        }\n        if (position.lineNumber === range.endLineNumber && position.column >= range.endColumn) {\n            return false;\n        }\n        return true;\n    }\n    /**\n     * Test if range is in this range. If the range is equal to this range, will return true.\n     */\n    containsRange(range) {\n        return Range.containsRange(this, range);\n    }\n    /**\n     * Test if `otherRange` is in `range`. If the ranges are equal, will return true.\n     */\n    static containsRange(range, otherRange) {\n        if (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) {\n            return false;\n        }\n        if (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) {\n            return false;\n        }\n        if (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn < range.startColumn) {\n            return false;\n        }\n        if (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn > range.endColumn) {\n            return false;\n        }\n        return true;\n    }\n    /**\n     * Test if `range` is strictly in this range. `range` must start after and end before this range for the result to be true.\n     */\n    strictContainsRange(range) {\n        return Range.strictContainsRange(this, range);\n    }\n    /**\n     * Test if `otherRange` is strictly in `range` (must start after, and end before). If the ranges are equal, will return false.\n     */\n    static strictContainsRange(range, otherRange) {\n        if (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) {\n            return false;\n        }\n        if (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) {\n            return false;\n        }\n        if (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn <= range.startColumn) {\n            return false;\n        }\n        if (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn >= range.endColumn) {\n            return false;\n        }\n        return true;\n    }\n    /**\n     * A reunion of the two ranges.\n     * The smallest position will be used as the start point, and the largest one as the end point.\n     */\n    plusRange(range) {\n        return Range.plusRange(this, range);\n    }\n    /**\n     * A reunion of the two ranges.\n     * The smallest position will be used as the start point, and the largest one as the end point.\n     */\n    static plusRange(a, b) {\n        let startLineNumber;\n        let startColumn;\n        let endLineNumber;\n        let endColumn;\n        if (b.startLineNumber < a.startLineNumber) {\n            startLineNumber = b.startLineNumber;\n            startColumn = b.startColumn;\n        }\n        else if (b.startLineNumber === a.startLineNumber) {\n            startLineNumber = b.startLineNumber;\n            startColumn = Math.min(b.startColumn, a.startColumn);\n        }\n        else {\n            startLineNumber = a.startLineNumber;\n            startColumn = a.startColumn;\n        }\n        if (b.endLineNumber > a.endLineNumber) {\n            endLineNumber = b.endLineNumber;\n            endColumn = b.endColumn;\n        }\n        else if (b.endLineNumber === a.endLineNumber) {\n            endLineNumber = b.endLineNumber;\n            endColumn = Math.max(b.endColumn, a.endColumn);\n        }\n        else {\n            endLineNumber = a.endLineNumber;\n            endColumn = a.endColumn;\n        }\n        return new Range(startLineNumber, startColumn, endLineNumber, endColumn);\n    }\n    /**\n     * A intersection of the two ranges.\n     */\n    intersectRanges(range) {\n        return Range.intersectRanges(this, range);\n    }\n    /**\n     * A intersection of the two ranges.\n     */\n    static intersectRanges(a, b) {\n        let resultStartLineNumber = a.startLineNumber;\n        let resultStartColumn = a.startColumn;\n        let resultEndLineNumber = a.endLineNumber;\n        let resultEndColumn = a.endColumn;\n        const otherStartLineNumber = b.startLineNumber;\n        const otherStartColumn = b.startColumn;\n        const otherEndLineNumber = b.endLineNumber;\n        const otherEndColumn = b.endColumn;\n        if (resultStartLineNumber < otherStartLineNumber) {\n            resultStartLineNumber = otherStartLineNumber;\n            resultStartColumn = otherStartColumn;\n        }\n        else if (resultStartLineNumber === otherStartLineNumber) {\n            resultStartColumn = Math.max(resultStartColumn, otherStartColumn);\n        }\n        if (resultEndLineNumber > otherEndLineNumber) {\n            resultEndLineNumber = otherEndLineNumber;\n            resultEndColumn = otherEndColumn;\n        }\n        else if (resultEndLineNumber === otherEndLineNumber) {\n            resultEndColumn = Math.min(resultEndColumn, otherEndColumn);\n        }\n        // Check if selection is now empty\n        if (resultStartLineNumber > resultEndLineNumber) {\n            return null;\n        }\n        if (resultStartLineNumber === resultEndLineNumber && resultStartColumn > resultEndColumn) {\n            return null;\n        }\n        return new Range(resultStartLineNumber, resultStartColumn, resultEndLineNumber, resultEndColumn);\n    }\n    /**\n     * Test if this range equals other.\n     */\n    equalsRange(other) {\n        return Range.equalsRange(this, other);\n    }\n    /**\n     * Test if range `a` equals `b`.\n     */\n    static equalsRange(a, b) {\n        if (!a && !b) {\n            return true;\n        }\n        return (!!a &&\n            !!b &&\n            a.startLineNumber === b.startLineNumber &&\n            a.startColumn === b.startColumn &&\n            a.endLineNumber === b.endLineNumber &&\n            a.endColumn === b.endColumn);\n    }\n    /**\n     * Return the end position (which will be after or equal to the start position)\n     */\n    getEndPosition() {\n        return Range.getEndPosition(this);\n    }\n    /**\n     * Return the end position (which will be after or equal to the start position)\n     */\n    static getEndPosition(range) {\n        return new Position(range.endLineNumber, range.endColumn);\n    }\n    /**\n     * Return the start position (which will be before or equal to the end position)\n     */\n    getStartPosition() {\n        return Range.getStartPosition(this);\n    }\n    /**\n     * Return the start position (which will be before or equal to the end position)\n     */\n    static getStartPosition(range) {\n        return new Position(range.startLineNumber, range.startColumn);\n    }\n    /**\n     * Transform to a user presentable string representation.\n     */\n    toString() {\n        return '[' + this.startLineNumber + ',' + this.startColumn + ' -> ' + this.endLineNumber + ',' + this.endColumn + ']';\n    }\n    /**\n     * Create a new range using this range's start position, and using endLineNumber and endColumn as the end position.\n     */\n    setEndPosition(endLineNumber, endColumn) {\n        return new Range(this.startLineNumber, this.startColumn, endLineNumber, endColumn);\n    }\n    /**\n     * Create a new range using this range's end position, and using startLineNumber and startColumn as the start position.\n     */\n    setStartPosition(startLineNumber, startColumn) {\n        return new Range(startLineNumber, startColumn, this.endLineNumber, this.endColumn);\n    }\n    /**\n     * Create a new empty range using this range's start position.\n     */\n    collapseToStart() {\n        return Range.collapseToStart(this);\n    }\n    /**\n     * Create a new empty range using this range's start position.\n     */\n    static collapseToStart(range) {\n        return new Range(range.startLineNumber, range.startColumn, range.startLineNumber, range.startColumn);\n    }\n    /**\n     * Create a new empty range using this range's end position.\n     */\n    collapseToEnd() {\n        return Range.collapseToEnd(this);\n    }\n    /**\n     * Create a new empty range using this range's end position.\n     */\n    static collapseToEnd(range) {\n        return new Range(range.endLineNumber, range.endColumn, range.endLineNumber, range.endColumn);\n    }\n    /**\n     * Moves the range by the given amount of lines.\n     */\n    delta(lineCount) {\n        return new Range(this.startLineNumber + lineCount, this.startColumn, this.endLineNumber + lineCount, this.endColumn);\n    }\n    isSingleLine() {\n        return this.startLineNumber === this.endLineNumber;\n    }\n    // ---\n    static fromPositions(start, end = start) {\n        return new Range(start.lineNumber, start.column, end.lineNumber, end.column);\n    }\n    static lift(range) {\n        if (!range) {\n            return null;\n        }\n        return new Range(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);\n    }\n    /**\n     * Test if `obj` is an `IRange`.\n     */\n    static isIRange(obj) {\n        return (!!obj\n            && (typeof obj.startLineNumber === 'number')\n            && (typeof obj.startColumn === 'number')\n            && (typeof obj.endLineNumber === 'number')\n            && (typeof obj.endColumn === 'number'));\n    }\n    /**\n     * Test if the two ranges are touching in any way.\n     */\n    static areIntersectingOrTouching(a, b) {\n        // Check if `a` is before `b`\n        if (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn < b.startColumn)) {\n            return false;\n        }\n        // Check if `b` is before `a`\n        if (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn < a.startColumn)) {\n            return false;\n        }\n        // These ranges must intersect\n        return true;\n    }\n    /**\n     * Test if the two ranges are intersecting. If the ranges are touching it returns true.\n     */\n    static areIntersecting(a, b) {\n        // Check if `a` is before `b`\n        if (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn <= b.startColumn)) {\n            return false;\n        }\n        // Check if `b` is before `a`\n        if (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn <= a.startColumn)) {\n            return false;\n        }\n        // These ranges must intersect\n        return true;\n    }\n    /**\n     * Test if the two ranges are intersecting, but not touching at all.\n     */\n    static areOnlyIntersecting(a, b) {\n        // Check if `a` is before `b`\n        if (a.endLineNumber < (b.startLineNumber - 1) || (a.endLineNumber === b.startLineNumber && a.endColumn < (b.startColumn - 1))) {\n            return false;\n        }\n        // Check if `b` is before `a`\n        if (b.endLineNumber < (a.startLineNumber - 1) || (b.endLineNumber === a.startLineNumber && b.endColumn < (a.startColumn - 1))) {\n            return false;\n        }\n        // These ranges must intersect\n        return true;\n    }\n    /**\n     * A function that compares ranges, useful for sorting ranges\n     * It will first compare ranges on the startPosition and then on the endPosition\n     */\n    static compareRangesUsingStarts(a, b) {\n        if (a && b) {\n            const aStartLineNumber = a.startLineNumber | 0;\n            const bStartLineNumber = b.startLineNumber | 0;\n            if (aStartLineNumber === bStartLineNumber) {\n                const aStartColumn = a.startColumn | 0;\n                const bStartColumn = b.startColumn | 0;\n                if (aStartColumn === bStartColumn) {\n                    const aEndLineNumber = a.endLineNumber | 0;\n                    const bEndLineNumber = b.endLineNumber | 0;\n                    if (aEndLineNumber === bEndLineNumber) {\n                        const aEndColumn = a.endColumn | 0;\n                        const bEndColumn = b.endColumn | 0;\n                        return aEndColumn - bEndColumn;\n                    }\n                    return aEndLineNumber - bEndLineNumber;\n                }\n                return aStartColumn - bStartColumn;\n            }\n            return aStartLineNumber - bStartLineNumber;\n        }\n        const aExists = (a ? 1 : 0);\n        const bExists = (b ? 1 : 0);\n        return aExists - bExists;\n    }\n    /**\n     * A function that compares ranges, useful for sorting ranges\n     * It will first compare ranges on the endPosition and then on the startPosition\n     */\n    static compareRangesUsingEnds(a, b) {\n        if (a.endLineNumber === b.endLineNumber) {\n            if (a.endColumn === b.endColumn) {\n                if (a.startLineNumber === b.startLineNumber) {\n                    return a.startColumn - b.startColumn;\n                }\n                return a.startLineNumber - b.startLineNumber;\n            }\n            return a.endColumn - b.endColumn;\n        }\n        return a.endLineNumber - b.endLineNumber;\n    }\n    /**\n     * Test if the range spans multiple lines.\n     */\n    static spansMultipleLines(range) {\n        return range.endLineNumber > range.startLineNumber;\n    }\n    toJSON() {\n        return this;\n    }\n}\n\nexport { Range };\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 *--------------------------------------------------------------------------------------------*/\nfunction toUint8(v) {\n    if (v < 0) {\n        return 0;\n    }\n    if (v > 255 /* Constants.MAX_UINT_8 */) {\n        return 255 /* Constants.MAX_UINT_8 */;\n    }\n    return v | 0;\n}\nfunction toUint32(v) {\n    if (v < 0) {\n        return 0;\n    }\n    if (v > 4294967295 /* Constants.MAX_UINT_32 */) {\n        return 4294967295 /* Constants.MAX_UINT_32 */;\n    }\n    return v | 0;\n}\n\nexport { toUint32, toUint8 };\n","import { toUint8 } from '../../../base/common/uint.js';\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 * A fast character classifier that uses a compact array for ASCII values.\n */\nclass CharacterClassifier {\n    constructor(_defaultValue) {\n        const defaultValue = toUint8(_defaultValue);\n        this._defaultValue = defaultValue;\n        this._asciiMap = CharacterClassifier._createAsciiMap(defaultValue);\n        this._map = new Map();\n    }\n    static _createAsciiMap(defaultValue) {\n        const asciiMap = new Uint8Array(256);\n        asciiMap.fill(defaultValue);\n        return asciiMap;\n    }\n    set(charCode, _value) {\n        const value = toUint8(_value);\n        if (charCode >= 0 && charCode < 256) {\n            this._asciiMap[charCode] = value;\n        }\n        else {\n            this._map.set(charCode, value);\n        }\n    }\n    get(charCode) {\n        if (charCode >= 0 && charCode < 256) {\n            return this._asciiMap[charCode];\n        }\n        else {\n            return (this._map.get(charCode) || this._defaultValue);\n        }\n    }\n    clear() {\n        this._asciiMap.fill(this._defaultValue);\n        this._map.clear();\n    }\n}\nclass CharacterSet {\n    constructor() {\n        this._actual = new CharacterClassifier(0 /* Boolean.False */);\n    }\n    add(charCode) {\n        this._actual.set(charCode, 1 /* Boolean.True */);\n    }\n    has(charCode) {\n        return (this._actual.get(charCode) === 1 /* Boolean.True */);\n    }\n    clear() {\n        return this._actual.clear();\n    }\n}\n\nexport { CharacterClassifier, CharacterSet };\n","import { CharacterClassifier } from '../core/characterClassifier.js';\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 *--------------------------------------------------------------------------------------------*/\nclass Uint8Matrix {\n    constructor(rows, cols, defaultValue) {\n        const data = new Uint8Array(rows * cols);\n        for (let i = 0, len = rows * cols; i < len; i++) {\n            data[i] = defaultValue;\n        }\n        this._data = data;\n        this.rows = rows;\n        this.cols = cols;\n    }\n    get(row, col) {\n        return this._data[row * this.cols + col];\n    }\n    set(row, col, value) {\n        this._data[row * this.cols + col] = value;\n    }\n}\nclass StateMachine {\n    constructor(edges) {\n        let maxCharCode = 0;\n        let maxState = 0 /* State.Invalid */;\n        for (let i = 0, len = edges.length; i < len; i++) {\n            const [from, chCode, to] = edges[i];\n            if (chCode > maxCharCode) {\n                maxCharCode = chCode;\n            }\n            if (from > maxState) {\n                maxState = from;\n            }\n            if (to > maxState) {\n                maxState = to;\n            }\n        }\n        maxCharCode++;\n        maxState++;\n        const states = new Uint8Matrix(maxState, maxCharCode, 0 /* State.Invalid */);\n        for (let i = 0, len = edges.length; i < len; i++) {\n            const [from, chCode, to] = edges[i];\n            states.set(from, chCode, to);\n        }\n        this._states = states;\n        this._maxCharCode = maxCharCode;\n    }\n    nextState(currentState, chCode) {\n        if (chCode < 0 || chCode >= this._maxCharCode) {\n            return 0 /* State.Invalid */;\n        }\n        return this._states.get(currentState, chCode);\n    }\n}\n// State machine for http:// or https:// or file://\nlet _stateMachine = null;\nfunction getStateMachine() {\n    if (_stateMachine === null) {\n        _stateMachine = new StateMachine([\n            [1 /* State.Start */, 104 /* CharCode.h */, 2 /* State.H */],\n            [1 /* State.Start */, 72 /* CharCode.H */, 2 /* State.H */],\n            [1 /* State.Start */, 102 /* CharCode.f */, 6 /* State.F */],\n            [1 /* State.Start */, 70 /* CharCode.F */, 6 /* State.F */],\n            [2 /* State.H */, 116 /* CharCode.t */, 3 /* State.HT */],\n            [2 /* State.H */, 84 /* CharCode.T */, 3 /* State.HT */],\n            [3 /* State.HT */, 116 /* CharCode.t */, 4 /* State.HTT */],\n            [3 /* State.HT */, 84 /* CharCode.T */, 4 /* State.HTT */],\n            [4 /* State.HTT */, 112 /* CharCode.p */, 5 /* State.HTTP */],\n            [4 /* State.HTT */, 80 /* CharCode.P */, 5 /* State.HTTP */],\n            [5 /* State.HTTP */, 115 /* CharCode.s */, 9 /* State.BeforeColon */],\n            [5 /* State.HTTP */, 83 /* CharCode.S */, 9 /* State.BeforeColon */],\n            [5 /* State.HTTP */, 58 /* CharCode.Colon */, 10 /* State.AfterColon */],\n            [6 /* State.F */, 105 /* CharCode.i */, 7 /* State.FI */],\n            [6 /* State.F */, 73 /* CharCode.I */, 7 /* State.FI */],\n            [7 /* State.FI */, 108 /* CharCode.l */, 8 /* State.FIL */],\n            [7 /* State.FI */, 76 /* CharCode.L */, 8 /* State.FIL */],\n            [8 /* State.FIL */, 101 /* CharCode.e */, 9 /* State.BeforeColon */],\n            [8 /* State.FIL */, 69 /* CharCode.E */, 9 /* State.BeforeColon */],\n            [9 /* State.BeforeColon */, 58 /* CharCode.Colon */, 10 /* State.AfterColon */],\n            [10 /* State.AfterColon */, 47 /* CharCode.Slash */, 11 /* State.AlmostThere */],\n            [11 /* State.AlmostThere */, 47 /* CharCode.Slash */, 12 /* State.End */],\n        ]);\n    }\n    return _stateMachine;\n}\nlet _classifier = null;\nfunction getClassifier() {\n    if (_classifier === null) {\n        _classifier = new CharacterClassifier(0 /* CharacterClass.None */);\n        // allow-any-unicode-next-line\n        const FORCE_TERMINATION_CHARACTERS = ' \\t<>\\'\\\"、。｡､，．：；‘〈「『〔（［｛｢｣｝］）〕』」〉’｀～…|';\n        for (let i = 0; i < FORCE_TERMINATION_CHARACTERS.length; i++) {\n            _classifier.set(FORCE_TERMINATION_CHARACTERS.charCodeAt(i), 1 /* CharacterClass.ForceTermination */);\n        }\n        const CANNOT_END_WITH_CHARACTERS = '.,;:';\n        for (let i = 0; i < CANNOT_END_WITH_CHARACTERS.length; i++) {\n            _classifier.set(CANNOT_END_WITH_CHARACTERS.charCodeAt(i), 2 /* CharacterClass.CannotEndIn */);\n        }\n    }\n    return _classifier;\n}\nclass LinkComputer {\n    static _createLink(classifier, line, lineNumber, linkBeginIndex, linkEndIndex) {\n        // Do not allow to end link in certain characters...\n        let lastIncludedCharIndex = linkEndIndex - 1;\n        do {\n            const chCode = line.charCodeAt(lastIncludedCharIndex);\n            const chClass = classifier.get(chCode);\n            if (chClass !== 2 /* CharacterClass.CannotEndIn */) {\n                break;\n            }\n            lastIncludedCharIndex--;\n        } while (lastIncludedCharIndex > linkBeginIndex);\n        // Handle links enclosed in parens, square brackets and curlys.\n        if (linkBeginIndex > 0) {\n            const charCodeBeforeLink = line.charCodeAt(linkBeginIndex - 1);\n            const lastCharCodeInLink = line.charCodeAt(lastIncludedCharIndex);\n            if ((charCodeBeforeLink === 40 /* CharCode.OpenParen */ && lastCharCodeInLink === 41 /* CharCode.CloseParen */)\n                || (charCodeBeforeLink === 91 /* CharCode.OpenSquareBracket */ && lastCharCodeInLink === 93 /* CharCode.CloseSquareBracket */)\n                || (charCodeBeforeLink === 123 /* CharCode.OpenCurlyBrace */ && lastCharCodeInLink === 125 /* CharCode.CloseCurlyBrace */)) {\n                // Do not end in ) if ( is before the link start\n                // Do not end in ] if [ is before the link start\n                // Do not end in } if { is before the link start\n                lastIncludedCharIndex--;\n            }\n        }\n        return {\n            range: {\n                startLineNumber: lineNumber,\n                startColumn: linkBeginIndex + 1,\n                endLineNumber: lineNumber,\n                endColumn: lastIncludedCharIndex + 2\n            },\n            url: line.substring(linkBeginIndex, lastIncludedCharIndex + 1)\n        };\n    }\n    static computeLinks(model, stateMachine = getStateMachine()) {\n        const classifier = getClassifier();\n        const result = [];\n        for (let i = 1, lineCount = model.getLineCount(); i <= lineCount; i++) {\n            const line = model.getLineContent(i);\n            const len = line.length;\n            let j = 0;\n            let linkBeginIndex = 0;\n            let linkBeginChCode = 0;\n            let state = 1 /* State.Start */;\n            let hasOpenParens = false;\n            let hasOpenSquareBracket = false;\n            let inSquareBrackets = false;\n            let hasOpenCurlyBracket = false;\n            while (j < len) {\n                let resetStateMachine = false;\n                const chCode = line.charCodeAt(j);\n                if (state === 13 /* State.Accept */) {\n                    let chClass;\n                    switch (chCode) {\n                        case 40 /* CharCode.OpenParen */:\n                            hasOpenParens = true;\n                            chClass = 0 /* CharacterClass.None */;\n                            break;\n                        case 41 /* CharCode.CloseParen */:\n                            chClass = (hasOpenParens ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);\n                            break;\n                        case 91 /* CharCode.OpenSquareBracket */:\n                            inSquareBrackets = true;\n                            hasOpenSquareBracket = true;\n                            chClass = 0 /* CharacterClass.None */;\n                            break;\n                        case 93 /* CharCode.CloseSquareBracket */:\n                            inSquareBrackets = false;\n                            chClass = (hasOpenSquareBracket ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);\n                            break;\n                        case 123 /* CharCode.OpenCurlyBrace */:\n                            hasOpenCurlyBracket = true;\n                            chClass = 0 /* CharacterClass.None */;\n                            break;\n                        case 125 /* CharCode.CloseCurlyBrace */:\n                            chClass = (hasOpenCurlyBracket ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);\n                            break;\n                        // The following three rules make it that ' or \" or ` are allowed inside links\n                        // only if the link is wrapped by some other quote character\n                        case 39 /* CharCode.SingleQuote */:\n                        case 34 /* CharCode.DoubleQuote */:\n                        case 96 /* CharCode.BackTick */:\n                            if (linkBeginChCode === chCode) {\n                                chClass = 1 /* CharacterClass.ForceTermination */;\n                            }\n                            else if (linkBeginChCode === 39 /* CharCode.SingleQuote */ || linkBeginChCode === 34 /* CharCode.DoubleQuote */ || linkBeginChCode === 96 /* CharCode.BackTick */) {\n                                chClass = 0 /* CharacterClass.None */;\n                            }\n                            else {\n                                chClass = 1 /* CharacterClass.ForceTermination */;\n                            }\n                            break;\n                        case 42 /* CharCode.Asterisk */:\n                            // `*` terminates a link if the link began with `*`\n                            chClass = (linkBeginChCode === 42 /* CharCode.Asterisk */) ? 1 /* CharacterClass.ForceTermination */ : 0 /* CharacterClass.None */;\n                            break;\n                        case 32 /* CharCode.Space */:\n                            // ` ` allow space in between [ and ]\n                            chClass = (inSquareBrackets ? 0 /* CharacterClass.None */ : 1 /* CharacterClass.ForceTermination */);\n                            break;\n                        default:\n                            chClass = classifier.get(chCode);\n                    }\n                    // Check if character terminates link\n                    if (chClass === 1 /* CharacterClass.ForceTermination */) {\n                        result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, j));\n                        resetStateMachine = true;\n                    }\n                }\n                else if (state === 12 /* State.End */) {\n                    let chClass;\n                    if (chCode === 91 /* CharCode.OpenSquareBracket */) {\n                        // Allow for the authority part to contain ipv6 addresses which contain [ and ]\n                        hasOpenSquareBracket = true;\n                        chClass = 0 /* CharacterClass.None */;\n                    }\n                    else {\n                        chClass = classifier.get(chCode);\n                    }\n                    // Check if character terminates link\n                    if (chClass === 1 /* CharacterClass.ForceTermination */) {\n                        resetStateMachine = true;\n                    }\n                    else {\n                        state = 13 /* State.Accept */;\n                    }\n                }\n                else {\n                    state = stateMachine.nextState(state, chCode);\n                    if (state === 0 /* State.Invalid */) {\n                        resetStateMachine = true;\n                    }\n                }\n                if (resetStateMachine) {\n                    state = 1 /* State.Start */;\n                    hasOpenParens = false;\n                    hasOpenSquareBracket = false;\n                    hasOpenCurlyBracket = false;\n                    // Record where the link started\n                    linkBeginIndex = j + 1;\n                    linkBeginChCode = chCode;\n                }\n                j++;\n            }\n            if (state === 13 /* State.Accept */) {\n                result.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, len));\n            }\n        }\n        return result;\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 */\nfunction computeLinks(model) {\n    if (!model || typeof model.getLineCount !== 'function' || typeof model.getLineContent !== 'function') {\n        // Unknown caller!\n        return [];\n    }\n    return LinkComputer.computeLinks(model);\n}\n\nexport { LinkComputer, StateMachine, computeLinks };\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 *--------------------------------------------------------------------------------------------*/\nclass BasicInplaceReplace {\n    constructor() {\n        this._defaultValueSet = [\n            ['true', 'false'],\n            ['True', 'False'],\n            ['Private', 'Public', 'Friend', 'ReadOnly', 'Partial', 'Protected', 'WriteOnly'],\n            ['public', 'protected', 'private'],\n        ];\n    }\n    static { this.INSTANCE = new BasicInplaceReplace(); }\n    navigateValueSet(range1, text1, range2, text2, up) {\n        if (range1 && text1) {\n            const result = this.doNavigateValueSet(text1, up);\n            if (result) {\n                return {\n                    range: range1,\n                    value: result\n                };\n            }\n        }\n        if (range2 && text2) {\n            const result = this.doNavigateValueSet(text2, up);\n            if (result) {\n                return {\n                    range: range2,\n                    value: result\n                };\n            }\n        }\n        return null;\n    }\n    doNavigateValueSet(text, up) {\n        const numberResult = this.numberReplace(text, up);\n        if (numberResult !== null) {\n            return numberResult;\n        }\n        return this.textReplace(text, up);\n    }\n    numberReplace(value, up) {\n        const precision = Math.pow(10, value.length - (value.lastIndexOf('.') + 1));\n        let n1 = Number(value);\n        const n2 = parseFloat(value);\n        if (!isNaN(n1) && !isNaN(n2) && n1 === n2) {\n            if (n1 === 0 && !up) {\n                return null; // don't do negative\n                //\t\t\t} else if(n1 === 9 && up) {\n                //\t\t\t\treturn null; // don't insert 10 into a number\n            }\n            else {\n                n1 = Math.floor(n1 * precision);\n                n1 += up ? precision : -precision;\n                return String(n1 / precision);\n            }\n        }\n        return null;\n    }\n    textReplace(value, up) {\n        return this.valueSetsReplace(this._defaultValueSet, value, up);\n    }\n    valueSetsReplace(valueSets, value, up) {\n        let result = null;\n        for (let i = 0, len = valueSets.length; result === null && i < len; i++) {\n            result = this.valueSetReplace(valueSets[i], value, up);\n        }\n        return result;\n    }\n    valueSetReplace(valueSet, value, up) {\n        let idx = valueSet.indexOf(value);\n        if (idx >= 0) {\n            idx += up ? 1 : -1;\n            if (idx < 0) {\n                idx = valueSet.length - 1;\n            }\n            else {\n                idx %= valueSet.length;\n            }\n            return valueSet[idx];\n        }\n        return null;\n    }\n}\n\nexport { BasicInplaceReplace };\n","import { Event, Emitter } from './event.js';\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 *--------------------------------------------------------------------------------------------*/\nconst shortcutEvent = Object.freeze(function (callback, context) {\n    const handle = setTimeout(callback.bind(context), 0);\n    return { dispose() { clearTimeout(handle); } };\n});\nvar CancellationToken;\n(function (CancellationToken) {\n    function isCancellationToken(thing) {\n        if (thing === CancellationToken.None || thing === CancellationToken.Cancelled) {\n            return true;\n        }\n        if (thing instanceof MutableToken) {\n            return true;\n        }\n        if (!thing || typeof thing !== 'object') {\n            return false;\n        }\n        return typeof thing.isCancellationRequested === 'boolean'\n            && typeof thing.onCancellationRequested === 'function';\n    }\n    CancellationToken.isCancellationToken = isCancellationToken;\n    CancellationToken.None = Object.freeze({\n        isCancellationRequested: false,\n        onCancellationRequested: Event.None\n    });\n    CancellationToken.Cancelled = Object.freeze({\n        isCancellationRequested: true,\n        onCancellationRequested: shortcutEvent\n    });\n})(CancellationToken || (CancellationToken = {}));\nclass MutableToken {\n    constructor() {\n        this._isCancelled = false;\n        this._emitter = null;\n    }\n    cancel() {\n        if (!this._isCancelled) {\n            this._isCancelled = true;\n            if (this._emitter) {\n                this._emitter.fire(undefined);\n                this.dispose();\n            }\n        }\n    }\n    get isCancellationRequested() {\n        return this._isCancelled;\n    }\n    get onCancellationRequested() {\n        if (this._isCancelled) {\n            return shortcutEvent;\n        }\n        if (!this._emitter) {\n            this._emitter = new Emitter();\n        }\n        return this._emitter.event;\n    }\n    dispose() {\n        if (this._emitter) {\n            this._emitter.dispose();\n            this._emitter = null;\n        }\n    }\n}\nclass CancellationTokenSource {\n    constructor(parent) {\n        this._token = undefined;\n        this._parentListener = undefined;\n        this._parentListener = parent && parent.onCancellationRequested(this.cancel, this);\n    }\n    get token() {\n        if (!this._token) {\n            // be lazy and create the token only when\n            // actually needed\n            this._token = new MutableToken();\n        }\n        return this._token;\n    }\n    cancel() {\n        if (!this._token) {\n            // save an object by returning the default\n            // cancelled token when cancellation happens\n            // before someone asks for the token\n            this._token = CancellationToken.Cancelled;\n        }\n        else if (this._token instanceof MutableToken) {\n            // actually cancel\n            this._token.cancel();\n        }\n    }\n    dispose(cancel = false) {\n        if (cancel) {\n            this.cancel();\n        }\n        this._parentListener?.dispose();\n        if (!this._token) {\n            // ensure to initialize with an empty token if we had none\n            this._token = CancellationToken.None;\n        }\n        else if (this._token instanceof MutableToken) {\n            // actually dispose\n            this._token.dispose();\n        }\n    }\n}\nfunction cancelOnDispose(store) {\n    const source = new CancellationTokenSource();\n    store.add({ dispose() { source.cancel(); } });\n    return source.token;\n}\n\nexport { CancellationToken, CancellationTokenSource, cancelOnDispose };\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 *--------------------------------------------------------------------------------------------*/\nclass KeyCodeStrMap {\n    constructor() {\n        this._keyCodeToStr = [];\n        this._strToKeyCode = Object.create(null);\n    }\n    define(keyCode, str) {\n        this._keyCodeToStr[keyCode] = str;\n        this._strToKeyCode[str.toLowerCase()] = keyCode;\n    }\n    keyCodeToStr(keyCode) {\n        return this._keyCodeToStr[keyCode];\n    }\n    strToKeyCode(str) {\n        return this._strToKeyCode[str.toLowerCase()] || 0 /* KeyCode.Unknown */;\n    }\n}\nconst uiMap = new KeyCodeStrMap();\nconst userSettingsUSMap = new KeyCodeStrMap();\nconst userSettingsGeneralMap = new KeyCodeStrMap();\nconst EVENT_KEY_CODE_MAP = new Array(230);\nconst scanCodeStrToInt = Object.create(null);\nconst scanCodeLowerCaseStrToInt = Object.create(null);\n/**\n * -1 if a ScanCode => KeyCode mapping depends on kb layout.\n */\nconst IMMUTABLE_CODE_TO_KEY_CODE = [];\nfor (let i = 0; i <= 193 /* ScanCode.MAX_VALUE */; i++) {\n    IMMUTABLE_CODE_TO_KEY_CODE[i] = -1 /* KeyCode.DependsOnKbLayout */;\n}\n(function () {\n    // See https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx\n    // See https://github.com/microsoft/node-native-keymap/blob/88c0b0e5/deps/chromium/keyboard_codes_win.h\n    const empty = '';\n    const mappings = [\n        // immutable, scanCode, scanCodeStr, keyCode, keyCodeStr, eventKeyCode, vkey, usUserSettingsLabel, generalUserSettingsLabel\n        [1, 0 /* ScanCode.None */, 'None', 0 /* KeyCode.Unknown */, 'unknown', 0, 'VK_UNKNOWN', empty, empty],\n        [1, 1 /* ScanCode.Hyper */, 'Hyper', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 2 /* ScanCode.Super */, 'Super', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 3 /* ScanCode.Fn */, 'Fn', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 4 /* ScanCode.FnLock */, 'FnLock', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 5 /* ScanCode.Suspend */, 'Suspend', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 6 /* ScanCode.Resume */, 'Resume', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 7 /* ScanCode.Turbo */, 'Turbo', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 8 /* ScanCode.Sleep */, 'Sleep', 0 /* KeyCode.Unknown */, empty, 0, 'VK_SLEEP', empty, empty],\n        [1, 9 /* ScanCode.WakeUp */, 'WakeUp', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [0, 10 /* ScanCode.KeyA */, 'KeyA', 31 /* KeyCode.KeyA */, 'A', 65, 'VK_A', empty, empty],\n        [0, 11 /* ScanCode.KeyB */, 'KeyB', 32 /* KeyCode.KeyB */, 'B', 66, 'VK_B', empty, empty],\n        [0, 12 /* ScanCode.KeyC */, 'KeyC', 33 /* KeyCode.KeyC */, 'C', 67, 'VK_C', empty, empty],\n        [0, 13 /* ScanCode.KeyD */, 'KeyD', 34 /* KeyCode.KeyD */, 'D', 68, 'VK_D', empty, empty],\n        [0, 14 /* ScanCode.KeyE */, 'KeyE', 35 /* KeyCode.KeyE */, 'E', 69, 'VK_E', empty, empty],\n        [0, 15 /* ScanCode.KeyF */, 'KeyF', 36 /* KeyCode.KeyF */, 'F', 70, 'VK_F', empty, empty],\n        [0, 16 /* ScanCode.KeyG */, 'KeyG', 37 /* KeyCode.KeyG */, 'G', 71, 'VK_G', empty, empty],\n        [0, 17 /* ScanCode.KeyH */, 'KeyH', 38 /* KeyCode.KeyH */, 'H', 72, 'VK_H', empty, empty],\n        [0, 18 /* ScanCode.KeyI */, 'KeyI', 39 /* KeyCode.KeyI */, 'I', 73, 'VK_I', empty, empty],\n        [0, 19 /* ScanCode.KeyJ */, 'KeyJ', 40 /* KeyCode.KeyJ */, 'J', 74, 'VK_J', empty, empty],\n        [0, 20 /* ScanCode.KeyK */, 'KeyK', 41 /* KeyCode.KeyK */, 'K', 75, 'VK_K', empty, empty],\n        [0, 21 /* ScanCode.KeyL */, 'KeyL', 42 /* KeyCode.KeyL */, 'L', 76, 'VK_L', empty, empty],\n        [0, 22 /* ScanCode.KeyM */, 'KeyM', 43 /* KeyCode.KeyM */, 'M', 77, 'VK_M', empty, empty],\n        [0, 23 /* ScanCode.KeyN */, 'KeyN', 44 /* KeyCode.KeyN */, 'N', 78, 'VK_N', empty, empty],\n        [0, 24 /* ScanCode.KeyO */, 'KeyO', 45 /* KeyCode.KeyO */, 'O', 79, 'VK_O', empty, empty],\n        [0, 25 /* ScanCode.KeyP */, 'KeyP', 46 /* KeyCode.KeyP */, 'P', 80, 'VK_P', empty, empty],\n        [0, 26 /* ScanCode.KeyQ */, 'KeyQ', 47 /* KeyCode.KeyQ */, 'Q', 81, 'VK_Q', empty, empty],\n        [0, 27 /* ScanCode.KeyR */, 'KeyR', 48 /* KeyCode.KeyR */, 'R', 82, 'VK_R', empty, empty],\n        [0, 28 /* ScanCode.KeyS */, 'KeyS', 49 /* KeyCode.KeyS */, 'S', 83, 'VK_S', empty, empty],\n        [0, 29 /* ScanCode.KeyT */, 'KeyT', 50 /* KeyCode.KeyT */, 'T', 84, 'VK_T', empty, empty],\n        [0, 30 /* ScanCode.KeyU */, 'KeyU', 51 /* KeyCode.KeyU */, 'U', 85, 'VK_U', empty, empty],\n        [0, 31 /* ScanCode.KeyV */, 'KeyV', 52 /* KeyCode.KeyV */, 'V', 86, 'VK_V', empty, empty],\n        [0, 32 /* ScanCode.KeyW */, 'KeyW', 53 /* KeyCode.KeyW */, 'W', 87, 'VK_W', empty, empty],\n        [0, 33 /* ScanCode.KeyX */, 'KeyX', 54 /* KeyCode.KeyX */, 'X', 88, 'VK_X', empty, empty],\n        [0, 34 /* ScanCode.KeyY */, 'KeyY', 55 /* KeyCode.KeyY */, 'Y', 89, 'VK_Y', empty, empty],\n        [0, 35 /* ScanCode.KeyZ */, 'KeyZ', 56 /* KeyCode.KeyZ */, 'Z', 90, 'VK_Z', empty, empty],\n        [0, 36 /* ScanCode.Digit1 */, 'Digit1', 22 /* KeyCode.Digit1 */, '1', 49, 'VK_1', empty, empty],\n        [0, 37 /* ScanCode.Digit2 */, 'Digit2', 23 /* KeyCode.Digit2 */, '2', 50, 'VK_2', empty, empty],\n        [0, 38 /* ScanCode.Digit3 */, 'Digit3', 24 /* KeyCode.Digit3 */, '3', 51, 'VK_3', empty, empty],\n        [0, 39 /* ScanCode.Digit4 */, 'Digit4', 25 /* KeyCode.Digit4 */, '4', 52, 'VK_4', empty, empty],\n        [0, 40 /* ScanCode.Digit5 */, 'Digit5', 26 /* KeyCode.Digit5 */, '5', 53, 'VK_5', empty, empty],\n        [0, 41 /* ScanCode.Digit6 */, 'Digit6', 27 /* KeyCode.Digit6 */, '6', 54, 'VK_6', empty, empty],\n        [0, 42 /* ScanCode.Digit7 */, 'Digit7', 28 /* KeyCode.Digit7 */, '7', 55, 'VK_7', empty, empty],\n        [0, 43 /* ScanCode.Digit8 */, 'Digit8', 29 /* KeyCode.Digit8 */, '8', 56, 'VK_8', empty, empty],\n        [0, 44 /* ScanCode.Digit9 */, 'Digit9', 30 /* KeyCode.Digit9 */, '9', 57, 'VK_9', empty, empty],\n        [0, 45 /* ScanCode.Digit0 */, 'Digit0', 21 /* KeyCode.Digit0 */, '0', 48, 'VK_0', empty, empty],\n        [1, 46 /* ScanCode.Enter */, 'Enter', 3 /* KeyCode.Enter */, 'Enter', 13, 'VK_RETURN', empty, empty],\n        [1, 47 /* ScanCode.Escape */, 'Escape', 9 /* KeyCode.Escape */, 'Escape', 27, 'VK_ESCAPE', empty, empty],\n        [1, 48 /* ScanCode.Backspace */, 'Backspace', 1 /* KeyCode.Backspace */, 'Backspace', 8, 'VK_BACK', empty, empty],\n        [1, 49 /* ScanCode.Tab */, 'Tab', 2 /* KeyCode.Tab */, 'Tab', 9, 'VK_TAB', empty, empty],\n        [1, 50 /* ScanCode.Space */, 'Space', 10 /* KeyCode.Space */, 'Space', 32, 'VK_SPACE', empty, empty],\n        [0, 51 /* ScanCode.Minus */, 'Minus', 88 /* KeyCode.Minus */, '-', 189, 'VK_OEM_MINUS', '-', 'OEM_MINUS'],\n        [0, 52 /* ScanCode.Equal */, 'Equal', 86 /* KeyCode.Equal */, '=', 187, 'VK_OEM_PLUS', '=', 'OEM_PLUS'],\n        [0, 53 /* ScanCode.BracketLeft */, 'BracketLeft', 92 /* KeyCode.BracketLeft */, '[', 219, 'VK_OEM_4', '[', 'OEM_4'],\n        [0, 54 /* ScanCode.BracketRight */, 'BracketRight', 94 /* KeyCode.BracketRight */, ']', 221, 'VK_OEM_6', ']', 'OEM_6'],\n        [0, 55 /* ScanCode.Backslash */, 'Backslash', 93 /* KeyCode.Backslash */, '\\\\', 220, 'VK_OEM_5', '\\\\', 'OEM_5'],\n        [0, 56 /* ScanCode.IntlHash */, 'IntlHash', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty], // has been dropped from the w3c spec\n        [0, 57 /* ScanCode.Semicolon */, 'Semicolon', 85 /* KeyCode.Semicolon */, ';', 186, 'VK_OEM_1', ';', 'OEM_1'],\n        [0, 58 /* ScanCode.Quote */, 'Quote', 95 /* KeyCode.Quote */, '\\'', 222, 'VK_OEM_7', '\\'', 'OEM_7'],\n        [0, 59 /* ScanCode.Backquote */, 'Backquote', 91 /* KeyCode.Backquote */, '`', 192, 'VK_OEM_3', '`', 'OEM_3'],\n        [0, 60 /* ScanCode.Comma */, 'Comma', 87 /* KeyCode.Comma */, ',', 188, 'VK_OEM_COMMA', ',', 'OEM_COMMA'],\n        [0, 61 /* ScanCode.Period */, 'Period', 89 /* KeyCode.Period */, '.', 190, 'VK_OEM_PERIOD', '.', 'OEM_PERIOD'],\n        [0, 62 /* ScanCode.Slash */, 'Slash', 90 /* KeyCode.Slash */, '/', 191, 'VK_OEM_2', '/', 'OEM_2'],\n        [1, 63 /* ScanCode.CapsLock */, 'CapsLock', 8 /* KeyCode.CapsLock */, 'CapsLock', 20, 'VK_CAPITAL', empty, empty],\n        [1, 64 /* ScanCode.F1 */, 'F1', 59 /* KeyCode.F1 */, 'F1', 112, 'VK_F1', empty, empty],\n        [1, 65 /* ScanCode.F2 */, 'F2', 60 /* KeyCode.F2 */, 'F2', 113, 'VK_F2', empty, empty],\n        [1, 66 /* ScanCode.F3 */, 'F3', 61 /* KeyCode.F3 */, 'F3', 114, 'VK_F3', empty, empty],\n        [1, 67 /* ScanCode.F4 */, 'F4', 62 /* KeyCode.F4 */, 'F4', 115, 'VK_F4', empty, empty],\n        [1, 68 /* ScanCode.F5 */, 'F5', 63 /* KeyCode.F5 */, 'F5', 116, 'VK_F5', empty, empty],\n        [1, 69 /* ScanCode.F6 */, 'F6', 64 /* KeyCode.F6 */, 'F6', 117, 'VK_F6', empty, empty],\n        [1, 70 /* ScanCode.F7 */, 'F7', 65 /* KeyCode.F7 */, 'F7', 118, 'VK_F7', empty, empty],\n        [1, 71 /* ScanCode.F8 */, 'F8', 66 /* KeyCode.F8 */, 'F8', 119, 'VK_F8', empty, empty],\n        [1, 72 /* ScanCode.F9 */, 'F9', 67 /* KeyCode.F9 */, 'F9', 120, 'VK_F9', empty, empty],\n        [1, 73 /* ScanCode.F10 */, 'F10', 68 /* KeyCode.F10 */, 'F10', 121, 'VK_F10', empty, empty],\n        [1, 74 /* ScanCode.F11 */, 'F11', 69 /* KeyCode.F11 */, 'F11', 122, 'VK_F11', empty, empty],\n        [1, 75 /* ScanCode.F12 */, 'F12', 70 /* KeyCode.F12 */, 'F12', 123, 'VK_F12', empty, empty],\n        [1, 76 /* ScanCode.PrintScreen */, 'PrintScreen', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 77 /* ScanCode.ScrollLock */, 'ScrollLock', 84 /* KeyCode.ScrollLock */, 'ScrollLock', 145, 'VK_SCROLL', empty, empty],\n        [1, 78 /* ScanCode.Pause */, 'Pause', 7 /* KeyCode.PauseBreak */, 'PauseBreak', 19, 'VK_PAUSE', empty, empty],\n        [1, 79 /* ScanCode.Insert */, 'Insert', 19 /* KeyCode.Insert */, 'Insert', 45, 'VK_INSERT', empty, empty],\n        [1, 80 /* ScanCode.Home */, 'Home', 14 /* KeyCode.Home */, 'Home', 36, 'VK_HOME', empty, empty],\n        [1, 81 /* ScanCode.PageUp */, 'PageUp', 11 /* KeyCode.PageUp */, 'PageUp', 33, 'VK_PRIOR', empty, empty],\n        [1, 82 /* ScanCode.Delete */, 'Delete', 20 /* KeyCode.Delete */, 'Delete', 46, 'VK_DELETE', empty, empty],\n        [1, 83 /* ScanCode.End */, 'End', 13 /* KeyCode.End */, 'End', 35, 'VK_END', empty, empty],\n        [1, 84 /* ScanCode.PageDown */, 'PageDown', 12 /* KeyCode.PageDown */, 'PageDown', 34, 'VK_NEXT', empty, empty],\n        [1, 85 /* ScanCode.ArrowRight */, 'ArrowRight', 17 /* KeyCode.RightArrow */, 'RightArrow', 39, 'VK_RIGHT', 'Right', empty],\n        [1, 86 /* ScanCode.ArrowLeft */, 'ArrowLeft', 15 /* KeyCode.LeftArrow */, 'LeftArrow', 37, 'VK_LEFT', 'Left', empty],\n        [1, 87 /* ScanCode.ArrowDown */, 'ArrowDown', 18 /* KeyCode.DownArrow */, 'DownArrow', 40, 'VK_DOWN', 'Down', empty],\n        [1, 88 /* ScanCode.ArrowUp */, 'ArrowUp', 16 /* KeyCode.UpArrow */, 'UpArrow', 38, 'VK_UP', 'Up', empty],\n        [1, 89 /* ScanCode.NumLock */, 'NumLock', 83 /* KeyCode.NumLock */, 'NumLock', 144, 'VK_NUMLOCK', empty, empty],\n        [1, 90 /* ScanCode.NumpadDivide */, 'NumpadDivide', 113 /* KeyCode.NumpadDivide */, 'NumPad_Divide', 111, 'VK_DIVIDE', empty, empty],\n        [1, 91 /* ScanCode.NumpadMultiply */, 'NumpadMultiply', 108 /* KeyCode.NumpadMultiply */, 'NumPad_Multiply', 106, 'VK_MULTIPLY', empty, empty],\n        [1, 92 /* ScanCode.NumpadSubtract */, 'NumpadSubtract', 111 /* KeyCode.NumpadSubtract */, 'NumPad_Subtract', 109, 'VK_SUBTRACT', empty, empty],\n        [1, 93 /* ScanCode.NumpadAdd */, 'NumpadAdd', 109 /* KeyCode.NumpadAdd */, 'NumPad_Add', 107, 'VK_ADD', empty, empty],\n        [1, 94 /* ScanCode.NumpadEnter */, 'NumpadEnter', 3 /* KeyCode.Enter */, empty, 0, empty, empty, empty],\n        [1, 95 /* ScanCode.Numpad1 */, 'Numpad1', 99 /* KeyCode.Numpad1 */, 'NumPad1', 97, 'VK_NUMPAD1', empty, empty],\n        [1, 96 /* ScanCode.Numpad2 */, 'Numpad2', 100 /* KeyCode.Numpad2 */, 'NumPad2', 98, 'VK_NUMPAD2', empty, empty],\n        [1, 97 /* ScanCode.Numpad3 */, 'Numpad3', 101 /* KeyCode.Numpad3 */, 'NumPad3', 99, 'VK_NUMPAD3', empty, empty],\n        [1, 98 /* ScanCode.Numpad4 */, 'Numpad4', 102 /* KeyCode.Numpad4 */, 'NumPad4', 100, 'VK_NUMPAD4', empty, empty],\n        [1, 99 /* ScanCode.Numpad5 */, 'Numpad5', 103 /* KeyCode.Numpad5 */, 'NumPad5', 101, 'VK_NUMPAD5', empty, empty],\n        [1, 100 /* ScanCode.Numpad6 */, 'Numpad6', 104 /* KeyCode.Numpad6 */, 'NumPad6', 102, 'VK_NUMPAD6', empty, empty],\n        [1, 101 /* ScanCode.Numpad7 */, 'Numpad7', 105 /* KeyCode.Numpad7 */, 'NumPad7', 103, 'VK_NUMPAD7', empty, empty],\n        [1, 102 /* ScanCode.Numpad8 */, 'Numpad8', 106 /* KeyCode.Numpad8 */, 'NumPad8', 104, 'VK_NUMPAD8', empty, empty],\n        [1, 103 /* ScanCode.Numpad9 */, 'Numpad9', 107 /* KeyCode.Numpad9 */, 'NumPad9', 105, 'VK_NUMPAD9', empty, empty],\n        [1, 104 /* ScanCode.Numpad0 */, 'Numpad0', 98 /* KeyCode.Numpad0 */, 'NumPad0', 96, 'VK_NUMPAD0', empty, empty],\n        [1, 105 /* ScanCode.NumpadDecimal */, 'NumpadDecimal', 112 /* KeyCode.NumpadDecimal */, 'NumPad_Decimal', 110, 'VK_DECIMAL', empty, empty],\n        [0, 106 /* ScanCode.IntlBackslash */, 'IntlBackslash', 97 /* KeyCode.IntlBackslash */, 'OEM_102', 226, 'VK_OEM_102', empty, empty],\n        [1, 107 /* ScanCode.ContextMenu */, 'ContextMenu', 58 /* KeyCode.ContextMenu */, 'ContextMenu', 93, empty, empty, empty],\n        [1, 108 /* ScanCode.Power */, 'Power', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 109 /* ScanCode.NumpadEqual */, 'NumpadEqual', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 110 /* ScanCode.F13 */, 'F13', 71 /* KeyCode.F13 */, 'F13', 124, 'VK_F13', empty, empty],\n        [1, 111 /* ScanCode.F14 */, 'F14', 72 /* KeyCode.F14 */, 'F14', 125, 'VK_F14', empty, empty],\n        [1, 112 /* ScanCode.F15 */, 'F15', 73 /* KeyCode.F15 */, 'F15', 126, 'VK_F15', empty, empty],\n        [1, 113 /* ScanCode.F16 */, 'F16', 74 /* KeyCode.F16 */, 'F16', 127, 'VK_F16', empty, empty],\n        [1, 114 /* ScanCode.F17 */, 'F17', 75 /* KeyCode.F17 */, 'F17', 128, 'VK_F17', empty, empty],\n        [1, 115 /* ScanCode.F18 */, 'F18', 76 /* KeyCode.F18 */, 'F18', 129, 'VK_F18', empty, empty],\n        [1, 116 /* ScanCode.F19 */, 'F19', 77 /* KeyCode.F19 */, 'F19', 130, 'VK_F19', empty, empty],\n        [1, 117 /* ScanCode.F20 */, 'F20', 78 /* KeyCode.F20 */, 'F20', 131, 'VK_F20', empty, empty],\n        [1, 118 /* ScanCode.F21 */, 'F21', 79 /* KeyCode.F21 */, 'F21', 132, 'VK_F21', empty, empty],\n        [1, 119 /* ScanCode.F22 */, 'F22', 80 /* KeyCode.F22 */, 'F22', 133, 'VK_F22', empty, empty],\n        [1, 120 /* ScanCode.F23 */, 'F23', 81 /* KeyCode.F23 */, 'F23', 134, 'VK_F23', empty, empty],\n        [1, 121 /* ScanCode.F24 */, 'F24', 82 /* KeyCode.F24 */, 'F24', 135, 'VK_F24', empty, empty],\n        [1, 122 /* ScanCode.Open */, 'Open', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 123 /* ScanCode.Help */, 'Help', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 124 /* ScanCode.Select */, 'Select', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 125 /* ScanCode.Again */, 'Again', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 126 /* ScanCode.Undo */, 'Undo', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 127 /* ScanCode.Cut */, 'Cut', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 128 /* ScanCode.Copy */, 'Copy', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 129 /* ScanCode.Paste */, 'Paste', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 130 /* ScanCode.Find */, 'Find', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 131 /* ScanCode.AudioVolumeMute */, 'AudioVolumeMute', 117 /* KeyCode.AudioVolumeMute */, 'AudioVolumeMute', 173, 'VK_VOLUME_MUTE', empty, empty],\n        [1, 132 /* ScanCode.AudioVolumeUp */, 'AudioVolumeUp', 118 /* KeyCode.AudioVolumeUp */, 'AudioVolumeUp', 175, 'VK_VOLUME_UP', empty, empty],\n        [1, 133 /* ScanCode.AudioVolumeDown */, 'AudioVolumeDown', 119 /* KeyCode.AudioVolumeDown */, 'AudioVolumeDown', 174, 'VK_VOLUME_DOWN', empty, empty],\n        [1, 134 /* ScanCode.NumpadComma */, 'NumpadComma', 110 /* KeyCode.NUMPAD_SEPARATOR */, 'NumPad_Separator', 108, 'VK_SEPARATOR', empty, empty],\n        [0, 135 /* ScanCode.IntlRo */, 'IntlRo', 115 /* KeyCode.ABNT_C1 */, 'ABNT_C1', 193, 'VK_ABNT_C1', empty, empty],\n        [1, 136 /* ScanCode.KanaMode */, 'KanaMode', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [0, 137 /* ScanCode.IntlYen */, 'IntlYen', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 138 /* ScanCode.Convert */, 'Convert', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 139 /* ScanCode.NonConvert */, 'NonConvert', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 140 /* ScanCode.Lang1 */, 'Lang1', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 141 /* ScanCode.Lang2 */, 'Lang2', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 142 /* ScanCode.Lang3 */, 'Lang3', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 143 /* ScanCode.Lang4 */, 'Lang4', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 144 /* ScanCode.Lang5 */, 'Lang5', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 145 /* ScanCode.Abort */, 'Abort', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 146 /* ScanCode.Props */, 'Props', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 147 /* ScanCode.NumpadParenLeft */, 'NumpadParenLeft', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 148 /* ScanCode.NumpadParenRight */, 'NumpadParenRight', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 149 /* ScanCode.NumpadBackspace */, 'NumpadBackspace', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 150 /* ScanCode.NumpadMemoryStore */, 'NumpadMemoryStore', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 151 /* ScanCode.NumpadMemoryRecall */, 'NumpadMemoryRecall', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 152 /* ScanCode.NumpadMemoryClear */, 'NumpadMemoryClear', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 153 /* ScanCode.NumpadMemoryAdd */, 'NumpadMemoryAdd', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 154 /* ScanCode.NumpadMemorySubtract */, 'NumpadMemorySubtract', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 155 /* ScanCode.NumpadClear */, 'NumpadClear', 131 /* KeyCode.Clear */, 'Clear', 12, 'VK_CLEAR', empty, empty],\n        [1, 156 /* ScanCode.NumpadClearEntry */, 'NumpadClearEntry', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 5 /* KeyCode.Ctrl */, 'Ctrl', 17, 'VK_CONTROL', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 4 /* KeyCode.Shift */, 'Shift', 16, 'VK_SHIFT', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 6 /* KeyCode.Alt */, 'Alt', 18, 'VK_MENU', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 57 /* KeyCode.Meta */, 'Meta', 91, 'VK_COMMAND', empty, empty],\n        [1, 157 /* ScanCode.ControlLeft */, 'ControlLeft', 5 /* KeyCode.Ctrl */, empty, 0, 'VK_LCONTROL', empty, empty],\n        [1, 158 /* ScanCode.ShiftLeft */, 'ShiftLeft', 4 /* KeyCode.Shift */, empty, 0, 'VK_LSHIFT', empty, empty],\n        [1, 159 /* ScanCode.AltLeft */, 'AltLeft', 6 /* KeyCode.Alt */, empty, 0, 'VK_LMENU', empty, empty],\n        [1, 160 /* ScanCode.MetaLeft */, 'MetaLeft', 57 /* KeyCode.Meta */, empty, 0, 'VK_LWIN', empty, empty],\n        [1, 161 /* ScanCode.ControlRight */, 'ControlRight', 5 /* KeyCode.Ctrl */, empty, 0, 'VK_RCONTROL', empty, empty],\n        [1, 162 /* ScanCode.ShiftRight */, 'ShiftRight', 4 /* KeyCode.Shift */, empty, 0, 'VK_RSHIFT', empty, empty],\n        [1, 163 /* ScanCode.AltRight */, 'AltRight', 6 /* KeyCode.Alt */, empty, 0, 'VK_RMENU', empty, empty],\n        [1, 164 /* ScanCode.MetaRight */, 'MetaRight', 57 /* KeyCode.Meta */, empty, 0, 'VK_RWIN', empty, empty],\n        [1, 165 /* ScanCode.BrightnessUp */, 'BrightnessUp', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 166 /* ScanCode.BrightnessDown */, 'BrightnessDown', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 167 /* ScanCode.MediaPlay */, 'MediaPlay', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 168 /* ScanCode.MediaRecord */, 'MediaRecord', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 169 /* ScanCode.MediaFastForward */, 'MediaFastForward', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 170 /* ScanCode.MediaRewind */, 'MediaRewind', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 171 /* ScanCode.MediaTrackNext */, 'MediaTrackNext', 124 /* KeyCode.MediaTrackNext */, 'MediaTrackNext', 176, 'VK_MEDIA_NEXT_TRACK', empty, empty],\n        [1, 172 /* ScanCode.MediaTrackPrevious */, 'MediaTrackPrevious', 125 /* KeyCode.MediaTrackPrevious */, 'MediaTrackPrevious', 177, 'VK_MEDIA_PREV_TRACK', empty, empty],\n        [1, 173 /* ScanCode.MediaStop */, 'MediaStop', 126 /* KeyCode.MediaStop */, 'MediaStop', 178, 'VK_MEDIA_STOP', empty, empty],\n        [1, 174 /* ScanCode.Eject */, 'Eject', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 175 /* ScanCode.MediaPlayPause */, 'MediaPlayPause', 127 /* KeyCode.MediaPlayPause */, 'MediaPlayPause', 179, 'VK_MEDIA_PLAY_PAUSE', empty, empty],\n        [1, 176 /* ScanCode.MediaSelect */, 'MediaSelect', 128 /* KeyCode.LaunchMediaPlayer */, 'LaunchMediaPlayer', 181, 'VK_MEDIA_LAUNCH_MEDIA_SELECT', empty, empty],\n        [1, 177 /* ScanCode.LaunchMail */, 'LaunchMail', 129 /* KeyCode.LaunchMail */, 'LaunchMail', 180, 'VK_MEDIA_LAUNCH_MAIL', empty, empty],\n        [1, 178 /* ScanCode.LaunchApp2 */, 'LaunchApp2', 130 /* KeyCode.LaunchApp2 */, 'LaunchApp2', 183, 'VK_MEDIA_LAUNCH_APP2', empty, empty],\n        [1, 179 /* ScanCode.LaunchApp1 */, 'LaunchApp1', 0 /* KeyCode.Unknown */, empty, 0, 'VK_MEDIA_LAUNCH_APP1', empty, empty],\n        [1, 180 /* ScanCode.SelectTask */, 'SelectTask', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 181 /* ScanCode.LaunchScreenSaver */, 'LaunchScreenSaver', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 182 /* ScanCode.BrowserSearch */, 'BrowserSearch', 120 /* KeyCode.BrowserSearch */, 'BrowserSearch', 170, 'VK_BROWSER_SEARCH', empty, empty],\n        [1, 183 /* ScanCode.BrowserHome */, 'BrowserHome', 121 /* KeyCode.BrowserHome */, 'BrowserHome', 172, 'VK_BROWSER_HOME', empty, empty],\n        [1, 184 /* ScanCode.BrowserBack */, 'BrowserBack', 122 /* KeyCode.BrowserBack */, 'BrowserBack', 166, 'VK_BROWSER_BACK', empty, empty],\n        [1, 185 /* ScanCode.BrowserForward */, 'BrowserForward', 123 /* KeyCode.BrowserForward */, 'BrowserForward', 167, 'VK_BROWSER_FORWARD', empty, empty],\n        [1, 186 /* ScanCode.BrowserStop */, 'BrowserStop', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_STOP', empty, empty],\n        [1, 187 /* ScanCode.BrowserRefresh */, 'BrowserRefresh', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_REFRESH', empty, empty],\n        [1, 188 /* ScanCode.BrowserFavorites */, 'BrowserFavorites', 0 /* KeyCode.Unknown */, empty, 0, 'VK_BROWSER_FAVORITES', empty, empty],\n        [1, 189 /* ScanCode.ZoomToggle */, 'ZoomToggle', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 190 /* ScanCode.MailReply */, 'MailReply', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 191 /* ScanCode.MailForward */, 'MailForward', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        [1, 192 /* ScanCode.MailSend */, 'MailSend', 0 /* KeyCode.Unknown */, empty, 0, empty, empty, empty],\n        // See https://lists.w3.org/Archives/Public/www-dom/2010JulSep/att-0182/keyCode-spec.html\n        // If an Input Method Editor is processing key input and the event is keydown, return 229.\n        [1, 0 /* ScanCode.None */, empty, 114 /* KeyCode.KEY_IN_COMPOSITION */, 'KeyInComposition', 229, empty, empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 116 /* KeyCode.ABNT_C2 */, 'ABNT_C2', 194, 'VK_ABNT_C2', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 96 /* KeyCode.OEM_8 */, 'OEM_8', 223, 'VK_OEM_8', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_KANA', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HANGUL', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_JUNJA', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_FINAL', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HANJA', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_KANJI', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_CONVERT', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_NONCONVERT', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ACCEPT', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_MODECHANGE', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_SELECT', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PRINT', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EXECUTE', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_SNAPSHOT', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_HELP', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_APPS', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PROCESSKEY', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PACKET', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_DBE_SBCSCHAR', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_DBE_DBCSCHAR', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ATTN', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_CRSEL', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EXSEL', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_EREOF', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PLAY', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_ZOOM', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_NONAME', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_PA1', empty, empty],\n        [1, 0 /* ScanCode.None */, empty, 0 /* KeyCode.Unknown */, empty, 0, 'VK_OEM_CLEAR', empty, empty],\n    ];\n    const seenKeyCode = [];\n    const seenScanCode = [];\n    for (const mapping of mappings) {\n        const [immutable, scanCode, scanCodeStr, keyCode, keyCodeStr, eventKeyCode, vkey, usUserSettingsLabel, generalUserSettingsLabel] = mapping;\n        if (!seenScanCode[scanCode]) {\n            seenScanCode[scanCode] = true;\n            scanCodeStrToInt[scanCodeStr] = scanCode;\n            scanCodeLowerCaseStrToInt[scanCodeStr.toLowerCase()] = scanCode;\n            if (immutable) {\n                IMMUTABLE_CODE_TO_KEY_CODE[scanCode] = keyCode;\n            }\n        }\n        if (!seenKeyCode[keyCode]) {\n            seenKeyCode[keyCode] = true;\n            if (!keyCodeStr) {\n                throw new Error(`String representation missing for key code ${keyCode} around scan code ${scanCodeStr}`);\n            }\n            uiMap.define(keyCode, keyCodeStr);\n            userSettingsUSMap.define(keyCode, usUserSettingsLabel || keyCodeStr);\n            userSettingsGeneralMap.define(keyCode, generalUserSettingsLabel || usUserSettingsLabel || keyCodeStr);\n        }\n        if (eventKeyCode) {\n            EVENT_KEY_CODE_MAP[eventKeyCode] = keyCode;\n        }\n    }\n})();\nvar KeyCodeUtils;\n(function (KeyCodeUtils) {\n    function toString(keyCode) {\n        return uiMap.keyCodeToStr(keyCode);\n    }\n    KeyCodeUtils.toString = toString;\n    function fromString(key) {\n        return uiMap.strToKeyCode(key);\n    }\n    KeyCodeUtils.fromString = fromString;\n    function toUserSettingsUS(keyCode) {\n        return userSettingsUSMap.keyCodeToStr(keyCode);\n    }\n    KeyCodeUtils.toUserSettingsUS = toUserSettingsUS;\n    function toUserSettingsGeneral(keyCode) {\n        return userSettingsGeneralMap.keyCodeToStr(keyCode);\n    }\n    KeyCodeUtils.toUserSettingsGeneral = toUserSettingsGeneral;\n    function fromUserSettings(key) {\n        return userSettingsUSMap.strToKeyCode(key) || userSettingsGeneralMap.strToKeyCode(key);\n    }\n    KeyCodeUtils.fromUserSettings = fromUserSettings;\n    function toElectronAccelerator(keyCode) {\n        if (keyCode >= 98 /* KeyCode.Numpad0 */ && keyCode <= 113 /* KeyCode.NumpadDivide */) {\n            // [Electron Accelerators] Electron is able to parse numpad keys, but unfortunately it\n            // renders them just as regular keys in menus. For example, num0 is rendered as \"0\",\n            // numdiv is rendered as \"/\", numsub is rendered as \"-\".\n            //\n            // This can lead to incredible confusion, as it makes numpad based keybindings indistinguishable\n            // from keybindings based on regular keys.\n            //\n            // We therefore need to fall back to custom rendering for numpad keys.\n            return null;\n        }\n        switch (keyCode) {\n            case 16 /* KeyCode.UpArrow */:\n                return 'Up';\n            case 18 /* KeyCode.DownArrow */:\n                return 'Down';\n            case 15 /* KeyCode.LeftArrow */:\n                return 'Left';\n            case 17 /* KeyCode.RightArrow */:\n                return 'Right';\n        }\n        return uiMap.keyCodeToStr(keyCode);\n    }\n    KeyCodeUtils.toElectronAccelerator = toElectronAccelerator;\n})(KeyCodeUtils || (KeyCodeUtils = {}));\nfunction KeyChord(firstPart, secondPart) {\n    const chordPart = ((secondPart & 0x0000FFFF) << 16) >>> 0;\n    return (firstPart | chordPart) >>> 0;\n}\n\nexport { EVENT_KEY_CODE_MAP, IMMUTABLE_CODE_TO_KEY_CODE, KeyChord, KeyCodeUtils };\n","import { isWindows, isMacintosh } from './platform.js';\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 *--------------------------------------------------------------------------------------------*/\nlet safeProcess;\n// Native sandbox environment\nconst vscodeGlobal = globalThis.vscode;\nif (typeof vscodeGlobal !== 'undefined' && typeof vscodeGlobal.process !== 'undefined') {\n    const sandboxProcess = vscodeGlobal.process;\n    safeProcess = {\n        get platform() { return sandboxProcess.platform; },\n        get arch() { return sandboxProcess.arch; },\n        get env() { return sandboxProcess.env; },\n        cwd() { return sandboxProcess.cwd(); }\n    };\n}\n// Native node.js environment\nelse if (typeof process !== 'undefined' && typeof process?.versions?.node === 'string') {\n    safeProcess = {\n        get platform() { return process.platform; },\n        get arch() { return process.arch; },\n        get env() { return process.env; },\n        cwd() { return process.env['VSCODE_CWD'] || process.cwd(); }\n    };\n}\n// Web environment\nelse {\n    safeProcess = {\n        // Supported\n        get platform() { return isWindows ? 'win32' : isMacintosh ? 'darwin' : 'linux'; },\n        get arch() { return undefined; /* arch is undefined in web */ },\n        // Unsupported\n        get env() { return {}; },\n        cwd() { return '/'; }\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 */\nconst cwd = safeProcess.cwd;\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 */\nconst env = safeProcess.env;\n/**\n * Provides safe access to the `platform` property in node.js, sandboxed or web\n * environments.\n */\nconst platform = safeProcess.platform;\n\nexport { cwd, env, platform };\n","import { cwd, env, platform } from './process.js';\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// 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/v22.15.0/lib/path.js\n// Excluding: the change that adds primordials\n// (https://github.com/nodejs/node/commit/187a862d221dec42fa9a5c4214e7034d9092792f and others)\n// Excluding: the change that adds glob matching\n// (https://github.com/nodejs/node/commit/57b8b8e18e5e2007114c63b71bf0baedc01936a6)\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 */\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; /* ? */\nclass ErrorInvalidArgType extends Error {\n    constructor(name, expected, actual) {\n        // determiner: 'must be' or 'must not be'\n        let determiner;\n        if (typeof expected === 'string' && expected.indexOf('not ') === 0) {\n            determiner = 'must not be';\n            expected = expected.replace(/^not /, '');\n        }\n        else {\n            determiner = 'must be';\n        }\n        const type = name.indexOf('.') !== -1 ? 'property' : 'argument';\n        let msg = `The \"${name}\" ${type} ${determiner} of type ${expected}`;\n        msg += `. Received type ${typeof actual}`;\n        super(msg);\n        this.code = 'ERR_INVALID_ARG_TYPE';\n    }\n}\nfunction validateObject(pathObject, name) {\n    if (pathObject === null || typeof pathObject !== 'object') {\n        throw new ErrorInvalidArgType(name, 'Object', pathObject);\n    }\n}\nfunction validateString(value, name) {\n    if (typeof value !== 'string') {\n        throw new ErrorInvalidArgType(name, 'string', value);\n    }\n}\nconst platformIsWin32 = (platform === 'win32');\nfunction isPathSeparator(code) {\n    return code === CHAR_FORWARD_SLASH || code === CHAR_BACKWARD_SLASH;\n}\nfunction isPosixPathSeparator(code) {\n    return code === CHAR_FORWARD_SLASH;\n}\nfunction isWindowsDeviceRoot(code) {\n    return (code >= CHAR_UPPERCASE_A && code <= CHAR_UPPERCASE_Z) ||\n        (code >= CHAR_LOWERCASE_A && code <= CHAR_LOWERCASE_Z);\n}\n// Resolves . and .. elements in a path with directory names\nfunction normalizeString(path, allowAboveRoot, separator, isPathSeparator) {\n    let res = '';\n    let lastSegmentLength = 0;\n    let lastSlash = -1;\n    let dots = 0;\n    let code = 0;\n    for (let i = 0; i <= path.length; ++i) {\n        if (i < path.length) {\n            code = path.charCodeAt(i);\n        }\n        else if (isPathSeparator(code)) {\n            break;\n        }\n        else {\n            code = CHAR_FORWARD_SLASH;\n        }\n        if (isPathSeparator(code)) {\n            if (lastSlash === i - 1 || dots === 1) ;\n            else if (dots === 2) {\n                if (res.length < 2 || lastSegmentLength !== 2 ||\n                    res.charCodeAt(res.length - 1) !== CHAR_DOT ||\n                    res.charCodeAt(res.length - 2) !== CHAR_DOT) {\n                    if (res.length > 2) {\n                        const lastSlashIndex = res.lastIndexOf(separator);\n                        if (lastSlashIndex === -1) {\n                            res = '';\n                            lastSegmentLength = 0;\n                        }\n                        else {\n                            res = res.slice(0, lastSlashIndex);\n                            lastSegmentLength = res.length - 1 - res.lastIndexOf(separator);\n                        }\n                        lastSlash = i;\n                        dots = 0;\n                        continue;\n                    }\n                    else if (res.length !== 0) {\n                        res = '';\n                        lastSegmentLength = 0;\n                        lastSlash = i;\n                        dots = 0;\n                        continue;\n                    }\n                }\n                if (allowAboveRoot) {\n                    res += res.length > 0 ? `${separator}..` : '..';\n                    lastSegmentLength = 2;\n                }\n            }\n            else {\n                if (res.length > 0) {\n                    res += `${separator}${path.slice(lastSlash + 1, i)}`;\n                }\n                else {\n                    res = path.slice(lastSlash + 1, i);\n                }\n                lastSegmentLength = i - lastSlash - 1;\n            }\n            lastSlash = i;\n            dots = 0;\n        }\n        else if (code === CHAR_DOT && dots !== -1) {\n            ++dots;\n        }\n        else {\n            dots = -1;\n        }\n    }\n    return res;\n}\nfunction formatExt(ext) {\n    return ext ? `${ext[0] === '.' ? '' : '.'}${ext}` : '';\n}\nfunction _format(sep, pathObject) {\n    validateObject(pathObject, 'pathObject');\n    const dir = pathObject.dir || pathObject.root;\n    const base = pathObject.base ||\n        `${pathObject.name || ''}${formatExt(pathObject.ext)}`;\n    if (!dir) {\n        return base;\n    }\n    return dir === pathObject.root ? `${dir}${base}` : `${dir}${sep}${base}`;\n}\nconst win32 = {\n    // path.resolve([from ...], to)\n    resolve(...pathSegments) {\n        let resolvedDevice = '';\n        let resolvedTail = '';\n        let resolvedAbsolute = false;\n        for (let i = pathSegments.length - 1; i >= -1; i--) {\n            let path;\n            if (i >= 0) {\n                path = pathSegments[i];\n                validateString(path, `paths[${i}]`);\n                // Skip empty entries\n                if (path.length === 0) {\n                    continue;\n                }\n            }\n            else if (resolvedDevice.length === 0) {\n                path = cwd();\n            }\n            else {\n                // Windows has the concept of drive-specific current working\n                // directories. If we've resolved a drive letter but not yet an\n                // absolute path, get cwd for that drive, or the process cwd if\n                // the drive cwd is not available. We're sure the device is not\n                // a UNC path at this points, because UNC paths are always absolute.\n                path = env[`=${resolvedDevice}`] || cwd();\n                // Verify that a cwd was found and that it actually points\n                // to our drive. If not, default to the drive's root.\n                if (path === undefined ||\n                    (path.slice(0, 2).toLowerCase() !== resolvedDevice.toLowerCase() &&\n                        path.charCodeAt(2) === CHAR_BACKWARD_SLASH)) {\n                    path = `${resolvedDevice}\\\\`;\n                }\n            }\n            const len = path.length;\n            let rootEnd = 0;\n            let device = '';\n            let isAbsolute = false;\n            const code = path.charCodeAt(0);\n            // Try to match a root\n            if (len === 1) {\n                if (isPathSeparator(code)) {\n                    // `path` contains just a path separator\n                    rootEnd = 1;\n                    isAbsolute = true;\n                }\n            }\n            else if (isPathSeparator(code)) {\n                // Possible UNC root\n                // If we started with a separator, we know we at least have an\n                // absolute path of some kind (UNC or otherwise)\n                isAbsolute = true;\n                if (isPathSeparator(path.charCodeAt(1))) {\n                    // Matched double path separator at beginning\n                    let j = 2;\n                    let last = j;\n                    // Match 1 or more non-path separators\n                    while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n                        j++;\n                    }\n                    if (j < len && j !== last) {\n                        const firstPart = path.slice(last, j);\n                        // Matched!\n                        last = j;\n                        // Match 1 or more path separators\n                        while (j < len && isPathSeparator(path.charCodeAt(j))) {\n                            j++;\n                        }\n                        if (j < len && j !== last) {\n                            // Matched!\n                            last = j;\n                            // Match 1 or more non-path separators\n                            while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n                                j++;\n                            }\n                            if (j === len || j !== last) {\n                                // We matched a UNC root\n                                device = `\\\\\\\\${firstPart}\\\\${path.slice(last, j)}`;\n                                rootEnd = j;\n                            }\n                        }\n                    }\n                }\n                else {\n                    rootEnd = 1;\n                }\n            }\n            else if (isWindowsDeviceRoot(code) &&\n                path.charCodeAt(1) === CHAR_COLON) {\n                // Possible device root\n                device = path.slice(0, 2);\n                rootEnd = 2;\n                if (len > 2 && isPathSeparator(path.charCodeAt(2))) {\n                    // Treat separator following drive name as an absolute path\n                    // indicator\n                    isAbsolute = true;\n                    rootEnd = 3;\n                }\n            }\n            if (device.length > 0) {\n                if (resolvedDevice.length > 0) {\n                    if (device.toLowerCase() !== resolvedDevice.toLowerCase()) {\n                        // This path points to another device so it is not applicable\n                        continue;\n                    }\n                }\n                else {\n                    resolvedDevice = device;\n                }\n            }\n            if (resolvedAbsolute) {\n                if (resolvedDevice.length > 0) {\n                    break;\n                }\n            }\n            else {\n                resolvedTail = `${path.slice(rootEnd)}\\\\${resolvedTail}`;\n                resolvedAbsolute = isAbsolute;\n                if (isAbsolute && resolvedDevice.length > 0) {\n                    break;\n                }\n            }\n        }\n        // At this point the path should be resolved to a full absolute path,\n        // but handle relative paths to be safe (might happen when process.cwd()\n        // fails)\n        // Normalize the tail path\n        resolvedTail = normalizeString(resolvedTail, !resolvedAbsolute, '\\\\', isPathSeparator);\n        return resolvedAbsolute ?\n            `${resolvedDevice}\\\\${resolvedTail}` :\n            `${resolvedDevice}${resolvedTail}` || '.';\n    },\n    normalize(path) {\n        validateString(path, 'path');\n        const len = path.length;\n        if (len === 0) {\n            return '.';\n        }\n        let rootEnd = 0;\n        let device;\n        let isAbsolute = false;\n        const code = path.charCodeAt(0);\n        // Try to match a root\n        if (len === 1) {\n            // `path` contains just a single char, exit early to avoid\n            // unnecessary work\n            return isPosixPathSeparator(code) ? '\\\\' : path;\n        }\n        if (isPathSeparator(code)) {\n            // Possible UNC root\n            // If we started with a separator, we know we at least have an absolute\n            // path of some kind (UNC or otherwise)\n            isAbsolute = true;\n            if (isPathSeparator(path.charCodeAt(1))) {\n                // Matched double path separator at beginning\n                let j = 2;\n                let last = j;\n                // Match 1 or more non-path separators\n                while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n                    j++;\n                }\n                if (j < len && j !== last) {\n                    const firstPart = path.slice(last, j);\n                    // Matched!\n                    last = j;\n                    // Match 1 or more path separators\n                    while (j < len && isPathSeparator(path.charCodeAt(j))) {\n                        j++;\n                    }\n                    if (j < len && j !== last) {\n                        // Matched!\n                        last = j;\n                        // Match 1 or more non-path separators\n                        while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n                            j++;\n                        }\n                        if (j === len) {\n                            // We matched a UNC root only\n                            // Return the normalized version of the UNC root since there\n                            // is nothing left to process\n                            return `\\\\\\\\${firstPart}\\\\${path.slice(last)}\\\\`;\n                        }\n                        if (j !== last) {\n                            // We matched a UNC root with leftovers\n                            device = `\\\\\\\\${firstPart}\\\\${path.slice(last, j)}`;\n                            rootEnd = j;\n                        }\n                    }\n                }\n            }\n            else {\n                rootEnd = 1;\n            }\n        }\n        else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n            // Possible device root\n            device = path.slice(0, 2);\n            rootEnd = 2;\n            if (len > 2 && isPathSeparator(path.charCodeAt(2))) {\n                // Treat separator following drive name as an absolute path\n                // indicator\n                isAbsolute = true;\n                rootEnd = 3;\n            }\n        }\n        let tail = rootEnd < len ?\n            normalizeString(path.slice(rootEnd), !isAbsolute, '\\\\', isPathSeparator) :\n            '';\n        if (tail.length === 0 && !isAbsolute) {\n            tail = '.';\n        }\n        if (tail.length > 0 && isPathSeparator(path.charCodeAt(len - 1))) {\n            tail += '\\\\';\n        }\n        if (!isAbsolute && device === undefined && path.includes(':')) {\n            // If the original path was not absolute and if we have not been able to\n            // resolve it relative to a particular device, we need to ensure that the\n            // `tail` has not become something that Windows might interpret as an\n            // absolute path. See CVE-2024-36139.\n            if (tail.length >= 2 &&\n                isWindowsDeviceRoot(tail.charCodeAt(0)) &&\n                tail.charCodeAt(1) === CHAR_COLON) {\n                return `.\\\\${tail}`;\n            }\n            let index = path.indexOf(':');\n            do {\n                if (index === len - 1 || isPathSeparator(path.charCodeAt(index + 1))) {\n                    return `.\\\\${tail}`;\n                }\n            } while ((index = path.indexOf(':', index + 1)) !== -1);\n        }\n        if (device === undefined) {\n            return isAbsolute ? `\\\\${tail}` : tail;\n        }\n        return isAbsolute ? `${device}\\\\${tail}` : `${device}${tail}`;\n    },\n    isAbsolute(path) {\n        validateString(path, 'path');\n        const len = path.length;\n        if (len === 0) {\n            return false;\n        }\n        const code = path.charCodeAt(0);\n        return isPathSeparator(code) ||\n            // Possible device root\n            (len > 2 &&\n                isWindowsDeviceRoot(code) &&\n                path.charCodeAt(1) === CHAR_COLON &&\n                isPathSeparator(path.charCodeAt(2)));\n    },\n    join(...paths) {\n        if (paths.length === 0) {\n            return '.';\n        }\n        let joined;\n        let firstPart;\n        for (let i = 0; i < paths.length; ++i) {\n            const arg = paths[i];\n            validateString(arg, 'path');\n            if (arg.length > 0) {\n                if (joined === undefined) {\n                    joined = firstPart = arg;\n                }\n                else {\n                    joined += `\\\\${arg}`;\n                }\n            }\n        }\n        if (joined === undefined) {\n            return '.';\n        }\n        // Make sure that the joined path doesn't start with two slashes, because\n        // normalize() will mistake it for a UNC path then.\n        //\n        // This step is skipped when it is very clear that the user actually\n        // intended to point at a UNC path. This is assumed when the first\n        // non-empty string arguments starts with exactly two slashes followed by\n        // at least one more non-slash character.\n        //\n        // Note that for normalize() to treat a path as a UNC path it needs to\n        // have at least 2 components, so we don't filter for that here.\n        // This means that the user can use join to construct UNC paths from\n        // a server name and a share name; for example:\n        //   path.join('//server', 'share') -> '\\\\\\\\server\\\\share\\\\')\n        let needsReplace = true;\n        let slashCount = 0;\n        if (typeof firstPart === 'string' && isPathSeparator(firstPart.charCodeAt(0))) {\n            ++slashCount;\n            const firstLen = firstPart.length;\n            if (firstLen > 1 && isPathSeparator(firstPart.charCodeAt(1))) {\n                ++slashCount;\n                if (firstLen > 2) {\n                    if (isPathSeparator(firstPart.charCodeAt(2))) {\n                        ++slashCount;\n                    }\n                    else {\n                        // We matched a UNC path in the first part\n                        needsReplace = false;\n                    }\n                }\n            }\n        }\n        if (needsReplace) {\n            // Find any more consecutive slashes we need to replace\n            while (slashCount < joined.length &&\n                isPathSeparator(joined.charCodeAt(slashCount))) {\n                slashCount++;\n            }\n            // Replace the slashes if needed\n            if (slashCount >= 2) {\n                joined = `\\\\${joined.slice(slashCount)}`;\n            }\n        }\n        return win32.normalize(joined);\n    },\n    // It will solve the relative path from `from` to `to`, for instance:\n    //  from = 'C:\\\\orandea\\\\test\\\\aaa'\n    //  to = 'C:\\\\orandea\\\\impl\\\\bbb'\n    // The output of the function should be: '..\\\\..\\\\impl\\\\bbb'\n    relative(from, to) {\n        validateString(from, 'from');\n        validateString(to, 'to');\n        if (from === to) {\n            return '';\n        }\n        const fromOrig = win32.resolve(from);\n        const toOrig = win32.resolve(to);\n        if (fromOrig === toOrig) {\n            return '';\n        }\n        from = fromOrig.toLowerCase();\n        to = toOrig.toLowerCase();\n        if (from === to) {\n            return '';\n        }\n        if (fromOrig.length !== from.length || toOrig.length !== to.length) {\n            const fromSplit = fromOrig.split('\\\\');\n            const toSplit = toOrig.split('\\\\');\n            if (fromSplit[fromSplit.length - 1] === '') {\n                fromSplit.pop();\n            }\n            if (toSplit[toSplit.length - 1] === '') {\n                toSplit.pop();\n            }\n            const fromLen = fromSplit.length;\n            const toLen = toSplit.length;\n            const length = fromLen < toLen ? fromLen : toLen;\n            let i;\n            for (i = 0; i < length; i++) {\n                if (fromSplit[i].toLowerCase() !== toSplit[i].toLowerCase()) {\n                    break;\n                }\n            }\n            if (i === 0) {\n                return toOrig;\n            }\n            else if (i === length) {\n                if (toLen > length) {\n                    return toSplit.slice(i).join('\\\\');\n                }\n                if (fromLen > length) {\n                    return '..\\\\'.repeat(fromLen - 1 - i) + '..';\n                }\n                return '';\n            }\n            return '..\\\\'.repeat(fromLen - i) + toSplit.slice(i).join('\\\\');\n        }\n        // Trim any leading backslashes\n        let fromStart = 0;\n        while (fromStart < from.length &&\n            from.charCodeAt(fromStart) === CHAR_BACKWARD_SLASH) {\n            fromStart++;\n        }\n        // Trim trailing backslashes (applicable to UNC paths only)\n        let fromEnd = from.length;\n        while (fromEnd - 1 > fromStart &&\n            from.charCodeAt(fromEnd - 1) === CHAR_BACKWARD_SLASH) {\n            fromEnd--;\n        }\n        const fromLen = fromEnd - fromStart;\n        // Trim any leading backslashes\n        let toStart = 0;\n        while (toStart < to.length &&\n            to.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {\n            toStart++;\n        }\n        // Trim trailing backslashes (applicable to UNC paths only)\n        let toEnd = to.length;\n        while (toEnd - 1 > toStart &&\n            to.charCodeAt(toEnd - 1) === CHAR_BACKWARD_SLASH) {\n            toEnd--;\n        }\n        const toLen = toEnd - toStart;\n        // Compare paths to find the longest common path from root\n        const length = fromLen < toLen ? fromLen : toLen;\n        let lastCommonSep = -1;\n        let i = 0;\n        for (; i < length; i++) {\n            const fromCode = from.charCodeAt(fromStart + i);\n            if (fromCode !== to.charCodeAt(toStart + i)) {\n                break;\n            }\n            else if (fromCode === CHAR_BACKWARD_SLASH) {\n                lastCommonSep = i;\n            }\n        }\n        // We found a mismatch before the first common path separator was seen, so\n        // return the original `to`.\n        if (i !== length) {\n            if (lastCommonSep === -1) {\n                return toOrig;\n            }\n        }\n        else {\n            if (toLen > length) {\n                if (to.charCodeAt(toStart + i) === CHAR_BACKWARD_SLASH) {\n                    // We get here if `from` is the exact base path for `to`.\n                    // For example: from='C:\\\\foo\\\\bar'; to='C:\\\\foo\\\\bar\\\\baz'\n                    return toOrig.slice(toStart + i + 1);\n                }\n                if (i === 2) {\n                    // We get here if `from` is the device root.\n                    // For example: from='C:\\\\'; to='C:\\\\foo'\n                    return toOrig.slice(toStart + i);\n                }\n            }\n            if (fromLen > length) {\n                if (from.charCodeAt(fromStart + i) === CHAR_BACKWARD_SLASH) {\n                    // We get here if `to` is the exact base path for `from`.\n                    // For example: from='C:\\\\foo\\\\bar'; to='C:\\\\foo'\n                    lastCommonSep = i;\n                }\n                else if (i === 2) {\n                    // We get here if `to` is the device root.\n                    // For example: from='C:\\\\foo\\\\bar'; to='C:\\\\'\n                    lastCommonSep = 3;\n                }\n            }\n            if (lastCommonSep === -1) {\n                lastCommonSep = 0;\n            }\n        }\n        let out = '';\n        // Generate the relative path based on the path difference between `to` and\n        // `from`\n        for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n            if (i === fromEnd || from.charCodeAt(i) === CHAR_BACKWARD_SLASH) {\n                out += out.length === 0 ? '..' : '\\\\..';\n            }\n        }\n        toStart += lastCommonSep;\n        // Lastly, append the rest of the destination (`to`) path that comes after\n        // the common path parts\n        if (out.length > 0) {\n            return `${out}${toOrig.slice(toStart, toEnd)}`;\n        }\n        if (toOrig.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {\n            ++toStart;\n        }\n        return toOrig.slice(toStart, toEnd);\n    },\n    toNamespacedPath(path) {\n        // Note: this will *probably* throw somewhere.\n        if (typeof path !== 'string' || path.length === 0) {\n            return path;\n        }\n        const resolvedPath = win32.resolve(path);\n        if (resolvedPath.length <= 2) {\n            return path;\n        }\n        if (resolvedPath.charCodeAt(0) === CHAR_BACKWARD_SLASH) {\n            // Possible UNC root\n            if (resolvedPath.charCodeAt(1) === CHAR_BACKWARD_SLASH) {\n                const code = resolvedPath.charCodeAt(2);\n                if (code !== CHAR_QUESTION_MARK && code !== CHAR_DOT) {\n                    // Matched non-long UNC root, convert the path to a long UNC path\n                    return `\\\\\\\\?\\\\UNC\\\\${resolvedPath.slice(2)}`;\n                }\n            }\n        }\n        else if (isWindowsDeviceRoot(resolvedPath.charCodeAt(0)) &&\n            resolvedPath.charCodeAt(1) === CHAR_COLON &&\n            resolvedPath.charCodeAt(2) === CHAR_BACKWARD_SLASH) {\n            // Matched device root, convert the path to a long UNC path\n            return `\\\\\\\\?\\\\${resolvedPath}`;\n        }\n        return resolvedPath;\n    },\n    dirname(path) {\n        validateString(path, 'path');\n        const len = path.length;\n        if (len === 0) {\n            return '.';\n        }\n        let rootEnd = -1;\n        let offset = 0;\n        const code = path.charCodeAt(0);\n        if (len === 1) {\n            // `path` contains just a path separator, exit early to avoid\n            // unnecessary work or a dot.\n            return isPathSeparator(code) ? path : '.';\n        }\n        // Try to match a root\n        if (isPathSeparator(code)) {\n            // Possible UNC root\n            rootEnd = offset = 1;\n            if (isPathSeparator(path.charCodeAt(1))) {\n                // Matched double path separator at beginning\n                let j = 2;\n                let last = j;\n                // Match 1 or more non-path separators\n                while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n                    j++;\n                }\n                if (j < len && j !== last) {\n                    // Matched!\n                    last = j;\n                    // Match 1 or more path separators\n                    while (j < len && isPathSeparator(path.charCodeAt(j))) {\n                        j++;\n                    }\n                    if (j < len && j !== last) {\n                        // Matched!\n                        last = j;\n                        // Match 1 or more non-path separators\n                        while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n                            j++;\n                        }\n                        if (j === len) {\n                            // We matched a UNC root only\n                            return path;\n                        }\n                        if (j !== last) {\n                            // We matched a UNC root with leftovers\n                            // Offset by 1 to include the separator after the UNC root to\n                            // treat it as a \"normal root\" on top of a (UNC) root\n                            rootEnd = offset = j + 1;\n                        }\n                    }\n                }\n            }\n            // Possible device root\n        }\n        else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n            rootEnd = len > 2 && isPathSeparator(path.charCodeAt(2)) ? 3 : 2;\n            offset = rootEnd;\n        }\n        let end = -1;\n        let matchedSlash = true;\n        for (let i = len - 1; i >= offset; --i) {\n            if (isPathSeparator(path.charCodeAt(i))) {\n                if (!matchedSlash) {\n                    end = i;\n                    break;\n                }\n            }\n            else {\n                // We saw the first non-path separator\n                matchedSlash = false;\n            }\n        }\n        if (end === -1) {\n            if (rootEnd === -1) {\n                return '.';\n            }\n            end = rootEnd;\n        }\n        return path.slice(0, end);\n    },\n    basename(path, suffix) {\n        if (suffix !== undefined) {\n            validateString(suffix, 'suffix');\n        }\n        validateString(path, 'path');\n        let start = 0;\n        let end = -1;\n        let matchedSlash = true;\n        let i;\n        // Check for a drive letter prefix so as not to mistake the following\n        // path separator as an extra separator at the end of the path that can be\n        // disregarded\n        if (path.length >= 2 &&\n            isWindowsDeviceRoot(path.charCodeAt(0)) &&\n            path.charCodeAt(1) === CHAR_COLON) {\n            start = 2;\n        }\n        if (suffix !== undefined && suffix.length > 0 && suffix.length <= path.length) {\n            if (suffix === path) {\n                return '';\n            }\n            let extIdx = suffix.length - 1;\n            let firstNonSlashEnd = -1;\n            for (i = path.length - 1; i >= start; --i) {\n                const code = path.charCodeAt(i);\n                if (isPathSeparator(code)) {\n                    // If we reached a path separator that was not part of a set of path\n                    // separators at the end of the string, stop now\n                    if (!matchedSlash) {\n                        start = i + 1;\n                        break;\n                    }\n                }\n                else {\n                    if (firstNonSlashEnd === -1) {\n                        // We saw the first non-path separator, remember this index in case\n                        // we need it if the extension ends up not matching\n                        matchedSlash = false;\n                        firstNonSlashEnd = i + 1;\n                    }\n                    if (extIdx >= 0) {\n                        // Try to match the explicit extension\n                        if (code === suffix.charCodeAt(extIdx)) {\n                            if (--extIdx === -1) {\n                                // We matched the extension, so mark this as the end of our path\n                                // component\n                                end = i;\n                            }\n                        }\n                        else {\n                            // Extension does not match, so our result is the entire path\n                            // component\n                            extIdx = -1;\n                            end = firstNonSlashEnd;\n                        }\n                    }\n                }\n            }\n            if (start === end) {\n                end = firstNonSlashEnd;\n            }\n            else if (end === -1) {\n                end = path.length;\n            }\n            return path.slice(start, end);\n        }\n        for (i = path.length - 1; i >= start; --i) {\n            if (isPathSeparator(path.charCodeAt(i))) {\n                // If we reached a path separator that was not part of a set of path\n                // separators at the end of the string, stop now\n                if (!matchedSlash) {\n                    start = i + 1;\n                    break;\n                }\n            }\n            else if (end === -1) {\n                // We saw the first non-path separator, mark this as the end of our\n                // path component\n                matchedSlash = false;\n                end = i + 1;\n            }\n        }\n        if (end === -1) {\n            return '';\n        }\n        return path.slice(start, end);\n    },\n    extname(path) {\n        validateString(path, 'path');\n        let start = 0;\n        let startDot = -1;\n        let startPart = 0;\n        let end = -1;\n        let matchedSlash = true;\n        // Track the state of characters (if any) we see before our first dot and\n        // after any path separator we find\n        let preDotState = 0;\n        // Check for a drive letter prefix so as not to mistake the following\n        // path separator as an extra separator at the end of the path that can be\n        // disregarded\n        if (path.length >= 2 &&\n            path.charCodeAt(1) === CHAR_COLON &&\n            isWindowsDeviceRoot(path.charCodeAt(0))) {\n            start = startPart = 2;\n        }\n        for (let i = path.length - 1; i >= start; --i) {\n            const code = path.charCodeAt(i);\n            if (isPathSeparator(code)) {\n                // If we reached a path separator that was not part of a set of path\n                // separators at the end of the string, stop now\n                if (!matchedSlash) {\n                    startPart = i + 1;\n                    break;\n                }\n                continue;\n            }\n            if (end === -1) {\n                // We saw the first non-path separator, mark this as the end of our\n                // extension\n                matchedSlash = false;\n                end = i + 1;\n            }\n            if (code === CHAR_DOT) {\n                // If this is our first dot, mark it as the start of our extension\n                if (startDot === -1) {\n                    startDot = i;\n                }\n                else if (preDotState !== 1) {\n                    preDotState = 1;\n                }\n            }\n            else if (startDot !== -1) {\n                // We saw a non-dot and non-path separator before our dot, so we should\n                // have a good chance at having a non-empty extension\n                preDotState = -1;\n            }\n        }\n        if (startDot === -1 ||\n            end === -1 ||\n            // We saw a non-dot character immediately before the dot\n            preDotState === 0 ||\n            // The (right-most) trimmed path component is exactly '..'\n            (preDotState === 1 &&\n                startDot === end - 1 &&\n                startDot === startPart + 1)) {\n            return '';\n        }\n        return path.slice(startDot, end);\n    },\n    format: _format.bind(null, '\\\\'),\n    parse(path) {\n        validateString(path, 'path');\n        const ret = { root: '', dir: '', base: '', ext: '', name: '' };\n        if (path.length === 0) {\n            return ret;\n        }\n        const len = path.length;\n        let rootEnd = 0;\n        let code = path.charCodeAt(0);\n        if (len === 1) {\n            if (isPathSeparator(code)) {\n                // `path` contains just a path separator, exit early to avoid\n                // unnecessary work\n                ret.root = ret.dir = path;\n                return ret;\n            }\n            ret.base = ret.name = path;\n            return ret;\n        }\n        // Try to match a root\n        if (isPathSeparator(code)) {\n            // Possible UNC root\n            rootEnd = 1;\n            if (isPathSeparator(path.charCodeAt(1))) {\n                // Matched double path separator at beginning\n                let j = 2;\n                let last = j;\n                // Match 1 or more non-path separators\n                while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n                    j++;\n                }\n                if (j < len && j !== last) {\n                    // Matched!\n                    last = j;\n                    // Match 1 or more path separators\n                    while (j < len && isPathSeparator(path.charCodeAt(j))) {\n                        j++;\n                    }\n                    if (j < len && j !== last) {\n                        // Matched!\n                        last = j;\n                        // Match 1 or more non-path separators\n                        while (j < len && !isPathSeparator(path.charCodeAt(j))) {\n                            j++;\n                        }\n                        if (j === len) {\n                            // We matched a UNC root only\n                            rootEnd = j;\n                        }\n                        else if (j !== last) {\n                            // We matched a UNC root with leftovers\n                            rootEnd = j + 1;\n                        }\n                    }\n                }\n            }\n        }\n        else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\n            // Possible device root\n            if (len <= 2) {\n                // `path` contains just a drive root, exit early to avoid\n                // unnecessary work\n                ret.root = ret.dir = path;\n                return ret;\n            }\n            rootEnd = 2;\n            if (isPathSeparator(path.charCodeAt(2))) {\n                if (len === 3) {\n                    // `path` contains just a drive root, exit early to avoid\n                    // unnecessary work\n                    ret.root = ret.dir = path;\n                    return ret;\n                }\n                rootEnd = 3;\n            }\n        }\n        if (rootEnd > 0) {\n            ret.root = path.slice(0, rootEnd);\n        }\n        let startDot = -1;\n        let startPart = rootEnd;\n        let end = -1;\n        let matchedSlash = true;\n        let i = path.length - 1;\n        // Track the state of characters (if any) we see before our first dot and\n        // after any path separator we find\n        let preDotState = 0;\n        // Get non-dir info\n        for (; i >= rootEnd; --i) {\n            code = path.charCodeAt(i);\n            if (isPathSeparator(code)) {\n                // If we reached a path separator that was not part of a set of path\n                // separators at the end of the string, stop now\n                if (!matchedSlash) {\n                    startPart = i + 1;\n                    break;\n                }\n                continue;\n            }\n            if (end === -1) {\n                // We saw the first non-path separator, mark this as the end of our\n                // extension\n                matchedSlash = false;\n                end = i + 1;\n            }\n            if (code === CHAR_DOT) {\n                // If this is our first dot, mark it as the start of our extension\n                if (startDot === -1) {\n                    startDot = i;\n                }\n                else if (preDotState !== 1) {\n                    preDotState = 1;\n                }\n            }\n            else if (startDot !== -1) {\n                // We saw a non-dot and non-path separator before our dot, so we should\n                // have a good chance at having a non-empty extension\n                preDotState = -1;\n            }\n        }\n        if (end !== -1) {\n            if (startDot === -1 ||\n                // We saw a non-dot character immediately before the dot\n                preDotState === 0 ||\n                // The (right-most) trimmed path component is exactly '..'\n                (preDotState === 1 &&\n                    startDot === end - 1 &&\n                    startDot === startPart + 1)) {\n                ret.base = ret.name = path.slice(startPart, end);\n            }\n            else {\n                ret.name = path.slice(startPart, startDot);\n                ret.base = path.slice(startPart, end);\n                ret.ext = path.slice(startDot, end);\n            }\n        }\n        // If the directory is the root, use the entire root as the `dir` including\n        // the trailing slash if any (`C:\\abc` -> `C:\\`). Otherwise, strip out the\n        // trailing slash (`C:\\abc\\def` -> `C:\\abc`).\n        if (startPart > 0 && startPart !== rootEnd) {\n            ret.dir = path.slice(0, startPart - 1);\n        }\n        else {\n            ret.dir = ret.root;\n        }\n        return ret;\n    },\n    sep: '\\\\',\n    delimiter: ';',\n    win32: null,\n    posix: null\n};\nconst posixCwd = (() => {\n    if (platformIsWin32) {\n        // Converts Windows' backslash path separators to POSIX forward slashes\n        // and truncates any drive indicator\n        const regexp = /\\\\/g;\n        return () => {\n            const cwd$1 = cwd().replace(regexp, '/');\n            return cwd$1.slice(cwd$1.indexOf('/'));\n        };\n    }\n    // We're already on POSIX, no need for any transformations\n    return () => cwd();\n})();\nconst posix = {\n    // path.resolve([from ...], to)\n    resolve(...pathSegments) {\n        let resolvedPath = '';\n        let resolvedAbsolute = false;\n        for (let i = pathSegments.length - 1; i >= 0 && !resolvedAbsolute; i--) {\n            const path = pathSegments[i];\n            validateString(path, `paths[${i}]`);\n            // Skip empty entries\n            if (path.length === 0) {\n                continue;\n            }\n            resolvedPath = `${path}/${resolvedPath}`;\n            resolvedAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n        }\n        if (!resolvedAbsolute) {\n            const cwd = posixCwd();\n            resolvedPath = `${cwd}/${resolvedPath}`;\n            resolvedAbsolute =\n                cwd.charCodeAt(0) === CHAR_FORWARD_SLASH;\n        }\n        // At this point the path should be resolved to a full absolute path, but\n        // handle relative paths to be safe (might happen when process.cwd() fails)\n        // Normalize the path\n        resolvedPath = normalizeString(resolvedPath, !resolvedAbsolute, '/', isPosixPathSeparator);\n        if (resolvedAbsolute) {\n            return `/${resolvedPath}`;\n        }\n        return resolvedPath.length > 0 ? resolvedPath : '.';\n    },\n    normalize(path) {\n        validateString(path, 'path');\n        if (path.length === 0) {\n            return '.';\n        }\n        const isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n        const trailingSeparator = path.charCodeAt(path.length - 1) === CHAR_FORWARD_SLASH;\n        // Normalize the path\n        path = normalizeString(path, !isAbsolute, '/', isPosixPathSeparator);\n        if (path.length === 0) {\n            if (isAbsolute) {\n                return '/';\n            }\n            return trailingSeparator ? './' : '.';\n        }\n        if (trailingSeparator) {\n            path += '/';\n        }\n        return isAbsolute ? `/${path}` : path;\n    },\n    isAbsolute(path) {\n        validateString(path, 'path');\n        return path.length > 0 && path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n    },\n    join(...paths) {\n        if (paths.length === 0) {\n            return '.';\n        }\n        const path = [];\n        for (let i = 0; i < paths.length; ++i) {\n            const arg = paths[i];\n            validateString(arg, 'path');\n            if (arg.length > 0) {\n                path.push(arg);\n            }\n        }\n        if (path.length === 0) {\n            return '.';\n        }\n        return posix.normalize(path.join('/'));\n    },\n    relative(from, to) {\n        validateString(from, 'from');\n        validateString(to, 'to');\n        if (from === to) {\n            return '';\n        }\n        // Trim leading forward slashes.\n        from = posix.resolve(from);\n        to = posix.resolve(to);\n        if (from === to) {\n            return '';\n        }\n        const fromStart = 1;\n        const fromEnd = from.length;\n        const fromLen = fromEnd - fromStart;\n        const toStart = 1;\n        const toLen = to.length - toStart;\n        // Compare paths to find the longest common path from root\n        const length = (fromLen < toLen ? fromLen : toLen);\n        let lastCommonSep = -1;\n        let i = 0;\n        for (; i < length; i++) {\n            const fromCode = from.charCodeAt(fromStart + i);\n            if (fromCode !== to.charCodeAt(toStart + i)) {\n                break;\n            }\n            else if (fromCode === CHAR_FORWARD_SLASH) {\n                lastCommonSep = i;\n            }\n        }\n        if (i === length) {\n            if (toLen > length) {\n                if (to.charCodeAt(toStart + i) === CHAR_FORWARD_SLASH) {\n                    // We get here if `from` is the exact base path for `to`.\n                    // For example: from='/foo/bar'; to='/foo/bar/baz'\n                    return to.slice(toStart + i + 1);\n                }\n                if (i === 0) {\n                    // We get here if `from` is the root\n                    // For example: from='/'; to='/foo'\n                    return to.slice(toStart + i);\n                }\n            }\n            else if (fromLen > length) {\n                if (from.charCodeAt(fromStart + i) === CHAR_FORWARD_SLASH) {\n                    // We get here if `to` is the exact base path for `from`.\n                    // For example: from='/foo/bar/baz'; to='/foo/bar'\n                    lastCommonSep = i;\n                }\n                else if (i === 0) {\n                    // We get here if `to` is the root.\n                    // For example: from='/foo/bar'; to='/'\n                    lastCommonSep = 0;\n                }\n            }\n        }\n        let out = '';\n        // Generate the relative path based on the path difference between `to`\n        // and `from`.\n        for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n            if (i === fromEnd || from.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n                out += out.length === 0 ? '..' : '/..';\n            }\n        }\n        // Lastly, append the rest of the destination (`to`) path that comes after\n        // the common path parts.\n        return `${out}${to.slice(toStart + lastCommonSep)}`;\n    },\n    toNamespacedPath(path) {\n        // Non-op on posix systems\n        return path;\n    },\n    dirname(path) {\n        validateString(path, 'path');\n        if (path.length === 0) {\n            return '.';\n        }\n        const hasRoot = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n        let end = -1;\n        let matchedSlash = true;\n        for (let i = path.length - 1; i >= 1; --i) {\n            if (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n                if (!matchedSlash) {\n                    end = i;\n                    break;\n                }\n            }\n            else {\n                // We saw the first non-path separator\n                matchedSlash = false;\n            }\n        }\n        if (end === -1) {\n            return hasRoot ? '/' : '.';\n        }\n        if (hasRoot && end === 1) {\n            return '//';\n        }\n        return path.slice(0, end);\n    },\n    basename(path, suffix) {\n        if (suffix !== undefined) {\n            validateString(suffix, 'suffix');\n        }\n        validateString(path, 'path');\n        let start = 0;\n        let end = -1;\n        let matchedSlash = true;\n        let i;\n        if (suffix !== undefined && suffix.length > 0 && suffix.length <= path.length) {\n            if (suffix === path) {\n                return '';\n            }\n            let extIdx = suffix.length - 1;\n            let firstNonSlashEnd = -1;\n            for (i = path.length - 1; i >= 0; --i) {\n                const code = path.charCodeAt(i);\n                if (code === CHAR_FORWARD_SLASH) {\n                    // If we reached a path separator that was not part of a set of path\n                    // separators at the end of the string, stop now\n                    if (!matchedSlash) {\n                        start = i + 1;\n                        break;\n                    }\n                }\n                else {\n                    if (firstNonSlashEnd === -1) {\n                        // We saw the first non-path separator, remember this index in case\n                        // we need it if the extension ends up not matching\n                        matchedSlash = false;\n                        firstNonSlashEnd = i + 1;\n                    }\n                    if (extIdx >= 0) {\n                        // Try to match the explicit extension\n                        if (code === suffix.charCodeAt(extIdx)) {\n                            if (--extIdx === -1) {\n                                // We matched the extension, so mark this as the end of our path\n                                // component\n                                end = i;\n                            }\n                        }\n                        else {\n                            // Extension does not match, so our result is the entire path\n                            // component\n                            extIdx = -1;\n                            end = firstNonSlashEnd;\n                        }\n                    }\n                }\n            }\n            if (start === end) {\n                end = firstNonSlashEnd;\n            }\n            else if (end === -1) {\n                end = path.length;\n            }\n            return path.slice(start, end);\n        }\n        for (i = path.length - 1; i >= 0; --i) {\n            if (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {\n                // If we reached a path separator that was not part of a set of path\n                // separators at the end of the string, stop now\n                if (!matchedSlash) {\n                    start = i + 1;\n                    break;\n                }\n            }\n            else if (end === -1) {\n                // We saw the first non-path separator, mark this as the end of our\n                // path component\n                matchedSlash = false;\n                end = i + 1;\n            }\n        }\n        if (end === -1) {\n            return '';\n        }\n        return path.slice(start, end);\n    },\n    extname(path) {\n        validateString(path, 'path');\n        let startDot = -1;\n        let startPart = 0;\n        let end = -1;\n        let matchedSlash = true;\n        // Track the state of characters (if any) we see before our first dot and\n        // after any path separator we find\n        let preDotState = 0;\n        for (let i = path.length - 1; i >= 0; --i) {\n            const char = path[i];\n            if (char === '/') {\n                // If we reached a path separator that was not part of a set of path\n                // separators at the end of the string, stop now\n                if (!matchedSlash) {\n                    startPart = i + 1;\n                    break;\n                }\n                continue;\n            }\n            if (end === -1) {\n                // We saw the first non-path separator, mark this as the end of our\n                // extension\n                matchedSlash = false;\n                end = i + 1;\n            }\n            if (char === '.') {\n                // If this is our first dot, mark it as the start of our extension\n                if (startDot === -1) {\n                    startDot = i;\n                }\n                else if (preDotState !== 1) {\n                    preDotState = 1;\n                }\n            }\n            else if (startDot !== -1) {\n                // We saw a non-dot and non-path separator before our dot, so we should\n                // have a good chance at having a non-empty extension\n                preDotState = -1;\n            }\n        }\n        if (startDot === -1 ||\n            end === -1 ||\n            // We saw a non-dot character immediately before the dot\n            preDotState === 0 ||\n            // The (right-most) trimmed path component is exactly '..'\n            (preDotState === 1 &&\n                startDot === end - 1 &&\n                startDot === startPart + 1)) {\n            return '';\n        }\n        return path.slice(startDot, end);\n    },\n    format: _format.bind(null, '/'),\n    parse(path) {\n        validateString(path, 'path');\n        const ret = { root: '', dir: '', base: '', ext: '', name: '' };\n        if (path.length === 0) {\n            return ret;\n        }\n        const isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\n        let start;\n        if (isAbsolute) {\n            ret.root = '/';\n            start = 1;\n        }\n        else {\n            start = 0;\n        }\n        let startDot = -1;\n        let startPart = 0;\n        let end = -1;\n        let matchedSlash = true;\n        let i = path.length - 1;\n        // Track the state of characters (if any) we see before our first dot and\n        // after any path separator we find\n        let preDotState = 0;\n        // Get non-dir info\n        for (; i >= start; --i) {\n            const code = path.charCodeAt(i);\n            if (code === CHAR_FORWARD_SLASH) {\n                // If we reached a path separator that was not part of a set of path\n                // separators at the end of the string, stop now\n                if (!matchedSlash) {\n                    startPart = i + 1;\n                    break;\n                }\n                continue;\n            }\n            if (end === -1) {\n                // We saw the first non-path separator, mark this as the end of our\n                // extension\n                matchedSlash = false;\n                end = i + 1;\n            }\n            if (code === CHAR_DOT) {\n                // If this is our first dot, mark it as the start of our extension\n                if (startDot === -1) {\n                    startDot = i;\n                }\n                else if (preDotState !== 1) {\n                    preDotState = 1;\n                }\n            }\n            else if (startDot !== -1) {\n                // We saw a non-dot and non-path separator before our dot, so we should\n                // have a good chance at having a non-empty extension\n                preDotState = -1;\n            }\n        }\n        if (end !== -1) {\n            const start = startPart === 0 && isAbsolute ? 1 : startPart;\n            if (startDot === -1 ||\n                // We saw a non-dot character immediately before the dot\n                preDotState === 0 ||\n                // The (right-most) trimmed path component is exactly '..'\n                (preDotState === 1 &&\n                    startDot === end - 1 &&\n                    startDot === startPart + 1)) {\n                ret.base = ret.name = path.slice(start, end);\n            }\n            else {\n                ret.name = path.slice(start, startDot);\n                ret.base = path.slice(start, end);\n                ret.ext = path.slice(startDot, end);\n            }\n        }\n        if (startPart > 0) {\n            ret.dir = path.slice(0, startPart - 1);\n        }\n        else if (isAbsolute) {\n            ret.dir = '/';\n        }\n        return ret;\n    },\n    sep: '/',\n    delimiter: ':',\n    win32: null,\n    posix: null\n};\nposix.win32 = win32.win32 = win32;\nposix.posix = win32.posix = posix;\nconst normalize = (platformIsWin32 ? win32.normalize : posix.normalize);\nconst resolve = (platformIsWin32 ? win32.resolve : posix.resolve);\nconst relative = (platformIsWin32 ? win32.relative : posix.relative);\nconst dirname = (platformIsWin32 ? win32.dirname : posix.dirname);\nconst basename = (platformIsWin32 ? win32.basename : posix.basename);\nconst extname = (platformIsWin32 ? win32.extname : posix.extname);\nconst sep = (platformIsWin32 ? win32.sep : posix.sep);\n\nexport { basename, dirname, extname, normalize, posix, relative, resolve, sep, win32 };\n","import { win32, posix } from './path.js';\nimport { isWindows } from './platform.js';\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 *--------------------------------------------------------------------------------------------*/\nconst _schemePattern = /^\\w[\\w\\d+.-]*$/;\nconst _singleSlashStart = /^\\//;\nconst _doubleSlashStart = /^\\/\\//;\nfunction _validateUri(ret, _strict) {\n    // scheme, must be set\n    if (!ret.scheme && _strict) {\n        throw new Error(`[UriError]: Scheme is missing: {scheme: \"\", authority: \"${ret.authority}\", path: \"${ret.path}\", query: \"${ret.query}\", fragment: \"${ret.fragment}\"}`);\n    }\n    // scheme, https://tools.ietf.org/html/rfc3986#section-3.1\n    // ALPHA *( ALPHA / DIGIT / \"+\" / \"-\" / \".\" )\n    if (ret.scheme && !_schemePattern.test(ret.scheme)) {\n        throw new Error('[UriError]: Scheme contains illegal characters.');\n    }\n    // path, http://tools.ietf.org/html/rfc3986#section-3.3\n    // If a URI contains an authority component, then the path component\n    // must either be empty or begin with a slash (\"/\") character.  If a URI\n    // does not contain an authority component, then the path cannot begin\n    // with two slash characters (\"//\").\n    if (ret.path) {\n        if (ret.authority) {\n            if (!_singleSlashStart.test(ret.path)) {\n                throw 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            }\n        }\n        else {\n            if (_doubleSlashStart.test(ret.path)) {\n                throw new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters (\"//\")');\n            }\n        }\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, _strict) {\n    if (!scheme && !_strict) {\n        return 'file';\n    }\n    return scheme;\n}\n// implements a bit of https://tools.ietf.org/html/rfc3986#section-5\nfunction _referenceResolution(scheme, path) {\n    // the slash-character is our 'default base' as we don't\n    // support constructing URIs relative to other URIs. This\n    // also means that we alter and potentially break paths.\n    // see https://tools.ietf.org/html/rfc3986#section-5.1.4\n    switch (scheme) {\n        case 'https':\n        case 'http':\n        case 'file':\n            if (!path) {\n                path = _slash;\n            }\n            else if (path[0] !== _slash) {\n                path = _slash + path;\n            }\n            break;\n    }\n    return path;\n}\nconst _empty = '';\nconst _slash = '/';\nconst _regexp = /^(([^:/?#]+?):)?(\\/\\/([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?/;\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 */\nclass URI {\n    static isUri(thing) {\n        if (thing instanceof URI) {\n            return true;\n        }\n        if (!thing || typeof thing !== 'object') {\n            return false;\n        }\n        return typeof thing.authority === 'string'\n            && typeof thing.fragment === 'string'\n            && typeof thing.path === 'string'\n            && typeof thing.query === 'string'\n            && typeof thing.scheme === 'string'\n            && typeof thing.fsPath === 'string'\n            && typeof thing.with === 'function'\n            && typeof thing.toString === 'function';\n    }\n    /**\n     * @internal\n     */\n    constructor(schemeOrData, authority, path, query, fragment, _strict = false) {\n        if (typeof schemeOrData === 'object') {\n            this.scheme = schemeOrData.scheme || _empty;\n            this.authority = schemeOrData.authority || _empty;\n            this.path = schemeOrData.path || _empty;\n            this.query = schemeOrData.query || _empty;\n            this.fragment = schemeOrData.fragment || _empty;\n            // no validation because it's this URI\n            // that creates uri components.\n            // _validateUri(this);\n        }\n        else {\n            this.scheme = _schemeFix(schemeOrData, _strict);\n            this.authority = authority || _empty;\n            this.path = _referenceResolution(this.scheme, path || _empty);\n            this.query = query || _empty;\n            this.fragment = fragment || _empty;\n            _validateUri(this, _strict);\n        }\n    }\n    // ---- filesystem path -----------------------\n    /**\n     * Returns a string representing the corresponding file system path of this URI.\n     * Will handle UNC paths, normalizes windows drive letters to lower-case, and uses the\n     * platform specific path separator.\n     *\n     * * Will *not* validate the path for invalid characters and semantics.\n     * * Will *not* look at the scheme of this URI.\n     * * The result shall *not* be used for display purposes but for accessing a file on disk.\n     *\n     *\n     * The *difference* to `URI#path` is the use of the platform specific separator and the handling\n     * of UNC paths. See the below sample of a file-uri with an authority (UNC path).\n     *\n     * ```ts\n        const u = URI.parse('file://server/c$/folder/file.txt')\n        u.authority === 'server'\n        u.path === '/shares/c$/file.txt'\n        u.fsPath === '\\\\server\\c$\\folder\\file.txt'\n    ```\n     *\n     * Using `URI#path` to read a file (using fs-apis) would not be enough because parts of the path,\n     * namely the server name, would be missing. Therefore `URI#fsPath` exists - it's sugar to ease working\n     * with URIs that represent files on disk (`file` scheme).\n     */\n    get fsPath() {\n        // if (this.scheme !== 'file') {\n        // \tconsole.warn(`[UriError] calling fsPath with scheme ${this.scheme}`);\n        // }\n        return uriToFsPath(this, false);\n    }\n    // ---- modify to new -------------------------\n    with(change) {\n        if (!change) {\n            return this;\n        }\n        let { scheme, authority, path, query, fragment } = change;\n        if (scheme === undefined) {\n            scheme = this.scheme;\n        }\n        else if (scheme === null) {\n            scheme = _empty;\n        }\n        if (authority === undefined) {\n            authority = this.authority;\n        }\n        else if (authority === null) {\n            authority = _empty;\n        }\n        if (path === undefined) {\n            path = this.path;\n        }\n        else if (path === null) {\n            path = _empty;\n        }\n        if (query === undefined) {\n            query = this.query;\n        }\n        else if (query === null) {\n            query = _empty;\n        }\n        if (fragment === undefined) {\n            fragment = this.fragment;\n        }\n        else if (fragment === null) {\n            fragment = _empty;\n        }\n        if (scheme === this.scheme\n            && authority === this.authority\n            && path === this.path\n            && query === this.query\n            && fragment === this.fragment) {\n            return this;\n        }\n        return new Uri(scheme, authority, path, query, fragment);\n    }\n    // ---- parse & validate ------------------------\n    /**\n     * Creates a new URI from a string, e.g. `http://www.example.com/some/path`,\n     * `file:///usr/home`, or `scheme:with/path`.\n     *\n     * @param value A string which represents an URI (see `URI#toString`).\n     */\n    static parse(value, _strict = false) {\n        const match = _regexp.exec(value);\n        if (!match) {\n            return new Uri(_empty, _empty, _empty, _empty, _empty);\n        }\n        return new Uri(match[2] || _empty, percentDecode(match[4] || _empty), percentDecode(match[5] || _empty), percentDecode(match[7] || _empty), percentDecode(match[9] || _empty), _strict);\n    }\n    /**\n     * Creates a new URI from a file system path, e.g. `c:\\my\\files`,\n     * `/usr/home`, or `\\\\server\\share\\some\\path`.\n     *\n     * The *difference* between `URI#parse` and `URI#file` is that the latter treats the argument\n     * as path, not as stringified-uri. E.g. `URI.file(path)` is **not the same as**\n     * `URI.parse('file://' + path)` because the path might contain characters that are\n     * interpreted (# and ?). See the following sample:\n     * ```ts\n    const good = URI.file('/coding/c#/project1');\n    good.scheme === 'file';\n    good.path === '/coding/c#/project1';\n    good.fragment === '';\n    const bad = URI.parse('file://' + '/coding/c#/project1');\n    bad.scheme === 'file';\n    bad.path === '/coding/c'; // path is now broken\n    bad.fragment === '/project1';\n    ```\n     *\n     * @param path A file system path (see `URI#fsPath`)\n     */\n    static file(path) {\n        let authority = _empty;\n        // normalize to fwd-slashes on windows,\n        // on other systems bwd-slashes are valid\n        // filename character, eg /f\\oo/ba\\r.txt\n        if (isWindows) {\n            path = path.replace(/\\\\/g, _slash);\n        }\n        // check for authority as used in UNC shares\n        // or use the path as given\n        if (path[0] === _slash && path[1] === _slash) {\n            const idx = path.indexOf(_slash, 2);\n            if (idx === -1) {\n                authority = path.substring(2);\n                path = _slash;\n            }\n            else {\n                authority = path.substring(2, idx);\n                path = path.substring(idx) || _slash;\n            }\n        }\n        return new Uri('file', authority, path, _empty, _empty);\n    }\n    /**\n     * Creates new URI from uri components.\n     *\n     * Unless `strict` is `true` the scheme is defaults to be `file`. This function performs\n     * validation and should be used for untrusted uri components retrieved from storage,\n     * user input, command arguments etc\n     */\n    static from(components, strict) {\n        const result = new Uri(components.scheme, components.authority, components.path, components.query, components.fragment, strict);\n        return result;\n    }\n    /**\n     * Join a URI path with path fragments and normalizes the resulting path.\n     *\n     * @param uri The input URI.\n     * @param pathFragment The path fragment to add to the URI path.\n     * @returns The resulting URI.\n     */\n    static joinPath(uri, ...pathFragment) {\n        if (!uri.path) {\n            throw new Error(`[UriError]: cannot call joinPath on URI without path`);\n        }\n        let newPath;\n        if (isWindows && uri.scheme === 'file') {\n            newPath = URI.file(win32.join(uriToFsPath(uri, true), ...pathFragment)).path;\n        }\n        else {\n            newPath = posix.join(uri.path, ...pathFragment);\n        }\n        return uri.with({ path: newPath });\n    }\n    // ---- printing/externalize ---------------------------\n    /**\n     * Creates a string representation for this URI. It's guaranteed that calling\n     * `URI.parse` with the result of this function creates an URI which is equal\n     * to this URI.\n     *\n     * * The result shall *not* be used for display purposes but for externalization or transport.\n     * * The result will be encoded using the percentage encoding and encoding happens mostly\n     * ignore the scheme-specific encoding rules.\n     *\n     * @param skipEncoding Do not encode the result, default is `false`\n     */\n    toString(skipEncoding = false) {\n        return _asFormatted(this, skipEncoding);\n    }\n    toJSON() {\n        return this;\n    }\n    static revive(data) {\n        if (!data) {\n            return data;\n        }\n        else if (data instanceof URI) {\n            return data;\n        }\n        else {\n            const result = new Uri(data);\n            result._formatted = data.external ?? null;\n            result._fsPath = data._sep === _pathSepMarker ? data.fsPath ?? null : null;\n            return result;\n        }\n    }\n}\nconst _pathSepMarker = isWindows ? 1 : undefined;\n// This class exists so that URI is compatible with vscode.Uri (API).\nclass Uri extends URI {\n    constructor() {\n        super(...arguments);\n        this._formatted = null;\n        this._fsPath = null;\n    }\n    get fsPath() {\n        if (!this._fsPath) {\n            this._fsPath = uriToFsPath(this, false);\n        }\n        return this._fsPath;\n    }\n    toString(skipEncoding = false) {\n        if (!skipEncoding) {\n            if (!this._formatted) {\n                this._formatted = _asFormatted(this, false);\n            }\n            return this._formatted;\n        }\n        else {\n            // we don't cache that\n            return _asFormatted(this, true);\n        }\n    }\n    toJSON() {\n        // eslint-disable-next-line local/code-no-dangerous-type-assertions\n        const res = {\n            $mid: 1 /* MarshalledId.Uri */\n        };\n        // cached state\n        if (this._fsPath) {\n            res.fsPath = this._fsPath;\n            res._sep = _pathSepMarker;\n        }\n        if (this._formatted) {\n            res.external = this._formatted;\n        }\n        //--- uri components\n        if (this.path) {\n            res.path = this.path;\n        }\n        // TODO\n        // this isn't correct and can violate the UriComponents contract but\n        // this is part of the vscode.Uri API and we shouldn't change how that\n        // works anymore\n        if (this.scheme) {\n            res.scheme = this.scheme;\n        }\n        if (this.authority) {\n            res.authority = this.authority;\n        }\n        if (this.query) {\n            res.query = this.query;\n        }\n        if (this.fragment) {\n            res.fragment = this.fragment;\n        }\n        return res;\n    }\n}\n// reserved characters: https://tools.ietf.org/html/rfc3986#section-2.2\nconst encodeTable = {\n    [58 /* CharCode.Colon */]: '%3A', // gen-delims\n    [47 /* CharCode.Slash */]: '%2F',\n    [63 /* CharCode.QuestionMark */]: '%3F',\n    [35 /* CharCode.Hash */]: '%23',\n    [91 /* CharCode.OpenSquareBracket */]: '%5B',\n    [93 /* CharCode.CloseSquareBracket */]: '%5D',\n    [64 /* CharCode.AtSign */]: '%40',\n    [33 /* CharCode.ExclamationMark */]: '%21', // sub-delims\n    [36 /* CharCode.DollarSign */]: '%24',\n    [38 /* CharCode.Ampersand */]: '%26',\n    [39 /* CharCode.SingleQuote */]: '%27',\n    [40 /* CharCode.OpenParen */]: '%28',\n    [41 /* CharCode.CloseParen */]: '%29',\n    [42 /* CharCode.Asterisk */]: '%2A',\n    [43 /* CharCode.Plus */]: '%2B',\n    [44 /* CharCode.Comma */]: '%2C',\n    [59 /* CharCode.Semicolon */]: '%3B',\n    [61 /* CharCode.Equals */]: '%3D',\n    [32 /* CharCode.Space */]: '%20',\n};\nfunction encodeURIComponentFast(uriComponent, isPath, isAuthority) {\n    let res = undefined;\n    let nativeEncodePos = -1;\n    for (let pos = 0; pos < uriComponent.length; pos++) {\n        const code = uriComponent.charCodeAt(pos);\n        // unreserved characters: https://tools.ietf.org/html/rfc3986#section-2.3\n        if ((code >= 97 /* CharCode.a */ && code <= 122 /* CharCode.z */)\n            || (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */)\n            || (code >= 48 /* CharCode.Digit0 */ && code <= 57 /* CharCode.Digit9 */)\n            || code === 45 /* CharCode.Dash */\n            || code === 46 /* CharCode.Period */\n            || code === 95 /* CharCode.Underline */\n            || code === 126 /* CharCode.Tilde */\n            || (isPath && code === 47 /* CharCode.Slash */)\n            || (isAuthority && code === 91 /* CharCode.OpenSquareBracket */)\n            || (isAuthority && code === 93 /* CharCode.CloseSquareBracket */)\n            || (isAuthority && code === 58 /* CharCode.Colon */)) {\n            // check if we are delaying native encode\n            if (nativeEncodePos !== -1) {\n                res += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\n                nativeEncodePos = -1;\n            }\n            // check if we write into a new string (by default we try to return the param)\n            if (res !== undefined) {\n                res += uriComponent.charAt(pos);\n            }\n        }\n        else {\n            // encoding needed, we need to allocate a new string\n            if (res === undefined) {\n                res = uriComponent.substr(0, pos);\n            }\n            // check with default table first\n            const escaped = encodeTable[code];\n            if (escaped !== undefined) {\n                // check if we are delaying native encode\n                if (nativeEncodePos !== -1) {\n                    res += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\n                    nativeEncodePos = -1;\n                }\n                // append escaped variant to result\n                res += escaped;\n            }\n            else if (nativeEncodePos === -1) {\n                // use native encode only when needed\n                nativeEncodePos = pos;\n            }\n        }\n    }\n    if (nativeEncodePos !== -1) {\n        res += encodeURIComponent(uriComponent.substring(nativeEncodePos));\n    }\n    return res !== undefined ? res : uriComponent;\n}\nfunction encodeURIComponentMinimal(path) {\n    let res = undefined;\n    for (let pos = 0; pos < path.length; pos++) {\n        const code = path.charCodeAt(pos);\n        if (code === 35 /* CharCode.Hash */ || code === 63 /* CharCode.QuestionMark */) {\n            if (res === undefined) {\n                res = path.substr(0, pos);\n            }\n            res += encodeTable[code];\n        }\n        else {\n            if (res !== undefined) {\n                res += path[pos];\n            }\n        }\n    }\n    return res !== undefined ? res : path;\n}\n/**\n * Compute `fsPath` for the given uri\n */\nfunction uriToFsPath(uri, keepDriveLetterCasing) {\n    let value;\n    if (uri.authority && uri.path.length > 1 && uri.scheme === 'file') {\n        // unc path: file://shares/c$/far/boo\n        value = `//${uri.authority}${uri.path}`;\n    }\n    else if (uri.path.charCodeAt(0) === 47 /* CharCode.Slash */\n        && (uri.path.charCodeAt(1) >= 65 /* CharCode.A */ && uri.path.charCodeAt(1) <= 90 /* CharCode.Z */ || uri.path.charCodeAt(1) >= 97 /* CharCode.a */ && uri.path.charCodeAt(1) <= 122 /* CharCode.z */)\n        && uri.path.charCodeAt(2) === 58 /* CharCode.Colon */) {\n        if (!keepDriveLetterCasing) {\n            // windows drive letter: file:///c:/far/boo\n            value = uri.path[1].toLowerCase() + uri.path.substr(2);\n        }\n        else {\n            value = uri.path.substr(1);\n        }\n    }\n    else {\n        // other path\n        value = uri.path;\n    }\n    if (isWindows) {\n        value = value.replace(/\\//g, '\\\\');\n    }\n    return value;\n}\n/**\n * Create the external version of a uri\n */\nfunction _asFormatted(uri, skipEncoding) {\n    const encoder = !skipEncoding\n        ? encodeURIComponentFast\n        : encodeURIComponentMinimal;\n    let res = '';\n    let { scheme, authority, path, query, fragment } = uri;\n    if (scheme) {\n        res += scheme;\n        res += ':';\n    }\n    if (authority || scheme === 'file') {\n        res += _slash;\n        res += _slash;\n    }\n    if (authority) {\n        let idx = authority.indexOf('@');\n        if (idx !== -1) {\n            // <user>@<auth>\n            const userinfo = authority.substr(0, idx);\n            authority = authority.substr(idx + 1);\n            idx = userinfo.lastIndexOf(':');\n            if (idx === -1) {\n                res += encoder(userinfo, false, false);\n            }\n            else {\n                // <user>:<pass>@<auth>\n                res += encoder(userinfo.substr(0, idx), false, false);\n                res += ':';\n                res += encoder(userinfo.substr(idx + 1), false, true);\n            }\n            res += '@';\n        }\n        authority = authority.toLowerCase();\n        idx = authority.lastIndexOf(':');\n        if (idx === -1) {\n            res += encoder(authority, false, true);\n        }\n        else {\n            // <auth>:<port>\n            res += encoder(authority.substr(0, idx), false, true);\n            res += authority.substr(idx);\n        }\n    }\n    if (path) {\n        // lower-case windows drive letters in /C:/fff or C:/fff\n        if (path.length >= 3 && path.charCodeAt(0) === 47 /* CharCode.Slash */ && path.charCodeAt(2) === 58 /* CharCode.Colon */) {\n            const code = path.charCodeAt(1);\n            if (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */) {\n                path = `/${String.fromCharCode(code + 32)}:${path.substr(3)}`; // \"/c:\".length === 3\n            }\n        }\n        else if (path.length >= 2 && path.charCodeAt(1) === 58 /* CharCode.Colon */) {\n            const code = path.charCodeAt(0);\n            if (code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */) {\n                path = `${String.fromCharCode(code + 32)}:${path.substr(2)}`; // \"/c:\".length === 3\n            }\n        }\n        // encode the rest of the path\n        res += encoder(path, true, false);\n    }\n    if (query) {\n        res += '?';\n        res += encoder(query, false, false);\n    }\n    if (fragment) {\n        res += '#';\n        res += !skipEncoding ? encodeURIComponentFast(fragment, false, false) : fragment;\n    }\n    return res;\n}\n// --- decode\nfunction decodeURIComponentGraceful(str) {\n    try {\n        return decodeURIComponent(str);\n    }\n    catch {\n        if (str.length > 3) {\n            return str.substr(0, 3) + decodeURIComponentGraceful(str.substr(3));\n        }\n        else {\n            return str;\n        }\n    }\n}\nconst _rEncodedAsHex = /(%[0-9A-Za-z][0-9A-Za-z])+/g;\nfunction percentDecode(str) {\n    if (!str.match(_rEncodedAsHex)) {\n        return str;\n    }\n    return str.replace(_rEncodedAsHex, (match) => decodeURIComponentGraceful(match));\n}\n\nexport { URI, uriToFsPath };\n","import { Position } from './position.js';\nimport { Range } from './range.js';\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 * A selection in the editor.\n * The selection is a range that has an orientation.\n */\nclass Selection extends Range {\n    constructor(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn) {\n        super(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn);\n        this.selectionStartLineNumber = selectionStartLineNumber;\n        this.selectionStartColumn = selectionStartColumn;\n        this.positionLineNumber = positionLineNumber;\n        this.positionColumn = positionColumn;\n    }\n    /**\n     * Transform to a human-readable representation.\n     */\n    toString() {\n        return '[' + this.selectionStartLineNumber + ',' + this.selectionStartColumn + ' -> ' + this.positionLineNumber + ',' + this.positionColumn + ']';\n    }\n    /**\n     * Test if equals other selection.\n     */\n    equalsSelection(other) {\n        return (Selection.selectionsEqual(this, other));\n    }\n    /**\n     * Test if the two selections are equal.\n     */\n    static selectionsEqual(a, b) {\n        return (a.selectionStartLineNumber === b.selectionStartLineNumber &&\n            a.selectionStartColumn === b.selectionStartColumn &&\n            a.positionLineNumber === b.positionLineNumber &&\n            a.positionColumn === b.positionColumn);\n    }\n    /**\n     * Get directions (LTR or RTL).\n     */\n    getDirection() {\n        if (this.selectionStartLineNumber === this.startLineNumber && this.selectionStartColumn === this.startColumn) {\n            return 0 /* SelectionDirection.LTR */;\n        }\n        return 1 /* SelectionDirection.RTL */;\n    }\n    /**\n     * Create a new selection with a different `positionLineNumber` and `positionColumn`.\n     */\n    setEndPosition(endLineNumber, endColumn) {\n        if (this.getDirection() === 0 /* SelectionDirection.LTR */) {\n            return new Selection(this.startLineNumber, this.startColumn, endLineNumber, endColumn);\n        }\n        return new Selection(endLineNumber, endColumn, this.startLineNumber, this.startColumn);\n    }\n    /**\n     * Get the position at `positionLineNumber` and `positionColumn`.\n     */\n    getPosition() {\n        return new Position(this.positionLineNumber, this.positionColumn);\n    }\n    /**\n     * Get the position at the start of the selection.\n    */\n    getSelectionStart() {\n        return new Position(this.selectionStartLineNumber, this.selectionStartColumn);\n    }\n    /**\n     * Create a new selection with a different `selectionStartLineNumber` and `selectionStartColumn`.\n     */\n    setStartPosition(startLineNumber, startColumn) {\n        if (this.getDirection() === 0 /* SelectionDirection.LTR */) {\n            return new Selection(startLineNumber, startColumn, this.endLineNumber, this.endColumn);\n        }\n        return new Selection(this.endLineNumber, this.endColumn, startLineNumber, startColumn);\n    }\n    // ----\n    /**\n     * Create a `Selection` from one or two positions\n     */\n    static fromPositions(start, end = start) {\n        return new Selection(start.lineNumber, start.column, end.lineNumber, end.column);\n    }\n    /**\n     * Creates a `Selection` from a range, given a direction.\n     */\n    static fromRange(range, direction) {\n        if (direction === 0 /* SelectionDirection.LTR */) {\n            return new Selection(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);\n        }\n        else {\n            return new Selection(range.endLineNumber, range.endColumn, range.startLineNumber, range.startColumn);\n        }\n    }\n    /**\n     * Create a `Selection` from an `ISelection`.\n     */\n    static liftSelection(sel) {\n        return new Selection(sel.selectionStartLineNumber, sel.selectionStartColumn, sel.positionLineNumber, sel.positionColumn);\n    }\n    /**\n     * `a` equals `b`.\n     */\n    static selectionsArrEqual(a, b) {\n        if (a && !b || !a && b) {\n            return false;\n        }\n        if (!a && !b) {\n            return true;\n        }\n        if (a.length !== b.length) {\n            return false;\n        }\n        for (let i = 0, len = a.length; i < len; i++) {\n            if (!this.selectionsEqual(a[i], b[i])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    /**\n     * Test if `obj` is an `ISelection`.\n     */\n    static isISelection(obj) {\n        return (!!obj\n            && (typeof obj.selectionStartLineNumber === 'number')\n            && (typeof obj.selectionStartColumn === 'number')\n            && (typeof obj.positionLineNumber === 'number')\n            && (typeof obj.positionColumn === 'number'));\n    }\n    /**\n     * Create with a direction.\n     */\n    static createWithDirection(startLineNumber, startColumn, endLineNumber, endColumn, direction) {\n        if (direction === 0 /* SelectionDirection.LTR */) {\n            return new Selection(startLineNumber, startColumn, endLineNumber, endColumn);\n        }\n        return new Selection(endLineNumber, endColumn, startLineNumber, startColumn);\n    }\n}\n\nexport { Selection };\n","import { isString } from './types.js';\n\nconst _codiconFontCharacters = Object.create(null);\nfunction register(id, fontCharacter) {\n    if (isString(fontCharacter)) {\n        const val = _codiconFontCharacters[fontCharacter];\n        if (val === undefined) {\n            throw new Error(`${id} references an unknown codicon: ${fontCharacter}`);\n        }\n        fontCharacter = val;\n    }\n    _codiconFontCharacters[id] = fontCharacter;\n    return { id };\n}\n/**\n * Only to be used by the iconRegistry.\n */\nfunction getCodiconFontCharacters() {\n    return _codiconFontCharacters;\n}\n\nexport { getCodiconFontCharacters, register };\n","import { register } from './codiconsUtil.js';\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// 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.\nconst codiconsLibrary = {\n    add: register('add', 0xea60),\n    plus: register('plus', 0xea60),\n    gistNew: register('gist-new', 0xea60),\n    repoCreate: register('repo-create', 0xea60),\n    lightbulb: register('lightbulb', 0xea61),\n    lightBulb: register('light-bulb', 0xea61),\n    repo: register('repo', 0xea62),\n    repoDelete: register('repo-delete', 0xea62),\n    gistFork: register('gist-fork', 0xea63),\n    repoForked: register('repo-forked', 0xea63),\n    gitPullRequest: register('git-pull-request', 0xea64),\n    gitPullRequestAbandoned: register('git-pull-request-abandoned', 0xea64),\n    recordKeys: register('record-keys', 0xea65),\n    keyboard: register('keyboard', 0xea65),\n    tag: register('tag', 0xea66),\n    gitPullRequestLabel: register('git-pull-request-label', 0xea66),\n    tagAdd: register('tag-add', 0xea66),\n    tagRemove: register('tag-remove', 0xea66),\n    person: register('person', 0xea67),\n    personFollow: register('person-follow', 0xea67),\n    personOutline: register('person-outline', 0xea67),\n    personFilled: register('person-filled', 0xea67),\n    sourceControl: register('source-control', 0xea68),\n    mirror: register('mirror', 0xea69),\n    mirrorPublic: register('mirror-public', 0xea69),\n    star: register('star', 0xea6a),\n    starAdd: register('star-add', 0xea6a),\n    starDelete: register('star-delete', 0xea6a),\n    starEmpty: register('star-empty', 0xea6a),\n    comment: register('comment', 0xea6b),\n    commentAdd: register('comment-add', 0xea6b),\n    alert: register('alert', 0xea6c),\n    warning: register('warning', 0xea6c),\n    search: register('search', 0xea6d),\n    searchSave: register('search-save', 0xea6d),\n    logOut: register('log-out', 0xea6e),\n    signOut: register('sign-out', 0xea6e),\n    logIn: register('log-in', 0xea6f),\n    signIn: register('sign-in', 0xea6f),\n    eye: register('eye', 0xea70),\n    eyeUnwatch: register('eye-unwatch', 0xea70),\n    eyeWatch: register('eye-watch', 0xea70),\n    circleFilled: register('circle-filled', 0xea71),\n    primitiveDot: register('primitive-dot', 0xea71),\n    closeDirty: register('close-dirty', 0xea71),\n    debugBreakpoint: register('debug-breakpoint', 0xea71),\n    debugBreakpointDisabled: register('debug-breakpoint-disabled', 0xea71),\n    debugHint: register('debug-hint', 0xea71),\n    terminalDecorationSuccess: register('terminal-decoration-success', 0xea71),\n    primitiveSquare: register('primitive-square', 0xea72),\n    edit: register('edit', 0xea73),\n    pencil: register('pencil', 0xea73),\n    info: register('info', 0xea74),\n    issueOpened: register('issue-opened', 0xea74),\n    gistPrivate: register('gist-private', 0xea75),\n    gitForkPrivate: register('git-fork-private', 0xea75),\n    lock: register('lock', 0xea75),\n    mirrorPrivate: register('mirror-private', 0xea75),\n    close: register('close', 0xea76),\n    removeClose: register('remove-close', 0xea76),\n    x: register('x', 0xea76),\n    repoSync: register('repo-sync', 0xea77),\n    sync: register('sync', 0xea77),\n    clone: register('clone', 0xea78),\n    desktopDownload: register('desktop-download', 0xea78),\n    beaker: register('beaker', 0xea79),\n    microscope: register('microscope', 0xea79),\n    vm: register('vm', 0xea7a),\n    deviceDesktop: register('device-desktop', 0xea7a),\n    file: register('file', 0xea7b),\n    more: register('more', 0xea7c),\n    ellipsis: register('ellipsis', 0xea7c),\n    kebabHorizontal: register('kebab-horizontal', 0xea7c),\n    mailReply: register('mail-reply', 0xea7d),\n    reply: register('reply', 0xea7d),\n    organization: register('organization', 0xea7e),\n    organizationFilled: register('organization-filled', 0xea7e),\n    organizationOutline: register('organization-outline', 0xea7e),\n    newFile: register('new-file', 0xea7f),\n    fileAdd: register('file-add', 0xea7f),\n    newFolder: register('new-folder', 0xea80),\n    fileDirectoryCreate: register('file-directory-create', 0xea80),\n    trash: register('trash', 0xea81),\n    trashcan: register('trashcan', 0xea81),\n    history: register('history', 0xea82),\n    clock: register('clock', 0xea82),\n    folder: register('folder', 0xea83),\n    fileDirectory: register('file-directory', 0xea83),\n    symbolFolder: register('symbol-folder', 0xea83),\n    logoGithub: register('logo-github', 0xea84),\n    markGithub: register('mark-github', 0xea84),\n    github: register('github', 0xea84),\n    terminal: register('terminal', 0xea85),\n    console: register('console', 0xea85),\n    repl: register('repl', 0xea85),\n    zap: register('zap', 0xea86),\n    symbolEvent: register('symbol-event', 0xea86),\n    error: register('error', 0xea87),\n    stop: register('stop', 0xea87),\n    variable: register('variable', 0xea88),\n    symbolVariable: register('symbol-variable', 0xea88),\n    array: register('array', 0xea8a),\n    symbolArray: register('symbol-array', 0xea8a),\n    symbolModule: register('symbol-module', 0xea8b),\n    symbolPackage: register('symbol-package', 0xea8b),\n    symbolNamespace: register('symbol-namespace', 0xea8b),\n    symbolObject: register('symbol-object', 0xea8b),\n    symbolMethod: register('symbol-method', 0xea8c),\n    symbolFunction: register('symbol-function', 0xea8c),\n    symbolConstructor: register('symbol-constructor', 0xea8c),\n    symbolBoolean: register('symbol-boolean', 0xea8f),\n    symbolNull: register('symbol-null', 0xea8f),\n    symbolNumeric: register('symbol-numeric', 0xea90),\n    symbolNumber: register('symbol-number', 0xea90),\n    symbolStructure: register('symbol-structure', 0xea91),\n    symbolStruct: register('symbol-struct', 0xea91),\n    symbolParameter: register('symbol-parameter', 0xea92),\n    symbolTypeParameter: register('symbol-type-parameter', 0xea92),\n    symbolKey: register('symbol-key', 0xea93),\n    symbolText: register('symbol-text', 0xea93),\n    symbolReference: register('symbol-reference', 0xea94),\n    goToFile: register('go-to-file', 0xea94),\n    symbolEnum: register('symbol-enum', 0xea95),\n    symbolValue: register('symbol-value', 0xea95),\n    symbolRuler: register('symbol-ruler', 0xea96),\n    symbolUnit: register('symbol-unit', 0xea96),\n    activateBreakpoints: register('activate-breakpoints', 0xea97),\n    archive: register('archive', 0xea98),\n    arrowBoth: register('arrow-both', 0xea99),\n    arrowDown: register('arrow-down', 0xea9a),\n    arrowLeft: register('arrow-left', 0xea9b),\n    arrowRight: register('arrow-right', 0xea9c),\n    arrowSmallDown: register('arrow-small-down', 0xea9d),\n    arrowSmallLeft: register('arrow-small-left', 0xea9e),\n    arrowSmallRight: register('arrow-small-right', 0xea9f),\n    arrowSmallUp: register('arrow-small-up', 0xeaa0),\n    arrowUp: register('arrow-up', 0xeaa1),\n    bell: register('bell', 0xeaa2),\n    bold: register('bold', 0xeaa3),\n    book: register('book', 0xeaa4),\n    bookmark: register('bookmark', 0xeaa5),\n    debugBreakpointConditionalUnverified: register('debug-breakpoint-conditional-unverified', 0xeaa6),\n    debugBreakpointConditional: register('debug-breakpoint-conditional', 0xeaa7),\n    debugBreakpointConditionalDisabled: register('debug-breakpoint-conditional-disabled', 0xeaa7),\n    debugBreakpointDataUnverified: register('debug-breakpoint-data-unverified', 0xeaa8),\n    debugBreakpointData: register('debug-breakpoint-data', 0xeaa9),\n    debugBreakpointDataDisabled: register('debug-breakpoint-data-disabled', 0xeaa9),\n    debugBreakpointLogUnverified: register('debug-breakpoint-log-unverified', 0xeaaa),\n    debugBreakpointLog: register('debug-breakpoint-log', 0xeaab),\n    debugBreakpointLogDisabled: register('debug-breakpoint-log-disabled', 0xeaab),\n    briefcase: register('briefcase', 0xeaac),\n    broadcast: register('broadcast', 0xeaad),\n    browser: register('browser', 0xeaae),\n    bug: register('bug', 0xeaaf),\n    calendar: register('calendar', 0xeab0),\n    caseSensitive: register('case-sensitive', 0xeab1),\n    check: register('check', 0xeab2),\n    checklist: register('checklist', 0xeab3),\n    chevronDown: register('chevron-down', 0xeab4),\n    chevronLeft: register('chevron-left', 0xeab5),\n    chevronRight: register('chevron-right', 0xeab6),\n    chevronUp: register('chevron-up', 0xeab7),\n    chromeClose: register('chrome-close', 0xeab8),\n    chromeMaximize: register('chrome-maximize', 0xeab9),\n    chromeMinimize: register('chrome-minimize', 0xeaba),\n    chromeRestore: register('chrome-restore', 0xeabb),\n    circleOutline: register('circle-outline', 0xeabc),\n    circle: register('circle', 0xeabc),\n    debugBreakpointUnverified: register('debug-breakpoint-unverified', 0xeabc),\n    terminalDecorationIncomplete: register('terminal-decoration-incomplete', 0xeabc),\n    circleSlash: register('circle-slash', 0xeabd),\n    circuitBoard: register('circuit-board', 0xeabe),\n    clearAll: register('clear-all', 0xeabf),\n    clippy: register('clippy', 0xeac0),\n    closeAll: register('close-all', 0xeac1),\n    cloudDownload: register('cloud-download', 0xeac2),\n    cloudUpload: register('cloud-upload', 0xeac3),\n    code: register('code', 0xeac4),\n    collapseAll: register('collapse-all', 0xeac5),\n    colorMode: register('color-mode', 0xeac6),\n    commentDiscussion: register('comment-discussion', 0xeac7),\n    creditCard: register('credit-card', 0xeac9),\n    dash: register('dash', 0xeacc),\n    dashboard: register('dashboard', 0xeacd),\n    database: register('database', 0xeace),\n    debugContinue: register('debug-continue', 0xeacf),\n    debugDisconnect: register('debug-disconnect', 0xead0),\n    debugPause: register('debug-pause', 0xead1),\n    debugRestart: register('debug-restart', 0xead2),\n    debugStart: register('debug-start', 0xead3),\n    debugStepInto: register('debug-step-into', 0xead4),\n    debugStepOut: register('debug-step-out', 0xead5),\n    debugStepOver: register('debug-step-over', 0xead6),\n    debugStop: register('debug-stop', 0xead7),\n    debug: register('debug', 0xead8),\n    deviceCameraVideo: register('device-camera-video', 0xead9),\n    deviceCamera: register('device-camera', 0xeada),\n    deviceMobile: register('device-mobile', 0xeadb),\n    diffAdded: register('diff-added', 0xeadc),\n    diffIgnored: register('diff-ignored', 0xeadd),\n    diffModified: register('diff-modified', 0xeade),\n    diffRemoved: register('diff-removed', 0xeadf),\n    diffRenamed: register('diff-renamed', 0xeae0),\n    diff: register('diff', 0xeae1),\n    diffSidebyside: register('diff-sidebyside', 0xeae1),\n    discard: register('discard', 0xeae2),\n    editorLayout: register('editor-layout', 0xeae3),\n    emptyWindow: register('empty-window', 0xeae4),\n    exclude: register('exclude', 0xeae5),\n    extensions: register('extensions', 0xeae6),\n    eyeClosed: register('eye-closed', 0xeae7),\n    fileBinary: register('file-binary', 0xeae8),\n    fileCode: register('file-code', 0xeae9),\n    fileMedia: register('file-media', 0xeaea),\n    filePdf: register('file-pdf', 0xeaeb),\n    fileSubmodule: register('file-submodule', 0xeaec),\n    fileSymlinkDirectory: register('file-symlink-directory', 0xeaed),\n    fileSymlinkFile: register('file-symlink-file', 0xeaee),\n    fileZip: register('file-zip', 0xeaef),\n    files: register('files', 0xeaf0),\n    filter: register('filter', 0xeaf1),\n    flame: register('flame', 0xeaf2),\n    foldDown: register('fold-down', 0xeaf3),\n    foldUp: register('fold-up', 0xeaf4),\n    fold: register('fold', 0xeaf5),\n    folderActive: register('folder-active', 0xeaf6),\n    folderOpened: register('folder-opened', 0xeaf7),\n    gear: register('gear', 0xeaf8),\n    gift: register('gift', 0xeaf9),\n    gistSecret: register('gist-secret', 0xeafa),\n    gist: register('gist', 0xeafb),\n    gitCommit: register('git-commit', 0xeafc),\n    gitCompare: register('git-compare', 0xeafd),\n    compareChanges: register('compare-changes', 0xeafd),\n    gitMerge: register('git-merge', 0xeafe),\n    githubAction: register('github-action', 0xeaff),\n    githubAlt: register('github-alt', 0xeb00),\n    globe: register('globe', 0xeb01),\n    grabber: register('grabber', 0xeb02),\n    graph: register('graph', 0xeb03),\n    gripper: register('gripper', 0xeb04),\n    heart: register('heart', 0xeb05),\n    home: register('home', 0xeb06),\n    horizontalRule: register('horizontal-rule', 0xeb07),\n    hubot: register('hubot', 0xeb08),\n    inbox: register('inbox', 0xeb09),\n    issueReopened: register('issue-reopened', 0xeb0b),\n    issues: register('issues', 0xeb0c),\n    italic: register('italic', 0xeb0d),\n    jersey: register('jersey', 0xeb0e),\n    json: register('json', 0xeb0f),\n    kebabVertical: register('kebab-vertical', 0xeb10),\n    key: register('key', 0xeb11),\n    law: register('law', 0xeb12),\n    lightbulbAutofix: register('lightbulb-autofix', 0xeb13),\n    linkExternal: register('link-external', 0xeb14),\n    link: register('link', 0xeb15),\n    listOrdered: register('list-ordered', 0xeb16),\n    listUnordered: register('list-unordered', 0xeb17),\n    liveShare: register('live-share', 0xeb18),\n    loading: register('loading', 0xeb19),\n    location: register('location', 0xeb1a),\n    mailRead: register('mail-read', 0xeb1b),\n    mail: register('mail', 0xeb1c),\n    markdown: register('markdown', 0xeb1d),\n    megaphone: register('megaphone', 0xeb1e),\n    mention: register('mention', 0xeb1f),\n    milestone: register('milestone', 0xeb20),\n    gitPullRequestMilestone: register('git-pull-request-milestone', 0xeb20),\n    mortarBoard: register('mortar-board', 0xeb21),\n    move: register('move', 0xeb22),\n    multipleWindows: register('multiple-windows', 0xeb23),\n    mute: register('mute', 0xeb24),\n    noNewline: register('no-newline', 0xeb25),\n    note: register('note', 0xeb26),\n    octoface: register('octoface', 0xeb27),\n    openPreview: register('open-preview', 0xeb28),\n    package: register('package', 0xeb29),\n    paintcan: register('paintcan', 0xeb2a),\n    pin: register('pin', 0xeb2b),\n    play: register('play', 0xeb2c),\n    run: register('run', 0xeb2c),\n    plug: register('plug', 0xeb2d),\n    preserveCase: register('preserve-case', 0xeb2e),\n    preview: register('preview', 0xeb2f),\n    project: register('project', 0xeb30),\n    pulse: register('pulse', 0xeb31),\n    question: register('question', 0xeb32),\n    quote: register('quote', 0xeb33),\n    radioTower: register('radio-tower', 0xeb34),\n    reactions: register('reactions', 0xeb35),\n    references: register('references', 0xeb36),\n    refresh: register('refresh', 0xeb37),\n    regex: register('regex', 0xeb38),\n    remoteExplorer: register('remote-explorer', 0xeb39),\n    remote: register('remote', 0xeb3a),\n    remove: register('remove', 0xeb3b),\n    replaceAll: register('replace-all', 0xeb3c),\n    replace: register('replace', 0xeb3d),\n    repoClone: register('repo-clone', 0xeb3e),\n    repoForcePush: register('repo-force-push', 0xeb3f),\n    repoPull: register('repo-pull', 0xeb40),\n    repoPush: register('repo-push', 0xeb41),\n    report: register('report', 0xeb42),\n    requestChanges: register('request-changes', 0xeb43),\n    rocket: register('rocket', 0xeb44),\n    rootFolderOpened: register('root-folder-opened', 0xeb45),\n    rootFolder: register('root-folder', 0xeb46),\n    rss: register('rss', 0xeb47),\n    ruby: register('ruby', 0xeb48),\n    saveAll: register('save-all', 0xeb49),\n    saveAs: register('save-as', 0xeb4a),\n    save: register('save', 0xeb4b),\n    screenFull: register('screen-full', 0xeb4c),\n    screenNormal: register('screen-normal', 0xeb4d),\n    searchStop: register('search-stop', 0xeb4e),\n    server: register('server', 0xeb50),\n    settingsGear: register('settings-gear', 0xeb51),\n    settings: register('settings', 0xeb52),\n    shield: register('shield', 0xeb53),\n    smiley: register('smiley', 0xeb54),\n    sortPrecedence: register('sort-precedence', 0xeb55),\n    splitHorizontal: register('split-horizontal', 0xeb56),\n    splitVertical: register('split-vertical', 0xeb57),\n    squirrel: register('squirrel', 0xeb58),\n    starFull: register('star-full', 0xeb59),\n    starHalf: register('star-half', 0xeb5a),\n    symbolClass: register('symbol-class', 0xeb5b),\n    symbolColor: register('symbol-color', 0xeb5c),\n    symbolConstant: register('symbol-constant', 0xeb5d),\n    symbolEnumMember: register('symbol-enum-member', 0xeb5e),\n    symbolField: register('symbol-field', 0xeb5f),\n    symbolFile: register('symbol-file', 0xeb60),\n    symbolInterface: register('symbol-interface', 0xeb61),\n    symbolKeyword: register('symbol-keyword', 0xeb62),\n    symbolMisc: register('symbol-misc', 0xeb63),\n    symbolOperator: register('symbol-operator', 0xeb64),\n    symbolProperty: register('symbol-property', 0xeb65),\n    wrench: register('wrench', 0xeb65),\n    wrenchSubaction: register('wrench-subaction', 0xeb65),\n    symbolSnippet: register('symbol-snippet', 0xeb66),\n    tasklist: register('tasklist', 0xeb67),\n    telescope: register('telescope', 0xeb68),\n    textSize: register('text-size', 0xeb69),\n    threeBars: register('three-bars', 0xeb6a),\n    thumbsdown: register('thumbsdown', 0xeb6b),\n    thumbsup: register('thumbsup', 0xeb6c),\n    tools: register('tools', 0xeb6d),\n    triangleDown: register('triangle-down', 0xeb6e),\n    triangleLeft: register('triangle-left', 0xeb6f),\n    triangleRight: register('triangle-right', 0xeb70),\n    triangleUp: register('triangle-up', 0xeb71),\n    twitter: register('twitter', 0xeb72),\n    unfold: register('unfold', 0xeb73),\n    unlock: register('unlock', 0xeb74),\n    unmute: register('unmute', 0xeb75),\n    unverified: register('unverified', 0xeb76),\n    verified: register('verified', 0xeb77),\n    versions: register('versions', 0xeb78),\n    vmActive: register('vm-active', 0xeb79),\n    vmOutline: register('vm-outline', 0xeb7a),\n    vmRunning: register('vm-running', 0xeb7b),\n    watch: register('watch', 0xeb7c),\n    whitespace: register('whitespace', 0xeb7d),\n    wholeWord: register('whole-word', 0xeb7e),\n    window: register('window', 0xeb7f),\n    wordWrap: register('word-wrap', 0xeb80),\n    zoomIn: register('zoom-in', 0xeb81),\n    zoomOut: register('zoom-out', 0xeb82),\n    listFilter: register('list-filter', 0xeb83),\n    listFlat: register('list-flat', 0xeb84),\n    listSelection: register('list-selection', 0xeb85),\n    selection: register('selection', 0xeb85),\n    listTree: register('list-tree', 0xeb86),\n    debugBreakpointFunctionUnverified: register('debug-breakpoint-function-unverified', 0xeb87),\n    debugBreakpointFunction: register('debug-breakpoint-function', 0xeb88),\n    debugBreakpointFunctionDisabled: register('debug-breakpoint-function-disabled', 0xeb88),\n    debugStackframeActive: register('debug-stackframe-active', 0xeb89),\n    circleSmallFilled: register('circle-small-filled', 0xeb8a),\n    debugStackframeDot: register('debug-stackframe-dot', 0xeb8a),\n    terminalDecorationMark: register('terminal-decoration-mark', 0xeb8a),\n    debugStackframe: register('debug-stackframe', 0xeb8b),\n    debugStackframeFocused: register('debug-stackframe-focused', 0xeb8b),\n    debugBreakpointUnsupported: register('debug-breakpoint-unsupported', 0xeb8c),\n    symbolString: register('symbol-string', 0xeb8d),\n    debugReverseContinue: register('debug-reverse-continue', 0xeb8e),\n    debugStepBack: register('debug-step-back', 0xeb8f),\n    debugRestartFrame: register('debug-restart-frame', 0xeb90),\n    debugAlt: register('debug-alt', 0xeb91),\n    callIncoming: register('call-incoming', 0xeb92),\n    callOutgoing: register('call-outgoing', 0xeb93),\n    menu: register('menu', 0xeb94),\n    expandAll: register('expand-all', 0xeb95),\n    feedback: register('feedback', 0xeb96),\n    gitPullRequestReviewer: register('git-pull-request-reviewer', 0xeb96),\n    groupByRefType: register('group-by-ref-type', 0xeb97),\n    ungroupByRefType: register('ungroup-by-ref-type', 0xeb98),\n    account: register('account', 0xeb99),\n    gitPullRequestAssignee: register('git-pull-request-assignee', 0xeb99),\n    bellDot: register('bell-dot', 0xeb9a),\n    debugConsole: register('debug-console', 0xeb9b),\n    library: register('library', 0xeb9c),\n    output: register('output', 0xeb9d),\n    runAll: register('run-all', 0xeb9e),\n    syncIgnored: register('sync-ignored', 0xeb9f),\n    pinned: register('pinned', 0xeba0),\n    githubInverted: register('github-inverted', 0xeba1),\n    serverProcess: register('server-process', 0xeba2),\n    serverEnvironment: register('server-environment', 0xeba3),\n    pass: register('pass', 0xeba4),\n    issueClosed: register('issue-closed', 0xeba4),\n    stopCircle: register('stop-circle', 0xeba5),\n    playCircle: register('play-circle', 0xeba6),\n    record: register('record', 0xeba7),\n    debugAltSmall: register('debug-alt-small', 0xeba8),\n    vmConnect: register('vm-connect', 0xeba9),\n    cloud: register('cloud', 0xebaa),\n    merge: register('merge', 0xebab),\n    export: register('export', 0xebac),\n    graphLeft: register('graph-left', 0xebad),\n    magnet: register('magnet', 0xebae),\n    notebook: register('notebook', 0xebaf),\n    redo: register('redo', 0xebb0),\n    checkAll: register('check-all', 0xebb1),\n    pinnedDirty: register('pinned-dirty', 0xebb2),\n    passFilled: register('pass-filled', 0xebb3),\n    circleLargeFilled: register('circle-large-filled', 0xebb4),\n    circleLarge: register('circle-large', 0xebb5),\n    circleLargeOutline: register('circle-large-outline', 0xebb5),\n    combine: register('combine', 0xebb6),\n    gather: register('gather', 0xebb6),\n    table: register('table', 0xebb7),\n    variableGroup: register('variable-group', 0xebb8),\n    typeHierarchy: register('type-hierarchy', 0xebb9),\n    typeHierarchySub: register('type-hierarchy-sub', 0xebba),\n    typeHierarchySuper: register('type-hierarchy-super', 0xebbb),\n    gitPullRequestCreate: register('git-pull-request-create', 0xebbc),\n    runAbove: register('run-above', 0xebbd),\n    runBelow: register('run-below', 0xebbe),\n    notebookTemplate: register('notebook-template', 0xebbf),\n    debugRerun: register('debug-rerun', 0xebc0),\n    workspaceTrusted: register('workspace-trusted', 0xebc1),\n    workspaceUntrusted: register('workspace-untrusted', 0xebc2),\n    workspaceUnknown: register('workspace-unknown', 0xebc3),\n    terminalCmd: register('terminal-cmd', 0xebc4),\n    terminalDebian: register('terminal-debian', 0xebc5),\n    terminalLinux: register('terminal-linux', 0xebc6),\n    terminalPowershell: register('terminal-powershell', 0xebc7),\n    terminalTmux: register('terminal-tmux', 0xebc8),\n    terminalUbuntu: register('terminal-ubuntu', 0xebc9),\n    terminalBash: register('terminal-bash', 0xebca),\n    arrowSwap: register('arrow-swap', 0xebcb),\n    copy: register('copy', 0xebcc),\n    personAdd: register('person-add', 0xebcd),\n    filterFilled: register('filter-filled', 0xebce),\n    wand: register('wand', 0xebcf),\n    debugLineByLine: register('debug-line-by-line', 0xebd0),\n    inspect: register('inspect', 0xebd1),\n    layers: register('layers', 0xebd2),\n    layersDot: register('layers-dot', 0xebd3),\n    layersActive: register('layers-active', 0xebd4),\n    compass: register('compass', 0xebd5),\n    compassDot: register('compass-dot', 0xebd6),\n    compassActive: register('compass-active', 0xebd7),\n    azure: register('azure', 0xebd8),\n    issueDraft: register('issue-draft', 0xebd9),\n    gitPullRequestClosed: register('git-pull-request-closed', 0xebda),\n    gitPullRequestDraft: register('git-pull-request-draft', 0xebdb),\n    debugAll: register('debug-all', 0xebdc),\n    debugCoverage: register('debug-coverage', 0xebdd),\n    runErrors: register('run-errors', 0xebde),\n    folderLibrary: register('folder-library', 0xebdf),\n    debugContinueSmall: register('debug-continue-small', 0xebe0),\n    beakerStop: register('beaker-stop', 0xebe1),\n    graphLine: register('graph-line', 0xebe2),\n    graphScatter: register('graph-scatter', 0xebe3),\n    pieChart: register('pie-chart', 0xebe4),\n    bracket: register('bracket', 0xeb0f),\n    bracketDot: register('bracket-dot', 0xebe5),\n    bracketError: register('bracket-error', 0xebe6),\n    lockSmall: register('lock-small', 0xebe7),\n    azureDevops: register('azure-devops', 0xebe8),\n    verifiedFilled: register('verified-filled', 0xebe9),\n    newline: register('newline', 0xebea),\n    layout: register('layout', 0xebeb),\n    layoutActivitybarLeft: register('layout-activitybar-left', 0xebec),\n    layoutActivitybarRight: register('layout-activitybar-right', 0xebed),\n    layoutPanelLeft: register('layout-panel-left', 0xebee),\n    layoutPanelCenter: register('layout-panel-center', 0xebef),\n    layoutPanelJustify: register('layout-panel-justify', 0xebf0),\n    layoutPanelRight: register('layout-panel-right', 0xebf1),\n    layoutPanel: register('layout-panel', 0xebf2),\n    layoutSidebarLeft: register('layout-sidebar-left', 0xebf3),\n    layoutSidebarRight: register('layout-sidebar-right', 0xebf4),\n    layoutStatusbar: register('layout-statusbar', 0xebf5),\n    layoutMenubar: register('layout-menubar', 0xebf6),\n    layoutCentered: register('layout-centered', 0xebf7),\n    target: register('target', 0xebf8),\n    indent: register('indent', 0xebf9),\n    recordSmall: register('record-small', 0xebfa),\n    errorSmall: register('error-small', 0xebfb),\n    terminalDecorationError: register('terminal-decoration-error', 0xebfb),\n    arrowCircleDown: register('arrow-circle-down', 0xebfc),\n    arrowCircleLeft: register('arrow-circle-left', 0xebfd),\n    arrowCircleRight: register('arrow-circle-right', 0xebfe),\n    arrowCircleUp: register('arrow-circle-up', 0xebff),\n    layoutSidebarRightOff: register('layout-sidebar-right-off', 0xec00),\n    layoutPanelOff: register('layout-panel-off', 0xec01),\n    layoutSidebarLeftOff: register('layout-sidebar-left-off', 0xec02),\n    blank: register('blank', 0xec03),\n    heartFilled: register('heart-filled', 0xec04),\n    map: register('map', 0xec05),\n    mapHorizontal: register('map-horizontal', 0xec05),\n    foldHorizontal: register('fold-horizontal', 0xec05),\n    mapFilled: register('map-filled', 0xec06),\n    mapHorizontalFilled: register('map-horizontal-filled', 0xec06),\n    foldHorizontalFilled: register('fold-horizontal-filled', 0xec06),\n    circleSmall: register('circle-small', 0xec07),\n    bellSlash: register('bell-slash', 0xec08),\n    bellSlashDot: register('bell-slash-dot', 0xec09),\n    commentUnresolved: register('comment-unresolved', 0xec0a),\n    gitPullRequestGoToChanges: register('git-pull-request-go-to-changes', 0xec0b),\n    gitPullRequestNewChanges: register('git-pull-request-new-changes', 0xec0c),\n    searchFuzzy: register('search-fuzzy', 0xec0d),\n    commentDraft: register('comment-draft', 0xec0e),\n    send: register('send', 0xec0f),\n    sparkle: register('sparkle', 0xec10),\n    insert: register('insert', 0xec11),\n    mic: register('mic', 0xec12),\n    thumbsdownFilled: register('thumbsdown-filled', 0xec13),\n    thumbsupFilled: register('thumbsup-filled', 0xec14),\n    coffee: register('coffee', 0xec15),\n    snake: register('snake', 0xec16),\n    game: register('game', 0xec17),\n    vr: register('vr', 0xec18),\n    chip: register('chip', 0xec19),\n    piano: register('piano', 0xec1a),\n    music: register('music', 0xec1b),\n    micFilled: register('mic-filled', 0xec1c),\n    repoFetch: register('repo-fetch', 0xec1d),\n    copilot: register('copilot', 0xec1e),\n    lightbulbSparkle: register('lightbulb-sparkle', 0xec1f),\n    robot: register('robot', 0xec20),\n    sparkleFilled: register('sparkle-filled', 0xec21),\n    diffSingle: register('diff-single', 0xec22),\n    diffMultiple: register('diff-multiple', 0xec23),\n    surroundWith: register('surround-with', 0xec24),\n    share: register('share', 0xec25),\n    gitStash: register('git-stash', 0xec26),\n    gitStashApply: register('git-stash-apply', 0xec27),\n    gitStashPop: register('git-stash-pop', 0xec28),\n    vscode: register('vscode', 0xec29),\n    vscodeInsiders: register('vscode-insiders', 0xec2a),\n    codeOss: register('code-oss', 0xec2b),\n    runCoverage: register('run-coverage', 0xec2c),\n    runAllCoverage: register('run-all-coverage', 0xec2d),\n    coverage: register('coverage', 0xec2e),\n    githubProject: register('github-project', 0xec2f),\n    mapVertical: register('map-vertical', 0xec30),\n    foldVertical: register('fold-vertical', 0xec30),\n    mapVerticalFilled: register('map-vertical-filled', 0xec31),\n    foldVerticalFilled: register('fold-vertical-filled', 0xec31),\n    goToSearch: register('go-to-search', 0xec32),\n    percentage: register('percentage', 0xec33),\n    sortPercentage: register('sort-percentage', 0xec33),\n    attach: register('attach', 0xec34),\n    goToEditingSession: register('go-to-editing-session', 0xec35),\n    editSession: register('edit-session', 0xec36),\n    codeReview: register('code-review', 0xec37),\n    copilotWarning: register('copilot-warning', 0xec38),\n    python: register('python', 0xec39),\n    copilotLarge: register('copilot-large', 0xec3a),\n    copilotWarningLarge: register('copilot-warning-large', 0xec3b),\n    keyboardTab: register('keyboard-tab', 0xec3c),\n    copilotBlocked: register('copilot-blocked', 0xec3d),\n    copilotNotConnected: register('copilot-not-connected', 0xec3e),\n    flag: register('flag', 0xec3f),\n    lightbulbEmpty: register('lightbulb-empty', 0xec40),\n    symbolMethodArrow: register('symbol-method-arrow', 0xec41),\n    copilotUnavailable: register('copilot-unavailable', 0xec42),\n    repoPinned: register('repo-pinned', 0xec43),\n    keyboardTabAbove: register('keyboard-tab-above', 0xec44),\n    keyboardTabBelow: register('keyboard-tab-below', 0xec45),\n    gitPullRequestDone: register('git-pull-request-done', 0xec46),\n    mcp: register('mcp', 0xec47),\n    extensionsLarge: register('extensions-large', 0xec48),\n    layoutPanelDock: register('layout-panel-dock', 0xec49),\n    layoutSidebarLeftDock: register('layout-sidebar-left-dock', 0xec4a),\n    layoutSidebarRightDock: register('layout-sidebar-right-dock', 0xec4b),\n    copilotInProgress: register('copilot-in-progress', 0xec4c),\n    copilotError: register('copilot-error', 0xec4d),\n    copilotSuccess: register('copilot-success', 0xec4e),\n    chatSparkle: register('chat-sparkle', 0xec4f),\n    searchSparkle: register('search-sparkle', 0xec50),\n    editSparkle: register('edit-sparkle', 0xec51),\n    copilotSnooze: register('copilot-snooze', 0xec52),\n    sendToRemoteAgent: register('send-to-remote-agent', 0xec53),\n    commentDiscussionSparkle: register('comment-discussion-sparkle', 0xec54),\n    chatSparkleWarning: register('chat-sparkle-warning', 0xec55),\n    chatSparkleError: register('chat-sparkle-error', 0xec56),\n    collection: register('collection', 0xec57),\n    newCollection: register('new-collection', 0xec58),\n    thinking: register('thinking', 0xec59),\n    build: register('build', 0xec5a),\n    commentDiscussionQuote: register('comment-discussion-quote', 0xec5b),\n    cursor: register('cursor', 0xec5c),\n    eraser: register('eraser', 0xec5d),\n    fileText: register('file-text', 0xec5e),\n    gitLens: register('git-lens', 0xec5f),\n    quotes: register('quotes', 0xec60),\n    rename: register('rename', 0xec61),\n    runWithDeps: register('run-with-deps', 0xec62),\n    debugConnected: register('debug-connected', 0xec63),\n    strikethrough: register('strikethrough', 0xec64),\n    openInProduct: register('open-in-product', 0xec65),\n    indexZero: register('index-zero', 0xec66),\n    agent: register('agent', 0xec67),\n    editCode: register('edit-code', 0xec68),\n    repoSelected: register('repo-selected', 0xec69),\n    skip: register('skip', 0xec6a),\n    mergeInto: register('merge-into', 0xec6b),\n    gitBranchChanges: register('git-branch-changes', 0xec6c),\n    gitBranchStagedChanges: register('git-branch-staged-changes', 0xec6d),\n    gitBranchConflicts: register('git-branch-conflicts', 0xec6e),\n    gitBranch: register('git-branch', 0xec6f),\n    gitBranchCreate: register('git-branch-create', 0xec6f),\n    gitBranchDelete: register('git-branch-delete', 0xec6f),\n    searchLarge: register('search-large', 0xec70),\n    terminalGitBash: register('terminal-git-bash', 0xec71),\n};\n\nexport { codiconsLibrary };\n","import { register } from './codiconsUtil.js';\nimport { codiconsLibrary } from './codiconsLibrary.js';\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 */\nconst codiconsDerived = {\n    dialogError: register('dialog-error', 'error'),\n    dialogWarning: register('dialog-warning', 'warning'),\n    dialogInfo: register('dialog-info', 'info'),\n    dialogClose: register('dialog-close', 'close'),\n    treeItemExpanded: register('tree-item-expanded', 'chevron-down'), // collapsed is done with rotation\n    treeFilterOnTypeOn: register('tree-filter-on-type-on', 'list-filter'),\n    treeFilterOnTypeOff: register('tree-filter-on-type-off', 'list-selection'),\n    treeFilterClear: register('tree-filter-clear', 'close'),\n    treeItemLoading: register('tree-item-loading', 'loading'),\n    menuSelection: register('menu-selection', 'check'),\n    menuSubmenu: register('menu-submenu', 'chevron-right'),\n    menuBarMore: register('menubar-more', 'more'),\n    scrollbarButtonLeft: register('scrollbar-button-left', 'triangle-left'),\n    scrollbarButtonRight: register('scrollbar-button-right', 'triangle-right'),\n    scrollbarButtonUp: register('scrollbar-button-up', 'triangle-up'),\n    scrollbarButtonDown: register('scrollbar-button-down', 'triangle-down'),\n    toolBarMore: register('toolbar-more', 'more'),\n    quickInputBack: register('quick-input-back', 'arrow-left'),\n    dropDownButton: register('drop-down-button', 0xeab4),\n    symbolCustomColor: register('symbol-customcolor', 0xeb5c),\n    exportIcon: register('export', 0xebac),\n    workspaceUnspecified: register('workspace-unspecified', 0xebc3),\n    newLine: register('newline', 0xebea),\n    thumbsDownFilled: register('thumbsdown-filled', 0xec13),\n    thumbsUpFilled: register('thumbsup-filled', 0xec14),\n    gitFetch: register('git-fetch', 0xec1d),\n    lightbulbSparkleAutofix: register('lightbulb-sparkle-autofix', 0xec1f),\n    debugBreakpointPending: register('debug-breakpoint-pending', 0xebd9),\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 */\nconst Codicon = {\n    ...codiconsLibrary,\n    ...codiconsDerived\n};\n\nexport { Codicon, codiconsDerived };\n","import { Emitter } from '../../base/common/event.js';\nimport { toDisposable, Disposable } from '../../base/common/lifecycle.js';\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 *--------------------------------------------------------------------------------------------*/\nclass TokenizationRegistry {\n    constructor() {\n        this._tokenizationSupports = new Map();\n        this._factories = new Map();\n        this._onDidChange = new Emitter();\n        this.onDidChange = this._onDidChange.event;\n        this._colorMap = null;\n    }\n    handleChange(languageIds) {\n        this._onDidChange.fire({\n            changedLanguages: languageIds,\n            changedColorMap: false\n        });\n    }\n    register(languageId, support) {\n        this._tokenizationSupports.set(languageId, support);\n        this.handleChange([languageId]);\n        return toDisposable(() => {\n            if (this._tokenizationSupports.get(languageId) !== support) {\n                return;\n            }\n            this._tokenizationSupports.delete(languageId);\n            this.handleChange([languageId]);\n        });\n    }\n    get(languageId) {\n        return this._tokenizationSupports.get(languageId) || null;\n    }\n    registerFactory(languageId, factory) {\n        this._factories.get(languageId)?.dispose();\n        const myData = new TokenizationSupportFactoryData(this, languageId, factory);\n        this._factories.set(languageId, myData);\n        return toDisposable(() => {\n            const v = this._factories.get(languageId);\n            if (!v || v !== myData) {\n                return;\n            }\n            this._factories.delete(languageId);\n            v.dispose();\n        });\n    }\n    async getOrCreate(languageId) {\n        // check first if the support is already set\n        const tokenizationSupport = this.get(languageId);\n        if (tokenizationSupport) {\n            return tokenizationSupport;\n        }\n        const factory = this._factories.get(languageId);\n        if (!factory || factory.isResolved) {\n            // no factory or factory.resolve already finished\n            return null;\n        }\n        await factory.resolve();\n        return this.get(languageId);\n    }\n    isResolved(languageId) {\n        const tokenizationSupport = this.get(languageId);\n        if (tokenizationSupport) {\n            return true;\n        }\n        const factory = this._factories.get(languageId);\n        if (!factory || factory.isResolved) {\n            return true;\n        }\n        return false;\n    }\n    setColorMap(colorMap) {\n        this._colorMap = colorMap;\n        this._onDidChange.fire({\n            changedLanguages: Array.from(this._tokenizationSupports.keys()),\n            changedColorMap: true\n        });\n    }\n    getColorMap() {\n        return this._colorMap;\n    }\n    getDefaultBackground() {\n        if (this._colorMap && this._colorMap.length > 2 /* ColorId.DefaultBackground */) {\n            return this._colorMap[2 /* ColorId.DefaultBackground */];\n        }\n        return null;\n    }\n}\nclass TokenizationSupportFactoryData extends Disposable {\n    get isResolved() {\n        return this._isResolved;\n    }\n    constructor(_registry, _languageId, _factory) {\n        super();\n        this._registry = _registry;\n        this._languageId = _languageId;\n        this._factory = _factory;\n        this._isDisposed = false;\n        this._resolvePromise = null;\n        this._isResolved = false;\n    }\n    dispose() {\n        this._isDisposed = true;\n        super.dispose();\n    }\n    async resolve() {\n        if (!this._resolvePromise) {\n            this._resolvePromise = this._create();\n        }\n        return this._resolvePromise;\n    }\n    async _create() {\n        const value = await this._factory.tokenizationSupport;\n        this._isResolved = true;\n        if (value && !this._isDisposed) {\n            this._register(this._registry.register(this._languageId, value));\n        }\n    }\n}\n\nexport { TokenizationRegistry };\n","import { Codicon } from '../../base/common/codicons.js';\nimport { URI } from '../../base/common/uri.js';\nimport { Range } from './core/range.js';\nimport { TokenizationRegistry as TokenizationRegistry$1 } from './tokenizationRegistry.js';\nimport { localize } from '../../nls.js';\n\nclass Token {\n    constructor(offset, type, language) {\n        this.offset = offset;\n        this.type = type;\n        this.language = language;\n        this._tokenBrand = undefined;\n    }\n    toString() {\n        return '(' + this.offset + ', ' + this.type + ')';\n    }\n}\n/**\n * @internal\n */\nclass TokenizationResult {\n    constructor(tokens, endState) {\n        this.tokens = tokens;\n        this.endState = endState;\n        this._tokenizationResultBrand = undefined;\n    }\n}\n/**\n * @internal\n */\nclass EncodedTokenizationResult {\n    constructor(\n    /**\n     * The tokens in binary format. Each token occupies two array indices. For token i:\n     *  - at offset 2*i => startIndex\n     *  - at offset 2*i + 1 => metadata\n     *\n     */\n    tokens, endState) {\n        this.tokens = tokens;\n        this.endState = endState;\n        this._encodedTokenizationResultBrand = undefined;\n    }\n}\nvar HoverVerbosityAction;\n(function (HoverVerbosityAction) {\n    /**\n     * Increase the verbosity of the hover\n     */\n    HoverVerbosityAction[HoverVerbosityAction[\"Increase\"] = 0] = \"Increase\";\n    /**\n     * Decrease the verbosity of the hover\n     */\n    HoverVerbosityAction[HoverVerbosityAction[\"Decrease\"] = 1] = \"Decrease\";\n})(HoverVerbosityAction || (HoverVerbosityAction = {}));\n/**\n * @internal\n */\nvar CompletionItemKinds;\n(function (CompletionItemKinds) {\n    const byKind = new Map();\n    byKind.set(0 /* CompletionItemKind.Method */, Codicon.symbolMethod);\n    byKind.set(1 /* CompletionItemKind.Function */, Codicon.symbolFunction);\n    byKind.set(2 /* CompletionItemKind.Constructor */, Codicon.symbolConstructor);\n    byKind.set(3 /* CompletionItemKind.Field */, Codicon.symbolField);\n    byKind.set(4 /* CompletionItemKind.Variable */, Codicon.symbolVariable);\n    byKind.set(5 /* CompletionItemKind.Class */, Codicon.symbolClass);\n    byKind.set(6 /* CompletionItemKind.Struct */, Codicon.symbolStruct);\n    byKind.set(7 /* CompletionItemKind.Interface */, Codicon.symbolInterface);\n    byKind.set(8 /* CompletionItemKind.Module */, Codicon.symbolModule);\n    byKind.set(9 /* CompletionItemKind.Property */, Codicon.symbolProperty);\n    byKind.set(10 /* CompletionItemKind.Event */, Codicon.symbolEvent);\n    byKind.set(11 /* CompletionItemKind.Operator */, Codicon.symbolOperator);\n    byKind.set(12 /* CompletionItemKind.Unit */, Codicon.symbolUnit);\n    byKind.set(13 /* CompletionItemKind.Value */, Codicon.symbolValue);\n    byKind.set(15 /* CompletionItemKind.Enum */, Codicon.symbolEnum);\n    byKind.set(14 /* CompletionItemKind.Constant */, Codicon.symbolConstant);\n    byKind.set(15 /* CompletionItemKind.Enum */, Codicon.symbolEnum);\n    byKind.set(16 /* CompletionItemKind.EnumMember */, Codicon.symbolEnumMember);\n    byKind.set(17 /* CompletionItemKind.Keyword */, Codicon.symbolKeyword);\n    byKind.set(28 /* CompletionItemKind.Snippet */, Codicon.symbolSnippet);\n    byKind.set(18 /* CompletionItemKind.Text */, Codicon.symbolText);\n    byKind.set(19 /* CompletionItemKind.Color */, Codicon.symbolColor);\n    byKind.set(20 /* CompletionItemKind.File */, Codicon.symbolFile);\n    byKind.set(21 /* CompletionItemKind.Reference */, Codicon.symbolReference);\n    byKind.set(22 /* CompletionItemKind.Customcolor */, Codicon.symbolCustomColor);\n    byKind.set(23 /* CompletionItemKind.Folder */, Codicon.symbolFolder);\n    byKind.set(24 /* CompletionItemKind.TypeParameter */, Codicon.symbolTypeParameter);\n    byKind.set(25 /* CompletionItemKind.User */, Codicon.account);\n    byKind.set(26 /* CompletionItemKind.Issue */, Codicon.issues);\n    byKind.set(27 /* CompletionItemKind.Tool */, Codicon.tools);\n    /**\n     * @internal\n     */\n    function toIcon(kind) {\n        let codicon = byKind.get(kind);\n        if (!codicon) {\n            console.info('No codicon found for CompletionItemKind ' + kind);\n            codicon = Codicon.symbolProperty;\n        }\n        return codicon;\n    }\n    CompletionItemKinds.toIcon = toIcon;\n    /**\n     * @internal\n     */\n    function toLabel(kind) {\n        switch (kind) {\n            case 0 /* CompletionItemKind.Method */: return localize(728, 'Method');\n            case 1 /* CompletionItemKind.Function */: return localize(729, 'Function');\n            case 2 /* CompletionItemKind.Constructor */: return localize(730, 'Constructor');\n            case 3 /* CompletionItemKind.Field */: return localize(731, 'Field');\n            case 4 /* CompletionItemKind.Variable */: return localize(732, 'Variable');\n            case 5 /* CompletionItemKind.Class */: return localize(733, 'Class');\n            case 6 /* CompletionItemKind.Struct */: return localize(734, 'Struct');\n            case 7 /* CompletionItemKind.Interface */: return localize(735, 'Interface');\n            case 8 /* CompletionItemKind.Module */: return localize(736, 'Module');\n            case 9 /* CompletionItemKind.Property */: return localize(737, 'Property');\n            case 10 /* CompletionItemKind.Event */: return localize(738, 'Event');\n            case 11 /* CompletionItemKind.Operator */: return localize(739, 'Operator');\n            case 12 /* CompletionItemKind.Unit */: return localize(740, 'Unit');\n            case 13 /* CompletionItemKind.Value */: return localize(741, 'Value');\n            case 14 /* CompletionItemKind.Constant */: return localize(742, 'Constant');\n            case 15 /* CompletionItemKind.Enum */: return localize(743, 'Enum');\n            case 16 /* CompletionItemKind.EnumMember */: return localize(744, 'Enum Member');\n            case 17 /* CompletionItemKind.Keyword */: return localize(745, 'Keyword');\n            case 18 /* CompletionItemKind.Text */: return localize(746, 'Text');\n            case 19 /* CompletionItemKind.Color */: return localize(747, 'Color');\n            case 20 /* CompletionItemKind.File */: return localize(748, 'File');\n            case 21 /* CompletionItemKind.Reference */: return localize(749, 'Reference');\n            case 22 /* CompletionItemKind.Customcolor */: return localize(750, 'Custom Color');\n            case 23 /* CompletionItemKind.Folder */: return localize(751, 'Folder');\n            case 24 /* CompletionItemKind.TypeParameter */: return localize(752, 'Type Parameter');\n            case 25 /* CompletionItemKind.User */: return localize(753, 'User');\n            case 26 /* CompletionItemKind.Issue */: return localize(754, 'Issue');\n            case 27 /* CompletionItemKind.Tool */: return localize(755, 'Tool');\n            case 28 /* CompletionItemKind.Snippet */: return localize(756, 'Snippet');\n            default: return '';\n        }\n    }\n    CompletionItemKinds.toLabel = toLabel;\n    const data = new Map();\n    data.set('method', 0 /* CompletionItemKind.Method */);\n    data.set('function', 1 /* CompletionItemKind.Function */);\n    data.set('constructor', 2 /* CompletionItemKind.Constructor */);\n    data.set('field', 3 /* CompletionItemKind.Field */);\n    data.set('variable', 4 /* CompletionItemKind.Variable */);\n    data.set('class', 5 /* CompletionItemKind.Class */);\n    data.set('struct', 6 /* CompletionItemKind.Struct */);\n    data.set('interface', 7 /* CompletionItemKind.Interface */);\n    data.set('module', 8 /* CompletionItemKind.Module */);\n    data.set('property', 9 /* CompletionItemKind.Property */);\n    data.set('event', 10 /* CompletionItemKind.Event */);\n    data.set('operator', 11 /* CompletionItemKind.Operator */);\n    data.set('unit', 12 /* CompletionItemKind.Unit */);\n    data.set('value', 13 /* CompletionItemKind.Value */);\n    data.set('constant', 14 /* CompletionItemKind.Constant */);\n    data.set('enum', 15 /* CompletionItemKind.Enum */);\n    data.set('enum-member', 16 /* CompletionItemKind.EnumMember */);\n    data.set('enumMember', 16 /* CompletionItemKind.EnumMember */);\n    data.set('keyword', 17 /* CompletionItemKind.Keyword */);\n    data.set('snippet', 28 /* CompletionItemKind.Snippet */);\n    data.set('text', 18 /* CompletionItemKind.Text */);\n    data.set('color', 19 /* CompletionItemKind.Color */);\n    data.set('file', 20 /* CompletionItemKind.File */);\n    data.set('reference', 21 /* CompletionItemKind.Reference */);\n    data.set('customcolor', 22 /* CompletionItemKind.Customcolor */);\n    data.set('folder', 23 /* CompletionItemKind.Folder */);\n    data.set('type-parameter', 24 /* CompletionItemKind.TypeParameter */);\n    data.set('typeParameter', 24 /* CompletionItemKind.TypeParameter */);\n    data.set('account', 25 /* CompletionItemKind.User */);\n    data.set('issue', 26 /* CompletionItemKind.Issue */);\n    data.set('tool', 27 /* CompletionItemKind.Tool */);\n    /**\n     * @internal\n     */\n    function fromString(value, strict) {\n        let res = data.get(value);\n        if (typeof res === 'undefined' && !strict) {\n            res = 9 /* CompletionItemKind.Property */;\n        }\n        return res;\n    }\n    CompletionItemKinds.fromString = fromString;\n})(CompletionItemKinds || (CompletionItemKinds = {}));\n/**\n * How an {@link InlineCompletionsProvider inline completion provider} was triggered.\n */\nvar InlineCompletionTriggerKind;\n(function (InlineCompletionTriggerKind) {\n    /**\n     * Completion was triggered automatically while editing.\n     * It is sufficient to return a single completion item in this case.\n     */\n    InlineCompletionTriggerKind[InlineCompletionTriggerKind[\"Automatic\"] = 0] = \"Automatic\";\n    /**\n     * Completion was triggered explicitly by a user gesture.\n     * Return multiple completion items to enable cycling through them.\n     */\n    InlineCompletionTriggerKind[InlineCompletionTriggerKind[\"Explicit\"] = 1] = \"Explicit\";\n})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));\nclass SelectedSuggestionInfo {\n    constructor(range, text, completionKind, isSnippetText) {\n        this.range = range;\n        this.text = text;\n        this.completionKind = completionKind;\n        this.isSnippetText = isSnippetText;\n    }\n    equals(other) {\n        return Range.lift(this.range).equalsRange(other.range)\n            && this.text === other.text\n            && this.completionKind === other.completionKind\n            && this.isSnippetText === other.isSnippetText;\n    }\n}\nvar InlineCompletionHintStyle;\n(function (InlineCompletionHintStyle) {\n    InlineCompletionHintStyle[InlineCompletionHintStyle[\"Code\"] = 1] = \"Code\";\n    InlineCompletionHintStyle[InlineCompletionHintStyle[\"Label\"] = 2] = \"Label\";\n})(InlineCompletionHintStyle || (InlineCompletionHintStyle = {}));\n/** @internal */\nclass ProviderId {\n    static fromExtensionId(extensionId) {\n        return new ProviderId(extensionId, undefined, undefined);\n    }\n    constructor(extensionId, extensionVersion, providerId) {\n        this.extensionId = extensionId;\n        this.extensionVersion = extensionVersion;\n        this.providerId = providerId;\n    }\n    toString() {\n        let result = '';\n        if (this.extensionId) {\n            result += this.extensionId;\n        }\n        if (this.extensionVersion) {\n            result += `@${this.extensionVersion}`;\n        }\n        if (this.providerId) {\n            result += `:${this.providerId}`;\n        }\n        if (result.length === 0) {\n            result = 'unknown';\n        }\n        return result;\n    }\n    toStringWithoutVersion() {\n        let result = '';\n        if (this.extensionId) {\n            result += this.extensionId;\n        }\n        if (this.providerId) {\n            result += `:${this.providerId}`;\n        }\n        return result;\n    }\n}\nvar InlineCompletionEndOfLifeReasonKind;\n(function (InlineCompletionEndOfLifeReasonKind) {\n    InlineCompletionEndOfLifeReasonKind[InlineCompletionEndOfLifeReasonKind[\"Accepted\"] = 0] = \"Accepted\";\n    InlineCompletionEndOfLifeReasonKind[InlineCompletionEndOfLifeReasonKind[\"Rejected\"] = 1] = \"Rejected\";\n    InlineCompletionEndOfLifeReasonKind[InlineCompletionEndOfLifeReasonKind[\"Ignored\"] = 2] = \"Ignored\";\n})(InlineCompletionEndOfLifeReasonKind || (InlineCompletionEndOfLifeReasonKind = {}));\n/**\n * @internal\n */\nvar DocumentPasteTriggerKind;\n(function (DocumentPasteTriggerKind) {\n    DocumentPasteTriggerKind[DocumentPasteTriggerKind[\"Automatic\"] = 0] = \"Automatic\";\n    DocumentPasteTriggerKind[DocumentPasteTriggerKind[\"PasteAs\"] = 1] = \"PasteAs\";\n})(DocumentPasteTriggerKind || (DocumentPasteTriggerKind = {}));\nvar SignatureHelpTriggerKind;\n(function (SignatureHelpTriggerKind) {\n    SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"Invoke\"] = 1] = \"Invoke\";\n    SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"TriggerCharacter\"] = 2] = \"TriggerCharacter\";\n    SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"ContentChange\"] = 3] = \"ContentChange\";\n})(SignatureHelpTriggerKind || (SignatureHelpTriggerKind = {}));\n/**\n * A document highlight kind.\n */\nvar DocumentHighlightKind;\n(function (DocumentHighlightKind) {\n    /**\n     * A textual occurrence.\n     */\n    DocumentHighlightKind[DocumentHighlightKind[\"Text\"] = 0] = \"Text\";\n    /**\n     * Read-access of a symbol, like reading a variable.\n     */\n    DocumentHighlightKind[DocumentHighlightKind[\"Read\"] = 1] = \"Read\";\n    /**\n     * Write-access of a symbol, like writing to a variable.\n     */\n    DocumentHighlightKind[DocumentHighlightKind[\"Write\"] = 2] = \"Write\";\n})(DocumentHighlightKind || (DocumentHighlightKind = {}));\n/**\n * @internal\n */\nfunction isLocationLink(thing) {\n    return !!thing\n        && URI.isUri(thing.uri)\n        && Range.isIRange(thing.range)\n        && (Range.isIRange(thing.originSelectionRange) || Range.isIRange(thing.targetSelectionRange));\n}\n/**\n * @internal\n */\nconst symbolKindNames = {\n    [17 /* SymbolKind.Array */]: localize(757, \"array\"),\n    [16 /* SymbolKind.Boolean */]: localize(758, \"boolean\"),\n    [4 /* SymbolKind.Class */]: localize(759, \"class\"),\n    [13 /* SymbolKind.Constant */]: localize(760, \"constant\"),\n    [8 /* SymbolKind.Constructor */]: localize(761, \"constructor\"),\n    [9 /* SymbolKind.Enum */]: localize(762, \"enumeration\"),\n    [21 /* SymbolKind.EnumMember */]: localize(763, \"enumeration member\"),\n    [23 /* SymbolKind.Event */]: localize(764, \"event\"),\n    [7 /* SymbolKind.Field */]: localize(765, \"field\"),\n    [0 /* SymbolKind.File */]: localize(766, \"file\"),\n    [11 /* SymbolKind.Function */]: localize(767, \"function\"),\n    [10 /* SymbolKind.Interface */]: localize(768, \"interface\"),\n    [19 /* SymbolKind.Key */]: localize(769, \"key\"),\n    [5 /* SymbolKind.Method */]: localize(770, \"method\"),\n    [1 /* SymbolKind.Module */]: localize(771, \"module\"),\n    [2 /* SymbolKind.Namespace */]: localize(772, \"namespace\"),\n    [20 /* SymbolKind.Null */]: localize(773, \"null\"),\n    [15 /* SymbolKind.Number */]: localize(774, \"number\"),\n    [18 /* SymbolKind.Object */]: localize(775, \"object\"),\n    [24 /* SymbolKind.Operator */]: localize(776, \"operator\"),\n    [3 /* SymbolKind.Package */]: localize(777, \"package\"),\n    [6 /* SymbolKind.Property */]: localize(778, \"property\"),\n    [14 /* SymbolKind.String */]: localize(779, \"string\"),\n    [22 /* SymbolKind.Struct */]: localize(780, \"struct\"),\n    [25 /* SymbolKind.TypeParameter */]: localize(781, \"type parameter\"),\n    [12 /* SymbolKind.Variable */]: localize(782, \"variable\"),\n};\n/**\n * @internal\n */\nfunction getAriaLabelForSymbol(symbolName, kind) {\n    return localize(783, '{0} ({1})', symbolName, symbolKindNames[kind]);\n}\n/**\n * @internal\n */\nvar SymbolKinds;\n(function (SymbolKinds) {\n    const byKind = new Map();\n    byKind.set(0 /* SymbolKind.File */, Codicon.symbolFile);\n    byKind.set(1 /* SymbolKind.Module */, Codicon.symbolModule);\n    byKind.set(2 /* SymbolKind.Namespace */, Codicon.symbolNamespace);\n    byKind.set(3 /* SymbolKind.Package */, Codicon.symbolPackage);\n    byKind.set(4 /* SymbolKind.Class */, Codicon.symbolClass);\n    byKind.set(5 /* SymbolKind.Method */, Codicon.symbolMethod);\n    byKind.set(6 /* SymbolKind.Property */, Codicon.symbolProperty);\n    byKind.set(7 /* SymbolKind.Field */, Codicon.symbolField);\n    byKind.set(8 /* SymbolKind.Constructor */, Codicon.symbolConstructor);\n    byKind.set(9 /* SymbolKind.Enum */, Codicon.symbolEnum);\n    byKind.set(10 /* SymbolKind.Interface */, Codicon.symbolInterface);\n    byKind.set(11 /* SymbolKind.Function */, Codicon.symbolFunction);\n    byKind.set(12 /* SymbolKind.Variable */, Codicon.symbolVariable);\n    byKind.set(13 /* SymbolKind.Constant */, Codicon.symbolConstant);\n    byKind.set(14 /* SymbolKind.String */, Codicon.symbolString);\n    byKind.set(15 /* SymbolKind.Number */, Codicon.symbolNumber);\n    byKind.set(16 /* SymbolKind.Boolean */, Codicon.symbolBoolean);\n    byKind.set(17 /* SymbolKind.Array */, Codicon.symbolArray);\n    byKind.set(18 /* SymbolKind.Object */, Codicon.symbolObject);\n    byKind.set(19 /* SymbolKind.Key */, Codicon.symbolKey);\n    byKind.set(20 /* SymbolKind.Null */, Codicon.symbolNull);\n    byKind.set(21 /* SymbolKind.EnumMember */, Codicon.symbolEnumMember);\n    byKind.set(22 /* SymbolKind.Struct */, Codicon.symbolStruct);\n    byKind.set(23 /* SymbolKind.Event */, Codicon.symbolEvent);\n    byKind.set(24 /* SymbolKind.Operator */, Codicon.symbolOperator);\n    byKind.set(25 /* SymbolKind.TypeParameter */, Codicon.symbolTypeParameter);\n    /**\n     * @internal\n     */\n    function toIcon(kind) {\n        let icon = byKind.get(kind);\n        if (!icon) {\n            console.info('No codicon found for SymbolKind ' + kind);\n            icon = Codicon.symbolProperty;\n        }\n        return icon;\n    }\n    SymbolKinds.toIcon = toIcon;\n    const byCompletionKind = new Map();\n    byCompletionKind.set(0 /* SymbolKind.File */, 20 /* CompletionItemKind.File */);\n    byCompletionKind.set(1 /* SymbolKind.Module */, 8 /* CompletionItemKind.Module */);\n    byCompletionKind.set(2 /* SymbolKind.Namespace */, 8 /* CompletionItemKind.Module */);\n    byCompletionKind.set(3 /* SymbolKind.Package */, 8 /* CompletionItemKind.Module */);\n    byCompletionKind.set(4 /* SymbolKind.Class */, 5 /* CompletionItemKind.Class */);\n    byCompletionKind.set(5 /* SymbolKind.Method */, 0 /* CompletionItemKind.Method */);\n    byCompletionKind.set(6 /* SymbolKind.Property */, 9 /* CompletionItemKind.Property */);\n    byCompletionKind.set(7 /* SymbolKind.Field */, 3 /* CompletionItemKind.Field */);\n    byCompletionKind.set(8 /* SymbolKind.Constructor */, 2 /* CompletionItemKind.Constructor */);\n    byCompletionKind.set(9 /* SymbolKind.Enum */, 15 /* CompletionItemKind.Enum */);\n    byCompletionKind.set(10 /* SymbolKind.Interface */, 7 /* CompletionItemKind.Interface */);\n    byCompletionKind.set(11 /* SymbolKind.Function */, 1 /* CompletionItemKind.Function */);\n    byCompletionKind.set(12 /* SymbolKind.Variable */, 4 /* CompletionItemKind.Variable */);\n    byCompletionKind.set(13 /* SymbolKind.Constant */, 14 /* CompletionItemKind.Constant */);\n    byCompletionKind.set(14 /* SymbolKind.String */, 18 /* CompletionItemKind.Text */);\n    byCompletionKind.set(15 /* SymbolKind.Number */, 13 /* CompletionItemKind.Value */);\n    byCompletionKind.set(16 /* SymbolKind.Boolean */, 13 /* CompletionItemKind.Value */);\n    byCompletionKind.set(17 /* SymbolKind.Array */, 13 /* CompletionItemKind.Value */);\n    byCompletionKind.set(18 /* SymbolKind.Object */, 13 /* CompletionItemKind.Value */);\n    byCompletionKind.set(19 /* SymbolKind.Key */, 17 /* CompletionItemKind.Keyword */);\n    byCompletionKind.set(20 /* SymbolKind.Null */, 13 /* CompletionItemKind.Value */);\n    byCompletionKind.set(21 /* SymbolKind.EnumMember */, 16 /* CompletionItemKind.EnumMember */);\n    byCompletionKind.set(22 /* SymbolKind.Struct */, 6 /* CompletionItemKind.Struct */);\n    byCompletionKind.set(23 /* SymbolKind.Event */, 10 /* CompletionItemKind.Event */);\n    byCompletionKind.set(24 /* SymbolKind.Operator */, 11 /* CompletionItemKind.Operator */);\n    byCompletionKind.set(25 /* SymbolKind.TypeParameter */, 24 /* CompletionItemKind.TypeParameter */);\n    /**\n     * @internal\n     */\n    function toCompletionKind(kind) {\n        let completionKind = byCompletionKind.get(kind);\n        if (completionKind === undefined) {\n            console.info('No completion kind found for SymbolKind ' + kind);\n            completionKind = 20 /* CompletionItemKind.File */;\n        }\n        return completionKind;\n    }\n    SymbolKinds.toCompletionKind = toCompletionKind;\n})(SymbolKinds || (SymbolKinds = {}));\nclass FoldingRangeKind {\n    /**\n     * Kind for folding range representing a comment. The value of the kind is 'comment'.\n     */\n    static { this.Comment = new FoldingRangeKind('comment'); }\n    /**\n     * Kind for folding range representing a import. The value of the kind is 'imports'.\n     */\n    static { this.Imports = new FoldingRangeKind('imports'); }\n    /**\n     * Kind for folding range representing regions (for example marked by `#region`, `#endregion`).\n     * The value of the kind is 'region'.\n     */\n    static { this.Region = new FoldingRangeKind('region'); }\n    /**\n     * Returns a {@link FoldingRangeKind} for the given value.\n     *\n     * @param value of the kind.\n     */\n    static fromValue(value) {\n        switch (value) {\n            case 'comment': return FoldingRangeKind.Comment;\n            case 'imports': return FoldingRangeKind.Imports;\n            case 'region': return FoldingRangeKind.Region;\n        }\n        return new FoldingRangeKind(value);\n    }\n    /**\n     * Creates a new {@link FoldingRangeKind}.\n     *\n     * @param value of the kind.\n     */\n    constructor(value) {\n        this.value = value;\n    }\n}\nvar NewSymbolNameTag;\n(function (NewSymbolNameTag) {\n    NewSymbolNameTag[NewSymbolNameTag[\"AIGenerated\"] = 1] = \"AIGenerated\";\n})(NewSymbolNameTag || (NewSymbolNameTag = {}));\nvar NewSymbolNameTriggerKind;\n(function (NewSymbolNameTriggerKind) {\n    NewSymbolNameTriggerKind[NewSymbolNameTriggerKind[\"Invoke\"] = 0] = \"Invoke\";\n    NewSymbolNameTriggerKind[NewSymbolNameTriggerKind[\"Automatic\"] = 1] = \"Automatic\";\n})(NewSymbolNameTriggerKind || (NewSymbolNameTriggerKind = {}));\n/**\n * @internal\n */\nvar Command;\n(function (Command) {\n    /**\n     * @internal\n     */\n    function is(obj) {\n        if (!obj || typeof obj !== 'object') {\n            return false;\n        }\n        return typeof obj.id === 'string' &&\n            typeof obj.title === 'string';\n    }\n    Command.is = is;\n})(Command || (Command = {}));\nvar InlayHintKind;\n(function (InlayHintKind) {\n    InlayHintKind[InlayHintKind[\"Type\"] = 1] = \"Type\";\n    InlayHintKind[InlayHintKind[\"Parameter\"] = 2] = \"Parameter\";\n})(InlayHintKind || (InlayHintKind = {}));\n/**\n * @internal\n */\nclass LazyTokenizationSupport {\n    constructor(createSupport) {\n        this.createSupport = createSupport;\n        this._tokenizationSupport = null;\n    }\n    dispose() {\n        if (this._tokenizationSupport) {\n            this._tokenizationSupport.then((support) => {\n                if (support) {\n                    support.dispose();\n                }\n            });\n        }\n    }\n    get tokenizationSupport() {\n        if (!this._tokenizationSupport) {\n            this._tokenizationSupport = this.createSupport();\n        }\n        return this._tokenizationSupport;\n    }\n}\n/**\n * @internal\n */\nconst TokenizationRegistry = new TokenizationRegistry$1();\n\nexport { Command, CompletionItemKinds, DocumentHighlightKind, DocumentPasteTriggerKind, EncodedTokenizationResult, FoldingRangeKind, HoverVerbosityAction, InlayHintKind, InlineCompletionEndOfLifeReasonKind, InlineCompletionHintStyle, InlineCompletionTriggerKind, LazyTokenizationSupport, NewSymbolNameTag, NewSymbolNameTriggerKind, ProviderId, SelectedSuggestionInfo, SignatureHelpTriggerKind, SymbolKinds, Token, TokenizationRegistry, TokenizationResult, getAriaLabelForSymbol, isLocationLink, symbolKindNames };\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// THIS IS A GENERATED FILE. DO NOT EDIT DIRECTLY.\nvar AccessibilitySupport;\n(function (AccessibilitySupport) {\n    /**\n     * This should be the browser case where it is not known if a screen reader is attached or no.\n     */\n    AccessibilitySupport[AccessibilitySupport[\"Unknown\"] = 0] = \"Unknown\";\n    AccessibilitySupport[AccessibilitySupport[\"Disabled\"] = 1] = \"Disabled\";\n    AccessibilitySupport[AccessibilitySupport[\"Enabled\"] = 2] = \"Enabled\";\n})(AccessibilitySupport || (AccessibilitySupport = {}));\nvar CodeActionTriggerType;\n(function (CodeActionTriggerType) {\n    CodeActionTriggerType[CodeActionTriggerType[\"Invoke\"] = 1] = \"Invoke\";\n    CodeActionTriggerType[CodeActionTriggerType[\"Auto\"] = 2] = \"Auto\";\n})(CodeActionTriggerType || (CodeActionTriggerType = {}));\nvar CompletionItemInsertTextRule;\n(function (CompletionItemInsertTextRule) {\n    CompletionItemInsertTextRule[CompletionItemInsertTextRule[\"None\"] = 0] = \"None\";\n    /**\n     * Adjust whitespace/indentation of multiline insert texts to\n     * match the current line indentation.\n     */\n    CompletionItemInsertTextRule[CompletionItemInsertTextRule[\"KeepWhitespace\"] = 1] = \"KeepWhitespace\";\n    /**\n     * `insertText` is a snippet.\n     */\n    CompletionItemInsertTextRule[CompletionItemInsertTextRule[\"InsertAsSnippet\"] = 4] = \"InsertAsSnippet\";\n})(CompletionItemInsertTextRule || (CompletionItemInsertTextRule = {}));\nvar CompletionItemKind;\n(function (CompletionItemKind) {\n    CompletionItemKind[CompletionItemKind[\"Method\"] = 0] = \"Method\";\n    CompletionItemKind[CompletionItemKind[\"Function\"] = 1] = \"Function\";\n    CompletionItemKind[CompletionItemKind[\"Constructor\"] = 2] = \"Constructor\";\n    CompletionItemKind[CompletionItemKind[\"Field\"] = 3] = \"Field\";\n    CompletionItemKind[CompletionItemKind[\"Variable\"] = 4] = \"Variable\";\n    CompletionItemKind[CompletionItemKind[\"Class\"] = 5] = \"Class\";\n    CompletionItemKind[CompletionItemKind[\"Struct\"] = 6] = \"Struct\";\n    CompletionItemKind[CompletionItemKind[\"Interface\"] = 7] = \"Interface\";\n    CompletionItemKind[CompletionItemKind[\"Module\"] = 8] = \"Module\";\n    CompletionItemKind[CompletionItemKind[\"Property\"] = 9] = \"Property\";\n    CompletionItemKind[CompletionItemKind[\"Event\"] = 10] = \"Event\";\n    CompletionItemKind[CompletionItemKind[\"Operator\"] = 11] = \"Operator\";\n    CompletionItemKind[CompletionItemKind[\"Unit\"] = 12] = \"Unit\";\n    CompletionItemKind[CompletionItemKind[\"Value\"] = 13] = \"Value\";\n    CompletionItemKind[CompletionItemKind[\"Constant\"] = 14] = \"Constant\";\n    CompletionItemKind[CompletionItemKind[\"Enum\"] = 15] = \"Enum\";\n    CompletionItemKind[CompletionItemKind[\"EnumMember\"] = 16] = \"EnumMember\";\n    CompletionItemKind[CompletionItemKind[\"Keyword\"] = 17] = \"Keyword\";\n    CompletionItemKind[CompletionItemKind[\"Text\"] = 18] = \"Text\";\n    CompletionItemKind[CompletionItemKind[\"Color\"] = 19] = \"Color\";\n    CompletionItemKind[CompletionItemKind[\"File\"] = 20] = \"File\";\n    CompletionItemKind[CompletionItemKind[\"Reference\"] = 21] = \"Reference\";\n    CompletionItemKind[CompletionItemKind[\"Customcolor\"] = 22] = \"Customcolor\";\n    CompletionItemKind[CompletionItemKind[\"Folder\"] = 23] = \"Folder\";\n    CompletionItemKind[CompletionItemKind[\"TypeParameter\"] = 24] = \"TypeParameter\";\n    CompletionItemKind[CompletionItemKind[\"User\"] = 25] = \"User\";\n    CompletionItemKind[CompletionItemKind[\"Issue\"] = 26] = \"Issue\";\n    CompletionItemKind[CompletionItemKind[\"Tool\"] = 27] = \"Tool\";\n    CompletionItemKind[CompletionItemKind[\"Snippet\"] = 28] = \"Snippet\";\n})(CompletionItemKind || (CompletionItemKind = {}));\nvar CompletionItemTag;\n(function (CompletionItemTag) {\n    CompletionItemTag[CompletionItemTag[\"Deprecated\"] = 1] = \"Deprecated\";\n})(CompletionItemTag || (CompletionItemTag = {}));\n/**\n * How a suggest provider was triggered.\n */\nvar CompletionTriggerKind;\n(function (CompletionTriggerKind) {\n    CompletionTriggerKind[CompletionTriggerKind[\"Invoke\"] = 0] = \"Invoke\";\n    CompletionTriggerKind[CompletionTriggerKind[\"TriggerCharacter\"] = 1] = \"TriggerCharacter\";\n    CompletionTriggerKind[CompletionTriggerKind[\"TriggerForIncompleteCompletions\"] = 2] = \"TriggerForIncompleteCompletions\";\n})(CompletionTriggerKind || (CompletionTriggerKind = {}));\n/**\n * A positioning preference for rendering content widgets.\n */\nvar ContentWidgetPositionPreference;\n(function (ContentWidgetPositionPreference) {\n    /**\n     * Place the content widget exactly at a position\n     */\n    ContentWidgetPositionPreference[ContentWidgetPositionPreference[\"EXACT\"] = 0] = \"EXACT\";\n    /**\n     * Place the content widget above a position\n     */\n    ContentWidgetPositionPreference[ContentWidgetPositionPreference[\"ABOVE\"] = 1] = \"ABOVE\";\n    /**\n     * Place the content widget below a position\n     */\n    ContentWidgetPositionPreference[ContentWidgetPositionPreference[\"BELOW\"] = 2] = \"BELOW\";\n})(ContentWidgetPositionPreference || (ContentWidgetPositionPreference = {}));\n/**\n * Describes the reason the cursor has changed its position.\n */\nvar CursorChangeReason;\n(function (CursorChangeReason) {\n    /**\n     * Unknown or not set.\n     */\n    CursorChangeReason[CursorChangeReason[\"NotSet\"] = 0] = \"NotSet\";\n    /**\n     * A `model.setValue()` was called.\n     */\n    CursorChangeReason[CursorChangeReason[\"ContentFlush\"] = 1] = \"ContentFlush\";\n    /**\n     * The `model` has been changed outside of this cursor and the cursor recovers its position from associated markers.\n     */\n    CursorChangeReason[CursorChangeReason[\"RecoverFromMarkers\"] = 2] = \"RecoverFromMarkers\";\n    /**\n     * There was an explicit user gesture.\n     */\n    CursorChangeReason[CursorChangeReason[\"Explicit\"] = 3] = \"Explicit\";\n    /**\n     * There was a Paste.\n     */\n    CursorChangeReason[CursorChangeReason[\"Paste\"] = 4] = \"Paste\";\n    /**\n     * There was an Undo.\n     */\n    CursorChangeReason[CursorChangeReason[\"Undo\"] = 5] = \"Undo\";\n    /**\n     * There was a Redo.\n     */\n    CursorChangeReason[CursorChangeReason[\"Redo\"] = 6] = \"Redo\";\n})(CursorChangeReason || (CursorChangeReason = {}));\n/**\n * The default end of line to use when instantiating models.\n */\nvar DefaultEndOfLine;\n(function (DefaultEndOfLine) {\n    /**\n     * Use line feed (\\n) as the end of line character.\n     */\n    DefaultEndOfLine[DefaultEndOfLine[\"LF\"] = 1] = \"LF\";\n    /**\n     * Use carriage return and line feed (\\r\\n) as the end of line character.\n     */\n    DefaultEndOfLine[DefaultEndOfLine[\"CRLF\"] = 2] = \"CRLF\";\n})(DefaultEndOfLine || (DefaultEndOfLine = {}));\n/**\n * A document highlight kind.\n */\nvar DocumentHighlightKind;\n(function (DocumentHighlightKind) {\n    /**\n     * A textual occurrence.\n     */\n    DocumentHighlightKind[DocumentHighlightKind[\"Text\"] = 0] = \"Text\";\n    /**\n     * Read-access of a symbol, like reading a variable.\n     */\n    DocumentHighlightKind[DocumentHighlightKind[\"Read\"] = 1] = \"Read\";\n    /**\n     * Write-access of a symbol, like writing to a variable.\n     */\n    DocumentHighlightKind[DocumentHighlightKind[\"Write\"] = 2] = \"Write\";\n})(DocumentHighlightKind || (DocumentHighlightKind = {}));\n/**\n * Configuration options for auto indentation in the editor\n */\nvar EditorAutoIndentStrategy;\n(function (EditorAutoIndentStrategy) {\n    EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"None\"] = 0] = \"None\";\n    EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"Keep\"] = 1] = \"Keep\";\n    EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"Brackets\"] = 2] = \"Brackets\";\n    EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"Advanced\"] = 3] = \"Advanced\";\n    EditorAutoIndentStrategy[EditorAutoIndentStrategy[\"Full\"] = 4] = \"Full\";\n})(EditorAutoIndentStrategy || (EditorAutoIndentStrategy = {}));\nvar EditorOption;\n(function (EditorOption) {\n    EditorOption[EditorOption[\"acceptSuggestionOnCommitCharacter\"] = 0] = \"acceptSuggestionOnCommitCharacter\";\n    EditorOption[EditorOption[\"acceptSuggestionOnEnter\"] = 1] = \"acceptSuggestionOnEnter\";\n    EditorOption[EditorOption[\"accessibilitySupport\"] = 2] = \"accessibilitySupport\";\n    EditorOption[EditorOption[\"accessibilityPageSize\"] = 3] = \"accessibilityPageSize\";\n    EditorOption[EditorOption[\"allowOverflow\"] = 4] = \"allowOverflow\";\n    EditorOption[EditorOption[\"allowVariableLineHeights\"] = 5] = \"allowVariableLineHeights\";\n    EditorOption[EditorOption[\"allowVariableFonts\"] = 6] = \"allowVariableFonts\";\n    EditorOption[EditorOption[\"allowVariableFontsInAccessibilityMode\"] = 7] = \"allowVariableFontsInAccessibilityMode\";\n    EditorOption[EditorOption[\"ariaLabel\"] = 8] = \"ariaLabel\";\n    EditorOption[EditorOption[\"ariaRequired\"] = 9] = \"ariaRequired\";\n    EditorOption[EditorOption[\"autoClosingBrackets\"] = 10] = \"autoClosingBrackets\";\n    EditorOption[EditorOption[\"autoClosingComments\"] = 11] = \"autoClosingComments\";\n    EditorOption[EditorOption[\"screenReaderAnnounceInlineSuggestion\"] = 12] = \"screenReaderAnnounceInlineSuggestion\";\n    EditorOption[EditorOption[\"autoClosingDelete\"] = 13] = \"autoClosingDelete\";\n    EditorOption[EditorOption[\"autoClosingOvertype\"] = 14] = \"autoClosingOvertype\";\n    EditorOption[EditorOption[\"autoClosingQuotes\"] = 15] = \"autoClosingQuotes\";\n    EditorOption[EditorOption[\"autoIndent\"] = 16] = \"autoIndent\";\n    EditorOption[EditorOption[\"autoIndentOnPaste\"] = 17] = \"autoIndentOnPaste\";\n    EditorOption[EditorOption[\"autoIndentOnPasteWithinString\"] = 18] = \"autoIndentOnPasteWithinString\";\n    EditorOption[EditorOption[\"automaticLayout\"] = 19] = \"automaticLayout\";\n    EditorOption[EditorOption[\"autoSurround\"] = 20] = \"autoSurround\";\n    EditorOption[EditorOption[\"bracketPairColorization\"] = 21] = \"bracketPairColorization\";\n    EditorOption[EditorOption[\"guides\"] = 22] = \"guides\";\n    EditorOption[EditorOption[\"codeLens\"] = 23] = \"codeLens\";\n    EditorOption[EditorOption[\"codeLensFontFamily\"] = 24] = \"codeLensFontFamily\";\n    EditorOption[EditorOption[\"codeLensFontSize\"] = 25] = \"codeLensFontSize\";\n    EditorOption[EditorOption[\"colorDecorators\"] = 26] = \"colorDecorators\";\n    EditorOption[EditorOption[\"colorDecoratorsLimit\"] = 27] = \"colorDecoratorsLimit\";\n    EditorOption[EditorOption[\"columnSelection\"] = 28] = \"columnSelection\";\n    EditorOption[EditorOption[\"comments\"] = 29] = \"comments\";\n    EditorOption[EditorOption[\"contextmenu\"] = 30] = \"contextmenu\";\n    EditorOption[EditorOption[\"copyWithSyntaxHighlighting\"] = 31] = \"copyWithSyntaxHighlighting\";\n    EditorOption[EditorOption[\"cursorBlinking\"] = 32] = \"cursorBlinking\";\n    EditorOption[EditorOption[\"cursorSmoothCaretAnimation\"] = 33] = \"cursorSmoothCaretAnimation\";\n    EditorOption[EditorOption[\"cursorStyle\"] = 34] = \"cursorStyle\";\n    EditorOption[EditorOption[\"cursorSurroundingLines\"] = 35] = \"cursorSurroundingLines\";\n    EditorOption[EditorOption[\"cursorSurroundingLinesStyle\"] = 36] = \"cursorSurroundingLinesStyle\";\n    EditorOption[EditorOption[\"cursorWidth\"] = 37] = \"cursorWidth\";\n    EditorOption[EditorOption[\"cursorHeight\"] = 38] = \"cursorHeight\";\n    EditorOption[EditorOption[\"disableLayerHinting\"] = 39] = \"disableLayerHinting\";\n    EditorOption[EditorOption[\"disableMonospaceOptimizations\"] = 40] = \"disableMonospaceOptimizations\";\n    EditorOption[EditorOption[\"domReadOnly\"] = 41] = \"domReadOnly\";\n    EditorOption[EditorOption[\"dragAndDrop\"] = 42] = \"dragAndDrop\";\n    EditorOption[EditorOption[\"dropIntoEditor\"] = 43] = \"dropIntoEditor\";\n    EditorOption[EditorOption[\"editContext\"] = 44] = \"editContext\";\n    EditorOption[EditorOption[\"emptySelectionClipboard\"] = 45] = \"emptySelectionClipboard\";\n    EditorOption[EditorOption[\"experimentalGpuAcceleration\"] = 46] = \"experimentalGpuAcceleration\";\n    EditorOption[EditorOption[\"experimentalWhitespaceRendering\"] = 47] = \"experimentalWhitespaceRendering\";\n    EditorOption[EditorOption[\"extraEditorClassName\"] = 48] = \"extraEditorClassName\";\n    EditorOption[EditorOption[\"fastScrollSensitivity\"] = 49] = \"fastScrollSensitivity\";\n    EditorOption[EditorOption[\"find\"] = 50] = \"find\";\n    EditorOption[EditorOption[\"fixedOverflowWidgets\"] = 51] = \"fixedOverflowWidgets\";\n    EditorOption[EditorOption[\"folding\"] = 52] = \"folding\";\n    EditorOption[EditorOption[\"foldingStrategy\"] = 53] = \"foldingStrategy\";\n    EditorOption[EditorOption[\"foldingHighlight\"] = 54] = \"foldingHighlight\";\n    EditorOption[EditorOption[\"foldingImportsByDefault\"] = 55] = \"foldingImportsByDefault\";\n    EditorOption[EditorOption[\"foldingMaximumRegions\"] = 56] = \"foldingMaximumRegions\";\n    EditorOption[EditorOption[\"unfoldOnClickAfterEndOfLine\"] = 57] = \"unfoldOnClickAfterEndOfLine\";\n    EditorOption[EditorOption[\"fontFamily\"] = 58] = \"fontFamily\";\n    EditorOption[EditorOption[\"fontInfo\"] = 59] = \"fontInfo\";\n    EditorOption[EditorOption[\"fontLigatures\"] = 60] = \"fontLigatures\";\n    EditorOption[EditorOption[\"fontSize\"] = 61] = \"fontSize\";\n    EditorOption[EditorOption[\"fontWeight\"] = 62] = \"fontWeight\";\n    EditorOption[EditorOption[\"fontVariations\"] = 63] = \"fontVariations\";\n    EditorOption[EditorOption[\"formatOnPaste\"] = 64] = \"formatOnPaste\";\n    EditorOption[EditorOption[\"formatOnType\"] = 65] = \"formatOnType\";\n    EditorOption[EditorOption[\"glyphMargin\"] = 66] = \"glyphMargin\";\n    EditorOption[EditorOption[\"gotoLocation\"] = 67] = \"gotoLocation\";\n    EditorOption[EditorOption[\"hideCursorInOverviewRuler\"] = 68] = \"hideCursorInOverviewRuler\";\n    EditorOption[EditorOption[\"hover\"] = 69] = \"hover\";\n    EditorOption[EditorOption[\"inDiffEditor\"] = 70] = \"inDiffEditor\";\n    EditorOption[EditorOption[\"inlineSuggest\"] = 71] = \"inlineSuggest\";\n    EditorOption[EditorOption[\"letterSpacing\"] = 72] = \"letterSpacing\";\n    EditorOption[EditorOption[\"lightbulb\"] = 73] = \"lightbulb\";\n    EditorOption[EditorOption[\"lineDecorationsWidth\"] = 74] = \"lineDecorationsWidth\";\n    EditorOption[EditorOption[\"lineHeight\"] = 75] = \"lineHeight\";\n    EditorOption[EditorOption[\"lineNumbers\"] = 76] = \"lineNumbers\";\n    EditorOption[EditorOption[\"lineNumbersMinChars\"] = 77] = \"lineNumbersMinChars\";\n    EditorOption[EditorOption[\"linkedEditing\"] = 78] = \"linkedEditing\";\n    EditorOption[EditorOption[\"links\"] = 79] = \"links\";\n    EditorOption[EditorOption[\"matchBrackets\"] = 80] = \"matchBrackets\";\n    EditorOption[EditorOption[\"minimap\"] = 81] = \"minimap\";\n    EditorOption[EditorOption[\"mouseStyle\"] = 82] = \"mouseStyle\";\n    EditorOption[EditorOption[\"mouseWheelScrollSensitivity\"] = 83] = \"mouseWheelScrollSensitivity\";\n    EditorOption[EditorOption[\"mouseWheelZoom\"] = 84] = \"mouseWheelZoom\";\n    EditorOption[EditorOption[\"multiCursorMergeOverlapping\"] = 85] = \"multiCursorMergeOverlapping\";\n    EditorOption[EditorOption[\"multiCursorModifier\"] = 86] = \"multiCursorModifier\";\n    EditorOption[EditorOption[\"mouseMiddleClickAction\"] = 87] = \"mouseMiddleClickAction\";\n    EditorOption[EditorOption[\"multiCursorPaste\"] = 88] = \"multiCursorPaste\";\n    EditorOption[EditorOption[\"multiCursorLimit\"] = 89] = \"multiCursorLimit\";\n    EditorOption[EditorOption[\"occurrencesHighlight\"] = 90] = \"occurrencesHighlight\";\n    EditorOption[EditorOption[\"occurrencesHighlightDelay\"] = 91] = \"occurrencesHighlightDelay\";\n    EditorOption[EditorOption[\"overtypeCursorStyle\"] = 92] = \"overtypeCursorStyle\";\n    EditorOption[EditorOption[\"overtypeOnPaste\"] = 93] = \"overtypeOnPaste\";\n    EditorOption[EditorOption[\"overviewRulerBorder\"] = 94] = \"overviewRulerBorder\";\n    EditorOption[EditorOption[\"overviewRulerLanes\"] = 95] = \"overviewRulerLanes\";\n    EditorOption[EditorOption[\"padding\"] = 96] = \"padding\";\n    EditorOption[EditorOption[\"pasteAs\"] = 97] = \"pasteAs\";\n    EditorOption[EditorOption[\"parameterHints\"] = 98] = \"parameterHints\";\n    EditorOption[EditorOption[\"peekWidgetDefaultFocus\"] = 99] = \"peekWidgetDefaultFocus\";\n    EditorOption[EditorOption[\"placeholder\"] = 100] = \"placeholder\";\n    EditorOption[EditorOption[\"definitionLinkOpensInPeek\"] = 101] = \"definitionLinkOpensInPeek\";\n    EditorOption[EditorOption[\"quickSuggestions\"] = 102] = \"quickSuggestions\";\n    EditorOption[EditorOption[\"quickSuggestionsDelay\"] = 103] = \"quickSuggestionsDelay\";\n    EditorOption[EditorOption[\"readOnly\"] = 104] = \"readOnly\";\n    EditorOption[EditorOption[\"readOnlyMessage\"] = 105] = \"readOnlyMessage\";\n    EditorOption[EditorOption[\"renameOnType\"] = 106] = \"renameOnType\";\n    EditorOption[EditorOption[\"renderRichScreenReaderContent\"] = 107] = \"renderRichScreenReaderContent\";\n    EditorOption[EditorOption[\"renderControlCharacters\"] = 108] = \"renderControlCharacters\";\n    EditorOption[EditorOption[\"renderFinalNewline\"] = 109] = \"renderFinalNewline\";\n    EditorOption[EditorOption[\"renderLineHighlight\"] = 110] = \"renderLineHighlight\";\n    EditorOption[EditorOption[\"renderLineHighlightOnlyWhenFocus\"] = 111] = \"renderLineHighlightOnlyWhenFocus\";\n    EditorOption[EditorOption[\"renderValidationDecorations\"] = 112] = \"renderValidationDecorations\";\n    EditorOption[EditorOption[\"renderWhitespace\"] = 113] = \"renderWhitespace\";\n    EditorOption[EditorOption[\"revealHorizontalRightPadding\"] = 114] = \"revealHorizontalRightPadding\";\n    EditorOption[EditorOption[\"roundedSelection\"] = 115] = \"roundedSelection\";\n    EditorOption[EditorOption[\"rulers\"] = 116] = \"rulers\";\n    EditorOption[EditorOption[\"scrollbar\"] = 117] = \"scrollbar\";\n    EditorOption[EditorOption[\"scrollBeyondLastColumn\"] = 118] = \"scrollBeyondLastColumn\";\n    EditorOption[EditorOption[\"scrollBeyondLastLine\"] = 119] = \"scrollBeyondLastLine\";\n    EditorOption[EditorOption[\"scrollPredominantAxis\"] = 120] = \"scrollPredominantAxis\";\n    EditorOption[EditorOption[\"selectionClipboard\"] = 121] = \"selectionClipboard\";\n    EditorOption[EditorOption[\"selectionHighlight\"] = 122] = \"selectionHighlight\";\n    EditorOption[EditorOption[\"selectionHighlightMaxLength\"] = 123] = \"selectionHighlightMaxLength\";\n    EditorOption[EditorOption[\"selectionHighlightMultiline\"] = 124] = \"selectionHighlightMultiline\";\n    EditorOption[EditorOption[\"selectOnLineNumbers\"] = 125] = \"selectOnLineNumbers\";\n    EditorOption[EditorOption[\"showFoldingControls\"] = 126] = \"showFoldingControls\";\n    EditorOption[EditorOption[\"showUnused\"] = 127] = \"showUnused\";\n    EditorOption[EditorOption[\"snippetSuggestions\"] = 128] = \"snippetSuggestions\";\n    EditorOption[EditorOption[\"smartSelect\"] = 129] = \"smartSelect\";\n    EditorOption[EditorOption[\"smoothScrolling\"] = 130] = \"smoothScrolling\";\n    EditorOption[EditorOption[\"stickyScroll\"] = 131] = \"stickyScroll\";\n    EditorOption[EditorOption[\"stickyTabStops\"] = 132] = \"stickyTabStops\";\n    EditorOption[EditorOption[\"stopRenderingLineAfter\"] = 133] = \"stopRenderingLineAfter\";\n    EditorOption[EditorOption[\"suggest\"] = 134] = \"suggest\";\n    EditorOption[EditorOption[\"suggestFontSize\"] = 135] = \"suggestFontSize\";\n    EditorOption[EditorOption[\"suggestLineHeight\"] = 136] = \"suggestLineHeight\";\n    EditorOption[EditorOption[\"suggestOnTriggerCharacters\"] = 137] = \"suggestOnTriggerCharacters\";\n    EditorOption[EditorOption[\"suggestSelection\"] = 138] = \"suggestSelection\";\n    EditorOption[EditorOption[\"tabCompletion\"] = 139] = \"tabCompletion\";\n    EditorOption[EditorOption[\"tabIndex\"] = 140] = \"tabIndex\";\n    EditorOption[EditorOption[\"trimWhitespaceOnDelete\"] = 141] = \"trimWhitespaceOnDelete\";\n    EditorOption[EditorOption[\"unicodeHighlighting\"] = 142] = \"unicodeHighlighting\";\n    EditorOption[EditorOption[\"unusualLineTerminators\"] = 143] = \"unusualLineTerminators\";\n    EditorOption[EditorOption[\"useShadowDOM\"] = 144] = \"useShadowDOM\";\n    EditorOption[EditorOption[\"useTabStops\"] = 145] = \"useTabStops\";\n    EditorOption[EditorOption[\"wordBreak\"] = 146] = \"wordBreak\";\n    EditorOption[EditorOption[\"wordSegmenterLocales\"] = 147] = \"wordSegmenterLocales\";\n    EditorOption[EditorOption[\"wordSeparators\"] = 148] = \"wordSeparators\";\n    EditorOption[EditorOption[\"wordWrap\"] = 149] = \"wordWrap\";\n    EditorOption[EditorOption[\"wordWrapBreakAfterCharacters\"] = 150] = \"wordWrapBreakAfterCharacters\";\n    EditorOption[EditorOption[\"wordWrapBreakBeforeCharacters\"] = 151] = \"wordWrapBreakBeforeCharacters\";\n    EditorOption[EditorOption[\"wordWrapColumn\"] = 152] = \"wordWrapColumn\";\n    EditorOption[EditorOption[\"wordWrapOverride1\"] = 153] = \"wordWrapOverride1\";\n    EditorOption[EditorOption[\"wordWrapOverride2\"] = 154] = \"wordWrapOverride2\";\n    EditorOption[EditorOption[\"wrappingIndent\"] = 155] = \"wrappingIndent\";\n    EditorOption[EditorOption[\"wrappingStrategy\"] = 156] = \"wrappingStrategy\";\n    EditorOption[EditorOption[\"showDeprecated\"] = 157] = \"showDeprecated\";\n    EditorOption[EditorOption[\"inertialScroll\"] = 158] = \"inertialScroll\";\n    EditorOption[EditorOption[\"inlayHints\"] = 159] = \"inlayHints\";\n    EditorOption[EditorOption[\"wrapOnEscapedLineFeeds\"] = 160] = \"wrapOnEscapedLineFeeds\";\n    EditorOption[EditorOption[\"effectiveCursorStyle\"] = 161] = \"effectiveCursorStyle\";\n    EditorOption[EditorOption[\"editorClassName\"] = 162] = \"editorClassName\";\n    EditorOption[EditorOption[\"pixelRatio\"] = 163] = \"pixelRatio\";\n    EditorOption[EditorOption[\"tabFocusMode\"] = 164] = \"tabFocusMode\";\n    EditorOption[EditorOption[\"layoutInfo\"] = 165] = \"layoutInfo\";\n    EditorOption[EditorOption[\"wrappingInfo\"] = 166] = \"wrappingInfo\";\n    EditorOption[EditorOption[\"defaultColorDecorators\"] = 167] = \"defaultColorDecorators\";\n    EditorOption[EditorOption[\"colorDecoratorsActivatedOn\"] = 168] = \"colorDecoratorsActivatedOn\";\n    EditorOption[EditorOption[\"inlineCompletionsAccessibilityVerbose\"] = 169] = \"inlineCompletionsAccessibilityVerbose\";\n    EditorOption[EditorOption[\"effectiveEditContext\"] = 170] = \"effectiveEditContext\";\n    EditorOption[EditorOption[\"scrollOnMiddleClick\"] = 171] = \"scrollOnMiddleClick\";\n    EditorOption[EditorOption[\"effectiveAllowVariableFonts\"] = 172] = \"effectiveAllowVariableFonts\";\n})(EditorOption || (EditorOption = {}));\n/**\n * End of line character preference.\n */\nvar EndOfLinePreference;\n(function (EndOfLinePreference) {\n    /**\n     * Use the end of line character identified in the text buffer.\n     */\n    EndOfLinePreference[EndOfLinePreference[\"TextDefined\"] = 0] = \"TextDefined\";\n    /**\n     * Use line feed (\\n) as the end of line character.\n     */\n    EndOfLinePreference[EndOfLinePreference[\"LF\"] = 1] = \"LF\";\n    /**\n     * Use carriage return and line feed (\\r\\n) as the end of line character.\n     */\n    EndOfLinePreference[EndOfLinePreference[\"CRLF\"] = 2] = \"CRLF\";\n})(EndOfLinePreference || (EndOfLinePreference = {}));\n/**\n * End of line character preference.\n */\nvar EndOfLineSequence;\n(function (EndOfLineSequence) {\n    /**\n     * Use line feed (\\n) as the end of line character.\n     */\n    EndOfLineSequence[EndOfLineSequence[\"LF\"] = 0] = \"LF\";\n    /**\n     * Use carriage return and line feed (\\r\\n) as the end of line character.\n     */\n    EndOfLineSequence[EndOfLineSequence[\"CRLF\"] = 1] = \"CRLF\";\n})(EndOfLineSequence || (EndOfLineSequence = {}));\n/**\n * Vertical Lane in the glyph margin of the editor.\n */\nvar GlyphMarginLane;\n(function (GlyphMarginLane) {\n    GlyphMarginLane[GlyphMarginLane[\"Left\"] = 1] = \"Left\";\n    GlyphMarginLane[GlyphMarginLane[\"Center\"] = 2] = \"Center\";\n    GlyphMarginLane[GlyphMarginLane[\"Right\"] = 3] = \"Right\";\n})(GlyphMarginLane || (GlyphMarginLane = {}));\nvar HoverVerbosityAction;\n(function (HoverVerbosityAction) {\n    /**\n     * Increase the verbosity of the hover\n     */\n    HoverVerbosityAction[HoverVerbosityAction[\"Increase\"] = 0] = \"Increase\";\n    /**\n     * Decrease the verbosity of the hover\n     */\n    HoverVerbosityAction[HoverVerbosityAction[\"Decrease\"] = 1] = \"Decrease\";\n})(HoverVerbosityAction || (HoverVerbosityAction = {}));\n/**\n * Describes what to do with the indentation when pressing Enter.\n */\nvar IndentAction;\n(function (IndentAction) {\n    /**\n     * Insert new line and copy the previous line's indentation.\n     */\n    IndentAction[IndentAction[\"None\"] = 0] = \"None\";\n    /**\n     * Insert new line and indent once (relative to the previous line's indentation).\n     */\n    IndentAction[IndentAction[\"Indent\"] = 1] = \"Indent\";\n    /**\n     * Insert two new lines:\n     *  - the first one indented which will hold the cursor\n     *  - the second one at the same indentation level\n     */\n    IndentAction[IndentAction[\"IndentOutdent\"] = 2] = \"IndentOutdent\";\n    /**\n     * Insert new line and outdent once (relative to the previous line's indentation).\n     */\n    IndentAction[IndentAction[\"Outdent\"] = 3] = \"Outdent\";\n})(IndentAction || (IndentAction = {}));\nvar InjectedTextCursorStops;\n(function (InjectedTextCursorStops) {\n    InjectedTextCursorStops[InjectedTextCursorStops[\"Both\"] = 0] = \"Both\";\n    InjectedTextCursorStops[InjectedTextCursorStops[\"Right\"] = 1] = \"Right\";\n    InjectedTextCursorStops[InjectedTextCursorStops[\"Left\"] = 2] = \"Left\";\n    InjectedTextCursorStops[InjectedTextCursorStops[\"None\"] = 3] = \"None\";\n})(InjectedTextCursorStops || (InjectedTextCursorStops = {}));\nvar InlayHintKind;\n(function (InlayHintKind) {\n    InlayHintKind[InlayHintKind[\"Type\"] = 1] = \"Type\";\n    InlayHintKind[InlayHintKind[\"Parameter\"] = 2] = \"Parameter\";\n})(InlayHintKind || (InlayHintKind = {}));\nvar InlineCompletionEndOfLifeReasonKind;\n(function (InlineCompletionEndOfLifeReasonKind) {\n    InlineCompletionEndOfLifeReasonKind[InlineCompletionEndOfLifeReasonKind[\"Accepted\"] = 0] = \"Accepted\";\n    InlineCompletionEndOfLifeReasonKind[InlineCompletionEndOfLifeReasonKind[\"Rejected\"] = 1] = \"Rejected\";\n    InlineCompletionEndOfLifeReasonKind[InlineCompletionEndOfLifeReasonKind[\"Ignored\"] = 2] = \"Ignored\";\n})(InlineCompletionEndOfLifeReasonKind || (InlineCompletionEndOfLifeReasonKind = {}));\nvar InlineCompletionHintStyle;\n(function (InlineCompletionHintStyle) {\n    InlineCompletionHintStyle[InlineCompletionHintStyle[\"Code\"] = 1] = \"Code\";\n    InlineCompletionHintStyle[InlineCompletionHintStyle[\"Label\"] = 2] = \"Label\";\n})(InlineCompletionHintStyle || (InlineCompletionHintStyle = {}));\n/**\n * How an {@link InlineCompletionsProvider inline completion provider} was triggered.\n */\nvar InlineCompletionTriggerKind;\n(function (InlineCompletionTriggerKind) {\n    /**\n     * Completion was triggered automatically while editing.\n     * It is sufficient to return a single completion item in this case.\n     */\n    InlineCompletionTriggerKind[InlineCompletionTriggerKind[\"Automatic\"] = 0] = \"Automatic\";\n    /**\n     * Completion was triggered explicitly by a user gesture.\n     * Return multiple completion items to enable cycling through them.\n     */\n    InlineCompletionTriggerKind[InlineCompletionTriggerKind[\"Explicit\"] = 1] = \"Explicit\";\n})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));\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 */\nvar KeyCode;\n(function (KeyCode) {\n    KeyCode[KeyCode[\"DependsOnKbLayout\"] = -1] = \"DependsOnKbLayout\";\n    /**\n     * Placed first to cover the 0 value of the enum.\n     */\n    KeyCode[KeyCode[\"Unknown\"] = 0] = \"Unknown\";\n    KeyCode[KeyCode[\"Backspace\"] = 1] = \"Backspace\";\n    KeyCode[KeyCode[\"Tab\"] = 2] = \"Tab\";\n    KeyCode[KeyCode[\"Enter\"] = 3] = \"Enter\";\n    KeyCode[KeyCode[\"Shift\"] = 4] = \"Shift\";\n    KeyCode[KeyCode[\"Ctrl\"] = 5] = \"Ctrl\";\n    KeyCode[KeyCode[\"Alt\"] = 6] = \"Alt\";\n    KeyCode[KeyCode[\"PauseBreak\"] = 7] = \"PauseBreak\";\n    KeyCode[KeyCode[\"CapsLock\"] = 8] = \"CapsLock\";\n    KeyCode[KeyCode[\"Escape\"] = 9] = \"Escape\";\n    KeyCode[KeyCode[\"Space\"] = 10] = \"Space\";\n    KeyCode[KeyCode[\"PageUp\"] = 11] = \"PageUp\";\n    KeyCode[KeyCode[\"PageDown\"] = 12] = \"PageDown\";\n    KeyCode[KeyCode[\"End\"] = 13] = \"End\";\n    KeyCode[KeyCode[\"Home\"] = 14] = \"Home\";\n    KeyCode[KeyCode[\"LeftArrow\"] = 15] = \"LeftArrow\";\n    KeyCode[KeyCode[\"UpArrow\"] = 16] = \"UpArrow\";\n    KeyCode[KeyCode[\"RightArrow\"] = 17] = \"RightArrow\";\n    KeyCode[KeyCode[\"DownArrow\"] = 18] = \"DownArrow\";\n    KeyCode[KeyCode[\"Insert\"] = 19] = \"Insert\";\n    KeyCode[KeyCode[\"Delete\"] = 20] = \"Delete\";\n    KeyCode[KeyCode[\"Digit0\"] = 21] = \"Digit0\";\n    KeyCode[KeyCode[\"Digit1\"] = 22] = \"Digit1\";\n    KeyCode[KeyCode[\"Digit2\"] = 23] = \"Digit2\";\n    KeyCode[KeyCode[\"Digit3\"] = 24] = \"Digit3\";\n    KeyCode[KeyCode[\"Digit4\"] = 25] = \"Digit4\";\n    KeyCode[KeyCode[\"Digit5\"] = 26] = \"Digit5\";\n    KeyCode[KeyCode[\"Digit6\"] = 27] = \"Digit6\";\n    KeyCode[KeyCode[\"Digit7\"] = 28] = \"Digit7\";\n    KeyCode[KeyCode[\"Digit8\"] = 29] = \"Digit8\";\n    KeyCode[KeyCode[\"Digit9\"] = 30] = \"Digit9\";\n    KeyCode[KeyCode[\"KeyA\"] = 31] = \"KeyA\";\n    KeyCode[KeyCode[\"KeyB\"] = 32] = \"KeyB\";\n    KeyCode[KeyCode[\"KeyC\"] = 33] = \"KeyC\";\n    KeyCode[KeyCode[\"KeyD\"] = 34] = \"KeyD\";\n    KeyCode[KeyCode[\"KeyE\"] = 35] = \"KeyE\";\n    KeyCode[KeyCode[\"KeyF\"] = 36] = \"KeyF\";\n    KeyCode[KeyCode[\"KeyG\"] = 37] = \"KeyG\";\n    KeyCode[KeyCode[\"KeyH\"] = 38] = \"KeyH\";\n    KeyCode[KeyCode[\"KeyI\"] = 39] = \"KeyI\";\n    KeyCode[KeyCode[\"KeyJ\"] = 40] = \"KeyJ\";\n    KeyCode[KeyCode[\"KeyK\"] = 41] = \"KeyK\";\n    KeyCode[KeyCode[\"KeyL\"] = 42] = \"KeyL\";\n    KeyCode[KeyCode[\"KeyM\"] = 43] = \"KeyM\";\n    KeyCode[KeyCode[\"KeyN\"] = 44] = \"KeyN\";\n    KeyCode[KeyCode[\"KeyO\"] = 45] = \"KeyO\";\n    KeyCode[KeyCode[\"KeyP\"] = 46] = \"KeyP\";\n    KeyCode[KeyCode[\"KeyQ\"] = 47] = \"KeyQ\";\n    KeyCode[KeyCode[\"KeyR\"] = 48] = \"KeyR\";\n    KeyCode[KeyCode[\"KeyS\"] = 49] = \"KeyS\";\n    KeyCode[KeyCode[\"KeyT\"] = 50] = \"KeyT\";\n    KeyCode[KeyCode[\"KeyU\"] = 51] = \"KeyU\";\n    KeyCode[KeyCode[\"KeyV\"] = 52] = \"KeyV\";\n    KeyCode[KeyCode[\"KeyW\"] = 53] = \"KeyW\";\n    KeyCode[KeyCode[\"KeyX\"] = 54] = \"KeyX\";\n    KeyCode[KeyCode[\"KeyY\"] = 55] = \"KeyY\";\n    KeyCode[KeyCode[\"KeyZ\"] = 56] = \"KeyZ\";\n    KeyCode[KeyCode[\"Meta\"] = 57] = \"Meta\";\n    KeyCode[KeyCode[\"ContextMenu\"] = 58] = \"ContextMenu\";\n    KeyCode[KeyCode[\"F1\"] = 59] = \"F1\";\n    KeyCode[KeyCode[\"F2\"] = 60] = \"F2\";\n    KeyCode[KeyCode[\"F3\"] = 61] = \"F3\";\n    KeyCode[KeyCode[\"F4\"] = 62] = \"F4\";\n    KeyCode[KeyCode[\"F5\"] = 63] = \"F5\";\n    KeyCode[KeyCode[\"F6\"] = 64] = \"F6\";\n    KeyCode[KeyCode[\"F7\"] = 65] = \"F7\";\n    KeyCode[KeyCode[\"F8\"] = 66] = \"F8\";\n    KeyCode[KeyCode[\"F9\"] = 67] = \"F9\";\n    KeyCode[KeyCode[\"F10\"] = 68] = \"F10\";\n    KeyCode[KeyCode[\"F11\"] = 69] = \"F11\";\n    KeyCode[KeyCode[\"F12\"] = 70] = \"F12\";\n    KeyCode[KeyCode[\"F13\"] = 71] = \"F13\";\n    KeyCode[KeyCode[\"F14\"] = 72] = \"F14\";\n    KeyCode[KeyCode[\"F15\"] = 73] = \"F15\";\n    KeyCode[KeyCode[\"F16\"] = 74] = \"F16\";\n    KeyCode[KeyCode[\"F17\"] = 75] = \"F17\";\n    KeyCode[KeyCode[\"F18\"] = 76] = \"F18\";\n    KeyCode[KeyCode[\"F19\"] = 77] = \"F19\";\n    KeyCode[KeyCode[\"F20\"] = 78] = \"F20\";\n    KeyCode[KeyCode[\"F21\"] = 79] = \"F21\";\n    KeyCode[KeyCode[\"F22\"] = 80] = \"F22\";\n    KeyCode[KeyCode[\"F23\"] = 81] = \"F23\";\n    KeyCode[KeyCode[\"F24\"] = 82] = \"F24\";\n    KeyCode[KeyCode[\"NumLock\"] = 83] = \"NumLock\";\n    KeyCode[KeyCode[\"ScrollLock\"] = 84] = \"ScrollLock\";\n    /**\n     * Used for miscellaneous characters; it can vary by keyboard.\n     * For the US standard keyboard, the ';:' key\n     */\n    KeyCode[KeyCode[\"Semicolon\"] = 85] = \"Semicolon\";\n    /**\n     * For any country/region, the '+' key\n     * For the US standard keyboard, the '=+' key\n     */\n    KeyCode[KeyCode[\"Equal\"] = 86] = \"Equal\";\n    /**\n     * For any country/region, the ',' key\n     * For the US standard keyboard, the ',<' key\n     */\n    KeyCode[KeyCode[\"Comma\"] = 87] = \"Comma\";\n    /**\n     * For any country/region, the '-' key\n     * For the US standard keyboard, the '-_' key\n     */\n    KeyCode[KeyCode[\"Minus\"] = 88] = \"Minus\";\n    /**\n     * For any country/region, the '.' key\n     * For the US standard keyboard, the '.>' key\n     */\n    KeyCode[KeyCode[\"Period\"] = 89] = \"Period\";\n    /**\n     * Used for miscellaneous characters; it can vary by keyboard.\n     * For the US standard keyboard, the '/?' key\n     */\n    KeyCode[KeyCode[\"Slash\"] = 90] = \"Slash\";\n    /**\n     * Used for miscellaneous characters; it can vary by keyboard.\n     * For the US standard keyboard, the '`~' key\n     */\n    KeyCode[KeyCode[\"Backquote\"] = 91] = \"Backquote\";\n    /**\n     * Used for miscellaneous characters; it can vary by keyboard.\n     * For the US standard keyboard, the '[{' key\n     */\n    KeyCode[KeyCode[\"BracketLeft\"] = 92] = \"BracketLeft\";\n    /**\n     * Used for miscellaneous characters; it can vary by keyboard.\n     * For the US standard keyboard, the '\\|' key\n     */\n    KeyCode[KeyCode[\"Backslash\"] = 93] = \"Backslash\";\n    /**\n     * Used for miscellaneous characters; it can vary by keyboard.\n     * For the US standard keyboard, the ']}' key\n     */\n    KeyCode[KeyCode[\"BracketRight\"] = 94] = \"BracketRight\";\n    /**\n     * Used for miscellaneous characters; it can vary by keyboard.\n     * For the US standard keyboard, the ''\"' key\n     */\n    KeyCode[KeyCode[\"Quote\"] = 95] = \"Quote\";\n    /**\n     * Used for miscellaneous characters; it can vary by keyboard.\n     */\n    KeyCode[KeyCode[\"OEM_8\"] = 96] = \"OEM_8\";\n    /**\n     * Either the angle bracket key or the backslash key on the RT 102-key keyboard.\n     */\n    KeyCode[KeyCode[\"IntlBackslash\"] = 97] = \"IntlBackslash\";\n    KeyCode[KeyCode[\"Numpad0\"] = 98] = \"Numpad0\";\n    KeyCode[KeyCode[\"Numpad1\"] = 99] = \"Numpad1\";\n    KeyCode[KeyCode[\"Numpad2\"] = 100] = \"Numpad2\";\n    KeyCode[KeyCode[\"Numpad3\"] = 101] = \"Numpad3\";\n    KeyCode[KeyCode[\"Numpad4\"] = 102] = \"Numpad4\";\n    KeyCode[KeyCode[\"Numpad5\"] = 103] = \"Numpad5\";\n    KeyCode[KeyCode[\"Numpad6\"] = 104] = \"Numpad6\";\n    KeyCode[KeyCode[\"Numpad7\"] = 105] = \"Numpad7\";\n    KeyCode[KeyCode[\"Numpad8\"] = 106] = \"Numpad8\";\n    KeyCode[KeyCode[\"Numpad9\"] = 107] = \"Numpad9\";\n    KeyCode[KeyCode[\"NumpadMultiply\"] = 108] = \"NumpadMultiply\";\n    KeyCode[KeyCode[\"NumpadAdd\"] = 109] = \"NumpadAdd\";\n    KeyCode[KeyCode[\"NUMPAD_SEPARATOR\"] = 110] = \"NUMPAD_SEPARATOR\";\n    KeyCode[KeyCode[\"NumpadSubtract\"] = 111] = \"NumpadSubtract\";\n    KeyCode[KeyCode[\"NumpadDecimal\"] = 112] = \"NumpadDecimal\";\n    KeyCode[KeyCode[\"NumpadDivide\"] = 113] = \"NumpadDivide\";\n    /**\n     * Cover all key codes when IME is processing input.\n     */\n    KeyCode[KeyCode[\"KEY_IN_COMPOSITION\"] = 114] = \"KEY_IN_COMPOSITION\";\n    KeyCode[KeyCode[\"ABNT_C1\"] = 115] = \"ABNT_C1\";\n    KeyCode[KeyCode[\"ABNT_C2\"] = 116] = \"ABNT_C2\";\n    KeyCode[KeyCode[\"AudioVolumeMute\"] = 117] = \"AudioVolumeMute\";\n    KeyCode[KeyCode[\"AudioVolumeUp\"] = 118] = \"AudioVolumeUp\";\n    KeyCode[KeyCode[\"AudioVolumeDown\"] = 119] = \"AudioVolumeDown\";\n    KeyCode[KeyCode[\"BrowserSearch\"] = 120] = \"BrowserSearch\";\n    KeyCode[KeyCode[\"BrowserHome\"] = 121] = \"BrowserHome\";\n    KeyCode[KeyCode[\"BrowserBack\"] = 122] = \"BrowserBack\";\n    KeyCode[KeyCode[\"BrowserForward\"] = 123] = \"BrowserForward\";\n    KeyCode[KeyCode[\"MediaTrackNext\"] = 124] = \"MediaTrackNext\";\n    KeyCode[KeyCode[\"MediaTrackPrevious\"] = 125] = \"MediaTrackPrevious\";\n    KeyCode[KeyCode[\"MediaStop\"] = 126] = \"MediaStop\";\n    KeyCode[KeyCode[\"MediaPlayPause\"] = 127] = \"MediaPlayPause\";\n    KeyCode[KeyCode[\"LaunchMediaPlayer\"] = 128] = \"LaunchMediaPlayer\";\n    KeyCode[KeyCode[\"LaunchMail\"] = 129] = \"LaunchMail\";\n    KeyCode[KeyCode[\"LaunchApp2\"] = 130] = \"LaunchApp2\";\n    /**\n     * VK_CLEAR, 0x0C, CLEAR key\n     */\n    KeyCode[KeyCode[\"Clear\"] = 131] = \"Clear\";\n    /**\n     * Placed last to cover the length of the enum.\n     * Please do not depend on this value!\n     */\n    KeyCode[KeyCode[\"MAX_VALUE\"] = 132] = \"MAX_VALUE\";\n})(KeyCode || (KeyCode = {}));\nvar MarkerSeverity;\n(function (MarkerSeverity) {\n    MarkerSeverity[MarkerSeverity[\"Hint\"] = 1] = \"Hint\";\n    MarkerSeverity[MarkerSeverity[\"Info\"] = 2] = \"Info\";\n    MarkerSeverity[MarkerSeverity[\"Warning\"] = 4] = \"Warning\";\n    MarkerSeverity[MarkerSeverity[\"Error\"] = 8] = \"Error\";\n})(MarkerSeverity || (MarkerSeverity = {}));\nvar MarkerTag;\n(function (MarkerTag) {\n    MarkerTag[MarkerTag[\"Unnecessary\"] = 1] = \"Unnecessary\";\n    MarkerTag[MarkerTag[\"Deprecated\"] = 2] = \"Deprecated\";\n})(MarkerTag || (MarkerTag = {}));\n/**\n * Position in the minimap to render the decoration.\n */\nvar MinimapPosition;\n(function (MinimapPosition) {\n    MinimapPosition[MinimapPosition[\"Inline\"] = 1] = \"Inline\";\n    MinimapPosition[MinimapPosition[\"Gutter\"] = 2] = \"Gutter\";\n})(MinimapPosition || (MinimapPosition = {}));\n/**\n * Section header style.\n */\nvar MinimapSectionHeaderStyle;\n(function (MinimapSectionHeaderStyle) {\n    MinimapSectionHeaderStyle[MinimapSectionHeaderStyle[\"Normal\"] = 1] = \"Normal\";\n    MinimapSectionHeaderStyle[MinimapSectionHeaderStyle[\"Underlined\"] = 2] = \"Underlined\";\n})(MinimapSectionHeaderStyle || (MinimapSectionHeaderStyle = {}));\n/**\n * Type of hit element with the mouse in the editor.\n */\nvar MouseTargetType;\n(function (MouseTargetType) {\n    /**\n     * Mouse is on top of an unknown element.\n     */\n    MouseTargetType[MouseTargetType[\"UNKNOWN\"] = 0] = \"UNKNOWN\";\n    /**\n     * Mouse is on top of the textarea used for input.\n     */\n    MouseTargetType[MouseTargetType[\"TEXTAREA\"] = 1] = \"TEXTAREA\";\n    /**\n     * Mouse is on top of the glyph margin\n     */\n    MouseTargetType[MouseTargetType[\"GUTTER_GLYPH_MARGIN\"] = 2] = \"GUTTER_GLYPH_MARGIN\";\n    /**\n     * Mouse is on top of the line numbers\n     */\n    MouseTargetType[MouseTargetType[\"GUTTER_LINE_NUMBERS\"] = 3] = \"GUTTER_LINE_NUMBERS\";\n    /**\n     * Mouse is on top of the line decorations\n     */\n    MouseTargetType[MouseTargetType[\"GUTTER_LINE_DECORATIONS\"] = 4] = \"GUTTER_LINE_DECORATIONS\";\n    /**\n     * Mouse is on top of the whitespace left in the gutter by a view zone.\n     */\n    MouseTargetType[MouseTargetType[\"GUTTER_VIEW_ZONE\"] = 5] = \"GUTTER_VIEW_ZONE\";\n    /**\n     * Mouse is on top of text in the content.\n     */\n    MouseTargetType[MouseTargetType[\"CONTENT_TEXT\"] = 6] = \"CONTENT_TEXT\";\n    /**\n     * Mouse is on top of empty space in the content (e.g. after line text or below last line)\n     */\n    MouseTargetType[MouseTargetType[\"CONTENT_EMPTY\"] = 7] = \"CONTENT_EMPTY\";\n    /**\n     * Mouse is on top of a view zone in the content.\n     */\n    MouseTargetType[MouseTargetType[\"CONTENT_VIEW_ZONE\"] = 8] = \"CONTENT_VIEW_ZONE\";\n    /**\n     * Mouse is on top of a content widget.\n     */\n    MouseTargetType[MouseTargetType[\"CONTENT_WIDGET\"] = 9] = \"CONTENT_WIDGET\";\n    /**\n     * Mouse is on top of the decorations overview ruler.\n     */\n    MouseTargetType[MouseTargetType[\"OVERVIEW_RULER\"] = 10] = \"OVERVIEW_RULER\";\n    /**\n     * Mouse is on top of a scrollbar.\n     */\n    MouseTargetType[MouseTargetType[\"SCROLLBAR\"] = 11] = \"SCROLLBAR\";\n    /**\n     * Mouse is on top of an overlay widget.\n     */\n    MouseTargetType[MouseTargetType[\"OVERLAY_WIDGET\"] = 12] = \"OVERLAY_WIDGET\";\n    /**\n     * Mouse is outside of the editor.\n     */\n    MouseTargetType[MouseTargetType[\"OUTSIDE_EDITOR\"] = 13] = \"OUTSIDE_EDITOR\";\n})(MouseTargetType || (MouseTargetType = {}));\nvar NewSymbolNameTag;\n(function (NewSymbolNameTag) {\n    NewSymbolNameTag[NewSymbolNameTag[\"AIGenerated\"] = 1] = \"AIGenerated\";\n})(NewSymbolNameTag || (NewSymbolNameTag = {}));\nvar NewSymbolNameTriggerKind;\n(function (NewSymbolNameTriggerKind) {\n    NewSymbolNameTriggerKind[NewSymbolNameTriggerKind[\"Invoke\"] = 0] = \"Invoke\";\n    NewSymbolNameTriggerKind[NewSymbolNameTriggerKind[\"Automatic\"] = 1] = \"Automatic\";\n})(NewSymbolNameTriggerKind || (NewSymbolNameTriggerKind = {}));\n/**\n * A positioning preference for rendering overlay widgets.\n */\nvar OverlayWidgetPositionPreference;\n(function (OverlayWidgetPositionPreference) {\n    /**\n     * Position the overlay widget in the top right corner\n     */\n    OverlayWidgetPositionPreference[OverlayWidgetPositionPreference[\"TOP_RIGHT_CORNER\"] = 0] = \"TOP_RIGHT_CORNER\";\n    /**\n     * Position the overlay widget in the bottom right corner\n     */\n    OverlayWidgetPositionPreference[OverlayWidgetPositionPreference[\"BOTTOM_RIGHT_CORNER\"] = 1] = \"BOTTOM_RIGHT_CORNER\";\n    /**\n     * Position the overlay widget in the top center\n     */\n    OverlayWidgetPositionPreference[OverlayWidgetPositionPreference[\"TOP_CENTER\"] = 2] = \"TOP_CENTER\";\n})(OverlayWidgetPositionPreference || (OverlayWidgetPositionPreference = {}));\n/**\n * Vertical Lane in the overview ruler of the editor.\n */\nvar OverviewRulerLane;\n(function (OverviewRulerLane) {\n    OverviewRulerLane[OverviewRulerLane[\"Left\"] = 1] = \"Left\";\n    OverviewRulerLane[OverviewRulerLane[\"Center\"] = 2] = \"Center\";\n    OverviewRulerLane[OverviewRulerLane[\"Right\"] = 4] = \"Right\";\n    OverviewRulerLane[OverviewRulerLane[\"Full\"] = 7] = \"Full\";\n})(OverviewRulerLane || (OverviewRulerLane = {}));\n/**\n * How a partial acceptance was triggered.\n */\nvar PartialAcceptTriggerKind;\n(function (PartialAcceptTriggerKind) {\n    PartialAcceptTriggerKind[PartialAcceptTriggerKind[\"Word\"] = 0] = \"Word\";\n    PartialAcceptTriggerKind[PartialAcceptTriggerKind[\"Line\"] = 1] = \"Line\";\n    PartialAcceptTriggerKind[PartialAcceptTriggerKind[\"Suggest\"] = 2] = \"Suggest\";\n})(PartialAcceptTriggerKind || (PartialAcceptTriggerKind = {}));\nvar PositionAffinity;\n(function (PositionAffinity) {\n    /**\n     * Prefers the left most position.\n    */\n    PositionAffinity[PositionAffinity[\"Left\"] = 0] = \"Left\";\n    /**\n     * Prefers the right most position.\n    */\n    PositionAffinity[PositionAffinity[\"Right\"] = 1] = \"Right\";\n    /**\n     * No preference.\n    */\n    PositionAffinity[PositionAffinity[\"None\"] = 2] = \"None\";\n    /**\n     * If the given position is on injected text, prefers the position left of it.\n    */\n    PositionAffinity[PositionAffinity[\"LeftOfInjectedText\"] = 3] = \"LeftOfInjectedText\";\n    /**\n     * If the given position is on injected text, prefers the position right of it.\n    */\n    PositionAffinity[PositionAffinity[\"RightOfInjectedText\"] = 4] = \"RightOfInjectedText\";\n})(PositionAffinity || (PositionAffinity = {}));\nvar RenderLineNumbersType;\n(function (RenderLineNumbersType) {\n    RenderLineNumbersType[RenderLineNumbersType[\"Off\"] = 0] = \"Off\";\n    RenderLineNumbersType[RenderLineNumbersType[\"On\"] = 1] = \"On\";\n    RenderLineNumbersType[RenderLineNumbersType[\"Relative\"] = 2] = \"Relative\";\n    RenderLineNumbersType[RenderLineNumbersType[\"Interval\"] = 3] = \"Interval\";\n    RenderLineNumbersType[RenderLineNumbersType[\"Custom\"] = 4] = \"Custom\";\n})(RenderLineNumbersType || (RenderLineNumbersType = {}));\nvar RenderMinimap;\n(function (RenderMinimap) {\n    RenderMinimap[RenderMinimap[\"None\"] = 0] = \"None\";\n    RenderMinimap[RenderMinimap[\"Text\"] = 1] = \"Text\";\n    RenderMinimap[RenderMinimap[\"Blocks\"] = 2] = \"Blocks\";\n})(RenderMinimap || (RenderMinimap = {}));\nvar ScrollType;\n(function (ScrollType) {\n    ScrollType[ScrollType[\"Smooth\"] = 0] = \"Smooth\";\n    ScrollType[ScrollType[\"Immediate\"] = 1] = \"Immediate\";\n})(ScrollType || (ScrollType = {}));\nvar ScrollbarVisibility;\n(function (ScrollbarVisibility) {\n    ScrollbarVisibility[ScrollbarVisibility[\"Auto\"] = 1] = \"Auto\";\n    ScrollbarVisibility[ScrollbarVisibility[\"Hidden\"] = 2] = \"Hidden\";\n    ScrollbarVisibility[ScrollbarVisibility[\"Visible\"] = 3] = \"Visible\";\n})(ScrollbarVisibility || (ScrollbarVisibility = {}));\n/**\n * The direction of a selection.\n */\nvar SelectionDirection;\n(function (SelectionDirection) {\n    /**\n     * The selection starts above where it ends.\n     */\n    SelectionDirection[SelectionDirection[\"LTR\"] = 0] = \"LTR\";\n    /**\n     * The selection starts below where it ends.\n     */\n    SelectionDirection[SelectionDirection[\"RTL\"] = 1] = \"RTL\";\n})(SelectionDirection || (SelectionDirection = {}));\nvar ShowLightbulbIconMode;\n(function (ShowLightbulbIconMode) {\n    ShowLightbulbIconMode[\"Off\"] = \"off\";\n    ShowLightbulbIconMode[\"OnCode\"] = \"onCode\";\n    ShowLightbulbIconMode[\"On\"] = \"on\";\n})(ShowLightbulbIconMode || (ShowLightbulbIconMode = {}));\nvar SignatureHelpTriggerKind;\n(function (SignatureHelpTriggerKind) {\n    SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"Invoke\"] = 1] = \"Invoke\";\n    SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"TriggerCharacter\"] = 2] = \"TriggerCharacter\";\n    SignatureHelpTriggerKind[SignatureHelpTriggerKind[\"ContentChange\"] = 3] = \"ContentChange\";\n})(SignatureHelpTriggerKind || (SignatureHelpTriggerKind = {}));\n/**\n * A symbol kind.\n */\nvar SymbolKind;\n(function (SymbolKind) {\n    SymbolKind[SymbolKind[\"File\"] = 0] = \"File\";\n    SymbolKind[SymbolKind[\"Module\"] = 1] = \"Module\";\n    SymbolKind[SymbolKind[\"Namespace\"] = 2] = \"Namespace\";\n    SymbolKind[SymbolKind[\"Package\"] = 3] = \"Package\";\n    SymbolKind[SymbolKind[\"Class\"] = 4] = \"Class\";\n    SymbolKind[SymbolKind[\"Method\"] = 5] = \"Method\";\n    SymbolKind[SymbolKind[\"Property\"] = 6] = \"Property\";\n    SymbolKind[SymbolKind[\"Field\"] = 7] = \"Field\";\n    SymbolKind[SymbolKind[\"Constructor\"] = 8] = \"Constructor\";\n    SymbolKind[SymbolKind[\"Enum\"] = 9] = \"Enum\";\n    SymbolKind[SymbolKind[\"Interface\"] = 10] = \"Interface\";\n    SymbolKind[SymbolKind[\"Function\"] = 11] = \"Function\";\n    SymbolKind[SymbolKind[\"Variable\"] = 12] = \"Variable\";\n    SymbolKind[SymbolKind[\"Constant\"] = 13] = \"Constant\";\n    SymbolKind[SymbolKind[\"String\"] = 14] = \"String\";\n    SymbolKind[SymbolKind[\"Number\"] = 15] = \"Number\";\n    SymbolKind[SymbolKind[\"Boolean\"] = 16] = \"Boolean\";\n    SymbolKind[SymbolKind[\"Array\"] = 17] = \"Array\";\n    SymbolKind[SymbolKind[\"Object\"] = 18] = \"Object\";\n    SymbolKind[SymbolKind[\"Key\"] = 19] = \"Key\";\n    SymbolKind[SymbolKind[\"Null\"] = 20] = \"Null\";\n    SymbolKind[SymbolKind[\"EnumMember\"] = 21] = \"EnumMember\";\n    SymbolKind[SymbolKind[\"Struct\"] = 22] = \"Struct\";\n    SymbolKind[SymbolKind[\"Event\"] = 23] = \"Event\";\n    SymbolKind[SymbolKind[\"Operator\"] = 24] = \"Operator\";\n    SymbolKind[SymbolKind[\"TypeParameter\"] = 25] = \"TypeParameter\";\n})(SymbolKind || (SymbolKind = {}));\nvar SymbolTag;\n(function (SymbolTag) {\n    SymbolTag[SymbolTag[\"Deprecated\"] = 1] = \"Deprecated\";\n})(SymbolTag || (SymbolTag = {}));\n/**\n * Text Direction for a decoration.\n */\nvar TextDirection;\n(function (TextDirection) {\n    TextDirection[TextDirection[\"LTR\"] = 0] = \"LTR\";\n    TextDirection[TextDirection[\"RTL\"] = 1] = \"RTL\";\n})(TextDirection || (TextDirection = {}));\n/**\n * The kind of animation in which the editor's cursor should be rendered.\n */\nvar TextEditorCursorBlinkingStyle;\n(function (TextEditorCursorBlinkingStyle) {\n    /**\n     * Hidden\n     */\n    TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Hidden\"] = 0] = \"Hidden\";\n    /**\n     * Blinking\n     */\n    TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Blink\"] = 1] = \"Blink\";\n    /**\n     * Blinking with smooth fading\n     */\n    TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Smooth\"] = 2] = \"Smooth\";\n    /**\n     * Blinking with prolonged filled state and smooth fading\n     */\n    TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Phase\"] = 3] = \"Phase\";\n    /**\n     * Expand collapse animation on the y axis\n     */\n    TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Expand\"] = 4] = \"Expand\";\n    /**\n     * No-Blinking\n     */\n    TextEditorCursorBlinkingStyle[TextEditorCursorBlinkingStyle[\"Solid\"] = 5] = \"Solid\";\n})(TextEditorCursorBlinkingStyle || (TextEditorCursorBlinkingStyle = {}));\n/**\n * The style in which the editor's cursor should be rendered.\n */\nvar TextEditorCursorStyle;\n(function (TextEditorCursorStyle) {\n    /**\n     * As a vertical line (sitting between two characters).\n     */\n    TextEditorCursorStyle[TextEditorCursorStyle[\"Line\"] = 1] = \"Line\";\n    /**\n     * As a block (sitting on top of a character).\n     */\n    TextEditorCursorStyle[TextEditorCursorStyle[\"Block\"] = 2] = \"Block\";\n    /**\n     * As a horizontal line (sitting under a character).\n     */\n    TextEditorCursorStyle[TextEditorCursorStyle[\"Underline\"] = 3] = \"Underline\";\n    /**\n     * As a thin vertical line (sitting between two characters).\n     */\n    TextEditorCursorStyle[TextEditorCursorStyle[\"LineThin\"] = 4] = \"LineThin\";\n    /**\n     * As an outlined block (sitting on top of a character).\n     */\n    TextEditorCursorStyle[TextEditorCursorStyle[\"BlockOutline\"] = 5] = \"BlockOutline\";\n    /**\n     * As a thin horizontal line (sitting under a character).\n     */\n    TextEditorCursorStyle[TextEditorCursorStyle[\"UnderlineThin\"] = 6] = \"UnderlineThin\";\n})(TextEditorCursorStyle || (TextEditorCursorStyle = {}));\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 */\nvar TrackedRangeStickiness;\n(function (TrackedRangeStickiness) {\n    TrackedRangeStickiness[TrackedRangeStickiness[\"AlwaysGrowsWhenTypingAtEdges\"] = 0] = \"AlwaysGrowsWhenTypingAtEdges\";\n    TrackedRangeStickiness[TrackedRangeStickiness[\"NeverGrowsWhenTypingAtEdges\"] = 1] = \"NeverGrowsWhenTypingAtEdges\";\n    TrackedRangeStickiness[TrackedRangeStickiness[\"GrowsOnlyWhenTypingBefore\"] = 2] = \"GrowsOnlyWhenTypingBefore\";\n    TrackedRangeStickiness[TrackedRangeStickiness[\"GrowsOnlyWhenTypingAfter\"] = 3] = \"GrowsOnlyWhenTypingAfter\";\n})(TrackedRangeStickiness || (TrackedRangeStickiness = {}));\n/**\n * Describes how to indent wrapped lines.\n */\nvar WrappingIndent;\n(function (WrappingIndent) {\n    /**\n     * No indentation => wrapped lines begin at column 1.\n     */\n    WrappingIndent[WrappingIndent[\"None\"] = 0] = \"None\";\n    /**\n     * Same => wrapped lines get the same indentation as the parent.\n     */\n    WrappingIndent[WrappingIndent[\"Same\"] = 1] = \"Same\";\n    /**\n     * Indent => wrapped lines get +1 indentation toward the parent.\n     */\n    WrappingIndent[WrappingIndent[\"Indent\"] = 2] = \"Indent\";\n    /**\n     * DeepIndent => wrapped lines get +2 indentation toward the parent.\n     */\n    WrappingIndent[WrappingIndent[\"DeepIndent\"] = 3] = \"DeepIndent\";\n})(WrappingIndent || (WrappingIndent = {}));\n\nexport { AccessibilitySupport, CodeActionTriggerType, CompletionItemInsertTextRule, CompletionItemKind, CompletionItemTag, CompletionTriggerKind, ContentWidgetPositionPreference, CursorChangeReason, DefaultEndOfLine, DocumentHighlightKind, EditorAutoIndentStrategy, EditorOption, EndOfLinePreference, EndOfLineSequence, GlyphMarginLane, HoverVerbosityAction, IndentAction, InjectedTextCursorStops, InlayHintKind, InlineCompletionEndOfLifeReasonKind, InlineCompletionHintStyle, InlineCompletionTriggerKind, KeyCode, MarkerSeverity, MarkerTag, MinimapPosition, MinimapSectionHeaderStyle, MouseTargetType, NewSymbolNameTag, NewSymbolNameTriggerKind, OverlayWidgetPositionPreference, OverviewRulerLane, PartialAcceptTriggerKind, PositionAffinity, RenderLineNumbersType, RenderMinimap, ScrollType, ScrollbarVisibility, SelectionDirection, ShowLightbulbIconMode, SignatureHelpTriggerKind, SymbolKind, SymbolTag, TextDirection, TextEditorCursorBlinkingStyle, TextEditorCursorStyle, TrackedRangeStickiness, WrappingIndent };\n","import { CancellationTokenSource } from '../../../base/common/cancellation.js';\nimport { Emitter } from '../../../base/common/event.js';\nimport { KeyChord } from '../../../base/common/keyCodes.js';\nimport { URI } from '../../../base/common/uri.js';\nimport { Position } from '../core/position.js';\nimport { Range } from '../core/range.js';\nimport { Selection } from '../core/selection.js';\nimport { Token } from '../languages.js';\nimport { MarkerTag, MarkerSeverity, SelectionDirection, KeyCode } from '../standalone/standaloneEnums.js';\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 *--------------------------------------------------------------------------------------------*/\nclass KeyMod {\n    static { this.CtrlCmd = 2048 /* ConstKeyMod.CtrlCmd */; }\n    static { this.Shift = 1024 /* ConstKeyMod.Shift */; }\n    static { this.Alt = 512 /* ConstKeyMod.Alt */; }\n    static { this.WinCtrl = 256 /* ConstKeyMod.WinCtrl */; }\n    static chord(firstPart, secondPart) {\n        return KeyChord(firstPart, secondPart);\n    }\n}\nfunction createMonacoBaseAPI() {\n    return {\n        editor: undefined, // undefined override expected here\n        languages: undefined, // undefined override expected here\n        CancellationTokenSource: CancellationTokenSource,\n        Emitter: Emitter,\n        KeyCode: KeyCode,\n        KeyMod: KeyMod,\n        Position: Position,\n        Range: Range,\n        Selection: Selection,\n        SelectionDirection: SelectionDirection,\n        MarkerSeverity: MarkerSeverity,\n        MarkerTag: MarkerTag,\n        Uri: URI,\n        Token: Token\n    };\n}\n\nexport { KeyMod, createMonacoBaseAPI };\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 _a, _b, _c;\nclass ResourceMapEntry {\n    constructor(uri, value) {\n        this.uri = uri;\n        this.value = value;\n    }\n}\nfunction isEntries(arg) {\n    return Array.isArray(arg);\n}\nclass ResourceMap {\n    static { this.defaultToKey = (resource) => resource.toString(); }\n    constructor(arg, toKey) {\n        this[_a] = 'ResourceMap';\n        if (arg instanceof ResourceMap) {\n            this.map = new Map(arg.map);\n            this.toKey = toKey ?? ResourceMap.defaultToKey;\n        }\n        else if (isEntries(arg)) {\n            this.map = new Map();\n            this.toKey = toKey ?? ResourceMap.defaultToKey;\n            for (const [resource, value] of arg) {\n                this.set(resource, value);\n            }\n        }\n        else {\n            this.map = new Map();\n            this.toKey = arg ?? ResourceMap.defaultToKey;\n        }\n    }\n    set(resource, value) {\n        this.map.set(this.toKey(resource), new ResourceMapEntry(resource, value));\n        return this;\n    }\n    get(resource) {\n        return this.map.get(this.toKey(resource))?.value;\n    }\n    has(resource) {\n        return this.map.has(this.toKey(resource));\n    }\n    get size() {\n        return this.map.size;\n    }\n    clear() {\n        this.map.clear();\n    }\n    delete(resource) {\n        return this.map.delete(this.toKey(resource));\n    }\n    forEach(clb, thisArg) {\n        if (typeof thisArg !== 'undefined') {\n            clb = clb.bind(thisArg);\n        }\n        for (const [_, entry] of this.map) {\n            clb(entry.value, entry.uri, this);\n        }\n    }\n    *values() {\n        for (const entry of this.map.values()) {\n            yield entry.value;\n        }\n    }\n    *keys() {\n        for (const entry of this.map.values()) {\n            yield entry.uri;\n        }\n    }\n    *entries() {\n        for (const entry of this.map.values()) {\n            yield [entry.uri, entry.value];\n        }\n    }\n    *[(_a = Symbol.toStringTag, Symbol.iterator)]() {\n        for (const [, entry] of this.map) {\n            yield [entry.uri, entry.value];\n        }\n    }\n}\nclass ResourceSet {\n    constructor(entriesOrKey, toKey) {\n        this[_b] = 'ResourceSet';\n        if (!entriesOrKey || typeof entriesOrKey === 'function') {\n            this._map = new ResourceMap(entriesOrKey);\n        }\n        else {\n            this._map = new ResourceMap(toKey);\n            entriesOrKey.forEach(this.add, this);\n        }\n    }\n    get size() {\n        return this._map.size;\n    }\n    add(value) {\n        this._map.set(value, value);\n        return this;\n    }\n    clear() {\n        this._map.clear();\n    }\n    delete(value) {\n        return this._map.delete(value);\n    }\n    forEach(callbackfn, thisArg) {\n        this._map.forEach((_value, key) => callbackfn.call(thisArg, key, key, this));\n    }\n    has(value) {\n        return this._map.has(value);\n    }\n    entries() {\n        return this._map.entries();\n    }\n    keys() {\n        return this._map.keys();\n    }\n    values() {\n        return this._map.keys();\n    }\n    [(_b = Symbol.toStringTag, Symbol.iterator)]() {\n        return this.keys();\n    }\n}\nclass LinkedMap {\n    constructor() {\n        this[_c] = 'LinkedMap';\n        this._map = new Map();\n        this._head = undefined;\n        this._tail = undefined;\n        this._size = 0;\n        this._state = 0;\n    }\n    clear() {\n        this._map.clear();\n        this._head = undefined;\n        this._tail = undefined;\n        this._size = 0;\n        this._state++;\n    }\n    isEmpty() {\n        return !this._head && !this._tail;\n    }\n    get size() {\n        return this._size;\n    }\n    get first() {\n        return this._head?.value;\n    }\n    get last() {\n        return this._tail?.value;\n    }\n    has(key) {\n        return this._map.has(key);\n    }\n    get(key, touch = 0 /* Touch.None */) {\n        const item = this._map.get(key);\n        if (!item) {\n            return undefined;\n        }\n        if (touch !== 0 /* Touch.None */) {\n            this.touch(item, touch);\n        }\n        return item.value;\n    }\n    set(key, value, touch = 0 /* Touch.None */) {\n        let item = this._map.get(key);\n        if (item) {\n            item.value = value;\n            if (touch !== 0 /* Touch.None */) {\n                this.touch(item, touch);\n            }\n        }\n        else {\n            item = { key, value, next: undefined, previous: undefined };\n            switch (touch) {\n                case 0 /* Touch.None */:\n                    this.addItemLast(item);\n                    break;\n                case 1 /* Touch.AsOld */:\n                    this.addItemFirst(item);\n                    break;\n                case 2 /* Touch.AsNew */:\n                    this.addItemLast(item);\n                    break;\n                default:\n                    this.addItemLast(item);\n                    break;\n            }\n            this._map.set(key, item);\n            this._size++;\n        }\n        return this;\n    }\n    delete(key) {\n        return !!this.remove(key);\n    }\n    remove(key) {\n        const item = this._map.get(key);\n        if (!item) {\n            return undefined;\n        }\n        this._map.delete(key);\n        this.removeItem(item);\n        this._size--;\n        return item.value;\n    }\n    shift() {\n        if (!this._head && !this._tail) {\n            return undefined;\n        }\n        if (!this._head || !this._tail) {\n            throw new Error('Invalid list');\n        }\n        const item = this._head;\n        this._map.delete(item.key);\n        this.removeItem(item);\n        this._size--;\n        return item.value;\n    }\n    forEach(callbackfn, thisArg) {\n        const state = this._state;\n        let current = this._head;\n        while (current) {\n            if (thisArg) {\n                callbackfn.bind(thisArg)(current.value, current.key, this);\n            }\n            else {\n                callbackfn(current.value, current.key, this);\n            }\n            if (this._state !== state) {\n                throw new Error(`LinkedMap got modified during iteration.`);\n            }\n            current = current.next;\n        }\n    }\n    keys() {\n        const map = this;\n        const state = this._state;\n        let current = this._head;\n        const iterator = {\n            [Symbol.iterator]() {\n                return iterator;\n            },\n            next() {\n                if (map._state !== state) {\n                    throw new Error(`LinkedMap got modified during iteration.`);\n                }\n                if (current) {\n                    const result = { value: current.key, done: false };\n                    current = current.next;\n                    return result;\n                }\n                else {\n                    return { value: undefined, done: true };\n                }\n            }\n        };\n        return iterator;\n    }\n    values() {\n        const map = this;\n        const state = this._state;\n        let current = this._head;\n        const iterator = {\n            [Symbol.iterator]() {\n                return iterator;\n            },\n            next() {\n                if (map._state !== state) {\n                    throw new Error(`LinkedMap got modified during iteration.`);\n                }\n                if (current) {\n                    const result = { value: current.value, done: false };\n                    current = current.next;\n                    return result;\n                }\n                else {\n                    return { value: undefined, done: true };\n                }\n            }\n        };\n        return iterator;\n    }\n    entries() {\n        const map = this;\n        const state = this._state;\n        let current = this._head;\n        const iterator = {\n            [Symbol.iterator]() {\n                return iterator;\n            },\n            next() {\n                if (map._state !== state) {\n                    throw new Error(`LinkedMap got modified during iteration.`);\n                }\n                if (current) {\n                    const result = { value: [current.key, current.value], done: false };\n                    current = current.next;\n                    return result;\n                }\n                else {\n                    return { value: undefined, done: true };\n                }\n            }\n        };\n        return iterator;\n    }\n    [(_c = Symbol.toStringTag, Symbol.iterator)]() {\n        return this.entries();\n    }\n    trimOld(newSize) {\n        if (newSize >= this.size) {\n            return;\n        }\n        if (newSize === 0) {\n            this.clear();\n            return;\n        }\n        let current = this._head;\n        let currentSize = this.size;\n        while (current && currentSize > newSize) {\n            this._map.delete(current.key);\n            current = current.next;\n            currentSize--;\n        }\n        this._head = current;\n        this._size = currentSize;\n        if (current) {\n            current.previous = undefined;\n        }\n        this._state++;\n    }\n    trimNew(newSize) {\n        if (newSize >= this.size) {\n            return;\n        }\n        if (newSize === 0) {\n            this.clear();\n            return;\n        }\n        let current = this._tail;\n        let currentSize = this.size;\n        while (current && currentSize > newSize) {\n            this._map.delete(current.key);\n            current = current.previous;\n            currentSize--;\n        }\n        this._tail = current;\n        this._size = currentSize;\n        if (current) {\n            current.next = undefined;\n        }\n        this._state++;\n    }\n    addItemFirst(item) {\n        // First time Insert\n        if (!this._head && !this._tail) {\n            this._tail = item;\n        }\n        else if (!this._head) {\n            throw new Error('Invalid list');\n        }\n        else {\n            item.next = this._head;\n            this._head.previous = item;\n        }\n        this._head = item;\n        this._state++;\n    }\n    addItemLast(item) {\n        // First time Insert\n        if (!this._head && !this._tail) {\n            this._head = item;\n        }\n        else if (!this._tail) {\n            throw new Error('Invalid list');\n        }\n        else {\n            item.previous = this._tail;\n            this._tail.next = item;\n        }\n        this._tail = item;\n        this._state++;\n    }\n    removeItem(item) {\n        if (item === this._head && item === this._tail) {\n            this._head = undefined;\n            this._tail = undefined;\n        }\n        else if (item === this._head) {\n            // This can only happen if size === 1 which is handled\n            // by the case above.\n            if (!item.next) {\n                throw new Error('Invalid list');\n            }\n            item.next.previous = undefined;\n            this._head = item.next;\n        }\n        else if (item === this._tail) {\n            // This can only happen if size === 1 which is handled\n            // by the case above.\n            if (!item.previous) {\n                throw new Error('Invalid list');\n            }\n            item.previous.next = undefined;\n            this._tail = item.previous;\n        }\n        else {\n            const next = item.next;\n            const previous = item.previous;\n            if (!next || !previous) {\n                throw new Error('Invalid list');\n            }\n            next.previous = previous;\n            previous.next = next;\n        }\n        item.next = undefined;\n        item.previous = undefined;\n        this._state++;\n    }\n    touch(item, touch) {\n        if (!this._head || !this._tail) {\n            throw new Error('Invalid list');\n        }\n        if ((touch !== 1 /* Touch.AsOld */ && touch !== 2 /* Touch.AsNew */)) {\n            return;\n        }\n        if (touch === 1 /* Touch.AsOld */) {\n            if (item === this._head) {\n                return;\n            }\n            const next = item.next;\n            const previous = item.previous;\n            // Unlink the item\n            if (item === this._tail) {\n                // previous must be defined since item was not head but is tail\n                // So there are more than on item in the map\n                previous.next = undefined;\n                this._tail = previous;\n            }\n            else {\n                // Both next and previous are not undefined since item was neither head nor tail.\n                next.previous = previous;\n                previous.next = next;\n            }\n            // Insert the node at head\n            item.previous = undefined;\n            item.next = this._head;\n            this._head.previous = item;\n            this._head = item;\n            this._state++;\n        }\n        else if (touch === 2 /* Touch.AsNew */) {\n            if (item === this._tail) {\n                return;\n            }\n            const next = item.next;\n            const previous = item.previous;\n            // Unlink the item.\n            if (item === this._head) {\n                // next must be defined since item was not tail but is head\n                // So there are more than on item in the map\n                next.previous = undefined;\n                this._head = next;\n            }\n            else {\n                // Both next and previous are not undefined since item was neither head nor tail.\n                next.previous = previous;\n                previous.next = next;\n            }\n            item.next = undefined;\n            item.previous = this._tail;\n            this._tail.next = item;\n            this._tail = item;\n            this._state++;\n        }\n    }\n    toJSON() {\n        const data = [];\n        this.forEach((value, key) => {\n            data.push([key, value]);\n        });\n        return data;\n    }\n    fromJSON(data) {\n        this.clear();\n        for (const [key, value] of data) {\n            this.set(key, value);\n        }\n    }\n}\nclass Cache extends LinkedMap {\n    constructor(limit, ratio = 1) {\n        super();\n        this._limit = limit;\n        this._ratio = Math.min(Math.max(0, ratio), 1);\n    }\n    get limit() {\n        return this._limit;\n    }\n    set limit(limit) {\n        this._limit = limit;\n        this.checkTrim();\n    }\n    get(key, touch = 2 /* Touch.AsNew */) {\n        return super.get(key, touch);\n    }\n    peek(key) {\n        return super.get(key, 0 /* Touch.None */);\n    }\n    set(key, value) {\n        super.set(key, value, 2 /* Touch.AsNew */);\n        return this;\n    }\n    checkTrim() {\n        if (this.size > this._limit) {\n            this.trim(Math.round(this._limit * this._ratio));\n        }\n    }\n}\nclass LRUCache extends Cache {\n    constructor(limit, ratio = 1) {\n        super(limit, ratio);\n    }\n    trim(newSize) {\n        this.trimOld(newSize);\n    }\n    set(key, value) {\n        super.set(key, value);\n        this.checkTrim();\n        return this;\n    }\n}\n/**\n * A map that allows access both by keys and values.\n * **NOTE**: values need to be unique.\n */\nclass BidirectionalMap {\n    constructor(entries) {\n        this._m1 = new Map();\n        this._m2 = new Map();\n        if (entries) {\n            for (const [key, value] of entries) {\n                this.set(key, value);\n            }\n        }\n    }\n    clear() {\n        this._m1.clear();\n        this._m2.clear();\n    }\n    set(key, value) {\n        this._m1.set(key, value);\n        this._m2.set(value, key);\n    }\n    get(key) {\n        return this._m1.get(key);\n    }\n    getKey(value) {\n        return this._m2.get(value);\n    }\n    delete(key) {\n        const value = this._m1.get(key);\n        if (value === undefined) {\n            return false;\n        }\n        this._m1.delete(key);\n        this._m2.delete(value);\n        return true;\n    }\n    keys() {\n        return this._m1.keys();\n    }\n    values() {\n        return this._m1.values();\n    }\n}\nclass SetMap {\n    constructor() {\n        this.map = new Map();\n    }\n    add(key, value) {\n        let values = this.map.get(key);\n        if (!values) {\n            values = new Set();\n            this.map.set(key, values);\n        }\n        values.add(value);\n    }\n    delete(key, value) {\n        const values = this.map.get(key);\n        if (!values) {\n            return;\n        }\n        values.delete(value);\n        if (values.size === 0) {\n            this.map.delete(key);\n        }\n    }\n    forEach(key, fn) {\n        const values = this.map.get(key);\n        if (!values) {\n            return;\n        }\n        values.forEach(fn);\n    }\n}\n/**\n * A map that is addressable with an arbitrary number of keys. This is useful in high performance\n * scenarios where creating a composite key whenever the data is accessed is too expensive. For\n * example for a very hot function, constructing a string like `first-second-third` for every call\n * will cause a significant hit to performance.\n */\nclass NKeyMap {\n    constructor() {\n        this._data = new Map();\n    }\n    /**\n     * Sets a value on the map. Note that unlike a standard `Map`, the first argument is the value.\n     * This is because the spread operator is used for the keys and must be last..\n     * @param value The value to set.\n     * @param keys The keys for the value.\n     */\n    set(value, ...keys) {\n        let currentMap = this._data;\n        for (let i = 0; i < keys.length - 1; i++) {\n            if (!currentMap.has(keys[i])) {\n                currentMap.set(keys[i], new Map());\n            }\n            currentMap = currentMap.get(keys[i]);\n        }\n        currentMap.set(keys[keys.length - 1], value);\n    }\n    get(...keys) {\n        let currentMap = this._data;\n        for (let i = 0; i < keys.length - 1; i++) {\n            if (!currentMap.has(keys[i])) {\n                return undefined;\n            }\n            currentMap = currentMap.get(keys[i]);\n        }\n        return currentMap.get(keys[keys.length - 1]);\n    }\n    clear() {\n        this._data.clear();\n    }\n    /**\n     * Get a textual representation of the map for debugging purposes.\n     */\n    toString() {\n        const printMap = (map, depth) => {\n            let result = '';\n            for (const [key, value] of map) {\n                result += `${'  '.repeat(depth)}${key}: `;\n                if (value instanceof Map) {\n                    result += '\\n' + printMap(value, depth + 1);\n                }\n                else {\n                    result += `${value}\\n`;\n                }\n            }\n            return result;\n        };\n        return printMap(this._data, 0);\n    }\n}\n\nexport { BidirectionalMap, LRUCache, LinkedMap, NKeyMap, ResourceMap, ResourceSet, SetMap };\n","import { safeIntl } from '../../../base/common/date.js';\nimport { LRUCache } from '../../../base/common/map.js';\nimport { CharacterClassifier } from './characterClassifier.js';\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 *--------------------------------------------------------------------------------------------*/\nclass WordCharacterClassifier extends CharacterClassifier {\n    constructor(wordSeparators, intlSegmenterLocales) {\n        super(0 /* WordCharacterClass.Regular */);\n        this._segmenter = null;\n        this._cachedLine = null;\n        this._cachedSegments = [];\n        this.intlSegmenterLocales = intlSegmenterLocales;\n        if (this.intlSegmenterLocales.length > 0) {\n            this._segmenter = safeIntl.Segmenter(this.intlSegmenterLocales, { granularity: 'word' });\n        }\n        else {\n            this._segmenter = null;\n        }\n        for (let i = 0, len = wordSeparators.length; i < len; i++) {\n            this.set(wordSeparators.charCodeAt(i), 2 /* WordCharacterClass.WordSeparator */);\n        }\n        this.set(32 /* CharCode.Space */, 1 /* WordCharacterClass.Whitespace */);\n        this.set(9 /* CharCode.Tab */, 1 /* WordCharacterClass.Whitespace */);\n    }\n    findPrevIntlWordBeforeOrAtOffset(line, offset) {\n        let candidate = null;\n        for (const segment of this._getIntlSegmenterWordsOnLine(line)) {\n            if (segment.index > offset) {\n                break;\n            }\n            candidate = segment;\n        }\n        return candidate;\n    }\n    findNextIntlWordAtOrAfterOffset(lineContent, offset) {\n        for (const segment of this._getIntlSegmenterWordsOnLine(lineContent)) {\n            if (segment.index < offset) {\n                continue;\n            }\n            return segment;\n        }\n        return null;\n    }\n    _getIntlSegmenterWordsOnLine(line) {\n        if (!this._segmenter) {\n            return [];\n        }\n        // Check if the line has changed from the previous call\n        if (this._cachedLine === line) {\n            return this._cachedSegments;\n        }\n        // Update the cache with the new line\n        this._cachedLine = line;\n        this._cachedSegments = this._filterWordSegments(this._segmenter.value.segment(line));\n        return this._cachedSegments;\n    }\n    _filterWordSegments(segments) {\n        const result = [];\n        for (const segment of segments) {\n            if (this._isWordLike(segment)) {\n                result.push(segment);\n            }\n        }\n        return result;\n    }\n    _isWordLike(segment) {\n        if (segment.isWordLike) {\n            return true;\n        }\n        return false;\n    }\n}\nconst wordClassifierCache = new LRUCache(10);\nfunction getMapForWordSeparators(wordSeparators, intlSegmenterLocales) {\n    const key = `${wordSeparators}/${intlSegmenterLocales.join(',')}`;\n    let result = wordClassifierCache.get(key);\n    if (!result) {\n        result = new WordCharacterClassifier(wordSeparators, intlSegmenterLocales);\n        wordClassifierCache.set(key, result);\n    }\n    return result;\n}\n\nexport { WordCharacterClassifier, getMapForWordSeparators };\n","import { equals } from '../../base/common/objects.js';\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 * Vertical Lane in the overview ruler of the editor.\n */\nvar OverviewRulerLane;\n(function (OverviewRulerLane) {\n    OverviewRulerLane[OverviewRulerLane[\"Left\"] = 1] = \"Left\";\n    OverviewRulerLane[OverviewRulerLane[\"Center\"] = 2] = \"Center\";\n    OverviewRulerLane[OverviewRulerLane[\"Right\"] = 4] = \"Right\";\n    OverviewRulerLane[OverviewRulerLane[\"Full\"] = 7] = \"Full\";\n})(OverviewRulerLane || (OverviewRulerLane = {}));\n/**\n * Vertical Lane in the glyph margin of the editor.\n */\nvar GlyphMarginLane;\n(function (GlyphMarginLane) {\n    GlyphMarginLane[GlyphMarginLane[\"Left\"] = 1] = \"Left\";\n    GlyphMarginLane[GlyphMarginLane[\"Center\"] = 2] = \"Center\";\n    GlyphMarginLane[GlyphMarginLane[\"Right\"] = 3] = \"Right\";\n})(GlyphMarginLane || (GlyphMarginLane = {}));\n/**\n * Text Direction for a decoration.\n */\nvar TextDirection;\n(function (TextDirection) {\n    TextDirection[TextDirection[\"LTR\"] = 0] = \"LTR\";\n    TextDirection[TextDirection[\"RTL\"] = 1] = \"RTL\";\n})(TextDirection || (TextDirection = {}));\nvar InjectedTextCursorStops;\n(function (InjectedTextCursorStops) {\n    InjectedTextCursorStops[InjectedTextCursorStops[\"Both\"] = 0] = \"Both\";\n    InjectedTextCursorStops[InjectedTextCursorStops[\"Right\"] = 1] = \"Right\";\n    InjectedTextCursorStops[InjectedTextCursorStops[\"Left\"] = 2] = \"Left\";\n    InjectedTextCursorStops[InjectedTextCursorStops[\"None\"] = 3] = \"None\";\n})(InjectedTextCursorStops || (InjectedTextCursorStops = {}));\nclass TextModelResolvedOptions {\n    get originalIndentSize() {\n        return this._indentSizeIsTabSize ? 'tabSize' : this.indentSize;\n    }\n    /**\n     * @internal\n     */\n    constructor(src) {\n        this._textModelResolvedOptionsBrand = undefined;\n        this.tabSize = Math.max(1, src.tabSize | 0);\n        if (src.indentSize === 'tabSize') {\n            this.indentSize = this.tabSize;\n            this._indentSizeIsTabSize = true;\n        }\n        else {\n            this.indentSize = Math.max(1, src.indentSize | 0);\n            this._indentSizeIsTabSize = false;\n        }\n        this.insertSpaces = Boolean(src.insertSpaces);\n        this.defaultEOL = src.defaultEOL | 0;\n        this.trimAutoWhitespace = Boolean(src.trimAutoWhitespace);\n        this.bracketPairColorizationOptions = src.bracketPairColorizationOptions;\n    }\n    /**\n     * @internal\n     */\n    equals(other) {\n        return (this.tabSize === other.tabSize\n            && this._indentSizeIsTabSize === other._indentSizeIsTabSize\n            && this.indentSize === other.indentSize\n            && this.insertSpaces === other.insertSpaces\n            && this.defaultEOL === other.defaultEOL\n            && this.trimAutoWhitespace === other.trimAutoWhitespace\n            && equals(this.bracketPairColorizationOptions, other.bracketPairColorizationOptions));\n    }\n    /**\n     * @internal\n     */\n    createChangeEvent(newOpts) {\n        return {\n            tabSize: this.tabSize !== newOpts.tabSize,\n            indentSize: this.indentSize !== newOpts.indentSize,\n            insertSpaces: this.insertSpaces !== newOpts.insertSpaces,\n            trimAutoWhitespace: this.trimAutoWhitespace !== newOpts.trimAutoWhitespace,\n        };\n    }\n}\nclass FindMatch {\n    /**\n     * @internal\n     */\n    constructor(range, matches) {\n        this._findMatchBrand = undefined;\n        this.range = range;\n        this.matches = matches;\n    }\n}\n/**\n * @internal\n */\nfunction isITextSnapshot(obj) {\n    return (!!obj && typeof obj.read === 'function');\n}\n/**\n * @internal\n */\nclass ValidAnnotatedEditOperation {\n    constructor(identifier, range, text, forceMoveMarkers, isAutoWhitespaceEdit, _isTracked) {\n        this.identifier = identifier;\n        this.range = range;\n        this.text = text;\n        this.forceMoveMarkers = forceMoveMarkers;\n        this.isAutoWhitespaceEdit = isAutoWhitespaceEdit;\n        this._isTracked = _isTracked;\n    }\n}\n/**\n * @internal\n */\nclass SearchData {\n    constructor(regex, wordSeparators, simpleSearch) {\n        this.regex = regex;\n        this.wordSeparators = wordSeparators;\n        this.simpleSearch = simpleSearch;\n    }\n}\n/**\n * @internal\n */\nclass ApplyEditsResult {\n    constructor(reverseEdits, changes, trimAutoWhitespaceLineNumbers) {\n        this.reverseEdits = reverseEdits;\n        this.changes = changes;\n        this.trimAutoWhitespaceLineNumbers = trimAutoWhitespaceLineNumbers;\n    }\n}\n/**\n * @internal\n */\nfunction shouldSynchronizeModel(model) {\n    return (!model.isTooLargeForSyncing() && !model.isForSimpleWidget);\n}\n\nexport { ApplyEditsResult, FindMatch, GlyphMarginLane, InjectedTextCursorStops, OverviewRulerLane, SearchData, TextDirection, TextModelResolvedOptions, ValidAnnotatedEditOperation, isITextSnapshot, shouldSynchronizeModel };\n","import { createRegExp, getNextCodePoint } from '../../../base/common/strings.js';\nimport { getMapForWordSeparators } from '../core/wordCharacterClassifier.js';\nimport { Position } from '../core/position.js';\nimport { Range } from '../core/range.js';\nimport { SearchData, FindMatch } from '../model.js';\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 *--------------------------------------------------------------------------------------------*/\nconst LIMIT_FIND_COUNT = 999;\nclass SearchParams {\n    constructor(searchString, isRegex, matchCase, wordSeparators) {\n        this.searchString = searchString;\n        this.isRegex = isRegex;\n        this.matchCase = matchCase;\n        this.wordSeparators = wordSeparators;\n    }\n    parseSearchRequest() {\n        if (this.searchString === '') {\n            return null;\n        }\n        // Try to create a RegExp out of the params\n        let multiline;\n        if (this.isRegex) {\n            multiline = isMultilineRegexSource(this.searchString);\n        }\n        else {\n            multiline = (this.searchString.indexOf('\\n') >= 0);\n        }\n        let regex = null;\n        try {\n            regex = createRegExp(this.searchString, this.isRegex, {\n                matchCase: this.matchCase,\n                wholeWord: false,\n                multiline: multiline,\n                global: true,\n                unicode: true\n            });\n        }\n        catch (err) {\n            return null;\n        }\n        if (!regex) {\n            return null;\n        }\n        let canUseSimpleSearch = (!this.isRegex && !multiline);\n        if (canUseSimpleSearch && this.searchString.toLowerCase() !== this.searchString.toUpperCase()) {\n            // casing might make a difference\n            canUseSimpleSearch = this.matchCase;\n        }\n        return new SearchData(regex, this.wordSeparators ? getMapForWordSeparators(this.wordSeparators, []) : null, canUseSimpleSearch ? this.searchString : null);\n    }\n}\nfunction isMultilineRegexSource(searchString) {\n    if (!searchString || searchString.length === 0) {\n        return false;\n    }\n    for (let i = 0, len = searchString.length; i < len; i++) {\n        const chCode = searchString.charCodeAt(i);\n        if (chCode === 10 /* CharCode.LineFeed */) {\n            return true;\n        }\n        if (chCode === 92 /* CharCode.Backslash */) {\n            // move to next char\n            i++;\n            if (i >= len) {\n                // string ends with a \\\n                break;\n            }\n            const nextChCode = searchString.charCodeAt(i);\n            if (nextChCode === 110 /* CharCode.n */ || nextChCode === 114 /* CharCode.r */ || nextChCode === 87 /* CharCode.W */) {\n                return true;\n            }\n        }\n    }\n    return false;\n}\nfunction createFindMatch(range, rawMatches, captureMatches) {\n    if (!captureMatches) {\n        return new FindMatch(range, null);\n    }\n    const matches = [];\n    for (let i = 0, len = rawMatches.length; i < len; i++) {\n        matches[i] = rawMatches[i];\n    }\n    return new FindMatch(range, matches);\n}\nclass LineFeedCounter {\n    constructor(text) {\n        const lineFeedsOffsets = [];\n        let lineFeedsOffsetsLen = 0;\n        for (let i = 0, textLen = text.length; i < textLen; i++) {\n            if (text.charCodeAt(i) === 10 /* CharCode.LineFeed */) {\n                lineFeedsOffsets[lineFeedsOffsetsLen++] = i;\n            }\n        }\n        this._lineFeedsOffsets = lineFeedsOffsets;\n    }\n    findLineFeedCountBeforeOffset(offset) {\n        const lineFeedsOffsets = this._lineFeedsOffsets;\n        let min = 0;\n        let max = lineFeedsOffsets.length - 1;\n        if (max === -1) {\n            // no line feeds\n            return 0;\n        }\n        if (offset <= lineFeedsOffsets[0]) {\n            // before first line feed\n            return 0;\n        }\n        while (min < max) {\n            const mid = min + ((max - min) / 2 >> 0);\n            if (lineFeedsOffsets[mid] >= offset) {\n                max = mid - 1;\n            }\n            else {\n                if (lineFeedsOffsets[mid + 1] >= offset) {\n                    // bingo!\n                    min = mid;\n                    max = mid;\n                }\n                else {\n                    min = mid + 1;\n                }\n            }\n        }\n        return min + 1;\n    }\n}\nclass TextModelSearch {\n    static findMatches(model, searchParams, searchRange, captureMatches, limitResultCount) {\n        const searchData = searchParams.parseSearchRequest();\n        if (!searchData) {\n            return [];\n        }\n        if (searchData.regex.multiline) {\n            return this._doFindMatchesMultiline(model, searchRange, new Searcher(searchData.wordSeparators, searchData.regex), captureMatches, limitResultCount);\n        }\n        return this._doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount);\n    }\n    /**\n     * Multiline search always executes on the lines concatenated with \\n.\n     * We must therefore compensate for the count of \\n in case the model is CRLF\n     */\n    static _getMultilineMatchRange(model, deltaOffset, text, lfCounter, matchIndex, match0) {\n        let startOffset;\n        let lineFeedCountBeforeMatch = 0;\n        if (lfCounter) {\n            lineFeedCountBeforeMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex);\n            startOffset = deltaOffset + matchIndex + lineFeedCountBeforeMatch /* add as many \\r as there were \\n */;\n        }\n        else {\n            startOffset = deltaOffset + matchIndex;\n        }\n        let endOffset;\n        if (lfCounter) {\n            const lineFeedCountBeforeEndOfMatch = lfCounter.findLineFeedCountBeforeOffset(matchIndex + match0.length);\n            const lineFeedCountInMatch = lineFeedCountBeforeEndOfMatch - lineFeedCountBeforeMatch;\n            endOffset = startOffset + match0.length + lineFeedCountInMatch /* add as many \\r as there were \\n */;\n        }\n        else {\n            endOffset = startOffset + match0.length;\n        }\n        const startPosition = model.getPositionAt(startOffset);\n        const endPosition = model.getPositionAt(endOffset);\n        return new Range(startPosition.lineNumber, startPosition.column, endPosition.lineNumber, endPosition.column);\n    }\n    static _doFindMatchesMultiline(model, searchRange, searcher, captureMatches, limitResultCount) {\n        const deltaOffset = model.getOffsetAt(searchRange.getStartPosition());\n        // We always execute multiline search over the lines joined with \\n\n        // This makes it that \\n will match the EOL for both CRLF and LF models\n        // We compensate for offset errors in `_getMultilineMatchRange`\n        const text = model.getValueInRange(searchRange, 1 /* EndOfLinePreference.LF */);\n        const lfCounter = (model.getEOL() === '\\r\\n' ? new LineFeedCounter(text) : null);\n        const result = [];\n        let counter = 0;\n        let m;\n        searcher.reset(0);\n        while ((m = searcher.next(text))) {\n            result[counter++] = createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);\n            if (counter >= limitResultCount) {\n                return result;\n            }\n        }\n        return result;\n    }\n    static _doFindMatchesLineByLine(model, searchRange, searchData, captureMatches, limitResultCount) {\n        const result = [];\n        let resultLen = 0;\n        // Early case for a search range that starts & stops on the same line number\n        if (searchRange.startLineNumber === searchRange.endLineNumber) {\n            const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1, searchRange.endColumn - 1);\n            resultLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resultLen, result, captureMatches, limitResultCount);\n            return result;\n        }\n        // Collect results from first line\n        const text = model.getLineContent(searchRange.startLineNumber).substring(searchRange.startColumn - 1);\n        resultLen = this._findMatchesInLine(searchData, text, searchRange.startLineNumber, searchRange.startColumn - 1, resultLen, result, captureMatches, limitResultCount);\n        // Collect results from middle lines\n        for (let lineNumber = searchRange.startLineNumber + 1; lineNumber < searchRange.endLineNumber && resultLen < limitResultCount; lineNumber++) {\n            resultLen = this._findMatchesInLine(searchData, model.getLineContent(lineNumber), lineNumber, 0, resultLen, result, captureMatches, limitResultCount);\n        }\n        // Collect results from last line\n        if (resultLen < limitResultCount) {\n            const text = model.getLineContent(searchRange.endLineNumber).substring(0, searchRange.endColumn - 1);\n            resultLen = this._findMatchesInLine(searchData, text, searchRange.endLineNumber, 0, resultLen, result, captureMatches, limitResultCount);\n        }\n        return result;\n    }\n    static _findMatchesInLine(searchData, text, lineNumber, deltaOffset, resultLen, result, captureMatches, limitResultCount) {\n        const wordSeparators = searchData.wordSeparators;\n        if (!captureMatches && searchData.simpleSearch) {\n            const searchString = searchData.simpleSearch;\n            const searchStringLen = searchString.length;\n            const textLength = text.length;\n            let lastMatchIndex = -searchStringLen;\n            while ((lastMatchIndex = text.indexOf(searchString, lastMatchIndex + searchStringLen)) !== -1) {\n                if (!wordSeparators || isValidMatch(wordSeparators, text, textLength, lastMatchIndex, searchStringLen)) {\n                    result[resultLen++] = new FindMatch(new Range(lineNumber, lastMatchIndex + 1 + deltaOffset, lineNumber, lastMatchIndex + 1 + searchStringLen + deltaOffset), null);\n                    if (resultLen >= limitResultCount) {\n                        return resultLen;\n                    }\n                }\n            }\n            return resultLen;\n        }\n        const searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n        let m;\n        // Reset regex to search from the beginning\n        searcher.reset(0);\n        do {\n            m = searcher.next(text);\n            if (m) {\n                result[resultLen++] = createFindMatch(new Range(lineNumber, m.index + 1 + deltaOffset, lineNumber, m.index + 1 + m[0].length + deltaOffset), m, captureMatches);\n                if (resultLen >= limitResultCount) {\n                    return resultLen;\n                }\n            }\n        } while (m);\n        return resultLen;\n    }\n    static findNextMatch(model, searchParams, searchStart, captureMatches) {\n        const searchData = searchParams.parseSearchRequest();\n        if (!searchData) {\n            return null;\n        }\n        const searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n        if (searchData.regex.multiline) {\n            return this._doFindNextMatchMultiline(model, searchStart, searcher, captureMatches);\n        }\n        return this._doFindNextMatchLineByLine(model, searchStart, searcher, captureMatches);\n    }\n    static _doFindNextMatchMultiline(model, searchStart, searcher, captureMatches) {\n        const searchTextStart = new Position(searchStart.lineNumber, 1);\n        const deltaOffset = model.getOffsetAt(searchTextStart);\n        const lineCount = model.getLineCount();\n        // We always execute multiline search over the lines joined with \\n\n        // This makes it that \\n will match the EOL for both CRLF and LF models\n        // We compensate for offset errors in `_getMultilineMatchRange`\n        const text = model.getValueInRange(new Range(searchTextStart.lineNumber, searchTextStart.column, lineCount, model.getLineMaxColumn(lineCount)), 1 /* EndOfLinePreference.LF */);\n        const lfCounter = (model.getEOL() === '\\r\\n' ? new LineFeedCounter(text) : null);\n        searcher.reset(searchStart.column - 1);\n        const m = searcher.next(text);\n        if (m) {\n            return createFindMatch(this._getMultilineMatchRange(model, deltaOffset, text, lfCounter, m.index, m[0]), m, captureMatches);\n        }\n        if (searchStart.lineNumber !== 1 || searchStart.column !== 1) {\n            // Try again from the top\n            return this._doFindNextMatchMultiline(model, new Position(1, 1), searcher, captureMatches);\n        }\n        return null;\n    }\n    static _doFindNextMatchLineByLine(model, searchStart, searcher, captureMatches) {\n        const lineCount = model.getLineCount();\n        const startLineNumber = searchStart.lineNumber;\n        // Look in first line\n        const text = model.getLineContent(startLineNumber);\n        const r = this._findFirstMatchInLine(searcher, text, startLineNumber, searchStart.column, captureMatches);\n        if (r) {\n            return r;\n        }\n        for (let i = 1; i <= lineCount; i++) {\n            const lineIndex = (startLineNumber + i - 1) % lineCount;\n            const text = model.getLineContent(lineIndex + 1);\n            const r = this._findFirstMatchInLine(searcher, text, lineIndex + 1, 1, captureMatches);\n            if (r) {\n                return r;\n            }\n        }\n        return null;\n    }\n    static _findFirstMatchInLine(searcher, text, lineNumber, fromColumn, captureMatches) {\n        // Set regex to search from column\n        searcher.reset(fromColumn - 1);\n        const m = searcher.next(text);\n        if (m) {\n            return createFindMatch(new Range(lineNumber, m.index + 1, lineNumber, m.index + 1 + m[0].length), m, captureMatches);\n        }\n        return null;\n    }\n    static findPreviousMatch(model, searchParams, searchStart, captureMatches) {\n        const searchData = searchParams.parseSearchRequest();\n        if (!searchData) {\n            return null;\n        }\n        const searcher = new Searcher(searchData.wordSeparators, searchData.regex);\n        if (searchData.regex.multiline) {\n            return this._doFindPreviousMatchMultiline(model, searchStart, searcher, captureMatches);\n        }\n        return this._doFindPreviousMatchLineByLine(model, searchStart, searcher, captureMatches);\n    }\n    static _doFindPreviousMatchMultiline(model, searchStart, searcher, captureMatches) {\n        const matches = this._doFindMatchesMultiline(model, new Range(1, 1, searchStart.lineNumber, searchStart.column), searcher, captureMatches, 10 * LIMIT_FIND_COUNT);\n        if (matches.length > 0) {\n            return matches[matches.length - 1];\n        }\n        const lineCount = model.getLineCount();\n        if (searchStart.lineNumber !== lineCount || searchStart.column !== model.getLineMaxColumn(lineCount)) {\n            // Try again with all content\n            return this._doFindPreviousMatchMultiline(model, new Position(lineCount, model.getLineMaxColumn(lineCount)), searcher, captureMatches);\n        }\n        return null;\n    }\n    static _doFindPreviousMatchLineByLine(model, searchStart, searcher, captureMatches) {\n        const lineCount = model.getLineCount();\n        const startLineNumber = searchStart.lineNumber;\n        // Look in first line\n        const text = model.getLineContent(startLineNumber).substring(0, searchStart.column - 1);\n        const r = this._findLastMatchInLine(searcher, text, startLineNumber, captureMatches);\n        if (r) {\n            return r;\n        }\n        for (let i = 1; i <= lineCount; i++) {\n            const lineIndex = (lineCount + startLineNumber - i - 1) % lineCount;\n            const text = model.getLineContent(lineIndex + 1);\n            const r = this._findLastMatchInLine(searcher, text, lineIndex + 1, captureMatches);\n            if (r) {\n                return r;\n            }\n        }\n        return null;\n    }\n    static _findLastMatchInLine(searcher, text, lineNumber, captureMatches) {\n        let bestResult = null;\n        let m;\n        searcher.reset(0);\n        while ((m = searcher.next(text))) {\n            bestResult = createFindMatch(new Range(lineNumber, m.index + 1, lineNumber, m.index + 1 + m[0].length), m, captureMatches);\n        }\n        return bestResult;\n    }\n}\nfunction leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n    if (matchStartIndex === 0) {\n        // Match starts at start of string\n        return true;\n    }\n    const charBefore = text.charCodeAt(matchStartIndex - 1);\n    if (wordSeparators.get(charBefore) !== 0 /* WordCharacterClass.Regular */) {\n        // The character before the match is a word separator\n        return true;\n    }\n    if (charBefore === 13 /* CharCode.CarriageReturn */ || charBefore === 10 /* CharCode.LineFeed */) {\n        // The character before the match is line break or carriage return.\n        return true;\n    }\n    if (matchLength > 0) {\n        const firstCharInMatch = text.charCodeAt(matchStartIndex);\n        if (wordSeparators.get(firstCharInMatch) !== 0 /* WordCharacterClass.Regular */) {\n            // The first character inside the match is a word separator\n            return true;\n        }\n    }\n    return false;\n}\nfunction rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n    if (matchStartIndex + matchLength === textLength) {\n        // Match ends at end of string\n        return true;\n    }\n    const charAfter = text.charCodeAt(matchStartIndex + matchLength);\n    if (wordSeparators.get(charAfter) !== 0 /* WordCharacterClass.Regular */) {\n        // The character after the match is a word separator\n        return true;\n    }\n    if (charAfter === 13 /* CharCode.CarriageReturn */ || charAfter === 10 /* CharCode.LineFeed */) {\n        // The character after the match is line break or carriage return.\n        return true;\n    }\n    if (matchLength > 0) {\n        const lastCharInMatch = text.charCodeAt(matchStartIndex + matchLength - 1);\n        if (wordSeparators.get(lastCharInMatch) !== 0 /* WordCharacterClass.Regular */) {\n            // The last character in the match is a word separator\n            return true;\n        }\n    }\n    return false;\n}\nfunction isValidMatch(wordSeparators, text, textLength, matchStartIndex, matchLength) {\n    return (leftIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength)\n        && rightIsWordBounday(wordSeparators, text, textLength, matchStartIndex, matchLength));\n}\nclass Searcher {\n    constructor(wordSeparators, searchRegex) {\n        this._wordSeparators = wordSeparators;\n        this._searchRegex = searchRegex;\n        this._prevMatchStartIndex = -1;\n        this._prevMatchLength = 0;\n    }\n    reset(lastIndex) {\n        this._searchRegex.lastIndex = lastIndex;\n        this._prevMatchStartIndex = -1;\n        this._prevMatchLength = 0;\n    }\n    next(text) {\n        const textLength = text.length;\n        let m;\n        do {\n            if (this._prevMatchStartIndex + this._prevMatchLength === textLength) {\n                // Reached the end of the line\n                return null;\n            }\n            m = this._searchRegex.exec(text);\n            if (!m) {\n                return null;\n            }\n            const matchStartIndex = m.index;\n            const matchLength = m[0].length;\n            if (matchStartIndex === this._prevMatchStartIndex && matchLength === this._prevMatchLength) {\n                if (matchLength === 0) {\n                    // the search result is an empty string and won't advance `regex.lastIndex`, so `regex.exec` will stuck here\n                    // we attempt to recover from that by advancing by two if surrogate pair found and by one otherwise\n                    if (getNextCodePoint(text, textLength, this._searchRegex.lastIndex) > 0xFFFF) {\n                        this._searchRegex.lastIndex += 2;\n                    }\n                    else {\n                        this._searchRegex.lastIndex += 1;\n                    }\n                    continue;\n                }\n                // Exit early if the regex matches the same range twice\n                return null;\n            }\n            this._prevMatchStartIndex = matchStartIndex;\n            this._prevMatchLength = matchLength;\n            if (!this._wordSeparators || isValidMatch(this._wordSeparators, text, textLength, matchStartIndex, matchLength)) {\n                return m;\n            }\n        } while (m);\n        return null;\n    }\n}\n\nexport { SearchParams, Searcher, TextModelSearch, createFindMatch, isMultilineRegexSource, isValidMatch };\n","import { Iterable } from '../../../base/common/iterator.js';\nimport { LinkedList } from '../../../base/common/linkedList.js';\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 *--------------------------------------------------------------------------------------------*/\nconst USUAL_WORD_SEPARATORS = '`~!@#$%^&*()-=+[{]}\\\\|;:\\'\",.<>/?';\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 = '') {\n    let source = '(-?\\\\d*\\\\.\\\\d\\\\w*)|([^';\n    for (const sep of USUAL_WORD_SEPARATORS) {\n        if (allowInWords.indexOf(sep) >= 0) {\n            continue;\n        }\n        source += '\\\\' + sep;\n    }\n    source += '\\\\s]+)';\n    return new RegExp(source, 'g');\n}\n// catches numbers (including floating numbers) in the first group, and alphanum in the second\nconst DEFAULT_WORD_REGEXP = createWordRegExp();\nfunction ensureValidWordDefinition(wordDefinition) {\n    let result = DEFAULT_WORD_REGEXP;\n    if (wordDefinition && (wordDefinition instanceof RegExp)) {\n        if (!wordDefinition.global) {\n            let flags = 'g';\n            if (wordDefinition.ignoreCase) {\n                flags += 'i';\n            }\n            if (wordDefinition.multiline) {\n                flags += 'm';\n            }\n            if (wordDefinition.unicode) {\n                flags += 'u';\n            }\n            result = new RegExp(wordDefinition.source, flags);\n        }\n        else {\n            result = wordDefinition;\n        }\n    }\n    result.lastIndex = 0;\n    return result;\n}\nconst _defaultConfig = new LinkedList();\n_defaultConfig.unshift({\n    maxLen: 1000,\n    windowSize: 15,\n    timeBudget: 150\n});\nfunction getWordAtText(column, wordDefinition, text, textOffset, config) {\n    // Ensure the regex has the 'g' flag, otherwise this will loop forever\n    wordDefinition = ensureValidWordDefinition(wordDefinition);\n    if (!config) {\n        config = Iterable.first(_defaultConfig);\n    }\n    if (text.length > config.maxLen) {\n        // don't throw strings that long at the regexp\n        // but use a sub-string in which a word must occur\n        let start = column - config.maxLen / 2;\n        if (start < 0) {\n            start = 0;\n        }\n        else {\n            textOffset += start;\n        }\n        text = text.substring(start, column + config.maxLen / 2);\n        return getWordAtText(column, wordDefinition, text, textOffset, config);\n    }\n    const t1 = Date.now();\n    const pos = column - 1 - textOffset;\n    let prevRegexIndex = -1;\n    let match = null;\n    for (let i = 1;; i++) {\n        // check time budget\n        if (Date.now() - t1 >= config.timeBudget) {\n            break;\n        }\n        // reset the index at which the regexp should start matching, also know where it\n        // should stop so that subsequent search don't repeat previous searches\n        const regexIndex = pos - config.windowSize * i;\n        wordDefinition.lastIndex = Math.max(0, regexIndex);\n        const thisMatch = _findRegexMatchEnclosingPosition(wordDefinition, text, pos, prevRegexIndex);\n        if (!thisMatch && match) {\n            // stop: we have something\n            break;\n        }\n        match = thisMatch;\n        // stop: searched at start\n        if (regexIndex <= 0) {\n            break;\n        }\n        prevRegexIndex = regexIndex;\n    }\n    if (match) {\n        const result = {\n            word: match[0],\n            startColumn: textOffset + 1 + match.index,\n            endColumn: textOffset + 1 + match.index + match[0].length\n        };\n        wordDefinition.lastIndex = 0;\n        return result;\n    }\n    return null;\n}\nfunction _findRegexMatchEnclosingPosition(wordDefinition, text, pos, stopPos) {\n    let match;\n    while (match = wordDefinition.exec(text)) {\n        const matchIndex = match.index || 0;\n        if (matchIndex <= pos && wordDefinition.lastIndex >= pos) {\n            return match;\n        }\n        else if (stopPos > 0 && matchIndex > stopPos) {\n            return null;\n        }\n    }\n    return null;\n}\n\nexport { DEFAULT_WORD_REGEXP, USUAL_WORD_SEPARATORS, ensureValidWordDefinition, getWordAtText };\n","import { Range } from '../core/range.js';\nimport { Searcher } from '../model/textModelSearch.js';\nimport { isHighSurrogate, AmbiguousCharacters, InvisibleCharacters, escapeRegExpCharacters, isBasicASCII } from '../../../base/common/strings.js';\nimport { assertNever } from '../../../base/common/assert.js';\nimport { getWordAtText, DEFAULT_WORD_REGEXP } from '../core/wordHelper.js';\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 *--------------------------------------------------------------------------------------------*/\nclass UnicodeTextModelHighlighter {\n    static computeUnicodeHighlights(model, options, range) {\n        const startLine = range ? range.startLineNumber : 1;\n        const endLine = range ? range.endLineNumber : model.getLineCount();\n        const codePointHighlighter = new CodePointHighlighter(options);\n        const candidates = codePointHighlighter.getCandidateCodePoints();\n        let regex;\n        if (candidates === 'allNonBasicAscii') {\n            regex = new RegExp('[^\\\\t\\\\n\\\\r\\\\x20-\\\\x7E]', 'g');\n        }\n        else {\n            regex = new RegExp(`${buildRegExpCharClassExpr(Array.from(candidates))}`, 'g');\n        }\n        const searcher = new Searcher(null, regex);\n        const ranges = [];\n        let hasMore = false;\n        let m;\n        let ambiguousCharacterCount = 0;\n        let invisibleCharacterCount = 0;\n        let nonBasicAsciiCharacterCount = 0;\n        forLoop: for (let lineNumber = startLine, lineCount = endLine; lineNumber <= lineCount; lineNumber++) {\n            const lineContent = model.getLineContent(lineNumber);\n            const lineLength = lineContent.length;\n            // Reset regex to search from the beginning\n            searcher.reset(0);\n            do {\n                m = searcher.next(lineContent);\n                if (m) {\n                    let startIndex = m.index;\n                    let endIndex = m.index + m[0].length;\n                    // Extend range to entire code point\n                    if (startIndex > 0) {\n                        const charCodeBefore = lineContent.charCodeAt(startIndex - 1);\n                        if (isHighSurrogate(charCodeBefore)) {\n                            startIndex--;\n                        }\n                    }\n                    if (endIndex + 1 < lineLength) {\n                        const charCodeBefore = lineContent.charCodeAt(endIndex - 1);\n                        if (isHighSurrogate(charCodeBefore)) {\n                            endIndex++;\n                        }\n                    }\n                    const str = lineContent.substring(startIndex, endIndex);\n                    let word = getWordAtText(startIndex + 1, DEFAULT_WORD_REGEXP, lineContent, 0);\n                    if (word && word.endColumn <= startIndex + 1) {\n                        // The word does not include the problematic character, ignore the word\n                        word = null;\n                    }\n                    const highlightReason = codePointHighlighter.shouldHighlightNonBasicASCII(str, word ? word.word : null);\n                    if (highlightReason !== 0 /* SimpleHighlightReason.None */) {\n                        if (highlightReason === 3 /* SimpleHighlightReason.Ambiguous */) {\n                            ambiguousCharacterCount++;\n                        }\n                        else if (highlightReason === 2 /* SimpleHighlightReason.Invisible */) {\n                            invisibleCharacterCount++;\n                        }\n                        else if (highlightReason === 1 /* SimpleHighlightReason.NonBasicASCII */) {\n                            nonBasicAsciiCharacterCount++;\n                        }\n                        else {\n                            assertNever();\n                        }\n                        const MAX_RESULT_LENGTH = 1000;\n                        if (ranges.length >= MAX_RESULT_LENGTH) {\n                            hasMore = true;\n                            break forLoop;\n                        }\n                        ranges.push(new Range(lineNumber, startIndex + 1, lineNumber, endIndex + 1));\n                    }\n                }\n            } while (m);\n        }\n        return {\n            ranges,\n            hasMore,\n            ambiguousCharacterCount,\n            invisibleCharacterCount,\n            nonBasicAsciiCharacterCount\n        };\n    }\n    static computeUnicodeHighlightReason(char, options) {\n        const codePointHighlighter = new CodePointHighlighter(options);\n        const reason = codePointHighlighter.shouldHighlightNonBasicASCII(char, null);\n        switch (reason) {\n            case 0 /* SimpleHighlightReason.None */:\n                return null;\n            case 2 /* SimpleHighlightReason.Invisible */:\n                return { kind: 1 /* UnicodeHighlighterReasonKind.Invisible */ };\n            case 3 /* SimpleHighlightReason.Ambiguous */: {\n                const codePoint = char.codePointAt(0);\n                const primaryConfusable = codePointHighlighter.ambiguousCharacters.getPrimaryConfusable(codePoint);\n                const notAmbiguousInLocales = AmbiguousCharacters.getLocales().filter((l) => !AmbiguousCharacters.getInstance(new Set([...options.allowedLocales, l])).isAmbiguous(codePoint));\n                return { kind: 0 /* UnicodeHighlighterReasonKind.Ambiguous */, confusableWith: String.fromCodePoint(primaryConfusable), notAmbiguousInLocales };\n            }\n            case 1 /* SimpleHighlightReason.NonBasicASCII */:\n                return { kind: 2 /* UnicodeHighlighterReasonKind.NonBasicAscii */ };\n        }\n    }\n}\nfunction buildRegExpCharClassExpr(codePoints, flags) {\n    const src = `[${escapeRegExpCharacters(codePoints.map((i) => String.fromCodePoint(i)).join(''))}]`;\n    return src;\n}\nclass CodePointHighlighter {\n    constructor(options) {\n        this.options = options;\n        this.allowedCodePoints = new Set(options.allowedCodePoints);\n        this.ambiguousCharacters = AmbiguousCharacters.getInstance(new Set(options.allowedLocales));\n    }\n    getCandidateCodePoints() {\n        if (this.options.nonBasicASCII) {\n            return 'allNonBasicAscii';\n        }\n        const set = new Set();\n        if (this.options.invisibleCharacters) {\n            for (const cp of InvisibleCharacters.codePoints) {\n                if (!isAllowedInvisibleCharacter(String.fromCodePoint(cp))) {\n                    set.add(cp);\n                }\n            }\n        }\n        if (this.options.ambiguousCharacters) {\n            for (const cp of this.ambiguousCharacters.getConfusableCodePoints()) {\n                set.add(cp);\n            }\n        }\n        for (const cp of this.allowedCodePoints) {\n            set.delete(cp);\n        }\n        return set;\n    }\n    shouldHighlightNonBasicASCII(character, wordContext) {\n        const codePoint = character.codePointAt(0);\n        if (this.allowedCodePoints.has(codePoint)) {\n            return 0 /* SimpleHighlightReason.None */;\n        }\n        if (this.options.nonBasicASCII) {\n            return 1 /* SimpleHighlightReason.NonBasicASCII */;\n        }\n        let hasBasicASCIICharacters = false;\n        let hasNonConfusableNonBasicAsciiCharacter = false;\n        if (wordContext) {\n            for (const char of wordContext) {\n                const codePoint = char.codePointAt(0);\n                const isBasicASCII$1 = isBasicASCII(char);\n                hasBasicASCIICharacters = hasBasicASCIICharacters || isBasicASCII$1;\n                if (!isBasicASCII$1 &&\n                    !this.ambiguousCharacters.isAmbiguous(codePoint) &&\n                    !InvisibleCharacters.isInvisibleCharacter(codePoint)) {\n                    hasNonConfusableNonBasicAsciiCharacter = true;\n                }\n            }\n        }\n        if (\n        /* Don't allow mixing weird looking characters with ASCII */ !hasBasicASCIICharacters &&\n            /* Is there an obviously weird looking character? */ hasNonConfusableNonBasicAsciiCharacter) {\n            return 0 /* SimpleHighlightReason.None */;\n        }\n        if (this.options.invisibleCharacters) {\n            // TODO check for emojis\n            if (!isAllowedInvisibleCharacter(character) && InvisibleCharacters.isInvisibleCharacter(codePoint)) {\n                return 2 /* SimpleHighlightReason.Invisible */;\n            }\n        }\n        if (this.options.ambiguousCharacters) {\n            if (this.ambiguousCharacters.isAmbiguous(codePoint)) {\n                return 3 /* SimpleHighlightReason.Ambiguous */;\n            }\n        }\n        return 0 /* SimpleHighlightReason.None */;\n    }\n}\nfunction isAllowedInvisibleCharacter(character) {\n    return character === ' ' || character === '\\n' || character === '\\t';\n}\n\nexport { UnicodeTextModelHighlighter };\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 *--------------------------------------------------------------------------------------------*/\nclass LinesDiff {\n    constructor(changes, \n    /**\n     * Sorted by original line ranges.\n     * The original line ranges and the modified line ranges must be disjoint (but can be touching).\n     */\n    moves, \n    /**\n     * Indicates if the time out was reached.\n     * In that case, the diffs might be an approximation and the user should be asked to rerun the diff with more time.\n     */\n    hitTimeout) {\n        this.changes = changes;\n        this.moves = moves;\n        this.hitTimeout = hitTimeout;\n    }\n}\nclass MovedText {\n    constructor(lineRangeMapping, changes) {\n        this.lineRangeMapping = lineRangeMapping;\n        this.changes = changes;\n    }\n}\n\nexport { LinesDiff, MovedText };\n","/**\n * Returns the last entry and the initial N-1 entries of the array, as a tuple of [rest, last].\n *\n * The array must have at least one element.\n *\n * @param arr The input array\n * @returns A tuple of [rest, last] where rest is all but the last element and last is the last element\n * @throws Error if the array is empty\n */\nfunction tail(arr) {\n    if (arr.length === 0) {\n        throw new Error('Invalid tail call');\n    }\n    return [arr.slice(0, arr.length - 1), arr[arr.length - 1]];\n}\nfunction equals(one, other, itemEquals = (a, b) => a === b) {\n    if (one === other) {\n        return true;\n    }\n    if (!one || !other) {\n        return false;\n    }\n    if (one.length !== other.length) {\n        return false;\n    }\n    for (let i = 0, len = one.length; i < len; i++) {\n        if (!itemEquals(one[i], other[i])) {\n            return false;\n        }\n    }\n    return true;\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 */\nfunction removeFastWithoutKeepingOrder(array, index) {\n    const last = array.length - 1;\n    if (index < last) {\n        array[index] = array[last];\n    }\n    array.pop();\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 */\nfunction binarySearch(array, key, comparator) {\n    return binarySearch2(array.length, i => comparator(array[i], key));\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 */\nfunction binarySearch2(length, compareToKey) {\n    let low = 0, high = length - 1;\n    while (low <= high) {\n        const mid = ((low + high) / 2) | 0;\n        const comp = compareToKey(mid);\n        if (comp < 0) {\n            low = mid + 1;\n        }\n        else if (comp > 0) {\n            high = mid - 1;\n        }\n        else {\n            return mid;\n        }\n    }\n    return -(low + 1);\n}\nfunction quickSelect(nth, data, compare) {\n    nth = nth | 0;\n    if (nth >= data.length) {\n        throw new TypeError('invalid index');\n    }\n    const pivotValue = data[Math.floor(data.length * Math.random())];\n    const lower = [];\n    const higher = [];\n    const pivots = [];\n    for (const value of data) {\n        const val = compare(value, pivotValue);\n        if (val < 0) {\n            lower.push(value);\n        }\n        else if (val > 0) {\n            higher.push(value);\n        }\n        else {\n            pivots.push(value);\n        }\n    }\n    if (nth < lower.length) {\n        return quickSelect(nth, lower, compare);\n    }\n    else if (nth < lower.length + pivots.length) {\n        return pivots[0];\n    }\n    else {\n        return quickSelect(nth - (lower.length + pivots.length), higher, compare);\n    }\n}\nfunction groupBy(data, compare) {\n    const result = [];\n    let currentGroup = undefined;\n    for (const element of data.slice(0).sort(compare)) {\n        if (!currentGroup || compare(currentGroup[0], element) !== 0) {\n            currentGroup = [element];\n            result.push(currentGroup);\n        }\n        else {\n            currentGroup.push(element);\n        }\n    }\n    return result;\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 */\nfunction* groupAdjacentBy(items, shouldBeGrouped) {\n    let currentGroup;\n    let last;\n    for (const item of items) {\n        if (last !== undefined && shouldBeGrouped(last, item)) {\n            currentGroup.push(item);\n        }\n        else {\n            if (currentGroup) {\n                yield currentGroup;\n            }\n            currentGroup = [item];\n        }\n        last = item;\n    }\n    if (currentGroup) {\n        yield currentGroup;\n    }\n}\nfunction forEachAdjacent(arr, f) {\n    for (let i = 0; i <= arr.length; i++) {\n        f(i === 0 ? undefined : arr[i - 1], i === arr.length ? undefined : arr[i]);\n    }\n}\nfunction forEachWithNeighbors(arr, f) {\n    for (let i = 0; i < arr.length; i++) {\n        f(i === 0 ? undefined : arr[i - 1], arr[i], i + 1 === arr.length ? undefined : arr[i + 1]);\n    }\n}\n/**\n * @returns New array with all falsy values removed. The original array IS NOT modified.\n */\nfunction coalesce(array) {\n    return array.filter((e) => !!e);\n}\n/**\n * Remove all falsy values from `array`. The original array IS modified.\n */\nfunction coalesceInPlace(array) {\n    let to = 0;\n    for (let i = 0; i < array.length; i++) {\n        if (!!array[i]) {\n            array[to] = array[i];\n            to += 1;\n        }\n    }\n    array.length = to;\n}\n/**\n * @returns false if the provided object is an array and not empty.\n */\nfunction isFalsyOrEmpty(obj) {\n    return !Array.isArray(obj) || obj.length === 0;\n}\nfunction isNonEmptyArray(obj) {\n    return Array.isArray(obj) && obj.length > 0;\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 */\nfunction distinct(array, keyFn = value => value) {\n    const seen = new Set();\n    return array.filter(element => {\n        const key = keyFn(element);\n        if (seen.has(key)) {\n            return false;\n        }\n        seen.add(key);\n        return true;\n    });\n}\nfunction range(arg, to) {\n    let from = typeof to === 'number' ? arg : 0;\n    if (typeof to === 'number') {\n        from = arg;\n    }\n    else {\n        from = 0;\n        to = arg;\n    }\n    const result = [];\n    if (from <= to) {\n        for (let i = from; i < to; i++) {\n            result.push(i);\n        }\n    }\n    else {\n        for (let i = from; i > to; i--) {\n            result.push(i);\n        }\n    }\n    return result;\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 */\nfunction arrayInsert(target, insertIndex, insertArr) {\n    const before = target.slice(0, insertIndex);\n    const after = target.slice(insertIndex);\n    return before.concat(insertArr, after);\n}\n/**\n * Pushes an element to the start of the array, if found.\n */\nfunction pushToStart(arr, value) {\n    const index = arr.indexOf(value);\n    if (index > -1) {\n        arr.splice(index, 1);\n        arr.unshift(value);\n    }\n}\n/**\n * Pushes an element to the end of the array, if found.\n */\nfunction pushToEnd(arr, value) {\n    const index = arr.indexOf(value);\n    if (index > -1) {\n        arr.splice(index, 1);\n        arr.push(value);\n    }\n}\nfunction pushMany(arr, items) {\n    for (const item of items) {\n        arr.push(item);\n    }\n}\nfunction mapFilter(array, fn) {\n    const result = [];\n    for (const item of array) {\n        const mapped = fn(item);\n        if (mapped !== undefined) {\n            result.push(mapped);\n        }\n    }\n    return result;\n}\nfunction asArray(x) {\n    return Array.isArray(x) ? x : [x];\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 */\nfunction insertInto(array, start, newItems) {\n    const startIdx = getActualStartIndex(array, start);\n    const originalLength = array.length;\n    const newItemsLength = newItems.length;\n    array.length = originalLength + newItemsLength;\n    // Move the items after the start index, start from the end so that we don't overwrite any value.\n    for (let i = originalLength - 1; i >= startIdx; i--) {\n        array[i + newItemsLength] = array[i];\n    }\n    for (let i = 0; i < newItemsLength; i++) {\n        array[i + startIdx] = newItems[i];\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 */\nfunction splice(array, start, deleteCount, newItems) {\n    const index = getActualStartIndex(array, start);\n    let result = array.splice(index, deleteCount);\n    if (result === undefined) {\n        // see https://bugs.webkit.org/show_bug.cgi?id=261140\n        result = [];\n    }\n    insertInto(array, index, newItems);\n    return result;\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(array, start) {\n    return start < 0 ? Math.max(start + array.length, 0) : Math.min(start, array.length);\n}\nvar CompareResult;\n(function (CompareResult) {\n    function isLessThan(result) {\n        return result < 0;\n    }\n    CompareResult.isLessThan = isLessThan;\n    function isLessThanOrEqual(result) {\n        return result <= 0;\n    }\n    CompareResult.isLessThanOrEqual = isLessThanOrEqual;\n    function isGreaterThan(result) {\n        return result > 0;\n    }\n    CompareResult.isGreaterThan = isGreaterThan;\n    function isNeitherLessOrGreaterThan(result) {\n        return result === 0;\n    }\n    CompareResult.isNeitherLessOrGreaterThan = isNeitherLessOrGreaterThan;\n    CompareResult.greaterThan = 1;\n    CompareResult.lessThan = -1;\n    CompareResult.neitherLessOrGreaterThan = 0;\n})(CompareResult || (CompareResult = {}));\nfunction compareBy(selector, comparator) {\n    return (a, b) => comparator(selector(a), selector(b));\n}\nfunction tieBreakComparators(...comparators) {\n    return (item1, item2) => {\n        for (const comparator of comparators) {\n            const result = comparator(item1, item2);\n            if (!CompareResult.isNeitherLessOrGreaterThan(result)) {\n                return result;\n            }\n        }\n        return CompareResult.neitherLessOrGreaterThan;\n    };\n}\n/**\n * The natural order on numbers.\n*/\nconst numberComparator = (a, b) => a - b;\nconst booleanComparator = (a, b) => numberComparator(a ? 1 : 0, b ? 1 : 0);\nfunction reverseOrder(comparator) {\n    return (a, b) => -comparator(a, b);\n}\n/**\n * Returns a new comparator that treats `undefined` as the smallest value.\n * All other values are compared using the given comparator.\n*/\nfunction compareUndefinedSmallest(comparator) {\n    return (a, b) => {\n        if (a === undefined) {\n            return b === undefined ? CompareResult.neitherLessOrGreaterThan : CompareResult.lessThan;\n        }\n        else if (b === undefined) {\n            return CompareResult.greaterThan;\n        }\n        return comparator(a, b);\n    };\n}\nclass ArrayQueue {\n    /**\n     * Constructs a queue that is backed by the given array. Runtime is O(1).\n    */\n    constructor(items) {\n        this.firstIdx = 0;\n        this.items = items;\n        this.lastIdx = this.items.length - 1;\n    }\n    get length() {\n        return this.lastIdx - this.firstIdx + 1;\n    }\n    /**\n     * Consumes elements from the beginning of the queue as long as the predicate returns true.\n     * If no elements were consumed, `null` is returned. Has a runtime of O(result.length).\n    */\n    takeWhile(predicate) {\n        // P(k) := k <= this.lastIdx && predicate(this.items[k])\n        // Find s := min { k | k >= this.firstIdx && !P(k) } and return this.data[this.firstIdx...s)\n        let startIdx = this.firstIdx;\n        while (startIdx < this.items.length && predicate(this.items[startIdx])) {\n            startIdx++;\n        }\n        const result = startIdx === this.firstIdx ? null : this.items.slice(this.firstIdx, startIdx);\n        this.firstIdx = startIdx;\n        return result;\n    }\n    /**\n     * Consumes elements from the end of the queue as long as the predicate returns true.\n     * If no elements were consumed, `null` is returned.\n     * The result has the same order as the underlying array!\n    */\n    takeFromEndWhile(predicate) {\n        // P(k) := this.firstIdx >= k && predicate(this.items[k])\n        // Find s := max { k | k <= this.lastIdx && !P(k) } and return this.data(s...this.lastIdx]\n        let endIdx = this.lastIdx;\n        while (endIdx >= 0 && predicate(this.items[endIdx])) {\n            endIdx--;\n        }\n        const result = endIdx === this.lastIdx ? null : this.items.slice(endIdx + 1, this.lastIdx + 1);\n        this.lastIdx = endIdx;\n        return result;\n    }\n    peek() {\n        if (this.length === 0) {\n            return undefined;\n        }\n        return this.items[this.firstIdx];\n    }\n    dequeue() {\n        const result = this.items[this.firstIdx];\n        this.firstIdx++;\n        return result;\n    }\n    takeCount(count) {\n        const result = this.items.slice(this.firstIdx, this.firstIdx + count);\n        this.firstIdx += count;\n        return result;\n    }\n}\n/**\n * This class is faster than an iterator and array for lazy computed data.\n*/\nclass CallbackIterable {\n    static { this.empty = new CallbackIterable(_callback => { }); }\n    constructor(\n    /**\n     * Calls the callback for every item.\n     * Stops when the callback returns false.\n    */\n    iterate) {\n        this.iterate = iterate;\n    }\n    toArray() {\n        const result = [];\n        this.iterate(item => { result.push(item); return true; });\n        return result;\n    }\n    filter(predicate) {\n        return new CallbackIterable(cb => this.iterate(item => predicate(item) ? cb(item) : true));\n    }\n    map(mapFn) {\n        return new CallbackIterable(cb => this.iterate(item => cb(mapFn(item))));\n    }\n    findLast(predicate) {\n        let result;\n        this.iterate(item => {\n            if (predicate(item)) {\n                result = item;\n            }\n            return true;\n        });\n        return result;\n    }\n    findLastMaxBy(comparator) {\n        let result;\n        let first = true;\n        this.iterate(item => {\n            if (first || CompareResult.isGreaterThan(comparator(item, result))) {\n                first = false;\n                result = item;\n            }\n            return true;\n        });\n        return result;\n    }\n}\n/**\n * Represents a re-arrangement of items in an array.\n */\nclass Permutation {\n    constructor(_indexMap) {\n        this._indexMap = _indexMap;\n    }\n    /**\n     * Returns a permutation that sorts the given array according to the given compare function.\n     */\n    static createSortPermutation(arr, compareFn) {\n        const sortIndices = Array.from(arr.keys()).sort((index1, index2) => compareFn(arr[index1], arr[index2]));\n        return new Permutation(sortIndices);\n    }\n    /**\n     * Returns a new array with the elements of the given array re-arranged according to this permutation.\n     */\n    apply(arr) {\n        return arr.map((_, index) => arr[this._indexMap[index]]);\n    }\n    /**\n     * Returns a new permutation that undoes the re-arrangement of this permutation.\n    */\n    inverse() {\n        const inverseIndexMap = this._indexMap.slice();\n        for (let i = 0; i < this._indexMap.length; i++) {\n            inverseIndexMap[this._indexMap[i]] = i;\n        }\n        return new Permutation(inverseIndexMap);\n    }\n}\nfunction sum(array) {\n    return array.reduce((acc, value) => acc + value, 0);\n}\n\nexport { ArrayQueue, CallbackIterable, CompareResult, Permutation, arrayInsert, asArray, binarySearch, binarySearch2, booleanComparator, coalesce, coalesceInPlace, compareBy, compareUndefinedSmallest, distinct, equals, forEachAdjacent, forEachWithNeighbors, groupAdjacentBy, groupBy, insertInto, isFalsyOrEmpty, isNonEmptyArray, mapFilter, numberComparator, pushMany, pushToEnd, pushToStart, quickSelect, range, removeFastWithoutKeepingOrder, reverseOrder, splice, sum, tail, tieBreakComparators };\n","import { BugIndicatingError } from '../../../../base/common/errors.js';\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 * A range of offsets (0-based).\n*/\nclass OffsetRange {\n    static fromTo(start, endExclusive) {\n        return new OffsetRange(start, endExclusive);\n    }\n    static addRange(range, sortedRanges) {\n        let i = 0;\n        while (i < sortedRanges.length && sortedRanges[i].endExclusive < range.start) {\n            i++;\n        }\n        let j = i;\n        while (j < sortedRanges.length && sortedRanges[j].start <= range.endExclusive) {\n            j++;\n        }\n        if (i === j) {\n            sortedRanges.splice(i, 0, range);\n        }\n        else {\n            const start = Math.min(range.start, sortedRanges[i].start);\n            const end = Math.max(range.endExclusive, sortedRanges[j - 1].endExclusive);\n            sortedRanges.splice(i, j - i, new OffsetRange(start, end));\n        }\n    }\n    static tryCreate(start, endExclusive) {\n        if (start > endExclusive) {\n            return undefined;\n        }\n        return new OffsetRange(start, endExclusive);\n    }\n    static ofLength(length) {\n        return new OffsetRange(0, length);\n    }\n    static ofStartAndLength(start, length) {\n        return new OffsetRange(start, start + length);\n    }\n    static emptyAt(offset) {\n        return new OffsetRange(offset, offset);\n    }\n    constructor(start, endExclusive) {\n        this.start = start;\n        this.endExclusive = endExclusive;\n        if (start > endExclusive) {\n            throw new BugIndicatingError(`Invalid range: ${this.toString()}`);\n        }\n    }\n    get isEmpty() {\n        return this.start === this.endExclusive;\n    }\n    delta(offset) {\n        return new OffsetRange(this.start + offset, this.endExclusive + offset);\n    }\n    deltaStart(offset) {\n        return new OffsetRange(this.start + offset, this.endExclusive);\n    }\n    deltaEnd(offset) {\n        return new OffsetRange(this.start, this.endExclusive + offset);\n    }\n    get length() {\n        return this.endExclusive - this.start;\n    }\n    toString() {\n        return `[${this.start}, ${this.endExclusive})`;\n    }\n    equals(other) {\n        return this.start === other.start && this.endExclusive === other.endExclusive;\n    }\n    contains(offset) {\n        return this.start <= offset && offset < this.endExclusive;\n    }\n    /**\n     * for all numbers n: range1.contains(n) or range2.contains(n) => range1.join(range2).contains(n)\n     * The joined range is the smallest range that contains both ranges.\n     */\n    join(other) {\n        return new OffsetRange(Math.min(this.start, other.start), Math.max(this.endExclusive, other.endExclusive));\n    }\n    /**\n     * for all numbers n: range1.contains(n) and range2.contains(n) <=> range1.intersect(range2).contains(n)\n     *\n     * The resulting range is empty if the ranges do not intersect, but touch.\n     * If the ranges don't even touch, the result is undefined.\n     */\n    intersect(other) {\n        const start = Math.max(this.start, other.start);\n        const end = Math.min(this.endExclusive, other.endExclusive);\n        if (start <= end) {\n            return new OffsetRange(start, end);\n        }\n        return undefined;\n    }\n    intersectionLength(range) {\n        const start = Math.max(this.start, range.start);\n        const end = Math.min(this.endExclusive, range.endExclusive);\n        return Math.max(0, end - start);\n    }\n    intersects(other) {\n        const start = Math.max(this.start, other.start);\n        const end = Math.min(this.endExclusive, other.endExclusive);\n        return start < end;\n    }\n    intersectsOrTouches(other) {\n        const start = Math.max(this.start, other.start);\n        const end = Math.min(this.endExclusive, other.endExclusive);\n        return start <= end;\n    }\n    isBefore(other) {\n        return this.endExclusive <= other.start;\n    }\n    isAfter(other) {\n        return this.start >= other.endExclusive;\n    }\n    slice(arr) {\n        return arr.slice(this.start, this.endExclusive);\n    }\n    substring(str) {\n        return str.substring(this.start, this.endExclusive);\n    }\n    /**\n     * Returns the given value if it is contained in this instance, otherwise the closest value that is contained.\n     * The range must not be empty.\n     */\n    clip(value) {\n        if (this.isEmpty) {\n            throw new BugIndicatingError(`Invalid clipping range: ${this.toString()}`);\n        }\n        return Math.max(this.start, Math.min(this.endExclusive - 1, value));\n    }\n    /**\n     * Returns `r := value + k * length` such that `r` is contained in this range.\n     * The range must not be empty.\n     *\n     * E.g. `[5, 10).clipCyclic(10) === 5`, `[5, 10).clipCyclic(11) === 6` and `[5, 10).clipCyclic(4) === 9`.\n     */\n    clipCyclic(value) {\n        if (this.isEmpty) {\n            throw new BugIndicatingError(`Invalid clipping range: ${this.toString()}`);\n        }\n        if (value < this.start) {\n            return this.endExclusive - ((this.start - value) % this.length);\n        }\n        if (value >= this.endExclusive) {\n            return this.start + ((value - this.start) % this.length);\n        }\n        return value;\n    }\n    forEach(f) {\n        for (let i = this.start; i < this.endExclusive; i++) {\n            f(i);\n        }\n    }\n    /**\n     * this: [ 5, 10), range: [10, 15) => [5, 15)]\n     * Throws if the ranges are not touching.\n    */\n    joinRightTouching(range) {\n        if (this.endExclusive !== range.start) {\n            throw new BugIndicatingError(`Invalid join: ${this.toString()} and ${range.toString()}`);\n        }\n        return new OffsetRange(this.start, range.endExclusive);\n    }\n}\nclass OffsetRangeSet {\n    constructor() {\n        this._sortedRanges = [];\n    }\n    addRange(range) {\n        let i = 0;\n        while (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive < range.start) {\n            i++;\n        }\n        let j = i;\n        while (j < this._sortedRanges.length && this._sortedRanges[j].start <= range.endExclusive) {\n            j++;\n        }\n        if (i === j) {\n            this._sortedRanges.splice(i, 0, range);\n        }\n        else {\n            const start = Math.min(range.start, this._sortedRanges[i].start);\n            const end = Math.max(range.endExclusive, this._sortedRanges[j - 1].endExclusive);\n            this._sortedRanges.splice(i, j - i, new OffsetRange(start, end));\n        }\n    }\n    toString() {\n        return this._sortedRanges.map(r => r.toString()).join(', ');\n    }\n    /**\n     * Returns of there is a value that is contained in this instance and the given range.\n     */\n    intersectsStrict(other) {\n        // TODO use binary search\n        let i = 0;\n        while (i < this._sortedRanges.length && this._sortedRanges[i].endExclusive <= other.start) {\n            i++;\n        }\n        return i < this._sortedRanges.length && this._sortedRanges[i].start < other.endExclusive;\n    }\n    intersectWithRange(other) {\n        // TODO use binary search + slice\n        const result = new OffsetRangeSet();\n        for (const range of this._sortedRanges) {\n            const intersection = range.intersect(other);\n            if (intersection) {\n                result.addRange(intersection);\n            }\n        }\n        return result;\n    }\n    intersectWithRangeLength(other) {\n        return this.intersectWithRange(other).length;\n    }\n    get length() {\n        return this._sortedRanges.reduce((prev, cur) => prev + cur.length, 0);\n    }\n}\n\nexport { OffsetRange, OffsetRangeSet };\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 *--------------------------------------------------------------------------------------------*/\nfunction findLast(array, predicate, fromIndex = array.length - 1) {\n    const idx = findLastIdx(array, predicate, fromIndex);\n    if (idx === -1) {\n        return undefined;\n    }\n    return array[idx];\n}\nfunction findLastIdx(array, predicate, fromIndex = array.length - 1) {\n    for (let i = fromIndex; i >= 0; i--) {\n        const element = array[i];\n        if (predicate(element, i)) {\n            return i;\n        }\n    }\n    return -1;\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 */\nfunction findLastMonotonous(array, predicate) {\n    const idx = findLastIdxMonotonous(array, predicate);\n    return idx === -1 ? undefined : array[idx];\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 */\nfunction findLastIdxMonotonous(array, predicate, startIdx = 0, endIdxEx = array.length) {\n    let i = startIdx;\n    let j = endIdxEx;\n    while (i < j) {\n        const k = Math.floor((i + j) / 2);\n        if (predicate(array[k])) {\n            i = k + 1;\n        }\n        else {\n            j = k;\n        }\n    }\n    return i - 1;\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 */\nfunction findFirstMonotonous(array, predicate) {\n    const idx = findFirstIdxMonotonousOrArrLen(array, predicate);\n    return idx === array.length ? undefined : array[idx];\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 */\nfunction findFirstIdxMonotonousOrArrLen(array, predicate, startIdx = 0, endIdxEx = array.length) {\n    let i = startIdx;\n    let j = endIdxEx;\n    while (i < j) {\n        const k = Math.floor((i + j) / 2);\n        if (predicate(array[k])) {\n            j = k;\n        }\n        else {\n            i = k + 1;\n        }\n    }\n    return i;\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 */\nclass MonotonousArray {\n    static { this.assertInvariants = false; }\n    constructor(_array) {\n        this._array = _array;\n        this._findLastMonotonousLastIdx = 0;\n    }\n    /**\n     * The predicate must be monotonous, i.e. `arr.map(predicate)` must be like `[true, ..., true, false, ..., false]`!\n     * For subsequent calls, current predicate must be weaker than (or equal to) the previous predicate, i.e. more entries must be `true`.\n     */\n    findLastMonotonous(predicate) {\n        if (MonotonousArray.assertInvariants) {\n            if (this._prevFindLastPredicate) {\n                for (const item of this._array) {\n                    if (this._prevFindLastPredicate(item) && !predicate(item)) {\n                        throw new Error('MonotonousArray: current predicate must be weaker than (or equal to) the previous predicate.');\n                    }\n                }\n            }\n            this._prevFindLastPredicate = predicate;\n        }\n        const idx = findLastIdxMonotonous(this._array, predicate, this._findLastMonotonousLastIdx);\n        this._findLastMonotonousLastIdx = idx + 1;\n        return idx === -1 ? undefined : this._array[idx];\n    }\n}\n/**\n * Returns the first item that is equal to or greater than every other item.\n*/\nfunction findFirstMax(array, comparator) {\n    if (array.length === 0) {\n        return undefined;\n    }\n    let max = array[0];\n    for (let i = 1; i < array.length; i++) {\n        const item = array[i];\n        if (comparator(item, max) > 0) {\n            max = item;\n        }\n    }\n    return max;\n}\n/**\n * Returns the last item that is equal to or greater than every other item.\n*/\nfunction findLastMax(array, comparator) {\n    if (array.length === 0) {\n        return undefined;\n    }\n    let max = array[0];\n    for (let i = 1; i < array.length; i++) {\n        const item = array[i];\n        if (comparator(item, max) >= 0) {\n            max = item;\n        }\n    }\n    return max;\n}\n/**\n * Returns the first item that is equal to or less than every other item.\n*/\nfunction findFirstMin(array, comparator) {\n    return findFirstMax(array, (a, b) => -comparator(a, b));\n}\nfunction findMaxIdx(array, comparator) {\n    if (array.length === 0) {\n        return -1;\n    }\n    let maxIdx = 0;\n    for (let i = 1; i < array.length; i++) {\n        const item = array[i];\n        if (comparator(item, array[maxIdx]) > 0) {\n            maxIdx = i;\n        }\n    }\n    return maxIdx;\n}\n/**\n * Returns the first mapped value of the array which is not undefined.\n */\nfunction mapFindFirst(items, mapFn) {\n    for (const value of items) {\n        const mapped = mapFn(value);\n        if (mapped !== undefined) {\n            return mapped;\n        }\n    }\n    return undefined;\n}\n\nexport { MonotonousArray, findFirstIdxMonotonousOrArrLen, findFirstMax, findFirstMin, findFirstMonotonous, findLast, findLastIdx, findLastIdxMonotonous, findLastMax, findLastMonotonous, findMaxIdx, mapFindFirst };\n","import { BugIndicatingError } from '../../../../base/common/errors.js';\nimport { OffsetRange } from './offsetRange.js';\nimport { Range } from '../range.js';\nimport { findFirstIdxMonotonousOrArrLen, findLastIdxMonotonous, findLastMonotonous } from '../../../../base/common/arraysFind.js';\nimport { compareBy, numberComparator } from '../../../../base/common/arrays.js';\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 * A range of lines (1-based).\n */\nclass LineRange {\n    static ofLength(startLineNumber, length) {\n        return new LineRange(startLineNumber, startLineNumber + length);\n    }\n    static fromRange(range) {\n        return new LineRange(range.startLineNumber, range.endLineNumber);\n    }\n    static fromRangeInclusive(range) {\n        return new LineRange(range.startLineNumber, range.endLineNumber + 1);\n    }\n    static { this.compareByStart = compareBy(l => l.startLineNumber, numberComparator); }\n    /**\n     * @param lineRanges An array of arrays of of sorted line ranges.\n     */\n    static joinMany(lineRanges) {\n        if (lineRanges.length === 0) {\n            return [];\n        }\n        let result = new LineRangeSet(lineRanges[0].slice());\n        for (let i = 1; i < lineRanges.length; i++) {\n            result = result.getUnion(new LineRangeSet(lineRanges[i].slice()));\n        }\n        return result.ranges;\n    }\n    static join(lineRanges) {\n        if (lineRanges.length === 0) {\n            throw new BugIndicatingError('lineRanges cannot be empty');\n        }\n        let startLineNumber = lineRanges[0].startLineNumber;\n        let endLineNumberExclusive = lineRanges[0].endLineNumberExclusive;\n        for (let i = 1; i < lineRanges.length; i++) {\n            startLineNumber = Math.min(startLineNumber, lineRanges[i].startLineNumber);\n            endLineNumberExclusive = Math.max(endLineNumberExclusive, lineRanges[i].endLineNumberExclusive);\n        }\n        return new LineRange(startLineNumber, endLineNumberExclusive);\n    }\n    /**\n     * @internal\n     */\n    static deserialize(lineRange) {\n        return new LineRange(lineRange[0], lineRange[1]);\n    }\n    constructor(startLineNumber, endLineNumberExclusive) {\n        if (startLineNumber > endLineNumberExclusive) {\n            throw new BugIndicatingError(`startLineNumber ${startLineNumber} cannot be after endLineNumberExclusive ${endLineNumberExclusive}`);\n        }\n        this.startLineNumber = startLineNumber;\n        this.endLineNumberExclusive = endLineNumberExclusive;\n    }\n    /**\n     * Indicates if this line range contains the given line number.\n     */\n    contains(lineNumber) {\n        return this.startLineNumber <= lineNumber && lineNumber < this.endLineNumberExclusive;\n    }\n    /**\n     * Indicates if this line range is empty.\n     */\n    get isEmpty() {\n        return this.startLineNumber === this.endLineNumberExclusive;\n    }\n    /**\n     * Moves this line range by the given offset of line numbers.\n     */\n    delta(offset) {\n        return new LineRange(this.startLineNumber + offset, this.endLineNumberExclusive + offset);\n    }\n    deltaLength(offset) {\n        return new LineRange(this.startLineNumber, this.endLineNumberExclusive + offset);\n    }\n    /**\n     * The number of lines this line range spans.\n     */\n    get length() {\n        return this.endLineNumberExclusive - this.startLineNumber;\n    }\n    /**\n     * Creates a line range that combines this and the given line range.\n     */\n    join(other) {\n        return new LineRange(Math.min(this.startLineNumber, other.startLineNumber), Math.max(this.endLineNumberExclusive, other.endLineNumberExclusive));\n    }\n    toString() {\n        return `[${this.startLineNumber},${this.endLineNumberExclusive})`;\n    }\n    /**\n     * The resulting range is empty if the ranges do not intersect, but touch.\n     * If the ranges don't even touch, the result is undefined.\n     */\n    intersect(other) {\n        const startLineNumber = Math.max(this.startLineNumber, other.startLineNumber);\n        const endLineNumberExclusive = Math.min(this.endLineNumberExclusive, other.endLineNumberExclusive);\n        if (startLineNumber <= endLineNumberExclusive) {\n            return new LineRange(startLineNumber, endLineNumberExclusive);\n        }\n        return undefined;\n    }\n    intersectsStrict(other) {\n        return this.startLineNumber < other.endLineNumberExclusive && other.startLineNumber < this.endLineNumberExclusive;\n    }\n    intersectsOrTouches(other) {\n        return this.startLineNumber <= other.endLineNumberExclusive && other.startLineNumber <= this.endLineNumberExclusive;\n    }\n    equals(b) {\n        return this.startLineNumber === b.startLineNumber && this.endLineNumberExclusive === b.endLineNumberExclusive;\n    }\n    toInclusiveRange() {\n        if (this.isEmpty) {\n            return null;\n        }\n        return new Range(this.startLineNumber, 1, this.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER);\n    }\n    /**\n     * @deprecated Using this function is discouraged because it might lead to bugs: The end position is not guaranteed to be a valid position!\n    */\n    toExclusiveRange() {\n        return new Range(this.startLineNumber, 1, this.endLineNumberExclusive, 1);\n    }\n    mapToLineArray(f) {\n        const result = [];\n        for (let lineNumber = this.startLineNumber; lineNumber < this.endLineNumberExclusive; lineNumber++) {\n            result.push(f(lineNumber));\n        }\n        return result;\n    }\n    forEach(f) {\n        for (let lineNumber = this.startLineNumber; lineNumber < this.endLineNumberExclusive; lineNumber++) {\n            f(lineNumber);\n        }\n    }\n    /**\n     * @internal\n     */\n    serialize() {\n        return [this.startLineNumber, this.endLineNumberExclusive];\n    }\n    /**\n     * Converts this 1-based line range to a 0-based offset range (subtracts 1!).\n     * @internal\n     */\n    toOffsetRange() {\n        return new OffsetRange(this.startLineNumber - 1, this.endLineNumberExclusive - 1);\n    }\n    addMargin(marginTop, marginBottom) {\n        return new LineRange(this.startLineNumber - marginTop, this.endLineNumberExclusive + marginBottom);\n    }\n}\nclass LineRangeSet {\n    constructor(\n    /**\n     * Sorted by start line number.\n     * No two line ranges are touching or intersecting.\n     */\n    _normalizedRanges = []) {\n        this._normalizedRanges = _normalizedRanges;\n    }\n    get ranges() {\n        return this._normalizedRanges;\n    }\n    addRange(range) {\n        if (range.length === 0) {\n            return;\n        }\n        // Idea: Find joinRange such that:\n        // replaceRange = _normalizedRanges.replaceRange(joinRange, range.joinAll(joinRange.map(idx => this._normalizedRanges[idx])))\n        // idx of first element that touches range or that is after range\n        const joinRangeStartIdx = findFirstIdxMonotonousOrArrLen(this._normalizedRanges, r => r.endLineNumberExclusive >= range.startLineNumber);\n        // idx of element after { last element that touches range or that is before range }\n        const joinRangeEndIdxExclusive = findLastIdxMonotonous(this._normalizedRanges, r => r.startLineNumber <= range.endLineNumberExclusive) + 1;\n        if (joinRangeStartIdx === joinRangeEndIdxExclusive) {\n            // If there is no element that touches range, then joinRangeStartIdx === joinRangeEndIdxExclusive and that value is the index of the element after range\n            this._normalizedRanges.splice(joinRangeStartIdx, 0, range);\n        }\n        else if (joinRangeStartIdx === joinRangeEndIdxExclusive - 1) {\n            // 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            const joinRange = this._normalizedRanges[joinRangeStartIdx];\n            this._normalizedRanges[joinRangeStartIdx] = joinRange.join(range);\n        }\n        else {\n            // First and last element are different - we need to replace the entire range\n            const joinRange = this._normalizedRanges[joinRangeStartIdx].join(this._normalizedRanges[joinRangeEndIdxExclusive - 1]).join(range);\n            this._normalizedRanges.splice(joinRangeStartIdx, joinRangeEndIdxExclusive - joinRangeStartIdx, joinRange);\n        }\n    }\n    contains(lineNumber) {\n        const rangeThatStartsBeforeEnd = findLastMonotonous(this._normalizedRanges, r => r.startLineNumber <= lineNumber);\n        return !!rangeThatStartsBeforeEnd && rangeThatStartsBeforeEnd.endLineNumberExclusive > lineNumber;\n    }\n    intersects(range) {\n        const rangeThatStartsBeforeEnd = findLastMonotonous(this._normalizedRanges, r => r.startLineNumber < range.endLineNumberExclusive);\n        return !!rangeThatStartsBeforeEnd && rangeThatStartsBeforeEnd.endLineNumberExclusive > range.startLineNumber;\n    }\n    getUnion(other) {\n        if (this._normalizedRanges.length === 0) {\n            return other;\n        }\n        if (other._normalizedRanges.length === 0) {\n            return this;\n        }\n        const result = [];\n        let i1 = 0;\n        let i2 = 0;\n        let current = null;\n        while (i1 < this._normalizedRanges.length || i2 < other._normalizedRanges.length) {\n            let next = null;\n            if (i1 < this._normalizedRanges.length && i2 < other._normalizedRanges.length) {\n                const lineRange1 = this._normalizedRanges[i1];\n                const lineRange2 = other._normalizedRanges[i2];\n                if (lineRange1.startLineNumber < lineRange2.startLineNumber) {\n                    next = lineRange1;\n                    i1++;\n                }\n                else {\n                    next = lineRange2;\n                    i2++;\n                }\n            }\n            else if (i1 < this._normalizedRanges.length) {\n                next = this._normalizedRanges[i1];\n                i1++;\n            }\n            else {\n                next = other._normalizedRanges[i2];\n                i2++;\n            }\n            if (current === null) {\n                current = next;\n            }\n            else {\n                if (current.endLineNumberExclusive >= next.startLineNumber) {\n                    // merge\n                    current = new LineRange(current.startLineNumber, Math.max(current.endLineNumberExclusive, next.endLineNumberExclusive));\n                }\n                else {\n                    // push\n                    result.push(current);\n                    current = next;\n                }\n            }\n        }\n        if (current !== null) {\n            result.push(current);\n        }\n        return new LineRangeSet(result);\n    }\n    /**\n     * Subtracts all ranges in this set from `range` and returns the result.\n     */\n    subtractFrom(range) {\n        // idx of first element that touches range or that is after range\n        const joinRangeStartIdx = findFirstIdxMonotonousOrArrLen(this._normalizedRanges, r => r.endLineNumberExclusive >= range.startLineNumber);\n        // idx of element after { last element that touches range or that is before range }\n        const joinRangeEndIdxExclusive = findLastIdxMonotonous(this._normalizedRanges, r => r.startLineNumber <= range.endLineNumberExclusive) + 1;\n        if (joinRangeStartIdx === joinRangeEndIdxExclusive) {\n            return new LineRangeSet([range]);\n        }\n        const result = [];\n        let startLineNumber = range.startLineNumber;\n        for (let i = joinRangeStartIdx; i < joinRangeEndIdxExclusive; i++) {\n            const r = this._normalizedRanges[i];\n            if (r.startLineNumber > startLineNumber) {\n                result.push(new LineRange(startLineNumber, r.startLineNumber));\n            }\n            startLineNumber = r.endLineNumberExclusive;\n        }\n        if (startLineNumber < range.endLineNumberExclusive) {\n            result.push(new LineRange(startLineNumber, range.endLineNumberExclusive));\n        }\n        return new LineRangeSet(result);\n    }\n    toString() {\n        return this._normalizedRanges.map(r => r.toString()).join(', ');\n    }\n    getIntersection(other) {\n        const result = [];\n        let i1 = 0;\n        let i2 = 0;\n        while (i1 < this._normalizedRanges.length && i2 < other._normalizedRanges.length) {\n            const r1 = this._normalizedRanges[i1];\n            const r2 = other._normalizedRanges[i2];\n            const i = r1.intersect(r2);\n            if (i && !i.isEmpty) {\n                result.push(i);\n            }\n            if (r1.endLineNumberExclusive < r2.endLineNumberExclusive) {\n                i1++;\n            }\n            else {\n                i2++;\n            }\n        }\n        return new LineRangeSet(result);\n    }\n    getWithDelta(value) {\n        return new LineRangeSet(this._normalizedRanges.map(r => r.delta(value)));\n    }\n}\n\nexport { LineRange, LineRangeSet };\n","import { LineRange } from '../ranges/lineRange.js';\nimport { Position } from '../position.js';\nimport { Range } from '../range.js';\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 * Represents a non-negative length of text in terms of line and column count.\n*/\nclass TextLength {\n    static { this.zero = new TextLength(0, 0); }\n    static betweenPositions(position1, position2) {\n        if (position1.lineNumber === position2.lineNumber) {\n            return new TextLength(0, position2.column - position1.column);\n        }\n        else {\n            return new TextLength(position2.lineNumber - position1.lineNumber, position2.column - 1);\n        }\n    }\n    static fromPosition(pos) {\n        return new TextLength(pos.lineNumber - 1, pos.column - 1);\n    }\n    static ofRange(range) {\n        return TextLength.betweenPositions(range.getStartPosition(), range.getEndPosition());\n    }\n    static ofText(text) {\n        let line = 0;\n        let column = 0;\n        for (const c of text) {\n            if (c === '\\n') {\n                line++;\n                column = 0;\n            }\n            else {\n                column++;\n            }\n        }\n        return new TextLength(line, column);\n    }\n    constructor(lineCount, columnCount) {\n        this.lineCount = lineCount;\n        this.columnCount = columnCount;\n    }\n    isGreaterThanOrEqualTo(other) {\n        if (this.lineCount !== other.lineCount) {\n            return this.lineCount > other.lineCount;\n        }\n        return this.columnCount >= other.columnCount;\n    }\n    add(other) {\n        if (other.lineCount === 0) {\n            return new TextLength(this.lineCount, this.columnCount + other.columnCount);\n        }\n        else {\n            return new TextLength(this.lineCount + other.lineCount, other.columnCount);\n        }\n    }\n    createRange(startPosition) {\n        if (this.lineCount === 0) {\n            return new Range(startPosition.lineNumber, startPosition.column, startPosition.lineNumber, startPosition.column + this.columnCount);\n        }\n        else {\n            return new Range(startPosition.lineNumber, startPosition.column, startPosition.lineNumber + this.lineCount, this.columnCount + 1);\n        }\n    }\n    toRange() {\n        return new Range(1, 1, this.lineCount + 1, this.columnCount + 1);\n    }\n    toLineRange() {\n        return LineRange.ofLength(1, this.lineCount + 1);\n    }\n    addToPosition(position) {\n        if (this.lineCount === 0) {\n            return new Position(position.lineNumber, position.column + this.columnCount);\n        }\n        else {\n            return new Position(position.lineNumber + this.lineCount, this.columnCount + 1);\n        }\n    }\n    toString() {\n        return `${this.lineCount},${this.columnCount}`;\n    }\n}\n\nexport { TextLength };\n","import { findLastIdxMonotonous } from '../../../../base/common/arraysFind.js';\nimport { OffsetRange } from '../ranges/offsetRange.js';\nimport { Position } from '../position.js';\nimport { Range } from '../range.js';\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 *--------------------------------------------------------------------------------------------*/\nclass PositionOffsetTransformerBase {\n    getOffsetRange(range) {\n        return new OffsetRange(this.getOffset(range.getStartPosition()), this.getOffset(range.getEndPosition()));\n    }\n    getRange(offsetRange) {\n        return Range.fromPositions(this.getPosition(offsetRange.start), this.getPosition(offsetRange.endExclusive));\n    }\n    getStringReplacement(edit) {\n        return new Deps.deps.StringReplacement(this.getOffsetRange(edit.range), edit.text);\n    }\n    getTextReplacement(edit) {\n        return new Deps.deps.TextReplacement(this.getRange(edit.replaceRange), edit.newText);\n    }\n    getTextEdit(edit) {\n        const edits = edit.replacements.map(e => this.getTextReplacement(e));\n        return new Deps.deps.TextEdit(edits);\n    }\n}\nclass Deps {\n    static { this._deps = undefined; }\n    static get deps() {\n        if (!this._deps) {\n            throw new Error('Dependencies not set. Call _setDependencies first.');\n        }\n        return this._deps;\n    }\n}\n/** This is to break circular module dependencies. */\nfunction _setPositionOffsetTransformerDependencies(deps) {\n    Deps._deps = deps;\n}\nclass PositionOffsetTransformer extends PositionOffsetTransformerBase {\n    constructor(text) {\n        super();\n        this.text = text;\n        this.lineStartOffsetByLineIdx = [];\n        this.lineEndOffsetByLineIdx = [];\n        this.lineStartOffsetByLineIdx.push(0);\n        for (let i = 0; i < text.length; i++) {\n            if (text.charAt(i) === '\\n') {\n                this.lineStartOffsetByLineIdx.push(i + 1);\n                if (i > 0 && text.charAt(i - 1) === '\\r') {\n                    this.lineEndOffsetByLineIdx.push(i - 1);\n                }\n                else {\n                    this.lineEndOffsetByLineIdx.push(i);\n                }\n            }\n        }\n        this.lineEndOffsetByLineIdx.push(text.length);\n    }\n    getOffset(position) {\n        const valPos = this._validatePosition(position);\n        return this.lineStartOffsetByLineIdx[valPos.lineNumber - 1] + valPos.column - 1;\n    }\n    _validatePosition(position) {\n        if (position.lineNumber < 1) {\n            return new Position(1, 1);\n        }\n        const lineCount = this.textLength.lineCount + 1;\n        if (position.lineNumber > lineCount) {\n            const lineLength = this.getLineLength(lineCount);\n            return new Position(lineCount, lineLength + 1);\n        }\n        if (position.column < 1) {\n            return new Position(position.lineNumber, 1);\n        }\n        const lineLength = this.getLineLength(position.lineNumber);\n        if (position.column - 1 > lineLength) {\n            return new Position(position.lineNumber, lineLength + 1);\n        }\n        return position;\n    }\n    getPosition(offset) {\n        const idx = findLastIdxMonotonous(this.lineStartOffsetByLineIdx, i => i <= offset);\n        const lineNumber = idx + 1;\n        const column = offset - this.lineStartOffsetByLineIdx[idx] + 1;\n        return new Position(lineNumber, column);\n    }\n    get textLength() {\n        const lineIdx = this.lineStartOffsetByLineIdx.length - 1;\n        return new Deps.deps.TextLength(lineIdx, this.text.length - this.lineStartOffsetByLineIdx[lineIdx]);\n    }\n    getLineLength(lineNumber) {\n        return this.lineEndOffsetByLineIdx[lineNumber - 1] - this.lineStartOffsetByLineIdx[lineNumber - 1];\n    }\n}\n\nexport { PositionOffsetTransformer, PositionOffsetTransformerBase, _setPositionOffsetTransformerDependencies };\n","import { assert } from '../../../../base/common/assert.js';\nimport { Position } from '../position.js';\nimport { Range } from '../range.js';\nimport { TextLength } from './textLength.js';\nimport { PositionOffsetTransformer } from './positionToOffsetImpl.js';\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 *--------------------------------------------------------------------------------------------*/\nclass AbstractText {\n    constructor() {\n        this._transformer = undefined;\n    }\n    get endPositionExclusive() {\n        return this.length.addToPosition(new Position(1, 1));\n    }\n    get lineRange() {\n        return this.length.toLineRange();\n    }\n    getValue() {\n        return this.getValueOfRange(this.length.toRange());\n    }\n    getValueOfOffsetRange(range) {\n        return this.getValueOfRange(this.getTransformer().getRange(range));\n    }\n    getLineLength(lineNumber) {\n        return this.getValueOfRange(new Range(lineNumber, 1, lineNumber, Number.MAX_SAFE_INTEGER)).length;\n    }\n    getTransformer() {\n        if (!this._transformer) {\n            this._transformer = new PositionOffsetTransformer(this.getValue());\n        }\n        return this._transformer;\n    }\n    getLineAt(lineNumber) {\n        return this.getValueOfRange(new Range(lineNumber, 1, lineNumber, Number.MAX_SAFE_INTEGER));\n    }\n}\nclass LineBasedText extends AbstractText {\n    constructor(_getLineContent, _lineCount) {\n        assert(_lineCount >= 1);\n        super();\n        this._getLineContent = _getLineContent;\n        this._lineCount = _lineCount;\n    }\n    getValueOfRange(range) {\n        if (range.startLineNumber === range.endLineNumber) {\n            return this._getLineContent(range.startLineNumber).substring(range.startColumn - 1, range.endColumn - 1);\n        }\n        let result = this._getLineContent(range.startLineNumber).substring(range.startColumn - 1);\n        for (let i = range.startLineNumber + 1; i < range.endLineNumber; i++) {\n            result += '\\n' + this._getLineContent(i);\n        }\n        result += '\\n' + this._getLineContent(range.endLineNumber).substring(0, range.endColumn - 1);\n        return result;\n    }\n    getLineLength(lineNumber) {\n        return this._getLineContent(lineNumber).length;\n    }\n    get length() {\n        const lastLine = this._getLineContent(this._lineCount);\n        return new TextLength(this._lineCount - 1, lastLine.length);\n    }\n}\nclass ArrayText extends LineBasedText {\n    constructor(lines) {\n        super(lineNumber => lines[lineNumber - 1], lines.length);\n    }\n}\nclass StringText extends AbstractText {\n    constructor(value) {\n        super();\n        this.value = value;\n        this._t = new PositionOffsetTransformer(this.value);\n    }\n    getValueOfRange(range) {\n        return this._t.getOffsetRange(range).substring(this.value);\n    }\n    get length() {\n        return this._t.textLength;\n    }\n    // Override the getTransformer method to return the cached transformer\n    getTransformer() {\n        return this._t;\n    }\n}\n\nexport { AbstractText, ArrayText, LineBasedText, StringText };\n","import { compareBy } from '../../../../base/common/arrays.js';\nimport { assertFn, checkAdjacentItems } from '../../../../base/common/assert.js';\nimport { BugIndicatingError } from '../../../../base/common/errors.js';\nimport { commonPrefixLength, commonSuffixLength } from '../../../../base/common/strings.js';\nimport { Position } from '../position.js';\nimport { Range } from '../range.js';\nimport { TextLength } from '../text/textLength.js';\nimport { StringText } from '../text/abstractText.js';\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 *--------------------------------------------------------------------------------------------*/\nclass TextEdit {\n    static fromStringEdit(edit, initialState) {\n        const edits = edit.replacements.map(e => TextReplacement.fromStringReplacement(e, initialState));\n        return new TextEdit(edits);\n    }\n    static fromParallelReplacementsUnsorted(replacements) {\n        const r = replacements.slice().sort(compareBy(i => i.range, Range.compareRangesUsingStarts));\n        return new TextEdit(r);\n    }\n    constructor(replacements) {\n        this.replacements = replacements;\n        assertFn(() => checkAdjacentItems(replacements, (a, b) => a.range.getEndPosition().isBeforeOrEqual(b.range.getStartPosition())));\n    }\n    mapPosition(position) {\n        let lineDelta = 0;\n        let curLine = 0;\n        let columnDeltaInCurLine = 0;\n        for (const replacement of this.replacements) {\n            const start = replacement.range.getStartPosition();\n            if (position.isBeforeOrEqual(start)) {\n                break;\n            }\n            const end = replacement.range.getEndPosition();\n            const len = TextLength.ofText(replacement.text);\n            if (position.isBefore(end)) {\n                const startPos = new Position(start.lineNumber + lineDelta, start.column + (start.lineNumber + lineDelta === curLine ? columnDeltaInCurLine : 0));\n                const endPos = len.addToPosition(startPos);\n                return rangeFromPositions(startPos, endPos);\n            }\n            if (start.lineNumber + lineDelta !== curLine) {\n                columnDeltaInCurLine = 0;\n            }\n            lineDelta += len.lineCount - (replacement.range.endLineNumber - replacement.range.startLineNumber);\n            if (len.lineCount === 0) {\n                if (end.lineNumber !== start.lineNumber) {\n                    columnDeltaInCurLine += len.columnCount - (end.column - 1);\n                }\n                else {\n                    columnDeltaInCurLine += len.columnCount - (end.column - start.column);\n                }\n            }\n            else {\n                columnDeltaInCurLine = len.columnCount;\n            }\n            curLine = end.lineNumber + lineDelta;\n        }\n        return new Position(position.lineNumber + lineDelta, position.column + (position.lineNumber + lineDelta === curLine ? columnDeltaInCurLine : 0));\n    }\n    mapRange(range) {\n        function getStart(p) {\n            return p instanceof Position ? p : p.getStartPosition();\n        }\n        function getEnd(p) {\n            return p instanceof Position ? p : p.getEndPosition();\n        }\n        const start = getStart(this.mapPosition(range.getStartPosition()));\n        const end = getEnd(this.mapPosition(range.getEndPosition()));\n        return rangeFromPositions(start, end);\n    }\n    apply(text) {\n        let result = '';\n        let lastEditEnd = new Position(1, 1);\n        for (const replacement of this.replacements) {\n            const editRange = replacement.range;\n            const editStart = editRange.getStartPosition();\n            const editEnd = editRange.getEndPosition();\n            const r = rangeFromPositions(lastEditEnd, editStart);\n            if (!r.isEmpty()) {\n                result += text.getValueOfRange(r);\n            }\n            result += replacement.text;\n            lastEditEnd = editEnd;\n        }\n        const r = rangeFromPositions(lastEditEnd, text.endPositionExclusive);\n        if (!r.isEmpty()) {\n            result += text.getValueOfRange(r);\n        }\n        return result;\n    }\n    applyToString(str) {\n        const strText = new StringText(str);\n        return this.apply(strText);\n    }\n    getNewRanges() {\n        const newRanges = [];\n        let previousEditEndLineNumber = 0;\n        let lineOffset = 0;\n        let columnOffset = 0;\n        for (const replacement of this.replacements) {\n            const textLength = TextLength.ofText(replacement.text);\n            const newRangeStart = Position.lift({\n                lineNumber: replacement.range.startLineNumber + lineOffset,\n                column: replacement.range.startColumn + (replacement.range.startLineNumber === previousEditEndLineNumber ? columnOffset : 0)\n            });\n            const newRange = textLength.createRange(newRangeStart);\n            newRanges.push(newRange);\n            lineOffset = newRange.endLineNumber - replacement.range.endLineNumber;\n            columnOffset = newRange.endColumn - replacement.range.endColumn;\n            previousEditEndLineNumber = replacement.range.endLineNumber;\n        }\n        return newRanges;\n    }\n    toReplacement(text) {\n        if (this.replacements.length === 0) {\n            throw new BugIndicatingError();\n        }\n        if (this.replacements.length === 1) {\n            return this.replacements[0];\n        }\n        const startPos = this.replacements[0].range.getStartPosition();\n        const endPos = this.replacements[this.replacements.length - 1].range.getEndPosition();\n        let newText = '';\n        for (let i = 0; i < this.replacements.length; i++) {\n            const curEdit = this.replacements[i];\n            newText += curEdit.text;\n            if (i < this.replacements.length - 1) {\n                const nextEdit = this.replacements[i + 1];\n                const gapRange = Range.fromPositions(curEdit.range.getEndPosition(), nextEdit.range.getStartPosition());\n                const gapText = text.getValueOfRange(gapRange);\n                newText += gapText;\n            }\n        }\n        return new TextReplacement(Range.fromPositions(startPos, endPos), newText);\n    }\n    toString(text) {\n        if (text === undefined) {\n            return this.replacements.map(edit => edit.toString()).join('\\n');\n        }\n        if (typeof text === 'string') {\n            return this.toString(new StringText(text));\n        }\n        if (this.replacements.length === 0) {\n            return '';\n        }\n        return this.replacements.map(r => {\n            const maxLength = 10;\n            const originalText = text.getValueOfRange(r.range);\n            // Get text before the edit\n            const beforeRange = Range.fromPositions(new Position(Math.max(1, r.range.startLineNumber - 1), 1), r.range.getStartPosition());\n            let beforeText = text.getValueOfRange(beforeRange);\n            if (beforeText.length > maxLength) {\n                beforeText = '...' + beforeText.substring(beforeText.length - maxLength);\n            }\n            // Get text after the edit\n            const afterRange = Range.fromPositions(r.range.getEndPosition(), new Position(r.range.endLineNumber + 1, 1));\n            let afterText = text.getValueOfRange(afterRange);\n            if (afterText.length > maxLength) {\n                afterText = afterText.substring(0, maxLength) + '...';\n            }\n            // Format the replaced text\n            let replacedText = originalText;\n            if (replacedText.length > maxLength) {\n                const halfMax = Math.floor(maxLength / 2);\n                replacedText = replacedText.substring(0, halfMax) + '...' +\n                    replacedText.substring(replacedText.length - halfMax);\n            }\n            // Format the new text\n            let newText = r.text;\n            if (newText.length > maxLength) {\n                const halfMax = Math.floor(maxLength / 2);\n                newText = newText.substring(0, halfMax) + '...' +\n                    newText.substring(newText.length - halfMax);\n            }\n            if (replacedText.length === 0) {\n                // allow-any-unicode-next-line\n                return `${beforeText}❰${newText}❱${afterText}`;\n            }\n            // allow-any-unicode-next-line\n            return `${beforeText}❰${replacedText}↦${newText}❱${afterText}`;\n        }).join('\\n');\n    }\n}\nclass TextReplacement {\n    static joinReplacements(replacements, initialValue) {\n        if (replacements.length === 0) {\n            throw new BugIndicatingError();\n        }\n        if (replacements.length === 1) {\n            return replacements[0];\n        }\n        const startPos = replacements[0].range.getStartPosition();\n        const endPos = replacements[replacements.length - 1].range.getEndPosition();\n        let newText = '';\n        for (let i = 0; i < replacements.length; i++) {\n            const curEdit = replacements[i];\n            newText += curEdit.text;\n            if (i < replacements.length - 1) {\n                const nextEdit = replacements[i + 1];\n                const gapRange = Range.fromPositions(curEdit.range.getEndPosition(), nextEdit.range.getStartPosition());\n                const gapText = initialValue.getValueOfRange(gapRange);\n                newText += gapText;\n            }\n        }\n        return new TextReplacement(Range.fromPositions(startPos, endPos), newText);\n    }\n    static fromStringReplacement(replacement, initialState) {\n        return new TextReplacement(initialState.getTransformer().getRange(replacement.replaceRange), replacement.newText);\n    }\n    static delete(range) {\n        return new TextReplacement(range, '');\n    }\n    constructor(range, text) {\n        this.range = range;\n        this.text = text;\n    }\n    get isEmpty() {\n        return this.range.isEmpty() && this.text.length === 0;\n    }\n    static equals(first, second) {\n        return first.range.equalsRange(second.range) && first.text === second.text;\n    }\n    equals(other) {\n        return TextReplacement.equals(this, other);\n    }\n    removeCommonPrefixAndSuffix(text) {\n        const prefix = this.removeCommonPrefix(text);\n        const suffix = prefix.removeCommonSuffix(text);\n        return suffix;\n    }\n    removeCommonPrefix(text) {\n        const normalizedOriginalText = text.getValueOfRange(this.range).replaceAll('\\r\\n', '\\n');\n        const normalizedModifiedText = this.text.replaceAll('\\r\\n', '\\n');\n        const commonPrefixLen = commonPrefixLength(normalizedOriginalText, normalizedModifiedText);\n        const start = TextLength.ofText(normalizedOriginalText.substring(0, commonPrefixLen))\n            .addToPosition(this.range.getStartPosition());\n        const newText = normalizedModifiedText.substring(commonPrefixLen);\n        const range = Range.fromPositions(start, this.range.getEndPosition());\n        return new TextReplacement(range, newText);\n    }\n    removeCommonSuffix(text) {\n        const normalizedOriginalText = text.getValueOfRange(this.range).replaceAll('\\r\\n', '\\n');\n        const normalizedModifiedText = this.text.replaceAll('\\r\\n', '\\n');\n        const commonSuffixLen = commonSuffixLength(normalizedOriginalText, normalizedModifiedText);\n        const end = TextLength.ofText(normalizedOriginalText.substring(0, normalizedOriginalText.length - commonSuffixLen))\n            .addToPosition(this.range.getStartPosition());\n        const newText = normalizedModifiedText.substring(0, normalizedModifiedText.length - commonSuffixLen);\n        const range = Range.fromPositions(this.range.getStartPosition(), end);\n        return new TextReplacement(range, newText);\n    }\n    toString() {\n        const start = this.range.getStartPosition();\n        const end = this.range.getEndPosition();\n        return `(${start.lineNumber},${start.column} -> ${end.lineNumber},${end.column}): \"${this.text}\"`;\n    }\n}\nfunction rangeFromPositions(start, end) {\n    if (start.lineNumber === end.lineNumber && start.column === Number.MAX_SAFE_INTEGER) {\n        return Range.fromPositions(end, end);\n    }\n    else if (!start.isBeforeOrEqual(end)) {\n        throw new BugIndicatingError('start must be before end');\n    }\n    return new Range(start.lineNumber, start.column, end.lineNumber, end.column);\n}\n\nexport { TextEdit, TextReplacement };\n","import { groupAdjacentBy } from '../../../base/common/arrays.js';\nimport { assertFn, checkAdjacentItems } from '../../../base/common/assert.js';\nimport { BugIndicatingError } from '../../../base/common/errors.js';\nimport { LineRange } from '../core/ranges/lineRange.js';\nimport { Position } from '../core/position.js';\nimport { Range } from '../core/range.js';\nimport { TextReplacement } from '../core/edits/textEdit.js';\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 * Maps a line range in the original text model to a line range in the modified text model.\n */\nclass LineRangeMapping {\n    static inverse(mapping, originalLineCount, modifiedLineCount) {\n        const result = [];\n        let lastOriginalEndLineNumber = 1;\n        let lastModifiedEndLineNumber = 1;\n        for (const m of mapping) {\n            const r = new LineRangeMapping(new LineRange(lastOriginalEndLineNumber, m.original.startLineNumber), new LineRange(lastModifiedEndLineNumber, m.modified.startLineNumber));\n            if (!r.modified.isEmpty) {\n                result.push(r);\n            }\n            lastOriginalEndLineNumber = m.original.endLineNumberExclusive;\n            lastModifiedEndLineNumber = m.modified.endLineNumberExclusive;\n        }\n        const r = new LineRangeMapping(new LineRange(lastOriginalEndLineNumber, originalLineCount + 1), new LineRange(lastModifiedEndLineNumber, modifiedLineCount + 1));\n        if (!r.modified.isEmpty) {\n            result.push(r);\n        }\n        return result;\n    }\n    static clip(mapping, originalRange, modifiedRange) {\n        const result = [];\n        for (const m of mapping) {\n            const original = m.original.intersect(originalRange);\n            const modified = m.modified.intersect(modifiedRange);\n            if (original && !original.isEmpty && modified && !modified.isEmpty) {\n                result.push(new LineRangeMapping(original, modified));\n            }\n        }\n        return result;\n    }\n    constructor(originalRange, modifiedRange) {\n        this.original = originalRange;\n        this.modified = modifiedRange;\n    }\n    toString() {\n        return `{${this.original.toString()}->${this.modified.toString()}}`;\n    }\n    flip() {\n        return new LineRangeMapping(this.modified, this.original);\n    }\n    join(other) {\n        return new LineRangeMapping(this.original.join(other.original), this.modified.join(other.modified));\n    }\n    /**\n     * This method assumes that the LineRangeMapping describes a valid diff!\n     * I.e. if one range is empty, the other range cannot be the entire document.\n     * It avoids various problems when the line range points to non-existing line-numbers.\n    */\n    toRangeMapping() {\n        const origInclusiveRange = this.original.toInclusiveRange();\n        const modInclusiveRange = this.modified.toInclusiveRange();\n        if (origInclusiveRange && modInclusiveRange) {\n            return new RangeMapping(origInclusiveRange, modInclusiveRange);\n        }\n        else if (this.original.startLineNumber === 1 || this.modified.startLineNumber === 1) {\n            if (!(this.modified.startLineNumber === 1 && this.original.startLineNumber === 1)) {\n                // If one line range starts at 1, the other one must start at 1 as well.\n                throw new BugIndicatingError('not a valid diff');\n            }\n            // Because one range is empty and both ranges start at line 1, none of the ranges can cover all lines.\n            // Thus, `endLineNumberExclusive` is a valid line number.\n            return new RangeMapping(new Range(this.original.startLineNumber, 1, this.original.endLineNumberExclusive, 1), new Range(this.modified.startLineNumber, 1, this.modified.endLineNumberExclusive, 1));\n        }\n        else {\n            // We can assume here that both startLineNumbers are greater than 1.\n            return new RangeMapping(new Range(this.original.startLineNumber - 1, Number.MAX_SAFE_INTEGER, this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), new Range(this.modified.startLineNumber - 1, Number.MAX_SAFE_INTEGER, this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER));\n        }\n    }\n    /**\n     * This method assumes that the LineRangeMapping describes a valid diff!\n     * I.e. if one range is empty, the other range cannot be the entire document.\n     * It avoids various problems when the line range points to non-existing line-numbers.\n    */\n    toRangeMapping2(original, modified) {\n        if (isValidLineNumber(this.original.endLineNumberExclusive, original)\n            && isValidLineNumber(this.modified.endLineNumberExclusive, modified)) {\n            return new RangeMapping(new Range(this.original.startLineNumber, 1, this.original.endLineNumberExclusive, 1), new Range(this.modified.startLineNumber, 1, this.modified.endLineNumberExclusive, 1));\n        }\n        if (!this.original.isEmpty && !this.modified.isEmpty) {\n            return new RangeMapping(Range.fromPositions(new Position(this.original.startLineNumber, 1), normalizePosition(new Position(this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), original)), Range.fromPositions(new Position(this.modified.startLineNumber, 1), normalizePosition(new Position(this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), modified)));\n        }\n        if (this.original.startLineNumber > 1 && this.modified.startLineNumber > 1) {\n            return new RangeMapping(Range.fromPositions(normalizePosition(new Position(this.original.startLineNumber - 1, Number.MAX_SAFE_INTEGER), original), normalizePosition(new Position(this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), original)), Range.fromPositions(normalizePosition(new Position(this.modified.startLineNumber - 1, Number.MAX_SAFE_INTEGER), modified), normalizePosition(new Position(this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), modified)));\n        }\n        // Situation now: one range is empty and one range touches the last line and one range starts at line 1.\n        // I don't think this can happen.\n        throw new BugIndicatingError();\n    }\n}\nfunction normalizePosition(position, content) {\n    if (position.lineNumber < 1) {\n        return new Position(1, 1);\n    }\n    if (position.lineNumber > content.length) {\n        return new Position(content.length, content[content.length - 1].length + 1);\n    }\n    const line = content[position.lineNumber - 1];\n    if (position.column > line.length + 1) {\n        return new Position(position.lineNumber, line.length + 1);\n    }\n    return position;\n}\nfunction isValidLineNumber(lineNumber, lines) {\n    return lineNumber >= 1 && lineNumber <= lines.length;\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 */\nclass DetailedLineRangeMapping extends LineRangeMapping {\n    static fromRangeMappings(rangeMappings) {\n        const originalRange = LineRange.join(rangeMappings.map(r => LineRange.fromRangeInclusive(r.originalRange)));\n        const modifiedRange = LineRange.join(rangeMappings.map(r => LineRange.fromRangeInclusive(r.modifiedRange)));\n        return new DetailedLineRangeMapping(originalRange, modifiedRange, rangeMappings);\n    }\n    constructor(originalRange, modifiedRange, innerChanges) {\n        super(originalRange, modifiedRange);\n        this.innerChanges = innerChanges;\n    }\n    flip() {\n        return new DetailedLineRangeMapping(this.modified, this.original, this.innerChanges?.map(c => c.flip()));\n    }\n    withInnerChangesFromLineRanges() {\n        return new DetailedLineRangeMapping(this.original, this.modified, [this.toRangeMapping()]);\n    }\n}\n/**\n * Maps a range in the original text model to a range in the modified text model.\n */\nclass RangeMapping {\n    static fromEdit(edit) {\n        const newRanges = edit.getNewRanges();\n        const result = edit.replacements.map((e, idx) => new RangeMapping(e.range, newRanges[idx]));\n        return result;\n    }\n    static assertSorted(rangeMappings) {\n        for (let i = 1; i < rangeMappings.length; i++) {\n            const previous = rangeMappings[i - 1];\n            const current = rangeMappings[i];\n            if (!(previous.originalRange.getEndPosition().isBeforeOrEqual(current.originalRange.getStartPosition())\n                && previous.modifiedRange.getEndPosition().isBeforeOrEqual(current.modifiedRange.getStartPosition()))) {\n                throw new BugIndicatingError('Range mappings must be sorted');\n            }\n        }\n    }\n    constructor(originalRange, modifiedRange) {\n        this.originalRange = originalRange;\n        this.modifiedRange = modifiedRange;\n    }\n    toString() {\n        return `{${this.originalRange.toString()}->${this.modifiedRange.toString()}}`;\n    }\n    flip() {\n        return new RangeMapping(this.modifiedRange, this.originalRange);\n    }\n    /**\n     * Creates a single text edit that describes the change from the original to the modified text.\n    */\n    toTextEdit(modified) {\n        const newText = modified.getValueOfRange(this.modifiedRange);\n        return new TextReplacement(this.originalRange, newText);\n    }\n}\nfunction lineRangeMappingFromRangeMappings(alignments, originalLines, modifiedLines, dontAssertStartLine = false) {\n    const changes = [];\n    for (const g of groupAdjacentBy(alignments.map(a => getLineRangeMapping(a, originalLines, modifiedLines)), (a1, a2) => a1.original.intersectsOrTouches(a2.original)\n        || a1.modified.intersectsOrTouches(a2.modified))) {\n        const first = g[0];\n        const last = g[g.length - 1];\n        changes.push(new DetailedLineRangeMapping(first.original.join(last.original), first.modified.join(last.modified), g.map(a => a.innerChanges[0])));\n    }\n    assertFn(() => {\n        if (!dontAssertStartLine && changes.length > 0) {\n            if (changes[0].modified.startLineNumber !== changes[0].original.startLineNumber) {\n                return false;\n            }\n            if (modifiedLines.length.lineCount - changes[changes.length - 1].modified.endLineNumberExclusive !== originalLines.length.lineCount - changes[changes.length - 1].original.endLineNumberExclusive) {\n                return false;\n            }\n        }\n        return checkAdjacentItems(changes, (m1, m2) => m2.original.startLineNumber - m1.original.endLineNumberExclusive === m2.modified.startLineNumber - m1.modified.endLineNumberExclusive &&\n            // There has to be an unchanged line in between (otherwise both diffs should have been joined)\n            m1.original.endLineNumberExclusive < m2.original.startLineNumber &&\n            m1.modified.endLineNumberExclusive < m2.modified.startLineNumber);\n    });\n    return changes;\n}\nfunction getLineRangeMapping(rangeMapping, originalLines, modifiedLines) {\n    let lineStartDelta = 0;\n    let lineEndDelta = 0;\n    // rangeMapping describes the edit that replaces `rangeMapping.originalRange` with `newText := getText(modifiedLines, rangeMapping.modifiedRange)`.\n    // original: ]xxx \\n <- this line is not modified\n    // modified: ]xx  \\n\n    if (rangeMapping.modifiedRange.endColumn === 1 && rangeMapping.originalRange.endColumn === 1\n        && rangeMapping.originalRange.startLineNumber + lineStartDelta <= rangeMapping.originalRange.endLineNumber\n        && rangeMapping.modifiedRange.startLineNumber + lineStartDelta <= rangeMapping.modifiedRange.endLineNumber) {\n        // We can only do this if the range is not empty yet\n        lineEndDelta = -1;\n    }\n    // original: xxx[ \\n <- this line is not modified\n    // modified: xxx[ \\n\n    if (rangeMapping.modifiedRange.startColumn - 1 >= modifiedLines.getLineLength(rangeMapping.modifiedRange.startLineNumber)\n        && rangeMapping.originalRange.startColumn - 1 >= originalLines.getLineLength(rangeMapping.originalRange.startLineNumber)\n        && rangeMapping.originalRange.startLineNumber <= rangeMapping.originalRange.endLineNumber + lineEndDelta\n        && rangeMapping.modifiedRange.startLineNumber <= rangeMapping.modifiedRange.endLineNumber + lineEndDelta) {\n        // We can only do this if the range is not empty yet\n        lineStartDelta = 1;\n    }\n    const originalLineRange = new LineRange(rangeMapping.originalRange.startLineNumber + lineStartDelta, rangeMapping.originalRange.endLineNumber + 1 + lineEndDelta);\n    const modifiedLineRange = new LineRange(rangeMapping.modifiedRange.startLineNumber + lineStartDelta, rangeMapping.modifiedRange.endLineNumber + 1 + lineEndDelta);\n    return new DetailedLineRangeMapping(originalLineRange, modifiedLineRange, [rangeMapping]);\n}\n\nexport { DetailedLineRangeMapping, LineRangeMapping, RangeMapping, getLineRangeMapping, lineRangeMappingFromRangeMappings };\n","import { LcsDiff } from '../../../base/common/diff/diff.js';\nimport { LinesDiff } from './linesDiffComputer.js';\nimport { DetailedLineRangeMapping, RangeMapping } from './rangeMapping.js';\nimport { firstNonWhitespaceIndex, lastNonWhitespaceIndex } from '../../../base/common/strings.js';\nimport { Range } from '../core/range.js';\nimport { assertFn, checkAdjacentItems } from '../../../base/common/assert.js';\nimport { LineRange } from '../core/ranges/lineRange.js';\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 *--------------------------------------------------------------------------------------------*/\nconst MINIMUM_MATCHING_CHARACTER_LENGTH = 3;\nclass LegacyLinesDiffComputer {\n    computeDiff(originalLines, modifiedLines, options) {\n        const diffComputer = new DiffComputer(originalLines, modifiedLines, {\n            maxComputationTime: options.maxComputationTimeMs,\n            shouldIgnoreTrimWhitespace: options.ignoreTrimWhitespace,\n            shouldComputeCharChanges: true,\n            shouldMakePrettyDiff: true,\n            shouldPostProcessCharChanges: true,\n        });\n        const result = diffComputer.computeDiff();\n        const changes = [];\n        let lastChange = null;\n        for (const c of result.changes) {\n            let originalRange;\n            if (c.originalEndLineNumber === 0) {\n                // Insertion\n                originalRange = new LineRange(c.originalStartLineNumber + 1, c.originalStartLineNumber + 1);\n            }\n            else {\n                originalRange = new LineRange(c.originalStartLineNumber, c.originalEndLineNumber + 1);\n            }\n            let modifiedRange;\n            if (c.modifiedEndLineNumber === 0) {\n                // Deletion\n                modifiedRange = new LineRange(c.modifiedStartLineNumber + 1, c.modifiedStartLineNumber + 1);\n            }\n            else {\n                modifiedRange = new LineRange(c.modifiedStartLineNumber, c.modifiedEndLineNumber + 1);\n            }\n            let change = new DetailedLineRangeMapping(originalRange, modifiedRange, c.charChanges?.map(c => new RangeMapping(new Range(c.originalStartLineNumber, c.originalStartColumn, c.originalEndLineNumber, c.originalEndColumn), new Range(c.modifiedStartLineNumber, c.modifiedStartColumn, c.modifiedEndLineNumber, c.modifiedEndColumn))));\n            if (lastChange) {\n                if (lastChange.modified.endLineNumberExclusive === change.modified.startLineNumber\n                    || lastChange.original.endLineNumberExclusive === change.original.startLineNumber) {\n                    // join touching diffs. Probably moving diffs up/down in the algorithm causes touching diffs.\n                    change = new DetailedLineRangeMapping(lastChange.original.join(change.original), lastChange.modified.join(change.modified), lastChange.innerChanges && change.innerChanges ?\n                        lastChange.innerChanges.concat(change.innerChanges) : undefined);\n                    changes.pop();\n                }\n            }\n            changes.push(change);\n            lastChange = change;\n        }\n        assertFn(() => {\n            return checkAdjacentItems(changes, (m1, m2) => m2.original.startLineNumber - m1.original.endLineNumberExclusive === m2.modified.startLineNumber - m1.modified.endLineNumberExclusive &&\n                // There has to be an unchanged line in between (otherwise both diffs should have been joined)\n                m1.original.endLineNumberExclusive < m2.original.startLineNumber &&\n                m1.modified.endLineNumberExclusive < m2.modified.startLineNumber);\n        });\n        return new LinesDiff(changes, [], result.quitEarly);\n    }\n}\nfunction computeDiff(originalSequence, modifiedSequence, continueProcessingPredicate, pretty) {\n    const diffAlgo = new LcsDiff(originalSequence, modifiedSequence, continueProcessingPredicate);\n    return diffAlgo.ComputeDiff(pretty);\n}\nclass LineSequence {\n    constructor(lines) {\n        const startColumns = [];\n        const endColumns = [];\n        for (let i = 0, length = lines.length; i < length; i++) {\n            startColumns[i] = getFirstNonBlankColumn(lines[i], 1);\n            endColumns[i] = getLastNonBlankColumn(lines[i], 1);\n        }\n        this.lines = lines;\n        this._startColumns = startColumns;\n        this._endColumns = endColumns;\n    }\n    getElements() {\n        const elements = [];\n        for (let i = 0, len = this.lines.length; i < len; i++) {\n            elements[i] = this.lines[i].substring(this._startColumns[i] - 1, this._endColumns[i] - 1);\n        }\n        return elements;\n    }\n    getStrictElement(index) {\n        return this.lines[index];\n    }\n    getStartLineNumber(i) {\n        return i + 1;\n    }\n    getEndLineNumber(i) {\n        return i + 1;\n    }\n    createCharSequence(shouldIgnoreTrimWhitespace, startIndex, endIndex) {\n        const charCodes = [];\n        const lineNumbers = [];\n        const columns = [];\n        let len = 0;\n        for (let index = startIndex; index <= endIndex; index++) {\n            const lineContent = this.lines[index];\n            const startColumn = (shouldIgnoreTrimWhitespace ? this._startColumns[index] : 1);\n            const endColumn = (shouldIgnoreTrimWhitespace ? this._endColumns[index] : lineContent.length + 1);\n            for (let col = startColumn; col < endColumn; col++) {\n                charCodes[len] = lineContent.charCodeAt(col - 1);\n                lineNumbers[len] = index + 1;\n                columns[len] = col;\n                len++;\n            }\n            if (!shouldIgnoreTrimWhitespace && index < endIndex) {\n                // Add \\n if trim whitespace is not ignored\n                charCodes[len] = 10 /* CharCode.LineFeed */;\n                lineNumbers[len] = index + 1;\n                columns[len] = lineContent.length + 1;\n                len++;\n            }\n        }\n        return new CharSequence(charCodes, lineNumbers, columns);\n    }\n}\nclass CharSequence {\n    constructor(charCodes, lineNumbers, columns) {\n        this._charCodes = charCodes;\n        this._lineNumbers = lineNumbers;\n        this._columns = columns;\n    }\n    toString() {\n        return ('[' + this._charCodes.map((s, idx) => (s === 10 /* CharCode.LineFeed */ ? '\\\\n' : String.fromCharCode(s)) + `-(${this._lineNumbers[idx]},${this._columns[idx]})`).join(', ') + ']');\n    }\n    _assertIndex(index, arr) {\n        if (index < 0 || index >= arr.length) {\n            throw new Error(`Illegal index`);\n        }\n    }\n    getElements() {\n        return this._charCodes;\n    }\n    getStartLineNumber(i) {\n        if (i > 0 && i === this._lineNumbers.length) {\n            // the start line number of the element after the last element\n            // is the end line number of the last element\n            return this.getEndLineNumber(i - 1);\n        }\n        this._assertIndex(i, this._lineNumbers);\n        return this._lineNumbers[i];\n    }\n    getEndLineNumber(i) {\n        if (i === -1) {\n            // the end line number of the element before the first element\n            // is the start line number of the first element\n            return this.getStartLineNumber(i + 1);\n        }\n        this._assertIndex(i, this._lineNumbers);\n        if (this._charCodes[i] === 10 /* CharCode.LineFeed */) {\n            return this._lineNumbers[i] + 1;\n        }\n        return this._lineNumbers[i];\n    }\n    getStartColumn(i) {\n        if (i > 0 && i === this._columns.length) {\n            // the start column of the element after the last element\n            // is the end column of the last element\n            return this.getEndColumn(i - 1);\n        }\n        this._assertIndex(i, this._columns);\n        return this._columns[i];\n    }\n    getEndColumn(i) {\n        if (i === -1) {\n            // the end column of the element before the first element\n            // is the start column of the first element\n            return this.getStartColumn(i + 1);\n        }\n        this._assertIndex(i, this._columns);\n        if (this._charCodes[i] === 10 /* CharCode.LineFeed */) {\n            return 1;\n        }\n        return this._columns[i] + 1;\n    }\n}\nclass CharChange {\n    constructor(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn) {\n        this.originalStartLineNumber = originalStartLineNumber;\n        this.originalStartColumn = originalStartColumn;\n        this.originalEndLineNumber = originalEndLineNumber;\n        this.originalEndColumn = originalEndColumn;\n        this.modifiedStartLineNumber = modifiedStartLineNumber;\n        this.modifiedStartColumn = modifiedStartColumn;\n        this.modifiedEndLineNumber = modifiedEndLineNumber;\n        this.modifiedEndColumn = modifiedEndColumn;\n    }\n    static createFromDiffChange(diffChange, originalCharSequence, modifiedCharSequence) {\n        const originalStartLineNumber = originalCharSequence.getStartLineNumber(diffChange.originalStart);\n        const originalStartColumn = originalCharSequence.getStartColumn(diffChange.originalStart);\n        const originalEndLineNumber = originalCharSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);\n        const originalEndColumn = originalCharSequence.getEndColumn(diffChange.originalStart + diffChange.originalLength - 1);\n        const modifiedStartLineNumber = modifiedCharSequence.getStartLineNumber(diffChange.modifiedStart);\n        const modifiedStartColumn = modifiedCharSequence.getStartColumn(diffChange.modifiedStart);\n        const modifiedEndLineNumber = modifiedCharSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n        const modifiedEndColumn = modifiedCharSequence.getEndColumn(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n        return new CharChange(originalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn, modifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn);\n    }\n}\nfunction postProcessCharChanges(rawChanges) {\n    if (rawChanges.length <= 1) {\n        return rawChanges;\n    }\n    const result = [rawChanges[0]];\n    let prevChange = result[0];\n    for (let i = 1, len = rawChanges.length; i < len; i++) {\n        const currChange = rawChanges[i];\n        const originalMatchingLength = currChange.originalStart - (prevChange.originalStart + prevChange.originalLength);\n        const modifiedMatchingLength = currChange.modifiedStart - (prevChange.modifiedStart + prevChange.modifiedLength);\n        // Both of the above should be equal, but the continueProcessingPredicate may prevent this from being true\n        const matchingLength = Math.min(originalMatchingLength, modifiedMatchingLength);\n        if (matchingLength < MINIMUM_MATCHING_CHARACTER_LENGTH) {\n            // Merge the current change into the previous one\n            prevChange.originalLength = (currChange.originalStart + currChange.originalLength) - prevChange.originalStart;\n            prevChange.modifiedLength = (currChange.modifiedStart + currChange.modifiedLength) - prevChange.modifiedStart;\n        }\n        else {\n            // Add the current change\n            result.push(currChange);\n            prevChange = currChange;\n        }\n    }\n    return result;\n}\nclass LineChange {\n    constructor(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges) {\n        this.originalStartLineNumber = originalStartLineNumber;\n        this.originalEndLineNumber = originalEndLineNumber;\n        this.modifiedStartLineNumber = modifiedStartLineNumber;\n        this.modifiedEndLineNumber = modifiedEndLineNumber;\n        this.charChanges = charChanges;\n    }\n    static createFromDiffResult(shouldIgnoreTrimWhitespace, diffChange, originalLineSequence, modifiedLineSequence, continueCharDiff, shouldComputeCharChanges, shouldPostProcessCharChanges) {\n        let originalStartLineNumber;\n        let originalEndLineNumber;\n        let modifiedStartLineNumber;\n        let modifiedEndLineNumber;\n        let charChanges = undefined;\n        if (diffChange.originalLength === 0) {\n            originalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart) - 1;\n            originalEndLineNumber = 0;\n        }\n        else {\n            originalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart);\n            originalEndLineNumber = originalLineSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);\n        }\n        if (diffChange.modifiedLength === 0) {\n            modifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart) - 1;\n            modifiedEndLineNumber = 0;\n        }\n        else {\n            modifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart);\n            modifiedEndLineNumber = modifiedLineSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);\n        }\n        if (shouldComputeCharChanges && diffChange.originalLength > 0 && diffChange.originalLength < 20 && diffChange.modifiedLength > 0 && diffChange.modifiedLength < 20 && continueCharDiff()) {\n            // Compute character changes for diff chunks of at most 20 lines...\n            const originalCharSequence = originalLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.originalStart, diffChange.originalStart + diffChange.originalLength - 1);\n            const modifiedCharSequence = modifiedLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.modifiedStart, diffChange.modifiedStart + diffChange.modifiedLength - 1);\n            if (originalCharSequence.getElements().length > 0 && modifiedCharSequence.getElements().length > 0) {\n                let rawChanges = computeDiff(originalCharSequence, modifiedCharSequence, continueCharDiff, true).changes;\n                if (shouldPostProcessCharChanges) {\n                    rawChanges = postProcessCharChanges(rawChanges);\n                }\n                charChanges = [];\n                for (let i = 0, length = rawChanges.length; i < length; i++) {\n                    charChanges.push(CharChange.createFromDiffChange(rawChanges[i], originalCharSequence, modifiedCharSequence));\n                }\n            }\n        }\n        return new LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges);\n    }\n}\nclass DiffComputer {\n    constructor(originalLines, modifiedLines, opts) {\n        this.shouldComputeCharChanges = opts.shouldComputeCharChanges;\n        this.shouldPostProcessCharChanges = opts.shouldPostProcessCharChanges;\n        this.shouldIgnoreTrimWhitespace = opts.shouldIgnoreTrimWhitespace;\n        this.shouldMakePrettyDiff = opts.shouldMakePrettyDiff;\n        this.originalLines = originalLines;\n        this.modifiedLines = modifiedLines;\n        this.original = new LineSequence(originalLines);\n        this.modified = new LineSequence(modifiedLines);\n        this.continueLineDiff = createContinueProcessingPredicate(opts.maxComputationTime);\n        this.continueCharDiff = createContinueProcessingPredicate(opts.maxComputationTime === 0 ? 0 : Math.min(opts.maxComputationTime, 5000)); // never run after 5s for character changes...\n    }\n    computeDiff() {\n        if (this.original.lines.length === 1 && this.original.lines[0].length === 0) {\n            // empty original => fast path\n            if (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) {\n                return {\n                    quitEarly: false,\n                    changes: []\n                };\n            }\n            return {\n                quitEarly: false,\n                changes: [{\n                        originalStartLineNumber: 1,\n                        originalEndLineNumber: 1,\n                        modifiedStartLineNumber: 1,\n                        modifiedEndLineNumber: this.modified.lines.length,\n                        charChanges: undefined\n                    }]\n            };\n        }\n        if (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) {\n            // empty modified => fast path\n            return {\n                quitEarly: false,\n                changes: [{\n                        originalStartLineNumber: 1,\n                        originalEndLineNumber: this.original.lines.length,\n                        modifiedStartLineNumber: 1,\n                        modifiedEndLineNumber: 1,\n                        charChanges: undefined\n                    }]\n            };\n        }\n        const diffResult = computeDiff(this.original, this.modified, this.continueLineDiff, this.shouldMakePrettyDiff);\n        const rawChanges = diffResult.changes;\n        const quitEarly = diffResult.quitEarly;\n        // The diff is always computed with ignoring trim whitespace\n        // This ensures we get the prettiest diff\n        if (this.shouldIgnoreTrimWhitespace) {\n            const lineChanges = [];\n            for (let i = 0, length = rawChanges.length; i < length; i++) {\n                lineChanges.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, rawChanges[i], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));\n            }\n            return {\n                quitEarly: quitEarly,\n                changes: lineChanges\n            };\n        }\n        // Need to post-process and introduce changes where the trim whitespace is different\n        // Note that we are looping starting at -1 to also cover the lines before the first change\n        const result = [];\n        let originalLineIndex = 0;\n        let modifiedLineIndex = 0;\n        for (let i = -1 /* !!!! */, len = rawChanges.length; i < len; i++) {\n            const nextChange = (i + 1 < len ? rawChanges[i + 1] : null);\n            const originalStop = (nextChange ? nextChange.originalStart : this.originalLines.length);\n            const modifiedStop = (nextChange ? nextChange.modifiedStart : this.modifiedLines.length);\n            while (originalLineIndex < originalStop && modifiedLineIndex < modifiedStop) {\n                const originalLine = this.originalLines[originalLineIndex];\n                const modifiedLine = this.modifiedLines[modifiedLineIndex];\n                if (originalLine !== modifiedLine) {\n                    // These lines differ only in trim whitespace\n                    // Check the leading whitespace\n                    {\n                        let originalStartColumn = getFirstNonBlankColumn(originalLine, 1);\n                        let modifiedStartColumn = getFirstNonBlankColumn(modifiedLine, 1);\n                        while (originalStartColumn > 1 && modifiedStartColumn > 1) {\n                            const originalChar = originalLine.charCodeAt(originalStartColumn - 2);\n                            const modifiedChar = modifiedLine.charCodeAt(modifiedStartColumn - 2);\n                            if (originalChar !== modifiedChar) {\n                                break;\n                            }\n                            originalStartColumn--;\n                            modifiedStartColumn--;\n                        }\n                        if (originalStartColumn > 1 || modifiedStartColumn > 1) {\n                            this._pushTrimWhitespaceCharChange(result, originalLineIndex + 1, 1, originalStartColumn, modifiedLineIndex + 1, 1, modifiedStartColumn);\n                        }\n                    }\n                    // Check the trailing whitespace\n                    {\n                        let originalEndColumn = getLastNonBlankColumn(originalLine, 1);\n                        let modifiedEndColumn = getLastNonBlankColumn(modifiedLine, 1);\n                        const originalMaxColumn = originalLine.length + 1;\n                        const modifiedMaxColumn = modifiedLine.length + 1;\n                        while (originalEndColumn < originalMaxColumn && modifiedEndColumn < modifiedMaxColumn) {\n                            const originalChar = originalLine.charCodeAt(originalEndColumn - 1);\n                            const modifiedChar = originalLine.charCodeAt(modifiedEndColumn - 1);\n                            if (originalChar !== modifiedChar) {\n                                break;\n                            }\n                            originalEndColumn++;\n                            modifiedEndColumn++;\n                        }\n                        if (originalEndColumn < originalMaxColumn || modifiedEndColumn < modifiedMaxColumn) {\n                            this._pushTrimWhitespaceCharChange(result, originalLineIndex + 1, originalEndColumn, originalMaxColumn, modifiedLineIndex + 1, modifiedEndColumn, modifiedMaxColumn);\n                        }\n                    }\n                }\n                originalLineIndex++;\n                modifiedLineIndex++;\n            }\n            if (nextChange) {\n                // Emit the actual change\n                result.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, nextChange, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));\n                originalLineIndex += nextChange.originalLength;\n                modifiedLineIndex += nextChange.modifiedLength;\n            }\n        }\n        return {\n            quitEarly: quitEarly,\n            changes: result\n        };\n    }\n    _pushTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) {\n        if (this._mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn)) {\n            // Merged into previous\n            return;\n        }\n        let charChanges = undefined;\n        if (this.shouldComputeCharChanges) {\n            charChanges = [new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn)];\n        }\n        result.push(new LineChange(originalLineNumber, originalLineNumber, modifiedLineNumber, modifiedLineNumber, charChanges));\n    }\n    _mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn) {\n        const len = result.length;\n        if (len === 0) {\n            return false;\n        }\n        const prevChange = result[len - 1];\n        if (prevChange.originalEndLineNumber === 0 || prevChange.modifiedEndLineNumber === 0) {\n            // Don't merge with inserts/deletes\n            return false;\n        }\n        if (prevChange.originalEndLineNumber === originalLineNumber && prevChange.modifiedEndLineNumber === modifiedLineNumber) {\n            if (this.shouldComputeCharChanges && prevChange.charChanges) {\n                prevChange.charChanges.push(new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn));\n            }\n            return true;\n        }\n        if (prevChange.originalEndLineNumber + 1 === originalLineNumber && prevChange.modifiedEndLineNumber + 1 === modifiedLineNumber) {\n            prevChange.originalEndLineNumber = originalLineNumber;\n            prevChange.modifiedEndLineNumber = modifiedLineNumber;\n            if (this.shouldComputeCharChanges && prevChange.charChanges) {\n                prevChange.charChanges.push(new CharChange(originalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn));\n            }\n            return true;\n        }\n        return false;\n    }\n}\nfunction getFirstNonBlankColumn(txt, defaultValue) {\n    const r = firstNonWhitespaceIndex(txt);\n    if (r === -1) {\n        return defaultValue;\n    }\n    return r + 1;\n}\nfunction getLastNonBlankColumn(txt, defaultValue) {\n    const r = lastNonWhitespaceIndex(txt);\n    if (r === -1) {\n        return defaultValue;\n    }\n    return r + 2;\n}\nfunction createContinueProcessingPredicate(maximumRuntime) {\n    if (maximumRuntime === 0) {\n        return () => true;\n    }\n    const startTime = Date.now();\n    return () => {\n        return Date.now() - startTime < maximumRuntime;\n    };\n}\n\nexport { DiffComputer, LegacyLinesDiffComputer };\n","import { forEachAdjacent } from '../../../../../base/common/arrays.js';\nimport { BugIndicatingError } from '../../../../../base/common/errors.js';\nimport { OffsetRange } from '../../../core/ranges/offsetRange.js';\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 *--------------------------------------------------------------------------------------------*/\nclass DiffAlgorithmResult {\n    static trivial(seq1, seq2) {\n        return new DiffAlgorithmResult([new SequenceDiff(OffsetRange.ofLength(seq1.length), OffsetRange.ofLength(seq2.length))], false);\n    }\n    static trivialTimedOut(seq1, seq2) {\n        return new DiffAlgorithmResult([new SequenceDiff(OffsetRange.ofLength(seq1.length), OffsetRange.ofLength(seq2.length))], true);\n    }\n    constructor(diffs, \n    /**\n     * Indicates if the time out was reached.\n     * In that case, the diffs might be an approximation and the user should be asked to rerun the diff with more time.\n     */\n    hitTimeout) {\n        this.diffs = diffs;\n        this.hitTimeout = hitTimeout;\n    }\n}\nclass SequenceDiff {\n    static invert(sequenceDiffs, doc1Length) {\n        const result = [];\n        forEachAdjacent(sequenceDiffs, (a, b) => {\n            result.push(SequenceDiff.fromOffsetPairs(a ? a.getEndExclusives() : OffsetPair.zero, b ? b.getStarts() : new OffsetPair(doc1Length, (a ? a.seq2Range.endExclusive - a.seq1Range.endExclusive : 0) + doc1Length)));\n        });\n        return result;\n    }\n    static fromOffsetPairs(start, endExclusive) {\n        return new SequenceDiff(new OffsetRange(start.offset1, endExclusive.offset1), new OffsetRange(start.offset2, endExclusive.offset2));\n    }\n    static assertSorted(sequenceDiffs) {\n        let last = undefined;\n        for (const cur of sequenceDiffs) {\n            if (last) {\n                if (!(last.seq1Range.endExclusive <= cur.seq1Range.start && last.seq2Range.endExclusive <= cur.seq2Range.start)) {\n                    throw new BugIndicatingError('Sequence diffs must be sorted');\n                }\n            }\n            last = cur;\n        }\n    }\n    constructor(seq1Range, seq2Range) {\n        this.seq1Range = seq1Range;\n        this.seq2Range = seq2Range;\n    }\n    swap() {\n        return new SequenceDiff(this.seq2Range, this.seq1Range);\n    }\n    toString() {\n        return `${this.seq1Range} <-> ${this.seq2Range}`;\n    }\n    join(other) {\n        return new SequenceDiff(this.seq1Range.join(other.seq1Range), this.seq2Range.join(other.seq2Range));\n    }\n    delta(offset) {\n        if (offset === 0) {\n            return this;\n        }\n        return new SequenceDiff(this.seq1Range.delta(offset), this.seq2Range.delta(offset));\n    }\n    deltaStart(offset) {\n        if (offset === 0) {\n            return this;\n        }\n        return new SequenceDiff(this.seq1Range.deltaStart(offset), this.seq2Range.deltaStart(offset));\n    }\n    deltaEnd(offset) {\n        if (offset === 0) {\n            return this;\n        }\n        return new SequenceDiff(this.seq1Range.deltaEnd(offset), this.seq2Range.deltaEnd(offset));\n    }\n    intersect(other) {\n        const i1 = this.seq1Range.intersect(other.seq1Range);\n        const i2 = this.seq2Range.intersect(other.seq2Range);\n        if (!i1 || !i2) {\n            return undefined;\n        }\n        return new SequenceDiff(i1, i2);\n    }\n    getStarts() {\n        return new OffsetPair(this.seq1Range.start, this.seq2Range.start);\n    }\n    getEndExclusives() {\n        return new OffsetPair(this.seq1Range.endExclusive, this.seq2Range.endExclusive);\n    }\n}\nclass OffsetPair {\n    static { this.zero = new OffsetPair(0, 0); }\n    static { this.max = new OffsetPair(Number.MAX_SAFE_INTEGER, Number.MAX_SAFE_INTEGER); }\n    constructor(offset1, offset2) {\n        this.offset1 = offset1;\n        this.offset2 = offset2;\n    }\n    toString() {\n        return `${this.offset1} <-> ${this.offset2}`;\n    }\n    delta(offset) {\n        if (offset === 0) {\n            return this;\n        }\n        return new OffsetPair(this.offset1 + offset, this.offset2 + offset);\n    }\n    equals(other) {\n        return this.offset1 === other.offset1 && this.offset2 === other.offset2;\n    }\n}\nclass InfiniteTimeout {\n    static { this.instance = new InfiniteTimeout(); }\n    isValid() {\n        return true;\n    }\n}\nclass DateTimeout {\n    constructor(timeout) {\n        this.timeout = timeout;\n        this.startTime = Date.now();\n        this.valid = true;\n        if (timeout <= 0) {\n            throw new BugIndicatingError('timeout must be positive');\n        }\n    }\n    // Recommendation: Set a log-point `{this.disable()}` in the body\n    isValid() {\n        const valid = Date.now() - this.startTime < this.timeout;\n        if (!valid && this.valid) {\n            this.valid = false; // timeout reached\n        }\n        return this.valid;\n    }\n}\n\nexport { DateTimeout, DiffAlgorithmResult, InfiniteTimeout, OffsetPair, SequenceDiff };\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 *--------------------------------------------------------------------------------------------*/\nclass Array2D {\n    constructor(width, height) {\n        this.width = width;\n        this.height = height;\n        this.array = [];\n        this.array = new Array(width * height);\n    }\n    get(x, y) {\n        return this.array[x + y * this.width];\n    }\n    set(x, y, value) {\n        this.array[x + y * this.width] = value;\n    }\n}\nfunction isSpace(charCode) {\n    return charCode === 32 /* CharCode.Space */ || charCode === 9 /* CharCode.Tab */;\n}\nclass LineRangeFragment {\n    static { this.chrKeys = new Map(); }\n    static getKey(chr) {\n        let key = this.chrKeys.get(chr);\n        if (key === undefined) {\n            key = this.chrKeys.size;\n            this.chrKeys.set(chr, key);\n        }\n        return key;\n    }\n    constructor(range, lines, source) {\n        this.range = range;\n        this.lines = lines;\n        this.source = source;\n        this.histogram = [];\n        let counter = 0;\n        for (let i = range.startLineNumber - 1; i < range.endLineNumberExclusive - 1; i++) {\n            const line = lines[i];\n            for (let j = 0; j < line.length; j++) {\n                counter++;\n                const chr = line[j];\n                const key = LineRangeFragment.getKey(chr);\n                this.histogram[key] = (this.histogram[key] || 0) + 1;\n            }\n            counter++;\n            const key = LineRangeFragment.getKey('\\n');\n            this.histogram[key] = (this.histogram[key] || 0) + 1;\n        }\n        this.totalCount = counter;\n    }\n    computeSimilarity(other) {\n        let sumDifferences = 0;\n        const maxLength = Math.max(this.histogram.length, other.histogram.length);\n        for (let i = 0; i < maxLength; i++) {\n            sumDifferences += Math.abs((this.histogram[i] ?? 0) - (other.histogram[i] ?? 0));\n        }\n        return 1 - (sumDifferences / (this.totalCount + other.totalCount));\n    }\n}\n\nexport { Array2D, LineRangeFragment, isSpace };\n","import { OffsetRange } from '../../../core/ranges/offsetRange.js';\nimport { InfiniteTimeout, DiffAlgorithmResult, SequenceDiff } from './diffAlgorithm.js';\nimport { Array2D } from '../utils.js';\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 * A O(MN) diffing algorithm that supports a score function.\n * The algorithm can be improved by processing the 2d array diagonally.\n*/\nclass DynamicProgrammingDiffing {\n    compute(sequence1, sequence2, timeout = InfiniteTimeout.instance, equalityScore) {\n        if (sequence1.length === 0 || sequence2.length === 0) {\n            return DiffAlgorithmResult.trivial(sequence1, sequence2);\n        }\n        /**\n         * lcsLengths.get(i, j): Length of the longest common subsequence of sequence1.substring(0, i + 1) and sequence2.substring(0, j + 1).\n         */\n        const lcsLengths = new Array2D(sequence1.length, sequence2.length);\n        const directions = new Array2D(sequence1.length, sequence2.length);\n        const lengths = new Array2D(sequence1.length, sequence2.length);\n        // ==== Initializing lcsLengths ====\n        for (let s1 = 0; s1 < sequence1.length; s1++) {\n            for (let s2 = 0; s2 < sequence2.length; s2++) {\n                if (!timeout.isValid()) {\n                    return DiffAlgorithmResult.trivialTimedOut(sequence1, sequence2);\n                }\n                const horizontalLen = s1 === 0 ? 0 : lcsLengths.get(s1 - 1, s2);\n                const verticalLen = s2 === 0 ? 0 : lcsLengths.get(s1, s2 - 1);\n                let extendedSeqScore;\n                if (sequence1.getElement(s1) === sequence2.getElement(s2)) {\n                    if (s1 === 0 || s2 === 0) {\n                        extendedSeqScore = 0;\n                    }\n                    else {\n                        extendedSeqScore = lcsLengths.get(s1 - 1, s2 - 1);\n                    }\n                    if (s1 > 0 && s2 > 0 && directions.get(s1 - 1, s2 - 1) === 3) {\n                        // Prefer consecutive diagonals\n                        extendedSeqScore += lengths.get(s1 - 1, s2 - 1);\n                    }\n                    extendedSeqScore += (equalityScore ? equalityScore(s1, s2) : 1);\n                }\n                else {\n                    extendedSeqScore = -1;\n                }\n                const newValue = Math.max(horizontalLen, verticalLen, extendedSeqScore);\n                if (newValue === extendedSeqScore) {\n                    // Prefer diagonals\n                    const prevLen = s1 > 0 && s2 > 0 ? lengths.get(s1 - 1, s2 - 1) : 0;\n                    lengths.set(s1, s2, prevLen + 1);\n                    directions.set(s1, s2, 3);\n                }\n                else if (newValue === horizontalLen) {\n                    lengths.set(s1, s2, 0);\n                    directions.set(s1, s2, 1);\n                }\n                else if (newValue === verticalLen) {\n                    lengths.set(s1, s2, 0);\n                    directions.set(s1, s2, 2);\n                }\n                lcsLengths.set(s1, s2, newValue);\n            }\n        }\n        // ==== Backtracking ====\n        const result = [];\n        let lastAligningPosS1 = sequence1.length;\n        let lastAligningPosS2 = sequence2.length;\n        function reportDecreasingAligningPositions(s1, s2) {\n            if (s1 + 1 !== lastAligningPosS1 || s2 + 1 !== lastAligningPosS2) {\n                result.push(new SequenceDiff(new OffsetRange(s1 + 1, lastAligningPosS1), new OffsetRange(s2 + 1, lastAligningPosS2)));\n            }\n            lastAligningPosS1 = s1;\n            lastAligningPosS2 = s2;\n        }\n        let s1 = sequence1.length - 1;\n        let s2 = sequence2.length - 1;\n        while (s1 >= 0 && s2 >= 0) {\n            if (directions.get(s1, s2) === 3) {\n                reportDecreasingAligningPositions(s1, s2);\n                s1--;\n                s2--;\n            }\n            else {\n                if (directions.get(s1, s2) === 1) {\n                    s1--;\n                }\n                else {\n                    s2--;\n                }\n            }\n        }\n        reportDecreasingAligningPositions(-1, -1);\n        result.reverse();\n        return new DiffAlgorithmResult(result, false);\n    }\n}\n\nexport { DynamicProgrammingDiffing };\n","import { OffsetRange } from '../../../core/ranges/offsetRange.js';\nimport { InfiniteTimeout, DiffAlgorithmResult, SequenceDiff } from './diffAlgorithm.js';\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 * An O(ND) diff algorithm that has a quadratic space worst-case complexity.\n*/\nclass MyersDiffAlgorithm {\n    compute(seq1, seq2, timeout = InfiniteTimeout.instance) {\n        // These are common special cases.\n        // The early return improves performance dramatically.\n        if (seq1.length === 0 || seq2.length === 0) {\n            return DiffAlgorithmResult.trivial(seq1, seq2);\n        }\n        const seqX = seq1; // Text on the x axis\n        const seqY = seq2; // Text on the y axis\n        function getXAfterSnake(x, y) {\n            while (x < seqX.length && y < seqY.length && seqX.getElement(x) === seqY.getElement(y)) {\n                x++;\n                y++;\n            }\n            return x;\n        }\n        let d = 0;\n        // V[k]: X value of longest d-line that ends in diagonal k.\n        // d-line: path from (0,0) to (x,y) that uses exactly d non-diagonals.\n        // diagonal k: Set of points (x,y) with x-y = k.\n        // k=1 -> (1,0),(2,1)\n        const V = new FastInt32Array();\n        V.set(0, getXAfterSnake(0, 0));\n        const paths = new FastArrayNegativeIndices();\n        paths.set(0, V.get(0) === 0 ? null : new SnakePath(null, 0, 0, V.get(0)));\n        let k = 0;\n        loop: while (true) {\n            d++;\n            if (!timeout.isValid()) {\n                return DiffAlgorithmResult.trivialTimedOut(seqX, seqY);\n            }\n            // The paper has `for (k = -d; k <= d; k += 2)`, but we can ignore diagonals that cannot influence the result.\n            const lowerBound = -Math.min(d, seqY.length + (d % 2));\n            const upperBound = Math.min(d, seqX.length + (d % 2));\n            for (k = lowerBound; k <= upperBound; k += 2) {\n                // We can use the X values of (d-1)-lines to compute X value of the longest d-lines.\n                const maxXofDLineTop = k === upperBound ? -1 : V.get(k + 1); // We take a vertical non-diagonal (add a symbol in seqX)\n                const maxXofDLineLeft = k === lowerBound ? -1 : V.get(k - 1) + 1; // We take a horizontal non-diagonal (+1 x) (delete a symbol in seqX)\n                const x = Math.min(Math.max(maxXofDLineTop, maxXofDLineLeft), seqX.length);\n                const y = x - k;\n                if (x > seqX.length || y > seqY.length) {\n                    // This diagonal is irrelevant for the result.\n                    // TODO: Don't pay the cost for this in the next iteration.\n                    continue;\n                }\n                const newMaxX = getXAfterSnake(x, y);\n                V.set(k, newMaxX);\n                const lastPath = x === maxXofDLineTop ? paths.get(k + 1) : paths.get(k - 1);\n                paths.set(k, newMaxX !== x ? new SnakePath(lastPath, x, y, newMaxX - x) : lastPath);\n                if (V.get(k) === seqX.length && V.get(k) - k === seqY.length) {\n                    break loop;\n                }\n            }\n        }\n        let path = paths.get(k);\n        const result = [];\n        let lastAligningPosS1 = seqX.length;\n        let lastAligningPosS2 = seqY.length;\n        while (true) {\n            const endX = path ? path.x + path.length : 0;\n            const endY = path ? path.y + path.length : 0;\n            if (endX !== lastAligningPosS1 || endY !== lastAligningPosS2) {\n                result.push(new SequenceDiff(new OffsetRange(endX, lastAligningPosS1), new OffsetRange(endY, lastAligningPosS2)));\n            }\n            if (!path) {\n                break;\n            }\n            lastAligningPosS1 = path.x;\n            lastAligningPosS2 = path.y;\n            path = path.prev;\n        }\n        result.reverse();\n        return new DiffAlgorithmResult(result, false);\n    }\n}\nclass SnakePath {\n    constructor(prev, x, y, length) {\n        this.prev = prev;\n        this.x = x;\n        this.y = y;\n        this.length = length;\n    }\n}\n/**\n * An array that supports fast negative indices.\n*/\nclass FastInt32Array {\n    constructor() {\n        this.positiveArr = new Int32Array(10);\n        this.negativeArr = new Int32Array(10);\n    }\n    get(idx) {\n        if (idx < 0) {\n            idx = -idx - 1;\n            return this.negativeArr[idx];\n        }\n        else {\n            return this.positiveArr[idx];\n        }\n    }\n    set(idx, value) {\n        if (idx < 0) {\n            idx = -idx - 1;\n            if (idx >= this.negativeArr.length) {\n                const arr = this.negativeArr;\n                this.negativeArr = new Int32Array(arr.length * 2);\n                this.negativeArr.set(arr);\n            }\n            this.negativeArr[idx] = value;\n        }\n        else {\n            if (idx >= this.positiveArr.length) {\n                const arr = this.positiveArr;\n                this.positiveArr = new Int32Array(arr.length * 2);\n                this.positiveArr.set(arr);\n            }\n            this.positiveArr[idx] = value;\n        }\n    }\n}\n/**\n * An array that supports fast negative indices.\n*/\nclass FastArrayNegativeIndices {\n    constructor() {\n        this.positiveArr = [];\n        this.negativeArr = [];\n    }\n    get(idx) {\n        if (idx < 0) {\n            idx = -idx - 1;\n            return this.negativeArr[idx];\n        }\n        else {\n            return this.positiveArr[idx];\n        }\n    }\n    set(idx, value) {\n        if (idx < 0) {\n            idx = -idx - 1;\n            this.negativeArr[idx] = value;\n        }\n        else {\n            this.positiveArr[idx] = value;\n        }\n    }\n}\n\nexport { MyersDiffAlgorithm };\n","import { findLastIdxMonotonous, findLastMonotonous, findFirstMonotonous } from '../../../../base/common/arraysFind.js';\nimport { OffsetRange } from '../../core/ranges/offsetRange.js';\nimport { Position } from '../../core/position.js';\nimport { Range } from '../../core/range.js';\nimport { isSpace } from './utils.js';\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 *--------------------------------------------------------------------------------------------*/\nclass LinesSliceCharSequence {\n    constructor(lines, range, considerWhitespaceChanges) {\n        this.lines = lines;\n        this.range = range;\n        this.considerWhitespaceChanges = considerWhitespaceChanges;\n        this.elements = [];\n        this.firstElementOffsetByLineIdx = [];\n        this.lineStartOffsets = [];\n        this.trimmedWsLengthsByLineIdx = [];\n        this.firstElementOffsetByLineIdx.push(0);\n        for (let lineNumber = this.range.startLineNumber; lineNumber <= this.range.endLineNumber; lineNumber++) {\n            let line = lines[lineNumber - 1];\n            let lineStartOffset = 0;\n            if (lineNumber === this.range.startLineNumber && this.range.startColumn > 1) {\n                lineStartOffset = this.range.startColumn - 1;\n                line = line.substring(lineStartOffset);\n            }\n            this.lineStartOffsets.push(lineStartOffset);\n            let trimmedWsLength = 0;\n            if (!considerWhitespaceChanges) {\n                const trimmedStartLine = line.trimStart();\n                trimmedWsLength = line.length - trimmedStartLine.length;\n                line = trimmedStartLine.trimEnd();\n            }\n            this.trimmedWsLengthsByLineIdx.push(trimmedWsLength);\n            const lineLength = lineNumber === this.range.endLineNumber ? Math.min(this.range.endColumn - 1 - lineStartOffset - trimmedWsLength, line.length) : line.length;\n            for (let i = 0; i < lineLength; i++) {\n                this.elements.push(line.charCodeAt(i));\n            }\n            if (lineNumber < this.range.endLineNumber) {\n                this.elements.push('\\n'.charCodeAt(0));\n                this.firstElementOffsetByLineIdx.push(this.elements.length);\n            }\n        }\n    }\n    toString() {\n        return `Slice: \"${this.text}\"`;\n    }\n    get text() {\n        return this.getText(new OffsetRange(0, this.length));\n    }\n    getText(range) {\n        return this.elements.slice(range.start, range.endExclusive).map(e => String.fromCharCode(e)).join('');\n    }\n    getElement(offset) {\n        return this.elements[offset];\n    }\n    get length() {\n        return this.elements.length;\n    }\n    getBoundaryScore(length) {\n        //   a   b   c   ,           d   e   f\n        // 11  0   0   12  15  6   13  0   0   11\n        const prevCategory = getCategory(length > 0 ? this.elements[length - 1] : -1);\n        const nextCategory = getCategory(length < this.elements.length ? this.elements[length] : -1);\n        if (prevCategory === 7 /* CharBoundaryCategory.LineBreakCR */ && nextCategory === 8 /* CharBoundaryCategory.LineBreakLF */) {\n            // don't break between \\r and \\n\n            return 0;\n        }\n        if (prevCategory === 8 /* CharBoundaryCategory.LineBreakLF */) {\n            // prefer the linebreak before the change\n            return 150;\n        }\n        let score = 0;\n        if (prevCategory !== nextCategory) {\n            score += 10;\n            if (prevCategory === 0 /* CharBoundaryCategory.WordLower */ && nextCategory === 1 /* CharBoundaryCategory.WordUpper */) {\n                score += 1;\n            }\n        }\n        score += getCategoryBoundaryScore(prevCategory);\n        score += getCategoryBoundaryScore(nextCategory);\n        return score;\n    }\n    translateOffset(offset, preference = 'right') {\n        // find smallest i, so that lineBreakOffsets[i] <= offset using binary search\n        const i = findLastIdxMonotonous(this.firstElementOffsetByLineIdx, (value) => value <= offset);\n        const lineOffset = offset - this.firstElementOffsetByLineIdx[i];\n        return new Position(this.range.startLineNumber + i, 1 + this.lineStartOffsets[i] + lineOffset + ((lineOffset === 0 && preference === 'left') ? 0 : this.trimmedWsLengthsByLineIdx[i]));\n    }\n    translateRange(range) {\n        const pos1 = this.translateOffset(range.start, 'right');\n        const pos2 = this.translateOffset(range.endExclusive, 'left');\n        if (pos2.isBefore(pos1)) {\n            return Range.fromPositions(pos2, pos2);\n        }\n        return Range.fromPositions(pos1, pos2);\n    }\n    /**\n     * Finds the word that contains the character at the given offset\n     */\n    findWordContaining(offset) {\n        if (offset < 0 || offset >= this.elements.length) {\n            return undefined;\n        }\n        if (!isWordChar(this.elements[offset])) {\n            return undefined;\n        }\n        // find start\n        let start = offset;\n        while (start > 0 && isWordChar(this.elements[start - 1])) {\n            start--;\n        }\n        // find end\n        let end = offset;\n        while (end < this.elements.length && isWordChar(this.elements[end])) {\n            end++;\n        }\n        return new OffsetRange(start, end);\n    }\n    /** fooBar has the two sub-words foo and bar */\n    findSubWordContaining(offset) {\n        if (offset < 0 || offset >= this.elements.length) {\n            return undefined;\n        }\n        if (!isWordChar(this.elements[offset])) {\n            return undefined;\n        }\n        // find start\n        let start = offset;\n        while (start > 0 && isWordChar(this.elements[start - 1]) && !isUpperCase(this.elements[start])) {\n            start--;\n        }\n        // find end\n        let end = offset;\n        while (end < this.elements.length && isWordChar(this.elements[end]) && !isUpperCase(this.elements[end])) {\n            end++;\n        }\n        return new OffsetRange(start, end);\n    }\n    countLinesIn(range) {\n        return this.translateOffset(range.endExclusive).lineNumber - this.translateOffset(range.start).lineNumber;\n    }\n    isStronglyEqual(offset1, offset2) {\n        return this.elements[offset1] === this.elements[offset2];\n    }\n    extendToFullLines(range) {\n        const start = findLastMonotonous(this.firstElementOffsetByLineIdx, x => x <= range.start) ?? 0;\n        const end = findFirstMonotonous(this.firstElementOffsetByLineIdx, x => range.endExclusive <= x) ?? this.elements.length;\n        return new OffsetRange(start, end);\n    }\n}\nfunction isWordChar(charCode) {\n    return charCode >= 97 /* CharCode.a */ && charCode <= 122 /* CharCode.z */\n        || charCode >= 65 /* CharCode.A */ && charCode <= 90 /* CharCode.Z */\n        || charCode >= 48 /* CharCode.Digit0 */ && charCode <= 57 /* CharCode.Digit9 */;\n}\nfunction isUpperCase(charCode) {\n    return charCode >= 65 /* CharCode.A */ && charCode <= 90 /* CharCode.Z */;\n}\nconst score = {\n    [0 /* CharBoundaryCategory.WordLower */]: 0,\n    [1 /* CharBoundaryCategory.WordUpper */]: 0,\n    [2 /* CharBoundaryCategory.WordNumber */]: 0,\n    [3 /* CharBoundaryCategory.End */]: 10,\n    [4 /* CharBoundaryCategory.Other */]: 2,\n    [5 /* CharBoundaryCategory.Separator */]: 30,\n    [6 /* CharBoundaryCategory.Space */]: 3,\n    [7 /* CharBoundaryCategory.LineBreakCR */]: 10,\n    [8 /* CharBoundaryCategory.LineBreakLF */]: 10,\n};\nfunction getCategoryBoundaryScore(category) {\n    return score[category];\n}\nfunction getCategory(charCode) {\n    if (charCode === 10 /* CharCode.LineFeed */) {\n        return 8 /* CharBoundaryCategory.LineBreakLF */;\n    }\n    else if (charCode === 13 /* CharCode.CarriageReturn */) {\n        return 7 /* CharBoundaryCategory.LineBreakCR */;\n    }\n    else if (isSpace(charCode)) {\n        return 6 /* CharBoundaryCategory.Space */;\n    }\n    else if (charCode >= 97 /* CharCode.a */ && charCode <= 122 /* CharCode.z */) {\n        return 0 /* CharBoundaryCategory.WordLower */;\n    }\n    else if (charCode >= 65 /* CharCode.A */ && charCode <= 90 /* CharCode.Z */) {\n        return 1 /* CharBoundaryCategory.WordUpper */;\n    }\n    else if (charCode >= 48 /* CharCode.Digit0 */ && charCode <= 57 /* CharCode.Digit9 */) {\n        return 2 /* CharBoundaryCategory.WordNumber */;\n    }\n    else if (charCode === -1) {\n        return 3 /* CharBoundaryCategory.End */;\n    }\n    else if (charCode === 44 /* CharCode.Comma */ || charCode === 59 /* CharCode.Semicolon */) {\n        return 5 /* CharBoundaryCategory.Separator */;\n    }\n    else {\n        return 4 /* CharBoundaryCategory.Other */;\n    }\n}\n\nexport { LinesSliceCharSequence };\n","import { SequenceDiff } from './algorithms/diffAlgorithm.js';\nimport { LineRangeMapping } from '../rangeMapping.js';\nimport { pushMany, compareBy, numberComparator, reverseOrder } from '../../../../base/common/arrays.js';\nimport { MonotonousArray, findLastMonotonous } from '../../../../base/common/arraysFind.js';\nimport { SetMap } from '../../../../base/common/map.js';\nimport { LineRange, LineRangeSet } from '../../core/ranges/lineRange.js';\nimport { LinesSliceCharSequence } from './linesSliceCharSequence.js';\nimport { LineRangeFragment, isSpace } from './utils.js';\nimport { MyersDiffAlgorithm } from './algorithms/myersDiffAlgorithm.js';\nimport { Range } from '../../core/range.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction computeMovedLines(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout) {\n    let { moves, excludedChanges } = computeMovesFromSimpleDeletionsToSimpleInsertions(changes, originalLines, modifiedLines, timeout);\n    if (!timeout.isValid()) {\n        return [];\n    }\n    const filteredChanges = changes.filter(c => !excludedChanges.has(c));\n    const unchangedMoves = computeUnchangedMoves(filteredChanges, hashedOriginalLines, hashedModifiedLines, originalLines, modifiedLines, timeout);\n    pushMany(moves, unchangedMoves);\n    moves = joinCloseConsecutiveMoves(moves);\n    // Ignore too short moves\n    moves = moves.filter(current => {\n        const lines = current.original.toOffsetRange().slice(originalLines).map(l => l.trim());\n        const originalText = lines.join('\\n');\n        return originalText.length >= 15 && countWhere(lines, l => l.length >= 2) >= 2;\n    });\n    moves = removeMovesInSameDiff(changes, moves);\n    return moves;\n}\nfunction countWhere(arr, predicate) {\n    let count = 0;\n    for (const t of arr) {\n        if (predicate(t)) {\n            count++;\n        }\n    }\n    return count;\n}\nfunction computeMovesFromSimpleDeletionsToSimpleInsertions(changes, originalLines, modifiedLines, timeout) {\n    const moves = [];\n    const deletions = changes\n        .filter(c => c.modified.isEmpty && c.original.length >= 3)\n        .map(d => new LineRangeFragment(d.original, originalLines, d));\n    const insertions = new Set(changes\n        .filter(c => c.original.isEmpty && c.modified.length >= 3)\n        .map(d => new LineRangeFragment(d.modified, modifiedLines, d)));\n    const excludedChanges = new Set();\n    for (const deletion of deletions) {\n        let highestSimilarity = -1;\n        let best;\n        for (const insertion of insertions) {\n            const similarity = deletion.computeSimilarity(insertion);\n            if (similarity > highestSimilarity) {\n                highestSimilarity = similarity;\n                best = insertion;\n            }\n        }\n        if (highestSimilarity > 0.90 && best) {\n            insertions.delete(best);\n            moves.push(new LineRangeMapping(deletion.range, best.range));\n            excludedChanges.add(deletion.source);\n            excludedChanges.add(best.source);\n        }\n        if (!timeout.isValid()) {\n            return { moves, excludedChanges };\n        }\n    }\n    return { moves, excludedChanges };\n}\nfunction computeUnchangedMoves(changes, hashedOriginalLines, hashedModifiedLines, originalLines, modifiedLines, timeout) {\n    const moves = [];\n    const original3LineHashes = new SetMap();\n    for (const change of changes) {\n        for (let i = change.original.startLineNumber; i < change.original.endLineNumberExclusive - 2; i++) {\n            const key = `${hashedOriginalLines[i - 1]}:${hashedOriginalLines[i + 1 - 1]}:${hashedOriginalLines[i + 2 - 1]}`;\n            original3LineHashes.add(key, { range: new LineRange(i, i + 3) });\n        }\n    }\n    const possibleMappings = [];\n    changes.sort(compareBy(c => c.modified.startLineNumber, numberComparator));\n    for (const change of changes) {\n        let lastMappings = [];\n        for (let i = change.modified.startLineNumber; i < change.modified.endLineNumberExclusive - 2; i++) {\n            const key = `${hashedModifiedLines[i - 1]}:${hashedModifiedLines[i + 1 - 1]}:${hashedModifiedLines[i + 2 - 1]}`;\n            const currentModifiedRange = new LineRange(i, i + 3);\n            const nextMappings = [];\n            original3LineHashes.forEach(key, ({ range }) => {\n                for (const lastMapping of lastMappings) {\n                    // does this match extend some last match?\n                    if (lastMapping.originalLineRange.endLineNumberExclusive + 1 === range.endLineNumberExclusive &&\n                        lastMapping.modifiedLineRange.endLineNumberExclusive + 1 === currentModifiedRange.endLineNumberExclusive) {\n                        lastMapping.originalLineRange = new LineRange(lastMapping.originalLineRange.startLineNumber, range.endLineNumberExclusive);\n                        lastMapping.modifiedLineRange = new LineRange(lastMapping.modifiedLineRange.startLineNumber, currentModifiedRange.endLineNumberExclusive);\n                        nextMappings.push(lastMapping);\n                        return;\n                    }\n                }\n                const mapping = {\n                    modifiedLineRange: currentModifiedRange,\n                    originalLineRange: range,\n                };\n                possibleMappings.push(mapping);\n                nextMappings.push(mapping);\n            });\n            lastMappings = nextMappings;\n        }\n        if (!timeout.isValid()) {\n            return [];\n        }\n    }\n    possibleMappings.sort(reverseOrder(compareBy(m => m.modifiedLineRange.length, numberComparator)));\n    const modifiedSet = new LineRangeSet();\n    const originalSet = new LineRangeSet();\n    for (const mapping of possibleMappings) {\n        const diffOrigToMod = mapping.modifiedLineRange.startLineNumber - mapping.originalLineRange.startLineNumber;\n        const modifiedSections = modifiedSet.subtractFrom(mapping.modifiedLineRange);\n        const originalTranslatedSections = originalSet.subtractFrom(mapping.originalLineRange).getWithDelta(diffOrigToMod);\n        const modifiedIntersectedSections = modifiedSections.getIntersection(originalTranslatedSections);\n        for (const s of modifiedIntersectedSections.ranges) {\n            if (s.length < 3) {\n                continue;\n            }\n            const modifiedLineRange = s;\n            const originalLineRange = s.delta(-diffOrigToMod);\n            moves.push(new LineRangeMapping(originalLineRange, modifiedLineRange));\n            modifiedSet.addRange(modifiedLineRange);\n            originalSet.addRange(originalLineRange);\n        }\n    }\n    moves.sort(compareBy(m => m.original.startLineNumber, numberComparator));\n    const monotonousChanges = new MonotonousArray(changes);\n    for (let i = 0; i < moves.length; i++) {\n        const move = moves[i];\n        const firstTouchingChangeOrig = monotonousChanges.findLastMonotonous(c => c.original.startLineNumber <= move.original.startLineNumber);\n        const firstTouchingChangeMod = findLastMonotonous(changes, c => c.modified.startLineNumber <= move.modified.startLineNumber);\n        const linesAbove = Math.max(move.original.startLineNumber - firstTouchingChangeOrig.original.startLineNumber, move.modified.startLineNumber - firstTouchingChangeMod.modified.startLineNumber);\n        const lastTouchingChangeOrig = monotonousChanges.findLastMonotonous(c => c.original.startLineNumber < move.original.endLineNumberExclusive);\n        const lastTouchingChangeMod = findLastMonotonous(changes, c => c.modified.startLineNumber < move.modified.endLineNumberExclusive);\n        const linesBelow = Math.max(lastTouchingChangeOrig.original.endLineNumberExclusive - move.original.endLineNumberExclusive, lastTouchingChangeMod.modified.endLineNumberExclusive - move.modified.endLineNumberExclusive);\n        let extendToTop;\n        for (extendToTop = 0; extendToTop < linesAbove; extendToTop++) {\n            const origLine = move.original.startLineNumber - extendToTop - 1;\n            const modLine = move.modified.startLineNumber - extendToTop - 1;\n            if (origLine > originalLines.length || modLine > modifiedLines.length) {\n                break;\n            }\n            if (modifiedSet.contains(modLine) || originalSet.contains(origLine)) {\n                break;\n            }\n            if (!areLinesSimilar(originalLines[origLine - 1], modifiedLines[modLine - 1], timeout)) {\n                break;\n            }\n        }\n        if (extendToTop > 0) {\n            originalSet.addRange(new LineRange(move.original.startLineNumber - extendToTop, move.original.startLineNumber));\n            modifiedSet.addRange(new LineRange(move.modified.startLineNumber - extendToTop, move.modified.startLineNumber));\n        }\n        let extendToBottom;\n        for (extendToBottom = 0; extendToBottom < linesBelow; extendToBottom++) {\n            const origLine = move.original.endLineNumberExclusive + extendToBottom;\n            const modLine = move.modified.endLineNumberExclusive + extendToBottom;\n            if (origLine > originalLines.length || modLine > modifiedLines.length) {\n                break;\n            }\n            if (modifiedSet.contains(modLine) || originalSet.contains(origLine)) {\n                break;\n            }\n            if (!areLinesSimilar(originalLines[origLine - 1], modifiedLines[modLine - 1], timeout)) {\n                break;\n            }\n        }\n        if (extendToBottom > 0) {\n            originalSet.addRange(new LineRange(move.original.endLineNumberExclusive, move.original.endLineNumberExclusive + extendToBottom));\n            modifiedSet.addRange(new LineRange(move.modified.endLineNumberExclusive, move.modified.endLineNumberExclusive + extendToBottom));\n        }\n        if (extendToTop > 0 || extendToBottom > 0) {\n            moves[i] = new LineRangeMapping(new LineRange(move.original.startLineNumber - extendToTop, move.original.endLineNumberExclusive + extendToBottom), new LineRange(move.modified.startLineNumber - extendToTop, move.modified.endLineNumberExclusive + extendToBottom));\n        }\n    }\n    return moves;\n}\nfunction areLinesSimilar(line1, line2, timeout) {\n    if (line1.trim() === line2.trim()) {\n        return true;\n    }\n    if (line1.length > 300 && line2.length > 300) {\n        return false;\n    }\n    const myersDiffingAlgorithm = new MyersDiffAlgorithm();\n    const result = myersDiffingAlgorithm.compute(new LinesSliceCharSequence([line1], new Range(1, 1, 1, line1.length), false), new LinesSliceCharSequence([line2], new Range(1, 1, 1, line2.length), false), timeout);\n    let commonNonSpaceCharCount = 0;\n    const inverted = SequenceDiff.invert(result.diffs, line1.length);\n    for (const seq of inverted) {\n        seq.seq1Range.forEach(idx => {\n            if (!isSpace(line1.charCodeAt(idx))) {\n                commonNonSpaceCharCount++;\n            }\n        });\n    }\n    function countNonWsChars(str) {\n        let count = 0;\n        for (let i = 0; i < line1.length; i++) {\n            if (!isSpace(str.charCodeAt(i))) {\n                count++;\n            }\n        }\n        return count;\n    }\n    const longerLineLength = countNonWsChars(line1.length > line2.length ? line1 : line2);\n    const r = commonNonSpaceCharCount / longerLineLength > 0.6 && longerLineLength > 10;\n    return r;\n}\nfunction joinCloseConsecutiveMoves(moves) {\n    if (moves.length === 0) {\n        return moves;\n    }\n    moves.sort(compareBy(m => m.original.startLineNumber, numberComparator));\n    const result = [moves[0]];\n    for (let i = 1; i < moves.length; i++) {\n        const last = result[result.length - 1];\n        const current = moves[i];\n        const originalDist = current.original.startLineNumber - last.original.endLineNumberExclusive;\n        const modifiedDist = current.modified.startLineNumber - last.modified.endLineNumberExclusive;\n        const currentMoveAfterLast = originalDist >= 0 && modifiedDist >= 0;\n        if (currentMoveAfterLast && originalDist + modifiedDist <= 2) {\n            result[result.length - 1] = last.join(current);\n            continue;\n        }\n        result.push(current);\n    }\n    return result;\n}\nfunction removeMovesInSameDiff(changes, moves) {\n    const changesMonotonous = new MonotonousArray(changes);\n    moves = moves.filter(m => {\n        const diffBeforeEndOfMoveOriginal = changesMonotonous.findLastMonotonous(c => c.original.startLineNumber < m.original.endLineNumberExclusive)\n            || new LineRangeMapping(new LineRange(1, 1), new LineRange(1, 1));\n        const diffBeforeEndOfMoveModified = findLastMonotonous(changes, c => c.modified.startLineNumber < m.modified.endLineNumberExclusive);\n        const differentDiffs = diffBeforeEndOfMoveOriginal !== diffBeforeEndOfMoveModified;\n        return differentDiffs;\n    });\n    return moves;\n}\n\nexport { computeMovedLines };\n","import { forEachWithNeighbors } from '../../../../base/common/arrays.js';\nimport { OffsetRange } from '../../core/ranges/offsetRange.js';\nimport { SequenceDiff, OffsetPair } from './algorithms/diffAlgorithm.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction optimizeSequenceDiffs(sequence1, sequence2, sequenceDiffs) {\n    let result = sequenceDiffs;\n    result = joinSequenceDiffsByShifting(sequence1, sequence2, result);\n    // Sometimes, calling this function twice improves the result.\n    // Uncomment the second invocation and run the tests to see the difference.\n    result = joinSequenceDiffsByShifting(sequence1, sequence2, result);\n    result = shiftSequenceDiffs(sequence1, sequence2, result);\n    return result;\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, sequence2, sequenceDiffs) {\n    if (sequenceDiffs.length === 0) {\n        return sequenceDiffs;\n    }\n    const result = [];\n    result.push(sequenceDiffs[0]);\n    // First move them all to the left as much as possible and join them if possible\n    for (let i = 1; i < sequenceDiffs.length; i++) {\n        const prevResult = result[result.length - 1];\n        let cur = sequenceDiffs[i];\n        if (cur.seq1Range.isEmpty || cur.seq2Range.isEmpty) {\n            const length = cur.seq1Range.start - prevResult.seq1Range.endExclusive;\n            let d;\n            for (d = 1; d <= length; d++) {\n                if (sequence1.getElement(cur.seq1Range.start - d) !== sequence1.getElement(cur.seq1Range.endExclusive - d) ||\n                    sequence2.getElement(cur.seq2Range.start - d) !== sequence2.getElement(cur.seq2Range.endExclusive - d)) {\n                    break;\n                }\n            }\n            d--;\n            if (d === length) {\n                // Merge previous and current diff\n                result[result.length - 1] = new SequenceDiff(new OffsetRange(prevResult.seq1Range.start, cur.seq1Range.endExclusive - length), new OffsetRange(prevResult.seq2Range.start, cur.seq2Range.endExclusive - length));\n                continue;\n            }\n            cur = cur.delta(-d);\n        }\n        result.push(cur);\n    }\n    const result2 = [];\n    // Then move them all to the right and join them again if possible\n    for (let i = 0; i < result.length - 1; i++) {\n        const nextResult = result[i + 1];\n        let cur = result[i];\n        if (cur.seq1Range.isEmpty || cur.seq2Range.isEmpty) {\n            const length = nextResult.seq1Range.start - cur.seq1Range.endExclusive;\n            let d;\n            for (d = 0; d < length; d++) {\n                if (!sequence1.isStronglyEqual(cur.seq1Range.start + d, cur.seq1Range.endExclusive + d) ||\n                    !sequence2.isStronglyEqual(cur.seq2Range.start + d, cur.seq2Range.endExclusive + d)) {\n                    break;\n                }\n            }\n            if (d === length) {\n                // Merge previous and current diff, write to result!\n                result[i + 1] = new SequenceDiff(new OffsetRange(cur.seq1Range.start + length, nextResult.seq1Range.endExclusive), new OffsetRange(cur.seq2Range.start + length, nextResult.seq2Range.endExclusive));\n                continue;\n            }\n            if (d > 0) {\n                cur = cur.delta(d);\n            }\n        }\n        result2.push(cur);\n    }\n    if (result.length > 0) {\n        result2.push(result[result.length - 1]);\n    }\n    return result2;\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// 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// collectBrackets(level + 1, levelPerBracketType);\n// collectBrackets(level + 1, levelPerBracket[ + 1, levelPerBracket]Type);\n// ->\n// collectBrackets(level + 1, [levelPerBracket + 1, ]levelPerBracketType);\nfunction shiftSequenceDiffs(sequence1, sequence2, sequenceDiffs) {\n    if (!sequence1.getBoundaryScore || !sequence2.getBoundaryScore) {\n        return sequenceDiffs;\n    }\n    for (let i = 0; i < sequenceDiffs.length; i++) {\n        const prevDiff = (i > 0 ? sequenceDiffs[i - 1] : undefined);\n        const diff = sequenceDiffs[i];\n        const nextDiff = (i + 1 < sequenceDiffs.length ? sequenceDiffs[i + 1] : undefined);\n        const seq1ValidRange = new OffsetRange(prevDiff ? prevDiff.seq1Range.endExclusive + 1 : 0, nextDiff ? nextDiff.seq1Range.start - 1 : sequence1.length);\n        const seq2ValidRange = new OffsetRange(prevDiff ? prevDiff.seq2Range.endExclusive + 1 : 0, nextDiff ? nextDiff.seq2Range.start - 1 : sequence2.length);\n        if (diff.seq1Range.isEmpty) {\n            sequenceDiffs[i] = shiftDiffToBetterPosition(diff, sequence1, sequence2, seq1ValidRange, seq2ValidRange);\n        }\n        else if (diff.seq2Range.isEmpty) {\n            sequenceDiffs[i] = shiftDiffToBetterPosition(diff.swap(), sequence2, sequence1, seq2ValidRange, seq1ValidRange).swap();\n        }\n    }\n    return sequenceDiffs;\n}\nfunction shiftDiffToBetterPosition(diff, sequence1, sequence2, seq1ValidRange, seq2ValidRange) {\n    const maxShiftLimit = 100; // To prevent performance issues\n    // don't touch previous or next!\n    let deltaBefore = 1;\n    while (diff.seq1Range.start - deltaBefore >= seq1ValidRange.start &&\n        diff.seq2Range.start - deltaBefore >= seq2ValidRange.start &&\n        sequence2.isStronglyEqual(diff.seq2Range.start - deltaBefore, diff.seq2Range.endExclusive - deltaBefore) && deltaBefore < maxShiftLimit) {\n        deltaBefore++;\n    }\n    deltaBefore--;\n    let deltaAfter = 0;\n    while (diff.seq1Range.start + deltaAfter < seq1ValidRange.endExclusive &&\n        diff.seq2Range.endExclusive + deltaAfter < seq2ValidRange.endExclusive &&\n        sequence2.isStronglyEqual(diff.seq2Range.start + deltaAfter, diff.seq2Range.endExclusive + deltaAfter) && deltaAfter < maxShiftLimit) {\n        deltaAfter++;\n    }\n    if (deltaBefore === 0 && deltaAfter === 0) {\n        return diff;\n    }\n    // Visualize `[sequence1.text, diff.seq1Range.start + deltaAfter]`\n    // and `[sequence2.text, diff.seq2Range.start + deltaAfter, diff.seq2Range.endExclusive + deltaAfter]`\n    let bestDelta = 0;\n    let bestScore = -1;\n    // find best scored delta\n    for (let delta = -deltaBefore; delta <= deltaAfter; delta++) {\n        const seq2OffsetStart = diff.seq2Range.start + delta;\n        const seq2OffsetEndExclusive = diff.seq2Range.endExclusive + delta;\n        const seq1Offset = diff.seq1Range.start + delta;\n        const score = sequence1.getBoundaryScore(seq1Offset) + sequence2.getBoundaryScore(seq2OffsetStart) + sequence2.getBoundaryScore(seq2OffsetEndExclusive);\n        if (score > bestScore) {\n            bestScore = score;\n            bestDelta = delta;\n        }\n    }\n    return diff.delta(bestDelta);\n}\nfunction removeShortMatches(sequence1, sequence2, sequenceDiffs) {\n    const result = [];\n    for (const s of sequenceDiffs) {\n        const last = result[result.length - 1];\n        if (!last) {\n            result.push(s);\n            continue;\n        }\n        if (s.seq1Range.start - last.seq1Range.endExclusive <= 2 || s.seq2Range.start - last.seq2Range.endExclusive <= 2) {\n            result[result.length - 1] = new SequenceDiff(last.seq1Range.join(s.seq1Range), last.seq2Range.join(s.seq2Range));\n        }\n        else {\n            result.push(s);\n        }\n    }\n    return result;\n}\nfunction extendDiffsToEntireWordIfAppropriate(sequence1, sequence2, sequenceDiffs, findParent, force = false) {\n    const equalMappings = SequenceDiff.invert(sequenceDiffs, sequence1.length);\n    const additional = [];\n    let lastPoint = new OffsetPair(0, 0);\n    function scanWord(pair, equalMapping) {\n        if (pair.offset1 < lastPoint.offset1 || pair.offset2 < lastPoint.offset2) {\n            return;\n        }\n        const w1 = findParent(sequence1, pair.offset1);\n        const w2 = findParent(sequence2, pair.offset2);\n        if (!w1 || !w2) {\n            return;\n        }\n        let w = new SequenceDiff(w1, w2);\n        const equalPart = w.intersect(equalMapping);\n        let equalChars1 = equalPart.seq1Range.length;\n        let equalChars2 = equalPart.seq2Range.length;\n        // The words do not touch previous equals mappings, as we would have processed them already.\n        // But they might touch the next ones.\n        while (equalMappings.length > 0) {\n            const next = equalMappings[0];\n            const intersects = next.seq1Range.intersects(w.seq1Range) || next.seq2Range.intersects(w.seq2Range);\n            if (!intersects) {\n                break;\n            }\n            const v1 = findParent(sequence1, next.seq1Range.start);\n            const v2 = findParent(sequence2, next.seq2Range.start);\n            // Because there is an intersection, we know that the words are not empty.\n            const v = new SequenceDiff(v1, v2);\n            const equalPart = v.intersect(next);\n            equalChars1 += equalPart.seq1Range.length;\n            equalChars2 += equalPart.seq2Range.length;\n            w = w.join(v);\n            if (w.seq1Range.endExclusive >= next.seq1Range.endExclusive) {\n                // The word extends beyond the next equal mapping.\n                equalMappings.shift();\n            }\n            else {\n                break;\n            }\n        }\n        if ((force && equalChars1 + equalChars2 < w.seq1Range.length + w.seq2Range.length) || equalChars1 + equalChars2 < (w.seq1Range.length + w.seq2Range.length) * 2 / 3) {\n            additional.push(w);\n        }\n        lastPoint = w.getEndExclusives();\n    }\n    while (equalMappings.length > 0) {\n        const next = equalMappings.shift();\n        if (next.seq1Range.isEmpty) {\n            continue;\n        }\n        scanWord(next.getStarts(), next);\n        // The equal parts are not empty, so -1 gives us a character that is equal in both parts.\n        scanWord(next.getEndExclusives().delta(-1), next);\n    }\n    const merged = mergeSequenceDiffs(sequenceDiffs, additional);\n    return merged;\n}\nfunction mergeSequenceDiffs(sequenceDiffs1, sequenceDiffs2) {\n    const result = [];\n    while (sequenceDiffs1.length > 0 || sequenceDiffs2.length > 0) {\n        const sd1 = sequenceDiffs1[0];\n        const sd2 = sequenceDiffs2[0];\n        let next;\n        if (sd1 && (!sd2 || sd1.seq1Range.start < sd2.seq1Range.start)) {\n            next = sequenceDiffs1.shift();\n        }\n        else {\n            next = sequenceDiffs2.shift();\n        }\n        if (result.length > 0 && result[result.length - 1].seq1Range.endExclusive >= next.seq1Range.start) {\n            result[result.length - 1] = result[result.length - 1].join(next);\n        }\n        else {\n            result.push(next);\n        }\n    }\n    return result;\n}\nfunction removeVeryShortMatchingLinesBetweenDiffs(sequence1, _sequence2, sequenceDiffs) {\n    let diffs = sequenceDiffs;\n    if (diffs.length === 0) {\n        return diffs;\n    }\n    let counter = 0;\n    let shouldRepeat;\n    do {\n        shouldRepeat = false;\n        const result = [\n            diffs[0]\n        ];\n        for (let i = 1; i < diffs.length; i++) {\n            const cur = diffs[i];\n            const lastResult = result[result.length - 1];\n            function shouldJoinDiffs(before, after) {\n                const unchangedRange = new OffsetRange(lastResult.seq1Range.endExclusive, cur.seq1Range.start);\n                const unchangedText = sequence1.getText(unchangedRange);\n                const unchangedTextWithoutWs = unchangedText.replace(/\\s/g, '');\n                if (unchangedTextWithoutWs.length <= 4\n                    && (before.seq1Range.length + before.seq2Range.length > 5 || after.seq1Range.length + after.seq2Range.length > 5)) {\n                    return true;\n                }\n                return false;\n            }\n            const shouldJoin = shouldJoinDiffs(lastResult, cur);\n            if (shouldJoin) {\n                shouldRepeat = true;\n                result[result.length - 1] = result[result.length - 1].join(cur);\n            }\n            else {\n                result.push(cur);\n            }\n        }\n        diffs = result;\n    } while (counter++ < 10 && shouldRepeat);\n    return diffs;\n}\nfunction removeVeryShortMatchingTextBetweenLongDiffs(sequence1, sequence2, sequenceDiffs) {\n    let diffs = sequenceDiffs;\n    if (diffs.length === 0) {\n        return diffs;\n    }\n    let counter = 0;\n    let shouldRepeat;\n    do {\n        shouldRepeat = false;\n        const result = [\n            diffs[0]\n        ];\n        for (let i = 1; i < diffs.length; i++) {\n            const cur = diffs[i];\n            const lastResult = result[result.length - 1];\n            function shouldJoinDiffs(before, after) {\n                const unchangedRange = new OffsetRange(lastResult.seq1Range.endExclusive, cur.seq1Range.start);\n                const unchangedLineCount = sequence1.countLinesIn(unchangedRange);\n                if (unchangedLineCount > 5 || unchangedRange.length > 500) {\n                    return false;\n                }\n                const unchangedText = sequence1.getText(unchangedRange).trim();\n                if (unchangedText.length > 20 || unchangedText.split(/\\r\\n|\\r|\\n/).length > 1) {\n                    return false;\n                }\n                const beforeLineCount1 = sequence1.countLinesIn(before.seq1Range);\n                const beforeSeq1Length = before.seq1Range.length;\n                const beforeLineCount2 = sequence2.countLinesIn(before.seq2Range);\n                const beforeSeq2Length = before.seq2Range.length;\n                const afterLineCount1 = sequence1.countLinesIn(after.seq1Range);\n                const afterSeq1Length = after.seq1Range.length;\n                const afterLineCount2 = sequence2.countLinesIn(after.seq2Range);\n                const afterSeq2Length = after.seq2Range.length;\n                // TODO: Maybe a neural net can be used to derive the result from these numbers\n                const max = 2 * 40 + 50;\n                function cap(v) {\n                    return Math.min(v, max);\n                }\n                if (Math.pow(Math.pow(cap(beforeLineCount1 * 40 + beforeSeq1Length), 1.5) + Math.pow(cap(beforeLineCount2 * 40 + beforeSeq2Length), 1.5), 1.5)\n                    + 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                    return true;\n                }\n                return false;\n            }\n            const shouldJoin = shouldJoinDiffs(lastResult, cur);\n            if (shouldJoin) {\n                shouldRepeat = true;\n                result[result.length - 1] = result[result.length - 1].join(cur);\n            }\n            else {\n                result.push(cur);\n            }\n        }\n        diffs = result;\n    } while (counter++ < 10 && shouldRepeat);\n    const newDiffs = [];\n    // Remove short suffixes/prefixes\n    forEachWithNeighbors(diffs, (prev, cur, next) => {\n        let newDiff = cur;\n        function shouldMarkAsChanged(text) {\n            return text.length > 0 && text.trim().length <= 3 && cur.seq1Range.length + cur.seq2Range.length > 100;\n        }\n        const fullRange1 = sequence1.extendToFullLines(cur.seq1Range);\n        const prefix = sequence1.getText(new OffsetRange(fullRange1.start, cur.seq1Range.start));\n        if (shouldMarkAsChanged(prefix)) {\n            newDiff = newDiff.deltaStart(-prefix.length);\n        }\n        const suffix = sequence1.getText(new OffsetRange(cur.seq1Range.endExclusive, fullRange1.endExclusive));\n        if (shouldMarkAsChanged(suffix)) {\n            newDiff = newDiff.deltaEnd(suffix.length);\n        }\n        const availableSpace = SequenceDiff.fromOffsetPairs(prev ? prev.getEndExclusives() : OffsetPair.zero, next ? next.getStarts() : OffsetPair.max);\n        const result = newDiff.intersect(availableSpace);\n        if (newDiffs.length > 0 && result.getStarts().equals(newDiffs[newDiffs.length - 1].getEndExclusives())) {\n            newDiffs[newDiffs.length - 1] = newDiffs[newDiffs.length - 1].join(result);\n        }\n        else {\n            newDiffs.push(result);\n        }\n    });\n    return newDiffs;\n}\n\nexport { extendDiffsToEntireWordIfAppropriate, optimizeSequenceDiffs, removeShortMatches, removeVeryShortMatchingLinesBetweenDiffs, removeVeryShortMatchingTextBetweenLongDiffs };\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 *--------------------------------------------------------------------------------------------*/\nclass LineSequence {\n    constructor(trimmedHash, lines) {\n        this.trimmedHash = trimmedHash;\n        this.lines = lines;\n    }\n    getElement(offset) {\n        return this.trimmedHash[offset];\n    }\n    get length() {\n        return this.trimmedHash.length;\n    }\n    getBoundaryScore(length) {\n        const indentationBefore = length === 0 ? 0 : getIndentation(this.lines[length - 1]);\n        const indentationAfter = length === this.lines.length ? 0 : getIndentation(this.lines[length]);\n        return 1000 - (indentationBefore + indentationAfter);\n    }\n    getText(range) {\n        return this.lines.slice(range.start, range.endExclusive).join('\\n');\n    }\n    isStronglyEqual(offset1, offset2) {\n        return this.lines[offset1] === this.lines[offset2];\n    }\n}\nfunction getIndentation(str) {\n    let i = 0;\n    while (i < str.length && (str.charCodeAt(i) === 32 /* CharCode.Space */ || str.charCodeAt(i) === 9 /* CharCode.Tab */)) {\n        i++;\n    }\n    return i;\n}\n\nexport { LineSequence };\n","import { equals } from '../../../../base/common/arrays.js';\nimport { assertFn } from '../../../../base/common/assert.js';\nimport { LineRange } from '../../core/ranges/lineRange.js';\nimport { OffsetRange } from '../../core/ranges/offsetRange.js';\nimport { Range } from '../../core/range.js';\nimport { ArrayText } from '../../core/text/abstractText.js';\nimport { LinesDiff, MovedText } from '../linesDiffComputer.js';\nimport { DetailedLineRangeMapping, RangeMapping, lineRangeMappingFromRangeMappings, LineRangeMapping } from '../rangeMapping.js';\nimport { InfiniteTimeout, DateTimeout, SequenceDiff } from './algorithms/diffAlgorithm.js';\nimport { DynamicProgrammingDiffing } from './algorithms/dynamicProgrammingDiffing.js';\nimport { MyersDiffAlgorithm } from './algorithms/myersDiffAlgorithm.js';\nimport { computeMovedLines } from './computeMovedLines.js';\nimport { optimizeSequenceDiffs, removeVeryShortMatchingLinesBetweenDiffs, extendDiffsToEntireWordIfAppropriate, removeShortMatches, removeVeryShortMatchingTextBetweenLongDiffs } from './heuristicSequenceOptimizations.js';\nimport { LineSequence } from './lineSequence.js';\nimport { LinesSliceCharSequence } from './linesSliceCharSequence.js';\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 *--------------------------------------------------------------------------------------------*/\nclass DefaultLinesDiffComputer {\n    constructor() {\n        this.dynamicProgrammingDiffing = new DynamicProgrammingDiffing();\n        this.myersDiffingAlgorithm = new MyersDiffAlgorithm();\n    }\n    computeDiff(originalLines, modifiedLines, options) {\n        if (originalLines.length <= 1 && equals(originalLines, modifiedLines, (a, b) => a === b)) {\n            return new LinesDiff([], [], false);\n        }\n        if (originalLines.length === 1 && originalLines[0].length === 0 || modifiedLines.length === 1 && modifiedLines[0].length === 0) {\n            return new LinesDiff([\n                new DetailedLineRangeMapping(new LineRange(1, originalLines.length + 1), new LineRange(1, modifiedLines.length + 1), [\n                    new RangeMapping(new Range(1, 1, originalLines.length, originalLines[originalLines.length - 1].length + 1), new Range(1, 1, modifiedLines.length, modifiedLines[modifiedLines.length - 1].length + 1))\n                ])\n            ], [], false);\n        }\n        const timeout = options.maxComputationTimeMs === 0 ? InfiniteTimeout.instance : new DateTimeout(options.maxComputationTimeMs);\n        const considerWhitespaceChanges = !options.ignoreTrimWhitespace;\n        const perfectHashes = new Map();\n        function getOrCreateHash(text) {\n            let hash = perfectHashes.get(text);\n            if (hash === undefined) {\n                hash = perfectHashes.size;\n                perfectHashes.set(text, hash);\n            }\n            return hash;\n        }\n        const originalLinesHashes = originalLines.map((l) => getOrCreateHash(l.trim()));\n        const modifiedLinesHashes = modifiedLines.map((l) => getOrCreateHash(l.trim()));\n        const sequence1 = new LineSequence(originalLinesHashes, originalLines);\n        const sequence2 = new LineSequence(modifiedLinesHashes, modifiedLines);\n        const lineAlignmentResult = (() => {\n            if (sequence1.length + sequence2.length < 1700) {\n                // Use the improved algorithm for small files\n                return this.dynamicProgrammingDiffing.compute(sequence1, sequence2, timeout, (offset1, offset2) => originalLines[offset1] === modifiedLines[offset2]\n                    ? modifiedLines[offset2].length === 0\n                        ? 0.1\n                        : 1 + Math.log(1 + modifiedLines[offset2].length)\n                    : 0.99);\n            }\n            return this.myersDiffingAlgorithm.compute(sequence1, sequence2, timeout);\n        })();\n        let lineAlignments = lineAlignmentResult.diffs;\n        let hitTimeout = lineAlignmentResult.hitTimeout;\n        lineAlignments = optimizeSequenceDiffs(sequence1, sequence2, lineAlignments);\n        lineAlignments = removeVeryShortMatchingLinesBetweenDiffs(sequence1, sequence2, lineAlignments);\n        const alignments = [];\n        const scanForWhitespaceChanges = (equalLinesCount) => {\n            if (!considerWhitespaceChanges) {\n                return;\n            }\n            for (let i = 0; i < equalLinesCount; i++) {\n                const seq1Offset = seq1LastStart + i;\n                const seq2Offset = seq2LastStart + i;\n                if (originalLines[seq1Offset] !== modifiedLines[seq2Offset]) {\n                    // This is because of whitespace changes, diff these lines\n                    const characterDiffs = this.refineDiff(originalLines, modifiedLines, new SequenceDiff(new OffsetRange(seq1Offset, seq1Offset + 1), new OffsetRange(seq2Offset, seq2Offset + 1)), timeout, considerWhitespaceChanges, options);\n                    for (const a of characterDiffs.mappings) {\n                        alignments.push(a);\n                    }\n                    if (characterDiffs.hitTimeout) {\n                        hitTimeout = true;\n                    }\n                }\n            }\n        };\n        let seq1LastStart = 0;\n        let seq2LastStart = 0;\n        for (const diff of lineAlignments) {\n            assertFn(() => diff.seq1Range.start - seq1LastStart === diff.seq2Range.start - seq2LastStart);\n            const equalLinesCount = diff.seq1Range.start - seq1LastStart;\n            scanForWhitespaceChanges(equalLinesCount);\n            seq1LastStart = diff.seq1Range.endExclusive;\n            seq2LastStart = diff.seq2Range.endExclusive;\n            const characterDiffs = this.refineDiff(originalLines, modifiedLines, diff, timeout, considerWhitespaceChanges, options);\n            if (characterDiffs.hitTimeout) {\n                hitTimeout = true;\n            }\n            for (const a of characterDiffs.mappings) {\n                alignments.push(a);\n            }\n        }\n        scanForWhitespaceChanges(originalLines.length - seq1LastStart);\n        const original = new ArrayText(originalLines);\n        const modified = new ArrayText(modifiedLines);\n        const changes = lineRangeMappingFromRangeMappings(alignments, original, modified);\n        let moves = [];\n        if (options.computeMoves) {\n            moves = this.computeMoves(changes, originalLines, modifiedLines, originalLinesHashes, modifiedLinesHashes, timeout, considerWhitespaceChanges, options);\n        }\n        // Make sure all ranges are valid\n        assertFn(() => {\n            function validatePosition(pos, lines) {\n                if (pos.lineNumber < 1 || pos.lineNumber > lines.length) {\n                    return false;\n                }\n                const line = lines[pos.lineNumber - 1];\n                if (pos.column < 1 || pos.column > line.length + 1) {\n                    return false;\n                }\n                return true;\n            }\n            function validateRange(range, lines) {\n                if (range.startLineNumber < 1 || range.startLineNumber > lines.length + 1) {\n                    return false;\n                }\n                if (range.endLineNumberExclusive < 1 || range.endLineNumberExclusive > lines.length + 1) {\n                    return false;\n                }\n                return true;\n            }\n            for (const c of changes) {\n                if (!c.innerChanges) {\n                    return false;\n                }\n                for (const ic of c.innerChanges) {\n                    const valid = validatePosition(ic.modifiedRange.getStartPosition(), modifiedLines) && validatePosition(ic.modifiedRange.getEndPosition(), modifiedLines) &&\n                        validatePosition(ic.originalRange.getStartPosition(), originalLines) && validatePosition(ic.originalRange.getEndPosition(), originalLines);\n                    if (!valid) {\n                        return false;\n                    }\n                }\n                if (!validateRange(c.modified, modifiedLines) || !validateRange(c.original, originalLines)) {\n                    return false;\n                }\n            }\n            return true;\n        });\n        return new LinesDiff(changes, moves, hitTimeout);\n    }\n    computeMoves(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout, considerWhitespaceChanges, options) {\n        const moves = computeMovedLines(changes, originalLines, modifiedLines, hashedOriginalLines, hashedModifiedLines, timeout);\n        const movesWithDiffs = moves.map(m => {\n            const moveChanges = this.refineDiff(originalLines, modifiedLines, new SequenceDiff(m.original.toOffsetRange(), m.modified.toOffsetRange()), timeout, considerWhitespaceChanges, options);\n            const mappings = lineRangeMappingFromRangeMappings(moveChanges.mappings, new ArrayText(originalLines), new ArrayText(modifiedLines), true);\n            return new MovedText(m, mappings);\n        });\n        return movesWithDiffs;\n    }\n    refineDiff(originalLines, modifiedLines, diff, timeout, considerWhitespaceChanges, options) {\n        const lineRangeMapping = toLineRangeMapping(diff);\n        const rangeMapping = lineRangeMapping.toRangeMapping2(originalLines, modifiedLines);\n        const slice1 = new LinesSliceCharSequence(originalLines, rangeMapping.originalRange, considerWhitespaceChanges);\n        const slice2 = new LinesSliceCharSequence(modifiedLines, rangeMapping.modifiedRange, considerWhitespaceChanges);\n        const diffResult = slice1.length + slice2.length < 500\n            ? this.dynamicProgrammingDiffing.compute(slice1, slice2, timeout)\n            : this.myersDiffingAlgorithm.compute(slice1, slice2, timeout);\n        let diffs = diffResult.diffs;\n        diffs = optimizeSequenceDiffs(slice1, slice2, diffs);\n        diffs = extendDiffsToEntireWordIfAppropriate(slice1, slice2, diffs, (seq, idx) => seq.findWordContaining(idx));\n        if (options.extendToSubwords) {\n            diffs = extendDiffsToEntireWordIfAppropriate(slice1, slice2, diffs, (seq, idx) => seq.findSubWordContaining(idx), true);\n        }\n        diffs = removeShortMatches(slice1, slice2, diffs);\n        diffs = removeVeryShortMatchingTextBetweenLongDiffs(slice1, slice2, diffs);\n        const result = diffs.map((d) => new RangeMapping(slice1.translateRange(d.seq1Range), slice2.translateRange(d.seq2Range)));\n        // Assert: result applied on original should be the same as diff applied to original\n        return {\n            mappings: result,\n            hitTimeout: diffResult.hitTimeout,\n        };\n    }\n}\nfunction toLineRangeMapping(sequenceDiff) {\n    return new LineRangeMapping(new LineRange(sequenceDiff.seq1Range.start + 1, sequenceDiff.seq1Range.endExclusive + 1), new LineRange(sequenceDiff.seq2Range.start + 1, sequenceDiff.seq2Range.endExclusive + 1));\n}\n\nexport { DefaultLinesDiffComputer };\n","import { LegacyLinesDiffComputer } from './legacyLinesDiffComputer.js';\nimport { DefaultLinesDiffComputer } from './defaultLinesDiffComputer/defaultLinesDiffComputer.js';\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 *--------------------------------------------------------------------------------------------*/\nconst linesDiffComputers = {\n    getLegacy: () => new LegacyLinesDiffComputer(),\n    getDefault: () => new DefaultLinesDiffComputer(),\n};\n\nexport { linesDiffComputers };\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 *--------------------------------------------------------------------------------------------*/\nfunction roundFloat(number, decimalPoints) {\n    const decimal = Math.pow(10, decimalPoints);\n    return Math.round(number * decimal) / decimal;\n}\nclass RGBA {\n    constructor(r, g, b, a = 1) {\n        this._rgbaBrand = undefined;\n        this.r = Math.min(255, Math.max(0, r)) | 0;\n        this.g = Math.min(255, Math.max(0, g)) | 0;\n        this.b = Math.min(255, Math.max(0, b)) | 0;\n        this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n    }\n    static equals(a, b) {\n        return a.r === b.r && a.g === b.g && a.b === b.b && a.a === b.a;\n    }\n}\nclass HSLA {\n    constructor(h, s, l, a) {\n        this._hslaBrand = undefined;\n        this.h = Math.max(Math.min(360, h), 0) | 0;\n        this.s = roundFloat(Math.max(Math.min(1, s), 0), 3);\n        this.l = roundFloat(Math.max(Math.min(1, l), 0), 3);\n        this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n    }\n    static equals(a, b) {\n        return a.h === b.h && a.s === b.s && a.l === b.l && a.a === b.a;\n    }\n    /**\n     * Converts an RGB color value to HSL. Conversion formula\n     * adapted from http://en.wikipedia.org/wiki/HSL_color_space.\n     * Assumes r, g, and b are contained in the set [0, 255] and\n     * returns h in the set [0, 360], s, and l in the set [0, 1].\n     */\n    static fromRGBA(rgba) {\n        const r = rgba.r / 255;\n        const g = rgba.g / 255;\n        const b = rgba.b / 255;\n        const a = rgba.a;\n        const max = Math.max(r, g, b);\n        const min = Math.min(r, g, b);\n        let h = 0;\n        let s = 0;\n        const l = (min + max) / 2;\n        const chroma = max - min;\n        if (chroma > 0) {\n            s = Math.min((l <= 0.5 ? chroma / (2 * l) : chroma / (2 - (2 * l))), 1);\n            switch (max) {\n                case r:\n                    h = (g - b) / chroma + (g < b ? 6 : 0);\n                    break;\n                case g:\n                    h = (b - r) / chroma + 2;\n                    break;\n                case b:\n                    h = (r - g) / chroma + 4;\n                    break;\n            }\n            h *= 60;\n            h = Math.round(h);\n        }\n        return new HSLA(h, s, l, a);\n    }\n    static _hue2rgb(p, q, t) {\n        if (t < 0) {\n            t += 1;\n        }\n        if (t > 1) {\n            t -= 1;\n        }\n        if (t < 1 / 6) {\n            return p + (q - p) * 6 * t;\n        }\n        if (t < 1 / 2) {\n            return q;\n        }\n        if (t < 2 / 3) {\n            return p + (q - p) * (2 / 3 - t) * 6;\n        }\n        return p;\n    }\n    /**\n     * Converts an HSL color value to RGB. Conversion formula\n     * adapted from http://en.wikipedia.org/wiki/HSL_color_space.\n     * Assumes h in the set [0, 360] s, and l are contained in the set [0, 1] and\n     * returns r, g, and b in the set [0, 255].\n     */\n    static toRGBA(hsla) {\n        const h = hsla.h / 360;\n        const { s, l, a } = hsla;\n        let r, g, b;\n        if (s === 0) {\n            r = g = b = l; // achromatic\n        }\n        else {\n            const q = l < 0.5 ? l * (1 + s) : l + s - l * s;\n            const p = 2 * l - q;\n            r = HSLA._hue2rgb(p, q, h + 1 / 3);\n            g = HSLA._hue2rgb(p, q, h);\n            b = HSLA._hue2rgb(p, q, h - 1 / 3);\n        }\n        return new RGBA(Math.round(r * 255), Math.round(g * 255), Math.round(b * 255), a);\n    }\n}\nclass HSVA {\n    constructor(h, s, v, a) {\n        this._hsvaBrand = undefined;\n        this.h = Math.max(Math.min(360, h), 0) | 0;\n        this.s = roundFloat(Math.max(Math.min(1, s), 0), 3);\n        this.v = roundFloat(Math.max(Math.min(1, v), 0), 3);\n        this.a = roundFloat(Math.max(Math.min(1, a), 0), 3);\n    }\n    static equals(a, b) {\n        return a.h === b.h && a.s === b.s && a.v === b.v && a.a === b.a;\n    }\n    // from http://www.rapidtables.com/convert/color/rgb-to-hsv.htm\n    static fromRGBA(rgba) {\n        const r = rgba.r / 255;\n        const g = rgba.g / 255;\n        const b = rgba.b / 255;\n        const cmax = Math.max(r, g, b);\n        const cmin = Math.min(r, g, b);\n        const delta = cmax - cmin;\n        const s = cmax === 0 ? 0 : (delta / cmax);\n        let m;\n        if (delta === 0) {\n            m = 0;\n        }\n        else if (cmax === r) {\n            m = ((((g - b) / delta) % 6) + 6) % 6;\n        }\n        else if (cmax === g) {\n            m = ((b - r) / delta) + 2;\n        }\n        else {\n            m = ((r - g) / delta) + 4;\n        }\n        return new HSVA(Math.round(m * 60), s, cmax, rgba.a);\n    }\n    // from http://www.rapidtables.com/convert/color/hsv-to-rgb.htm\n    static toRGBA(hsva) {\n        const { h, s, v, a } = hsva;\n        const c = v * s;\n        const x = c * (1 - Math.abs((h / 60) % 2 - 1));\n        const m = v - c;\n        let [r, g, b] = [0, 0, 0];\n        if (h < 60) {\n            r = c;\n            g = x;\n        }\n        else if (h < 120) {\n            r = x;\n            g = c;\n        }\n        else if (h < 180) {\n            g = c;\n            b = x;\n        }\n        else if (h < 240) {\n            g = x;\n            b = c;\n        }\n        else if (h < 300) {\n            r = x;\n            b = c;\n        }\n        else if (h <= 360) {\n            r = c;\n            b = x;\n        }\n        r = Math.round((r + m) * 255);\n        g = Math.round((g + m) * 255);\n        b = Math.round((b + m) * 255);\n        return new RGBA(r, g, b, a);\n    }\n}\nclass Color {\n    static fromHex(hex) {\n        return Color.Format.CSS.parseHex(hex) || Color.red;\n    }\n    static equals(a, b) {\n        if (!a && !b) {\n            return true;\n        }\n        if (!a || !b) {\n            return false;\n        }\n        return a.equals(b);\n    }\n    get hsla() {\n        if (this._hsla) {\n            return this._hsla;\n        }\n        else {\n            return HSLA.fromRGBA(this.rgba);\n        }\n    }\n    get hsva() {\n        if (this._hsva) {\n            return this._hsva;\n        }\n        return HSVA.fromRGBA(this.rgba);\n    }\n    constructor(arg) {\n        if (!arg) {\n            throw new Error('Color needs a value');\n        }\n        else if (arg instanceof RGBA) {\n            this.rgba = arg;\n        }\n        else if (arg instanceof HSLA) {\n            this._hsla = arg;\n            this.rgba = HSLA.toRGBA(arg);\n        }\n        else if (arg instanceof HSVA) {\n            this._hsva = arg;\n            this.rgba = HSVA.toRGBA(arg);\n        }\n        else {\n            throw new Error('Invalid color ctor argument');\n        }\n    }\n    equals(other) {\n        return !!other && RGBA.equals(this.rgba, other.rgba) && HSLA.equals(this.hsla, other.hsla) && HSVA.equals(this.hsva, other.hsva);\n    }\n    /**\n     * http://www.w3.org/TR/WCAG20/#relativeluminancedef\n     * Returns the number in the set [0, 1]. O => Darkest Black. 1 => Lightest white.\n     */\n    getRelativeLuminance() {\n        const R = Color._relativeLuminanceForComponent(this.rgba.r);\n        const G = Color._relativeLuminanceForComponent(this.rgba.g);\n        const B = Color._relativeLuminanceForComponent(this.rgba.b);\n        const luminance = 0.2126 * R + 0.7152 * G + 0.0722 * B;\n        return roundFloat(luminance, 4);\n    }\n    static _relativeLuminanceForComponent(color) {\n        const c = color / 255;\n        return (c <= 0.03928) ? c / 12.92 : Math.pow(((c + 0.055) / 1.055), 2.4);\n    }\n    /**\n     *\thttp://24ways.org/2010/calculating-color-contrast\n     *  Return 'true' if lighter color otherwise 'false'\n     */\n    isLighter() {\n        const yiq = (this.rgba.r * 299 + this.rgba.g * 587 + this.rgba.b * 114) / 1000;\n        return yiq >= 128;\n    }\n    isLighterThan(another) {\n        const lum1 = this.getRelativeLuminance();\n        const lum2 = another.getRelativeLuminance();\n        return lum1 > lum2;\n    }\n    isDarkerThan(another) {\n        const lum1 = this.getRelativeLuminance();\n        const lum2 = another.getRelativeLuminance();\n        return lum1 < lum2;\n    }\n    lighten(factor) {\n        return new Color(new HSLA(this.hsla.h, this.hsla.s, this.hsla.l + this.hsla.l * factor, this.hsla.a));\n    }\n    darken(factor) {\n        return new Color(new HSLA(this.hsla.h, this.hsla.s, this.hsla.l - this.hsla.l * factor, this.hsla.a));\n    }\n    transparent(factor) {\n        const { r, g, b, a } = this.rgba;\n        return new Color(new RGBA(r, g, b, a * factor));\n    }\n    isTransparent() {\n        return this.rgba.a === 0;\n    }\n    isOpaque() {\n        return this.rgba.a === 1;\n    }\n    opposite() {\n        return new Color(new RGBA(255 - this.rgba.r, 255 - this.rgba.g, 255 - this.rgba.b, this.rgba.a));\n    }\n    /**\n     * Mixes the current color with the provided color based on the given factor.\n     * @param color The color to mix with\n     * @param factor The factor of mixing (0 means this color, 1 means the input color, 0.5 means equal mix)\n     * @returns A new color representing the mix\n     */\n    mix(color, factor = 0.5) {\n        const normalize = Math.min(Math.max(factor, 0), 1);\n        const thisRGBA = this.rgba;\n        const otherRGBA = color.rgba;\n        const r = thisRGBA.r + (otherRGBA.r - thisRGBA.r) * normalize;\n        const g = thisRGBA.g + (otherRGBA.g - thisRGBA.g) * normalize;\n        const b = thisRGBA.b + (otherRGBA.b - thisRGBA.b) * normalize;\n        const a = thisRGBA.a + (otherRGBA.a - thisRGBA.a) * normalize;\n        return new Color(new RGBA(r, g, b, a));\n    }\n    makeOpaque(opaqueBackground) {\n        if (this.isOpaque() || opaqueBackground.rgba.a !== 1) {\n            // only allow to blend onto a non-opaque color onto a opaque color\n            return this;\n        }\n        const { r, g, b, a } = this.rgba;\n        // https://stackoverflow.com/questions/12228548/finding-equivalent-color-with-opacity\n        return new Color(new RGBA(opaqueBackground.rgba.r - a * (opaqueBackground.rgba.r - r), opaqueBackground.rgba.g - a * (opaqueBackground.rgba.g - g), opaqueBackground.rgba.b - a * (opaqueBackground.rgba.b - b), 1));\n    }\n    toString() {\n        if (!this._toString) {\n            this._toString = Color.Format.CSS.format(this);\n        }\n        return this._toString;\n    }\n    toNumber32Bit() {\n        if (!this._toNumber32Bit) {\n            this._toNumber32Bit = (this.rgba.r /*  */ << 24 |\n                this.rgba.g /*  */ << 16 |\n                this.rgba.b /*  */ << 8 |\n                this.rgba.a * 0xFF << 0) >>> 0;\n        }\n        return this._toNumber32Bit;\n    }\n    static getLighterColor(of, relative, factor) {\n        if (of.isLighterThan(relative)) {\n            return of;\n        }\n        factor = factor ? factor : 0.5;\n        const lum1 = of.getRelativeLuminance();\n        const lum2 = relative.getRelativeLuminance();\n        factor = factor * (lum2 - lum1) / lum2;\n        return of.lighten(factor);\n    }\n    static getDarkerColor(of, relative, factor) {\n        if (of.isDarkerThan(relative)) {\n            return of;\n        }\n        factor = factor ? factor : 0.5;\n        const lum1 = of.getRelativeLuminance();\n        const lum2 = relative.getRelativeLuminance();\n        factor = factor * (lum1 - lum2) / lum1;\n        return of.darken(factor);\n    }\n    static { this.white = new Color(new RGBA(255, 255, 255, 1)); }\n    static { this.black = new Color(new RGBA(0, 0, 0, 1)); }\n    static { this.red = new Color(new RGBA(255, 0, 0, 1)); }\n    static { this.blue = new Color(new RGBA(0, 0, 255, 1)); }\n    static { this.green = new Color(new RGBA(0, 255, 0, 1)); }\n    static { this.cyan = new Color(new RGBA(0, 255, 255, 1)); }\n    static { this.lightgrey = new Color(new RGBA(211, 211, 211, 1)); }\n    static { this.transparent = new Color(new RGBA(0, 0, 0, 0)); }\n}\n(function (Color) {\n    (function (Format) {\n        (function (CSS) {\n            function formatRGB(color) {\n                if (color.rgba.a === 1) {\n                    return `rgb(${color.rgba.r}, ${color.rgba.g}, ${color.rgba.b})`;\n                }\n                return Color.Format.CSS.formatRGBA(color);\n            }\n            CSS.formatRGB = formatRGB;\n            function formatRGBA(color) {\n                return `rgba(${color.rgba.r}, ${color.rgba.g}, ${color.rgba.b}, ${+(color.rgba.a).toFixed(2)})`;\n            }\n            CSS.formatRGBA = formatRGBA;\n            function formatHSL(color) {\n                if (color.hsla.a === 1) {\n                    return `hsl(${color.hsla.h}, ${Math.round(color.hsla.s * 100)}%, ${Math.round(color.hsla.l * 100)}%)`;\n                }\n                return Color.Format.CSS.formatHSLA(color);\n            }\n            CSS.formatHSL = formatHSL;\n            function formatHSLA(color) {\n                return `hsla(${color.hsla.h}, ${Math.round(color.hsla.s * 100)}%, ${Math.round(color.hsla.l * 100)}%, ${color.hsla.a.toFixed(2)})`;\n            }\n            CSS.formatHSLA = formatHSLA;\n            function _toTwoDigitHex(n) {\n                const r = n.toString(16);\n                return r.length !== 2 ? '0' + r : r;\n            }\n            /**\n             * Formats the color as #RRGGBB\n             */\n            function formatHex(color) {\n                return `#${_toTwoDigitHex(color.rgba.r)}${_toTwoDigitHex(color.rgba.g)}${_toTwoDigitHex(color.rgba.b)}`;\n            }\n            CSS.formatHex = formatHex;\n            /**\n             * Formats the color as #RRGGBBAA\n             * If 'compact' is set, colors without transparancy will be printed as #RRGGBB\n             */\n            function formatHexA(color, compact = false) {\n                if (compact && color.rgba.a === 1) {\n                    return Color.Format.CSS.formatHex(color);\n                }\n                return `#${_toTwoDigitHex(color.rgba.r)}${_toTwoDigitHex(color.rgba.g)}${_toTwoDigitHex(color.rgba.b)}${_toTwoDigitHex(Math.round(color.rgba.a * 255))}`;\n            }\n            CSS.formatHexA = formatHexA;\n            /**\n             * The default format will use HEX if opaque and RGBA otherwise.\n             */\n            function format(color) {\n                if (color.isOpaque()) {\n                    return Color.Format.CSS.formatHex(color);\n                }\n                return Color.Format.CSS.formatRGBA(color);\n            }\n            CSS.format = format;\n            /**\n             * Parse a CSS color and return a {@link Color}.\n             * @param css The CSS color to parse.\n             * @see https://drafts.csswg.org/css-color/#typedef-color\n             */\n            function parse(css) {\n                if (css === 'transparent') {\n                    return Color.transparent;\n                }\n                if (css.startsWith('#')) {\n                    return parseHex(css);\n                }\n                if (css.startsWith('rgba(')) {\n                    const color = css.match(/rgba\\((?<r>(?:\\+|-)?\\d+), *(?<g>(?:\\+|-)?\\d+), *(?<b>(?:\\+|-)?\\d+), *(?<a>(?:\\+|-)?\\d+(\\.\\d+)?)\\)/);\n                    if (!color) {\n                        throw new Error('Invalid color format ' + css);\n                    }\n                    const r = parseInt(color.groups?.r ?? '0');\n                    const g = parseInt(color.groups?.g ?? '0');\n                    const b = parseInt(color.groups?.b ?? '0');\n                    const a = parseFloat(color.groups?.a ?? '0');\n                    return new Color(new RGBA(r, g, b, a));\n                }\n                if (css.startsWith('rgb(')) {\n                    const color = css.match(/rgb\\((?<r>(?:\\+|-)?\\d+), *(?<g>(?:\\+|-)?\\d+), *(?<b>(?:\\+|-)?\\d+)\\)/);\n                    if (!color) {\n                        throw new Error('Invalid color format ' + css);\n                    }\n                    const r = parseInt(color.groups?.r ?? '0');\n                    const g = parseInt(color.groups?.g ?? '0');\n                    const b = parseInt(color.groups?.b ?? '0');\n                    return new Color(new RGBA(r, g, b));\n                }\n                // TODO: Support more formats as needed\n                return parseNamedKeyword(css);\n            }\n            CSS.parse = parse;\n            function parseNamedKeyword(css) {\n                // https://drafts.csswg.org/css-color/#named-colors\n                switch (css) {\n                    case 'aliceblue': return new Color(new RGBA(240, 248, 255, 1));\n                    case 'antiquewhite': return new Color(new RGBA(250, 235, 215, 1));\n                    case 'aqua': return new Color(new RGBA(0, 255, 255, 1));\n                    case 'aquamarine': return new Color(new RGBA(127, 255, 212, 1));\n                    case 'azure': return new Color(new RGBA(240, 255, 255, 1));\n                    case 'beige': return new Color(new RGBA(245, 245, 220, 1));\n                    case 'bisque': return new Color(new RGBA(255, 228, 196, 1));\n                    case 'black': return new Color(new RGBA(0, 0, 0, 1));\n                    case 'blanchedalmond': return new Color(new RGBA(255, 235, 205, 1));\n                    case 'blue': return new Color(new RGBA(0, 0, 255, 1));\n                    case 'blueviolet': return new Color(new RGBA(138, 43, 226, 1));\n                    case 'brown': return new Color(new RGBA(165, 42, 42, 1));\n                    case 'burlywood': return new Color(new RGBA(222, 184, 135, 1));\n                    case 'cadetblue': return new Color(new RGBA(95, 158, 160, 1));\n                    case 'chartreuse': return new Color(new RGBA(127, 255, 0, 1));\n                    case 'chocolate': return new Color(new RGBA(210, 105, 30, 1));\n                    case 'coral': return new Color(new RGBA(255, 127, 80, 1));\n                    case 'cornflowerblue': return new Color(new RGBA(100, 149, 237, 1));\n                    case 'cornsilk': return new Color(new RGBA(255, 248, 220, 1));\n                    case 'crimson': return new Color(new RGBA(220, 20, 60, 1));\n                    case 'cyan': return new Color(new RGBA(0, 255, 255, 1));\n                    case 'darkblue': return new Color(new RGBA(0, 0, 139, 1));\n                    case 'darkcyan': return new Color(new RGBA(0, 139, 139, 1));\n                    case 'darkgoldenrod': return new Color(new RGBA(184, 134, 11, 1));\n                    case 'darkgray': return new Color(new RGBA(169, 169, 169, 1));\n                    case 'darkgreen': return new Color(new RGBA(0, 100, 0, 1));\n                    case 'darkgrey': return new Color(new RGBA(169, 169, 169, 1));\n                    case 'darkkhaki': return new Color(new RGBA(189, 183, 107, 1));\n                    case 'darkmagenta': return new Color(new RGBA(139, 0, 139, 1));\n                    case 'darkolivegreen': return new Color(new RGBA(85, 107, 47, 1));\n                    case 'darkorange': return new Color(new RGBA(255, 140, 0, 1));\n                    case 'darkorchid': return new Color(new RGBA(153, 50, 204, 1));\n                    case 'darkred': return new Color(new RGBA(139, 0, 0, 1));\n                    case 'darksalmon': return new Color(new RGBA(233, 150, 122, 1));\n                    case 'darkseagreen': return new Color(new RGBA(143, 188, 143, 1));\n                    case 'darkslateblue': return new Color(new RGBA(72, 61, 139, 1));\n                    case 'darkslategray': return new Color(new RGBA(47, 79, 79, 1));\n                    case 'darkslategrey': return new Color(new RGBA(47, 79, 79, 1));\n                    case 'darkturquoise': return new Color(new RGBA(0, 206, 209, 1));\n                    case 'darkviolet': return new Color(new RGBA(148, 0, 211, 1));\n                    case 'deeppink': return new Color(new RGBA(255, 20, 147, 1));\n                    case 'deepskyblue': return new Color(new RGBA(0, 191, 255, 1));\n                    case 'dimgray': return new Color(new RGBA(105, 105, 105, 1));\n                    case 'dimgrey': return new Color(new RGBA(105, 105, 105, 1));\n                    case 'dodgerblue': return new Color(new RGBA(30, 144, 255, 1));\n                    case 'firebrick': return new Color(new RGBA(178, 34, 34, 1));\n                    case 'floralwhite': return new Color(new RGBA(255, 250, 240, 1));\n                    case 'forestgreen': return new Color(new RGBA(34, 139, 34, 1));\n                    case 'fuchsia': return new Color(new RGBA(255, 0, 255, 1));\n                    case 'gainsboro': return new Color(new RGBA(220, 220, 220, 1));\n                    case 'ghostwhite': return new Color(new RGBA(248, 248, 255, 1));\n                    case 'gold': return new Color(new RGBA(255, 215, 0, 1));\n                    case 'goldenrod': return new Color(new RGBA(218, 165, 32, 1));\n                    case 'gray': return new Color(new RGBA(128, 128, 128, 1));\n                    case 'green': return new Color(new RGBA(0, 128, 0, 1));\n                    case 'greenyellow': return new Color(new RGBA(173, 255, 47, 1));\n                    case 'grey': return new Color(new RGBA(128, 128, 128, 1));\n                    case 'honeydew': return new Color(new RGBA(240, 255, 240, 1));\n                    case 'hotpink': return new Color(new RGBA(255, 105, 180, 1));\n                    case 'indianred': return new Color(new RGBA(205, 92, 92, 1));\n                    case 'indigo': return new Color(new RGBA(75, 0, 130, 1));\n                    case 'ivory': return new Color(new RGBA(255, 255, 240, 1));\n                    case 'khaki': return new Color(new RGBA(240, 230, 140, 1));\n                    case 'lavender': return new Color(new RGBA(230, 230, 250, 1));\n                    case 'lavenderblush': return new Color(new RGBA(255, 240, 245, 1));\n                    case 'lawngreen': return new Color(new RGBA(124, 252, 0, 1));\n                    case 'lemonchiffon': return new Color(new RGBA(255, 250, 205, 1));\n                    case 'lightblue': return new Color(new RGBA(173, 216, 230, 1));\n                    case 'lightcoral': return new Color(new RGBA(240, 128, 128, 1));\n                    case 'lightcyan': return new Color(new RGBA(224, 255, 255, 1));\n                    case 'lightgoldenrodyellow': return new Color(new RGBA(250, 250, 210, 1));\n                    case 'lightgray': return new Color(new RGBA(211, 211, 211, 1));\n                    case 'lightgreen': return new Color(new RGBA(144, 238, 144, 1));\n                    case 'lightgrey': return new Color(new RGBA(211, 211, 211, 1));\n                    case 'lightpink': return new Color(new RGBA(255, 182, 193, 1));\n                    case 'lightsalmon': return new Color(new RGBA(255, 160, 122, 1));\n                    case 'lightseagreen': return new Color(new RGBA(32, 178, 170, 1));\n                    case 'lightskyblue': return new Color(new RGBA(135, 206, 250, 1));\n                    case 'lightslategray': return new Color(new RGBA(119, 136, 153, 1));\n                    case 'lightslategrey': return new Color(new RGBA(119, 136, 153, 1));\n                    case 'lightsteelblue': return new Color(new RGBA(176, 196, 222, 1));\n                    case 'lightyellow': return new Color(new RGBA(255, 255, 224, 1));\n                    case 'lime': return new Color(new RGBA(0, 255, 0, 1));\n                    case 'limegreen': return new Color(new RGBA(50, 205, 50, 1));\n                    case 'linen': return new Color(new RGBA(250, 240, 230, 1));\n                    case 'magenta': return new Color(new RGBA(255, 0, 255, 1));\n                    case 'maroon': return new Color(new RGBA(128, 0, 0, 1));\n                    case 'mediumaquamarine': return new Color(new RGBA(102, 205, 170, 1));\n                    case 'mediumblue': return new Color(new RGBA(0, 0, 205, 1));\n                    case 'mediumorchid': return new Color(new RGBA(186, 85, 211, 1));\n                    case 'mediumpurple': return new Color(new RGBA(147, 112, 219, 1));\n                    case 'mediumseagreen': return new Color(new RGBA(60, 179, 113, 1));\n                    case 'mediumslateblue': return new Color(new RGBA(123, 104, 238, 1));\n                    case 'mediumspringgreen': return new Color(new RGBA(0, 250, 154, 1));\n                    case 'mediumturquoise': return new Color(new RGBA(72, 209, 204, 1));\n                    case 'mediumvioletred': return new Color(new RGBA(199, 21, 133, 1));\n                    case 'midnightblue': return new Color(new RGBA(25, 25, 112, 1));\n                    case 'mintcream': return new Color(new RGBA(245, 255, 250, 1));\n                    case 'mistyrose': return new Color(new RGBA(255, 228, 225, 1));\n                    case 'moccasin': return new Color(new RGBA(255, 228, 181, 1));\n                    case 'navajowhite': return new Color(new RGBA(255, 222, 173, 1));\n                    case 'navy': return new Color(new RGBA(0, 0, 128, 1));\n                    case 'oldlace': return new Color(new RGBA(253, 245, 230, 1));\n                    case 'olive': return new Color(new RGBA(128, 128, 0, 1));\n                    case 'olivedrab': return new Color(new RGBA(107, 142, 35, 1));\n                    case 'orange': return new Color(new RGBA(255, 165, 0, 1));\n                    case 'orangered': return new Color(new RGBA(255, 69, 0, 1));\n                    case 'orchid': return new Color(new RGBA(218, 112, 214, 1));\n                    case 'palegoldenrod': return new Color(new RGBA(238, 232, 170, 1));\n                    case 'palegreen': return new Color(new RGBA(152, 251, 152, 1));\n                    case 'paleturquoise': return new Color(new RGBA(175, 238, 238, 1));\n                    case 'palevioletred': return new Color(new RGBA(219, 112, 147, 1));\n                    case 'papayawhip': return new Color(new RGBA(255, 239, 213, 1));\n                    case 'peachpuff': return new Color(new RGBA(255, 218, 185, 1));\n                    case 'peru': return new Color(new RGBA(205, 133, 63, 1));\n                    case 'pink': return new Color(new RGBA(255, 192, 203, 1));\n                    case 'plum': return new Color(new RGBA(221, 160, 221, 1));\n                    case 'powderblue': return new Color(new RGBA(176, 224, 230, 1));\n                    case 'purple': return new Color(new RGBA(128, 0, 128, 1));\n                    case 'rebeccapurple': return new Color(new RGBA(102, 51, 153, 1));\n                    case 'red': return new Color(new RGBA(255, 0, 0, 1));\n                    case 'rosybrown': return new Color(new RGBA(188, 143, 143, 1));\n                    case 'royalblue': return new Color(new RGBA(65, 105, 225, 1));\n                    case 'saddlebrown': return new Color(new RGBA(139, 69, 19, 1));\n                    case 'salmon': return new Color(new RGBA(250, 128, 114, 1));\n                    case 'sandybrown': return new Color(new RGBA(244, 164, 96, 1));\n                    case 'seagreen': return new Color(new RGBA(46, 139, 87, 1));\n                    case 'seashell': return new Color(new RGBA(255, 245, 238, 1));\n                    case 'sienna': return new Color(new RGBA(160, 82, 45, 1));\n                    case 'silver': return new Color(new RGBA(192, 192, 192, 1));\n                    case 'skyblue': return new Color(new RGBA(135, 206, 235, 1));\n                    case 'slateblue': return new Color(new RGBA(106, 90, 205, 1));\n                    case 'slategray': return new Color(new RGBA(112, 128, 144, 1));\n                    case 'slategrey': return new Color(new RGBA(112, 128, 144, 1));\n                    case 'snow': return new Color(new RGBA(255, 250, 250, 1));\n                    case 'springgreen': return new Color(new RGBA(0, 255, 127, 1));\n                    case 'steelblue': return new Color(new RGBA(70, 130, 180, 1));\n                    case 'tan': return new Color(new RGBA(210, 180, 140, 1));\n                    case 'teal': return new Color(new RGBA(0, 128, 128, 1));\n                    case 'thistle': return new Color(new RGBA(216, 191, 216, 1));\n                    case 'tomato': return new Color(new RGBA(255, 99, 71, 1));\n                    case 'turquoise': return new Color(new RGBA(64, 224, 208, 1));\n                    case 'violet': return new Color(new RGBA(238, 130, 238, 1));\n                    case 'wheat': return new Color(new RGBA(245, 222, 179, 1));\n                    case 'white': return new Color(new RGBA(255, 255, 255, 1));\n                    case 'whitesmoke': return new Color(new RGBA(245, 245, 245, 1));\n                    case 'yellow': return new Color(new RGBA(255, 255, 0, 1));\n                    case 'yellowgreen': return new Color(new RGBA(154, 205, 50, 1));\n                    default: return null;\n                }\n            }\n            /**\n             * Converts an Hex color value to a Color.\n             * returns r, g, and b are contained in the set [0, 255]\n             * @param hex string (#RGB, #RGBA, #RRGGBB or #RRGGBBAA).\n             */\n            function parseHex(hex) {\n                const length = hex.length;\n                if (length === 0) {\n                    // Invalid color\n                    return null;\n                }\n                if (hex.charCodeAt(0) !== 35 /* CharCode.Hash */) {\n                    // Does not begin with a #\n                    return null;\n                }\n                if (length === 7) {\n                    // #RRGGBB format\n                    const r = 16 * _parseHexDigit(hex.charCodeAt(1)) + _parseHexDigit(hex.charCodeAt(2));\n                    const g = 16 * _parseHexDigit(hex.charCodeAt(3)) + _parseHexDigit(hex.charCodeAt(4));\n                    const b = 16 * _parseHexDigit(hex.charCodeAt(5)) + _parseHexDigit(hex.charCodeAt(6));\n                    return new Color(new RGBA(r, g, b, 1));\n                }\n                if (length === 9) {\n                    // #RRGGBBAA format\n                    const r = 16 * _parseHexDigit(hex.charCodeAt(1)) + _parseHexDigit(hex.charCodeAt(2));\n                    const g = 16 * _parseHexDigit(hex.charCodeAt(3)) + _parseHexDigit(hex.charCodeAt(4));\n                    const b = 16 * _parseHexDigit(hex.charCodeAt(5)) + _parseHexDigit(hex.charCodeAt(6));\n                    const a = 16 * _parseHexDigit(hex.charCodeAt(7)) + _parseHexDigit(hex.charCodeAt(8));\n                    return new Color(new RGBA(r, g, b, a / 255));\n                }\n                if (length === 4) {\n                    // #RGB format\n                    const r = _parseHexDigit(hex.charCodeAt(1));\n                    const g = _parseHexDigit(hex.charCodeAt(2));\n                    const b = _parseHexDigit(hex.charCodeAt(3));\n                    return new Color(new RGBA(16 * r + r, 16 * g + g, 16 * b + b));\n                }\n                if (length === 5) {\n                    // #RGBA format\n                    const r = _parseHexDigit(hex.charCodeAt(1));\n                    const g = _parseHexDigit(hex.charCodeAt(2));\n                    const b = _parseHexDigit(hex.charCodeAt(3));\n                    const a = _parseHexDigit(hex.charCodeAt(4));\n                    return new Color(new RGBA(16 * r + r, 16 * g + g, 16 * b + b, (16 * a + a) / 255));\n                }\n                // Invalid color\n                return null;\n            }\n            CSS.parseHex = parseHex;\n            function _parseHexDigit(charCode) {\n                switch (charCode) {\n                    case 48 /* CharCode.Digit0 */: return 0;\n                    case 49 /* CharCode.Digit1 */: return 1;\n                    case 50 /* CharCode.Digit2 */: return 2;\n                    case 51 /* CharCode.Digit3 */: return 3;\n                    case 52 /* CharCode.Digit4 */: return 4;\n                    case 53 /* CharCode.Digit5 */: return 5;\n                    case 54 /* CharCode.Digit6 */: return 6;\n                    case 55 /* CharCode.Digit7 */: return 7;\n                    case 56 /* CharCode.Digit8 */: return 8;\n                    case 57 /* CharCode.Digit9 */: return 9;\n                    case 97 /* CharCode.a */: return 10;\n                    case 65 /* CharCode.A */: return 10;\n                    case 98 /* CharCode.b */: return 11;\n                    case 66 /* CharCode.B */: return 11;\n                    case 99 /* CharCode.c */: return 12;\n                    case 67 /* CharCode.C */: return 12;\n                    case 100 /* CharCode.d */: return 13;\n                    case 68 /* CharCode.D */: return 13;\n                    case 101 /* CharCode.e */: return 14;\n                    case 69 /* CharCode.E */: return 14;\n                    case 102 /* CharCode.f */: return 15;\n                    case 70 /* CharCode.F */: return 15;\n                }\n                return 0;\n            }\n        })(Format.CSS || (Format.CSS = {}));\n    })(Color.Format || (Color.Format = {}));\n})(Color || (Color = {}));\n\nexport { Color, HSLA, HSVA, RGBA };\n","import { Color, HSLA } from '../../../base/common/color.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction _parseCaptureGroups(captureGroups) {\n    const values = [];\n    for (const captureGroup of captureGroups) {\n        const parsedNumber = Number(captureGroup);\n        if (parsedNumber || parsedNumber === 0 && captureGroup.replace(/\\s/g, '') !== '') {\n            values.push(parsedNumber);\n        }\n    }\n    return values;\n}\nfunction _toIColor(r, g, b, a) {\n    return {\n        red: r / 255,\n        blue: b / 255,\n        green: g / 255,\n        alpha: a\n    };\n}\nfunction _findRange(model, match) {\n    const index = match.index;\n    const length = match[0].length;\n    if (index === undefined) {\n        return;\n    }\n    const startPosition = model.positionAt(index);\n    const range = {\n        startLineNumber: startPosition.lineNumber,\n        startColumn: startPosition.column,\n        endLineNumber: startPosition.lineNumber,\n        endColumn: startPosition.column + length\n    };\n    return range;\n}\nfunction _findHexColorInformation(range, hexValue) {\n    if (!range) {\n        return;\n    }\n    const parsedHexColor = Color.Format.CSS.parseHex(hexValue);\n    if (!parsedHexColor) {\n        return;\n    }\n    return {\n        range: range,\n        color: _toIColor(parsedHexColor.rgba.r, parsedHexColor.rgba.g, parsedHexColor.rgba.b, parsedHexColor.rgba.a)\n    };\n}\nfunction _findRGBColorInformation(range, matches, isAlpha) {\n    if (!range || matches.length !== 1) {\n        return;\n    }\n    const match = matches[0];\n    const captureGroups = match.values();\n    const parsedRegex = _parseCaptureGroups(captureGroups);\n    return {\n        range: range,\n        color: _toIColor(parsedRegex[0], parsedRegex[1], parsedRegex[2], isAlpha ? parsedRegex[3] : 1)\n    };\n}\nfunction _findHSLColorInformation(range, matches, isAlpha) {\n    if (!range || matches.length !== 1) {\n        return;\n    }\n    const match = matches[0];\n    const captureGroups = match.values();\n    const parsedRegex = _parseCaptureGroups(captureGroups);\n    const colorEquivalent = new Color(new HSLA(parsedRegex[0], parsedRegex[1] / 100, parsedRegex[2] / 100, isAlpha ? parsedRegex[3] : 1));\n    return {\n        range: range,\n        color: _toIColor(colorEquivalent.rgba.r, colorEquivalent.rgba.g, colorEquivalent.rgba.b, colorEquivalent.rgba.a)\n    };\n}\nfunction _findMatches(model, regex) {\n    if (typeof model === 'string') {\n        return [...model.matchAll(regex)];\n    }\n    else {\n        return model.findMatches(regex);\n    }\n}\nfunction computeColors(model) {\n    const result = [];\n    // Early validation for RGB and HSL\n    const 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|(?<=['\"\\s])(#)([A-Fa-f0-9]{3})\\b|(?<=['\"\\s])(#)([A-Fa-f0-9]{4})\\b|(?<=['\"\\s])(#)([A-Fa-f0-9]{6})\\b|(?<=['\"\\s])(#)([A-Fa-f0-9]{8})\\b/gm;\n    const initialValidationMatches = _findMatches(model, initialValidationRegex);\n    // Potential colors have been found, validate the parameters\n    if (initialValidationMatches.length > 0) {\n        for (const initialMatch of initialValidationMatches) {\n            const initialCaptureGroups = initialMatch.filter(captureGroup => captureGroup !== undefined);\n            const colorScheme = initialCaptureGroups[1];\n            const colorParameters = initialCaptureGroups[2];\n            if (!colorParameters) {\n                continue;\n            }\n            let colorInformation;\n            if (colorScheme === 'rgb') {\n                const 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                colorInformation = _findRGBColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), false);\n            }\n            else if (colorScheme === 'rgba') {\n                const 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                colorInformation = _findRGBColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), true);\n            }\n            else if (colorScheme === 'hsl') {\n                const regexParameters = /^\\(\\s*((?:360(?:\\.0+)?|(?:36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])(?:\\.\\d+)?))\\s*[\\s,]\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*[\\s,]\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*\\)$/gm;\n                colorInformation = _findHSLColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), false);\n            }\n            else if (colorScheme === 'hsla') {\n                const regexParameters = /^\\(\\s*((?:360(?:\\.0+)?|(?:36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])(?:\\.\\d+)?))\\s*[\\s,]\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*[\\s,]\\s*(100|\\d{1,2}[.]\\d*|\\d{1,2})%\\s*[\\s,]\\s*(0[.][0-9]+|[.][0-9]+|[01][.]0*|[01])\\s*\\)$/gm;\n                colorInformation = _findHSLColorInformation(_findRange(model, initialMatch), _findMatches(colorParameters, regexParameters), true);\n            }\n            else if (colorScheme === '#') {\n                colorInformation = _findHexColorInformation(_findRange(model, initialMatch), colorScheme + colorParameters);\n            }\n            if (colorInformation) {\n                result.push(colorInformation);\n            }\n        }\n    }\n    return result;\n}\n/**\n * Returns an array of all default document colors in the provided document\n */\nfunction computeDefaultDocumentColors(model) {\n    if (!model || typeof model.getValue !== 'function' || typeof model.positionAt !== 'function') {\n        // Unknown caller!\n        return [];\n    }\n    return computeColors(model);\n}\n\nexport { computeDefaultDocumentColors };\n","import { isMultilineRegexSource } from '../model/textModelSearch.js';\nimport { regExpLeadsToEndlessLoop } from '../../../base/common/strings.js';\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 *--------------------------------------------------------------------------------------------*/\nconst trimDashesRegex = /^-+|-+$/g;\nconst CHUNK_SIZE = 100;\nconst MAX_SECTION_LINES = 5;\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 */\nfunction findSectionHeaders(model, options) {\n    let headers = [];\n    if (options.findRegionSectionHeaders && options.foldingRules?.markers) {\n        const regionHeaders = collectRegionHeaders(model, options);\n        headers = headers.concat(regionHeaders);\n    }\n    if (options.findMarkSectionHeaders) {\n        const markHeaders = collectMarkHeaders(model, options);\n        headers = headers.concat(markHeaders);\n    }\n    return headers;\n}\nfunction collectRegionHeaders(model, options) {\n    const regionHeaders = [];\n    const endLineNumber = model.getLineCount();\n    for (let lineNumber = 1; lineNumber <= endLineNumber; lineNumber++) {\n        const lineContent = model.getLineContent(lineNumber);\n        const match = lineContent.match(options.foldingRules.markers.start);\n        if (match) {\n            const range = { startLineNumber: lineNumber, startColumn: match[0].length + 1, endLineNumber: lineNumber, endColumn: lineContent.length + 1 };\n            if (range.endColumn > range.startColumn) {\n                const sectionHeader = {\n                    range,\n                    ...getHeaderText(lineContent.substring(match[0].length)),\n                    shouldBeInComments: false\n                };\n                if (sectionHeader.text || sectionHeader.hasSeparatorLine) {\n                    regionHeaders.push(sectionHeader);\n                }\n            }\n        }\n    }\n    return regionHeaders;\n}\nfunction collectMarkHeaders(model, options) {\n    const markHeaders = [];\n    const endLineNumber = model.getLineCount();\n    // Validate regex to prevent infinite loops\n    if (!options.markSectionHeaderRegex || options.markSectionHeaderRegex.trim() === '') {\n        return markHeaders;\n    }\n    // Create regex with flags for:\n    // - 'd' for indices to get proper match positions\n    // - 'm' for multi-line mode so ^ and $ match line starts/ends\n    // - 's' for dot-all mode so . matches newlines\n    const multiline = isMultilineRegexSource(options.markSectionHeaderRegex);\n    const regex = new RegExp(options.markSectionHeaderRegex, `gdm${multiline ? 's' : ''}`);\n    // Check if the regex would lead to an endless loop\n    if (regExpLeadsToEndlessLoop(regex)) {\n        return markHeaders;\n    }\n    // Process text in overlapping chunks for better performance\n    for (let startLine = 1; startLine <= endLineNumber; startLine += CHUNK_SIZE - MAX_SECTION_LINES) {\n        const endLine = Math.min(startLine + CHUNK_SIZE - 1, endLineNumber);\n        const lines = [];\n        // Collect lines for the current chunk\n        for (let i = startLine; i <= endLine; i++) {\n            lines.push(model.getLineContent(i));\n        }\n        const text = lines.join('\\n');\n        regex.lastIndex = 0;\n        let match;\n        while ((match = regex.exec(text)) !== null) {\n            // Calculate which line this match starts on by counting newlines before it\n            const precedingText = text.substring(0, match.index);\n            const lineOffset = (precedingText.match(/\\n/g) || []).length;\n            const lineNumber = startLine + lineOffset;\n            // Calculate match height to check overlap properly\n            const matchLines = match[0].split('\\n');\n            const matchHeight = matchLines.length;\n            const matchEndLine = lineNumber + matchHeight - 1;\n            // Calculate start column - need to find the start of the line containing the match\n            const lineStartIndex = precedingText.lastIndexOf('\\n') + 1;\n            const startColumn = match.index - lineStartIndex + 1;\n            // Calculate end column - need to handle multi-line matches\n            const lastMatchLine = matchLines[matchLines.length - 1];\n            const endColumn = matchHeight === 1 ? startColumn + match[0].length : lastMatchLine.length + 1;\n            const range = {\n                startLineNumber: lineNumber,\n                startColumn,\n                endLineNumber: matchEndLine,\n                endColumn\n            };\n            const text2 = (match.groups ?? {})['label'] ?? '';\n            const hasSeparatorLine = ((match.groups ?? {})['separator'] ?? '') !== '';\n            const sectionHeader = {\n                range,\n                text: text2,\n                hasSeparatorLine,\n                shouldBeInComments: true\n            };\n            if (sectionHeader.text || sectionHeader.hasSeparatorLine) {\n                // only push if the previous one doesn't have this same linbe\n                if (markHeaders.length === 0 || markHeaders[markHeaders.length - 1].range.endLineNumber < sectionHeader.range.startLineNumber) {\n                    markHeaders.push(sectionHeader);\n                }\n            }\n            // Move lastIndex past the current match to avoid infinite loop\n            regex.lastIndex = match.index + match[0].length;\n        }\n    }\n    return markHeaders;\n}\nfunction getHeaderText(text) {\n    text = text.trim();\n    const hasSeparatorLine = text.startsWith('-');\n    text = text.replace(trimDashesRegex, '');\n    return { text, hasSeparatorLine };\n}\n\nexport { collectMarkHeaders, findSectionHeaders };\n","import { CancellationTokenSource } from './cancellation.js';\nimport { BugIndicatingError, CancellationError } from './errors.js';\nimport { toDisposable, isDisposable } from './lifecycle.js';\nimport { setTimeout0 } from './platform.js';\nimport { MicrotaskDelay } from './symbols.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction isThenable(obj) {\n    return !!obj && typeof obj.then === 'function';\n}\n/**\n * Returns a promise that can be cancelled using the provided cancellation token.\n *\n * @remarks When cancellation is requested, the promise will be rejected with a {@link CancellationError}.\n * If the promise resolves to a disposable object, it will be automatically disposed when cancellation\n * is requested.\n *\n * @param callback A function that accepts a cancellation token and returns a promise\n * @returns A promise that can be cancelled\n */\nfunction createCancelablePromise(callback) {\n    const source = new CancellationTokenSource();\n    const thenable = callback(source.token);\n    let isCancelled = false;\n    const promise = new Promise((resolve, reject) => {\n        const subscription = source.token.onCancellationRequested(() => {\n            isCancelled = true;\n            subscription.dispose();\n            reject(new CancellationError());\n        });\n        Promise.resolve(thenable).then(value => {\n            subscription.dispose();\n            source.dispose();\n            if (!isCancelled) {\n                resolve(value);\n            }\n            else if (isDisposable(value)) {\n                // promise has been cancelled, result is disposable and will\n                // be cleaned up\n                value.dispose();\n            }\n        }, err => {\n            subscription.dispose();\n            source.dispose();\n            reject(err);\n        });\n    });\n    return new class {\n        cancel() {\n            source.cancel();\n            source.dispose();\n        }\n        then(resolve, reject) {\n            return promise.then(resolve, reject);\n        }\n        catch(reject) {\n            return this.then(undefined, reject);\n        }\n        finally(onfinally) {\n            return promise.finally(onfinally);\n        }\n    };\n}\nfunction raceCancellation(promise, token, defaultValue) {\n    return new Promise((resolve, reject) => {\n        const ref = token.onCancellationRequested(() => {\n            ref.dispose();\n            resolve(defaultValue);\n        });\n        promise.then(resolve, reject).finally(() => ref.dispose());\n    });\n}\n/**\n * Returns a promise that rejects with an {@CancellationError} as soon as the passed token is cancelled.\n * @see {@link raceCancellation}\n */\nfunction raceCancellationError(promise, token) {\n    return new Promise((resolve, reject) => {\n        const ref = token.onCancellationRequested(() => {\n            ref.dispose();\n            reject(new CancellationError());\n        });\n        promise.then(resolve, reject).finally(() => ref.dispose());\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 */\nclass Throttler {\n    constructor() {\n        this.activePromise = null;\n        this.queuedPromise = null;\n        this.queuedPromiseFactory = null;\n        this.cancellationTokenSource = new CancellationTokenSource();\n    }\n    queue(promiseFactory) {\n        if (this.cancellationTokenSource.token.isCancellationRequested) {\n            return Promise.reject(new Error('Throttler is disposed'));\n        }\n        if (this.activePromise) {\n            this.queuedPromiseFactory = promiseFactory;\n            if (!this.queuedPromise) {\n                const onComplete = () => {\n                    this.queuedPromise = null;\n                    if (this.cancellationTokenSource.token.isCancellationRequested) {\n                        return;\n                    }\n                    const result = this.queue(this.queuedPromiseFactory);\n                    this.queuedPromiseFactory = null;\n                    return result;\n                };\n                this.queuedPromise = new Promise(resolve => {\n                    this.activePromise.then(onComplete, onComplete).then(resolve);\n                });\n            }\n            return new Promise((resolve, reject) => {\n                this.queuedPromise.then(resolve, reject);\n            });\n        }\n        this.activePromise = promiseFactory(this.cancellationTokenSource.token);\n        return new Promise((resolve, reject) => {\n            this.activePromise.then((result) => {\n                this.activePromise = null;\n                resolve(result);\n            }, (err) => {\n                this.activePromise = null;\n                reject(err);\n            });\n        });\n    }\n    dispose() {\n        this.cancellationTokenSource.cancel();\n    }\n}\nconst timeoutDeferred = (timeout, fn) => {\n    let scheduled = true;\n    const handle = setTimeout(() => {\n        scheduled = false;\n        fn();\n    }, timeout);\n    return {\n        isTriggered: () => scheduled,\n        dispose: () => {\n            clearTimeout(handle);\n            scheduled = false;\n        },\n    };\n};\nconst microtaskDeferred = (fn) => {\n    let scheduled = true;\n    queueMicrotask(() => {\n        if (scheduled) {\n            scheduled = false;\n            fn();\n        }\n    });\n    return {\n        isTriggered: () => scheduled,\n        dispose: () => { scheduled = false; },\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 */\nclass Delayer {\n    constructor(defaultDelay) {\n        this.defaultDelay = defaultDelay;\n        this.deferred = null;\n        this.completionPromise = null;\n        this.doResolve = null;\n        this.doReject = null;\n        this.task = null;\n    }\n    trigger(task, delay = this.defaultDelay) {\n        this.task = task;\n        this.cancelTimeout();\n        if (!this.completionPromise) {\n            this.completionPromise = new Promise((resolve, reject) => {\n                this.doResolve = resolve;\n                this.doReject = reject;\n            }).then(() => {\n                this.completionPromise = null;\n                this.doResolve = null;\n                if (this.task) {\n                    const task = this.task;\n                    this.task = null;\n                    return task();\n                }\n                return undefined;\n            });\n        }\n        const fn = () => {\n            this.deferred = null;\n            this.doResolve?.(null);\n        };\n        this.deferred = delay === MicrotaskDelay ? microtaskDeferred(fn) : timeoutDeferred(delay, fn);\n        return this.completionPromise;\n    }\n    isTriggered() {\n        return !!this.deferred?.isTriggered();\n    }\n    cancel() {\n        this.cancelTimeout();\n        if (this.completionPromise) {\n            this.doReject?.(new CancellationError());\n            this.completionPromise = null;\n        }\n    }\n    cancelTimeout() {\n        this.deferred?.dispose();\n        this.deferred = null;\n    }\n    dispose() {\n        this.cancel();\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 */\nclass ThrottledDelayer {\n    constructor(defaultDelay) {\n        this.delayer = new Delayer(defaultDelay);\n        this.throttler = new Throttler();\n    }\n    trigger(promiseFactory, delay) {\n        return this.delayer.trigger(() => this.throttler.queue(promiseFactory), delay);\n    }\n    cancel() {\n        this.delayer.cancel();\n    }\n    dispose() {\n        this.delayer.dispose();\n        this.throttler.dispose();\n    }\n}\nfunction timeout(millis, token) {\n    if (!token) {\n        return createCancelablePromise(token => timeout(millis, token));\n    }\n    return new Promise((resolve, reject) => {\n        const handle = setTimeout(() => {\n            disposable.dispose();\n            resolve();\n        }, millis);\n        const disposable = token.onCancellationRequested(() => {\n            clearTimeout(handle);\n            disposable.dispose();\n            reject(new CancellationError());\n        });\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 */\nfunction disposableTimeout(handler, timeout = 0, store) {\n    const timer = setTimeout(() => {\n        handler();\n        if (store) {\n            disposable.dispose();\n        }\n    }, timeout);\n    const disposable = toDisposable(() => {\n        clearTimeout(timer);\n        store?.delete(disposable);\n    });\n    store?.add(disposable);\n    return disposable;\n}\nfunction first(promiseFactories, shouldStop = t => !!t, defaultValue = null) {\n    let index = 0;\n    const len = promiseFactories.length;\n    const loop = () => {\n        if (index >= len) {\n            return Promise.resolve(defaultValue);\n        }\n        const factory = promiseFactories[index++];\n        const promise = Promise.resolve(factory());\n        return promise.then(result => {\n            if (shouldStop(result)) {\n                return Promise.resolve(result);\n            }\n            return loop();\n        });\n    };\n    return loop();\n}\n/**\n * Processes tasks in the order they were scheduled.\n*/\nclass TaskQueue {\n    constructor() {\n        this._runningTask = undefined;\n        this._pendingTasks = [];\n    }\n    /**\n     * Waits for the current and pending tasks to finish, then runs and awaits the given task.\n     * If the task is skipped because of clearPending, the promise is rejected with a CancellationError.\n    */\n    schedule(task) {\n        const deferred = new DeferredPromise();\n        this._pendingTasks.push({ task, deferred, setUndefinedWhenCleared: false });\n        this._runIfNotRunning();\n        return deferred.p;\n    }\n    _runIfNotRunning() {\n        if (this._runningTask === undefined) {\n            this._processQueue();\n        }\n    }\n    async _processQueue() {\n        if (this._pendingTasks.length === 0) {\n            return;\n        }\n        const next = this._pendingTasks.shift();\n        if (!next) {\n            return;\n        }\n        if (this._runningTask) {\n            throw new BugIndicatingError();\n        }\n        this._runningTask = next.task;\n        try {\n            const result = await next.task();\n            next.deferred.complete(result);\n        }\n        catch (e) {\n            next.deferred.error(e);\n        }\n        finally {\n            this._runningTask = undefined;\n            this._processQueue();\n        }\n    }\n    /**\n     * Clears all pending tasks. Does not cancel the currently running task.\n    */\n    clearPending() {\n        const tasks = this._pendingTasks;\n        this._pendingTasks = [];\n        for (const task of tasks) {\n            if (task.setUndefinedWhenCleared) {\n                task.deferred.complete(undefined);\n            }\n            else {\n                task.deferred.error(new CancellationError());\n            }\n        }\n    }\n}\nclass TimeoutTimer {\n    constructor(runner, timeout) {\n        this._isDisposed = false;\n        this._token = undefined;\n        if (typeof runner === 'function' && typeof timeout === 'number') {\n            this.setIfNotSet(runner, timeout);\n        }\n    }\n    dispose() {\n        this.cancel();\n        this._isDisposed = true;\n    }\n    cancel() {\n        if (this._token !== undefined) {\n            clearTimeout(this._token);\n            this._token = undefined;\n        }\n    }\n    cancelAndSet(runner, timeout) {\n        if (this._isDisposed) {\n            throw new BugIndicatingError(`Calling 'cancelAndSet' on a disposed TimeoutTimer`);\n        }\n        this.cancel();\n        this._token = setTimeout(() => {\n            this._token = undefined;\n            runner();\n        }, timeout);\n    }\n    setIfNotSet(runner, timeout) {\n        if (this._isDisposed) {\n            throw new BugIndicatingError(`Calling 'setIfNotSet' on a disposed TimeoutTimer`);\n        }\n        if (this._token !== undefined) {\n            // timer is already set\n            return;\n        }\n        this._token = setTimeout(() => {\n            this._token = undefined;\n            runner();\n        }, timeout);\n    }\n}\nclass IntervalTimer {\n    constructor() {\n        this.disposable = undefined;\n        this.isDisposed = false;\n    }\n    cancel() {\n        this.disposable?.dispose();\n        this.disposable = undefined;\n    }\n    cancelAndSet(runner, interval, context = globalThis) {\n        if (this.isDisposed) {\n            throw new BugIndicatingError(`Calling 'cancelAndSet' on a disposed IntervalTimer`);\n        }\n        this.cancel();\n        const handle = context.setInterval(() => {\n            runner();\n        }, interval);\n        this.disposable = toDisposable(() => {\n            context.clearInterval(handle);\n            this.disposable = undefined;\n        });\n    }\n    dispose() {\n        this.cancel();\n        this.isDisposed = true;\n    }\n}\nclass RunOnceScheduler {\n    constructor(runner, delay) {\n        this.timeoutToken = undefined;\n        this.runner = runner;\n        this.timeout = delay;\n        this.timeoutHandler = this.onTimeout.bind(this);\n    }\n    /**\n     * Dispose RunOnceScheduler\n     */\n    dispose() {\n        this.cancel();\n        this.runner = null;\n    }\n    /**\n     * Cancel current scheduled runner (if any).\n     */\n    cancel() {\n        if (this.isScheduled()) {\n            clearTimeout(this.timeoutToken);\n            this.timeoutToken = undefined;\n        }\n    }\n    /**\n     * Cancel previous runner (if any) & schedule a new runner.\n     */\n    schedule(delay = this.timeout) {\n        this.cancel();\n        this.timeoutToken = setTimeout(this.timeoutHandler, delay);\n    }\n    get delay() {\n        return this.timeout;\n    }\n    set delay(value) {\n        this.timeout = value;\n    }\n    /**\n     * Returns true if scheduled.\n     */\n    isScheduled() {\n        return this.timeoutToken !== undefined;\n    }\n    onTimeout() {\n        this.timeoutToken = undefined;\n        if (this.runner) {\n            this.doRun();\n        }\n    }\n    doRun() {\n        this.runner?.();\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 */\nlet runWhenGlobalIdle;\nlet _runWhenIdle;\n(function () {\n    const safeGlobal = globalThis;\n    if (typeof safeGlobal.requestIdleCallback !== 'function' || typeof safeGlobal.cancelIdleCallback !== 'function') {\n        _runWhenIdle = (_targetWindow, runner, timeout) => {\n            setTimeout0(() => {\n                if (disposed) {\n                    return;\n                }\n                const end = Date.now() + 15; // one frame at 64fps\n                const deadline = {\n                    didTimeout: true,\n                    timeRemaining() {\n                        return Math.max(0, end - Date.now());\n                    }\n                };\n                runner(Object.freeze(deadline));\n            });\n            let disposed = false;\n            return {\n                dispose() {\n                    if (disposed) {\n                        return;\n                    }\n                    disposed = true;\n                }\n            };\n        };\n    }\n    else {\n        _runWhenIdle = (targetWindow, runner, timeout) => {\n            const handle = targetWindow.requestIdleCallback(runner, typeof timeout === 'number' ? { timeout } : undefined);\n            let disposed = false;\n            return {\n                dispose() {\n                    if (disposed) {\n                        return;\n                    }\n                    disposed = true;\n                    targetWindow.cancelIdleCallback(handle);\n                }\n            };\n        };\n    }\n    runWhenGlobalIdle = (runner, timeout) => _runWhenIdle(globalThis, runner, timeout);\n})();\nclass AbstractIdleValue {\n    constructor(targetWindow, executor) {\n        this._didRun = false;\n        this._executor = () => {\n            try {\n                this._value = executor();\n            }\n            catch (err) {\n                this._error = err;\n            }\n            finally {\n                this._didRun = true;\n            }\n        };\n        this._handle = _runWhenIdle(targetWindow, () => this._executor());\n    }\n    dispose() {\n        this._handle.dispose();\n    }\n    get value() {\n        if (!this._didRun) {\n            this._handle.dispose();\n            this._executor();\n        }\n        if (this._error) {\n            throw this._error;\n        }\n        return this._value;\n    }\n    get isInitialized() {\n        return this._didRun;\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 */\nclass GlobalIdleValue extends AbstractIdleValue {\n    constructor(executor) {\n        super(globalThis, executor);\n    }\n}\n/**\n * Creates a promise whose resolution or rejection can be controlled imperatively.\n */\nclass DeferredPromise {\n    get isRejected() {\n        return this.outcome?.outcome === 1 /* DeferredOutcome.Rejected */;\n    }\n    get isSettled() {\n        return !!this.outcome;\n    }\n    constructor() {\n        this.p = new Promise((c, e) => {\n            this.completeCallback = c;\n            this.errorCallback = e;\n        });\n    }\n    complete(value) {\n        if (this.isSettled) {\n            return Promise.resolve();\n        }\n        return new Promise(resolve => {\n            this.completeCallback(value);\n            this.outcome = { outcome: 0 /* DeferredOutcome.Resolved */, value };\n            resolve();\n        });\n    }\n    error(err) {\n        if (this.isSettled) {\n            return Promise.resolve();\n        }\n        return new Promise(resolve => {\n            this.errorCallback(err);\n            this.outcome = { outcome: 1 /* DeferredOutcome.Rejected */, value: err };\n            resolve();\n        });\n    }\n    cancel() {\n        return this.error(new CancellationError());\n    }\n}\n//#endregion\n//#region Promises\nvar Promises;\n(function (Promises) {\n    /**\n     * A drop-in replacement for `Promise.all` with the only difference\n     * that the method awaits every promise to either fulfill or reject.\n     *\n     * Similar to `Promise.all`, only the first error will be returned\n     * if any.\n     */\n    async function settled(promises) {\n        let firstError = undefined;\n        const result = await Promise.all(promises.map(promise => promise.then(value => value, error => {\n            if (!firstError) {\n                firstError = error;\n            }\n            return undefined; // do not rethrow so that other promises can settle\n        })));\n        if (typeof firstError !== 'undefined') {\n            throw firstError;\n        }\n        return result; // cast is needed and protected by the `throw` above\n    }\n    Promises.settled = settled;\n    /**\n     * A helper to create a new `Promise<T>` with a body that is a promise\n     * itself. By default, an error that raises from the async body will\n     * end up as a unhandled rejection, so this utility properly awaits the\n     * body and rejects the promise as a normal promise does without async\n     * body.\n     *\n     * This method should only be used in rare cases where otherwise `async`\n     * cannot be used (e.g. when callbacks are involved that require this).\n     */\n    function withAsyncBody(bodyFn) {\n        // eslint-disable-next-line no-async-promise-executor\n        return new Promise(async (resolve, reject) => {\n            try {\n                await bodyFn(resolve, reject);\n            }\n            catch (error) {\n                reject(error);\n            }\n        });\n    }\n    Promises.withAsyncBody = withAsyncBody;\n})(Promises || (Promises = {}));\nfunction createCancelableAsyncIterableProducer(callback) {\n    const source = new CancellationTokenSource();\n    const innerIterable = callback(source.token);\n    return new CancelableAsyncIterableProducer(source, async (emitter) => {\n        const subscription = source.token.onCancellationRequested(() => {\n            subscription.dispose();\n            source.dispose();\n            emitter.reject(new CancellationError());\n        });\n        try {\n            for await (const item of innerIterable) {\n                if (source.token.isCancellationRequested) {\n                    // canceled in the meantime\n                    return;\n                }\n                emitter.emitOne(item);\n            }\n            subscription.dispose();\n            source.dispose();\n        }\n        catch (err) {\n            subscription.dispose();\n            source.dispose();\n            emitter.reject(err);\n        }\n    });\n}\nclass ProducerConsumer {\n    constructor() {\n        this._unsatisfiedConsumers = [];\n        this._unconsumedValues = [];\n    }\n    get hasFinalValue() {\n        return !!this._finalValue;\n    }\n    produce(value) {\n        this._ensureNoFinalValue();\n        if (this._unsatisfiedConsumers.length > 0) {\n            const deferred = this._unsatisfiedConsumers.shift();\n            this._resolveOrRejectDeferred(deferred, value);\n        }\n        else {\n            this._unconsumedValues.push(value);\n        }\n    }\n    produceFinal(value) {\n        this._ensureNoFinalValue();\n        this._finalValue = value;\n        for (const deferred of this._unsatisfiedConsumers) {\n            this._resolveOrRejectDeferred(deferred, value);\n        }\n        this._unsatisfiedConsumers.length = 0;\n    }\n    _ensureNoFinalValue() {\n        if (this._finalValue) {\n            throw new BugIndicatingError('ProducerConsumer: cannot produce after final value has been set');\n        }\n    }\n    _resolveOrRejectDeferred(deferred, value) {\n        if (value.ok) {\n            deferred.complete(value.value);\n        }\n        else {\n            deferred.error(value.error);\n        }\n    }\n    consume() {\n        if (this._unconsumedValues.length > 0 || this._finalValue) {\n            const value = this._unconsumedValues.length > 0 ? this._unconsumedValues.shift() : this._finalValue;\n            if (value.ok) {\n                return Promise.resolve(value.value);\n            }\n            else {\n                return Promise.reject(value.error);\n            }\n        }\n        else {\n            const deferred = new DeferredPromise();\n            this._unsatisfiedConsumers.push(deferred);\n            return deferred.p;\n        }\n    }\n}\n/**\n * Important difference to AsyncIterableObject:\n * If it is iterated two times, the second iterator will not see the values emitted by the first iterator.\n */\nclass AsyncIterableProducer {\n    constructor(executor, _onReturn) {\n        this._onReturn = _onReturn;\n        this._producerConsumer = new ProducerConsumer();\n        this._iterator = {\n            next: () => this._producerConsumer.consume(),\n            return: () => {\n                this._onReturn?.();\n                return Promise.resolve({ done: true, value: undefined });\n            },\n            throw: async (e) => {\n                this._finishError(e);\n                return { done: true, value: undefined };\n            },\n        };\n        queueMicrotask(async () => {\n            const p = executor({\n                emitOne: value => this._producerConsumer.produce({ ok: true, value: { done: false, value: value } }),\n                emitMany: values => {\n                    for (const value of values) {\n                        this._producerConsumer.produce({ ok: true, value: { done: false, value: value } });\n                    }\n                },\n                reject: error => this._finishError(error),\n            });\n            if (!this._producerConsumer.hasFinalValue) {\n                try {\n                    await p;\n                    this._finishOk();\n                }\n                catch (error) {\n                    this._finishError(error);\n                }\n            }\n        });\n    }\n    static fromArray(items) {\n        return new AsyncIterableProducer((writer) => {\n            writer.emitMany(items);\n        });\n    }\n    static fromPromise(promise) {\n        return new AsyncIterableProducer(async (emitter) => {\n            emitter.emitMany(await promise);\n        });\n    }\n    static fromPromisesResolveOrder(promises) {\n        return new AsyncIterableProducer(async (emitter) => {\n            await Promise.all(promises.map(async (p) => emitter.emitOne(await p)));\n        });\n    }\n    static merge(iterables) {\n        return new AsyncIterableProducer(async (emitter) => {\n            await Promise.all(iterables.map(async (iterable) => {\n                for await (const item of iterable) {\n                    emitter.emitOne(item);\n                }\n            }));\n        });\n    }\n    static { this.EMPTY = AsyncIterableProducer.fromArray([]); }\n    static map(iterable, mapFn) {\n        return new AsyncIterableProducer(async (emitter) => {\n            for await (const item of iterable) {\n                emitter.emitOne(mapFn(item));\n            }\n        });\n    }\n    map(mapFn) {\n        return AsyncIterableProducer.map(this, mapFn);\n    }\n    static coalesce(iterable) {\n        return AsyncIterableProducer.filter(iterable, item => !!item);\n    }\n    coalesce() {\n        return AsyncIterableProducer.coalesce(this);\n    }\n    static filter(iterable, filterFn) {\n        return new AsyncIterableProducer(async (emitter) => {\n            for await (const item of iterable) {\n                if (filterFn(item)) {\n                    emitter.emitOne(item);\n                }\n            }\n        });\n    }\n    filter(filterFn) {\n        return AsyncIterableProducer.filter(this, filterFn);\n    }\n    _finishOk() {\n        if (!this._producerConsumer.hasFinalValue) {\n            this._producerConsumer.produceFinal({ ok: true, value: { done: true, value: undefined } });\n        }\n    }\n    _finishError(error) {\n        if (!this._producerConsumer.hasFinalValue) {\n            this._producerConsumer.produceFinal({ ok: false, error: error });\n        }\n        // Warning: this can cause to dropped errors.\n    }\n    [Symbol.asyncIterator]() {\n        return this._iterator;\n    }\n}\nclass CancelableAsyncIterableProducer extends AsyncIterableProducer {\n    constructor(_source, executor) {\n        super(executor);\n        this._source = _source;\n    }\n    cancel() {\n        this._source.cancel();\n    }\n}\n\nexport { AbstractIdleValue, AsyncIterableProducer, CancelableAsyncIterableProducer, DeferredPromise, Delayer, GlobalIdleValue, IntervalTimer, Promises, RunOnceScheduler, TaskQueue, ThrottledDelayer, Throttler, TimeoutTimer, _runWhenIdle, createCancelableAsyncIterableProducer, createCancelablePromise, disposableTimeout, first, isThenable, raceCancellation, raceCancellationError, runWhenGlobalIdle, timeout };\n","import { arrayInsert } from '../../../base/common/arrays.js';\nimport { toUint32 } from '../../../base/common/uint.js';\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 *--------------------------------------------------------------------------------------------*/\nclass PrefixSumComputer {\n    constructor(values) {\n        this.values = values;\n        this.prefixSum = new Uint32Array(values.length);\n        this.prefixSumValidIndex = new Int32Array(1);\n        this.prefixSumValidIndex[0] = -1;\n    }\n    insertValues(insertIndex, insertValues) {\n        insertIndex = toUint32(insertIndex);\n        const oldValues = this.values;\n        const oldPrefixSum = this.prefixSum;\n        const insertValuesLen = insertValues.length;\n        if (insertValuesLen === 0) {\n            return false;\n        }\n        this.values = new Uint32Array(oldValues.length + insertValuesLen);\n        this.values.set(oldValues.subarray(0, insertIndex), 0);\n        this.values.set(oldValues.subarray(insertIndex), insertIndex + insertValuesLen);\n        this.values.set(insertValues, insertIndex);\n        if (insertIndex - 1 < this.prefixSumValidIndex[0]) {\n            this.prefixSumValidIndex[0] = insertIndex - 1;\n        }\n        this.prefixSum = new Uint32Array(this.values.length);\n        if (this.prefixSumValidIndex[0] >= 0) {\n            this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));\n        }\n        return true;\n    }\n    setValue(index, value) {\n        index = toUint32(index);\n        value = toUint32(value);\n        if (this.values[index] === value) {\n            return false;\n        }\n        this.values[index] = value;\n        if (index - 1 < this.prefixSumValidIndex[0]) {\n            this.prefixSumValidIndex[0] = index - 1;\n        }\n        return true;\n    }\n    removeValues(startIndex, count) {\n        startIndex = toUint32(startIndex);\n        count = toUint32(count);\n        const oldValues = this.values;\n        const oldPrefixSum = this.prefixSum;\n        if (startIndex >= oldValues.length) {\n            return false;\n        }\n        const maxCount = oldValues.length - startIndex;\n        if (count >= maxCount) {\n            count = maxCount;\n        }\n        if (count === 0) {\n            return false;\n        }\n        this.values = new Uint32Array(oldValues.length - count);\n        this.values.set(oldValues.subarray(0, startIndex), 0);\n        this.values.set(oldValues.subarray(startIndex + count), startIndex);\n        this.prefixSum = new Uint32Array(this.values.length);\n        if (startIndex - 1 < this.prefixSumValidIndex[0]) {\n            this.prefixSumValidIndex[0] = startIndex - 1;\n        }\n        if (this.prefixSumValidIndex[0] >= 0) {\n            this.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));\n        }\n        return true;\n    }\n    getTotalSum() {\n        if (this.values.length === 0) {\n            return 0;\n        }\n        return this._getPrefixSum(this.values.length - 1);\n    }\n    /**\n     * Returns the sum of the first `index + 1` many items.\n     * @returns `SUM(0 <= j <= index, values[j])`.\n     */\n    getPrefixSum(index) {\n        if (index < 0) {\n            return 0;\n        }\n        index = toUint32(index);\n        return this._getPrefixSum(index);\n    }\n    _getPrefixSum(index) {\n        if (index <= this.prefixSumValidIndex[0]) {\n            return this.prefixSum[index];\n        }\n        let startIndex = this.prefixSumValidIndex[0] + 1;\n        if (startIndex === 0) {\n            this.prefixSum[0] = this.values[0];\n            startIndex++;\n        }\n        if (index >= this.values.length) {\n            index = this.values.length - 1;\n        }\n        for (let i = startIndex; i <= index; i++) {\n            this.prefixSum[i] = this.prefixSum[i - 1] + this.values[i];\n        }\n        this.prefixSumValidIndex[0] = Math.max(this.prefixSumValidIndex[0], index);\n        return this.prefixSum[index];\n    }\n    getIndexOf(sum) {\n        sum = Math.floor(sum);\n        // Compute all sums (to get a fully valid prefixSum)\n        this.getTotalSum();\n        let low = 0;\n        let high = this.values.length - 1;\n        let mid = 0;\n        let midStop = 0;\n        let midStart = 0;\n        while (low <= high) {\n            mid = low + ((high - low) / 2) | 0;\n            midStop = this.prefixSum[mid];\n            midStart = midStop - this.values[mid];\n            if (sum < midStart) {\n                high = mid - 1;\n            }\n            else if (sum >= midStop) {\n                low = mid + 1;\n            }\n            else {\n                break;\n            }\n        }\n        return new PrefixSumIndexOfResult(mid, sum - midStart);\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*/\nclass ConstantTimePrefixSumComputer {\n    constructor(values) {\n        this._values = values;\n        this._isValid = false;\n        this._validEndIndex = -1;\n        this._prefixSum = [];\n        this._indexBySum = [];\n    }\n    /**\n     * @returns SUM(0 <= j < values.length, values[j])\n     */\n    getTotalSum() {\n        this._ensureValid();\n        return this._indexBySum.length;\n    }\n    /**\n     * Returns the sum of the first `count` many items.\n     * @returns `SUM(0 <= j < count, values[j])`.\n     */\n    getPrefixSum(count) {\n        this._ensureValid();\n        if (count === 0) {\n            return 0;\n        }\n        return this._prefixSum[count - 1];\n    }\n    /**\n     * @returns `result`, such that `getPrefixSum(result.index) + result.remainder = sum`\n     */\n    getIndexOf(sum) {\n        this._ensureValid();\n        const idx = this._indexBySum[sum];\n        const viewLinesAbove = idx > 0 ? this._prefixSum[idx - 1] : 0;\n        return new PrefixSumIndexOfResult(idx, sum - viewLinesAbove);\n    }\n    removeValues(start, deleteCount) {\n        this._values.splice(start, deleteCount);\n        this._invalidate(start);\n    }\n    insertValues(insertIndex, insertArr) {\n        this._values = arrayInsert(this._values, insertIndex, insertArr);\n        this._invalidate(insertIndex);\n    }\n    _invalidate(index) {\n        this._isValid = false;\n        this._validEndIndex = Math.min(this._validEndIndex, index - 1);\n    }\n    _ensureValid() {\n        if (this._isValid) {\n            return;\n        }\n        for (let i = this._validEndIndex + 1, len = this._values.length; i < len; i++) {\n            const value = this._values[i];\n            const sumAbove = i > 0 ? this._prefixSum[i - 1] : 0;\n            this._prefixSum[i] = sumAbove + value;\n            for (let j = 0; j < value; j++) {\n                this._indexBySum[sumAbove + j] = i;\n            }\n        }\n        // trim things\n        this._prefixSum.length = this._values.length;\n        this._indexBySum.length = this._prefixSum[this._prefixSum.length - 1];\n        // mark as valid\n        this._isValid = true;\n        this._validEndIndex = this._values.length - 1;\n    }\n    setValue(index, value) {\n        if (this._values[index] === value) {\n            // no change\n            return;\n        }\n        this._values[index] = value;\n        this._invalidate(index);\n    }\n}\nclass PrefixSumIndexOfResult {\n    constructor(index, remainder) {\n        this.index = index;\n        this.remainder = remainder;\n        this._prefixSumIndexOfResultBrand = undefined;\n        this.index = index;\n        this.remainder = remainder;\n    }\n}\n\nexport { ConstantTimePrefixSumComputer, PrefixSumComputer, PrefixSumIndexOfResult };\n","import { splitLines } from '../../../base/common/strings.js';\nimport { Position } from '../core/position.js';\nimport { PrefixSumComputer } from './prefixSumComputer.js';\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 *--------------------------------------------------------------------------------------------*/\nclass MirrorTextModel {\n    constructor(uri, lines, eol, versionId) {\n        this._uri = uri;\n        this._lines = lines;\n        this._eol = eol;\n        this._versionId = versionId;\n        this._lineStarts = null;\n        this._cachedTextValue = null;\n    }\n    dispose() {\n        this._lines.length = 0;\n    }\n    get version() {\n        return this._versionId;\n    }\n    getText() {\n        if (this._cachedTextValue === null) {\n            this._cachedTextValue = this._lines.join(this._eol);\n        }\n        return this._cachedTextValue;\n    }\n    onEvents(e) {\n        if (e.eol && e.eol !== this._eol) {\n            this._eol = e.eol;\n            this._lineStarts = null;\n        }\n        // Update my lines\n        const changes = e.changes;\n        for (const change of changes) {\n            this._acceptDeleteRange(change.range);\n            this._acceptInsertText(new Position(change.range.startLineNumber, change.range.startColumn), change.text);\n        }\n        this._versionId = e.versionId;\n        this._cachedTextValue = null;\n    }\n    _ensureLineStarts() {\n        if (!this._lineStarts) {\n            const eolLength = this._eol.length;\n            const linesLength = this._lines.length;\n            const lineStartValues = new Uint32Array(linesLength);\n            for (let i = 0; i < linesLength; i++) {\n                lineStartValues[i] = this._lines[i].length + eolLength;\n            }\n            this._lineStarts = new PrefixSumComputer(lineStartValues);\n        }\n    }\n    /**\n     * All changes to a line's text go through this method\n     */\n    _setLineText(lineIndex, newValue) {\n        this._lines[lineIndex] = newValue;\n        if (this._lineStarts) {\n            // update prefix sum\n            this._lineStarts.setValue(lineIndex, this._lines[lineIndex].length + this._eol.length);\n        }\n    }\n    _acceptDeleteRange(range) {\n        if (range.startLineNumber === range.endLineNumber) {\n            if (range.startColumn === range.endColumn) {\n                // Nothing to delete\n                return;\n            }\n            // Delete text on the affected line\n            this._setLineText(range.startLineNumber - 1, this._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1)\n                + this._lines[range.startLineNumber - 1].substring(range.endColumn - 1));\n            return;\n        }\n        // Take remaining text on last line and append it to remaining text on first line\n        this._setLineText(range.startLineNumber - 1, this._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1)\n            + this._lines[range.endLineNumber - 1].substring(range.endColumn - 1));\n        // Delete middle lines\n        this._lines.splice(range.startLineNumber, range.endLineNumber - range.startLineNumber);\n        if (this._lineStarts) {\n            // update prefix sum\n            this._lineStarts.removeValues(range.startLineNumber, range.endLineNumber - range.startLineNumber);\n        }\n    }\n    _acceptInsertText(position, insertText) {\n        if (insertText.length === 0) {\n            // Nothing to insert\n            return;\n        }\n        const insertLines = splitLines(insertText);\n        if (insertLines.length === 1) {\n            // Inserting text on one line\n            this._setLineText(position.lineNumber - 1, this._lines[position.lineNumber - 1].substring(0, position.column - 1)\n                + insertLines[0]\n                + this._lines[position.lineNumber - 1].substring(position.column - 1));\n            return;\n        }\n        // Append overflowing text from first line to the end of text to insert\n        insertLines[insertLines.length - 1] += this._lines[position.lineNumber - 1].substring(position.column - 1);\n        // Delete overflowing text from first line and insert text on first line\n        this._setLineText(position.lineNumber - 1, this._lines[position.lineNumber - 1].substring(0, position.column - 1)\n            + insertLines[0]);\n        // Insert new lines & store lengths\n        const newLengths = new Uint32Array(insertLines.length - 1);\n        for (let i = 1; i < insertLines.length; i++) {\n            this._lines.splice(position.lineNumber + i - 1, 0, insertLines[i]);\n            newLengths[i - 1] = insertLines[i].length + this._eol.length;\n        }\n        if (this._lineStarts) {\n            // update prefix sum\n            this._lineStarts.insertValues(position.lineNumber, newLengths);\n        }\n    }\n}\n\nexport { MirrorTextModel };\n","import { IntervalTimer } from '../../../../base/common/async.js';\nimport { Disposable, dispose, DisposableStore, toDisposable } from '../../../../base/common/lifecycle.js';\nimport { URI } from '../../../../base/common/uri.js';\nimport { Position } from '../../core/position.js';\nimport { Range } from '../../core/range.js';\nimport { getWordAtText, ensureValidWordDefinition } from '../../core/wordHelper.js';\nimport { MirrorTextModel } from '../../model/mirrorTextModel.js';\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 * Stop syncing a model to the worker if it was not needed for 1 min.\n */\nconst STOP_SYNC_MODEL_DELTA_TIME_MS = 60 * 1000;\nclass WorkerTextModelSyncClient extends Disposable {\n    constructor(proxy, modelService, keepIdleModels = false) {\n        super();\n        this._syncedModels = Object.create(null);\n        this._syncedModelsLastUsedTime = Object.create(null);\n        this._proxy = proxy;\n        this._modelService = modelService;\n        if (!keepIdleModels) {\n            const timer = new IntervalTimer();\n            timer.cancelAndSet(() => this._checkStopModelSync(), Math.round(STOP_SYNC_MODEL_DELTA_TIME_MS / 2));\n            this._register(timer);\n        }\n    }\n    dispose() {\n        for (const modelUrl in this._syncedModels) {\n            dispose(this._syncedModels[modelUrl]);\n        }\n        this._syncedModels = Object.create(null);\n        this._syncedModelsLastUsedTime = Object.create(null);\n        super.dispose();\n    }\n    ensureSyncedResources(resources, forceLargeModels = false) {\n        for (const resource of resources) {\n            const resourceStr = resource.toString();\n            if (!this._syncedModels[resourceStr]) {\n                this._beginModelSync(resource, forceLargeModels);\n            }\n            if (this._syncedModels[resourceStr]) {\n                this._syncedModelsLastUsedTime[resourceStr] = (new Date()).getTime();\n            }\n        }\n    }\n    _checkStopModelSync() {\n        const currentTime = (new Date()).getTime();\n        const toRemove = [];\n        for (const modelUrl in this._syncedModelsLastUsedTime) {\n            const elapsedTime = currentTime - this._syncedModelsLastUsedTime[modelUrl];\n            if (elapsedTime > STOP_SYNC_MODEL_DELTA_TIME_MS) {\n                toRemove.push(modelUrl);\n            }\n        }\n        for (const e of toRemove) {\n            this._stopModelSync(e);\n        }\n    }\n    _beginModelSync(resource, forceLargeModels) {\n        const model = this._modelService.getModel(resource);\n        if (!model) {\n            return;\n        }\n        if (!forceLargeModels && model.isTooLargeForSyncing()) {\n            return;\n        }\n        const modelUrl = resource.toString();\n        this._proxy.$acceptNewModel({\n            url: model.uri.toString(),\n            lines: model.getLinesContent(),\n            EOL: model.getEOL(),\n            versionId: model.getVersionId()\n        });\n        const toDispose = new DisposableStore();\n        toDispose.add(model.onDidChangeContent((e) => {\n            this._proxy.$acceptModelChanged(modelUrl.toString(), e);\n        }));\n        toDispose.add(model.onWillDispose(() => {\n            this._stopModelSync(modelUrl);\n        }));\n        toDispose.add(toDisposable(() => {\n            this._proxy.$acceptRemovedModel(modelUrl);\n        }));\n        this._syncedModels[modelUrl] = toDispose;\n    }\n    _stopModelSync(modelUrl) {\n        const toDispose = this._syncedModels[modelUrl];\n        delete this._syncedModels[modelUrl];\n        delete this._syncedModelsLastUsedTime[modelUrl];\n        dispose(toDispose);\n    }\n}\nclass WorkerTextModelSyncServer {\n    constructor() {\n        this._models = Object.create(null);\n    }\n    getModel(uri) {\n        return this._models[uri];\n    }\n    getModels() {\n        const all = [];\n        Object.keys(this._models).forEach((key) => all.push(this._models[key]));\n        return all;\n    }\n    $acceptNewModel(data) {\n        this._models[data.url] = new MirrorModel(URI.parse(data.url), data.lines, data.EOL, data.versionId);\n    }\n    $acceptModelChanged(uri, e) {\n        if (!this._models[uri]) {\n            return;\n        }\n        const model = this._models[uri];\n        model.onEvents(e);\n    }\n    $acceptRemovedModel(uri) {\n        if (!this._models[uri]) {\n            return;\n        }\n        delete this._models[uri];\n    }\n}\nclass MirrorModel extends MirrorTextModel {\n    get uri() {\n        return this._uri;\n    }\n    get eol() {\n        return this._eol;\n    }\n    getValue() {\n        return this.getText();\n    }\n    findMatches(regex) {\n        const matches = [];\n        for (let i = 0; i < this._lines.length; i++) {\n            const line = this._lines[i];\n            const offsetToAdd = this.offsetAt(new Position(i + 1, 1));\n            const iteratorOverMatches = line.matchAll(regex);\n            for (const match of iteratorOverMatches) {\n                if (match.index || match.index === 0) {\n                    match.index = match.index + offsetToAdd;\n                }\n                matches.push(match);\n            }\n        }\n        return matches;\n    }\n    getLinesContent() {\n        return this._lines.slice(0);\n    }\n    getLineCount() {\n        return this._lines.length;\n    }\n    getLineContent(lineNumber) {\n        return this._lines[lineNumber - 1];\n    }\n    getWordAtPosition(position, wordDefinition) {\n        const wordAtText = getWordAtText(position.column, ensureValidWordDefinition(wordDefinition), this._lines[position.lineNumber - 1], 0);\n        if (wordAtText) {\n            return new Range(position.lineNumber, wordAtText.startColumn, position.lineNumber, wordAtText.endColumn);\n        }\n        return null;\n    }\n    words(wordDefinition) {\n        const lines = this._lines;\n        const wordenize = this._wordenize.bind(this);\n        let lineNumber = 0;\n        let lineText = '';\n        let wordRangesIdx = 0;\n        let wordRanges = [];\n        return {\n            *[Symbol.iterator]() {\n                while (true) {\n                    if (wordRangesIdx < wordRanges.length) {\n                        const value = lineText.substring(wordRanges[wordRangesIdx].start, wordRanges[wordRangesIdx].end);\n                        wordRangesIdx += 1;\n                        yield value;\n                    }\n                    else {\n                        if (lineNumber < lines.length) {\n                            lineText = lines[lineNumber];\n                            wordRanges = wordenize(lineText, wordDefinition);\n                            wordRangesIdx = 0;\n                            lineNumber += 1;\n                        }\n                        else {\n                            break;\n                        }\n                    }\n                }\n            }\n        };\n    }\n    getLineWords(lineNumber, wordDefinition) {\n        const content = this._lines[lineNumber - 1];\n        const ranges = this._wordenize(content, wordDefinition);\n        const words = [];\n        for (const range of ranges) {\n            words.push({\n                word: content.substring(range.start, range.end),\n                startColumn: range.start + 1,\n                endColumn: range.end + 1\n            });\n        }\n        return words;\n    }\n    _wordenize(content, wordDefinition) {\n        const result = [];\n        let match;\n        wordDefinition.lastIndex = 0; // reset lastIndex just to be sure\n        while (match = wordDefinition.exec(content)) {\n            if (match[0].length === 0) {\n                // it did match the empty string\n                break;\n            }\n            result.push({ start: match.index, end: match.index + match[0].length });\n        }\n        return result;\n    }\n    getValueInRange(range) {\n        range = this._validateRange(range);\n        if (range.startLineNumber === range.endLineNumber) {\n            return this._lines[range.startLineNumber - 1].substring(range.startColumn - 1, range.endColumn - 1);\n        }\n        const lineEnding = this._eol;\n        const startLineIndex = range.startLineNumber - 1;\n        const endLineIndex = range.endLineNumber - 1;\n        const resultLines = [];\n        resultLines.push(this._lines[startLineIndex].substring(range.startColumn - 1));\n        for (let i = startLineIndex + 1; i < endLineIndex; i++) {\n            resultLines.push(this._lines[i]);\n        }\n        resultLines.push(this._lines[endLineIndex].substring(0, range.endColumn - 1));\n        return resultLines.join(lineEnding);\n    }\n    offsetAt(position) {\n        position = this._validatePosition(position);\n        this._ensureLineStarts();\n        return this._lineStarts.getPrefixSum(position.lineNumber - 2) + (position.column - 1);\n    }\n    positionAt(offset) {\n        offset = Math.floor(offset);\n        offset = Math.max(0, offset);\n        this._ensureLineStarts();\n        const out = this._lineStarts.getIndexOf(offset);\n        const lineLength = this._lines[out.index].length;\n        // Ensure we return a valid position\n        return {\n            lineNumber: 1 + out.index,\n            column: 1 + Math.min(out.remainder, lineLength)\n        };\n    }\n    _validateRange(range) {\n        const start = this._validatePosition({ lineNumber: range.startLineNumber, column: range.startColumn });\n        const end = this._validatePosition({ lineNumber: range.endLineNumber, column: range.endColumn });\n        if (start.lineNumber !== range.startLineNumber\n            || start.column !== range.startColumn\n            || end.lineNumber !== range.endLineNumber\n            || end.column !== range.endColumn) {\n            return {\n                startLineNumber: start.lineNumber,\n                startColumn: start.column,\n                endLineNumber: end.lineNumber,\n                endColumn: end.column\n            };\n        }\n        return range;\n    }\n    _validatePosition(position) {\n        if (!Position.isIPosition(position)) {\n            throw new Error('bad position');\n        }\n        let { lineNumber, column } = position;\n        let hasChanged = false;\n        if (lineNumber < 1) {\n            lineNumber = 1;\n            column = 1;\n            hasChanged = true;\n        }\n        else if (lineNumber > this._lines.length) {\n            lineNumber = this._lines.length;\n            column = this._lines[lineNumber - 1].length + 1;\n            hasChanged = true;\n        }\n        else {\n            const maxCharacter = this._lines[lineNumber - 1].length + 1;\n            if (column < 1) {\n                column = 1;\n                hasChanged = true;\n            }\n            else if (column > maxCharacter) {\n                column = maxCharacter;\n                hasChanged = true;\n            }\n        }\n        if (!hasChanged) {\n            return position;\n        }\n        else {\n            return { lineNumber, column };\n        }\n    }\n}\n\nexport { MirrorModel, STOP_SYNC_MODEL_DELTA_TIME_MS, WorkerTextModelSyncClient, WorkerTextModelSyncServer };\n","import { stringDiff } from '../../../base/common/diff/diff.js';\nimport { Range } from '../core/range.js';\nimport { computeLinks } from '../languages/linkComputer.js';\nimport { BasicInplaceReplace } from '../languages/supports/inplaceReplaceSupport.js';\nimport { createMonacoBaseAPI } from './editorBaseApi.js';\nimport { StopWatch } from '../../../base/common/stopwatch.js';\nimport { UnicodeTextModelHighlighter } from './unicodeTextModelHighlighter.js';\nimport { linesDiffComputers } from '../diff/linesDiffComputers.js';\nimport { computeDefaultDocumentColors } from '../languages/defaultDocumentColorsComputer.js';\nimport { findSectionHeaders } from './findSectionHeaders.js';\nimport { WorkerTextModelSyncServer } from './textModelSync/textModelSync.impl.js';\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 * @internal\n */\nclass EditorWorker {\n    constructor(_foreignModule = null) {\n        this._foreignModule = _foreignModule;\n        this._requestHandlerBrand = undefined;\n        this._workerTextModelSyncServer = new WorkerTextModelSyncServer();\n    }\n    dispose() {\n    }\n    async $ping() {\n        return 'pong';\n    }\n    _getModel(uri) {\n        return this._workerTextModelSyncServer.getModel(uri);\n    }\n    getModels() {\n        return this._workerTextModelSyncServer.getModels();\n    }\n    $acceptNewModel(data) {\n        this._workerTextModelSyncServer.$acceptNewModel(data);\n    }\n    $acceptModelChanged(uri, e) {\n        this._workerTextModelSyncServer.$acceptModelChanged(uri, e);\n    }\n    $acceptRemovedModel(uri) {\n        this._workerTextModelSyncServer.$acceptRemovedModel(uri);\n    }\n    async $computeUnicodeHighlights(url, options, range) {\n        const model = this._getModel(url);\n        if (!model) {\n            return { ranges: [], hasMore: false, ambiguousCharacterCount: 0, invisibleCharacterCount: 0, nonBasicAsciiCharacterCount: 0 };\n        }\n        return UnicodeTextModelHighlighter.computeUnicodeHighlights(model, options, range);\n    }\n    async $findSectionHeaders(url, options) {\n        const model = this._getModel(url);\n        if (!model) {\n            return [];\n        }\n        return findSectionHeaders(model, options);\n    }\n    // ---- BEGIN diff --------------------------------------------------------------------------\n    async $computeDiff(originalUrl, modifiedUrl, options, algorithm) {\n        const original = this._getModel(originalUrl);\n        const modified = this._getModel(modifiedUrl);\n        if (!original || !modified) {\n            return null;\n        }\n        const result = EditorWorker.computeDiff(original, modified, options, algorithm);\n        return result;\n    }\n    static computeDiff(originalTextModel, modifiedTextModel, options, algorithm) {\n        const diffAlgorithm = algorithm === 'advanced' ? linesDiffComputers.getDefault() : linesDiffComputers.getLegacy();\n        const originalLines = originalTextModel.getLinesContent();\n        const modifiedLines = modifiedTextModel.getLinesContent();\n        const result = diffAlgorithm.computeDiff(originalLines, modifiedLines, options);\n        const identical = (result.changes.length > 0 ? false : this._modelsAreIdentical(originalTextModel, modifiedTextModel));\n        function getLineChanges(changes) {\n            return changes.map(m => ([m.original.startLineNumber, m.original.endLineNumberExclusive, m.modified.startLineNumber, m.modified.endLineNumberExclusive, m.innerChanges?.map(m => [\n                    m.originalRange.startLineNumber,\n                    m.originalRange.startColumn,\n                    m.originalRange.endLineNumber,\n                    m.originalRange.endColumn,\n                    m.modifiedRange.startLineNumber,\n                    m.modifiedRange.startColumn,\n                    m.modifiedRange.endLineNumber,\n                    m.modifiedRange.endColumn,\n                ])]));\n        }\n        return {\n            identical,\n            quitEarly: result.hitTimeout,\n            changes: getLineChanges(result.changes),\n            moves: result.moves.map(m => ([\n                m.lineRangeMapping.original.startLineNumber,\n                m.lineRangeMapping.original.endLineNumberExclusive,\n                m.lineRangeMapping.modified.startLineNumber,\n                m.lineRangeMapping.modified.endLineNumberExclusive,\n                getLineChanges(m.changes)\n            ])),\n        };\n    }\n    static _modelsAreIdentical(original, modified) {\n        const originalLineCount = original.getLineCount();\n        const modifiedLineCount = modified.getLineCount();\n        if (originalLineCount !== modifiedLineCount) {\n            return false;\n        }\n        for (let line = 1; line <= originalLineCount; line++) {\n            const originalLine = original.getLineContent(line);\n            const modifiedLine = modified.getLineContent(line);\n            if (originalLine !== modifiedLine) {\n                return false;\n            }\n        }\n        return true;\n    }\n    // ---- END diff --------------------------------------------------------------------------\n    // ---- BEGIN minimal edits ---------------------------------------------------------------\n    static { this._diffLimit = 100000; }\n    async $computeMoreMinimalEdits(modelUrl, edits, pretty) {\n        const model = this._getModel(modelUrl);\n        if (!model) {\n            return edits;\n        }\n        const result = [];\n        let lastEol = undefined;\n        edits = edits.slice(0).sort((a, b) => {\n            if (a.range && b.range) {\n                return Range.compareRangesUsingStarts(a.range, b.range);\n            }\n            // eol only changes should go to the end\n            const aRng = a.range ? 0 : 1;\n            const bRng = b.range ? 0 : 1;\n            return aRng - bRng;\n        });\n        // merge adjacent edits\n        let writeIndex = 0;\n        for (let readIndex = 1; readIndex < edits.length; readIndex++) {\n            if (Range.getEndPosition(edits[writeIndex].range).equals(Range.getStartPosition(edits[readIndex].range))) {\n                edits[writeIndex].range = Range.fromPositions(Range.getStartPosition(edits[writeIndex].range), Range.getEndPosition(edits[readIndex].range));\n                edits[writeIndex].text += edits[readIndex].text;\n            }\n            else {\n                writeIndex++;\n                edits[writeIndex] = edits[readIndex];\n            }\n        }\n        edits.length = writeIndex + 1;\n        for (let { range, text, eol } of edits) {\n            if (typeof eol === 'number') {\n                lastEol = eol;\n            }\n            if (Range.isEmpty(range) && !text) {\n                // empty change\n                continue;\n            }\n            const original = model.getValueInRange(range);\n            text = text.replace(/\\r\\n|\\n|\\r/g, model.eol);\n            if (original === text) {\n                // noop\n                continue;\n            }\n            // make sure diff won't take too long\n            if (Math.max(text.length, original.length) > EditorWorker._diffLimit) {\n                result.push({ range, text });\n                continue;\n            }\n            // compute diff between original and edit.text\n            const changes = stringDiff(original, text, pretty);\n            const editOffset = model.offsetAt(Range.lift(range).getStartPosition());\n            for (const change of changes) {\n                const start = model.positionAt(editOffset + change.originalStart);\n                const end = model.positionAt(editOffset + change.originalStart + change.originalLength);\n                const newEdit = {\n                    text: text.substr(change.modifiedStart, change.modifiedLength),\n                    range: { startLineNumber: start.lineNumber, startColumn: start.column, endLineNumber: end.lineNumber, endColumn: end.column }\n                };\n                if (model.getValueInRange(newEdit.range) !== newEdit.text) {\n                    result.push(newEdit);\n                }\n            }\n        }\n        if (typeof lastEol === 'number') {\n            result.push({ eol: lastEol, text: '', range: { startLineNumber: 0, startColumn: 0, endLineNumber: 0, endColumn: 0 } });\n        }\n        return result;\n    }\n    // ---- END minimal edits ---------------------------------------------------------------\n    async $computeLinks(modelUrl) {\n        const model = this._getModel(modelUrl);\n        if (!model) {\n            return null;\n        }\n        return computeLinks(model);\n    }\n    // --- BEGIN default document colors -----------------------------------------------------------\n    async $computeDefaultDocumentColors(modelUrl) {\n        const model = this._getModel(modelUrl);\n        if (!model) {\n            return null;\n        }\n        return computeDefaultDocumentColors(model);\n    }\n    // ---- BEGIN suggest --------------------------------------------------------------------------\n    static { this._suggestionsLimit = 10000; }\n    async $textualSuggest(modelUrls, leadingWord, wordDef, wordDefFlags) {\n        const sw = new StopWatch();\n        const wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n        const seen = new Set();\n        outer: for (const url of modelUrls) {\n            const model = this._getModel(url);\n            if (!model) {\n                continue;\n            }\n            for (const word of model.words(wordDefRegExp)) {\n                if (word === leadingWord || !isNaN(Number(word))) {\n                    continue;\n                }\n                seen.add(word);\n                if (seen.size > EditorWorker._suggestionsLimit) {\n                    break outer;\n                }\n            }\n        }\n        return { words: Array.from(seen), duration: sw.elapsed() };\n    }\n    // ---- END suggest --------------------------------------------------------------------------\n    //#region -- word ranges --\n    async $computeWordRanges(modelUrl, range, wordDef, wordDefFlags) {\n        const model = this._getModel(modelUrl);\n        if (!model) {\n            return Object.create(null);\n        }\n        const wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n        const result = Object.create(null);\n        for (let line = range.startLineNumber; line < range.endLineNumber; line++) {\n            const words = model.getLineWords(line, wordDefRegExp);\n            for (const word of words) {\n                if (!isNaN(Number(word.word))) {\n                    continue;\n                }\n                let array = result[word.word];\n                if (!array) {\n                    array = [];\n                    result[word.word] = array;\n                }\n                array.push({\n                    startLineNumber: line,\n                    startColumn: word.startColumn,\n                    endLineNumber: line,\n                    endColumn: word.endColumn\n                });\n            }\n        }\n        return result;\n    }\n    //#endregion\n    async $navigateValueSet(modelUrl, range, up, wordDef, wordDefFlags) {\n        const model = this._getModel(modelUrl);\n        if (!model) {\n            return null;\n        }\n        const wordDefRegExp = new RegExp(wordDef, wordDefFlags);\n        if (range.startColumn === range.endColumn) {\n            range = {\n                startLineNumber: range.startLineNumber,\n                startColumn: range.startColumn,\n                endLineNumber: range.endLineNumber,\n                endColumn: range.endColumn + 1\n            };\n        }\n        const selectionText = model.getValueInRange(range);\n        const wordRange = model.getWordAtPosition({ lineNumber: range.startLineNumber, column: range.startColumn }, wordDefRegExp);\n        if (!wordRange) {\n            return null;\n        }\n        const word = model.getValueInRange(wordRange);\n        const result = BasicInplaceReplace.INSTANCE.navigateValueSet(range, selectionText, wordRange, word, up);\n        return result;\n    }\n    // ---- BEGIN foreign module support --------------------------------------------------------------------------\n    // foreign method request\n    $fmr(method, args) {\n        if (!this._foreignModule || typeof this._foreignModule[method] !== 'function') {\n            return Promise.reject(new Error('Missing requestHandler or method: ' + method));\n        }\n        try {\n            return Promise.resolve(this._foreignModule[method].apply(this._foreignModule, args));\n        }\n        catch (e) {\n            return Promise.reject(e);\n        }\n    }\n}\nif (typeof importScripts === 'function') {\n    // Running in a web worker\n    globalThis.monaco = createMonacoBaseAPI();\n}\n\nexport { EditorWorker };\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 *--------------------------------------------------------------------------------------------*/\nclass EditorWorkerHost {\n    static { this.CHANNEL_NAME = 'editorWorkerHost'; }\n    static getChannel(workerServer) {\n        return workerServer.getChannel(EditorWorkerHost.CHANNEL_NAME);\n    }\n    static setChannel(workerClient, obj) {\n        workerClient.setChannel(EditorWorkerHost.CHANNEL_NAME, obj);\n    }\n}\n\nexport { EditorWorkerHost };\n","import { initialize } from '../base/common/worker/webWorkerBootstrap.js';\nimport { EditorWorker } from './common/services/editorWebWorker.js';\nimport { EditorWorkerHost } from './common/services/editorWorkerHost.js';\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 * Used by `monaco-editor` to hook up web worker rpc.\n * @skipMangle\n * @internal\n */\nfunction start(createClient) {\n    let client;\n    const webWorkerServer = initialize((workerServer) => {\n        const editorWorkerHost = EditorWorkerHost.getChannel(workerServer);\n        const host = new Proxy({}, {\n            get(target, prop, receiver) {\n                if (prop === 'then') {\n                    // Don't forward the call when the proxy is returned in an async function and the runtime tries to .then it.\n                    return undefined;\n                }\n                if (typeof prop !== 'string') {\n                    throw new Error(`Not supported`);\n                }\n                return (...args) => {\n                    return editorWorkerHost.$fhr(prop, args);\n                };\n            }\n        });\n        const ctx = {\n            host: host,\n            getMirrorModels: () => {\n                return webWorkerServer.requestHandler.getModels();\n            }\n        };\n        client = createClient(ctx);\n        return new EditorWorker(client);\n    });\n    return client;\n}\n\nexport { start };\n","import { start } from '../editor/editor.worker.start.js';\n\nlet initialized = false;\nfunction isWorkerInitialized() {\n  return initialized;\n}\nfunction initialize(callback) {\n  initialized = true;\n  self.onmessage = (m) => {\n    start((ctx) => {\n      return callback(ctx, m.data);\n    });\n  };\n}\n\nexport { initialize, isWorkerInitialized };\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 * Creates a JSON scanner on the given text.\n * If ignoreTrivia is set, whitespaces or comments are ignored.\n */\nfunction createScanner(text, ignoreTrivia = false) {\n    const len = text.length;\n    let pos = 0, value = '', tokenOffset = 0, token = 16 /* SyntaxKind.Unknown */, lineNumber = 0, lineStartOffset = 0, tokenLineStartOffset = 0, prevTokenLineStartOffset = 0, scanError = 0 /* ScanError.None */;\n    function scanHexDigits(count, exact) {\n        let digits = 0;\n        let value = 0;\n        while (digits < count || false) {\n            let ch = text.charCodeAt(pos);\n            if (ch >= 48 /* CharacterCodes._0 */ && ch <= 57 /* CharacterCodes._9 */) {\n                value = value * 16 + ch - 48 /* CharacterCodes._0 */;\n            }\n            else if (ch >= 65 /* CharacterCodes.A */ && ch <= 70 /* CharacterCodes.F */) {\n                value = value * 16 + ch - 65 /* CharacterCodes.A */ + 10;\n            }\n            else if (ch >= 97 /* CharacterCodes.a */ && ch <= 102 /* CharacterCodes.f */) {\n                value = value * 16 + ch - 97 /* CharacterCodes.a */ + 10;\n            }\n            else {\n                break;\n            }\n            pos++;\n            digits++;\n        }\n        if (digits < count) {\n            value = -1;\n        }\n        return value;\n    }\n    function setPosition(newPosition) {\n        pos = newPosition;\n        value = '';\n        tokenOffset = 0;\n        token = 16 /* SyntaxKind.Unknown */;\n        scanError = 0 /* ScanError.None */;\n    }\n    function scanNumber() {\n        let start = pos;\n        if (text.charCodeAt(pos) === 48 /* CharacterCodes._0 */) {\n            pos++;\n        }\n        else {\n            pos++;\n            while (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                pos++;\n            }\n        }\n        if (pos < text.length && text.charCodeAt(pos) === 46 /* CharacterCodes.dot */) {\n            pos++;\n            if (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                pos++;\n                while (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                    pos++;\n                }\n            }\n            else {\n                scanError = 3 /* ScanError.UnexpectedEndOfNumber */;\n                return text.substring(start, pos);\n            }\n        }\n        let end = pos;\n        if (pos < text.length && (text.charCodeAt(pos) === 69 /* CharacterCodes.E */ || text.charCodeAt(pos) === 101 /* CharacterCodes.e */)) {\n            pos++;\n            if (pos < text.length && text.charCodeAt(pos) === 43 /* CharacterCodes.plus */ || text.charCodeAt(pos) === 45 /* CharacterCodes.minus */) {\n                pos++;\n            }\n            if (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                pos++;\n                while (pos < text.length && isDigit(text.charCodeAt(pos))) {\n                    pos++;\n                }\n                end = pos;\n            }\n            else {\n                scanError = 3 /* ScanError.UnexpectedEndOfNumber */;\n            }\n        }\n        return text.substring(start, end);\n    }\n    function scanString() {\n        let result = '', start = pos;\n        while (true) {\n            if (pos >= len) {\n                result += text.substring(start, pos);\n                scanError = 2 /* ScanError.UnexpectedEndOfString */;\n                break;\n            }\n            const ch = text.charCodeAt(pos);\n            if (ch === 34 /* CharacterCodes.doubleQuote */) {\n                result += text.substring(start, pos);\n                pos++;\n                break;\n            }\n            if (ch === 92 /* CharacterCodes.backslash */) {\n                result += text.substring(start, pos);\n                pos++;\n                if (pos >= len) {\n                    scanError = 2 /* ScanError.UnexpectedEndOfString */;\n                    break;\n                }\n                const ch2 = text.charCodeAt(pos++);\n                switch (ch2) {\n                    case 34 /* CharacterCodes.doubleQuote */:\n                        result += '\\\"';\n                        break;\n                    case 92 /* CharacterCodes.backslash */:\n                        result += '\\\\';\n                        break;\n                    case 47 /* CharacterCodes.slash */:\n                        result += '/';\n                        break;\n                    case 98 /* CharacterCodes.b */:\n                        result += '\\b';\n                        break;\n                    case 102 /* CharacterCodes.f */:\n                        result += '\\f';\n                        break;\n                    case 110 /* CharacterCodes.n */:\n                        result += '\\n';\n                        break;\n                    case 114 /* CharacterCodes.r */:\n                        result += '\\r';\n                        break;\n                    case 116 /* CharacterCodes.t */:\n                        result += '\\t';\n                        break;\n                    case 117 /* CharacterCodes.u */:\n                        const ch3 = scanHexDigits(4);\n                        if (ch3 >= 0) {\n                            result += String.fromCharCode(ch3);\n                        }\n                        else {\n                            scanError = 4 /* ScanError.InvalidUnicode */;\n                        }\n                        break;\n                    default:\n                        scanError = 5 /* ScanError.InvalidEscapeCharacter */;\n                }\n                start = pos;\n                continue;\n            }\n            if (ch >= 0 && ch <= 0x1f) {\n                if (isLineBreak(ch)) {\n                    result += text.substring(start, pos);\n                    scanError = 2 /* ScanError.UnexpectedEndOfString */;\n                    break;\n                }\n                else {\n                    scanError = 6 /* ScanError.InvalidCharacter */;\n                    // mark as error but continue with string\n                }\n            }\n            pos++;\n        }\n        return result;\n    }\n    function scanNext() {\n        value = '';\n        scanError = 0 /* ScanError.None */;\n        tokenOffset = pos;\n        lineStartOffset = lineNumber;\n        prevTokenLineStartOffset = tokenLineStartOffset;\n        if (pos >= len) {\n            // at the end\n            tokenOffset = len;\n            return token = 17 /* SyntaxKind.EOF */;\n        }\n        let code = text.charCodeAt(pos);\n        // trivia: whitespace\n        if (isWhiteSpace(code)) {\n            do {\n                pos++;\n                value += String.fromCharCode(code);\n                code = text.charCodeAt(pos);\n            } while (isWhiteSpace(code));\n            return token = 15 /* SyntaxKind.Trivia */;\n        }\n        // trivia: newlines\n        if (isLineBreak(code)) {\n            pos++;\n            value += String.fromCharCode(code);\n            if (code === 13 /* CharacterCodes.carriageReturn */ && text.charCodeAt(pos) === 10 /* CharacterCodes.lineFeed */) {\n                pos++;\n                value += '\\n';\n            }\n            lineNumber++;\n            tokenLineStartOffset = pos;\n            return token = 14 /* SyntaxKind.LineBreakTrivia */;\n        }\n        switch (code) {\n            // tokens: []{}:,\n            case 123 /* CharacterCodes.openBrace */:\n                pos++;\n                return token = 1 /* SyntaxKind.OpenBraceToken */;\n            case 125 /* CharacterCodes.closeBrace */:\n                pos++;\n                return token = 2 /* SyntaxKind.CloseBraceToken */;\n            case 91 /* CharacterCodes.openBracket */:\n                pos++;\n                return token = 3 /* SyntaxKind.OpenBracketToken */;\n            case 93 /* CharacterCodes.closeBracket */:\n                pos++;\n                return token = 4 /* SyntaxKind.CloseBracketToken */;\n            case 58 /* CharacterCodes.colon */:\n                pos++;\n                return token = 6 /* SyntaxKind.ColonToken */;\n            case 44 /* CharacterCodes.comma */:\n                pos++;\n                return token = 5 /* SyntaxKind.CommaToken */;\n            // strings\n            case 34 /* CharacterCodes.doubleQuote */:\n                pos++;\n                value = scanString();\n                return token = 10 /* SyntaxKind.StringLiteral */;\n            // comments\n            case 47 /* CharacterCodes.slash */:\n                const start = pos - 1;\n                // Single-line comment\n                if (text.charCodeAt(pos + 1) === 47 /* CharacterCodes.slash */) {\n                    pos += 2;\n                    while (pos < len) {\n                        if (isLineBreak(text.charCodeAt(pos))) {\n                            break;\n                        }\n                        pos++;\n                    }\n                    value = text.substring(start, pos);\n                    return token = 12 /* SyntaxKind.LineCommentTrivia */;\n                }\n                // Multi-line comment\n                if (text.charCodeAt(pos + 1) === 42 /* CharacterCodes.asterisk */) {\n                    pos += 2;\n                    const safeLength = len - 1; // For lookahead.\n                    let commentClosed = false;\n                    while (pos < safeLength) {\n                        const ch = text.charCodeAt(pos);\n                        if (ch === 42 /* CharacterCodes.asterisk */ && text.charCodeAt(pos + 1) === 47 /* CharacterCodes.slash */) {\n                            pos += 2;\n                            commentClosed = true;\n                            break;\n                        }\n                        pos++;\n                        if (isLineBreak(ch)) {\n                            if (ch === 13 /* CharacterCodes.carriageReturn */ && text.charCodeAt(pos) === 10 /* CharacterCodes.lineFeed */) {\n                                pos++;\n                            }\n                            lineNumber++;\n                            tokenLineStartOffset = pos;\n                        }\n                    }\n                    if (!commentClosed) {\n                        pos++;\n                        scanError = 1 /* ScanError.UnexpectedEndOfComment */;\n                    }\n                    value = text.substring(start, pos);\n                    return token = 13 /* SyntaxKind.BlockCommentTrivia */;\n                }\n                // just a single slash\n                value += String.fromCharCode(code);\n                pos++;\n                return token = 16 /* SyntaxKind.Unknown */;\n            // numbers\n            case 45 /* CharacterCodes.minus */:\n                value += String.fromCharCode(code);\n                pos++;\n                if (pos === len || !isDigit(text.charCodeAt(pos))) {\n                    return token = 16 /* SyntaxKind.Unknown */;\n                }\n            // found a minus, followed by a number so\n            // we fall through to proceed with scanning\n            // numbers\n            case 48 /* CharacterCodes._0 */:\n            case 49 /* CharacterCodes._1 */:\n            case 50 /* CharacterCodes._2 */:\n            case 51 /* CharacterCodes._3 */:\n            case 52 /* CharacterCodes._4 */:\n            case 53 /* CharacterCodes._5 */:\n            case 54 /* CharacterCodes._6 */:\n            case 55 /* CharacterCodes._7 */:\n            case 56 /* CharacterCodes._8 */:\n            case 57 /* CharacterCodes._9 */:\n                value += scanNumber();\n                return token = 11 /* SyntaxKind.NumericLiteral */;\n            // literals and unknown symbols\n            default:\n                // is a literal? Read the full word.\n                while (pos < len && isUnknownContentCharacter(code)) {\n                    pos++;\n                    code = text.charCodeAt(pos);\n                }\n                if (tokenOffset !== pos) {\n                    value = text.substring(tokenOffset, pos);\n                    // keywords: true, false, null\n                    switch (value) {\n                        case 'true': return token = 8 /* SyntaxKind.TrueKeyword */;\n                        case 'false': return token = 9 /* SyntaxKind.FalseKeyword */;\n                        case 'null': return token = 7 /* SyntaxKind.NullKeyword */;\n                    }\n                    return token = 16 /* SyntaxKind.Unknown */;\n                }\n                // some\n                value += String.fromCharCode(code);\n                pos++;\n                return token = 16 /* SyntaxKind.Unknown */;\n        }\n    }\n    function isUnknownContentCharacter(code) {\n        if (isWhiteSpace(code) || isLineBreak(code)) {\n            return false;\n        }\n        switch (code) {\n            case 125 /* CharacterCodes.closeBrace */:\n            case 93 /* CharacterCodes.closeBracket */:\n            case 123 /* CharacterCodes.openBrace */:\n            case 91 /* CharacterCodes.openBracket */:\n            case 34 /* CharacterCodes.doubleQuote */:\n            case 58 /* CharacterCodes.colon */:\n            case 44 /* CharacterCodes.comma */:\n            case 47 /* CharacterCodes.slash */:\n                return false;\n        }\n        return true;\n    }\n    function scanNextNonTrivia() {\n        let result;\n        do {\n            result = scanNext();\n        } while (result >= 12 /* SyntaxKind.LineCommentTrivia */ && result <= 15 /* SyntaxKind.Trivia */);\n        return result;\n    }\n    return {\n        setPosition: setPosition,\n        getPosition: () => pos,\n        scan: ignoreTrivia ? scanNextNonTrivia : scanNext,\n        getToken: () => token,\n        getTokenValue: () => value,\n        getTokenOffset: () => tokenOffset,\n        getTokenLength: () => pos - tokenOffset,\n        getTokenStartLine: () => lineStartOffset,\n        getTokenStartCharacter: () => tokenOffset - prevTokenLineStartOffset,\n        getTokenError: () => scanError,\n    };\n}\nfunction isWhiteSpace(ch) {\n    return ch === 32 /* CharacterCodes.space */ || ch === 9 /* CharacterCodes.tab */;\n}\nfunction isLineBreak(ch) {\n    return ch === 10 /* CharacterCodes.lineFeed */ || ch === 13 /* CharacterCodes.carriageReturn */;\n}\nfunction isDigit(ch) {\n    return ch >= 48 /* CharacterCodes._0 */ && ch <= 57 /* CharacterCodes._9 */;\n}\nvar CharacterCodes;\n(function (CharacterCodes) {\n    CharacterCodes[CharacterCodes[\"lineFeed\"] = 10] = \"lineFeed\";\n    CharacterCodes[CharacterCodes[\"carriageReturn\"] = 13] = \"carriageReturn\";\n    CharacterCodes[CharacterCodes[\"space\"] = 32] = \"space\";\n    CharacterCodes[CharacterCodes[\"_0\"] = 48] = \"_0\";\n    CharacterCodes[CharacterCodes[\"_1\"] = 49] = \"_1\";\n    CharacterCodes[CharacterCodes[\"_2\"] = 50] = \"_2\";\n    CharacterCodes[CharacterCodes[\"_3\"] = 51] = \"_3\";\n    CharacterCodes[CharacterCodes[\"_4\"] = 52] = \"_4\";\n    CharacterCodes[CharacterCodes[\"_5\"] = 53] = \"_5\";\n    CharacterCodes[CharacterCodes[\"_6\"] = 54] = \"_6\";\n    CharacterCodes[CharacterCodes[\"_7\"] = 55] = \"_7\";\n    CharacterCodes[CharacterCodes[\"_8\"] = 56] = \"_8\";\n    CharacterCodes[CharacterCodes[\"_9\"] = 57] = \"_9\";\n    CharacterCodes[CharacterCodes[\"a\"] = 97] = \"a\";\n    CharacterCodes[CharacterCodes[\"b\"] = 98] = \"b\";\n    CharacterCodes[CharacterCodes[\"c\"] = 99] = \"c\";\n    CharacterCodes[CharacterCodes[\"d\"] = 100] = \"d\";\n    CharacterCodes[CharacterCodes[\"e\"] = 101] = \"e\";\n    CharacterCodes[CharacterCodes[\"f\"] = 102] = \"f\";\n    CharacterCodes[CharacterCodes[\"g\"] = 103] = \"g\";\n    CharacterCodes[CharacterCodes[\"h\"] = 104] = \"h\";\n    CharacterCodes[CharacterCodes[\"i\"] = 105] = \"i\";\n    CharacterCodes[CharacterCodes[\"j\"] = 106] = \"j\";\n    CharacterCodes[CharacterCodes[\"k\"] = 107] = \"k\";\n    CharacterCodes[CharacterCodes[\"l\"] = 108] = \"l\";\n    CharacterCodes[CharacterCodes[\"m\"] = 109] = \"m\";\n    CharacterCodes[CharacterCodes[\"n\"] = 110] = \"n\";\n    CharacterCodes[CharacterCodes[\"o\"] = 111] = \"o\";\n    CharacterCodes[CharacterCodes[\"p\"] = 112] = \"p\";\n    CharacterCodes[CharacterCodes[\"q\"] = 113] = \"q\";\n    CharacterCodes[CharacterCodes[\"r\"] = 114] = \"r\";\n    CharacterCodes[CharacterCodes[\"s\"] = 115] = \"s\";\n    CharacterCodes[CharacterCodes[\"t\"] = 116] = \"t\";\n    CharacterCodes[CharacterCodes[\"u\"] = 117] = \"u\";\n    CharacterCodes[CharacterCodes[\"v\"] = 118] = \"v\";\n    CharacterCodes[CharacterCodes[\"w\"] = 119] = \"w\";\n    CharacterCodes[CharacterCodes[\"x\"] = 120] = \"x\";\n    CharacterCodes[CharacterCodes[\"y\"] = 121] = \"y\";\n    CharacterCodes[CharacterCodes[\"z\"] = 122] = \"z\";\n    CharacterCodes[CharacterCodes[\"A\"] = 65] = \"A\";\n    CharacterCodes[CharacterCodes[\"B\"] = 66] = \"B\";\n    CharacterCodes[CharacterCodes[\"C\"] = 67] = \"C\";\n    CharacterCodes[CharacterCodes[\"D\"] = 68] = \"D\";\n    CharacterCodes[CharacterCodes[\"E\"] = 69] = \"E\";\n    CharacterCodes[CharacterCodes[\"F\"] = 70] = \"F\";\n    CharacterCodes[CharacterCodes[\"G\"] = 71] = \"G\";\n    CharacterCodes[CharacterCodes[\"H\"] = 72] = \"H\";\n    CharacterCodes[CharacterCodes[\"I\"] = 73] = \"I\";\n    CharacterCodes[CharacterCodes[\"J\"] = 74] = \"J\";\n    CharacterCodes[CharacterCodes[\"K\"] = 75] = \"K\";\n    CharacterCodes[CharacterCodes[\"L\"] = 76] = \"L\";\n    CharacterCodes[CharacterCodes[\"M\"] = 77] = \"M\";\n    CharacterCodes[CharacterCodes[\"N\"] = 78] = \"N\";\n    CharacterCodes[CharacterCodes[\"O\"] = 79] = \"O\";\n    CharacterCodes[CharacterCodes[\"P\"] = 80] = \"P\";\n    CharacterCodes[CharacterCodes[\"Q\"] = 81] = \"Q\";\n    CharacterCodes[CharacterCodes[\"R\"] = 82] = \"R\";\n    CharacterCodes[CharacterCodes[\"S\"] = 83] = \"S\";\n    CharacterCodes[CharacterCodes[\"T\"] = 84] = \"T\";\n    CharacterCodes[CharacterCodes[\"U\"] = 85] = \"U\";\n    CharacterCodes[CharacterCodes[\"V\"] = 86] = \"V\";\n    CharacterCodes[CharacterCodes[\"W\"] = 87] = \"W\";\n    CharacterCodes[CharacterCodes[\"X\"] = 88] = \"X\";\n    CharacterCodes[CharacterCodes[\"Y\"] = 89] = \"Y\";\n    CharacterCodes[CharacterCodes[\"Z\"] = 90] = \"Z\";\n    CharacterCodes[CharacterCodes[\"asterisk\"] = 42] = \"asterisk\";\n    CharacterCodes[CharacterCodes[\"backslash\"] = 92] = \"backslash\";\n    CharacterCodes[CharacterCodes[\"closeBrace\"] = 125] = \"closeBrace\";\n    CharacterCodes[CharacterCodes[\"closeBracket\"] = 93] = \"closeBracket\";\n    CharacterCodes[CharacterCodes[\"colon\"] = 58] = \"colon\";\n    CharacterCodes[CharacterCodes[\"comma\"] = 44] = \"comma\";\n    CharacterCodes[CharacterCodes[\"dot\"] = 46] = \"dot\";\n    CharacterCodes[CharacterCodes[\"doubleQuote\"] = 34] = \"doubleQuote\";\n    CharacterCodes[CharacterCodes[\"minus\"] = 45] = \"minus\";\n    CharacterCodes[CharacterCodes[\"openBrace\"] = 123] = \"openBrace\";\n    CharacterCodes[CharacterCodes[\"openBracket\"] = 91] = \"openBracket\";\n    CharacterCodes[CharacterCodes[\"plus\"] = 43] = \"plus\";\n    CharacterCodes[CharacterCodes[\"slash\"] = 47] = \"slash\";\n    CharacterCodes[CharacterCodes[\"formFeed\"] = 12] = \"formFeed\";\n    CharacterCodes[CharacterCodes[\"tab\"] = 9] = \"tab\";\n})(CharacterCodes || (CharacterCodes = {}));\n\nexport { createScanner };\n","const cachedSpaces = new Array(20).fill(0).map((_, index) => {\n    return ' '.repeat(index);\n});\nconst maxCachedValues = 200;\nconst cachedBreakLinesWithSpaces = {\n    ' ': {\n        '\\n': new Array(maxCachedValues).fill(0).map((_, index) => {\n            return '\\n' + ' '.repeat(index);\n        }),\n        '\\r': new Array(maxCachedValues).fill(0).map((_, index) => {\n            return '\\r' + ' '.repeat(index);\n        }),\n        '\\r\\n': new Array(maxCachedValues).fill(0).map((_, index) => {\n            return '\\r\\n' + ' '.repeat(index);\n        }),\n    },\n    '\\t': {\n        '\\n': new Array(maxCachedValues).fill(0).map((_, index) => {\n            return '\\n' + '\\t'.repeat(index);\n        }),\n        '\\r': new Array(maxCachedValues).fill(0).map((_, index) => {\n            return '\\r' + '\\t'.repeat(index);\n        }),\n        '\\r\\n': new Array(maxCachedValues).fill(0).map((_, index) => {\n            return '\\r\\n' + '\\t'.repeat(index);\n        }),\n    }\n};\nconst supportedEols = ['\\n', '\\r', '\\r\\n'];\n\nexport { cachedBreakLinesWithSpaces, cachedSpaces, supportedEols };\n","import { createScanner } from './scanner.js';\nimport { cachedSpaces, cachedBreakLinesWithSpaces, supportedEols } from './string-intern.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction format(documentText, range, options) {\n    let initialIndentLevel;\n    let formatText;\n    let formatTextStart;\n    let rangeStart;\n    let rangeEnd;\n    if (range) {\n        rangeStart = range.offset;\n        rangeEnd = rangeStart + range.length;\n        formatTextStart = rangeStart;\n        while (formatTextStart > 0 && !isEOL(documentText, formatTextStart - 1)) {\n            formatTextStart--;\n        }\n        let endOffset = rangeEnd;\n        while (endOffset < documentText.length && !isEOL(documentText, endOffset)) {\n            endOffset++;\n        }\n        formatText = documentText.substring(formatTextStart, endOffset);\n        initialIndentLevel = computeIndentLevel(formatText, options);\n    }\n    else {\n        formatText = documentText;\n        initialIndentLevel = 0;\n        formatTextStart = 0;\n        rangeStart = 0;\n        rangeEnd = documentText.length;\n    }\n    const eol = getEOL(options, documentText);\n    const eolFastPathSupported = supportedEols.includes(eol);\n    let numberLineBreaks = 0;\n    let indentLevel = 0;\n    let indentValue;\n    if (options.insertSpaces) {\n        indentValue = cachedSpaces[options.tabSize || 4] ?? repeat(cachedSpaces[1], options.tabSize || 4);\n    }\n    else {\n        indentValue = '\\t';\n    }\n    const indentType = indentValue === '\\t' ? '\\t' : ' ';\n    let scanner = createScanner(formatText, false);\n    let hasError = false;\n    function newLinesAndIndent() {\n        if (numberLineBreaks > 1) {\n            return repeat(eol, numberLineBreaks) + repeat(indentValue, initialIndentLevel + indentLevel);\n        }\n        const amountOfSpaces = indentValue.length * (initialIndentLevel + indentLevel);\n        if (!eolFastPathSupported || amountOfSpaces > cachedBreakLinesWithSpaces[indentType][eol].length) {\n            return eol + repeat(indentValue, initialIndentLevel + indentLevel);\n        }\n        if (amountOfSpaces <= 0) {\n            return eol;\n        }\n        return cachedBreakLinesWithSpaces[indentType][eol][amountOfSpaces];\n    }\n    function scanNext() {\n        let token = scanner.scan();\n        numberLineBreaks = 0;\n        while (token === 15 /* SyntaxKind.Trivia */ || token === 14 /* SyntaxKind.LineBreakTrivia */) {\n            if (token === 14 /* SyntaxKind.LineBreakTrivia */ && options.keepLines) {\n                numberLineBreaks += 1;\n            }\n            else if (token === 14 /* SyntaxKind.LineBreakTrivia */) {\n                numberLineBreaks = 1;\n            }\n            token = scanner.scan();\n        }\n        hasError = token === 16 /* SyntaxKind.Unknown */ || scanner.getTokenError() !== 0 /* ScanError.None */;\n        return token;\n    }\n    const editOperations = [];\n    function addEdit(text, startOffset, endOffset) {\n        if (!hasError && (!range || (startOffset < rangeEnd && endOffset > rangeStart)) && documentText.substring(startOffset, endOffset) !== text) {\n            editOperations.push({ offset: startOffset, length: endOffset - startOffset, content: text });\n        }\n    }\n    let firstToken = scanNext();\n    if (options.keepLines && numberLineBreaks > 0) {\n        addEdit(repeat(eol, numberLineBreaks), 0, 0);\n    }\n    if (firstToken !== 17 /* SyntaxKind.EOF */) {\n        let firstTokenStart = scanner.getTokenOffset() + formatTextStart;\n        let initialIndent = (indentValue.length * initialIndentLevel < 20) && options.insertSpaces\n            ? cachedSpaces[indentValue.length * initialIndentLevel]\n            : repeat(indentValue, initialIndentLevel);\n        addEdit(initialIndent, formatTextStart, firstTokenStart);\n    }\n    while (firstToken !== 17 /* SyntaxKind.EOF */) {\n        let firstTokenEnd = scanner.getTokenOffset() + scanner.getTokenLength() + formatTextStart;\n        let secondToken = scanNext();\n        let replaceContent = '';\n        let needsLineBreak = false;\n        while (numberLineBreaks === 0 && (secondToken === 12 /* SyntaxKind.LineCommentTrivia */ || secondToken === 13 /* SyntaxKind.BlockCommentTrivia */)) {\n            let commentTokenStart = scanner.getTokenOffset() + formatTextStart;\n            addEdit(cachedSpaces[1], firstTokenEnd, commentTokenStart);\n            firstTokenEnd = scanner.getTokenOffset() + scanner.getTokenLength() + formatTextStart;\n            needsLineBreak = secondToken === 12 /* SyntaxKind.LineCommentTrivia */;\n            replaceContent = needsLineBreak ? newLinesAndIndent() : '';\n            secondToken = scanNext();\n        }\n        if (secondToken === 2 /* SyntaxKind.CloseBraceToken */) {\n            if (firstToken !== 1 /* SyntaxKind.OpenBraceToken */) {\n                indentLevel--;\n            }\n            if (options.keepLines && numberLineBreaks > 0 || !options.keepLines && firstToken !== 1 /* SyntaxKind.OpenBraceToken */) {\n                replaceContent = newLinesAndIndent();\n            }\n            else if (options.keepLines) {\n                replaceContent = cachedSpaces[1];\n            }\n        }\n        else if (secondToken === 4 /* SyntaxKind.CloseBracketToken */) {\n            if (firstToken !== 3 /* SyntaxKind.OpenBracketToken */) {\n                indentLevel--;\n            }\n            if (options.keepLines && numberLineBreaks > 0 || !options.keepLines && firstToken !== 3 /* SyntaxKind.OpenBracketToken */) {\n                replaceContent = newLinesAndIndent();\n            }\n            else if (options.keepLines) {\n                replaceContent = cachedSpaces[1];\n            }\n        }\n        else {\n            switch (firstToken) {\n                case 3 /* SyntaxKind.OpenBracketToken */:\n                case 1 /* SyntaxKind.OpenBraceToken */:\n                    indentLevel++;\n                    if (options.keepLines && numberLineBreaks > 0 || !options.keepLines) {\n                        replaceContent = newLinesAndIndent();\n                    }\n                    else {\n                        replaceContent = cachedSpaces[1];\n                    }\n                    break;\n                case 5 /* SyntaxKind.CommaToken */:\n                    if (options.keepLines && numberLineBreaks > 0 || !options.keepLines) {\n                        replaceContent = newLinesAndIndent();\n                    }\n                    else {\n                        replaceContent = cachedSpaces[1];\n                    }\n                    break;\n                case 12 /* SyntaxKind.LineCommentTrivia */:\n                    replaceContent = newLinesAndIndent();\n                    break;\n                case 13 /* SyntaxKind.BlockCommentTrivia */:\n                    if (numberLineBreaks > 0) {\n                        replaceContent = newLinesAndIndent();\n                    }\n                    else if (!needsLineBreak) {\n                        replaceContent = cachedSpaces[1];\n                    }\n                    break;\n                case 6 /* SyntaxKind.ColonToken */:\n                    if (options.keepLines && numberLineBreaks > 0) {\n                        replaceContent = newLinesAndIndent();\n                    }\n                    else if (!needsLineBreak) {\n                        replaceContent = cachedSpaces[1];\n                    }\n                    break;\n                case 10 /* SyntaxKind.StringLiteral */:\n                    if (options.keepLines && numberLineBreaks > 0) {\n                        replaceContent = newLinesAndIndent();\n                    }\n                    else if (secondToken === 6 /* SyntaxKind.ColonToken */ && !needsLineBreak) {\n                        replaceContent = '';\n                    }\n                    break;\n                case 7 /* SyntaxKind.NullKeyword */:\n                case 8 /* SyntaxKind.TrueKeyword */:\n                case 9 /* SyntaxKind.FalseKeyword */:\n                case 11 /* SyntaxKind.NumericLiteral */:\n                case 2 /* SyntaxKind.CloseBraceToken */:\n                case 4 /* SyntaxKind.CloseBracketToken */:\n                    if (options.keepLines && numberLineBreaks > 0) {\n                        replaceContent = newLinesAndIndent();\n                    }\n                    else {\n                        if ((secondToken === 12 /* SyntaxKind.LineCommentTrivia */ || secondToken === 13 /* SyntaxKind.BlockCommentTrivia */) && !needsLineBreak) {\n                            replaceContent = cachedSpaces[1];\n                        }\n                        else if (secondToken !== 5 /* SyntaxKind.CommaToken */ && secondToken !== 17 /* SyntaxKind.EOF */) {\n                            hasError = true;\n                        }\n                    }\n                    break;\n                case 16 /* SyntaxKind.Unknown */:\n                    hasError = true;\n                    break;\n            }\n            if (numberLineBreaks > 0 && (secondToken === 12 /* SyntaxKind.LineCommentTrivia */ || secondToken === 13 /* SyntaxKind.BlockCommentTrivia */)) {\n                replaceContent = newLinesAndIndent();\n            }\n        }\n        if (secondToken === 17 /* SyntaxKind.EOF */) {\n            if (options.keepLines && numberLineBreaks > 0) {\n                replaceContent = newLinesAndIndent();\n            }\n            else {\n                replaceContent = options.insertFinalNewline ? eol : '';\n            }\n        }\n        const secondTokenStart = scanner.getTokenOffset() + formatTextStart;\n        addEdit(replaceContent, firstTokenEnd, secondTokenStart);\n        firstToken = secondToken;\n    }\n    return editOperations;\n}\nfunction repeat(s, count) {\n    let result = '';\n    for (let i = 0; i < count; i++) {\n        result += s;\n    }\n    return result;\n}\nfunction computeIndentLevel(content, options) {\n    let i = 0;\n    let nChars = 0;\n    const tabSize = options.tabSize || 4;\n    while (i < content.length) {\n        let ch = content.charAt(i);\n        if (ch === cachedSpaces[1]) {\n            nChars++;\n        }\n        else if (ch === '\\t') {\n            nChars += tabSize;\n        }\n        else {\n            break;\n        }\n        i++;\n    }\n    return Math.floor(nChars / tabSize);\n}\nfunction getEOL(options, text) {\n    for (let i = 0; i < text.length; i++) {\n        const ch = text.charAt(i);\n        if (ch === '\\r') {\n            if (i + 1 < text.length && text.charAt(i + 1) === '\\n') {\n                return '\\r\\n';\n            }\n            return '\\r';\n        }\n        else if (ch === '\\n') {\n            return '\\n';\n        }\n    }\n    return (options && options.eol) || '\\n';\n}\nfunction isEOL(text, offset) {\n    return '\\r\\n'.indexOf(text.charAt(offset)) !== -1;\n}\n\nexport { format, isEOL };\n","import { createScanner } from './scanner.js';\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 *--------------------------------------------------------------------------------------------*/\nvar ParseOptions;\n(function (ParseOptions) {\n    ParseOptions.DEFAULT = {\n        allowTrailingComma: false\n    };\n})(ParseOptions || (ParseOptions = {}));\n/**\n * Parses the given text and returns the object the JSON content represents. On invalid input, the parser tries to be as fault tolerant as possible, but still return a result.\n * Therefore always check the errors list to find out if the input was valid.\n */\nfunction parse(text, errors = [], options = ParseOptions.DEFAULT) {\n    let currentProperty = null;\n    let currentParent = [];\n    const previousParents = [];\n    function onValue(value) {\n        if (Array.isArray(currentParent)) {\n            currentParent.push(value);\n        }\n        else if (currentProperty !== null) {\n            currentParent[currentProperty] = value;\n        }\n    }\n    const visitor = {\n        onObjectBegin: () => {\n            const object = {};\n            onValue(object);\n            previousParents.push(currentParent);\n            currentParent = object;\n            currentProperty = null;\n        },\n        onObjectProperty: (name) => {\n            currentProperty = name;\n        },\n        onObjectEnd: () => {\n            currentParent = previousParents.pop();\n        },\n        onArrayBegin: () => {\n            const array = [];\n            onValue(array);\n            previousParents.push(currentParent);\n            currentParent = array;\n            currentProperty = null;\n        },\n        onArrayEnd: () => {\n            currentParent = previousParents.pop();\n        },\n        onLiteralValue: onValue,\n        onError: (error, offset, length) => {\n            errors.push({ error, offset, length });\n        }\n    };\n    visit(text, visitor, options);\n    return currentParent[0];\n}\n/**\n * Gets the JSON path of the given JSON DOM node\n */\nfunction getNodePath(node) {\n    if (!node.parent || !node.parent.children) {\n        return [];\n    }\n    const path = getNodePath(node.parent);\n    if (node.parent.type === 'property') {\n        const key = node.parent.children[0].value;\n        path.push(key);\n    }\n    else if (node.parent.type === 'array') {\n        const index = node.parent.children.indexOf(node);\n        if (index !== -1) {\n            path.push(index);\n        }\n    }\n    return path;\n}\n/**\n * Evaluates the JavaScript object of the given JSON DOM node\n */\nfunction getNodeValue(node) {\n    switch (node.type) {\n        case 'array':\n            return node.children.map(getNodeValue);\n        case 'object':\n            const obj = Object.create(null);\n            for (let prop of node.children) {\n                const valueNode = prop.children[1];\n                if (valueNode) {\n                    obj[prop.children[0].value] = getNodeValue(valueNode);\n                }\n            }\n            return obj;\n        case 'null':\n        case 'string':\n        case 'number':\n        case 'boolean':\n            return node.value;\n        default:\n            return undefined;\n    }\n}\nfunction contains(node, offset, includeRightBound = false) {\n    return (offset >= node.offset && offset < (node.offset + node.length)) || includeRightBound && (offset === (node.offset + node.length));\n}\n/**\n * Finds the most inner node at the given offset. If includeRightBound is set, also finds nodes that end at the given offset.\n */\nfunction findNodeAtOffset(node, offset, includeRightBound = false) {\n    if (contains(node, offset, includeRightBound)) {\n        const children = node.children;\n        if (Array.isArray(children)) {\n            for (let i = 0; i < children.length && children[i].offset <= offset; i++) {\n                const item = findNodeAtOffset(children[i], offset, includeRightBound);\n                if (item) {\n                    return item;\n                }\n            }\n        }\n        return node;\n    }\n    return undefined;\n}\n/**\n * Parses the given text and invokes the visitor functions for each object, array and literal reached.\n */\nfunction visit(text, visitor, options = ParseOptions.DEFAULT) {\n    const _scanner = createScanner(text, false);\n    // Important: Only pass copies of this to visitor functions to prevent accidental modification, and\n    // to not affect visitor functions which stored a reference to a previous JSONPath\n    const _jsonPath = [];\n    function toNoArgVisit(visitFunction) {\n        return visitFunction ? () => visitFunction(_scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter()) : () => true;\n    }\n    function toNoArgVisitWithPath(visitFunction) {\n        return visitFunction ? () => visitFunction(_scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter(), () => _jsonPath.slice()) : () => true;\n    }\n    function toOneArgVisit(visitFunction) {\n        return visitFunction ? (arg) => visitFunction(arg, _scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter()) : () => true;\n    }\n    function toOneArgVisitWithPath(visitFunction) {\n        return visitFunction ? (arg) => visitFunction(arg, _scanner.getTokenOffset(), _scanner.getTokenLength(), _scanner.getTokenStartLine(), _scanner.getTokenStartCharacter(), () => _jsonPath.slice()) : () => true;\n    }\n    const onObjectBegin = toNoArgVisitWithPath(visitor.onObjectBegin), onObjectProperty = toOneArgVisitWithPath(visitor.onObjectProperty), onObjectEnd = toNoArgVisit(visitor.onObjectEnd), onArrayBegin = toNoArgVisitWithPath(visitor.onArrayBegin), onArrayEnd = toNoArgVisit(visitor.onArrayEnd), onLiteralValue = toOneArgVisitWithPath(visitor.onLiteralValue), onSeparator = toOneArgVisit(visitor.onSeparator), onComment = toNoArgVisit(visitor.onComment), onError = toOneArgVisit(visitor.onError);\n    const disallowComments = options && options.disallowComments;\n    const allowTrailingComma = options && options.allowTrailingComma;\n    function scanNext() {\n        while (true) {\n            const token = _scanner.scan();\n            switch (_scanner.getTokenError()) {\n                case 4 /* ScanError.InvalidUnicode */:\n                    handleError(14 /* ParseErrorCode.InvalidUnicode */);\n                    break;\n                case 5 /* ScanError.InvalidEscapeCharacter */:\n                    handleError(15 /* ParseErrorCode.InvalidEscapeCharacter */);\n                    break;\n                case 3 /* ScanError.UnexpectedEndOfNumber */:\n                    handleError(13 /* ParseErrorCode.UnexpectedEndOfNumber */);\n                    break;\n                case 1 /* ScanError.UnexpectedEndOfComment */:\n                    if (!disallowComments) {\n                        handleError(11 /* ParseErrorCode.UnexpectedEndOfComment */);\n                    }\n                    break;\n                case 2 /* ScanError.UnexpectedEndOfString */:\n                    handleError(12 /* ParseErrorCode.UnexpectedEndOfString */);\n                    break;\n                case 6 /* ScanError.InvalidCharacter */:\n                    handleError(16 /* ParseErrorCode.InvalidCharacter */);\n                    break;\n            }\n            switch (token) {\n                case 12 /* SyntaxKind.LineCommentTrivia */:\n                case 13 /* SyntaxKind.BlockCommentTrivia */:\n                    if (disallowComments) {\n                        handleError(10 /* ParseErrorCode.InvalidCommentToken */);\n                    }\n                    else {\n                        onComment();\n                    }\n                    break;\n                case 16 /* SyntaxKind.Unknown */:\n                    handleError(1 /* ParseErrorCode.InvalidSymbol */);\n                    break;\n                case 15 /* SyntaxKind.Trivia */:\n                case 14 /* SyntaxKind.LineBreakTrivia */:\n                    break;\n                default:\n                    return token;\n            }\n        }\n    }\n    function handleError(error, skipUntilAfter = [], skipUntil = []) {\n        onError(error);\n        if (skipUntilAfter.length + skipUntil.length > 0) {\n            let token = _scanner.getToken();\n            while (token !== 17 /* SyntaxKind.EOF */) {\n                if (skipUntilAfter.indexOf(token) !== -1) {\n                    scanNext();\n                    break;\n                }\n                else if (skipUntil.indexOf(token) !== -1) {\n                    break;\n                }\n                token = scanNext();\n            }\n        }\n    }\n    function parseString(isValue) {\n        const value = _scanner.getTokenValue();\n        if (isValue) {\n            onLiteralValue(value);\n        }\n        else {\n            onObjectProperty(value);\n            // add property name afterwards\n            _jsonPath.push(value);\n        }\n        scanNext();\n        return true;\n    }\n    function parseLiteral() {\n        switch (_scanner.getToken()) {\n            case 11 /* SyntaxKind.NumericLiteral */:\n                const tokenValue = _scanner.getTokenValue();\n                let value = Number(tokenValue);\n                if (isNaN(value)) {\n                    handleError(2 /* ParseErrorCode.InvalidNumberFormat */);\n                    value = 0;\n                }\n                onLiteralValue(value);\n                break;\n            case 7 /* SyntaxKind.NullKeyword */:\n                onLiteralValue(null);\n                break;\n            case 8 /* SyntaxKind.TrueKeyword */:\n                onLiteralValue(true);\n                break;\n            case 9 /* SyntaxKind.FalseKeyword */:\n                onLiteralValue(false);\n                break;\n            default:\n                return false;\n        }\n        scanNext();\n        return true;\n    }\n    function parseProperty() {\n        if (_scanner.getToken() !== 10 /* SyntaxKind.StringLiteral */) {\n            handleError(3 /* ParseErrorCode.PropertyNameExpected */, [], [2 /* SyntaxKind.CloseBraceToken */, 5 /* SyntaxKind.CommaToken */]);\n            return false;\n        }\n        parseString(false);\n        if (_scanner.getToken() === 6 /* SyntaxKind.ColonToken */) {\n            onSeparator(':');\n            scanNext(); // consume colon\n            if (!parseValue()) {\n                handleError(4 /* ParseErrorCode.ValueExpected */, [], [2 /* SyntaxKind.CloseBraceToken */, 5 /* SyntaxKind.CommaToken */]);\n            }\n        }\n        else {\n            handleError(5 /* ParseErrorCode.ColonExpected */, [], [2 /* SyntaxKind.CloseBraceToken */, 5 /* SyntaxKind.CommaToken */]);\n        }\n        _jsonPath.pop(); // remove processed property name\n        return true;\n    }\n    function parseObject() {\n        onObjectBegin();\n        scanNext(); // consume open brace\n        let needsComma = false;\n        while (_scanner.getToken() !== 2 /* SyntaxKind.CloseBraceToken */ && _scanner.getToken() !== 17 /* SyntaxKind.EOF */) {\n            if (_scanner.getToken() === 5 /* SyntaxKind.CommaToken */) {\n                if (!needsComma) {\n                    handleError(4 /* ParseErrorCode.ValueExpected */, [], []);\n                }\n                onSeparator(',');\n                scanNext(); // consume comma\n                if (_scanner.getToken() === 2 /* SyntaxKind.CloseBraceToken */ && allowTrailingComma) {\n                    break;\n                }\n            }\n            else if (needsComma) {\n                handleError(6 /* ParseErrorCode.CommaExpected */, [], []);\n            }\n            if (!parseProperty()) {\n                handleError(4 /* ParseErrorCode.ValueExpected */, [], [2 /* SyntaxKind.CloseBraceToken */, 5 /* SyntaxKind.CommaToken */]);\n            }\n            needsComma = true;\n        }\n        onObjectEnd();\n        if (_scanner.getToken() !== 2 /* SyntaxKind.CloseBraceToken */) {\n            handleError(7 /* ParseErrorCode.CloseBraceExpected */, [2 /* SyntaxKind.CloseBraceToken */], []);\n        }\n        else {\n            scanNext(); // consume close brace\n        }\n        return true;\n    }\n    function parseArray() {\n        onArrayBegin();\n        scanNext(); // consume open bracket\n        let isFirstElement = true;\n        let needsComma = false;\n        while (_scanner.getToken() !== 4 /* SyntaxKind.CloseBracketToken */ && _scanner.getToken() !== 17 /* SyntaxKind.EOF */) {\n            if (_scanner.getToken() === 5 /* SyntaxKind.CommaToken */) {\n                if (!needsComma) {\n                    handleError(4 /* ParseErrorCode.ValueExpected */, [], []);\n                }\n                onSeparator(',');\n                scanNext(); // consume comma\n                if (_scanner.getToken() === 4 /* SyntaxKind.CloseBracketToken */ && allowTrailingComma) {\n                    break;\n                }\n            }\n            else if (needsComma) {\n                handleError(6 /* ParseErrorCode.CommaExpected */, [], []);\n            }\n            if (isFirstElement) {\n                _jsonPath.push(0);\n                isFirstElement = false;\n            }\n            else {\n                _jsonPath[_jsonPath.length - 1]++;\n            }\n            if (!parseValue()) {\n                handleError(4 /* ParseErrorCode.ValueExpected */, [], [4 /* SyntaxKind.CloseBracketToken */, 5 /* SyntaxKind.CommaToken */]);\n            }\n            needsComma = true;\n        }\n        onArrayEnd();\n        if (!isFirstElement) {\n            _jsonPath.pop(); // remove array index\n        }\n        if (_scanner.getToken() !== 4 /* SyntaxKind.CloseBracketToken */) {\n            handleError(8 /* ParseErrorCode.CloseBracketExpected */, [4 /* SyntaxKind.CloseBracketToken */], []);\n        }\n        else {\n            scanNext(); // consume close bracket\n        }\n        return true;\n    }\n    function parseValue() {\n        switch (_scanner.getToken()) {\n            case 3 /* SyntaxKind.OpenBracketToken */:\n                return parseArray();\n            case 1 /* SyntaxKind.OpenBraceToken */:\n                return parseObject();\n            case 10 /* SyntaxKind.StringLiteral */:\n                return parseString(true);\n            default:\n                return parseLiteral();\n        }\n    }\n    scanNext();\n    if (_scanner.getToken() === 17 /* SyntaxKind.EOF */) {\n        if (options.allowEmptyContent) {\n            return true;\n        }\n        handleError(4 /* ParseErrorCode.ValueExpected */, [], []);\n        return false;\n    }\n    if (!parseValue()) {\n        handleError(4 /* ParseErrorCode.ValueExpected */, [], []);\n        return false;\n    }\n    if (_scanner.getToken() !== 17 /* SyntaxKind.EOF */) {\n        handleError(9 /* ParseErrorCode.EndOfFileExpected */, [], []);\n    }\n    return true;\n}\n\nexport { contains, findNodeAtOffset, getNodePath, getNodeValue, parse, visit };\n","import { format as format$1 } from './impl/format.js';\nimport { parse as parse$1, getNodePath as getNodePath$1, getNodeValue as getNodeValue$1, findNodeAtOffset as findNodeAtOffset$1 } from './impl/parser.js';\nimport { createScanner as createScanner$1 } from './impl/scanner.js';\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 * Creates a JSON scanner on the given text.\n * If ignoreTrivia is set, whitespaces or comments are ignored.\n */\nconst createScanner = createScanner$1;\nvar ScanError;\n(function (ScanError) {\n    ScanError[ScanError[\"None\"] = 0] = \"None\";\n    ScanError[ScanError[\"UnexpectedEndOfComment\"] = 1] = \"UnexpectedEndOfComment\";\n    ScanError[ScanError[\"UnexpectedEndOfString\"] = 2] = \"UnexpectedEndOfString\";\n    ScanError[ScanError[\"UnexpectedEndOfNumber\"] = 3] = \"UnexpectedEndOfNumber\";\n    ScanError[ScanError[\"InvalidUnicode\"] = 4] = \"InvalidUnicode\";\n    ScanError[ScanError[\"InvalidEscapeCharacter\"] = 5] = \"InvalidEscapeCharacter\";\n    ScanError[ScanError[\"InvalidCharacter\"] = 6] = \"InvalidCharacter\";\n})(ScanError || (ScanError = {}));\nvar SyntaxKind;\n(function (SyntaxKind) {\n    SyntaxKind[SyntaxKind[\"OpenBraceToken\"] = 1] = \"OpenBraceToken\";\n    SyntaxKind[SyntaxKind[\"CloseBraceToken\"] = 2] = \"CloseBraceToken\";\n    SyntaxKind[SyntaxKind[\"OpenBracketToken\"] = 3] = \"OpenBracketToken\";\n    SyntaxKind[SyntaxKind[\"CloseBracketToken\"] = 4] = \"CloseBracketToken\";\n    SyntaxKind[SyntaxKind[\"CommaToken\"] = 5] = \"CommaToken\";\n    SyntaxKind[SyntaxKind[\"ColonToken\"] = 6] = \"ColonToken\";\n    SyntaxKind[SyntaxKind[\"NullKeyword\"] = 7] = \"NullKeyword\";\n    SyntaxKind[SyntaxKind[\"TrueKeyword\"] = 8] = \"TrueKeyword\";\n    SyntaxKind[SyntaxKind[\"FalseKeyword\"] = 9] = \"FalseKeyword\";\n    SyntaxKind[SyntaxKind[\"StringLiteral\"] = 10] = \"StringLiteral\";\n    SyntaxKind[SyntaxKind[\"NumericLiteral\"] = 11] = \"NumericLiteral\";\n    SyntaxKind[SyntaxKind[\"LineCommentTrivia\"] = 12] = \"LineCommentTrivia\";\n    SyntaxKind[SyntaxKind[\"BlockCommentTrivia\"] = 13] = \"BlockCommentTrivia\";\n    SyntaxKind[SyntaxKind[\"LineBreakTrivia\"] = 14] = \"LineBreakTrivia\";\n    SyntaxKind[SyntaxKind[\"Trivia\"] = 15] = \"Trivia\";\n    SyntaxKind[SyntaxKind[\"Unknown\"] = 16] = \"Unknown\";\n    SyntaxKind[SyntaxKind[\"EOF\"] = 17] = \"EOF\";\n})(SyntaxKind || (SyntaxKind = {}));\n/**\n * Parses the given text and returns the object the JSON content represents. On invalid input, the parser tries to be as fault tolerant as possible, but still return a result.\n * Therefore, always check the errors list to find out if the input was valid.\n */\nconst parse = parse$1;\n/**\n * Finds the innermost node at the given offset. If includeRightBound is set, also finds nodes that end at the given offset.\n */\nconst findNodeAtOffset = findNodeAtOffset$1;\n/**\n * Gets the JSON path of the given JSON DOM node\n */\nconst getNodePath = getNodePath$1;\n/**\n * Evaluates the JavaScript object of the given JSON DOM node\n */\nconst getNodeValue = getNodeValue$1;\nvar ParseErrorCode;\n(function (ParseErrorCode) {\n    ParseErrorCode[ParseErrorCode[\"InvalidSymbol\"] = 1] = \"InvalidSymbol\";\n    ParseErrorCode[ParseErrorCode[\"InvalidNumberFormat\"] = 2] = \"InvalidNumberFormat\";\n    ParseErrorCode[ParseErrorCode[\"PropertyNameExpected\"] = 3] = \"PropertyNameExpected\";\n    ParseErrorCode[ParseErrorCode[\"ValueExpected\"] = 4] = \"ValueExpected\";\n    ParseErrorCode[ParseErrorCode[\"ColonExpected\"] = 5] = \"ColonExpected\";\n    ParseErrorCode[ParseErrorCode[\"CommaExpected\"] = 6] = \"CommaExpected\";\n    ParseErrorCode[ParseErrorCode[\"CloseBraceExpected\"] = 7] = \"CloseBraceExpected\";\n    ParseErrorCode[ParseErrorCode[\"CloseBracketExpected\"] = 8] = \"CloseBracketExpected\";\n    ParseErrorCode[ParseErrorCode[\"EndOfFileExpected\"] = 9] = \"EndOfFileExpected\";\n    ParseErrorCode[ParseErrorCode[\"InvalidCommentToken\"] = 10] = \"InvalidCommentToken\";\n    ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfComment\"] = 11] = \"UnexpectedEndOfComment\";\n    ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfString\"] = 12] = \"UnexpectedEndOfString\";\n    ParseErrorCode[ParseErrorCode[\"UnexpectedEndOfNumber\"] = 13] = \"UnexpectedEndOfNumber\";\n    ParseErrorCode[ParseErrorCode[\"InvalidUnicode\"] = 14] = \"InvalidUnicode\";\n    ParseErrorCode[ParseErrorCode[\"InvalidEscapeCharacter\"] = 15] = \"InvalidEscapeCharacter\";\n    ParseErrorCode[ParseErrorCode[\"InvalidCharacter\"] = 16] = \"InvalidCharacter\";\n})(ParseErrorCode || (ParseErrorCode = {}));\n/**\n * Computes the edit operations needed to format a JSON document.\n *\n * @param documentText The input text\n * @param range The range to format or `undefined` to format the full content\n * @param options The formatting options\n * @returns The edit operations describing the formatting changes to the original document following the format described in {@linkcode EditResult}.\n * To apply the edit operations to the input, use {@linkcode applyEdits}.\n */\nfunction format(documentText, range, options) {\n    return format$1(documentText, range, options);\n}\n\nexport { ParseErrorCode, ScanError, SyntaxKind, createScanner, findNodeAtOffset, format, getNodePath, getNodeValue, parse };\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*--------------------------------------------------------------------------------------------*/\nfunction equals(one, other) {\n    if (one === other) {\n        return true;\n    }\n    if (one === null || one === undefined || other === null || other === undefined) {\n        return false;\n    }\n    if (typeof one !== typeof other) {\n        return false;\n    }\n    if (typeof one !== 'object') {\n        return false;\n    }\n    if ((Array.isArray(one)) !== (Array.isArray(other))) {\n        return false;\n    }\n    let i, key;\n    if (Array.isArray(one)) {\n        if (one.length !== other.length) {\n            return false;\n        }\n        for (i = 0; i < one.length; i++) {\n            if (!equals(one[i], other[i])) {\n                return false;\n            }\n        }\n    }\n    else {\n        const oneKeys = [];\n        for (key in one) {\n            oneKeys.push(key);\n        }\n        oneKeys.sort();\n        const otherKeys = [];\n        for (key in other) {\n            otherKeys.push(key);\n        }\n        otherKeys.sort();\n        if (!equals(oneKeys, otherKeys)) {\n            return false;\n        }\n        for (i = 0; i < oneKeys.length; i++) {\n            if (!equals(one[oneKeys[i]], other[oneKeys[i]])) {\n                return false;\n            }\n        }\n    }\n    return true;\n}\nfunction isNumber(val) {\n    return typeof val === 'number';\n}\nfunction isDefined(val) {\n    return typeof val !== 'undefined';\n}\nfunction isBoolean(val) {\n    return typeof val === 'boolean';\n}\nfunction isString(val) {\n    return typeof val === 'string';\n}\nfunction isObject(val) {\n    return typeof val === 'object' && val !== null && !Array.isArray(val);\n}\n\nexport { equals, isBoolean, isDefined, isNumber, isObject, isString };\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*--------------------------------------------------------------------------------------------*/\nfunction startsWith(haystack, needle) {\n    if (haystack.length < needle.length) {\n        return false;\n    }\n    for (let i = 0; i < needle.length; i++) {\n        if (haystack[i] !== needle[i]) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Determines if haystack ends with needle.\n */\nfunction endsWith(haystack, needle) {\n    const diff = haystack.length - needle.length;\n    if (diff > 0) {\n        return haystack.lastIndexOf(needle) === diff;\n    }\n    else if (diff === 0) {\n        return haystack === needle;\n    }\n    else {\n        return false;\n    }\n}\nfunction extendedRegExp(pattern) {\n    let flags = '';\n    if (startsWith(pattern, '(?i)')) {\n        pattern = pattern.substring(4);\n        flags = 'i';\n    }\n    try {\n        return new RegExp(pattern, flags + 'u');\n    }\n    catch (e) {\n        // could be an exception due to the 'u ' flag\n        try {\n            return new RegExp(pattern, flags);\n        }\n        catch (e) {\n            // invalid pattern\n            return undefined;\n        }\n    }\n}\n// from https://tanishiking.github.io/posts/count-unicode-codepoint/#work-hard-with-for-statements\nfunction stringLength(str) {\n    let count = 0;\n    for (let i = 0; i < str.length; i++) {\n        count++;\n        // obtain the i-th 16-bit\n        const code = str.charCodeAt(i);\n        if (0xD800 <= code && code <= 0xDBFF) {\n            // if the i-th 16bit is an upper surrogate\n            // skip the next 16 bits (lower surrogate)\n            i++;\n        }\n    }\n    return count;\n}\n\nexport { endsWith, extendedRegExp, startsWith, stringLength };\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 DocumentUri;\n(function (DocumentUri) {\n    function is(value) {\n        return typeof value === 'string';\n    }\n    DocumentUri.is = is;\n})(DocumentUri || (DocumentUri = {}));\nvar URI;\n(function (URI) {\n    function is(value) {\n        return typeof value === 'string';\n    }\n    URI.is = is;\n})(URI || (URI = {}));\nvar integer;\n(function (integer) {\n    integer.MIN_VALUE = -2147483648;\n    integer.MAX_VALUE = 2147483647;\n    function is(value) {\n        return typeof value === 'number' && integer.MIN_VALUE <= value && value <= integer.MAX_VALUE;\n    }\n    integer.is = is;\n})(integer || (integer = {}));\nvar uinteger;\n(function (uinteger) {\n    uinteger.MIN_VALUE = 0;\n    uinteger.MAX_VALUE = 2147483647;\n    function is(value) {\n        return typeof value === 'number' && uinteger.MIN_VALUE <= value && value <= uinteger.MAX_VALUE;\n    }\n    uinteger.is = is;\n})(uinteger || (uinteger = {}));\n/**\n * The Position namespace provides helper functions to work with\n * {@link Position} literals.\n */\nvar Position;\n(function (Position) {\n    /**\n     * Creates a new Position literal from the given line and character.\n     * @param line The position's line.\n     * @param character The position's character.\n     */\n    function create(line, character) {\n        if (line === Number.MAX_VALUE) {\n            line = uinteger.MAX_VALUE;\n        }\n        if (character === Number.MAX_VALUE) {\n            character = uinteger.MAX_VALUE;\n        }\n        return { line, character };\n    }\n    Position.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link Position} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.objectLiteral(candidate) && Is.uinteger(candidate.line) && Is.uinteger(candidate.character);\n    }\n    Position.is = is;\n})(Position || (Position = {}));\n/**\n * The Range namespace provides helper functions to work with\n * {@link Range} literals.\n */\nvar Range;\n(function (Range) {\n    function create(one, two, three, four) {\n        if (Is.uinteger(one) && Is.uinteger(two) && Is.uinteger(three) && Is.uinteger(four)) {\n            return { start: Position.create(one, two), end: Position.create(three, four) };\n        }\n        else if (Position.is(one) && Position.is(two)) {\n            return { start: one, end: two };\n        }\n        else {\n            throw new Error(`Range#create called with invalid arguments[${one}, ${two}, ${three}, ${four}]`);\n        }\n    }\n    Range.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link Range} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.objectLiteral(candidate) && Position.is(candidate.start) && Position.is(candidate.end);\n    }\n    Range.is = is;\n})(Range || (Range = {}));\n/**\n * The Location namespace provides helper functions to work with\n * {@link Location} literals.\n */\nvar Location;\n(function (Location) {\n    /**\n     * Creates a Location literal.\n     * @param uri The location's uri.\n     * @param range The location's range.\n     */\n    function create(uri, range) {\n        return { uri, range };\n    }\n    Location.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link Location} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.objectLiteral(candidate) && Range.is(candidate.range) && (Is.string(candidate.uri) || Is.undefined(candidate.uri));\n    }\n    Location.is = is;\n})(Location || (Location = {}));\n/**\n * The LocationLink namespace provides helper functions to work with\n * {@link LocationLink} literals.\n */\nvar LocationLink;\n(function (LocationLink) {\n    /**\n     * Creates a LocationLink literal.\n     * @param targetUri The definition's uri.\n     * @param targetRange The full range of the definition.\n     * @param targetSelectionRange The span of the symbol definition at the target.\n     * @param originSelectionRange The span of the symbol being defined in the originating source file.\n     */\n    function create(targetUri, targetRange, targetSelectionRange, originSelectionRange) {\n        return { targetUri, targetRange, targetSelectionRange, originSelectionRange };\n    }\n    LocationLink.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link LocationLink} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.objectLiteral(candidate) && Range.is(candidate.targetRange) && Is.string(candidate.targetUri)\n            && Range.is(candidate.targetSelectionRange)\n            && (Range.is(candidate.originSelectionRange) || Is.undefined(candidate.originSelectionRange));\n    }\n    LocationLink.is = is;\n})(LocationLink || (LocationLink = {}));\n/**\n * The Color namespace provides helper functions to work with\n * {@link Color} literals.\n */\nvar Color;\n(function (Color) {\n    /**\n     * Creates a new Color literal.\n     */\n    function create(red, green, blue, alpha) {\n        return {\n            red,\n            green,\n            blue,\n            alpha,\n        };\n    }\n    Color.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link Color} interface.\n     */\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && Is.numberRange(candidate.red, 0, 1)\n            && Is.numberRange(candidate.green, 0, 1)\n            && Is.numberRange(candidate.blue, 0, 1)\n            && Is.numberRange(candidate.alpha, 0, 1);\n    }\n    Color.is = is;\n})(Color || (Color = {}));\n/**\n * The ColorInformation namespace provides helper functions to work with\n * {@link ColorInformation} literals.\n */\nvar ColorInformation;\n(function (ColorInformation) {\n    /**\n     * Creates a new ColorInformation literal.\n     */\n    function create(range, color) {\n        return {\n            range,\n            color,\n        };\n    }\n    ColorInformation.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link ColorInformation} interface.\n     */\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && Range.is(candidate.range) && Color.is(candidate.color);\n    }\n    ColorInformation.is = is;\n})(ColorInformation || (ColorInformation = {}));\n/**\n * The Color namespace provides helper functions to work with\n * {@link ColorPresentation} literals.\n */\nvar ColorPresentation;\n(function (ColorPresentation) {\n    /**\n     * Creates a new ColorInformation literal.\n     */\n    function create(label, textEdit, additionalTextEdits) {\n        return {\n            label,\n            textEdit,\n            additionalTextEdits,\n        };\n    }\n    ColorPresentation.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link ColorInformation} interface.\n     */\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && Is.string(candidate.label)\n            && (Is.undefined(candidate.textEdit) || TextEdit.is(candidate))\n            && (Is.undefined(candidate.additionalTextEdits) || Is.typedArray(candidate.additionalTextEdits, TextEdit.is));\n    }\n    ColorPresentation.is = is;\n})(ColorPresentation || (ColorPresentation = {}));\n/**\n * A set of predefined range kinds.\n */\nvar FoldingRangeKind;\n(function (FoldingRangeKind) {\n    /**\n     * Folding range for a comment\n     */\n    FoldingRangeKind.Comment = 'comment';\n    /**\n     * Folding range for an import or include\n     */\n    FoldingRangeKind.Imports = 'imports';\n    /**\n     * Folding range for a region (e.g. `#region`)\n     */\n    FoldingRangeKind.Region = 'region';\n})(FoldingRangeKind || (FoldingRangeKind = {}));\n/**\n * The folding range namespace provides helper functions to work with\n * {@link FoldingRange} literals.\n */\nvar FoldingRange;\n(function (FoldingRange) {\n    /**\n     * Creates a new FoldingRange literal.\n     */\n    function create(startLine, endLine, startCharacter, endCharacter, kind, collapsedText) {\n        const result = {\n            startLine,\n            endLine\n        };\n        if (Is.defined(startCharacter)) {\n            result.startCharacter = startCharacter;\n        }\n        if (Is.defined(endCharacter)) {\n            result.endCharacter = endCharacter;\n        }\n        if (Is.defined(kind)) {\n            result.kind = kind;\n        }\n        if (Is.defined(collapsedText)) {\n            result.collapsedText = collapsedText;\n        }\n        return result;\n    }\n    FoldingRange.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link FoldingRange} interface.\n     */\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && Is.uinteger(candidate.startLine) && Is.uinteger(candidate.startLine)\n            && (Is.undefined(candidate.startCharacter) || Is.uinteger(candidate.startCharacter))\n            && (Is.undefined(candidate.endCharacter) || Is.uinteger(candidate.endCharacter))\n            && (Is.undefined(candidate.kind) || Is.string(candidate.kind));\n    }\n    FoldingRange.is = is;\n})(FoldingRange || (FoldingRange = {}));\n/**\n * The DiagnosticRelatedInformation namespace provides helper functions to work with\n * {@link DiagnosticRelatedInformation} literals.\n */\nvar DiagnosticRelatedInformation;\n(function (DiagnosticRelatedInformation) {\n    /**\n     * Creates a new DiagnosticRelatedInformation literal.\n     */\n    function create(location, message) {\n        return {\n            location,\n            message\n        };\n    }\n    DiagnosticRelatedInformation.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link DiagnosticRelatedInformation} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Location.is(candidate.location) && Is.string(candidate.message);\n    }\n    DiagnosticRelatedInformation.is = is;\n})(DiagnosticRelatedInformation || (DiagnosticRelatedInformation = {}));\n/**\n * The diagnostic's severity.\n */\nvar DiagnosticSeverity;\n(function (DiagnosticSeverity) {\n    /**\n     * Reports an error.\n     */\n    DiagnosticSeverity.Error = 1;\n    /**\n     * Reports a warning.\n     */\n    DiagnosticSeverity.Warning = 2;\n    /**\n     * Reports an information.\n     */\n    DiagnosticSeverity.Information = 3;\n    /**\n     * Reports a hint.\n     */\n    DiagnosticSeverity.Hint = 4;\n})(DiagnosticSeverity || (DiagnosticSeverity = {}));\n/**\n * The diagnostic tags.\n *\n * @since 3.15.0\n */\nvar DiagnosticTag;\n(function (DiagnosticTag) {\n    /**\n     * Unused or unnecessary code.\n     *\n     * Clients are allowed to render diagnostics with this tag faded out instead of having\n     * an error squiggle.\n     */\n    DiagnosticTag.Unnecessary = 1;\n    /**\n     * Deprecated or obsolete code.\n     *\n     * Clients are allowed to rendered diagnostics with this tag strike through.\n     */\n    DiagnosticTag.Deprecated = 2;\n})(DiagnosticTag || (DiagnosticTag = {}));\n/**\n * The CodeDescription namespace provides functions to deal with descriptions for diagnostic codes.\n *\n * @since 3.16.0\n */\nvar CodeDescription;\n(function (CodeDescription) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && Is.string(candidate.href);\n    }\n    CodeDescription.is = is;\n})(CodeDescription || (CodeDescription = {}));\n/**\n * The Diagnostic namespace provides helper functions to work with\n * {@link Diagnostic} literals.\n */\nvar Diagnostic;\n(function (Diagnostic) {\n    /**\n     * Creates a new Diagnostic literal.\n     */\n    function create(range, message, severity, code, source, relatedInformation) {\n        let result = { range, message };\n        if (Is.defined(severity)) {\n            result.severity = severity;\n        }\n        if (Is.defined(code)) {\n            result.code = code;\n        }\n        if (Is.defined(source)) {\n            result.source = source;\n        }\n        if (Is.defined(relatedInformation)) {\n            result.relatedInformation = relatedInformation;\n        }\n        return result;\n    }\n    Diagnostic.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link Diagnostic} interface.\n     */\n    function is(value) {\n        var _a;\n        let candidate = value;\n        return Is.defined(candidate)\n            && Range.is(candidate.range)\n            && Is.string(candidate.message)\n            && (Is.number(candidate.severity) || Is.undefined(candidate.severity))\n            && (Is.integer(candidate.code) || Is.string(candidate.code) || Is.undefined(candidate.code))\n            && (Is.undefined(candidate.codeDescription) || (Is.string((_a = candidate.codeDescription) === null || _a === void 0 ? void 0 : _a.href)))\n            && (Is.string(candidate.source) || Is.undefined(candidate.source))\n            && (Is.undefined(candidate.relatedInformation) || Is.typedArray(candidate.relatedInformation, DiagnosticRelatedInformation.is));\n    }\n    Diagnostic.is = is;\n})(Diagnostic || (Diagnostic = {}));\n/**\n * The Command namespace provides helper functions to work with\n * {@link Command} literals.\n */\nvar Command;\n(function (Command) {\n    /**\n     * Creates a new Command literal.\n     */\n    function create(title, command, ...args) {\n        let result = { title, command };\n        if (Is.defined(args) && args.length > 0) {\n            result.arguments = args;\n        }\n        return result;\n    }\n    Command.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link Command} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.title) && Is.string(candidate.command);\n    }\n    Command.is = is;\n})(Command || (Command = {}));\n/**\n * The TextEdit namespace provides helper function to create replace,\n * insert and delete edits more easily.\n */\nvar TextEdit;\n(function (TextEdit) {\n    /**\n     * Creates a replace text edit.\n     * @param range The range of text to be replaced.\n     * @param newText The new text.\n     */\n    function replace(range, newText) {\n        return { range, newText };\n    }\n    TextEdit.replace = replace;\n    /**\n     * Creates an insert text edit.\n     * @param position The position to insert the text at.\n     * @param newText The text to be inserted.\n     */\n    function insert(position, newText) {\n        return { range: { start: position, end: position }, newText };\n    }\n    TextEdit.insert = insert;\n    /**\n     * Creates a delete text edit.\n     * @param range The range of text to be deleted.\n     */\n    function del(range) {\n        return { range, newText: '' };\n    }\n    TextEdit.del = del;\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate)\n            && Is.string(candidate.newText)\n            && Range.is(candidate.range);\n    }\n    TextEdit.is = is;\n})(TextEdit || (TextEdit = {}));\nvar ChangeAnnotation;\n(function (ChangeAnnotation) {\n    function create(label, needsConfirmation, description) {\n        const result = { label };\n        if (needsConfirmation !== undefined) {\n            result.needsConfirmation = needsConfirmation;\n        }\n        if (description !== undefined) {\n            result.description = description;\n        }\n        return result;\n    }\n    ChangeAnnotation.create = create;\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && Is.string(candidate.label) &&\n            (Is.boolean(candidate.needsConfirmation) || candidate.needsConfirmation === undefined) &&\n            (Is.string(candidate.description) || candidate.description === undefined);\n    }\n    ChangeAnnotation.is = is;\n})(ChangeAnnotation || (ChangeAnnotation = {}));\nvar ChangeAnnotationIdentifier;\n(function (ChangeAnnotationIdentifier) {\n    function is(value) {\n        const candidate = value;\n        return Is.string(candidate);\n    }\n    ChangeAnnotationIdentifier.is = is;\n})(ChangeAnnotationIdentifier || (ChangeAnnotationIdentifier = {}));\nvar AnnotatedTextEdit;\n(function (AnnotatedTextEdit) {\n    /**\n     * Creates an annotated replace text edit.\n     *\n     * @param range The range of text to be replaced.\n     * @param newText The new text.\n     * @param annotation The annotation.\n     */\n    function replace(range, newText, annotation) {\n        return { range, newText, annotationId: annotation };\n    }\n    AnnotatedTextEdit.replace = replace;\n    /**\n     * Creates an annotated insert text edit.\n     *\n     * @param position The position to insert the text at.\n     * @param newText The text to be inserted.\n     * @param annotation The annotation.\n     */\n    function insert(position, newText, annotation) {\n        return { range: { start: position, end: position }, newText, annotationId: annotation };\n    }\n    AnnotatedTextEdit.insert = insert;\n    /**\n     * Creates an annotated delete text edit.\n     *\n     * @param range The range of text to be deleted.\n     * @param annotation The annotation.\n     */\n    function del(range, annotation) {\n        return { range, newText: '', annotationId: annotation };\n    }\n    AnnotatedTextEdit.del = del;\n    function is(value) {\n        const candidate = value;\n        return TextEdit.is(candidate) && (ChangeAnnotation.is(candidate.annotationId) || ChangeAnnotationIdentifier.is(candidate.annotationId));\n    }\n    AnnotatedTextEdit.is = is;\n})(AnnotatedTextEdit || (AnnotatedTextEdit = {}));\n/**\n * The TextDocumentEdit namespace provides helper function to create\n * an edit that manipulates a text document.\n */\nvar TextDocumentEdit;\n(function (TextDocumentEdit) {\n    /**\n     * Creates a new `TextDocumentEdit`\n     */\n    function create(textDocument, edits) {\n        return { textDocument, edits };\n    }\n    TextDocumentEdit.create = create;\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate)\n            && OptionalVersionedTextDocumentIdentifier.is(candidate.textDocument)\n            && Array.isArray(candidate.edits);\n    }\n    TextDocumentEdit.is = is;\n})(TextDocumentEdit || (TextDocumentEdit = {}));\nvar CreateFile;\n(function (CreateFile) {\n    function create(uri, options, annotation) {\n        let result = {\n            kind: 'create',\n            uri\n        };\n        if (options !== undefined && (options.overwrite !== undefined || options.ignoreIfExists !== undefined)) {\n            result.options = options;\n        }\n        if (annotation !== undefined) {\n            result.annotationId = annotation;\n        }\n        return result;\n    }\n    CreateFile.create = create;\n    function is(value) {\n        let candidate = value;\n        return candidate && candidate.kind === 'create' && Is.string(candidate.uri) && (candidate.options === undefined ||\n            ((candidate.options.overwrite === undefined || Is.boolean(candidate.options.overwrite)) && (candidate.options.ignoreIfExists === undefined || Is.boolean(candidate.options.ignoreIfExists)))) && (candidate.annotationId === undefined || ChangeAnnotationIdentifier.is(candidate.annotationId));\n    }\n    CreateFile.is = is;\n})(CreateFile || (CreateFile = {}));\nvar RenameFile;\n(function (RenameFile) {\n    function create(oldUri, newUri, options, annotation) {\n        let result = {\n            kind: 'rename',\n            oldUri,\n            newUri\n        };\n        if (options !== undefined && (options.overwrite !== undefined || options.ignoreIfExists !== undefined)) {\n            result.options = options;\n        }\n        if (annotation !== undefined) {\n            result.annotationId = annotation;\n        }\n        return result;\n    }\n    RenameFile.create = create;\n    function is(value) {\n        let candidate = value;\n        return candidate && candidate.kind === 'rename' && Is.string(candidate.oldUri) && Is.string(candidate.newUri) && (candidate.options === undefined ||\n            ((candidate.options.overwrite === undefined || Is.boolean(candidate.options.overwrite)) && (candidate.options.ignoreIfExists === undefined || Is.boolean(candidate.options.ignoreIfExists)))) && (candidate.annotationId === undefined || ChangeAnnotationIdentifier.is(candidate.annotationId));\n    }\n    RenameFile.is = is;\n})(RenameFile || (RenameFile = {}));\nvar DeleteFile;\n(function (DeleteFile) {\n    function create(uri, options, annotation) {\n        let result = {\n            kind: 'delete',\n            uri\n        };\n        if (options !== undefined && (options.recursive !== undefined || options.ignoreIfNotExists !== undefined)) {\n            result.options = options;\n        }\n        if (annotation !== undefined) {\n            result.annotationId = annotation;\n        }\n        return result;\n    }\n    DeleteFile.create = create;\n    function is(value) {\n        let candidate = value;\n        return candidate && candidate.kind === 'delete' && Is.string(candidate.uri) && (candidate.options === undefined ||\n            ((candidate.options.recursive === undefined || Is.boolean(candidate.options.recursive)) && (candidate.options.ignoreIfNotExists === undefined || Is.boolean(candidate.options.ignoreIfNotExists)))) && (candidate.annotationId === undefined || ChangeAnnotationIdentifier.is(candidate.annotationId));\n    }\n    DeleteFile.is = is;\n})(DeleteFile || (DeleteFile = {}));\nvar WorkspaceEdit;\n(function (WorkspaceEdit) {\n    function is(value) {\n        let candidate = value;\n        return candidate &&\n            (candidate.changes !== undefined || candidate.documentChanges !== undefined) &&\n            (candidate.documentChanges === undefined || candidate.documentChanges.every((change) => {\n                if (Is.string(change.kind)) {\n                    return CreateFile.is(change) || RenameFile.is(change) || DeleteFile.is(change);\n                }\n                else {\n                    return TextDocumentEdit.is(change);\n                }\n            }));\n    }\n    WorkspaceEdit.is = is;\n})(WorkspaceEdit || (WorkspaceEdit = {}));\n/**\n * The TextDocumentIdentifier namespace provides helper functions to work with\n * {@link TextDocumentIdentifier} literals.\n */\nvar TextDocumentIdentifier;\n(function (TextDocumentIdentifier) {\n    /**\n     * Creates a new TextDocumentIdentifier literal.\n     * @param uri The document's uri.\n     */\n    function create(uri) {\n        return { uri };\n    }\n    TextDocumentIdentifier.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link TextDocumentIdentifier} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri);\n    }\n    TextDocumentIdentifier.is = is;\n})(TextDocumentIdentifier || (TextDocumentIdentifier = {}));\n/**\n * The VersionedTextDocumentIdentifier namespace provides helper functions to work with\n * {@link VersionedTextDocumentIdentifier} literals.\n */\nvar VersionedTextDocumentIdentifier;\n(function (VersionedTextDocumentIdentifier) {\n    /**\n     * Creates a new VersionedTextDocumentIdentifier literal.\n     * @param uri The document's uri.\n     * @param version The document's version.\n     */\n    function create(uri, version) {\n        return { uri, version };\n    }\n    VersionedTextDocumentIdentifier.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link VersionedTextDocumentIdentifier} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri) && Is.integer(candidate.version);\n    }\n    VersionedTextDocumentIdentifier.is = is;\n})(VersionedTextDocumentIdentifier || (VersionedTextDocumentIdentifier = {}));\n/**\n * The OptionalVersionedTextDocumentIdentifier namespace provides helper functions to work with\n * {@link OptionalVersionedTextDocumentIdentifier} literals.\n */\nvar OptionalVersionedTextDocumentIdentifier;\n(function (OptionalVersionedTextDocumentIdentifier) {\n    /**\n     * Creates a new OptionalVersionedTextDocumentIdentifier literal.\n     * @param uri The document's uri.\n     * @param version The document's version.\n     */\n    function create(uri, version) {\n        return { uri, version };\n    }\n    OptionalVersionedTextDocumentIdentifier.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link OptionalVersionedTextDocumentIdentifier} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri) && (candidate.version === null || Is.integer(candidate.version));\n    }\n    OptionalVersionedTextDocumentIdentifier.is = is;\n})(OptionalVersionedTextDocumentIdentifier || (OptionalVersionedTextDocumentIdentifier = {}));\n/**\n * The TextDocumentItem namespace provides helper functions to work with\n * {@link TextDocumentItem} literals.\n */\nvar TextDocumentItem;\n(function (TextDocumentItem) {\n    /**\n     * Creates a new TextDocumentItem literal.\n     * @param uri The document's uri.\n     * @param languageId The document's language identifier.\n     * @param version The document's version number.\n     * @param text The document's text.\n     */\n    function create(uri, languageId, version, text) {\n        return { uri, languageId, version, text };\n    }\n    TextDocumentItem.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link TextDocumentItem} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri) && Is.string(candidate.languageId) && Is.integer(candidate.version) && Is.string(candidate.text);\n    }\n    TextDocumentItem.is = is;\n})(TextDocumentItem || (TextDocumentItem = {}));\n/**\n * Describes the content type that a client supports in various\n * result literals like `Hover`, `ParameterInfo` or `CompletionItem`.\n *\n * Please note that `MarkupKinds` must not start with a `$`. This kinds\n * are reserved for internal usage.\n */\nvar MarkupKind;\n(function (MarkupKind) {\n    /**\n     * Plain text is supported as a content format\n     */\n    MarkupKind.PlainText = 'plaintext';\n    /**\n     * Markdown is supported as a content format\n     */\n    MarkupKind.Markdown = 'markdown';\n    /**\n     * Checks whether the given value is a value of the {@link MarkupKind} type.\n     */\n    function is(value) {\n        const candidate = value;\n        return candidate === MarkupKind.PlainText || candidate === MarkupKind.Markdown;\n    }\n    MarkupKind.is = is;\n})(MarkupKind || (MarkupKind = {}));\nvar MarkupContent;\n(function (MarkupContent) {\n    /**\n     * Checks whether the given value conforms to the {@link MarkupContent} interface.\n     */\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(value) && MarkupKind.is(candidate.kind) && Is.string(candidate.value);\n    }\n    MarkupContent.is = is;\n})(MarkupContent || (MarkupContent = {}));\n/**\n * The kind of a completion entry.\n */\nvar CompletionItemKind;\n(function (CompletionItemKind) {\n    CompletionItemKind.Text = 1;\n    CompletionItemKind.Method = 2;\n    CompletionItemKind.Function = 3;\n    CompletionItemKind.Constructor = 4;\n    CompletionItemKind.Field = 5;\n    CompletionItemKind.Variable = 6;\n    CompletionItemKind.Class = 7;\n    CompletionItemKind.Interface = 8;\n    CompletionItemKind.Module = 9;\n    CompletionItemKind.Property = 10;\n    CompletionItemKind.Unit = 11;\n    CompletionItemKind.Value = 12;\n    CompletionItemKind.Enum = 13;\n    CompletionItemKind.Keyword = 14;\n    CompletionItemKind.Snippet = 15;\n    CompletionItemKind.Color = 16;\n    CompletionItemKind.File = 17;\n    CompletionItemKind.Reference = 18;\n    CompletionItemKind.Folder = 19;\n    CompletionItemKind.EnumMember = 20;\n    CompletionItemKind.Constant = 21;\n    CompletionItemKind.Struct = 22;\n    CompletionItemKind.Event = 23;\n    CompletionItemKind.Operator = 24;\n    CompletionItemKind.TypeParameter = 25;\n})(CompletionItemKind || (CompletionItemKind = {}));\n/**\n * Defines whether the insert text in a completion item should be interpreted as\n * plain text or a snippet.\n */\nvar InsertTextFormat;\n(function (InsertTextFormat) {\n    /**\n     * The primary text to be inserted is treated as a plain string.\n     */\n    InsertTextFormat.PlainText = 1;\n    /**\n     * The primary text to be inserted is treated as a snippet.\n     *\n     * A snippet can define tab stops and placeholders with `$1`, `$2`\n     * and `${3:foo}`. `$0` defines the final tab stop, it defaults to\n     * the end of the snippet. Placeholders with equal identifiers are linked,\n     * that is typing in one will update others too.\n     *\n     * See also: https://microsoft.github.io/language-server-protocol/specifications/specification-current/#snippet_syntax\n     */\n    InsertTextFormat.Snippet = 2;\n})(InsertTextFormat || (InsertTextFormat = {}));\n/**\n * Completion item tags are extra annotations that tweak the rendering of a completion\n * item.\n *\n * @since 3.15.0\n */\nvar CompletionItemTag;\n(function (CompletionItemTag) {\n    /**\n     * Render a completion as obsolete, usually using a strike-out.\n     */\n    CompletionItemTag.Deprecated = 1;\n})(CompletionItemTag || (CompletionItemTag = {}));\n/**\n * The InsertReplaceEdit namespace provides functions to deal with insert / replace edits.\n *\n * @since 3.16.0\n */\nvar InsertReplaceEdit;\n(function (InsertReplaceEdit) {\n    /**\n     * Creates a new insert / replace edit\n     */\n    function create(newText, insert, replace) {\n        return { newText, insert, replace };\n    }\n    InsertReplaceEdit.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link InsertReplaceEdit} interface.\n     */\n    function is(value) {\n        const candidate = value;\n        return candidate && Is.string(candidate.newText) && Range.is(candidate.insert) && Range.is(candidate.replace);\n    }\n    InsertReplaceEdit.is = is;\n})(InsertReplaceEdit || (InsertReplaceEdit = {}));\n/**\n * How whitespace and indentation is handled during completion\n * item insertion.\n *\n * @since 3.16.0\n */\nvar InsertTextMode;\n(function (InsertTextMode) {\n    /**\n     * The insertion or replace strings is taken as it is. If the\n     * value is multi line the lines below the cursor will be\n     * inserted using the indentation defined in the string value.\n     * The client will not apply any kind of adjustments to the\n     * string.\n     */\n    InsertTextMode.asIs = 1;\n    /**\n     * The editor adjusts leading whitespace of new lines so that\n     * they match the indentation up to the cursor of the line for\n     * which the item is accepted.\n     *\n     * Consider a line like this: <2tabs><cursor><3tabs>foo. Accepting a\n     * multi line completion item is indented using 2 tabs and all\n     * following lines inserted will be indented using 2 tabs as well.\n     */\n    InsertTextMode.adjustIndentation = 2;\n})(InsertTextMode || (InsertTextMode = {}));\nvar CompletionItemLabelDetails;\n(function (CompletionItemLabelDetails) {\n    function is(value) {\n        const candidate = value;\n        return candidate && (Is.string(candidate.detail) || candidate.detail === undefined) &&\n            (Is.string(candidate.description) || candidate.description === undefined);\n    }\n    CompletionItemLabelDetails.is = is;\n})(CompletionItemLabelDetails || (CompletionItemLabelDetails = {}));\n/**\n * The CompletionItem namespace provides functions to deal with\n * completion items.\n */\nvar CompletionItem;\n(function (CompletionItem) {\n    /**\n     * Create a completion item and seed it with a label.\n     * @param label The completion item's label\n     */\n    function create(label) {\n        return { label };\n    }\n    CompletionItem.create = create;\n})(CompletionItem || (CompletionItem = {}));\n/**\n * The CompletionList namespace provides functions to deal with\n * completion lists.\n */\nvar CompletionList;\n(function (CompletionList) {\n    /**\n     * Creates a new completion list.\n     *\n     * @param items The completion items.\n     * @param isIncomplete The list is not complete.\n     */\n    function create(items, isIncomplete) {\n        return { items: items ? items : [], isIncomplete: !!isIncomplete };\n    }\n    CompletionList.create = create;\n})(CompletionList || (CompletionList = {}));\nvar MarkedString;\n(function (MarkedString) {\n    /**\n     * Creates a marked string from plain text.\n     *\n     * @param plainText The plain text.\n     */\n    function fromPlainText(plainText) {\n        return plainText.replace(/[\\\\`*_{}[\\]()#+\\-.!]/g, '\\\\$&'); // escape markdown syntax tokens: http://daringfireball.net/projects/markdown/syntax#backslash\n    }\n    MarkedString.fromPlainText = fromPlainText;\n    /**\n     * Checks whether the given value conforms to the {@link MarkedString} type.\n     */\n    function is(value) {\n        const candidate = value;\n        return Is.string(candidate) || (Is.objectLiteral(candidate) && Is.string(candidate.language) && Is.string(candidate.value));\n    }\n    MarkedString.is = is;\n})(MarkedString || (MarkedString = {}));\nvar Hover;\n(function (Hover) {\n    /**\n     * Checks whether the given value conforms to the {@link Hover} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return !!candidate && Is.objectLiteral(candidate) && (MarkupContent.is(candidate.contents) ||\n            MarkedString.is(candidate.contents) ||\n            Is.typedArray(candidate.contents, MarkedString.is)) && (value.range === undefined || Range.is(value.range));\n    }\n    Hover.is = is;\n})(Hover || (Hover = {}));\n/**\n * The ParameterInformation namespace provides helper functions to work with\n * {@link ParameterInformation} literals.\n */\nvar ParameterInformation;\n(function (ParameterInformation) {\n    /**\n     * Creates a new parameter information literal.\n     *\n     * @param label A label string.\n     * @param documentation A doc string.\n     */\n    function create(label, documentation) {\n        return documentation ? { label, documentation } : { label };\n    }\n    ParameterInformation.create = create;\n})(ParameterInformation || (ParameterInformation = {}));\n/**\n * The SignatureInformation namespace provides helper functions to work with\n * {@link SignatureInformation} literals.\n */\nvar SignatureInformation;\n(function (SignatureInformation) {\n    function create(label, documentation, ...parameters) {\n        let result = { label };\n        if (Is.defined(documentation)) {\n            result.documentation = documentation;\n        }\n        if (Is.defined(parameters)) {\n            result.parameters = parameters;\n        }\n        else {\n            result.parameters = [];\n        }\n        return result;\n    }\n    SignatureInformation.create = create;\n})(SignatureInformation || (SignatureInformation = {}));\n/**\n * A document highlight kind.\n */\nvar DocumentHighlightKind;\n(function (DocumentHighlightKind) {\n    /**\n     * A textual occurrence.\n     */\n    DocumentHighlightKind.Text = 1;\n    /**\n     * Read-access of a symbol, like reading a variable.\n     */\n    DocumentHighlightKind.Read = 2;\n    /**\n     * Write-access of a symbol, like writing to a variable.\n     */\n    DocumentHighlightKind.Write = 3;\n})(DocumentHighlightKind || (DocumentHighlightKind = {}));\n/**\n * DocumentHighlight namespace to provide helper functions to work with\n * {@link DocumentHighlight} literals.\n */\nvar DocumentHighlight;\n(function (DocumentHighlight) {\n    /**\n     * Create a DocumentHighlight object.\n     * @param range The range the highlight applies to.\n     * @param kind The highlight kind\n     */\n    function create(range, kind) {\n        let result = { range };\n        if (Is.number(kind)) {\n            result.kind = kind;\n        }\n        return result;\n    }\n    DocumentHighlight.create = create;\n})(DocumentHighlight || (DocumentHighlight = {}));\n/**\n * A symbol kind.\n */\nvar SymbolKind;\n(function (SymbolKind) {\n    SymbolKind.File = 1;\n    SymbolKind.Module = 2;\n    SymbolKind.Namespace = 3;\n    SymbolKind.Package = 4;\n    SymbolKind.Class = 5;\n    SymbolKind.Method = 6;\n    SymbolKind.Property = 7;\n    SymbolKind.Field = 8;\n    SymbolKind.Constructor = 9;\n    SymbolKind.Enum = 10;\n    SymbolKind.Interface = 11;\n    SymbolKind.Function = 12;\n    SymbolKind.Variable = 13;\n    SymbolKind.Constant = 14;\n    SymbolKind.String = 15;\n    SymbolKind.Number = 16;\n    SymbolKind.Boolean = 17;\n    SymbolKind.Array = 18;\n    SymbolKind.Object = 19;\n    SymbolKind.Key = 20;\n    SymbolKind.Null = 21;\n    SymbolKind.EnumMember = 22;\n    SymbolKind.Struct = 23;\n    SymbolKind.Event = 24;\n    SymbolKind.Operator = 25;\n    SymbolKind.TypeParameter = 26;\n})(SymbolKind || (SymbolKind = {}));\n/**\n * Symbol tags are extra annotations that tweak the rendering of a symbol.\n *\n * @since 3.16\n */\nvar SymbolTag;\n(function (SymbolTag) {\n    /**\n     * Render a symbol as obsolete, usually using a strike-out.\n     */\n    SymbolTag.Deprecated = 1;\n})(SymbolTag || (SymbolTag = {}));\nvar SymbolInformation;\n(function (SymbolInformation) {\n    /**\n     * Creates a new symbol information literal.\n     *\n     * @param name The name of the symbol.\n     * @param kind The kind of the symbol.\n     * @param range The range of the location of the symbol.\n     * @param uri The resource of the location of symbol.\n     * @param containerName The name of the symbol containing the symbol.\n     */\n    function create(name, kind, range, uri, containerName) {\n        let result = {\n            name,\n            kind,\n            location: { uri, range }\n        };\n        if (containerName) {\n            result.containerName = containerName;\n        }\n        return result;\n    }\n    SymbolInformation.create = create;\n})(SymbolInformation || (SymbolInformation = {}));\nvar WorkspaceSymbol;\n(function (WorkspaceSymbol) {\n    /**\n     * Create a new workspace symbol.\n     *\n     * @param name The name of the symbol.\n     * @param kind The kind of the symbol.\n     * @param uri The resource of the location of the symbol.\n     * @param range An options range of the location.\n     * @returns A WorkspaceSymbol.\n     */\n    function create(name, kind, uri, range) {\n        return range !== undefined\n            ? { name, kind, location: { uri, range } }\n            : { name, kind, location: { uri } };\n    }\n    WorkspaceSymbol.create = create;\n})(WorkspaceSymbol || (WorkspaceSymbol = {}));\nvar DocumentSymbol;\n(function (DocumentSymbol) {\n    /**\n     * Creates a new symbol information literal.\n     *\n     * @param name The name of the symbol.\n     * @param detail The detail of the symbol.\n     * @param kind The kind of the symbol.\n     * @param range The range of the symbol.\n     * @param selectionRange The selectionRange of the symbol.\n     * @param children Children of the symbol.\n     */\n    function create(name, detail, kind, range, selectionRange, children) {\n        let result = {\n            name,\n            detail,\n            kind,\n            range,\n            selectionRange\n        };\n        if (children !== undefined) {\n            result.children = children;\n        }\n        return result;\n    }\n    DocumentSymbol.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link DocumentSymbol} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return candidate &&\n            Is.string(candidate.name) && Is.number(candidate.kind) &&\n            Range.is(candidate.range) && Range.is(candidate.selectionRange) &&\n            (candidate.detail === undefined || Is.string(candidate.detail)) &&\n            (candidate.deprecated === undefined || Is.boolean(candidate.deprecated)) &&\n            (candidate.children === undefined || Array.isArray(candidate.children)) &&\n            (candidate.tags === undefined || Array.isArray(candidate.tags));\n    }\n    DocumentSymbol.is = is;\n})(DocumentSymbol || (DocumentSymbol = {}));\n/**\n * A set of predefined code action kinds\n */\nvar CodeActionKind;\n(function (CodeActionKind) {\n    /**\n     * Empty kind.\n     */\n    CodeActionKind.Empty = '';\n    /**\n     * Base kind for quickfix actions: 'quickfix'\n     */\n    CodeActionKind.QuickFix = 'quickfix';\n    /**\n     * Base kind for refactoring actions: 'refactor'\n     */\n    CodeActionKind.Refactor = 'refactor';\n    /**\n     * Base kind for refactoring extraction actions: 'refactor.extract'\n     *\n     * Example extract actions:\n     *\n     * - Extract method\n     * - Extract function\n     * - Extract variable\n     * - Extract interface from class\n     * - ...\n     */\n    CodeActionKind.RefactorExtract = 'refactor.extract';\n    /**\n     * Base kind for refactoring inline actions: 'refactor.inline'\n     *\n     * Example inline actions:\n     *\n     * - Inline function\n     * - Inline variable\n     * - Inline constant\n     * - ...\n     */\n    CodeActionKind.RefactorInline = 'refactor.inline';\n    /**\n     * Base kind for refactoring rewrite actions: 'refactor.rewrite'\n     *\n     * Example rewrite actions:\n     *\n     * - Convert JavaScript function to class\n     * - Add or remove parameter\n     * - Encapsulate field\n     * - Make method static\n     * - Move method to base class\n     * - ...\n     */\n    CodeActionKind.RefactorRewrite = 'refactor.rewrite';\n    /**\n     * Base kind for source actions: `source`\n     *\n     * Source code actions apply to the entire file.\n     */\n    CodeActionKind.Source = 'source';\n    /**\n     * Base kind for an organize imports source action: `source.organizeImports`\n     */\n    CodeActionKind.SourceOrganizeImports = 'source.organizeImports';\n    /**\n     * Base kind for auto-fix source actions: `source.fixAll`.\n     *\n     * Fix all actions automatically fix errors that have a clear fix that do not require user input.\n     * They should not suppress errors or perform unsafe fixes such as generating new types or classes.\n     *\n     * @since 3.15.0\n     */\n    CodeActionKind.SourceFixAll = 'source.fixAll';\n})(CodeActionKind || (CodeActionKind = {}));\n/**\n * The reason why code actions were requested.\n *\n * @since 3.17.0\n */\nvar CodeActionTriggerKind;\n(function (CodeActionTriggerKind) {\n    /**\n     * Code actions were explicitly requested by the user or by an extension.\n     */\n    CodeActionTriggerKind.Invoked = 1;\n    /**\n     * Code actions were requested automatically.\n     *\n     * This typically happens when current selection in a file changes, but can\n     * also be triggered when file content changes.\n     */\n    CodeActionTriggerKind.Automatic = 2;\n})(CodeActionTriggerKind || (CodeActionTriggerKind = {}));\n/**\n * The CodeActionContext namespace provides helper functions to work with\n * {@link CodeActionContext} literals.\n */\nvar CodeActionContext;\n(function (CodeActionContext) {\n    /**\n     * Creates a new CodeActionContext literal.\n     */\n    function create(diagnostics, only, triggerKind) {\n        let result = { diagnostics };\n        if (only !== undefined && only !== null) {\n            result.only = only;\n        }\n        if (triggerKind !== undefined && triggerKind !== null) {\n            result.triggerKind = triggerKind;\n        }\n        return result;\n    }\n    CodeActionContext.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link CodeActionContext} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.typedArray(candidate.diagnostics, Diagnostic.is)\n            && (candidate.only === undefined || Is.typedArray(candidate.only, Is.string))\n            && (candidate.triggerKind === undefined || candidate.triggerKind === CodeActionTriggerKind.Invoked || candidate.triggerKind === CodeActionTriggerKind.Automatic);\n    }\n    CodeActionContext.is = is;\n})(CodeActionContext || (CodeActionContext = {}));\nvar CodeAction;\n(function (CodeAction) {\n    function create(title, kindOrCommandOrEdit, kind) {\n        let result = { title };\n        let checkKind = true;\n        if (typeof kindOrCommandOrEdit === 'string') {\n            checkKind = false;\n            result.kind = kindOrCommandOrEdit;\n        }\n        else if (Command.is(kindOrCommandOrEdit)) {\n            result.command = kindOrCommandOrEdit;\n        }\n        else {\n            result.edit = kindOrCommandOrEdit;\n        }\n        if (checkKind && kind !== undefined) {\n            result.kind = kind;\n        }\n        return result;\n    }\n    CodeAction.create = create;\n    function is(value) {\n        let candidate = value;\n        return candidate && Is.string(candidate.title) &&\n            (candidate.diagnostics === undefined || Is.typedArray(candidate.diagnostics, Diagnostic.is)) &&\n            (candidate.kind === undefined || Is.string(candidate.kind)) &&\n            (candidate.edit !== undefined || candidate.command !== undefined) &&\n            (candidate.command === undefined || Command.is(candidate.command)) &&\n            (candidate.isPreferred === undefined || Is.boolean(candidate.isPreferred)) &&\n            (candidate.edit === undefined || WorkspaceEdit.is(candidate.edit));\n    }\n    CodeAction.is = is;\n})(CodeAction || (CodeAction = {}));\n/**\n * The CodeLens namespace provides helper functions to work with\n * {@link CodeLens} literals.\n */\nvar CodeLens;\n(function (CodeLens) {\n    /**\n     * Creates a new CodeLens literal.\n     */\n    function create(range, data) {\n        let result = { range };\n        if (Is.defined(data)) {\n            result.data = data;\n        }\n        return result;\n    }\n    CodeLens.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link CodeLens} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Range.is(candidate.range) && (Is.undefined(candidate.command) || Command.is(candidate.command));\n    }\n    CodeLens.is = is;\n})(CodeLens || (CodeLens = {}));\n/**\n * The FormattingOptions namespace provides helper functions to work with\n * {@link FormattingOptions} literals.\n */\nvar FormattingOptions;\n(function (FormattingOptions) {\n    /**\n     * Creates a new FormattingOptions literal.\n     */\n    function create(tabSize, insertSpaces) {\n        return { tabSize, insertSpaces };\n    }\n    FormattingOptions.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link FormattingOptions} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.uinteger(candidate.tabSize) && Is.boolean(candidate.insertSpaces);\n    }\n    FormattingOptions.is = is;\n})(FormattingOptions || (FormattingOptions = {}));\n/**\n * The DocumentLink namespace provides helper functions to work with\n * {@link DocumentLink} literals.\n */\nvar DocumentLink;\n(function (DocumentLink) {\n    /**\n     * Creates a new DocumentLink literal.\n     */\n    function create(range, target, data) {\n        return { range, target, data };\n    }\n    DocumentLink.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link DocumentLink} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Range.is(candidate.range) && (Is.undefined(candidate.target) || Is.string(candidate.target));\n    }\n    DocumentLink.is = is;\n})(DocumentLink || (DocumentLink = {}));\n/**\n * The SelectionRange namespace provides helper function to work with\n * SelectionRange literals.\n */\nvar SelectionRange;\n(function (SelectionRange) {\n    /**\n     * Creates a new SelectionRange\n     * @param range the range.\n     * @param parent an optional parent.\n     */\n    function create(range, parent) {\n        return { range, parent };\n    }\n    SelectionRange.create = create;\n    function is(value) {\n        let candidate = value;\n        return Is.objectLiteral(candidate) && Range.is(candidate.range) && (candidate.parent === undefined || SelectionRange.is(candidate.parent));\n    }\n    SelectionRange.is = is;\n})(SelectionRange || (SelectionRange = {}));\n/**\n * A set of predefined token types. This set is not fixed\n * an clients can specify additional token types via the\n * corresponding client capabilities.\n *\n * @since 3.16.0\n */\nvar SemanticTokenTypes;\n(function (SemanticTokenTypes) {\n    SemanticTokenTypes[\"namespace\"] = \"namespace\";\n    /**\n     * Represents a generic type. Acts as a fallback for types which can't be mapped to\n     * a specific type like class or enum.\n     */\n    SemanticTokenTypes[\"type\"] = \"type\";\n    SemanticTokenTypes[\"class\"] = \"class\";\n    SemanticTokenTypes[\"enum\"] = \"enum\";\n    SemanticTokenTypes[\"interface\"] = \"interface\";\n    SemanticTokenTypes[\"struct\"] = \"struct\";\n    SemanticTokenTypes[\"typeParameter\"] = \"typeParameter\";\n    SemanticTokenTypes[\"parameter\"] = \"parameter\";\n    SemanticTokenTypes[\"variable\"] = \"variable\";\n    SemanticTokenTypes[\"property\"] = \"property\";\n    SemanticTokenTypes[\"enumMember\"] = \"enumMember\";\n    SemanticTokenTypes[\"event\"] = \"event\";\n    SemanticTokenTypes[\"function\"] = \"function\";\n    SemanticTokenTypes[\"method\"] = \"method\";\n    SemanticTokenTypes[\"macro\"] = \"macro\";\n    SemanticTokenTypes[\"keyword\"] = \"keyword\";\n    SemanticTokenTypes[\"modifier\"] = \"modifier\";\n    SemanticTokenTypes[\"comment\"] = \"comment\";\n    SemanticTokenTypes[\"string\"] = \"string\";\n    SemanticTokenTypes[\"number\"] = \"number\";\n    SemanticTokenTypes[\"regexp\"] = \"regexp\";\n    SemanticTokenTypes[\"operator\"] = \"operator\";\n    /**\n     * @since 3.17.0\n     */\n    SemanticTokenTypes[\"decorator\"] = \"decorator\";\n})(SemanticTokenTypes || (SemanticTokenTypes = {}));\n/**\n * A set of predefined token modifiers. This set is not fixed\n * an clients can specify additional token types via the\n * corresponding client capabilities.\n *\n * @since 3.16.0\n */\nvar SemanticTokenModifiers;\n(function (SemanticTokenModifiers) {\n    SemanticTokenModifiers[\"declaration\"] = \"declaration\";\n    SemanticTokenModifiers[\"definition\"] = \"definition\";\n    SemanticTokenModifiers[\"readonly\"] = \"readonly\";\n    SemanticTokenModifiers[\"static\"] = \"static\";\n    SemanticTokenModifiers[\"deprecated\"] = \"deprecated\";\n    SemanticTokenModifiers[\"abstract\"] = \"abstract\";\n    SemanticTokenModifiers[\"async\"] = \"async\";\n    SemanticTokenModifiers[\"modification\"] = \"modification\";\n    SemanticTokenModifiers[\"documentation\"] = \"documentation\";\n    SemanticTokenModifiers[\"defaultLibrary\"] = \"defaultLibrary\";\n})(SemanticTokenModifiers || (SemanticTokenModifiers = {}));\n/**\n * @since 3.16.0\n */\nvar SemanticTokens;\n(function (SemanticTokens) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && (candidate.resultId === undefined || typeof candidate.resultId === 'string') &&\n            Array.isArray(candidate.data) && (candidate.data.length === 0 || typeof candidate.data[0] === 'number');\n    }\n    SemanticTokens.is = is;\n})(SemanticTokens || (SemanticTokens = {}));\n/**\n * The InlineValueText namespace provides functions to deal with InlineValueTexts.\n *\n * @since 3.17.0\n */\nvar InlineValueText;\n(function (InlineValueText) {\n    /**\n     * Creates a new InlineValueText literal.\n     */\n    function create(range, text) {\n        return { range, text };\n    }\n    InlineValueText.create = create;\n    function is(value) {\n        const candidate = value;\n        return candidate !== undefined && candidate !== null && Range.is(candidate.range) && Is.string(candidate.text);\n    }\n    InlineValueText.is = is;\n})(InlineValueText || (InlineValueText = {}));\n/**\n * The InlineValueVariableLookup namespace provides functions to deal with InlineValueVariableLookups.\n *\n * @since 3.17.0\n */\nvar InlineValueVariableLookup;\n(function (InlineValueVariableLookup) {\n    /**\n     * Creates a new InlineValueText literal.\n     */\n    function create(range, variableName, caseSensitiveLookup) {\n        return { range, variableName, caseSensitiveLookup };\n    }\n    InlineValueVariableLookup.create = create;\n    function is(value) {\n        const candidate = value;\n        return candidate !== undefined && candidate !== null && Range.is(candidate.range) && Is.boolean(candidate.caseSensitiveLookup)\n            && (Is.string(candidate.variableName) || candidate.variableName === undefined);\n    }\n    InlineValueVariableLookup.is = is;\n})(InlineValueVariableLookup || (InlineValueVariableLookup = {}));\n/**\n * The InlineValueEvaluatableExpression namespace provides functions to deal with InlineValueEvaluatableExpression.\n *\n * @since 3.17.0\n */\nvar InlineValueEvaluatableExpression;\n(function (InlineValueEvaluatableExpression) {\n    /**\n     * Creates a new InlineValueEvaluatableExpression literal.\n     */\n    function create(range, expression) {\n        return { range, expression };\n    }\n    InlineValueEvaluatableExpression.create = create;\n    function is(value) {\n        const candidate = value;\n        return candidate !== undefined && candidate !== null && Range.is(candidate.range)\n            && (Is.string(candidate.expression) || candidate.expression === undefined);\n    }\n    InlineValueEvaluatableExpression.is = is;\n})(InlineValueEvaluatableExpression || (InlineValueEvaluatableExpression = {}));\n/**\n * The InlineValueContext namespace provides helper functions to work with\n * {@link InlineValueContext} literals.\n *\n * @since 3.17.0\n */\nvar InlineValueContext;\n(function (InlineValueContext) {\n    /**\n     * Creates a new InlineValueContext literal.\n     */\n    function create(frameId, stoppedLocation) {\n        return { frameId, stoppedLocation };\n    }\n    InlineValueContext.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link InlineValueContext} interface.\n     */\n    function is(value) {\n        const candidate = value;\n        return Is.defined(candidate) && Range.is(value.stoppedLocation);\n    }\n    InlineValueContext.is = is;\n})(InlineValueContext || (InlineValueContext = {}));\n/**\n * Inlay hint kinds.\n *\n * @since 3.17.0\n */\nvar InlayHintKind;\n(function (InlayHintKind) {\n    /**\n     * An inlay hint that for a type annotation.\n     */\n    InlayHintKind.Type = 1;\n    /**\n     * An inlay hint that is for a parameter.\n     */\n    InlayHintKind.Parameter = 2;\n    function is(value) {\n        return value === 1 || value === 2;\n    }\n    InlayHintKind.is = is;\n})(InlayHintKind || (InlayHintKind = {}));\nvar InlayHintLabelPart;\n(function (InlayHintLabelPart) {\n    function create(value) {\n        return { value };\n    }\n    InlayHintLabelPart.create = create;\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate)\n            && (candidate.tooltip === undefined || Is.string(candidate.tooltip) || MarkupContent.is(candidate.tooltip))\n            && (candidate.location === undefined || Location.is(candidate.location))\n            && (candidate.command === undefined || Command.is(candidate.command));\n    }\n    InlayHintLabelPart.is = is;\n})(InlayHintLabelPart || (InlayHintLabelPart = {}));\nvar InlayHint;\n(function (InlayHint) {\n    function create(position, label, kind) {\n        const result = { position, label };\n        if (kind !== undefined) {\n            result.kind = kind;\n        }\n        return result;\n    }\n    InlayHint.create = create;\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && Position.is(candidate.position)\n            && (Is.string(candidate.label) || Is.typedArray(candidate.label, InlayHintLabelPart.is))\n            && (candidate.kind === undefined || InlayHintKind.is(candidate.kind))\n            && (candidate.textEdits === undefined) || Is.typedArray(candidate.textEdits, TextEdit.is)\n            && (candidate.tooltip === undefined || Is.string(candidate.tooltip) || MarkupContent.is(candidate.tooltip))\n            && (candidate.paddingLeft === undefined || Is.boolean(candidate.paddingLeft))\n            && (candidate.paddingRight === undefined || Is.boolean(candidate.paddingRight));\n    }\n    InlayHint.is = is;\n})(InlayHint || (InlayHint = {}));\nvar StringValue;\n(function (StringValue) {\n    function createSnippet(value) {\n        return { kind: 'snippet', value };\n    }\n    StringValue.createSnippet = createSnippet;\n})(StringValue || (StringValue = {}));\nvar InlineCompletionItem;\n(function (InlineCompletionItem) {\n    function create(insertText, filterText, range, command) {\n        return { insertText, filterText, range, command };\n    }\n    InlineCompletionItem.create = create;\n})(InlineCompletionItem || (InlineCompletionItem = {}));\nvar InlineCompletionList;\n(function (InlineCompletionList) {\n    function create(items) {\n        return { items };\n    }\n    InlineCompletionList.create = create;\n})(InlineCompletionList || (InlineCompletionList = {}));\n/**\n * Describes how an {@link InlineCompletionItemProvider inline completion provider} was triggered.\n *\n * @since 3.18.0\n * @proposed\n */\nvar InlineCompletionTriggerKind;\n(function (InlineCompletionTriggerKind) {\n    /**\n     * Completion was triggered explicitly by a user gesture.\n     */\n    InlineCompletionTriggerKind.Invoked = 0;\n    /**\n     * Completion was triggered automatically while editing.\n     */\n    InlineCompletionTriggerKind.Automatic = 1;\n})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));\nvar SelectedCompletionInfo;\n(function (SelectedCompletionInfo) {\n    function create(range, text) {\n        return { range, text };\n    }\n    SelectedCompletionInfo.create = create;\n})(SelectedCompletionInfo || (SelectedCompletionInfo = {}));\nvar InlineCompletionContext;\n(function (InlineCompletionContext) {\n    function create(triggerKind, selectedCompletionInfo) {\n        return { triggerKind, selectedCompletionInfo };\n    }\n    InlineCompletionContext.create = create;\n})(InlineCompletionContext || (InlineCompletionContext = {}));\nvar WorkspaceFolder;\n(function (WorkspaceFolder) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && URI.is(candidate.uri) && Is.string(candidate.name);\n    }\n    WorkspaceFolder.is = is;\n})(WorkspaceFolder || (WorkspaceFolder = {}));\n/**\n * @deprecated Use the text document from the new vscode-languageserver-textdocument package.\n */\nvar TextDocument;\n(function (TextDocument) {\n    /**\n     * Creates a new ITextDocument literal from the given uri and content.\n     * @param uri The document's uri.\n     * @param languageId The document's language Id.\n     * @param version The document's version.\n     * @param content The document's content.\n     */\n    function create(uri, languageId, version, content) {\n        return new FullTextDocument(uri, languageId, version, content);\n    }\n    TextDocument.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link ITextDocument} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri) && (Is.undefined(candidate.languageId) || Is.string(candidate.languageId)) && Is.uinteger(candidate.lineCount)\n            && Is.func(candidate.getText) && Is.func(candidate.positionAt) && Is.func(candidate.offsetAt) ? true : false;\n    }\n    TextDocument.is = is;\n    function applyEdits(document, edits) {\n        let text = document.getText();\n        let sortedEdits = mergeSort(edits, (a, b) => {\n            let diff = a.range.start.line - b.range.start.line;\n            if (diff === 0) {\n                return a.range.start.character - b.range.start.character;\n            }\n            return diff;\n        });\n        let lastModifiedOffset = text.length;\n        for (let i = sortedEdits.length - 1; i >= 0; i--) {\n            let e = sortedEdits[i];\n            let startOffset = document.offsetAt(e.range.start);\n            let endOffset = document.offsetAt(e.range.end);\n            if (endOffset <= lastModifiedOffset) {\n                text = text.substring(0, startOffset) + e.newText + text.substring(endOffset, text.length);\n            }\n            else {\n                throw new Error('Overlapping edit');\n            }\n            lastModifiedOffset = startOffset;\n        }\n        return text;\n    }\n    TextDocument.applyEdits = applyEdits;\n    function mergeSort(data, compare) {\n        if (data.length <= 1) {\n            // sorted\n            return data;\n        }\n        const p = (data.length / 2) | 0;\n        const left = data.slice(0, p);\n        const right = data.slice(p);\n        mergeSort(left, compare);\n        mergeSort(right, compare);\n        let leftIdx = 0;\n        let rightIdx = 0;\n        let i = 0;\n        while (leftIdx < left.length && rightIdx < right.length) {\n            let ret = compare(left[leftIdx], right[rightIdx]);\n            if (ret <= 0) {\n                // smaller_equal -> take left to preserve order\n                data[i++] = left[leftIdx++];\n            }\n            else {\n                // greater -> take right\n                data[i++] = right[rightIdx++];\n            }\n        }\n        while (leftIdx < left.length) {\n            data[i++] = left[leftIdx++];\n        }\n        while (rightIdx < right.length) {\n            data[i++] = right[rightIdx++];\n        }\n        return data;\n    }\n})(TextDocument || (TextDocument = {}));\n/**\n * @deprecated Use the text document from the new vscode-languageserver-textdocument package.\n */\nclass FullTextDocument {\n    constructor(uri, languageId, version, content) {\n        this._uri = uri;\n        this._languageId = languageId;\n        this._version = version;\n        this._content = content;\n        this._lineOffsets = undefined;\n    }\n    get uri() {\n        return this._uri;\n    }\n    get languageId() {\n        return this._languageId;\n    }\n    get version() {\n        return this._version;\n    }\n    getText(range) {\n        if (range) {\n            let start = this.offsetAt(range.start);\n            let end = this.offsetAt(range.end);\n            return this._content.substring(start, end);\n        }\n        return this._content;\n    }\n    update(event, version) {\n        this._content = event.text;\n        this._version = version;\n        this._lineOffsets = undefined;\n    }\n    getLineOffsets() {\n        if (this._lineOffsets === undefined) {\n            let lineOffsets = [];\n            let text = this._content;\n            let isLineStart = true;\n            for (let i = 0; i < text.length; i++) {\n                if (isLineStart) {\n                    lineOffsets.push(i);\n                    isLineStart = false;\n                }\n                let ch = text.charAt(i);\n                isLineStart = (ch === '\\r' || ch === '\\n');\n                if (ch === '\\r' && i + 1 < text.length && text.charAt(i + 1) === '\\n') {\n                    i++;\n                }\n            }\n            if (isLineStart && text.length > 0) {\n                lineOffsets.push(text.length);\n            }\n            this._lineOffsets = lineOffsets;\n        }\n        return this._lineOffsets;\n    }\n    positionAt(offset) {\n        offset = Math.max(Math.min(offset, this._content.length), 0);\n        let lineOffsets = this.getLineOffsets();\n        let low = 0, high = lineOffsets.length;\n        if (high === 0) {\n            return Position.create(0, offset);\n        }\n        while (low < high) {\n            let mid = Math.floor((low + high) / 2);\n            if (lineOffsets[mid] > offset) {\n                high = mid;\n            }\n            else {\n                low = mid + 1;\n            }\n        }\n        // low is the least x for which the line offset is larger than the current offset\n        // or array.length if no line offset is larger than the current offset\n        let line = low - 1;\n        return Position.create(line, offset - lineOffsets[line]);\n    }\n    offsetAt(position) {\n        let lineOffsets = this.getLineOffsets();\n        if (position.line >= lineOffsets.length) {\n            return this._content.length;\n        }\n        else if (position.line < 0) {\n            return 0;\n        }\n        let lineOffset = lineOffsets[position.line];\n        let nextLineOffset = (position.line + 1 < lineOffsets.length) ? lineOffsets[position.line + 1] : this._content.length;\n        return Math.max(Math.min(lineOffset + position.character, nextLineOffset), lineOffset);\n    }\n    get lineCount() {\n        return this.getLineOffsets().length;\n    }\n}\nvar Is;\n(function (Is) {\n    const toString = Object.prototype.toString;\n    function defined(value) {\n        return typeof value !== 'undefined';\n    }\n    Is.defined = defined;\n    function undefined$1(value) {\n        return typeof value === 'undefined';\n    }\n    Is.undefined = undefined$1;\n    function boolean(value) {\n        return value === true || value === false;\n    }\n    Is.boolean = boolean;\n    function string(value) {\n        return toString.call(value) === '[object String]';\n    }\n    Is.string = string;\n    function number(value) {\n        return toString.call(value) === '[object Number]';\n    }\n    Is.number = number;\n    function numberRange(value, min, max) {\n        return toString.call(value) === '[object Number]' && min <= value && value <= max;\n    }\n    Is.numberRange = numberRange;\n    function integer(value) {\n        return toString.call(value) === '[object Number]' && -2147483648 <= value && value <= 2147483647;\n    }\n    Is.integer = integer;\n    function uinteger(value) {\n        return toString.call(value) === '[object Number]' && 0 <= value && value <= 2147483647;\n    }\n    Is.uinteger = uinteger;\n    function func(value) {\n        return toString.call(value) === '[object Function]';\n    }\n    Is.func = func;\n    function objectLiteral(value) {\n        // Strictly speaking class instances pass this check as well. Since the LSP\n        // doesn't use classes we ignore this for now. If we do we need to add something\n        // like this: `Object.getPrototypeOf(Object.getPrototypeOf(x)) === null`\n        return value !== null && typeof value === 'object';\n    }\n    Is.objectLiteral = objectLiteral;\n    function typedArray(value, check) {\n        return Array.isArray(value) && value.every(check);\n    }\n    Is.typedArray = typedArray;\n})(Is || (Is = {}));\n\nexport { AnnotatedTextEdit, ChangeAnnotation, ChangeAnnotationIdentifier, CodeAction, CodeActionContext, CodeActionKind, CodeActionTriggerKind, CodeDescription, CodeLens, Color, ColorInformation, ColorPresentation, Command, CompletionItem, CompletionItemKind, CompletionItemLabelDetails, CompletionItemTag, CompletionList, CreateFile, DeleteFile, Diagnostic, DiagnosticRelatedInformation, DiagnosticSeverity, DiagnosticTag, DocumentHighlight, DocumentHighlightKind, DocumentLink, DocumentSymbol, DocumentUri, FoldingRange, FoldingRangeKind, FormattingOptions, Hover, InlayHint, InlayHintKind, InlayHintLabelPart, InlineCompletionContext, InlineCompletionItem, InlineCompletionList, InlineCompletionTriggerKind, InlineValueContext, InlineValueEvaluatableExpression, InlineValueText, InlineValueVariableLookup, InsertReplaceEdit, InsertTextFormat, InsertTextMode, Location, LocationLink, MarkedString, MarkupContent, MarkupKind, OptionalVersionedTextDocumentIdentifier, ParameterInformation, Position, Range, RenameFile, SelectedCompletionInfo, SelectionRange, SemanticTokenModifiers, SemanticTokenTypes, SemanticTokens, SignatureInformation, StringValue, SymbolInformation, SymbolKind, SymbolTag, TextDocument, TextDocumentEdit, TextDocumentIdentifier, TextDocumentItem, TextEdit, URI, VersionedTextDocumentIdentifier, WorkspaceEdit, WorkspaceFolder, WorkspaceSymbol, integer, uinteger };\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 * ------------------------------------------------------------------------------------------ */\nclass FullTextDocument {\n    constructor(uri, languageId, version, content) {\n        this._uri = uri;\n        this._languageId = languageId;\n        this._version = version;\n        this._content = content;\n        this._lineOffsets = undefined;\n    }\n    get uri() {\n        return this._uri;\n    }\n    get languageId() {\n        return this._languageId;\n    }\n    get version() {\n        return this._version;\n    }\n    getText(range) {\n        if (range) {\n            const start = this.offsetAt(range.start);\n            const end = this.offsetAt(range.end);\n            return this._content.substring(start, end);\n        }\n        return this._content;\n    }\n    update(changes, version) {\n        for (let change of changes) {\n            if (FullTextDocument.isIncremental(change)) {\n                // makes sure start is before end\n                const range = getWellformedRange(change.range);\n                // update content\n                const startOffset = this.offsetAt(range.start);\n                const endOffset = this.offsetAt(range.end);\n                this._content = this._content.substring(0, startOffset) + change.text + this._content.substring(endOffset, this._content.length);\n                // update the offsets\n                const startLine = Math.max(range.start.line, 0);\n                const endLine = Math.max(range.end.line, 0);\n                let lineOffsets = this._lineOffsets;\n                const addedLineOffsets = computeLineOffsets(change.text, false, startOffset);\n                if (endLine - startLine === addedLineOffsets.length) {\n                    for (let i = 0, len = addedLineOffsets.length; i < len; i++) {\n                        lineOffsets[i + startLine + 1] = addedLineOffsets[i];\n                    }\n                }\n                else {\n                    if (addedLineOffsets.length < 10000) {\n                        lineOffsets.splice(startLine + 1, endLine - startLine, ...addedLineOffsets);\n                    }\n                    else { // avoid too many arguments for splice\n                        this._lineOffsets = lineOffsets = lineOffsets.slice(0, startLine + 1).concat(addedLineOffsets, lineOffsets.slice(endLine + 1));\n                    }\n                }\n                const diff = change.text.length - (endOffset - startOffset);\n                if (diff !== 0) {\n                    for (let i = startLine + 1 + addedLineOffsets.length, len = lineOffsets.length; i < len; i++) {\n                        lineOffsets[i] = lineOffsets[i] + diff;\n                    }\n                }\n            }\n            else if (FullTextDocument.isFull(change)) {\n                this._content = change.text;\n                this._lineOffsets = undefined;\n            }\n            else {\n                throw new Error('Unknown change event received');\n            }\n        }\n        this._version = version;\n    }\n    getLineOffsets() {\n        if (this._lineOffsets === undefined) {\n            this._lineOffsets = computeLineOffsets(this._content, true);\n        }\n        return this._lineOffsets;\n    }\n    positionAt(offset) {\n        offset = Math.max(Math.min(offset, this._content.length), 0);\n        let lineOffsets = this.getLineOffsets();\n        let low = 0, high = lineOffsets.length;\n        if (high === 0) {\n            return { line: 0, character: offset };\n        }\n        while (low < high) {\n            let mid = Math.floor((low + high) / 2);\n            if (lineOffsets[mid] > offset) {\n                high = mid;\n            }\n            else {\n                low = mid + 1;\n            }\n        }\n        // low is the least x for which the line offset is larger than the current offset\n        // or array.length if no line offset is larger than the current offset\n        let line = low - 1;\n        return { line, character: offset - lineOffsets[line] };\n    }\n    offsetAt(position) {\n        let lineOffsets = this.getLineOffsets();\n        if (position.line >= lineOffsets.length) {\n            return this._content.length;\n        }\n        else if (position.line < 0) {\n            return 0;\n        }\n        let lineOffset = lineOffsets[position.line];\n        let nextLineOffset = (position.line + 1 < lineOffsets.length) ? lineOffsets[position.line + 1] : this._content.length;\n        return Math.max(Math.min(lineOffset + position.character, nextLineOffset), lineOffset);\n    }\n    get lineCount() {\n        return this.getLineOffsets().length;\n    }\n    static isIncremental(event) {\n        let candidate = event;\n        return candidate !== undefined && candidate !== null &&\n            typeof candidate.text === 'string' && candidate.range !== undefined &&\n            (candidate.rangeLength === undefined || typeof candidate.rangeLength === 'number');\n    }\n    static isFull(event) {\n        let candidate = event;\n        return candidate !== undefined && candidate !== null &&\n            typeof candidate.text === 'string' && candidate.range === undefined && candidate.rangeLength === undefined;\n    }\n}\nvar TextDocument;\n(function (TextDocument) {\n    /**\n     * Creates a new text document.\n     *\n     * @param uri The document's uri.\n     * @param languageId  The document's language Id.\n     * @param version The document's initial version number.\n     * @param content The document's content.\n     */\n    function create(uri, languageId, version, content) {\n        return new FullTextDocument(uri, languageId, version, content);\n    }\n    TextDocument.create = create;\n    /**\n     * Updates a TextDocument by modifying its content.\n     *\n     * @param document the document to update. Only documents created by TextDocument.create are valid inputs.\n     * @param changes the changes to apply to the document.\n     * @param version the changes version for the document.\n     * @returns The updated TextDocument. Note: That's the same document instance passed in as first parameter.\n     *\n     */\n    function update(document, changes, version) {\n        if (document instanceof FullTextDocument) {\n            document.update(changes, version);\n            return document;\n        }\n        else {\n            throw new Error('TextDocument.update: document must be created by TextDocument.create');\n        }\n    }\n    TextDocument.update = update;\n    function applyEdits(document, edits) {\n        let text = document.getText();\n        let sortedEdits = mergeSort(edits.map(getWellformedEdit), (a, b) => {\n            let diff = a.range.start.line - b.range.start.line;\n            if (diff === 0) {\n                return a.range.start.character - b.range.start.character;\n            }\n            return diff;\n        });\n        let lastModifiedOffset = 0;\n        const spans = [];\n        for (const e of sortedEdits) {\n            let startOffset = document.offsetAt(e.range.start);\n            if (startOffset < lastModifiedOffset) {\n                throw new Error('Overlapping edit');\n            }\n            else if (startOffset > lastModifiedOffset) {\n                spans.push(text.substring(lastModifiedOffset, startOffset));\n            }\n            if (e.newText.length) {\n                spans.push(e.newText);\n            }\n            lastModifiedOffset = document.offsetAt(e.range.end);\n        }\n        spans.push(text.substr(lastModifiedOffset));\n        return spans.join('');\n    }\n    TextDocument.applyEdits = applyEdits;\n})(TextDocument || (TextDocument = {}));\nfunction mergeSort(data, compare) {\n    if (data.length <= 1) {\n        // sorted\n        return data;\n    }\n    const p = (data.length / 2) | 0;\n    const left = data.slice(0, p);\n    const right = data.slice(p);\n    mergeSort(left, compare);\n    mergeSort(right, compare);\n    let leftIdx = 0;\n    let rightIdx = 0;\n    let i = 0;\n    while (leftIdx < left.length && rightIdx < right.length) {\n        let ret = compare(left[leftIdx], right[rightIdx]);\n        if (ret <= 0) {\n            // smaller_equal -> take left to preserve order\n            data[i++] = left[leftIdx++];\n        }\n        else {\n            // greater -> take right\n            data[i++] = right[rightIdx++];\n        }\n    }\n    while (leftIdx < left.length) {\n        data[i++] = left[leftIdx++];\n    }\n    while (rightIdx < right.length) {\n        data[i++] = right[rightIdx++];\n    }\n    return data;\n}\nfunction computeLineOffsets(text, isAtLineStart, textOffset = 0) {\n    const result = isAtLineStart ? [textOffset] : [];\n    for (let i = 0; i < text.length; i++) {\n        let ch = text.charCodeAt(i);\n        if (ch === 13 /* CharCode.CarriageReturn */ || ch === 10 /* CharCode.LineFeed */) {\n            if (ch === 13 /* CharCode.CarriageReturn */ && i + 1 < text.length && text.charCodeAt(i + 1) === 10 /* CharCode.LineFeed */) {\n                i++;\n            }\n            result.push(textOffset + i + 1);\n        }\n    }\n    return result;\n}\nfunction getWellformedRange(range) {\n    const start = range.start;\n    const end = range.end;\n    if (start.line > end.line || (start.line === end.line && start.character > end.character)) {\n        return { start: end, end: start };\n    }\n    return range;\n}\nfunction getWellformedEdit(textEdit) {\n    const range = getWellformedRange(textEdit.range);\n    if (range !== textEdit.range) {\n        return { newText: textEdit.newText, range };\n    }\n    return textEdit;\n}\n\nexport { TextDocument };\n","import { MarkupKind } from '../../../vscode-languageserver-types/lib/esm/main.js';\nexport { CodeAction, CodeActionContext, CodeActionKind, Color, ColorInformation, ColorPresentation, Command, CompletionItem, CompletionItemKind, CompletionItemTag, CompletionList, Diagnostic, DiagnosticSeverity, DocumentHighlight, DocumentHighlightKind, DocumentLink, DocumentSymbol, DocumentUri, FoldingRange, FoldingRangeKind, Hover, InsertTextFormat, Location, MarkedString, MarkupContent, Position, Range, SelectionRange, SymbolInformation, SymbolKind, TextDocumentEdit, TextEdit, VersionedTextDocumentIdentifier, WorkspaceEdit } from '../../../vscode-languageserver-types/lib/esm/main.js';\nexport { TextDocument } from '../../../vscode-languageserver-textdocument/lib/esm/main.js';\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 * Error codes used by diagnostics\n */\nvar ErrorCode;\n(function (ErrorCode) {\n    ErrorCode[ErrorCode[\"Undefined\"] = 0] = \"Undefined\";\n    ErrorCode[ErrorCode[\"EnumValueMismatch\"] = 1] = \"EnumValueMismatch\";\n    ErrorCode[ErrorCode[\"Deprecated\"] = 2] = \"Deprecated\";\n    ErrorCode[ErrorCode[\"UnexpectedEndOfComment\"] = 257] = \"UnexpectedEndOfComment\";\n    ErrorCode[ErrorCode[\"UnexpectedEndOfString\"] = 258] = \"UnexpectedEndOfString\";\n    ErrorCode[ErrorCode[\"UnexpectedEndOfNumber\"] = 259] = \"UnexpectedEndOfNumber\";\n    ErrorCode[ErrorCode[\"InvalidUnicode\"] = 260] = \"InvalidUnicode\";\n    ErrorCode[ErrorCode[\"InvalidEscapeCharacter\"] = 261] = \"InvalidEscapeCharacter\";\n    ErrorCode[ErrorCode[\"InvalidCharacter\"] = 262] = \"InvalidCharacter\";\n    ErrorCode[ErrorCode[\"PropertyExpected\"] = 513] = \"PropertyExpected\";\n    ErrorCode[ErrorCode[\"CommaExpected\"] = 514] = \"CommaExpected\";\n    ErrorCode[ErrorCode[\"ColonExpected\"] = 515] = \"ColonExpected\";\n    ErrorCode[ErrorCode[\"ValueExpected\"] = 516] = \"ValueExpected\";\n    ErrorCode[ErrorCode[\"CommaOrCloseBacketExpected\"] = 517] = \"CommaOrCloseBacketExpected\";\n    ErrorCode[ErrorCode[\"CommaOrCloseBraceExpected\"] = 518] = \"CommaOrCloseBraceExpected\";\n    ErrorCode[ErrorCode[\"TrailingComma\"] = 519] = \"TrailingComma\";\n    ErrorCode[ErrorCode[\"DuplicateKey\"] = 520] = \"DuplicateKey\";\n    ErrorCode[ErrorCode[\"CommentNotPermitted\"] = 521] = \"CommentNotPermitted\";\n    ErrorCode[ErrorCode[\"PropertyKeysMustBeDoublequoted\"] = 528] = \"PropertyKeysMustBeDoublequoted\";\n    ErrorCode[ErrorCode[\"SchemaResolveError\"] = 768] = \"SchemaResolveError\";\n    ErrorCode[ErrorCode[\"SchemaUnsupportedFeature\"] = 769] = \"SchemaUnsupportedFeature\";\n})(ErrorCode || (ErrorCode = {}));\nvar SchemaDraft;\n(function (SchemaDraft) {\n    SchemaDraft[SchemaDraft[\"v3\"] = 3] = \"v3\";\n    SchemaDraft[SchemaDraft[\"v4\"] = 4] = \"v4\";\n    SchemaDraft[SchemaDraft[\"v6\"] = 6] = \"v6\";\n    SchemaDraft[SchemaDraft[\"v7\"] = 7] = \"v7\";\n    SchemaDraft[SchemaDraft[\"v2019_09\"] = 19] = \"v2019_09\";\n    SchemaDraft[SchemaDraft[\"v2020_12\"] = 20] = \"v2020_12\";\n})(SchemaDraft || (SchemaDraft = {}));\nvar ClientCapabilities;\n(function (ClientCapabilities) {\n    ClientCapabilities.LATEST = {\n        textDocument: {\n            completion: {\n                completionItem: {\n                    documentationFormat: [MarkupKind.Markdown, MarkupKind.PlainText],\n                    commitCharactersSupport: true,\n                    labelDetailsSupport: true\n                }\n            }\n        }\n    };\n})(ClientCapabilities || (ClientCapabilities = {}));\n\nexport { ClientCapabilities, ErrorCode, MarkupKind, SchemaDraft };\n","// src/browser/reader.ts\nfunction t(...args) {\n  const firstArg = args[0];\n  let key;\n  let message;\n  let formatArgs;\n  if (typeof firstArg === \"string\") {\n    key = firstArg;\n    message = firstArg;\n    args.splice(0, 1);\n    formatArgs = !args || typeof args[0] !== \"object\" ? args : args[0];\n  } else if (firstArg instanceof Array) {\n    const replacements = args.slice(1);\n    if (firstArg.length !== replacements.length + 1) {\n      throw new Error(\"expected a string as the first argument to l10n.t\");\n    }\n    let str = firstArg[0];\n    for (let i = 1; i < firstArg.length; i++) {\n      str += `{${i - 1}}` + firstArg[i];\n    }\n    return t(str, ...replacements);\n  } else {\n    message = firstArg.message;\n    key = message;\n    if (firstArg.comment && firstArg.comment.length > 0) {\n      key += `/${Array.isArray(firstArg.comment) ? firstArg.comment.join(\"\") : firstArg.comment}`;\n    }\n    formatArgs = firstArg.args ?? {};\n  }\n  {\n    return format(message, formatArgs);\n  }\n}\nvar _format2Regexp = /{([^}]+)}/g;\nfunction format(template, values) {\n  if (Object.keys(values).length === 0) {\n    return template;\n  }\n  return template.replace(_format2Regexp, (match, group) => values[group] ?? match);\n}\n\nexport { t };\n","import { createScanner, getNodePath as getNodePath$1, getNodeValue as getNodeValue$1, findNodeAtOffset } from '../../../../jsonc-parser/lib/esm/main.js';\nimport { isBoolean, equals, isDefined, isNumber, isString, isObject } from '../utils/objects.js';\nimport { stringLength, extendedRegExp } from '../utils/strings.js';\nimport { SchemaDraft, ErrorCode } from '../jsonLanguageTypes.js';\nimport { t } from '../../../../@vscode/l10n/dist/browser.js';\nimport { DiagnosticSeverity, Range, Diagnostic } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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 *--------------------------------------------------------------------------------------------*/\nconst formats = {\n    'color-hex': { errorMessage: t('Invalid color format. Use #RGB, #RGBA, #RRGGBB or #RRGGBBAA.'), pattern: /^#([0-9A-Fa-f]{3,4}|([0-9A-Fa-f]{2}){3,4})$/ },\n    'date-time': { errorMessage: t('String is not a RFC3339 date-time.'), pattern: /^(\\d{4})-(0[1-9]|1[0-2])-(0[1-9]|[12][0-9]|3[01])T([01][0-9]|2[0-3]):([0-5][0-9]):([0-5][0-9]|60)(\\.[0-9]+)?(Z|(\\+|-)([01][0-9]|2[0-3]):([0-5][0-9]))$/i },\n    'date': { errorMessage: t('String is not a RFC3339 date.'), pattern: /^(\\d{4})-(0[1-9]|1[0-2])-(0[1-9]|[12][0-9]|3[01])$/i },\n    'time': { errorMessage: t('String is not a RFC3339 time.'), pattern: /^([01][0-9]|2[0-3]):([0-5][0-9]):([0-5][0-9]|60)(\\.[0-9]+)?(Z|(\\+|-)([01][0-9]|2[0-3]):([0-5][0-9]))$/i },\n    'email': { errorMessage: t('String is not an e-mail address.'), pattern: /^(([^<>()\\[\\]\\\\.,;:\\s@\"]+(\\.[^<>()\\[\\]\\\\.,;:\\s@\"]+)*)|(\".+\"))@((\\[[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}])|(([a-zA-Z0-9-]+\\.)+[a-zA-Z]{2,}))$/ },\n    'hostname': { errorMessage: t('String is not a hostname.'), pattern: /^(?=.{1,253}\\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\\.?$/i },\n    'ipv4': { errorMessage: t('String is not an IPv4 address.'), pattern: /^(?:(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)\\.){3}(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)$/ },\n    'ipv6': { errorMessage: t('String is not an IPv6 address.'), pattern: /^((([0-9a-f]{1,4}:){7}([0-9a-f]{1,4}|:))|(([0-9a-f]{1,4}:){6}(:[0-9a-f]{1,4}|((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3})|:))|(([0-9a-f]{1,4}:){5}(((:[0-9a-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3})|:))|(([0-9a-f]{1,4}:){4}(((:[0-9a-f]{1,4}){1,3})|((:[0-9a-f]{1,4})?:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:))|(([0-9a-f]{1,4}:){3}(((:[0-9a-f]{1,4}){1,4})|((:[0-9a-f]{1,4}){0,2}:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:))|(([0-9a-f]{1,4}:){2}(((:[0-9a-f]{1,4}){1,5})|((:[0-9a-f]{1,4}){0,3}:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:))|(([0-9a-f]{1,4}:){1}(((:[0-9a-f]{1,4}){1,6})|((:[0-9a-f]{1,4}){0,4}:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:))|(:(((:[0-9a-f]{1,4}){1,7})|((:[0-9a-f]{1,4}){0,5}:((25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)(\\.(25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]?\\d)){3}))|:)))$/i },\n};\nclass ASTNodeImpl {\n    constructor(parent, offset, length = 0) {\n        this.offset = offset;\n        this.length = length;\n        this.parent = parent;\n    }\n    get children() {\n        return [];\n    }\n    toString() {\n        return 'type: ' + this.type + ' (' + this.offset + '/' + this.length + ')' + (this.parent ? ' parent: {' + this.parent.toString() + '}' : '');\n    }\n}\nclass NullASTNodeImpl extends ASTNodeImpl {\n    constructor(parent, offset) {\n        super(parent, offset);\n        this.type = 'null';\n        this.value = null;\n    }\n}\nclass BooleanASTNodeImpl extends ASTNodeImpl {\n    constructor(parent, boolValue, offset) {\n        super(parent, offset);\n        this.type = 'boolean';\n        this.value = boolValue;\n    }\n}\nclass ArrayASTNodeImpl extends ASTNodeImpl {\n    constructor(parent, offset) {\n        super(parent, offset);\n        this.type = 'array';\n        this.items = [];\n    }\n    get children() {\n        return this.items;\n    }\n}\nclass NumberASTNodeImpl extends ASTNodeImpl {\n    constructor(parent, offset) {\n        super(parent, offset);\n        this.type = 'number';\n        this.isInteger = true;\n        this.value = Number.NaN;\n    }\n}\nclass StringASTNodeImpl extends ASTNodeImpl {\n    constructor(parent, offset, length) {\n        super(parent, offset, length);\n        this.type = 'string';\n        this.value = '';\n    }\n}\nclass PropertyASTNodeImpl extends ASTNodeImpl {\n    constructor(parent, offset, keyNode) {\n        super(parent, offset);\n        this.type = 'property';\n        this.colonOffset = -1;\n        this.keyNode = keyNode;\n    }\n    get children() {\n        return this.valueNode ? [this.keyNode, this.valueNode] : [this.keyNode];\n    }\n}\nclass ObjectASTNodeImpl extends ASTNodeImpl {\n    constructor(parent, offset) {\n        super(parent, offset);\n        this.type = 'object';\n        this.properties = [];\n    }\n    get children() {\n        return this.properties;\n    }\n}\nfunction asSchema(schema) {\n    if (isBoolean(schema)) {\n        return schema ? {} : { \"not\": {} };\n    }\n    return schema;\n}\nvar EnumMatch;\n(function (EnumMatch) {\n    EnumMatch[EnumMatch[\"Key\"] = 0] = \"Key\";\n    EnumMatch[EnumMatch[\"Enum\"] = 1] = \"Enum\";\n})(EnumMatch || (EnumMatch = {}));\nconst schemaDraftFromId = {\n    'http://json-schema.org/draft-03/schema#': SchemaDraft.v3,\n    'http://json-schema.org/draft-04/schema#': SchemaDraft.v4,\n    'http://json-schema.org/draft-06/schema#': SchemaDraft.v6,\n    'http://json-schema.org/draft-07/schema#': SchemaDraft.v7,\n    'https://json-schema.org/draft/2019-09/schema': SchemaDraft.v2019_09,\n    'https://json-schema.org/draft/2020-12/schema': SchemaDraft.v2020_12\n};\nclass EvaluationContext {\n    constructor(schemaDraft) {\n        this.schemaDraft = schemaDraft;\n    }\n}\nclass SchemaCollector {\n    constructor(focusOffset = -1, exclude) {\n        this.focusOffset = focusOffset;\n        this.exclude = exclude;\n        this.schemas = [];\n    }\n    add(schema) {\n        this.schemas.push(schema);\n    }\n    merge(other) {\n        Array.prototype.push.apply(this.schemas, other.schemas);\n    }\n    include(node) {\n        return (this.focusOffset === -1 || contains(node, this.focusOffset)) && (node !== this.exclude);\n    }\n    newSub() {\n        return new SchemaCollector(-1, this.exclude);\n    }\n}\nclass NoOpSchemaCollector {\n    constructor() { }\n    get schemas() { return []; }\n    add(_schema) { }\n    merge(_other) { }\n    include(_node) { return true; }\n    newSub() { return this; }\n}\nNoOpSchemaCollector.instance = new NoOpSchemaCollector();\nclass ValidationResult {\n    constructor() {\n        this.problems = [];\n        this.propertiesMatches = 0;\n        this.processedProperties = new Set();\n        this.propertiesValueMatches = 0;\n        this.primaryValueMatches = 0;\n        this.enumValueMatch = false;\n        this.enumValues = undefined;\n    }\n    hasProblems() {\n        return !!this.problems.length;\n    }\n    merge(validationResult) {\n        this.problems = this.problems.concat(validationResult.problems);\n        this.propertiesMatches += validationResult.propertiesMatches;\n        this.propertiesValueMatches += validationResult.propertiesValueMatches;\n        this.mergeProcessedProperties(validationResult);\n    }\n    mergeEnumValues(validationResult) {\n        if (!this.enumValueMatch && !validationResult.enumValueMatch && this.enumValues && validationResult.enumValues) {\n            this.enumValues = this.enumValues.concat(validationResult.enumValues);\n            for (const error of this.problems) {\n                if (error.code === ErrorCode.EnumValueMismatch) {\n                    error.message = t('Value is not accepted. Valid values: {0}.', this.enumValues.map(v => JSON.stringify(v)).join(', '));\n                }\n            }\n        }\n    }\n    mergePropertyMatch(propertyValidationResult) {\n        this.problems = this.problems.concat(propertyValidationResult.problems);\n        this.propertiesMatches++;\n        if (propertyValidationResult.enumValueMatch || !propertyValidationResult.hasProblems() && propertyValidationResult.propertiesMatches) {\n            this.propertiesValueMatches++;\n        }\n        if (propertyValidationResult.enumValueMatch && propertyValidationResult.enumValues && propertyValidationResult.enumValues.length === 1) {\n            this.primaryValueMatches++;\n        }\n    }\n    mergeProcessedProperties(validationResult) {\n        validationResult.processedProperties.forEach(p => this.processedProperties.add(p));\n    }\n    compare(other) {\n        const hasProblems = this.hasProblems();\n        if (hasProblems !== other.hasProblems()) {\n            return hasProblems ? -1 : 1;\n        }\n        if (this.enumValueMatch !== other.enumValueMatch) {\n            return other.enumValueMatch ? -1 : 1;\n        }\n        if (this.primaryValueMatches !== other.primaryValueMatches) {\n            return this.primaryValueMatches - other.primaryValueMatches;\n        }\n        if (this.propertiesValueMatches !== other.propertiesValueMatches) {\n            return this.propertiesValueMatches - other.propertiesValueMatches;\n        }\n        return this.propertiesMatches - other.propertiesMatches;\n    }\n}\nfunction newJSONDocument(root, diagnostics = []) {\n    return new JSONDocument(root, diagnostics, []);\n}\nfunction getNodeValue(node) {\n    return getNodeValue$1(node);\n}\nfunction getNodePath(node) {\n    return getNodePath$1(node);\n}\nfunction contains(node, offset, includeRightBound = false) {\n    return offset >= node.offset && offset < (node.offset + node.length) || includeRightBound && offset === (node.offset + node.length);\n}\nclass JSONDocument {\n    constructor(root, syntaxErrors = [], comments = []) {\n        this.root = root;\n        this.syntaxErrors = syntaxErrors;\n        this.comments = comments;\n    }\n    getNodeFromOffset(offset, includeRightBound = false) {\n        if (this.root) {\n            return findNodeAtOffset(this.root, offset, includeRightBound);\n        }\n        return undefined;\n    }\n    visit(visitor) {\n        if (this.root) {\n            const doVisit = (node) => {\n                let ctn = visitor(node);\n                const children = node.children;\n                if (Array.isArray(children)) {\n                    for (let i = 0; i < children.length && ctn; i++) {\n                        ctn = doVisit(children[i]);\n                    }\n                }\n                return ctn;\n            };\n            doVisit(this.root);\n        }\n    }\n    validate(textDocument, schema, severity = DiagnosticSeverity.Warning, schemaDraft) {\n        if (this.root && schema) {\n            const validationResult = new ValidationResult();\n            validate(this.root, schema, validationResult, NoOpSchemaCollector.instance, new EvaluationContext(schemaDraft ?? getSchemaDraft(schema)));\n            return validationResult.problems.map(p => {\n                const range = Range.create(textDocument.positionAt(p.location.offset), textDocument.positionAt(p.location.offset + p.location.length));\n                return Diagnostic.create(range, p.message, p.severity ?? severity, p.code);\n            });\n        }\n        return undefined;\n    }\n    getMatchingSchemas(schema, focusOffset = -1, exclude) {\n        if (this.root && schema) {\n            const matchingSchemas = new SchemaCollector(focusOffset, exclude);\n            const schemaDraft = getSchemaDraft(schema);\n            const context = new EvaluationContext(schemaDraft);\n            validate(this.root, schema, new ValidationResult(), matchingSchemas, context);\n            return matchingSchemas.schemas;\n        }\n        return [];\n    }\n}\nfunction getSchemaDraft(schema, fallBack = SchemaDraft.v2020_12) {\n    let schemaId = schema.$schema;\n    if (schemaId) {\n        return schemaDraftFromId[schemaId] ?? fallBack;\n    }\n    return fallBack;\n}\nfunction validate(n, schema, validationResult, matchingSchemas, context) {\n    if (!n || !matchingSchemas.include(n)) {\n        return;\n    }\n    if (n.type === 'property') {\n        return validate(n.valueNode, schema, validationResult, matchingSchemas, context);\n    }\n    const node = n;\n    _validateNode();\n    switch (node.type) {\n        case 'object':\n            _validateObjectNode(node);\n            break;\n        case 'array':\n            _validateArrayNode(node);\n            break;\n        case 'string':\n            _validateStringNode(node);\n            break;\n        case 'number':\n            _validateNumberNode(node);\n            break;\n    }\n    matchingSchemas.add({ node: node, schema: schema });\n    function _validateNode() {\n        function matchesType(type) {\n            return node.type === type || (type === 'integer' && node.type === 'number' && node.isInteger);\n        }\n        if (Array.isArray(schema.type)) {\n            if (!schema.type.some(matchesType)) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: schema.errorMessage || t('Incorrect type. Expected one of {0}.', schema.type.join(', '))\n                });\n            }\n        }\n        else if (schema.type) {\n            if (!matchesType(schema.type)) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: schema.errorMessage || t('Incorrect type. Expected \"{0}\".', schema.type)\n                });\n            }\n        }\n        if (Array.isArray(schema.allOf)) {\n            for (const subSchemaRef of schema.allOf) {\n                const subValidationResult = new ValidationResult();\n                const subMatchingSchemas = matchingSchemas.newSub();\n                validate(node, asSchema(subSchemaRef), subValidationResult, subMatchingSchemas, context);\n                validationResult.merge(subValidationResult);\n                matchingSchemas.merge(subMatchingSchemas);\n            }\n        }\n        const notSchema = asSchema(schema.not);\n        if (notSchema) {\n            const subValidationResult = new ValidationResult();\n            const subMatchingSchemas = matchingSchemas.newSub();\n            validate(node, notSchema, subValidationResult, subMatchingSchemas, context);\n            if (!subValidationResult.hasProblems()) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: schema.errorMessage || t(\"Matches a schema that is not allowed.\")\n                });\n            }\n            for (const ms of subMatchingSchemas.schemas) {\n                ms.inverted = !ms.inverted;\n                matchingSchemas.add(ms);\n            }\n        }\n        const testAlternatives = (alternatives, maxOneMatch) => {\n            const matches = [];\n            // remember the best match that is used for error messages\n            let bestMatch = undefined;\n            for (const subSchemaRef of alternatives) {\n                const subSchema = asSchema(subSchemaRef);\n                const subValidationResult = new ValidationResult();\n                const subMatchingSchemas = matchingSchemas.newSub();\n                validate(node, subSchema, subValidationResult, subMatchingSchemas, context);\n                if (!subValidationResult.hasProblems()) {\n                    matches.push(subSchema);\n                }\n                if (!bestMatch) {\n                    bestMatch = { schema: subSchema, validationResult: subValidationResult, matchingSchemas: subMatchingSchemas };\n                }\n                else {\n                    if (!maxOneMatch && !subValidationResult.hasProblems() && !bestMatch.validationResult.hasProblems()) {\n                        // no errors, both are equally good matches\n                        bestMatch.matchingSchemas.merge(subMatchingSchemas);\n                        bestMatch.validationResult.propertiesMatches += subValidationResult.propertiesMatches;\n                        bestMatch.validationResult.propertiesValueMatches += subValidationResult.propertiesValueMatches;\n                        bestMatch.validationResult.mergeProcessedProperties(subValidationResult);\n                    }\n                    else {\n                        const compareResult = subValidationResult.compare(bestMatch.validationResult);\n                        if (compareResult > 0) {\n                            // our node is the best matching so far\n                            bestMatch = { schema: subSchema, validationResult: subValidationResult, matchingSchemas: subMatchingSchemas };\n                        }\n                        else if (compareResult === 0) {\n                            // there's already a best matching but we are as good\n                            bestMatch.matchingSchemas.merge(subMatchingSchemas);\n                            bestMatch.validationResult.mergeEnumValues(subValidationResult);\n                        }\n                    }\n                }\n            }\n            if (matches.length > 1 && maxOneMatch) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: 1 },\n                    message: t(\"Matches multiple schemas when only one must validate.\")\n                });\n            }\n            if (bestMatch) {\n                validationResult.merge(bestMatch.validationResult);\n                matchingSchemas.merge(bestMatch.matchingSchemas);\n            }\n            return matches.length;\n        };\n        if (Array.isArray(schema.anyOf)) {\n            testAlternatives(schema.anyOf, false);\n        }\n        if (Array.isArray(schema.oneOf)) {\n            testAlternatives(schema.oneOf, true);\n        }\n        const testBranch = (schema) => {\n            const subValidationResult = new ValidationResult();\n            const subMatchingSchemas = matchingSchemas.newSub();\n            validate(node, asSchema(schema), subValidationResult, subMatchingSchemas, context);\n            validationResult.merge(subValidationResult);\n            matchingSchemas.merge(subMatchingSchemas);\n        };\n        const testCondition = (ifSchema, thenSchema, elseSchema) => {\n            const subSchema = asSchema(ifSchema);\n            const subValidationResult = new ValidationResult();\n            const subMatchingSchemas = matchingSchemas.newSub();\n            validate(node, subSchema, subValidationResult, subMatchingSchemas, context);\n            matchingSchemas.merge(subMatchingSchemas);\n            validationResult.mergeProcessedProperties(subValidationResult);\n            if (!subValidationResult.hasProblems()) {\n                if (thenSchema) {\n                    testBranch(thenSchema);\n                }\n            }\n            else if (elseSchema) {\n                testBranch(elseSchema);\n            }\n        };\n        const ifSchema = asSchema(schema.if);\n        if (ifSchema) {\n            testCondition(ifSchema, asSchema(schema.then), asSchema(schema.else));\n        }\n        if (Array.isArray(schema.enum)) {\n            const val = getNodeValue(node);\n            let enumValueMatch = false;\n            for (const e of schema.enum) {\n                if (equals(val, e)) {\n                    enumValueMatch = true;\n                    break;\n                }\n            }\n            validationResult.enumValues = schema.enum;\n            validationResult.enumValueMatch = enumValueMatch;\n            if (!enumValueMatch) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    code: ErrorCode.EnumValueMismatch,\n                    message: schema.errorMessage || t('Value is not accepted. Valid values: {0}.', schema.enum.map(v => JSON.stringify(v)).join(', '))\n                });\n            }\n        }\n        if (isDefined(schema.const)) {\n            const val = getNodeValue(node);\n            if (!equals(val, schema.const)) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    code: ErrorCode.EnumValueMismatch,\n                    message: schema.errorMessage || t('Value must be {0}.', JSON.stringify(schema.const))\n                });\n                validationResult.enumValueMatch = false;\n            }\n            else {\n                validationResult.enumValueMatch = true;\n            }\n            validationResult.enumValues = [schema.const];\n        }\n        let deprecationMessage = schema.deprecationMessage;\n        if (deprecationMessage || schema.deprecated) {\n            deprecationMessage = deprecationMessage || t('Value is deprecated');\n            let targetNode = node.parent?.type === 'property' ? node.parent : node;\n            validationResult.problems.push({\n                location: { offset: targetNode.offset, length: targetNode.length },\n                severity: DiagnosticSeverity.Warning,\n                message: deprecationMessage,\n                code: ErrorCode.Deprecated\n            });\n        }\n    }\n    function _validateNumberNode(node) {\n        const val = node.value;\n        function normalizeFloats(float) {\n            const parts = /^(-?\\d+)(?:\\.(\\d+))?(?:e([-+]\\d+))?$/.exec(float.toString());\n            return parts && {\n                value: Number(parts[1] + (parts[2] || '')),\n                multiplier: (parts[2]?.length || 0) - (parseInt(parts[3]) || 0)\n            };\n        }\n        if (isNumber(schema.multipleOf)) {\n            let remainder = -1;\n            if (Number.isInteger(schema.multipleOf)) {\n                remainder = val % schema.multipleOf;\n            }\n            else {\n                let normMultipleOf = normalizeFloats(schema.multipleOf);\n                let normValue = normalizeFloats(val);\n                if (normMultipleOf && normValue) {\n                    const multiplier = 10 ** Math.abs(normValue.multiplier - normMultipleOf.multiplier);\n                    if (normValue.multiplier < normMultipleOf.multiplier) {\n                        normValue.value *= multiplier;\n                    }\n                    else {\n                        normMultipleOf.value *= multiplier;\n                    }\n                    remainder = normValue.value % normMultipleOf.value;\n                }\n            }\n            if (remainder !== 0) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: t('Value is not divisible by {0}.', schema.multipleOf)\n                });\n            }\n        }\n        function getExclusiveLimit(limit, exclusive) {\n            if (isNumber(exclusive)) {\n                return exclusive;\n            }\n            if (isBoolean(exclusive) && exclusive) {\n                return limit;\n            }\n            return undefined;\n        }\n        function getLimit(limit, exclusive) {\n            if (!isBoolean(exclusive) || !exclusive) {\n                return limit;\n            }\n            return undefined;\n        }\n        const exclusiveMinimum = getExclusiveLimit(schema.minimum, schema.exclusiveMinimum);\n        if (isNumber(exclusiveMinimum) && val <= exclusiveMinimum) {\n            validationResult.problems.push({\n                location: { offset: node.offset, length: node.length },\n                message: t('Value is below the exclusive minimum of {0}.', exclusiveMinimum)\n            });\n        }\n        const exclusiveMaximum = getExclusiveLimit(schema.maximum, schema.exclusiveMaximum);\n        if (isNumber(exclusiveMaximum) && val >= exclusiveMaximum) {\n            validationResult.problems.push({\n                location: { offset: node.offset, length: node.length },\n                message: t('Value is above the exclusive maximum of {0}.', exclusiveMaximum)\n            });\n        }\n        const minimum = getLimit(schema.minimum, schema.exclusiveMinimum);\n        if (isNumber(minimum) && val < minimum) {\n            validationResult.problems.push({\n                location: { offset: node.offset, length: node.length },\n                message: t('Value is below the minimum of {0}.', minimum)\n            });\n        }\n        const maximum = getLimit(schema.maximum, schema.exclusiveMaximum);\n        if (isNumber(maximum) && val > maximum) {\n            validationResult.problems.push({\n                location: { offset: node.offset, length: node.length },\n                message: t('Value is above the maximum of {0}.', maximum)\n            });\n        }\n    }\n    function _validateStringNode(node) {\n        if (isNumber(schema.minLength) && stringLength(node.value) < schema.minLength) {\n            validationResult.problems.push({\n                location: { offset: node.offset, length: node.length },\n                message: t('String is shorter than the minimum length of {0}.', schema.minLength)\n            });\n        }\n        if (isNumber(schema.maxLength) && stringLength(node.value) > schema.maxLength) {\n            validationResult.problems.push({\n                location: { offset: node.offset, length: node.length },\n                message: t('String is longer than the maximum length of {0}.', schema.maxLength)\n            });\n        }\n        if (isString(schema.pattern)) {\n            const regex = extendedRegExp(schema.pattern);\n            if (!(regex?.test(node.value))) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: schema.patternErrorMessage || schema.errorMessage || t('String does not match the pattern of \"{0}\".', schema.pattern)\n                });\n            }\n        }\n        if (schema.format) {\n            switch (schema.format) {\n                case 'uri':\n                case 'uri-reference':\n                    {\n                        let errorMessage;\n                        if (!node.value) {\n                            errorMessage = t('URI expected.');\n                        }\n                        else {\n                            const match = /^(([^:/?#]+?):)?(\\/\\/([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?/.exec(node.value);\n                            if (!match) {\n                                errorMessage = t('URI is expected.');\n                            }\n                            else if (!match[2] && schema.format === 'uri') {\n                                errorMessage = t('URI with a scheme is expected.');\n                            }\n                        }\n                        if (errorMessage) {\n                            validationResult.problems.push({\n                                location: { offset: node.offset, length: node.length },\n                                message: schema.patternErrorMessage || schema.errorMessage || t('String is not a URI: {0}', errorMessage)\n                            });\n                        }\n                    }\n                    break;\n                case 'color-hex':\n                case 'date-time':\n                case 'date':\n                case 'time':\n                case 'email':\n                case 'hostname':\n                case 'ipv4':\n                case 'ipv6':\n                    const format = formats[schema.format];\n                    if (!node.value || !format.pattern.exec(node.value)) {\n                        validationResult.problems.push({\n                            location: { offset: node.offset, length: node.length },\n                            message: schema.patternErrorMessage || schema.errorMessage || format.errorMessage\n                        });\n                    }\n            }\n        }\n    }\n    function _validateArrayNode(node) {\n        let prefixItemsSchemas;\n        let additionalItemSchema;\n        if (context.schemaDraft >= SchemaDraft.v2020_12) {\n            prefixItemsSchemas = schema.prefixItems;\n            additionalItemSchema = !Array.isArray(schema.items) ? schema.items : undefined;\n        }\n        else {\n            prefixItemsSchemas = Array.isArray(schema.items) ? schema.items : undefined;\n            additionalItemSchema = !Array.isArray(schema.items) ? schema.items : schema.additionalItems;\n        }\n        let index = 0;\n        if (prefixItemsSchemas !== undefined) {\n            const max = Math.min(prefixItemsSchemas.length, node.items.length);\n            for (; index < max; index++) {\n                const subSchemaRef = prefixItemsSchemas[index];\n                const subSchema = asSchema(subSchemaRef);\n                const itemValidationResult = new ValidationResult();\n                const item = node.items[index];\n                if (item) {\n                    validate(item, subSchema, itemValidationResult, matchingSchemas, context);\n                    validationResult.mergePropertyMatch(itemValidationResult);\n                }\n                validationResult.processedProperties.add(String(index));\n            }\n        }\n        if (additionalItemSchema !== undefined && index < node.items.length) {\n            if (typeof additionalItemSchema === 'boolean') {\n                if (additionalItemSchema === false) {\n                    validationResult.problems.push({\n                        location: { offset: node.offset, length: node.length },\n                        message: t('Array has too many items according to schema. Expected {0} or fewer.', index)\n                    });\n                }\n                for (; index < node.items.length; index++) {\n                    validationResult.processedProperties.add(String(index));\n                    validationResult.propertiesValueMatches++;\n                }\n            }\n            else {\n                for (; index < node.items.length; index++) {\n                    const itemValidationResult = new ValidationResult();\n                    validate(node.items[index], additionalItemSchema, itemValidationResult, matchingSchemas, context);\n                    validationResult.mergePropertyMatch(itemValidationResult);\n                    validationResult.processedProperties.add(String(index));\n                }\n            }\n        }\n        const containsSchema = asSchema(schema.contains);\n        if (containsSchema) {\n            let containsCount = 0;\n            for (let index = 0; index < node.items.length; index++) {\n                const item = node.items[index];\n                const itemValidationResult = new ValidationResult();\n                validate(item, containsSchema, itemValidationResult, NoOpSchemaCollector.instance, context);\n                if (!itemValidationResult.hasProblems()) {\n                    containsCount++;\n                    if (context.schemaDraft >= SchemaDraft.v2020_12) {\n                        validationResult.processedProperties.add(String(index));\n                    }\n                }\n            }\n            if (containsCount === 0 && !isNumber(schema.minContains)) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: schema.errorMessage || t('Array does not contain required item.')\n                });\n            }\n            if (isNumber(schema.minContains) && containsCount < schema.minContains) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: schema.errorMessage || t('Array has too few items that match the contains contraint. Expected {0} or more.', schema.minContains)\n                });\n            }\n            if (isNumber(schema.maxContains) && containsCount > schema.maxContains) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: schema.errorMessage || t('Array has too many items that match the contains contraint. Expected {0} or less.', schema.maxContains)\n                });\n            }\n        }\n        const unevaluatedItems = schema.unevaluatedItems;\n        if (unevaluatedItems !== undefined) {\n            for (let i = 0; i < node.items.length; i++) {\n                if (!validationResult.processedProperties.has(String(i))) {\n                    if (unevaluatedItems === false) {\n                        validationResult.problems.push({\n                            location: { offset: node.offset, length: node.length },\n                            message: t('Item does not match any validation rule from the array.')\n                        });\n                    }\n                    else {\n                        const itemValidationResult = new ValidationResult();\n                        validate(node.items[i], schema.unevaluatedItems, itemValidationResult, matchingSchemas, context);\n                        validationResult.mergePropertyMatch(itemValidationResult);\n                    }\n                }\n                validationResult.processedProperties.add(String(i));\n                validationResult.propertiesValueMatches++;\n            }\n        }\n        if (isNumber(schema.minItems) && node.items.length < schema.minItems) {\n            validationResult.problems.push({\n                location: { offset: node.offset, length: node.length },\n                message: t('Array has too few items. Expected {0} or more.', schema.minItems)\n            });\n        }\n        if (isNumber(schema.maxItems) && node.items.length > schema.maxItems) {\n            validationResult.problems.push({\n                location: { offset: node.offset, length: node.length },\n                message: t('Array has too many items. Expected {0} or fewer.', schema.maxItems)\n            });\n        }\n        if (schema.uniqueItems === true) {\n            const values = getNodeValue(node);\n            function hasDuplicates() {\n                for (let i = 0; i < values.length - 1; i++) {\n                    const value = values[i];\n                    for (let j = i + 1; j < values.length; j++) {\n                        if (equals(value, values[j])) {\n                            return true;\n                        }\n                    }\n                }\n                return false;\n            }\n            if (hasDuplicates()) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: t('Array has duplicate items.')\n                });\n            }\n        }\n    }\n    function _validateObjectNode(node) {\n        const seenKeys = Object.create(null);\n        const unprocessedProperties = new Set();\n        for (const propertyNode of node.properties) {\n            const key = propertyNode.keyNode.value;\n            seenKeys[key] = propertyNode.valueNode;\n            unprocessedProperties.add(key);\n        }\n        if (Array.isArray(schema.required)) {\n            for (const propertyName of schema.required) {\n                if (!seenKeys[propertyName]) {\n                    const keyNode = node.parent && node.parent.type === 'property' && node.parent.keyNode;\n                    const location = keyNode ? { offset: keyNode.offset, length: keyNode.length } : { offset: node.offset, length: 1 };\n                    validationResult.problems.push({\n                        location: location,\n                        message: t('Missing property \"{0}\".', propertyName)\n                    });\n                }\n            }\n        }\n        const propertyProcessed = (prop) => {\n            unprocessedProperties.delete(prop);\n            validationResult.processedProperties.add(prop);\n        };\n        if (schema.properties) {\n            for (const propertyName of Object.keys(schema.properties)) {\n                propertyProcessed(propertyName);\n                const propertySchema = schema.properties[propertyName];\n                const child = seenKeys[propertyName];\n                if (child) {\n                    if (isBoolean(propertySchema)) {\n                        if (!propertySchema) {\n                            const propertyNode = child.parent;\n                            validationResult.problems.push({\n                                location: { offset: propertyNode.keyNode.offset, length: propertyNode.keyNode.length },\n                                message: schema.errorMessage || t('Property {0} is not allowed.', propertyName)\n                            });\n                        }\n                        else {\n                            validationResult.propertiesMatches++;\n                            validationResult.propertiesValueMatches++;\n                        }\n                    }\n                    else {\n                        const propertyValidationResult = new ValidationResult();\n                        validate(child, propertySchema, propertyValidationResult, matchingSchemas, context);\n                        validationResult.mergePropertyMatch(propertyValidationResult);\n                    }\n                }\n            }\n        }\n        if (schema.patternProperties) {\n            for (const propertyPattern of Object.keys(schema.patternProperties)) {\n                const regex = extendedRegExp(propertyPattern);\n                if (regex) {\n                    const processed = [];\n                    for (const propertyName of unprocessedProperties) {\n                        if (regex.test(propertyName)) {\n                            processed.push(propertyName);\n                            const child = seenKeys[propertyName];\n                            if (child) {\n                                const propertySchema = schema.patternProperties[propertyPattern];\n                                if (isBoolean(propertySchema)) {\n                                    if (!propertySchema) {\n                                        const propertyNode = child.parent;\n                                        validationResult.problems.push({\n                                            location: { offset: propertyNode.keyNode.offset, length: propertyNode.keyNode.length },\n                                            message: schema.errorMessage || t('Property {0} is not allowed.', propertyName)\n                                        });\n                                    }\n                                    else {\n                                        validationResult.propertiesMatches++;\n                                        validationResult.propertiesValueMatches++;\n                                    }\n                                }\n                                else {\n                                    const propertyValidationResult = new ValidationResult();\n                                    validate(child, propertySchema, propertyValidationResult, matchingSchemas, context);\n                                    validationResult.mergePropertyMatch(propertyValidationResult);\n                                }\n                            }\n                        }\n                    }\n                    processed.forEach(propertyProcessed);\n                }\n            }\n        }\n        const additionalProperties = schema.additionalProperties;\n        if (additionalProperties !== undefined) {\n            for (const propertyName of unprocessedProperties) {\n                propertyProcessed(propertyName);\n                const child = seenKeys[propertyName];\n                if (child) {\n                    if (additionalProperties === false) {\n                        const propertyNode = child.parent;\n                        validationResult.problems.push({\n                            location: { offset: propertyNode.keyNode.offset, length: propertyNode.keyNode.length },\n                            message: schema.errorMessage || t('Property {0} is not allowed.', propertyName)\n                        });\n                    }\n                    else if (additionalProperties !== true) {\n                        const propertyValidationResult = new ValidationResult();\n                        validate(child, additionalProperties, propertyValidationResult, matchingSchemas, context);\n                        validationResult.mergePropertyMatch(propertyValidationResult);\n                    }\n                }\n            }\n        }\n        const unevaluatedProperties = schema.unevaluatedProperties;\n        if (unevaluatedProperties !== undefined) {\n            const processed = [];\n            for (const propertyName of unprocessedProperties) {\n                if (!validationResult.processedProperties.has(propertyName)) {\n                    processed.push(propertyName);\n                    const child = seenKeys[propertyName];\n                    if (child) {\n                        if (unevaluatedProperties === false) {\n                            const propertyNode = child.parent;\n                            validationResult.problems.push({\n                                location: { offset: propertyNode.keyNode.offset, length: propertyNode.keyNode.length },\n                                message: schema.errorMessage || t('Property {0} is not allowed.', propertyName)\n                            });\n                        }\n                        else if (unevaluatedProperties !== true) {\n                            const propertyValidationResult = new ValidationResult();\n                            validate(child, unevaluatedProperties, propertyValidationResult, matchingSchemas, context);\n                            validationResult.mergePropertyMatch(propertyValidationResult);\n                        }\n                    }\n                }\n            }\n            processed.forEach(propertyProcessed);\n        }\n        if (isNumber(schema.maxProperties)) {\n            if (node.properties.length > schema.maxProperties) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: t('Object has more properties than limit of {0}.', schema.maxProperties)\n                });\n            }\n        }\n        if (isNumber(schema.minProperties)) {\n            if (node.properties.length < schema.minProperties) {\n                validationResult.problems.push({\n                    location: { offset: node.offset, length: node.length },\n                    message: t('Object has fewer properties than the required number of {0}', schema.minProperties)\n                });\n            }\n        }\n        if (schema.dependentRequired) {\n            for (const key in schema.dependentRequired) {\n                const prop = seenKeys[key];\n                const propertyDeps = schema.dependentRequired[key];\n                if (prop && Array.isArray(propertyDeps)) {\n                    _validatePropertyDependencies(key, propertyDeps);\n                }\n            }\n        }\n        if (schema.dependentSchemas) {\n            for (const key in schema.dependentSchemas) {\n                const prop = seenKeys[key];\n                const propertyDeps = schema.dependentSchemas[key];\n                if (prop && isObject(propertyDeps)) {\n                    _validatePropertyDependencies(key, propertyDeps);\n                }\n            }\n        }\n        if (schema.dependencies) {\n            for (const key in schema.dependencies) {\n                const prop = seenKeys[key];\n                if (prop) {\n                    _validatePropertyDependencies(key, schema.dependencies[key]);\n                }\n            }\n        }\n        const propertyNames = asSchema(schema.propertyNames);\n        if (propertyNames) {\n            for (const f of node.properties) {\n                const key = f.keyNode;\n                if (key) {\n                    validate(key, propertyNames, validationResult, NoOpSchemaCollector.instance, context);\n                }\n            }\n        }\n        function _validatePropertyDependencies(key, propertyDep) {\n            if (Array.isArray(propertyDep)) {\n                for (const requiredProp of propertyDep) {\n                    if (!seenKeys[requiredProp]) {\n                        validationResult.problems.push({\n                            location: { offset: node.offset, length: node.length },\n                            message: t('Object is missing property {0} required by property {1}.', requiredProp, key)\n                        });\n                    }\n                    else {\n                        validationResult.propertiesValueMatches++;\n                    }\n                }\n            }\n            else {\n                const propertySchema = asSchema(propertyDep);\n                if (propertySchema) {\n                    const propertyValidationResult = new ValidationResult();\n                    validate(node, propertySchema, propertyValidationResult, matchingSchemas, context);\n                    validationResult.mergePropertyMatch(propertyValidationResult);\n                }\n            }\n        }\n    }\n}\nfunction parse(textDocument, config) {\n    const problems = [];\n    let lastProblemOffset = -1;\n    const text = textDocument.getText();\n    const scanner = createScanner(text, false);\n    const commentRanges = config && config.collectComments ? [] : undefined;\n    function _scanNext() {\n        while (true) {\n            const token = scanner.scan();\n            _checkScanError();\n            switch (token) {\n                case 12 /* Json.SyntaxKind.LineCommentTrivia */:\n                case 13 /* Json.SyntaxKind.BlockCommentTrivia */:\n                    if (Array.isArray(commentRanges)) {\n                        commentRanges.push(Range.create(textDocument.positionAt(scanner.getTokenOffset()), textDocument.positionAt(scanner.getTokenOffset() + scanner.getTokenLength())));\n                    }\n                    break;\n                case 15 /* Json.SyntaxKind.Trivia */:\n                case 14 /* Json.SyntaxKind.LineBreakTrivia */:\n                    break;\n                default:\n                    return token;\n            }\n        }\n    }\n    function _errorAtRange(message, code, startOffset, endOffset, severity = DiagnosticSeverity.Error) {\n        if (problems.length === 0 || startOffset !== lastProblemOffset) {\n            const range = Range.create(textDocument.positionAt(startOffset), textDocument.positionAt(endOffset));\n            problems.push(Diagnostic.create(range, message, severity, code, textDocument.languageId));\n            lastProblemOffset = startOffset;\n        }\n    }\n    function _error(message, code, node = undefined, skipUntilAfter = [], skipUntil = []) {\n        let start = scanner.getTokenOffset();\n        let end = scanner.getTokenOffset() + scanner.getTokenLength();\n        if (start === end && start > 0) {\n            start--;\n            while (start > 0 && /\\s/.test(text.charAt(start))) {\n                start--;\n            }\n            end = start + 1;\n        }\n        _errorAtRange(message, code, start, end);\n        if (node) {\n            _finalize(node, false);\n        }\n        if (skipUntilAfter.length + skipUntil.length > 0) {\n            let token = scanner.getToken();\n            while (token !== 17 /* Json.SyntaxKind.EOF */) {\n                if (skipUntilAfter.indexOf(token) !== -1) {\n                    _scanNext();\n                    break;\n                }\n                else if (skipUntil.indexOf(token) !== -1) {\n                    break;\n                }\n                token = _scanNext();\n            }\n        }\n        return node;\n    }\n    function _checkScanError() {\n        switch (scanner.getTokenError()) {\n            case 4 /* Json.ScanError.InvalidUnicode */:\n                _error(t('Invalid unicode sequence in string.'), ErrorCode.InvalidUnicode);\n                return true;\n            case 5 /* Json.ScanError.InvalidEscapeCharacter */:\n                _error(t('Invalid escape character in string.'), ErrorCode.InvalidEscapeCharacter);\n                return true;\n            case 3 /* Json.ScanError.UnexpectedEndOfNumber */:\n                _error(t('Unexpected end of number.'), ErrorCode.UnexpectedEndOfNumber);\n                return true;\n            case 1 /* Json.ScanError.UnexpectedEndOfComment */:\n                _error(t('Unexpected end of comment.'), ErrorCode.UnexpectedEndOfComment);\n                return true;\n            case 2 /* Json.ScanError.UnexpectedEndOfString */:\n                _error(t('Unexpected end of string.'), ErrorCode.UnexpectedEndOfString);\n                return true;\n            case 6 /* Json.ScanError.InvalidCharacter */:\n                _error(t('Invalid characters in string. Control characters must be escaped.'), ErrorCode.InvalidCharacter);\n                return true;\n        }\n        return false;\n    }\n    function _finalize(node, scanNext) {\n        node.length = scanner.getTokenOffset() + scanner.getTokenLength() - node.offset;\n        if (scanNext) {\n            _scanNext();\n        }\n        return node;\n    }\n    function _parseArray(parent) {\n        if (scanner.getToken() !== 3 /* Json.SyntaxKind.OpenBracketToken */) {\n            return undefined;\n        }\n        const node = new ArrayASTNodeImpl(parent, scanner.getTokenOffset());\n        _scanNext(); // consume OpenBracketToken\n        let needsComma = false;\n        while (scanner.getToken() !== 4 /* Json.SyntaxKind.CloseBracketToken */ && scanner.getToken() !== 17 /* Json.SyntaxKind.EOF */) {\n            if (scanner.getToken() === 5 /* Json.SyntaxKind.CommaToken */) {\n                if (!needsComma) {\n                    _error(t('Value expected'), ErrorCode.ValueExpected);\n                }\n                const commaOffset = scanner.getTokenOffset();\n                _scanNext(); // consume comma\n                if (scanner.getToken() === 4 /* Json.SyntaxKind.CloseBracketToken */) {\n                    if (needsComma) {\n                        _errorAtRange(t('Trailing comma'), ErrorCode.TrailingComma, commaOffset, commaOffset + 1);\n                    }\n                    continue;\n                }\n            }\n            else if (needsComma) {\n                _error(t('Expected comma'), ErrorCode.CommaExpected);\n            }\n            const item = _parseValue(node);\n            if (!item) {\n                _error(t('Value expected'), ErrorCode.ValueExpected, undefined, [], [4 /* Json.SyntaxKind.CloseBracketToken */, 5 /* Json.SyntaxKind.CommaToken */]);\n            }\n            else {\n                node.items.push(item);\n            }\n            needsComma = true;\n        }\n        if (scanner.getToken() !== 4 /* Json.SyntaxKind.CloseBracketToken */) {\n            return _error(t('Expected comma or closing bracket'), ErrorCode.CommaOrCloseBacketExpected, node);\n        }\n        return _finalize(node, true);\n    }\n    const keyPlaceholder = new StringASTNodeImpl(undefined, 0, 0);\n    function _parseProperty(parent, keysSeen) {\n        const node = new PropertyASTNodeImpl(parent, scanner.getTokenOffset(), keyPlaceholder);\n        let key = _parseString(node);\n        if (!key) {\n            if (scanner.getToken() === 16 /* Json.SyntaxKind.Unknown */) {\n                // give a more helpful error message\n                _error(t('Property keys must be doublequoted'), ErrorCode.PropertyKeysMustBeDoublequoted);\n                const keyNode = new StringASTNodeImpl(node, scanner.getTokenOffset(), scanner.getTokenLength());\n                keyNode.value = scanner.getTokenValue();\n                key = keyNode;\n                _scanNext(); // consume Unknown\n            }\n            else {\n                return undefined;\n            }\n        }\n        node.keyNode = key;\n        // For JSON files that forbid code comments, there is a convention to use the key name \"//\" to add comments.\n        // Multiple instances of \"//\" are okay.\n        if (key.value !== \"//\") {\n            const seen = keysSeen[key.value];\n            if (seen) {\n                _errorAtRange(t(\"Duplicate object key\"), ErrorCode.DuplicateKey, node.keyNode.offset, node.keyNode.offset + node.keyNode.length, DiagnosticSeverity.Warning);\n                if (isObject(seen)) {\n                    _errorAtRange(t(\"Duplicate object key\"), ErrorCode.DuplicateKey, seen.keyNode.offset, seen.keyNode.offset + seen.keyNode.length, DiagnosticSeverity.Warning);\n                }\n                keysSeen[key.value] = true; // if the same key is duplicate again, avoid duplicate error reporting\n            }\n            else {\n                keysSeen[key.value] = node;\n            }\n        }\n        if (scanner.getToken() === 6 /* Json.SyntaxKind.ColonToken */) {\n            node.colonOffset = scanner.getTokenOffset();\n            _scanNext(); // consume ColonToken\n        }\n        else {\n            _error(t('Colon expected'), ErrorCode.ColonExpected);\n            if (scanner.getToken() === 10 /* Json.SyntaxKind.StringLiteral */ && textDocument.positionAt(key.offset + key.length).line < textDocument.positionAt(scanner.getTokenOffset()).line) {\n                node.length = key.length;\n                return node;\n            }\n        }\n        const value = _parseValue(node);\n        if (!value) {\n            return _error(t('Value expected'), ErrorCode.ValueExpected, node, [], [2 /* Json.SyntaxKind.CloseBraceToken */, 5 /* Json.SyntaxKind.CommaToken */]);\n        }\n        node.valueNode = value;\n        node.length = value.offset + value.length - node.offset;\n        return node;\n    }\n    function _parseObject(parent) {\n        if (scanner.getToken() !== 1 /* Json.SyntaxKind.OpenBraceToken */) {\n            return undefined;\n        }\n        const node = new ObjectASTNodeImpl(parent, scanner.getTokenOffset());\n        const keysSeen = Object.create(null);\n        _scanNext(); // consume OpenBraceToken\n        let needsComma = false;\n        while (scanner.getToken() !== 2 /* Json.SyntaxKind.CloseBraceToken */ && scanner.getToken() !== 17 /* Json.SyntaxKind.EOF */) {\n            if (scanner.getToken() === 5 /* Json.SyntaxKind.CommaToken */) {\n                if (!needsComma) {\n                    _error(t('Property expected'), ErrorCode.PropertyExpected);\n                }\n                const commaOffset = scanner.getTokenOffset();\n                _scanNext(); // consume comma\n                if (scanner.getToken() === 2 /* Json.SyntaxKind.CloseBraceToken */) {\n                    if (needsComma) {\n                        _errorAtRange(t('Trailing comma'), ErrorCode.TrailingComma, commaOffset, commaOffset + 1);\n                    }\n                    continue;\n                }\n            }\n            else if (needsComma) {\n                _error(t('Expected comma'), ErrorCode.CommaExpected);\n            }\n            const property = _parseProperty(node, keysSeen);\n            if (!property) {\n                _error(t('Property expected'), ErrorCode.PropertyExpected, undefined, [], [2 /* Json.SyntaxKind.CloseBraceToken */, 5 /* Json.SyntaxKind.CommaToken */]);\n            }\n            else {\n                node.properties.push(property);\n            }\n            needsComma = true;\n        }\n        if (scanner.getToken() !== 2 /* Json.SyntaxKind.CloseBraceToken */) {\n            return _error(t('Expected comma or closing brace'), ErrorCode.CommaOrCloseBraceExpected, node);\n        }\n        return _finalize(node, true);\n    }\n    function _parseString(parent) {\n        if (scanner.getToken() !== 10 /* Json.SyntaxKind.StringLiteral */) {\n            return undefined;\n        }\n        const node = new StringASTNodeImpl(parent, scanner.getTokenOffset());\n        node.value = scanner.getTokenValue();\n        return _finalize(node, true);\n    }\n    function _parseNumber(parent) {\n        if (scanner.getToken() !== 11 /* Json.SyntaxKind.NumericLiteral */) {\n            return undefined;\n        }\n        const node = new NumberASTNodeImpl(parent, scanner.getTokenOffset());\n        if (scanner.getTokenError() === 0 /* Json.ScanError.None */) {\n            const tokenValue = scanner.getTokenValue();\n            try {\n                const numberValue = JSON.parse(tokenValue);\n                if (!isNumber(numberValue)) {\n                    return _error(t('Invalid number format.'), ErrorCode.Undefined, node);\n                }\n                node.value = numberValue;\n            }\n            catch (e) {\n                return _error(t('Invalid number format.'), ErrorCode.Undefined, node);\n            }\n            node.isInteger = tokenValue.indexOf('.') === -1;\n        }\n        return _finalize(node, true);\n    }\n    function _parseLiteral(parent) {\n        switch (scanner.getToken()) {\n            case 7 /* Json.SyntaxKind.NullKeyword */:\n                return _finalize(new NullASTNodeImpl(parent, scanner.getTokenOffset()), true);\n            case 8 /* Json.SyntaxKind.TrueKeyword */:\n                return _finalize(new BooleanASTNodeImpl(parent, true, scanner.getTokenOffset()), true);\n            case 9 /* Json.SyntaxKind.FalseKeyword */:\n                return _finalize(new BooleanASTNodeImpl(parent, false, scanner.getTokenOffset()), true);\n            default:\n                return undefined;\n        }\n    }\n    function _parseValue(parent) {\n        return _parseArray(parent) || _parseObject(parent) || _parseString(parent) || _parseNumber(parent) || _parseLiteral(parent);\n    }\n    let _root = undefined;\n    const token = _scanNext();\n    if (token !== 17 /* Json.SyntaxKind.EOF */) {\n        _root = _parseValue(_root);\n        if (!_root) {\n            _error(t('Expected a JSON object, array or literal.'), ErrorCode.Undefined);\n        }\n        else if (scanner.getToken() !== 17 /* Json.SyntaxKind.EOF */) {\n            _error(t('End of file expected.'), ErrorCode.Undefined);\n        }\n    }\n    return new JSONDocument(_root, problems, commentRanges);\n}\n\nexport { ASTNodeImpl, ArrayASTNodeImpl, BooleanASTNodeImpl, EnumMatch, JSONDocument, NullASTNodeImpl, NumberASTNodeImpl, ObjectASTNodeImpl, PropertyASTNodeImpl, StringASTNodeImpl, ValidationResult, asSchema, contains, getNodePath, getNodeValue, newJSONDocument, parse };\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*--------------------------------------------------------------------------------------------*/\nfunction stringifyObject(obj, indent, stringifyLiteral) {\n    if (obj !== null && typeof obj === 'object') {\n        const newIndent = indent + '\\t';\n        if (Array.isArray(obj)) {\n            if (obj.length === 0) {\n                return '[]';\n            }\n            let result = '[\\n';\n            for (let i = 0; i < obj.length; i++) {\n                result += newIndent + stringifyObject(obj[i], newIndent, stringifyLiteral);\n                if (i < obj.length - 1) {\n                    result += ',';\n                }\n                result += '\\n';\n            }\n            result += indent + ']';\n            return result;\n        }\n        else {\n            const keys = Object.keys(obj);\n            if (keys.length === 0) {\n                return '{}';\n            }\n            let result = '{\\n';\n            for (let i = 0; i < keys.length; i++) {\n                const key = keys[i];\n                result += newIndent + JSON.stringify(key) + ': ' + stringifyObject(obj[key], newIndent, stringifyLiteral);\n                if (i < keys.length - 1) {\n                    result += ',';\n                }\n                result += '\\n';\n            }\n            result += indent + '}';\n            return result;\n        }\n    }\n    return stringifyLiteral(obj);\n}\n\nexport { stringifyObject };\n","import { getNodePath, getNodeValue, contains } from '../parser/jsonParser.js';\nimport { createScanner } from '../../../../jsonc-parser/lib/esm/main.js';\nimport { stringifyObject } from '../utils/json.js';\nimport { endsWith, extendedRegExp } from '../utils/strings.js';\nimport { isDefined } from '../utils/objects.js';\nimport '../jsonLanguageTypes.js';\nimport { t } from '../../../../@vscode/l10n/dist/browser.js';\nimport { Range, CompletionItem, InsertTextFormat, CompletionItemKind, MarkupKind, TextEdit } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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 *--------------------------------------------------------------------------------------------*/\nclass JSONCompletion {\n    constructor(schemaService, contributions = [], promiseConstructor = Promise, clientCapabilities = {}) {\n        this.schemaService = schemaService;\n        this.contributions = contributions;\n        this.promiseConstructor = promiseConstructor;\n        this.clientCapabilities = clientCapabilities;\n    }\n    doResolve(item) {\n        for (let i = this.contributions.length - 1; i >= 0; i--) {\n            const resolveCompletion = this.contributions[i].resolveCompletion;\n            if (resolveCompletion) {\n                const resolver = resolveCompletion(item);\n                if (resolver) {\n                    return resolver;\n                }\n            }\n        }\n        return this.promiseConstructor.resolve(item);\n    }\n    doComplete(document, position, doc) {\n        const result = {\n            items: [],\n            isIncomplete: false\n        };\n        const text = document.getText();\n        const offset = document.offsetAt(position);\n        let node = doc.getNodeFromOffset(offset, true);\n        if (this.isInComment(document, node ? node.offset : 0, offset)) {\n            return Promise.resolve(result);\n        }\n        if (node && (offset === node.offset + node.length) && offset > 0) {\n            const ch = text[offset - 1];\n            if (node.type === 'object' && ch === '}' || node.type === 'array' && ch === ']') {\n                // after ] or }\n                node = node.parent;\n            }\n        }\n        const currentWord = this.getCurrentWord(document, offset);\n        let overwriteRange;\n        if (node && (node.type === 'string' || node.type === 'number' || node.type === 'boolean' || node.type === 'null')) {\n            overwriteRange = Range.create(document.positionAt(node.offset), document.positionAt(node.offset + node.length));\n        }\n        else {\n            let overwriteStart = offset - currentWord.length;\n            if (overwriteStart > 0 && text[overwriteStart - 1] === '\"') {\n                overwriteStart--;\n            }\n            overwriteRange = Range.create(document.positionAt(overwriteStart), position);\n        }\n        const proposed = new Map();\n        const collector = {\n            add: (suggestion) => {\n                let label = suggestion.label;\n                const existing = proposed.get(label);\n                if (!existing) {\n                    label = label.replace(/[\\n]/g, '↵');\n                    if (label.length > 60) {\n                        const shortendedLabel = label.substr(0, 57).trim() + '...';\n                        if (!proposed.has(shortendedLabel)) {\n                            label = shortendedLabel;\n                        }\n                    }\n                    suggestion.textEdit = TextEdit.replace(overwriteRange, suggestion.insertText);\n                    suggestion.label = label;\n                    proposed.set(label, suggestion);\n                    result.items.push(suggestion);\n                }\n                else {\n                    if (!existing.documentation) {\n                        existing.documentation = suggestion.documentation;\n                    }\n                    if (!existing.detail) {\n                        existing.detail = suggestion.detail;\n                    }\n                    if (!existing.labelDetails) {\n                        existing.labelDetails = suggestion.labelDetails;\n                    }\n                }\n            },\n            setAsIncomplete: () => {\n                result.isIncomplete = true;\n            },\n            error: (message) => {\n                console.error(message);\n            },\n            getNumberOfProposals: () => {\n                return result.items.length;\n            }\n        };\n        return this.schemaService.getSchemaForResource(document.uri, doc).then((schema) => {\n            const collectionPromises = [];\n            let addValue = true;\n            let currentKey = '';\n            let currentProperty = undefined;\n            if (node) {\n                if (node.type === 'string') {\n                    const parent = node.parent;\n                    if (parent && parent.type === 'property' && parent.keyNode === node) {\n                        addValue = !parent.valueNode;\n                        currentProperty = parent;\n                        currentKey = text.substr(node.offset + 1, node.length - 2);\n                        if (parent) {\n                            node = parent.parent;\n                        }\n                    }\n                }\n            }\n            // proposals for properties\n            if (node && node.type === 'object') {\n                // don't suggest keys when the cursor is just before the opening curly brace\n                if (node.offset === offset) {\n                    return result;\n                }\n                // don't suggest properties that are already present\n                const properties = node.properties;\n                properties.forEach(p => {\n                    if (!currentProperty || currentProperty !== p) {\n                        proposed.set(p.keyNode.value, CompletionItem.create('__'));\n                    }\n                });\n                let separatorAfter = '';\n                if (addValue) {\n                    separatorAfter = this.evaluateSeparatorAfter(document, document.offsetAt(overwriteRange.end));\n                }\n                if (schema) {\n                    // property proposals with schema\n                    this.getPropertyCompletions(schema, doc, node, addValue, separatorAfter, collector);\n                }\n                else {\n                    // property proposals without schema\n                    this.getSchemaLessPropertyCompletions(doc, node, currentKey, collector);\n                }\n                const location = getNodePath(node);\n                this.contributions.forEach((contribution) => {\n                    const collectPromise = contribution.collectPropertyCompletions(document.uri, location, currentWord, addValue, separatorAfter === '', collector);\n                    if (collectPromise) {\n                        collectionPromises.push(collectPromise);\n                    }\n                });\n                if ((!schema && currentWord.length > 0 && text.charAt(offset - currentWord.length - 1) !== '\"')) {\n                    collector.add({\n                        kind: CompletionItemKind.Property,\n                        label: this.getLabelForValue(currentWord),\n                        insertText: this.getInsertTextForProperty(currentWord, undefined, false, separatorAfter),\n                        insertTextFormat: InsertTextFormat.Snippet, documentation: '',\n                    });\n                    collector.setAsIncomplete();\n                }\n            }\n            // proposals for values\n            const types = {};\n            if (schema) {\n                // value proposals with schema\n                this.getValueCompletions(schema, doc, node, offset, document, collector, types);\n            }\n            else {\n                // value proposals without schema\n                this.getSchemaLessValueCompletions(doc, node, offset, document, collector);\n            }\n            if (this.contributions.length > 0) {\n                this.getContributedValueCompletions(doc, node, offset, document, collector, collectionPromises);\n            }\n            return this.promiseConstructor.all(collectionPromises).then(() => {\n                if (collector.getNumberOfProposals() === 0) {\n                    let offsetForSeparator = offset;\n                    if (node && (node.type === 'string' || node.type === 'number' || node.type === 'boolean' || node.type === 'null')) {\n                        offsetForSeparator = node.offset + node.length;\n                    }\n                    const separatorAfter = this.evaluateSeparatorAfter(document, offsetForSeparator);\n                    this.addFillerValueCompletions(types, separatorAfter, collector);\n                }\n                return result;\n            });\n        });\n    }\n    getPropertyCompletions(schema, doc, node, addValue, separatorAfter, collector) {\n        const matchingSchemas = doc.getMatchingSchemas(schema.schema, node.offset);\n        matchingSchemas.forEach((s) => {\n            if (s.node === node && !s.inverted) {\n                const schemaProperties = s.schema.properties;\n                if (schemaProperties) {\n                    Object.keys(schemaProperties).forEach((key) => {\n                        const propertySchema = schemaProperties[key];\n                        if (typeof propertySchema === 'object' && !propertySchema.deprecationMessage && !propertySchema.doNotSuggest) {\n                            const proposal = {\n                                kind: CompletionItemKind.Property,\n                                label: key,\n                                insertText: this.getInsertTextForProperty(key, propertySchema, addValue, separatorAfter),\n                                insertTextFormat: InsertTextFormat.Snippet,\n                                filterText: this.getFilterTextForValue(key),\n                                documentation: this.fromMarkup(propertySchema.markdownDescription) || propertySchema.description || '',\n                            };\n                            if (propertySchema.suggestSortText !== undefined) {\n                                proposal.sortText = propertySchema.suggestSortText;\n                            }\n                            if (proposal.insertText && endsWith(proposal.insertText, `$1${separatorAfter}`)) {\n                                proposal.command = {\n                                    title: 'Suggest',\n                                    command: 'editor.action.triggerSuggest'\n                                };\n                            }\n                            collector.add(proposal);\n                        }\n                    });\n                }\n                const schemaPropertyNames = s.schema.propertyNames;\n                if (typeof schemaPropertyNames === 'object' && !schemaPropertyNames.deprecationMessage && !schemaPropertyNames.doNotSuggest) {\n                    const propertyNameCompletionItem = (name, enumDescription = undefined) => {\n                        const proposal = {\n                            kind: CompletionItemKind.Property,\n                            label: name,\n                            insertText: this.getInsertTextForProperty(name, undefined, addValue, separatorAfter),\n                            insertTextFormat: InsertTextFormat.Snippet,\n                            filterText: this.getFilterTextForValue(name),\n                            documentation: enumDescription || this.fromMarkup(schemaPropertyNames.markdownDescription) || schemaPropertyNames.description || '',\n                        };\n                        if (schemaPropertyNames.suggestSortText !== undefined) {\n                            proposal.sortText = schemaPropertyNames.suggestSortText;\n                        }\n                        if (proposal.insertText && endsWith(proposal.insertText, `$1${separatorAfter}`)) {\n                            proposal.command = {\n                                title: 'Suggest',\n                                command: 'editor.action.triggerSuggest'\n                            };\n                        }\n                        collector.add(proposal);\n                    };\n                    if (schemaPropertyNames.enum) {\n                        for (let i = 0; i < schemaPropertyNames.enum.length; i++) {\n                            let enumDescription = undefined;\n                            if (schemaPropertyNames.markdownEnumDescriptions && i < schemaPropertyNames.markdownEnumDescriptions.length) {\n                                enumDescription = this.fromMarkup(schemaPropertyNames.markdownEnumDescriptions[i]);\n                            }\n                            else if (schemaPropertyNames.enumDescriptions && i < schemaPropertyNames.enumDescriptions.length) {\n                                enumDescription = schemaPropertyNames.enumDescriptions[i];\n                            }\n                            propertyNameCompletionItem(schemaPropertyNames.enum[i], enumDescription);\n                        }\n                    }\n                    if (schemaPropertyNames.const) {\n                        propertyNameCompletionItem(schemaPropertyNames.const);\n                    }\n                }\n            }\n        });\n    }\n    getSchemaLessPropertyCompletions(doc, node, currentKey, collector) {\n        const collectCompletionsForSimilarObject = (obj) => {\n            obj.properties.forEach((p) => {\n                const key = p.keyNode.value;\n                collector.add({\n                    kind: CompletionItemKind.Property,\n                    label: key,\n                    insertText: this.getInsertTextForValue(key, ''),\n                    insertTextFormat: InsertTextFormat.Snippet,\n                    filterText: this.getFilterTextForValue(key),\n                    documentation: ''\n                });\n            });\n        };\n        if (node.parent) {\n            if (node.parent.type === 'property') {\n                // if the object is a property value, check the tree for other objects that hang under a property of the same name\n                const parentKey = node.parent.keyNode.value;\n                doc.visit(n => {\n                    if (n.type === 'property' && n !== node.parent && n.keyNode.value === parentKey && n.valueNode && n.valueNode.type === 'object') {\n                        collectCompletionsForSimilarObject(n.valueNode);\n                    }\n                    return true;\n                });\n            }\n            else if (node.parent.type === 'array') {\n                // if the object is in an array, use all other array elements as similar objects\n                node.parent.items.forEach(n => {\n                    if (n.type === 'object' && n !== node) {\n                        collectCompletionsForSimilarObject(n);\n                    }\n                });\n            }\n        }\n        else if (node.type === 'object') {\n            collector.add({\n                kind: CompletionItemKind.Property,\n                label: '$schema',\n                insertText: this.getInsertTextForProperty('$schema', undefined, true, ''),\n                insertTextFormat: InsertTextFormat.Snippet, documentation: '',\n                filterText: this.getFilterTextForValue(\"$schema\")\n            });\n        }\n    }\n    getSchemaLessValueCompletions(doc, node, offset, document, collector) {\n        let offsetForSeparator = offset;\n        if (node && (node.type === 'string' || node.type === 'number' || node.type === 'boolean' || node.type === 'null')) {\n            offsetForSeparator = node.offset + node.length;\n            node = node.parent;\n        }\n        if (!node) {\n            collector.add({\n                kind: this.getSuggestionKind('object'),\n                label: 'Empty object',\n                insertText: this.getInsertTextForValue({}, ''),\n                insertTextFormat: InsertTextFormat.Snippet,\n                documentation: ''\n            });\n            collector.add({\n                kind: this.getSuggestionKind('array'),\n                label: 'Empty array',\n                insertText: this.getInsertTextForValue([], ''),\n                insertTextFormat: InsertTextFormat.Snippet,\n                documentation: ''\n            });\n            return;\n        }\n        const separatorAfter = this.evaluateSeparatorAfter(document, offsetForSeparator);\n        const collectSuggestionsForValues = (value) => {\n            if (value.parent && !contains(value.parent, offset, true)) {\n                collector.add({\n                    kind: this.getSuggestionKind(value.type),\n                    label: this.getLabelTextForMatchingNode(value, document),\n                    insertText: this.getInsertTextForMatchingNode(value, document, separatorAfter),\n                    insertTextFormat: InsertTextFormat.Snippet, documentation: ''\n                });\n            }\n            if (value.type === 'boolean') {\n                this.addBooleanValueCompletion(!value.value, separatorAfter, collector);\n            }\n        };\n        if (node.type === 'property') {\n            if (offset > (node.colonOffset || 0)) {\n                const valueNode = node.valueNode;\n                if (valueNode && (offset > (valueNode.offset + valueNode.length) || valueNode.type === 'object' || valueNode.type === 'array')) {\n                    return;\n                }\n                // suggest values at the same key\n                const parentKey = node.keyNode.value;\n                doc.visit(n => {\n                    if (n.type === 'property' && n.keyNode.value === parentKey && n.valueNode) {\n                        collectSuggestionsForValues(n.valueNode);\n                    }\n                    return true;\n                });\n                if (parentKey === '$schema' && node.parent && !node.parent.parent) {\n                    this.addDollarSchemaCompletions(separatorAfter, collector);\n                }\n            }\n        }\n        if (node.type === 'array') {\n            if (node.parent && node.parent.type === 'property') {\n                // suggest items of an array at the same key\n                const parentKey = node.parent.keyNode.value;\n                doc.visit((n) => {\n                    if (n.type === 'property' && n.keyNode.value === parentKey && n.valueNode && n.valueNode.type === 'array') {\n                        n.valueNode.items.forEach(collectSuggestionsForValues);\n                    }\n                    return true;\n                });\n            }\n            else {\n                // suggest items in the same array\n                node.items.forEach(collectSuggestionsForValues);\n            }\n        }\n    }\n    getValueCompletions(schema, doc, node, offset, document, collector, types) {\n        let offsetForSeparator = offset;\n        let parentKey = undefined;\n        let valueNode = undefined;\n        if (node && (node.type === 'string' || node.type === 'number' || node.type === 'boolean' || node.type === 'null')) {\n            offsetForSeparator = node.offset + node.length;\n            valueNode = node;\n            node = node.parent;\n        }\n        if (!node) {\n            this.addSchemaValueCompletions(schema.schema, '', collector, types);\n            return;\n        }\n        if ((node.type === 'property') && offset > (node.colonOffset || 0)) {\n            const valueNode = node.valueNode;\n            if (valueNode && offset > (valueNode.offset + valueNode.length)) {\n                return; // we are past the value node\n            }\n            parentKey = node.keyNode.value;\n            node = node.parent;\n        }\n        if (node && (parentKey !== undefined || node.type === 'array')) {\n            const separatorAfter = this.evaluateSeparatorAfter(document, offsetForSeparator);\n            const matchingSchemas = doc.getMatchingSchemas(schema.schema, node.offset, valueNode);\n            for (const s of matchingSchemas) {\n                if (s.node === node && !s.inverted && s.schema) {\n                    if (node.type === 'array' && s.schema.items) {\n                        let c = collector;\n                        if (s.schema.uniqueItems) {\n                            const existingValues = new Set();\n                            node.children.forEach(n => {\n                                if (n.type !== 'array' && n.type !== 'object') {\n                                    existingValues.add(this.getLabelForValue(getNodeValue(n)));\n                                }\n                            });\n                            c = {\n                                ...collector,\n                                add(suggestion) {\n                                    if (!existingValues.has(suggestion.label)) {\n                                        collector.add(suggestion);\n                                    }\n                                }\n                            };\n                        }\n                        if (Array.isArray(s.schema.items)) {\n                            const index = this.findItemAtOffset(node, document, offset);\n                            if (index < s.schema.items.length) {\n                                this.addSchemaValueCompletions(s.schema.items[index], separatorAfter, c, types);\n                            }\n                        }\n                        else {\n                            this.addSchemaValueCompletions(s.schema.items, separatorAfter, c, types);\n                        }\n                    }\n                    if (parentKey !== undefined) {\n                        let propertyMatched = false;\n                        if (s.schema.properties) {\n                            const propertySchema = s.schema.properties[parentKey];\n                            if (propertySchema) {\n                                propertyMatched = true;\n                                this.addSchemaValueCompletions(propertySchema, separatorAfter, collector, types);\n                            }\n                        }\n                        if (s.schema.patternProperties && !propertyMatched) {\n                            for (const pattern of Object.keys(s.schema.patternProperties)) {\n                                const regex = extendedRegExp(pattern);\n                                if (regex?.test(parentKey)) {\n                                    propertyMatched = true;\n                                    const propertySchema = s.schema.patternProperties[pattern];\n                                    this.addSchemaValueCompletions(propertySchema, separatorAfter, collector, types);\n                                }\n                            }\n                        }\n                        if (s.schema.additionalProperties && !propertyMatched) {\n                            const propertySchema = s.schema.additionalProperties;\n                            this.addSchemaValueCompletions(propertySchema, separatorAfter, collector, types);\n                        }\n                    }\n                }\n            }\n            if (parentKey === '$schema' && !node.parent) {\n                this.addDollarSchemaCompletions(separatorAfter, collector);\n            }\n            if (types['boolean']) {\n                this.addBooleanValueCompletion(true, separatorAfter, collector);\n                this.addBooleanValueCompletion(false, separatorAfter, collector);\n            }\n            if (types['null']) {\n                this.addNullValueCompletion(separatorAfter, collector);\n            }\n        }\n    }\n    getContributedValueCompletions(doc, node, offset, document, collector, collectionPromises) {\n        if (!node) {\n            this.contributions.forEach((contribution) => {\n                const collectPromise = contribution.collectDefaultCompletions(document.uri, collector);\n                if (collectPromise) {\n                    collectionPromises.push(collectPromise);\n                }\n            });\n        }\n        else {\n            if (node.type === 'string' || node.type === 'number' || node.type === 'boolean' || node.type === 'null') {\n                node = node.parent;\n            }\n            if (node && (node.type === 'property') && offset > (node.colonOffset || 0)) {\n                const parentKey = node.keyNode.value;\n                const valueNode = node.valueNode;\n                if ((!valueNode || offset <= (valueNode.offset + valueNode.length)) && node.parent) {\n                    const location = getNodePath(node.parent);\n                    this.contributions.forEach((contribution) => {\n                        const collectPromise = contribution.collectValueCompletions(document.uri, location, parentKey, collector);\n                        if (collectPromise) {\n                            collectionPromises.push(collectPromise);\n                        }\n                    });\n                }\n            }\n        }\n    }\n    addSchemaValueCompletions(schema, separatorAfter, collector, types) {\n        if (typeof schema === 'object') {\n            this.addEnumValueCompletions(schema, separatorAfter, collector);\n            this.addDefaultValueCompletions(schema, separatorAfter, collector);\n            this.collectTypes(schema, types);\n            if (Array.isArray(schema.allOf)) {\n                schema.allOf.forEach(s => this.addSchemaValueCompletions(s, separatorAfter, collector, types));\n            }\n            if (Array.isArray(schema.anyOf)) {\n                schema.anyOf.forEach(s => this.addSchemaValueCompletions(s, separatorAfter, collector, types));\n            }\n            if (Array.isArray(schema.oneOf)) {\n                schema.oneOf.forEach(s => this.addSchemaValueCompletions(s, separatorAfter, collector, types));\n            }\n        }\n    }\n    addDefaultValueCompletions(schema, separatorAfter, collector, arrayDepth = 0) {\n        let hasProposals = false;\n        if (isDefined(schema.default)) {\n            let type = schema.type;\n            let value = schema.default;\n            for (let i = arrayDepth; i > 0; i--) {\n                value = [value];\n                type = 'array';\n            }\n            const completionItem = {\n                kind: this.getSuggestionKind(type),\n                label: this.getLabelForValue(value),\n                insertText: this.getInsertTextForValue(value, separatorAfter),\n                insertTextFormat: InsertTextFormat.Snippet\n            };\n            if (this.doesSupportsLabelDetails()) {\n                completionItem.labelDetails = { description: t('Default value') };\n            }\n            else {\n                completionItem.detail = t('Default value');\n            }\n            collector.add(completionItem);\n            hasProposals = true;\n        }\n        if (Array.isArray(schema.examples)) {\n            schema.examples.forEach(example => {\n                let type = schema.type;\n                let value = example;\n                for (let i = arrayDepth; i > 0; i--) {\n                    value = [value];\n                    type = 'array';\n                }\n                collector.add({\n                    kind: this.getSuggestionKind(type),\n                    label: this.getLabelForValue(value),\n                    insertText: this.getInsertTextForValue(value, separatorAfter),\n                    insertTextFormat: InsertTextFormat.Snippet\n                });\n                hasProposals = true;\n            });\n        }\n        if (Array.isArray(schema.defaultSnippets)) {\n            schema.defaultSnippets.forEach(s => {\n                let type = schema.type;\n                let value = s.body;\n                let label = s.label;\n                let insertText;\n                let filterText;\n                if (isDefined(value)) {\n                    schema.type;\n                    for (let i = arrayDepth; i > 0; i--) {\n                        value = [value];\n                    }\n                    insertText = this.getInsertTextForSnippetValue(value, separatorAfter);\n                    filterText = this.getFilterTextForSnippetValue(value);\n                    label = label || this.getLabelForSnippetValue(value);\n                }\n                else if (typeof s.bodyText === 'string') {\n                    let prefix = '', suffix = '', indent = '';\n                    for (let i = arrayDepth; i > 0; i--) {\n                        prefix = prefix + indent + '[\\n';\n                        suffix = suffix + '\\n' + indent + ']';\n                        indent += '\\t';\n                        type = 'array';\n                    }\n                    insertText = prefix + indent + s.bodyText.split('\\n').join('\\n' + indent) + suffix + separatorAfter;\n                    label = label || insertText,\n                        filterText = insertText.replace(/[\\n]/g, ''); // remove new lines\n                }\n                else {\n                    return;\n                }\n                collector.add({\n                    kind: this.getSuggestionKind(type),\n                    label,\n                    documentation: this.fromMarkup(s.markdownDescription) || s.description,\n                    insertText,\n                    insertTextFormat: InsertTextFormat.Snippet,\n                    filterText\n                });\n                hasProposals = true;\n            });\n        }\n        if (!hasProposals && typeof schema.items === 'object' && !Array.isArray(schema.items) && arrayDepth < 5 /* beware of recursion */) {\n            this.addDefaultValueCompletions(schema.items, separatorAfter, collector, arrayDepth + 1);\n        }\n    }\n    addEnumValueCompletions(schema, separatorAfter, collector) {\n        if (isDefined(schema.const)) {\n            collector.add({\n                kind: this.getSuggestionKind(schema.type),\n                label: this.getLabelForValue(schema.const),\n                insertText: this.getInsertTextForValue(schema.const, separatorAfter),\n                insertTextFormat: InsertTextFormat.Snippet,\n                documentation: this.fromMarkup(schema.markdownDescription) || schema.description\n            });\n        }\n        if (Array.isArray(schema.enum)) {\n            for (let i = 0, length = schema.enum.length; i < length; i++) {\n                const enm = schema.enum[i];\n                let documentation = this.fromMarkup(schema.markdownDescription) || schema.description;\n                if (schema.markdownEnumDescriptions && i < schema.markdownEnumDescriptions.length && this.doesSupportMarkdown()) {\n                    documentation = this.fromMarkup(schema.markdownEnumDescriptions[i]);\n                }\n                else if (schema.enumDescriptions && i < schema.enumDescriptions.length) {\n                    documentation = schema.enumDescriptions[i];\n                }\n                collector.add({\n                    kind: this.getSuggestionKind(schema.type),\n                    label: this.getLabelForValue(enm),\n                    insertText: this.getInsertTextForValue(enm, separatorAfter),\n                    insertTextFormat: InsertTextFormat.Snippet,\n                    documentation\n                });\n            }\n        }\n    }\n    collectTypes(schema, types) {\n        if (Array.isArray(schema.enum) || isDefined(schema.const)) {\n            return;\n        }\n        const type = schema.type;\n        if (Array.isArray(type)) {\n            type.forEach(t => types[t] = true);\n        }\n        else if (type) {\n            types[type] = true;\n        }\n    }\n    addFillerValueCompletions(types, separatorAfter, collector) {\n        if (types['object']) {\n            collector.add({\n                kind: this.getSuggestionKind('object'),\n                label: '{}',\n                insertText: this.getInsertTextForGuessedValue({}, separatorAfter),\n                insertTextFormat: InsertTextFormat.Snippet,\n                detail: t('New object'),\n                documentation: ''\n            });\n        }\n        if (types['array']) {\n            collector.add({\n                kind: this.getSuggestionKind('array'),\n                label: '[]',\n                insertText: this.getInsertTextForGuessedValue([], separatorAfter),\n                insertTextFormat: InsertTextFormat.Snippet,\n                detail: t('New array'),\n                documentation: ''\n            });\n        }\n    }\n    addBooleanValueCompletion(value, separatorAfter, collector) {\n        collector.add({\n            kind: this.getSuggestionKind('boolean'),\n            label: value ? 'true' : 'false',\n            insertText: this.getInsertTextForValue(value, separatorAfter),\n            insertTextFormat: InsertTextFormat.Snippet,\n            documentation: ''\n        });\n    }\n    addNullValueCompletion(separatorAfter, collector) {\n        collector.add({\n            kind: this.getSuggestionKind('null'),\n            label: 'null',\n            insertText: 'null' + separatorAfter,\n            insertTextFormat: InsertTextFormat.Snippet,\n            documentation: ''\n        });\n    }\n    addDollarSchemaCompletions(separatorAfter, collector) {\n        const schemaIds = this.schemaService.getRegisteredSchemaIds(schema => schema === 'http' || schema === 'https');\n        schemaIds.forEach(schemaId => {\n            if (schemaId.startsWith('http://json-schema.org/draft-')) {\n                schemaId = schemaId + '#';\n            }\n            collector.add({\n                kind: CompletionItemKind.Module,\n                label: this.getLabelForValue(schemaId),\n                filterText: this.getFilterTextForValue(schemaId),\n                insertText: this.getInsertTextForValue(schemaId, separatorAfter),\n                insertTextFormat: InsertTextFormat.Snippet, documentation: ''\n            });\n        });\n    }\n    getLabelForValue(value) {\n        return JSON.stringify(value);\n    }\n    getValueFromLabel(value) {\n        return JSON.parse(value);\n    }\n    getFilterTextForValue(value) {\n        return JSON.stringify(value);\n    }\n    getFilterTextForSnippetValue(value) {\n        return JSON.stringify(value).replace(/\\$\\{\\d+:([^}]+)\\}|\\$\\d+/g, '$1');\n    }\n    getLabelForSnippetValue(value) {\n        const label = JSON.stringify(value);\n        return label.replace(/\\$\\{\\d+:([^}]+)\\}|\\$\\d+/g, '$1');\n    }\n    getInsertTextForPlainText(text) {\n        return text.replace(/[\\\\\\$\\}]/g, '\\\\$&'); // escape $, \\ and }\n    }\n    getInsertTextForValue(value, separatorAfter) {\n        const text = JSON.stringify(value, null, '\\t');\n        if (text === '{}') {\n            return '{$1}' + separatorAfter;\n        }\n        else if (text === '[]') {\n            return '[$1]' + separatorAfter;\n        }\n        return this.getInsertTextForPlainText(text + separatorAfter);\n    }\n    getInsertTextForSnippetValue(value, separatorAfter) {\n        const replacer = (value) => {\n            if (typeof value === 'string') {\n                if (value[0] === '^') {\n                    return value.substr(1);\n                }\n            }\n            return JSON.stringify(value);\n        };\n        return stringifyObject(value, '', replacer) + separatorAfter;\n    }\n    getInsertTextForGuessedValue(value, separatorAfter) {\n        switch (typeof value) {\n            case 'object':\n                if (value === null) {\n                    return '${1:null}' + separatorAfter;\n                }\n                return this.getInsertTextForValue(value, separatorAfter);\n            case 'string':\n                let snippetValue = JSON.stringify(value);\n                snippetValue = snippetValue.substr(1, snippetValue.length - 2); // remove quotes\n                snippetValue = this.getInsertTextForPlainText(snippetValue); // escape \\ and }\n                return '\"${1:' + snippetValue + '}\"' + separatorAfter;\n            case 'number':\n            case 'boolean':\n                return '${1:' + JSON.stringify(value) + '}' + separatorAfter;\n        }\n        return this.getInsertTextForValue(value, separatorAfter);\n    }\n    getSuggestionKind(type) {\n        if (Array.isArray(type)) {\n            const array = type;\n            type = array.length > 0 ? array[0] : undefined;\n        }\n        if (!type) {\n            return CompletionItemKind.Value;\n        }\n        switch (type) {\n            case 'string': return CompletionItemKind.Value;\n            case 'object': return CompletionItemKind.Module;\n            case 'property': return CompletionItemKind.Property;\n            default: return CompletionItemKind.Value;\n        }\n    }\n    getLabelTextForMatchingNode(node, document) {\n        switch (node.type) {\n            case 'array':\n                return '[]';\n            case 'object':\n                return '{}';\n            default:\n                const content = document.getText().substr(node.offset, node.length);\n                return content;\n        }\n    }\n    getInsertTextForMatchingNode(node, document, separatorAfter) {\n        switch (node.type) {\n            case 'array':\n                return this.getInsertTextForValue([], separatorAfter);\n            case 'object':\n                return this.getInsertTextForValue({}, separatorAfter);\n            default:\n                const content = document.getText().substr(node.offset, node.length) + separatorAfter;\n                return this.getInsertTextForPlainText(content);\n        }\n    }\n    getInsertTextForProperty(key, propertySchema, addValue, separatorAfter) {\n        const propertyText = this.getInsertTextForValue(key, '');\n        if (!addValue) {\n            return propertyText;\n        }\n        const resultText = propertyText + ': ';\n        let value;\n        let nValueProposals = 0;\n        if (propertySchema) {\n            if (Array.isArray(propertySchema.defaultSnippets)) {\n                if (propertySchema.defaultSnippets.length === 1) {\n                    const body = propertySchema.defaultSnippets[0].body;\n                    if (isDefined(body)) {\n                        value = this.getInsertTextForSnippetValue(body, '');\n                    }\n                }\n                nValueProposals += propertySchema.defaultSnippets.length;\n            }\n            if (propertySchema.enum) {\n                if (!value && propertySchema.enum.length === 1) {\n                    value = this.getInsertTextForGuessedValue(propertySchema.enum[0], '');\n                }\n                nValueProposals += propertySchema.enum.length;\n            }\n            if (isDefined(propertySchema.const)) {\n                if (!value) {\n                    value = this.getInsertTextForGuessedValue(propertySchema.const, '');\n                }\n                nValueProposals++;\n            }\n            if (isDefined(propertySchema.default)) {\n                if (!value) {\n                    value = this.getInsertTextForGuessedValue(propertySchema.default, '');\n                }\n                nValueProposals++;\n            }\n            if (Array.isArray(propertySchema.examples) && propertySchema.examples.length) {\n                if (!value) {\n                    value = this.getInsertTextForGuessedValue(propertySchema.examples[0], '');\n                }\n                nValueProposals += propertySchema.examples.length;\n            }\n            if (nValueProposals === 0) {\n                let type = Array.isArray(propertySchema.type) ? propertySchema.type[0] : propertySchema.type;\n                if (!type) {\n                    if (propertySchema.properties) {\n                        type = 'object';\n                    }\n                    else if (propertySchema.items) {\n                        type = 'array';\n                    }\n                }\n                switch (type) {\n                    case 'boolean':\n                        value = '$1';\n                        break;\n                    case 'string':\n                        value = '\"$1\"';\n                        break;\n                    case 'object':\n                        value = '{$1}';\n                        break;\n                    case 'array':\n                        value = '[$1]';\n                        break;\n                    case 'number':\n                    case 'integer':\n                        value = '${1:0}';\n                        break;\n                    case 'null':\n                        value = '${1:null}';\n                        break;\n                    default:\n                        return propertyText;\n                }\n            }\n        }\n        if (!value || nValueProposals > 1) {\n            value = '$1';\n        }\n        return resultText + value + separatorAfter;\n    }\n    getCurrentWord(document, offset) {\n        let i = offset - 1;\n        const text = document.getText();\n        while (i >= 0 && ' \\t\\n\\r\\v\":{[,]}'.indexOf(text.charAt(i)) === -1) {\n            i--;\n        }\n        return text.substring(i + 1, offset);\n    }\n    evaluateSeparatorAfter(document, offset) {\n        const scanner = createScanner(document.getText(), true);\n        scanner.setPosition(offset);\n        const token = scanner.scan();\n        switch (token) {\n            case 5 /* Json.SyntaxKind.CommaToken */:\n            case 2 /* Json.SyntaxKind.CloseBraceToken */:\n            case 4 /* Json.SyntaxKind.CloseBracketToken */:\n            case 17 /* Json.SyntaxKind.EOF */:\n                return '';\n            default:\n                return ',';\n        }\n    }\n    findItemAtOffset(node, document, offset) {\n        const scanner = createScanner(document.getText(), true);\n        const children = node.items;\n        for (let i = children.length - 1; i >= 0; i--) {\n            const child = children[i];\n            if (offset > child.offset + child.length) {\n                scanner.setPosition(child.offset + child.length);\n                const token = scanner.scan();\n                if (token === 5 /* Json.SyntaxKind.CommaToken */ && offset >= scanner.getTokenOffset() + scanner.getTokenLength()) {\n                    return i + 1;\n                }\n                return i;\n            }\n            else if (offset >= child.offset) {\n                return i;\n            }\n        }\n        return 0;\n    }\n    isInComment(document, start, offset) {\n        const scanner = createScanner(document.getText(), false);\n        scanner.setPosition(start);\n        let token = scanner.scan();\n        while (token !== 17 /* Json.SyntaxKind.EOF */ && (scanner.getTokenOffset() + scanner.getTokenLength() < offset)) {\n            token = scanner.scan();\n        }\n        return (token === 12 /* Json.SyntaxKind.LineCommentTrivia */ || token === 13 /* Json.SyntaxKind.BlockCommentTrivia */) && scanner.getTokenOffset() <= offset;\n    }\n    fromMarkup(markupString) {\n        if (markupString && this.doesSupportMarkdown()) {\n            return {\n                kind: MarkupKind.Markdown,\n                value: markupString\n            };\n        }\n        return undefined;\n    }\n    doesSupportMarkdown() {\n        if (!isDefined(this.supportsMarkdown)) {\n            const documentationFormat = this.clientCapabilities.textDocument?.completion?.completionItem?.documentationFormat;\n            this.supportsMarkdown = Array.isArray(documentationFormat) && documentationFormat.indexOf(MarkupKind.Markdown) !== -1;\n        }\n        return this.supportsMarkdown;\n    }\n    doesSupportsCommitCharacters() {\n        if (!isDefined(this.supportsCommitCharacters)) {\n            this.labelDetailsSupport = this.clientCapabilities.textDocument?.completion?.completionItem?.commitCharactersSupport;\n        }\n        return this.supportsCommitCharacters;\n    }\n    doesSupportsLabelDetails() {\n        if (!isDefined(this.labelDetailsSupport)) {\n            this.labelDetailsSupport = this.clientCapabilities.textDocument?.completion?.completionItem?.labelDetailsSupport;\n        }\n        return this.labelDetailsSupport;\n    }\n}\n\nexport { JSONCompletion };\n","import { getNodePath, getNodeValue } from '../parser/jsonParser.js';\nimport '../jsonLanguageTypes.js';\nimport { Range } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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 *--------------------------------------------------------------------------------------------*/\nclass JSONHover {\n    constructor(schemaService, contributions = [], promiseConstructor) {\n        this.schemaService = schemaService;\n        this.contributions = contributions;\n        this.promise = promiseConstructor || Promise;\n    }\n    doHover(document, position, doc) {\n        const offset = document.offsetAt(position);\n        let node = doc.getNodeFromOffset(offset);\n        if (!node || (node.type === 'object' || node.type === 'array') && offset > node.offset + 1 && offset < node.offset + node.length - 1) {\n            return this.promise.resolve(null);\n        }\n        const hoverRangeNode = node;\n        // use the property description when hovering over an object key\n        if (node.type === 'string') {\n            const parent = node.parent;\n            if (parent && parent.type === 'property' && parent.keyNode === node) {\n                node = parent.valueNode;\n                if (!node) {\n                    return this.promise.resolve(null);\n                }\n            }\n        }\n        const hoverRange = Range.create(document.positionAt(hoverRangeNode.offset), document.positionAt(hoverRangeNode.offset + hoverRangeNode.length));\n        const createHover = (contents) => {\n            const result = {\n                contents: contents,\n                range: hoverRange\n            };\n            return result;\n        };\n        const location = getNodePath(node);\n        for (let i = this.contributions.length - 1; i >= 0; i--) {\n            const contribution = this.contributions[i];\n            const promise = contribution.getInfoContribution(document.uri, location);\n            if (promise) {\n                return promise.then(htmlContent => createHover(htmlContent));\n            }\n        }\n        return this.schemaService.getSchemaForResource(document.uri, doc).then((schema) => {\n            if (schema && node) {\n                const matchingSchemas = doc.getMatchingSchemas(schema.schema, node.offset);\n                let title = undefined;\n                let markdownDescription = undefined;\n                let markdownEnumValueDescription = undefined, enumValue = undefined;\n                matchingSchemas.every((s) => {\n                    if (s.node === node && !s.inverted && s.schema) {\n                        title = title || s.schema.title;\n                        markdownDescription = markdownDescription || s.schema.markdownDescription || toMarkdown(s.schema.description);\n                        if (s.schema.enum) {\n                            const idx = s.schema.enum.indexOf(getNodeValue(node));\n                            if (s.schema.markdownEnumDescriptions) {\n                                markdownEnumValueDescription = s.schema.markdownEnumDescriptions[idx];\n                            }\n                            else if (s.schema.enumDescriptions) {\n                                markdownEnumValueDescription = toMarkdown(s.schema.enumDescriptions[idx]);\n                            }\n                            if (markdownEnumValueDescription) {\n                                enumValue = s.schema.enum[idx];\n                                if (typeof enumValue !== 'string') {\n                                    enumValue = JSON.stringify(enumValue);\n                                }\n                            }\n                        }\n                    }\n                    return true;\n                });\n                let result = '';\n                if (title) {\n                    result = toMarkdown(title);\n                }\n                if (markdownDescription) {\n                    if (result.length > 0) {\n                        result += \"\\n\\n\";\n                    }\n                    result += markdownDescription;\n                }\n                if (markdownEnumValueDescription) {\n                    if (result.length > 0) {\n                        result += \"\\n\\n\";\n                    }\n                    result += `\\`${toMarkdownCodeBlock(enumValue)}\\`: ${markdownEnumValueDescription}`;\n                }\n                return createHover([result]);\n            }\n            return null;\n        });\n    }\n}\nfunction toMarkdown(plain) {\n    if (plain) {\n        const res = plain.replace(/([^\\n\\r])(\\r?\\n)([^\\n\\r])/gm, '$1\\n\\n$3'); // single new lines to \\n\\n (Markdown paragraph)\n        return res.replace(/[\\\\`*_{}[\\]()#+\\-.!]/g, \"\\\\$&\"); // escape markdown syntax tokens: http://daringfireball.net/projects/markdown/syntax#backslash\n    }\n    return undefined;\n}\nfunction toMarkdownCodeBlock(content) {\n    // see https://daringfireball.net/projects/markdown/syntax#precode\n    if (content.indexOf('`') !== -1) {\n        return '`` ' + content + ' ``';\n    }\n    return content;\n}\n\nexport { JSONHover };\n","import { ErrorCode } from '../jsonLanguageTypes.js';\nimport { t } from '../../../../@vscode/l10n/dist/browser.js';\nimport { isBoolean } from '../utils/objects.js';\nimport { DiagnosticSeverity, Diagnostic, Range } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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 *--------------------------------------------------------------------------------------------*/\nclass JSONValidation {\n    constructor(jsonSchemaService, promiseConstructor) {\n        this.jsonSchemaService = jsonSchemaService;\n        this.promise = promiseConstructor;\n        this.validationEnabled = true;\n    }\n    configure(raw) {\n        if (raw) {\n            this.validationEnabled = raw.validate !== false;\n            this.commentSeverity = raw.allowComments ? undefined : DiagnosticSeverity.Error;\n        }\n    }\n    doValidation(textDocument, jsonDocument, documentSettings, schema) {\n        if (!this.validationEnabled) {\n            return this.promise.resolve([]);\n        }\n        const diagnostics = [];\n        const added = {};\n        const addProblem = (problem) => {\n            // remove duplicated messages\n            const signature = problem.range.start.line + ' ' + problem.range.start.character + ' ' + problem.message;\n            if (!added[signature]) {\n                added[signature] = true;\n                diagnostics.push(problem);\n            }\n        };\n        const getDiagnostics = (schema) => {\n            let trailingCommaSeverity = documentSettings?.trailingCommas ? toDiagnosticSeverity(documentSettings.trailingCommas) : DiagnosticSeverity.Error;\n            let commentSeverity = documentSettings?.comments ? toDiagnosticSeverity(documentSettings.comments) : this.commentSeverity;\n            let schemaValidation = documentSettings?.schemaValidation ? toDiagnosticSeverity(documentSettings.schemaValidation) : DiagnosticSeverity.Warning;\n            let schemaRequest = documentSettings?.schemaRequest ? toDiagnosticSeverity(documentSettings.schemaRequest) : DiagnosticSeverity.Warning;\n            if (schema) {\n                const addSchemaProblem = (errorMessage, errorCode) => {\n                    if (jsonDocument.root && schemaRequest) {\n                        const astRoot = jsonDocument.root;\n                        const property = astRoot.type === 'object' ? astRoot.properties[0] : undefined;\n                        if (property && property.keyNode.value === '$schema') {\n                            const node = property.valueNode || property;\n                            const range = Range.create(textDocument.positionAt(node.offset), textDocument.positionAt(node.offset + node.length));\n                            addProblem(Diagnostic.create(range, errorMessage, schemaRequest, errorCode));\n                        }\n                        else {\n                            const range = Range.create(textDocument.positionAt(astRoot.offset), textDocument.positionAt(astRoot.offset + 1));\n                            addProblem(Diagnostic.create(range, errorMessage, schemaRequest, errorCode));\n                        }\n                    }\n                };\n                if (schema.errors.length) {\n                    addSchemaProblem(schema.errors[0], ErrorCode.SchemaResolveError);\n                }\n                else if (schemaValidation) {\n                    for (const warning of schema.warnings) {\n                        addSchemaProblem(warning, ErrorCode.SchemaUnsupportedFeature);\n                    }\n                    const semanticErrors = jsonDocument.validate(textDocument, schema.schema, schemaValidation, documentSettings?.schemaDraft);\n                    if (semanticErrors) {\n                        semanticErrors.forEach(addProblem);\n                    }\n                }\n                if (schemaAllowsComments(schema.schema)) {\n                    commentSeverity = undefined;\n                }\n                if (schemaAllowsTrailingCommas(schema.schema)) {\n                    trailingCommaSeverity = undefined;\n                }\n            }\n            for (const p of jsonDocument.syntaxErrors) {\n                if (p.code === ErrorCode.TrailingComma) {\n                    if (typeof trailingCommaSeverity !== 'number') {\n                        continue;\n                    }\n                    p.severity = trailingCommaSeverity;\n                }\n                addProblem(p);\n            }\n            if (typeof commentSeverity === 'number') {\n                const message = t('Comments are not permitted in JSON.');\n                jsonDocument.comments.forEach(c => {\n                    addProblem(Diagnostic.create(c, message, commentSeverity, ErrorCode.CommentNotPermitted));\n                });\n            }\n            return diagnostics;\n        };\n        if (schema) {\n            const uri = schema.id || ('schemaservice://untitled/' + idCounter++);\n            const handle = this.jsonSchemaService.registerExternalSchema({ uri, schema });\n            return handle.getResolvedSchema().then(resolvedSchema => {\n                return getDiagnostics(resolvedSchema);\n            });\n        }\n        return this.jsonSchemaService.getSchemaForResource(textDocument.uri, jsonDocument).then(schema => {\n            return getDiagnostics(schema);\n        });\n    }\n    getLanguageStatus(textDocument, jsonDocument) {\n        return { schemas: this.jsonSchemaService.getSchemaURIsForResource(textDocument.uri, jsonDocument) };\n    }\n}\nlet idCounter = 0;\nfunction schemaAllowsComments(schemaRef) {\n    if (schemaRef && typeof schemaRef === 'object') {\n        if (isBoolean(schemaRef.allowComments)) {\n            return schemaRef.allowComments;\n        }\n        if (schemaRef.allOf) {\n            for (const schema of schemaRef.allOf) {\n                const allow = schemaAllowsComments(schema);\n                if (isBoolean(allow)) {\n                    return allow;\n                }\n            }\n        }\n    }\n    return undefined;\n}\nfunction schemaAllowsTrailingCommas(schemaRef) {\n    if (schemaRef && typeof schemaRef === 'object') {\n        if (isBoolean(schemaRef.allowTrailingCommas)) {\n            return schemaRef.allowTrailingCommas;\n        }\n        const deprSchemaRef = schemaRef;\n        if (isBoolean(deprSchemaRef['allowsTrailingCommas'])) { // deprecated\n            return deprSchemaRef['allowsTrailingCommas'];\n        }\n        if (schemaRef.allOf) {\n            for (const schema of schemaRef.allOf) {\n                const allow = schemaAllowsTrailingCommas(schema);\n                if (isBoolean(allow)) {\n                    return allow;\n                }\n            }\n        }\n    }\n    return undefined;\n}\nfunction toDiagnosticSeverity(severityLevel) {\n    switch (severityLevel) {\n        case 'error': return DiagnosticSeverity.Error;\n        case 'warning': return DiagnosticSeverity.Warning;\n        case 'ignore': return undefined;\n    }\n    return undefined;\n}\n\nexport { JSONValidation };\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 *--------------------------------------------------------------------------------------------*/\nconst Digit0 = 48;\nconst Digit9 = 57;\nconst A = 65;\nconst a = 97;\nconst f = 102;\nfunction hexDigit(charCode) {\n    if (charCode < Digit0) {\n        return 0;\n    }\n    if (charCode <= Digit9) {\n        return charCode - Digit0;\n    }\n    if (charCode < a) {\n        charCode += (a - A);\n    }\n    if (charCode >= a && charCode <= f) {\n        return charCode - a + 10;\n    }\n    return 0;\n}\nfunction colorFromHex(text) {\n    if (text[0] !== '#') {\n        return undefined;\n    }\n    switch (text.length) {\n        case 4:\n            return {\n                red: (hexDigit(text.charCodeAt(1)) * 0x11) / 255.0,\n                green: (hexDigit(text.charCodeAt(2)) * 0x11) / 255.0,\n                blue: (hexDigit(text.charCodeAt(3)) * 0x11) / 255.0,\n                alpha: 1\n            };\n        case 5:\n            return {\n                red: (hexDigit(text.charCodeAt(1)) * 0x11) / 255.0,\n                green: (hexDigit(text.charCodeAt(2)) * 0x11) / 255.0,\n                blue: (hexDigit(text.charCodeAt(3)) * 0x11) / 255.0,\n                alpha: (hexDigit(text.charCodeAt(4)) * 0x11) / 255.0,\n            };\n        case 7:\n            return {\n                red: (hexDigit(text.charCodeAt(1)) * 0x10 + hexDigit(text.charCodeAt(2))) / 255.0,\n                green: (hexDigit(text.charCodeAt(3)) * 0x10 + hexDigit(text.charCodeAt(4))) / 255.0,\n                blue: (hexDigit(text.charCodeAt(5)) * 0x10 + hexDigit(text.charCodeAt(6))) / 255.0,\n                alpha: 1\n            };\n        case 9:\n            return {\n                red: (hexDigit(text.charCodeAt(1)) * 0x10 + hexDigit(text.charCodeAt(2))) / 255.0,\n                green: (hexDigit(text.charCodeAt(3)) * 0x10 + hexDigit(text.charCodeAt(4))) / 255.0,\n                blue: (hexDigit(text.charCodeAt(5)) * 0x10 + hexDigit(text.charCodeAt(6))) / 255.0,\n                alpha: (hexDigit(text.charCodeAt(7)) * 0x10 + hexDigit(text.charCodeAt(8))) / 255.0\n            };\n    }\n    return undefined;\n}\n\nexport { colorFromHex, hexDigit };\n","import { getNodeValue } from '../parser/jsonParser.js';\nimport { endsWith } from '../utils/strings.js';\nimport { colorFromHex } from '../utils/colors.js';\nimport { t } from '../../../../@vscode/l10n/dist/browser.js';\nimport '../jsonLanguageTypes.js';\nimport { Location, SymbolKind, TextEdit, Range } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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 *--------------------------------------------------------------------------------------------*/\nclass JSONDocumentSymbols {\n    constructor(schemaService) {\n        this.schemaService = schemaService;\n    }\n    findDocumentSymbols(document, doc, context = { resultLimit: Number.MAX_VALUE }) {\n        const root = doc.root;\n        if (!root) {\n            return [];\n        }\n        let limit = context.resultLimit || Number.MAX_VALUE;\n        // special handling for key bindings\n        const resourceString = document.uri;\n        if ((resourceString === 'vscode://defaultsettings/keybindings.json') || endsWith(resourceString.toLowerCase(), '/user/keybindings.json')) {\n            if (root.type === 'array') {\n                const result = [];\n                for (const item of root.items) {\n                    if (item.type === 'object') {\n                        for (const property of item.properties) {\n                            if (property.keyNode.value === 'key' && property.valueNode) {\n                                const location = Location.create(document.uri, getRange(document, item));\n                                result.push({ name: getName(property.valueNode), kind: SymbolKind.Function, location: location });\n                                limit--;\n                                if (limit <= 0) {\n                                    if (context && context.onResultLimitExceeded) {\n                                        context.onResultLimitExceeded(resourceString);\n                                    }\n                                    return result;\n                                }\n                            }\n                        }\n                    }\n                }\n                return result;\n            }\n        }\n        const toVisit = [\n            { node: root, containerName: '' }\n        ];\n        let nextToVisit = 0;\n        let limitExceeded = false;\n        const result = [];\n        const collectOutlineEntries = (node, containerName) => {\n            if (node.type === 'array') {\n                node.items.forEach(node => {\n                    if (node) {\n                        toVisit.push({ node, containerName });\n                    }\n                });\n            }\n            else if (node.type === 'object') {\n                node.properties.forEach((property) => {\n                    const valueNode = property.valueNode;\n                    if (valueNode) {\n                        if (limit > 0) {\n                            limit--;\n                            const location = Location.create(document.uri, getRange(document, property));\n                            const childContainerName = containerName ? containerName + '.' + property.keyNode.value : property.keyNode.value;\n                            result.push({ name: this.getKeyLabel(property), kind: this.getSymbolKind(valueNode.type), location: location, containerName: containerName });\n                            toVisit.push({ node: valueNode, containerName: childContainerName });\n                        }\n                        else {\n                            limitExceeded = true;\n                        }\n                    }\n                });\n            }\n        };\n        // breath first traversal\n        while (nextToVisit < toVisit.length) {\n            const next = toVisit[nextToVisit++];\n            collectOutlineEntries(next.node, next.containerName);\n        }\n        if (limitExceeded && context && context.onResultLimitExceeded) {\n            context.onResultLimitExceeded(resourceString);\n        }\n        return result;\n    }\n    findDocumentSymbols2(document, doc, context = { resultLimit: Number.MAX_VALUE }) {\n        const root = doc.root;\n        if (!root) {\n            return [];\n        }\n        let limit = context.resultLimit || Number.MAX_VALUE;\n        // special handling for key bindings\n        const resourceString = document.uri;\n        if ((resourceString === 'vscode://defaultsettings/keybindings.json') || endsWith(resourceString.toLowerCase(), '/user/keybindings.json')) {\n            if (root.type === 'array') {\n                const result = [];\n                for (const item of root.items) {\n                    if (item.type === 'object') {\n                        for (const property of item.properties) {\n                            if (property.keyNode.value === 'key' && property.valueNode) {\n                                const range = getRange(document, item);\n                                const selectionRange = getRange(document, property.keyNode);\n                                result.push({ name: getName(property.valueNode), kind: SymbolKind.Function, range, selectionRange });\n                                limit--;\n                                if (limit <= 0) {\n                                    if (context && context.onResultLimitExceeded) {\n                                        context.onResultLimitExceeded(resourceString);\n                                    }\n                                    return result;\n                                }\n                            }\n                        }\n                    }\n                }\n                return result;\n            }\n        }\n        const result = [];\n        const toVisit = [\n            { node: root, result }\n        ];\n        let nextToVisit = 0;\n        let limitExceeded = false;\n        const collectOutlineEntries = (node, result) => {\n            if (node.type === 'array') {\n                node.items.forEach((node, index) => {\n                    if (node) {\n                        if (limit > 0) {\n                            limit--;\n                            const range = getRange(document, node);\n                            const selectionRange = range;\n                            const name = String(index);\n                            const symbol = { name, kind: this.getSymbolKind(node.type), range, selectionRange, children: [] };\n                            result.push(symbol);\n                            toVisit.push({ result: symbol.children, node });\n                        }\n                        else {\n                            limitExceeded = true;\n                        }\n                    }\n                });\n            }\n            else if (node.type === 'object') {\n                node.properties.forEach((property) => {\n                    const valueNode = property.valueNode;\n                    if (valueNode) {\n                        if (limit > 0) {\n                            limit--;\n                            const range = getRange(document, property);\n                            const selectionRange = getRange(document, property.keyNode);\n                            const children = [];\n                            const symbol = { name: this.getKeyLabel(property), kind: this.getSymbolKind(valueNode.type), range, selectionRange, children, detail: this.getDetail(valueNode) };\n                            result.push(symbol);\n                            toVisit.push({ result: children, node: valueNode });\n                        }\n                        else {\n                            limitExceeded = true;\n                        }\n                    }\n                });\n            }\n        };\n        // breath first traversal\n        while (nextToVisit < toVisit.length) {\n            const next = toVisit[nextToVisit++];\n            collectOutlineEntries(next.node, next.result);\n        }\n        if (limitExceeded && context && context.onResultLimitExceeded) {\n            context.onResultLimitExceeded(resourceString);\n        }\n        return result;\n    }\n    getSymbolKind(nodeType) {\n        switch (nodeType) {\n            case 'object':\n                return SymbolKind.Module;\n            case 'string':\n                return SymbolKind.String;\n            case 'number':\n                return SymbolKind.Number;\n            case 'array':\n                return SymbolKind.Array;\n            case 'boolean':\n                return SymbolKind.Boolean;\n            default: // 'null'\n                return SymbolKind.Variable;\n        }\n    }\n    getKeyLabel(property) {\n        let name = property.keyNode.value;\n        if (name) {\n            name = name.replace(/[\\n]/g, '↵');\n        }\n        if (name && name.trim()) {\n            return name;\n        }\n        return `\"${name}\"`;\n    }\n    getDetail(node) {\n        if (!node) {\n            return undefined;\n        }\n        if (node.type === 'boolean' || node.type === 'number' || node.type === 'null' || node.type === 'string') {\n            return String(node.value);\n        }\n        else {\n            if (node.type === 'array') {\n                return node.children.length ? undefined : '[]';\n            }\n            else if (node.type === 'object') {\n                return node.children.length ? undefined : '{}';\n            }\n        }\n        return undefined;\n    }\n    findDocumentColors(document, doc, context) {\n        return this.schemaService.getSchemaForResource(document.uri, doc).then(schema => {\n            const result = [];\n            if (schema) {\n                let limit = context && typeof context.resultLimit === 'number' ? context.resultLimit : Number.MAX_VALUE;\n                const matchingSchemas = doc.getMatchingSchemas(schema.schema);\n                const visitedNode = {};\n                for (const s of matchingSchemas) {\n                    if (!s.inverted && s.schema && (s.schema.format === 'color' || s.schema.format === 'color-hex') && s.node && s.node.type === 'string') {\n                        const nodeId = String(s.node.offset);\n                        if (!visitedNode[nodeId]) {\n                            const color = colorFromHex(getNodeValue(s.node));\n                            if (color) {\n                                const range = getRange(document, s.node);\n                                result.push({ color, range });\n                            }\n                            visitedNode[nodeId] = true;\n                            limit--;\n                            if (limit <= 0) {\n                                if (context && context.onResultLimitExceeded) {\n                                    context.onResultLimitExceeded(document.uri);\n                                }\n                                return result;\n                            }\n                        }\n                    }\n                }\n            }\n            return result;\n        });\n    }\n    getColorPresentations(document, doc, color, range) {\n        const result = [];\n        const red256 = Math.round(color.red * 255), green256 = Math.round(color.green * 255), blue256 = Math.round(color.blue * 255);\n        function toTwoDigitHex(n) {\n            const r = n.toString(16);\n            return r.length !== 2 ? '0' + r : r;\n        }\n        let label;\n        if (color.alpha === 1) {\n            label = `#${toTwoDigitHex(red256)}${toTwoDigitHex(green256)}${toTwoDigitHex(blue256)}`;\n        }\n        else {\n            label = `#${toTwoDigitHex(red256)}${toTwoDigitHex(green256)}${toTwoDigitHex(blue256)}${toTwoDigitHex(Math.round(color.alpha * 255))}`;\n        }\n        result.push({ label: label, textEdit: TextEdit.replace(range, JSON.stringify(label)) });\n        return result;\n    }\n}\nfunction getRange(document, node) {\n    return Range.create(document.positionAt(node.offset), document.positionAt(node.offset + node.length));\n}\nfunction getName(node) {\n    return getNodeValue(node) || t('<empty>');\n}\n\nexport { JSONDocumentSymbols };\n","import { t } from '../../../../@vscode/l10n/dist/browser.js';\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 *--------------------------------------------------------------------------------------------*/\nconst schemaContributions = {\n    schemaAssociations: [],\n    schemas: {\n        // bundle the schema-schema to include (localized) descriptions\n        'http://json-schema.org/draft-04/schema#': {\n            '$schema': 'http://json-schema.org/draft-04/schema#',\n            'definitions': {\n                'schemaArray': {\n                    'type': 'array',\n                    'minItems': 1,\n                    'items': {\n                        '$ref': '#'\n                    }\n                },\n                'positiveInteger': {\n                    'type': 'integer',\n                    'minimum': 0\n                },\n                'positiveIntegerDefault0': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/positiveInteger'\n                        },\n                        {\n                            'default': 0\n                        }\n                    ]\n                },\n                'simpleTypes': {\n                    'type': 'string',\n                    'enum': [\n                        'array',\n                        'boolean',\n                        'integer',\n                        'null',\n                        'number',\n                        'object',\n                        'string'\n                    ]\n                },\n                'stringArray': {\n                    'type': 'array',\n                    'items': {\n                        'type': 'string'\n                    },\n                    'minItems': 1,\n                    'uniqueItems': true\n                }\n            },\n            'type': 'object',\n            'properties': {\n                'id': {\n                    'type': 'string',\n                    'format': 'uri'\n                },\n                '$schema': {\n                    'type': 'string',\n                    'format': 'uri'\n                },\n                'title': {\n                    'type': 'string'\n                },\n                'description': {\n                    'type': 'string'\n                },\n                'default': {},\n                'multipleOf': {\n                    'type': 'number',\n                    'minimum': 0,\n                    'exclusiveMinimum': true\n                },\n                'maximum': {\n                    'type': 'number'\n                },\n                'exclusiveMaximum': {\n                    'type': 'boolean',\n                    'default': false\n                },\n                'minimum': {\n                    'type': 'number'\n                },\n                'exclusiveMinimum': {\n                    'type': 'boolean',\n                    'default': false\n                },\n                'maxLength': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/positiveInteger'\n                        }\n                    ]\n                },\n                'minLength': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/positiveIntegerDefault0'\n                        }\n                    ]\n                },\n                'pattern': {\n                    'type': 'string',\n                    'format': 'regex'\n                },\n                'additionalItems': {\n                    'anyOf': [\n                        {\n                            'type': 'boolean'\n                        },\n                        {\n                            '$ref': '#'\n                        }\n                    ],\n                    'default': {}\n                },\n                'items': {\n                    'anyOf': [\n                        {\n                            '$ref': '#'\n                        },\n                        {\n                            '$ref': '#/definitions/schemaArray'\n                        }\n                    ],\n                    'default': {}\n                },\n                'maxItems': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/positiveInteger'\n                        }\n                    ]\n                },\n                'minItems': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/positiveIntegerDefault0'\n                        }\n                    ]\n                },\n                'uniqueItems': {\n                    'type': 'boolean',\n                    'default': false\n                },\n                'maxProperties': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/positiveInteger'\n                        }\n                    ]\n                },\n                'minProperties': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/positiveIntegerDefault0'\n                        }\n                    ]\n                },\n                'required': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/stringArray'\n                        }\n                    ]\n                },\n                'additionalProperties': {\n                    'anyOf': [\n                        {\n                            'type': 'boolean'\n                        },\n                        {\n                            '$ref': '#'\n                        }\n                    ],\n                    'default': {}\n                },\n                'definitions': {\n                    'type': 'object',\n                    'additionalProperties': {\n                        '$ref': '#'\n                    },\n                    'default': {}\n                },\n                'properties': {\n                    'type': 'object',\n                    'additionalProperties': {\n                        '$ref': '#'\n                    },\n                    'default': {}\n                },\n                'patternProperties': {\n                    'type': 'object',\n                    'additionalProperties': {\n                        '$ref': '#'\n                    },\n                    'default': {}\n                },\n                'dependencies': {\n                    'type': 'object',\n                    'additionalProperties': {\n                        'anyOf': [\n                            {\n                                '$ref': '#'\n                            },\n                            {\n                                '$ref': '#/definitions/stringArray'\n                            }\n                        ]\n                    }\n                },\n                'enum': {\n                    'type': 'array',\n                    'minItems': 1,\n                    'uniqueItems': true\n                },\n                'type': {\n                    'anyOf': [\n                        {\n                            '$ref': '#/definitions/simpleTypes'\n                        },\n                        {\n                            'type': 'array',\n                            'items': {\n                                '$ref': '#/definitions/simpleTypes'\n                            },\n                            'minItems': 1,\n                            'uniqueItems': true\n                        }\n                    ]\n                },\n                'format': {\n                    'anyOf': [\n                        {\n                            'type': 'string',\n                            'enum': [\n                                'date-time',\n                                'uri',\n                                'email',\n                                'hostname',\n                                'ipv4',\n                                'ipv6',\n                                'regex'\n                            ]\n                        },\n                        {\n                            'type': 'string'\n                        }\n                    ]\n                },\n                'allOf': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/schemaArray'\n                        }\n                    ]\n                },\n                'anyOf': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/schemaArray'\n                        }\n                    ]\n                },\n                'oneOf': {\n                    'allOf': [\n                        {\n                            '$ref': '#/definitions/schemaArray'\n                        }\n                    ]\n                },\n                'not': {\n                    'allOf': [\n                        {\n                            '$ref': '#'\n                        }\n                    ]\n                }\n            },\n            'dependencies': {\n                'exclusiveMaximum': [\n                    'maximum'\n                ],\n                'exclusiveMinimum': [\n                    'minimum'\n                ]\n            },\n            'default': {}\n        },\n        'http://json-schema.org/draft-07/schema#': {\n            'definitions': {\n                'schemaArray': {\n                    'type': 'array',\n                    'minItems': 1,\n                    'items': { '$ref': '#' }\n                },\n                'nonNegativeInteger': {\n                    'type': 'integer',\n                    'minimum': 0\n                },\n                'nonNegativeIntegerDefault0': {\n                    'allOf': [\n                        { '$ref': '#/definitions/nonNegativeInteger' },\n                        { 'default': 0 }\n                    ]\n                },\n                'simpleTypes': {\n                    'enum': [\n                        'array',\n                        'boolean',\n                        'integer',\n                        'null',\n                        'number',\n                        'object',\n                        'string'\n                    ]\n                },\n                'stringArray': {\n                    'type': 'array',\n                    'items': { 'type': 'string' },\n                    'uniqueItems': true,\n                    'default': []\n                }\n            },\n            'type': ['object', 'boolean'],\n            'properties': {\n                '$id': {\n                    'type': 'string',\n                    'format': 'uri-reference'\n                },\n                '$schema': {\n                    'type': 'string',\n                    'format': 'uri'\n                },\n                '$ref': {\n                    'type': 'string',\n                    'format': 'uri-reference'\n                },\n                '$comment': {\n                    'type': 'string'\n                },\n                'title': {\n                    'type': 'string'\n                },\n                'description': {\n                    'type': 'string'\n                },\n                'default': true,\n                'readOnly': {\n                    'type': 'boolean',\n                    'default': false\n                },\n                'examples': {\n                    'type': 'array',\n                    'items': true\n                },\n                'multipleOf': {\n                    'type': 'number',\n                    'exclusiveMinimum': 0\n                },\n                'maximum': {\n                    'type': 'number'\n                },\n                'exclusiveMaximum': {\n                    'type': 'number'\n                },\n                'minimum': {\n                    'type': 'number'\n                },\n                'exclusiveMinimum': {\n                    'type': 'number'\n                },\n                'maxLength': { '$ref': '#/definitions/nonNegativeInteger' },\n                'minLength': { '$ref': '#/definitions/nonNegativeIntegerDefault0' },\n                'pattern': {\n                    'type': 'string',\n                    'format': 'regex'\n                },\n                'additionalItems': { '$ref': '#' },\n                'items': {\n                    'anyOf': [\n                        { '$ref': '#' },\n                        { '$ref': '#/definitions/schemaArray' }\n                    ],\n                    'default': true\n                },\n                'maxItems': { '$ref': '#/definitions/nonNegativeInteger' },\n                'minItems': { '$ref': '#/definitions/nonNegativeIntegerDefault0' },\n                'uniqueItems': {\n                    'type': 'boolean',\n                    'default': false\n                },\n                'contains': { '$ref': '#' },\n                'maxProperties': { '$ref': '#/definitions/nonNegativeInteger' },\n                'minProperties': { '$ref': '#/definitions/nonNegativeIntegerDefault0' },\n                'required': { '$ref': '#/definitions/stringArray' },\n                'additionalProperties': { '$ref': '#' },\n                'definitions': {\n                    'type': 'object',\n                    'additionalProperties': { '$ref': '#' },\n                    'default': {}\n                },\n                'properties': {\n                    'type': 'object',\n                    'additionalProperties': { '$ref': '#' },\n                    'default': {}\n                },\n                'patternProperties': {\n                    'type': 'object',\n                    'additionalProperties': { '$ref': '#' },\n                    'propertyNames': { 'format': 'regex' },\n                    'default': {}\n                },\n                'dependencies': {\n                    'type': 'object',\n                    'additionalProperties': {\n                        'anyOf': [\n                            { '$ref': '#' },\n                            { '$ref': '#/definitions/stringArray' }\n                        ]\n                    }\n                },\n                'propertyNames': { '$ref': '#' },\n                'const': true,\n                'enum': {\n                    'type': 'array',\n                    'items': true,\n                    'minItems': 1,\n                    'uniqueItems': true\n                },\n                'type': {\n                    'anyOf': [\n                        { '$ref': '#/definitions/simpleTypes' },\n                        {\n                            'type': 'array',\n                            'items': { '$ref': '#/definitions/simpleTypes' },\n                            'minItems': 1,\n                            'uniqueItems': true\n                        }\n                    ]\n                },\n                'format': { 'type': 'string' },\n                'contentMediaType': { 'type': 'string' },\n                'contentEncoding': { 'type': 'string' },\n                'if': { '$ref': '#' },\n                'then': { '$ref': '#' },\n                'else': { '$ref': '#' },\n                'allOf': { '$ref': '#/definitions/schemaArray' },\n                'anyOf': { '$ref': '#/definitions/schemaArray' },\n                'oneOf': { '$ref': '#/definitions/schemaArray' },\n                'not': { '$ref': '#' }\n            },\n            'default': true\n        }\n    }\n};\nconst descriptions = {\n    id: t(\"A unique identifier for the schema.\"),\n    $schema: t(\"The schema to verify this document against.\"),\n    title: t(\"A descriptive title of the element.\"),\n    description: t(\"A long description of the element. Used in hover menus and suggestions.\"),\n    default: t(\"A default value. Used by suggestions.\"),\n    multipleOf: t(\"A number that should cleanly divide the current value (i.e. have no remainder).\"),\n    maximum: t(\"The maximum numerical value, inclusive by default.\"),\n    exclusiveMaximum: t(\"Makes the maximum property exclusive.\"),\n    minimum: t(\"The minimum numerical value, inclusive by default.\"),\n    exclusiveMinimum: t(\"Makes the minimum property exclusive.\"),\n    maxLength: t(\"The maximum length of a string.\"),\n    minLength: t(\"The minimum length of a string.\"),\n    pattern: t(\"A regular expression to match the string against. It is not implicitly anchored.\"),\n    additionalItems: t(\"For arrays, only when items is set as an array. If it is a schema, then this schema validates items after the ones specified by the items array. If it is false, then additional items will cause validation to fail.\"),\n    items: t(\"For arrays. Can either be a schema to validate every element against or an array of schemas to validate each item against in order (the first schema will validate the first element, the second schema will validate the second element, and so on.\"),\n    maxItems: t(\"The maximum number of items that can be inside an array. Inclusive.\"),\n    minItems: t(\"The minimum number of items that can be inside an array. Inclusive.\"),\n    uniqueItems: t(\"If all of the items in the array must be unique. Defaults to false.\"),\n    maxProperties: t(\"The maximum number of properties an object can have. Inclusive.\"),\n    minProperties: t(\"The minimum number of properties an object can have. Inclusive.\"),\n    required: t(\"An array of strings that lists the names of all properties required on this object.\"),\n    additionalProperties: t(\"Either a schema or a boolean. If a schema, then used to validate all properties not matched by 'properties' or 'patternProperties'. If false, then any properties not matched by either will cause this schema to fail.\"),\n    definitions: t(\"Not used for validation. Place subschemas here that you wish to reference inline with $ref.\"),\n    properties: t(\"A map of property names to schemas for each property.\"),\n    patternProperties: t(\"A map of regular expressions on property names to schemas for matching properties.\"),\n    dependencies: t(\"A map of property names to either an array of property names or a schema. An array of property names means the property named in the key depends on the properties in the array being present in the object in order to be valid. If the value is a schema, then the schema is only applied to the object if the property in the key exists on the object.\"),\n    enum: t(\"The set of literal values that are valid.\"),\n    type: t(\"Either a string of one of the basic schema types (number, integer, null, array, object, boolean, string) or an array of strings specifying a subset of those types.\"),\n    format: t(\"Describes the format expected for the value.\"),\n    allOf: t(\"An array of schemas, all of which must match.\"),\n    anyOf: t(\"An array of schemas, where at least one must match.\"),\n    oneOf: t(\"An array of schemas, exactly one of which must match.\"),\n    not: t(\"A schema which must not match.\"),\n    $id: t(\"A unique identifier for the schema.\"),\n    $ref: t(\"Reference a definition hosted on any location.\"),\n    $comment: t(\"Comments from schema authors to readers or maintainers of the schema.\"),\n    readOnly: t(\"Indicates that the value of the instance is managed exclusively by the owning authority.\"),\n    examples: t(\"Sample JSON values associated with a particular schema, for the purpose of illustrating usage.\"),\n    contains: t(\"An array instance is valid against \\\"contains\\\" if at least one of its elements is valid against the given schema.\"),\n    propertyNames: t(\"If the instance is an object, this keyword validates if every property name in the instance validates against the provided schema.\"),\n    const: t(\"An instance validates successfully against this keyword if its value is equal to the value of the keyword.\"),\n    contentMediaType: t(\"Describes the media type of a string property.\"),\n    contentEncoding: t(\"Describes the content encoding of a string property.\"),\n    if: t(\"The validation outcome of the \\\"if\\\" subschema controls which of the \\\"then\\\" or \\\"else\\\" keywords are evaluated.\"),\n    then: t(\"The \\\"if\\\" subschema is used for validation when the \\\"if\\\" subschema succeeds.\"),\n    else: t(\"The \\\"else\\\" subschema is used for validation when the \\\"if\\\" subschema fails.\")\n};\nfor (const schemaName in schemaContributions.schemas) {\n    const schema = schemaContributions.schemas[schemaName];\n    for (const property in schema.properties) {\n        let propertyObject = schema.properties[property];\n        if (typeof propertyObject === 'boolean') {\n            propertyObject = schema.properties[property] = {};\n        }\n        const description = descriptions[property];\n        if (description) {\n            propertyObject['description'] = description;\n        }\n    }\n}\n\nexport { schemaContributions };\n","var LIB;(()=>{var t={470:t=>{function e(t){if(\"string\"!=typeof t)throw new TypeError(\"Path must be a string. Received \"+JSON.stringify(t))}function r(t,e){for(var r,n=\"\",i=0,o=-1,s=0,h=0;h<=t.length;++h){if(h<t.length)r=t.charCodeAt(h);else {if(47===r)break;r=47;}if(47===r){if(o===h-1||1===s);else if(o!==h-1&&2===s){if(n.length<2||2!==i||46!==n.charCodeAt(n.length-1)||46!==n.charCodeAt(n.length-2))if(n.length>2){var a=n.lastIndexOf(\"/\");if(a!==n.length-1){ -1===a?(n=\"\",i=0):i=(n=n.slice(0,a)).length-1-n.lastIndexOf(\"/\"),o=h,s=0;continue}}else if(2===n.length||1===n.length){n=\"\",i=0,o=h,s=0;continue}e&&(n.length>0?n+=\"/..\":n=\"..\",i=2);}else n.length>0?n+=\"/\"+t.slice(o+1,h):n=t.slice(o+1,h),i=h-o-1;o=h,s=0;}else 46===r&&-1!==s?++s:s=-1;}return n}var n={resolve:function(){for(var t,n=\"\",i=false,o=arguments.length-1;o>=-1&&!i;o--){var s;o>=0?s=arguments[o]:(void 0===t&&(t=process.cwd()),s=t),e(s),0!==s.length&&(n=s+\"/\"+n,i=47===s.charCodeAt(0));}return n=r(n,!i),i?n.length>0?\"/\"+n:\"/\":n.length>0?n:\".\"},normalize:function(t){if(e(t),0===t.length)return \".\";var n=47===t.charCodeAt(0),i=47===t.charCodeAt(t.length-1);return 0!==(t=r(t,!n)).length||n||(t=\".\"),t.length>0&&i&&(t+=\"/\"),n?\"/\"+t:t},isAbsolute:function(t){return e(t),t.length>0&&47===t.charCodeAt(0)},join:function(){if(0===arguments.length)return \".\";for(var t,r=0;r<arguments.length;++r){var i=arguments[r];e(i),i.length>0&&(void 0===t?t=i:t+=\"/\"+i);}return void 0===t?\".\":n.normalize(t)},relative:function(t,r){if(e(t),e(r),t===r)return \"\";if((t=n.resolve(t))===(r=n.resolve(r)))return \"\";for(var i=1;i<t.length&&47===t.charCodeAt(i);++i);for(var o=t.length,s=o-i,h=1;h<r.length&&47===r.charCodeAt(h);++h);for(var a=r.length-h,c=s<a?s:a,f=-1,u=0;u<=c;++u){if(u===c){if(a>c){if(47===r.charCodeAt(h+u))return r.slice(h+u+1);if(0===u)return r.slice(h+u)}else s>c&&(47===t.charCodeAt(i+u)?f=u:0===u&&(f=0));break}var l=t.charCodeAt(i+u);if(l!==r.charCodeAt(h+u))break;47===l&&(f=u);}var g=\"\";for(u=i+f+1;u<=o;++u)u!==o&&47!==t.charCodeAt(u)||(0===g.length?g+=\"..\":g+=\"/..\");return g.length>0?g+r.slice(h+f):(h+=f,47===r.charCodeAt(h)&&++h,r.slice(h))},_makeLong:function(t){return t},dirname:function(t){if(e(t),0===t.length)return \".\";for(var r=t.charCodeAt(0),n=47===r,i=-1,o=true,s=t.length-1;s>=1;--s)if(47===(r=t.charCodeAt(s))){if(!o){i=s;break}}else o=false;return  -1===i?n?\"/\":\".\":n&&1===i?\"//\":t.slice(0,i)},basename:function(t,r){if(void 0!==r&&\"string\"!=typeof r)throw new TypeError('\"ext\" argument must be a string');e(t);var n,i=0,o=-1,s=true;if(void 0!==r&&r.length>0&&r.length<=t.length){if(r.length===t.length&&r===t)return \"\";var h=r.length-1,a=-1;for(n=t.length-1;n>=0;--n){var c=t.charCodeAt(n);if(47===c){if(!s){i=n+1;break}}else  -1===a&&(s=false,a=n+1),h>=0&&(c===r.charCodeAt(h)?-1==--h&&(o=n):(h=-1,o=a));}return i===o?o=a:-1===o&&(o=t.length),t.slice(i,o)}for(n=t.length-1;n>=0;--n)if(47===t.charCodeAt(n)){if(!s){i=n+1;break}}else  -1===o&&(s=false,o=n+1);return  -1===o?\"\":t.slice(i,o)},extname:function(t){e(t);for(var r=-1,n=0,i=-1,o=true,s=0,h=t.length-1;h>=0;--h){var a=t.charCodeAt(h);if(47!==a) -1===i&&(o=false,i=h+1),46===a?-1===r?r=h:1!==s&&(s=1):-1!==r&&(s=-1);else if(!o){n=h+1;break}}return  -1===r||-1===i||0===s||1===s&&r===i-1&&r===n+1?\"\":t.slice(r,i)},format:function(t){if(null===t||\"object\"!=typeof t)throw new TypeError('The \"pathObject\" argument must be of type Object. Received type '+typeof t);return function(t,e){var r=e.dir||e.root,n=e.base||(e.name||\"\")+(e.ext||\"\");return r?r===e.root?r+n:r+\"/\"+n:n}(0,t)},parse:function(t){e(t);var r={root:\"\",dir:\"\",base:\"\",ext:\"\",name:\"\"};if(0===t.length)return r;var n,i=t.charCodeAt(0),o=47===i;o?(r.root=\"/\",n=1):n=0;for(var s=-1,h=0,a=-1,c=true,f=t.length-1,u=0;f>=n;--f)if(47!==(i=t.charCodeAt(f))) -1===a&&(c=false,a=f+1),46===i?-1===s?s=f:1!==u&&(u=1):-1!==s&&(u=-1);else if(!c){h=f+1;break}return  -1===s||-1===a||0===u||1===u&&s===a-1&&s===h+1?-1!==a&&(r.base=r.name=0===h&&o?t.slice(1,a):t.slice(h,a)):(0===h&&o?(r.name=t.slice(1,s),r.base=t.slice(1,a)):(r.name=t.slice(h,s),r.base=t.slice(h,a)),r.ext=t.slice(s,a)),h>0?r.dir=t.slice(0,h-1):o&&(r.dir=\"/\"),r},sep:\"/\",delimiter:\":\",win32:null,posix:null};n.posix=n,t.exports=n;}},e={};function r(n){var i=e[n];if(void 0!==i)return i.exports;var o=e[n]={exports:{}};return t[n](o,o.exports,r),o.exports}r.d=(t,e)=>{for(var n in e)r.o(e,n)&&!r.o(t,n)&&Object.defineProperty(t,n,{enumerable:true,get:e[n]});},r.o=(t,e)=>Object.prototype.hasOwnProperty.call(t,e),r.r=t=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(t,\"__esModule\",{value:true});};var n={};(()=>{let t;if(r.r(n),r.d(n,{URI:()=>f,Utils:()=>P}),\"object\"==typeof process)t=\"win32\"===process.platform;else if(\"object\"==typeof navigator){let e=navigator.userAgent;t=e.indexOf(\"Windows\")>=0;}const e=/^\\w[\\w\\d+.-]*$/,i=/^\\//,o=/^\\/\\//;function s(t,r){if(!t.scheme&&r)throw new Error(`[UriError]: Scheme is missing: {scheme: \"\", authority: \"${t.authority}\", path: \"${t.path}\", query: \"${t.query}\", fragment: \"${t.fragment}\"}`);if(t.scheme&&!e.test(t.scheme))throw new Error(\"[UriError]: Scheme contains illegal characters.\");if(t.path)if(t.authority){if(!i.test(t.path))throw new Error('[UriError]: If a URI contains an authority component, then the path component must either be empty or begin with a slash (\"/\") character')}else if(o.test(t.path))throw new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters (\"//\")')}const h=\"\",a=\"/\",c=/^(([^:/?#]+?):)?(\\/\\/([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?/;class f{static isUri(t){return t instanceof f||!!t&&\"string\"==typeof t.authority&&\"string\"==typeof t.fragment&&\"string\"==typeof t.path&&\"string\"==typeof t.query&&\"string\"==typeof t.scheme&&\"string\"==typeof t.fsPath&&\"function\"==typeof t.with&&\"function\"==typeof t.toString}scheme;authority;path;query;fragment;constructor(t,e,r,n,i,o=false){\"object\"==typeof t?(this.scheme=t.scheme||h,this.authority=t.authority||h,this.path=t.path||h,this.query=t.query||h,this.fragment=t.fragment||h):(this.scheme=function(t,e){return t||e?t:\"file\"}(t,o),this.authority=e||h,this.path=function(t,e){switch(t){case \"https\":case \"http\":case \"file\":e?e[0]!==a&&(e=a+e):e=a;}return e}(this.scheme,r||h),this.query=n||h,this.fragment=i||h,s(this,o));}get fsPath(){return m(this)}with(t){if(!t)return this;let{scheme:e,authority:r,path:n,query:i,fragment:o}=t;return void 0===e?e=this.scheme:null===e&&(e=h),void 0===r?r=this.authority:null===r&&(r=h),void 0===n?n=this.path:null===n&&(n=h),void 0===i?i=this.query:null===i&&(i=h),void 0===o?o=this.fragment:null===o&&(o=h),e===this.scheme&&r===this.authority&&n===this.path&&i===this.query&&o===this.fragment?this:new l(e,r,n,i,o)}static parse(t,e=false){const r=c.exec(t);return r?new l(r[2]||h,C(r[4]||h),C(r[5]||h),C(r[7]||h),C(r[9]||h),e):new l(h,h,h,h,h)}static file(e){let r=h;if(t&&(e=e.replace(/\\\\/g,a)),e[0]===a&&e[1]===a){const t=e.indexOf(a,2);-1===t?(r=e.substring(2),e=a):(r=e.substring(2,t),e=e.substring(t)||a);}return new l(\"file\",r,e,h,h)}static from(t){const e=new l(t.scheme,t.authority,t.path,t.query,t.fragment);return s(e,true),e}toString(t=false){return y(this,t)}toJSON(){return this}static revive(t){if(t){if(t instanceof f)return t;{const e=new l(t);return e._formatted=t.external,e._fsPath=t._sep===u?t.fsPath:null,e}}return t}}const u=t?1:void 0;class l extends f{_formatted=null;_fsPath=null;get fsPath(){return this._fsPath||(this._fsPath=m(this)),this._fsPath}toString(t=false){return t?y(this,true):(this._formatted||(this._formatted=y(this,false)),this._formatted)}toJSON(){const t={$mid:1};return this._fsPath&&(t.fsPath=this._fsPath,t._sep=u),this._formatted&&(t.external=this._formatted),this.path&&(t.path=this.path),this.scheme&&(t.scheme=this.scheme),this.authority&&(t.authority=this.authority),this.query&&(t.query=this.query),this.fragment&&(t.fragment=this.fragment),t}}const g={58:\"%3A\",47:\"%2F\",63:\"%3F\",35:\"%23\",91:\"%5B\",93:\"%5D\",64:\"%40\",33:\"%21\",36:\"%24\",38:\"%26\",39:\"%27\",40:\"%28\",41:\"%29\",42:\"%2A\",43:\"%2B\",44:\"%2C\",59:\"%3B\",61:\"%3D\",32:\"%20\"};function d(t,e,r){let n,i=-1;for(let o=0;o<t.length;o++){const s=t.charCodeAt(o);if(s>=97&&s<=122||s>=65&&s<=90||s>=48&&s<=57||45===s||46===s||95===s||126===s||e&&47===s||r&&91===s||r&&93===s||r&&58===s) -1!==i&&(n+=encodeURIComponent(t.substring(i,o)),i=-1),void 0!==n&&(n+=t.charAt(o));else { void 0===n&&(n=t.substr(0,o));const e=g[s];void 0!==e?(-1!==i&&(n+=encodeURIComponent(t.substring(i,o)),i=-1),n+=e):-1===i&&(i=o);}}return  -1!==i&&(n+=encodeURIComponent(t.substring(i))),void 0!==n?n:t}function p(t){let e;for(let r=0;r<t.length;r++){const n=t.charCodeAt(r);35===n||63===n?(void 0===e&&(e=t.substr(0,r)),e+=g[n]):void 0!==e&&(e+=t[r]);}return void 0!==e?e:t}function m(e,r){let n;return n=e.authority&&e.path.length>1&&\"file\"===e.scheme?`//${e.authority}${e.path}`:47===e.path.charCodeAt(0)&&(e.path.charCodeAt(1)>=65&&e.path.charCodeAt(1)<=90||e.path.charCodeAt(1)>=97&&e.path.charCodeAt(1)<=122)&&58===e.path.charCodeAt(2)?e.path[1].toLowerCase()+e.path.substr(2):e.path,t&&(n=n.replace(/\\//g,\"\\\\\")),n}function y(t,e){const r=e?p:d;let n=\"\",{scheme:i,authority:o,path:s,query:h,fragment:c}=t;if(i&&(n+=i,n+=\":\"),(o||\"file\"===i)&&(n+=a,n+=a),o){let t=o.indexOf(\"@\");if(-1!==t){const e=o.substr(0,t);o=o.substr(t+1),t=e.lastIndexOf(\":\"),-1===t?n+=r(e,false,false):(n+=r(e.substr(0,t),false,false),n+=\":\",n+=r(e.substr(t+1),false,true)),n+=\"@\";}o=o.toLowerCase(),t=o.lastIndexOf(\":\"),-1===t?n+=r(o,false,true):(n+=r(o.substr(0,t),false,true),n+=o.substr(t));}if(s){if(s.length>=3&&47===s.charCodeAt(0)&&58===s.charCodeAt(2)){const t=s.charCodeAt(1);t>=65&&t<=90&&(s=`/${String.fromCharCode(t+32)}:${s.substr(3)}`);}else if(s.length>=2&&58===s.charCodeAt(1)){const t=s.charCodeAt(0);t>=65&&t<=90&&(s=`${String.fromCharCode(t+32)}:${s.substr(2)}`);}n+=r(s,true,false);}return h&&(n+=\"?\",n+=r(h,false,false)),c&&(n+=\"#\",n+=e?c:d(c,false,false)),n}function v(t){try{return decodeURIComponent(t)}catch{return t.length>3?t.substr(0,3)+v(t.substr(3)):t}}const b=/(%[0-9A-Za-z][0-9A-Za-z])+/g;function C(t){return t.match(b)?t.replace(b,(t=>v(t))):t}var A=r(470);const w=A.posix||A,x=\"/\";var P;!function(t){t.joinPath=function(t,...e){return t.with({path:w.join(t.path,...e)})},t.resolvePath=function(t,...e){let r=t.path,n=false;r[0]!==x&&(r=x+r,n=true);let i=w.resolve(r,...e);return n&&i[0]===x&&!t.authority&&(i=i.substring(1)),t.with({path:i})},t.dirname=function(t){if(0===t.path.length||t.path===x)return t;let e=w.dirname(t.path);return 1===e.length&&46===e.charCodeAt(0)&&(e=\"\"),t.with({path:e})},t.basename=function(t){return w.basename(t.path)},t.extname=function(t){return w.extname(t.path)};}(P||(P={}));})(),LIB=n;})();const {URI,Utils}=LIB;\n\nexport { URI, Utils };\n","/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Copyright (c) 2013, Nick Fitzgerald\n *  Licensed under the MIT License. See LICENCE.md in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nfunction createRegex(glob, opts) {\n    if (typeof glob !== 'string') {\n        throw new TypeError('Expected a string');\n    }\n    const str = String(glob);\n    // The regexp we are building, as a string.\n    let reStr = \"\";\n    // Whether we are matching so called \"extended\" globs (like bash) and should\n    // support single character matching, matching ranges of characters, group\n    // matching, etc.\n    const extended = opts ? true : false;\n    // When globstar is _false_ (default), '/foo/*' is translated a regexp like\n    // '^\\/foo\\/.*$' which will match any string beginning with '/foo/'\n    // When globstar is _true_, '/foo/*' is translated to regexp like\n    // '^\\/foo\\/[^/]*$' which will match any string beginning with '/foo/' BUT\n    // which does not have a '/' to the right of it.\n    // E.g. with '/foo/*' these will match: '/foo/bar', '/foo/bar.txt' but\n    // these will not '/foo/bar/baz', '/foo/bar/baz.txt'\n    // Lastely, when globstar is _true_, '/foo/**' is equivelant to '/foo/*' when\n    // globstar is _false_\n    const globstar = opts ? true : false;\n    // If we are doing extended matching, this boolean is true when we are inside\n    // a group (eg {*.html,*.js}), and false otherwise.\n    let inGroup = false;\n    // RegExp flags (eg \"i\" ) to pass in to RegExp constructor.\n    const flags = opts && typeof (opts.flags) === \"string\" ? opts.flags : \"\";\n    let c;\n    for (let i = 0, len = str.length; i < len; i++) {\n        c = str[i];\n        switch (c) {\n            case \"/\":\n            case \"$\":\n            case \"^\":\n            case \"+\":\n            case \".\":\n            case \"(\":\n            case \")\":\n            case \"=\":\n            case \"!\":\n            case \"|\":\n                reStr += \"\\\\\" + c;\n                break;\n            case \"?\":\n                if (extended) {\n                    reStr += \".\";\n                    break;\n                }\n            case \"[\":\n            case \"]\":\n                if (extended) {\n                    reStr += c;\n                    break;\n                }\n            case \"{\":\n                if (extended) {\n                    inGroup = true;\n                    reStr += \"(\";\n                    break;\n                }\n            case \"}\":\n                if (extended) {\n                    inGroup = false;\n                    reStr += \")\";\n                    break;\n                }\n            case \",\":\n                if (inGroup) {\n                    reStr += \"|\";\n                    break;\n                }\n                reStr += \"\\\\\" + c;\n                break;\n            case \"*\":\n                // Move over all consecutive \"*\"'s.\n                // Also store the previous and next characters\n                const prevChar = str[i - 1];\n                let starCount = 1;\n                while (str[i + 1] === \"*\") {\n                    starCount++;\n                    i++;\n                }\n                const nextChar = str[i + 1];\n                if (!globstar) {\n                    // globstar is disabled, so treat any number of \"*\" as one\n                    reStr += \".*\";\n                }\n                else {\n                    // globstar is enabled, so determine if this is a globstar segment\n                    const isGlobstar = starCount > 1 // multiple \"*\"'s\n                        && (prevChar === \"/\" || prevChar === undefined || prevChar === '{' || prevChar === ',') // from the start of the segment\n                        && (nextChar === \"/\" || nextChar === undefined || nextChar === ',' || nextChar === '}'); // to the end of the segment\n                    if (isGlobstar) {\n                        if (nextChar === \"/\") {\n                            i++; // move over the \"/\"\n                        }\n                        else if (prevChar === '/' && reStr.endsWith('\\\\/')) {\n                            reStr = reStr.substr(0, reStr.length - 2);\n                        }\n                        // it's a globstar, so match zero or more path segments\n                        reStr += \"((?:[^/]*(?:\\/|$))*)\";\n                    }\n                    else {\n                        // it's not a globstar, so only match one path segment\n                        reStr += \"([^/]*)\";\n                    }\n                }\n                break;\n            default:\n                reStr += c;\n        }\n    }\n    // When regexp 'g' flag is specified don't\n    // constrain the regular expression with ^ & $\n    if (!flags || !~flags.indexOf('g')) {\n        reStr = \"^\" + reStr + \"$\";\n    }\n    return new RegExp(reStr, flags);\n}\n\nexport { createRegex };\n","import { parse } from '../../../../jsonc-parser/lib/esm/main.js';\nimport { URI } from '../../../../vscode-uri/lib/esm/index.js';\nimport { endsWith, extendedRegExp } from '../utils/strings.js';\nimport { asSchema } from '../parser/jsonParser.js';\nimport { t } from '../../../../@vscode/l10n/dist/browser.js';\nimport { createRegex } from '../utils/glob.js';\nimport { isObject, isString } from '../utils/objects.js';\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 *--------------------------------------------------------------------------------------------*/\nconst BANG = '!';\nconst PATH_SEP = '/';\nclass FilePatternAssociation {\n    constructor(pattern, folderUri, uris) {\n        this.folderUri = folderUri;\n        this.uris = uris;\n        this.globWrappers = [];\n        try {\n            for (let patternString of pattern) {\n                const include = patternString[0] !== BANG;\n                if (!include) {\n                    patternString = patternString.substring(1);\n                }\n                if (patternString.length > 0) {\n                    if (patternString[0] === PATH_SEP) {\n                        patternString = patternString.substring(1);\n                    }\n                    this.globWrappers.push({\n                        regexp: createRegex('**/' + patternString, { extended: true, globstar: true }),\n                        include: include,\n                    });\n                }\n            }\n            ;\n            if (folderUri) {\n                folderUri = normalizeResourceForMatching(folderUri);\n                if (!folderUri.endsWith('/')) {\n                    folderUri = folderUri + '/';\n                }\n                this.folderUri = folderUri;\n            }\n        }\n        catch (e) {\n            this.globWrappers.length = 0;\n            this.uris = [];\n        }\n    }\n    matchesPattern(fileName) {\n        if (this.folderUri && !fileName.startsWith(this.folderUri)) {\n            return false;\n        }\n        let match = false;\n        for (const { regexp, include } of this.globWrappers) {\n            if (regexp.test(fileName)) {\n                match = include;\n            }\n        }\n        return match;\n    }\n    getURIs() {\n        return this.uris;\n    }\n}\nclass SchemaHandle {\n    constructor(service, uri, unresolvedSchemaContent) {\n        this.service = service;\n        this.uri = uri;\n        this.dependencies = new Set();\n        this.anchors = undefined;\n        if (unresolvedSchemaContent) {\n            this.unresolvedSchema = this.service.promise.resolve(new UnresolvedSchema(unresolvedSchemaContent));\n        }\n    }\n    getUnresolvedSchema() {\n        if (!this.unresolvedSchema) {\n            this.unresolvedSchema = this.service.loadSchema(this.uri);\n        }\n        return this.unresolvedSchema;\n    }\n    getResolvedSchema() {\n        if (!this.resolvedSchema) {\n            this.resolvedSchema = this.getUnresolvedSchema().then(unresolved => {\n                return this.service.resolveSchemaContent(unresolved, this);\n            });\n        }\n        return this.resolvedSchema;\n    }\n    clearSchema() {\n        const hasChanges = !!this.unresolvedSchema;\n        this.resolvedSchema = undefined;\n        this.unresolvedSchema = undefined;\n        this.dependencies.clear();\n        this.anchors = undefined;\n        return hasChanges;\n    }\n}\nclass UnresolvedSchema {\n    constructor(schema, errors = []) {\n        this.schema = schema;\n        this.errors = errors;\n    }\n}\nclass ResolvedSchema {\n    constructor(schema, errors = [], warnings = [], schemaDraft) {\n        this.schema = schema;\n        this.errors = errors;\n        this.warnings = warnings;\n        this.schemaDraft = schemaDraft;\n    }\n    getSection(path) {\n        const schemaRef = this.getSectionRecursive(path, this.schema);\n        if (schemaRef) {\n            return asSchema(schemaRef);\n        }\n        return undefined;\n    }\n    getSectionRecursive(path, schema) {\n        if (!schema || typeof schema === 'boolean' || path.length === 0) {\n            return schema;\n        }\n        const next = path.shift();\n        if (schema.properties && typeof schema.properties[next]) {\n            return this.getSectionRecursive(path, schema.properties[next]);\n        }\n        else if (schema.patternProperties) {\n            for (const pattern of Object.keys(schema.patternProperties)) {\n                const regex = extendedRegExp(pattern);\n                if (regex?.test(next)) {\n                    return this.getSectionRecursive(path, schema.patternProperties[pattern]);\n                }\n            }\n        }\n        else if (typeof schema.additionalProperties === 'object') {\n            return this.getSectionRecursive(path, schema.additionalProperties);\n        }\n        else if (next.match('[0-9]+')) {\n            if (Array.isArray(schema.items)) {\n                const index = parseInt(next, 10);\n                if (!isNaN(index) && schema.items[index]) {\n                    return this.getSectionRecursive(path, schema.items[index]);\n                }\n            }\n            else if (schema.items) {\n                return this.getSectionRecursive(path, schema.items);\n            }\n        }\n        return undefined;\n    }\n}\nclass JSONSchemaService {\n    constructor(requestService, contextService, promiseConstructor) {\n        this.contextService = contextService;\n        this.requestService = requestService;\n        this.promiseConstructor = promiseConstructor || Promise;\n        this.callOnDispose = [];\n        this.contributionSchemas = {};\n        this.contributionAssociations = [];\n        this.schemasById = {};\n        this.filePatternAssociations = [];\n        this.registeredSchemasIds = {};\n    }\n    getRegisteredSchemaIds(filter) {\n        return Object.keys(this.registeredSchemasIds).filter(id => {\n            const scheme = URI.parse(id).scheme;\n            return scheme !== 'schemaservice' && (!filter || filter(scheme));\n        });\n    }\n    get promise() {\n        return this.promiseConstructor;\n    }\n    dispose() {\n        while (this.callOnDispose.length > 0) {\n            this.callOnDispose.pop()();\n        }\n    }\n    onResourceChange(uri) {\n        // always clear this local cache when a resource changes\n        this.cachedSchemaForResource = undefined;\n        let hasChanges = false;\n        uri = normalizeId(uri);\n        const toWalk = [uri];\n        const all = Object.keys(this.schemasById).map(key => this.schemasById[key]);\n        while (toWalk.length) {\n            const curr = toWalk.pop();\n            for (let i = 0; i < all.length; i++) {\n                const handle = all[i];\n                if (handle && (handle.uri === curr || handle.dependencies.has(curr))) {\n                    if (handle.uri !== curr) {\n                        toWalk.push(handle.uri);\n                    }\n                    if (handle.clearSchema()) {\n                        hasChanges = true;\n                    }\n                    all[i] = undefined;\n                }\n            }\n        }\n        return hasChanges;\n    }\n    setSchemaContributions(schemaContributions) {\n        if (schemaContributions.schemas) {\n            const schemas = schemaContributions.schemas;\n            for (const id in schemas) {\n                const normalizedId = normalizeId(id);\n                this.contributionSchemas[normalizedId] = this.addSchemaHandle(normalizedId, schemas[id]);\n            }\n        }\n        if (Array.isArray(schemaContributions.schemaAssociations)) {\n            const schemaAssociations = schemaContributions.schemaAssociations;\n            for (let schemaAssociation of schemaAssociations) {\n                const uris = schemaAssociation.uris.map(normalizeId);\n                const association = this.addFilePatternAssociation(schemaAssociation.pattern, schemaAssociation.folderUri, uris);\n                this.contributionAssociations.push(association);\n            }\n        }\n    }\n    addSchemaHandle(id, unresolvedSchemaContent) {\n        const schemaHandle = new SchemaHandle(this, id, unresolvedSchemaContent);\n        this.schemasById[id] = schemaHandle;\n        return schemaHandle;\n    }\n    getOrAddSchemaHandle(id, unresolvedSchemaContent) {\n        return this.schemasById[id] || this.addSchemaHandle(id, unresolvedSchemaContent);\n    }\n    addFilePatternAssociation(pattern, folderUri, uris) {\n        const fpa = new FilePatternAssociation(pattern, folderUri, uris);\n        this.filePatternAssociations.push(fpa);\n        return fpa;\n    }\n    registerExternalSchema(config) {\n        const id = normalizeId(config.uri);\n        this.registeredSchemasIds[id] = true;\n        this.cachedSchemaForResource = undefined;\n        if (config.fileMatch && config.fileMatch.length) {\n            this.addFilePatternAssociation(config.fileMatch, config.folderUri, [id]);\n        }\n        return config.schema ? this.addSchemaHandle(id, config.schema) : this.getOrAddSchemaHandle(id);\n    }\n    clearExternalSchemas() {\n        this.schemasById = {};\n        this.filePatternAssociations = [];\n        this.registeredSchemasIds = {};\n        this.cachedSchemaForResource = undefined;\n        for (const id in this.contributionSchemas) {\n            this.schemasById[id] = this.contributionSchemas[id];\n            this.registeredSchemasIds[id] = true;\n        }\n        for (const contributionAssociation of this.contributionAssociations) {\n            this.filePatternAssociations.push(contributionAssociation);\n        }\n    }\n    getResolvedSchema(schemaId) {\n        const id = normalizeId(schemaId);\n        const schemaHandle = this.schemasById[id];\n        if (schemaHandle) {\n            return schemaHandle.getResolvedSchema();\n        }\n        return this.promise.resolve(undefined);\n    }\n    loadSchema(url) {\n        if (!this.requestService) {\n            const errorMessage = t('Unable to load schema from \\'{0}\\'. No schema request service available', toDisplayString(url));\n            return this.promise.resolve(new UnresolvedSchema({}, [errorMessage]));\n        }\n        if (url.startsWith('http://json-schema.org/')) {\n            url = 'https' + url.substring(4); // always access json-schema.org with https. See https://github.com/microsoft/vscode/issues/195189\n        }\n        return this.requestService(url).then(content => {\n            if (!content) {\n                const errorMessage = t('Unable to load schema from \\'{0}\\': No content.', toDisplayString(url));\n                return new UnresolvedSchema({}, [errorMessage]);\n            }\n            const errors = [];\n            if (content.charCodeAt(0) === 65279) {\n                errors.push(t('Problem reading content from \\'{0}\\': UTF-8 with BOM detected, only UTF 8 is allowed.', toDisplayString(url)));\n                content = content.trimStart();\n            }\n            let schemaContent = {};\n            const jsonErrors = [];\n            schemaContent = parse(content, jsonErrors);\n            if (jsonErrors.length) {\n                errors.push(t('Unable to parse content from \\'{0}\\': Parse error at offset {1}.', toDisplayString(url), jsonErrors[0].offset));\n            }\n            return new UnresolvedSchema(schemaContent, errors);\n        }, (error) => {\n            let errorMessage = error.toString();\n            const errorSplit = error.toString().split('Error: ');\n            if (errorSplit.length > 1) {\n                // more concise error message, URL and context are attached by caller anyways\n                errorMessage = errorSplit[1];\n            }\n            if (endsWith(errorMessage, '.')) {\n                errorMessage = errorMessage.substr(0, errorMessage.length - 1);\n            }\n            return new UnresolvedSchema({}, [t('Unable to load schema from \\'{0}\\': {1}.', toDisplayString(url), errorMessage)]);\n        });\n    }\n    resolveSchemaContent(schemaToResolve, handle) {\n        const resolveErrors = schemaToResolve.errors.slice(0);\n        const schema = schemaToResolve.schema;\n        let schemaDraft = schema.$schema ? normalizeId(schema.$schema) : undefined;\n        if (schemaDraft === 'http://json-schema.org/draft-03/schema') {\n            return this.promise.resolve(new ResolvedSchema({}, [t(\"Draft-03 schemas are not supported.\")], [], schemaDraft));\n        }\n        let usesUnsupportedFeatures = new Set();\n        const contextService = this.contextService;\n        const findSectionByJSONPointer = (schema, path) => {\n            path = decodeURIComponent(path);\n            let current = schema;\n            if (path[0] === '/') {\n                path = path.substring(1);\n            }\n            path.split('/').some((part) => {\n                part = part.replace(/~1/g, '/').replace(/~0/g, '~');\n                current = current[part];\n                return !current;\n            });\n            return current;\n        };\n        const findSchemaById = (schema, handle, id) => {\n            if (!handle.anchors) {\n                handle.anchors = collectAnchors(schema);\n            }\n            return handle.anchors.get(id);\n        };\n        const merge = (target, section) => {\n            for (const key in section) {\n                if (section.hasOwnProperty(key) && key !== 'id' && key !== '$id') {\n                    target[key] = section[key];\n                }\n            }\n        };\n        const mergeRef = (target, sourceRoot, sourceHandle, refSegment) => {\n            let section;\n            if (refSegment === undefined || refSegment.length === 0) {\n                section = sourceRoot;\n            }\n            else if (refSegment.charAt(0) === '/') {\n                // A $ref to a JSON Pointer (i.e #/definitions/foo)\n                section = findSectionByJSONPointer(sourceRoot, refSegment);\n            }\n            else {\n                // A $ref to a sub-schema with an $id (i.e #hello)\n                section = findSchemaById(sourceRoot, sourceHandle, refSegment);\n            }\n            if (section) {\n                merge(target, section);\n            }\n            else {\n                resolveErrors.push(t('$ref \\'{0}\\' in \\'{1}\\' can not be resolved.', refSegment || '', sourceHandle.uri));\n            }\n        };\n        const resolveExternalLink = (node, uri, refSegment, parentHandle) => {\n            if (contextService && !/^[A-Za-z][A-Za-z0-9+\\-.+]*:\\/\\/.*/.test(uri)) {\n                uri = contextService.resolveRelativePath(uri, parentHandle.uri);\n            }\n            uri = normalizeId(uri);\n            const referencedHandle = this.getOrAddSchemaHandle(uri);\n            return referencedHandle.getUnresolvedSchema().then(unresolvedSchema => {\n                parentHandle.dependencies.add(uri);\n                if (unresolvedSchema.errors.length) {\n                    const loc = refSegment ? uri + '#' + refSegment : uri;\n                    resolveErrors.push(t('Problems loading reference \\'{0}\\': {1}', loc, unresolvedSchema.errors[0]));\n                }\n                mergeRef(node, unresolvedSchema.schema, referencedHandle, refSegment);\n                return resolveRefs(node, unresolvedSchema.schema, referencedHandle);\n            });\n        };\n        const resolveRefs = (node, parentSchema, parentHandle) => {\n            const openPromises = [];\n            this.traverseNodes(node, next => {\n                const seenRefs = new Set();\n                while (next.$ref) {\n                    const ref = next.$ref;\n                    const segments = ref.split('#', 2);\n                    delete next.$ref;\n                    if (segments[0].length > 0) {\n                        // This is a reference to an external schema\n                        openPromises.push(resolveExternalLink(next, segments[0], segments[1], parentHandle));\n                        return;\n                    }\n                    else {\n                        // This is a reference inside the current schema\n                        if (!seenRefs.has(ref)) {\n                            const id = segments[1];\n                            mergeRef(next, parentSchema, parentHandle, id);\n                            seenRefs.add(ref);\n                        }\n                    }\n                }\n                if (next.$recursiveRef) {\n                    usesUnsupportedFeatures.add('$recursiveRef');\n                }\n                if (next.$dynamicRef) {\n                    usesUnsupportedFeatures.add('$dynamicRef');\n                }\n            });\n            return this.promise.all(openPromises);\n        };\n        const collectAnchors = (root) => {\n            const result = new Map();\n            this.traverseNodes(root, next => {\n                const id = next.$id || next.id;\n                const anchor = isString(id) && id.charAt(0) === '#' ? id.substring(1) : next.$anchor;\n                if (anchor) {\n                    if (result.has(anchor)) {\n                        resolveErrors.push(t('Duplicate anchor declaration: \\'{0}\\'', anchor));\n                    }\n                    else {\n                        result.set(anchor, next);\n                    }\n                }\n                if (next.$recursiveAnchor) {\n                    usesUnsupportedFeatures.add('$recursiveAnchor');\n                }\n                if (next.$dynamicAnchor) {\n                    usesUnsupportedFeatures.add('$dynamicAnchor');\n                }\n            });\n            return result;\n        };\n        return resolveRefs(schema, schema, handle).then(_ => {\n            let resolveWarnings = [];\n            if (usesUnsupportedFeatures.size) {\n                resolveWarnings.push(t('The schema uses meta-schema features ({0}) that are not yet supported by the validator.', Array.from(usesUnsupportedFeatures.keys()).join(', ')));\n            }\n            return new ResolvedSchema(schema, resolveErrors, resolveWarnings, schemaDraft);\n        });\n    }\n    traverseNodes(root, handle) {\n        if (!root || typeof root !== 'object') {\n            return Promise.resolve(null);\n        }\n        const seen = new Set();\n        const collectEntries = (...entries) => {\n            for (const entry of entries) {\n                if (isObject(entry)) {\n                    toWalk.push(entry);\n                }\n            }\n        };\n        const collectMapEntries = (...maps) => {\n            for (const map of maps) {\n                if (isObject(map)) {\n                    for (const k in map) {\n                        const key = k;\n                        const entry = map[key];\n                        if (isObject(entry)) {\n                            toWalk.push(entry);\n                        }\n                    }\n                }\n            }\n        };\n        const collectArrayEntries = (...arrays) => {\n            for (const array of arrays) {\n                if (Array.isArray(array)) {\n                    for (const entry of array) {\n                        if (isObject(entry)) {\n                            toWalk.push(entry);\n                        }\n                    }\n                }\n            }\n        };\n        const collectEntryOrArrayEntries = (items) => {\n            if (Array.isArray(items)) {\n                for (const entry of items) {\n                    if (isObject(entry)) {\n                        toWalk.push(entry);\n                    }\n                }\n            }\n            else if (isObject(items)) {\n                toWalk.push(items);\n            }\n        };\n        const toWalk = [root];\n        let next = toWalk.pop();\n        while (next) {\n            if (!seen.has(next)) {\n                seen.add(next);\n                handle(next);\n                collectEntries(next.additionalItems, next.additionalProperties, next.not, next.contains, next.propertyNames, next.if, next.then, next.else, next.unevaluatedItems, next.unevaluatedProperties);\n                collectMapEntries(next.definitions, next.$defs, next.properties, next.patternProperties, next.dependencies, next.dependentSchemas);\n                collectArrayEntries(next.anyOf, next.allOf, next.oneOf, next.prefixItems);\n                collectEntryOrArrayEntries(next.items);\n            }\n            next = toWalk.pop();\n        }\n    }\n    ;\n    getSchemaFromProperty(resource, document) {\n        if (document.root?.type === 'object') {\n            for (const p of document.root.properties) {\n                if (p.keyNode.value === '$schema' && p.valueNode?.type === 'string') {\n                    let schemaId = p.valueNode.value;\n                    if (this.contextService && !/^\\w[\\w\\d+.-]*:/.test(schemaId)) { // has scheme\n                        schemaId = this.contextService.resolveRelativePath(schemaId, resource);\n                    }\n                    return schemaId;\n                }\n            }\n        }\n        return undefined;\n    }\n    getAssociatedSchemas(resource) {\n        const seen = Object.create(null);\n        const schemas = [];\n        const normalizedResource = normalizeResourceForMatching(resource);\n        for (const entry of this.filePatternAssociations) {\n            if (entry.matchesPattern(normalizedResource)) {\n                for (const schemaId of entry.getURIs()) {\n                    if (!seen[schemaId]) {\n                        schemas.push(schemaId);\n                        seen[schemaId] = true;\n                    }\n                }\n            }\n        }\n        return schemas;\n    }\n    getSchemaURIsForResource(resource, document) {\n        let schemeId = document && this.getSchemaFromProperty(resource, document);\n        if (schemeId) {\n            return [schemeId];\n        }\n        return this.getAssociatedSchemas(resource);\n    }\n    getSchemaForResource(resource, document) {\n        if (document) {\n            // first use $schema if present\n            let schemeId = this.getSchemaFromProperty(resource, document);\n            if (schemeId) {\n                const id = normalizeId(schemeId);\n                return this.getOrAddSchemaHandle(id).getResolvedSchema();\n            }\n        }\n        if (this.cachedSchemaForResource && this.cachedSchemaForResource.resource === resource) {\n            return this.cachedSchemaForResource.resolvedSchema;\n        }\n        const schemas = this.getAssociatedSchemas(resource);\n        const resolvedSchema = schemas.length > 0 ? this.createCombinedSchema(resource, schemas).getResolvedSchema() : this.promise.resolve(undefined);\n        this.cachedSchemaForResource = { resource, resolvedSchema };\n        return resolvedSchema;\n    }\n    createCombinedSchema(resource, schemaIds) {\n        if (schemaIds.length === 1) {\n            return this.getOrAddSchemaHandle(schemaIds[0]);\n        }\n        else {\n            const combinedSchemaId = 'schemaservice://combinedSchema/' + encodeURIComponent(resource);\n            const combinedSchema = {\n                allOf: schemaIds.map(schemaId => ({ $ref: schemaId }))\n            };\n            return this.addSchemaHandle(combinedSchemaId, combinedSchema);\n        }\n    }\n    getMatchingSchemas(document, jsonDocument, schema) {\n        if (schema) {\n            const id = schema.id || ('schemaservice://untitled/matchingSchemas/' + idCounter++);\n            const handle = this.addSchemaHandle(id, schema);\n            return handle.getResolvedSchema().then(resolvedSchema => {\n                return jsonDocument.getMatchingSchemas(resolvedSchema.schema).filter(s => !s.inverted);\n            });\n        }\n        return this.getSchemaForResource(document.uri, jsonDocument).then(schema => {\n            if (schema) {\n                return jsonDocument.getMatchingSchemas(schema.schema).filter(s => !s.inverted);\n            }\n            return [];\n        });\n    }\n}\nlet idCounter = 0;\nfunction normalizeId(id) {\n    // remove trailing '#', normalize drive capitalization\n    try {\n        return URI.parse(id).toString(true);\n    }\n    catch (e) {\n        return id;\n    }\n}\nfunction normalizeResourceForMatching(resource) {\n    // remove queries and fragments, normalize drive capitalization\n    try {\n        return URI.parse(resource).with({ fragment: null, query: null }).toString(true);\n    }\n    catch (e) {\n        return resource;\n    }\n}\nfunction toDisplayString(url) {\n    try {\n        const uri = URI.parse(url);\n        if (uri.scheme === 'file') {\n            return uri.fsPath;\n        }\n    }\n    catch (e) {\n        // ignore\n    }\n    return url;\n}\n\nexport { JSONSchemaService, ResolvedSchema, UnresolvedSchema };\n","import { createScanner } from '../../../../jsonc-parser/lib/esm/main.js';\nimport '../jsonLanguageTypes.js';\nimport { FoldingRangeKind, Position } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction getFoldingRanges(document, context) {\n    const ranges = [];\n    const nestingLevels = [];\n    const stack = [];\n    let prevStart = -1;\n    const scanner = createScanner(document.getText(), false);\n    let token = scanner.scan();\n    function addRange(range) {\n        ranges.push(range);\n        nestingLevels.push(stack.length);\n    }\n    while (token !== 17 /* SyntaxKind.EOF */) {\n        switch (token) {\n            case 1 /* SyntaxKind.OpenBraceToken */:\n            case 3 /* SyntaxKind.OpenBracketToken */: {\n                const startLine = document.positionAt(scanner.getTokenOffset()).line;\n                const range = { startLine, endLine: startLine, kind: token === 1 /* SyntaxKind.OpenBraceToken */ ? 'object' : 'array' };\n                stack.push(range);\n                break;\n            }\n            case 2 /* SyntaxKind.CloseBraceToken */:\n            case 4 /* SyntaxKind.CloseBracketToken */: {\n                const kind = token === 2 /* SyntaxKind.CloseBraceToken */ ? 'object' : 'array';\n                if (stack.length > 0 && stack[stack.length - 1].kind === kind) {\n                    const range = stack.pop();\n                    const line = document.positionAt(scanner.getTokenOffset()).line;\n                    if (range && line > range.startLine + 1 && prevStart !== range.startLine) {\n                        range.endLine = line - 1;\n                        addRange(range);\n                        prevStart = range.startLine;\n                    }\n                }\n                break;\n            }\n            case 13 /* SyntaxKind.BlockCommentTrivia */: {\n                const startLine = document.positionAt(scanner.getTokenOffset()).line;\n                const endLine = document.positionAt(scanner.getTokenOffset() + scanner.getTokenLength()).line;\n                if (scanner.getTokenError() === 1 /* ScanError.UnexpectedEndOfComment */ && startLine + 1 < document.lineCount) {\n                    scanner.setPosition(document.offsetAt(Position.create(startLine + 1, 0)));\n                }\n                else {\n                    if (startLine < endLine) {\n                        addRange({ startLine, endLine, kind: FoldingRangeKind.Comment });\n                        prevStart = startLine;\n                    }\n                }\n                break;\n            }\n            case 12 /* SyntaxKind.LineCommentTrivia */: {\n                const text = document.getText().substr(scanner.getTokenOffset(), scanner.getTokenLength());\n                const m = text.match(/^\\/\\/\\s*#(region\\b)|(endregion\\b)/);\n                if (m) {\n                    const line = document.positionAt(scanner.getTokenOffset()).line;\n                    if (m[1]) { // start pattern match\n                        const range = { startLine: line, endLine: line, kind: FoldingRangeKind.Region };\n                        stack.push(range);\n                    }\n                    else {\n                        let i = stack.length - 1;\n                        while (i >= 0 && stack[i].kind !== FoldingRangeKind.Region) {\n                            i--;\n                        }\n                        if (i >= 0) {\n                            const range = stack[i];\n                            stack.length = i;\n                            if (line > range.startLine && prevStart !== range.startLine) {\n                                range.endLine = line;\n                                addRange(range);\n                                prevStart = range.startLine;\n                            }\n                        }\n                    }\n                }\n                break;\n            }\n        }\n        token = scanner.scan();\n    }\n    const rangeLimit = context && context.rangeLimit;\n    if (typeof rangeLimit !== 'number' || ranges.length <= rangeLimit) {\n        return ranges;\n    }\n    if (context && context.onRangeLimitExceeded) {\n        context.onRangeLimitExceeded(document.uri);\n    }\n    const counts = [];\n    for (let level of nestingLevels) {\n        if (level < 30) {\n            counts[level] = (counts[level] || 0) + 1;\n        }\n    }\n    let entries = 0;\n    let maxLevel = 0;\n    for (let i = 0; i < counts.length; i++) {\n        const n = counts[i];\n        if (n) {\n            if (n + entries > rangeLimit) {\n                maxLevel = i;\n                break;\n            }\n            entries += n;\n        }\n    }\n    const result = [];\n    for (let i = 0; i < ranges.length; i++) {\n        const level = nestingLevels[i];\n        if (typeof level === 'number') {\n            if (level < maxLevel || (level === maxLevel && entries++ < rangeLimit)) {\n                result.push(ranges[i]);\n            }\n        }\n    }\n    return result;\n}\n\nexport { getFoldingRanges };\n","import '../jsonLanguageTypes.js';\nimport { createScanner } from '../../../../jsonc-parser/lib/esm/main.js';\nimport { SelectionRange, Range } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction getSelectionRanges(document, positions, doc) {\n    function getSelectionRange(position) {\n        let offset = document.offsetAt(position);\n        let node = doc.getNodeFromOffset(offset, true);\n        const result = [];\n        while (node) {\n            switch (node.type) {\n                case 'string':\n                case 'object':\n                case 'array':\n                    // range without \", [ or {\n                    const cStart = node.offset + 1, cEnd = node.offset + node.length - 1;\n                    if (cStart < cEnd && offset >= cStart && offset <= cEnd) {\n                        result.push(newRange(cStart, cEnd));\n                    }\n                    result.push(newRange(node.offset, node.offset + node.length));\n                    break;\n                case 'number':\n                case 'boolean':\n                case 'null':\n                case 'property':\n                    result.push(newRange(node.offset, node.offset + node.length));\n                    break;\n            }\n            if (node.type === 'property' || node.parent && node.parent.type === 'array') {\n                const afterCommaOffset = getOffsetAfterNextToken(node.offset + node.length, 5 /* SyntaxKind.CommaToken */);\n                if (afterCommaOffset !== -1) {\n                    result.push(newRange(node.offset, afterCommaOffset));\n                }\n            }\n            node = node.parent;\n        }\n        let current = undefined;\n        for (let index = result.length - 1; index >= 0; index--) {\n            current = SelectionRange.create(result[index], current);\n        }\n        if (!current) {\n            current = SelectionRange.create(Range.create(position, position));\n        }\n        return current;\n    }\n    function newRange(start, end) {\n        return Range.create(document.positionAt(start), document.positionAt(end));\n    }\n    const scanner = createScanner(document.getText(), true);\n    function getOffsetAfterNextToken(offset, expectedToken) {\n        scanner.setPosition(offset);\n        let token = scanner.scan();\n        if (token === expectedToken) {\n            return scanner.getTokenOffset() + scanner.getTokenLength();\n        }\n        return -1;\n    }\n    return positions.map(getSelectionRange);\n}\n\nexport { getSelectionRanges };\n","import { format as format$1 } from '../../../../jsonc-parser/lib/esm/main.js';\nimport '../jsonLanguageTypes.js';\nimport { TextEdit, Range } from '../../../../vscode-languageserver-types/lib/esm/main.js';\n\nfunction format(documentToFormat, formattingOptions, formattingRange) {\n    let range = undefined;\n    if (formattingRange) {\n        const offset = documentToFormat.offsetAt(formattingRange.start);\n        const length = documentToFormat.offsetAt(formattingRange.end) - offset;\n        range = { offset, length };\n    }\n    const options = {\n        tabSize: formattingOptions ? formattingOptions.tabSize : 4,\n        insertSpaces: formattingOptions?.insertSpaces === true,\n        insertFinalNewline: formattingOptions?.insertFinalNewline === true,\n        eol: '\\n',\n        keepLines: formattingOptions?.keepLines === true\n    };\n    return format$1(documentToFormat.getText(), range, options).map(edit => {\n        return TextEdit.replace(Range.create(documentToFormat.positionAt(edit.offset), documentToFormat.positionAt(edit.offset + edit.length)), edit.content);\n    });\n}\n\nexport { format };\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 Container;\n(function (Container) {\n    Container[Container[\"Object\"] = 0] = \"Object\";\n    Container[Container[\"Array\"] = 1] = \"Array\";\n})(Container || (Container = {}));\nclass PropertyTree {\n    constructor(propertyName, beginningLineNumber) {\n        this.propertyName = propertyName ?? '';\n        this.beginningLineNumber = beginningLineNumber;\n        this.childrenProperties = [];\n        this.lastProperty = false;\n        this.noKeyName = false;\n    }\n    addChildProperty(childProperty) {\n        childProperty.parent = this;\n        if (this.childrenProperties.length > 0) {\n            let insertionIndex = 0;\n            if (childProperty.noKeyName) {\n                insertionIndex = this.childrenProperties.length;\n            }\n            else {\n                insertionIndex = binarySearchOnPropertyArray(this.childrenProperties, childProperty, compareProperties);\n            }\n            if (insertionIndex < 0) {\n                insertionIndex = (insertionIndex * -1) - 1;\n            }\n            this.childrenProperties.splice(insertionIndex, 0, childProperty);\n        }\n        else {\n            this.childrenProperties.push(childProperty);\n        }\n        return childProperty;\n    }\n}\nfunction compareProperties(propertyTree1, propertyTree2) {\n    const propertyName1 = propertyTree1.propertyName.toLowerCase();\n    const propertyName2 = propertyTree2.propertyName.toLowerCase();\n    if (propertyName1 < propertyName2) {\n        return -1;\n    }\n    else if (propertyName1 > propertyName2) {\n        return 1;\n    }\n    return 0;\n}\nfunction binarySearchOnPropertyArray(propertyTreeArray, propertyTree, compare_fn) {\n    const propertyName = propertyTree.propertyName.toLowerCase();\n    const firstPropertyInArrayName = propertyTreeArray[0].propertyName.toLowerCase();\n    const lastPropertyInArrayName = propertyTreeArray[propertyTreeArray.length - 1].propertyName.toLowerCase();\n    if (propertyName < firstPropertyInArrayName) {\n        return 0;\n    }\n    if (propertyName > lastPropertyInArrayName) {\n        return propertyTreeArray.length;\n    }\n    let m = 0;\n    let n = propertyTreeArray.length - 1;\n    while (m <= n) {\n        let k = (n + m) >> 1;\n        let cmp = compare_fn(propertyTree, propertyTreeArray[k]);\n        if (cmp > 0) {\n            m = k + 1;\n        }\n        else if (cmp < 0) {\n            n = k - 1;\n        }\n        else {\n            return k;\n        }\n    }\n    return -m - 1;\n}\n\nexport { Container, PropertyTree };\n","import { createScanner } from '../../../../jsonc-parser/lib/esm/main.js';\nimport '../jsonLanguageTypes.js';\nimport { format } from './format.js';\nimport { PropertyTree, Container } from './propertyTree.js';\nimport { TextDocument } from '../../../../vscode-languageserver-textdocument/lib/esm/main.js';\nimport { TextEdit, Range, Position } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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// import { TextEdit} from 'vscode-languageserver-textdocument';\nfunction sort(documentToSort, formattingOptions) {\n    const options = {\n        ...formattingOptions,\n        keepLines: false, // keepLines must be false so that the properties are on separate lines for the sorting\n    };\n    const formattedJsonString = TextDocument.applyEdits(documentToSort, format(documentToSort, options, undefined));\n    const formattedJsonDocument = TextDocument.create('test://test.json', 'json', 0, formattedJsonString);\n    const jsonPropertyTree = findJsoncPropertyTree(formattedJsonDocument);\n    const sortedJsonDocument = sortJsoncDocument(formattedJsonDocument, jsonPropertyTree);\n    const edits = format(sortedJsonDocument, options, undefined);\n    const sortedAndFormattedJsonDocument = TextDocument.applyEdits(sortedJsonDocument, edits);\n    return [TextEdit.replace(Range.create(Position.create(0, 0), documentToSort.positionAt(documentToSort.getText().length)), sortedAndFormattedJsonDocument)];\n}\nfunction findJsoncPropertyTree(formattedDocument) {\n    const formattedString = formattedDocument.getText();\n    const scanner = createScanner(formattedString, false);\n    // The tree that will be returned\n    let rootTree = new PropertyTree();\n    // The tree where the current properties can be added as children\n    let currentTree = rootTree;\n    // The tree representing the current property analyzed\n    let currentProperty = rootTree;\n    // The tree representing the previous property analyzed\n    let lastProperty = rootTree;\n    // The current scanned token\n    let token = undefined;\n    // Line number of the last token found\n    let lastTokenLine = 0;\n    // Total number of characters on the lines prior to current line \n    let numberOfCharactersOnPreviousLines = 0;\n    // The last token scanned that is not trivial, nor a comment\n    let lastNonTriviaNonCommentToken = undefined;\n    // The second to last token scanned that is not trivial, nor a comment\n    let secondToLastNonTriviaNonCommentToken = undefined;\n    // Line number of last token that is not trivial, nor a comment\n    let lineOfLastNonTriviaNonCommentToken = -1;\n    // End index on its line of last token that is not trivial, nor a comment\n    let endIndexOfLastNonTriviaNonCommentToken = -1;\n    // Line number of the start of the range of current/next property\n    let beginningLineNumber = 0;\n    // Line number of the end of the range of current/next property\n    let endLineNumber = 0;\n    // Stack indicating whether we are inside of an object or an array\n    let currentContainerStack = [];\n    // Boolean indicating that the current property end line number needs to be updated. Used only when block comments are encountered.\n    let updateLastPropertyEndLineNumber = false;\n    // Boolean indicating that the beginning line number should be updated. Used only when block comments are encountered. \n    let updateBeginningLineNumber = false;\n    while ((token = scanner.scan()) !== 17 /* SyntaxKind.EOF */) {\n        // In the case when a block comment has been encountered that starts on the same line as the comma ending a property, update the end line of that\n        // property so that it covers the block comment. For example, if we have: \n        // 1. \"key\" : {}, /* some block\n        // 2. comment */\n        // Then, the end line of the property \"key\" should be line 2 not line 1\n        if (updateLastPropertyEndLineNumber === true\n            && token !== 14 /* SyntaxKind.LineBreakTrivia */\n            && token !== 15 /* SyntaxKind.Trivia */\n            && token !== 12 /* SyntaxKind.LineCommentTrivia */\n            && token !== 13 /* SyntaxKind.BlockCommentTrivia */\n            && currentProperty.endLineNumber === undefined) {\n            let endLineNumber = scanner.getTokenStartLine();\n            // Update the end line number in the case when the last property visited is a container (object or array)\n            if (secondToLastNonTriviaNonCommentToken === 2 /* SyntaxKind.CloseBraceToken */\n                || secondToLastNonTriviaNonCommentToken === 4 /* SyntaxKind.CloseBracketToken */) {\n                lastProperty.endLineNumber = endLineNumber - 1;\n            }\n            // Update the end line number in the case when the last property visited is a simple property \n            else {\n                currentProperty.endLineNumber = endLineNumber - 1;\n            }\n            beginningLineNumber = endLineNumber;\n            updateLastPropertyEndLineNumber = false;\n        }\n        // When a block comment follows an open brace or an open bracket, that block comment should be associated to that brace or bracket, not the property below it. For example, for:\n        // 1. { /*\n        // 2. ... */\n        // 3. \"key\" : {}\n        // 4. }\n        // Instead of associating the block comment to the property on line 3, it is associate to the property on line 1\n        if (updateBeginningLineNumber === true\n            && token !== 14 /* SyntaxKind.LineBreakTrivia */\n            && token !== 15 /* SyntaxKind.Trivia */\n            && token !== 12 /* SyntaxKind.LineCommentTrivia */\n            && token !== 13 /* SyntaxKind.BlockCommentTrivia */) {\n            beginningLineNumber = scanner.getTokenStartLine();\n            updateBeginningLineNumber = false;\n        }\n        // Update the number of characters on all the previous lines each time the new token is on a different line to the previous token\n        if (scanner.getTokenStartLine() !== lastTokenLine) {\n            for (let i = lastTokenLine; i < scanner.getTokenStartLine(); i++) {\n                const lengthOfLine = formattedDocument.getText(Range.create(Position.create(i, 0), Position.create(i + 1, 0))).length;\n                numberOfCharactersOnPreviousLines = numberOfCharactersOnPreviousLines + lengthOfLine;\n            }\n            lastTokenLine = scanner.getTokenStartLine();\n        }\n        switch (token) {\n            // When a string is found, if it follows an open brace or a comma token and it is within an object, then it corresponds to a key name, not a simple string\n            case 10 /* SyntaxKind.StringLiteral */: {\n                if ((lastNonTriviaNonCommentToken === undefined\n                    || lastNonTriviaNonCommentToken === 1 /* SyntaxKind.OpenBraceToken */\n                    || (lastNonTriviaNonCommentToken === 5 /* SyntaxKind.CommaToken */\n                        && currentContainerStack[currentContainerStack.length - 1] === Container.Object))) {\n                    // In that case create the child property which starts at beginningLineNumber, add it to the current tree\n                    const childProperty = new PropertyTree(scanner.getTokenValue(), beginningLineNumber);\n                    lastProperty = currentProperty;\n                    currentProperty = currentTree.addChildProperty(childProperty);\n                }\n                break;\n            }\n            // When the token is an open bracket, then we enter into an array\n            case 3 /* SyntaxKind.OpenBracketToken */: {\n                // If the root tree beginning line number is not defined, then this open bracket is the first open bracket in the document\n                if (rootTree.beginningLineNumber === undefined) {\n                    rootTree.beginningLineNumber = scanner.getTokenStartLine();\n                }\n                // Suppose we are inside of an object, then the current array is associated to a key, and has already been created\n                // We have the following configuration: {\"a\": \"val\", \"array\": [...], \"b\": \"val\"}\n                // In that case navigate down to the child property\n                if (currentContainerStack[currentContainerStack.length - 1] === Container.Object) {\n                    currentTree = currentProperty;\n                }\n                // Suppose we are inside of an array, then since the current array is not associated to a key, it has not been created yet\n                // We have the following configuration: [\"a\", [...], \"b\"]\n                // In that case create the property and navigate down\n                else if (currentContainerStack[currentContainerStack.length - 1] === Container.Array) {\n                    const childProperty = new PropertyTree(scanner.getTokenValue(), beginningLineNumber);\n                    childProperty.noKeyName = true;\n                    lastProperty = currentProperty;\n                    currentProperty = currentTree.addChildProperty(childProperty);\n                    currentTree = currentProperty;\n                }\n                currentContainerStack.push(Container.Array);\n                currentProperty.type = Container.Array;\n                beginningLineNumber = scanner.getTokenStartLine();\n                beginningLineNumber++;\n                break;\n            }\n            // When the token is an open brace, then we enter into an object\n            case 1 /* SyntaxKind.OpenBraceToken */: {\n                // If the root tree beginning line number is not defined, then this open brace is the first open brace in the document\n                if (rootTree.beginningLineNumber === undefined) {\n                    rootTree.beginningLineNumber = scanner.getTokenStartLine();\n                }\n                // 1. If we are inside of an objet, the current object is associated to a key and has already been created\n                // We have the following configuration: {\"a\": \"val\", \"object\": {...}, \"b\": \"val\"}\n                // 2. Otherwise the current object property is inside of an array, not associated to a key name and the property has not yet been created\n                // We have the following configuration: [\"a\", {...}, \"b\"]\n                else if (currentContainerStack[currentContainerStack.length - 1] === Container.Array) {\n                    const childProperty = new PropertyTree(scanner.getTokenValue(), beginningLineNumber);\n                    childProperty.noKeyName = true;\n                    lastProperty = currentProperty;\n                    currentProperty = currentTree.addChildProperty(childProperty);\n                }\n                currentProperty.type = Container.Object;\n                currentContainerStack.push(Container.Object);\n                currentTree = currentProperty;\n                beginningLineNumber = scanner.getTokenStartLine();\n                beginningLineNumber++;\n                break;\n            }\n            case 4 /* SyntaxKind.CloseBracketToken */: {\n                endLineNumber = scanner.getTokenStartLine();\n                currentContainerStack.pop();\n                // If the last non-trivial non-comment token is a closing brace or bracket, then the currentProperty end line number has not been set yet so set it\n                // The configuration considered is: [..., {}] or [..., []]\n                if (currentProperty.endLineNumber === undefined\n                    && (lastNonTriviaNonCommentToken === 2 /* SyntaxKind.CloseBraceToken */\n                        || lastNonTriviaNonCommentToken === 4 /* SyntaxKind.CloseBracketToken */)) {\n                    currentProperty.endLineNumber = endLineNumber - 1;\n                    currentProperty.lastProperty = true;\n                    currentProperty.lineWhereToAddComma = lineOfLastNonTriviaNonCommentToken;\n                    currentProperty.indexWhereToAddComa = endIndexOfLastNonTriviaNonCommentToken;\n                    lastProperty = currentProperty;\n                    currentProperty = currentProperty ? currentProperty.parent : undefined;\n                    currentTree = currentProperty;\n                }\n                rootTree.endLineNumber = endLineNumber;\n                beginningLineNumber = endLineNumber + 1;\n                break;\n            }\n            case 2 /* SyntaxKind.CloseBraceToken */: {\n                endLineNumber = scanner.getTokenStartLine();\n                currentContainerStack.pop();\n                // If we are not inside of an empty object\n                if (lastNonTriviaNonCommentToken !== 1 /* SyntaxKind.OpenBraceToken */) {\n                    // If current property end line number has not yet been defined, define it\n                    if (currentProperty.endLineNumber === undefined) {\n                        currentProperty.endLineNumber = endLineNumber - 1;\n                        // The current property is also the last property\n                        currentProperty.lastProperty = true;\n                        // The last property of an object is associated with the line and index of where to add the comma, in case after sorting, it is no longer the last property\n                        currentProperty.lineWhereToAddComma = lineOfLastNonTriviaNonCommentToken;\n                        currentProperty.indexWhereToAddComa = endIndexOfLastNonTriviaNonCommentToken;\n                    }\n                    lastProperty = currentProperty;\n                    currentProperty = currentProperty ? currentProperty.parent : undefined;\n                    currentTree = currentProperty;\n                }\n                rootTree.endLineNumber = scanner.getTokenStartLine();\n                beginningLineNumber = endLineNumber + 1;\n                break;\n            }\n            case 5 /* SyntaxKind.CommaToken */: {\n                endLineNumber = scanner.getTokenStartLine();\n                // If the current container is an object or the current container is an array and the last non-trivia non-comment token is a closing brace or a closing bracket\n                // Then update the end line number of the current property\n                if (currentProperty.endLineNumber === undefined\n                    && (currentContainerStack[currentContainerStack.length - 1] === Container.Object\n                        || (currentContainerStack[currentContainerStack.length - 1] === Container.Array\n                            && (lastNonTriviaNonCommentToken === 2 /* SyntaxKind.CloseBraceToken */\n                                || lastNonTriviaNonCommentToken === 4 /* SyntaxKind.CloseBracketToken */)))) {\n                    currentProperty.endLineNumber = endLineNumber;\n                    // Store the line and the index of the comma in case it needs to be removed during the sorting\n                    currentProperty.commaIndex = scanner.getTokenOffset() - numberOfCharactersOnPreviousLines;\n                    currentProperty.commaLine = endLineNumber;\n                }\n                if (lastNonTriviaNonCommentToken === 2 /* SyntaxKind.CloseBraceToken */\n                    || lastNonTriviaNonCommentToken === 4 /* SyntaxKind.CloseBracketToken */) {\n                    lastProperty = currentProperty;\n                    currentProperty = currentProperty ? currentProperty.parent : undefined;\n                    currentTree = currentProperty;\n                }\n                beginningLineNumber = endLineNumber + 1;\n                break;\n            }\n            case 13 /* SyntaxKind.BlockCommentTrivia */: {\n                // If the last non trivia non-comment token is a comma and the block comment starts on the same line as the comma, then update the end line number of the current property. For example if:\n                // 1. {}, /* ...\n                // 2. ..*/\n                // The the property on line 1 shoud end on line 2, not line 1\n                // In the case we are in an array we update the end line number only if the second to last non-trivia non-comment token is a closing brace or bracket\n                if (lastNonTriviaNonCommentToken === 5 /* SyntaxKind.CommaToken */\n                    && lineOfLastNonTriviaNonCommentToken === scanner.getTokenStartLine()\n                    && (currentContainerStack[currentContainerStack.length - 1] === Container.Array\n                        && (secondToLastNonTriviaNonCommentToken === 2 /* SyntaxKind.CloseBraceToken */\n                            || secondToLastNonTriviaNonCommentToken === 4 /* SyntaxKind.CloseBracketToken */)\n                        || currentContainerStack[currentContainerStack.length - 1] === Container.Object)) {\n                    if (currentContainerStack[currentContainerStack.length - 1] === Container.Array && (secondToLastNonTriviaNonCommentToken === 2 /* SyntaxKind.CloseBraceToken */ || secondToLastNonTriviaNonCommentToken === 4 /* SyntaxKind.CloseBracketToken */) || currentContainerStack[currentContainerStack.length - 1] === Container.Object) {\n                        currentProperty.endLineNumber = undefined;\n                        updateLastPropertyEndLineNumber = true;\n                    }\n                }\n                // When the block comment follows an open brace or an open token, we have the following scenario:\n                // { /**\n                // ../\n                // }\n                // The block comment should be assigned to the open brace not the first property below it\n                if ((lastNonTriviaNonCommentToken === 1 /* SyntaxKind.OpenBraceToken */\n                    || lastNonTriviaNonCommentToken === 3 /* SyntaxKind.OpenBracketToken */)\n                    && lineOfLastNonTriviaNonCommentToken === scanner.getTokenStartLine()) {\n                    updateBeginningLineNumber = true;\n                }\n                break;\n            }\n        }\n        // Update the last and second to last non-trivia non-comment tokens\n        if (token !== 14 /* SyntaxKind.LineBreakTrivia */\n            && token !== 13 /* SyntaxKind.BlockCommentTrivia */\n            && token !== 12 /* SyntaxKind.LineCommentTrivia */\n            && token !== 15 /* SyntaxKind.Trivia */) {\n            secondToLastNonTriviaNonCommentToken = lastNonTriviaNonCommentToken;\n            lastNonTriviaNonCommentToken = token;\n            lineOfLastNonTriviaNonCommentToken = scanner.getTokenStartLine();\n            endIndexOfLastNonTriviaNonCommentToken = scanner.getTokenOffset() + scanner.getTokenLength() - numberOfCharactersOnPreviousLines;\n        }\n    }\n    return rootTree;\n}\nfunction sortJsoncDocument(jsonDocument, propertyTree) {\n    if (propertyTree.childrenProperties.length === 0) {\n        return jsonDocument;\n    }\n    const sortedJsonDocument = TextDocument.create('test://test.json', 'json', 0, jsonDocument.getText());\n    const queueToSort = [];\n    updateSortingQueue(queueToSort, propertyTree, propertyTree.beginningLineNumber);\n    while (queueToSort.length > 0) {\n        const dataToSort = queueToSort.shift();\n        const propertyTreeArray = dataToSort.propertyTreeArray;\n        let beginningLineNumber = dataToSort.beginningLineNumber;\n        for (let i = 0; i < propertyTreeArray.length; i++) {\n            const propertyTree = propertyTreeArray[i];\n            const range = Range.create(Position.create(propertyTree.beginningLineNumber, 0), Position.create(propertyTree.endLineNumber + 1, 0));\n            const jsonContentToReplace = jsonDocument.getText(range);\n            const jsonDocumentToReplace = TextDocument.create('test://test.json', 'json', 0, jsonContentToReplace);\n            if (propertyTree.lastProperty === true && i !== propertyTreeArray.length - 1) {\n                const lineWhereToAddComma = propertyTree.lineWhereToAddComma - propertyTree.beginningLineNumber;\n                const indexWhereToAddComma = propertyTree.indexWhereToAddComa;\n                const edit = {\n                    range: Range.create(Position.create(lineWhereToAddComma, indexWhereToAddComma), Position.create(lineWhereToAddComma, indexWhereToAddComma)),\n                    text: ','\n                };\n                TextDocument.update(jsonDocumentToReplace, [edit], 1);\n            }\n            else if (propertyTree.lastProperty === false && i === propertyTreeArray.length - 1) {\n                const commaIndex = propertyTree.commaIndex;\n                const commaLine = propertyTree.commaLine;\n                const lineWhereToRemoveComma = commaLine - propertyTree.beginningLineNumber;\n                const edit = {\n                    range: Range.create(Position.create(lineWhereToRemoveComma, commaIndex), Position.create(lineWhereToRemoveComma, commaIndex + 1)),\n                    text: ''\n                };\n                TextDocument.update(jsonDocumentToReplace, [edit], 1);\n            }\n            const length = propertyTree.endLineNumber - propertyTree.beginningLineNumber + 1;\n            const edit = {\n                range: Range.create(Position.create(beginningLineNumber, 0), Position.create(beginningLineNumber + length, 0)),\n                text: jsonDocumentToReplace.getText()\n            };\n            TextDocument.update(sortedJsonDocument, [edit], 1);\n            updateSortingQueue(queueToSort, propertyTree, beginningLineNumber);\n            beginningLineNumber = beginningLineNumber + length;\n        }\n    }\n    return sortedJsonDocument;\n}\nfunction updateSortingQueue(queue, propertyTree, beginningLineNumber) {\n    if (propertyTree.childrenProperties.length === 0) {\n        return;\n    }\n    if (propertyTree.type === Container.Object) {\n        let minimumBeginningLineNumber = Infinity;\n        for (const childProperty of propertyTree.childrenProperties) {\n            if (childProperty.beginningLineNumber < minimumBeginningLineNumber) {\n                minimumBeginningLineNumber = childProperty.beginningLineNumber;\n            }\n        }\n        const diff = minimumBeginningLineNumber - propertyTree.beginningLineNumber;\n        beginningLineNumber = beginningLineNumber + diff;\n        queue.push(new SortingRange(beginningLineNumber, propertyTree.childrenProperties));\n    }\n    else if (propertyTree.type === Container.Array) {\n        updateSortingQueueForArrayProperties(queue, propertyTree, beginningLineNumber);\n    }\n}\nfunction updateSortingQueueForArrayProperties(queue, propertyTree, beginningLineNumber) {\n    for (const subObject of propertyTree.childrenProperties) {\n        // If the child property of the array is an object, then you can sort the properties within this object\n        if (subObject.type === Container.Object) {\n            let minimumBeginningLineNumber = Infinity;\n            for (const childProperty of subObject.childrenProperties) {\n                if (childProperty.beginningLineNumber < minimumBeginningLineNumber) {\n                    minimumBeginningLineNumber = childProperty.beginningLineNumber;\n                }\n            }\n            const diff = minimumBeginningLineNumber - subObject.beginningLineNumber;\n            queue.push(new SortingRange(beginningLineNumber + subObject.beginningLineNumber - propertyTree.beginningLineNumber + diff, subObject.childrenProperties));\n        }\n        // If the child property of the array is an array, then you need to recurse on the children properties, until you find an object to sort\n        if (subObject.type === Container.Array) {\n            updateSortingQueueForArrayProperties(queue, subObject, beginningLineNumber + subObject.beginningLineNumber - propertyTree.beginningLineNumber);\n        }\n    }\n}\nclass SortingRange {\n    constructor(beginningLineNumber, propertyTreeArray) {\n        this.beginningLineNumber = beginningLineNumber;\n        this.propertyTreeArray = propertyTreeArray;\n    }\n}\n\nexport { sort };\n","import '../jsonLanguageTypes.js';\nimport { Range } from '../../../../vscode-languageserver-types/lib/esm/main.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction findLinks(document, doc) {\n    const links = [];\n    doc.visit(node => {\n        if (node.type === \"property\" && node.keyNode.value === \"$ref\" && node.valueNode?.type === 'string') {\n            const path = node.valueNode.value;\n            const targetNode = findTargetNode(doc, path);\n            if (targetNode) {\n                const targetPos = document.positionAt(targetNode.offset);\n                links.push({\n                    target: `${document.uri}#${targetPos.line + 1},${targetPos.character + 1}`,\n                    range: createRange(document, node.valueNode)\n                });\n            }\n        }\n        return true;\n    });\n    return Promise.resolve(links);\n}\nfunction createRange(document, node) {\n    return Range.create(document.positionAt(node.offset + 1), document.positionAt(node.offset + node.length - 1));\n}\nfunction findTargetNode(doc, path) {\n    const tokens = parseJSONPointer(path);\n    if (!tokens) {\n        return null;\n    }\n    return findNode(tokens, doc.root);\n}\nfunction findNode(pointer, node) {\n    if (!node) {\n        return null;\n    }\n    if (pointer.length === 0) {\n        return node;\n    }\n    const token = pointer.shift();\n    if (node && node.type === 'object') {\n        const propertyNode = node.properties.find((propertyNode) => propertyNode.keyNode.value === token);\n        if (!propertyNode) {\n            return null;\n        }\n        return findNode(pointer, propertyNode.valueNode);\n    }\n    else if (node && node.type === 'array') {\n        if (token.match(/^(0|[1-9][0-9]*)$/)) {\n            const index = Number.parseInt(token);\n            const arrayItem = node.items[index];\n            if (!arrayItem) {\n                return null;\n            }\n            return findNode(pointer, arrayItem);\n        }\n    }\n    return null;\n}\nfunction parseJSONPointer(path) {\n    if (path === \"#\") {\n        return [];\n    }\n    if (path[0] !== '#' || path[1] !== '/') {\n        return null;\n    }\n    return path.substring(2).split(/\\//).map(unescape);\n}\nfunction unescape(str) {\n    return str.replace(/~1/g, '/').replace(/~0/g, '~');\n}\n\nexport { findLinks };\n","import { JSONCompletion } from './services/jsonCompletion.js';\nimport { JSONHover } from './services/jsonHover.js';\nimport { JSONValidation } from './services/jsonValidation.js';\nimport { JSONDocumentSymbols } from './services/jsonDocumentSymbols.js';\nimport { newJSONDocument, parse } from './parser/jsonParser.js';\nimport { schemaContributions } from './services/configuration.js';\nimport { JSONSchemaService } from './services/jsonSchemaService.js';\nimport { getFoldingRanges } from './services/jsonFolding.js';\nimport { getSelectionRanges } from './services/jsonSelectionRanges.js';\nimport { sort } from './utils/sort.js';\nimport { format } from './utils/format.js';\nimport { findLinks } from './services/jsonLinks.js';\nexport { ClientCapabilities, ErrorCode, SchemaDraft } from './jsonLanguageTypes.js';\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 *--------------------------------------------------------------------------------------------*/\nfunction getLanguageService(params) {\n    const promise = params.promiseConstructor || Promise;\n    const jsonSchemaService = new JSONSchemaService(params.schemaRequestService, params.workspaceContext, promise);\n    jsonSchemaService.setSchemaContributions(schemaContributions);\n    const jsonCompletion = new JSONCompletion(jsonSchemaService, params.contributions, promise, params.clientCapabilities);\n    const jsonHover = new JSONHover(jsonSchemaService, params.contributions, promise);\n    const jsonDocumentSymbols = new JSONDocumentSymbols(jsonSchemaService);\n    const jsonValidation = new JSONValidation(jsonSchemaService, promise);\n    return {\n        configure: (settings) => {\n            jsonSchemaService.clearExternalSchemas();\n            settings.schemas?.forEach(jsonSchemaService.registerExternalSchema.bind(jsonSchemaService));\n            jsonValidation.configure(settings);\n        },\n        resetSchema: (uri) => jsonSchemaService.onResourceChange(uri),\n        doValidation: jsonValidation.doValidation.bind(jsonValidation),\n        getLanguageStatus: jsonValidation.getLanguageStatus.bind(jsonValidation),\n        parseJSONDocument: (document) => parse(document, { collectComments: true }),\n        newJSONDocument: (root, diagnostics) => newJSONDocument(root, diagnostics),\n        getMatchingSchemas: jsonSchemaService.getMatchingSchemas.bind(jsonSchemaService),\n        doResolve: jsonCompletion.doResolve.bind(jsonCompletion),\n        doComplete: jsonCompletion.doComplete.bind(jsonCompletion),\n        findDocumentSymbols: jsonDocumentSymbols.findDocumentSymbols.bind(jsonDocumentSymbols),\n        findDocumentSymbols2: jsonDocumentSymbols.findDocumentSymbols2.bind(jsonDocumentSymbols),\n        findDocumentColors: jsonDocumentSymbols.findDocumentColors.bind(jsonDocumentSymbols),\n        getColorPresentations: jsonDocumentSymbols.getColorPresentations.bind(jsonDocumentSymbols),\n        doHover: jsonHover.doHover.bind(jsonHover),\n        getFoldingRanges,\n        getSelectionRanges,\n        findDefinition: () => Promise.resolve([]),\n        findLinks,\n        format: (document, range, options) => format(document, options, range),\n        sort: (document, options) => sort(document, options)\n    };\n}\n\nexport { getLanguageService };\n","import { getLanguageService } from '../../../external/vscode-json-languageservice/lib/esm/jsonLanguageService.js';\nimport { URI } from '../../../external/vscode-uri/lib/esm/index.js';\nimport { ClientCapabilities } from '../../../external/vscode-json-languageservice/lib/esm/jsonLanguageTypes.js';\nimport { TextDocument } from '../../../external/vscode-languageserver-textdocument/lib/esm/main.js';\n\nlet defaultSchemaRequestService;\nif (typeof fetch !== \"undefined\") {\n  defaultSchemaRequestService = function(url) {\n    return fetch(url).then((response) => response.text());\n  };\n}\nclass JSONWorker {\n  constructor(ctx, createData) {\n    this._ctx = ctx;\n    this._languageSettings = createData.languageSettings;\n    this._languageId = createData.languageId;\n    this._languageService = getLanguageService({\n      workspaceContext: {\n        resolveRelativePath: (relativePath, resource) => {\n          const base = resource.substr(0, resource.lastIndexOf(\"/\") + 1);\n          return resolvePath(base, relativePath);\n        }\n      },\n      schemaRequestService: createData.enableSchemaRequest ? defaultSchemaRequestService : void 0,\n      clientCapabilities: ClientCapabilities.LATEST\n    });\n    this._languageService.configure(this._languageSettings);\n  }\n  async doValidation(uri) {\n    let document = this._getTextDocument(uri);\n    if (document) {\n      let jsonDocument = this._languageService.parseJSONDocument(document);\n      return this._languageService.doValidation(document, jsonDocument, this._languageSettings);\n    }\n    return Promise.resolve([]);\n  }\n  async doComplete(uri, position) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return null;\n    }\n    let jsonDocument = this._languageService.parseJSONDocument(document);\n    return this._languageService.doComplete(document, position, jsonDocument);\n  }\n  async doResolve(item) {\n    return this._languageService.doResolve(item);\n  }\n  async doHover(uri, position) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return null;\n    }\n    let jsonDocument = this._languageService.parseJSONDocument(document);\n    return this._languageService.doHover(document, position, jsonDocument);\n  }\n  async format(uri, range, options) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return [];\n    }\n    let textEdits = this._languageService.format(document, range, options);\n    return Promise.resolve(textEdits);\n  }\n  async resetSchema(uri) {\n    return Promise.resolve(this._languageService.resetSchema(uri));\n  }\n  async findDocumentSymbols(uri) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return [];\n    }\n    let jsonDocument = this._languageService.parseJSONDocument(document);\n    let symbols = this._languageService.findDocumentSymbols2(document, jsonDocument);\n    return Promise.resolve(symbols);\n  }\n  async findDocumentColors(uri) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return [];\n    }\n    let jsonDocument = this._languageService.parseJSONDocument(document);\n    let colorSymbols = this._languageService.findDocumentColors(document, jsonDocument);\n    return Promise.resolve(colorSymbols);\n  }\n  async getColorPresentations(uri, color, range) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return [];\n    }\n    let jsonDocument = this._languageService.parseJSONDocument(document);\n    let colorPresentations = this._languageService.getColorPresentations(\n      document,\n      jsonDocument,\n      color,\n      range\n    );\n    return Promise.resolve(colorPresentations);\n  }\n  async getFoldingRanges(uri, context) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return [];\n    }\n    let ranges = this._languageService.getFoldingRanges(document, context);\n    return Promise.resolve(ranges);\n  }\n  async getSelectionRanges(uri, positions) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return [];\n    }\n    let jsonDocument = this._languageService.parseJSONDocument(document);\n    let ranges = this._languageService.getSelectionRanges(document, positions, jsonDocument);\n    return Promise.resolve(ranges);\n  }\n  async parseJSONDocument(uri) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return null;\n    }\n    let jsonDocument = this._languageService.parseJSONDocument(document);\n    return Promise.resolve(jsonDocument);\n  }\n  async getMatchingSchemas(uri) {\n    let document = this._getTextDocument(uri);\n    if (!document) {\n      return [];\n    }\n    let jsonDocument = this._languageService.parseJSONDocument(document);\n    return Promise.resolve(this._languageService.getMatchingSchemas(document, jsonDocument));\n  }\n  _getTextDocument(uri) {\n    let models = this._ctx.getMirrorModels();\n    for (let model of models) {\n      if (model.uri.toString() === uri) {\n        return TextDocument.create(\n          uri,\n          this._languageId,\n          model.version,\n          model.getValue()\n        );\n      }\n    }\n    return null;\n  }\n}\nconst Slash = \"/\".charCodeAt(0);\nconst Dot = \".\".charCodeAt(0);\nfunction isAbsolutePath(path) {\n  return path.charCodeAt(0) === Slash;\n}\nfunction resolvePath(uriString, path) {\n  if (isAbsolutePath(path)) {\n    const uri = URI.parse(uriString);\n    const parts = path.split(\"/\");\n    return uri.with({ path: normalizePath(parts) }).toString();\n  }\n  return joinPath(uriString, path);\n}\nfunction normalizePath(parts) {\n  const newParts = [];\n  for (const part of parts) {\n    if (part.length === 0 || part.length === 1 && part.charCodeAt(0) === Dot) ; else if (part.length === 2 && part.charCodeAt(0) === Dot && part.charCodeAt(1) === Dot) {\n      newParts.pop();\n    } else {\n      newParts.push(part);\n    }\n  }\n  if (parts.length > 1 && parts[parts.length - 1].length === 0) {\n    newParts.push(\"\");\n  }\n  let res = newParts.join(\"/\");\n  if (parts[0].length === 0) {\n    res = \"/\" + res;\n  }\n  return res;\n}\nfunction joinPath(uriString, ...paths) {\n  const uri = URI.parse(uriString);\n  const parts = uri.path.split(\"/\");\n  for (let path of paths) {\n    parts.push(...path.split(\"/\"));\n  }\n  return uri.with({ path: normalizePath(parts) }).toString();\n}\n\nexport { JSONWorker };\n","import { initialize } from '../../common/initialize.js';\nimport { JSONWorker } from './jsonWorker.js';\n\nself.onmessage = () => {\n  initialize((ctx, createData) => {\n    return new JSONWorker(ctx, createData);\n  });\n};\n"],"names":["ErrorHandler","ErrorNoTelemetry","listener","errorHandler","onUnexpectedError","e","isCancellationError","transformErrorForSerialization","error","name","message","cause","stack","canceledName","CancellationError","msg","err","result","BugIndicatingError","assertNever","value","assert","condition","messageOrError","assertFn","checkAdjacentItems","items","predicate","i","a","b","isString","str","isIterable","obj","Iterable","is","thing","_empty","empty","single","element","wrap","iterableOrElement","from","iterable","reverse","array","isEmpty","first","some","every","find","filter","map","fn","index","flatMap","concat","iterables","item","reduce","reducer","initialValue","length","count","_","slice","arr","to","consume","atMost","consumed","iterator","next","asyncToArray","asyncToArrayFlat","setParentOfDisposable","child","parent","dispose","arg","errors","d","combinedDisposable","disposables","toDisposable","FunctionDisposable","_DisposableStore","o","Disposable","DisposableStore","_Disposable","_Node","Node","LinkedList","node","atTheEnd","newNode","oldLast","oldFirst","didRemove","res","anchor","performanceNow","StopWatch","highResolution","Event","defer","event","disposable","debounce","once","thisArgs","didFire","onceIf","snapshot","forEach","each","signal","any","events","addAndReturnDisposable","merge","initial","output","options","emitter","Emitter","store","delay","leading","flushOnListenerRemove","leakWarningThreshold","subscription","handle","numDebouncedCalls","doFire","cur","_output","accumulate","last","latch","equals","firstCall","cache","shouldEmit","split","isT","buffer","flushAfterTimeout","_buffer","flush","chain","sythensize","cs","ChainableSynthesis","HaltChainable","v","step","fromNodeEventEmitter","eventName","id","args","onFirstListenerAdd","onLastListenerRemove","fromDOMEventEmitter","toPromise","cancelRef","promise","resolve","reject","forward","runAndSubscribe","handler","EmitterObserver","_observable","_change","fromObservable","obs","fromObservableLight","observable","didChange","observer","_EventProfiling","listenerCount","elapsed","EventProfiling","_globalLeakWarningThreshold","_LeakageMonitor","_errorHandler","threshold","topStack","topCount","ListenerLeakError","LeakageMonitor","Stacktrace","ListenerRefusalError","UniqueContainer","compactionThreshold","callback","tuple","contained","removeMonitor","EventDeliveryQueuePrivate","listeners","adjustDeliveryQueue","n","dq","end","getNLSMessages","getNLSLanguage","isPseudo","_format","match","rest","localize","data","lookupMessage","fallback","LANGUAGE_DEFAULT","_isWindows","_isMacintosh","_isLinux","_locale","_language","_platformLocale","_translationsConfigFile","_userAgent","$globalThis","nodeProcess","isElectronRenderer","rawNlsConfig","nlsConfig","isWindows","isMacintosh","userAgent","setTimeout0IsFaster","pending","len","candidate","lastId","myId","isChrome","identity","LRUCachedFunction","arg1","arg2","key","LazyValueState","Lazy","executor","escapeRegExpCharacters","regExpLeadsToEndlessLoop","regexp","splitLines","firstNonWhitespaceIndex","chCode","lastNonWhitespaceIndex","startIndex","isUpperAsciiLetter","code","commonPrefixLength","commonSuffixLength","aLastIndex","bLastIndex","isHighSurrogate","charCode","isLowSurrogate","computeCodePoint","highSurrogate","lowSurrogate","getNextCodePoint","offset","nextCharCode","IS_BASIC_ASCII","isBasicASCII","_AmbiguousCharacters","locales","confusableDictionary","codePoint","arrayToMap","mergeMaps","map1","map2","intersectMaps","filteredLocales","l","languageSpecificMap","locale","commonMap","k","AmbiguousCharacters","_InvisibleCharacters","InvisibleCharacters","DEFAULT_CHANNEL","INITIALIZE","RequestMessage","vsWorker","req","channel","method","ReplyMessage","seq","SubscribeEventMessage","EventMessage","UnsubscribeEventMessage","WebWorkerProtocol","workerId","sendMessageBarrier","target","propertyIsDynamicEvent","propertyIsEvent","myArgs","replyMessage","reply","newErr","requestMessage","r","transfer","WebWorkerServer","postMessage","requestHandlerFactory","requestHandler","inst","initialized","initialize","factory","webWorkerServer","workerServer","DiffChange","originalStart","originalLength","modifiedStart","modifiedLength","numberHash","val","initialHashVal","stringHash","s","hashVal","StringDiffSequence","source","characters","stringDiff","original","modified","pretty","LcsDiff","Debug","MyArray","sourceArray","sourceIndex","destinationArray","destinationIndex","DiffChangeHelper","originalIndex","modifiedIndex","originalSequence","modifiedSequence","continueProcessingPredicate","originalStringElements","originalElementsOrHash","originalHasStrings","modifiedStringElements","modifiedElementsOrHash","modifiedHasStrings","sequence","elements","hashes","newIndex","originalElement","modifiedElement","index1","index2","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","temp","change","originalStop","modifiedStop","checkOriginal","checkModified","startStrictEqual","mergedChangeArr","prevChange","bestDelta","bestScore","delta","score","aChange","bChange","matchedLength","aOriginalStart","bOriginalEnd","abOriginalLength","aModifiedStart","bModifiedEnd","abModifiedLength","t","originalMatchStart","modifiedMatchStart","desiredLength","originalMax","modifiedMax","bestOriginalStart","bestModifiedStart","j","originalScore","modifiedScore","left","right","diagonalBaseIndex","diagonalsBelow","diagonalsAbove","diffEven","lowerBoundEven","upperBoundEven","Position$1","Position","lineNumber","column","newLineNumber","newColumn","deltaLineNumber","deltaColumn","other","aLineNumber","bLineNumber","aColumn","bColumn","pos","Range$1","Range","startLineNumber","startColumn","endLineNumber","endColumn","range","position","otherRange","resultStartLineNumber","resultStartColumn","resultEndLineNumber","resultEndColumn","otherStartLineNumber","otherStartColumn","otherEndLineNumber","otherEndColumn","lineCount","start","aStartLineNumber","bStartLineNumber","aStartColumn","bStartColumn","aEndLineNumber","bEndLineNumber","aEndColumn","bEndColumn","toUint8","toUint32","CharacterClassifier","_defaultValue","defaultValue","asciiMap","_value","Uint8Matrix","rows","cols","row","col","StateMachine","edges","maxCharCode","maxState","states","currentState","_stateMachine","getStateMachine","_classifier","getClassifier","FORCE_TERMINATION_CHARACTERS","CANNOT_END_WITH_CHARACTERS","LinkComputer","classifier","line","linkBeginIndex","linkEndIndex","lastIncludedCharIndex","charCodeBeforeLink","lastCharCodeInLink","model","stateMachine","linkBeginChCode","state","hasOpenParens","hasOpenSquareBracket","inSquareBrackets","hasOpenCurlyBracket","resetStateMachine","chClass","computeLinks","_BasicInplaceReplace","range1","text1","range2","text2","up","text","numberResult","precision","n1","n2","valueSets","valueSet","idx","BasicInplaceReplace","shortcutEvent","context","CancellationToken","isCancellationToken","MutableToken","CancellationTokenSource","cancel","KeyCodeStrMap","keyCode","uiMap","userSettingsUSMap","userSettingsGeneralMap","EVENT_KEY_CODE_MAP","scanCodeStrToInt","scanCodeLowerCaseStrToInt","mappings","seenKeyCode","seenScanCode","mapping","immutable","scanCode","scanCodeStr","keyCodeStr","eventKeyCode","vkey","usUserSettingsLabel","generalUserSettingsLabel","KeyCodeUtils","toString","fromString","toUserSettingsUS","toUserSettingsGeneral","fromUserSettings","toElectronAccelerator","KeyChord","firstPart","secondPart","chordPart","safeProcess","vscodeGlobal","sandboxProcess","cwd","env","platform","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","type","validateObject","pathObject","validateString","platformIsWin32","isPathSeparator","isPosixPathSeparator","isWindowsDeviceRoot","normalizeString","path","allowAboveRoot","separator","lastSegmentLength","lastSlash","dots","lastSlashIndex","formatExt","ext","sep","dir","base","win32","pathSegments","resolvedDevice","resolvedTail","resolvedAbsolute","rootEnd","device","isAbsolute","tail","paths","joined","needsReplace","slashCount","firstLen","fromOrig","toOrig","fromSplit","toSplit","fromLen","toLen","fromStart","fromEnd","toStart","toEnd","lastCommonSep","fromCode","out","resolvedPath","matchedSlash","suffix","extIdx","firstNonSlashEnd","startDot","startPart","preDotState","ret","posixCwd","cwd$1","posix","trailingSeparator","hasRoot","char","_schemePattern","_singleSlashStart","_doubleSlashStart","_validateUri","_strict","_schemeFix","scheme","_referenceResolution","_slash","_regexp","URI$2","URI","schemeOrData","authority","query","fragment","uriToFsPath","Uri","percentDecode","components","strict","uri","pathFragment","newPath","skipEncoding","_asFormatted","_pathSepMarker","encodeTable","encodeURIComponentFast","uriComponent","isPath","isAuthority","nativeEncodePos","escaped","encodeURIComponentMinimal","keepDriveLetterCasing","encoder","userinfo","decodeURIComponentGraceful","_rEncodedAsHex","Selection","selectionStartLineNumber","selectionStartColumn","positionLineNumber","positionColumn","direction","sel","_codiconFontCharacters","register","fontCharacter","codiconsLibrary","codiconsDerived","Codicon","TokenizationRegistry","languageIds","languageId","support","myData","TokenizationSupportFactoryData","tokenizationSupport","colorMap","_registry","_languageId","_factory","Token","language","HoverVerbosityAction","CompletionItemKinds","byKind","toIcon","kind","codicon","toLabel","InlineCompletionTriggerKind","InlineCompletionHintStyle","InlineCompletionEndOfLifeReasonKind","DocumentPasteTriggerKind","SignatureHelpTriggerKind","DocumentHighlightKind","SymbolKinds","icon","byCompletionKind","toCompletionKind","completionKind","FoldingRangeKind$1","_a","NewSymbolNameTag","NewSymbolNameTriggerKind","Command","InlayHintKind","TokenizationRegistry$1","AccessibilitySupport","CodeActionTriggerType","CompletionItemInsertTextRule","CompletionItemKind","CompletionItemTag","CompletionTriggerKind","ContentWidgetPositionPreference","CursorChangeReason","DefaultEndOfLine","EditorAutoIndentStrategy","EditorOption","EndOfLinePreference","EndOfLineSequence","GlyphMarginLane","IndentAction","InjectedTextCursorStops","KeyCode","MarkerSeverity","MarkerTag","MinimapPosition","MinimapSectionHeaderStyle","MouseTargetType","OverlayWidgetPositionPreference","OverviewRulerLane","PartialAcceptTriggerKind","PositionAffinity","RenderLineNumbersType","RenderMinimap","ScrollType","ScrollbarVisibility","SelectionDirection","ShowLightbulbIconMode","SymbolKind","SymbolTag","TextDirection","TextEditorCursorBlinkingStyle","TextEditorCursorStyle","TrackedRangeStickiness","WrappingIndent","_KeyMod","KeyMod","createMonacoBaseAPI","_c","LinkedMap","touch","callbackfn","thisArg","current","newSize","currentSize","previous","Cache","limit","ratio","LRUCache","SetMap","values","isMultilineRegexSource","searchString","nextChCode","leftIsWordBounday","wordSeparators","textLength","matchStartIndex","matchLength","charBefore","firstCharInMatch","rightIsWordBounday","charAfter","lastCharInMatch","isValidMatch","Searcher","searchRegex","lastIndex","m","USUAL_WORD_SEPARATORS","createWordRegExp","allowInWords","DEFAULT_WORD_REGEXP","ensureValidWordDefinition","wordDefinition","flags","_defaultConfig","getWordAtText","textOffset","config","t1","prevRegexIndex","regexIndex","thisMatch","_findRegexMatchEnclosingPosition","stopPos","matchIndex","UnicodeTextModelHighlighter","startLine","endLine","codePointHighlighter","CodePointHighlighter","candidates","regex","buildRegExpCharClassExpr","searcher","ranges","hasMore","ambiguousCharacterCount","invisibleCharacterCount","nonBasicAsciiCharacterCount","forLoop","lineContent","lineLength","endIndex","charCodeBefore","word","highlightReason","primaryConfusable","notAmbiguousInLocales","codePoints","set","cp","isAllowedInvisibleCharacter","character","wordContext","hasBasicASCIICharacters","hasNonConfusableNonBasicAsciiCharacter","isBasicASCII$1","LinesDiff","moves","hitTimeout","MovedText","lineRangeMapping","one","itemEquals","groupAdjacentBy","shouldBeGrouped","currentGroup","forEachAdjacent","f","forEachWithNeighbors","pushMany","CompareResult","isLessThan","isLessThanOrEqual","isGreaterThan","isNeitherLessOrGreaterThan","compareBy","selector","comparator","numberComparator","reverseOrder","_CallbackIterable","iterate","cb","mapFn","_callback","CallbackIterable","OffsetRange","endExclusive","sortedRanges","findLastMonotonous","findLastIdxMonotonous","startIdx","endIdxEx","findFirstMonotonous","findFirstIdxMonotonousOrArrLen","_MonotonousArray","_array","MonotonousArray","_LineRange","lineRanges","LineRangeSet","endLineNumberExclusive","lineRange","marginTop","marginBottom","LineRange","_normalizedRanges","joinRangeStartIdx","joinRangeEndIdxExclusive","joinRange","rangeThatStartsBeforeEnd","i1","i2","lineRange1","lineRange2","r1","r2","_TextLength","position1","position2","c","columnCount","startPosition","TextLength","PositionOffsetTransformerBase","offsetRange","edit","Deps","edits","_Deps","PositionOffsetTransformer","valPos","lineIdx","AbstractText","LineBasedText","_getLineContent","_lineCount","lastLine","ArrayText","lines","TextReplacement","replacements","startPos","endPos","newText","curEdit","nextEdit","gapRange","gapText","replacement","initialState","second","normalizedOriginalText","normalizedModifiedText","commonPrefixLen","commonSuffixLen","LineRangeMapping","originalLineCount","modifiedLineCount","lastOriginalEndLineNumber","lastModifiedEndLineNumber","originalRange","modifiedRange","origInclusiveRange","modInclusiveRange","RangeMapping","isValidLineNumber","normalizePosition","content","DetailedLineRangeMapping","rangeMappings","innerChanges","newRanges","lineRangeMappingFromRangeMappings","alignments","originalLines","modifiedLines","dontAssertStartLine","g","getLineRangeMapping","a1","a2","m1","m2","rangeMapping","lineStartDelta","lineEndDelta","originalLineRange","modifiedLineRange","MINIMUM_MATCHING_CHARACTER_LENGTH","LegacyLinesDiffComputer","DiffComputer","lastChange","computeDiff","LineSequence$1","startColumns","endColumns","getFirstNonBlankColumn","getLastNonBlankColumn","shouldIgnoreTrimWhitespace","charCodes","lineNumbers","columns","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","opts","LineSequence","createContinueProcessingPredicate","diffResult","quitEarly","lineChanges","originalLineIndex","modifiedLineIndex","nextChange","originalLine","modifiedLine","originalChar","modifiedChar","originalMaxColumn","modifiedMaxColumn","originalLineNumber","modifiedLineNumber","txt","maximumRuntime","startTime","DiffAlgorithmResult","seq1","seq2","SequenceDiff","diffs","sequenceDiffs","doc1Length","OffsetPair","seq1Range","seq2Range","_OffsetPair","offset1","offset2","_InfiniteTimeout","InfiniteTimeout","DateTimeout","timeout","Array2D","width","height","x","y","isSpace","_LineRangeFragment","chr","counter","sumDifferences","maxLength","LineRangeFragment","DynamicProgrammingDiffing","sequence1","sequence2","equalityScore","lcsLengths","directions","lengths","s1","s2","horizontalLen","verticalLen","extendedSeqScore","newValue","prevLen","lastAligningPosS1","lastAligningPosS2","reportDecreasingAligningPositions","MyersDiffAlgorithm","seqX","seqY","getXAfterSnake","V","FastInt32Array","FastArrayNegativeIndices","SnakePath","loop","lowerBound","upperBound","maxXofDLineTop","maxXofDLineLeft","newMaxX","lastPath","endX","endY","prev","LinesSliceCharSequence","considerWhitespaceChanges","lineStartOffset","trimmedWsLength","trimmedStartLine","prevCategory","getCategory","nextCategory","getCategoryBoundaryScore","preference","lineOffset","pos1","pos2","isWordChar","isUpperCase","category","computeMovedLines","hashedOriginalLines","hashedModifiedLines","excludedChanges","computeMovesFromSimpleDeletionsToSimpleInsertions","filteredChanges","unchangedMoves","computeUnchangedMoves","joinCloseConsecutiveMoves","countWhere","removeMovesInSameDiff","deletions","insertions","deletion","highestSimilarity","best","insertion","similarity","original3LineHashes","possibleMappings","lastMappings","currentModifiedRange","nextMappings","lastMapping","modifiedSet","originalSet","diffOrigToMod","modifiedSections","originalTranslatedSections","modifiedIntersectedSections","monotonousChanges","move","firstTouchingChangeOrig","firstTouchingChangeMod","linesAbove","lastTouchingChangeOrig","lastTouchingChangeMod","linesBelow","extendToTop","origLine","modLine","areLinesSimilar","extendToBottom","line1","line2","commonNonSpaceCharCount","inverted","countNonWsChars","longerLineLength","originalDist","modifiedDist","changesMonotonous","diffBeforeEndOfMoveOriginal","diffBeforeEndOfMoveModified","optimizeSequenceDiffs","joinSequenceDiffsByShifting","shiftSequenceDiffs","prevResult","result2","nextResult","prevDiff","diff","nextDiff","seq1ValidRange","seq2ValidRange","shiftDiffToBetterPosition","deltaBefore","deltaAfter","seq2OffsetStart","seq2OffsetEndExclusive","seq1Offset","removeShortMatches","extendDiffsToEntireWordIfAppropriate","findParent","force","equalMappings","additional","lastPoint","scanWord","pair","equalMapping","w1","w2","w","equalPart","equalChars1","equalChars2","v1","v2","mergeSequenceDiffs","sequenceDiffs1","sequenceDiffs2","sd1","sd2","removeVeryShortMatchingLinesBetweenDiffs","_sequence2","shouldRepeat","shouldJoinDiffs","before","after","unchangedRange","lastResult","removeVeryShortMatchingTextBetweenLongDiffs","unchangedText","beforeLineCount1","beforeSeq1Length","beforeLineCount2","beforeSeq2Length","afterLineCount1","afterSeq1Length","afterLineCount2","afterSeq2Length","max","cap","newDiffs","newDiff","shouldMarkAsChanged","fullRange1","prefix","availableSpace","trimmedHash","indentationBefore","getIndentation","indentationAfter","DefaultLinesDiffComputer","perfectHashes","getOrCreateHash","hash","originalLinesHashes","modifiedLinesHashes","lineAlignmentResult","lineAlignments","scanForWhitespaceChanges","equalLinesCount","seq1LastStart","seq2Offset","seq2LastStart","characterDiffs","validatePosition","validateRange","ic","moveChanges","toLineRangeMapping","slice1","slice2","sequenceDiff","linesDiffComputers","roundFloat","number","decimalPoints","decimal","RGBA","HSLA","h","rgba","min","chroma","p","q","hsla","HSVA","cmax","cmin","hsva","Color$1","_b","hex","R","G","B","luminance","color","another","lum1","lum2","factor","normalize","thisRGBA","otherRGBA","opaqueBackground","of","relative","Color","Format","CSS","formatRGB","formatRGBA","formatHSL","formatHSLA","_toTwoDigitHex","formatHex","formatHexA","compact","format","parse","css","parseHex","parseNamedKeyword","_parseHexDigit","_parseCaptureGroups","captureGroups","captureGroup","parsedNumber","_toIColor","_findRange","_findHexColorInformation","hexValue","parsedHexColor","_findRGBColorInformation","matches","isAlpha","parsedRegex","_findHSLColorInformation","colorEquivalent","_findMatches","computeColors","initialValidationRegex","initialValidationMatches","initialMatch","initialCaptureGroups","colorScheme","colorParameters","colorInformation","regexParameters","computeDefaultDocumentColors","trimDashesRegex","CHUNK_SIZE","MAX_SECTION_LINES","findSectionHeaders","headers","regionHeaders","collectRegionHeaders","markHeaders","collectMarkHeaders","sectionHeader","getHeaderText","multiline","precedingText","matchLines","matchHeight","matchEndLine","lineStartIndex","lastMatchLine","hasSeparatorLine","DeferredPromise","Promises","settled","promises","firstError","withAsyncBody","bodyFn","ProducerConsumer","deferred","_AsyncIterableProducer","_onReturn","writer","filterFn","AsyncIterableProducer","PrefixSumComputer","insertIndex","insertValues","oldValues","oldPrefixSum","insertValuesLen","maxCount","sum","low","high","mid","midStop","midStart","PrefixSumIndexOfResult","remainder","MirrorTextModel","eol","versionId","eolLength","linesLength","lineStartValues","lineIndex","insertText","insertLines","newLengths","WorkerTextModelSyncServer","all","MirrorModel","offsetToAdd","iteratorOverMatches","wordAtText","wordenize","lineText","wordRangesIdx","wordRanges","words","lineEnding","startLineIndex","endLineIndex","resultLines","hasChanged","maxCharacter","_EditorWorker","_foreignModule","url","originalUrl","modifiedUrl","algorithm","originalTextModel","modifiedTextModel","diffAlgorithm","identical","getLineChanges","modelUrl","lastEol","aRng","bRng","writeIndex","readIndex","editOffset","newEdit","modelUrls","leadingWord","wordDef","wordDefFlags","sw","wordDefRegExp","seen","outer","selectionText","wordRange","EditorWorker","_EditorWorkerHost","workerClient","EditorWorkerHost","createClient","client","editorWorkerHost","ctx","prop","receiver","createScanner","ignoreTrivia","tokenOffset","token","tokenLineStartOffset","prevTokenLineStartOffset","scanError","scanHexDigits","exact","digits","ch","setPosition","newPosition","scanNumber","isDigit","scanString","ch3","isLineBreak","scanNext","isWhiteSpace","safeLength","commentClosed","isUnknownContentCharacter","scanNextNonTrivia","CharacterCodes","cachedSpaces","maxCachedValues","cachedBreakLinesWithSpaces","supportedEols","documentText","initialIndentLevel","formatText","formatTextStart","rangeStart","rangeEnd","isEOL","endOffset","computeIndentLevel","getEOL","eolFastPathSupported","numberLineBreaks","indentLevel","indentValue","repeat","indentType","scanner","hasError","newLinesAndIndent","amountOfSpaces","editOperations","addEdit","startOffset","firstToken","firstTokenStart","initialIndent","firstTokenEnd","secondToken","replaceContent","needsLineBreak","commentTokenStart","secondTokenStart","nChars","tabSize","ParseOptions","currentProperty","currentParent","previousParents","onValue","visit","object","getNodePath","getNodeValue","valueNode","contains","includeRightBound","findNodeAtOffset","children","visitor","_scanner","_jsonPath","toNoArgVisit","visitFunction","toNoArgVisitWithPath","toOneArgVisit","toOneArgVisitWithPath","onObjectBegin","onObjectProperty","onObjectEnd","onArrayBegin","onArrayEnd","onLiteralValue","onSeparator","onComment","onError","disallowComments","allowTrailingComma","handleError","skipUntilAfter","skipUntil","parseString","isValue","parseLiteral","tokenValue","parseProperty","parseValue","parseObject","needsComma","parseArray","isFirstElement","createScanner$1","ScanError","SyntaxKind","parse$1","findNodeAtOffset$1","getNodePath$1","getNodeValue$1","ParseErrorCode","format$1","oneKeys","otherKeys","isNumber","isDefined","isBoolean","isObject","startsWith","haystack","needle","endsWith","extendedRegExp","pattern","stringLength","DocumentUri","integer","uinteger","create","Is","two","three","four","Location","LocationLink","targetUri","targetRange","targetSelectionRange","originSelectionRange","red","green","blue","alpha","ColorInformation","ColorPresentation","label","textEdit","additionalTextEdits","TextEdit","FoldingRangeKind","FoldingRange","startCharacter","endCharacter","collapsedText","DiagnosticRelatedInformation","location","DiagnosticSeverity","DiagnosticTag","CodeDescription","Diagnostic","severity","relatedInformation","title","command","replace","insert","del","ChangeAnnotation","needsConfirmation","description","ChangeAnnotationIdentifier","AnnotatedTextEdit","annotation","TextDocumentEdit","textDocument","OptionalVersionedTextDocumentIdentifier","CreateFile","RenameFile","oldUri","newUri","DeleteFile","WorkspaceEdit","TextDocumentIdentifier","VersionedTextDocumentIdentifier","version","TextDocumentItem","MarkupKind","MarkupContent","InsertTextFormat","InsertReplaceEdit","InsertTextMode","CompletionItemLabelDetails","CompletionItem","CompletionList","isIncomplete","MarkedString","fromPlainText","plainText","Hover","ParameterInformation","documentation","SignatureInformation","parameters","DocumentHighlight","SymbolInformation","containerName","WorkspaceSymbol","DocumentSymbol","detail","selectionRange","CodeActionKind","CodeActionTriggerKind","CodeActionContext","diagnostics","only","triggerKind","CodeAction","kindOrCommandOrEdit","checkKind","CodeLens","FormattingOptions","insertSpaces","DocumentLink","SelectionRange","SemanticTokenTypes","SemanticTokenModifiers","SemanticTokens","InlineValueText","InlineValueVariableLookup","variableName","caseSensitiveLookup","InlineValueEvaluatableExpression","expression","InlineValueContext","frameId","stoppedLocation","InlayHintLabelPart","InlayHint","StringValue","createSnippet","InlineCompletionItem","filterText","InlineCompletionList","SelectedCompletionInfo","InlineCompletionContext","selectedCompletionInfo","WorkspaceFolder","TextDocument","FullTextDocument","applyEdits","document","sortedEdits","mergeSort","lastModifiedOffset","compare","leftIdx","rightIdx","FullTextDocument$1","lineOffsets","isLineStart","nextLineOffset","defined","undefined$1","boolean","string","numberRange","func","objectLiteral","typedArray","check","getWellformedRange","addedLineOffsets","computeLineOffsets","update","getWellformedEdit","spans","isAtLineStart","ErrorCode","SchemaDraft","ClientCapabilities","firstArg","formatArgs","_format2Regexp","template","group","formats","ASTNodeImpl","NullASTNodeImpl","BooleanASTNodeImpl","boolValue","ArrayASTNodeImpl","NumberASTNodeImpl","StringASTNodeImpl","PropertyASTNodeImpl","keyNode","ObjectASTNodeImpl","asSchema","schema","EnumMatch","schemaDraftFromId","EvaluationContext","schemaDraft","SchemaCollector","focusOffset","exclude","NoOpSchemaCollector","_schema","_other","_node","ValidationResult","validationResult","propertyValidationResult","hasProblems","newJSONDocument","root","JSONDocument","syntaxErrors","comments","doVisit","ctn","validate","getSchemaDraft","matchingSchemas","fallBack","schemaId","_validateNode","_validateObjectNode","_validateArrayNode","_validateStringNode","_validateNumberNode","matchesType","subSchemaRef","subValidationResult","subMatchingSchemas","notSchema","ms","testAlternatives","alternatives","maxOneMatch","bestMatch","subSchema","compareResult","testBranch","testCondition","ifSchema","thenSchema","elseSchema","enumValueMatch","deprecationMessage","targetNode","normalizeFloats","float","parts","normMultipleOf","normValue","multiplier","getExclusiveLimit","exclusive","getLimit","exclusiveMinimum","exclusiveMaximum","minimum","maximum","errorMessage","prefixItemsSchemas","additionalItemSchema","itemValidationResult","containsSchema","containsCount","unevaluatedItems","hasDuplicates","seenKeys","unprocessedProperties","propertyNode","propertyName","propertyProcessed","propertySchema","propertyPattern","processed","additionalProperties","unevaluatedProperties","propertyDeps","_validatePropertyDependencies","propertyNames","propertyDep","requiredProp","problems","lastProblemOffset","commentRanges","_scanNext","_checkScanError","_errorAtRange","_error","_finalize","_parseArray","commaOffset","_parseValue","keyPlaceholder","_parseProperty","keysSeen","_parseString","_parseObject","property","_parseNumber","numberValue","_parseLiteral","_root","stringifyObject","indent","stringifyLiteral","newIndent","keys","JSONCompletion","schemaService","contributions","promiseConstructor","clientCapabilities","resolveCompletion","resolver","doc","currentWord","overwriteRange","overwriteStart","proposed","collector","suggestion","existing","shortendedLabel","collectionPromises","addValue","currentKey","separatorAfter","contribution","collectPromise","types","offsetForSeparator","schemaProperties","proposal","schemaPropertyNames","propertyNameCompletionItem","enumDescription","collectCompletionsForSimilarObject","parentKey","collectSuggestionsForValues","existingValues","propertyMatched","arrayDepth","hasProposals","completionItem","example","enm","snippetValue","propertyText","resultText","nValueProposals","body","markupString","documentationFormat","JSONHover","hoverRangeNode","hoverRange","createHover","contents","htmlContent","markdownDescription","markdownEnumValueDescription","enumValue","toMarkdown","toMarkdownCodeBlock","plain","JSONValidation","jsonSchemaService","raw","jsonDocument","documentSettings","added","addProblem","problem","signature","getDiagnostics","trailingCommaSeverity","toDiagnosticSeverity","commentSeverity","schemaValidation","schemaRequest","addSchemaProblem","errorCode","astRoot","warning","semanticErrors","schemaAllowsComments","schemaAllowsTrailingCommas","idCounter","resolvedSchema","schemaRef","allow","deprSchemaRef","severityLevel","Digit0","Digit9","A","hexDigit","colorFromHex","JSONDocumentSymbols","resourceString","getRange","getName","toVisit","nextToVisit","limitExceeded","collectOutlineEntries","childContainerName","symbol","nodeType","visitedNode","nodeId","red256","green256","blue256","toTwoDigitHex","schemaContributions","descriptions","schemaName","propertyObject","LIB","u","P","C","Utils","createRegex","glob","reStr","extended","globstar","inGroup","prevChar","starCount","nextChar","BANG","PATH_SEP","FilePatternAssociation","folderUri","uris","patternString","include","normalizeResourceForMatching","fileName","SchemaHandle","service","unresolvedSchemaContent","UnresolvedSchema","unresolved","hasChanges","ResolvedSchema","warnings","JSONSchemaService","requestService","contextService","normalizeId","toWalk","curr","schemas","normalizedId","schemaAssociations","schemaAssociation","association","schemaHandle","fpa","contributionAssociation","toDisplayString","schemaContent","jsonErrors","errorSplit","schemaToResolve","resolveErrors","usesUnsupportedFeatures","findSectionByJSONPointer","part","findSchemaById","collectAnchors","section","mergeRef","sourceRoot","sourceHandle","refSegment","resolveExternalLink","parentHandle","referencedHandle","unresolvedSchema","loc","resolveRefs","parentSchema","openPromises","seenRefs","ref","segments","resolveWarnings","collectEntries","entries","entry","collectMapEntries","maps","collectArrayEntries","arrays","collectEntryOrArrayEntries","resource","normalizedResource","schemeId","schemaIds","combinedSchemaId","combinedSchema","getFoldingRanges","nestingLevels","prevStart","addRange","rangeLimit","counts","level","maxLevel","getSelectionRanges","positions","getSelectionRange","cStart","cEnd","newRange","afterCommaOffset","getOffsetAfterNextToken","expectedToken","documentToFormat","formattingOptions","formattingRange","Container","PropertyTree","beginningLineNumber","childProperty","insertionIndex","binarySearchOnPropertyArray","compareProperties","propertyTree1","propertyTree2","propertyName1","propertyName2","propertyTreeArray","propertyTree","compare_fn","firstPropertyInArrayName","lastPropertyInArrayName","cmp","sort","documentToSort","formattedJsonString","formattedJsonDocument","jsonPropertyTree","findJsoncPropertyTree","sortedJsonDocument","sortJsoncDocument","sortedAndFormattedJsonDocument","formattedDocument","formattedString","rootTree","currentTree","lastProperty","lastTokenLine","numberOfCharactersOnPreviousLines","lastNonTriviaNonCommentToken","secondToLastNonTriviaNonCommentToken","lineOfLastNonTriviaNonCommentToken","endIndexOfLastNonTriviaNonCommentToken","currentContainerStack","updateLastPropertyEndLineNumber","updateBeginningLineNumber","lengthOfLine","queueToSort","updateSortingQueue","dataToSort","jsonContentToReplace","jsonDocumentToReplace","lineWhereToAddComma","indexWhereToAddComma","commaIndex","lineWhereToRemoveComma","queue","minimumBeginningLineNumber","SortingRange","updateSortingQueueForArrayProperties","subObject","findLinks","links","findTargetNode","targetPos","createRange","tokens","parseJSONPointer","findNode","pointer","arrayItem","unescape","getLanguageService","params","jsonCompletion","jsonHover","jsonDocumentSymbols","jsonValidation","settings","defaultSchemaRequestService","response","JSONWorker","createData","relativePath","resolvePath","textEdits","symbols","colorSymbols","colorPresentations","models","Slash","Dot","isAbsolutePath","uriString","normalizePath","joinPath","newParts"],"mappings":"kCAKA,MAAMA,EAAa,CACf,aAAc,CACV,KAAK,UAAY,CAAA,EACjB,KAAK,uBAAyB,SAAU,EAAG,CACvC,WAAW,IAAM,CACb,MAAI,EAAE,MACEC,GAAiB,mBAAmB,CAAC,EAC/B,IAAIA,GAAiB,EAAE,QAAU;AAAA;AAAA,EAAS,EAAE,KAAK,EAErD,IAAI,MAAM,EAAE,QAAU;AAAA;AAAA,EAAS,EAAE,KAAK,EAE1C,CACV,EAAG,CAAC,CACR,CACJ,CACA,KAAK,EAAG,CACJ,KAAK,UAAU,QAASC,GAAa,CACjCA,EAAS,CAAC,CACd,CAAC,CACL,CACA,kBAAkB,EAAG,CACjB,KAAK,uBAAuB,CAAC,EAC7B,KAAK,KAAK,CAAC,CACf,CAEA,0BAA0B,EAAG,CACzB,KAAK,uBAAuB,CAAC,CACjC,CACJ,CACA,MAAMC,GAAe,IAAIH,GAUzB,SAASI,GAAkBC,EAAG,CAErBC,GAAoBD,CAAC,GACtBF,GAAa,kBAAkBE,CAAC,CAGxC,CAQA,SAASE,GAA+BC,EAAO,CAC3C,GAAIA,aAAiB,MAAO,CACxB,KAAM,CAAE,KAAAC,EAAM,QAAAC,EAAS,MAAAC,CAAK,EAAKH,EAE3BI,EAAQJ,EAAM,YAAcA,EAAM,MACxC,MAAO,CACH,SAAU,GACV,KAAAC,EACA,QAAAC,EACA,MAAAE,EACA,YAAaX,GAAiB,mBAAmBO,CAAK,EACtD,MAAOG,EAAQJ,GAA+BI,CAAK,EAAI,OACvD,KAAMH,EAAM,IACxB,CACI,CAEA,OAAOA,CACX,CACA,MAAMK,GAAe,WAIrB,SAASP,GAAoBE,EAAO,CAChC,OAAIA,aAAiBM,GACV,GAEJN,aAAiB,OAASA,EAAM,OAASK,IAAgBL,EAAM,UAAYK,EACtF,CAGA,MAAMC,WAA0B,KAAM,CAClC,aAAc,CACV,MAAMD,EAAY,EAClB,KAAK,KAAO,KAAK,OACrB,CACJ,CAoCA,MAAMZ,WAAyB,KAAM,CACjC,YAAYc,EAAK,CACb,MAAMA,CAAG,EACT,KAAK,KAAO,mBAChB,CACA,OAAO,UAAUC,EAAK,CAClB,GAAIA,aAAef,GACf,OAAOe,EAEX,MAAMC,EAAS,IAAIhB,GACnB,OAAAgB,EAAO,QAAUD,EAAI,QACrBC,EAAO,MAAQD,EAAI,MACZC,CACX,CACA,OAAO,mBAAmBD,EAAK,CAC3B,OAAOA,EAAI,OAAS,mBACxB,CACJ,CAMA,MAAME,WAA2B,KAAM,CACnC,YAAYR,EAAS,CACjB,MAAMA,GAAW,6BAA6B,EAC9C,OAAO,eAAe,KAAMQ,GAAmB,SAAS,CAI5D,CACJ,CCvIA,SAASC,GAAYC,EAAOV,EAAU,cAAe,CACjD,MAAM,IAAI,MAAMA,CAAO,CAC3B,CASA,SAASW,GAAOC,EAAWC,EAAiB,mBAAoB,CAC5D,GAAI,CAACD,EAKD,MAHqB,OAAOC,GAAmB,SACzC,IAAIL,GAAmB,qBAAqBK,CAAc,EAAE,EAC5DA,CAGd,CAYA,SAASC,GAASF,EAAW,CACzB,GAAI,CAACA,EAAS,EAAI,CAEd,SAEAA,EAAS,EACTlB,GAAkB,IAAIc,GAAmB,kBAAkB,CAAC,CAChE,CACJ,CACA,SAASO,GAAmBC,EAAOC,EAAW,CAC1C,IAAIC,EAAI,EACR,KAAOA,EAAIF,EAAM,OAAS,GAAG,CACzB,MAAMG,EAAIH,EAAME,CAAC,EACXE,EAAIJ,EAAME,EAAI,CAAC,EACrB,GAAI,CAACD,EAAUE,EAAGC,CAAC,EACf,MAAO,GAEXF,GACJ,CACA,MAAO,EACX,CCnEA,SAASG,GAASC,EAAK,CACnB,OAAQ,OAAOA,GAAQ,QAC3B,CAuCA,SAASC,GAAWC,EAAK,CAErB,MAAO,CAAC,CAACA,GAAO,OAAOA,EAAI,OAAO,QAAQ,GAAM,UACpD,CC/CA,IAAIC,IACH,SAAUA,EAAU,CACjB,SAASC,EAAGC,EAAO,CACf,MAAO,CAAC,CAACA,GAAS,OAAOA,GAAU,UAAY,OAAOA,EAAM,OAAO,QAAQ,GAAM,UACrF,CACAF,EAAS,GAAKC,EACd,MAAME,EAAS,OAAO,OAAO,EAAE,EAC/B,SAASC,GAAQ,CACb,OAAOD,CACX,CACAH,EAAS,MAAQI,EACjB,SAAUC,EAAOC,EAAS,CACtB,MAAMA,CACV,CACAN,EAAS,OAASK,EAClB,SAASE,EAAKC,EAAmB,CAC7B,OAAIP,EAAGO,CAAiB,EACbA,EAGAH,EAAOG,CAAiB,CAEvC,CACAR,EAAS,KAAOO,EAChB,SAASE,EAAKC,EAAU,CACpB,OAAOA,GAAYP,CACvB,CACAH,EAAS,KAAOS,EAChB,SAAUE,EAAQC,EAAO,CACrB,QAASnB,EAAImB,EAAM,OAAS,EAAGnB,GAAK,EAAGA,IACnC,MAAMmB,EAAMnB,CAAC,CAErB,CACAO,EAAS,QAAUW,EACnB,SAASE,EAAQH,EAAU,CACvB,MAAO,CAACA,GAAYA,EAAS,OAAO,QAAQ,IAAI,OAAO,OAAS,EACpE,CACAV,EAAS,QAAUa,EACnB,SAASC,EAAMJ,EAAU,CACrB,OAAOA,EAAS,OAAO,QAAQ,EAAC,EAAG,KAAI,EAAG,KAC9C,CACAV,EAAS,MAAQc,EACjB,SAASC,EAAKL,EAAUlB,EAAW,CAC/B,IAAIC,EAAI,EACR,UAAWa,KAAWI,EAClB,GAAIlB,EAAUc,EAASb,GAAG,EACtB,MAAO,GAGf,MAAO,EACX,CACAO,EAAS,KAAOe,EAChB,SAASC,EAAMN,EAAUlB,EAAW,CAChC,IAAIC,EAAI,EACR,UAAWa,KAAWI,EAClB,GAAI,CAAClB,EAAUc,EAASb,GAAG,EACvB,MAAO,GAGf,MAAO,EACX,CACAO,EAAS,MAAQgB,EACjB,SAASC,EAAKP,EAAUlB,EAAW,CAC/B,UAAWc,KAAWI,EAClB,GAAIlB,EAAUc,CAAO,EACjB,OAAOA,CAInB,CACAN,EAAS,KAAOiB,EAChB,SAAUC,EAAOR,EAAUlB,EAAW,CAClC,UAAWc,KAAWI,EACdlB,EAAUc,CAAO,IACjB,MAAMA,EAGlB,CACAN,EAAS,OAASkB,EAClB,SAAUC,EAAIT,EAAUU,EAAI,CACxB,IAAIC,EAAQ,EACZ,UAAWf,KAAWI,EAClB,MAAMU,EAAGd,EAASe,GAAO,CAEjC,CACArB,EAAS,IAAMmB,EACf,SAAUG,EAAQZ,EAAUU,EAAI,CAC5B,IAAIC,EAAQ,EACZ,UAAWf,KAAWI,EAClB,MAAOU,EAAGd,EAASe,GAAO,CAElC,CACArB,EAAS,QAAUsB,EACnB,SAAUC,KAAUC,EAAW,CAC3B,UAAWC,KAAQD,EACX1B,GAAW2B,CAAI,EACf,MAAOA,EAGP,MAAMA,CAGlB,CACAzB,EAAS,OAASuB,EAClB,SAASG,EAAOhB,EAAUiB,EAASC,EAAc,CAC7C,IAAI3C,EAAQ2C,EACZ,UAAWtB,KAAWI,EAClBzB,EAAQ0C,EAAQ1C,EAAOqB,CAAO,EAElC,OAAOrB,CACX,CACAe,EAAS,OAAS0B,EAClB,SAASG,EAAOnB,EAAU,CACtB,IAAIoB,EAAQ,EACZ,UAAWC,KAAKrB,EACZoB,IAEJ,OAAOA,CACX,CACA9B,EAAS,OAAS6B,EAIlB,SAAUG,EAAMC,EAAKxB,EAAMyB,EAAKD,EAAI,OAAQ,CAaxC,IAZIxB,EAAO,CAACwB,EAAI,SACZxB,EAAO,GAEPA,EAAO,IACPA,GAAQwB,EAAI,QAEZC,EAAK,EACLA,GAAMD,EAAI,OAELC,EAAKD,EAAI,SACdC,EAAKD,EAAI,QAENxB,EAAOyB,EAAIzB,IACd,MAAMwB,EAAIxB,CAAI,CAEtB,CACAT,EAAS,MAAQgC,EAKjB,SAASG,EAAQzB,EAAU0B,EAAS,OAAO,kBAAmB,CAC1D,MAAMC,EAAW,CAAA,EACjB,GAAID,IAAW,EACX,MAAO,CAACC,EAAU3B,CAAQ,EAE9B,MAAM4B,EAAW5B,EAAS,OAAO,QAAQ,EAAC,EAC1C,QAASjB,EAAI,EAAGA,EAAI2C,EAAQ3C,IAAK,CAC7B,MAAM8C,EAAOD,EAAS,KAAI,EAC1B,GAAIC,EAAK,KACL,MAAO,CAACF,EAAUrC,EAAS,OAAO,EAEtCqC,EAAS,KAAKE,EAAK,KAAK,CAC5B,CACA,MAAO,CAACF,EAAU,CAAE,CAAC,OAAO,QAAQ,GAAI,CAAE,OAAOC,CAAU,EAAG,CAClE,CACAtC,EAAS,QAAUmC,EACnB,eAAeK,EAAa9B,EAAU,CAClC,MAAM5B,EAAS,CAAA,EACf,gBAAiB2C,KAAQf,EACrB5B,EAAO,KAAK2C,CAAI,EAEpB,OAAO3C,CACX,CACAkB,EAAS,aAAewC,EACxB,eAAeC,EAAiB/B,EAAU,CACtC,IAAI5B,EAAS,CAAA,EACb,gBAAiB2C,KAAQf,EACrB5B,EAASA,EAAO,OAAO2C,CAAI,EAE/B,OAAO3C,CACX,CACAkB,EAAS,iBAAmByC,CAChC,GAAGzC,KAAaA,GAAW,CAAA,EAAG,ECrL9B,SAAS0C,GAAsBC,EAAOC,EAAQ,CAC9C,CAcA,SAASC,GAAQC,EAAK,CAClB,GAAI9C,GAAS,GAAG8C,CAAG,EAAG,CAClB,MAAMC,EAAS,CAAA,EACf,UAAWC,KAAKF,EACZ,GAAIE,EACA,GAAI,CACAA,EAAE,QAAO,CACb,OACO9E,EAAG,CACN6E,EAAO,KAAK7E,CAAC,CACjB,CAGR,GAAI6E,EAAO,SAAW,EAClB,MAAMA,EAAO,CAAC,EAEb,GAAIA,EAAO,OAAS,EACrB,MAAM,IAAI,eAAeA,EAAQ,6CAA6C,EAElF,OAAO,MAAM,QAAQD,CAAG,EAAI,CAAA,EAAKA,CACrC,SACSA,EACL,OAAAA,EAAI,QAAO,EACJA,CAEf,CAIA,SAASG,MAAsBC,EAAa,CAExC,OADeC,GAAa,IAAMN,GAAQK,CAAW,CAAC,CAE1D,CACA,MAAME,EAAmB,CACrB,YAAYhC,EAAI,CACZ,KAAK,YAAc,GACnB,KAAK,IAAMA,CACf,CACA,SAAU,CACN,GAAI,MAAK,YAGT,IAAI,CAAC,KAAK,IACN,MAAM,IAAI,MAAM,yFAAyF,EAE7G,KAAK,YAAc,GACnB,KAAK,IAAG,EACZ,CACJ,CAMA,SAAS+B,GAAa/B,EAAI,CACtB,OAAO,IAAIgC,GAAmBhC,CAAE,CACpC,CAQA,MAAMiC,GAAN,MAAMA,EAAgB,CAElB,aAAc,CACV,KAAK,WAAa,IAAI,IACtB,KAAK,YAAc,EACvB,CAMA,SAAU,CACF,KAAK,cAGT,KAAK,YAAc,GACnB,KAAK,MAAK,EACd,CAIA,IAAI,YAAa,CACb,OAAO,KAAK,WAChB,CAIA,OAAQ,CACJ,GAAI,KAAK,WAAW,OAAS,EAG7B,GAAI,CACAR,GAAQ,KAAK,UAAU,CAC3B,QACR,CACY,KAAK,WAAW,MAAK,CACzB,CACJ,CAIA,IAAIS,EAAG,CACH,GAAI,CAACA,GAAKA,IAAMC,GAAW,KACvB,OAAOD,EAEX,GAAIA,IAAM,KACN,MAAM,IAAI,MAAM,yCAAyC,EAE7D,OAAI,KAAK,YACAD,GAAgB,0BACjB,QAAQ,KAAK,IAAI,MAAM,qHAAqH,EAAE,KAAK,EAIvJ,KAAK,WAAW,IAAIC,CAAC,EAElBA,CACX,CAKA,OAAOA,EAAG,CACN,GAAKA,EAGL,IAAIA,IAAM,KACN,MAAM,IAAI,MAAM,wCAAwC,EAE5D,KAAK,WAAW,OAAOA,CAAC,EACxBA,EAAE,QAAO,EACb,CACJ,EAvEaD,GAAK,yBAA2B,GAD7C,IAAMG,GAANH,GA8EA,MAAMI,GAAN,MAAMA,EAAW,CAOb,aAAc,CACV,KAAK,OAAS,IAAID,GACI,KAAK,MAC/B,CACA,SAAU,CACN,KAAK,OAAO,QAAO,CACvB,CAIA,UAAUF,EAAG,CACT,GAAIA,IAAM,KACN,MAAM,IAAI,MAAM,yCAAyC,EAE7D,OAAO,KAAK,OAAO,IAAIA,CAAC,CAC5B,CACJ,EAjBaG,GAAK,KAAO,OAAO,OAAO,CAAE,SAAU,CAAE,CAAC,CAAE,EANxD,IAAMF,GAANE,GC3JA,MAAMC,GAAN,MAAMA,EAAK,CAEP,YAAYpD,EAAS,CACjB,KAAK,QAAUA,EACf,KAAK,KAAOoD,GAAK,UACjB,KAAK,KAAOA,GAAK,SACrB,CACJ,EANaA,GAAK,UAAY,IAAIA,GAAK,MAAS,EADhD,IAAMC,EAAND,GAQA,MAAME,EAAW,CACb,aAAc,CACV,KAAK,OAASD,EAAK,UACnB,KAAK,MAAQA,EAAK,UAClB,KAAK,MAAQ,CACjB,CACA,IAAI,MAAO,CACP,OAAO,KAAK,KAChB,CACA,SAAU,CACN,OAAO,KAAK,SAAWA,EAAK,SAChC,CACA,OAAQ,CACJ,IAAIE,EAAO,KAAK,OAChB,KAAOA,IAASF,EAAK,WAAW,CAC5B,MAAMpB,EAAOsB,EAAK,KAClBA,EAAK,KAAOF,EAAK,UACjBE,EAAK,KAAOF,EAAK,UACjBE,EAAOtB,CACX,CACA,KAAK,OAASoB,EAAK,UACnB,KAAK,MAAQA,EAAK,UAClB,KAAK,MAAQ,CACjB,CACA,QAAQrD,EAAS,CACb,OAAO,KAAK,QAAQA,EAAS,EAAK,CACtC,CACA,KAAKA,EAAS,CACV,OAAO,KAAK,QAAQA,EAAS,EAAI,CACrC,CACA,QAAQA,EAASwD,EAAU,CACvB,MAAMC,EAAU,IAAIJ,EAAKrD,CAAO,EAChC,GAAI,KAAK,SAAWqD,EAAK,UACrB,KAAK,OAASI,EACd,KAAK,MAAQA,UAERD,EAAU,CAEf,MAAME,EAAU,KAAK,MACrB,KAAK,MAAQD,EACbA,EAAQ,KAAOC,EACfA,EAAQ,KAAOD,CACnB,KACK,CAED,MAAME,EAAW,KAAK,OACtB,KAAK,OAASF,EACdA,EAAQ,KAAOE,EACfA,EAAS,KAAOF,CACpB,CACA,KAAK,OAAS,EACd,IAAIG,EAAY,GAChB,MAAO,IAAM,CACJA,IACDA,EAAY,GACZ,KAAK,QAAQH,CAAO,EAE5B,CACJ,CACA,OAAQ,CACJ,GAAI,KAAK,SAAWJ,EAAK,UAGpB,CACD,MAAMQ,EAAM,KAAK,OAAO,QACxB,YAAK,QAAQ,KAAK,MAAM,EACjBA,CACX,CACJ,CACA,KAAM,CACF,GAAI,KAAK,QAAUR,EAAK,UAGnB,CACD,MAAMQ,EAAM,KAAK,MAAM,QACvB,YAAK,QAAQ,KAAK,KAAK,EAChBA,CACX,CACJ,CACA,QAAQN,EAAM,CACV,GAAIA,EAAK,OAASF,EAAK,WAAaE,EAAK,OAASF,EAAK,UAAW,CAE9D,MAAMS,EAASP,EAAK,KACpBO,EAAO,KAAOP,EAAK,KACnBA,EAAK,KAAK,KAAOO,CACrB,MACSP,EAAK,OAASF,EAAK,WAAaE,EAAK,OAASF,EAAK,WAExD,KAAK,OAASA,EAAK,UACnB,KAAK,MAAQA,EAAK,WAEbE,EAAK,OAASF,EAAK,WAExB,KAAK,MAAQ,KAAK,MAAM,KACxB,KAAK,MAAM,KAAOA,EAAK,WAElBE,EAAK,OAASF,EAAK,YAExB,KAAK,OAAS,KAAK,OAAO,KAC1B,KAAK,OAAO,KAAOA,EAAK,WAG5B,KAAK,OAAS,CAClB,CACA,EAAE,OAAO,QAAQ,GAAI,CACjB,IAAIE,EAAO,KAAK,OAChB,KAAOA,IAASF,EAAK,WACjB,MAAME,EAAK,QACXA,EAAOA,EAAK,IAEpB,CACJ,CCvHA,MAAMQ,GAAiB,WAAW,YAAY,IAAI,KAAK,WAAW,WAAW,EAC7E,MAAMC,EAAU,CACZ,OAAO,OAAOC,EAAgB,CAC1B,OAAO,IAAID,GAAUC,CAAc,CACvC,CACA,YAAYA,EAAgB,CACxB,KAAK,KAAOA,IAAmB,GAAQ,KAAK,IAAMF,GAClD,KAAK,WAAa,KAAK,KAAI,EAC3B,KAAK,UAAY,EACrB,CACA,MAAO,CACH,KAAK,UAAY,KAAK,KAAI,CAC9B,CACA,OAAQ,CACJ,KAAK,WAAa,KAAK,KAAI,EAC3B,KAAK,UAAY,EACrB,CACA,SAAU,CACN,OAAI,KAAK,YAAc,GACZ,KAAK,UAAY,KAAK,WAE1B,KAAK,OAAS,KAAK,UAC9B,CACJ,CCjBA,IAAIG,IACH,SAAUA,EAAO,CACdA,EAAM,KAAO,IAAMjB,GAAW,KAiB9B,SAASkB,EAAMC,EAAOC,EAAY,CAC9B,OAAOC,EAASF,EAAO,OAAc,EAAG,OAAW,GAAM,OAAWC,CAAU,CAClF,CACAH,EAAM,MAAQC,EAMd,SAASI,EAAKH,EAAO,CACjB,MAAO,CAAC3G,EAAU+G,EAAW,KAAM5B,IAAgB,CAE/C,IAAI6B,EAAU,GACVjG,EACJ,OAAAA,EAAS4F,EAAMxG,GAAK,CAChB,GAAI,CAAA6G,EAGC,OAAIjG,EACLA,EAAO,QAAO,EAGdiG,EAAU,GAEPhH,EAAS,KAAK+G,EAAU5G,CAAC,CACpC,EAAG,KAAMgF,CAAW,EAChB6B,GACAjG,EAAO,QAAO,EAEXA,CACX,CACJ,CACA0F,EAAM,KAAOK,EAMb,SAASG,EAAON,EAAOvF,EAAW,CAC9B,OAAOqF,EAAM,KAAKA,EAAM,OAAOE,EAAOvF,CAAS,CAAC,CACpD,CACAqF,EAAM,OAASQ,EAaf,SAAS7D,EAAIuD,EAAOvD,EAAKwD,EAAY,CACjC,OAAOM,EAAS,CAAClH,EAAU+G,EAAW,KAAM5B,IAAgBwB,EAAMjF,GAAK1B,EAAS,KAAK+G,EAAU3D,EAAI1B,CAAC,CAAC,EAAG,KAAMyD,CAAW,EAAGyB,CAAU,CAC1I,CACAH,EAAM,IAAMrD,EAYZ,SAAS+D,EAAQR,EAAOS,EAAMR,EAAY,CACtC,OAAOM,EAAS,CAAClH,EAAU+G,EAAW,KAAM5B,IAAgBwB,EAAMjF,GAAK,CAAE0F,EAAK1F,CAAC,EAAG1B,EAAS,KAAK+G,EAAUrF,CAAC,CAAG,EAAG,KAAMyD,CAAW,EAAGyB,CAAU,CACnJ,CACAH,EAAM,QAAUU,EAChB,SAAShE,EAAOwD,EAAOxD,EAAQyD,EAAY,CACvC,OAAOM,EAAS,CAAClH,EAAU+G,EAAW,KAAM5B,IAAgBwB,EAAMxG,GAAKgD,EAAOhD,CAAC,GAAKH,EAAS,KAAK+G,EAAU5G,CAAC,EAAG,KAAMgF,CAAW,EAAGyB,CAAU,CAClJ,CACAH,EAAM,OAAStD,EAIf,SAASkE,EAAOV,EAAO,CACnB,OAAOA,CACX,CACAF,EAAM,OAASY,EACf,SAASC,KAAOC,EAAQ,CACpB,MAAO,CAACvH,EAAU+G,EAAW,KAAM5B,IAAgB,CAC/C,MAAMyB,EAAa1B,GAAmB,GAAGqC,EAAO,IAAIZ,GAASA,EAAMxG,GAAKH,EAAS,KAAK+G,EAAU5G,CAAC,CAAC,CAAC,CAAC,EACpG,OAAOqH,EAAuBZ,EAAYzB,CAAW,CACzD,CACJ,CACAsB,EAAM,IAAMa,EAMZ,SAAS3D,EAAOgD,EAAOc,EAAOC,EAASd,EAAY,CAC/C,IAAIe,EAASD,EACb,OAAOtE,EAAIuD,EAAOxG,IACdwH,EAASF,EAAME,EAAQxH,CAAC,EACjBwH,GACRf,CAAU,CACjB,CACAH,EAAM,OAAS9C,EACf,SAASuD,EAASP,EAAOC,EAAY,CACjC,IAAI5G,EACJ,MAAM4H,EAAU,CACZ,wBAAyB,CACrB5H,EAAW2G,EAAMkB,EAAQ,KAAMA,CAAO,CAC1C,EACA,yBAA0B,CACtB7H,GAAU,QAAO,CACrB,CACZ,EACc6H,EAAU,IAAIC,GAAQF,CAAO,EACnC,OAAAhB,GAAY,IAAIiB,CAAO,EAChBA,EAAQ,KACnB,CAKA,SAASL,EAAuBvC,EAAG8C,EAAO,CACtC,OAAIA,aAAiB,MACjBA,EAAM,KAAK9C,CAAC,EAEP8C,GACLA,EAAM,IAAI9C,CAAC,EAERA,CACX,CACA,SAAS4B,EAASF,EAAOc,EAAOO,EAAQ,IAAKC,EAAU,GAAOC,EAAwB,GAAOC,EAAsBvB,EAAY,CAC3H,IAAIwB,EACAT,EACAU,GACAC,GAAoB,EACpBC,GACJ,MAAMX,GAAU,CACZ,qBAAAO,EACA,wBAAyB,CACrBC,EAAezB,EAAM6B,IAAO,CACxBF,KACAX,EAASF,EAAME,EAAQa,EAAG,EACtBP,GAAW,CAACI,KACZR,GAAQ,KAAKF,CAAM,EACnBA,EAAS,QAEbY,GAAS,IAAM,CACX,MAAME,GAAUd,EAChBA,EAAS,OACTU,GAAS,QACL,CAACJ,GAAWK,GAAoB,IAChCT,GAAQ,KAAKY,EAAO,EAExBH,GAAoB,CACxB,EACI,OAAON,GAAU,UACbK,IACA,aAAaA,EAAM,EAEvBA,GAAS,WAAWE,GAAQP,CAAK,GAG7BK,KAAW,SACXA,GAAS,KACT,eAAeE,EAAM,EAGjC,CAAC,CACL,EACA,sBAAuB,CACfL,GAAyBI,GAAoB,GAC7CC,KAAM,CAEd,EACA,yBAA0B,CACtBA,GAAS,OACTH,EAAa,QAAO,CACxB,CACZ,EACcP,GAAU,IAAIC,GAAQF,EAAO,EACnC,OAAAhB,GAAY,IAAIiB,EAAO,EAChBA,GAAQ,KACnB,CACApB,EAAM,SAAWI,EAQjB,SAAS6B,EAAW/B,EAAOqB,EAAQ,EAAGpB,EAAY,CAC9C,OAAOH,EAAM,SAASE,EAAO,CAACgC,EAAMxI,IAC3BwI,GAGLA,EAAK,KAAKxI,CAAC,EACJwI,GAHI,CAACxI,CAAC,EAId6H,EAAO,OAAW,GAAM,OAAWpB,CAAU,CACpD,CACAH,EAAM,WAAaiC,EAmBnB,SAASE,EAAMjC,EAAOkC,EAAS,CAAClH,EAAGC,IAAMD,IAAMC,EAAGgF,EAAY,CAC1D,IAAIkC,EAAY,GACZC,EACJ,OAAO5F,EAAOwD,EAAOzF,GAAS,CAC1B,MAAM8H,EAAaF,GAAa,CAACD,EAAO3H,EAAO6H,CAAK,EACpD,OAAAD,EAAY,GACZC,EAAQ7H,EACD8H,CACX,EAAGpC,CAAU,CACjB,CACAH,EAAM,MAAQmC,EAkBd,SAASK,EAAMtC,EAAOuC,EAAKtC,EAAY,CACnC,MAAO,CACHH,EAAM,OAAOE,EAAOuC,EAAKtC,CAAU,EACnCH,EAAM,OAAOE,EAAOxG,GAAK,CAAC+I,EAAI/I,CAAC,EAAGyG,CAAU,CACxD,CACI,CACAH,EAAM,MAAQwC,EAqBd,SAASE,EAAOxC,EAAOyC,EAAoB,GAAOC,EAAU,CAAA,EAAIzC,EAAY,CACxE,IAAIuC,EAASE,EAAQ,MAAK,EACtBrJ,EAAW2G,EAAMxG,GAAK,CAClBgJ,EACAA,EAAO,KAAKhJ,CAAC,EAGb0H,EAAQ,KAAK1H,CAAC,CAEtB,CAAC,EACGyG,GACAA,EAAW,IAAI5G,CAAQ,EAE3B,MAAMsJ,EAAQ,IAAM,CAChBH,GAAQ,QAAQhJ,GAAK0H,EAAQ,KAAK1H,CAAC,CAAC,EACpCgJ,EAAS,IACb,EACMtB,EAAU,IAAIC,GAAQ,CACxB,wBAAyB,CAChB9H,IACDA,EAAW2G,EAAMxG,GAAK0H,EAAQ,KAAK1H,CAAC,CAAC,EACjCyG,GACAA,EAAW,IAAI5G,CAAQ,EAGnC,EACA,uBAAwB,CAChBmJ,IACIC,EACA,WAAWE,CAAK,EAGhBA,EAAK,EAGjB,EACA,yBAA0B,CAClBtJ,GACAA,EAAS,QAAO,EAEpBA,EAAW,IACf,CACZ,CAAS,EACD,OAAI4G,GACAA,EAAW,IAAIiB,CAAO,EAEnBA,EAAQ,KACnB,CACApB,EAAM,OAAS0C,EAmBf,SAASI,EAAM5C,EAAO6C,EAAY,CAU9B,MATW,CAACxJ,EAAU+G,EAAU5B,IAAgB,CAC5C,MAAMsE,EAAKD,EAAW,IAAIE,CAAoB,EAC9C,OAAO/C,EAAM,SAAUzF,EAAO,CAC1B,MAAMH,EAAS0I,EAAG,SAASvI,CAAK,EAC5BH,IAAW4I,GACX3J,EAAS,KAAK+G,EAAUhG,CAAM,CAEtC,EAAG,OAAWoE,CAAW,CAC7B,CAEJ,CACAsB,EAAM,MAAQ8C,EACd,MAAMI,EAAgB,OAAO,eAAe,EAC5C,MAAMD,CAAmB,CACrB,aAAc,CACV,KAAK,MAAQ,CAAA,CACjB,CACA,IAAIrG,EAAI,CACJ,YAAK,MAAM,KAAKA,CAAE,EACX,IACX,CACA,QAAQA,EAAI,CACR,YAAK,MAAM,KAAKuG,IACZvG,EAAGuG,CAAC,EACGA,EACV,EACM,IACX,CACA,OAAOvG,EAAI,CACP,YAAK,MAAM,KAAKuG,GAAKvG,EAAGuG,CAAC,EAAIA,EAAID,CAAa,EACvC,IACX,CACA,OAAOlC,EAAOC,EAAS,CACnB,IAAIiB,EAAOjB,EACX,YAAK,MAAM,KAAKkC,IACZjB,EAAOlB,EAAMkB,EAAMiB,CAAC,EACbjB,EACV,EACM,IACX,CACA,MAAME,EAAS,CAAClH,EAAGC,IAAMD,IAAMC,EAAG,CAC9B,IAAIkH,EAAY,GACZC,EACJ,YAAK,MAAM,KAAK7H,GAAS,CACrB,MAAM8H,EAAaF,GAAa,CAACD,EAAO3H,EAAO6H,CAAK,EACpD,OAAAD,EAAY,GACZC,EAAQ7H,EACD8H,EAAa9H,EAAQyI,CAChC,CAAC,EACM,IACX,CACA,SAASzI,EAAO,CACZ,UAAW2I,KAAQ,KAAK,MAEpB,GADA3I,EAAQ2I,EAAK3I,CAAK,EACdA,IAAUyI,EACV,MAGR,OAAOzI,CACX,CACR,CAII,SAAS4I,EAAqBjC,EAASkC,EAAW3G,EAAM4G,GAAMA,EAAI,CAC9D,MAAM3G,EAAK,IAAI4G,IAASlJ,EAAO,KAAKqC,EAAI,GAAG6G,CAAI,CAAC,EAC1CC,EAAqB,IAAMrC,EAAQ,GAAGkC,EAAW1G,CAAE,EACnD8G,EAAuB,IAAMtC,EAAQ,eAAekC,EAAW1G,CAAE,EACjEtC,EAAS,IAAI+G,GAAQ,CAAE,uBAAwBoC,EAAoB,wBAAyBC,EAAsB,EACxH,OAAOpJ,EAAO,KAClB,CACA0F,EAAM,qBAAuBqD,EAI7B,SAASM,EAAoBvC,EAASkC,EAAW3G,EAAM4G,GAAMA,EAAI,CAC7D,MAAM3G,EAAK,IAAI4G,IAASlJ,EAAO,KAAKqC,EAAI,GAAG6G,CAAI,CAAC,EAC1CC,EAAqB,IAAMrC,EAAQ,iBAAiBkC,EAAW1G,CAAE,EACjE8G,EAAuB,IAAMtC,EAAQ,oBAAoBkC,EAAW1G,CAAE,EACtEtC,EAAS,IAAI+G,GAAQ,CAAE,uBAAwBoC,EAAoB,wBAAyBC,EAAsB,EACxH,OAAOpJ,EAAO,KAClB,CACA0F,EAAM,oBAAsB2D,EAI5B,SAASC,EAAU1D,EAAOxB,EAAa,CACnC,IAAImF,EACJ,MAAMC,EAAU,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC7C,MAAMzK,EAAW8G,EAAKH,CAAK,EAAE6D,EAAS,KAAMrF,CAAW,EAEvDmF,EAAY,IAAMtK,EAAS,QAAO,CACtC,CAAC,EACD,OAAAuK,EAAQ,OAASD,EACVC,CACX,CACA9D,EAAM,UAAY4D,EAgBlB,SAASK,EAAQhI,EAAMyB,EAAI,CACvB,OAAOzB,EAAKvC,GAAKgE,EAAG,KAAKhE,CAAC,CAAC,CAC/B,CACAsG,EAAM,QAAUiE,EAChB,SAASC,EAAgBhE,EAAOiE,EAASlD,EAAS,CAC9C,OAAAkD,EAAQlD,CAAO,EACRf,EAAMxG,GAAKyK,EAAQzK,CAAC,CAAC,CAChC,CACAsG,EAAM,gBAAkBkE,EACxB,MAAME,CAAgB,CAClB,YAAYC,EAAa/C,EAAO,CAC5B,KAAK,YAAc+C,EACnB,KAAK,SAAW,EAChB,KAAK,YAAc,GACnB,MAAMlD,EAAU,CACZ,uBAAwB,IAAM,CAC1BkD,EAAY,YAAY,IAAI,EAE5B,KAAK,YAAY,cAAa,CAClC,EACA,wBAAyB,IAAM,CAC3BA,EAAY,eAAe,IAAI,CACnC,CAChB,EACY,KAAK,QAAU,IAAIhD,GAAQF,CAAO,EAC9BG,GACAA,EAAM,IAAI,KAAK,OAAO,CAE9B,CACA,YAAY+C,EAAa,CAErB,KAAK,UACT,CACA,qBAAqBA,EAAa,CAElC,CACA,aAAaA,EAAaC,EAAS,CAE/B,KAAK,YAAc,EACvB,CACA,UAAUD,EAAa,CAEnB,KAAK,WACD,KAAK,WAAa,IAClB,KAAK,YAAY,cAAa,EAC1B,KAAK,cACL,KAAK,YAAc,GACnB,KAAK,QAAQ,KAAK,KAAK,YAAY,IAAG,CAAE,GAGpD,CACR,CAKI,SAASE,EAAeC,EAAKlD,EAAO,CAEhC,OADiB,IAAI8C,EAAgBI,EAAKlD,CAAK,EAC/B,QAAQ,KAC5B,CACAtB,EAAM,eAAiBuE,EAIvB,SAASE,EAAoBC,EAAY,CACrC,MAAO,CAACnL,EAAU+G,EAAU5B,IAAgB,CACxC,IAAIpB,EAAQ,EACRqH,EAAY,GAChB,MAAMC,EAAW,CACb,aAAc,CACVtH,GACJ,EACA,WAAY,CACRA,IACIA,IAAU,IACVoH,EAAW,cAAa,EACpBC,IACAA,EAAY,GACZpL,EAAS,KAAK+G,CAAQ,GAGlC,EACA,sBAAuB,CAEvB,EACA,cAAe,CACXqE,EAAY,EAChB,CAChB,EACYD,EAAW,YAAYE,CAAQ,EAC/BF,EAAW,cAAa,EACxB,MAAMvE,EAAa,CACf,SAAU,CACNuE,EAAW,eAAeE,CAAQ,CACtC,CAChB,EACY,OAAIlG,aAAuBM,GACvBN,EAAY,IAAIyB,CAAU,EAErB,MAAM,QAAQzB,CAAW,GAC9BA,EAAY,KAAKyB,CAAU,EAExBA,CACX,CACJ,CACAH,EAAM,oBAAsByE,CAChC,GAAGzE,KAAUA,GAAQ,CAAA,EAAG,EACxB,MAAM6E,GAAN,MAAMA,EAAe,CAGjB,YAAY/K,EAAM,CACd,KAAK,cAAgB,EACrB,KAAK,gBAAkB,EACvB,KAAK,eAAiB,EACtB,KAAK,UAAY,CAAA,EACjB,KAAK,KAAO,GAAGA,CAAI,IAAI+K,GAAe,SAAS,GAC/CA,GAAe,IAAI,IAAI,IAAI,CAC/B,CACA,MAAMC,EAAe,CACjB,KAAK,WAAa,IAAIhF,GACtB,KAAK,cAAgBgF,CACzB,CACA,MAAO,CACH,GAAI,KAAK,WAAY,CACjB,MAAMC,EAAU,KAAK,WAAW,QAAO,EACvC,KAAK,UAAU,KAAKA,CAAO,EAC3B,KAAK,gBAAkBA,EACvB,KAAK,iBAAmB,EACxB,KAAK,WAAa,MACtB,CACJ,CACJ,EAvBaF,GAAK,IAAM,IAAI,IACfA,GAAK,QAAU,EAF5B,IAAMG,GAANH,GAyBII,GAA8B,GAClC,MAAMC,GAAN,MAAMA,EAAe,CAEjB,YAAYC,EAAeC,EAAWtL,GAAQoL,GAAe,WAAW,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,EAAG,CACnG,KAAK,cAAgBC,EACrB,KAAK,UAAYC,EACjB,KAAK,KAAOtL,EACZ,KAAK,eAAiB,CAC1B,CACA,SAAU,CACN,KAAK,SAAS,MAAK,CACvB,CACA,MAAMG,EAAO6K,EAAe,CACxB,MAAMM,EAAY,KAAK,UACvB,GAAIA,GAAa,GAAKN,EAAgBM,EAClC,OAEC,KAAK,UACN,KAAK,QAAU,IAAI,KAEvB,MAAM9H,EAAS,KAAK,QAAQ,IAAIrD,EAAM,KAAK,GAAK,EAGhD,GAFA,KAAK,QAAQ,IAAIA,EAAM,MAAOqD,EAAQ,CAAC,EACvC,KAAK,gBAAkB,EACnB,KAAK,gBAAkB,EAAG,CAG1B,KAAK,eAAiB8H,EAAY,GAClC,KAAM,CAACC,EAAUC,CAAQ,EAAI,KAAK,qBAAoB,EAChDvL,EAAU,IAAI,KAAK,IAAI,8CAA8C+K,CAAa,+CAA+CQ,CAAQ,KAC/I,QAAQ,KAAKvL,CAAO,EACpB,QAAQ,KAAKsL,CAAQ,EACrB,MAAMxL,EAAQ,IAAI0L,GAAkBxL,EAASsL,CAAQ,EACrD,KAAK,cAAcxL,CAAK,CAC5B,CACA,MAAO,IAAM,CACT,MAAMyD,EAAS,KAAK,QAAQ,IAAIrD,EAAM,KAAK,GAAK,EAChD,KAAK,QAAQ,IAAIA,EAAM,MAAOqD,EAAQ,CAAC,CAC3C,CACJ,CACA,sBAAuB,CACnB,GAAI,CAAC,KAAK,QACN,OAEJ,IAAI+H,EACAC,EAAW,EACf,SAAW,CAACrL,EAAOqD,CAAK,IAAK,KAAK,SAC1B,CAAC+H,GAAYC,EAAWhI,KACxB+H,EAAW,CAACpL,EAAOqD,CAAK,EACxBgI,EAAWhI,GAGnB,OAAO+H,CACX,CACJ,EAnDaH,GAAK,QAAU,EAD5B,IAAMM,GAANN,GAqDA,MAAMO,EAAW,CACb,OAAO,QAAS,CACZ,MAAMpL,EAAM,IAAI,MAChB,OAAO,IAAIoL,GAAWpL,EAAI,OAAS,EAAE,CACzC,CACA,YAAYI,EAAO,CACf,KAAK,MAAQA,CACjB,CACA,OAAQ,CACJ,QAAQ,KAAK,KAAK,MAAM,MAAM;AAAA,CAAI,EAAE,MAAM,CAAC,EAAE,KAAK;AAAA,CAAI,CAAC,CAC3D,CACJ,CAEA,MAAM8K,WAA0B,KAAM,CAClC,YAAYxL,EAASE,EAAO,CACxB,MAAMF,CAAO,EACb,KAAK,KAAO,oBACZ,KAAK,MAAQE,CACjB,CACJ,CAGA,MAAMyL,WAA6B,KAAM,CACrC,YAAY3L,EAASE,EAAO,CACxB,MAAMF,CAAO,EACb,KAAK,KAAO,uBACZ,KAAK,MAAQE,CACjB,CACJ,CACA,MAAM0L,EAAgB,CAClB,YAAYlL,EAAO,CACf,KAAK,MAAQA,CACjB,CACJ,CACA,MAAMmL,GAAsB,EAsB5B,MAAMvE,EAAQ,CACV,YAAYF,EAAS,CACjB,KAAK,MAAQ,EACb,KAAK,SAAWA,EAChB,KAAK,YAAe,KAAK,UAAU,qBAC7B,IAAIqE,GAAerE,GAAS,iBAAmB1H,GAAmB,KAAK,UAAU,sBAAwBwL,EAA2B,EACtI,OACJ,KAAK,SAAW,KAAK,UAAU,UAAY,IAAID,GAAe,KAAK,SAAS,SAAS,EAAI,OACzF,KAAK,eAAiB,KAAK,UAAU,aACzC,CACA,SAAU,CACD,KAAK,YACN,KAAK,UAAY,GAUb,KAAK,gBAAgB,UAAY,MACjC,KAAK,eAAe,MAAK,EAEzB,KAAK,aACL,KAAK,WAAa,OAClB,KAAK,MAAQ,GAEjB,KAAK,UAAU,0BAAuB,EACtC,KAAK,aAAa,QAAO,EAEjC,CAKA,IAAI,OAAQ,CACR,YAAK,SAAW,CAACa,EAAUvF,EAAU5B,IAAgB,CACjD,GAAI,KAAK,aAAe,KAAK,MAAQ,KAAK,YAAY,WAAa,EAAG,CAClE,MAAM3E,EAAU,IAAI,KAAK,YAAY,IAAI,+EAA+E,KAAK,KAAK,OAAO,KAAK,YAAY,SAAS,IACnK,QAAQ,KAAKA,CAAO,EACpB,MAAM+L,EAAQ,KAAK,YAAY,qBAAoB,GAAM,CAAC,gBAAiB,EAAE,EACvEjM,EAAQ,IAAI6L,GAAqB,GAAG3L,CAAO,+CAA+C+L,EAAM,CAAC,CAAC,UAAWA,EAAM,CAAC,CAAC,EAE3H,OADqB,KAAK,UAAU,iBAAmBrM,IAC1CI,CAAK,EACXkF,GAAW,IACtB,CACA,GAAI,KAAK,UAEL,OAAOA,GAAW,KAElBuB,IACAuF,EAAWA,EAAS,KAAKvF,CAAQ,GAErC,MAAMyF,EAAY,IAAIJ,GAAgBE,CAAQ,EAC9C,IAAIG,EACA,KAAK,aAAe,KAAK,OAAS,KAAK,KAAK,KAAK,YAAY,UAAY,EAAG,IAE5ED,EAAU,MAAQN,GAAW,OAAM,EACnCO,EAAgB,KAAK,YAAY,MAAMD,EAAU,MAAO,KAAK,MAAQ,CAAC,GAErE,KAAK,WAKD,KAAK,sBAAsBJ,IAChC,KAAK,iBAAmB,IAAIM,GAC5B,KAAK,WAAa,CAAC,KAAK,WAAYF,CAAS,GAG7C,KAAK,WAAW,KAAKA,CAAS,GAT9B,KAAK,UAAU,yBAAyB,IAAI,EAC5C,KAAK,WAAaA,EAClB,KAAK,UAAU,wBAAwB,IAAI,GAS/C,KAAK,UAAU,mBAAmB,IAAI,EACtC,KAAK,QACL,MAAMzL,EAASqE,GAAa,IAAM,CAC9BqH,IAAa,EACb,KAAK,gBAAgBD,CAAS,CAClC,CAAC,EACD,OAAIrH,aAAuBM,GACvBN,EAAY,IAAIpE,CAAM,EAEjB,MAAM,QAAQoE,CAAW,GAC9BA,EAAY,KAAKpE,CAAM,EAEpBA,CACX,EACO,KAAK,MAChB,CACA,gBAAgBf,EAAU,CAEtB,GADA,KAAK,UAAU,uBAAuB,IAAI,EACtC,CAAC,KAAK,WACN,OAEJ,GAAI,KAAK,QAAU,EAAG,CAClB,KAAK,WAAa,OAClB,KAAK,UAAU,0BAA0B,IAAI,EAC7C,KAAK,MAAQ,EACb,MACJ,CAEA,MAAM2M,EAAY,KAAK,WACjBrJ,EAAQqJ,EAAU,QAAQ3M,CAAQ,EACxC,GAAIsD,IAAU,GACV,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,EAE3D,KAAK,QACLqJ,EAAUrJ,CAAK,EAAI,OACnB,MAAMsJ,EAAsB,KAAK,eAAe,UAAY,KAC5D,GAAI,KAAK,MAAQP,IAAuBM,EAAU,OAAQ,CACtD,IAAIE,EAAI,EACR,QAASnL,EAAI,EAAGA,EAAIiL,EAAU,OAAQjL,IAC9BiL,EAAUjL,CAAC,EACXiL,EAAUE,GAAG,EAAIF,EAAUjL,CAAC,EAEvBkL,GAAuBC,EAAI,KAAK,eAAe,MACpD,KAAK,eAAe,MAChBA,EAAI,KAAK,eAAe,GACxB,KAAK,eAAe,KAIhCF,EAAU,OAASE,CACvB,CACJ,CACA,SAAS7M,EAAUkB,EAAO,CACtB,GAAI,CAAClB,EACD,OAEJ,MAAMC,EAAe,KAAK,UAAU,iBAAmBC,GACvD,GAAI,CAACD,EAAc,CACfD,EAAS,MAAMkB,CAAK,EACpB,MACJ,CACA,GAAI,CACAlB,EAAS,MAAMkB,CAAK,CACxB,OACOf,EAAG,CACNF,EAAaE,CAAC,CAClB,CACJ,CAEA,cAAc2M,EAAI,CACd,MAAMH,EAAYG,EAAG,QAAQ,WAC7B,KAAOA,EAAG,EAAIA,EAAG,KAEb,KAAK,SAASH,EAAUG,EAAG,GAAG,EAAGA,EAAG,KAAK,EAE7CA,EAAG,MAAK,CACZ,CAKA,KAAKnG,EAAO,CAMR,GALI,KAAK,gBAAgB,UACrB,KAAK,cAAc,KAAK,cAAc,EACtC,KAAK,UAAU,QAEnB,KAAK,UAAU,MAAM,KAAK,KAAK,EAC1B,KAAK,WACL,GAAI,KAAK,sBAAsByF,GAChC,KAAK,SAAS,KAAK,WAAYzF,CAAK,MAEnC,CACD,MAAMmG,EAAK,KAAK,eAChBA,EAAG,QAAQ,KAAMnG,EAAO,KAAK,WAAW,MAAM,EAC9C,KAAK,cAAcmG,CAAE,CACzB,CACA,KAAK,UAAU,KAAI,CACvB,CACA,cAAe,CACX,OAAO,KAAK,MAAQ,CACxB,CACJ,CAEA,MAAMJ,EAA0B,CAC5B,aAAc,CAIV,KAAK,EAAI,GAIT,KAAK,IAAM,CACf,CACA,QAAQ7E,EAAS3G,EAAO6L,EAAK,CACzB,KAAK,EAAI,EACT,KAAK,IAAMA,EACX,KAAK,QAAUlF,EACf,KAAK,MAAQ3G,CACjB,CACA,OAAQ,CACJ,KAAK,EAAI,KAAK,IACd,KAAK,QAAU,OACf,KAAK,MAAQ,MACjB,CACJ,CCt5BA,SAAS8L,IAAiB,CACtB,OAAO,WAAW,oBACtB,CACA,SAASC,IAAiB,CACtB,OAAO,WAAW,oBACtB,CCRA,MAAMC,GAAWD,GAAc,IAAO,UAAa,OAAO,SAAa,KAAe,SAAS,UAAY,OAAO,SAAS,SAAS,MAAS,UAAY,SAAS,SAAS,KAAK,QAAQ,aAAa,GAAK,EAC1M,SAASE,GAAQ3M,EAASyJ,EAAM,CAC5B,IAAIlJ,EACJ,OAAIkJ,EAAK,SAAW,EAChBlJ,EAASP,EAGTO,EAASP,EAAQ,QAAQ,aAAc,CAAC4M,EAAOC,IAAS,CACpD,MAAM/J,EAAQ+J,EAAK,CAAC,EACdtI,EAAMkF,EAAK3G,CAAK,EACtB,IAAIvC,EAASqM,EACb,OAAI,OAAOrI,GAAQ,SACfhE,EAASgE,GAEJ,OAAOA,GAAQ,UAAY,OAAOA,GAAQ,WAAaA,IAAQ,QAAUA,IAAQ,QACtFhE,EAAS,OAAOgE,CAAG,GAEhBhE,CACX,CAAC,EAEDmM,KAEAnM,EAAS,IAAWA,EAAO,QAAQ,WAAY,MAAM,EAAI,KAEtDA,CACX,CAIA,SAASuM,EAASC,EAAgC/M,KAAoCyJ,EAAM,CACxF,OACWkD,GADP,OAAOI,GAAS,SACDC,GAAcD,EAAM/M,CAAO,EAE/BA,EAFkCyJ,CAAI,CAGzD,CAMA,SAASuD,GAAclK,EAAOmK,EAAU,CACpC,MAAMjN,EAAUwM,GAAc,IAAK1J,CAAK,EACxC,GAAI,OAAO9C,GAAY,SAAU,CAC7B,GAAI,OAAOiN,GAAa,SACpB,OAAOA,EAEX,MAAM,IAAI,MAAM,oBAAoBnK,CAAK,MAAM,CACnD,CACA,OAAO9C,CACX,CCjDA,MAAMkN,GAAmB,KACzB,IAAIC,GAAa,GACbC,GAAe,GACfC,GAAW,GAKXC,GACAC,GAAYL,GACZM,GAAkBN,GAClBO,GACAC,GACJ,MAAMC,GAAc,WACpB,IAAIC,GACA,OAAOD,GAAY,OAAW,KAAe,OAAOA,GAAY,OAAO,QAAY,IAEnFC,GAAcD,GAAY,OAAO,QAE5B,OAAO,QAAY,KAAe,OAAO,SAAS,UAAU,MAAS,WAE1EC,GAAc,SAGlB,MAAMC,GADoB,OAAOD,IAAa,UAAU,UAAa,UACrBA,IAAa,OAAS,WAEtE,GAAI,OAAOA,IAAgB,SAAU,CACjCT,GAAcS,GAAY,WAAa,QACvCR,GAAgBQ,GAAY,WAAa,SACzCP,GAAYO,GAAY,WAAa,QACrCP,IAAcO,GAAY,IAAI,MAAaA,GAAY,IAAI,cACzDA,GAAY,IAAI,IAAWA,GAAY,IAAI,gCAAuCA,GAAY,IAAI,iBACpGN,GAAUJ,GACVK,GAAYL,GACZ,MAAMY,EAAeF,GAAY,IAAI,kBACrC,GAAIE,EACA,GAAI,CACA,MAAMC,EAAY,KAAK,MAAMD,CAAY,EACzCR,GAAUS,EAAU,WACpBP,GAAkBO,EAAU,SAC5BR,GAAYQ,EAAU,kBAAoBb,GAC1CO,GAA0BM,EAAU,cAAc,sBACtD,MACU,CACV,CAGR,MAES,OAAO,WAAc,UAAY,CAACF,IACvCH,GAAa,UAAU,UACvBP,GAAaO,GAAW,QAAQ,SAAS,GAAK,EAC9CN,GAAeM,GAAW,QAAQ,WAAW,GAAK,GACxCA,GAAW,QAAQ,WAAW,GAAK,GAAKA,GAAW,QAAQ,MAAM,GAAK,GAAKA,GAAW,QAAQ,QAAQ,GAAK,IAAQ,UAAU,gBAAkB,UAAU,eAAiB,EACpLL,GAAWK,GAAW,QAAQ,OAAO,GAAK,EAC9BA,IAAY,QAAQ,MAAM,GAAK,EAE3CH,GAAYd,GAAc,GAAMS,GAChCI,GAAU,UAAU,SAAS,YAAW,EACxCE,GAAkBF,IAIlB,QAAQ,MAAM,6BAA6B,EAY/C,MAAMU,GAAYb,GACZc,GAAcb,GASdc,GAAYR,GAOZS,GAAuB,OAAOR,GAAY,aAAgB,YAAc,CAACA,GAAY,eAOtE,IAAM,CACvB,GAAIQ,GAAqB,CACrB,MAAMC,EAAU,CAAA,EAChBT,GAAY,iBAAiB,UAAYhO,GAAM,CAC3C,GAAIA,EAAE,MAAQA,EAAE,KAAK,wBACjB,QAASuB,EAAI,EAAGmN,EAAMD,EAAQ,OAAQlN,EAAImN,EAAKnN,IAAK,CAChD,MAAMoN,EAAYF,EAAQlN,CAAC,EAC3B,GAAIoN,EAAU,KAAO3O,EAAE,KAAK,wBAAyB,CACjDyO,EAAQ,OAAOlN,EAAG,CAAC,EACnBoN,EAAU,SAAQ,EAClB,MACJ,CACJ,CAER,CAAC,EACD,IAAIC,EAAS,EACb,OAAQzC,GAAa,CACjB,MAAM0C,EAAO,EAAED,EACfH,EAAQ,KAAK,CACT,GAAII,EACJ,SAAU1C,CAC1B,CAAa,EACD6B,GAAY,YAAY,CAAE,wBAAyBa,CAAI,EAAI,GAAG,CAClE,CACJ,CACA,OAAQ1C,GAAa,WAAWA,CAAQ,CAC5C,GAAC,EAeD,MAAM2C,GAAW,CAAC,EAAEP,IAAaA,GAAU,QAAQ,QAAQ,GAAK,GAC3CA,IAAaA,GAAU,QAAQ,SAAS,GAAK,EAC9C,CAACO,IAAaP,IAAaA,GAAU,QAAQ,QAAQ,GAAK,EAC5DA,IAAaA,GAAU,QAAQ,MAAM,GAAK,EACvCA,IAAaA,GAAU,QAAQ,SAAS,GAAK,ECvJlE,SAASQ,GAAS,EAAG,CACjB,OAAO,CACX,CAKA,MAAMC,EAAkB,CACpB,YAAYC,EAAMC,EAAM,CACpB,KAAK,UAAY,OACjB,KAAK,WAAa,OACd,OAAOD,GAAS,YAChB,KAAK,IAAMA,EACX,KAAK,YAAcF,KAGnB,KAAK,IAAMG,EACX,KAAK,YAAcD,EAAK,YAEhC,CACA,IAAIrK,EAAK,CACL,MAAMuK,EAAM,KAAK,YAAYvK,CAAG,EAChC,OAAI,KAAK,aAAeuK,IACpB,KAAK,WAAaA,EAClB,KAAK,UAAY,KAAK,IAAIvK,CAAG,GAE1B,KAAK,SAChB,CACJ,CCxBA,IAAIwK,IACH,SAAUA,EAAgB,CACvBA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,QAAa,CAAC,EAAI,UAChDA,EAAeA,EAAe,UAAe,CAAC,EAAI,WACtD,GAAGA,KAAmBA,GAAiB,CAAA,EAAG,EAC1C,MAAMC,EAAK,CACP,YAAYC,EAAU,CAClB,KAAK,SAAWA,EAChB,KAAK,OAASF,GAAe,aACjC,CAOA,IAAI,OAAQ,CACR,GAAI,KAAK,SAAWA,GAAe,cAAe,CAC9C,KAAK,OAASA,GAAe,QAC7B,GAAI,CACA,KAAK,OAAS,KAAK,SAAQ,CAC/B,OACOzO,EAAK,CACR,KAAK,OAASA,CAClB,QACZ,CACgB,KAAK,OAASyO,GAAe,SACjC,CACJ,SACS,KAAK,SAAWA,GAAe,QACpC,MAAM,IAAI,MAAM,2DAA2D,EAE/E,GAAI,KAAK,OACL,MAAM,KAAK,OAEf,OAAO,KAAK,MAChB,CAIA,IAAI,UAAW,CAAE,OAAO,KAAK,MAAQ,CACzC,CCoBA,SAASG,GAAuBxO,EAAO,CACnC,OAAOA,EAAM,QAAQ,kCAAmC,MAAM,CAClE,CAwFA,SAASyO,GAAyBC,EAAQ,CAGtC,OAAIA,EAAO,SAAW,KAAOA,EAAO,SAAW,MAAQA,EAAO,SAAW,KAAOA,EAAO,SAAW,SACvF,GAKJ,CAAC,EADMA,EAAO,KAAK,EAAE,GACTA,EAAO,YAAc,EAC5C,CACA,SAASC,GAAW/N,EAAK,CACrB,OAAOA,EAAI,MAAM,YAAY,CACjC,CAKA,SAASgO,GAAwBhO,EAAK,CAClC,QAASJ,EAAI,EAAGmN,EAAM/M,EAAI,OAAQJ,EAAImN,EAAKnN,IAAK,CAC5C,MAAMqO,EAASjO,EAAI,WAAWJ,CAAC,EAC/B,GAAIqO,IAAW,IAA2BA,IAAW,EACjD,OAAOrO,CAEf,CACA,MAAO,EACX,CAkBA,SAASsO,GAAuBlO,EAAKmO,EAAanO,EAAI,OAAS,EAAG,CAC9D,QAASJ,EAAIuO,EAAYvO,GAAK,EAAGA,IAAK,CAClC,MAAMqO,EAASjO,EAAI,WAAWJ,CAAC,EAC/B,GAAIqO,IAAW,IAA2BA,IAAW,EACjD,OAAOrO,CAEf,CACA,MAAO,EACX,CA+EA,SAASwO,GAAmBC,EAAM,CAC9B,OAAOA,GAAQ,IAAuBA,GAAQ,EAClD,CAgBA,SAASC,GAAmBzO,EAAGC,EAAG,CAC9B,MAAMiN,EAAM,KAAK,IAAIlN,EAAE,OAAQC,EAAE,MAAM,EACvC,IAAIF,EACJ,IAAKA,EAAI,EAAGA,EAAImN,EAAKnN,IACjB,GAAIC,EAAE,WAAWD,CAAC,IAAME,EAAE,WAAWF,CAAC,EAClC,OAAOA,EAGf,OAAOmN,CACX,CAIA,SAASwB,GAAmB1O,EAAGC,EAAG,CAC9B,MAAMiN,EAAM,KAAK,IAAIlN,EAAE,OAAQC,EAAE,MAAM,EACvC,IAAIF,EACJ,MAAM4O,EAAa3O,EAAE,OAAS,EACxB4O,EAAa3O,EAAE,OAAS,EAC9B,IAAKF,EAAI,EAAGA,EAAImN,EAAKnN,IACjB,GAAIC,EAAE,WAAW2O,EAAa5O,CAAC,IAAME,EAAE,WAAW2O,EAAa7O,CAAC,EAC5D,OAAOA,EAGf,OAAOmN,CACX,CAIA,SAAS2B,GAAgBC,EAAU,CAC/B,MAAQ,QAAUA,GAAYA,GAAY,KAC9C,CAIA,SAASC,GAAeD,EAAU,CAC9B,MAAQ,QAAUA,GAAYA,GAAY,KAC9C,CAIA,SAASE,GAAiBC,EAAeC,EAAc,CACnD,OAASD,EAAgB,OAAW,KAAOC,EAAe,OAAU,KACxE,CAIA,SAASC,GAAiBhP,EAAK+M,EAAKkC,EAAQ,CACxC,MAAMN,EAAW3O,EAAI,WAAWiP,CAAM,EACtC,GAAIP,GAAgBC,CAAQ,GAAKM,EAAS,EAAIlC,EAAK,CAC/C,MAAMmC,EAAelP,EAAI,WAAWiP,EAAS,CAAC,EAC9C,GAAIL,GAAeM,CAAY,EAC3B,OAAOL,GAAiBF,EAAUO,CAAY,CAEtD,CACA,OAAOP,CACX,CAmHA,MAAMQ,GAAiB,uBAIvB,SAASC,GAAapP,EAAK,CACvB,OAAOmP,GAAe,KAAKnP,CAAG,CAClC,CAqQA,MAAMqP,GAAN,MAAMA,EAAoB,CA+CtB,OAAO,YAAYC,EAAS,CACxB,OAAOD,GAAoB,MAAM,IAAI,MAAM,KAAKC,CAAO,CAAC,CAC5D,CAEA,OAAO,YAAa,CAChB,OAAOD,GAAoB,SAAS,KACxC,CACA,YAAYE,EAAsB,CAC9B,KAAK,qBAAuBA,CAChC,CACA,YAAYC,EAAW,CACnB,OAAO,KAAK,qBAAqB,IAAIA,CAAS,CAClD,CAKA,qBAAqBA,EAAW,CAC5B,OAAO,KAAK,qBAAqB,IAAIA,CAAS,CAClD,CACA,yBAA0B,CACtB,OAAO,IAAI,IAAI,KAAK,qBAAqB,KAAI,CAAE,CACnD,CACJ,EArEaH,GAAK,uBAAyB,IAAI3B,GAAK,IAGrC,KAAK,MAAM,2knBAA2mnB,CAChonB,EACQ2B,GAAK,MAAQ,IAAIhC,GAAkB,CAAE,YAAa,KAAK,WAAciC,GAAY,CACtF,SAASG,EAAWrN,EAAK,CACrB,MAAMnD,EAAS,IAAI,IACnB,QAASW,EAAI,EAAGA,EAAIwC,EAAI,OAAQxC,GAAK,EACjCX,EAAO,IAAImD,EAAIxC,CAAC,EAAGwC,EAAIxC,EAAI,CAAC,CAAC,EAEjC,OAAOX,CACX,CACA,SAASyQ,EAAUC,EAAMC,EAAM,CAC3B,MAAM3Q,EAAS,IAAI,IAAI0Q,CAAI,EAC3B,SAAW,CAACnC,EAAKpO,CAAK,IAAKwQ,EACvB3Q,EAAO,IAAIuO,EAAKpO,CAAK,EAEzB,OAAOH,CACX,CACA,SAAS4Q,EAAcF,EAAMC,EAAM,CAC/B,GAAI,CAACD,EACD,OAAOC,EAEX,MAAM3Q,EAAS,IAAI,IACnB,SAAW,CAACuO,EAAKpO,CAAK,IAAKuQ,EACnBC,EAAK,IAAIpC,CAAG,GACZvO,EAAO,IAAIuO,EAAKpO,CAAK,EAG7B,OAAOH,CACX,CACA,MAAMwM,EAAO4D,GAAK,uBAAuB,MACzC,IAAIS,EAAkBR,EAAQ,OAAQS,GAAM,CAACA,EAAE,WAAW,GAAG,GAAK,OAAO,OAAOtE,EAAMsE,CAAC,CAAC,EACpFD,EAAgB,SAAW,IAC3BA,EAAkB,CAAC,UAAU,GAEjC,IAAIE,EACJ,UAAWC,KAAUH,EAAiB,CAClC,MAAMxO,EAAMmO,EAAWhE,EAAKwE,CAAM,CAAC,EACnCD,EAAsBH,EAAcG,EAAqB1O,CAAG,CAChE,CACA,MAAM4O,EAAYT,EAAWhE,EAAK,OAAU,EACtCnK,EAAMoO,EAAUQ,EAAWF,CAAmB,EACpD,OAAO,IAAIX,GAAoB/N,CAAG,CACtC,CAAC,EAIQ+N,GAAK,SAAW,IAAI3B,GAAK,IAAM,OAAO,KAAK2B,GAAoB,uBAAuB,KAAK,EAAE,OAAQc,GAAM,CAACA,EAAE,WAAW,GAAG,CAAC,CAAC,EAlD3I,IAAMC,GAANf,GAuEA,MAAMgB,GAAN,MAAMA,EAAoB,CACtB,OAAO,YAAa,CAEhB,OAAO,KAAK,MAAM,20GAAy2G,CAC/3G,CAEA,OAAO,SAAU,CACb,OAAK,KAAK,QACN,KAAK,MAAQ,IAAI,IAAI,CAAC,GAAG,OAAO,OAAOA,GAAoB,WAAU,CAAE,CAAC,EAAE,KAAI,CAAE,GAE7E,KAAK,KAChB,CACA,OAAO,qBAAqBb,EAAW,CACnC,OAAOa,GAAoB,UAAU,IAAIb,CAAS,CACtD,CACA,WAAW,YAAa,CACpB,OAAOa,GAAoB,QAAO,CACtC,CACJ,EAbaA,GAAK,MAAQ,OAL1B,IAAMC,GAAND,GCnyBA,MAAME,GAAkB,UAClBC,GAAa,cAanB,MAAMC,EAAe,CACjB,YAAYC,EAAUC,EAAKC,EAASC,EAAQ1I,EAAM,CAC9C,KAAK,SAAWuI,EAChB,KAAK,IAAMC,EACX,KAAK,QAAUC,EACf,KAAK,OAASC,EACd,KAAK,KAAO1I,EACZ,KAAK,KAAO,CAChB,CACJ,CACA,MAAM2I,EAAa,CACf,YAAYJ,EAAUK,EAAKzM,EAAKtF,EAAK,CACjC,KAAK,SAAW0R,EAChB,KAAK,IAAMK,EACX,KAAK,IAAMzM,EACX,KAAK,IAAMtF,EACX,KAAK,KAAO,CAChB,CACJ,CACA,MAAMgS,EAAsB,CACxB,YAAYN,EAAUC,EAAKC,EAAS3I,EAAWhF,EAAK,CAChD,KAAK,SAAWyN,EAChB,KAAK,IAAMC,EACX,KAAK,QAAUC,EACf,KAAK,UAAY3I,EACjB,KAAK,IAAMhF,EACX,KAAK,KAAO,CAChB,CACJ,CACA,MAAMgO,EAAa,CACf,YAAYP,EAAUC,EAAK9L,EAAO,CAC9B,KAAK,SAAW6L,EAChB,KAAK,IAAMC,EACX,KAAK,MAAQ9L,EACb,KAAK,KAAO,CAChB,CACJ,CACA,MAAMqM,EAAwB,CAC1B,YAAYR,EAAUC,EAAK,CACvB,KAAK,SAAWD,EAChB,KAAK,IAAMC,EACX,KAAK,KAAO,CAChB,CACJ,CACA,MAAMQ,EAAkB,CACpB,YAAYrI,EAAS,CACjB,KAAK,UAAY,GACjB,KAAK,SAAWA,EAChB,KAAK,aAAe,EACpB,KAAK,gBAAkB,OAAO,OAAO,IAAI,EACzC,KAAK,iBAAmB,IAAI,IAC5B,KAAK,eAAiB,IAAI,GAC9B,CACA,YAAYsI,EAAU,CAClB,KAAK,UAAYA,CACrB,CACA,MAAM,YAAYR,EAASC,EAAQ1I,EAAM,CACrC,MAAMwI,EAAM,OAAO,EAAE,KAAK,YAAY,EACtC,OAAO,IAAI,QAAQ,CAACjI,EAASC,IAAW,CACpC,KAAK,gBAAgBgI,CAAG,EAAI,CACxB,QAASjI,EACT,OAAQC,CACxB,EACY,KAAK,MAAM,IAAI8H,GAAe,KAAK,UAAWE,EAAKC,EAASC,EAAQ1I,CAAI,CAAC,CAC7E,CAAC,CACL,CACA,OAAOyI,EAAS3I,EAAWhF,EAAK,CAC5B,IAAI0N,EAAM,KACV,MAAM5K,EAAU,IAAIC,GAAQ,CACxB,uBAAwB,IAAM,CAC1B2K,EAAM,OAAO,EAAE,KAAK,YAAY,EAChC,KAAK,iBAAiB,IAAIA,EAAK5K,CAAO,EACtC,KAAK,MAAM,IAAIiL,GAAsB,KAAK,UAAWL,EAAKC,EAAS3I,EAAWhF,CAAG,CAAC,CACtF,EACA,wBAAyB,IAAM,CAC3B,KAAK,iBAAiB,OAAO0N,CAAG,EAChC,KAAK,MAAM,IAAIO,GAAwB,KAAK,UAAWP,CAAG,CAAC,EAC3DA,EAAM,IACV,CACZ,CAAS,EACD,OAAO5K,EAAQ,KACnB,CACA,cAAcrH,EAAS,CACf,CAACA,GAAW,CAACA,EAAQ,UAGrB,KAAK,YAAc,IAAMA,EAAQ,WAAa,KAAK,WAGvD,KAAK,eAAeA,CAAO,CAC/B,CACA,2BAA2BkS,EAASS,EAAoB,CACpD,MAAMvI,EAAU,CACZ,IAAK,CAACwI,EAAQ7S,KACN,OAAOA,GAAS,UAAY,CAAC6S,EAAO7S,CAAI,IACpC8S,GAAuB9S,CAAI,EAC3B6S,EAAO7S,CAAI,EAAKwE,GACL,KAAK,OAAO2N,EAASnS,EAAMwE,CAAG,EAGpCuO,GAAgB/S,CAAI,EACzB6S,EAAO7S,CAAI,EAAI,KAAK,OAAOmS,EAASnS,EAAM,MAAS,EAE9CA,EAAK,WAAW,CAAC,IAAM,KAC5B6S,EAAO7S,CAAI,EAAI,SAAUgT,KACrB,MAAMJ,IAAkB,EACjB,KAAK,YAAYT,EAASnS,EAAMgT,CAAM,KAIlDH,EAAO7S,CAAI,EAElC,EACQ,OAAO,IAAI,MAAM,OAAO,OAAO,IAAI,EAAGqK,CAAO,CACjD,CACA,eAAe/J,EAAK,CAChB,OAAQA,EAAI,KAAI,CACZ,IAAK,GACD,OAAO,KAAK,oBAAoBA,CAAG,EACvC,IAAK,GACD,OAAO,KAAK,sBAAsBA,CAAG,EACzC,IAAK,GACD,OAAO,KAAK,6BAA6BA,CAAG,EAChD,IAAK,GACD,OAAO,KAAK,oBAAoBA,CAAG,EACvC,IAAK,GACD,OAAO,KAAK,+BAA+BA,CAAG,CAC9D,CACI,CACA,oBAAoB2S,EAAc,CAC9B,GAAI,CAAC,KAAK,gBAAgBA,EAAa,GAAG,EAAG,CACzC,QAAQ,KAAK,0BAA0B,EACvC,MACJ,CACA,MAAMC,EAAQ,KAAK,gBAAgBD,EAAa,GAAG,EAEnD,GADA,OAAO,KAAK,gBAAgBA,EAAa,GAAG,EACxCA,EAAa,IAAK,CAClB,IAAI1S,EAAM0S,EAAa,IACvB,GAAIA,EAAa,IAAI,SAAU,CAC3B,MAAME,EAAS,IAAI,MACnBA,EAAO,KAAOF,EAAa,IAAI,KAC/BE,EAAO,QAAUF,EAAa,IAAI,QAClCE,EAAO,MAAQF,EAAa,IAAI,MAChC1S,EAAM4S,CACV,CACAD,EAAM,OAAO3S,CAAG,EAChB,MACJ,CACA2S,EAAM,QAAQD,EAAa,GAAG,CAClC,CACA,sBAAsBG,EAAgB,CAClC,MAAMlB,EAAMkB,EAAe,IACZ,KAAK,SAAS,cAAcA,EAAe,QAASA,EAAe,OAAQA,EAAe,IAAI,EACtG,KAAMC,GAAM,CACf,KAAK,MAAM,IAAIhB,GAAa,KAAK,UAAWH,EAAKmB,EAAG,MAAS,CAAC,CAClE,EAAIzT,GAAM,CACFA,EAAE,kBAAkB,QAEpBA,EAAE,OAASE,GAA+BF,EAAE,MAAM,GAEtD,KAAK,MAAM,IAAIyS,GAAa,KAAK,UAAWH,EAAK,OAAWpS,GAA+BF,CAAC,CAAC,CAAC,CAClG,CAAC,CACL,CACA,6BAA6BU,EAAK,CAC9B,MAAM4R,EAAM5R,EAAI,IACV+F,EAAa,KAAK,SAAS,YAAY/F,EAAI,QAASA,EAAI,UAAWA,EAAI,GAAG,EAAG8F,GAAU,CACzF,KAAK,MAAM,IAAIoM,GAAa,KAAK,UAAWN,EAAK9L,CAAK,CAAC,CAC3D,CAAC,EACD,KAAK,eAAe,IAAI8L,EAAK7L,CAAU,CAC3C,CACA,oBAAoB/F,EAAK,CACrB,GAAI,CAAC,KAAK,iBAAiB,IAAIA,EAAI,GAAG,EAAG,CACrC,QAAQ,KAAK,2BAA2B,EACxC,MACJ,CACA,KAAK,iBAAiB,IAAIA,EAAI,GAAG,EAAE,KAAKA,EAAI,KAAK,CACrD,CACA,+BAA+BA,EAAK,CAChC,GAAI,CAAC,KAAK,eAAe,IAAIA,EAAI,GAAG,EAAG,CACnC,QAAQ,KAAK,iCAAiC,EAC9C,MACJ,CACA,KAAK,eAAe,IAAIA,EAAI,GAAG,EAAE,QAAO,EACxC,KAAK,eAAe,OAAOA,EAAI,GAAG,CACtC,CACA,MAAMA,EAAK,CACP,MAAMgT,EAAW,CAAA,EACjB,GAAIhT,EAAI,OAAS,EACb,QAASa,EAAI,EAAGA,EAAIb,EAAI,KAAK,OAAQa,IAAK,CACtC,MAAMqD,EAAMlE,EAAI,KAAKa,CAAC,EAClBqD,aAAe,aACf8O,EAAS,KAAK9O,CAAG,CAEzB,MAEKlE,EAAI,OAAS,GACdA,EAAI,eAAe,aACnBgT,EAAS,KAAKhT,EAAI,GAAG,EAG7B,KAAK,SAAS,YAAYA,EAAKgT,CAAQ,CAC3C,CACJ,CAsFA,SAASP,GAAgB/S,EAAM,CAE3B,OAAOA,EAAK,CAAC,IAAM,KAAOA,EAAK,CAAC,IAAM,KAAO2P,GAAmB3P,EAAK,WAAW,CAAC,CAAC,CACtF,CACA,SAAS8S,GAAuB9S,EAAM,CAElC,MAAO,aAAa,KAAKA,CAAI,GAAK2P,GAAmB3P,EAAK,WAAW,CAAC,CAAC,CAC3E,CAIA,MAAMuT,EAAgB,CAClB,YAAYC,EAAaC,EAAuB,CAC5C,KAAK,eAAiB,IAAI,IAC1B,KAAK,gBAAkB,IAAI,IAC3B,KAAK,UAAY,IAAIf,GAAkB,CACnC,YAAa,CAACpS,EAAKgT,IAAa,CAC5BE,EAAYlT,EAAKgT,CAAQ,CAC7B,EACA,cAAe,CAACnB,EAASC,EAAQ1I,IAAS,KAAK,eAAeyI,EAASC,EAAQ1I,CAAI,EACnF,YAAa,CAACyI,EAAS3I,EAAWhF,IAAQ,KAAK,aAAa2N,EAAS3I,EAAWhF,CAAG,CAC/F,CAAS,EACD,KAAK,eAAiBiP,EAAsB,IAAI,CACpD,CACA,UAAUnT,EAAK,CACX,KAAK,UAAU,cAAcA,CAAG,CACpC,CACA,eAAe6R,EAASC,EAAQ1I,EAAM,CAClC,GAAIyI,IAAYL,IAAmBM,IAAWL,GAC1C,OAAO,KAAK,WAAWrI,EAAK,CAAC,CAAC,EAElC,MAAMgK,EAAkBvB,IAAYL,GAAkB,KAAK,eAAiB,KAAK,eAAe,IAAIK,CAAO,EAC3G,GAAI,CAACuB,EACD,OAAO,QAAQ,OAAO,IAAI,MAAM,mBAAmBvB,CAAO,mBAAmB,CAAC,EAElF,MAAMrP,EAAK4Q,EAAetB,CAAM,EAChC,GAAI,OAAOtP,GAAO,WACd,OAAO,QAAQ,OAAO,IAAI,MAAM,kBAAkBsP,CAAM,6BAA6BD,CAAO,EAAE,CAAC,EAEnG,GAAI,CACA,OAAO,QAAQ,QAAQrP,EAAG,MAAM4Q,EAAgBhK,CAAI,CAAC,CACzD,OACO9J,EAAG,CACN,OAAO,QAAQ,OAAOA,CAAC,CAC3B,CACJ,CACA,aAAauS,EAAS3I,EAAWhF,EAAK,CAClC,MAAMkP,EAAkBvB,IAAYL,GAAkB,KAAK,eAAiB,KAAK,eAAe,IAAIK,CAAO,EAC3G,GAAI,CAACuB,EACD,MAAM,IAAI,MAAM,mBAAmBvB,CAAO,mBAAmB,EAEjE,GAAIW,GAAuBtJ,CAAS,EAAG,CACnC,MAAM1G,EAAK4Q,EAAelK,CAAS,EACnC,GAAI,OAAO1G,GAAO,WACd,MAAM,IAAI,MAAM,yBAAyB0G,CAAS,sBAAsB,EAE5E,MAAMpD,EAAQtD,EAAG,KAAK4Q,EAAgBlP,CAAG,EACzC,GAAI,OAAO4B,GAAU,WACjB,MAAM,IAAI,MAAM,yBAAyBoD,CAAS,sBAAsB,EAE5E,OAAOpD,CACX,CACA,GAAI2M,GAAgBvJ,CAAS,EAAG,CAC5B,MAAMpD,EAAQsN,EAAelK,CAAS,EACtC,GAAI,OAAOpD,GAAU,WACjB,MAAM,IAAI,MAAM,iBAAiBoD,CAAS,sBAAsB,EAEpE,OAAOpD,CACX,CACA,MAAM,IAAI,MAAM,wBAAwBoD,CAAS,EAAE,CACvD,CACA,WAAW2I,EAAS,CAChB,GAAI,CAAC,KAAK,gBAAgB,IAAIA,CAAO,EAAG,CACpC,MAAMwB,EAAO,KAAK,UAAU,2BAA2BxB,CAAO,EAC9D,KAAK,gBAAgB,IAAIA,EAASwB,CAAI,CAC1C,CACA,OAAO,KAAK,gBAAgB,IAAIxB,CAAO,CAC3C,CACA,MAAM,WAAWQ,EAAU,CACvB,KAAK,UAAU,YAAYA,CAAQ,CACvC,CACJ,CCnYA,IAAIiB,GAAc,GAClB,SAASC,GAAWC,EAAS,CACzB,GAAIF,GACA,MAAM,IAAI,MAAM,gCAAgC,EAEpDA,GAAc,GACd,MAAMG,EAAkB,IAAIR,GAAgBjT,GAAO,WAAW,YAAYA,CAAG,EAAI0T,GAAiBF,EAAQE,CAAY,CAAC,EACvH,kBAAW,UAAapU,GAAM,CAC1BmU,EAAgB,UAAUnU,EAAE,IAAI,CACpC,EACOmU,CACX,CCVA,MAAME,EAAW,CAKb,YAAYC,EAAeC,EAAgBC,EAAeC,EAAgB,CAEtE,KAAK,cAAgBH,EACrB,KAAK,eAAiBC,EACtB,KAAK,cAAgBC,EACrB,KAAK,eAAiBC,CAC1B,CAIA,gBAAiB,CACb,OAAO,KAAK,cAAgB,KAAK,cACrC,CAIA,gBAAiB,CACb,OAAO,KAAK,cAAgB,KAAK,cACrC,CACJ,CCxBA,IAAIpF,GAAK,IAAM,IAAI,WAAW,GAAG,CAAC,EC+BlC,SAASqF,GAAWC,EAAKC,EAAgB,CACrC,OAAUA,GAAkB,GAAKA,EAAkBD,EAAO,CAC9D,CAIA,SAASE,GAAWC,EAAGC,EAAS,CAC5BA,EAAUL,GAAW,OAAQK,CAAO,EACpC,QAASxT,EAAI,EAAGoC,EAASmR,EAAE,OAAQvT,EAAIoC,EAAQpC,IAC3CwT,EAAUL,GAAWI,EAAE,WAAWvT,CAAC,EAAGwT,CAAO,EAEjD,OAAOA,CACX,CC3CA,MAAMC,EAAmB,CACrB,YAAYC,EAAQ,CAChB,KAAK,OAASA,CAClB,CACA,aAAc,CACV,MAAMA,EAAS,KAAK,OACdC,EAAa,IAAI,WAAWD,EAAO,MAAM,EAC/C,QAAS1T,EAAI,EAAGmN,EAAMuG,EAAO,OAAQ1T,EAAImN,EAAKnN,IAC1C2T,EAAW3T,CAAC,EAAI0T,EAAO,WAAW1T,CAAC,EAEvC,OAAO2T,CACX,CACJ,CACA,SAASC,GAAWC,EAAUC,EAAUC,EAAQ,CAC5C,OAAO,IAAIC,GAAQ,IAAIP,GAAmBI,CAAQ,EAAG,IAAIJ,GAAmBK,CAAQ,CAAC,EAAE,YAAYC,CAAM,EAAE,OAC/G,CAIA,MAAME,EAAM,CACR,OAAO,OAAOvU,EAAWZ,EAAS,CAC9B,GAAI,CAACY,EACD,MAAM,IAAI,MAAMZ,CAAO,CAE/B,CACJ,CACA,MAAMoV,EAAQ,CAgBV,OAAO,KAAKC,EAAaC,EAAaC,EAAkBC,EAAkBlS,EAAQ,CAC9E,QAASpC,EAAI,EAAGA,EAAIoC,EAAQpC,IACxBqU,EAAiBC,EAAmBtU,CAAC,EAAImU,EAAYC,EAAcpU,CAAC,CAE5E,CACA,OAAO,MAAMmU,EAAaC,EAAaC,EAAkBC,EAAkBlS,EAAQ,CAC/E,QAASpC,EAAI,EAAGA,EAAIoC,EAAQpC,IACxBqU,EAAiBC,EAAmBtU,CAAC,EAAImU,EAAYC,EAAcpU,CAAC,CAE5E,CACJ,CASA,MAAMuU,EAAiB,CAInB,aAAc,CACV,KAAK,UAAY,CAAA,EACjB,KAAK,gBAAkB,WACvB,KAAK,gBAAkB,WACvB,KAAK,gBAAkB,EACvB,KAAK,gBAAkB,CAC3B,CAIA,gBAAiB,EAET,KAAK,gBAAkB,GAAK,KAAK,gBAAkB,IAEnD,KAAK,UAAU,KAAK,IAAIzB,GAAW,KAAK,gBAAiB,KAAK,gBAAiB,KAAK,gBAAiB,KAAK,eAAe,CAAC,EAG9H,KAAK,gBAAkB,EACvB,KAAK,gBAAkB,EACvB,KAAK,gBAAkB,WACvB,KAAK,gBAAkB,UAC3B,CAQA,mBAAmB0B,EAAeC,EAAe,CAE7C,KAAK,gBAAkB,KAAK,IAAI,KAAK,gBAAiBD,CAAa,EACnE,KAAK,gBAAkB,KAAK,IAAI,KAAK,gBAAiBC,CAAa,EACnE,KAAK,iBACT,CAQA,mBAAmBD,EAAeC,EAAe,CAE7C,KAAK,gBAAkB,KAAK,IAAI,KAAK,gBAAiBD,CAAa,EACnE,KAAK,gBAAkB,KAAK,IAAI,KAAK,gBAAiBC,CAAa,EACnE,KAAK,iBACT,CAIA,YAAa,CACT,OAAI,KAAK,gBAAkB,GAAK,KAAK,gBAAkB,IAEnD,KAAK,eAAc,EAEhB,KAAK,SAChB,CAIA,mBAAoB,CAChB,OAAI,KAAK,gBAAkB,GAAK,KAAK,gBAAkB,IAEnD,KAAK,eAAc,EAEvB,KAAK,UAAU,QAAO,EACf,KAAK,SAChB,CACJ,CAKA,MAAMT,EAAQ,CAIV,YAAYU,EAAkBC,EAAkBC,EAA8B,KAAM,CAChF,KAAK,4BAA8BA,EACnC,KAAK,kBAAoBF,EACzB,KAAK,kBAAoBC,EACzB,KAAM,CAACE,EAAwBC,EAAwBC,CAAkB,EAAIf,GAAQ,aAAaU,CAAgB,EAC5G,CAACM,EAAwBC,EAAwBC,CAAkB,EAAIlB,GAAQ,aAAaW,CAAgB,EAClH,KAAK,YAAeI,GAAsBG,EAC1C,KAAK,wBAA0BL,EAC/B,KAAK,wBAA0BC,EAC/B,KAAK,wBAA0BE,EAC/B,KAAK,wBAA0BC,EAC/B,KAAK,iBAAmB,CAAA,EACxB,KAAK,iBAAmB,CAAA,CAC5B,CACA,OAAO,eAAezS,EAAK,CACvB,OAAQA,EAAI,OAAS,GAAK,OAAOA,EAAI,CAAC,GAAM,QAChD,CACA,OAAO,aAAa2S,EAAU,CAC1B,MAAMC,EAAWD,EAAS,YAAW,EACrC,GAAInB,GAAQ,eAAeoB,CAAQ,EAAG,CAClC,MAAMC,EAAS,IAAI,WAAWD,EAAS,MAAM,EAC7C,QAAS,EAAI,EAAGjI,EAAMiI,EAAS,OAAQ,EAAIjI,EAAK,IAC5CkI,EAAO,CAAC,EAAI/B,GAAW8B,EAAS,CAAC,EAAG,CAAC,EAEzC,MAAO,CAACA,EAAUC,EAAQ,EAAI,CAClC,CACA,OAAID,aAAoB,WACb,CAAC,CAAA,EAAIA,EAAU,EAAK,EAExB,CAAC,CAAA,EAAI,IAAI,WAAWA,CAAQ,EAAG,EAAK,CAC/C,CACA,iBAAiBZ,EAAec,EAAU,CACtC,OAAI,KAAK,wBAAwBd,CAAa,IAAM,KAAK,wBAAwBc,CAAQ,EAC9E,GAEH,KAAK,YAAc,KAAK,wBAAwBd,CAAa,IAAM,KAAK,wBAAwBc,CAAQ,EAAI,EACxH,CACA,uBAAuBd,EAAec,EAAU,CAC5C,GAAI,CAAC,KAAK,iBAAiBd,EAAec,CAAQ,EAC9C,MAAO,GAEX,MAAMC,EAAkBvB,GAAQ,kBAAkB,KAAK,kBAAmBQ,CAAa,EACjFgB,EAAkBxB,GAAQ,kBAAkB,KAAK,kBAAmBsB,CAAQ,EAClF,OAAQC,IAAoBC,CAChC,CACA,OAAO,kBAAkBL,EAAUvT,EAAO,CACtC,OAAI,OAAOuT,EAAS,kBAAqB,WAC9BA,EAAS,iBAAiBvT,CAAK,EAEnC,IACX,CACA,yBAAyB6T,EAAQC,EAAQ,CACrC,OAAI,KAAK,wBAAwBD,CAAM,IAAM,KAAK,wBAAwBC,CAAM,EACrE,GAEH,KAAK,YAAc,KAAK,wBAAwBD,CAAM,IAAM,KAAK,wBAAwBC,CAAM,EAAI,EAC/G,CACA,yBAAyBD,EAAQC,EAAQ,CACrC,OAAI,KAAK,wBAAwBD,CAAM,IAAM,KAAK,wBAAwBC,CAAM,EACrE,GAEH,KAAK,YAAc,KAAK,wBAAwBD,CAAM,IAAM,KAAK,wBAAwBC,CAAM,EAAI,EAC/G,CACA,YAAY3B,EAAQ,CAChB,OAAO,KAAK,aAAa,EAAG,KAAK,wBAAwB,OAAS,EAAG,EAAG,KAAK,wBAAwB,OAAS,EAAGA,CAAM,CAC3H,CAMA,aAAahB,EAAe4C,EAAa1C,EAAe2C,EAAa7B,EAAQ,CACzE,MAAM8B,EAAe,CAAC,EAAK,EAC3B,IAAIC,EAAU,KAAK,qBAAqB/C,EAAe4C,EAAa1C,EAAe2C,EAAaC,CAAY,EAC5G,OAAI9B,IAIA+B,EAAU,KAAK,gBAAgBA,CAAO,GAEnC,CACH,UAAWD,EAAa,CAAC,EACzB,QAASC,CACrB,CACI,CAMA,qBAAqB/C,EAAe4C,EAAa1C,EAAe2C,EAAaC,EAAc,CAGvF,IAFAA,EAAa,CAAC,EAAI,GAEX9C,GAAiB4C,GAAe1C,GAAiB2C,GAAe,KAAK,iBAAiB7C,EAAeE,CAAa,GACrHF,IACAE,IAGJ,KAAO0C,GAAe5C,GAAiB6C,GAAe3C,GAAiB,KAAK,iBAAiB0C,EAAaC,CAAW,GACjHD,IACAC,IAGJ,GAAI7C,EAAgB4C,GAAe1C,EAAgB2C,EAAa,CAC5D,IAAIE,EACJ,OAAI7C,GAAiB2C,GACjB3B,GAAM,OAAOlB,IAAkB4C,EAAc,EAAG,wDAAwD,EAExGG,EAAU,CACN,IAAIhD,GAAWC,EAAe,EAAGE,EAAe2C,EAAc3C,EAAgB,CAAC,CACnG,GAEqBF,GAAiB4C,GACtB1B,GAAM,OAAOhB,IAAkB2C,EAAc,EAAG,wDAAwD,EAExGE,EAAU,CACN,IAAIhD,GAAWC,EAAe4C,EAAc5C,EAAgB,EAAGE,EAAe,CAAC,CACnG,IAGgBgB,GAAM,OAAOlB,IAAkB4C,EAAc,EAAG,wDAAwD,EACxG1B,GAAM,OAAOhB,IAAkB2C,EAAc,EAAG,wDAAwD,EAExGE,EAAU,CAAA,GAEPA,CACX,CAEA,MAAMC,EAAiB,CAAC,CAAC,EACnBC,EAAiB,CAAC,CAAC,EACnB3W,EAAS,KAAK,sBAAsB0T,EAAe4C,EAAa1C,EAAe2C,EAAaG,EAAgBC,EAAgBH,CAAY,EACxII,EAAcF,EAAe,CAAC,EAC9BG,EAAcF,EAAe,CAAC,EACpC,GAAI3W,IAAW,KAGX,OAAOA,EAEN,GAAI,CAACwW,EAAa,CAAC,EAAG,CAKvB,MAAMM,EAAc,KAAK,qBAAqBpD,EAAekD,EAAahD,EAAeiD,EAAaL,CAAY,EAClH,IAAIO,EAAe,CAAA,EACnB,OAAKP,EAAa,CAAC,EAMfO,EAAe,CACX,IAAItD,GAAWmD,EAAc,EAAGN,GAAeM,EAAc,GAAK,EAAGC,EAAc,EAAGN,GAAeM,EAAc,GAAK,CAAC,CAC7I,EAPgBE,EAAe,KAAK,qBAAqBH,EAAc,EAAGN,EAAaO,EAAc,EAAGN,EAAaC,CAAY,EAS9G,KAAK,mBAAmBM,EAAaC,CAAY,CAC5D,CAEA,MAAO,CACH,IAAItD,GAAWC,EAAe4C,EAAc5C,EAAgB,EAAGE,EAAe2C,EAAc3C,EAAgB,CAAC,CACzH,CACI,CACA,UAAUoD,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAeC,EAAetC,EAAemB,EAAaI,EAAgBtB,EAAemB,EAAaI,EAAgBe,EAAalB,EAAc,CACnU,IAAImB,EAAiB,KACjBC,EAAiB,KAEjBC,EAAe,IAAI3C,GACnB4C,EAAcb,EACdc,EAAcb,EACdc,EAAoBtB,EAAe,CAAC,EAAIC,EAAe,CAAC,EAAKQ,EAC7Dc,EAAoB,YACpBC,EAAe,KAAK,iBAAiB,OAAS,EAClD,EAAG,CAEC,MAAMC,EAAWH,EAAmBhB,EAEhCmB,IAAaL,GAAgBK,EAAWJ,GAAeP,EAAcW,EAAW,CAAC,EAAIX,EAAcW,EAAW,CAAC,GAE/GhD,EAAgBqC,EAAcW,EAAW,CAAC,EAC1C/C,EAAgBD,EAAgB6C,EAAmBb,EAC/ChC,EAAgB8C,GAChBJ,EAAa,eAAc,EAE/BI,EAAoB9C,EACpB0C,EAAa,mBAAmB1C,EAAgB,EAAGC,CAAa,EAChE4C,EAAoBG,EAAW,EAAKnB,IAIpC7B,EAAgBqC,EAAcW,EAAW,CAAC,EAAI,EAC9C/C,EAAgBD,EAAgB6C,EAAmBb,EAC/ChC,EAAgB8C,GAChBJ,EAAa,eAAc,EAE/BI,EAAoB9C,EAAgB,EACpC0C,EAAa,mBAAmB1C,EAAeC,EAAgB,CAAC,EAChE4C,EAAoBG,EAAW,EAAKnB,GAEpCkB,GAAgB,IAChBV,EAAgB,KAAK,iBAAiBU,CAAY,EAClDlB,EAAsBQ,EAAc,CAAC,EACrCM,EAAc,EACdC,EAAcP,EAAc,OAAS,EAE7C,OAAS,EAAEU,GAAgB,IAI3B,GADAP,EAAiBE,EAAa,kBAAiB,EAC3CrB,EAAa,CAAC,EAAG,CAGjB,IAAI4B,EAAqB1B,EAAe,CAAC,EAAI,EACzC2B,EAAqB1B,EAAe,CAAC,EAAI,EAC7C,GAAIgB,IAAmB,MAAQA,EAAe,OAAS,EAAG,CACtD,MAAMW,EAAoBX,EAAeA,EAAe,OAAS,CAAC,EAClES,EAAqB,KAAK,IAAIA,EAAoBE,EAAkB,eAAc,CAAE,EACpFD,EAAqB,KAAK,IAAIA,EAAoBC,EAAkB,eAAc,CAAE,CACxF,CACAV,EAAiB,CACb,IAAInE,GAAW2E,EAAoB9B,EAAc8B,EAAqB,EAAGC,EAAoB9B,EAAc8B,EAAqB,CAAC,CACjJ,CACQ,KACK,CAEDR,EAAe,IAAI3C,GACnB4C,EAAcT,EACdU,EAAcT,EACdU,EAAoBtB,EAAe,CAAC,EAAIC,EAAe,CAAC,EAAKY,EAC7DU,EAAoB,WACpBC,EAAgBR,EAAe,KAAK,iBAAiB,OAAS,EAAI,KAAK,iBAAiB,OAAS,EACjG,EAAG,CAEC,MAAMS,EAAWH,EAAmBZ,EAEhCe,IAAaL,GAAgBK,EAAWJ,GAAeN,EAAcU,EAAW,CAAC,GAAKV,EAAcU,EAAW,CAAC,GAEhHhD,EAAgBsC,EAAcU,EAAW,CAAC,EAAI,EAC9C/C,EAAgBD,EAAgB6C,EAAmBT,EAC/CpC,EAAgB8C,GAChBJ,EAAa,eAAc,EAE/BI,EAAoB9C,EAAgB,EACpC0C,EAAa,mBAAmB1C,EAAgB,EAAGC,EAAgB,CAAC,EACpE4C,EAAoBG,EAAW,EAAKf,IAIpCjC,EAAgBsC,EAAcU,EAAW,CAAC,EAC1C/C,EAAgBD,EAAgB6C,EAAmBT,EAC/CpC,EAAgB8C,GAChBJ,EAAa,eAAc,EAE/BI,EAAoB9C,EACpB0C,EAAa,mBAAmB1C,EAAgB,EAAGC,EAAgB,CAAC,EACpE4C,EAAoBG,EAAW,EAAKf,GAEpCc,GAAgB,IAChBT,EAAgB,KAAK,iBAAiBS,CAAY,EAClDd,EAAsBK,EAAc,CAAC,EACrCK,EAAc,EACdC,EAAcN,EAAc,OAAS,EAE7C,OAAS,EAAES,GAAgB,IAG3BN,EAAiBC,EAAa,WAAU,CAC5C,CACA,OAAO,KAAK,mBAAmBF,EAAgBC,CAAc,CACjE,CAiBA,sBAAsBlE,EAAe4C,EAAa1C,EAAe2C,EAAaG,EAAgBC,EAAgBH,EAAc,CACxH,IAAIrB,EAAgB,EAAGC,EAAgB,EACnC6B,EAAuB,EAAGC,EAAqB,EAC/CG,EAAuB,EAAGC,EAAqB,EAGnD5D,IACAE,IAGA8C,EAAe,CAAC,EAAI,EACpBC,EAAe,CAAC,EAAI,EAEpB,KAAK,iBAAmB,CAAA,EACxB,KAAK,iBAAmB,CAAA,EAKxB,MAAM4B,EAAkBjC,EAAc5C,GAAkB6C,EAAc3C,GAChE4E,EAAeD,EAAiB,EAChCf,EAAgB,IAAI,WAAWgB,CAAY,EAC3Cf,EAAgB,IAAI,WAAWe,CAAY,EAG3CxB,EAAuBT,EAAc3C,EACrCwD,EAAuBd,EAAc5C,EAKrCyD,EAAyBzD,EAAgBE,EACzC2D,EAAyBjB,EAAcC,EAKvCmB,GADQN,EAAsBJ,GACP,IAAM,EAGnCQ,EAAcR,CAAmB,EAAItD,EACrC+D,EAAcL,CAAmB,EAAId,EAErCE,EAAa,CAAC,EAAI,GAQlB,QAASiC,EAAiB,EAAGA,GAAmBF,EAAiB,EAAK,EAAGE,IAAkB,CACvF,IAAIC,EAAwB,EACxBC,EAAwB,EAE5B1B,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,CAIjFA,IAAalB,GAAyBkB,EAAWjB,GAAsBM,EAAcW,EAAW,CAAC,EAAIX,EAAcW,EAAW,CAAC,EAC/HhD,EAAgBqC,EAAcW,EAAW,CAAC,EAG1ChD,EAAgBqC,EAAcW,EAAW,CAAC,EAAI,EAElD/C,EAAgBD,GAAiBgD,EAAWnB,GAAuBG,EAEnE,MAAMyB,EAAoBzD,EAG1B,KAAOA,EAAgBmB,GAAelB,EAAgBmB,GAAe,KAAK,iBAAiBpB,EAAgB,EAAGC,EAAgB,CAAC,GAC3HD,IACAC,IAWJ,GATAoC,EAAcW,CAAQ,EAAIhD,EACtBA,EAAgBC,EAAgBsD,EAAwBC,IACxDD,EAAwBvD,EACxBwD,EAAwBvD,GAMxB,CAACsC,GAAe,KAAK,IAAIS,EAAWf,CAAmB,GAAMqB,EAAiB,GAC1EtD,GAAiBsC,EAAcU,CAAQ,EAGvC,OAFAzB,EAAe,CAAC,EAAIvB,EACpBwB,EAAe,CAAC,EAAIvB,EAChBwD,GAAqBnB,EAAcU,CAAQ,GAA4DM,GAAmB,KAEnH,KAAK,UAAUzB,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAeC,EAAetC,EAAemB,EAAaI,EAAgBtB,EAAemB,EAAaI,EAAgBe,EAAalB,CAAY,EAK1U,IAIvB,CAEA,MAAMqC,GAAyBH,EAAwBhF,GAAkBiF,EAAwB/E,GAAiB6E,GAAkB,EACpI,GAAI,KAAK,8BAAgC,MAAQ,CAAC,KAAK,4BAA4BC,EAAuBG,CAAoB,EAM1H,OAJArC,EAAa,CAAC,EAAI,GAElBE,EAAe,CAAC,EAAIgC,EACpB/B,EAAe,CAAC,EAAIgC,EAChBE,EAAuB,GAA4DJ,GAAmB,KAE/F,KAAK,UAAUzB,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAeC,EAAetC,EAAemB,EAAaI,EAAgBtB,EAAemB,EAAaI,EAAgBe,EAAalB,CAAY,GAMjV9C,IACAE,IACO,CACH,IAAIH,GAAWC,EAAe4C,EAAc5C,EAAgB,EAAGE,EAAe2C,EAAc3C,EAAgB,CAAC,CACrI,GAIYyD,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,CAIjFA,IAAad,GAAyBc,EAAWb,GAAsBG,EAAcU,EAAW,CAAC,GAAKV,EAAcU,EAAW,CAAC,EAChIhD,EAAgBsC,EAAcU,EAAW,CAAC,EAAI,EAG9ChD,EAAgBsC,EAAcU,EAAW,CAAC,EAE9C/C,EAAgBD,GAAiBgD,EAAWf,GAAuBG,EAEnE,MAAMqB,EAAoBzD,EAG1B,KAAOA,EAAgBzB,GAAiB0B,EAAgBxB,GAAiB,KAAK,iBAAiBuB,EAAeC,CAAa,GACvHD,IACAC,IAMJ,GAJAqC,EAAcU,CAAQ,EAAIhD,EAItBuC,GAAe,KAAK,IAAIS,EAAWnB,CAAmB,GAAKyB,GACvDtD,GAAiBqC,EAAcW,CAAQ,EAGvC,OAFAzB,EAAe,CAAC,EAAIvB,EACpBwB,EAAe,CAAC,EAAIvB,EAChBwD,GAAqBpB,EAAcW,CAAQ,GAA4DM,GAAmB,KAEnH,KAAK,UAAUzB,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAeC,EAAetC,EAAemB,EAAaI,EAAgBtB,EAAemB,EAAaI,EAAgBe,EAAalB,CAAY,EAK1U,IAIvB,CAEA,GAAIiC,GAAkB,KAAiD,CAGnE,IAAIK,EAAO,IAAI,WAAW5B,EAAqBD,EAAuB,CAAC,EACvE6B,EAAK,CAAC,EAAI9B,EAAsBC,EAAuB,EACvDpC,GAAQ,MAAM2C,EAAeP,EAAsB6B,EAAM,EAAG5B,EAAqBD,EAAuB,CAAC,EACzG,KAAK,iBAAiB,KAAK6B,CAAI,EAC/BA,EAAO,IAAI,WAAWxB,EAAqBD,EAAuB,CAAC,EACnEyB,EAAK,CAAC,EAAI1B,EAAsBC,EAAuB,EACvDxC,GAAQ,MAAM4C,EAAeJ,EAAsByB,EAAM,EAAGxB,EAAqBD,EAAuB,CAAC,EACzG,KAAK,iBAAiB,KAAKyB,CAAI,CACnC,CACJ,CAGA,OAAO,KAAK,UAAU9B,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAqBC,EAAsBC,EAAoBC,EAAuBC,EAAeC,EAAetC,EAAemB,EAAaI,EAAgBtB,EAAemB,EAAaI,EAAgBe,EAAalB,CAAY,CACrV,CASA,gBAAgBC,EAAS,CAErB,QAAS9V,EAAI,EAAGA,EAAI8V,EAAQ,OAAQ9V,IAAK,CACrC,MAAMoY,EAAStC,EAAQ9V,CAAC,EAClBqY,EAAgBrY,EAAI8V,EAAQ,OAAS,EAAKA,EAAQ9V,EAAI,CAAC,EAAE,cAAgB,KAAK,wBAAwB,OACtGsY,EAAgBtY,EAAI8V,EAAQ,OAAS,EAAKA,EAAQ9V,EAAI,CAAC,EAAE,cAAgB,KAAK,wBAAwB,OACtGuY,EAAgBH,EAAO,eAAiB,EACxCI,EAAgBJ,EAAO,eAAiB,EAC9C,KAAOA,EAAO,cAAgBA,EAAO,eAAiBC,GAC/CD,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,IAAI,CAC1H,MAAMK,EAAmB,KAAK,uBAAuBL,EAAO,cAAeA,EAAO,aAAa,EAE/F,GADuB,KAAK,uBAAuBA,EAAO,cAAgBA,EAAO,eAAgBA,EAAO,cAAgBA,EAAO,cAAc,GACvH,CAACK,EAEnB,MAEJL,EAAO,gBACPA,EAAO,eACX,CACA,MAAMM,EAAkB,CAAC,IAAI,EAC7B,GAAI1Y,EAAI8V,EAAQ,OAAS,GAAK,KAAK,eAAeA,EAAQ9V,CAAC,EAAG8V,EAAQ9V,EAAI,CAAC,EAAG0Y,CAAe,EAAG,CAC5F5C,EAAQ9V,CAAC,EAAI0Y,EAAgB,CAAC,EAC9B5C,EAAQ,OAAO9V,EAAI,EAAG,CAAC,EACvBA,IACA,QACJ,CACJ,CAEA,QAASA,EAAI8V,EAAQ,OAAS,EAAG9V,GAAK,EAAGA,IAAK,CAC1C,MAAMoY,EAAStC,EAAQ9V,CAAC,EACxB,IAAIqY,EAAe,EACfC,EAAe,EACnB,GAAItY,EAAI,EAAG,CACP,MAAM2Y,EAAa7C,EAAQ9V,EAAI,CAAC,EAChCqY,EAAeM,EAAW,cAAgBA,EAAW,eACrDL,EAAeK,EAAW,cAAgBA,EAAW,cACzD,CACA,MAAMJ,EAAgBH,EAAO,eAAiB,EACxCI,EAAgBJ,EAAO,eAAiB,EAC9C,IAAIQ,EAAY,EACZC,EAAY,KAAK,eAAeT,EAAO,cAAeA,EAAO,eAAgBA,EAAO,cAAeA,EAAO,cAAc,EAC5H,QAASU,EAAQ,GAAIA,IAAS,CAC1B,MAAM/F,EAAgBqF,EAAO,cAAgBU,EACvC7F,EAAgBmF,EAAO,cAAgBU,EAO7C,GANI/F,EAAgBsF,GAAgBpF,EAAgBqF,GAGhDC,GAAiB,CAAC,KAAK,yBAAyBxF,EAAeA,EAAgBqF,EAAO,cAAc,GAGpGI,GAAiB,CAAC,KAAK,yBAAyBvF,EAAeA,EAAgBmF,EAAO,cAAc,EACpG,MAGJ,MAAMW,GAD0BhG,IAAkBsF,GAAgBpF,IAAkBqF,EAC3C,EAAI,GACvC,KAAK,eAAevF,EAAeqF,EAAO,eAAgBnF,EAAemF,EAAO,cAAc,EAChGW,EAAQF,IACRA,EAAYE,EACZH,EAAYE,EAEpB,CACAV,EAAO,eAAiBQ,EACxBR,EAAO,eAAiBQ,EACxB,MAAMF,EAAkB,CAAC,IAAI,EAC7B,GAAI1Y,EAAI,GAAK,KAAK,eAAe8V,EAAQ9V,EAAI,CAAC,EAAG8V,EAAQ9V,CAAC,EAAG0Y,CAAe,EAAG,CAC3E5C,EAAQ9V,EAAI,CAAC,EAAI0Y,EAAgB,CAAC,EAClC5C,EAAQ,OAAO9V,EAAG,CAAC,EACnBA,IACA,QACJ,CACJ,CAGA,GAAI,KAAK,YACL,QAASA,EAAI,EAAGmN,EAAM2I,EAAQ,OAAQ9V,EAAImN,EAAKnN,IAAK,CAChD,MAAMgZ,EAAUlD,EAAQ9V,EAAI,CAAC,EACvBiZ,EAAUnD,EAAQ9V,CAAC,EACnBkZ,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,CACrE,MAAMC,EAAI,KAAK,8BAA8BN,EAAgBE,EAAkBC,EAAgBE,EAAkBN,CAAa,EAC9H,GAAIO,EAAG,CACH,KAAM,CAACC,EAAoBC,CAAkB,EAAIF,GAC7CC,IAAuBV,EAAQ,cAAgBA,EAAQ,gBAAkBW,IAAuBX,EAAQ,cAAgBA,EAAQ,kBAEhIA,EAAQ,eAAiBU,EAAqBV,EAAQ,cACtDA,EAAQ,eAAiBW,EAAqBX,EAAQ,cACtDC,EAAQ,cAAgBS,EAAqBR,EAC7CD,EAAQ,cAAgBU,EAAqBT,EAC7CD,EAAQ,eAAiBG,EAAeH,EAAQ,cAChDA,EAAQ,eAAiBM,EAAeN,EAAQ,cAExD,CACJ,CACJ,CAEJ,OAAOnD,CACX,CACA,8BAA8B/C,EAAeC,EAAgBC,EAAeC,EAAgB0G,EAAe,CACvG,GAAI5G,EAAiB4G,GAAiB1G,EAAiB0G,EACnD,OAAO,KAEX,MAAMC,EAAc9G,EAAgBC,EAAiB4G,EAAgB,EAC/DE,EAAc7G,EAAgBC,EAAiB0G,EAAgB,EACrE,IAAIf,EAAY,EACZkB,EAAoB,EACpBC,EAAoB,EACxB,QAASha,EAAI+S,EAAe/S,EAAI6Z,EAAa7Z,IACzC,QAASia,EAAIhH,EAAegH,EAAIH,EAAaG,IAAK,CAC9C,MAAMlB,EAAQ,KAAK,yBAAyB/Y,EAAGia,EAAGL,CAAa,EAC3Db,EAAQ,GAAKA,EAAQF,IACrBA,EAAYE,EACZgB,EAAoB/Z,EACpBga,EAAoBC,EAE5B,CAEJ,OAAIpB,EAAY,EACL,CAACkB,EAAmBC,CAAiB,EAEzC,IACX,CACA,yBAAyBjH,EAAeE,EAAe7Q,EAAQ,CAC3D,IAAI2W,EAAQ,EACZ,QAAS5I,EAAI,EAAGA,EAAI/N,EAAQ+N,IAAK,CAC7B,GAAI,CAAC,KAAK,iBAAiB4C,EAAgB5C,EAAG8C,EAAgB9C,CAAC,EAC3D,MAAO,GAEX4I,GAAS,KAAK,wBAAwBhG,EAAgB5C,CAAC,EAAE,MAC7D,CACA,OAAO4I,CACX,CACA,oBAAoBnX,EAAO,CACvB,OAAIA,GAAS,GAAKA,GAAS,KAAK,wBAAwB,OAAS,EACtD,GAEH,KAAK,aAAe,QAAQ,KAAK,KAAK,wBAAwBA,CAAK,CAAC,CAChF,CACA,0BAA0BmR,EAAeC,EAAgB,CACrD,GAAI,KAAK,oBAAoBD,CAAa,GAAK,KAAK,oBAAoBA,EAAgB,CAAC,EACrF,MAAO,GAEX,GAAIC,EAAiB,EAAG,CACpB,MAAM2C,EAAc5C,EAAgBC,EACpC,GAAI,KAAK,oBAAoB2C,EAAc,CAAC,GAAK,KAAK,oBAAoBA,CAAW,EACjF,MAAO,EAEf,CACA,MAAO,EACX,CACA,oBAAoB/T,EAAO,CACvB,OAAIA,GAAS,GAAKA,GAAS,KAAK,wBAAwB,OAAS,EACtD,GAEH,KAAK,aAAe,QAAQ,KAAK,KAAK,wBAAwBA,CAAK,CAAC,CAChF,CACA,0BAA0BqR,EAAeC,EAAgB,CACrD,GAAI,KAAK,oBAAoBD,CAAa,GAAK,KAAK,oBAAoBA,EAAgB,CAAC,EACrF,MAAO,GAEX,GAAIC,EAAiB,EAAG,CACpB,MAAM0C,EAAc3C,EAAgBC,EACpC,GAAI,KAAK,oBAAoB0C,EAAc,CAAC,GAAK,KAAK,oBAAoBA,CAAW,EACjF,MAAO,EAEf,CACA,MAAO,EACX,CACA,eAAe7C,EAAeC,EAAgBC,EAAeC,EAAgB,CACzE,MAAMgH,EAAiB,KAAK,0BAA0BnH,EAAeC,CAAc,EAAI,EAAI,EACrFmH,EAAiB,KAAK,0BAA0BlH,EAAeC,CAAc,EAAI,EAAI,EAC3F,OAAQgH,EAAgBC,CAC5B,CAQA,mBAAmBC,EAAMC,EAAO,CAC5B,MAAM3B,EAAkB,CAAA,EACxB,GAAI0B,EAAK,SAAW,GAAKC,EAAM,SAAW,EACtC,OAAQA,EAAM,OAAS,EAAKA,EAAQD,EAEnC,GAAI,KAAK,eAAeA,EAAKA,EAAK,OAAS,CAAC,EAAGC,EAAM,CAAC,EAAG3B,CAAe,EAAG,CAK5E,MAAMrZ,EAAS,IAAI,MAAM+a,EAAK,OAASC,EAAM,OAAS,CAAC,EACvD,OAAAnG,GAAQ,KAAKkG,EAAM,EAAG/a,EAAQ,EAAG+a,EAAK,OAAS,CAAC,EAChD/a,EAAO+a,EAAK,OAAS,CAAC,EAAI1B,EAAgB,CAAC,EAC3CxE,GAAQ,KAAKmG,EAAO,EAAGhb,EAAQ+a,EAAK,OAAQC,EAAM,OAAS,CAAC,EACrDhb,CACX,KACK,CACD,MAAMA,EAAS,IAAI,MAAM+a,EAAK,OAASC,EAAM,MAAM,EACnD,OAAAnG,GAAQ,KAAKkG,EAAM,EAAG/a,EAAQ,EAAG+a,EAAK,MAAM,EAC5ClG,GAAQ,KAAKmG,EAAO,EAAGhb,EAAQ+a,EAAK,OAAQC,EAAM,MAAM,EACjDhb,CACX,CACJ,CASA,eAAe+a,EAAMC,EAAO3B,EAAiB,CAGzC,GAFAzE,GAAM,OAAOmG,EAAK,eAAiBC,EAAM,cAAe,uDAAuD,EAC/GpG,GAAM,OAAOmG,EAAK,eAAiBC,EAAM,cAAe,uDAAuD,EAC3GD,EAAK,cAAgBA,EAAK,gBAAkBC,EAAM,eAAiBD,EAAK,cAAgBA,EAAK,gBAAkBC,EAAM,cAAe,CACpI,MAAMtH,EAAgBqH,EAAK,cAC3B,IAAIpH,EAAiBoH,EAAK,eAC1B,MAAMnH,EAAgBmH,EAAK,cAC3B,IAAIlH,EAAiBkH,EAAK,eAC1B,OAAIA,EAAK,cAAgBA,EAAK,gBAAkBC,EAAM,gBAClDrH,EAAiBqH,EAAM,cAAgBA,EAAM,eAAiBD,EAAK,eAEnEA,EAAK,cAAgBA,EAAK,gBAAkBC,EAAM,gBAClDnH,EAAiBmH,EAAM,cAAgBA,EAAM,eAAiBD,EAAK,eAEvE1B,EAAgB,CAAC,EAAI,IAAI5F,GAAWC,EAAeC,EAAgBC,EAAeC,CAAc,EACzF,EACX,KAEI,QAAAwF,EAAgB,CAAC,EAAI,KACd,EAEf,CAaA,kBAAkBlB,EAAUM,EAAgBwC,EAAmBzC,EAAc,CACzE,GAAIL,GAAY,GAAKA,EAAWK,EAE5B,OAAOL,EAIX,MAAM+C,EAAiBD,EACjBE,EAAiB3C,EAAeyC,EAAoB,EACpDG,EAAY3C,EAAiB,IAAM,EACzC,GAAIN,EAAW,EAAG,CACd,MAAMkD,EAAkBH,EAAiB,IAAM,EAC/C,OAAQE,IAAaC,EAAkB,EAAI,CAC/C,KACK,CACD,MAAMC,EAAkBH,EAAiB,IAAM,EAC/C,OAAQC,IAAaE,EAAkB9C,EAAe,EAAIA,EAAe,CAC7E,CACJ,CACJ,CC53BA,IAAA+C,EAAA,MAAMC,EAAS,CACX,YAAYC,EAAYC,EAAQ,CAC5B,KAAK,WAAaD,EAClB,KAAK,OAASC,CAClB,CAOA,KAAKC,EAAgB,KAAK,WAAYC,EAAY,KAAK,OAAQ,CAC3D,OAAID,IAAkB,KAAK,YAAcC,IAAc,KAAK,OACjD,KAGA,IAAIJ,GAASG,EAAeC,CAAS,CAEpD,CAOA,MAAMC,EAAkB,EAAGC,EAAc,EAAG,CACxC,OAAO,KAAK,KAAK,KAAK,IAAI,EAAG,KAAK,WAAaD,CAAe,EAAG,KAAK,IAAI,EAAG,KAAK,OAASC,CAAW,CAAC,CAC3G,CAIA,OAAOC,EAAO,CACV,OAAOP,GAAS,OAAO,KAAMO,CAAK,CACtC,CAIA,OAAO,OAAOnb,EAAGC,EAAG,CAChB,MAAI,CAACD,GAAK,CAACC,EACA,GAEH,CAAC,CAACD,GACN,CAAC,CAACC,GACFD,EAAE,aAAeC,EAAE,YACnBD,EAAE,SAAWC,EAAE,MACvB,CAKA,SAASkb,EAAO,CACZ,OAAOP,GAAS,SAAS,KAAMO,CAAK,CACxC,CAKA,OAAO,SAASnb,EAAGC,EAAG,CAClB,OAAID,EAAE,WAAaC,EAAE,WACV,GAEPA,EAAE,WAAaD,EAAE,WACV,GAEJA,EAAE,OAASC,EAAE,MACxB,CAKA,gBAAgBkb,EAAO,CACnB,OAAOP,GAAS,gBAAgB,KAAMO,CAAK,CAC/C,CAKA,OAAO,gBAAgBnb,EAAGC,EAAG,CACzB,OAAID,EAAE,WAAaC,EAAE,WACV,GAEPA,EAAE,WAAaD,EAAE,WACV,GAEJA,EAAE,QAAUC,EAAE,MACzB,CAIA,OAAO,QAAQD,EAAGC,EAAG,CACjB,MAAMmb,EAAcpb,EAAE,WAAa,EAC7Bqb,EAAcpb,EAAE,WAAa,EACnC,GAAImb,IAAgBC,EAAa,CAC7B,MAAMC,EAAUtb,EAAE,OAAS,EACrBub,EAAUtb,EAAE,OAAS,EAC3B,OAAOqb,EAAUC,CACrB,CACA,OAAOH,EAAcC,CACzB,CAIA,OAAQ,CACJ,OAAO,IAAIT,GAAS,KAAK,WAAY,KAAK,MAAM,CACpD,CAIA,UAAW,CACP,MAAO,IAAM,KAAK,WAAa,IAAM,KAAK,OAAS,GACvD,CAKA,OAAO,KAAKY,EAAK,CACb,OAAO,IAAIZ,GAASY,EAAI,WAAYA,EAAI,MAAM,CAClD,CAIA,OAAO,YAAYnb,EAAK,CACpB,MAAQ,CAAC,CAACA,GACF,OAAOA,EAAI,YAAe,UAC1B,OAAOA,EAAI,QAAW,QAClC,CACA,QAAS,CACL,MAAO,CACH,WAAY,KAAK,WACjB,OAAQ,KAAK,MACzB,CACI,CACJ,EClIAob,EAAA,MAAMC,EAAM,CACR,YAAYC,EAAiBC,EAAaC,EAAeC,EAAW,CAC3DH,EAAkBE,GAAmBF,IAAoBE,GAAiBD,EAAcE,GACzF,KAAK,gBAAkBD,EACvB,KAAK,YAAcC,EACnB,KAAK,cAAgBH,EACrB,KAAK,UAAYC,IAGjB,KAAK,gBAAkBD,EACvB,KAAK,YAAcC,EACnB,KAAK,cAAgBC,EACrB,KAAK,UAAYC,EAEzB,CAIA,SAAU,CACN,OAAOJ,GAAM,QAAQ,IAAI,CAC7B,CAIA,OAAO,QAAQK,EAAO,CAClB,OAAQA,EAAM,kBAAoBA,EAAM,eAAiBA,EAAM,cAAgBA,EAAM,SACzF,CAIA,iBAAiBC,EAAU,CACvB,OAAON,GAAM,iBAAiB,KAAMM,CAAQ,CAChD,CAIA,OAAO,iBAAiBD,EAAOC,EAAU,CAOrC,MANI,EAAAA,EAAS,WAAaD,EAAM,iBAAmBC,EAAS,WAAaD,EAAM,eAG3EC,EAAS,aAAeD,EAAM,iBAAmBC,EAAS,OAASD,EAAM,aAGzEC,EAAS,aAAeD,EAAM,eAAiBC,EAAS,OAASD,EAAM,UAI/E,CAKA,OAAO,uBAAuBA,EAAOC,EAAU,CAO3C,MANI,EAAAA,EAAS,WAAaD,EAAM,iBAAmBC,EAAS,WAAaD,EAAM,eAG3EC,EAAS,aAAeD,EAAM,iBAAmBC,EAAS,QAAUD,EAAM,aAG1EC,EAAS,aAAeD,EAAM,eAAiBC,EAAS,QAAUD,EAAM,UAIhF,CAIA,cAAcA,EAAO,CACjB,OAAOL,GAAM,cAAc,KAAMK,CAAK,CAC1C,CAIA,OAAO,cAAcA,EAAOE,EAAY,CAUpC,MATI,EAAAA,EAAW,gBAAkBF,EAAM,iBAAmBE,EAAW,cAAgBF,EAAM,iBAGvFE,EAAW,gBAAkBF,EAAM,eAAiBE,EAAW,cAAgBF,EAAM,eAGrFE,EAAW,kBAAoBF,EAAM,iBAAmBE,EAAW,YAAcF,EAAM,aAGvFE,EAAW,gBAAkBF,EAAM,eAAiBE,EAAW,UAAYF,EAAM,UAIzF,CAIA,oBAAoBA,EAAO,CACvB,OAAOL,GAAM,oBAAoB,KAAMK,CAAK,CAChD,CAIA,OAAO,oBAAoBA,EAAOE,EAAY,CAU1C,MATI,EAAAA,EAAW,gBAAkBF,EAAM,iBAAmBE,EAAW,cAAgBF,EAAM,iBAGvFE,EAAW,gBAAkBF,EAAM,eAAiBE,EAAW,cAAgBF,EAAM,eAGrFE,EAAW,kBAAoBF,EAAM,iBAAmBE,EAAW,aAAeF,EAAM,aAGxFE,EAAW,gBAAkBF,EAAM,eAAiBE,EAAW,WAAaF,EAAM,UAI1F,CAKA,UAAUA,EAAO,CACb,OAAOL,GAAM,UAAU,KAAMK,CAAK,CACtC,CAKA,OAAO,UAAU/b,EAAGC,EAAG,CACnB,IAAI0b,EACAC,EACAC,EACAC,EACJ,OAAI7b,EAAE,gBAAkBD,EAAE,iBACtB2b,EAAkB1b,EAAE,gBACpB2b,EAAc3b,EAAE,aAEXA,EAAE,kBAAoBD,EAAE,iBAC7B2b,EAAkB1b,EAAE,gBACpB2b,EAAc,KAAK,IAAI3b,EAAE,YAAaD,EAAE,WAAW,IAGnD2b,EAAkB3b,EAAE,gBACpB4b,EAAc5b,EAAE,aAEhBC,EAAE,cAAgBD,EAAE,eACpB6b,EAAgB5b,EAAE,cAClB6b,EAAY7b,EAAE,WAETA,EAAE,gBAAkBD,EAAE,eAC3B6b,EAAgB5b,EAAE,cAClB6b,EAAY,KAAK,IAAI7b,EAAE,UAAWD,EAAE,SAAS,IAG7C6b,EAAgB7b,EAAE,cAClB8b,EAAY9b,EAAE,WAEX,IAAI0b,GAAMC,EAAiBC,EAAaC,EAAeC,CAAS,CAC3E,CAIA,gBAAgBC,EAAO,CACnB,OAAOL,GAAM,gBAAgB,KAAMK,CAAK,CAC5C,CAIA,OAAO,gBAAgB/b,EAAGC,EAAG,CACzB,IAAIic,EAAwBlc,EAAE,gBAC1Bmc,EAAoBnc,EAAE,YACtBoc,EAAsBpc,EAAE,cACxBqc,EAAkBrc,EAAE,UACxB,MAAMsc,EAAuBrc,EAAE,gBACzBsc,EAAmBtc,EAAE,YACrBuc,EAAqBvc,EAAE,cACvBwc,EAAiBxc,EAAE,UAmBzB,OAlBIic,EAAwBI,GACxBJ,EAAwBI,EACxBH,EAAoBI,GAEfL,IAA0BI,IAC/BH,EAAoB,KAAK,IAAIA,EAAmBI,CAAgB,GAEhEH,EAAsBI,GACtBJ,EAAsBI,EACtBH,EAAkBI,GAEbL,IAAwBI,IAC7BH,EAAkB,KAAK,IAAIA,EAAiBI,CAAc,GAG1DP,EAAwBE,GAGxBF,IAA0BE,GAAuBD,EAAoBE,EAC9D,KAEJ,IAAIX,GAAMQ,EAAuBC,EAAmBC,EAAqBC,CAAe,CACnG,CAIA,YAAYlB,EAAO,CACf,OAAOO,GAAM,YAAY,KAAMP,CAAK,CACxC,CAIA,OAAO,YAAYnb,EAAGC,EAAG,CACrB,MAAI,CAACD,GAAK,CAACC,EACA,GAEH,CAAC,CAACD,GACN,CAAC,CAACC,GACFD,EAAE,kBAAoBC,EAAE,iBACxBD,EAAE,cAAgBC,EAAE,aACpBD,EAAE,gBAAkBC,EAAE,eACtBD,EAAE,YAAcC,EAAE,SAC1B,CAIA,gBAAiB,CACb,OAAOyb,GAAM,eAAe,IAAI,CACpC,CAIA,OAAO,eAAeK,EAAO,CACzB,OAAO,IAAInB,EAASmB,EAAM,cAAeA,EAAM,SAAS,CAC5D,CAIA,kBAAmB,CACf,OAAOL,GAAM,iBAAiB,IAAI,CACtC,CAIA,OAAO,iBAAiBK,EAAO,CAC3B,OAAO,IAAInB,EAASmB,EAAM,gBAAiBA,EAAM,WAAW,CAChE,CAIA,UAAW,CACP,MAAO,IAAM,KAAK,gBAAkB,IAAM,KAAK,YAAc,OAAS,KAAK,cAAgB,IAAM,KAAK,UAAY,GACtH,CAIA,eAAeF,EAAeC,EAAW,CACrC,OAAO,IAAIJ,GAAM,KAAK,gBAAiB,KAAK,YAAaG,EAAeC,CAAS,CACrF,CAIA,iBAAiBH,EAAiBC,EAAa,CAC3C,OAAO,IAAIF,GAAMC,EAAiBC,EAAa,KAAK,cAAe,KAAK,SAAS,CACrF,CAIA,iBAAkB,CACd,OAAOF,GAAM,gBAAgB,IAAI,CACrC,CAIA,OAAO,gBAAgBK,EAAO,CAC1B,OAAO,IAAIL,GAAMK,EAAM,gBAAiBA,EAAM,YAAaA,EAAM,gBAAiBA,EAAM,WAAW,CACvG,CAIA,eAAgB,CACZ,OAAOL,GAAM,cAAc,IAAI,CACnC,CAIA,OAAO,cAAcK,EAAO,CACxB,OAAO,IAAIL,GAAMK,EAAM,cAAeA,EAAM,UAAWA,EAAM,cAAeA,EAAM,SAAS,CAC/F,CAIA,MAAMW,EAAW,CACb,OAAO,IAAIhB,GAAM,KAAK,gBAAkBgB,EAAW,KAAK,YAAa,KAAK,cAAgBA,EAAW,KAAK,SAAS,CACvH,CACA,cAAe,CACX,OAAO,KAAK,kBAAoB,KAAK,aACzC,CAEA,OAAO,cAAcC,EAAOvR,EAAMuR,EAAO,CACrC,OAAO,IAAIjB,GAAMiB,EAAM,WAAYA,EAAM,OAAQvR,EAAI,WAAYA,EAAI,MAAM,CAC/E,CACA,OAAO,KAAK2Q,EAAO,CACf,OAAKA,EAGE,IAAIL,GAAMK,EAAM,gBAAiBA,EAAM,YAAaA,EAAM,cAAeA,EAAM,SAAS,EAFpF,IAGf,CAIA,OAAO,SAAS1b,EAAK,CACjB,MAAQ,CAAC,CAACA,GACF,OAAOA,EAAI,iBAAoB,UAC/B,OAAOA,EAAI,aAAgB,UAC3B,OAAOA,EAAI,eAAkB,UAC7B,OAAOA,EAAI,WAAc,QACrC,CAIA,OAAO,0BAA0BL,EAAGC,EAAG,CAMnC,MAJI,EAAAD,EAAE,cAAgBC,EAAE,iBAAoBD,EAAE,gBAAkBC,EAAE,iBAAmBD,EAAE,UAAYC,EAAE,aAIjGA,EAAE,cAAgBD,EAAE,iBAAoBC,EAAE,gBAAkBD,EAAE,iBAAmBC,EAAE,UAAYD,EAAE,YAKzG,CAIA,OAAO,gBAAgBA,EAAGC,EAAG,CAMzB,MAJI,EAAAD,EAAE,cAAgBC,EAAE,iBAAoBD,EAAE,gBAAkBC,EAAE,iBAAmBD,EAAE,WAAaC,EAAE,aAIlGA,EAAE,cAAgBD,EAAE,iBAAoBC,EAAE,gBAAkBD,EAAE,iBAAmBC,EAAE,WAAaD,EAAE,YAK1G,CAIA,OAAO,oBAAoBA,EAAGC,EAAG,CAM7B,MAJI,EAAAD,EAAE,cAAiBC,EAAE,gBAAkB,GAAOD,EAAE,gBAAkBC,EAAE,iBAAmBD,EAAE,UAAaC,EAAE,YAAc,GAItHA,EAAE,cAAiBD,EAAE,gBAAkB,GAAOC,EAAE,gBAAkBD,EAAE,iBAAmBC,EAAE,UAAaD,EAAE,YAAc,EAK9H,CAKA,OAAO,yBAAyBA,EAAGC,EAAG,CAClC,GAAID,GAAKC,EAAG,CACR,MAAM2c,EAAmB5c,EAAE,gBAAkB,EACvC6c,EAAmB5c,EAAE,gBAAkB,EAC7C,GAAI2c,IAAqBC,EAAkB,CACvC,MAAMC,EAAe9c,EAAE,YAAc,EAC/B+c,EAAe9c,EAAE,YAAc,EACrC,GAAI6c,IAAiBC,EAAc,CAC/B,MAAMC,EAAiBhd,EAAE,cAAgB,EACnCid,EAAiBhd,EAAE,cAAgB,EACzC,GAAI+c,IAAmBC,EAAgB,CACnC,MAAMC,EAAald,EAAE,UAAY,EAC3Bmd,EAAald,EAAE,UAAY,EACjC,OAAOid,EAAaC,CACxB,CACA,OAAOH,EAAiBC,CAC5B,CACA,OAAOH,EAAeC,CAC1B,CACA,OAAOH,EAAmBC,CAC9B,CAGA,OAFiB7c,EAAI,EAAI,IACRC,EAAI,EAAI,EAE7B,CAKA,OAAO,uBAAuBD,EAAGC,EAAG,CAChC,OAAID,EAAE,gBAAkBC,EAAE,cAClBD,EAAE,YAAcC,EAAE,UACdD,EAAE,kBAAoBC,EAAE,gBACjBD,EAAE,YAAcC,EAAE,YAEtBD,EAAE,gBAAkBC,EAAE,gBAE1BD,EAAE,UAAYC,EAAE,UAEpBD,EAAE,cAAgBC,EAAE,aAC/B,CAIA,OAAO,mBAAmB8b,EAAO,CAC7B,OAAOA,EAAM,cAAgBA,EAAM,eACvC,CACA,QAAS,CACL,OAAO,IACX,CACJ,EC9ZA,SAASqB,GAAQnV,EAAG,CAChB,OAAIA,EAAI,EACG,EAEPA,EAAI,IACG,IAEJA,EAAI,CACf,CACA,SAASoV,GAASpV,EAAG,CACjB,OAAIA,EAAI,EACG,EAEPA,EAAI,WACG,WAEJA,EAAI,CACf,CCZA,MAAMqV,EAAoB,CACtB,YAAYC,EAAe,CACvB,MAAMC,EAAeJ,GAAQG,CAAa,EAC1C,KAAK,cAAgBC,EACrB,KAAK,UAAYF,GAAoB,gBAAgBE,CAAY,EACjE,KAAK,KAAO,IAAI,GACpB,CACA,OAAO,gBAAgBA,EAAc,CACjC,MAAMC,EAAW,IAAI,WAAW,GAAG,EACnC,OAAAA,EAAS,KAAKD,CAAY,EACnBC,CACX,CACA,IAAI3O,EAAU4O,EAAQ,CAClB,MAAMne,EAAQ6d,GAAQM,CAAM,EACxB5O,GAAY,GAAKA,EAAW,IAC5B,KAAK,UAAUA,CAAQ,EAAIvP,EAG3B,KAAK,KAAK,IAAIuP,EAAUvP,CAAK,CAErC,CACA,IAAIuP,EAAU,CACV,OAAIA,GAAY,GAAKA,EAAW,IACrB,KAAK,UAAUA,CAAQ,EAGtB,KAAK,KAAK,IAAIA,CAAQ,GAAK,KAAK,aAEhD,CACA,OAAQ,CACJ,KAAK,UAAU,KAAK,KAAK,aAAa,EACtC,KAAK,KAAK,MAAK,CACnB,CACJ,CCpCA,MAAM6O,EAAY,CACd,YAAYC,EAAMC,EAAML,EAAc,CAClC,MAAM5R,EAAO,IAAI,WAAWgS,EAAOC,CAAI,EACvC,QAAS9d,EAAI,EAAGmN,EAAM0Q,EAAOC,EAAM9d,EAAImN,EAAKnN,IACxC6L,EAAK7L,CAAC,EAAIyd,EAEd,KAAK,MAAQ5R,EACb,KAAK,KAAOgS,EACZ,KAAK,KAAOC,CAChB,CACA,IAAIC,EAAKC,EAAK,CACV,OAAO,KAAK,MAAMD,EAAM,KAAK,KAAOC,CAAG,CAC3C,CACA,IAAID,EAAKC,EAAKxe,EAAO,CACjB,KAAK,MAAMue,EAAM,KAAK,KAAOC,CAAG,EAAIxe,CACxC,CACJ,CACA,MAAMye,EAAa,CACf,YAAYC,EAAO,CACf,IAAIC,EAAc,EACdC,EAAW,EACf,QAASpe,EAAI,EAAGmN,EAAM+Q,EAAM,OAAQle,EAAImN,EAAKnN,IAAK,CAC9C,KAAM,CAACgB,EAAMqN,EAAQ5L,CAAE,EAAIyb,EAAMle,CAAC,EAC9BqO,EAAS8P,IACTA,EAAc9P,GAEdrN,EAAOod,IACPA,EAAWpd,GAEXyB,EAAK2b,IACLA,EAAW3b,EAEnB,CACA0b,IACAC,IACA,MAAMC,EAAS,IAAIT,GAAYQ,EAAUD,EAAa,CAAC,EACvD,QAASne,EAAI,EAAGmN,EAAM+Q,EAAM,OAAQle,EAAImN,EAAKnN,IAAK,CAC9C,KAAM,CAACgB,EAAMqN,EAAQ5L,CAAE,EAAIyb,EAAMle,CAAC,EAClCqe,EAAO,IAAIrd,EAAMqN,EAAQ5L,CAAE,CAC/B,CACA,KAAK,QAAU4b,EACf,KAAK,aAAeF,CACxB,CACA,UAAUG,EAAcjQ,EAAQ,CAC5B,OAAIA,EAAS,GAAKA,GAAU,KAAK,aACtB,EAEJ,KAAK,QAAQ,IAAIiQ,EAAcjQ,CAAM,CAChD,CACJ,CAEA,IAAIkQ,GAAgB,KACpB,SAASC,IAAkB,CACvB,OAAID,KAAkB,OAClBA,GAAgB,IAAIN,GAAa,CAC7B,CAAC,EAAqB,IAAsB,CAAC,EAC7C,CAAC,EAAqB,GAAqB,CAAC,EAC5C,CAAC,EAAqB,IAAsB,CAAC,EAC7C,CAAC,EAAqB,GAAqB,CAAC,EAC5C,CAAC,EAAiB,IAAsB,CAAC,EACzC,CAAC,EAAiB,GAAqB,CAAC,EACxC,CAAC,EAAkB,IAAsB,CAAC,EAC1C,CAAC,EAAkB,GAAqB,CAAC,EACzC,CAAC,EAAmB,IAAsB,CAAC,EAC3C,CAAC,EAAmB,GAAqB,CAAC,EAC1C,CAAC,EAAoB,IAAsB,CAAC,EAC5C,CAAC,EAAoB,GAAqB,CAAC,EAC3C,CAAC,EAAoB,GAAyB,EAAE,EAChD,CAAC,EAAiB,IAAsB,CAAC,EACzC,CAAC,EAAiB,GAAqB,CAAC,EACxC,CAAC,EAAkB,IAAsB,CAAC,EAC1C,CAAC,EAAkB,GAAqB,CAAC,EACzC,CAAC,EAAmB,IAAsB,CAAC,EAC3C,CAAC,EAAmB,GAAqB,CAAC,EAC1C,CAAC,EAA2B,GAAyB,EAAE,EACvD,CAAC,GAA2B,GAAyB,EAAE,EACvD,CAAC,GAA4B,GAAyB,EAAE,CACpE,CAAS,GAEEM,EACX,CACA,IAAIE,GAAc,KAClB,SAASC,IAAgB,CACrB,GAAID,KAAgB,KAAM,CACtBA,GAAc,IAAIlB,GAAoB,CAAC,EAEvC,MAAMoB,EAA+B,uCACrC,QAAS3e,EAAI,EAAGA,EAAI2e,EAA6B,OAAQ3e,IACrDye,GAAY,IAAIE,EAA6B,WAAW3e,CAAC,EAAG,CAAC,EAEjE,MAAM4e,EAA6B,OACnC,QAAS5e,EAAI,EAAGA,EAAI4e,EAA2B,OAAQ5e,IACnDye,GAAY,IAAIG,EAA2B,WAAW5e,CAAC,EAAG,CAAC,CAEnE,CACA,OAAOye,EACX,CACA,MAAMI,EAAa,CACf,OAAO,YAAYC,EAAYC,EAAMjE,EAAYkE,EAAgBC,EAAc,CAE3E,IAAIC,EAAwBD,EAAe,EAC3C,EAAG,CACC,MAAM5Q,EAAS0Q,EAAK,WAAWG,CAAqB,EAEpD,GADgBJ,EAAW,IAAIzQ,CAAM,IACrB,EACZ,MAEJ6Q,GACJ,OAASA,EAAwBF,GAEjC,GAAIA,EAAiB,EAAG,CACpB,MAAMG,EAAqBJ,EAAK,WAAWC,EAAiB,CAAC,EACvDI,EAAqBL,EAAK,WAAWG,CAAqB,GAC3DC,IAAuB,IAA+BC,IAAuB,IAC1ED,IAAuB,IAAuCC,IAAuB,IACrFD,IAAuB,KAAqCC,IAAuB,MAIvFF,GAER,CACA,MAAO,CACH,MAAO,CACH,gBAAiBpE,EACjB,YAAakE,EAAiB,EAC9B,cAAelE,EACf,UAAWoE,EAAwB,CACnD,EACY,IAAKH,EAAK,UAAUC,EAAgBE,EAAwB,CAAC,CACzE,CACI,CACA,OAAO,aAAaG,EAAOC,EAAed,GAAe,EAAI,CACzD,MAAMM,EAAaJ,GAAa,EAC1Brf,EAAS,CAAA,EACf,QAASW,EAAI,EAAG2c,EAAY0C,EAAM,aAAY,EAAIrf,GAAK2c,EAAW3c,IAAK,CACnE,MAAM+e,EAAOM,EAAM,eAAerf,CAAC,EAC7BmN,EAAM4R,EAAK,OACjB,IAAI9E,EAAI,EACJ+E,EAAiB,EACjBO,EAAkB,EAClBC,EAAQ,EACRC,EAAgB,GAChBC,EAAuB,GACvBC,EAAmB,GACnBC,EAAsB,GAC1B,KAAO3F,EAAI9M,GAAK,CACZ,IAAI0S,EAAoB,GACxB,MAAMxR,EAAS0Q,EAAK,WAAW9E,CAAC,EAChC,GAAIuF,IAAU,GAAuB,CACjC,IAAIM,EACJ,OAAQzR,EAAM,CACV,IAAK,IACDoR,EAAgB,GAChBK,EAAU,EACV,MACJ,IAAK,IACDA,EAAWL,EAAgB,EAA8B,EACzD,MACJ,IAAK,IACDE,EAAmB,GACnBD,EAAuB,GACvBI,EAAU,EACV,MACJ,IAAK,IACDH,EAAmB,GACnBG,EAAWJ,EAAuB,EAA8B,EAChE,MACJ,IAAK,KACDE,EAAsB,GACtBE,EAAU,EACV,MACJ,IAAK,KACDA,EAAWF,EAAsB,EAA8B,EAC/D,MAGJ,IAAK,IACL,IAAK,IACL,IAAK,IACGL,IAAoBlR,EACpByR,EAAU,EAELP,IAAoB,IAAiCA,IAAoB,IAAiCA,IAAoB,GACnIO,EAAU,EAGVA,EAAU,EAEd,MACJ,IAAK,IAEDA,EAAWP,IAAoB,GAA8B,EAA0C,EACvG,MACJ,IAAK,IAEDO,EAAWH,EAAmB,EAA8B,EAC5D,MACJ,QACIG,EAAUhB,EAAW,IAAIzQ,CAAM,CAC3D,CAEwByR,IAAY,IACZzgB,EAAO,KAAKwf,GAAa,YAAYC,EAAYC,EAAM/e,EAAGgf,EAAgB/E,CAAC,CAAC,EAC5E4F,EAAoB,GAE5B,SACSL,IAAU,GAAoB,CACnC,IAAIM,EACAzR,IAAW,IAEXqR,EAAuB,GACvBI,EAAU,GAGVA,EAAUhB,EAAW,IAAIzQ,CAAM,EAG/ByR,IAAY,EACZD,EAAoB,GAGpBL,EAAQ,EAEhB,MAEIA,EAAQF,EAAa,UAAUE,EAAOnR,CAAM,EACxCmR,IAAU,IACVK,EAAoB,IAGxBA,IACAL,EAAQ,EACRC,EAAgB,GAChBC,EAAuB,GACvBE,EAAsB,GAEtBZ,EAAiB/E,EAAI,EACrBsF,EAAkBlR,GAEtB4L,GACJ,CACIuF,IAAU,IACVngB,EAAO,KAAKwf,GAAa,YAAYC,EAAYC,EAAM/e,EAAGgf,EAAgB7R,CAAG,CAAC,CAEtF,CACA,OAAO9N,CACX,CACJ,CAMA,SAAS0gB,GAAaV,EAAO,CACzB,MAAI,CAACA,GAAS,OAAOA,EAAM,cAAiB,YAAc,OAAOA,EAAM,gBAAmB,WAE/E,CAAA,EAEJR,GAAa,aAAaQ,CAAK,CAC1C,CCtQA,MAAMW,GAAN,MAAMA,EAAoB,CACtB,aAAc,CACV,KAAK,iBAAmB,CACpB,CAAC,OAAQ,OAAO,EAChB,CAAC,OAAQ,OAAO,EAChB,CAAC,UAAW,SAAU,SAAU,WAAY,UAAW,YAAa,WAAW,EAC/E,CAAC,SAAU,YAAa,SAAS,CAC7C,CACI,CAEA,iBAAiBC,EAAQC,EAAOC,EAAQC,EAAOC,EAAI,CAC/C,GAAIJ,GAAUC,EAAO,CACjB,MAAM7gB,EAAS,KAAK,mBAAmB6gB,EAAOG,CAAE,EAChD,GAAIhhB,EACA,MAAO,CACH,MAAO4gB,EACP,MAAO5gB,CAC3B,CAEQ,CACA,GAAI8gB,GAAUC,EAAO,CACjB,MAAM/gB,EAAS,KAAK,mBAAmB+gB,EAAOC,CAAE,EAChD,GAAIhhB,EACA,MAAO,CACH,MAAO8gB,EACP,MAAO9gB,CAC3B,CAEQ,CACA,OAAO,IACX,CACA,mBAAmBihB,EAAMD,EAAI,CACzB,MAAME,EAAe,KAAK,cAAcD,EAAMD,CAAE,EAChD,OAAIE,IAAiB,KACVA,EAEJ,KAAK,YAAYD,EAAMD,CAAE,CACpC,CACA,cAAc7gB,EAAO6gB,EAAI,CACrB,MAAMG,EAAY,KAAK,IAAI,GAAIhhB,EAAM,QAAUA,EAAM,YAAY,GAAG,EAAI,EAAE,EAC1E,IAAIihB,EAAK,OAAOjhB,CAAK,EACrB,MAAMkhB,EAAK,WAAWlhB,CAAK,EAC3B,MAAI,CAAC,MAAMihB,CAAE,GAAK,CAAC,MAAMC,CAAE,GAAKD,IAAOC,EAC/BD,IAAO,GAAK,CAACJ,EACN,MAKPI,EAAK,KAAK,MAAMA,EAAKD,CAAS,EAC9BC,GAAMJ,EAAKG,EAAY,CAACA,EACjB,OAAOC,EAAKD,CAAS,GAG7B,IACX,CACA,YAAYhhB,EAAO6gB,EAAI,CACnB,OAAO,KAAK,iBAAiB,KAAK,iBAAkB7gB,EAAO6gB,CAAE,CACjE,CACA,iBAAiBM,EAAWnhB,EAAO6gB,EAAI,CACnC,IAAIhhB,EAAS,KACb,QAASW,EAAI,EAAGmN,EAAMwT,EAAU,OAAQthB,IAAW,MAAQW,EAAImN,EAAKnN,IAChEX,EAAS,KAAK,gBAAgBshB,EAAU3gB,CAAC,EAAGR,EAAO6gB,CAAE,EAEzD,OAAOhhB,CACX,CACA,gBAAgBuhB,EAAUphB,EAAO6gB,EAAI,CACjC,IAAIQ,EAAMD,EAAS,QAAQphB,CAAK,EAChC,OAAIqhB,GAAO,GACPA,GAAOR,EAAK,EAAI,GACZQ,EAAM,EACNA,EAAMD,EAAS,OAAS,EAGxBC,GAAOD,EAAS,OAEbA,EAASC,CAAG,GAEhB,IACX,CACJ,EAvEab,GAAK,SAAW,IAAIA,GATjC,IAAMc,GAANd,GCEA,MAAMe,GAAgB,OAAO,OAAO,SAAUnW,EAAUoW,EAAS,CAC7D,MAAMra,EAAS,WAAWiE,EAAS,KAAKoW,CAAO,EAAG,CAAC,EACnD,MAAO,CAAE,SAAU,CAAE,aAAara,CAAM,CAAG,CAAC,CAChD,CAAC,EACD,IAAIsa,IACH,SAAUA,EAAmB,CAC1B,SAASC,EAAoBzgB,EAAO,CAIhC,OAHIA,IAAUwgB,EAAkB,MAAQxgB,IAAUwgB,EAAkB,WAGhExgB,aAAiB0gB,GACV,GAEP,CAAC1gB,GAAS,OAAOA,GAAU,SACpB,GAEJ,OAAOA,EAAM,yBAA4B,WACzC,OAAOA,EAAM,yBAA4B,UACpD,CACAwgB,EAAkB,oBAAsBC,EACxCD,EAAkB,KAAO,OAAO,OAAO,CACnC,wBAAyB,GACzB,wBAAyBlc,GAAM,IACvC,CAAK,EACDkc,EAAkB,UAAY,OAAO,OAAO,CACxC,wBAAyB,GACzB,wBAAyBF,EACjC,CAAK,CACL,GAAGE,KAAsBA,GAAoB,CAAA,EAAG,EAChD,MAAME,EAAa,CACf,aAAc,CACV,KAAK,aAAe,GACpB,KAAK,SAAW,IACpB,CACA,QAAS,CACA,KAAK,eACN,KAAK,aAAe,GAChB,KAAK,WACL,KAAK,SAAS,KAAK,MAAS,EAC5B,KAAK,QAAO,GAGxB,CACA,IAAI,yBAA0B,CAC1B,OAAO,KAAK,YAChB,CACA,IAAI,yBAA0B,CAC1B,OAAI,KAAK,aACEJ,IAEN,KAAK,WACN,KAAK,SAAW,IAAI3a,IAEjB,KAAK,SAAS,MACzB,CACA,SAAU,CACF,KAAK,WACL,KAAK,SAAS,QAAO,EACrB,KAAK,SAAW,KAExB,CACJ,CACA,MAAMgb,EAAwB,CAC1B,YAAYje,EAAQ,CAChB,KAAK,OAAS,OACd,KAAK,gBAAkB,OACvB,KAAK,gBAAkBA,GAAUA,EAAO,wBAAwB,KAAK,OAAQ,IAAI,CACrF,CACA,IAAI,OAAQ,CACR,OAAK,KAAK,SAGN,KAAK,OAAS,IAAIge,IAEf,KAAK,MAChB,CACA,QAAS,CACA,KAAK,OAMD,KAAK,kBAAkBA,IAE5B,KAAK,OAAO,OAAM,EAJlB,KAAK,OAASF,GAAkB,SAMxC,CACA,QAAQI,EAAS,GAAO,CAChBA,GACA,KAAK,OAAM,EAEf,KAAK,iBAAiB,QAAO,EACxB,KAAK,OAID,KAAK,kBAAkBF,IAE5B,KAAK,OAAO,QAAO,EAJnB,KAAK,OAASF,GAAkB,IAMxC,CACJ,CCxGA,MAAMK,EAAc,CAChB,aAAc,CACV,KAAK,cAAgB,CAAA,EACrB,KAAK,cAAgB,OAAO,OAAO,IAAI,CAC3C,CACA,OAAOC,EAASnhB,EAAK,CACjB,KAAK,cAAcmhB,CAAO,EAAInhB,EAC9B,KAAK,cAAcA,EAAI,YAAW,CAAE,EAAImhB,CAC5C,CACA,aAAaA,EAAS,CAClB,OAAO,KAAK,cAAcA,CAAO,CACrC,CACA,aAAanhB,EAAK,CACd,OAAO,KAAK,cAAcA,EAAI,YAAW,CAAE,GAAK,CACpD,CACJ,CACA,MAAMohB,GAAQ,IAAIF,GACZG,GAAoB,IAAIH,GACxBI,GAAyB,IAAIJ,GAC7BK,GAAqB,IAAI,MAAM,GAAG,EAClCC,GAAmB,OAAO,OAAO,IAAI,EACrCC,GAA4B,OAAO,OAAO,IAAI,GAQnD,UAAY,CAIT,MAAMC,EAAW,CAEb,CAAC,EAAG,EAAuB,OAAQ,EAAyB,UAAW,EAAG,aAAc,GAAO,EAAK,EACpG,CAAC,EAAG,EAAwB,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3F,CAAC,EAAG,EAAwB,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3F,CAAC,EAAG,EAAqB,KAAM,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACrF,CAAC,EAAG,EAAyB,SAAU,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,EAA0B,UAAW,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC/F,CAAC,EAAG,EAAyB,SAAU,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAwB,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3F,CAAC,EAAG,EAAwB,QAAS,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAChG,CAAC,EAAG,EAAyB,SAAU,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAAwB,OAAQ,GAAuB,IAAK,GAAI,OAAQ,GAAO,EAAK,EACxF,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,GAAI,OAAQ,GAAO,EAAK,EAC9F,CAAC,EAAG,GAAyB,QAAS,EAAuB,QAAS,GAAI,YAAa,GAAO,EAAK,EACnG,CAAC,EAAG,GAA0B,SAAU,EAAwB,SAAU,GAAI,YAAa,GAAO,EAAK,EACvG,CAAC,EAAG,GAA6B,YAAa,EAA2B,YAAa,EAAG,UAAW,GAAO,EAAK,EAChH,CAAC,EAAG,GAAuB,MAAO,EAAqB,MAAO,EAAG,SAAU,GAAO,EAAK,EACvF,CAAC,EAAG,GAAyB,QAAS,GAAwB,QAAS,GAAI,WAAY,GAAO,EAAK,EACnG,CAAC,EAAG,GAAyB,QAAS,GAAwB,IAAK,IAAK,eAAgB,IAAK,WAAW,EACxG,CAAC,EAAG,GAAyB,QAAS,GAAwB,IAAK,IAAK,cAAe,IAAK,UAAU,EACtG,CAAC,EAAG,GAA+B,cAAe,GAA8B,IAAK,IAAK,WAAY,IAAK,OAAO,EAClH,CAAC,EAAG,GAAgC,eAAgB,GAA+B,IAAK,IAAK,WAAY,IAAK,OAAO,EACrH,CAAC,EAAG,GAA6B,YAAa,GAA4B,KAAM,IAAK,WAAY,KAAM,OAAO,EAC9G,CAAC,EAAG,GAA4B,WAAY,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAClG,CAAC,EAAG,GAA6B,YAAa,GAA4B,IAAK,IAAK,WAAY,IAAK,OAAO,EAC5G,CAAC,EAAG,GAAyB,QAAS,GAAwB,IAAM,IAAK,WAAY,IAAM,OAAO,EAClG,CAAC,EAAG,GAA6B,YAAa,GAA4B,IAAK,IAAK,WAAY,IAAK,OAAO,EAC5G,CAAC,EAAG,GAAyB,QAAS,GAAwB,IAAK,IAAK,eAAgB,IAAK,WAAW,EACxG,CAAC,EAAG,GAA0B,SAAU,GAAyB,IAAK,IAAK,gBAAiB,IAAK,YAAY,EAC7G,CAAC,EAAG,GAAyB,QAAS,GAAwB,IAAK,IAAK,WAAY,IAAK,OAAO,EAChG,CAAC,EAAG,GAA4B,WAAY,EAA0B,WAAY,GAAI,aAAc,GAAO,EAAK,EAChH,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAsB,KAAM,GAAqB,KAAM,IAAK,QAAS,GAAO,EAAK,EACrF,CAAC,EAAG,GAAuB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC1F,CAAC,EAAG,GAAuB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC1F,CAAC,EAAG,GAAuB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC1F,CAAC,EAAG,GAA+B,cAAe,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACxG,CAAC,EAAG,GAA8B,aAAc,GAA6B,aAAc,IAAK,YAAa,GAAO,EAAK,EACzH,CAAC,EAAG,GAAyB,QAAS,EAA4B,aAAc,GAAI,WAAY,GAAO,EAAK,EAC5G,CAAC,EAAG,GAA0B,SAAU,GAAyB,SAAU,GAAI,YAAa,GAAO,EAAK,EACxG,CAAC,EAAG,GAAwB,OAAQ,GAAuB,OAAQ,GAAI,UAAW,GAAO,EAAK,EAC9F,CAAC,EAAG,GAA0B,SAAU,GAAyB,SAAU,GAAI,WAAY,GAAO,EAAK,EACvG,CAAC,EAAG,GAA0B,SAAU,GAAyB,SAAU,GAAI,YAAa,GAAO,EAAK,EACxG,CAAC,EAAG,GAAuB,MAAO,GAAsB,MAAO,GAAI,SAAU,GAAO,EAAK,EACzF,CAAC,EAAG,GAA4B,WAAY,GAA2B,WAAY,GAAI,UAAW,GAAO,EAAK,EAC9G,CAAC,EAAG,GAA8B,aAAc,GAA6B,aAAc,GAAI,WAAY,QAAS,EAAK,EACzH,CAAC,EAAG,GAA6B,YAAa,GAA4B,YAAa,GAAI,UAAW,OAAQ,EAAK,EACnH,CAAC,EAAG,GAA6B,YAAa,GAA4B,YAAa,GAAI,UAAW,OAAQ,EAAK,EACnH,CAAC,EAAG,GAA2B,UAAW,GAA0B,UAAW,GAAI,QAAS,KAAM,EAAK,EACvG,CAAC,EAAG,GAA2B,UAAW,GAA0B,UAAW,IAAK,aAAc,GAAO,EAAK,EAC9G,CAAC,EAAG,GAAgC,eAAgB,IAAgC,gBAAiB,IAAK,YAAa,GAAO,EAAK,EACnI,CAAC,EAAG,GAAkC,iBAAkB,IAAkC,kBAAmB,IAAK,cAAe,GAAO,EAAK,EAC7I,CAAC,EAAG,GAAkC,iBAAkB,IAAkC,kBAAmB,IAAK,cAAe,GAAO,EAAK,EAC7I,CAAC,EAAG,GAA6B,YAAa,IAA6B,aAAc,IAAK,SAAU,GAAO,EAAK,EACpH,CAAC,EAAG,GAA+B,cAAe,EAAuB,GAAO,EAAG,GAAO,GAAO,EAAK,EACtG,CAAC,EAAG,GAA2B,UAAW,GAA0B,UAAW,GAAI,aAAc,GAAO,EAAK,EAC7G,CAAC,EAAG,GAA2B,UAAW,IAA2B,UAAW,GAAI,aAAc,GAAO,EAAK,EAC9G,CAAC,EAAG,GAA2B,UAAW,IAA2B,UAAW,GAAI,aAAc,GAAO,EAAK,EAC9G,CAAC,EAAG,GAA2B,UAAW,IAA2B,UAAW,IAAK,aAAc,GAAO,EAAK,EAC/G,CAAC,EAAG,GAA2B,UAAW,IAA2B,UAAW,IAAK,aAAc,GAAO,EAAK,EAC/G,CAAC,EAAG,IAA4B,UAAW,IAA2B,UAAW,IAAK,aAAc,GAAO,EAAK,EAChH,CAAC,EAAG,IAA4B,UAAW,IAA2B,UAAW,IAAK,aAAc,GAAO,EAAK,EAChH,CAAC,EAAG,IAA4B,UAAW,IAA2B,UAAW,IAAK,aAAc,GAAO,EAAK,EAChH,CAAC,EAAG,IAA4B,UAAW,IAA2B,UAAW,IAAK,aAAc,GAAO,EAAK,EAChH,CAAC,EAAG,IAA4B,UAAW,GAA0B,UAAW,GAAI,aAAc,GAAO,EAAK,EAC9G,CAAC,EAAG,IAAkC,gBAAiB,IAAiC,iBAAkB,IAAK,aAAc,GAAO,EAAK,EACzI,CAAC,EAAG,IAAkC,gBAAiB,GAAgC,UAAW,IAAK,aAAc,GAAO,EAAK,EACjI,CAAC,EAAG,IAAgC,cAAe,GAA8B,cAAe,GAAI,GAAO,GAAO,EAAK,EACvH,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAAgC,cAAe,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACzG,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,GAAsB,MAAO,IAAK,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAyB,OAAQ,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAyB,OAAQ,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3F,CAAC,EAAG,IAA2B,SAAU,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC/F,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAAyB,OAAQ,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAwB,MAAO,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACzF,CAAC,EAAG,IAAyB,OAAQ,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3F,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAAyB,OAAQ,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3F,CAAC,EAAG,IAAoC,kBAAmB,IAAmC,kBAAmB,IAAK,iBAAkB,GAAO,EAAK,EACpJ,CAAC,EAAG,IAAkC,gBAAiB,IAAiC,gBAAiB,IAAK,eAAgB,GAAO,EAAK,EAC1I,CAAC,EAAG,IAAoC,kBAAmB,IAAmC,kBAAmB,IAAK,iBAAkB,GAAO,EAAK,EACpJ,CAAC,EAAG,IAAgC,cAAe,IAAoC,mBAAoB,IAAK,eAAgB,GAAO,EAAK,EAC5I,CAAC,EAAG,IAA2B,SAAU,IAA2B,UAAW,IAAK,aAAc,GAAO,EAAK,EAC9G,CAAC,EAAG,IAA6B,WAAY,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACnG,CAAC,EAAG,IAA4B,UAAW,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACjG,CAAC,EAAG,IAA4B,UAAW,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACjG,CAAC,EAAG,IAA+B,aAAc,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACvG,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAAoC,kBAAmB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACjH,CAAC,EAAG,IAAqC,mBAAoB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACnH,CAAC,EAAG,IAAoC,kBAAmB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACjH,CAAC,EAAG,IAAsC,oBAAqB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACrH,CAAC,EAAG,IAAuC,qBAAsB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACvH,CAAC,EAAG,IAAsC,oBAAqB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACrH,CAAC,EAAG,IAAoC,kBAAmB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACjH,CAAC,EAAG,IAAyC,uBAAwB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3H,CAAC,EAAG,IAAgC,cAAe,IAAyB,QAAS,GAAI,WAAY,GAAO,EAAK,EACjH,CAAC,EAAG,IAAqC,mBAAoB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACnH,CAAC,EAAG,EAAuB,GAAO,EAAsB,OAAQ,GAAI,aAAc,GAAO,EAAK,EAC9F,CAAC,EAAG,EAAuB,GAAO,EAAuB,QAAS,GAAI,WAAY,GAAO,EAAK,EAC9F,CAAC,EAAG,EAAuB,GAAO,EAAqB,MAAO,GAAI,UAAW,GAAO,EAAK,EACzF,CAAC,EAAG,EAAuB,GAAO,GAAuB,OAAQ,GAAI,aAAc,GAAO,EAAK,EAC/F,CAAC,EAAG,IAAgC,cAAe,EAAsB,GAAO,EAAG,cAAe,GAAO,EAAK,EAC9G,CAAC,EAAG,IAA8B,YAAa,EAAuB,GAAO,EAAG,YAAa,GAAO,EAAK,EACzG,CAAC,EAAG,IAA4B,UAAW,EAAqB,GAAO,EAAG,WAAY,GAAO,EAAK,EAClG,CAAC,EAAG,IAA6B,WAAY,GAAuB,GAAO,EAAG,UAAW,GAAO,EAAK,EACrG,CAAC,EAAG,IAAiC,eAAgB,EAAsB,GAAO,EAAG,cAAe,GAAO,EAAK,EAChH,CAAC,EAAG,IAA+B,aAAc,EAAuB,GAAO,EAAG,YAAa,GAAO,EAAK,EAC3G,CAAC,EAAG,IAA6B,WAAY,EAAqB,GAAO,EAAG,WAAY,GAAO,EAAK,EACpG,CAAC,EAAG,IAA8B,YAAa,GAAuB,GAAO,EAAG,UAAW,GAAO,EAAK,EACvG,CAAC,EAAG,IAAiC,eAAgB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC3G,CAAC,EAAG,IAAmC,iBAAkB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC/G,CAAC,EAAG,IAA8B,YAAa,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACrG,CAAC,EAAG,IAAgC,cAAe,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACzG,CAAC,EAAG,IAAqC,mBAAoB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACnH,CAAC,EAAG,IAAgC,cAAe,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACzG,CAAC,EAAG,IAAmC,iBAAkB,IAAkC,iBAAkB,IAAK,sBAAuB,GAAO,EAAK,EACrJ,CAAC,EAAG,IAAuC,qBAAsB,IAAsC,qBAAsB,IAAK,sBAAuB,GAAO,EAAK,EACrK,CAAC,EAAG,IAA8B,YAAa,IAA6B,YAAa,IAAK,gBAAiB,GAAO,EAAK,EAC3H,CAAC,EAAG,IAA0B,QAAS,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAC7F,CAAC,EAAG,IAAmC,iBAAkB,IAAkC,iBAAkB,IAAK,sBAAuB,GAAO,EAAK,EACrJ,CAAC,EAAG,IAAgC,cAAe,IAAqC,oBAAqB,IAAK,+BAAgC,GAAO,EAAK,EAC9J,CAAC,EAAG,IAA+B,aAAc,IAA8B,aAAc,IAAK,uBAAwB,GAAO,EAAK,EACtI,CAAC,EAAG,IAA+B,aAAc,IAA8B,aAAc,IAAK,uBAAwB,GAAO,EAAK,EACtI,CAAC,EAAG,IAA+B,aAAc,EAAyB,GAAO,EAAG,uBAAwB,GAAO,EAAK,EACxH,CAAC,EAAG,IAA+B,aAAc,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACvG,CAAC,EAAG,IAAsC,oBAAqB,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACrH,CAAC,EAAG,IAAkC,gBAAiB,IAAiC,gBAAiB,IAAK,oBAAqB,GAAO,EAAK,EAC/I,CAAC,EAAG,IAAgC,cAAe,IAA+B,cAAe,IAAK,kBAAmB,GAAO,EAAK,EACrI,CAAC,EAAG,IAAgC,cAAe,IAA+B,cAAe,IAAK,kBAAmB,GAAO,EAAK,EACrI,CAAC,EAAG,IAAmC,iBAAkB,IAAkC,iBAAkB,IAAK,qBAAsB,GAAO,EAAK,EACpJ,CAAC,EAAG,IAAgC,cAAe,EAAyB,GAAO,EAAG,kBAAmB,GAAO,EAAK,EACrH,CAAC,EAAG,IAAmC,iBAAkB,EAAyB,GAAO,EAAG,qBAAsB,GAAO,EAAK,EAC9H,CAAC,EAAG,IAAqC,mBAAoB,EAAyB,GAAO,EAAG,uBAAwB,GAAO,EAAK,EACpI,CAAC,EAAG,IAA+B,aAAc,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACvG,CAAC,EAAG,IAA8B,YAAa,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACrG,CAAC,EAAG,IAAgC,cAAe,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EACzG,CAAC,EAAG,IAA6B,WAAY,EAAyB,GAAO,EAAG,GAAO,GAAO,EAAK,EAGnG,CAAC,EAAG,EAAuB,GAAO,IAAsC,mBAAoB,IAAK,GAAO,GAAO,EAAK,EACpH,CAAC,EAAG,EAAuB,GAAO,IAA2B,UAAW,IAAK,aAAc,GAAO,EAAK,EACvG,CAAC,EAAG,EAAuB,GAAO,GAAwB,QAAS,IAAK,WAAY,GAAO,EAAK,EAChG,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,UAAW,GAAO,EAAK,EAC5F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,YAAa,GAAO,EAAK,EAC9F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,aAAc,GAAO,EAAK,EAC/F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,gBAAiB,GAAO,EAAK,EAClG,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,YAAa,GAAO,EAAK,EAC9F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,gBAAiB,GAAO,EAAK,EAClG,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,YAAa,GAAO,EAAK,EAC9F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,aAAc,GAAO,EAAK,EAC/F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,cAAe,GAAO,EAAK,EAChG,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,UAAW,GAAO,EAAK,EAC5F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,UAAW,GAAO,EAAK,EAC5F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,gBAAiB,GAAO,EAAK,EAClG,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,YAAa,GAAO,EAAK,EAC9F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,kBAAmB,GAAO,EAAK,EACpG,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,kBAAmB,GAAO,EAAK,EACpG,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,UAAW,GAAO,EAAK,EAC5F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,WAAY,GAAO,EAAK,EAC7F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,UAAW,GAAO,EAAK,EAC5F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,UAAW,GAAO,EAAK,EAC5F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,YAAa,GAAO,EAAK,EAC9F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,SAAU,GAAO,EAAK,EAC3F,CAAC,EAAG,EAAuB,GAAO,EAAyB,GAAO,EAAG,eAAgB,GAAO,EAAK,CACzG,EACUC,EAAc,CAAA,EACdC,EAAe,CAAA,EACrB,UAAWC,KAAWH,EAAU,CAC5B,KAAM,CAACI,EAAWC,EAAUC,EAAab,EAASc,EAAYC,EAAcC,EAAMC,EAAqBC,CAAwB,EAAIR,EASnI,GARKD,EAAaG,CAAQ,IACtBH,EAAaG,CAAQ,EAAI,GACzBP,GAAiBQ,CAAW,EAAID,EAChCN,GAA0BO,EAAY,YAAW,CAAE,EAAID,GAKvD,CAACJ,EAAYR,CAAO,EAAG,CAEvB,GADAQ,EAAYR,CAAO,EAAI,GACnB,CAACc,EACD,MAAM,IAAI,MAAM,8CAA8Cd,CAAO,qBAAqBa,CAAW,EAAE,EAE3GZ,GAAM,OAAOD,EAASc,CAAU,EAChCZ,GAAkB,OAAOF,EAASiB,GAAuBH,CAAU,EACnEX,GAAuB,OAAOH,EAASkB,GAA4BD,GAAuBH,CAAU,CACxG,CACIC,IACAX,GAAmBW,CAAY,EAAIf,EAE3C,CACJ,GAAC,EACD,IAAImB,IACH,SAAUA,EAAc,CACrB,SAASC,EAASpB,EAAS,CACvB,OAAOC,GAAM,aAAaD,CAAO,CACrC,CACAmB,EAAa,SAAWC,EACxB,SAASC,EAAWhV,EAAK,CACrB,OAAO4T,GAAM,aAAa5T,CAAG,CACjC,CACA8U,EAAa,WAAaE,EAC1B,SAASC,EAAiBtB,EAAS,CAC/B,OAAOE,GAAkB,aAAaF,CAAO,CACjD,CACAmB,EAAa,iBAAmBG,EAChC,SAASC,EAAsBvB,EAAS,CACpC,OAAOG,GAAuB,aAAaH,CAAO,CACtD,CACAmB,EAAa,sBAAwBI,EACrC,SAASC,EAAiBnV,EAAK,CAC3B,OAAO6T,GAAkB,aAAa7T,CAAG,GAAK8T,GAAuB,aAAa9T,CAAG,CACzF,CACA8U,EAAa,iBAAmBK,EAChC,SAASC,EAAsBzB,EAAS,CACpC,GAAIA,GAAW,IAA4BA,GAAW,IASlD,OAAO,KAEX,OAAQA,EAAO,CACX,IAAK,IACD,MAAO,KACX,IAAK,IACD,MAAO,OACX,IAAK,IACD,MAAO,OACX,IAAK,IACD,MAAO,OACvB,CACQ,OAAOC,GAAM,aAAaD,CAAO,CACrC,CACAmB,EAAa,sBAAwBM,CACzC,GAAGN,KAAiBA,GAAe,CAAA,EAAG,EACtC,SAASO,GAASC,EAAWC,EAAY,CACrC,MAAMC,GAAcD,EAAa,QAAe,KAAQ,EACxD,OAAQD,EAAYE,KAAe,CACvC,CCtVA,IAAIC,GAEJ,MAAMC,GAAe,WAAW,OAChC,GAAI,OAAOA,GAAiB,KAAe,OAAOA,GAAa,QAAY,IAAa,CACpF,MAAMC,EAAiBD,GAAa,QACpCD,GAAc,CACV,IAAI,UAAW,CAAE,OAAOE,EAAe,QAAU,EACjD,IAAI,MAAO,CAAE,OAAOA,EAAe,IAAM,EACzC,IAAI,KAAM,CAAE,OAAOA,EAAe,GAAK,EACvC,KAAM,CAAE,OAAOA,EAAe,IAAG,CAAI,CAC7C,CACA,MAES,OAAO,QAAY,KAAe,OAAO,SAAS,UAAU,MAAS,SAC1EF,GAAc,CACV,IAAI,UAAW,CAAE,OAAO,QAAQ,QAAU,EAC1C,IAAI,MAAO,CAAE,OAAO,QAAQ,IAAM,EAClC,IAAI,KAAM,CAAE,OAAO,QAAQ,GAAK,EAChC,KAAM,CAAE,OAAO,QAAQ,IAAI,YAAiB,QAAQ,IAAG,CAAI,CACnE,EAIIA,GAAc,CAEV,IAAI,UAAW,CAAE,OAAOvW,GAAY,QAAUC,GAAc,SAAW,OAAS,EAChF,IAAI,MAAO,CAAmD,EAE9D,IAAI,KAAM,CAAE,MAAO,CAAA,CAAI,EACvB,KAAM,CAAE,MAAO,GAAK,CAC5B,EAUA,MAAMyW,GAAMH,GAAY,IAOlBI,GAAMJ,GAAY,IAKlBK,GAAWL,GAAY,SCxBvBM,GAAmB,GACnBC,GAAmB,GACnBC,GAAmB,GACnBC,GAAmB,IACnBC,GAAW,GACXC,GAAqB,GACrBC,GAAsB,GACtBC,GAAa,GACbC,GAAqB,GAC3B,MAAMC,WAA4B,KAAM,CACpC,YAAYvlB,EAAMwlB,EAAUC,EAAQ,CAEhC,IAAIC,EACA,OAAOF,GAAa,UAAYA,EAAS,QAAQ,MAAM,IAAM,GAC7DE,EAAa,cACbF,EAAWA,EAAS,QAAQ,QAAS,EAAE,GAGvCE,EAAa,UAEjB,MAAMC,EAAO3lB,EAAK,QAAQ,GAAG,IAAM,GAAK,WAAa,WACrD,IAAIM,EAAM,QAAQN,CAAI,KAAK2lB,CAAI,IAAID,CAAU,YAAYF,CAAQ,GACjEllB,GAAO,mBAAmB,OAAOmlB,CAAM,GACvC,MAAMnlB,CAAG,EACT,KAAK,KAAO,sBAChB,CACJ,CACA,SAASslB,GAAeC,EAAY7lB,EAAM,CACtC,GAAI6lB,IAAe,MAAQ,OAAOA,GAAe,SAC7C,MAAM,IAAIN,GAAoBvlB,EAAM,SAAU6lB,CAAU,CAEhE,CACA,SAASC,GAAenlB,EAAOX,EAAM,CACjC,GAAI,OAAOW,GAAU,SACjB,MAAM,IAAI4kB,GAAoBvlB,EAAM,SAAUW,CAAK,CAE3D,CACA,MAAMolB,GAAmBlB,KAAa,QACtC,SAASmB,EAAgBpW,EAAM,CAC3B,OAAOA,IAASuV,IAAsBvV,IAASwV,EACnD,CACA,SAASa,GAAqBrW,EAAM,CAChC,OAAOA,IAASuV,EACpB,CACA,SAASe,GAAoBtW,EAAM,CAC/B,OAAQA,GAAQkV,IAAoBlV,GAAQoV,IACvCpV,GAAQmV,IAAoBnV,GAAQqV,EAC7C,CAEA,SAASkB,GAAgBC,EAAMC,EAAgBC,EAAWN,EAAiB,CACvE,IAAIngB,EAAM,GACN0gB,EAAoB,EACpBC,EAAY,GACZC,EAAO,EACP7W,EAAO,EACX,QAASzO,EAAI,EAAGA,GAAKilB,EAAK,OAAQ,EAAEjlB,EAAG,CACnC,GAAIA,EAAIilB,EAAK,OACTxW,EAAOwW,EAAK,WAAWjlB,CAAC,MAEvB,IAAI6kB,EAAgBpW,CAAI,EACzB,MAGAA,EAAOuV,GAEX,GAAIa,EAAgBpW,CAAI,EAAG,CACvB,GAAI,EAAA4W,IAAcrlB,EAAI,GAAKslB,IAAS,GAC/B,GAAIA,IAAS,EAAG,CACjB,GAAI5gB,EAAI,OAAS,GAAK0gB,IAAsB,GACxC1gB,EAAI,WAAWA,EAAI,OAAS,CAAC,IAAMqf,IACnCrf,EAAI,WAAWA,EAAI,OAAS,CAAC,IAAMqf,IACnC,GAAIrf,EAAI,OAAS,EAAG,CAChB,MAAM6gB,EAAiB7gB,EAAI,YAAYygB,CAAS,EAC5CI,IAAmB,IACnB7gB,EAAM,GACN0gB,EAAoB,IAGpB1gB,EAAMA,EAAI,MAAM,EAAG6gB,CAAc,EACjCH,EAAoB1gB,EAAI,OAAS,EAAIA,EAAI,YAAYygB,CAAS,GAElEE,EAAYrlB,EACZslB,EAAO,EACP,QACJ,SACS5gB,EAAI,SAAW,EAAG,CACvBA,EAAM,GACN0gB,EAAoB,EACpBC,EAAYrlB,EACZslB,EAAO,EACP,QACJ,EAEAJ,IACAxgB,GAAOA,EAAI,OAAS,EAAI,GAAGygB,CAAS,KAAO,KAC3CC,EAAoB,EAE5B,MAEQ1gB,EAAI,OAAS,EACbA,GAAO,GAAGygB,CAAS,GAAGF,EAAK,MAAMI,EAAY,EAAGrlB,CAAC,CAAC,GAGlD0E,EAAMugB,EAAK,MAAMI,EAAY,EAAGrlB,CAAC,EAErColB,EAAoBplB,EAAIqlB,EAAY,EAExCA,EAAYrlB,EACZslB,EAAO,CACX,MACS7W,IAASsV,IAAYuB,IAAS,GACnC,EAAEA,EAGFA,EAAO,EAEf,CACA,OAAO5gB,CACX,CACA,SAAS8gB,GAAUC,EAAK,CACpB,OAAOA,EAAM,GAAGA,EAAI,CAAC,IAAM,IAAM,GAAK,GAAG,GAAGA,CAAG,GAAK,EACxD,CACA,SAASha,GAAQia,EAAKhB,EAAY,CAC9BD,GAAeC,EAAY,YAAY,EACvC,MAAMiB,EAAMjB,EAAW,KAAOA,EAAW,KACnCkB,EAAOlB,EAAW,MACpB,GAAGA,EAAW,MAAQ,EAAE,GAAGc,GAAUd,EAAW,GAAG,CAAC,GACxD,OAAKiB,EAGEA,IAAQjB,EAAW,KAAO,GAAGiB,CAAG,GAAGC,CAAI,GAAK,GAAGD,CAAG,GAAGD,CAAG,GAAGE,CAAI,GAF3DA,CAGf,CACA,MAAMC,GAAQ,CAEV,WAAWC,EAAc,CACrB,IAAIC,EAAiB,GACjBC,EAAe,GACfC,EAAmB,GACvB,QAAS,EAAIH,EAAa,OAAS,EAAG,GAAK,GAAI,IAAK,CAChD,IAAIb,EACJ,GAAI,GAAK,GAIL,GAHAA,EAAOa,EAAa,CAAC,EACrBnB,GAAeM,EAAM,SAAS,CAAC,GAAG,EAE9BA,EAAK,SAAW,EAChB,cAGCc,EAAe,SAAW,EAC/Bd,EAAOzB,GAAG,GAQVyB,EAAOxB,GAAI,IAAIsC,CAAc,EAAE,GAAKvC,GAAG,GAGnCyB,IAAS,QACRA,EAAK,MAAM,EAAG,CAAC,EAAE,YAAW,IAAOc,EAAe,YAAW,GAC1Dd,EAAK,WAAW,CAAC,IAAMhB,MAC3BgB,EAAO,GAAGc,CAAc,OAGhC,MAAM5Y,EAAM8X,EAAK,OACjB,IAAIiB,EAAU,EACVC,EAAS,GACTC,EAAa,GACjB,MAAM3X,EAAOwW,EAAK,WAAW,CAAC,EAE9B,GAAI9X,IAAQ,EACJ0X,EAAgBpW,CAAI,IAEpByX,EAAU,EACVE,EAAa,YAGZvB,EAAgBpW,CAAI,EAKzB,GADA2X,EAAa,GACTvB,EAAgBI,EAAK,WAAW,CAAC,CAAC,EAAG,CAErC,IAAIhL,EAAI,EACJhT,EAAOgT,EAEX,KAAOA,EAAI9M,GAAO,CAAC0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GACjDA,IAEJ,GAAIA,EAAI9M,GAAO8M,IAAMhT,EAAM,CACvB,MAAMic,EAAY+B,EAAK,MAAMhe,EAAMgT,CAAC,EAIpC,IAFAhT,EAAOgT,EAEAA,EAAI9M,GAAO0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GAChDA,IAEJ,GAAIA,EAAI9M,GAAO8M,IAAMhT,EAAM,CAIvB,IAFAA,EAAOgT,EAEAA,EAAI9M,GAAO,CAAC0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GACjDA,KAEAA,IAAM9M,GAAO8M,IAAMhT,KAEnBkf,EAAS,OAAOjD,CAAS,KAAK+B,EAAK,MAAMhe,EAAMgT,CAAC,CAAC,GACjDiM,EAAUjM,EAElB,CACJ,CACJ,MAEIiM,EAAU,OAGTnB,GAAoBtW,CAAI,GAC7BwW,EAAK,WAAW,CAAC,IAAMf,KAEvBiC,EAASlB,EAAK,MAAM,EAAG,CAAC,EACxBiB,EAAU,EACN/Y,EAAM,GAAK0X,EAAgBI,EAAK,WAAW,CAAC,CAAC,IAG7CmB,EAAa,GACbF,EAAU,IAGlB,GAAIC,EAAO,OAAS,EAChB,GAAIJ,EAAe,OAAS,GACxB,GAAII,EAAO,YAAW,IAAOJ,EAAe,YAAW,EAEnD,cAIJA,EAAiBI,EAGzB,GAAIF,GACA,GAAIF,EAAe,OAAS,EACxB,cAIJC,EAAe,GAAGf,EAAK,MAAMiB,CAAO,CAAC,KAAKF,CAAY,GACtDC,EAAmBG,EACfA,GAAcL,EAAe,OAAS,EACtC,KAGZ,CAKA,OAAAC,EAAehB,GAAgBgB,EAAc,CAACC,EAAkB,KAAMpB,CAAe,EAC9EoB,EACH,GAAGF,CAAc,KAAKC,CAAY,GAClC,GAAGD,CAAc,GAAGC,CAAY,IAAM,GAC9C,EACA,UAAUf,EAAM,CACZN,GAAeM,EAAM,MAAM,EAC3B,MAAM9X,EAAM8X,EAAK,OACjB,GAAI9X,IAAQ,EACR,MAAO,IAEX,IAAI+Y,EAAU,EACVC,EACAC,EAAa,GACjB,MAAM3X,EAAOwW,EAAK,WAAW,CAAC,EAE9B,GAAI9X,IAAQ,EAGR,OAAO2X,GAAqBrW,CAAI,EAAI,KAAOwW,EAE/C,GAAIJ,EAAgBpW,CAAI,EAKpB,GADA2X,EAAa,GACTvB,EAAgBI,EAAK,WAAW,CAAC,CAAC,EAAG,CAErC,IAAIhL,EAAI,EACJhT,EAAOgT,EAEX,KAAOA,EAAI9M,GAAO,CAAC0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GACjDA,IAEJ,GAAIA,EAAI9M,GAAO8M,IAAMhT,EAAM,CACvB,MAAMic,EAAY+B,EAAK,MAAMhe,EAAMgT,CAAC,EAIpC,IAFAhT,EAAOgT,EAEAA,EAAI9M,GAAO0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GAChDA,IAEJ,GAAIA,EAAI9M,GAAO8M,IAAMhT,EAAM,CAIvB,IAFAA,EAAOgT,EAEAA,EAAI9M,GAAO,CAAC0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GACjDA,IAEJ,GAAIA,IAAM9M,EAIN,MAAO,OAAO+V,CAAS,KAAK+B,EAAK,MAAMhe,CAAI,CAAC,KAE5CgT,IAAMhT,IAENkf,EAAS,OAAOjD,CAAS,KAAK+B,EAAK,MAAMhe,EAAMgT,CAAC,CAAC,GACjDiM,EAAUjM,EAElB,CACJ,CACJ,MAEIiM,EAAU,OAGTnB,GAAoBtW,CAAI,GAAKwW,EAAK,WAAW,CAAC,IAAMf,KAEzDiC,EAASlB,EAAK,MAAM,EAAG,CAAC,EACxBiB,EAAU,EACN/Y,EAAM,GAAK0X,EAAgBI,EAAK,WAAW,CAAC,CAAC,IAG7CmB,EAAa,GACbF,EAAU,IAGlB,IAAIG,EAAOH,EAAU/Y,EACjB6X,GAAgBC,EAAK,MAAMiB,CAAO,EAAG,CAACE,EAAY,KAAMvB,CAAe,EACvE,GAOJ,GANIwB,EAAK,SAAW,GAAK,CAACD,IACtBC,EAAO,KAEPA,EAAK,OAAS,GAAKxB,EAAgBI,EAAK,WAAW9X,EAAM,CAAC,CAAC,IAC3DkZ,GAAQ,MAER,CAACD,GAAcD,IAAW,QAAalB,EAAK,SAAS,GAAG,EAAG,CAK3D,GAAIoB,EAAK,QAAU,GACftB,GAAoBsB,EAAK,WAAW,CAAC,CAAC,GACtCA,EAAK,WAAW,CAAC,IAAMnC,GACvB,MAAO,MAAMmC,CAAI,GAErB,IAAIzkB,EAAQqjB,EAAK,QAAQ,GAAG,EAC5B,EACI,IAAIrjB,IAAUuL,EAAM,GAAK0X,EAAgBI,EAAK,WAAWrjB,EAAQ,CAAC,CAAC,EAC/D,MAAO,MAAMykB,CAAI,UAEfzkB,EAAQqjB,EAAK,QAAQ,IAAKrjB,EAAQ,CAAC,KAAO,GACxD,CACA,OAAIukB,IAAW,OACJC,EAAa,KAAKC,CAAI,GAAKA,EAE/BD,EAAa,GAAGD,CAAM,KAAKE,CAAI,GAAK,GAAGF,CAAM,GAAGE,CAAI,EAC/D,EACA,WAAWpB,EAAM,CACbN,GAAeM,EAAM,MAAM,EAC3B,MAAM9X,EAAM8X,EAAK,OACjB,GAAI9X,IAAQ,EACR,MAAO,GAEX,MAAMsB,EAAOwW,EAAK,WAAW,CAAC,EAC9B,OAAOJ,EAAgBpW,CAAI,GAEtBtB,EAAM,GACH4X,GAAoBtW,CAAI,GACxBwW,EAAK,WAAW,CAAC,IAAMf,IACvBW,EAAgBI,EAAK,WAAW,CAAC,CAAC,CAC9C,EACA,QAAQqB,EAAO,CACX,GAAIA,EAAM,SAAW,EACjB,MAAO,IAEX,IAAIC,EACArD,EACJ,QAASljB,EAAI,EAAGA,EAAIsmB,EAAM,OAAQ,EAAEtmB,EAAG,CACnC,MAAMqD,EAAMijB,EAAMtmB,CAAC,EACnB2kB,GAAethB,EAAK,MAAM,EACtBA,EAAI,OAAS,IACTkjB,IAAW,OACXA,EAASrD,EAAY7f,EAGrBkjB,GAAU,KAAKljB,CAAG,GAG9B,CACA,GAAIkjB,IAAW,OACX,MAAO,IAeX,IAAIC,EAAe,GACfC,EAAa,EACjB,GAAI,OAAOvD,GAAc,UAAY2B,EAAgB3B,EAAU,WAAW,CAAC,CAAC,EAAG,CAC3E,EAAEuD,EACF,MAAMC,EAAWxD,EAAU,OACvBwD,EAAW,GAAK7B,EAAgB3B,EAAU,WAAW,CAAC,CAAC,IACvD,EAAEuD,EACEC,EAAW,IACP7B,EAAgB3B,EAAU,WAAW,CAAC,CAAC,EACvC,EAAEuD,EAIFD,EAAe,IAI/B,CACA,GAAIA,EAAc,CAEd,KAAOC,EAAaF,EAAO,QACvB1B,EAAgB0B,EAAO,WAAWE,CAAU,CAAC,GAC7CA,IAGAA,GAAc,IACdF,EAAS,KAAKA,EAAO,MAAME,CAAU,CAAC,GAE9C,CACA,OAAOZ,GAAM,UAAUU,CAAM,CACjC,EAKA,SAASvlB,EAAMyB,EAAI,CAGf,GAFAkiB,GAAe3jB,EAAM,MAAM,EAC3B2jB,GAAeliB,EAAI,IAAI,EACnBzB,IAASyB,EACT,MAAO,GAEX,MAAMkkB,EAAWd,GAAM,QAAQ7kB,CAAI,EAC7B4lB,EAASf,GAAM,QAAQpjB,CAAE,EAM/B,GALIkkB,IAAaC,IAGjB5lB,EAAO2lB,EAAS,YAAW,EAC3BlkB,EAAKmkB,EAAO,YAAW,EACnB5lB,IAASyB,GACT,MAAO,GAEX,GAAIkkB,EAAS,SAAW3lB,EAAK,QAAU4lB,EAAO,SAAWnkB,EAAG,OAAQ,CAChE,MAAMokB,EAAYF,EAAS,MAAM,IAAI,EAC/BG,EAAUF,EAAO,MAAM,IAAI,EAC7BC,EAAUA,EAAU,OAAS,CAAC,IAAM,IACpCA,EAAU,IAAG,EAEbC,EAAQA,EAAQ,OAAS,CAAC,IAAM,IAChCA,EAAQ,IAAG,EAEf,MAAMC,EAAUF,EAAU,OACpBG,EAAQF,EAAQ,OAChB1kB,EAAS2kB,EAAUC,EAAQD,EAAUC,EAC3C,IAAIhnB,EACJ,IAAKA,EAAI,EAAGA,EAAIoC,GACRykB,EAAU7mB,CAAC,EAAE,YAAW,IAAO8mB,EAAQ9mB,CAAC,EAAE,cAD1BA,IACpB,CAIJ,OAAIA,IAAM,EACC4mB,EAEF5mB,IAAMoC,EACP4kB,EAAQ5kB,EACD0kB,EAAQ,MAAM9mB,CAAC,EAAE,KAAK,IAAI,EAEjC+mB,EAAU3kB,EACH,OAAO,OAAO2kB,EAAU,EAAI/mB,CAAC,EAAI,KAErC,GAEJ,OAAO,OAAO+mB,EAAU/mB,CAAC,EAAI8mB,EAAQ,MAAM9mB,CAAC,EAAE,KAAK,IAAI,CAClE,CAEA,IAAIinB,EAAY,EAChB,KAAOA,EAAYjmB,EAAK,QACpBA,EAAK,WAAWimB,CAAS,IAAMhD,IAC/BgD,IAGJ,IAAIC,EAAUlmB,EAAK,OACnB,KAAOkmB,EAAU,EAAID,GACjBjmB,EAAK,WAAWkmB,EAAU,CAAC,IAAMjD,IACjCiD,IAEJ,MAAMH,EAAUG,EAAUD,EAE1B,IAAIE,EAAU,EACd,KAAOA,EAAU1kB,EAAG,QAChBA,EAAG,WAAW0kB,CAAO,IAAMlD,IAC3BkD,IAGJ,IAAIC,EAAQ3kB,EAAG,OACf,KAAO2kB,EAAQ,EAAID,GACf1kB,EAAG,WAAW2kB,EAAQ,CAAC,IAAMnD,IAC7BmD,IAEJ,MAAMJ,EAAQI,EAAQD,EAEhB/kB,EAAS2kB,EAAUC,EAAQD,EAAUC,EAC3C,IAAIK,EAAgB,GAChBrnB,EAAI,EACR,KAAOA,EAAIoC,EAAQpC,IAAK,CACpB,MAAMsnB,EAAWtmB,EAAK,WAAWimB,EAAYjnB,CAAC,EAC9C,GAAIsnB,IAAa7kB,EAAG,WAAW0kB,EAAUnnB,CAAC,EACtC,MAEKsnB,IAAarD,KAClBoD,EAAgBrnB,EAExB,CAGA,GAAIA,IAAMoC,GACN,GAAIilB,IAAkB,GAClB,OAAOT,MAGV,CACD,GAAII,EAAQ5kB,EAAQ,CAChB,GAAIK,EAAG,WAAW0kB,EAAUnnB,CAAC,IAAMikB,GAG/B,OAAO2C,EAAO,MAAMO,EAAUnnB,EAAI,CAAC,EAEvC,GAAIA,IAAM,EAGN,OAAO4mB,EAAO,MAAMO,EAAUnnB,CAAC,CAEvC,CACI+mB,EAAU3kB,IACNpB,EAAK,WAAWimB,EAAYjnB,CAAC,IAAMikB,GAGnCoD,EAAgBrnB,EAEXA,IAAM,IAGXqnB,EAAgB,IAGpBA,IAAkB,KAClBA,EAAgB,EAExB,CACA,IAAIE,EAAM,GAGV,IAAKvnB,EAAIinB,EAAYI,EAAgB,EAAGrnB,GAAKknB,EAAS,EAAElnB,GAChDA,IAAMknB,GAAWlmB,EAAK,WAAWhB,CAAC,IAAMikB,MACxCsD,GAAOA,EAAI,SAAW,EAAI,KAAO,QAMzC,OAHAJ,GAAWE,EAGPE,EAAI,OAAS,EACN,GAAGA,CAAG,GAAGX,EAAO,MAAMO,EAASC,CAAK,CAAC,IAE5CR,EAAO,WAAWO,CAAO,IAAMlD,IAC/B,EAAEkD,EAECP,EAAO,MAAMO,EAASC,CAAK,EACtC,EACA,iBAAiBnC,EAAM,CAEnB,GAAI,OAAOA,GAAS,UAAYA,EAAK,SAAW,EAC5C,OAAOA,EAEX,MAAMuC,EAAe3B,GAAM,QAAQZ,CAAI,EACvC,GAAIuC,EAAa,QAAU,EACvB,OAAOvC,EAEX,GAAIuC,EAAa,WAAW,CAAC,IAAMvD,IAE/B,GAAIuD,EAAa,WAAW,CAAC,IAAMvD,GAAqB,CACpD,MAAMxV,EAAO+Y,EAAa,WAAW,CAAC,EACtC,GAAI/Y,IAAS0V,IAAsB1V,IAASsV,GAExC,MAAO,eAAeyD,EAAa,MAAM,CAAC,CAAC,EAEnD,UAEKzC,GAAoByC,EAAa,WAAW,CAAC,CAAC,GACnDA,EAAa,WAAW,CAAC,IAAMtD,IAC/BsD,EAAa,WAAW,CAAC,IAAMvD,GAE/B,MAAO,UAAUuD,CAAY,GAEjC,OAAOA,CACX,EACA,QAAQvC,EAAM,CACVN,GAAeM,EAAM,MAAM,EAC3B,MAAM9X,EAAM8X,EAAK,OACjB,GAAI9X,IAAQ,EACR,MAAO,IAEX,IAAI+Y,EAAU,GACV7W,EAAS,EACb,MAAMZ,EAAOwW,EAAK,WAAW,CAAC,EAC9B,GAAI9X,IAAQ,EAGR,OAAO0X,EAAgBpW,CAAI,EAAIwW,EAAO,IAG1C,GAAIJ,EAAgBpW,CAAI,GAGpB,GADAyX,EAAU7W,EAAS,EACfwV,EAAgBI,EAAK,WAAW,CAAC,CAAC,EAAG,CAErC,IAAIhL,EAAI,EACJhT,EAAOgT,EAEX,KAAOA,EAAI9M,GAAO,CAAC0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GACjDA,IAEJ,GAAIA,EAAI9M,GAAO8M,IAAMhT,EAAM,CAIvB,IAFAA,EAAOgT,EAEAA,EAAI9M,GAAO0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GAChDA,IAEJ,GAAIA,EAAI9M,GAAO8M,IAAMhT,EAAM,CAIvB,IAFAA,EAAOgT,EAEAA,EAAI9M,GAAO,CAAC0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GACjDA,IAEJ,GAAIA,IAAM9M,EAEN,OAAO8X,EAEPhL,IAAMhT,IAINif,EAAU7W,EAAS4K,EAAI,EAE/B,CACJ,CACJ,OAGK8K,GAAoBtW,CAAI,GAAKwW,EAAK,WAAW,CAAC,IAAMf,KACzDgC,EAAU/Y,EAAM,GAAK0X,EAAgBI,EAAK,WAAW,CAAC,CAAC,EAAI,EAAI,EAC/D5V,EAAS6W,GAEb,IAAI7a,EAAM,GACNoc,EAAe,GACnB,QAASznB,EAAImN,EAAM,EAAGnN,GAAKqP,EAAQ,EAAErP,EACjC,GAAI6kB,EAAgBI,EAAK,WAAWjlB,CAAC,CAAC,GAClC,GAAI,CAACynB,EAAc,CACfpc,EAAMrL,EACN,KACJ,OAIAynB,EAAe,GAGvB,GAAIpc,IAAQ,GAAI,CACZ,GAAI6a,IAAY,GACZ,MAAO,IAEX7a,EAAM6a,CACV,CACA,OAAOjB,EAAK,MAAM,EAAG5Z,CAAG,CAC5B,EACA,SAAS4Z,EAAMyC,EAAQ,CACfA,IAAW,QACX/C,GAAe+C,EAAQ,QAAQ,EAEnC/C,GAAeM,EAAM,MAAM,EAC3B,IAAIrI,EAAQ,EACRvR,EAAM,GACNoc,EAAe,GACfznB,EASJ,GALIilB,EAAK,QAAU,GACfF,GAAoBE,EAAK,WAAW,CAAC,CAAC,GACtCA,EAAK,WAAW,CAAC,IAAMf,KACvBtH,EAAQ,GAER8K,IAAW,QAAaA,EAAO,OAAS,GAAKA,EAAO,QAAUzC,EAAK,OAAQ,CAC3E,GAAIyC,IAAWzC,EACX,MAAO,GAEX,IAAI0C,EAASD,EAAO,OAAS,EACzBE,EAAmB,GACvB,IAAK5nB,EAAIilB,EAAK,OAAS,EAAGjlB,GAAK4c,EAAO,EAAE5c,EAAG,CACvC,MAAMyO,EAAOwW,EAAK,WAAWjlB,CAAC,EAC9B,GAAI6kB,EAAgBpW,CAAI,GAGpB,GAAI,CAACgZ,EAAc,CACf7K,EAAQ5c,EAAI,EACZ,KACJ,OAGI4nB,IAAqB,KAGrBH,EAAe,GACfG,EAAmB5nB,EAAI,GAEvB2nB,GAAU,IAENlZ,IAASiZ,EAAO,WAAWC,CAAM,EAC7B,EAAEA,IAAW,KAGbtc,EAAMrL,IAMV2nB,EAAS,GACTtc,EAAMuc,GAItB,CACA,OAAIhL,IAAUvR,EACVA,EAAMuc,EAEDvc,IAAQ,KACbA,EAAM4Z,EAAK,QAERA,EAAK,MAAMrI,EAAOvR,CAAG,CAChC,CACA,IAAKrL,EAAIilB,EAAK,OAAS,EAAGjlB,GAAK4c,EAAO,EAAE5c,EACpC,GAAI6kB,EAAgBI,EAAK,WAAWjlB,CAAC,CAAC,GAGlC,GAAI,CAACynB,EAAc,CACf7K,EAAQ5c,EAAI,EACZ,KACJ,OAEKqL,IAAQ,KAGboc,EAAe,GACfpc,EAAMrL,EAAI,GAGlB,OAAIqL,IAAQ,GACD,GAEJ4Z,EAAK,MAAMrI,EAAOvR,CAAG,CAChC,EACA,QAAQ4Z,EAAM,CACVN,GAAeM,EAAM,MAAM,EAC3B,IAAIrI,EAAQ,EACRiL,EAAW,GACXC,EAAY,EACZzc,EAAM,GACNoc,EAAe,GAGfM,EAAc,EAId9C,EAAK,QAAU,GACfA,EAAK,WAAW,CAAC,IAAMf,IACvBa,GAAoBE,EAAK,WAAW,CAAC,CAAC,IACtCrI,EAAQkL,EAAY,GAExB,QAAS9nB,EAAIilB,EAAK,OAAS,EAAGjlB,GAAK4c,EAAO,EAAE5c,EAAG,CAC3C,MAAMyO,EAAOwW,EAAK,WAAWjlB,CAAC,EAC9B,GAAI6kB,EAAgBpW,CAAI,EAAG,CAGvB,GAAI,CAACgZ,EAAc,CACfK,EAAY9nB,EAAI,EAChB,KACJ,CACA,QACJ,CACIqL,IAAQ,KAGRoc,EAAe,GACfpc,EAAMrL,EAAI,GAEVyO,IAASsV,GAEL8D,IAAa,GACbA,EAAW7nB,EAEN+nB,IAAgB,IACrBA,EAAc,GAGbF,IAAa,KAGlBE,EAAc,GAEtB,CACA,OAAIF,IAAa,IACbxc,IAAQ,IAER0c,IAAgB,GAEfA,IAAgB,GACbF,IAAaxc,EAAM,GACnBwc,IAAaC,EAAY,EACtB,GAEJ7C,EAAK,MAAM4C,EAAUxc,CAAG,CACnC,EACA,OAAQI,GAAQ,KAAK,KAAM,IAAI,EAC/B,MAAMwZ,EAAM,CACRN,GAAeM,EAAM,MAAM,EAC3B,MAAM+C,EAAM,CAAE,KAAM,GAAI,IAAK,GAAI,KAAM,GAAI,IAAK,GAAI,KAAM,EAAE,EAC5D,GAAI/C,EAAK,SAAW,EAChB,OAAO+C,EAEX,MAAM7a,EAAM8X,EAAK,OACjB,IAAIiB,EAAU,EACVzX,EAAOwW,EAAK,WAAW,CAAC,EAC5B,GAAI9X,IAAQ,EACR,OAAI0X,EAAgBpW,CAAI,GAGpBuZ,EAAI,KAAOA,EAAI,IAAM/C,EACd+C,IAEXA,EAAI,KAAOA,EAAI,KAAO/C,EACf+C,GAGX,GAAInD,EAAgBpW,CAAI,GAGpB,GADAyX,EAAU,EACNrB,EAAgBI,EAAK,WAAW,CAAC,CAAC,EAAG,CAErC,IAAIhL,EAAI,EACJhT,EAAOgT,EAEX,KAAOA,EAAI9M,GAAO,CAAC0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GACjDA,IAEJ,GAAIA,EAAI9M,GAAO8M,IAAMhT,EAAM,CAIvB,IAFAA,EAAOgT,EAEAA,EAAI9M,GAAO0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GAChDA,IAEJ,GAAIA,EAAI9M,GAAO8M,IAAMhT,EAAM,CAIvB,IAFAA,EAAOgT,EAEAA,EAAI9M,GAAO,CAAC0X,EAAgBI,EAAK,WAAWhL,CAAC,CAAC,GACjDA,IAEAA,IAAM9M,EAEN+Y,EAAUjM,EAELA,IAAMhT,IAEXif,EAAUjM,EAAI,EAEtB,CACJ,CACJ,UAEK8K,GAAoBtW,CAAI,GAAKwW,EAAK,WAAW,CAAC,IAAMf,GAAY,CAErE,GAAI/W,GAAO,EAGP,OAAA6a,EAAI,KAAOA,EAAI,IAAM/C,EACd+C,EAGX,GADA9B,EAAU,EACNrB,EAAgBI,EAAK,WAAW,CAAC,CAAC,EAAG,CACrC,GAAI9X,IAAQ,EAGR,OAAA6a,EAAI,KAAOA,EAAI,IAAM/C,EACd+C,EAEX9B,EAAU,CACd,CACJ,CACIA,EAAU,IACV8B,EAAI,KAAO/C,EAAK,MAAM,EAAGiB,CAAO,GAEpC,IAAI2B,EAAW,GACXC,EAAY5B,EACZ7a,EAAM,GACNoc,EAAe,GACfznB,EAAIilB,EAAK,OAAS,EAGlB8C,EAAc,EAElB,KAAO/nB,GAAKkmB,EAAS,EAAElmB,EAAG,CAEtB,GADAyO,EAAOwW,EAAK,WAAWjlB,CAAC,EACpB6kB,EAAgBpW,CAAI,EAAG,CAGvB,GAAI,CAACgZ,EAAc,CACfK,EAAY9nB,EAAI,EAChB,KACJ,CACA,QACJ,CACIqL,IAAQ,KAGRoc,EAAe,GACfpc,EAAMrL,EAAI,GAEVyO,IAASsV,GAEL8D,IAAa,GACbA,EAAW7nB,EAEN+nB,IAAgB,IACrBA,EAAc,GAGbF,IAAa,KAGlBE,EAAc,GAEtB,CACA,OAAI1c,IAAQ,KACJwc,IAAa,IAEbE,IAAgB,GAEfA,IAAgB,GACbF,IAAaxc,EAAM,GACnBwc,IAAaC,EAAY,EAC7BE,EAAI,KAAOA,EAAI,KAAO/C,EAAK,MAAM6C,EAAWzc,CAAG,GAG/C2c,EAAI,KAAO/C,EAAK,MAAM6C,EAAWD,CAAQ,EACzCG,EAAI,KAAO/C,EAAK,MAAM6C,EAAWzc,CAAG,EACpC2c,EAAI,IAAM/C,EAAK,MAAM4C,EAAUxc,CAAG,IAMtCyc,EAAY,GAAKA,IAAc5B,EAC/B8B,EAAI,IAAM/C,EAAK,MAAM,EAAG6C,EAAY,CAAC,EAGrCE,EAAI,IAAMA,EAAI,KAEXA,CACX,EACA,IAAK,KACL,UAAW,IACX,MAAO,KACP,MAAO,IACX,EACMC,IAAY,IAAM,CACpB,GAAIrD,GAAiB,CAGjB,MAAM1W,EAAS,MACf,MAAO,IAAM,CACT,MAAMga,EAAQ1E,GAAG,EAAG,QAAQtV,EAAQ,GAAG,EACvC,OAAOga,EAAM,MAAMA,EAAM,QAAQ,GAAG,CAAC,CACzC,CACJ,CAEA,MAAO,IAAM1E,GAAG,CACpB,GAAC,EACK2E,GAAQ,CAEV,WAAWrC,EAAc,CACrB,IAAI0B,EAAe,GACfvB,EAAmB,GACvB,QAASjmB,EAAI8lB,EAAa,OAAS,EAAG9lB,GAAK,GAAK,CAACimB,EAAkBjmB,IAAK,CACpE,MAAMilB,EAAOa,EAAa9lB,CAAC,EAC3B2kB,GAAeM,EAAM,SAASjlB,CAAC,GAAG,EAE9BilB,EAAK,SAAW,IAGpBuC,EAAe,GAAGvC,CAAI,IAAIuC,CAAY,GACtCvB,EAAmBhB,EAAK,WAAW,CAAC,IAAMjB,GAC9C,CACA,GAAI,CAACiC,EAAkB,CACnB,MAAMzC,EAAMyE,GAAQ,EACpBT,EAAe,GAAGhE,CAAG,IAAIgE,CAAY,GACrCvB,EACIzC,EAAI,WAAW,CAAC,IAAMQ,EAC9B,CAKA,OADAwD,EAAexC,GAAgBwC,EAAc,CAACvB,EAAkB,IAAKnB,EAAoB,EACrFmB,EACO,IAAIuB,CAAY,GAEpBA,EAAa,OAAS,EAAIA,EAAe,GACpD,EACA,UAAUvC,EAAM,CAEZ,GADAN,GAAeM,EAAM,MAAM,EACvBA,EAAK,SAAW,EAChB,MAAO,IAEX,MAAMmB,EAAanB,EAAK,WAAW,CAAC,IAAMjB,GACpCoE,EAAoBnD,EAAK,WAAWA,EAAK,OAAS,CAAC,IAAMjB,GAG/D,OADAiB,EAAOD,GAAgBC,EAAM,CAACmB,EAAY,IAAKtB,EAAoB,EAC/DG,EAAK,SAAW,EACZmB,EACO,IAEJgC,EAAoB,KAAO,KAElCA,IACAnD,GAAQ,KAELmB,EAAa,IAAInB,CAAI,GAAKA,EACrC,EACA,WAAWA,EAAM,CACb,OAAAN,GAAeM,EAAM,MAAM,EACpBA,EAAK,OAAS,GAAKA,EAAK,WAAW,CAAC,IAAMjB,EACrD,EACA,QAAQsC,EAAO,CACX,GAAIA,EAAM,SAAW,EACjB,MAAO,IAEX,MAAMrB,EAAO,CAAA,EACb,QAASjlB,EAAI,EAAGA,EAAIsmB,EAAM,OAAQ,EAAEtmB,EAAG,CACnC,MAAMqD,EAAMijB,EAAMtmB,CAAC,EACnB2kB,GAAethB,EAAK,MAAM,EACtBA,EAAI,OAAS,GACb4hB,EAAK,KAAK5hB,CAAG,CAErB,CACA,OAAI4hB,EAAK,SAAW,EACT,IAEJkD,GAAM,UAAUlD,EAAK,KAAK,GAAG,CAAC,CACzC,EACA,SAASjkB,EAAMyB,EAAI,CASf,GARAkiB,GAAe3jB,EAAM,MAAM,EAC3B2jB,GAAeliB,EAAI,IAAI,EACnBzB,IAASyB,IAIbzB,EAAOmnB,GAAM,QAAQnnB,CAAI,EACzByB,EAAK0lB,GAAM,QAAQ1lB,CAAE,EACjBzB,IAASyB,GACT,MAAO,GAEX,MAAMwkB,EAAY,EACZC,EAAUlmB,EAAK,OACf+lB,EAAUG,EAAUD,EACpBE,EAAU,EACVH,EAAQvkB,EAAG,OAAS0kB,EAEpB/kB,EAAU2kB,EAAUC,EAAQD,EAAUC,EAC5C,IAAIK,EAAgB,GAChBrnB,EAAI,EACR,KAAOA,EAAIoC,EAAQpC,IAAK,CACpB,MAAMsnB,EAAWtmB,EAAK,WAAWimB,EAAYjnB,CAAC,EAC9C,GAAIsnB,IAAa7kB,EAAG,WAAW0kB,EAAUnnB,CAAC,EACtC,MAEKsnB,IAAatD,KAClBqD,EAAgBrnB,EAExB,CACA,GAAIA,IAAMoC,EACN,GAAI4kB,EAAQ5kB,EAAQ,CAChB,GAAIK,EAAG,WAAW0kB,EAAUnnB,CAAC,IAAMgkB,GAG/B,OAAOvhB,EAAG,MAAM0kB,EAAUnnB,EAAI,CAAC,EAEnC,GAAIA,IAAM,EAGN,OAAOyC,EAAG,MAAM0kB,EAAUnnB,CAAC,CAEnC,MACS+mB,EAAU3kB,IACXpB,EAAK,WAAWimB,EAAYjnB,CAAC,IAAMgkB,GAGnCqD,EAAgBrnB,EAEXA,IAAM,IAGXqnB,EAAgB,IAI5B,IAAIE,EAAM,GAGV,IAAKvnB,EAAIinB,EAAYI,EAAgB,EAAGrnB,GAAKknB,EAAS,EAAElnB,GAChDA,IAAMknB,GAAWlmB,EAAK,WAAWhB,CAAC,IAAMgkB,MACxCuD,GAAOA,EAAI,SAAW,EAAI,KAAO,OAKzC,MAAO,GAAGA,CAAG,GAAG9kB,EAAG,MAAM0kB,EAAUE,CAAa,CAAC,EACrD,EACA,iBAAiBpC,EAAM,CAEnB,OAAOA,CACX,EACA,QAAQA,EAAM,CAEV,GADAN,GAAeM,EAAM,MAAM,EACvBA,EAAK,SAAW,EAChB,MAAO,IAEX,MAAMoD,EAAUpD,EAAK,WAAW,CAAC,IAAMjB,GACvC,IAAI3Y,EAAM,GACNoc,EAAe,GACnB,QAAS,EAAIxC,EAAK,OAAS,EAAG,GAAK,EAAG,EAAE,EACpC,GAAIA,EAAK,WAAW,CAAC,IAAMjB,IACvB,GAAI,CAACyD,EAAc,CACfpc,EAAM,EACN,KACJ,OAIAoc,EAAe,GAGvB,OAAIpc,IAAQ,GACDgd,EAAU,IAAM,IAEvBA,GAAWhd,IAAQ,EACZ,KAEJ4Z,EAAK,MAAM,EAAG5Z,CAAG,CAC5B,EACA,SAAS4Z,EAAMyC,EAAQ,CACfA,IAAW,QACX/C,GAAe+C,EAAQ,QAAQ,EAEnC/C,GAAeM,EAAM,MAAM,EAC3B,IAAIrI,EAAQ,EACRvR,EAAM,GACNoc,EAAe,GACfznB,EACJ,GAAI0nB,IAAW,QAAaA,EAAO,OAAS,GAAKA,EAAO,QAAUzC,EAAK,OAAQ,CAC3E,GAAIyC,IAAWzC,EACX,MAAO,GAEX,IAAI0C,EAASD,EAAO,OAAS,EACzBE,EAAmB,GACvB,IAAK5nB,EAAIilB,EAAK,OAAS,EAAGjlB,GAAK,EAAG,EAAEA,EAAG,CACnC,MAAMyO,EAAOwW,EAAK,WAAWjlB,CAAC,EAC9B,GAAIyO,IAASuV,IAGT,GAAI,CAACyD,EAAc,CACf7K,EAAQ5c,EAAI,EACZ,KACJ,OAGI4nB,IAAqB,KAGrBH,EAAe,GACfG,EAAmB5nB,EAAI,GAEvB2nB,GAAU,IAENlZ,IAASiZ,EAAO,WAAWC,CAAM,EAC7B,EAAEA,IAAW,KAGbtc,EAAMrL,IAMV2nB,EAAS,GACTtc,EAAMuc,GAItB,CACA,OAAIhL,IAAUvR,EACVA,EAAMuc,EAEDvc,IAAQ,KACbA,EAAM4Z,EAAK,QAERA,EAAK,MAAMrI,EAAOvR,CAAG,CAChC,CACA,IAAKrL,EAAIilB,EAAK,OAAS,EAAGjlB,GAAK,EAAG,EAAEA,EAChC,GAAIilB,EAAK,WAAWjlB,CAAC,IAAMgkB,IAGvB,GAAI,CAACyD,EAAc,CACf7K,EAAQ5c,EAAI,EACZ,KACJ,OAEKqL,IAAQ,KAGboc,EAAe,GACfpc,EAAMrL,EAAI,GAGlB,OAAIqL,IAAQ,GACD,GAEJ4Z,EAAK,MAAMrI,EAAOvR,CAAG,CAChC,EACA,QAAQ4Z,EAAM,CACVN,GAAeM,EAAM,MAAM,EAC3B,IAAI4C,EAAW,GACXC,EAAY,EACZzc,EAAM,GACNoc,EAAe,GAGfM,EAAc,EAClB,QAAS/nB,EAAIilB,EAAK,OAAS,EAAGjlB,GAAK,EAAG,EAAEA,EAAG,CACvC,MAAMsoB,EAAOrD,EAAKjlB,CAAC,EACnB,GAAIsoB,IAAS,IAAK,CAGd,GAAI,CAACb,EAAc,CACfK,EAAY9nB,EAAI,EAChB,KACJ,CACA,QACJ,CACIqL,IAAQ,KAGRoc,EAAe,GACfpc,EAAMrL,EAAI,GAEVsoB,IAAS,IAELT,IAAa,GACbA,EAAW7nB,EAEN+nB,IAAgB,IACrBA,EAAc,GAGbF,IAAa,KAGlBE,EAAc,GAEtB,CACA,OAAIF,IAAa,IACbxc,IAAQ,IAER0c,IAAgB,GAEfA,IAAgB,GACbF,IAAaxc,EAAM,GACnBwc,IAAaC,EAAY,EACtB,GAEJ7C,EAAK,MAAM4C,EAAUxc,CAAG,CACnC,EACA,OAAQI,GAAQ,KAAK,KAAM,GAAG,EAC9B,MAAMwZ,EAAM,CACRN,GAAeM,EAAM,MAAM,EAC3B,MAAM+C,EAAM,CAAE,KAAM,GAAI,IAAK,GAAI,KAAM,GAAI,IAAK,GAAI,KAAM,EAAE,EAC5D,GAAI/C,EAAK,SAAW,EAChB,OAAO+C,EAEX,MAAM5B,EAAanB,EAAK,WAAW,CAAC,IAAMjB,GAC1C,IAAIpH,EACAwJ,GACA4B,EAAI,KAAO,IACXpL,EAAQ,GAGRA,EAAQ,EAEZ,IAAIiL,EAAW,GACXC,EAAY,EACZzc,EAAM,GACNoc,EAAe,GACfznB,EAAIilB,EAAK,OAAS,EAGlB8C,EAAc,EAElB,KAAO/nB,GAAK4c,EAAO,EAAE5c,EAAG,CACpB,MAAMyO,EAAOwW,EAAK,WAAWjlB,CAAC,EAC9B,GAAIyO,IAASuV,GAAoB,CAG7B,GAAI,CAACyD,EAAc,CACfK,EAAY9nB,EAAI,EAChB,KACJ,CACA,QACJ,CACIqL,IAAQ,KAGRoc,EAAe,GACfpc,EAAMrL,EAAI,GAEVyO,IAASsV,GAEL8D,IAAa,GACbA,EAAW7nB,EAEN+nB,IAAgB,IACrBA,EAAc,GAGbF,IAAa,KAGlBE,EAAc,GAEtB,CACA,GAAI1c,IAAQ,GAAI,CACZ,MAAMuR,EAAQkL,IAAc,GAAK1B,EAAa,EAAI0B,EAC9CD,IAAa,IAEbE,IAAgB,GAEfA,IAAgB,GACbF,IAAaxc,EAAM,GACnBwc,IAAaC,EAAY,EAC7BE,EAAI,KAAOA,EAAI,KAAO/C,EAAK,MAAMrI,EAAOvR,CAAG,GAG3C2c,EAAI,KAAO/C,EAAK,MAAMrI,EAAOiL,CAAQ,EACrCG,EAAI,KAAO/C,EAAK,MAAMrI,EAAOvR,CAAG,EAChC2c,EAAI,IAAM/C,EAAK,MAAM4C,EAAUxc,CAAG,EAE1C,CACA,OAAIyc,EAAY,EACZE,EAAI,IAAM/C,EAAK,MAAM,EAAG6C,EAAY,CAAC,EAEhC1B,IACL4B,EAAI,IAAM,KAEPA,CACX,EACA,IAAK,IACL,UAAW,IACX,MAAO,KACP,MAAO,IACX,EACAG,GAAM,MAAQtC,GAAM,MAAQA,GAC5BsC,GAAM,MAAQtC,GAAM,MAAQsC,GACTvD,GAAkBiB,GAAM,UAAYsC,GAAM,UAC5CvD,GAAkBiB,GAAM,QAAUsC,GAAM,QACvCvD,GAAkBiB,GAAM,SAAWsC,GAAM,SAC1CvD,GAAkBiB,GAAM,QAAUsC,GAAM,QACvCvD,GAAkBiB,GAAM,SAAWsC,GAAM,SAC1CvD,GAAkBiB,GAAM,QAAUsC,GAAM,QAC5CvD,GAAkBiB,GAAM,IAAMsC,GAAM,ICj6CjD,MAAMI,GAAiB,iBACjBC,GAAoB,MACpBC,GAAoB,QAC1B,SAASC,GAAaV,EAAKW,EAAS,CAEhC,GAAI,CAACX,EAAI,QAAUW,EACf,MAAM,IAAI,MAAM,2DAA2DX,EAAI,SAAS,aAAaA,EAAI,IAAI,cAAcA,EAAI,KAAK,iBAAiBA,EAAI,QAAQ,IAAI,EAIzK,GAAIA,EAAI,QAAU,CAACO,GAAe,KAAKP,EAAI,MAAM,EAC7C,MAAM,IAAI,MAAM,iDAAiD,EAOrE,GAAIA,EAAI,MACJ,GAAIA,EAAI,WACJ,GAAI,CAACQ,GAAkB,KAAKR,EAAI,IAAI,EAChC,MAAM,IAAI,MAAM,0IAA0I,UAI1JS,GAAkB,KAAKT,EAAI,IAAI,EAC/B,MAAM,IAAI,MAAM,2HAA2H,EAI3J,CAKA,SAASY,GAAWC,EAAQF,EAAS,CACjC,MAAI,CAACE,GAAU,CAACF,EACL,OAEJE,CACX,CAEA,SAASC,GAAqBD,EAAQ5D,EAAM,CAKxC,OAAQ4D,EAAM,CACV,IAAK,QACL,IAAK,OACL,IAAK,OACI5D,EAGIA,EAAK,CAAC,IAAM8D,KACjB9D,EAAO8D,GAAS9D,GAHhBA,EAAO8D,GAKX,KACZ,CACI,OAAO9D,CACX,CACA,MAAMvkB,EAAS,GACTqoB,GAAS,IACTC,GAAU,+DAiBhB,IAAAC,GAAA,MAAMC,EAAI,CACN,OAAO,MAAMzoB,EAAO,CAChB,OAAIA,aAAiByoB,GACV,GAEP,CAACzoB,GAAS,OAAOA,GAAU,SACpB,GAEJ,OAAOA,EAAM,WAAc,UAC3B,OAAOA,EAAM,UAAa,UAC1B,OAAOA,EAAM,MAAS,UACtB,OAAOA,EAAM,OAAU,UACvB,OAAOA,EAAM,QAAW,UACxB,OAAOA,EAAM,QAAW,UACxB,OAAOA,EAAM,MAAS,YACtB,OAAOA,EAAM,UAAa,UACrC,CAIA,YAAY0oB,EAAcC,EAAWnE,EAAMoE,EAAOC,EAAUX,EAAU,GAAO,CACrE,OAAOQ,GAAiB,UACxB,KAAK,OAASA,EAAa,QAAUzoB,EACrC,KAAK,UAAYyoB,EAAa,WAAazoB,EAC3C,KAAK,KAAOyoB,EAAa,MAAQzoB,EACjC,KAAK,MAAQyoB,EAAa,OAASzoB,EACnC,KAAK,SAAWyoB,EAAa,UAAYzoB,IAMzC,KAAK,OAASkoB,GAAWO,EAAcR,CAAO,EAC9C,KAAK,UAAYS,GAAa1oB,EAC9B,KAAK,KAAOooB,GAAqB,KAAK,OAAQ7D,GAAQvkB,CAAM,EAC5D,KAAK,MAAQ2oB,GAAS3oB,EACtB,KAAK,SAAW4oB,GAAY5oB,EAC5BgoB,GAAa,KAAMC,CAAO,EAElC,CA0BA,IAAI,QAAS,CAIT,OAAOY,GAAY,KAAM,EAAK,CAClC,CAEA,KAAKnR,EAAQ,CACT,GAAI,CAACA,EACD,OAAO,KAEX,GAAI,CAAE,OAAAyQ,EAAQ,UAAAO,EAAW,KAAAnE,EAAM,MAAAoE,EAAO,SAAAC,CAAQ,EAAKlR,EA+BnD,OA9BIyQ,IAAW,OACXA,EAAS,KAAK,OAETA,IAAW,OAChBA,EAASnoB,GAET0oB,IAAc,OACdA,EAAY,KAAK,UAEZA,IAAc,OACnBA,EAAY1oB,GAEZukB,IAAS,OACTA,EAAO,KAAK,KAEPA,IAAS,OACdA,EAAOvkB,GAEP2oB,IAAU,OACVA,EAAQ,KAAK,MAERA,IAAU,OACfA,EAAQ3oB,GAER4oB,IAAa,OACbA,EAAW,KAAK,SAEXA,IAAa,OAClBA,EAAW5oB,GAEXmoB,IAAW,KAAK,QACbO,IAAc,KAAK,WACnBnE,IAAS,KAAK,MACdoE,IAAU,KAAK,OACfC,IAAa,KAAK,SACd,KAEJ,IAAIE,GAAIX,EAAQO,EAAWnE,EAAMoE,EAAOC,CAAQ,CAC3D,CAQA,OAAO,MAAM9pB,EAAOmpB,EAAU,GAAO,CACjC,MAAMjd,EAAQsd,GAAQ,KAAKxpB,CAAK,EAChC,OAAKkM,EAGE,IAAI8d,GAAI9d,EAAM,CAAC,GAAKhL,EAAQ+oB,GAAc/d,EAAM,CAAC,GAAKhL,CAAM,EAAG+oB,GAAc/d,EAAM,CAAC,GAAKhL,CAAM,EAAG+oB,GAAc/d,EAAM,CAAC,GAAKhL,CAAM,EAAG+oB,GAAc/d,EAAM,CAAC,GAAKhL,CAAM,EAAGioB,CAAO,EAF3K,IAAIa,GAAI9oB,EAAQA,EAAQA,EAAQA,EAAQA,CAAM,CAG7D,CAsBA,OAAO,KAAKukB,EAAM,CACd,IAAImE,EAAY1oB,EAShB,GALIoM,KACAmY,EAAOA,EAAK,QAAQ,MAAO8D,EAAM,GAIjC9D,EAAK,CAAC,IAAM8D,IAAU9D,EAAK,CAAC,IAAM8D,GAAQ,CAC1C,MAAMlI,EAAMoE,EAAK,QAAQ8D,GAAQ,CAAC,EAC9BlI,IAAQ,IACRuI,EAAYnE,EAAK,UAAU,CAAC,EAC5BA,EAAO8D,KAGPK,EAAYnE,EAAK,UAAU,EAAGpE,CAAG,EACjCoE,EAAOA,EAAK,UAAUpE,CAAG,GAAKkI,GAEtC,CACA,OAAO,IAAIS,GAAI,OAAQJ,EAAWnE,EAAMvkB,EAAQA,CAAM,CAC1D,CAQA,OAAO,KAAKgpB,EAAYC,EAAQ,CAE5B,OADe,IAAIH,GAAIE,EAAW,OAAQA,EAAW,UAAWA,EAAW,KAAMA,EAAW,MAAOA,EAAW,SAAUC,CAAM,CAElI,CAQA,OAAO,SAASC,KAAQC,EAAc,CAClC,GAAI,CAACD,EAAI,KACL,MAAM,IAAI,MAAM,sDAAsD,EAE1E,IAAIE,EACJ,OAAIhd,IAAa8c,EAAI,SAAW,OAC5BE,EAAUZ,GAAI,KAAKrD,GAAM,KAAK0D,GAAYK,EAAK,EAAI,EAAG,GAAGC,CAAY,CAAC,EAAE,KAGxEC,EAAU3B,GAAM,KAAKyB,EAAI,KAAM,GAAGC,CAAY,EAE3CD,EAAI,KAAK,CAAE,KAAME,CAAO,CAAE,CACrC,CAaA,SAASC,EAAe,GAAO,CAC3B,OAAOC,GAAa,KAAMD,CAAY,CAC1C,CACA,QAAS,CACL,OAAO,IACX,CACA,OAAO,OAAOle,EAAM,CAChB,GAAKA,EAGA,IAAIA,aAAgBqd,GACrB,OAAOrd,EAEN,CACD,MAAMxM,EAAS,IAAImqB,GAAI3d,CAAI,EAC3B,OAAAxM,EAAO,WAAawM,EAAK,UAAY,KACrCxM,EAAO,QAAUwM,EAAK,OAASoe,GAAiBpe,EAAK,QAAU,KAAO,KAC/DxM,CACX,MAVI,QAAOwM,CAWf,CACJ,EACA,MAAMoe,GAAiBnd,GAAY,EAAI,OAEvC,MAAM0c,WAAYN,EAAI,CAClB,aAAc,CACV,MAAM,GAAG,SAAS,EAClB,KAAK,WAAa,KAClB,KAAK,QAAU,IACnB,CACA,IAAI,QAAS,CACT,OAAK,KAAK,UACN,KAAK,QAAUK,GAAY,KAAM,EAAK,GAEnC,KAAK,OAChB,CACA,SAASQ,EAAe,GAAO,CAC3B,OAAKA,EAQMC,GAAa,KAAM,EAAI,GAPzB,KAAK,aACN,KAAK,WAAaA,GAAa,KAAM,EAAK,GAEvC,KAAK,WAMpB,CACA,QAAS,CAEL,MAAMtlB,EAAM,CACR,KAAM,CAClB,EAEQ,OAAI,KAAK,UACLA,EAAI,OAAS,KAAK,QAClBA,EAAI,KAAOulB,IAEX,KAAK,aACLvlB,EAAI,SAAW,KAAK,YAGpB,KAAK,OACLA,EAAI,KAAO,KAAK,MAMhB,KAAK,SACLA,EAAI,OAAS,KAAK,QAElB,KAAK,YACLA,EAAI,UAAY,KAAK,WAErB,KAAK,QACLA,EAAI,MAAQ,KAAK,OAEjB,KAAK,WACLA,EAAI,SAAW,KAAK,UAEjBA,CACX,CACJ,CAEA,MAAMwlB,GAAc,CACf,GAA0B,MAC1B,GAA0B,MAC1B,GAAiC,MACjC,GAAyB,MACzB,GAAsC,MACtC,GAAuC,MACvC,GAA2B,MAC3B,GAAoC,MACpC,GAA+B,MAC/B,GAA8B,MAC9B,GAAgC,MAChC,GAA8B,MAC9B,GAA+B,MAC/B,GAA6B,MAC7B,GAAyB,MACzB,GAA0B,MAC1B,GAA8B,MAC9B,GAA2B,MAC3B,GAA0B,KAC/B,EACA,SAASC,GAAuBC,EAAcC,EAAQC,EAAa,CAC/D,IAAI5lB,EACA6lB,EAAkB,GACtB,QAAS9O,EAAM,EAAGA,EAAM2O,EAAa,OAAQ3O,IAAO,CAChD,MAAMhN,EAAO2b,EAAa,WAAW3O,CAAG,EAExC,GAAKhN,GAAQ,IAAuBA,GAAQ,KACpCA,GAAQ,IAAuBA,GAAQ,IACvCA,GAAQ,IAA4BA,GAAQ,IAC7CA,IAAS,IACTA,IAAS,IACTA,IAAS,IACTA,IAAS,KACR4b,GAAU5b,IAAS,IACnB6b,GAAe7b,IAAS,IACxB6b,GAAe7b,IAAS,IACxB6b,GAAe7b,IAAS,GAExB8b,IAAoB,KACpB7lB,GAAO,mBAAmB0lB,EAAa,UAAUG,EAAiB9O,CAAG,CAAC,EACtE8O,EAAkB,IAGlB7lB,IAAQ,SACRA,GAAO0lB,EAAa,OAAO3O,CAAG,OAGjC,CAEG/W,IAAQ,SACRA,EAAM0lB,EAAa,OAAO,EAAG3O,CAAG,GAGpC,MAAM+O,EAAUN,GAAYzb,CAAI,EAC5B+b,IAAY,QAERD,IAAoB,KACpB7lB,GAAO,mBAAmB0lB,EAAa,UAAUG,EAAiB9O,CAAG,CAAC,EACtE8O,EAAkB,IAGtB7lB,GAAO8lB,GAEFD,IAAoB,KAEzBA,EAAkB9O,EAE1B,CACJ,CACA,OAAI8O,IAAoB,KACpB7lB,GAAO,mBAAmB0lB,EAAa,UAAUG,CAAe,CAAC,GAE9D7lB,IAAQ,OAAYA,EAAM0lB,CACrC,CACA,SAASK,GAA0BxF,EAAM,CACrC,IAAIvgB,EACJ,QAAS+W,EAAM,EAAGA,EAAMwJ,EAAK,OAAQxJ,IAAO,CACxC,MAAMhN,EAAOwW,EAAK,WAAWxJ,CAAG,EAC5BhN,IAAS,IAA0BA,IAAS,IACxC/J,IAAQ,SACRA,EAAMugB,EAAK,OAAO,EAAGxJ,CAAG,GAE5B/W,GAAOwlB,GAAYzb,CAAI,GAGnB/J,IAAQ,SACRA,GAAOugB,EAAKxJ,CAAG,EAG3B,CACA,OAAO/W,IAAQ,OAAYA,EAAMugB,CACrC,CAIA,SAASsE,GAAYK,EAAKc,EAAuB,CAC7C,IAAIlrB,EACJ,OAAIoqB,EAAI,WAAaA,EAAI,KAAK,OAAS,GAAKA,EAAI,SAAW,OAEvDpqB,EAAQ,KAAKoqB,EAAI,SAAS,GAAGA,EAAI,IAAI,GAEhCA,EAAI,KAAK,WAAW,CAAC,IAAM,KAC5BA,EAAI,KAAK,WAAW,CAAC,GAAK,IAAuBA,EAAI,KAAK,WAAW,CAAC,GAAK,IAAuBA,EAAI,KAAK,WAAW,CAAC,GAAK,IAAuBA,EAAI,KAAK,WAAW,CAAC,GAAK,MAC9KA,EAAI,KAAK,WAAW,CAAC,IAAM,GACzBc,EAKDlrB,EAAQoqB,EAAI,KAAK,OAAO,CAAC,EAHzBpqB,EAAQoqB,EAAI,KAAK,CAAC,EAAE,YAAW,EAAKA,EAAI,KAAK,OAAO,CAAC,EAQzDpqB,EAAQoqB,EAAI,KAEZ9c,KACAtN,EAAQA,EAAM,QAAQ,MAAO,IAAI,GAE9BA,CACX,CAIA,SAASwqB,GAAaJ,EAAKG,EAAc,CACrC,MAAMY,EAAWZ,EAEXU,GADAN,GAEN,IAAIzlB,EAAM,GACN,CAAE,OAAAmkB,EAAQ,UAAAO,EAAW,KAAAnE,EAAM,MAAAoE,EAAO,SAAAC,CAAQ,EAAKM,EASnD,GARIf,IACAnkB,GAAOmkB,EACPnkB,GAAO,MAEP0kB,GAAaP,IAAW,UACxBnkB,GAAOqkB,GACPrkB,GAAOqkB,IAEPK,EAAW,CACX,IAAIvI,EAAMuI,EAAU,QAAQ,GAAG,EAC/B,GAAIvI,IAAQ,GAAI,CAEZ,MAAM+J,EAAWxB,EAAU,OAAO,EAAGvI,CAAG,EACxCuI,EAAYA,EAAU,OAAOvI,EAAM,CAAC,EACpCA,EAAM+J,EAAS,YAAY,GAAG,EAC1B/J,IAAQ,GACRnc,GAAOimB,EAAQC,EAAU,GAAO,EAAK,GAIrClmB,GAAOimB,EAAQC,EAAS,OAAO,EAAG/J,CAAG,EAAG,GAAO,EAAK,EACpDnc,GAAO,IACPA,GAAOimB,EAAQC,EAAS,OAAO/J,EAAM,CAAC,EAAG,GAAO,EAAI,GAExDnc,GAAO,GACX,CACA0kB,EAAYA,EAAU,YAAW,EACjCvI,EAAMuI,EAAU,YAAY,GAAG,EAC3BvI,IAAQ,GACRnc,GAAOimB,EAAQvB,EAAW,GAAO,EAAI,GAIrC1kB,GAAOimB,EAAQvB,EAAU,OAAO,EAAGvI,CAAG,EAAG,GAAO,EAAI,EACpDnc,GAAO0kB,EAAU,OAAOvI,CAAG,EAEnC,CACA,GAAIoE,EAAM,CAEN,GAAIA,EAAK,QAAU,GAAKA,EAAK,WAAW,CAAC,IAAM,IAA2BA,EAAK,WAAW,CAAC,IAAM,GAAyB,CACtH,MAAMxW,EAAOwW,EAAK,WAAW,CAAC,EAC1BxW,GAAQ,IAAuBA,GAAQ,KACvCwW,EAAO,IAAI,OAAO,aAAaxW,EAAO,EAAE,CAAC,IAAIwW,EAAK,OAAO,CAAC,CAAC,GAEnE,SACSA,EAAK,QAAU,GAAKA,EAAK,WAAW,CAAC,IAAM,GAAyB,CACzE,MAAMxW,EAAOwW,EAAK,WAAW,CAAC,EAC1BxW,GAAQ,IAAuBA,GAAQ,KACvCwW,EAAO,GAAG,OAAO,aAAaxW,EAAO,EAAE,CAAC,IAAIwW,EAAK,OAAO,CAAC,CAAC,GAElE,CAEAvgB,GAAOimB,EAAQ1F,EAAM,GAAM,EAAK,CACpC,CACA,OAAIoE,IACA3kB,GAAO,IACPA,GAAOimB,EAAQtB,EAAO,GAAO,EAAK,GAElCC,IACA5kB,GAAO,IACPA,GAAQqlB,EAAgET,EAAjDa,GAAuBb,EAAU,GAAO,EAAK,GAEjE5kB,CACX,CAEA,SAASmmB,GAA2BzqB,EAAK,CACrC,GAAI,CACA,OAAO,mBAAmBA,CAAG,CACjC,MACM,CACF,OAAIA,EAAI,OAAS,EACNA,EAAI,OAAO,EAAG,CAAC,EAAIyqB,GAA2BzqB,EAAI,OAAO,CAAC,CAAC,EAG3DA,CAEf,CACJ,CACA,MAAM0qB,GAAiB,8BACvB,SAASrB,GAAcrpB,EAAK,CACxB,OAAKA,EAAI,MAAM0qB,EAAc,EAGtB1qB,EAAI,QAAQ0qB,GAAiBpf,GAAUmf,GAA2Bnf,CAAK,CAAC,EAFpEtL,CAGf,CChlBA,MAAM2qB,WAAkBpP,CAAM,CAC1B,YAAYqP,EAA0BC,EAAsBC,EAAoBC,EAAgB,CAC5F,MAAMH,EAA0BC,EAAsBC,EAAoBC,CAAc,EACxF,KAAK,yBAA2BH,EAChC,KAAK,qBAAuBC,EAC5B,KAAK,mBAAqBC,EAC1B,KAAK,eAAiBC,CAC1B,CAIA,UAAW,CACP,MAAO,IAAM,KAAK,yBAA2B,IAAM,KAAK,qBAAuB,OAAS,KAAK,mBAAqB,IAAM,KAAK,eAAiB,GAClJ,CAIA,gBAAgB/P,EAAO,CACnB,OAAQ2P,GAAU,gBAAgB,KAAM3P,CAAK,CACjD,CAIA,OAAO,gBAAgBnb,EAAGC,EAAG,CACzB,OAAQD,EAAE,2BAA6BC,EAAE,0BACrCD,EAAE,uBAAyBC,EAAE,sBAC7BD,EAAE,qBAAuBC,EAAE,oBAC3BD,EAAE,iBAAmBC,EAAE,cAC/B,CAIA,cAAe,CACX,OAAI,KAAK,2BAA6B,KAAK,iBAAmB,KAAK,uBAAyB,KAAK,YACtF,EAEJ,CACX,CAIA,eAAe4b,EAAeC,EAAW,CACrC,OAAI,KAAK,aAAY,IAAO,EACjB,IAAIgP,GAAU,KAAK,gBAAiB,KAAK,YAAajP,EAAeC,CAAS,EAElF,IAAIgP,GAAUjP,EAAeC,EAAW,KAAK,gBAAiB,KAAK,WAAW,CACzF,CAIA,aAAc,CACV,OAAO,IAAIlB,EAAS,KAAK,mBAAoB,KAAK,cAAc,CACpE,CAIA,mBAAoB,CAChB,OAAO,IAAIA,EAAS,KAAK,yBAA0B,KAAK,oBAAoB,CAChF,CAIA,iBAAiBe,EAAiBC,EAAa,CAC3C,OAAI,KAAK,aAAY,IAAO,EACjB,IAAIkP,GAAUnP,EAAiBC,EAAa,KAAK,cAAe,KAAK,SAAS,EAElF,IAAIkP,GAAU,KAAK,cAAe,KAAK,UAAWnP,EAAiBC,CAAW,CACzF,CAKA,OAAO,cAAce,EAAOvR,EAAMuR,EAAO,CACrC,OAAO,IAAImO,GAAUnO,EAAM,WAAYA,EAAM,OAAQvR,EAAI,WAAYA,EAAI,MAAM,CACnF,CAIA,OAAO,UAAU2Q,EAAOoP,EAAW,CAC/B,OAAIA,IAAc,EACP,IAAIL,GAAU/O,EAAM,gBAAiBA,EAAM,YAAaA,EAAM,cAAeA,EAAM,SAAS,EAG5F,IAAI+O,GAAU/O,EAAM,cAAeA,EAAM,UAAWA,EAAM,gBAAiBA,EAAM,WAAW,CAE3G,CAIA,OAAO,cAAcqP,EAAK,CACtB,OAAO,IAAIN,GAAUM,EAAI,yBAA0BA,EAAI,qBAAsBA,EAAI,mBAAoBA,EAAI,cAAc,CAC3H,CAIA,OAAO,mBAAmBprB,EAAGC,EAAG,CAC5B,GAAID,GAAK,CAACC,GAAK,CAACD,GAAKC,EACjB,MAAO,GAEX,GAAI,CAACD,GAAK,CAACC,EACP,MAAO,GAEX,GAAID,EAAE,SAAWC,EAAE,OACf,MAAO,GAEX,QAASF,EAAI,EAAGmN,EAAMlN,EAAE,OAAQD,EAAImN,EAAKnN,IACrC,GAAI,CAAC,KAAK,gBAAgBC,EAAED,CAAC,EAAGE,EAAEF,CAAC,CAAC,EAChC,MAAO,GAGf,MAAO,EACX,CAIA,OAAO,aAAaM,EAAK,CACrB,MAAQ,CAAC,CAACA,GACF,OAAOA,EAAI,0BAA6B,UACxC,OAAOA,EAAI,sBAAyB,UACpC,OAAOA,EAAI,oBAAuB,UAClC,OAAOA,EAAI,gBAAmB,QAC1C,CAIA,OAAO,oBAAoBsb,EAAiBC,EAAaC,EAAeC,EAAWqP,EAAW,CAC1F,OAAIA,IAAc,EACP,IAAIL,GAAUnP,EAAiBC,EAAaC,EAAeC,CAAS,EAExE,IAAIgP,GAAUjP,EAAeC,EAAWH,EAAiBC,CAAW,CAC/E,CACJ,CC5IA,MAAMyP,GAAyB,OAAO,OAAO,IAAI,EACjD,SAASC,EAASjjB,EAAIkjB,EAAe,CACjC,GAAIrrB,GAASqrB,CAAa,EAAG,CACzB,MAAMpY,EAAMkY,GAAuBE,CAAa,EAChD,GAAIpY,IAAQ,OACR,MAAM,IAAI,MAAM,GAAG9K,CAAE,mCAAmCkjB,CAAa,EAAE,EAE3EA,EAAgBpY,CACpB,CACA,OAAAkY,GAAuBhjB,CAAE,EAAIkjB,EACtB,CAAE,GAAAljB,CAAE,CACf,CCJA,MAAMmjB,GAAkB,CACpB,IAAKF,EAAS,MAAO,GAAM,EAC3B,KAAMA,EAAS,OAAQ,GAAM,EAC7B,QAASA,EAAS,WAAY,GAAM,EACpC,WAAYA,EAAS,cAAe,GAAM,EAC1C,UAAWA,EAAS,YAAa,KAAM,EACvC,UAAWA,EAAS,aAAc,KAAM,EACxC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,WAAYA,EAAS,cAAe,KAAM,EAC1C,SAAUA,EAAS,YAAa,KAAM,EACtC,WAAYA,EAAS,cAAe,KAAM,EAC1C,eAAgBA,EAAS,mBAAoB,KAAM,EACnD,wBAAyBA,EAAS,6BAA8B,KAAM,EACtE,WAAYA,EAAS,cAAe,KAAM,EAC1C,SAAUA,EAAS,WAAY,KAAM,EACrC,IAAKA,EAAS,MAAO,KAAM,EAC3B,oBAAqBA,EAAS,yBAA0B,KAAM,EAC9D,OAAQA,EAAS,UAAW,KAAM,EAClC,UAAWA,EAAS,aAAc,KAAM,EACxC,OAAQA,EAAS,SAAU,KAAM,EACjC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,OAAQA,EAAS,SAAU,KAAM,EACjC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,QAASA,EAAS,WAAY,KAAM,EACpC,WAAYA,EAAS,cAAe,KAAM,EAC1C,UAAWA,EAAS,aAAc,KAAM,EACxC,QAASA,EAAS,UAAW,KAAM,EACnC,WAAYA,EAAS,cAAe,KAAM,EAC1C,MAAOA,EAAS,QAAS,KAAM,EAC/B,QAASA,EAAS,UAAW,KAAM,EACnC,OAAQA,EAAS,SAAU,KAAM,EACjC,WAAYA,EAAS,cAAe,KAAM,EAC1C,OAAQA,EAAS,UAAW,KAAM,EAClC,QAASA,EAAS,WAAY,KAAM,EACpC,MAAOA,EAAS,SAAU,KAAM,EAChC,OAAQA,EAAS,UAAW,KAAM,EAClC,IAAKA,EAAS,MAAO,KAAM,EAC3B,WAAYA,EAAS,cAAe,KAAM,EAC1C,SAAUA,EAAS,YAAa,KAAM,EACtC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,WAAYA,EAAS,cAAe,KAAM,EAC1C,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,wBAAyBA,EAAS,4BAA6B,KAAM,EACrE,UAAWA,EAAS,aAAc,KAAM,EACxC,0BAA2BA,EAAS,8BAA+B,KAAM,EACzE,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,KAAMA,EAAS,OAAQ,KAAM,EAC7B,OAAQA,EAAS,SAAU,KAAM,EACjC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,YAAaA,EAAS,eAAgB,KAAM,EAC5C,YAAaA,EAAS,eAAgB,KAAM,EAC5C,eAAgBA,EAAS,mBAAoB,KAAM,EACnD,KAAMA,EAAS,OAAQ,KAAM,EAC7B,cAAeA,EAAS,iBAAkB,KAAM,EAChD,MAAOA,EAAS,QAAS,KAAM,EAC/B,YAAaA,EAAS,eAAgB,KAAM,EAC5C,EAAGA,EAAS,IAAK,KAAM,EACvB,SAAUA,EAAS,YAAa,KAAM,EACtC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,MAAOA,EAAS,QAAS,KAAM,EAC/B,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,OAAQA,EAAS,SAAU,KAAM,EACjC,WAAYA,EAAS,aAAc,KAAM,EACzC,GAAIA,EAAS,KAAM,KAAM,EACzB,cAAeA,EAAS,iBAAkB,KAAM,EAChD,KAAMA,EAAS,OAAQ,KAAM,EAC7B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,SAAUA,EAAS,WAAY,KAAM,EACrC,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,UAAWA,EAAS,aAAc,KAAM,EACxC,MAAOA,EAAS,QAAS,KAAM,EAC/B,aAAcA,EAAS,eAAgB,KAAM,EAC7C,mBAAoBA,EAAS,sBAAuB,KAAM,EAC1D,oBAAqBA,EAAS,uBAAwB,KAAM,EAC5D,QAASA,EAAS,WAAY,KAAM,EACpC,QAASA,EAAS,WAAY,KAAM,EACpC,UAAWA,EAAS,aAAc,KAAM,EACxC,oBAAqBA,EAAS,wBAAyB,KAAM,EAC7D,MAAOA,EAAS,QAAS,KAAM,EAC/B,SAAUA,EAAS,WAAY,KAAM,EACrC,QAASA,EAAS,UAAW,KAAM,EACnC,MAAOA,EAAS,QAAS,KAAM,EAC/B,OAAQA,EAAS,SAAU,KAAM,EACjC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,WAAYA,EAAS,cAAe,KAAM,EAC1C,WAAYA,EAAS,cAAe,KAAM,EAC1C,OAAQA,EAAS,SAAU,KAAM,EACjC,SAAUA,EAAS,WAAY,KAAM,EACrC,QAASA,EAAS,UAAW,KAAM,EACnC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,IAAKA,EAAS,MAAO,KAAM,EAC3B,YAAaA,EAAS,eAAgB,KAAM,EAC5C,MAAOA,EAAS,QAAS,KAAM,EAC/B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,SAAUA,EAAS,WAAY,KAAM,EACrC,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,MAAOA,EAAS,QAAS,KAAM,EAC/B,YAAaA,EAAS,eAAgB,KAAM,EAC5C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,kBAAmBA,EAAS,qBAAsB,KAAM,EACxD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,WAAYA,EAAS,cAAe,KAAM,EAC1C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,oBAAqBA,EAAS,wBAAyB,KAAM,EAC7D,UAAWA,EAAS,aAAc,KAAM,EACxC,WAAYA,EAAS,cAAe,KAAM,EAC1C,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,SAAUA,EAAS,aAAc,KAAM,EACvC,WAAYA,EAAS,cAAe,KAAM,EAC1C,YAAaA,EAAS,eAAgB,KAAM,EAC5C,YAAaA,EAAS,eAAgB,KAAM,EAC5C,WAAYA,EAAS,cAAe,KAAM,EAC1C,oBAAqBA,EAAS,uBAAwB,KAAM,EAC5D,QAASA,EAAS,UAAW,KAAM,EACnC,UAAWA,EAAS,aAAc,KAAM,EACxC,UAAWA,EAAS,aAAc,KAAM,EACxC,UAAWA,EAAS,aAAc,KAAM,EACxC,WAAYA,EAAS,cAAe,KAAM,EAC1C,eAAgBA,EAAS,mBAAoB,KAAM,EACnD,eAAgBA,EAAS,mBAAoB,KAAM,EACnD,gBAAiBA,EAAS,oBAAqB,KAAM,EACrD,aAAcA,EAAS,iBAAkB,KAAM,EAC/C,QAASA,EAAS,WAAY,KAAM,EACpC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,SAAUA,EAAS,WAAY,KAAM,EACrC,qCAAsCA,EAAS,0CAA2C,KAAM,EAChG,2BAA4BA,EAAS,+BAAgC,KAAM,EAC3E,mCAAoCA,EAAS,wCAAyC,KAAM,EAC5F,8BAA+BA,EAAS,mCAAoC,KAAM,EAClF,oBAAqBA,EAAS,wBAAyB,KAAM,EAC7D,4BAA6BA,EAAS,iCAAkC,KAAM,EAC9E,6BAA8BA,EAAS,kCAAmC,KAAM,EAChF,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,2BAA4BA,EAAS,gCAAiC,KAAM,EAC5E,UAAWA,EAAS,YAAa,KAAM,EACvC,UAAWA,EAAS,YAAa,KAAM,EACvC,QAASA,EAAS,UAAW,KAAM,EACnC,IAAKA,EAAS,MAAO,KAAM,EAC3B,SAAUA,EAAS,WAAY,KAAM,EACrC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,MAAOA,EAAS,QAAS,KAAM,EAC/B,UAAWA,EAAS,YAAa,KAAM,EACvC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,YAAaA,EAAS,eAAgB,KAAM,EAC5C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,UAAWA,EAAS,aAAc,KAAM,EACxC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,OAAQA,EAAS,SAAU,KAAM,EACjC,0BAA2BA,EAAS,8BAA+B,KAAM,EACzE,6BAA8BA,EAAS,iCAAkC,KAAM,EAC/E,YAAaA,EAAS,eAAgB,KAAM,EAC5C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,SAAUA,EAAS,YAAa,KAAM,EACtC,OAAQA,EAAS,SAAU,KAAM,EACjC,SAAUA,EAAS,YAAa,KAAM,EACtC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,YAAaA,EAAS,eAAgB,KAAM,EAC5C,UAAWA,EAAS,aAAc,KAAM,EACxC,kBAAmBA,EAAS,qBAAsB,KAAM,EACxD,WAAYA,EAAS,cAAe,KAAM,EAC1C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,UAAWA,EAAS,YAAa,KAAM,EACvC,SAAUA,EAAS,WAAY,KAAM,EACrC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,WAAYA,EAAS,cAAe,KAAM,EAC1C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,WAAYA,EAAS,cAAe,KAAM,EAC1C,cAAeA,EAAS,kBAAmB,KAAM,EACjD,aAAcA,EAAS,iBAAkB,KAAM,EAC/C,cAAeA,EAAS,kBAAmB,KAAM,EACjD,UAAWA,EAAS,aAAc,KAAM,EACxC,MAAOA,EAAS,QAAS,KAAM,EAC/B,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,UAAWA,EAAS,aAAc,KAAM,EACxC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,YAAaA,EAAS,eAAgB,KAAM,EAC5C,YAAaA,EAAS,eAAgB,KAAM,EAC5C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,QAASA,EAAS,UAAW,KAAM,EACnC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,YAAaA,EAAS,eAAgB,KAAM,EAC5C,QAASA,EAAS,UAAW,KAAM,EACnC,WAAYA,EAAS,aAAc,KAAM,EACzC,UAAWA,EAAS,aAAc,KAAM,EACxC,WAAYA,EAAS,cAAe,KAAM,EAC1C,SAAUA,EAAS,YAAa,KAAM,EACtC,UAAWA,EAAS,aAAc,KAAM,EACxC,QAASA,EAAS,WAAY,KAAM,EACpC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,qBAAsBA,EAAS,yBAA0B,KAAM,EAC/D,gBAAiBA,EAAS,oBAAqB,KAAM,EACrD,QAASA,EAAS,WAAY,KAAM,EACpC,MAAOA,EAAS,QAAS,KAAM,EAC/B,OAAQA,EAAS,SAAU,KAAM,EACjC,MAAOA,EAAS,QAAS,KAAM,EAC/B,SAAUA,EAAS,YAAa,KAAM,EACtC,OAAQA,EAAS,UAAW,KAAM,EAClC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,WAAYA,EAAS,cAAe,KAAM,EAC1C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,UAAWA,EAAS,aAAc,KAAM,EACxC,WAAYA,EAAS,cAAe,KAAM,EAC1C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,SAAUA,EAAS,YAAa,KAAM,EACtC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,UAAWA,EAAS,aAAc,KAAM,EACxC,MAAOA,EAAS,QAAS,KAAM,EAC/B,QAASA,EAAS,UAAW,KAAM,EACnC,MAAOA,EAAS,QAAS,KAAM,EAC/B,QAASA,EAAS,UAAW,KAAM,EACnC,MAAOA,EAAS,QAAS,KAAM,EAC/B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,MAAOA,EAAS,QAAS,KAAM,EAC/B,MAAOA,EAAS,QAAS,KAAM,EAC/B,cAAeA,EAAS,iBAAkB,KAAM,EAChD,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,cAAeA,EAAS,iBAAkB,KAAM,EAChD,IAAKA,EAAS,MAAO,KAAM,EAC3B,IAAKA,EAAS,MAAO,KAAM,EAC3B,iBAAkBA,EAAS,oBAAqB,KAAM,EACtD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,YAAaA,EAAS,eAAgB,KAAM,EAC5C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,UAAWA,EAAS,aAAc,KAAM,EACxC,QAASA,EAAS,UAAW,KAAM,EACnC,SAAUA,EAAS,WAAY,KAAM,EACrC,SAAUA,EAAS,YAAa,KAAM,EACtC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,SAAUA,EAAS,WAAY,KAAM,EACrC,UAAWA,EAAS,YAAa,KAAM,EACvC,QAASA,EAAS,UAAW,KAAM,EACnC,UAAWA,EAAS,YAAa,KAAM,EACvC,wBAAyBA,EAAS,6BAA8B,KAAM,EACtE,YAAaA,EAAS,eAAgB,KAAM,EAC5C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,KAAMA,EAAS,OAAQ,KAAM,EAC7B,UAAWA,EAAS,aAAc,KAAM,EACxC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,SAAUA,EAAS,WAAY,KAAM,EACrC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,QAASA,EAAS,UAAW,KAAM,EACnC,SAAUA,EAAS,WAAY,KAAM,EACrC,IAAKA,EAAS,MAAO,KAAM,EAC3B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,IAAKA,EAAS,MAAO,KAAM,EAC3B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,QAASA,EAAS,UAAW,KAAM,EACnC,QAASA,EAAS,UAAW,KAAM,EACnC,MAAOA,EAAS,QAAS,KAAM,EAC/B,SAAUA,EAAS,WAAY,KAAM,EACrC,MAAOA,EAAS,QAAS,KAAM,EAC/B,WAAYA,EAAS,cAAe,KAAM,EAC1C,UAAWA,EAAS,YAAa,KAAM,EACvC,WAAYA,EAAS,aAAc,KAAM,EACzC,QAASA,EAAS,UAAW,KAAM,EACnC,MAAOA,EAAS,QAAS,KAAM,EAC/B,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,WAAYA,EAAS,cAAe,KAAM,EAC1C,QAASA,EAAS,UAAW,KAAM,EACnC,UAAWA,EAAS,aAAc,KAAM,EACxC,cAAeA,EAAS,kBAAmB,KAAM,EACjD,SAAUA,EAAS,YAAa,KAAM,EACtC,SAAUA,EAAS,YAAa,KAAM,EACtC,OAAQA,EAAS,SAAU,KAAM,EACjC,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,OAAQA,EAAS,SAAU,KAAM,EACjC,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,WAAYA,EAAS,cAAe,KAAM,EAC1C,IAAKA,EAAS,MAAO,KAAM,EAC3B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,QAASA,EAAS,WAAY,KAAM,EACpC,OAAQA,EAAS,UAAW,KAAM,EAClC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,WAAYA,EAAS,cAAe,KAAM,EAC1C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,WAAYA,EAAS,cAAe,KAAM,EAC1C,OAAQA,EAAS,SAAU,KAAM,EACjC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,SAAUA,EAAS,WAAY,KAAM,EACrC,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,SAAUA,EAAS,WAAY,KAAM,EACrC,SAAUA,EAAS,YAAa,KAAM,EACtC,SAAUA,EAAS,YAAa,KAAM,EACtC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,YAAaA,EAAS,eAAgB,KAAM,EAC5C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,WAAYA,EAAS,cAAe,KAAM,EAC1C,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,WAAYA,EAAS,cAAe,KAAM,EAC1C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,OAAQA,EAAS,SAAU,KAAM,EACjC,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,SAAUA,EAAS,WAAY,KAAM,EACrC,UAAWA,EAAS,YAAa,KAAM,EACvC,SAAUA,EAAS,YAAa,KAAM,EACtC,UAAWA,EAAS,aAAc,KAAM,EACxC,WAAYA,EAAS,aAAc,KAAM,EACzC,SAAUA,EAAS,WAAY,KAAM,EACrC,MAAOA,EAAS,QAAS,KAAM,EAC/B,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,WAAYA,EAAS,cAAe,KAAM,EAC1C,QAASA,EAAS,UAAW,KAAM,EACnC,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,WAAYA,EAAS,aAAc,KAAM,EACzC,SAAUA,EAAS,WAAY,KAAM,EACrC,SAAUA,EAAS,WAAY,KAAM,EACrC,SAAUA,EAAS,YAAa,KAAM,EACtC,UAAWA,EAAS,aAAc,KAAM,EACxC,UAAWA,EAAS,aAAc,KAAM,EACxC,MAAOA,EAAS,QAAS,KAAM,EAC/B,WAAYA,EAAS,aAAc,KAAM,EACzC,UAAWA,EAAS,aAAc,KAAM,EACxC,OAAQA,EAAS,SAAU,KAAM,EACjC,SAAUA,EAAS,YAAa,KAAM,EACtC,OAAQA,EAAS,UAAW,KAAM,EAClC,QAASA,EAAS,WAAY,KAAM,EACpC,WAAYA,EAAS,cAAe,KAAM,EAC1C,SAAUA,EAAS,YAAa,KAAM,EACtC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,UAAWA,EAAS,YAAa,KAAM,EACvC,SAAUA,EAAS,YAAa,KAAM,EACtC,kCAAmCA,EAAS,uCAAwC,KAAM,EAC1F,wBAAyBA,EAAS,4BAA6B,KAAM,EACrE,gCAAiCA,EAAS,qCAAsC,KAAM,EACtF,sBAAuBA,EAAS,0BAA2B,KAAM,EACjE,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,uBAAwBA,EAAS,2BAA4B,KAAM,EACnE,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,uBAAwBA,EAAS,2BAA4B,KAAM,EACnE,2BAA4BA,EAAS,+BAAgC,KAAM,EAC3E,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,qBAAsBA,EAAS,yBAA0B,KAAM,EAC/D,cAAeA,EAAS,kBAAmB,KAAM,EACjD,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,SAAUA,EAAS,YAAa,KAAM,EACtC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,UAAWA,EAAS,aAAc,KAAM,EACxC,SAAUA,EAAS,WAAY,KAAM,EACrC,uBAAwBA,EAAS,4BAA6B,KAAM,EACpE,eAAgBA,EAAS,oBAAqB,KAAM,EACpD,iBAAkBA,EAAS,sBAAuB,KAAM,EACxD,QAASA,EAAS,UAAW,KAAM,EACnC,uBAAwBA,EAAS,4BAA6B,KAAM,EACpE,QAASA,EAAS,WAAY,KAAM,EACpC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,QAASA,EAAS,UAAW,KAAM,EACnC,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,UAAW,KAAM,EAClC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,OAAQA,EAAS,SAAU,KAAM,EACjC,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,kBAAmBA,EAAS,qBAAsB,KAAM,EACxD,KAAMA,EAAS,OAAQ,KAAM,EAC7B,YAAaA,EAAS,eAAgB,KAAM,EAC5C,WAAYA,EAAS,cAAe,KAAM,EAC1C,WAAYA,EAAS,cAAe,KAAM,EAC1C,OAAQA,EAAS,SAAU,KAAM,EACjC,cAAeA,EAAS,kBAAmB,KAAM,EACjD,UAAWA,EAAS,aAAc,KAAM,EACxC,MAAOA,EAAS,QAAS,KAAM,EAC/B,MAAOA,EAAS,QAAS,KAAM,EAC/B,OAAQA,EAAS,SAAU,KAAM,EACjC,UAAWA,EAAS,aAAc,KAAM,EACxC,OAAQA,EAAS,SAAU,KAAM,EACjC,SAAUA,EAAS,WAAY,KAAM,EACrC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,SAAUA,EAAS,YAAa,KAAM,EACtC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,WAAYA,EAAS,cAAe,KAAM,EAC1C,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,QAASA,EAAS,UAAW,KAAM,EACnC,OAAQA,EAAS,SAAU,KAAM,EACjC,MAAOA,EAAS,QAAS,KAAM,EAC/B,cAAeA,EAAS,iBAAkB,KAAM,EAChD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,qBAAsBA,EAAS,0BAA2B,KAAM,EAChE,SAAUA,EAAS,YAAa,KAAM,EACtC,SAAUA,EAAS,YAAa,KAAM,EACtC,iBAAkBA,EAAS,oBAAqB,KAAM,EACtD,WAAYA,EAAS,cAAe,KAAM,EAC1C,iBAAkBA,EAAS,oBAAqB,KAAM,EACtD,mBAAoBA,EAAS,sBAAuB,KAAM,EAC1D,iBAAkBA,EAAS,oBAAqB,KAAM,EACtD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,mBAAoBA,EAAS,sBAAuB,KAAM,EAC1D,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,UAAWA,EAAS,aAAc,KAAM,EACxC,KAAMA,EAAS,OAAQ,KAAM,EAC7B,UAAWA,EAAS,aAAc,KAAM,EACxC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,gBAAiBA,EAAS,qBAAsB,KAAM,EACtD,QAASA,EAAS,UAAW,KAAM,EACnC,OAAQA,EAAS,SAAU,KAAM,EACjC,UAAWA,EAAS,aAAc,KAAM,EACxC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,QAASA,EAAS,UAAW,KAAM,EACnC,WAAYA,EAAS,cAAe,KAAM,EAC1C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,MAAOA,EAAS,QAAS,KAAM,EAC/B,WAAYA,EAAS,cAAe,KAAM,EAC1C,qBAAsBA,EAAS,0BAA2B,KAAM,EAChE,oBAAqBA,EAAS,yBAA0B,KAAM,EAC9D,SAAUA,EAAS,YAAa,KAAM,EACtC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,UAAWA,EAAS,aAAc,KAAM,EACxC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,WAAYA,EAAS,cAAe,KAAM,EAC1C,UAAWA,EAAS,aAAc,KAAM,EACxC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,SAAUA,EAAS,YAAa,KAAM,EACtC,QAASA,EAAS,UAAW,KAAM,EACnC,WAAYA,EAAS,cAAe,KAAM,EAC1C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,UAAWA,EAAS,aAAc,KAAM,EACxC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,QAASA,EAAS,UAAW,KAAM,EACnC,OAAQA,EAAS,SAAU,KAAM,EACjC,sBAAuBA,EAAS,0BAA2B,KAAM,EACjE,uBAAwBA,EAAS,2BAA4B,KAAM,EACnE,gBAAiBA,EAAS,oBAAqB,KAAM,EACrD,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,cAAeA,EAAS,iBAAkB,KAAM,EAChD,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,WAAYA,EAAS,cAAe,KAAM,EAC1C,wBAAyBA,EAAS,4BAA6B,KAAM,EACrE,gBAAiBA,EAAS,oBAAqB,KAAM,EACrD,gBAAiBA,EAAS,oBAAqB,KAAM,EACrD,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,cAAeA,EAAS,kBAAmB,KAAM,EACjD,sBAAuBA,EAAS,2BAA4B,KAAM,EAClE,eAAgBA,EAAS,mBAAoB,KAAM,EACnD,qBAAsBA,EAAS,0BAA2B,KAAM,EAChE,MAAOA,EAAS,QAAS,KAAM,EAC/B,YAAaA,EAAS,eAAgB,KAAM,EAC5C,IAAKA,EAAS,MAAO,KAAM,EAC3B,cAAeA,EAAS,iBAAkB,KAAM,EAChD,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,UAAWA,EAAS,aAAc,KAAM,EACxC,oBAAqBA,EAAS,wBAAyB,KAAM,EAC7D,qBAAsBA,EAAS,yBAA0B,KAAM,EAC/D,YAAaA,EAAS,eAAgB,KAAM,EAC5C,UAAWA,EAAS,aAAc,KAAM,EACxC,aAAcA,EAAS,iBAAkB,KAAM,EAC/C,kBAAmBA,EAAS,qBAAsB,KAAM,EACxD,0BAA2BA,EAAS,iCAAkC,KAAM,EAC5E,yBAA0BA,EAAS,+BAAgC,KAAM,EACzE,YAAaA,EAAS,eAAgB,KAAM,EAC5C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,QAASA,EAAS,UAAW,KAAM,EACnC,OAAQA,EAAS,SAAU,KAAM,EACjC,IAAKA,EAAS,MAAO,KAAM,EAC3B,iBAAkBA,EAAS,oBAAqB,KAAM,EACtD,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,OAAQA,EAAS,SAAU,KAAM,EACjC,MAAOA,EAAS,QAAS,KAAM,EAC/B,KAAMA,EAAS,OAAQ,KAAM,EAC7B,GAAIA,EAAS,KAAM,KAAM,EACzB,KAAMA,EAAS,OAAQ,KAAM,EAC7B,MAAOA,EAAS,QAAS,KAAM,EAC/B,MAAOA,EAAS,QAAS,KAAM,EAC/B,UAAWA,EAAS,aAAc,KAAM,EACxC,UAAWA,EAAS,aAAc,KAAM,EACxC,QAASA,EAAS,UAAW,KAAM,EACnC,iBAAkBA,EAAS,oBAAqB,KAAM,EACtD,MAAOA,EAAS,QAAS,KAAM,EAC/B,cAAeA,EAAS,iBAAkB,KAAM,EAChD,WAAYA,EAAS,cAAe,KAAM,EAC1C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,MAAOA,EAAS,QAAS,KAAM,EAC/B,SAAUA,EAAS,YAAa,KAAM,EACtC,cAAeA,EAAS,kBAAmB,KAAM,EACjD,YAAaA,EAAS,gBAAiB,KAAM,EAC7C,OAAQA,EAAS,SAAU,KAAM,EACjC,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,QAASA,EAAS,WAAY,KAAM,EACpC,YAAaA,EAAS,eAAgB,KAAM,EAC5C,eAAgBA,EAAS,mBAAoB,KAAM,EACnD,SAAUA,EAAS,WAAY,KAAM,EACrC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,WAAYA,EAAS,eAAgB,KAAM,EAC3C,WAAYA,EAAS,aAAc,KAAM,EACzC,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,OAAQA,EAAS,SAAU,KAAM,EACjC,mBAAoBA,EAAS,wBAAyB,KAAM,EAC5D,YAAaA,EAAS,eAAgB,KAAM,EAC5C,WAAYA,EAAS,cAAe,KAAM,EAC1C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,OAAQA,EAAS,SAAU,KAAM,EACjC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,oBAAqBA,EAAS,wBAAyB,KAAM,EAC7D,YAAaA,EAAS,eAAgB,KAAM,EAC5C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,oBAAqBA,EAAS,wBAAyB,KAAM,EAC7D,KAAMA,EAAS,OAAQ,KAAM,EAC7B,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,mBAAoBA,EAAS,sBAAuB,KAAM,EAC1D,WAAYA,EAAS,cAAe,KAAM,EAC1C,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,mBAAoBA,EAAS,wBAAyB,KAAM,EAC5D,IAAKA,EAAS,MAAO,KAAM,EAC3B,gBAAiBA,EAAS,mBAAoB,KAAM,EACpD,gBAAiBA,EAAS,oBAAqB,KAAM,EACrD,sBAAuBA,EAAS,2BAA4B,KAAM,EAClE,uBAAwBA,EAAS,4BAA6B,KAAM,EACpE,kBAAmBA,EAAS,sBAAuB,KAAM,EACzD,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,cAAeA,EAAS,iBAAkB,KAAM,EAChD,kBAAmBA,EAAS,uBAAwB,KAAM,EAC1D,yBAA0BA,EAAS,6BAA8B,KAAM,EACvE,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,WAAYA,EAAS,aAAc,KAAM,EACzC,cAAeA,EAAS,iBAAkB,KAAM,EAChD,SAAUA,EAAS,WAAY,KAAM,EACrC,MAAOA,EAAS,QAAS,KAAM,EAC/B,uBAAwBA,EAAS,2BAA4B,KAAM,EACnE,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,SAAUA,EAAS,YAAa,KAAM,EACtC,QAASA,EAAS,WAAY,KAAM,EACpC,OAAQA,EAAS,SAAU,KAAM,EACjC,OAAQA,EAAS,SAAU,KAAM,EACjC,YAAaA,EAAS,gBAAiB,KAAM,EAC7C,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,cAAeA,EAAS,gBAAiB,KAAM,EAC/C,cAAeA,EAAS,kBAAmB,KAAM,EACjD,UAAWA,EAAS,aAAc,KAAM,EACxC,MAAOA,EAAS,QAAS,KAAM,EAC/B,SAAUA,EAAS,YAAa,KAAM,EACtC,aAAcA,EAAS,gBAAiB,KAAM,EAC9C,KAAMA,EAAS,OAAQ,KAAM,EAC7B,UAAWA,EAAS,aAAc,KAAM,EACxC,iBAAkBA,EAAS,qBAAsB,KAAM,EACvD,uBAAwBA,EAAS,4BAA6B,KAAM,EACpE,mBAAoBA,EAAS,uBAAwB,KAAM,EAC3D,UAAWA,EAAS,aAAc,KAAM,EACxC,gBAAiBA,EAAS,oBAAqB,KAAM,EACrD,gBAAiBA,EAAS,oBAAqB,KAAM,EACrD,YAAaA,EAAS,eAAgB,KAAM,EAC5C,gBAAiBA,EAAS,oBAAqB,KAAM,CACzD,ECxnBMG,GAAkB,CACpB,YAAaH,EAAS,eAAgB,OAAO,EAC7C,cAAeA,EAAS,iBAAkB,SAAS,EACnD,WAAYA,EAAS,cAAe,MAAM,EAC1C,YAAaA,EAAS,eAAgB,OAAO,EAC7C,iBAAkBA,EAAS,qBAAsB,cAAc,EAC/D,mBAAoBA,EAAS,yBAA0B,aAAa,EACpE,oBAAqBA,EAAS,0BAA2B,gBAAgB,EACzE,gBAAiBA,EAAS,oBAAqB,OAAO,EACtD,gBAAiBA,EAAS,oBAAqB,SAAS,EACxD,cAAeA,EAAS,iBAAkB,OAAO,EACjD,YAAaA,EAAS,eAAgB,eAAe,EACrD,YAAaA,EAAS,eAAgB,MAAM,EAC5C,oBAAqBA,EAAS,wBAAyB,eAAe,EACtE,qBAAsBA,EAAS,yBAA0B,gBAAgB,EACzE,kBAAmBA,EAAS,sBAAuB,aAAa,EAChE,oBAAqBA,EAAS,wBAAyB,eAAe,EACtE,YAAaA,EAAS,eAAgB,MAAM,EAC5C,eAAgBA,EAAS,mBAAoB,YAAY,EACzD,eAAgBA,EAAS,mBAAoB,KAAM,EACnD,kBAAmBA,EAAS,qBAAsB,KAAM,EACxD,WAAYA,EAAS,SAAU,KAAM,EACrC,qBAAsBA,EAAS,wBAAyB,KAAM,EAC9D,QAASA,EAAS,UAAW,KAAM,EACnC,iBAAkBA,EAAS,oBAAqB,KAAM,EACtD,eAAgBA,EAAS,kBAAmB,KAAM,EAClD,SAAUA,EAAS,YAAa,KAAM,EACtC,wBAAyBA,EAAS,4BAA6B,KAAM,EACrE,uBAAwBA,EAAS,2BAA4B,KAAM,CACvE,EAQMI,EAAU,CACZ,GAAGF,GACH,GAAGC,EACP,ECxCA,MAAME,EAAqB,CACvB,aAAc,CACV,KAAK,sBAAwB,IAAI,IACjC,KAAK,WAAa,IAAI,IACtB,KAAK,aAAe,IAAIxlB,GACxB,KAAK,YAAc,KAAK,aAAa,MACrC,KAAK,UAAY,IACrB,CACA,aAAaylB,EAAa,CACtB,KAAK,aAAa,KAAK,CACnB,iBAAkBA,EAClB,gBAAiB,EAC7B,CAAS,CACL,CACA,SAASC,EAAYC,EAAS,CAC1B,YAAK,sBAAsB,IAAID,EAAYC,CAAO,EAClD,KAAK,aAAa,CAACD,CAAU,CAAC,EACvBpoB,GAAa,IAAM,CAClB,KAAK,sBAAsB,IAAIooB,CAAU,IAAMC,IAGnD,KAAK,sBAAsB,OAAOD,CAAU,EAC5C,KAAK,aAAa,CAACA,CAAU,CAAC,EAClC,CAAC,CACL,CACA,IAAIA,EAAY,CACZ,OAAO,KAAK,sBAAsB,IAAIA,CAAU,GAAK,IACzD,CACA,gBAAgBA,EAAYnZ,EAAS,CACjC,KAAK,WAAW,IAAImZ,CAAU,GAAG,QAAO,EACxC,MAAME,EAAS,IAAIC,GAA+B,KAAMH,EAAYnZ,CAAO,EAC3E,YAAK,WAAW,IAAImZ,EAAYE,CAAM,EAC/BtoB,GAAa,IAAM,CACtB,MAAMwE,EAAI,KAAK,WAAW,IAAI4jB,CAAU,EACpC,CAAC5jB,GAAKA,IAAM8jB,IAGhB,KAAK,WAAW,OAAOF,CAAU,EACjC5jB,EAAE,QAAO,EACb,CAAC,CACL,CACA,MAAM,YAAY4jB,EAAY,CAE1B,MAAMI,EAAsB,KAAK,IAAIJ,CAAU,EAC/C,GAAII,EACA,OAAOA,EAEX,MAAMvZ,EAAU,KAAK,WAAW,IAAImZ,CAAU,EAC9C,MAAI,CAACnZ,GAAWA,EAAQ,WAEb,MAEX,MAAMA,EAAQ,QAAO,EACd,KAAK,IAAImZ,CAAU,EAC9B,CACA,WAAWA,EAAY,CAEnB,GAD4B,KAAK,IAAIA,CAAU,EAE3C,MAAO,GAEX,MAAMnZ,EAAU,KAAK,WAAW,IAAImZ,CAAU,EAC9C,MAAI,IAACnZ,GAAWA,EAAQ,WAI5B,CACA,YAAYwZ,EAAU,CAClB,KAAK,UAAYA,EACjB,KAAK,aAAa,KAAK,CACnB,iBAAkB,MAAM,KAAK,KAAK,sBAAsB,KAAI,CAAE,EAC9D,gBAAiB,EAC7B,CAAS,CACL,CACA,aAAc,CACV,OAAO,KAAK,SAChB,CACA,sBAAuB,CACnB,OAAI,KAAK,WAAa,KAAK,UAAU,OAAS,EACnC,KAAK,UAAU,CAAC,EAEpB,IACX,CACJ,CACA,MAAMF,WAAuCnoB,EAAW,CACpD,IAAI,YAAa,CACb,OAAO,KAAK,WAChB,CACA,YAAYsoB,EAAWC,EAAaC,EAAU,CAC1C,MAAK,EACL,KAAK,UAAYF,EACjB,KAAK,YAAcC,EACnB,KAAK,SAAWC,EAChB,KAAK,YAAc,GACnB,KAAK,gBAAkB,KACvB,KAAK,YAAc,EACvB,CACA,SAAU,CACN,KAAK,YAAc,GACnB,MAAM,QAAO,CACjB,CACA,MAAM,SAAU,CACZ,OAAK,KAAK,kBACN,KAAK,gBAAkB,KAAK,QAAO,GAEhC,KAAK,eAChB,CACA,MAAM,SAAU,CACZ,MAAM9sB,EAAQ,MAAM,KAAK,SAAS,oBAClC,KAAK,YAAc,GACfA,GAAS,CAAC,KAAK,aACf,KAAK,UAAU,KAAK,UAAU,SAAS,KAAK,YAAaA,CAAK,CAAC,CAEvE,CACJ,CClHA,MAAM+sB,EAAM,CACR,YAAYld,EAAQmV,EAAMgI,EAAU,CAChC,KAAK,OAASnd,EACd,KAAK,KAAOmV,EACZ,KAAK,SAAWgI,EAChB,KAAK,YAAc,MACvB,CACA,UAAW,CACP,MAAO,IAAM,KAAK,OAAS,KAAO,KAAK,KAAO,GAClD,CACJ,CA4BA,IAAIC,IACH,SAAUA,EAAsB,CAI7BA,EAAqBA,EAAqB,SAAc,CAAC,EAAI,WAI7DA,EAAqBA,EAAqB,SAAc,CAAC,EAAI,UACjE,GAAGA,KAAyBA,GAAuB,CAAA,EAAG,EAItD,IAAIC,IACH,SAAUA,EAAqB,CAC5B,MAAMC,EAAS,IAAI,IACnBA,EAAO,IAAI,EAAmChB,EAAQ,YAAY,EAClEgB,EAAO,IAAI,EAAqChB,EAAQ,cAAc,EACtEgB,EAAO,IAAI,EAAwChB,EAAQ,iBAAiB,EAC5EgB,EAAO,IAAI,EAAkChB,EAAQ,WAAW,EAChEgB,EAAO,IAAI,EAAqChB,EAAQ,cAAc,EACtEgB,EAAO,IAAI,EAAkChB,EAAQ,WAAW,EAChEgB,EAAO,IAAI,EAAmChB,EAAQ,YAAY,EAClEgB,EAAO,IAAI,EAAsChB,EAAQ,eAAe,EACxEgB,EAAO,IAAI,EAAmChB,EAAQ,YAAY,EAClEgB,EAAO,IAAI,EAAqChB,EAAQ,cAAc,EACtEgB,EAAO,IAAI,GAAmChB,EAAQ,WAAW,EACjEgB,EAAO,IAAI,GAAsChB,EAAQ,cAAc,EACvEgB,EAAO,IAAI,GAAkChB,EAAQ,UAAU,EAC/DgB,EAAO,IAAI,GAAmChB,EAAQ,WAAW,EACjEgB,EAAO,IAAI,GAAkChB,EAAQ,UAAU,EAC/DgB,EAAO,IAAI,GAAsChB,EAAQ,cAAc,EACvEgB,EAAO,IAAI,GAAkChB,EAAQ,UAAU,EAC/DgB,EAAO,IAAI,GAAwChB,EAAQ,gBAAgB,EAC3EgB,EAAO,IAAI,GAAqChB,EAAQ,aAAa,EACrEgB,EAAO,IAAI,GAAqChB,EAAQ,aAAa,EACrEgB,EAAO,IAAI,GAAkChB,EAAQ,UAAU,EAC/DgB,EAAO,IAAI,GAAmChB,EAAQ,WAAW,EACjEgB,EAAO,IAAI,GAAkChB,EAAQ,UAAU,EAC/DgB,EAAO,IAAI,GAAuChB,EAAQ,eAAe,EACzEgB,EAAO,IAAI,GAAyChB,EAAQ,iBAAiB,EAC7EgB,EAAO,IAAI,GAAoChB,EAAQ,YAAY,EACnEgB,EAAO,IAAI,GAA2ChB,EAAQ,mBAAmB,EACjFgB,EAAO,IAAI,GAAkChB,EAAQ,OAAO,EAC5DgB,EAAO,IAAI,GAAmChB,EAAQ,MAAM,EAC5DgB,EAAO,IAAI,GAAkChB,EAAQ,KAAK,EAI1D,SAASiB,EAAOC,EAAM,CAClB,IAAIC,EAAUH,EAAO,IAAIE,CAAI,EAC7B,OAAKC,IACD,QAAQ,KAAK,2CAA6CD,CAAI,EAC9DC,EAAUnB,EAAQ,gBAEfmB,CACX,CACAJ,EAAoB,OAASE,EAI7B,SAASG,EAAQF,EAAM,CACnB,OAAQA,EAAI,CACR,IAAK,GAAmC,OAAOjhB,EAAS,IAAK,QAAQ,EACrE,IAAK,GAAqC,OAAOA,EAAS,IAAK,UAAU,EACzE,IAAK,GAAwC,OAAOA,EAAS,IAAK,aAAa,EAC/E,IAAK,GAAkC,OAAOA,EAAS,IAAK,OAAO,EACnE,IAAK,GAAqC,OAAOA,EAAS,IAAK,UAAU,EACzE,IAAK,GAAkC,OAAOA,EAAS,IAAK,OAAO,EACnE,IAAK,GAAmC,OAAOA,EAAS,IAAK,QAAQ,EACrE,IAAK,GAAsC,OAAOA,EAAS,IAAK,WAAW,EAC3E,IAAK,GAAmC,OAAOA,EAAS,IAAK,QAAQ,EACrE,IAAK,GAAqC,OAAOA,EAAS,IAAK,UAAU,EACzE,IAAK,IAAmC,OAAOA,EAAS,IAAK,OAAO,EACpE,IAAK,IAAsC,OAAOA,EAAS,IAAK,UAAU,EAC1E,IAAK,IAAkC,OAAOA,EAAS,IAAK,MAAM,EAClE,IAAK,IAAmC,OAAOA,EAAS,IAAK,OAAO,EACpE,IAAK,IAAsC,OAAOA,EAAS,IAAK,UAAU,EAC1E,IAAK,IAAkC,OAAOA,EAAS,IAAK,MAAM,EAClE,IAAK,IAAwC,OAAOA,EAAS,IAAK,aAAa,EAC/E,IAAK,IAAqC,OAAOA,EAAS,IAAK,SAAS,EACxE,IAAK,IAAkC,OAAOA,EAAS,IAAK,MAAM,EAClE,IAAK,IAAmC,OAAOA,EAAS,IAAK,OAAO,EACpE,IAAK,IAAkC,OAAOA,EAAS,IAAK,MAAM,EAClE,IAAK,IAAuC,OAAOA,EAAS,IAAK,WAAW,EAC5E,IAAK,IAAyC,OAAOA,EAAS,IAAK,cAAc,EACjF,IAAK,IAAoC,OAAOA,EAAS,IAAK,QAAQ,EACtE,IAAK,IAA2C,OAAOA,EAAS,IAAK,gBAAgB,EACrF,IAAK,IAAkC,OAAOA,EAAS,IAAK,MAAM,EAClE,IAAK,IAAmC,OAAOA,EAAS,IAAK,OAAO,EACpE,IAAK,IAAkC,OAAOA,EAAS,IAAK,MAAM,EAClE,IAAK,IAAqC,OAAOA,EAAS,IAAK,SAAS,EACxE,QAAS,MAAO,EAC5B,CACI,CACA8gB,EAAoB,QAAUK,EAC9B,MAAMlhB,EAAO,IAAI,IACjBA,EAAK,IAAI,SAAU,CAAC,EACpBA,EAAK,IAAI,WAAY,CAAC,EACtBA,EAAK,IAAI,cAAe,CAAC,EACzBA,EAAK,IAAI,QAAS,CAAC,EACnBA,EAAK,IAAI,WAAY,CAAC,EACtBA,EAAK,IAAI,QAAS,CAAC,EACnBA,EAAK,IAAI,SAAU,CAAC,EACpBA,EAAK,IAAI,YAAa,CAAC,EACvBA,EAAK,IAAI,SAAU,CAAC,EACpBA,EAAK,IAAI,WAAY,CAAC,EACtBA,EAAK,IAAI,QAAS,EAAE,EACpBA,EAAK,IAAI,WAAY,EAAE,EACvBA,EAAK,IAAI,OAAQ,EAAE,EACnBA,EAAK,IAAI,QAAS,EAAE,EACpBA,EAAK,IAAI,WAAY,EAAE,EACvBA,EAAK,IAAI,OAAQ,EAAE,EACnBA,EAAK,IAAI,cAAe,EAAE,EAC1BA,EAAK,IAAI,aAAc,EAAE,EACzBA,EAAK,IAAI,UAAW,EAAE,EACtBA,EAAK,IAAI,UAAW,EAAE,EACtBA,EAAK,IAAI,OAAQ,EAAE,EACnBA,EAAK,IAAI,QAAS,EAAE,EACpBA,EAAK,IAAI,OAAQ,EAAE,EACnBA,EAAK,IAAI,YAAa,EAAE,EACxBA,EAAK,IAAI,cAAe,EAAE,EAC1BA,EAAK,IAAI,SAAU,EAAE,EACrBA,EAAK,IAAI,iBAAkB,EAAE,EAC7BA,EAAK,IAAI,gBAAiB,EAAE,EAC5BA,EAAK,IAAI,UAAW,EAAE,EACtBA,EAAK,IAAI,QAAS,EAAE,EACpBA,EAAK,IAAI,OAAQ,EAAE,EAInB,SAAS+W,EAAWpjB,EAAOmqB,EAAQ,CAC/B,IAAIjlB,EAAMmH,EAAK,IAAIrM,CAAK,EACxB,OAAI,OAAOkF,EAAQ,KAAe,CAACilB,IAC/BjlB,EAAM,GAEHA,CACX,CACAgoB,EAAoB,WAAa9J,CACrC,GAAG8J,KAAwBA,GAAsB,CAAA,EAAG,EAIpD,IAAIM,IACH,SAAUA,EAA6B,CAKpCA,EAA4BA,EAA4B,UAAe,CAAC,EAAI,YAK5EA,EAA4BA,EAA4B,SAAc,CAAC,EAAI,UAC/E,GAAGA,KAAgCA,GAA8B,CAAA,EAAG,EAepE,IAAIC,IACH,SAAUA,EAA2B,CAClCA,EAA0BA,EAA0B,KAAU,CAAC,EAAI,OACnEA,EAA0BA,EAA0B,MAAW,CAAC,EAAI,OACxE,GAAGA,KAA8BA,GAA4B,CAAA,EAAG,EAsChE,IAAIC,IACH,SAAUA,EAAqC,CAC5CA,EAAoCA,EAAoC,SAAc,CAAC,EAAI,WAC3FA,EAAoCA,EAAoC,SAAc,CAAC,EAAI,WAC3FA,EAAoCA,EAAoC,QAAa,CAAC,EAAI,SAC9F,GAAGA,KAAwCA,GAAsC,CAAA,EAAG,EAIpF,IAAIC,IACH,SAAUA,EAA0B,CACjCA,EAAyBA,EAAyB,UAAe,CAAC,EAAI,YACtEA,EAAyBA,EAAyB,QAAa,CAAC,EAAI,SACxE,GAAGA,KAA6BA,GAA2B,CAAA,EAAG,EAC9D,IAAIC,IACH,SAAUA,EAA0B,CACjCA,EAAyBA,EAAyB,OAAY,CAAC,EAAI,SACnEA,EAAyBA,EAAyB,iBAAsB,CAAC,EAAI,mBAC7EA,EAAyBA,EAAyB,cAAmB,CAAC,EAAI,eAC9E,GAAGA,KAA6BA,GAA2B,CAAA,EAAG,EAI9D,IAAIC,IACH,SAAUA,EAAuB,CAI9BA,EAAsBA,EAAsB,KAAU,CAAC,EAAI,OAI3DA,EAAsBA,EAAsB,KAAU,CAAC,EAAI,OAI3DA,EAAsBA,EAAsB,MAAW,CAAC,EAAI,OAChE,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EAcvBzhB,EAAS,IAAK,OAAO,EACnBA,EAAS,IAAK,SAAS,EAC1BA,EAAS,IAAK,OAAO,EACjBA,EAAS,IAAK,UAAU,EACtBA,EAAS,IAAK,aAAa,EAClCA,EAAS,IAAK,aAAa,EACpBA,EAAS,IAAK,oBAAoB,EACvCA,EAAS,IAAK,OAAO,EACtBA,EAAS,IAAK,OAAO,EACtBA,EAAS,IAAK,MAAM,EACfA,EAAS,IAAK,UAAU,EACvBA,EAAS,IAAK,WAAW,EAC/BA,EAAS,IAAK,KAAK,EACjBA,EAAS,IAAK,QAAQ,EACtBA,EAAS,IAAK,QAAQ,EACnBA,EAAS,IAAK,WAAW,EAC7BA,EAAS,IAAK,MAAM,EAClBA,EAAS,IAAK,QAAQ,EACtBA,EAAS,IAAK,QAAQ,EACpBA,EAAS,IAAK,UAAU,EAC1BA,EAAS,IAAK,SAAS,EACtBA,EAAS,IAAK,UAAU,EACzBA,EAAS,IAAK,QAAQ,EACtBA,EAAS,IAAK,QAAQ,EACfA,EAAS,IAAK,gBAAgB,EACnCA,EAAS,IAAK,UAAU,EAW5D,IAAI0hB,IACH,SAAUA,EAAa,CACpB,MAAMX,EAAS,IAAI,IACnBA,EAAO,IAAI,EAAyBhB,EAAQ,UAAU,EACtDgB,EAAO,IAAI,EAA2BhB,EAAQ,YAAY,EAC1DgB,EAAO,IAAI,EAA8BhB,EAAQ,eAAe,EAChEgB,EAAO,IAAI,EAA4BhB,EAAQ,aAAa,EAC5DgB,EAAO,IAAI,EAA0BhB,EAAQ,WAAW,EACxDgB,EAAO,IAAI,EAA2BhB,EAAQ,YAAY,EAC1DgB,EAAO,IAAI,EAA6BhB,EAAQ,cAAc,EAC9DgB,EAAO,IAAI,EAA0BhB,EAAQ,WAAW,EACxDgB,EAAO,IAAI,EAAgChB,EAAQ,iBAAiB,EACpEgB,EAAO,IAAI,EAAyBhB,EAAQ,UAAU,EACtDgB,EAAO,IAAI,GAA+BhB,EAAQ,eAAe,EACjEgB,EAAO,IAAI,GAA8BhB,EAAQ,cAAc,EAC/DgB,EAAO,IAAI,GAA8BhB,EAAQ,cAAc,EAC/DgB,EAAO,IAAI,GAA8BhB,EAAQ,cAAc,EAC/DgB,EAAO,IAAI,GAA4BhB,EAAQ,YAAY,EAC3DgB,EAAO,IAAI,GAA4BhB,EAAQ,YAAY,EAC3DgB,EAAO,IAAI,GAA6BhB,EAAQ,aAAa,EAC7DgB,EAAO,IAAI,GAA2BhB,EAAQ,WAAW,EACzDgB,EAAO,IAAI,GAA4BhB,EAAQ,YAAY,EAC3DgB,EAAO,IAAI,GAAyBhB,EAAQ,SAAS,EACrDgB,EAAO,IAAI,GAA0BhB,EAAQ,UAAU,EACvDgB,EAAO,IAAI,GAAgChB,EAAQ,gBAAgB,EACnEgB,EAAO,IAAI,GAA4BhB,EAAQ,YAAY,EAC3DgB,EAAO,IAAI,GAA2BhB,EAAQ,WAAW,EACzDgB,EAAO,IAAI,GAA8BhB,EAAQ,cAAc,EAC/DgB,EAAO,IAAI,GAAmChB,EAAQ,mBAAmB,EAIzE,SAASiB,EAAOC,EAAM,CAClB,IAAIU,EAAOZ,EAAO,IAAIE,CAAI,EAC1B,OAAKU,IACD,QAAQ,KAAK,mCAAqCV,CAAI,EACtDU,EAAO5B,EAAQ,gBAEZ4B,CACX,CACAD,EAAY,OAASV,EACrB,MAAMY,EAAmB,IAAI,IAC7BA,EAAiB,IAAI,EAAyB,EAAE,EAChDA,EAAiB,IAAI,EAA2B,CAAC,EACjDA,EAAiB,IAAI,EAA8B,CAAC,EACpDA,EAAiB,IAAI,EAA4B,CAAC,EAClDA,EAAiB,IAAI,EAA0B,CAAC,EAChDA,EAAiB,IAAI,EAA2B,CAAC,EACjDA,EAAiB,IAAI,EAA6B,CAAC,EACnDA,EAAiB,IAAI,EAA0B,CAAC,EAChDA,EAAiB,IAAI,EAAgC,CAAC,EACtDA,EAAiB,IAAI,EAAyB,EAAE,EAChDA,EAAiB,IAAI,GAA+B,CAAC,EACrDA,EAAiB,IAAI,GAA8B,CAAC,EACpDA,EAAiB,IAAI,GAA8B,CAAC,EACpDA,EAAiB,IAAI,GAA8B,EAAE,EACrDA,EAAiB,IAAI,GAA4B,EAAE,EACnDA,EAAiB,IAAI,GAA4B,EAAE,EACnDA,EAAiB,IAAI,GAA6B,EAAE,EACpDA,EAAiB,IAAI,GAA2B,EAAE,EAClDA,EAAiB,IAAI,GAA4B,EAAE,EACnDA,EAAiB,IAAI,GAAyB,EAAE,EAChDA,EAAiB,IAAI,GAA0B,EAAE,EACjDA,EAAiB,IAAI,GAAgC,EAAE,EACvDA,EAAiB,IAAI,GAA4B,CAAC,EAClDA,EAAiB,IAAI,GAA2B,EAAE,EAClDA,EAAiB,IAAI,GAA8B,EAAE,EACrDA,EAAiB,IAAI,GAAmC,EAAE,EAI1D,SAASC,EAAiBZ,EAAM,CAC5B,IAAIa,EAAiBF,EAAiB,IAAIX,CAAI,EAC9C,OAAIa,IAAmB,SACnB,QAAQ,KAAK,2CAA6Cb,CAAI,EAC9Da,EAAiB,IAEdA,CACX,CACAJ,EAAY,iBAAmBG,CACnC,GAAGH,KAAgBA,GAAc,CAAA,EAAG,EACpC,IAAAK,IAAAC,GAAA,KAAuB,CAmBnB,OAAO,UAAUpuB,EAAO,CACpB,OAAQA,EAAK,CACT,IAAK,UAAW,OAAOouB,GAAiB,QACxC,IAAK,UAAW,OAAOA,GAAiB,QACxC,IAAK,SAAU,OAAOA,GAAiB,MACnD,CACQ,OAAO,IAAIA,GAAiBpuB,CAAK,CACrC,CAMA,YAAYA,EAAO,CACf,KAAK,MAAQA,CACjB,CACJ,EA/BaouB,GAAK,QAAU,IAAIA,GAAiB,SAAS,EAI7CA,GAAK,QAAU,IAAIA,GAAiB,SAAS,EAK7CA,GAAK,OAAS,IAAIA,GAAiB,QAAQ,EAbxDA,IAoCA,IAAIC,IACH,SAAUA,EAAkB,CACzBA,EAAiBA,EAAiB,YAAiB,CAAC,EAAI,aAC5D,GAAGA,KAAqBA,GAAmB,CAAA,EAAG,EAC9C,IAAIC,IACH,SAAUA,EAA0B,CACjCA,EAAyBA,EAAyB,OAAY,CAAC,EAAI,SACnEA,EAAyBA,EAAyB,UAAe,CAAC,EAAI,WAC1E,GAAGA,KAA6BA,GAA2B,CAAA,EAAG,EAI9D,IAAIC,IACH,SAAUA,EAAS,CAIhB,SAASvtB,EAAGF,EAAK,CACb,MAAI,CAACA,GAAO,OAAOA,GAAQ,SAChB,GAEJ,OAAOA,EAAI,IAAO,UACrB,OAAOA,EAAI,OAAU,QAC7B,CACAytB,EAAQ,GAAKvtB,CACjB,GAAGutB,KAAYA,GAAU,CAAA,EAAG,EAC5B,IAAIC,IACH,SAAUA,EAAe,CACtBA,EAAcA,EAAc,KAAU,CAAC,EAAI,OAC3CA,EAAcA,EAAc,UAAe,CAAC,EAAI,WACpD,GAAGA,KAAkBA,GAAgB,CAAA,EAAG,EA4BX,IAAIC,GClgBjC,IAAIC,IACH,SAAUA,EAAsB,CAI7BA,EAAqBA,EAAqB,QAAa,CAAC,EAAI,UAC5DA,EAAqBA,EAAqB,SAAc,CAAC,EAAI,WAC7DA,EAAqBA,EAAqB,QAAa,CAAC,EAAI,SAChE,GAAGA,KAAyBA,GAAuB,CAAA,EAAG,EACtD,IAAIC,IACH,SAAUA,EAAuB,CAC9BA,EAAsBA,EAAsB,OAAY,CAAC,EAAI,SAC7DA,EAAsBA,EAAsB,KAAU,CAAC,EAAI,MAC/D,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EACxD,IAAIC,IACH,SAAUA,EAA8B,CACrCA,EAA6BA,EAA6B,KAAU,CAAC,EAAI,OAKzEA,EAA6BA,EAA6B,eAAoB,CAAC,EAAI,iBAInFA,EAA6BA,EAA6B,gBAAqB,CAAC,EAAI,iBACxF,GAAGA,KAAiCA,GAA+B,CAAA,EAAG,EACtE,IAAIC,IACH,SAAUA,EAAoB,CAC3BA,EAAmBA,EAAmB,OAAY,CAAC,EAAI,SACvDA,EAAmBA,EAAmB,SAAc,CAAC,EAAI,WACzDA,EAAmBA,EAAmB,YAAiB,CAAC,EAAI,cAC5DA,EAAmBA,EAAmB,MAAW,CAAC,EAAI,QACtDA,EAAmBA,EAAmB,SAAc,CAAC,EAAI,WACzDA,EAAmBA,EAAmB,MAAW,CAAC,EAAI,QACtDA,EAAmBA,EAAmB,OAAY,CAAC,EAAI,SACvDA,EAAmBA,EAAmB,UAAe,CAAC,EAAI,YAC1DA,EAAmBA,EAAmB,OAAY,CAAC,EAAI,SACvDA,EAAmBA,EAAmB,SAAc,CAAC,EAAI,WACzDA,EAAmBA,EAAmB,MAAW,EAAE,EAAI,QACvDA,EAAmBA,EAAmB,SAAc,EAAE,EAAI,WAC1DA,EAAmBA,EAAmB,KAAU,EAAE,EAAI,OACtDA,EAAmBA,EAAmB,MAAW,EAAE,EAAI,QACvDA,EAAmBA,EAAmB,SAAc,EAAE,EAAI,WAC1DA,EAAmBA,EAAmB,KAAU,EAAE,EAAI,OACtDA,EAAmBA,EAAmB,WAAgB,EAAE,EAAI,aAC5DA,EAAmBA,EAAmB,QAAa,EAAE,EAAI,UACzDA,EAAmBA,EAAmB,KAAU,EAAE,EAAI,OACtDA,EAAmBA,EAAmB,MAAW,EAAE,EAAI,QACvDA,EAAmBA,EAAmB,KAAU,EAAE,EAAI,OACtDA,EAAmBA,EAAmB,UAAe,EAAE,EAAI,YAC3DA,EAAmBA,EAAmB,YAAiB,EAAE,EAAI,cAC7DA,EAAmBA,EAAmB,OAAY,EAAE,EAAI,SACxDA,EAAmBA,EAAmB,cAAmB,EAAE,EAAI,gBAC/DA,EAAmBA,EAAmB,KAAU,EAAE,EAAI,OACtDA,EAAmBA,EAAmB,MAAW,EAAE,EAAI,QACvDA,EAAmBA,EAAmB,KAAU,EAAE,EAAI,OACtDA,EAAmBA,EAAmB,QAAa,EAAE,EAAI,SAC7D,GAAGA,KAAuBA,GAAqB,CAAA,EAAG,EAClD,IAAIC,IACH,SAAUA,EAAmB,CAC1BA,EAAkBA,EAAkB,WAAgB,CAAC,EAAI,YAC7D,GAAGA,KAAsBA,GAAoB,CAAA,EAAG,EAIhD,IAAIC,IACH,SAAUA,EAAuB,CAC9BA,EAAsBA,EAAsB,OAAY,CAAC,EAAI,SAC7DA,EAAsBA,EAAsB,iBAAsB,CAAC,EAAI,mBACvEA,EAAsBA,EAAsB,gCAAqC,CAAC,EAAI,iCAC1F,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EAIxD,IAAIC,IACH,SAAUA,EAAiC,CAIxCA,EAAgCA,EAAgC,MAAW,CAAC,EAAI,QAIhFA,EAAgCA,EAAgC,MAAW,CAAC,EAAI,QAIhFA,EAAgCA,EAAgC,MAAW,CAAC,EAAI,OACpF,GAAGA,KAAoCA,GAAkC,CAAA,EAAG,EAI5E,IAAIC,IACH,SAAUA,EAAoB,CAI3BA,EAAmBA,EAAmB,OAAY,CAAC,EAAI,SAIvDA,EAAmBA,EAAmB,aAAkB,CAAC,EAAI,eAI7DA,EAAmBA,EAAmB,mBAAwB,CAAC,EAAI,qBAInEA,EAAmBA,EAAmB,SAAc,CAAC,EAAI,WAIzDA,EAAmBA,EAAmB,MAAW,CAAC,EAAI,QAItDA,EAAmBA,EAAmB,KAAU,CAAC,EAAI,OAIrDA,EAAmBA,EAAmB,KAAU,CAAC,EAAI,MACzD,GAAGA,KAAuBA,GAAqB,CAAA,EAAG,EAIlD,IAAIC,IACH,SAAUA,EAAkB,CAIzBA,EAAiBA,EAAiB,GAAQ,CAAC,EAAI,KAI/CA,EAAiBA,EAAiB,KAAU,CAAC,EAAI,MACrD,GAAGA,KAAqBA,GAAmB,CAAA,EAAG,EAI9C,IAAIrB,IACH,SAAUA,EAAuB,CAI9BA,EAAsBA,EAAsB,KAAU,CAAC,EAAI,OAI3DA,EAAsBA,EAAsB,KAAU,CAAC,EAAI,OAI3DA,EAAsBA,EAAsB,MAAW,CAAC,EAAI,OAChE,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EAIxD,IAAIsB,IACH,SAAUA,EAA0B,CACjCA,EAAyBA,EAAyB,KAAU,CAAC,EAAI,OACjEA,EAAyBA,EAAyB,KAAU,CAAC,EAAI,OACjEA,EAAyBA,EAAyB,SAAc,CAAC,EAAI,WACrEA,EAAyBA,EAAyB,SAAc,CAAC,EAAI,WACrEA,EAAyBA,EAAyB,KAAU,CAAC,EAAI,MACrE,GAAGA,KAA6BA,GAA2B,CAAA,EAAG,EAC9D,IAAIC,IACH,SAAUA,EAAc,CACrBA,EAAaA,EAAa,kCAAuC,CAAC,EAAI,oCACtEA,EAAaA,EAAa,wBAA6B,CAAC,EAAI,0BAC5DA,EAAaA,EAAa,qBAA0B,CAAC,EAAI,uBACzDA,EAAaA,EAAa,sBAA2B,CAAC,EAAI,wBAC1DA,EAAaA,EAAa,cAAmB,CAAC,EAAI,gBAClDA,EAAaA,EAAa,yBAA8B,CAAC,EAAI,2BAC7DA,EAAaA,EAAa,mBAAwB,CAAC,EAAI,qBACvDA,EAAaA,EAAa,sCAA2C,CAAC,EAAI,wCAC1EA,EAAaA,EAAa,UAAe,CAAC,EAAI,YAC9CA,EAAaA,EAAa,aAAkB,CAAC,EAAI,eACjDA,EAAaA,EAAa,oBAAyB,EAAE,EAAI,sBACzDA,EAAaA,EAAa,oBAAyB,EAAE,EAAI,sBACzDA,EAAaA,EAAa,qCAA0C,EAAE,EAAI,uCAC1EA,EAAaA,EAAa,kBAAuB,EAAE,EAAI,oBACvDA,EAAaA,EAAa,oBAAyB,EAAE,EAAI,sBACzDA,EAAaA,EAAa,kBAAuB,EAAE,EAAI,oBACvDA,EAAaA,EAAa,WAAgB,EAAE,EAAI,aAChDA,EAAaA,EAAa,kBAAuB,EAAE,EAAI,oBACvDA,EAAaA,EAAa,8BAAmC,EAAE,EAAI,gCACnEA,EAAaA,EAAa,gBAAqB,EAAE,EAAI,kBACrDA,EAAaA,EAAa,aAAkB,EAAE,EAAI,eAClDA,EAAaA,EAAa,wBAA6B,EAAE,EAAI,0BAC7DA,EAAaA,EAAa,OAAY,EAAE,EAAI,SAC5CA,EAAaA,EAAa,SAAc,EAAE,EAAI,WAC9CA,EAAaA,EAAa,mBAAwB,EAAE,EAAI,qBACxDA,EAAaA,EAAa,iBAAsB,EAAE,EAAI,mBACtDA,EAAaA,EAAa,gBAAqB,EAAE,EAAI,kBACrDA,EAAaA,EAAa,qBAA0B,EAAE,EAAI,uBAC1DA,EAAaA,EAAa,gBAAqB,EAAE,EAAI,kBACrDA,EAAaA,EAAa,SAAc,EAAE,EAAI,WAC9CA,EAAaA,EAAa,YAAiB,EAAE,EAAI,cACjDA,EAAaA,EAAa,2BAAgC,EAAE,EAAI,6BAChEA,EAAaA,EAAa,eAAoB,EAAE,EAAI,iBACpDA,EAAaA,EAAa,2BAAgC,EAAE,EAAI,6BAChEA,EAAaA,EAAa,YAAiB,EAAE,EAAI,cACjDA,EAAaA,EAAa,uBAA4B,EAAE,EAAI,yBAC5DA,EAAaA,EAAa,4BAAiC,EAAE,EAAI,8BACjEA,EAAaA,EAAa,YAAiB,EAAE,EAAI,cACjDA,EAAaA,EAAa,aAAkB,EAAE,EAAI,eAClDA,EAAaA,EAAa,oBAAyB,EAAE,EAAI,sBACzDA,EAAaA,EAAa,8BAAmC,EAAE,EAAI,gCACnEA,EAAaA,EAAa,YAAiB,EAAE,EAAI,cACjDA,EAAaA,EAAa,YAAiB,EAAE,EAAI,cACjDA,EAAaA,EAAa,eAAoB,EAAE,EAAI,iBACpDA,EAAaA,EAAa,YAAiB,EAAE,EAAI,cACjDA,EAAaA,EAAa,wBAA6B,EAAE,EAAI,0BAC7DA,EAAaA,EAAa,4BAAiC,EAAE,EAAI,8BACjEA,EAAaA,EAAa,gCAAqC,EAAE,EAAI,kCACrEA,EAAaA,EAAa,qBAA0B,EAAE,EAAI,uBAC1DA,EAAaA,EAAa,sBAA2B,EAAE,EAAI,wBAC3DA,EAAaA,EAAa,KAAU,EAAE,EAAI,OAC1CA,EAAaA,EAAa,qBAA0B,EAAE,EAAI,uBAC1DA,EAAaA,EAAa,QAAa,EAAE,EAAI,UAC7CA,EAAaA,EAAa,gBAAqB,EAAE,EAAI,kBACrDA,EAAaA,EAAa,iBAAsB,EAAE,EAAI,mBACtDA,EAAaA,EAAa,wBAA6B,EAAE,EAAI,0BAC7DA,EAAaA,EAAa,sBAA2B,EAAE,EAAI,wBAC3DA,EAAaA,EAAa,4BAAiC,EAAE,EAAI,8BACjEA,EAAaA,EAAa,WAAgB,EAAE,EAAI,aAChDA,EAAaA,EAAa,SAAc,EAAE,EAAI,WAC9CA,EAAaA,EAAa,cAAmB,EAAE,EAAI,gBACnDA,EAAaA,EAAa,SAAc,EAAE,EAAI,WAC9CA,EAAaA,EAAa,WAAgB,EAAE,EAAI,aAChDA,EAAaA,EAAa,eAAoB,EAAE,EAAI,iBACpDA,EAAaA,EAAa,cAAmB,EAAE,EAAI,gBACnDA,EAAaA,EAAa,aAAkB,EAAE,EAAI,eAClDA,EAAaA,EAAa,YAAiB,EAAE,EAAI,cACjDA,EAAaA,EAAa,aAAkB,EAAE,EAAI,eAClDA,EAAaA,EAAa,0BAA+B,EAAE,EAAI,4BAC/DA,EAAaA,EAAa,MAAW,EAAE,EAAI,QAC3CA,EAAaA,EAAa,aAAkB,EAAE,EAAI,eAClDA,EAAaA,EAAa,cAAmB,EAAE,EAAI,gBACnDA,EAAaA,EAAa,cAAmB,EAAE,EAAI,gBACnDA,EAAaA,EAAa,UAAe,EAAE,EAAI,YAC/CA,EAAaA,EAAa,qBAA0B,EAAE,EAAI,uBAC1DA,EAAaA,EAAa,WAAgB,EAAE,EAAI,aAChDA,EAAaA,EAAa,YAAiB,EAAE,EAAI,cACjDA,EAAaA,EAAa,oBAAyB,EAAE,EAAI,sBACzDA,EAAaA,EAAa,cAAmB,EAAE,EAAI,gBACnDA,EAAaA,EAAa,MAAW,EAAE,EAAI,QAC3CA,EAAaA,EAAa,cAAmB,EAAE,EAAI,gBACnDA,EAAaA,EAAa,QAAa,EAAE,EAAI,UAC7CA,EAAaA,EAAa,WAAgB,EAAE,EAAI,aAChDA,EAAaA,EAAa,4BAAiC,EAAE,EAAI,8BACjEA,EAAaA,EAAa,eAAoB,EAAE,EAAI,iBACpDA,EAAaA,EAAa,4BAAiC,EAAE,EAAI,8BACjEA,EAAaA,EAAa,oBAAyB,EAAE,EAAI,sBACzDA,EAAaA,EAAa,uBAA4B,EAAE,EAAI,yBAC5DA,EAAaA,EAAa,iBAAsB,EAAE,EAAI,mBACtDA,EAAaA,EAAa,iBAAsB,EAAE,EAAI,mBACtDA,EAAaA,EAAa,qBAA0B,EAAE,EAAI,uBAC1DA,EAAaA,EAAa,0BAA+B,EAAE,EAAI,4BAC/DA,EAAaA,EAAa,oBAAyB,EAAE,EAAI,sBACzDA,EAAaA,EAAa,gBAAqB,EAAE,EAAI,kBACrDA,EAAaA,EAAa,oBAAyB,EAAE,EAAI,sBACzDA,EAAaA,EAAa,mBAAwB,EAAE,EAAI,qBACxDA,EAAaA,EAAa,QAAa,EAAE,EAAI,UAC7CA,EAAaA,EAAa,QAAa,EAAE,EAAI,UAC7CA,EAAaA,EAAa,eAAoB,EAAE,EAAI,iBACpDA,EAAaA,EAAa,uBAA4B,EAAE,EAAI,yBAC5DA,EAAaA,EAAa,YAAiB,GAAG,EAAI,cAClDA,EAAaA,EAAa,0BAA+B,GAAG,EAAI,4BAChEA,EAAaA,EAAa,iBAAsB,GAAG,EAAI,mBACvDA,EAAaA,EAAa,sBAA2B,GAAG,EAAI,wBAC5DA,EAAaA,EAAa,SAAc,GAAG,EAAI,WAC/CA,EAAaA,EAAa,gBAAqB,GAAG,EAAI,kBACtDA,EAAaA,EAAa,aAAkB,GAAG,EAAI,eACnDA,EAAaA,EAAa,8BAAmC,GAAG,EAAI,gCACpEA,EAAaA,EAAa,wBAA6B,GAAG,EAAI,0BAC9DA,EAAaA,EAAa,mBAAwB,GAAG,EAAI,qBACzDA,EAAaA,EAAa,oBAAyB,GAAG,EAAI,sBAC1DA,EAAaA,EAAa,iCAAsC,GAAG,EAAI,mCACvEA,EAAaA,EAAa,4BAAiC,GAAG,EAAI,8BAClEA,EAAaA,EAAa,iBAAsB,GAAG,EAAI,mBACvDA,EAAaA,EAAa,6BAAkC,GAAG,EAAI,+BACnEA,EAAaA,EAAa,iBAAsB,GAAG,EAAI,mBACvDA,EAAaA,EAAa,OAAY,GAAG,EAAI,SAC7CA,EAAaA,EAAa,UAAe,GAAG,EAAI,YAChDA,EAAaA,EAAa,uBAA4B,GAAG,EAAI,yBAC7DA,EAAaA,EAAa,qBAA0B,GAAG,EAAI,uBAC3DA,EAAaA,EAAa,sBAA2B,GAAG,EAAI,wBAC5DA,EAAaA,EAAa,mBAAwB,GAAG,EAAI,qBACzDA,EAAaA,EAAa,mBAAwB,GAAG,EAAI,qBACzDA,EAAaA,EAAa,4BAAiC,GAAG,EAAI,8BAClEA,EAAaA,EAAa,4BAAiC,GAAG,EAAI,8BAClEA,EAAaA,EAAa,oBAAyB,GAAG,EAAI,sBAC1DA,EAAaA,EAAa,oBAAyB,GAAG,EAAI,sBAC1DA,EAAaA,EAAa,WAAgB,GAAG,EAAI,aACjDA,EAAaA,EAAa,mBAAwB,GAAG,EAAI,qBACzDA,EAAaA,EAAa,YAAiB,GAAG,EAAI,cAClDA,EAAaA,EAAa,gBAAqB,GAAG,EAAI,kBACtDA,EAAaA,EAAa,aAAkB,GAAG,EAAI,eACnDA,EAAaA,EAAa,eAAoB,GAAG,EAAI,iBACrDA,EAAaA,EAAa,uBAA4B,GAAG,EAAI,yBAC7DA,EAAaA,EAAa,QAAa,GAAG,EAAI,UAC9CA,EAAaA,EAAa,gBAAqB,GAAG,EAAI,kBACtDA,EAAaA,EAAa,kBAAuB,GAAG,EAAI,oBACxDA,EAAaA,EAAa,2BAAgC,GAAG,EAAI,6BACjEA,EAAaA,EAAa,iBAAsB,GAAG,EAAI,mBACvDA,EAAaA,EAAa,cAAmB,GAAG,EAAI,gBACpDA,EAAaA,EAAa,SAAc,GAAG,EAAI,WAC/CA,EAAaA,EAAa,uBAA4B,GAAG,EAAI,yBAC7DA,EAAaA,EAAa,oBAAyB,GAAG,EAAI,sBAC1DA,EAAaA,EAAa,uBAA4B,GAAG,EAAI,yBAC7DA,EAAaA,EAAa,aAAkB,GAAG,EAAI,eACnDA,EAAaA,EAAa,YAAiB,GAAG,EAAI,cAClDA,EAAaA,EAAa,UAAe,GAAG,EAAI,YAChDA,EAAaA,EAAa,qBAA0B,GAAG,EAAI,uBAC3DA,EAAaA,EAAa,eAAoB,GAAG,EAAI,iBACrDA,EAAaA,EAAa,SAAc,GAAG,EAAI,WAC/CA,EAAaA,EAAa,6BAAkC,GAAG,EAAI,+BACnEA,EAAaA,EAAa,8BAAmC,GAAG,EAAI,gCACpEA,EAAaA,EAAa,eAAoB,GAAG,EAAI,iBACrDA,EAAaA,EAAa,kBAAuB,GAAG,EAAI,oBACxDA,EAAaA,EAAa,kBAAuB,GAAG,EAAI,oBACxDA,EAAaA,EAAa,eAAoB,GAAG,EAAI,iBACrDA,EAAaA,EAAa,iBAAsB,GAAG,EAAI,mBACvDA,EAAaA,EAAa,eAAoB,GAAG,EAAI,iBACrDA,EAAaA,EAAa,eAAoB,GAAG,EAAI,iBACrDA,EAAaA,EAAa,WAAgB,GAAG,EAAI,aACjDA,EAAaA,EAAa,uBAA4B,GAAG,EAAI,yBAC7DA,EAAaA,EAAa,qBAA0B,GAAG,EAAI,uBAC3DA,EAAaA,EAAa,gBAAqB,GAAG,EAAI,kBACtDA,EAAaA,EAAa,WAAgB,GAAG,EAAI,aACjDA,EAAaA,EAAa,aAAkB,GAAG,EAAI,eACnDA,EAAaA,EAAa,WAAgB,GAAG,EAAI,aACjDA,EAAaA,EAAa,aAAkB,GAAG,EAAI,eACnDA,EAAaA,EAAa,uBAA4B,GAAG,EAAI,yBAC7DA,EAAaA,EAAa,2BAAgC,GAAG,EAAI,6BACjEA,EAAaA,EAAa,sCAA2C,GAAG,EAAI,wCAC5EA,EAAaA,EAAa,qBAA0B,GAAG,EAAI,uBAC3DA,EAAaA,EAAa,oBAAyB,GAAG,EAAI,sBAC1DA,EAAaA,EAAa,4BAAiC,GAAG,EAAI,6BACtE,GAAGA,KAAiBA,GAAe,CAAA,EAAG,EAItC,IAAIC,IACH,SAAUA,EAAqB,CAI5BA,EAAoBA,EAAoB,YAAiB,CAAC,EAAI,cAI9DA,EAAoBA,EAAoB,GAAQ,CAAC,EAAI,KAIrDA,EAAoBA,EAAoB,KAAU,CAAC,EAAI,MAC3D,GAAGA,KAAwBA,GAAsB,CAAA,EAAG,EAIpD,IAAIC,IACH,SAAUA,EAAmB,CAI1BA,EAAkBA,EAAkB,GAAQ,CAAC,EAAI,KAIjDA,EAAkBA,EAAkB,KAAU,CAAC,EAAI,MACvD,GAAGA,KAAsBA,GAAoB,CAAA,EAAG,EAIhD,IAAIC,IACH,SAAUA,EAAiB,CACxBA,EAAgBA,EAAgB,KAAU,CAAC,EAAI,OAC/CA,EAAgBA,EAAgB,OAAY,CAAC,EAAI,SACjDA,EAAgBA,EAAgB,MAAW,CAAC,EAAI,OACpD,GAAGA,KAAoBA,GAAkB,CAAA,EAAG,EAC5C,IAAItC,IACH,SAAUA,EAAsB,CAI7BA,EAAqBA,EAAqB,SAAc,CAAC,EAAI,WAI7DA,EAAqBA,EAAqB,SAAc,CAAC,EAAI,UACjE,GAAGA,KAAyBA,GAAuB,CAAA,EAAG,EAItD,IAAIuC,IACH,SAAUA,EAAc,CAIrBA,EAAaA,EAAa,KAAU,CAAC,EAAI,OAIzCA,EAAaA,EAAa,OAAY,CAAC,EAAI,SAM3CA,EAAaA,EAAa,cAAmB,CAAC,EAAI,gBAIlDA,EAAaA,EAAa,QAAa,CAAC,EAAI,SAChD,GAAGA,KAAiBA,GAAe,CAAA,EAAG,EACtC,IAAIC,IACH,SAAUA,EAAyB,CAChCA,EAAwBA,EAAwB,KAAU,CAAC,EAAI,OAC/DA,EAAwBA,EAAwB,MAAW,CAAC,EAAI,QAChEA,EAAwBA,EAAwB,KAAU,CAAC,EAAI,OAC/DA,EAAwBA,EAAwB,KAAU,CAAC,EAAI,MACnE,GAAGA,KAA4BA,GAA0B,CAAA,EAAG,EAC5D,IAAIjB,IACH,SAAUA,EAAe,CACtBA,EAAcA,EAAc,KAAU,CAAC,EAAI,OAC3CA,EAAcA,EAAc,UAAe,CAAC,EAAI,WACpD,GAAGA,KAAkBA,GAAgB,CAAA,EAAG,EACxC,IAAId,IACH,SAAUA,EAAqC,CAC5CA,EAAoCA,EAAoC,SAAc,CAAC,EAAI,WAC3FA,EAAoCA,EAAoC,SAAc,CAAC,EAAI,WAC3FA,EAAoCA,EAAoC,QAAa,CAAC,EAAI,SAC9F,GAAGA,KAAwCA,GAAsC,CAAA,EAAG,EACpF,IAAID,IACH,SAAUA,EAA2B,CAClCA,EAA0BA,EAA0B,KAAU,CAAC,EAAI,OACnEA,EAA0BA,EAA0B,MAAW,CAAC,EAAI,OACxE,GAAGA,KAA8BA,GAA4B,CAAA,EAAG,EAIhE,IAAID,IACH,SAAUA,EAA6B,CAKpCA,EAA4BA,EAA4B,UAAe,CAAC,EAAI,YAK5EA,EAA4BA,EAA4B,SAAc,CAAC,EAAI,UAC/E,GAAGA,KAAgCA,GAA8B,CAAA,EAAG,EAMpE,IAAIkC,IACH,SAAUA,EAAS,CAChBA,EAAQA,EAAQ,kBAAuB,EAAE,EAAI,oBAI7CA,EAAQA,EAAQ,QAAa,CAAC,EAAI,UAClCA,EAAQA,EAAQ,UAAe,CAAC,EAAI,YACpCA,EAAQA,EAAQ,IAAS,CAAC,EAAI,MAC9BA,EAAQA,EAAQ,MAAW,CAAC,EAAI,QAChCA,EAAQA,EAAQ,MAAW,CAAC,EAAI,QAChCA,EAAQA,EAAQ,KAAU,CAAC,EAAI,OAC/BA,EAAQA,EAAQ,IAAS,CAAC,EAAI,MAC9BA,EAAQA,EAAQ,WAAgB,CAAC,EAAI,aACrCA,EAAQA,EAAQ,SAAc,CAAC,EAAI,WACnCA,EAAQA,EAAQ,OAAY,CAAC,EAAI,SACjCA,EAAQA,EAAQ,MAAW,EAAE,EAAI,QACjCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,SAAc,EAAE,EAAI,WACpCA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,UAAe,EAAE,EAAI,YACrCA,EAAQA,EAAQ,QAAa,EAAE,EAAI,UACnCA,EAAQA,EAAQ,WAAgB,EAAE,EAAI,aACtCA,EAAQA,EAAQ,UAAe,EAAE,EAAI,YACrCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAClCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,KAAU,EAAE,EAAI,OAChCA,EAAQA,EAAQ,YAAiB,EAAE,EAAI,cACvCA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,GAAQ,EAAE,EAAI,KAC9BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,IAAS,EAAE,EAAI,MAC/BA,EAAQA,EAAQ,QAAa,EAAE,EAAI,UACnCA,EAAQA,EAAQ,WAAgB,EAAE,EAAI,aAKtCA,EAAQA,EAAQ,UAAe,EAAE,EAAI,YAKrCA,EAAQA,EAAQ,MAAW,EAAE,EAAI,QAKjCA,EAAQA,EAAQ,MAAW,EAAE,EAAI,QAKjCA,EAAQA,EAAQ,MAAW,EAAE,EAAI,QAKjCA,EAAQA,EAAQ,OAAY,EAAE,EAAI,SAKlCA,EAAQA,EAAQ,MAAW,EAAE,EAAI,QAKjCA,EAAQA,EAAQ,UAAe,EAAE,EAAI,YAKrCA,EAAQA,EAAQ,YAAiB,EAAE,EAAI,cAKvCA,EAAQA,EAAQ,UAAe,EAAE,EAAI,YAKrCA,EAAQA,EAAQ,aAAkB,EAAE,EAAI,eAKxCA,EAAQA,EAAQ,MAAW,EAAE,EAAI,QAIjCA,EAAQA,EAAQ,MAAW,EAAE,EAAI,QAIjCA,EAAQA,EAAQ,cAAmB,EAAE,EAAI,gBACzCA,EAAQA,EAAQ,QAAa,EAAE,EAAI,UACnCA,EAAQA,EAAQ,QAAa,EAAE,EAAI,UACnCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,eAAoB,GAAG,EAAI,iBAC3CA,EAAQA,EAAQ,UAAe,GAAG,EAAI,YACtCA,EAAQA,EAAQ,iBAAsB,GAAG,EAAI,mBAC7CA,EAAQA,EAAQ,eAAoB,GAAG,EAAI,iBAC3CA,EAAQA,EAAQ,cAAmB,GAAG,EAAI,gBAC1CA,EAAQA,EAAQ,aAAkB,GAAG,EAAI,eAIzCA,EAAQA,EAAQ,mBAAwB,GAAG,EAAI,qBAC/CA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,QAAa,GAAG,EAAI,UACpCA,EAAQA,EAAQ,gBAAqB,GAAG,EAAI,kBAC5CA,EAAQA,EAAQ,cAAmB,GAAG,EAAI,gBAC1CA,EAAQA,EAAQ,gBAAqB,GAAG,EAAI,kBAC5CA,EAAQA,EAAQ,cAAmB,GAAG,EAAI,gBAC1CA,EAAQA,EAAQ,YAAiB,GAAG,EAAI,cACxCA,EAAQA,EAAQ,YAAiB,GAAG,EAAI,cACxCA,EAAQA,EAAQ,eAAoB,GAAG,EAAI,iBAC3CA,EAAQA,EAAQ,eAAoB,GAAG,EAAI,iBAC3CA,EAAQA,EAAQ,mBAAwB,GAAG,EAAI,qBAC/CA,EAAQA,EAAQ,UAAe,GAAG,EAAI,YACtCA,EAAQA,EAAQ,eAAoB,GAAG,EAAI,iBAC3CA,EAAQA,EAAQ,kBAAuB,GAAG,EAAI,oBAC9CA,EAAQA,EAAQ,WAAgB,GAAG,EAAI,aACvCA,EAAQA,EAAQ,WAAgB,GAAG,EAAI,aAIvCA,EAAQA,EAAQ,MAAW,GAAG,EAAI,QAKlCA,EAAQA,EAAQ,UAAe,GAAG,EAAI,WAC1C,GAAGA,KAAYA,GAAU,CAAA,EAAG,EAC5B,IAAIC,IACH,SAAUA,EAAgB,CACvBA,EAAeA,EAAe,KAAU,CAAC,EAAI,OAC7CA,EAAeA,EAAe,KAAU,CAAC,EAAI,OAC7CA,EAAeA,EAAe,QAAa,CAAC,EAAI,UAChDA,EAAeA,EAAe,MAAW,CAAC,EAAI,OAClD,GAAGA,KAAmBA,GAAiB,CAAA,EAAG,EAC1C,IAAIC,IACH,SAAUA,EAAW,CAClBA,EAAUA,EAAU,YAAiB,CAAC,EAAI,cAC1CA,EAAUA,EAAU,WAAgB,CAAC,EAAI,YAC7C,GAAGA,KAAcA,GAAY,CAAA,EAAG,EAIhC,IAAIC,IACH,SAAUA,EAAiB,CACxBA,EAAgBA,EAAgB,OAAY,CAAC,EAAI,SACjDA,EAAgBA,EAAgB,OAAY,CAAC,EAAI,QACrD,GAAGA,KAAoBA,GAAkB,CAAA,EAAG,EAI5C,IAAIC,IACH,SAAUA,EAA2B,CAClCA,EAA0BA,EAA0B,OAAY,CAAC,EAAI,SACrEA,EAA0BA,EAA0B,WAAgB,CAAC,EAAI,YAC7E,GAAGA,KAA8BA,GAA4B,CAAA,EAAG,EAIhE,IAAIC,IACH,SAAUA,EAAiB,CAIxBA,EAAgBA,EAAgB,QAAa,CAAC,EAAI,UAIlDA,EAAgBA,EAAgB,SAAc,CAAC,EAAI,WAInDA,EAAgBA,EAAgB,oBAAyB,CAAC,EAAI,sBAI9DA,EAAgBA,EAAgB,oBAAyB,CAAC,EAAI,sBAI9DA,EAAgBA,EAAgB,wBAA6B,CAAC,EAAI,0BAIlEA,EAAgBA,EAAgB,iBAAsB,CAAC,EAAI,mBAI3DA,EAAgBA,EAAgB,aAAkB,CAAC,EAAI,eAIvDA,EAAgBA,EAAgB,cAAmB,CAAC,EAAI,gBAIxDA,EAAgBA,EAAgB,kBAAuB,CAAC,EAAI,oBAI5DA,EAAgBA,EAAgB,eAAoB,CAAC,EAAI,iBAIzDA,EAAgBA,EAAgB,eAAoB,EAAE,EAAI,iBAI1DA,EAAgBA,EAAgB,UAAe,EAAE,EAAI,YAIrDA,EAAgBA,EAAgB,eAAoB,EAAE,EAAI,iBAI1DA,EAAgBA,EAAgB,eAAoB,EAAE,EAAI,gBAC9D,GAAGA,KAAoBA,GAAkB,CAAA,EAAG,EAC5C,IAAI1B,IACH,SAAUA,EAAkB,CACzBA,EAAiBA,EAAiB,YAAiB,CAAC,EAAI,aAC5D,GAAGA,KAAqBA,GAAmB,CAAA,EAAG,EAC9C,IAAIC,IACH,SAAUA,EAA0B,CACjCA,EAAyBA,EAAyB,OAAY,CAAC,EAAI,SACnEA,EAAyBA,EAAyB,UAAe,CAAC,EAAI,WAC1E,GAAGA,KAA6BA,GAA2B,CAAA,EAAG,EAI9D,IAAI0B,IACH,SAAUA,EAAiC,CAIxCA,EAAgCA,EAAgC,iBAAsB,CAAC,EAAI,mBAI3FA,EAAgCA,EAAgC,oBAAyB,CAAC,EAAI,sBAI9FA,EAAgCA,EAAgC,WAAgB,CAAC,EAAI,YACzF,GAAGA,KAAoCA,GAAkC,CAAA,EAAG,EAI5E,IAAIC,IACH,SAAUA,EAAmB,CAC1BA,EAAkBA,EAAkB,KAAU,CAAC,EAAI,OACnDA,EAAkBA,EAAkB,OAAY,CAAC,EAAI,SACrDA,EAAkBA,EAAkB,MAAW,CAAC,EAAI,QACpDA,EAAkBA,EAAkB,KAAU,CAAC,EAAI,MACvD,GAAGA,KAAsBA,GAAoB,CAAA,EAAG,EAIhD,IAAIC,IACH,SAAUA,EAA0B,CACjCA,EAAyBA,EAAyB,KAAU,CAAC,EAAI,OACjEA,EAAyBA,EAAyB,KAAU,CAAC,EAAI,OACjEA,EAAyBA,EAAyB,QAAa,CAAC,EAAI,SACxE,GAAGA,KAA6BA,GAA2B,CAAA,EAAG,EAC9D,IAAIC,IACH,SAAUA,EAAkB,CAIzBA,EAAiBA,EAAiB,KAAU,CAAC,EAAI,OAIjDA,EAAiBA,EAAiB,MAAW,CAAC,EAAI,QAIlDA,EAAiBA,EAAiB,KAAU,CAAC,EAAI,OAIjDA,EAAiBA,EAAiB,mBAAwB,CAAC,EAAI,qBAI/DA,EAAiBA,EAAiB,oBAAyB,CAAC,EAAI,qBACpE,GAAGA,KAAqBA,GAAmB,CAAA,EAAG,EAC9C,IAAIC,IACH,SAAUA,EAAuB,CAC9BA,EAAsBA,EAAsB,IAAS,CAAC,EAAI,MAC1DA,EAAsBA,EAAsB,GAAQ,CAAC,EAAI,KACzDA,EAAsBA,EAAsB,SAAc,CAAC,EAAI,WAC/DA,EAAsBA,EAAsB,SAAc,CAAC,EAAI,WAC/DA,EAAsBA,EAAsB,OAAY,CAAC,EAAI,QACjE,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EACxD,IAAIC,IACH,SAAUA,EAAe,CACtBA,EAAcA,EAAc,KAAU,CAAC,EAAI,OAC3CA,EAAcA,EAAc,KAAU,CAAC,EAAI,OAC3CA,EAAcA,EAAc,OAAY,CAAC,EAAI,QACjD,GAAGA,KAAkBA,GAAgB,CAAA,EAAG,EACxC,IAAIC,IACH,SAAUA,EAAY,CACnBA,EAAWA,EAAW,OAAY,CAAC,EAAI,SACvCA,EAAWA,EAAW,UAAe,CAAC,EAAI,WAC9C,GAAGA,KAAeA,GAAa,CAAA,EAAG,EAClC,IAAIC,IACH,SAAUA,EAAqB,CAC5BA,EAAoBA,EAAoB,KAAU,CAAC,EAAI,OACvDA,EAAoBA,EAAoB,OAAY,CAAC,EAAI,SACzDA,EAAoBA,EAAoB,QAAa,CAAC,EAAI,SAC9D,GAAGA,KAAwBA,GAAsB,CAAA,EAAG,EAIpD,IAAIC,IACH,SAAUA,EAAoB,CAI3BA,EAAmBA,EAAmB,IAAS,CAAC,EAAI,MAIpDA,EAAmBA,EAAmB,IAAS,CAAC,EAAI,KACxD,GAAGA,KAAuBA,GAAqB,CAAA,EAAG,EAClD,IAAIC,IACH,SAAUA,EAAuB,CAC9BA,EAAsB,IAAS,MAC/BA,EAAsB,OAAY,SAClCA,EAAsB,GAAQ,IAClC,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EACxD,IAAI7C,IACH,SAAUA,EAA0B,CACjCA,EAAyBA,EAAyB,OAAY,CAAC,EAAI,SACnEA,EAAyBA,EAAyB,iBAAsB,CAAC,EAAI,mBAC7EA,EAAyBA,EAAyB,cAAmB,CAAC,EAAI,eAC9E,GAAGA,KAA6BA,GAA2B,CAAA,EAAG,EAI9D,IAAI8C,IACH,SAAUA,EAAY,CACnBA,EAAWA,EAAW,KAAU,CAAC,EAAI,OACrCA,EAAWA,EAAW,OAAY,CAAC,EAAI,SACvCA,EAAWA,EAAW,UAAe,CAAC,EAAI,YAC1CA,EAAWA,EAAW,QAAa,CAAC,EAAI,UACxCA,EAAWA,EAAW,MAAW,CAAC,EAAI,QACtCA,EAAWA,EAAW,OAAY,CAAC,EAAI,SACvCA,EAAWA,EAAW,SAAc,CAAC,EAAI,WACzCA,EAAWA,EAAW,MAAW,CAAC,EAAI,QACtCA,EAAWA,EAAW,YAAiB,CAAC,EAAI,cAC5CA,EAAWA,EAAW,KAAU,CAAC,EAAI,OACrCA,EAAWA,EAAW,UAAe,EAAE,EAAI,YAC3CA,EAAWA,EAAW,SAAc,EAAE,EAAI,WAC1CA,EAAWA,EAAW,SAAc,EAAE,EAAI,WAC1CA,EAAWA,EAAW,SAAc,EAAE,EAAI,WAC1CA,EAAWA,EAAW,OAAY,EAAE,EAAI,SACxCA,EAAWA,EAAW,OAAY,EAAE,EAAI,SACxCA,EAAWA,EAAW,QAAa,EAAE,EAAI,UACzCA,EAAWA,EAAW,MAAW,EAAE,EAAI,QACvCA,EAAWA,EAAW,OAAY,EAAE,EAAI,SACxCA,EAAWA,EAAW,IAAS,EAAE,EAAI,MACrCA,EAAWA,EAAW,KAAU,EAAE,EAAI,OACtCA,EAAWA,EAAW,WAAgB,EAAE,EAAI,aAC5CA,EAAWA,EAAW,OAAY,EAAE,EAAI,SACxCA,EAAWA,EAAW,MAAW,EAAE,EAAI,QACvCA,EAAWA,EAAW,SAAc,EAAE,EAAI,WAC1CA,EAAWA,EAAW,cAAmB,EAAE,EAAI,eACnD,GAAGA,KAAeA,GAAa,CAAA,EAAG,EAClC,IAAIC,IACH,SAAUA,EAAW,CAClBA,EAAUA,EAAU,WAAgB,CAAC,EAAI,YAC7C,GAAGA,KAAcA,GAAY,CAAA,EAAG,EAIhC,IAAIC,IACH,SAAUA,EAAe,CACtBA,EAAcA,EAAc,IAAS,CAAC,EAAI,MAC1CA,EAAcA,EAAc,IAAS,CAAC,EAAI,KAC9C,GAAGA,KAAkBA,GAAgB,CAAA,EAAG,EAIxC,IAAIC,IACH,SAAUA,EAA+B,CAItCA,EAA8BA,EAA8B,OAAY,CAAC,EAAI,SAI7EA,EAA8BA,EAA8B,MAAW,CAAC,EAAI,QAI5EA,EAA8BA,EAA8B,OAAY,CAAC,EAAI,SAI7EA,EAA8BA,EAA8B,MAAW,CAAC,EAAI,QAI5EA,EAA8BA,EAA8B,OAAY,CAAC,EAAI,SAI7EA,EAA8BA,EAA8B,MAAW,CAAC,EAAI,OAChF,GAAGA,KAAkCA,GAAgC,CAAA,EAAG,EAIxE,IAAIC,IACH,SAAUA,EAAuB,CAI9BA,EAAsBA,EAAsB,KAAU,CAAC,EAAI,OAI3DA,EAAsBA,EAAsB,MAAW,CAAC,EAAI,QAI5DA,EAAsBA,EAAsB,UAAe,CAAC,EAAI,YAIhEA,EAAsBA,EAAsB,SAAc,CAAC,EAAI,WAI/DA,EAAsBA,EAAsB,aAAkB,CAAC,EAAI,eAInEA,EAAsBA,EAAsB,cAAmB,CAAC,EAAI,eACxE,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EAKxD,IAAIC,IACH,SAAUA,EAAwB,CAC/BA,EAAuBA,EAAuB,6BAAkC,CAAC,EAAI,+BACrFA,EAAuBA,EAAuB,4BAAiC,CAAC,EAAI,8BACpFA,EAAuBA,EAAuB,0BAA+B,CAAC,EAAI,4BAClFA,EAAuBA,EAAuB,yBAA8B,CAAC,EAAI,0BACrF,GAAGA,KAA2BA,GAAyB,CAAA,EAAG,EAI1D,IAAIC,IACH,SAAUA,EAAgB,CAIvBA,EAAeA,EAAe,KAAU,CAAC,EAAI,OAI7CA,EAAeA,EAAe,KAAU,CAAC,EAAI,OAI7CA,EAAeA,EAAe,OAAY,CAAC,EAAI,SAI/CA,EAAeA,EAAe,WAAgB,CAAC,EAAI,YACvD,GAAGA,KAAmBA,GAAiB,CAAA,EAAG,ECx+B1C,MAAMC,GAAN,MAAMA,EAAO,CAKT,OAAO,MAAMvN,EAAWC,EAAY,CAChC,OAAOF,GAASC,EAAWC,CAAU,CACzC,CACJ,EAPasN,GAAK,QAAU,KACfA,GAAK,MAAQ,KACbA,GAAK,IAAM,IACXA,GAAK,QAAU,IAJ5B,IAAMC,GAAND,GASA,SAASE,IAAsB,CAC3B,MAAO,CACH,OAAQ,OACR,UAAW,OACX,wBAAyBvP,GACzB,QAAShb,GACT,QAAS8oB,GACT,OAAQwB,GACR,SAAU7V,EACV,MAAOc,EACP,UAAWoP,GACX,mBAAoBiF,GACpB,eAAgBb,GAChB,UAAWC,GACX,IAAKlG,GACL,MAAOqD,EACf,CACA,CCpCG,IAASqE,GAyHZ,MAAMC,EAAU,CACZ,aAAc,CACV,KAAKD,EAAE,EAAI,YACX,KAAK,KAAO,IAAI,IAChB,KAAK,MAAQ,OACb,KAAK,MAAQ,OACb,KAAK,MAAQ,EACb,KAAK,OAAS,CAClB,CACA,OAAQ,CACJ,KAAK,KAAK,MAAK,EACf,KAAK,MAAQ,OACb,KAAK,MAAQ,OACb,KAAK,MAAQ,EACb,KAAK,QACT,CACA,SAAU,CACN,MAAO,CAAC,KAAK,OAAS,CAAC,KAAK,KAChC,CACA,IAAI,MAAO,CACP,OAAO,KAAK,KAChB,CACA,IAAI,OAAQ,CACR,OAAO,KAAK,OAAO,KACvB,CACA,IAAI,MAAO,CACP,OAAO,KAAK,OAAO,KACvB,CACA,IAAIhjB,EAAK,CACL,OAAO,KAAK,KAAK,IAAIA,CAAG,CAC5B,CACA,IAAIA,EAAKkjB,EAAQ,EAAoB,CACjC,MAAM9uB,EAAO,KAAK,KAAK,IAAI4L,CAAG,EAC9B,GAAK5L,EAGL,OAAI8uB,IAAU,GACV,KAAK,MAAM9uB,EAAM8uB,CAAK,EAEnB9uB,EAAK,KAChB,CACA,IAAI4L,EAAKpO,EAAOsxB,EAAQ,EAAoB,CACxC,IAAI9uB,EAAO,KAAK,KAAK,IAAI4L,CAAG,EAC5B,GAAI5L,EACAA,EAAK,MAAQxC,EACTsxB,IAAU,GACV,KAAK,MAAM9uB,EAAM8uB,CAAK,MAGzB,CAED,OADA9uB,EAAO,CAAE,IAAA4L,EAAK,MAAApO,EAAO,KAAM,OAAW,SAAU,MAAS,EACjDsxB,EAAK,CACT,IAAK,GACD,KAAK,YAAY9uB,CAAI,EACrB,MACJ,IAAK,GACD,KAAK,aAAaA,CAAI,EACtB,MACJ,IAAK,GACD,KAAK,YAAYA,CAAI,EACrB,MACJ,QACI,KAAK,YAAYA,CAAI,EACrB,KACpB,CACY,KAAK,KAAK,IAAI4L,EAAK5L,CAAI,EACvB,KAAK,OACT,CACA,OAAO,IACX,CACA,OAAO4L,EAAK,CACR,MAAO,CAAC,CAAC,KAAK,OAAOA,CAAG,CAC5B,CACA,OAAOA,EAAK,CACR,MAAM5L,EAAO,KAAK,KAAK,IAAI4L,CAAG,EAC9B,GAAK5L,EAGL,YAAK,KAAK,OAAO4L,CAAG,EACpB,KAAK,WAAW5L,CAAI,EACpB,KAAK,QACEA,EAAK,KAChB,CACA,OAAQ,CACJ,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACrB,OAEJ,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACrB,MAAM,IAAI,MAAM,cAAc,EAElC,MAAMA,EAAO,KAAK,MAClB,YAAK,KAAK,OAAOA,EAAK,GAAG,EACzB,KAAK,WAAWA,CAAI,EACpB,KAAK,QACEA,EAAK,KAChB,CACA,QAAQ+uB,EAAYC,EAAS,CACzB,MAAMxR,EAAQ,KAAK,OACnB,IAAIyR,EAAU,KAAK,MACnB,KAAOA,GAAS,CAOZ,GANID,EACAD,EAAW,KAAKC,CAAO,EAAEC,EAAQ,MAAOA,EAAQ,IAAK,IAAI,EAGzDF,EAAWE,EAAQ,MAAOA,EAAQ,IAAK,IAAI,EAE3C,KAAK,SAAWzR,EAChB,MAAM,IAAI,MAAM,0CAA0C,EAE9DyR,EAAUA,EAAQ,IACtB,CACJ,CACA,MAAO,CACH,MAAMvvB,EAAM,KACN8d,EAAQ,KAAK,OACnB,IAAIyR,EAAU,KAAK,MACnB,MAAMpuB,EAAW,CACb,CAAC,OAAO,QAAQ,GAAI,CAChB,OAAOA,CACX,EACA,MAAO,CACH,GAAInB,EAAI,SAAW8d,EACf,MAAM,IAAI,MAAM,0CAA0C,EAE9D,GAAIyR,EAAS,CACT,MAAM5xB,EAAS,CAAE,MAAO4xB,EAAQ,IAAK,KAAM,EAAK,EAChD,OAAAA,EAAUA,EAAQ,KACX5xB,CACX,KAEI,OAAO,CAAE,MAAO,OAAW,KAAM,EAAI,CAE7C,CACZ,EACQ,OAAOwD,CACX,CACA,QAAS,CACL,MAAMnB,EAAM,KACN8d,EAAQ,KAAK,OACnB,IAAIyR,EAAU,KAAK,MACnB,MAAMpuB,EAAW,CACb,CAAC,OAAO,QAAQ,GAAI,CAChB,OAAOA,CACX,EACA,MAAO,CACH,GAAInB,EAAI,SAAW8d,EACf,MAAM,IAAI,MAAM,0CAA0C,EAE9D,GAAIyR,EAAS,CACT,MAAM5xB,EAAS,CAAE,MAAO4xB,EAAQ,MAAO,KAAM,EAAK,EAClD,OAAAA,EAAUA,EAAQ,KACX5xB,CACX,KAEI,OAAO,CAAE,MAAO,OAAW,KAAM,EAAI,CAE7C,CACZ,EACQ,OAAOwD,CACX,CACA,SAAU,CACN,MAAMnB,EAAM,KACN8d,EAAQ,KAAK,OACnB,IAAIyR,EAAU,KAAK,MACnB,MAAMpuB,EAAW,CACb,CAAC,OAAO,QAAQ,GAAI,CAChB,OAAOA,CACX,EACA,MAAO,CACH,GAAInB,EAAI,SAAW8d,EACf,MAAM,IAAI,MAAM,0CAA0C,EAE9D,GAAIyR,EAAS,CACT,MAAM5xB,EAAS,CAAE,MAAO,CAAC4xB,EAAQ,IAAKA,EAAQ,KAAK,EAAG,KAAM,EAAK,EACjE,OAAAA,EAAUA,EAAQ,KACX5xB,CACX,KAEI,OAAO,CAAE,MAAO,OAAW,KAAM,EAAI,CAE7C,CACZ,EACQ,OAAOwD,CACX,CACA,EAAE+tB,GAAK,OAAO,YAAa,OAAO,SAAQ,GAAK,CAC3C,OAAO,KAAK,QAAO,CACvB,CACA,QAAQM,EAAS,CACb,GAAIA,GAAW,KAAK,KAChB,OAEJ,GAAIA,IAAY,EAAG,CACf,KAAK,MAAK,EACV,MACJ,CACA,IAAID,EAAU,KAAK,MACfE,EAAc,KAAK,KACvB,KAAOF,GAAWE,EAAcD,GAC5B,KAAK,KAAK,OAAOD,EAAQ,GAAG,EAC5BA,EAAUA,EAAQ,KAClBE,IAEJ,KAAK,MAAQF,EACb,KAAK,MAAQE,EACTF,IACAA,EAAQ,SAAW,QAEvB,KAAK,QACT,CACA,QAAQC,EAAS,CACb,GAAIA,GAAW,KAAK,KAChB,OAEJ,GAAIA,IAAY,EAAG,CACf,KAAK,MAAK,EACV,MACJ,CACA,IAAID,EAAU,KAAK,MACfE,EAAc,KAAK,KACvB,KAAOF,GAAWE,EAAcD,GAC5B,KAAK,KAAK,OAAOD,EAAQ,GAAG,EAC5BA,EAAUA,EAAQ,SAClBE,IAEJ,KAAK,MAAQF,EACb,KAAK,MAAQE,EACTF,IACAA,EAAQ,KAAO,QAEnB,KAAK,QACT,CACA,aAAajvB,EAAM,CAEf,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACrB,KAAK,MAAQA,UAEP,KAAK,MAIXA,EAAK,KAAO,KAAK,MACjB,KAAK,MAAM,SAAWA,MAJtB,OAAM,IAAI,MAAM,cAAc,EAMlC,KAAK,MAAQA,EACb,KAAK,QACT,CACA,YAAYA,EAAM,CAEd,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACrB,KAAK,MAAQA,UAEP,KAAK,MAIXA,EAAK,SAAW,KAAK,MACrB,KAAK,MAAM,KAAOA,MAJlB,OAAM,IAAI,MAAM,cAAc,EAMlC,KAAK,MAAQA,EACb,KAAK,QACT,CACA,WAAWA,EAAM,CACb,GAAIA,IAAS,KAAK,OAASA,IAAS,KAAK,MACrC,KAAK,MAAQ,OACb,KAAK,MAAQ,eAERA,IAAS,KAAK,MAAO,CAG1B,GAAI,CAACA,EAAK,KACN,MAAM,IAAI,MAAM,cAAc,EAElCA,EAAK,KAAK,SAAW,OACrB,KAAK,MAAQA,EAAK,IACtB,SACSA,IAAS,KAAK,MAAO,CAG1B,GAAI,CAACA,EAAK,SACN,MAAM,IAAI,MAAM,cAAc,EAElCA,EAAK,SAAS,KAAO,OACrB,KAAK,MAAQA,EAAK,QACtB,KACK,CACD,MAAMc,EAAOd,EAAK,KACZovB,EAAWpvB,EAAK,SACtB,GAAI,CAACc,GAAQ,CAACsuB,EACV,MAAM,IAAI,MAAM,cAAc,EAElCtuB,EAAK,SAAWsuB,EAChBA,EAAS,KAAOtuB,CACpB,CACAd,EAAK,KAAO,OACZA,EAAK,SAAW,OAChB,KAAK,QACT,CACA,MAAMA,EAAM8uB,EAAO,CACf,GAAI,CAAC,KAAK,OAAS,CAAC,KAAK,MACrB,MAAM,IAAI,MAAM,cAAc,EAElC,GAAK,EAAAA,IAAU,GAAuBA,IAAU,IAGhD,GAAIA,IAAU,EAAqB,CAC/B,GAAI9uB,IAAS,KAAK,MACd,OAEJ,MAAMc,EAAOd,EAAK,KACZovB,EAAWpvB,EAAK,SAElBA,IAAS,KAAK,OAGdovB,EAAS,KAAO,OAChB,KAAK,MAAQA,IAIbtuB,EAAK,SAAWsuB,EAChBA,EAAS,KAAOtuB,GAGpBd,EAAK,SAAW,OAChBA,EAAK,KAAO,KAAK,MACjB,KAAK,MAAM,SAAWA,EACtB,KAAK,MAAQA,EACb,KAAK,QACT,SACS8uB,IAAU,EAAqB,CACpC,GAAI9uB,IAAS,KAAK,MACd,OAEJ,MAAMc,EAAOd,EAAK,KACZovB,EAAWpvB,EAAK,SAElBA,IAAS,KAAK,OAGdc,EAAK,SAAW,OAChB,KAAK,MAAQA,IAIbA,EAAK,SAAWsuB,EAChBA,EAAS,KAAOtuB,GAEpBd,EAAK,KAAO,OACZA,EAAK,SAAW,KAAK,MACrB,KAAK,MAAM,KAAOA,EAClB,KAAK,MAAQA,EACb,KAAK,QACT,EACJ,CACA,QAAS,CACL,MAAM6J,EAAO,CAAA,EACb,YAAK,QAAQ,CAACrM,EAAOoO,IAAQ,CACzB/B,EAAK,KAAK,CAAC+B,EAAKpO,CAAK,CAAC,CAC1B,CAAC,EACMqM,CACX,CACA,SAASA,EAAM,CACX,KAAK,MAAK,EACV,SAAW,CAAC+B,EAAKpO,CAAK,IAAKqM,EACvB,KAAK,IAAI+B,EAAKpO,CAAK,CAE3B,CACJ,CACA,MAAM6xB,WAAcR,EAAU,CAC1B,YAAYS,EAAOC,EAAQ,EAAG,CAC1B,MAAK,EACL,KAAK,OAASD,EACd,KAAK,OAAS,KAAK,IAAI,KAAK,IAAI,EAAGC,CAAK,EAAG,CAAC,CAChD,CACA,IAAI,OAAQ,CACR,OAAO,KAAK,MAChB,CACA,IAAI,MAAMD,EAAO,CACb,KAAK,OAASA,EACd,KAAK,UAAS,CAClB,CACA,IAAI1jB,EAAKkjB,EAAQ,EAAqB,CAClC,OAAO,MAAM,IAAIljB,EAAKkjB,CAAK,CAC/B,CACA,KAAKljB,EAAK,CACN,OAAO,MAAM,IAAIA,EAAK,CAAC,CAC3B,CACA,IAAIA,EAAKpO,EAAO,CACZ,aAAM,IAAIoO,EAAKpO,EAAO,CAAC,EAChB,IACX,CACA,WAAY,CACJ,KAAK,KAAO,KAAK,QACjB,KAAK,KAAK,KAAK,MAAM,KAAK,OAAS,KAAK,MAAM,CAAC,CAEvD,CACJ,CACA,MAAMgyB,WAAiBH,EAAM,CACzB,YAAYC,EAAOC,EAAQ,EAAG,CAC1B,MAAMD,EAAOC,CAAK,CACtB,CACA,KAAKL,EAAS,CACV,KAAK,QAAQA,CAAO,CACxB,CACA,IAAItjB,EAAKpO,EAAO,CACZ,aAAM,IAAIoO,EAAKpO,CAAK,EACpB,KAAK,UAAS,EACP,IACX,CACJ,CA6CA,MAAMiyB,EAAO,CACT,aAAc,CACV,KAAK,IAAM,IAAI,GACnB,CACA,IAAI7jB,EAAKpO,EAAO,CACZ,IAAIkyB,EAAS,KAAK,IAAI,IAAI9jB,CAAG,EACxB8jB,IACDA,EAAS,IAAI,IACb,KAAK,IAAI,IAAI9jB,EAAK8jB,CAAM,GAE5BA,EAAO,IAAIlyB,CAAK,CACpB,CACA,OAAOoO,EAAKpO,EAAO,CACf,MAAMkyB,EAAS,KAAK,IAAI,IAAI9jB,CAAG,EAC1B8jB,IAGLA,EAAO,OAAOlyB,CAAK,EACfkyB,EAAO,OAAS,GAChB,KAAK,IAAI,OAAO9jB,CAAG,EAE3B,CACA,QAAQA,EAAKjM,EAAI,CACb,MAAM+vB,EAAS,KAAK,IAAI,IAAI9jB,CAAG,EAC1B8jB,GAGLA,EAAO,QAAQ/vB,CAAE,CACrB,CACJ,CCrhB4B,IAAI6vB,GAAS,EAAE,EClE3C,IAAI/B,IACH,SAAUA,EAAmB,CAC1BA,EAAkBA,EAAkB,KAAU,CAAC,EAAI,OACnDA,EAAkBA,EAAkB,OAAY,CAAC,EAAI,SACrDA,EAAkBA,EAAkB,MAAW,CAAC,EAAI,QACpDA,EAAkBA,EAAkB,KAAU,CAAC,EAAI,MACvD,GAAGA,KAAsBA,GAAoB,CAAA,EAAG,EAIhD,IAAIV,IACH,SAAUA,EAAiB,CACxBA,EAAgBA,EAAgB,KAAU,CAAC,EAAI,OAC/CA,EAAgBA,EAAgB,OAAY,CAAC,EAAI,SACjDA,EAAgBA,EAAgB,MAAW,CAAC,EAAI,OACpD,GAAGA,KAAoBA,GAAkB,CAAA,EAAG,EAI5C,IAAIqB,IACH,SAAUA,EAAe,CACtBA,EAAcA,EAAc,IAAS,CAAC,EAAI,MAC1CA,EAAcA,EAAc,IAAS,CAAC,EAAI,KAC9C,GAAGA,KAAkBA,GAAgB,CAAA,EAAG,EACxC,IAAInB,IACH,SAAUA,EAAyB,CAChCA,EAAwBA,EAAwB,KAAU,CAAC,EAAI,OAC/DA,EAAwBA,EAAwB,MAAW,CAAC,EAAI,QAChEA,EAAwBA,EAAwB,KAAU,CAAC,EAAI,OAC/DA,EAAwBA,EAAwB,KAAU,CAAC,EAAI,MACnE,GAAGA,KAA4BA,GAA0B,CAAA,EAAG,ECe5D,SAAS0C,GAAuBC,EAAc,CAC1C,GAAI,CAACA,GAAgBA,EAAa,SAAW,EACzC,MAAO,GAEX,QAAS5xB,EAAI,EAAGmN,EAAMykB,EAAa,OAAQ5xB,EAAImN,EAAKnN,IAAK,CACrD,MAAMqO,EAASujB,EAAa,WAAW5xB,CAAC,EACxC,GAAIqO,IAAW,GACX,MAAO,GAEX,GAAIA,IAAW,GAA6B,CAGxC,GADArO,IACIA,GAAKmN,EAEL,MAEJ,MAAM0kB,EAAaD,EAAa,WAAW5xB,CAAC,EAC5C,GAAI6xB,IAAe,KAAwBA,IAAe,KAAwBA,IAAe,GAC7F,MAAO,EAEf,CACJ,CACA,MAAO,EACX,CAoRA,SAASC,GAAkBC,EAAgBzR,EAAM0R,EAAYC,EAAiBC,EAAa,CACvF,GAAID,IAAoB,EAEpB,MAAO,GAEX,MAAME,EAAa7R,EAAK,WAAW2R,EAAkB,CAAC,EAKtD,GAJIF,EAAe,IAAII,CAAU,IAAM,GAInCA,IAAe,IAAoCA,IAAe,GAElE,MAAO,GAEX,GAAID,EAAc,EAAG,CACjB,MAAME,EAAmB9R,EAAK,WAAW2R,CAAe,EACxD,GAAIF,EAAe,IAAIK,CAAgB,IAAM,EAEzC,MAAO,EAEf,CACA,MAAO,EACX,CACA,SAASC,GAAmBN,EAAgBzR,EAAM0R,EAAYC,EAAiBC,EAAa,CACxF,GAAID,EAAkBC,IAAgBF,EAElC,MAAO,GAEX,MAAMM,EAAYhS,EAAK,WAAW2R,EAAkBC,CAAW,EAK/D,GAJIH,EAAe,IAAIO,CAAS,IAAM,GAIlCA,IAAc,IAAoCA,IAAc,GAEhE,MAAO,GAEX,GAAIJ,EAAc,EAAG,CACjB,MAAMK,EAAkBjS,EAAK,WAAW2R,EAAkBC,EAAc,CAAC,EACzE,GAAIH,EAAe,IAAIQ,CAAe,IAAM,EAExC,MAAO,EAEf,CACA,MAAO,EACX,CACA,SAASC,GAAaT,EAAgBzR,EAAM0R,EAAYC,EAAiBC,EAAa,CAClF,OAAQJ,GAAkBC,EAAgBzR,EAAM0R,EAAYC,EAAiBC,CAAW,GACjFG,GAAmBN,EAAgBzR,EAAM0R,EAAYC,EAAiBC,CAAW,CAC5F,CACA,MAAMO,EAAS,CACX,YAAYV,EAAgBW,EAAa,CACrC,KAAK,gBAAkBX,EACvB,KAAK,aAAeW,EACpB,KAAK,qBAAuB,GAC5B,KAAK,iBAAmB,CAC5B,CACA,MAAMC,EAAW,CACb,KAAK,aAAa,UAAYA,EAC9B,KAAK,qBAAuB,GAC5B,KAAK,iBAAmB,CAC5B,CACA,KAAKrS,EAAM,CACP,MAAM0R,EAAa1R,EAAK,OACxB,IAAIsS,EACJ,EAAG,CAMC,GALI,KAAK,qBAAuB,KAAK,mBAAqBZ,IAI1DY,EAAI,KAAK,aAAa,KAAKtS,CAAI,EAC3B,CAACsS,GACD,OAAO,KAEX,MAAMX,EAAkBW,EAAE,MACpBV,EAAcU,EAAE,CAAC,EAAE,OACzB,GAAIX,IAAoB,KAAK,sBAAwBC,IAAgB,KAAK,iBAAkB,CACxF,GAAIA,IAAgB,EAAG,CAGf9iB,GAAiBkR,EAAM0R,EAAY,KAAK,aAAa,SAAS,EAAI,MAClE,KAAK,aAAa,WAAa,EAG/B,KAAK,aAAa,WAAa,EAEnC,QACJ,CAEA,OAAO,IACX,CAGA,GAFA,KAAK,qBAAuBC,EAC5B,KAAK,iBAAmBC,EACpB,CAAC,KAAK,iBAAmBM,GAAa,KAAK,gBAAiBlS,EAAM0R,EAAYC,EAAiBC,CAAW,EAC1G,OAAOU,CAEf,OAASA,GACT,OAAO,IACX,CACJ,CC7bA,MAAMC,GAAwB,oCAQ9B,SAASC,GAAiBC,EAAe,GAAI,CACzC,IAAIrf,EAAS,yBACb,UAAWgS,KAAOmN,GACVE,EAAa,QAAQrN,CAAG,GAAK,IAGjChS,GAAU,KAAOgS,GAErB,OAAAhS,GAAU,SACH,IAAI,OAAOA,EAAQ,GAAG,CACjC,CAEA,MAAMsf,GAAsBF,GAAgB,EAC5C,SAASG,GAA0BC,EAAgB,CAC/C,IAAI7zB,EAAS2zB,GACb,GAAIE,GAAmBA,aAA0B,OAC7C,GAAKA,EAAe,OAchB7zB,EAAS6zB,MAde,CACxB,IAAIC,EAAQ,IACRD,EAAe,aACfC,GAAS,KAETD,EAAe,YACfC,GAAS,KAETD,EAAe,UACfC,GAAS,KAEb9zB,EAAS,IAAI,OAAO6zB,EAAe,OAAQC,CAAK,CACpD,CAKJ,OAAA9zB,EAAO,UAAY,EACZA,CACX,CACA,MAAM+zB,GAAiB,IAAIjvB,GAC3BivB,GAAe,QAAQ,CACnB,OAAQ,IACR,WAAY,GACZ,WAAY,GAChB,CAAC,EACD,SAASC,GAActY,EAAQmY,EAAgB5S,EAAMgT,EAAYC,EAAQ,CAMrE,GAJAL,EAAiBD,GAA0BC,CAAc,EACpDK,IACDA,EAAShzB,GAAS,MAAM6yB,EAAc,GAEtC9S,EAAK,OAASiT,EAAO,OAAQ,CAG7B,IAAI3W,EAAQ7B,EAASwY,EAAO,OAAS,EACrC,OAAI3W,EAAQ,EACRA,EAAQ,EAGR0W,GAAc1W,EAElB0D,EAAOA,EAAK,UAAU1D,EAAO7B,EAASwY,EAAO,OAAS,CAAC,EAChDF,GAActY,EAAQmY,EAAgB5S,EAAMgT,EAAYC,CAAM,CACzE,CACA,MAAMC,EAAK,KAAK,IAAG,EACb/X,EAAMV,EAAS,EAAIuY,EACzB,IAAIG,EAAiB,GACjB/nB,EAAQ,KACZ,QAAS1L,EAAI,EAEL,OAAK,IAAG,EAAKwzB,GAAMD,EAAO,YAFjBvzB,IAAK,CAOlB,MAAM0zB,EAAajY,EAAM8X,EAAO,WAAavzB,EAC7CkzB,EAAe,UAAY,KAAK,IAAI,EAAGQ,CAAU,EACjD,MAAMC,EAAYC,GAAiCV,EAAgB5S,EAAM7E,EAAKgY,CAAc,EAO5F,GANI,CAACE,GAAajoB,IAIlBA,EAAQioB,EAEJD,GAAc,GACd,MAEJD,EAAiBC,CACrB,CACA,GAAIhoB,EAAO,CACP,MAAMrM,EAAS,CACX,KAAMqM,EAAM,CAAC,EACb,YAAa4nB,EAAa,EAAI5nB,EAAM,MACpC,UAAW4nB,EAAa,EAAI5nB,EAAM,MAAQA,EAAM,CAAC,EAAE,MAC/D,EACQ,OAAAwnB,EAAe,UAAY,EACpB7zB,CACX,CACA,OAAO,IACX,CACA,SAASu0B,GAAiCV,EAAgB5S,EAAM7E,EAAKoY,EAAS,CAC1E,IAAInoB,EACJ,KAAOA,EAAQwnB,EAAe,KAAK5S,CAAI,GAAG,CACtC,MAAMwT,EAAapoB,EAAM,OAAS,EAClC,GAAIooB,GAAcrY,GAAOyX,EAAe,WAAazX,EACjD,OAAO/P,EAEN,GAAImoB,EAAU,GAAKC,EAAaD,EACjC,OAAO,IAEf,CACA,OAAO,IACX,CClHA,MAAME,EAA4B,CAC9B,OAAO,yBAAyB1U,EAAOnZ,EAAS8V,EAAO,CACnD,MAAMgY,EAAYhY,EAAQA,EAAM,gBAAkB,EAC5CiY,EAAUjY,EAAQA,EAAM,cAAgBqD,EAAM,aAAY,EAC1D6U,EAAuB,IAAIC,GAAqBjuB,CAAO,EACvDkuB,EAAaF,EAAqB,uBAAsB,EAC9D,IAAIG,EACAD,IAAe,mBACfC,EAAQ,IAAI,OAAO,0BAA2B,GAAG,EAGjDA,EAAQ,IAAI,OAAO,GAAGC,GAAyB,MAAM,KAAKF,CAAU,CAAC,CAAC,GAAI,GAAG,EAEjF,MAAMG,EAAW,IAAI9B,GAAS,KAAM4B,CAAK,EACnCG,EAAS,CAAA,EACf,IAAIC,EAAU,GACV,EACAC,EAA0B,EAC1BC,EAA0B,EAC1BC,EAA8B,EAClCC,EAAS,QAAS/Z,EAAakZ,EAAWrX,EAAYsX,EAASnZ,GAAc6B,EAAW7B,IAAc,CAClG,MAAMga,EAAczV,EAAM,eAAevE,CAAU,EAC7Cia,EAAaD,EAAY,OAE/BP,EAAS,MAAM,CAAC,EAChB,EAEI,IADA,EAAIA,EAAS,KAAKO,CAAW,EACzB,EAAG,CACH,IAAIvmB,EAAa,EAAE,MACfymB,EAAW,EAAE,MAAQ,EAAE,CAAC,EAAE,OAE9B,GAAIzmB,EAAa,EAAG,CAChB,MAAM0mB,EAAiBH,EAAY,WAAWvmB,EAAa,CAAC,EACxDO,GAAgBmmB,CAAc,GAC9B1mB,GAER,CACA,GAAIymB,EAAW,EAAID,EAAY,CAC3B,MAAME,EAAiBH,EAAY,WAAWE,EAAW,CAAC,EACtDlmB,GAAgBmmB,CAAc,GAC9BD,GAER,CACA,MAAM50B,EAAM00B,EAAY,UAAUvmB,EAAYymB,CAAQ,EACtD,IAAIE,EAAO7B,GAAc9kB,EAAa,EAAGykB,GAAqB8B,EAAa,CAAC,EACxEI,GAAQA,EAAK,WAAa3mB,EAAa,IAEvC2mB,EAAO,MAEX,MAAMC,EAAkBjB,EAAqB,6BAA6B9zB,EAAK80B,EAAOA,EAAK,KAAO,IAAI,EACtG,GAAIC,IAAoB,EAAoC,CAcxD,GAbIA,IAAoB,EACpBT,IAEKS,IAAoB,EACzBR,IAEKQ,IAAoB,EACzBP,IAGAr1B,GAAW,EAGXi1B,EAAO,QADe,IACc,CACpCC,EAAU,GACV,MAAMI,CACV,CACAL,EAAO,KAAK,IAAI7Y,EAAMb,EAAYvM,EAAa,EAAGuM,EAAYka,EAAW,CAAC,CAAC,CAC/E,CACJ,OACK,EACb,CACA,MAAO,CACH,OAAAR,EACA,QAAAC,EACA,wBAAAC,EACA,wBAAAC,EACA,4BAAAC,CACZ,CACI,CACA,OAAO,8BAA8BtM,EAAMpiB,EAAS,CAChD,MAAMguB,EAAuB,IAAIC,GAAqBjuB,CAAO,EAE7D,OADeguB,EAAqB,6BAA6B5L,EAAM,IAAI,EAC7D,CACV,IAAK,GACD,OAAO,KACX,IAAK,GACD,MAAO,CAAE,KAAM,CAAC,EACpB,IAAK,GAAyC,CAC1C,MAAM1Y,EAAY0Y,EAAK,YAAY,CAAC,EAC9B8M,EAAoBlB,EAAqB,oBAAoB,qBAAqBtkB,CAAS,EAC3FylB,EAAwB7kB,GAAoB,WAAU,EAAG,OAAQL,GAAM,CAACK,GAAoB,YAAY,IAAI,IAAI,CAAC,GAAGtK,EAAQ,eAAgBiK,CAAC,CAAC,CAAC,EAAE,YAAYP,CAAS,CAAC,EAC7K,MAAO,CAAE,KAAM,EAAgD,eAAgB,OAAO,cAAcwlB,CAAiB,EAAG,sBAAAC,CAAqB,CACjJ,CACA,IAAK,GACD,MAAO,CAAE,KAAM,CAAC,CAChC,CACI,CACJ,CACA,SAASf,GAAyBgB,EAAYnC,EAAO,CAEjD,MADY,IAAInlB,GAAuBsnB,EAAW,IAAKt1B,GAAM,OAAO,cAAcA,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAEnG,CACA,MAAMm0B,EAAqB,CACvB,YAAYjuB,EAAS,CACjB,KAAK,QAAUA,EACf,KAAK,kBAAoB,IAAI,IAAIA,EAAQ,iBAAiB,EAC1D,KAAK,oBAAsBsK,GAAoB,YAAY,IAAI,IAAItK,EAAQ,cAAc,CAAC,CAC9F,CACA,wBAAyB,CACrB,GAAI,KAAK,QAAQ,cACb,MAAO,mBAEX,MAAMqvB,EAAM,IAAI,IAChB,GAAI,KAAK,QAAQ,oBACb,UAAWC,KAAM9kB,GAAoB,WAC5B+kB,GAA4B,OAAO,cAAcD,CAAE,CAAC,GACrDD,EAAI,IAAIC,CAAE,EAItB,GAAI,KAAK,QAAQ,oBACb,UAAWA,KAAM,KAAK,oBAAoB,wBAAuB,EAC7DD,EAAI,IAAIC,CAAE,EAGlB,UAAWA,KAAM,KAAK,kBAClBD,EAAI,OAAOC,CAAE,EAEjB,OAAOD,CACX,CACA,6BAA6BG,EAAWC,EAAa,CACjD,MAAM/lB,EAAY8lB,EAAU,YAAY,CAAC,EACzC,GAAI,KAAK,kBAAkB,IAAI9lB,CAAS,EACpC,MAAO,GAEX,GAAI,KAAK,QAAQ,cACb,MAAO,GAEX,IAAIgmB,EAA0B,GAC1BC,EAAyC,GAC7C,GAAIF,EACA,UAAWrN,KAAQqN,EAAa,CAC5B,MAAM/lB,EAAY0Y,EAAK,YAAY,CAAC,EAC9BwN,EAAiBtmB,GAAa8Y,CAAI,EACxCsN,EAA0BA,GAA2BE,EACjD,CAACA,GACD,CAAC,KAAK,oBAAoB,YAAYlmB,CAAS,GAC/C,CAACc,GAAoB,qBAAqBd,CAAS,IACnDimB,EAAyC,GAEjD,CAEJ,MAC6D,CAACD,GACLC,EAC9C,EAEP,KAAK,QAAQ,qBAET,CAACJ,GAA4BC,CAAS,GAAKhlB,GAAoB,qBAAqBd,CAAS,EACtF,EAGX,KAAK,QAAQ,qBACT,KAAK,oBAAoB,YAAYA,CAAS,EACvC,EAGR,CACX,CACJ,CACA,SAAS6lB,GAA4BC,EAAW,CAC5C,OAAOA,IAAc,KAAOA,IAAc;AAAA,GAAQA,IAAc,GACpE,CCrLA,MAAMK,EAAU,CACZ,YAAYjgB,EAKZkgB,EAKAC,EAAY,CACR,KAAK,QAAUngB,EACf,KAAK,MAAQkgB,EACb,KAAK,WAAaC,CACtB,CACJ,CACA,MAAMC,EAAU,CACZ,YAAYC,EAAkBrgB,EAAS,CACnC,KAAK,iBAAmBqgB,EACxB,KAAK,QAAUrgB,CACnB,CACJ,CCXA,SAAS3O,GAAOivB,EAAKhb,EAAOib,EAAa,CAACp2B,EAAGC,IAAMD,IAAMC,EAAG,CACxD,GAAIk2B,IAAQhb,EACR,MAAO,GAKX,GAHI,CAACgb,GAAO,CAAChb,GAGTgb,EAAI,SAAWhb,EAAM,OACrB,MAAO,GAEX,QAASpb,EAAI,EAAGmN,EAAMipB,EAAI,OAAQp2B,EAAImN,EAAKnN,IACvC,GAAI,CAACq2B,EAAWD,EAAIp2B,CAAC,EAAGob,EAAMpb,CAAC,CAAC,EAC5B,MAAO,GAGf,MAAO,EACX,CA4GA,SAAUs2B,GAAgBx2B,EAAOy2B,EAAiB,CAC9C,IAAIC,EACAvvB,EACJ,UAAWjF,KAAQlC,EACXmH,IAAS,QAAasvB,EAAgBtvB,EAAMjF,CAAI,EAChDw0B,EAAa,KAAKx0B,CAAI,GAGlBw0B,IACA,MAAMA,GAEVA,EAAe,CAACx0B,CAAI,GAExBiF,EAAOjF,EAEPw0B,IACA,MAAMA,EAEd,CACA,SAASC,GAAgBj0B,EAAKk0B,EAAG,CAC7B,QAAS12B,EAAI,EAAGA,GAAKwC,EAAI,OAAQxC,IAC7B02B,EAAE12B,IAAM,EAAI,OAAYwC,EAAIxC,EAAI,CAAC,EAAGA,IAAMwC,EAAI,OAAS,OAAYA,EAAIxC,CAAC,CAAC,CAEjF,CACA,SAAS22B,GAAqBn0B,EAAKk0B,EAAG,CAClC,QAAS12B,EAAI,EAAGA,EAAIwC,EAAI,OAAQxC,IAC5B02B,EAAE12B,IAAM,EAAI,OAAYwC,EAAIxC,EAAI,CAAC,EAAGwC,EAAIxC,CAAC,EAAGA,EAAI,IAAMwC,EAAI,OAAS,OAAYA,EAAIxC,EAAI,CAAC,CAAC,CAEjG,CA+FA,SAAS42B,GAASp0B,EAAK1C,EAAO,CAC1B,UAAWkC,KAAQlC,EACf0C,EAAI,KAAKR,CAAI,CAErB,CA6DA,IAAI60B,IACH,SAAUA,EAAe,CACtB,SAASC,EAAWz3B,EAAQ,CACxB,OAAOA,EAAS,CACpB,CACAw3B,EAAc,WAAaC,EAC3B,SAASC,EAAkB13B,EAAQ,CAC/B,OAAOA,GAAU,CACrB,CACAw3B,EAAc,kBAAoBE,EAClC,SAASC,EAAc33B,EAAQ,CAC3B,OAAOA,EAAS,CACpB,CACAw3B,EAAc,cAAgBG,EAC9B,SAASC,EAA2B53B,EAAQ,CACxC,OAAOA,IAAW,CACtB,CACAw3B,EAAc,2BAA6BI,EAC3CJ,EAAc,YAAc,EAC5BA,EAAc,SAAW,GACzBA,EAAc,yBAA2B,CAC7C,GAAGA,KAAkBA,GAAgB,CAAA,EAAG,EACxC,SAASK,GAAUC,EAAUC,EAAY,CACrC,MAAO,CAACn3B,EAAGC,IAAMk3B,EAAWD,EAASl3B,CAAC,EAAGk3B,EAASj3B,CAAC,CAAC,CACxD,CAeA,MAAMm3B,GAAmB,CAACp3B,EAAGC,IAAMD,EAAIC,EAEvC,SAASo3B,GAAaF,EAAY,CAC9B,MAAO,CAACn3B,EAAGC,IAAM,CAACk3B,EAAWn3B,EAAGC,CAAC,CACrC,CA+EA,MAAMq3B,GAAN,MAAMA,EAAiB,CAEnB,YAKAC,EAAS,CACL,KAAK,QAAUA,CACnB,CACA,SAAU,CACN,MAAMn4B,EAAS,CAAA,EACf,YAAK,QAAQ2C,IAAU3C,EAAO,KAAK2C,CAAI,EAAU,GAAO,EACjD3C,CACX,CACA,OAAOU,EAAW,CACd,OAAO,IAAIw3B,GAAiBE,GAAM,KAAK,QAAQz1B,GAAQjC,EAAUiC,CAAI,EAAIy1B,EAAGz1B,CAAI,EAAI,EAAI,CAAC,CAC7F,CACA,IAAI01B,EAAO,CACP,OAAO,IAAIH,GAAiBE,GAAM,KAAK,QAAQz1B,GAAQy1B,EAAGC,EAAM11B,CAAI,CAAC,CAAC,CAAC,CAC3E,CACA,SAASjC,EAAW,CAChB,IAAIV,EACJ,YAAK,QAAQ2C,IACLjC,EAAUiC,CAAI,IACd3C,EAAS2C,GAEN,GACV,EACM3C,CACX,CACA,cAAc+3B,EAAY,CACtB,IAAI/3B,EACAgC,EAAQ,GACZ,YAAK,QAAQW,KACLX,GAASw1B,GAAc,cAAcO,EAAWp1B,EAAM3C,CAAM,CAAC,KAC7DgC,EAAQ,GACRhC,EAAS2C,GAEN,GACV,EACM3C,CACX,CACJ,EA1Cak4B,GAAK,MAAQ,IAAIA,GAAiBI,GAAa,CAAE,CAAC,EAD/D,IAAMC,GAANL,GCxbA,MAAMM,CAAY,CACd,OAAO,OAAOjb,EAAOkb,EAAc,CAC/B,OAAO,IAAID,EAAYjb,EAAOkb,CAAY,CAC9C,CACA,OAAO,SAAS9b,EAAO+b,EAAc,CACjC,IAAI/3B,EAAI,EACR,KAAOA,EAAI+3B,EAAa,QAAUA,EAAa/3B,CAAC,EAAE,aAAegc,EAAM,OACnEhc,IAEJ,IAAIia,EAAIja,EACR,KAAOia,EAAI8d,EAAa,QAAUA,EAAa9d,CAAC,EAAE,OAAS+B,EAAM,cAC7D/B,IAEJ,GAAIja,IAAMia,EACN8d,EAAa,OAAO/3B,EAAG,EAAGgc,CAAK,MAE9B,CACD,MAAMY,EAAQ,KAAK,IAAIZ,EAAM,MAAO+b,EAAa/3B,CAAC,EAAE,KAAK,EACnDqL,EAAM,KAAK,IAAI2Q,EAAM,aAAc+b,EAAa9d,EAAI,CAAC,EAAE,YAAY,EACzE8d,EAAa,OAAO/3B,EAAGia,EAAIja,EAAG,IAAI63B,EAAYjb,EAAOvR,CAAG,CAAC,CAC7D,CACJ,CACA,OAAO,UAAUuR,EAAOkb,EAAc,CAClC,GAAI,EAAAlb,EAAQkb,GAGZ,OAAO,IAAID,EAAYjb,EAAOkb,CAAY,CAC9C,CACA,OAAO,SAAS11B,EAAQ,CACpB,OAAO,IAAIy1B,EAAY,EAAGz1B,CAAM,CACpC,CACA,OAAO,iBAAiBwa,EAAOxa,EAAQ,CACnC,OAAO,IAAIy1B,EAAYjb,EAAOA,EAAQxa,CAAM,CAChD,CACA,OAAO,QAAQiN,EAAQ,CACnB,OAAO,IAAIwoB,EAAYxoB,EAAQA,CAAM,CACzC,CACA,YAAYuN,EAAOkb,EAAc,CAG7B,GAFA,KAAK,MAAQlb,EACb,KAAK,aAAekb,EAChBlb,EAAQkb,EACR,MAAM,IAAIx4B,GAAmB,kBAAkB,KAAK,SAAQ,CAAE,EAAE,CAExE,CACA,IAAI,SAAU,CACV,OAAO,KAAK,QAAU,KAAK,YAC/B,CACA,MAAM+P,EAAQ,CACV,OAAO,IAAIwoB,EAAY,KAAK,MAAQxoB,EAAQ,KAAK,aAAeA,CAAM,CAC1E,CACA,WAAWA,EAAQ,CACf,OAAO,IAAIwoB,EAAY,KAAK,MAAQxoB,EAAQ,KAAK,YAAY,CACjE,CACA,SAASA,EAAQ,CACb,OAAO,IAAIwoB,EAAY,KAAK,MAAO,KAAK,aAAexoB,CAAM,CACjE,CACA,IAAI,QAAS,CACT,OAAO,KAAK,aAAe,KAAK,KACpC,CACA,UAAW,CACP,MAAO,IAAI,KAAK,KAAK,KAAK,KAAK,YAAY,GAC/C,CACA,OAAO+L,EAAO,CACV,OAAO,KAAK,QAAUA,EAAM,OAAS,KAAK,eAAiBA,EAAM,YACrE,CACA,SAAS/L,EAAQ,CACb,OAAO,KAAK,OAASA,GAAUA,EAAS,KAAK,YACjD,CAKA,KAAK+L,EAAO,CACR,OAAO,IAAIyc,EAAY,KAAK,IAAI,KAAK,MAAOzc,EAAM,KAAK,EAAG,KAAK,IAAI,KAAK,aAAcA,EAAM,YAAY,CAAC,CAC7G,CAOA,UAAUA,EAAO,CACb,MAAMwB,EAAQ,KAAK,IAAI,KAAK,MAAOxB,EAAM,KAAK,EACxC/P,EAAM,KAAK,IAAI,KAAK,aAAc+P,EAAM,YAAY,EAC1D,GAAIwB,GAASvR,EACT,OAAO,IAAIwsB,EAAYjb,EAAOvR,CAAG,CAGzC,CACA,mBAAmB2Q,EAAO,CACtB,MAAMY,EAAQ,KAAK,IAAI,KAAK,MAAOZ,EAAM,KAAK,EACxC3Q,EAAM,KAAK,IAAI,KAAK,aAAc2Q,EAAM,YAAY,EAC1D,OAAO,KAAK,IAAI,EAAG3Q,EAAMuR,CAAK,CAClC,CACA,WAAWxB,EAAO,CACd,MAAMwB,EAAQ,KAAK,IAAI,KAAK,MAAOxB,EAAM,KAAK,EACxC/P,EAAM,KAAK,IAAI,KAAK,aAAc+P,EAAM,YAAY,EAC1D,OAAOwB,EAAQvR,CACnB,CACA,oBAAoB+P,EAAO,CACvB,MAAMwB,EAAQ,KAAK,IAAI,KAAK,MAAOxB,EAAM,KAAK,EACxC/P,EAAM,KAAK,IAAI,KAAK,aAAc+P,EAAM,YAAY,EAC1D,OAAOwB,GAASvR,CACpB,CACA,SAAS+P,EAAO,CACZ,OAAO,KAAK,cAAgBA,EAAM,KACtC,CACA,QAAQA,EAAO,CACX,OAAO,KAAK,OAASA,EAAM,YAC/B,CACA,MAAM5Y,EAAK,CACP,OAAOA,EAAI,MAAM,KAAK,MAAO,KAAK,YAAY,CAClD,CACA,UAAUpC,EAAK,CACX,OAAOA,EAAI,UAAU,KAAK,MAAO,KAAK,YAAY,CACtD,CAKA,KAAKZ,EAAO,CACR,GAAI,KAAK,QACL,MAAM,IAAIF,GAAmB,2BAA2B,KAAK,SAAQ,CAAE,EAAE,EAE7E,OAAO,KAAK,IAAI,KAAK,MAAO,KAAK,IAAI,KAAK,aAAe,EAAGE,CAAK,CAAC,CACtE,CAOA,WAAWA,EAAO,CACd,GAAI,KAAK,QACL,MAAM,IAAIF,GAAmB,2BAA2B,KAAK,SAAQ,CAAE,EAAE,EAE7E,OAAIE,EAAQ,KAAK,MACN,KAAK,cAAiB,KAAK,MAAQA,GAAS,KAAK,OAExDA,GAAS,KAAK,aACP,KAAK,OAAUA,EAAQ,KAAK,OAAS,KAAK,OAE9CA,CACX,CACA,QAAQk3B,EAAG,CACP,QAAS12B,EAAI,KAAK,MAAOA,EAAI,KAAK,aAAcA,IAC5C02B,EAAE12B,CAAC,CAEX,CAKA,kBAAkBgc,EAAO,CACrB,GAAI,KAAK,eAAiBA,EAAM,MAC5B,MAAM,IAAI1c,GAAmB,iBAAiB,KAAK,UAAU,QAAQ0c,EAAM,SAAQ,CAAE,EAAE,EAE3F,OAAO,IAAI6b,EAAY,KAAK,MAAO7b,EAAM,YAAY,CACzD,CACJ,CC9IA,SAASgc,GAAmB72B,EAAOpB,EAAW,CAC1C,MAAM8gB,EAAMoX,GAAsB92B,EAAOpB,CAAS,EAClD,OAAO8gB,IAAQ,GAAK,OAAY1f,EAAM0f,CAAG,CAC7C,CAOA,SAASoX,GAAsB92B,EAAOpB,EAAWm4B,EAAW,EAAGC,EAAWh3B,EAAM,OAAQ,CACpF,IAAI,EAAI+2B,EACJje,EAAIke,EACR,KAAO,EAAIle,GAAG,CACV,MAAM1J,EAAI,KAAK,OAAO,EAAI0J,GAAK,CAAC,EAC5Bla,EAAUoB,EAAMoP,CAAC,CAAC,EAClB,EAAIA,EAAI,EAGR0J,EAAI1J,CAEZ,CACA,OAAO,EAAI,CACf,CAOA,SAAS6nB,GAAoBj3B,EAAOpB,EAAW,CAC3C,MAAM8gB,EAAMwX,GAA+Bl3B,EAAOpB,CAAS,EAC3D,OAAO8gB,IAAQ1f,EAAM,OAAS,OAAYA,EAAM0f,CAAG,CACvD,CAOA,SAASwX,GAA+Bl3B,EAAOpB,EAAWm4B,EAAW,EAAGC,EAAWh3B,EAAM,OAAQ,CAC7F,IAAI,EAAI+2B,EACJje,EAAIke,EACR,KAAO,EAAIle,GAAG,CACV,MAAM1J,EAAI,KAAK,OAAO,EAAI0J,GAAK,CAAC,EAC5Bla,EAAUoB,EAAMoP,CAAC,CAAC,EAClB0J,EAAI1J,EAGJ,EAAIA,EAAI,CAEhB,CACA,OAAO,CACX,CAOA,MAAM+nB,GAAN,MAAMA,EAAgB,CAElB,YAAYC,EAAQ,CAChB,KAAK,OAASA,EACd,KAAK,2BAA6B,CACtC,CAKA,mBAAmBx4B,EAAW,CAC1B,GAAIu4B,GAAgB,iBAAkB,CAClC,GAAI,KAAK,wBACL,UAAWt2B,KAAQ,KAAK,OACpB,GAAI,KAAK,uBAAuBA,CAAI,GAAK,CAACjC,EAAUiC,CAAI,EACpD,MAAM,IAAI,MAAM,8FAA8F,EAI1H,KAAK,uBAAyBjC,CAClC,CACA,MAAM8gB,EAAMoX,GAAsB,KAAK,OAAQl4B,EAAW,KAAK,0BAA0B,EACzF,YAAK,2BAA6B8gB,EAAM,EACjCA,IAAQ,GAAK,OAAY,KAAK,OAAOA,CAAG,CACnD,CACJ,EAxBayX,GAAK,iBAAmB,GADrC,IAAME,GAANF,GCzEA,MAAMG,GAAN,MAAMA,EAAU,CACZ,OAAO,SAAS7c,EAAiBxZ,EAAQ,CACrC,OAAO,IAAIq2B,GAAU7c,EAAiBA,EAAkBxZ,CAAM,CAClE,CACA,OAAO,UAAU4Z,EAAO,CACpB,OAAO,IAAIyc,GAAUzc,EAAM,gBAAiBA,EAAM,aAAa,CACnE,CACA,OAAO,mBAAmBA,EAAO,CAC7B,OAAO,IAAIyc,GAAUzc,EAAM,gBAAiBA,EAAM,cAAgB,CAAC,CACvE,CAKA,OAAO,SAAS0c,EAAY,CACxB,GAAIA,EAAW,SAAW,EACtB,MAAO,CAAA,EAEX,IAAIr5B,EAAS,IAAIs5B,GAAaD,EAAW,CAAC,EAAE,OAAO,EACnD,QAAS14B,EAAI,EAAGA,EAAI04B,EAAW,OAAQ14B,IACnCX,EAASA,EAAO,SAAS,IAAIs5B,GAAaD,EAAW14B,CAAC,EAAE,MAAK,CAAE,CAAC,EAEpE,OAAOX,EAAO,MAClB,CACA,OAAO,KAAKq5B,EAAY,CACpB,GAAIA,EAAW,SAAW,EACtB,MAAM,IAAIp5B,GAAmB,4BAA4B,EAE7D,IAAIsc,EAAkB8c,EAAW,CAAC,EAAE,gBAChCE,EAAyBF,EAAW,CAAC,EAAE,uBAC3C,QAAS,EAAI,EAAG,EAAIA,EAAW,OAAQ,IACnC9c,EAAkB,KAAK,IAAIA,EAAiB8c,EAAW,CAAC,EAAE,eAAe,EACzEE,EAAyB,KAAK,IAAIA,EAAwBF,EAAW,CAAC,EAAE,sBAAsB,EAElG,OAAO,IAAID,GAAU7c,EAAiBgd,CAAsB,CAChE,CAIA,OAAO,YAAYC,EAAW,CAC1B,OAAO,IAAIJ,GAAUI,EAAU,CAAC,EAAGA,EAAU,CAAC,CAAC,CACnD,CACA,YAAYjd,EAAiBgd,EAAwB,CACjD,GAAIhd,EAAkBgd,EAClB,MAAM,IAAIt5B,GAAmB,mBAAmBsc,CAAe,2CAA2Cgd,CAAsB,EAAE,EAEtI,KAAK,gBAAkBhd,EACvB,KAAK,uBAAyBgd,CAClC,CAIA,SAAS9d,EAAY,CACjB,OAAO,KAAK,iBAAmBA,GAAcA,EAAa,KAAK,sBACnE,CAIA,IAAI,SAAU,CACV,OAAO,KAAK,kBAAoB,KAAK,sBACzC,CAIA,MAAMzL,EAAQ,CACV,OAAO,IAAIopB,GAAU,KAAK,gBAAkBppB,EAAQ,KAAK,uBAAyBA,CAAM,CAC5F,CACA,YAAYA,EAAQ,CAChB,OAAO,IAAIopB,GAAU,KAAK,gBAAiB,KAAK,uBAAyBppB,CAAM,CACnF,CAIA,IAAI,QAAS,CACT,OAAO,KAAK,uBAAyB,KAAK,eAC9C,CAIA,KAAK+L,EAAO,CACR,OAAO,IAAIqd,GAAU,KAAK,IAAI,KAAK,gBAAiBrd,EAAM,eAAe,EAAG,KAAK,IAAI,KAAK,uBAAwBA,EAAM,sBAAsB,CAAC,CACnJ,CACA,UAAW,CACP,MAAO,IAAI,KAAK,eAAe,IAAI,KAAK,sBAAsB,GAClE,CAKA,UAAUA,EAAO,CACb,MAAMQ,EAAkB,KAAK,IAAI,KAAK,gBAAiBR,EAAM,eAAe,EACtEwd,EAAyB,KAAK,IAAI,KAAK,uBAAwBxd,EAAM,sBAAsB,EACjG,GAAIQ,GAAmBgd,EACnB,OAAO,IAAIH,GAAU7c,EAAiBgd,CAAsB,CAGpE,CACA,iBAAiBxd,EAAO,CACpB,OAAO,KAAK,gBAAkBA,EAAM,wBAA0BA,EAAM,gBAAkB,KAAK,sBAC/F,CACA,oBAAoBA,EAAO,CACvB,OAAO,KAAK,iBAAmBA,EAAM,wBAA0BA,EAAM,iBAAmB,KAAK,sBACjG,CACA,OAAOlb,EAAG,CACN,OAAO,KAAK,kBAAoBA,EAAE,iBAAmB,KAAK,yBAA2BA,EAAE,sBAC3F,CACA,kBAAmB,CACf,OAAI,KAAK,QACE,KAEJ,IAAIyb,EAAM,KAAK,gBAAiB,EAAG,KAAK,uBAAyB,EAAG,OAAO,gBAAgB,CACtG,CAIA,kBAAmB,CACf,OAAO,IAAIA,EAAM,KAAK,gBAAiB,EAAG,KAAK,uBAAwB,CAAC,CAC5E,CACA,eAAe+a,EAAG,CACd,MAAMr3B,EAAS,CAAA,EACf,QAASyb,EAAa,KAAK,gBAAiBA,EAAa,KAAK,uBAAwBA,IAClFzb,EAAO,KAAKq3B,EAAE5b,CAAU,CAAC,EAE7B,OAAOzb,CACX,CACA,QAAQq3B,EAAG,CACP,QAAS5b,EAAa,KAAK,gBAAiBA,EAAa,KAAK,uBAAwBA,IAClF4b,EAAE5b,CAAU,CAEpB,CAIA,WAAY,CACR,MAAO,CAAC,KAAK,gBAAiB,KAAK,sBAAsB,CAC7D,CAKA,eAAgB,CACZ,OAAO,IAAI+c,EAAY,KAAK,gBAAkB,EAAG,KAAK,uBAAyB,CAAC,CACpF,CACA,UAAUiB,EAAWC,EAAc,CAC/B,OAAO,IAAIN,GAAU,KAAK,gBAAkBK,EAAW,KAAK,uBAAyBC,CAAY,CACrG,CACJ,EAxIaN,GAAK,eAAiBvB,GAAU/mB,GAAKA,EAAE,gBAAiBknB,EAAgB,EAVrF,IAAM2B,EAANP,GAmJA,MAAME,EAAa,CACf,YAKAM,EAAoB,CAAA,EAAI,CACpB,KAAK,kBAAoBA,CAC7B,CACA,IAAI,QAAS,CACT,OAAO,KAAK,iBAChB,CACA,SAASjd,EAAO,CACZ,GAAIA,EAAM,SAAW,EACjB,OAKJ,MAAMkd,EAAoBb,GAA+B,KAAK,kBAAmBnmB,GAAKA,EAAE,wBAA0B8J,EAAM,eAAe,EAEjImd,EAA2BlB,GAAsB,KAAK,kBAAmB/lB,GAAKA,EAAE,iBAAmB8J,EAAM,sBAAsB,EAAI,EACzI,GAAIkd,IAAsBC,EAEtB,KAAK,kBAAkB,OAAOD,EAAmB,EAAGld,CAAK,UAEpDkd,IAAsBC,EAA2B,EAAG,CAEzD,MAAMC,EAAY,KAAK,kBAAkBF,CAAiB,EAC1D,KAAK,kBAAkBA,CAAiB,EAAIE,EAAU,KAAKpd,CAAK,CACpE,KACK,CAED,MAAMod,EAAY,KAAK,kBAAkBF,CAAiB,EAAE,KAAK,KAAK,kBAAkBC,EAA2B,CAAC,CAAC,EAAE,KAAKnd,CAAK,EACjI,KAAK,kBAAkB,OAAOkd,EAAmBC,EAA2BD,EAAmBE,CAAS,CAC5G,CACJ,CACA,SAASte,EAAY,CACjB,MAAMue,EAA2BrB,GAAmB,KAAK,kBAAmB,GAAK,EAAE,iBAAmBld,CAAU,EAChH,MAAO,CAAC,CAACue,GAA4BA,EAAyB,uBAAyBve,CAC3F,CACA,WAAWkB,EAAO,CACd,MAAMqd,EAA2BrB,GAAmB,KAAK,kBAAmB,GAAK,EAAE,gBAAkBhc,EAAM,sBAAsB,EACjI,MAAO,CAAC,CAACqd,GAA4BA,EAAyB,uBAAyBrd,EAAM,eACjG,CACA,SAASZ,EAAO,CACZ,GAAI,KAAK,kBAAkB,SAAW,EAClC,OAAOA,EAEX,GAAIA,EAAM,kBAAkB,SAAW,EACnC,OAAO,KAEX,MAAM/b,EAAS,CAAA,EACf,IAAIi6B,EAAK,EACLC,EAAK,EACLtI,EAAU,KACd,KAAOqI,EAAK,KAAK,kBAAkB,QAAUC,EAAKne,EAAM,kBAAkB,QAAQ,CAC9E,IAAItY,EAAO,KACX,GAAIw2B,EAAK,KAAK,kBAAkB,QAAUC,EAAKne,EAAM,kBAAkB,OAAQ,CAC3E,MAAMoe,EAAa,KAAK,kBAAkBF,CAAE,EACtCG,EAAare,EAAM,kBAAkBme,CAAE,EACzCC,EAAW,gBAAkBC,EAAW,iBACxC32B,EAAO02B,EACPF,MAGAx2B,EAAO22B,EACPF,IAER,MACSD,EAAK,KAAK,kBAAkB,QACjCx2B,EAAO,KAAK,kBAAkBw2B,CAAE,EAChCA,MAGAx2B,EAAOsY,EAAM,kBAAkBme,CAAE,EACjCA,KAEAtI,IAAY,KACZA,EAAUnuB,EAGNmuB,EAAQ,wBAA0BnuB,EAAK,gBAEvCmuB,EAAU,IAAI+H,EAAU/H,EAAQ,gBAAiB,KAAK,IAAIA,EAAQ,uBAAwBnuB,EAAK,sBAAsB,CAAC,GAItHzD,EAAO,KAAK4xB,CAAO,EACnBA,EAAUnuB,EAGtB,CACA,OAAImuB,IAAY,MACZ5xB,EAAO,KAAK4xB,CAAO,EAEhB,IAAI0H,GAAat5B,CAAM,CAClC,CAIA,aAAa2c,EAAO,CAEhB,MAAMkd,EAAoBb,GAA+B,KAAK,kBAAmBnmB,GAAKA,EAAE,wBAA0B8J,EAAM,eAAe,EAEjImd,EAA2BlB,GAAsB,KAAK,kBAAmB/lB,GAAKA,EAAE,iBAAmB8J,EAAM,sBAAsB,EAAI,EACzI,GAAIkd,IAAsBC,EACtB,OAAO,IAAIR,GAAa,CAAC3c,CAAK,CAAC,EAEnC,MAAM3c,EAAS,CAAA,EACf,IAAIuc,EAAkBI,EAAM,gBAC5B,QAAShc,EAAIk5B,EAAmBl5B,EAAIm5B,EAA0Bn5B,IAAK,CAC/D,MAAMkS,EAAI,KAAK,kBAAkBlS,CAAC,EAC9BkS,EAAE,gBAAkB0J,GACpBvc,EAAO,KAAK,IAAI25B,EAAUpd,EAAiB1J,EAAE,eAAe,CAAC,EAEjE0J,EAAkB1J,EAAE,sBACxB,CACA,OAAI0J,EAAkBI,EAAM,wBACxB3c,EAAO,KAAK,IAAI25B,EAAUpd,EAAiBI,EAAM,sBAAsB,CAAC,EAErE,IAAI2c,GAAat5B,CAAM,CAClC,CACA,UAAW,CACP,OAAO,KAAK,kBAAkB,IAAI6S,GAAKA,EAAE,SAAQ,CAAE,EAAE,KAAK,IAAI,CAClE,CACA,gBAAgBkJ,EAAO,CACnB,MAAM/b,EAAS,CAAA,EACf,IAAIi6B,EAAK,EACLC,EAAK,EACT,KAAOD,EAAK,KAAK,kBAAkB,QAAUC,EAAKne,EAAM,kBAAkB,QAAQ,CAC9E,MAAMse,EAAK,KAAK,kBAAkBJ,CAAE,EAC9BK,EAAKve,EAAM,kBAAkBme,CAAE,EAC/Bv5B,EAAI05B,EAAG,UAAUC,CAAE,EACrB35B,GAAK,CAACA,EAAE,SACRX,EAAO,KAAKW,CAAC,EAEb05B,EAAG,uBAAyBC,EAAG,uBAC/BL,IAGAC,GAER,CACA,OAAO,IAAIZ,GAAat5B,CAAM,CAClC,CACA,aAAaG,EAAO,CAChB,OAAO,IAAIm5B,GAAa,KAAK,kBAAkB,IAAIzmB,GAAKA,EAAE,MAAM1S,CAAK,CAAC,CAAC,CAC3E,CACJ,CC1SA,MAAMo6B,GAAN,MAAMA,EAAW,CAEb,OAAO,iBAAiBC,EAAWC,EAAW,CAC1C,OAAID,EAAU,aAAeC,EAAU,WAC5B,IAAIF,GAAW,EAAGE,EAAU,OAASD,EAAU,MAAM,EAGrD,IAAID,GAAWE,EAAU,WAAaD,EAAU,WAAYC,EAAU,OAAS,CAAC,CAE/F,CACA,OAAO,aAAare,EAAK,CACrB,OAAO,IAAIme,GAAWne,EAAI,WAAa,EAAGA,EAAI,OAAS,CAAC,CAC5D,CACA,OAAO,QAAQO,EAAO,CAClB,OAAO4d,GAAW,iBAAiB5d,EAAM,iBAAgB,EAAIA,EAAM,gBAAgB,CACvF,CACA,OAAO,OAAOsE,EAAM,CAChB,IAAIvB,EAAO,EACPhE,EAAS,EACb,UAAWgf,KAAKzZ,EACRyZ,IAAM;AAAA,GACNhb,IACAhE,EAAS,GAGTA,IAGR,OAAO,IAAI6e,GAAW7a,EAAMhE,CAAM,CACtC,CACA,YAAY4B,EAAWqd,EAAa,CAChC,KAAK,UAAYrd,EACjB,KAAK,YAAcqd,CACvB,CACA,uBAAuB5e,EAAO,CAC1B,OAAI,KAAK,YAAcA,EAAM,UAClB,KAAK,UAAYA,EAAM,UAE3B,KAAK,aAAeA,EAAM,WACrC,CACA,IAAIA,EAAO,CACP,OAAIA,EAAM,YAAc,EACb,IAAIwe,GAAW,KAAK,UAAW,KAAK,YAAcxe,EAAM,WAAW,EAGnE,IAAIwe,GAAW,KAAK,UAAYxe,EAAM,UAAWA,EAAM,WAAW,CAEjF,CACA,YAAY6e,EAAe,CACvB,OAAI,KAAK,YAAc,EACZ,IAAIte,EAAMse,EAAc,WAAYA,EAAc,OAAQA,EAAc,WAAYA,EAAc,OAAS,KAAK,WAAW,EAG3H,IAAIte,EAAMse,EAAc,WAAYA,EAAc,OAAQA,EAAc,WAAa,KAAK,UAAW,KAAK,YAAc,CAAC,CAExI,CACA,SAAU,CACN,OAAO,IAAIte,EAAM,EAAG,EAAG,KAAK,UAAY,EAAG,KAAK,YAAc,CAAC,CACnE,CACA,aAAc,CACV,OAAOqd,EAAU,SAAS,EAAG,KAAK,UAAY,CAAC,CACnD,CACA,cAAc/c,EAAU,CACpB,OAAI,KAAK,YAAc,EACZ,IAAIpB,EAASoB,EAAS,WAAYA,EAAS,OAAS,KAAK,WAAW,EAGpE,IAAIpB,EAASoB,EAAS,WAAa,KAAK,UAAW,KAAK,YAAc,CAAC,CAEtF,CACA,UAAW,CACP,MAAO,GAAG,KAAK,SAAS,IAAI,KAAK,WAAW,EAChD,CACJ,EAxEa2d,GAAK,KAAO,IAAIA,GAAW,EAAG,CAAC,EAD5C,IAAMM,GAANN,GCFA,MAAMO,EAA8B,CAChC,eAAene,EAAO,CAClB,OAAO,IAAI6b,EAAY,KAAK,UAAU7b,EAAM,kBAAkB,EAAG,KAAK,UAAUA,EAAM,eAAc,CAAE,CAAC,CAC3G,CACA,SAASoe,EAAa,CAClB,OAAOze,EAAM,cAAc,KAAK,YAAYye,EAAY,KAAK,EAAG,KAAK,YAAYA,EAAY,YAAY,CAAC,CAC9G,CACA,qBAAqBC,EAAM,CACvB,OAAO,IAAIC,GAAK,KAAK,kBAAkB,KAAK,eAAeD,EAAK,KAAK,EAAGA,EAAK,IAAI,CACrF,CACA,mBAAmBA,EAAM,CACrB,OAAO,IAAIC,GAAK,KAAK,gBAAgB,KAAK,SAASD,EAAK,YAAY,EAAGA,EAAK,OAAO,CACvF,CACA,YAAYA,EAAM,CACd,MAAME,EAAQF,EAAK,aAAa,IAAI57B,GAAK,KAAK,mBAAmBA,CAAC,CAAC,EACnE,OAAO,IAAI67B,GAAK,KAAK,SAASC,CAAK,CACvC,CACJ,CACA,MAAMC,GAAN,MAAMA,EAAK,CAEP,WAAW,MAAO,CACd,GAAI,CAAC,KAAK,MACN,MAAM,IAAI,MAAM,oDAAoD,EAExE,OAAO,KAAK,KAChB,CACJ,EAPaA,GAAK,MAAQ,OAD1B,IAAMF,GAANE,GAaA,MAAMC,WAAkCN,EAA8B,CAClE,YAAY7Z,EAAM,CACd,MAAK,EACL,KAAK,KAAOA,EACZ,KAAK,yBAA2B,CAAA,EAChC,KAAK,uBAAyB,CAAA,EAC9B,KAAK,yBAAyB,KAAK,CAAC,EACpC,QAAStgB,EAAI,EAAGA,EAAIsgB,EAAK,OAAQtgB,IACzBsgB,EAAK,OAAOtgB,CAAC,IAAM;AAAA,IACnB,KAAK,yBAAyB,KAAKA,EAAI,CAAC,EACpCA,EAAI,GAAKsgB,EAAK,OAAOtgB,EAAI,CAAC,IAAM,KAChC,KAAK,uBAAuB,KAAKA,EAAI,CAAC,EAGtC,KAAK,uBAAuB,KAAKA,CAAC,GAI9C,KAAK,uBAAuB,KAAKsgB,EAAK,MAAM,CAChD,CACA,UAAUrE,EAAU,CAChB,MAAMye,EAAS,KAAK,kBAAkBze,CAAQ,EAC9C,OAAO,KAAK,yBAAyBye,EAAO,WAAa,CAAC,EAAIA,EAAO,OAAS,CAClF,CACA,kBAAkBze,EAAU,CACxB,GAAIA,EAAS,WAAa,EACtB,OAAO,IAAIpB,EAAS,EAAG,CAAC,EAE5B,MAAM8B,EAAY,KAAK,WAAW,UAAY,EAC9C,GAAIV,EAAS,WAAaU,EAAW,CACjC,MAAMoY,EAAa,KAAK,cAAcpY,CAAS,EAC/C,OAAO,IAAI9B,EAAS8B,EAAWoY,EAAa,CAAC,CACjD,CACA,GAAI9Y,EAAS,OAAS,EAClB,OAAO,IAAIpB,EAASoB,EAAS,WAAY,CAAC,EAE9C,MAAM8Y,EAAa,KAAK,cAAc9Y,EAAS,UAAU,EACzD,OAAIA,EAAS,OAAS,EAAI8Y,EACf,IAAIla,EAASoB,EAAS,WAAY8Y,EAAa,CAAC,EAEpD9Y,CACX,CACA,YAAY5M,EAAQ,CAChB,MAAMwR,EAAMoX,GAAsB,KAAK,yBAA0Bj4B,GAAKA,GAAKqP,CAAM,EAC3EyL,EAAa+F,EAAM,EACnB9F,EAAS1L,EAAS,KAAK,yBAAyBwR,CAAG,EAAI,EAC7D,OAAO,IAAIhG,EAASC,EAAYC,CAAM,CAC1C,CACA,IAAI,YAAa,CACb,MAAM4f,EAAU,KAAK,yBAAyB,OAAS,EACvD,OAAO,IAAIL,GAAK,KAAK,WAAWK,EAAS,KAAK,KAAK,OAAS,KAAK,yBAAyBA,CAAO,CAAC,CACtG,CACA,cAAc7f,EAAY,CACtB,OAAO,KAAK,uBAAuBA,EAAa,CAAC,EAAI,KAAK,yBAAyBA,EAAa,CAAC,CACrG,CACJ,CCrFA,MAAM8f,EAAa,CACf,aAAc,CACV,KAAK,aAAe,MACxB,CACA,IAAI,sBAAuB,CACvB,OAAO,KAAK,OAAO,cAAc,IAAI/f,EAAS,EAAG,CAAC,CAAC,CACvD,CACA,IAAI,WAAY,CACZ,OAAO,KAAK,OAAO,YAAW,CAClC,CACA,UAAW,CACP,OAAO,KAAK,gBAAgB,KAAK,OAAO,QAAO,CAAE,CACrD,CACA,sBAAsBmB,EAAO,CACzB,OAAO,KAAK,gBAAgB,KAAK,eAAc,EAAG,SAASA,CAAK,CAAC,CACrE,CACA,cAAclB,EAAY,CACtB,OAAO,KAAK,gBAAgB,IAAIa,EAAMb,EAAY,EAAGA,EAAY,OAAO,gBAAgB,CAAC,EAAE,MAC/F,CACA,gBAAiB,CACb,OAAK,KAAK,eACN,KAAK,aAAe,IAAI2f,GAA0B,KAAK,SAAQ,CAAE,GAE9D,KAAK,YAChB,CACA,UAAU3f,EAAY,CAClB,OAAO,KAAK,gBAAgB,IAAIa,EAAMb,EAAY,EAAGA,EAAY,OAAO,gBAAgB,CAAC,CAC7F,CACJ,CACA,MAAM+f,WAAsBD,EAAa,CACrC,YAAYE,EAAiBC,EAAY,CACrCt7B,GAAOs7B,GAAc,CAAC,EACtB,MAAK,EACL,KAAK,gBAAkBD,EACvB,KAAK,WAAaC,CACtB,CACA,gBAAgB/e,EAAO,CACnB,GAAIA,EAAM,kBAAoBA,EAAM,cAChC,OAAO,KAAK,gBAAgBA,EAAM,eAAe,EAAE,UAAUA,EAAM,YAAc,EAAGA,EAAM,UAAY,CAAC,EAE3G,IAAI3c,EAAS,KAAK,gBAAgB2c,EAAM,eAAe,EAAE,UAAUA,EAAM,YAAc,CAAC,EACxF,QAAShc,EAAIgc,EAAM,gBAAkB,EAAGhc,EAAIgc,EAAM,cAAehc,IAC7DX,GAAU;AAAA,EAAO,KAAK,gBAAgBW,CAAC,EAE3C,OAAAX,GAAU;AAAA,EAAO,KAAK,gBAAgB2c,EAAM,aAAa,EAAE,UAAU,EAAGA,EAAM,UAAY,CAAC,EACpF3c,CACX,CACA,cAAcyb,EAAY,CACtB,OAAO,KAAK,gBAAgBA,CAAU,EAAE,MAC5C,CACA,IAAI,QAAS,CACT,MAAMkgB,EAAW,KAAK,gBAAgB,KAAK,UAAU,EACrD,OAAO,IAAId,GAAW,KAAK,WAAa,EAAGc,EAAS,MAAM,CAC9D,CACJ,CACA,MAAMC,WAAkBJ,EAAc,CAClC,YAAYK,EAAO,CACf,MAAMpgB,GAAcogB,EAAMpgB,EAAa,CAAC,EAAGogB,EAAM,MAAM,CAC3D,CACJ,CCoHA,MAAMC,EAAgB,CAClB,OAAO,iBAAiBC,EAAcj5B,EAAc,CAChD,GAAIi5B,EAAa,SAAW,EACxB,MAAM,IAAI97B,GAEd,GAAI87B,EAAa,SAAW,EACxB,OAAOA,EAAa,CAAC,EAEzB,MAAMC,EAAWD,EAAa,CAAC,EAAE,MAAM,iBAAgB,EACjDE,EAASF,EAAaA,EAAa,OAAS,CAAC,EAAE,MAAM,eAAc,EACzE,IAAIG,EAAU,GACd,QAASv7B,EAAI,EAAGA,EAAIo7B,EAAa,OAAQp7B,IAAK,CAC1C,MAAMw7B,EAAUJ,EAAap7B,CAAC,EAE9B,GADAu7B,GAAWC,EAAQ,KACfx7B,EAAIo7B,EAAa,OAAS,EAAG,CAC7B,MAAMK,EAAWL,EAAap7B,EAAI,CAAC,EAC7B07B,EAAW/f,EAAM,cAAc6f,EAAQ,MAAM,eAAc,EAAIC,EAAS,MAAM,kBAAkB,EAChGE,EAAUx5B,EAAa,gBAAgBu5B,CAAQ,EACrDH,GAAWI,CACf,CACJ,CACA,OAAO,IAAIR,GAAgBxf,EAAM,cAAc0f,EAAUC,CAAM,EAAGC,CAAO,CAC7E,CACA,OAAO,sBAAsBK,EAAaC,EAAc,CACpD,OAAO,IAAIV,GAAgBU,EAAa,eAAc,EAAG,SAASD,EAAY,YAAY,EAAGA,EAAY,OAAO,CACpH,CACA,OAAO,OAAO5f,EAAO,CACjB,OAAO,IAAImf,GAAgBnf,EAAO,EAAE,CACxC,CACA,YAAYA,EAAOsE,EAAM,CACrB,KAAK,MAAQtE,EACb,KAAK,KAAOsE,CAChB,CACA,IAAI,SAAU,CACV,OAAO,KAAK,MAAM,QAAO,GAAM,KAAK,KAAK,SAAW,CACxD,CACA,OAAO,OAAOjf,EAAOy6B,EAAQ,CACzB,OAAOz6B,EAAM,MAAM,YAAYy6B,EAAO,KAAK,GAAKz6B,EAAM,OAASy6B,EAAO,IAC1E,CACA,OAAO1gB,EAAO,CACV,OAAO+f,GAAgB,OAAO,KAAM/f,CAAK,CAC7C,CACA,4BAA4BkF,EAAM,CAG9B,OAFe,KAAK,mBAAmBA,CAAI,EACrB,mBAAmBA,CAAI,CAEjD,CACA,mBAAmBA,EAAM,CACrB,MAAMyb,EAAyBzb,EAAK,gBAAgB,KAAK,KAAK,EAAE,WAAW;AAAA,EAAQ;AAAA,CAAI,EACjF0b,EAAyB,KAAK,KAAK,WAAW;AAAA,EAAQ;AAAA,CAAI,EAC1DC,EAAkBvtB,GAAmBqtB,EAAwBC,CAAsB,EACnFpf,EAAQsd,GAAW,OAAO6B,EAAuB,UAAU,EAAGE,CAAe,CAAC,EAC/E,cAAc,KAAK,MAAM,kBAAkB,EAC1CV,EAAUS,EAAuB,UAAUC,CAAe,EAC1DjgB,EAAQL,EAAM,cAAciB,EAAO,KAAK,MAAM,gBAAgB,EACpE,OAAO,IAAIue,GAAgBnf,EAAOuf,CAAO,CAC7C,CACA,mBAAmBjb,EAAM,CACrB,MAAMyb,EAAyBzb,EAAK,gBAAgB,KAAK,KAAK,EAAE,WAAW;AAAA,EAAQ;AAAA,CAAI,EACjF0b,EAAyB,KAAK,KAAK,WAAW;AAAA,EAAQ;AAAA,CAAI,EAC1DE,EAAkBvtB,GAAmBotB,EAAwBC,CAAsB,EACnF3wB,EAAM6uB,GAAW,OAAO6B,EAAuB,UAAU,EAAGA,EAAuB,OAASG,CAAe,CAAC,EAC7G,cAAc,KAAK,MAAM,kBAAkB,EAC1CX,EAAUS,EAAuB,UAAU,EAAGA,EAAuB,OAASE,CAAe,EAC7FlgB,EAAQL,EAAM,cAAc,KAAK,MAAM,iBAAgB,EAAItQ,CAAG,EACpE,OAAO,IAAI8vB,GAAgBnf,EAAOuf,CAAO,CAC7C,CACA,UAAW,CACP,MAAM3e,EAAQ,KAAK,MAAM,iBAAgB,EACnCvR,EAAM,KAAK,MAAM,eAAc,EACrC,MAAO,IAAIuR,EAAM,UAAU,IAAIA,EAAM,MAAM,OAAOvR,EAAI,UAAU,IAAIA,EAAI,MAAM,OAAO,KAAK,IAAI,GAClG,CACJ,CClPA,MAAM8wB,EAAiB,CACnB,OAAO,QAAQla,EAASma,EAAmBC,EAAmB,CAC1D,MAAMh9B,EAAS,CAAA,EACf,IAAIi9B,EAA4B,EAC5BC,EAA4B,EAChC,UAAW3J,KAAK3Q,EAAS,CACrB,MAAM/P,EAAI,IAAIiqB,GAAiB,IAAInD,EAAUsD,EAA2B1J,EAAE,SAAS,eAAe,EAAG,IAAIoG,EAAUuD,EAA2B3J,EAAE,SAAS,eAAe,CAAC,EACpK1gB,EAAE,SAAS,SACZ7S,EAAO,KAAK6S,CAAC,EAEjBoqB,EAA4B1J,EAAE,SAAS,uBACvC2J,EAA4B3J,EAAE,SAAS,sBAC3C,CACA,MAAM1gB,EAAI,IAAIiqB,GAAiB,IAAInD,EAAUsD,EAA2BF,EAAoB,CAAC,EAAG,IAAIpD,EAAUuD,EAA2BF,EAAoB,CAAC,CAAC,EAC/J,OAAKnqB,EAAE,SAAS,SACZ7S,EAAO,KAAK6S,CAAC,EAEV7S,CACX,CACA,OAAO,KAAK4iB,EAASua,EAAeC,EAAe,CAC/C,MAAMp9B,EAAS,CAAA,EACf,UAAWuzB,KAAK3Q,EAAS,CACrB,MAAMpO,EAAW+e,EAAE,SAAS,UAAU4J,CAAa,EAC7C1oB,EAAW8e,EAAE,SAAS,UAAU6J,CAAa,EAC/C5oB,GAAY,CAACA,EAAS,SAAWC,GAAY,CAACA,EAAS,SACvDzU,EAAO,KAAK,IAAI88B,GAAiBtoB,EAAUC,CAAQ,CAAC,CAE5D,CACA,OAAOzU,CACX,CACA,YAAYm9B,EAAeC,EAAe,CACtC,KAAK,SAAWD,EAChB,KAAK,SAAWC,CACpB,CACA,UAAW,CACP,MAAO,IAAI,KAAK,SAAS,SAAQ,CAAE,KAAK,KAAK,SAAS,SAAQ,CAAE,GACpE,CACA,MAAO,CACH,OAAO,IAAIN,GAAiB,KAAK,SAAU,KAAK,QAAQ,CAC5D,CACA,KAAK/gB,EAAO,CACR,OAAO,IAAI+gB,GAAiB,KAAK,SAAS,KAAK/gB,EAAM,QAAQ,EAAG,KAAK,SAAS,KAAKA,EAAM,QAAQ,CAAC,CACtG,CAMA,gBAAiB,CACb,MAAMshB,EAAqB,KAAK,SAAS,iBAAgB,EACnDC,EAAoB,KAAK,SAAS,iBAAgB,EACxD,GAAID,GAAsBC,EACtB,OAAO,IAAIC,GAAaF,EAAoBC,CAAiB,EAE5D,GAAI,KAAK,SAAS,kBAAoB,GAAK,KAAK,SAAS,kBAAoB,EAAG,CACjF,GAAI,EAAE,KAAK,SAAS,kBAAoB,GAAK,KAAK,SAAS,kBAAoB,GAE3E,MAAM,IAAIr9B,GAAmB,kBAAkB,EAInD,OAAO,IAAIs9B,GAAa,IAAIjhB,EAAM,KAAK,SAAS,gBAAiB,EAAG,KAAK,SAAS,uBAAwB,CAAC,EAAG,IAAIA,EAAM,KAAK,SAAS,gBAAiB,EAAG,KAAK,SAAS,uBAAwB,CAAC,CAAC,CACtM,KAGI,QAAO,IAAIihB,GAAa,IAAIjhB,EAAM,KAAK,SAAS,gBAAkB,EAAG,OAAO,iBAAkB,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAG,IAAIA,EAAM,KAAK,SAAS,gBAAkB,EAAG,OAAO,iBAAkB,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,CAAC,CAElT,CAMA,gBAAgB9H,EAAUC,EAAU,CAChC,GAAI+oB,GAAkB,KAAK,SAAS,uBAAwBhpB,CAAQ,GAC7DgpB,GAAkB,KAAK,SAAS,uBAAwB/oB,CAAQ,EACnE,OAAO,IAAI8oB,GAAa,IAAIjhB,EAAM,KAAK,SAAS,gBAAiB,EAAG,KAAK,SAAS,uBAAwB,CAAC,EAAG,IAAIA,EAAM,KAAK,SAAS,gBAAiB,EAAG,KAAK,SAAS,uBAAwB,CAAC,CAAC,EAEtM,GAAI,CAAC,KAAK,SAAS,SAAW,CAAC,KAAK,SAAS,QACzC,OAAO,IAAIihB,GAAajhB,EAAM,cAAc,IAAId,EAAS,KAAK,SAAS,gBAAiB,CAAC,EAAGiiB,GAAkB,IAAIjiB,EAAS,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAGhH,CAAQ,CAAC,EAAG8H,EAAM,cAAc,IAAId,EAAS,KAAK,SAAS,gBAAiB,CAAC,EAAGiiB,GAAkB,IAAIjiB,EAAS,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAG/G,CAAQ,CAAC,CAAC,EAEhY,GAAI,KAAK,SAAS,gBAAkB,GAAK,KAAK,SAAS,gBAAkB,EACrE,OAAO,IAAI8oB,GAAajhB,EAAM,cAAcmhB,GAAkB,IAAIjiB,EAAS,KAAK,SAAS,gBAAkB,EAAG,OAAO,gBAAgB,EAAGhH,CAAQ,EAAGipB,GAAkB,IAAIjiB,EAAS,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAGhH,CAAQ,CAAC,EAAG8H,EAAM,cAAcmhB,GAAkB,IAAIjiB,EAAS,KAAK,SAAS,gBAAkB,EAAG,OAAO,gBAAgB,EAAG/G,CAAQ,EAAGgpB,GAAkB,IAAIjiB,EAAS,KAAK,SAAS,uBAAyB,EAAG,OAAO,gBAAgB,EAAG/G,CAAQ,CAAC,CAAC,EAI9e,MAAM,IAAIxU,EACd,CACJ,CACA,SAASw9B,GAAkB7gB,EAAU8gB,EAAS,CAC1C,GAAI9gB,EAAS,WAAa,EACtB,OAAO,IAAIpB,EAAS,EAAG,CAAC,EAE5B,GAAIoB,EAAS,WAAa8gB,EAAQ,OAC9B,OAAO,IAAIliB,EAASkiB,EAAQ,OAAQA,EAAQA,EAAQ,OAAS,CAAC,EAAE,OAAS,CAAC,EAE9E,MAAMhe,EAAOge,EAAQ9gB,EAAS,WAAa,CAAC,EAC5C,OAAIA,EAAS,OAAS8C,EAAK,OAAS,EACzB,IAAIlE,EAASoB,EAAS,WAAY8C,EAAK,OAAS,CAAC,EAErD9C,CACX,CACA,SAAS4gB,GAAkB/hB,EAAYogB,EAAO,CAC1C,OAAOpgB,GAAc,GAAKA,GAAcogB,EAAM,MAClD,CAKA,MAAM8B,WAAiCb,EAAiB,CACpD,OAAO,kBAAkBc,EAAe,CACpC,MAAMT,EAAgBxD,EAAU,KAAKiE,EAAc,IAAI/qB,GAAK8mB,EAAU,mBAAmB9mB,EAAE,aAAa,CAAC,CAAC,EACpGuqB,EAAgBzD,EAAU,KAAKiE,EAAc,IAAI/qB,GAAK8mB,EAAU,mBAAmB9mB,EAAE,aAAa,CAAC,CAAC,EAC1G,OAAO,IAAI8qB,GAAyBR,EAAeC,EAAeQ,CAAa,CACnF,CACA,YAAYT,EAAeC,EAAeS,EAAc,CACpD,MAAMV,EAAeC,CAAa,EAClC,KAAK,aAAeS,CACxB,CACA,MAAO,CACH,OAAO,IAAIF,GAAyB,KAAK,SAAU,KAAK,SAAU,KAAK,cAAc,IAAIjD,GAAKA,EAAE,KAAI,CAAE,CAAC,CAC3G,CACA,gCAAiC,CAC7B,OAAO,IAAIiD,GAAyB,KAAK,SAAU,KAAK,SAAU,CAAC,KAAK,eAAc,CAAE,CAAC,CAC7F,CACJ,CAIA,MAAMJ,EAAa,CACf,OAAO,SAASvC,EAAM,CAClB,MAAM8C,EAAY9C,EAAK,aAAY,EAEnC,OADeA,EAAK,aAAa,IAAI,CAAC57B,EAAGoiB,IAAQ,IAAI+b,GAAan+B,EAAE,MAAO0+B,EAAUtc,CAAG,CAAC,CAAC,CAE9F,CACA,OAAO,aAAaoc,EAAe,CAC/B,QAASj9B,EAAI,EAAGA,EAAIi9B,EAAc,OAAQj9B,IAAK,CAC3C,MAAMoxB,EAAW6L,EAAcj9B,EAAI,CAAC,EAC9BixB,EAAUgM,EAAcj9B,CAAC,EAC/B,GAAI,EAAEoxB,EAAS,cAAc,eAAc,EAAG,gBAAgBH,EAAQ,cAAc,iBAAgB,CAAE,GAC/FG,EAAS,cAAc,iBAAiB,gBAAgBH,EAAQ,cAAc,iBAAgB,CAAE,GACnG,MAAM,IAAI3xB,GAAmB,+BAA+B,CAEpE,CACJ,CACA,YAAYk9B,EAAeC,EAAe,CACtC,KAAK,cAAgBD,EACrB,KAAK,cAAgBC,CACzB,CACA,UAAW,CACP,MAAO,IAAI,KAAK,cAAc,SAAQ,CAAE,KAAK,KAAK,cAAc,SAAQ,CAAE,GAC9E,CACA,MAAO,CACH,OAAO,IAAIG,GAAa,KAAK,cAAe,KAAK,aAAa,CAClE,CAIA,WAAW9oB,EAAU,CACjB,MAAMynB,EAAUznB,EAAS,gBAAgB,KAAK,aAAa,EAC3D,OAAO,IAAIqnB,GAAgB,KAAK,cAAeI,CAAO,CAC1D,CACJ,CACA,SAAS6B,GAAkCC,EAAYC,EAAeC,EAAeC,EAAsB,GAAO,CAC9G,MAAM1nB,EAAU,CAAA,EAChB,UAAW2nB,KAAKnH,GAAgB+G,EAAW,IAAI,GAAKK,GAAoB,EAAGJ,EAAeC,CAAa,CAAC,EAAG,CAACI,EAAIC,IAAOD,EAAG,SAAS,oBAAoBC,EAAG,QAAQ,GAC3JD,EAAG,SAAS,oBAAoBC,EAAG,QAAQ,CAAC,EAAG,CAClD,MAAMv8B,EAAQo8B,EAAE,CAAC,EACXx2B,EAAOw2B,EAAEA,EAAE,OAAS,CAAC,EAC3B3nB,EAAQ,KAAK,IAAIknB,GAAyB37B,EAAM,SAAS,KAAK4F,EAAK,QAAQ,EAAG5F,EAAM,SAAS,KAAK4F,EAAK,QAAQ,EAAGw2B,EAAE,IAAIx9B,GAAKA,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CACpJ,CACA,OAAAL,GAAS,IACD,CAAC49B,GAAuB1nB,EAAQ,OAAS,IACrCA,EAAQ,CAAC,EAAE,SAAS,kBAAoBA,EAAQ,CAAC,EAAE,SAAS,iBAG5DynB,EAAc,OAAO,UAAYznB,EAAQA,EAAQ,OAAS,CAAC,EAAE,SAAS,yBAA2BwnB,EAAc,OAAO,UAAYxnB,EAAQA,EAAQ,OAAS,CAAC,EAAE,SAAS,wBAChK,GAGRjW,GAAmBiW,EAAS,CAAC+nB,EAAIC,IAAOA,EAAG,SAAS,gBAAkBD,EAAG,SAAS,yBAA2BC,EAAG,SAAS,gBAAkBD,EAAG,SAAS,wBAE1JA,EAAG,SAAS,uBAAyBC,EAAG,SAAS,iBACjDD,EAAG,SAAS,uBAAyBC,EAAG,SAAS,eAAe,CACvE,EACMhoB,CACX,CACA,SAAS4nB,GAAoBK,EAAcT,EAAeC,EAAe,CACrE,IAAIS,EAAiB,EACjBC,EAAe,EAIfF,EAAa,cAAc,YAAc,GAAKA,EAAa,cAAc,YAAc,GACpFA,EAAa,cAAc,gBAAkBC,GAAkBD,EAAa,cAAc,eAC1FA,EAAa,cAAc,gBAAkBC,GAAkBD,EAAa,cAAc,gBAE7FE,EAAe,IAIfF,EAAa,cAAc,YAAc,GAAKR,EAAc,cAAcQ,EAAa,cAAc,eAAe,GACjHA,EAAa,cAAc,YAAc,GAAKT,EAAc,cAAcS,EAAa,cAAc,eAAe,GACpHA,EAAa,cAAc,iBAAmBA,EAAa,cAAc,cAAgBE,GACzFF,EAAa,cAAc,iBAAmBA,EAAa,cAAc,cAAgBE,IAE5FD,EAAiB,GAErB,MAAME,EAAoB,IAAIlF,EAAU+E,EAAa,cAAc,gBAAkBC,EAAgBD,EAAa,cAAc,cAAgB,EAAIE,CAAY,EAC1JE,EAAoB,IAAInF,EAAU+E,EAAa,cAAc,gBAAkBC,EAAgBD,EAAa,cAAc,cAAgB,EAAIE,CAAY,EAChK,OAAO,IAAIjB,GAAyBkB,EAAmBC,EAAmB,CAACJ,CAAY,CAAC,CAC5F,CCtNA,MAAMK,GAAoC,EAC1C,MAAMC,EAAwB,CAC1B,YAAYf,EAAeC,EAAer3B,EAAS,CAQ/C,MAAM7G,EAPe,IAAIi/B,GAAahB,EAAeC,EAAe,CAChE,mBAAoBr3B,EAAQ,qBAC5B,2BAA4BA,EAAQ,qBACpC,yBAA0B,GAC1B,qBAAsB,GACtB,6BAA8B,EAC1C,CAAS,EAC2B,YAAW,EACjC4P,EAAU,CAAA,EAChB,IAAIyoB,EAAa,KACjB,UAAWxE,KAAK16B,EAAO,QAAS,CAC5B,IAAIm9B,EACAzC,EAAE,wBAA0B,EAE5ByC,EAAgB,IAAIxD,EAAUe,EAAE,wBAA0B,EAAGA,EAAE,wBAA0B,CAAC,EAG1FyC,EAAgB,IAAIxD,EAAUe,EAAE,wBAAyBA,EAAE,sBAAwB,CAAC,EAExF,IAAI0C,EACA1C,EAAE,wBAA0B,EAE5B0C,EAAgB,IAAIzD,EAAUe,EAAE,wBAA0B,EAAGA,EAAE,wBAA0B,CAAC,EAG1F0C,EAAgB,IAAIzD,EAAUe,EAAE,wBAAyBA,EAAE,sBAAwB,CAAC,EAExF,IAAI3hB,EAAS,IAAI4kB,GAAyBR,EAAeC,EAAe1C,EAAE,aAAa,IAAIA,GAAK,IAAI6C,GAAa,IAAIjhB,EAAMoe,EAAE,wBAAyBA,EAAE,oBAAqBA,EAAE,sBAAuBA,EAAE,iBAAiB,EAAG,IAAIpe,EAAMoe,EAAE,wBAAyBA,EAAE,oBAAqBA,EAAE,sBAAuBA,EAAE,iBAAiB,CAAC,CAAC,CAAC,EACnUwE,IACIA,EAAW,SAAS,yBAA2BnmB,EAAO,SAAS,iBAC5DmmB,EAAW,SAAS,yBAA2BnmB,EAAO,SAAS,mBAElEA,EAAS,IAAI4kB,GAAyBuB,EAAW,SAAS,KAAKnmB,EAAO,QAAQ,EAAGmmB,EAAW,SAAS,KAAKnmB,EAAO,QAAQ,EAAGmmB,EAAW,cAAgBnmB,EAAO,aAC1JmmB,EAAW,aAAa,OAAOnmB,EAAO,YAAY,EAAI,MAAS,EACnEtC,EAAQ,IAAG,GAGnBA,EAAQ,KAAKsC,CAAM,EACnBmmB,EAAanmB,CACjB,CACA,OAAAxY,GAAS,IACEC,GAAmBiW,EAAS,CAAC+nB,EAAIC,IAAOA,EAAG,SAAS,gBAAkBD,EAAG,SAAS,yBAA2BC,EAAG,SAAS,gBAAkBD,EAAG,SAAS,wBAE1JA,EAAG,SAAS,uBAAyBC,EAAG,SAAS,iBACjDD,EAAG,SAAS,uBAAyBC,EAAG,SAAS,eAAe,CACvE,EACM,IAAI/H,GAAUjgB,EAAS,CAAA,EAAIzW,EAAO,SAAS,CACtD,CACJ,CACA,SAASm/B,GAAY9pB,EAAkBC,EAAkBC,EAA6Bb,EAAQ,CAE1F,OADiB,IAAIC,GAAQU,EAAkBC,EAAkBC,CAA2B,EAC5E,YAAYb,CAAM,CACtC,CACA,IAAA0qB,GAAA,KAAmB,CACf,YAAYvD,EAAO,CACf,MAAMwD,EAAe,CAAA,EACfC,EAAa,CAAA,EACnB,QAAS,EAAI,EAAGv8B,EAAS84B,EAAM,OAAQ,EAAI94B,EAAQ,IAC/Cs8B,EAAa,CAAC,EAAIE,GAAuB1D,EAAM,CAAC,EAAG,CAAC,EACpDyD,EAAW,CAAC,EAAIE,GAAsB3D,EAAM,CAAC,EAAG,CAAC,EAErD,KAAK,MAAQA,EACb,KAAK,cAAgBwD,EACrB,KAAK,YAAcC,CACvB,CACA,aAAc,CACV,MAAMvpB,EAAW,CAAA,EACjB,QAASpV,EAAI,EAAGmN,EAAM,KAAK,MAAM,OAAQnN,EAAImN,EAAKnN,IAC9CoV,EAASpV,CAAC,EAAI,KAAK,MAAMA,CAAC,EAAE,UAAU,KAAK,cAAcA,CAAC,EAAI,EAAG,KAAK,YAAYA,CAAC,EAAI,CAAC,EAE5F,OAAOoV,CACX,CACA,iBAAiBxT,EAAO,CACpB,OAAO,KAAK,MAAMA,CAAK,CAC3B,CACA,mBAAmB5B,EAAG,CAClB,OAAOA,EAAI,CACf,CACA,iBAAiBA,EAAG,CAChB,OAAOA,EAAI,CACf,CACA,mBAAmB8+B,EAA4BvwB,EAAYymB,EAAU,CACjE,MAAM+J,EAAY,CAAA,EACZC,EAAc,CAAA,EACdC,EAAU,CAAA,EAChB,IAAI9xB,EAAM,EACV,QAASvL,EAAQ2M,EAAY3M,GAASozB,EAAUpzB,IAAS,CACrD,MAAMkzB,EAAc,KAAK,MAAMlzB,CAAK,EAC9Bia,EAAeijB,EAA6B,KAAK,cAAcl9B,CAAK,EAAI,EACxEma,EAAa+iB,EAA6B,KAAK,YAAYl9B,CAAK,EAAIkzB,EAAY,OAAS,EAC/F,QAAS9W,EAAMnC,EAAamC,EAAMjC,EAAWiC,IACzC+gB,EAAU5xB,CAAG,EAAI2nB,EAAY,WAAW9W,EAAM,CAAC,EAC/CghB,EAAY7xB,CAAG,EAAIvL,EAAQ,EAC3Bq9B,EAAQ9xB,CAAG,EAAI6Q,EACf7Q,IAEA,CAAC2xB,GAA8Bl9B,EAAQozB,IAEvC+J,EAAU5xB,CAAG,EAAI,GACjB6xB,EAAY7xB,CAAG,EAAIvL,EAAQ,EAC3Bq9B,EAAQ9xB,CAAG,EAAI2nB,EAAY,OAAS,EACpC3nB,IAER,CACA,OAAO,IAAI+xB,GAAaH,EAAWC,EAAaC,CAAO,CAC3D,CACJ,EACA,MAAMC,EAAa,CACf,YAAYH,EAAWC,EAAaC,EAAS,CACzC,KAAK,WAAaF,EAClB,KAAK,aAAeC,EACpB,KAAK,SAAWC,CACpB,CACA,UAAW,CACP,MAAQ,IAAM,KAAK,WAAW,IAAI,CAAC1rB,EAAGsN,KAAStN,IAAM,GAA6B,MAAQ,OAAO,aAAaA,CAAC,GAAK,KAAK,KAAK,aAAasN,CAAG,CAAC,IAAI,KAAK,SAASA,CAAG,CAAC,GAAG,EAAE,KAAK,IAAI,EAAI,GAC3L,CACA,aAAajf,EAAOY,EAAK,CACrB,GAAIZ,EAAQ,GAAKA,GAASY,EAAI,OAC1B,MAAM,IAAI,MAAM,eAAe,CAEvC,CACA,aAAc,CACV,OAAO,KAAK,UAChB,CACA,mBAAmBxC,EAAG,CAClB,OAAIA,EAAI,GAAKA,IAAM,KAAK,aAAa,OAG1B,KAAK,iBAAiBA,EAAI,CAAC,GAEtC,KAAK,aAAaA,EAAG,KAAK,YAAY,EAC/B,KAAK,aAAaA,CAAC,EAC9B,CACA,iBAAiBA,EAAG,CAChB,OAAIA,IAAM,GAGC,KAAK,mBAAmBA,EAAI,CAAC,GAExC,KAAK,aAAaA,EAAG,KAAK,YAAY,EAClC,KAAK,WAAWA,CAAC,IAAM,GAChB,KAAK,aAAaA,CAAC,EAAI,EAE3B,KAAK,aAAaA,CAAC,EAC9B,CACA,eAAeA,EAAG,CACd,OAAIA,EAAI,GAAKA,IAAM,KAAK,SAAS,OAGtB,KAAK,aAAaA,EAAI,CAAC,GAElC,KAAK,aAAaA,EAAG,KAAK,QAAQ,EAC3B,KAAK,SAASA,CAAC,EAC1B,CACA,aAAaA,EAAG,CACZ,OAAIA,IAAM,GAGC,KAAK,eAAeA,EAAI,CAAC,GAEpC,KAAK,aAAaA,EAAG,KAAK,QAAQ,EAC9B,KAAK,WAAWA,CAAC,IAAM,GAChB,EAEJ,KAAK,SAASA,CAAC,EAAI,EAC9B,CACJ,CACA,MAAMm/B,EAAW,CACb,YAAYC,EAAyBC,EAAqBC,EAAuBC,EAAmBC,EAAyBC,EAAqBC,EAAuBC,EAAmB,CACxL,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,CAC7B,CACA,OAAO,qBAAqBC,EAAYC,EAAsBC,EAAsB,CAChF,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,EAC9GJ,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,EACpH,OAAO,IAAIT,GAAWC,EAAyBC,EAAqBC,EAAuBC,EAAmBC,EAAyBC,EAAqBC,EAAuBC,CAAiB,CACxM,CACJ,CACA,SAASI,GAAuBC,EAAY,CACxC,GAAIA,EAAW,QAAU,EACrB,OAAOA,EAEX,MAAM3gC,EAAS,CAAC2gC,EAAW,CAAC,CAAC,EAC7B,IAAIrnB,EAAatZ,EAAO,CAAC,EACzB,QAASW,EAAI,EAAGmN,EAAM6yB,EAAW,OAAQhgC,EAAImN,EAAKnN,IAAK,CACnD,MAAMigC,EAAaD,EAAWhgC,CAAC,EACzBkgC,EAAyBD,EAAW,eAAiBtnB,EAAW,cAAgBA,EAAW,gBAC3FwnB,EAAyBF,EAAW,eAAiBtnB,EAAW,cAAgBA,EAAW,gBAE1E,KAAK,IAAIunB,EAAwBC,CAAsB,EACzD/B,IAEjBzlB,EAAW,eAAkBsnB,EAAW,cAAgBA,EAAW,eAAkBtnB,EAAW,cAChGA,EAAW,eAAkBsnB,EAAW,cAAgBA,EAAW,eAAkBtnB,EAAW,gBAIhGtZ,EAAO,KAAK4gC,CAAU,EACtBtnB,EAAasnB,EAErB,CACA,OAAO5gC,CACX,CACA,MAAM+gC,EAAW,CACb,YAAYhB,EAAyBE,EAAuBE,EAAyBE,EAAuBW,EAAa,CACrH,KAAK,wBAA0BjB,EAC/B,KAAK,sBAAwBE,EAC7B,KAAK,wBAA0BE,EAC/B,KAAK,sBAAwBE,EAC7B,KAAK,YAAcW,CACvB,CACA,OAAO,qBAAqBvB,EAA4Bc,EAAYU,EAAsBC,EAAsBC,EAAkBC,EAA0BC,EAA8B,CACtL,IAAItB,EACAE,EACAE,EACAE,EACAW,EAiBJ,GAhBIT,EAAW,iBAAmB,GAC9BR,EAA0BkB,EAAqB,mBAAmBV,EAAW,aAAa,EAAI,EAC9FN,EAAwB,IAGxBF,EAA0BkB,EAAqB,mBAAmBV,EAAW,aAAa,EAC1FN,EAAwBgB,EAAqB,iBAAiBV,EAAW,cAAgBA,EAAW,eAAiB,CAAC,GAEtHA,EAAW,iBAAmB,GAC9BJ,EAA0Be,EAAqB,mBAAmBX,EAAW,aAAa,EAAI,EAC9FF,EAAwB,IAGxBF,EAA0Be,EAAqB,mBAAmBX,EAAW,aAAa,EAC1FF,EAAwBa,EAAqB,iBAAiBX,EAAW,cAAgBA,EAAW,eAAiB,CAAC,GAEtHa,GAA4Bb,EAAW,eAAiB,GAAKA,EAAW,eAAiB,IAAMA,EAAW,eAAiB,GAAKA,EAAW,eAAiB,IAAMY,IAAoB,CAEtL,MAAMX,EAAuBS,EAAqB,mBAAmBxB,EAA4Bc,EAAW,cAAeA,EAAW,cAAgBA,EAAW,eAAiB,CAAC,EAC7KE,EAAuBS,EAAqB,mBAAmBzB,EAA4Bc,EAAW,cAAeA,EAAW,cAAgBA,EAAW,eAAiB,CAAC,EACnL,GAAIC,EAAqB,YAAW,EAAG,OAAS,GAAKC,EAAqB,YAAW,EAAG,OAAS,EAAG,CAChG,IAAIE,EAAaxB,GAAYqB,EAAsBC,EAAsBU,EAAkB,EAAI,EAAE,QAC7FE,IACAV,EAAaD,GAAuBC,CAAU,GAElDK,EAAc,CAAA,EACd,QAASrgC,EAAI,EAAGoC,EAAS49B,EAAW,OAAQhgC,EAAIoC,EAAQpC,IACpDqgC,EAAY,KAAKlB,GAAW,qBAAqBa,EAAWhgC,CAAC,EAAG6/B,EAAsBC,CAAoB,CAAC,CAEnH,CACJ,CACA,OAAO,IAAIM,GAAWhB,EAAyBE,EAAuBE,EAAyBE,EAAuBW,CAAW,CACrI,CACJ,CACA,MAAM/B,EAAa,CACf,YAAYhB,EAAeC,EAAeoD,EAAM,CAC5C,KAAK,yBAA2BA,EAAK,yBACrC,KAAK,6BAA+BA,EAAK,6BACzC,KAAK,2BAA6BA,EAAK,2BACvC,KAAK,qBAAuBA,EAAK,qBACjC,KAAK,cAAgBrD,EACrB,KAAK,cAAgBC,EACrB,KAAK,SAAW,IAAIqD,GAAatD,CAAa,EAC9C,KAAK,SAAW,IAAIsD,GAAarD,CAAa,EAC9C,KAAK,iBAAmBsD,GAAkCF,EAAK,kBAAkB,EACjF,KAAK,iBAAmBE,GAAkCF,EAAK,qBAAuB,EAAI,EAAI,KAAK,IAAIA,EAAK,mBAAoB,GAAI,CAAC,CACzI,CACA,aAAc,CACV,GAAI,KAAK,SAAS,MAAM,SAAW,GAAK,KAAK,SAAS,MAAM,CAAC,EAAE,SAAW,EAEtE,OAAI,KAAK,SAAS,MAAM,SAAW,GAAK,KAAK,SAAS,MAAM,CAAC,EAAE,SAAW,EAC/D,CACH,UAAW,GACX,QAAS,CAAA,CAC7B,EAEmB,CACH,UAAW,GACX,QAAS,CAAC,CACF,wBAAyB,EACzB,sBAAuB,EACvB,wBAAyB,EACzB,sBAAuB,KAAK,SAAS,MAAM,OAC3C,YAAa,MACrC,CAAqB,CACrB,EAEQ,GAAI,KAAK,SAAS,MAAM,SAAW,GAAK,KAAK,SAAS,MAAM,CAAC,EAAE,SAAW,EAEtE,MAAO,CACH,UAAW,GACX,QAAS,CAAC,CACF,wBAAyB,EACzB,sBAAuB,KAAK,SAAS,MAAM,OAC3C,wBAAyB,EACzB,sBAAuB,EACvB,YAAa,MACrC,CAAqB,CACrB,EAEQ,MAAMG,EAAatC,GAAY,KAAK,SAAU,KAAK,SAAU,KAAK,iBAAkB,KAAK,oBAAoB,EACvGwB,EAAac,EAAW,QACxBC,EAAYD,EAAW,UAG7B,GAAI,KAAK,2BAA4B,CACjC,MAAME,EAAc,CAAA,EACpB,QAAShhC,EAAI,EAAGoC,EAAS49B,EAAW,OAAQhgC,EAAIoC,EAAQpC,IACpDghC,EAAY,KAAKZ,GAAW,qBAAqB,KAAK,2BAA4BJ,EAAWhgC,CAAC,EAAG,KAAK,SAAU,KAAK,SAAU,KAAK,iBAAkB,KAAK,yBAA0B,KAAK,4BAA4B,CAAC,EAE3N,MAAO,CACH,UAAW+gC,EACX,QAASC,CACzB,CACQ,CAGA,MAAM3hC,EAAS,CAAA,EACf,IAAI4hC,EAAoB,EACpBC,EAAoB,EACxB,QAASlhC,EAAI,GAAemN,EAAM6yB,EAAW,OAAQhgC,EAAImN,EAAKnN,IAAK,CAC/D,MAAMmhC,EAAcnhC,EAAI,EAAImN,EAAM6yB,EAAWhgC,EAAI,CAAC,EAAI,KAChDqY,EAAgB8oB,EAAaA,EAAW,cAAgB,KAAK,cAAc,OAC3E7oB,EAAgB6oB,EAAaA,EAAW,cAAgB,KAAK,cAAc,OACjF,KAAOF,EAAoB5oB,GAAgB6oB,EAAoB5oB,GAAc,CACzE,MAAM8oB,EAAe,KAAK,cAAcH,CAAiB,EACnDI,EAAe,KAAK,cAAcH,CAAiB,EACzD,GAAIE,IAAiBC,EAAc,CAG/B,CACI,IAAIhC,EAAsBT,GAAuBwC,EAAc,CAAC,EAC5D3B,EAAsBb,GAAuByC,EAAc,CAAC,EAChE,KAAOhC,EAAsB,GAAKI,EAAsB,GAAG,CACvD,MAAM6B,EAAeF,EAAa,WAAW/B,EAAsB,CAAC,EAC9DkC,EAAeF,EAAa,WAAW5B,EAAsB,CAAC,EACpE,GAAI6B,IAAiBC,EACjB,MAEJlC,IACAI,GACJ,EACIJ,EAAsB,GAAKI,EAAsB,IACjD,KAAK,8BAA8BpgC,EAAQ4hC,EAAoB,EAAG,EAAG5B,EAAqB6B,EAAoB,EAAG,EAAGzB,CAAmB,CAE/I,CAEA,CACI,IAAIF,EAAoBV,GAAsBuC,EAAc,CAAC,EACzDzB,EAAoBd,GAAsBwC,EAAc,CAAC,EAC7D,MAAMG,EAAoBJ,EAAa,OAAS,EAC1CK,EAAoBJ,EAAa,OAAS,EAChD,KAAO9B,EAAoBiC,GAAqB7B,EAAoB8B,GAAmB,CACnF,MAAMH,EAAeF,EAAa,WAAW7B,EAAoB,CAAC,EAC5DgC,EAAeH,EAAa,WAAWzB,EAAoB,CAAC,EAClE,GAAI2B,IAAiBC,EACjB,MAEJhC,IACAI,GACJ,EACIJ,EAAoBiC,GAAqB7B,EAAoB8B,IAC7D,KAAK,8BAA8BpiC,EAAQ4hC,EAAoB,EAAG1B,EAAmBiC,EAAmBN,EAAoB,EAAGvB,EAAmB8B,CAAiB,CAE3K,CACJ,CACAR,IACAC,GACJ,CACIC,IAEA9hC,EAAO,KAAK+gC,GAAW,qBAAqB,KAAK,2BAA4Be,EAAY,KAAK,SAAU,KAAK,SAAU,KAAK,iBAAkB,KAAK,yBAA0B,KAAK,4BAA4B,CAAC,EAC/MF,GAAqBE,EAAW,eAChCD,GAAqBC,EAAW,eAExC,CACA,MAAO,CACH,UAAWJ,EACX,QAAS1hC,CACrB,CACI,CACA,8BAA8BA,EAAQqiC,EAAoBrC,EAAqBE,EAAmBoC,EAAoBlC,EAAqBE,EAAmB,CAC1J,GAAI,KAAK,+BAA+BtgC,EAAQqiC,EAAoBrC,EAAqBE,EAAmBoC,EAAoBlC,EAAqBE,CAAiB,EAElK,OAEJ,IAAIU,EACA,KAAK,2BACLA,EAAc,CAAC,IAAIlB,GAAWuC,EAAoBrC,EAAqBqC,EAAoBnC,EAAmBoC,EAAoBlC,EAAqBkC,EAAoBhC,CAAiB,CAAC,GAEjMtgC,EAAO,KAAK,IAAI+gC,GAAWsB,EAAoBA,EAAoBC,EAAoBA,EAAoBtB,CAAW,CAAC,CAC3H,CACA,+BAA+BhhC,EAAQqiC,EAAoBrC,EAAqBE,EAAmBoC,EAAoBlC,EAAqBE,EAAmB,CAC3J,MAAMxyB,EAAM9N,EAAO,OACnB,GAAI8N,IAAQ,EACR,MAAO,GAEX,MAAMwL,EAAatZ,EAAO8N,EAAM,CAAC,EACjC,OAAIwL,EAAW,wBAA0B,GAAKA,EAAW,wBAA0B,EAExE,GAEPA,EAAW,wBAA0B+oB,GAAsB/oB,EAAW,wBAA0BgpB,GAC5F,KAAK,0BAA4BhpB,EAAW,aAC5CA,EAAW,YAAY,KAAK,IAAIwmB,GAAWuC,EAAoBrC,EAAqBqC,EAAoBnC,EAAmBoC,EAAoBlC,EAAqBkC,EAAoBhC,CAAiB,CAAC,EAEvM,IAEPhnB,EAAW,sBAAwB,IAAM+oB,GAAsB/oB,EAAW,sBAAwB,IAAMgpB,GACxGhpB,EAAW,sBAAwB+oB,EACnC/oB,EAAW,sBAAwBgpB,EAC/B,KAAK,0BAA4BhpB,EAAW,aAC5CA,EAAW,YAAY,KAAK,IAAIwmB,GAAWuC,EAAoBrC,EAAqBqC,EAAoBnC,EAAmBoC,EAAoBlC,EAAqBkC,EAAoBhC,CAAiB,CAAC,EAEvM,IAEJ,EACX,CACJ,CACA,SAASf,GAAuBgD,EAAKnkB,EAAc,CAC/C,MAAMvL,EAAI9D,GAAwBwzB,CAAG,EACrC,OAAI1vB,IAAM,GACCuL,EAEJvL,EAAI,CACf,CACA,SAAS2sB,GAAsB+C,EAAKnkB,EAAc,CAC9C,MAAMvL,EAAI5D,GAAuBszB,CAAG,EACpC,OAAI1vB,IAAM,GACCuL,EAEJvL,EAAI,CACf,CACA,SAAS2uB,GAAkCgB,EAAgB,CACvD,GAAIA,IAAmB,EACnB,MAAO,IAAM,GAEjB,MAAMC,EAAY,KAAK,IAAG,EAC1B,MAAO,IACI,KAAK,MAAQA,EAAYD,CAExC,CCzcA,MAAME,EAAoB,CACtB,OAAO,QAAQC,EAAMC,EAAM,CACvB,OAAO,IAAIF,GAAoB,CAAC,IAAIG,EAAarK,EAAY,SAASmK,EAAK,MAAM,EAAGnK,EAAY,SAASoK,EAAK,MAAM,CAAC,CAAC,EAAG,EAAK,CAClI,CACA,OAAO,gBAAgBD,EAAMC,EAAM,CAC/B,OAAO,IAAIF,GAAoB,CAAC,IAAIG,EAAarK,EAAY,SAASmK,EAAK,MAAM,EAAGnK,EAAY,SAASoK,EAAK,MAAM,CAAC,CAAC,EAAG,EAAI,CACjI,CACA,YAAYE,EAKZlM,EAAY,CACR,KAAK,MAAQkM,EACb,KAAK,WAAalM,CACtB,CACJ,CACA,MAAMiM,CAAa,CACf,OAAO,OAAOE,EAAeC,EAAY,CACrC,MAAMhjC,EAAS,CAAA,EACf,OAAAo3B,GAAgB2L,EAAe,CAACniC,EAAGC,IAAM,CACrCb,EAAO,KAAK6iC,EAAa,gBAAgBjiC,EAAIA,EAAE,iBAAgB,EAAKqiC,GAAW,KAAMpiC,EAAIA,EAAE,UAAS,EAAK,IAAIoiC,GAAWD,GAAapiC,EAAIA,EAAE,UAAU,aAAeA,EAAE,UAAU,aAAe,GAAKoiC,CAAU,CAAC,CAAC,CACpN,CAAC,EACMhjC,CACX,CACA,OAAO,gBAAgBud,EAAOkb,EAAc,CACxC,OAAO,IAAIoK,EAAa,IAAIrK,EAAYjb,EAAM,QAASkb,EAAa,OAAO,EAAG,IAAID,EAAYjb,EAAM,QAASkb,EAAa,OAAO,CAAC,CACtI,CACA,OAAO,aAAasK,EAAe,CAC/B,IAAIn7B,EACJ,UAAWH,KAAOs7B,EAAe,CAC7B,GAAIn7B,GACI,EAAEA,EAAK,UAAU,cAAgBH,EAAI,UAAU,OAASG,EAAK,UAAU,cAAgBH,EAAI,UAAU,OACrG,MAAM,IAAIxH,GAAmB,+BAA+B,EAGpE2H,EAAOH,CACX,CACJ,CACA,YAAYy7B,EAAWC,EAAW,CAC9B,KAAK,UAAYD,EACjB,KAAK,UAAYC,CACrB,CACA,MAAO,CACH,OAAO,IAAIN,EAAa,KAAK,UAAW,KAAK,SAAS,CAC1D,CACA,UAAW,CACP,MAAO,GAAG,KAAK,SAAS,QAAQ,KAAK,SAAS,EAClD,CACA,KAAK9mB,EAAO,CACR,OAAO,IAAI8mB,EAAa,KAAK,UAAU,KAAK9mB,EAAM,SAAS,EAAG,KAAK,UAAU,KAAKA,EAAM,SAAS,CAAC,CACtG,CACA,MAAM/L,EAAQ,CACV,OAAIA,IAAW,EACJ,KAEJ,IAAI6yB,EAAa,KAAK,UAAU,MAAM7yB,CAAM,EAAG,KAAK,UAAU,MAAMA,CAAM,CAAC,CACtF,CACA,WAAWA,EAAQ,CACf,OAAIA,IAAW,EACJ,KAEJ,IAAI6yB,EAAa,KAAK,UAAU,WAAW7yB,CAAM,EAAG,KAAK,UAAU,WAAWA,CAAM,CAAC,CAChG,CACA,SAASA,EAAQ,CACb,OAAIA,IAAW,EACJ,KAEJ,IAAI6yB,EAAa,KAAK,UAAU,SAAS7yB,CAAM,EAAG,KAAK,UAAU,SAASA,CAAM,CAAC,CAC5F,CACA,UAAU+L,EAAO,CACb,MAAMke,EAAK,KAAK,UAAU,UAAUle,EAAM,SAAS,EAC7Cme,EAAK,KAAK,UAAU,UAAUne,EAAM,SAAS,EACnD,GAAI,GAACke,GAAM,CAACC,GAGZ,OAAO,IAAI2I,EAAa5I,EAAIC,CAAE,CAClC,CACA,WAAY,CACR,OAAO,IAAI+I,GAAW,KAAK,UAAU,MAAO,KAAK,UAAU,KAAK,CACpE,CACA,kBAAmB,CACf,OAAO,IAAIA,GAAW,KAAK,UAAU,aAAc,KAAK,UAAU,YAAY,CAClF,CACJ,CACA,MAAMG,GAAN,MAAMA,EAAW,CAGb,YAAYC,EAASC,EAAS,CAC1B,KAAK,QAAUD,EACf,KAAK,QAAUC,CACnB,CACA,UAAW,CACP,MAAO,GAAG,KAAK,OAAO,QAAQ,KAAK,OAAO,EAC9C,CACA,MAAMtzB,EAAQ,CACV,OAAIA,IAAW,EACJ,KAEJ,IAAIozB,GAAW,KAAK,QAAUpzB,EAAQ,KAAK,QAAUA,CAAM,CACtE,CACA,OAAO+L,EAAO,CACV,OAAO,KAAK,UAAYA,EAAM,SAAW,KAAK,UAAYA,EAAM,OACpE,CACJ,EAlBaqnB,GAAK,KAAO,IAAIA,GAAW,EAAG,CAAC,EAC/BA,GAAK,IAAM,IAAIA,GAAW,OAAO,iBAAkB,OAAO,gBAAgB,EAFvF,IAAMH,GAANG,GAoBA,MAAMG,GAAN,MAAMA,EAAgB,CAElB,SAAU,CACN,MAAO,EACX,CACJ,EAJaA,GAAK,SAAW,IAAIA,GADjC,IAAMC,GAAND,GAMA,MAAME,EAAY,CACd,YAAYC,EAAS,CAIjB,GAHA,KAAK,QAAUA,EACf,KAAK,UAAY,KAAK,IAAG,EACzB,KAAK,MAAQ,GACTA,GAAW,EACX,MAAM,IAAIzjC,GAAmB,0BAA0B,CAE/D,CAEA,SAAU,CAEN,MAAI,EADU,KAAK,IAAG,EAAK,KAAK,UAAY,KAAK,UACnC,KAAK,QACf,KAAK,MAAQ,IAEV,KAAK,KAChB,CACJ,CCpIA,MAAM0jC,EAAQ,CACV,YAAYC,EAAOC,EAAQ,CACvB,KAAK,MAAQD,EACb,KAAK,OAASC,EACd,KAAK,MAAQ,CAAA,EACb,KAAK,MAAQ,IAAI,MAAMD,EAAQC,CAAM,CACzC,CACA,IAAIC,EAAGC,EAAG,CACN,OAAO,KAAK,MAAMD,EAAIC,EAAI,KAAK,KAAK,CACxC,CACA,IAAID,EAAGC,EAAG5jC,EAAO,CACb,KAAK,MAAM2jC,EAAIC,EAAI,KAAK,KAAK,EAAI5jC,CACrC,CACJ,CACA,SAAS6jC,GAAQt0B,EAAU,CACvB,OAAOA,IAAa,IAA2BA,IAAa,CAChE,CACA,MAAMu0B,GAAN,MAAMA,EAAkB,CAEpB,OAAO,OAAOC,EAAK,CACf,IAAI31B,EAAM,KAAK,QAAQ,IAAI21B,CAAG,EAC9B,OAAI31B,IAAQ,SACRA,EAAM,KAAK,QAAQ,KACnB,KAAK,QAAQ,IAAI21B,EAAK31B,CAAG,GAEtBA,CACX,CACA,YAAYoO,EAAOkf,EAAOxnB,EAAQ,CAC9B,KAAK,MAAQsI,EACb,KAAK,MAAQkf,EACb,KAAK,OAASxnB,EACd,KAAK,UAAY,CAAA,EACjB,IAAI8vB,EAAU,EACd,QAASxjC,EAAIgc,EAAM,gBAAkB,EAAGhc,EAAIgc,EAAM,uBAAyB,EAAGhc,IAAK,CAC/E,MAAM+e,EAAOmc,EAAMl7B,CAAC,EACpB,QAASia,EAAI,EAAGA,EAAI8E,EAAK,OAAQ9E,IAAK,CAClCupB,IACA,MAAMD,EAAMxkB,EAAK9E,CAAC,EACZrM,EAAM01B,GAAkB,OAAOC,CAAG,EACxC,KAAK,UAAU31B,CAAG,GAAK,KAAK,UAAUA,CAAG,GAAK,GAAK,CACvD,CACA41B,IACA,MAAM51B,EAAM01B,GAAkB,OAAO;AAAA,CAAI,EACzC,KAAK,UAAU11B,CAAG,GAAK,KAAK,UAAUA,CAAG,GAAK,GAAK,CACvD,CACA,KAAK,WAAa41B,CACtB,CACA,kBAAkBpoB,EAAO,CACrB,IAAIqoB,EAAiB,EACrB,MAAMC,EAAY,KAAK,IAAI,KAAK,UAAU,OAAQtoB,EAAM,UAAU,MAAM,EACxE,QAAS,EAAI,EAAG,EAAIsoB,EAAW,IAC3BD,GAAkB,KAAK,KAAK,KAAK,UAAU,CAAC,GAAK,IAAMroB,EAAM,UAAU,CAAC,GAAK,EAAE,EAEnF,MAAO,GAAKqoB,GAAkB,KAAK,WAAaroB,EAAM,WAC1D,CACJ,EArCakoB,GAAK,QAAU,IAAI,IADhC,IAAMK,GAANL,GCTA,MAAMM,EAA0B,CAC5B,QAAQC,EAAWC,EAAWf,EAAUF,GAAgB,SAAUkB,EAAe,CAC7E,GAAIF,EAAU,SAAW,GAAKC,EAAU,SAAW,EAC/C,OAAO/B,GAAoB,QAAQ8B,EAAWC,CAAS,EAK3D,MAAME,EAAa,IAAIhB,GAAQa,EAAU,OAAQC,EAAU,MAAM,EAC3DG,EAAa,IAAIjB,GAAQa,EAAU,OAAQC,EAAU,MAAM,EAC3DI,EAAU,IAAIlB,GAAQa,EAAU,OAAQC,EAAU,MAAM,EAE9D,QAASK,EAAK,EAAGA,EAAKN,EAAU,OAAQM,IACpC,QAASC,EAAK,EAAGA,EAAKN,EAAU,OAAQM,IAAM,CAC1C,GAAI,CAACrB,EAAQ,UACT,OAAOhB,GAAoB,gBAAgB8B,EAAWC,CAAS,EAEnE,MAAMO,EAAgBF,IAAO,EAAI,EAAIH,EAAW,IAAIG,EAAK,EAAGC,CAAE,EACxDE,EAAcF,IAAO,EAAI,EAAIJ,EAAW,IAAIG,EAAIC,EAAK,CAAC,EAC5D,IAAIG,EACAV,EAAU,WAAWM,CAAE,IAAML,EAAU,WAAWM,CAAE,GAChDD,IAAO,GAAKC,IAAO,EACnBG,EAAmB,EAGnBA,EAAmBP,EAAW,IAAIG,EAAK,EAAGC,EAAK,CAAC,EAEhDD,EAAK,GAAKC,EAAK,GAAKH,EAAW,IAAIE,EAAK,EAAGC,EAAK,CAAC,IAAM,IAEvDG,GAAoBL,EAAQ,IAAIC,EAAK,EAAGC,EAAK,CAAC,GAElDG,GAAqBR,EAAgBA,EAAcI,EAAIC,CAAE,EAAI,GAG7DG,EAAmB,GAEvB,MAAMC,EAAW,KAAK,IAAIH,EAAeC,EAAaC,CAAgB,EACtE,GAAIC,IAAaD,EAAkB,CAE/B,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,CAC5B,MACSI,IAAaH,GAClBH,EAAQ,IAAIC,EAAIC,EAAI,CAAC,EACrBH,EAAW,IAAIE,EAAIC,EAAI,CAAC,GAEnBI,IAAaF,IAClBJ,EAAQ,IAAIC,EAAIC,EAAI,CAAC,EACrBH,EAAW,IAAIE,EAAIC,EAAI,CAAC,GAE5BJ,EAAW,IAAIG,EAAIC,EAAII,CAAQ,CACnC,CAGJ,MAAMnlC,EAAS,CAAA,EACf,IAAIqlC,EAAoBb,EAAU,OAC9Bc,EAAoBb,EAAU,OAClC,SAASc,EAAkCT,EAAIC,EAAI,EAC3CD,EAAK,IAAMO,GAAqBN,EAAK,IAAMO,IAC3CtlC,EAAO,KAAK,IAAI6iC,EAAa,IAAIrK,EAAYsM,EAAK,EAAGO,CAAiB,EAAG,IAAI7M,EAAYuM,EAAK,EAAGO,CAAiB,CAAC,CAAC,EAExHD,EAAoBP,EACpBQ,EAAoBP,CACxB,CACA,IAAID,EAAKN,EAAU,OAAS,EACxBO,EAAKN,EAAU,OAAS,EAC5B,KAAOK,GAAM,GAAKC,GAAM,GAChBH,EAAW,IAAIE,EAAIC,CAAE,IAAM,GAC3BQ,EAAkCT,EAAIC,CAAE,EACxCD,IACAC,KAGIH,EAAW,IAAIE,EAAIC,CAAE,IAAM,EAC3BD,IAGAC,IAIZ,OAAAQ,EAAkC,GAAI,EAAE,EACxCvlC,EAAO,QAAO,EACP,IAAI0iC,GAAoB1iC,EAAQ,EAAK,CAChD,CACJ,CCxFA,MAAMwlC,EAAmB,CACrB,QAAQ7C,EAAMC,EAAMc,EAAUF,GAAgB,SAAU,CAGpD,GAAIb,EAAK,SAAW,GAAKC,EAAK,SAAW,EACrC,OAAOF,GAAoB,QAAQC,EAAMC,CAAI,EAEjD,MAAM6C,EAAO9C,EACP+C,EAAO9C,EACb,SAAS+C,EAAe7B,EAAG,EAAG,CAC1B,KAAOA,EAAI2B,EAAK,QAAU,EAAIC,EAAK,QAAUD,EAAK,WAAW3B,CAAC,IAAM4B,EAAK,WAAW,CAAC,GACjF5B,IACA,IAEJ,OAAOA,CACX,CACA,IAAI5/B,EAAI,EAKR,MAAM0hC,EAAI,IAAIC,GACdD,EAAE,IAAI,EAAGD,EAAe,EAAG,CAAC,CAAC,EAC7B,MAAM1e,EAAQ,IAAI6e,GAClB7e,EAAM,IAAI,EAAG2e,EAAE,IAAI,CAAC,IAAM,EAAI,KAAO,IAAIG,GAAU,KAAM,EAAG,EAAGH,EAAE,IAAI,CAAC,CAAC,CAAC,EACxE,IAAI10B,EAAI,EACR80B,EAAM,OAAa,CAEf,GADA9hC,IACI,CAACw/B,EAAQ,UACT,OAAOhB,GAAoB,gBAAgB+C,EAAMC,CAAI,EAGzD,MAAMO,EAAa,CAAC,KAAK,IAAI/hC,EAAGwhC,EAAK,OAAUxhC,EAAI,CAAE,EAC/CgiC,EAAa,KAAK,IAAIhiC,EAAGuhC,EAAK,OAAUvhC,EAAI,CAAE,EACpD,IAAKgN,EAAI+0B,EAAY/0B,GAAKg1B,EAAYh1B,GAAK,EAAG,CAE1C,MAAMi1B,EAAiBj1B,IAAMg1B,EAAa,GAAKN,EAAE,IAAI10B,EAAI,CAAC,EACpDk1B,EAAkBl1B,IAAM+0B,EAAa,GAAKL,EAAE,IAAI10B,EAAI,CAAC,EAAI,EACzD4yB,EAAI,KAAK,IAAI,KAAK,IAAIqC,EAAgBC,CAAe,EAAGX,EAAK,MAAM,EACnE1B,EAAID,EAAI5yB,EACd,GAAI4yB,EAAI2B,EAAK,QAAU1B,EAAI2B,EAAK,OAG5B,SAEJ,MAAMW,EAAUV,EAAe7B,EAAGC,CAAC,EACnC6B,EAAE,IAAI10B,EAAGm1B,CAAO,EAChB,MAAMC,EAAWxC,IAAMqC,EAAiBlf,EAAM,IAAI/V,EAAI,CAAC,EAAI+V,EAAM,IAAI/V,EAAI,CAAC,EAE1E,GADA+V,EAAM,IAAI/V,EAAGm1B,IAAYvC,EAAI,IAAIiC,GAAUO,EAAUxC,EAAGC,EAAGsC,EAAUvC,CAAC,EAAIwC,CAAQ,EAC9EV,EAAE,IAAI10B,CAAC,IAAMu0B,EAAK,QAAUG,EAAE,IAAI10B,CAAC,EAAIA,IAAMw0B,EAAK,OAClD,MAAMM,CAEd,CACJ,CACA,IAAIpgB,EAAOqB,EAAM,IAAI/V,CAAC,EACtB,MAAMlR,EAAS,CAAA,EACf,IAAIqlC,EAAoBI,EAAK,OACzBH,EAAoBI,EAAK,OAC7B,OAAa,CACT,MAAMa,EAAO3gB,EAAOA,EAAK,EAAIA,EAAK,OAAS,EACrC4gB,EAAO5gB,EAAOA,EAAK,EAAIA,EAAK,OAAS,EAI3C,IAHI2gB,IAASlB,GAAqBmB,IAASlB,IACvCtlC,EAAO,KAAK,IAAI6iC,EAAa,IAAIrK,EAAY+N,EAAMlB,CAAiB,EAAG,IAAI7M,EAAYgO,EAAMlB,CAAiB,CAAC,CAAC,EAEhH,CAAC1f,EACD,MAEJyf,EAAoBzf,EAAK,EACzB0f,EAAoB1f,EAAK,EACzBA,EAAOA,EAAK,IAChB,CACA,OAAA5lB,EAAO,QAAO,EACP,IAAI0iC,GAAoB1iC,EAAQ,EAAK,CAChD,CACJ,CACA,MAAM+lC,EAAU,CACZ,YAAYU,EAAM3C,EAAGC,EAAGhhC,EAAQ,CAC5B,KAAK,KAAO0jC,EACZ,KAAK,EAAI3C,EACT,KAAK,EAAIC,EACT,KAAK,OAAShhC,CAClB,CACJ,CAIA,MAAM8iC,EAAe,CACjB,aAAc,CACV,KAAK,YAAc,IAAI,WAAW,EAAE,EACpC,KAAK,YAAc,IAAI,WAAW,EAAE,CACxC,CACA,IAAIrkB,EAAK,CACL,OAAIA,EAAM,GACNA,EAAM,CAACA,EAAM,EACN,KAAK,YAAYA,CAAG,GAGpB,KAAK,YAAYA,CAAG,CAEnC,CACA,IAAIA,EAAKrhB,EAAO,CACZ,GAAIqhB,EAAM,EAAG,CAET,GADAA,EAAM,CAACA,EAAM,EACTA,GAAO,KAAK,YAAY,OAAQ,CAChC,MAAMre,EAAM,KAAK,YACjB,KAAK,YAAc,IAAI,WAAWA,EAAI,OAAS,CAAC,EAChD,KAAK,YAAY,IAAIA,CAAG,CAC5B,CACA,KAAK,YAAYqe,CAAG,EAAIrhB,CAC5B,KACK,CACD,GAAIqhB,GAAO,KAAK,YAAY,OAAQ,CAChC,MAAMre,EAAM,KAAK,YACjB,KAAK,YAAc,IAAI,WAAWA,EAAI,OAAS,CAAC,EAChD,KAAK,YAAY,IAAIA,CAAG,CAC5B,CACA,KAAK,YAAYqe,CAAG,EAAIrhB,CAC5B,CACJ,CACJ,CAIA,MAAM2lC,EAAyB,CAC3B,aAAc,CACV,KAAK,YAAc,CAAA,EACnB,KAAK,YAAc,CAAA,CACvB,CACA,IAAItkB,EAAK,CACL,OAAIA,EAAM,GACNA,EAAM,CAACA,EAAM,EACN,KAAK,YAAYA,CAAG,GAGpB,KAAK,YAAYA,CAAG,CAEnC,CACA,IAAIA,EAAKrhB,EAAO,CACRqhB,EAAM,GACNA,EAAM,CAACA,EAAM,EACb,KAAK,YAAYA,CAAG,EAAIrhB,GAGxB,KAAK,YAAYqhB,CAAG,EAAIrhB,CAEhC,CACJ,CClJA,MAAMumC,EAAuB,CACzB,YAAY7K,EAAOlf,EAAOgqB,EAA2B,CACjD,KAAK,MAAQ9K,EACb,KAAK,MAAQlf,EACb,KAAK,0BAA4BgqB,EACjC,KAAK,SAAW,CAAA,EAChB,KAAK,4BAA8B,CAAA,EACnC,KAAK,iBAAmB,CAAA,EACxB,KAAK,0BAA4B,CAAA,EACjC,KAAK,4BAA4B,KAAK,CAAC,EACvC,QAASlrB,EAAa,KAAK,MAAM,gBAAiBA,GAAc,KAAK,MAAM,cAAeA,IAAc,CACpG,IAAIiE,EAAOmc,EAAMpgB,EAAa,CAAC,EAC3BmrB,EAAkB,EAClBnrB,IAAe,KAAK,MAAM,iBAAmB,KAAK,MAAM,YAAc,IACtEmrB,EAAkB,KAAK,MAAM,YAAc,EAC3ClnB,EAAOA,EAAK,UAAUknB,CAAe,GAEzC,KAAK,iBAAiB,KAAKA,CAAe,EAC1C,IAAIC,EAAkB,EACtB,GAAI,CAACF,EAA2B,CAC5B,MAAMG,EAAmBpnB,EAAK,UAAS,EACvCmnB,EAAkBnnB,EAAK,OAASonB,EAAiB,OACjDpnB,EAAOonB,EAAiB,QAAO,CACnC,CACA,KAAK,0BAA0B,KAAKD,CAAe,EACnD,MAAMnR,EAAaja,IAAe,KAAK,MAAM,cAAgB,KAAK,IAAI,KAAK,MAAM,UAAY,EAAImrB,EAAkBC,EAAiBnnB,EAAK,MAAM,EAAIA,EAAK,OACxJ,QAAS/e,EAAI,EAAGA,EAAI+0B,EAAY/0B,IAC5B,KAAK,SAAS,KAAK+e,EAAK,WAAW/e,CAAC,CAAC,EAErC8a,EAAa,KAAK,MAAM,gBACxB,KAAK,SAAS,KAAK,EAAkB,EACrC,KAAK,4BAA4B,KAAK,KAAK,SAAS,MAAM,EAElE,CACJ,CACA,UAAW,CACP,MAAO,WAAW,KAAK,IAAI,GAC/B,CACA,IAAI,MAAO,CACP,OAAO,KAAK,QAAQ,IAAI+c,EAAY,EAAG,KAAK,MAAM,CAAC,CACvD,CACA,QAAQ7b,EAAO,CACX,OAAO,KAAK,SAAS,MAAMA,EAAM,MAAOA,EAAM,YAAY,EAAE,IAAIvd,GAAK,OAAO,aAAaA,CAAC,CAAC,EAAE,KAAK,EAAE,CACxG,CACA,WAAW4Q,EAAQ,CACf,OAAO,KAAK,SAASA,CAAM,CAC/B,CACA,IAAI,QAAS,CACT,OAAO,KAAK,SAAS,MACzB,CACA,iBAAiBjN,EAAQ,CAGrB,MAAMgkC,EAAeC,GAAYjkC,EAAS,EAAI,KAAK,SAASA,EAAS,CAAC,EAAI,EAAE,EACtEkkC,EAAeD,GAAYjkC,EAAS,KAAK,SAAS,OAAS,KAAK,SAASA,CAAM,EAAI,EAAE,EAC3F,GAAIgkC,IAAiB,GAA4CE,IAAiB,EAE9E,MAAO,GAEX,GAAIF,IAAiB,EAEjB,MAAO,KAEX,IAAIrtB,EAAQ,EACZ,OAAIqtB,IAAiBE,IACjBvtB,GAAS,GACLqtB,IAAiB,GAA0CE,IAAiB,IAC5EvtB,GAAS,IAGjBA,GAASwtB,GAAyBH,CAAY,EAC9CrtB,GAASwtB,GAAyBD,CAAY,EACvCvtB,CACX,CACA,gBAAgB1J,EAAQm3B,EAAa,QAAS,CAE1C,MAAMxmC,EAAIi4B,GAAsB,KAAK,4BAA8Bz4B,GAAUA,GAAS6P,CAAM,EACtFo3B,EAAap3B,EAAS,KAAK,4BAA4BrP,CAAC,EAC9D,OAAO,IAAI6a,EAAS,KAAK,MAAM,gBAAkB7a,EAAG,EAAI,KAAK,iBAAiBA,CAAC,EAAIymC,GAAeA,IAAe,GAAKD,IAAe,OAAU,EAAI,KAAK,0BAA0BxmC,CAAC,EAAE,CACzL,CACA,eAAegc,EAAO,CAClB,MAAM0qB,EAAO,KAAK,gBAAgB1qB,EAAM,MAAO,OAAO,EAChD2qB,EAAO,KAAK,gBAAgB3qB,EAAM,aAAc,MAAM,EAC5D,OAAI2qB,EAAK,SAASD,CAAI,EACX/qB,EAAM,cAAcgrB,EAAMA,CAAI,EAElChrB,EAAM,cAAc+qB,EAAMC,CAAI,CACzC,CAIA,mBAAmBt3B,EAAQ,CAIvB,GAHIA,EAAS,GAAKA,GAAU,KAAK,SAAS,QAGtC,CAACu3B,GAAW,KAAK,SAASv3B,CAAM,CAAC,EACjC,OAGJ,IAAIuN,EAAQvN,EACZ,KAAOuN,EAAQ,GAAKgqB,GAAW,KAAK,SAAShqB,EAAQ,CAAC,CAAC,GACnDA,IAGJ,IAAIvR,EAAMgE,EACV,KAAOhE,EAAM,KAAK,SAAS,QAAUu7B,GAAW,KAAK,SAASv7B,CAAG,CAAC,GAC9DA,IAEJ,OAAO,IAAIwsB,EAAYjb,EAAOvR,CAAG,CACrC,CAEA,sBAAsBgE,EAAQ,CAI1B,GAHIA,EAAS,GAAKA,GAAU,KAAK,SAAS,QAGtC,CAACu3B,GAAW,KAAK,SAASv3B,CAAM,CAAC,EACjC,OAGJ,IAAIuN,EAAQvN,EACZ,KAAOuN,EAAQ,GAAKgqB,GAAW,KAAK,SAAShqB,EAAQ,CAAC,CAAC,GAAK,CAACiqB,GAAY,KAAK,SAASjqB,CAAK,CAAC,GACzFA,IAGJ,IAAIvR,EAAMgE,EACV,KAAOhE,EAAM,KAAK,SAAS,QAAUu7B,GAAW,KAAK,SAASv7B,CAAG,CAAC,GAAK,CAACw7B,GAAY,KAAK,SAASx7B,CAAG,CAAC,GAClGA,IAEJ,OAAO,IAAIwsB,EAAYjb,EAAOvR,CAAG,CACrC,CACA,aAAa2Q,EAAO,CAChB,OAAO,KAAK,gBAAgBA,EAAM,YAAY,EAAE,WAAa,KAAK,gBAAgBA,EAAM,KAAK,EAAE,UACnG,CACA,gBAAgB0mB,EAASC,EAAS,CAC9B,OAAO,KAAK,SAASD,CAAO,IAAM,KAAK,SAASC,CAAO,CAC3D,CACA,kBAAkB3mB,EAAO,CACrB,MAAMY,EAAQob,GAAmB,KAAK,4BAA6BmL,GAAKA,GAAKnnB,EAAM,KAAK,GAAK,EACvF3Q,EAAM+sB,GAAoB,KAAK,4BAA6B+K,GAAKnnB,EAAM,cAAgBmnB,CAAC,GAAK,KAAK,SAAS,OACjH,OAAO,IAAItL,EAAYjb,EAAOvR,CAAG,CACrC,CACJ,CACA,SAASu7B,GAAW73B,EAAU,CAC1B,OAAOA,GAAY,IAAuBA,GAAY,KAC/CA,GAAY,IAAuBA,GAAY,IAC/CA,GAAY,IAA4BA,GAAY,EAC/D,CACA,SAAS83B,GAAY93B,EAAU,CAC3B,OAAOA,GAAY,IAAuBA,GAAY,EAC1D,CACA,MAAMgK,GAAQ,CACT,EAAyC,EACzC,EAAyC,EACzC,EAA0C,EAC1C,EAAmC,GACnC,EAAqC,EACrC,EAAyC,GACzC,EAAqC,EACrC,EAA2C,GAC3C,EAA2C,EAChD,EACA,SAASwtB,GAAyBO,EAAU,CACxC,OAAO/tB,GAAM+tB,CAAQ,CACzB,CACA,SAAST,GAAYt3B,EAAU,CAC3B,OAAIA,IAAa,GACN,EAEFA,IAAa,GACX,EAEFs0B,GAAQt0B,CAAQ,EACd,EAEFA,GAAY,IAAuBA,GAAY,IAC7C,EAEFA,GAAY,IAAuBA,GAAY,GAC7C,EAEFA,GAAY,IAA4BA,GAAY,GAClD,EAEFA,IAAa,GACX,EAEFA,IAAa,IAA2BA,IAAa,GACnD,EAGA,CAEf,CC3LA,SAASg4B,GAAkBjxB,EAASwnB,EAAeC,EAAeyJ,EAAqBC,EAAqBlE,EAAS,CACjH,GAAI,CAAE,MAAA/M,EAAO,gBAAAkR,GAAoBC,GAAkDrxB,EAASwnB,EAAeC,EAAewF,CAAO,EACjI,GAAI,CAACA,EAAQ,UACT,MAAO,CAAA,EAEX,MAAMqE,EAAkBtxB,EAAQ,OAAOikB,GAAK,CAACmN,EAAgB,IAAInN,CAAC,CAAC,EAC7DsN,EAAiBC,GAAsBF,EAAiBJ,EAAqBC,EAAqB3J,EAAeC,EAAewF,CAAO,EAC7I,OAAAnM,GAASZ,EAAOqR,CAAc,EAC9BrR,EAAQuR,GAA0BvR,CAAK,EAEvCA,EAAQA,EAAM,OAAO/E,GAAW,CAC5B,MAAMiK,EAAQjK,EAAQ,SAAS,cAAa,EAAG,MAAMqM,CAAa,EAAE,IAAIntB,GAAKA,EAAE,KAAI,CAAE,EAErF,OADqB+qB,EAAM,KAAK;AAAA,CAAI,EAChB,QAAU,IAAMsM,GAAWtM,EAAO/qB,GAAKA,EAAE,QAAU,CAAC,GAAK,CACjF,CAAC,EACD6lB,EAAQyR,GAAsB3xB,EAASkgB,CAAK,EACrCA,CACX,CACA,SAASwR,GAAWhlC,EAAKzC,EAAW,CAChC,IAAIsC,EAAQ,EACZ,UAAWoX,KAAKjX,EACRzC,EAAU0Z,CAAC,GACXpX,IAGR,OAAOA,CACX,CACA,SAAS8kC,GAAkDrxB,EAASwnB,EAAeC,EAAewF,EAAS,CACvG,MAAM/M,EAAQ,CAAA,EACR0R,EAAY5xB,EACb,OAAOikB,GAAKA,EAAE,SAAS,SAAWA,EAAE,SAAS,QAAU,CAAC,EACxD,IAAIx2B,GAAK,IAAIogC,GAAkBpgC,EAAE,SAAU+5B,EAAe/5B,CAAC,CAAC,EAC3DokC,EAAa,IAAI,IAAI7xB,EACtB,OAAOikB,GAAKA,EAAE,SAAS,SAAWA,EAAE,SAAS,QAAU,CAAC,EACxD,IAAIx2B,GAAK,IAAIogC,GAAkBpgC,EAAE,SAAUg6B,EAAeh6B,CAAC,CAAC,CAAC,EAC5D2jC,EAAkB,IAAI,IAC5B,UAAWU,KAAYF,EAAW,CAC9B,IAAIG,EAAoB,GACpBC,EACJ,UAAWC,KAAaJ,EAAY,CAChC,MAAMK,EAAaJ,EAAS,kBAAkBG,CAAS,EACnDC,EAAaH,IACbA,EAAoBG,EACpBF,EAAOC,EAEf,CAOA,GANIF,EAAoB,IAAQC,IAC5BH,EAAW,OAAOG,CAAI,EACtB9R,EAAM,KAAK,IAAImG,GAAiByL,EAAS,MAAOE,EAAK,KAAK,CAAC,EAC3DZ,EAAgB,IAAIU,EAAS,MAAM,EACnCV,EAAgB,IAAIY,EAAK,MAAM,GAE/B,CAAC/E,EAAQ,UACT,MAAO,CAAE,MAAA/M,EAAO,gBAAAkR,CAAe,CAEvC,CACA,MAAO,CAAE,MAAAlR,EAAO,gBAAAkR,CAAe,CACnC,CACA,SAASI,GAAsBxxB,EAASkxB,EAAqBC,EAAqB3J,EAAeC,EAAewF,EAAS,CACrH,MAAM/M,EAAQ,CAAA,EACRiS,EAAsB,IAAIxW,GAChC,UAAWrZ,KAAUtC,EACjB,QAAS9V,EAAIoY,EAAO,SAAS,gBAAiBpY,EAAIoY,EAAO,SAAS,uBAAyB,EAAGpY,IAAK,CAC/F,MAAM4N,EAAM,GAAGo5B,EAAoBhnC,EAAI,CAAC,CAAC,IAAIgnC,EAAoBhnC,EAAI,EAAI,CAAC,CAAC,IAAIgnC,EAAoBhnC,EAAI,EAAI,CAAC,CAAC,GAC7GioC,EAAoB,IAAIr6B,EAAK,CAAE,MAAO,IAAIorB,EAAUh5B,EAAGA,EAAI,CAAC,EAAG,CACnE,CAEJ,MAAMkoC,EAAmB,CAAA,EACzBpyB,EAAQ,KAAKohB,GAAU6C,GAAKA,EAAE,SAAS,gBAAiB1C,EAAgB,CAAC,EACzE,UAAWjf,KAAUtC,EAAS,CAC1B,IAAIqyB,EAAe,CAAA,EACnB,QAASnoC,EAAIoY,EAAO,SAAS,gBAAiBpY,EAAIoY,EAAO,SAAS,uBAAyB,EAAGpY,IAAK,CAC/F,MAAM4N,EAAM,GAAGq5B,EAAoBjnC,EAAI,CAAC,CAAC,IAAIinC,EAAoBjnC,EAAI,EAAI,CAAC,CAAC,IAAIinC,EAAoBjnC,EAAI,EAAI,CAAC,CAAC,GACvGooC,EAAuB,IAAIpP,EAAUh5B,EAAGA,EAAI,CAAC,EAC7CqoC,EAAe,CAAA,EACrBJ,EAAoB,QAAQr6B,EAAK,CAAC,CAAE,MAAAoO,CAAK,IAAO,CAC5C,UAAWssB,KAAeH,EAEtB,GAAIG,EAAY,kBAAkB,uBAAyB,IAAMtsB,EAAM,wBACnEssB,EAAY,kBAAkB,uBAAyB,IAAMF,EAAqB,uBAAwB,CAC1GE,EAAY,kBAAoB,IAAItP,EAAUsP,EAAY,kBAAkB,gBAAiBtsB,EAAM,sBAAsB,EACzHssB,EAAY,kBAAoB,IAAItP,EAAUsP,EAAY,kBAAkB,gBAAiBF,EAAqB,sBAAsB,EACxIC,EAAa,KAAKC,CAAW,EAC7B,MACJ,CAEJ,MAAMrmB,EAAU,CACZ,kBAAmBmmB,EACnB,kBAAmBpsB,CACvC,EACgBksB,EAAiB,KAAKjmB,CAAO,EAC7BomB,EAAa,KAAKpmB,CAAO,CAC7B,CAAC,EACDkmB,EAAeE,CACnB,CACA,GAAI,CAACtF,EAAQ,UACT,MAAO,CAAA,CAEf,CACAmF,EAAiB,KAAK5Q,GAAaJ,GAAU,GAAK,EAAE,kBAAkB,OAAQG,EAAgB,CAAC,CAAC,EAChG,MAAMkR,EAAc,IAAI5P,GAClB6P,EAAc,IAAI7P,GACxB,UAAW1W,KAAWimB,EAAkB,CACpC,MAAMO,EAAgBxmB,EAAQ,kBAAkB,gBAAkBA,EAAQ,kBAAkB,gBACtFymB,EAAmBH,EAAY,aAAatmB,EAAQ,iBAAiB,EACrE0mB,EAA6BH,EAAY,aAAavmB,EAAQ,iBAAiB,EAAE,aAAawmB,CAAa,EAC3GG,EAA8BF,EAAiB,gBAAgBC,CAA0B,EAC/F,UAAWp1B,KAAKq1B,EAA4B,OAAQ,CAChD,GAAIr1B,EAAE,OAAS,EACX,SAEJ,MAAM4qB,EAAoB5qB,EACpB2qB,EAAoB3qB,EAAE,MAAM,CAACk1B,CAAa,EAChDzS,EAAM,KAAK,IAAImG,GAAiB+B,EAAmBC,CAAiB,CAAC,EACrEoK,EAAY,SAASpK,CAAiB,EACtCqK,EAAY,SAAStK,CAAiB,CAC1C,CACJ,CACAlI,EAAM,KAAKkB,GAAU,GAAK,EAAE,SAAS,gBAAiBG,EAAgB,CAAC,EACvE,MAAMwR,EAAoB,IAAIrQ,GAAgB1iB,CAAO,EACrD,QAAS9V,EAAI,EAAGA,EAAIg2B,EAAM,OAAQh2B,IAAK,CACnC,MAAM8oC,EAAO9S,EAAMh2B,CAAC,EACd+oC,EAA0BF,EAAkB,mBAAmB9O,GAAKA,EAAE,SAAS,iBAAmB+O,EAAK,SAAS,eAAe,EAC/HE,EAAyBhR,GAAmBliB,EAASikB,GAAKA,EAAE,SAAS,iBAAmB+O,EAAK,SAAS,eAAe,EACrHG,EAAa,KAAK,IAAIH,EAAK,SAAS,gBAAkBC,EAAwB,SAAS,gBAAiBD,EAAK,SAAS,gBAAkBE,EAAuB,SAAS,eAAe,EACvLE,EAAyBL,EAAkB,mBAAmB9O,GAAKA,EAAE,SAAS,gBAAkB+O,EAAK,SAAS,sBAAsB,EACpIK,EAAwBnR,GAAmBliB,EAASikB,GAAKA,EAAE,SAAS,gBAAkB+O,EAAK,SAAS,sBAAsB,EAC1HM,EAAa,KAAK,IAAIF,EAAuB,SAAS,uBAAyBJ,EAAK,SAAS,uBAAwBK,EAAsB,SAAS,uBAAyBL,EAAK,SAAS,sBAAsB,EACvN,IAAIO,EACJ,IAAKA,EAAc,EAAGA,EAAcJ,EAAYI,IAAe,CAC3D,MAAMC,EAAWR,EAAK,SAAS,gBAAkBO,EAAc,EACzDE,EAAUT,EAAK,SAAS,gBAAkBO,EAAc,EAO9D,GANIC,EAAWhM,EAAc,QAAUiM,EAAUhM,EAAc,QAG3DgL,EAAY,SAASgB,CAAO,GAAKf,EAAY,SAASc,CAAQ,GAG9D,CAACE,GAAgBlM,EAAcgM,EAAW,CAAC,EAAG/L,EAAcgM,EAAU,CAAC,EAAGxG,CAAO,EACjF,KAER,CACIsG,EAAc,IACdb,EAAY,SAAS,IAAIxP,EAAU8P,EAAK,SAAS,gBAAkBO,EAAaP,EAAK,SAAS,eAAe,CAAC,EAC9GP,EAAY,SAAS,IAAIvP,EAAU8P,EAAK,SAAS,gBAAkBO,EAAaP,EAAK,SAAS,eAAe,CAAC,GAElH,IAAIW,EACJ,IAAKA,EAAiB,EAAGA,EAAiBL,EAAYK,IAAkB,CACpE,MAAMH,EAAWR,EAAK,SAAS,uBAAyBW,EAClDF,EAAUT,EAAK,SAAS,uBAAyBW,EAOvD,GANIH,EAAWhM,EAAc,QAAUiM,EAAUhM,EAAc,QAG3DgL,EAAY,SAASgB,CAAO,GAAKf,EAAY,SAASc,CAAQ,GAG9D,CAACE,GAAgBlM,EAAcgM,EAAW,CAAC,EAAG/L,EAAcgM,EAAU,CAAC,EAAGxG,CAAO,EACjF,KAER,CACI0G,EAAiB,IACjBjB,EAAY,SAAS,IAAIxP,EAAU8P,EAAK,SAAS,uBAAwBA,EAAK,SAAS,uBAAyBW,CAAc,CAAC,EAC/HlB,EAAY,SAAS,IAAIvP,EAAU8P,EAAK,SAAS,uBAAwBA,EAAK,SAAS,uBAAyBW,CAAc,CAAC,IAE/HJ,EAAc,GAAKI,EAAiB,KACpCzT,EAAMh2B,CAAC,EAAI,IAAIm8B,GAAiB,IAAInD,EAAU8P,EAAK,SAAS,gBAAkBO,EAAaP,EAAK,SAAS,uBAAyBW,CAAc,EAAG,IAAIzQ,EAAU8P,EAAK,SAAS,gBAAkBO,EAAaP,EAAK,SAAS,uBAAyBW,CAAc,CAAC,EAE5Q,CACA,OAAOzT,CACX,CACA,SAASwT,GAAgBE,EAAOC,EAAO5G,EAAS,CAC5C,GAAI2G,EAAM,KAAI,IAAOC,EAAM,KAAI,EAC3B,MAAO,GAEX,GAAID,EAAM,OAAS,KAAOC,EAAM,OAAS,IACrC,MAAO,GAGX,MAAMtqC,EADwB,IAAIwlC,GAAkB,EACf,QAAQ,IAAIkB,GAAuB,CAAC2D,CAAK,EAAG,IAAI/tB,EAAM,EAAG,EAAG,EAAG+tB,EAAM,MAAM,EAAG,EAAK,EAAG,IAAI3D,GAAuB,CAAC4D,CAAK,EAAG,IAAIhuB,EAAM,EAAG,EAAG,EAAGguB,EAAM,MAAM,EAAG,EAAK,EAAG5G,CAAO,EAChN,IAAI6G,EAA0B,EAC9B,MAAMC,EAAW3H,EAAa,OAAO7iC,EAAO,MAAOqqC,EAAM,MAAM,EAC/D,UAAWv4B,KAAO04B,EACd14B,EAAI,UAAU,QAAQ0P,GAAO,CACpBwiB,GAAQqG,EAAM,WAAW7oB,CAAG,CAAC,GAC9B+oB,GAER,CAAC,EAEL,SAASE,EAAgB1pC,EAAK,CAC1B,IAAIiC,EAAQ,EACZ,QAASrC,EAAI,EAAGA,EAAI0pC,EAAM,OAAQ1pC,IACzBqjC,GAAQjjC,EAAI,WAAWJ,CAAC,CAAC,GAC1BqC,IAGR,OAAOA,CACX,CACA,MAAM0nC,EAAmBD,EAAgBJ,EAAM,OAASC,EAAM,OAASD,EAAQC,CAAK,EAEpF,OADUC,EAA0BG,EAAmB,IAAOA,EAAmB,EAErF,CACA,SAASxC,GAA0BvR,EAAO,CACtC,GAAIA,EAAM,SAAW,EACjB,OAAOA,EAEXA,EAAM,KAAKkB,GAAUtE,GAAKA,EAAE,SAAS,gBAAiByE,EAAgB,CAAC,EACvE,MAAMh4B,EAAS,CAAC22B,EAAM,CAAC,CAAC,EACxB,QAASh2B,EAAI,EAAGA,EAAIg2B,EAAM,OAAQh2B,IAAK,CACnC,MAAMiH,EAAO5H,EAAOA,EAAO,OAAS,CAAC,EAC/B4xB,EAAU+E,EAAMh2B,CAAC,EACjBgqC,EAAe/Y,EAAQ,SAAS,gBAAkBhqB,EAAK,SAAS,uBAChEgjC,EAAehZ,EAAQ,SAAS,gBAAkBhqB,EAAK,SAAS,uBAEtE,GAD6B+iC,GAAgB,GAAKC,GAAgB,GACtCD,EAAeC,GAAgB,EAAG,CAC1D5qC,EAAOA,EAAO,OAAS,CAAC,EAAI4H,EAAK,KAAKgqB,CAAO,EAC7C,QACJ,CACA5xB,EAAO,KAAK4xB,CAAO,CACvB,CACA,OAAO5xB,CACX,CACA,SAASooC,GAAsB3xB,EAASkgB,EAAO,CAC3C,MAAMkU,EAAoB,IAAI1R,GAAgB1iB,CAAO,EACrD,OAAAkgB,EAAQA,EAAM,OAAOpD,GAAK,CACtB,MAAMuX,EAA8BD,EAAkB,mBAAmBnQ,GAAKA,EAAE,SAAS,gBAAkBnH,EAAE,SAAS,sBAAsB,GACrI,IAAIuJ,GAAiB,IAAInD,EAAU,EAAG,CAAC,EAAG,IAAIA,EAAU,EAAG,CAAC,CAAC,EAC9DoR,EAA8BpS,GAAmBliB,EAASikB,GAAKA,EAAE,SAAS,gBAAkBnH,EAAE,SAAS,sBAAsB,EAEnI,OADuBuX,IAAgCC,CAE3D,CAAC,EACMpU,CACX,CC9OA,SAASqU,GAAsBxG,EAAWC,EAAW1B,EAAe,CAChE,IAAI/iC,EAAS+iC,EACb,OAAA/iC,EAASirC,GAA4BzG,EAAWC,EAAWzkC,CAAM,EAGjEA,EAASirC,GAA4BzG,EAAWC,EAAWzkC,CAAM,EACjEA,EAASkrC,GAAmB1G,EAAWC,EAAWzkC,CAAM,EACjDA,CACX,CAaA,SAASirC,GAA4BzG,EAAWC,EAAW1B,EAAe,CACtE,GAAIA,EAAc,SAAW,EACzB,OAAOA,EAEX,MAAM/iC,EAAS,CAAA,EACfA,EAAO,KAAK+iC,EAAc,CAAC,CAAC,EAE5B,QAASpiC,EAAI,EAAGA,EAAIoiC,EAAc,OAAQpiC,IAAK,CAC3C,MAAMwqC,EAAanrC,EAAOA,EAAO,OAAS,CAAC,EAC3C,IAAIyH,EAAMs7B,EAAcpiC,CAAC,EACzB,GAAI8G,EAAI,UAAU,SAAWA,EAAI,UAAU,QAAS,CAChD,MAAM1E,EAAS0E,EAAI,UAAU,MAAQ0jC,EAAW,UAAU,aAC1D,IAAIjnC,EACJ,IAAKA,EAAI,EAAGA,GAAKnB,GACT,EAAAyhC,EAAU,WAAW/8B,EAAI,UAAU,MAAQvD,CAAC,IAAMsgC,EAAU,WAAW/8B,EAAI,UAAU,aAAevD,CAAC,GACrGugC,EAAU,WAAWh9B,EAAI,UAAU,MAAQvD,CAAC,IAAMugC,EAAU,WAAWh9B,EAAI,UAAU,aAAevD,CAAC,GAFpFA,IACrB,CAMJ,GADAA,IACIA,IAAMnB,EAAQ,CAEd/C,EAAOA,EAAO,OAAS,CAAC,EAAI,IAAI6iC,EAAa,IAAIrK,EAAY2S,EAAW,UAAU,MAAO1jC,EAAI,UAAU,aAAe1E,CAAM,EAAG,IAAIy1B,EAAY2S,EAAW,UAAU,MAAO1jC,EAAI,UAAU,aAAe1E,CAAM,CAAC,EAC/M,QACJ,CACA0E,EAAMA,EAAI,MAAM,CAACvD,CAAC,CACtB,CACAlE,EAAO,KAAKyH,CAAG,CACnB,CACA,MAAM2jC,EAAU,CAAA,EAEhB,QAASzqC,EAAI,EAAGA,EAAIX,EAAO,OAAS,EAAGW,IAAK,CACxC,MAAM0qC,EAAarrC,EAAOW,EAAI,CAAC,EAC/B,IAAI8G,EAAMzH,EAAOW,CAAC,EAClB,GAAI8G,EAAI,UAAU,SAAWA,EAAI,UAAU,QAAS,CAChD,MAAM1E,EAASsoC,EAAW,UAAU,MAAQ5jC,EAAI,UAAU,aAC1D,IAAIvD,EACJ,IAAKA,EAAI,EAAGA,EAAInB,GACR,GAACyhC,EAAU,gBAAgB/8B,EAAI,UAAU,MAAQvD,EAAGuD,EAAI,UAAU,aAAevD,CAAC,GAClF,CAACugC,EAAU,gBAAgBh9B,EAAI,UAAU,MAAQvD,EAAGuD,EAAI,UAAU,aAAevD,CAAC,GAFlEA,IACpB,CAKJ,GAAIA,IAAMnB,EAAQ,CAEd/C,EAAOW,EAAI,CAAC,EAAI,IAAIkiC,EAAa,IAAIrK,EAAY/wB,EAAI,UAAU,MAAQ1E,EAAQsoC,EAAW,UAAU,YAAY,EAAG,IAAI7S,EAAY/wB,EAAI,UAAU,MAAQ1E,EAAQsoC,EAAW,UAAU,YAAY,CAAC,EACnM,QACJ,CACInnC,EAAI,IACJuD,EAAMA,EAAI,MAAMvD,CAAC,EAEzB,CACAknC,EAAQ,KAAK3jC,CAAG,CACpB,CACA,OAAIzH,EAAO,OAAS,GAChBorC,EAAQ,KAAKprC,EAAOA,EAAO,OAAS,CAAC,CAAC,EAEnCorC,CACX,CAcA,SAASF,GAAmB1G,EAAWC,EAAW1B,EAAe,CAC7D,GAAI,CAACyB,EAAU,kBAAoB,CAACC,EAAU,iBAC1C,OAAO1B,EAEX,QAASpiC,EAAI,EAAGA,EAAIoiC,EAAc,OAAQpiC,IAAK,CAC3C,MAAM2qC,EAAY3qC,EAAI,EAAIoiC,EAAcpiC,EAAI,CAAC,EAAI,OAC3C4qC,EAAOxI,EAAcpiC,CAAC,EACtB6qC,EAAY7qC,EAAI,EAAIoiC,EAAc,OAASA,EAAcpiC,EAAI,CAAC,EAAI,OAClE8qC,EAAiB,IAAIjT,EAAY8S,EAAWA,EAAS,UAAU,aAAe,EAAI,EAAGE,EAAWA,EAAS,UAAU,MAAQ,EAAIhH,EAAU,MAAM,EAC/IkH,EAAiB,IAAIlT,EAAY8S,EAAWA,EAAS,UAAU,aAAe,EAAI,EAAGE,EAAWA,EAAS,UAAU,MAAQ,EAAI/G,EAAU,MAAM,EACjJ8G,EAAK,UAAU,QACfxI,EAAcpiC,CAAC,EAAIgrC,GAA0BJ,EAAM/G,EAAWC,EAAWgH,EAAgBC,CAAc,EAElGH,EAAK,UAAU,UACpBxI,EAAcpiC,CAAC,EAAIgrC,GAA0BJ,EAAK,KAAI,EAAI9G,EAAWD,EAAWkH,EAAgBD,CAAc,EAAE,KAAI,EAE5H,CACA,OAAO1I,CACX,CACA,SAAS4I,GAA0BJ,EAAM/G,EAAWC,EAAWgH,EAAgBC,EAAgB,CAG3F,IAAIE,EAAc,EAClB,KAAOL,EAAK,UAAU,MAAQK,GAAeH,EAAe,OACxDF,EAAK,UAAU,MAAQK,GAAeF,EAAe,OACrDjH,EAAU,gBAAgB8G,EAAK,UAAU,MAAQK,EAAaL,EAAK,UAAU,aAAeK,CAAW,GAAKA,EAAc,KAC1HA,IAEJA,IACA,IAAIC,EAAa,EACjB,KAAON,EAAK,UAAU,MAAQM,EAAaJ,EAAe,cACtDF,EAAK,UAAU,aAAeM,EAAaH,EAAe,cAC1DjH,EAAU,gBAAgB8G,EAAK,UAAU,MAAQM,EAAYN,EAAK,UAAU,aAAeM,CAAU,GAAKA,EAAa,KACvHA,IAEJ,GAAID,IAAgB,GAAKC,IAAe,EACpC,OAAON,EAIX,IAAIhyB,EAAY,EACZC,EAAY,GAEhB,QAASC,EAAQ,CAACmyB,EAAanyB,GAASoyB,EAAYpyB,IAAS,CACzD,MAAMqyB,EAAkBP,EAAK,UAAU,MAAQ9xB,EACzCsyB,EAAyBR,EAAK,UAAU,aAAe9xB,EACvDuyB,EAAaT,EAAK,UAAU,MAAQ9xB,EACpCC,EAAQ8qB,EAAU,iBAAiBwH,CAAU,EAAIvH,EAAU,iBAAiBqH,CAAe,EAAIrH,EAAU,iBAAiBsH,CAAsB,EAClJryB,EAAQF,IACRA,EAAYE,EACZH,EAAYE,EAEpB,CACA,OAAO8xB,EAAK,MAAMhyB,CAAS,CAC/B,CACA,SAAS0yB,GAAmBzH,EAAWC,EAAW1B,EAAe,CAC7D,MAAM/iC,EAAS,CAAA,EACf,UAAWkU,KAAK6uB,EAAe,CAC3B,MAAMn7B,EAAO5H,EAAOA,EAAO,OAAS,CAAC,EACrC,GAAI,CAAC4H,EAAM,CACP5H,EAAO,KAAKkU,CAAC,EACb,QACJ,CACIA,EAAE,UAAU,MAAQtM,EAAK,UAAU,cAAgB,GAAKsM,EAAE,UAAU,MAAQtM,EAAK,UAAU,cAAgB,EAC3G5H,EAAOA,EAAO,OAAS,CAAC,EAAI,IAAI6iC,EAAaj7B,EAAK,UAAU,KAAKsM,EAAE,SAAS,EAAGtM,EAAK,UAAU,KAAKsM,EAAE,SAAS,CAAC,EAG/GlU,EAAO,KAAKkU,CAAC,CAErB,CACA,OAAOlU,CACX,CACA,SAASksC,GAAqC1H,EAAWC,EAAW1B,EAAeoJ,EAAYC,EAAQ,GAAO,CAC1G,MAAMC,EAAgBxJ,EAAa,OAAOE,EAAeyB,EAAU,MAAM,EACnE8H,EAAa,CAAA,EACnB,IAAIC,EAAY,IAAItJ,GAAW,EAAG,CAAC,EACnC,SAASuJ,EAASC,EAAMC,EAAc,CAClC,GAAID,EAAK,QAAUF,EAAU,SAAWE,EAAK,QAAUF,EAAU,QAC7D,OAEJ,MAAMI,EAAKR,EAAW3H,EAAWiI,EAAK,OAAO,EACvCG,EAAKT,EAAW1H,EAAWgI,EAAK,OAAO,EAC7C,GAAI,CAACE,GAAM,CAACC,EACR,OAEJ,IAAIC,EAAI,IAAIhK,EAAa8J,EAAIC,CAAE,EAC/B,MAAME,EAAYD,EAAE,UAAUH,CAAY,EAC1C,IAAIK,EAAcD,EAAU,UAAU,OAClCE,EAAcF,EAAU,UAAU,OAGtC,KAAOT,EAAc,OAAS,GAAG,CAC7B,MAAM5oC,EAAO4oC,EAAc,CAAC,EAE5B,GAAI,EADe5oC,EAAK,UAAU,WAAWopC,EAAE,SAAS,GAAKppC,EAAK,UAAU,WAAWopC,EAAE,SAAS,GAE9F,MAEJ,MAAMI,EAAKd,EAAW3H,EAAW/gC,EAAK,UAAU,KAAK,EAC/CypC,EAAKf,EAAW1H,EAAWhhC,EAAK,UAAU,KAAK,EAE/CoF,EAAI,IAAIg6B,EAAaoK,EAAIC,CAAE,EAC3BJ,EAAYjkC,EAAE,UAAUpF,CAAI,EAIlC,GAHAspC,GAAeD,EAAU,UAAU,OACnCE,GAAeF,EAAU,UAAU,OACnCD,EAAIA,EAAE,KAAKhkC,CAAC,EACRgkC,EAAE,UAAU,cAAgBppC,EAAK,UAAU,aAE3C4oC,EAAc,MAAK,MAGnB,MAER,EACKD,GAASW,EAAcC,EAAcH,EAAE,UAAU,OAASA,EAAE,UAAU,QAAWE,EAAcC,GAAeH,EAAE,UAAU,OAASA,EAAE,UAAU,QAAU,EAAI,IAC9JP,EAAW,KAAKO,CAAC,EAErBN,EAAYM,EAAE,iBAAgB,CAClC,CACA,KAAOR,EAAc,OAAS,GAAG,CAC7B,MAAM5oC,EAAO4oC,EAAc,MAAK,EAC5B5oC,EAAK,UAAU,UAGnB+oC,EAAS/oC,EAAK,UAAS,EAAIA,CAAI,EAE/B+oC,EAAS/oC,EAAK,iBAAgB,EAAG,MAAM,EAAE,EAAGA,CAAI,EACpD,CAEA,OADe0pC,GAAmBpK,EAAeuJ,CAAU,CAE/D,CACA,SAASa,GAAmBC,EAAgBC,EAAgB,CACxD,MAAMrtC,EAAS,CAAA,EACf,KAAOotC,EAAe,OAAS,GAAKC,EAAe,OAAS,GAAG,CAC3D,MAAMC,EAAMF,EAAe,CAAC,EACtBG,EAAMF,EAAe,CAAC,EAC5B,IAAI5pC,EACA6pC,IAAQ,CAACC,GAAOD,EAAI,UAAU,MAAQC,EAAI,UAAU,OACpD9pC,EAAO2pC,EAAe,MAAK,EAG3B3pC,EAAO4pC,EAAe,MAAK,EAE3BrtC,EAAO,OAAS,GAAKA,EAAOA,EAAO,OAAS,CAAC,EAAE,UAAU,cAAgByD,EAAK,UAAU,MACxFzD,EAAOA,EAAO,OAAS,CAAC,EAAIA,EAAOA,EAAO,OAAS,CAAC,EAAE,KAAKyD,CAAI,EAG/DzD,EAAO,KAAKyD,CAAI,CAExB,CACA,OAAOzD,CACX,CACA,SAASwtC,GAAyChJ,EAAWiJ,EAAY1K,EAAe,CACpF,IAAID,EAAQC,EACZ,GAAID,EAAM,SAAW,EACjB,OAAOA,EAEX,IAAIqB,EAAU,EACVuJ,EACJ,EAAG,CACCA,EAAe,GACf,MAAM1tC,EAAS,CACX8iC,EAAM,CAAC,CACnB,EACQ,QAASniC,EAAI,EAAGA,EAAImiC,EAAM,OAAQniC,IAAK,CAGnC,IAASgtC,EAAT,SAAyBC,EAAQC,EAAO,CACpC,MAAMC,EAAiB,IAAItV,EAAYuV,EAAW,UAAU,aAActmC,EAAI,UAAU,KAAK,EAG7F,OAFsB+8B,EAAU,QAAQsJ,CAAc,EACT,QAAQ,MAAO,EAAE,EACnC,QAAU,IAC7BF,EAAO,UAAU,OAASA,EAAO,UAAU,OAAS,GAAKC,EAAM,UAAU,OAASA,EAAM,UAAU,OAAS,EAIvH,EAXA,MAAMpmC,EAAMq7B,EAAMniC,CAAC,EACbotC,EAAa/tC,EAAOA,EAAO,OAAS,CAAC,EAWxB2tC,EAAgBI,EAAYtmC,CAAG,GAE9CimC,EAAe,GACf1tC,EAAOA,EAAO,OAAS,CAAC,EAAIA,EAAOA,EAAO,OAAS,CAAC,EAAE,KAAKyH,CAAG,GAG9DzH,EAAO,KAAKyH,CAAG,CAEvB,CACAq7B,EAAQ9iC,CACZ,OAASmkC,IAAY,IAAMuJ,GAC3B,OAAO5K,CACX,CACA,SAASkL,GAA4CxJ,EAAWC,EAAW1B,EAAe,CACtF,IAAID,EAAQC,EACZ,GAAID,EAAM,SAAW,EACjB,OAAOA,EAEX,IAAIqB,EAAU,EACVuJ,EACJ,EAAG,CACCA,EAAe,GACf,MAAM1tC,EAAS,CACX8iC,EAAM,CAAC,CACnB,EACQ,QAASniC,EAAI,EAAGA,EAAImiC,EAAM,OAAQniC,IAAK,CAGnC,IAASgtC,EAAT,SAAyBC,EAAQC,EAAO,CACpC,MAAMC,EAAiB,IAAItV,EAAYuV,EAAW,UAAU,aAActmC,EAAI,UAAU,KAAK,EAE7F,GAD2B+8B,EAAU,aAAasJ,CAAc,EACvC,GAAKA,EAAe,OAAS,IAClD,MAAO,GAEX,MAAMG,EAAgBzJ,EAAU,QAAQsJ,CAAc,EAAE,KAAI,EAC5D,GAAIG,EAAc,OAAS,IAAMA,EAAc,MAAM,YAAY,EAAE,OAAS,EACxE,MAAO,GAEX,MAAMC,EAAmB1J,EAAU,aAAaoJ,EAAO,SAAS,EAC1DO,EAAmBP,EAAO,UAAU,OACpCQ,EAAmB3J,EAAU,aAAamJ,EAAO,SAAS,EAC1DS,EAAmBT,EAAO,UAAU,OACpCU,EAAkB9J,EAAU,aAAaqJ,EAAM,SAAS,EACxDU,EAAkBV,EAAM,UAAU,OAClCW,EAAkB/J,EAAU,aAAaoJ,EAAM,SAAS,EACxDY,EAAkBZ,EAAM,UAAU,OAElCa,EAAM,IACZ,SAASC,EAAI9lC,EAAG,CACZ,OAAO,KAAK,IAAIA,EAAG6lC,CAAG,CAC1B,CACA,OAAI,KAAK,IAAI,KAAK,IAAIC,EAAIT,EAAmB,GAAKC,CAAgB,EAAG,GAAG,EAAI,KAAK,IAAIQ,EAAIP,EAAmB,GAAKC,CAAgB,EAAG,GAAG,EAAG,GAAG,EACvI,KAAK,IAAI,KAAK,IAAIM,EAAIL,EAAkB,GAAKC,CAAe,EAAG,GAAG,EAAI,KAAK,IAAII,EAAIH,EAAkB,GAAKC,CAAe,EAAG,GAAG,EAAG,GAAG,GAAMC,GAAO,MAAQ,IAAO,GAI3K,EA9BA,MAAMjnC,EAAMq7B,EAAMniC,CAAC,EACbotC,EAAa/tC,EAAOA,EAAO,OAAS,CAAC,EA8BxB2tC,EAAgBI,EAAYtmC,CAAG,GAE9CimC,EAAe,GACf1tC,EAAOA,EAAO,OAAS,CAAC,EAAIA,EAAOA,EAAO,OAAS,CAAC,EAAE,KAAKyH,CAAG,GAG9DzH,EAAO,KAAKyH,CAAG,CAEvB,CACAq7B,EAAQ9iC,CACZ,OAASmkC,IAAY,IAAMuJ,GAC3B,MAAMkB,EAAW,CAAA,EAEjB,OAAAtX,GAAqBwL,EAAO,CAAC2D,EAAMh/B,EAAKhE,IAAS,CAC7C,IAAIorC,EAAUpnC,EACd,SAASqnC,EAAoB7tB,EAAM,CAC/B,OAAOA,EAAK,OAAS,GAAKA,EAAK,KAAI,EAAG,QAAU,GAAKxZ,EAAI,UAAU,OAASA,EAAI,UAAU,OAAS,GACvG,CACA,MAAMsnC,EAAavK,EAAU,kBAAkB/8B,EAAI,SAAS,EACtDunC,EAASxK,EAAU,QAAQ,IAAIhM,EAAYuW,EAAW,MAAOtnC,EAAI,UAAU,KAAK,CAAC,EACnFqnC,EAAoBE,CAAM,IAC1BH,EAAUA,EAAQ,WAAW,CAACG,EAAO,MAAM,GAE/C,MAAM3mB,EAASmc,EAAU,QAAQ,IAAIhM,EAAY/wB,EAAI,UAAU,aAAcsnC,EAAW,YAAY,CAAC,EACjGD,EAAoBzmB,CAAM,IAC1BwmB,EAAUA,EAAQ,SAASxmB,EAAO,MAAM,GAE5C,MAAM4mB,EAAiBpM,EAAa,gBAAgB4D,EAAOA,EAAK,iBAAgB,EAAKxD,GAAW,KAAMx/B,EAAOA,EAAK,UAAS,EAAKw/B,GAAW,GAAG,EACxIjjC,EAAS6uC,EAAQ,UAAUI,CAAc,EAC3CL,EAAS,OAAS,GAAK5uC,EAAO,UAAS,EAAG,OAAO4uC,EAASA,EAAS,OAAS,CAAC,EAAE,iBAAgB,CAAE,EACjGA,EAASA,EAAS,OAAS,CAAC,EAAIA,EAASA,EAAS,OAAS,CAAC,EAAE,KAAK5uC,CAAM,EAGzE4uC,EAAS,KAAK5uC,CAAM,CAE5B,CAAC,EACM4uC,CACX,CC/WA,MAAMrN,EAAa,CACf,YAAY2N,EAAarT,EAAO,CAC5B,KAAK,YAAcqT,EACnB,KAAK,MAAQrT,CACjB,CACA,WAAW7rB,EAAQ,CACf,OAAO,KAAK,YAAYA,CAAM,CAClC,CACA,IAAI,QAAS,CACT,OAAO,KAAK,YAAY,MAC5B,CACA,iBAAiBjN,EAAQ,CACrB,MAAMosC,EAAoBpsC,IAAW,EAAI,EAAIqsC,GAAe,KAAK,MAAMrsC,EAAS,CAAC,CAAC,EAC5EssC,EAAmBtsC,IAAW,KAAK,MAAM,OAAS,EAAIqsC,GAAe,KAAK,MAAMrsC,CAAM,CAAC,EAC7F,MAAO,MAAQosC,EAAoBE,EACvC,CACA,QAAQ1yB,EAAO,CACX,OAAO,KAAK,MAAM,MAAMA,EAAM,MAAOA,EAAM,YAAY,EAAE,KAAK;AAAA,CAAI,CACtE,CACA,gBAAgB0mB,EAASC,EAAS,CAC9B,OAAO,KAAK,MAAMD,CAAO,IAAM,KAAK,MAAMC,CAAO,CACrD,CACJ,CACA,SAAS8L,GAAeruC,EAAK,CACzB,IAAIJ,EAAI,EACR,KAAOA,EAAII,EAAI,SAAWA,EAAI,WAAWJ,CAAC,IAAM,IAA2BI,EAAI,WAAWJ,CAAC,IAAM,IAC7FA,IAEJ,OAAOA,CACX,CCbA,MAAM2uC,EAAyB,CAC3B,aAAc,CACV,KAAK,0BAA4B,IAAI/K,GACrC,KAAK,sBAAwB,IAAIiB,EACrC,CACA,YAAYvH,EAAeC,EAAer3B,EAAS,CAC/C,GAAIo3B,EAAc,QAAU,GAAKn2B,GAAOm2B,EAAeC,EAAe,CAACt9B,EAAGC,IAAMD,IAAMC,CAAC,EACnF,OAAO,IAAI61B,GAAU,GAAI,CAAA,EAAI,EAAK,EAEtC,GAAIuH,EAAc,SAAW,GAAKA,EAAc,CAAC,EAAE,SAAW,GAAKC,EAAc,SAAW,GAAKA,EAAc,CAAC,EAAE,SAAW,EACzH,OAAO,IAAIxH,GAAU,CACjB,IAAIiH,GAAyB,IAAIhE,EAAU,EAAGsE,EAAc,OAAS,CAAC,EAAG,IAAItE,EAAU,EAAGuE,EAAc,OAAS,CAAC,EAAG,CACjH,IAAIX,GAAa,IAAIjhB,EAAM,EAAG,EAAG2hB,EAAc,OAAQA,EAAcA,EAAc,OAAS,CAAC,EAAE,OAAS,CAAC,EAAG,IAAI3hB,EAAM,EAAG,EAAG4hB,EAAc,OAAQA,EAAcA,EAAc,OAAS,CAAC,EAAE,OAAS,CAAC,CAAC,CACzN,CAAiB,CACjB,EAAe,CAAA,EAAI,EAAK,EAEhB,MAAMwF,EAAU78B,EAAQ,uBAAyB,EAAI28B,GAAgB,SAAW,IAAIC,GAAY58B,EAAQ,oBAAoB,EACtH8/B,EAA4B,CAAC9/B,EAAQ,qBACrC0oC,EAAgB,IAAI,IAC1B,SAASC,EAAgBvuB,EAAM,CAC3B,IAAIwuB,EAAOF,EAAc,IAAItuB,CAAI,EACjC,OAAIwuB,IAAS,SACTA,EAAOF,EAAc,KACrBA,EAAc,IAAItuB,EAAMwuB,CAAI,GAEzBA,CACX,CACA,MAAMC,EAAsBzR,EAAc,IAAKntB,GAAM0+B,EAAgB1+B,EAAE,KAAI,CAAE,CAAC,EACxE6+B,EAAsBzR,EAAc,IAAKptB,GAAM0+B,EAAgB1+B,EAAE,KAAI,CAAE,CAAC,EACxE0zB,EAAY,IAAIjD,GAAamO,EAAqBzR,CAAa,EAC/DwG,EAAY,IAAIlD,GAAaoO,EAAqBzR,CAAa,EAC/D0R,EACEpL,EAAU,OAASC,EAAU,OAAS,KAE/B,KAAK,0BAA0B,QAAQD,EAAWC,EAAWf,EAAS,CAACL,EAASC,IAAYrF,EAAcoF,CAAO,IAAMnF,EAAcoF,CAAO,EAC7IpF,EAAcoF,CAAO,EAAE,SAAW,EAC9B,GACA,EAAI,KAAK,IAAI,EAAIpF,EAAcoF,CAAO,EAAE,MAAM,EAClD,GAAI,EAEP,KAAK,sBAAsB,QAAQkB,EAAWC,EAAWf,CAAO,EAE3E,IAAImM,EAAiBD,EAAoB,MACrChZ,EAAagZ,EAAoB,WACrCC,EAAiB7E,GAAsBxG,EAAWC,EAAWoL,CAAc,EAC3EA,EAAiBrC,GAAyChJ,EAAWC,EAAWoL,CAAc,EAC9F,MAAM7R,EAAa,CAAA,EACb8R,EAA4BC,GAAoB,CAClD,GAAKpJ,EAGL,QAAShmC,EAAI,EAAGA,EAAIovC,EAAiBpvC,IAAK,CACtC,MAAMqrC,EAAagE,EAAgBrvC,EAC7BsvC,EAAaC,EAAgBvvC,EACnC,GAAIs9B,EAAc+N,CAAU,IAAM9N,EAAc+R,CAAU,EAAG,CAEzD,MAAME,EAAiB,KAAK,WAAWlS,EAAeC,EAAe,IAAI2E,EAAa,IAAIrK,EAAYwT,EAAYA,EAAa,CAAC,EAAG,IAAIxT,EAAYyX,EAAYA,EAAa,CAAC,CAAC,EAAGvM,EAASiD,EAA2B9/B,CAAO,EAC5N,UAAWjG,KAAKuvC,EAAe,SAC3BnS,EAAW,KAAKp9B,CAAC,EAEjBuvC,EAAe,aACfvZ,EAAa,GAErB,CACJ,CACJ,EACA,IAAIoZ,EAAgB,EAChBE,EAAgB,EACpB,UAAW3E,KAAQsE,EAAgB,CAC/BtvC,GAAS,IAAMgrC,EAAK,UAAU,MAAQyE,IAAkBzE,EAAK,UAAU,MAAQ2E,CAAa,EAC5F,MAAMH,EAAkBxE,EAAK,UAAU,MAAQyE,EAC/CF,EAAyBC,CAAe,EACxCC,EAAgBzE,EAAK,UAAU,aAC/B2E,EAAgB3E,EAAK,UAAU,aAC/B,MAAM4E,EAAiB,KAAK,WAAWlS,EAAeC,EAAeqN,EAAM7H,EAASiD,EAA2B9/B,CAAO,EAClHspC,EAAe,aACfvZ,EAAa,IAEjB,UAAWh2B,KAAKuvC,EAAe,SAC3BnS,EAAW,KAAKp9B,CAAC,CAEzB,CACAkvC,EAAyB7R,EAAc,OAAS+R,CAAa,EAC7D,MAAMx7B,EAAW,IAAIonB,GAAUqC,CAAa,EACtCxpB,EAAW,IAAImnB,GAAUsC,CAAa,EACtCznB,EAAUsnB,GAAkCC,EAAYxpB,EAAUC,CAAQ,EAChF,IAAIkiB,EAAQ,CAAA,EACZ,OAAI9vB,EAAQ,eACR8vB,EAAQ,KAAK,aAAalgB,EAASwnB,EAAeC,EAAewR,EAAqBC,EAAqBjM,EAASiD,EAA2B9/B,CAAO,GAG1JtG,GAAS,IAAM,CACX,SAAS6vC,EAAiBh0B,EAAKyf,EAAO,CAClC,GAAIzf,EAAI,WAAa,GAAKA,EAAI,WAAayf,EAAM,OAC7C,MAAO,GAEX,MAAMnc,EAAOmc,EAAMzf,EAAI,WAAa,CAAC,EACrC,MAAI,EAAAA,EAAI,OAAS,GAAKA,EAAI,OAASsD,EAAK,OAAS,EAIrD,CACA,SAAS2wB,EAAc1zB,EAAOkf,EAAO,CAIjC,MAHI,EAAAlf,EAAM,gBAAkB,GAAKA,EAAM,gBAAkBkf,EAAM,OAAS,GAGpElf,EAAM,uBAAyB,GAAKA,EAAM,uBAAyBkf,EAAM,OAAS,EAI1F,CACA,UAAWnB,KAAKjkB,EAAS,CACrB,GAAI,CAACikB,EAAE,aACH,MAAO,GAEX,UAAW4V,KAAM5V,EAAE,aAGf,GAAI,EAFU0V,EAAiBE,EAAG,cAAc,iBAAgB,EAAIpS,CAAa,GAAKkS,EAAiBE,EAAG,cAAc,eAAc,EAAIpS,CAAa,GACnJkS,EAAiBE,EAAG,cAAc,iBAAgB,EAAIrS,CAAa,GAAKmS,EAAiBE,EAAG,cAAc,eAAc,EAAIrS,CAAa,GAEzI,MAAO,GAGf,GAAI,CAACoS,EAAc3V,EAAE,SAAUwD,CAAa,GAAK,CAACmS,EAAc3V,EAAE,SAAUuD,CAAa,EACrF,MAAO,EAEf,CACA,MAAO,EACX,CAAC,EACM,IAAIvH,GAAUjgB,EAASkgB,EAAOC,CAAU,CACnD,CACA,aAAangB,EAASwnB,EAAeC,EAAeyJ,EAAqBC,EAAqBlE,EAASiD,EAA2B9/B,EAAS,CAOvI,OANc6gC,GAAkBjxB,EAASwnB,EAAeC,EAAeyJ,EAAqBC,EAAqBlE,CAAO,EAC3F,IAAInQ,GAAK,CAClC,MAAMgd,EAAc,KAAK,WAAWtS,EAAeC,EAAe,IAAI2E,EAAatP,EAAE,SAAS,cAAa,EAAIA,EAAE,SAAS,cAAa,CAAE,EAAGmQ,EAASiD,EAA2B9/B,CAAO,EACjL4b,EAAWsb,GAAkCwS,EAAY,SAAU,IAAI3U,GAAUqC,CAAa,EAAG,IAAIrC,GAAUsC,CAAa,EAAG,EAAI,EACzI,OAAO,IAAIrH,GAAUtD,EAAG9Q,CAAQ,CACpC,CAAC,CAEL,CACA,WAAWwb,EAAeC,EAAeqN,EAAM7H,EAASiD,EAA2B9/B,EAAS,CAExF,MAAM63B,EADmB8R,GAAmBjF,CAAI,EACV,gBAAgBtN,EAAeC,CAAa,EAC5EuS,EAAS,IAAI/J,GAAuBzI,EAAeS,EAAa,cAAeiI,CAAyB,EACxG+J,EAAS,IAAIhK,GAAuBxI,EAAeQ,EAAa,cAAeiI,CAAyB,EACxGlF,EAAagP,EAAO,OAASC,EAAO,OAAS,IAC7C,KAAK,0BAA0B,QAAQD,EAAQC,EAAQhN,CAAO,EAC9D,KAAK,sBAAsB,QAAQ+M,EAAQC,EAAQhN,CAAO,EAChE,IAAIZ,EAAQrB,EAAW,MACvB,OAAAqB,EAAQkI,GAAsByF,EAAQC,EAAQ5N,CAAK,EACnDA,EAAQoJ,GAAqCuE,EAAQC,EAAQ5N,EAAO,CAAChxB,EAAK0P,IAAQ1P,EAAI,mBAAmB0P,CAAG,CAAC,EACzG3a,EAAQ,mBACRi8B,EAAQoJ,GAAqCuE,EAAQC,EAAQ5N,EAAO,CAAChxB,EAAK0P,IAAQ1P,EAAI,sBAAsB0P,CAAG,EAAG,EAAI,GAE1HshB,EAAQmJ,GAAmBwE,EAAQC,EAAQ5N,CAAK,EAChDA,EAAQkL,GAA4CyC,EAAQC,EAAQ5N,CAAK,EAGlE,CACH,SAHWA,EAAM,IAAK,GAAM,IAAIvF,GAAakT,EAAO,eAAe,EAAE,SAAS,EAAGC,EAAO,eAAe,EAAE,SAAS,CAAC,CAAC,EAIpH,WAAYjP,EAAW,UACnC,CACI,CACJ,CACA,SAAS+O,GAAmBG,EAAc,CACtC,OAAO,IAAI7T,GAAiB,IAAInD,EAAUgX,EAAa,UAAU,MAAQ,EAAGA,EAAa,UAAU,aAAe,CAAC,EAAG,IAAIhX,EAAUgX,EAAa,UAAU,MAAQ,EAAGA,EAAa,UAAU,aAAe,CAAC,CAAC,CAClN,CClLA,MAAMC,GAAqB,CACvB,UAAW,IAAM,IAAI5R,GACrB,WAAY,IAAM,IAAIsQ,EAC1B,ECNA,SAASuB,GAAWC,EAAQC,EAAe,CACvC,MAAMC,EAAU,KAAK,IAAI,GAAID,CAAa,EAC1C,OAAO,KAAK,MAAMD,EAASE,CAAO,EAAIA,CAC1C,CACA,MAAMC,CAAK,CACP,YAAYp+B,EAAGurB,EAAGv9B,EAAGD,EAAI,EAAG,CACxB,KAAK,WAAa,OAClB,KAAK,EAAI,KAAK,IAAI,IAAK,KAAK,IAAI,EAAGiS,CAAC,CAAC,EAAI,EACzC,KAAK,EAAI,KAAK,IAAI,IAAK,KAAK,IAAI,EAAGurB,CAAC,CAAC,EAAI,EACzC,KAAK,EAAI,KAAK,IAAI,IAAK,KAAK,IAAI,EAAGv9B,CAAC,CAAC,EAAI,EACzC,KAAK,EAAIgwC,GAAW,KAAK,IAAI,KAAK,IAAI,EAAGjwC,CAAC,EAAG,CAAC,EAAG,CAAC,CACtD,CACA,OAAO,OAAOA,EAAGC,EAAG,CAChB,OAAOD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,CAClE,CACJ,CACA,MAAMqwC,EAAK,CACP,YAAYC,EAAGj9B,EAAGpD,EAAGlQ,EAAG,CACpB,KAAK,WAAa,OAClB,KAAK,EAAI,KAAK,IAAI,KAAK,IAAI,IAAKuwC,CAAC,EAAG,CAAC,EAAI,EACzC,KAAK,EAAIN,GAAW,KAAK,IAAI,KAAK,IAAI,EAAG38B,CAAC,EAAG,CAAC,EAAG,CAAC,EAClD,KAAK,EAAI28B,GAAW,KAAK,IAAI,KAAK,IAAI,EAAG//B,CAAC,EAAG,CAAC,EAAG,CAAC,EAClD,KAAK,EAAI+/B,GAAW,KAAK,IAAI,KAAK,IAAI,EAAGjwC,CAAC,EAAG,CAAC,EAAG,CAAC,CACtD,CACA,OAAO,OAAOA,EAAGC,EAAG,CAChB,OAAOD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,CAClE,CAOA,OAAO,SAASuwC,EAAM,CAClB,MAAMv+B,EAAIu+B,EAAK,EAAI,IACbhT,EAAIgT,EAAK,EAAI,IACbvwC,EAAIuwC,EAAK,EAAI,IACbxwC,EAAIwwC,EAAK,EACT1C,EAAM,KAAK,IAAI77B,EAAGurB,EAAGv9B,CAAC,EACtBwwC,EAAM,KAAK,IAAIx+B,EAAGurB,EAAGv9B,CAAC,EAC5B,IAAIswC,EAAI,EACJj9B,EAAI,EACR,MAAMpD,GAAKugC,EAAM3C,GAAO,EAClB4C,EAAS5C,EAAM2C,EACrB,GAAIC,EAAS,EAAG,CAEZ,OADAp9B,EAAI,KAAK,IAAKpD,GAAK,GAAMwgC,GAAU,EAAIxgC,GAAKwgC,GAAU,EAAK,EAAIxgC,GAAM,CAAC,EAC9D49B,EAAG,CACP,KAAK77B,EACDs+B,GAAK/S,EAAIv9B,GAAKywC,GAAUlT,EAAIv9B,EAAI,EAAI,GACpC,MACJ,KAAKu9B,EACD+S,GAAKtwC,EAAIgS,GAAKy+B,EAAS,EACvB,MACJ,KAAKzwC,EACDswC,GAAKt+B,EAAIurB,GAAKkT,EAAS,EACvB,KACpB,CACYH,GAAK,GACLA,EAAI,KAAK,MAAMA,CAAC,CACpB,CACA,OAAO,IAAID,GAAKC,EAAGj9B,EAAGpD,EAAGlQ,CAAC,CAC9B,CACA,OAAO,SAAS2wC,EAAGC,EAAGp3B,EAAG,CAOrB,OANIA,EAAI,IACJA,GAAK,GAELA,EAAI,IACJA,GAAK,GAELA,EAAI,EAAI,EACDm3B,GAAKC,EAAID,GAAK,EAAIn3B,EAEzBA,EAAI,EAAI,EACDo3B,EAEPp3B,EAAI,EAAI,EACDm3B,GAAKC,EAAID,IAAM,EAAI,EAAIn3B,GAAK,EAEhCm3B,CACX,CAOA,OAAO,OAAOE,EAAM,CAChB,MAAMN,EAAIM,EAAK,EAAI,IACb,CAAE,EAAAv9B,EAAG,EAAApD,EAAG,EAAAlQ,CAAC,EAAK6wC,EACpB,IAAI5+B,EAAGurB,EAAGv9B,EACV,GAAIqT,IAAM,EACNrB,EAAIurB,EAAIv9B,EAAIiQ,MAEX,CACD,MAAM0gC,EAAI1gC,EAAI,GAAMA,GAAK,EAAIoD,GAAKpD,EAAIoD,EAAIpD,EAAIoD,EACxCq9B,EAAI,EAAIzgC,EAAI0gC,EAClB3+B,EAAIq+B,GAAK,SAASK,EAAGC,EAAGL,EAAI,EAAI,CAAC,EACjC/S,EAAI8S,GAAK,SAASK,EAAGC,EAAGL,CAAC,EACzBtwC,EAAIqwC,GAAK,SAASK,EAAGC,EAAGL,EAAI,EAAI,CAAC,CACrC,CACA,OAAO,IAAIF,EAAK,KAAK,MAAMp+B,EAAI,GAAG,EAAG,KAAK,MAAMurB,EAAI,GAAG,EAAG,KAAK,MAAMv9B,EAAI,GAAG,EAAGD,CAAC,CACpF,CACJ,CACA,MAAM8wC,EAAK,CACP,YAAYP,EAAGj9B,EAAGrL,EAAGjI,EAAG,CACpB,KAAK,WAAa,OAClB,KAAK,EAAI,KAAK,IAAI,KAAK,IAAI,IAAKuwC,CAAC,EAAG,CAAC,EAAI,EACzC,KAAK,EAAIN,GAAW,KAAK,IAAI,KAAK,IAAI,EAAG38B,CAAC,EAAG,CAAC,EAAG,CAAC,EAClD,KAAK,EAAI28B,GAAW,KAAK,IAAI,KAAK,IAAI,EAAGhoC,CAAC,EAAG,CAAC,EAAG,CAAC,EAClD,KAAK,EAAIgoC,GAAW,KAAK,IAAI,KAAK,IAAI,EAAGjwC,CAAC,EAAG,CAAC,EAAG,CAAC,CACtD,CACA,OAAO,OAAOA,EAAGC,EAAG,CAChB,OAAOD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,GAAKD,EAAE,IAAMC,EAAE,CAClE,CAEA,OAAO,SAASuwC,EAAM,CAClB,MAAMv+B,EAAIu+B,EAAK,EAAI,IACbhT,EAAIgT,EAAK,EAAI,IACbvwC,EAAIuwC,EAAK,EAAI,IACbO,EAAO,KAAK,IAAI9+B,EAAGurB,EAAGv9B,CAAC,EACvB+wC,EAAO,KAAK,IAAI/+B,EAAGurB,EAAGv9B,CAAC,EACvB4Y,EAAQk4B,EAAOC,EACf19B,EAAIy9B,IAAS,EAAI,EAAKl4B,EAAQk4B,EACpC,IAAIpe,EACJ,OAAI9Z,IAAU,EACV8Z,EAAI,EAECoe,IAAS9+B,EACd0gB,IAAQ6K,EAAIv9B,GAAK4Y,EAAS,EAAK,GAAK,EAE/Bk4B,IAASvT,EACd7K,GAAM1yB,EAAIgS,GAAK4G,EAAS,EAGxB8Z,GAAM1gB,EAAIurB,GAAK3kB,EAAS,EAErB,IAAIi4B,GAAK,KAAK,MAAMne,EAAI,EAAE,EAAGrf,EAAGy9B,EAAMP,EAAK,CAAC,CACvD,CAEA,OAAO,OAAOS,EAAM,CAChB,KAAM,CAAE,EAAAV,EAAG,EAAAj9B,EAAG,EAAArL,EAAG,EAAAjI,CAAC,EAAKixC,EACjBnX,EAAI7xB,EAAIqL,EACR4vB,EAAIpJ,GAAK,EAAI,KAAK,IAAKyW,EAAI,GAAM,EAAI,CAAC,GACtC5d,EAAI1qB,EAAI6xB,EACd,GAAI,CAAC7nB,EAAGurB,EAAGv9B,CAAC,EAAI,CAAC,EAAG,EAAG,CAAC,EACxB,OAAIswC,EAAI,IACJt+B,EAAI6nB,EACJ0D,EAAI0F,GAECqN,EAAI,KACTt+B,EAAIixB,EACJ1F,EAAI1D,GAECyW,EAAI,KACT/S,EAAI1D,EACJ75B,EAAIijC,GAECqN,EAAI,KACT/S,EAAI0F,EACJjjC,EAAI65B,GAECyW,EAAI,KACTt+B,EAAIixB,EACJjjC,EAAI65B,GAECyW,GAAK,MACVt+B,EAAI6nB,EACJ75B,EAAIijC,GAERjxB,EAAI,KAAK,OAAOA,EAAI0gB,GAAK,GAAG,EAC5B6K,EAAI,KAAK,OAAOA,EAAI7K,GAAK,GAAG,EAC5B1yB,EAAI,KAAK,OAAOA,EAAI0yB,GAAK,GAAG,EACrB,IAAI0d,EAAKp+B,EAAGurB,EAAGv9B,EAAGD,CAAC,CAC9B,CACJ,CACA,IAAAkxC,IAAAC,EAAA,KAAY,CACR,OAAO,QAAQC,EAAK,CAChB,OAAOD,EAAM,OAAO,IAAI,SAASC,CAAG,GAAKD,EAAM,GACnD,CACA,OAAO,OAAOnxC,EAAGC,EAAG,CAChB,MAAI,CAACD,GAAK,CAACC,EACA,GAEP,CAACD,GAAK,CAACC,EACA,GAEJD,EAAE,OAAOC,CAAC,CACrB,CACA,IAAI,MAAO,CACP,OAAI,KAAK,MACE,KAAK,MAGLqwC,GAAK,SAAS,KAAK,IAAI,CAEtC,CACA,IAAI,MAAO,CACP,OAAI,KAAK,MACE,KAAK,MAETQ,GAAK,SAAS,KAAK,IAAI,CAClC,CACA,YAAY1tC,EAAK,CACb,GAAKA,EAGA,GAAIA,aAAeitC,EACpB,KAAK,KAAOjtC,UAEPA,aAAektC,GACpB,KAAK,MAAQltC,EACb,KAAK,KAAOktC,GAAK,OAAOltC,CAAG,UAEtBA,aAAe0tC,GACpB,KAAK,MAAQ1tC,EACb,KAAK,KAAO0tC,GAAK,OAAO1tC,CAAG,MAG3B,OAAM,IAAI,MAAM,6BAA6B,MAd7C,OAAM,IAAI,MAAM,qBAAqB,CAgB7C,CACA,OAAO+X,EAAO,CACV,MAAO,CAAC,CAACA,GAASk1B,EAAK,OAAO,KAAK,KAAMl1B,EAAM,IAAI,GAAKm1B,GAAK,OAAO,KAAK,KAAMn1B,EAAM,IAAI,GAAK21B,GAAK,OAAO,KAAK,KAAM31B,EAAM,IAAI,CACnI,CAKA,sBAAuB,CACnB,MAAMk2B,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,EACrD,OAAOtB,GAAWuB,EAAW,CAAC,CAClC,CACA,OAAO,+BAA+BC,EAAO,CACzC,MAAM3X,EAAI2X,EAAQ,IAClB,OAAQ3X,GAAK,OAAWA,EAAI,MAAQ,KAAK,KAAMA,EAAI,MAAS,MAAQ,GAAG,CAC3E,CAKA,WAAY,CAER,OADa,KAAK,KAAK,EAAI,IAAM,KAAK,KAAK,EAAI,IAAM,KAAK,KAAK,EAAI,KAAO,KAC5D,GAClB,CACA,cAAc4X,EAAS,CACnB,MAAMC,EAAO,KAAK,qBAAoB,EAChCC,EAAOF,EAAQ,qBAAoB,EACzC,OAAOC,EAAOC,CAClB,CACA,aAAaF,EAAS,CAClB,MAAMC,EAAO,KAAK,qBAAoB,EAChCC,EAAOF,EAAQ,qBAAoB,EACzC,OAAOC,EAAOC,CAClB,CACA,QAAQC,EAAQ,CACZ,OAAO,IAAIV,EAAM,IAAIb,GAAK,KAAK,KAAK,EAAG,KAAK,KAAK,EAAG,KAAK,KAAK,EAAI,KAAK,KAAK,EAAIuB,EAAQ,KAAK,KAAK,CAAC,CAAC,CACxG,CACA,OAAOA,EAAQ,CACX,OAAO,IAAIV,EAAM,IAAIb,GAAK,KAAK,KAAK,EAAG,KAAK,KAAK,EAAG,KAAK,KAAK,EAAI,KAAK,KAAK,EAAIuB,EAAQ,KAAK,KAAK,CAAC,CAAC,CACxG,CACA,YAAYA,EAAQ,CAChB,KAAM,CAAE,EAAA5/B,EAAG,EAAAurB,EAAG,EAAAv9B,EAAG,EAAAD,CAAC,EAAK,KAAK,KAC5B,OAAO,IAAImxC,EAAM,IAAId,EAAKp+B,EAAGurB,EAAGv9B,EAAGD,EAAI6xC,CAAM,CAAC,CAClD,CACA,eAAgB,CACZ,OAAO,KAAK,KAAK,IAAM,CAC3B,CACA,UAAW,CACP,OAAO,KAAK,KAAK,IAAM,CAC3B,CACA,UAAW,CACP,OAAO,IAAIV,EAAM,IAAId,EAAK,IAAM,KAAK,KAAK,EAAG,IAAM,KAAK,KAAK,EAAG,IAAM,KAAK,KAAK,EAAG,KAAK,KAAK,CAAC,CAAC,CACnG,CAOA,IAAIoB,EAAOI,EAAS,GAAK,CACrB,MAAMC,EAAY,KAAK,IAAI,KAAK,IAAID,EAAQ,CAAC,EAAG,CAAC,EAC3CE,EAAW,KAAK,KAChBC,EAAYP,EAAM,KAClBx/B,EAAI8/B,EAAS,GAAKC,EAAU,EAAID,EAAS,GAAKD,EAC9CtU,EAAIuU,EAAS,GAAKC,EAAU,EAAID,EAAS,GAAKD,EAC9C7xC,EAAI8xC,EAAS,GAAKC,EAAU,EAAID,EAAS,GAAKD,EAC9C9xC,EAAI+xC,EAAS,GAAKC,EAAU,EAAID,EAAS,GAAKD,EACpD,OAAO,IAAIX,EAAM,IAAId,EAAKp+B,EAAGurB,EAAGv9B,EAAGD,CAAC,CAAC,CACzC,CACA,WAAWiyC,EAAkB,CACzB,GAAI,KAAK,SAAQ,GAAMA,EAAiB,KAAK,IAAM,EAE/C,OAAO,KAEX,KAAM,CAAE,EAAAhgC,EAAG,EAAAurB,EAAG,EAAAv9B,EAAG,EAAAD,CAAC,EAAK,KAAK,KAE5B,OAAO,IAAImxC,EAAM,IAAId,EAAK4B,EAAiB,KAAK,EAAIjyC,GAAKiyC,EAAiB,KAAK,EAAIhgC,GAAIggC,EAAiB,KAAK,EAAIjyC,GAAKiyC,EAAiB,KAAK,EAAIzU,GAAIyU,EAAiB,KAAK,EAAIjyC,GAAKiyC,EAAiB,KAAK,EAAIhyC,GAAI,CAAC,CAAC,CACvN,CACA,UAAW,CACP,OAAK,KAAK,YACN,KAAK,UAAYkxC,EAAM,OAAO,IAAI,OAAO,IAAI,GAE1C,KAAK,SAChB,CACA,eAAgB,CACZ,OAAK,KAAK,iBACN,KAAK,gBAAkB,KAAK,KAAK,GAAY,GACzC,KAAK,KAAK,GAAY,GACtB,KAAK,KAAK,GAAY,EACtB,KAAK,KAAK,EAAI,KAAQ,KAAO,GAE9B,KAAK,cAChB,CACA,OAAO,gBAAgBe,EAAIC,EAAUN,EAAQ,CACzC,GAAIK,EAAG,cAAcC,CAAQ,EACzB,OAAOD,EAEXL,EAASA,GAAkB,GAC3B,MAAMF,EAAOO,EAAG,qBAAoB,EAC9BN,EAAOO,EAAS,qBAAoB,EAC1C,OAAAN,EAASA,GAAUD,EAAOD,GAAQC,EAC3BM,EAAG,QAAQL,CAAM,CAC5B,CACA,OAAO,eAAeK,EAAIC,EAAUN,EAAQ,CACxC,GAAIK,EAAG,aAAaC,CAAQ,EACxB,OAAOD,EAEXL,EAASA,GAAkB,GAC3B,MAAMF,EAAOO,EAAG,qBAAoB,EAC9BN,EAAOO,EAAS,qBAAoB,EAC1C,OAAAN,EAASA,GAAUF,EAAOC,GAAQD,EAC3BO,EAAG,OAAOL,CAAM,CAC3B,CASJ,EARaV,EAAK,MAAQ,IAAIA,EAAM,IAAId,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACjDc,EAAK,MAAQ,IAAIA,EAAM,IAAId,EAAK,EAAG,EAAG,EAAG,CAAC,CAAC,EAC3Cc,EAAK,IAAM,IAAIA,EAAM,IAAId,EAAK,IAAK,EAAG,EAAG,CAAC,CAAC,EAC3Cc,EAAK,KAAO,IAAIA,EAAM,IAAId,EAAK,EAAG,EAAG,IAAK,CAAC,CAAC,EAC5Cc,EAAK,MAAQ,IAAIA,EAAM,IAAId,EAAK,EAAG,IAAK,EAAG,CAAC,CAAC,EAC7Cc,EAAK,KAAO,IAAIA,EAAM,IAAId,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EAC9Cc,EAAK,UAAY,IAAIA,EAAM,IAAId,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACrDc,EAAK,YAAc,IAAIA,EAAM,IAAId,EAAK,EAAG,EAAG,EAAG,CAAC,CAAC,EAxK9Dc,IA0KC,SAAUiB,EAAO,EACb,SAAUC,EAAQ,EACd,SAAUC,EAAK,CACZ,SAASC,EAAUd,EAAO,CACtB,OAAIA,EAAM,KAAK,IAAM,EACV,OAAOA,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,IAEzDW,EAAM,OAAO,IAAI,WAAWX,CAAK,CAC5C,CACAa,EAAI,UAAYC,EAChB,SAASC,EAAWf,EAAO,CACvB,MAAO,QAAQA,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,KAAKA,EAAM,KAAK,CAAC,KAAK,CAAEA,EAAM,KAAK,EAAG,QAAQ,CAAC,CAAC,GAChG,CACAa,EAAI,WAAaE,EACjB,SAASC,EAAUhB,EAAO,CACtB,OAAIA,EAAM,KAAK,IAAM,EACV,OAAOA,EAAM,KAAK,CAAC,KAAK,KAAK,MAAMA,EAAM,KAAK,EAAI,GAAG,CAAC,MAAM,KAAK,MAAMA,EAAM,KAAK,EAAI,GAAG,CAAC,KAE9FW,EAAM,OAAO,IAAI,WAAWX,CAAK,CAC5C,CACAa,EAAI,UAAYG,EAChB,SAASC,EAAWjB,EAAO,CACvB,MAAO,QAAQA,EAAM,KAAK,CAAC,KAAK,KAAK,MAAMA,EAAM,KAAK,EAAI,GAAG,CAAC,MAAM,KAAK,MAAMA,EAAM,KAAK,EAAI,GAAG,CAAC,MAAMA,EAAM,KAAK,EAAE,QAAQ,CAAC,CAAC,GACnI,CACAa,EAAI,WAAaI,EACjB,SAASC,EAAeznC,EAAG,CACvB,MAAM+G,EAAI/G,EAAE,SAAS,EAAE,EACvB,OAAO+G,EAAE,SAAW,EAAI,IAAMA,EAAIA,CACtC,CAIA,SAAS2gC,EAAUnB,EAAO,CACtB,MAAO,IAAIkB,EAAelB,EAAM,KAAK,CAAC,CAAC,GAAGkB,EAAelB,EAAM,KAAK,CAAC,CAAC,GAAGkB,EAAelB,EAAM,KAAK,CAAC,CAAC,EACzG,CACAa,EAAI,UAAYM,EAKhB,SAASC,EAAWpB,EAAOqB,EAAU,GAAO,CACxC,OAAIA,GAAWrB,EAAM,KAAK,IAAM,EACrBW,EAAM,OAAO,IAAI,UAAUX,CAAK,EAEpC,IAAIkB,EAAelB,EAAM,KAAK,CAAC,CAAC,GAAGkB,EAAelB,EAAM,KAAK,CAAC,CAAC,GAAGkB,EAAelB,EAAM,KAAK,CAAC,CAAC,GAAGkB,EAAe,KAAK,MAAMlB,EAAM,KAAK,EAAI,GAAG,CAAC,CAAC,EAC1J,CACAa,EAAI,WAAaO,EAIjB,SAASE,EAAOtB,EAAO,CACnB,OAAIA,EAAM,WACCW,EAAM,OAAO,IAAI,UAAUX,CAAK,EAEpCW,EAAM,OAAO,IAAI,WAAWX,CAAK,CAC5C,CACAa,EAAI,OAASS,EAMb,SAASC,EAAMC,EAAK,CAChB,GAAIA,IAAQ,cACR,OAAOb,EAAM,YAEjB,GAAIa,EAAI,WAAW,GAAG,EAClB,OAAOC,EAASD,CAAG,EAEvB,GAAIA,EAAI,WAAW,OAAO,EAAG,CACzB,MAAMxB,EAAQwB,EAAI,MAAM,mGAAmG,EAC3H,GAAI,CAACxB,EACD,MAAM,IAAI,MAAM,wBAA0BwB,CAAG,EAEjD,MAAMhhC,EAAI,SAASw/B,EAAM,QAAQ,GAAK,GAAG,EACnCjU,EAAI,SAASiU,EAAM,QAAQ,GAAK,GAAG,EACnC,EAAI,SAASA,EAAM,QAAQ,GAAK,GAAG,EACnCzxC,EAAI,WAAWyxC,EAAM,QAAQ,GAAK,GAAG,EAC3C,OAAO,IAAIW,EAAM,IAAI/B,EAAKp+B,EAAGurB,EAAG,EAAGx9B,CAAC,CAAC,CACzC,CACA,GAAIizC,EAAI,WAAW,MAAM,EAAG,CACxB,MAAMxB,EAAQwB,EAAI,MAAM,qEAAqE,EAC7F,GAAI,CAACxB,EACD,MAAM,IAAI,MAAM,wBAA0BwB,CAAG,EAEjD,MAAMhhC,EAAI,SAASw/B,EAAM,QAAQ,GAAK,GAAG,EACnCjU,EAAI,SAASiU,EAAM,QAAQ,GAAK,GAAG,EACnC,EAAI,SAASA,EAAM,QAAQ,GAAK,GAAG,EACzC,OAAO,IAAIW,EAAM,IAAI/B,EAAKp+B,EAAGurB,EAAG,CAAC,CAAC,CACtC,CAEA,OAAO2V,EAAkBF,CAAG,CAChC,CACAX,EAAI,MAAQU,EACZ,SAASG,EAAkBF,EAAK,CAE5B,OAAQA,EAAG,CACP,IAAK,YAAa,OAAO,IAAIb,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,eAAgB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAChE,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EACtD,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC9D,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACzD,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACzD,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC1D,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,EAAG,EAAG,CAAC,CAAC,EACnD,IAAK,iBAAkB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAClE,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,EAAG,IAAK,CAAC,CAAC,EACpD,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,IAAK,CAAC,CAAC,EAC7D,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,GAAI,CAAC,CAAC,EACvD,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,EAAG,CAAC,CAAC,EAC5D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EAC5D,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EACxD,IAAK,iBAAkB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAClE,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,GAAI,CAAC,CAAC,EACzD,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EACtD,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,EAAG,IAAK,CAAC,CAAC,EACxD,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EAC1D,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EAChE,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,EAAG,CAAC,CAAC,EACzD,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,EAAG,IAAK,CAAC,CAAC,EAC7D,IAAK,iBAAkB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,GAAI,CAAC,CAAC,EAChE,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,EAAG,CAAC,CAAC,EAC5D,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,IAAK,CAAC,CAAC,EAC7D,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,EAAG,EAAG,CAAC,CAAC,EACvD,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC9D,IAAK,eAAgB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAChE,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,GAAI,IAAK,CAAC,CAAC,EAC/D,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,GAAI,GAAI,CAAC,CAAC,EAC9D,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,GAAI,GAAI,CAAC,CAAC,EAC9D,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EAC/D,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,EAAG,IAAK,CAAC,CAAC,EAC5D,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,IAAK,CAAC,CAAC,EAC3D,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC3D,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC3D,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,GAAI,CAAC,CAAC,EAC3D,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC/D,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,GAAI,CAAC,CAAC,EAC7D,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,EAAG,IAAK,CAAC,CAAC,EACzD,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC9D,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,EAAG,CAAC,CAAC,EACtD,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EAC5D,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACxD,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,EAAG,CAAC,CAAC,EACrD,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EAC9D,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACxD,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC3D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,GAAI,CAAC,CAAC,EAC3D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,EAAG,IAAK,CAAC,CAAC,EACvD,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACzD,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACzD,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACjE,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,EAAG,CAAC,CAAC,EAC3D,IAAK,eAAgB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAChE,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC9D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,uBAAwB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACxE,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC9D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC/D,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,IAAK,CAAC,CAAC,EAChE,IAAK,eAAgB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAChE,IAAK,iBAAkB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAClE,IAAK,iBAAkB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAClE,IAAK,iBAAkB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAClE,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC/D,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,EAAG,CAAC,CAAC,EACpD,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,GAAI,CAAC,CAAC,EAC3D,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACzD,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,EAAG,IAAK,CAAC,CAAC,EACzD,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,EAAG,EAAG,CAAC,CAAC,EACtD,IAAK,mBAAoB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACpE,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,EAAG,IAAK,CAAC,CAAC,EAC1D,IAAK,eAAgB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,IAAK,CAAC,CAAC,EAC/D,IAAK,eAAgB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAChE,IAAK,iBAAkB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,IAAK,CAAC,CAAC,EACjE,IAAK,kBAAmB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACnE,IAAK,oBAAqB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EACnE,IAAK,kBAAmB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,IAAK,CAAC,CAAC,EAClE,IAAK,kBAAmB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,IAAK,CAAC,CAAC,EAClE,IAAK,eAAgB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,GAAI,IAAK,CAAC,CAAC,EAC9D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC/D,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,EAAG,IAAK,CAAC,CAAC,EACpD,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC3D,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,EAAG,CAAC,CAAC,EACvD,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EAC5D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,EAAG,CAAC,CAAC,EACxD,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,EAAG,CAAC,CAAC,EAC1D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC1D,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACjE,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACjE,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACjE,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC9D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EACvD,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACxD,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACxD,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC9D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,EAAG,IAAK,CAAC,CAAC,EACxD,IAAK,gBAAiB,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,IAAK,CAAC,CAAC,EAChE,IAAK,MAAO,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,EAAG,EAAG,CAAC,CAAC,EACnD,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,GAAI,CAAC,CAAC,EAC7D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC1D,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EAC7D,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,GAAI,CAAC,CAAC,EAC1D,IAAK,WAAY,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,GAAI,CAAC,CAAC,EACxD,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC1D,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC3D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,IAAK,CAAC,CAAC,EAC5D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACxD,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EAC7D,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,MAAO,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACvD,IAAK,OAAQ,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,EAAG,IAAK,IAAK,CAAC,CAAC,EACtD,IAAK,UAAW,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC3D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,GAAI,GAAI,CAAC,CAAC,EACxD,IAAK,YAAa,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,GAAI,IAAK,IAAK,CAAC,CAAC,EAC5D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC1D,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACzD,IAAK,QAAS,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EACzD,IAAK,aAAc,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,IAAK,CAAC,CAAC,EAC9D,IAAK,SAAU,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,EAAG,CAAC,CAAC,EACxD,IAAK,cAAe,OAAO,IAAI+B,EAAM,IAAI/B,EAAK,IAAK,IAAK,GAAI,CAAC,CAAC,EAC9D,QAAS,OAAO,IACpC,CACY,CAMA,SAAS6C,EAAS9B,EAAK,CACnB,MAAMjvC,EAASivC,EAAI,OAKnB,GAJIjvC,IAAW,GAIXivC,EAAI,WAAW,CAAC,IAAM,GAEtB,OAAO,KAEX,GAAIjvC,IAAW,EAAG,CAEd,MAAM8P,EAAI,GAAKmhC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAC7E5T,EAAI,GAAK4V,EAAehC,EAAI,WAAW,CAAC,CAAC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAC7E,EAAI,GAAKgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EACnF,OAAO,IAAIgB,EAAM,IAAI/B,EAAKp+B,EAAGurB,EAAG,EAAG,CAAC,CAAC,CACzC,CACA,GAAIr7B,IAAW,EAAG,CAEd,MAAM8P,EAAI,GAAKmhC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAC7E5T,EAAI,GAAK4V,EAAehC,EAAI,WAAW,CAAC,CAAC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAC7E,EAAI,GAAKgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAC7EpxC,EAAI,GAAKozC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EACnF,OAAO,IAAIgB,EAAM,IAAI/B,EAAKp+B,EAAGurB,EAAG,EAAGx9B,EAAI,GAAG,CAAC,CAC/C,CACA,GAAImC,IAAW,EAAG,CAEd,MAAM8P,EAAImhC,EAAehC,EAAI,WAAW,CAAC,CAAC,EACpC5T,EAAI4V,EAAehC,EAAI,WAAW,CAAC,CAAC,EACpC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAC1C,OAAO,IAAIgB,EAAM,IAAI/B,EAAK,GAAKp+B,EAAIA,EAAG,GAAKurB,EAAIA,EAAG,GAAK,EAAI,CAAC,CAAC,CACjE,CACA,GAAIr7B,IAAW,EAAG,CAEd,MAAM8P,EAAImhC,EAAehC,EAAI,WAAW,CAAC,CAAC,EACpC5T,EAAI4V,EAAehC,EAAI,WAAW,CAAC,CAAC,EACpC,EAAIgC,EAAehC,EAAI,WAAW,CAAC,CAAC,EACpCpxC,EAAIozC,EAAehC,EAAI,WAAW,CAAC,CAAC,EAC1C,OAAO,IAAIgB,EAAM,IAAI/B,EAAK,GAAKp+B,EAAIA,EAAG,GAAKurB,EAAIA,EAAG,GAAK,EAAI,GAAI,GAAKx9B,EAAIA,GAAK,GAAG,CAAC,CACrF,CAEA,OAAO,IACX,CACAsyC,EAAI,SAAWY,EACf,SAASE,EAAetkC,EAAU,CAC9B,OAAQA,EAAQ,CACZ,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAA0B,MAAO,GACtC,IAAK,IAAqB,MAAO,IACjC,IAAK,IAAqB,MAAO,IACjC,IAAK,IAAqB,MAAO,IACjC,IAAK,IAAqB,MAAO,IACjC,IAAK,IAAqB,MAAO,IACjC,IAAK,IAAqB,MAAO,IACjC,IAAK,KAAsB,MAAO,IAClC,IAAK,IAAqB,MAAO,IACjC,IAAK,KAAsB,MAAO,IAClC,IAAK,IAAqB,MAAO,IACjC,IAAK,KAAsB,MAAO,IAClC,IAAK,IAAqB,MAAO,GACrD,CACgB,MAAO,EACX,CACJ,GAAGujC,EAAO,MAAQA,EAAO,IAAM,CAAA,EAAG,CACtC,GAAGD,EAAM,SAAWA,EAAM,OAAS,CAAA,EAAG,CAC1C,GAAGA,KAAUA,GAAQ,CAAA,EAAG,EC7pBxB,SAASiB,GAAoBC,EAAe,CACxC,MAAM7hB,EAAS,CAAA,EACf,UAAW8hB,KAAgBD,EAAe,CACtC,MAAME,EAAe,OAAOD,CAAY,GACpCC,GAAgBA,IAAiB,GAAKD,EAAa,QAAQ,MAAO,EAAE,IAAM,KAC1E9hB,EAAO,KAAK+hB,CAAY,CAEhC,CACA,OAAO/hB,CACX,CACA,SAASgiB,GAAUxhC,EAAGurB,EAAGv9B,EAAGD,EAAG,CAC3B,MAAO,CACH,IAAKiS,EAAI,IACT,KAAMhS,EAAI,IACV,MAAOu9B,EAAI,IACX,MAAOx9B,CACf,CACA,CACA,SAAS0zC,GAAWt0B,EAAO3T,EAAO,CAC9B,MAAM9J,EAAQ8J,EAAM,MACdtJ,EAASsJ,EAAM,CAAC,EAAE,OACxB,GAAI9J,IAAU,OACV,OAEJ,MAAMq4B,EAAgB5a,EAAM,WAAWzd,CAAK,EAO5C,MANc,CACV,gBAAiBq4B,EAAc,WAC/B,YAAaA,EAAc,OAC3B,cAAeA,EAAc,WAC7B,UAAWA,EAAc,OAAS73B,CAC1C,CAEA,CACA,SAASwxC,GAAyB53B,EAAO63B,EAAU,CAC/C,GAAI,CAAC73B,EACD,OAEJ,MAAM83B,EAAiBzB,GAAM,OAAO,IAAI,SAASwB,CAAQ,EACzD,GAAKC,EAGL,MAAO,CACH,MAAO93B,EACP,MAAO03B,GAAUI,EAAe,KAAK,EAAGA,EAAe,KAAK,EAAGA,EAAe,KAAK,EAAGA,EAAe,KAAK,CAAC,CACnH,CACA,CACA,SAASC,GAAyB/3B,EAAOg4B,EAASC,EAAS,CACvD,GAAI,CAACj4B,GAASg4B,EAAQ,SAAW,EAC7B,OAGJ,MAAMT,EADQS,EAAQ,CAAC,EACK,OAAM,EAC5BE,EAAcZ,GAAoBC,CAAa,EACrD,MAAO,CACH,MAAOv3B,EACP,MAAO03B,GAAUQ,EAAY,CAAC,EAAGA,EAAY,CAAC,EAAGA,EAAY,CAAC,EAAGD,EAAUC,EAAY,CAAC,EAAI,CAAC,CACrG,CACA,CACA,SAASC,GAAyBn4B,EAAOg4B,EAASC,EAAS,CACvD,GAAI,CAACj4B,GAASg4B,EAAQ,SAAW,EAC7B,OAGJ,MAAMT,EADQS,EAAQ,CAAC,EACK,OAAM,EAC5BE,EAAcZ,GAAoBC,CAAa,EAC/Ca,EAAkB,IAAI/B,GAAM,IAAI9B,GAAK2D,EAAY,CAAC,EAAGA,EAAY,CAAC,EAAI,IAAKA,EAAY,CAAC,EAAI,IAAKD,EAAUC,EAAY,CAAC,EAAI,CAAC,CAAC,EACpI,MAAO,CACH,MAAOl4B,EACP,MAAO03B,GAAUU,EAAgB,KAAK,EAAGA,EAAgB,KAAK,EAAGA,EAAgB,KAAK,EAAGA,EAAgB,KAAK,CAAC,CACvH,CACA,CACA,SAASC,GAAah1B,EAAOgV,EAAO,CAChC,OAAI,OAAOhV,GAAU,SACV,CAAC,GAAGA,EAAM,SAASgV,CAAK,CAAC,EAGzBhV,EAAM,YAAYgV,CAAK,CAEtC,CACA,SAASigB,GAAcj1B,EAAO,CAC1B,MAAMhgB,EAAS,CAAA,EAETk1C,EAAyB,WAAA,2RAAA,IAA2Q,EACpSC,EAA2BH,GAAah1B,EAAOk1B,CAAsB,EAE3E,GAAIC,EAAyB,OAAS,EAClC,UAAWC,KAAgBD,EAA0B,CACjD,MAAME,EAAuBD,EAAa,OAAOjB,GAAgBA,IAAiB,MAAS,EACrFmB,EAAcD,EAAqB,CAAC,EACpCE,EAAkBF,EAAqB,CAAC,EAC9C,GAAI,CAACE,EACD,SAEJ,IAAIC,EACJ,GAAIF,IAAgB,MAAO,CACvB,MAAMG,EAAkB,+KACxBD,EAAmBd,GAAyBJ,GAAWt0B,EAAOo1B,CAAY,EAAGJ,GAAaO,EAAiBE,CAAe,EAAG,EAAK,CACtI,SACSH,IAAgB,OAAQ,CAC7B,MAAMG,EAAkB,yNACxBD,EAAmBd,GAAyBJ,GAAWt0B,EAAOo1B,CAAY,EAAGJ,GAAaO,EAAiBE,CAAe,EAAG,EAAI,CACrI,SACSH,IAAgB,MAAO,CAC5B,MAAMG,EAAkB,4KACxBD,EAAmBV,GAAyBR,GAAWt0B,EAAOo1B,CAAY,EAAGJ,GAAaO,EAAiBE,CAAe,EAAG,EAAK,CACtI,SACSH,IAAgB,OAAQ,CAC7B,MAAMG,EAAkB,4NACxBD,EAAmBV,GAAyBR,GAAWt0B,EAAOo1B,CAAY,EAAGJ,GAAaO,EAAiBE,CAAe,EAAG,EAAI,CACrI,MACSH,IAAgB,MACrBE,EAAmBjB,GAAyBD,GAAWt0B,EAAOo1B,CAAY,EAAGE,EAAcC,CAAe,GAE1GC,GACAx1C,EAAO,KAAKw1C,CAAgB,CAEpC,CAEJ,OAAOx1C,CACX,CAIA,SAAS01C,GAA6B11B,EAAO,CACzC,MAAI,CAACA,GAAS,OAAOA,EAAM,UAAa,YAAc,OAAOA,EAAM,YAAe,WAEvE,CAAA,EAEJi1B,GAAcj1B,CAAK,CAC9B,CChIA,MAAM21B,GAAkB,WAClBC,GAAa,IACbC,GAAoB,EAQ1B,SAASC,GAAmB91B,EAAOnZ,EAAS,CACxC,IAAIkvC,EAAU,CAAA,EACd,GAAIlvC,EAAQ,0BAA4BA,EAAQ,cAAc,QAAS,CACnE,MAAMmvC,EAAgBC,GAAqBj2B,EAAOnZ,CAAO,EACzDkvC,EAAUA,EAAQ,OAAOC,CAAa,CAC1C,CACA,GAAInvC,EAAQ,uBAAwB,CAChC,MAAMqvC,EAAcC,GAAmBn2B,EAAOnZ,CAAO,EACrDkvC,EAAUA,EAAQ,OAAOG,CAAW,CACxC,CACA,OAAOH,CACX,CACA,SAASE,GAAqBj2B,EAAOnZ,EAAS,CAC1C,MAAMmvC,EAAgB,CAAA,EAChBv5B,EAAgBuD,EAAM,aAAY,EACxC,QAASvE,EAAa,EAAGA,GAAcgB,EAAehB,IAAc,CAChE,MAAMga,EAAczV,EAAM,eAAevE,CAAU,EAC7CpP,EAAQopB,EAAY,MAAM5uB,EAAQ,aAAa,QAAQ,KAAK,EAClE,GAAIwF,EAAO,CACP,MAAMsQ,EAAQ,CAAE,gBAAiBlB,EAAY,YAAapP,EAAM,CAAC,EAAE,OAAS,EAAG,cAAeoP,EAAY,UAAWga,EAAY,OAAS,CAAC,EAC3I,GAAI9Y,EAAM,UAAYA,EAAM,YAAa,CACrC,MAAMy5B,EAAgB,CAClB,MAAAz5B,EACA,GAAG05B,GAAc5gB,EAAY,UAAUppB,EAAM,CAAC,EAAE,MAAM,CAAC,EACvD,mBAAoB,EACxC,GACoB+pC,EAAc,MAAQA,EAAc,mBACpCJ,EAAc,KAAKI,CAAa,CAExC,CACJ,CACJ,CACA,OAAOJ,CACX,CACA,SAASG,GAAmBn2B,EAAOnZ,EAAS,CACxC,MAAMqvC,EAAc,CAAA,EACdz5B,EAAgBuD,EAAM,aAAY,EAExC,GAAI,CAACnZ,EAAQ,wBAA0BA,EAAQ,uBAAuB,KAAI,IAAO,GAC7E,OAAOqvC,EAMX,MAAMI,EAAYhkB,GAAuBzrB,EAAQ,sBAAsB,EACjEmuB,EAAQ,IAAI,OAAOnuB,EAAQ,uBAAwB,MAAMyvC,EAAY,IAAM,EAAE,EAAE,EAErF,GAAI1nC,GAAyBomB,CAAK,EAC9B,OAAOkhB,EAGX,QAASvhB,EAAY,EAAGA,GAAalY,EAAekY,GAAaihB,GAAaC,GAAmB,CAC7F,MAAMjhB,EAAU,KAAK,IAAID,EAAYihB,GAAa,EAAGn5B,CAAa,EAC5Dof,EAAQ,CAAA,EAEd,QAASl7B,EAAIg0B,EAAWh0B,GAAKi0B,EAASj0B,IAClCk7B,EAAM,KAAK7b,EAAM,eAAerf,CAAC,CAAC,EAEtC,MAAMsgB,EAAO4a,EAAM,KAAK;AAAA,CAAI,EAC5B7G,EAAM,UAAY,EAClB,IAAI3oB,EACJ,MAAQA,EAAQ2oB,EAAM,KAAK/T,CAAI,KAAO,MAAM,CAExC,MAAMs1B,EAAgBt1B,EAAK,UAAU,EAAG5U,EAAM,KAAK,EAC7C+6B,GAAcmP,EAAc,MAAM,KAAK,GAAK,CAAA,GAAI,OAChD96B,EAAakZ,EAAYyS,EAEzBoP,EAAanqC,EAAM,CAAC,EAAE,MAAM;AAAA,CAAI,EAChCoqC,EAAcD,EAAW,OACzBE,EAAej7B,EAAag7B,EAAc,EAE1CE,EAAiBJ,EAAc,YAAY;AAAA,CAAI,EAAI,EACnD/5B,EAAcnQ,EAAM,MAAQsqC,EAAiB,EAE7CC,EAAgBJ,EAAWA,EAAW,OAAS,CAAC,EAChD95B,EAAY+5B,IAAgB,EAAIj6B,EAAcnQ,EAAM,CAAC,EAAE,OAASuqC,EAAc,OAAS,EACvFj6B,EAAQ,CACV,gBAAiBlB,EACjB,YAAAe,EACA,cAAek6B,EACf,UAAAh6B,CAChB,EACkBqE,GAAS1U,EAAM,QAAU,CAAA,GAAI,OAAY,GACzCwqC,IAAqBxqC,EAAM,QAAU,CAAA,GAAI,WAAgB,MAAQ,GACjE+pC,EAAgB,CAClB,MAAAz5B,EACA,KAAMoE,EACN,iBAAA81B,EACA,mBAAoB,EACpC,GACgBT,EAAc,MAAQA,EAAc,oBAEhCF,EAAY,SAAW,GAAKA,EAAYA,EAAY,OAAS,CAAC,EAAE,MAAM,cAAgBE,EAAc,MAAM,kBAC1GF,EAAY,KAAKE,CAAa,EAItCphB,EAAM,UAAY3oB,EAAM,MAAQA,EAAM,CAAC,EAAE,MAC7C,CACJ,CACA,OAAO6pC,CACX,CACA,SAASG,GAAcp1B,EAAM,CACzBA,EAAOA,EAAK,KAAI,EAChB,MAAM41B,EAAmB51B,EAAK,WAAW,GAAG,EAC5C,OAAAA,EAAOA,EAAK,QAAQ00B,GAAiB,EAAE,EAChC,CAAE,KAAA10B,EAAM,iBAAA41B,CAAgB,CACnC,CC8gBA,MAAMC,EAAgB,CAClB,IAAI,YAAa,CACb,OAAO,KAAK,SAAS,UAAY,CACrC,CACA,IAAI,WAAY,CACZ,MAAO,CAAC,CAAC,KAAK,OAClB,CACA,aAAc,CACV,KAAK,EAAI,IAAI,QAAQ,CAACpc,EAAGt7B,IAAM,CAC3B,KAAK,iBAAmBs7B,EACxB,KAAK,cAAgBt7B,CACzB,CAAC,CACL,CACA,SAASe,EAAO,CACZ,OAAI,KAAK,UACE,QAAQ,QAAO,EAEnB,IAAI,QAAQsJ,GAAW,CAC1B,KAAK,iBAAiBtJ,CAAK,EAC3B,KAAK,QAAU,CAAE,QAAS,EAAkC,MAAAA,CAAK,EACjEsJ,EAAO,CACX,CAAC,CACL,CACA,MAAM1J,EAAK,CACP,OAAI,KAAK,UACE,QAAQ,QAAO,EAEnB,IAAI,QAAQ0J,GAAW,CAC1B,KAAK,cAAc1J,CAAG,EACtB,KAAK,QAAU,CAAE,QAAS,EAAkC,MAAOA,CAAG,EACtE0J,EAAO,CACX,CAAC,CACL,CACA,QAAS,CACL,OAAO,KAAK,MAAM,IAAI5J,EAAmB,CAC7C,CACJ,CAGA,IAAIk3C,IACH,SAAUA,EAAU,CAQjB,eAAeC,EAAQC,EAAU,CAC7B,IAAIC,EACJ,MAAMl3C,EAAS,MAAM,QAAQ,IAAIi3C,EAAS,IAAIztC,GAAWA,EAAQ,KAAKrJ,GAASA,EAAOZ,GAAS,CACtF23C,IACDA,EAAa33C,EAGrB,CAAC,CAAC,CAAC,EACH,GAAI,OAAO23C,EAAe,IACtB,MAAMA,EAEV,OAAOl3C,CACX,CACA+2C,EAAS,QAAUC,EAWnB,SAASG,EAAcC,EAAQ,CAE3B,OAAO,IAAI,QAAQ,MAAO3tC,EAASC,IAAW,CAC1C,GAAI,CACA,MAAM0tC,EAAO3tC,EAASC,CAAM,CAChC,OACOnK,EAAO,CACVmK,EAAOnK,CAAK,CAChB,CACJ,CAAC,CACL,CACAw3C,EAAS,cAAgBI,CAC7B,GAAGJ,KAAaA,GAAW,CAAA,EAAG,EA4B9B,MAAMM,EAAiB,CACnB,aAAc,CACV,KAAK,sBAAwB,CAAA,EAC7B,KAAK,kBAAoB,CAAA,CAC7B,CACA,IAAI,eAAgB,CAChB,MAAO,CAAC,CAAC,KAAK,WAClB,CACA,QAAQl3C,EAAO,CAEX,GADA,KAAK,oBAAmB,EACpB,KAAK,sBAAsB,OAAS,EAAG,CACvC,MAAMm3C,EAAW,KAAK,sBAAsB,MAAK,EACjD,KAAK,yBAAyBA,EAAUn3C,CAAK,CACjD,MAEI,KAAK,kBAAkB,KAAKA,CAAK,CAEzC,CACA,aAAaA,EAAO,CAChB,KAAK,oBAAmB,EACxB,KAAK,YAAcA,EACnB,UAAWm3C,KAAY,KAAK,sBACxB,KAAK,yBAAyBA,EAAUn3C,CAAK,EAEjD,KAAK,sBAAsB,OAAS,CACxC,CACA,qBAAsB,CAClB,GAAI,KAAK,YACL,MAAM,IAAIF,GAAmB,iEAAiE,CAEtG,CACA,yBAAyBq3C,EAAUn3C,EAAO,CAClCA,EAAM,GACNm3C,EAAS,SAASn3C,EAAM,KAAK,EAG7Bm3C,EAAS,MAAMn3C,EAAM,KAAK,CAElC,CACA,SAAU,CACN,GAAI,KAAK,kBAAkB,OAAS,GAAK,KAAK,YAAa,CACvD,MAAMA,EAAQ,KAAK,kBAAkB,OAAS,EAAI,KAAK,kBAAkB,QAAU,KAAK,YACxF,OAAIA,EAAM,GACC,QAAQ,QAAQA,EAAM,KAAK,EAG3B,QAAQ,OAAOA,EAAM,KAAK,CAEzC,KACK,CACD,MAAMm3C,EAAW,IAAIR,GACrB,YAAK,sBAAsB,KAAKQ,CAAQ,EACjCA,EAAS,CACpB,CACJ,CACJ,CAKA,MAAMC,GAAN,MAAMA,EAAsB,CACxB,YAAY7oC,EAAU8oC,EAAW,CAC7B,KAAK,UAAYA,EACjB,KAAK,kBAAoB,IAAIH,GAC7B,KAAK,UAAY,CACb,KAAM,IAAM,KAAK,kBAAkB,QAAO,EAC1C,OAAQ,KACJ,KAAK,YAAS,EACP,QAAQ,QAAQ,CAAE,KAAM,GAAM,MAAO,OAAW,GAE3D,MAAO,MAAOj4C,IACV,KAAK,aAAaA,CAAC,EACZ,CAAE,KAAM,GAAM,MAAO,MAAS,EAErD,EACQ,eAAe,SAAY,CACvB,MAAMmyC,EAAI7iC,EAAS,CACf,QAASvO,GAAS,KAAK,kBAAkB,QAAQ,CAAE,GAAI,GAAM,MAAO,CAAE,KAAM,GAAO,MAAOA,CAAK,CAAE,CAAE,EACnG,SAAUkyB,GAAU,CAChB,UAAWlyB,KAASkyB,EAChB,KAAK,kBAAkB,QAAQ,CAAE,GAAI,GAAM,MAAO,CAAE,KAAM,GAAO,MAAOlyB,CAAK,CAAE,CAAE,CAEzF,EACA,OAAQZ,GAAS,KAAK,aAAaA,CAAK,CACxD,CAAa,EACD,GAAI,CAAC,KAAK,kBAAkB,cACxB,GAAI,CACA,MAAMgyC,EACN,KAAK,UAAS,CAClB,OACOhyC,EAAO,CACV,KAAK,aAAaA,CAAK,CAC3B,CAER,CAAC,CACL,CACA,OAAO,UAAUkB,EAAO,CACpB,OAAO,IAAI82C,GAAuBE,GAAW,CACzCA,EAAO,SAASh3C,CAAK,CACzB,CAAC,CACL,CACA,OAAO,YAAY+I,EAAS,CACxB,OAAO,IAAI+tC,GAAsB,MAAOzwC,GAAY,CAChDA,EAAQ,SAAS,MAAM0C,CAAO,CAClC,CAAC,CACL,CACA,OAAO,yBAAyBytC,EAAU,CACtC,OAAO,IAAIM,GAAsB,MAAOzwC,GAAY,CAChD,MAAM,QAAQ,IAAImwC,EAAS,IAAI,MAAO1F,GAAMzqC,EAAQ,QAAQ,MAAMyqC,CAAC,CAAC,CAAC,CACzE,CAAC,CACL,CACA,OAAO,MAAM7uC,EAAW,CACpB,OAAO,IAAI60C,GAAsB,MAAOzwC,GAAY,CAChD,MAAM,QAAQ,IAAIpE,EAAU,IAAI,MAAOd,GAAa,CAChD,gBAAiBe,KAAQf,EACrBkF,EAAQ,QAAQnE,CAAI,CAE5B,CAAC,CAAC,CACN,CAAC,CACL,CAEA,OAAO,IAAIf,EAAUy2B,EAAO,CACxB,OAAO,IAAIkf,GAAsB,MAAOzwC,GAAY,CAChD,gBAAiBnE,KAAQf,EACrBkF,EAAQ,QAAQuxB,EAAM11B,CAAI,CAAC,CAEnC,CAAC,CACL,CACA,IAAI01B,EAAO,CACP,OAAOkf,GAAsB,IAAI,KAAMlf,CAAK,CAChD,CACA,OAAO,SAASz2B,EAAU,CACtB,OAAO21C,GAAsB,OAAO31C,EAAUe,GAAQ,CAAC,CAACA,CAAI,CAChE,CACA,UAAW,CACP,OAAO40C,GAAsB,SAAS,IAAI,CAC9C,CACA,OAAO,OAAO31C,EAAU81C,EAAU,CAC9B,OAAO,IAAIH,GAAsB,MAAOzwC,GAAY,CAChD,gBAAiBnE,KAAQf,EACjB81C,EAAS/0C,CAAI,GACbmE,EAAQ,QAAQnE,CAAI,CAGhC,CAAC,CACL,CACA,OAAO+0C,EAAU,CACb,OAAOH,GAAsB,OAAO,KAAMG,CAAQ,CACtD,CACA,WAAY,CACH,KAAK,kBAAkB,eACxB,KAAK,kBAAkB,aAAa,CAAE,GAAI,GAAM,MAAO,CAAE,KAAM,GAAM,MAAO,MAAS,CAAE,CAAE,CAEjG,CACA,aAAan4C,EAAO,CACX,KAAK,kBAAkB,eACxB,KAAK,kBAAkB,aAAa,CAAE,GAAI,GAAO,MAAOA,EAAO,CAGvE,CACA,CAAC,OAAO,aAAa,GAAI,CACrB,OAAO,KAAK,SAChB,CACJ,EA3Cag4C,GAAK,MAAQA,GAAsB,UAAU,CAAA,CAAE,EA5D5D,IAAMI,GAANJ,GChzBA,MAAMK,EAAkB,CACpB,YAAYvlB,EAAQ,CAChB,KAAK,OAASA,EACd,KAAK,UAAY,IAAI,YAAYA,EAAO,MAAM,EAC9C,KAAK,oBAAsB,IAAI,WAAW,CAAC,EAC3C,KAAK,oBAAoB,CAAC,EAAI,EAClC,CACA,aAAawlB,EAAaC,EAAc,CACpCD,EAAc55B,GAAS45B,CAAW,EAClC,MAAME,EAAY,KAAK,OACjBC,EAAe,KAAK,UACpBC,EAAkBH,EAAa,OACrC,OAAIG,IAAoB,EACb,IAEX,KAAK,OAAS,IAAI,YAAYF,EAAU,OAASE,CAAe,EAChE,KAAK,OAAO,IAAIF,EAAU,SAAS,EAAGF,CAAW,EAAG,CAAC,EACrD,KAAK,OAAO,IAAIE,EAAU,SAASF,CAAW,EAAGA,EAAcI,CAAe,EAC9E,KAAK,OAAO,IAAIH,EAAcD,CAAW,EACrCA,EAAc,EAAI,KAAK,oBAAoB,CAAC,IAC5C,KAAK,oBAAoB,CAAC,EAAIA,EAAc,GAEhD,KAAK,UAAY,IAAI,YAAY,KAAK,OAAO,MAAM,EAC/C,KAAK,oBAAoB,CAAC,GAAK,GAC/B,KAAK,UAAU,IAAIG,EAAa,SAAS,EAAG,KAAK,oBAAoB,CAAC,EAAI,CAAC,CAAC,EAEzE,GACX,CACA,SAASz1C,EAAOpC,EAAO,CAGnB,OAFAoC,EAAQ0b,GAAS1b,CAAK,EACtBpC,EAAQ8d,GAAS9d,CAAK,EAClB,KAAK,OAAOoC,CAAK,IAAMpC,EAChB,IAEX,KAAK,OAAOoC,CAAK,EAAIpC,EACjBoC,EAAQ,EAAI,KAAK,oBAAoB,CAAC,IACtC,KAAK,oBAAoB,CAAC,EAAIA,EAAQ,GAEnC,GACX,CACA,aAAa2M,EAAYlM,EAAO,CAC5BkM,EAAa+O,GAAS/O,CAAU,EAChClM,EAAQib,GAASjb,CAAK,EACtB,MAAM+0C,EAAY,KAAK,OACjBC,EAAe,KAAK,UAC1B,GAAI9oC,GAAc6oC,EAAU,OACxB,MAAO,GAEX,MAAMG,EAAWH,EAAU,OAAS7oC,EAIpC,OAHIlM,GAASk1C,IACTl1C,EAAQk1C,GAERl1C,IAAU,EACH,IAEX,KAAK,OAAS,IAAI,YAAY+0C,EAAU,OAAS/0C,CAAK,EACtD,KAAK,OAAO,IAAI+0C,EAAU,SAAS,EAAG7oC,CAAU,EAAG,CAAC,EACpD,KAAK,OAAO,IAAI6oC,EAAU,SAAS7oC,EAAalM,CAAK,EAAGkM,CAAU,EAClE,KAAK,UAAY,IAAI,YAAY,KAAK,OAAO,MAAM,EAC/CA,EAAa,EAAI,KAAK,oBAAoB,CAAC,IAC3C,KAAK,oBAAoB,CAAC,EAAIA,EAAa,GAE3C,KAAK,oBAAoB,CAAC,GAAK,GAC/B,KAAK,UAAU,IAAI8oC,EAAa,SAAS,EAAG,KAAK,oBAAoB,CAAC,EAAI,CAAC,CAAC,EAEzE,GACX,CACA,aAAc,CACV,OAAI,KAAK,OAAO,SAAW,EAChB,EAEJ,KAAK,cAAc,KAAK,OAAO,OAAS,CAAC,CACpD,CAKA,aAAaz1C,EAAO,CAChB,OAAIA,EAAQ,EACD,GAEXA,EAAQ0b,GAAS1b,CAAK,EACf,KAAK,cAAcA,CAAK,EACnC,CACA,cAAcA,EAAO,CACjB,GAAIA,GAAS,KAAK,oBAAoB,CAAC,EACnC,OAAO,KAAK,UAAUA,CAAK,EAE/B,IAAI2M,EAAa,KAAK,oBAAoB,CAAC,EAAI,EAC3CA,IAAe,IACf,KAAK,UAAU,CAAC,EAAI,KAAK,OAAO,CAAC,EACjCA,KAEA3M,GAAS,KAAK,OAAO,SACrBA,EAAQ,KAAK,OAAO,OAAS,GAEjC,QAAS5B,EAAIuO,EAAYvO,GAAK4B,EAAO5B,IACjC,KAAK,UAAUA,CAAC,EAAI,KAAK,UAAUA,EAAI,CAAC,EAAI,KAAK,OAAOA,CAAC,EAE7D,YAAK,oBAAoB,CAAC,EAAI,KAAK,IAAI,KAAK,oBAAoB,CAAC,EAAG4B,CAAK,EAClE,KAAK,UAAUA,CAAK,CAC/B,CACA,WAAW41C,EAAK,CACZA,EAAM,KAAK,MAAMA,CAAG,EAEpB,KAAK,YAAW,EAChB,IAAIC,EAAM,EACNC,EAAO,KAAK,OAAO,OAAS,EAC5BC,EAAM,EACNC,EAAU,EACVC,EAAW,EACf,KAAOJ,GAAOC,GAIV,GAHAC,EAAMF,GAAQC,EAAOD,GAAO,EAAK,EACjCG,EAAU,KAAK,UAAUD,CAAG,EAC5BE,EAAWD,EAAU,KAAK,OAAOD,CAAG,EAChCH,EAAMK,EACNH,EAAOC,EAAM,UAERH,GAAOI,EACZH,EAAME,EAAM,MAGZ,OAGR,OAAO,IAAIG,GAAuBH,EAAKH,EAAMK,CAAQ,CACzD,CACJ,CAiFA,MAAMC,EAAuB,CACzB,YAAYl2C,EAAOm2C,EAAW,CAC1B,KAAK,MAAQn2C,EACb,KAAK,UAAYm2C,EACjB,KAAK,6BAA+B,OACpC,KAAK,MAAQn2C,EACb,KAAK,UAAYm2C,CACrB,CACJ,CCvNA,MAAMC,EAAgB,CAClB,YAAYpuB,EAAKsR,EAAO+c,EAAKC,EAAW,CACpC,KAAK,KAAOtuB,EACZ,KAAK,OAASsR,EACd,KAAK,KAAO+c,EACZ,KAAK,WAAaC,EAClB,KAAK,YAAc,KACnB,KAAK,iBAAmB,IAC5B,CACA,SAAU,CACN,KAAK,OAAO,OAAS,CACzB,CACA,IAAI,SAAU,CACV,OAAO,KAAK,UAChB,CACA,SAAU,CACN,OAAI,KAAK,mBAAqB,OAC1B,KAAK,iBAAmB,KAAK,OAAO,KAAK,KAAK,IAAI,GAE/C,KAAK,gBAChB,CACA,SAAS,EAAG,CACJ,EAAE,KAAO,EAAE,MAAQ,KAAK,OACxB,KAAK,KAAO,EAAE,IACd,KAAK,YAAc,MAGvB,MAAMpiC,EAAU,EAAE,QAClB,UAAWsC,KAAUtC,EACjB,KAAK,mBAAmBsC,EAAO,KAAK,EACpC,KAAK,kBAAkB,IAAIyC,EAASzC,EAAO,MAAM,gBAAiBA,EAAO,MAAM,WAAW,EAAGA,EAAO,IAAI,EAE5G,KAAK,WAAa,EAAE,UACpB,KAAK,iBAAmB,IAC5B,CACA,mBAAoB,CAChB,GAAI,CAAC,KAAK,YAAa,CACnB,MAAM+/B,EAAY,KAAK,KAAK,OACtBC,EAAc,KAAK,OAAO,OAC1BC,EAAkB,IAAI,YAAYD,CAAW,EACnD,QAAS,EAAI,EAAG,EAAIA,EAAa,IAC7BC,EAAgB,CAAC,EAAI,KAAK,OAAO,CAAC,EAAE,OAASF,EAEjD,KAAK,YAAc,IAAIlB,GAAkBoB,CAAe,CAC5D,CACJ,CAIA,aAAaC,EAAW9T,EAAU,CAC9B,KAAK,OAAO8T,CAAS,EAAI9T,EACrB,KAAK,aAEL,KAAK,YAAY,SAAS8T,EAAW,KAAK,OAAOA,CAAS,EAAE,OAAS,KAAK,KAAK,MAAM,CAE7F,CACA,mBAAmBt8B,EAAO,CACtB,GAAIA,EAAM,kBAAoBA,EAAM,cAAe,CAC/C,GAAIA,EAAM,cAAgBA,EAAM,UAE5B,OAGJ,KAAK,aAAaA,EAAM,gBAAkB,EAAG,KAAK,OAAOA,EAAM,gBAAkB,CAAC,EAAE,UAAU,EAAGA,EAAM,YAAc,CAAC,EAChH,KAAK,OAAOA,EAAM,gBAAkB,CAAC,EAAE,UAAUA,EAAM,UAAY,CAAC,CAAC,EAC3E,MACJ,CAEA,KAAK,aAAaA,EAAM,gBAAkB,EAAG,KAAK,OAAOA,EAAM,gBAAkB,CAAC,EAAE,UAAU,EAAGA,EAAM,YAAc,CAAC,EAChH,KAAK,OAAOA,EAAM,cAAgB,CAAC,EAAE,UAAUA,EAAM,UAAY,CAAC,CAAC,EAEzE,KAAK,OAAO,OAAOA,EAAM,gBAAiBA,EAAM,cAAgBA,EAAM,eAAe,EACjF,KAAK,aAEL,KAAK,YAAY,aAAaA,EAAM,gBAAiBA,EAAM,cAAgBA,EAAM,eAAe,CAExG,CACA,kBAAkBC,EAAUs8B,EAAY,CACpC,GAAIA,EAAW,SAAW,EAEtB,OAEJ,MAAMC,EAAcrqC,GAAWoqC,CAAU,EACzC,GAAIC,EAAY,SAAW,EAAG,CAE1B,KAAK,aAAav8B,EAAS,WAAa,EAAG,KAAK,OAAOA,EAAS,WAAa,CAAC,EAAE,UAAU,EAAGA,EAAS,OAAS,CAAC,EAC1Gu8B,EAAY,CAAC,EACb,KAAK,OAAOv8B,EAAS,WAAa,CAAC,EAAE,UAAUA,EAAS,OAAS,CAAC,CAAC,EACzE,MACJ,CAEAu8B,EAAYA,EAAY,OAAS,CAAC,GAAK,KAAK,OAAOv8B,EAAS,WAAa,CAAC,EAAE,UAAUA,EAAS,OAAS,CAAC,EAEzG,KAAK,aAAaA,EAAS,WAAa,EAAG,KAAK,OAAOA,EAAS,WAAa,CAAC,EAAE,UAAU,EAAGA,EAAS,OAAS,CAAC,EAC1Gu8B,EAAY,CAAC,CAAC,EAEpB,MAAMC,EAAa,IAAI,YAAYD,EAAY,OAAS,CAAC,EACzD,QAASx4C,EAAI,EAAGA,EAAIw4C,EAAY,OAAQx4C,IACpC,KAAK,OAAO,OAAOic,EAAS,WAAajc,EAAI,EAAG,EAAGw4C,EAAYx4C,CAAC,CAAC,EACjEy4C,EAAWz4C,EAAI,CAAC,EAAIw4C,EAAYx4C,CAAC,EAAE,OAAS,KAAK,KAAK,OAEtD,KAAK,aAEL,KAAK,YAAY,aAAaic,EAAS,WAAYw8B,CAAU,CAErE,CACJ,CCnBA,MAAMC,EAA0B,CAC5B,aAAc,CACV,KAAK,QAAU,OAAO,OAAO,IAAI,CACrC,CACA,SAAS9uB,EAAK,CACV,OAAO,KAAK,QAAQA,CAAG,CAC3B,CACA,WAAY,CACR,MAAM+uB,EAAM,CAAA,EACZ,cAAO,KAAK,KAAK,OAAO,EAAE,QAAS/qC,GAAQ+qC,EAAI,KAAK,KAAK,QAAQ/qC,CAAG,CAAC,CAAC,EAC/D+qC,CACX,CACA,gBAAgB9sC,EAAM,CAClB,KAAK,QAAQA,EAAK,GAAG,EAAI,IAAI+sC,GAAY1vB,GAAI,MAAMrd,EAAK,GAAG,EAAGA,EAAK,MAAOA,EAAK,IAAKA,EAAK,SAAS,CACtG,CACA,oBAAoB+d,EAAKnrB,EAAG,CACxB,GAAI,CAAC,KAAK,QAAQmrB,CAAG,EACjB,OAEU,KAAK,QAAQA,CAAG,EACxB,SAASnrB,CAAC,CACpB,CACA,oBAAoBmrB,EAAK,CAChB,KAAK,QAAQA,CAAG,GAGrB,OAAO,KAAK,QAAQA,CAAG,CAC3B,CACJ,CACA,MAAMgvB,WAAoBZ,EAAgB,CACtC,IAAI,KAAM,CACN,OAAO,KAAK,IAChB,CACA,IAAI,KAAM,CACN,OAAO,KAAK,IAChB,CACA,UAAW,CACP,OAAO,KAAK,QAAO,CACvB,CACA,YAAY3jB,EAAO,CACf,MAAM2f,EAAU,CAAA,EAChB,QAASh0C,EAAI,EAAGA,EAAI,KAAK,OAAO,OAAQA,IAAK,CACzC,MAAM+e,EAAO,KAAK,OAAO/e,CAAC,EACpB64C,EAAc,KAAK,SAAS,IAAIh+B,EAAS7a,EAAI,EAAG,CAAC,CAAC,EAClD84C,EAAsB/5B,EAAK,SAASsV,CAAK,EAC/C,UAAW3oB,KAASotC,GACZptC,EAAM,OAASA,EAAM,QAAU,KAC/BA,EAAM,MAAQA,EAAM,MAAQmtC,GAEhC7E,EAAQ,KAAKtoC,CAAK,CAE1B,CACA,OAAOsoC,CACX,CACA,iBAAkB,CACd,OAAO,KAAK,OAAO,MAAM,CAAC,CAC9B,CACA,cAAe,CACX,OAAO,KAAK,OAAO,MACvB,CACA,eAAel5B,EAAY,CACvB,OAAO,KAAK,OAAOA,EAAa,CAAC,CACrC,CACA,kBAAkBmB,EAAUiX,EAAgB,CACxC,MAAM6lB,EAAa1lB,GAAcpX,EAAS,OAAQgX,GAA0BC,CAAc,EAAG,KAAK,OAAOjX,EAAS,WAAa,CAAC,EAAG,CAAC,EACpI,OAAI88B,EACO,IAAIp9B,EAAMM,EAAS,WAAY88B,EAAW,YAAa98B,EAAS,WAAY88B,EAAW,SAAS,EAEpG,IACX,CACA,MAAM7lB,EAAgB,CAClB,MAAMgI,EAAQ,KAAK,OACb8d,EAAY,KAAK,WAAW,KAAK,IAAI,EAC3C,IAAIl+B,EAAa,EACbm+B,EAAW,GACXC,EAAgB,EAChBC,EAAa,CAAA,EACjB,MAAO,CACH,EAAE,OAAO,QAAQ,GAAI,CACjB,OACI,GAAID,EAAgBC,EAAW,OAAQ,CACnC,MAAM35C,EAAQy5C,EAAS,UAAUE,EAAWD,CAAa,EAAE,MAAOC,EAAWD,CAAa,EAAE,GAAG,EAC/FA,GAAiB,EACjB,MAAM15C,CACV,SAEQsb,EAAaogB,EAAM,OACnB+d,EAAW/d,EAAMpgB,CAAU,EAC3Bq+B,EAAaH,EAAUC,EAAU/lB,CAAc,EAC/CgmB,EAAgB,EAChBp+B,GAAc,MAGd,MAIhB,CACZ,CACI,CACA,aAAaA,EAAYoY,EAAgB,CACrC,MAAM6J,EAAU,KAAK,OAAOjiB,EAAa,CAAC,EACpC0Z,EAAS,KAAK,WAAWuI,EAAS7J,CAAc,EAChDkmB,EAAQ,CAAA,EACd,UAAWp9B,KAASwY,EAChB4kB,EAAM,KAAK,CACP,KAAMrc,EAAQ,UAAU/gB,EAAM,MAAOA,EAAM,GAAG,EAC9C,YAAaA,EAAM,MAAQ,EAC3B,UAAWA,EAAM,IAAM,CACvC,CAAa,EAEL,OAAOo9B,CACX,CACA,WAAWrc,EAAS7J,EAAgB,CAChC,MAAM7zB,EAAS,CAAA,EACf,IAAIqM,EAEJ,IADAwnB,EAAe,UAAY,GACpBxnB,EAAQwnB,EAAe,KAAK6J,CAAO,IAClCrxB,EAAM,CAAC,EAAE,SAAW,GAIxBrM,EAAO,KAAK,CAAE,MAAOqM,EAAM,MAAO,IAAKA,EAAM,MAAQA,EAAM,CAAC,EAAE,MAAM,CAAE,EAE1E,OAAOrM,CACX,CACA,gBAAgB2c,EAAO,CAEnB,GADAA,EAAQ,KAAK,eAAeA,CAAK,EAC7BA,EAAM,kBAAoBA,EAAM,cAChC,OAAO,KAAK,OAAOA,EAAM,gBAAkB,CAAC,EAAE,UAAUA,EAAM,YAAc,EAAGA,EAAM,UAAY,CAAC,EAEtG,MAAMq9B,EAAa,KAAK,KAClBC,EAAiBt9B,EAAM,gBAAkB,EACzCu9B,EAAev9B,EAAM,cAAgB,EACrCw9B,EAAc,CAAA,EACpBA,EAAY,KAAK,KAAK,OAAOF,CAAc,EAAE,UAAUt9B,EAAM,YAAc,CAAC,CAAC,EAC7E,QAAShc,EAAIs5C,EAAiB,EAAGt5C,EAAIu5C,EAAcv5C,IAC/Cw5C,EAAY,KAAK,KAAK,OAAOx5C,CAAC,CAAC,EAEnC,OAAAw5C,EAAY,KAAK,KAAK,OAAOD,CAAY,EAAE,UAAU,EAAGv9B,EAAM,UAAY,CAAC,CAAC,EACrEw9B,EAAY,KAAKH,CAAU,CACtC,CACA,SAASp9B,EAAU,CACf,OAAAA,EAAW,KAAK,kBAAkBA,CAAQ,EAC1C,KAAK,kBAAiB,EACf,KAAK,YAAY,aAAaA,EAAS,WAAa,CAAC,GAAKA,EAAS,OAAS,EACvF,CACA,WAAW5M,EAAQ,CACfA,EAAS,KAAK,MAAMA,CAAM,EAC1BA,EAAS,KAAK,IAAI,EAAGA,CAAM,EAC3B,KAAK,kBAAiB,EACtB,MAAMkY,EAAM,KAAK,YAAY,WAAWlY,CAAM,EACxC0lB,EAAa,KAAK,OAAOxN,EAAI,KAAK,EAAE,OAE1C,MAAO,CACH,WAAY,EAAIA,EAAI,MACpB,OAAQ,EAAI,KAAK,IAAIA,EAAI,UAAWwN,CAAU,CAC1D,CACI,CACA,eAAe/Y,EAAO,CAClB,MAAMY,EAAQ,KAAK,kBAAkB,CAAE,WAAYZ,EAAM,gBAAiB,OAAQA,EAAM,YAAa,EAC/F3Q,EAAM,KAAK,kBAAkB,CAAE,WAAY2Q,EAAM,cAAe,OAAQA,EAAM,UAAW,EAC/F,OAAIY,EAAM,aAAeZ,EAAM,iBACxBY,EAAM,SAAWZ,EAAM,aACvB3Q,EAAI,aAAe2Q,EAAM,eACzB3Q,EAAI,SAAW2Q,EAAM,UACjB,CACH,gBAAiBY,EAAM,WACvB,YAAaA,EAAM,OACnB,cAAevR,EAAI,WACnB,UAAWA,EAAI,MAC/B,EAEe2Q,CACX,CACA,kBAAkBC,EAAU,CACxB,GAAI,CAACpB,EAAS,YAAYoB,CAAQ,EAC9B,MAAM,IAAI,MAAM,cAAc,EAElC,GAAI,CAAE,WAAAnB,EAAY,OAAAC,CAAM,EAAKkB,EACzBw9B,EAAa,GACjB,GAAI3+B,EAAa,EACbA,EAAa,EACbC,EAAS,EACT0+B,EAAa,WAER3+B,EAAa,KAAK,OAAO,OAC9BA,EAAa,KAAK,OAAO,OACzBC,EAAS,KAAK,OAAOD,EAAa,CAAC,EAAE,OAAS,EAC9C2+B,EAAa,OAEZ,CACD,MAAMC,EAAe,KAAK,OAAO5+B,EAAa,CAAC,EAAE,OAAS,EACtDC,EAAS,GACTA,EAAS,EACT0+B,EAAa,IAER1+B,EAAS2+B,IACd3+B,EAAS2+B,EACTD,EAAa,GAErB,CACA,OAAKA,EAIM,CAAE,WAAA3+B,EAAY,OAAAC,CAAM,EAHpBkB,CAKf,CACJ,CC7RA,MAAM09B,GAAN,MAAMA,EAAa,CACf,YAAYC,EAAiB,KAAM,CAC/B,KAAK,eAAiBA,EACtB,KAAK,qBAAuB,OAC5B,KAAK,2BAA6B,IAAIlB,EAC1C,CACA,SAAU,CACV,CACA,MAAM,OAAQ,CACV,MAAO,MACX,CACA,UAAU9uB,EAAK,CACX,OAAO,KAAK,2BAA2B,SAASA,CAAG,CACvD,CACA,WAAY,CACR,OAAO,KAAK,2BAA2B,UAAS,CACpD,CACA,gBAAgB/d,EAAM,CAClB,KAAK,2BAA2B,gBAAgBA,CAAI,CACxD,CACA,oBAAoB+d,EAAKnrB,EAAG,CACxB,KAAK,2BAA2B,oBAAoBmrB,EAAKnrB,CAAC,CAC9D,CACA,oBAAoBmrB,EAAK,CACrB,KAAK,2BAA2B,oBAAoBA,CAAG,CAC3D,CACA,MAAM,0BAA0BiwB,EAAK3zC,EAAS8V,EAAO,CACjD,MAAMqD,EAAQ,KAAK,UAAUw6B,CAAG,EAChC,OAAKx6B,EAGE0U,GAA4B,yBAAyB1U,EAAOnZ,EAAS8V,CAAK,EAFtE,CAAE,OAAQ,GAAI,QAAS,GAAO,wBAAyB,EAAG,wBAAyB,EAAG,4BAA6B,CAAC,CAGnI,CACA,MAAM,oBAAoB69B,EAAK3zC,EAAS,CACpC,MAAMmZ,EAAQ,KAAK,UAAUw6B,CAAG,EAChC,OAAKx6B,EAGE81B,GAAmB91B,EAAOnZ,CAAO,EAF7B,CAAA,CAGf,CAEA,MAAM,aAAa4zC,EAAaC,EAAa7zC,EAAS8zC,EAAW,CAC7D,MAAMnmC,EAAW,KAAK,UAAUimC,CAAW,EACrChmC,EAAW,KAAK,UAAUimC,CAAW,EAC3C,MAAI,CAAClmC,GAAY,CAACC,EACP,KAEI6lC,GAAa,YAAY9lC,EAAUC,EAAU5N,EAAS8zC,CAAS,CAElF,CACA,OAAO,YAAYC,EAAmBC,EAAmBh0C,EAAS8zC,EAAW,CACzE,MAAMG,EAAgBH,IAAc,WAAa/J,GAAmB,WAAU,EAAKA,GAAmB,UAAS,EACzG3S,EAAgB2c,EAAkB,gBAAe,EACjD1c,EAAgB2c,EAAkB,gBAAe,EACjD76C,EAAS86C,EAAc,YAAY7c,EAAeC,EAAer3B,CAAO,EACxEk0C,EAAa/6C,EAAO,QAAQ,OAAS,EAAI,GAAQ,KAAK,oBAAoB46C,EAAmBC,CAAiB,EACpH,SAASG,EAAevkC,EAAS,CAC7B,OAAOA,EAAQ,IAAI,GAAM,CAAC,EAAE,SAAS,gBAAiB,EAAE,SAAS,uBAAwB,EAAE,SAAS,gBAAiB,EAAE,SAAS,uBAAwB,EAAE,cAAc,IAAI8c,GAAK,CACzKA,EAAE,cAAc,gBAChBA,EAAE,cAAc,YAChBA,EAAE,cAAc,cAChBA,EAAE,cAAc,UAChBA,EAAE,cAAc,gBAChBA,EAAE,cAAc,YAChBA,EAAE,cAAc,cAChBA,EAAE,cAAc,SACpC,CAAiB,CAAC,CAAE,CACZ,CACA,MAAO,CACH,UAAAwnB,EACA,UAAW/6C,EAAO,WAClB,QAASg7C,EAAeh7C,EAAO,OAAO,EACtC,MAAOA,EAAO,MAAM,IAAIuzB,GAAM,CAC1BA,EAAE,iBAAiB,SAAS,gBAC5BA,EAAE,iBAAiB,SAAS,uBAC5BA,EAAE,iBAAiB,SAAS,gBAC5BA,EAAE,iBAAiB,SAAS,uBAC5BynB,EAAeznB,EAAE,OAAO,CACxC,CAAc,CACd,CACI,CACA,OAAO,oBAAoB/e,EAAUC,EAAU,CAC3C,MAAMsoB,EAAoBvoB,EAAS,aAAY,EACzCwoB,EAAoBvoB,EAAS,aAAY,EAC/C,GAAIsoB,IAAsBC,EACtB,MAAO,GAEX,QAAStd,EAAO,EAAGA,GAAQqd,EAAmBrd,IAAQ,CAClD,MAAMqiB,EAAevtB,EAAS,eAAekL,CAAI,EAC3CsiB,EAAevtB,EAAS,eAAeiL,CAAI,EACjD,GAAIqiB,IAAiBC,EACjB,MAAO,EAEf,CACA,MAAO,EACX,CAIA,MAAM,yBAAyBiZ,EAAU/f,EAAOxmB,EAAQ,CACpD,MAAMsL,EAAQ,KAAK,UAAUi7B,CAAQ,EACrC,GAAI,CAACj7B,EACD,OAAOkb,EAEX,MAAMl7B,EAAS,CAAA,EACf,IAAIk7C,EACJhgB,EAAQA,EAAM,MAAM,CAAC,EAAE,KAAK,CAACt6B,EAAGC,IAAM,CAClC,GAAID,EAAE,OAASC,EAAE,MACb,OAAOyb,EAAM,yBAAyB1b,EAAE,MAAOC,EAAE,KAAK,EAG1D,MAAMs6C,EAAOv6C,EAAE,MAAQ,EAAI,EACrBw6C,EAAOv6C,EAAE,MAAQ,EAAI,EAC3B,OAAOs6C,EAAOC,CAClB,CAAC,EAED,IAAIC,EAAa,EACjB,QAASC,EAAY,EAAGA,EAAYpgB,EAAM,OAAQogB,IAC1Ch/B,EAAM,eAAe4e,EAAMmgB,CAAU,EAAE,KAAK,EAAE,OAAO/+B,EAAM,iBAAiB4e,EAAMogB,CAAS,EAAE,KAAK,CAAC,GACnGpgB,EAAMmgB,CAAU,EAAE,MAAQ/+B,EAAM,cAAcA,EAAM,iBAAiB4e,EAAMmgB,CAAU,EAAE,KAAK,EAAG/+B,EAAM,eAAe4e,EAAMogB,CAAS,EAAE,KAAK,CAAC,EAC3IpgB,EAAMmgB,CAAU,EAAE,MAAQngB,EAAMogB,CAAS,EAAE,OAG3CD,IACAngB,EAAMmgB,CAAU,EAAIngB,EAAMogB,CAAS,GAG3CpgB,EAAM,OAASmgB,EAAa,EAC5B,OAAS,CAAE,MAAA1+B,EAAO,KAAAsE,EAAM,IAAA23B,CAAG,IAAM1d,EAAO,CAIpC,GAHI,OAAO0d,GAAQ,WACfsC,EAAUtC,GAEVt8B,EAAM,QAAQK,CAAK,GAAK,CAACsE,EAEzB,SAEJ,MAAMzM,EAAWwL,EAAM,gBAAgBrD,CAAK,EAE5C,GADAsE,EAAOA,EAAK,QAAQ,cAAejB,EAAM,GAAG,EACxCxL,IAAayM,EAEb,SAGJ,GAAI,KAAK,IAAIA,EAAK,OAAQzM,EAAS,MAAM,EAAI8lC,GAAa,WAAY,CAClEt6C,EAAO,KAAK,CAAE,MAAA2c,EAAO,KAAAsE,CAAI,CAAE,EAC3B,QACJ,CAEA,MAAMxK,EAAUlC,GAAWC,EAAUyM,EAAMvM,CAAM,EAC3C6mC,EAAav7B,EAAM,SAAS1D,EAAM,KAAKK,CAAK,EAAE,kBAAkB,EACtE,UAAW5D,KAAUtC,EAAS,CAC1B,MAAM8G,EAAQyC,EAAM,WAAWu7B,EAAaxiC,EAAO,aAAa,EAC1D/M,EAAMgU,EAAM,WAAWu7B,EAAaxiC,EAAO,cAAgBA,EAAO,cAAc,EAChFyiC,EAAU,CACZ,KAAMv6B,EAAK,OAAOlI,EAAO,cAAeA,EAAO,cAAc,EAC7D,MAAO,CAAE,gBAAiBwE,EAAM,WAAY,YAAaA,EAAM,OAAQ,cAAevR,EAAI,WAAY,UAAWA,EAAI,MAAM,CAC/I,EACoBgU,EAAM,gBAAgBw7B,EAAQ,KAAK,IAAMA,EAAQ,MACjDx7C,EAAO,KAAKw7C,CAAO,CAE3B,CACJ,CACA,OAAI,OAAON,GAAY,UACnBl7C,EAAO,KAAK,CAAE,IAAKk7C,EAAS,KAAM,GAAI,MAAO,CAAE,gBAAiB,EAAG,YAAa,EAAG,cAAe,EAAG,UAAW,CAAC,EAAI,EAElHl7C,CACX,CAEA,MAAM,cAAci7C,EAAU,CAC1B,MAAMj7B,EAAQ,KAAK,UAAUi7B,CAAQ,EACrC,OAAKj7B,EAGEU,GAAaV,CAAK,EAFd,IAGf,CAEA,MAAM,8BAA8Bi7B,EAAU,CAC1C,MAAMj7B,EAAQ,KAAK,UAAUi7B,CAAQ,EACrC,OAAKj7B,EAGE01B,GAA6B11B,CAAK,EAF9B,IAGf,CAGA,MAAM,gBAAgBy7B,EAAWC,EAAaC,EAASC,EAAc,CACjE,MAAMC,EAAK,IAAIr2C,GACTs2C,EAAgB,IAAI,OAAOH,EAASC,CAAY,EAChDG,EAAO,IAAI,IACjBC,EAAO,UAAWxB,KAAOiB,EAAW,CAChC,MAAMz7B,EAAQ,KAAK,UAAUw6B,CAAG,EAChC,GAAKx6B,GAGL,UAAW6V,KAAQ7V,EAAM,MAAM87B,CAAa,EACxC,GAAI,EAAAjmB,IAAS6lB,GAAe,CAAC,MAAM,OAAO7lB,CAAI,CAAC,KAG/CkmB,EAAK,IAAIlmB,CAAI,EACTkmB,EAAK,KAAOzB,GAAa,mBACzB,MAAM0B,EAGlB,CACA,MAAO,CAAE,MAAO,MAAM,KAAKD,CAAI,EAAG,SAAUF,EAAG,SAAS,CAC5D,CAGA,MAAM,mBAAmBZ,EAAUt+B,EAAOg/B,EAASC,EAAc,CAC7D,MAAM57B,EAAQ,KAAK,UAAUi7B,CAAQ,EACrC,GAAI,CAACj7B,EACD,OAAO,OAAO,OAAO,IAAI,EAE7B,MAAM87B,EAAgB,IAAI,OAAOH,EAASC,CAAY,EAChD57C,EAAS,OAAO,OAAO,IAAI,EACjC,QAAS0f,EAAO/C,EAAM,gBAAiB+C,EAAO/C,EAAM,cAAe+C,IAAQ,CACvE,MAAMq6B,EAAQ/5B,EAAM,aAAaN,EAAMo8B,CAAa,EACpD,UAAWjmB,KAAQkkB,EAAO,CACtB,GAAI,CAAC,MAAM,OAAOlkB,EAAK,IAAI,CAAC,EACxB,SAEJ,IAAI/zB,EAAQ9B,EAAO61B,EAAK,IAAI,EACvB/zB,IACDA,EAAQ,CAAA,EACR9B,EAAO61B,EAAK,IAAI,EAAI/zB,GAExBA,EAAM,KAAK,CACP,gBAAiB4d,EACjB,YAAamW,EAAK,YAClB,cAAenW,EACf,UAAWmW,EAAK,SACpC,CAAiB,CACL,CACJ,CACA,OAAO71B,CACX,CAEA,MAAM,kBAAkBi7C,EAAUt+B,EAAOqE,EAAI26B,EAASC,EAAc,CAChE,MAAM57B,EAAQ,KAAK,UAAUi7B,CAAQ,EACrC,GAAI,CAACj7B,EACD,OAAO,KAEX,MAAM87B,EAAgB,IAAI,OAAOH,EAASC,CAAY,EAClDj/B,EAAM,cAAgBA,EAAM,YAC5BA,EAAQ,CACJ,gBAAiBA,EAAM,gBACvB,YAAaA,EAAM,YACnB,cAAeA,EAAM,cACrB,UAAWA,EAAM,UAAY,CAC7C,GAEQ,MAAMs/B,EAAgBj8B,EAAM,gBAAgBrD,CAAK,EAC3Cu/B,EAAYl8B,EAAM,kBAAkB,CAAE,WAAYrD,EAAM,gBAAiB,OAAQA,EAAM,WAAW,EAAIm/B,CAAa,EACzH,GAAI,CAACI,EACD,OAAO,KAEX,MAAMrmB,EAAO7V,EAAM,gBAAgBk8B,CAAS,EAE5C,OADez6B,GAAoB,SAAS,iBAAiB9E,EAAOs/B,EAAeC,EAAWrmB,EAAM7U,CAAE,CAE1G,CAGA,KAAKpP,EAAQ1I,EAAM,CACf,GAAI,CAAC,KAAK,gBAAkB,OAAO,KAAK,eAAe0I,CAAM,GAAM,WAC/D,OAAO,QAAQ,OAAO,IAAI,MAAM,qCAAuCA,CAAM,CAAC,EAElF,GAAI,CACA,OAAO,QAAQ,QAAQ,KAAK,eAAeA,CAAM,EAAE,MAAM,KAAK,eAAgB1I,CAAI,CAAC,CACvF,OACO9J,EAAG,CACN,OAAO,QAAQ,OAAOA,CAAC,CAC3B,CACJ,CACJ,EA/Kak7C,GAAK,WAAa,IAsFlBA,GAAK,kBAAoB,IAxLtC,IAAM6B,GAAN7B,GAkRI,OAAO,eAAkB,aAEzB,WAAW,OAAShpB,GAAmB,GCnS3C,MAAM8qB,GAAN,MAAMA,EAAiB,CAEnB,OAAO,WAAW5oC,EAAc,CAC5B,OAAOA,EAAa,WAAW4oC,GAAiB,YAAY,CAChE,CACA,OAAO,WAAWC,EAAcp7C,EAAK,CACjCo7C,EAAa,WAAWD,GAAiB,aAAcn7C,CAAG,CAC9D,CACJ,EAPam7C,GAAK,aAAe,mBADjC,IAAME,GAANF,GCSA,SAAS7+B,GAAMg/B,EAAc,CACzB,IAAIC,EACJ,MAAMjpC,EAAkBF,GAAYG,GAAiB,CACjD,MAAMipC,EAAmBH,GAAiB,WAAW9oC,CAAY,EAe3DkpC,EAAM,CACR,KAfS,IAAI,MAAM,GAAI,CACvB,IAAIrqC,EAAQsqC,EAAMC,EAAU,CACxB,GAAID,IAAS,OAIb,IAAI,OAAOA,GAAS,SAChB,MAAM,IAAI,MAAM,eAAe,EAEnC,MAAO,IAAIzzC,IACAuzC,EAAiB,KAAKE,EAAMzzC,CAAI,EAE/C,CACZ,CAAS,EAGG,gBAAiB,IACNqK,EAAgB,eAAe,UAAS,CAE/D,EACQ,OAAAipC,EAASD,EAAaG,CAAG,EAClB,IAAIP,GAAaK,CAAM,CAClC,CAAC,EACD,OAAOA,CACX,CCnCA,SAASnpC,GAAW9H,EAAU,CAE5B,KAAK,UAAagoB,GAAM,CACtBhW,GAAOm/B,GACEnxC,EAASmxC,EAAKnpB,EAAE,IAAI,CAC5B,CACH,CACF,CCLA,SAASspB,GAAc57B,EAAM67B,EAAe,GAAO,CAC/C,MAAMhvC,EAAMmT,EAAK,OACjB,IAAI7E,EAAM,EAAGjc,EAAQ,GAAI48C,EAAc,EAAGC,EAAQ,GAA6BvhC,EAAa,EAAGmrB,EAAkB,EAAGqW,EAAuB,EAAGC,EAA2B,EAAGC,EAAY,EACxL,SAASC,EAAcp6C,EAAOq6C,EAAO,CACjC,IAAIC,EAAS,EACTn9C,EAAQ,EACZ,KAAOm9C,EAASt6C,GAAgB,CAC5B,IAAIu6C,EAAKt8B,EAAK,WAAW7E,CAAG,EAC5B,GAAImhC,GAAM,IAA8BA,GAAM,GAC1Cp9C,EAAQA,EAAQ,GAAKo9C,EAAK,WAErBA,GAAM,IAA6BA,GAAM,GAC9Cp9C,EAAQA,EAAQ,GAAKo9C,EAAK,GAA4B,WAEjDA,GAAM,IAA6BA,GAAM,IAC9Cp9C,EAAQA,EAAQ,GAAKo9C,EAAK,GAA4B,OAGtD,OAEJnhC,IACAkhC,GACJ,CACA,OAAIA,EAASt6C,IACT7C,EAAQ,IAELA,CACX,CACA,SAASq9C,EAAYC,EAAa,CAC9BrhC,EAAMqhC,EACNt9C,EAAQ,GACR48C,EAAc,EACdC,EAAQ,GACRG,EAAY,CAChB,CACA,SAASO,GAAa,CAClB,IAAIngC,EAAQnB,EACZ,GAAI6E,EAAK,WAAW7E,CAAG,IAAM,GACzBA,QAIA,KADAA,IACOA,EAAM6E,EAAK,QAAU08B,GAAQ18B,EAAK,WAAW7E,CAAG,CAAC,GACpDA,IAGR,GAAIA,EAAM6E,EAAK,QAAUA,EAAK,WAAW7E,CAAG,IAAM,GAE9C,GADAA,IACIA,EAAM6E,EAAK,QAAU08B,GAAQ18B,EAAK,WAAW7E,CAAG,CAAC,EAEjD,IADAA,IACOA,EAAM6E,EAAK,QAAU08B,GAAQ18B,EAAK,WAAW7E,CAAG,CAAC,GACpDA,QAIJ,QAAA+gC,EAAY,EACLl8B,EAAK,UAAU1D,EAAOnB,CAAG,EAGxC,IAAIpQ,EAAMoQ,EACV,GAAIA,EAAM6E,EAAK,SAAWA,EAAK,WAAW7E,CAAG,IAAM,IAA6B6E,EAAK,WAAW7E,CAAG,IAAM,KAKrG,GAJAA,KACIA,EAAM6E,EAAK,QAAUA,EAAK,WAAW7E,CAAG,IAAM,IAAgC6E,EAAK,WAAW7E,CAAG,IAAM,KACvGA,IAEAA,EAAM6E,EAAK,QAAU08B,GAAQ18B,EAAK,WAAW7E,CAAG,CAAC,EAAG,CAEpD,IADAA,IACOA,EAAM6E,EAAK,QAAU08B,GAAQ18B,EAAK,WAAW7E,CAAG,CAAC,GACpDA,IAEJpQ,EAAMoQ,CACV,MAEI+gC,EAAY,EAGpB,OAAOl8B,EAAK,UAAU1D,EAAOvR,CAAG,CACpC,CACA,SAAS4xC,GAAa,CAClB,IAAI59C,EAAS,GAAIud,EAAQnB,EACzB,OAAa,CACT,GAAIA,GAAOtO,EAAK,CACZ9N,GAAUihB,EAAK,UAAU1D,EAAOnB,CAAG,EACnC+gC,EAAY,EACZ,KACJ,CACA,MAAMI,EAAKt8B,EAAK,WAAW7E,CAAG,EAC9B,GAAImhC,IAAO,GAAqC,CAC5Cv9C,GAAUihB,EAAK,UAAU1D,EAAOnB,CAAG,EACnCA,IACA,KACJ,CACA,GAAImhC,IAAO,GAAmC,CAG1C,GAFAv9C,GAAUihB,EAAK,UAAU1D,EAAOnB,CAAG,EACnCA,IACIA,GAAOtO,EAAK,CACZqvC,EAAY,EACZ,KACJ,CAEA,OADYl8B,EAAK,WAAW7E,GAAK,EACtB,CACP,IAAK,IACDpc,GAAU,IACV,MACJ,IAAK,IACDA,GAAU,KACV,MACJ,IAAK,IACDA,GAAU,IACV,MACJ,IAAK,IACDA,GAAU,KACV,MACJ,IAAK,KACDA,GAAU,KACV,MACJ,IAAK,KACDA,GAAU;AAAA,EACV,MACJ,IAAK,KACDA,GAAU,KACV,MACJ,IAAK,KACDA,GAAU,IACV,MACJ,IAAK,KACD,MAAM69C,EAAMT,EAAc,CAAC,EACvBS,GAAO,EACP79C,GAAU,OAAO,aAAa69C,CAAG,EAGjCV,EAAY,EAEhB,MACJ,QACIA,EAAY,CACpC,CACgB5/B,EAAQnB,EACR,QACJ,CACA,GAAImhC,GAAM,GAAKA,GAAM,GACjB,GAAIO,GAAYP,CAAE,EAAG,CACjBv9C,GAAUihB,EAAK,UAAU1D,EAAOnB,CAAG,EACnC+gC,EAAY,EACZ,KACJ,MAEIA,EAAY,EAIpB/gC,GACJ,CACA,OAAOpc,CACX,CACA,SAAS+9C,GAAW,CAMhB,GALA59C,EAAQ,GACRg9C,EAAY,EACZJ,EAAc3gC,EACdwqB,EAAkBnrB,EAClByhC,EAA2BD,EACvB7gC,GAAOtO,EAEP,OAAAivC,EAAcjvC,EACPkvC,EAAQ,GAEnB,IAAI5tC,EAAO6R,EAAK,WAAW7E,CAAG,EAE9B,GAAI4hC,GAAa5uC,CAAI,EAAG,CACpB,GACIgN,IACAjc,GAAS,OAAO,aAAaiP,CAAI,EACjCA,EAAO6R,EAAK,WAAW7E,CAAG,QACrB4hC,GAAa5uC,CAAI,GAC1B,OAAO4tC,EAAQ,EACnB,CAEA,GAAIc,GAAY1uC,CAAI,EAChB,OAAAgN,IACAjc,GAAS,OAAO,aAAaiP,CAAI,EAC7BA,IAAS,IAA0C6R,EAAK,WAAW7E,CAAG,IAAM,KAC5EA,IACAjc,GAAS;AAAA,GAEbsb,IACAwhC,EAAuB7gC,EAChB4gC,EAAQ,GAEnB,OAAQ5tC,EAAI,CAER,IAAK,KACD,OAAAgN,IACO4gC,EAAQ,EACnB,IAAK,KACD,OAAA5gC,IACO4gC,EAAQ,EACnB,IAAK,IACD,OAAA5gC,IACO4gC,EAAQ,EACnB,IAAK,IACD,OAAA5gC,IACO4gC,EAAQ,EACnB,IAAK,IACD,OAAA5gC,IACO4gC,EAAQ,EACnB,IAAK,IACD,OAAA5gC,IACO4gC,EAAQ,EAEnB,IAAK,IACD,OAAA5gC,IACAjc,EAAQy9C,EAAU,EACXZ,EAAQ,GAEnB,IAAK,IACD,MAAMz/B,EAAQnB,EAAM,EAEpB,GAAI6E,EAAK,WAAW7E,EAAM,CAAC,IAAM,GAA+B,CAE5D,IADAA,GAAO,EACAA,EAAMtO,GACL,CAAAgwC,GAAY78B,EAAK,WAAW7E,CAAG,CAAC,GAGpCA,IAEJ,OAAAjc,EAAQ8gB,EAAK,UAAU1D,EAAOnB,CAAG,EAC1B4gC,EAAQ,EACnB,CAEA,GAAI/7B,EAAK,WAAW7E,EAAM,CAAC,IAAM,GAAkC,CAC/DA,GAAO,EACP,MAAM6hC,EAAanwC,EAAM,EACzB,IAAIowC,EAAgB,GACpB,KAAO9hC,EAAM6hC,GAAY,CACrB,MAAMV,EAAKt8B,EAAK,WAAW7E,CAAG,EAC9B,GAAImhC,IAAO,IAAoCt8B,EAAK,WAAW7E,EAAM,CAAC,IAAM,GAA+B,CACvGA,GAAO,EACP8hC,EAAgB,GAChB,KACJ,CACA9hC,IACI0hC,GAAYP,CAAE,IACVA,IAAO,IAA0Ct8B,EAAK,WAAW7E,CAAG,IAAM,IAC1EA,IAEJX,IACAwhC,EAAuB7gC,EAE/B,CACA,OAAK8hC,IACD9hC,IACA+gC,EAAY,GAEhBh9C,EAAQ8gB,EAAK,UAAU1D,EAAOnB,CAAG,EAC1B4gC,EAAQ,EACnB,CAEA,OAAA78C,GAAS,OAAO,aAAaiP,CAAI,EACjCgN,IACO4gC,EAAQ,GAEnB,IAAK,IAGD,GAFA78C,GAAS,OAAO,aAAaiP,CAAI,EACjCgN,IACIA,IAAQtO,GAAO,CAAC6vC,GAAQ18B,EAAK,WAAW7E,CAAG,CAAC,EAC5C,OAAO4gC,EAAQ,GAKvB,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACD,OAAA78C,GAASu9C,EAAU,EACZV,EAAQ,GAEnB,QAEI,KAAO5gC,EAAMtO,GAAOqwC,EAA0B/uC,CAAI,GAC9CgN,IACAhN,EAAO6R,EAAK,WAAW7E,CAAG,EAE9B,GAAI2gC,IAAgB3gC,EAAK,CAGrB,OAFAjc,EAAQ8gB,EAAK,UAAU87B,EAAa3gC,CAAG,EAE/Bjc,EAAK,CACT,IAAK,OAAQ,OAAO68C,EAAQ,EAC5B,IAAK,QAAS,OAAOA,EAAQ,EAC7B,IAAK,OAAQ,OAAOA,EAAQ,CACpD,CACoB,OAAOA,EAAQ,EACnB,CAEA,OAAA78C,GAAS,OAAO,aAAaiP,CAAI,EACjCgN,IACO4gC,EAAQ,EAC/B,CACI,CACA,SAASmB,EAA0B/uC,EAAM,CACrC,GAAI4uC,GAAa5uC,CAAI,GAAK0uC,GAAY1uC,CAAI,EACtC,MAAO,GAEX,OAAQA,EAAI,CACR,IAAK,KACL,IAAK,IACL,IAAK,KACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACD,MAAO,EACvB,CACQ,MAAO,EACX,CACA,SAASgvC,GAAoB,CACzB,IAAIp+C,EACJ,GACIA,EAAS+9C,EAAQ,QACZ/9C,GAAU,IAAyCA,GAAU,IACtE,OAAOA,CACX,CACA,MAAO,CACH,YAAaw9C,EACb,YAAa,IAAMphC,EACnB,KAAM0gC,EAAesB,EAAoBL,EACzC,SAAU,IAAMf,EAChB,cAAe,IAAM78C,EACrB,eAAgB,IAAM48C,EACtB,eAAgB,IAAM3gC,EAAM2gC,EAC5B,kBAAmB,IAAMnW,EACzB,uBAAwB,IAAMmW,EAAcG,EAC5C,cAAe,IAAMC,CAC7B,CACA,CACA,SAASa,GAAaT,EAAI,CACtB,OAAOA,IAAO,IAAiCA,IAAO,CAC1D,CACA,SAASO,GAAYP,EAAI,CACrB,OAAOA,IAAO,IAAoCA,IAAO,EAC7D,CACA,SAASI,GAAQJ,EAAI,CACjB,OAAOA,GAAM,IAA8BA,GAAM,EACrD,CACA,IAAIc,IACH,SAAUA,EAAgB,CACvBA,EAAeA,EAAe,SAAc,EAAE,EAAI,WAClDA,EAAeA,EAAe,eAAoB,EAAE,EAAI,iBACxDA,EAAeA,EAAe,MAAW,EAAE,EAAI,QAC/CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,GAAQ,EAAE,EAAI,KAC5CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,GAAG,EAAI,IAC5CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,EAAO,EAAE,EAAI,IAC3CA,EAAeA,EAAe,SAAc,EAAE,EAAI,WAClDA,EAAeA,EAAe,UAAe,EAAE,EAAI,YACnDA,EAAeA,EAAe,WAAgB,GAAG,EAAI,aACrDA,EAAeA,EAAe,aAAkB,EAAE,EAAI,eACtDA,EAAeA,EAAe,MAAW,EAAE,EAAI,QAC/CA,EAAeA,EAAe,MAAW,EAAE,EAAI,QAC/CA,EAAeA,EAAe,IAAS,EAAE,EAAI,MAC7CA,EAAeA,EAAe,YAAiB,EAAE,EAAI,cACrDA,EAAeA,EAAe,MAAW,EAAE,EAAI,QAC/CA,EAAeA,EAAe,UAAe,GAAG,EAAI,YACpDA,EAAeA,EAAe,YAAiB,EAAE,EAAI,cACrDA,EAAeA,EAAe,KAAU,EAAE,EAAI,OAC9CA,EAAeA,EAAe,MAAW,EAAE,EAAI,QAC/CA,EAAeA,EAAe,SAAc,EAAE,EAAI,WAClDA,EAAeA,EAAe,IAAS,CAAC,EAAI,KAChD,GAAGA,KAAmBA,GAAiB,CAAA,EAAG,ECzb1C,MAAMC,GAAe,IAAI,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAACr7C,EAAGV,IACxC,IAAI,OAAOA,CAAK,CAC1B,EACKg8C,GAAkB,IAClBC,GAA6B,CAC/B,IAAK,CACD,KAAM,IAAI,MAAMD,EAAe,EAAE,KAAK,CAAC,EAAE,IAAI,CAACt7C,EAAGV,IACtC;AAAA,EAAO,IAAI,OAAOA,CAAK,CACjC,EACD,KAAM,IAAI,MAAMg8C,EAAe,EAAE,KAAK,CAAC,EAAE,IAAI,CAACt7C,EAAGV,IACtC,KAAO,IAAI,OAAOA,CAAK,CACjC,EACD,OAAQ,IAAI,MAAMg8C,EAAe,EAAE,KAAK,CAAC,EAAE,IAAI,CAACt7C,EAAGV,IACxC;AAAA,EAAS,IAAI,OAAOA,CAAK,CACnC,CACT,EACI,IAAM,CACF,KAAM,IAAI,MAAMg8C,EAAe,EAAE,KAAK,CAAC,EAAE,IAAI,CAACt7C,EAAGV,IACtC;AAAA,EAAO,IAAK,OAAOA,CAAK,CAClC,EACD,KAAM,IAAI,MAAMg8C,EAAe,EAAE,KAAK,CAAC,EAAE,IAAI,CAACt7C,EAAGV,IACtC,KAAO,IAAK,OAAOA,CAAK,CAClC,EACD,OAAQ,IAAI,MAAMg8C,EAAe,EAAE,KAAK,CAAC,EAAE,IAAI,CAACt7C,EAAGV,IACxC;AAAA,EAAS,IAAK,OAAOA,CAAK,CACpC,CACT,CACA,EACMk8C,GAAgB,CAAC;AAAA,EAAM,KAAM;AAAA,CAAM,ECrBzC,SAAS9K,GAAO+K,EAAc/hC,EAAO9V,EAAS,CAC1C,IAAI83C,EACAC,EACAC,EACAC,EACAC,EACJ,GAAIpiC,EAAO,CAIP,IAHAmiC,EAAaniC,EAAM,OACnBoiC,EAAWD,EAAaniC,EAAM,OAC9BkiC,EAAkBC,EACXD,EAAkB,GAAK,CAACG,GAAMN,EAAcG,EAAkB,CAAC,GAClEA,IAEJ,IAAII,EAAYF,EAChB,KAAOE,EAAYP,EAAa,QAAU,CAACM,GAAMN,EAAcO,CAAS,GACpEA,IAEJL,EAAaF,EAAa,UAAUG,EAAiBI,CAAS,EAC9DN,EAAqBO,GAAmBN,EAAY/3C,CAAO,CAC/D,MAEI+3C,EAAaF,EACbC,EAAqB,EACrBE,EAAkB,EAClBC,EAAa,EACbC,EAAWL,EAAa,OAE5B,MAAM9F,EAAMuG,GAAOt4C,EAAS63C,CAAY,EAClCU,EAAuBX,GAAc,SAAS7F,CAAG,EACvD,IAAIyG,EAAmB,EACnBC,EAAc,EACdC,EACA14C,EAAQ,aACR04C,EAAcjB,GAAaz3C,EAAQ,SAAW,CAAC,GAAK24C,GAAOlB,GAAa,CAAC,EAAGz3C,EAAQ,SAAW,CAAC,EAGhG04C,EAAc,IAElB,MAAME,EAAaF,IAAgB,IAAO,IAAO,IACjD,IAAIG,EAAU7C,GAAc+B,EAAY,EAAK,EACzCe,EAAW,GACf,SAASC,GAAoB,CACzB,GAAIP,EAAmB,EACnB,OAAOG,GAAO5G,EAAKyG,CAAgB,EAAIG,GAAOD,EAAaZ,EAAqBW,CAAW,EAE/F,MAAMO,EAAiBN,EAAY,QAAUZ,EAAqBW,GAClE,MAAI,CAACF,GAAwBS,EAAiBrB,GAA2BiB,CAAU,EAAE7G,CAAG,EAAE,OAC/EA,EAAM4G,GAAOD,EAAaZ,EAAqBW,CAAW,EAEjEO,GAAkB,EACXjH,EAEJ4F,GAA2BiB,CAAU,EAAE7G,CAAG,EAAEiH,CAAc,CACrE,CACA,SAAS9B,GAAW,CAChB,IAAIf,EAAQ0C,EAAQ,KAAI,EAExB,IADAL,EAAmB,EACZrC,IAAU,IAA8BA,IAAU,IACjDA,IAAU,IAAuCn2C,EAAQ,UACzDw4C,GAAoB,EAEfrC,IAAU,KACfqC,EAAmB,GAEvBrC,EAAQ0C,EAAQ,KAAI,EAExB,OAAAC,EAAW3C,IAAU,IAA+B0C,EAAQ,cAAa,IAAO,EACzE1C,CACX,CACA,MAAM8C,EAAiB,CAAA,EACvB,SAASC,EAAQ9+B,EAAM++B,EAAaf,EAAW,CACvC,CAACU,IAAa,CAAChjC,GAAUqjC,EAAcjB,GAAYE,EAAYH,IAAgBJ,EAAa,UAAUsB,EAAaf,CAAS,IAAMh+B,GAClI6+B,EAAe,KAAK,CAAE,OAAQE,EAAa,OAAQf,EAAYe,EAAa,QAAS/+B,EAAM,CAEnG,CACA,IAAIg/B,EAAalC,EAAQ,EAIzB,GAHIl3C,EAAQ,WAAaw4C,EAAmB,GACxCU,EAAQP,GAAO5G,EAAKyG,CAAgB,EAAG,EAAG,CAAC,EAE3CY,IAAe,GAAyB,CACxC,IAAIC,EAAkBR,EAAQ,eAAc,EAAKb,EAC7CsB,EAAiBZ,EAAY,OAASZ,EAAqB,IAAO93C,EAAQ,aACxEy3C,GAAaiB,EAAY,OAASZ,CAAkB,EACpDa,GAAOD,EAAaZ,CAAkB,EAC5CoB,EAAQI,EAAetB,EAAiBqB,CAAe,CAC3D,CACA,KAAOD,IAAe,IAAyB,CAC3C,IAAIG,EAAgBV,EAAQ,eAAc,EAAKA,EAAQ,eAAc,EAAKb,EACtEwB,EAActC,EAAQ,EACtBuC,EAAiB,GACjBC,EAAiB,GACrB,KAAOlB,IAAqB,IAAMgB,IAAgB,IAAyCA,IAAgB,KAAyC,CAChJ,IAAIG,EAAoBd,EAAQ,eAAc,EAAKb,EACnDkB,EAAQzB,GAAa,CAAC,EAAG8B,EAAeI,CAAiB,EACzDJ,EAAgBV,EAAQ,eAAc,EAAKA,EAAQ,eAAc,EAAKb,EACtE0B,EAAiBF,IAAgB,GACjCC,EAAiBC,EAAiBX,EAAiB,EAAK,GACxDS,EAActC,EAAQ,CAC1B,CACA,GAAIsC,IAAgB,EACZJ,IAAe,GACfX,IAEAz4C,EAAQ,WAAaw4C,EAAmB,GAAK,CAACx4C,EAAQ,WAAao5C,IAAe,EAClFK,EAAiBV,EAAiB,EAE7B/4C,EAAQ,YACby5C,EAAiBhC,GAAa,CAAC,WAG9B+B,IAAgB,EACjBJ,IAAe,GACfX,IAEAz4C,EAAQ,WAAaw4C,EAAmB,GAAK,CAACx4C,EAAQ,WAAao5C,IAAe,EAClFK,EAAiBV,EAAiB,EAE7B/4C,EAAQ,YACby5C,EAAiBhC,GAAa,CAAC,OAGlC,CACD,OAAQ2B,EAAU,CACd,IAAK,GACL,IAAK,GACDX,IACIz4C,EAAQ,WAAaw4C,EAAmB,GAAK,CAACx4C,EAAQ,UACtDy5C,EAAiBV,EAAiB,EAGlCU,EAAiBhC,GAAa,CAAC,EAEnC,MACJ,IAAK,GACGz3C,EAAQ,WAAaw4C,EAAmB,GAAK,CAACx4C,EAAQ,UACtDy5C,EAAiBV,EAAiB,EAGlCU,EAAiBhC,GAAa,CAAC,EAEnC,MACJ,IAAK,IACDgC,EAAiBV,EAAiB,EAClC,MACJ,IAAK,IACGP,EAAmB,EACnBiB,EAAiBV,EAAiB,EAE5BW,IACND,EAAiBhC,GAAa,CAAC,GAEnC,MACJ,IAAK,GACGz3C,EAAQ,WAAaw4C,EAAmB,EACxCiB,EAAiBV,EAAiB,EAE5BW,IACND,EAAiBhC,GAAa,CAAC,GAEnC,MACJ,IAAK,IACGz3C,EAAQ,WAAaw4C,EAAmB,EACxCiB,EAAiBV,EAAiB,EAE7BS,IAAgB,GAAiC,CAACE,IACvDD,EAAiB,IAErB,MACJ,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,IACL,IAAK,GACL,IAAK,GACGz5C,EAAQ,WAAaw4C,EAAmB,EACxCiB,EAAiBV,EAAiB,GAG7BS,IAAgB,IAAyCA,IAAgB,KAA2C,CAACE,EACtHD,EAAiBhC,GAAa,CAAC,EAE1B+B,IAAgB,GAAiCA,IAAgB,KACtEV,EAAW,IAGnB,MACJ,IAAK,IACDA,EAAW,GACX,KACpB,CACgBN,EAAmB,IAAMgB,IAAgB,IAAyCA,IAAgB,MAClGC,EAAiBV,EAAiB,EAE1C,CACIS,IAAgB,KACZx5C,EAAQ,WAAaw4C,EAAmB,EACxCiB,EAAiBV,EAAiB,EAGlCU,EAAiBz5C,EAAQ,mBAAqB+xC,EAAM,IAG5D,MAAM6H,EAAmBf,EAAQ,eAAc,EAAKb,EACpDkB,EAAQO,EAAgBF,EAAeK,CAAgB,EACvDR,EAAaI,CACjB,CACA,OAAOP,CACX,CACA,SAASN,GAAOtrC,EAAGlR,EAAO,CACtB,IAAIhD,EAAS,GACb,QAASW,EAAI,EAAGA,EAAIqC,EAAOrC,IACvBX,GAAUkU,EAEd,OAAOlU,CACX,CACA,SAASk/C,GAAmBxhB,EAAS72B,EAAS,CAC1C,IAAIlG,EAAI,EACJ+/C,EAAS,EACb,MAAMC,EAAU95C,EAAQ,SAAW,EACnC,KAAOlG,EAAI+8B,EAAQ,QAAQ,CACvB,IAAI6f,EAAK7f,EAAQ,OAAO/8B,CAAC,EACzB,GAAI48C,IAAOe,GAAa,CAAC,EACrBoC,YAEKnD,IAAO,IACZmD,GAAUC,MAGV,OAEJhgD,GACJ,CACA,OAAO,KAAK,MAAM+/C,EAASC,CAAO,CACtC,CACA,SAASxB,GAAOt4C,EAASoa,EAAM,CAC3B,QAAStgB,EAAI,EAAGA,EAAIsgB,EAAK,OAAQtgB,IAAK,CAClC,MAAM48C,EAAKt8B,EAAK,OAAOtgB,CAAC,EACxB,GAAI48C,IAAO,KACP,OAAI58C,EAAI,EAAIsgB,EAAK,QAAUA,EAAK,OAAOtgB,EAAI,CAAC,IAAM;AAAA,EACvC;AAAA,EAEJ,KAEN,GAAI48C,IAAO;AAAA,EACZ,MAAO;AAAA,CAEf,CACA,OAAQ12C,GAAWA,EAAQ,KAAQ;AAAA,CACvC,CACA,SAASm4C,GAAM/9B,EAAMjR,EAAQ,CACzB,MAAO;AAAA,EAAO,QAAQiR,EAAK,OAAOjR,CAAM,CAAC,IAAM,EACnD,CC5PA,IAAI4wC,IACH,SAAUA,EAAc,CACrBA,EAAa,QAAU,CACnB,mBAAoB,EAC5B,CACA,GAAGA,KAAiBA,GAAe,CAAA,EAAG,EAKtC,SAAShN,GAAM3yB,EAAMhd,EAAS,CAAA,EAAI4C,EAAU+5C,GAAa,QAAS,CAC9D,IAAIC,EAAkB,KAClBC,EAAgB,CAAA,EACpB,MAAMC,EAAkB,CAAA,EACxB,SAASC,EAAQ7gD,EAAO,CAChB,MAAM,QAAQ2gD,CAAa,EAC3BA,EAAc,KAAK3gD,CAAK,EAEnB0gD,IAAoB,OACzBC,EAAcD,CAAe,EAAI1gD,EAEzC,CA8BA,OAAA8gD,GAAMhgC,EA7BU,CACZ,cAAe,IAAM,CACjB,MAAMigC,EAAS,CAAA,EACfF,EAAQE,CAAM,EACdH,EAAgB,KAAKD,CAAa,EAClCA,EAAgBI,EAChBL,EAAkB,IACtB,EACA,iBAAmBrhD,GAAS,CACxBqhD,EAAkBrhD,CACtB,EACA,YAAa,IAAM,CACfshD,EAAgBC,EAAgB,IAAG,CACvC,EACA,aAAc,IAAM,CAChB,MAAMj/C,EAAQ,CAAA,EACdk/C,EAAQl/C,CAAK,EACbi/C,EAAgB,KAAKD,CAAa,EAClCA,EAAgBh/C,EAChB++C,EAAkB,IACtB,EACA,WAAY,IAAM,CACdC,EAAgBC,EAAgB,IAAG,CACvC,EACA,eAAgBC,EAChB,QAAS,CAACzhD,EAAOyQ,EAAQjN,IAAW,CAChCkB,EAAO,KAAK,CAAE,MAAA1E,EAAO,OAAAyQ,EAAQ,OAAAjN,CAAM,CAAE,CACzC,CACR,EACyB8D,CAAO,EACrBi6C,EAAc,CAAC,CAC1B,CAIA,SAASK,GAAYp8C,EAAM,CACvB,GAAI,CAACA,EAAK,QAAU,CAACA,EAAK,OAAO,SAC7B,MAAO,CAAA,EAEX,MAAM6gB,EAAOu7B,GAAYp8C,EAAK,MAAM,EACpC,GAAIA,EAAK,OAAO,OAAS,WAAY,CACjC,MAAMwJ,EAAMxJ,EAAK,OAAO,SAAS,CAAC,EAAE,MACpC6gB,EAAK,KAAKrX,CAAG,CACjB,SACSxJ,EAAK,OAAO,OAAS,QAAS,CACnC,MAAMxC,EAAQwC,EAAK,OAAO,SAAS,QAAQA,CAAI,EAC3CxC,IAAU,IACVqjB,EAAK,KAAKrjB,CAAK,CAEvB,CACA,OAAOqjB,CACX,CAIA,SAASw7B,GAAar8C,EAAM,CACxB,OAAQA,EAAK,KAAI,CACb,IAAK,QACD,OAAOA,EAAK,SAAS,IAAIq8C,EAAY,EACzC,IAAK,SACD,MAAMngD,EAAM,OAAO,OAAO,IAAI,EAC9B,QAAS07C,KAAQ53C,EAAK,SAAU,CAC5B,MAAMs8C,EAAY1E,EAAK,SAAS,CAAC,EAC7B0E,IACApgD,EAAI07C,EAAK,SAAS,CAAC,EAAE,KAAK,EAAIyE,GAAaC,CAAS,EAE5D,CACA,OAAOpgD,EACX,IAAK,OACL,IAAK,SACL,IAAK,SACL,IAAK,UACD,OAAO8D,EAAK,MAChB,QACI,MACZ,CACA,CACA,SAASu8C,GAASv8C,EAAMiL,EAAQuxC,EAAoB,GAAO,CACvD,OAAQvxC,GAAUjL,EAAK,QAAUiL,EAAUjL,EAAK,OAASA,EAAK,QAAYw8C,GAAsBvxC,IAAYjL,EAAK,OAASA,EAAK,MACnI,CAIA,SAASy8C,GAAiBz8C,EAAMiL,EAAQuxC,EAAoB,GAAO,CAC/D,GAAID,GAASv8C,EAAMiL,EAAQuxC,CAAiB,EAAG,CAC3C,MAAME,EAAW18C,EAAK,SACtB,GAAI,MAAM,QAAQ08C,CAAQ,EACtB,QAAS,EAAI,EAAG,EAAIA,EAAS,QAAUA,EAAS,CAAC,EAAE,QAAUzxC,EAAQ,IAAK,CACtE,MAAMrN,EAAO6+C,GAAiBC,EAAS,CAAC,EAAGzxC,EAAQuxC,CAAiB,EACpE,GAAI5+C,EACA,OAAOA,CAEf,CAEJ,OAAOoC,CACX,CAEJ,CAIA,SAASk8C,GAAMhgC,EAAMygC,EAAS76C,EAAU+5C,GAAa,QAAS,CAC1D,MAAMe,EAAW9E,GAAc57B,EAAM,EAAK,EAGpC2gC,EAAY,CAAA,EAClB,SAASC,EAAaC,EAAe,CACjC,OAAOA,EAAgB,IAAMA,EAAcH,EAAS,eAAc,EAAIA,EAAS,eAAc,EAAIA,EAAS,kBAAiB,EAAIA,EAAS,uBAAsB,CAAE,EAAI,IAAM,EAC9K,CACA,SAASI,EAAqBD,EAAe,CACzC,OAAOA,EAAgB,IAAMA,EAAcH,EAAS,iBAAkBA,EAAS,iBAAkBA,EAAS,kBAAiB,EAAIA,EAAS,uBAAsB,EAAI,IAAMC,EAAU,MAAK,CAAE,EAAI,IAAM,EACvM,CACA,SAASI,EAAcF,EAAe,CAClC,OAAOA,EAAiB99C,GAAQ89C,EAAc99C,EAAK29C,EAAS,iBAAkBA,EAAS,eAAc,EAAIA,EAAS,kBAAiB,EAAIA,EAAS,uBAAsB,CAAE,EAAI,IAAM,EACtL,CACA,SAASM,EAAsBH,EAAe,CAC1C,OAAOA,EAAiB99C,GAAQ89C,EAAc99C,EAAK29C,EAAS,iBAAkBA,EAAS,eAAc,EAAIA,EAAS,kBAAiB,EAAIA,EAAS,uBAAsB,EAAI,IAAMC,EAAU,OAAO,EAAI,IAAM,EAC/M,CACA,MAAMM,EAAgBH,EAAqBL,EAAQ,aAAa,EAAGS,EAAmBF,EAAsBP,EAAQ,gBAAgB,EAAGU,EAAcP,EAAaH,EAAQ,WAAW,EAAGW,EAAeN,EAAqBL,EAAQ,YAAY,EAAGY,EAAaT,EAAaH,EAAQ,UAAU,EAAGa,EAAiBN,EAAsBP,EAAQ,cAAc,EAAGc,EAAcR,EAAcN,EAAQ,WAAW,EAAGe,EAAYZ,EAAaH,EAAQ,SAAS,EAAGgB,EAAUV,EAAcN,EAAQ,OAAO,EACleiB,EAAmB97C,GAAWA,EAAQ,iBACtC+7C,EAAqB/7C,GAAWA,EAAQ,mBAC9C,SAASk3C,GAAW,CAChB,OAAa,CACT,MAAMf,EAAQ2E,EAAS,KAAI,EAC3B,OAAQA,EAAS,cAAa,EAAE,CAC5B,IAAK,GACDkB,EAAY,EAAE,EACd,MACJ,IAAK,GACDA,EAAY,EAAE,EACd,MACJ,IAAK,GACDA,EAAY,EAAE,EACd,MACJ,IAAK,GACIF,GACDE,EAAY,EAAE,EAElB,MACJ,IAAK,GACDA,EAAY,EAAE,EACd,MACJ,IAAK,GACDA,EAAY,EAAE,EACd,KACpB,CACY,OAAQ7F,EAAK,CACT,IAAK,IACL,IAAK,IACG2F,EACAE,EAAY,EAAE,EAGdJ,EAAS,EAEb,MACJ,IAAK,IACDI,EAAY,CAAC,EACb,MACJ,IAAK,IACL,IAAK,IACD,MACJ,QACI,OAAO7F,CAC3B,CACQ,CACJ,CACA,SAAS6F,EAAYtjD,EAAOujD,EAAiB,CAAA,EAAIC,EAAY,CAAA,EAAI,CAE7D,GADAL,EAAQnjD,CAAK,EACTujD,EAAe,OAASC,EAAU,OAAS,EAAG,CAC9C,IAAI/F,EAAQ2E,EAAS,SAAQ,EAC7B,KAAO3E,IAAU,IAAyB,CACtC,GAAI8F,EAAe,QAAQ9F,CAAK,IAAM,GAAI,CACtCe,EAAQ,EACR,KACJ,SACSgF,EAAU,QAAQ/F,CAAK,IAAM,GAClC,MAEJA,EAAQe,EAAQ,CACpB,CACJ,CACJ,CACA,SAASiF,EAAYC,EAAS,CAC1B,MAAM9iD,EAAQwhD,EAAS,cAAa,EACpC,OAAIsB,EACAV,EAAepiD,CAAK,GAGpBgiD,EAAiBhiD,CAAK,EAEtByhD,EAAU,KAAKzhD,CAAK,GAExB49C,EAAQ,EACD,EACX,CACA,SAASmF,GAAe,CACpB,OAAQvB,EAAS,SAAQ,EAAE,CACvB,IAAK,IACD,MAAMwB,EAAaxB,EAAS,cAAa,EACzC,IAAIxhD,EAAQ,OAAOgjD,CAAU,EACzB,MAAMhjD,CAAK,IACX0iD,EAAY,CAAC,EACb1iD,EAAQ,GAEZoiD,EAAepiD,CAAK,EACpB,MACJ,IAAK,GACDoiD,EAAe,IAAI,EACnB,MACJ,IAAK,GACDA,EAAe,EAAI,EACnB,MACJ,IAAK,GACDA,EAAe,EAAK,EACpB,MACJ,QACI,MAAO,EACvB,CACQ,OAAAxE,EAAQ,EACD,EACX,CACA,SAASqF,GAAgB,CACrB,OAAIzB,EAAS,SAAQ,IAAO,IACxBkB,EAAY,EAA6C,CAAA,EAAI,CAAC,EAAoC,CAAC,CAA6B,EACzH,KAEXG,EAAY,EAAK,EACbrB,EAAS,SAAQ,IAAO,GACxBa,EAAY,GAAG,EACfzE,IACKsF,EAAU,GACXR,EAAY,EAAsC,CAAA,EAAI,CAAC,EAAoC,CAAC,CAA6B,GAI7HA,EAAY,EAAsC,CAAA,EAAI,CAAC,EAAoC,CAAC,CAA6B,EAE7HjB,EAAU,IAAG,EACN,GACX,CACA,SAAS0B,GAAc,CACnBpB,EAAa,EACbnE,IACA,IAAIwF,EAAa,GACjB,KAAO5B,EAAS,aAAe,GAAsCA,EAAS,SAAQ,IAAO,IAAyB,CAClH,GAAIA,EAAS,SAAQ,IAAO,GAMxB,GALK4B,GACDV,EAAY,EAAsC,CAAA,EAAI,EAAE,EAE5DL,EAAY,GAAG,EACfzE,IACI4D,EAAS,aAAe,GAAsCiB,EAC9D,WAGCW,GACLV,EAAY,EAAsC,CAAA,EAAI,EAAE,EAEvDO,EAAa,GACdP,EAAY,EAAsC,CAAA,EAAI,CAAC,EAAoC,CAAC,CAA6B,EAE7HU,EAAa,EACjB,CACA,OAAAnB,EAAW,EACPT,EAAS,SAAQ,IAAO,EACxBkB,EAAY,EAA2C,CAAC,CAAC,EAAoC,CAAA,CAAE,EAG/F9E,IAEG,EACX,CACA,SAASyF,GAAa,CAClBnB,EAAY,EACZtE,IACA,IAAI0F,EAAiB,GACjBF,EAAa,GACjB,KAAO5B,EAAS,aAAe,GAAwCA,EAAS,SAAQ,IAAO,IAAyB,CACpH,GAAIA,EAAS,SAAQ,IAAO,GAMxB,GALK4B,GACDV,EAAY,EAAsC,CAAA,EAAI,EAAE,EAE5DL,EAAY,GAAG,EACfzE,IACI4D,EAAS,aAAe,GAAwCiB,EAChE,WAGCW,GACLV,EAAY,EAAsC,CAAA,EAAI,EAAE,EAExDY,GACA7B,EAAU,KAAK,CAAC,EAChB6B,EAAiB,IAGjB7B,EAAUA,EAAU,OAAS,CAAC,IAE7ByB,EAAU,GACXR,EAAY,EAAsC,CAAA,EAAI,CAAC,EAAsC,CAAC,CAA6B,EAE/HU,EAAa,EACjB,CACA,OAAAjB,EAAU,EACLmB,GACD7B,EAAU,IAAG,EAEbD,EAAS,SAAQ,IAAO,EACxBkB,EAAY,EAA6C,CAAC,CAAC,EAAsC,CAAA,CAAE,EAGnG9E,IAEG,EACX,CACA,SAASsF,GAAa,CAClB,OAAQ1B,EAAS,SAAQ,EAAE,CACvB,IAAK,GACD,OAAO6B,EAAU,EACrB,IAAK,GACD,OAAOF,EAAW,EACtB,IAAK,IACD,OAAON,EAAY,EAAI,EAC3B,QACI,OAAOE,EAAY,CACnC,CACI,CAEA,OADAnF,EAAQ,EACJ4D,EAAS,SAAQ,IAAO,GACpB96C,EAAQ,kBACD,IAEXg8C,EAAY,EAAsC,CAAA,EAAI,EAAE,EACjD,IAENQ,EAAU,GAIX1B,EAAS,SAAQ,IAAO,IACxBkB,EAAY,EAA0C,CAAA,EAAI,EAAE,EAEzD,KANHA,EAAY,EAAsC,CAAA,EAAI,EAAE,EACjD,GAMf,CCxWA,MAAMhG,GAAgB6G,GACtB,IAAIC,IACH,SAAUA,EAAW,CAClBA,EAAUA,EAAU,KAAU,CAAC,EAAI,OACnCA,EAAUA,EAAU,uBAA4B,CAAC,EAAI,yBACrDA,EAAUA,EAAU,sBAA2B,CAAC,EAAI,wBACpDA,EAAUA,EAAU,sBAA2B,CAAC,EAAI,wBACpDA,EAAUA,EAAU,eAAoB,CAAC,EAAI,iBAC7CA,EAAUA,EAAU,uBAA4B,CAAC,EAAI,yBACrDA,EAAUA,EAAU,iBAAsB,CAAC,EAAI,kBACnD,GAAGA,KAAcA,GAAY,CAAA,EAAG,EAChC,IAAIC,IACH,SAAUA,EAAY,CACnBA,EAAWA,EAAW,eAAoB,CAAC,EAAI,iBAC/CA,EAAWA,EAAW,gBAAqB,CAAC,EAAI,kBAChDA,EAAWA,EAAW,iBAAsB,CAAC,EAAI,mBACjDA,EAAWA,EAAW,kBAAuB,CAAC,EAAI,oBAClDA,EAAWA,EAAW,WAAgB,CAAC,EAAI,aAC3CA,EAAWA,EAAW,WAAgB,CAAC,EAAI,aAC3CA,EAAWA,EAAW,YAAiB,CAAC,EAAI,cAC5CA,EAAWA,EAAW,YAAiB,CAAC,EAAI,cAC5CA,EAAWA,EAAW,aAAkB,CAAC,EAAI,eAC7CA,EAAWA,EAAW,cAAmB,EAAE,EAAI,gBAC/CA,EAAWA,EAAW,eAAoB,EAAE,EAAI,iBAChDA,EAAWA,EAAW,kBAAuB,EAAE,EAAI,oBACnDA,EAAWA,EAAW,mBAAwB,EAAE,EAAI,qBACpDA,EAAWA,EAAW,gBAAqB,EAAE,EAAI,kBACjDA,EAAWA,EAAW,OAAY,EAAE,EAAI,SACxCA,EAAWA,EAAW,QAAa,EAAE,EAAI,UACzCA,EAAWA,EAAW,IAAS,EAAE,EAAI,KACzC,GAAGA,KAAeA,GAAa,CAAA,EAAG,EAKlC,MAAMhQ,GAAQiQ,GAIRrC,GAAmBsC,GAInB3C,GAAc4C,GAId3C,GAAe4C,GACrB,IAAIC,IACH,SAAUA,EAAgB,CACvBA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,oBAAyB,CAAC,EAAI,sBAC5DA,EAAeA,EAAe,qBAA0B,CAAC,EAAI,uBAC7DA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,mBAAwB,CAAC,EAAI,qBAC3DA,EAAeA,EAAe,qBAA0B,CAAC,EAAI,uBAC7DA,EAAeA,EAAe,kBAAuB,CAAC,EAAI,oBAC1DA,EAAeA,EAAe,oBAAyB,EAAE,EAAI,sBAC7DA,EAAeA,EAAe,uBAA4B,EAAE,EAAI,yBAChEA,EAAeA,EAAe,sBAA2B,EAAE,EAAI,wBAC/DA,EAAeA,EAAe,sBAA2B,EAAE,EAAI,wBAC/DA,EAAeA,EAAe,eAAoB,EAAE,EAAI,iBACxDA,EAAeA,EAAe,uBAA4B,EAAE,EAAI,yBAChEA,EAAeA,EAAe,iBAAsB,EAAE,EAAI,kBAC9D,GAAGA,KAAmBA,GAAiB,CAAA,EAAG,EAU1C,SAAStQ,GAAO+K,EAAc/hC,EAAO9V,EAAS,CAC1C,OAAOq9C,GAASxF,EAAc/hC,EAAO9V,CAAO,CAChD,CCtFA,SAASiB,GAAOivB,EAAKhb,EAAO,CACxB,GAAIgb,IAAQhb,EACR,MAAO,GAWX,GATIgb,GAAQ,MAA6Bhb,IAAU,MAAQA,IAAU,QAGjE,OAAOgb,GAAQ,OAAOhb,GAGtB,OAAOgb,GAAQ,UAGd,MAAM,QAAQA,CAAG,IAAQ,MAAM,QAAQhb,CAAK,EAC7C,MAAO,GAEX,IAAIpb,EAAG4N,EACP,GAAI,MAAM,QAAQwoB,CAAG,EAAG,CACpB,GAAIA,EAAI,SAAWhb,EAAM,OACrB,MAAO,GAEX,IAAKpb,EAAI,EAAGA,EAAIo2B,EAAI,OAAQp2B,IACxB,GAAI,CAACmH,GAAOivB,EAAIp2B,CAAC,EAAGob,EAAMpb,CAAC,CAAC,EACxB,MAAO,EAGnB,KACK,CACD,MAAMwjD,EAAU,CAAA,EAChB,IAAK51C,KAAOwoB,EACRotB,EAAQ,KAAK51C,CAAG,EAEpB41C,EAAQ,KAAI,EACZ,MAAMC,EAAY,CAAA,EAClB,IAAK71C,KAAOwN,EACRqoC,EAAU,KAAK71C,CAAG,EAGtB,GADA61C,EAAU,KAAI,EACV,CAACt8C,GAAOq8C,EAASC,CAAS,EAC1B,MAAO,GAEX,IAAKzjD,EAAI,EAAGA,EAAIwjD,EAAQ,OAAQxjD,IAC5B,GAAI,CAACmH,GAAOivB,EAAIotB,EAAQxjD,CAAC,CAAC,EAAGob,EAAMooC,EAAQxjD,CAAC,CAAC,CAAC,EAC1C,MAAO,EAGnB,CACA,MAAO,EACX,CACA,SAAS0jD,GAAStwC,EAAK,CACnB,OAAO,OAAOA,GAAQ,QAC1B,CACA,SAASuwC,GAAUvwC,EAAK,CACpB,OAAO,OAAOA,EAAQ,GAC1B,CACA,SAASwwC,GAAUxwC,EAAK,CACpB,OAAO,OAAOA,GAAQ,SAC1B,CACA,SAASjT,GAASiT,EAAK,CACnB,OAAO,OAAOA,GAAQ,QAC1B,CACA,SAASywC,GAASzwC,EAAK,CACnB,OAAO,OAAOA,GAAQ,UAAYA,IAAQ,MAAQ,CAAC,MAAM,QAAQA,CAAG,CACxE,CC/DA,SAAS0wC,GAAWC,EAAUC,EAAQ,CAClC,GAAID,EAAS,OAASC,EAAO,OACzB,MAAO,GAEX,QAAShkD,EAAI,EAAGA,EAAIgkD,EAAO,OAAQhkD,IAC/B,GAAI+jD,EAAS/jD,CAAC,IAAMgkD,EAAOhkD,CAAC,EACxB,MAAO,GAGf,MAAO,EACX,CAIA,SAASikD,GAASF,EAAUC,EAAQ,CAChC,MAAMpZ,EAAOmZ,EAAS,OAASC,EAAO,OACtC,OAAIpZ,EAAO,EACAmZ,EAAS,YAAYC,CAAM,IAAMpZ,EAEnCA,IAAS,EACPmZ,IAAaC,EAGb,EAEf,CACA,SAASE,GAAeC,EAAS,CAC7B,IAAIhxB,EAAQ,GACR2wB,GAAWK,EAAS,MAAM,IAC1BA,EAAUA,EAAQ,UAAU,CAAC,EAC7BhxB,EAAQ,KAEZ,GAAI,CACA,OAAO,IAAI,OAAOgxB,EAAShxB,EAAQ,GAAG,CAC1C,MACU,CAEN,GAAI,CACA,OAAO,IAAI,OAAOgxB,EAAShxB,CAAK,CACpC,MACU,CAEN,MACJ,CACJ,CACJ,CAEA,SAASixB,GAAahkD,EAAK,CACvB,IAAIiC,EAAQ,EACZ,QAASrC,EAAI,EAAGA,EAAII,EAAI,OAAQJ,IAAK,CACjCqC,IAEA,MAAMoM,EAAOrO,EAAI,WAAWJ,CAAC,EACzB,OAAUyO,GAAQA,GAAQ,OAG1BzO,GAER,CACA,OAAOqC,CACX,CC5DA,IAAIgiD,IACH,SAAUA,EAAa,CACpB,SAAS7jD,EAAGhB,EAAO,CACf,OAAO,OAAOA,GAAU,QAC5B,CACA6kD,EAAY,GAAK7jD,CACrB,GAAG6jD,KAAgBA,GAAc,CAAA,EAAG,EACpC,IAAIn7B,IACH,SAAUA,EAAK,CACZ,SAAS1oB,EAAGhB,EAAO,CACf,OAAO,OAAOA,GAAU,QAC5B,CACA0pB,EAAI,GAAK1oB,CACb,GAAG0oB,KAAQA,GAAM,CAAA,EAAG,EACpB,IAAIo7B,IACH,SAAUA,EAAS,CAChBA,EAAQ,UAAY,YACpBA,EAAQ,UAAY,WACpB,SAAS9jD,EAAGhB,EAAO,CACf,OAAO,OAAOA,GAAU,UAAY8kD,EAAQ,WAAa9kD,GAASA,GAAS8kD,EAAQ,SACvF,CACAA,EAAQ,GAAK9jD,CACjB,GAAG8jD,KAAYA,GAAU,CAAA,EAAG,EAC5B,IAAIC,IACH,SAAUA,EAAU,CACjBA,EAAS,UAAY,EACrBA,EAAS,UAAY,WACrB,SAAS/jD,EAAGhB,EAAO,CACf,OAAO,OAAOA,GAAU,UAAY+kD,EAAS,WAAa/kD,GAASA,GAAS+kD,EAAS,SACzF,CACAA,EAAS,GAAK/jD,CAClB,GAAG+jD,KAAaA,GAAW,CAAA,EAAG,EAK9B,IAAI1pC,IACH,SAAUA,EAAU,CAMjB,SAAS2pC,EAAOzlC,EAAM2W,EAAW,CAC7B,OAAI3W,IAAS,OAAO,YAChBA,EAAOwlC,GAAS,WAEhB7uB,IAAc,OAAO,YACrBA,EAAY6uB,GAAS,WAElB,CAAE,KAAAxlC,EAAM,UAAA2W,CAAS,CAC5B,CACA7a,EAAS,OAAS2pC,EAIlB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKq3C,EAAG,SAASr3C,EAAU,IAAI,GAAKq3C,EAAG,SAASr3C,EAAU,SAAS,CACxG,CACAyN,EAAS,GAAKra,CAClB,GAAGqa,KAAaA,GAAW,CAAA,EAAG,EAK9B,IAAIc,GACH,SAAUA,EAAO,CACd,SAAS6oC,EAAOpuB,EAAKsuB,EAAKC,EAAOC,EAAM,CACnC,GAAIH,EAAG,SAASruB,CAAG,GAAKquB,EAAG,SAASC,CAAG,GAAKD,EAAG,SAASE,CAAK,GAAKF,EAAG,SAASG,CAAI,EAC9E,MAAO,CAAE,MAAO/pC,GAAS,OAAOub,EAAKsuB,CAAG,EAAG,IAAK7pC,GAAS,OAAO8pC,EAAOC,CAAI,CAAC,EAE3E,GAAI/pC,GAAS,GAAGub,CAAG,GAAKvb,GAAS,GAAG6pC,CAAG,EACxC,MAAO,CAAE,MAAOtuB,EAAK,IAAKsuB,CAAG,EAG7B,MAAM,IAAI,MAAM,8CAA8CtuB,CAAG,KAAKsuB,CAAG,KAAKC,CAAK,KAAKC,CAAI,GAAG,CAEvG,CACAjpC,EAAM,OAAS6oC,EAIf,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKyN,GAAS,GAAGzN,EAAU,KAAK,GAAKyN,GAAS,GAAGzN,EAAU,GAAG,CACnG,CACAuO,EAAM,GAAKnb,CACf,GAAGmb,IAAUA,EAAQ,CAAA,EAAG,EAKxB,IAAIkpC,IACH,SAAUA,EAAU,CAMjB,SAASL,EAAO56B,EAAK5N,EAAO,CACxB,MAAO,CAAE,IAAA4N,EAAK,MAAA5N,CAAK,CACvB,CACA6oC,EAAS,OAASL,EAIlB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKuO,EAAM,GAAGvO,EAAU,KAAK,IAAMq3C,EAAG,OAAOr3C,EAAU,GAAG,GAAKq3C,EAAG,UAAUr3C,EAAU,GAAG,EAC9H,CACAy3C,EAAS,GAAKrkD,CAClB,GAAGqkD,KAAaA,GAAW,CAAA,EAAG,EAK9B,IAAIC,IACH,SAAUA,EAAc,CAQrB,SAASN,EAAOO,EAAWC,EAAaC,EAAsBC,EAAsB,CAChF,MAAO,CAAE,UAAAH,EAAW,YAAAC,EAAa,qBAAAC,EAAsB,qBAAAC,CAAoB,CAC/E,CACAJ,EAAa,OAASN,EAItB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKuO,EAAM,GAAGvO,EAAU,WAAW,GAAKq3C,EAAG,OAAOr3C,EAAU,SAAS,GAC/FuO,EAAM,GAAGvO,EAAU,oBAAoB,IACtCuO,EAAM,GAAGvO,EAAU,oBAAoB,GAAKq3C,EAAG,UAAUr3C,EAAU,oBAAoB,EACnG,CACA03C,EAAa,GAAKtkD,CACtB,GAAGskD,KAAiBA,GAAe,CAAA,EAAG,EAKtC,IAAIzS,IACH,SAAUA,EAAO,CAId,SAASmS,EAAOW,EAAKC,EAAOC,EAAMC,EAAO,CACrC,MAAO,CACH,IAAAH,EACA,MAAAC,EACA,KAAAC,EACA,MAAAC,CACZ,CACI,CACAjT,EAAM,OAASmS,EAIf,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKq3C,EAAG,YAAYr3C,EAAU,IAAK,EAAG,CAAC,GACjEq3C,EAAG,YAAYr3C,EAAU,MAAO,EAAG,CAAC,GACpCq3C,EAAG,YAAYr3C,EAAU,KAAM,EAAG,CAAC,GACnCq3C,EAAG,YAAYr3C,EAAU,MAAO,EAAG,CAAC,CAC/C,CACAilC,EAAM,GAAK7xC,CACf,GAAG6xC,KAAUA,GAAQ,CAAA,EAAG,EAKxB,IAAIkT,IACH,SAAUA,EAAkB,CAIzB,SAASf,EAAOxoC,EAAO01B,EAAO,CAC1B,MAAO,CACH,MAAA11B,EACA,MAAA01B,CACZ,CACI,CACA6T,EAAiB,OAASf,EAI1B,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKuO,EAAM,GAAGvO,EAAU,KAAK,GAAKilC,GAAM,GAAGjlC,EAAU,KAAK,CAC/F,CACAm4C,EAAiB,GAAK/kD,CAC1B,GAAG+kD,KAAqBA,GAAmB,CAAA,EAAG,EAK9C,IAAIC,IACH,SAAUA,EAAmB,CAI1B,SAAShB,EAAOiB,EAAOC,EAAUC,EAAqB,CAClD,MAAO,CACH,MAAAF,EACA,SAAAC,EACA,oBAAAC,CACZ,CACI,CACAH,EAAkB,OAAShB,EAI3B,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,KAAK,IACvDq3C,EAAG,UAAUr3C,EAAU,QAAQ,GAAKw4C,GAAS,GAAGx4C,CAAS,KACzDq3C,EAAG,UAAUr3C,EAAU,mBAAmB,GAAKq3C,EAAG,WAAWr3C,EAAU,oBAAqBw4C,GAAS,EAAE,EACnH,CACAJ,EAAkB,GAAKhlD,CAC3B,GAAGglD,KAAsBA,GAAoB,CAAA,EAAG,EAIhD,IAAIK,IACH,SAAUA,EAAkB,CAIzBA,EAAiB,QAAU,UAI3BA,EAAiB,QAAU,UAI3BA,EAAiB,OAAS,QAC9B,GAAGA,KAAqBA,GAAmB,CAAA,EAAG,EAK9C,IAAIC,IACH,SAAUA,EAAc,CAIrB,SAAStB,EAAOxwB,EAAWC,EAAS8xB,EAAgBC,EAAcn5B,EAAMo5B,EAAe,CACnF,MAAM5mD,EAAS,CACX,UAAA20B,EACA,QAAAC,CACZ,EACQ,OAAIwwB,EAAG,QAAQsB,CAAc,IACzB1mD,EAAO,eAAiB0mD,GAExBtB,EAAG,QAAQuB,CAAY,IACvB3mD,EAAO,aAAe2mD,GAEtBvB,EAAG,QAAQ53B,CAAI,IACfxtB,EAAO,KAAOwtB,GAEd43B,EAAG,QAAQwB,CAAa,IACxB5mD,EAAO,cAAgB4mD,GAEpB5mD,CACX,CACAymD,EAAa,OAAStB,EAItB,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKq3C,EAAG,SAASr3C,EAAU,SAAS,GAAKq3C,EAAG,SAASr3C,EAAU,SAAS,IACjGq3C,EAAG,UAAUr3C,EAAU,cAAc,GAAKq3C,EAAG,SAASr3C,EAAU,cAAc,KAC9Eq3C,EAAG,UAAUr3C,EAAU,YAAY,GAAKq3C,EAAG,SAASr3C,EAAU,YAAY,KAC1Eq3C,EAAG,UAAUr3C,EAAU,IAAI,GAAKq3C,EAAG,OAAOr3C,EAAU,IAAI,EACpE,CACA04C,EAAa,GAAKtlD,CACtB,GAAGslD,KAAiBA,GAAe,CAAA,EAAG,EAKtC,IAAII,IACH,SAAUA,EAA8B,CAIrC,SAAS1B,EAAO2B,EAAUrnD,EAAS,CAC/B,MAAO,CACH,SAAAqnD,EACA,QAAArnD,CACZ,CACI,CACAonD,EAA6B,OAAS1B,EAItC,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKy3C,GAAS,GAAGz3C,EAAU,QAAQ,GAAKq3C,EAAG,OAAOr3C,EAAU,OAAO,CAClG,CACA84C,EAA6B,GAAK1lD,CACtC,GAAG0lD,KAAiCA,GAA+B,CAAA,EAAG,EAItE,IAAIE,IACH,SAAUA,EAAoB,CAI3BA,EAAmB,MAAQ,EAI3BA,EAAmB,QAAU,EAI7BA,EAAmB,YAAc,EAIjCA,EAAmB,KAAO,CAC9B,GAAGA,KAAuBA,GAAqB,CAAA,EAAG,EAMlD,IAAIC,IACH,SAAUA,EAAe,CAOtBA,EAAc,YAAc,EAM5BA,EAAc,WAAa,CAC/B,GAAGA,KAAkBA,GAAgB,CAAA,EAAG,EAMxC,IAAIC,IACH,SAAUA,EAAiB,CACxB,SAAS9lD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,IAAI,CAClE,CACAk5C,EAAgB,GAAK9lD,CACzB,GAAG8lD,KAAoBA,GAAkB,CAAA,EAAG,EAK5C,IAAIC,IACH,SAAUA,EAAY,CAInB,SAAS/B,EAAOxoC,EAAOld,EAAS0nD,EAAU/3C,EAAMiF,EAAQ+yC,EAAoB,CACxE,IAAIpnD,EAAS,CAAE,MAAA2c,EAAO,QAAAld,CAAO,EAC7B,OAAI2lD,EAAG,QAAQ+B,CAAQ,IACnBnnD,EAAO,SAAWmnD,GAElB/B,EAAG,QAAQh2C,CAAI,IACfpP,EAAO,KAAOoP,GAEdg2C,EAAG,QAAQ/wC,CAAM,IACjBrU,EAAO,OAASqU,GAEhB+wC,EAAG,QAAQgC,CAAkB,IAC7BpnD,EAAO,mBAAqBonD,GAEzBpnD,CACX,CACAknD,EAAW,OAAS/B,EAIpB,SAAShkD,EAAGhB,EAAO,CACf,IAAIouB,EACJ,IAAIxgB,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GACpBuO,EAAM,GAAGvO,EAAU,KAAK,GACxBq3C,EAAG,OAAOr3C,EAAU,OAAO,IAC1Bq3C,EAAG,OAAOr3C,EAAU,QAAQ,GAAKq3C,EAAG,UAAUr3C,EAAU,QAAQ,KAChEq3C,EAAG,QAAQr3C,EAAU,IAAI,GAAKq3C,EAAG,OAAOr3C,EAAU,IAAI,GAAKq3C,EAAG,UAAUr3C,EAAU,IAAI,KACtFq3C,EAAG,UAAUr3C,EAAU,eAAe,GAAMq3C,EAAG,QAAQ72B,EAAKxgB,EAAU,mBAAqB,MAAQwgB,IAAO,OAAS,OAASA,EAAG,IAAI,KACnI62B,EAAG,OAAOr3C,EAAU,MAAM,GAAKq3C,EAAG,UAAUr3C,EAAU,MAAM,KAC5Dq3C,EAAG,UAAUr3C,EAAU,kBAAkB,GAAKq3C,EAAG,WAAWr3C,EAAU,mBAAoB84C,GAA6B,EAAE,EACrI,CACAK,EAAW,GAAK/lD,CACpB,GAAG+lD,KAAeA,GAAa,CAAA,EAAG,EAKlC,IAAIx4B,IACH,SAAUA,EAAS,CAIhB,SAASy2B,EAAOkC,EAAOC,KAAYp+C,EAAM,CACrC,IAAIlJ,EAAS,CAAE,MAAAqnD,EAAO,QAAAC,CAAO,EAC7B,OAAIlC,EAAG,QAAQl8C,CAAI,GAAKA,EAAK,OAAS,IAClClJ,EAAO,UAAYkJ,GAEhBlJ,CACX,CACA0uB,EAAQ,OAASy2B,EAIjB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,KAAK,GAAKq3C,EAAG,OAAOr3C,EAAU,OAAO,CAC7F,CACA2gB,EAAQ,GAAKvtB,CACjB,GAAGutB,KAAYA,GAAU,CAAA,EAAG,EAK5B,IAAI63B,IACH,SAAUA,EAAU,CAMjB,SAASgB,EAAQ5qC,EAAOuf,EAAS,CAC7B,MAAO,CAAE,MAAAvf,EAAO,QAAAuf,CAAO,CAC3B,CACAqqB,EAAS,QAAUgB,EAMnB,SAASC,EAAO5qC,EAAUsf,EAAS,CAC/B,MAAO,CAAE,MAAO,CAAE,MAAOtf,EAAU,IAAKA,CAAQ,EAAI,QAAAsf,CAAO,CAC/D,CACAqqB,EAAS,OAASiB,EAKlB,SAASC,EAAI9qC,EAAO,CAChB,MAAO,CAAE,MAAAA,EAAO,QAAS,EAAE,CAC/B,CACA4pC,EAAS,IAAMkB,EACf,SAAStmD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAC1Bq3C,EAAG,OAAOr3C,EAAU,OAAO,GAC3BuO,EAAM,GAAGvO,EAAU,KAAK,CACnC,CACAw4C,EAAS,GAAKplD,CAClB,GAAGolD,KAAaA,GAAW,CAAA,EAAG,EAC9B,IAAImB,IACH,SAAUA,EAAkB,CACzB,SAASvC,EAAOiB,EAAOuB,EAAmBC,EAAa,CACnD,MAAM5nD,EAAS,CAAE,MAAAomD,CAAK,EACtB,OAAIuB,IAAsB,SACtB3nD,EAAO,kBAAoB2nD,GAE3BC,IAAgB,SAChB5nD,EAAO,YAAc4nD,GAElB5nD,CACX,CACA0nD,EAAiB,OAASvC,EAC1B,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,KAAK,IAC1Dq3C,EAAG,QAAQr3C,EAAU,iBAAiB,GAAKA,EAAU,oBAAsB,UAC3Eq3C,EAAG,OAAOr3C,EAAU,WAAW,GAAKA,EAAU,cAAgB,OACvE,CACA25C,EAAiB,GAAKvmD,CAC1B,GAAGumD,KAAqBA,GAAmB,CAAA,EAAG,EAC9C,IAAIG,IACH,SAAUA,EAA4B,CACnC,SAAS1mD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,OAAOr3C,CAAS,CAC9B,CACA85C,EAA2B,GAAK1mD,CACpC,GAAG0mD,KAA+BA,GAA6B,CAAA,EAAG,EAClE,IAAIC,IACH,SAAUA,EAAmB,CAQ1B,SAASP,EAAQ5qC,EAAOuf,EAAS6rB,EAAY,CACzC,MAAO,CAAE,MAAAprC,EAAO,QAAAuf,EAAS,aAAc6rB,CAAU,CACrD,CACAD,EAAkB,QAAUP,EAQ5B,SAASC,EAAO5qC,EAAUsf,EAAS6rB,EAAY,CAC3C,MAAO,CAAE,MAAO,CAAE,MAAOnrC,EAAU,IAAKA,GAAY,QAAAsf,EAAS,aAAc6rB,CAAU,CACzF,CACAD,EAAkB,OAASN,EAO3B,SAASC,EAAI9qC,EAAOorC,EAAY,CAC5B,MAAO,CAAE,MAAAprC,EAAO,QAAS,GAAI,aAAcorC,CAAU,CACzD,CACAD,EAAkB,IAAML,EACxB,SAAStmD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOomD,GAAS,GAAGx4C,CAAS,IAAM25C,GAAiB,GAAG35C,EAAU,YAAY,GAAK85C,GAA2B,GAAG95C,EAAU,YAAY,EACzI,CACA+5C,EAAkB,GAAK3mD,CAC3B,GAAG2mD,KAAsBA,GAAoB,CAAA,EAAG,EAKhD,IAAIE,IACH,SAAUA,EAAkB,CAIzB,SAAS7C,EAAO8C,EAAc/sB,EAAO,CACjC,MAAO,CAAE,aAAA+sB,EAAc,MAAA/sB,CAAK,CAChC,CACA8sB,EAAiB,OAAS7C,EAC1B,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GACpBm6C,GAAwC,GAAGn6C,EAAU,YAAY,GACjE,MAAM,QAAQA,EAAU,KAAK,CACxC,CACAi6C,EAAiB,GAAK7mD,CAC1B,GAAG6mD,KAAqBA,GAAmB,CAAA,EAAG,EAC9C,IAAIG,IACH,SAAUA,EAAY,CACnB,SAAShD,EAAO56B,EAAK1jB,EAASkhD,EAAY,CACtC,IAAI/nD,EAAS,CACT,KAAM,SACN,IAAAuqB,CACZ,EACQ,OAAI1jB,IAAY,SAAcA,EAAQ,YAAc,QAAaA,EAAQ,iBAAmB,UACxF7G,EAAO,QAAU6G,GAEjBkhD,IAAe,SACf/nD,EAAO,aAAe+nD,GAEnB/nD,CACX,CACAmoD,EAAW,OAAShD,EACpB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAO4N,GAAaA,EAAU,OAAS,UAAYq3C,EAAG,OAAOr3C,EAAU,GAAG,IAAMA,EAAU,UAAY,SAChGA,EAAU,QAAQ,YAAc,QAAaq3C,EAAG,QAAQr3C,EAAU,QAAQ,SAAS,KAAOA,EAAU,QAAQ,iBAAmB,QAAaq3C,EAAG,QAAQr3C,EAAU,QAAQ,cAAc,MAASA,EAAU,eAAiB,QAAa85C,GAA2B,GAAG95C,EAAU,YAAY,EACtS,CACAo6C,EAAW,GAAKhnD,CACpB,GAAGgnD,KAAeA,GAAa,CAAA,EAAG,EAClC,IAAIC,IACH,SAAUA,EAAY,CACnB,SAASjD,EAAOkD,EAAQC,EAAQzhD,EAASkhD,EAAY,CACjD,IAAI/nD,EAAS,CACT,KAAM,SACN,OAAAqoD,EACA,OAAAC,CACZ,EACQ,OAAIzhD,IAAY,SAAcA,EAAQ,YAAc,QAAaA,EAAQ,iBAAmB,UACxF7G,EAAO,QAAU6G,GAEjBkhD,IAAe,SACf/nD,EAAO,aAAe+nD,GAEnB/nD,CACX,CACAooD,EAAW,OAASjD,EACpB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAO4N,GAAaA,EAAU,OAAS,UAAYq3C,EAAG,OAAOr3C,EAAU,MAAM,GAAKq3C,EAAG,OAAOr3C,EAAU,MAAM,IAAMA,EAAU,UAAY,SAClIA,EAAU,QAAQ,YAAc,QAAaq3C,EAAG,QAAQr3C,EAAU,QAAQ,SAAS,KAAOA,EAAU,QAAQ,iBAAmB,QAAaq3C,EAAG,QAAQr3C,EAAU,QAAQ,cAAc,MAASA,EAAU,eAAiB,QAAa85C,GAA2B,GAAG95C,EAAU,YAAY,EACtS,CACAq6C,EAAW,GAAKjnD,CACpB,GAAGinD,KAAeA,GAAa,CAAA,EAAG,EAClC,IAAIG,IACH,SAAUA,EAAY,CACnB,SAASpD,EAAO56B,EAAK1jB,EAASkhD,EAAY,CACtC,IAAI/nD,EAAS,CACT,KAAM,SACN,IAAAuqB,CACZ,EACQ,OAAI1jB,IAAY,SAAcA,EAAQ,YAAc,QAAaA,EAAQ,oBAAsB,UAC3F7G,EAAO,QAAU6G,GAEjBkhD,IAAe,SACf/nD,EAAO,aAAe+nD,GAEnB/nD,CACX,CACAuoD,EAAW,OAASpD,EACpB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAO4N,GAAaA,EAAU,OAAS,UAAYq3C,EAAG,OAAOr3C,EAAU,GAAG,IAAMA,EAAU,UAAY,SAChGA,EAAU,QAAQ,YAAc,QAAaq3C,EAAG,QAAQr3C,EAAU,QAAQ,SAAS,KAAOA,EAAU,QAAQ,oBAAsB,QAAaq3C,EAAG,QAAQr3C,EAAU,QAAQ,iBAAiB,MAASA,EAAU,eAAiB,QAAa85C,GAA2B,GAAG95C,EAAU,YAAY,EAC5S,CACAw6C,EAAW,GAAKpnD,CACpB,GAAGonD,KAAeA,GAAa,CAAA,EAAG,EAClC,IAAIC,IACH,SAAUA,EAAe,CACtB,SAASrnD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAO4N,IACFA,EAAU,UAAY,QAAaA,EAAU,kBAAoB,UACjEA,EAAU,kBAAoB,QAAaA,EAAU,gBAAgB,MAAOgL,GACrEqsC,EAAG,OAAOrsC,EAAO,IAAI,EACdovC,GAAW,GAAGpvC,CAAM,GAAKqvC,GAAW,GAAGrvC,CAAM,GAAKwvC,GAAW,GAAGxvC,CAAM,EAGtEivC,GAAiB,GAAGjvC,CAAM,CAExC,EACT,CACAyvC,EAAc,GAAKrnD,CACvB,GAAGqnD,KAAkBA,GAAgB,CAAA,EAAG,EAKxC,IAAIC,IACH,SAAUA,EAAwB,CAK/B,SAAStD,EAAO56B,EAAK,CACjB,MAAO,CAAE,IAAAA,CAAG,CAChB,CACAk+B,EAAuB,OAAStD,EAIhC,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,GAAG,CAC3D,CACA06C,EAAuB,GAAKtnD,CAChC,GAAGsnD,KAA2BA,GAAyB,CAAA,EAAG,EAK1D,IAAIC,IACH,SAAUA,EAAiC,CAMxC,SAASvD,EAAO56B,EAAKo+B,EAAS,CAC1B,MAAO,CAAE,IAAAp+B,EAAK,QAAAo+B,CAAO,CACzB,CACAD,EAAgC,OAASvD,EAIzC,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,GAAG,GAAKq3C,EAAG,QAAQr3C,EAAU,OAAO,CAC5F,CACA26C,EAAgC,GAAKvnD,CACzC,GAAGunD,KAAoCA,GAAkC,CAAA,EAAG,EAK5E,IAAIR,IACH,SAAUA,EAAyC,CAMhD,SAAS/C,EAAO56B,EAAKo+B,EAAS,CAC1B,MAAO,CAAE,IAAAp+B,EAAK,QAAAo+B,CAAO,CACzB,CACAT,EAAwC,OAAS/C,EAIjD,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,GAAG,IAAMA,EAAU,UAAY,MAAQq3C,EAAG,QAAQr3C,EAAU,OAAO,EAC3H,CACAm6C,EAAwC,GAAK/mD,CACjD,GAAG+mD,KAA4CA,GAA0C,CAAA,EAAG,EAK5F,IAAIU,IACH,SAAUA,EAAkB,CAQzB,SAASzD,EAAO56B,EAAKkC,EAAYk8B,EAAS1nC,EAAM,CAC5C,MAAO,CAAE,IAAAsJ,EAAK,WAAAkC,EAAY,QAAAk8B,EAAS,KAAA1nC,CAAI,CAC3C,CACA2nC,EAAiB,OAASzD,EAI1B,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,GAAG,GAAKq3C,EAAG,OAAOr3C,EAAU,UAAU,GAAKq3C,EAAG,QAAQr3C,EAAU,OAAO,GAAKq3C,EAAG,OAAOr3C,EAAU,IAAI,CAC5J,CACA66C,EAAiB,GAAKznD,CAC1B,GAAGynD,KAAqBA,GAAmB,CAAA,EAAG,EAQ9C,IAAIC,IACH,SAAUA,EAAY,CAInBA,EAAW,UAAY,YAIvBA,EAAW,SAAW,WAItB,SAAS1nD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAO4N,IAAc86C,EAAW,WAAa96C,IAAc86C,EAAW,QAC1E,CACAA,EAAW,GAAK1nD,CACpB,GAAG0nD,KAAeA,GAAa,CAAA,EAAG,EAClC,IAAIC,IACH,SAAUA,EAAe,CAItB,SAAS3nD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcjlD,CAAK,GAAK0oD,GAAW,GAAG96C,EAAU,IAAI,GAAKq3C,EAAG,OAAOr3C,EAAU,KAAK,CAChG,CACA+6C,EAAc,GAAK3nD,CACvB,GAAG2nD,KAAkBA,GAAgB,CAAA,EAAG,EAIxC,IAAI95B,IACH,SAAUA,EAAoB,CAC3BA,EAAmB,KAAO,EAC1BA,EAAmB,OAAS,EAC5BA,EAAmB,SAAW,EAC9BA,EAAmB,YAAc,EACjCA,EAAmB,MAAQ,EAC3BA,EAAmB,SAAW,EAC9BA,EAAmB,MAAQ,EAC3BA,EAAmB,UAAY,EAC/BA,EAAmB,OAAS,EAC5BA,EAAmB,SAAW,GAC9BA,EAAmB,KAAO,GAC1BA,EAAmB,MAAQ,GAC3BA,EAAmB,KAAO,GAC1BA,EAAmB,QAAU,GAC7BA,EAAmB,QAAU,GAC7BA,EAAmB,MAAQ,GAC3BA,EAAmB,KAAO,GAC1BA,EAAmB,UAAY,GAC/BA,EAAmB,OAAS,GAC5BA,EAAmB,WAAa,GAChCA,EAAmB,SAAW,GAC9BA,EAAmB,OAAS,GAC5BA,EAAmB,MAAQ,GAC3BA,EAAmB,SAAW,GAC9BA,EAAmB,cAAgB,EACvC,GAAGA,KAAuBA,GAAqB,CAAA,EAAG,EAKlD,IAAI+5B,IACH,SAAUA,EAAkB,CAIzBA,EAAiB,UAAY,EAW7BA,EAAiB,QAAU,CAC/B,GAAGA,KAAqBA,GAAmB,CAAA,EAAG,EAO9C,IAAI95B,IACH,SAAUA,EAAmB,CAI1BA,EAAkB,WAAa,CACnC,GAAGA,KAAsBA,GAAoB,CAAA,EAAG,EAMhD,IAAI+5B,IACH,SAAUA,EAAmB,CAI1B,SAAS7D,EAAOjpB,EAASsrB,EAAQD,EAAS,CACtC,MAAO,CAAE,QAAArrB,EAAS,OAAAsrB,EAAQ,QAAAD,CAAO,CACrC,CACAyB,EAAkB,OAAS7D,EAI3B,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAO4N,GAAaq3C,EAAG,OAAOr3C,EAAU,OAAO,GAAKuO,EAAM,GAAGvO,EAAU,MAAM,GAAKuO,EAAM,GAAGvO,EAAU,OAAO,CAChH,CACAi7C,EAAkB,GAAK7nD,CAC3B,GAAG6nD,KAAsBA,GAAoB,CAAA,EAAG,EAOhD,IAAIC,IACH,SAAUA,EAAgB,CAQvBA,EAAe,KAAO,EAUtBA,EAAe,kBAAoB,CACvC,GAAGA,KAAmBA,GAAiB,CAAA,EAAG,EAC1C,IAAIC,IACH,SAAUA,EAA4B,CACnC,SAAS/nD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAO4N,IAAcq3C,EAAG,OAAOr3C,EAAU,MAAM,GAAKA,EAAU,SAAW,UACpEq3C,EAAG,OAAOr3C,EAAU,WAAW,GAAKA,EAAU,cAAgB,OACvE,CACAm7C,EAA2B,GAAK/nD,CACpC,GAAG+nD,KAA+BA,GAA6B,CAAA,EAAG,EAKlE,IAAIC,IACH,SAAUA,EAAgB,CAKvB,SAAShE,EAAOiB,EAAO,CACnB,MAAO,CAAE,MAAAA,CAAK,CAClB,CACA+C,EAAe,OAAShE,CAC5B,GAAGgE,KAAmBA,GAAiB,CAAA,EAAG,EAK1C,IAAIC,IACH,SAAUA,EAAgB,CAOvB,SAASjE,EAAO1kD,EAAO4oD,EAAc,CACjC,MAAO,CAAE,MAAO5oD,GAAgB,CAAA,EAAI,aAAc,CAAC,CAAC4oD,CAAY,CACpE,CACAD,EAAe,OAASjE,CAC5B,GAAGiE,KAAmBA,GAAiB,CAAA,EAAG,EAC1C,IAAIE,IACH,SAAUA,EAAc,CAMrB,SAASC,EAAcC,EAAW,CAC9B,OAAOA,EAAU,QAAQ,wBAAyB,MAAM,CAC5D,CACAF,EAAa,cAAgBC,EAI7B,SAASpoD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,OAAOr3C,CAAS,GAAMq3C,EAAG,cAAcr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,QAAQ,GAAKq3C,EAAG,OAAOr3C,EAAU,KAAK,CAC7H,CACAu7C,EAAa,GAAKnoD,CACtB,GAAGmoD,KAAiBA,GAAe,CAAA,EAAG,EACtC,IAAIG,IACH,SAAUA,EAAO,CAId,SAAStoD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,MAAO,CAAC,CAAC4N,GAAaq3C,EAAG,cAAcr3C,CAAS,IAAM+6C,GAAc,GAAG/6C,EAAU,QAAQ,GACrFu7C,GAAa,GAAGv7C,EAAU,QAAQ,GAClCq3C,EAAG,WAAWr3C,EAAU,SAAUu7C,GAAa,EAAE,KAAOnpD,EAAM,QAAU,QAAamc,EAAM,GAAGnc,EAAM,KAAK,EACjH,CACAspD,EAAM,GAAKtoD,CACf,GAAGsoD,KAAUA,GAAQ,CAAA,EAAG,EAKxB,IAAIC,IACH,SAAUA,EAAsB,CAO7B,SAASvE,EAAOiB,EAAOuD,EAAe,CAClC,OAAOA,EAAgB,CAAE,MAAAvD,EAAO,cAAAuD,CAAa,EAAK,CAAE,MAAAvD,CAAK,CAC7D,CACAsD,EAAqB,OAASvE,CAClC,GAAGuE,KAAyBA,GAAuB,CAAA,EAAG,EAKtD,IAAIE,IACH,SAAUA,EAAsB,CAC7B,SAASzE,EAAOiB,EAAOuD,KAAkBE,EAAY,CACjD,IAAI7pD,EAAS,CAAE,MAAAomD,CAAK,EACpB,OAAIhB,EAAG,QAAQuE,CAAa,IACxB3pD,EAAO,cAAgB2pD,GAEvBvE,EAAG,QAAQyE,CAAU,EACrB7pD,EAAO,WAAa6pD,EAGpB7pD,EAAO,WAAa,CAAA,EAEjBA,CACX,CACA4pD,EAAqB,OAASzE,CAClC,GAAGyE,KAAyBA,GAAuB,CAAA,EAAG,EAItD,IAAI57B,IACH,SAAUA,EAAuB,CAI9BA,EAAsB,KAAO,EAI7BA,EAAsB,KAAO,EAI7BA,EAAsB,MAAQ,CAClC,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EAKxD,IAAI87B,IACH,SAAUA,EAAmB,CAM1B,SAAS3E,EAAOxoC,EAAO6Q,EAAM,CACzB,IAAIxtB,EAAS,CAAE,MAAA2c,CAAK,EACpB,OAAIyoC,EAAG,OAAO53B,CAAI,IACdxtB,EAAO,KAAOwtB,GAEXxtB,CACX,CACA8pD,EAAkB,OAAS3E,CAC/B,GAAG2E,KAAsBA,GAAoB,CAAA,EAAG,EAIhD,IAAIj5B,IACH,SAAUA,EAAY,CACnBA,EAAW,KAAO,EAClBA,EAAW,OAAS,EACpBA,EAAW,UAAY,EACvBA,EAAW,QAAU,EACrBA,EAAW,MAAQ,EACnBA,EAAW,OAAS,EACpBA,EAAW,SAAW,EACtBA,EAAW,MAAQ,EACnBA,EAAW,YAAc,EACzBA,EAAW,KAAO,GAClBA,EAAW,UAAY,GACvBA,EAAW,SAAW,GACtBA,EAAW,SAAW,GACtBA,EAAW,SAAW,GACtBA,EAAW,OAAS,GACpBA,EAAW,OAAS,GACpBA,EAAW,QAAU,GACrBA,EAAW,MAAQ,GACnBA,EAAW,OAAS,GACpBA,EAAW,IAAM,GACjBA,EAAW,KAAO,GAClBA,EAAW,WAAa,GACxBA,EAAW,OAAS,GACpBA,EAAW,MAAQ,GACnBA,EAAW,SAAW,GACtBA,EAAW,cAAgB,EAC/B,GAAGA,KAAeA,GAAa,CAAA,EAAG,EAMlC,IAAIC,IACH,SAAUA,EAAW,CAIlBA,EAAU,WAAa,CAC3B,GAAGA,KAAcA,GAAY,CAAA,EAAG,EAChC,IAAIi5B,IACH,SAAUA,EAAmB,CAU1B,SAAS5E,EAAO3lD,EAAMguB,EAAM7Q,EAAO4N,EAAKy/B,EAAe,CACnD,IAAIhqD,EAAS,CACT,KAAAR,EACA,KAAAguB,EACA,SAAU,CAAE,IAAAjD,EAAK,MAAA5N,CAAK,CAClC,EACQ,OAAIqtC,IACAhqD,EAAO,cAAgBgqD,GAEpBhqD,CACX,CACA+pD,EAAkB,OAAS5E,CAC/B,GAAG4E,KAAsBA,GAAoB,CAAA,EAAG,EAChD,IAAIE,IACH,SAAUA,EAAiB,CAUxB,SAAS9E,EAAO3lD,EAAMguB,EAAMjD,EAAK5N,EAAO,CACpC,OAAOA,IAAU,OACX,CAAE,KAAAnd,EAAM,KAAAguB,EAAM,SAAU,CAAE,IAAAjD,EAAK,MAAA5N,CAAK,CAAE,EACtC,CAAE,KAAAnd,EAAM,KAAAguB,EAAM,SAAU,CAAE,IAAAjD,CAAG,CAAE,CACzC,CACA0/B,EAAgB,OAAS9E,CAC7B,GAAG8E,KAAoBA,GAAkB,CAAA,EAAG,EAC5C,IAAIC,IACH,SAAUA,EAAgB,CAWvB,SAAS/E,EAAO3lD,EAAM2qD,EAAQ38B,EAAM7Q,EAAOytC,EAAgB3I,EAAU,CACjE,IAAIzhD,EAAS,CACT,KAAAR,EACA,OAAA2qD,EACA,KAAA38B,EACA,MAAA7Q,EACA,eAAAytC,CACZ,EACQ,OAAI3I,IAAa,SACbzhD,EAAO,SAAWyhD,GAEfzhD,CACX,CACAkqD,EAAe,OAAS/E,EAIxB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAO4N,GACHq3C,EAAG,OAAOr3C,EAAU,IAAI,GAAKq3C,EAAG,OAAOr3C,EAAU,IAAI,GACrDuO,EAAM,GAAGvO,EAAU,KAAK,GAAKuO,EAAM,GAAGvO,EAAU,cAAc,IAC7DA,EAAU,SAAW,QAAaq3C,EAAG,OAAOr3C,EAAU,MAAM,KAC5DA,EAAU,aAAe,QAAaq3C,EAAG,QAAQr3C,EAAU,UAAU,KACrEA,EAAU,WAAa,QAAa,MAAM,QAAQA,EAAU,QAAQ,KACpEA,EAAU,OAAS,QAAa,MAAM,QAAQA,EAAU,IAAI,EACrE,CACAm8C,EAAe,GAAK/oD,CACxB,GAAG+oD,KAAmBA,GAAiB,CAAA,EAAG,EAI1C,IAAIG,IACH,SAAUA,EAAgB,CAIvBA,EAAe,MAAQ,GAIvBA,EAAe,SAAW,WAI1BA,EAAe,SAAW,WAY1BA,EAAe,gBAAkB,mBAWjCA,EAAe,eAAiB,kBAahCA,EAAe,gBAAkB,mBAMjCA,EAAe,OAAS,SAIxBA,EAAe,sBAAwB,yBASvCA,EAAe,aAAe,eAClC,GAAGA,KAAmBA,GAAiB,CAAA,EAAG,EAM1C,IAAIC,IACH,SAAUA,EAAuB,CAI9BA,EAAsB,QAAU,EAOhCA,EAAsB,UAAY,CACtC,GAAGA,KAA0BA,GAAwB,CAAA,EAAG,EAKxD,IAAIC,IACH,SAAUA,EAAmB,CAI1B,SAASpF,EAAOqF,EAAaC,EAAMC,EAAa,CAC5C,IAAI1qD,EAAS,CAAE,YAAAwqD,CAAW,EAC1B,OAA0BC,GAAS,OAC/BzqD,EAAO,KAAOyqD,GAEeC,GAAgB,OAC7C1qD,EAAO,YAAc0qD,GAElB1qD,CACX,CACAuqD,EAAkB,OAASpF,EAI3B,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKq3C,EAAG,WAAWr3C,EAAU,YAAam5C,GAAW,EAAE,IAC1En5C,EAAU,OAAS,QAAaq3C,EAAG,WAAWr3C,EAAU,KAAMq3C,EAAG,MAAM,KACvEr3C,EAAU,cAAgB,QAAaA,EAAU,cAAgBu8C,GAAsB,SAAWv8C,EAAU,cAAgBu8C,GAAsB,UAC9J,CACAC,EAAkB,GAAKppD,CAC3B,GAAGopD,KAAsBA,GAAoB,CAAA,EAAG,EAChD,IAAII,IACH,SAAUA,EAAY,CACnB,SAASxF,EAAOkC,EAAOuD,EAAqBp9B,EAAM,CAC9C,IAAIxtB,EAAS,CAAE,MAAAqnD,CAAK,EAChBwD,EAAY,GAChB,OAAI,OAAOD,GAAwB,UAC/BC,EAAY,GACZ7qD,EAAO,KAAO4qD,GAETl8B,GAAQ,GAAGk8B,CAAmB,EACnC5qD,EAAO,QAAU4qD,EAGjB5qD,EAAO,KAAO4qD,EAEdC,GAAar9B,IAAS,SACtBxtB,EAAO,KAAOwtB,GAEXxtB,CACX,CACA2qD,EAAW,OAASxF,EACpB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAO4N,GAAaq3C,EAAG,OAAOr3C,EAAU,KAAK,IACxCA,EAAU,cAAgB,QAAaq3C,EAAG,WAAWr3C,EAAU,YAAam5C,GAAW,EAAE,KACzFn5C,EAAU,OAAS,QAAaq3C,EAAG,OAAOr3C,EAAU,IAAI,KACxDA,EAAU,OAAS,QAAaA,EAAU,UAAY,UACtDA,EAAU,UAAY,QAAa2gB,GAAQ,GAAG3gB,EAAU,OAAO,KAC/DA,EAAU,cAAgB,QAAaq3C,EAAG,QAAQr3C,EAAU,WAAW,KACvEA,EAAU,OAAS,QAAay6C,GAAc,GAAGz6C,EAAU,IAAI,EACxE,CACA48C,EAAW,GAAKxpD,CACpB,GAAGwpD,KAAeA,GAAa,CAAA,EAAG,EAKlC,IAAIG,IACH,SAAUA,EAAU,CAIjB,SAAS3F,EAAOxoC,EAAOnQ,EAAM,CACzB,IAAIxM,EAAS,CAAE,MAAA2c,CAAK,EACpB,OAAIyoC,EAAG,QAAQ54C,CAAI,IACfxM,EAAO,KAAOwM,GAEXxM,CACX,CACA8qD,EAAS,OAAS3F,EAIlB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKuO,EAAM,GAAGvO,EAAU,KAAK,IAAMq3C,EAAG,UAAUr3C,EAAU,OAAO,GAAK2gB,GAAQ,GAAG3gB,EAAU,OAAO,EACjI,CACA+8C,EAAS,GAAK3pD,CAClB,GAAG2pD,KAAaA,GAAW,CAAA,EAAG,EAK9B,IAAIC,IACH,SAAUA,EAAmB,CAI1B,SAAS5F,EAAOxE,EAASqK,EAAc,CACnC,MAAO,CAAE,QAAArK,EAAS,aAAAqK,CAAY,CAClC,CACAD,EAAkB,OAAS5F,EAI3B,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKq3C,EAAG,SAASr3C,EAAU,OAAO,GAAKq3C,EAAG,QAAQr3C,EAAU,YAAY,CACvG,CACAg9C,EAAkB,GAAK5pD,CAC3B,GAAG4pD,KAAsBA,GAAoB,CAAA,EAAG,EAKhD,IAAIE,IACH,SAAUA,EAAc,CAIrB,SAAS9F,EAAOxoC,EAAOtK,EAAQ7F,EAAM,CACjC,MAAO,CAAE,MAAAmQ,EAAO,OAAAtK,EAAQ,KAAA7F,CAAI,CAChC,CACAy+C,EAAa,OAAS9F,EAItB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKuO,EAAM,GAAGvO,EAAU,KAAK,IAAMq3C,EAAG,UAAUr3C,EAAU,MAAM,GAAKq3C,EAAG,OAAOr3C,EAAU,MAAM,EAC9H,CACAk9C,EAAa,GAAK9pD,CACtB,GAAG8pD,KAAiBA,GAAe,CAAA,EAAG,EAKtC,IAAIC,IACH,SAAUA,EAAgB,CAMvB,SAAS/F,EAAOxoC,EAAO7Y,EAAQ,CAC3B,MAAO,CAAE,MAAA6Y,EAAO,OAAA7Y,CAAM,CAC1B,CACAonD,EAAe,OAAS/F,EACxB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKuO,EAAM,GAAGvO,EAAU,KAAK,IAAMA,EAAU,SAAW,QAAam9C,EAAe,GAAGn9C,EAAU,MAAM,EAC5I,CACAm9C,EAAe,GAAK/pD,CACxB,GAAG+pD,KAAmBA,GAAiB,CAAA,EAAG,EAQ1C,IAAIC,IACH,SAAUA,EAAoB,CAC3BA,EAAmB,UAAe,YAKlCA,EAAmB,KAAU,OAC7BA,EAAmB,MAAW,QAC9BA,EAAmB,KAAU,OAC7BA,EAAmB,UAAe,YAClCA,EAAmB,OAAY,SAC/BA,EAAmB,cAAmB,gBACtCA,EAAmB,UAAe,YAClCA,EAAmB,SAAc,WACjCA,EAAmB,SAAc,WACjCA,EAAmB,WAAgB,aACnCA,EAAmB,MAAW,QAC9BA,EAAmB,SAAc,WACjCA,EAAmB,OAAY,SAC/BA,EAAmB,MAAW,QAC9BA,EAAmB,QAAa,UAChCA,EAAmB,SAAc,WACjCA,EAAmB,QAAa,UAChCA,EAAmB,OAAY,SAC/BA,EAAmB,OAAY,SAC/BA,EAAmB,OAAY,SAC/BA,EAAmB,SAAc,WAIjCA,EAAmB,UAAe,WACtC,GAAGA,KAAuBA,GAAqB,CAAA,EAAG,EAQlD,IAAIC,IACH,SAAUA,EAAwB,CAC/BA,EAAuB,YAAiB,cACxCA,EAAuB,WAAgB,aACvCA,EAAuB,SAAc,WACrCA,EAAuB,OAAY,SACnCA,EAAuB,WAAgB,aACvCA,EAAuB,SAAc,WACrCA,EAAuB,MAAW,QAClCA,EAAuB,aAAkB,eACzCA,EAAuB,cAAmB,gBAC1CA,EAAuB,eAAoB,gBAC/C,GAAGA,KAA2BA,GAAyB,CAAA,EAAG,EAI1D,IAAIC,IACH,SAAUA,EAAgB,CACvB,SAASlqD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,IAAMA,EAAU,WAAa,QAAa,OAAOA,EAAU,UAAa,WACrG,MAAM,QAAQA,EAAU,IAAI,IAAMA,EAAU,KAAK,SAAW,GAAK,OAAOA,EAAU,KAAK,CAAC,GAAM,SACtG,CACAs9C,EAAe,GAAKlqD,CACxB,GAAGkqD,KAAmBA,GAAiB,CAAA,EAAG,EAM1C,IAAIC,IACH,SAAUA,EAAiB,CAIxB,SAASnG,EAAOxoC,EAAOsE,EAAM,CACzB,MAAO,CAAE,MAAAtE,EAAO,KAAAsE,CAAI,CACxB,CACAqqC,EAAgB,OAASnG,EACzB,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAkC4N,GAAc,MAAQuO,EAAM,GAAGvO,EAAU,KAAK,GAAKq3C,EAAG,OAAOr3C,EAAU,IAAI,CACjH,CACAu9C,EAAgB,GAAKnqD,CACzB,GAAGmqD,KAAoBA,GAAkB,CAAA,EAAG,EAM5C,IAAIC,IACH,SAAUA,EAA2B,CAIlC,SAASpG,EAAOxoC,EAAO6uC,EAAcC,EAAqB,CACtD,MAAO,CAAE,MAAA9uC,EAAO,aAAA6uC,EAAc,oBAAAC,CAAmB,CACrD,CACAF,EAA0B,OAASpG,EACnC,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAkC4N,GAAc,MAAQuO,EAAM,GAAGvO,EAAU,KAAK,GAAKq3C,EAAG,QAAQr3C,EAAU,mBAAmB,IACrHq3C,EAAG,OAAOr3C,EAAU,YAAY,GAAKA,EAAU,eAAiB,OAC5E,CACAw9C,EAA0B,GAAKpqD,CACnC,GAAGoqD,KAA8BA,GAA4B,CAAA,EAAG,EAMhE,IAAIG,IACH,SAAUA,EAAkC,CAIzC,SAASvG,EAAOxoC,EAAOgvC,EAAY,CAC/B,MAAO,CAAE,MAAAhvC,EAAO,WAAAgvC,CAAU,CAC9B,CACAD,EAAiC,OAASvG,EAC1C,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAkC4N,GAAc,MAAQuO,EAAM,GAAGvO,EAAU,KAAK,IACxEq3C,EAAG,OAAOr3C,EAAU,UAAU,GAAKA,EAAU,aAAe,OACxE,CACA29C,EAAiC,GAAKvqD,CAC1C,GAAGuqD,KAAqCA,GAAmC,CAAA,EAAG,EAO9E,IAAIE,IACH,SAAUA,EAAoB,CAI3B,SAASzG,EAAO0G,EAASC,EAAiB,CACtC,MAAO,CAAE,QAAAD,EAAS,gBAAAC,CAAe,CACrC,CACAF,EAAmB,OAASzG,EAI5B,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,QAAQr3C,CAAS,GAAKuO,EAAM,GAAGnc,EAAM,eAAe,CAClE,CACAyrD,EAAmB,GAAKzqD,CAC5B,GAAGyqD,KAAuBA,GAAqB,CAAA,EAAG,EAMlD,IAAIj9B,IACH,SAAUA,EAAe,CAItBA,EAAc,KAAO,EAIrBA,EAAc,UAAY,EAC1B,SAASxtB,EAAGhB,EAAO,CACf,OAAOA,IAAU,GAAKA,IAAU,CACpC,CACAwuB,EAAc,GAAKxtB,CACvB,GAAGwtB,KAAkBA,GAAgB,CAAA,EAAG,EACxC,IAAIo9B,IACH,SAAUA,EAAoB,CAC3B,SAAS5G,EAAOhlD,EAAO,CACnB,MAAO,CAAE,MAAAA,CAAK,CAClB,CACA4rD,EAAmB,OAAS5G,EAC5B,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,IACzBA,EAAU,UAAY,QAAaq3C,EAAG,OAAOr3C,EAAU,OAAO,GAAK+6C,GAAc,GAAG/6C,EAAU,OAAO,KACrGA,EAAU,WAAa,QAAay3C,GAAS,GAAGz3C,EAAU,QAAQ,KAClEA,EAAU,UAAY,QAAa2gB,GAAQ,GAAG3gB,EAAU,OAAO,EAC3E,CACAg+C,EAAmB,GAAK5qD,CAC5B,GAAG4qD,KAAuBA,GAAqB,CAAA,EAAG,EAClD,IAAIC,IACH,SAAUA,EAAW,CAClB,SAAS7G,EAAOvoC,EAAUwpC,EAAO54B,EAAM,CACnC,MAAMxtB,EAAS,CAAE,SAAA4c,EAAU,MAAAwpC,CAAK,EAChC,OAAI54B,IAAS,SACTxtB,EAAO,KAAOwtB,GAEXxtB,CACX,CACAgsD,EAAU,OAAS7G,EACnB,SAAShkD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAKyN,GAAS,GAAGzN,EAAU,QAAQ,IAC5Dq3C,EAAG,OAAOr3C,EAAU,KAAK,GAAKq3C,EAAG,WAAWr3C,EAAU,MAAOg+C,GAAmB,EAAE,KAClFh+C,EAAU,OAAS,QAAa4gB,GAAc,GAAG5gB,EAAU,IAAI,IAC/DA,EAAU,YAAc,QAAcq3C,EAAG,WAAWr3C,EAAU,UAAWw4C,GAAS,EAAE,IACpFx4C,EAAU,UAAY,QAAaq3C,EAAG,OAAOr3C,EAAU,OAAO,GAAK+6C,GAAc,GAAG/6C,EAAU,OAAO,KACrGA,EAAU,cAAgB,QAAaq3C,EAAG,QAAQr3C,EAAU,WAAW,KACvEA,EAAU,eAAiB,QAAaq3C,EAAG,QAAQr3C,EAAU,YAAY,EACrF,CACAi+C,EAAU,GAAK7qD,CACnB,GAAG6qD,KAAcA,GAAY,CAAA,EAAG,EAChC,IAAIC,IACH,SAAUA,EAAa,CACpB,SAASC,EAAc/rD,EAAO,CAC1B,MAAO,CAAE,KAAM,UAAW,MAAAA,CAAK,CACnC,CACA8rD,EAAY,cAAgBC,CAChC,GAAGD,KAAgBA,GAAc,CAAA,EAAG,EACpC,IAAIE,IACH,SAAUA,EAAsB,CAC7B,SAAShH,EAAOjM,EAAYkT,EAAYzvC,EAAO2qC,EAAS,CACpD,MAAO,CAAE,WAAApO,EAAY,WAAAkT,EAAY,MAAAzvC,EAAO,QAAA2qC,CAAO,CACnD,CACA6E,EAAqB,OAAShH,CAClC,GAAGgH,KAAyBA,GAAuB,CAAA,EAAG,EACtD,IAAIE,IACH,SAAUA,EAAsB,CAC7B,SAASlH,EAAO1kD,EAAO,CACnB,MAAO,CAAE,MAAAA,CAAK,CAClB,CACA4rD,EAAqB,OAASlH,CAClC,GAAGkH,KAAyBA,GAAuB,CAAA,EAAG,EAOtD,IAAI1+B,IACH,SAAUA,EAA6B,CAIpCA,EAA4B,QAAU,EAItCA,EAA4B,UAAY,CAC5C,GAAGA,KAAgCA,GAA8B,CAAA,EAAG,EACpE,IAAI2+B,IACH,SAAUA,EAAwB,CAC/B,SAASnH,EAAOxoC,EAAOsE,EAAM,CACzB,MAAO,CAAE,MAAAtE,EAAO,KAAAsE,CAAI,CACxB,CACAqrC,EAAuB,OAASnH,CACpC,GAAGmH,KAA2BA,GAAyB,CAAA,EAAG,EAC1D,IAAIC,IACH,SAAUA,EAAyB,CAChC,SAASpH,EAAOuF,EAAa8B,EAAwB,CACjD,MAAO,CAAE,YAAA9B,EAAa,uBAAA8B,CAAsB,CAChD,CACAD,EAAwB,OAASpH,CACrC,GAAGoH,KAA4BA,GAA0B,CAAA,EAAG,EAC5D,IAAIE,IACH,SAAUA,EAAiB,CACxB,SAAStrD,EAAGhB,EAAO,CACf,MAAM4N,EAAY5N,EAClB,OAAOilD,EAAG,cAAcr3C,CAAS,GAAK8b,GAAI,GAAG9b,EAAU,GAAG,GAAKq3C,EAAG,OAAOr3C,EAAU,IAAI,CAC3F,CACA0+C,EAAgB,GAAKtrD,CACzB,GAAGsrD,KAAoBA,GAAkB,CAAA,EAAG,EAI5C,IAAIC,IACH,SAAUA,EAAc,CAQrB,SAASvH,EAAO56B,EAAKkC,EAAYk8B,EAASjrB,EAAS,CAC/C,OAAO,IAAIivB,GAAiBpiC,EAAKkC,EAAYk8B,EAASjrB,CAAO,CACjE,CACAgvB,EAAa,OAASvH,EAItB,SAAShkD,EAAGhB,EAAO,CACf,IAAI4N,EAAY5N,EAChB,MAAO,GAAAilD,EAAG,QAAQr3C,CAAS,GAAKq3C,EAAG,OAAOr3C,EAAU,GAAG,IAAMq3C,EAAG,UAAUr3C,EAAU,UAAU,GAAKq3C,EAAG,OAAOr3C,EAAU,UAAU,IAAMq3C,EAAG,SAASr3C,EAAU,SAAS,GAC/Jq3C,EAAG,KAAKr3C,EAAU,OAAO,GAAKq3C,EAAG,KAAKr3C,EAAU,UAAU,GAAKq3C,EAAG,KAAKr3C,EAAU,QAAQ,EACpG,CACA2+C,EAAa,GAAKvrD,EAClB,SAASyrD,EAAWC,EAAU3xB,EAAO,CACjC,IAAIja,EAAO4rC,EAAS,QAAO,EACvBC,EAAcC,EAAU7xB,EAAO,CAACt6B,EAAGC,IAAM,CACzC,IAAI0qC,EAAO3qC,EAAE,MAAM,MAAM,KAAOC,EAAE,MAAM,MAAM,KAC9C,OAAI0qC,IAAS,EACF3qC,EAAE,MAAM,MAAM,UAAYC,EAAE,MAAM,MAAM,UAE5C0qC,CACX,CAAC,EACGyhB,EAAqB/rC,EAAK,OAC9B,QAAStgB,EAAImsD,EAAY,OAAS,EAAGnsD,GAAK,EAAGA,IAAK,CAC9C,IAAIvB,EAAI0tD,EAAYnsD,CAAC,EACjBq/C,EAAc6M,EAAS,SAASztD,EAAE,MAAM,KAAK,EAC7C6/C,EAAY4N,EAAS,SAASztD,EAAE,MAAM,GAAG,EAC7C,GAAI6/C,GAAa+N,EACb/rC,EAAOA,EAAK,UAAU,EAAG++B,CAAW,EAAI5gD,EAAE,QAAU6hB,EAAK,UAAUg+B,EAAWh+B,EAAK,MAAM,MAGzF,OAAM,IAAI,MAAM,kBAAkB,EAEtC+rC,EAAqBhN,CACzB,CACA,OAAO/+B,CACX,CACAyrC,EAAa,WAAaE,EAC1B,SAASG,EAAUvgD,EAAMygD,EAAS,CAC9B,GAAIzgD,EAAK,QAAU,EAEf,OAAOA,EAEX,MAAM+kC,EAAK/kC,EAAK,OAAS,EAAK,EACxBuO,EAAOvO,EAAK,MAAM,EAAG+kC,CAAC,EACtBv2B,EAAQxO,EAAK,MAAM+kC,CAAC,EAC1Bwb,EAAUhyC,EAAMkyC,CAAO,EACvBF,EAAU/xC,EAAOiyC,CAAO,EACxB,IAAIC,EAAU,EACVC,EAAW,EACXxsD,EAAI,EACR,KAAOusD,EAAUnyC,EAAK,QAAUoyC,EAAWnyC,EAAM,QACnCiyC,EAAQlyC,EAAKmyC,CAAO,EAAGlyC,EAAMmyC,CAAQ,CAAC,GACrC,EAEP3gD,EAAK7L,GAAG,EAAIoa,EAAKmyC,GAAS,EAI1B1gD,EAAK7L,GAAG,EAAIqa,EAAMmyC,GAAU,EAGpC,KAAOD,EAAUnyC,EAAK,QAClBvO,EAAK7L,GAAG,EAAIoa,EAAKmyC,GAAS,EAE9B,KAAOC,EAAWnyC,EAAM,QACpBxO,EAAK7L,GAAG,EAAIqa,EAAMmyC,GAAU,EAEhC,OAAO3gD,CACX,CACJ,GAAGkgD,KAAiBA,GAAe,CAAA,EAAG,EAItC,IAAAU,GAAA,KAAuB,CACnB,YAAY7iC,EAAKkC,EAAYk8B,EAASjrB,EAAS,CAC3C,KAAK,KAAOnT,EACZ,KAAK,YAAckC,EACnB,KAAK,SAAWk8B,EAChB,KAAK,SAAWjrB,EAChB,KAAK,aAAe,MACxB,CACA,IAAI,KAAM,CACN,OAAO,KAAK,IAChB,CACA,IAAI,YAAa,CACb,OAAO,KAAK,WAChB,CACA,IAAI,SAAU,CACV,OAAO,KAAK,QAChB,CACA,QAAQ/gB,EAAO,CACX,GAAIA,EAAO,CACP,IAAIY,EAAQ,KAAK,SAASZ,EAAM,KAAK,EACjC3Q,EAAM,KAAK,SAAS2Q,EAAM,GAAG,EACjC,OAAO,KAAK,SAAS,UAAUY,EAAOvR,CAAG,CAC7C,CACA,OAAO,KAAK,QAChB,CACA,OAAOpG,EAAO+iD,EAAS,CACnB,KAAK,SAAW/iD,EAAM,KACtB,KAAK,SAAW+iD,EAChB,KAAK,aAAe,MACxB,CACA,gBAAiB,CACb,GAAI,KAAK,eAAiB,OAAW,CACjC,IAAI0E,EAAc,CAAA,EACdpsC,EAAO,KAAK,SACZqsC,EAAc,GAClB,QAAS,EAAI,EAAG,EAAIrsC,EAAK,OAAQ,IAAK,CAC9BqsC,IACAD,EAAY,KAAK,CAAC,EAClBC,EAAc,IAElB,IAAI/P,EAAKt8B,EAAK,OAAO,CAAC,EACtBqsC,EAAe/P,IAAO,MAAQA,IAAO;AAAA,EACjCA,IAAO,MAAQ,EAAI,EAAIt8B,EAAK,QAAUA,EAAK,OAAO,EAAI,CAAC,IAAM;AAAA,GAC7D,GAER,CACIqsC,GAAersC,EAAK,OAAS,GAC7BosC,EAAY,KAAKpsC,EAAK,MAAM,EAEhC,KAAK,aAAeosC,CACxB,CACA,OAAO,KAAK,YAChB,CACA,WAAWr9C,EAAQ,CACfA,EAAS,KAAK,IAAI,KAAK,IAAIA,EAAQ,KAAK,SAAS,MAAM,EAAG,CAAC,EAC3D,IAAIq9C,EAAc,KAAK,eAAc,EACjCjV,EAAM,EAAGC,EAAOgV,EAAY,OAChC,GAAIhV,IAAS,EACT,OAAO78B,GAAS,OAAO,EAAGxL,CAAM,EAEpC,KAAOooC,EAAMC,GAAM,CACf,IAAIC,EAAM,KAAK,OAAOF,EAAMC,GAAQ,CAAC,EACjCgV,EAAY/U,CAAG,EAAItoC,EACnBqoC,EAAOC,EAGPF,EAAME,EAAM,CAEpB,CAGA,IAAI54B,EAAO04B,EAAM,EACjB,OAAO58B,GAAS,OAAOkE,EAAM1P,EAASq9C,EAAY3tC,CAAI,CAAC,CAC3D,CACA,SAAS9C,EAAU,CACf,IAAIywC,EAAc,KAAK,eAAc,EACrC,GAAIzwC,EAAS,MAAQywC,EAAY,OAC7B,OAAO,KAAK,SAAS,OAEpB,GAAIzwC,EAAS,KAAO,EACrB,MAAO,GAEX,IAAIwqB,EAAaimB,EAAYzwC,EAAS,IAAI,EACtC2wC,EAAkB3wC,EAAS,KAAO,EAAIywC,EAAY,OAAUA,EAAYzwC,EAAS,KAAO,CAAC,EAAI,KAAK,SAAS,OAC/G,OAAO,KAAK,IAAI,KAAK,IAAIwqB,EAAaxqB,EAAS,UAAW2wC,CAAc,EAAGnmB,CAAU,CACzF,CACA,IAAI,WAAY,CACZ,OAAO,KAAK,eAAc,EAAG,MACjC,CACJ,EACA,IAAIge,GACH,SAAUA,EAAI,CACX,MAAM9hC,EAAW,OAAO,UAAU,SAClC,SAASkqC,EAAQrtD,EAAO,CACpB,OAAO,OAAOA,EAAU,GAC5B,CACAilD,EAAG,QAAUoI,EACb,SAASC,EAAYttD,EAAO,CACxB,OAAO,OAAOA,EAAU,GAC5B,CACAilD,EAAG,UAAYqI,EACf,SAASC,EAAQvtD,EAAO,CACpB,OAAOA,IAAU,IAAQA,IAAU,EACvC,CACAilD,EAAG,QAAUsI,EACb,SAASC,EAAOxtD,EAAO,CACnB,OAAOmjB,EAAS,KAAKnjB,CAAK,IAAM,iBACpC,CACAilD,EAAG,OAASuI,EACZ,SAAS7c,EAAO3wC,EAAO,CACnB,OAAOmjB,EAAS,KAAKnjB,CAAK,IAAM,iBACpC,CACAilD,EAAG,OAAStU,EACZ,SAAS8c,EAAYztD,EAAOkxC,EAAK3C,EAAK,CAClC,OAAOprB,EAAS,KAAKnjB,CAAK,IAAM,mBAAqBkxC,GAAOlxC,GAASA,GAASuuC,CAClF,CACA0W,EAAG,YAAcwI,EACjB,SAAS3I,EAAQ9kD,EAAO,CACpB,OAAOmjB,EAAS,KAAKnjB,CAAK,IAAM,mBAAqB,aAAeA,GAASA,GAAS,UAC1F,CACAilD,EAAG,QAAUH,EACb,SAASC,EAAS/kD,EAAO,CACrB,OAAOmjB,EAAS,KAAKnjB,CAAK,IAAM,mBAAqB,GAAKA,GAASA,GAAS,UAChF,CACAilD,EAAG,SAAWF,EACd,SAAS2I,EAAK1tD,EAAO,CACjB,OAAOmjB,EAAS,KAAKnjB,CAAK,IAAM,mBACpC,CACAilD,EAAG,KAAOyI,EACV,SAASC,EAAc3tD,EAAO,CAI1B,OAAOA,IAAU,MAAQ,OAAOA,GAAU,QAC9C,CACAilD,EAAG,cAAgB0I,EACnB,SAASC,EAAW5tD,EAAO6tD,EAAO,CAC9B,OAAO,MAAM,QAAQ7tD,CAAK,GAAKA,EAAM,MAAM6tD,CAAK,CACpD,CACA5I,EAAG,WAAa2I,CACpB,GAAG3I,IAAOA,EAAK,CAAA,EAAG,ECr4DlB,MAAMuH,EAAiB,CACnB,YAAYpiC,EAAKkC,EAAYk8B,EAASjrB,EAAS,CAC3C,KAAK,KAAOnT,EACZ,KAAK,YAAckC,EACnB,KAAK,SAAWk8B,EAChB,KAAK,SAAWjrB,EAChB,KAAK,aAAe,MACxB,CACA,IAAI,KAAM,CACN,OAAO,KAAK,IAChB,CACA,IAAI,YAAa,CACb,OAAO,KAAK,WAChB,CACA,IAAI,SAAU,CACV,OAAO,KAAK,QAChB,CACA,QAAQ/gB,EAAO,CACX,GAAIA,EAAO,CACP,MAAMY,EAAQ,KAAK,SAASZ,EAAM,KAAK,EACjC3Q,EAAM,KAAK,SAAS2Q,EAAM,GAAG,EACnC,OAAO,KAAK,SAAS,UAAUY,EAAOvR,CAAG,CAC7C,CACA,OAAO,KAAK,QAChB,CACA,OAAOyK,EAASkyC,EAAS,CACrB,QAAS5vC,KAAUtC,EACf,GAAIk2C,GAAiB,cAAc5zC,CAAM,EAAG,CAExC,MAAM4D,EAAQsxC,GAAmBl1C,EAAO,KAAK,EAEvCinC,EAAc,KAAK,SAASrjC,EAAM,KAAK,EACvCsiC,EAAY,KAAK,SAAStiC,EAAM,GAAG,EACzC,KAAK,SAAW,KAAK,SAAS,UAAU,EAAGqjC,CAAW,EAAIjnC,EAAO,KAAO,KAAK,SAAS,UAAUkmC,EAAW,KAAK,SAAS,MAAM,EAE/H,MAAMtqB,EAAY,KAAK,IAAIhY,EAAM,MAAM,KAAM,CAAC,EACxCiY,EAAU,KAAK,IAAIjY,EAAM,IAAI,KAAM,CAAC,EAC1C,IAAI0wC,EAAc,KAAK,aACvB,MAAMa,EAAmBC,GAAmBp1C,EAAO,KAAM,GAAOinC,CAAW,EAC3E,GAAIprB,EAAUD,IAAcu5B,EAAiB,OACzC,QAASvtD,EAAI,EAAGmN,EAAMogD,EAAiB,OAAQvtD,EAAImN,EAAKnN,IACpD0sD,EAAY1sD,EAAIg0B,EAAY,CAAC,EAAIu5B,EAAiBvtD,CAAC,OAInDutD,EAAiB,OAAS,IAC1Bb,EAAY,OAAO14B,EAAY,EAAGC,EAAUD,EAAW,GAAGu5B,CAAgB,EAG1E,KAAK,aAAeb,EAAcA,EAAY,MAAM,EAAG14B,EAAY,CAAC,EAAE,OAAOu5B,EAAkBb,EAAY,MAAMz4B,EAAU,CAAC,CAAC,EAGrI,MAAM2W,EAAOxyB,EAAO,KAAK,QAAUkmC,EAAYe,GAC/C,GAAIzU,IAAS,EACT,QAAS5qC,EAAIg0B,EAAY,EAAIu5B,EAAiB,OAAQpgD,EAAMu/C,EAAY,OAAQ1sD,EAAImN,EAAKnN,IACrF0sD,EAAY1sD,CAAC,EAAI0sD,EAAY1sD,CAAC,EAAI4qC,CAG9C,SACSohB,GAAiB,OAAO5zC,CAAM,EACnC,KAAK,SAAWA,EAAO,KACvB,KAAK,aAAe,WAGpB,OAAM,IAAI,MAAM,+BAA+B,EAGvD,KAAK,SAAW4vC,CACpB,CACA,gBAAiB,CACb,OAAI,KAAK,eAAiB,SACtB,KAAK,aAAewF,GAAmB,KAAK,SAAU,EAAI,GAEvD,KAAK,YAChB,CACA,WAAWn+C,EAAQ,CACfA,EAAS,KAAK,IAAI,KAAK,IAAIA,EAAQ,KAAK,SAAS,MAAM,EAAG,CAAC,EAC3D,IAAIq9C,EAAc,KAAK,eAAc,EACjCjV,EAAM,EAAGC,EAAOgV,EAAY,OAChC,GAAIhV,IAAS,EACT,MAAO,CAAE,KAAM,EAAG,UAAWroC,CAAM,EAEvC,KAAOooC,EAAMC,GAAM,CACf,IAAIC,EAAM,KAAK,OAAOF,EAAMC,GAAQ,CAAC,EACjCgV,EAAY/U,CAAG,EAAItoC,EACnBqoC,EAAOC,EAGPF,EAAME,EAAM,CAEpB,CAGA,IAAI54B,EAAO04B,EAAM,EACjB,MAAO,CAAE,KAAA14B,EAAM,UAAW1P,EAASq9C,EAAY3tC,CAAI,CAAC,CACxD,CACA,SAAS9C,EAAU,CACf,IAAIywC,EAAc,KAAK,eAAc,EACrC,GAAIzwC,EAAS,MAAQywC,EAAY,OAC7B,OAAO,KAAK,SAAS,OAEpB,GAAIzwC,EAAS,KAAO,EACrB,MAAO,GAEX,IAAIwqB,EAAaimB,EAAYzwC,EAAS,IAAI,EACtC2wC,EAAkB3wC,EAAS,KAAO,EAAIywC,EAAY,OAAUA,EAAYzwC,EAAS,KAAO,CAAC,EAAI,KAAK,SAAS,OAC/G,OAAO,KAAK,IAAI,KAAK,IAAIwqB,EAAaxqB,EAAS,UAAW2wC,CAAc,EAAGnmB,CAAU,CACzF,CACA,IAAI,WAAY,CACZ,OAAO,KAAK,eAAc,EAAG,MACjC,CACA,OAAO,cAAcxhC,EAAO,CACxB,IAAImI,EAAYnI,EAChB,OAAkCmI,GAAc,MAC5C,OAAOA,EAAU,MAAS,UAAYA,EAAU,QAAU,SACzDA,EAAU,cAAgB,QAAa,OAAOA,EAAU,aAAgB,SACjF,CACA,OAAO,OAAOnI,EAAO,CACjB,IAAImI,EAAYnI,EAChB,OAAkCmI,GAAc,MAC5C,OAAOA,EAAU,MAAS,UAAYA,EAAU,QAAU,QAAaA,EAAU,cAAgB,MACzG,CACJ,CACA,IAAI2+C,IACH,SAAUA,EAAc,CASrB,SAASvH,EAAO56B,EAAKkC,EAAYk8B,EAASjrB,EAAS,CAC/C,OAAO,IAAIivB,GAAiBpiC,EAAKkC,EAAYk8B,EAASjrB,CAAO,CACjE,CACAgvB,EAAa,OAASvH,EAUtB,SAASiJ,EAAOvB,EAAUp2C,EAASkyC,EAAS,CACxC,GAAIkE,aAAoBF,GACpB,OAAAE,EAAS,OAAOp2C,EAASkyC,CAAO,EACzBkE,EAGP,MAAM,IAAI,MAAM,sEAAsE,CAE9F,CACAH,EAAa,OAAS0B,EACtB,SAASxB,EAAWC,EAAU3xB,EAAO,CACjC,IAAIja,EAAO4rC,EAAS,QAAO,EACvBC,EAAcC,GAAU7xB,EAAM,IAAImzB,EAAiB,EAAG,CAACztD,EAAGC,IAAM,CAChE,IAAI0qC,EAAO3qC,EAAE,MAAM,MAAM,KAAOC,EAAE,MAAM,MAAM,KAC9C,OAAI0qC,IAAS,EACF3qC,EAAE,MAAM,MAAM,UAAYC,EAAE,MAAM,MAAM,UAE5C0qC,CACX,CAAC,EACGyhB,EAAqB,EACzB,MAAMsB,EAAQ,CAAA,EACd,UAAWlvD,KAAK0tD,EAAa,CACzB,IAAI9M,EAAc6M,EAAS,SAASztD,EAAE,MAAM,KAAK,EACjD,GAAI4gD,EAAcgN,EACd,MAAM,IAAI,MAAM,kBAAkB,EAE7BhN,EAAcgN,GACnBsB,EAAM,KAAKrtC,EAAK,UAAU+rC,EAAoBhN,CAAW,CAAC,EAE1D5gD,EAAE,QAAQ,QACVkvD,EAAM,KAAKlvD,EAAE,OAAO,EAExB4tD,EAAqBH,EAAS,SAASztD,EAAE,MAAM,GAAG,CACtD,CACA,OAAAkvD,EAAM,KAAKrtC,EAAK,OAAO+rC,CAAkB,CAAC,EACnCsB,EAAM,KAAK,EAAE,CACxB,CACA5B,EAAa,WAAaE,CAC9B,GAAGF,KAAiBA,GAAe,CAAA,EAAG,EACtC,SAASK,GAAUvgD,EAAMygD,EAAS,CAC9B,GAAIzgD,EAAK,QAAU,EAEf,OAAOA,EAEX,MAAM+kC,EAAK/kC,EAAK,OAAS,EAAK,EACxBuO,EAAOvO,EAAK,MAAM,EAAG+kC,CAAC,EACtBv2B,EAAQxO,EAAK,MAAM+kC,CAAC,EAC1Bwb,GAAUhyC,EAAMkyC,CAAO,EACvBF,GAAU/xC,EAAOiyC,CAAO,EACxB,IAAIC,EAAU,EACVC,EAAW,EACXxsD,EAAI,EACR,KAAOusD,EAAUnyC,EAAK,QAAUoyC,EAAWnyC,EAAM,QACnCiyC,EAAQlyC,EAAKmyC,CAAO,EAAGlyC,EAAMmyC,CAAQ,CAAC,GACrC,EAEP3gD,EAAK7L,GAAG,EAAIoa,EAAKmyC,GAAS,EAI1B1gD,EAAK7L,GAAG,EAAIqa,EAAMmyC,GAAU,EAGpC,KAAOD,EAAUnyC,EAAK,QAClBvO,EAAK7L,GAAG,EAAIoa,EAAKmyC,GAAS,EAE9B,KAAOC,EAAWnyC,EAAM,QACpBxO,EAAK7L,GAAG,EAAIqa,EAAMmyC,GAAU,EAEhC,OAAO3gD,CACX,CACA,SAAS2hD,GAAmBltC,EAAMstC,EAAet6B,EAAa,EAAG,CAC7D,MAAMj0B,EAASuuD,EAAgB,CAACt6B,CAAU,EAAI,CAAA,EAC9C,QAAS,EAAI,EAAG,EAAIhT,EAAK,OAAQ,IAAK,CAClC,IAAIs8B,EAAKt8B,EAAK,WAAW,CAAC,GACtBs8B,IAAO,IAAoCA,IAAO,MAC9CA,IAAO,IAAoC,EAAI,EAAIt8B,EAAK,QAAUA,EAAK,WAAW,EAAI,CAAC,IAAM,IAC7F,IAEJjhB,EAAO,KAAKi0B,EAAa,EAAI,CAAC,EAEtC,CACA,OAAOj0B,CACX,CACA,SAASiuD,GAAmBtxC,EAAO,CAC/B,MAAMY,EAAQZ,EAAM,MACd3Q,EAAM2Q,EAAM,IAClB,OAAIY,EAAM,KAAOvR,EAAI,MAASuR,EAAM,OAASvR,EAAI,MAAQuR,EAAM,UAAYvR,EAAI,UACpE,CAAE,MAAOA,EAAK,IAAKuR,CAAK,EAE5BZ,CACX,CACA,SAAS0xC,GAAkBhI,EAAU,CACjC,MAAM1pC,EAAQsxC,GAAmB5H,EAAS,KAAK,EAC/C,OAAI1pC,IAAU0pC,EAAS,MACZ,CAAE,QAASA,EAAS,QAAS,MAAA1pC,CAAK,EAEtC0pC,CACX,CC7OA,IAAImI,GACH,SAAUA,EAAW,CAClBA,EAAUA,EAAU,UAAe,CAAC,EAAI,YACxCA,EAAUA,EAAU,kBAAuB,CAAC,EAAI,oBAChDA,EAAUA,EAAU,WAAgB,CAAC,EAAI,aACzCA,EAAUA,EAAU,uBAA4B,GAAG,EAAI,yBACvDA,EAAUA,EAAU,sBAA2B,GAAG,EAAI,wBACtDA,EAAUA,EAAU,sBAA2B,GAAG,EAAI,wBACtDA,EAAUA,EAAU,eAAoB,GAAG,EAAI,iBAC/CA,EAAUA,EAAU,uBAA4B,GAAG,EAAI,yBACvDA,EAAUA,EAAU,iBAAsB,GAAG,EAAI,mBACjDA,EAAUA,EAAU,iBAAsB,GAAG,EAAI,mBACjDA,EAAUA,EAAU,cAAmB,GAAG,EAAI,gBAC9CA,EAAUA,EAAU,cAAmB,GAAG,EAAI,gBAC9CA,EAAUA,EAAU,cAAmB,GAAG,EAAI,gBAC9CA,EAAUA,EAAU,2BAAgC,GAAG,EAAI,6BAC3DA,EAAUA,EAAU,0BAA+B,GAAG,EAAI,4BAC1DA,EAAUA,EAAU,cAAmB,GAAG,EAAI,gBAC9CA,EAAUA,EAAU,aAAkB,GAAG,EAAI,eAC7CA,EAAUA,EAAU,oBAAyB,GAAG,EAAI,sBACpDA,EAAUA,EAAU,+BAAoC,GAAG,EAAI,iCAC/DA,EAAUA,EAAU,mBAAwB,GAAG,EAAI,qBACnDA,EAAUA,EAAU,yBAA8B,GAAG,EAAI,0BAC7D,GAAGA,IAAcA,EAAY,CAAA,EAAG,EAChC,IAAIC,IACH,SAAUA,EAAa,CACpBA,EAAYA,EAAY,GAAQ,CAAC,EAAI,KACrCA,EAAYA,EAAY,GAAQ,CAAC,EAAI,KACrCA,EAAYA,EAAY,GAAQ,CAAC,EAAI,KACrCA,EAAYA,EAAY,GAAQ,CAAC,EAAI,KACrCA,EAAYA,EAAY,SAAc,EAAE,EAAI,WAC5CA,EAAYA,EAAY,SAAc,EAAE,EAAI,UAChD,GAAGA,KAAgBA,GAAc,CAAA,EAAG,EACpC,IAAIC,IACH,SAAUA,EAAoB,CAC3BA,EAAmB,OAAS,CACxB,aAAc,CACV,WAAY,CACR,eAAgB,CACZ,oBAAqB,CAAC7F,GAAW,SAAUA,GAAW,SAAS,EAC/D,wBAAyB,GACzB,oBAAqB,EACzC,CACA,CACA,CACA,CACA,GAAG6F,KAAuBA,GAAqB,CAAA,EAAG,ECxDlD,SAASt0C,KAAKlR,EAAM,CAClB,MAAMylD,EAAWzlD,EAAK,CAAC,EACvB,IAAIqF,EACA9O,EACAmvD,EACJ,GAAI,OAAOD,GAAa,SACtBpgD,EAAMogD,EACNlvD,EAAUkvD,EACVzlD,EAAK,OAAO,EAAG,CAAC,EAChB0lD,EAAa,CAAC1lD,GAAQ,OAAOA,EAAK,CAAC,GAAM,SAAWA,EAAOA,EAAK,CAAC,UACxDylD,aAAoB,MAAO,CACpC,MAAM5yB,EAAe7yB,EAAK,MAAM,CAAC,EACjC,GAAIylD,EAAS,SAAW5yB,EAAa,OAAS,EAC5C,MAAM,IAAI,MAAM,mDAAmD,EAErE,IAAIh7B,EAAM4tD,EAAS,CAAC,EACpB,QAAShuD,EAAI,EAAGA,EAAIguD,EAAS,OAAQhuD,IACnCI,GAAO,IAAIJ,EAAI,CAAC,IAAMguD,EAAShuD,CAAC,EAElC,OAAOyZ,EAAErZ,EAAK,GAAGg7B,CAAY,CAC/B,MACEt8B,EAAUkvD,EAAS,QACnBpgD,EAAM9O,EACFkvD,EAAS,SAAWA,EAAS,QAAQ,OAAS,IAChDpgD,GAAO,IAAI,MAAM,QAAQogD,EAAS,OAAO,EAAIA,EAAS,QAAQ,KAAK,EAAE,EAAIA,EAAS,OAAO,IAE3FC,EAAaD,EAAS,MAAQ,CAAA,EAG9B,OAAOhb,GAAOl0C,EAASmvD,CAAU,CAErC,CACA,IAAIC,GAAiB,aACrB,SAASlb,GAAOmb,EAAUz8B,EAAQ,CAChC,OAAI,OAAO,KAAKA,CAAM,EAAE,SAAW,EAC1By8B,EAEFA,EAAS,QAAQD,GAAgB,CAACxiD,EAAO0iD,IAAU18B,EAAO08B,CAAK,GAAK1iD,CAAK,CAClF,CC5BA,MAAM2iD,GAAU,CACZ,YAAa,CAAE,aAAc50C,EAAE,8DAA8D,EAAG,QAAS,6CAA6C,EACtJ,YAAa,CAAE,aAAcA,EAAE,oCAAoC,EAAG,QAAS,yJAAyJ,EACxO,KAAQ,CAAE,aAAcA,EAAE,+BAA+B,EAAG,QAAS,qDAAqD,EAC1H,KAAQ,CAAE,aAAcA,EAAE,+BAA+B,EAAG,QAAS,wGAAwG,EAC7K,MAAS,CAAE,aAAcA,EAAE,kCAAkC,EAAG,QAAS,uJAAuJ,EAChO,SAAY,CAAE,aAAcA,EAAE,2BAA2B,EAAG,QAAS,uGAAuG,EAC5K,KAAQ,CAAE,aAAcA,EAAE,gCAAgC,EAAG,QAAS,mFAAmF,EACzJ,KAAQ,CAAE,aAAcA,EAAE,gCAAgC,EAAG,QAAS,k/BAAk/B,CAC5jC,EACA,MAAM60C,EAAY,CACd,YAAYnrD,EAAQkM,EAAQjN,EAAS,EAAG,CACpC,KAAK,OAASiN,EACd,KAAK,OAASjN,EACd,KAAK,OAASe,CAClB,CACA,IAAI,UAAW,CACX,MAAO,CAAA,CACX,CACA,UAAW,CACP,MAAO,SAAW,KAAK,KAAO,KAAO,KAAK,OAAS,IAAM,KAAK,OAAS,KAAO,KAAK,OAAS,aAAe,KAAK,OAAO,SAAQ,EAAK,IAAM,GAC9I,CACJ,CACA,MAAMorD,WAAwBD,EAAY,CACtC,YAAYnrD,EAAQkM,EAAQ,CACxB,MAAMlM,EAAQkM,CAAM,EACpB,KAAK,KAAO,OACZ,KAAK,MAAQ,IACjB,CACJ,CACA,MAAMm/C,WAA2BF,EAAY,CACzC,YAAYnrD,EAAQsrD,EAAWp/C,EAAQ,CACnC,MAAMlM,EAAQkM,CAAM,EACpB,KAAK,KAAO,UACZ,KAAK,MAAQo/C,CACjB,CACJ,CACA,MAAMC,WAAyBJ,EAAY,CACvC,YAAYnrD,EAAQkM,EAAQ,CACxB,MAAMlM,EAAQkM,CAAM,EACpB,KAAK,KAAO,QACZ,KAAK,MAAQ,CAAA,CACjB,CACA,IAAI,UAAW,CACX,OAAO,KAAK,KAChB,CACJ,CACA,MAAMs/C,WAA0BL,EAAY,CACxC,YAAYnrD,EAAQkM,EAAQ,CACxB,MAAMlM,EAAQkM,CAAM,EACpB,KAAK,KAAO,SACZ,KAAK,UAAY,GACjB,KAAK,MAAQ,OAAO,GACxB,CACJ,CACA,MAAMu/C,WAA0BN,EAAY,CACxC,YAAYnrD,EAAQkM,EAAQjN,EAAQ,CAChC,MAAMe,EAAQkM,EAAQjN,CAAM,EAC5B,KAAK,KAAO,SACZ,KAAK,MAAQ,EACjB,CACJ,CACA,MAAMysD,WAA4BP,EAAY,CAC1C,YAAYnrD,EAAQkM,EAAQy/C,EAAS,CACjC,MAAM3rD,EAAQkM,CAAM,EACpB,KAAK,KAAO,WACZ,KAAK,YAAc,GACnB,KAAK,QAAUy/C,CACnB,CACA,IAAI,UAAW,CACX,OAAO,KAAK,UAAY,CAAC,KAAK,QAAS,KAAK,SAAS,EAAI,CAAC,KAAK,OAAO,CAC1E,CACJ,CACA,MAAMC,WAA0BT,EAAY,CACxC,YAAYnrD,EAAQkM,EAAQ,CACxB,MAAMlM,EAAQkM,CAAM,EACpB,KAAK,KAAO,SACZ,KAAK,WAAa,CAAA,CACtB,CACA,IAAI,UAAW,CACX,OAAO,KAAK,UAChB,CACJ,CACA,SAAS2/C,GAASC,EAAQ,CACtB,OAAIrL,GAAUqL,CAAM,EACTA,EAAS,CAAA,EAAK,CAAE,IAAO,CAAA,CAAE,EAE7BA,CACX,CACA,IAAIC,IACH,SAAUA,EAAW,CAClBA,EAAUA,EAAU,IAAS,CAAC,EAAI,MAClCA,EAAUA,EAAU,KAAU,CAAC,EAAI,MACvC,GAAGA,KAAcA,GAAY,CAAA,EAAG,EAChC,MAAMC,GAAoB,CACtB,0CAA2CrB,GAAY,GACvD,0CAA2CA,GAAY,GACvD,0CAA2CA,GAAY,GACvD,0CAA2CA,GAAY,GACvD,+CAAgDA,GAAY,SAC5D,+CAAgDA,GAAY,QAChE,EACA,MAAMsB,EAAkB,CACpB,YAAYC,EAAa,CACrB,KAAK,YAAcA,CACvB,CACJ,CACA,MAAMC,EAAgB,CAClB,YAAYC,EAAc,GAAIC,EAAS,CACnC,KAAK,YAAcD,EACnB,KAAK,QAAUC,EACf,KAAK,QAAU,CAAA,CACnB,CACA,IAAIP,EAAQ,CACR,KAAK,QAAQ,KAAKA,CAAM,CAC5B,CACA,MAAM7zC,EAAO,CACT,MAAM,UAAU,KAAK,MAAM,KAAK,QAASA,EAAM,OAAO,CAC1D,CACA,QAAQhX,EAAM,CACV,OAAQ,KAAK,cAAgB,IAAMu8C,GAASv8C,EAAM,KAAK,WAAW,IAAOA,IAAS,KAAK,OAC3F,CACA,QAAS,CACL,OAAO,IAAIkrD,GAAgB,GAAI,KAAK,OAAO,CAC/C,CACJ,CACA,MAAMG,EAAoB,CACtB,aAAc,CAAE,CAChB,IAAI,SAAU,CAAE,MAAO,CAAA,CAAI,CAC3B,IAAIC,EAAS,CAAE,CACf,MAAMC,EAAQ,CAAE,CAChB,QAAQC,EAAO,CAAE,MAAO,EAAM,CAC9B,QAAS,CAAE,OAAO,IAAM,CAC5B,CACAH,GAAoB,SAAW,IAAIA,GACnC,MAAMI,EAAiB,CACnB,aAAc,CACV,KAAK,SAAW,CAAA,EAChB,KAAK,kBAAoB,EACzB,KAAK,oBAAsB,IAAI,IAC/B,KAAK,uBAAyB,EAC9B,KAAK,oBAAsB,EAC3B,KAAK,eAAiB,GACtB,KAAK,WAAa,MACtB,CACA,aAAc,CACV,MAAO,CAAC,CAAC,KAAK,SAAS,MAC3B,CACA,MAAMC,EAAkB,CACpB,KAAK,SAAW,KAAK,SAAS,OAAOA,EAAiB,QAAQ,EAC9D,KAAK,mBAAqBA,EAAiB,kBAC3C,KAAK,wBAA0BA,EAAiB,uBAChD,KAAK,yBAAyBA,CAAgB,CAClD,CACA,gBAAgBA,EAAkB,CAC9B,GAAI,CAAC,KAAK,gBAAkB,CAACA,EAAiB,gBAAkB,KAAK,YAAcA,EAAiB,WAAY,CAC5G,KAAK,WAAa,KAAK,WAAW,OAAOA,EAAiB,UAAU,EACpE,UAAWlxD,KAAS,KAAK,SACjBA,EAAM,OAASivD,EAAU,oBACzBjvD,EAAM,QAAU6a,EAAE,4CAA6C,KAAK,WAAW,IAAIvR,GAAK,KAAK,UAAUA,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAGjI,CACJ,CACA,mBAAmB6nD,EAA0B,CACzC,KAAK,SAAW,KAAK,SAAS,OAAOA,EAAyB,QAAQ,EACtE,KAAK,qBACDA,EAAyB,gBAAkB,CAACA,EAAyB,YAAW,GAAMA,EAAyB,oBAC/G,KAAK,yBAELA,EAAyB,gBAAkBA,EAAyB,YAAcA,EAAyB,WAAW,SAAW,GACjI,KAAK,qBAEb,CACA,yBAAyBD,EAAkB,CACvCA,EAAiB,oBAAoB,QAAQlf,GAAK,KAAK,oBAAoB,IAAIA,CAAC,CAAC,CACrF,CACA,QAAQx1B,EAAO,CACX,MAAM40C,EAAc,KAAK,YAAW,EACpC,OAAIA,IAAgB50C,EAAM,cACf40C,EAAc,GAAK,EAE1B,KAAK,iBAAmB50C,EAAM,eACvBA,EAAM,eAAiB,GAAK,EAEnC,KAAK,sBAAwBA,EAAM,oBAC5B,KAAK,oBAAsBA,EAAM,oBAExC,KAAK,yBAA2BA,EAAM,uBAC/B,KAAK,uBAAyBA,EAAM,uBAExC,KAAK,kBAAoBA,EAAM,iBAC1C,CACJ,CACA,SAAS60C,GAAgBC,EAAMrG,EAAc,GAAI,CAC7C,OAAO,IAAIsG,GAAaD,EAAMrG,EAAa,CAAA,CAAE,CACjD,CACA,SAASpJ,GAAar8C,EAAM,CACxB,OAAOi/C,GAAej/C,CAAI,CAC9B,CACA,SAASo8C,GAAYp8C,EAAM,CACvB,OAAOg/C,GAAch/C,CAAI,CAC7B,CACA,SAASu8C,GAASv8C,EAAMiL,EAAQuxC,EAAoB,GAAO,CACvD,OAAOvxC,GAAUjL,EAAK,QAAUiL,EAAUjL,EAAK,OAASA,EAAK,QAAWw8C,GAAqBvxC,IAAYjL,EAAK,OAASA,EAAK,MAChI,CACA,MAAM+rD,EAAa,CACf,YAAYD,EAAME,EAAe,CAAA,EAAIC,EAAW,CAAA,EAAI,CAChD,KAAK,KAAOH,EACZ,KAAK,aAAeE,EACpB,KAAK,SAAWC,CACpB,CACA,kBAAkBhhD,EAAQuxC,EAAoB,GAAO,CACjD,GAAI,KAAK,KACL,OAAOC,GAAiB,KAAK,KAAMxxC,EAAQuxC,CAAiB,CAGpE,CACA,MAAMG,EAAS,CACX,GAAI,KAAK,KAAM,CACX,MAAMuP,EAAWlsD,GAAS,CACtB,IAAImsD,EAAMxP,EAAQ38C,CAAI,EACtB,MAAM08C,EAAW18C,EAAK,SACtB,GAAI,MAAM,QAAQ08C,CAAQ,EACtB,QAAS9gD,EAAI,EAAGA,EAAI8gD,EAAS,QAAUyP,EAAKvwD,IACxCuwD,EAAMD,EAAQxP,EAAS9gD,CAAC,CAAC,EAGjC,OAAOuwD,CACX,EACAD,EAAQ,KAAK,IAAI,CACrB,CACJ,CACA,SAAShJ,EAAc2H,EAAQzI,EAAWJ,GAAmB,QAASiJ,EAAa,CAC/E,GAAI,KAAK,MAAQJ,EAAQ,CACrB,MAAMa,EAAmB,IAAID,GAC7B,OAAAW,GAAS,KAAK,KAAMvB,EAAQa,EAAkBL,GAAoB,SAAU,IAAIL,GAAkBC,GAAeoB,GAAexB,CAAM,CAAC,CAAC,EACjIa,EAAiB,SAAS,IAAIlf,GAAK,CACtC,MAAM50B,EAAQL,EAAM,OAAO2rC,EAAa,WAAW1W,EAAE,SAAS,MAAM,EAAG0W,EAAa,WAAW1W,EAAE,SAAS,OAASA,EAAE,SAAS,MAAM,CAAC,EACrI,OAAO2V,GAAW,OAAOvqC,EAAO40B,EAAE,QAASA,EAAE,UAAY4V,EAAU5V,EAAE,IAAI,CAC7E,CAAC,CACL,CAEJ,CACA,mBAAmBqe,EAAQM,EAAc,GAAIC,EAAS,CAClD,GAAI,KAAK,MAAQP,EAAQ,CACrB,MAAMyB,EAAkB,IAAIpB,GAAgBC,EAAaC,CAAO,EAC1DH,EAAcoB,GAAexB,CAAM,EACnCjuC,EAAU,IAAIouC,GAAkBC,CAAW,EACjD,OAAAmB,GAAS,KAAK,KAAMvB,EAAQ,IAAIY,GAAoBa,EAAiB1vC,CAAO,EACrE0vC,EAAgB,OAC3B,CACA,MAAO,CAAA,CACX,CACJ,CACA,SAASD,GAAexB,EAAQ0B,EAAW7C,GAAY,SAAU,CAC7D,IAAI8C,EAAW3B,EAAO,QACtB,OAAI2B,EACOzB,GAAkByB,CAAQ,GAAKD,EAEnCA,CACX,CACA,SAASH,GAASrlD,EAAG8jD,EAAQa,EAAkBY,EAAiB1vC,EAAS,CACrE,GAAI,CAAC7V,GAAK,CAACulD,EAAgB,QAAQvlD,CAAC,EAChC,OAEJ,GAAIA,EAAE,OAAS,WACX,OAAOqlD,GAASrlD,EAAE,UAAW8jD,EAAQa,EAAkBY,EAAiB1vC,CAAO,EAEnF,MAAM5c,EAAO+G,EAEb,OADA0lD,EAAa,EACLzsD,EAAK,KAAI,CACb,IAAK,SACD0sD,EAAoB1sD,CAAI,EACxB,MACJ,IAAK,QACD2sD,EAAmB3sD,CAAI,EACvB,MACJ,IAAK,SACD4sD,EAAoB5sD,CAAI,EACxB,MACJ,IAAK,SACD6sD,EAAoB7sD,CAAI,EACxB,KACZ,CACIssD,EAAgB,IAAI,CAAE,KAAMtsD,EAAM,OAAQ6qD,EAAQ,EAClD,SAAS4B,GAAgB,CACrB,SAASK,EAAY1sC,EAAM,CACvB,OAAOpgB,EAAK,OAASogB,GAASA,IAAS,WAAapgB,EAAK,OAAS,UAAYA,EAAK,SACvF,CAiBA,GAhBI,MAAM,QAAQ6qD,EAAO,IAAI,EACpBA,EAAO,KAAK,KAAKiC,CAAW,GAC7BpB,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,cAAgBx1C,EAAE,uCAAwCw1C,EAAO,KAAK,KAAK,IAAI,CAAC,CACpH,CAAiB,EAGAA,EAAO,OACPiC,EAAYjC,EAAO,IAAI,GACxBa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,cAAgBx1C,EAAE,kCAAmCw1C,EAAO,IAAI,CACpG,CAAiB,GAGL,MAAM,QAAQA,EAAO,KAAK,EAC1B,UAAWkC,KAAgBlC,EAAO,MAAO,CACrC,MAAMmC,EAAsB,IAAIvB,GAC1BwB,EAAqBX,EAAgB,OAAM,EACjDF,GAASpsD,EAAM4qD,GAASmC,CAAY,EAAGC,EAAqBC,EAAoBrwC,CAAO,EACvF8uC,EAAiB,MAAMsB,CAAmB,EAC1CV,EAAgB,MAAMW,CAAkB,CAC5C,CAEJ,MAAMC,EAAYtC,GAASC,EAAO,GAAG,EACrC,GAAIqC,EAAW,CACX,MAAMF,EAAsB,IAAIvB,GAC1BwB,EAAqBX,EAAgB,OAAM,EACjDF,GAASpsD,EAAMktD,EAAWF,EAAqBC,EAAoBrwC,CAAO,EACrEowC,EAAoB,eACrBtB,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,cAAgBx1C,EAAE,uCAAuC,CAC7F,CAAiB,EAEL,UAAW83C,KAAMF,EAAmB,QAChCE,EAAG,SAAW,CAACA,EAAG,SAClBb,EAAgB,IAAIa,CAAE,CAE9B,CACA,MAAMC,EAAmB,CAACC,EAAcC,IAAgB,CACpD,MAAM1d,EAAU,CAAA,EAEhB,IAAI2d,EACJ,UAAWR,KAAgBM,EAAc,CACrC,MAAMG,EAAY5C,GAASmC,CAAY,EACjCC,EAAsB,IAAIvB,GAC1BwB,EAAqBX,EAAgB,OAAM,EAKjD,GAJAF,GAASpsD,EAAMwtD,EAAWR,EAAqBC,EAAoBrwC,CAAO,EACrEowC,EAAoB,eACrBpd,EAAQ,KAAK4d,CAAS,EAEtB,CAACD,EACDA,EAAY,CAAE,OAAQC,EAAW,iBAAkBR,EAAqB,gBAAiBC,CAAkB,UAGvG,CAACK,GAAe,CAACN,EAAoB,YAAW,GAAM,CAACO,EAAU,iBAAiB,cAElFA,EAAU,gBAAgB,MAAMN,CAAkB,EAClDM,EAAU,iBAAiB,mBAAqBP,EAAoB,kBACpEO,EAAU,iBAAiB,wBAA0BP,EAAoB,uBACzEO,EAAU,iBAAiB,yBAAyBP,CAAmB,MAEtE,CACD,MAAMS,EAAgBT,EAAoB,QAAQO,EAAU,gBAAgB,EACxEE,EAAgB,EAEhBF,EAAY,CAAE,OAAQC,EAAW,iBAAkBR,EAAqB,gBAAiBC,CAAkB,EAEtGQ,IAAkB,IAEvBF,EAAU,gBAAgB,MAAMN,CAAkB,EAClDM,EAAU,iBAAiB,gBAAgBP,CAAmB,EAEtE,CAER,CACA,OAAIpd,EAAQ,OAAS,GAAK0d,GACtB5B,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQ,CAAC,EAC1C,QAASqV,EAAE,uDAAuD,CACtF,CAAiB,EAEDk4C,IACA7B,EAAiB,MAAM6B,EAAU,gBAAgB,EACjDjB,EAAgB,MAAMiB,EAAU,eAAe,GAE5C3d,EAAQ,MACnB,EACI,MAAM,QAAQib,EAAO,KAAK,GAC1BuC,EAAiBvC,EAAO,MAAO,EAAK,EAEpC,MAAM,QAAQA,EAAO,KAAK,GAC1BuC,EAAiBvC,EAAO,MAAO,EAAI,EAEvC,MAAM6C,EAAc7C,GAAW,CAC3B,MAAMmC,EAAsB,IAAIvB,GAC1BwB,EAAqBX,EAAgB,OAAM,EACjDF,GAASpsD,EAAM4qD,GAASC,CAAM,EAAGmC,EAAqBC,EAAoBrwC,CAAO,EACjF8uC,EAAiB,MAAMsB,CAAmB,EAC1CV,EAAgB,MAAMW,CAAkB,CAC5C,EACMU,EAAgB,CAACC,EAAUC,EAAYC,IAAe,CACxD,MAAMN,EAAY5C,GAASgD,CAAQ,EAC7BZ,EAAsB,IAAIvB,GAC1BwB,EAAqBX,EAAgB,OAAM,EACjDF,GAASpsD,EAAMwtD,EAAWR,EAAqBC,EAAoBrwC,CAAO,EAC1E0vC,EAAgB,MAAMW,CAAkB,EACxCvB,EAAiB,yBAAyBsB,CAAmB,EACxDA,EAAoB,cAKhBc,GACLJ,EAAWI,CAAU,EALjBD,GACAH,EAAWG,CAAU,CAMjC,EACMD,EAAWhD,GAASC,EAAO,EAAE,EAInC,GAHI+C,GACAD,EAAcC,EAAUhD,GAASC,EAAO,IAAI,EAAGD,GAASC,EAAO,IAAI,CAAC,EAEpE,MAAM,QAAQA,EAAO,IAAI,EAAG,CAC5B,MAAM77C,EAAMqtC,GAAar8C,CAAI,EAC7B,IAAI+tD,EAAiB,GACrB,UAAW1zD,KAAKwwD,EAAO,KACnB,GAAI9nD,GAAOiM,EAAK3U,CAAC,EAAG,CAChB0zD,EAAiB,GACjB,KACJ,CAEJrC,EAAiB,WAAab,EAAO,KACrCa,EAAiB,eAAiBqC,EAC7BA,GACDrC,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,KAAMypD,EAAU,kBAChB,QAASoB,EAAO,cAAgBx1C,EAAE,4CAA6Cw1C,EAAO,KAAK,IAAI/mD,GAAK,KAAK,UAAUA,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CACrJ,CAAiB,CAET,CACA,GAAIy7C,GAAUsL,EAAO,KAAK,EAAG,CACzB,MAAM77C,EAAMqtC,GAAar8C,CAAI,EACxB+C,GAAOiM,EAAK67C,EAAO,KAAK,EASzBa,EAAiB,eAAiB,IARlCA,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,KAAMypD,EAAU,kBAChB,QAASoB,EAAO,cAAgBx1C,EAAE,qBAAsB,KAAK,UAAUw1C,EAAO,KAAK,CAAC,CACxG,CAAiB,EACDa,EAAiB,eAAiB,IAKtCA,EAAiB,WAAa,CAACb,EAAO,KAAK,CAC/C,CACA,IAAImD,EAAqBnD,EAAO,mBAChC,GAAImD,GAAsBnD,EAAO,WAAY,CACzCmD,EAAqBA,GAAsB34C,EAAE,qBAAqB,EAClE,IAAI44C,EAAajuD,EAAK,QAAQ,OAAS,WAAaA,EAAK,OAASA,EAClE0rD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQuC,EAAW,OAAQ,OAAQA,EAAW,MAAM,EAChE,SAAUjM,GAAmB,QAC7B,QAASgM,EACT,KAAMvE,EAAU,UAChC,CAAa,CACL,CACJ,CACA,SAASoD,EAAoB7sD,EAAM,CAC/B,MAAMgP,EAAMhP,EAAK,MACjB,SAASkuD,EAAgBC,EAAO,CAC5B,MAAMC,EAAQ,uCAAuC,KAAKD,EAAM,SAAQ,CAAE,EAC1E,OAAOC,GAAS,CACZ,MAAO,OAAOA,EAAM,CAAC,GAAKA,EAAM,CAAC,GAAK,GAAG,EACzC,YAAaA,EAAM,CAAC,GAAG,QAAU,IAAM,SAASA,EAAM,CAAC,CAAC,GAAK,EAC7E,CACQ,CACA,GAAI9O,GAASuL,EAAO,UAAU,EAAG,CAC7B,IAAIlX,EAAY,GAChB,GAAI,OAAO,UAAUkX,EAAO,UAAU,EAClClX,EAAY3kC,EAAM67C,EAAO,eAExB,CACD,IAAIwD,EAAiBH,EAAgBrD,EAAO,UAAU,EAClDyD,EAAYJ,EAAgBl/C,CAAG,EACnC,GAAIq/C,GAAkBC,EAAW,CAC7B,MAAMC,EAAa,IAAM,KAAK,IAAID,EAAU,WAAaD,EAAe,UAAU,EAC9EC,EAAU,WAAaD,EAAe,WACtCC,EAAU,OAASC,EAGnBF,EAAe,OAASE,EAE5B5a,EAAY2a,EAAU,MAAQD,EAAe,KACjD,CACJ,CACI1a,IAAc,GACd+X,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,iCAAkCw1C,EAAO,UAAU,CAClF,CAAiB,CAET,CACA,SAAS2D,EAAkBthC,EAAOuhC,EAAW,CACzC,GAAInP,GAASmP,CAAS,EAClB,OAAOA,EAEX,GAAIjP,GAAUiP,CAAS,GAAKA,EACxB,OAAOvhC,CAGf,CACA,SAASwhC,EAASxhC,EAAOuhC,EAAW,CAChC,GAAI,CAACjP,GAAUiP,CAAS,GAAK,CAACA,EAC1B,OAAOvhC,CAGf,CACA,MAAMyhC,EAAmBH,EAAkB3D,EAAO,QAASA,EAAO,gBAAgB,EAC9EvL,GAASqP,CAAgB,GAAK3/C,GAAO2/C,GACrCjD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,+CAAgDs5C,CAAgB,CAC3F,CAAa,EAEL,MAAMC,EAAmBJ,EAAkB3D,EAAO,QAASA,EAAO,gBAAgB,EAC9EvL,GAASsP,CAAgB,GAAK5/C,GAAO4/C,GACrClD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,+CAAgDu5C,CAAgB,CAC3F,CAAa,EAEL,MAAMC,EAAUH,EAAS7D,EAAO,QAASA,EAAO,gBAAgB,EAC5DvL,GAASuP,CAAO,GAAK7/C,EAAM6/C,GAC3BnD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,qCAAsCw5C,CAAO,CACxE,CAAa,EAEL,MAAMC,EAAUJ,EAAS7D,EAAO,QAASA,EAAO,gBAAgB,EAC5DvL,GAASwP,CAAO,GAAK9/C,EAAM8/C,GAC3BpD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,qCAAsCy5C,CAAO,CACxE,CAAa,CAET,CACA,SAASlC,EAAoB5sD,EAAM,CAsB/B,GArBIs/C,GAASuL,EAAO,SAAS,GAAK7K,GAAahgD,EAAK,KAAK,EAAI6qD,EAAO,WAChEa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,oDAAqDw1C,EAAO,SAAS,CAChG,CAAa,EAEDvL,GAASuL,EAAO,SAAS,GAAK7K,GAAahgD,EAAK,KAAK,EAAI6qD,EAAO,WAChEa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,mDAAoDw1C,EAAO,SAAS,CAC/F,CAAa,EAED9uD,GAAS8uD,EAAO,OAAO,IACT/K,GAAe+K,EAAO,OAAO,GAC9B,KAAK7qD,EAAK,KAAK,GACxB0rD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,qBAAuBA,EAAO,cAAgBx1C,EAAE,8CAA+Cw1C,EAAO,OAAO,CACjJ,CAAiB,GAGLA,EAAO,OACP,OAAQA,EAAO,OAAM,CACjB,IAAK,MACL,IAAK,gBACD,CACI,IAAIkE,EACJ,GAAI,CAAC/uD,EAAK,MACN+uD,EAAe15C,EAAE,eAAe,MAE/B,CACD,MAAM/N,EAAQ,+DAA+D,KAAKtH,EAAK,KAAK,EACvFsH,EAGI,CAACA,EAAM,CAAC,GAAKujD,EAAO,SAAW,QACpCkE,EAAe15C,EAAE,gCAAgC,GAHjD05C,EAAe15C,EAAE,kBAAkB,CAK3C,CACI05C,GACArD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,qBAAuBA,EAAO,cAAgBx1C,EAAE,2BAA4B05C,CAAY,CACxI,CAA6B,CAET,CACA,MACJ,IAAK,YACL,IAAK,YACL,IAAK,OACL,IAAK,OACL,IAAK,QACL,IAAK,WACL,IAAK,OACL,IAAK,OACD,MAAMngB,EAASqb,GAAQY,EAAO,MAAM,GAChC,CAAC7qD,EAAK,OAAS,CAAC4uC,EAAO,QAAQ,KAAK5uC,EAAK,KAAK,IAC9C0rD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,qBAAuBA,EAAO,cAAgBjc,EAAO,YACjG,CAAyB,CAEzB,CAEI,CACA,SAAS+d,EAAmB3sD,EAAM,CAC9B,IAAIgvD,EACAC,EACAryC,EAAQ,aAAe8sC,GAAY,UACnCsF,EAAqBnE,EAAO,YAC5BoE,EAAwB,MAAM,QAAQpE,EAAO,KAAK,EAAmB,OAAfA,EAAO,QAG7DmE,EAAqB,MAAM,QAAQnE,EAAO,KAAK,EAAIA,EAAO,MAAQ,OAClEoE,EAAwB,MAAM,QAAQpE,EAAO,KAAK,EAAmBA,EAAO,gBAAtBA,EAAO,OAEjE,IAAIrtD,EAAQ,EACZ,GAAIwxD,IAAuB,OAAW,CAClC,MAAMrlB,EAAM,KAAK,IAAIqlB,EAAmB,OAAQhvD,EAAK,MAAM,MAAM,EACjE,KAAOxC,EAAQmsC,EAAKnsC,IAAS,CACzB,MAAMuvD,EAAeiC,EAAmBxxD,CAAK,EACvCgwD,EAAY5C,GAASmC,CAAY,EACjCmC,EAAuB,IAAIzD,GAC3B7tD,EAAOoC,EAAK,MAAMxC,CAAK,EACzBI,IACAwuD,GAASxuD,EAAM4vD,EAAW0B,EAAsB5C,EAAiB1vC,CAAO,EACxE8uC,EAAiB,mBAAmBwD,CAAoB,GAE5DxD,EAAiB,oBAAoB,IAAI,OAAOluD,CAAK,CAAC,CAC1D,CACJ,CACA,GAAIyxD,IAAyB,QAAazxD,EAAQwC,EAAK,MAAM,OACzD,GAAI,OAAOivD,GAAyB,UAOhC,IANIA,IAAyB,IACzBvD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,uEAAwE7X,CAAK,CAChH,CAAqB,EAEEA,EAAQwC,EAAK,MAAM,OAAQxC,IAC9BkuD,EAAiB,oBAAoB,IAAI,OAAOluD,CAAK,CAAC,EACtDkuD,EAAiB,6BAIrB,MAAOluD,EAAQwC,EAAK,MAAM,OAAQxC,IAAS,CACvC,MAAM0xD,EAAuB,IAAIzD,GACjCW,GAASpsD,EAAK,MAAMxC,CAAK,EAAGyxD,EAAsBC,EAAsB5C,EAAiB1vC,CAAO,EAChG8uC,EAAiB,mBAAmBwD,CAAoB,EACxDxD,EAAiB,oBAAoB,IAAI,OAAOluD,CAAK,CAAC,CAC1D,CAGR,MAAM2xD,EAAiBvE,GAASC,EAAO,QAAQ,EAC/C,GAAIsE,EAAgB,CAChB,IAAIC,EAAgB,EACpB,QAAS5xD,EAAQ,EAAGA,EAAQwC,EAAK,MAAM,OAAQxC,IAAS,CACpD,MAAMI,EAAOoC,EAAK,MAAMxC,CAAK,EACvB0xD,EAAuB,IAAIzD,GACjCW,GAASxuD,EAAMuxD,EAAgBD,EAAsB7D,GAAoB,SAAUzuC,CAAO,EACrFsyC,EAAqB,gBACtBE,IACIxyC,EAAQ,aAAe8sC,GAAY,UACnCgC,EAAiB,oBAAoB,IAAI,OAAOluD,CAAK,CAAC,EAGlE,CACI4xD,IAAkB,GAAK,CAAC9P,GAASuL,EAAO,WAAW,GACnDa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,cAAgBx1C,EAAE,uCAAuC,CAC7F,CAAiB,EAEDiqC,GAASuL,EAAO,WAAW,GAAKuE,EAAgBvE,EAAO,aACvDa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,cAAgBx1C,EAAE,mFAAoFw1C,EAAO,WAAW,CAC5J,CAAiB,EAEDvL,GAASuL,EAAO,WAAW,GAAKuE,EAAgBvE,EAAO,aACvDa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAAS6qD,EAAO,cAAgBx1C,EAAE,oFAAqFw1C,EAAO,WAAW,CAC7J,CAAiB,CAET,CACA,MAAMwE,EAAmBxE,EAAO,iBAChC,GAAIwE,IAAqB,OACrB,QAASzzD,EAAI,EAAGA,EAAIoE,EAAK,MAAM,OAAQpE,IAAK,CACxC,GAAI,CAAC8vD,EAAiB,oBAAoB,IAAI,OAAO9vD,CAAC,CAAC,EACnD,GAAIyzD,IAAqB,GACrB3D,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,yDAAyD,CAChG,CAAyB,MAEA,CACD,MAAM65C,EAAuB,IAAIzD,GACjCW,GAASpsD,EAAK,MAAMpE,CAAC,EAAGivD,EAAO,iBAAkBqE,EAAsB5C,EAAiB1vC,CAAO,EAC/F8uC,EAAiB,mBAAmBwD,CAAoB,CAC5D,CAEJxD,EAAiB,oBAAoB,IAAI,OAAO9vD,CAAC,CAAC,EAClD8vD,EAAiB,wBACrB,CAcJ,GAZIpM,GAASuL,EAAO,QAAQ,GAAK7qD,EAAK,MAAM,OAAS6qD,EAAO,UACxDa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,iDAAkDw1C,EAAO,QAAQ,CAC5F,CAAa,EAEDvL,GAASuL,EAAO,QAAQ,GAAK7qD,EAAK,MAAM,OAAS6qD,EAAO,UACxDa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,mDAAoDw1C,EAAO,QAAQ,CAC9F,CAAa,EAEDA,EAAO,cAAgB,GAAM,CAE7B,IAASyE,EAAT,UAAyB,CACrB,QAAS1zD,EAAI,EAAGA,EAAI0xB,EAAO,OAAS,EAAG1xB,IAAK,CACxC,MAAMR,EAAQkyB,EAAO1xB,CAAC,EACtB,QAASia,EAAIja,EAAI,EAAGia,EAAIyX,EAAO,OAAQzX,IACnC,GAAI9S,GAAO3H,EAAOkyB,EAAOzX,CAAC,CAAC,EACvB,MAAO,EAGnB,CACA,MAAO,EACX,EAXA,MAAMyX,EAAS+uB,GAAar8C,CAAI,EAY5BsvD,EAAa,GACb5D,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,4BAA4B,CAC3D,CAAiB,CAET,CACJ,CACA,SAASq3C,EAAoB1sD,EAAM,CAC/B,MAAMuvD,EAAW,OAAO,OAAO,IAAI,EAC7BC,EAAwB,IAAI,IAClC,UAAWC,KAAgBzvD,EAAK,WAAY,CACxC,MAAMwJ,EAAMimD,EAAa,QAAQ,MACjCF,EAAS/lD,CAAG,EAAIimD,EAAa,UAC7BD,EAAsB,IAAIhmD,CAAG,CACjC,CACA,GAAI,MAAM,QAAQqhD,EAAO,QAAQ,GAC7B,UAAW6E,KAAgB7E,EAAO,SAC9B,GAAI,CAAC0E,EAASG,CAAY,EAAG,CACzB,MAAMhF,EAAU1qD,EAAK,QAAUA,EAAK,OAAO,OAAS,YAAcA,EAAK,OAAO,QACxE+hD,EAAW2I,EAAU,CAAE,OAAQA,EAAQ,OAAQ,OAAQA,EAAQ,MAAM,EAAK,CAAE,OAAQ1qD,EAAK,OAAQ,OAAQ,CAAC,EAChH0rD,EAAiB,SAAS,KAAK,CAC3B,SAAU3J,EACV,QAAS1sC,EAAE,0BAA2Bq6C,CAAY,CAC1E,CAAqB,CACL,EAGR,MAAMC,EAAqB/X,GAAS,CAChC4X,EAAsB,OAAO5X,CAAI,EACjC8T,EAAiB,oBAAoB,IAAI9T,CAAI,CACjD,EACA,GAAIiT,EAAO,WACP,UAAW6E,KAAgB,OAAO,KAAK7E,EAAO,UAAU,EAAG,CACvD8E,EAAkBD,CAAY,EAC9B,MAAME,EAAiB/E,EAAO,WAAW6E,CAAY,EAC/C5wD,EAAQywD,EAASG,CAAY,EACnC,GAAI5wD,EACA,GAAI0gD,GAAUoQ,CAAc,EACxB,GAAKA,EAQDlE,EAAiB,oBACjBA,EAAiB,6BATA,CACjB,MAAM+D,EAAe3wD,EAAM,OAC3B4sD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ+D,EAAa,QAAQ,OAAQ,OAAQA,EAAa,QAAQ,MAAM,EACpF,QAAS5E,EAAO,cAAgBx1C,EAAE,+BAAgCq6C,CAAY,CAC9G,CAA6B,CACL,KAMC,CACD,MAAM/D,EAA2B,IAAIF,GACrCW,GAASttD,EAAO8wD,EAAgBjE,EAA0BW,EAAiB1vC,CAAO,EAClF8uC,EAAiB,mBAAmBC,CAAwB,CAChE,CAER,CAEJ,GAAId,EAAO,kBACP,UAAWgF,KAAmB,OAAO,KAAKhF,EAAO,iBAAiB,EAAG,CACjE,MAAM56B,EAAQ6vB,GAAe+P,CAAe,EAC5C,GAAI5/B,EAAO,CACP,MAAM6/B,EAAY,CAAA,EAClB,UAAWJ,KAAgBF,EACvB,GAAIv/B,EAAM,KAAKy/B,CAAY,EAAG,CAC1BI,EAAU,KAAKJ,CAAY,EAC3B,MAAM5wD,EAAQywD,EAASG,CAAY,EACnC,GAAI5wD,EAAO,CACP,MAAM8wD,EAAiB/E,EAAO,kBAAkBgF,CAAe,EAC/D,GAAIrQ,GAAUoQ,CAAc,EACxB,GAAKA,EAQDlE,EAAiB,oBACjBA,EAAiB,6BATA,CACjB,MAAM+D,EAAe3wD,EAAM,OAC3B4sD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ+D,EAAa,QAAQ,OAAQ,OAAQA,EAAa,QAAQ,MAAM,EACpF,QAAS5E,EAAO,cAAgBx1C,EAAE,+BAAgCq6C,CAAY,CAC1H,CAAyC,CACL,KAMC,CACD,MAAM/D,EAA2B,IAAIF,GACrCW,GAASttD,EAAO8wD,EAAgBjE,EAA0BW,EAAiB1vC,CAAO,EAClF8uC,EAAiB,mBAAmBC,CAAwB,CAChE,CACJ,CACJ,CAEJmE,EAAU,QAAQH,CAAiB,CACvC,CACJ,CAEJ,MAAMI,EAAuBlF,EAAO,qBACpC,GAAIkF,IAAyB,OACzB,UAAWL,KAAgBF,EAAuB,CAC9CG,EAAkBD,CAAY,EAC9B,MAAM5wD,EAAQywD,EAASG,CAAY,EACnC,GAAI5wD,GACA,GAAIixD,IAAyB,GAAO,CAChC,MAAMN,EAAe3wD,EAAM,OAC3B4sD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ+D,EAAa,QAAQ,OAAQ,OAAQA,EAAa,QAAQ,MAAM,EACpF,QAAS5E,EAAO,cAAgBx1C,EAAE,+BAAgCq6C,CAAY,CAC1G,CAAyB,CACL,SACSK,IAAyB,GAAM,CACpC,MAAMpE,EAA2B,IAAIF,GACrCW,GAASttD,EAAOixD,EAAsBpE,EAA0BW,EAAiB1vC,CAAO,EACxF8uC,EAAiB,mBAAmBC,CAAwB,CAChE,EAER,CAEJ,MAAMqE,EAAwBnF,EAAO,sBACrC,GAAImF,IAA0B,OAAW,CACrC,MAAMF,EAAY,CAAA,EAClB,UAAWJ,KAAgBF,EACvB,GAAI,CAAC9D,EAAiB,oBAAoB,IAAIgE,CAAY,EAAG,CACzDI,EAAU,KAAKJ,CAAY,EAC3B,MAAM5wD,EAAQywD,EAASG,CAAY,EACnC,GAAI5wD,GACA,GAAIkxD,IAA0B,GAAO,CACjC,MAAMP,EAAe3wD,EAAM,OAC3B4sD,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ+D,EAAa,QAAQ,OAAQ,OAAQA,EAAa,QAAQ,MAAM,EACpF,QAAS5E,EAAO,cAAgBx1C,EAAE,+BAAgCq6C,CAAY,CAC9G,CAA6B,CACL,SACSM,IAA0B,GAAM,CACrC,MAAMrE,EAA2B,IAAIF,GACrCW,GAASttD,EAAOkxD,EAAuBrE,EAA0BW,EAAiB1vC,CAAO,EACzF8uC,EAAiB,mBAAmBC,CAAwB,CAChE,EAER,CAEJmE,EAAU,QAAQH,CAAiB,CACvC,CAiBA,GAhBIrQ,GAASuL,EAAO,aAAa,GACzB7qD,EAAK,WAAW,OAAS6qD,EAAO,eAChCa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,gDAAiDw1C,EAAO,aAAa,CACpG,CAAiB,EAGLvL,GAASuL,EAAO,aAAa,GACzB7qD,EAAK,WAAW,OAAS6qD,EAAO,eAChCa,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,8DAA+Dw1C,EAAO,aAAa,CAClH,CAAiB,EAGLA,EAAO,kBACP,UAAWrhD,KAAOqhD,EAAO,kBAAmB,CACxC,MAAMjT,EAAO2X,EAAS/lD,CAAG,EACnBymD,EAAepF,EAAO,kBAAkBrhD,CAAG,EAC7CouC,GAAQ,MAAM,QAAQqY,CAAY,GAClCC,EAA8B1mD,EAAKymD,CAAY,CAEvD,CAEJ,GAAIpF,EAAO,iBACP,UAAWrhD,KAAOqhD,EAAO,iBAAkB,CACvC,MAAMjT,EAAO2X,EAAS/lD,CAAG,EACnBymD,EAAepF,EAAO,iBAAiBrhD,CAAG,EAC5CouC,GAAQ6H,GAASwQ,CAAY,GAC7BC,EAA8B1mD,EAAKymD,CAAY,CAEvD,CAEJ,GAAIpF,EAAO,aACP,UAAWrhD,KAAOqhD,EAAO,aACR0E,EAAS/lD,CAAG,GAErB0mD,EAA8B1mD,EAAKqhD,EAAO,aAAarhD,CAAG,CAAC,EAIvE,MAAM2mD,EAAgBvF,GAASC,EAAO,aAAa,EACnD,GAAIsF,EACA,UAAW79B,KAAKtyB,EAAK,WAAY,CAC7B,MAAMwJ,EAAM8oB,EAAE,QACV9oB,GACA4iD,GAAS5iD,EAAK2mD,EAAezE,EAAkBL,GAAoB,SAAUzuC,CAAO,CAE5F,CAEJ,SAASszC,EAA8B1mD,EAAK4mD,EAAa,CACrD,GAAI,MAAM,QAAQA,CAAW,EACzB,UAAWC,KAAgBD,EAClBb,EAASc,CAAY,EAOtB3E,EAAiB,yBANjBA,EAAiB,SAAS,KAAK,CAC3B,SAAU,CAAE,OAAQ1rD,EAAK,OAAQ,OAAQA,EAAK,MAAM,EACpD,QAASqV,EAAE,2DAA4Dg7C,EAAc7mD,CAAG,CACpH,CAAyB,MAOR,CACD,MAAMomD,EAAiBhF,GAASwF,CAAW,EAC3C,GAAIR,EAAgB,CAChB,MAAMjE,EAA2B,IAAIF,GACrCW,GAASpsD,EAAM4vD,EAAgBjE,EAA0BW,EAAiB1vC,CAAO,EACjF8uC,EAAiB,mBAAmBC,CAAwB,CAChE,CACJ,CACJ,CACJ,CACJ,CACA,SAAS9c,GAAMqU,EAAc/zB,EAAQ,CACjC,MAAMmhC,EAAW,CAAA,EACjB,IAAIC,EAAoB,GACxB,MAAMr0C,EAAOgnC,EAAa,QAAO,EAC3BvI,EAAU7C,GAAc57B,EAAM,EAAK,EACnCs0C,EAAgBrhC,GAAUA,EAAO,gBAAkB,CAAA,EAAK,OAC9D,SAASshC,GAAY,CACjB,OAAa,CACT,MAAMxY,EAAQ0C,EAAQ,KAAI,EAE1B,OADA+V,EAAe,EACPzY,EAAK,CACT,IAAK,IACL,IAAK,IACG,MAAM,QAAQuY,CAAa,GAC3BA,EAAc,KAAKj5C,EAAM,OAAO2rC,EAAa,WAAWvI,EAAQ,eAAc,CAAE,EAAGuI,EAAa,WAAWvI,EAAQ,eAAc,EAAKA,EAAQ,eAAc,CAAE,CAAC,CAAC,EAEpK,MACJ,IAAK,IACL,IAAK,IACD,MACJ,QACI,OAAO1C,CAC3B,CACQ,CACJ,CACA,SAAS0Y,EAAcj2D,EAAS2P,EAAM4wC,EAAaf,EAAWkI,EAAWJ,GAAmB,MAAO,CAC/F,GAAIsO,EAAS,SAAW,GAAKrV,IAAgBsV,EAAmB,CAC5D,MAAM34C,EAAQL,EAAM,OAAO2rC,EAAa,WAAWjI,CAAW,EAAGiI,EAAa,WAAWhJ,CAAS,CAAC,EACnGoW,EAAS,KAAKnO,GAAW,OAAOvqC,EAAOld,EAAS0nD,EAAU/3C,EAAM64C,EAAa,UAAU,CAAC,EACxFqN,EAAoBtV,CACxB,CACJ,CACA,SAAS2V,EAAOl2D,EAAS2P,EAAMrK,EAAO,OAAW+9C,EAAiB,CAAA,EAAIC,EAAY,GAAI,CAClF,IAAIxlC,EAAQmiC,EAAQ,eAAc,EAC9B1zC,EAAM0zC,EAAQ,eAAc,EAAKA,EAAQ,eAAc,EAC3D,GAAIniC,IAAUvR,GAAOuR,EAAQ,EAAG,CAE5B,IADAA,IACOA,EAAQ,GAAK,KAAK,KAAK0D,EAAK,OAAO1D,CAAK,CAAC,GAC5CA,IAEJvR,EAAMuR,EAAQ,CAClB,CAKA,GAJAm4C,EAAcj2D,EAAS2P,EAAMmO,EAAOvR,CAAG,EACnCjH,GACA6wD,EAAU7wD,EAAM,EAAK,EAErB+9C,EAAe,OAASC,EAAU,OAAS,EAAG,CAC9C,IAAI/F,EAAQ0C,EAAQ,SAAQ,EAC5B,KAAO1C,IAAU,IAA8B,CAC3C,GAAI8F,EAAe,QAAQ9F,CAAK,IAAM,GAAI,CACtCwY,EAAS,EACT,KACJ,SACSzS,EAAU,QAAQ/F,CAAK,IAAM,GAClC,MAEJA,EAAQwY,EAAS,CACrB,CACJ,CACA,OAAOzwD,CACX,CACA,SAAS0wD,GAAkB,CACvB,OAAQ/V,EAAQ,cAAa,EAAE,CAC3B,IAAK,GACD,OAAAiW,EAAOv7C,EAAE,qCAAqC,EAAGo0C,EAAU,cAAc,EAClE,GACX,IAAK,GACD,OAAAmH,EAAOv7C,EAAE,qCAAqC,EAAGo0C,EAAU,sBAAsB,EAC1E,GACX,IAAK,GACD,OAAAmH,EAAOv7C,EAAE,2BAA2B,EAAGo0C,EAAU,qBAAqB,EAC/D,GACX,IAAK,GACD,OAAAmH,EAAOv7C,EAAE,4BAA4B,EAAGo0C,EAAU,sBAAsB,EACjE,GACX,IAAK,GACD,OAAAmH,EAAOv7C,EAAE,2BAA2B,EAAGo0C,EAAU,qBAAqB,EAC/D,GACX,IAAK,GACD,OAAAmH,EAAOv7C,EAAE,mEAAmE,EAAGo0C,EAAU,gBAAgB,EAClG,EACvB,CACQ,MAAO,EACX,CACA,SAASoH,EAAU7wD,EAAMg5C,EAAU,CAC/B,OAAAh5C,EAAK,OAAS26C,EAAQ,eAAc,EAAKA,EAAQ,eAAc,EAAK36C,EAAK,OACrEg5C,GACAyX,EAAS,EAENzwD,CACX,CACA,SAAS8wD,EAAY/xD,EAAQ,CACzB,GAAI47C,EAAQ,SAAQ,IAAO,EACvB,OAEJ,MAAM36C,EAAO,IAAIsqD,GAAiBvrD,EAAQ47C,EAAQ,eAAc,CAAE,EAClE8V,IACA,IAAIjS,EAAa,GACjB,KAAO7D,EAAQ,aAAe,GAA6CA,EAAQ,SAAQ,IAAO,IAA8B,CAC5H,GAAIA,EAAQ,SAAQ,IAAO,EAAoC,CACtD6D,GACDoS,EAAOv7C,EAAE,gBAAgB,EAAGo0C,EAAU,aAAa,EAEvD,MAAMsH,EAAcpW,EAAQ,eAAc,EAE1C,GADA8V,IACI9V,EAAQ,SAAQ,IAAO,EAA2C,CAC9D6D,GACAmS,EAAct7C,EAAE,gBAAgB,EAAGo0C,EAAU,cAAesH,EAAaA,EAAc,CAAC,EAE5F,QACJ,CACJ,MACSvS,GACLoS,EAAOv7C,EAAE,gBAAgB,EAAGo0C,EAAU,aAAa,EAEvD,MAAM7rD,EAAOozD,EAAYhxD,CAAI,EACxBpC,EAIDoC,EAAK,MAAM,KAAKpC,CAAI,EAHpBgzD,EAAOv7C,EAAE,gBAAgB,EAAGo0C,EAAU,cAAe,OAAW,GAAI,CAAC,EAA2C,EAAmC,EAKvJjL,EAAa,EACjB,CACA,OAAI7D,EAAQ,SAAQ,IAAO,EAChBiW,EAAOv7C,EAAE,mCAAmC,EAAGo0C,EAAU,2BAA4BzpD,CAAI,EAE7F6wD,EAAU7wD,EAAM,EAAI,CAC/B,CACA,MAAMixD,EAAiB,IAAIzG,GAAkB,OAAW,EAAG,CAAC,EAC5D,SAAS0G,EAAenyD,EAAQoyD,EAAU,CACtC,MAAMnxD,EAAO,IAAIyqD,GAAoB1rD,EAAQ47C,EAAQ,eAAc,EAAIsW,CAAc,EACrF,IAAIznD,EAAM4nD,EAAapxD,CAAI,EAC3B,GAAI,CAACwJ,EACD,GAAImxC,EAAQ,SAAQ,IAAO,GAAkC,CAEzDiW,EAAOv7C,EAAE,oCAAoC,EAAGo0C,EAAU,8BAA8B,EACxF,MAAMiB,EAAU,IAAIF,GAAkBxqD,EAAM26C,EAAQ,eAAc,EAAIA,EAAQ,gBAAgB,EAC9F+P,EAAQ,MAAQ/P,EAAQ,cAAa,EACrCnxC,EAAMkhD,EACN+F,GACJ,KAEI,QAMR,GAHAzwD,EAAK,QAAUwJ,EAGXA,EAAI,QAAU,KAAM,CACpB,MAAMwtC,EAAOma,EAAS3nD,EAAI,KAAK,EAC3BwtC,GACA2Z,EAAct7C,EAAE,sBAAsB,EAAGo0C,EAAU,aAAczpD,EAAK,QAAQ,OAAQA,EAAK,QAAQ,OAASA,EAAK,QAAQ,OAAQgiD,GAAmB,OAAO,EACvJvC,GAASzI,CAAI,GACb2Z,EAAct7C,EAAE,sBAAsB,EAAGo0C,EAAU,aAAczS,EAAK,QAAQ,OAAQA,EAAK,QAAQ,OAASA,EAAK,QAAQ,OAAQgL,GAAmB,OAAO,EAE/JmP,EAAS3nD,EAAI,KAAK,EAAI,IAGtB2nD,EAAS3nD,EAAI,KAAK,EAAIxJ,CAE9B,CACA,GAAI26C,EAAQ,SAAQ,IAAO,EACvB36C,EAAK,YAAc26C,EAAQ,eAAc,EACzC8V,YAGAG,EAAOv7C,EAAE,gBAAgB,EAAGo0C,EAAU,aAAa,EAC/C9O,EAAQ,aAAe,IAA0CuI,EAAa,WAAW15C,EAAI,OAASA,EAAI,MAAM,EAAE,KAAO05C,EAAa,WAAWvI,EAAQ,eAAc,CAAE,EAAE,KAC3K,OAAA36C,EAAK,OAASwJ,EAAI,OACXxJ,EAGf,MAAM5E,EAAQ41D,EAAYhxD,CAAI,EAC9B,OAAK5E,GAGL4E,EAAK,UAAY5E,EACjB4E,EAAK,OAAS5E,EAAM,OAASA,EAAM,OAAS4E,EAAK,OAC1CA,GAJI4wD,EAAOv7C,EAAE,gBAAgB,EAAGo0C,EAAU,cAAezpD,EAAM,CAAA,EAAI,CAAC,EAAyC,CAAC,CAAkC,CAK3J,CACA,SAASqxD,EAAatyD,EAAQ,CAC1B,GAAI47C,EAAQ,SAAQ,IAAO,EACvB,OAEJ,MAAM36C,EAAO,IAAI2qD,GAAkB5rD,EAAQ47C,EAAQ,eAAc,CAAE,EAC7DwW,EAAW,OAAO,OAAO,IAAI,EACnCV,IACA,IAAIjS,EAAa,GACjB,KAAO7D,EAAQ,aAAe,GAA2CA,EAAQ,SAAQ,IAAO,IAA8B,CAC1H,GAAIA,EAAQ,SAAQ,IAAO,EAAoC,CACtD6D,GACDoS,EAAOv7C,EAAE,mBAAmB,EAAGo0C,EAAU,gBAAgB,EAE7D,MAAMsH,EAAcpW,EAAQ,eAAc,EAE1C,GADA8V,IACI9V,EAAQ,SAAQ,IAAO,EAAyC,CAC5D6D,GACAmS,EAAct7C,EAAE,gBAAgB,EAAGo0C,EAAU,cAAesH,EAAaA,EAAc,CAAC,EAE5F,QACJ,CACJ,MACSvS,GACLoS,EAAOv7C,EAAE,gBAAgB,EAAGo0C,EAAU,aAAa,EAEvD,MAAM6H,EAAWJ,EAAelxD,EAAMmxD,CAAQ,EACzCG,EAIDtxD,EAAK,WAAW,KAAKsxD,CAAQ,EAH7BV,EAAOv7C,EAAE,mBAAmB,EAAGo0C,EAAU,iBAAkB,OAAW,GAAI,CAAC,EAAyC,EAAmC,EAK3JjL,EAAa,EACjB,CACA,OAAI7D,EAAQ,SAAQ,IAAO,EAChBiW,EAAOv7C,EAAE,iCAAiC,EAAGo0C,EAAU,0BAA2BzpD,CAAI,EAE1F6wD,EAAU7wD,EAAM,EAAI,CAC/B,CACA,SAASoxD,EAAaryD,EAAQ,CAC1B,GAAI47C,EAAQ,SAAQ,IAAO,GACvB,OAEJ,MAAM36C,EAAO,IAAIwqD,GAAkBzrD,EAAQ47C,EAAQ,eAAc,CAAE,EACnE,OAAA36C,EAAK,MAAQ26C,EAAQ,cAAa,EAC3BkW,EAAU7wD,EAAM,EAAI,CAC/B,CACA,SAASuxD,EAAaxyD,EAAQ,CAC1B,GAAI47C,EAAQ,SAAQ,IAAO,GACvB,OAEJ,MAAM36C,EAAO,IAAIuqD,GAAkBxrD,EAAQ47C,EAAQ,eAAc,CAAE,EACnE,GAAIA,EAAQ,cAAa,IAAO,EAA6B,CACzD,MAAMyD,EAAazD,EAAQ,cAAa,EACxC,GAAI,CACA,MAAM6W,EAAc,KAAK,MAAMpT,CAAU,EACzC,GAAI,CAACkB,GAASkS,CAAW,EACrB,OAAOZ,EAAOv7C,EAAE,wBAAwB,EAAGo0C,EAAU,UAAWzpD,CAAI,EAExEA,EAAK,MAAQwxD,CACjB,MACU,CACN,OAAOZ,EAAOv7C,EAAE,wBAAwB,EAAGo0C,EAAU,UAAWzpD,CAAI,CACxE,CACAA,EAAK,UAAYo+C,EAAW,QAAQ,GAAG,IAAM,EACjD,CACA,OAAOyS,EAAU7wD,EAAM,EAAI,CAC/B,CACA,SAASyxD,EAAc1yD,EAAQ,CAC3B,OAAQ47C,EAAQ,SAAQ,EAAE,CACtB,IAAK,GACD,OAAOkW,EAAU,IAAI1G,GAAgBprD,EAAQ47C,EAAQ,eAAc,CAAE,EAAG,EAAI,EAChF,IAAK,GACD,OAAOkW,EAAU,IAAIzG,GAAmBrrD,EAAQ,GAAM47C,EAAQ,gBAAgB,EAAG,EAAI,EACzF,IAAK,GACD,OAAOkW,EAAU,IAAIzG,GAAmBrrD,EAAQ,GAAO47C,EAAQ,gBAAgB,EAAG,EAAI,EAC1F,QACI,MAChB,CACI,CACA,SAASqW,EAAYjyD,EAAQ,CACzB,OAAO+xD,EAAY/xD,CAAM,GAAKsyD,EAAatyD,CAAM,GAAKqyD,EAAaryD,CAAM,GAAKwyD,EAAaxyD,CAAM,GAAK0yD,EAAc1yD,CAAM,CAC9H,CACA,IAAI2yD,EAEJ,OADcjB,EAAS,IACT,KACViB,EAAQV,EAAYU,CAAK,EACpBA,EAGI/W,EAAQ,SAAQ,IAAO,IAC5BiW,EAAOv7C,EAAE,uBAAuB,EAAGo0C,EAAU,SAAS,EAHtDmH,EAAOv7C,EAAE,2CAA2C,EAAGo0C,EAAU,SAAS,GAM3E,IAAIsC,GAAa2F,EAAOpB,EAAUE,CAAa,CAC1D,CC9sCA,SAASmB,GAAgBz1D,EAAK01D,EAAQC,EAAkB,CACpD,GAAI31D,IAAQ,MAAQ,OAAOA,GAAQ,SAAU,CACzC,MAAM41D,EAAYF,EAAS,IAC3B,GAAI,MAAM,QAAQ11D,CAAG,EAAG,CACpB,GAAIA,EAAI,SAAW,EACf,MAAO,KAEX,IAAIjB,EAAS;AAAA,EACb,QAASW,EAAI,EAAGA,EAAIM,EAAI,OAAQN,IAC5BX,GAAU62D,EAAYH,GAAgBz1D,EAAIN,CAAC,EAAGk2D,EAAWD,CAAgB,EACrEj2D,EAAIM,EAAI,OAAS,IACjBjB,GAAU,KAEdA,GAAU;AAAA,EAEd,OAAAA,GAAU22D,EAAS,IACZ32D,CACX,KACK,CACD,MAAM82D,EAAO,OAAO,KAAK71D,CAAG,EAC5B,GAAI61D,EAAK,SAAW,EAChB,MAAO,KAEX,IAAI92D,EAAS;AAAA,EACb,QAASW,EAAI,EAAGA,EAAIm2D,EAAK,OAAQn2D,IAAK,CAClC,MAAM4N,EAAMuoD,EAAKn2D,CAAC,EAClBX,GAAU62D,EAAY,KAAK,UAAUtoD,CAAG,EAAI,KAAOmoD,GAAgBz1D,EAAIsN,CAAG,EAAGsoD,EAAWD,CAAgB,EACpGj2D,EAAIm2D,EAAK,OAAS,IAClB92D,GAAU,KAEdA,GAAU;AAAA,CACd,CACA,OAAAA,GAAU22D,EAAS,IACZ32D,CACX,CACJ,CACA,OAAO42D,EAAiB31D,CAAG,CAC/B,CC5BA,MAAM81D,EAAe,CACjB,YAAYC,EAAeC,EAAgB,CAAA,EAAIC,EAAqB,QAASC,EAAqB,GAAI,CAClG,KAAK,cAAgBH,EACrB,KAAK,cAAgBC,EACrB,KAAK,mBAAqBC,EAC1B,KAAK,mBAAqBC,CAC9B,CACA,UAAUx0D,EAAM,CACZ,QAAShC,EAAI,KAAK,cAAc,OAAS,EAAGA,GAAK,EAAGA,IAAK,CACrD,MAAMy2D,EAAoB,KAAK,cAAcz2D,CAAC,EAAE,kBAChD,GAAIy2D,EAAmB,CACnB,MAAMC,EAAWD,EAAkBz0D,CAAI,EACvC,GAAI00D,EACA,OAAOA,CAEf,CACJ,CACA,OAAO,KAAK,mBAAmB,QAAQ10D,CAAI,CAC/C,CACA,WAAWkqD,EAAUjwC,EAAU06C,EAAK,CAChC,MAAMt3D,EAAS,CACX,MAAO,CAAA,EACP,aAAc,EAC1B,EACcihB,EAAO4rC,EAAS,QAAO,EACvB78C,EAAS68C,EAAS,SAASjwC,CAAQ,EACzC,IAAI7X,EAAOuyD,EAAI,kBAAkBtnD,EAAQ,EAAI,EAC7C,GAAI,KAAK,YAAY68C,EAAU9nD,EAAOA,EAAK,OAAS,EAAGiL,CAAM,EACzD,OAAO,QAAQ,QAAQhQ,CAAM,EAEjC,GAAI+E,GAASiL,IAAWjL,EAAK,OAASA,EAAK,QAAWiL,EAAS,EAAG,CAC9D,MAAMutC,EAAKt8B,EAAKjR,EAAS,CAAC,GACtBjL,EAAK,OAAS,UAAYw4C,IAAO,KAAOx4C,EAAK,OAAS,SAAWw4C,IAAO,OAExEx4C,EAAOA,EAAK,OAEpB,CACA,MAAMwyD,EAAc,KAAK,eAAe1K,EAAU78C,CAAM,EACxD,IAAIwnD,EACJ,GAAIzyD,IAASA,EAAK,OAAS,UAAYA,EAAK,OAAS,UAAYA,EAAK,OAAS,WAAaA,EAAK,OAAS,QACtGyyD,EAAiBl7C,EAAM,OAAOuwC,EAAS,WAAW9nD,EAAK,MAAM,EAAG8nD,EAAS,WAAW9nD,EAAK,OAASA,EAAK,MAAM,CAAC,MAE7G,CACD,IAAI0yD,EAAiBznD,EAASunD,EAAY,OACtCE,EAAiB,GAAKx2C,EAAKw2C,EAAiB,CAAC,IAAM,KACnDA,IAEJD,EAAiBl7C,EAAM,OAAOuwC,EAAS,WAAW4K,CAAc,EAAG76C,CAAQ,CAC/E,CACA,MAAM86C,EAAW,IAAI,IACfC,EAAY,CACd,IAAMC,GAAe,CACjB,IAAIxR,EAAQwR,EAAW,MACvB,MAAMC,EAAWH,EAAS,IAAItR,CAAK,EACnC,GAAKyR,EAcIA,EAAS,gBACVA,EAAS,cAAgBD,EAAW,eAEnCC,EAAS,SACVA,EAAS,OAASD,EAAW,QAE5BC,EAAS,eACVA,EAAS,aAAeD,EAAW,kBArB5B,CAEX,GADAxR,EAAQA,EAAM,QAAQ,QAAS,GAAG,EAC9BA,EAAM,OAAS,GAAI,CACnB,MAAM0R,EAAkB1R,EAAM,OAAO,EAAG,EAAE,EAAE,KAAI,EAAK,MAChDsR,EAAS,IAAII,CAAe,IAC7B1R,EAAQ0R,EAEhB,CACAF,EAAW,SAAWrR,GAAS,QAAQiR,EAAgBI,EAAW,UAAU,EAC5EA,EAAW,MAAQxR,EACnBsR,EAAS,IAAItR,EAAOwR,CAAU,EAC9B53D,EAAO,MAAM,KAAK43D,CAAU,CAChC,CAYJ,EACA,gBAAiB,IAAM,CACnB53D,EAAO,aAAe,EAC1B,EACA,MAAQP,GAAY,CAChB,QAAQ,MAAMA,CAAO,CACzB,EACA,qBAAsB,IACXO,EAAO,MAAM,MAEpC,EACQ,OAAO,KAAK,cAAc,qBAAqB6sD,EAAS,IAAKyK,CAAG,EAAE,KAAM1H,GAAW,CAC/E,MAAMmI,EAAqB,CAAA,EAC3B,IAAIC,EAAW,GACXC,EAAa,GACbpX,EACJ,GAAI97C,GACIA,EAAK,OAAS,SAAU,CACxB,MAAMjB,EAASiB,EAAK,OAChBjB,GAAUA,EAAO,OAAS,YAAcA,EAAO,UAAYiB,IAC3DizD,EAAW,CAACl0D,EAAO,UACnB+8C,EAAkB/8C,EAClBm0D,EAAah3C,EAAK,OAAOlc,EAAK,OAAS,EAAGA,EAAK,OAAS,CAAC,EACrDjB,IACAiB,EAAOjB,EAAO,QAG1B,CAGJ,GAAIiB,GAAQA,EAAK,OAAS,SAAU,CAEhC,GAAIA,EAAK,SAAWiL,EAChB,OAAOhQ,EAGQ+E,EAAK,WACb,QAAQwsC,GAAK,EAChB,CAACsP,GAAmBA,IAAoBtP,IACxCmmB,EAAS,IAAInmB,EAAE,QAAQ,MAAO4X,GAAe,OAAO,IAAI,CAAC,CAEjE,CAAC,EACD,IAAI+O,EAAiB,GACjBF,IACAE,EAAiB,KAAK,uBAAuBrL,EAAUA,EAAS,SAAS2K,EAAe,GAAG,CAAC,GAE5F5H,EAEA,KAAK,uBAAuBA,EAAQ0H,EAAKvyD,EAAMizD,EAAUE,EAAgBP,CAAS,EAIlF,KAAK,iCAAiCL,EAAKvyD,EAAMkzD,EAAYN,CAAS,EAE1E,MAAM7Q,EAAW3F,GAAYp8C,CAAI,EACjC,KAAK,cAAc,QAASozD,GAAiB,CACzC,MAAMC,EAAiBD,EAAa,2BAA2BtL,EAAS,IAAK/F,EAAUyQ,EAAaS,EAAUE,IAAmB,GAAIP,CAAS,EAC1IS,GACAL,EAAmB,KAAKK,CAAc,CAE9C,CAAC,EACI,CAACxI,GAAU2H,EAAY,OAAS,GAAKt2C,EAAK,OAAOjR,EAASunD,EAAY,OAAS,CAAC,IAAM,MACvFI,EAAU,IAAI,CACV,KAAM3oC,GAAmB,SACzB,MAAO,KAAK,iBAAiBuoC,CAAW,EACxC,WAAY,KAAK,yBAAyBA,EAAa,OAAW,GAAOW,CAAc,EACvF,iBAAkBnP,GAAiB,QAAS,cAAe,EACnF,CAAqB,EACD4O,EAAU,gBAAe,EAEjC,CAEA,MAAMU,EAAQ,CAAA,EACd,OAAIzI,EAEA,KAAK,oBAAoBA,EAAQ0H,EAAKvyD,EAAMiL,EAAQ68C,EAAU8K,EAAWU,CAAK,EAI9E,KAAK,8BAA8Bf,EAAKvyD,EAAMiL,EAAQ68C,EAAU8K,CAAS,EAEzE,KAAK,cAAc,OAAS,GAC5B,KAAK,+BAA+BL,EAAKvyD,EAAMiL,EAAQ68C,EAAU8K,EAAWI,CAAkB,EAE3F,KAAK,mBAAmB,IAAIA,CAAkB,EAAE,KAAK,IAAM,CAC9D,GAAIJ,EAAU,qBAAoB,IAAO,EAAG,CACxC,IAAIW,EAAqBtoD,EACrBjL,IAASA,EAAK,OAAS,UAAYA,EAAK,OAAS,UAAYA,EAAK,OAAS,WAAaA,EAAK,OAAS,UACtGuzD,EAAqBvzD,EAAK,OAASA,EAAK,QAE5C,MAAMmzD,EAAiB,KAAK,uBAAuBrL,EAAUyL,CAAkB,EAC/E,KAAK,0BAA0BD,EAAOH,EAAgBP,CAAS,CACnE,CACA,OAAO33D,CACX,CAAC,CACL,CAAC,CACL,CACA,uBAAuB4vD,EAAQ0H,EAAKvyD,EAAMizD,EAAUE,EAAgBP,EAAW,CACnDL,EAAI,mBAAmB1H,EAAO,OAAQ7qD,EAAK,MAAM,EACzD,QAASmP,GAAM,CAC3B,GAAIA,EAAE,OAASnP,GAAQ,CAACmP,EAAE,SAAU,CAChC,MAAMqkD,EAAmBrkD,EAAE,OAAO,WAC9BqkD,GACA,OAAO,KAAKA,CAAgB,EAAE,QAAShqD,GAAQ,CAC3C,MAAMomD,EAAiB4D,EAAiBhqD,CAAG,EAC3C,GAAI,OAAOomD,GAAmB,UAAY,CAACA,EAAe,oBAAsB,CAACA,EAAe,aAAc,CAC1G,MAAM6D,EAAW,CACb,KAAMxpC,GAAmB,SACzB,MAAOzgB,EACP,WAAY,KAAK,yBAAyBA,EAAKomD,EAAgBqD,EAAUE,CAAc,EACvF,iBAAkBnP,GAAiB,QACnC,WAAY,KAAK,sBAAsBx6C,CAAG,EAC1C,cAAe,KAAK,WAAWomD,EAAe,mBAAmB,GAAKA,EAAe,aAAe,EACpI,EACgCA,EAAe,kBAAoB,SACnC6D,EAAS,SAAW7D,EAAe,iBAEnC6D,EAAS,YAAc5T,GAAS4T,EAAS,WAAY,KAAKN,CAAc,EAAE,IAC1EM,EAAS,QAAU,CACf,MAAO,UACP,QAAS,8BAC7C,GAE4Bb,EAAU,IAAIa,CAAQ,CAC1B,CACJ,CAAC,EAEL,MAAMC,EAAsBvkD,EAAE,OAAO,cACrC,GAAI,OAAOukD,GAAwB,UAAY,CAACA,EAAoB,oBAAsB,CAACA,EAAoB,aAAc,CACzH,MAAMC,EAA6B,CAACl5D,EAAMm5D,EAAkB,SAAc,CACtE,MAAMH,EAAW,CACb,KAAMxpC,GAAmB,SACzB,MAAOxvB,EACP,WAAY,KAAK,yBAAyBA,EAAM,OAAWw4D,EAAUE,CAAc,EACnF,iBAAkBnP,GAAiB,QACnC,WAAY,KAAK,sBAAsBvpD,CAAI,EAC3C,cAAem5D,GAAmB,KAAK,WAAWF,EAAoB,mBAAmB,GAAKA,EAAoB,aAAe,EAC7J,EAC4BA,EAAoB,kBAAoB,SACxCD,EAAS,SAAWC,EAAoB,iBAExCD,EAAS,YAAc5T,GAAS4T,EAAS,WAAY,KAAKN,CAAc,EAAE,IAC1EM,EAAS,QAAU,CACf,MAAO,UACP,QAAS,8BACzC,GAEwBb,EAAU,IAAIa,CAAQ,CAC1B,EACA,GAAIC,EAAoB,KACpB,QAAS93D,EAAI,EAAGA,EAAI83D,EAAoB,KAAK,OAAQ93D,IAAK,CACtD,IAAIg4D,EACAF,EAAoB,0BAA4B93D,EAAI83D,EAAoB,yBAAyB,OACjGE,EAAkB,KAAK,WAAWF,EAAoB,yBAAyB93D,CAAC,CAAC,EAE5E83D,EAAoB,kBAAoB93D,EAAI83D,EAAoB,iBAAiB,SACtFE,EAAkBF,EAAoB,iBAAiB93D,CAAC,GAE5D+3D,EAA2BD,EAAoB,KAAK93D,CAAC,EAAGg4D,CAAe,CAC3E,CAEAF,EAAoB,OACpBC,EAA2BD,EAAoB,KAAK,CAE5D,CACJ,CACJ,CAAC,CACL,CACA,iCAAiCnB,EAAKvyD,EAAMkzD,EAAYN,EAAW,CAC/D,MAAMiB,EAAsC33D,GAAQ,CAChDA,EAAI,WAAW,QAASswC,GAAM,CAC1B,MAAMhjC,EAAMgjC,EAAE,QAAQ,MACtBomB,EAAU,IAAI,CACV,KAAM3oC,GAAmB,SACzB,MAAOzgB,EACP,WAAY,KAAK,sBAAsBA,EAAK,EAAE,EAC9C,iBAAkBw6C,GAAiB,QACnC,WAAY,KAAK,sBAAsBx6C,CAAG,EAC1C,cAAe,EACnC,CAAiB,CACL,CAAC,CACL,EACA,GAAIxJ,EAAK,OACL,GAAIA,EAAK,OAAO,OAAS,WAAY,CAEjC,MAAM8zD,EAAY9zD,EAAK,OAAO,QAAQ,MACtCuyD,EAAI,MAAMxrD,IACFA,EAAE,OAAS,YAAcA,IAAM/G,EAAK,QAAU+G,EAAE,QAAQ,QAAU+sD,GAAa/sD,EAAE,WAAaA,EAAE,UAAU,OAAS,UACnH8sD,EAAmC9sD,EAAE,SAAS,EAE3C,GACV,CACL,MACS/G,EAAK,OAAO,OAAS,SAE1BA,EAAK,OAAO,MAAM,QAAQ+G,GAAK,CACvBA,EAAE,OAAS,UAAYA,IAAM/G,GAC7B6zD,EAAmC9sD,CAAC,CAE5C,CAAC,OAGA/G,EAAK,OAAS,UACnB4yD,EAAU,IAAI,CACV,KAAM3oC,GAAmB,SACzB,MAAO,UACP,WAAY,KAAK,yBAAyB,UAAW,OAAW,GAAM,EAAE,EACxE,iBAAkB+5B,GAAiB,QAAS,cAAe,GAC3D,WAAY,KAAK,sBAAsB,SAAS,CAChE,CAAa,CAET,CACA,8BAA8BuO,EAAKvyD,EAAMiL,EAAQ68C,EAAU8K,EAAW,CAClE,IAAIW,EAAqBtoD,EAKzB,GAJIjL,IAASA,EAAK,OAAS,UAAYA,EAAK,OAAS,UAAYA,EAAK,OAAS,WAAaA,EAAK,OAAS,UACtGuzD,EAAqBvzD,EAAK,OAASA,EAAK,OACxCA,EAAOA,EAAK,QAEZ,CAACA,EAAM,CACP4yD,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkB,QAAQ,EACrC,MAAO,eACP,WAAY,KAAK,sBAAsB,CAAA,EAAI,EAAE,EAC7C,iBAAkB5O,GAAiB,QACnC,cAAe,EAC/B,CAAa,EACD4O,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkB,OAAO,EACpC,MAAO,cACP,WAAY,KAAK,sBAAsB,CAAA,EAAI,EAAE,EAC7C,iBAAkB5O,GAAiB,QACnC,cAAe,EAC/B,CAAa,EACD,MACJ,CACA,MAAMmP,EAAiB,KAAK,uBAAuBrL,EAAUyL,CAAkB,EACzEQ,EAA+B34D,GAAU,CACvCA,EAAM,QAAU,CAACmhD,GAASnhD,EAAM,OAAQ6P,EAAQ,EAAI,GACpD2nD,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkBx3D,EAAM,IAAI,EACvC,MAAO,KAAK,4BAA4BA,EAAO0sD,CAAQ,EACvD,WAAY,KAAK,6BAA6B1sD,EAAO0sD,EAAUqL,CAAc,EAC7E,iBAAkBnP,GAAiB,QAAS,cAAe,EAC/E,CAAiB,EAED5oD,EAAM,OAAS,WACf,KAAK,0BAA0B,CAACA,EAAM,MAAO+3D,EAAgBP,CAAS,CAE9E,EACA,GAAI5yD,EAAK,OAAS,YACViL,GAAUjL,EAAK,aAAe,GAAI,CAClC,MAAMs8C,EAAYt8C,EAAK,UACvB,GAAIs8C,IAAcrxC,EAAUqxC,EAAU,OAASA,EAAU,QAAWA,EAAU,OAAS,UAAYA,EAAU,OAAS,SAClH,OAGJ,MAAMwX,EAAY9zD,EAAK,QAAQ,MAC/BuyD,EAAI,MAAMxrD,IACFA,EAAE,OAAS,YAAcA,EAAE,QAAQ,QAAU+sD,GAAa/sD,EAAE,WAC5DgtD,EAA4BhtD,EAAE,SAAS,EAEpC,GACV,EACG+sD,IAAc,WAAa9zD,EAAK,QAAU,CAACA,EAAK,OAAO,QACvD,KAAK,2BAA2BmzD,EAAgBP,CAAS,CAEjE,CAEJ,GAAI5yD,EAAK,OAAS,QACd,GAAIA,EAAK,QAAUA,EAAK,OAAO,OAAS,WAAY,CAEhD,MAAM8zD,EAAY9zD,EAAK,OAAO,QAAQ,MACtCuyD,EAAI,MAAOxrD,IACHA,EAAE,OAAS,YAAcA,EAAE,QAAQ,QAAU+sD,GAAa/sD,EAAE,WAAaA,EAAE,UAAU,OAAS,SAC9FA,EAAE,UAAU,MAAM,QAAQgtD,CAA2B,EAElD,GACV,CACL,MAGI/zD,EAAK,MAAM,QAAQ+zD,CAA2B,CAG1D,CACA,oBAAoBlJ,EAAQ0H,EAAKvyD,EAAMiL,EAAQ68C,EAAU8K,EAAWU,EAAO,CACvE,IAAIC,EAAqBtoD,EACrB6oD,EACAxX,EAMJ,GALIt8C,IAASA,EAAK,OAAS,UAAYA,EAAK,OAAS,UAAYA,EAAK,OAAS,WAAaA,EAAK,OAAS,UACtGuzD,EAAqBvzD,EAAK,OAASA,EAAK,OACxCs8C,EAAYt8C,EACZA,EAAOA,EAAK,QAEZ,CAACA,EAAM,CACP,KAAK,0BAA0B6qD,EAAO,OAAQ,GAAI+H,EAAWU,CAAK,EAClE,MACJ,CACA,GAAKtzD,EAAK,OAAS,YAAeiL,GAAUjL,EAAK,aAAe,GAAI,CAChE,MAAMs8C,EAAYt8C,EAAK,UACvB,GAAIs8C,GAAarxC,EAAUqxC,EAAU,OAASA,EAAU,OACpD,OAEJwX,EAAY9zD,EAAK,QAAQ,MACzBA,EAAOA,EAAK,MAChB,CACA,GAAIA,IAAS8zD,IAAc,QAAa9zD,EAAK,OAAS,SAAU,CAC5D,MAAMmzD,EAAiB,KAAK,uBAAuBrL,EAAUyL,CAAkB,EACzEjH,EAAkBiG,EAAI,mBAAmB1H,EAAO,OAAQ7qD,EAAK,OAAQs8C,CAAS,EACpF,UAAWntC,KAAKm9C,EACZ,GAAIn9C,EAAE,OAASnP,GAAQ,CAACmP,EAAE,UAAYA,EAAE,OAAQ,CAC5C,GAAInP,EAAK,OAAS,SAAWmP,EAAE,OAAO,MAAO,CACzC,IAAIwmB,EAAIi9B,EACR,GAAIzjD,EAAE,OAAO,YAAa,CACtB,MAAM6kD,EAAiB,IAAI,IAC3Bh0D,EAAK,SAAS,QAAQ+G,GAAK,CACnBA,EAAE,OAAS,SAAWA,EAAE,OAAS,UACjCitD,EAAe,IAAI,KAAK,iBAAiB3X,GAAat1C,CAAC,CAAC,CAAC,CAEjE,CAAC,EACD4uB,EAAI,CACA,GAAGi9B,EACH,IAAIC,EAAY,CACPmB,EAAe,IAAInB,EAAW,KAAK,GACpCD,EAAU,IAAIC,CAAU,CAEhC,CAChC,CACwB,CACA,GAAI,MAAM,QAAQ1jD,EAAE,OAAO,KAAK,EAAG,CAC/B,MAAM3R,EAAQ,KAAK,iBAAiBwC,EAAM8nD,EAAU78C,CAAM,EACtDzN,EAAQ2R,EAAE,OAAO,MAAM,QACvB,KAAK,0BAA0BA,EAAE,OAAO,MAAM3R,CAAK,EAAG21D,EAAgBx9B,EAAG29B,CAAK,CAEtF,MAEI,KAAK,0BAA0BnkD,EAAE,OAAO,MAAOgkD,EAAgBx9B,EAAG29B,CAAK,CAE/E,CACA,GAAIQ,IAAc,OAAW,CACzB,IAAIG,EAAkB,GACtB,GAAI9kD,EAAE,OAAO,WAAY,CACrB,MAAMygD,EAAiBzgD,EAAE,OAAO,WAAW2kD,CAAS,EAChDlE,IACAqE,EAAkB,GAClB,KAAK,0BAA0BrE,EAAgBuD,EAAgBP,EAAWU,CAAK,EAEvF,CACA,GAAInkD,EAAE,OAAO,mBAAqB,CAAC8kD,GAC/B,UAAWlU,KAAW,OAAO,KAAK5wC,EAAE,OAAO,iBAAiB,EAExD,GADc2wC,GAAeC,CAAO,GACzB,KAAK+T,CAAS,EAAG,CACxBG,EAAkB,GAClB,MAAMrE,EAAiBzgD,EAAE,OAAO,kBAAkB4wC,CAAO,EACzD,KAAK,0BAA0B6P,EAAgBuD,EAAgBP,EAAWU,CAAK,CACnF,EAGR,GAAInkD,EAAE,OAAO,sBAAwB,CAAC8kD,EAAiB,CACnD,MAAMrE,EAAiBzgD,EAAE,OAAO,qBAChC,KAAK,0BAA0BygD,EAAgBuD,EAAgBP,EAAWU,CAAK,CACnF,CACJ,CACJ,CAEAQ,IAAc,WAAa,CAAC9zD,EAAK,QACjC,KAAK,2BAA2BmzD,EAAgBP,CAAS,EAEzDU,EAAM,UACN,KAAK,0BAA0B,GAAMH,EAAgBP,CAAS,EAC9D,KAAK,0BAA0B,GAAOO,EAAgBP,CAAS,GAE/DU,EAAM,MACN,KAAK,uBAAuBH,EAAgBP,CAAS,CAE7D,CACJ,CACA,+BAA+BL,EAAKvyD,EAAMiL,EAAQ68C,EAAU8K,EAAWI,EAAoB,CACvF,GAAI,CAAChzD,EACD,KAAK,cAAc,QAASozD,GAAiB,CACzC,MAAMC,EAAiBD,EAAa,0BAA0BtL,EAAS,IAAK8K,CAAS,EACjFS,GACAL,EAAmB,KAAKK,CAAc,CAE9C,CAAC,WAGGrzD,EAAK,OAAS,UAAYA,EAAK,OAAS,UAAYA,EAAK,OAAS,WAAaA,EAAK,OAAS,UAC7FA,EAAOA,EAAK,QAEZA,GAASA,EAAK,OAAS,YAAeiL,GAAUjL,EAAK,aAAe,GAAI,CACxE,MAAM8zD,EAAY9zD,EAAK,QAAQ,MACzBs8C,EAAYt8C,EAAK,UACvB,IAAK,CAACs8C,GAAarxC,GAAWqxC,EAAU,OAASA,EAAU,SAAYt8C,EAAK,OAAQ,CAChF,MAAM+hD,EAAW3F,GAAYp8C,EAAK,MAAM,EACxC,KAAK,cAAc,QAASozD,GAAiB,CACzC,MAAMC,EAAiBD,EAAa,wBAAwBtL,EAAS,IAAK/F,EAAU+R,EAAWlB,CAAS,EACpGS,GACAL,EAAmB,KAAKK,CAAc,CAE9C,CAAC,CACL,CACJ,CAER,CACA,0BAA0BxI,EAAQsI,EAAgBP,EAAWU,EAAO,CAC5D,OAAOzI,GAAW,WAClB,KAAK,wBAAwBA,EAAQsI,EAAgBP,CAAS,EAC9D,KAAK,2BAA2B/H,EAAQsI,EAAgBP,CAAS,EACjE,KAAK,aAAa/H,EAAQyI,CAAK,EAC3B,MAAM,QAAQzI,EAAO,KAAK,GAC1BA,EAAO,MAAM,QAAQ,GAAK,KAAK,0BAA0B,EAAGsI,EAAgBP,EAAWU,CAAK,CAAC,EAE7F,MAAM,QAAQzI,EAAO,KAAK,GAC1BA,EAAO,MAAM,QAAQ,GAAK,KAAK,0BAA0B,EAAGsI,EAAgBP,EAAWU,CAAK,CAAC,EAE7F,MAAM,QAAQzI,EAAO,KAAK,GAC1BA,EAAO,MAAM,QAAQ,GAAK,KAAK,0BAA0B,EAAGsI,EAAgBP,EAAWU,CAAK,CAAC,EAGzG,CACA,2BAA2BzI,EAAQsI,EAAgBP,EAAWsB,EAAa,EAAG,CAC1E,IAAIC,EAAe,GACnB,GAAI5U,GAAUsL,EAAO,OAAO,EAAG,CAC3B,IAAIzqC,EAAOyqC,EAAO,KACdzvD,EAAQyvD,EAAO,QACnB,QAASjvD,EAAIs4D,EAAYt4D,EAAI,EAAGA,IAC5BR,EAAQ,CAACA,CAAK,EACdglB,EAAO,QAEX,MAAMg0C,EAAiB,CACnB,KAAM,KAAK,kBAAkBh0C,CAAI,EACjC,MAAO,KAAK,iBAAiBhlB,CAAK,EAClC,WAAY,KAAK,sBAAsBA,EAAO+3D,CAAc,EAC5D,iBAAkBnP,GAAiB,OACnD,EACgB,KAAK,2BACLoQ,EAAe,aAAe,CAAE,YAAa/+C,EAAE,eAAe,CAAC,EAG/D++C,EAAe,OAAS/+C,EAAE,eAAe,EAE7Cu9C,EAAU,IAAIwB,CAAc,EAC5BD,EAAe,EACnB,CACI,MAAM,QAAQtJ,EAAO,QAAQ,GAC7BA,EAAO,SAAS,QAAQwJ,GAAW,CAC/B,IAAIj0C,EAAOyqC,EAAO,KACdzvD,EAAQi5D,EACZ,QAASz4D,EAAIs4D,EAAYt4D,EAAI,EAAGA,IAC5BR,EAAQ,CAACA,CAAK,EACdglB,EAAO,QAEXwyC,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkBxyC,CAAI,EACjC,MAAO,KAAK,iBAAiBhlB,CAAK,EAClC,WAAY,KAAK,sBAAsBA,EAAO+3D,CAAc,EAC5D,iBAAkBnP,GAAiB,OACvD,CAAiB,EACDmQ,EAAe,EACnB,CAAC,EAED,MAAM,QAAQtJ,EAAO,eAAe,GACpCA,EAAO,gBAAgB,QAAQ17C,GAAK,CAChC,IAAIiR,EAAOyqC,EAAO,KACdzvD,EAAQ+T,EAAE,KACVkyC,EAAQlyC,EAAE,MACVglC,EACAkT,EACJ,GAAI9H,GAAUnkD,CAAK,EAAG,CAClByvD,EAAO,KACP,QAASjvD,EAAIs4D,EAAYt4D,EAAI,EAAGA,IAC5BR,EAAQ,CAACA,CAAK,EAElB+4C,EAAa,KAAK,6BAA6B/4C,EAAO+3D,CAAc,EACpE9L,EAAa,KAAK,6BAA6BjsD,CAAK,EACpDimD,EAAQA,GAAS,KAAK,wBAAwBjmD,CAAK,CACvD,SACS,OAAO+T,EAAE,UAAa,SAAU,CACrC,IAAI86B,EAAS,GAAI3mB,EAAS,GAAIsuC,EAAS,GACvC,QAASh2D,EAAIs4D,EAAYt4D,EAAI,EAAGA,IAC5BquC,EAASA,EAAS2nB,EAAS;AAAA,EAC3BtuC,EAASA,EAAS;AAAA,EAAOsuC,EAAS,IAClCA,GAAU,IACVxxC,EAAO,QAEX+zB,EAAalK,EAAS2nB,EAASziD,EAAE,SAAS,MAAM;AAAA,CAAI,EAAE,KAAK;AAAA,EAAOyiD,CAAM,EAAItuC,EAAS6vC,EACrF9R,EAAQA,GAASlN,EACbkT,EAAalT,EAAW,QAAQ,QAAS,EAAE,CACnD,KAEI,QAEJye,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkBxyC,CAAI,EACjC,MAAAihC,EACA,cAAe,KAAK,WAAWlyC,EAAE,mBAAmB,GAAKA,EAAE,YAC3D,WAAAglC,EACA,iBAAkB6P,GAAiB,QACnC,WAAAqD,CACpB,CAAiB,EACD8M,EAAe,EACnB,CAAC,EAED,CAACA,GAAgB,OAAOtJ,EAAO,OAAU,UAAY,CAAC,MAAM,QAAQA,EAAO,KAAK,GAAKqJ,EAAa,GAClG,KAAK,2BAA2BrJ,EAAO,MAAOsI,EAAgBP,EAAWsB,EAAa,CAAC,CAE/F,CACA,wBAAwBrJ,EAAQsI,EAAgBP,EAAW,CAUvD,GATIrT,GAAUsL,EAAO,KAAK,GACtB+H,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkB/H,EAAO,IAAI,EACxC,MAAO,KAAK,iBAAiBA,EAAO,KAAK,EACzC,WAAY,KAAK,sBAAsBA,EAAO,MAAOsI,CAAc,EACnE,iBAAkBnP,GAAiB,QACnC,cAAe,KAAK,WAAW6G,EAAO,mBAAmB,GAAKA,EAAO,WACrF,CAAa,EAED,MAAM,QAAQA,EAAO,IAAI,EACzB,QAAS,EAAI,EAAG7sD,EAAS6sD,EAAO,KAAK,OAAQ,EAAI7sD,EAAQ,IAAK,CAC1D,MAAMs2D,EAAMzJ,EAAO,KAAK,CAAC,EACzB,IAAIjG,EAAgB,KAAK,WAAWiG,EAAO,mBAAmB,GAAKA,EAAO,YACtEA,EAAO,0BAA4B,EAAIA,EAAO,yBAAyB,QAAU,KAAK,sBACtFjG,EAAgB,KAAK,WAAWiG,EAAO,yBAAyB,CAAC,CAAC,EAE7DA,EAAO,kBAAoB,EAAIA,EAAO,iBAAiB,SAC5DjG,EAAgBiG,EAAO,iBAAiB,CAAC,GAE7C+H,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkB/H,EAAO,IAAI,EACxC,MAAO,KAAK,iBAAiByJ,CAAG,EAChC,WAAY,KAAK,sBAAsBA,EAAKnB,CAAc,EAC1D,iBAAkBnP,GAAiB,QACnC,cAAAY,CACpB,CAAiB,CACL,CAER,CACA,aAAaiG,EAAQyI,EAAO,CACxB,GAAI,MAAM,QAAQzI,EAAO,IAAI,GAAKtL,GAAUsL,EAAO,KAAK,EACpD,OAEJ,MAAMzqC,EAAOyqC,EAAO,KAChB,MAAM,QAAQzqC,CAAI,EAClBA,EAAK,QAAQ/K,GAAKi+C,EAAMj+C,CAAC,EAAI,EAAI,EAE5B+K,IACLkzC,EAAMlzC,CAAI,EAAI,GAEtB,CACA,0BAA0BkzC,EAAOH,EAAgBP,EAAW,CACpDU,EAAM,QACNV,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkB,QAAQ,EACrC,MAAO,KACP,WAAY,KAAK,6BAA6B,CAAA,EAAIO,CAAc,EAChE,iBAAkBnP,GAAiB,QACnC,OAAQ3uC,EAAE,YAAY,EACtB,cAAe,EAC/B,CAAa,EAEDi+C,EAAM,OACNV,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkB,OAAO,EACpC,MAAO,KACP,WAAY,KAAK,6BAA6B,CAAA,EAAIO,CAAc,EAChE,iBAAkBnP,GAAiB,QACnC,OAAQ3uC,EAAE,WAAW,EACrB,cAAe,EAC/B,CAAa,CAET,CACA,0BAA0Bja,EAAO+3D,EAAgBP,EAAW,CACxDA,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkB,SAAS,EACtC,MAAOx3D,EAAQ,OAAS,QACxB,WAAY,KAAK,sBAAsBA,EAAO+3D,CAAc,EAC5D,iBAAkBnP,GAAiB,QACnC,cAAe,EAC3B,CAAS,CACL,CACA,uBAAuBmP,EAAgBP,EAAW,CAC9CA,EAAU,IAAI,CACV,KAAM,KAAK,kBAAkB,MAAM,EACnC,MAAO,OACP,WAAY,OAASO,EACrB,iBAAkBnP,GAAiB,QACnC,cAAe,EAC3B,CAAS,CACL,CACA,2BAA2BmP,EAAgBP,EAAW,CAChC,KAAK,cAAc,uBAAuB/H,GAAUA,IAAW,QAAUA,IAAW,OAAO,EACnG,QAAQ2B,GAAY,CACtBA,EAAS,WAAW,+BAA+B,IACnDA,EAAWA,EAAW,KAE1BoG,EAAU,IAAI,CACV,KAAM3oC,GAAmB,OACzB,MAAO,KAAK,iBAAiBuiC,CAAQ,EACrC,WAAY,KAAK,sBAAsBA,CAAQ,EAC/C,WAAY,KAAK,sBAAsBA,EAAU2G,CAAc,EAC/D,iBAAkBnP,GAAiB,QAAS,cAAe,EAC3E,CAAa,CACL,CAAC,CACL,CACA,iBAAiB5oD,EAAO,CACpB,OAAO,KAAK,UAAUA,CAAK,CAC/B,CACA,kBAAkBA,EAAO,CACrB,OAAO,KAAK,MAAMA,CAAK,CAC3B,CACA,sBAAsBA,EAAO,CACzB,OAAO,KAAK,UAAUA,CAAK,CAC/B,CACA,6BAA6BA,EAAO,CAChC,OAAO,KAAK,UAAUA,CAAK,EAAE,QAAQ,2BAA4B,IAAI,CACzE,CACA,wBAAwBA,EAAO,CAE3B,OADc,KAAK,UAAUA,CAAK,EACrB,QAAQ,2BAA4B,IAAI,CACzD,CACA,0BAA0B8gB,EAAM,CAC5B,OAAOA,EAAK,QAAQ,YAAa,MAAM,CAC3C,CACA,sBAAsB9gB,EAAO+3D,EAAgB,CACzC,MAAMj3C,EAAO,KAAK,UAAU9gB,EAAO,KAAM,GAAI,EAC7C,OAAI8gB,IAAS,KACF,OAASi3C,EAEXj3C,IAAS,KACP,OAASi3C,EAEb,KAAK,0BAA0Bj3C,EAAOi3C,CAAc,CAC/D,CACA,6BAA6B/3D,EAAO+3D,EAAgB,CAShD,OAAOxB,GAAgBv2D,EAAO,GARZA,GACV,OAAOA,GAAU,UACbA,EAAM,CAAC,IAAM,IACNA,EAAM,OAAO,CAAC,EAGtB,KAAK,UAAUA,CAAK,CAEW,EAAI+3D,CAClD,CACA,6BAA6B/3D,EAAO+3D,EAAgB,CAChD,OAAQ,OAAO/3D,EAAK,CAChB,IAAK,SACD,OAAIA,IAAU,KACH,YAAc+3D,EAElB,KAAK,sBAAsB/3D,EAAO+3D,CAAc,EAC3D,IAAK,SACD,IAAIoB,EAAe,KAAK,UAAUn5D,CAAK,EACvC,OAAAm5D,EAAeA,EAAa,OAAO,EAAGA,EAAa,OAAS,CAAC,EAC7DA,EAAe,KAAK,0BAA0BA,CAAY,EACnD,QAAUA,EAAe,KAAOpB,EAC3C,IAAK,SACL,IAAK,UACD,MAAO,OAAS,KAAK,UAAU/3D,CAAK,EAAI,IAAM+3D,CAC9D,CACQ,OAAO,KAAK,sBAAsB/3D,EAAO+3D,CAAc,CAC3D,CACA,kBAAkB/yC,EAAM,CACpB,GAAI,MAAM,QAAQA,CAAI,EAAG,CACrB,MAAMrjB,EAAQqjB,EACdA,EAAOrjB,EAAM,OAAS,EAAIA,EAAM,CAAC,EAAI,MACzC,CACA,GAAI,CAACqjB,EACD,OAAO6J,GAAmB,MAE9B,OAAQ7J,EAAI,CACR,IAAK,SAAU,OAAO6J,GAAmB,MACzC,IAAK,SAAU,OAAOA,GAAmB,OACzC,IAAK,WAAY,OAAOA,GAAmB,SAC3C,QAAS,OAAOA,GAAmB,KAC/C,CACI,CACA,4BAA4BjqB,EAAM8nD,EAAU,CACxC,OAAQ9nD,EAAK,KAAI,CACb,IAAK,QACD,MAAO,KACX,IAAK,SACD,MAAO,KACX,QAEI,OADgB8nD,EAAS,QAAO,EAAG,OAAO9nD,EAAK,OAAQA,EAAK,MAAM,CAElF,CACI,CACA,6BAA6BA,EAAM8nD,EAAUqL,EAAgB,CACzD,OAAQnzD,EAAK,KAAI,CACb,IAAK,QACD,OAAO,KAAK,sBAAsB,CAAA,EAAImzD,CAAc,EACxD,IAAK,SACD,OAAO,KAAK,sBAAsB,CAAA,EAAIA,CAAc,EACxD,QACI,MAAMx6B,EAAUmvB,EAAS,UAAU,OAAO9nD,EAAK,OAAQA,EAAK,MAAM,EAAImzD,EACtE,OAAO,KAAK,0BAA0Bx6B,CAAO,CAC7D,CACI,CACA,yBAAyBnvB,EAAKomD,EAAgBqD,EAAUE,EAAgB,CACpE,MAAMqB,EAAe,KAAK,sBAAsBhrD,EAAK,EAAE,EACvD,GAAI,CAACypD,EACD,OAAOuB,EAEX,MAAMC,EAAaD,EAAe,KAClC,IAAIp5D,EACAs5D,EAAkB,EACtB,GAAI9E,EAAgB,CAChB,GAAI,MAAM,QAAQA,EAAe,eAAe,EAAG,CAC/C,GAAIA,EAAe,gBAAgB,SAAW,EAAG,CAC7C,MAAM+E,EAAO/E,EAAe,gBAAgB,CAAC,EAAE,KAC3CrQ,GAAUoV,CAAI,IACdv5D,EAAQ,KAAK,6BAA6Bu5D,EAAM,EAAE,EAE1D,CACAD,GAAmB9E,EAAe,gBAAgB,MACtD,CAyBA,GAxBIA,EAAe,OACX,CAACx0D,GAASw0D,EAAe,KAAK,SAAW,IACzCx0D,EAAQ,KAAK,6BAA6Bw0D,EAAe,KAAK,CAAC,EAAG,EAAE,GAExE8E,GAAmB9E,EAAe,KAAK,QAEvCrQ,GAAUqQ,EAAe,KAAK,IACzBx0D,IACDA,EAAQ,KAAK,6BAA6Bw0D,EAAe,MAAO,EAAE,GAEtE8E,KAEAnV,GAAUqQ,EAAe,OAAO,IAC3Bx0D,IACDA,EAAQ,KAAK,6BAA6Bw0D,EAAe,QAAS,EAAE,GAExE8E,KAEA,MAAM,QAAQ9E,EAAe,QAAQ,GAAKA,EAAe,SAAS,SAC7Dx0D,IACDA,EAAQ,KAAK,6BAA6Bw0D,EAAe,SAAS,CAAC,EAAG,EAAE,GAE5E8E,GAAmB9E,EAAe,SAAS,QAE3C8E,IAAoB,EAAG,CACvB,IAAIt0C,EAAO,MAAM,QAAQwvC,EAAe,IAAI,EAAIA,EAAe,KAAK,CAAC,EAAIA,EAAe,KASxF,OARKxvC,IACGwvC,EAAe,WACfxvC,EAAO,SAEFwvC,EAAe,QACpBxvC,EAAO,UAGPA,EAAI,CACR,IAAK,UACDhlB,EAAQ,KACR,MACJ,IAAK,SACDA,EAAQ,OACR,MACJ,IAAK,SACDA,EAAQ,OACR,MACJ,IAAK,QACDA,EAAQ,OACR,MACJ,IAAK,SACL,IAAK,UACDA,EAAQ,SACR,MACJ,IAAK,OACDA,EAAQ,YACR,MACJ,QACI,OAAOo5D,CAC/B,CACY,CACJ,CACA,OAAI,CAACp5D,GAASs5D,EAAkB,KAC5Bt5D,EAAQ,MAELq5D,EAAar5D,EAAQ+3D,CAChC,CACA,eAAerL,EAAU78C,EAAQ,CAC7B,IAAIrP,EAAIqP,EAAS,EACjB,MAAMiR,EAAO4rC,EAAS,QAAO,EAC7B,KAAOlsD,GAAK,GAAK;AAAA,aAAmB,QAAQsgB,EAAK,OAAOtgB,CAAC,CAAC,IAAM,IAC5DA,IAEJ,OAAOsgB,EAAK,UAAUtgB,EAAI,EAAGqP,CAAM,CACvC,CACA,uBAAuB68C,EAAU78C,EAAQ,CACrC,MAAM0vC,EAAU7C,GAAcgQ,EAAS,QAAO,EAAI,EAAI,EAGtD,OAFAnN,EAAQ,YAAY1vC,CAAM,EACZ0vC,EAAQ,KAAI,EACb,CACT,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,IACD,MAAO,GACX,QACI,MAAO,GACvB,CACI,CACA,iBAAiB36C,EAAM8nD,EAAU78C,EAAQ,CACrC,MAAM0vC,EAAU7C,GAAcgQ,EAAS,QAAO,EAAI,EAAI,EAChDpL,EAAW18C,EAAK,MACtB,QAASpE,EAAI8gD,EAAS,OAAS,EAAG9gD,GAAK,EAAGA,IAAK,CAC3C,MAAMkD,EAAQ49C,EAAS9gD,CAAC,EACxB,GAAIqP,EAASnM,EAAM,OAASA,EAAM,OAG9B,OAFA67C,EAAQ,YAAY77C,EAAM,OAASA,EAAM,MAAM,EACjC67C,EAAQ,KAAI,IACZ,GAAsC1vC,GAAU0vC,EAAQ,iBAAmBA,EAAQ,iBACtF/+C,EAAI,EAERA,EAEN,GAAIqP,GAAUnM,EAAM,OACrB,OAAOlD,CAEf,CACA,MAAO,EACX,CACA,YAAYksD,EAAUtvC,EAAOvN,EAAQ,CACjC,MAAM0vC,EAAU7C,GAAcgQ,EAAS,QAAO,EAAI,EAAK,EACvDnN,EAAQ,YAAYniC,CAAK,EACzB,IAAIy/B,EAAQ0C,EAAQ,KAAI,EACxB,KAAO1C,IAAU,IAAiC0C,EAAQ,eAAc,EAAKA,EAAQ,iBAAmB1vC,GACpGgtC,EAAQ0C,EAAQ,KAAI,EAExB,OAAQ1C,IAAU,IAA8CA,IAAU,KAAgD0C,EAAQ,eAAc,GAAM1vC,CAC1J,CACA,WAAW2pD,EAAc,CACrB,GAAIA,GAAgB,KAAK,sBACrB,MAAO,CACH,KAAM9Q,GAAW,SACjB,MAAO8Q,CACvB,CAGI,CACA,qBAAsB,CAClB,GAAI,CAACrV,GAAU,KAAK,gBAAgB,EAAG,CACnC,MAAMsV,EAAsB,KAAK,mBAAmB,cAAc,YAAY,gBAAgB,oBAC9F,KAAK,iBAAmB,MAAM,QAAQA,CAAmB,GAAKA,EAAoB,QAAQ/Q,GAAW,QAAQ,IAAM,EACvH,CACA,OAAO,KAAK,gBAChB,CACA,8BAA+B,CAC3B,OAAKvE,GAAU,KAAK,wBAAwB,IACxC,KAAK,oBAAsB,KAAK,mBAAmB,cAAc,YAAY,gBAAgB,yBAE1F,KAAK,wBAChB,CACA,0BAA2B,CACvB,OAAKA,GAAU,KAAK,mBAAmB,IACnC,KAAK,oBAAsB,KAAK,mBAAmB,cAAc,YAAY,gBAAgB,qBAE1F,KAAK,mBAChB,CACJ,CC/6BA,MAAMuV,EAAU,CACZ,YAAY7C,EAAeC,EAAgB,CAAA,EAAIC,EAAoB,CAC/D,KAAK,cAAgBF,EACrB,KAAK,cAAgBC,EACrB,KAAK,QAAUC,GAAsB,OACzC,CACA,QAAQrK,EAAUjwC,EAAU06C,EAAK,CAC7B,MAAMtnD,EAAS68C,EAAS,SAASjwC,CAAQ,EACzC,IAAI7X,EAAOuyD,EAAI,kBAAkBtnD,CAAM,EACvC,GAAI,CAACjL,IAASA,EAAK,OAAS,UAAYA,EAAK,OAAS,UAAYiL,EAASjL,EAAK,OAAS,GAAKiL,EAASjL,EAAK,OAASA,EAAK,OAAS,EAC/H,OAAO,KAAK,QAAQ,QAAQ,IAAI,EAEpC,MAAM+0D,EAAiB/0D,EAEvB,GAAIA,EAAK,OAAS,SAAU,CACxB,MAAMjB,EAASiB,EAAK,OACpB,GAAIjB,GAAUA,EAAO,OAAS,YAAcA,EAAO,UAAYiB,IAC3DA,EAAOjB,EAAO,UACV,CAACiB,GACD,OAAO,KAAK,QAAQ,QAAQ,IAAI,CAG5C,CACA,MAAMg1D,EAAaz9C,EAAM,OAAOuwC,EAAS,WAAWiN,EAAe,MAAM,EAAGjN,EAAS,WAAWiN,EAAe,OAASA,EAAe,MAAM,CAAC,EACxIE,EAAeC,IACF,CACX,SAAUA,EACV,MAAOF,CACvB,GAGcjT,EAAW3F,GAAYp8C,CAAI,EACjC,QAASpE,EAAI,KAAK,cAAc,OAAS,EAAGA,GAAK,EAAGA,IAAK,CAErD,MAAM6I,EADe,KAAK,cAAc7I,CAAC,EACZ,oBAAoBksD,EAAS,IAAK/F,CAAQ,EACvE,GAAIt9C,EACA,OAAOA,EAAQ,KAAK0wD,GAAeF,EAAYE,CAAW,CAAC,CAEnE,CACA,OAAO,KAAK,cAAc,qBAAqBrN,EAAS,IAAKyK,CAAG,EAAE,KAAM1H,GAAW,CAC/E,GAAIA,GAAU7qD,EAAM,CAChB,MAAMssD,EAAkBiG,EAAI,mBAAmB1H,EAAO,OAAQ7qD,EAAK,MAAM,EACzE,IAAIsiD,EACA8S,EACAC,EAA0CC,EAC9ChJ,EAAgB,MAAOn9C,GAAM,CACzB,GAAIA,EAAE,OAASnP,GAAQ,CAACmP,EAAE,UAAYA,EAAE,SACpCmzC,EAAQA,GAASnzC,EAAE,OAAO,MAC1BimD,EAAsBA,GAAuBjmD,EAAE,OAAO,qBAAuBomD,GAAWpmD,EAAE,OAAO,WAAW,EACxGA,EAAE,OAAO,MAAM,CACf,MAAMsN,EAAMtN,EAAE,OAAO,KAAK,QAAQktC,GAAar8C,CAAI,CAAC,EAChDmP,EAAE,OAAO,yBACTkmD,EAA+BlmD,EAAE,OAAO,yBAAyBsN,CAAG,EAE/DtN,EAAE,OAAO,mBACdkmD,EAA+BE,GAAWpmD,EAAE,OAAO,iBAAiBsN,CAAG,CAAC,GAExE44C,IACAC,EAAYnmD,EAAE,OAAO,KAAKsN,CAAG,EACzB,OAAO64C,GAAc,WACrBA,EAAY,KAAK,UAAUA,CAAS,GAGhD,CAEJ,MAAO,EACX,CAAC,EACD,IAAIr6D,EAAS,GACb,OAAIqnD,IACArnD,EAASs6D,GAAWjT,CAAK,GAEzB8S,IACIn6D,EAAO,OAAS,IAChBA,GAAU;AAAA;AAAA,GAEdA,GAAUm6D,GAEVC,IACIp6D,EAAO,OAAS,IAChBA,GAAU;AAAA;AAAA,GAEdA,GAAU,KAAKu6D,GAAoBF,CAAS,CAAC,OAAOD,CAA4B,IAE7EJ,EAAY,CAACh6D,CAAM,CAAC,CAC/B,CACA,OAAO,IACX,CAAC,CACL,CACJ,CACA,SAASs6D,GAAWE,EAAO,CACvB,GAAIA,EAEA,OADYA,EAAM,QAAQ,8BAA+B;AAAA;AAAA,GAAU,EACxD,QAAQ,wBAAyB,MAAM,CAG1D,CACA,SAASD,GAAoB78B,EAAS,CAElC,OAAIA,EAAQ,QAAQ,GAAG,IAAM,GAClB,MAAQA,EAAU,MAEtBA,CACX,CCrGA,MAAM+8B,EAAe,CACjB,YAAYC,EAAmBxD,EAAoB,CAC/C,KAAK,kBAAoBwD,EACzB,KAAK,QAAUxD,EACf,KAAK,kBAAoB,EAC7B,CACA,UAAUyD,EAAK,CACPA,IACA,KAAK,kBAAoBA,EAAI,WAAa,GAC1C,KAAK,gBAAkBA,EAAI,cAAgB,OAAY5T,GAAmB,MAElF,CACA,aAAakB,EAAc2S,EAAcC,EAAkBjL,EAAQ,CAC/D,GAAI,CAAC,KAAK,kBACN,OAAO,KAAK,QAAQ,QAAQ,EAAE,EAElC,MAAMpF,EAAc,CAAA,EACdsQ,EAAQ,CAAA,EACRC,EAAcC,GAAY,CAE5B,MAAMC,EAAYD,EAAQ,MAAM,MAAM,KAAO,IAAMA,EAAQ,MAAM,MAAM,UAAY,IAAMA,EAAQ,QAC5FF,EAAMG,CAAS,IAChBH,EAAMG,CAAS,EAAI,GACnBzQ,EAAY,KAAKwQ,CAAO,EAEhC,EACME,EAAkBtL,GAAW,CAC/B,IAAIuL,EAAwBN,GAAkB,eAAiBO,GAAqBP,EAAiB,cAAc,EAAI9T,GAAmB,MACtIsU,EAAkBR,GAAkB,SAAWO,GAAqBP,EAAiB,QAAQ,EAAI,KAAK,gBACtGS,EAAmBT,GAAkB,iBAAmBO,GAAqBP,EAAiB,gBAAgB,EAAI9T,GAAmB,QACrIwU,EAAgBV,GAAkB,cAAgBO,GAAqBP,EAAiB,aAAa,EAAI9T,GAAmB,QAChI,GAAI6I,EAAQ,CACR,MAAM4L,EAAmB,CAAC1H,EAAc2H,IAAc,CAClD,GAAIb,EAAa,MAAQW,EAAe,CACpC,MAAMG,EAAUd,EAAa,KACvBvE,EAAWqF,EAAQ,OAAS,SAAWA,EAAQ,WAAW,CAAC,EAAI,OACrE,GAAIrF,GAAYA,EAAS,QAAQ,QAAU,UAAW,CAClD,MAAMtxD,EAAOsxD,EAAS,WAAaA,EAC7B15C,EAAQL,EAAM,OAAO2rC,EAAa,WAAWljD,EAAK,MAAM,EAAGkjD,EAAa,WAAWljD,EAAK,OAASA,EAAK,MAAM,CAAC,EACnHg2D,EAAW7T,GAAW,OAAOvqC,EAAOm3C,EAAcyH,EAAeE,CAAS,CAAC,CAC/E,KACK,CACD,MAAM9+C,EAAQL,EAAM,OAAO2rC,EAAa,WAAWyT,EAAQ,MAAM,EAAGzT,EAAa,WAAWyT,EAAQ,OAAS,CAAC,CAAC,EAC/GX,EAAW7T,GAAW,OAAOvqC,EAAOm3C,EAAcyH,EAAeE,CAAS,CAAC,CAC/E,CACJ,CACJ,EACA,GAAI7L,EAAO,OAAO,OACd4L,EAAiB5L,EAAO,OAAO,CAAC,EAAGpB,EAAU,kBAAkB,UAE1D8M,EAAkB,CACvB,UAAWK,KAAW/L,EAAO,SACzB4L,EAAiBG,EAASnN,EAAU,wBAAwB,EAEhE,MAAMoN,EAAiBhB,EAAa,SAAS3S,EAAc2H,EAAO,OAAQ0L,EAAkBT,GAAkB,WAAW,EACrHe,GACAA,EAAe,QAAQb,CAAU,CAEzC,CACIc,GAAqBjM,EAAO,MAAM,IAClCyL,EAAkB,QAElBS,GAA2BlM,EAAO,MAAM,IACxCuL,EAAwB,OAEhC,CACA,UAAW5pB,KAAKqpB,EAAa,aAAc,CACvC,GAAIrpB,EAAE,OAASid,EAAU,cAAe,CACpC,GAAI,OAAO2M,GAA0B,SACjC,SAEJ5pB,EAAE,SAAW4pB,CACjB,CACAJ,EAAWxpB,CAAC,CAChB,CACA,GAAI,OAAO8pB,GAAoB,SAAU,CACrC,MAAM57D,EAAU2a,EAAE,qCAAqC,EACvDwgD,EAAa,SAAS,QAAQlgC,GAAK,CAC/BqgC,EAAW7T,GAAW,OAAOxsB,EAAGj7B,EAAS47D,EAAiB7M,EAAU,mBAAmB,CAAC,CAC5F,CAAC,CACL,CACA,OAAOhE,CACX,EACA,GAAIoF,EAAQ,CACR,MAAMrlC,EAAMqlC,EAAO,IAAO,4BAA8BmM,KAExD,OADe,KAAK,kBAAkB,uBAAuB,CAAE,IAAAxxC,EAAK,OAAAqlC,EAAQ,EAC9D,oBAAoB,KAAKoM,GAC5Bd,EAAec,CAAc,CACvC,CACL,CACA,OAAO,KAAK,kBAAkB,qBAAqB/T,EAAa,IAAK2S,CAAY,EAAE,KAAKhL,GAC7EsL,EAAetL,CAAM,CAC/B,CACL,CACA,kBAAkB3H,EAAc2S,EAAc,CAC1C,MAAO,CAAE,QAAS,KAAK,kBAAkB,yBAAyB3S,EAAa,IAAK2S,CAAY,CAAC,CACrG,CACJ,CACA,IAAImB,GAAY,EAChB,SAASF,GAAqBI,EAAW,CACrC,GAAIA,GAAa,OAAOA,GAAc,SAAU,CAC5C,GAAI1X,GAAU0X,EAAU,aAAa,EACjC,OAAOA,EAAU,cAErB,GAAIA,EAAU,MACV,UAAWrM,KAAUqM,EAAU,MAAO,CAClC,MAAMC,EAAQL,GAAqBjM,CAAM,EACzC,GAAIrL,GAAU2X,CAAK,EACf,OAAOA,CAEf,CAER,CAEJ,CACA,SAASJ,GAA2BG,EAAW,CAC3C,GAAIA,GAAa,OAAOA,GAAc,SAAU,CAC5C,GAAI1X,GAAU0X,EAAU,mBAAmB,EACvC,OAAOA,EAAU,oBAErB,MAAME,EAAgBF,EACtB,GAAI1X,GAAU4X,EAAc,oBAAuB,EAC/C,OAAOA,EAAc,qBAEzB,GAAIF,EAAU,MACV,UAAWrM,KAAUqM,EAAU,MAAO,CAClC,MAAMC,EAAQJ,GAA2BlM,CAAM,EAC/C,GAAIrL,GAAU2X,CAAK,EACf,OAAOA,CAEf,CAER,CAEJ,CACA,SAASd,GAAqBgB,EAAe,CACzC,OAAQA,EAAa,CACjB,IAAK,QAAS,OAAOrV,GAAmB,MACxC,IAAK,UAAW,OAAOA,GAAmB,QAC1C,IAAK,SAAU,MACvB,CAEA,CCnJA,MAAMsV,GAAS,GACTC,GAAS,GACTC,GAAI,GACJ37D,GAAI,GACJy2B,GAAI,IACV,SAASmlC,GAAS9sD,EAAU,CACxB,OAAIA,EAAW2sD,GACJ,EAEP3sD,GAAY4sD,GACL5sD,EAAW2sD,IAElB3sD,EAAW9O,KACX8O,GAAa9O,GAAI27D,IAEjB7sD,GAAY9O,IAAK8O,GAAY2nB,GACtB3nB,EAAW9O,GAAI,GAEnB,EACX,CACA,SAAS67D,GAAax7C,EAAM,CACxB,GAAIA,EAAK,CAAC,IAAM,IAGhB,OAAQA,EAAK,OAAM,CACf,IAAK,GACD,MAAO,CACH,IAAMu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAQ,IAC7C,MAAQu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAQ,IAC/C,KAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAQ,IAC9C,MAAO,CACvB,EACQ,IAAK,GACD,MAAO,CACH,IAAMu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAQ,IAC7C,MAAQu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAQ,IAC/C,KAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAQ,IAC9C,MAAQu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAQ,GAC/D,EACQ,IAAK,GACD,MAAO,CACH,KAAMu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,GAAK,IAC5E,OAAQu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,GAAK,IAC9E,MAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,GAAK,IAC7E,MAAO,CACvB,EACQ,IAAK,GACD,MAAO,CACH,KAAMu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,GAAK,IAC5E,OAAQu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,GAAK,IAC9E,MAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,GAAK,IAC7E,OAAQu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,EAAI,GAAOu7C,GAASv7C,EAAK,WAAW,CAAC,CAAC,GAAK,GAC9F,CACA,CAEA,CChDA,MAAMy7C,EAAoB,CACtB,YAAY1F,EAAe,CACvB,KAAK,cAAgBA,CACzB,CACA,oBAAoBnK,EAAUyK,EAAK31C,EAAU,CAAE,YAAa,OAAO,WAAa,CAC5E,MAAMkvC,EAAOyG,EAAI,KACjB,GAAI,CAACzG,EACD,MAAO,CAAA,EAEX,IAAI5+B,EAAQtQ,EAAQ,aAAe,OAAO,UAE1C,MAAMg7C,EAAiB9P,EAAS,IAChC,IAAK8P,IAAmB,6CAAgD/X,GAAS+X,EAAe,YAAW,EAAI,wBAAwB,IAC/H9L,EAAK,OAAS,QAAS,CACvB,MAAM7wD,EAAS,CAAA,EACf,UAAW2C,KAAQkuD,EAAK,MACpB,GAAIluD,EAAK,OAAS,UACd,UAAW0zD,KAAY1zD,EAAK,WACxB,GAAI0zD,EAAS,QAAQ,QAAU,OAASA,EAAS,UAAW,CACxD,MAAMvP,EAAWtB,GAAS,OAAOqH,EAAS,IAAK+P,GAAS/P,EAAUlqD,CAAI,CAAC,EAGvE,GAFA3C,EAAO,KAAK,CAAE,KAAM68D,GAAQxG,EAAS,SAAS,EAAG,KAAMxlC,GAAW,SAAU,SAAUi2B,CAAQ,CAAE,EAChG70B,IACIA,GAAS,EACT,OAAItQ,GAAWA,EAAQ,uBACnBA,EAAQ,sBAAsBg7C,CAAc,EAEzC38D,CAEf,EAIZ,OAAOA,CACX,CAEJ,MAAM88D,EAAU,CACZ,CAAE,KAAMjM,EAAM,cAAe,EAAE,CAC3C,EACQ,IAAIkM,EAAc,EACdC,EAAgB,GACpB,MAAMh9D,EAAS,CAAA,EACTi9D,EAAwB,CAACl4D,EAAMilD,IAAkB,CAC/CjlD,EAAK,OAAS,QACdA,EAAK,MAAM,QAAQA,GAAQ,CACnBA,GACA+3D,EAAQ,KAAK,CAAE,KAAA/3D,EAAM,cAAAilD,CAAa,CAAE,CAE5C,CAAC,EAEIjlD,EAAK,OAAS,UACnBA,EAAK,WAAW,QAASsxD,GAAa,CAClC,MAAMhV,EAAYgV,EAAS,UAC3B,GAAIhV,EACA,GAAIpvB,EAAQ,EAAG,CACXA,IACA,MAAM60B,EAAWtB,GAAS,OAAOqH,EAAS,IAAK+P,GAAS/P,EAAUwJ,CAAQ,CAAC,EACrE6G,EAAqBlT,EAAgBA,EAAgB,IAAMqM,EAAS,QAAQ,MAAQA,EAAS,QAAQ,MAC3Gr2D,EAAO,KAAK,CAAE,KAAM,KAAK,YAAYq2D,CAAQ,EAAG,KAAM,KAAK,cAAchV,EAAU,IAAI,EAAG,SAAUyF,EAAU,cAAekD,EAAe,EAC5I8S,EAAQ,KAAK,CAAE,KAAMzb,EAAW,cAAe6b,EAAoB,CACvE,MAEIF,EAAgB,EAG5B,CAAC,CAET,EAEA,KAAOD,EAAcD,EAAQ,QAAQ,CACjC,MAAMr5D,EAAOq5D,EAAQC,GAAa,EAClCE,EAAsBx5D,EAAK,KAAMA,EAAK,aAAa,CACvD,CACA,OAAIu5D,GAAiBr7C,GAAWA,EAAQ,uBACpCA,EAAQ,sBAAsBg7C,CAAc,EAEzC38D,CACX,CACA,qBAAqB6sD,EAAUyK,EAAK31C,EAAU,CAAE,YAAa,OAAO,WAAa,CAC7E,MAAMkvC,EAAOyG,EAAI,KACjB,GAAI,CAACzG,EACD,MAAO,CAAA,EAEX,IAAI5+B,EAAQtQ,EAAQ,aAAe,OAAO,UAE1C,MAAMg7C,EAAiB9P,EAAS,IAChC,IAAK8P,IAAmB,6CAAgD/X,GAAS+X,EAAe,YAAW,EAAI,wBAAwB,IAC/H9L,EAAK,OAAS,QAAS,CACvB,MAAM7wD,EAAS,CAAA,EACf,UAAW2C,KAAQkuD,EAAK,MACpB,GAAIluD,EAAK,OAAS,UACd,UAAW0zD,KAAY1zD,EAAK,WACxB,GAAI0zD,EAAS,QAAQ,QAAU,OAASA,EAAS,UAAW,CACxD,MAAM15C,EAAQigD,GAAS/P,EAAUlqD,CAAI,EAC/BynD,EAAiBwS,GAAS/P,EAAUwJ,EAAS,OAAO,EAG1D,GAFAr2D,EAAO,KAAK,CAAE,KAAM68D,GAAQxG,EAAS,SAAS,EAAG,KAAMxlC,GAAW,SAAU,MAAAlU,EAAO,eAAAytC,CAAc,CAAE,EACnGn4B,IACIA,GAAS,EACT,OAAItQ,GAAWA,EAAQ,uBACnBA,EAAQ,sBAAsBg7C,CAAc,EAEzC38D,CAEf,EAIZ,OAAOA,CACX,CAEJ,MAAMA,EAAS,CAAA,EACT88D,EAAU,CACZ,CAAE,KAAMjM,EAAM,OAAA7wD,CAAM,CAChC,EACQ,IAAI+8D,EAAc,EACdC,EAAgB,GACpB,MAAMC,EAAwB,CAACl4D,EAAM/E,IAAW,CACxC+E,EAAK,OAAS,QACdA,EAAK,MAAM,QAAQ,CAACA,EAAMxC,IAAU,CAChC,GAAIwC,EACA,GAAIktB,EAAQ,EAAG,CACXA,IACA,MAAMtV,EAAQigD,GAAS/P,EAAU9nD,CAAI,EAC/BqlD,EAAiBztC,EAEjBwgD,EAAS,CAAE,KADJ,OAAO56D,CAAK,EACF,KAAM,KAAK,cAAcwC,EAAK,IAAI,EAAG,MAAA4X,EAAO,eAAAytC,EAAgB,SAAU,CAAA,CAAE,EAC/FpqD,EAAO,KAAKm9D,CAAM,EAClBL,EAAQ,KAAK,CAAE,OAAQK,EAAO,SAAU,KAAAp4D,EAAM,CAClD,MAEIi4D,EAAgB,EAG5B,CAAC,EAEIj4D,EAAK,OAAS,UACnBA,EAAK,WAAW,QAASsxD,GAAa,CAClC,MAAMhV,EAAYgV,EAAS,UAC3B,GAAIhV,EACA,GAAIpvB,EAAQ,EAAG,CACXA,IACA,MAAMtV,EAAQigD,GAAS/P,EAAUwJ,CAAQ,EACnCjM,EAAiBwS,GAAS/P,EAAUwJ,EAAS,OAAO,EACpD5U,EAAW,CAAA,EACX0b,EAAS,CAAE,KAAM,KAAK,YAAY9G,CAAQ,EAAG,KAAM,KAAK,cAAchV,EAAU,IAAI,EAAG,MAAA1kC,EAAO,eAAAytC,EAAgB,SAAA3I,EAAU,OAAQ,KAAK,UAAUJ,CAAS,CAAC,EAC/JrhD,EAAO,KAAKm9D,CAAM,EAClBL,EAAQ,KAAK,CAAE,OAAQrb,EAAU,KAAMJ,EAAW,CACtD,MAEI2b,EAAgB,EAG5B,CAAC,CAET,EAEA,KAAOD,EAAcD,EAAQ,QAAQ,CACjC,MAAMr5D,EAAOq5D,EAAQC,GAAa,EAClCE,EAAsBx5D,EAAK,KAAMA,EAAK,MAAM,CAChD,CACA,OAAIu5D,GAAiBr7C,GAAWA,EAAQ,uBACpCA,EAAQ,sBAAsBg7C,CAAc,EAEzC38D,CACX,CACA,cAAco9D,EAAU,CACpB,OAAQA,EAAQ,CACZ,IAAK,SACD,OAAOvsC,GAAW,OACtB,IAAK,SACD,OAAOA,GAAW,OACtB,IAAK,SACD,OAAOA,GAAW,OACtB,IAAK,QACD,OAAOA,GAAW,MACtB,IAAK,UACD,OAAOA,GAAW,QACtB,QACI,OAAOA,GAAW,QAClC,CACI,CACA,YAAYwlC,EAAU,CAClB,IAAI72D,EAAO62D,EAAS,QAAQ,MAI5B,OAHI72D,IACAA,EAAOA,EAAK,QAAQ,QAAS,GAAG,GAEhCA,GAAQA,EAAK,OACNA,EAEJ,IAAIA,CAAI,GACnB,CACA,UAAUuF,EAAM,CACZ,GAAKA,EAGL,IAAIA,EAAK,OAAS,WAAaA,EAAK,OAAS,UAAYA,EAAK,OAAS,QAAUA,EAAK,OAAS,SAC3F,OAAO,OAAOA,EAAK,KAAK,EAGxB,GAAIA,EAAK,OAAS,QACd,OAAOA,EAAK,SAAS,OAAS,OAAY,KAEzC,GAAIA,EAAK,OAAS,SACnB,OAAOA,EAAK,SAAS,OAAS,OAAY,KAItD,CACA,mBAAmB8nD,EAAUyK,EAAK31C,EAAS,CACvC,OAAO,KAAK,cAAc,qBAAqBkrC,EAAS,IAAKyK,CAAG,EAAE,KAAK1H,GAAU,CAC7E,MAAM5vD,EAAS,CAAA,EACf,GAAI4vD,EAAQ,CACR,IAAI39B,EAAQtQ,GAAW,OAAOA,EAAQ,aAAgB,SAAWA,EAAQ,YAAc,OAAO,UAC9F,MAAM0vC,EAAkBiG,EAAI,mBAAmB1H,EAAO,MAAM,EACtDyN,EAAc,CAAA,EACpB,UAAWnpD,KAAKm9C,EACZ,GAAI,CAACn9C,EAAE,UAAYA,EAAE,SAAWA,EAAE,OAAO,SAAW,SAAWA,EAAE,OAAO,SAAW,cAAgBA,EAAE,MAAQA,EAAE,KAAK,OAAS,SAAU,CACnI,MAAMopD,EAAS,OAAOppD,EAAE,KAAK,MAAM,EACnC,GAAI,CAACmpD,EAAYC,CAAM,EAAG,CACtB,MAAMjrB,EAAQoqB,GAAarb,GAAaltC,EAAE,IAAI,CAAC,EAC/C,GAAIm+B,EAAO,CACP,MAAM11B,EAAQigD,GAAS/P,EAAU34C,EAAE,IAAI,EACvClU,EAAO,KAAK,CAAE,MAAAqyC,EAAO,MAAA11B,CAAK,CAAE,CAChC,CAGA,GAFA0gD,EAAYC,CAAM,EAAI,GACtBrrC,IACIA,GAAS,EACT,OAAItQ,GAAWA,EAAQ,uBACnBA,EAAQ,sBAAsBkrC,EAAS,GAAG,EAEvC7sD,CAEf,CACJ,CAER,CACA,OAAOA,CACX,CAAC,CACL,CACA,sBAAsB6sD,EAAUyK,EAAKjlB,EAAO11B,EAAO,CAC/C,MAAM3c,EAAS,CAAA,EACTu9D,EAAS,KAAK,MAAMlrB,EAAM,IAAM,GAAG,EAAGmrB,EAAW,KAAK,MAAMnrB,EAAM,MAAQ,GAAG,EAAGorB,EAAU,KAAK,MAAMprB,EAAM,KAAO,GAAG,EAC3H,SAASqrB,EAAc5xD,EAAG,CACtB,MAAM+G,EAAI/G,EAAE,SAAS,EAAE,EACvB,OAAO+G,EAAE,SAAW,EAAI,IAAMA,EAAIA,CACtC,CACA,IAAIuzC,EACJ,OAAI/T,EAAM,QAAU,EAChB+T,EAAQ,IAAIsX,EAAcH,CAAM,CAAC,GAAGG,EAAcF,CAAQ,CAAC,GAAGE,EAAcD,CAAO,CAAC,GAGpFrX,EAAQ,IAAIsX,EAAcH,CAAM,CAAC,GAAGG,EAAcF,CAAQ,CAAC,GAAGE,EAAcD,CAAO,CAAC,GAAGC,EAAc,KAAK,MAAMrrB,EAAM,MAAQ,GAAG,CAAC,CAAC,GAEvIryC,EAAO,KAAK,CAAE,MAAOomD,EAAO,SAAUG,GAAS,QAAQ5pC,EAAO,KAAK,UAAUypC,CAAK,CAAC,CAAC,CAAE,EAC/EpmD,CACX,CACJ,CACA,SAAS48D,GAAS/P,EAAU9nD,EAAM,CAC9B,OAAOuX,EAAM,OAAOuwC,EAAS,WAAW9nD,EAAK,MAAM,EAAG8nD,EAAS,WAAW9nD,EAAK,OAASA,EAAK,MAAM,CAAC,CACxG,CACA,SAAS83D,GAAQ93D,EAAM,CACnB,OAAOq8C,GAAar8C,CAAI,GAAKqV,EAAE,SAAS,CAC5C,CC1QA,MAAMujD,GAAsB,CACxB,mBAAoB,CAAA,EACpB,QAAS,CAEL,0CAA2C,CACvC,QAAW,0CACX,YAAe,CACX,YAAe,CACX,KAAQ,QACR,SAAY,EACZ,MAAS,CACL,KAAQ,GAChC,CACA,EACgB,gBAAmB,CACf,KAAQ,UACR,QAAW,CAC/B,EACgB,wBAA2B,CACvB,MAAS,CACL,CACI,KAAQ,+BACpC,EACwB,CACI,QAAW,CACvC,CACA,CACA,EACgB,YAAe,CACX,KAAQ,SACR,KAAQ,CACJ,QACA,UACA,UACA,OACA,SACA,SACA,QACxB,CACA,EACgB,YAAe,CACX,KAAQ,QACR,MAAS,CACL,KAAQ,QAChC,EACoB,SAAY,EACZ,YAAe,EACnC,CACA,EACY,KAAQ,SACR,WAAc,CACV,GAAM,CACF,KAAQ,SACR,OAAU,KAC9B,EACgB,QAAW,CACP,KAAQ,SACR,OAAU,KAC9B,EACgB,MAAS,CACL,KAAQ,QAC5B,EACgB,YAAe,CACX,KAAQ,QAC5B,EACgB,QAAW,CAAA,EACX,WAAc,CACV,KAAQ,SACR,QAAW,EACX,iBAAoB,EACxC,EACgB,QAAW,CACP,KAAQ,QAC5B,EACgB,iBAAoB,CAChB,KAAQ,UACR,QAAW,EAC/B,EACgB,QAAW,CACP,KAAQ,QAC5B,EACgB,iBAAoB,CAChB,KAAQ,UACR,QAAW,EAC/B,EACgB,UAAa,CACT,MAAS,CACL,CACI,KAAQ,+BACpC,CACA,CACA,EACgB,UAAa,CACT,MAAS,CACL,CACI,KAAQ,uCACpC,CACA,CACA,EACgB,QAAW,CACP,KAAQ,SACR,OAAU,OAC9B,EACgB,gBAAmB,CACf,MAAS,CACL,CACI,KAAQ,SACpC,EACwB,CACI,KAAQ,GACpC,CACA,EACoB,QAAW,CAAA,CAC/B,EACgB,MAAS,CACL,MAAS,CACL,CACI,KAAQ,GACpC,EACwB,CACI,KAAQ,2BACpC,CACA,EACoB,QAAW,CAAA,CAC/B,EACgB,SAAY,CACR,MAAS,CACL,CACI,KAAQ,+BACpC,CACA,CACA,EACgB,SAAY,CACR,MAAS,CACL,CACI,KAAQ,uCACpC,CACA,CACA,EACgB,YAAe,CACX,KAAQ,UACR,QAAW,EAC/B,EACgB,cAAiB,CACb,MAAS,CACL,CACI,KAAQ,+BACpC,CACA,CACA,EACgB,cAAiB,CACb,MAAS,CACL,CACI,KAAQ,uCACpC,CACA,CACA,EACgB,SAAY,CACR,MAAS,CACL,CACI,KAAQ,2BACpC,CACA,CACA,EACgB,qBAAwB,CACpB,MAAS,CACL,CACI,KAAQ,SACpC,EACwB,CACI,KAAQ,GACpC,CACA,EACoB,QAAW,CAAA,CAC/B,EACgB,YAAe,CACX,KAAQ,SACR,qBAAwB,CACpB,KAAQ,GAChC,EACoB,QAAW,CAAA,CAC/B,EACgB,WAAc,CACV,KAAQ,SACR,qBAAwB,CACpB,KAAQ,GAChC,EACoB,QAAW,CAAA,CAC/B,EACgB,kBAAqB,CACjB,KAAQ,SACR,qBAAwB,CACpB,KAAQ,GAChC,EACoB,QAAW,CAAA,CAC/B,EACgB,aAAgB,CACZ,KAAQ,SACR,qBAAwB,CACpB,MAAS,CACL,CACI,KAAQ,GACxC,EAC4B,CACI,KAAQ,2BACxC,CACA,CACA,CACA,EACgB,KAAQ,CACJ,KAAQ,QACR,SAAY,EACZ,YAAe,EACnC,EACgB,KAAQ,CACJ,MAAS,CACL,CACI,KAAQ,2BACpC,EACwB,CACI,KAAQ,QACR,MAAS,CACL,KAAQ,2BACxC,EAC4B,SAAY,EACZ,YAAe,EAC3C,CACA,CACA,EACgB,OAAU,CACN,MAAS,CACL,CACI,KAAQ,SACR,KAAQ,CACJ,YACA,MACA,QACA,WACA,OACA,OACA,OAChC,CACA,EACwB,CACI,KAAQ,QACpC,CACA,CACA,EACgB,MAAS,CACL,MAAS,CACL,CACI,KAAQ,2BACpC,CACA,CACA,EACgB,MAAS,CACL,MAAS,CACL,CACI,KAAQ,2BACpC,CACA,CACA,EACgB,MAAS,CACL,MAAS,CACL,CACI,KAAQ,2BACpC,CACA,CACA,EACgB,IAAO,CACH,MAAS,CACL,CACI,KAAQ,GACpC,CACA,CACA,CACA,EACY,aAAgB,CACZ,iBAAoB,CAChB,SACpB,EACgB,iBAAoB,CAChB,SACpB,CACA,EACY,QAAW,CAAA,CACvB,EACQ,0CAA2C,CACvC,YAAe,CACX,YAAe,CACX,KAAQ,QACR,SAAY,EACZ,MAAS,CAAE,KAAQ,GAAG,CAC1C,EACgB,mBAAsB,CAClB,KAAQ,UACR,QAAW,CAC/B,EACgB,2BAA8B,CAC1B,MAAS,CACL,CAAE,KAAQ,kCAAkC,EAC5C,CAAE,QAAW,CAAC,CACtC,CACA,EACgB,YAAe,CACX,KAAQ,CACJ,QACA,UACA,UACA,OACA,SACA,SACA,QACxB,CACA,EACgB,YAAe,CACX,KAAQ,QACR,MAAS,CAAE,KAAQ,QAAQ,EAC3B,YAAe,GACf,QAAW,CAAA,CAC/B,CACA,EACY,KAAQ,CAAC,SAAU,SAAS,EAC5B,WAAc,CACV,IAAO,CACH,KAAQ,SACR,OAAU,eAC9B,EACgB,QAAW,CACP,KAAQ,SACR,OAAU,KAC9B,EACgB,KAAQ,CACJ,KAAQ,SACR,OAAU,eAC9B,EACgB,SAAY,CACR,KAAQ,QAC5B,EACgB,MAAS,CACL,KAAQ,QAC5B,EACgB,YAAe,CACX,KAAQ,QAC5B,EACgB,QAAW,GACX,SAAY,CACR,KAAQ,UACR,QAAW,EAC/B,EACgB,SAAY,CACR,KAAQ,QACR,MAAS,EAC7B,EACgB,WAAc,CACV,KAAQ,SACR,iBAAoB,CACxC,EACgB,QAAW,CACP,KAAQ,QAC5B,EACgB,iBAAoB,CAChB,KAAQ,QAC5B,EACgB,QAAW,CACP,KAAQ,QAC5B,EACgB,iBAAoB,CAChB,KAAQ,QAC5B,EACgB,UAAa,CAAE,KAAQ,kCAAkC,EACzD,UAAa,CAAE,KAAQ,0CAA0C,EACjE,QAAW,CACP,KAAQ,SACR,OAAU,OAC9B,EACgB,gBAAmB,CAAE,KAAQ,GAAG,EAChC,MAAS,CACL,MAAS,CACL,CAAE,KAAQ,GAAG,EACb,CAAE,KAAQ,2BAA2B,CAC7D,EACoB,QAAW,EAC/B,EACgB,SAAY,CAAE,KAAQ,kCAAkC,EACxD,SAAY,CAAE,KAAQ,0CAA0C,EAChE,YAAe,CACX,KAAQ,UACR,QAAW,EAC/B,EACgB,SAAY,CAAE,KAAQ,GAAG,EACzB,cAAiB,CAAE,KAAQ,kCAAkC,EAC7D,cAAiB,CAAE,KAAQ,0CAA0C,EACrE,SAAY,CAAE,KAAQ,2BAA2B,EACjD,qBAAwB,CAAE,KAAQ,GAAG,EACrC,YAAe,CACX,KAAQ,SACR,qBAAwB,CAAE,KAAQ,GAAG,EACrC,QAAW,CAAA,CAC/B,EACgB,WAAc,CACV,KAAQ,SACR,qBAAwB,CAAE,KAAQ,GAAG,EACrC,QAAW,CAAA,CAC/B,EACgB,kBAAqB,CACjB,KAAQ,SACR,qBAAwB,CAAE,KAAQ,GAAG,EACrC,cAAiB,CAAE,OAAU,OAAO,EACpC,QAAW,CAAA,CAC/B,EACgB,aAAgB,CACZ,KAAQ,SACR,qBAAwB,CACpB,MAAS,CACL,CAAE,KAAQ,GAAG,EACb,CAAE,KAAQ,2BAA2B,CACjE,CACA,CACA,EACgB,cAAiB,CAAE,KAAQ,GAAG,EAC9B,MAAS,GACT,KAAQ,CACJ,KAAQ,QACR,MAAS,GACT,SAAY,EACZ,YAAe,EACnC,EACgB,KAAQ,CACJ,MAAS,CACL,CAAE,KAAQ,2BAA2B,EACrC,CACI,KAAQ,QACR,MAAS,CAAE,KAAQ,2BAA2B,EAC9C,SAAY,EACZ,YAAe,EAC3C,CACA,CACA,EACgB,OAAU,CAAE,KAAQ,QAAQ,EAC5B,iBAAoB,CAAE,KAAQ,QAAQ,EACtC,gBAAmB,CAAE,KAAQ,QAAQ,EACrC,GAAM,CAAE,KAAQ,GAAG,EACnB,KAAQ,CAAE,KAAQ,GAAG,EACrB,KAAQ,CAAE,KAAQ,GAAG,EACrB,MAAS,CAAE,KAAQ,2BAA2B,EAC9C,MAAS,CAAE,KAAQ,2BAA2B,EAC9C,MAAS,CAAE,KAAQ,2BAA2B,EAC9C,IAAO,CAAE,KAAQ,GAAG,CACpC,EACY,QAAW,EACvB,CACA,CACA,EACMC,GAAe,CACjB,GAAIxjD,EAAE,qCAAqC,EAC3C,QAASA,EAAE,6CAA6C,EACxD,MAAOA,EAAE,qCAAqC,EAC9C,YAAaA,EAAE,yEAAyE,EACxF,QAASA,EAAE,uCAAuC,EAClD,WAAYA,EAAE,iFAAiF,EAC/F,QAASA,EAAE,oDAAoD,EAC/D,iBAAkBA,EAAE,uCAAuC,EAC3D,QAASA,EAAE,oDAAoD,EAC/D,iBAAkBA,EAAE,uCAAuC,EAC3D,UAAWA,EAAE,iCAAiC,EAC9C,UAAWA,EAAE,iCAAiC,EAC9C,QAASA,EAAE,kFAAkF,EAC7F,gBAAiBA,EAAE,uNAAuN,EAC1O,MAAOA,EAAE,sPAAsP,EAC/P,SAAUA,EAAE,qEAAqE,EACjF,SAAUA,EAAE,qEAAqE,EACjF,YAAaA,EAAE,qEAAqE,EACpF,cAAeA,EAAE,iEAAiE,EAClF,cAAeA,EAAE,iEAAiE,EAClF,SAAUA,EAAE,qFAAqF,EACjG,qBAAsBA,EAAE,yNAAyN,EACjP,YAAaA,EAAE,6FAA6F,EAC5G,WAAYA,EAAE,uDAAuD,EACrE,kBAAmBA,EAAE,oFAAoF,EACzG,aAAcA,EAAE,4VAA4V,EAC5W,KAAMA,EAAE,2CAA2C,EACnD,KAAMA,EAAE,qKAAqK,EAC7K,OAAQA,EAAE,8CAA8C,EACxD,MAAOA,EAAE,+CAA+C,EACxD,MAAOA,EAAE,qDAAqD,EAC9D,MAAOA,EAAE,uDAAuD,EAChE,IAAKA,EAAE,gCAAgC,EACvC,IAAKA,EAAE,qCAAqC,EAC5C,KAAMA,EAAE,gDAAgD,EACxD,SAAUA,EAAE,uEAAuE,EACnF,SAAUA,EAAE,0FAA0F,EACtG,SAAUA,EAAE,gGAAgG,EAC5G,SAAUA,EAAE,kHAAoH,EAChI,cAAeA,EAAE,oIAAoI,EACrJ,MAAOA,EAAE,4GAA4G,EACrH,iBAAkBA,EAAE,gDAAgD,EACpE,gBAAiBA,EAAE,sDAAsD,EACzE,GAAIA,EAAE,6GAAmH,EACzH,KAAMA,EAAE,6EAAiF,EACzF,KAAMA,EAAE,4EAAgF,CAC5F,EACA,UAAWyjD,KAAcF,GAAoB,QAAS,CAClD,MAAM/N,EAAS+N,GAAoB,QAAQE,CAAU,EACrD,UAAWxH,KAAYzG,EAAO,WAAY,CACtC,IAAIkO,EAAiBlO,EAAO,WAAWyG,CAAQ,EAC3C,OAAOyH,GAAmB,YAC1BA,EAAiBlO,EAAO,WAAWyG,CAAQ,EAAI,CAAA,GAEnD,MAAMzO,EAAcgW,GAAavH,CAAQ,EACrCzO,IACAkW,EAAe,YAAiBlW,EAExC,CACJ,CCxgBA,IAAImW,IAAK,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI3jD,GAAG,CAAC,SAAShb,EAAEgb,EAAE,CAAC,GAAa,OAAOA,GAAjB,SAAmB,MAAM,IAAI,UAAU,mCAAmC,KAAK,UAAUA,CAAC,CAAC,CAAC,CAAC,SAASvH,EAAEuH,EAAEhb,EAAE,CAAC,QAAQyT,EAAE/G,EAAE,GAAGnL,EAAE,EAAE6D,EAAE,GAAG0P,EAAE,EAAEi9B,EAAE,EAAEA,GAAG/2B,EAAE,OAAO,EAAE+2B,EAAE,CAAC,GAAGA,EAAE/2B,EAAE,OAAOvH,EAAEuH,EAAE,WAAW+2B,CAAC,MAAO,CAAC,GAAQt+B,IAAL,GAAO,MAAMA,EAAE,EAAG,CAAC,GAAQA,IAAL,GAAO,CAAC,GAAG,EAAArO,IAAI2sC,EAAE,GAAOj9B,IAAJ,GAAY,GAAG1P,IAAI2sC,EAAE,GAAOj9B,IAAJ,EAAM,CAAC,GAAGpI,EAAE,OAAO,GAAOnL,IAAJ,GAAYmL,EAAE,WAAWA,EAAE,OAAO,CAAC,IAA5B,IAAoCA,EAAE,WAAWA,EAAE,OAAO,CAAC,IAA5B,IAA8B,GAAGA,EAAE,OAAO,EAAE,CAAC,IAAIlL,EAAEkL,EAAE,YAAY,GAAG,EAAE,GAAGlL,IAAIkL,EAAE,OAAO,EAAE,CAAOlL,IAAL,IAAQkL,EAAE,GAAGnL,EAAE,GAAGA,GAAGmL,EAAEA,EAAE,MAAM,EAAElL,CAAC,GAAG,OAAO,EAAEkL,EAAE,YAAY,GAAG,EAAEtH,EAAE2sC,EAAEj9B,EAAE,EAAE,QAAQ,CAAC,SAAapI,EAAE,SAAN,GAAkBA,EAAE,SAAN,EAAa,CAACA,EAAE,GAAGnL,EAAE,EAAE6D,EAAE2sC,EAAEj9B,EAAE,EAAE,QAAQ,EAAC9U,IAAI0M,EAAE,OAAO,EAAEA,GAAG,MAAMA,EAAE,KAAKnL,EAAE,EAAG,MAAMmL,EAAE,OAAO,EAAEA,GAAG,IAAIsO,EAAE,MAAM5V,EAAE,EAAE2sC,CAAC,EAAErlC,EAAEsO,EAAE,MAAM5V,EAAE,EAAE2sC,CAAC,EAAExwC,EAAEwwC,EAAE3sC,EAAE,EAAEA,EAAE2sC,EAAEj9B,EAAE,CAAE,MAAWrB,IAAL,IAAaqB,IAAL,GAAO,EAAEA,EAAEA,EAAE,EAAG,CAAC,OAAOpI,CAAC,CAAC,IAAIA,EAAE,CAAC,QAAQ,UAAU,CAAC,QAAQsO,EAAEtO,EAAE,GAAGnL,EAAE,GAAM6D,EAAE,UAAU,OAAO,EAAEA,GAAG,IAAI,CAAC7D,EAAE6D,IAAI,CAAC,IAAI0P,EAAE1P,GAAG,EAAE0P,EAAE,UAAU1P,CAAC,GAAY4V,IAAT,SAAaA,EAAE,QAAQ,IAAG,GAAIlG,EAAEkG,GAAGhb,EAAE8U,CAAC,EAAMA,EAAE,SAAN,IAAepI,EAAEoI,EAAE,IAAIpI,EAAEnL,EAAOuT,EAAE,WAAW,CAAC,IAAnB,GAAsB,CAAC,OAAOpI,EAAE+G,EAAE/G,EAAE,CAACnL,CAAC,EAAEA,EAAEmL,EAAE,OAAO,EAAE,IAAIA,EAAE,IAAIA,EAAE,OAAO,EAAEA,EAAE,GAAG,EAAE,UAAU,SAASsO,EAAE,CAAC,GAAGhb,EAAEgb,CAAC,EAAMA,EAAE,SAAN,EAAa,MAAO,IAAI,IAAItO,EAAOsO,EAAE,WAAW,CAAC,IAAnB,GAAqBzZ,EAAOyZ,EAAE,WAAWA,EAAE,OAAO,CAAC,IAA5B,GAA8B,OAAYA,EAAEvH,EAAEuH,EAAE,CAACtO,CAAC,GAAG,SAAhB,GAAwBA,IAAIsO,EAAE,KAAKA,EAAE,OAAO,GAAGzZ,IAAIyZ,GAAG,KAAKtO,EAAE,IAAIsO,EAAEA,CAAC,EAAE,WAAW,SAASA,EAAE,CAAC,OAAOhb,EAAEgb,CAAC,EAAEA,EAAE,OAAO,GAAQA,EAAE,WAAW,CAAC,IAAnB,EAAoB,EAAE,KAAK,UAAU,CAAC,GAAO,UAAU,SAAd,EAAqB,MAAO,IAAI,QAAQA,EAAEvH,EAAE,EAAEA,EAAE,UAAU,OAAO,EAAEA,EAAE,CAAC,IAAIlS,EAAE,UAAUkS,CAAC,EAAEzT,EAAEuB,CAAC,EAAEA,EAAE,OAAO,IAAayZ,IAAT,OAAWA,EAAEzZ,EAAEyZ,GAAG,IAAIzZ,EAAG,CAAC,OAAgByZ,IAAT,OAAW,IAAItO,EAAE,UAAUsO,CAAC,CAAC,EAAE,SAAS,SAASA,EAAEvH,EAAE,CAA8B,GAA1BzT,EAAEgb,CAAC,EAAEhb,EAAEyT,CAAC,EAAEuH,IAAIvH,IAAgBuH,EAAEtO,EAAE,QAAQsO,CAAC,MAAMvH,EAAE/G,EAAE,QAAQ+G,CAAC,GAAG,MAAO,GAAG,QAAQlS,EAAE,EAAEA,EAAEyZ,EAAE,QAAaA,EAAE,WAAWzZ,CAAC,IAAnB,GAAqB,EAAEA,EAAE,CAAC,QAAQ6D,EAAE4V,EAAE,OAAOlG,EAAE1P,EAAE7D,EAAEwwC,EAAE,EAAEA,EAAEt+B,EAAE,QAAaA,EAAE,WAAWs+B,CAAC,IAAnB,GAAqB,EAAEA,EAAE,CAAC,QAAQvwC,EAAEiS,EAAE,OAAOs+B,EAAEzW,EAAExmB,EAAEtT,EAAEsT,EAAEtT,EAAEy2B,EAAE,GAAG2mC,EAAE,EAAEA,GAAGtjC,EAAE,EAAEsjC,EAAE,CAAC,GAAGA,IAAItjC,EAAE,CAAC,GAAG95B,EAAE85B,EAAE,CAAC,GAAQ7nB,EAAE,WAAWs+B,EAAE6sB,CAAC,IAArB,GAAuB,OAAOnrD,EAAE,MAAMs+B,EAAE6sB,EAAE,CAAC,EAAE,GAAOA,IAAJ,EAAM,OAAOnrD,EAAE,MAAMs+B,EAAE6sB,CAAC,CAAC,MAAM9pD,EAAEwmB,IAAStgB,EAAE,WAAWzZ,EAAEq9D,CAAC,IAArB,GAAuB3mC,EAAE2mC,EAAMA,IAAJ,IAAQ3mC,EAAE,IAAI,KAAK,CAAC,IAAIvmB,EAAEsJ,EAAE,WAAWzZ,EAAEq9D,CAAC,EAAE,GAAGltD,IAAI+B,EAAE,WAAWs+B,EAAE6sB,CAAC,EAAE,MAAWltD,IAAL,KAASumB,EAAE2mC,EAAG,CAAC,IAAI5/B,EAAE,GAAG,IAAI4/B,EAAEr9D,EAAE02B,EAAE,EAAE2mC,GAAGx5D,EAAE,EAAEw5D,EAAEA,IAAIx5D,GAAQ4V,EAAE,WAAW4jD,CAAC,IAAnB,KAA2B5/B,EAAE,SAAN,EAAaA,GAAG,KAAKA,GAAG,OAAO,OAAOA,EAAE,OAAO,EAAEA,EAAEvrB,EAAE,MAAMs+B,EAAE9Z,CAAC,GAAG8Z,GAAG9Z,EAAOxkB,EAAE,WAAWs+B,CAAC,IAAnB,IAAsB,EAAEA,EAAEt+B,EAAE,MAAMs+B,CAAC,EAAE,EAAE,UAAU,SAAS/2B,EAAE,CAAC,OAAOA,CAAC,EAAE,QAAQ,SAASA,EAAE,CAAC,GAAGhb,EAAEgb,CAAC,EAAMA,EAAE,SAAN,EAAa,MAAO,IAAI,QAAQvH,EAAEuH,EAAE,WAAW,CAAC,EAAEtO,EAAO+G,IAAL,GAAOlS,EAAE,GAAG6D,EAAE,GAAK0P,EAAEkG,EAAE,OAAO,EAAElG,GAAG,EAAE,EAAEA,EAAE,IAASrB,EAAEuH,EAAE,WAAWlG,CAAC,KAAtB,IAA0B,GAAG,CAAC1P,EAAE,CAAC7D,EAAEuT,EAAE,KAAK,OAAO1P,EAAE,GAAM,OAAa7D,IAAL,GAAOmL,EAAE,IAAI,IAAIA,GAAOnL,IAAJ,EAAM,KAAKyZ,EAAE,MAAM,EAAEzZ,CAAC,CAAC,EAAE,SAAS,SAASyZ,EAAEvH,EAAE,CAAC,GAAYA,IAAT,QAAsB,OAAOA,GAAjB,SAAmB,MAAM,IAAI,UAAU,iCAAiC,EAAEzT,EAAEgb,CAAC,EAAE,IAAItO,EAAEnL,EAAE,EAAE6D,EAAE,GAAG0P,EAAE,GAAK,GAAYrB,IAAT,QAAYA,EAAE,OAAO,GAAGA,EAAE,QAAQuH,EAAE,OAAO,CAAC,GAAGvH,EAAE,SAASuH,EAAE,QAAQvH,IAAIuH,EAAE,MAAO,GAAG,IAAI+2B,EAAEt+B,EAAE,OAAO,EAAEjS,EAAE,GAAG,IAAIkL,EAAEsO,EAAE,OAAO,EAAEtO,GAAG,EAAE,EAAEA,EAAE,CAAC,IAAI4uB,EAAEtgB,EAAE,WAAWtO,CAAC,EAAE,GAAQ4uB,IAAL,IAAQ,GAAG,CAACxmB,EAAE,CAACvT,EAAEmL,EAAE,EAAE,KAAK,OAAalL,IAAL,KAASsT,EAAE,GAAMtT,EAAEkL,EAAE,GAAGqlC,GAAG,IAAIzW,IAAI7nB,EAAE,WAAWs+B,CAAC,EAAM,EAAEA,GAAN,KAAU3sC,EAAEsH,IAAIqlC,EAAE,GAAG3sC,EAAE5D,GAAI,CAAC,OAAOD,IAAI6D,EAAEA,EAAE5D,EAAO4D,IAAL,KAASA,EAAE4V,EAAE,QAAQA,EAAE,MAAMzZ,EAAE6D,CAAC,CAAC,CAAC,IAAIsH,EAAEsO,EAAE,OAAO,EAAEtO,GAAG,EAAE,EAAEA,EAAE,GAAQsO,EAAE,WAAWtO,CAAC,IAAnB,IAAsB,GAAG,CAACoI,EAAE,CAACvT,EAAEmL,EAAE,EAAE,KAAK,OAAatH,IAAL,KAAS0P,EAAE,GAAM1P,EAAEsH,EAAE,GAAG,OAAatH,IAAL,GAAO,GAAG4V,EAAE,MAAMzZ,EAAE6D,CAAC,CAAC,EAAE,QAAQ,SAAS4V,EAAE,CAAChb,EAAEgb,CAAC,EAAE,QAAQvH,EAAE,GAAG/G,EAAE,EAAEnL,EAAE,GAAG6D,EAAE,GAAK0P,EAAE,EAAEi9B,EAAE/2B,EAAE,OAAO,EAAE+2B,GAAG,EAAE,EAAEA,EAAE,CAAC,IAAIvwC,EAAEwZ,EAAE,WAAW+2B,CAAC,EAAE,GAAQvwC,IAAL,GAAaD,IAAL,KAAS6D,EAAE,GAAM7D,EAAEwwC,EAAE,GAAQvwC,IAAL,GAAYiS,IAAL,GAAOA,EAAEs+B,EAAMj9B,IAAJ,IAAQA,EAAE,GAAQrB,IAAL,KAASqB,EAAE,YAAY,CAAC1P,EAAE,CAACsH,EAAEqlC,EAAE,EAAE,KAAK,CAAC,CAAC,OAAat+B,IAAL,IAAalS,IAAL,IAAYuT,IAAJ,GAAWA,IAAJ,GAAOrB,IAAIlS,EAAE,GAAGkS,IAAI/G,EAAE,EAAE,GAAGsO,EAAE,MAAMvH,EAAElS,CAAC,CAAC,EAAE,OAAO,SAASyZ,EAAE,CAAC,GAAUA,IAAP,MAAoB,OAAOA,GAAjB,SAAmB,MAAM,IAAI,UAAU,mEAAmE,OAAOA,CAAC,EAAE,OAAO,SAASA,EAAEhb,EAAE,CAAC,IAAIyT,EAAEzT,EAAE,KAAKA,EAAE,KAAK0M,EAAE1M,EAAE,OAAOA,EAAE,MAAM,KAAKA,EAAE,KAAK,IAAI,OAAOyT,EAAEA,IAAIzT,EAAE,KAAKyT,EAAE/G,EAAE+G,EAAE,IAAI/G,EAAEA,CAAC,GAAE,EAAEsO,CAAC,CAAC,EAAE,MAAM,SAASA,EAAE,CAAChb,EAAEgb,CAAC,EAAE,IAAIvH,EAAE,CAAC,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,EAAE,EAAE,GAAOuH,EAAE,SAAN,EAAa,OAAOvH,EAAE,IAAI/G,EAAEnL,EAAEyZ,EAAE,WAAW,CAAC,EAAE5V,EAAO7D,IAAL,GAAO6D,GAAGqO,EAAE,KAAK,IAAI/G,EAAE,GAAGA,EAAE,EAAE,QAAQoI,EAAE,GAAGi9B,EAAE,EAAEvwC,EAAE,GAAG85B,EAAE,GAAKrD,EAAEjd,EAAE,OAAO,EAAE4jD,EAAE,EAAE3mC,GAAGvrB,EAAE,EAAEurB,EAAE,IAAS12B,EAAEyZ,EAAE,WAAWid,CAAC,KAAtB,GAA+Bz2B,IAAL,KAAS85B,EAAE,GAAM95B,EAAEy2B,EAAE,GAAQ12B,IAAL,GAAYuT,IAAL,GAAOA,EAAEmjB,EAAM2mC,IAAJ,IAAQA,EAAE,GAAQ9pD,IAAL,KAAS8pD,EAAE,YAAY,CAACtjC,EAAE,CAACyW,EAAE9Z,EAAE,EAAE,KAAK,CAAC,OAAanjB,IAAL,IAAatT,IAAL,IAAYo9D,IAAJ,GAAWA,IAAJ,GAAO9pD,IAAItT,EAAE,GAAGsT,IAAIi9B,EAAE,EAAOvwC,IAAL,KAASiS,EAAE,KAAKA,EAAE,KAASs+B,IAAJ,GAAO3sC,EAAE4V,EAAE,MAAM,EAAExZ,CAAC,EAAEwZ,EAAE,MAAM+2B,EAAEvwC,CAAC,IAAQuwC,IAAJ,GAAO3sC,GAAGqO,EAAE,KAAKuH,EAAE,MAAM,EAAElG,CAAC,EAAErB,EAAE,KAAKuH,EAAE,MAAM,EAAExZ,CAAC,IAAIiS,EAAE,KAAKuH,EAAE,MAAM+2B,EAAEj9B,CAAC,EAAErB,EAAE,KAAKuH,EAAE,MAAM+2B,EAAEvwC,CAAC,GAAGiS,EAAE,IAAIuH,EAAE,MAAMlG,EAAEtT,CAAC,GAAGuwC,EAAE,EAAEt+B,EAAE,IAAIuH,EAAE,MAAM,EAAE+2B,EAAE,CAAC,EAAE3sC,IAAIqO,EAAE,IAAI,KAAKA,CAAC,EAAE,IAAI,IAAI,UAAU,IAAI,MAAM,KAAK,MAAM,IAAI,EAAE/G,EAAE,MAAMA,EAAEsO,EAAE,QAAQtO,CAAE,CAAC,EAAE,EAAE,CAAA,EAAG,SAAS+G,EAAE/G,EAAE,CAAC,IAAInL,EAAE,EAAEmL,CAAC,EAAE,GAAYnL,IAAT,OAAW,OAAOA,EAAE,QAAQ,IAAI6D,EAAE,EAAEsH,CAAC,EAAE,CAAC,QAAQ,CAAA,CAAE,EAAE,OAAO,EAAEA,CAAC,EAAEtH,EAAEA,EAAE,QAAQqO,CAAC,EAAErO,EAAE,OAAO,CAACqO,EAAE,EAAE,CAACuH,EAAEhb,IAAI,CAAC,QAAQ0M,KAAK1M,EAAEyT,EAAE,EAAEzT,EAAE0M,CAAC,GAAG,CAAC+G,EAAE,EAAEuH,EAAEtO,CAAC,GAAG,OAAO,eAAesO,EAAEtO,EAAE,CAAC,WAAW,GAAK,IAAI1M,EAAE0M,CAAC,CAAC,CAAC,CAAE,EAAE+G,EAAE,EAAE,CAACuH,EAAEhb,IAAI,OAAO,UAAU,eAAe,KAAKgb,EAAEhb,CAAC,EAAEyT,EAAE,EAAEuH,GAAG,CAAc,OAAO,OAApB,KAA4B,OAAO,aAAa,OAAO,eAAeA,EAAE,OAAO,YAAY,CAAC,MAAM,QAAQ,CAAC,EAAE,OAAO,eAAeA,EAAE,aAAa,CAAC,MAAM,EAAI,CAAC,CAAE,EAAE,IAAItO,EAAE,CAAA,GAAI,IAAI,CAAC,IAAIsO,EAAKvH,EAAE,EAAE/G,CAAC,EAAE+G,EAAE,EAAE/G,EAAE,CAAC,IAAI,IAAIurB,EAAE,MAAM,IAAI4mC,CAAC,CAAC,EAAY,OAAO,SAAjB,SAAyB7jD,EAAY,QAAQ,WAAlB,QAA6C,OAAO,WAAjB,WAAsDA,EAApB,UAAU,UAAc,QAAQ,SAAS,GAAG,GAAG,MAAMhb,EAAE,iBAAiBuB,EAAE,MAAM,EAAE,QAAQ,SAASuT,EAAEkG,EAAEvH,EAAE,CAAC,GAAG,CAACuH,EAAE,QAAQvH,EAAE,MAAM,IAAI,MAAM,2DAA2DuH,EAAE,SAAS,aAAaA,EAAE,IAAI,cAAcA,EAAE,KAAK,iBAAiBA,EAAE,QAAQ,IAAI,EAAE,GAAGA,EAAE,QAAQ,CAAChb,EAAE,KAAKgb,EAAE,MAAM,EAAE,MAAM,IAAI,MAAM,iDAAiD,EAAE,GAAGA,EAAE,MAAK,GAAGA,EAAE,WAAW,GAAG,CAACzZ,EAAE,KAAKyZ,EAAE,IAAI,EAAE,MAAM,IAAI,MAAM,0IAA0I,UAAU,EAAE,KAAKA,EAAE,IAAI,EAAE,MAAM,IAAI,MAAM,2HAA2H,EAAC,CAAC,MAAM+2B,EAAE,GAAGvwC,EAAE,IAAI85B,EAAE,+DAA+D,MAAMrD,CAAC,CAAC,OAAO,MAAMjd,EAAE,CAAC,OAAOA,aAAaid,GAAG,CAAC,CAACjd,GAAa,OAAOA,EAAE,WAAnB,UAAwC,OAAOA,EAAE,UAAnB,UAAuC,OAAOA,EAAE,MAAnB,UAAmC,OAAOA,EAAE,OAAnB,UAAoC,OAAOA,EAAE,QAAnB,UAAqC,OAAOA,EAAE,QAAnB,UAAuC,OAAOA,EAAE,MAArB,YAAuC,OAAOA,EAAE,UAArB,UAA6B,CAAC,OAAO,UAAU,KAAK,MAAM,SAAS,YAAYA,EAAEhb,EAAEyT,EAAE/G,EAAEnL,EAAE6D,EAAE,GAAM,CAAW,OAAO4V,GAAjB,UAAoB,KAAK,OAAOA,EAAE,QAAQ+2B,EAAE,KAAK,UAAU/2B,EAAE,WAAW+2B,EAAE,KAAK,KAAK/2B,EAAE,MAAM+2B,EAAE,KAAK,MAAM/2B,EAAE,OAAO+2B,EAAE,KAAK,SAAS/2B,EAAE,UAAU+2B,IAAI,KAAK,QAAO,SAAS/2B,EAAEhb,EAAE,CAAC,OAAOgb,GAAGhb,EAAEgb,EAAE,MAAM,GAAEA,EAAE5V,CAAC,EAAE,KAAK,UAAUpF,GAAG+xC,EAAE,KAAK,MAAK,SAAS/2B,EAAEhb,EAAE,CAAC,OAAOgb,GAAG,IAAK,QAAQ,IAAK,OAAO,IAAK,OAAOhb,EAAEA,EAAE,CAAC,IAAIwB,IAAIxB,EAAEwB,EAAExB,GAAGA,EAAEwB,CAAE,CAAC,OAAOxB,CAAC,GAAE,KAAK,OAAOyT,GAAGs+B,CAAC,EAAE,KAAK,MAAMrlC,GAAGqlC,EAAE,KAAK,SAASxwC,GAAGwwC,EAAEj9B,EAAE,KAAK1P,CAAC,EAAG,CAAC,IAAI,QAAQ,CAAC,OAAO+uB,EAAE,IAAI,CAAC,CAAC,KAAKnZ,EAAE,CAAC,GAAG,CAACA,EAAE,OAAO,KAAK,GAAG,CAAC,OAAOhb,EAAE,UAAUyT,EAAE,KAAK/G,EAAE,MAAMnL,EAAE,SAAS6D,CAAC,EAAE4V,EAAE,OAAgBhb,IAAT,OAAWA,EAAE,KAAK,OAAcA,IAAP,OAAWA,EAAE+xC,GAAYt+B,IAAT,OAAWA,EAAE,KAAK,UAAiBA,IAAP,OAAWA,EAAEs+B,GAAYrlC,IAAT,OAAWA,EAAE,KAAK,KAAYA,IAAP,OAAWA,EAAEqlC,GAAYxwC,IAAT,OAAWA,EAAE,KAAK,MAAaA,IAAP,OAAWA,EAAEwwC,GAAY3sC,IAAT,OAAWA,EAAE,KAAK,SAAgBA,IAAP,OAAWA,EAAE2sC,GAAG/xC,IAAI,KAAK,QAAQyT,IAAI,KAAK,WAAW/G,IAAI,KAAK,MAAMnL,IAAI,KAAK,OAAO6D,IAAI,KAAK,SAAS,KAAK,IAAIsM,EAAE1R,EAAEyT,EAAE/G,EAAEnL,EAAE6D,CAAC,CAAC,CAAC,OAAO,MAAM4V,EAAEhb,EAAE,GAAM,CAAC,MAAMyT,EAAE6nB,EAAE,KAAKtgB,CAAC,EAAE,OAAOvH,EAAE,IAAI/B,EAAE+B,EAAE,CAAC,GAAGs+B,EAAE+sB,EAAErrD,EAAE,CAAC,GAAGs+B,CAAC,EAAE+sB,EAAErrD,EAAE,CAAC,GAAGs+B,CAAC,EAAE+sB,EAAErrD,EAAE,CAAC,GAAGs+B,CAAC,EAAE+sB,EAAErrD,EAAE,CAAC,GAAGs+B,CAAC,EAAE/xC,CAAC,EAAE,IAAI0R,EAAEqgC,EAAEA,EAAEA,EAAEA,EAAEA,CAAC,CAAC,CAAC,OAAO,KAAK/xC,EAAE,CAAC,IAAIyT,EAAEs+B,EAAE,GAAG/2B,IAAIhb,EAAEA,EAAE,QAAQ,MAAMwB,CAAC,GAAGxB,EAAE,CAAC,IAAIwB,GAAGxB,EAAE,CAAC,IAAIwB,EAAE,CAAC,MAAMwZ,EAAEhb,EAAE,QAAQwB,EAAE,CAAC,EAAOwZ,IAAL,IAAQvH,EAAEzT,EAAE,UAAU,CAAC,EAAEA,EAAEwB,IAAIiS,EAAEzT,EAAE,UAAU,EAAEgb,CAAC,EAAEhb,EAAEA,EAAE,UAAUgb,CAAC,GAAGxZ,EAAG,CAAC,OAAO,IAAIkQ,EAAE,OAAO+B,EAAEzT,EAAE+xC,EAAEA,CAAC,CAAC,CAAC,OAAO,KAAK/2B,EAAE,CAAC,MAAMhb,EAAE,IAAI0R,EAAEsJ,EAAE,OAAOA,EAAE,UAAUA,EAAE,KAAKA,EAAE,MAAMA,EAAE,QAAQ,EAAE,OAAOlG,EAAE9U,EAAE,EAAI,EAAEA,CAAC,CAAC,SAASgb,EAAE,GAAM,CAAC,OAAO2pB,EAAE,KAAK3pB,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,OAAO,OAAOA,EAAE,CAAC,GAAGA,EAAE,CAAC,GAAGA,aAAaid,EAAE,OAAOjd,EAAE,CAAC,MAAMhb,EAAE,IAAI0R,EAAEsJ,CAAC,EAAE,OAAOhb,EAAE,WAAWgb,EAAE,SAAShb,EAAE,QAAQgb,EAAE,OAAO4jD,EAAE5jD,EAAE,OAAO,KAAKhb,CAAC,CAAC,CAAC,OAAOgb,CAAC,CAAC,CAAC,MAAM4jD,EAAE5jD,EAAE,EAAE,OAAO,MAAMtJ,UAAUumB,CAAC,CAAC,WAAW,KAAK,QAAQ,KAAK,IAAI,QAAQ,CAAC,OAAO,KAAK,UAAU,KAAK,QAAQ9D,EAAE,IAAI,GAAG,KAAK,OAAO,CAAC,SAASnZ,EAAE,GAAM,CAAC,OAAOA,EAAE2pB,EAAE,KAAK,EAAI,GAAG,KAAK,aAAa,KAAK,WAAWA,EAAE,KAAK,EAAK,GAAG,KAAK,WAAW,CAAC,QAAQ,CAAC,MAAM3pB,EAAE,CAAC,KAAK,CAAC,EAAE,OAAO,KAAK,UAAUA,EAAE,OAAO,KAAK,QAAQA,EAAE,KAAK4jD,GAAG,KAAK,aAAa5jD,EAAE,SAAS,KAAK,YAAY,KAAK,OAAOA,EAAE,KAAK,KAAK,MAAM,KAAK,SAASA,EAAE,OAAO,KAAK,QAAQ,KAAK,YAAYA,EAAE,UAAU,KAAK,WAAW,KAAK,QAAQA,EAAE,MAAM,KAAK,OAAO,KAAK,WAAWA,EAAE,SAAS,KAAK,UAAUA,CAAC,CAAC,CAAC,MAAMgkB,EAAE,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK,EAAE,SAASl6B,EAAEkW,EAAEhb,EAAEyT,EAAE,CAAC,IAAI/G,EAAEnL,EAAE,GAAG,QAAQ6D,EAAE,EAAEA,EAAE4V,EAAE,OAAO5V,IAAI,CAAC,MAAM0P,EAAEkG,EAAE,WAAW5V,CAAC,EAAE,GAAG0P,GAAG,IAAIA,GAAG,KAAKA,GAAG,IAAIA,GAAG,IAAIA,GAAG,IAAIA,GAAG,IAASA,IAAL,IAAaA,IAAL,IAAaA,IAAL,IAAcA,IAAN,KAAS9U,GAAQ8U,IAAL,IAAQrB,GAAQqB,IAAL,IAAQrB,GAAQqB,IAAL,IAAQrB,GAAQqB,IAAL,GAAavT,IAAL,KAASmL,GAAG,mBAAmBsO,EAAE,UAAUzZ,EAAE6D,CAAC,CAAC,EAAE7D,EAAE,IAAamL,IAAT,SAAaA,GAAGsO,EAAE,OAAO5V,CAAC,OAAQ,CAAWsH,IAAT,SAAaA,EAAEsO,EAAE,OAAO,EAAE5V,CAAC,GAAG,MAAMpF,EAAEg/B,EAAElqB,CAAC,EAAW9U,IAAT,QAAiBuB,IAAL,KAASmL,GAAG,mBAAmBsO,EAAE,UAAUzZ,EAAE6D,CAAC,CAAC,EAAE7D,EAAE,IAAImL,GAAG1M,GAAQuB,IAAL,KAASA,EAAE6D,EAAG,CAAC,CAAC,OAAa7D,IAAL,KAASmL,GAAG,mBAAmBsO,EAAE,UAAUzZ,CAAC,CAAC,GAAYmL,IAAT,OAAWA,EAAEsO,CAAC,CAAC,SAASm3B,EAAEn3B,EAAE,CAAC,IAAIhb,EAAE,QAAQyT,EAAE,EAAEA,EAAEuH,EAAE,OAAOvH,IAAI,CAAC,MAAM/G,EAAEsO,EAAE,WAAWvH,CAAC,EAAO/G,IAAL,IAAaA,IAAL,IAAiB1M,IAAT,SAAaA,EAAEgb,EAAE,OAAO,EAAEvH,CAAC,GAAGzT,GAAGg/B,EAAEtyB,CAAC,GAAY1M,IAAT,SAAaA,GAAGgb,EAAEvH,CAAC,EAAG,CAAC,OAAgBzT,IAAT,OAAWA,EAAEgb,CAAC,CAAC,SAASmZ,EAAEn0B,EAAEyT,EAAE,CAAC,IAAI/G,EAAE,OAAOA,EAAE1M,EAAE,WAAWA,EAAE,KAAK,OAAO,GAAYA,EAAE,SAAX,OAAkB,KAAKA,EAAE,SAAS,GAAGA,EAAE,IAAI,GAAQA,EAAE,KAAK,WAAW,CAAC,IAAxB,KAA4BA,EAAE,KAAK,WAAW,CAAC,GAAG,IAAIA,EAAE,KAAK,WAAW,CAAC,GAAG,IAAIA,EAAE,KAAK,WAAW,CAAC,GAAG,IAAIA,EAAE,KAAK,WAAW,CAAC,GAAG,MAAWA,EAAE,KAAK,WAAW,CAAC,IAAxB,GAA0BA,EAAE,KAAK,CAAC,EAAE,cAAcA,EAAE,KAAK,OAAO,CAAC,EAAEA,EAAE,KAAKgb,IAAItO,EAAEA,EAAE,QAAQ,MAAM,IAAI,GAAGA,CAAC,CAAC,SAASi4B,EAAE3pB,EAAEhb,EAAE,CAAC,MAAMyT,EAAEzT,EAAEmyC,EAAErtC,EAAE,IAAI4H,EAAE,GAAG,CAAC,OAAOnL,EAAE,UAAU6D,EAAE,KAAK0P,EAAE,MAAMi9B,EAAE,SAASzW,CAAC,EAAEtgB,EAAE,GAAGzZ,IAAImL,GAAGnL,EAAEmL,GAAG,MAAMtH,GAAY7D,IAAT,UAAcmL,GAAGlL,EAAEkL,GAAGlL,GAAG4D,EAAE,CAAC,IAAI4V,EAAE5V,EAAE,QAAQ,GAAG,EAAE,GAAQ4V,IAAL,GAAO,CAAC,MAAMhb,GAAEoF,EAAE,OAAO,EAAE4V,CAAC,EAAE5V,EAAEA,EAAE,OAAO4V,EAAE,CAAC,EAAEA,EAAEhb,GAAE,YAAY,GAAG,EAAOgb,IAAL,GAAOtO,GAAG+G,EAAEzT,GAAE,GAAM,EAAK,GAAG0M,GAAG+G,EAAEzT,GAAE,OAAO,EAAEgb,CAAC,EAAE,GAAM,EAAK,EAAEtO,GAAG,IAAIA,GAAG+G,EAAEzT,GAAE,OAAOgb,EAAE,CAAC,EAAE,GAAM,EAAI,GAAGtO,GAAG,GAAI,CAACtH,EAAEA,EAAE,cAAc4V,EAAE5V,EAAE,YAAY,GAAG,EAAO4V,IAAL,GAAOtO,GAAG+G,EAAErO,EAAE,GAAM,EAAI,GAAGsH,GAAG+G,EAAErO,EAAE,OAAO,EAAE4V,CAAC,EAAE,GAAM,EAAI,EAAEtO,GAAGtH,EAAE,OAAO4V,CAAC,EAAG,CAAC,GAAGlG,EAAE,CAAC,GAAGA,EAAE,QAAQ,GAAQA,EAAE,WAAW,CAAC,IAAnB,IAA2BA,EAAE,WAAW,CAAC,IAAnB,GAAqB,CAAC,MAAMkG,EAAElG,EAAE,WAAW,CAAC,EAAEkG,GAAG,IAAIA,GAAG,KAAKlG,EAAE,IAAI,OAAO,aAAakG,EAAE,EAAE,CAAC,IAAIlG,EAAE,OAAO,CAAC,CAAC,GAAI,SAASA,EAAE,QAAQ,GAAQA,EAAE,WAAW,CAAC,IAAnB,GAAqB,CAAC,MAAMkG,EAAElG,EAAE,WAAW,CAAC,EAAEkG,GAAG,IAAIA,GAAG,KAAKlG,EAAE,GAAG,OAAO,aAAakG,EAAE,EAAE,CAAC,IAAIlG,EAAE,OAAO,CAAC,CAAC,GAAI,CAACpI,GAAG+G,EAAEqB,EAAE,GAAK,EAAK,CAAE,CAAC,OAAOi9B,IAAIrlC,GAAG,IAAIA,GAAG+G,EAAEs+B,EAAE,GAAM,EAAK,GAAGzW,IAAI5uB,GAAG,IAAIA,GAAG1M,EAAEs7B,EAAEx2B,EAAEw2B,EAAE,GAAM,EAAK,GAAG5uB,CAAC,CAAC,SAASjD,EAAEuR,EAAE,CAAC,GAAG,CAAC,OAAO,mBAAmBA,CAAC,CAAC,MAAM,CAAC,OAAOA,EAAE,OAAO,EAAEA,EAAE,OAAO,EAAE,CAAC,EAAEvR,EAAEuR,EAAE,OAAO,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,MAAMvZ,EAAE,8BAA8B,SAASq9D,EAAE9jD,EAAE,CAAC,OAAOA,EAAE,MAAMvZ,CAAC,EAAEuZ,EAAE,QAAQvZ,GAAGuZ,GAAGvR,EAAEuR,CAAC,EAAC,EAAGA,CAAC,CAAC,IAAImiD,EAAE1pD,EAAE,GAAG,EAAE,MAAMg6B,EAAE0vB,EAAE,OAAOA,EAAEz4B,EAAE,IAAI,IAAIm6B,GAAG,SAAS7jD,EAAE,CAACA,EAAE,SAAS,SAASA,KAAKhb,EAAE,CAAC,OAAOgb,EAAE,KAAK,CAAC,KAAKyyB,EAAE,KAAKzyB,EAAE,KAAK,GAAGhb,CAAC,CAAC,CAAC,CAAC,EAAEgb,EAAE,YAAY,SAASA,KAAKhb,EAAE,CAAC,IAAIyT,EAAEuH,EAAE,KAAKtO,EAAE,GAAM+G,EAAE,CAAC,IAAIixB,IAAIjxB,EAAEixB,EAAEjxB,EAAE/G,EAAE,IAAM,IAAInL,EAAEksC,EAAE,QAAQh6B,EAAE,GAAGzT,CAAC,EAAE,OAAO0M,GAAGnL,EAAE,CAAC,IAAImjC,GAAG,CAAC1pB,EAAE,YAAYzZ,EAAEA,EAAE,UAAU,CAAC,GAAGyZ,EAAE,KAAK,CAAC,KAAKzZ,CAAC,CAAC,CAAC,EAAEyZ,EAAE,QAAQ,SAASA,EAAE,CAAC,GAAOA,EAAE,KAAK,SAAX,GAAmBA,EAAE,OAAO0pB,EAAE,OAAO1pB,EAAE,IAAIhb,EAAEytC,EAAE,QAAQzyB,EAAE,IAAI,EAAE,OAAWhb,EAAE,SAAN,GAAmBA,EAAE,WAAW,CAAC,IAAnB,KAAuBA,EAAE,IAAIgb,EAAE,KAAK,CAAC,KAAKhb,CAAC,CAAC,CAAC,EAAEgb,EAAE,SAAS,SAASA,EAAE,CAAC,OAAOyyB,EAAE,SAASzyB,EAAE,IAAI,CAAC,EAAEA,EAAE,QAAQ,SAASA,EAAE,CAAC,OAAOyyB,EAAE,QAAQzyB,EAAE,IAAI,CAAC,CAAE,GAAE6jD,IAAIA,EAAE,GAAG,CAAE,KAAKF,GAAIjyD,CAAE,GAAC,EAAI,KAAM,CAAC,IAAA+d,GAAI,MAAAs0C,EAAK,EAAEJ,GCK5jV,SAASK,GAAYC,EAAM/8B,EAAM,CAC7B,GAAI,OAAO+8B,GAAS,SAChB,MAAM,IAAI,UAAU,mBAAmB,EAE3C,MAAMt9D,EAAM,OAAOs9D,CAAI,EAEvB,IAAIC,EAAQ,GAIZ,MAAMC,EAAW,EAAAj9B,EAUXk9B,EAAW,EAAAl9B,EAGjB,IAAIm9B,EAAU,GAEd,MAAM3qC,EAAQwN,GAAQ,OAAQA,EAAK,OAAW,SAAWA,EAAK,MAAQ,GACtE,IAAI5G,EACJ,QAAS/5B,EAAI,EAAGmN,EAAM/M,EAAI,OAAQJ,EAAImN,EAAKnN,IAEvC,OADA+5B,EAAI35B,EAAIJ,CAAC,EACD+5B,EAAC,CACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACD4jC,GAAS,KAAO5jC,EAChB,MACJ,IAAK,IACD,GAAI6jC,EAAU,CACVD,GAAS,IACT,KACJ,CACJ,IAAK,IACL,IAAK,IACD,GAAIC,EAAU,CACVD,GAAS5jC,EACT,KACJ,CACJ,IAAK,IACD,GAAI6jC,EAAU,CACVE,EAAU,GACVH,GAAS,IACT,KACJ,CACJ,IAAK,IACD,GAAIC,EAAU,CACVE,EAAU,GACVH,GAAS,IACT,KACJ,CACJ,IAAK,IACD,GAAIG,EAAS,CACTH,GAAS,IACT,KACJ,CACAA,GAAS,KAAO5jC,EAChB,MACJ,IAAK,IAGD,MAAMgkC,EAAW39D,EAAIJ,EAAI,CAAC,EAC1B,IAAIg+D,EAAY,EAChB,KAAO59D,EAAIJ,EAAI,CAAC,IAAM,KAClBg+D,IACAh+D,IAEJ,MAAMi+D,EAAW79D,EAAIJ,EAAI,CAAC,EACrB69D,EAMkBG,EAAY,IACvBD,IAAa,KAAOA,IAAa,QAAaA,IAAa,KAAOA,IAAa,OAC/EE,IAAa,KAAOA,IAAa,QAAaA,IAAa,KAAOA,IAAa,MAE/EA,IAAa,IACbj+D,IAEK+9D,IAAa,KAAOJ,EAAM,SAAS,KAAK,IAC7CA,EAAQA,EAAM,OAAO,EAAGA,EAAM,OAAS,CAAC,GAG5CA,GAAS,uBAITA,GAAS,UAnBbA,GAAS,KAsBb,MACJ,QACIA,GAAS5jC,CACzB,CAII,OAAI,CAAC5G,GAAS,CAAC,CAACA,EAAM,QAAQ,GAAG,KAC7BwqC,EAAQ,IAAMA,EAAQ,KAEnB,IAAI,OAAOA,EAAOxqC,CAAK,CAClC,CC9GA,MAAM+qC,GAAO,IACPC,GAAW,IACjB,MAAMC,EAAuB,CACzB,YAAYja,EAASka,EAAWC,EAAM,CAClC,KAAK,UAAYD,EACjB,KAAK,KAAOC,EACZ,KAAK,aAAe,CAAA,EACpB,GAAI,CACA,QAASC,KAAiBpa,EAAS,CAC/B,MAAMqa,EAAUD,EAAc,CAAC,IAAML,GAChCM,IACDD,EAAgBA,EAAc,UAAU,CAAC,GAEzCA,EAAc,OAAS,IACnBA,EAAc,CAAC,IAAMJ,KACrBI,EAAgBA,EAAc,UAAU,CAAC,GAE7C,KAAK,aAAa,KAAK,CACnB,OAAQd,GAAY,MAAQc,EAAe,CAAE,SAAU,GAAM,SAAU,GAAM,EAC7E,QAASC,CACjC,CAAqB,EAET,CAEIH,IACAA,EAAYI,GAA6BJ,CAAS,EAC7CA,EAAU,SAAS,GAAG,IACvBA,EAAYA,EAAY,KAE5B,KAAK,UAAYA,EAEzB,MACU,CACN,KAAK,aAAa,OAAS,EAC3B,KAAK,KAAO,CAAA,CAChB,CACJ,CACA,eAAeK,EAAU,CACrB,GAAI,KAAK,WAAa,CAACA,EAAS,WAAW,KAAK,SAAS,EACrD,MAAO,GAEX,IAAIhzD,EAAQ,GACZ,SAAW,CAAE,OAAAwC,EAAQ,QAAAswD,CAAO,IAAM,KAAK,aAC/BtwD,EAAO,KAAKwwD,CAAQ,IACpBhzD,EAAQ8yD,GAGhB,OAAO9yD,CACX,CACA,SAAU,CACN,OAAO,KAAK,IAChB,CACJ,CACA,MAAMizD,EAAa,CACf,YAAYC,EAASh1C,EAAKi1C,EAAyB,CAC/C,KAAK,QAAUD,EACf,KAAK,IAAMh1C,EACX,KAAK,aAAe,IAAI,IACxB,KAAK,QAAU,OACXi1C,IACA,KAAK,iBAAmB,KAAK,QAAQ,QAAQ,QAAQ,IAAIC,GAAiBD,CAAuB,CAAC,EAE1G,CACA,qBAAsB,CAClB,OAAK,KAAK,mBACN,KAAK,iBAAmB,KAAK,QAAQ,WAAW,KAAK,GAAG,GAErD,KAAK,gBAChB,CACA,mBAAoB,CAChB,OAAK,KAAK,iBACN,KAAK,eAAiB,KAAK,oBAAmB,EAAG,KAAKE,GAC3C,KAAK,QAAQ,qBAAqBA,EAAY,IAAI,CAC5D,GAEE,KAAK,cAChB,CACA,aAAc,CACV,MAAMC,EAAa,CAAC,CAAC,KAAK,iBAC1B,YAAK,eAAiB,OACtB,KAAK,iBAAmB,OACxB,KAAK,aAAa,MAAK,EACvB,KAAK,QAAU,OACRA,CACX,CACJ,CACA,MAAMF,EAAiB,CACnB,YAAY7P,EAAQ3rD,EAAS,GAAI,CAC7B,KAAK,OAAS2rD,EACd,KAAK,OAAS3rD,CAClB,CACJ,CACA,MAAM27D,EAAe,CACjB,YAAYhQ,EAAQ3rD,EAAS,CAAA,EAAI47D,EAAW,CAAA,EAAI7P,EAAa,CACzD,KAAK,OAASJ,EACd,KAAK,OAAS3rD,EACd,KAAK,SAAW47D,EAChB,KAAK,YAAc7P,CACvB,CACA,WAAWpqC,EAAM,CACb,MAAMq2C,EAAY,KAAK,oBAAoBr2C,EAAM,KAAK,MAAM,EAC5D,GAAIq2C,EACA,OAAOtM,GAASsM,CAAS,CAGjC,CACA,oBAAoBr2C,EAAMgqC,EAAQ,CAC9B,GAAI,CAACA,GAAU,OAAOA,GAAW,WAAahqC,EAAK,SAAW,EAC1D,OAAOgqC,EAEX,MAAMnsD,EAAOmiB,EAAK,MAAK,EACvB,GAAIgqC,EAAO,YAAc,OAAOA,EAAO,WAAWnsD,CAAI,EAClD,OAAO,KAAK,oBAAoBmiB,EAAMgqC,EAAO,WAAWnsD,CAAI,CAAC,EAE5D,GAAImsD,EAAO,mBACZ,UAAW9K,KAAW,OAAO,KAAK8K,EAAO,iBAAiB,EAEtD,GADc/K,GAAeC,CAAO,GACzB,KAAKrhD,CAAI,EAChB,OAAO,KAAK,oBAAoBmiB,EAAMgqC,EAAO,kBAAkB9K,CAAO,CAAC,MAI9E,IAAI,OAAO8K,EAAO,sBAAyB,SAC5C,OAAO,KAAK,oBAAoBhqC,EAAMgqC,EAAO,oBAAoB,EAEhE,GAAInsD,EAAK,MAAM,QAAQ,GACxB,GAAI,MAAM,QAAQmsD,EAAO,KAAK,EAAG,CAC7B,MAAMrtD,EAAQ,SAASkB,EAAM,EAAE,EAC/B,GAAI,CAAC,MAAMlB,CAAK,GAAKqtD,EAAO,MAAMrtD,CAAK,EACnC,OAAO,KAAK,oBAAoBqjB,EAAMgqC,EAAO,MAAMrtD,CAAK,CAAC,CAEjE,SACSqtD,EAAO,MACZ,OAAO,KAAK,oBAAoBhqC,EAAMgqC,EAAO,KAAK,GAI9D,CACJ,CACA,MAAMkQ,EAAkB,CACpB,YAAYC,EAAgBC,EAAgB9I,EAAoB,CAC5D,KAAK,eAAiB8I,EACtB,KAAK,eAAiBD,EACtB,KAAK,mBAAqB7I,GAAsB,QAChD,KAAK,cAAgB,CAAA,EACrB,KAAK,oBAAsB,CAAA,EAC3B,KAAK,yBAA2B,CAAA,EAChC,KAAK,YAAc,CAAA,EACnB,KAAK,wBAA0B,CAAA,EAC/B,KAAK,qBAAuB,CAAA,CAChC,CACA,uBAAuB90D,EAAQ,CAC3B,OAAO,OAAO,KAAK,KAAK,oBAAoB,EAAE,OAAO6G,GAAM,CACvD,MAAMugB,EAASK,GAAI,MAAM5gB,CAAE,EAAE,OAC7B,OAAOugB,IAAW,kBAAoB,CAACpnB,GAAUA,EAAOonB,CAAM,EAClE,CAAC,CACL,CACA,IAAI,SAAU,CACV,OAAO,KAAK,kBAChB,CACA,SAAU,CACN,KAAO,KAAK,cAAc,OAAS,GAC/B,KAAK,cAAc,MAAK,CAEhC,CACA,iBAAiBe,EAAK,CAElB,KAAK,wBAA0B,OAC/B,IAAIo1C,EAAa,GACjBp1C,EAAM01C,GAAY11C,CAAG,EACrB,MAAM21C,EAAS,CAAC31C,CAAG,EACb+uB,EAAM,OAAO,KAAK,KAAK,WAAW,EAAE,IAAI/qC,GAAO,KAAK,YAAYA,CAAG,CAAC,EAC1E,KAAO2xD,EAAO,QAAQ,CAClB,MAAMC,EAAOD,EAAO,IAAG,EACvB,QAASv/D,EAAI,EAAGA,EAAI24C,EAAI,OAAQ34C,IAAK,CACjC,MAAM2G,EAASgyC,EAAI34C,CAAC,EAChB2G,IAAWA,EAAO,MAAQ64D,GAAQ74D,EAAO,aAAa,IAAI64D,CAAI,KAC1D74D,EAAO,MAAQ64D,GACfD,EAAO,KAAK54D,EAAO,GAAG,EAEtBA,EAAO,gBACPq4D,EAAa,IAEjBrmB,EAAI34C,CAAC,EAAI,OAEjB,CACJ,CACA,OAAOg/D,CACX,CACA,uBAAuBhC,EAAqB,CACxC,GAAIA,EAAoB,QAAS,CAC7B,MAAMyC,EAAUzC,EAAoB,QACpC,UAAW10D,KAAMm3D,EAAS,CACtB,MAAMC,EAAeJ,GAAYh3D,CAAE,EACnC,KAAK,oBAAoBo3D,CAAY,EAAI,KAAK,gBAAgBA,EAAcD,EAAQn3D,CAAE,CAAC,CAC3F,CACJ,CACA,GAAI,MAAM,QAAQ00D,EAAoB,kBAAkB,EAAG,CACvD,MAAM2C,EAAqB3C,EAAoB,mBAC/C,QAAS4C,KAAqBD,EAAoB,CAC9C,MAAMrB,EAAOsB,EAAkB,KAAK,IAAIN,EAAW,EAC7CO,EAAc,KAAK,0BAA0BD,EAAkB,QAASA,EAAkB,UAAWtB,CAAI,EAC/G,KAAK,yBAAyB,KAAKuB,CAAW,CAClD,CACJ,CACJ,CACA,gBAAgBv3D,EAAIu2D,EAAyB,CACzC,MAAMiB,EAAe,IAAInB,GAAa,KAAMr2D,EAAIu2D,CAAuB,EACvE,YAAK,YAAYv2D,CAAE,EAAIw3D,EAChBA,CACX,CACA,qBAAqBx3D,EAAIu2D,EAAyB,CAC9C,OAAO,KAAK,YAAYv2D,CAAE,GAAK,KAAK,gBAAgBA,EAAIu2D,CAAuB,CACnF,CACA,0BAA0B1a,EAASka,EAAWC,EAAM,CAChD,MAAMyB,EAAM,IAAI3B,GAAuBja,EAASka,EAAWC,CAAI,EAC/D,YAAK,wBAAwB,KAAKyB,CAAG,EAC9BA,CACX,CACA,uBAAuBxsC,EAAQ,CAC3B,MAAMjrB,EAAKg3D,GAAY/rC,EAAO,GAAG,EACjC,YAAK,qBAAqBjrB,CAAE,EAAI,GAChC,KAAK,wBAA0B,OAC3BirB,EAAO,WAAaA,EAAO,UAAU,QACrC,KAAK,0BAA0BA,EAAO,UAAWA,EAAO,UAAW,CAACjrB,CAAE,CAAC,EAEpEirB,EAAO,OAAS,KAAK,gBAAgBjrB,EAAIirB,EAAO,MAAM,EAAI,KAAK,qBAAqBjrB,CAAE,CACjG,CACA,sBAAuB,CACnB,KAAK,YAAc,CAAA,EACnB,KAAK,wBAA0B,CAAA,EAC/B,KAAK,qBAAuB,CAAA,EAC5B,KAAK,wBAA0B,OAC/B,UAAWA,KAAM,KAAK,oBAClB,KAAK,YAAYA,CAAE,EAAI,KAAK,oBAAoBA,CAAE,EAClD,KAAK,qBAAqBA,CAAE,EAAI,GAEpC,UAAW03D,KAA2B,KAAK,yBACvC,KAAK,wBAAwB,KAAKA,CAAuB,CAEjE,CACA,kBAAkBpP,EAAU,CACxB,MAAMtoD,EAAKg3D,GAAY1O,CAAQ,EACzBkP,EAAe,KAAK,YAAYx3D,CAAE,EACxC,OAAIw3D,EACOA,EAAa,kBAAiB,EAElC,KAAK,QAAQ,QAAQ,MAAS,CACzC,CACA,WAAWjmB,EAAK,CACZ,GAAI,CAAC,KAAK,eAAgB,CACtB,MAAMsZ,EAAe15C,EAAE,wEAA2EwmD,GAAgBpmB,CAAG,CAAC,EACtH,OAAO,KAAK,QAAQ,QAAQ,IAAIilB,GAAiB,GAAI,CAAC3L,CAAY,CAAC,CAAC,CACxE,CACA,OAAItZ,EAAI,WAAW,yBAAyB,IACxCA,EAAM,QAAUA,EAAI,UAAU,CAAC,GAE5B,KAAK,eAAeA,CAAG,EAAE,KAAK9c,GAAW,CAC5C,GAAI,CAACA,EAAS,CACV,MAAMo2B,EAAe15C,EAAE,gDAAmDwmD,GAAgBpmB,CAAG,CAAC,EAC9F,OAAO,IAAIilB,GAAiB,GAAI,CAAC3L,CAAY,CAAC,CAClD,CACA,MAAM7vD,EAAS,CAAA,EACXy5B,EAAQ,WAAW,CAAC,IAAM,QAC1Bz5B,EAAO,KAAKmW,EAAE,sFAAyFwmD,GAAgBpmB,CAAG,CAAC,CAAC,EAC5H9c,EAAUA,EAAQ,UAAS,GAE/B,IAAImjC,EAAgB,CAAA,EACpB,MAAMC,EAAa,CAAA,EACnB,OAAAD,EAAgBjtB,GAAMlW,EAASojC,CAAU,EACrCA,EAAW,QACX78D,EAAO,KAAKmW,EAAE,iEAAoEwmD,GAAgBpmB,CAAG,EAAGsmB,EAAW,CAAC,EAAE,MAAM,CAAC,EAE1H,IAAIrB,GAAiBoB,EAAe58D,CAAM,CACrD,EAAI1E,GAAU,CACV,IAAIu0D,EAAev0D,EAAM,SAAQ,EACjC,MAAMwhE,EAAaxhE,EAAM,SAAQ,EAAG,MAAM,SAAS,EACnD,OAAIwhE,EAAW,OAAS,IAEpBjN,EAAeiN,EAAW,CAAC,GAE3Bnc,GAASkP,EAAc,GAAG,IAC1BA,EAAeA,EAAa,OAAO,EAAGA,EAAa,OAAS,CAAC,GAE1D,IAAI2L,GAAiB,CAAA,EAAI,CAACrlD,EAAE,yCAA4CwmD,GAAgBpmB,CAAG,EAAGsZ,CAAY,CAAC,CAAC,CACvH,CAAC,CACL,CACA,qBAAqBkN,EAAiB15D,EAAQ,CAC1C,MAAM25D,EAAgBD,EAAgB,OAAO,MAAM,CAAC,EAC9CpR,EAASoR,EAAgB,OAC/B,IAAIhR,EAAcJ,EAAO,QAAUqQ,GAAYrQ,EAAO,OAAO,EAAI,OACjE,GAAII,IAAgB,yCAChB,OAAO,KAAK,QAAQ,QAAQ,IAAI4P,GAAe,CAAA,EAAI,CAACxlD,EAAE,qCAAqC,CAAC,EAAG,CAAA,EAAI41C,CAAW,CAAC,EAEnH,IAAIkR,EAA0B,IAAI,IAClC,MAAMlB,EAAiB,KAAK,eACtBmB,EAA2B,CAACvR,EAAQhqC,IAAS,CAC/CA,EAAO,mBAAmBA,CAAI,EAC9B,IAAIgM,EAAUg+B,EACd,OAAIhqC,EAAK,CAAC,IAAM,MACZA,EAAOA,EAAK,UAAU,CAAC,GAE3BA,EAAK,MAAM,GAAG,EAAE,KAAMw7C,IAClBA,EAAOA,EAAK,QAAQ,MAAO,GAAG,EAAE,QAAQ,MAAO,GAAG,EAClDxvC,EAAUA,EAAQwvC,CAAI,EACf,CAACxvC,EACX,EACMA,CACX,EACMyvC,EAAiB,CAACzR,EAAQtoD,EAAQ2B,KAC/B3B,EAAO,UACRA,EAAO,QAAUg6D,EAAe1R,CAAM,GAEnCtoD,EAAO,QAAQ,IAAI2B,CAAE,GAE1BvC,EAAQ,CAAC2L,EAAQkvD,IAAY,CAC/B,UAAWhzD,KAAOgzD,EACVA,EAAQ,eAAehzD,CAAG,GAAKA,IAAQ,MAAQA,IAAQ,QACvD8D,EAAO9D,CAAG,EAAIgzD,EAAQhzD,CAAG,EAGrC,EACMizD,EAAW,CAACnvD,EAAQovD,EAAYC,EAAcC,IAAe,CAC/D,IAAIJ,EACAI,IAAe,QAAaA,EAAW,SAAW,EAClDJ,EAAUE,EAELE,EAAW,OAAO,CAAC,IAAM,IAE9BJ,EAAUJ,EAAyBM,EAAYE,CAAU,EAIzDJ,EAAUF,EAAeI,EAAYC,EAAcC,CAAU,EAE7DJ,EACA76D,EAAM2L,EAAQkvD,CAAO,EAGrBN,EAAc,KAAK7mD,EAAE,2CAAgDunD,GAAc,GAAID,EAAa,GAAG,CAAC,CAEhH,EACME,EAAsB,CAAC78D,EAAMwlB,EAAKo3C,EAAYE,IAAiB,CAC7D7B,GAAkB,CAAC,oCAAoC,KAAKz1C,CAAG,IAC/DA,EAAMy1C,EAAe,oBAAoBz1C,EAAKs3C,EAAa,GAAG,GAElEt3C,EAAM01C,GAAY11C,CAAG,EACrB,MAAMu3C,EAAmB,KAAK,qBAAqBv3C,CAAG,EACtD,OAAOu3C,EAAiB,sBAAsB,KAAKC,GAAoB,CAEnE,GADAF,EAAa,aAAa,IAAIt3C,CAAG,EAC7Bw3C,EAAiB,OAAO,OAAQ,CAChC,MAAMC,EAAML,EAAap3C,EAAM,IAAMo3C,EAAap3C,EAClD02C,EAAc,KAAK7mD,EAAE,wCAA2C4nD,EAAKD,EAAiB,OAAO,CAAC,CAAC,CAAC,CACpG,CACA,OAAAP,EAASz8D,EAAMg9D,EAAiB,OAAQD,EAAkBH,CAAU,EAC7DM,EAAYl9D,EAAMg9D,EAAiB,OAAQD,CAAgB,CACtE,CAAC,CACL,EACMG,EAAc,CAACl9D,EAAMm9D,EAAcL,IAAiB,CACtD,MAAMM,EAAe,CAAA,EACrB,YAAK,cAAcp9D,EAAMtB,GAAQ,CAC7B,MAAM2+D,EAAW,IAAI,IACrB,KAAO3+D,EAAK,MAAM,CACd,MAAM4+D,EAAM5+D,EAAK,KACX6+D,EAAWD,EAAI,MAAM,IAAK,CAAC,EAEjC,GADA,OAAO5+D,EAAK,KACR6+D,EAAS,CAAC,EAAE,OAAS,EAAG,CAExBH,EAAa,KAAKP,EAAoBn+D,EAAM6+D,EAAS,CAAC,EAAGA,EAAS,CAAC,EAAGT,CAAY,CAAC,EACnF,MACJ,SAGQ,CAACO,EAAS,IAAIC,CAAG,EAAG,CACpB,MAAMp5D,EAAKq5D,EAAS,CAAC,EACrBd,EAAS/9D,EAAMy+D,EAAcL,EAAc54D,CAAE,EAC7Cm5D,EAAS,IAAIC,CAAG,CACpB,CAER,CACI5+D,EAAK,eACLy9D,EAAwB,IAAI,eAAe,EAE3Cz9D,EAAK,aACLy9D,EAAwB,IAAI,aAAa,CAEjD,CAAC,EACM,KAAK,QAAQ,IAAIiB,CAAY,CACxC,EACMb,EAAkBzQ,GAAS,CAC7B,MAAM7wD,EAAS,IAAI,IACnB,YAAK,cAAc6wD,EAAMptD,GAAQ,CAC7B,MAAMwF,EAAKxF,EAAK,KAAOA,EAAK,GACtB6B,EAASxE,GAASmI,CAAE,GAAKA,EAAG,OAAO,CAAC,IAAM,IAAMA,EAAG,UAAU,CAAC,EAAIxF,EAAK,QACzE6B,IACItF,EAAO,IAAIsF,CAAM,EACjB27D,EAAc,KAAK7mD,EAAE,sCAAyC9U,CAAM,CAAC,EAGrEtF,EAAO,IAAIsF,EAAQ7B,CAAI,GAG3BA,EAAK,kBACLy9D,EAAwB,IAAI,kBAAkB,EAE9Cz9D,EAAK,gBACLy9D,EAAwB,IAAI,gBAAgB,CAEpD,CAAC,EACMlhE,CACX,EACA,OAAOiiE,EAAYrS,EAAQA,EAAQtoD,CAAM,EAAE,KAAKrE,GAAK,CACjD,IAAIs/D,EAAkB,CAAA,EACtB,OAAIrB,EAAwB,MACxBqB,EAAgB,KAAKnoD,EAAE,0FAA2F,MAAM,KAAK8mD,EAAwB,KAAI,CAAE,EAAE,KAAK,IAAI,CAAC,CAAC,EAErK,IAAItB,GAAehQ,EAAQqR,EAAesB,EAAiBvS,CAAW,CACjF,CAAC,CACL,CACA,cAAca,EAAMvpD,EAAQ,CACxB,GAAI,CAACupD,GAAQ,OAAOA,GAAS,SACzB,OAAO,QAAQ,QAAQ,IAAI,EAE/B,MAAM9U,EAAO,IAAI,IACXymB,EAAiB,IAAIC,IAAY,CACnC,UAAWC,KAASD,EACZje,GAASke,CAAK,GACdxC,EAAO,KAAKwC,CAAK,CAG7B,EACMC,EAAoB,IAAIC,IAAS,CACnC,UAAWvgE,KAAOugE,EACd,GAAIpe,GAASniD,CAAG,EACZ,UAAW6O,KAAK7O,EAAK,CAEjB,MAAMqgE,EAAQrgE,EADF6O,CACS,EACjBszC,GAASke,CAAK,GACdxC,EAAO,KAAKwC,CAAK,CAEzB,CAGZ,EACMG,EAAsB,IAAIC,IAAW,CACvC,UAAWhhE,KAASghE,EAChB,GAAI,MAAM,QAAQhhE,CAAK,EACnB,UAAW4gE,KAAS5gE,EACZ0iD,GAASke,CAAK,GACdxC,EAAO,KAAKwC,CAAK,CAKrC,EACMK,EAA8BtiE,GAAU,CAC1C,GAAI,MAAM,QAAQA,CAAK,EACnB,UAAWiiE,KAASjiE,EACZ+jD,GAASke,CAAK,GACdxC,EAAO,KAAKwC,CAAK,OAIpBle,GAAS/jD,CAAK,GACnBy/D,EAAO,KAAKz/D,CAAK,CAEzB,EACMy/D,EAAS,CAACrP,CAAI,EACpB,IAAIptD,EAAOy8D,EAAO,IAAG,EACrB,KAAOz8D,GACEs4C,EAAK,IAAIt4C,CAAI,IACds4C,EAAK,IAAIt4C,CAAI,EACb6D,EAAO7D,CAAI,EACX++D,EAAe/+D,EAAK,gBAAiBA,EAAK,qBAAsBA,EAAK,IAAKA,EAAK,SAAUA,EAAK,cAAeA,EAAK,GAAIA,EAAK,KAAMA,EAAK,KAAMA,EAAK,iBAAkBA,EAAK,qBAAqB,EAC7Lk/D,EAAkBl/D,EAAK,YAAaA,EAAK,MAAOA,EAAK,WAAYA,EAAK,kBAAmBA,EAAK,aAAcA,EAAK,gBAAgB,EACjIo/D,EAAoBp/D,EAAK,MAAOA,EAAK,MAAOA,EAAK,MAAOA,EAAK,WAAW,EACxEs/D,EAA2Bt/D,EAAK,KAAK,GAEzCA,EAAOy8D,EAAO,IAAG,CAEzB,CAEA,sBAAsB8C,EAAUnW,EAAU,CACtC,GAAIA,EAAS,MAAM,OAAS,UACxB,UAAWtb,KAAKsb,EAAS,KAAK,WAC1B,GAAItb,EAAE,QAAQ,QAAU,WAAaA,EAAE,WAAW,OAAS,SAAU,CACjE,IAAIggB,EAAWhgB,EAAE,UAAU,MAC3B,OAAI,KAAK,gBAAkB,CAAC,iBAAiB,KAAKggB,CAAQ,IACtDA,EAAW,KAAK,eAAe,oBAAoBA,EAAUyR,CAAQ,GAElEzR,CACX,EAIZ,CACA,qBAAqByR,EAAU,CAC3B,MAAMjnB,EAAO,OAAO,OAAO,IAAI,EACzBqkB,EAAU,CAAA,EACV6C,EAAqB7D,GAA6B4D,CAAQ,EAChE,UAAWN,KAAS,KAAK,wBACrB,GAAIA,EAAM,eAAeO,CAAkB,EACvC,UAAW1R,KAAYmR,EAAM,UACpB3mB,EAAKwV,CAAQ,IACd6O,EAAQ,KAAK7O,CAAQ,EACrBxV,EAAKwV,CAAQ,EAAI,IAKjC,OAAO6O,CACX,CACA,yBAAyB4C,EAAUnW,EAAU,CACzC,IAAIqW,EAAWrW,GAAY,KAAK,sBAAsBmW,EAAUnW,CAAQ,EACxE,OAAIqW,EACO,CAACA,CAAQ,EAEb,KAAK,qBAAqBF,CAAQ,CAC7C,CACA,qBAAqBA,EAAUnW,EAAU,CACrC,GAAIA,EAAU,CAEV,IAAIqW,EAAW,KAAK,sBAAsBF,EAAUnW,CAAQ,EAC5D,GAAIqW,EAAU,CACV,MAAMj6D,EAAKg3D,GAAYiD,CAAQ,EAC/B,OAAO,KAAK,qBAAqBj6D,CAAE,EAAE,kBAAiB,CAC1D,CACJ,CACA,GAAI,KAAK,yBAA2B,KAAK,wBAAwB,WAAa+5D,EAC1E,OAAO,KAAK,wBAAwB,eAExC,MAAM5C,EAAU,KAAK,qBAAqB4C,CAAQ,EAC5ChH,EAAiBoE,EAAQ,OAAS,EAAI,KAAK,qBAAqB4C,EAAU5C,CAAO,EAAE,kBAAiB,EAAK,KAAK,QAAQ,QAAQ,MAAS,EAC7I,YAAK,wBAA0B,CAAE,SAAA4C,EAAU,eAAAhH,CAAc,EAClDA,CACX,CACA,qBAAqBgH,EAAUG,EAAW,CACtC,GAAIA,EAAU,SAAW,EACrB,OAAO,KAAK,qBAAqBA,EAAU,CAAC,CAAC,EAE5C,CACD,MAAMC,EAAmB,kCAAoC,mBAAmBJ,CAAQ,EAClFK,EAAiB,CACnB,MAAOF,EAAU,IAAI5R,IAAa,CAAE,KAAMA,GAAW,CACrE,EACY,OAAO,KAAK,gBAAgB6R,EAAkBC,CAAc,CAChE,CACJ,CACA,mBAAmBxW,EAAU+N,EAAchL,EAAQ,CAC/C,GAAIA,EAAQ,CACR,MAAM3mD,EAAK2mD,EAAO,IAAO,4CAA8CmM,KAEvE,OADe,KAAK,gBAAgB9yD,EAAI2mD,CAAM,EAChC,oBAAoB,KAAKoM,GAC5BpB,EAAa,mBAAmBoB,EAAe,MAAM,EAAE,OAAO9nD,GAAK,CAACA,EAAE,QAAQ,CACxF,CACL,CACA,OAAO,KAAK,qBAAqB24C,EAAS,IAAK+N,CAAY,EAAE,KAAKhL,GAC1DA,EACOgL,EAAa,mBAAmBhL,EAAO,MAAM,EAAE,OAAO,GAAK,CAAC,EAAE,QAAQ,EAE1E,CAAA,CACV,CACL,CACJ,CACA,IAAImM,GAAY,EAChB,SAASkE,GAAYh3D,EAAI,CAErB,GAAI,CACA,OAAO4gB,GAAI,MAAM5gB,CAAE,EAAE,SAAS,EAAI,CACtC,MACU,CACN,OAAOA,CACX,CACJ,CACA,SAASm2D,GAA6B4D,EAAU,CAE5C,GAAI,CACA,OAAOn5C,GAAI,MAAMm5C,CAAQ,EAAE,KAAK,CAAE,SAAU,KAAM,MAAO,IAAI,CAAE,EAAE,SAAS,EAAI,CAClF,MACU,CACN,OAAOA,CACX,CACJ,CACA,SAASpC,GAAgBpmB,EAAK,CAC1B,GAAI,CACA,MAAMjwB,EAAMV,GAAI,MAAM2wB,CAAG,EACzB,GAAIjwB,EAAI,SAAW,OACf,OAAOA,EAAI,MAEnB,MACU,CAEV,CACA,OAAOiwB,CACX,CCtlBA,SAAS8oB,GAAiBzW,EAAUlrC,EAAS,CACzC,MAAMwT,EAAS,CAAA,EACTouC,EAAgB,CAAA,EAChB5jE,EAAQ,CAAA,EACd,IAAI6jE,EAAY,GAChB,MAAM9jB,EAAU7C,GAAcgQ,EAAS,QAAO,EAAI,EAAK,EACvD,IAAI7P,EAAQ0C,EAAQ,KAAI,EACxB,SAAS+jB,EAAS9mD,EAAO,CACrBwY,EAAO,KAAKxY,CAAK,EACjB4mD,EAAc,KAAK5jE,EAAM,MAAM,CACnC,CACA,KAAOq9C,IAAU,IAAyB,CACtC,OAAQA,EAAK,CACT,IAAK,GACL,IAAK,GAAqC,CACtC,MAAMroB,EAAYk4B,EAAS,WAAWnN,EAAQ,eAAc,CAAE,EAAE,KAC1D/iC,EAAQ,CAAE,UAAAgY,EAAW,QAASA,EAAW,KAAMqoB,IAAU,EAAoC,SAAW,OAAO,EACrHr9C,EAAM,KAAKgd,CAAK,EAChB,KACJ,CACA,IAAK,GACL,IAAK,GAAsC,CACvC,MAAM6Q,EAAOwvB,IAAU,EAAqC,SAAW,QACvE,GAAIr9C,EAAM,OAAS,GAAKA,EAAMA,EAAM,OAAS,CAAC,EAAE,OAAS6tB,EAAM,CAC3D,MAAM7Q,EAAQhd,EAAM,IAAG,EACjB+f,EAAOmtC,EAAS,WAAWnN,EAAQ,eAAc,CAAE,EAAE,KACvD/iC,GAAS+C,EAAO/C,EAAM,UAAY,GAAK6mD,IAAc7mD,EAAM,YAC3DA,EAAM,QAAU+C,EAAO,EACvB+jD,EAAS9mD,CAAK,EACd6mD,EAAY7mD,EAAM,UAE1B,CACA,KACJ,CACA,IAAK,IAAwC,CACzC,MAAMgY,EAAYk4B,EAAS,WAAWnN,EAAQ,eAAc,CAAE,EAAE,KAC1D9qB,EAAUi4B,EAAS,WAAWnN,EAAQ,eAAc,EAAKA,EAAQ,eAAc,CAAE,EAAE,KACrFA,EAAQ,kBAAoB,GAA4C/qB,EAAY,EAAIk4B,EAAS,UACjGnN,EAAQ,YAAYmN,EAAS,SAASrxC,GAAS,OAAOmZ,EAAY,EAAG,CAAC,CAAC,CAAC,EAGpEA,EAAYC,IACZ6uC,EAAS,CAAE,UAAA9uC,EAAW,QAAAC,EAAS,KAAM4xB,GAAiB,QAAS,EAC/Dgd,EAAY7uC,GAGpB,KACJ,CACA,IAAK,IAAuC,CAExC,MAAMpB,EADOs5B,EAAS,UAAU,OAAOnN,EAAQ,eAAc,EAAIA,EAAQ,gBAAgB,EAC1E,MAAM,mCAAmC,EACxD,GAAInsB,EAAG,CACH,MAAM7T,EAAOmtC,EAAS,WAAWnN,EAAQ,eAAc,CAAE,EAAE,KAC3D,GAAInsB,EAAE,CAAC,EAAG,CACN,MAAM5W,EAAQ,CAAE,UAAW+C,EAAM,QAASA,EAAM,KAAM8mC,GAAiB,MAAM,EAC7E7mD,EAAM,KAAKgd,CAAK,CACpB,KACK,CACD,IAAIhc,EAAIhB,EAAM,OAAS,EACvB,KAAOgB,GAAK,GAAKhB,EAAMgB,CAAC,EAAE,OAAS6lD,GAAiB,QAChD7lD,IAEJ,GAAIA,GAAK,EAAG,CACR,MAAMgc,EAAQhd,EAAMgB,CAAC,EACrBhB,EAAM,OAASgB,EACX+e,EAAO/C,EAAM,WAAa6mD,IAAc7mD,EAAM,YAC9CA,EAAM,QAAU+C,EAChB+jD,EAAS9mD,CAAK,EACd6mD,EAAY7mD,EAAM,UAE1B,CACJ,CACJ,CACA,KACJ,CACZ,CACQqgC,EAAQ0C,EAAQ,KAAI,CACxB,CACA,MAAMgkB,EAAa/hD,GAAWA,EAAQ,WACtC,GAAI,OAAO+hD,GAAe,UAAYvuC,EAAO,QAAUuuC,EACnD,OAAOvuC,EAEPxT,GAAWA,EAAQ,sBACnBA,EAAQ,qBAAqBkrC,EAAS,GAAG,EAE7C,MAAM8W,EAAS,CAAA,EACf,QAASC,KAASL,EACVK,EAAQ,KACRD,EAAOC,CAAK,GAAKD,EAAOC,CAAK,GAAK,GAAK,GAG/C,IAAInB,EAAU,EACVoB,EAAW,EACf,QAASljE,EAAI,EAAGA,EAAIgjE,EAAO,OAAQhjE,IAAK,CACpC,MAAMmL,EAAI63D,EAAOhjE,CAAC,EAClB,GAAImL,EAAG,CACH,GAAIA,EAAI22D,EAAUiB,EAAY,CAC1BG,EAAWljE,EACX,KACJ,CACA8hE,GAAW32D,CACf,CACJ,CACA,MAAM9L,EAAS,CAAA,EACf,QAASW,EAAI,EAAGA,EAAIw0B,EAAO,OAAQx0B,IAAK,CACpC,MAAMijE,EAAQL,EAAc5iE,CAAC,EACzB,OAAOijE,GAAU,WACbA,EAAQC,GAAaD,IAAUC,GAAYpB,IAAYiB,IACvD1jE,EAAO,KAAKm1B,EAAOx0B,CAAC,CAAC,CAGjC,CACA,OAAOX,CACX,CCjHA,SAAS8jE,GAAmBjX,EAAUkX,EAAWzM,EAAK,CAClD,SAAS0M,EAAkBpnD,EAAU,CACjC,IAAI5M,EAAS68C,EAAS,SAASjwC,CAAQ,EACnC7X,EAAOuyD,EAAI,kBAAkBtnD,EAAQ,EAAI,EAC7C,MAAMhQ,EAAS,CAAA,EACf,KAAO+E,GAAM,CACT,OAAQA,EAAK,KAAI,CACb,IAAK,SACL,IAAK,SACL,IAAK,QAED,MAAMk/D,EAASl/D,EAAK,OAAS,EAAGm/D,EAAOn/D,EAAK,OAASA,EAAK,OAAS,EAC/Dk/D,EAASC,GAAQl0D,GAAUi0D,GAAUj0D,GAAUk0D,GAC/ClkE,EAAO,KAAKmkE,EAASF,EAAQC,CAAI,CAAC,EAEtClkE,EAAO,KAAKmkE,EAASp/D,EAAK,OAAQA,EAAK,OAASA,EAAK,MAAM,CAAC,EAC5D,MACJ,IAAK,SACL,IAAK,UACL,IAAK,OACL,IAAK,WACD/E,EAAO,KAAKmkE,EAASp/D,EAAK,OAAQA,EAAK,OAASA,EAAK,MAAM,CAAC,EAC5D,KACpB,CACY,GAAIA,EAAK,OAAS,YAAcA,EAAK,QAAUA,EAAK,OAAO,OAAS,QAAS,CACzE,MAAMq/D,EAAmBC,EAAwBt/D,EAAK,OAASA,EAAK,OAAQ,CAAC,EACzEq/D,IAAqB,IACrBpkE,EAAO,KAAKmkE,EAASp/D,EAAK,OAAQq/D,CAAgB,CAAC,CAE3D,CACAr/D,EAAOA,EAAK,MAChB,CACA,IAAI6sB,EACJ,QAASrvB,EAAQvC,EAAO,OAAS,EAAGuC,GAAS,EAAGA,IAC5CqvB,EAAUs5B,GAAe,OAAOlrD,EAAOuC,CAAK,EAAGqvB,CAAO,EAE1D,OAAKA,IACDA,EAAUs5B,GAAe,OAAO5uC,EAAM,OAAOM,EAAUA,CAAQ,CAAC,GAE7DgV,CACX,CACA,SAASuyC,EAAS5mD,EAAOvR,EAAK,CAC1B,OAAOsQ,EAAM,OAAOuwC,EAAS,WAAWtvC,CAAK,EAAGsvC,EAAS,WAAW7gD,CAAG,CAAC,CAC5E,CACA,MAAM0zC,EAAU7C,GAAcgQ,EAAS,QAAO,EAAI,EAAI,EACtD,SAASwX,EAAwBr0D,EAAQs0D,EAAe,CAGpD,OAFA5kB,EAAQ,YAAY1vC,CAAM,EACd0vC,EAAQ,KAAI,IACV4kB,EACH5kB,EAAQ,iBAAmBA,EAAQ,eAAc,EAErD,EACX,CACA,OAAOqkB,EAAU,IAAIC,CAAiB,CAC1C,CC1DA,SAASrwB,GAAO4wB,EAAkBC,EAAmBC,EAAiB,CAClE,IAAI9nD,EACJ,GAAI8nD,EAAiB,CACjB,MAAMz0D,EAASu0D,EAAiB,SAASE,EAAgB,KAAK,EACxD1hE,EAASwhE,EAAiB,SAASE,EAAgB,GAAG,EAAIz0D,EAChE2M,EAAQ,CAAE,OAAA3M,EAAQ,OAAAjN,CAAM,CAC5B,CACA,MAAM8D,EAAU,CACZ,QAAS29D,EAAoBA,EAAkB,QAAU,EACzD,aAAcA,GAAmB,eAAiB,GAClD,mBAAoBA,GAAmB,qBAAuB,GAC9D,IAAK;AAAA,EACL,UAAWA,GAAmB,YAAc,EACpD,EACI,OAAOtgB,GAASqgB,EAAiB,QAAO,EAAI5nD,EAAO9V,CAAO,EAAE,IAAIm0B,GACrDurB,GAAS,QAAQjqC,EAAM,OAAOioD,EAAiB,WAAWvpC,EAAK,MAAM,EAAGupC,EAAiB,WAAWvpC,EAAK,OAASA,EAAK,MAAM,CAAC,EAAGA,EAAK,OAAO,CACvJ,CACL,CCjBA,IAAI0pC,IACH,SAAUA,EAAW,CAClBA,EAAUA,EAAU,OAAY,CAAC,EAAI,SACrCA,EAAUA,EAAU,MAAW,CAAC,EAAI,OACxC,GAAGA,KAAcA,GAAY,CAAA,EAAG,EAChC,MAAMC,EAAa,CACf,YAAYlQ,EAAcmQ,EAAqB,CAC3C,KAAK,aAAenQ,GAAgB,GACpC,KAAK,oBAAsBmQ,EAC3B,KAAK,mBAAqB,CAAA,EAC1B,KAAK,aAAe,GACpB,KAAK,UAAY,EACrB,CACA,iBAAiBC,EAAe,CAE5B,GADAA,EAAc,OAAS,KACnB,KAAK,mBAAmB,OAAS,EAAG,CACpC,IAAIC,EAAiB,EACjBD,EAAc,UACdC,EAAiB,KAAK,mBAAmB,OAGzCA,EAAiBC,GAA4B,KAAK,mBAAoBF,EAAeG,EAAiB,EAEtGF,EAAiB,IACjBA,EAAkBA,EAAiB,GAAM,GAE7C,KAAK,mBAAmB,OAAOA,EAAgB,EAAGD,CAAa,CACnE,MAEI,KAAK,mBAAmB,KAAKA,CAAa,EAE9C,OAAOA,CACX,CACJ,CACA,SAASG,GAAkBC,EAAeC,EAAe,CACrD,MAAMC,EAAgBF,EAAc,aAAa,YAAW,EACtDG,EAAgBF,EAAc,aAAa,YAAW,EAC5D,OAAIC,EAAgBC,EACT,GAEFD,EAAgBC,EACd,EAEJ,CACX,CACA,SAASL,GAA4BM,EAAmBC,EAAcC,EAAY,CAC9E,MAAM9Q,EAAe6Q,EAAa,aAAa,YAAW,EACpDE,EAA2BH,EAAkB,CAAC,EAAE,aAAa,YAAW,EACxEI,EAA0BJ,EAAkBA,EAAkB,OAAS,CAAC,EAAE,aAAa,YAAW,EACxG,GAAI5Q,EAAe+Q,EACf,MAAO,GAEX,GAAI/Q,EAAegR,EACf,OAAOJ,EAAkB,OAE7B,IAAI9xC,EAAI,EACJznB,EAAIu5D,EAAkB,OAAS,EACnC,KAAO9xC,GAAKznB,GAAG,CACX,IAAIoF,EAAKpF,EAAIynB,GAAM,EACfmyC,EAAMH,EAAWD,EAAcD,EAAkBn0D,CAAC,CAAC,EACvD,GAAIw0D,EAAM,EACNnyC,EAAIriB,EAAI,UAEHw0D,EAAM,EACX55D,EAAIoF,EAAI,MAGR,QAAOA,CAEf,CACA,MAAO,CAACqiB,EAAI,CAChB,CC/DA,SAASoyC,GAAKC,EAAgBpB,EAAmB,CAC7C,MAAM39D,EAAU,CACZ,GAAG29D,EACH,UAAW,EACnB,EACUqB,EAAsBnZ,GAAa,WAAWkZ,EAAgBjyB,GAAOiyB,EAAgB/+D,EAAS,MAAS,CAAC,EACxGi/D,EAAwBpZ,GAAa,OAAO,mBAAoB,OAAQ,EAAGmZ,CAAmB,EAC9FE,EAAmBC,GAAsBF,CAAqB,EAC9DG,EAAqBC,GAAkBJ,EAAuBC,CAAgB,EAC9E7qC,EAAQyY,GAAOsyB,EAAoBp/D,EAAS,MAAS,EACrDs/D,EAAiCzZ,GAAa,WAAWuZ,EAAoB/qC,CAAK,EACxF,MAAO,CAACqrB,GAAS,QAAQjqC,EAAM,OAAOd,GAAS,OAAO,EAAG,CAAC,EAAGoqD,EAAe,WAAWA,EAAe,QAAO,EAAG,MAAM,CAAC,EAAGO,CAA8B,CAAC,CAC7J,CACA,SAASH,GAAsBI,EAAmB,CAC9C,MAAMC,EAAkBD,EAAkB,QAAO,EAC3C1mB,EAAU7C,GAAcwpB,EAAiB,EAAK,EAEpD,IAAIC,EAAW,IAAI3B,GAEf4B,EAAcD,EAEdzlB,EAAkBylB,EAElBE,EAAeF,EAEftpB,EAEAypB,EAAgB,EAEhBC,EAAoC,EAEpCC,EAEAC,EAEAC,EAAqC,GAErCC,EAAyC,GAEzClC,EAAsB,EAEtBnoD,EAAgB,EAEhBsqD,EAAwB,CAAA,EAExBC,EAAkC,GAElCC,EAA4B,GAChC,MAAQjqB,EAAQ0C,EAAQ,KAAI,KAAQ,IAAyB,CAMzD,GAAIsnB,IAAoC,IACjChqB,IAAU,IACVA,IAAU,IACVA,IAAU,IACVA,IAAU,IACV6D,EAAgB,gBAAkB,OAAW,CAChD,IAAIpkC,EAAgBijC,EAAQ,kBAAiB,EAEzCknB,IAAyC,GACtCA,IAAyC,EAC5CJ,EAAa,cAAgB/pD,EAAgB,EAI7CokC,EAAgB,cAAgBpkC,EAAgB,EAEpDmoD,EAAsBnoD,EACtBuqD,EAAkC,EACtC,CAgBA,GATIC,IAA8B,IAC3BjqB,IAAU,IACVA,IAAU,IACVA,IAAU,IACVA,IAAU,KACb4nB,EAAsBllB,EAAQ,kBAAiB,EAC/CunB,EAA4B,IAG5BvnB,EAAQ,kBAAiB,IAAO+mB,EAAe,CAC/C,QAAS9lE,EAAI8lE,EAAe9lE,EAAI++C,EAAQ,kBAAiB,EAAI/+C,IAAK,CAC9D,MAAMumE,EAAed,EAAkB,QAAQ9pD,EAAM,OAAOd,GAAS,OAAO7a,EAAG,CAAC,EAAG6a,GAAS,OAAO7a,EAAI,EAAG,CAAC,CAAC,CAAC,EAAE,OAC/G+lE,EAAoCA,EAAoCQ,CAC5E,CACAT,EAAgB/mB,EAAQ,kBAAiB,CAC7C,CACA,OAAQ1C,EAAK,CAET,IAAK,IAAmC,CACpC,GAAK2pB,IAAiC,QAC/BA,IAAiC,GAChCA,IAAiC,GAC9BI,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,OAAU,CAEvF,MAAMG,EAAgB,IAAIF,GAAajlB,EAAQ,cAAa,EAAIklB,CAAmB,EACnF4B,EAAe3lB,EACfA,EAAkB0lB,EAAY,iBAAiB1B,CAAa,CAChE,CACA,KACJ,CAEA,IAAK,GAAqC,CAQtC,GANIyB,EAAS,sBAAwB,SACjCA,EAAS,oBAAsB5mB,EAAQ,kBAAiB,GAKxDqnB,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,OACtE6B,EAAc1lB,UAKTkmB,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,MAAO,CAClF,MAAMG,EAAgB,IAAIF,GAAajlB,EAAQ,cAAa,EAAIklB,CAAmB,EACnFC,EAAc,UAAY,GAC1B2B,EAAe3lB,EACfA,EAAkB0lB,EAAY,iBAAiB1B,CAAa,EAC5D0B,EAAc1lB,CAClB,CACAkmB,EAAsB,KAAKrC,GAAU,KAAK,EAC1C7jB,EAAgB,KAAO6jB,GAAU,MACjCE,EAAsBllB,EAAQ,kBAAiB,EAC/CklB,IACA,KACJ,CAEA,IAAK,GAAmC,CAEpC,GAAI0B,EAAS,sBAAwB,OACjCA,EAAS,oBAAsB5mB,EAAQ,kBAAiB,UAMnDqnB,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,MAAO,CAClF,MAAMG,EAAgB,IAAIF,GAAajlB,EAAQ,cAAa,EAAIklB,CAAmB,EACnFC,EAAc,UAAY,GAC1B2B,EAAe3lB,EACfA,EAAkB0lB,EAAY,iBAAiB1B,CAAa,CAChE,CACAhkB,EAAgB,KAAO6jB,GAAU,OACjCqC,EAAsB,KAAKrC,GAAU,MAAM,EAC3C6B,EAAc1lB,EACd+jB,EAAsBllB,EAAQ,kBAAiB,EAC/CklB,IACA,KACJ,CACA,IAAK,GAAsC,CACvCnoD,EAAgBijC,EAAQ,kBAAiB,EACzCqnB,EAAsB,IAAG,EAGrBlmB,EAAgB,gBAAkB,SAC9B8lB,IAAiC,GAC9BA,IAAiC,KACxC9lB,EAAgB,cAAgBpkC,EAAgB,EAChDokC,EAAgB,aAAe,GAC/BA,EAAgB,oBAAsBgmB,EACtChmB,EAAgB,oBAAsBimB,EACtCN,EAAe3lB,EACfA,EAAkBA,EAAkBA,EAAgB,OAAS,OAC7D0lB,EAAc1lB,GAElBylB,EAAS,cAAgB7pD,EACzBmoD,EAAsBnoD,EAAgB,EACtC,KACJ,CACA,IAAK,GAAoC,CACrCA,EAAgBijC,EAAQ,kBAAiB,EACzCqnB,EAAsB,IAAG,EAErBJ,IAAiC,IAE7B9lB,EAAgB,gBAAkB,SAClCA,EAAgB,cAAgBpkC,EAAgB,EAEhDokC,EAAgB,aAAe,GAE/BA,EAAgB,oBAAsBgmB,EACtChmB,EAAgB,oBAAsBimB,GAE1CN,EAAe3lB,EACfA,EAAkBA,EAAkBA,EAAgB,OAAS,OAC7D0lB,EAAc1lB,GAElBylB,EAAS,cAAgB5mB,EAAQ,kBAAiB,EAClDklB,EAAsBnoD,EAAgB,EACtC,KACJ,CACA,IAAK,GAA+B,CAChCA,EAAgBijC,EAAQ,kBAAiB,EAGrCmB,EAAgB,gBAAkB,SAC9BkmB,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,QAClEqC,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,QAClEiC,IAAiC,GAC9BA,IAAiC,MAChD9lB,EAAgB,cAAgBpkC,EAEhCokC,EAAgB,WAAanB,EAAQ,eAAc,EAAKgnB,EACxD7lB,EAAgB,UAAYpkC,IAE5BkqD,IAAiC,GAC9BA,IAAiC,KACpCH,EAAe3lB,EACfA,EAAkBA,EAAkBA,EAAgB,OAAS,OAC7D0lB,EAAc1lB,GAElB+jB,EAAsBnoD,EAAgB,EACtC,KACJ,CACA,IAAK,IAAwC,CAMrCkqD,IAAiC,GAC9BE,IAAuCnnB,EAAQ,kBAAiB,IAC/DqnB,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,QAClEkC,IAAyC,GACtCA,IAAyC,IAC7CG,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,UACzEqC,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,QAAUkC,IAAyC,GAAsCA,IAAyC,IAAyCG,EAAsBA,EAAsB,OAAS,CAAC,IAAMrC,GAAU,UACvT7jB,EAAgB,cAAgB,OAChCmmB,EAAkC,KAQrCL,IAAiC,GAC/BA,IAAiC,IACjCE,IAAuCnnB,EAAQ,sBAClDunB,EAA4B,IAEhC,KACJ,CACZ,CAEYjqB,IAAU,IACPA,IAAU,IACVA,IAAU,IACVA,IAAU,KACb4pB,EAAuCD,EACvCA,EAA+B3pB,EAC/B6pB,EAAqCnnB,EAAQ,kBAAiB,EAC9DonB,EAAyCpnB,EAAQ,eAAc,EAAKA,EAAQ,eAAc,EAAKgnB,EAEvG,CACA,OAAOJ,CACX,CACA,SAASJ,GAAkBtL,EAAc0K,EAAc,CACnD,GAAIA,EAAa,mBAAmB,SAAW,EAC3C,OAAO1K,EAEX,MAAMqL,EAAqBvZ,GAAa,OAAO,mBAAoB,OAAQ,EAAGkO,EAAa,SAAS,EAC9FuM,EAAc,CAAA,EAEpB,IADAC,GAAmBD,EAAa7B,EAAcA,EAAa,mBAAmB,EACvE6B,EAAY,OAAS,GAAG,CAC3B,MAAME,EAAaF,EAAY,MAAK,EAC9B9B,EAAoBgC,EAAW,kBACrC,IAAIzC,EAAsByC,EAAW,oBACrC,QAAS1mE,EAAI,EAAGA,EAAI0kE,EAAkB,OAAQ1kE,IAAK,CAC/C,MAAM2kE,EAAeD,EAAkB1kE,CAAC,EAClCgc,EAAQL,EAAM,OAAOd,GAAS,OAAO8pD,EAAa,oBAAqB,CAAC,EAAG9pD,GAAS,OAAO8pD,EAAa,cAAgB,EAAG,CAAC,CAAC,EAC7HgC,EAAuB1M,EAAa,QAAQj+C,CAAK,EACjD4qD,EAAwB7a,GAAa,OAAO,mBAAoB,OAAQ,EAAG4a,CAAoB,EACrG,GAAIhC,EAAa,eAAiB,IAAQ3kE,IAAM0kE,EAAkB,OAAS,EAAG,CAC1E,MAAMmC,EAAsBlC,EAAa,oBAAsBA,EAAa,oBACtEmC,EAAuBnC,EAAa,oBACpCtqC,EAAO,CACT,MAAO1e,EAAM,OAAOd,GAAS,OAAOgsD,EAAqBC,CAAoB,EAAGjsD,GAAS,OAAOgsD,EAAqBC,CAAoB,CAAC,EAC1I,KAAM,GAC1B,EACgB/a,GAAa,OAAO6a,EAAuB,CAACvsC,CAAI,EAAG,CAAC,CACxD,SACSsqC,EAAa,eAAiB,IAAS3kE,IAAM0kE,EAAkB,OAAS,EAAG,CAChF,MAAMqC,EAAapC,EAAa,WAE1BqC,EADYrC,EAAa,UACYA,EAAa,oBAClDtqC,EAAO,CACT,MAAO1e,EAAM,OAAOd,GAAS,OAAOmsD,EAAwBD,CAAU,EAAGlsD,GAAS,OAAOmsD,EAAwBD,EAAa,CAAC,CAAC,EAChI,KAAM,EAC1B,EACgBhb,GAAa,OAAO6a,EAAuB,CAACvsC,CAAI,EAAG,CAAC,CACxD,CACA,MAAMj4B,EAASuiE,EAAa,cAAgBA,EAAa,oBAAsB,EACzEtqC,EAAO,CACT,MAAO1e,EAAM,OAAOd,GAAS,OAAOopD,EAAqB,CAAC,EAAGppD,GAAS,OAAOopD,EAAsB7hE,EAAQ,CAAC,CAAC,EAC7G,KAAMwkE,EAAsB,QAAO,CACnD,EACY7a,GAAa,OAAOuZ,EAAoB,CAACjrC,CAAI,EAAG,CAAC,EACjDosC,GAAmBD,EAAa7B,EAAcV,CAAmB,EACjEA,EAAsBA,EAAsB7hE,CAChD,CACJ,CACA,OAAOkjE,CACX,CACA,SAASmB,GAAmBQ,EAAOtC,EAAcV,EAAqB,CAClE,GAAIU,EAAa,mBAAmB,SAAW,EAG/C,GAAIA,EAAa,OAASZ,GAAU,OAAQ,CACxC,IAAImD,EAA6B,IACjC,UAAWhD,KAAiBS,EAAa,mBACjCT,EAAc,oBAAsBgD,IACpCA,EAA6BhD,EAAc,qBAGnD,MAAMt5B,EAAOs8B,EAA6BvC,EAAa,oBACvDV,EAAsBA,EAAsBr5B,EAC5Cq8B,EAAM,KAAK,IAAIE,GAAalD,EAAqBU,EAAa,kBAAkB,CAAC,CACrF,MACSA,EAAa,OAASZ,GAAU,OACrCqD,GAAqCH,EAAOtC,EAAcV,CAAmB,CAErF,CACA,SAASmD,GAAqCH,EAAOtC,EAAcV,EAAqB,CACpF,UAAWoD,KAAa1C,EAAa,mBAAoB,CAErD,GAAI0C,EAAU,OAAStD,GAAU,OAAQ,CACrC,IAAImD,EAA6B,IACjC,UAAWhD,KAAiBmD,EAAU,mBAC9BnD,EAAc,oBAAsBgD,IACpCA,EAA6BhD,EAAc,qBAGnD,MAAMt5B,EAAOs8B,EAA6BG,EAAU,oBACpDJ,EAAM,KAAK,IAAIE,GAAalD,EAAsBoD,EAAU,oBAAsB1C,EAAa,oBAAsB/5B,EAAMy8B,EAAU,kBAAkB,CAAC,CAC5J,CAEIA,EAAU,OAAStD,GAAU,OAC7BqD,GAAqCH,EAAOI,EAAWpD,EAAsBoD,EAAU,oBAAsB1C,EAAa,mBAAmB,CAErJ,CACJ,CACA,MAAMwC,EAAa,CACf,YAAYlD,EAAqBS,EAAmB,CAChD,KAAK,oBAAsBT,EAC3B,KAAK,kBAAoBS,CAC7B,CACJ,CC3WA,SAAS4C,GAAUpb,EAAUyK,EAAK,CAC9B,MAAM4Q,EAAQ,CAAA,EACd,OAAA5Q,EAAI,MAAMvyD,GAAQ,CACd,GAAIA,EAAK,OAAS,YAAcA,EAAK,QAAQ,QAAU,QAAUA,EAAK,WAAW,OAAS,SAAU,CAChG,MAAM6gB,EAAO7gB,EAAK,UAAU,MACtBiuD,EAAamV,GAAe7Q,EAAK1xC,CAAI,EAC3C,GAAIotC,EAAY,CACZ,MAAMoV,EAAYvb,EAAS,WAAWmG,EAAW,MAAM,EACvDkV,EAAM,KAAK,CACP,OAAQ,GAAGrb,EAAS,GAAG,IAAIub,EAAU,KAAO,CAAC,IAAIA,EAAU,UAAY,CAAC,GACxE,MAAOC,GAAYxb,EAAU9nD,EAAK,SAAS,CAC/D,CAAiB,CACL,CACJ,CACA,MAAO,EACX,CAAC,EACM,QAAQ,QAAQmjE,CAAK,CAChC,CACA,SAASG,GAAYxb,EAAU9nD,EAAM,CACjC,OAAOuX,EAAM,OAAOuwC,EAAS,WAAW9nD,EAAK,OAAS,CAAC,EAAG8nD,EAAS,WAAW9nD,EAAK,OAASA,EAAK,OAAS,CAAC,CAAC,CAChH,CACA,SAASojE,GAAe7Q,EAAK1xC,EAAM,CAC/B,MAAM0iD,EAASC,GAAiB3iD,CAAI,EACpC,OAAK0iD,EAGEE,GAASF,EAAQhR,EAAI,IAAI,EAFrB,IAGf,CACA,SAASkR,GAASC,EAAS1jE,EAAM,CAC7B,GAAI,CAACA,EACD,OAAO,KAEX,GAAI0jE,EAAQ,SAAW,EACnB,OAAO1jE,EAEX,MAAMi4C,EAAQyrB,EAAQ,MAAK,EAC3B,GAAI1jE,GAAQA,EAAK,OAAS,SAAU,CAChC,MAAMyvD,EAAezvD,EAAK,WAAW,KAAMyvD,GAAiBA,EAAa,QAAQ,QAAUxX,CAAK,EAChG,OAAKwX,EAGEgU,GAASC,EAASjU,EAAa,SAAS,EAFpC,IAGf,SACSzvD,GAAQA,EAAK,OAAS,SACvBi4C,EAAM,MAAM,mBAAmB,EAAG,CAClC,MAAMz6C,EAAQ,OAAO,SAASy6C,CAAK,EAC7B0rB,EAAY3jE,EAAK,MAAMxC,CAAK,EAClC,OAAKmmE,EAGEF,GAASC,EAASC,CAAS,EAFvB,IAGf,CAEJ,OAAO,IACX,CACA,SAASH,GAAiB3iD,EAAM,CAC5B,OAAIA,IAAS,IACF,CAAA,EAEPA,EAAK,CAAC,IAAM,KAAOA,EAAK,CAAC,IAAM,IACxB,KAEJA,EAAK,UAAU,CAAC,EAAE,MAAM,IAAI,EAAE,IAAI+iD,EAAQ,CACrD,CACA,SAASA,GAAS5nE,EAAK,CACnB,OAAOA,EAAI,QAAQ,MAAO,GAAG,EAAE,QAAQ,MAAO,GAAG,CACrD,CCvDA,SAAS6nE,GAAmBC,EAAQ,CAChC,MAAMr/D,EAAUq/D,EAAO,oBAAsB,QACvCnO,EAAoB,IAAIoF,GAAkB+I,EAAO,qBAAsBA,EAAO,iBAAkBr/D,CAAO,EAC7GkxD,EAAkB,uBAAuBiD,EAAmB,EAC5D,MAAMmL,EAAiB,IAAI/R,GAAe2D,EAAmBmO,EAAO,cAAer/D,EAASq/D,EAAO,kBAAkB,EAC/GE,EAAY,IAAIlP,GAAUa,EAAmBmO,EAAO,cAAer/D,CAAO,EAC1Ew/D,EAAsB,IAAItM,GAAoBhC,CAAiB,EAC/DuO,EAAiB,IAAIxO,GAAeC,EAAmBlxD,CAAO,EACpE,MAAO,CACH,UAAY0/D,GAAa,CACrBxO,EAAkB,qBAAoB,EACtCwO,EAAS,SAAS,QAAQxO,EAAkB,uBAAuB,KAAKA,CAAiB,CAAC,EAC1FuO,EAAe,UAAUC,CAAQ,CACrC,EACA,YAAc3+C,GAAQmwC,EAAkB,iBAAiBnwC,CAAG,EAC5D,aAAc0+C,EAAe,aAAa,KAAKA,CAAc,EAC7D,kBAAmBA,EAAe,kBAAkB,KAAKA,CAAc,EACvE,kBAAoBpc,GAAajZ,GAAMiZ,EAAU,CAAE,gBAAiB,GAAM,EAC1E,gBAAiB,CAACgE,EAAMrG,IAAgBoG,GAAgBC,EAAMrG,CAAW,EACzE,mBAAoBkQ,EAAkB,mBAAmB,KAAKA,CAAiB,EAC/E,UAAWoO,EAAe,UAAU,KAAKA,CAAc,EACvD,WAAYA,EAAe,WAAW,KAAKA,CAAc,EACzD,oBAAqBE,EAAoB,oBAAoB,KAAKA,CAAmB,EACrF,qBAAsBA,EAAoB,qBAAqB,KAAKA,CAAmB,EACvF,mBAAoBA,EAAoB,mBAAmB,KAAKA,CAAmB,EACnF,sBAAuBA,EAAoB,sBAAsB,KAAKA,CAAmB,EACzF,QAASD,EAAU,QAAQ,KAAKA,CAAS,EACzC,iBAAAzF,GACA,mBAAAQ,GACA,eAAgB,IAAM,QAAQ,QAAQ,EAAE,EACxC,UAAAmE,GACA,OAAQ,CAACpb,EAAUlwC,EAAO9V,IAAY8sC,GAAOkZ,EAAUhmD,EAAS8V,CAAK,EACrE,KAAM,CAACkwC,EAAUhmD,IAAY8+D,GAAK9Y,EAAUhmD,CAAO,CAC3D,CACA,CC/CA,IAAIsiE,GACA,OAAO,MAAU,MACnBA,GAA8B,SAAS3uB,EAAK,CAC1C,OAAO,MAAMA,CAAG,EAAE,KAAM4uB,GAAaA,EAAS,MAAM,CACtD,GAEF,MAAMC,EAAW,CACf,YAAY3sB,EAAK4sB,EAAY,CAC3B,KAAK,KAAO5sB,EACZ,KAAK,kBAAoB4sB,EAAW,iBACpC,KAAK,YAAcA,EAAW,WAC9B,KAAK,iBAAmBV,GAAmB,CACzC,iBAAkB,CAChB,oBAAqB,CAACW,EAAcvG,IAAa,CAC/C,MAAMz8C,EAAOy8C,EAAS,OAAO,EAAGA,EAAS,YAAY,GAAG,EAAI,CAAC,EAC7D,OAAOwG,GAAYjjD,EAAMgjD,CAAY,CACvC,CACR,EACM,qBAAsBD,EAAW,oBAAsBH,GAA8B,OACrF,mBAAoBza,GAAmB,MAC7C,CAAK,EACD,KAAK,iBAAiB,UAAU,KAAK,iBAAiB,CACxD,CACA,MAAM,aAAankC,EAAK,CACtB,IAAIsiC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAIsiC,EAAU,CACZ,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EACnE,OAAO,KAAK,iBAAiB,aAAaA,EAAU+N,EAAc,KAAK,iBAAiB,CAC1F,CACA,OAAO,QAAQ,QAAQ,EAAE,CAC3B,CACA,MAAM,WAAWrwC,EAAK3N,EAAU,CAC9B,IAAIiwC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,OAAO,KAET,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EACnE,OAAO,KAAK,iBAAiB,WAAWA,EAAUjwC,EAAUg+C,CAAY,CAC1E,CACA,MAAM,UAAUj4D,EAAM,CACpB,OAAO,KAAK,iBAAiB,UAAUA,CAAI,CAC7C,CACA,MAAM,QAAQ4nB,EAAK3N,EAAU,CAC3B,IAAIiwC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,OAAO,KAET,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EACnE,OAAO,KAAK,iBAAiB,QAAQA,EAAUjwC,EAAUg+C,CAAY,CACvE,CACA,MAAM,OAAOrwC,EAAK5N,EAAO9V,EAAS,CAChC,IAAIgmD,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,MAAO,CAAA,EAET,IAAI4c,EAAY,KAAK,iBAAiB,OAAO5c,EAAUlwC,EAAO9V,CAAO,EACrE,OAAO,QAAQ,QAAQ4iE,CAAS,CAClC,CACA,MAAM,YAAYl/C,EAAK,CACrB,OAAO,QAAQ,QAAQ,KAAK,iBAAiB,YAAYA,CAAG,CAAC,CAC/D,CACA,MAAM,oBAAoBA,EAAK,CAC7B,IAAIsiC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,MAAO,CAAA,EAET,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EAC/D6c,EAAU,KAAK,iBAAiB,qBAAqB7c,EAAU+N,CAAY,EAC/E,OAAO,QAAQ,QAAQ8O,CAAO,CAChC,CACA,MAAM,mBAAmBn/C,EAAK,CAC5B,IAAIsiC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,MAAO,CAAA,EAET,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EAC/D8c,EAAe,KAAK,iBAAiB,mBAAmB9c,EAAU+N,CAAY,EAClF,OAAO,QAAQ,QAAQ+O,CAAY,CACrC,CACA,MAAM,sBAAsBp/C,EAAK8nB,EAAO11B,EAAO,CAC7C,IAAIkwC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,MAAO,CAAA,EAET,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EAC/D+c,EAAqB,KAAK,iBAAiB,sBAC7C/c,EACA+N,EACAvoB,EACA11B,CACN,EACI,OAAO,QAAQ,QAAQitD,CAAkB,CAC3C,CACA,MAAM,iBAAiBr/C,EAAK5I,EAAS,CACnC,IAAIkrC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,MAAO,CAAA,EAET,IAAI13B,EAAS,KAAK,iBAAiB,iBAAiB03B,EAAUlrC,CAAO,EACrE,OAAO,QAAQ,QAAQwT,CAAM,CAC/B,CACA,MAAM,mBAAmB5K,EAAKw5C,EAAW,CACvC,IAAIlX,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,MAAO,CAAA,EAET,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EAC/D13B,EAAS,KAAK,iBAAiB,mBAAmB03B,EAAUkX,EAAWnJ,CAAY,EACvF,OAAO,QAAQ,QAAQzlC,CAAM,CAC/B,CACA,MAAM,kBAAkB5K,EAAK,CAC3B,IAAIsiC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,OAAO,KAET,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EACnE,OAAO,QAAQ,QAAQ+N,CAAY,CACrC,CACA,MAAM,mBAAmBrwC,EAAK,CAC5B,IAAIsiC,EAAW,KAAK,iBAAiBtiC,CAAG,EACxC,GAAI,CAACsiC,EACH,MAAO,CAAA,EAET,IAAI+N,EAAe,KAAK,iBAAiB,kBAAkB/N,CAAQ,EACnE,OAAO,QAAQ,QAAQ,KAAK,iBAAiB,mBAAmBA,EAAU+N,CAAY,CAAC,CACzF,CACA,iBAAiBrwC,EAAK,CACpB,IAAIs/C,EAAS,KAAK,KAAK,gBAAe,EACtC,QAAS7pD,KAAS6pD,EAChB,GAAI7pD,EAAM,IAAI,SAAQ,IAAOuK,EAC3B,OAAOmiC,GAAa,OAClBniC,EACA,KAAK,YACLvK,EAAM,QACNA,EAAM,SAAQ,CACxB,EAGI,OAAO,IACT,CACF,CACA,MAAM8pD,GAAQ,GACRC,GAAM,GACZ,SAASC,GAAepkD,EAAM,CAC5B,OAAOA,EAAK,WAAW,CAAC,IAAMkkD,EAChC,CACA,SAASN,GAAYS,EAAWrkD,EAAM,CACpC,GAAIokD,GAAepkD,CAAI,EAAG,CACxB,MAAM2E,EAAMV,GAAI,MAAMogD,CAAS,EACzB9W,EAAQvtC,EAAK,MAAM,GAAG,EAC5B,OAAO2E,EAAI,KAAK,CAAE,KAAM2/C,GAAc/W,CAAK,CAAC,CAAE,EAAE,SAAQ,CAC1D,CACA,OAAOgX,GAASF,EAAWrkD,CAAI,CACjC,CACA,SAASskD,GAAc/W,EAAO,CAC5B,MAAMiX,EAAW,CAAA,EACjB,UAAWhJ,KAAQjO,EACbiO,EAAK,SAAW,GAAKA,EAAK,SAAW,GAAKA,EAAK,WAAW,CAAC,IAAM2I,KAAgB3I,EAAK,SAAW,GAAKA,EAAK,WAAW,CAAC,IAAM2I,IAAO3I,EAAK,WAAW,CAAC,IAAM2I,GAC7JK,EAAS,IAAG,EAEZA,EAAS,KAAKhJ,CAAI,GAGlBjO,EAAM,OAAS,GAAKA,EAAMA,EAAM,OAAS,CAAC,EAAE,SAAW,GACzDiX,EAAS,KAAK,EAAE,EAElB,IAAI/kE,EAAM+kE,EAAS,KAAK,GAAG,EAC3B,OAAIjX,EAAM,CAAC,EAAE,SAAW,IACtB9tD,EAAM,IAAMA,GAEPA,CACT,CACA,SAAS8kE,GAASF,KAAchjD,EAAO,CACrC,MAAMsD,EAAMV,GAAI,MAAMogD,CAAS,EACzB9W,EAAQ5oC,EAAI,KAAK,MAAM,GAAG,EAChC,QAAS3E,KAAQqB,EACfksC,EAAM,KAAK,GAAGvtC,EAAK,MAAM,GAAG,CAAC,EAE/B,OAAO2E,EAAI,KAAK,CAAE,KAAM2/C,GAAc/W,CAAK,CAAC,CAAE,EAAE,SAAQ,CAC1D,CCrLA,KAAK,UAAY,IAAM,CACrB9/C,GAAW,CAACqpC,EAAK4sB,IACR,IAAID,GAAW3sB,EAAK4sB,CAAU,CACtC,CACH","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107]}