{
  "version": 3,
  "sources": ["../../../../node_modules/vscode-jsonrpc/lib/common/is.js", "../../../../node_modules/vscode-jsonrpc/lib/common/messages.js", "../../../../node_modules/vscode-jsonrpc/lib/common/linkedMap.js", "../../../../node_modules/vscode-jsonrpc/lib/common/disposable.js", "../../../../node_modules/vscode-jsonrpc/lib/common/ral.js", "../../../../node_modules/vscode-jsonrpc/lib/common/events.js", "../../../../node_modules/vscode-jsonrpc/lib/common/cancellation.js", "../../../../node_modules/vscode-jsonrpc/lib/common/sharedArrayCancellation.js", "../../../../node_modules/vscode-jsonrpc/lib/common/semaphore.js", "../../../../node_modules/vscode-jsonrpc/lib/common/messageReader.js", "../../../../node_modules/vscode-jsonrpc/lib/common/messageWriter.js", "../../../../node_modules/vscode-jsonrpc/lib/common/messageBuffer.js", "../../../../node_modules/vscode-jsonrpc/lib/common/connection.js", "../../../../node_modules/vscode-jsonrpc/lib/common/api.js", "../../../../node_modules/vscode-languageserver-types/lib/esm/main.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/messages.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/utils/is.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.implementation.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.typeDefinition.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.workspaceFolder.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.configuration.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.colorProvider.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.foldingRange.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.declaration.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.selectionRange.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.progress.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.callHierarchy.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.semanticTokens.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.showDocument.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.linkedEditingRange.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.fileOperations.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.moniker.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.typeHierarchy.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.inlineValue.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.inlayHint.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.diagnostic.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.notebook.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.inlineCompletion.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.textDocumentContent.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/protocol.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/connection.js", "../../../../node_modules/vscode-languageserver-protocol/lib/common/api.js", "../../../../node_modules/vscode-languageserver/lib/common/semanticTokens.js", "../../../../node_modules/vscode-languageserver/lib/common/inlineCompletion.proposed.js", "../../../../node_modules/vscode-languageserver/lib/common/textDocumentContent.js", "../../../../node_modules/vscode-languageserver/lib/common/textDocuments.js", "../../../../node_modules/vscode-languageserver/lib/common/notebook.js", "../../../../node_modules/vscode-languageserver/lib/common/utils/is.js", "../../../../node_modules/vscode-languageserver/lib/common/utils/uuid.js", "../../../../node_modules/vscode-languageserver/lib/common/progress.js", "../../../../node_modules/vscode-languageserver/lib/common/configuration.js", "../../../../node_modules/vscode-languageserver/lib/common/workspaceFolder.js", "../../../../node_modules/vscode-languageserver/lib/common/callHierarchy.js", "../../../../node_modules/vscode-languageserver/lib/common/showDocument.js", "../../../../node_modules/vscode-languageserver/lib/common/fileOperations.js", "../../../../node_modules/vscode-languageserver/lib/common/linkedEditingRange.js", "../../../../node_modules/vscode-languageserver/lib/common/typeHierarchy.js", "../../../../node_modules/vscode-languageserver/lib/common/inlineValue.js", "../../../../node_modules/vscode-languageserver/lib/common/foldingRange.js", "../../../../node_modules/vscode-languageserver/lib/common/inlayHint.js", "../../../../node_modules/vscode-languageserver/lib/common/diagnostic.js", "../../../../node_modules/vscode-languageserver/lib/common/moniker.js", "../../../../node_modules/vscode-languageserver/lib/common/server.js", "../../../../node_modules/vscode-languageserver/lib/common/api.js", "../../../../node_modules/vscode-languageserver/lib/node/files.js", "../../../../node_modules/vscode-jsonrpc/lib/node/ril.js", "../../../../node_modules/vscode-jsonrpc/lib/node/main.js", "../../../../node_modules/vscode-languageserver-protocol/lib/node/main.js", "../../../../node_modules/vscode-languageserver/lib/node/main.js", "../../../../packages/langium/src/lsp/completion/completion-provider.ts", "../../../../packages/langium/src/syntax-tree.ts", "../../../../packages/langium/src/languages/generated/ast.ts", "../../../../packages/langium/src/utils/ast-utils.ts", "../../../../packages/langium/src/utils/stream.ts", "../../../../packages/langium/src/utils/cst-utils.ts", "../../../../packages/langium/src/utils/errors.ts", "../../../../node_modules/@chevrotain/regexp-to-ast/src/utils.ts", "../../../../node_modules/@chevrotain/regexp-to-ast/src/character-classes.ts", "../../../../node_modules/@chevrotain/regexp-to-ast/src/regexp-parser.ts", "../../../../node_modules/@chevrotain/regexp-to-ast/src/base-regexp-visitor.ts", "../../../../packages/langium/src/utils/regexp-utils.ts", "../../../../packages/langium/src/utils/grammar-utils.ts", "../../../../packages/langium/src/lsp/completion/follow-element-computation.ts", "webpack://LIB/node_modules/path-browserify/index.js", "webpack://LIB/webpack/bootstrap", "webpack://LIB/webpack/runtime/define%20property%20getters", "webpack://LIB/webpack/runtime/hasOwnProperty%20shorthand", "webpack://LIB/webpack/runtime/make%20namespace%20object", "webpack://LIB/src/platform.ts", "webpack://LIB/src/uri.ts", "webpack://LIB/src/utils.ts", "../../../../packages/langium/src/utils/uri-utils.ts", "../../../../packages/langium/src/lsp/definition-provider.ts", "../../../../packages/langium/src/languages/grammar-config.ts", "../../../../node_modules/@chevrotain/utils/src/print.ts", "../../../../node_modules/@chevrotain/utils/src/timer.ts", "../../../../node_modules/@chevrotain/utils/src/to-fast-properties.ts", "../../../../node_modules/@chevrotain/gast/src/model.ts", "../../../../node_modules/@chevrotain/gast/src/visitor.ts", "../../../../node_modules/@chevrotain/gast/src/helpers.ts", "../../../../node_modules/chevrotain/src/parse/grammar/rest.ts", "../../../../node_modules/chevrotain/src/parse/grammar/first.ts", "../../../../node_modules/chevrotain/src/parse/constants.ts", "../../../../node_modules/chevrotain/src/parse/grammar/follow.ts", "../../../../node_modules/chevrotain/src/scan/reg_exp_parser.ts", "../../../../node_modules/chevrotain/src/scan/reg_exp.ts", "../../../../node_modules/chevrotain/src/scan/lexer.ts", "../../../../node_modules/chevrotain/src/scan/tokens.ts", "../../../../node_modules/chevrotain/src/scan/lexer_errors_public.ts", "../../../../node_modules/chevrotain/src/scan/lexer_public.ts", "../../../../node_modules/chevrotain/src/scan/tokens_public.ts", "../../../../node_modules/chevrotain/src/parse/errors_public.ts", "../../../../node_modules/chevrotain/src/parse/grammar/resolver.ts", "../../../../node_modules/chevrotain/src/parse/grammar/interpreter.ts", "../../../../node_modules/chevrotain/src/parse/grammar/lookahead.ts", "../../../../node_modules/chevrotain/src/parse/grammar/checks.ts", "../../../../node_modules/chevrotain/src/parse/grammar/gast/gast_resolver_public.ts", "../../../../node_modules/chevrotain/src/parse/exceptions_public.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/recoverable.ts", "../../../../node_modules/chevrotain/src/parse/grammar/keys.ts", "../../../../node_modules/chevrotain/src/parse/grammar/llk_lookahead.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/looksahead.ts", "../../../../node_modules/chevrotain/src/parse/cst/cst.ts", "../../../../node_modules/chevrotain/src/lang/lang_extensions.ts", "../../../../node_modules/chevrotain/src/parse/cst/cst_visitor.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/tree_builder.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/lexer_adapter.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/recognizer_api.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/recognizer_engine.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/error_handler.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/gast_recorder.ts", "../../../../node_modules/chevrotain/src/parse/parser/traits/perf_tracer.ts", "../../../../node_modules/chevrotain/src/parse/parser/utils/apply_mixins.ts", "../../../../node_modules/chevrotain/src/parse/parser/parser.ts", "../../../../node_modules/lodash-es/_arrayMap.js", "../../../../node_modules/lodash-es/_listCacheClear.js", "../../../../node_modules/lodash-es/eq.js", "../../../../node_modules/lodash-es/_assocIndexOf.js", "../../../../node_modules/lodash-es/_listCacheDelete.js", "../../../../node_modules/lodash-es/_listCacheGet.js", "../../../../node_modules/lodash-es/_listCacheHas.js", "../../../../node_modules/lodash-es/_listCacheSet.js", "../../../../node_modules/lodash-es/_ListCache.js", "../../../../node_modules/lodash-es/_stackClear.js", "../../../../node_modules/lodash-es/_stackDelete.js", "../../../../node_modules/lodash-es/_stackGet.js", "../../../../node_modules/lodash-es/_stackHas.js", "../../../../node_modules/lodash-es/_freeGlobal.js", "../../../../node_modules/lodash-es/_root.js", "../../../../node_modules/lodash-es/_Symbol.js", "../../../../node_modules/lodash-es/_getRawTag.js", "../../../../node_modules/lodash-es/_objectToString.js", "../../../../node_modules/lodash-es/_baseGetTag.js", "../../../../node_modules/lodash-es/isObject.js", "../../../../node_modules/lodash-es/isFunction.js", "../../../../node_modules/lodash-es/_coreJsData.js", "../../../../node_modules/lodash-es/_isMasked.js", "../../../../node_modules/lodash-es/_toSource.js", "../../../../node_modules/lodash-es/_baseIsNative.js", "../../../../node_modules/lodash-es/_getValue.js", "../../../../node_modules/lodash-es/_getNative.js", "../../../../node_modules/lodash-es/_Map.js", "../../../../node_modules/lodash-es/_nativeCreate.js", "../../../../node_modules/lodash-es/_hashClear.js", "../../../../node_modules/lodash-es/_hashDelete.js", "../../../../node_modules/lodash-es/_hashGet.js", "../../../../node_modules/lodash-es/_hashHas.js", "../../../../node_modules/lodash-es/_hashSet.js", "../../../../node_modules/lodash-es/_Hash.js", "../../../../node_modules/lodash-es/_mapCacheClear.js", "../../../../node_modules/lodash-es/_isKeyable.js", "../../../../node_modules/lodash-es/_getMapData.js", "../../../../node_modules/lodash-es/_mapCacheDelete.js", "../../../../node_modules/lodash-es/_mapCacheGet.js", "../../../../node_modules/lodash-es/_mapCacheHas.js", "../../../../node_modules/lodash-es/_mapCacheSet.js", "../../../../node_modules/lodash-es/_MapCache.js", "../../../../node_modules/lodash-es/_stackSet.js", "../../../../node_modules/lodash-es/_Stack.js", "../../../../node_modules/lodash-es/_setCacheAdd.js", "../../../../node_modules/lodash-es/_setCacheHas.js", "../../../../node_modules/lodash-es/_SetCache.js", "../../../../node_modules/lodash-es/_arraySome.js", "../../../../node_modules/lodash-es/_cacheHas.js", "../../../../node_modules/lodash-es/_equalArrays.js", "../../../../node_modules/lodash-es/_Uint8Array.js", "../../../../node_modules/lodash-es/_mapToArray.js", "../../../../node_modules/lodash-es/_setToArray.js", "../../../../node_modules/lodash-es/_equalByTag.js", "../../../../node_modules/lodash-es/_arrayPush.js", "../../../../node_modules/lodash-es/isArray.js", "../../../../node_modules/lodash-es/_baseGetAllKeys.js", "../../../../node_modules/lodash-es/_arrayFilter.js", "../../../../node_modules/lodash-es/stubArray.js", "../../../../node_modules/lodash-es/_getSymbols.js", "../../../../node_modules/lodash-es/_baseTimes.js", "../../../../node_modules/lodash-es/isObjectLike.js", "../../../../node_modules/lodash-es/_baseIsArguments.js", "../../../../node_modules/lodash-es/isArguments.js", "../../../../node_modules/lodash-es/stubFalse.js", "../../../../node_modules/lodash-es/isBuffer.js", "../../../../node_modules/lodash-es/_isIndex.js", "../../../../node_modules/lodash-es/isLength.js", "../../../../node_modules/lodash-es/_baseIsTypedArray.js", "../../../../node_modules/lodash-es/_baseUnary.js", "../../../../node_modules/lodash-es/_nodeUtil.js", "../../../../node_modules/lodash-es/isTypedArray.js", "../../../../node_modules/lodash-es/_arrayLikeKeys.js", "../../../../node_modules/lodash-es/_isPrototype.js", "../../../../node_modules/lodash-es/_overArg.js", "../../../../node_modules/lodash-es/_nativeKeys.js", "../../../../node_modules/lodash-es/_baseKeys.js", "../../../../node_modules/lodash-es/isArrayLike.js", "../../../../node_modules/lodash-es/keys.js", "../../../../node_modules/lodash-es/_getAllKeys.js", "../../../../node_modules/lodash-es/_equalObjects.js", "../../../../node_modules/lodash-es/_DataView.js", "../../../../node_modules/lodash-es/_Promise.js", "../../../../node_modules/lodash-es/_Set.js", "../../../../node_modules/lodash-es/_WeakMap.js", "../../../../node_modules/lodash-es/_getTag.js", "../../../../node_modules/lodash-es/_baseIsEqualDeep.js", "../../../../node_modules/lodash-es/_baseIsEqual.js", "../../../../node_modules/lodash-es/_baseIsMatch.js", "../../../../node_modules/lodash-es/_isStrictComparable.js", "../../../../node_modules/lodash-es/_getMatchData.js", "../../../../node_modules/lodash-es/_matchesStrictComparable.js", "../../../../node_modules/lodash-es/_baseMatches.js", "../../../../node_modules/lodash-es/isSymbol.js", "../../../../node_modules/lodash-es/_isKey.js", "../../../../node_modules/lodash-es/memoize.js", "../../../../node_modules/lodash-es/_memoizeCapped.js", "../../../../node_modules/lodash-es/_stringToPath.js", "../../../../node_modules/lodash-es/_baseToString.js", "../../../../node_modules/lodash-es/toString.js", "../../../../node_modules/lodash-es/_castPath.js", "../../../../node_modules/lodash-es/_toKey.js", "../../../../node_modules/lodash-es/_baseGet.js", "../../../../node_modules/lodash-es/get.js", "../../../../node_modules/lodash-es/_baseHasIn.js", "../../../../node_modules/lodash-es/_hasPath.js", "../../../../node_modules/lodash-es/hasIn.js", "../../../../node_modules/lodash-es/_baseMatchesProperty.js", "../../../../node_modules/lodash-es/identity.js", "../../../../node_modules/lodash-es/_baseProperty.js", "../../../../node_modules/lodash-es/_basePropertyDeep.js", "../../../../node_modules/lodash-es/property.js", "../../../../node_modules/lodash-es/_baseIteratee.js", "../../../../node_modules/lodash-es/_createBaseFor.js", "../../../../node_modules/lodash-es/_baseFor.js", "../../../../node_modules/lodash-es/_baseForOwn.js", "../../../../node_modules/lodash-es/_createBaseEach.js", "../../../../node_modules/lodash-es/_baseEach.js", "../../../../node_modules/lodash-es/_baseMap.js", "../../../../node_modules/lodash-es/map.js", "../../../../node_modules/lodash-es/_baseFilter.js", "../../../../node_modules/lodash-es/filter.js", "../../../../node_modules/chevrotain-allstar/src/atn.ts", "../../../../node_modules/chevrotain-allstar/src/dfa.ts", "../../../../node_modules/lodash-es/_baseExtremum.js", "../../../../node_modules/lodash-es/_baseLt.js", "../../../../node_modules/lodash-es/min.js", "../../../../node_modules/lodash-es/_isFlattenable.js", "../../../../node_modules/lodash-es/_baseFlatten.js", "../../../../node_modules/lodash-es/flatMap.js", "../../../../node_modules/lodash-es/_baseFindIndex.js", "../../../../node_modules/lodash-es/_baseIsNaN.js", "../../../../node_modules/lodash-es/_strictIndexOf.js", "../../../../node_modules/lodash-es/_baseIndexOf.js", "../../../../node_modules/lodash-es/_arrayIncludes.js", "../../../../node_modules/lodash-es/_arrayIncludesWith.js", "../../../../node_modules/lodash-es/noop.js", "../../../../node_modules/lodash-es/_createSet.js", "../../../../node_modules/lodash-es/_baseUniq.js", "../../../../node_modules/lodash-es/uniqBy.js", "../../../../node_modules/lodash-es/flatten.js", "../../../../node_modules/lodash-es/_arrayEach.js", "../../../../node_modules/lodash-es/_castFunction.js", "../../../../node_modules/lodash-es/forEach.js", "../../../../node_modules/lodash-es/isEmpty.js", "../../../../node_modules/lodash-es/_arrayReduce.js", "../../../../node_modules/lodash-es/_baseReduce.js", "../../../../node_modules/lodash-es/reduce.js", "../../../../node_modules/chevrotain-allstar/src/all-star-lookahead.ts", "../../../../packages/langium/src/parser/cst-node-builder.ts", "../../../../packages/langium/src/parser/langium-parser.ts", "../../../../packages/langium/src/parser/parser-builder-base.ts", "../../../../packages/langium/src/parser/completion-parser-builder.ts", "../../../../packages/langium/src/parser/langium-parser-builder.ts", "../../../../packages/langium/src/parser/token-builder.ts", "../../../../packages/langium/src/parser/value-converter.ts", "../../../../packages/langium/src/utils/cancellation.ts", "../../../../packages/langium/src/utils/promise-utils.ts", "../../../../node_modules/vscode-languageserver-textdocument/lib/esm/main.js", "../../../../packages/langium/src/workspace/documents.ts", "../../../../packages/langium/src/references/linker.ts", "../../../../packages/langium/src/references/name-provider.ts", "../../../../packages/langium/src/references/references.ts", "../../../../packages/langium/src/utils/collections.ts", "../../../../packages/langium/src/references/scope-computation.ts", "../../../../packages/langium/src/references/scope.ts", "../../../../packages/langium/src/utils/caching.ts", "../../../../packages/langium/src/references/scope-provider.ts", "../../../../packages/langium/src/serializer/json-serializer.ts", "../../../../packages/langium/src/service-registry.ts", "../../../../packages/langium/src/dependency-injection.ts", "../../../../packages/langium/src/documentation/comment-provider.ts", "../../../../packages/langium/src/documentation/jsdoc.ts", "../../../../packages/langium/src/documentation/documentation-provider.ts", "../../../../packages/langium/src/utils/event.ts", "../../../../packages/langium/src/parser/async-parser.ts", "../../../../packages/langium/src/parser/lexer.ts", "../../../../packages/langium/src/serializer/hydrator.ts", "../../../../packages/langium/src/utils/disposable.ts", "../../../../packages/langium/src/workspace/file-system-provider.ts", "../../../../packages/langium/src/utils/grammar-loader.ts", "../../../../packages/langium/src/workspace/ast-descriptions.ts", "../../../../packages/langium/src/workspace/ast-node-locator.ts", "../../../../packages/langium/src/workspace/configuration.ts", "../../../../packages/langium/src/workspace/document-builder.ts", "../../../../packages/langium/src/workspace/index-manager.ts", "../../../../packages/langium/src/workspace/workspace-lock.ts", "../../../../packages/langium/src/workspace/workspace-manager.ts", "../../../../packages/langium/src/validation/validation-registry.ts", "../../../../packages/langium/src/validation/document-validator.ts", "../../../../packages/langium/src/default-module.ts", "../../../../packages/langium/src/lsp/document-highlight-provider.ts", "../../../../packages/langium/src/lsp/document-symbol-provider.ts", "../../../../packages/langium/src/lsp/document-update-handler.ts", "../../../../packages/langium/src/lsp/folding-range-provider.ts", "../../../../packages/langium/src/lsp/fuzzy-matcher.ts", "../../../../packages/langium/src/lsp/hover-provider.ts", "../../../../packages/langium/src/lsp/language-server.ts", "../../../../packages/langium/src/lsp/semantic-token-provider.ts", "../../../../packages/langium/src/lsp/signature-help-provider.ts", "../../../../packages/langium/src/lsp/node-kind-provider.ts", "../../../../packages/langium/src/lsp/references-provider.ts", "../../../../packages/langium/src/lsp/rename-provider.ts", "../../../../packages/langium/src/lsp/workspace-symbol-provider.ts", "../../../../packages/langium/src/lsp/normalized-text-documents.ts", "../../../../packages/langium/src/lsp/default-lsp-module.ts", "../../../../packages/langium/src/lsp/formatter.ts", "../../../../packages/langium/src/node/node-file-system-provider.ts", "../../src/language-server/main.ts", "../../src/language-server/generated/ast.ts", "../../src/language-server/domain-model-formatter.ts", "../../src/language-server/domain-model-naming.ts", "../../src/language-server/domain-model-rename-refactoring.ts", "../../src/language-server/domain-model-scope.ts", "../../src/language-server/domain-model-validator.ts", "../../src/language-server/generated/grammar.ts", "../../src/language-server/generated/module.ts", "../../src/language-server/domain-model-module.ts"],
  "sourcesContent": ["\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.boolean = boolean;\nexports.string = string;\nexports.number = number;\nexports.error = error;\nexports.func = func;\nexports.array = array;\nexports.stringArray = stringArray;\nfunction boolean(value) {\n    return value === true || value === false;\n}\nfunction string(value) {\n    return typeof value === 'string' || value instanceof String;\n}\nfunction number(value) {\n    return typeof value === 'number' || value instanceof Number;\n}\nfunction error(value) {\n    return value instanceof Error;\n}\nfunction func(value) {\n    return typeof value === 'function';\n}\nfunction array(value) {\n    return Array.isArray(value);\n}\nfunction stringArray(value) {\n    return array(value) && value.every(elem => string(elem));\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Message = exports.NotificationType9 = exports.NotificationType8 = exports.NotificationType7 = exports.NotificationType6 = exports.NotificationType5 = exports.NotificationType4 = exports.NotificationType3 = exports.NotificationType2 = exports.NotificationType1 = exports.NotificationType0 = exports.NotificationType = exports.RequestType9 = exports.RequestType8 = exports.RequestType7 = exports.RequestType6 = exports.RequestType5 = exports.RequestType4 = exports.RequestType3 = exports.RequestType2 = exports.RequestType1 = exports.RequestType = exports.RequestType0 = exports.AbstractMessageSignature = exports.ParameterStructures = exports.ResponseError = exports.ErrorCodes = void 0;\nconst is = __importStar(require(\"./is\"));\n/**\n * Predefined error codes.\n */\nvar ErrorCodes;\n(function (ErrorCodes) {\n    // Defined by JSON RPC\n    ErrorCodes.ParseError = -32700;\n    ErrorCodes.InvalidRequest = -32600;\n    ErrorCodes.MethodNotFound = -32601;\n    ErrorCodes.InvalidParams = -32602;\n    ErrorCodes.InternalError = -32603;\n    /**\n     * This is the start range of JSON RPC reserved error codes.\n     * It doesn't denote a real error code. No application error codes should\n     * be defined between the start and end range. For backwards\n     * compatibility the `ServerNotInitialized` and the `UnknownErrorCode`\n     * are left in the range.\n     *\n     * @since 3.16.0\n    */\n    ErrorCodes.jsonrpcReservedErrorRangeStart = -32099;\n    /** @deprecated use  jsonrpcReservedErrorRangeStart */\n    ErrorCodes.serverErrorStart = -32099;\n    /**\n     * An error occurred when write a message to the transport layer.\n     */\n    ErrorCodes.MessageWriteError = -32099;\n    /**\n     * An error occurred when reading a message from the transport layer.\n     */\n    ErrorCodes.MessageReadError = -32098;\n    /**\n     * The connection got disposed or lost and all pending responses got\n     * rejected.\n     */\n    ErrorCodes.PendingResponseRejected = -32097;\n    /**\n     * The connection is inactive and a use of it failed.\n     */\n    ErrorCodes.ConnectionInactive = -32096;\n    /**\n     * Error code indicating that a server received a notification or\n     * request before the server has received the `initialize` request.\n     */\n    ErrorCodes.ServerNotInitialized = -32002;\n    ErrorCodes.UnknownErrorCode = -32001;\n    /**\n     * This is the end range of JSON RPC reserved error codes.\n     * It doesn't denote a real error code.\n     *\n     * @since 3.16.0\n    */\n    ErrorCodes.jsonrpcReservedErrorRangeEnd = -32000;\n    /** @deprecated use  jsonrpcReservedErrorRangeEnd */\n    ErrorCodes.serverErrorEnd = -32000;\n})(ErrorCodes || (exports.ErrorCodes = ErrorCodes = {}));\n/**\n * An error object return in a response in case a request\n * has failed.\n */\nclass ResponseError extends Error {\n    code;\n    data;\n    constructor(code, message, data) {\n        super(message);\n        this.code = is.number(code) ? code : ErrorCodes.UnknownErrorCode;\n        this.data = data;\n        Object.setPrototypeOf(this, ResponseError.prototype);\n    }\n    toJson() {\n        const result = {\n            code: this.code,\n            message: this.message\n        };\n        if (this.data !== undefined) {\n            result.data = this.data;\n        }\n        return result;\n    }\n}\nexports.ResponseError = ResponseError;\nclass ParameterStructures {\n    kind;\n    /**\n     * The parameter structure is automatically inferred on the number of parameters\n     * and the parameter type in case of a single param.\n     */\n    static auto = new ParameterStructures('auto');\n    /**\n     * Forces `byPosition` parameter structure. This is useful if you have a single\n     * parameter which has a literal type.\n     */\n    static byPosition = new ParameterStructures('byPosition');\n    /**\n     * Forces `byName` parameter structure. This is only useful when having a single\n     * parameter. The library will report errors if used with a different number of\n     * parameters.\n     */\n    static byName = new ParameterStructures('byName');\n    constructor(kind) {\n        this.kind = kind;\n    }\n    static is(value) {\n        return value === ParameterStructures.auto || value === ParameterStructures.byName || value === ParameterStructures.byPosition;\n    }\n    toString() {\n        return this.kind;\n    }\n}\nexports.ParameterStructures = ParameterStructures;\n/**\n * An abstract implementation of a MessageType.\n */\nclass AbstractMessageSignature {\n    method;\n    numberOfParams;\n    constructor(method, numberOfParams) {\n        this.method = method;\n        this.numberOfParams = numberOfParams;\n    }\n    get parameterStructures() {\n        return ParameterStructures.auto;\n    }\n}\nexports.AbstractMessageSignature = AbstractMessageSignature;\n/**\n * Classes to type request response pairs\n */\nclass RequestType0 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 0);\n    }\n}\nexports.RequestType0 = RequestType0;\nclass RequestType extends AbstractMessageSignature {\n    _parameterStructures;\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method, _parameterStructures = ParameterStructures.auto) {\n        super(method, 1);\n        this._parameterStructures = _parameterStructures;\n    }\n    get parameterStructures() {\n        return this._parameterStructures;\n    }\n}\nexports.RequestType = RequestType;\nclass RequestType1 extends AbstractMessageSignature {\n    _parameterStructures;\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method, _parameterStructures = ParameterStructures.auto) {\n        super(method, 1);\n        this._parameterStructures = _parameterStructures;\n    }\n    get parameterStructures() {\n        return this._parameterStructures;\n    }\n}\nexports.RequestType1 = RequestType1;\nclass RequestType2 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 2);\n    }\n}\nexports.RequestType2 = RequestType2;\nclass RequestType3 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 3);\n    }\n}\nexports.RequestType3 = RequestType3;\nclass RequestType4 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 4);\n    }\n}\nexports.RequestType4 = RequestType4;\nclass RequestType5 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 5);\n    }\n}\nexports.RequestType5 = RequestType5;\nclass RequestType6 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 6);\n    }\n}\nexports.RequestType6 = RequestType6;\nclass RequestType7 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 7);\n    }\n}\nexports.RequestType7 = RequestType7;\nclass RequestType8 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 8);\n    }\n}\nexports.RequestType8 = RequestType8;\nclass RequestType9 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 9);\n    }\n}\nexports.RequestType9 = RequestType9;\nclass NotificationType extends AbstractMessageSignature {\n    _parameterStructures;\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method, _parameterStructures = ParameterStructures.auto) {\n        super(method, 1);\n        this._parameterStructures = _parameterStructures;\n    }\n    get parameterStructures() {\n        return this._parameterStructures;\n    }\n}\nexports.NotificationType = NotificationType;\nclass NotificationType0 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 0);\n    }\n}\nexports.NotificationType0 = NotificationType0;\nclass NotificationType1 extends AbstractMessageSignature {\n    _parameterStructures;\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method, _parameterStructures = ParameterStructures.auto) {\n        super(method, 1);\n        this._parameterStructures = _parameterStructures;\n    }\n    get parameterStructures() {\n        return this._parameterStructures;\n    }\n}\nexports.NotificationType1 = NotificationType1;\nclass NotificationType2 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 2);\n    }\n}\nexports.NotificationType2 = NotificationType2;\nclass NotificationType3 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 3);\n    }\n}\nexports.NotificationType3 = NotificationType3;\nclass NotificationType4 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 4);\n    }\n}\nexports.NotificationType4 = NotificationType4;\nclass NotificationType5 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 5);\n    }\n}\nexports.NotificationType5 = NotificationType5;\nclass NotificationType6 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 6);\n    }\n}\nexports.NotificationType6 = NotificationType6;\nclass NotificationType7 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 7);\n    }\n}\nexports.NotificationType7 = NotificationType7;\nclass NotificationType8 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 8);\n    }\n}\nexports.NotificationType8 = NotificationType8;\nclass NotificationType9 extends AbstractMessageSignature {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    _;\n    constructor(method) {\n        super(method, 9);\n    }\n}\nexports.NotificationType9 = NotificationType9;\nvar Message;\n(function (Message) {\n    /**\n     * Tests if the given message is a request message\n     */\n    function isRequest(message) {\n        const candidate = message;\n        return candidate && is.string(candidate.method) && (is.string(candidate.id) || is.number(candidate.id));\n    }\n    Message.isRequest = isRequest;\n    /**\n     * Tests if the given message is a notification message\n     */\n    function isNotification(message) {\n        const candidate = message;\n        return candidate && is.string(candidate.method) && message.id === void 0;\n    }\n    Message.isNotification = isNotification;\n    /**\n     * Tests if the given message is a response message\n     */\n    function isResponse(message) {\n        const candidate = message;\n        return candidate && (candidate.result !== void 0 || !!candidate.error) && (is.string(candidate.id) || is.number(candidate.id) || candidate.id === null);\n    }\n    Message.isResponse = isResponse;\n})(Message || (exports.Message = Message = {}));\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.LRUCache = exports.LinkedMap = exports.Touch = void 0;\nvar Touch;\n(function (Touch) {\n    Touch.None = 0;\n    Touch.First = 1;\n    Touch.AsOld = Touch.First;\n    Touch.Last = 2;\n    Touch.AsNew = Touch.Last;\n})(Touch || (exports.Touch = Touch = {}));\nclass LinkedMap {\n    [Symbol.toStringTag] = 'LinkedMap';\n    _map;\n    _head;\n    _tail;\n    _size;\n    _state;\n    constructor() {\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    before(key) {\n        const item = this._map.get(key);\n        return item ? item.previous?.value : undefined;\n    }\n    after(key) {\n        const item = this._map.get(key);\n        return item ? item.next?.value : undefined;\n    }\n    has(key) {\n        return this._map.has(key);\n    }\n    get(key, touch = Touch.None) {\n        const item = this._map.get(key);\n        if (!item) {\n            return undefined;\n        }\n        if (touch !== Touch.None) {\n            this.touch(item, touch);\n        }\n        return item.value;\n    }\n    set(key, value, touch = Touch.None) {\n        let item = this._map.get(key);\n        if (item) {\n            item.value = value;\n            if (touch !== Touch.None) {\n                this.touch(item, touch);\n            }\n        }\n        else {\n            item = { key, value, next: undefined, previous: undefined };\n            switch (touch) {\n                case Touch.None:\n                    this.addItemLast(item);\n                    break;\n                case Touch.First:\n                    this.addItemFirst(item);\n                    break;\n                case Touch.Last:\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 state = this._state;\n        let current = this._head;\n        const iterator = {\n            [Symbol.iterator]: () => {\n                return iterator;\n            },\n            next: () => {\n                if (this._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 state = this._state;\n        let current = this._head;\n        const iterator = {\n            [Symbol.iterator]: () => {\n                return iterator;\n            },\n            next: () => {\n                if (this._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 state = this._state;\n        let current = this._head;\n        const iterator = {\n            [Symbol.iterator]: () => {\n                return iterator;\n            },\n            next: () => {\n                if (this._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    [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    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 happened if size === 1 which is handle\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 happened if size === 1 which is handle\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 !== Touch.First && touch !== Touch.Last)) {\n            return;\n        }\n        if (touch === Touch.First) {\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 === Touch.Last) {\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}\nexports.LinkedMap = LinkedMap;\nclass LRUCache extends LinkedMap {\n    _limit;\n    _ratio;\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 ratio() {\n        return this._ratio;\n    }\n    set ratio(ratio) {\n        this._ratio = Math.min(Math.max(0, ratio), 1);\n        this.checkTrim();\n    }\n    get(key, touch = Touch.AsNew) {\n        return super.get(key, touch);\n    }\n    peek(key) {\n        return super.get(key, Touch.None);\n    }\n    set(key, value) {\n        super.set(key, value, Touch.Last);\n        this.checkTrim();\n        return this;\n    }\n    checkTrim() {\n        if (this.size > this._limit) {\n            this.trimOld(Math.round(this._limit * this._ratio));\n        }\n    }\n}\nexports.LRUCache = LRUCache;\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Disposable = void 0;\nvar Disposable;\n(function (Disposable) {\n    function create(func) {\n        return {\n            dispose: func\n        };\n    }\n    Disposable.create = create;\n})(Disposable || (exports.Disposable = Disposable = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nlet _ral;\nfunction RAL() {\n    if (_ral === undefined) {\n        throw new Error(`No runtime abstraction layer installed`);\n    }\n    return _ral;\n}\n(function (RAL) {\n    function install(ral) {\n        if (ral === undefined) {\n            throw new Error(`No runtime abstraction layer provided`);\n        }\n        _ral = ral;\n    }\n    RAL.install = install;\n})(RAL || (RAL = {}));\nexports.default = RAL;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Emitter = exports.Event = void 0;\nconst ral_1 = __importDefault(require(\"./ral\"));\nvar Event;\n(function (Event) {\n    const _disposable = { dispose() { } };\n    Event.None = function () { return _disposable; };\n})(Event || (exports.Event = Event = {}));\nclass CallbackList {\n    _callbacks;\n    _contexts;\n    add(callback, context = null, bucket) {\n        if (!this._callbacks) {\n            this._callbacks = [];\n            this._contexts = [];\n        }\n        this._callbacks.push(callback);\n        this._contexts.push(context);\n        if (Array.isArray(bucket)) {\n            bucket.push({ dispose: () => this.remove(callback, context) });\n        }\n    }\n    remove(callback, context = null) {\n        if (!this._callbacks) {\n            return;\n        }\n        let foundCallbackWithDifferentContext = false;\n        for (let i = 0, len = this._callbacks.length; i < len; i++) {\n            if (this._callbacks[i] === callback) {\n                if (this._contexts[i] === context) {\n                    // callback & context match => remove it\n                    this._callbacks.splice(i, 1);\n                    this._contexts.splice(i, 1);\n                    return;\n                }\n                else {\n                    foundCallbackWithDifferentContext = true;\n                }\n            }\n        }\n        if (foundCallbackWithDifferentContext) {\n            throw new Error('When adding a listener with a context, you should remove it with the same context');\n        }\n    }\n    invoke(...args) {\n        if (!this._callbacks) {\n            return [];\n        }\n        const ret = [], callbacks = this._callbacks.slice(0), contexts = this._contexts.slice(0);\n        for (let i = 0, len = callbacks.length; i < len; i++) {\n            try {\n                ret.push(callbacks[i].apply(contexts[i], args));\n            }\n            catch (e) {\n                (0, ral_1.default)().console.error(e);\n            }\n        }\n        return ret;\n    }\n    isEmpty() {\n        return !this._callbacks || this._callbacks.length === 0;\n    }\n    dispose() {\n        this._callbacks = undefined;\n        this._contexts = undefined;\n    }\n}\nclass Emitter {\n    _options;\n    static _noop = function () { };\n    _event;\n    _callbacks;\n    constructor(_options) {\n        this._options = _options;\n    }\n    /**\n     * For the public to allow to subscribe\n     * to events from this Emitter\n     */\n    get event() {\n        if (!this._event) {\n            this._event = (listener, thisArgs, disposables) => {\n                if (!this._callbacks) {\n                    this._callbacks = new CallbackList();\n                }\n                if (this._options && this._options.onFirstListenerAdd && this._callbacks.isEmpty()) {\n                    this._options.onFirstListenerAdd(this);\n                }\n                this._callbacks.add(listener, thisArgs);\n                const result = {\n                    dispose: () => {\n                        if (!this._callbacks) {\n                            // disposable is disposed after emitter is disposed.\n                            return;\n                        }\n                        this._callbacks.remove(listener, thisArgs);\n                        result.dispose = Emitter._noop;\n                        if (this._options && this._options.onLastListenerRemove && this._callbacks.isEmpty()) {\n                            this._options.onLastListenerRemove(this);\n                        }\n                    }\n                };\n                if (Array.isArray(disposables)) {\n                    disposables.push(result);\n                }\n                return result;\n            };\n        }\n        return this._event;\n    }\n    /**\n     * To be kept private to fire an event to\n     * subscribers\n     */\n    fire(event) {\n        if (this._callbacks) {\n            this._callbacks.invoke.call(this._callbacks, event);\n        }\n    }\n    dispose() {\n        if (this._callbacks) {\n            this._callbacks.dispose();\n            this._callbacks = undefined;\n        }\n    }\n}\nexports.Emitter = Emitter;\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CancellationTokenSource = exports.CancellationToken = void 0;\nconst ral_1 = __importDefault(require(\"./ral\"));\nconst Is = __importStar(require(\"./is\"));\nconst events_1 = require(\"./events\");\nvar CancellationToken;\n(function (CancellationToken) {\n    CancellationToken.None = Object.freeze({\n        isCancellationRequested: false,\n        onCancellationRequested: events_1.Event.None\n    });\n    CancellationToken.Cancelled = Object.freeze({\n        isCancellationRequested: true,\n        onCancellationRequested: events_1.Event.None\n    });\n    function is(value) {\n        const candidate = value;\n        return candidate && (candidate === CancellationToken.None\n            || candidate === CancellationToken.Cancelled\n            || (Is.boolean(candidate.isCancellationRequested) && !!candidate.onCancellationRequested));\n    }\n    CancellationToken.is = is;\n})(CancellationToken || (exports.CancellationToken = CancellationToken = {}));\nconst shortcutEvent = Object.freeze(function (callback, context) {\n    const handle = (0, ral_1.default)().timer.setTimeout(callback.bind(context), 0);\n    return { dispose() { handle.dispose(); } };\n});\nclass MutableToken {\n    _isCancelled = false;\n    _emitter;\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 events_1.Emitter();\n        }\n        return this._emitter.event;\n    }\n    dispose() {\n        if (this._emitter) {\n            this._emitter.dispose();\n            this._emitter = undefined;\n        }\n    }\n}\nclass CancellationTokenSource {\n    _token;\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 {\n            this._token.cancel();\n        }\n    }\n    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}\nexports.CancellationTokenSource = CancellationTokenSource;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SharedArrayReceiverStrategy = exports.SharedArraySenderStrategy = void 0;\nconst cancellation_1 = require(\"./cancellation\");\nvar CancellationState;\n(function (CancellationState) {\n    CancellationState.Continue = 0;\n    CancellationState.Cancelled = 1;\n})(CancellationState || (CancellationState = {}));\nclass SharedArraySenderStrategy {\n    buffers;\n    constructor() {\n        this.buffers = new Map();\n    }\n    enableCancellation(request) {\n        if (request.id === null) {\n            return;\n        }\n        const buffer = new SharedArrayBuffer(4);\n        const data = new Int32Array(buffer, 0, 1);\n        data[0] = CancellationState.Continue;\n        this.buffers.set(request.id, buffer);\n        request.$cancellationData = buffer;\n    }\n    async sendCancellation(_conn, id) {\n        const buffer = this.buffers.get(id);\n        if (buffer === undefined) {\n            return;\n        }\n        const data = new Int32Array(buffer, 0, 1);\n        Atomics.store(data, 0, CancellationState.Cancelled);\n    }\n    cleanup(id) {\n        this.buffers.delete(id);\n    }\n    dispose() {\n        this.buffers.clear();\n    }\n}\nexports.SharedArraySenderStrategy = SharedArraySenderStrategy;\nclass SharedArrayBufferCancellationToken {\n    data;\n    constructor(buffer) {\n        this.data = new Int32Array(buffer, 0, 1);\n    }\n    get isCancellationRequested() {\n        return Atomics.load(this.data, 0) === CancellationState.Cancelled;\n    }\n    get onCancellationRequested() {\n        throw new Error(`Cancellation over SharedArrayBuffer doesn't support cancellation events`);\n    }\n}\nclass SharedArrayBufferCancellationTokenSource {\n    token;\n    constructor(buffer) {\n        this.token = new SharedArrayBufferCancellationToken(buffer);\n    }\n    cancel() {\n    }\n    dispose() {\n    }\n}\nclass SharedArrayReceiverStrategy {\n    kind = 'request';\n    createCancellationTokenSource(request) {\n        const buffer = request.$cancellationData;\n        if (buffer === undefined) {\n            return new cancellation_1.CancellationTokenSource();\n        }\n        return new SharedArrayBufferCancellationTokenSource(buffer);\n    }\n}\nexports.SharedArrayReceiverStrategy = SharedArrayReceiverStrategy;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Semaphore = void 0;\nconst ral_1 = __importDefault(require(\"./ral\"));\nclass Semaphore {\n    _capacity;\n    _active;\n    _waiting;\n    constructor(capacity = 1) {\n        if (capacity <= 0) {\n            throw new Error('Capacity must be greater than 0');\n        }\n        this._capacity = capacity;\n        this._active = 0;\n        this._waiting = [];\n    }\n    lock(thunk) {\n        return new Promise((resolve, reject) => {\n            this._waiting.push({ thunk, resolve, reject });\n            this.runNext();\n        });\n    }\n    get active() {\n        return this._active;\n    }\n    runNext() {\n        if (this._waiting.length === 0 || this._active === this._capacity) {\n            return;\n        }\n        (0, ral_1.default)().timer.setImmediate(() => this.doRunNext());\n    }\n    doRunNext() {\n        if (this._waiting.length === 0 || this._active === this._capacity) {\n            return;\n        }\n        const next = this._waiting.shift();\n        this._active++;\n        if (this._active > this._capacity) {\n            throw new Error(`Too many thunks active`);\n        }\n        try {\n            const result = next.thunk();\n            if (result instanceof Promise) {\n                result.then((value) => {\n                    this._active--;\n                    next.resolve(value);\n                    this.runNext();\n                }, (err) => {\n                    this._active--;\n                    next.reject(err);\n                    this.runNext();\n                });\n            }\n            else {\n                this._active--;\n                next.resolve(result);\n                this.runNext();\n            }\n        }\n        catch (err) {\n            this._active--;\n            next.reject(err);\n            this.runNext();\n        }\n    }\n}\nexports.Semaphore = Semaphore;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ReadableStreamMessageReader = exports.AbstractMessageReader = exports.MessageReader = void 0;\nconst ral_1 = __importDefault(require(\"./ral\"));\nconst Is = __importStar(require(\"./is\"));\nconst events_1 = require(\"./events\");\nconst semaphore_1 = require(\"./semaphore\");\nvar MessageReader;\n(function (MessageReader) {\n    function is(value) {\n        const candidate = value;\n        return candidate && Is.func(candidate.listen) && Is.func(candidate.dispose) &&\n            Is.func(candidate.onError) && Is.func(candidate.onClose) && Is.func(candidate.onPartialMessage);\n    }\n    MessageReader.is = is;\n})(MessageReader || (exports.MessageReader = MessageReader = {}));\nclass AbstractMessageReader {\n    errorEmitter;\n    closeEmitter;\n    partialMessageEmitter;\n    constructor() {\n        this.errorEmitter = new events_1.Emitter();\n        this.closeEmitter = new events_1.Emitter();\n        this.partialMessageEmitter = new events_1.Emitter();\n    }\n    dispose() {\n        this.errorEmitter.dispose();\n        this.closeEmitter.dispose();\n        this.partialMessageEmitter.dispose();\n    }\n    get onError() {\n        return this.errorEmitter.event;\n    }\n    fireError(error) {\n        this.errorEmitter.fire(this.asError(error));\n    }\n    get onClose() {\n        return this.closeEmitter.event;\n    }\n    fireClose() {\n        this.closeEmitter.fire(undefined);\n    }\n    get onPartialMessage() {\n        return this.partialMessageEmitter.event;\n    }\n    firePartialMessage(info) {\n        this.partialMessageEmitter.fire(info);\n    }\n    asError(error) {\n        if (error instanceof Error) {\n            return error;\n        }\n        else {\n            return new Error(`Reader received error. Reason: ${Is.string(error.message) ? error.message : 'unknown'}`);\n        }\n    }\n}\nexports.AbstractMessageReader = AbstractMessageReader;\nvar ResolvedMessageReaderOptions;\n(function (ResolvedMessageReaderOptions) {\n    function fromOptions(options) {\n        let charset;\n        let result;\n        let contentDecoder;\n        const contentDecoders = new Map();\n        let contentTypeDecoder;\n        const contentTypeDecoders = new Map();\n        if (options === undefined || typeof options === 'string') {\n            charset = options ?? 'utf-8';\n        }\n        else {\n            charset = options.charset ?? 'utf-8';\n            if (options.contentDecoder !== undefined) {\n                contentDecoder = options.contentDecoder;\n                contentDecoders.set(contentDecoder.name, contentDecoder);\n            }\n            if (options.contentDecoders !== undefined) {\n                for (const decoder of options.contentDecoders) {\n                    contentDecoders.set(decoder.name, decoder);\n                }\n            }\n            if (options.contentTypeDecoder !== undefined) {\n                contentTypeDecoder = options.contentTypeDecoder;\n                contentTypeDecoders.set(contentTypeDecoder.name, contentTypeDecoder);\n            }\n            if (options.contentTypeDecoders !== undefined) {\n                for (const decoder of options.contentTypeDecoders) {\n                    contentTypeDecoders.set(decoder.name, decoder);\n                }\n            }\n        }\n        if (contentTypeDecoder === undefined) {\n            contentTypeDecoder = (0, ral_1.default)().applicationJson.decoder;\n            contentTypeDecoders.set(contentTypeDecoder.name, contentTypeDecoder);\n        }\n        return { charset, contentDecoder, contentDecoders, contentTypeDecoder, contentTypeDecoders };\n    }\n    ResolvedMessageReaderOptions.fromOptions = fromOptions;\n})(ResolvedMessageReaderOptions || (ResolvedMessageReaderOptions = {}));\nclass ReadableStreamMessageReader extends AbstractMessageReader {\n    readable;\n    options;\n    callback;\n    nextMessageLength;\n    messageToken;\n    buffer;\n    partialMessageTimer;\n    _partialMessageTimeout;\n    readSemaphore;\n    constructor(readable, options) {\n        super();\n        this.readable = readable;\n        this.options = ResolvedMessageReaderOptions.fromOptions(options);\n        this.buffer = (0, ral_1.default)().messageBuffer.create(this.options.charset);\n        this._partialMessageTimeout = 10000;\n        this.nextMessageLength = -1;\n        this.messageToken = 0;\n        this.readSemaphore = new semaphore_1.Semaphore(1);\n    }\n    set partialMessageTimeout(timeout) {\n        this._partialMessageTimeout = timeout;\n    }\n    get partialMessageTimeout() {\n        return this._partialMessageTimeout;\n    }\n    listen(callback) {\n        this.nextMessageLength = -1;\n        this.messageToken = 0;\n        this.partialMessageTimer = undefined;\n        this.callback = callback;\n        const result = this.readable.onData((data) => {\n            this.onData(data);\n        });\n        this.readable.onError((error) => this.fireError(error));\n        this.readable.onClose(() => this.fireClose());\n        return result;\n    }\n    onData(data) {\n        try {\n            this.buffer.append(data);\n            while (true) {\n                if (this.nextMessageLength === -1) {\n                    const headers = this.buffer.tryReadHeaders(true);\n                    if (!headers) {\n                        return;\n                    }\n                    const contentLength = headers.get('content-length');\n                    if (!contentLength) {\n                        this.fireError(new Error(`Header must provide a Content-Length property.\\n${JSON.stringify(Object.fromEntries(headers))}`));\n                        return;\n                    }\n                    const length = parseInt(contentLength);\n                    if (isNaN(length)) {\n                        this.fireError(new Error(`Content-Length value must be a number. Got ${contentLength}`));\n                        return;\n                    }\n                    this.nextMessageLength = length;\n                }\n                const body = this.buffer.tryReadBody(this.nextMessageLength);\n                if (body === undefined) {\n                    /** We haven't received the full message yet. */\n                    this.setPartialMessageTimer();\n                    return;\n                }\n                this.clearPartialMessageTimer();\n                this.nextMessageLength = -1;\n                // Make sure that we convert one received message after the\n                // other. Otherwise it could happen that a decoding of a second\n                // smaller message finished before the decoding of a first larger\n                // message and then we would deliver the second message first.\n                this.readSemaphore.lock(async () => {\n                    const bytes = this.options.contentDecoder !== undefined\n                        ? await this.options.contentDecoder.decode(body)\n                        : body;\n                    const message = await this.options.contentTypeDecoder.decode(bytes, this.options);\n                    this.callback(message);\n                }).catch((error) => {\n                    this.fireError(error);\n                });\n            }\n        }\n        catch (error) {\n            this.fireError(error);\n        }\n    }\n    clearPartialMessageTimer() {\n        if (this.partialMessageTimer) {\n            this.partialMessageTimer.dispose();\n            this.partialMessageTimer = undefined;\n        }\n    }\n    setPartialMessageTimer() {\n        this.clearPartialMessageTimer();\n        if (this._partialMessageTimeout <= 0) {\n            return;\n        }\n        this.partialMessageTimer = (0, ral_1.default)().timer.setTimeout((token, timeout) => {\n            this.partialMessageTimer = undefined;\n            if (token === this.messageToken) {\n                this.firePartialMessage({ messageToken: token, waitingTime: timeout });\n                this.setPartialMessageTimer();\n            }\n        }, this._partialMessageTimeout, this.messageToken, this._partialMessageTimeout);\n    }\n}\nexports.ReadableStreamMessageReader = ReadableStreamMessageReader;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WriteableStreamMessageWriter = exports.AbstractMessageWriter = exports.MessageWriter = void 0;\nconst ral_1 = __importDefault(require(\"./ral\"));\nconst Is = __importStar(require(\"./is\"));\nconst semaphore_1 = require(\"./semaphore\");\nconst events_1 = require(\"./events\");\nconst ContentLength = 'Content-Length: ';\nconst CRLF = '\\r\\n';\nvar MessageWriter;\n(function (MessageWriter) {\n    function is(value) {\n        const candidate = value;\n        return candidate && Is.func(candidate.dispose) && Is.func(candidate.onClose) &&\n            Is.func(candidate.onError) && Is.func(candidate.write);\n    }\n    MessageWriter.is = is;\n})(MessageWriter || (exports.MessageWriter = MessageWriter = {}));\nclass AbstractMessageWriter {\n    errorEmitter;\n    closeEmitter;\n    constructor() {\n        this.errorEmitter = new events_1.Emitter();\n        this.closeEmitter = new events_1.Emitter();\n    }\n    dispose() {\n        this.errorEmitter.dispose();\n        this.closeEmitter.dispose();\n    }\n    get onError() {\n        return this.errorEmitter.event;\n    }\n    fireError(error, message, count) {\n        this.errorEmitter.fire([this.asError(error), message, count]);\n    }\n    get onClose() {\n        return this.closeEmitter.event;\n    }\n    fireClose() {\n        this.closeEmitter.fire(undefined);\n    }\n    asError(error) {\n        if (error instanceof Error) {\n            return error;\n        }\n        else {\n            return new Error(`Writer received error. Reason: ${Is.string(error.message) ? error.message : 'unknown'}`);\n        }\n    }\n}\nexports.AbstractMessageWriter = AbstractMessageWriter;\nvar ResolvedMessageWriterOptions;\n(function (ResolvedMessageWriterOptions) {\n    function fromOptions(options) {\n        if (options === undefined || typeof options === 'string') {\n            return { charset: options ?? 'utf-8', contentTypeEncoder: (0, ral_1.default)().applicationJson.encoder };\n        }\n        else {\n            return { charset: options.charset ?? 'utf-8', contentEncoder: options.contentEncoder, contentTypeEncoder: options.contentTypeEncoder ?? (0, ral_1.default)().applicationJson.encoder };\n        }\n    }\n    ResolvedMessageWriterOptions.fromOptions = fromOptions;\n})(ResolvedMessageWriterOptions || (ResolvedMessageWriterOptions = {}));\nclass WriteableStreamMessageWriter extends AbstractMessageWriter {\n    writable;\n    options;\n    errorCount;\n    writeSemaphore;\n    constructor(writable, options) {\n        super();\n        this.writable = writable;\n        this.options = ResolvedMessageWriterOptions.fromOptions(options);\n        this.errorCount = 0;\n        this.writeSemaphore = new semaphore_1.Semaphore(1);\n        this.writable.onError((error) => this.fireError(error));\n        this.writable.onClose(() => this.fireClose());\n    }\n    async write(msg) {\n        return this.writeSemaphore.lock(async () => {\n            const payload = this.options.contentTypeEncoder.encode(msg, this.options).then((buffer) => {\n                if (this.options.contentEncoder !== undefined) {\n                    return this.options.contentEncoder.encode(buffer);\n                }\n                else {\n                    return buffer;\n                }\n            });\n            return payload.then((buffer) => {\n                const headers = [];\n                headers.push(ContentLength, buffer.byteLength.toString(), CRLF);\n                headers.push(CRLF);\n                return this.doWrite(msg, headers, buffer);\n            }, (error) => {\n                this.fireError(error);\n                throw error;\n            });\n        });\n    }\n    async doWrite(msg, headers, data) {\n        try {\n            await this.writable.write(headers.join(''), 'ascii');\n            return this.writable.write(data);\n        }\n        catch (error) {\n            this.handleError(error, msg);\n            return Promise.reject(error);\n        }\n    }\n    handleError(error, msg) {\n        this.errorCount++;\n        this.fireError(error, msg, this.errorCount);\n    }\n    end() {\n        this.writable.end();\n    }\n}\nexports.WriteableStreamMessageWriter = WriteableStreamMessageWriter;\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AbstractMessageBuffer = void 0;\nconst CR = 13;\nconst LF = 10;\nconst CRLF = '\\r\\n';\nclass AbstractMessageBuffer {\n    _encoding;\n    _chunks;\n    _totalLength;\n    constructor(encoding = 'utf-8') {\n        this._encoding = encoding;\n        this._chunks = [];\n        this._totalLength = 0;\n    }\n    get encoding() {\n        return this._encoding;\n    }\n    append(chunk) {\n        const toAppend = typeof chunk === 'string' ? this.fromString(chunk, this._encoding) : chunk;\n        this._chunks.push(toAppend);\n        this._totalLength += toAppend.byteLength;\n    }\n    tryReadHeaders(lowerCaseKeys = false) {\n        if (this._chunks.length === 0) {\n            return undefined;\n        }\n        let state = 0;\n        let chunkIndex = 0;\n        let offset = 0;\n        let chunkBytesRead = 0;\n        row: while (chunkIndex < this._chunks.length) {\n            const chunk = this._chunks[chunkIndex];\n            offset = 0;\n            while (offset < chunk.length) {\n                const value = chunk[offset];\n                switch (value) {\n                    case CR:\n                        switch (state) {\n                            case 0:\n                                state = 1;\n                                break;\n                            case 2:\n                                state = 3;\n                                break;\n                            default:\n                                state = 0;\n                        }\n                        break;\n                    case LF:\n                        switch (state) {\n                            case 1:\n                                state = 2;\n                                break;\n                            case 3:\n                                state = 4;\n                                offset++;\n                                break row;\n                            default:\n                                state = 0;\n                        }\n                        break;\n                    default:\n                        state = 0;\n                }\n                offset++;\n            }\n            chunkBytesRead += chunk.byteLength;\n            chunkIndex++;\n        }\n        if (state !== 4) {\n            return undefined;\n        }\n        // The buffer contains the two CRLF at the end. So we will\n        // have two empty lines after the split at the end as well.\n        const buffer = this._read(chunkBytesRead + offset);\n        const result = new Map();\n        const headers = this.toString(buffer, 'ascii').split(CRLF);\n        if (headers.length < 2) {\n            return result;\n        }\n        for (let i = 0; i < headers.length - 2; i++) {\n            const header = headers[i];\n            const index = header.indexOf(':');\n            if (index === -1) {\n                throw new Error(`Message header must separate key and value using ':'\\n${header}`);\n            }\n            const key = header.substr(0, index);\n            const value = header.substr(index + 1).trim();\n            result.set(lowerCaseKeys ? key.toLowerCase() : key, value);\n        }\n        return result;\n    }\n    tryReadBody(length) {\n        if (this._totalLength < length) {\n            return undefined;\n        }\n        return this._read(length);\n    }\n    get numberOfBytes() {\n        return this._totalLength;\n    }\n    _read(byteCount) {\n        if (byteCount === 0) {\n            return this.emptyBuffer();\n        }\n        if (byteCount > this._totalLength) {\n            throw new Error(`Cannot read so many bytes!`);\n        }\n        if (this._chunks[0].byteLength === byteCount) {\n            // super fast path, precisely first chunk must be returned\n            const chunk = this._chunks[0];\n            this._chunks.shift();\n            this._totalLength -= byteCount;\n            return this.asNative(chunk);\n        }\n        if (this._chunks[0].byteLength > byteCount) {\n            // fast path, the reading is entirely within the first chunk\n            const chunk = this._chunks[0];\n            const result = this.asNative(chunk, byteCount);\n            this._chunks[0] = chunk.slice(byteCount);\n            this._totalLength -= byteCount;\n            return result;\n        }\n        const result = this.allocNative(byteCount);\n        let resultOffset = 0;\n        const chunkIndex = 0;\n        while (byteCount > 0) {\n            const chunk = this._chunks[chunkIndex];\n            if (chunk.byteLength > byteCount) {\n                // this chunk will survive\n                const chunkPart = chunk.slice(0, byteCount);\n                result.set(chunkPart, resultOffset);\n                resultOffset += byteCount;\n                this._chunks[chunkIndex] = chunk.slice(byteCount);\n                this._totalLength -= byteCount;\n                byteCount -= byteCount;\n            }\n            else {\n                // this chunk will be entirely read\n                result.set(chunk, resultOffset);\n                resultOffset += chunk.byteLength;\n                this._chunks.shift();\n                this._totalLength -= chunk.byteLength;\n                byteCount -= chunk.byteLength;\n            }\n        }\n        return result;\n    }\n}\nexports.AbstractMessageBuffer = AbstractMessageBuffer;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\n/// <reference path=\"../../typings/thenable.d.ts\" preserve=\"true\"/>\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ConnectionOptions = exports.MessageStrategy = exports.CancellationStrategy = exports.CancellationSenderStrategy = exports.CancellationReceiverStrategy = exports.RequestCancellationReceiverStrategy = exports.IdCancellationReceiverStrategy = exports.ConnectionStrategy = exports.ConnectionError = exports.ConnectionErrors = exports.LogTraceNotification = exports.SetTraceNotification = exports.TraceFormat = exports.TraceValues = exports.TraceValue = exports.Trace = exports.NullLogger = exports.ProgressType = exports.ProgressToken = void 0;\nexports.createMessageConnection = createMessageConnection;\nconst ral_1 = __importDefault(require(\"./ral\"));\nconst Is = __importStar(require(\"./is\"));\nconst messages_1 = require(\"./messages\");\nconst linkedMap_1 = require(\"./linkedMap\");\nconst events_1 = require(\"./events\");\nconst cancellation_1 = require(\"./cancellation\");\nvar CancelNotification;\n(function (CancelNotification) {\n    CancelNotification.type = new messages_1.NotificationType('$/cancelRequest');\n})(CancelNotification || (CancelNotification = {}));\nvar ProgressToken;\n(function (ProgressToken) {\n    function is(value) {\n        return typeof value === 'string' || typeof value === 'number';\n    }\n    ProgressToken.is = is;\n})(ProgressToken || (exports.ProgressToken = ProgressToken = {}));\nvar ProgressNotification;\n(function (ProgressNotification) {\n    ProgressNotification.type = new messages_1.NotificationType('$/progress');\n})(ProgressNotification || (ProgressNotification = {}));\nclass ProgressType {\n    /**\n     * Clients must not use these properties. They are here to ensure correct typing.\n     * in TypeScript\n     */\n    __;\n    _pr;\n    constructor() {\n    }\n}\nexports.ProgressType = ProgressType;\nvar StarRequestHandler;\n(function (StarRequestHandler) {\n    function is(value) {\n        return Is.func(value);\n    }\n    StarRequestHandler.is = is;\n})(StarRequestHandler || (StarRequestHandler = {}));\nexports.NullLogger = Object.freeze({\n    error: () => { },\n    warn: () => { },\n    info: () => { },\n    log: () => { }\n});\nvar Trace;\n(function (Trace) {\n    Trace[Trace[\"Off\"] = 0] = \"Off\";\n    Trace[Trace[\"Messages\"] = 1] = \"Messages\";\n    Trace[Trace[\"Compact\"] = 2] = \"Compact\";\n    Trace[Trace[\"Verbose\"] = 3] = \"Verbose\";\n})(Trace || (exports.Trace = Trace = {}));\nvar TraceValue;\n(function (TraceValue) {\n    /**\n     * Turn tracing off.\n     */\n    TraceValue.Off = 'off';\n    /**\n     * Trace messages only.\n     */\n    TraceValue.Messages = 'messages';\n    /**\n     * Compact message tracing.\n     */\n    TraceValue.Compact = 'compact';\n    /**\n     * Verbose message tracing.\n     */\n    TraceValue.Verbose = 'verbose';\n})(TraceValue || (exports.TraceValue = TraceValue = {}));\n/**\n * @deprecated Use TraceValue instead\n */\nexports.TraceValues = TraceValue;\n(function (Trace) {\n    function fromString(value) {\n        if (!Is.string(value)) {\n            return Trace.Off;\n        }\n        value = value.toLowerCase();\n        switch (value) {\n            case 'off':\n                return Trace.Off;\n            case 'messages':\n                return Trace.Messages;\n            case 'compact':\n                return Trace.Compact;\n            case 'verbose':\n                return Trace.Verbose;\n            default:\n                return Trace.Off;\n        }\n    }\n    Trace.fromString = fromString;\n    function toString(value) {\n        switch (value) {\n            case Trace.Off:\n                return 'off';\n            case Trace.Messages:\n                return 'messages';\n            case Trace.Compact:\n                return 'compact';\n            case Trace.Verbose:\n                return 'verbose';\n            default:\n                return 'off';\n        }\n    }\n    Trace.toString = toString;\n})(Trace || (exports.Trace = Trace = {}));\nvar TraceFormat;\n(function (TraceFormat) {\n    TraceFormat[\"Text\"] = \"text\";\n    TraceFormat[\"JSON\"] = \"json\";\n})(TraceFormat || (exports.TraceFormat = TraceFormat = {}));\n(function (TraceFormat) {\n    function fromString(value) {\n        if (!Is.string(value)) {\n            return TraceFormat.Text;\n        }\n        value = value.toLowerCase();\n        if (value === 'json') {\n            return TraceFormat.JSON;\n        }\n        else {\n            return TraceFormat.Text;\n        }\n    }\n    TraceFormat.fromString = fromString;\n})(TraceFormat || (exports.TraceFormat = TraceFormat = {}));\nvar SetTraceNotification;\n(function (SetTraceNotification) {\n    SetTraceNotification.type = new messages_1.NotificationType('$/setTrace');\n})(SetTraceNotification || (exports.SetTraceNotification = SetTraceNotification = {}));\nvar LogTraceNotification;\n(function (LogTraceNotification) {\n    LogTraceNotification.type = new messages_1.NotificationType('$/logTrace');\n})(LogTraceNotification || (exports.LogTraceNotification = LogTraceNotification = {}));\nvar ConnectionErrors;\n(function (ConnectionErrors) {\n    /**\n     * The connection is closed.\n     */\n    ConnectionErrors[ConnectionErrors[\"Closed\"] = 1] = \"Closed\";\n    /**\n     * The connection got disposed.\n     */\n    ConnectionErrors[ConnectionErrors[\"Disposed\"] = 2] = \"Disposed\";\n    /**\n     * The connection is already in listening mode.\n     */\n    ConnectionErrors[ConnectionErrors[\"AlreadyListening\"] = 3] = \"AlreadyListening\";\n})(ConnectionErrors || (exports.ConnectionErrors = ConnectionErrors = {}));\nclass ConnectionError extends Error {\n    code;\n    constructor(code, message) {\n        super(message);\n        this.code = code;\n        Object.setPrototypeOf(this, ConnectionError.prototype);\n    }\n}\nexports.ConnectionError = ConnectionError;\nvar ConnectionStrategy;\n(function (ConnectionStrategy) {\n    function is(value) {\n        const candidate = value;\n        return candidate && Is.func(candidate.cancelUndispatched);\n    }\n    ConnectionStrategy.is = is;\n})(ConnectionStrategy || (exports.ConnectionStrategy = ConnectionStrategy = {}));\nvar IdCancellationReceiverStrategy;\n(function (IdCancellationReceiverStrategy) {\n    function is(value) {\n        const candidate = value;\n        return candidate && (candidate.kind === undefined || candidate.kind === 'id') && Is.func(candidate.createCancellationTokenSource) && (candidate.dispose === undefined || Is.func(candidate.dispose));\n    }\n    IdCancellationReceiverStrategy.is = is;\n})(IdCancellationReceiverStrategy || (exports.IdCancellationReceiverStrategy = IdCancellationReceiverStrategy = {}));\nvar RequestCancellationReceiverStrategy;\n(function (RequestCancellationReceiverStrategy) {\n    function is(value) {\n        const candidate = value;\n        return candidate && candidate.kind === 'request' && Is.func(candidate.createCancellationTokenSource) && (candidate.dispose === undefined || Is.func(candidate.dispose));\n    }\n    RequestCancellationReceiverStrategy.is = is;\n})(RequestCancellationReceiverStrategy || (exports.RequestCancellationReceiverStrategy = RequestCancellationReceiverStrategy = {}));\nvar CancellationReceiverStrategy;\n(function (CancellationReceiverStrategy) {\n    CancellationReceiverStrategy.Message = Object.freeze({\n        createCancellationTokenSource(_) {\n            return new cancellation_1.CancellationTokenSource();\n        }\n    });\n    function is(value) {\n        return IdCancellationReceiverStrategy.is(value) || RequestCancellationReceiverStrategy.is(value);\n    }\n    CancellationReceiverStrategy.is = is;\n})(CancellationReceiverStrategy || (exports.CancellationReceiverStrategy = CancellationReceiverStrategy = {}));\nvar CancellationSenderStrategy;\n(function (CancellationSenderStrategy) {\n    CancellationSenderStrategy.Message = Object.freeze({\n        sendCancellation(conn, id) {\n            return conn.sendNotification(CancelNotification.type, { id });\n        },\n        cleanup(_) { }\n    });\n    function is(value) {\n        const candidate = value;\n        return candidate && Is.func(candidate.sendCancellation) && Is.func(candidate.cleanup);\n    }\n    CancellationSenderStrategy.is = is;\n})(CancellationSenderStrategy || (exports.CancellationSenderStrategy = CancellationSenderStrategy = {}));\nvar CancellationStrategy;\n(function (CancellationStrategy) {\n    CancellationStrategy.Message = Object.freeze({\n        receiver: CancellationReceiverStrategy.Message,\n        sender: CancellationSenderStrategy.Message\n    });\n    function is(value) {\n        const candidate = value;\n        return candidate && CancellationReceiverStrategy.is(candidate.receiver) && CancellationSenderStrategy.is(candidate.sender);\n    }\n    CancellationStrategy.is = is;\n})(CancellationStrategy || (exports.CancellationStrategy = CancellationStrategy = {}));\nvar MessageStrategy;\n(function (MessageStrategy) {\n    function is(value) {\n        const candidate = value;\n        return candidate && Is.func(candidate.handleMessage);\n    }\n    MessageStrategy.is = is;\n})(MessageStrategy || (exports.MessageStrategy = MessageStrategy = {}));\nvar ConnectionOptions;\n(function (ConnectionOptions) {\n    function is(value) {\n        const candidate = value;\n        return candidate\n            && (CancellationStrategy.is(candidate.cancellationStrategy) || ConnectionStrategy.is(candidate.connectionStrategy) || MessageStrategy.is(candidate.messageStrategy) || Is.number(candidate.maxParallelism));\n    }\n    ConnectionOptions.is = is;\n})(ConnectionOptions || (exports.ConnectionOptions = ConnectionOptions = {}));\nvar ConnectionState;\n(function (ConnectionState) {\n    ConnectionState[ConnectionState[\"New\"] = 1] = \"New\";\n    ConnectionState[ConnectionState[\"Listening\"] = 2] = \"Listening\";\n    ConnectionState[ConnectionState[\"Closed\"] = 3] = \"Closed\";\n    ConnectionState[ConnectionState[\"Disposed\"] = 4] = \"Disposed\";\n})(ConnectionState || (ConnectionState = {}));\nfunction createMessageConnection(messageReader, messageWriter, _logger, options) {\n    const logger = _logger !== undefined ? _logger : exports.NullLogger;\n    let sequenceNumber = 0;\n    let notificationSequenceNumber = 0;\n    let unknownResponseSequenceNumber = 0;\n    const version = '2.0';\n    const maxParallelism = options?.maxParallelism ?? -1;\n    let inFlight = 0;\n    let starRequestHandler = undefined;\n    const requestHandlers = new Map();\n    let starNotificationHandler = undefined;\n    const notificationHandlers = new Map();\n    const progressHandlers = new Map();\n    let timer;\n    let messageQueue = new linkedMap_1.LinkedMap();\n    let responsePromises = new Map();\n    let knownCanceledRequests = new Set();\n    let requestTokens = new Map();\n    let trace = Trace.Off;\n    let traceFormat = TraceFormat.Text;\n    let tracer;\n    let state = ConnectionState.New;\n    const errorEmitter = new events_1.Emitter();\n    const closeEmitter = new events_1.Emitter();\n    const unhandledNotificationEmitter = new events_1.Emitter();\n    const unhandledProgressEmitter = new events_1.Emitter();\n    const disposeEmitter = new events_1.Emitter();\n    const cancellationStrategy = (options && options.cancellationStrategy) ? options.cancellationStrategy : CancellationStrategy.Message;\n    function cancelUndispatched(_message) {\n        return undefined;\n    }\n    function isListening() {\n        return state === ConnectionState.Listening;\n    }\n    function isClosed() {\n        return state === ConnectionState.Closed;\n    }\n    function isDisposed() {\n        return state === ConnectionState.Disposed;\n    }\n    function closeHandler() {\n        if (state === ConnectionState.New || state === ConnectionState.Listening) {\n            state = ConnectionState.Closed;\n            closeEmitter.fire(undefined);\n        }\n        // If the connection is disposed don't sent close events.\n    }\n    function readErrorHandler(error) {\n        errorEmitter.fire([error, undefined, undefined]);\n    }\n    function writeErrorHandler(data) {\n        errorEmitter.fire(data);\n    }\n    messageReader.onClose(closeHandler);\n    messageReader.onError(readErrorHandler);\n    messageWriter.onClose(closeHandler);\n    messageWriter.onError(writeErrorHandler);\n    function createRequestQueueKey(id) {\n        if (id === null) {\n            throw new Error(`Can't send requests with id null since the response can't be correlated.`);\n        }\n        return 'req-' + id.toString();\n    }\n    function createResponseQueueKey(id) {\n        if (id === null) {\n            return 'res-unknown-' + (++unknownResponseSequenceNumber).toString();\n        }\n        else {\n            return 'res-' + id.toString();\n        }\n    }\n    function createNotificationQueueKey() {\n        return 'not-' + (++notificationSequenceNumber).toString();\n    }\n    function addMessageToQueue(queue, message) {\n        if (messages_1.Message.isRequest(message)) {\n            queue.set(createRequestQueueKey(message.id), message);\n        }\n        else if (messages_1.Message.isResponse(message)) {\n            // If we have unlimited parallelism we queue the response to keep\n            // the previous semantics.\n            if (maxParallelism === -1) {\n                queue.set(createResponseQueueKey(message.id), message);\n            }\n            else {\n                // If we have limited parallelism we resolve responses to avoid\n                // dead locks.\n                handleResponse(message);\n            }\n        }\n        else {\n            queue.set(createNotificationQueueKey(), message);\n        }\n    }\n    function triggerMessageQueue() {\n        if (timer || messageQueue.size === 0) {\n            return;\n        }\n        if (maxParallelism !== -1 && inFlight >= maxParallelism) {\n            return;\n        }\n        timer = (0, ral_1.default)().timer.setImmediate(async () => {\n            timer = undefined;\n            if (messageQueue.size === 0) {\n                return;\n            }\n            if (maxParallelism !== -1 && inFlight >= maxParallelism) {\n                return;\n            }\n            const message = messageQueue.shift();\n            let result;\n            try {\n                inFlight++;\n                const messageStrategy = options?.messageStrategy;\n                if (MessageStrategy.is(messageStrategy)) {\n                    result = messageStrategy.handleMessage(message, handleMessage);\n                }\n                else {\n                    result = handleMessage(message);\n                }\n            }\n            catch (error) {\n                logger.error(`Processing message queue failed: ${error.toString()}`);\n            }\n            finally {\n                if (result instanceof Promise) {\n                    result.then(() => {\n                        inFlight--;\n                        triggerMessageQueue();\n                    }).catch((error) => {\n                        logger.error(`Processing message queue failed: ${error.toString()}`);\n                    });\n                }\n                else {\n                    inFlight--;\n                }\n                triggerMessageQueue();\n            }\n        });\n    }\n    async function handleMessage(message) {\n        if (messages_1.Message.isRequest(message)) {\n            return handleRequest(message);\n        }\n        else if (messages_1.Message.isNotification(message)) {\n            return handleNotification(message);\n        }\n        else if (messages_1.Message.isResponse(message)) {\n            return handleResponse(message);\n        }\n        else {\n            return handleInvalidMessage(message);\n        }\n    }\n    const callback = (message) => {\n        try {\n            // We have received a cancellation message. Check if the message is still in the queue\n            // and cancel it if allowed to do so.\n            if (messages_1.Message.isNotification(message) && message.method === CancelNotification.type.method) {\n                const cancelId = message.params.id;\n                const key = createRequestQueueKey(cancelId);\n                const toCancel = messageQueue.get(key);\n                if (messages_1.Message.isRequest(toCancel)) {\n                    const strategy = options?.connectionStrategy;\n                    const response = (strategy && strategy.cancelUndispatched) ? strategy.cancelUndispatched(toCancel, cancelUndispatched) : cancelUndispatched(toCancel);\n                    if (response && (response.error !== undefined || response.result !== undefined)) {\n                        messageQueue.delete(key);\n                        requestTokens.delete(cancelId);\n                        response.id = toCancel.id;\n                        traceSendingResponse(response, message.method, Date.now());\n                        messageWriter.write(response).catch(() => logger.error(`Sending response for canceled message failed.`));\n                        return;\n                    }\n                }\n                const cancellationToken = requestTokens.get(cancelId);\n                // The request is already running. Cancel the token\n                if (cancellationToken !== undefined) {\n                    cancellationToken.cancel();\n                    traceReceivedNotification(message);\n                    return;\n                }\n                else {\n                    // Remember the cancel but still queue the message to\n                    // clean up state in process message.\n                    knownCanceledRequests.add(cancelId);\n                }\n            }\n            addMessageToQueue(messageQueue, message);\n        }\n        finally {\n            triggerMessageQueue();\n        }\n    };\n    async function handleRequest(requestMessage) {\n        if (isDisposed()) {\n            // we return here silently since we fired an event when the\n            // connection got disposed.\n            return Promise.resolve();\n        }\n        function reply(resultOrError, method, startTime) {\n            const message = {\n                jsonrpc: version,\n                id: requestMessage.id\n            };\n            if (resultOrError instanceof messages_1.ResponseError) {\n                message.error = resultOrError.toJson();\n            }\n            else {\n                message.result = resultOrError === undefined ? null : resultOrError;\n            }\n            traceSendingResponse(message, method, startTime);\n            return messageWriter.write(message);\n        }\n        function replyError(error, method, startTime) {\n            const message = {\n                jsonrpc: version,\n                id: requestMessage.id,\n                error: error.toJson()\n            };\n            traceSendingResponse(message, method, startTime);\n            return messageWriter.write(message);\n        }\n        traceReceivedRequest(requestMessage);\n        const element = requestHandlers.get(requestMessage.method);\n        let type;\n        let requestHandler;\n        if (element) {\n            type = element.type;\n            requestHandler = element.handler;\n        }\n        const startTime = Date.now();\n        if (requestHandler || starRequestHandler) {\n            const tokenKey = requestMessage.id ?? String(Date.now()); //\n            const cancellationSource = IdCancellationReceiverStrategy.is(cancellationStrategy.receiver)\n                ? cancellationStrategy.receiver.createCancellationTokenSource(tokenKey)\n                : cancellationStrategy.receiver.createCancellationTokenSource(requestMessage);\n            if (requestMessage.id !== null && knownCanceledRequests.has(requestMessage.id)) {\n                cancellationSource.cancel();\n            }\n            if (requestMessage.id !== null) {\n                requestTokens.set(tokenKey, cancellationSource);\n            }\n            try {\n                let handlerResult;\n                if (requestHandler) {\n                    if (requestMessage.params === undefined) {\n                        if (type !== undefined && type.numberOfParams !== 0) {\n                            return replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InvalidParams, `Request ${requestMessage.method} defines ${type.numberOfParams} params but received none.`), requestMessage.method, startTime);\n                        }\n                        handlerResult = requestHandler(cancellationSource.token);\n                    }\n                    else if (Array.isArray(requestMessage.params)) {\n                        if (type !== undefined && type.parameterStructures === messages_1.ParameterStructures.byName) {\n                            return replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InvalidParams, `Request ${requestMessage.method} defines parameters by name but received parameters by position`), requestMessage.method, startTime);\n                        }\n                        handlerResult = requestHandler(...requestMessage.params, cancellationSource.token);\n                    }\n                    else {\n                        if (type !== undefined && type.parameterStructures === messages_1.ParameterStructures.byPosition) {\n                            return replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InvalidParams, `Request ${requestMessage.method} defines parameters by position but received parameters by name`), requestMessage.method, startTime);\n                        }\n                        handlerResult = requestHandler(requestMessage.params, cancellationSource.token);\n                    }\n                }\n                else if (starRequestHandler) {\n                    handlerResult = starRequestHandler(requestMessage.method, requestMessage.params, cancellationSource.token);\n                }\n                const resultOrError = await handlerResult;\n                await reply(resultOrError, requestMessage.method, startTime);\n            }\n            catch (error) {\n                if (error instanceof messages_1.ResponseError) {\n                    await reply(error, requestMessage.method, startTime);\n                }\n                else if (error && Is.string(error.message)) {\n                    await replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InternalError, `Request ${requestMessage.method} failed with message: ${error.message}`), requestMessage.method, startTime);\n                }\n                else {\n                    await replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InternalError, `Request ${requestMessage.method} failed unexpectedly without providing any details.`), requestMessage.method, startTime);\n                }\n            }\n            finally {\n                requestTokens.delete(tokenKey);\n            }\n        }\n        else {\n            await replyError(new messages_1.ResponseError(messages_1.ErrorCodes.MethodNotFound, `Unhandled method ${requestMessage.method}`), requestMessage.method, startTime);\n        }\n    }\n    function handleResponse(responseMessage) {\n        if (isDisposed()) {\n            // See handle request.\n            return;\n        }\n        if (responseMessage.id === null) {\n            if (responseMessage.error) {\n                logger.error(`Received response message without id: Error is: \\n${JSON.stringify(responseMessage.error, undefined, 4)}`);\n            }\n            else {\n                logger.error(`Received response message without id. No further error information provided.`);\n            }\n        }\n        else {\n            const key = responseMessage.id;\n            const responsePromise = responsePromises.get(key);\n            traceReceivedResponse(responseMessage, responsePromise);\n            if (responsePromise !== undefined) {\n                responsePromises.delete(key);\n                try {\n                    if (responseMessage.error) {\n                        const error = responseMessage.error;\n                        responsePromise.reject(new messages_1.ResponseError(error.code, error.message, error.data));\n                    }\n                    else if (responseMessage.result !== undefined) {\n                        responsePromise.resolve(responseMessage.result);\n                    }\n                    else {\n                        throw new Error('Should never happen.');\n                    }\n                }\n                catch (error) {\n                    if (error.message) {\n                        logger.error(`Response handler '${responsePromise.method}' failed with message: ${error.message}`);\n                    }\n                    else {\n                        logger.error(`Response handler '${responsePromise.method}' failed unexpectedly.`);\n                    }\n                }\n            }\n        }\n    }\n    async function handleNotification(message) {\n        if (isDisposed()) {\n            // See handle request.\n            return;\n        }\n        let type = undefined;\n        let notificationHandler;\n        if (message.method === CancelNotification.type.method) {\n            const cancelId = message.params.id;\n            knownCanceledRequests.delete(cancelId);\n            traceReceivedNotification(message);\n            return;\n        }\n        else {\n            const element = notificationHandlers.get(message.method);\n            if (element) {\n                notificationHandler = element.handler;\n                type = element.type;\n            }\n        }\n        if (notificationHandler || starNotificationHandler) {\n            try {\n                traceReceivedNotification(message);\n                if (notificationHandler) {\n                    if (message.params === undefined) {\n                        if (type !== undefined) {\n                            if (type.numberOfParams !== 0 && type.parameterStructures !== messages_1.ParameterStructures.byName) {\n                                logger.error(`Notification ${message.method} defines ${type.numberOfParams} params but received none.`);\n                            }\n                        }\n                        await notificationHandler();\n                    }\n                    else if (Array.isArray(message.params)) {\n                        // There are JSON-RPC libraries that send progress message as positional params although\n                        // specified as named. So convert them if this is the case.\n                        const params = message.params;\n                        if (message.method === ProgressNotification.type.method && params.length === 2 && ProgressToken.is(params[0])) {\n                            await notificationHandler({ token: params[0], value: params[1] });\n                        }\n                        else {\n                            if (type !== undefined) {\n                                if (type.parameterStructures === messages_1.ParameterStructures.byName) {\n                                    logger.error(`Notification ${message.method} defines parameters by name but received parameters by position`);\n                                }\n                                if (type.numberOfParams !== message.params.length) {\n                                    logger.error(`Notification ${message.method} defines ${type.numberOfParams} params but received ${params.length} arguments`);\n                                }\n                            }\n                            await notificationHandler(...params);\n                        }\n                    }\n                    else {\n                        if (type !== undefined && type.parameterStructures === messages_1.ParameterStructures.byPosition) {\n                            logger.error(`Notification ${message.method} defines parameters by position but received parameters by name`);\n                        }\n                        await notificationHandler(message.params);\n                    }\n                }\n                else if (starNotificationHandler) {\n                    await starNotificationHandler(message.method, message.params);\n                }\n            }\n            catch (error) {\n                if (error.message) {\n                    logger.error(`Notification handler '${message.method}' failed with message: ${error.message}`);\n                }\n                else {\n                    logger.error(`Notification handler '${message.method}' failed unexpectedly.`);\n                }\n            }\n        }\n        else {\n            unhandledNotificationEmitter.fire(message);\n        }\n    }\n    function handleInvalidMessage(message) {\n        if (!message) {\n            logger.error('Received empty message.');\n            return;\n        }\n        logger.error(`Received message which is neither a response nor a notification message:\\n${JSON.stringify(message, null, 4)}`);\n        // Test whether we find an id to reject the promise\n        const responseMessage = message;\n        if (Is.string(responseMessage.id) || Is.number(responseMessage.id)) {\n            const key = responseMessage.id;\n            const responseHandler = responsePromises.get(key);\n            if (responseHandler) {\n                responseHandler.reject(new Error('The received response has neither a result nor an error property.'));\n            }\n        }\n    }\n    function stringifyTrace(params) {\n        if (params === undefined || params === null) {\n            return undefined;\n        }\n        switch (trace) {\n            case Trace.Verbose:\n                return JSON.stringify(params, null, 4);\n            case Trace.Compact:\n                return JSON.stringify(params);\n            default:\n                return undefined;\n        }\n    }\n    function traceSendingRequest(message) {\n        if (trace === Trace.Off || !tracer) {\n            return;\n        }\n        if (traceFormat === TraceFormat.Text) {\n            let data = undefined;\n            if ((trace === Trace.Verbose || trace === Trace.Compact) && message.params) {\n                data = `Params: ${stringifyTrace(message.params)}`;\n            }\n            tracer.log(`Sending request '${message.method} - (${message.id})'.`, data);\n        }\n        else {\n            logLSPMessage('send-request', message);\n        }\n    }\n    function traceSendingNotification(message) {\n        if (trace === Trace.Off || !tracer) {\n            return;\n        }\n        if (traceFormat === TraceFormat.Text) {\n            let data = undefined;\n            if (trace === Trace.Verbose || trace === Trace.Compact) {\n                if (message.params) {\n                    data = `Params: ${stringifyTrace(message.params)}`;\n                }\n                else {\n                    data = 'No parameters provided.';\n                }\n            }\n            tracer.log(`Sending notification '${message.method}'.`, data);\n        }\n        else {\n            logLSPMessage('send-notification', message);\n        }\n    }\n    function traceSendingResponse(message, method, startTime) {\n        if (trace === Trace.Off || !tracer) {\n            return;\n        }\n        if (traceFormat === TraceFormat.Text) {\n            let data = undefined;\n            if (trace === Trace.Verbose || trace === Trace.Compact) {\n                if (message.error && message.error.data) {\n                    data = `Error data: ${stringifyTrace(message.error.data)}`;\n                }\n                else {\n                    if (message.result) {\n                        data = `Result: ${stringifyTrace(message.result)}`;\n                    }\n                    else if (message.error === undefined) {\n                        data = 'No result returned.';\n                    }\n                }\n            }\n            tracer.log(`Sending response '${method} - (${message.id})'. Processing request took ${Date.now() - startTime}ms`, data);\n        }\n        else {\n            logLSPMessage('send-response', message);\n        }\n    }\n    function traceReceivedRequest(message) {\n        if (trace === Trace.Off || !tracer) {\n            return;\n        }\n        if (traceFormat === TraceFormat.Text) {\n            let data = undefined;\n            if ((trace === Trace.Verbose || trace === Trace.Compact) && message.params) {\n                data = `Params: ${stringifyTrace(message.params)}`;\n            }\n            tracer.log(`Received request '${message.method} - (${message.id})'.`, data);\n        }\n        else {\n            logLSPMessage('receive-request', message);\n        }\n    }\n    function traceReceivedNotification(message) {\n        if (trace === Trace.Off || !tracer || message.method === LogTraceNotification.type.method) {\n            return;\n        }\n        if (traceFormat === TraceFormat.Text) {\n            let data = undefined;\n            if (trace === Trace.Verbose || trace === Trace.Compact) {\n                if (message.params) {\n                    data = `Params: ${stringifyTrace(message.params)}`;\n                }\n                else {\n                    data = 'No parameters provided.';\n                }\n            }\n            tracer.log(`Received notification '${message.method}'.`, data);\n        }\n        else {\n            logLSPMessage('receive-notification', message);\n        }\n    }\n    function traceReceivedResponse(message, responsePromise) {\n        if (trace === Trace.Off || !tracer) {\n            return;\n        }\n        if (traceFormat === TraceFormat.Text) {\n            let data = undefined;\n            if (trace === Trace.Verbose || trace === Trace.Compact) {\n                if (message.error && message.error.data) {\n                    data = `Error data: ${stringifyTrace(message.error.data)}`;\n                }\n                else {\n                    if (message.result) {\n                        data = `Result: ${stringifyTrace(message.result)}`;\n                    }\n                    else if (message.error === undefined) {\n                        data = 'No result returned.';\n                    }\n                }\n            }\n            if (responsePromise) {\n                const error = message.error ? ` Request failed: ${message.error.message} (${message.error.code}).` : '';\n                tracer.log(`Received response '${responsePromise.method} - (${message.id})' in ${Date.now() - responsePromise.timerStart}ms.${error}`, data);\n            }\n            else {\n                tracer.log(`Received response ${message.id} without active response promise.`, data);\n            }\n        }\n        else {\n            logLSPMessage('receive-response', message);\n        }\n    }\n    function logLSPMessage(type, message) {\n        if (!tracer || trace === Trace.Off) {\n            return;\n        }\n        const lspMessage = {\n            isLSPMessage: true,\n            type,\n            message,\n            timestamp: Date.now()\n        };\n        tracer.log(lspMessage);\n    }\n    function throwIfClosedOrDisposed() {\n        if (isClosed()) {\n            throw new ConnectionError(ConnectionErrors.Closed, 'Connection is closed.');\n        }\n        if (isDisposed()) {\n            throw new ConnectionError(ConnectionErrors.Disposed, 'Connection is disposed.');\n        }\n    }\n    function throwIfListening() {\n        if (isListening()) {\n            throw new ConnectionError(ConnectionErrors.AlreadyListening, 'Connection is already listening');\n        }\n    }\n    function throwIfNotListening() {\n        if (!isListening()) {\n            throw new Error('Call listen() first.');\n        }\n    }\n    function undefinedToNull(param) {\n        if (param === undefined) {\n            return null;\n        }\n        else {\n            return param;\n        }\n    }\n    function nullToUndefined(param) {\n        if (param === null) {\n            return undefined;\n        }\n        else {\n            return param;\n        }\n    }\n    function isNamedParam(param) {\n        return param !== undefined && param !== null && !Array.isArray(param) && typeof param === 'object';\n    }\n    function computeSingleParam(parameterStructures, param) {\n        switch (parameterStructures) {\n            case messages_1.ParameterStructures.auto:\n                if (isNamedParam(param)) {\n                    return nullToUndefined(param);\n                }\n                else {\n                    return [undefinedToNull(param)];\n                }\n            case messages_1.ParameterStructures.byName:\n                if (!isNamedParam(param)) {\n                    throw new Error(`Received parameters by name but param is not an object literal.`);\n                }\n                return nullToUndefined(param);\n            case messages_1.ParameterStructures.byPosition:\n                return [undefinedToNull(param)];\n            default:\n                throw new Error(`Unknown parameter structure ${parameterStructures.toString()}`);\n        }\n    }\n    function computeMessageParams(type, params) {\n        let result;\n        const numberOfParams = type.numberOfParams;\n        switch (numberOfParams) {\n            case 0:\n                result = undefined;\n                break;\n            case 1:\n                result = computeSingleParam(type.parameterStructures, params[0]);\n                break;\n            default:\n                result = [];\n                for (let i = 0; i < params.length && i < numberOfParams; i++) {\n                    result.push(undefinedToNull(params[i]));\n                }\n                if (params.length < numberOfParams) {\n                    for (let i = params.length; i < numberOfParams; i++) {\n                        result.push(null);\n                    }\n                }\n                break;\n        }\n        return result;\n    }\n    const connection = {\n        sendNotification: (type, ...args) => {\n            throwIfClosedOrDisposed();\n            let method;\n            let messageParams;\n            if (Is.string(type)) {\n                method = type;\n                const first = args[0];\n                let paramStart = 0;\n                let parameterStructures = messages_1.ParameterStructures.auto;\n                if (messages_1.ParameterStructures.is(first)) {\n                    paramStart = 1;\n                    parameterStructures = first;\n                }\n                const paramEnd = args.length;\n                const numberOfParams = paramEnd - paramStart;\n                switch (numberOfParams) {\n                    case 0:\n                        messageParams = undefined;\n                        break;\n                    case 1:\n                        messageParams = computeSingleParam(parameterStructures, args[paramStart]);\n                        break;\n                    default:\n                        if (parameterStructures === messages_1.ParameterStructures.byName) {\n                            throw new Error(`Received ${numberOfParams} parameters for 'by Name' notification parameter structure.`);\n                        }\n                        messageParams = args.slice(paramStart, paramEnd).map(value => undefinedToNull(value));\n                        break;\n                }\n            }\n            else {\n                const params = args;\n                method = type.method;\n                messageParams = computeMessageParams(type, params);\n            }\n            const notificationMessage = {\n                jsonrpc: version,\n                method: method,\n                params: messageParams\n            };\n            traceSendingNotification(notificationMessage);\n            return messageWriter.write(notificationMessage).catch((error) => {\n                logger.error(`Sending notification failed.`);\n                throw error;\n            });\n        },\n        onNotification: (type, handler) => {\n            throwIfClosedOrDisposed();\n            let method;\n            if (Is.func(type)) {\n                starNotificationHandler = type;\n            }\n            else if (handler) {\n                if (Is.string(type)) {\n                    method = type;\n                    notificationHandlers.set(type, { type: undefined, handler });\n                }\n                else {\n                    method = type.method;\n                    notificationHandlers.set(type.method, { type, handler });\n                }\n            }\n            return {\n                dispose: () => {\n                    if (method !== undefined) {\n                        if (notificationHandlers.get(method)?.handler === handler) {\n                            notificationHandlers.delete(method);\n                        }\n                    }\n                    else if (starNotificationHandler === type) {\n                        starNotificationHandler = undefined;\n                    }\n                }\n            };\n        },\n        onProgress: (_type, token, handler) => {\n            if (progressHandlers.has(token)) {\n                throw new Error(`Progress handler for token ${token} already registered`);\n            }\n            progressHandlers.set(token, handler);\n            return {\n                dispose: () => {\n                    if (progressHandlers.get(token) === handler) {\n                        progressHandlers.delete(token);\n                    }\n                }\n            };\n        },\n        sendProgress: (_type, token, value) => {\n            // This should not await but simple return to ensure that we don't have another\n            // async scheduling. Otherwise one send could overtake another send.\n            return connection.sendNotification(ProgressNotification.type, { token, value });\n        },\n        onUnhandledProgress: unhandledProgressEmitter.event,\n        sendRequest: (type, ...args) => {\n            throwIfClosedOrDisposed();\n            throwIfNotListening();\n            function sendCancellation(connection, id) {\n                const p = cancellationStrategy.sender.sendCancellation(connection, id);\n                if (p === undefined) {\n                    logger.log(`Received no promise from cancellation strategy when cancelling id ${id}`);\n                }\n                else {\n                    p.catch(() => {\n                        logger.log(`Sending cancellation messages for id ${id} failed.`);\n                    });\n                }\n            }\n            let method;\n            let messageParams;\n            let token = undefined;\n            if (Is.string(type)) {\n                method = type;\n                const first = args[0];\n                const last = args[args.length - 1];\n                let paramStart = 0;\n                let parameterStructures = messages_1.ParameterStructures.auto;\n                if (messages_1.ParameterStructures.is(first)) {\n                    paramStart = 1;\n                    parameterStructures = first;\n                }\n                let paramEnd = args.length;\n                if (cancellation_1.CancellationToken.is(last)) {\n                    paramEnd = paramEnd - 1;\n                    token = last;\n                }\n                const numberOfParams = paramEnd - paramStart;\n                switch (numberOfParams) {\n                    case 0:\n                        messageParams = undefined;\n                        break;\n                    case 1:\n                        messageParams = computeSingleParam(parameterStructures, args[paramStart]);\n                        break;\n                    default:\n                        if (parameterStructures === messages_1.ParameterStructures.byName) {\n                            throw new Error(`Received ${numberOfParams} parameters for 'by Name' request parameter structure.`);\n                        }\n                        messageParams = args.slice(paramStart, paramEnd).map(value => undefinedToNull(value));\n                        break;\n                }\n            }\n            else {\n                const params = args;\n                method = type.method;\n                messageParams = computeMessageParams(type, params);\n                const numberOfParams = type.numberOfParams;\n                token = cancellation_1.CancellationToken.is(params[numberOfParams]) ? params[numberOfParams] : undefined;\n            }\n            const id = sequenceNumber++;\n            let disposable;\n            let tokenWasCancelled = false;\n            if (token !== undefined) {\n                if (token.isCancellationRequested) {\n                    tokenWasCancelled = true;\n                }\n                else {\n                    disposable = token.onCancellationRequested(() => {\n                        sendCancellation(connection, id);\n                    });\n                }\n            }\n            const requestMessage = {\n                jsonrpc: version,\n                id: id,\n                method: method,\n                params: messageParams\n            };\n            traceSendingRequest(requestMessage);\n            if (typeof cancellationStrategy.sender.enableCancellation === 'function') {\n                cancellationStrategy.sender.enableCancellation(requestMessage);\n            }\n            // eslint-disable-next-line no-async-promise-executor\n            return new Promise(async (resolve, reject) => {\n                const resolveWithCleanup = (r) => {\n                    resolve(r);\n                    cancellationStrategy.sender.cleanup(id);\n                    disposable?.dispose();\n                };\n                const rejectWithCleanup = (r) => {\n                    reject(r);\n                    cancellationStrategy.sender.cleanup(id);\n                    disposable?.dispose();\n                };\n                const responsePromise = { method: method, timerStart: Date.now(), resolve: resolveWithCleanup, reject: rejectWithCleanup };\n                try {\n                    responsePromises.set(id, responsePromise);\n                    await messageWriter.write(requestMessage);\n                    if (tokenWasCancelled) {\n                        sendCancellation(connection, id);\n                    }\n                }\n                catch (error) {\n                    // Writing the message failed. So we need to delete it from the response promises and\n                    // reject it.\n                    responsePromises.delete(id);\n                    responsePromise.reject(new messages_1.ResponseError(messages_1.ErrorCodes.MessageWriteError, error.message ? error.message : 'Unknown reason'));\n                    logger.error(`Sending request failed.`);\n                    throw error;\n                }\n            });\n        },\n        onRequest: (type, handler) => {\n            throwIfClosedOrDisposed();\n            let method = null;\n            if (StarRequestHandler.is(type)) {\n                method = undefined;\n                starRequestHandler = type;\n            }\n            else if (Is.string(type)) {\n                method = null;\n                if (handler !== undefined) {\n                    method = type;\n                    requestHandlers.set(type, { handler: handler, type: undefined });\n                }\n            }\n            else {\n                if (handler !== undefined) {\n                    method = type.method;\n                    requestHandlers.set(type.method, { type, handler });\n                }\n            }\n            return {\n                dispose: () => {\n                    if (method === null) {\n                        return;\n                    }\n                    if (method !== undefined) {\n                        if (requestHandlers.get(method)?.handler === handler) {\n                            requestHandlers.delete(method);\n                        }\n                    }\n                    else if (starRequestHandler === type) {\n                        starRequestHandler = undefined;\n                    }\n                }\n            };\n        },\n        hasPendingResponse: () => {\n            return responsePromises.size > 0;\n        },\n        trace: async (_value, _tracer, sendNotificationOrTraceOptions) => {\n            let _sendNotification = false;\n            let _traceFormat = TraceFormat.Text;\n            if (sendNotificationOrTraceOptions !== undefined) {\n                if (Is.boolean(sendNotificationOrTraceOptions)) {\n                    _sendNotification = sendNotificationOrTraceOptions;\n                }\n                else {\n                    _sendNotification = sendNotificationOrTraceOptions.sendNotification || false;\n                    _traceFormat = sendNotificationOrTraceOptions.traceFormat || TraceFormat.Text;\n                }\n            }\n            trace = _value;\n            traceFormat = _traceFormat;\n            if (trace === Trace.Off) {\n                tracer = undefined;\n            }\n            else {\n                tracer = _tracer;\n            }\n            if (_sendNotification && !isClosed() && !isDisposed()) {\n                await connection.sendNotification(SetTraceNotification.type, { value: Trace.toString(_value) });\n            }\n        },\n        onError: errorEmitter.event,\n        onClose: closeEmitter.event,\n        onUnhandledNotification: unhandledNotificationEmitter.event,\n        onDispose: disposeEmitter.event,\n        end: () => {\n            messageWriter.end();\n        },\n        dispose: () => {\n            if (isDisposed()) {\n                return;\n            }\n            state = ConnectionState.Disposed;\n            disposeEmitter.fire(undefined);\n            const error = new messages_1.ResponseError(messages_1.ErrorCodes.PendingResponseRejected, 'Pending response rejected since connection got disposed');\n            for (const promise of responsePromises.values()) {\n                promise.reject(error);\n            }\n            responsePromises = new Map();\n            requestTokens = new Map();\n            knownCanceledRequests = new Set();\n            messageQueue = new linkedMap_1.LinkedMap();\n            // Test for backwards compatibility\n            if (Is.func(messageWriter.dispose)) {\n                messageWriter.dispose();\n            }\n            if (Is.func(messageReader.dispose)) {\n                messageReader.dispose();\n            }\n        },\n        listen: () => {\n            throwIfClosedOrDisposed();\n            throwIfListening();\n            state = ConnectionState.Listening;\n            messageReader.listen(callback);\n        },\n        inspect: () => {\n            (0, ral_1.default)().console.log('inspect');\n        }\n    };\n    connection.onNotification(LogTraceNotification.type, (params) => {\n        if (trace === Trace.Off || !tracer) {\n            return;\n        }\n        const verbose = trace === Trace.Verbose || trace === Trace.Compact;\n        tracer.log(params.message, verbose ? params.verbose : undefined);\n    });\n    connection.onNotification(ProgressNotification.type, async (params) => {\n        const handler = progressHandlers.get(params.token);\n        if (handler) {\n            await handler(params.value);\n        }\n        else {\n            unhandledProgressEmitter.fire(params);\n        }\n    });\n    return connection;\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\n/// <reference path=\"../../typings/thenable.d.ts\" preserve=\"true\"/>\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ProgressType = exports.ProgressToken = exports.createMessageConnection = exports.NullLogger = exports.ConnectionOptions = exports.ConnectionStrategy = exports.AbstractMessageBuffer = exports.WriteableStreamMessageWriter = exports.AbstractMessageWriter = exports.MessageWriter = exports.ReadableStreamMessageReader = exports.AbstractMessageReader = exports.MessageReader = exports.SharedArrayReceiverStrategy = exports.SharedArraySenderStrategy = exports.CancellationToken = exports.CancellationTokenSource = exports.Emitter = exports.Event = exports.Disposable = exports.LRUCache = exports.Touch = exports.LinkedMap = exports.ParameterStructures = exports.NotificationType9 = exports.NotificationType8 = exports.NotificationType7 = exports.NotificationType6 = exports.NotificationType5 = exports.NotificationType4 = exports.NotificationType3 = exports.NotificationType2 = exports.NotificationType1 = exports.NotificationType0 = exports.NotificationType = exports.ErrorCodes = exports.ResponseError = exports.RequestType9 = exports.RequestType8 = exports.RequestType7 = exports.RequestType6 = exports.RequestType5 = exports.RequestType4 = exports.RequestType3 = exports.RequestType2 = exports.RequestType1 = exports.RequestType0 = exports.RequestType = exports.Message = exports.RAL = void 0;\nexports.MessageStrategy = exports.CancellationStrategy = exports.CancellationSenderStrategy = exports.RequestCancellationReceiverStrategy = exports.IdCancellationReceiverStrategy = exports.CancellationReceiverStrategy = exports.ConnectionError = exports.ConnectionErrors = exports.LogTraceNotification = exports.SetTraceNotification = exports.TraceFormat = exports.TraceValues = exports.TraceValue = exports.Trace = void 0;\nconst messages_1 = require(\"./messages\");\nObject.defineProperty(exports, \"Message\", { enumerable: true, get: function () { return messages_1.Message; } });\nObject.defineProperty(exports, \"RequestType\", { enumerable: true, get: function () { return messages_1.RequestType; } });\nObject.defineProperty(exports, \"RequestType0\", { enumerable: true, get: function () { return messages_1.RequestType0; } });\nObject.defineProperty(exports, \"RequestType1\", { enumerable: true, get: function () { return messages_1.RequestType1; } });\nObject.defineProperty(exports, \"RequestType2\", { enumerable: true, get: function () { return messages_1.RequestType2; } });\nObject.defineProperty(exports, \"RequestType3\", { enumerable: true, get: function () { return messages_1.RequestType3; } });\nObject.defineProperty(exports, \"RequestType4\", { enumerable: true, get: function () { return messages_1.RequestType4; } });\nObject.defineProperty(exports, \"RequestType5\", { enumerable: true, get: function () { return messages_1.RequestType5; } });\nObject.defineProperty(exports, \"RequestType6\", { enumerable: true, get: function () { return messages_1.RequestType6; } });\nObject.defineProperty(exports, \"RequestType7\", { enumerable: true, get: function () { return messages_1.RequestType7; } });\nObject.defineProperty(exports, \"RequestType8\", { enumerable: true, get: function () { return messages_1.RequestType8; } });\nObject.defineProperty(exports, \"RequestType9\", { enumerable: true, get: function () { return messages_1.RequestType9; } });\nObject.defineProperty(exports, \"ResponseError\", { enumerable: true, get: function () { return messages_1.ResponseError; } });\nObject.defineProperty(exports, \"ErrorCodes\", { enumerable: true, get: function () { return messages_1.ErrorCodes; } });\nObject.defineProperty(exports, \"NotificationType\", { enumerable: true, get: function () { return messages_1.NotificationType; } });\nObject.defineProperty(exports, \"NotificationType0\", { enumerable: true, get: function () { return messages_1.NotificationType0; } });\nObject.defineProperty(exports, \"NotificationType1\", { enumerable: true, get: function () { return messages_1.NotificationType1; } });\nObject.defineProperty(exports, \"NotificationType2\", { enumerable: true, get: function () { return messages_1.NotificationType2; } });\nObject.defineProperty(exports, \"NotificationType3\", { enumerable: true, get: function () { return messages_1.NotificationType3; } });\nObject.defineProperty(exports, \"NotificationType4\", { enumerable: true, get: function () { return messages_1.NotificationType4; } });\nObject.defineProperty(exports, \"NotificationType5\", { enumerable: true, get: function () { return messages_1.NotificationType5; } });\nObject.defineProperty(exports, \"NotificationType6\", { enumerable: true, get: function () { return messages_1.NotificationType6; } });\nObject.defineProperty(exports, \"NotificationType7\", { enumerable: true, get: function () { return messages_1.NotificationType7; } });\nObject.defineProperty(exports, \"NotificationType8\", { enumerable: true, get: function () { return messages_1.NotificationType8; } });\nObject.defineProperty(exports, \"NotificationType9\", { enumerable: true, get: function () { return messages_1.NotificationType9; } });\nObject.defineProperty(exports, \"ParameterStructures\", { enumerable: true, get: function () { return messages_1.ParameterStructures; } });\nconst linkedMap_1 = require(\"./linkedMap\");\nObject.defineProperty(exports, \"LinkedMap\", { enumerable: true, get: function () { return linkedMap_1.LinkedMap; } });\nObject.defineProperty(exports, \"LRUCache\", { enumerable: true, get: function () { return linkedMap_1.LRUCache; } });\nObject.defineProperty(exports, \"Touch\", { enumerable: true, get: function () { return linkedMap_1.Touch; } });\nconst disposable_1 = require(\"./disposable\");\nObject.defineProperty(exports, \"Disposable\", { enumerable: true, get: function () { return disposable_1.Disposable; } });\nconst events_1 = require(\"./events\");\nObject.defineProperty(exports, \"Event\", { enumerable: true, get: function () { return events_1.Event; } });\nObject.defineProperty(exports, \"Emitter\", { enumerable: true, get: function () { return events_1.Emitter; } });\nconst cancellation_1 = require(\"./cancellation\");\nObject.defineProperty(exports, \"CancellationTokenSource\", { enumerable: true, get: function () { return cancellation_1.CancellationTokenSource; } });\nObject.defineProperty(exports, \"CancellationToken\", { enumerable: true, get: function () { return cancellation_1.CancellationToken; } });\nconst sharedArrayCancellation_1 = require(\"./sharedArrayCancellation\");\nObject.defineProperty(exports, \"SharedArraySenderStrategy\", { enumerable: true, get: function () { return sharedArrayCancellation_1.SharedArraySenderStrategy; } });\nObject.defineProperty(exports, \"SharedArrayReceiverStrategy\", { enumerable: true, get: function () { return sharedArrayCancellation_1.SharedArrayReceiverStrategy; } });\nconst messageReader_1 = require(\"./messageReader\");\nObject.defineProperty(exports, \"MessageReader\", { enumerable: true, get: function () { return messageReader_1.MessageReader; } });\nObject.defineProperty(exports, \"AbstractMessageReader\", { enumerable: true, get: function () { return messageReader_1.AbstractMessageReader; } });\nObject.defineProperty(exports, \"ReadableStreamMessageReader\", { enumerable: true, get: function () { return messageReader_1.ReadableStreamMessageReader; } });\nconst messageWriter_1 = require(\"./messageWriter\");\nObject.defineProperty(exports, \"MessageWriter\", { enumerable: true, get: function () { return messageWriter_1.MessageWriter; } });\nObject.defineProperty(exports, \"AbstractMessageWriter\", { enumerable: true, get: function () { return messageWriter_1.AbstractMessageWriter; } });\nObject.defineProperty(exports, \"WriteableStreamMessageWriter\", { enumerable: true, get: function () { return messageWriter_1.WriteableStreamMessageWriter; } });\nconst messageBuffer_1 = require(\"./messageBuffer\");\nObject.defineProperty(exports, \"AbstractMessageBuffer\", { enumerable: true, get: function () { return messageBuffer_1.AbstractMessageBuffer; } });\nconst connection_1 = require(\"./connection\");\nObject.defineProperty(exports, \"ConnectionStrategy\", { enumerable: true, get: function () { return connection_1.ConnectionStrategy; } });\nObject.defineProperty(exports, \"ConnectionOptions\", { enumerable: true, get: function () { return connection_1.ConnectionOptions; } });\nObject.defineProperty(exports, \"NullLogger\", { enumerable: true, get: function () { return connection_1.NullLogger; } });\nObject.defineProperty(exports, \"createMessageConnection\", { enumerable: true, get: function () { return connection_1.createMessageConnection; } });\nObject.defineProperty(exports, \"ProgressToken\", { enumerable: true, get: function () { return connection_1.ProgressToken; } });\nObject.defineProperty(exports, \"ProgressType\", { enumerable: true, get: function () { return connection_1.ProgressType; } });\nObject.defineProperty(exports, \"Trace\", { enumerable: true, get: function () { return connection_1.Trace; } });\nObject.defineProperty(exports, \"TraceValue\", { enumerable: true, get: function () { return connection_1.TraceValue; } });\nObject.defineProperty(exports, \"TraceFormat\", { enumerable: true, get: function () { return connection_1.TraceFormat; } });\nObject.defineProperty(exports, \"SetTraceNotification\", { enumerable: true, get: function () { return connection_1.SetTraceNotification; } });\nObject.defineProperty(exports, \"LogTraceNotification\", { enumerable: true, get: function () { return connection_1.LogTraceNotification; } });\nObject.defineProperty(exports, \"ConnectionErrors\", { enumerable: true, get: function () { return connection_1.ConnectionErrors; } });\nObject.defineProperty(exports, \"ConnectionError\", { enumerable: true, get: function () { return connection_1.ConnectionError; } });\nObject.defineProperty(exports, \"CancellationReceiverStrategy\", { enumerable: true, get: function () { return connection_1.CancellationReceiverStrategy; } });\nObject.defineProperty(exports, \"IdCancellationReceiverStrategy\", { enumerable: true, get: function () { return connection_1.IdCancellationReceiverStrategy; } });\nObject.defineProperty(exports, \"RequestCancellationReceiverStrategy\", { enumerable: true, get: function () { return connection_1.RequestCancellationReceiverStrategy; } });\nObject.defineProperty(exports, \"CancellationSenderStrategy\", { enumerable: true, get: function () { return connection_1.CancellationSenderStrategy; } });\nObject.defineProperty(exports, \"CancellationStrategy\", { enumerable: true, get: function () { return connection_1.CancellationStrategy; } });\nObject.defineProperty(exports, \"MessageStrategy\", { enumerable: true, get: function () { return connection_1.MessageStrategy; } });\nObject.defineProperty(exports, \"TraceValues\", { enumerable: true, get: function () { return connection_1.TraceValues; } });\nconst ral_1 = __importDefault(require(\"./ral\"));\nexports.RAL = ral_1.default;\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'use strict';\nexport var DocumentUri;\n(function (DocumentUri) {\n    function is(value) {\n        return typeof value === 'string';\n    }\n    DocumentUri.is = is;\n})(DocumentUri || (DocumentUri = {}));\nexport var URI;\n(function (URI) {\n    function is(value) {\n        return typeof value === 'string';\n    }\n    URI.is = is;\n})(URI || (URI = {}));\nexport var 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 = {}));\nexport var 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 */\nexport var 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        const 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 */\nexport var 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        const 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 */\nexport var 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        const 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 */\nexport var 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        const 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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        const 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var Diagnostic;\n(function (Diagnostic) {\n    /**\n     * Creates a new Diagnostic literal.\n     */\n    function create(range, message, severity, code, source, relatedInformation) {\n        const 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        const candidate = value;\n        return Is.defined(candidate)\n            && Range.is(candidate.range)\n            && (Is.string(candidate.message) || MarkupContent.is(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    /**\n     * Checks whether the given diagnostic's message conforms to the 3.17.0\n     * version of the protocol where the message is a string.\n     *\n     * @param value the diagnostic\n     * @returns true if the diagnostic's message is a string, false otherwise.\n     */\n    function is3_17(value) {\n        return Is.string(value.message);\n    }\n    Diagnostic.is3_17 = is3_17;\n    /**\n     * Gets the message string of a diagnostic. If the message is already a\n     * string, it is returned as is. If the message is a MarkupContent,\n     * the value of the MarkupContent is returned. Otherwise an error is thrown.\n     *\n     * @param diagnostic the diagnostic to get the message string from.\n     * @returns the message string of the given diagnostic.\n     */\n    function getMessageString(diagnostic) {\n        if (Is.string(diagnostic.message)) {\n            return diagnostic.message;\n        }\n        else if (MarkupContent.is(diagnostic.message)) {\n            return diagnostic.message.value;\n        }\n        else {\n            throw new Error(`Unknown message type ${typeof diagnostic.message}`);\n        }\n    }\n    Diagnostic.getMessageString = getMessageString;\n})(Diagnostic || (Diagnostic = {}));\n/**\n * The Command namespace provides helper functions to work with\n * {@link Command} literals.\n */\nexport var Command;\n(function (Command) {\n    /**\n     * Creates a new Command literal.\n     */\n    function create(title, command, ...args) {\n        const 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        const candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.title) && (candidate.tooltip === undefined || Is.string(candidate.tooltip)) && 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 */\nexport var 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 = {}));\nexport var 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 = {}));\nexport var 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 = {}));\nexport var 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 */\nexport var 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        const 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 = {}));\nexport var CreateFile;\n(function (CreateFile) {\n    function create(uri, options, annotation) {\n        const 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        const 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 = {}));\nexport var RenameFile;\n(function (RenameFile) {\n    function create(oldUri, newUri, options, annotation) {\n        const 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        const 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 = {}));\nexport var DeleteFile;\n(function (DeleteFile) {\n    function create(uri, options, annotation) {\n        const 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        const 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 = {}));\nexport var WorkspaceEdit;\n(function (WorkspaceEdit) {\n    function is(value) {\n        const 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 = {}));\nclass TextEditChangeImpl {\n    constructor(edits, changeAnnotations) {\n        this.edits = edits;\n        this.changeAnnotations = changeAnnotations;\n    }\n    insert(position, newText, annotation) {\n        let edit;\n        let id;\n        if (annotation === undefined) {\n            edit = TextEdit.insert(position, newText);\n        }\n        else if (ChangeAnnotationIdentifier.is(annotation)) {\n            id = annotation;\n            edit = AnnotatedTextEdit.insert(position, newText, annotation);\n        }\n        else {\n            this.assertChangeAnnotations(this.changeAnnotations);\n            id = this.changeAnnotations.manage(annotation);\n            edit = AnnotatedTextEdit.insert(position, newText, id);\n        }\n        this.edits.push(edit);\n        if (id !== undefined) {\n            return id;\n        }\n    }\n    replace(range, newText, annotation) {\n        let edit;\n        let id;\n        if (annotation === undefined) {\n            edit = TextEdit.replace(range, newText);\n        }\n        else if (ChangeAnnotationIdentifier.is(annotation)) {\n            id = annotation;\n            edit = AnnotatedTextEdit.replace(range, newText, annotation);\n        }\n        else {\n            this.assertChangeAnnotations(this.changeAnnotations);\n            id = this.changeAnnotations.manage(annotation);\n            edit = AnnotatedTextEdit.replace(range, newText, id);\n        }\n        this.edits.push(edit);\n        if (id !== undefined) {\n            return id;\n        }\n    }\n    delete(range, annotation) {\n        let edit;\n        let id;\n        if (annotation === undefined) {\n            edit = TextEdit.del(range);\n        }\n        else if (ChangeAnnotationIdentifier.is(annotation)) {\n            id = annotation;\n            edit = AnnotatedTextEdit.del(range, annotation);\n        }\n        else {\n            this.assertChangeAnnotations(this.changeAnnotations);\n            id = this.changeAnnotations.manage(annotation);\n            edit = AnnotatedTextEdit.del(range, id);\n        }\n        this.edits.push(edit);\n        if (id !== undefined) {\n            return id;\n        }\n    }\n    add(edit) {\n        this.edits.push(edit);\n    }\n    all() {\n        return this.edits;\n    }\n    clear() {\n        this.edits.splice(0, this.edits.length);\n    }\n    assertChangeAnnotations(value) {\n        if (value === undefined) {\n            throw new Error(`Text edit change is not configured to manage change annotations.`);\n        }\n    }\n}\nexport var SnippetTextEdit;\n(function (SnippetTextEdit) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate)\n            && Range.is(candidate.range)\n            && StringValue.isSnippet(candidate.snippet)\n            && (candidate.annotationId === undefined ||\n                (ChangeAnnotation.is(candidate.annotationId) || ChangeAnnotationIdentifier.is(candidate.annotationId)));\n    }\n    SnippetTextEdit.is = is;\n})(SnippetTextEdit || (SnippetTextEdit = {}));\n/**\n * A helper class\n */\nclass ChangeAnnotations {\n    constructor(annotations) {\n        this._annotations = annotations === undefined ? Object.create(null) : annotations;\n        this._counter = 0;\n        this._size = 0;\n    }\n    all() {\n        return this._annotations;\n    }\n    get size() {\n        return this._size;\n    }\n    manage(idOrAnnotation, annotation) {\n        let id;\n        if (ChangeAnnotationIdentifier.is(idOrAnnotation)) {\n            id = idOrAnnotation;\n        }\n        else {\n            id = this.nextId();\n            annotation = idOrAnnotation;\n        }\n        if (this._annotations[id] !== undefined) {\n            throw new Error(`Id ${id} is already in use.`);\n        }\n        if (annotation === undefined) {\n            throw new Error(`No annotation provided for id ${id}`);\n        }\n        this._annotations[id] = annotation;\n        this._size++;\n        return id;\n    }\n    nextId() {\n        this._counter++;\n        return this._counter.toString();\n    }\n}\n/**\n * A workspace change helps constructing changes to a workspace.\n */\nexport class WorkspaceChange {\n    constructor(workspaceEdit) {\n        this._textEditChanges = Object.create(null);\n        if (workspaceEdit !== undefined) {\n            this._workspaceEdit = workspaceEdit;\n            if (workspaceEdit.documentChanges) {\n                this._changeAnnotations = new ChangeAnnotations(workspaceEdit.changeAnnotations);\n                workspaceEdit.changeAnnotations = this._changeAnnotations.all();\n                workspaceEdit.documentChanges.forEach((change) => {\n                    if (TextDocumentEdit.is(change)) {\n                        const textEditChange = new TextEditChangeImpl(change.edits, this._changeAnnotations);\n                        this._textEditChanges[change.textDocument.uri] = textEditChange;\n                    }\n                });\n            }\n            else if (workspaceEdit.changes) {\n                Object.keys(workspaceEdit.changes).forEach((key) => {\n                    const textEditChange = new TextEditChangeImpl(workspaceEdit.changes[key]);\n                    this._textEditChanges[key] = textEditChange;\n                });\n            }\n        }\n        else {\n            this._workspaceEdit = {};\n        }\n    }\n    /**\n     * Returns the underlying {@link WorkspaceEdit} literal\n     * use to be returned from a workspace edit operation like rename.\n     */\n    get edit() {\n        this.initDocumentChanges();\n        if (this._changeAnnotations !== undefined) {\n            if (this._changeAnnotations.size === 0) {\n                this._workspaceEdit.changeAnnotations = undefined;\n            }\n            else {\n                this._workspaceEdit.changeAnnotations = this._changeAnnotations.all();\n            }\n        }\n        return this._workspaceEdit;\n    }\n    getTextEditChange(key) {\n        if (OptionalVersionedTextDocumentIdentifier.is(key)) {\n            this.initDocumentChanges();\n            if (this._workspaceEdit.documentChanges === undefined) {\n                throw new Error('Workspace edit is not configured for document changes.');\n            }\n            const textDocument = { uri: key.uri, version: key.version };\n            let result = this._textEditChanges[textDocument.uri];\n            if (!result) {\n                const edits = [];\n                const textDocumentEdit = {\n                    textDocument,\n                    edits\n                };\n                this._workspaceEdit.documentChanges.push(textDocumentEdit);\n                result = new TextEditChangeImpl(edits, this._changeAnnotations);\n                this._textEditChanges[textDocument.uri] = result;\n            }\n            return result;\n        }\n        else {\n            this.initChanges();\n            if (this._workspaceEdit.changes === undefined) {\n                throw new Error('Workspace edit is not configured for normal text edit changes.');\n            }\n            let result = this._textEditChanges[key];\n            if (!result) {\n                const edits = [];\n                this._workspaceEdit.changes[key] = edits;\n                result = new TextEditChangeImpl(edits);\n                this._textEditChanges[key] = result;\n            }\n            return result;\n        }\n    }\n    initDocumentChanges() {\n        if (this._workspaceEdit.documentChanges === undefined && this._workspaceEdit.changes === undefined) {\n            this._changeAnnotations = new ChangeAnnotations();\n            this._workspaceEdit.documentChanges = [];\n            this._workspaceEdit.changeAnnotations = this._changeAnnotations.all();\n        }\n    }\n    initChanges() {\n        if (this._workspaceEdit.documentChanges === undefined && this._workspaceEdit.changes === undefined) {\n            this._workspaceEdit.changes = Object.create(null);\n        }\n    }\n    createFile(uri, optionsOrAnnotation, options) {\n        this.initDocumentChanges();\n        if (this._workspaceEdit.documentChanges === undefined) {\n            throw new Error('Workspace edit is not configured for document changes.');\n        }\n        let annotation;\n        if (ChangeAnnotation.is(optionsOrAnnotation) || ChangeAnnotationIdentifier.is(optionsOrAnnotation)) {\n            annotation = optionsOrAnnotation;\n        }\n        else {\n            options = optionsOrAnnotation;\n        }\n        let operation;\n        let id;\n        if (annotation === undefined) {\n            operation = CreateFile.create(uri, options);\n        }\n        else {\n            id = ChangeAnnotationIdentifier.is(annotation) ? annotation : this._changeAnnotations.manage(annotation);\n            operation = CreateFile.create(uri, options, id);\n        }\n        this._workspaceEdit.documentChanges.push(operation);\n        if (id !== undefined) {\n            return id;\n        }\n    }\n    renameFile(oldUri, newUri, optionsOrAnnotation, options) {\n        this.initDocumentChanges();\n        if (this._workspaceEdit.documentChanges === undefined) {\n            throw new Error('Workspace edit is not configured for document changes.');\n        }\n        let annotation;\n        if (ChangeAnnotation.is(optionsOrAnnotation) || ChangeAnnotationIdentifier.is(optionsOrAnnotation)) {\n            annotation = optionsOrAnnotation;\n        }\n        else {\n            options = optionsOrAnnotation;\n        }\n        let operation;\n        let id;\n        if (annotation === undefined) {\n            operation = RenameFile.create(oldUri, newUri, options);\n        }\n        else {\n            id = ChangeAnnotationIdentifier.is(annotation) ? annotation : this._changeAnnotations.manage(annotation);\n            operation = RenameFile.create(oldUri, newUri, options, id);\n        }\n        this._workspaceEdit.documentChanges.push(operation);\n        if (id !== undefined) {\n            return id;\n        }\n    }\n    deleteFile(uri, optionsOrAnnotation, options) {\n        this.initDocumentChanges();\n        if (this._workspaceEdit.documentChanges === undefined) {\n            throw new Error('Workspace edit is not configured for document changes.');\n        }\n        let annotation;\n        if (ChangeAnnotation.is(optionsOrAnnotation) || ChangeAnnotationIdentifier.is(optionsOrAnnotation)) {\n            annotation = optionsOrAnnotation;\n        }\n        else {\n            options = optionsOrAnnotation;\n        }\n        let operation;\n        let id;\n        if (annotation === undefined) {\n            operation = DeleteFile.create(uri, options);\n        }\n        else {\n            id = ChangeAnnotationIdentifier.is(annotation) ? annotation : this._changeAnnotations.manage(annotation);\n            operation = DeleteFile.create(uri, options, id);\n        }\n        this._workspaceEdit.documentChanges.push(operation);\n        if (id !== undefined) {\n            return id;\n        }\n    }\n}\n/**\n * The TextDocumentIdentifier namespace provides helper functions to work with\n * {@link TextDocumentIdentifier} literals.\n */\nexport var 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        const 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 */\nexport var 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        const 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 */\nexport var 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        const 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 * Predefined Language kinds\n * @since 3.18.0\n */\nexport var LanguageKind;\n(function (LanguageKind) {\n    LanguageKind.ABAP = 'abap';\n    LanguageKind.WindowsBat = 'bat';\n    LanguageKind.BibTeX = 'bibtex';\n    LanguageKind.Clojure = 'clojure';\n    LanguageKind.Coffeescript = 'coffeescript';\n    LanguageKind.C = 'c';\n    LanguageKind.CPP = 'cpp';\n    LanguageKind.CSharp = 'csharp';\n    LanguageKind.CSS = 'css';\n    /**\n     * @since 3.18.0\n     */\n    LanguageKind.D = 'd';\n    /**\n     * @since 3.18.0\n     */\n    LanguageKind.Delphi = 'pascal';\n    LanguageKind.Diff = 'diff';\n    LanguageKind.Dart = 'dart';\n    LanguageKind.Dockerfile = 'dockerfile';\n    LanguageKind.Elixir = 'elixir';\n    LanguageKind.Erlang = 'erlang';\n    LanguageKind.FSharp = 'fsharp';\n    LanguageKind.GitCommit = 'git-commit';\n    LanguageKind.GitRebase = 'git-rebase';\n    LanguageKind.Go = 'go';\n    LanguageKind.Groovy = 'groovy';\n    LanguageKind.Handlebars = 'handlebars';\n    LanguageKind.Haskell = 'haskell';\n    LanguageKind.HTML = 'html';\n    LanguageKind.Ini = 'ini';\n    LanguageKind.Java = 'java';\n    LanguageKind.JavaScript = 'javascript';\n    LanguageKind.JavaScriptReact = 'javascriptreact';\n    LanguageKind.JSON = 'json';\n    LanguageKind.LaTeX = 'latex';\n    LanguageKind.Less = 'less';\n    LanguageKind.Lua = 'lua';\n    LanguageKind.Makefile = 'makefile';\n    LanguageKind.Markdown = 'markdown';\n    LanguageKind.ObjectiveC = 'objective-c';\n    LanguageKind.ObjectiveCPP = 'objective-cpp';\n    /**\n     * @since 3.18.0\n     */\n    LanguageKind.Pascal = 'pascal';\n    LanguageKind.Perl = 'perl';\n    LanguageKind.Perl6 = 'perl6';\n    LanguageKind.PHP = 'php';\n    LanguageKind.Plaintext = 'plaintext';\n    LanguageKind.Powershell = 'powershell';\n    LanguageKind.Pug = 'jade';\n    LanguageKind.Python = 'python';\n    LanguageKind.R = 'r';\n    LanguageKind.Razor = 'razor';\n    LanguageKind.Ruby = 'ruby';\n    LanguageKind.Rust = 'rust';\n    LanguageKind.SCSS = 'scss';\n    LanguageKind.SASS = 'sass';\n    LanguageKind.Scala = 'scala';\n    LanguageKind.ShaderLab = 'shaderlab';\n    LanguageKind.ShellScript = 'shellscript';\n    LanguageKind.SQL = 'sql';\n    LanguageKind.Swift = 'swift';\n    LanguageKind.TypeScript = 'typescript';\n    LanguageKind.TypeScriptReact = 'typescriptreact';\n    LanguageKind.TeX = 'tex';\n    LanguageKind.VisualBasic = 'vb';\n    LanguageKind.XML = 'xml';\n    LanguageKind.XSL = 'xsl';\n    LanguageKind.YAML = 'yaml';\n})(LanguageKind || (LanguageKind = {}));\n/**\n * The TextDocumentItem namespace provides helper functions to work with\n * {@link TextDocumentItem} literals.\n */\nexport var 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        const 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 */\nexport var 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 = {}));\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 = {}));\n/**\n * Defines how values from a set of defaults and an individual item will be\n * merged.\n *\n * @since 3.18.0\n */\nexport var ApplyKind;\n(function (ApplyKind) {\n    /**\n     * The value from the individual item (if provided and not `null`) will be\n     * used instead of the default.\n     */\n    ApplyKind.Replace = 1;\n    /**\n     * The value from the item will be merged with the default.\n     *\n     * The specific rules for mergeing values are defined against each field\n     * that supports merging.\n     */\n    ApplyKind.Merge = 2;\n})(ApplyKind || (ApplyKind = {}));\nexport var 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 */\nexport var 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 */\nexport var 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 = {}));\nexport var 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 = {}));\nexport var Hover;\n(function (Hover) {\n    /**\n     * Checks whether the given value conforms to the {@link Hover} interface.\n     */\n    function is(value) {\n        const 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 */\nexport var 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 */\nexport var SignatureInformation;\n(function (SignatureInformation) {\n    function create(label, documentation, ...parameters) {\n        const 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 */\nexport var 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 */\nexport var 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        const 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 */\nexport var 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 */\nexport var SymbolTag;\n(function (SymbolTag) {\n    /**\n     * Render a symbol as obsolete, usually using a strike-out.\n     */\n    SymbolTag.Deprecated = 1;\n})(SymbolTag || (SymbolTag = {}));\nexport var 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        const 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 = {}));\nexport var 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 = {}));\nexport var 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        const 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        const 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 */\nexport var 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 move actions: `refactor.move`\n     *\n     * Example move actions:\n     *\n     * - Move a function to a new file\n     * - Move a property between classes\n     * - Move method to base class\n     * - ...\n     *\n     * @since 3.18.0\n     */\n    CodeActionKind.RefactorMove = 'refactor.move';\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    /**\n     * Base kind for all code actions applying to the entire notebook's scope. CodeActionKinds using\n     * this should always begin with `notebook.`\n     *\n     * @since 3.18.0\n     */\n    CodeActionKind.Notebook = 'notebook';\n})(CodeActionKind || (CodeActionKind = {}));\n/**\n * The reason why code actions were requested.\n *\n * @since 3.17.0\n */\nexport var 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 */\nexport var CodeActionContext;\n(function (CodeActionContext) {\n    /**\n     * Creates a new CodeActionContext literal.\n     */\n    function create(diagnostics, only, triggerKind) {\n        const 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        const 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 = {}));\n/**\n * Code action tags are extra annotations that tweak the behavior of a code action.\n *\n * @since 3.18.0 - proposed\n */\nexport var CodeActionTag;\n(function (CodeActionTag) {\n    /**\n     * Marks the code action as LLM-generated.\n     */\n    CodeActionTag.LLMGenerated = 1;\n    /**\n     * Checks whether the given literal conforms to the {@link CodeActionTag} interface.\n     */\n    function is(value) {\n        return Is.defined(value) && value === CodeActionTag.LLMGenerated;\n    }\n    CodeActionTag.is = is;\n})(CodeActionTag || (CodeActionTag = {}));\nexport var CodeAction;\n(function (CodeAction) {\n    function create(title, kindOrCommandOrEdit, kind) {\n        const 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        const 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            (candidate.tags === undefined || Is.typedArray(candidate.tags, CodeActionTag.is));\n    }\n    CodeAction.is = is;\n})(CodeAction || (CodeAction = {}));\n/**\n * The CodeLens namespace provides helper functions to work with\n * {@link CodeLens} literals.\n */\nexport var CodeLens;\n(function (CodeLens) {\n    /**\n     * Creates a new CodeLens literal.\n     */\n    function create(range, data) {\n        const 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        const 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 */\nexport var 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        const 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 */\nexport var 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        const 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 */\nexport var 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        const 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 */\nexport var 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    /**\n     * @since 3.18.0\n     */\n    SemanticTokenTypes[\"label\"] = \"label\";\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 */\nexport var 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 */\nexport var 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 */\nexport var 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\n * deal with InlineValueVariableLookups.\n *\n * @since 3.17.0\n */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 = {}));\nexport var 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 = {}));\nexport var 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 = {}));\nexport var StringValue;\n(function (StringValue) {\n    function createSnippet(value) {\n        return { kind: 'snippet', value };\n    }\n    StringValue.createSnippet = createSnippet;\n    function isSnippet(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate)\n            && candidate.kind === 'snippet'\n            && Is.string(candidate.value);\n    }\n    StringValue.isSnippet = isSnippet;\n})(StringValue || (StringValue = {}));\nexport var 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 = {}));\nexport var 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 */\nexport var InlineCompletionTriggerKind;\n(function (InlineCompletionTriggerKind) {\n    /**\n     * Completion was triggered explicitly by a user gesture.\n     */\n    InlineCompletionTriggerKind.Invoked = 1;\n    /**\n     * Completion was triggered automatically while editing.\n     */\n    InlineCompletionTriggerKind.Automatic = 2;\n})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));\nexport var SelectedCompletionInfo;\n(function (SelectedCompletionInfo) {\n    function create(range, text) {\n        return { range, text };\n    }\n    SelectedCompletionInfo.create = create;\n})(SelectedCompletionInfo || (SelectedCompletionInfo = {}));\nexport var InlineCompletionContext;\n(function (InlineCompletionContext) {\n    function create(triggerKind, selectedCompletionInfo) {\n        return { triggerKind, selectedCompletionInfo };\n    }\n    InlineCompletionContext.create = create;\n})(InlineCompletionContext || (InlineCompletionContext = {}));\nexport var 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 = {}));\nexport const EOL = ['\\n', '\\r\\n', '\\r'];\n/**\n * @deprecated Use the text document from the new vscode-languageserver-textdocument package.\n */\nexport var 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        const 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        const sortedEdits = mergeSort(edits, (a, b) => {\n            const 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            const e = sortedEdits[i];\n            const startOffset = document.offsetAt(e.range.start);\n            const 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            const 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            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(event, version) {\n        this._content = event.text;\n        this._version = version;\n        this._lineOffsets = undefined;\n    }\n    getLineOffsets() {\n        if (this._lineOffsets === undefined) {\n            const lineOffsets = [];\n            const 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                const 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        const 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            const 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        const line = low - 1;\n        return Position.create(line, offset - lineOffsets[line]);\n    }\n    offsetAt(position) {\n        const 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        const lineOffset = lineOffsets[position.line];\n        const 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(value) {\n        return typeof value === 'undefined';\n    }\n    Is.undefined = undefined;\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", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CM = exports.ProtocolNotificationType = exports.ProtocolNotificationType0 = exports.ProtocolRequestType = exports.ProtocolRequestType0 = exports.RegistrationType = exports.MessageDirection = void 0;\nconst vscode_jsonrpc_1 = require(\"vscode-jsonrpc\");\nvar MessageDirection;\n(function (MessageDirection) {\n    MessageDirection[\"clientToServer\"] = \"clientToServer\";\n    MessageDirection[\"serverToClient\"] = \"serverToClient\";\n    MessageDirection[\"both\"] = \"both\";\n})(MessageDirection || (exports.MessageDirection = MessageDirection = {}));\nclass RegistrationType {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    ____;\n    method;\n    constructor(method) {\n        this.method = method;\n    }\n}\nexports.RegistrationType = RegistrationType;\nclass ProtocolRequestType0 extends vscode_jsonrpc_1.RequestType0 {\n    /**\n     * Clients must not use these properties. They are here to ensure correct typing.\n     * in TypeScript\n     */\n    __;\n    ___;\n    ____;\n    _pr;\n    constructor(method) {\n        super(method);\n    }\n}\nexports.ProtocolRequestType0 = ProtocolRequestType0;\nclass ProtocolRequestType extends vscode_jsonrpc_1.RequestType {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    __;\n    ___;\n    ____;\n    _pr;\n    constructor(method) {\n        super(method, vscode_jsonrpc_1.ParameterStructures.byName);\n    }\n}\nexports.ProtocolRequestType = ProtocolRequestType;\nclass ProtocolNotificationType0 extends vscode_jsonrpc_1.NotificationType0 {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    ___;\n    ____;\n    constructor(method) {\n        super(method);\n    }\n}\nexports.ProtocolNotificationType0 = ProtocolNotificationType0;\nclass ProtocolNotificationType extends vscode_jsonrpc_1.NotificationType {\n    /**\n     * Clients must not use this property. It is here to ensure correct typing.\n     */\n    ___;\n    ____;\n    constructor(method) {\n        super(method, vscode_jsonrpc_1.ParameterStructures.byName);\n    }\n}\nexports.ProtocolNotificationType = ProtocolNotificationType;\nvar CM;\n(function (CM) {\n    function create(client, server) {\n        return { client, server };\n    }\n    CM.create = create;\n})(CM || (exports.CM = CM = {}));\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.boolean = boolean;\nexports.string = string;\nexports.number = number;\nexports.error = error;\nexports.func = func;\nexports.array = array;\nexports.stringArray = stringArray;\nexports.typedArray = typedArray;\nexports.objectLiteral = objectLiteral;\nfunction boolean(value) {\n    return value === true || value === false;\n}\nfunction string(value) {\n    return typeof value === 'string' || value instanceof String;\n}\nfunction number(value) {\n    return typeof value === 'number' || value instanceof Number;\n}\nfunction error(value) {\n    return value instanceof Error;\n}\nfunction func(value) {\n    return typeof value === 'function';\n}\nfunction array(value) {\n    return Array.isArray(value);\n}\nfunction stringArray(value) {\n    return array(value) && value.every(elem => string(elem));\n}\nfunction typedArray(value, check) {\n    return Array.isArray(value) && value.every(check);\n}\nfunction 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", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ImplementationRequest = void 0;\nconst messages_1 = require(\"./messages\");\n// @ts-ignore: to avoid inlining LocationLink as dynamic import\nlet __noDynamicImport;\n/**\n * A request to resolve the implementation locations of a symbol at a given text\n * document position. The request's parameter is of type {@link TextDocumentPositionParams}\n * the response is of type {@link Definition} or a Thenable that resolves to such.\n */\nvar ImplementationRequest;\n(function (ImplementationRequest) {\n    ImplementationRequest.method = 'textDocument/implementation';\n    ImplementationRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    ImplementationRequest.type = new messages_1.ProtocolRequestType(ImplementationRequest.method);\n    ImplementationRequest.capabilities = messages_1.CM.create('textDocument.implementation', 'implementationProvider');\n})(ImplementationRequest || (exports.ImplementationRequest = ImplementationRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TypeDefinitionRequest = void 0;\nconst messages_1 = require(\"./messages\");\n// @ts-ignore: to avoid inlining LocationLink as dynamic import\nlet __noDynamicImport;\n/**\n * A request to resolve the type definition locations of a symbol at a given text\n * document position. The request's parameter is of type {@link TextDocumentPositionParams}\n * the response is of type {@link Definition} or a Thenable that resolves to such.\n */\nvar TypeDefinitionRequest;\n(function (TypeDefinitionRequest) {\n    TypeDefinitionRequest.method = 'textDocument/typeDefinition';\n    TypeDefinitionRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    TypeDefinitionRequest.type = new messages_1.ProtocolRequestType(TypeDefinitionRequest.method);\n    TypeDefinitionRequest.capabilities = messages_1.CM.create('textDocument.typeDefinition', 'typeDefinitionProvider');\n})(TypeDefinitionRequest || (exports.TypeDefinitionRequest = TypeDefinitionRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DidChangeWorkspaceFoldersNotification = exports.WorkspaceFoldersRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * The `workspace/workspaceFolders` is sent from the server to the client to fetch the open workspace folders.\n */\nvar WorkspaceFoldersRequest;\n(function (WorkspaceFoldersRequest) {\n    WorkspaceFoldersRequest.method = 'workspace/workspaceFolders';\n    WorkspaceFoldersRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    WorkspaceFoldersRequest.type = new messages_1.ProtocolRequestType0(WorkspaceFoldersRequest.method);\n    WorkspaceFoldersRequest.capabilities = messages_1.CM.create('workspace.workspaceFolders', 'workspace.workspaceFolders');\n})(WorkspaceFoldersRequest || (exports.WorkspaceFoldersRequest = WorkspaceFoldersRequest = {}));\n/**\n * The `workspace/didChangeWorkspaceFolders` notification is sent from the client to the server when the workspace\n * folder configuration changes.\n */\nvar DidChangeWorkspaceFoldersNotification;\n(function (DidChangeWorkspaceFoldersNotification) {\n    DidChangeWorkspaceFoldersNotification.method = 'workspace/didChangeWorkspaceFolders';\n    DidChangeWorkspaceFoldersNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidChangeWorkspaceFoldersNotification.type = new messages_1.ProtocolNotificationType(DidChangeWorkspaceFoldersNotification.method);\n    DidChangeWorkspaceFoldersNotification.capabilities = messages_1.CM.create(undefined, 'workspace.workspaceFolders.changeNotifications');\n})(DidChangeWorkspaceFoldersNotification || (exports.DidChangeWorkspaceFoldersNotification = DidChangeWorkspaceFoldersNotification = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ConfigurationRequest = void 0;\nconst messages_1 = require(\"./messages\");\n//---- Get Configuration request ----\n/**\n * The 'workspace/configuration' request is sent from the server to the client to fetch a certain\n * configuration setting.\n *\n * This pull model replaces the old push model were the client signaled configuration change via an\n * event. If the server still needs to react to configuration changes (since the server caches the\n * result of `workspace/configuration` requests) the server should register for an empty configuration\n * change event and empty the cache if such an event is received.\n */\nvar ConfigurationRequest;\n(function (ConfigurationRequest) {\n    ConfigurationRequest.method = 'workspace/configuration';\n    ConfigurationRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    ConfigurationRequest.type = new messages_1.ProtocolRequestType(ConfigurationRequest.method);\n    ConfigurationRequest.capabilities = messages_1.CM.create('workspace.configuration', undefined);\n})(ConfigurationRequest || (exports.ConfigurationRequest = ConfigurationRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ColorPresentationRequest = exports.DocumentColorRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to list all color symbols found in a given text document. The request's\n * parameter is of type {@link DocumentColorParams} the\n * response is of type {@link ColorInformation ColorInformation[]} or a Thenable\n * that resolves to such.\n */\nvar DocumentColorRequest;\n(function (DocumentColorRequest) {\n    DocumentColorRequest.method = 'textDocument/documentColor';\n    DocumentColorRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentColorRequest.type = new messages_1.ProtocolRequestType(DocumentColorRequest.method);\n    DocumentColorRequest.capabilities = messages_1.CM.create('textDocument.colorProvider', 'colorProvider');\n})(DocumentColorRequest || (exports.DocumentColorRequest = DocumentColorRequest = {}));\n/**\n * A request to list all presentation for a color. The request's\n * parameter is of type {@link ColorPresentationParams} the\n * response is of type {@link ColorPresentation ColorPresentation[]} or a Thenable\n * that resolves to such.\n */\nvar ColorPresentationRequest;\n(function (ColorPresentationRequest) {\n    ColorPresentationRequest.method = 'textDocument/colorPresentation';\n    ColorPresentationRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    ColorPresentationRequest.type = new messages_1.ProtocolRequestType(ColorPresentationRequest.method);\n    ColorPresentationRequest.capabilities = messages_1.CM.create('textDocument.colorProvider', 'colorProvider');\n})(ColorPresentationRequest || (exports.ColorPresentationRequest = ColorPresentationRequest = {}));\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FoldingRangeRefreshRequest = exports.FoldingRangeRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to provide folding ranges in a document. The request's\n * parameter is of type {@link FoldingRangeParams}, the\n * response is of type {@link FoldingRangeList} or a Thenable\n * that resolves to such.\n */\nvar FoldingRangeRequest;\n(function (FoldingRangeRequest) {\n    FoldingRangeRequest.method = 'textDocument/foldingRange';\n    FoldingRangeRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    FoldingRangeRequest.type = new messages_1.ProtocolRequestType(FoldingRangeRequest.method);\n    FoldingRangeRequest.capabilities = messages_1.CM.create('textDocument.foldingRange', 'foldingRangeProvider');\n})(FoldingRangeRequest || (exports.FoldingRangeRequest = FoldingRangeRequest = {}));\n/**\n * A request to refresh the folding ranges in a document.\n *\n * @since 3.18.0\n */\nvar FoldingRangeRefreshRequest;\n(function (FoldingRangeRefreshRequest) {\n    FoldingRangeRefreshRequest.method = `workspace/foldingRange/refresh`;\n    FoldingRangeRefreshRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    FoldingRangeRefreshRequest.type = new messages_1.ProtocolRequestType0(FoldingRangeRefreshRequest.method);\n    FoldingRangeRefreshRequest.capabilities = messages_1.CM.create('workspace.foldingRange.refreshSupport', undefined);\n})(FoldingRangeRefreshRequest || (exports.FoldingRangeRefreshRequest = FoldingRangeRefreshRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DeclarationRequest = void 0;\nconst messages_1 = require(\"./messages\");\n// @ts-ignore: to avoid inlining LocationLink as dynamic import\nlet __noDynamicImport;\n/**\n * A request to resolve the type definition locations of a symbol at a given text\n * document position. The request's parameter is of type {@link TextDocumentPositionParams}\n * the response is of type {@link Declaration} or a typed array of {@link DeclarationLink}\n * or a Thenable that resolves to such.\n */\nvar DeclarationRequest;\n(function (DeclarationRequest) {\n    DeclarationRequest.method = 'textDocument/declaration';\n    DeclarationRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DeclarationRequest.type = new messages_1.ProtocolRequestType(DeclarationRequest.method);\n    DeclarationRequest.capabilities = messages_1.CM.create('textDocument.declaration', 'declarationProvider');\n})(DeclarationRequest || (exports.DeclarationRequest = DeclarationRequest = {}));\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SelectionRangeRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to provide selection ranges in a document. The request's\n * parameter is of type {@link SelectionRangeParams}, the\n * response is of type {@link SelectionRange SelectionRange[]} or a Thenable\n * that resolves to such.\n */\nvar SelectionRangeRequest;\n(function (SelectionRangeRequest) {\n    SelectionRangeRequest.method = 'textDocument/selectionRange';\n    SelectionRangeRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    SelectionRangeRequest.type = new messages_1.ProtocolRequestType(SelectionRangeRequest.method);\n    SelectionRangeRequest.capabilities = messages_1.CM.create('textDocument.selectionRange', 'selectionRangeProvider');\n})(SelectionRangeRequest || (exports.SelectionRangeRequest = SelectionRangeRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WorkDoneProgressCancelNotification = exports.WorkDoneProgressCreateRequest = exports.WorkDoneProgress = void 0;\nconst vscode_jsonrpc_1 = require(\"vscode-jsonrpc\");\nconst messages_1 = require(\"./messages\");\nvar WorkDoneProgress;\n(function (WorkDoneProgress) {\n    WorkDoneProgress.type = new vscode_jsonrpc_1.ProgressType();\n    function is(value) {\n        return value === WorkDoneProgress.type;\n    }\n    WorkDoneProgress.is = is;\n})(WorkDoneProgress || (exports.WorkDoneProgress = WorkDoneProgress = {}));\n/**\n * The `window/workDoneProgress/create` request is sent from the server to the client to initiate progress\n * reporting from the server.\n */\nvar WorkDoneProgressCreateRequest;\n(function (WorkDoneProgressCreateRequest) {\n    WorkDoneProgressCreateRequest.method = 'window/workDoneProgress/create';\n    WorkDoneProgressCreateRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    WorkDoneProgressCreateRequest.type = new messages_1.ProtocolRequestType(WorkDoneProgressCreateRequest.method);\n    WorkDoneProgressCreateRequest.capabilities = messages_1.CM.create('window.workDoneProgress', undefined);\n})(WorkDoneProgressCreateRequest || (exports.WorkDoneProgressCreateRequest = WorkDoneProgressCreateRequest = {}));\n/**\n * The `window/workDoneProgress/cancel` notification is sent from  the client to the server to cancel a progress\n * initiated on the server side.\n */\nvar WorkDoneProgressCancelNotification;\n(function (WorkDoneProgressCancelNotification) {\n    WorkDoneProgressCancelNotification.method = 'window/workDoneProgress/cancel';\n    WorkDoneProgressCancelNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    WorkDoneProgressCancelNotification.type = new messages_1.ProtocolNotificationType(WorkDoneProgressCancelNotification.method);\n})(WorkDoneProgressCancelNotification || (exports.WorkDoneProgressCancelNotification = WorkDoneProgressCancelNotification = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) TypeFox, Microsoft and others. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CallHierarchyOutgoingCallsRequest = exports.CallHierarchyIncomingCallsRequest = exports.CallHierarchyPrepareRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to result a `CallHierarchyItem` in a document at a given position.\n * Can be used as an input to an incoming or outgoing call hierarchy.\n *\n * @since 3.16.0\n */\nvar CallHierarchyPrepareRequest;\n(function (CallHierarchyPrepareRequest) {\n    CallHierarchyPrepareRequest.method = 'textDocument/prepareCallHierarchy';\n    CallHierarchyPrepareRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CallHierarchyPrepareRequest.type = new messages_1.ProtocolRequestType(CallHierarchyPrepareRequest.method);\n    CallHierarchyPrepareRequest.capabilities = messages_1.CM.create('textDocument.callHierarchy', 'callHierarchyProvider');\n})(CallHierarchyPrepareRequest || (exports.CallHierarchyPrepareRequest = CallHierarchyPrepareRequest = {}));\n/**\n * A request to resolve the incoming calls for a given `CallHierarchyItem`.\n *\n * @since 3.16.0\n */\nvar CallHierarchyIncomingCallsRequest;\n(function (CallHierarchyIncomingCallsRequest) {\n    CallHierarchyIncomingCallsRequest.method = 'callHierarchy/incomingCalls';\n    CallHierarchyIncomingCallsRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CallHierarchyIncomingCallsRequest.type = new messages_1.ProtocolRequestType(CallHierarchyIncomingCallsRequest.method);\n    CallHierarchyIncomingCallsRequest.capabilities = messages_1.CM.create('textDocument.callHierarchy', 'callHierarchyProvider');\n})(CallHierarchyIncomingCallsRequest || (exports.CallHierarchyIncomingCallsRequest = CallHierarchyIncomingCallsRequest = {}));\n/**\n * A request to resolve the outgoing calls for a given `CallHierarchyItem`.\n *\n * @since 3.16.0\n */\nvar CallHierarchyOutgoingCallsRequest;\n(function (CallHierarchyOutgoingCallsRequest) {\n    CallHierarchyOutgoingCallsRequest.method = 'callHierarchy/outgoingCalls';\n    CallHierarchyOutgoingCallsRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CallHierarchyOutgoingCallsRequest.type = new messages_1.ProtocolRequestType(CallHierarchyOutgoingCallsRequest.method);\n    CallHierarchyOutgoingCallsRequest.capabilities = messages_1.CM.create('textDocument.callHierarchy', 'callHierarchyProvider');\n})(CallHierarchyOutgoingCallsRequest || (exports.CallHierarchyOutgoingCallsRequest = CallHierarchyOutgoingCallsRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SemanticTokensRefreshRequest = exports.SemanticTokensRangeRequest = exports.SemanticTokensDeltaRequest = exports.SemanticTokensRequest = exports.SemanticTokensRegistrationType = exports.TokenFormat = void 0;\nconst messages_1 = require(\"./messages\");\n//------- 'textDocument/semanticTokens' -----\nvar TokenFormat;\n(function (TokenFormat) {\n    TokenFormat.Relative = 'relative';\n})(TokenFormat || (exports.TokenFormat = TokenFormat = {}));\nvar SemanticTokensRegistrationType;\n(function (SemanticTokensRegistrationType) {\n    SemanticTokensRegistrationType.method = 'textDocument/semanticTokens';\n    SemanticTokensRegistrationType.type = new messages_1.RegistrationType(SemanticTokensRegistrationType.method);\n})(SemanticTokensRegistrationType || (exports.SemanticTokensRegistrationType = SemanticTokensRegistrationType = {}));\n/**\n * @since 3.16.0\n */\nvar SemanticTokensRequest;\n(function (SemanticTokensRequest) {\n    SemanticTokensRequest.method = 'textDocument/semanticTokens/full';\n    SemanticTokensRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    SemanticTokensRequest.type = new messages_1.ProtocolRequestType(SemanticTokensRequest.method);\n    SemanticTokensRequest.registrationMethod = SemanticTokensRegistrationType.method;\n    SemanticTokensRequest.capabilities = messages_1.CM.create('textDocument.semanticTokens', 'semanticTokensProvider');\n})(SemanticTokensRequest || (exports.SemanticTokensRequest = SemanticTokensRequest = {}));\n/**\n * @since 3.16.0\n */\nvar SemanticTokensDeltaRequest;\n(function (SemanticTokensDeltaRequest) {\n    SemanticTokensDeltaRequest.method = 'textDocument/semanticTokens/full/delta';\n    SemanticTokensDeltaRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    SemanticTokensDeltaRequest.type = new messages_1.ProtocolRequestType(SemanticTokensDeltaRequest.method);\n    SemanticTokensDeltaRequest.registrationMethod = SemanticTokensRegistrationType.method;\n    SemanticTokensDeltaRequest.capabilities = messages_1.CM.create('textDocument.semanticTokens.requests.full.delta', 'semanticTokensProvider.full.delta');\n})(SemanticTokensDeltaRequest || (exports.SemanticTokensDeltaRequest = SemanticTokensDeltaRequest = {}));\n/**\n * @since 3.16.0\n */\nvar SemanticTokensRangeRequest;\n(function (SemanticTokensRangeRequest) {\n    SemanticTokensRangeRequest.method = 'textDocument/semanticTokens/range';\n    SemanticTokensRangeRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    SemanticTokensRangeRequest.type = new messages_1.ProtocolRequestType(SemanticTokensRangeRequest.method);\n    SemanticTokensRangeRequest.registrationMethod = SemanticTokensRegistrationType.method;\n    SemanticTokensRangeRequest.capabilities = messages_1.CM.create('textDocument.semanticTokens.requests.range', 'semanticTokensProvider.range');\n})(SemanticTokensRangeRequest || (exports.SemanticTokensRangeRequest = SemanticTokensRangeRequest = {}));\n/**\n * @since 3.16.0\n */\nvar SemanticTokensRefreshRequest;\n(function (SemanticTokensRefreshRequest) {\n    SemanticTokensRefreshRequest.method = `workspace/semanticTokens/refresh`;\n    SemanticTokensRefreshRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    SemanticTokensRefreshRequest.type = new messages_1.ProtocolRequestType0(SemanticTokensRefreshRequest.method);\n    SemanticTokensRefreshRequest.capabilities = messages_1.CM.create('workspace.semanticTokens.refreshSupport', undefined);\n})(SemanticTokensRefreshRequest || (exports.SemanticTokensRefreshRequest = SemanticTokensRefreshRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ShowDocumentRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to show a document. This request might open an\n * external program depending on the value of the URI to open.\n * For example a request to open `https://code.visualstudio.com/`\n * will very likely open the URI in a WEB browser.\n *\n * @since 3.16.0\n*/\nvar ShowDocumentRequest;\n(function (ShowDocumentRequest) {\n    ShowDocumentRequest.method = 'window/showDocument';\n    ShowDocumentRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    ShowDocumentRequest.type = new messages_1.ProtocolRequestType(ShowDocumentRequest.method);\n    ShowDocumentRequest.capabilities = messages_1.CM.create('window.showDocument.support', undefined);\n})(ShowDocumentRequest || (exports.ShowDocumentRequest = ShowDocumentRequest = {}));\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.LinkedEditingRangeRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to provide ranges that can be edited together.\n *\n * @since 3.16.0\n */\nvar LinkedEditingRangeRequest;\n(function (LinkedEditingRangeRequest) {\n    LinkedEditingRangeRequest.method = 'textDocument/linkedEditingRange';\n    LinkedEditingRangeRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    LinkedEditingRangeRequest.type = new messages_1.ProtocolRequestType(LinkedEditingRangeRequest.method);\n    LinkedEditingRangeRequest.capabilities = messages_1.CM.create('textDocument.linkedEditingRange', 'linkedEditingRangeProvider');\n})(LinkedEditingRangeRequest || (exports.LinkedEditingRangeRequest = LinkedEditingRangeRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WillDeleteFilesRequest = exports.DidDeleteFilesNotification = exports.DidRenameFilesNotification = exports.WillRenameFilesRequest = exports.DidCreateFilesNotification = exports.WillCreateFilesRequest = exports.FileOperationPatternKind = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A pattern kind describing if a glob pattern matches a file a folder or\n * both.\n *\n * @since 3.16.0\n */\nvar FileOperationPatternKind;\n(function (FileOperationPatternKind) {\n    /**\n     * The pattern matches a file only.\n     */\n    FileOperationPatternKind.file = 'file';\n    /**\n     * The pattern matches a folder only.\n     */\n    FileOperationPatternKind.folder = 'folder';\n})(FileOperationPatternKind || (exports.FileOperationPatternKind = FileOperationPatternKind = {}));\n/**\n * The will create files request is sent from the client to the server before files are actually\n * created as long as the creation is triggered from within the client.\n *\n * The request can return a `WorkspaceEdit` which will be applied to workspace before the\n * files are created. Hence the `WorkspaceEdit` can not manipulate the content of the file\n * to be created.\n *\n * @since 3.16.0\n */\nvar WillCreateFilesRequest;\n(function (WillCreateFilesRequest) {\n    WillCreateFilesRequest.method = 'workspace/willCreateFiles';\n    WillCreateFilesRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    WillCreateFilesRequest.type = new messages_1.ProtocolRequestType(WillCreateFilesRequest.method);\n    WillCreateFilesRequest.capabilities = messages_1.CM.create('workspace.fileOperations.willCreate', 'workspace.fileOperations.willCreate');\n})(WillCreateFilesRequest || (exports.WillCreateFilesRequest = WillCreateFilesRequest = {}));\n/**\n * The did create files notification is sent from the client to the server when\n * files were created from within the client.\n *\n * @since 3.16.0\n */\nvar DidCreateFilesNotification;\n(function (DidCreateFilesNotification) {\n    DidCreateFilesNotification.method = 'workspace/didCreateFiles';\n    DidCreateFilesNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidCreateFilesNotification.type = new messages_1.ProtocolNotificationType(DidCreateFilesNotification.method);\n    DidCreateFilesNotification.capabilities = messages_1.CM.create('workspace.fileOperations.didCreate', 'workspace.fileOperations.didCreate');\n})(DidCreateFilesNotification || (exports.DidCreateFilesNotification = DidCreateFilesNotification = {}));\n/**\n * The will rename files request is sent from the client to the server before files are actually\n * renamed as long as the rename is triggered from within the client.\n *\n * @since 3.16.0\n */\nvar WillRenameFilesRequest;\n(function (WillRenameFilesRequest) {\n    WillRenameFilesRequest.method = 'workspace/willRenameFiles';\n    WillRenameFilesRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    WillRenameFilesRequest.type = new messages_1.ProtocolRequestType(WillRenameFilesRequest.method);\n    WillRenameFilesRequest.capabilities = messages_1.CM.create('workspace.fileOperations.willRename', 'workspace.fileOperations.willRename');\n})(WillRenameFilesRequest || (exports.WillRenameFilesRequest = WillRenameFilesRequest = {}));\n/**\n * The did rename files notification is sent from the client to the server when\n * files were renamed from within the client.\n *\n * @since 3.16.0\n */\nvar DidRenameFilesNotification;\n(function (DidRenameFilesNotification) {\n    DidRenameFilesNotification.method = 'workspace/didRenameFiles';\n    DidRenameFilesNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidRenameFilesNotification.type = new messages_1.ProtocolNotificationType(DidRenameFilesNotification.method);\n    DidRenameFilesNotification.capabilities = messages_1.CM.create('workspace.fileOperations.didRename', 'workspace.fileOperations.didRename');\n})(DidRenameFilesNotification || (exports.DidRenameFilesNotification = DidRenameFilesNotification = {}));\n/**\n * The will delete files request is sent from the client to the server before files are actually\n * deleted as long as the deletion is triggered from within the client.\n *\n * @since 3.16.0\n */\nvar DidDeleteFilesNotification;\n(function (DidDeleteFilesNotification) {\n    DidDeleteFilesNotification.method = 'workspace/didDeleteFiles';\n    DidDeleteFilesNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidDeleteFilesNotification.type = new messages_1.ProtocolNotificationType(DidDeleteFilesNotification.method);\n    DidDeleteFilesNotification.capabilities = messages_1.CM.create('workspace.fileOperations.didDelete', 'workspace.fileOperations.didDelete');\n})(DidDeleteFilesNotification || (exports.DidDeleteFilesNotification = DidDeleteFilesNotification = {}));\n/**\n * The did delete files notification is sent from the client to the server when\n * files were deleted from within the client.\n *\n * @since 3.16.0\n */\nvar WillDeleteFilesRequest;\n(function (WillDeleteFilesRequest) {\n    WillDeleteFilesRequest.method = 'workspace/willDeleteFiles';\n    WillDeleteFilesRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    WillDeleteFilesRequest.type = new messages_1.ProtocolRequestType(WillDeleteFilesRequest.method);\n    WillDeleteFilesRequest.capabilities = messages_1.CM.create('workspace.fileOperations.willDelete', 'workspace.fileOperations.willDelete');\n})(WillDeleteFilesRequest || (exports.WillDeleteFilesRequest = WillDeleteFilesRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MonikerRequest = exports.MonikerKind = exports.UniquenessLevel = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * Moniker uniqueness level to define scope of the moniker.\n *\n * @since 3.16.0\n */\nvar UniquenessLevel;\n(function (UniquenessLevel) {\n    /**\n     * The moniker is only unique inside a document\n     */\n    UniquenessLevel.document = 'document';\n    /**\n     * The moniker is unique inside a project for which a dump got created\n     */\n    UniquenessLevel.project = 'project';\n    /**\n     * The moniker is unique inside the group to which a project belongs\n     */\n    UniquenessLevel.group = 'group';\n    /**\n     * The moniker is unique inside the moniker scheme.\n     */\n    UniquenessLevel.scheme = 'scheme';\n    /**\n     * The moniker is globally unique\n     */\n    UniquenessLevel.global = 'global';\n})(UniquenessLevel || (exports.UniquenessLevel = UniquenessLevel = {}));\n/**\n * The moniker kind.\n *\n * @since 3.16.0\n */\nvar MonikerKind;\n(function (MonikerKind) {\n    /**\n     * The moniker represent a symbol that is imported into a project\n     */\n    MonikerKind.$import = 'import';\n    /**\n     * The moniker represents a symbol that is exported from a project\n     */\n    MonikerKind.$export = 'export';\n    /**\n     * The moniker represents a symbol that is local to a project (e.g. a local\n     * variable of a function, a class not visible outside the project, ...)\n     */\n    MonikerKind.local = 'local';\n})(MonikerKind || (exports.MonikerKind = MonikerKind = {}));\n/**\n * A request to get the moniker of a symbol at a given text document position.\n * The request parameter is of type {@link TextDocumentPositionParams}.\n * The response is of type {@link Moniker Moniker[]} or `null`.\n */\nvar MonikerRequest;\n(function (MonikerRequest) {\n    MonikerRequest.method = 'textDocument/moniker';\n    MonikerRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    MonikerRequest.type = new messages_1.ProtocolRequestType(MonikerRequest.method);\n    MonikerRequest.capabilities = messages_1.CM.create('textDocument.moniker', 'monikerProvider');\n})(MonikerRequest || (exports.MonikerRequest = MonikerRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) TypeFox, Microsoft and others. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TypeHierarchySubtypesRequest = exports.TypeHierarchySupertypesRequest = exports.TypeHierarchyPrepareRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to result a `TypeHierarchyItem` in a document at a given position.\n * Can be used as an input to a subtypes or supertypes type hierarchy.\n *\n * @since 3.17.0\n */\nvar TypeHierarchyPrepareRequest;\n(function (TypeHierarchyPrepareRequest) {\n    TypeHierarchyPrepareRequest.method = 'textDocument/prepareTypeHierarchy';\n    TypeHierarchyPrepareRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    TypeHierarchyPrepareRequest.type = new messages_1.ProtocolRequestType(TypeHierarchyPrepareRequest.method);\n    TypeHierarchyPrepareRequest.capabilities = messages_1.CM.create('textDocument.typeHierarchy', 'typeHierarchyProvider');\n})(TypeHierarchyPrepareRequest || (exports.TypeHierarchyPrepareRequest = TypeHierarchyPrepareRequest = {}));\n/**\n * A request to resolve the supertypes for a given `TypeHierarchyItem`.\n *\n * @since 3.17.0\n */\nvar TypeHierarchySupertypesRequest;\n(function (TypeHierarchySupertypesRequest) {\n    TypeHierarchySupertypesRequest.method = 'typeHierarchy/supertypes';\n    TypeHierarchySupertypesRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    TypeHierarchySupertypesRequest.type = new messages_1.ProtocolRequestType(TypeHierarchySupertypesRequest.method);\n})(TypeHierarchySupertypesRequest || (exports.TypeHierarchySupertypesRequest = TypeHierarchySupertypesRequest = {}));\n/**\n * A request to resolve the subtypes for a given `TypeHierarchyItem`.\n *\n * @since 3.17.0\n */\nvar TypeHierarchySubtypesRequest;\n(function (TypeHierarchySubtypesRequest) {\n    TypeHierarchySubtypesRequest.method = 'typeHierarchy/subtypes';\n    TypeHierarchySubtypesRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    TypeHierarchySubtypesRequest.type = new messages_1.ProtocolRequestType(TypeHierarchySubtypesRequest.method);\n})(TypeHierarchySubtypesRequest || (exports.TypeHierarchySubtypesRequest = TypeHierarchySubtypesRequest = {}));\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InlineValueRefreshRequest = exports.InlineValueRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to provide inline values in a document. The request's parameter is of\n * type {@link InlineValueParams}, the response is of type\n * {@link InlineValue InlineValue[]} or a Thenable that resolves to such.\n *\n * @since 3.17.0\n */\nvar InlineValueRequest;\n(function (InlineValueRequest) {\n    InlineValueRequest.method = 'textDocument/inlineValue';\n    InlineValueRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    InlineValueRequest.type = new messages_1.ProtocolRequestType(InlineValueRequest.method);\n    InlineValueRequest.capabilities = messages_1.CM.create('textDocument.inlineValue', 'inlineValueProvider');\n})(InlineValueRequest || (exports.InlineValueRequest = InlineValueRequest = {}));\n/**\n * @since 3.17.0\n */\nvar InlineValueRefreshRequest;\n(function (InlineValueRefreshRequest) {\n    InlineValueRefreshRequest.method = `workspace/inlineValue/refresh`;\n    InlineValueRefreshRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    InlineValueRefreshRequest.type = new messages_1.ProtocolRequestType0(InlineValueRefreshRequest.method);\n    InlineValueRefreshRequest.capabilities = messages_1.CM.create('workspace.inlineValue.refreshSupport', undefined);\n})(InlineValueRefreshRequest || (exports.InlineValueRefreshRequest = InlineValueRefreshRequest = {}));\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InlayHintRefreshRequest = exports.InlayHintResolveRequest = exports.InlayHintRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to provide inlay hints in a document. The request's parameter is of\n * type {@link InlayHintsParams}, the response is of type\n * {@link InlayHint InlayHint[]} or a Thenable that resolves to such.\n *\n * @since 3.17.0\n */\nvar InlayHintRequest;\n(function (InlayHintRequest) {\n    InlayHintRequest.method = 'textDocument/inlayHint';\n    InlayHintRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    InlayHintRequest.type = new messages_1.ProtocolRequestType(InlayHintRequest.method);\n    InlayHintRequest.capabilities = messages_1.CM.create('textDocument.inlayHint', 'inlayHintProvider');\n})(InlayHintRequest || (exports.InlayHintRequest = InlayHintRequest = {}));\n/**\n * A request to resolve additional properties for an inlay hint.\n * The request's parameter is of type {@link InlayHint}, the response is\n * of type {@link InlayHint} or a Thenable that resolves to such.\n *\n * @since 3.17.0\n */\nvar InlayHintResolveRequest;\n(function (InlayHintResolveRequest) {\n    InlayHintResolveRequest.method = 'inlayHint/resolve';\n    InlayHintResolveRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    InlayHintResolveRequest.type = new messages_1.ProtocolRequestType(InlayHintResolveRequest.method);\n    InlayHintResolveRequest.capabilities = messages_1.CM.create('textDocument.inlayHint.resolveSupport', 'inlayHintProvider.resolveProvider');\n})(InlayHintResolveRequest || (exports.InlayHintResolveRequest = InlayHintResolveRequest = {}));\n/**\n * @since 3.17.0\n */\nvar InlayHintRefreshRequest;\n(function (InlayHintRefreshRequest) {\n    InlayHintRefreshRequest.method = `workspace/inlayHint/refresh`;\n    InlayHintRefreshRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    InlayHintRefreshRequest.type = new messages_1.ProtocolRequestType0(InlayHintRefreshRequest.method);\n    InlayHintRefreshRequest.capabilities = messages_1.CM.create('workspace.inlayHint.refreshSupport', undefined);\n})(InlayHintRefreshRequest || (exports.InlayHintRefreshRequest = InlayHintRefreshRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DiagnosticRefreshRequest = exports.WorkspaceDiagnosticRequest = exports.DocumentDiagnosticRequest = exports.DocumentDiagnosticReportKind = exports.DiagnosticServerCancellationData = void 0;\nconst vscode_jsonrpc_1 = require(\"vscode-jsonrpc\");\nconst Is = __importStar(require(\"./utils/is\"));\nconst messages_1 = require(\"./messages\");\n/**\n * @since 3.17.0\n */\nvar DiagnosticServerCancellationData;\n(function (DiagnosticServerCancellationData) {\n    function is(value) {\n        const candidate = value;\n        return candidate && Is.boolean(candidate.retriggerRequest);\n    }\n    DiagnosticServerCancellationData.is = is;\n})(DiagnosticServerCancellationData || (exports.DiagnosticServerCancellationData = DiagnosticServerCancellationData = {}));\n/**\n * The document diagnostic report kinds.\n *\n * @since 3.17.0\n */\nvar DocumentDiagnosticReportKind;\n(function (DocumentDiagnosticReportKind) {\n    /**\n     * A diagnostic report with a full\n     * set of problems.\n     */\n    DocumentDiagnosticReportKind.Full = 'full';\n    /**\n     * A report indicating that the last\n     * returned report is still accurate.\n     */\n    DocumentDiagnosticReportKind.Unchanged = 'unchanged';\n})(DocumentDiagnosticReportKind || (exports.DocumentDiagnosticReportKind = DocumentDiagnosticReportKind = {}));\n/**\n * The document diagnostic request definition.\n *\n * @since 3.17.0\n */\nvar DocumentDiagnosticRequest;\n(function (DocumentDiagnosticRequest) {\n    DocumentDiagnosticRequest.method = 'textDocument/diagnostic';\n    DocumentDiagnosticRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentDiagnosticRequest.type = new messages_1.ProtocolRequestType(DocumentDiagnosticRequest.method);\n    DocumentDiagnosticRequest.partialResult = new vscode_jsonrpc_1.ProgressType();\n    DocumentDiagnosticRequest.capabilities = messages_1.CM.create('textDocument.diagnostic', 'diagnosticProvider');\n})(DocumentDiagnosticRequest || (exports.DocumentDiagnosticRequest = DocumentDiagnosticRequest = {}));\n/**\n * The workspace diagnostic request definition.\n *\n * @since 3.17.0\n */\nvar WorkspaceDiagnosticRequest;\n(function (WorkspaceDiagnosticRequest) {\n    WorkspaceDiagnosticRequest.method = 'workspace/diagnostic';\n    WorkspaceDiagnosticRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    WorkspaceDiagnosticRequest.type = new messages_1.ProtocolRequestType(WorkspaceDiagnosticRequest.method);\n    WorkspaceDiagnosticRequest.partialResult = new vscode_jsonrpc_1.ProgressType();\n    WorkspaceDiagnosticRequest.capabilities = messages_1.CM.create('workspace.diagnostics', 'diagnosticProvider.workspaceDiagnostics');\n})(WorkspaceDiagnosticRequest || (exports.WorkspaceDiagnosticRequest = WorkspaceDiagnosticRequest = {}));\n/**\n * The diagnostic refresh request definition.\n *\n * @since 3.17.0\n */\nvar DiagnosticRefreshRequest;\n(function (DiagnosticRefreshRequest) {\n    DiagnosticRefreshRequest.method = `workspace/diagnostic/refresh`;\n    DiagnosticRefreshRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    DiagnosticRefreshRequest.type = new messages_1.ProtocolRequestType0(DiagnosticRefreshRequest.method);\n    DiagnosticRefreshRequest.capabilities = messages_1.CM.create('workspace.diagnostics.refreshSupport', undefined);\n})(DiagnosticRefreshRequest || (exports.DiagnosticRefreshRequest = DiagnosticRefreshRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DidCloseNotebookDocumentNotification = exports.DidSaveNotebookDocumentNotification = exports.DidChangeNotebookDocumentNotification = exports.NotebookCellArrayChange = exports.DidOpenNotebookDocumentNotification = exports.NotebookDocumentSyncRegistrationType = exports.NotebookDocument = exports.NotebookCell = exports.ExecutionSummary = exports.NotebookCellKind = void 0;\nconst vscode_languageserver_types_1 = require(\"vscode-languageserver-types\");\nconst Is = __importStar(require(\"./utils/is\"));\nconst messages_1 = require(\"./messages\");\n/**\n * A notebook cell kind.\n *\n * @since 3.17.0\n */\nvar NotebookCellKind;\n(function (NotebookCellKind) {\n    /**\n     * A markup-cell is formatted source that is used for display.\n     */\n    NotebookCellKind.Markup = 1;\n    /**\n     * A code-cell is source code.\n     */\n    NotebookCellKind.Code = 2;\n    function is(value) {\n        return value === 1 || value === 2;\n    }\n    NotebookCellKind.is = is;\n})(NotebookCellKind || (exports.NotebookCellKind = NotebookCellKind = {}));\nvar ExecutionSummary;\n(function (ExecutionSummary) {\n    function create(executionOrder, success) {\n        const result = { executionOrder };\n        if (success === true || success === false) {\n            result.success = success;\n        }\n        return result;\n    }\n    ExecutionSummary.create = create;\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && vscode_languageserver_types_1.uinteger.is(candidate.executionOrder) && (candidate.success === undefined || Is.boolean(candidate.success));\n    }\n    ExecutionSummary.is = is;\n    function 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        return one.executionOrder === other.executionOrder && one.success === other.success;\n    }\n    ExecutionSummary.equals = equals;\n})(ExecutionSummary || (exports.ExecutionSummary = ExecutionSummary = {}));\nvar NotebookCell;\n(function (NotebookCell) {\n    function create(kind, document) {\n        return { kind, document };\n    }\n    NotebookCell.create = create;\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && NotebookCellKind.is(candidate.kind) && vscode_languageserver_types_1.DocumentUri.is(candidate.document) &&\n            (candidate.metadata === undefined || Is.objectLiteral(candidate.metadata));\n    }\n    NotebookCell.is = is;\n    function diff(one, two) {\n        const result = new Set();\n        if (one.document !== two.document) {\n            result.add('document');\n        }\n        if (one.kind !== two.kind) {\n            result.add('kind');\n        }\n        if (one.executionSummary !== two.executionSummary) {\n            result.add('executionSummary');\n        }\n        if ((one.metadata !== undefined || two.metadata !== undefined) && !equalsMetadata(one.metadata, two.metadata)) {\n            result.add('metadata');\n        }\n        if ((one.executionSummary !== undefined || two.executionSummary !== undefined) && !ExecutionSummary.equals(one.executionSummary, two.executionSummary)) {\n            result.add('executionSummary');\n        }\n        return result;\n    }\n    NotebookCell.diff = diff;\n    function equalsMetadata(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        const oneArray = Array.isArray(one);\n        const otherArray = Array.isArray(other);\n        if (oneArray !== otherArray) {\n            return false;\n        }\n        if (oneArray && otherArray) {\n            if (one.length !== other.length) {\n                return false;\n            }\n            for (let i = 0; i < one.length; i++) {\n                if (!equalsMetadata(one[i], other[i])) {\n                    return false;\n                }\n            }\n        }\n        if (Is.objectLiteral(one) && Is.objectLiteral(other)) {\n            const oneKeys = Object.keys(one);\n            const otherKeys = Object.keys(other);\n            if (oneKeys.length !== otherKeys.length) {\n                return false;\n            }\n            oneKeys.sort();\n            otherKeys.sort();\n            if (!equalsMetadata(oneKeys, otherKeys)) {\n                return false;\n            }\n            for (let i = 0; i < oneKeys.length; i++) {\n                const prop = oneKeys[i];\n                if (!equalsMetadata(one[prop], other[prop])) {\n                    return false;\n                }\n            }\n        }\n        return true;\n    }\n})(NotebookCell || (exports.NotebookCell = NotebookCell = {}));\nvar NotebookDocument;\n(function (NotebookDocument) {\n    function create(uri, notebookType, version, cells) {\n        return { uri, notebookType, version, cells };\n    }\n    NotebookDocument.create = create;\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && Is.string(candidate.uri) && vscode_languageserver_types_1.integer.is(candidate.version) && Is.typedArray(candidate.cells, NotebookCell.is);\n    }\n    NotebookDocument.is = is;\n})(NotebookDocument || (exports.NotebookDocument = NotebookDocument = {}));\nvar NotebookDocumentSyncRegistrationType;\n(function (NotebookDocumentSyncRegistrationType) {\n    NotebookDocumentSyncRegistrationType.method = 'notebookDocument/sync';\n    NotebookDocumentSyncRegistrationType.messageDirection = messages_1.MessageDirection.clientToServer;\n    NotebookDocumentSyncRegistrationType.type = new messages_1.RegistrationType(NotebookDocumentSyncRegistrationType.method);\n})(NotebookDocumentSyncRegistrationType || (exports.NotebookDocumentSyncRegistrationType = NotebookDocumentSyncRegistrationType = {}));\n/**\n * A notification sent when a notebook opens.\n *\n * @since 3.17.0\n */\nvar DidOpenNotebookDocumentNotification;\n(function (DidOpenNotebookDocumentNotification) {\n    DidOpenNotebookDocumentNotification.method = 'notebookDocument/didOpen';\n    DidOpenNotebookDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidOpenNotebookDocumentNotification.type = new messages_1.ProtocolNotificationType(DidOpenNotebookDocumentNotification.method);\n    DidOpenNotebookDocumentNotification.registrationMethod = NotebookDocumentSyncRegistrationType.method;\n})(DidOpenNotebookDocumentNotification || (exports.DidOpenNotebookDocumentNotification = DidOpenNotebookDocumentNotification = {}));\nvar NotebookCellArrayChange;\n(function (NotebookCellArrayChange) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && vscode_languageserver_types_1.uinteger.is(candidate.start) && vscode_languageserver_types_1.uinteger.is(candidate.deleteCount) && (candidate.cells === undefined || Is.typedArray(candidate.cells, NotebookCell.is));\n    }\n    NotebookCellArrayChange.is = is;\n    function create(start, deleteCount, cells) {\n        const result = { start, deleteCount };\n        if (cells !== undefined) {\n            result.cells = cells;\n        }\n        return result;\n    }\n    NotebookCellArrayChange.create = create;\n})(NotebookCellArrayChange || (exports.NotebookCellArrayChange = NotebookCellArrayChange = {}));\nvar DidChangeNotebookDocumentNotification;\n(function (DidChangeNotebookDocumentNotification) {\n    DidChangeNotebookDocumentNotification.method = 'notebookDocument/didChange';\n    DidChangeNotebookDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidChangeNotebookDocumentNotification.type = new messages_1.ProtocolNotificationType(DidChangeNotebookDocumentNotification.method);\n    DidChangeNotebookDocumentNotification.registrationMethod = NotebookDocumentSyncRegistrationType.method;\n})(DidChangeNotebookDocumentNotification || (exports.DidChangeNotebookDocumentNotification = DidChangeNotebookDocumentNotification = {}));\n/**\n * A notification sent when a notebook document is saved.\n *\n * @since 3.17.0\n */\nvar DidSaveNotebookDocumentNotification;\n(function (DidSaveNotebookDocumentNotification) {\n    DidSaveNotebookDocumentNotification.method = 'notebookDocument/didSave';\n    DidSaveNotebookDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidSaveNotebookDocumentNotification.type = new messages_1.ProtocolNotificationType(DidSaveNotebookDocumentNotification.method);\n    DidSaveNotebookDocumentNotification.registrationMethod = NotebookDocumentSyncRegistrationType.method;\n})(DidSaveNotebookDocumentNotification || (exports.DidSaveNotebookDocumentNotification = DidSaveNotebookDocumentNotification = {}));\n/**\n * A notification sent when a notebook closes.\n *\n * @since 3.17.0\n */\nvar DidCloseNotebookDocumentNotification;\n(function (DidCloseNotebookDocumentNotification) {\n    DidCloseNotebookDocumentNotification.method = 'notebookDocument/didClose';\n    DidCloseNotebookDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidCloseNotebookDocumentNotification.type = new messages_1.ProtocolNotificationType(DidCloseNotebookDocumentNotification.method);\n    DidCloseNotebookDocumentNotification.registrationMethod = NotebookDocumentSyncRegistrationType.method;\n})(DidCloseNotebookDocumentNotification || (exports.DidCloseNotebookDocumentNotification = DidCloseNotebookDocumentNotification = {}));\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InlineCompletionRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * A request to provide inline completions in a document. The request's parameter is of\n * type {@link InlineCompletionParams}, the response is of type\n * {@link InlineCompletion InlineCompletion[]} or a Thenable that resolves to such.\n *\n * @since 3.18.0\n */\nvar InlineCompletionRequest;\n(function (InlineCompletionRequest) {\n    InlineCompletionRequest.method = 'textDocument/inlineCompletion';\n    InlineCompletionRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    InlineCompletionRequest.type = new messages_1.ProtocolRequestType(InlineCompletionRequest.method);\n    InlineCompletionRequest.capabilities = messages_1.CM.create('textDocument.inlineCompletion', 'inlineCompletionProvider');\n})(InlineCompletionRequest || (exports.InlineCompletionRequest = InlineCompletionRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TextDocumentContentRefreshRequest = exports.TextDocumentContentRequest = void 0;\nconst messages_1 = require(\"./messages\");\n/**\n * The `workspace/textDocumentContent` request is sent from the client to the\n * server to request the content of a text document.\n *\n * @since 3.18.0\n */\nvar TextDocumentContentRequest;\n(function (TextDocumentContentRequest) {\n    TextDocumentContentRequest.method = 'workspace/textDocumentContent';\n    TextDocumentContentRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    TextDocumentContentRequest.type = new messages_1.ProtocolRequestType(TextDocumentContentRequest.method);\n    TextDocumentContentRequest.capabilities = messages_1.CM.create('workspace.textDocumentContent', 'workspace.textDocumentContent');\n})(TextDocumentContentRequest || (exports.TextDocumentContentRequest = TextDocumentContentRequest = {}));\n/**\n * The `workspace/textDocumentContent` request is sent from the server to the client to refresh\n * the content of a specific text document.\n *\n * @since 3.18.0\n */\nvar TextDocumentContentRefreshRequest;\n(function (TextDocumentContentRefreshRequest) {\n    TextDocumentContentRefreshRequest.method = `workspace/textDocumentContent/refresh`;\n    TextDocumentContentRefreshRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    TextDocumentContentRefreshRequest.type = new messages_1.ProtocolRequestType(TextDocumentContentRefreshRequest.method);\n})(TextDocumentContentRefreshRequest || (exports.TextDocumentContentRefreshRequest = TextDocumentContentRefreshRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CodeActionRequest = exports.DocumentSymbolRequest = exports.DocumentHighlightRequest = exports.ReferencesRequest = exports.DefinitionRequest = exports.SignatureHelpRequest = exports.SignatureHelpTriggerKind = exports.HoverRequest = exports.CompletionResolveRequest = exports.CompletionRequest = exports.CompletionTriggerKind = exports.PublishDiagnosticsNotification = exports.WatchKind = exports.GlobPattern = exports.RelativePattern = exports.FileChangeType = exports.DidChangeWatchedFilesNotification = exports.WillSaveTextDocumentWaitUntilRequest = exports.WillSaveTextDocumentNotification = exports.TextDocumentSaveReason = exports.DidSaveTextDocumentNotification = exports.DidCloseTextDocumentNotification = exports.DidChangeTextDocumentNotification = exports.TextDocumentContentChangeEvent = exports.DidOpenTextDocumentNotification = exports.TextDocumentSyncKind = exports.TelemetryEventNotification = exports.LogMessageNotification = exports.ShowMessageRequest = exports.ShowMessageNotification = exports.MessageType = exports.DidChangeConfigurationNotification = exports.ExitNotification = exports.ShutdownRequest = exports.InitializedNotification = exports.InitializeErrorCodes = exports.InitializeRequest = exports.WorkDoneProgressOptions = exports.TextDocumentRegistrationOptions = exports.StaticRegistrationOptions = exports.PositionEncodingKind = exports.RegularExpressionEngineKind = exports.FailureHandlingKind = exports.ResourceOperationKind = exports.UnregistrationRequest = exports.RegistrationRequest = exports.DocumentSelector = exports.NotebookCellTextDocumentFilter = exports.NotebookDocumentFilter = exports.TextDocumentFilter = void 0;\nexports.UniquenessLevel = exports.WillDeleteFilesRequest = exports.DidDeleteFilesNotification = exports.WillRenameFilesRequest = exports.DidRenameFilesNotification = exports.WillCreateFilesRequest = exports.DidCreateFilesNotification = exports.FileOperationPatternKind = exports.LinkedEditingRangeRequest = exports.ShowDocumentRequest = exports.SemanticTokensRegistrationType = exports.SemanticTokensRefreshRequest = exports.SemanticTokensRangeRequest = exports.SemanticTokensDeltaRequest = exports.SemanticTokensRequest = exports.TokenFormat = exports.CallHierarchyPrepareRequest = exports.CallHierarchyOutgoingCallsRequest = exports.CallHierarchyIncomingCallsRequest = exports.WorkDoneProgressCancelNotification = exports.WorkDoneProgressCreateRequest = exports.WorkDoneProgress = exports.SelectionRangeRequest = exports.DeclarationRequest = exports.FoldingRangeRefreshRequest = exports.FoldingRangeRequest = exports.ColorPresentationRequest = exports.DocumentColorRequest = exports.ConfigurationRequest = exports.DidChangeWorkspaceFoldersNotification = exports.WorkspaceFoldersRequest = exports.TypeDefinitionRequest = exports.ImplementationRequest = exports.ApplyWorkspaceEditRequest = exports.ExecuteCommandRequest = exports.PrepareRenameRequest = exports.RenameRequest = exports.PrepareSupportDefaultBehavior = exports.DocumentOnTypeFormattingRequest = exports.DocumentRangesFormattingRequest = exports.DocumentRangeFormattingRequest = exports.DocumentFormattingRequest = exports.DocumentLinkResolveRequest = exports.DocumentLinkRequest = exports.CodeLensRefreshRequest = exports.CodeLensResolveRequest = exports.CodeLensRequest = exports.WorkspaceSymbolResolveRequest = exports.WorkspaceSymbolRequest = exports.CodeActionResolveRequest = void 0;\nexports.TextDocumentContentRefreshRequest = exports.TextDocumentContentRequest = exports.InlineCompletionRequest = exports.DidCloseNotebookDocumentNotification = exports.DidSaveNotebookDocumentNotification = exports.DidChangeNotebookDocumentNotification = exports.NotebookCellArrayChange = exports.DidOpenNotebookDocumentNotification = exports.NotebookDocumentSyncRegistrationType = exports.NotebookDocument = exports.NotebookCell = exports.ExecutionSummary = exports.NotebookCellKind = exports.DiagnosticRefreshRequest = exports.WorkspaceDiagnosticRequest = exports.DocumentDiagnosticRequest = exports.DocumentDiagnosticReportKind = exports.DiagnosticServerCancellationData = exports.InlayHintRefreshRequest = exports.InlayHintResolveRequest = exports.InlayHintRequest = exports.InlineValueRefreshRequest = exports.InlineValueRequest = exports.TypeHierarchySupertypesRequest = exports.TypeHierarchySubtypesRequest = exports.TypeHierarchyPrepareRequest = exports.MonikerRequest = exports.MonikerKind = void 0;\nconst messages_1 = require(\"./messages\");\nconst vscode_languageserver_types_1 = require(\"vscode-languageserver-types\");\nconst Is = __importStar(require(\"./utils/is\"));\nconst protocol_implementation_1 = require(\"./protocol.implementation\");\nObject.defineProperty(exports, \"ImplementationRequest\", { enumerable: true, get: function () { return protocol_implementation_1.ImplementationRequest; } });\nconst protocol_typeDefinition_1 = require(\"./protocol.typeDefinition\");\nObject.defineProperty(exports, \"TypeDefinitionRequest\", { enumerable: true, get: function () { return protocol_typeDefinition_1.TypeDefinitionRequest; } });\nconst protocol_workspaceFolder_1 = require(\"./protocol.workspaceFolder\");\nObject.defineProperty(exports, \"WorkspaceFoldersRequest\", { enumerable: true, get: function () { return protocol_workspaceFolder_1.WorkspaceFoldersRequest; } });\nObject.defineProperty(exports, \"DidChangeWorkspaceFoldersNotification\", { enumerable: true, get: function () { return protocol_workspaceFolder_1.DidChangeWorkspaceFoldersNotification; } });\nconst protocol_configuration_1 = require(\"./protocol.configuration\");\nObject.defineProperty(exports, \"ConfigurationRequest\", { enumerable: true, get: function () { return protocol_configuration_1.ConfigurationRequest; } });\nconst protocol_colorProvider_1 = require(\"./protocol.colorProvider\");\nObject.defineProperty(exports, \"DocumentColorRequest\", { enumerable: true, get: function () { return protocol_colorProvider_1.DocumentColorRequest; } });\nObject.defineProperty(exports, \"ColorPresentationRequest\", { enumerable: true, get: function () { return protocol_colorProvider_1.ColorPresentationRequest; } });\nconst protocol_foldingRange_1 = require(\"./protocol.foldingRange\");\nObject.defineProperty(exports, \"FoldingRangeRequest\", { enumerable: true, get: function () { return protocol_foldingRange_1.FoldingRangeRequest; } });\nObject.defineProperty(exports, \"FoldingRangeRefreshRequest\", { enumerable: true, get: function () { return protocol_foldingRange_1.FoldingRangeRefreshRequest; } });\nconst protocol_declaration_1 = require(\"./protocol.declaration\");\nObject.defineProperty(exports, \"DeclarationRequest\", { enumerable: true, get: function () { return protocol_declaration_1.DeclarationRequest; } });\nconst protocol_selectionRange_1 = require(\"./protocol.selectionRange\");\nObject.defineProperty(exports, \"SelectionRangeRequest\", { enumerable: true, get: function () { return protocol_selectionRange_1.SelectionRangeRequest; } });\nconst protocol_progress_1 = require(\"./protocol.progress\");\nObject.defineProperty(exports, \"WorkDoneProgress\", { enumerable: true, get: function () { return protocol_progress_1.WorkDoneProgress; } });\nObject.defineProperty(exports, \"WorkDoneProgressCreateRequest\", { enumerable: true, get: function () { return protocol_progress_1.WorkDoneProgressCreateRequest; } });\nObject.defineProperty(exports, \"WorkDoneProgressCancelNotification\", { enumerable: true, get: function () { return protocol_progress_1.WorkDoneProgressCancelNotification; } });\nconst protocol_callHierarchy_1 = require(\"./protocol.callHierarchy\");\nObject.defineProperty(exports, \"CallHierarchyIncomingCallsRequest\", { enumerable: true, get: function () { return protocol_callHierarchy_1.CallHierarchyIncomingCallsRequest; } });\nObject.defineProperty(exports, \"CallHierarchyOutgoingCallsRequest\", { enumerable: true, get: function () { return protocol_callHierarchy_1.CallHierarchyOutgoingCallsRequest; } });\nObject.defineProperty(exports, \"CallHierarchyPrepareRequest\", { enumerable: true, get: function () { return protocol_callHierarchy_1.CallHierarchyPrepareRequest; } });\nconst protocol_semanticTokens_1 = require(\"./protocol.semanticTokens\");\nObject.defineProperty(exports, \"TokenFormat\", { enumerable: true, get: function () { return protocol_semanticTokens_1.TokenFormat; } });\nObject.defineProperty(exports, \"SemanticTokensRequest\", { enumerable: true, get: function () { return protocol_semanticTokens_1.SemanticTokensRequest; } });\nObject.defineProperty(exports, \"SemanticTokensDeltaRequest\", { enumerable: true, get: function () { return protocol_semanticTokens_1.SemanticTokensDeltaRequest; } });\nObject.defineProperty(exports, \"SemanticTokensRangeRequest\", { enumerable: true, get: function () { return protocol_semanticTokens_1.SemanticTokensRangeRequest; } });\nObject.defineProperty(exports, \"SemanticTokensRefreshRequest\", { enumerable: true, get: function () { return protocol_semanticTokens_1.SemanticTokensRefreshRequest; } });\nObject.defineProperty(exports, \"SemanticTokensRegistrationType\", { enumerable: true, get: function () { return protocol_semanticTokens_1.SemanticTokensRegistrationType; } });\nconst protocol_showDocument_1 = require(\"./protocol.showDocument\");\nObject.defineProperty(exports, \"ShowDocumentRequest\", { enumerable: true, get: function () { return protocol_showDocument_1.ShowDocumentRequest; } });\nconst protocol_linkedEditingRange_1 = require(\"./protocol.linkedEditingRange\");\nObject.defineProperty(exports, \"LinkedEditingRangeRequest\", { enumerable: true, get: function () { return protocol_linkedEditingRange_1.LinkedEditingRangeRequest; } });\nconst protocol_fileOperations_1 = require(\"./protocol.fileOperations\");\nObject.defineProperty(exports, \"FileOperationPatternKind\", { enumerable: true, get: function () { return protocol_fileOperations_1.FileOperationPatternKind; } });\nObject.defineProperty(exports, \"DidCreateFilesNotification\", { enumerable: true, get: function () { return protocol_fileOperations_1.DidCreateFilesNotification; } });\nObject.defineProperty(exports, \"WillCreateFilesRequest\", { enumerable: true, get: function () { return protocol_fileOperations_1.WillCreateFilesRequest; } });\nObject.defineProperty(exports, \"DidRenameFilesNotification\", { enumerable: true, get: function () { return protocol_fileOperations_1.DidRenameFilesNotification; } });\nObject.defineProperty(exports, \"WillRenameFilesRequest\", { enumerable: true, get: function () { return protocol_fileOperations_1.WillRenameFilesRequest; } });\nObject.defineProperty(exports, \"DidDeleteFilesNotification\", { enumerable: true, get: function () { return protocol_fileOperations_1.DidDeleteFilesNotification; } });\nObject.defineProperty(exports, \"WillDeleteFilesRequest\", { enumerable: true, get: function () { return protocol_fileOperations_1.WillDeleteFilesRequest; } });\nconst protocol_moniker_1 = require(\"./protocol.moniker\");\nObject.defineProperty(exports, \"UniquenessLevel\", { enumerable: true, get: function () { return protocol_moniker_1.UniquenessLevel; } });\nObject.defineProperty(exports, \"MonikerKind\", { enumerable: true, get: function () { return protocol_moniker_1.MonikerKind; } });\nObject.defineProperty(exports, \"MonikerRequest\", { enumerable: true, get: function () { return protocol_moniker_1.MonikerRequest; } });\nconst protocol_typeHierarchy_1 = require(\"./protocol.typeHierarchy\");\nObject.defineProperty(exports, \"TypeHierarchyPrepareRequest\", { enumerable: true, get: function () { return protocol_typeHierarchy_1.TypeHierarchyPrepareRequest; } });\nObject.defineProperty(exports, \"TypeHierarchySubtypesRequest\", { enumerable: true, get: function () { return protocol_typeHierarchy_1.TypeHierarchySubtypesRequest; } });\nObject.defineProperty(exports, \"TypeHierarchySupertypesRequest\", { enumerable: true, get: function () { return protocol_typeHierarchy_1.TypeHierarchySupertypesRequest; } });\nconst protocol_inlineValue_1 = require(\"./protocol.inlineValue\");\nObject.defineProperty(exports, \"InlineValueRequest\", { enumerable: true, get: function () { return protocol_inlineValue_1.InlineValueRequest; } });\nObject.defineProperty(exports, \"InlineValueRefreshRequest\", { enumerable: true, get: function () { return protocol_inlineValue_1.InlineValueRefreshRequest; } });\nconst protocol_inlayHint_1 = require(\"./protocol.inlayHint\");\nObject.defineProperty(exports, \"InlayHintRequest\", { enumerable: true, get: function () { return protocol_inlayHint_1.InlayHintRequest; } });\nObject.defineProperty(exports, \"InlayHintResolveRequest\", { enumerable: true, get: function () { return protocol_inlayHint_1.InlayHintResolveRequest; } });\nObject.defineProperty(exports, \"InlayHintRefreshRequest\", { enumerable: true, get: function () { return protocol_inlayHint_1.InlayHintRefreshRequest; } });\nconst protocol_diagnostic_1 = require(\"./protocol.diagnostic\");\nObject.defineProperty(exports, \"DiagnosticServerCancellationData\", { enumerable: true, get: function () { return protocol_diagnostic_1.DiagnosticServerCancellationData; } });\nObject.defineProperty(exports, \"DocumentDiagnosticReportKind\", { enumerable: true, get: function () { return protocol_diagnostic_1.DocumentDiagnosticReportKind; } });\nObject.defineProperty(exports, \"DocumentDiagnosticRequest\", { enumerable: true, get: function () { return protocol_diagnostic_1.DocumentDiagnosticRequest; } });\nObject.defineProperty(exports, \"WorkspaceDiagnosticRequest\", { enumerable: true, get: function () { return protocol_diagnostic_1.WorkspaceDiagnosticRequest; } });\nObject.defineProperty(exports, \"DiagnosticRefreshRequest\", { enumerable: true, get: function () { return protocol_diagnostic_1.DiagnosticRefreshRequest; } });\nconst protocol_notebook_1 = require(\"./protocol.notebook\");\nObject.defineProperty(exports, \"NotebookCellKind\", { enumerable: true, get: function () { return protocol_notebook_1.NotebookCellKind; } });\nObject.defineProperty(exports, \"ExecutionSummary\", { enumerable: true, get: function () { return protocol_notebook_1.ExecutionSummary; } });\nObject.defineProperty(exports, \"NotebookCell\", { enumerable: true, get: function () { return protocol_notebook_1.NotebookCell; } });\nObject.defineProperty(exports, \"NotebookDocument\", { enumerable: true, get: function () { return protocol_notebook_1.NotebookDocument; } });\nObject.defineProperty(exports, \"NotebookDocumentSyncRegistrationType\", { enumerable: true, get: function () { return protocol_notebook_1.NotebookDocumentSyncRegistrationType; } });\nObject.defineProperty(exports, \"DidOpenNotebookDocumentNotification\", { enumerable: true, get: function () { return protocol_notebook_1.DidOpenNotebookDocumentNotification; } });\nObject.defineProperty(exports, \"NotebookCellArrayChange\", { enumerable: true, get: function () { return protocol_notebook_1.NotebookCellArrayChange; } });\nObject.defineProperty(exports, \"DidChangeNotebookDocumentNotification\", { enumerable: true, get: function () { return protocol_notebook_1.DidChangeNotebookDocumentNotification; } });\nObject.defineProperty(exports, \"DidSaveNotebookDocumentNotification\", { enumerable: true, get: function () { return protocol_notebook_1.DidSaveNotebookDocumentNotification; } });\nObject.defineProperty(exports, \"DidCloseNotebookDocumentNotification\", { enumerable: true, get: function () { return protocol_notebook_1.DidCloseNotebookDocumentNotification; } });\nconst protocol_inlineCompletion_1 = require(\"./protocol.inlineCompletion\");\nObject.defineProperty(exports, \"InlineCompletionRequest\", { enumerable: true, get: function () { return protocol_inlineCompletion_1.InlineCompletionRequest; } });\nconst protocol_textDocumentContent_1 = require(\"./protocol.textDocumentContent\");\nObject.defineProperty(exports, \"TextDocumentContentRequest\", { enumerable: true, get: function () { return protocol_textDocumentContent_1.TextDocumentContentRequest; } });\nObject.defineProperty(exports, \"TextDocumentContentRefreshRequest\", { enumerable: true, get: function () { return protocol_textDocumentContent_1.TextDocumentContentRefreshRequest; } });\n// @ts-ignore: to avoid inlining LocationLink as dynamic import\nlet __noDynamicImport;\n/**\n * The TextDocumentFilter namespace provides helper functions to work with\n * {@link TextDocumentFilter} literals.\n *\n * @since 3.17.0\n */\nvar TextDocumentFilter;\n(function (TextDocumentFilter) {\n    function is(value) {\n        const candidate = value;\n        return Is.string(candidate) || (Is.string(candidate.language) || Is.string(candidate.scheme) || GlobPattern.is(candidate.pattern));\n    }\n    TextDocumentFilter.is = is;\n})(TextDocumentFilter || (exports.TextDocumentFilter = TextDocumentFilter = {}));\n/**\n * The NotebookDocumentFilter namespace provides helper functions to work with\n * {@link NotebookDocumentFilter} literals.\n *\n * @since 3.17.0\n */\nvar NotebookDocumentFilter;\n(function (NotebookDocumentFilter) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && (Is.string(candidate.notebookType) || Is.string(candidate.scheme) || Is.string(candidate.pattern));\n    }\n    NotebookDocumentFilter.is = is;\n})(NotebookDocumentFilter || (exports.NotebookDocumentFilter = NotebookDocumentFilter = {}));\n/**\n * The NotebookCellTextDocumentFilter namespace provides helper functions to work with\n * {@link NotebookCellTextDocumentFilter} literals.\n *\n * @since 3.17.0\n */\nvar NotebookCellTextDocumentFilter;\n(function (NotebookCellTextDocumentFilter) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate)\n            && (Is.string(candidate.notebook) || NotebookDocumentFilter.is(candidate.notebook))\n            && (candidate.language === undefined || Is.string(candidate.language));\n    }\n    NotebookCellTextDocumentFilter.is = is;\n})(NotebookCellTextDocumentFilter || (exports.NotebookCellTextDocumentFilter = NotebookCellTextDocumentFilter = {}));\n/**\n * The DocumentSelector namespace provides helper functions to work with\n * {@link DocumentSelector}s.\n */\nvar DocumentSelector;\n(function (DocumentSelector) {\n    function is(value) {\n        if (!Array.isArray(value)) {\n            return false;\n        }\n        for (const elem of value) {\n            if (!Is.string(elem) && !TextDocumentFilter.is(elem) && !NotebookCellTextDocumentFilter.is(elem)) {\n                return false;\n            }\n        }\n        return true;\n    }\n    DocumentSelector.is = is;\n})(DocumentSelector || (exports.DocumentSelector = DocumentSelector = {}));\n/**\n * The `client/registerCapability` request is sent from the server to the client to register a new capability\n * handler on the client side.\n */\nvar RegistrationRequest;\n(function (RegistrationRequest) {\n    RegistrationRequest.method = 'client/registerCapability';\n    RegistrationRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    RegistrationRequest.type = new messages_1.ProtocolRequestType(RegistrationRequest.method);\n})(RegistrationRequest || (exports.RegistrationRequest = RegistrationRequest = {}));\n/**\n * The `client/unregisterCapability` request is sent from the server to the client to unregister a previously registered capability\n * handler on the client side.\n */\nvar UnregistrationRequest;\n(function (UnregistrationRequest) {\n    UnregistrationRequest.method = 'client/unregisterCapability';\n    UnregistrationRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    UnregistrationRequest.type = new messages_1.ProtocolRequestType(UnregistrationRequest.method);\n})(UnregistrationRequest || (exports.UnregistrationRequest = UnregistrationRequest = {}));\nvar ResourceOperationKind;\n(function (ResourceOperationKind) {\n    /**\n     * Supports creating new files and folders.\n     */\n    ResourceOperationKind.Create = 'create';\n    /**\n     * Supports renaming existing files and folders.\n     */\n    ResourceOperationKind.Rename = 'rename';\n    /**\n     * Supports deleting existing files and folders.\n     */\n    ResourceOperationKind.Delete = 'delete';\n})(ResourceOperationKind || (exports.ResourceOperationKind = ResourceOperationKind = {}));\nvar FailureHandlingKind;\n(function (FailureHandlingKind) {\n    /**\n     * Applying the workspace change is simply aborted if one of the changes provided\n     * fails. All operations executed before the failing operation stay executed.\n     */\n    FailureHandlingKind.Abort = 'abort';\n    /**\n     * All operations are executed transactional. That means they either all\n     * succeed or no changes at all are applied to the workspace.\n     */\n    FailureHandlingKind.Transactional = 'transactional';\n    /**\n     * If the workspace edit contains only textual file changes they are executed transactional.\n     * If resource changes (create, rename or delete file) are part of the change the failure\n     * handling strategy is abort.\n     */\n    FailureHandlingKind.TextOnlyTransactional = 'textOnlyTransactional';\n    /**\n     * The client tries to undo the operations already executed. But there is no\n     * guarantee that this is succeeding.\n     */\n    FailureHandlingKind.Undo = 'undo';\n})(FailureHandlingKind || (exports.FailureHandlingKind = FailureHandlingKind = {}));\n/**\n * Regular Expression Engines\n *\n * @since 3.18.0\n */\nvar RegularExpressionEngineKind;\n(function (RegularExpressionEngineKind) {\n    RegularExpressionEngineKind.ES2020 = 'ES2020';\n})(RegularExpressionEngineKind || (exports.RegularExpressionEngineKind = RegularExpressionEngineKind = {}));\n/**\n * A set of predefined position encoding kinds.\n *\n * @since 3.17.0\n */\nvar PositionEncodingKind;\n(function (PositionEncodingKind) {\n    /**\n     * Character offsets count UTF-8 code units (e.g. bytes).\n     */\n    PositionEncodingKind.UTF8 = 'utf-8';\n    /**\n     * Character offsets count UTF-16 code units.\n     *\n     * This is the default and must always be supported\n     * by servers\n     */\n    PositionEncodingKind.UTF16 = 'utf-16';\n    /**\n     * Character offsets count UTF-32 code units.\n     *\n     * Implementation note: these are the same as Unicode codepoints,\n     * so this `PositionEncodingKind` may also be used for an\n     * encoding-agnostic representation of character offsets.\n     */\n    PositionEncodingKind.UTF32 = 'utf-32';\n})(PositionEncodingKind || (exports.PositionEncodingKind = PositionEncodingKind = {}));\n/**\n * The StaticRegistrationOptions namespace provides helper functions to work with\n * {@link StaticRegistrationOptions} literals.\n */\nvar StaticRegistrationOptions;\n(function (StaticRegistrationOptions) {\n    function hasId(value) {\n        const candidate = value;\n        return candidate && Is.string(candidate.id) && candidate.id.length > 0;\n    }\n    StaticRegistrationOptions.hasId = hasId;\n})(StaticRegistrationOptions || (exports.StaticRegistrationOptions = StaticRegistrationOptions = {}));\n/**\n * The TextDocumentRegistrationOptions namespace provides helper functions to work with\n * {@link TextDocumentRegistrationOptions} literals.\n */\nvar TextDocumentRegistrationOptions;\n(function (TextDocumentRegistrationOptions) {\n    function is(value) {\n        const candidate = value;\n        return candidate && (candidate.documentSelector === null || DocumentSelector.is(candidate.documentSelector));\n    }\n    TextDocumentRegistrationOptions.is = is;\n})(TextDocumentRegistrationOptions || (exports.TextDocumentRegistrationOptions = TextDocumentRegistrationOptions = {}));\n/**\n * The WorkDoneProgressOptions namespace provides helper functions to work with\n * {@link WorkDoneProgressOptions} literals.\n */\nvar WorkDoneProgressOptions;\n(function (WorkDoneProgressOptions) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && (candidate.workDoneProgress === undefined || Is.boolean(candidate.workDoneProgress));\n    }\n    WorkDoneProgressOptions.is = is;\n    function hasWorkDoneProgress(value) {\n        const candidate = value;\n        return candidate && Is.boolean(candidate.workDoneProgress);\n    }\n    WorkDoneProgressOptions.hasWorkDoneProgress = hasWorkDoneProgress;\n})(WorkDoneProgressOptions || (exports.WorkDoneProgressOptions = WorkDoneProgressOptions = {}));\n/**\n * The initialize request is sent from the client to the server.\n * It is sent once as the request after starting up the server.\n * The requests parameter is of type {@link InitializeParams}\n * the response if of type {@link InitializeResult} of a Thenable that\n * resolves to such.\n */\nvar InitializeRequest;\n(function (InitializeRequest) {\n    InitializeRequest.method = 'initialize';\n    InitializeRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    InitializeRequest.type = new messages_1.ProtocolRequestType(InitializeRequest.method);\n})(InitializeRequest || (exports.InitializeRequest = InitializeRequest = {}));\n/**\n * Known error codes for an `InitializeErrorCodes`;\n */\nvar InitializeErrorCodes;\n(function (InitializeErrorCodes) {\n    /**\n     * If the protocol version provided by the client can't be handled by the server.\n     *\n     * @deprecated This initialize error got replaced by client capabilities. There is\n     * no version handshake in version 3.0x\n     */\n    InitializeErrorCodes.unknownProtocolVersion = 1;\n})(InitializeErrorCodes || (exports.InitializeErrorCodes = InitializeErrorCodes = {}));\n/**\n * The initialized notification is sent from the client to the\n * server after the client is fully initialized and the server\n * is allowed to send requests from the server to the client.\n */\nvar InitializedNotification;\n(function (InitializedNotification) {\n    InitializedNotification.method = 'initialized';\n    InitializedNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    InitializedNotification.type = new messages_1.ProtocolNotificationType(InitializedNotification.method);\n})(InitializedNotification || (exports.InitializedNotification = InitializedNotification = {}));\n//---- Shutdown Method ----\n/**\n * A shutdown request is sent from the client to the server.\n * It is sent once when the client decides to shutdown the\n * server. The only notification that is sent after a shutdown request\n * is the exit event.\n */\nvar ShutdownRequest;\n(function (ShutdownRequest) {\n    ShutdownRequest.method = 'shutdown';\n    ShutdownRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    ShutdownRequest.type = new messages_1.ProtocolRequestType0(ShutdownRequest.method);\n})(ShutdownRequest || (exports.ShutdownRequest = ShutdownRequest = {}));\n//---- Exit Notification ----\n/**\n * The exit event is sent from the client to the server to\n * ask the server to exit its process.\n */\nvar ExitNotification;\n(function (ExitNotification) {\n    ExitNotification.method = 'exit';\n    ExitNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    ExitNotification.type = new messages_1.ProtocolNotificationType0(ExitNotification.method);\n})(ExitNotification || (exports.ExitNotification = ExitNotification = {}));\n/**\n * The configuration change notification is sent from the client to the server\n * when the client's configuration has changed. The notification contains\n * the changed configuration as defined by the language client.\n */\nvar DidChangeConfigurationNotification;\n(function (DidChangeConfigurationNotification) {\n    DidChangeConfigurationNotification.method = 'workspace/didChangeConfiguration';\n    DidChangeConfigurationNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidChangeConfigurationNotification.type = new messages_1.ProtocolNotificationType(DidChangeConfigurationNotification.method);\n    DidChangeConfigurationNotification.capabilities = messages_1.CM.create('workspace.didChangeConfiguration', undefined);\n})(DidChangeConfigurationNotification || (exports.DidChangeConfigurationNotification = DidChangeConfigurationNotification = {}));\n//---- Message show and log notifications ----\n/**\n * The message type\n */\nvar MessageType;\n(function (MessageType) {\n    /**\n     * An error message.\n     */\n    MessageType.Error = 1;\n    /**\n     * A warning message.\n     */\n    MessageType.Warning = 2;\n    /**\n     * An information message.\n     */\n    MessageType.Info = 3;\n    /**\n     * A log message.\n     */\n    MessageType.Log = 4;\n    /**\n     * A debug message.\n     *\n     * @since 3.18.0\n     */\n    MessageType.Debug = 5;\n})(MessageType || (exports.MessageType = MessageType = {}));\n/**\n * The show message notification is sent from a server to a client to ask\n * the client to display a particular message in the user interface.\n */\nvar ShowMessageNotification;\n(function (ShowMessageNotification) {\n    ShowMessageNotification.method = 'window/showMessage';\n    ShowMessageNotification.messageDirection = messages_1.MessageDirection.serverToClient;\n    ShowMessageNotification.type = new messages_1.ProtocolNotificationType(ShowMessageNotification.method);\n    ShowMessageNotification.capabilities = messages_1.CM.create('window.showMessage', undefined);\n})(ShowMessageNotification || (exports.ShowMessageNotification = ShowMessageNotification = {}));\n/**\n * The show message request is sent from the server to the client to show a message\n * and a set of options actions to the user.\n */\nvar ShowMessageRequest;\n(function (ShowMessageRequest) {\n    ShowMessageRequest.method = 'window/showMessageRequest';\n    ShowMessageRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    ShowMessageRequest.type = new messages_1.ProtocolRequestType(ShowMessageRequest.method);\n    ShowMessageRequest.capabilities = messages_1.CM.create('window.showMessage', undefined);\n})(ShowMessageRequest || (exports.ShowMessageRequest = ShowMessageRequest = {}));\n/**\n * The log message notification is sent from the server to the client to ask\n * the client to log a particular message.\n */\nvar LogMessageNotification;\n(function (LogMessageNotification) {\n    LogMessageNotification.method = 'window/logMessage';\n    LogMessageNotification.messageDirection = messages_1.MessageDirection.serverToClient;\n    LogMessageNotification.type = new messages_1.ProtocolNotificationType(LogMessageNotification.method);\n})(LogMessageNotification || (exports.LogMessageNotification = LogMessageNotification = {}));\n//---- Telemetry notification\n/**\n * The telemetry event notification is sent from the server to the client to ask\n * the client to log telemetry data.\n */\nvar TelemetryEventNotification;\n(function (TelemetryEventNotification) {\n    TelemetryEventNotification.method = 'telemetry/event';\n    TelemetryEventNotification.messageDirection = messages_1.MessageDirection.serverToClient;\n    TelemetryEventNotification.type = new messages_1.ProtocolNotificationType(TelemetryEventNotification.method);\n})(TelemetryEventNotification || (exports.TelemetryEventNotification = TelemetryEventNotification = {}));\n/**\n * Defines how the host (editor) should sync\n * document changes to the language server.\n */\nvar TextDocumentSyncKind;\n(function (TextDocumentSyncKind) {\n    /**\n     * Documents should not be synced at all.\n     */\n    TextDocumentSyncKind.None = 0;\n    /**\n     * Documents are synced by always sending the full content\n     * of the document.\n     */\n    TextDocumentSyncKind.Full = 1;\n    /**\n     * Documents are synced by sending the full content on open.\n     * After that only incremental updates to the document are\n     * send.\n     */\n    TextDocumentSyncKind.Incremental = 2;\n})(TextDocumentSyncKind || (exports.TextDocumentSyncKind = TextDocumentSyncKind = {}));\n/**\n * The document open notification is sent from the client to the server to signal\n * newly opened text documents. The document's truth is now managed by the client\n * and the server must not try to read the document's truth using the document's\n * uri. Open in this sense means it is managed by the client. It doesn't necessarily\n * mean that its content is presented in an editor. An open notification must not\n * be sent more than once without a corresponding close notification send before.\n * This means open and close notification must be balanced and the max open count\n * is one.\n */\nvar DidOpenTextDocumentNotification;\n(function (DidOpenTextDocumentNotification) {\n    DidOpenTextDocumentNotification.method = 'textDocument/didOpen';\n    DidOpenTextDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidOpenTextDocumentNotification.type = new messages_1.ProtocolNotificationType(DidOpenTextDocumentNotification.method);\n    DidOpenTextDocumentNotification.capabilities = messages_1.CM.create('textDocument.synchronization', 'textDocumentSync.openClose');\n})(DidOpenTextDocumentNotification || (exports.DidOpenTextDocumentNotification = DidOpenTextDocumentNotification = {}));\nvar TextDocumentContentChangeEvent;\n(function (TextDocumentContentChangeEvent) {\n    /**\n     * Checks whether the information describes a delta event.\n     */\n    function isIncremental(event) {\n        const 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    TextDocumentContentChangeEvent.isIncremental = isIncremental;\n    /**\n     * Checks whether the information describes a full replacement event.\n     */\n    function isFull(event) {\n        const candidate = event;\n        return candidate !== undefined && candidate !== null &&\n            typeof candidate.text === 'string' && candidate.range === undefined && candidate.rangeLength === undefined;\n    }\n    TextDocumentContentChangeEvent.isFull = isFull;\n})(TextDocumentContentChangeEvent || (exports.TextDocumentContentChangeEvent = TextDocumentContentChangeEvent = {}));\n/**\n * The document change notification is sent from the client to the server to signal\n * changes to a text document.\n */\nvar DidChangeTextDocumentNotification;\n(function (DidChangeTextDocumentNotification) {\n    DidChangeTextDocumentNotification.method = 'textDocument/didChange';\n    DidChangeTextDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidChangeTextDocumentNotification.type = new messages_1.ProtocolNotificationType(DidChangeTextDocumentNotification.method);\n    DidChangeTextDocumentNotification.capabilities = messages_1.CM.create('textDocument.synchronization', 'textDocumentSync');\n})(DidChangeTextDocumentNotification || (exports.DidChangeTextDocumentNotification = DidChangeTextDocumentNotification = {}));\n/**\n * The document close notification is sent from the client to the server when\n * the document got closed in the client. The document's truth now exists where\n * the document's uri points to (e.g. if the document's uri is a file uri the\n * truth now exists on disk). As with the open notification the close notification\n * is about managing the document's content. Receiving a close notification\n * doesn't mean that the document was open in an editor before. A close\n * notification requires a previous open notification to be sent.\n */\nvar DidCloseTextDocumentNotification;\n(function (DidCloseTextDocumentNotification) {\n    DidCloseTextDocumentNotification.method = 'textDocument/didClose';\n    DidCloseTextDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidCloseTextDocumentNotification.type = new messages_1.ProtocolNotificationType(DidCloseTextDocumentNotification.method);\n    DidCloseTextDocumentNotification.capabilities = messages_1.CM.create('textDocument.synchronization', 'textDocumentSync.openClose');\n})(DidCloseTextDocumentNotification || (exports.DidCloseTextDocumentNotification = DidCloseTextDocumentNotification = {}));\n/**\n * The document save notification is sent from the client to the server when\n * the document got saved in the client.\n */\nvar DidSaveTextDocumentNotification;\n(function (DidSaveTextDocumentNotification) {\n    DidSaveTextDocumentNotification.method = 'textDocument/didSave';\n    DidSaveTextDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidSaveTextDocumentNotification.type = new messages_1.ProtocolNotificationType(DidSaveTextDocumentNotification.method);\n    DidSaveTextDocumentNotification.capabilities = messages_1.CM.create('textDocument.synchronization.didSave', 'textDocumentSync.save');\n})(DidSaveTextDocumentNotification || (exports.DidSaveTextDocumentNotification = DidSaveTextDocumentNotification = {}));\n/**\n * Represents reasons why a text document is saved.\n */\nvar TextDocumentSaveReason;\n(function (TextDocumentSaveReason) {\n    /**\n     * Manually triggered, e.g. by the user pressing save, by starting debugging,\n     * or by an API call.\n     */\n    TextDocumentSaveReason.Manual = 1;\n    /**\n     * Automatic after a delay.\n     */\n    TextDocumentSaveReason.AfterDelay = 2;\n    /**\n     * When the editor lost focus.\n     */\n    TextDocumentSaveReason.FocusOut = 3;\n})(TextDocumentSaveReason || (exports.TextDocumentSaveReason = TextDocumentSaveReason = {}));\n/**\n * A document will save notification is sent from the client to the server before\n * the document is actually saved.\n */\nvar WillSaveTextDocumentNotification;\n(function (WillSaveTextDocumentNotification) {\n    WillSaveTextDocumentNotification.method = 'textDocument/willSave';\n    WillSaveTextDocumentNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    WillSaveTextDocumentNotification.type = new messages_1.ProtocolNotificationType(WillSaveTextDocumentNotification.method);\n    WillSaveTextDocumentNotification.capabilities = messages_1.CM.create('textDocument.synchronization.willSave', 'textDocumentSync.willSave');\n})(WillSaveTextDocumentNotification || (exports.WillSaveTextDocumentNotification = WillSaveTextDocumentNotification = {}));\n/**\n * A document will save request is sent from the client to the server before\n * the document is actually saved. The request can return an array of TextEdits\n * which will be applied to the text document before it is saved. Please note that\n * clients might drop results if computing the text edits took too long or if a\n * server constantly fails on this request. This is done to keep the save fast and\n * reliable.\n */\nvar WillSaveTextDocumentWaitUntilRequest;\n(function (WillSaveTextDocumentWaitUntilRequest) {\n    WillSaveTextDocumentWaitUntilRequest.method = 'textDocument/willSaveWaitUntil';\n    WillSaveTextDocumentWaitUntilRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    WillSaveTextDocumentWaitUntilRequest.type = new messages_1.ProtocolRequestType(WillSaveTextDocumentWaitUntilRequest.method);\n    WillSaveTextDocumentWaitUntilRequest.capabilities = messages_1.CM.create('textDocument.synchronization.willSaveWaitUntil', 'textDocumentSync.willSaveWaitUntil');\n})(WillSaveTextDocumentWaitUntilRequest || (exports.WillSaveTextDocumentWaitUntilRequest = WillSaveTextDocumentWaitUntilRequest = {}));\n/**\n * The watched files notification is sent from the client to the server when\n * the client detects changes to file watched by the language client.\n */\nvar DidChangeWatchedFilesNotification;\n(function (DidChangeWatchedFilesNotification) {\n    DidChangeWatchedFilesNotification.method = 'workspace/didChangeWatchedFiles';\n    DidChangeWatchedFilesNotification.messageDirection = messages_1.MessageDirection.clientToServer;\n    DidChangeWatchedFilesNotification.type = new messages_1.ProtocolNotificationType(DidChangeWatchedFilesNotification.method);\n    DidChangeWatchedFilesNotification.capabilities = messages_1.CM.create('workspace.didChangeWatchedFiles', undefined);\n})(DidChangeWatchedFilesNotification || (exports.DidChangeWatchedFilesNotification = DidChangeWatchedFilesNotification = {}));\n/**\n * The file event type\n */\nvar FileChangeType;\n(function (FileChangeType) {\n    /**\n     * The file got created.\n     */\n    FileChangeType.Created = 1;\n    /**\n     * The file got changed.\n     */\n    FileChangeType.Changed = 2;\n    /**\n     * The file got deleted.\n     */\n    FileChangeType.Deleted = 3;\n})(FileChangeType || (exports.FileChangeType = FileChangeType = {}));\nvar RelativePattern;\n(function (RelativePattern) {\n    function is(value) {\n        const candidate = value;\n        return Is.objectLiteral(candidate) && (vscode_languageserver_types_1.URI.is(candidate.baseUri) || vscode_languageserver_types_1.WorkspaceFolder.is(candidate.baseUri)) && Is.string(candidate.pattern);\n    }\n    RelativePattern.is = is;\n})(RelativePattern || (exports.RelativePattern = RelativePattern = {}));\nvar GlobPattern;\n(function (GlobPattern) {\n    function is(value) {\n        const candidate = value;\n        return Is.string(candidate) || RelativePattern.is(candidate);\n    }\n    GlobPattern.is = is;\n})(GlobPattern || (exports.GlobPattern = GlobPattern = {}));\nvar WatchKind;\n(function (WatchKind) {\n    /**\n     * Interested in create events.\n     */\n    WatchKind.Create = 1;\n    /**\n     * Interested in change events\n     */\n    WatchKind.Change = 2;\n    /**\n     * Interested in delete events\n     */\n    WatchKind.Delete = 4;\n})(WatchKind || (exports.WatchKind = WatchKind = {}));\n/**\n * Diagnostics notification are sent from the server to the client to signal\n * results of validation runs.\n */\nvar PublishDiagnosticsNotification;\n(function (PublishDiagnosticsNotification) {\n    PublishDiagnosticsNotification.method = 'textDocument/publishDiagnostics';\n    PublishDiagnosticsNotification.messageDirection = messages_1.MessageDirection.serverToClient;\n    PublishDiagnosticsNotification.type = new messages_1.ProtocolNotificationType(PublishDiagnosticsNotification.method);\n    PublishDiagnosticsNotification.capabilities = messages_1.CM.create('textDocument.publishDiagnostics', undefined);\n})(PublishDiagnosticsNotification || (exports.PublishDiagnosticsNotification = PublishDiagnosticsNotification = {}));\n/**\n * How a completion was triggered\n */\nvar CompletionTriggerKind;\n(function (CompletionTriggerKind) {\n    /**\n     * Completion was triggered by typing an identifier (24x7 code\n     * complete), manual invocation (e.g Ctrl+Space) or via API.\n     */\n    CompletionTriggerKind.Invoked = 1;\n    /**\n     * Completion was triggered by a trigger character specified by\n     * the `triggerCharacters` properties of the `CompletionRegistrationOptions`.\n     */\n    CompletionTriggerKind.TriggerCharacter = 2;\n    /**\n     * Completion was re-triggered as current completion list is incomplete\n     */\n    CompletionTriggerKind.TriggerForIncompleteCompletions = 3;\n})(CompletionTriggerKind || (exports.CompletionTriggerKind = CompletionTriggerKind = {}));\n/**\n * Request to request completion at a given text document position. The request's\n * parameter is of type {@link TextDocumentPosition} the response\n * is of type {@link CompletionItem CompletionItem[]} or {@link CompletionList}\n * or a Thenable that resolves to such.\n *\n * The request can delay the computation of the {@link CompletionItem.detail `detail`}\n * and {@link CompletionItem.documentation `documentation`} properties to the `completionItem/resolve`\n * request. However, properties that are needed for the initial sorting and filtering, like `sortText`,\n * `filterText`, `insertText`, and `textEdit`, must not be changed during resolve.\n */\nvar CompletionRequest;\n(function (CompletionRequest) {\n    CompletionRequest.method = 'textDocument/completion';\n    CompletionRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CompletionRequest.type = new messages_1.ProtocolRequestType(CompletionRequest.method);\n    CompletionRequest.capabilities = messages_1.CM.create('textDocument.completion', 'completionProvider');\n})(CompletionRequest || (exports.CompletionRequest = CompletionRequest = {}));\n/**\n * Request to resolve additional information for a given completion item.The request's\n * parameter is of type {@link CompletionItem} the response\n * is of type {@link CompletionItem} or a Thenable that resolves to such.\n */\nvar CompletionResolveRequest;\n(function (CompletionResolveRequest) {\n    CompletionResolveRequest.method = 'completionItem/resolve';\n    CompletionResolveRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CompletionResolveRequest.type = new messages_1.ProtocolRequestType(CompletionResolveRequest.method);\n    CompletionResolveRequest.capabilities = messages_1.CM.create('textDocument.completion.completionItem.resolveSupport', 'completionProvider.resolveProvider');\n})(CompletionResolveRequest || (exports.CompletionResolveRequest = CompletionResolveRequest = {}));\n/**\n * Request to request hover information at a given text document position. The request's\n * parameter is of type {@link TextDocumentPosition} the response is of\n * type {@link Hover} or a Thenable that resolves to such.\n */\nvar HoverRequest;\n(function (HoverRequest) {\n    HoverRequest.method = 'textDocument/hover';\n    HoverRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    HoverRequest.type = new messages_1.ProtocolRequestType(HoverRequest.method);\n    HoverRequest.capabilities = messages_1.CM.create('textDocument.hover', 'hoverProvider');\n})(HoverRequest || (exports.HoverRequest = HoverRequest = {}));\n/**\n * How a signature help was triggered.\n *\n * @since 3.15.0\n */\nvar SignatureHelpTriggerKind;\n(function (SignatureHelpTriggerKind) {\n    /**\n     * Signature help was invoked manually by the user or by a command.\n     */\n    SignatureHelpTriggerKind.Invoked = 1;\n    /**\n     * Signature help was triggered by a trigger character.\n     */\n    SignatureHelpTriggerKind.TriggerCharacter = 2;\n    /**\n     * Signature help was triggered by the cursor moving or by the document content changing.\n     */\n    SignatureHelpTriggerKind.ContentChange = 3;\n})(SignatureHelpTriggerKind || (exports.SignatureHelpTriggerKind = SignatureHelpTriggerKind = {}));\nvar SignatureHelpRequest;\n(function (SignatureHelpRequest) {\n    SignatureHelpRequest.method = 'textDocument/signatureHelp';\n    SignatureHelpRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    SignatureHelpRequest.type = new messages_1.ProtocolRequestType(SignatureHelpRequest.method);\n    SignatureHelpRequest.capabilities = messages_1.CM.create('textDocument.signatureHelp', 'signatureHelpProvider');\n})(SignatureHelpRequest || (exports.SignatureHelpRequest = SignatureHelpRequest = {}));\n/**\n * A request to resolve the definition location of a symbol at a given text\n * document position. The request's parameter is of type {@link TextDocumentPosition}\n * the response is of either type {@link Definition} or a typed array of\n * {@link DefinitionLink} or a Thenable that resolves to such.\n */\nvar DefinitionRequest;\n(function (DefinitionRequest) {\n    DefinitionRequest.method = 'textDocument/definition';\n    DefinitionRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DefinitionRequest.type = new messages_1.ProtocolRequestType(DefinitionRequest.method);\n    DefinitionRequest.capabilities = messages_1.CM.create('textDocument.definition', 'definitionProvider');\n})(DefinitionRequest || (exports.DefinitionRequest = DefinitionRequest = {}));\n/**\n * A request to resolve project-wide references for the symbol denoted\n * by the given text document position. The request's parameter is of\n * type {@link ReferenceParams} the response is of type\n * {@link Location Location[]} or a Thenable that resolves to such.\n */\nvar ReferencesRequest;\n(function (ReferencesRequest) {\n    ReferencesRequest.method = 'textDocument/references';\n    ReferencesRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    ReferencesRequest.type = new messages_1.ProtocolRequestType(ReferencesRequest.method);\n    ReferencesRequest.capabilities = messages_1.CM.create('textDocument.references', 'referencesProvider');\n})(ReferencesRequest || (exports.ReferencesRequest = ReferencesRequest = {}));\n/**\n * Request to resolve a {@link DocumentHighlight} for a given\n * text document position. The request's parameter is of type {@link TextDocumentPosition}\n * the request response is an array of type {@link DocumentHighlight}\n * or a Thenable that resolves to such.\n */\nvar DocumentHighlightRequest;\n(function (DocumentHighlightRequest) {\n    DocumentHighlightRequest.method = 'textDocument/documentHighlight';\n    DocumentHighlightRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentHighlightRequest.type = new messages_1.ProtocolRequestType(DocumentHighlightRequest.method);\n    DocumentHighlightRequest.capabilities = messages_1.CM.create('textDocument.documentHighlight', 'documentHighlightProvider');\n})(DocumentHighlightRequest || (exports.DocumentHighlightRequest = DocumentHighlightRequest = {}));\n/**\n * A request to list all symbols found in a given text document. The request's\n * parameter is of type {@link TextDocumentIdentifier} the\n * response is of type {@link SymbolInformation SymbolInformation[]} or a Thenable\n * that resolves to such.\n */\nvar DocumentSymbolRequest;\n(function (DocumentSymbolRequest) {\n    DocumentSymbolRequest.method = 'textDocument/documentSymbol';\n    DocumentSymbolRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentSymbolRequest.type = new messages_1.ProtocolRequestType(DocumentSymbolRequest.method);\n    DocumentSymbolRequest.capabilities = messages_1.CM.create('textDocument.documentSymbol', 'documentSymbolProvider');\n})(DocumentSymbolRequest || (exports.DocumentSymbolRequest = DocumentSymbolRequest = {}));\n/**\n * A request to provide commands for the given text document and range.\n */\nvar CodeActionRequest;\n(function (CodeActionRequest) {\n    CodeActionRequest.method = 'textDocument/codeAction';\n    CodeActionRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CodeActionRequest.type = new messages_1.ProtocolRequestType(CodeActionRequest.method);\n    CodeActionRequest.capabilities = messages_1.CM.create('textDocument.codeAction', 'codeActionProvider');\n})(CodeActionRequest || (exports.CodeActionRequest = CodeActionRequest = {}));\n/**\n * Request to resolve additional information for a given code action.The request's\n * parameter is of type {@link CodeAction} the response\n * is of type {@link CodeAction} or a Thenable that resolves to such.\n */\nvar CodeActionResolveRequest;\n(function (CodeActionResolveRequest) {\n    CodeActionResolveRequest.method = 'codeAction/resolve';\n    CodeActionResolveRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CodeActionResolveRequest.type = new messages_1.ProtocolRequestType(CodeActionResolveRequest.method);\n    CodeActionResolveRequest.capabilities = messages_1.CM.create('textDocument.codeAction.resolveSupport', 'codeActionProvider.resolveProvider');\n})(CodeActionResolveRequest || (exports.CodeActionResolveRequest = CodeActionResolveRequest = {}));\n/**\n * A request to list project-wide symbols matching the query string given\n * by the {@link WorkspaceSymbolParams}. The response is\n * of type {@link SymbolInformation SymbolInformation[]} or a Thenable that\n * resolves to such.\n *\n * @since 3.17.0 - support for WorkspaceSymbol in the returned data. Clients\n *  need to advertise support for WorkspaceSymbols via the client capability\n *  `workspace.symbol.resolveSupport`.\n *\n */\nvar WorkspaceSymbolRequest;\n(function (WorkspaceSymbolRequest) {\n    WorkspaceSymbolRequest.method = 'workspace/symbol';\n    WorkspaceSymbolRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    WorkspaceSymbolRequest.type = new messages_1.ProtocolRequestType(WorkspaceSymbolRequest.method);\n    WorkspaceSymbolRequest.capabilities = messages_1.CM.create('workspace.symbol', 'workspaceSymbolProvider');\n})(WorkspaceSymbolRequest || (exports.WorkspaceSymbolRequest = WorkspaceSymbolRequest = {}));\n/**\n * A request to resolve the range inside the workspace\n * symbol's location.\n *\n * @since 3.17.0\n */\nvar WorkspaceSymbolResolveRequest;\n(function (WorkspaceSymbolResolveRequest) {\n    WorkspaceSymbolResolveRequest.method = 'workspaceSymbol/resolve';\n    WorkspaceSymbolResolveRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    WorkspaceSymbolResolveRequest.type = new messages_1.ProtocolRequestType(WorkspaceSymbolResolveRequest.method);\n    WorkspaceSymbolResolveRequest.capabilities = messages_1.CM.create('workspace.symbol.resolveSupport', 'workspaceSymbolProvider.resolveProvider');\n})(WorkspaceSymbolResolveRequest || (exports.WorkspaceSymbolResolveRequest = WorkspaceSymbolResolveRequest = {}));\n/**\n * A request to provide code lens for the given text document.\n */\nvar CodeLensRequest;\n(function (CodeLensRequest) {\n    CodeLensRequest.method = 'textDocument/codeLens';\n    CodeLensRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CodeLensRequest.type = new messages_1.ProtocolRequestType(CodeLensRequest.method);\n    CodeLensRequest.capabilities = messages_1.CM.create('textDocument.codeLens', 'codeLensProvider');\n})(CodeLensRequest || (exports.CodeLensRequest = CodeLensRequest = {}));\n/**\n * A request to resolve a command for a given code lens.\n */\nvar CodeLensResolveRequest;\n(function (CodeLensResolveRequest) {\n    CodeLensResolveRequest.method = 'codeLens/resolve';\n    CodeLensResolveRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    CodeLensResolveRequest.type = new messages_1.ProtocolRequestType(CodeLensResolveRequest.method);\n    CodeLensResolveRequest.capabilities = messages_1.CM.create('textDocument.codeLens.resolveSupport', 'codeLensProvider.resolveProvider');\n})(CodeLensResolveRequest || (exports.CodeLensResolveRequest = CodeLensResolveRequest = {}));\n/**\n * A request to refresh all code actions\n *\n * @since 3.16.0\n */\nvar CodeLensRefreshRequest;\n(function (CodeLensRefreshRequest) {\n    CodeLensRefreshRequest.method = `workspace/codeLens/refresh`;\n    CodeLensRefreshRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    CodeLensRefreshRequest.type = new messages_1.ProtocolRequestType0(CodeLensRefreshRequest.method);\n    CodeLensRefreshRequest.capabilities = messages_1.CM.create('workspace.codeLens', undefined);\n})(CodeLensRefreshRequest || (exports.CodeLensRefreshRequest = CodeLensRefreshRequest = {}));\n/**\n * A request to provide document links\n */\nvar DocumentLinkRequest;\n(function (DocumentLinkRequest) {\n    DocumentLinkRequest.method = 'textDocument/documentLink';\n    DocumentLinkRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentLinkRequest.type = new messages_1.ProtocolRequestType(DocumentLinkRequest.method);\n    DocumentLinkRequest.capabilities = messages_1.CM.create('textDocument.documentLink', 'documentLinkProvider');\n})(DocumentLinkRequest || (exports.DocumentLinkRequest = DocumentLinkRequest = {}));\n/**\n * Request to resolve additional information for a given document link. The request's\n * parameter is of type {@link DocumentLink} the response\n * is of type {@link DocumentLink} or a Thenable that resolves to such.\n */\nvar DocumentLinkResolveRequest;\n(function (DocumentLinkResolveRequest) {\n    DocumentLinkResolveRequest.method = 'documentLink/resolve';\n    DocumentLinkResolveRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentLinkResolveRequest.type = new messages_1.ProtocolRequestType(DocumentLinkResolveRequest.method);\n    DocumentLinkResolveRequest.capabilities = messages_1.CM.create('textDocument.documentLink', 'documentLinkProvider.resolveProvider');\n})(DocumentLinkResolveRequest || (exports.DocumentLinkResolveRequest = DocumentLinkResolveRequest = {}));\n/**\n * A request to format a whole document.\n */\nvar DocumentFormattingRequest;\n(function (DocumentFormattingRequest) {\n    DocumentFormattingRequest.method = 'textDocument/formatting';\n    DocumentFormattingRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentFormattingRequest.type = new messages_1.ProtocolRequestType(DocumentFormattingRequest.method);\n    DocumentFormattingRequest.capabilities = messages_1.CM.create('textDocument.formatting', 'documentFormattingProvider');\n})(DocumentFormattingRequest || (exports.DocumentFormattingRequest = DocumentFormattingRequest = {}));\n/**\n * A request to format a range in a document.\n */\nvar DocumentRangeFormattingRequest;\n(function (DocumentRangeFormattingRequest) {\n    DocumentRangeFormattingRequest.method = 'textDocument/rangeFormatting';\n    DocumentRangeFormattingRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentRangeFormattingRequest.type = new messages_1.ProtocolRequestType(DocumentRangeFormattingRequest.method);\n    DocumentRangeFormattingRequest.capabilities = messages_1.CM.create('textDocument.rangeFormatting', 'documentRangeFormattingProvider');\n})(DocumentRangeFormattingRequest || (exports.DocumentRangeFormattingRequest = DocumentRangeFormattingRequest = {}));\n/**\n * A request to format ranges in a document.\n *\n * @since 3.18.0\n */\nvar DocumentRangesFormattingRequest;\n(function (DocumentRangesFormattingRequest) {\n    DocumentRangesFormattingRequest.method = 'textDocument/rangesFormatting';\n    DocumentRangesFormattingRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentRangesFormattingRequest.type = new messages_1.ProtocolRequestType(DocumentRangesFormattingRequest.method);\n    DocumentRangesFormattingRequest.capabilities = messages_1.CM.create('textDocument.rangeFormatting.rangesSupport', 'documentRangeFormattingProvider.rangesSupport');\n})(DocumentRangesFormattingRequest || (exports.DocumentRangesFormattingRequest = DocumentRangesFormattingRequest = {}));\n/**\n * A request to format a document on type.\n */\nvar DocumentOnTypeFormattingRequest;\n(function (DocumentOnTypeFormattingRequest) {\n    DocumentOnTypeFormattingRequest.method = 'textDocument/onTypeFormatting';\n    DocumentOnTypeFormattingRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    DocumentOnTypeFormattingRequest.type = new messages_1.ProtocolRequestType(DocumentOnTypeFormattingRequest.method);\n    DocumentOnTypeFormattingRequest.capabilities = messages_1.CM.create('textDocument.onTypeFormatting', 'documentOnTypeFormattingProvider');\n})(DocumentOnTypeFormattingRequest || (exports.DocumentOnTypeFormattingRequest = DocumentOnTypeFormattingRequest = {}));\n//---- Rename ----------------------------------------------\nvar PrepareSupportDefaultBehavior;\n(function (PrepareSupportDefaultBehavior) {\n    /**\n     * The client's default behavior is to select the identifier\n     * according the to language's syntax rule.\n     */\n    PrepareSupportDefaultBehavior.Identifier = 1;\n})(PrepareSupportDefaultBehavior || (exports.PrepareSupportDefaultBehavior = PrepareSupportDefaultBehavior = {}));\n/**\n * A request to rename a symbol.\n */\nvar RenameRequest;\n(function (RenameRequest) {\n    RenameRequest.method = 'textDocument/rename';\n    RenameRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    RenameRequest.type = new messages_1.ProtocolRequestType(RenameRequest.method);\n    RenameRequest.capabilities = messages_1.CM.create('textDocument.rename', 'renameProvider');\n})(RenameRequest || (exports.RenameRequest = RenameRequest = {}));\n/**\n * A request to test and perform the setup necessary for a rename.\n *\n * @since 3.16 - support for default behavior\n */\nvar PrepareRenameRequest;\n(function (PrepareRenameRequest) {\n    PrepareRenameRequest.method = 'textDocument/prepareRename';\n    PrepareRenameRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    PrepareRenameRequest.type = new messages_1.ProtocolRequestType(PrepareRenameRequest.method);\n    PrepareRenameRequest.capabilities = messages_1.CM.create('textDocument.rename.prepareSupport', 'renameProvider.prepareProvider');\n})(PrepareRenameRequest || (exports.PrepareRenameRequest = PrepareRenameRequest = {}));\n/**\n * A request send from the client to the server to execute a command. The request might return\n * a workspace edit which the client will apply to the workspace.\n */\nvar ExecuteCommandRequest;\n(function (ExecuteCommandRequest) {\n    ExecuteCommandRequest.method = 'workspace/executeCommand';\n    ExecuteCommandRequest.messageDirection = messages_1.MessageDirection.clientToServer;\n    ExecuteCommandRequest.type = new messages_1.ProtocolRequestType(ExecuteCommandRequest.method);\n    ExecuteCommandRequest.capabilities = messages_1.CM.create('workspace.executeCommand', 'executeCommandProvider');\n})(ExecuteCommandRequest || (exports.ExecuteCommandRequest = ExecuteCommandRequest = {}));\n/**\n * A request sent from the server to the client to modified certain resources.\n */\nvar ApplyWorkspaceEditRequest;\n(function (ApplyWorkspaceEditRequest) {\n    ApplyWorkspaceEditRequest.method = 'workspace/applyEdit';\n    ApplyWorkspaceEditRequest.messageDirection = messages_1.MessageDirection.serverToClient;\n    ApplyWorkspaceEditRequest.type = new messages_1.ProtocolRequestType('workspace/applyEdit');\n    ApplyWorkspaceEditRequest.capabilities = messages_1.CM.create('workspace.applyEdit', undefined);\n})(ApplyWorkspaceEditRequest || (exports.ApplyWorkspaceEditRequest = ApplyWorkspaceEditRequest = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createProtocolConnection = createProtocolConnection;\nconst vscode_jsonrpc_1 = require(\"vscode-jsonrpc\");\nfunction createProtocolConnection(input, output, logger, options) {\n    if (vscode_jsonrpc_1.ConnectionStrategy.is(options)) {\n        options = { connectionStrategy: options };\n    }\n    return (0, vscode_jsonrpc_1.createMessageConnection)(input, output, logger, options);\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.LSPErrorCodes = exports.createProtocolConnection = void 0;\n__exportStar(require(\"vscode-jsonrpc\"), exports);\n__exportStar(require(\"vscode-languageserver-types\"), exports);\n__exportStar(require(\"./messages\"), exports);\n__exportStar(require(\"./protocol\"), exports);\nvar connection_1 = require(\"./connection\");\nObject.defineProperty(exports, \"createProtocolConnection\", { enumerable: true, get: function () { return connection_1.createProtocolConnection; } });\nvar LSPErrorCodes;\n(function (LSPErrorCodes) {\n    /**\n    * This is the start range of LSP reserved error codes.\n    * It doesn't denote a real error code.\n    *\n    * @since 3.16.0\n    */\n    LSPErrorCodes.lspReservedErrorRangeStart = -32899;\n    /**\n     * A request failed but it was syntactically correct, e.g the\n     * method name was known and the parameters were valid. The error\n     * message should contain human readable information about why\n     * the request failed.\n     *\n     * @since 3.17.0\n     */\n    LSPErrorCodes.RequestFailed = -32803;\n    /**\n     * The server cancelled the request. This error code should\n     * only be used for requests that explicitly support being\n     * server cancellable.\n     *\n     * @since 3.17.0\n     */\n    LSPErrorCodes.ServerCancelled = -32802;\n    /**\n     * The server detected that the content of a document got\n     * modified outside normal conditions. A server should\n     * NOT send this error code if it detects a content change\n     * in it unprocessed messages. The result even computed\n     * on an older state might still be useful for the client.\n     *\n     * If a client decides that a result is not of any use anymore\n     * the client should cancel the request.\n     */\n    LSPErrorCodes.ContentModified = -32801;\n    /**\n     * The client has canceled a request and a server has detected\n     * the cancel.\n     */\n    LSPErrorCodes.RequestCancelled = -32800;\n    /**\n    * This is the end range of LSP reserved error codes.\n    * It doesn't denote a real error code.\n    *\n    * @since 3.16.0\n    */\n    LSPErrorCodes.lspReservedErrorRangeEnd = -32800;\n})(LSPErrorCodes || (exports.LSPErrorCodes = LSPErrorCodes = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SemanticTokensBuilder = exports.SemanticTokensDiff = exports.SemanticTokensFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst SemanticTokensFeature = (Base) => {\n    return class extends Base {\n        get semanticTokens() {\n            return {\n                refresh: () => {\n                    return this.connection.sendRequest(vscode_languageserver_protocol_1.SemanticTokensRefreshRequest.type);\n                },\n                on: (handler) => {\n                    const type = vscode_languageserver_protocol_1.SemanticTokensRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                },\n                onDelta: (handler) => {\n                    const type = vscode_languageserver_protocol_1.SemanticTokensDeltaRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                },\n                onRange: (handler) => {\n                    const type = vscode_languageserver_protocol_1.SemanticTokensRangeRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                }\n            };\n        }\n    };\n};\nexports.SemanticTokensFeature = SemanticTokensFeature;\nclass SemanticTokensDiff {\n    originalSequence;\n    modifiedSequence;\n    constructor(originalSequence, modifiedSequence) {\n        this.originalSequence = originalSequence;\n        this.modifiedSequence = modifiedSequence;\n    }\n    computeDiff() {\n        const originalLength = this.originalSequence.length;\n        const modifiedLength = this.modifiedSequence.length;\n        let startIndex = 0;\n        while (startIndex < modifiedLength && startIndex < originalLength && this.originalSequence[startIndex] === this.modifiedSequence[startIndex]) {\n            startIndex++;\n        }\n        if (startIndex < modifiedLength && startIndex < originalLength) {\n            let originalEndIndex = originalLength - 1;\n            let modifiedEndIndex = modifiedLength - 1;\n            while (originalEndIndex >= startIndex && modifiedEndIndex >= startIndex && this.originalSequence[originalEndIndex] === this.modifiedSequence[modifiedEndIndex]) {\n                originalEndIndex--;\n                modifiedEndIndex--;\n            }\n            // if one moved behind the start index move them forward again\n            if (originalEndIndex < startIndex || modifiedEndIndex < startIndex) {\n                originalEndIndex++;\n                modifiedEndIndex++;\n            }\n            const deleteCount = originalEndIndex - startIndex + 1;\n            const newData = this.modifiedSequence.slice(startIndex, modifiedEndIndex + 1);\n            // If we moved behind the start index we could have missed a simple delete.\n            if (newData.length === 1 && newData[0] === this.originalSequence[originalEndIndex]) {\n                return [\n                    { start: startIndex, deleteCount: deleteCount - 1 }\n                ];\n            }\n            else {\n                return [\n                    { start: startIndex, deleteCount, data: newData }\n                ];\n            }\n        }\n        else if (startIndex < modifiedLength) {\n            return [\n                { start: startIndex, deleteCount: 0, data: this.modifiedSequence.slice(startIndex) }\n            ];\n        }\n        else if (startIndex < originalLength) {\n            return [\n                { start: startIndex, deleteCount: originalLength - startIndex }\n            ];\n        }\n        else {\n            // The two arrays are the same.\n            return [];\n        }\n    }\n}\nexports.SemanticTokensDiff = SemanticTokensDiff;\nclass SemanticTokensBuilder {\n    _id;\n    _prevLine;\n    _prevChar;\n    _dataIsSortedAndDeltaEncoded;\n    _data;\n    _dataNonDelta;\n    _dataLen;\n    _prevData;\n    constructor() {\n        this._prevData = undefined;\n        this.initialize();\n    }\n    initialize() {\n        this._id = Date.now();\n        this._prevLine = 0;\n        this._prevChar = 0;\n        this._data = [];\n        this._dataNonDelta = [];\n        this._dataLen = 0;\n        this._dataIsSortedAndDeltaEncoded = true;\n    }\n    push(line, char, length, tokenType, tokenModifiers) {\n        if (this._dataIsSortedAndDeltaEncoded && (line < this._prevLine || (line === this._prevLine && char < this._prevChar))) {\n            // push calls were ordered and are no longer ordered\n            this._dataIsSortedAndDeltaEncoded = false;\n            this._dataNonDelta = SemanticTokensBuilder._deltaDecode(this._data);\n        }\n        let pushLine = line;\n        let pushChar = char;\n        if (this._dataIsSortedAndDeltaEncoded && this._dataLen > 0) {\n            pushLine -= this._prevLine;\n            if (pushLine === 0) {\n                pushChar -= this._prevChar;\n            }\n        }\n        const dataSource = this._dataIsSortedAndDeltaEncoded ? this._data : this._dataNonDelta;\n        dataSource[this._dataLen++] = pushLine;\n        dataSource[this._dataLen++] = pushChar;\n        dataSource[this._dataLen++] = length;\n        dataSource[this._dataLen++] = tokenType;\n        dataSource[this._dataLen++] = tokenModifiers;\n        this._prevLine = line;\n        this._prevChar = char;\n    }\n    get id() {\n        return this._id.toString();\n    }\n    static _deltaDecode(data) {\n        // Remove delta encoding from data\n        const tokenCount = (data.length / 5) | 0;\n        let prevLine = 0;\n        let prevChar = 0;\n        const result = [];\n        for (let i = 0; i < tokenCount; i++) {\n            const dstOffset = 5 * i;\n            let line = data[dstOffset];\n            let char = data[dstOffset + 1];\n            if (line === 0) {\n                // on the same line as previous token\n                line = prevLine;\n                char += prevChar;\n            }\n            else {\n                // on a different line than previous token\n                line += prevLine;\n            }\n            const length = data[dstOffset + 2];\n            const tokenType = data[dstOffset + 3];\n            const tokenModifiers = data[dstOffset + 4];\n            result[dstOffset + 0] = line;\n            result[dstOffset + 1] = char;\n            result[dstOffset + 2] = length;\n            result[dstOffset + 3] = tokenType;\n            result[dstOffset + 4] = tokenModifiers;\n            prevLine = line;\n            prevChar = char;\n        }\n        return result;\n    }\n    static _sortAndDeltaEncode(data) {\n        const pos = [];\n        const tokenCount = (data.length / 5) | 0;\n        for (let i = 0; i < tokenCount; i++) {\n            pos[i] = i;\n        }\n        pos.sort((a, b) => {\n            const aLine = data[5 * a];\n            const bLine = data[5 * b];\n            if (aLine === bLine) {\n                const aChar = data[5 * a + 1];\n                const bChar = data[5 * b + 1];\n                return aChar - bChar;\n            }\n            return aLine - bLine;\n        });\n        const result = [];\n        let prevLine = 0;\n        let prevChar = 0;\n        for (let i = 0; i < tokenCount; i++) {\n            const srcOffset = 5 * pos[i];\n            const line = data[srcOffset + 0];\n            const char = data[srcOffset + 1];\n            const length = data[srcOffset + 2];\n            const tokenType = data[srcOffset + 3];\n            const tokenModifiers = data[srcOffset + 4];\n            const pushLine = line - prevLine;\n            const pushChar = (pushLine === 0 ? char - prevChar : char);\n            const dstOffset = 5 * i;\n            result[dstOffset + 0] = pushLine;\n            result[dstOffset + 1] = pushChar;\n            result[dstOffset + 2] = length;\n            result[dstOffset + 3] = tokenType;\n            result[dstOffset + 4] = tokenModifiers;\n            prevLine = line;\n            prevChar = char;\n        }\n        return result;\n    }\n    getFinalDataDelta() {\n        if (this._dataIsSortedAndDeltaEncoded) {\n            return this._data;\n        }\n        else {\n            return SemanticTokensBuilder._sortAndDeltaEncode(this._dataNonDelta);\n        }\n    }\n    previousResult(id) {\n        if (this.id === id) {\n            this._prevData = this.getFinalDataDelta();\n        }\n        this.initialize();\n    }\n    build() {\n        this._prevData = undefined;\n        return {\n            resultId: this.id,\n            data: this.getFinalDataDelta()\n        };\n    }\n    canBuildEdits() {\n        return this._prevData !== undefined;\n    }\n    buildEdits() {\n        if (this._prevData !== undefined) {\n            return {\n                resultId: this.id,\n                edits: (new SemanticTokensDiff(this._prevData, this.getFinalDataDelta())).computeDiff()\n            };\n        }\n        else {\n            return this.build();\n        }\n    }\n}\nexports.SemanticTokensBuilder = SemanticTokensBuilder;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InlineCompletionFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst InlineCompletionFeature = (Base) => {\n    return class extends Base {\n        get inlineCompletion() {\n            return {\n                on: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.InlineCompletionRequest.type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params));\n                    });\n                }\n            };\n        }\n    };\n};\nexports.InlineCompletionFeature = InlineCompletionFeature;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TextDocumentContentFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst TextDocumentContentFeature = (Base) => {\n    return class extends Base {\n        get textDocumentContent() {\n            return {\n                refresh: (uri) => {\n                    return this.connection.sendRequest(vscode_languageserver_protocol_1.TextDocumentContentRefreshRequest.type, { uri });\n                },\n                on: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.TextDocumentContentRequest.type, (params, cancel) => {\n                        return handler(params, cancel);\n                    });\n                }\n            };\n        }\n    };\n};\nexports.TextDocumentContentFeature = TextDocumentContentFeature;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TextDocuments = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\n/**\n * A manager for simple text documents. The manager requires at a minimum that\n * the server registered for the following text document sync events in the\n * initialize handler or via dynamic registration:\n *\n * - open and close events.\n * - change events.\n *\n * Registering for save and will save events is optional.\n */\nclass TextDocuments {\n    _configuration;\n    _syncedDocuments;\n    _onDidChangeContent;\n    _onDidOpen;\n    _onDidClose;\n    _onDidSave;\n    _onWillSave;\n    _willSaveWaitUntil;\n    /**\n     * Create a new text document manager.\n     */\n    constructor(configuration) {\n        this._configuration = configuration;\n        this._syncedDocuments = new Map();\n        this._onDidChangeContent = new vscode_languageserver_protocol_1.Emitter();\n        this._onDidOpen = new vscode_languageserver_protocol_1.Emitter();\n        this._onDidClose = new vscode_languageserver_protocol_1.Emitter();\n        this._onDidSave = new vscode_languageserver_protocol_1.Emitter();\n        this._onWillSave = new vscode_languageserver_protocol_1.Emitter();\n    }\n    /**\n     * An event that fires when a text document managed by this manager\n     * has been opened.\n     */\n    get onDidOpen() {\n        return this._onDidOpen.event;\n    }\n    /**\n     * An event that fires when a text document managed by this manager\n     * has been opened or the content changes.\n     */\n    get onDidChangeContent() {\n        return this._onDidChangeContent.event;\n    }\n    /**\n     * An event that fires when a text document managed by this manager\n     * will be saved.\n     */\n    get onWillSave() {\n        return this._onWillSave.event;\n    }\n    /**\n     * Sets a handler that will be called if a participant wants to provide\n     * edits during a text document save.\n     */\n    onWillSaveWaitUntil(handler) {\n        this._willSaveWaitUntil = handler;\n    }\n    /**\n     * An event that fires when a text document managed by this manager\n     * has been saved.\n     */\n    get onDidSave() {\n        return this._onDidSave.event;\n    }\n    /**\n     * An event that fires when a text document managed by this manager\n     * has been closed.\n     */\n    get onDidClose() {\n        return this._onDidClose.event;\n    }\n    /**\n     * Returns the document for the given URI. Returns undefined if\n     * the document is not managed by this instance.\n     *\n     * @param uri The text document's URI to retrieve.\n     * @return the text document or `undefined`.\n     */\n    get(uri) {\n        return this._syncedDocuments.get(uri);\n    }\n    /**\n     * Returns all text documents managed by this instance.\n     *\n     * @return all text documents.\n     */\n    all() {\n        return Array.from(this._syncedDocuments.values());\n    }\n    /**\n     * Returns the URIs of all text documents managed by this instance.\n     *\n     * @return the URI's of all text documents.\n     */\n    keys() {\n        return Array.from(this._syncedDocuments.keys());\n    }\n    /**\n     * Listens for `low level` notification on the given connection to\n     * update the text documents managed by this instance.\n     *\n     * Please note that the connection only provides handlers not an event model. Therefore\n     * listening on a connection will overwrite the following handlers on a connection:\n     * `onDidOpenTextDocument`, `onDidChangeTextDocument`, `onDidCloseTextDocument`,\n     * `onWillSaveTextDocument`, `onWillSaveTextDocumentWaitUntil` and `onDidSaveTextDocument`.\n     *\n     * Use the corresponding events on the TextDocuments instance instead.\n     *\n     * @param connection The connection to listen on.\n     */\n    listen(connection) {\n        connection.__textDocumentSync = vscode_languageserver_protocol_1.TextDocumentSyncKind.Incremental;\n        const disposables = [];\n        disposables.push(connection.onDidOpenTextDocument((event) => {\n            const td = event.textDocument;\n            const document = this._configuration.create(td.uri, td.languageId, td.version, td.text);\n            this._syncedDocuments.set(td.uri, document);\n            const toFire = Object.freeze({ document });\n            this._onDidOpen.fire(toFire);\n            this._onDidChangeContent.fire(toFire);\n        }));\n        disposables.push(connection.onDidChangeTextDocument((event) => {\n            const td = event.textDocument;\n            const changes = event.contentChanges;\n            if (changes.length === 0) {\n                return;\n            }\n            const { version } = td;\n            if (version === null || version === undefined) {\n                throw new Error(`Received document change event for ${td.uri} without valid version identifier`);\n            }\n            let syncedDocument = this._syncedDocuments.get(td.uri);\n            if (syncedDocument !== undefined) {\n                syncedDocument = this._configuration.update(syncedDocument, changes, version);\n                this._syncedDocuments.set(td.uri, syncedDocument);\n                this._onDidChangeContent.fire(Object.freeze({ document: syncedDocument }));\n            }\n        }));\n        disposables.push(connection.onDidCloseTextDocument((event) => {\n            const syncedDocument = this._syncedDocuments.get(event.textDocument.uri);\n            if (syncedDocument !== undefined) {\n                this._syncedDocuments.delete(event.textDocument.uri);\n                this._onDidClose.fire(Object.freeze({ document: syncedDocument }));\n            }\n        }));\n        disposables.push(connection.onWillSaveTextDocument((event) => {\n            const syncedDocument = this._syncedDocuments.get(event.textDocument.uri);\n            if (syncedDocument !== undefined) {\n                this._onWillSave.fire(Object.freeze({ document: syncedDocument, reason: event.reason }));\n            }\n        }));\n        disposables.push(connection.onWillSaveTextDocumentWaitUntil((event, token) => {\n            const syncedDocument = this._syncedDocuments.get(event.textDocument.uri);\n            if (syncedDocument !== undefined && this._willSaveWaitUntil) {\n                return this._willSaveWaitUntil(Object.freeze({ document: syncedDocument, reason: event.reason }), token);\n            }\n            else {\n                return [];\n            }\n        }));\n        disposables.push(connection.onDidSaveTextDocument((event) => {\n            const syncedDocument = this._syncedDocuments.get(event.textDocument.uri);\n            if (syncedDocument !== undefined) {\n                this._onDidSave.fire(Object.freeze({ document: syncedDocument }));\n            }\n        }));\n        return vscode_languageserver_protocol_1.Disposable.create(() => { disposables.forEach(disposable => disposable.dispose()); });\n    }\n}\nexports.TextDocuments = TextDocuments;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.NotebookDocuments = exports.NotebookSyncFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst textDocuments_1 = require(\"./textDocuments\");\nconst NotebookSyncFeature = (Base) => {\n    return class extends Base {\n        get synchronization() {\n            return {\n                onDidOpenNotebookDocument: (handler) => {\n                    return this.connection.onNotification(vscode_languageserver_protocol_1.DidOpenNotebookDocumentNotification.type, (params) => {\n                        return handler(params);\n                    });\n                },\n                onDidChangeNotebookDocument: (handler) => {\n                    return this.connection.onNotification(vscode_languageserver_protocol_1.DidChangeNotebookDocumentNotification.type, (params) => {\n                        return handler(params);\n                    });\n                },\n                onDidSaveNotebookDocument: (handler) => {\n                    return this.connection.onNotification(vscode_languageserver_protocol_1.DidSaveNotebookDocumentNotification.type, (params) => {\n                        return handler(params);\n                    });\n                },\n                onDidCloseNotebookDocument: (handler) => {\n                    return this.connection.onNotification(vscode_languageserver_protocol_1.DidCloseNotebookDocumentNotification.type, (params) => {\n                        return handler(params);\n                    });\n                }\n            };\n        }\n    };\n};\nexports.NotebookSyncFeature = NotebookSyncFeature;\nclass CellTextDocumentConnection {\n    static NULL_DISPOSE = Object.freeze({ dispose: () => { } });\n    openHandler;\n    changeHandler;\n    closeHandler;\n    onDidOpenTextDocument(handler) {\n        this.openHandler = handler;\n        return vscode_languageserver_protocol_1.Disposable.create(() => { this.openHandler = undefined; });\n    }\n    openTextDocument(params) {\n        return this.openHandler && this.openHandler(params);\n    }\n    onDidChangeTextDocument(handler) {\n        this.changeHandler = handler;\n        return vscode_languageserver_protocol_1.Disposable.create(() => { this.changeHandler = handler; });\n    }\n    changeTextDocument(params) {\n        return this.changeHandler && this.changeHandler(params);\n    }\n    onDidCloseTextDocument(handler) {\n        this.closeHandler = handler;\n        return vscode_languageserver_protocol_1.Disposable.create(() => { this.closeHandler = undefined; });\n    }\n    closeTextDocument(params) {\n        return this.closeHandler && this.closeHandler(params);\n    }\n    onWillSaveTextDocument() {\n        return CellTextDocumentConnection.NULL_DISPOSE;\n    }\n    onWillSaveTextDocumentWaitUntil() {\n        return CellTextDocumentConnection.NULL_DISPOSE;\n    }\n    onDidSaveTextDocument() {\n        return CellTextDocumentConnection.NULL_DISPOSE;\n    }\n}\nclass NotebookDocuments {\n    notebookDocuments;\n    notebookCellMap;\n    _onDidOpen;\n    _onDidSave;\n    _onDidChange;\n    _onDidClose;\n    _cellTextDocuments;\n    constructor(configurationOrTextDocuments) {\n        if (configurationOrTextDocuments instanceof textDocuments_1.TextDocuments) {\n            this._cellTextDocuments = configurationOrTextDocuments;\n        }\n        else {\n            this._cellTextDocuments = new textDocuments_1.TextDocuments(configurationOrTextDocuments);\n        }\n        this.notebookDocuments = new Map();\n        this.notebookCellMap = new Map();\n        this._onDidOpen = new vscode_languageserver_protocol_1.Emitter();\n        this._onDidChange = new vscode_languageserver_protocol_1.Emitter();\n        this._onDidSave = new vscode_languageserver_protocol_1.Emitter();\n        this._onDidClose = new vscode_languageserver_protocol_1.Emitter();\n    }\n    get cellTextDocuments() {\n        return this._cellTextDocuments;\n    }\n    getCellTextDocument(cell) {\n        return this._cellTextDocuments.get(cell.document);\n    }\n    getNotebookDocument(uri) {\n        return this.notebookDocuments.get(uri);\n    }\n    getNotebookCell(uri) {\n        const value = this.notebookCellMap.get(uri);\n        return value && value[0];\n    }\n    findNotebookDocumentForCell(cell) {\n        const key = typeof cell === 'string' ? cell : cell.document;\n        const value = this.notebookCellMap.get(key);\n        return value && value[1];\n    }\n    get onDidOpen() {\n        return this._onDidOpen.event;\n    }\n    get onDidSave() {\n        return this._onDidSave.event;\n    }\n    get onDidChange() {\n        return this._onDidChange.event;\n    }\n    get onDidClose() {\n        return this._onDidClose.event;\n    }\n    /**\n     * Listens for `low level` notification on the given connection to\n     * update the notebook documents managed by this instance.\n     *\n     * Please note that the connection only provides handlers not an event model. Therefore\n     * listening on a connection will overwrite the following handlers on a connection:\n     * `onDidOpenNotebookDocument`, `onDidChangeNotebookDocument`, `onDidSaveNotebookDocument`,\n     *  and `onDidCloseNotebookDocument`.\n     *\n     * @param connection The connection to listen on.\n     */\n    listen(connection) {\n        const cellTextDocumentConnection = new CellTextDocumentConnection();\n        const disposables = [];\n        disposables.push(this.cellTextDocuments.listen(cellTextDocumentConnection));\n        disposables.push(connection.notebooks.synchronization.onDidOpenNotebookDocument(async (params) => {\n            this.notebookDocuments.set(params.notebookDocument.uri, params.notebookDocument);\n            for (const cellTextDocument of params.cellTextDocuments) {\n                await cellTextDocumentConnection.openTextDocument({ textDocument: cellTextDocument });\n            }\n            this.updateCellMap(params.notebookDocument);\n            this._onDidOpen.fire(params.notebookDocument);\n        }));\n        disposables.push(connection.notebooks.synchronization.onDidChangeNotebookDocument(async (params) => {\n            const notebookDocument = this.notebookDocuments.get(params.notebookDocument.uri);\n            if (notebookDocument === undefined) {\n                return;\n            }\n            notebookDocument.version = params.notebookDocument.version;\n            const oldMetadata = notebookDocument.metadata;\n            let metadataChanged = false;\n            const change = params.change;\n            if (change.metadata !== undefined) {\n                metadataChanged = true;\n                notebookDocument.metadata = change.metadata;\n            }\n            const opened = [];\n            const closed = [];\n            const data = [];\n            const text = [];\n            if (change.cells !== undefined) {\n                const changedCells = change.cells;\n                if (changedCells.structure !== undefined) {\n                    const array = changedCells.structure.array;\n                    notebookDocument.cells.splice(array.start, array.deleteCount, ...(array.cells !== undefined ? array.cells : []));\n                    // Additional open cell text documents.\n                    if (changedCells.structure.didOpen !== undefined) {\n                        for (const open of changedCells.structure.didOpen) {\n                            await cellTextDocumentConnection.openTextDocument({ textDocument: open });\n                            opened.push(open.uri);\n                        }\n                    }\n                    // Additional closed cell test documents.\n                    if (changedCells.structure.didClose) {\n                        for (const close of changedCells.structure.didClose) {\n                            await cellTextDocumentConnection.closeTextDocument({ textDocument: close });\n                            closed.push(close.uri);\n                        }\n                    }\n                }\n                if (changedCells.data !== undefined) {\n                    const cellUpdates = new Map(changedCells.data.map(cell => [cell.document, cell]));\n                    for (let i = 0; i <= notebookDocument.cells.length; i++) {\n                        const change = cellUpdates.get(notebookDocument.cells[i].document);\n                        if (change !== undefined) {\n                            const old = notebookDocument.cells.splice(i, 1, change);\n                            data.push({ old: old[0], new: change });\n                            cellUpdates.delete(change.document);\n                            if (cellUpdates.size === 0) {\n                                break;\n                            }\n                        }\n                    }\n                }\n                if (changedCells.textContent !== undefined) {\n                    for (const cellTextDocument of changedCells.textContent) {\n                        await cellTextDocumentConnection.changeTextDocument({ textDocument: cellTextDocument.document, contentChanges: cellTextDocument.changes });\n                        text.push(cellTextDocument.document.uri);\n                    }\n                }\n            }\n            // Update internal data structure.\n            this.updateCellMap(notebookDocument);\n            const changeEvent = { notebookDocument };\n            if (metadataChanged) {\n                changeEvent.metadata = { old: oldMetadata, new: notebookDocument.metadata };\n            }\n            const added = [];\n            for (const open of opened) {\n                added.push(this.getNotebookCell(open));\n            }\n            const removed = [];\n            for (const close of closed) {\n                removed.push(this.getNotebookCell(close));\n            }\n            const textContent = [];\n            for (const change of text) {\n                textContent.push(this.getNotebookCell(change));\n            }\n            if (added.length > 0 || removed.length > 0 || data.length > 0 || textContent.length > 0) {\n                changeEvent.cells = { added, removed, changed: { data, textContent } };\n            }\n            if (changeEvent.metadata !== undefined || changeEvent.cells !== undefined) {\n                this._onDidChange.fire(changeEvent);\n            }\n        }));\n        disposables.push(connection.notebooks.synchronization.onDidSaveNotebookDocument((params) => {\n            const notebookDocument = this.notebookDocuments.get(params.notebookDocument.uri);\n            if (notebookDocument === undefined) {\n                return;\n            }\n            this._onDidSave.fire(notebookDocument);\n        }));\n        disposables.push(connection.notebooks.synchronization.onDidCloseNotebookDocument(async (params) => {\n            const notebookDocument = this.notebookDocuments.get(params.notebookDocument.uri);\n            if (notebookDocument === undefined) {\n                return;\n            }\n            this._onDidClose.fire(notebookDocument);\n            for (const cellTextDocument of params.cellTextDocuments) {\n                await cellTextDocumentConnection.closeTextDocument({ textDocument: cellTextDocument });\n            }\n            this.notebookDocuments.delete(params.notebookDocument.uri);\n            for (const cell of notebookDocument.cells) {\n                this.notebookCellMap.delete(cell.document);\n            }\n        }));\n        return vscode_languageserver_protocol_1.Disposable.create(() => { disposables.forEach(disposable => disposable.dispose()); });\n    }\n    updateCellMap(notebookDocument) {\n        for (const cell of notebookDocument.cells) {\n            this.notebookCellMap.set(cell.document, [cell, notebookDocument]);\n        }\n    }\n}\nexports.NotebookDocuments = NotebookDocuments;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.boolean = boolean;\nexports.string = string;\nexports.number = number;\nexports.error = error;\nexports.func = func;\nexports.array = array;\nexports.stringArray = stringArray;\nexports.typedArray = typedArray;\nexports.thenable = thenable;\nfunction boolean(value) {\n    return value === true || value === false;\n}\nfunction string(value) {\n    return typeof value === 'string' || value instanceof String;\n}\nfunction number(value) {\n    return typeof value === 'number' || value instanceof Number;\n}\nfunction error(value) {\n    return value instanceof Error;\n}\nfunction func(value) {\n    return typeof value === 'function';\n}\nfunction array(value) {\n    return Array.isArray(value);\n}\nfunction stringArray(value) {\n    return array(value) && value.every(elem => string(elem));\n}\nfunction typedArray(value, check) {\n    return Array.isArray(value) && value.every(check);\n}\nfunction thenable(value) {\n    return value && func(value.then);\n}\n", "\"use strict\";\n/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.empty = void 0;\nexports.v4 = v4;\nexports.isUUID = isUUID;\nexports.parse = parse;\nexports.generateUuid = generateUuid;\nclass ValueUUID {\n    _value;\n    constructor(_value) {\n        this._value = _value;\n        // empty\n    }\n    asHex() {\n        return this._value;\n    }\n    equals(other) {\n        return this.asHex() === other.asHex();\n    }\n}\nclass V4UUID extends ValueUUID {\n    static _chars = ['0', '1', '2', '3', '4', '5', '6', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'];\n    static _timeHighBits = ['8', '9', 'a', 'b'];\n    static _oneOf(array) {\n        return array[Math.floor(array.length * Math.random())];\n    }\n    static _randomHex() {\n        return V4UUID._oneOf(V4UUID._chars);\n    }\n    constructor() {\n        super([\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            '-',\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            '-',\n            '4',\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            '-',\n            V4UUID._oneOf(V4UUID._timeHighBits),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            '-',\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n            V4UUID._randomHex(),\n        ].join(''));\n    }\n}\n/**\n * An empty UUID that contains only zeros.\n */\nexports.empty = new ValueUUID('00000000-0000-0000-0000-000000000000');\nfunction v4() {\n    return new V4UUID();\n}\nconst _UUIDPattern = /^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$/i;\nfunction isUUID(value) {\n    return _UUIDPattern.test(value);\n}\n/**\n * Parses a UUID that is of the format xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx.\n * @param value A uuid string.\n */\nfunction parse(value) {\n    if (!isUUID(value)) {\n        throw new Error('invalid uuid');\n    }\n    return new ValueUUID(value);\n}\nfunction generateUuid() {\n    return v4().asHex();\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ProgressFeature = void 0;\nexports.attachWorkDone = attachWorkDone;\nexports.attachPartialResult = attachPartialResult;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst uuid_1 = require(\"./utils/uuid\");\nclass WorkDoneProgressReporterImpl {\n    _connection;\n    _token;\n    static Instances = new Map();\n    constructor(_connection, _token) {\n        this._connection = _connection;\n        this._token = _token;\n        WorkDoneProgressReporterImpl.Instances.set(this._token, this);\n    }\n    begin(title, percentage, message, cancellable) {\n        const param = {\n            kind: 'begin',\n            title,\n            message,\n            cancellable\n        };\n        if (typeof percentage === 'number') {\n            // Round to the nearest integer, because the percentage\n            // is a uinteger according to the specification\n            param.percentage = Math.round(percentage);\n        }\n        this._connection.sendProgress(vscode_languageserver_protocol_1.WorkDoneProgress.type, this._token, param);\n    }\n    report(arg0, arg1) {\n        const param = {\n            kind: 'report'\n        };\n        if (typeof arg0 === 'number') {\n            // Round to the nearest integer, because the percentage\n            // is a uinteger according to the specification\n            param.percentage = Math.round(arg0);\n            if (arg1 !== undefined) {\n                param.message = arg1;\n            }\n        }\n        else {\n            param.message = arg0;\n        }\n        this._connection.sendProgress(vscode_languageserver_protocol_1.WorkDoneProgress.type, this._token, param);\n    }\n    done() {\n        WorkDoneProgressReporterImpl.Instances.delete(this._token);\n        this._connection.sendProgress(vscode_languageserver_protocol_1.WorkDoneProgress.type, this._token, { kind: 'end' });\n    }\n}\nclass WorkDoneProgressServerReporterImpl extends WorkDoneProgressReporterImpl {\n    _source;\n    constructor(connection, token) {\n        super(connection, token);\n        this._source = new vscode_languageserver_protocol_1.CancellationTokenSource();\n    }\n    get token() {\n        return this._source.token;\n    }\n    done() {\n        this._source.dispose();\n        super.done();\n    }\n    cancel() {\n        this._source.cancel();\n    }\n}\nclass NullProgressReporter {\n    constructor() {\n    }\n    begin() {\n    }\n    report() {\n    }\n    done() {\n    }\n}\nclass NullProgressServerReporter extends NullProgressReporter {\n    _source;\n    constructor() {\n        super();\n        this._source = new vscode_languageserver_protocol_1.CancellationTokenSource();\n    }\n    get token() {\n        return this._source.token;\n    }\n    done() {\n        this._source.dispose();\n    }\n    cancel() {\n        this._source.cancel();\n    }\n}\nfunction attachWorkDone(connection, params) {\n    if (params === undefined || params.workDoneToken === undefined) {\n        return new NullProgressReporter();\n    }\n    const token = params.workDoneToken;\n    delete params.workDoneToken;\n    return new WorkDoneProgressReporterImpl(connection, token);\n}\nconst ProgressFeature = (Base) => {\n    return class extends Base {\n        _progressSupported;\n        constructor() {\n            super();\n            this._progressSupported = false;\n        }\n        initialize(capabilities) {\n            super.initialize(capabilities);\n            if (capabilities?.window?.workDoneProgress === true) {\n                this._progressSupported = true;\n                this.connection.onNotification(vscode_languageserver_protocol_1.WorkDoneProgressCancelNotification.type, (params) => {\n                    const progress = WorkDoneProgressReporterImpl.Instances.get(params.token);\n                    if (progress instanceof WorkDoneProgressServerReporterImpl || progress instanceof NullProgressServerReporter) {\n                        progress.cancel();\n                    }\n                });\n            }\n        }\n        attachWorkDoneProgress(token) {\n            if (token === undefined) {\n                return new NullProgressReporter();\n            }\n            else {\n                return new WorkDoneProgressReporterImpl(this.connection, token);\n            }\n        }\n        createWorkDoneProgress() {\n            if (this._progressSupported) {\n                const token = (0, uuid_1.generateUuid)();\n                return this.connection.sendRequest(vscode_languageserver_protocol_1.WorkDoneProgressCreateRequest.type, { token }).then(() => {\n                    const result = new WorkDoneProgressServerReporterImpl(this.connection, token);\n                    return result;\n                });\n            }\n            else {\n                return Promise.resolve(new NullProgressServerReporter());\n            }\n        }\n    };\n};\nexports.ProgressFeature = ProgressFeature;\nvar ResultProgress;\n(function (ResultProgress) {\n    ResultProgress.type = new vscode_languageserver_protocol_1.ProgressType();\n})(ResultProgress || (ResultProgress = {}));\nclass ResultProgressReporterImpl {\n    _connection;\n    _token;\n    constructor(_connection, _token) {\n        this._connection = _connection;\n        this._token = _token;\n    }\n    report(data) {\n        this._connection.sendProgress(ResultProgress.type, this._token, data);\n    }\n}\nfunction attachPartialResult(connection, params) {\n    if (params === undefined || params.partialResultToken === undefined) {\n        return undefined;\n    }\n    const token = params.partialResultToken;\n    delete params.partialResultToken;\n    return new ResultProgressReporterImpl(connection, token);\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ConfigurationFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst Is = __importStar(require(\"./utils/is\"));\nconst ConfigurationFeature = (Base) => {\n    return class extends Base {\n        getConfiguration(arg) {\n            if (!arg) {\n                return this._getConfiguration({});\n            }\n            else if (Is.string(arg)) {\n                return this._getConfiguration({ section: arg });\n            }\n            else {\n                return this._getConfiguration(arg);\n            }\n        }\n        _getConfiguration(arg) {\n            const params = {\n                items: Array.isArray(arg) ? arg : [arg]\n            };\n            return this.connection.sendRequest(vscode_languageserver_protocol_1.ConfigurationRequest.type, params).then((result) => {\n                if (Array.isArray(result)) {\n                    return Array.isArray(arg) ? result : result[0];\n                }\n                else {\n                    return Array.isArray(arg) ? [] : null;\n                }\n            });\n        }\n    };\n};\nexports.ConfigurationFeature = ConfigurationFeature;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WorkspaceFoldersFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst WorkspaceFoldersFeature = (Base) => {\n    return class extends Base {\n        _onDidChangeWorkspaceFolders;\n        _unregistration;\n        _notificationIsAutoRegistered;\n        constructor() {\n            super();\n            this._notificationIsAutoRegistered = false;\n        }\n        initialize(capabilities) {\n            super.initialize(capabilities);\n            const workspaceCapabilities = capabilities.workspace;\n            if (workspaceCapabilities && workspaceCapabilities.workspaceFolders) {\n                this._onDidChangeWorkspaceFolders = new vscode_languageserver_protocol_1.Emitter();\n                this.connection.onNotification(vscode_languageserver_protocol_1.DidChangeWorkspaceFoldersNotification.type, (params) => {\n                    this._onDidChangeWorkspaceFolders.fire(params.event);\n                });\n            }\n        }\n        fillServerCapabilities(capabilities) {\n            super.fillServerCapabilities(capabilities);\n            const changeNotifications = capabilities.workspace?.workspaceFolders?.changeNotifications;\n            this._notificationIsAutoRegistered = changeNotifications === true || typeof changeNotifications === 'string';\n        }\n        getWorkspaceFolders() {\n            return this.connection.sendRequest(vscode_languageserver_protocol_1.WorkspaceFoldersRequest.type);\n        }\n        get onDidChangeWorkspaceFolders() {\n            if (!this._onDidChangeWorkspaceFolders) {\n                throw new Error('Client doesn\\'t support sending workspace folder change events.');\n            }\n            if (!this._notificationIsAutoRegistered && !this._unregistration) {\n                this._unregistration = this.connection.client.register(vscode_languageserver_protocol_1.DidChangeWorkspaceFoldersNotification.type);\n            }\n            return this._onDidChangeWorkspaceFolders.event;\n        }\n    };\n};\nexports.WorkspaceFoldersFeature = WorkspaceFoldersFeature;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.CallHierarchyFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst CallHierarchyFeature = (Base) => {\n    return class extends Base {\n        get callHierarchy() {\n            return {\n                onPrepare: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.CallHierarchyPrepareRequest.type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), undefined);\n                    });\n                },\n                onIncomingCalls: (handler) => {\n                    const type = vscode_languageserver_protocol_1.CallHierarchyIncomingCallsRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                },\n                onOutgoingCalls: (handler) => {\n                    const type = vscode_languageserver_protocol_1.CallHierarchyOutgoingCallsRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                }\n            };\n        }\n    };\n};\nexports.CallHierarchyFeature = CallHierarchyFeature;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ShowDocumentFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst ShowDocumentFeature = (Base) => {\n    return class extends Base {\n        showDocument(params) {\n            return this.connection.sendRequest(vscode_languageserver_protocol_1.ShowDocumentRequest.type, params);\n        }\n    };\n};\nexports.ShowDocumentFeature = ShowDocumentFeature;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FileOperationsFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst FileOperationsFeature = (Base) => {\n    return class extends Base {\n        onDidCreateFiles(handler) {\n            return this.connection.onNotification(vscode_languageserver_protocol_1.DidCreateFilesNotification.type, (params) => {\n                return handler(params);\n            });\n        }\n        onDidRenameFiles(handler) {\n            return this.connection.onNotification(vscode_languageserver_protocol_1.DidRenameFilesNotification.type, (params) => {\n                return handler(params);\n            });\n        }\n        onDidDeleteFiles(handler) {\n            return this.connection.onNotification(vscode_languageserver_protocol_1.DidDeleteFilesNotification.type, (params) => {\n                return handler(params);\n            });\n        }\n        onWillCreateFiles(handler) {\n            return this.connection.onRequest(vscode_languageserver_protocol_1.WillCreateFilesRequest.type, (params, cancel) => {\n                return handler(params, cancel);\n            });\n        }\n        onWillRenameFiles(handler) {\n            return this.connection.onRequest(vscode_languageserver_protocol_1.WillRenameFilesRequest.type, (params, cancel) => {\n                return handler(params, cancel);\n            });\n        }\n        onWillDeleteFiles(handler) {\n            return this.connection.onRequest(vscode_languageserver_protocol_1.WillDeleteFilesRequest.type, (params, cancel) => {\n                return handler(params, cancel);\n            });\n        }\n    };\n};\nexports.FileOperationsFeature = FileOperationsFeature;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.LinkedEditingRangeFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst LinkedEditingRangeFeature = (Base) => {\n    return class extends Base {\n        onLinkedEditingRange(handler) {\n            return this.connection.onRequest(vscode_languageserver_protocol_1.LinkedEditingRangeRequest.type, (params, cancel) => {\n                return handler(params, cancel, this.attachWorkDoneProgress(params), undefined);\n            });\n        }\n    };\n};\nexports.LinkedEditingRangeFeature = LinkedEditingRangeFeature;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TypeHierarchyFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst TypeHierarchyFeature = (Base) => {\n    return class extends Base {\n        get typeHierarchy() {\n            return {\n                onPrepare: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.TypeHierarchyPrepareRequest.type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), undefined);\n                    });\n                },\n                onSupertypes: (handler) => {\n                    const type = vscode_languageserver_protocol_1.TypeHierarchySupertypesRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                },\n                onSubtypes: (handler) => {\n                    const type = vscode_languageserver_protocol_1.TypeHierarchySubtypesRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                }\n            };\n        }\n    };\n};\nexports.TypeHierarchyFeature = TypeHierarchyFeature;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InlineValueFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst InlineValueFeature = (Base) => {\n    return class extends Base {\n        get inlineValue() {\n            return {\n                refresh: () => {\n                    return this.connection.sendRequest(vscode_languageserver_protocol_1.InlineValueRefreshRequest.type);\n                },\n                on: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.InlineValueRequest.type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params));\n                    });\n                }\n            };\n        }\n    };\n};\nexports.InlineValueFeature = InlineValueFeature;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FoldingRangeFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst FoldingRangeFeature = (Base) => {\n    return class extends Base {\n        get foldingRange() {\n            return {\n                refresh: () => {\n                    return this.connection.sendRequest(vscode_languageserver_protocol_1.FoldingRangeRefreshRequest.type);\n                },\n                on: (handler) => {\n                    const type = vscode_languageserver_protocol_1.FoldingRangeRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                }\n            };\n        }\n    };\n};\nexports.FoldingRangeFeature = FoldingRangeFeature;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.InlayHintFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst InlayHintFeature = (Base) => {\n    return class extends Base {\n        get inlayHint() {\n            return {\n                refresh: () => {\n                    return this.connection.sendRequest(vscode_languageserver_protocol_1.InlayHintRefreshRequest.type);\n                },\n                on: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.InlayHintRequest.type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params));\n                    });\n                },\n                resolve: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.InlayHintResolveRequest.type, (params, cancel) => {\n                        return handler(params, cancel);\n                    });\n                }\n            };\n        }\n    };\n};\nexports.InlayHintFeature = InlayHintFeature;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DiagnosticFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst DiagnosticFeature = (Base) => {\n    return class extends Base {\n        get diagnostics() {\n            return {\n                refresh: () => {\n                    return this.connection.sendRequest(vscode_languageserver_protocol_1.DiagnosticRefreshRequest.type);\n                },\n                on: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.DocumentDiagnosticRequest.type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(vscode_languageserver_protocol_1.DocumentDiagnosticRequest.partialResult, params));\n                    });\n                },\n                onWorkspace: (handler) => {\n                    return this.connection.onRequest(vscode_languageserver_protocol_1.WorkspaceDiagnosticRequest.type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(vscode_languageserver_protocol_1.WorkspaceDiagnosticRequest.partialResult, params));\n                    });\n                }\n            };\n        }\n    };\n};\nexports.DiagnosticFeature = DiagnosticFeature;\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'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MonikerFeature = void 0;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst MonikerFeature = (Base) => {\n    return class extends Base {\n        get moniker() {\n            return {\n                on: (handler) => {\n                    const type = vscode_languageserver_protocol_1.MonikerRequest.type;\n                    return this.connection.onRequest(type, (params, cancel) => {\n                        return handler(params, cancel, this.attachWorkDoneProgress(params), this.attachPartialResultProgress(type, params));\n                    });\n                },\n            };\n        }\n    };\n};\nexports.MonikerFeature = MonikerFeature;\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\n/// <reference path=\"../../typings/thenable.d.ts\" preserve: true/>\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports._NotebooksImpl = exports._LanguagesImpl = exports.BulkUnregistration = exports.BulkRegistration = exports.ErrorMessageTracker = void 0;\nexports.combineConsoleFeatures = combineConsoleFeatures;\nexports.combineTelemetryFeatures = combineTelemetryFeatures;\nexports.combineTracerFeatures = combineTracerFeatures;\nexports.combineClientFeatures = combineClientFeatures;\nexports.combineWindowFeatures = combineWindowFeatures;\nexports.combineWorkspaceFeatures = combineWorkspaceFeatures;\nexports.combineLanguagesFeatures = combineLanguagesFeatures;\nexports.combineNotebooksFeatures = combineNotebooksFeatures;\nexports.combineFeatures = combineFeatures;\nexports.createConnection = createConnection;\nconst vscode_languageserver_protocol_1 = require(\"vscode-languageserver-protocol\");\nconst Is = __importStar(require(\"./utils/is\"));\nconst UUID = __importStar(require(\"./utils/uuid\"));\nconst progress_1 = require(\"./progress\");\nconst configuration_1 = require(\"./configuration\");\nconst workspaceFolder_1 = require(\"./workspaceFolder\");\nconst callHierarchy_1 = require(\"./callHierarchy\");\nconst semanticTokens_1 = require(\"./semanticTokens\");\nconst showDocument_1 = require(\"./showDocument\");\nconst fileOperations_1 = require(\"./fileOperations\");\nconst linkedEditingRange_1 = require(\"./linkedEditingRange\");\nconst typeHierarchy_1 = require(\"./typeHierarchy\");\nconst inlineValue_1 = require(\"./inlineValue\");\nconst foldingRange_1 = require(\"./foldingRange\");\n// import { InlineCompletionFeatureShape, InlineCompletionFeature } from './inlineCompletion.proposed';\nconst inlayHint_1 = require(\"./inlayHint\");\nconst diagnostic_1 = require(\"./diagnostic\");\nconst notebook_1 = require(\"./notebook\");\nconst moniker_1 = require(\"./moniker\");\nfunction null2Undefined(value) {\n    if (value === null) {\n        return undefined;\n    }\n    return value;\n}\n/**\n * Helps tracking error message. Equal occurrences of the same\n * message are only stored once. This class is for example\n * useful if text documents are validated in a loop and equal\n * error message should be folded into one.\n */\nclass ErrorMessageTracker {\n    _messages;\n    constructor() {\n        this._messages = Object.create(null);\n    }\n    /**\n     * Add a message to the tracker.\n     *\n     * @param message The message to add.\n     */\n    add(message) {\n        let count = this._messages[message];\n        if (!count) {\n            count = 0;\n        }\n        count++;\n        this._messages[message] = count;\n    }\n    /**\n     * Send all tracked messages to the connection's window.\n     *\n     * @param connection The connection established between client and server.\n     */\n    sendErrors(connection) {\n        Object.keys(this._messages).forEach(message => {\n            connection.window.showErrorMessage(message);\n        });\n    }\n}\nexports.ErrorMessageTracker = ErrorMessageTracker;\nclass RemoteConsoleImpl {\n    _rawConnection;\n    _connection;\n    constructor() {\n    }\n    rawAttach(connection) {\n        this._rawConnection = connection;\n    }\n    attach(connection) {\n        this._connection = connection;\n    }\n    get connection() {\n        if (!this._connection) {\n            throw new Error('Remote is not attached to a connection yet.');\n        }\n        return this._connection;\n    }\n    fillServerCapabilities(_capabilities) {\n    }\n    initialize(_capabilities) {\n    }\n    error(message) {\n        this.send(vscode_languageserver_protocol_1.MessageType.Error, message);\n    }\n    warn(message) {\n        this.send(vscode_languageserver_protocol_1.MessageType.Warning, message);\n    }\n    info(message) {\n        this.send(vscode_languageserver_protocol_1.MessageType.Info, message);\n    }\n    log(message) {\n        this.send(vscode_languageserver_protocol_1.MessageType.Log, message);\n    }\n    debug(message) {\n        this.send(vscode_languageserver_protocol_1.MessageType.Debug, message);\n    }\n    send(type, message) {\n        if (this._rawConnection) {\n            this._rawConnection.sendNotification(vscode_languageserver_protocol_1.LogMessageNotification.type, { type, message }).catch(() => {\n                (0, vscode_languageserver_protocol_1.RAL)().console.error(`Sending log message failed`);\n            });\n        }\n    }\n}\nclass _RemoteWindowImpl {\n    _connection;\n    constructor() {\n    }\n    attach(connection) {\n        this._connection = connection;\n    }\n    get connection() {\n        if (!this._connection) {\n            throw new Error('Remote is not attached to a connection yet.');\n        }\n        return this._connection;\n    }\n    initialize(_capabilities) {\n    }\n    fillServerCapabilities(_capabilities) {\n    }\n    showErrorMessage(message, ...actions) {\n        const params = { type: vscode_languageserver_protocol_1.MessageType.Error, message, actions };\n        return this.connection.sendRequest(vscode_languageserver_protocol_1.ShowMessageRequest.type, params).then(null2Undefined);\n    }\n    showWarningMessage(message, ...actions) {\n        const params = { type: vscode_languageserver_protocol_1.MessageType.Warning, message, actions };\n        return this.connection.sendRequest(vscode_languageserver_protocol_1.ShowMessageRequest.type, params).then(null2Undefined);\n    }\n    showInformationMessage(message, ...actions) {\n        const params = { type: vscode_languageserver_protocol_1.MessageType.Info, message, actions };\n        return this.connection.sendRequest(vscode_languageserver_protocol_1.ShowMessageRequest.type, params).then(null2Undefined);\n    }\n}\nconst RemoteWindowImpl = (0, showDocument_1.ShowDocumentFeature)((0, progress_1.ProgressFeature)(_RemoteWindowImpl));\nvar BulkRegistration;\n(function (BulkRegistration) {\n    /**\n     * Creates a new bulk registration.\n     * @return an empty bulk registration.\n     */\n    function create() {\n        return new BulkRegistrationImpl();\n    }\n    BulkRegistration.create = create;\n})(BulkRegistration || (exports.BulkRegistration = BulkRegistration = {}));\nclass BulkRegistrationImpl {\n    _registrations = [];\n    _registered = new Set();\n    add(type, registerOptions) {\n        const method = Is.string(type) ? type : type.method;\n        if (this._registered.has(method)) {\n            throw new Error(`${method} is already added to this registration`);\n        }\n        const id = UUID.generateUuid();\n        this._registrations.push({\n            id: id,\n            method: method,\n            registerOptions: registerOptions || {}\n        });\n        this._registered.add(method);\n    }\n    asRegistrationParams() {\n        return {\n            registrations: this._registrations\n        };\n    }\n}\nvar BulkUnregistration;\n(function (BulkUnregistration) {\n    function create() {\n        return new BulkUnregistrationImpl(undefined, []);\n    }\n    BulkUnregistration.create = create;\n})(BulkUnregistration || (exports.BulkUnregistration = BulkUnregistration = {}));\nclass BulkUnregistrationImpl {\n    _connection;\n    _unregistrations = new Map();\n    constructor(_connection, unregistrations) {\n        this._connection = _connection;\n        unregistrations.forEach(unregistration => {\n            this._unregistrations.set(unregistration.method, unregistration);\n        });\n    }\n    get isAttached() {\n        return !!this._connection;\n    }\n    attach(connection) {\n        this._connection = connection;\n    }\n    add(unregistration) {\n        this._unregistrations.set(unregistration.method, unregistration);\n    }\n    dispose() {\n        const unregistrations = [];\n        for (const unregistration of this._unregistrations.values()) {\n            unregistrations.push(unregistration);\n        }\n        const params = {\n            unregisterations: unregistrations\n        };\n        this._connection.sendRequest(vscode_languageserver_protocol_1.UnregistrationRequest.type, params).catch(() => {\n            this._connection.console.info(`Bulk unregistration failed.`);\n        });\n    }\n    disposeSingle(arg) {\n        const method = Is.string(arg) ? arg : arg.method;\n        const unregistration = this._unregistrations.get(method);\n        if (!unregistration) {\n            return false;\n        }\n        const params = {\n            unregisterations: [unregistration]\n        };\n        this._connection.sendRequest(vscode_languageserver_protocol_1.UnregistrationRequest.type, params).then(() => {\n            this._unregistrations.delete(method);\n        }, (_error) => {\n            this._connection.console.info(`Un-registering request handler for ${unregistration.id} failed.`);\n        });\n        return true;\n    }\n}\nclass RemoteClientImpl {\n    _connection;\n    attach(connection) {\n        this._connection = connection;\n    }\n    get connection() {\n        if (!this._connection) {\n            throw new Error('Remote is not attached to a connection yet.');\n        }\n        return this._connection;\n    }\n    initialize(_capabilities) {\n    }\n    fillServerCapabilities(_capabilities) {\n    }\n    register(typeOrRegistrations, registerOptionsOrType, registerOptions) {\n        if (typeOrRegistrations instanceof BulkRegistrationImpl) {\n            return this.registerMany(typeOrRegistrations);\n        }\n        else if (typeOrRegistrations instanceof BulkUnregistrationImpl) {\n            return this.registerSingle1(typeOrRegistrations, registerOptionsOrType, registerOptions);\n        }\n        else {\n            return this.registerSingle2(typeOrRegistrations, registerOptionsOrType);\n        }\n    }\n    registerSingle1(unregistration, type, registerOptions) {\n        const method = Is.string(type) ? type : type.method;\n        const id = UUID.generateUuid();\n        const params = {\n            registrations: [{ id, method, registerOptions: registerOptions || {} }]\n        };\n        if (!unregistration.isAttached) {\n            unregistration.attach(this.connection);\n        }\n        return this.connection.sendRequest(vscode_languageserver_protocol_1.RegistrationRequest.type, params).then((_result) => {\n            unregistration.add({ id: id, method: method });\n            return unregistration;\n        }, (_error) => {\n            this.connection.console.info(`Registering request handler for ${method} failed.`);\n            return Promise.reject(_error);\n        });\n    }\n    registerSingle2(type, registerOptions) {\n        const method = Is.string(type) ? type : type.method;\n        const id = UUID.generateUuid();\n        const params = {\n            registrations: [{ id, method, registerOptions: registerOptions || {} }]\n        };\n        return this.connection.sendRequest(vscode_languageserver_protocol_1.RegistrationRequest.type, params).then((_result) => {\n            return vscode_languageserver_protocol_1.Disposable.create(() => {\n                this.unregisterSingle(id, method).catch(() => { this.connection.console.info(`Un-registering capability with id ${id} failed.`); });\n            });\n        }, (_error) => {\n            this.connection.console.info(`Registering request handler for ${method} failed.`);\n            return Promise.reject(_error);\n        });\n    }\n    unregisterSingle(id, method) {\n        const params = {\n            unregisterations: [{ id, method }]\n        };\n        return this.connection.sendRequest(vscode_languageserver_protocol_1.UnregistrationRequest.type, params).catch(() => {\n            this.connection.console.info(`Un-registering request handler for ${id} failed.`);\n        });\n    }\n    registerMany(registrations) {\n        const params = registrations.asRegistrationParams();\n        return this.connection.sendRequest(vscode_languageserver_protocol_1.RegistrationRequest.type, params).then(() => {\n            return new BulkUnregistrationImpl(this._connection, params.registrations.map(registration => { return { id: registration.id, method: registration.method }; }));\n        }, (_error) => {\n            this.connection.console.info(`Bulk registration failed.`);\n            return Promise.reject(_error);\n        });\n    }\n}\nclass _RemoteWorkspaceImpl {\n    _connection;\n    constructor() {\n    }\n    attach(connection) {\n        this._connection = connection;\n    }\n    get connection() {\n        if (!this._connection) {\n            throw new Error('Remote is not attached to a connection yet.');\n        }\n        return this._connection;\n    }\n    initialize(_capabilities) {\n    }\n    fillServerCapabilities(_capabilities) {\n    }\n    applyEdit(paramOrEdit) {\n        function isApplyWorkspaceEditParams(value) {\n            return value && !!value.edit;\n        }\n        const params = isApplyWorkspaceEditParams(paramOrEdit) ? paramOrEdit : { edit: paramOrEdit };\n        return this.connection.sendRequest(vscode_languageserver_protocol_1.ApplyWorkspaceEditRequest.type, params);\n    }\n}\nconst RemoteWorkspaceImpl = (0, fileOperations_1.FileOperationsFeature)((0, workspaceFolder_1.WorkspaceFoldersFeature)((0, configuration_1.ConfigurationFeature)(_RemoteWorkspaceImpl)));\nclass TracerImpl {\n    _trace;\n    _connection;\n    constructor() {\n        this._trace = vscode_languageserver_protocol_1.Trace.Off;\n    }\n    attach(connection) {\n        this._connection = connection;\n    }\n    get connection() {\n        if (!this._connection) {\n            throw new Error('Remote is not attached to a connection yet.');\n        }\n        return this._connection;\n    }\n    initialize(_capabilities) {\n    }\n    fillServerCapabilities(_capabilities) {\n    }\n    set trace(value) {\n        this._trace = value;\n    }\n    log(message, verbose) {\n        if (this._trace === vscode_languageserver_protocol_1.Trace.Off) {\n            return;\n        }\n        this.connection.sendNotification(vscode_languageserver_protocol_1.LogTraceNotification.type, {\n            message: message,\n            verbose: this._trace === vscode_languageserver_protocol_1.Trace.Verbose ? verbose : undefined\n        }).catch(() => {\n            // Very hard to decide what to do. We tried to send a log\n            // message which failed so we can't simply send another :-(.\n        });\n    }\n}\nclass TelemetryImpl {\n    _connection;\n    constructor() {\n    }\n    attach(connection) {\n        this._connection = connection;\n    }\n    get connection() {\n        if (!this._connection) {\n            throw new Error('Remote is not attached to a connection yet.');\n        }\n        return this._connection;\n    }\n    initialize(_capabilities) {\n    }\n    fillServerCapabilities(_capabilities) {\n    }\n    logEvent(data) {\n        this.connection.sendNotification(vscode_languageserver_protocol_1.TelemetryEventNotification.type, data).catch(() => {\n            this.connection.console.log(`Sending TelemetryEventNotification failed`);\n        });\n    }\n}\nclass _LanguagesImpl {\n    _connection;\n    constructor() {\n    }\n    attach(connection) {\n        this._connection = connection;\n    }\n    get connection() {\n        if (!this._connection) {\n            throw new Error('Remote is not attached to a connection yet.');\n        }\n        return this._connection;\n    }\n    initialize(_capabilities) {\n    }\n    fillServerCapabilities(_capabilities) {\n    }\n    attachWorkDoneProgress(params) {\n        return (0, progress_1.attachWorkDone)(this.connection, params);\n    }\n    attachPartialResultProgress(_type, params) {\n        return (0, progress_1.attachPartialResult)(this.connection, params);\n    }\n}\nexports._LanguagesImpl = _LanguagesImpl;\nconst LanguagesImpl = (0, foldingRange_1.FoldingRangeFeature)((0, moniker_1.MonikerFeature)((0, diagnostic_1.DiagnosticFeature)((0, inlayHint_1.InlayHintFeature)((0, inlineValue_1.InlineValueFeature)((0, typeHierarchy_1.TypeHierarchyFeature)((0, linkedEditingRange_1.LinkedEditingRangeFeature)((0, semanticTokens_1.SemanticTokensFeature)((0, callHierarchy_1.CallHierarchyFeature)(_LanguagesImpl)))))))));\nclass _NotebooksImpl {\n    _connection;\n    constructor() {\n    }\n    attach(connection) {\n        this._connection = connection;\n    }\n    get connection() {\n        if (!this._connection) {\n            throw new Error('Remote is not attached to a connection yet.');\n        }\n        return this._connection;\n    }\n    initialize(_capabilities) {\n    }\n    fillServerCapabilities(_capabilities) {\n    }\n    attachWorkDoneProgress(params) {\n        return (0, progress_1.attachWorkDone)(this.connection, params);\n    }\n    attachPartialResultProgress(_type, params) {\n        return (0, progress_1.attachPartialResult)(this.connection, params);\n    }\n}\nexports._NotebooksImpl = _NotebooksImpl;\nconst NotebooksImpl = (0, notebook_1.NotebookSyncFeature)(_NotebooksImpl);\nfunction combineConsoleFeatures(one, two) {\n    return function (Base) {\n        return two(one(Base));\n    };\n}\nfunction combineTelemetryFeatures(one, two) {\n    return function (Base) {\n        return two(one(Base));\n    };\n}\nfunction combineTracerFeatures(one, two) {\n    return function (Base) {\n        return two(one(Base));\n    };\n}\nfunction combineClientFeatures(one, two) {\n    return function (Base) {\n        return two(one(Base));\n    };\n}\nfunction combineWindowFeatures(one, two) {\n    return function (Base) {\n        return two(one(Base));\n    };\n}\nfunction combineWorkspaceFeatures(one, two) {\n    return function (Base) {\n        return two(one(Base));\n    };\n}\nfunction combineLanguagesFeatures(one, two) {\n    return function (Base) {\n        return two(one(Base));\n    };\n}\nfunction combineNotebooksFeatures(one, two) {\n    return function (Base) {\n        return two(one(Base));\n    };\n}\nfunction combineFeatures(one, two) {\n    function combine(one, two, func) {\n        if (one && two) {\n            return func(one, two);\n        }\n        else if (one) {\n            return one;\n        }\n        else {\n            return two;\n        }\n    }\n    const result = {\n        __brand: 'features',\n        console: combine(one.console, two.console, combineConsoleFeatures),\n        tracer: combine(one.tracer, two.tracer, combineTracerFeatures),\n        telemetry: combine(one.telemetry, two.telemetry, combineTelemetryFeatures),\n        client: combine(one.client, two.client, combineClientFeatures),\n        window: combine(one.window, two.window, combineWindowFeatures),\n        workspace: combine(one.workspace, two.workspace, combineWorkspaceFeatures),\n        languages: combine(one.languages, two.languages, combineLanguagesFeatures),\n        notebooks: combine(one.notebooks, two.notebooks, combineNotebooksFeatures)\n    };\n    return result;\n}\nfunction createConnection(connectionFactory, watchDog, factories) {\n    const logger = (factories && factories.console ? new (factories.console(RemoteConsoleImpl))() : new RemoteConsoleImpl());\n    const connection = connectionFactory(logger);\n    logger.rawAttach(connection);\n    const tracer = (factories && factories.tracer ? new (factories.tracer(TracerImpl))() : new TracerImpl());\n    const telemetry = (factories && factories.telemetry ? new (factories.telemetry(TelemetryImpl))() : new TelemetryImpl());\n    const client = (factories && factories.client ? new (factories.client(RemoteClientImpl))() : new RemoteClientImpl());\n    const remoteWindow = (factories && factories.window ? new (factories.window(RemoteWindowImpl))() : new RemoteWindowImpl());\n    const workspace = (factories && factories.workspace ? new (factories.workspace(RemoteWorkspaceImpl))() : new RemoteWorkspaceImpl());\n    const languages = (factories && factories.languages ? new (factories.languages(LanguagesImpl))() : new LanguagesImpl());\n    const notebooks = (factories && factories.notebooks ? new (factories.notebooks(NotebooksImpl))() : new NotebooksImpl());\n    const allRemotes = [logger, tracer, telemetry, client, remoteWindow, workspace, languages, notebooks];\n    function asPromise(value) {\n        if (value instanceof Promise) {\n            return value;\n        }\n        else if (Is.thenable(value)) {\n            return new Promise((resolve, reject) => {\n                value.then((resolved) => resolve(resolved), (error) => reject(error));\n            });\n        }\n        else {\n            return Promise.resolve(value);\n        }\n    }\n    let shutdownHandler = undefined;\n    let initializeHandler = undefined;\n    let exitHandler = undefined;\n    const protocolConnection = {\n        listen: () => connection.listen(),\n        sendRequest: (type, ...params) => connection.sendRequest(Is.string(type) ? type : type.method, ...params),\n        onRequest: (type, handler) => connection.onRequest(type, handler),\n        sendNotification: (type, param) => {\n            const method = Is.string(type) ? type : type.method;\n            return connection.sendNotification(method, param);\n        },\n        onNotification: (type, handler) => connection.onNotification(type, handler),\n        onProgress: connection.onProgress,\n        sendProgress: connection.sendProgress,\n        onInitialize: (handler) => {\n            initializeHandler = handler;\n            return {\n                dispose: () => {\n                    initializeHandler = undefined;\n                }\n            };\n        },\n        onInitialized: (handler) => connection.onNotification(vscode_languageserver_protocol_1.InitializedNotification.type, handler),\n        onShutdown: (handler) => {\n            shutdownHandler = handler;\n            return {\n                dispose: () => {\n                    shutdownHandler = undefined;\n                }\n            };\n        },\n        onExit: (handler) => {\n            exitHandler = handler;\n            return {\n                dispose: () => {\n                    exitHandler = undefined;\n                }\n            };\n        },\n        get console() { return logger; },\n        get telemetry() { return telemetry; },\n        get tracer() { return tracer; },\n        get client() { return client; },\n        get window() { return remoteWindow; },\n        get workspace() { return workspace; },\n        get languages() { return languages; },\n        get notebooks() { return notebooks; },\n        onDidChangeConfiguration: (handler) => connection.onNotification(vscode_languageserver_protocol_1.DidChangeConfigurationNotification.type, handler),\n        onDidChangeWatchedFiles: (handler) => connection.onNotification(vscode_languageserver_protocol_1.DidChangeWatchedFilesNotification.type, handler),\n        __textDocumentSync: undefined,\n        onDidOpenTextDocument: (handler) => connection.onNotification(vscode_languageserver_protocol_1.DidOpenTextDocumentNotification.type, handler),\n        onDidChangeTextDocument: (handler) => connection.onNotification(vscode_languageserver_protocol_1.DidChangeTextDocumentNotification.type, handler),\n        onDidCloseTextDocument: (handler) => connection.onNotification(vscode_languageserver_protocol_1.DidCloseTextDocumentNotification.type, handler),\n        onWillSaveTextDocument: (handler) => connection.onNotification(vscode_languageserver_protocol_1.WillSaveTextDocumentNotification.type, handler),\n        onWillSaveTextDocumentWaitUntil: (handler) => connection.onRequest(vscode_languageserver_protocol_1.WillSaveTextDocumentWaitUntilRequest.type, handler),\n        onDidSaveTextDocument: (handler) => connection.onNotification(vscode_languageserver_protocol_1.DidSaveTextDocumentNotification.type, handler),\n        sendDiagnostics: (params) => connection.sendNotification(vscode_languageserver_protocol_1.PublishDiagnosticsNotification.type, params),\n        onHover: (handler) => connection.onRequest(vscode_languageserver_protocol_1.HoverRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), undefined);\n        }),\n        onCompletion: (handler) => connection.onRequest(vscode_languageserver_protocol_1.CompletionRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onCompletionResolve: (handler) => connection.onRequest(vscode_languageserver_protocol_1.CompletionResolveRequest.type, handler),\n        onSignatureHelp: (handler) => connection.onRequest(vscode_languageserver_protocol_1.SignatureHelpRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), undefined);\n        }),\n        onDeclaration: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DeclarationRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onDefinition: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DefinitionRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onTypeDefinition: (handler) => connection.onRequest(vscode_languageserver_protocol_1.TypeDefinitionRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onImplementation: (handler) => connection.onRequest(vscode_languageserver_protocol_1.ImplementationRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onReferences: (handler) => connection.onRequest(vscode_languageserver_protocol_1.ReferencesRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onDocumentHighlight: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DocumentHighlightRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onDocumentSymbol: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DocumentSymbolRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onWorkspaceSymbol: (handler) => connection.onRequest(vscode_languageserver_protocol_1.WorkspaceSymbolRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onWorkspaceSymbolResolve: (handler) => connection.onRequest(vscode_languageserver_protocol_1.WorkspaceSymbolResolveRequest.type, handler),\n        onCodeAction: (handler) => connection.onRequest(vscode_languageserver_protocol_1.CodeActionRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onCodeActionResolve: (handler) => connection.onRequest(vscode_languageserver_protocol_1.CodeActionResolveRequest.type, (params, cancel) => {\n            return handler(params, cancel);\n        }),\n        onCodeLens: (handler) => connection.onRequest(vscode_languageserver_protocol_1.CodeLensRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onCodeLensResolve: (handler) => connection.onRequest(vscode_languageserver_protocol_1.CodeLensResolveRequest.type, (params, cancel) => {\n            return handler(params, cancel);\n        }),\n        onDocumentFormatting: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DocumentFormattingRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), undefined);\n        }),\n        onDocumentRangeFormatting: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DocumentRangeFormattingRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), undefined);\n        }),\n        onDocumentOnTypeFormatting: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DocumentOnTypeFormattingRequest.type, (params, cancel) => {\n            return handler(params, cancel);\n        }),\n        onRenameRequest: (handler) => connection.onRequest(vscode_languageserver_protocol_1.RenameRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), undefined);\n        }),\n        onPrepareRename: (handler) => connection.onRequest(vscode_languageserver_protocol_1.PrepareRenameRequest.type, (params, cancel) => {\n            return handler(params, cancel);\n        }),\n        onDocumentLinks: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DocumentLinkRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onDocumentLinkResolve: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DocumentLinkResolveRequest.type, (params, cancel) => {\n            return handler(params, cancel);\n        }),\n        onDocumentColor: (handler) => connection.onRequest(vscode_languageserver_protocol_1.DocumentColorRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onColorPresentation: (handler) => connection.onRequest(vscode_languageserver_protocol_1.ColorPresentationRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onFoldingRanges: (handler) => connection.onRequest(vscode_languageserver_protocol_1.FoldingRangeRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onSelectionRanges: (handler) => connection.onRequest(vscode_languageserver_protocol_1.SelectionRangeRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), (0, progress_1.attachPartialResult)(connection, params));\n        }),\n        onExecuteCommand: (handler) => connection.onRequest(vscode_languageserver_protocol_1.ExecuteCommandRequest.type, (params, cancel) => {\n            return handler(params, cancel, (0, progress_1.attachWorkDone)(connection, params), undefined);\n        }),\n        dispose: () => connection.dispose()\n    };\n    for (const remote of allRemotes) {\n        remote.attach(protocolConnection);\n    }\n    connection.onRequest(vscode_languageserver_protocol_1.InitializeRequest.type, (params) => {\n        watchDog.initialize(params);\n        if (Is.string(params.trace)) {\n            tracer.trace = vscode_languageserver_protocol_1.Trace.fromString(params.trace);\n        }\n        for (const remote of allRemotes) {\n            remote.initialize(params.capabilities);\n        }\n        if (initializeHandler) {\n            const result = initializeHandler(params, new vscode_languageserver_protocol_1.CancellationTokenSource().token, (0, progress_1.attachWorkDone)(connection, params), undefined);\n            return asPromise(result).then((value) => {\n                if (value instanceof vscode_languageserver_protocol_1.ResponseError) {\n                    return value;\n                }\n                let result = value;\n                if (!result) {\n                    result = { capabilities: {} };\n                }\n                let capabilities = result.capabilities;\n                if (!capabilities) {\n                    capabilities = {};\n                    result.capabilities = capabilities;\n                }\n                if (capabilities.textDocumentSync === undefined || capabilities.textDocumentSync === null) {\n                    capabilities.textDocumentSync = Is.number(protocolConnection.__textDocumentSync) ? protocolConnection.__textDocumentSync : vscode_languageserver_protocol_1.TextDocumentSyncKind.None;\n                }\n                else if (!Is.number(capabilities.textDocumentSync) && !Is.number(capabilities.textDocumentSync.change)) {\n                    capabilities.textDocumentSync.change = Is.number(protocolConnection.__textDocumentSync) ? protocolConnection.__textDocumentSync : vscode_languageserver_protocol_1.TextDocumentSyncKind.None;\n                }\n                for (const remote of allRemotes) {\n                    remote.fillServerCapabilities(capabilities);\n                }\n                return result;\n            });\n        }\n        else {\n            const result = { capabilities: { textDocumentSync: vscode_languageserver_protocol_1.TextDocumentSyncKind.None } };\n            for (const remote of allRemotes) {\n                remote.fillServerCapabilities(result.capabilities);\n            }\n            return result;\n        }\n    });\n    connection.onRequest(vscode_languageserver_protocol_1.ShutdownRequest.type, () => {\n        watchDog.shutdownReceived = true;\n        if (shutdownHandler) {\n            return shutdownHandler(new vscode_languageserver_protocol_1.CancellationTokenSource().token);\n        }\n        else {\n            return undefined;\n        }\n    });\n    connection.onNotification(vscode_languageserver_protocol_1.ExitNotification.type, () => {\n        try {\n            if (exitHandler) {\n                return exitHandler();\n            }\n        }\n        finally {\n            if (watchDog.shutdownReceived) {\n                watchDog.exit(0);\n            }\n            else {\n                watchDog.exit(1);\n            }\n        }\n    });\n    connection.onNotification(vscode_languageserver_protocol_1.SetTraceNotification.type, (params) => {\n        tracer.trace = vscode_languageserver_protocol_1.Trace.fromString(params.value);\n    });\n    return protocolConnection;\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ProposedFeatures = exports.NotebookDocuments = exports.TextDocuments = exports.SemanticTokensBuilder = void 0;\nconst semanticTokens_1 = require(\"./semanticTokens\");\nObject.defineProperty(exports, \"SemanticTokensBuilder\", { enumerable: true, get: function () { return semanticTokens_1.SemanticTokensBuilder; } });\nconst ic = __importStar(require(\"./inlineCompletion.proposed\"));\nconst tdc = __importStar(require(\"./textDocumentContent\"));\n__exportStar(require(\"vscode-languageserver-protocol\"), exports);\nconst textDocuments_1 = require(\"./textDocuments\");\nObject.defineProperty(exports, \"TextDocuments\", { enumerable: true, get: function () { return textDocuments_1.TextDocuments; } });\nconst notebook_1 = require(\"./notebook\");\nObject.defineProperty(exports, \"NotebookDocuments\", { enumerable: true, get: function () { return notebook_1.NotebookDocuments; } });\n__exportStar(require(\"./server\"), exports);\nvar ProposedFeatures;\n(function (ProposedFeatures) {\n    ProposedFeatures.all = {\n        __brand: 'features',\n        workspace: tdc.TextDocumentContentFeature,\n        languages: ic.InlineCompletionFeature\n    };\n})(ProposedFeatures || (exports.ProposedFeatures = ProposedFeatures = {}));\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.FileSystem = void 0;\nexports.uriToFilePath = uriToFilePath;\nexports.resolve = resolve;\nexports.resolveGlobalNodePath = resolveGlobalNodePath;\nexports.resolveGlobalYarnPath = resolveGlobalYarnPath;\nexports.resolveModulePath = resolveModulePath;\nconst url = __importStar(require(\"url\"));\nconst path = __importStar(require(\"path\"));\nconst fs = __importStar(require(\"fs\"));\nconst child_process_1 = require(\"child_process\");\n/**\n * @deprecated Use the `vscode-uri` npm module which provides a more\n * complete implementation of handling VS Code URIs.\n */\nfunction uriToFilePath(uri) {\n    const parsed = url.parse(uri);\n    if (parsed.protocol !== 'file:' || !parsed.path) {\n        return undefined;\n    }\n    const segments = parsed.path.split('/');\n    for (let i = 0, len = segments.length; i < len; i++) {\n        segments[i] = decodeURIComponent(segments[i]);\n    }\n    if (process.platform === 'win32' && segments.length > 1) {\n        const first = segments[0];\n        const second = segments[1];\n        // Do we have a drive letter and we started with a / which is the\n        // case if the first segement is empty (see split above)\n        if (first.length === 0 && second.length > 1 && second[1] === ':') {\n            // Remove first slash\n            segments.shift();\n        }\n    }\n    return path.normalize(segments.join('/'));\n}\nfunction isWindows() {\n    return process.platform === 'win32';\n}\nfunction resolve(moduleName, nodePath, cwd, tracer) {\n    const nodePathKey = 'NODE_PATH';\n    const app = [\n        'var p = process;',\n        'p.on(\\'message\\',function(m){',\n        'if(m.c===\\'e\\'){',\n        'p.exit(0);',\n        '}',\n        'else if(m.c===\\'rs\\'){',\n        'try{',\n        'var r=require.resolve(m.a);',\n        'p.send({c:\\'r\\',s:true,r:r});',\n        '}',\n        'catch(err){',\n        'p.send({c:\\'r\\',s:false});',\n        '}',\n        '}',\n        '});'\n    ].join('');\n    return new Promise((resolve, reject) => {\n        const env = process.env;\n        const newEnv = Object.create(null);\n        Object.keys(env).forEach(key => newEnv[key] = env[key]);\n        if (nodePath && fs.existsSync(nodePath) /* see issue 545 */) {\n            if (newEnv[nodePathKey]) {\n                newEnv[nodePathKey] = nodePath + path.delimiter + newEnv[nodePathKey];\n            }\n            else {\n                newEnv[nodePathKey] = nodePath;\n            }\n            if (tracer) {\n                tracer(`NODE_PATH value is: ${newEnv[nodePathKey]}`);\n            }\n        }\n        newEnv['ELECTRON_RUN_AS_NODE'] = '1';\n        try {\n            const cp = (0, child_process_1.fork)('', [], {\n                cwd: cwd,\n                env: newEnv,\n                execArgv: ['-e', app]\n            });\n            if (cp.pid === void 0) {\n                reject(new Error(`Starting process to resolve node module  ${moduleName} failed`));\n                return;\n            }\n            cp.on('error', (error) => {\n                reject(error);\n            });\n            cp.on('message', (message) => {\n                if (message.c === 'r') {\n                    cp.send({ c: 'e' });\n                    if (message.s) {\n                        resolve(message.r);\n                    }\n                    else {\n                        reject(new Error(`Failed to resolve module: ${moduleName}`));\n                    }\n                }\n            });\n            const message = {\n                c: 'rs',\n                a: moduleName\n            };\n            cp.send(message);\n        }\n        catch (error) {\n            reject(error);\n        }\n    });\n}\n/**\n * Resolve the global npm package path.\n * @deprecated Since this depends on the used package manager and their version the best is that servers\n * implement this themselves since they know best what kind of package managers to support.\n * @param tracer the tracer to use\n */\nfunction resolveGlobalNodePath(tracer) {\n    let npmCommand = 'npm';\n    const env = Object.create(null);\n    Object.keys(process.env).forEach(key => env[key] = process.env[key]);\n    env['NO_UPDATE_NOTIFIER'] = 'true';\n    const options = {\n        encoding: 'utf8',\n        env\n    };\n    if (isWindows()) {\n        npmCommand = 'npm.cmd';\n        options.shell = true;\n    }\n    const handler = () => { };\n    try {\n        process.on('SIGPIPE', handler);\n        const stdout = (0, child_process_1.spawnSync)(npmCommand, ['config', 'get', 'prefix'], options).stdout;\n        if (!stdout) {\n            if (tracer) {\n                tracer(`'npm config get prefix' didn't return a value.`);\n            }\n            return undefined;\n        }\n        const prefix = stdout.trim();\n        if (tracer) {\n            tracer(`'npm config get prefix' value is: ${prefix}`);\n        }\n        if (prefix.length > 0) {\n            if (isWindows()) {\n                return path.join(prefix, 'node_modules');\n            }\n            else {\n                return path.join(prefix, 'lib', 'node_modules');\n            }\n        }\n        return undefined;\n    }\n    catch (err) {\n        return undefined;\n    }\n    finally {\n        process.removeListener('SIGPIPE', handler);\n    }\n}\n/*\n * Resolve the global yarn pakage path.\n * @deprecated Since this depends on the used package manager and their version the best is that servers\n * implement this themselves since they know best what kind of package managers to support.\n * @param tracer the tracer to use\n */\nfunction resolveGlobalYarnPath(tracer) {\n    let yarnCommand = 'yarn';\n    const options = {\n        encoding: 'utf8'\n    };\n    if (isWindows()) {\n        yarnCommand = 'yarn.cmd';\n        options.shell = true;\n    }\n    const handler = () => { };\n    try {\n        process.on('SIGPIPE', handler);\n        const results = (0, child_process_1.spawnSync)(yarnCommand, ['global', 'dir', '--json'], options);\n        const stdout = results.stdout;\n        if (!stdout) {\n            if (tracer) {\n                tracer(`'yarn global dir' didn't return a value.`);\n                if (results.stderr) {\n                    tracer(results.stderr);\n                }\n            }\n            return undefined;\n        }\n        const lines = stdout.trim().split(/\\r?\\n/);\n        for (const line of lines) {\n            try {\n                const yarn = JSON.parse(line);\n                if (yarn.type === 'log') {\n                    return path.join(yarn.data, 'node_modules');\n                }\n            }\n            catch (e) {\n                // Do nothing. Ignore the line\n            }\n        }\n        return undefined;\n    }\n    catch (err) {\n        return undefined;\n    }\n    finally {\n        process.removeListener('SIGPIPE', handler);\n    }\n}\nvar FileSystem;\n(function (FileSystem) {\n    let _isCaseSensitive = undefined;\n    function isCaseSensitive() {\n        if (_isCaseSensitive !== void 0) {\n            return _isCaseSensitive;\n        }\n        if (process.platform === 'win32') {\n            _isCaseSensitive = false;\n        }\n        else {\n            // convert current file name to upper case / lower case and check if file exists\n            // (guards against cases when name is already all uppercase or lowercase)\n            _isCaseSensitive = !fs.existsSync(__filename.toUpperCase()) || !fs.existsSync(__filename.toLowerCase());\n        }\n        return _isCaseSensitive;\n    }\n    FileSystem.isCaseSensitive = isCaseSensitive;\n    function isParent(parent, child) {\n        if (isCaseSensitive()) {\n            return path.normalize(child).indexOf(path.normalize(parent)) === 0;\n        }\n        else {\n            return path.normalize(child).toLowerCase().indexOf(path.normalize(parent).toLowerCase()) === 0;\n        }\n    }\n    FileSystem.isParent = isParent;\n})(FileSystem || (exports.FileSystem = FileSystem = {}));\nfunction resolveModulePath(workspaceRoot, moduleName, nodePath, tracer) {\n    if (nodePath) {\n        if (!path.isAbsolute(nodePath)) {\n            nodePath = path.join(workspaceRoot, nodePath);\n        }\n        return resolve(moduleName, nodePath, nodePath, tracer).then((value) => {\n            if (FileSystem.isParent(nodePath, value)) {\n                return value;\n            }\n            else {\n                return Promise.reject(new Error(`Failed to load ${moduleName} from node path location.`));\n            }\n        }).then(undefined, (_error) => {\n            return resolve(moduleName, resolveGlobalNodePath(tracer), workspaceRoot, tracer);\n        });\n    }\n    else {\n        return resolve(moduleName, resolveGlobalNodePath(tracer), workspaceRoot, tracer);\n    }\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst util_1 = require(\"util\");\nconst api_1 = require(\"../common/api\");\nclass MessageBuffer extends api_1.AbstractMessageBuffer {\n    static emptyBuffer = Buffer.allocUnsafe(0);\n    constructor(encoding = 'utf-8') {\n        super(encoding);\n    }\n    emptyBuffer() {\n        return MessageBuffer.emptyBuffer;\n    }\n    fromString(value, encoding) {\n        return Buffer.from(value, encoding);\n    }\n    toString(value, encoding) {\n        if (value instanceof Buffer) {\n            return value.toString(encoding);\n        }\n        else {\n            return new util_1.TextDecoder(encoding).decode(value);\n        }\n    }\n    asNative(buffer, length) {\n        if (length === undefined) {\n            return buffer instanceof Buffer ? buffer : Buffer.from(buffer);\n        }\n        else {\n            return buffer instanceof Buffer ? buffer.slice(0, length) : Buffer.from(buffer, 0, length);\n        }\n    }\n    allocNative(length) {\n        return Buffer.allocUnsafe(length);\n    }\n}\nclass ReadableStreamWrapper {\n    stream;\n    constructor(stream) {\n        this.stream = stream;\n    }\n    onClose(listener) {\n        this.stream.on('close', listener);\n        return api_1.Disposable.create(() => this.stream.off('close', listener));\n    }\n    onError(listener) {\n        this.stream.on('error', listener);\n        return api_1.Disposable.create(() => this.stream.off('error', listener));\n    }\n    onEnd(listener) {\n        this.stream.on('end', listener);\n        return api_1.Disposable.create(() => this.stream.off('end', listener));\n    }\n    onData(listener) {\n        this.stream.on('data', listener);\n        return api_1.Disposable.create(() => this.stream.off('data', listener));\n    }\n}\nclass WritableStreamWrapper {\n    stream;\n    constructor(stream) {\n        this.stream = stream;\n    }\n    onClose(listener) {\n        this.stream.on('close', listener);\n        return api_1.Disposable.create(() => this.stream.off('close', listener));\n    }\n    onError(listener) {\n        this.stream.on('error', listener);\n        return api_1.Disposable.create(() => this.stream.off('error', listener));\n    }\n    onEnd(listener) {\n        this.stream.on('end', listener);\n        return api_1.Disposable.create(() => this.stream.off('end', listener));\n    }\n    write(data, encoding) {\n        return new Promise((resolve, reject) => {\n            const callback = (error) => {\n                if (error === undefined || error === null) {\n                    resolve();\n                }\n                else {\n                    reject(error);\n                }\n            };\n            if (typeof data === 'string') {\n                this.stream.write(data, encoding, callback);\n            }\n            else {\n                this.stream.write(data, callback);\n            }\n        });\n    }\n    end() {\n        this.stream.end();\n    }\n}\nconst _ril = Object.freeze({\n    messageBuffer: Object.freeze({\n        create: (encoding) => new MessageBuffer(encoding)\n    }),\n    applicationJson: Object.freeze({\n        encoder: Object.freeze({\n            name: 'application/json',\n            encode: (msg, options) => {\n                try {\n                    return Promise.resolve(Buffer.from(JSON.stringify(msg, undefined, 0), options.charset));\n                }\n                catch (err) {\n                    return Promise.reject(err);\n                }\n            }\n        }),\n        decoder: Object.freeze({\n            name: 'application/json',\n            decode: (buffer, options) => {\n                try {\n                    if (buffer instanceof Buffer) {\n                        return Promise.resolve(JSON.parse(buffer.toString(options.charset)));\n                    }\n                    else {\n                        return Promise.resolve(JSON.parse(new util_1.TextDecoder(options.charset).decode(buffer)));\n                    }\n                }\n                catch (err) {\n                    return Promise.reject(err);\n                }\n            }\n        })\n    }),\n    stream: Object.freeze({\n        asReadableStream: (stream) => new ReadableStreamWrapper(stream),\n        asWritableStream: (stream) => new WritableStreamWrapper(stream)\n    }),\n    console: console,\n    timer: Object.freeze({\n        setTimeout(callback, ms, ...args) {\n            const handle = setTimeout(callback, ms, ...args);\n            return { dispose: () => clearTimeout(handle) };\n        },\n        setImmediate(callback, ...args) {\n            const handle = setImmediate(callback, ...args);\n            return { dispose: () => clearImmediate(handle) };\n        },\n        setInterval(callback, ms, ...args) {\n            const handle = setInterval(callback, ms, ...args);\n            return { dispose: () => clearInterval(handle) };\n        }\n    })\n});\nfunction RIL() {\n    return _ril;\n}\n(function (RIL) {\n    function install() {\n        api_1.RAL.install(_ril);\n    }\n    RIL.install = install;\n})(RIL || (RIL = {}));\nexports.default = RIL;\n", "\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.StreamMessageWriter = exports.StreamMessageReader = exports.SocketMessageWriter = exports.SocketMessageReader = exports.PortMessageWriter = exports.PortMessageReader = exports.IPCMessageWriter = exports.IPCMessageReader = void 0;\nexports.generateRandomPipeName = generateRandomPipeName;\nexports.createClientPipeTransport = createClientPipeTransport;\nexports.createServerPipeTransport = createServerPipeTransport;\nexports.createClientSocketTransport = createClientSocketTransport;\nexports.createServerSocketTransport = createServerSocketTransport;\nexports.createMessageConnection = createMessageConnection;\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 ril_1 = __importDefault(require(\"./ril\"));\n// Install the node runtime abstract.\nril_1.default.install();\nconst path = __importStar(require(\"path\"));\nconst os = __importStar(require(\"os\"));\nconst fs = __importStar(require(\"fs\"));\nconst crypto_1 = require(\"crypto\");\nconst net_1 = require(\"net\");\nconst api_1 = require(\"../common/api\");\n__exportStar(require(\"../common/api\"), exports);\nclass IPCMessageReader extends api_1.AbstractMessageReader {\n    process;\n    constructor(process) {\n        super();\n        this.process = process;\n        const eventEmitter = this.process;\n        eventEmitter.on('error', (error) => this.fireError(error));\n        eventEmitter.on('close', () => this.fireClose());\n    }\n    listen(callback) {\n        this.process.on('message', callback);\n        return api_1.Disposable.create(() => this.process.off('message', callback));\n    }\n}\nexports.IPCMessageReader = IPCMessageReader;\nclass IPCMessageWriter extends api_1.AbstractMessageWriter {\n    process;\n    errorCount;\n    constructor(process) {\n        super();\n        this.process = process;\n        this.errorCount = 0;\n        const eventEmitter = this.process;\n        eventEmitter.on('error', (error) => this.fireError(error));\n        eventEmitter.on('close', () => this.fireClose);\n    }\n    write(msg) {\n        try {\n            if (typeof this.process.send === 'function') {\n                this.process.send(msg, undefined, undefined, (error) => {\n                    if (error) {\n                        this.errorCount++;\n                        this.handleError(error, msg);\n                    }\n                    else {\n                        this.errorCount = 0;\n                    }\n                });\n            }\n            return Promise.resolve();\n        }\n        catch (error) {\n            this.handleError(error, msg);\n            return Promise.reject(error);\n        }\n    }\n    handleError(error, msg) {\n        this.errorCount++;\n        this.fireError(error, msg, this.errorCount);\n    }\n    end() {\n    }\n}\nexports.IPCMessageWriter = IPCMessageWriter;\nclass PortMessageReader extends api_1.AbstractMessageReader {\n    onData;\n    constructor(port) {\n        super();\n        this.onData = new api_1.Emitter;\n        port.on('close', () => this.fireClose);\n        port.on('error', (error) => this.fireError(error));\n        port.on('message', (message) => {\n            this.onData.fire(message);\n        });\n    }\n    listen(callback) {\n        return this.onData.event(callback);\n    }\n}\nexports.PortMessageReader = PortMessageReader;\nclass PortMessageWriter extends api_1.AbstractMessageWriter {\n    port;\n    errorCount;\n    constructor(port) {\n        super();\n        this.port = port;\n        this.errorCount = 0;\n        port.on('close', () => this.fireClose());\n        port.on('error', (error) => this.fireError(error));\n    }\n    write(msg) {\n        try {\n            this.port.postMessage(msg);\n            return Promise.resolve();\n        }\n        catch (error) {\n            this.handleError(error, msg);\n            return Promise.reject(error);\n        }\n    }\n    handleError(error, msg) {\n        this.errorCount++;\n        this.fireError(error, msg, this.errorCount);\n    }\n    end() {\n    }\n}\nexports.PortMessageWriter = PortMessageWriter;\nclass SocketMessageReader extends api_1.ReadableStreamMessageReader {\n    constructor(socket, encoding = 'utf-8') {\n        super((0, ril_1.default)().stream.asReadableStream(socket), encoding);\n    }\n}\nexports.SocketMessageReader = SocketMessageReader;\nclass SocketMessageWriter extends api_1.WriteableStreamMessageWriter {\n    socket;\n    constructor(socket, options) {\n        super((0, ril_1.default)().stream.asWritableStream(socket), options);\n        this.socket = socket;\n    }\n    dispose() {\n        super.dispose();\n        this.socket.destroy();\n    }\n}\nexports.SocketMessageWriter = SocketMessageWriter;\nclass StreamMessageReader extends api_1.ReadableStreamMessageReader {\n    constructor(readable, encoding) {\n        super((0, ril_1.default)().stream.asReadableStream(readable), encoding);\n    }\n}\nexports.StreamMessageReader = StreamMessageReader;\nclass StreamMessageWriter extends api_1.WriteableStreamMessageWriter {\n    constructor(writable, options) {\n        super((0, ril_1.default)().stream.asWritableStream(writable), options);\n    }\n}\nexports.StreamMessageWriter = StreamMessageWriter;\nconst XDG_RUNTIME_DIR = process.env['XDG_RUNTIME_DIR'];\nconst safeIpcPathLengths = new Map([\n    ['linux', 107],\n    ['darwin', 103]\n]);\nfunction generateRandomPipeName() {\n    if (process.platform === 'win32') {\n        return `\\\\\\\\.\\\\pipe\\\\lsp-${(0, crypto_1.randomBytes)(16).toString('hex')}-sock`;\n    }\n    let randomLength = 32;\n    const fixedLength = '/lsp-.sock'.length;\n    const tmpDir = fs.realpathSync(XDG_RUNTIME_DIR ?? os.tmpdir());\n    const limit = safeIpcPathLengths.get(process.platform);\n    if (limit !== undefined) {\n        randomLength = Math.min(limit - tmpDir.length - fixedLength, randomLength);\n    }\n    if (randomLength < 16) {\n        throw new Error(`Unable to generate a random pipe name with ${randomLength} characters.`);\n    }\n    const randomSuffix = (0, crypto_1.randomBytes)(Math.floor(randomLength / 2)).toString('hex');\n    return path.join(tmpDir, `lsp-${randomSuffix}.sock`);\n}\nfunction createClientPipeTransport(pipeName, encoding = 'utf-8') {\n    let connectResolve;\n    const connected = new Promise((resolve, _reject) => {\n        connectResolve = resolve;\n    });\n    return new Promise((resolve, reject) => {\n        const server = (0, net_1.createServer)((socket) => {\n            server.close();\n            connectResolve([\n                new SocketMessageReader(socket, encoding),\n                new SocketMessageWriter(socket, encoding)\n            ]);\n        });\n        server.on('error', reject);\n        server.listen(pipeName, () => {\n            server.removeListener('error', reject);\n            resolve({\n                onConnected: () => { return connected; }\n            });\n        });\n    });\n}\nfunction createServerPipeTransport(pipeName, encoding = 'utf-8') {\n    const socket = (0, net_1.createConnection)(pipeName);\n    return [\n        new SocketMessageReader(socket, encoding),\n        new SocketMessageWriter(socket, encoding)\n    ];\n}\nfunction createClientSocketTransport(port, encoding = 'utf-8') {\n    let connectResolve;\n    const connected = new Promise((resolve, _reject) => {\n        connectResolve = resolve;\n    });\n    return new Promise((resolve, reject) => {\n        const server = (0, net_1.createServer)((socket) => {\n            server.close();\n            connectResolve([\n                new SocketMessageReader(socket, encoding),\n                new SocketMessageWriter(socket, encoding)\n            ]);\n        });\n        server.on('error', reject);\n        server.listen(port, '127.0.0.1', () => {\n            server.removeListener('error', reject);\n            resolve({\n                onConnected: () => { return connected; }\n            });\n        });\n    });\n}\nfunction createServerSocketTransport(port, encoding = 'utf-8') {\n    const socket = (0, net_1.createConnection)(port, '127.0.0.1');\n    return [\n        new SocketMessageReader(socket, encoding),\n        new SocketMessageWriter(socket, encoding)\n    ];\n}\nfunction isReadableStream(value) {\n    const candidate = value;\n    return candidate.read !== undefined && candidate.addListener !== undefined;\n}\nfunction isWritableStream(value) {\n    const candidate = value;\n    return candidate.write !== undefined && candidate.addListener !== undefined;\n}\nfunction createMessageConnection(input, output, logger, options) {\n    if (!logger) {\n        logger = api_1.NullLogger;\n    }\n    const reader = isReadableStream(input) ? new StreamMessageReader(input) : input;\n    const writer = isWritableStream(output) ? new StreamMessageWriter(output) : output;\n    if (api_1.ConnectionStrategy.is(options)) {\n        options = { connectionStrategy: options };\n    }\n    return (0, api_1.createMessageConnection)(reader, writer, logger, options);\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createProtocolConnection = createProtocolConnection;\nconst node_1 = require(\"vscode-jsonrpc/node\");\n__exportStar(require(\"vscode-jsonrpc/node\"), exports);\n__exportStar(require(\"../common/api\"), exports);\nfunction createProtocolConnection(input, output, logger, options) {\n    return (0, node_1.createMessageConnection)(input, output, logger, options);\n}\n", "\"use strict\";\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\n/// <reference path=\"../../typings/thenable.d.ts\" preserve=\"true\"/>\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Files = void 0;\nexports.createConnection = createConnection;\nconst node_util_1 = require(\"node:util\");\nconst Is = __importStar(require(\"../common/utils/is\"));\nconst server_1 = require(\"../common/server\");\nconst fm = __importStar(require(\"./files\"));\nconst node_1 = require(\"vscode-languageserver-protocol/node\");\n__exportStar(require(\"vscode-languageserver-protocol/node\"), exports);\n__exportStar(require(\"../common/api\"), exports);\nvar Files;\n(function (Files) {\n    Files.uriToFilePath = fm.uriToFilePath;\n    Files.resolveGlobalNodePath = fm.resolveGlobalNodePath;\n    Files.resolveGlobalYarnPath = fm.resolveGlobalYarnPath;\n    Files.resolve = fm.resolve;\n    Files.resolveModulePath = fm.resolveModulePath;\n})(Files || (exports.Files = Files = {}));\nlet _protocolConnection;\nfunction endProtocolConnection() {\n    if (_protocolConnection === undefined) {\n        return;\n    }\n    try {\n        _protocolConnection.end();\n    }\n    catch (_err) {\n        // Ignore. The client process could have already\n        // did and we can't send an end into the connection.\n    }\n}\nlet _shutdownReceived = false;\nlet exitTimer = undefined;\nfunction setupExitTimer() {\n    const argName = '--clientProcessId';\n    function runTimer(value) {\n        try {\n            const processId = parseInt(value);\n            if (!isNaN(processId)) {\n                exitTimer = setInterval(() => {\n                    try {\n                        process.kill(processId, 0);\n                    }\n                    catch (ex) {\n                        // Parent process doesn't exist anymore. Exit the server.\n                        endProtocolConnection();\n                        process.exit(_shutdownReceived ? 0 : 1);\n                    }\n                }, 3000);\n            }\n        }\n        catch (e) {\n            // Ignore errors;\n        }\n    }\n    for (let i = 2; i < process.argv.length; i++) {\n        const arg = process.argv[i];\n        if (arg === argName && i + 1 < process.argv.length) {\n            runTimer(process.argv[i + 1]);\n            return;\n        }\n        else {\n            const args = arg.split('=');\n            if (args[0] === argName) {\n                runTimer(args[1]);\n            }\n        }\n    }\n}\nsetupExitTimer();\nconst watchDog = {\n    initialize: (params) => {\n        const processId = params.processId;\n        if (Is.number(processId) && exitTimer === undefined) {\n            // We received a parent process id. Set up a timer to periodically check\n            // if the parent is still alive.\n            setInterval(() => {\n                try {\n                    process.kill(processId, 0);\n                }\n                catch (ex) {\n                    // Parent process doesn't exist anymore. Exit the server.\n                    process.exit(_shutdownReceived ? 0 : 1);\n                }\n            }, 3000);\n        }\n    },\n    get shutdownReceived() {\n        return _shutdownReceived;\n    },\n    set shutdownReceived(value) {\n        _shutdownReceived = value;\n    },\n    exit: (code) => {\n        endProtocolConnection();\n        process.exit(code);\n    }\n};\nfunction createConnection(arg1, arg2, arg3, arg4) {\n    let factories;\n    let input;\n    let output;\n    let options;\n    if (arg1 !== undefined && arg1.__brand === 'features') {\n        factories = arg1;\n        arg1 = arg2;\n        arg2 = arg3;\n        arg3 = arg4;\n    }\n    if (node_1.ConnectionStrategy.is(arg1) || node_1.ConnectionOptions.is(arg1)) {\n        options = arg1;\n    }\n    else {\n        input = arg1;\n        output = arg2;\n        options = arg3;\n    }\n    return _createConnection(input, output, options, factories);\n}\nfunction _createConnection(input, output, options, factories) {\n    let stdio = false;\n    if (!input && !output && process.argv.length > 2) {\n        let port = undefined;\n        let pipeName = undefined;\n        const argv = process.argv.slice(2);\n        for (let i = 0; i < argv.length; i++) {\n            const arg = argv[i];\n            if (arg === '--node-ipc') {\n                input = new node_1.IPCMessageReader(process);\n                output = new node_1.IPCMessageWriter(process);\n                break;\n            }\n            else if (arg === '--stdio') {\n                stdio = true;\n                input = process.stdin;\n                output = process.stdout;\n                break;\n            }\n            else if (arg === '--socket') {\n                port = parseInt(argv[i + 1]);\n                break;\n            }\n            else if (arg === '--pipe') {\n                pipeName = argv[i + 1];\n                break;\n            }\n            else {\n                const args = arg.split('=');\n                if (args[0] === '--socket') {\n                    port = parseInt(args[1]);\n                    break;\n                }\n                else if (args[0] === '--pipe') {\n                    pipeName = args[1];\n                    break;\n                }\n            }\n        }\n        if (port) {\n            const transport = (0, node_1.createServerSocketTransport)(port);\n            input = transport[0];\n            output = transport[1];\n        }\n        else if (pipeName) {\n            const transport = (0, node_1.createServerPipeTransport)(pipeName);\n            input = transport[0];\n            output = transport[1];\n        }\n    }\n    const commandLineMessage = 'Use arguments of createConnection or set command line parameters: \\'--node-ipc\\', \\'--stdio\\' or \\'--socket={number}\\'';\n    if (!input) {\n        throw new Error('Connection input stream is not set. ' + commandLineMessage);\n    }\n    if (!output) {\n        throw new Error('Connection output stream is not set. ' + commandLineMessage);\n    }\n    // Backwards compatibility\n    if (Is.func(input.read) && Is.func(input.on)) {\n        const inputStream = input;\n        inputStream.on('end', () => {\n            endProtocolConnection();\n            process.exit(_shutdownReceived ? 0 : 1);\n        });\n        inputStream.on('close', () => {\n            endProtocolConnection();\n            process.exit(_shutdownReceived ? 0 : 1);\n        });\n    }\n    const connectionFactory = (logger) => {\n        const result = (0, node_1.createProtocolConnection)(input, output, logger, options);\n        if (stdio) {\n            patchConsole(logger);\n        }\n        return result;\n    };\n    return (0, server_1.createConnection)(connectionFactory, watchDog, factories);\n}\nfunction patchConsole(logger) {\n    function serialize(args) {\n        return args.map(arg => typeof arg === 'string' ? arg : (0, node_util_1.inspect)(arg)).join(' ');\n    }\n    const counters = new Map();\n    console.assert = function assert(assertion, ...args) {\n        if (assertion) {\n            return;\n        }\n        if (args.length === 0) {\n            logger.error('Assertion failed');\n        }\n        else {\n            const [message, ...rest] = args;\n            logger.error(`Assertion failed: ${message} ${serialize(rest)}`);\n        }\n    };\n    console.count = function count(label = 'default') {\n        const message = String(label);\n        let counter = counters.get(message) ?? 0;\n        counter += 1;\n        counters.set(message, counter);\n        logger.log(`${message}: ${message}`);\n    };\n    console.countReset = function countReset(label) {\n        if (label === undefined) {\n            counters.clear();\n        }\n        else {\n            counters.delete(String(label));\n        }\n    };\n    console.debug = function debug(...args) {\n        logger.log(serialize(args));\n    };\n    console.dir = function dir(arg, options) {\n        logger.log((0, node_util_1.inspect)(arg, options));\n    };\n    console.log = function log(...args) {\n        logger.log(serialize(args));\n    };\n    console.error = function error(...args) {\n        logger.error(serialize(args));\n    };\n    console.trace = function trace(...args) {\n        const stack = new Error().stack.replace(/(.+\\n){2}/, '');\n        let message = 'Trace';\n        if (args.length !== 0) {\n            message += `: ${serialize(args)}`;\n        }\n        logger.log(`${message}\\n${stack}`);\n    };\n    console.warn = function warn(...args) {\n        logger.warn(serialize(args));\n    };\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { CompletionItem, CompletionParams, TextEdit } from 'vscode-languageserver-protocol';\nimport type { LangiumCompletionParser } from '../../parser/langium-parser.js';\nimport type { NameProvider } from '../../references/name-provider.js';\nimport type { ScopeProvider } from '../../references/scope-provider.js';\nimport type { LangiumServices } from '../lsp-services.js';\nimport type { AstNode, AstNodeDescription, AstReflection, CstNode, MultiReference, Mutable, Reference, ReferenceInfo } from '../../syntax-tree.js';\nimport type { CancellationToken } from '../../utils/cancellation.js';\nimport type { MaybePromise } from '../../utils/promise-utils.js';\nimport type { LangiumDocument, TextDocument } from '../../workspace/documents.js';\nimport type { NextFeature } from './follow-element-computation.js';\nimport type { NodeKindProvider } from '../node-kind-provider.js';\nimport type { FuzzyMatcher } from '../fuzzy-matcher.js';\nimport type { GrammarConfig } from '../../languages/grammar-config.js';\nimport type { Lexer } from '../../parser/lexer.js';\nimport type { DocumentationProvider } from '../../documentation/documentation-provider.js';\nimport type { IToken } from 'chevrotain';\nimport type { MarkupContent } from 'vscode-languageserver';\nimport { CompletionItemKind, CompletionList, Position } from 'vscode-languageserver';\nimport * as ast from '../../languages/generated/ast.js';\nimport { assignMandatoryProperties, getContainerOfType } from '../../utils/ast-utils.js';\nimport { findDeclarationNodeAtOffset, findLeafNodeBeforeOffset, getDatatypeNode } from '../../utils/cst-utils.js';\nimport { getEntryRule } from '../../utils/grammar-utils.js';\nimport { stream, type Stream } from '../../utils/stream.js';\nimport { findFirstFeatures, findNextFeatures } from './follow-element-computation.js';\n\nexport type CompletionAcceptor = (context: CompletionContext, value: CompletionValueItem) => void\n\nexport type CompletionValueItem = ({\n    label?: string\n} | {\n    node: AstNode\n} | {\n    nodeDescription: AstNodeDescription\n}) & Partial<CompletionItem>;\n\nexport interface CompletionContext {\n    node?: AstNode\n    document: LangiumDocument\n    textDocument: TextDocument\n    features: NextFeature[]\n    /**\n     * Index at the start of the token related to this context.\n     * If the context performs completion for a token that doesn't exist yet, it is equal to the `offset`.\n     */\n    tokenOffset: number\n    /**\n     * Index at the end of the token related to this context, even if it is behind the cursor position.\n     * Points at the first character after the last token.\n     * If the context performs completion for a token that doesn't exist yet, it is equal to the `offset`.\n     */\n    tokenEndOffset: number\n    /**\n     * Index of the requested completed position.\n     */\n    offset: number\n    position: Position\n}\n\nexport interface CompletionProviderOptions {\n    /**\n     * Most tools trigger completion request automatically without explicitly requesting\n     * it using a keyboard shortcut (e.g. Ctrl+Space). Typically they do so when the user\n     * starts to type an identifier. For example if the user types `c` in a JavaScript file\n     * code complete will automatically pop up present `console` besides others as a\n     * completion item. Characters that make up identifiers don't need to be listed here.\n     *\n     * If code complete should automatically be trigger on characters not being valid inside\n     * an identifier (for example `.` in JavaScript) list them in `triggerCharacters`.\n     */\n    triggerCharacters?: string[];\n    /**\n     * The list of all possible characters that commit a completion. This field can be used\n     * if clients don't support individual commit characters per completion item.\n     *\n     * If a server provides both `allCommitCharacters` and commit characters on an individual\n     * completion item the ones on the completion item win.\n     */\n    allCommitCharacters?: string[];\n}\n\nexport interface CompletionBacktrackingInformation {\n    previousTokenStart?: number;\n    previousTokenEnd?: number;\n    nextTokenStart: number;\n    nextTokenEnd: number;\n}\n\nexport function mergeCompletionProviderOptions(options: Array<CompletionProviderOptions | undefined>): CompletionProviderOptions {\n    const triggerCharacters = Array.from(new Set(options.flatMap(option => option?.triggerCharacters ?? [])));\n    const allCommitCharacters = Array.from(new Set(options.flatMap(option => option?.allCommitCharacters ?? [])));\n    return {\n        triggerCharacters: triggerCharacters.length > 0 ? triggerCharacters : undefined,\n        allCommitCharacters: allCommitCharacters.length > 0 ? allCommitCharacters : undefined\n    };\n}\n\n/**\n * Language-specific service for handling completion requests.\n */\nexport interface CompletionProvider {\n    /**\n     * Handle a completion request.\n     *\n     * @param document - the document for which the completion request was triggered\n     * @param params - the completion parameters\n     * @param cancelToken - a token that can be used to cancel the request\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    getCompletion(document: LangiumDocument, params: CompletionParams, cancelToken?: CancellationToken): MaybePromise<CompletionList | undefined>\n    /**\n     * Contains the completion options for this completion provider.\n     *\n     * If multiple languages return different options, they are merged before being sent to the language client.\n     */\n    readonly completionOptions?: CompletionProviderOptions;\n}\n\nexport class DefaultCompletionProvider implements CompletionProvider {\n\n    protected readonly completionParser: LangiumCompletionParser;\n    protected readonly documentationProvider: DocumentationProvider;\n    protected readonly scopeProvider: ScopeProvider;\n    protected readonly grammar: ast.Grammar;\n    protected readonly nameProvider: NameProvider;\n    protected readonly lexer: Lexer;\n    protected readonly nodeKindProvider: NodeKindProvider;\n    protected readonly fuzzyMatcher: FuzzyMatcher;\n    protected readonly grammarConfig: GrammarConfig;\n    protected readonly astReflection: AstReflection;\n    readonly completionOptions?: CompletionProviderOptions;\n\n    constructor(services: LangiumServices) {\n        this.scopeProvider = services.references.ScopeProvider;\n        this.grammar = services.Grammar;\n        this.completionParser = services.parser.CompletionParser;\n        this.nameProvider = services.references.NameProvider;\n        this.lexer = services.parser.Lexer;\n        this.nodeKindProvider = services.shared.lsp.NodeKindProvider;\n        this.fuzzyMatcher = services.shared.lsp.FuzzyMatcher;\n        this.grammarConfig = services.parser.GrammarConfig;\n        this.astReflection = services.shared.AstReflection;\n        this.documentationProvider = services.documentation.DocumentationProvider;\n    }\n\n    async getCompletion(document: LangiumDocument, params: CompletionParams, _cancelToken?: CancellationToken): Promise<CompletionList | undefined> {\n        const items: CompletionItem[] = [];\n        const contexts = this.buildContexts(document, params.position);\n\n        const acceptor: CompletionAcceptor = (context, value) => {\n            const completionItem = this.fillCompletionItem(context, value);\n            if (completionItem) {\n                items.push(completionItem);\n            }\n        };\n\n        const distinctionFunction = (element: NextFeature) => {\n            if (ast.isKeyword(element.feature)) {\n                return element.feature.value;\n            } else {\n                return element.feature;\n            }\n        };\n\n        const completedFeatures: NextFeature[] = [];\n        for (const context of contexts) {\n            await Promise.all(\n                stream(context.features)\n                    .distinct(distinctionFunction)\n                    .exclude(completedFeatures)\n                    .map(e => this.completionFor(context, e, acceptor))\n            );\n            // Do not try to complete the same feature multiple times\n            completedFeatures.push(...context.features);\n            // We might want to stop computing completion results\n            if (!this.continueCompletion(items)) {\n                break;\n            }\n        }\n\n        return CompletionList.create(this.deduplicateItems(items), true);\n    }\n\n    /**\n     * The completion algorithm could yield the same reference/keyword multiple times.\n     *\n     * This methods deduplicates these items afterwards before returning to the client.\n     * Unique items are identified as a combination of `kind`, `label` and `detail`.\n     */\n    protected deduplicateItems(items: CompletionItem[]): CompletionItem[] {\n        return stream(items).distinct(item => `${item.kind}_${item.label}_${item.detail}`).toArray();\n    }\n\n    protected findFeaturesAt(document: TextDocument, offset: number): NextFeature[] {\n        const text = document.getText({\n            start: Position.create(0, 0),\n            end: document.positionAt(offset)\n        });\n        const parserResult = this.completionParser.parse(text);\n        const tokens = parserResult.tokens;\n        // If the parser didn't parse any tokens, return the next features of the entry rule\n        if (parserResult.tokenIndex === 0) {\n            const parserRule = getEntryRule(this.grammar)!;\n            // Generate a synthetic RuleCall to the entry rule\n            const syntheticEntryRuleCall = this.buildSyntheticEntryRuleCall(parserRule);\n            return findNextFeatures([[syntheticEntryRuleCall]], tokens);\n        }\n        const leftoverTokens = [...tokens].splice(parserResult.tokenIndex);\n        const features = findNextFeatures([parserResult.elementStack.map(feature => ({ feature }))], leftoverTokens);\n        return features;\n    }\n\n    protected buildSyntheticEntryRuleCall(rule: ast.ParserRule): NextFeature {\n        // The \"start\" node is simply an empty group that is followed by the rule call\n        const start: ast.Group = {\n            $type: 'Group',\n            $container: undefined!,\n            elements: []\n        };\n        const startNext: NextFeature<ast.Group> = {\n            feature: start\n        };\n        // This is the element that we want to complete\n        const ruleCall: ast.RuleCall = {\n            $type: 'RuleCall',\n            $container: undefined!,\n            rule: {\n                ref: rule,\n                $refText: rule.name\n            },\n            arguments: []\n        };\n        const group: ast.Group = {\n            $type: 'Group',\n            $container: undefined!,\n            elements: [\n                start,\n                ruleCall\n            ]\n        };\n        (start as Mutable<AstNode>).$container = group;\n        (ruleCall as Mutable<AstNode>).$container = group;\n        return startNext;\n    }\n\n    protected *buildContexts(document: LangiumDocument, position: Position): IterableIterator<CompletionContext> {\n        const cst = document.parseResult.value.$cstNode;\n        if (!cst) {\n            return;\n        }\n        const textDocument = document.textDocument;\n        const text = textDocument.getText();\n        const offset = textDocument.offsetAt(position);\n        const partialContext = {\n            document,\n            textDocument,\n            offset,\n            position\n        };\n        // Data type rules need special handling, as their tokens are irrelevant for completion purposes.\n        // If we encounter a data type rule at the current offset, we jump to the start of the data type rule.\n        const dataTypeRuleOffsets = this.findDataTypeRuleStart(cst, offset);\n        if (dataTypeRuleOffsets) {\n            const [ruleStart, ruleEnd] = dataTypeRuleOffsets;\n            const parentNode = findLeafNodeBeforeOffset(cst, ruleStart)?.astNode;\n            yield {\n                ...partialContext,\n                node: parentNode,\n                tokenOffset: ruleStart,\n                tokenEndOffset: ruleEnd,\n                features: this.findFeaturesAt(textDocument, ruleStart),\n            };\n        }\n        // For all other purposes, it's enough to jump to the start of the current/previous token\n        const { nextTokenStart, nextTokenEnd, previousTokenStart, previousTokenEnd } = this.backtrackToAnyToken(text, offset);\n        let astNodeOffset = nextTokenStart;\n        if (offset <= nextTokenStart && previousTokenStart !== undefined) {\n            // This check indicates that the cursor is still before the next token, so we should use the previous AST node (if it exists)\n            astNodeOffset = previousTokenStart;\n        }\n        const astNode = findLeafNodeBeforeOffset(cst, astNodeOffset)?.astNode;\n        let performNextCompletion = true;\n        if (previousTokenStart !== undefined && previousTokenEnd !== undefined && previousTokenEnd === offset) {\n            // This context aims to complete the current feature\n            yield {\n                ...partialContext,\n                node: astNode,\n                tokenOffset: previousTokenStart,\n                tokenEndOffset: previousTokenEnd,\n                features: this.findFeaturesAt(textDocument, previousTokenStart),\n            };\n            // The completion after the current token should be prevented in case we find out that the current token definitely isn't completed yet\n            // This is usually the case when the current token ends on a letter.\n            performNextCompletion = this.performNextTokenCompletion(\n                document,\n                text.substring(previousTokenStart, previousTokenEnd),\n                previousTokenStart,\n                previousTokenEnd\n            );\n            if (performNextCompletion) {\n                // This context aims to complete the immediate next feature (if one exists at the current cursor position)\n                // It uses the previous cst start/offset for that.\n                yield {\n                    ...partialContext,\n                    node: astNode,\n                    tokenOffset: previousTokenEnd,\n                    tokenEndOffset: previousTokenEnd,\n                    features: this.findFeaturesAt(textDocument, previousTokenEnd),\n                };\n            }\n        }\n\n        if (!astNode) {\n            const parserRule = getEntryRule(this.grammar);\n            if (!parserRule) {\n                throw new Error('Missing entry parser rule');\n            }\n            // This context aims to perform completion for the grammar start (usually when the document is empty)\n            yield {\n                ...partialContext,\n                tokenOffset: nextTokenStart,\n                tokenEndOffset: nextTokenEnd,\n                features: findFirstFeatures(parserRule.definition).map(f => f[f.length - 1]),\n            };\n        } else if (performNextCompletion) {\n            // This context aims to complete the next feature, using the next cst start/end\n            yield {\n                ...partialContext,\n                node: astNode,\n                tokenOffset: nextTokenStart,\n                tokenEndOffset: nextTokenEnd,\n                features: this.findFeaturesAt(textDocument, nextTokenStart),\n            };\n        }\n    }\n\n    protected performNextTokenCompletion(document: LangiumDocument, text: string, _offset: number, _end: number): boolean {\n        // This regex returns false if the text ends with a letter.\n        // We don't want to complete new text immediately after a keyword, ID etc.\n        // We only care about the last character in the text, so we use $ here.\n        // The \\P{L} used here is a Unicode category that matches any character that is not a letter\n        return /\\P{L}$/u.test(text);\n    }\n\n    protected findDataTypeRuleStart(cst: CstNode, offset: number): [number, number] | undefined {\n        const containerNode = findDeclarationNodeAtOffset(cst, offset, this.grammarConfig.nameRegexp);\n        if (!containerNode) {\n            return undefined;\n        }\n        // Identify whether the element was parsed as part of a data type rule\n        const fullNode = getDatatypeNode(containerNode);\n        if (fullNode) {\n            return [fullNode.offset, fullNode.end];\n        }\n        return undefined;\n    }\n\n    /**\n     * Indicates whether the completion should continue to process the next completion context.\n     *\n     * The default implementation continues the completion only if there are currently no proposed completion items.\n     */\n    protected continueCompletion(items: CompletionItem[]): boolean {\n        return items.length === 0;\n    }\n\n    /**\n     * This method returns two sets of token offset information.\n     *\n     * The `nextToken*` offsets are related to the token at the cursor position.\n     * If there is none, both offsets are simply set to `offset`.\n     *\n     * The `previousToken*` offsets are related to the last token before the current token at the cursor position.\n     * They are `undefined`, if there is no token before the cursor position.\n     */\n    protected backtrackToAnyToken(text: string, offset: number): CompletionBacktrackingInformation {\n        const tokens = this.lexer.tokenize(text).tokens;\n        if (tokens.length === 0) {\n            // If we don't have any tokens in our document, just return the offset position\n            return {\n                nextTokenStart: offset,\n                nextTokenEnd: offset\n            };\n        }\n        let previousToken: IToken | undefined;\n        for (const token of tokens) {\n            if (token.startOffset >= offset) {\n                // We are between two tokens\n                // Return the current offset as the next token index\n                return {\n                    nextTokenStart: offset,\n                    nextTokenEnd: offset,\n                    previousTokenStart: previousToken ? previousToken.startOffset : undefined,\n                    previousTokenEnd: previousToken ? previousToken.endOffset! + 1 : undefined\n                };\n            }\n            if (token.endOffset! >= offset) {\n                // We are within a token\n                // Return the current and previous token offsets as normal\n                return {\n                    nextTokenStart: token.startOffset,\n                    nextTokenEnd: token.endOffset! + 1,\n                    previousTokenStart: previousToken ? previousToken.startOffset : undefined,\n                    previousTokenEnd: previousToken ? previousToken.endOffset! + 1 : undefined\n                };\n            }\n            previousToken = token;\n        }\n        // We have run into the end of the file\n        // Return the current offset as the next token index\n        return {\n            nextTokenStart: offset,\n            nextTokenEnd: offset,\n            previousTokenStart: previousToken ? previousToken.startOffset : undefined,\n            previousTokenEnd: previousToken ? previousToken.endOffset! + 1 : undefined\n        };\n    }\n\n    protected completionFor(context: CompletionContext, next: NextFeature, acceptor: CompletionAcceptor): MaybePromise<void> {\n        if (ast.isKeyword(next.feature)) {\n            return this.completionForKeyword(context, next.feature, acceptor);\n        } else if (ast.isCrossReference(next.feature) && context.node) {\n            return this.completionForCrossReference(context, next as NextFeature<ast.CrossReference>, acceptor);\n        }\n        // Don't offer any completion for other elements (i.e. terminals, datatype rules)\n        // We - from a framework level - cannot reasonably assume their contents.\n        // Adopters can just override `completionFor` if they want to do that anyway.\n    }\n\n    protected completionForCrossReference(context: CompletionContext, next: NextFeature<ast.CrossReference>, acceptor: CompletionAcceptor): MaybePromise<void> {\n        const assignment = getContainerOfType(next.feature, ast.isAssignment);\n        let node = context.node;\n        if (assignment && node) {\n            if (next.type) {\n                // When `type` is set, it indicates that we have just entered a new parser rule.\n                // The cross reference that we're trying to complete is on a new element that doesn't exist yet.\n                // So we create a new synthetic element with the correct type information.\n                node = {\n                    $type: next.type,\n                    $container: node,\n                    $containerProperty: next.property\n                };\n                assignMandatoryProperties(this.astReflection, node);\n            }\n            let reference: Reference | MultiReference;\n            if (next.feature.isMulti) {\n                reference = {\n                    $refText: '',\n                    items: []\n                };\n            } else {\n                reference = {\n                    $refText: '',\n                    ref: undefined\n                };\n            }\n            const refInfo: ReferenceInfo = {\n                reference,\n                container: node,\n                property: assignment.feature\n            };\n            try {\n                for (const candidate of this.getReferenceCandidates(refInfo, context)) {\n                    acceptor(context, this.createReferenceCompletionItem(candidate, refInfo, context));\n                }\n            } catch (err) {\n                console.error(err);\n            }\n        }\n    }\n\n    /**\n     * Override this method to change how the stream of candidates is determined for a reference.\n     * This way completion-specific modifications and refinements can be added to the proposals computation\n     *  beyond the rules being implemented in the scope provider, e.g. filtering.\n     *\n     * @param refInfo Information about the reference for which the candidates are requested.\n     * @param _context Information about the completion request including document, cursor position, token under cursor, etc.\n     * @returns A stream of all elements being valid for the given reference.\n     */\n    protected getReferenceCandidates(refInfo: ReferenceInfo, _context: CompletionContext): Stream<AstNodeDescription> {\n        return this.scopeProvider.getScope(refInfo).getAllElements();\n    }\n\n    /**\n     * Override this method to change how reference completion items are created.\n     *\n     * To change the `kind` of a completion item, override the `NodeKindProvider` service instead.\n     * To change the `documentation`, override the `DocumentationProvider` service instead.\n     *\n     * @param nodeDescription The description of a reference candidate\n     * @param _refInfo Information about the reference for which the candidate is proposed\n     * @param _context The completion context\n     * @returns A partial completion item\n     */\n    protected createReferenceCompletionItem(nodeDescription: AstNodeDescription, _refInfo: ReferenceInfo, _context: CompletionContext): CompletionValueItem {\n        const kind = this.nodeKindProvider.getCompletionItemKind(nodeDescription);\n        const documentation = this.getReferenceDocumentation(nodeDescription);\n        return {\n            nodeDescription,\n            kind,\n            documentation,\n            detail: nodeDescription.type,\n            sortText: '0'\n        };\n    }\n\n    protected getReferenceDocumentation(nodeDescription: AstNodeDescription): MarkupContent | string | undefined {\n        if (!nodeDescription.node) {\n            return undefined;\n        }\n        const documentationText = this.documentationProvider.getDocumentation(nodeDescription.node);\n        if (!documentationText) {\n            return undefined;\n        }\n        return { kind: 'markdown', value: documentationText };\n    }\n\n    protected completionForKeyword(context: CompletionContext, keyword: ast.Keyword, acceptor: CompletionAcceptor): MaybePromise<void> {\n        if (!this.filterKeyword(context, keyword)) {\n            return;\n        }\n        acceptor(context, {\n            label: keyword.value,\n            kind: this.getKeywordCompletionItemKind(keyword),\n            detail: 'Keyword',\n            sortText: '1'\n        });\n    }\n\n    protected getKeywordCompletionItemKind(_keyword: ast.Keyword): CompletionItemKind {\n        return CompletionItemKind.Keyword;\n    }\n\n    protected filterKeyword(context: CompletionContext, keyword: ast.Keyword): boolean {\n        // Filter out keywords that do not contain any word character\n        return /\\p{L}/u.test(keyword.value);\n    }\n\n    protected fillCompletionItem(context: CompletionContext, item: CompletionValueItem): CompletionItem | undefined {\n        let label: string;\n        if (typeof item.label === 'string') {\n            label = item.label;\n        } else if ('node' in item) {\n            const name = this.nameProvider.getName(item.node);\n            if (!name) {\n                return undefined;\n            }\n            label = name;\n        } else if ('nodeDescription' in item) {\n            label = item.nodeDescription.name;\n        } else {\n            return undefined;\n        }\n        let insertText: string;\n        if (typeof item.textEdit?.newText === 'string') {\n            insertText = item.textEdit.newText;\n        } else if (typeof item.insertText === 'string') {\n            insertText = item.insertText;\n        } else {\n            insertText = label;\n        }\n        const textEdit = item.textEdit ?? this.buildCompletionTextEdit(context, label, insertText);\n        if (!textEdit) {\n            return undefined;\n        }\n        // Copy all valid properties of `CompletionItem`\n        const completionItem: CompletionItem = {\n            additionalTextEdits: item.additionalTextEdits,\n            command: item.command,\n            commitCharacters: item.commitCharacters,\n            data: item.data,\n            detail: item.detail,\n            documentation: item.documentation,\n            filterText: item.filterText,\n            insertText: item.insertText,\n            insertTextFormat: item.insertTextFormat,\n            insertTextMode: item.insertTextMode,\n            kind: item.kind,\n            labelDetails: item.labelDetails,\n            preselect: item.preselect,\n            sortText: item.sortText,\n            tags: item.tags,\n            textEditText: item.textEditText,\n            textEdit,\n            label\n        };\n        return completionItem;\n    }\n\n    protected buildCompletionTextEdit(context: CompletionContext, label: string, newText: string): TextEdit | undefined {\n        const content = context.textDocument.getText();\n        const identifier = content.substring(context.tokenOffset, context.offset);\n        if (this.fuzzyMatcher.match(identifier, label)) {\n            const start = context.textDocument.positionAt(context.tokenOffset);\n            const end = context.position;\n            return {\n                newText,\n                range: {\n                    start,\n                    end\n                }\n            };\n        } else {\n            return undefined;\n        }\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { TokenType } from 'chevrotain';\nimport type { URI } from './utils/uri-utils.js';\nimport type { AbstractElement } from './languages/generated/ast.js';\nimport type { DocumentSegment, LangiumDocument } from './workspace/documents.js';\n\n/**\n * A node in the Abstract Syntax Tree (AST).\n */\nexport interface AstNode {\n    /** Every AST node has a type corresponding to what was specified in the grammar declaration. */\n    readonly $type: string;\n    /** The container node in the AST; every node except the root node has a container. */\n    readonly $container?: AstNode;\n    /** The property of the `$container` node that contains this node. This is either a direct reference or an array. */\n    readonly $containerProperty?: string;\n    /** In case `$containerProperty` is an array, the array index is stored here. */\n    readonly $containerIndex?: number;\n    /** The Concrete Syntax Tree (CST) node of the text range from which this node was parsed. */\n    readonly $cstNode?: CstNode;\n    /** The document containing the AST; only the root node has a direct reference to the document. */\n    readonly $document?: LangiumDocument;\n}\n\nexport function isAstNode(obj: unknown): obj is AstNode {\n    return typeof obj === 'object' && obj !== null && typeof (obj as AstNode).$type === 'string';\n}\n\nexport interface GenericAstNode extends AstNode {\n    [key: string]: unknown\n}\n\ntype SpecificNodeProperties<N extends AstNode> = keyof Omit<N, keyof AstNode | number | symbol>;\n\n/**\n * The property names of a given AST node type.\n */\nexport type Properties<N extends AstNode> = SpecificNodeProperties<N> extends never ? string : SpecificNodeProperties<N>\n\n/**\n * A cross-reference in the AST. Cross-references may or may not be successfully resolved.\n */\nexport interface Reference<T extends AstNode = AstNode> {\n    /**\n     * The target AST node of this reference. Accessing this property may trigger cross-reference\n     * resolution by the `Linker` in case it has not been done yet. If the reference cannot be resolved,\n     * the value is `undefined`.\n     */\n    readonly ref: T | undefined;\n\n    /** If any problem occurred while resolving the reference, it is described by this property. */\n    readonly error?: LinkingError;\n    /** The CST node from which the reference was parsed */\n    readonly $refNode?: CstNode;\n    /** The actual text used to look up in the surrounding scope */\n    readonly $refText: string;\n    /** The node description for the AstNode returned by `ref`  */\n    readonly $nodeDescription?: AstNodeDescription;\n}\n\nexport interface MultiReference<T extends AstNode = AstNode> {\n    /** The CST node from which the reference was parsed */\n    readonly $refNode?: CstNode;\n    /** The actual text used to look up in the surrounding scope */\n    readonly $refText: string;\n    /**\n     * The resolved references. Accessing this property may trigger cross-reference\n     * resolution by the `Linker` in case it has not been done yet.\n     * If no references can be found, the array is empty (but not `undefined`)\n     * and the `error` property is set.\n     */\n    readonly items: Array<MultiReferenceItem<T>>;\n    /** If any problem occurred while resolving the reference, it is described by this property. */\n    readonly error?: LinkingError;\n}\n\n/**\n * Represents a single resolved reference of a {@link MultiReference} instance.\n */\nexport interface MultiReferenceItem<T extends AstNode = AstNode> {\n    /** The node description for the AstNode returned by `ref`  */\n    readonly $nodeDescription?: AstNodeDescription;\n    /**\n     * The target AST node of this reference.\n     */\n    readonly ref: T;\n}\n\nexport function isReference(obj: unknown): obj is Reference {\n    return typeof obj === 'object' && obj !== null && typeof (obj as Reference).$refText === 'string' && 'ref' in obj;\n}\n\nexport function isMultiReference(obj: unknown): obj is MultiReference {\n    return typeof obj === 'object' && obj !== null && typeof (obj as Reference).$refText === 'string' && 'items' in obj;\n}\n\nexport type ResolvedReference<T extends AstNode = AstNode> = Reference<T> & {\n    readonly ref: T;\n}\n\n/**\n * A description of an AST node is used when constructing scopes and looking up cross-reference targets.\n */\nexport interface AstNodeDescription {\n    /** The target node; should be present only for local references (linking to the same document). */\n    node?: AstNode;\n    /**\n     * The document segment that represents the range of the name of the AST node.\n     */\n    nameSegment?: DocumentSegment;\n    /**\n     * The document segment that represents the full range of the AST node.\n     */\n    selectionSegment?: DocumentSegment;\n    /** `$type` property value of the AST node */\n    type: string;\n    /** Name of the AST node; this is usually determined by the `NameProvider` service. */\n    name: string;\n    /** URI to the document containing the AST node */\n    documentUri: URI;\n    /** Navigation path inside the document */\n    path: string;\n}\n\nexport function isAstNodeDescription(obj: unknown): obj is AstNodeDescription {\n    return typeof obj === 'object' && obj !== null\n        && typeof (obj as AstNodeDescription).name === 'string'\n        && typeof (obj as AstNodeDescription).type === 'string'\n        && typeof (obj as AstNodeDescription).path === 'string';\n}\n\n/**\n * Information about a cross-reference. This is used when traversing references in an AST or to describe\n * unresolved references.\n */\nexport interface ReferenceInfo {\n    reference: Reference | MultiReference\n    container: AstNode\n    property: string\n    index?: number\n}\n\n/**\n * Used to collect information when the `Linker` service fails to resolve a cross-reference.\n */\nexport interface LinkingError {\n    message: string;\n    info: ReferenceInfo;\n    targetDescription?: AstNodeDescription;\n}\n\nexport function isLinkingError(obj: unknown): obj is LinkingError {\n    return typeof obj === 'object' && obj !== null\n        && typeof (obj as LinkingError).info === 'object'\n        && typeof (obj as LinkingError).message === 'string';\n}\n\n/**\n * Service used for generic access to the structure of the AST. This service is shared between\n * all involved languages, so it operates on the superset of types of these languages.\n */\nexport interface AstReflection {\n    readonly types: AstMetaData\n    getAllTypes(): string[]\n    getReferenceType(refInfo: ReferenceInfo): string\n    getTypeMetaData(type: string): TypeMetaData\n    isInstance(node: unknown, type: string): boolean\n    isSubtype(subtype: string, supertype: string): boolean\n    getAllSubTypes(type: string): string[]\n    isComplete(node: AstNode): boolean\n}\n\n/**\n * An abstract implementation of the {@link AstReflection} interface.\n * Serves to cache subtype computation results to improve performance throughout different parts of Langium.\n */\nexport abstract class AbstractAstReflection implements AstReflection {\n\n    readonly types: AstMetaData;\n    protected subtypes: Record<string, Record<string, boolean | undefined>> = {};\n    protected allSubtypes: Record<string, string[] | undefined> = {};\n\n    getAllTypes(): string[] {\n        return Object.keys(this.types);\n    }\n\n    getReferenceType(refInfo: ReferenceInfo): string {\n        const metaData = this.types[refInfo.container.$type];\n        if (!metaData) {\n            throw new Error(`Type ${refInfo.container.$type || 'undefined'} not found.`);\n        }\n        const referenceType = metaData.properties[refInfo.property]?.referenceType;\n        if (!referenceType) {\n            throw new Error(`Property ${refInfo.property || 'undefined'} of type ${refInfo.container.$type} is not a reference.`);\n        }\n        return referenceType;\n    }\n\n    getTypeMetaData(type: string): TypeMetaData {\n        const result = this.types[type];\n        if (!result) {\n            return {\n                name: type,\n                properties: {},\n                superTypes: []\n            };\n        }\n        return result;\n    }\n\n    isInstance(node: unknown, type: string): boolean {\n        return isAstNode(node) && this.isSubtype(node.$type, type);\n    }\n\n    isSubtype(subtype: string, supertype: string): boolean {\n        if (subtype === supertype) {\n            return true;\n        }\n        let nested = this.subtypes[subtype];\n        if (!nested) {\n            nested = this.subtypes[subtype] = {};\n        }\n        const existing = nested[supertype];\n        if (existing !== undefined) {\n            return existing;\n        } else {\n            const metaData = this.types[subtype];\n            const result = metaData ? metaData.superTypes.some(s => this.isSubtype(s, supertype)) : false;\n            nested[supertype] = result;\n            return result;\n        }\n    }\n\n    getAllSubTypes(type: string): string[] {\n        const existing = this.allSubtypes[type];\n        if (existing) {\n            return existing;\n        } else {\n            const allTypes = this.getAllTypes();\n            const types: string[] = [];\n            for (const possibleSubType of allTypes) {\n                if (this.isSubtype(possibleSubType, type)) {\n                    types.push(possibleSubType);\n                }\n            }\n            this.allSubtypes[type] = types;\n            return types;\n        }\n    }\n\n    /**\n     * Check whether a given AST node is missing any non-optional properties.\n     * Used to guard against incomplete nodes that deviate from their declared type,\n     * particularly when error recovery is in effect.\n     */\n    isComplete(node: AstNode): boolean {\n        const meta = this.getTypeMetaData(node.$type);\n        for (const key of Object.keys(meta.properties)) {\n            const prop = meta.properties[key];\n            if (prop.optional) {\n                continue;\n            }\n\n            const value = (node as GenericAstNode)[prop.name];\n            if (value === undefined || value === null) {\n                return false;\n            }\n        }\n        return true;\n    }\n}\n\n/**\n * A map of all AST node types and their meta data.\n */\nexport interface AstMetaData {\n    [type: string]: TypeMetaData\n}\n\n/**\n * Represents runtime meta data about an AST node type.\n */\nexport interface TypeMetaData {\n    /** The name of this AST node type. Corresponds to the `AstNode.$type` value. */\n    name: string\n    /** A list of properties with their relevant meta data. */\n    properties: {\n        [name: string]: PropertyMetaData\n    }\n    /** The super types of this AST node type. */\n    superTypes: string[]\n}\n\n/**\n * Describes the meta data of a property of an AST node.\n */\nexport interface PropertyMetaData {\n    /** The name of this property. */\n    name: string\n    /**\n     * Indicates that the property's value is mandatory in the AST node when present.\n     * For example, if an AST node contains an array, but no elements of this array have been parsed,\n     * we still expect an empty array instead of `undefined`.\n     * A property with a `defaultValue` may still be `optional`, in which case this indicates\n     * the property must have a value when it is present.\n     */\n    defaultValue?: PropertyType\n    /**\n     * Indicates whether this property is optional in the AST node.\n     * Note that a node with a `defaultValue` may also be optional.\n     * `isComplete` relies on this info for runtime node completeness checks\n     */\n    optional?: boolean\n    /**\n     * If the property is a reference, this is the type of the reference target.\n     */\n    referenceType?: string\n}\n\n/**\n * Represents a default value for an AST property.\n */\nexport type PropertyType = number | string | boolean | PropertyType[];\n\n/**\n * A node in the Concrete Syntax Tree (CST).\n */\nexport interface CstNode extends DocumentSegment {\n    /** The container node in the CST */\n    readonly container?: CompositeCstNode;\n    /** The actual text */\n    readonly text: string;\n    /** The root CST node */\n    readonly root: RootCstNode;\n    /** The grammar element from which this node was parsed */\n    readonly grammarSource?: AbstractElement;\n    /** The AST node created from this CST node */\n    readonly astNode: AstNode;\n    /** Whether the token is hidden, i.e. not explicitly part of the containing grammar rule */\n    readonly hidden: boolean;\n}\n\n/**\n * A composite CST node contains other nodes, but no directly associated token.\n */\nexport interface CompositeCstNode extends CstNode {\n    readonly content: CstNode[];\n}\n\nexport function isCompositeCstNode(node: unknown): node is CompositeCstNode {\n    return typeof node === 'object' && node !== null && Array.isArray((node as CompositeCstNode).content);\n}\n\n/**\n * A leaf CST node corresponds to a token in the input token stream.\n */\nexport interface LeafCstNode extends CstNode {\n    readonly tokenType: TokenType;\n}\n\nexport function isLeafCstNode(node: unknown): node is LeafCstNode {\n    return typeof node === 'object' && node !== null && typeof (node as LeafCstNode).tokenType === 'object';\n}\n\nexport interface RootCstNode extends CompositeCstNode {\n    readonly fullText: string\n}\n\nexport function isRootCstNode(node: unknown): node is RootCstNode {\n    return isCompositeCstNode(node) && typeof (node as RootCstNode).fullText === 'string';\n}\n\n/**\n * Describes a union type including only names(!) of properties of type T whose property value is of a certain type K,\n *  or 'never' in case of no such properties.\n * It evaluates the value type regardless of the property being optional or not by converting T to Required<T>.\n * Note the '-?' in '[I in keyof T]-?:' that is required to map all optional but un-intended properties to 'never'.\n * Without that, optional props like those inherited from 'AstNode' would be mapped to 'never|undefined',\n *  and the subsequent value mapping ('...[keyof T]') would yield 'undefined' instead of 'never' for AstNode types\n *  not having any property matching type K, which in turn yields follow-up errors.\n */\ntype ExtractKeysOfValueType<T, K> = { [I in keyof T]-?: Required<T>[I] extends K ? I : never }[keyof T];\n\nexport type SingleCrossReferencesOfAstNodeType<N extends AstNode> = ExtractKeysOfValueType<N, Reference | Reference[]>;\nexport type MultiCrossReferencesOfAstNodeType<N extends AstNode> = ExtractKeysOfValueType<N, MultiReference | MultiReference[]>;\n/**\n * Describes a union type including only names(!) of the cross-reference properties of the given AstNode type.\n * Enhances compile-time validation of cross-reference distinctions, e.g. in scope providers\n *  in combination with `assertUnreachable(context.property)`.\n */\nexport type CrossReferencesOfAstNodeType<N extends AstNode> = SingleCrossReferencesOfAstNodeType<N> | MultiCrossReferencesOfAstNodeType<N>;\n\n/**\n * Represents the enumeration-like type, that lists all AstNode types of your grammar.\n */\nexport type AstTypeList<T> = Record<keyof T, AstNode>;\n\n/**\n * Describes a union type including of all AstNode types containing cross-references.\n *  A is meant to be the interface `XXXAstType` fromm your generated `ast.ts` file.\n * Enhances compile-time validation of cross-reference distinctions, e.g. in scope providers\n *  in combination with `assertUnreachable(context.container)`.\n */\nexport type AstNodeTypesWithCrossReferences<A extends AstTypeList<A>> = {\n    [T in keyof A]-?: CrossReferencesOfAstNodeType<A[T]> extends never ? never : A[T]\n}[keyof A];\n\nexport type Mutable<T> = {\n    -readonly [P in keyof T]: T[P]\n};\n", "/******************************************************************************\n * This file was generated by langium-cli 4.3.0.\n * DO NOT EDIT MANUALLY!\n ******************************************************************************/\n\n/* eslint-disable */\nimport * as langium from '../../syntax-tree.js';\n\nexport const LangiumGrammarTerminals = {\n    ID: /\\^?[_a-zA-Z][\\w_]*/,\n    STRING: /\"(\\\\.|[^\"\\\\])*\"|'(\\\\.|[^'\\\\])*'/,\n    NUMBER: /NaN|-?((\\d*\\.\\d+|\\d+)([Ee][+-]?\\d+)?|Infinity)/,\n    RegexLiteral: /\\/(?![*+?])(?:[^\\r\\n\\[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*\\])+\\/[a-z]*/,\n    WS: /\\s+/,\n    ML_COMMENT: /\\/\\*[\\s\\S]*?\\*\\//,\n    SL_COMMENT: /\\/\\/[^\\n\\r]*/,\n};\n\nexport type LangiumGrammarTerminalNames = keyof typeof LangiumGrammarTerminals;\n\nexport type LangiumGrammarKeywordNames =\n    | \"!\"\n    | \"&\"\n    | \"(\"\n    | \")\"\n    | \"*\"\n    | \"+\"\n    | \"+=\"\n    | \",\"\n    | \"->\"\n    | \".\"\n    | \"..\"\n    | \":\"\n    | \";\"\n    | \"<\"\n    | \"=\"\n    | \"=>\"\n    | \">\"\n    | \"?\"\n    | \"?!\"\n    | \"?<!\"\n    | \"?<=\"\n    | \"?=\"\n    | \"@\"\n    | \"Date\"\n    | \"EOF\"\n    | \"[\"\n    | \"]\"\n    | \"assoc\"\n    | \"bigint\"\n    | \"boolean\"\n    | \"current\"\n    | \"entry\"\n    | \"extends\"\n    | \"false\"\n    | \"fragment\"\n    | \"grammar\"\n    | \"hidden\"\n    | \"import\"\n    | \"infer\"\n    | \"infers\"\n    | \"infix\"\n    | \"interface\"\n    | \"left\"\n    | \"number\"\n    | \"on\"\n    | \"returns\"\n    | \"right\"\n    | \"string\"\n    | \"terminal\"\n    | \"true\"\n    | \"type\"\n    | \"with\"\n    | \"{\"\n    | \"|\"\n    | \"}\";\n\nexport type LangiumGrammarTokenNames = LangiumGrammarTerminalNames | LangiumGrammarKeywordNames;\n\nexport interface AbstractElement extends langium.AstNode {\n    readonly $type: 'AbstractElement' | 'Action' | 'Alternatives' | 'Assignment' | 'CharacterRange' | 'CrossReference' | 'EndOfFile' | 'Group' | 'Keyword' | 'NegatedToken' | 'RegexToken' | 'RuleCall' | 'TerminalAlternatives' | 'TerminalElement' | 'TerminalGroup' | 'TerminalRuleCall' | 'UnorderedGroup' | 'UntilToken' | 'Wildcard';\n    cardinality?: '*' | '+' | '?';\n}\n\nexport const AbstractElement = {\n    $type: 'AbstractElement',\n    cardinality: 'cardinality'\n} as const;\n\nexport function isAbstractElement(item: unknown): item is AbstractElement {\n    return reflection.isInstance(item, AbstractElement.$type);\n}\n\nexport type AbstractParserRule = InfixRule | ParserRule;\n\nexport const AbstractParserRule = {\n    $type: 'AbstractParserRule'\n} as const;\n\nexport function isAbstractParserRule(item: unknown): item is AbstractParserRule {\n    return reflection.isInstance(item, AbstractParserRule.$type);\n}\n\nexport type AbstractRule = AbstractParserRule | TerminalRule;\n\nexport const AbstractRule = {\n    $type: 'AbstractRule'\n} as const;\n\nexport function isAbstractRule(item: unknown): item is AbstractRule {\n    return reflection.isInstance(item, AbstractRule.$type);\n}\n\nexport type AbstractType = AbstractParserRule | InferredType | Interface | Type;\n\nexport const AbstractType = {\n    $type: 'AbstractType'\n} as const;\n\nexport function isAbstractType(item: unknown): item is AbstractType {\n    return reflection.isInstance(item, AbstractType.$type);\n}\n\nexport interface Action extends AbstractElement {\n    readonly $type: 'Action';\n    feature?: FeatureName;\n    inferredType?: InferredType;\n    operator?: '+=' | '=';\n    type?: langium.Reference<AbstractType>;\n}\n\nexport const Action = {\n    $type: 'Action',\n    cardinality: 'cardinality',\n    feature: 'feature',\n    inferredType: 'inferredType',\n    operator: 'operator',\n    type: 'type'\n} as const;\n\nexport function isAction(item: unknown): item is Action {\n    return reflection.isInstance(item, Action.$type);\n}\n\nexport interface Alternatives extends AbstractElement {\n    readonly $type: 'Alternatives';\n    elements: Array<AbstractElement>;\n}\n\nexport const Alternatives = {\n    $type: 'Alternatives',\n    cardinality: 'cardinality',\n    elements: 'elements'\n} as const;\n\nexport function isAlternatives(item: unknown): item is Alternatives {\n    return reflection.isInstance(item, Alternatives.$type);\n}\n\nexport interface ArrayLiteral extends langium.AstNode {\n    readonly $container: ArrayLiteral | TypeAttribute;\n    readonly $type: 'ArrayLiteral';\n    elements: Array<ValueLiteral>;\n}\n\nexport const ArrayLiteral = {\n    $type: 'ArrayLiteral',\n    elements: 'elements'\n} as const;\n\nexport function isArrayLiteral(item: unknown): item is ArrayLiteral {\n    return reflection.isInstance(item, ArrayLiteral.$type);\n}\n\nexport interface ArrayType extends langium.AstNode {\n    readonly $container: ArrayType | ReferenceType | Type | TypeAttribute | UnionType;\n    readonly $type: 'ArrayType';\n    elementType: TypeDefinition;\n}\n\nexport const ArrayType = {\n    $type: 'ArrayType',\n    elementType: 'elementType'\n} as const;\n\nexport function isArrayType(item: unknown): item is ArrayType {\n    return reflection.isInstance(item, ArrayType.$type);\n}\n\nexport interface Assignment extends AbstractElement {\n    readonly $type: 'Assignment';\n    feature: FeatureName;\n    operator: '+=' | '=' | '?=';\n    predicate?: '->' | '=>';\n    terminal: AbstractElement;\n}\n\nexport const Assignment = {\n    $type: 'Assignment',\n    cardinality: 'cardinality',\n    feature: 'feature',\n    operator: 'operator',\n    predicate: 'predicate',\n    terminal: 'terminal'\n} as const;\n\nexport function isAssignment(item: unknown): item is Assignment {\n    return reflection.isInstance(item, Assignment.$type);\n}\n\nexport type Associativity = 'left' | 'right';\n\nexport interface BooleanLiteral extends langium.AstNode {\n    readonly $container: ArrayLiteral | Conjunction | Disjunction | Group | NamedArgument | Negation | TypeAttribute;\n    readonly $type: 'BooleanLiteral';\n    true: boolean;\n}\n\nexport const BooleanLiteral = {\n    $type: 'BooleanLiteral',\n    true: 'true'\n} as const;\n\nexport function isBooleanLiteral(item: unknown): item is BooleanLiteral {\n    return reflection.isInstance(item, BooleanLiteral.$type);\n}\n\nexport interface CharacterRange extends TerminalElement {\n    readonly $type: 'CharacterRange';\n    left: Keyword;\n    right?: Keyword;\n}\n\nexport const CharacterRange = {\n    $type: 'CharacterRange',\n    cardinality: 'cardinality',\n    left: 'left',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    right: 'right'\n} as const;\n\nexport function isCharacterRange(item: unknown): item is CharacterRange {\n    return reflection.isInstance(item, CharacterRange.$type);\n}\n\nexport type Condition = BooleanLiteral | Conjunction | Disjunction | Negation | ParameterReference;\n\nexport const Condition = {\n    $type: 'Condition'\n} as const;\n\nexport function isCondition(item: unknown): item is Condition {\n    return reflection.isInstance(item, Condition.$type);\n}\n\nexport interface Conjunction extends langium.AstNode {\n    readonly $container: Conjunction | Disjunction | Group | NamedArgument | Negation;\n    readonly $type: 'Conjunction';\n    left: Condition;\n    right: Condition;\n}\n\nexport const Conjunction = {\n    $type: 'Conjunction',\n    left: 'left',\n    right: 'right'\n} as const;\n\nexport function isConjunction(item: unknown): item is Conjunction {\n    return reflection.isInstance(item, Conjunction.$type);\n}\n\nexport interface CrossReference extends AbstractElement {\n    readonly $type: 'CrossReference';\n    deprecatedSyntax: boolean;\n    isMulti: boolean;\n    terminal?: AbstractElement;\n    type: langium.Reference<AbstractType>;\n}\n\nexport const CrossReference = {\n    $type: 'CrossReference',\n    cardinality: 'cardinality',\n    deprecatedSyntax: 'deprecatedSyntax',\n    isMulti: 'isMulti',\n    terminal: 'terminal',\n    type: 'type'\n} as const;\n\nexport function isCrossReference(item: unknown): item is CrossReference {\n    return reflection.isInstance(item, CrossReference.$type);\n}\n\nexport interface Disjunction extends langium.AstNode {\n    readonly $container: Conjunction | Disjunction | Group | NamedArgument | Negation;\n    readonly $type: 'Disjunction';\n    left: Condition;\n    right: Condition;\n}\n\nexport const Disjunction = {\n    $type: 'Disjunction',\n    left: 'left',\n    right: 'right'\n} as const;\n\nexport function isDisjunction(item: unknown): item is Disjunction {\n    return reflection.isInstance(item, Disjunction.$type);\n}\n\nexport interface EndOfFile extends AbstractElement {\n    readonly $type: 'EndOfFile';\n}\n\nexport const EndOfFile = {\n    $type: 'EndOfFile',\n    cardinality: 'cardinality'\n} as const;\n\nexport function isEndOfFile(item: unknown): item is EndOfFile {\n    return reflection.isInstance(item, EndOfFile.$type);\n}\n\nexport type FeatureName = 'assoc' | 'current' | 'entry' | 'extends' | 'false' | 'fragment' | 'grammar' | 'hidden' | 'import' | 'infer' | 'infers' | 'infix' | 'interface' | 'left' | 'on' | 'returns' | 'right' | 'terminal' | 'true' | 'type' | 'with' | PrimitiveType | string;\n\nexport interface Grammar extends langium.AstNode {\n    readonly $type: 'Grammar';\n    imports: Array<GrammarImport>;\n    interfaces: Array<Interface>;\n    isDeclared: boolean;\n    name?: string;\n    rules: Array<AbstractRule>;\n    types: Array<Type>;\n}\n\nexport const Grammar = {\n    $type: 'Grammar',\n    imports: 'imports',\n    interfaces: 'interfaces',\n    isDeclared: 'isDeclared',\n    name: 'name',\n    rules: 'rules',\n    types: 'types'\n} as const;\n\nexport function isGrammar(item: unknown): item is Grammar {\n    return reflection.isInstance(item, Grammar.$type);\n}\n\nexport interface GrammarImport extends langium.AstNode {\n    readonly $container: Grammar;\n    readonly $type: 'GrammarImport';\n    path: string;\n}\n\nexport const GrammarImport = {\n    $type: 'GrammarImport',\n    path: 'path'\n} as const;\n\nexport function isGrammarImport(item: unknown): item is GrammarImport {\n    return reflection.isInstance(item, GrammarImport.$type);\n}\n\nexport interface Group extends AbstractElement {\n    readonly $type: 'Group';\n    elements: Array<AbstractElement>;\n    guardCondition?: Condition;\n    predicate?: '->' | '=>';\n}\n\nexport const Group = {\n    $type: 'Group',\n    cardinality: 'cardinality',\n    elements: 'elements',\n    guardCondition: 'guardCondition',\n    predicate: 'predicate'\n} as const;\n\nexport function isGroup(item: unknown): item is Group {\n    return reflection.isInstance(item, Group.$type);\n}\n\nexport interface InferredType extends langium.AstNode {\n    readonly $container: Action | InfixRule | ParserRule;\n    readonly $type: 'InferredType';\n    name: string;\n}\n\nexport const InferredType = {\n    $type: 'InferredType',\n    name: 'name'\n} as const;\n\nexport function isInferredType(item: unknown): item is InferredType {\n    return reflection.isInstance(item, InferredType.$type);\n}\n\nexport interface InfixRule extends langium.AstNode {\n    readonly $container: Grammar;\n    readonly $type: 'InfixRule';\n    call: RuleCall;\n    dataType?: PrimitiveType;\n    inferredType?: InferredType;\n    name: string;\n    operators: InfixRuleOperators;\n    parameters: Array<Parameter>;\n    returnType?: langium.Reference<AbstractType>;\n}\n\nexport const InfixRule = {\n    $type: 'InfixRule',\n    call: 'call',\n    dataType: 'dataType',\n    inferredType: 'inferredType',\n    name: 'name',\n    operators: 'operators',\n    parameters: 'parameters',\n    returnType: 'returnType'\n} as const;\n\nexport function isInfixRule(item: unknown): item is InfixRule {\n    return reflection.isInstance(item, InfixRule.$type);\n}\n\nexport interface InfixRuleOperatorList extends langium.AstNode {\n    readonly $container: InfixRuleOperators;\n    readonly $type: 'InfixRuleOperatorList';\n    associativity?: Associativity;\n    operators: Array<Keyword>;\n}\n\nexport const InfixRuleOperatorList = {\n    $type: 'InfixRuleOperatorList',\n    associativity: 'associativity',\n    operators: 'operators'\n} as const;\n\nexport function isInfixRuleOperatorList(item: unknown): item is InfixRuleOperatorList {\n    return reflection.isInstance(item, InfixRuleOperatorList.$type);\n}\n\nexport interface InfixRuleOperators extends langium.AstNode {\n    readonly $container: InfixRule;\n    readonly $type: 'InfixRuleOperators';\n    precedences: Array<InfixRuleOperatorList>;\n}\n\nexport const InfixRuleOperators = {\n    $type: 'InfixRuleOperators',\n    precedences: 'precedences'\n} as const;\n\nexport function isInfixRuleOperators(item: unknown): item is InfixRuleOperators {\n    return reflection.isInstance(item, InfixRuleOperators.$type);\n}\n\nexport interface Interface extends langium.AstNode {\n    readonly $container: Grammar;\n    readonly $type: 'Interface';\n    attributes: Array<TypeAttribute>;\n    name: string;\n    superTypes: Array<langium.Reference<AbstractType>>;\n}\n\nexport const Interface = {\n    $type: 'Interface',\n    attributes: 'attributes',\n    name: 'name',\n    superTypes: 'superTypes'\n} as const;\n\nexport function isInterface(item: unknown): item is Interface {\n    return reflection.isInstance(item, Interface.$type);\n}\n\nexport interface Keyword extends AbstractElement {\n    readonly $container: CharacterRange | InfixRuleOperatorList;\n    readonly $type: 'Keyword';\n    predicate?: '->' | '=>';\n    value: string;\n}\n\nexport const Keyword = {\n    $type: 'Keyword',\n    cardinality: 'cardinality',\n    predicate: 'predicate',\n    value: 'value'\n} as const;\n\nexport function isKeyword(item: unknown): item is Keyword {\n    return reflection.isInstance(item, Keyword.$type);\n}\n\nexport interface NamedArgument extends langium.AstNode {\n    readonly $container: RuleCall;\n    readonly $type: 'NamedArgument';\n    calledByName: boolean;\n    parameter?: langium.Reference<Parameter>;\n    value: Condition;\n}\n\nexport const NamedArgument = {\n    $type: 'NamedArgument',\n    calledByName: 'calledByName',\n    parameter: 'parameter',\n    value: 'value'\n} as const;\n\nexport function isNamedArgument(item: unknown): item is NamedArgument {\n    return reflection.isInstance(item, NamedArgument.$type);\n}\n\nexport interface NegatedToken extends TerminalElement {\n    readonly $type: 'NegatedToken';\n    terminal: AbstractElement;\n}\n\nexport const NegatedToken = {\n    $type: 'NegatedToken',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    terminal: 'terminal'\n} as const;\n\nexport function isNegatedToken(item: unknown): item is NegatedToken {\n    return reflection.isInstance(item, NegatedToken.$type);\n}\n\nexport interface Negation extends langium.AstNode {\n    readonly $container: Conjunction | Disjunction | Group | NamedArgument | Negation;\n    readonly $type: 'Negation';\n    value: Condition;\n}\n\nexport const Negation = {\n    $type: 'Negation',\n    value: 'value'\n} as const;\n\nexport function isNegation(item: unknown): item is Negation {\n    return reflection.isInstance(item, Negation.$type);\n}\n\nexport interface NumberLiteral extends langium.AstNode {\n    readonly $container: ArrayLiteral | TypeAttribute;\n    readonly $type: 'NumberLiteral';\n    value: number;\n}\n\nexport const NumberLiteral = {\n    $type: 'NumberLiteral',\n    value: 'value'\n} as const;\n\nexport function isNumberLiteral(item: unknown): item is NumberLiteral {\n    return reflection.isInstance(item, NumberLiteral.$type);\n}\n\nexport interface Parameter extends langium.AstNode {\n    readonly $container: InfixRule | ParserRule;\n    readonly $type: 'Parameter';\n    name: string;\n}\n\nexport const Parameter = {\n    $type: 'Parameter',\n    name: 'name'\n} as const;\n\nexport function isParameter(item: unknown): item is Parameter {\n    return reflection.isInstance(item, Parameter.$type);\n}\n\nexport interface ParameterReference extends langium.AstNode {\n    readonly $container: Conjunction | Disjunction | Group | NamedArgument | Negation;\n    readonly $type: 'ParameterReference';\n    parameter: langium.Reference<Parameter>;\n}\n\nexport const ParameterReference = {\n    $type: 'ParameterReference',\n    parameter: 'parameter'\n} as const;\n\nexport function isParameterReference(item: unknown): item is ParameterReference {\n    return reflection.isInstance(item, ParameterReference.$type);\n}\n\nexport interface ParserRule extends langium.AstNode {\n    readonly $container: Grammar;\n    readonly $type: 'ParserRule';\n    dataType?: PrimitiveType;\n    definition: AbstractElement;\n    entry: boolean;\n    fragment: boolean;\n    inferredType?: InferredType;\n    name: string;\n    parameters: Array<Parameter>;\n    returnType?: langium.Reference<AbstractType>;\n}\n\nexport const ParserRule = {\n    $type: 'ParserRule',\n    dataType: 'dataType',\n    definition: 'definition',\n    entry: 'entry',\n    fragment: 'fragment',\n    inferredType: 'inferredType',\n    name: 'name',\n    parameters: 'parameters',\n    returnType: 'returnType'\n} as const;\n\nexport function isParserRule(item: unknown): item is ParserRule {\n    return reflection.isInstance(item, ParserRule.$type);\n}\n\nexport type PrimitiveType = 'Date' | 'bigint' | 'boolean' | 'number' | 'string';\n\nexport interface ReferenceType extends langium.AstNode {\n    readonly $container: ArrayType | ReferenceType | Type | TypeAttribute | UnionType;\n    readonly $type: 'ReferenceType';\n    isMulti: boolean;\n    referenceType: TypeDefinition;\n}\n\nexport const ReferenceType = {\n    $type: 'ReferenceType',\n    isMulti: 'isMulti',\n    referenceType: 'referenceType'\n} as const;\n\nexport function isReferenceType(item: unknown): item is ReferenceType {\n    return reflection.isInstance(item, ReferenceType.$type);\n}\n\nexport interface RegexToken extends TerminalElement {\n    readonly $type: 'RegexToken';\n    regex: string;\n}\n\nexport const RegexToken = {\n    $type: 'RegexToken',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    regex: 'regex'\n} as const;\n\nexport function isRegexToken(item: unknown): item is RegexToken {\n    return reflection.isInstance(item, RegexToken.$type);\n}\n\nexport interface ReturnType extends langium.AstNode {\n    readonly $container: TerminalRule;\n    readonly $type: 'ReturnType';\n    name: PrimitiveType | string;\n}\n\nexport const ReturnType = {\n    $type: 'ReturnType',\n    name: 'name'\n} as const;\n\nexport function isReturnType(item: unknown): item is ReturnType {\n    return reflection.isInstance(item, ReturnType.$type);\n}\n\nexport interface RuleCall extends AbstractElement {\n    readonly $container: InfixRule;\n    readonly $type: 'RuleCall';\n    arguments: Array<NamedArgument>;\n    predicate?: '->' | '=>';\n    rule: langium.Reference<AbstractRule>;\n}\n\nexport const RuleCall = {\n    $type: 'RuleCall',\n    arguments: 'arguments',\n    cardinality: 'cardinality',\n    predicate: 'predicate',\n    rule: 'rule'\n} as const;\n\nexport function isRuleCall(item: unknown): item is RuleCall {\n    return reflection.isInstance(item, RuleCall.$type);\n}\n\nexport interface SimpleType extends langium.AstNode {\n    readonly $container: ArrayType | ReferenceType | Type | TypeAttribute | UnionType;\n    readonly $type: 'SimpleType';\n    primitiveType?: PrimitiveType;\n    stringType?: string;\n    typeRef?: langium.Reference<AbstractType>;\n}\n\nexport const SimpleType = {\n    $type: 'SimpleType',\n    primitiveType: 'primitiveType',\n    stringType: 'stringType',\n    typeRef: 'typeRef'\n} as const;\n\nexport function isSimpleType(item: unknown): item is SimpleType {\n    return reflection.isInstance(item, SimpleType.$type);\n}\n\nexport interface StringLiteral extends langium.AstNode {\n    readonly $container: ArrayLiteral | TypeAttribute;\n    readonly $type: 'StringLiteral';\n    value: string;\n}\n\nexport const StringLiteral = {\n    $type: 'StringLiteral',\n    value: 'value'\n} as const;\n\nexport function isStringLiteral(item: unknown): item is StringLiteral {\n    return reflection.isInstance(item, StringLiteral.$type);\n}\n\nexport interface TerminalAlternatives extends TerminalElement {\n    readonly $type: 'TerminalAlternatives';\n    elements: Array<AbstractElement>;\n}\n\nexport const TerminalAlternatives = {\n    $type: 'TerminalAlternatives',\n    cardinality: 'cardinality',\n    elements: 'elements',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized'\n} as const;\n\nexport function isTerminalAlternatives(item: unknown): item is TerminalAlternatives {\n    return reflection.isInstance(item, TerminalAlternatives.$type);\n}\n\nexport interface TerminalElement extends AbstractElement {\n    readonly $type: 'CharacterRange' | 'NegatedToken' | 'RegexToken' | 'TerminalAlternatives' | 'TerminalElement' | 'TerminalGroup' | 'TerminalRuleCall' | 'UntilToken' | 'Wildcard';\n    lookahead?: '?!' | '?<!' | '?<=' | '?=';\n    parenthesized: boolean;\n}\n\nexport const TerminalElement = {\n    $type: 'TerminalElement',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized'\n} as const;\n\nexport function isTerminalElement(item: unknown): item is TerminalElement {\n    return reflection.isInstance(item, TerminalElement.$type);\n}\n\nexport interface TerminalGroup extends TerminalElement {\n    readonly $type: 'TerminalGroup';\n    elements: Array<AbstractElement>;\n}\n\nexport const TerminalGroup = {\n    $type: 'TerminalGroup',\n    cardinality: 'cardinality',\n    elements: 'elements',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized'\n} as const;\n\nexport function isTerminalGroup(item: unknown): item is TerminalGroup {\n    return reflection.isInstance(item, TerminalGroup.$type);\n}\n\nexport interface TerminalRule extends langium.AstNode {\n    readonly $container: Grammar;\n    readonly $type: 'TerminalRule';\n    definition: TerminalElement;\n    fragment: boolean;\n    hidden: boolean;\n    name: string;\n    type?: ReturnType;\n}\n\nexport const TerminalRule = {\n    $type: 'TerminalRule',\n    definition: 'definition',\n    fragment: 'fragment',\n    hidden: 'hidden',\n    name: 'name',\n    type: 'type'\n} as const;\n\nexport function isTerminalRule(item: unknown): item is TerminalRule {\n    return reflection.isInstance(item, TerminalRule.$type);\n}\n\nexport interface TerminalRuleCall extends TerminalElement {\n    readonly $type: 'TerminalRuleCall';\n    rule: langium.Reference<TerminalRule>;\n}\n\nexport const TerminalRuleCall = {\n    $type: 'TerminalRuleCall',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    rule: 'rule'\n} as const;\n\nexport function isTerminalRuleCall(item: unknown): item is TerminalRuleCall {\n    return reflection.isInstance(item, TerminalRuleCall.$type);\n}\n\nexport interface Type extends langium.AstNode {\n    readonly $container: Grammar;\n    readonly $type: 'Type';\n    name: string;\n    type: TypeDefinition;\n}\n\nexport const Type = {\n    $type: 'Type',\n    name: 'name',\n    type: 'type'\n} as const;\n\nexport function isType(item: unknown): item is Type {\n    return reflection.isInstance(item, Type.$type);\n}\n\nexport interface TypeAttribute extends langium.AstNode {\n    readonly $container: Interface;\n    readonly $type: 'TypeAttribute';\n    defaultValue?: ValueLiteral;\n    isOptional: boolean;\n    name: FeatureName;\n    type: TypeDefinition;\n}\n\nexport const TypeAttribute = {\n    $type: 'TypeAttribute',\n    defaultValue: 'defaultValue',\n    isOptional: 'isOptional',\n    name: 'name',\n    type: 'type'\n} as const;\n\nexport function isTypeAttribute(item: unknown): item is TypeAttribute {\n    return reflection.isInstance(item, TypeAttribute.$type);\n}\n\nexport type TypeDefinition = ArrayType | ReferenceType | SimpleType | UnionType;\n\nexport const TypeDefinition = {\n    $type: 'TypeDefinition'\n} as const;\n\nexport function isTypeDefinition(item: unknown): item is TypeDefinition {\n    return reflection.isInstance(item, TypeDefinition.$type);\n}\n\nexport interface UnionType extends langium.AstNode {\n    readonly $container: ArrayType | ReferenceType | Type | TypeAttribute | UnionType;\n    readonly $type: 'UnionType';\n    types: Array<TypeDefinition>;\n}\n\nexport const UnionType = {\n    $type: 'UnionType',\n    types: 'types'\n} as const;\n\nexport function isUnionType(item: unknown): item is UnionType {\n    return reflection.isInstance(item, UnionType.$type);\n}\n\nexport interface UnorderedGroup extends AbstractElement {\n    readonly $type: 'UnorderedGroup';\n    elements: Array<AbstractElement>;\n}\n\nexport const UnorderedGroup = {\n    $type: 'UnorderedGroup',\n    cardinality: 'cardinality',\n    elements: 'elements'\n} as const;\n\nexport function isUnorderedGroup(item: unknown): item is UnorderedGroup {\n    return reflection.isInstance(item, UnorderedGroup.$type);\n}\n\nexport interface UntilToken extends TerminalElement {\n    readonly $type: 'UntilToken';\n    terminal: AbstractElement;\n}\n\nexport const UntilToken = {\n    $type: 'UntilToken',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    terminal: 'terminal'\n} as const;\n\nexport function isUntilToken(item: unknown): item is UntilToken {\n    return reflection.isInstance(item, UntilToken.$type);\n}\n\nexport type ValueLiteral = ArrayLiteral | BooleanLiteral | NumberLiteral | StringLiteral;\n\nexport const ValueLiteral = {\n    $type: 'ValueLiteral'\n} as const;\n\nexport function isValueLiteral(item: unknown): item is ValueLiteral {\n    return reflection.isInstance(item, ValueLiteral.$type);\n}\n\nexport interface Wildcard extends TerminalElement {\n    readonly $type: 'Wildcard';\n}\n\nexport const Wildcard = {\n    $type: 'Wildcard',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized'\n} as const;\n\nexport function isWildcard(item: unknown): item is Wildcard {\n    return reflection.isInstance(item, Wildcard.$type);\n}\n\nexport type LangiumGrammarAstType = {\n    AbstractElement: AbstractElement\n    AbstractParserRule: AbstractParserRule\n    AbstractRule: AbstractRule\n    AbstractType: AbstractType\n    Action: Action\n    Alternatives: Alternatives\n    ArrayLiteral: ArrayLiteral\n    ArrayType: ArrayType\n    Assignment: Assignment\n    BooleanLiteral: BooleanLiteral\n    CharacterRange: CharacterRange\n    Condition: Condition\n    Conjunction: Conjunction\n    CrossReference: CrossReference\n    Disjunction: Disjunction\n    EndOfFile: EndOfFile\n    Grammar: Grammar\n    GrammarImport: GrammarImport\n    Group: Group\n    InferredType: InferredType\n    InfixRule: InfixRule\n    InfixRuleOperatorList: InfixRuleOperatorList\n    InfixRuleOperators: InfixRuleOperators\n    Interface: Interface\n    Keyword: Keyword\n    NamedArgument: NamedArgument\n    NegatedToken: NegatedToken\n    Negation: Negation\n    NumberLiteral: NumberLiteral\n    Parameter: Parameter\n    ParameterReference: ParameterReference\n    ParserRule: ParserRule\n    ReferenceType: ReferenceType\n    RegexToken: RegexToken\n    ReturnType: ReturnType\n    RuleCall: RuleCall\n    SimpleType: SimpleType\n    StringLiteral: StringLiteral\n    TerminalAlternatives: TerminalAlternatives\n    TerminalElement: TerminalElement\n    TerminalGroup: TerminalGroup\n    TerminalRule: TerminalRule\n    TerminalRuleCall: TerminalRuleCall\n    Type: Type\n    TypeAttribute: TypeAttribute\n    TypeDefinition: TypeDefinition\n    UnionType: UnionType\n    UnorderedGroup: UnorderedGroup\n    UntilToken: UntilToken\n    ValueLiteral: ValueLiteral\n    Wildcard: Wildcard\n}\n\nexport class LangiumGrammarAstReflection extends langium.AbstractAstReflection {\n    override readonly types = {\n        AbstractElement: {\n            name: AbstractElement.$type,\n            properties: {\n                cardinality: {\n                    name: AbstractElement.cardinality,\n                    optional: true\n                }\n            },\n            superTypes: []\n        },\n        AbstractParserRule: {\n            name: AbstractParserRule.$type,\n            properties: {\n            },\n            superTypes: [AbstractRule.$type, AbstractType.$type]\n        },\n        AbstractRule: {\n            name: AbstractRule.$type,\n            properties: {\n            },\n            superTypes: []\n        },\n        AbstractType: {\n            name: AbstractType.$type,\n            properties: {\n            },\n            superTypes: []\n        },\n        Action: {\n            name: Action.$type,\n            properties: {\n                cardinality: {\n                    name: Action.cardinality,\n                    optional: true\n                },\n                feature: {\n                    name: Action.feature,\n                    optional: true\n                },\n                inferredType: {\n                    name: Action.inferredType,\n                    optional: true\n                },\n                operator: {\n                    name: Action.operator,\n                    optional: true\n                },\n                type: {\n                    name: Action.type,\n                    referenceType: AbstractType.$type,\n                    optional: true\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        Alternatives: {\n            name: Alternatives.$type,\n            properties: {\n                cardinality: {\n                    name: Alternatives.cardinality,\n                    optional: true\n                },\n                elements: {\n                    name: Alternatives.elements,\n                    defaultValue: []\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        ArrayLiteral: {\n            name: ArrayLiteral.$type,\n            properties: {\n                elements: {\n                    name: ArrayLiteral.elements,\n                    defaultValue: []\n                }\n            },\n            superTypes: [ValueLiteral.$type]\n        },\n        ArrayType: {\n            name: ArrayType.$type,\n            properties: {\n                elementType: {\n                    name: ArrayType.elementType\n                }\n            },\n            superTypes: [TypeDefinition.$type]\n        },\n        Assignment: {\n            name: Assignment.$type,\n            properties: {\n                cardinality: {\n                    name: Assignment.cardinality,\n                    optional: true\n                },\n                feature: {\n                    name: Assignment.feature\n                },\n                operator: {\n                    name: Assignment.operator\n                },\n                predicate: {\n                    name: Assignment.predicate,\n                    optional: true\n                },\n                terminal: {\n                    name: Assignment.terminal\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        BooleanLiteral: {\n            name: BooleanLiteral.$type,\n            properties: {\n                true: {\n                    name: BooleanLiteral.true,\n                    defaultValue: false\n                }\n            },\n            superTypes: [Condition.$type, ValueLiteral.$type]\n        },\n        CharacterRange: {\n            name: CharacterRange.$type,\n            properties: {\n                cardinality: {\n                    name: CharacterRange.cardinality,\n                    optional: true\n                },\n                left: {\n                    name: CharacterRange.left\n                },\n                lookahead: {\n                    name: CharacterRange.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: CharacterRange.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                },\n                right: {\n                    name: CharacterRange.right,\n                    optional: true\n                }\n            },\n            superTypes: [TerminalElement.$type]\n        },\n        Condition: {\n            name: Condition.$type,\n            properties: {\n            },\n            superTypes: []\n        },\n        Conjunction: {\n            name: Conjunction.$type,\n            properties: {\n                left: {\n                    name: Conjunction.left\n                },\n                right: {\n                    name: Conjunction.right\n                }\n            },\n            superTypes: [Condition.$type]\n        },\n        CrossReference: {\n            name: CrossReference.$type,\n            properties: {\n                cardinality: {\n                    name: CrossReference.cardinality,\n                    optional: true\n                },\n                deprecatedSyntax: {\n                    name: CrossReference.deprecatedSyntax,\n                    defaultValue: false\n                },\n                isMulti: {\n                    name: CrossReference.isMulti,\n                    defaultValue: false\n                },\n                terminal: {\n                    name: CrossReference.terminal,\n                    optional: true\n                },\n                type: {\n                    name: CrossReference.type,\n                    referenceType: AbstractType.$type\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        Disjunction: {\n            name: Disjunction.$type,\n            properties: {\n                left: {\n                    name: Disjunction.left\n                },\n                right: {\n                    name: Disjunction.right\n                }\n            },\n            superTypes: [Condition.$type]\n        },\n        EndOfFile: {\n            name: EndOfFile.$type,\n            properties: {\n                cardinality: {\n                    name: EndOfFile.cardinality,\n                    optional: true\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        Grammar: {\n            name: Grammar.$type,\n            properties: {\n                imports: {\n                    name: Grammar.imports,\n                    defaultValue: []\n                },\n                interfaces: {\n                    name: Grammar.interfaces,\n                    defaultValue: []\n                },\n                isDeclared: {\n                    name: Grammar.isDeclared,\n                    defaultValue: false\n                },\n                name: {\n                    name: Grammar.name,\n                    optional: true\n                },\n                rules: {\n                    name: Grammar.rules,\n                    defaultValue: []\n                },\n                types: {\n                    name: Grammar.types,\n                    defaultValue: []\n                }\n            },\n            superTypes: []\n        },\n        GrammarImport: {\n            name: GrammarImport.$type,\n            properties: {\n                path: {\n                    name: GrammarImport.path\n                }\n            },\n            superTypes: []\n        },\n        Group: {\n            name: Group.$type,\n            properties: {\n                cardinality: {\n                    name: Group.cardinality,\n                    optional: true\n                },\n                elements: {\n                    name: Group.elements,\n                    defaultValue: []\n                },\n                guardCondition: {\n                    name: Group.guardCondition,\n                    optional: true\n                },\n                predicate: {\n                    name: Group.predicate,\n                    optional: true\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        InferredType: {\n            name: InferredType.$type,\n            properties: {\n                name: {\n                    name: InferredType.name\n                }\n            },\n            superTypes: [AbstractType.$type]\n        },\n        InfixRule: {\n            name: InfixRule.$type,\n            properties: {\n                call: {\n                    name: InfixRule.call\n                },\n                dataType: {\n                    name: InfixRule.dataType,\n                    optional: true\n                },\n                inferredType: {\n                    name: InfixRule.inferredType,\n                    optional: true\n                },\n                name: {\n                    name: InfixRule.name\n                },\n                operators: {\n                    name: InfixRule.operators\n                },\n                parameters: {\n                    name: InfixRule.parameters,\n                    defaultValue: []\n                },\n                returnType: {\n                    name: InfixRule.returnType,\n                    referenceType: AbstractType.$type,\n                    optional: true\n                }\n            },\n            superTypes: [AbstractParserRule.$type]\n        },\n        InfixRuleOperatorList: {\n            name: InfixRuleOperatorList.$type,\n            properties: {\n                associativity: {\n                    name: InfixRuleOperatorList.associativity,\n                    optional: true\n                },\n                operators: {\n                    name: InfixRuleOperatorList.operators,\n                    defaultValue: []\n                }\n            },\n            superTypes: []\n        },\n        InfixRuleOperators: {\n            name: InfixRuleOperators.$type,\n            properties: {\n                precedences: {\n                    name: InfixRuleOperators.precedences,\n                    defaultValue: []\n                }\n            },\n            superTypes: []\n        },\n        Interface: {\n            name: Interface.$type,\n            properties: {\n                attributes: {\n                    name: Interface.attributes,\n                    defaultValue: []\n                },\n                name: {\n                    name: Interface.name\n                },\n                superTypes: {\n                    name: Interface.superTypes,\n                    defaultValue: [],\n                    referenceType: AbstractType.$type\n                }\n            },\n            superTypes: [AbstractType.$type]\n        },\n        Keyword: {\n            name: Keyword.$type,\n            properties: {\n                cardinality: {\n                    name: Keyword.cardinality,\n                    optional: true\n                },\n                predicate: {\n                    name: Keyword.predicate,\n                    optional: true\n                },\n                value: {\n                    name: Keyword.value\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        NamedArgument: {\n            name: NamedArgument.$type,\n            properties: {\n                calledByName: {\n                    name: NamedArgument.calledByName,\n                    defaultValue: false\n                },\n                parameter: {\n                    name: NamedArgument.parameter,\n                    referenceType: Parameter.$type,\n                    optional: true\n                },\n                value: {\n                    name: NamedArgument.value\n                }\n            },\n            superTypes: []\n        },\n        NegatedToken: {\n            name: NegatedToken.$type,\n            properties: {\n                cardinality: {\n                    name: NegatedToken.cardinality,\n                    optional: true\n                },\n                lookahead: {\n                    name: NegatedToken.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: NegatedToken.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                },\n                terminal: {\n                    name: NegatedToken.terminal\n                }\n            },\n            superTypes: [TerminalElement.$type]\n        },\n        Negation: {\n            name: Negation.$type,\n            properties: {\n                value: {\n                    name: Negation.value\n                }\n            },\n            superTypes: [Condition.$type]\n        },\n        NumberLiteral: {\n            name: NumberLiteral.$type,\n            properties: {\n                value: {\n                    name: NumberLiteral.value\n                }\n            },\n            superTypes: [ValueLiteral.$type]\n        },\n        Parameter: {\n            name: Parameter.$type,\n            properties: {\n                name: {\n                    name: Parameter.name\n                }\n            },\n            superTypes: []\n        },\n        ParameterReference: {\n            name: ParameterReference.$type,\n            properties: {\n                parameter: {\n                    name: ParameterReference.parameter,\n                    referenceType: Parameter.$type\n                }\n            },\n            superTypes: [Condition.$type]\n        },\n        ParserRule: {\n            name: ParserRule.$type,\n            properties: {\n                dataType: {\n                    name: ParserRule.dataType,\n                    optional: true\n                },\n                definition: {\n                    name: ParserRule.definition\n                },\n                entry: {\n                    name: ParserRule.entry,\n                    defaultValue: false\n                },\n                fragment: {\n                    name: ParserRule.fragment,\n                    defaultValue: false\n                },\n                inferredType: {\n                    name: ParserRule.inferredType,\n                    optional: true\n                },\n                name: {\n                    name: ParserRule.name\n                },\n                parameters: {\n                    name: ParserRule.parameters,\n                    defaultValue: []\n                },\n                returnType: {\n                    name: ParserRule.returnType,\n                    referenceType: AbstractType.$type,\n                    optional: true\n                }\n            },\n            superTypes: [AbstractParserRule.$type]\n        },\n        ReferenceType: {\n            name: ReferenceType.$type,\n            properties: {\n                isMulti: {\n                    name: ReferenceType.isMulti,\n                    defaultValue: false\n                },\n                referenceType: {\n                    name: ReferenceType.referenceType\n                }\n            },\n            superTypes: [TypeDefinition.$type]\n        },\n        RegexToken: {\n            name: RegexToken.$type,\n            properties: {\n                cardinality: {\n                    name: RegexToken.cardinality,\n                    optional: true\n                },\n                lookahead: {\n                    name: RegexToken.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: RegexToken.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                },\n                regex: {\n                    name: RegexToken.regex\n                }\n            },\n            superTypes: [TerminalElement.$type]\n        },\n        ReturnType: {\n            name: ReturnType.$type,\n            properties: {\n                name: {\n                    name: ReturnType.name\n                }\n            },\n            superTypes: []\n        },\n        RuleCall: {\n            name: RuleCall.$type,\n            properties: {\n                arguments: {\n                    name: RuleCall.arguments,\n                    defaultValue: []\n                },\n                cardinality: {\n                    name: RuleCall.cardinality,\n                    optional: true\n                },\n                predicate: {\n                    name: RuleCall.predicate,\n                    optional: true\n                },\n                rule: {\n                    name: RuleCall.rule,\n                    referenceType: AbstractRule.$type\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        SimpleType: {\n            name: SimpleType.$type,\n            properties: {\n                primitiveType: {\n                    name: SimpleType.primitiveType,\n                    optional: true\n                },\n                stringType: {\n                    name: SimpleType.stringType,\n                    optional: true\n                },\n                typeRef: {\n                    name: SimpleType.typeRef,\n                    referenceType: AbstractType.$type,\n                    optional: true\n                }\n            },\n            superTypes: [TypeDefinition.$type]\n        },\n        StringLiteral: {\n            name: StringLiteral.$type,\n            properties: {\n                value: {\n                    name: StringLiteral.value\n                }\n            },\n            superTypes: [ValueLiteral.$type]\n        },\n        TerminalAlternatives: {\n            name: TerminalAlternatives.$type,\n            properties: {\n                cardinality: {\n                    name: TerminalAlternatives.cardinality,\n                    optional: true\n                },\n                elements: {\n                    name: TerminalAlternatives.elements,\n                    defaultValue: []\n                },\n                lookahead: {\n                    name: TerminalAlternatives.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: TerminalAlternatives.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                }\n            },\n            superTypes: [TerminalElement.$type]\n        },\n        TerminalElement: {\n            name: TerminalElement.$type,\n            properties: {\n                cardinality: {\n                    name: TerminalElement.cardinality,\n                    optional: true\n                },\n                lookahead: {\n                    name: TerminalElement.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: TerminalElement.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        TerminalGroup: {\n            name: TerminalGroup.$type,\n            properties: {\n                cardinality: {\n                    name: TerminalGroup.cardinality,\n                    optional: true\n                },\n                elements: {\n                    name: TerminalGroup.elements,\n                    defaultValue: []\n                },\n                lookahead: {\n                    name: TerminalGroup.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: TerminalGroup.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                }\n            },\n            superTypes: [TerminalElement.$type]\n        },\n        TerminalRule: {\n            name: TerminalRule.$type,\n            properties: {\n                definition: {\n                    name: TerminalRule.definition\n                },\n                fragment: {\n                    name: TerminalRule.fragment,\n                    defaultValue: false\n                },\n                hidden: {\n                    name: TerminalRule.hidden,\n                    defaultValue: false\n                },\n                name: {\n                    name: TerminalRule.name\n                },\n                type: {\n                    name: TerminalRule.type,\n                    optional: true\n                }\n            },\n            superTypes: [AbstractRule.$type]\n        },\n        TerminalRuleCall: {\n            name: TerminalRuleCall.$type,\n            properties: {\n                cardinality: {\n                    name: TerminalRuleCall.cardinality,\n                    optional: true\n                },\n                lookahead: {\n                    name: TerminalRuleCall.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: TerminalRuleCall.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                },\n                rule: {\n                    name: TerminalRuleCall.rule,\n                    referenceType: TerminalRule.$type\n                }\n            },\n            superTypes: [TerminalElement.$type]\n        },\n        Type: {\n            name: Type.$type,\n            properties: {\n                name: {\n                    name: Type.name\n                },\n                type: {\n                    name: Type.type\n                }\n            },\n            superTypes: [AbstractType.$type]\n        },\n        TypeAttribute: {\n            name: TypeAttribute.$type,\n            properties: {\n                defaultValue: {\n                    name: TypeAttribute.defaultValue,\n                    optional: true\n                },\n                isOptional: {\n                    name: TypeAttribute.isOptional,\n                    defaultValue: false\n                },\n                name: {\n                    name: TypeAttribute.name\n                },\n                type: {\n                    name: TypeAttribute.type\n                }\n            },\n            superTypes: []\n        },\n        TypeDefinition: {\n            name: TypeDefinition.$type,\n            properties: {\n            },\n            superTypes: []\n        },\n        UnionType: {\n            name: UnionType.$type,\n            properties: {\n                types: {\n                    name: UnionType.types,\n                    defaultValue: []\n                }\n            },\n            superTypes: [TypeDefinition.$type]\n        },\n        UnorderedGroup: {\n            name: UnorderedGroup.$type,\n            properties: {\n                cardinality: {\n                    name: UnorderedGroup.cardinality,\n                    optional: true\n                },\n                elements: {\n                    name: UnorderedGroup.elements,\n                    defaultValue: []\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        UntilToken: {\n            name: UntilToken.$type,\n            properties: {\n                cardinality: {\n                    name: UntilToken.cardinality,\n                    optional: true\n                },\n                lookahead: {\n                    name: UntilToken.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: UntilToken.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                },\n                terminal: {\n                    name: UntilToken.terminal\n                }\n            },\n            superTypes: [TerminalElement.$type]\n        },\n        ValueLiteral: {\n            name: ValueLiteral.$type,\n            properties: {\n            },\n            superTypes: []\n        },\n        Wildcard: {\n            name: Wildcard.$type,\n            properties: {\n                cardinality: {\n                    name: Wildcard.cardinality,\n                    optional: true\n                },\n                lookahead: {\n                    name: Wildcard.lookahead,\n                    optional: true\n                },\n                parenthesized: {\n                    name: Wildcard.parenthesized,\n                    defaultValue: false,\n                    optional: true\n                }\n            },\n            superTypes: [TerminalElement.$type]\n        }\n    } as const satisfies langium.AstMetaData\n}\n\nexport const reflection = new LangiumGrammarAstReflection();\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { Range } from 'vscode-languageserver-types';\nimport type { AstNode, AstReflection, CstNode, GenericAstNode, MultiReference, Mutable, PropertyType, Reference, ReferenceInfo } from '../syntax-tree.js';\nimport type { Stream, TreeStream } from './stream.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport { isAstNode, isMultiReference, isReference } from '../syntax-tree.js';\nimport { DONE_RESULT, StreamImpl, TreeStreamImpl } from './stream.js';\nimport { inRange } from './cst-utils.js';\n\n/**\n * Link the `$container` and other related properties of every AST node that is directly contained\n * in the given `node`.\n */\nexport function linkContentToContainer(node: AstNode, options: {\n    /**\n     * If true, the function will also link the content of the contained nodes.\n     * Otherwise, only the immediate children of the given node are linked to their container.\n     */\n    deep?: boolean\n} = {}): void {\n    for (const [name, value] of Object.entries(node)) {\n        if (!name.startsWith('$')) {\n            if (Array.isArray(value)) {\n                value.forEach((item, index) => {\n                    if (isAstNode(item)) {\n                        (item as Mutable<AstNode>).$container = node;\n                        (item as Mutable<AstNode>).$containerProperty = name;\n                        (item as Mutable<AstNode>).$containerIndex = index;\n                        if (options.deep) {\n                            linkContentToContainer(item, options);\n                        }\n                    }\n                });\n            } else if (isAstNode(value)) {\n                (value as Mutable<AstNode>).$container = node;\n                (value as Mutable<AstNode>).$containerProperty = name;\n                if (options.deep) {\n                    linkContentToContainer(value, options);\n                }\n            }\n        }\n    }\n}\n\n/**\n * Walk along the hierarchy of containers from the given AST node to the root and return the first\n * node that matches the type predicate. If the start node itself matches, it is returned.\n * If no container matches, `undefined` is returned.\n */\nexport function getContainerOfType<T extends AstNode>(node: AstNode | undefined, typePredicate: (n: AstNode) => n is T): T | undefined {\n    let item = node;\n    while (item) {\n        if (typePredicate(item)) {\n            return item;\n        }\n        item = item.$container;\n    }\n    return undefined;\n}\n\n/**\n * Walk along the hierarchy of containers from the given AST node to the root and check for existence\n * of a container that matches the given predicate. The start node is included in the checks.\n */\nexport function hasContainerOfType(node: AstNode | undefined, predicate: (n: AstNode) => boolean): boolean {\n    let item = node;\n    while (item) {\n        if (predicate(item)) {\n            return true;\n        }\n        item = item.$container;\n    }\n    return false;\n}\n\n/**\n * Retrieve the document in which the given AST node is contained. A reference to the document is\n * usually held by the root node of the AST.\n *\n * @throws an error if the node is not contained in a document.\n */\nexport function getDocument<T extends AstNode = AstNode>(node: AstNode): LangiumDocument<T> {\n    const rootNode = findRootNode(node);\n    const result = rootNode.$document;\n    if (!result) {\n        throw new Error('AST node has no document.');\n    }\n    return result as LangiumDocument<T>;\n}\n\n/**\n * Returns the root node of the given AST node by following the `$container` references.\n */\nexport function findRootNode(node: AstNode): AstNode {\n    while (node.$container) {\n        node = node.$container;\n    }\n    return node;\n}\n\n/**\n * Returns all AST nodes that are referenced by the given reference or multi-reference.\n */\nexport function getReferenceNodes(reference: Reference | MultiReference): AstNode[] {\n    if (isReference(reference)) {\n        return reference.ref ? [reference.ref] : [];\n    } else if (isMultiReference(reference)) {\n        return reference.items.map(item => item.ref);\n    }\n    return [];\n}\n\nexport interface AstStreamOptions {\n    /**\n     * Optional target range that the nodes in the stream need to intersect\n     */\n    range?: Range\n}\n\n/**\n * Create a stream of all AST nodes that are directly contained in the given node. This includes\n * single-valued as well as multi-valued (array) properties.\n */\nexport function streamContents(node: AstNode, options?: AstStreamOptions): Stream<AstNode> {\n    if (!node) {\n        throw new Error('Node must be an AstNode.');\n    }\n    const range = options?.range;\n    type State = { keys: string[], keyIndex: number, arrayIndex: number };\n    return new StreamImpl<State, AstNode>(() => ({\n        keys: Object.keys(node),\n        keyIndex: 0,\n        arrayIndex: 0\n    }), state => {\n        while (state.keyIndex < state.keys.length) {\n            const property = state.keys[state.keyIndex];\n            if (!property.startsWith('$')) {\n                const value = (node as GenericAstNode)[property];\n                if (isAstNode(value)) {\n                    state.keyIndex++;\n                    if (isAstNodeInRange(value, range)) {\n                        return { done: false, value };\n                    }\n                } else if (Array.isArray(value)) {\n                    while (state.arrayIndex < value.length) {\n                        const index = state.arrayIndex++;\n                        const element = value[index];\n                        if (isAstNode(element) && isAstNodeInRange(element, range)) {\n                            return { done: false, value: element };\n                        }\n                    }\n                    state.arrayIndex = 0;\n                }\n            }\n            state.keyIndex++;\n        }\n        return DONE_RESULT;\n    });\n}\n\n/**\n * Create a stream of all AST nodes that are directly and indirectly contained in the given root node.\n * This does not include the root node itself.\n */\nexport function streamAllContents(root: AstNode, options?: AstStreamOptions): TreeStream<AstNode> {\n    if (!root) {\n        throw new Error('Root node must be an AstNode.');\n    }\n    return new TreeStreamImpl(root, node => streamContents(node, options));\n}\n\n/**\n * Create a stream of all AST nodes that are directly and indirectly contained in the given root node,\n * including the root node itself.\n */\nexport function streamAst(root: AstNode, options?: AstStreamOptions): TreeStream<AstNode> {\n    if (!root) {\n        throw new Error('Root node must be an AstNode.');\n    } else if (options?.range && !isAstNodeInRange(root, options.range)) {\n        // Return an empty stream if the root node isn't in range\n        return new TreeStreamImpl(root, () => []);\n    }\n    return new TreeStreamImpl(root, node => streamContents(node, options), { includeRoot: true });\n}\n\nfunction isAstNodeInRange(astNode: AstNode, range?: Range): boolean {\n    if (!range) {\n        return true;\n    }\n    const nodeRange = astNode.$cstNode?.range;\n    if (!nodeRange) {\n        return false;\n    }\n    return inRange(nodeRange, range);\n}\n\n/**\n * Create a stream of all cross-references that are held by the given AST node. This includes\n * single-valued as well as multi-valued (array) properties.\n */\nexport function streamReferences(node: AstNode): Stream<ReferenceInfo> {\n    type State = { keys: string[], keyIndex: number, arrayIndex: number };\n    return new StreamImpl<State, ReferenceInfo>(() => ({\n        keys: Object.keys(node),\n        keyIndex: 0,\n        arrayIndex: 0\n    }), state => {\n        while (state.keyIndex < state.keys.length) {\n            const property = state.keys[state.keyIndex];\n            if (!property.startsWith('$')) {\n                const value = (node as GenericAstNode)[property];\n                if (isReference(value) || isMultiReference(value)) {\n                    state.keyIndex++;\n                    return { done: false, value: { reference: value, container: node, property } };\n                } else if (Array.isArray(value)) {\n                    while (state.arrayIndex < value.length) {\n                        const index = state.arrayIndex++;\n                        const element = value[index];\n                        if (isReference(element) || isMultiReference(value)) {\n                            return { done: false, value: { reference: element, container: node, property, index } };\n                        }\n                    }\n                    state.arrayIndex = 0;\n                }\n            }\n            state.keyIndex++;\n        }\n        return DONE_RESULT;\n    });\n}\n\n/**\n * Assigns all mandatory AST properties to the specified node.\n *\n * @param reflection Reflection object used to gather mandatory properties for the node.\n * @param node Specified node is modified in place and properties are directly assigned.\n */\nexport function assignMandatoryProperties(reflection: AstReflection, node: AstNode): void {\n    const typeMetaData = reflection.getTypeMetaData(node.$type);\n    const genericNode = node as GenericAstNode;\n    for (const property of Object.values(typeMetaData.properties)) {\n        // Only set the value if the property is not already set and if it has a default value\n        if (property.defaultValue !== undefined && genericNode[property.name] === undefined) {\n            genericNode[property.name] = copyDefaultValue(property.defaultValue);\n        }\n    }\n}\n\nfunction copyDefaultValue(propertyType: PropertyType): PropertyType {\n    if (Array.isArray(propertyType)) {\n        return [...propertyType.map(copyDefaultValue)];\n    } else {\n        return propertyType;\n    }\n}\n\n/**\n * Creates a deep copy of the specified AST node.\n * The resulting copy will only contain semantically relevant information, such as the `$type` property and AST properties.\n *\n * @param node The AST node to deeply copy.\n * @param buildReference References are not copied, instead this function is called to rebuild them.\n * @param trace For the sake of tracking copied nodes and their originals a `trace` map can be provided (optional).\n */\nexport function copyAstNode<T extends AstNode = AstNode>(node: T, buildReference: (node: AstNode, property: string, refNode: CstNode | undefined, refText: string, origReference: Reference<AstNode>) => Reference<AstNode>, trace?: Map<AstNode, AstNode>): T {\n    const copy: GenericAstNode = { $type: node.$type };\n\n    if (trace) {\n        trace.set(node, copy);\n        trace.set(copy, node);\n    }\n\n    for (const [name, value] of Object.entries(node)) {\n        if (!name.startsWith('$')) {\n            if (isAstNode(value)) {\n                copy[name] = copyAstNode(value, buildReference, trace);\n            } else if (isReference(value)) {\n                copy[name] = buildReference(\n                    copy,\n                    name,\n                    value.$refNode,\n                    value.$refText,\n                    value\n                );\n            } else if (Array.isArray(value)) {\n                const copiedArray: unknown[] = [];\n                for (const element of value) {\n                    if (isAstNode(element)) {\n                        copiedArray.push(copyAstNode(element, buildReference, trace));\n                    } else if (isReference(element)) {\n                        copiedArray.push(\n                            buildReference(\n                                copy,\n                                name,\n                                element.$refNode,\n                                element.$refText,\n                                element\n                            )\n                        );\n                    } else {\n                        copiedArray.push(element);\n                    }\n                }\n                copy[name] = copiedArray;\n            } else {\n                copy[name] = value;\n            }\n        }\n    }\n\n    linkContentToContainer(copy, { deep: true });\n    return copy as unknown as T;\n}\n\n/**\n * Recursively makes all properties of an AstNode optional, except for those\n * that start with a dollar sign ($) or are of type boolean or are of type array.\n * If the type is a Reference or an Array, it applies the transformation recursively\n * to the inner type.\n * Otherwise the type is returned as is.\n *\n * @template T - The type to be transformed.\n*/\nexport type DeepPartialAstNode<T> =\n    // if T is a Reference<U> transform it to Reference<DeepPartialAstNode<U>>\n    T extends Reference<infer U extends AstNode> ? Reference<DeepPartialAstNode<U>> :\n        // if T is an AstNode\n        T extends AstNode ? {\n            // transform the type of each property starting with '$' or with a boolean or array type\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            [K in keyof T as K extends `$${string}` | (T[K] extends (boolean | any[]) ? K : never) ? K : never]: DeepPartialAstNode<T[K]>;\n        } & {\n            // force the property as optional and transform its type for each property not starting with '$' or with a type different from boolean or array type\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            [K in keyof T as K extends `$${string}` ? never: T[K] extends (boolean | any[]) ? never : K]?: DeepPartialAstNode<T[K]>;\n        } :\n            // if T is an Array<U> convert to Array<DeepPartialAstNode<U>>\n            T extends Array<infer U> ? Array<DeepPartialAstNode<U>> :\n                // otherwise keep T as is\n                T;\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\n/**\n * A stream is a read-only sequence of values. While the contents of an array can be accessed\n * both sequentially and randomly (via index), a stream allows only sequential access.\n *\n * The advantage of this is that a stream can be evaluated lazily, so it does not require\n * to store intermediate values. This can boost performance when a large sequence is\n * processed via filtering, mapping etc. and accessed at most once. However, lazy\n * evaluation means that all processing is repeated when you access the sequence multiple\n * times; in such a case, it may be better to store the resulting sequence into an array.\n */\nexport interface Stream<T> extends Iterable<T> {\n\n    /**\n     * Returns an iterator for this stream. This is the same as calling the `Symbol.iterator` function property.\n     */\n    iterator(): IterableIterator<T>;\n\n    /**\n     * Determines whether this stream contains no elements.\n     */\n    isEmpty(): boolean;\n\n    /**\n     * Determines the number of elements in this stream.\n     */\n    count(): number;\n\n    /**\n     * Collects all elements of this stream into an array.\n     */\n    toArray(): T[];\n\n    /**\n     * Collects all elements of this stream into a Set.\n     */\n    toSet(): Set<T>;\n\n    /**\n     * Collects all elements of this stream into a Map, applying the provided functions to determine keys and values.\n     *\n     * @param keyFn The function to derive map keys. If omitted, the stream elements are used as keys.\n     * @param valueFn The function to derive map values. If omitted, the stream elements are used as values.\n     */\n    toMap<K = T, V = T>(keyFn?: (e: T) => K, valueFn?: (e: T) => V): Map<K, V>;\n\n    /**\n     * Returns a string representation of a stream.\n     */\n    toString(): string;\n\n    /**\n     * Combines two streams by returning a new stream that yields all elements of this stream and the other stream.\n     *\n     * @param other Stream to be concatenated with this one.\n     */\n    concat<T2>(other: Iterable<T2>): Stream<T | T2>;\n\n    /**\n     * Adds all elements of the stream into a string, separated by the specified separator string.\n     *\n     * @param separator A string used to separate one element of the stream from the next in the resulting string.\n     *        If omitted, the steam elements are separated with a comma.\n     */\n    join(separator?: string): string\n\n    /**\n     * Returns the index of the first occurrence of a value in the stream, or -1 if it is not present.\n     *\n     * @param searchElement The value to locate in the array.\n     * @param fromIndex The stream index at which to begin the search. If fromIndex is omitted, the search\n     *        starts at index 0.\n     */\n    indexOf(searchElement: T, fromIndex?: number): number;\n\n    /**\n     * Determines whether all members of the stream satisfy the specified test.\n     *\n     * @param predicate This method calls the predicate function for each element in the stream until the\n     *        predicate returns a value which is coercible to the Boolean value `false`, or until the end\n     *        of the stream.\n     */\n    every<S extends T>(predicate: (value: T) => value is S): this is Stream<S>;\n    every(predicate: (value: T) => unknown): boolean;\n\n    /**\n     * Determines whether any member of the stream satisfies the specified test.\n     *\n     * @param predicate This method calls the predicate function for each element in the stream until the\n     *        predicate returns a value which is coercible to the Boolean value `true`, or until the end\n     *        of the stream.\n     */\n    some(predicate: (value: T) => unknown): boolean;\n\n    /**\n     * Performs the specified action for each element in the stream.\n     *\n     * @param callbackfn Function called once for each element in the stream.\n     */\n    forEach(callbackfn: (value: T, index: number) => void): void;\n\n    /**\n     * Returns a stream that yields the results of calling the specified callback function on each element\n     * of the stream. The function is called when the resulting stream elements are actually accessed, so\n     * accessing the resulting stream multiple times means the function is also called multiple times for\n     * each element of the stream.\n     *\n     * @param callbackfn Lazily evaluated function mapping stream elements.\n     */\n    map<U>(callbackfn: (value: T) => U): Stream<U>;\n\n    /**\n     * Returns the elements of the stream that meet the condition specified in a callback function.\n     * The function is called when the resulting stream elements are actually accessed, so accessing the\n     * resulting stream multiple times means the function is also called multiple times for each element\n     * of the stream.\n     *\n     * @param predicate Lazily evaluated function checking a condition on stream elements.\n     */\n    filter<S extends T>(predicate: (value: T) => value is S): Stream<S>;\n    filter(predicate: (value: T) => unknown): Stream<T>;\n\n    /**\n     * Returns the elements of the stream that are _non-nullable_, which means they are neither `undefined`\n     * nor `null`.\n     */\n    nonNullable(): Stream<NonNullable<T>>;\n\n    /**\n     * Calls the specified callback function for all elements in the stream. The return value of the\n     * callback function is the accumulated result, and is provided as an argument in the next call to\n     * the callback function.\n     *\n     * @param callbackfn This method calls the function once for each element in the stream, providing\n     *        the previous and current values of the reduction.\n     * @param initialValue If specified, `initialValue` is used as the initial value to start the\n     *        accumulation. The first call to the function provides this value as an argument instead\n     *        of a stream value.\n     */\n    reduce(callbackfn: (previousValue: T, currentValue: T) => T): T | undefined;\n    reduce<U = T>(callbackfn: (previousValue: U, currentValue: T) => U, initialValue: U): U;\n\n    /**\n     * Calls the specified callback function for all elements in the stream, in descending order.\n     * The return value of the callback function is the accumulated result, and is provided as an\n     * argument in the next call to the callback function.\n     *\n     * @param callbackfn This method calls the function once for each element in the stream, providing\n     *        the previous and current values of the reduction.\n     * @param initialValue If specified, `initialValue` is used as the initial value to start the\n     *        accumulation. The first call to the function provides this value as an argument instead\n     *        of an array value.\n     */\n    reduceRight(callbackfn: (previousValue: T, currentValue: T) => T): T | undefined;\n    reduceRight<U = T>(callbackfn: (previousValue: U, currentValue: T) => U, initialValue: U): U;\n\n    /**\n     * Returns the value of the first element in the stream that meets the condition, or `undefined`\n     * if there is no such element.\n     *\n     * @param predicate This method calls `predicate` once for each element of the stream, in ascending\n     *        order, until it finds one where `predicate` returns a value which is coercible to the\n     *        Boolean value `true`.\n     */\n    find<S extends T>(predicate: (value: T) => value is S): S | undefined;\n    find(predicate: (value: T) => unknown): T | undefined;\n\n    /**\n     * Returns the index of the first element in the stream that meets the condition, or `-1`\n     * if there is no such element.\n     *\n     * @param predicate This method calls `predicate` once for each element of the stream, in ascending\n     *        order, until it finds one where `predicate` returns a value which is coercible to the\n     *        Boolean value `true`.\n     */\n    findIndex(predicate: (value: T) => unknown): number;\n\n    /**\n     * Determines whether the stream includes a certain element, returning `true` or `false` as appropriate.\n     *\n     * @param searchElement The element to search for.\n     */\n    includes(searchElement: T): boolean;\n\n    /**\n     * Calls a defined callback function on each element of the stream and then flattens the result into\n     * a new stream. This is identical to a `map` followed by `flat` with depth 1.\n     *\n     * @param callbackfn Lazily evaluated function mapping stream elements.\n     */\n    flatMap<U>(callbackfn: (value: T) => U | Iterable<U>): Stream<U>;\n\n    /**\n     * Returns a new stream with all sub-stream or sub-array elements concatenated into it recursively up\n     * to the specified depth.\n     *\n     * @param depth The maximum recursion depth. Defaults to 1.\n     */\n    flat<D extends number = 1>(depth?: D): FlatStream<T, D>;\n\n    /**\n     * Returns the first element in the stream, or `undefined` if the stream is empty.\n     */\n    head(): T | undefined;\n\n    /**\n     * Returns a stream that skips the first `skipCount` elements from this stream.\n     *\n     * @param skipCount The number of elements to skip. If this is larger than the number of elements in\n     *        the stream, an empty stream is returned. Defaults to 1.\n     */\n    tail(skipCount?: number): Stream<T>;\n\n    /**\n     * Returns a stream consisting of the elements of this stream, truncated to be no longer than `maxSize`\n     * in length.\n     *\n     * @param maxSize The number of elements the stream should be limited to\n     */\n    limit(maxSize: number): Stream<T>;\n\n    /**\n     * Returns a stream containing only the distinct elements from this stream.\n     * Equality is determined with the same rules as a standard `Set`.\n     *\n     * @param by A function returning the key used to check equality with a previous stream element.\n     *        If omitted, the stream elements themselves are used for comparison.\n     */\n    distinct<Key = T>(by?: (element: T) => Key): Stream<T>;\n\n    /**\n     * Returns a stream that contains all elements that don't exist in the {@link other} iterable.\n     * Equality is determined with the same rules as a standard `Set`.\n     * @param other The elements that should be exluded from this stream.\n     * @param key A function returning the key used to check quality.\n     *        If omitted, the stream elements themselves are used for comparison.\n     */\n    exclude<Key = T>(other: Iterable<T>, key?: (element: T) => Key): Stream<T>;\n\n}\n\nexport type FlatStream<T, Depth extends number> = {\n    'done': Stream<T>,\n    'recur': T extends Iterable<infer Content>\n        ? FlatStream<Content, MinusOne<Depth>>\n        : Stream<T>\n}[Depth extends 0 ? 'done' : 'recur'];\n\nexport type MinusOne<N extends number> = [-1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20][N];\n\n/**\n * The default implementation of `Stream` works with two input functions:\n *  - The first function creates the initial state of an iteration.\n *  - The second function gets the current state as argument and returns an `IteratorResult`.\n */\nexport class StreamImpl<S, T> implements Stream<T> {\n    protected readonly startFn: () => S;\n    protected readonly nextFn: (state: S) => IteratorResult<T>;\n\n    constructor(startFn: () => S, nextFn: (state: S) => IteratorResult<T, undefined>) {\n        this.startFn = startFn;\n        this.nextFn = nextFn;\n    }\n\n    iterator(): IterableIterator<T> {\n        const iterator = {\n            state: this.startFn(),\n            next: () => this.nextFn(iterator.state),\n            [Symbol.iterator]: () => iterator\n        };\n        return iterator;\n    }\n\n    [Symbol.iterator](): Iterator<T> {\n        return this.iterator();\n    }\n\n    isEmpty(): boolean {\n        const iterator = this.iterator();\n        return Boolean(iterator.next().done);\n    }\n\n    count(): number {\n        const iterator = this.iterator();\n        let count = 0;\n        let next = iterator.next();\n        while (!next.done) {\n            count++;\n            next = iterator.next();\n        }\n        return count;\n    }\n\n    toArray(): T[] {\n        const result: T[] = [];\n        const iterator = this.iterator();\n        let next: IteratorResult<T>;\n        do {\n            next = iterator.next();\n            if (next.value !== undefined) {\n                result.push(next.value);\n            }\n        } while (!next.done);\n        return result;\n    }\n\n    toSet(): Set<T> {\n        return new Set(this);\n    }\n\n    toMap<K = T, V = T>(keyFn?: (e: T) => K, valueFn?: (e: T) => V): Map<K, V> {\n        const entryStream = this.map(element => <[K, V]>[\n            keyFn ? keyFn(element) : element,\n            valueFn ? valueFn(element) : element\n        ]);\n        return new Map(entryStream);\n    }\n\n    toString(): string {\n        return this.join();\n    }\n\n    concat<T2>(other: Iterable<T2>): Stream<T | T2> {\n        return new StreamImpl<{ first: S, firstDone: boolean, iterator: Iterator<T2, unknown, undefined> }, T | T2>(\n            () => ({ first: this.startFn(), firstDone: false, iterator: other[Symbol.iterator]() }),\n            state => {\n                let result: IteratorResult<T | T2>;\n                if (!state.firstDone) {\n                    do {\n                        result = this.nextFn(state.first);\n                        if (!result.done) {\n                            return result;\n                        }\n                    } while (!result.done);\n                    state.firstDone = true;\n                }\n                do {\n                    result = state.iterator.next();\n                    if (!result.done) {\n                        return result;\n                    }\n                } while (!result.done);\n                return DONE_RESULT;\n            }\n        );\n    }\n\n    join(separator = ','): string {\n        const iterator = this.iterator();\n        let value = '';\n        let result: IteratorResult<T>;\n        let addSeparator = false;\n        do {\n            result = iterator.next();\n            if (!result.done) {\n                if (addSeparator) {\n                    value += separator;\n                }\n                value += toString(result.value);\n            }\n            addSeparator = true;\n        } while (!result.done);\n        return value;\n    }\n\n    indexOf(searchElement: T, fromIndex = 0): number {\n        const iterator = this.iterator();\n        let index = 0;\n        let next = iterator.next();\n        while (!next.done) {\n            if (index >= fromIndex && next.value === searchElement) {\n                return index;\n            }\n            next = iterator.next();\n            index++;\n        }\n        return -1;\n    }\n\n    // In the following definition the '& this' part in the return type is important\n    // _and_ the order within 'Stream<U> & this' is crucial!\n    // Otherwise Typescript would infer the type of 'this' as 'StreamImpl<S, T> & Stream<U>'\n    // (or '<subClass of StreamImpl<S, T> & Stream<U>') and usages like\n    // ```\n    //  const stream = new StreamImpl(...);\n    //  ... stream.every(<typeGuard>) & stream....\n    // ```\n    // cannot benefit from '<typeGuard>', as Typescript would priorize the signatures\n    // of 'StreamImpl<S, T>' (i.e. those of 'Stream<T>') over those of 'Stream<U>'.\n    // With the order of 'Stream<U> & this' the signatures of 'Stream<U>' get precedence.\n    every<U extends T>(predicate: (value: T) => value is U): this is Stream<U> & this;\n    every(predicate: (value: T) => unknown): boolean;\n    every(predicate: (value: T) => unknown): boolean {\n        const iterator = this.iterator();\n        let next = iterator.next();\n        while (!next.done) {\n            if (!predicate(next.value)) {\n                return false;\n            }\n            next = iterator.next();\n        }\n        return true;\n    }\n\n    some(predicate: (value: T) => unknown): boolean {\n        const iterator = this.iterator();\n        let next = iterator.next();\n        while (!next.done) {\n            if (predicate(next.value)) {\n                return true;\n            }\n            next = iterator.next();\n        }\n        return false;\n    }\n\n    forEach(callbackfn: (value: T, index: number) => void): void {\n        const iterator = this.iterator();\n        let index = 0;\n        let next = iterator.next();\n        while (!next.done) {\n            callbackfn(next.value, index);\n            next = iterator.next();\n            index++;\n        }\n    }\n\n    map<U>(callbackfn: (value: T) => U): Stream<U> {\n        return new StreamImpl<S, U>(\n            this.startFn,\n            (state) => {\n                const { done, value } = this.nextFn(state);\n                if (done) {\n                    return DONE_RESULT;\n                } else {\n                    return { done: false, value: callbackfn(value) };\n                }\n            }\n        );\n    }\n\n    // for remarks on the return type definition refer to 'every<U extends T>(...)'\n    filter<U extends T>(predicate: (value: T) => value is U): Stream<U> & this;\n    filter(predicate: (value: T) => unknown): Stream<T> & this;\n    filter(predicate: (value: T) => unknown): Stream<T> {\n        return new StreamImpl<S, T>(\n            this.startFn,\n            state => {\n                let result: IteratorResult<T>;\n                do {\n                    result = this.nextFn(state);\n                    if (!result.done && predicate(result.value)) {\n                        return result;\n                    }\n                } while (!result.done);\n                return DONE_RESULT;\n            }\n        );\n    }\n\n    nonNullable(): Stream<NonNullable<T>> {\n        return this.filter(e => e !== undefined && e !== null) as Stream<NonNullable<T>>;\n    }\n\n    reduce(callbackfn: (previousValue: T, currentValue: T) => T): T | undefined;\n    reduce<U = T>(callbackfn: (previousValue: U, currentValue: T) => U, initialValue: U): U;\n    reduce<U>(callbackfn: (previousValue: U | T, currentValue: T) => U, initialValue?: U): U | T | undefined {\n        const iterator = this.iterator();\n        let previousValue: U | T | undefined = initialValue;\n        let next = iterator.next();\n        while (!next.done) {\n            if (previousValue === undefined) {\n                previousValue = next.value;\n            } else {\n                previousValue = callbackfn(previousValue, next.value);\n            }\n            next = iterator.next();\n        }\n        return previousValue;\n    }\n\n    reduceRight(callbackfn: (previousValue: T, currentValue: T) => T): T | undefined;\n    reduceRight<U = T>(callbackfn: (previousValue: U, currentValue: T) => U, initialValue: U): U;\n    reduceRight<U>(callbackfn: (previousValue: U | T, currentValue: T) => U, initialValue?: U): U | T | undefined {\n        return this.recursiveReduce(this.iterator(), callbackfn, initialValue);\n    }\n\n    protected recursiveReduce<U>(iterator: Iterator<T>, callbackfn: (previousValue: U | T, currentValue: T) => U, initialValue?: U): U | T | undefined {\n        const next = iterator.next();\n        if (next.done) {\n            return initialValue;\n        }\n        const previousValue = this.recursiveReduce(iterator, callbackfn, initialValue);\n        if (previousValue === undefined) {\n            return next.value;\n        }\n        return callbackfn(previousValue, next.value);\n    }\n\n    find<S extends T>(predicate: (value: T) => value is S): S | undefined;\n    find(predicate: (value: T) => unknown): T | undefined;\n    find(predicate: (value: T) => unknown): T | undefined {\n        const iterator = this.iterator();\n        let next = iterator.next();\n        while (!next.done) {\n            if (predicate(next.value)) {\n                return next.value;\n            }\n            next = iterator.next();\n        }\n        return undefined;\n    }\n\n    findIndex(predicate: (value: T) => unknown): number {\n        const iterator = this.iterator();\n        let index = 0;\n        let next = iterator.next();\n        while (!next.done) {\n            if (predicate(next.value)) {\n                return index;\n            }\n            next = iterator.next();\n            index++;\n        }\n        return -1;\n    }\n\n    includes(searchElement: T): boolean {\n        const iterator = this.iterator();\n        let next = iterator.next();\n        while (!next.done) {\n            if (next.value === searchElement) {\n                return true;\n            }\n            next = iterator.next();\n        }\n        return false;\n    }\n\n    flatMap<U>(callbackfn: (value: T) => U | Iterable<U>): Stream<U> {\n        type FlatMapState = { this: S, iterator?: Iterator<U, undefined> }\n        return new StreamImpl<FlatMapState, U>(\n            () => ({ this: this.startFn() }),\n            (state) => {\n                do {\n                    if (state.iterator) {\n                        const next = state.iterator.next();\n                        if (next.done) {\n                            state.iterator = undefined;\n                        } else {\n                            return next;\n                        }\n                    }\n                    const { done, value } = this.nextFn(state.this);\n                    if (!done) {\n                        const mapped = callbackfn(value);\n                        if (isIterable(mapped)) {\n                            state.iterator = mapped[Symbol.iterator]();\n                        } else {\n                            return { done: false, value: mapped };\n                        }\n                    }\n                } while (state.iterator);\n                return DONE_RESULT;\n            }\n        );\n    }\n\n    flat<D extends number = 1>(depth?: D): FlatStream<T, D> {\n        if (depth === undefined) {\n            depth = 1 as D;\n        }\n        if (depth <= 0) {\n            return this as unknown as FlatStream<T, D>;\n        }\n        const stream = depth > 1 ? this.flat(depth - 1) as unknown as StreamImpl<S, T> : this;\n        type FlatMapState = { this: S, iterator?: Iterator<T, undefined> }\n        return new StreamImpl<FlatMapState, T>(\n            () => ({ this: stream.startFn() }),\n            (state) => {\n                do {\n                    if (state.iterator) {\n                        const next = state.iterator.next();\n                        if (next.done) {\n                            state.iterator = undefined;\n                        } else {\n                            return next;\n                        }\n                    }\n                    const { done, value } = stream.nextFn(state.this);\n                    if (!done) {\n                        if (isIterable(value)) {\n                            state.iterator = value[Symbol.iterator]() as Iterator<T>;\n                        } else {\n                            return { done: false, value: value };\n                        }\n                    }\n                } while (state.iterator);\n                return DONE_RESULT;\n            }\n        ) as unknown as FlatStream<T, D>;\n    }\n\n    head(): T | undefined {\n        const iterator = this.iterator();\n        const result = iterator.next();\n        if (result.done) {\n            return undefined;\n        }\n        return result.value;\n    }\n\n    tail(skipCount = 1): Stream<T> {\n        return new StreamImpl<S, T>(\n            () => {\n                const state = this.startFn();\n                for (let i = 0; i < skipCount; i++) {\n                    const next = this.nextFn(state);\n                    if (next.done) {\n                        return state;\n                    }\n                }\n                return state;\n            },\n            this.nextFn\n        );\n    }\n\n    limit(maxSize: number): Stream<T> {\n        return new StreamImpl<{ size: number, state: S }, T>(\n            () => ({ size: 0, state: this.startFn() }),\n            state => {\n                state.size++;\n                if (state.size > maxSize) {\n                    return DONE_RESULT;\n                }\n                return this.nextFn(state.state);\n            }\n        );\n    }\n\n    distinct<Key = T>(by?: (element: T) => Key): Stream<T> {\n        return new StreamImpl<{ set: Set<Key | T>, internalState: S }, T>(\n            () => ({ set: new Set<Key | T>(), internalState: this.startFn() }),\n            state => {\n                let result: IteratorResult<T>;\n                do {\n                    result = this.nextFn(state.internalState);\n                    if (!result.done) {\n                        const value = by ? by(result.value) : result.value;\n                        if (!state.set.has(value)) {\n                            state.set.add(value);\n                            return result;\n                        }\n                    }\n                } while (!result.done);\n                return DONE_RESULT;\n            }\n        );\n    }\n\n    exclude<Key = T>(other: Iterable<T>, key?: (element: T) => Key): Stream<T> {\n        const otherKeySet = new Set<Key | T>();\n        for (const item of other) {\n            const value = key ? key(item) : item;\n            otherKeySet.add(value);\n        }\n        return this.filter(e => {\n            const ownKey = key ? key(e) : e;\n            return !otherKeySet.has(ownKey);\n        });\n    }\n}\n\nfunction toString(item: unknown): string {\n    if (typeof item === 'string') {\n        return item as string;\n    }\n    if (typeof item === 'undefined') {\n        return 'undefined';\n    }\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    if (typeof (item as any).toString === 'function') {\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        return (item as any).toString();\n    }\n    return Object.prototype.toString.call(item);\n}\n\nfunction isIterable<T>(obj: unknown): obj is Iterable<T> {\n    return !!obj && typeof (obj as Iterable<T>)[Symbol.iterator] === 'function';\n}\n\n/**\n * An empty stream of any type.\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport const EMPTY_STREAM: Stream<any> = new StreamImpl<undefined, any>(() => undefined, () => DONE_RESULT);\n\n/**\n * Use this `IteratorResult` when implementing a `StreamImpl` to indicate that there are no more elements in the stream.\n */\nexport const DONE_RESULT: IteratorReturnResult<undefined> = Object.freeze({ done: true, value: undefined });\n\n/**\n * Create a stream from one or more iterables or array-likes.\n */\nexport function stream<T>(...collections: Array<Iterable<T> | ArrayLike<T>>): Stream<T> {\n    if (collections.length === 1) {\n        const collection = collections[0];\n        if (collection instanceof StreamImpl) {\n            return collection as Stream<T>;\n        }\n        if (isIterable(collection)) {\n            return new StreamImpl<Iterator<T, undefined>, T>(\n                () => collection[Symbol.iterator](),\n                (iterator) => iterator.next()\n            );\n        }\n        if (typeof collection.length === 'number') {\n            return new StreamImpl<{ index: number }, T>(\n                () => ({ index: 0 }),\n                (state) => {\n                    if (state.index < collection.length) {\n                        return { done: false, value: collection[state.index++] };\n                    } else {\n                        return DONE_RESULT;\n                    }\n                }\n            );\n        }\n    }\n    if (collections.length > 1) {\n        type State = { collIndex: number, iterator?: Iterator<T, undefined>, array?: ArrayLike<T>, arrIndex: number };\n        return new StreamImpl<State, T>(\n            () => ({ collIndex: 0, arrIndex: 0 }),\n            (state) => {\n                do {\n                    if (state.iterator) {\n                        const next = state.iterator.next();\n                        if (!next.done) {\n                            return next;\n                        }\n                        state.iterator = undefined;\n                    }\n                    if (state.array) {\n                        if (state.arrIndex < state.array.length) {\n                            return { done: false, value: state.array[state.arrIndex++] };\n                        }\n                        state.array = undefined;\n                        state.arrIndex = 0;\n                    }\n                    if (state.collIndex < collections.length) {\n                        const collection = collections[state.collIndex++];\n                        if (isIterable(collection)) {\n                            state.iterator = collection[Symbol.iterator]();\n                        } else if (collection && typeof collection.length === 'number') {\n                            state.array = collection;\n                        }\n                    }\n                } while (state.iterator || state.array || state.collIndex < collections.length);\n                return DONE_RESULT;\n            }\n        );\n    }\n    return EMPTY_STREAM;\n}\n\n/**\n * A tree iterator adds the ability to prune the current iteration.\n */\nexport interface TreeIterator<T> extends IterableIterator<T> {\n    /**\n     * Skip the whole subtree below the last returned element. The iteration continues as if that\n     * element had no children.\n     */\n    prune(): void\n}\n\n/**\n * A tree stream is used to stream the elements of a tree, for example an AST or CST.\n */\nexport interface TreeStream<T> extends Stream<T> {\n    iterator(): TreeIterator<T>\n}\n\n/**\n * The default implementation of `TreeStream` takes a root element and a function that computes the\n * children of its argument. Whether the root node included in the stream is controlled with the\n * `includeRoot` option, which defaults to `false`.\n */\nexport class TreeStreamImpl<T>\n    extends StreamImpl<{ iterators: Array<Iterator<T>>, pruned: boolean }, T>\n    implements TreeStream<T> {\n\n    constructor(root: T, children: (node: T) => Iterable<T>, options?: { includeRoot?: boolean }) {\n        super(\n            () => ({\n                iterators: options?.includeRoot ? [[root][Symbol.iterator]()] : [children(root)[Symbol.iterator]()],\n                pruned: false\n            }),\n            state => {\n                if (state.pruned) {\n                    state.iterators.pop();\n                    state.pruned = false;\n                }\n                while (state.iterators.length > 0) {\n                    const iterator = state.iterators[state.iterators.length - 1];\n                    const next = iterator.next();\n                    if (next.done) {\n                        state.iterators.pop();\n                    } else {\n                        state.iterators.push(children(next.value)[Symbol.iterator]());\n                        return next;\n                    }\n                }\n                return DONE_RESULT;\n            }\n        );\n    }\n\n    override iterator(): TreeIterator<T> {\n        const iterator = {\n            state: this.startFn(),\n            next: () => this.nextFn(iterator.state),\n            prune: () => {\n                iterator.state.pruned = true;\n            },\n            [Symbol.iterator]: () => iterator\n        };\n        return iterator;\n    }\n}\n\n/**\n * A set of utility functions that reduce a stream to a single value.\n */\nexport namespace Reduction {\n\n    /**\n     * Compute the sum of a number stream.\n     */\n    export function sum(stream: Stream<number>): number {\n        return stream.reduce((a, b) => a + b, 0);\n    }\n\n    /**\n     * Compute the product of a number stream.\n     */\n    export function product(stream: Stream<number>): number {\n        return stream.reduce((a, b) => a * b, 0);\n    }\n\n    /**\n     * Compute the minimum of a number stream. Returns `undefined` if the stream is empty.\n     */\n    export function min(stream: Stream<number>): number | undefined {\n        return stream.reduce((a, b) => Math.min(a, b));\n    }\n\n    /**\n     * Compute the maximum of a number stream. Returns `undefined` if the stream is empty.\n     */\n    export function max(stream: Stream<number>): number | undefined {\n        return stream.reduce((a, b) => Math.max(a, b));\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { IToken } from '@chevrotain/types';\nimport type { Range } from 'vscode-languageserver-types';\nimport type { CstNode, CompositeCstNode, LeafCstNode } from '../syntax-tree.js';\nimport type { DocumentSegment } from '../workspace/documents.js';\nimport type { Stream, TreeStream } from './stream.js';\nimport { isCompositeCstNode, isLeafCstNode, isRootCstNode } from '../syntax-tree.js';\nimport { TreeStreamImpl } from './stream.js';\nimport { getContainerOfType } from './ast-utils.js';\nimport { isParserRule } from '../languages/generated/ast.js';\n\n/**\n * Attempts to find the CST node that belongs to the datatype element that contains the given CST node.\n *\n * @param cstNode The CST node for which to find the datatype node.\n * @returns The CST node corresponding to the datatype element, or the undefined if no such element exists.\n */\nexport function getDatatypeNode(cstNode: CstNode): CstNode | undefined {\n    let current: CstNode | undefined = cstNode;\n    let found = false;\n    while (current) {\n        const definingRule = getContainerOfType(current.grammarSource, isParserRule);\n        if (definingRule && definingRule.dataType) {\n            // Go up the chain. This element might be part of a larger datatype rule\n            current = current.container;\n            found = true;\n        } else if (found) {\n            // The last datatype node is the one we are looking for\n            return current;\n        } else {\n            // We haven't found any datatype node yet and we've reached a non-datatype rule\n            return undefined;\n        }\n    }\n    return undefined;\n}\n\n/**\n * Create a stream of all CST nodes that are directly and indirectly contained in the given root node,\n * including the root node itself.\n */\nexport function streamCst(node: CstNode): TreeStream<CstNode> {\n    return new TreeStreamImpl(node, element => {\n        if (isCompositeCstNode(element)) {\n            return element.content;\n        } else {\n            return [];\n        }\n    }, { includeRoot: true });\n}\n\n/**\n * Create a stream of all leaf nodes that are directly and indirectly contained in the given root node.\n */\nexport function flattenCst(node: CstNode): Stream<LeafCstNode> {\n    return streamCst(node).filter(isLeafCstNode);\n}\n\n/**\n * Determines whether the specified cst node is a child of the specified parent node.\n */\nexport function isChildNode(child: CstNode, parent: CstNode): boolean {\n    while (child.container) {\n        child = child.container;\n        if (child === parent) {\n            return true;\n        }\n    }\n    return false;\n}\n\nexport function tokenToRange(token: IToken): Range {\n    // Chevrotain uses 1-based indices everywhere\n    // So we subtract 1 from every value to align with the LSP\n    return {\n        start: {\n            character: token.startColumn! - 1,\n            line: token.startLine! - 1\n        },\n        end: {\n            character: token.endColumn!, // endColumn uses the correct index\n            line: token.endLine! - 1\n        }\n    };\n}\n\nexport function toDocumentSegment(node: CstNode): DocumentSegment;\nexport function toDocumentSegment(node?: CstNode): DocumentSegment | undefined;\nexport function toDocumentSegment(node?: CstNode): DocumentSegment | undefined {\n    if (!node) {\n        return undefined;\n    }\n    const { offset, end, range } = node;\n    return {\n        range,\n        offset,\n        end,\n        length: end - offset\n    };\n}\n\nexport enum RangeComparison {\n    Before = 0,\n    After = 1,\n    OverlapFront = 2,\n    OverlapBack = 3,\n    Inside = 4,\n    Outside = 5,\n}\n\nexport function compareRange(range: Range, to: Range): RangeComparison {\n    if (range.end.line < to.start.line || (range.end.line === to.start.line && range.end.character <= to.start.character)) {\n        return RangeComparison.Before;\n    } else if (range.start.line > to.end.line || (range.start.line === to.end.line && range.start.character >= to.end.character)) {\n        return RangeComparison.After;\n    }\n    const startInside = range.start.line > to.start.line || (range.start.line === to.start.line && range.start.character >= to.start.character);\n    const endInside = range.end.line < to.end.line || (range.end.line === to.end.line && range.end.character <= to.end.character);\n    if (startInside && endInside) {\n        return RangeComparison.Inside;\n    } else if (startInside) {\n        return RangeComparison.OverlapBack;\n    } else if (endInside) {\n        return RangeComparison.OverlapFront;\n    } else {\n        return RangeComparison.Outside;\n    }\n}\n\nexport function inRange(range: Range, to: Range): boolean {\n    const comparison = compareRange(range, to);\n    return comparison > RangeComparison.After;\n}\n\n// The \\p{L} regex matches any unicode letter character, i.e. characters from non-english alphabets\n// Together with \\w it matches any kind of character which can commonly appear in IDs\nexport const DefaultNameRegexp = /^[\\w\\p{L}]$/u;\n\n/**\n * Performs `findLeafNodeAtOffset` with a minor difference: When encountering a character that matches the `nameRegexp` argument,\n * it will instead return the leaf node at the `offset - 1` position.\n *\n * For LSP services, users expect that the declaration of an element is available if the cursor is directly after the element.\n */\nexport function findDeclarationNodeAtOffset(cstNode: CstNode | undefined, offset: number, nameRegexp = DefaultNameRegexp): LeafCstNode | undefined {\n    if (cstNode) {\n        if (offset > 0) {\n            const localOffset = offset - cstNode.offset;\n            const textAtOffset = cstNode.text.charAt(localOffset);\n            if (!nameRegexp.test(textAtOffset)) {\n                offset--;\n            }\n        }\n        return findLeafNodeAtOffset(cstNode, offset);\n    }\n    return undefined;\n}\n\nexport function findCommentNode(cstNode: CstNode | undefined, commentNames: string[]): CstNode | undefined {\n    if (cstNode) {\n        const previous = getPreviousNode(cstNode, true);\n        if (previous && isCommentNode(previous, commentNames)) {\n            return previous;\n        }\n        if (isRootCstNode(cstNode)) {\n            // Go from the first non-hidden node through all nodes in reverse order\n            // We do this to find the comment node which directly precedes the root node\n            const endIndex = cstNode.content.findIndex(e => !e.hidden);\n            for (let i = endIndex - 1; i >= 0; i--) {\n                const child = cstNode.content[i];\n                if (isCommentNode(child, commentNames)) {\n                    return child;\n                }\n            }\n        }\n    }\n    return undefined;\n}\n\nexport function isCommentNode(cstNode: CstNode, commentNames: string[]): boolean {\n    return isLeafCstNode(cstNode) && commentNames.includes(cstNode.tokenType.name);\n}\n\n/**\n * Finds the leaf CST node at the specified 0-based string offset.\n * Note that the given offset will be within the range of the returned leaf node.\n *\n * If the offset does not point to a CST node (but just white space), this method will return `undefined`.\n *\n * @param node The CST node to search through.\n * @param offset The specified offset.\n * @returns The CST node at the specified offset.\n */\nexport function findLeafNodeAtOffset(node: CstNode, offset: number): LeafCstNode | undefined {\n    if (isLeafCstNode(node)) {\n        return node;\n    } else if (isCompositeCstNode(node)) {\n        const searchResult = binarySearch(node, offset, false);\n        if (searchResult) {\n            return findLeafNodeAtOffset(searchResult, offset);\n        }\n    }\n    return undefined;\n}\n\n/**\n * Finds the leaf CST node at the specified 0-based string offset.\n * If no CST node exists at the specified position, it will return the leaf node before it.\n *\n * If there is no leaf node before the specified offset, this method will return `undefined`.\n *\n * @param node The CST node to search through.\n * @param offset The specified offset.\n * @returns The CST node closest to the specified offset.\n */\nexport function findLeafNodeBeforeOffset(node: CstNode, offset: number): LeafCstNode | undefined {\n    if (isLeafCstNode(node)) {\n        return node;\n    } else if (isCompositeCstNode(node)) {\n        const searchResult = binarySearch(node, offset, true);\n        if (searchResult) {\n            return findLeafNodeBeforeOffset(searchResult, offset);\n        }\n    }\n    return undefined;\n}\n\nfunction binarySearch(node: CompositeCstNode, offset: number, closest: boolean): CstNode | undefined {\n    let left = 0;\n    let right = node.content.length - 1;\n    let closestNode: CstNode | undefined = undefined;\n\n    while (left <= right) {\n        const middle = Math.floor((left + right) / 2);\n        const middleNode = node.content[middle];\n\n        if (middleNode.offset <= offset && middleNode.end > offset) {\n            // Found an exact match\n            return middleNode;\n        }\n\n        if (middleNode.end <= offset) {\n            // Update the closest node (less than offset) and move to the right half\n            closestNode = closest ? middleNode : undefined;\n            left = middle + 1;\n        } else {\n            // Move to the left half\n            right = middle - 1;\n        }\n    }\n\n    return closestNode;\n}\n\nexport function getPreviousNode(node: CstNode, hidden = true): CstNode | undefined {\n    while (node.container) {\n        const parent = node.container;\n        let index = parent.content.indexOf(node);\n        while (index > 0) {\n            index--;\n            const previous = parent.content[index];\n            if (hidden || !previous.hidden) {\n                return previous;\n            }\n        }\n        node = parent;\n    }\n    return undefined;\n}\n\nexport function getNextNode(node: CstNode, hidden = true): CstNode | undefined {\n    while (node.container) {\n        const parent = node.container;\n        let index = parent.content.indexOf(node);\n        const last = parent.content.length - 1;\n        while (index < last) {\n            index++;\n            const next = parent.content[index];\n            if (hidden || !next.hidden) {\n                return next;\n            }\n        }\n        node = parent;\n    }\n    return undefined;\n}\n\nexport function getStartlineNode(node: CstNode): CstNode {\n    if (node.range.start.character === 0) {\n        return node;\n    }\n    const line = node.range.start.line;\n    let last = node;\n    let index: number | undefined;\n    while (node.container) {\n        const parent = node.container;\n        const selfIndex = index ?? parent.content.indexOf(node);\n        if (selfIndex === 0) {\n            node = parent;\n            index = undefined;\n        } else {\n            index = selfIndex - 1;\n            node = parent.content[index];\n        }\n        if (node.range.start.line !== line) {\n            break;\n        }\n        last = node;\n    }\n    return last;\n}\n\nexport function getInteriorNodes(start: CstNode, end: CstNode): CstNode[] {\n    const commonParent = getCommonParent(start, end);\n    if (!commonParent) {\n        return [];\n    }\n    return commonParent.parent.content.slice(commonParent.a + 1, commonParent.b);\n}\n\nfunction getCommonParent(a: CstNode, b: CstNode): CommonParent | undefined {\n    const aParents = getParentChain(a);\n    const bParents = getParentChain(b);\n    let current: CommonParent | undefined;\n    for (let i = 0; i < aParents.length && i < bParents.length; i++) {\n        const aParent = aParents[i];\n        const bParent = bParents[i];\n        if (aParent.parent === bParent.parent) {\n            current = {\n                parent: aParent.parent,\n                a: aParent.index,\n                b: bParent.index\n            };\n        } else {\n            break;\n        }\n    }\n    return current;\n}\n\ninterface CommonParent {\n    parent: CompositeCstNode\n    a: number\n    b: number\n}\n\nfunction getParentChain(node: CstNode): ParentLink[] {\n    const chain: ParentLink[] = [];\n    while (node.container) {\n        const parent = node.container;\n        const index = parent.content.indexOf(node);\n        chain.push({\n            parent,\n            index\n        });\n        node = parent;\n    }\n    return chain.reverse();\n}\n\ninterface ParentLink {\n    parent: CompositeCstNode\n    index: number\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { CstNode } from '../syntax-tree.js';\n\nexport class ErrorWithLocation extends Error {\n    constructor(node: CstNode | undefined, message: string) {\n        super(node ? `${message} at ${node.range.start.line}:${node.range.start.character}` : message);\n    }\n}\n\nexport function assertUnreachable(_: never, message = 'Error: Got unexpected value.'): never {\n    throw new Error(message);\n}\n\nexport function assertCondition(condition: boolean, message: string = 'Error: Condition is violated.'): asserts condition {\n    if (!condition) {\n        throw new Error(message);\n    }\n}\n", "import type { Character, IRegExpAST, RegExpFlags } from \"../types\";\n\nexport function cc(char: string): number {\n  return char.charCodeAt(0);\n}\n\nexport function insertToSet<T>(item: T | T[], set: T[]) {\n  if (Array.isArray(item)) {\n    item.forEach(function (subItem) {\n      set.push(subItem);\n    });\n  } else {\n    set.push(item);\n  }\n}\n\nexport function addFlag(\n  flagObj: RegExpFlags,\n  flagKey: keyof Omit<RegExpFlags, keyof IRegExpAST>,\n) {\n  if (flagObj[flagKey] === true) {\n    throw \"duplicate flag \" + flagKey;\n  }\n\n  const x: boolean = flagObj[flagKey];\n  flagObj[flagKey] = true;\n}\n\nexport function ASSERT_EXISTS<T = Object>(obj: any): obj is T {\n  // istanbul ignore next\n  if (obj === undefined) {\n    throw Error(\"Internal Error - Should never get here!\");\n  }\n  return true;\n}\n\n// istanbul ignore next\nexport function ASSERT_NEVER_REACH_HERE(): any {\n  throw Error(\"Internal Error - Should never get here!\");\n}\n\nexport function isCharacter(obj: { type: string }): obj is Character {\n  return obj[\"type\"] === \"Character\";\n}\n", "import { cc } from \"./utils.js\";\n\nexport const digitsCharCodes: number[] = [];\nfor (let i = cc(\"0\"); i <= cc(\"9\"); i++) {\n  digitsCharCodes.push(i);\n}\n\nexport const wordCharCodes: number[] = [cc(\"_\")].concat(digitsCharCodes);\nfor (let i = cc(\"a\"); i <= cc(\"z\"); i++) {\n  wordCharCodes.push(i);\n}\n\nfor (let i = cc(\"A\"); i <= cc(\"Z\"); i++) {\n  wordCharCodes.push(i);\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp#character-classes\nexport const whitespaceCodes: number[] = [\n  cc(\" \"),\n  cc(\"\\f\"),\n  cc(\"\\n\"),\n  cc(\"\\r\"),\n  cc(\"\\t\"),\n  cc(\"\\v\"),\n  cc(\"\\t\"),\n  cc(\"\\u00a0\"),\n  cc(\"\\u1680\"),\n  cc(\"\\u2000\"),\n  cc(\"\\u2001\"),\n  cc(\"\\u2002\"),\n  cc(\"\\u2003\"),\n  cc(\"\\u2004\"),\n  cc(\"\\u2005\"),\n  cc(\"\\u2006\"),\n  cc(\"\\u2007\"),\n  cc(\"\\u2008\"),\n  cc(\"\\u2009\"),\n  cc(\"\\u200a\"),\n  cc(\"\\u2028\"),\n  cc(\"\\u2029\"),\n  cc(\"\\u202f\"),\n  cc(\"\\u205f\"),\n  cc(\"\\u3000\"),\n  cc(\"\\ufeff\"),\n];\n", "import type {\n  Alternative,\n  Assertion,\n  Atom,\n  Character,\n  Disjunction,\n  Group,\n  GroupBackReference,\n  Location,\n  Quantifier,\n  Range,\n  RegExpFlags,\n  RegExpPattern,\n  Set,\n  Term,\n} from \"../types\";\nimport {\n  addFlag,\n  ASSERT_EXISTS,\n  ASSERT_NEVER_REACH_HERE,\n  cc,\n  insertToSet,\n  isCharacter,\n} from \"./utils.js\";\nimport {\n  digitsCharCodes,\n  whitespaceCodes,\n  wordCharCodes,\n} from \"./character-classes.js\";\n\n// consts and utilities\nconst hexDigitPattern = /[0-9a-fA-F]/;\nconst decimalPattern = /[0-9]/;\nconst decimalPatternNoZero = /[1-9]/;\n\n// https://hackernoon.com/the-madness-of-parsing-real-world-javascript-regexps-d9ee336df983\n// https://www.ecma-international.org/ecma-262/8.0/index.html#prod-Pattern\nexport class RegExpParser {\n  protected idx: number = 0;\n  protected input: string = \"\";\n  protected groupIdx: number = 0;\n\n  protected saveState() {\n    return {\n      idx: this.idx,\n      input: this.input,\n      groupIdx: this.groupIdx,\n    };\n  }\n\n  protected restoreState(newState: {\n    idx: number;\n    input: string;\n    groupIdx: number;\n  }) {\n    this.idx = newState.idx;\n    this.input = newState.input;\n    this.groupIdx = newState.groupIdx;\n  }\n\n  public pattern(input: string): RegExpPattern {\n    // parser state\n    this.idx = 0;\n    this.input = input;\n    this.groupIdx = 0;\n\n    this.consumeChar(\"/\");\n    const value = this.disjunction();\n    this.consumeChar(\"/\");\n\n    const flags: RegExpFlags = {\n      type: \"Flags\",\n      loc: { begin: this.idx, end: input.length },\n      global: false,\n      ignoreCase: false,\n      multiLine: false,\n      unicode: false,\n      sticky: false,\n    };\n\n    while (this.isRegExpFlag()) {\n      switch (this.popChar()) {\n        case \"g\":\n          addFlag(flags, \"global\");\n          break;\n        case \"i\":\n          addFlag(flags, \"ignoreCase\");\n          break;\n        case \"m\":\n          addFlag(flags, \"multiLine\");\n          break;\n        case \"u\":\n          addFlag(flags, \"unicode\");\n          break;\n        case \"y\":\n          addFlag(flags, \"sticky\");\n          break;\n      }\n    }\n\n    if (this.idx !== this.input.length) {\n      throw Error(\"Redundant input: \" + this.input.substring(this.idx));\n    }\n    return {\n      type: \"Pattern\",\n      flags: flags,\n      value: value,\n      loc: this.loc(0),\n    };\n  }\n\n  protected disjunction(): Disjunction {\n    const alts = [];\n    const begin = this.idx;\n\n    alts.push(this.alternative());\n\n    while (this.peekChar() === \"|\") {\n      this.consumeChar(\"|\");\n      alts.push(this.alternative());\n    }\n\n    return { type: \"Disjunction\", value: alts, loc: this.loc(begin) };\n  }\n\n  protected alternative(): Alternative {\n    const terms = [];\n    const begin = this.idx;\n\n    while (this.isTerm()) {\n      terms.push(this.term());\n    }\n\n    return { type: \"Alternative\", value: terms, loc: this.loc(begin) };\n  }\n\n  protected term(): Term {\n    if (this.isAssertion()) {\n      return this.assertion();\n    } else {\n      return this.atom();\n    }\n  }\n\n  protected assertion(): Assertion {\n    const begin = this.idx;\n    switch (this.popChar()) {\n      case \"^\":\n        return {\n          type: \"StartAnchor\",\n          loc: this.loc(begin),\n        };\n      case \"$\":\n        return { type: \"EndAnchor\", loc: this.loc(begin) };\n      // '\\b' or '\\B'\n      case \"\\\\\":\n        switch (this.popChar()) {\n          case \"b\":\n            return {\n              type: \"WordBoundary\",\n              loc: this.loc(begin),\n            };\n          case \"B\":\n            return {\n              type: \"NonWordBoundary\",\n              loc: this.loc(begin),\n            };\n        }\n        /* c8 ignore next */\n        throw Error(\"Invalid Assertion Escape\");\n      // '(?=' or '(?!'\n      case \"(\":\n        this.consumeChar(\"?\");\n\n        let type:\n          | \"Lookahead\"\n          | \"NegativeLookahead\"\n          | \"Lookbehind\"\n          | \"NegativeLookbehind\"\n          | undefined;\n        switch (this.popChar()) {\n          case \"=\":\n            type = \"Lookahead\";\n            break;\n          case \"!\":\n            type = \"NegativeLookahead\";\n            break;\n          case \"<\": {\n            switch (this.popChar()) {\n              case \"=\":\n                type = \"Lookbehind\";\n                break;\n              case \"!\":\n                type = \"NegativeLookbehind\";\n            }\n            break;\n          }\n        }\n        ASSERT_EXISTS(type);\n\n        const disjunction = this.disjunction();\n\n        this.consumeChar(\")\");\n\n        return {\n          type: type!,\n          value: disjunction,\n          loc: this.loc(begin),\n        };\n    }\n    // istanbul ignore next\n    return ASSERT_NEVER_REACH_HERE();\n  }\n\n  protected quantifier(\n    isBacktracking: boolean = false,\n  ): Quantifier | undefined {\n    let range: Partial<Quantifier> | undefined = undefined;\n    const begin = this.idx;\n    switch (this.popChar()) {\n      case \"*\":\n        range = {\n          atLeast: 0,\n          atMost: Infinity,\n        };\n        break;\n      case \"+\":\n        range = {\n          atLeast: 1,\n          atMost: Infinity,\n        };\n        break;\n      case \"?\":\n        range = {\n          atLeast: 0,\n          atMost: 1,\n        };\n        break;\n      case \"{\":\n        const atLeast = this.integerIncludingZero();\n        switch (this.popChar()) {\n          case \"}\":\n            range = {\n              atLeast: atLeast,\n              atMost: atLeast,\n            };\n            break;\n          case \",\":\n            let atMost;\n            if (this.isDigit()) {\n              atMost = this.integerIncludingZero();\n              range = {\n                atLeast: atLeast,\n                atMost: atMost,\n              };\n            } else {\n              range = {\n                atLeast: atLeast,\n                atMost: Infinity,\n              };\n            }\n            this.consumeChar(\"}\");\n            break;\n        }\n        // throwing exceptions from \"ASSERT_EXISTS\" during backtracking\n        // causes severe performance degradations\n        if (isBacktracking === true && range === undefined) {\n          return undefined;\n        }\n        ASSERT_EXISTS(range);\n        break;\n    }\n\n    // throwing exceptions from \"ASSERT_EXISTS\" during backtracking\n    // causes severe performance degradations\n    if (isBacktracking === true && range === undefined) {\n      return undefined;\n    }\n\n    // istanbul ignore else\n    if (ASSERT_EXISTS(range)) {\n      if (this.peekChar(0) === \"?\") {\n        this.consumeChar(\"?\");\n        range.greedy = false;\n      } else {\n        range.greedy = true;\n      }\n\n      range.type = \"Quantifier\";\n      range.loc = this.loc(begin);\n      return range as Quantifier;\n    }\n  }\n\n  protected atom(): Atom {\n    let atom: Omit<Atom, \"loc\" | \"type\"> | undefined;\n    const begin = this.idx;\n    switch (this.peekChar()) {\n      case \".\":\n        atom = this.dotAll();\n        break;\n      case \"\\\\\":\n        atom = this.atomEscape();\n        break;\n      case \"[\":\n        atom = this.characterClass();\n        break;\n      case \"(\":\n        atom = this.group();\n        break;\n    }\n\n    if (atom === undefined && this.isPatternCharacter()) {\n      atom = this.patternCharacter();\n    }\n\n    // istanbul ignore else\n    if (ASSERT_EXISTS<Atom>(atom)) {\n      atom.loc = this.loc(begin);\n\n      if (this.isQuantifier()) {\n        atom.quantifier = this.quantifier();\n      }\n\n      return atom;\n    }\n\n    // istanbul ignore next\n    return ASSERT_NEVER_REACH_HERE();\n  }\n\n  protected dotAll(): Omit<Set, \"loc\"> {\n    this.consumeChar(\".\");\n    return {\n      type: \"Set\",\n      complement: true,\n      value: [cc(\"\\n\"), cc(\"\\r\"), cc(\"\\u2028\"), cc(\"\\u2029\")],\n    };\n  }\n\n  protected atomEscape(): Omit<GroupBackReference | Set | Character, \"loc\"> {\n    this.consumeChar(\"\\\\\");\n\n    switch (this.peekChar()) {\n      case \"1\":\n      case \"2\":\n      case \"3\":\n      case \"4\":\n      case \"5\":\n      case \"6\":\n      case \"7\":\n      case \"8\":\n      case \"9\":\n        return this.decimalEscapeAtom();\n      case \"d\":\n      case \"D\":\n      case \"s\":\n      case \"S\":\n      case \"w\":\n      case \"W\":\n        return this.characterClassEscape();\n      case \"f\":\n      case \"n\":\n      case \"r\":\n      case \"t\":\n      case \"v\":\n        return this.controlEscapeAtom();\n      case \"c\":\n        return this.controlLetterEscapeAtom();\n      case \"0\":\n        return this.nulCharacterAtom();\n      case \"x\":\n        return this.hexEscapeSequenceAtom();\n      case \"u\":\n        return this.regExpUnicodeEscapeSequenceAtom();\n      default:\n        return this.identityEscapeAtom();\n    }\n  }\n\n  protected decimalEscapeAtom(): Omit<GroupBackReference, \"loc\"> {\n    const value = this.positiveInteger();\n\n    return { type: \"GroupBackReference\", value: value };\n  }\n\n  protected characterClassEscape(): Omit<Set, \"loc\"> {\n    let set: (number | Range)[] | undefined;\n    let complement = false;\n    switch (this.popChar()) {\n      case \"d\":\n        set = digitsCharCodes;\n        break;\n      case \"D\":\n        set = digitsCharCodes;\n        complement = true;\n        break;\n      case \"s\":\n        set = whitespaceCodes;\n        break;\n      case \"S\":\n        set = whitespaceCodes;\n        complement = true;\n        break;\n      case \"w\":\n        set = wordCharCodes;\n        break;\n      case \"W\":\n        set = wordCharCodes;\n        complement = true;\n        break;\n    }\n\n    // istanbul ignore else\n    if (ASSERT_EXISTS(set)) {\n      return { type: \"Set\", value: set, complement: complement };\n    }\n    // istanbul ignore next\n    return ASSERT_NEVER_REACH_HERE();\n  }\n\n  protected controlEscapeAtom(): Omit<Character, \"loc\"> {\n    let escapeCode;\n    switch (this.popChar()) {\n      case \"f\":\n        escapeCode = cc(\"\\f\");\n        break;\n      case \"n\":\n        escapeCode = cc(\"\\n\");\n        break;\n      case \"r\":\n        escapeCode = cc(\"\\r\");\n        break;\n      case \"t\":\n        escapeCode = cc(\"\\t\");\n        break;\n      case \"v\":\n        escapeCode = cc(\"\\v\");\n        break;\n    }\n\n    // istanbul ignore else\n    if (ASSERT_EXISTS(escapeCode)) {\n      return { type: \"Character\", value: escapeCode };\n    }\n    // istanbul ignore next\n    return ASSERT_NEVER_REACH_HERE();\n  }\n\n  protected controlLetterEscapeAtom(): Omit<Character, \"loc\"> {\n    this.consumeChar(\"c\");\n    const letter = this.popChar();\n    if (/[a-zA-Z]/.test(letter) === false) {\n      throw Error(\"Invalid \");\n    }\n\n    const letterCode = letter.toUpperCase().charCodeAt(0) - 64;\n    return { type: \"Character\", value: letterCode };\n  }\n\n  protected nulCharacterAtom(): Omit<Character, \"loc\"> {\n    // TODO implement '[lookahead \u2209 DecimalDigit]'\n    // TODO: for the deprecated octal escape sequence\n    this.consumeChar(\"0\");\n    return { type: \"Character\", value: cc(\"\\0\") };\n  }\n\n  protected hexEscapeSequenceAtom(): Omit<Character, \"loc\"> {\n    this.consumeChar(\"x\");\n    return this.parseHexDigits(2);\n  }\n\n  protected regExpUnicodeEscapeSequenceAtom(): Omit<Character, \"loc\"> {\n    this.consumeChar(\"u\");\n    return this.parseHexDigits(4);\n  }\n\n  protected identityEscapeAtom(): Omit<Character, \"loc\"> {\n    // TODO: implement \"SourceCharacter but not UnicodeIDContinue\"\n    // // http://unicode.org/reports/tr31/#Specific_Character_Adjustments\n    const escapedChar = this.popChar();\n    return { type: \"Character\", value: cc(escapedChar) };\n  }\n\n  protected classPatternCharacterAtom(): Omit<Character, \"loc\"> {\n    switch (this.peekChar()) {\n      // istanbul ignore next\n      case \"\\n\":\n      // istanbul ignore next\n      case \"\\r\":\n      // istanbul ignore next\n      case \"\\u2028\":\n      // istanbul ignore next\n      case \"\\u2029\":\n      // istanbul ignore next\n      case \"\\\\\":\n      // istanbul ignore next\n      case \"]\":\n        throw Error(\"TBD\");\n      default:\n        const nextChar = this.popChar();\n        return { type: \"Character\", value: cc(nextChar) };\n    }\n  }\n\n  protected characterClass(): Omit<Set, \"loc\"> {\n    const set: (number | Range)[] = [];\n    let complement = false;\n    this.consumeChar(\"[\");\n    if (this.peekChar(0) === \"^\") {\n      this.consumeChar(\"^\");\n      complement = true;\n    }\n\n    while (this.isClassAtom()) {\n      const from = this.classAtom();\n      const isFromSingleChar = from.type === \"Character\";\n      if (isCharacter(from) && this.isRangeDash()) {\n        this.consumeChar(\"-\");\n        const to = this.classAtom();\n        const isToSingleChar = to.type === \"Character\";\n\n        // a range can only be used when both sides are single characters\n        if (isCharacter(to)) {\n          if (to.value < from.value) {\n            throw Error(\"Range out of order in character class\");\n          }\n          set.push({ from: from.value, to: to.value });\n        } else {\n          // literal dash\n          insertToSet(from.value, set);\n          set.push(cc(\"-\"));\n          insertToSet(to.value, set);\n        }\n      } else {\n        insertToSet(from.value, set);\n      }\n    }\n\n    this.consumeChar(\"]\");\n\n    return { type: \"Set\", complement: complement, value: set };\n  }\n\n  protected classAtom(): Omit<Character | Set, \"loc\"> {\n    switch (this.peekChar()) {\n      // istanbul ignore next\n      case \"]\":\n      // istanbul ignore next\n      case \"\\n\":\n      // istanbul ignore next\n      case \"\\r\":\n      // istanbul ignore next\n      case \"\\u2028\":\n      // istanbul ignore next\n      case \"\\u2029\":\n        throw Error(\"TBD\");\n      case \"\\\\\":\n        return this.classEscape();\n      default:\n        return this.classPatternCharacterAtom();\n    }\n  }\n\n  protected classEscape(): Omit<Character | Set, \"loc\"> {\n    this.consumeChar(\"\\\\\");\n    switch (this.peekChar()) {\n      // Matches a backspace.\n      // (Not to be confused with \\b word boundary outside characterClass)\n      case \"b\":\n        this.consumeChar(\"b\");\n        return { type: \"Character\", value: cc(\"\\u0008\") };\n      case \"d\":\n      case \"D\":\n      case \"s\":\n      case \"S\":\n      case \"w\":\n      case \"W\":\n        return this.characterClassEscape();\n      case \"f\":\n      case \"n\":\n      case \"r\":\n      case \"t\":\n      case \"v\":\n        return this.controlEscapeAtom();\n      case \"c\":\n        return this.controlLetterEscapeAtom();\n      case \"0\":\n        return this.nulCharacterAtom();\n      case \"x\":\n        return this.hexEscapeSequenceAtom();\n      case \"u\":\n        return this.regExpUnicodeEscapeSequenceAtom();\n      default:\n        return this.identityEscapeAtom();\n    }\n  }\n\n  protected group(): Omit<Group, \"loc\"> {\n    let capturing = true;\n    this.consumeChar(\"(\");\n    switch (this.peekChar(0)) {\n      case \"?\":\n        this.consumeChar(\"?\");\n        this.consumeChar(\":\");\n        capturing = false;\n        break;\n      default:\n        this.groupIdx++;\n        break;\n    }\n    const value = this.disjunction();\n    this.consumeChar(\")\");\n\n    const groupAst: Omit<Group, \"loc\"> = {\n      type: \"Group\",\n      capturing: capturing,\n      value: value,\n    };\n\n    if (capturing) {\n      groupAst[\"idx\"] = this.groupIdx;\n    }\n\n    return groupAst;\n  }\n\n  protected positiveInteger(): number {\n    let number = this.popChar();\n\n    // istanbul ignore next - can't ever get here due to previous lookahead checks\n    // still implementing this error checking in case this ever changes.\n    if (decimalPatternNoZero.test(number) === false) {\n      throw Error(\"Expecting a positive integer\");\n    }\n\n    while (decimalPattern.test(this.peekChar(0))) {\n      number += this.popChar();\n    }\n\n    return parseInt(number, 10);\n  }\n\n  protected integerIncludingZero(): number {\n    let number = this.popChar();\n    if (decimalPattern.test(number) === false) {\n      throw Error(\"Expecting an integer\");\n    }\n\n    while (decimalPattern.test(this.peekChar(0))) {\n      number += this.popChar();\n    }\n\n    return parseInt(number, 10);\n  }\n\n  protected patternCharacter(): Omit<Character, \"loc\"> {\n    const nextChar = this.popChar();\n    switch (nextChar) {\n      // istanbul ignore next\n      case \"\\n\":\n      // istanbul ignore next\n      case \"\\r\":\n      // istanbul ignore next\n      case \"\\u2028\":\n      // istanbul ignore next\n      case \"\\u2029\":\n      // istanbul ignore next\n      case \"^\":\n      // istanbul ignore next\n      case \"$\":\n      // istanbul ignore next\n      case \"\\\\\":\n      // istanbul ignore next\n      case \".\":\n      // istanbul ignore next\n      case \"*\":\n      // istanbul ignore next\n      case \"+\":\n      // istanbul ignore next\n      case \"?\":\n      // istanbul ignore next\n      case \"(\":\n      // istanbul ignore next\n      case \")\":\n      // istanbul ignore next\n      case \"[\":\n      // istanbul ignore next\n      case \"|\":\n        // istanbul ignore next\n        throw Error(\"TBD\");\n      default:\n        return { type: \"Character\", value: cc(nextChar) };\n    }\n  }\n  protected isRegExpFlag(): boolean {\n    switch (this.peekChar(0)) {\n      case \"g\":\n      case \"i\":\n      case \"m\":\n      case \"u\":\n      case \"y\":\n        return true;\n      default:\n        return false;\n    }\n  }\n\n  protected isRangeDash(): boolean {\n    return this.peekChar() === \"-\" && this.isClassAtom(1);\n  }\n\n  protected isDigit(): boolean {\n    return decimalPattern.test(this.peekChar(0));\n  }\n\n  protected isClassAtom(howMuch = 0): boolean {\n    switch (this.peekChar(howMuch)) {\n      case \"]\":\n      case \"\\n\":\n      case \"\\r\":\n      case \"\\u2028\":\n      case \"\\u2029\":\n        return false;\n      default:\n        return true;\n    }\n  }\n\n  protected isTerm() {\n    return this.isAtom() || this.isAssertion();\n  }\n\n  protected isAtom(): boolean {\n    if (this.isPatternCharacter()) {\n      return true;\n    }\n\n    switch (this.peekChar(0)) {\n      case \".\":\n      case \"\\\\\": // atomEscape\n      case \"[\": // characterClass\n      // TODO: isAtom must be called before isAssertion - disambiguate\n      case \"(\": // group\n        return true;\n      default:\n        return false;\n    }\n  }\n\n  protected isAssertion(): boolean {\n    switch (this.peekChar(0)) {\n      case \"^\":\n      case \"$\":\n        return true;\n      // '\\b' or '\\B'\n      case \"\\\\\":\n        switch (this.peekChar(1)) {\n          case \"b\":\n          case \"B\":\n            return true;\n          default:\n            return false;\n        }\n      // '(?=' or '(?!' or `(?<=` or `(?<!`\n      case \"(\":\n        return (\n          this.peekChar(1) === \"?\" &&\n          (this.peekChar(2) === \"=\" ||\n            this.peekChar(2) === \"!\" ||\n            (this.peekChar(2) === \"<\" &&\n              (this.peekChar(3) === \"=\" || this.peekChar(3) === \"!\")))\n        );\n      default:\n        return false;\n    }\n  }\n\n  protected isQuantifier(): boolean {\n    const prevState = this.saveState();\n    try {\n      return this.quantifier(true) !== undefined;\n    } catch (e) {\n      return false;\n    } finally {\n      this.restoreState(prevState);\n    }\n  }\n\n  protected isPatternCharacter(): boolean {\n    switch (this.peekChar()) {\n      case \"^\":\n      case \"$\":\n      case \"\\\\\":\n      case \".\":\n      case \"*\":\n      case \"+\":\n      case \"?\":\n      case \"(\":\n      case \")\":\n      case \"[\":\n      case \"|\":\n      case \"/\":\n      case \"\\n\":\n      case \"\\r\":\n      case \"\\u2028\":\n      case \"\\u2029\":\n        return false;\n      default:\n        return true;\n    }\n  }\n\n  protected parseHexDigits(howMany: number): Omit<Character, \"loc\"> {\n    let hexString = \"\";\n    for (let i = 0; i < howMany; i++) {\n      const hexChar = this.popChar();\n      if (hexDigitPattern.test(hexChar) === false) {\n        throw Error(\"Expecting a HexDecimal digits\");\n      }\n      hexString += hexChar;\n    }\n    const charCode = parseInt(hexString, 16);\n    return { type: \"Character\", value: charCode };\n  }\n\n  protected peekChar(howMuch = 0): string {\n    return this.input[this.idx + howMuch];\n  }\n\n  protected popChar(): string {\n    const nextChar = this.peekChar(0);\n    this.consumeChar(undefined);\n    return nextChar;\n  }\n\n  protected consumeChar(char: string | undefined): void {\n    if (char !== undefined && this.input[this.idx] !== char) {\n      throw Error(\n        \"Expected: '\" +\n          char +\n          \"' but found: '\" +\n          this.input[this.idx] +\n          \"' at offset: \" +\n          this.idx,\n      );\n    }\n\n    if (this.idx >= this.input.length) {\n      throw Error(\"Unexpected end of input\");\n    }\n    this.idx++;\n  }\n\n  protected loc(begin: number): Location {\n    return { begin: begin, end: this.idx };\n  }\n}\n", "import type {\n  Alternative,\n  Assertion,\n  Character,\n  Disjunction,\n  Group,\n  GroupBackReference,\n  IRegExpAST,\n  Quantifier,\n  RegExpAstPart,\n  RegExpFlags,\n  RegExpPattern,\n  Set,\n} from \"../types\";\n\nexport class BaseRegExpVisitor {\n  public visitChildren(node: IRegExpAST) {\n    for (const key in node) {\n      const child = (node as any)[key];\n      /* istanbul ignore else */\n      if (node.hasOwnProperty(key)) {\n        if (child.type !== undefined) {\n          this.visit(child);\n        } else if (Array.isArray(child)) {\n          child.forEach((subChild) => {\n            this.visit(subChild);\n          }, this);\n        }\n      }\n    }\n  }\n\n  public visit(node: RegExpAstPart): void {\n    switch (node.type) {\n      case \"Pattern\":\n        this.visitPattern(node);\n        break;\n      case \"Flags\":\n        this.visitFlags(node);\n        break;\n      case \"Disjunction\":\n        this.visitDisjunction(node);\n        break;\n      case \"Alternative\":\n        this.visitAlternative(node);\n        break;\n      case \"StartAnchor\":\n        this.visitStartAnchor(node);\n        break;\n      case \"EndAnchor\":\n        this.visitEndAnchor(node);\n        break;\n      case \"WordBoundary\":\n        this.visitWordBoundary(node);\n        break;\n      case \"NonWordBoundary\":\n        this.visitNonWordBoundary(node);\n        break;\n      case \"Lookahead\":\n        this.visitLookahead(node);\n        break;\n      case \"NegativeLookahead\":\n        this.visitNegativeLookahead(node);\n        break;\n      case \"Lookbehind\":\n        this.visitLookbehind(node);\n        break;\n      case \"NegativeLookbehind\":\n        this.visitNegativeLookbehind(node);\n        break;\n      case \"Character\":\n        this.visitCharacter(node);\n        break;\n      case \"Set\":\n        this.visitSet(node);\n        break;\n      case \"Group\":\n        this.visitGroup(node);\n        break;\n      case \"GroupBackReference\":\n        this.visitGroupBackReference(node);\n        break;\n      case \"Quantifier\":\n        this.visitQuantifier(node);\n        break;\n    }\n\n    this.visitChildren(node);\n  }\n\n  public visitPattern(node: RegExpPattern): void {}\n\n  public visitFlags(node: RegExpFlags): void {}\n\n  public visitDisjunction(node: Disjunction): void {}\n\n  public visitAlternative(node: Alternative): void {}\n\n  // Assertion\n  public visitStartAnchor(node: Assertion): void {}\n\n  public visitEndAnchor(node: Assertion): void {}\n\n  public visitWordBoundary(node: Assertion): void {}\n\n  public visitNonWordBoundary(node: Assertion): void {}\n\n  public visitLookahead(node: Assertion): void {}\n\n  public visitNegativeLookahead(node: Assertion): void {}\n\n  public visitLookbehind(node: Assertion): void {}\n\n  public visitNegativeLookbehind(node: Assertion): void {}\n\n  // atoms\n  public visitCharacter(node: Character): void {}\n\n  public visitSet(node: Set): void {}\n\n  public visitGroup(node: Group): void {}\n\n  public visitGroupBackReference(node: GroupBackReference): void {}\n\n  public visitQuantifier(node: Quantifier): void {}\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { Set, Group, Character, IRegExpAST } from '@chevrotain/regexp-to-ast';\nimport { RegExpParser, BaseRegExpVisitor } from '@chevrotain/regexp-to-ast';\n\nexport const NEWLINE_REGEXP = /\\r?\\n/gm;\n\nconst regexpParser = new RegExpParser();\n\n/**\n * This class is in charge of heuristically identifying start/end tokens of terminals.\n *\n * The way this works is by doing the following:\n * 1. Traverse the regular expression in the \"start state\"\n * 2. Add any encountered sets/single characters to the \"start regexp\"\n * 3. Once we encounter any variable-length content (i.e. with quantifiers such as +/?/*), we enter the \"end state\"\n * 4. In the end state, any sets/single characters are added to an \"end stack\".\n * 5. If we re-encounter any variable-length content we reset the end stack\n * 6. We continue visiting the regex until the end, reseting the end stack and rebuilding it as necessary\n *\n * After traversing a regular expression the `startRegexp/endRegexp` properties allow access to the stored start/end of the terminal\n */\nclass TerminalRegExpVisitor extends BaseRegExpVisitor {\n\n    private isStarting = true;\n    startRegexp: string;\n    private endRegexpStack: string[] = [];\n    multiline = false;\n    regex: string;\n\n    get endRegex(): string {\n        return this.endRegexpStack.join('');\n    }\n\n    reset(regex: string): void {\n        this.multiline = false;\n        this.regex = regex;\n        this.startRegexp = '';\n        this.isStarting = true;\n        this.endRegexpStack = [];\n    }\n\n    override visitGroup(node: Group) {\n        if (node.quantifier) {\n            this.isStarting = false;\n            this.endRegexpStack = [];\n        }\n    }\n\n    override visitCharacter(node: Character): void {\n        const char = String.fromCharCode(node.value);\n        if (!this.multiline && char === '\\n') {\n            this.multiline = true;\n        }\n        if (node.quantifier) {\n            this.isStarting = false;\n            this.endRegexpStack = [];\n        } else {\n            const escapedChar = escapeRegExp(char);\n            this.endRegexpStack.push(escapedChar);\n            if (this.isStarting) {\n                this.startRegexp += escapedChar;\n            }\n        }\n    }\n\n    override visitSet(node: Set): void {\n        if (!this.multiline) {\n            const set = this.regex.substring(node.loc.begin, node.loc.end);\n            const regex = new RegExp(set);\n            this.multiline = Boolean('\\n'.match(regex));\n        }\n        if (node.quantifier) {\n            this.isStarting = false;\n            this.endRegexpStack = [];\n        } else {\n            const set = this.regex.substring(node.loc.begin, node.loc.end);\n            this.endRegexpStack.push(set);\n            if (this.isStarting) {\n                this.startRegexp += set;\n            }\n        }\n    }\n\n    override visitChildren(node: IRegExpAST): void {\n        if (node.type === 'Group') {\n            // Ignore children of groups with quantifier (+/*/?)\n            // These groups are unrelated to start/end tokens of terminals\n            const group = node as Group;\n            if (group.quantifier) {\n                return;\n            }\n        }\n        super.visitChildren(node);\n    }\n}\n\nconst visitor = new TerminalRegExpVisitor();\n\nexport function getTerminalParts(regexp: RegExp | string): Array<{ start: string, end: string }> {\n    try {\n        if (typeof regexp !== 'string') {\n            regexp = regexp.source;\n        }\n        regexp = `/${regexp}/`;\n        const pattern = regexpParser.pattern(regexp);\n        const parts: Array<{ start: string, end: string }> = [];\n        for (const alternative of pattern.value.value) {\n            visitor.reset(regexp);\n            visitor.visit(alternative);\n            parts.push({\n                start: visitor.startRegexp,\n                end: visitor.endRegex\n            });\n        }\n        return parts;\n    } catch {\n        return [];\n    }\n}\n\nexport function isMultilineComment(regexp: RegExp | string): boolean {\n    try {\n        if (typeof regexp === 'string') {\n            regexp = new RegExp(regexp);\n        }\n        regexp = regexp.toString();\n        visitor.reset(regexp);\n        // Parsing the pattern might fail (since it's user code)\n        visitor.visit(regexpParser.pattern(regexp));\n        return visitor.multiline;\n    } catch {\n        return false;\n    }\n}\n\n/**\n * A set of all characters that are considered whitespace by the '\\s' RegExp character class.\n * Taken from [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_expressions/Character_classes).\n */\nexport const whitespaceCharacters = (\n    '\\f\\n\\r\\t\\v\\u0020\\u00a0\\u1680\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007' +\n    '\\u2008\\u2009\\u200a\\u2028\\u2029\\u202f\\u205f\\u3000\\ufeff').split('');\n\nexport function isWhitespace(value: RegExp | string): boolean {\n    const regexp = typeof value === 'string' ? new RegExp(value) : value;\n    return whitespaceCharacters.some((ws) => regexp.test(ws));\n}\n\nexport function escapeRegExp(value: string): string {\n    return value.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n}\n\n/**\n * Determines whether the given input has a partial match with the specified regex.\n * @param regex The regex to partially match against\n * @param input The input string\n * @returns Whether any match exists.\n */\nexport function partialMatches(regex: RegExp | string, input: string): boolean {\n    const partial = partialRegExp(regex);\n    const match = input.match(partial);\n    return !!match && match[0].length > 0;\n}\n\n/**\n * Builds a partial regex from the input regex. A partial regex is able to match incomplete input strings. E.g.\n * a partial regex constructed from `/ab/` is able to match the string `a` without needing a following `b` character. However it won't match `b` alone.\n * @param regex The input regex to be converted.\n * @returns A partial regex constructed from the input regex.\n */\nexport function partialRegExp(regex: RegExp | string): RegExp {\n    if (typeof regex === 'string') {\n        regex = new RegExp(regex);\n    }\n    const re = regex, source = regex.source;\n    let i = 0;\n\n    function process() {\n        let result = '',\n            tmp;\n\n        function appendRaw(nbChars: number) {\n            result += source.substr(i, nbChars);\n            i += nbChars;\n        }\n\n        function appendOptional(nbChars: number) {\n            result += '(?:' + source.substr(i, nbChars) + '|$)';\n            i += nbChars;\n        }\n\n        while (i < source.length) {\n            switch (source[i]) {\n                case '\\\\':\n                    switch (source[i + 1]) {\n                        case 'c':\n                            appendOptional(3);\n                            break;\n                        case 'x':\n                            appendOptional(4);\n                            break;\n                        case 'u':\n                            if (re.unicode) {\n                                if (source[i + 2] === '{') {\n                                    appendOptional(source.indexOf('}', i) - i + 1);\n                                } else {\n                                    appendOptional(6);\n                                }\n                            } else {\n                                appendOptional(2);\n                            }\n                            break;\n                        case 'p':\n                        case 'P':\n                            if (re.unicode) {\n                                appendOptional(source.indexOf('}', i) - i + 1);\n                            } else {\n                                appendOptional(2);\n                            }\n                            break;\n                        case 'k':\n                            appendOptional(source.indexOf('>', i) - i + 1);\n                            break;\n                        default:\n                            appendOptional(2);\n                            break;\n                    }\n                    break;\n\n                case '[':\n                    tmp = /\\[(?:\\\\.|.)*?\\]/g;\n                    tmp.lastIndex = i;\n                    tmp = tmp.exec(source) || [];\n                    appendOptional(tmp[0].length);\n                    break;\n\n                case '|':\n                case '^':\n                case '$':\n                case '*':\n                case '+':\n                case '?':\n                    appendRaw(1);\n                    break;\n                case '{':\n                    tmp = /\\{\\d+,?\\d*\\}/g;\n                    tmp.lastIndex = i;\n                    tmp = tmp.exec(source);\n                    if (tmp) {\n                        appendRaw(tmp[0].length);\n                    } else {\n                        appendOptional(1);\n                    }\n                    break;\n                case '(':\n                    if (source[i + 1] === '?') {\n                        switch (source[i + 2]) {\n                            case ':':\n                                result += '(?:';\n                                i += 3;\n                                result += process() + '|$)';\n                                break;\n                            case '=':\n                                result += '(?=';\n                                i += 3;\n                                result += process() + ')';\n                                break;\n                            case '!':\n                                tmp = i;\n                                i += 3;\n                                process();\n                                result += source.substr(tmp, i - tmp);\n                                break;\n                            case '<':\n                                switch (source[i + 3]) {\n                                    case '=':\n                                    case '!':\n                                        tmp = i;\n                                        i += 4;\n                                        process();\n                                        result += source.substr(tmp, i - tmp);\n                                        break;\n                                    default:\n                                        appendRaw(source.indexOf('>', i) - i + 1);\n                                        result += process() + '|$)';\n                                        break;\n                                }\n                                break;\n                        }\n                    } else {\n                        appendRaw(1);\n                        result += process() + '|$)';\n                    }\n                    break;\n                case ')':\n                    ++i;\n                    return result;\n                default:\n                    appendOptional(1);\n                    break;\n            }\n        }\n\n        return result;\n    }\n\n    return new RegExp(process(), regex.flags);\n}\n", "/******************************************************************************\n * Copyright 2021-2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { assertUnreachable } from '../utils/errors.js';\nimport * as ast from '../languages/generated/ast.js';\nimport type { AstNode, CstNode } from '../syntax-tree.js';\nimport { isCompositeCstNode } from '../syntax-tree.js';\nimport { getContainerOfType, streamAllContents } from './ast-utils.js';\nimport { streamCst } from './cst-utils.js';\nimport { escapeRegExp, isWhitespace } from './regexp-utils.js';\n\n/**\n * Returns the entry rule of the given grammar, if any. If the grammar file does not contain an entry rule,\n * the result is `undefined`.\n */\nexport function getEntryRule(grammar: ast.Grammar): ast.ParserRule | undefined {\n    return grammar.rules.find(e => ast.isParserRule(e) && e.entry) as ast.ParserRule;\n}\n\n/**\n * Returns all hidden terminal rules of the given grammar, if any.\n */\nexport function getHiddenRules(grammar: ast.Grammar): ast.AbstractRule[] {\n    return grammar.rules.filter(e => ast.isTerminalRule(e) && e.hidden);\n}\n\n/**\n * Returns all rules that can be reached from the topmost rules of the specified grammar (entry and hidden terminal rules).\n *\n * @param grammar The grammar that contains all rules\n * @param allTerminals Whether or not to include terminals that are referenced only by other terminals\n * @returns A list of referenced parser and terminal rules. If the grammar contains no entry rule,\n *      this function returns all rules of the specified grammar.\n */\nexport function getAllReachableRules(grammar: ast.Grammar, allTerminals: boolean): Set<ast.AbstractRule> {\n    const ruleNames = new Set<string>();\n    const entryRule = getEntryRule(grammar);\n    if (!entryRule) {\n        return new Set(grammar.rules);\n    }\n\n    const topMostRules = [entryRule as ast.AbstractRule].concat(getHiddenRules(grammar));\n    for (const rule of topMostRules) {\n        ruleDfs(rule, ruleNames, allTerminals);\n    }\n\n    const rules = new Set<ast.AbstractRule>();\n    for (const rule of grammar.rules) {\n        if (ruleNames.has(rule.name) || (ast.isTerminalRule(rule) && rule.hidden)) {\n            rules.add(rule);\n        }\n    }\n    return rules;\n}\n\nfunction ruleDfs(rule: ast.AbstractRule, visitedSet: Set<string>, allTerminals: boolean): void {\n    visitedSet.add(rule.name);\n    streamAllContents(rule).forEach(node => {\n        if (ast.isRuleCall(node) || (allTerminals && ast.isTerminalRuleCall(node))) {\n            const refRule = node.rule.ref;\n            if (refRule && !visitedSet.has(refRule.name)) {\n                ruleDfs(refRule, visitedSet, allTerminals);\n            }\n        }\n    });\n}\n\n/**\n * Returns all parser rules which provide types which are used in the grammar as type in cross-references.\n * @param grammar the grammar to investigate\n * @returns the set of parser rules whose contributed types are used as type in cross-references\n */\nexport function getAllRulesUsedForCrossReferences(grammar: ast.Grammar): Set<ast.ParserRule> {\n    const result = new Set<ast.ParserRule>();\n    streamAllContents(grammar).forEach(node => {\n        if (ast.isCrossReference(node)) {\n            // the cross-reference refers directly to a parser rule (without \"returns\", without \"infers\")\n            if (ast.isParserRule(node.type.ref)) {\n                result.add(node.type.ref);\n            }\n            // the cross-reference refers to the explicitly inferred type of a parser rule\n            if (ast.isInferredType(node.type.ref) && ast.isParserRule(node.type.ref.$container)) {\n                result.add(node.type.ref.$container);\n            }\n        }\n    });\n    return result;\n}\n\n/**\n * Determines the grammar expression used to parse a cross-reference (usually a reference to a terminal rule).\n * A cross-reference can declare this expression explicitly in the form `[Type : Terminal]`, but if `Terminal`\n * is omitted, this function attempts to infer it from the name of the referenced `Type` (using `findNameAssignment`).\n *\n * Returns the grammar expression used to parse the given cross-reference, or `undefined` if it is not declared\n * and cannot be inferred.\n */\nexport function getCrossReferenceTerminal(crossRef: ast.CrossReference): ast.AbstractElement | undefined {\n    if (crossRef.terminal) {\n        return crossRef.terminal;\n    } else if (crossRef.type.ref) {\n        const nameAssigment = findNameAssignment(crossRef.type.ref);\n        return nameAssigment?.terminal;\n    }\n    return undefined;\n}\n\n/**\n * Determines whether the given terminal rule represents a comment. This is true if the rule is marked\n * as `hidden` and it does not match white space. This means every hidden token (i.e. excluded from the AST)\n * that contains visible characters is considered a comment.\n */\nexport function isCommentTerminal(terminalRule: ast.TerminalRule): boolean {\n    return terminalRule.hidden && !isWhitespace(terminalRegex(terminalRule));\n}\n\n/**\n * Find all CST nodes within the given node that contribute to the specified property.\n *\n * @param node A CST node in which to look for property assignments. If this is undefined, the result is an empty array.\n * @param property A property name of the constructed AST node. If this is undefined, the result is an empty array.\n */\nexport function findNodesForProperty(node: CstNode | undefined, property: string | undefined): CstNode[] {\n    if (!node || !property) {\n        return [];\n    }\n    return findNodesForPropertyInternal(node, property, node.astNode, true);\n}\n\n/**\n * Find a single CST node within the given node that contributes to the specified property.\n *\n * @param node A CST node in which to look for property assignments. If this is undefined, the result is `undefined`.\n * @param property A property name of the constructed AST node. If this is undefined, the result is `undefined`.\n * @param index If no index is specified or the index is less than zero, the first found node is returned. If the\n *        specified index exceeds the number of assignments to the property, the last found node is returned. Otherwise,\n *        the node with the specified index is returned.\n */\nexport function findNodeForProperty(node: CstNode | undefined, property: string | undefined, index?: number): CstNode | undefined {\n    if (!node || !property) {\n        return undefined;\n    }\n    const nodes = findNodesForPropertyInternal(node, property, node.astNode, true);\n    if (nodes.length === 0) {\n        return undefined;\n    }\n    if (index !== undefined) {\n        index = Math.max(0, Math.min(index, nodes.length - 1));\n    } else {\n        index = 0;\n    }\n    return nodes[index];\n}\n\nfunction findNodesForPropertyInternal(node: CstNode, property: string, element: AstNode | undefined, first: boolean): CstNode[] {\n    if (!first) {\n        const nodeFeature = getContainerOfType(node.grammarSource, ast.isAssignment);\n        if (nodeFeature && nodeFeature.feature === property) {\n            return [node];\n        }\n    }\n    if (isCompositeCstNode(node) && node.astNode === element) {\n        return node.content.flatMap(e => findNodesForPropertyInternal(e, property, element, false));\n    }\n    return [];\n}\n\n/**\n * Find all CST nodes within the given node that correspond to the specified keyword.\n *\n * @param node A CST node in which to look for keywords. If this is undefined, the result is an empty array.\n * @param keyword A keyword as specified in the grammar.\n */\nexport function findNodesForKeyword(node: CstNode | undefined, keyword: string): CstNode[] {\n    if (!node) {\n        return [];\n    }\n    return findNodesForKeywordInternal(node, keyword, node?.astNode);\n}\n\n/**\n * Find a single CST node within the given node that corresponds to the specified keyword.\n *\n * @param node A CST node in which to look for keywords. If this is undefined, the result is `undefined`.\n * @param keyword A keyword as specified in the grammar.\n * @param index If no index is specified or the index is less than zero, the first found node is returned. If the\n *        specified index exceeds the number of keyword occurrences, the last found node is returned. Otherwise,\n *        the node with the specified index is returned.\n */\nexport function findNodeForKeyword(node: CstNode | undefined, keyword: string, index?: number): CstNode | undefined {\n    if (!node) {\n        return undefined;\n    }\n    const nodes = findNodesForKeywordInternal(node, keyword, node?.astNode);\n    if (nodes.length === 0) {\n        return undefined;\n    }\n    if (index !== undefined) {\n        index = Math.max(0, Math.min(index, nodes.length - 1));\n    } else {\n        index = 0;\n    }\n    return nodes[index];\n}\n\nexport function findNodesForKeywordInternal(node: CstNode, keyword: string, element: AstNode | undefined): CstNode[] {\n    if (node.astNode !== element) {\n        return [];\n    }\n    if (ast.isKeyword(node.grammarSource) && node.grammarSource.value === keyword) {\n        return [node];\n    }\n    const treeIterator = streamCst(node).iterator();\n    let result: IteratorResult<CstNode>;\n    const keywordNodes: CstNode[] = [];\n    do {\n        result = treeIterator.next();\n        if (!result.done) {\n            const childNode = result.value;\n            if (childNode.astNode === element) {\n                if (ast.isKeyword(childNode.grammarSource) && childNode.grammarSource.value === keyword) {\n                    keywordNodes.push(childNode);\n                }\n            } else {\n                treeIterator.prune();\n            }\n        }\n    } while (!result.done);\n    return keywordNodes;\n}\n\n/**\n * If the given CST node was parsed in the context of a property assignment, the respective `Assignment` grammar\n * node is returned. If no assignment is found, the result is `undefined`.\n *\n * @param cstNode A CST node for which to find a property assignment.\n */\nexport function findAssignment(cstNode: CstNode): ast.Assignment | undefined {\n    const astNode = cstNode.astNode;\n    // Only search until the ast node of the parent cst node is no longer the original ast node\n    // This would make us jump to a preceding rule call, which contains only unrelated assignments\n    while (astNode === cstNode.container?.astNode) {\n        const assignment = getContainerOfType(cstNode.grammarSource, ast.isAssignment);\n        if (assignment) {\n            return assignment;\n        }\n        cstNode = cstNode.container;\n    }\n    return undefined;\n}\n\n/**\n * Find an assignment to the `name` property for the given grammar type. This requires the `type` to be inferred\n * from a parser rule, and that rule must contain an assignment to the `name` property. In all other cases,\n * this function returns `undefined`.\n */\nexport function findNameAssignment(type: ast.AbstractType): ast.Assignment | undefined {\n    let startNode: AstNode = type;\n    if (ast.isInferredType(startNode)) {\n        // for inferred types, the location to start searching for the name-assignment is different\n        if (ast.isAction(startNode.$container)) {\n            // a type which is explicitly inferred by an action: investigate the sibling of the Action node, i.e. start searching at the Action's parent\n            startNode = startNode.$container.$container!;\n        } else if (ast.isAbstractParserRule(startNode.$container)) {\n            // investigate the parser rule with the explicitly inferred type\n            startNode = startNode.$container;\n        } else {\n            assertUnreachable(startNode.$container);\n        }\n    }\n    return findNameAssignmentInternal(type, startNode, new Map());\n}\n\nfunction findNameAssignmentInternal(type: ast.AbstractType, startNode: AstNode, cache: Map<ast.AbstractType, ast.Assignment | undefined>): ast.Assignment | undefined {\n    // the cache is only required to prevent infinite loops\n    function go(node: AstNode, refType: ast.AbstractType): ast.Assignment | undefined {\n        let childAssignment: ast.Assignment | undefined = undefined;\n        const parentAssignment = getContainerOfType(node, ast.isAssignment);\n        // No parent assignment implies unassigned rule call\n        if (!parentAssignment) {\n            childAssignment = findNameAssignmentInternal(refType, refType, cache);\n        }\n        cache.set(type, childAssignment);\n        return childAssignment;\n    }\n\n    if (cache.has(type)) {\n        return cache.get(type);\n    }\n    cache.set(type, undefined);\n    for (const node of streamAllContents(startNode)) {\n        if (ast.isAssignment(node) && node.feature.toLowerCase() === 'name') {\n            cache.set(type, node);\n            return node;\n        } else if (ast.isRuleCall(node) && ast.isParserRule(node.rule.ref)) {\n            return go(node, node.rule.ref);\n        } else if (ast.isSimpleType(node) && node.typeRef?.ref) {\n            return go(node, node.typeRef.ref);\n        }\n    }\n    return undefined;\n}\n\nexport function getActionAtElement(element: ast.AbstractElement): ast.Action | undefined {\n    const parent = element.$container;\n    if (ast.isGroup(parent)) {\n        const elements = parent.elements;\n        const index = elements.indexOf(element);\n        for (let i = index - 1; i >= 0; i--) {\n            const item = elements[i];\n            if (ast.isAction(item)) {\n                return item;\n            } else {\n                const action = streamAllContents(elements[i]).find(ast.isAction);\n                if (action) {\n                    return action;\n                }\n            }\n        }\n    }\n    if (ast.isAbstractElement(parent)) {\n        return getActionAtElement(parent);\n    } else {\n        return undefined;\n    }\n}\n\nexport type Cardinality = '?' | '*' | '+' | undefined;\nexport type Operator = '=' | '+=' | '?=' | undefined;\n\nexport function isOptionalCardinality(cardinality?: Cardinality, element?: ast.AbstractElement): boolean {\n    return cardinality === '?' || cardinality === '*' || (ast.isGroup(element) && Boolean(element.guardCondition));\n}\n\nexport function isArrayCardinality(cardinality?: Cardinality): boolean {\n    return cardinality === '*' || cardinality === '+';\n}\n\nexport function isArrayOperator(operator?: Operator): boolean {\n    return operator === '+=';\n}\n\n/**\n * Determines whether the given parser rule is a _data type rule_, meaning that it has a\n * primitive return type like `number`, `boolean`, etc.\n */\nexport function isDataTypeRule(rule: ast.ParserRule): boolean {\n    return isDataTypeRuleInternal(rule, new Set());\n}\n\nfunction isDataTypeRuleInternal(rule: ast.ParserRule, visited: Set<ast.ParserRule>): boolean {\n    if (visited.has(rule)) {\n        return true;\n    } else {\n        visited.add(rule);\n    }\n    for (const node of streamAllContents(rule)) {\n        if (ast.isRuleCall(node)) {\n            if (!node.rule.ref) {\n                // RuleCall to unresolved rule. Don't assume `rule` is a DataType rule.\n                return false;\n            }\n            if (ast.isParserRule(node.rule.ref) && !isDataTypeRuleInternal(node.rule.ref, visited)) {\n                return false;\n            }\n            if (ast.isInfixRule(node.rule.ref)) {\n                return false;\n            }\n        } else if (ast.isAssignment(node)) {\n            return false;\n        } else if (ast.isAction(node)) {\n            return false;\n        }\n    }\n    return Boolean(rule.definition);\n}\n\nexport function isDataType(type: ast.Type): boolean {\n    return isDataTypeInternal(type.type, new Set());\n}\n\nfunction isDataTypeInternal(type: ast.TypeDefinition, visited: Set<ast.TypeDefinition>): boolean {\n    if (visited.has(type)) {\n        return true;\n    } else {\n        visited.add(type);\n    }\n    if (ast.isArrayType(type)) {\n        return false;\n    } else if (ast.isReferenceType(type)) {\n        return false;\n    } else if (ast.isUnionType(type)) {\n        return type.types.every(e => isDataTypeInternal(e, visited));\n    } else if (ast.isSimpleType(type)) {\n        if (type.primitiveType !== undefined) {\n            return true;\n        } else if (type.stringType !== undefined) {\n            return true;\n        } else if (type.typeRef !== undefined) {\n            const ref = type.typeRef.ref;\n            if (ast.isType(ref)) {\n                return isDataTypeInternal(ref.type, visited);\n            } else {\n                return false;\n            }\n        } else {\n            return false;\n        }\n    } else {\n        return false;\n    }\n}\n\nexport function getExplicitRuleType(rule: ast.AbstractRule): string | undefined {\n    if (ast.isTerminalRule(rule)) {\n        return undefined;\n    }\n    if (rule.inferredType) {\n        return rule.inferredType.name;\n    } else if (rule.dataType) {\n        return rule.dataType;\n    } else if (rule.returnType) {\n        const refType = rule.returnType.ref;\n        if (refType) {\n            return refType.name;\n        }\n    }\n    return undefined;\n}\n\nexport function getTypeName(type: ast.AbstractType | ast.Action): string {\n    if (ast.isAbstractParserRule(type)) {\n        return ast.isParserRule(type) && isDataTypeRule(type) ? type.name : getExplicitRuleType(type) ?? type.name;\n    } else if (ast.isInterface(type) || ast.isType(type) || ast.isReturnType(type)) {\n        return type.name;\n    } else if (ast.isAction(type)) {\n        const actionType = getActionType(type);\n        if (actionType) {\n            return actionType;\n        }\n    } else if (ast.isInferredType(type)) {\n        return type.name;\n    }\n    throw new Error('Cannot get name of Unknown Type');\n}\n\nexport function getActionType(action: ast.Action): string | undefined {\n    if (action.inferredType) {\n        return action.inferredType.name;\n    } else if (action.type?.ref) {\n        return getTypeName(action.type.ref);\n    }\n    return undefined; // not inferring and not referencing a valid type\n}\n\n/**\n * This function is used at development time (for code generation and the internal type system) to get the type of the AST node produced by the given rule.\n * For data type rules, the name of the rule is returned,\n * e.g. \"INT_value returns number: MY_INT;\" returns \"INT_value\".\n * @param rule the given rule\n * @returns the name of the AST node type of the rule\n */\nexport function getRuleTypeName(rule: ast.AbstractRule): string {\n    if (ast.isTerminalRule(rule)) {\n        return rule.type?.name ?? 'string';\n    } else {\n        return ast.isParserRule(rule) && isDataTypeRule(rule) ? rule.name : getExplicitRuleType(rule) ?? rule.name;\n    }\n}\n\n/**\n * This function is used at runtime to get the actual type of the values produced by the given rule at runtime.\n * For data type rules, the name of the declared return type of the rule is returned (if any),\n * e.g. \"INT_value returns number: MY_INT;\" returns \"number\".\n * @param rule the given rule\n * @returns the name of the type of the produced values of the rule at runtime\n */\nexport function getRuleType(rule: ast.AbstractRule): string {\n    if (ast.isTerminalRule(rule)) {\n        return rule.type?.name ?? 'string';\n    } else {\n        return getExplicitRuleType(rule) ?? rule.name;\n    }\n}\n\nexport function terminalRegex(terminalRule: ast.TerminalRule): RegExp {\n    const flags: Flags = {\n        s: false,\n        i: false,\n        u: false\n    };\n    const source = abstractElementToRegex(terminalRule.definition, flags);\n    const flagText = Object.entries(flags).filter(([, value]) => value).map(([name]) => name).join('');\n    return new RegExp(source, flagText);\n}\n\n// Using [\\s\\S]* allows to match everything, compared to . which doesn't match line terminators\nconst WILDCARD = /[\\s\\S]/.source;\n\ntype Flags = {\n    s: boolean;\n    i: boolean;\n    u: boolean;\n}\n\nfunction abstractElementToRegex(element: ast.AbstractElement, flags?: Flags): string {\n    if (ast.isTerminalAlternatives(element)) {\n        return terminalAlternativesToRegex(element);\n    } else if (ast.isTerminalGroup(element)) {\n        return terminalGroupToRegex(element);\n    } else if (ast.isCharacterRange(element)) {\n        return characterRangeToRegex(element);\n    } else if (ast.isTerminalRuleCall(element)) {\n        const rule = element.rule.ref;\n        if (!rule) {\n            throw new Error('Missing rule reference.');\n        }\n        return withCardinality(abstractElementToRegex(rule.definition), {\n            cardinality: element.cardinality,\n            lookahead: element.lookahead,\n            parenthesized: element.parenthesized\n        });\n    } else if (ast.isNegatedToken(element)) {\n        return negateTokenToRegex(element);\n    } else if (ast.isUntilToken(element)) {\n        return untilTokenToRegex(element);\n    } else if (ast.isRegexToken(element)) {\n        const lastSlash = element.regex.lastIndexOf('/');\n        const source = element.regex.substring(1, lastSlash);\n        const regexFlags = element.regex.substring(lastSlash + 1);\n        if (flags) {\n            flags.i = regexFlags.includes('i');\n            flags.s = regexFlags.includes('s');\n            flags.u = regexFlags.includes('u');\n        }\n        return withCardinality(source, {\n            cardinality: element.cardinality,\n            lookahead: element.lookahead,\n            parenthesized: element.parenthesized,\n            wrap: false\n        });\n    } else if (ast.isWildcard(element)) {\n        return withCardinality(WILDCARD, {\n            cardinality: element.cardinality,\n            lookahead: element.lookahead,\n            parenthesized: element.parenthesized\n        });\n    } else {\n        throw new Error(`Invalid terminal element: ${element?.$type}, ${element?.$cstNode?.text}`);\n    }\n}\n\nfunction terminalAlternativesToRegex(alternatives: ast.TerminalAlternatives): string {\n    return withCardinality(alternatives.elements.map(e => abstractElementToRegex(e)).join('|'), {\n        cardinality: alternatives.cardinality,\n        lookahead: alternatives.lookahead,\n        parenthesized: alternatives.parenthesized,\n        wrap: false // wrapping is not required for top level alternatives, and nested alternatives are already parenthesized according to the grammar\n    });\n}\n\nfunction terminalGroupToRegex(group: ast.TerminalGroup): string {\n    return withCardinality(group.elements.map(e => abstractElementToRegex(e)).join(''), {\n        cardinality: group.cardinality,\n        lookahead: group.lookahead,\n        parenthesized: group.parenthesized,\n        wrap: false // wrapping is not required for top level group, and nested group are already parenthesized according to the grammar\n    });\n}\n\nfunction untilTokenToRegex(until: ast.UntilToken): string {\n    return withCardinality(`${WILDCARD}*?${abstractElementToRegex(until.terminal)}`, {\n        cardinality: until.cardinality,\n        lookahead: until.lookahead,\n        parenthesized: until.parenthesized\n    });\n}\n\nfunction negateTokenToRegex(negate: ast.NegatedToken): string {\n    return withCardinality(`(?!${abstractElementToRegex(negate.terminal)})${WILDCARD}*?`, {\n        cardinality: negate.cardinality,\n        lookahead: negate.lookahead,\n        parenthesized: negate.parenthesized\n    });\n}\n\nfunction characterRangeToRegex(range: ast.CharacterRange): string {\n    if (range.right) {\n        return withCardinality(`[${keywordToRegex(range.left)}-${keywordToRegex(range.right)}]`, {\n            cardinality: range.cardinality,\n            lookahead: range.lookahead,\n            parenthesized: range.parenthesized,\n            wrap: false\n        });\n    }\n    return withCardinality(keywordToRegex(range.left), {\n        cardinality: range.cardinality,\n        lookahead: range.lookahead,\n        parenthesized: range.parenthesized,\n        wrap: false\n    });\n}\n\nfunction keywordToRegex(keyword: ast.Keyword): string {\n    return escapeRegExp(keyword.value);\n}\n\nfunction withCardinality(regex: string, options: {\n    cardinality?: string\n    parenthesized: boolean\n    lookahead?: string\n    wrap?: boolean\n}): string {\n    if (options.parenthesized || options.lookahead || options.wrap !== false) {\n        const groupConfig = options.lookahead ?? (options.parenthesized ? '' : '?:');\n        regex = `(${groupConfig}${regex})`;\n    }\n    if (options.cardinality) {\n        return `${regex}${options.cardinality}`;\n    }\n    return regex;\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { IToken } from 'chevrotain';\nimport * as ast from '../../languages/generated/ast.js';\nimport { getCrossReferenceTerminal, getExplicitRuleType, getTypeName, isArrayCardinality, isOptionalCardinality, terminalRegex } from '../../utils/grammar-utils.js';\nimport { getContainerOfType } from '../../utils/ast-utils.js';\n\nexport interface NextFeature<T extends ast.AbstractElement = ast.AbstractElement> {\n    /**\n     * A feature that could appear during completion.\n     */\n    feature: T\n    /**\n     * The type that carries this `feature`. Only set if we encounter a new type.\n     */\n    type?: string\n    /**\n     * The container property for the new `type`\n     */\n    property?: string\n}\n\n/**\n * Calculates any features that can follow the given feature stack.\n * This also includes features following optional features and features from previously called rules that could follow the last feature.\n * @param featureStack A stack of features starting at the entry rule and ending at the feature of the current cursor position.\n * @param unparsedTokens All tokens which haven't been parsed successfully yet. This is the case when we call this function inside an alternative or before parsing any tokens.\n * @returns Any `AbstractElement` that could be following the given feature stack.\n */\nexport function findNextFeatures(featureStack: NextFeature[][], unparsedTokens: IToken[]): NextFeature[] {\n    const context: InterpretationContext = {\n        stacks: featureStack,\n        tokens: unparsedTokens\n    };\n    interpretTokens(context);\n    // Reset the container property\n    context.stacks.flat().forEach(feature => { feature.property = undefined; });\n    const nextStacks = findNextFeatureStacks(context.stacks);\n    // We only need the last element of each stack\n    return nextStacks.map(e => e[e.length - 1]);\n}\n\nfunction findNextFeaturesInternal(stack: NextFeature[]): NextFeature[][] {\n    const features: NextFeature[][] = [];\n    if (stack.length === 0) {\n        return features;\n    }\n    const top = stack[stack.length - 1];\n    const { group, child } = findGroupAndChild(top.feature);\n\n    if (isArrayCardinality(child.cardinality)) {\n        // The feature can appear again, so we try to find its first features again\n        const repeatingFeatures = findFirstFeaturesInternal({\n            feature: child,\n            type: top.type,\n            property: top.property\n        });\n        features.push(...repeatingFeatures);\n    }\n\n    let groupIndex = -1;\n    if (group) {\n        groupIndex = group.elements.indexOf(child);\n    }\n\n    const parentStack = stack.slice(0, -1);\n    if (!group) {\n        const parent = getAbstractElementParent(child);\n        if (parent) {\n            // The feature is not part of a group\n            // But the parent might be\n            features.push(...findNextFeaturesInternal([\n                ...parentStack,\n                {\n                    feature: parent,\n                }\n            ]));\n        } else {\n            // The feature is \"standalone\", meaning it is the top-level feature of a rule\n            // The next elements are defined by the previous stack elements\n            features.push(...findNextFeaturesInternal(parentStack));\n        }\n    } else {\n        // The feature is somewhere within the group\n        const nextIndex = groupIndex + 1;\n        const { stacks, end } = findNextFeaturesInGroup({\n            feature: group,\n            type: top.type\n        }, nextIndex);\n        for (const newStack of stacks) {\n            features.push([...parentStack, ...newStack]);\n        }\n        // If we reached the end of the group, continue searching for following features\n        if (end) {\n            // Set groupIndex to the last element index to indicate that we are at the end of the group\n            // This will trigger the parent search below\n            groupIndex = group.elements.length - 1;\n        }\n    }\n    if (group && groupIndex === group.elements.length - 1) {\n        // The feature is the last element of a group\n        // The next elements are defined by the parent group\n        features.push(...findNextFeaturesInternal([\n            ...parentStack,\n            {\n                feature: group,\n            }\n        ]));\n    }\n\n    return features;\n}\n\n/**\n * Calculates the first child feature of any `AbstractElement`.\n * @param next The `AbstractElement` whose first child features should be calculated.\n */\nexport function findFirstFeatures(next: ast.AbstractElement): NextFeature[][] {\n    return findFirstFeaturesInternal({ feature: next });\n}\n\nfunction findFirstFeaturesInternal(next: NextFeature): NextFeature[][] {\n    const { feature, type } = next;\n    if (ast.isGroup(feature)) {\n        return findNextFeaturesInGroup(next as NextFeature<ast.Group>, 0).stacks;\n    } else if (ast.isAlternatives(feature) || ast.isUnorderedGroup(feature)) {\n        return feature.elements.flatMap(e => findFirstFeaturesInternal({\n            feature: e,\n            type,\n            property: next.property\n        }));\n    } else if (ast.isAssignment(feature)) {\n        return findFirstFeaturesInternal({\n            feature: feature.terminal,\n            type,\n            property: next.property ?? feature.feature\n        });\n    } else if (ast.isAction(feature)) {\n        return findNextFeaturesInternal([{\n            feature,\n            type: getTypeName(feature),\n            property: next.property ?? feature.feature\n        }]);\n    } else if (ast.isRuleCall(feature) && ast.isParserRule(feature.rule.ref)) {\n        const rule = feature.rule.ref;\n        const stacks = findFirstFeaturesInternal({\n            feature: rule.definition,\n            type: rule.fragment || rule.dataType ? undefined : (getExplicitRuleType(rule) ?? rule.name),\n            property: next.property\n        });\n        for (const stack of stacks) {\n            stack.unshift(next);\n        }\n        return stacks;\n    } else if (ast.isRuleCall(feature) && ast.isInfixRule(feature.rule.ref)) {\n        const rule = feature.rule.ref;\n        const call = rule.call.rule.ref;\n        if (!ast.isParserRule(call)) {\n            console.error('Failed to resolve reference to ' + rule.call.rule.$refText);\n            return [];\n        }\n        const stacks = findFirstFeaturesInternal({\n            feature: call.definition,\n            type: getExplicitRuleType(call) ?? call.name,\n            property: 'parts'\n        });\n        for (const stack of stacks) {\n            stack.unshift(next);\n        }\n        return stacks;\n    } else {\n        return [[next]];\n    }\n}\n\ninterface FirstGroupFeatures {\n    stacks: NextFeature[][]\n    /**\n     * Indicates whether the end of the group has been reached.\n     * If true, the caller should continue searching for following features.\n     */\n    end: boolean\n}\n\nfunction findNextFeaturesInGroup(next: NextFeature<ast.Group>, index: number): FirstGroupFeatures {\n    const features: NextFeature[][] = [];\n    let firstFeature: NextFeature;\n    while (index < next.feature.elements.length) {\n        const feature = next.feature.elements[index];\n        firstFeature = {\n            feature,\n            type: next.type\n        };\n        const stacks = findFirstFeaturesInternal(firstFeature);\n        features.push(...stacks);\n        if (isElementOptional(feature, new Map())) {\n            // Continue with the next element\n            index++;\n        } else {\n            break;\n        }\n    }\n    return {\n        stacks: features,\n        end: index >= next.feature.elements.length\n    };\n}\n\n/**\n * Determines recursively whether an element is optional. It is not sufficient to check only the cardinality of the element itself,\n * because it could a group or alternative that contains only optional elements.\n */\nfunction isElementOptional(feature: ast.AbstractElement, visited: Map<ast.AbstractElement, boolean>): boolean {\n    const visitedResult = visited.get(feature);\n    if (visitedResult !== undefined) {\n        return visitedResult;\n    }\n    visited.set(feature, false);\n    if (isOptionalCardinality(feature.cardinality, feature)) {\n        visited.set(feature, true);\n        return true;\n    }\n    if (ast.isGroup(feature)) {\n        for (const element of feature.elements) {\n            if (!isElementOptional(element, visited)) {\n                visited.set(feature, false);\n                return false;\n            }\n        }\n        visited.set(feature, true);\n        return true;\n    } else if (ast.isAlternatives(feature) || ast.isUnorderedGroup(feature)) {\n        for (const element of feature.elements) {\n            if (isElementOptional(element, visited)) {\n                visited.set(feature, true);\n                return true;\n            }\n        }\n        visited.set(feature, false);\n        return false;\n    } else if (ast.isRuleCall(feature) && ast.isParserRule(feature.rule.ref)) {\n        const rule = feature.rule.ref;\n        const result = isElementOptional(rule.definition, visited);\n        visited.set(feature, result);\n        return result;\n    }\n    return false;\n}\n\ninterface InterpretationContext {\n    tokens: IToken[]\n    stacks: NextFeature[][]\n}\n\nfunction interpretTokens(context: InterpretationContext): void {\n    for (const token of context.tokens) {\n        const nextFeatureStacks = findNextFeatureStacks(context.stacks, token);\n        context.stacks = nextFeatureStacks;\n    }\n}\n\nfunction findNextFeatureStacks(stacks: NextFeature[][], token?: IToken): NextFeature[][] {\n    const newStacks: NextFeature[][] = [];\n    for (const stack of stacks) {\n        newStacks.push(...interpretStackToken(stack, token));\n    }\n    return newStacks;\n}\n\nfunction interpretStackToken(stack: NextFeature[], token?: IToken): NextFeature[][] {\n    const allNextFeatures = findNextFeaturesInternal(stack);\n    const matchingNextFeatures = allNextFeatures.filter(next => token ? featureMatches(next[next.length - 1].feature, token) : true);\n    return matchingNextFeatures;\n}\n\nexport function findGroupAndChild(feature: ast.AbstractElement): { group: ast.Group | undefined, child: ast.AbstractElement } {\n    let parent: ast.Group | undefined;\n    let item = feature;\n    while (item.$container) {\n        if (ast.isGroup(item.$container)) {\n            parent = item.$container;\n            break;\n        } else if (ast.isAbstractElement(item.$container)) {\n            item = item.$container;\n        } else {\n            break;\n        }\n    }\n    if (parent) {\n        return { group: parent, child: item };\n    }\n    return {\n        group: undefined,\n        // Even if there is no group, return the feature parent if it is an assignment\n        // We need this later to handle the cardinality of the feature correctly\n        child: getContainerOfType(feature, ast.isAssignment) ?? feature\n    };\n}\n\nfunction getAbstractElementParent(element: ast.AbstractElement): ast.AbstractElement | undefined {\n    const parent = element.$container;\n    const assignment = getContainerOfType(parent, ast.isAssignment);\n    if (assignment) {\n        return getAbstractElementParent(assignment);\n    } else {\n        if (parent && ast.isAbstractElement(parent)) {\n            return parent;\n        }\n    }\n    return undefined;\n}\n\nfunction featureMatches(feature: ast.AbstractElement, token: IToken): boolean {\n    if (ast.isKeyword(feature)) {\n        const content = feature.value;\n        return content === token.tokenType.name;\n    } else if (ast.isRuleCall(feature)) {\n        return ruleMatches(feature.rule.ref, token);\n    } else if (ast.isCrossReference(feature)) {\n        const crossRefTerminal = getCrossReferenceTerminal(feature);\n        if (crossRefTerminal) {\n            return featureMatches(crossRefTerminal, token);\n        }\n    }\n    return false;\n}\n\nfunction ruleMatches(rule: ast.AbstractRule | undefined, token: IToken): boolean {\n    if (ast.isParserRule(rule)) {\n        const ruleFeatures = findFirstFeatures(rule.definition);\n        return ruleFeatures.some(e => featureMatches(e[e.length - 1].feature, token));\n    } else if (ast.isTerminalRule(rule)) {\n        return terminalRegex(rule).test(token.image);\n    } else {\n        return false;\n    }\n}\n", "// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\n\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nfunction assertPath(path) {\n  if (typeof path !== 'string') {\n    throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n  }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n  var res = '';\n  var lastSegmentLength = 0;\n  var lastSlash = -1;\n  var dots = 0;\n  var code;\n  for (var i = 0; i <= path.length; ++i) {\n    if (i < path.length)\n      code = path.charCodeAt(i);\n    else if (code === 47 /*/*/)\n      break;\n    else\n      code = 47 /*/*/;\n    if (code === 47 /*/*/) {\n      if (lastSlash === i - 1 || dots === 1) {\n        // NOOP\n      } else if (lastSlash !== i - 1 && dots === 2) {\n        if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n          if (res.length > 2) {\n            var lastSlashIndex = res.lastIndexOf('/');\n            if (lastSlashIndex !== res.length - 1) {\n              if (lastSlashIndex === -1) {\n                res = '';\n                lastSegmentLength = 0;\n              } else {\n                res = res.slice(0, lastSlashIndex);\n                lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n              }\n              lastSlash = i;\n              dots = 0;\n              continue;\n            }\n          } else if (res.length === 2 || res.length === 1) {\n            res = '';\n            lastSegmentLength = 0;\n            lastSlash = i;\n            dots = 0;\n            continue;\n          }\n        }\n        if (allowAboveRoot) {\n          if (res.length > 0)\n            res += '/..';\n          else\n            res = '..';\n          lastSegmentLength = 2;\n        }\n      } else {\n        if (res.length > 0)\n          res += '/' + path.slice(lastSlash + 1, i);\n        else\n          res = path.slice(lastSlash + 1, i);\n        lastSegmentLength = i - lastSlash - 1;\n      }\n      lastSlash = i;\n      dots = 0;\n    } else if (code === 46 /*.*/ && dots !== -1) {\n      ++dots;\n    } else {\n      dots = -1;\n    }\n  }\n  return res;\n}\n\nfunction _format(sep, pathObject) {\n  var dir = pathObject.dir || pathObject.root;\n  var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n  if (!dir) {\n    return base;\n  }\n  if (dir === pathObject.root) {\n    return dir + base;\n  }\n  return dir + sep + base;\n}\n\nvar posix = {\n  // path.resolve([from ...], to)\n  resolve: function resolve() {\n    var resolvedPath = '';\n    var resolvedAbsolute = false;\n    var cwd;\n\n    for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n      var path;\n      if (i >= 0)\n        path = arguments[i];\n      else {\n        if (cwd === undefined)\n          cwd = process.cwd();\n        path = cwd;\n      }\n\n      assertPath(path);\n\n      // Skip empty entries\n      if (path.length === 0) {\n        continue;\n      }\n\n      resolvedPath = path + '/' + resolvedPath;\n      resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n    }\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\n    // Normalize the path\n    resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n    if (resolvedAbsolute) {\n      if (resolvedPath.length > 0)\n        return '/' + resolvedPath;\n      else\n        return '/';\n    } else if (resolvedPath.length > 0) {\n      return resolvedPath;\n    } else {\n      return '.';\n    }\n  },\n\n  normalize: function normalize(path) {\n    assertPath(path);\n\n    if (path.length === 0) return '.';\n\n    var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n    var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n    // Normalize the path\n    path = normalizeStringPosix(path, !isAbsolute);\n\n    if (path.length === 0 && !isAbsolute) path = '.';\n    if (path.length > 0 && trailingSeparator) path += '/';\n\n    if (isAbsolute) return '/' + path;\n    return path;\n  },\n\n  isAbsolute: function isAbsolute(path) {\n    assertPath(path);\n    return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n  },\n\n  join: function join() {\n    if (arguments.length === 0)\n      return '.';\n    var joined;\n    for (var i = 0; i < arguments.length; ++i) {\n      var arg = arguments[i];\n      assertPath(arg);\n      if (arg.length > 0) {\n        if (joined === undefined)\n          joined = arg;\n        else\n          joined += '/' + arg;\n      }\n    }\n    if (joined === undefined)\n      return '.';\n    return posix.normalize(joined);\n  },\n\n  relative: function relative(from, to) {\n    assertPath(from);\n    assertPath(to);\n\n    if (from === to) return '';\n\n    from = posix.resolve(from);\n    to = posix.resolve(to);\n\n    if (from === to) return '';\n\n    // Trim any leading backslashes\n    var fromStart = 1;\n    for (; fromStart < from.length; ++fromStart) {\n      if (from.charCodeAt(fromStart) !== 47 /*/*/)\n        break;\n    }\n    var fromEnd = from.length;\n    var fromLen = fromEnd - fromStart;\n\n    // Trim any leading backslashes\n    var toStart = 1;\n    for (; toStart < to.length; ++toStart) {\n      if (to.charCodeAt(toStart) !== 47 /*/*/)\n        break;\n    }\n    var toEnd = to.length;\n    var toLen = toEnd - toStart;\n\n    // Compare paths to find the longest common path from root\n    var length = fromLen < toLen ? fromLen : toLen;\n    var lastCommonSep = -1;\n    var i = 0;\n    for (; i <= length; ++i) {\n      if (i === length) {\n        if (toLen > length) {\n          if (to.charCodeAt(toStart + i) === 47 /*/*/) {\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          } else 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        } else if (fromLen > length) {\n          if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\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          } else if (i === 0) {\n            // We get here if `to` is the root.\n            // For example: from='/foo'; to='/'\n            lastCommonSep = 0;\n          }\n        }\n        break;\n      }\n      var fromCode = from.charCodeAt(fromStart + i);\n      var toCode = to.charCodeAt(toStart + i);\n      if (fromCode !== toCode)\n        break;\n      else if (fromCode === 47 /*/*/)\n        lastCommonSep = i;\n    }\n\n    var 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) === 47 /*/*/) {\n        if (out.length === 0)\n          out += '..';\n        else\n          out += '/..';\n      }\n    }\n\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 + to.slice(toStart + lastCommonSep);\n    else {\n      toStart += lastCommonSep;\n      if (to.charCodeAt(toStart) === 47 /*/*/)\n        ++toStart;\n      return to.slice(toStart);\n    }\n  },\n\n  _makeLong: function _makeLong(path) {\n    return path;\n  },\n\n  dirname: function dirname(path) {\n    assertPath(path);\n    if (path.length === 0) return '.';\n    var code = path.charCodeAt(0);\n    var hasRoot = code === 47 /*/*/;\n    var end = -1;\n    var matchedSlash = true;\n    for (var i = path.length - 1; i >= 1; --i) {\n      code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\n          if (!matchedSlash) {\n            end = i;\n            break;\n          }\n        } else {\n        // We saw the first non-path separator\n        matchedSlash = false;\n      }\n    }\n\n    if (end === -1) return hasRoot ? '/' : '.';\n    if (hasRoot && end === 1) return '//';\n    return path.slice(0, end);\n  },\n\n  basename: function basename(path, ext) {\n    if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n    assertPath(path);\n\n    var start = 0;\n    var end = -1;\n    var matchedSlash = true;\n    var i;\n\n    if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n      if (ext.length === path.length && ext === path) return '';\n      var extIdx = ext.length - 1;\n      var firstNonSlashEnd = -1;\n      for (i = path.length - 1; i >= 0; --i) {\n        var code = path.charCodeAt(i);\n        if (code === 47 /*/*/) {\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          } 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 === ext.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            } 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\n      if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n      return path.slice(start, end);\n    } else {\n      for (i = path.length - 1; i >= 0; --i) {\n        if (path.charCodeAt(i) === 47 /*/*/) {\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          } 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\n      if (end === -1) return '';\n      return path.slice(start, end);\n    }\n  },\n\n  extname: function extname(path) {\n    assertPath(path);\n    var startDot = -1;\n    var startPart = 0;\n    var end = -1;\n    var 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    var preDotState = 0;\n    for (var i = path.length - 1; i >= 0; --i) {\n      var code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\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 === 46 /*.*/) {\n          // If this is our first dot, mark it as the start of our extension\n          if (startDot === -1)\n            startDot = i;\n          else if (preDotState !== 1)\n            preDotState = 1;\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\n    if (startDot === -1 || 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 && startDot === end - 1 && startDot === startPart + 1) {\n      return '';\n    }\n    return path.slice(startDot, end);\n  },\n\n  format: function format(pathObject) {\n    if (pathObject === null || typeof pathObject !== 'object') {\n      throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n    }\n    return _format('/', pathObject);\n  },\n\n  parse: function parse(path) {\n    assertPath(path);\n\n    var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n    if (path.length === 0) return ret;\n    var code = path.charCodeAt(0);\n    var isAbsolute = code === 47 /*/*/;\n    var start;\n    if (isAbsolute) {\n      ret.root = '/';\n      start = 1;\n    } else {\n      start = 0;\n    }\n    var startDot = -1;\n    var startPart = 0;\n    var end = -1;\n    var matchedSlash = true;\n    var i = path.length - 1;\n\n    // Track the state of characters (if any) we see before our first dot and\n    // after any path separator we find\n    var preDotState = 0;\n\n    // Get non-dir info\n    for (; i >= start; --i) {\n      code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\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 === 46 /*.*/) {\n          // If this is our first dot, mark it as the start of our extension\n          if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\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\n    if (startDot === -1 || 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 && startDot === end - 1 && startDot === startPart + 1) {\n      if (end !== -1) {\n        if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n      }\n    } else {\n      if (startPart === 0 && isAbsolute) {\n        ret.name = path.slice(1, startDot);\n        ret.base = path.slice(1, end);\n      } else {\n        ret.name = path.slice(startPart, startDot);\n        ret.base = path.slice(startPart, end);\n      }\n      ret.ext = path.slice(startDot, end);\n    }\n\n    if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n    return ret;\n  },\n\n  sep: '/',\n  delimiter: ':',\n  win32: null,\n  posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n", "// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n", "// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};", "__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))", "// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\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'use strict';\n\n// !!!!!\n// SEE https://github.com/microsoft/vscode/blob/master/src/vs/base/common/platform.ts\n// !!!!!\n\ndeclare const process: { platform: 'win32' };\ndeclare const navigator: { userAgent: string };\n\nexport let isWindows: boolean;\n\nif (typeof process === 'object') {\n\tisWindows = process.platform === 'win32';\n} else if (typeof navigator === 'object') {\n\tlet userAgent = navigator.userAgent;\n\tisWindows = userAgent.indexOf('Windows') >= 0;\n}\n", "/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n'use strict';\n\nimport { CharCode } from './charCode'\nimport { isWindows } from './platform';\n\nconst _schemePattern = /^\\w[\\w\\d+.-]*$/;\nconst _singleSlashStart = /^\\//;\nconst _doubleSlashStart = /^\\/\\//;\n\nfunction _validateUri(ret: URI, _strict?: boolean): void {\n\n\t// scheme, must be set\n\tif (!ret.scheme && _strict) {\n\t\tthrow new Error(`[UriError]: Scheme is missing: {scheme: \"\", authority: \"${ret.authority}\", path: \"${ret.path}\", query: \"${ret.query}\", fragment: \"${ret.fragment}\"}`);\n\t}\n\n\t// scheme, https://tools.ietf.org/html/rfc3986#section-3.1\n\t// ALPHA *( ALPHA / DIGIT / \"+\" / \"-\" / \".\" )\n\tif (ret.scheme && !_schemePattern.test(ret.scheme)) {\n\t\tthrow new Error('[UriError]: Scheme contains illegal characters.');\n\t}\n\n\t// path, http://tools.ietf.org/html/rfc3986#section-3.3\n\t// If a URI contains an authority component, then the path component\n\t// must either be empty or begin with a slash (\"/\") character.  If a URI\n\t// does not contain an authority component, then the path cannot begin\n\t// with two slash characters (\"//\").\n\tif (ret.path) {\n\t\tif (ret.authority) {\n\t\t\tif (!_singleSlashStart.test(ret.path)) {\n\t\t\t\tthrow new Error('[UriError]: If a URI contains an authority component, then the path component must either be empty or begin with a slash (\"/\") character');\n\t\t\t}\n\t\t} else {\n\t\t\tif (_doubleSlashStart.test(ret.path)) {\n\t\t\t\tthrow new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters (\"//\")');\n\t\t\t}\n\t\t}\n\t}\n}\n\n// for a while we allowed uris *without* schemes and this is the migration\n// for them, e.g. an uri without scheme and without strict-mode warns and falls\n// back to the file-scheme. that should cause the least carnage and still be a\n// clear warning\nfunction _schemeFix(scheme: string, _strict: boolean): string {\n\tif (!scheme && !_strict) {\n\t\treturn 'file';\n\t}\n\treturn scheme;\n}\n\n// implements a bit of https://tools.ietf.org/html/rfc3986#section-5\nfunction _referenceResolution(scheme: string, path: string): string {\n\n\t// the slash-character is our 'default base' as we don't\n\t// support constructing URIs relative to other URIs. This\n\t// also means that we alter and potentially break paths.\n\t// see https://tools.ietf.org/html/rfc3986#section-5.1.4\n\tswitch (scheme) {\n\t\tcase 'https':\n\t\tcase 'http':\n\t\tcase 'file':\n\t\t\tif (!path) {\n\t\t\t\tpath = _slash;\n\t\t\t} else if (path[0] !== _slash) {\n\t\t\t\tpath = _slash + path;\n\t\t\t}\n\t\t\tbreak;\n\t}\n\treturn path;\n}\n\nconst _empty = '';\nconst _slash = '/';\nconst _regexp = /^(([^:/?#]+?):)?(\\/\\/([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?/;\n\n/**\n * Uniform Resource Identifier (URI) http://tools.ietf.org/html/rfc3986.\n * This class is a simple parser which creates the basic component parts\n * (http://tools.ietf.org/html/rfc3986#section-3) with minimal validation\n * and encoding.\n *\n * ```txt\n *       foo://example.com:8042/over/there?name=ferret#nose\n *       \\_/   \\______________/\\_________/ \\_________/ \\__/\n *        |           |            |            |        |\n *     scheme     authority       path        query   fragment\n *        |   _____________________|__\n *       / \\ /                        \\\n *       urn:example:animal:ferret:nose\n * ```\n */\nexport class URI implements UriComponents {\n\n\tstatic isUri(thing: any): thing is URI {\n\t\tif (thing instanceof URI) {\n\t\t\treturn true;\n\t\t}\n\t\tif (!thing) {\n\t\t\treturn false;\n\t\t}\n\t\treturn typeof (<URI>thing).authority === 'string'\n\t\t\t&& typeof (<URI>thing).fragment === 'string'\n\t\t\t&& typeof (<URI>thing).path === 'string'\n\t\t\t&& typeof (<URI>thing).query === 'string'\n\t\t\t&& typeof (<URI>thing).scheme === 'string'\n\t\t\t&& typeof (<URI>thing).fsPath === 'string'\n\t\t\t&& typeof (<URI>thing).with === 'function'\n\t\t\t&& typeof (<URI>thing).toString === 'function';\n\t}\n\n\t/**\n\t * scheme is the 'http' part of 'http://www.example.com/some/path?query#fragment'.\n\t * The part before the first colon.\n\t */\n\treadonly scheme: string;\n\n\t/**\n\t * authority is the 'www.example.com' part of 'http://www.example.com/some/path?query#fragment'.\n\t * The part between the first double slashes and the next slash.\n\t */\n\treadonly authority: string;\n\n\t/**\n\t * path is the '/some/path' part of 'http://www.example.com/some/path?query#fragment'.\n\t */\n\treadonly path: string;\n\n\t/**\n\t * query is the 'query' part of 'http://www.example.com/some/path?query#fragment'.\n\t */\n\treadonly query: string;\n\n\t/**\n\t * fragment is the 'fragment' part of 'http://www.example.com/some/path?query#fragment'.\n\t */\n\treadonly fragment: string;\n\n\t/**\n\t * @internal\n\t */\n\tprotected constructor(scheme: string, authority?: string, path?: string, query?: string, fragment?: string, _strict?: boolean);\n\n\t/**\n\t * @internal\n\t */\n\tprotected constructor(components: UriComponents);\n\n\t/**\n\t * @internal\n\t */\n\tprotected constructor(schemeOrData: string | UriComponents, authority?: string, path?: string, query?: string, fragment?: string, _strict: boolean = false) {\n\n\t\tif (typeof schemeOrData === 'object') {\n\t\t\tthis.scheme = schemeOrData.scheme || _empty;\n\t\t\tthis.authority = schemeOrData.authority || _empty;\n\t\t\tthis.path = schemeOrData.path || _empty;\n\t\t\tthis.query = schemeOrData.query || _empty;\n\t\t\tthis.fragment = schemeOrData.fragment || _empty;\n\t\t\t// no validation because it's this URI\n\t\t\t// that creates uri components.\n\t\t\t// _validateUri(this);\n\t\t} else {\n\t\t\tthis.scheme = _schemeFix(schemeOrData, _strict);\n\t\t\tthis.authority = authority || _empty;\n\t\t\tthis.path = _referenceResolution(this.scheme, path || _empty);\n\t\t\tthis.query = query || _empty;\n\t\t\tthis.fragment = fragment || _empty;\n\n\t\t\t_validateUri(this, _strict);\n\t\t}\n\t}\n\n\t// ---- filesystem path -----------------------\n\n\t/**\n\t * Returns a string representing the corresponding file system path of this URI.\n\t * Will handle UNC paths, normalizes windows drive letters to lower-case, and uses the\n\t * platform specific path separator.\n\t *\n\t * * Will *not* validate the path for invalid characters and semantics.\n\t * * Will *not* look at the scheme of this URI.\n\t * * The result shall *not* be used for display purposes but for accessing a file on disk.\n\t *\n\t *\n\t * The *difference* to `URI#path` is the use of the platform specific separator and the handling\n\t * of UNC paths. See the below sample of a file-uri with an authority (UNC path).\n\t *\n\t * ```ts\n\t\tconst u = URI.parse('file://server/c$/folder/file.txt')\n\t\tu.authority === 'server'\n\t\tu.path === '/shares/c$/file.txt'\n\t\tu.fsPath === '\\\\server\\c$\\folder\\file.txt'\n\t```\n\t *\n\t * Using `URI#path` to read a file (using fs-apis) would not be enough because parts of the path,\n\t * namely the server name, would be missing. Therefore `URI#fsPath` exists - it's sugar to ease working\n\t * with URIs that represent files on disk (`file` scheme).\n\t */\n\tget fsPath(): string {\n\t\t// if (this.scheme !== 'file') {\n\t\t// \tconsole.warn(`[UriError] calling fsPath with scheme ${this.scheme}`);\n\t\t// }\n\t\treturn uriToFsPath(this, false);\n\t}\n\n\t// ---- modify to new -------------------------\n\n\twith(change: { scheme?: string; authority?: string | null; path?: string | null; query?: string | null; fragment?: string | null }): URI {\n\n\t\tif (!change) {\n\t\t\treturn this;\n\t\t}\n\n\t\tlet { scheme, authority, path, query, fragment } = change;\n\t\tif (scheme === undefined) {\n\t\t\tscheme = this.scheme;\n\t\t} else if (scheme === null) {\n\t\t\tscheme = _empty;\n\t\t}\n\t\tif (authority === undefined) {\n\t\t\tauthority = this.authority;\n\t\t} else if (authority === null) {\n\t\t\tauthority = _empty;\n\t\t}\n\t\tif (path === undefined) {\n\t\t\tpath = this.path;\n\t\t} else if (path === null) {\n\t\t\tpath = _empty;\n\t\t}\n\t\tif (query === undefined) {\n\t\t\tquery = this.query;\n\t\t} else if (query === null) {\n\t\t\tquery = _empty;\n\t\t}\n\t\tif (fragment === undefined) {\n\t\t\tfragment = this.fragment;\n\t\t} else if (fragment === null) {\n\t\t\tfragment = _empty;\n\t\t}\n\n\t\tif (scheme === this.scheme\n\t\t\t&& authority === this.authority\n\t\t\t&& path === this.path\n\t\t\t&& query === this.query\n\t\t\t&& fragment === this.fragment) {\n\n\t\t\treturn this;\n\t\t}\n\n\t\treturn new Uri(scheme, authority, path, query, fragment);\n\t}\n\n\t// ---- parse & validate ------------------------\n\n\t/**\n\t * Creates a new URI from a string, e.g. `http://www.example.com/some/path`,\n\t * `file:///usr/home`, or `scheme:with/path`.\n\t *\n\t * @param value A string which represents an URI (see `URI#toString`).\n\t */\n\tstatic parse(value: string, _strict: boolean = false): URI {\n\t\tconst match = _regexp.exec(value);\n\t\tif (!match) {\n\t\t\treturn new Uri(_empty, _empty, _empty, _empty, _empty);\n\t\t}\n\t\treturn new Uri(\n\t\t\tmatch[2] || _empty,\n\t\t\tpercentDecode(match[4] || _empty),\n\t\t\tpercentDecode(match[5] || _empty),\n\t\t\tpercentDecode(match[7] || _empty),\n\t\t\tpercentDecode(match[9] || _empty),\n\t\t\t_strict\n\t\t);\n\t}\n\n\t/**\n\t * Creates a new URI from a file system path, e.g. `c:\\my\\files`,\n\t * `/usr/home`, or `\\\\server\\share\\some\\path`.\n\t *\n\t * The *difference* between `URI#parse` and `URI#file` is that the latter treats the argument\n\t * as path, not as stringified-uri. E.g. `URI.file(path)` is **not the same as**\n\t * `URI.parse('file://' + path)` because the path might contain characters that are\n\t * interpreted (# and ?). See the following sample:\n\t * ```ts\n\tconst good = URI.file('/coding/c#/project1');\n\tgood.scheme === 'file';\n\tgood.path === '/coding/c#/project1';\n\tgood.fragment === '';\n\tconst bad = URI.parse('file://' + '/coding/c#/project1');\n\tbad.scheme === 'file';\n\tbad.path === '/coding/c'; // path is now broken\n\tbad.fragment === '/project1';\n\t```\n\t *\n\t * @param path A file system path (see `URI#fsPath`)\n\t */\n\tstatic file(path: string): URI {\n\n\t\tlet authority = _empty;\n\n\t\t// normalize to fwd-slashes on windows,\n\t\t// on other systems bwd-slashes are valid\n\t\t// filename character, eg /f\\oo/ba\\r.txt\n\t\tif (isWindows) {\n\t\t\tpath = path.replace(/\\\\/g, _slash);\n\t\t}\n\n\t\t// check for authority as used in UNC shares\n\t\t// or use the path as given\n\t\tif (path[0] === _slash && path[1] === _slash) {\n\t\t\tconst idx = path.indexOf(_slash, 2);\n\t\t\tif (idx === -1) {\n\t\t\t\tauthority = path.substring(2);\n\t\t\t\tpath = _slash;\n\t\t\t} else {\n\t\t\t\tauthority = path.substring(2, idx);\n\t\t\t\tpath = path.substring(idx) || _slash;\n\t\t\t}\n\t\t}\n\n\t\treturn new Uri('file', authority, path, _empty, _empty);\n\t}\n\n\tstatic from(components: { scheme: string; authority?: string; path?: string; query?: string; fragment?: string }): URI {\n\t\tconst result = new Uri(\n\t\t\tcomponents.scheme,\n\t\t\tcomponents.authority,\n\t\t\tcomponents.path,\n\t\t\tcomponents.query,\n\t\t\tcomponents.fragment,\n\t\t);\n\t\t_validateUri(result, true);\n\t\treturn result;\n\t}\n\n\t// ---- printing/externalize ---------------------------\n\n\t/**\n\t * Creates a string representation for this URI. It's guaranteed that calling\n\t * `URI.parse` with the result of this function creates an URI which is equal\n\t * to this URI.\n\t *\n\t * * The result shall *not* be used for display purposes but for externalization or transport.\n\t * * The result will be encoded using the percentage encoding and encoding happens mostly\n\t * ignore the scheme-specific encoding rules.\n\t *\n\t * @param skipEncoding Do not encode the result, default is `false`\n\t */\n\ttoString(skipEncoding: boolean = false): string {\n\t\treturn _asFormatted(this, skipEncoding);\n\t}\n\n\ttoJSON(): UriComponents {\n\t\treturn this;\n\t}\n\n\tstatic revive(data: UriComponents | URI): URI;\n\tstatic revive(data: UriComponents | URI | undefined): URI | undefined;\n\tstatic revive(data: UriComponents | URI | null): URI | null;\n\tstatic revive(data: UriComponents | URI | undefined | null): URI | undefined | null;\n\tstatic revive(data: UriComponents | URI | undefined | null): URI | undefined | null {\n\t\tif (!data) {\n\t\t\treturn <any>data;\n\t\t} else if (data instanceof URI) {\n\t\t\treturn data;\n\t\t} else {\n\t\t\tconst result = new Uri(data);\n\t\t\tresult._formatted = (<UriState>data).external;\n\t\t\tresult._fsPath = (<UriState>data)._sep === _pathSepMarker ? (<UriState>data).fsPath : null;\n\t\t\treturn result;\n\t\t}\n\t}\n}\n\nexport interface UriComponents {\n\tscheme: string;\n\tauthority: string;\n\tpath: string;\n\tquery: string;\n\tfragment: string;\n}\n\ninterface UriState extends UriComponents {\n\t$mid: number;\n\texternal: string;\n\tfsPath: string;\n\t_sep: 1 | undefined;\n}\n\nconst _pathSepMarker = isWindows ? 1 : undefined;\n\n// This class exists so that URI is compatible with vscode.Uri (API).\nclass Uri extends URI {\n\n\t_formatted: string | null = null;\n\t_fsPath: string | null = null;\n\n\toverride get fsPath(): string {\n\t\tif (!this._fsPath) {\n\t\t\tthis._fsPath = uriToFsPath(this, false);\n\t\t}\n\t\treturn this._fsPath;\n\t}\n\n\toverride toString(skipEncoding: boolean = false): string {\n\t\tif (!skipEncoding) {\n\t\t\tif (!this._formatted) {\n\t\t\t\tthis._formatted = _asFormatted(this, false);\n\t\t\t}\n\t\t\treturn this._formatted;\n\t\t} else {\n\t\t\t// we don't cache that\n\t\t\treturn _asFormatted(this, true);\n\t\t}\n\t}\n\n\toverride toJSON(): UriComponents {\n\t\tconst res = <UriState>{\n\t\t\t$mid: 1\n\t\t};\n\t\t// cached state\n\t\tif (this._fsPath) {\n\t\t\tres.fsPath = this._fsPath;\n\t\t\tres._sep = _pathSepMarker;\n\t\t}\n\t\tif (this._formatted) {\n\t\t\tres.external = this._formatted;\n\t\t}\n\t\t// uri components\n\t\tif (this.path) {\n\t\t\tres.path = this.path;\n\t\t}\n\t\tif (this.scheme) {\n\t\t\tres.scheme = this.scheme;\n\t\t}\n\t\tif (this.authority) {\n\t\t\tres.authority = this.authority;\n\t\t}\n\t\tif (this.query) {\n\t\t\tres.query = this.query;\n\t\t}\n\t\tif (this.fragment) {\n\t\t\tres.fragment = this.fragment;\n\t\t}\n\t\treturn res;\n\t}\n}\n\n// reserved characters: https://tools.ietf.org/html/rfc3986#section-2.2\nconst encodeTable: { [ch: number]: string } = {\n\t[CharCode.Colon]: '%3A', // gen-delims\n\t[CharCode.Slash]: '%2F',\n\t[CharCode.QuestionMark]: '%3F',\n\t[CharCode.Hash]: '%23',\n\t[CharCode.OpenSquareBracket]: '%5B',\n\t[CharCode.CloseSquareBracket]: '%5D',\n\t[CharCode.AtSign]: '%40',\n\n\t[CharCode.ExclamationMark]: '%21', // sub-delims\n\t[CharCode.DollarSign]: '%24',\n\t[CharCode.Ampersand]: '%26',\n\t[CharCode.SingleQuote]: '%27',\n\t[CharCode.OpenParen]: '%28',\n\t[CharCode.CloseParen]: '%29',\n\t[CharCode.Asterisk]: '%2A',\n\t[CharCode.Plus]: '%2B',\n\t[CharCode.Comma]: '%2C',\n\t[CharCode.Semicolon]: '%3B',\n\t[CharCode.Equals]: '%3D',\n\n\t[CharCode.Space]: '%20',\n};\n\nfunction encodeURIComponentFast(uriComponent: string, isPath: boolean, isAuthority: boolean): string {\n\tlet res: string | undefined = undefined;\n\tlet nativeEncodePos = -1;\n\n\tfor (let pos = 0; pos < uriComponent.length; pos++) {\n\t\tconst code = uriComponent.charCodeAt(pos);\n\n\t\t// unreserved characters: https://tools.ietf.org/html/rfc3986#section-2.3\n\t\tif (\n\t\t\t(code >= CharCode.a && code <= CharCode.z)\n\t\t\t|| (code >= CharCode.A && code <= CharCode.Z)\n\t\t\t|| (code >= CharCode.Digit0 && code <= CharCode.Digit9)\n\t\t\t|| code === CharCode.Dash\n\t\t\t|| code === CharCode.Period\n\t\t\t|| code === CharCode.Underline\n\t\t\t|| code === CharCode.Tilde\n\t\t\t|| (isPath && code === CharCode.Slash)\n\t\t\t|| (isAuthority && code === CharCode.OpenSquareBracket)\n\t\t\t|| (isAuthority && code === CharCode.CloseSquareBracket)\n\t\t\t|| (isAuthority && code === CharCode.Colon)\n\t\t) {\n\t\t\t// check if we are delaying native encode\n\t\t\tif (nativeEncodePos !== -1) {\n\t\t\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\n\t\t\t\tnativeEncodePos = -1;\n\t\t\t}\n\t\t\t// check if we write into a new string (by default we try to return the param)\n\t\t\tif (res !== undefined) {\n\t\t\t\tres += uriComponent.charAt(pos);\n\t\t\t}\n\n\t\t} else {\n\t\t\t// encoding needed, we need to allocate a new string\n\t\t\tif (res === undefined) {\n\t\t\t\tres = uriComponent.substr(0, pos);\n\t\t\t}\n\n\t\t\t// check with default table first\n\t\t\tconst escaped = encodeTable[code];\n\t\t\tif (escaped !== undefined) {\n\n\t\t\t\t// check if we are delaying native encode\n\t\t\t\tif (nativeEncodePos !== -1) {\n\t\t\t\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\n\t\t\t\t\tnativeEncodePos = -1;\n\t\t\t\t}\n\n\t\t\t\t// append escaped variant to result\n\t\t\t\tres += escaped;\n\n\t\t\t} else if (nativeEncodePos === -1) {\n\t\t\t\t// use native encode only when needed\n\t\t\t\tnativeEncodePos = pos;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (nativeEncodePos !== -1) {\n\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos));\n\t}\n\n\treturn res !== undefined ? res : uriComponent;\n}\n\nfunction encodeURIComponentMinimal(path: string): string {\n\tlet res: string | undefined = undefined;\n\tfor (let pos = 0; pos < path.length; pos++) {\n\t\tconst code = path.charCodeAt(pos);\n\t\tif (code === CharCode.Hash || code === CharCode.QuestionMark) {\n\t\t\tif (res === undefined) {\n\t\t\t\tres = path.substr(0, pos);\n\t\t\t}\n\t\t\tres += encodeTable[code];\n\t\t} else {\n\t\t\tif (res !== undefined) {\n\t\t\t\tres += path[pos];\n\t\t\t}\n\t\t}\n\t}\n\treturn res !== undefined ? res : path;\n}\n\n/**\n * Compute `fsPath` for the given uri\n */\nexport function uriToFsPath(uri: URI, keepDriveLetterCasing: boolean): string {\n\n\tlet value: string;\n\tif (uri.authority && uri.path.length > 1 && uri.scheme === 'file') {\n\t\t// unc path: file://shares/c$/far/boo\n\t\tvalue = `//${uri.authority}${uri.path}`;\n\t} else if (\n\t\turi.path.charCodeAt(0) === CharCode.Slash\n\t\t&& (uri.path.charCodeAt(1) >= CharCode.A && uri.path.charCodeAt(1) <= CharCode.Z || uri.path.charCodeAt(1) >= CharCode.a && uri.path.charCodeAt(1) <= CharCode.z)\n\t\t&& uri.path.charCodeAt(2) === CharCode.Colon\n\t) {\n\t\tif (!keepDriveLetterCasing) {\n\t\t\t// windows drive letter: file:///c:/far/boo\n\t\t\tvalue = uri.path[1].toLowerCase() + uri.path.substr(2);\n\t\t} else {\n\t\t\tvalue = uri.path.substr(1);\n\t\t}\n\t} else {\n\t\t// other path\n\t\tvalue = uri.path;\n\t}\n\tif (isWindows) {\n\t\tvalue = value.replace(/\\//g, '\\\\');\n\t}\n\treturn value;\n}\n\n/**\n * Create the external version of a uri\n */\nfunction _asFormatted(uri: URI, skipEncoding: boolean): string {\n\n\tconst encoder = !skipEncoding\n\t\t? encodeURIComponentFast\n\t\t: encodeURIComponentMinimal;\n\n\tlet res = '';\n\tlet { scheme, authority, path, query, fragment } = uri;\n\tif (scheme) {\n\t\tres += scheme;\n\t\tres += ':';\n\t}\n\tif (authority || scheme === 'file') {\n\t\tres += _slash;\n\t\tres += _slash;\n\t}\n\tif (authority) {\n\t\tlet idx = authority.indexOf('@');\n\t\tif (idx !== -1) {\n\t\t\t// <user>@<auth>\n\t\t\tconst userinfo = authority.substr(0, idx);\n\t\t\tauthority = authority.substr(idx + 1);\n\t\t\tidx = userinfo.lastIndexOf(':');\n\t\t\tif (idx === -1) {\n\t\t\t\tres += encoder(userinfo, false, false);\n\t\t\t} else {\n\t\t\t\t// <user>:<pass>@<auth>\n\t\t\t\tres += encoder(userinfo.substr(0, idx), false, false);\n\t\t\t\tres += ':';\n\t\t\t\tres += encoder(userinfo.substr(idx + 1), false, true);\n\t\t\t}\n\t\t\tres += '@';\n\t\t}\n\t\tauthority = authority.toLowerCase();\n\t\tidx = authority.lastIndexOf(':');\n\t\tif (idx === -1) {\n\t\t\tres += encoder(authority, false, true);\n\t\t} else {\n\t\t\t// <auth>:<port>\n\t\t\tres += encoder(authority.substr(0, idx), false, true);\n\t\t\tres += authority.substr(idx);\n\t\t}\n\t}\n\tif (path) {\n\t\t// lower-case windows drive letters in /C:/fff or C:/fff\n\t\tif (path.length >= 3 && path.charCodeAt(0) === CharCode.Slash && path.charCodeAt(2) === CharCode.Colon) {\n\t\t\tconst code = path.charCodeAt(1);\n\t\t\tif (code >= CharCode.A && code <= CharCode.Z) {\n\t\t\t\tpath = `/${String.fromCharCode(code + 32)}:${path.substr(3)}`; // \"/c:\".length === 3\n\t\t\t}\n\t\t} else if (path.length >= 2 && path.charCodeAt(1) === CharCode.Colon) {\n\t\t\tconst code = path.charCodeAt(0);\n\t\t\tif (code >= CharCode.A && code <= CharCode.Z) {\n\t\t\t\tpath = `${String.fromCharCode(code + 32)}:${path.substr(2)}`; // \"/c:\".length === 3\n\t\t\t}\n\t\t}\n\t\t// encode the rest of the path\n\t\tres += encoder(path, true, false);\n\t}\n\tif (query) {\n\t\tres += '?';\n\t\tres += encoder(query, false, false);\n\t}\n\tif (fragment) {\n\t\tres += '#';\n\t\tres += !skipEncoding ? encodeURIComponentFast(fragment, false, false) : fragment;\n\t}\n\treturn res;\n}\n\n// --- decode\n\nfunction decodeURIComponentGraceful(str: string): string {\n\ttry {\n\t\treturn decodeURIComponent(str);\n\t} catch {\n\t\tif (str.length > 3) {\n\t\t\treturn str.substr(0, 3) + decodeURIComponentGraceful(str.substr(3));\n\t\t} else {\n\t\t\treturn str;\n\t\t}\n\t}\n}\n\nconst _rEncodedAsHex = /(%[0-9A-Za-z][0-9A-Za-z])+/g;\n\nfunction percentDecode(str: string): string {\n\tif (!str.match(_rEncodedAsHex)) {\n\t\treturn str;\n\t}\n\treturn str.replace(_rEncodedAsHex, (match) => decodeURIComponentGraceful(match));\n}\n\n/**\n * Mapped-type that replaces all occurrences of URI with UriComponents\n */\nexport type UriDto<T> = { [K in keyof T]: T[K] extends URI\n\t? UriComponents\n\t: UriDto<T[K]> };\n", "/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n\n'use strict';\n\nimport { CharCode } from './charCode';\nimport { URI } from './uri';\nimport * as nodePath from 'path';\n\nconst posixPath = nodePath.posix || nodePath;\nconst slash = '/';\n\nexport namespace Utils {\n\n    /**\n     * Joins one or more input paths to the path of URI. \n     * '/' is used as the directory separation character. \n     * \n     * The resolved path will be normalized. That means:\n     *  - all '..' and '.' segments are resolved.\n     *  - multiple, sequential occurences of '/' are replaced by a single instance of '/'.\n     *  - trailing separators are preserved.\n     * \n     * @param uri The input URI.\n     * @param paths The paths to be joined with the path of URI.\n     * @returns A URI with the joined path. All other properties of the URI (scheme, authority, query, fragments, ...) will be taken from the input URI.\n     */\n    export function joinPath(uri: URI, ...paths: string[]): URI {\n        return uri.with({ path: posixPath.join(uri.path, ...paths) });\n    }\n\n\n    /**\n     * Resolves one or more paths against the path of a URI. \n     * '/' is used as the directory separation character. \n     * \n     * The resolved path will be normalized. That means:\n     *  - all '..' and '.' segments are resolved. \n     *  - multiple, sequential occurences of '/' are replaced by a single instance of '/'.\n     *  - trailing separators are removed.\n     * \n     * @param uri The input URI.\n     * @param paths The paths to resolve against the path of URI.\n     * @returns A URI with the resolved path. All other properties of the URI (scheme, authority, query, fragments, ...) will be taken from the input URI.\n     */\n    export function resolvePath(uri: URI, ...paths: string[]): URI {\n        let path = uri.path; \n        let slashAdded = false;\n        if (path[0] !== slash) {\n            path = slash + path; // make the path abstract: for posixPath.resolve the first segments has to be absolute or cwd is used.\n            slashAdded = true;\n        }\n        let resolvedPath = posixPath.resolve(path, ...paths);\n        if (slashAdded && resolvedPath[0] === slash && !uri.authority) {\n            resolvedPath = resolvedPath.substring(1);\n        }\n        return uri.with({ path: resolvedPath });\n    }\n\n    /**\n     * Returns a URI where the path is the directory name of the input uri, similar to the Unix dirname command. \n     * In the path, '/' is recognized as the directory separation character. Trailing directory separators are ignored.\n     * The orignal URI is returned if the URIs path is empty or does not contain any path segments.\n     * \n     * @param uri The input URI.\n     * @return The last segment of the URIs path.\n     */\n    export function dirname(uri: URI): URI {\n        if (uri.path.length === 0 || uri.path === slash) {\n            return uri;\n        }\n        let path = posixPath.dirname(uri.path);\n        if (path.length === 1 && path.charCodeAt(0) === CharCode.Period) {\n            path = '';\n        }\n        return uri.with({ path });\n    }\n\n    /**\n     * Returns the last segment of the path of a URI, similar to the Unix basename command. \n     * In the path, '/' is recognized as the directory separation character. Trailing directory separators are ignored.\n     * The empty string is returned if the URIs path is empty or does not contain any path segments.\n     * \n     * @param uri The input URI.\n     * @return The base name of the URIs path.\n     */\n    export function basename(uri: URI): string {\n        return posixPath.basename(uri.path);\n    }\n\n    /**\n     * Returns the extension name of the path of a URI, similar to the Unix extname command. \n     * In the path, '/' is recognized as the directory separation character. Trailing directory separators are ignored.\n     * The empty string is returned if the URIs path is empty or does not contain any path segments.\n     * \n     * @param uri The input URI.\n     * @return The extension name of the URIs path.\n     */\n    export function extname(uri: URI): string {\n        return posixPath.extname(uri.path);\n    }\n}", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { URI, Utils } from 'vscode-uri';\n\nexport { URI };\n\nexport namespace UriUtils {\n\n    export const basename = Utils.basename;\n    export const dirname = Utils.dirname;\n    export const extname = Utils.extname;\n    export const joinPath = Utils.joinPath;\n    export const resolvePath = Utils.resolvePath;\n\n    const isWindows = typeof process === 'object' && process?.platform === 'win32';\n\n    export function equals(a?: URI | string, b?: URI | string): boolean {\n        return a?.toString() === b?.toString();\n    }\n\n    export function relative(from: URI | string, to: URI | string): string {\n        const fromPath = typeof from === 'string' ? URI.parse(from).path : from.path;\n        const toPath   = typeof   to === 'string' ? URI.parse(to).path   : to.path;\n        const fromParts = fromPath.split('/').filter(e => e.length > 0);\n        const toParts   =   toPath.split('/').filter(e => e.length > 0);\n\n        if (isWindows) {\n            const upperCaseDriveLetter = /^[A-Z]:$/;\n            if (fromParts[0] && upperCaseDriveLetter.test(fromParts[0])) {\n                fromParts[0] = fromParts[0].toLowerCase();\n            }\n            if (toParts[0] && upperCaseDriveLetter.test(toParts[0])) {\n                toParts[0] = toParts[0].toLowerCase();\n            }\n            if (fromParts[0] !== toParts[0]) {\n                // in case of different drive letters, we cannot compute a relative path, so...\n                return toPath.substring(1); // fall back to full 'to' path, drop the leading '/', keep everything else as is for good comparability\n            }\n        }\n\n        let i = 0;\n        for (; i < fromParts.length; i++) {\n            if (fromParts[i] !== toParts[i]) {\n                break;\n            }\n        }\n        const backPart = '../'.repeat(fromParts.length - i);\n        const toPart = toParts.slice(i).join('/');\n        return backPart + toPart;\n    }\n\n    export function normalize(uri: URI | string): string {\n        return URI.parse(uri.toString()).toString();\n    }\n\n    export function contains(parent: URI | string, child: URI | string): boolean {\n        let parentPath = typeof parent === 'string' ? parent : parent.path;\n        let childPath = typeof child === 'string' ? child : child.path;\n        // Trim trailing slashes\n        if (childPath.charAt(childPath.length - 1) === '/') {\n            childPath = childPath.slice(0, -1);\n        }\n        if (parentPath.charAt(parentPath.length - 1) === '/') {\n            parentPath = parentPath.slice(0, -1);\n        }\n        // If the paths are equal, simply return true\n        if (childPath === parentPath) {\n            return true;\n        }\n        // If the child path is shorter than the parent path, it can't be a child\n        if (childPath.length < parentPath.length) {\n            return false;\n        }\n        // If the path does not feature a slash after the parent path, it can't be a child\n        if (childPath.charAt(parentPath.length) !== '/') {\n            return false;\n        }\n        // Check if the child path starts with the parent path\n        return childPath.startsWith(parentPath);\n    }\n\n}\n\ninterface InternalUriTrieNode<T> {\n    name: string,\n    children: Map<string, InternalUriTrieNode<T>>;\n    parent?: InternalUriTrieNode<T>;\n    // If this element is set, the node represents a leaf in the trie\n    element?: T;\n}\n\nexport interface UriTrieNode<T> {\n    name: string;\n    uri: string;\n    element?: T;\n}\n\n/**\n * A trie structure for URIs. It allows to insert, delete and find elements by their URI.\n * More specifically, it allows to efficiently find all elements that are children of a given URI.\n *\n * Unlike a regular trie, this implementation uses the name of the URI segments as keys.\n *\n * @see {@link https://en.wikipedia.org/wiki/Trie}\n */\nexport class UriTrie<T> {\n\n    protected readonly root: InternalUriTrieNode<T> = { name: '', children: new Map() };\n\n    protected normalizeUri(uri: URI | string): string {\n        return UriUtils.normalize(uri);\n    }\n\n    clear(): void {\n        this.root.children.clear();\n    }\n\n    insert(uri: URI | string, element: T): void {\n        const node = this.getNode(this.normalizeUri(uri), true);\n        node.element = element;\n    }\n\n    delete(uri: URI | string): void {\n        const nodeToDelete = this.getNode(this.normalizeUri(uri), false);\n        if (nodeToDelete?.parent) {\n            nodeToDelete.parent.children.delete(nodeToDelete.name);\n        }\n    }\n\n    has(uri: URI | string): boolean {\n        return this.getNode(this.normalizeUri(uri), false)?.element !== undefined;\n    }\n\n    hasNode(uri: URI | string): boolean {\n        return this.getNode(this.normalizeUri(uri), false) !== undefined;\n    }\n\n    find(uri: URI | string): T | undefined {\n        return this.getNode(this.normalizeUri(uri), false)?.element;\n    }\n\n    findNode(uri: URI | string): UriTrieNode<T> | undefined {\n        const uriString = this.normalizeUri(uri);\n        const node = this.getNode(uriString, false);\n        if (!node) {\n            return undefined;\n        }\n        return {\n            name: node.name,\n            uri: UriUtils.joinPath(URI.parse(uriString), node.name).toString(),\n            element: node.element\n        };\n    }\n\n    findChildren(uri: URI | string): Array<UriTrieNode<T>> {\n        const uriString = this.normalizeUri(uri);\n        const node = this.getNode(uriString, false);\n        if (!node) {\n            return [];\n        }\n        return Array.from(node.children.values()).map(child => ({\n            name: child.name,\n            uri: UriUtils.joinPath(URI.parse(uriString), child.name).toString(),\n            element: child.element\n        }));\n    }\n\n    all(): T[] {\n        return this.collectValues(this.root);\n    }\n\n    findAll(prefix: URI | string): T[] {\n        const node = this.getNode(UriUtils.normalize(prefix), false);\n        if (!node) {\n            return [];\n        }\n        return this.collectValues(node);\n    }\n\n    protected getNode(uri: string, create: true): InternalUriTrieNode<T>;\n    protected getNode(uri: string, create: false): InternalUriTrieNode<T> | undefined;\n    protected getNode(uri: string, create: boolean): InternalUriTrieNode<T> | undefined {\n        const parts = uri.split('/');\n        if (uri.charAt(uri.length - 1) === '/') {\n            // Remove the last part if the URI ends with a slash\n            parts.pop();\n        }\n        let current = this.root;\n        for (const part of parts) {\n            let child = current.children.get(part);\n            if (!child) {\n                if (create) {\n                    child = {\n                        name: part,\n                        children: new Map(),\n                        parent: current\n                    };\n                    current.children.set(part, child);\n                } else {\n                    return undefined;\n                }\n            }\n            current = child;\n        }\n        return current;\n    }\n\n    protected collectValues(node: InternalUriTrieNode<T>): T[] {\n        const result: T[] = [];\n        if (node.element) {\n            result.push(node.element);\n        }\n        for (const child of node.children.values()) {\n            result.push(...this.collectValues(child));\n        }\n        return result;\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { DefinitionParams } from 'vscode-languageserver';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { GrammarConfig } from '../languages/grammar-config.js';\nimport type { NameProvider } from '../references/name-provider.js';\nimport type { References } from '../references/references.js';\nimport type { LangiumServices } from './lsp-services.js';\nimport type { CstNode } from '../syntax-tree.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport { LocationLink } from 'vscode-languageserver';\nimport { getDocument } from '../utils/ast-utils.js';\nimport { findDeclarationNodeAtOffset, getDatatypeNode } from '../utils/cst-utils.js';\n\n/**\n * Language-specific service for handling go to definition requests.\n */\nexport interface DefinitionProvider {\n    /**\n     * Handle a go to definition request.\n     *\n     * @param document The document in which the request was triggered.\n     * @param params The parameters of the request.\n     * @param cancelToken A cancellation token that can be used to cancel the request.\n     * @returns A list of location links to the definition(s) of the symbol at the given position.\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    getDefinition(document: LangiumDocument, params: DefinitionParams, cancelToken?: CancellationToken): MaybePromise<LocationLink[] | undefined>;\n}\n\nexport interface GoToLink {\n    source: CstNode\n    target: CstNode\n    targetDocument: LangiumDocument\n}\n\nexport class DefaultDefinitionProvider implements DefinitionProvider {\n\n    protected readonly nameProvider: NameProvider;\n    protected readonly references: References;\n    protected readonly grammarConfig: GrammarConfig;\n\n    constructor(services: LangiumServices) {\n        this.nameProvider = services.references.NameProvider;\n        this.references = services.references.References;\n        this.grammarConfig = services.parser.GrammarConfig;\n    }\n\n    getDefinition(document: LangiumDocument, params: DefinitionParams, _cancelToken?: CancellationToken): MaybePromise<LocationLink[] | undefined> {\n        const rootNode = document.parseResult.value;\n        if (rootNode.$cstNode) {\n            const cst = rootNode.$cstNode;\n            const sourceCstNode = findDeclarationNodeAtOffset(cst, document.textDocument.offsetAt(params.position), this.grammarConfig.nameRegexp);\n            if (sourceCstNode) {\n                return this.collectLocationLinks(sourceCstNode, params);\n            }\n        }\n        return undefined;\n    }\n\n    protected collectLocationLinks(sourceCstNode: CstNode, _params: DefinitionParams): MaybePromise<LocationLink[] | undefined> {\n        const goToLinks = this.findLinks(sourceCstNode);\n        if (goToLinks.length > 0) {\n            return goToLinks.map(link => LocationLink.create(\n                link.targetDocument.textDocument.uri,\n                (link.target.astNode.$cstNode ?? link.target).range,\n                link.target.range,\n                link.source.range\n            ));\n        }\n        return undefined;\n    }\n\n    protected findLinks(source: CstNode): GoToLink[] {\n        const datatypeSourceNode = getDatatypeNode(source) ?? source;\n        const targets = this.references.findDeclarationNodes(source);\n        const links: GoToLink[] = [];\n        for (const target of targets) {\n            const targetDocument = getDocument(target.astNode);\n            if (targets && targetDocument) {\n                links.push({\n                    source: datatypeSourceNode,\n                    target,\n                    targetDocument\n                });\n            }\n        }\n        return links;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices } from '../services.js';\nimport { DefaultNameRegexp } from '../utils/cst-utils.js';\nimport { isCommentTerminal, terminalRegex } from '../utils/grammar-utils.js';\nimport { isMultilineComment } from '../utils/regexp-utils.js';\nimport { isTerminalRule } from './generated/ast.js';\n\nexport interface GrammarConfig {\n    /**\n     * Lists all rule names which are classified as multiline comment rules\n     */\n    multilineCommentRules: string[]\n    /**\n     * A regular expression which matches characters of names\n     */\n    nameRegexp: RegExp\n}\n\n/**\n * Create the default grammar configuration (used by `createDefaultModule`). This can be overridden in a\n * language-specific module.\n */\nexport function createGrammarConfig(services: LangiumCoreServices): GrammarConfig {\n    const rules: string[] = [];\n    const grammar = services.Grammar;\n    for (const rule of grammar.rules) {\n        if (isTerminalRule(rule) && isCommentTerminal(rule) && isMultilineComment(terminalRegex(rule))) {\n            rules.push(rule.name);\n        }\n    }\n    return {\n        multilineCommentRules: rules,\n        nameRegexp: DefaultNameRegexp\n    };\n}\n", "export function PRINT_ERROR(msg: string) {\n  /* istanbul ignore else - can't override global.console in node.js */\n  if (console && console.error) {\n    console.error(`Error: ${msg}`);\n  }\n}\n\nexport function PRINT_WARNING(msg: string) {\n  /* istanbul ignore else - can't override global.console in node.js*/\n  if (console && console.warn) {\n    // TODO: modify docs accordingly\n    console.warn(`Warning: ${msg}`);\n  }\n}\n", "export function timer<T>(func: () => T): { time: number; value: T } {\n  const start = new Date().getTime();\n  const val = func();\n  const end = new Date().getTime();\n  const total = end - start;\n  return { time: total, value: val };\n}\n", "// based on: https://github.com/petkaantonov/bluebird/blob/b97c0d2d487e8c5076e8bd897e0dcd4622d31846/src/util.js#L201-L216\nexport function toFastProperties(toBecomeFast: any) {\n  function FakeConstructor() {}\n\n  // If our object is used as a constructor, it would receive\n  FakeConstructor.prototype = toBecomeFast;\n  const fakeInstance = new (FakeConstructor as any)();\n\n  function fakeAccess() {\n    return typeof fakeInstance.bar;\n  }\n\n  // help V8 understand this is a \"real\" prototype by actually using\n  // the fake instance.\n  fakeAccess();\n  fakeAccess();\n\n  // Always true condition to suppress the Firefox warning of unreachable\n  // code after a return statement.\n  if (1) return toBecomeFast;\n\n  // Eval prevents optimization of this method (even though this is dead code)\n  // - https://esbuild.github.io/content-types/#direct-eval\n  /* istanbul ignore next */\n  // tslint:disable-next-line\n  (0, eval)(toBecomeFast);\n}\n", "import type {\n  IGASTVisitor,\n  IProduction,\n  IProductionWithOccurrence,\n  ISerializedGast,\n  TokenType,\n} from \"@chevrotain/types\";\n\n// TODO: duplicated code to avoid extracting another sub-package -- how to avoid?\nfunction tokenLabel(tokType: TokenType): string {\n  if (hasTokenLabel(tokType)) {\n    return tokType.LABEL;\n  } else {\n    return tokType.name;\n  }\n}\n\n// TODO: duplicated code to avoid extracting another sub-package -- how to avoid?\nfunction hasTokenLabel(\n  obj: TokenType,\n): obj is TokenType & Pick<Required<TokenType>, \"LABEL\"> {\n  return typeof obj.LABEL === \"string\" && obj.LABEL !== \"\";\n}\n\nexport abstract class AbstractProduction<\n  T extends IProduction = IProduction,\n> implements IProduction {\n  public get definition(): T[] {\n    return this._definition;\n  }\n  public set definition(value: T[]) {\n    this._definition = value;\n  }\n\n  constructor(protected _definition: T[]) {}\n\n  accept(visitor: IGASTVisitor): void {\n    visitor.visit(this);\n    this.definition.forEach((prod) => {\n      prod.accept(visitor);\n    });\n  }\n}\n\nexport class NonTerminal\n  extends AbstractProduction\n  implements IProductionWithOccurrence\n{\n  public nonTerminalName!: string;\n  public label?: string;\n  public referencedRule!: Rule;\n  public idx: number = 1;\n\n  constructor(options: {\n    nonTerminalName: string;\n    label?: string;\n    referencedRule?: Rule;\n    idx?: number;\n  }) {\n    super([]);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n\n  set definition(definition: IProduction[]) {\n    // immutable\n  }\n\n  get definition(): IProduction[] {\n    if (this.referencedRule !== undefined) {\n      return this.referencedRule.definition;\n    }\n    return [];\n  }\n\n  accept(visitor: IGASTVisitor): void {\n    visitor.visit(this);\n    // don't visit children of a reference, we will get cyclic infinite loops if we do so\n  }\n}\n\nexport class Rule extends AbstractProduction {\n  public name!: string;\n  public orgText: string = \"\";\n\n  constructor(options: {\n    name: string;\n    definition: IProduction[];\n    orgText?: string;\n  }) {\n    super(options.definition);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n}\n\nexport class Alternative extends AbstractProduction {\n  public ignoreAmbiguities: boolean = false;\n\n  constructor(options: {\n    definition: IProduction[];\n    ignoreAmbiguities?: boolean;\n  }) {\n    super(options.definition);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n}\n\nexport class Option\n  extends AbstractProduction\n  implements IProductionWithOccurrence\n{\n  public idx: number = 1;\n  public maxLookahead?: number;\n\n  constructor(options: {\n    definition: IProduction[];\n    idx?: number;\n    maxLookahead?: number;\n  }) {\n    super(options.definition);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n}\n\nexport class RepetitionMandatory\n  extends AbstractProduction\n  implements IProductionWithOccurrence\n{\n  public idx: number = 1;\n  public maxLookahead?: number;\n\n  constructor(options: {\n    definition: IProduction[];\n    idx?: number;\n    maxLookahead?: number;\n  }) {\n    super(options.definition);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n}\n\nexport class RepetitionMandatoryWithSeparator\n  extends AbstractProduction\n  implements IProductionWithOccurrence\n{\n  public separator!: TokenType;\n  public idx: number = 1;\n  public maxLookahead?: number;\n\n  constructor(options: {\n    definition: IProduction[];\n    separator: TokenType;\n    idx?: number;\n  }) {\n    super(options.definition);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n}\n\nexport class Repetition\n  extends AbstractProduction\n  implements IProductionWithOccurrence\n{\n  public separator!: TokenType;\n  public idx: number = 1;\n  public maxLookahead?: number;\n\n  constructor(options: {\n    definition: IProduction[];\n    idx?: number;\n    maxLookahead?: number;\n  }) {\n    super(options.definition);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n}\n\nexport class RepetitionWithSeparator\n  extends AbstractProduction\n  implements IProductionWithOccurrence\n{\n  public separator!: TokenType;\n  public idx: number = 1;\n  public maxLookahead?: number;\n\n  constructor(options: {\n    definition: IProduction[];\n    separator: TokenType;\n    idx?: number;\n  }) {\n    super(options.definition);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n}\n\nexport class Alternation\n  extends AbstractProduction<Alternative>\n  implements IProductionWithOccurrence\n{\n  public idx: number = 1;\n  public ignoreAmbiguities: boolean = false;\n  public hasPredicates: boolean = false;\n  public maxLookahead?: number;\n\n  public get definition(): Alternative[] {\n    return this._definition;\n  }\n  public set definition(value: Alternative[]) {\n    this._definition = value;\n  }\n\n  constructor(options: {\n    definition: Alternative[];\n    idx?: number;\n    ignoreAmbiguities?: boolean;\n    hasPredicates?: boolean;\n    maxLookahead?: number;\n  }) {\n    super(options.definition);\n    Object.assign(this, pickOnlyDefined(options));\n  }\n}\n\nexport class Terminal implements IProductionWithOccurrence {\n  public terminalType!: TokenType;\n  public label?: string;\n  public idx: number = 1;\n\n  constructor(options: {\n    terminalType: TokenType;\n    label?: string;\n    idx?: number;\n  }) {\n    Object.assign(this, pickOnlyDefined(options));\n  }\n\n  accept(visitor: IGASTVisitor): void {\n    visitor.visit(this);\n  }\n}\n\nexport interface ISerializedBasic extends ISerializedGast {\n  type:\n    | \"Alternative\"\n    | \"Option\"\n    | \"RepetitionMandatory\"\n    | \"Repetition\"\n    | \"Alternation\";\n  idx?: number;\n}\n\nexport interface ISerializedGastRule extends ISerializedGast {\n  type: \"Rule\";\n  name: string;\n  orgText: string;\n}\n\nexport interface ISerializedNonTerminal extends ISerializedGast {\n  type: \"NonTerminal\";\n  name: string;\n  label?: string;\n  idx: number;\n}\n\nexport interface ISerializedTerminal extends ISerializedGast {\n  type: \"Terminal\";\n  name: string;\n  terminalLabel?: string;\n  label?: string;\n  pattern?: string;\n  idx: number;\n}\n\nexport interface ISerializedTerminalWithSeparator extends ISerializedGast {\n  type: \"RepetitionMandatoryWithSeparator\" | \"RepetitionWithSeparator\";\n  idx: number;\n  separator: ISerializedTerminal;\n}\n\nexport type ISerializedGastAny =\n  | ISerializedBasic\n  | ISerializedGastRule\n  | ISerializedNonTerminal\n  | ISerializedTerminal\n  | ISerializedTerminalWithSeparator;\n\nexport function serializeGrammar(topRules: Rule[]): ISerializedGast[] {\n  return topRules.map(serializeProduction);\n}\n\nexport function serializeProduction(node: IProduction): ISerializedGast {\n  function convertDefinition(definition: IProduction[]): ISerializedGast[] {\n    return definition.map(serializeProduction);\n  }\n  /* istanbul ignore else */\n  if (node instanceof NonTerminal) {\n    const serializedNonTerminal: ISerializedNonTerminal = {\n      type: \"NonTerminal\",\n      name: node.nonTerminalName,\n      idx: node.idx,\n    };\n\n    if (typeof node.label === \"string\") {\n      serializedNonTerminal.label = node.label;\n    }\n\n    return serializedNonTerminal;\n  } else if (node instanceof Alternative) {\n    return <ISerializedBasic>{\n      type: \"Alternative\",\n      definition: convertDefinition(node.definition),\n    };\n  } else if (node instanceof Option) {\n    return <ISerializedBasic>{\n      type: \"Option\",\n      idx: node.idx,\n      definition: convertDefinition(node.definition),\n    };\n  } else if (node instanceof RepetitionMandatory) {\n    return <ISerializedBasic>{\n      type: \"RepetitionMandatory\",\n      idx: node.idx,\n      definition: convertDefinition(node.definition),\n    };\n  } else if (node instanceof RepetitionMandatoryWithSeparator) {\n    return <ISerializedTerminalWithSeparator>{\n      type: \"RepetitionMandatoryWithSeparator\",\n      idx: node.idx,\n      separator: <ISerializedTerminal>(\n        serializeProduction(new Terminal({ terminalType: node.separator }))\n      ),\n      definition: convertDefinition(node.definition),\n    };\n  } else if (node instanceof RepetitionWithSeparator) {\n    return <ISerializedTerminalWithSeparator>{\n      type: \"RepetitionWithSeparator\",\n      idx: node.idx,\n      separator: <ISerializedTerminal>(\n        serializeProduction(new Terminal({ terminalType: node.separator }))\n      ),\n      definition: convertDefinition(node.definition),\n    };\n  } else if (node instanceof Repetition) {\n    return <ISerializedBasic>{\n      type: \"Repetition\",\n      idx: node.idx,\n      definition: convertDefinition(node.definition),\n    };\n  } else if (node instanceof Alternation) {\n    return <ISerializedBasic>{\n      type: \"Alternation\",\n      idx: node.idx,\n      definition: convertDefinition(node.definition),\n    };\n  } else if (node instanceof Terminal) {\n    const serializedTerminal = <ISerializedTerminal>{\n      type: \"Terminal\",\n      name: node.terminalType.name,\n      label: tokenLabel(node.terminalType),\n      idx: node.idx,\n    };\n\n    if (typeof node.label === \"string\") {\n      serializedTerminal.terminalLabel = node.label;\n    }\n\n    const pattern = node.terminalType.PATTERN;\n    if (node.terminalType.PATTERN) {\n      serializedTerminal.pattern =\n        pattern instanceof RegExp ? (<any>pattern).source : pattern;\n    }\n\n    return serializedTerminal;\n  } else if (node instanceof Rule) {\n    return <ISerializedGastRule>{\n      type: \"Rule\",\n      name: node.name,\n      orgText: node.orgText,\n      definition: convertDefinition(node.definition),\n    };\n    /* c8 ignore next 3 */\n  } else {\n    throw Error(\"non exhaustive match\");\n  }\n}\n\nfunction pickOnlyDefined(obj: Object): any {\n  return Object.fromEntries(\n    Object.entries(obj).filter(([, v]) => v !== undefined),\n  );\n}\n", "import {\n  Alternation,\n  Alternative,\n  NonTerminal,\n  Option,\n  Repetition,\n  RepetitionMandatory,\n  RepetitionMandatoryWithSeparator,\n  RepetitionWithSeparator,\n  Rule,\n  Terminal,\n} from \"./model.js\";\nimport type { IProduction } from \"@chevrotain/types\";\n\nexport abstract class GAstVisitor {\n  public visit(node: IProduction): any {\n    const nodeAny: any = node;\n    switch (nodeAny.constructor) {\n      case NonTerminal:\n        return this.visitNonTerminal(nodeAny);\n      case Alternative:\n        return this.visitAlternative(nodeAny);\n      case Option:\n        return this.visitOption(nodeAny);\n      case RepetitionMandatory:\n        return this.visitRepetitionMandatory(nodeAny);\n      case RepetitionMandatoryWithSeparator:\n        return this.visitRepetitionMandatoryWithSeparator(nodeAny);\n      case RepetitionWithSeparator:\n        return this.visitRepetitionWithSeparator(nodeAny);\n      case Repetition:\n        return this.visitRepetition(nodeAny);\n      case Alternation:\n        return this.visitAlternation(nodeAny);\n      case Terminal:\n        return this.visitTerminal(nodeAny);\n      case Rule:\n        return this.visitRule(nodeAny);\n      /* c8 ignore next 2 */\n      default:\n        throw Error(\"non exhaustive match\");\n    }\n  }\n\n  /* c8 ignore next */\n  public visitNonTerminal(node: NonTerminal): any {}\n\n  /* c8 ignore next */\n  public visitAlternative(node: Alternative): any {}\n\n  /* c8 ignore next */\n  public visitOption(node: Option): any {}\n\n  /* c8 ignore next */\n  public visitRepetition(node: Repetition): any {}\n\n  /* c8 ignore next */\n  public visitRepetitionMandatory(node: RepetitionMandatory): any {}\n\n  /* c8 ignore next 3 */\n  public visitRepetitionMandatoryWithSeparator(\n    node: RepetitionMandatoryWithSeparator,\n  ): any {}\n\n  /* c8 ignore next */\n  public visitRepetitionWithSeparator(node: RepetitionWithSeparator): any {}\n\n  /* c8 ignore next */\n  public visitAlternation(node: Alternation): any {}\n\n  /* c8 ignore next */\n  public visitTerminal(node: Terminal): any {}\n\n  /* c8 ignore next */\n  public visitRule(node: Rule): any {}\n}\n", "import {\n  AbstractProduction,\n  Alternation,\n  Alternative,\n  NonTerminal,\n  Option,\n  Repetition,\n  RepetitionMandatory,\n  RepetitionMandatoryWithSeparator,\n  RepetitionWithSeparator,\n  Rule,\n  Terminal,\n} from \"./model.js\";\nimport type { IProduction, IProductionWithOccurrence } from \"@chevrotain/types\";\n\nexport function isSequenceProd(\n  prod: IProduction,\n): prod is { definition: IProduction[] } & IProduction {\n  return (\n    prod instanceof Alternative ||\n    prod instanceof Option ||\n    prod instanceof Repetition ||\n    prod instanceof RepetitionMandatory ||\n    prod instanceof RepetitionMandatoryWithSeparator ||\n    prod instanceof RepetitionWithSeparator ||\n    prod instanceof Terminal ||\n    prod instanceof Rule\n  );\n}\n\nexport function isOptionalProd(\n  prod: IProduction,\n  alreadyVisited: NonTerminal[] = [],\n): boolean {\n  const isDirectlyOptional =\n    prod instanceof Option ||\n    prod instanceof Repetition ||\n    prod instanceof RepetitionWithSeparator;\n  if (isDirectlyOptional) {\n    return true;\n  }\n\n  // note that this can cause infinite loop if one optional empty TOP production has a cyclic dependency with another\n  // empty optional top rule\n  // may be indirectly optional ((A?B?C?) | (D?E?F?))\n  if (prod instanceof Alternation) {\n    // for OR its enough for just one of the alternatives to be optional\n    return (<Alternation>prod).definition.some((subProd: IProduction) => {\n      return isOptionalProd(subProd, alreadyVisited);\n    });\n  } else if (prod instanceof NonTerminal && alreadyVisited.includes(prod)) {\n    // avoiding stack overflow due to infinite recursion\n    return false;\n  } else if (prod instanceof AbstractProduction) {\n    if (prod instanceof NonTerminal) {\n      alreadyVisited.push(prod);\n    }\n    return (<AbstractProduction>prod).definition.every(\n      (subProd: IProduction) => {\n        return isOptionalProd(subProd, alreadyVisited);\n      },\n    );\n  } else {\n    return false;\n  }\n}\n\nexport function isBranchingProd(\n  prod: IProduction,\n): prod is { definition: IProduction[] } & IProduction {\n  return prod instanceof Alternation;\n}\n\nexport function getProductionDslName(prod: IProductionWithOccurrence): string {\n  /* istanbul ignore else */\n  if (prod instanceof NonTerminal) {\n    return \"SUBRULE\";\n  } else if (prod instanceof Option) {\n    return \"OPTION\";\n  } else if (prod instanceof Alternation) {\n    return \"OR\";\n  } else if (prod instanceof RepetitionMandatory) {\n    return \"AT_LEAST_ONE\";\n  } else if (prod instanceof RepetitionMandatoryWithSeparator) {\n    return \"AT_LEAST_ONE_SEP\";\n  } else if (prod instanceof RepetitionWithSeparator) {\n    return \"MANY_SEP\";\n  } else if (prod instanceof Repetition) {\n    return \"MANY\";\n  } else if (prod instanceof Terminal) {\n    return \"CONSUME\";\n    /* c8 ignore next 3 */\n  } else {\n    throw Error(\"non exhaustive match\");\n  }\n}\n", "import {\n  Alternation,\n  Alternative,\n  NonTerminal,\n  Option,\n  Repetition,\n  RepetitionMandatory,\n  RepetitionMandatoryWithSeparator,\n  RepetitionWithSeparator,\n  Terminal,\n} from \"@chevrotain/gast\";\nimport { IProduction } from \"@chevrotain/types\";\n\n/**\n *  A Grammar Walker that computes the \"remaining\" grammar \"after\" a productions in the grammar.\n */\nexport abstract class RestWalker {\n  walk(prod: { definition: IProduction[] }, prevRest: any[] = []): void {\n    prod.definition.forEach((subProd: IProduction, index) => {\n      const currRest = prod.definition.slice(index + 1);\n      /* istanbul ignore else */\n      if (subProd instanceof NonTerminal) {\n        this.walkProdRef(subProd, currRest, prevRest);\n      } else if (subProd instanceof Terminal) {\n        this.walkTerminal(subProd, currRest, prevRest);\n      } else if (subProd instanceof Alternative) {\n        this.walkFlat(subProd, currRest, prevRest);\n      } else if (subProd instanceof Option) {\n        this.walkOption(subProd, currRest, prevRest);\n      } else if (subProd instanceof RepetitionMandatory) {\n        this.walkAtLeastOne(subProd, currRest, prevRest);\n      } else if (subProd instanceof RepetitionMandatoryWithSeparator) {\n        this.walkAtLeastOneSep(subProd, currRest, prevRest);\n      } else if (subProd instanceof RepetitionWithSeparator) {\n        this.walkManySep(subProd, currRest, prevRest);\n      } else if (subProd instanceof Repetition) {\n        this.walkMany(subProd, currRest, prevRest);\n      } else if (subProd instanceof Alternation) {\n        this.walkOr(subProd, currRest, prevRest);\n      } else {\n        throw Error(\"non exhaustive match\");\n      }\n    });\n  }\n\n  walkTerminal(\n    terminal: Terminal,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {}\n\n  walkProdRef(\n    refProd: NonTerminal,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {}\n\n  walkFlat(\n    flatProd: Alternative,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // ABCDEF => after the D the rest is EF\n    const fullOrRest = currRest.concat(prevRest);\n    this.walk(flatProd, <any>fullOrRest);\n  }\n\n  walkOption(\n    optionProd: Option,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // ABC(DE)?F => after the (DE)? the rest is F\n    const fullOrRest = currRest.concat(prevRest);\n    this.walk(optionProd, <any>fullOrRest);\n  }\n\n  walkAtLeastOne(\n    atLeastOneProd: RepetitionMandatory,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // ABC(DE)+F => after the (DE)+ the rest is (DE)?F\n    const fullAtLeastOneRest: IProduction[] = [\n      new Option({ definition: atLeastOneProd.definition }),\n    ].concat(<any>currRest, <any>prevRest);\n    this.walk(atLeastOneProd, fullAtLeastOneRest);\n  }\n\n  walkAtLeastOneSep(\n    atLeastOneSepProd: RepetitionMandatoryWithSeparator,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // ABC DE(,DE)* F => after the (,DE)+ the rest is (,DE)?F\n    const fullAtLeastOneSepRest = restForRepetitionWithSeparator(\n      atLeastOneSepProd,\n      currRest,\n      prevRest,\n    );\n    this.walk(atLeastOneSepProd, fullAtLeastOneSepRest);\n  }\n\n  walkMany(\n    manyProd: Repetition,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // ABC(DE)*F => after the (DE)* the rest is (DE)?F\n    const fullManyRest: IProduction[] = [\n      new Option({ definition: manyProd.definition }),\n    ].concat(<any>currRest, <any>prevRest);\n    this.walk(manyProd, fullManyRest);\n  }\n\n  walkManySep(\n    manySepProd: RepetitionWithSeparator,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // ABC (DE(,DE)*)? F => after the (,DE)* the rest is (,DE)?F\n    const fullManySepRest = restForRepetitionWithSeparator(\n      manySepProd,\n      currRest,\n      prevRest,\n    );\n    this.walk(manySepProd, fullManySepRest);\n  }\n\n  walkOr(\n    orProd: Alternation,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // ABC(D|E|F)G => when finding the (D|E|F) the rest is G\n    const fullOrRest = currRest.concat(prevRest);\n    // walk all different alternatives\n    orProd.definition.forEach((alt) => {\n      // wrapping each alternative in a single definition wrapper\n      // to avoid errors in computing the rest of that alternative in the invocation to computeInProdFollows\n      // (otherwise for OR([alt1,alt2]) alt2 will be considered in 'rest' of alt1\n      const prodWrapper = new Alternative({ definition: [alt] });\n      this.walk(prodWrapper, <any>fullOrRest);\n    });\n  }\n}\n\nfunction restForRepetitionWithSeparator(\n  repSepProd: RepetitionWithSeparator,\n  currRest: IProduction[],\n  prevRest: IProduction[],\n) {\n  const repSepRest = [\n    new Option({\n      definition: [\n        new Terminal({ terminalType: repSepProd.separator }) as IProduction,\n      ].concat(repSepProd.definition),\n    }) as IProduction,\n  ];\n  const fullRepSepRest: IProduction[] = repSepRest.concat(currRest, prevRest);\n  return fullRepSepRest;\n}\n", "import {\n  isBranchingProd,\n  isOptionalProd,\n  isSequenceProd,\n  NonTerminal,\n  Terminal,\n} from \"@chevrotain/gast\";\nimport { IProduction, TokenType } from \"@chevrotain/types\";\n\nexport function first(prod: IProduction): TokenType[] {\n  /* istanbul ignore else */\n  if (prod instanceof NonTerminal) {\n    // this could in theory cause infinite loops if\n    // (1) prod A refs prod B.\n    // (2) prod B refs prod A\n    // (3) AB can match the empty set\n    // in other words a cycle where everything is optional so the first will keep\n    // looking ahead for the next optional part and will never exit\n    // currently there is no safeguard for this unique edge case because\n    // (1) not sure a grammar in which this can happen is useful for anything (productive)\n    return first((<NonTerminal>prod).referencedRule);\n  } else if (prod instanceof Terminal) {\n    return firstForTerminal(<Terminal>prod);\n  } else if (isSequenceProd(prod)) {\n    return firstForSequence(prod);\n  } else if (isBranchingProd(prod)) {\n    return firstForBranching(prod);\n  } else {\n    throw Error(\"non exhaustive match\");\n  }\n}\n\nexport function firstForSequence(prod: {\n  definition: IProduction[];\n}): TokenType[] {\n  let firstSet: TokenType[] = [];\n  const seq = prod.definition;\n  let nextSubProdIdx = 0;\n  let hasInnerProdsRemaining = seq.length > nextSubProdIdx;\n  let currSubProd;\n  // so we enter the loop at least once (if the definition is not empty\n  let isLastInnerProdOptional = true;\n  // scan a sequence until it's end or until we have found a NONE optional production in it\n  while (hasInnerProdsRemaining && isLastInnerProdOptional) {\n    currSubProd = seq[nextSubProdIdx];\n    isLastInnerProdOptional = isOptionalProd(currSubProd);\n    firstSet = firstSet.concat(first(currSubProd));\n    nextSubProdIdx = nextSubProdIdx + 1;\n    hasInnerProdsRemaining = seq.length > nextSubProdIdx;\n  }\n\n  return [...new Set(firstSet)];\n}\n\nexport function firstForBranching(prod: {\n  definition: IProduction[];\n}): TokenType[] {\n  const allAlternativesFirsts: TokenType[][] = prod.definition.map(\n    (innerProd) => {\n      return first(innerProd);\n    },\n  );\n  return [...new Set(allAlternativesFirsts.flat())];\n}\n\nexport function firstForTerminal(terminal: Terminal): TokenType[] {\n  return [terminal.terminalType];\n}\n", "// TODO: can this be removed? where is it used?\nexport const IN = \"_~IN~_\";\n", "import { RestWalker } from \"./rest.js\";\nimport { first } from \"./first.js\";\nimport { IN } from \"../constants.js\";\nimport { Alternative, NonTerminal, Rule, Terminal } from \"@chevrotain/gast\";\nimport { IProduction, TokenType } from \"@chevrotain/types\";\n\n// This ResyncFollowsWalker computes all of the follows required for RESYNC\n// (skipping reference production).\nexport class ResyncFollowsWalker extends RestWalker {\n  public follows: Record<string, TokenType[]> = {};\n\n  constructor(private topProd: Rule) {\n    super();\n  }\n\n  startWalking(): Record<string, TokenType[]> {\n    this.walk(this.topProd);\n    return this.follows;\n  }\n\n  walkTerminal(\n    terminal: Terminal,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // do nothing! just like in the public sector after 13:00\n  }\n\n  walkProdRef(\n    refProd: NonTerminal,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    const followName =\n      buildBetweenProdsFollowPrefix(refProd.referencedRule, refProd.idx) +\n      this.topProd.name;\n    const fullRest: IProduction[] = currRest.concat(prevRest);\n    const restProd = new Alternative({ definition: fullRest });\n    const t_in_topProd_follows = first(restProd);\n    this.follows[followName] = t_in_topProd_follows;\n  }\n}\n\nexport function computeAllProdsFollows(\n  topProductions: Rule[],\n): Record<string, TokenType[]> {\n  const reSyncFollows = {};\n\n  topProductions.forEach((topProd) => {\n    const currRefsFollow = new ResyncFollowsWalker(topProd).startWalking();\n    Object.assign(reSyncFollows, currRefsFollow);\n  });\n  return reSyncFollows;\n}\n\nexport function buildBetweenProdsFollowPrefix(\n  inner: Rule,\n  occurenceInParent: number,\n): string {\n  return inner.name + occurenceInParent + IN;\n}\n\nexport function buildInProdFollowPrefix(terminal: Terminal): string {\n  const terminalName = terminal.terminalType.name;\n  return terminalName + terminal.idx + IN;\n}\n", "import {\n  Alternative,\n  Assertion,\n  Atom,\n  Disjunction,\n  RegExpParser,\n  RegExpPattern,\n} from \"@chevrotain/regexp-to-ast\";\n\nlet regExpAstCache: { [regex: string]: RegExpPattern } = {};\nconst regExpParser = new RegExpParser();\n\n// this should be moved to regexp-to-ast\nexport type ASTNode =\n  | RegExpPattern\n  | Disjunction\n  | Alternative\n  | Assertion\n  | Atom;\n\nexport function getRegExpAst(regExp: RegExp): RegExpPattern {\n  const regExpStr = regExp.toString();\n  if (regExpAstCache.hasOwnProperty(regExpStr)) {\n    return regExpAstCache[regExpStr];\n  } else {\n    const regExpAst = regExpParser.pattern(regExpStr);\n    regExpAstCache[regExpStr] = regExpAst;\n    return regExpAst;\n  }\n}\n\nexport function clearRegExpParserCache() {\n  regExpAstCache = {};\n}\n", "import {\n  Alternative,\n  Atom,\n  BaseRegExpVisitor,\n  Character,\n  Disjunction,\n  Group,\n  Set,\n} from \"@chevrotain/regexp-to-ast\";\nimport { PRINT_ERROR, PRINT_WARNING } from \"@chevrotain/utils\";\nimport { ASTNode, getRegExpAst } from \"./reg_exp_parser.js\";\nimport { charCodeToOptimizedIndex, minOptimizationVal } from \"./lexer.js\";\n\nconst complementErrorMessage =\n  \"Complement Sets are not supported for first char optimization\";\nexport const failedOptimizationPrefixMsg =\n  'Unable to use \"first char\" lexer optimizations:\\n';\n\nexport function getOptimizedStartCodesIndices(\n  regExp: RegExp,\n  ensureOptimizations = false,\n): number[] {\n  try {\n    const ast = getRegExpAst(regExp);\n    const firstChars = firstCharOptimizedIndices(\n      ast.value,\n      {},\n      ast.flags.ignoreCase,\n    );\n    return firstChars;\n  } catch (e) {\n    /* istanbul ignore next */\n    // Testing this relies on the regexp-to-ast library having a bug... */\n    // TODO: only the else branch needs to be ignored, try to fix with newer prettier / tsc\n    if (e.message === complementErrorMessage) {\n      if (ensureOptimizations) {\n        PRINT_WARNING(\n          `${failedOptimizationPrefixMsg}` +\n            `\\tUnable to optimize: < ${regExp.toString()} >\\n` +\n            \"\\tComplement Sets cannot be automatically optimized.\\n\" +\n            \"\\tThis will disable the lexer's first char optimizations.\\n\" +\n            \"\\tSee: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#COMPLEMENT for details.\",\n        );\n      }\n    } else {\n      let msgSuffix = \"\";\n      if (ensureOptimizations) {\n        msgSuffix =\n          \"\\n\\tThis will disable the lexer's first char optimizations.\\n\" +\n          \"\\tSee: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details.\";\n      }\n      PRINT_ERROR(\n        `${failedOptimizationPrefixMsg}\\n` +\n          `\\tFailed parsing: < ${regExp.toString()} >\\n` +\n          `\\tUsing the @chevrotain/regexp-to-ast library\\n` +\n          \"\\tPlease open an issue at: https://github.com/chevrotain/chevrotain/issues\" +\n          msgSuffix,\n      );\n    }\n  }\n\n  return [];\n}\n\nexport function firstCharOptimizedIndices(\n  ast: ASTNode,\n  result: { [charCode: number]: number },\n  ignoreCase: boolean,\n): number[] {\n  switch (ast.type) {\n    case \"Disjunction\":\n      for (let i = 0; i < ast.value.length; i++) {\n        firstCharOptimizedIndices(ast.value[i], result, ignoreCase);\n      }\n      break;\n    case \"Alternative\":\n      const terms = ast.value;\n      for (let i = 0; i < terms.length; i++) {\n        const term = terms[i];\n\n        // skip terms that cannot effect the first char results\n        switch (term.type) {\n          case \"EndAnchor\":\n          // A group back reference cannot affect potential starting char.\n          // because if a back reference is the first production than automatically\n          // the group being referenced has had to come BEFORE so its codes have already been added\n          case \"GroupBackReference\":\n          // assertions do not affect potential starting codes\n          case \"Lookahead\":\n          case \"NegativeLookahead\":\n          case \"Lookbehind\":\n          case \"NegativeLookbehind\":\n          case \"StartAnchor\":\n          case \"WordBoundary\":\n          case \"NonWordBoundary\":\n            continue;\n        }\n\n        const atom = term;\n        switch (atom.type) {\n          case \"Character\":\n            addOptimizedIdxToResult(atom.value, result, ignoreCase);\n            break;\n          case \"Set\":\n            if (atom.complement === true) {\n              throw Error(complementErrorMessage);\n            }\n            atom.value.forEach((code) => {\n              if (typeof code === \"number\") {\n                addOptimizedIdxToResult(code, result, ignoreCase);\n              } else {\n                // range\n                const range = code as any;\n                // cannot optimize when ignoreCase is\n                if (ignoreCase === true) {\n                  for (\n                    let rangeCode = range.from;\n                    rangeCode <= range.to;\n                    rangeCode++\n                  ) {\n                    addOptimizedIdxToResult(rangeCode, result, ignoreCase);\n                  }\n                }\n                // Optimization (2 orders of magnitude less work for very large ranges)\n                else {\n                  // handle unoptimized values\n                  for (\n                    let rangeCode = range.from;\n                    rangeCode <= range.to && rangeCode < minOptimizationVal;\n                    rangeCode++\n                  ) {\n                    addOptimizedIdxToResult(rangeCode, result, ignoreCase);\n                  }\n\n                  // Less common charCode where we optimize for faster init time, by using larger \"buckets\"\n                  if (range.to >= minOptimizationVal) {\n                    const minUnOptVal =\n                      range.from >= minOptimizationVal\n                        ? range.from\n                        : minOptimizationVal;\n                    const maxUnOptVal = range.to;\n                    const minOptIdx = charCodeToOptimizedIndex(minUnOptVal);\n                    const maxOptIdx = charCodeToOptimizedIndex(maxUnOptVal);\n\n                    for (\n                      let currOptIdx = minOptIdx;\n                      currOptIdx <= maxOptIdx;\n                      currOptIdx++\n                    ) {\n                      result[currOptIdx] = currOptIdx;\n                    }\n                  }\n                }\n              }\n            });\n            break;\n          case \"Group\":\n            firstCharOptimizedIndices(atom.value, result, ignoreCase);\n            break;\n          /* istanbul ignore next */\n          default:\n            throw Error(\"Non Exhaustive Match\");\n        }\n\n        // reached a mandatory production, no more **start** codes can be found on this alternative\n        const isOptionalQuantifier =\n          atom.quantifier !== undefined && atom.quantifier.atLeast === 0;\n        if (\n          // A group may be optional due to empty contents /(?:)/\n          // or if everything inside it is optional /((a)?)/\n          (atom.type === \"Group\" && isWholeOptional(atom) === false) ||\n          // If this term is not a group it may only be optional if it has an optional quantifier\n          (atom.type !== \"Group\" && isOptionalQuantifier === false)\n        ) {\n          break;\n        }\n      }\n      break;\n    /* istanbul ignore next */\n    default:\n      throw Error(\"non exhaustive match!\");\n  }\n\n  // console.log(Object.keys(result).length)\n  return Object.values(result);\n}\n\nfunction addOptimizedIdxToResult(\n  code: number,\n  result: { [charCode: number]: number },\n  ignoreCase: boolean,\n) {\n  const optimizedCharIdx = charCodeToOptimizedIndex(code);\n  result[optimizedCharIdx] = optimizedCharIdx;\n\n  if (ignoreCase === true) {\n    handleIgnoreCase(code, result);\n  }\n}\n\nfunction handleIgnoreCase(\n  code: number,\n  result: { [charCode: number]: number },\n) {\n  const char = String.fromCharCode(code);\n  const upperChar = char.toUpperCase();\n  /* istanbul ignore else */\n  if (upperChar !== char) {\n    const optimizedCharIdx = charCodeToOptimizedIndex(upperChar.charCodeAt(0));\n    result[optimizedCharIdx] = optimizedCharIdx;\n  } else {\n    const lowerChar = char.toLowerCase();\n    if (lowerChar !== char) {\n      const optimizedCharIdx = charCodeToOptimizedIndex(\n        lowerChar.charCodeAt(0),\n      );\n      result[optimizedCharIdx] = optimizedCharIdx;\n    }\n  }\n}\n\nfunction findCode(setNode: Set, targetCharCodes: number[]) {\n  return setNode.value.find((codeOrRange) => {\n    if (typeof codeOrRange === \"number\") {\n      return targetCharCodes.includes(codeOrRange);\n    } else {\n      // range\n      const range = <any>codeOrRange;\n      return (\n        targetCharCodes.find(\n          (targetCode) => range.from <= targetCode && targetCode <= range.to,\n        ) !== undefined\n      );\n    }\n  });\n}\n\nfunction isWholeOptional(ast: any): boolean {\n  const quantifier = (ast as Atom).quantifier;\n  if (quantifier && quantifier.atLeast === 0) {\n    return true;\n  }\n\n  if (!ast.value) {\n    return false;\n  }\n\n  return Array.isArray(ast.value)\n    ? ast.value.every(isWholeOptional)\n    : isWholeOptional(ast.value);\n}\n\nclass CharCodeFinder extends BaseRegExpVisitor {\n  found: boolean = false;\n\n  constructor(private targetCharCodes: number[]) {\n    super();\n  }\n\n  visitChildren(node: ASTNode) {\n    // No need to keep looking...\n    if (this.found === true) {\n      return;\n    }\n\n    // switch lookaheads / lookbehinds as they do not actually consume any characters thus\n    // finding a charCode at lookahead context does not mean that regexp can actually contain it in a match.\n    switch (node.type) {\n      case \"Lookahead\":\n        this.visitLookahead(node);\n        return;\n      case \"NegativeLookahead\":\n        this.visitNegativeLookahead(node);\n        return;\n      case \"Lookbehind\":\n        this.visitLookbehind(node);\n        return;\n      case \"NegativeLookbehind\":\n        this.visitNegativeLookbehind(node);\n        return;\n    }\n\n    super.visitChildren(node);\n  }\n\n  visitCharacter(node: Character) {\n    if (this.targetCharCodes.includes(node.value)) {\n      this.found = true;\n    }\n  }\n\n  visitSet(node: Set) {\n    if (node.complement) {\n      if (findCode(node, this.targetCharCodes) === undefined) {\n        this.found = true;\n      }\n    } else {\n      if (findCode(node, this.targetCharCodes) !== undefined) {\n        this.found = true;\n      }\n    }\n  }\n}\n\nexport function canMatchCharCode(\n  charCodes: number[],\n  pattern: RegExp | string,\n): boolean {\n  if (pattern instanceof RegExp) {\n    const ast = getRegExpAst(pattern);\n    const charCodeFinder = new CharCodeFinder(charCodes);\n    charCodeFinder.visit(ast);\n    return charCodeFinder.found;\n  } else {\n    for (const char of pattern) {\n      const charCode = char.charCodeAt(0);\n      if (charCodes.includes(charCode)) {\n        return true;\n      }\n    }\n    return false;\n  }\n}\n", "import { BaseRegExpVisitor } from \"@chevrotain/regexp-to-ast\";\nimport {\n  IRegExpExec,\n  Lexer,\n  LexerDefinitionErrorType,\n} from \"./lexer_public.js\";\n\nimport { PRINT_ERROR } from \"@chevrotain/utils\";\nimport {\n  canMatchCharCode,\n  failedOptimizationPrefixMsg,\n  getOptimizedStartCodesIndices,\n} from \"./reg_exp.js\";\nimport {\n  ILexerDefinitionError,\n  ILineTerminatorsTester,\n  IMultiModeLexerDefinition,\n  IToken,\n  TokenType,\n} from \"@chevrotain/types\";\nimport { getRegExpAst } from \"./reg_exp_parser.js\";\n\nconst PATTERN = \"PATTERN\";\nexport const DEFAULT_MODE = \"defaultMode\";\nexport const MODES = \"modes\";\n\nexport interface IPatternConfig {\n  pattern: IRegExpExec | string;\n  longerAlt: number[] | undefined;\n  canLineTerminator: boolean;\n  isCustom: boolean;\n  short: number | false;\n  group: string | undefined | false;\n  push: string | undefined;\n  pop: boolean;\n  tokenType: TokenType;\n  tokenTypeIdx: number;\n}\n\nexport interface IAnalyzeResult {\n  patternIdxToConfig: IPatternConfig[];\n  charCodeToPatternIdxToConfig: { [charCode: number]: IPatternConfig[] };\n  emptyGroups: { [groupName: string]: IToken[] };\n  hasCustom: boolean;\n  canBeOptimized: boolean;\n}\n\nexport function analyzeTokenTypes(\n  tokenTypes: TokenType[],\n  options: {\n    positionTracking?: \"full\" | \"onlyStart\" | \"onlyOffset\";\n    ensureOptimizations?: boolean;\n    lineTerminatorCharacters?: (number | string)[];\n    safeMode?: boolean;\n    tracer?: (msg: string, action: () => void) => void;\n  },\n): IAnalyzeResult {\n  options = {\n    safeMode: false as boolean,\n    positionTracking: \"full\",\n    lineTerminatorCharacters: [\"\\r\", \"\\n\"],\n    tracer: (msg: string, action: Function) => action(),\n    ...options,\n  };\n\n  const tracer = options.tracer!;\n\n  tracer(\"initCharCodeToOptimizedIndexMap\", () => {\n    initCharCodeToOptimizedIndexMap();\n  });\n\n  let onlyRelevantTypes: TokenType[];\n  tracer(\"Reject Lexer.NA\", () => {\n    onlyRelevantTypes = tokenTypes.filter((currType) => {\n      return currType[PATTERN] !== Lexer.NA;\n    });\n  });\n\n  let hasCustom = false;\n  let allTransformedPatterns: (IRegExpExec | string)[];\n  tracer(\"Transform Patterns\", () => {\n    hasCustom = false;\n    allTransformedPatterns = onlyRelevantTypes.map(\n      (currType): IRegExpExec | string => {\n        const currPattern = currType[PATTERN];\n\n        /* istanbul ignore else */\n        if (currPattern instanceof RegExp) {\n          const regExpSource = currPattern.source;\n          if (\n            regExpSource.length === 1 &&\n            // only these regExp meta characters which can appear in a length one regExp\n            regExpSource !== \"^\" &&\n            regExpSource !== \"$\" &&\n            regExpSource !== \".\" &&\n            !currPattern.ignoreCase\n          ) {\n            return regExpSource;\n          } else if (\n            regExpSource.length === 2 &&\n            regExpSource[0] === \"\\\\\" &&\n            // not a meta character\n            ![\n              \"d\",\n              \"D\",\n              \"s\",\n              \"S\",\n              \"t\",\n              \"r\",\n              \"n\",\n              \"t\",\n              \"0\",\n              \"c\",\n              \"b\",\n              \"B\",\n              \"f\",\n              \"v\",\n              \"w\",\n              \"W\",\n            ].includes(regExpSource[1])\n          ) {\n            // escaped meta Characters: /\\+/ /\\[/\n            // or redundant escaping: /\\a/\n            // without the escaping \"\\\"\n            return regExpSource[1];\n          } else {\n            return addStickyFlag(currPattern);\n          }\n        } else if (typeof currPattern === \"function\") {\n          hasCustom = true;\n          // CustomPatternMatcherFunc - custom patterns do not require any transformations, only wrapping in a RegExp Like object\n          return { exec: currPattern };\n        } else if (typeof currPattern === \"object\") {\n          hasCustom = true;\n          // ICustomPattern\n          return currPattern;\n        } else if (typeof currPattern === \"string\") {\n          if (currPattern.length === 1) {\n            return currPattern;\n          } else {\n            const escapedRegExpString = currPattern.replace(\n              /[\\\\^$.*+?()[\\]{}|]/g,\n              \"\\\\$&\",\n            );\n            const wrappedRegExp = new RegExp(escapedRegExpString);\n            return addStickyFlag(wrappedRegExp);\n          }\n        } else {\n          throw Error(\"non exhaustive match\");\n        }\n      },\n    );\n  });\n\n  let patternIdxToType: number[];\n  let patternIdxToGroup: (string | undefined | false)[];\n  let patternIdxToLongerAltIdxArr: (number[] | undefined)[];\n  let patternIdxToPushMode: (string | undefined)[];\n  let patternIdxToPopMode: boolean[];\n  tracer(\"misc mapping\", () => {\n    patternIdxToType = onlyRelevantTypes.map(\n      (currType) => currType.tokenTypeIdx!,\n    );\n\n    patternIdxToGroup = onlyRelevantTypes.map((clazz: any) => {\n      const groupName = clazz.GROUP;\n      /* istanbul ignore next */\n      if (groupName === Lexer.SKIPPED) {\n        return undefined;\n      } else if (typeof groupName === \"string\") {\n        return groupName;\n      } else if (groupName === undefined) {\n        return false;\n      } else {\n        throw Error(\"non exhaustive match\");\n      }\n    });\n\n    patternIdxToLongerAltIdxArr = onlyRelevantTypes.map((clazz: any) => {\n      const longerAltType = clazz.LONGER_ALT;\n\n      if (longerAltType) {\n        const longerAltIdxArr = Array.isArray(longerAltType)\n          ? longerAltType.map((type: any) => onlyRelevantTypes.indexOf(type))\n          : [onlyRelevantTypes.indexOf(longerAltType)];\n        return longerAltIdxArr;\n      }\n    });\n\n    patternIdxToPushMode = onlyRelevantTypes.map(\n      (clazz: any) => clazz.PUSH_MODE,\n    );\n\n    patternIdxToPopMode = onlyRelevantTypes.map((clazz: any) =>\n      Object.hasOwn(clazz, \"POP_MODE\"),\n    );\n  });\n\n  let patternIdxToCanLineTerminator: boolean[];\n  tracer(\"Line Terminator Handling\", () => {\n    const lineTerminatorCharCodes = getCharCodes(\n      options.lineTerminatorCharacters!,\n    );\n    patternIdxToCanLineTerminator = onlyRelevantTypes.map((tokType) => false);\n    if (options.positionTracking !== \"onlyOffset\") {\n      patternIdxToCanLineTerminator = onlyRelevantTypes.map((tokType) => {\n        if (Object.hasOwn(tokType, \"LINE_BREAKS\")) {\n          return !!tokType.LINE_BREAKS;\n        } else {\n          return (\n            checkLineBreaksIssues(tokType, lineTerminatorCharCodes) === false &&\n            canMatchCharCode(\n              lineTerminatorCharCodes,\n              tokType.PATTERN as RegExp | string,\n            )\n          );\n        }\n      });\n    }\n  });\n\n  let patternIdxToIsCustom: boolean[];\n  let patternIdxToShort: (number | false)[];\n  let emptyGroups!: { [groupName: string]: IToken[] };\n  let patternIdxToConfig!: IPatternConfig[];\n  tracer(\"Misc Mapping #2\", () => {\n    patternIdxToIsCustom = onlyRelevantTypes.map(isCustomPattern);\n    patternIdxToShort = allTransformedPatterns.map(isShortPattern);\n\n    emptyGroups = onlyRelevantTypes.reduce(\n      (acc, clazz: any) => {\n        const groupName = clazz.GROUP;\n        if (typeof groupName === \"string\" && !(groupName === Lexer.SKIPPED)) {\n          acc[groupName] = [];\n        }\n        return acc;\n      },\n      {} as { [groupName: string]: IToken[] },\n    );\n\n    patternIdxToConfig = allTransformedPatterns.map(\n      (x, idx): IPatternConfig => {\n        return {\n          pattern: allTransformedPatterns[idx],\n          longerAlt: patternIdxToLongerAltIdxArr[idx],\n          canLineTerminator: patternIdxToCanLineTerminator[idx],\n          isCustom: patternIdxToIsCustom[idx],\n          short: patternIdxToShort[idx],\n          group: patternIdxToGroup[idx],\n          push: patternIdxToPushMode[idx],\n          pop: patternIdxToPopMode[idx],\n          tokenTypeIdx: patternIdxToType[idx],\n          tokenType: onlyRelevantTypes[idx],\n        };\n      },\n    );\n  });\n\n  let canBeOptimized = true;\n  let charCodeToPatternIdxToConfig: { [charCode: number]: IPatternConfig[] } =\n    [];\n\n  if (!options.safeMode) {\n    tracer(\"First Char Optimization\", () => {\n      charCodeToPatternIdxToConfig = onlyRelevantTypes.reduce(\n        (result, currTokType, idx) => {\n          if (typeof currTokType.PATTERN === \"string\") {\n            const charCode = currTokType.PATTERN.charCodeAt(0);\n            const optimizedIdx = charCodeToOptimizedIndex(charCode);\n            addToMapOfArrays(result, optimizedIdx, patternIdxToConfig[idx]);\n          } else if (Array.isArray(currTokType.START_CHARS_HINT)) {\n            let lastOptimizedIdx: number;\n            currTokType.START_CHARS_HINT.forEach((charOrInt) => {\n              const charCode =\n                typeof charOrInt === \"string\"\n                  ? charOrInt.charCodeAt(0)\n                  : charOrInt;\n              const currOptimizedIdx = charCodeToOptimizedIndex(charCode);\n              // Avoid adding the config multiple times\n              /* istanbul ignore else */\n              // - Difficult to check this scenario effects as it is only a performance\n              //   optimization that does not change correctness\n              if (lastOptimizedIdx !== currOptimizedIdx) {\n                lastOptimizedIdx = currOptimizedIdx;\n                addToMapOfArrays(\n                  result,\n                  currOptimizedIdx,\n                  patternIdxToConfig[idx],\n                );\n              }\n            });\n          } else if (currTokType.PATTERN instanceof RegExp) {\n            if (currTokType.PATTERN.unicode) {\n              canBeOptimized = false;\n              if (options.ensureOptimizations) {\n                PRINT_ERROR(\n                  `${failedOptimizationPrefixMsg}` +\n                    `\\tUnable to analyze < ${currTokType.PATTERN.toString()} > pattern.\\n` +\n                    \"\\tThe regexp unicode flag is not currently supported by the regexp-to-ast library.\\n\" +\n                    \"\\tThis will disable the lexer's first char optimizations.\\n\" +\n                    \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE\",\n                );\n              }\n            } else {\n              const optimizedCodes = getOptimizedStartCodesIndices(\n                currTokType.PATTERN,\n                options.ensureOptimizations,\n              );\n              /* istanbul ignore if */\n              // start code will only be empty given an empty regExp or failure of regexp-to-ast library\n              // the first should be a different validation and the second cannot be tested.\n              if (optimizedCodes.length === 0) {\n                // we cannot understand what codes may start possible matches\n                // The optimization correctness requires knowing start codes for ALL patterns.\n                // Not actually sure this is an error, no debug message\n                canBeOptimized = false;\n              }\n              optimizedCodes.forEach((code) => {\n                addToMapOfArrays(result, code, patternIdxToConfig[idx]);\n              });\n            }\n          } else {\n            if (options.ensureOptimizations) {\n              PRINT_ERROR(\n                `${failedOptimizationPrefixMsg}` +\n                  `\\tTokenType: <${currTokType.name}> is using a custom token pattern without providing <start_chars_hint> parameter.\\n` +\n                  \"\\tThis will disable the lexer's first char optimizations.\\n\" +\n                  \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE\",\n              );\n            }\n            canBeOptimized = false;\n          }\n\n          return result;\n        },\n        [] as { [charCode: number]: IPatternConfig[] },\n      );\n    });\n  }\n\n  return {\n    emptyGroups: emptyGroups,\n    patternIdxToConfig: patternIdxToConfig,\n    charCodeToPatternIdxToConfig: charCodeToPatternIdxToConfig,\n    hasCustom: hasCustom,\n    canBeOptimized: canBeOptimized,\n  };\n}\n\nexport function validatePatterns(\n  tokenTypes: TokenType[],\n  validModesNames: string[],\n): ILexerDefinitionError[] {\n  let errors: ILexerDefinitionError[] = [];\n\n  const missingResult = findMissingPatterns(tokenTypes);\n  errors = errors.concat(missingResult.errors);\n\n  const invalidResult = findInvalidPatterns(missingResult.valid);\n  const validTokenTypes = invalidResult.valid;\n  errors = errors.concat(invalidResult.errors);\n\n  errors = errors.concat(validateRegExpPattern(validTokenTypes));\n\n  errors = errors.concat(findInvalidGroupType(validTokenTypes));\n\n  errors = errors.concat(\n    findModesThatDoNotExist(validTokenTypes, validModesNames),\n  );\n\n  errors = errors.concat(findUnreachablePatterns(validTokenTypes));\n\n  return errors;\n}\n\nfunction validateRegExpPattern(\n  tokenTypes: TokenType[],\n): ILexerDefinitionError[] {\n  let errors: ILexerDefinitionError[] = [];\n  const withRegExpPatterns = tokenTypes.filter(\n    (currTokType) => currTokType[PATTERN] instanceof RegExp,\n  );\n\n  errors = errors.concat(findEndOfInputAnchor(withRegExpPatterns));\n\n  errors = errors.concat(findStartOfInputAnchor(withRegExpPatterns));\n\n  errors = errors.concat(findUnsupportedFlags(withRegExpPatterns));\n\n  errors = errors.concat(findDuplicatePatterns(withRegExpPatterns));\n\n  errors = errors.concat(findEmptyMatchRegExps(withRegExpPatterns));\n\n  return errors;\n}\n\nexport interface ILexerFilterResult {\n  errors: ILexerDefinitionError[];\n  valid: TokenType[];\n}\n\nexport function findMissingPatterns(\n  tokenTypes: TokenType[],\n): ILexerFilterResult {\n  const tokenTypesWithMissingPattern = tokenTypes.filter((currType) => {\n    return !Object.hasOwn(currType, PATTERN);\n  });\n\n  const errors = tokenTypesWithMissingPattern.map((currType) => {\n    return {\n      message:\n        \"Token Type: ->\" +\n        currType.name +\n        \"<- missing static 'PATTERN' property\",\n      type: LexerDefinitionErrorType.MISSING_PATTERN,\n      tokenTypes: [currType],\n    };\n  });\n\n  const valid = tokenTypes.filter(\n    (x) => !tokenTypesWithMissingPattern.includes(x),\n  );\n  return { errors, valid };\n}\n\nexport function findInvalidPatterns(\n  tokenTypes: TokenType[],\n): ILexerFilterResult {\n  const tokenTypesWithInvalidPattern = tokenTypes.filter((currType) => {\n    const pattern = currType[PATTERN];\n    return (\n      !(pattern instanceof RegExp) &&\n      !(typeof pattern === \"function\") &&\n      !Object.hasOwn(pattern as any, \"exec\") &&\n      !(typeof pattern === \"string\")\n    );\n  });\n\n  const errors = tokenTypesWithInvalidPattern.map((currType) => {\n    return {\n      message:\n        \"Token Type: ->\" +\n        currType.name +\n        \"<- static 'PATTERN' can only be a RegExp, a\" +\n        \" Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.\",\n      type: LexerDefinitionErrorType.INVALID_PATTERN,\n      tokenTypes: [currType],\n    };\n  });\n\n  const valid = tokenTypes.filter(\n    (x) => !tokenTypesWithInvalidPattern.includes(x),\n  );\n  return { errors, valid };\n}\n\nconst end_of_input = /[^\\\\][$]/;\n\nexport function findEndOfInputAnchor(\n  tokenTypes: TokenType[],\n): ILexerDefinitionError[] {\n  class EndAnchorFinder extends BaseRegExpVisitor {\n    found = false;\n\n    visitEndAnchor(node: unknown) {\n      this.found = true;\n    }\n  }\n\n  const invalidRegex = tokenTypes.filter((currType) => {\n    const pattern = currType.PATTERN;\n\n    try {\n      const regexpAst = getRegExpAst(pattern as RegExp);\n      const endAnchorVisitor = new EndAnchorFinder();\n      endAnchorVisitor.visit(regexpAst);\n\n      return endAnchorVisitor.found;\n    } catch (e) {\n      // old behavior in case of runtime exceptions with regexp-to-ast.\n      /* istanbul ignore next - cannot ensure an error in regexp-to-ast*/\n      return end_of_input.test((pattern as RegExp).source);\n    }\n  });\n\n  const errors = invalidRegex.map((currType) => {\n    return {\n      message:\n        \"Unexpected RegExp Anchor Error:\\n\" +\n        \"\\tToken Type: ->\" +\n        currType.name +\n        \"<- static 'PATTERN' cannot contain end of input anchor '$'\\n\" +\n        \"\\tSee chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS\" +\n        \"\\tfor details.\",\n      type: LexerDefinitionErrorType.EOI_ANCHOR_FOUND,\n      tokenTypes: [currType],\n    };\n  });\n\n  return errors;\n}\n\nexport function findEmptyMatchRegExps(\n  tokenTypes: TokenType[],\n): ILexerDefinitionError[] {\n  const matchesEmptyString = tokenTypes.filter((currType) => {\n    const pattern = currType.PATTERN as RegExp;\n    return pattern.test(\"\");\n  });\n\n  const errors = matchesEmptyString.map((currType) => {\n    return {\n      message:\n        \"Token Type: ->\" +\n        currType.name +\n        \"<- static 'PATTERN' must not match an empty string\",\n      type: LexerDefinitionErrorType.EMPTY_MATCH_PATTERN,\n      tokenTypes: [currType],\n    };\n  });\n\n  return errors;\n}\n\nconst start_of_input = /[^\\\\[][\\^]|^\\^/;\n\nexport function findStartOfInputAnchor(\n  tokenTypes: TokenType[],\n): ILexerDefinitionError[] {\n  class StartAnchorFinder extends BaseRegExpVisitor {\n    found = false;\n\n    visitStartAnchor(node: unknown) {\n      this.found = true;\n    }\n  }\n\n  const invalidRegex = tokenTypes.filter((currType) => {\n    const pattern = currType.PATTERN as RegExp;\n    try {\n      const regexpAst = getRegExpAst(pattern);\n      const startAnchorVisitor = new StartAnchorFinder();\n      startAnchorVisitor.visit(regexpAst);\n\n      return startAnchorVisitor.found;\n    } catch (e) {\n      // old behavior in case of runtime exceptions with regexp-to-ast.\n      /* istanbul ignore next - cannot ensure an error in regexp-to-ast*/\n      return start_of_input.test(pattern.source);\n    }\n  });\n\n  const errors = invalidRegex.map((currType) => {\n    return {\n      message:\n        \"Unexpected RegExp Anchor Error:\\n\" +\n        \"\\tToken Type: ->\" +\n        currType.name +\n        \"<- static 'PATTERN' cannot contain start of input anchor '^'\\n\" +\n        \"\\tSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS\" +\n        \"\\tfor details.\",\n      type: LexerDefinitionErrorType.SOI_ANCHOR_FOUND,\n      tokenTypes: [currType],\n    };\n  });\n\n  return errors;\n}\n\nexport function findUnsupportedFlags(\n  tokenTypes: TokenType[],\n): ILexerDefinitionError[] {\n  const invalidFlags = tokenTypes.filter((currType) => {\n    const pattern = currType[PATTERN];\n    return pattern instanceof RegExp && (pattern.multiline || pattern.global);\n  });\n\n  const errors = invalidFlags.map((currType) => {\n    return {\n      message:\n        \"Token Type: ->\" +\n        currType.name +\n        \"<- static 'PATTERN' may NOT contain global('g') or multiline('m')\",\n      type: LexerDefinitionErrorType.UNSUPPORTED_FLAGS_FOUND,\n      tokenTypes: [currType],\n    };\n  });\n\n  return errors;\n}\n\n// This can only test for identical duplicate RegExps, not semantically equivalent ones.\nexport function findDuplicatePatterns(\n  tokenTypes: TokenType[],\n): ILexerDefinitionError[] {\n  const found: TokenType[] = [];\n  let identicalPatterns = tokenTypes.map((outerType: any) => {\n    return tokenTypes.reduce((result, innerType) => {\n      if (\n        outerType.PATTERN.source === (innerType.PATTERN as RegExp).source &&\n        !found.includes(innerType) &&\n        innerType.PATTERN !== Lexer.NA\n      ) {\n        // this avoids duplicates in the result, each Token Type may only appear in one \"set\"\n        // in essence we are creating Equivalence classes on equality relation.\n        found.push(innerType);\n        result.push(innerType);\n        return result;\n      }\n      return result;\n    }, [] as TokenType[]);\n  });\n\n  identicalPatterns = identicalPatterns.filter(Boolean);\n\n  const duplicatePatterns = identicalPatterns.filter((currIdenticalSet) => {\n    return currIdenticalSet.length > 1;\n  });\n\n  const errors = duplicatePatterns.map((setOfIdentical: any) => {\n    const tokenTypeNames = setOfIdentical.map((currType: any) => {\n      return currType.name;\n    });\n\n    const dupPatternSrc = (<any>setOfIdentical[0]).PATTERN;\n    return {\n      message:\n        `The same RegExp pattern ->${dupPatternSrc}<-` +\n        `has been used in all of the following Token Types: ${tokenTypeNames.join(\n          \", \",\n        )} <-`,\n      type: LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,\n      tokenTypes: setOfIdentical,\n    };\n  });\n\n  return errors;\n}\n\nexport function findInvalidGroupType(\n  tokenTypes: TokenType[],\n): ILexerDefinitionError[] {\n  const invalidTypes = tokenTypes.filter((clazz: any) => {\n    if (!Object.hasOwn(clazz, \"GROUP\")) {\n      return false;\n    }\n    const group = clazz.GROUP;\n\n    return (\n      group !== Lexer.SKIPPED &&\n      group !== Lexer.NA &&\n      !(typeof group === \"string\")\n    );\n  });\n\n  const errors = invalidTypes.map((currType) => {\n    return {\n      message:\n        \"Token Type: ->\" +\n        currType.name +\n        \"<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String\",\n      type: LexerDefinitionErrorType.INVALID_GROUP_TYPE_FOUND,\n      tokenTypes: [currType],\n    };\n  });\n\n  return errors;\n}\n\nexport function findModesThatDoNotExist(\n  tokenTypes: TokenType[],\n  validModes: string[],\n): ILexerDefinitionError[] {\n  const invalidModes = tokenTypes.filter((clazz: any) => {\n    return (\n      clazz.PUSH_MODE !== undefined && !validModes.includes(clazz.PUSH_MODE)\n    );\n  });\n\n  const errors = invalidModes.map((tokType) => {\n    const msg =\n      `Token Type: ->${tokType.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${tokType.PUSH_MODE}<-` +\n      `which does not exist`;\n    return {\n      message: msg,\n      type: LexerDefinitionErrorType.PUSH_MODE_DOES_NOT_EXIST,\n      tokenTypes: [tokType],\n    };\n  });\n\n  return errors;\n}\n\nexport function findUnreachablePatterns(\n  tokenTypes: TokenType[],\n): ILexerDefinitionError[] {\n  const errors: ILexerDefinitionError[] = [];\n\n  const canBeTested = tokenTypes.reduce(\n    (result, tokType, idx) => {\n      const pattern = tokType.PATTERN;\n\n      if (pattern === Lexer.NA) {\n        return result;\n      }\n\n      // a more comprehensive validation for all forms of regExps would require\n      // deeper regExp analysis capabilities\n      if (typeof pattern === \"string\") {\n        result.push({ str: pattern, idx, tokenType: tokType });\n      } else if (pattern instanceof RegExp && noMetaChar(pattern)) {\n        result.push({ str: pattern.source, idx, tokenType: tokType });\n      }\n      return result;\n    },\n    [] as { str: string; idx: number; tokenType: TokenType }[],\n  );\n\n  tokenTypes.forEach((aTokType, aIdx) => {\n    canBeTested.forEach(({ str: bStr, idx: bIdx, tokenType: bTokType }) => {\n      if (aIdx < bIdx && tryToMatchStrToPattern(bStr, aTokType.PATTERN)) {\n        const msg =\n          `Token: ->${bTokType.name}<- can never be matched.\\n` +\n          `Because it appears AFTER the Token Type ->${aTokType.name}<-` +\n          `in the lexer's definition.\\n` +\n          `See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;\n        errors.push({\n          message: msg,\n          type: LexerDefinitionErrorType.UNREACHABLE_PATTERN,\n          tokenTypes: [aTokType, bTokType],\n        });\n      }\n    });\n  });\n\n  return errors;\n}\n\nfunction tryToMatchStrToPattern(str: string, pattern: any): boolean {\n  if (pattern instanceof RegExp) {\n    if (usesLookAheadOrBehind(pattern)) {\n      // if lookahead or lookbehind assertions are used\n      // we assume they would be responsible for disambiguating the match\n      // The alternative is to risk false positive unreachable pattern errors.\n      // e.g.: /(?<!a)b/ and /b/ tokens would cause such false positives.\n      return false;\n    }\n    const regExpArray = pattern.exec(str);\n    return regExpArray !== null && regExpArray.index === 0;\n  } else if (typeof pattern === \"function\") {\n    // maintain the API of custom patterns\n    return pattern(str, 0, [], {});\n  } else if (Object.hasOwn(pattern, \"exec\")) {\n    // maintain the API of custom patterns\n    return pattern.exec(str, 0, [], {});\n  } else if (typeof pattern === \"string\") {\n    return pattern === str;\n  } else {\n    throw Error(\"non exhaustive match\");\n  }\n}\n\nfunction noMetaChar(regExp: RegExp): boolean {\n  //https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp\n  const metaChars = [\n    \".\",\n    \"\\\\\",\n    \"[\",\n    \"]\",\n    \"|\",\n    \"^\",\n    \"$\",\n    \"(\",\n    \")\",\n    \"?\",\n    \"*\",\n    \"+\",\n    \"{\",\n  ];\n  return (\n    metaChars.find((char) => regExp.source.indexOf(char) !== -1) === undefined\n  );\n}\n\nfunction usesLookAheadOrBehind(regExp: RegExp): boolean {\n  return /(\\(\\?=)|(\\(\\?!)|(\\(\\?<=)|(\\(\\?<!)/.test(regExp.source);\n}\n\nexport function addStartOfInput(pattern: RegExp): RegExp {\n  const flags = pattern.ignoreCase ? \"i\" : \"\";\n  // always wrapping in a none capturing group preceded by '^' to make sure matching can only work on start of input.\n  // duplicate/redundant start of input markers have no meaning (/^^^^A/ === /^A/)\n  return new RegExp(`^(?:${pattern.source})`, flags);\n}\n\nexport function addStickyFlag(pattern: RegExp): RegExp {\n  const flags = pattern.ignoreCase ? \"iy\" : \"y\";\n  return new RegExp(`${pattern.source}`, flags);\n}\n\nexport function performRuntimeChecks(\n  lexerDefinition: IMultiModeLexerDefinition,\n  trackLines: boolean,\n  lineTerminatorCharacters: (number | string)[],\n): ILexerDefinitionError[] {\n  const errors: ILexerDefinitionError[] = [];\n\n  // some run time checks to help the end users.\n  if (!Object.hasOwn(lexerDefinition, DEFAULT_MODE)) {\n    errors.push({\n      message:\n        \"A MultiMode Lexer cannot be initialized without a <\" +\n        DEFAULT_MODE +\n        \"> property in its definition\\n\",\n      type: LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE,\n    });\n  }\n  if (!Object.hasOwn(lexerDefinition, MODES)) {\n    errors.push({\n      message:\n        \"A MultiMode Lexer cannot be initialized without a <\" +\n        MODES +\n        \"> property in its definition\\n\",\n      type: LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY,\n    });\n  }\n\n  if (\n    Object.hasOwn(lexerDefinition, MODES) &&\n    Object.hasOwn(lexerDefinition, DEFAULT_MODE) &&\n    !Object.hasOwn(lexerDefinition.modes, lexerDefinition.defaultMode)\n  ) {\n    errors.push({\n      message:\n        `A MultiMode Lexer cannot be initialized with a ${DEFAULT_MODE}: <${lexerDefinition.defaultMode}>` +\n        `which does not exist\\n`,\n      type: LexerDefinitionErrorType.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST,\n    });\n  }\n\n  if (Object.hasOwn(lexerDefinition, MODES)) {\n    Object.keys(lexerDefinition.modes).forEach((currModeName) => {\n      const currModeValue = lexerDefinition.modes[currModeName];\n      currModeValue.forEach((currTokType, currIdx) => {\n        if (currTokType === undefined) {\n          errors.push({\n            message:\n              `A Lexer cannot be initialized using an undefined Token Type. Mode:` +\n              `<${currModeName}> at index: <${currIdx}>\\n`,\n            type: LexerDefinitionErrorType.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED,\n          });\n        } else if (Object.hasOwn(currTokType, \"LONGER_ALT\")) {\n          const longerAlt = Array.isArray(currTokType.LONGER_ALT)\n            ? currTokType.LONGER_ALT\n            : [currTokType.LONGER_ALT];\n          longerAlt.forEach((currLongerAlt) => {\n            if (\n              currLongerAlt !== undefined &&\n              !currModeValue.includes(currLongerAlt)\n            ) {\n              errors.push({\n                message: `A MultiMode Lexer cannot be initialized with a longer_alt <${currLongerAlt!.name}> on token <${currTokType.name}> outside of mode <${currModeName}>\\n`,\n                type: LexerDefinitionErrorType.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE,\n              });\n            }\n          });\n        }\n      });\n    });\n  }\n\n  return errors;\n}\n\nexport function performWarningRuntimeChecks(\n  lexerDefinition: IMultiModeLexerDefinition,\n  trackLines: boolean,\n  lineTerminatorCharacters: (number | string)[],\n): ILexerDefinitionError[] {\n  const warnings = [];\n  let hasAnyLineBreak = false;\n  const allTokenTypes = Object.values(lexerDefinition.modes || {})\n    .flat()\n    .filter(Boolean);\n\n  const concreteTokenTypes = allTokenTypes.filter(\n    (currType) => currType[PATTERN] !== Lexer.NA,\n  );\n  const terminatorCharCodes = getCharCodes(lineTerminatorCharacters);\n  if (trackLines) {\n    concreteTokenTypes.forEach((tokType) => {\n      const currIssue = checkLineBreaksIssues(tokType, terminatorCharCodes);\n      if (currIssue !== false) {\n        const message = buildLineBreakIssueMessage(tokType, currIssue);\n        const warningDescriptor = {\n          message,\n          type: currIssue.issue,\n          tokenType: tokType,\n        };\n        warnings.push(warningDescriptor);\n      } else {\n        // we don't want to attempt to scan if the user explicitly specified the line_breaks option.\n        if (Object.hasOwn(tokType, \"LINE_BREAKS\")) {\n          if (tokType.LINE_BREAKS === true) {\n            hasAnyLineBreak = true;\n          }\n        } else {\n          if (\n            canMatchCharCode(terminatorCharCodes, tokType.PATTERN as RegExp)\n          ) {\n            hasAnyLineBreak = true;\n          }\n        }\n      }\n    });\n  }\n\n  if (trackLines && !hasAnyLineBreak) {\n    warnings.push({\n      message:\n        \"Warning: No LINE_BREAKS Found.\\n\" +\n        \"\\tThis Lexer has been defined to track line and column information,\\n\" +\n        \"\\tBut none of the Token Types can be identified as matching a line terminator.\\n\" +\n        \"\\tSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#LINE_BREAKS \\n\" +\n        \"\\tfor details.\",\n      type: LexerDefinitionErrorType.NO_LINE_BREAKS_FLAGS,\n    });\n  }\n  return warnings;\n}\n\nexport function cloneEmptyGroups(emptyGroups: {\n  [groupName: string]: IToken;\n}): { [groupName: string]: IToken } {\n  const clonedResult: any = {};\n  const groupKeys = Object.keys(emptyGroups);\n\n  groupKeys.forEach((currKey) => {\n    const currGroupValue = emptyGroups[currKey];\n\n    /* istanbul ignore else */\n    if (Array.isArray(currGroupValue)) {\n      clonedResult[currKey] = [];\n    } else {\n      throw Error(\"non exhaustive match\");\n    }\n  });\n\n  return clonedResult;\n}\n\n// TODO: refactor to avoid duplication\nexport function isCustomPattern(tokenType: TokenType): boolean {\n  const pattern = tokenType.PATTERN;\n  /* istanbul ignore else */\n  if (pattern instanceof RegExp) {\n    return false;\n  } else if (typeof pattern === \"function\") {\n    // CustomPatternMatcherFunc - custom patterns do not require any transformations, only wrapping in a RegExp Like object\n    return true;\n  } else if (Object.hasOwn(pattern as any, \"exec\")) {\n    // ICustomPattern\n    return true;\n  } else if (typeof pattern === \"string\") {\n    return false;\n  } else {\n    throw Error(\"non exhaustive match\");\n  }\n}\n\nexport function isShortPattern(pattern: any): number | false {\n  if (typeof pattern === \"string\" && pattern.length === 1) {\n    return pattern.charCodeAt(0);\n  } else {\n    return false;\n  }\n}\n\n/**\n * Faster than using a RegExp for default newline detection during lexing.\n */\nexport const LineTerminatorOptimizedTester: ILineTerminatorsTester = {\n  // implements /\\n|\\r\\n?/g.test\n  test: function (text) {\n    const len = text.length;\n    for (let i = this.lastIndex; i < len; i++) {\n      const c = text.charCodeAt(i);\n      if (c === 10) {\n        this.lastIndex = i + 1;\n        return true;\n      } else if (c === 13) {\n        if (text.charCodeAt(i + 1) === 10) {\n          this.lastIndex = i + 2;\n        } else {\n          this.lastIndex = i + 1;\n        }\n        return true;\n      }\n    }\n    return false;\n  },\n\n  lastIndex: 0,\n};\n\nfunction checkLineBreaksIssues(\n  tokType: TokenType,\n  lineTerminatorCharCodes: number[],\n):\n  | {\n      issue:\n        | LexerDefinitionErrorType.IDENTIFY_TERMINATOR\n        | LexerDefinitionErrorType.CUSTOM_LINE_BREAK;\n      errMsg?: string;\n    }\n  | false {\n  if (Object.hasOwn(tokType, \"LINE_BREAKS\")) {\n    // if the user explicitly declared the line_breaks option we will respect their choice\n    // and assume it is correct.\n    return false;\n  } else {\n    /* istanbul ignore else */\n    if (tokType.PATTERN instanceof RegExp) {\n      try {\n        // TODO: why is the casting suddenly needed?\n        canMatchCharCode(lineTerminatorCharCodes, tokType.PATTERN as RegExp);\n      } catch (e) {\n        /* istanbul ignore next - to test this we would have to mock <canMatchCharCode> to throw an error */\n        return {\n          issue: LexerDefinitionErrorType.IDENTIFY_TERMINATOR,\n          errMsg: (e as Error).message,\n        };\n      }\n      return false;\n    } else if (typeof tokType.PATTERN === \"string\") {\n      // string literal patterns can always be analyzed to detect line terminator usage\n      return false;\n    } else if (isCustomPattern(tokType)) {\n      // custom token types\n      return { issue: LexerDefinitionErrorType.CUSTOM_LINE_BREAK };\n    } else {\n      throw Error(\"non exhaustive match\");\n    }\n  }\n}\n\nexport function buildLineBreakIssueMessage(\n  tokType: TokenType,\n  details: {\n    issue:\n      | LexerDefinitionErrorType.IDENTIFY_TERMINATOR\n      | LexerDefinitionErrorType.CUSTOM_LINE_BREAK;\n    errMsg?: string;\n  },\n): string {\n  /* istanbul ignore else */\n  if (details.issue === LexerDefinitionErrorType.IDENTIFY_TERMINATOR) {\n    return (\n      \"Warning: unable to identify line terminator usage in pattern.\\n\" +\n      `\\tThe problem is in the <${tokType.name}> Token Type\\n` +\n      `\\t Root cause: ${details.errMsg}.\\n` +\n      \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR\"\n    );\n  } else if (details.issue === LexerDefinitionErrorType.CUSTOM_LINE_BREAK) {\n    return (\n      \"Warning: A Custom Token Pattern should specify the <line_breaks> option.\\n\" +\n      `\\tThe problem is in the <${tokType.name}> Token Type\\n` +\n      \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK\"\n    );\n  } else {\n    throw Error(\"non exhaustive match\");\n  }\n}\n\nfunction getCharCodes(charsOrCodes: (number | string)[]): number[] {\n  const charCodes = charsOrCodes.map((numOrString) => {\n    if (typeof numOrString === \"string\") {\n      return numOrString.charCodeAt(0);\n    } else {\n      return numOrString;\n    }\n  });\n\n  return charCodes;\n}\n\nfunction addToMapOfArrays<T>(\n  map: Record<number, T[]>,\n  key: number,\n  value: T,\n): void {\n  if (map[key] === undefined) {\n    map[key] = [value];\n  } else {\n    map[key].push(value);\n  }\n}\n\nexport const minOptimizationVal = 256;\n\n/**\n * We are mapping charCode above ASCI (256) into buckets each in the size of 256.\n * This is because ASCI are the most common start chars so each one of those will get its own\n * possible token configs vector.\n *\n * Tokens starting with charCodes \"above\" ASCI are uncommon, so we can \"afford\"\n * to place these into buckets of possible token configs, What we gain from\n * this is avoiding the case of creating an optimization 'charCodeToPatternIdxToConfig'\n * which would contain 10,000+ arrays of small size (e.g unicode Identifiers scenario).\n * Our 'charCodeToPatternIdxToConfig' max size will now be:\n * 256 + (2^16 / 2^8) - 1 === 511\n *\n * note the hack for fast division integer part extraction\n * See: https://stackoverflow.com/a/4228528\n */\nlet charCodeToOptimizedIdxMap: number[] = [];\nexport function charCodeToOptimizedIndex(charCode: number): number {\n  return charCode < minOptimizationVal\n    ? charCode\n    : charCodeToOptimizedIdxMap[charCode];\n}\n\n/**\n * This is a compromise between cold start / hot running performance\n * Creating this array takes ~3ms on a modern machine,\n * But if we perform the computation at runtime as needed the CSS Lexer benchmark\n * performance degrades by ~10%\n *\n * TODO: Perhaps it should be lazy initialized only if a charCode > 255 is used.\n */\nfunction initCharCodeToOptimizedIndexMap() {\n  if (charCodeToOptimizedIdxMap.length === 0) {\n    charCodeToOptimizedIdxMap = new Array(65536);\n    for (let i = 0; i < 65536; i++) {\n      charCodeToOptimizedIdxMap[i] = i > 255 ? 255 + ~~(i / 255) : i;\n    }\n  }\n}\n", "import { IToken, TokenType } from \"@chevrotain/types\";\n\nexport function tokenStructuredMatcher(\n  tokInstance: IToken,\n  tokConstructor: TokenType,\n) {\n  const instanceType = tokInstance.tokenTypeIdx;\n  if (instanceType === tokConstructor.tokenTypeIdx) {\n    return true;\n  } else {\n    return (\n      tokConstructor.isParent === true &&\n      tokConstructor.categoryMatchesMap![instanceType] === true\n    );\n  }\n}\n\n// Optimized tokenMatcher in case our grammar does not use token categories\n// Being so tiny it is much more likely to be in-lined and this avoid the function call overhead\nexport function tokenStructuredMatcherNoCategories(\n  token: IToken,\n  tokType: TokenType,\n) {\n  return token.tokenTypeIdx === tokType.tokenTypeIdx;\n}\n\nexport let tokenShortNameIdx = 1;\nexport const tokenIdxToClass: { [tokenIdx: number]: TokenType } = {};\n\nexport function augmentTokenTypes(tokenTypes: TokenType[]): void {\n  // collect the parent Token Types as well.\n  const tokenTypesAndParents = expandCategories(tokenTypes);\n\n  // add required tokenType and categoryMatches properties\n  assignTokenDefaultProps(tokenTypesAndParents);\n\n  // fill up the categoryMatches\n  assignCategoriesMapProp(tokenTypesAndParents);\n  assignCategoriesTokensProp(tokenTypesAndParents);\n\n  tokenTypesAndParents.forEach((tokType) => {\n    tokType.isParent = tokType.categoryMatches!.length > 0;\n  });\n}\n\nexport function expandCategories(tokenTypes: TokenType[]): TokenType[] {\n  let result = [...tokenTypes];\n\n  let categories = tokenTypes;\n  let searching = true;\n  while (searching) {\n    categories = categories\n      .map((currTokType) => currTokType.CATEGORIES)\n      .flat()\n      .filter(Boolean) as TokenType[];\n\n    const newCategories = categories.filter((x) => !result.includes(x));\n\n    result = result.concat(newCategories);\n\n    if (newCategories.length === 0) {\n      searching = false;\n    } else {\n      categories = newCategories;\n    }\n  }\n  return result;\n}\n\nexport function assignTokenDefaultProps(tokenTypes: TokenType[]): void {\n  tokenTypes.forEach((currTokType) => {\n    if (!hasShortKeyProperty(currTokType)) {\n      tokenIdxToClass[tokenShortNameIdx] = currTokType;\n      (<any>currTokType).tokenTypeIdx = tokenShortNameIdx++;\n    }\n\n    // CATEGORIES? : TokenType | TokenType[]\n    if (\n      hasCategoriesProperty(currTokType) &&\n      !Array.isArray(currTokType.CATEGORIES)\n      // &&\n      // !isUndefined(currTokType.CATEGORIES.PATTERN)\n    ) {\n      currTokType.CATEGORIES = [currTokType.CATEGORIES as unknown as TokenType];\n    }\n\n    if (!hasCategoriesProperty(currTokType)) {\n      currTokType.CATEGORIES = [];\n    }\n\n    if (!hasExtendingTokensTypesProperty(currTokType)) {\n      currTokType.categoryMatches = [];\n    }\n\n    if (!hasExtendingTokensTypesMapProperty(currTokType)) {\n      currTokType.categoryMatchesMap = {};\n    }\n  });\n}\n\nexport function assignCategoriesTokensProp(tokenTypes: TokenType[]): void {\n  tokenTypes.forEach((currTokType) => {\n    // avoid duplications\n    currTokType.categoryMatches = [];\n    Object.keys(currTokType.categoryMatchesMap!).forEach((key) => {\n      currTokType.categoryMatches!.push(\n        tokenIdxToClass[key as unknown as number].tokenTypeIdx!,\n      );\n    });\n  });\n}\n\nexport function assignCategoriesMapProp(tokenTypes: TokenType[]): void {\n  tokenTypes.forEach((currTokType) => {\n    singleAssignCategoriesToksMap([], currTokType);\n  });\n}\n\nexport function singleAssignCategoriesToksMap(\n  path: TokenType[],\n  nextNode: TokenType,\n): void {\n  path.forEach((pathNode) => {\n    nextNode.categoryMatchesMap![pathNode.tokenTypeIdx!] = true;\n  });\n\n  nextNode.CATEGORIES!.forEach((nextCategory) => {\n    const newPath = path.concat(nextNode);\n    // avoids infinite loops due to cyclic categories.\n    if (!newPath.includes(nextCategory)) {\n      singleAssignCategoriesToksMap(newPath, nextCategory);\n    }\n  });\n}\n\nexport function hasShortKeyProperty(tokType: TokenType): boolean {\n  return Object.hasOwn(tokType ?? {}, \"tokenTypeIdx\");\n}\n\nexport function hasCategoriesProperty(tokType: TokenType): boolean {\n  return Object.hasOwn(tokType ?? {}, \"CATEGORIES\");\n}\n\nexport function hasExtendingTokensTypesProperty(tokType: TokenType): boolean {\n  return Object.hasOwn(tokType ?? {}, \"categoryMatches\");\n}\n\nexport function hasExtendingTokensTypesMapProperty(\n  tokType: TokenType,\n): boolean {\n  return Object.hasOwn(tokType ?? {}, \"categoryMatchesMap\");\n}\n\nexport function isTokenType(tokType: TokenType): boolean {\n  return Object.hasOwn(tokType ?? {}, \"tokenTypeIdx\");\n}\n", "import { ILexerErrorMessageProvider, IToken } from \"@chevrotain/types\";\n\nexport const defaultLexerErrorProvider: ILexerErrorMessageProvider = {\n  buildUnableToPopLexerModeMessage(token: IToken): string {\n    return `Unable to pop Lexer Mode after encountering Token ->${token.image}<- The Mode Stack is empty`;\n  },\n\n  buildUnexpectedCharactersMessage(\n    fullText: string,\n    startOffset: number,\n    length: number,\n    line?: number,\n    column?: number,\n    mode?: string,\n  ): string {\n    return (\n      `unexpected character: ->${fullText.charAt(\n        startOffset,\n      )}<- at offset: ${startOffset},` + ` skipped ${length} characters.`\n    );\n  },\n};\n", "import {\n  analyzeTokenTypes,\n  charCodeToOptimizedIndex,\n  cloneEmptyGroups,\n  DEFAULT_MODE,\n  IAnalyzeResult,\n  IPatternConfig,\n  LineTerminatorOptimizedTester,\n  performRuntimeChecks,\n  performWarningRuntimeChecks,\n  validatePatterns,\n} from \"./lexer.js\";\nimport { PRINT_WARNING, timer, toFastProperties } from \"@chevrotain/utils\";\nimport { augmentTokenTypes } from \"./tokens.js\";\nimport {\n  CustomPatternMatcherFunc,\n  CustomPatternMatcherReturn,\n  ILexerConfig,\n  ILexerDefinitionError,\n  ILexingError,\n  IMultiModeLexerDefinition,\n  IToken,\n  TokenType,\n} from \"@chevrotain/types\";\nimport { defaultLexerErrorProvider } from \"./lexer_errors_public.js\";\nimport { clearRegExpParserCache } from \"./reg_exp_parser.js\";\n\nexport interface ILexingResult {\n  tokens: IToken[];\n  groups: { [groupName: string]: IToken[] };\n  errors: ILexingError[];\n}\n\nexport enum LexerDefinitionErrorType {\n  MISSING_PATTERN,\n  INVALID_PATTERN,\n  EOI_ANCHOR_FOUND,\n  UNSUPPORTED_FLAGS_FOUND,\n  DUPLICATE_PATTERNS_FOUND,\n  INVALID_GROUP_TYPE_FOUND,\n  PUSH_MODE_DOES_NOT_EXIST,\n  MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE,\n  MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY,\n  MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST,\n  LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED,\n  SOI_ANCHOR_FOUND,\n  EMPTY_MATCH_PATTERN,\n  NO_LINE_BREAKS_FLAGS,\n  UNREACHABLE_PATTERN,\n  IDENTIFY_TERMINATOR,\n  CUSTOM_LINE_BREAK,\n  MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE,\n}\n\nexport interface IRegExpExec {\n  exec: CustomPatternMatcherFunc;\n}\n\nconst DEFAULT_LEXER_CONFIG: Required<ILexerConfig> = {\n  deferDefinitionErrorsHandling: false,\n  positionTracking: \"full\",\n  lineTerminatorsPattern: /\\n|\\r\\n?/g,\n  lineTerminatorCharacters: [\"\\n\", \"\\r\"],\n  ensureOptimizations: false,\n  safeMode: false,\n  errorMessageProvider: defaultLexerErrorProvider,\n  traceInitPerf: false,\n  skipValidations: false,\n  recoveryEnabled: true,\n};\n\nObject.freeze(DEFAULT_LEXER_CONFIG);\n\nexport class Lexer {\n  public static SKIPPED =\n    \"This marks a skipped Token pattern, this means each token identified by it will \" +\n    \"be consumed and then thrown into oblivion, this can be used to for example to completely ignore whitespace.\";\n\n  public static NA = /NOT_APPLICABLE/;\n  public lexerDefinitionErrors: ILexerDefinitionError[] = [];\n  public lexerDefinitionWarning: ILexerDefinitionError[] = [];\n\n  protected patternIdxToConfig: Record<string, IPatternConfig[]> = {};\n  protected charCodeToPatternIdxToConfig: {\n    [modeName: string]: { [charCode: number]: IPatternConfig[] };\n  } = {};\n\n  protected modes: string[] = [];\n  protected defaultMode!: string;\n  protected emptyGroups: { [groupName: string]: IToken } = {};\n\n  private config: Required<ILexerConfig>;\n  private trackStartLines: boolean = true;\n  private trackEndLines: boolean = true;\n  private hasCustom: boolean = false;\n  private canModeBeOptimized: Record<string, boolean> = {};\n\n  private traceInitPerf!: boolean | number;\n  private traceInitMaxIdent!: number;\n  private traceInitIndent: number;\n\n  constructor(\n    protected lexerDefinition: TokenType[] | IMultiModeLexerDefinition,\n    config: ILexerConfig = DEFAULT_LEXER_CONFIG,\n  ) {\n    if (typeof config === \"boolean\") {\n      throw Error(\n        \"The second argument to the Lexer constructor is now an ILexerConfig Object.\\n\" +\n          \"a boolean 2nd argument is no longer supported\",\n      );\n    }\n\n    this.config = Object.assign({}, DEFAULT_LEXER_CONFIG, config) as any;\n\n    const traceInitVal = this.config.traceInitPerf;\n    if (traceInitVal === true) {\n      this.traceInitMaxIdent = Infinity;\n      this.traceInitPerf = true;\n    } else if (typeof traceInitVal === \"number\") {\n      this.traceInitMaxIdent = traceInitVal;\n      this.traceInitPerf = true;\n    }\n    this.traceInitIndent = -1;\n\n    this.TRACE_INIT(\"Lexer Constructor\", () => {\n      let actualDefinition!: IMultiModeLexerDefinition;\n      let hasOnlySingleMode = true;\n      this.TRACE_INIT(\"Lexer Config handling\", () => {\n        if (\n          this.config.lineTerminatorsPattern ===\n          DEFAULT_LEXER_CONFIG.lineTerminatorsPattern\n        ) {\n          // optimized built-in implementation for the defaults definition of lineTerminators\n          this.config.lineTerminatorsPattern = LineTerminatorOptimizedTester;\n        } else {\n          if (\n            this.config.lineTerminatorCharacters ===\n            DEFAULT_LEXER_CONFIG.lineTerminatorCharacters\n          ) {\n            throw Error(\n              \"Error: Missing <lineTerminatorCharacters> property on the Lexer config.\\n\" +\n                \"\\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS\",\n            );\n          }\n        }\n\n        if (config.safeMode && config.ensureOptimizations) {\n          throw Error(\n            '\"safeMode\" and \"ensureOptimizations\" flags are mutually exclusive.',\n          );\n        }\n\n        this.trackStartLines = /full|onlyStart/i.test(\n          this.config.positionTracking,\n        );\n        this.trackEndLines = /full/i.test(this.config.positionTracking);\n\n        // Convert SingleModeLexerDefinition into a IMultiModeLexerDefinition.\n        if (Array.isArray(lexerDefinition)) {\n          actualDefinition = {\n            modes: { defaultMode: [...lexerDefinition] },\n            defaultMode: DEFAULT_MODE,\n          };\n        } else {\n          // no conversion needed, input should already be a IMultiModeLexerDefinition\n          hasOnlySingleMode = false;\n          actualDefinition = {\n            ...(<IMultiModeLexerDefinition>lexerDefinition),\n          };\n        }\n      });\n\n      if (this.config.skipValidations === false) {\n        this.TRACE_INIT(\"performRuntimeChecks\", () => {\n          this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(\n            performRuntimeChecks(\n              actualDefinition,\n              this.trackStartLines,\n              this.config.lineTerminatorCharacters,\n            ),\n          );\n        });\n\n        this.TRACE_INIT(\"performWarningRuntimeChecks\", () => {\n          this.lexerDefinitionWarning = this.lexerDefinitionWarning.concat(\n            performWarningRuntimeChecks(\n              actualDefinition,\n              this.trackStartLines,\n              this.config.lineTerminatorCharacters,\n            ),\n          );\n        });\n      }\n\n      // for extra robustness to avoid throwing a none informative error message\n      actualDefinition.modes = actualDefinition.modes\n        ? actualDefinition.modes\n        : {};\n\n      // an error of undefined TokenTypes will be detected in \"performRuntimeChecks\" above.\n      // this transformation is to increase robustness in the case of partially invalid lexer definition.\n      Object.entries(actualDefinition.modes).forEach(\n        ([currModeName, currModeValue]) => {\n          actualDefinition.modes[currModeName] = currModeValue.filter(\n            (currTokType: TokenType) => currTokType !== undefined,\n          );\n        },\n      );\n\n      const allModeNames = Object.keys(actualDefinition.modes);\n\n      Object.entries(actualDefinition.modes).forEach(\n        ([currModName, currModDef]: [string, TokenType[]]) => {\n          this.TRACE_INIT(`Mode: <${currModName}> processing`, () => {\n            this.modes.push(currModName);\n\n            if (this.config.skipValidations === false) {\n              this.TRACE_INIT(`validatePatterns`, () => {\n                this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(\n                  validatePatterns(currModDef, allModeNames),\n                );\n              });\n            }\n\n            // If definition errors were encountered, the analysis phase may fail unexpectedly/\n            // Considering a lexer with definition errors may never be used, there is no point\n            // to performing the analysis anyhow...\n            if (this.lexerDefinitionErrors.length === 0) {\n              augmentTokenTypes(currModDef);\n\n              let currAnalyzeResult!: IAnalyzeResult;\n              this.TRACE_INIT(`analyzeTokenTypes`, () => {\n                currAnalyzeResult = analyzeTokenTypes(currModDef, {\n                  lineTerminatorCharacters:\n                    this.config.lineTerminatorCharacters,\n                  positionTracking: config.positionTracking,\n                  ensureOptimizations: config.ensureOptimizations,\n                  safeMode: config.safeMode,\n                  tracer: this.TRACE_INIT,\n                });\n              });\n\n              this.patternIdxToConfig[currModName] =\n                currAnalyzeResult.patternIdxToConfig;\n\n              this.charCodeToPatternIdxToConfig[currModName] =\n                currAnalyzeResult.charCodeToPatternIdxToConfig;\n\n              this.emptyGroups = Object.assign(\n                {},\n                this.emptyGroups,\n                currAnalyzeResult.emptyGroups,\n              ) as any;\n\n              this.hasCustom = currAnalyzeResult.hasCustom || this.hasCustom;\n\n              this.canModeBeOptimized[currModName] =\n                currAnalyzeResult.canBeOptimized;\n            }\n          });\n        },\n      );\n\n      this.defaultMode = actualDefinition.defaultMode;\n\n      if (\n        this.lexerDefinitionErrors.length > 0 &&\n        !this.config.deferDefinitionErrorsHandling\n      ) {\n        const allErrMessages = this.lexerDefinitionErrors.map((error) => {\n          return error.message;\n        });\n        const allErrMessagesString = allErrMessages.join(\n          \"-----------------------\\n\",\n        );\n        throw new Error(\n          \"Errors detected in definition of Lexer:\\n\" + allErrMessagesString,\n        );\n      }\n\n      // Only print warning if there are no errors, This will avoid pl\n      this.lexerDefinitionWarning.forEach((warningDescriptor) => {\n        PRINT_WARNING(warningDescriptor.message);\n      });\n\n      this.TRACE_INIT(\"Choosing sub-methods implementations\", () => {\n        // Choose the relevant internal implementations for this specific parser.\n        // These implementations should be in-lined by the JavaScript engine\n        // to provide optimal performance in each scenario.\n\n        if (hasOnlySingleMode) {\n          this.handleModes = () => {};\n        }\n\n        if (this.trackStartLines === false) {\n          this.computeNewColumn = (x: any) => x;\n        }\n\n        if (this.trackEndLines === false) {\n          this.updateTokenEndLineColumnLocation = () => {};\n        }\n\n        if (/full/i.test(this.config.positionTracking)) {\n          this.createTokenInstance = this.createFullToken;\n        } else if (/onlyStart/i.test(this.config.positionTracking)) {\n          this.createTokenInstance = this.createStartOnlyToken;\n        } else if (/onlyOffset/i.test(this.config.positionTracking)) {\n          this.createTokenInstance = this.createOffsetOnlyToken;\n        } else {\n          throw Error(\n            `Invalid <positionTracking> config option: \"${this.config.positionTracking}\"`,\n          );\n        }\n\n        if (this.hasCustom) {\n          this.addToken = this.addTokenUsingPush;\n          this.handlePayload = this.handlePayloadWithCustom;\n        } else {\n          this.addToken = this.addTokenUsingMemberAccess;\n          this.handlePayload = this.handlePayloadNoCustom;\n        }\n      });\n\n      this.TRACE_INIT(\"Failed Optimization Warnings\", () => {\n        const unOptimizedModes = Object.entries(this.canModeBeOptimized).reduce(\n          (cannotBeOptimized, [modeName, canBeOptimized]) => {\n            if (canBeOptimized === false) {\n              cannotBeOptimized.push(modeName);\n            }\n            return cannotBeOptimized;\n          },\n          [] as string[],\n        );\n\n        if (config.ensureOptimizations && unOptimizedModes.length > 0) {\n          throw Error(\n            `Lexer Modes: < ${unOptimizedModes.join(\n              \", \",\n            )} > cannot be optimized.\\n` +\n              '\\t Disable the \"ensureOptimizations\" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.\\n' +\n              \"\\t Or inspect the console log for details on how to resolve these issues.\",\n          );\n        }\n      });\n\n      this.TRACE_INIT(\"clearRegExpParserCache\", () => {\n        clearRegExpParserCache();\n      });\n\n      this.TRACE_INIT(\"toFastProperties\", () => {\n        toFastProperties(this);\n      });\n    });\n  }\n\n  public tokenize(\n    text: string,\n    initialMode: string = this.defaultMode,\n  ): ILexingResult {\n    if (this.lexerDefinitionErrors.length > 0) {\n      const allErrMessages = this.lexerDefinitionErrors.map((error) => {\n        return error.message;\n      });\n      const allErrMessagesString = allErrMessages.join(\n        \"-----------------------\\n\",\n      );\n      throw new Error(\n        \"Unable to Tokenize because Errors detected in definition of Lexer:\\n\" +\n          allErrMessagesString,\n      );\n    }\n\n    return this.tokenizeInternal(text, initialMode);\n  }\n\n  // There is quite a bit of duplication between this and \"tokenizeInternalLazy\"\n  // This is intentional due to performance considerations.\n  // this method also used quite a bit of `!` none null assertions because it is too optimized\n  // for `tsc` to always understand it is \"safe\"\n  private tokenizeInternal(text: string, initialMode: string): ILexingResult {\n    let i,\n      j,\n      k,\n      matchAltImage,\n      longerAlt,\n      matchedImage: string | null,\n      payload,\n      altPayload,\n      imageLength,\n      group,\n      tokType,\n      newToken: IToken,\n      errLength,\n      msg,\n      match;\n    const orgText = text;\n    const orgLength = orgText.length;\n    let offset = 0;\n    let matchedTokensIndex = 0;\n    // initializing the tokensArray to the \"guessed\" size.\n    // guessing too little will still reduce the number of array re-sizes on pushes.\n    // guessing too large (Tested by guessing x4 too large) may cost a bit more of memory\n    // but would still have a faster runtime by avoiding (All but one) array resizing.\n    const guessedNumberOfTokens = this.hasCustom\n      ? 0 // will break custom token pattern APIs the matchedTokens array will contain undefined elements.\n      : Math.floor(text.length / 10);\n    const matchedTokens = new Array(guessedNumberOfTokens);\n    const errors: ILexingError[] = [];\n    let line = this.trackStartLines ? 1 : undefined;\n    let column = this.trackStartLines ? 1 : undefined;\n    const groups: any = cloneEmptyGroups(this.emptyGroups);\n    const trackLines = this.trackStartLines;\n    const lineTerminatorPattern = this.config.lineTerminatorsPattern;\n\n    let currModePatternsLength = 0;\n    let patternIdxToConfig: IPatternConfig[] = [];\n    let currCharCodeToPatternIdxToConfig: {\n      [charCode: number]: IPatternConfig[];\n    } = [];\n\n    const modeStack: string[] = [];\n\n    const emptyArray: IPatternConfig[] = [];\n    Object.freeze(emptyArray);\n    let isOptimizedMode = false;\n\n    const pop_mode = (popToken: IToken) => {\n      // TODO: perhaps avoid this error in the edge case there is no more input?\n      if (\n        modeStack.length === 1 &&\n        // if we have both a POP_MODE and a PUSH_MODE this is in-fact a \"transition\"\n        // So no error should occur.\n        popToken.tokenType.PUSH_MODE === undefined\n      ) {\n        // if we try to pop the last mode there lexer will no longer have ANY mode.\n        // thus the pop is ignored, an error will be created and the lexer will continue parsing in the previous mode.\n        const msg =\n          this.config.errorMessageProvider.buildUnableToPopLexerModeMessage(\n            popToken,\n          );\n\n        errors.push({\n          offset: popToken.startOffset,\n          line: popToken.startLine,\n          column: popToken.startColumn,\n          length: popToken.image.length,\n          message: msg,\n        });\n      } else {\n        modeStack.pop();\n        const newMode = modeStack.at(-1)!;\n        patternIdxToConfig = this.patternIdxToConfig[newMode];\n        currCharCodeToPatternIdxToConfig =\n          this.charCodeToPatternIdxToConfig[newMode];\n        currModePatternsLength = patternIdxToConfig.length;\n        const modeCanBeOptimized =\n          this.canModeBeOptimized[newMode] && this.config.safeMode === false;\n\n        if (currCharCodeToPatternIdxToConfig && modeCanBeOptimized) {\n          isOptimizedMode = true;\n        } else {\n          isOptimizedMode = false;\n        }\n      }\n    };\n\n    function push_mode(this: Lexer, newMode: string) {\n      modeStack.push(newMode);\n      currCharCodeToPatternIdxToConfig =\n        this.charCodeToPatternIdxToConfig[newMode];\n\n      patternIdxToConfig = this.patternIdxToConfig[newMode];\n      currModePatternsLength = patternIdxToConfig.length;\n\n      currModePatternsLength = patternIdxToConfig.length;\n      const modeCanBeOptimized =\n        this.canModeBeOptimized[newMode] && this.config.safeMode === false;\n\n      if (currCharCodeToPatternIdxToConfig && modeCanBeOptimized) {\n        isOptimizedMode = true;\n      } else {\n        isOptimizedMode = false;\n      }\n    }\n\n    // this pattern seems to avoid a V8 de-optimization, although that de-optimization does not\n    // seem to matter performance wise.\n    push_mode.call(this, initialMode);\n\n    let currConfig!: IPatternConfig;\n\n    const recoveryEnabled = this.config.recoveryEnabled;\n\n    while (offset < orgLength) {\n      matchedImage = null;\n      imageLength = -1;\n\n      const nextCharCode = orgText.charCodeAt(offset);\n      let chosenPatternIdxToConfig: IPatternConfig[];\n      if (isOptimizedMode) {\n        const optimizedCharIdx = charCodeToOptimizedIndex(nextCharCode);\n        const possiblePatterns =\n          currCharCodeToPatternIdxToConfig[optimizedCharIdx];\n        chosenPatternIdxToConfig =\n          possiblePatterns !== undefined ? possiblePatterns : emptyArray;\n      } else {\n        chosenPatternIdxToConfig = patternIdxToConfig;\n      }\n      const chosenPatternsLength = chosenPatternIdxToConfig.length;\n\n      for (i = 0; i < chosenPatternsLength; i++) {\n        currConfig = chosenPatternIdxToConfig[i];\n        const currPattern = currConfig.pattern;\n        payload = null;\n\n        // manually in-lined because > 600 chars won't be in-lined in V8\n        const singleCharCode = currConfig.short;\n        if (singleCharCode !== false) {\n          if (nextCharCode === singleCharCode) {\n            // single character string\n            imageLength = 1;\n            matchedImage = currPattern as string;\n          }\n        } else if (currConfig.isCustom === true) {\n          match = (currPattern as IRegExpExec).exec(\n            orgText,\n            offset,\n            matchedTokens,\n            groups,\n          );\n          if (match !== null) {\n            matchedImage = match[0];\n            imageLength = matchedImage.length;\n            if ((match as CustomPatternMatcherReturn).payload !== undefined) {\n              payload = (match as CustomPatternMatcherReturn).payload;\n            }\n          } else {\n            matchedImage = null;\n          }\n        } else {\n          (currPattern as RegExp).lastIndex = offset;\n          imageLength = this.matchLength(currPattern as RegExp, text, offset);\n        }\n\n        // longer alts handling\n        if (imageLength !== -1) {\n          // even though this pattern matched we must try a another longer alternative.\n          // this can be used to prioritize keywords over identifiers\n          longerAlt = currConfig.longerAlt;\n          if (longerAlt !== undefined) {\n            matchedImage = text.substring(offset, offset + imageLength);\n            const longerAltLength = longerAlt.length;\n            for (k = 0; k < longerAltLength; k++) {\n              const longerAltConfig = patternIdxToConfig[longerAlt[k]];\n              const longerAltPattern = longerAltConfig.pattern;\n              altPayload = null;\n\n              // single Char can never be a longer alt so no need to test it.\n              // manually in-lined because > 600 chars won't be in-lined in V8\n              if (longerAltConfig.isCustom === true) {\n                match = (longerAltPattern as IRegExpExec).exec(\n                  orgText,\n                  offset,\n                  matchedTokens,\n                  groups,\n                );\n                if (match !== null) {\n                  matchAltImage = match[0];\n                  if (\n                    (match as CustomPatternMatcherReturn).payload !== undefined\n                  ) {\n                    altPayload = (match as CustomPatternMatcherReturn).payload;\n                  }\n                } else {\n                  matchAltImage = null;\n                }\n              } else {\n                (longerAltPattern as RegExp).lastIndex = offset;\n                matchAltImage = this.match(\n                  longerAltPattern as RegExp,\n                  text,\n                  offset,\n                );\n              }\n\n              if (matchAltImage && matchAltImage.length > matchedImage.length) {\n                matchedImage = matchAltImage;\n                imageLength = matchAltImage.length;\n                payload = altPayload;\n                currConfig = longerAltConfig;\n                // Exit the loop early after matching one of the longer alternatives\n                // The first matched alternative takes precedence\n                break;\n              }\n            }\n          }\n          break;\n        }\n      }\n\n      // successful match\n      if (imageLength !== -1) {\n        group = currConfig.group;\n        if (group !== undefined) {\n          matchedImage =\n            matchedImage !== null\n              ? matchedImage // for custom Tokens we will already have the `matchedImage`\n              : text.substring(offset, offset + imageLength);\n          tokType = currConfig.tokenTypeIdx;\n          newToken = this.createTokenInstance(\n            matchedImage,\n            offset,\n            tokType,\n            currConfig.tokenType,\n            line,\n            column,\n            imageLength,\n          );\n\n          this.handlePayload(newToken, payload);\n\n          if (group === false) {\n            matchedTokensIndex = this.addToken(\n              matchedTokens,\n              matchedTokensIndex,\n              newToken,\n            );\n          } else {\n            groups[group].push(newToken);\n          }\n        }\n\n        // line terminator handling\n        if (trackLines === true && currConfig.canLineTerminator === true) {\n          let numOfLTsInMatch = 0;\n          let foundTerminator;\n          let lastLTEndOffset: number;\n          lineTerminatorPattern.lastIndex = 0;\n          do {\n            // only for skipped tokens the matchedImage may be null at this point\n            matchedImage =\n              matchedImage !== null\n                ? matchedImage\n                : text.substring(offset, offset + imageLength);\n            foundTerminator = lineTerminatorPattern.test(matchedImage);\n            if (foundTerminator === true) {\n              lastLTEndOffset = lineTerminatorPattern.lastIndex - 1;\n              numOfLTsInMatch++;\n            }\n          } while (foundTerminator === true);\n\n          if (numOfLTsInMatch !== 0) {\n            line = line! + numOfLTsInMatch;\n            column = imageLength - lastLTEndOffset!;\n            this.updateTokenEndLineColumnLocation(\n              newToken!,\n              group!,\n              lastLTEndOffset!,\n              numOfLTsInMatch,\n              line,\n              column,\n              imageLength,\n            );\n          } else {\n            column = this.computeNewColumn(column!, imageLength);\n          }\n        } else {\n          column = this.computeNewColumn(column!, imageLength);\n        }\n\n        offset = offset + imageLength;\n\n        // will be NOOP if no modes present\n        this.handleModes(currConfig, pop_mode, push_mode, newToken!);\n      } else {\n        // error recovery, drop characters until we identify a valid token's start point\n        const errorStartOffset = offset;\n        const errorLine = line;\n        const errorColumn = column;\n        let foundResyncPoint = recoveryEnabled === false;\n\n        while (foundResyncPoint === false && offset < orgLength) {\n          offset++;\n          for (j = 0; j < currModePatternsLength; j++) {\n            const currConfig = patternIdxToConfig[j];\n            const currPattern = currConfig.pattern;\n\n            // manually in-lined because > 600 chars won't be in-lined in V8\n            const singleCharCode = currConfig.short;\n            if (singleCharCode !== false) {\n              if (orgText.charCodeAt(offset) === singleCharCode) {\n                // single character string\n                foundResyncPoint = true;\n              }\n            } else if (currConfig.isCustom === true) {\n              foundResyncPoint =\n                (currPattern as IRegExpExec).exec(\n                  orgText,\n                  offset,\n                  matchedTokens,\n                  groups,\n                ) !== null;\n            } else {\n              (currPattern as RegExp).lastIndex = offset;\n              foundResyncPoint = (currPattern as RegExp).exec(text) !== null;\n            }\n\n            if (foundResyncPoint === true) {\n              break;\n            }\n          }\n        }\n\n        errLength = offset - errorStartOffset;\n        column = this.computeNewColumn(column!, errLength);\n        // at this point we either re-synced or reached the end of the input text\n        msg = this.config.errorMessageProvider.buildUnexpectedCharactersMessage(\n          orgText,\n          errorStartOffset,\n          errLength,\n          errorLine,\n          errorColumn,\n          modeStack.at(-1),\n        );\n        errors.push({\n          offset: errorStartOffset,\n          line: errorLine,\n          column: errorColumn,\n          length: errLength,\n          message: msg,\n        });\n\n        if (recoveryEnabled === false) {\n          break;\n        }\n      }\n    }\n\n    // if we do have custom patterns which push directly into the\n    // TODO: custom tokens should not push directly??\n    if (!this.hasCustom) {\n      // if we guessed a too large size for the tokens array this will shrink it to the right size.\n      matchedTokens.length = matchedTokensIndex;\n    }\n\n    return {\n      tokens: matchedTokens,\n      groups: groups,\n      errors: errors,\n    };\n  }\n\n  private handleModes(\n    config: IPatternConfig,\n    pop_mode: (tok: IToken) => void,\n    push_mode: (this: Lexer, pushMode: string) => void,\n    newToken: IToken,\n  ) {\n    if (config.pop === true) {\n      // need to save the PUSH_MODE property as if the mode is popped\n      // patternIdxToPopMode is updated to reflect the new mode after popping the stack\n      const pushMode = config.push;\n      pop_mode(newToken);\n      if (pushMode !== undefined) {\n        push_mode.call(this, pushMode);\n      }\n    } else if (config.push !== undefined) {\n      push_mode.call(this, config.push);\n    }\n  }\n\n  // TODO: decrease this under 600 characters? inspect stripping comments option in TSC compiler\n  private updateTokenEndLineColumnLocation(\n    newToken: IToken,\n    group: string | false,\n    lastLTIdx: number,\n    numOfLTsInMatch: number,\n    line: number,\n    column: number,\n    imageLength: number,\n  ): void {\n    let lastCharIsLT, fixForEndingInLT;\n    if (group !== undefined) {\n      // a none skipped multi line Token, need to update endLine/endColumn\n      lastCharIsLT = lastLTIdx === imageLength - 1;\n      fixForEndingInLT = lastCharIsLT ? -1 : 0;\n      if (!(numOfLTsInMatch === 1 && lastCharIsLT === true)) {\n        // if a token ends in a LT that last LT only affects the line numbering of following Tokens\n        newToken.endLine = line + fixForEndingInLT;\n        // the last LT in a token does not affect the endColumn either as the [columnStart ... columnEnd)\n        // inclusive to exclusive range.\n        newToken.endColumn = column - 1 + -fixForEndingInLT;\n      }\n      // else single LT in the last character of a token, no need to modify the endLine/EndColumn\n    }\n  }\n\n  private computeNewColumn(oldColumn: number, imageLength: number) {\n    return oldColumn + imageLength;\n  }\n\n  // Place holder, will be replaced by the correct variant according to the locationTracking option at runtime.\n  /* istanbul ignore next - place holder */\n  private createTokenInstance!: (...args: any[]) => IToken;\n\n  private createOffsetOnlyToken(\n    image: string,\n    startOffset: number,\n    tokenTypeIdx: number,\n    tokenType: TokenType,\n  ) {\n    return {\n      image,\n      startOffset,\n      tokenTypeIdx,\n      tokenType,\n    };\n  }\n\n  private createStartOnlyToken(\n    image: string,\n    startOffset: number,\n    tokenTypeIdx: number,\n    tokenType: TokenType,\n    startLine: number,\n    startColumn: number,\n  ) {\n    return {\n      image,\n      startOffset,\n      startLine,\n      startColumn,\n      tokenTypeIdx,\n      tokenType,\n    };\n  }\n\n  private createFullToken(\n    image: string,\n    startOffset: number,\n    tokenTypeIdx: number,\n    tokenType: TokenType,\n    startLine: number,\n    startColumn: number,\n    imageLength: number,\n  ): IToken {\n    return {\n      image,\n      startOffset,\n      endOffset: startOffset + imageLength - 1,\n      startLine,\n      endLine: startLine,\n      startColumn,\n      endColumn: startColumn + imageLength - 1,\n      tokenTypeIdx,\n      tokenType,\n    };\n  }\n\n  // Place holder, will be replaced by the correct variant according to the locationTracking option at runtime.\n  /* istanbul ignore next - place holder */\n  private addToken!: (\n    tokenVector: IToken[],\n    index: number,\n    tokenToAdd: IToken,\n  ) => number;\n\n  private addTokenUsingPush(\n    tokenVector: IToken[],\n    index: number,\n    tokenToAdd: IToken,\n  ): number {\n    tokenVector.push(tokenToAdd);\n    return index;\n  }\n\n  private addTokenUsingMemberAccess(\n    tokenVector: IToken[],\n    index: number,\n    tokenToAdd: IToken,\n  ): number {\n    tokenVector[index] = tokenToAdd;\n    index++;\n    return index;\n  }\n\n  // Place holder, will be replaced by the correct variant according to the hasCustom flag option at runtime.\n  private handlePayload: (token: IToken, payload: any) => void;\n\n  private handlePayloadNoCustom(token: IToken, payload: any): void {}\n\n  private handlePayloadWithCustom(token: IToken, payload: any): void {\n    if (payload !== null) {\n      token.payload = payload;\n    }\n  }\n\n  private match(pattern: RegExp, text: string, offset: number): string | null {\n    const found = pattern.test(text);\n    if (found === true) {\n      return text.substring(offset, pattern.lastIndex);\n    }\n    return null;\n  }\n\n  private matchLength(\n    pattern: RegExp,\n    text: string,\n    offset: number,\n  ): number | -1 {\n    const found = pattern.test(text);\n    if (found === true) {\n      return pattern.lastIndex - offset;\n    }\n    return -1;\n  }\n\n  // Duplicated from the parser's perf trace trait to allow future extraction\n  // of the lexer to a separate package.\n  TRACE_INIT = <T>(phaseDesc: string, phaseImpl: () => T): T => {\n    // No need to optimize this using NOOP pattern because\n    // It is not called in a hot spot...\n    if (this.traceInitPerf === true) {\n      this.traceInitIndent++;\n      const indent = new Array(this.traceInitIndent + 1).join(\"\\t\");\n      if (this.traceInitIndent < this.traceInitMaxIdent) {\n        console.log(`${indent}--> <${phaseDesc}>`);\n      }\n      const { time, value } = timer(phaseImpl);\n      /* istanbul ignore next - Difficult to reproduce specific performance behavior (>10ms) in tests */\n      const traceMethod = time > 10 ? console.warn : console.log;\n      if (this.traceInitIndent < this.traceInitMaxIdent) {\n        traceMethod(`${indent}<-- <${phaseDesc}> time: ${time}ms`);\n      }\n      this.traceInitIndent--;\n      return value;\n    } else {\n      return phaseImpl();\n    }\n  };\n}\n", "import { Lexer } from \"./lexer_public.js\";\nimport { augmentTokenTypes, tokenStructuredMatcher } from \"./tokens.js\";\nimport { IToken, ITokenConfig, TokenType } from \"@chevrotain/types\";\n\nexport function tokenLabel(tokType: TokenType): string {\n  if (hasTokenLabel(tokType)) {\n    return tokType.LABEL;\n  } else {\n    return tokType.name;\n  }\n}\n\nexport function tokenName(tokType: TokenType): string {\n  return tokType.name;\n}\n\nexport function hasTokenLabel(\n  obj: TokenType,\n): obj is TokenType & Pick<Required<TokenType>, \"LABEL\"> {\n  return typeof obj.LABEL === \"string\" && obj.LABEL !== \"\";\n}\n\nconst PARENT = \"parent\";\nconst CATEGORIES = \"categories\";\nconst LABEL = \"label\";\nconst GROUP = \"group\";\nconst PUSH_MODE = \"push_mode\";\nconst POP_MODE = \"pop_mode\";\nconst LONGER_ALT = \"longer_alt\";\nconst LINE_BREAKS = \"line_breaks\";\nconst START_CHARS_HINT = \"start_chars_hint\";\n\nexport function createToken(config: ITokenConfig): TokenType {\n  return createTokenInternal(config);\n}\n\nfunction createTokenInternal(config: ITokenConfig): TokenType {\n  const pattern = config.pattern;\n\n  const tokenType: TokenType = <any>{};\n  tokenType.name = config.name;\n\n  if (pattern !== undefined) {\n    tokenType.PATTERN = pattern;\n  }\n\n  if (Object.hasOwn(config, PARENT)) {\n    throw (\n      \"The parent property is no longer supported.\\n\" +\n      \"See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.\"\n    );\n  }\n\n  if (Object.hasOwn(config, CATEGORIES)) {\n    // casting to ANY as this will be fixed inside `augmentTokenTypes``\n    tokenType.CATEGORIES = <any>config[CATEGORIES];\n  }\n\n  augmentTokenTypes([tokenType]);\n\n  if (Object.hasOwn(config, LABEL)) {\n    tokenType.LABEL = config[LABEL];\n  }\n\n  if (Object.hasOwn(config, GROUP)) {\n    tokenType.GROUP = config[GROUP];\n  }\n\n  if (Object.hasOwn(config, POP_MODE)) {\n    tokenType.POP_MODE = config[POP_MODE];\n  }\n\n  if (Object.hasOwn(config, PUSH_MODE)) {\n    tokenType.PUSH_MODE = config[PUSH_MODE];\n  }\n\n  if (Object.hasOwn(config, LONGER_ALT)) {\n    tokenType.LONGER_ALT = config[LONGER_ALT];\n  }\n\n  if (Object.hasOwn(config, LINE_BREAKS)) {\n    tokenType.LINE_BREAKS = config[LINE_BREAKS];\n  }\n\n  if (Object.hasOwn(config, START_CHARS_HINT)) {\n    tokenType.START_CHARS_HINT = config[START_CHARS_HINT];\n  }\n\n  return tokenType;\n}\n\nexport const EOF = createToken({ name: \"EOF\", pattern: Lexer.NA });\naugmentTokenTypes([EOF]);\n\nexport function createTokenInstance(\n  tokType: TokenType,\n  image: string,\n  startOffset: number,\n  endOffset: number,\n  startLine: number,\n  endLine: number,\n  startColumn: number,\n  endColumn: number,\n): IToken {\n  return {\n    image,\n    startOffset,\n    endOffset,\n    startLine,\n    endLine,\n    startColumn,\n    endColumn,\n    tokenTypeIdx: (<any>tokType).tokenTypeIdx,\n    tokenType: tokType,\n  };\n}\n\nexport function tokenMatcher(token: IToken, tokType: TokenType): boolean {\n  return tokenStructuredMatcher(token, tokType);\n}\n", "import { hasTokenLabel, tokenLabel } from \"../scan/tokens_public.js\";\nimport {\n  Alternation,\n  getProductionDslName,\n  NonTerminal,\n  Rule,\n  Terminal,\n} from \"@chevrotain/gast\";\nimport {\n  IParserErrorMessageProvider,\n  IProductionWithOccurrence,\n  TokenType,\n} from \"@chevrotain/types\";\nimport {\n  IGrammarResolverErrorMessageProvider,\n  IGrammarValidatorErrorMessageProvider,\n} from \"./grammar/types.js\";\n\nexport const defaultParserErrorProvider: IParserErrorMessageProvider = {\n  buildMismatchTokenMessage({ expected, actual, previous, ruleName }): string {\n    const hasLabel = hasTokenLabel(expected);\n    const expectedMsg = hasLabel\n      ? `--> ${tokenLabel(expected)} <--`\n      : `token of type --> ${expected.name} <--`;\n\n    const msg = `Expecting ${expectedMsg} but found --> '${actual.image}' <--`;\n\n    return msg;\n  },\n\n  buildNotAllInputParsedMessage({ firstRedundant, ruleName }): string {\n    return \"Redundant input, expecting EOF but found: \" + firstRedundant.image;\n  },\n\n  buildNoViableAltMessage({\n    expectedPathsPerAlt,\n    actual,\n    previous,\n    customUserDescription,\n    ruleName,\n  }): string {\n    const errPrefix = \"Expecting: \";\n    // TODO: issue: No Viable Alternative Error may have incomplete details. #502\n    const actualText = actual[0]!.image;\n    const errSuffix = \"\\nbut found: '\" + actualText + \"'\";\n\n    if (customUserDescription) {\n      return errPrefix + customUserDescription + errSuffix;\n    } else {\n      const allLookAheadPaths = expectedPathsPerAlt.reduce(\n        (result, currAltPaths) => result.concat(currAltPaths),\n        [] as TokenType[][],\n      );\n      const nextValidTokenSequences = allLookAheadPaths.map(\n        (currPath) =>\n          `[${currPath\n            .map((currTokenType) => tokenLabel(currTokenType))\n            .join(\", \")}]`,\n      );\n      const nextValidSequenceItems = nextValidTokenSequences.map(\n        (itemMsg, idx) => `  ${idx + 1}. ${itemMsg}`,\n      );\n      const calculatedDescription = `one of these possible Token sequences:\\n${nextValidSequenceItems.join(\n        \"\\n\",\n      )}`;\n\n      return errPrefix + calculatedDescription + errSuffix;\n    }\n  },\n\n  buildEarlyExitMessage({\n    expectedIterationPaths,\n    actual,\n    customUserDescription,\n    ruleName,\n  }): string {\n    const errPrefix = \"Expecting: \";\n    // TODO: issue: No Viable Alternative Error may have incomplete details. #502\n    const actualText = actual[0]!.image;\n    const errSuffix = \"\\nbut found: '\" + actualText + \"'\";\n\n    if (customUserDescription) {\n      return errPrefix + customUserDescription + errSuffix;\n    } else {\n      const nextValidTokenSequences = expectedIterationPaths.map(\n        (currPath) =>\n          `[${currPath\n            .map((currTokenType) => tokenLabel(currTokenType))\n            .join(\",\")}]`,\n      );\n      const calculatedDescription =\n        `expecting at least one iteration which starts with one of these possible Token sequences::\\n  ` +\n        `<${nextValidTokenSequences.join(\" ,\")}>`;\n\n      return errPrefix + calculatedDescription + errSuffix;\n    }\n  },\n};\n\nObject.freeze(defaultParserErrorProvider);\n\nexport const defaultGrammarResolverErrorProvider: IGrammarResolverErrorMessageProvider =\n  {\n    buildRuleNotFoundError(\n      topLevelRule: Rule,\n      undefinedRule: NonTerminal,\n    ): string {\n      const msg =\n        \"Invalid grammar, reference to a rule which is not defined: ->\" +\n        undefinedRule.nonTerminalName +\n        \"<-\\n\" +\n        \"inside top level rule: ->\" +\n        topLevelRule.name +\n        \"<-\";\n      return msg;\n    },\n  };\n\nexport const defaultGrammarValidatorErrorProvider: IGrammarValidatorErrorMessageProvider =\n  {\n    buildDuplicateFoundError(\n      topLevelRule: Rule,\n      duplicateProds: IProductionWithOccurrence[],\n    ): string {\n      function getExtraProductionArgument(\n        prod: IProductionWithOccurrence,\n      ): string {\n        if (prod instanceof Terminal) {\n          return prod.terminalType.name;\n        } else if (prod instanceof NonTerminal) {\n          return prod.nonTerminalName;\n        } else {\n          return \"\";\n        }\n      }\n\n      const topLevelName = topLevelRule.name;\n      const duplicateProd = duplicateProds[0]!;\n      const index = duplicateProd.idx;\n      const dslName = getProductionDslName(duplicateProd);\n      const extraArgument = getExtraProductionArgument(duplicateProd);\n\n      const hasExplicitIndex = index > 0;\n      let msg = `->${dslName}${hasExplicitIndex ? index : \"\"}<- ${\n        extraArgument ? `with argument: ->${extraArgument}<-` : \"\"\n      }\n                  appears more than once (${\n                    duplicateProds.length\n                  } times) in the top level rule: ->${topLevelName}<-.                  \n                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES \n                  `;\n\n      // white space trimming time! better to trim afterwards as it allows to use WELL formatted multi line template strings...\n      msg = msg.replace(/[ \\t]+/g, \" \");\n      msg = msg.replace(/\\s\\s+/g, \"\\n\");\n\n      return msg;\n    },\n\n    buildNamespaceConflictError(rule: Rule): string {\n      const errMsg =\n        `Namespace conflict found in grammar.\\n` +\n        `The grammar has both a Terminal(Token) and a Non-Terminal(Rule) named: <${rule.name}>.\\n` +\n        `To resolve this make sure each Terminal and Non-Terminal names are unique\\n` +\n        `This is easy to accomplish by using the convention that Terminal names start with an uppercase letter\\n` +\n        `and Non-Terminal names start with a lower case letter.`;\n\n      return errMsg;\n    },\n\n    buildAlternationPrefixAmbiguityError(options: {\n      topLevelRule: Rule;\n      prefixPath: TokenType[];\n      ambiguityIndices: number[];\n      alternation: Alternation;\n    }): string {\n      const pathMsg = options.prefixPath\n        .map((currTok) => tokenLabel(currTok))\n        .join(\", \");\n      const occurrence =\n        options.alternation.idx === 0 ? \"\" : options.alternation.idx;\n      const errMsg =\n        `Ambiguous alternatives: <${options.ambiguityIndices.join(\n          \" ,\",\n        )}> due to common lookahead prefix\\n` +\n        `in <OR${occurrence}> inside <${options.topLevelRule.name}> Rule,\\n` +\n        `<${pathMsg}> may appears as a prefix path in all these alternatives.\\n` +\n        `See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#COMMON_PREFIX\\n` +\n        `For Further details.`;\n\n      return errMsg;\n    },\n\n    buildAlternationAmbiguityError(options: {\n      topLevelRule: Rule;\n      prefixPath: TokenType[];\n      ambiguityIndices: number[];\n      alternation: Alternation;\n    }): string {\n      const occurrence =\n        options.alternation.idx === 0 ? \"\" : options.alternation.idx;\n\n      const isEmptyPath = options.prefixPath.length === 0;\n\n      let currMessage =\n        `Ambiguous Alternatives Detected: <${options.ambiguityIndices.join(\n          \" ,\",\n        )}> in <OR${occurrence}>` +\n        ` inside <${options.topLevelRule.name}> Rule,\\n`;\n\n      if (isEmptyPath) {\n        currMessage +=\n          `These alternatives are all empty (match no tokens), making them indistinguishable.\\n` +\n          `Only the last alternative may be empty.\\n`;\n      } else {\n        const pathMsg = options.prefixPath\n          .map((currtok) => tokenLabel(currtok))\n          .join(\", \");\n        currMessage += `<${pathMsg}> may appears as a prefix path in all these alternatives.\\n`;\n      }\n\n      currMessage +=\n        `See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\\n` +\n        `For Further details.`;\n      return currMessage;\n    },\n\n    buildEmptyRepetitionError(options: {\n      topLevelRule: Rule;\n      repetition: IProductionWithOccurrence;\n    }): string {\n      let dslName = getProductionDslName(options.repetition);\n      if (options.repetition.idx !== 0) {\n        dslName += options.repetition.idx;\n      }\n\n      const errMsg =\n        `The repetition <${dslName}> within Rule <${options.topLevelRule.name}> can never consume any tokens.\\n` +\n        `This could lead to an infinite loop.`;\n\n      return errMsg;\n    },\n\n    // TODO: remove - `errors_public` from nyc.config.js exclude\n    //       once this method is fully removed from this file\n    buildTokenNameError(options: {\n      tokenType: TokenType;\n      expectedPattern: RegExp;\n    }): string {\n      /* istanbul ignore next */\n      return \"deprecated\";\n    },\n\n    buildEmptyAlternationError(options: {\n      topLevelRule: Rule;\n      alternation: Alternation;\n      emptyChoiceIdx: number;\n    }): string {\n      const errMsg =\n        `Ambiguous empty alternative: <${options.emptyChoiceIdx + 1}>` +\n        ` in <OR${options.alternation.idx}> inside <${options.topLevelRule.name}> Rule.\\n` +\n        `Only the last alternative may be an empty alternative.`;\n\n      return errMsg;\n    },\n\n    buildTooManyAlternativesError(options: {\n      topLevelRule: Rule;\n      alternation: Alternation;\n    }): string {\n      const errMsg =\n        `An Alternation cannot have more than 256 alternatives:\\n` +\n        `<OR${options.alternation.idx}> inside <${\n          options.topLevelRule.name\n        }> Rule.\\n has ${\n          options.alternation.definition.length + 1\n        } alternatives.`;\n\n      return errMsg;\n    },\n\n    buildLeftRecursionError(options: {\n      topLevelRule: Rule;\n      leftRecursionPath: Rule[];\n    }): string {\n      const ruleName = options.topLevelRule.name;\n      const pathNames = options.leftRecursionPath.map(\n        (currRule) => currRule.name,\n      );\n      const leftRecursivePath = `${ruleName} --> ${pathNames\n        .concat([ruleName])\n        .join(\" --> \")}`;\n      const errMsg =\n        `Left Recursion found in grammar.\\n` +\n        `rule: <${ruleName}> can be invoked from itself (directly or indirectly)\\n` +\n        `without consuming any Tokens. The grammar path that causes this is: \\n ${leftRecursivePath}\\n` +\n        ` To fix this refactor your grammar to remove the left recursion.\\n` +\n        `see: https://en.wikipedia.org/wiki/LL_parser#Left_factoring.`;\n\n      return errMsg;\n    },\n\n    // TODO: remove - `errors_public` from nyc.config.js exclude\n    //       once this method is fully removed from this file\n    buildInvalidRuleNameError(options: {\n      topLevelRule: Rule;\n      expectedPattern: RegExp;\n    }): string {\n      /* istanbul ignore next */\n      return \"deprecated\";\n    },\n\n    buildDuplicateRuleNameError(options: {\n      topLevelRule: Rule | string;\n      grammarName: string;\n    }): string {\n      let ruleName;\n      if (options.topLevelRule instanceof Rule) {\n        ruleName = options.topLevelRule.name;\n      } else {\n        ruleName = options.topLevelRule;\n      }\n\n      const errMsg = `Duplicate definition, rule: ->${ruleName}<- is already defined in the grammar: ->${options.grammarName}<-`;\n\n      return errMsg;\n    },\n  };\n", "import {\n  IParserUnresolvedRefDefinitionError,\n  ParserDefinitionErrorType,\n} from \"../parser/parser.js\";\nimport { GAstVisitor, NonTerminal, Rule } from \"@chevrotain/gast\";\nimport {\n  IGrammarResolverErrorMessageProvider,\n  IParserDefinitionError,\n} from \"./types.js\";\n\nexport function resolveGrammar(\n  topLevels: Record<string, Rule>,\n  errMsgProvider: IGrammarResolverErrorMessageProvider,\n): IParserDefinitionError[] {\n  const refResolver = new GastRefResolverVisitor(topLevels, errMsgProvider);\n  refResolver.resolveRefs();\n  return refResolver.errors;\n}\n\nexport class GastRefResolverVisitor extends GAstVisitor {\n  public errors: IParserUnresolvedRefDefinitionError[] = [];\n  private currTopLevel: Rule;\n\n  constructor(\n    private nameToTopRule: Record<string, Rule>,\n    private errMsgProvider: IGrammarResolverErrorMessageProvider,\n  ) {\n    super();\n  }\n\n  public resolveRefs(): void {\n    Object.values(this.nameToTopRule).forEach((prod) => {\n      this.currTopLevel = prod;\n      prod.accept(this);\n    });\n  }\n\n  public visitNonTerminal(node: NonTerminal): void {\n    const ref = this.nameToTopRule[node.nonTerminalName];\n\n    if (!ref) {\n      const msg = this.errMsgProvider.buildRuleNotFoundError(\n        this.currTopLevel,\n        node,\n      );\n      this.errors.push({\n        message: msg,\n        type: ParserDefinitionErrorType.UNRESOLVED_SUBRULE_REF,\n        ruleName: this.currTopLevel.name,\n        unresolvedRefName: node.nonTerminalName,\n      });\n    } else {\n      node.referencedRule = ref;\n    }\n  }\n}\n", "import { first } from \"./first.js\";\nimport { RestWalker } from \"./rest.js\";\nimport { TokenMatcher } from \"../parser/parser.js\";\nimport {\n  Alternation,\n  Alternative,\n  NonTerminal,\n  Option,\n  Repetition,\n  RepetitionMandatory,\n  RepetitionMandatoryWithSeparator,\n  RepetitionWithSeparator,\n  Rule,\n  Terminal,\n} from \"@chevrotain/gast\";\nimport {\n  IGrammarPath,\n  IProduction,\n  IToken,\n  ITokenGrammarPath,\n  TokenType,\n} from \"@chevrotain/types\";\n\nexport interface INextTokenPath extends IGrammarPath {\n  nextTokenType: TokenType;\n  nextTokenOccurrence: number;\n}\n\nexport abstract class AbstractNextPossibleTokensWalker extends RestWalker {\n  protected possibleTokTypes: TokenType[] = [];\n  protected ruleStack: string[];\n  protected occurrenceStack: number[];\n\n  protected nextProductionName = \"\";\n  protected nextProductionOccurrence = 0;\n  protected found = false;\n  protected isAtEndOfPath = false;\n\n  constructor(\n    protected topProd: Rule,\n    protected path: IGrammarPath,\n  ) {\n    super();\n  }\n\n  startWalking(): TokenType[] {\n    this.found = false;\n\n    if (this.path.ruleStack[0] !== this.topProd.name) {\n      throw Error(\"The path does not start with the walker's top Rule!\");\n    }\n\n    // immutable for the win\n    this.ruleStack = [...this.path.ruleStack].reverse(); // intelij bug requires assertion\n    this.occurrenceStack = [...this.path.occurrenceStack].reverse(); // intelij bug requires assertion\n\n    // already verified that the first production is valid, we now seek the 2nd production\n    this.ruleStack.pop();\n    this.occurrenceStack.pop();\n\n    this.updateExpectedNext();\n    this.walk(this.topProd);\n\n    return this.possibleTokTypes;\n  }\n\n  walk(\n    prod: { definition: IProduction[] },\n    prevRest: IProduction[] = [],\n  ): void {\n    // stop scanning once we found the path\n    if (!this.found) {\n      super.walk(prod, prevRest);\n    }\n  }\n\n  walkProdRef(\n    refProd: NonTerminal,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    // found the next production, need to keep walking in it\n    if (\n      refProd.referencedRule.name === this.nextProductionName &&\n      refProd.idx === this.nextProductionOccurrence\n    ) {\n      const fullRest = currRest.concat(prevRest);\n      this.updateExpectedNext();\n      this.walk(refProd.referencedRule, <any>fullRest);\n    }\n  }\n\n  updateExpectedNext(): void {\n    // need to consume the Terminal\n    if (this.ruleStack.length === 0) {\n      // must reset nextProductionXXX to avoid walking down another Top Level production while what we are\n      // really seeking is the last Terminal...\n      this.nextProductionName = \"\";\n      this.nextProductionOccurrence = 0;\n      this.isAtEndOfPath = true;\n    } else {\n      this.nextProductionName = this.ruleStack.pop()!;\n      this.nextProductionOccurrence = this.occurrenceStack.pop()!;\n    }\n  }\n}\n\nexport class NextAfterTokenWalker extends AbstractNextPossibleTokensWalker {\n  private nextTerminalName = \"\";\n  private nextTerminalOccurrence = 0;\n\n  constructor(\n    topProd: Rule,\n    protected path: ITokenGrammarPath,\n  ) {\n    super(topProd, path);\n    this.nextTerminalName = this.path.lastTok.name;\n    this.nextTerminalOccurrence = this.path.lastTokOccurrence;\n  }\n\n  walkTerminal(\n    terminal: Terminal,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (\n      this.isAtEndOfPath &&\n      terminal.terminalType.name === this.nextTerminalName &&\n      terminal.idx === this.nextTerminalOccurrence &&\n      !this.found\n    ) {\n      const fullRest = currRest.concat(prevRest);\n      const restProd = new Alternative({ definition: fullRest });\n      this.possibleTokTypes = first(restProd);\n      this.found = true;\n    }\n  }\n}\n\nexport type AlternativesFirstTokens = TokenType[][];\n\nexport interface IFirstAfterRepetition {\n  token: TokenType | undefined;\n  occurrence: number | undefined;\n  isEndOfRule: boolean | undefined;\n}\n\n/**\n * This walker only \"walks\" a single \"TOP\" level in the Grammar Ast, this means\n * it never \"follows\" production refs\n */\nexport class AbstractNextTerminalAfterProductionWalker extends RestWalker {\n  protected result: IFirstAfterRepetition = {\n    token: undefined,\n    occurrence: undefined,\n    isEndOfRule: undefined,\n  };\n\n  constructor(\n    protected topRule: Rule,\n    protected occurrence: number,\n  ) {\n    super();\n  }\n\n  startWalking(): IFirstAfterRepetition {\n    this.walk(this.topRule);\n    return this.result;\n  }\n}\n\nexport class NextTerminalAfterManyWalker extends AbstractNextTerminalAfterProductionWalker {\n  walkMany(\n    manyProd: Repetition,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (manyProd.idx === this.occurrence) {\n      const firstAfterMany = currRest.concat(prevRest)[0];\n      this.result.isEndOfRule = firstAfterMany === undefined;\n      if (firstAfterMany instanceof Terminal) {\n        this.result.token = firstAfterMany.terminalType;\n        this.result.occurrence = firstAfterMany.idx;\n      }\n    } else {\n      super.walkMany(manyProd, currRest, prevRest);\n    }\n  }\n}\n\nexport class NextTerminalAfterManySepWalker extends AbstractNextTerminalAfterProductionWalker {\n  walkManySep(\n    manySepProd: RepetitionWithSeparator,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (manySepProd.idx === this.occurrence) {\n      const firstAfterManySep = currRest.concat(prevRest)[0];\n      this.result.isEndOfRule = firstAfterManySep === undefined;\n      if (firstAfterManySep instanceof Terminal) {\n        this.result.token = firstAfterManySep.terminalType;\n        this.result.occurrence = firstAfterManySep.idx;\n      }\n    } else {\n      super.walkManySep(manySepProd, currRest, prevRest);\n    }\n  }\n}\n\nexport class NextTerminalAfterAtLeastOneWalker extends AbstractNextTerminalAfterProductionWalker {\n  walkAtLeastOne(\n    atLeastOneProd: RepetitionMandatory,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (atLeastOneProd.idx === this.occurrence) {\n      const firstAfterAtLeastOne = currRest.concat(prevRest)[0];\n      this.result.isEndOfRule = firstAfterAtLeastOne === undefined;\n      if (firstAfterAtLeastOne instanceof Terminal) {\n        this.result.token = firstAfterAtLeastOne.terminalType;\n        this.result.occurrence = firstAfterAtLeastOne.idx;\n      }\n    } else {\n      super.walkAtLeastOne(atLeastOneProd, currRest, prevRest);\n    }\n  }\n}\n\n// TODO: reduce code duplication in the AfterWalkers\nexport class NextTerminalAfterAtLeastOneSepWalker extends AbstractNextTerminalAfterProductionWalker {\n  walkAtLeastOneSep(\n    atleastOneSepProd: RepetitionMandatoryWithSeparator,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (atleastOneSepProd.idx === this.occurrence) {\n      const firstAfterfirstAfterAtLeastOneSep = currRest.concat(prevRest)[0];\n      this.result.isEndOfRule = firstAfterfirstAfterAtLeastOneSep === undefined;\n      if (firstAfterfirstAfterAtLeastOneSep instanceof Terminal) {\n        this.result.token = firstAfterfirstAfterAtLeastOneSep.terminalType;\n        this.result.occurrence = firstAfterfirstAfterAtLeastOneSep.idx;\n      }\n    } else {\n      super.walkAtLeastOneSep(atleastOneSepProd, currRest, prevRest);\n    }\n  }\n}\n\nexport interface PartialPathAndSuffixes {\n  partialPath: TokenType[];\n  suffixDef: IProduction[];\n}\n\nexport function possiblePathsFrom(\n  targetDef: IProduction[],\n  maxLength: number,\n  currPath: TokenType[] = [],\n): PartialPathAndSuffixes[] {\n  // avoid side effects\n  currPath = [...currPath];\n  let result: PartialPathAndSuffixes[] = [];\n  let i = 0;\n\n  // TODO: avoid inner funcs\n  function remainingPathWith(nextDef: IProduction[]) {\n    return nextDef.concat(targetDef.slice(i + 1));\n  }\n\n  // TODO: avoid inner funcs\n  function getAlternativesForProd(definition: IProduction[]) {\n    const alternatives = possiblePathsFrom(\n      remainingPathWith(definition),\n      maxLength,\n      currPath,\n    );\n    return result.concat(alternatives);\n  }\n\n  /**\n   * Mandatory productions will halt the loop as the paths computed from their recursive calls will already contain the\n   * following (rest) of the targetDef.\n   *\n   * For optional productions (Option/Repetition/...) the loop will continue to represent the paths that do not include the\n   * the optional production.\n   */\n  while (currPath.length < maxLength && i < targetDef.length) {\n    const prod = targetDef[i];\n\n    /* istanbul ignore else */\n    if (prod instanceof Alternative) {\n      return getAlternativesForProd(prod.definition);\n    } else if (prod instanceof NonTerminal) {\n      return getAlternativesForProd(prod.definition);\n    } else if (prod instanceof Option) {\n      result = getAlternativesForProd(prod.definition);\n    } else if (prod instanceof RepetitionMandatory) {\n      const newDef = prod.definition.concat([\n        new Repetition({\n          definition: prod.definition,\n        }),\n      ]);\n      return getAlternativesForProd(newDef);\n    } else if (prod instanceof RepetitionMandatoryWithSeparator) {\n      const newDef = [\n        new Alternative({ definition: prod.definition }),\n        new Repetition({\n          definition: [new Terminal({ terminalType: prod.separator })].concat(\n            <any>prod.definition,\n          ),\n        }),\n      ];\n      return getAlternativesForProd(newDef);\n    } else if (prod instanceof RepetitionWithSeparator) {\n      const newDef = prod.definition.concat([\n        new Repetition({\n          definition: [new Terminal({ terminalType: prod.separator })].concat(\n            <any>prod.definition,\n          ),\n        }),\n      ]);\n      result = getAlternativesForProd(newDef);\n    } else if (prod instanceof Repetition) {\n      const newDef = prod.definition.concat([\n        new Repetition({\n          definition: prod.definition,\n        }),\n      ]);\n      result = getAlternativesForProd(newDef);\n    } else if (prod instanceof Alternation) {\n      prod.definition.forEach((currAlt) => {\n        // TODO: this is a limited check for empty alternatives\n        //   It would prevent a common case of infinite loops during parser initialization.\n        //   However **in-directly** empty alternatives may still cause issues.\n        if (currAlt.definition.length !== 0) {\n          result = getAlternativesForProd(currAlt.definition);\n        }\n      });\n      return result;\n    } else if (prod instanceof Terminal) {\n      currPath.push(prod.terminalType);\n    } else {\n      throw Error(\"non exhaustive match\");\n    }\n\n    i++;\n  }\n  result.push({\n    partialPath: currPath,\n    suffixDef: targetDef.slice(i),\n  });\n\n  return result;\n}\n\ninterface IPathToExamine {\n  idx: number;\n  def: IProduction[];\n  ruleStack: string[];\n  occurrenceStack: number[];\n}\n\nexport function nextPossibleTokensAfter(\n  initialDef: IProduction[],\n  tokenVector: IToken[],\n  tokMatcher: TokenMatcher,\n  maxLookAhead: number,\n): INextTokenPath[] {\n  const EXIT_NON_TERMINAL: any = \"EXIT_NONE_TERMINAL\";\n  // to avoid creating a new Array each time.\n  const EXIT_NON_TERMINAL_ARR = [EXIT_NON_TERMINAL];\n  const EXIT_ALTERNATIVE: any = \"EXIT_ALTERNATIVE\";\n  let foundCompletePath = false;\n\n  const tokenVectorLength = tokenVector.length;\n  const minimalAlternativesIndex = tokenVectorLength - maxLookAhead - 1;\n\n  const result: INextTokenPath[] = [];\n\n  const possiblePaths: IPathToExamine[] = [];\n  possiblePaths.push({\n    idx: -1,\n    def: initialDef,\n    ruleStack: [],\n    occurrenceStack: [],\n  });\n\n  while (possiblePaths.length !== 0) {\n    const currPath = possiblePaths.pop()!;\n\n    // skip alternatives if no more results can be found (assuming deterministic grammar with fixed lookahead)\n    if (currPath === EXIT_ALTERNATIVE) {\n      if (\n        foundCompletePath &&\n        possiblePaths.at(-1)!.idx <= minimalAlternativesIndex\n      ) {\n        // remove irrelevant alternative\n        possiblePaths.pop();\n      }\n      continue;\n    }\n\n    const currDef = currPath.def;\n    const currIdx = currPath.idx;\n    const currRuleStack = currPath.ruleStack;\n    const currOccurrenceStack = currPath.occurrenceStack;\n\n    // For Example: an empty path could exist in a valid grammar in the case of an EMPTY_ALT\n    if (currDef.length === 0) {\n      continue;\n    }\n\n    const prod = currDef[0];\n    /* istanbul ignore else */\n    if (prod === EXIT_NON_TERMINAL) {\n      const nextPath = {\n        idx: currIdx,\n        def: currDef.slice(1),\n        ruleStack: currRuleStack.slice(0, -1),\n        occurrenceStack: currOccurrenceStack.slice(0, -1),\n      };\n      possiblePaths.push(nextPath);\n    } else if (prod instanceof Terminal) {\n      /* istanbul ignore else */\n      if (currIdx < tokenVectorLength - 1) {\n        const nextIdx = currIdx + 1;\n        const actualToken = tokenVector[nextIdx];\n        if (tokMatcher!(actualToken, prod.terminalType)) {\n          const nextPath = {\n            idx: nextIdx,\n            def: currDef.slice(1),\n            ruleStack: currRuleStack,\n            occurrenceStack: currOccurrenceStack,\n          };\n          possiblePaths.push(nextPath);\n        }\n        // end of the line\n      } else if (currIdx === tokenVectorLength - 1) {\n        // IGNORE ABOVE ELSE\n        result.push({\n          nextTokenType: prod.terminalType,\n          nextTokenOccurrence: prod.idx,\n          ruleStack: currRuleStack,\n          occurrenceStack: currOccurrenceStack,\n        });\n        foundCompletePath = true;\n      } else {\n        throw Error(\"non exhaustive match\");\n      }\n    } else if (prod instanceof NonTerminal) {\n      const newRuleStack = [...currRuleStack];\n      newRuleStack.push(prod.nonTerminalName);\n\n      const newOccurrenceStack = [...currOccurrenceStack];\n      newOccurrenceStack.push(prod.idx);\n\n      const nextPath = {\n        idx: currIdx,\n        def: prod.definition.concat(EXIT_NON_TERMINAL_ARR, currDef.slice(1)),\n        ruleStack: newRuleStack,\n        occurrenceStack: newOccurrenceStack,\n      };\n      possiblePaths.push(nextPath);\n    } else if (prod instanceof Option) {\n      // the order of alternatives is meaningful, FILO (Last path will be traversed first).\n      const nextPathWithout = {\n        idx: currIdx,\n        def: currDef.slice(1),\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      };\n      possiblePaths.push(nextPathWithout);\n      // required marker to avoid backtracking paths whose higher priority alternatives already matched\n      possiblePaths.push(EXIT_ALTERNATIVE);\n\n      const nextPathWith = {\n        idx: currIdx,\n        def: prod.definition.concat(currDef.slice(1)),\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      };\n      possiblePaths.push(nextPathWith);\n    } else if (prod instanceof RepetitionMandatory) {\n      // TODO:(THE NEW operators here take a while...) (convert once?)\n      const secondIteration = new Repetition({\n        definition: prod.definition,\n        idx: prod.idx,\n      });\n      const nextDef = prod.definition.concat(\n        [secondIteration],\n        currDef.slice(1),\n      );\n      const nextPath = {\n        idx: currIdx,\n        def: nextDef,\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      };\n      possiblePaths.push(nextPath);\n    } else if (prod instanceof RepetitionMandatoryWithSeparator) {\n      // TODO:(THE NEW operators here take a while...) (convert once?)\n      const separatorGast = new Terminal({\n        terminalType: prod.separator,\n      });\n      const secondIteration = new Repetition({\n        definition: [<any>separatorGast].concat(prod.definition),\n        idx: prod.idx,\n      });\n      const nextDef = prod.definition.concat(\n        [secondIteration],\n        currDef.slice(1),\n      );\n      const nextPath = {\n        idx: currIdx,\n        def: nextDef,\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      };\n      possiblePaths.push(nextPath);\n    } else if (prod instanceof RepetitionWithSeparator) {\n      // the order of alternatives is meaningful, FILO (Last path will be traversed first).\n      const nextPathWithout = {\n        idx: currIdx,\n        def: currDef.slice(1),\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      };\n      possiblePaths.push(nextPathWithout);\n      // required marker to avoid backtracking paths whose higher priority alternatives already matched\n      possiblePaths.push(EXIT_ALTERNATIVE);\n\n      const separatorGast = new Terminal({\n        terminalType: prod.separator,\n      });\n      const nthRepetition = new Repetition({\n        definition: [<any>separatorGast].concat(prod.definition),\n        idx: prod.idx,\n      });\n      const nextDef = prod.definition.concat([nthRepetition], currDef.slice(1));\n      const nextPathWith = {\n        idx: currIdx,\n        def: nextDef,\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      };\n      possiblePaths.push(nextPathWith);\n    } else if (prod instanceof Repetition) {\n      // the order of alternatives is meaningful, FILO (Last path will be traversed first).\n      const nextPathWithout = {\n        idx: currIdx,\n        def: currDef.slice(1),\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      };\n      possiblePaths.push(nextPathWithout);\n      // required marker to avoid backtracking paths whose higher priority alternatives already matched\n      possiblePaths.push(EXIT_ALTERNATIVE);\n\n      // TODO: an empty repetition will cause infinite loops here, will the parser detect this in selfAnalysis?\n      const nthRepetition = new Repetition({\n        definition: prod.definition,\n        idx: prod.idx,\n      });\n      const nextDef = prod.definition.concat([nthRepetition], currDef.slice(1));\n      const nextPathWith = {\n        idx: currIdx,\n        def: nextDef,\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      };\n      possiblePaths.push(nextPathWith);\n    } else if (prod instanceof Alternation) {\n      // the order of alternatives is meaningful, FILO (Last path will be traversed first).\n      for (let i = prod.definition.length - 1; i >= 0; i--) {\n        const currAlt: any = prod.definition[i];\n        const currAltPath = {\n          idx: currIdx,\n          def: currAlt.definition.concat(currDef.slice(1)),\n          ruleStack: currRuleStack,\n          occurrenceStack: currOccurrenceStack,\n        };\n        possiblePaths.push(currAltPath);\n        possiblePaths.push(EXIT_ALTERNATIVE);\n      }\n    } else if (prod instanceof Alternative) {\n      possiblePaths.push({\n        idx: currIdx,\n        def: prod.definition.concat(currDef.slice(1)),\n        ruleStack: currRuleStack,\n        occurrenceStack: currOccurrenceStack,\n      });\n    } else if (prod instanceof Rule) {\n      // last because we should only encounter at most a single one of these per invocation.\n      possiblePaths.push(\n        expandTopLevelRule(prod, currIdx, currRuleStack, currOccurrenceStack),\n      );\n    } else {\n      throw Error(\"non exhaustive match\");\n    }\n  }\n  return result;\n}\n\nfunction expandTopLevelRule(\n  topRule: Rule,\n  currIdx: number,\n  currRuleStack: string[],\n  currOccurrenceStack: number[],\n): IPathToExamine {\n  const newRuleStack = [...currRuleStack];\n  newRuleStack.push(topRule.name);\n\n  const newCurrOccurrenceStack = [...currOccurrenceStack];\n  // top rule is always assumed to have been called with occurrence index 1\n  newCurrOccurrenceStack.push(1);\n\n  return {\n    idx: currIdx,\n    def: topRule.definition,\n    ruleStack: newRuleStack,\n    occurrenceStack: newCurrOccurrenceStack,\n  };\n}\n", "import { possiblePathsFrom } from \"./interpreter.js\";\nimport { RestWalker } from \"./rest.js\";\nimport { Predicate, TokenMatcher } from \"../parser/parser.js\";\nimport {\n  tokenStructuredMatcher,\n  tokenStructuredMatcherNoCategories,\n} from \"../../scan/tokens.js\";\nimport {\n  Alternation,\n  Alternative as AlternativeGAST,\n  GAstVisitor,\n  Option,\n  Repetition,\n  RepetitionMandatory,\n  RepetitionMandatoryWithSeparator,\n  RepetitionWithSeparator,\n} from \"@chevrotain/gast\";\nimport {\n  BaseParser,\n  IOrAlt,\n  IProduction,\n  IProductionWithOccurrence,\n  LookaheadProductionType,\n  LookaheadSequence,\n  Rule,\n  TokenType,\n} from \"@chevrotain/types\";\n\nexport enum PROD_TYPE {\n  OPTION,\n  REPETITION,\n  REPETITION_MANDATORY,\n  REPETITION_MANDATORY_WITH_SEPARATOR,\n  REPETITION_WITH_SEPARATOR,\n  ALTERNATION,\n}\n\nexport function getProdType(\n  prod: IProduction | LookaheadProductionType,\n): PROD_TYPE {\n  /* istanbul ignore else */\n  if (prod instanceof Option || prod === \"Option\") {\n    return PROD_TYPE.OPTION;\n  } else if (prod instanceof Repetition || prod === \"Repetition\") {\n    return PROD_TYPE.REPETITION;\n  } else if (\n    prod instanceof RepetitionMandatory ||\n    prod === \"RepetitionMandatory\"\n  ) {\n    return PROD_TYPE.REPETITION_MANDATORY;\n  } else if (\n    prod instanceof RepetitionMandatoryWithSeparator ||\n    prod === \"RepetitionMandatoryWithSeparator\"\n  ) {\n    return PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR;\n  } else if (\n    prod instanceof RepetitionWithSeparator ||\n    prod === \"RepetitionWithSeparator\"\n  ) {\n    return PROD_TYPE.REPETITION_WITH_SEPARATOR;\n  } else if (prod instanceof Alternation || prod === \"Alternation\") {\n    return PROD_TYPE.ALTERNATION;\n  } else {\n    throw Error(\"non exhaustive match\");\n  }\n}\n\nexport function getLookaheadPaths(options: {\n  occurrence: number;\n  rule: Rule;\n  prodType: LookaheadProductionType;\n  maxLookahead: number;\n}): LookaheadSequence[] {\n  const { occurrence, rule, prodType, maxLookahead } = options;\n  const type = getProdType(prodType);\n  if (type === PROD_TYPE.ALTERNATION) {\n    return getLookaheadPathsForOr(occurrence, rule, maxLookahead);\n  } else {\n    return getLookaheadPathsForOptionalProd(\n      occurrence,\n      rule,\n      type,\n      maxLookahead,\n    );\n  }\n}\n\nexport function buildLookaheadFuncForOr(\n  occurrence: number,\n  ruleGrammar: Rule,\n  maxLookahead: number,\n  hasPredicates: boolean,\n  dynamicTokensEnabled: boolean,\n  laFuncBuilder: Function,\n): (orAlts?: IOrAlt<any>[]) => number | undefined {\n  const lookAheadPaths = getLookaheadPathsForOr(\n    occurrence,\n    ruleGrammar,\n    maxLookahead,\n  );\n\n  const tokenMatcher = areTokenCategoriesNotUsed(lookAheadPaths)\n    ? tokenStructuredMatcherNoCategories\n    : tokenStructuredMatcher;\n\n  return laFuncBuilder(\n    lookAheadPaths,\n    hasPredicates,\n    tokenMatcher,\n    dynamicTokensEnabled,\n  );\n}\n\n/**\n *  When dealing with an Optional production (OPTION/MANY/2nd iteration of AT_LEAST_ONE/...) we need to compare\n *  the lookahead \"inside\" the production and the lookahead immediately \"after\" it in the same top level rule (context free).\n *\n *  Example: given a production:\n *  ABC(DE)?DF\n *\n *  The optional '(DE)?' should only be entered if we see 'DE'. a single Token 'D' is not sufficient to distinguish between the two\n *  alternatives.\n *\n *  @returns A Lookahead function which will return true IFF the parser should parse the Optional production.\n */\nexport function buildLookaheadFuncForOptionalProd(\n  occurrence: number,\n  ruleGrammar: Rule,\n  k: number,\n  dynamicTokensEnabled: boolean,\n  prodType: PROD_TYPE,\n  lookaheadBuilder: (\n    lookAheadSequence: LookaheadSequence,\n    tokenMatcher: TokenMatcher,\n    dynamicTokensEnabled: boolean,\n  ) => () => boolean,\n): () => boolean {\n  const lookAheadPaths = getLookaheadPathsForOptionalProd(\n    occurrence,\n    ruleGrammar,\n    prodType,\n    k,\n  );\n\n  const tokenMatcher = areTokenCategoriesNotUsed(lookAheadPaths)\n    ? tokenStructuredMatcherNoCategories\n    : tokenStructuredMatcher;\n\n  return lookaheadBuilder(\n    lookAheadPaths[0],\n    tokenMatcher,\n    dynamicTokensEnabled,\n  );\n}\n\nexport type Alternative = TokenType[][];\n\nexport function buildAlternativesLookAheadFunc(\n  alts: LookaheadSequence[],\n  hasPredicates: boolean,\n  tokenMatcher: TokenMatcher,\n  dynamicTokensEnabled: boolean,\n): (orAlts: IOrAlt<any>[]) => number | undefined {\n  const numOfAlts = alts.length;\n  const areAllOneTokenLookahead = alts.every((currAlt) => {\n    return currAlt.every((currPath) => {\n      return currPath.length === 1;\n    });\n  });\n\n  // This version takes into account the predicates as well.\n  if (hasPredicates) {\n    /**\n     * @returns {number} - The chosen alternative index\n     */\n    return function (\n      this: BaseParser,\n      orAlts: IOrAlt<any>[],\n    ): number | undefined {\n      // unfortunately the predicates must be extracted every single time\n      // as they cannot be cached due to references to parameters(vars) which are no longer valid.\n      // note that in the common case of no predicates, no cpu time will be wasted on this (see else block)\n      const predicates: (Predicate | undefined)[] = orAlts.map(\n        (currAlt) => currAlt.GATE,\n      );\n\n      for (let t = 0; t < numOfAlts; t++) {\n        const currAlt = alts[t];\n        const currNumOfPaths = currAlt.length;\n\n        const currPredicate = predicates[t];\n        if (currPredicate !== undefined && currPredicate.call(this) === false) {\n          // if the predicate does not match there is no point in checking the paths\n          continue;\n        }\n        nextPath: for (let j = 0; j < currNumOfPaths; j++) {\n          const currPath = currAlt[j];\n          const currPathLength = currPath.length;\n          for (let i = 0; i < currPathLength; i++) {\n            const nextToken = this.LA_FAST(i + 1);\n            if (tokenMatcher(nextToken, currPath[i]) === false) {\n              // mismatch in current path\n              // try the next pth\n              continue nextPath;\n            }\n          }\n          // found a full path that matches.\n          // this will also work for an empty ALT as the loop will be skipped\n          return t;\n        }\n        // none of the paths for the current alternative matched\n        // try the next alternative\n      }\n      // none of the alternatives could be matched\n      return undefined;\n    };\n  } else if (areAllOneTokenLookahead && !dynamicTokensEnabled) {\n    // optimized (common) case of all the lookaheads paths requiring only\n    // a single token lookahead. These Optimizations cannot work if dynamically defined Tokens are used.\n    const singleTokenAlts = alts.map((currAlt) => {\n      return currAlt.flat();\n    });\n\n    const choiceToAlt = singleTokenAlts.reduce(\n      (result, currAlt, idx) => {\n        currAlt.forEach((currTokType) => {\n          if (!(currTokType.tokenTypeIdx! in result)) {\n            result[currTokType.tokenTypeIdx!] = idx;\n          }\n          currTokType.categoryMatches!.forEach((currExtendingType) => {\n            if (!Object.hasOwn(result, currExtendingType)) {\n              result[currExtendingType] = idx;\n            }\n          });\n        });\n        return result;\n      },\n      {} as Record<number, number>,\n    );\n\n    /**\n     * @returns {number} - The chosen alternative index\n     */\n    return function (this: BaseParser): number {\n      const nextToken = this.LA_FAST(1);\n      return choiceToAlt[nextToken.tokenTypeIdx];\n    };\n  } else {\n    // optimized lookahead without needing to check the predicates at all.\n    // this causes code duplication which is intentional to improve performance.\n    /**\n     * @returns {number} - The chosen alternative index\n     */\n    return function (this: BaseParser): number | undefined {\n      for (let t = 0; t < numOfAlts; t++) {\n        const currAlt = alts[t];\n        const currNumOfPaths = currAlt.length;\n        nextPath: for (let j = 0; j < currNumOfPaths; j++) {\n          const currPath = currAlt[j];\n          const currPathLength = currPath.length;\n          for (let i = 0; i < currPathLength; i++) {\n            const nextToken = this.LA_FAST(i + 1);\n            if (tokenMatcher(nextToken, currPath[i]) === false) {\n              // mismatch in current path\n              // try the next pth\n              continue nextPath;\n            }\n          }\n          // found a full path that matches.\n          // this will also work for an empty ALT as the loop will be skipped\n          return t;\n        }\n        // none of the paths for the current alternative matched\n        // try the next alternative\n      }\n      // none of the alternatives could be matched\n      return undefined;\n    };\n  }\n}\n\nexport function buildSingleAlternativeLookaheadFunction(\n  alt: LookaheadSequence,\n  tokenMatcher: TokenMatcher,\n  dynamicTokensEnabled: boolean,\n): () => boolean {\n  const areAllOneTokenLookahead = alt.every((currPath) => {\n    return currPath.length === 1;\n  });\n\n  const numOfPaths = alt.length;\n\n  // optimized (common) case of all the lookaheads paths requiring only\n  // a single token lookahead.\n  if (areAllOneTokenLookahead && !dynamicTokensEnabled) {\n    const singleTokensTypes = alt.flat();\n\n    if (\n      singleTokensTypes.length === 1 &&\n      (<any>singleTokensTypes[0]).categoryMatches.length === 0\n    ) {\n      const expectedTokenType = singleTokensTypes[0];\n      const expectedTokenUniqueKey = (<any>expectedTokenType).tokenTypeIdx;\n\n      return function (this: BaseParser): boolean {\n        return this.LA_FAST(1).tokenTypeIdx === expectedTokenUniqueKey;\n      };\n    } else {\n      const choiceToAlt = singleTokensTypes.reduce(\n        (result, currTokType, idx) => {\n          result[currTokType.tokenTypeIdx!] = true;\n          currTokType.categoryMatches!.forEach((currExtendingType) => {\n            result[currExtendingType] = true;\n          });\n          return result;\n        },\n        [] as boolean[],\n      );\n\n      return function (this: BaseParser): boolean {\n        const nextToken = this.LA_FAST(1);\n        return choiceToAlt[nextToken.tokenTypeIdx] === true;\n      };\n    }\n  } else {\n    return function (this: BaseParser): boolean {\n      nextPath: for (let j = 0; j < numOfPaths; j++) {\n        const currPath = alt[j];\n        const currPathLength = currPath.length;\n        for (let i = 0; i < currPathLength; i++) {\n          const nextToken = this.LA_FAST(i + 1);\n          if (tokenMatcher(nextToken, currPath[i]) === false) {\n            // mismatch in current path\n            // try the next pth\n            continue nextPath;\n          }\n        }\n        // found a full path that matches.\n        return true;\n      }\n\n      // none of the paths matched\n      return false;\n    };\n  }\n}\n\nclass RestDefinitionFinderWalker extends RestWalker {\n  private restDef: IProduction[];\n\n  constructor(\n    private topProd: Rule,\n    private targetOccurrence: number,\n    private targetProdType: PROD_TYPE,\n  ) {\n    super();\n  }\n\n  startWalking(): IProduction[] {\n    this.walk(this.topProd);\n    return this.restDef;\n  }\n\n  private checkIsTarget(\n    node: IProductionWithOccurrence,\n    expectedProdType: PROD_TYPE,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): boolean {\n    if (\n      node.idx === this.targetOccurrence &&\n      this.targetProdType === expectedProdType\n    ) {\n      this.restDef = currRest.concat(prevRest);\n      return true;\n    }\n    // performance optimization, do not iterate over the entire Grammar ast after we have found the target\n    return false;\n  }\n\n  walkOption(\n    optionProd: Option,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (!this.checkIsTarget(optionProd, PROD_TYPE.OPTION, currRest, prevRest)) {\n      super.walkOption(optionProd, currRest, prevRest);\n    }\n  }\n\n  walkAtLeastOne(\n    atLeastOneProd: RepetitionMandatory,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (\n      !this.checkIsTarget(\n        atLeastOneProd,\n        PROD_TYPE.REPETITION_MANDATORY,\n        currRest,\n        prevRest,\n      )\n    ) {\n      super.walkOption(atLeastOneProd, currRest, prevRest);\n    }\n  }\n\n  walkAtLeastOneSep(\n    atLeastOneSepProd: RepetitionMandatoryWithSeparator,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (\n      !this.checkIsTarget(\n        atLeastOneSepProd,\n        PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR,\n        currRest,\n        prevRest,\n      )\n    ) {\n      super.walkOption(atLeastOneSepProd, currRest, prevRest);\n    }\n  }\n\n  walkMany(\n    manyProd: Repetition,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (\n      !this.checkIsTarget(manyProd, PROD_TYPE.REPETITION, currRest, prevRest)\n    ) {\n      super.walkOption(manyProd, currRest, prevRest);\n    }\n  }\n\n  walkManySep(\n    manySepProd: RepetitionWithSeparator,\n    currRest: IProduction[],\n    prevRest: IProduction[],\n  ): void {\n    if (\n      !this.checkIsTarget(\n        manySepProd,\n        PROD_TYPE.REPETITION_WITH_SEPARATOR,\n        currRest,\n        prevRest,\n      )\n    ) {\n      super.walkOption(manySepProd, currRest, prevRest);\n    }\n  }\n}\n\n/**\n * Returns the definition of a target production in a top level level rule.\n */\nclass InsideDefinitionFinderVisitor extends GAstVisitor {\n  public result: IProduction[] = [];\n\n  constructor(\n    private targetOccurrence: number,\n    private targetProdType: PROD_TYPE,\n    private targetRef?: any,\n  ) {\n    super();\n  }\n\n  private checkIsTarget(\n    node: { definition: IProduction[] } & IProductionWithOccurrence,\n    expectedProdName: PROD_TYPE,\n  ): void {\n    if (\n      node.idx === this.targetOccurrence &&\n      this.targetProdType === expectedProdName &&\n      (this.targetRef === undefined || node === this.targetRef)\n    ) {\n      this.result = node.definition;\n    }\n  }\n\n  public visitOption(node: Option): void {\n    this.checkIsTarget(node, PROD_TYPE.OPTION);\n  }\n\n  public visitRepetition(node: Repetition): void {\n    this.checkIsTarget(node, PROD_TYPE.REPETITION);\n  }\n\n  public visitRepetitionMandatory(node: RepetitionMandatory): void {\n    this.checkIsTarget(node, PROD_TYPE.REPETITION_MANDATORY);\n  }\n\n  public visitRepetitionMandatoryWithSeparator(\n    node: RepetitionMandatoryWithSeparator,\n  ): void {\n    this.checkIsTarget(node, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR);\n  }\n\n  public visitRepetitionWithSeparator(node: RepetitionWithSeparator): void {\n    this.checkIsTarget(node, PROD_TYPE.REPETITION_WITH_SEPARATOR);\n  }\n\n  public visitAlternation(node: Alternation): void {\n    this.checkIsTarget(node, PROD_TYPE.ALTERNATION);\n  }\n}\n\nfunction initializeArrayOfArrays(size: number): any[][] {\n  const result = new Array(size);\n  for (let i = 0; i < size; i++) {\n    result[i] = [];\n  }\n  return result;\n}\n\n/**\n * A sort of hash function between a Path in the grammar and a string.\n * Note that this returns multiple \"hashes\" to support the scenario of token categories.\n * -  A single path with categories may match multiple **actual** paths.\n */\nfunction pathToHashKeys(path: TokenType[]): string[] {\n  let keys = [\"\"];\n  for (let i = 0; i < path.length; i++) {\n    const tokType = path[i];\n    const longerKeys = [];\n    for (let j = 0; j < keys.length; j++) {\n      const currShorterKey = keys[j];\n      longerKeys.push(currShorterKey + \"_\" + tokType.tokenTypeIdx);\n      for (let t = 0; t < tokType.categoryMatches!.length; t++) {\n        const categoriesKeySuffix = \"_\" + tokType.categoryMatches![t];\n        longerKeys.push(currShorterKey + categoriesKeySuffix);\n      }\n    }\n    keys = longerKeys;\n  }\n  return keys;\n}\n\n/**\n * Imperative style due to being called from a hot spot\n */\nfunction isUniquePrefixHash(\n  altKnownPathsKeys: Record<string, boolean>[],\n  searchPathKeys: string[],\n  idx: number,\n): boolean {\n  for (\n    let currAltIdx = 0;\n    currAltIdx < altKnownPathsKeys.length;\n    currAltIdx++\n  ) {\n    // We only want to test vs the other alternatives\n    if (currAltIdx === idx) {\n      continue;\n    }\n    const otherAltKnownPathsKeys = altKnownPathsKeys[currAltIdx];\n    for (let searchIdx = 0; searchIdx < searchPathKeys.length; searchIdx++) {\n      const searchKey = searchPathKeys[searchIdx];\n      if (otherAltKnownPathsKeys[searchKey] === true) {\n        return false;\n      }\n    }\n  }\n  // None of the SearchPathKeys were found in any of the other alternatives\n  return true;\n}\n\nexport function lookAheadSequenceFromAlternatives(\n  altsDefs: IProduction[],\n  k: number,\n): LookaheadSequence[] {\n  const partialAlts = altsDefs.map((currAlt) =>\n    possiblePathsFrom([currAlt], 1),\n  );\n  const finalResult = initializeArrayOfArrays(partialAlts.length);\n  const altsHashes = partialAlts.map((currAltPaths) => {\n    const dict: { [key: string]: boolean } = {};\n    currAltPaths.forEach((item) => {\n      const keys = pathToHashKeys(item.partialPath);\n      keys.forEach((currKey) => {\n        dict[currKey] = true;\n      });\n    });\n    return dict;\n  });\n  let newData = partialAlts;\n\n  // maxLookahead loop\n  for (let pathLength = 1; pathLength <= k; pathLength++) {\n    const currDataset = newData;\n    newData = initializeArrayOfArrays(currDataset.length);\n\n    // alternatives loop\n    for (let altIdx = 0; altIdx < currDataset.length; altIdx++) {\n      const currAltPathsAndSuffixes = currDataset[altIdx];\n      // paths in current alternative loop\n      for (\n        let currPathIdx = 0;\n        currPathIdx < currAltPathsAndSuffixes.length;\n        currPathIdx++\n      ) {\n        const currPathPrefix = currAltPathsAndSuffixes[currPathIdx].partialPath;\n        const suffixDef = currAltPathsAndSuffixes[currPathIdx].suffixDef;\n        const prefixKeys = pathToHashKeys(currPathPrefix);\n        const isUnique = isUniquePrefixHash(altsHashes, prefixKeys, altIdx);\n        // End of the line for this path.\n        if (isUnique || suffixDef.length === 0 || currPathPrefix.length === k) {\n          const currAltResult = finalResult[altIdx];\n          // TODO: Can we implement a containsPath using Maps/Dictionaries?\n          if (containsPath(currAltResult, currPathPrefix) === false) {\n            currAltResult.push(currPathPrefix);\n            // Update all new  keys for the current path.\n            for (let j = 0; j < prefixKeys.length; j++) {\n              const currKey = prefixKeys[j];\n              altsHashes[altIdx][currKey] = true;\n            }\n          }\n        }\n        // Expand longer paths\n        else {\n          const newPartialPathsAndSuffixes = possiblePathsFrom(\n            suffixDef,\n            pathLength + 1,\n            currPathPrefix,\n          );\n          newData[altIdx] = newData[altIdx].concat(newPartialPathsAndSuffixes);\n\n          // Update keys for new known paths\n          newPartialPathsAndSuffixes.forEach((item) => {\n            const prefixKeys = pathToHashKeys(item.partialPath);\n            prefixKeys.forEach((key) => {\n              altsHashes[altIdx][key] = true;\n            });\n          });\n        }\n      }\n    }\n  }\n\n  return finalResult;\n}\n\nexport function getLookaheadPathsForOr(\n  occurrence: number,\n  ruleGrammar: Rule,\n  k: number,\n  orProd?: Alternation,\n): LookaheadSequence[] {\n  const visitor = new InsideDefinitionFinderVisitor(\n    occurrence,\n    PROD_TYPE.ALTERNATION,\n    orProd,\n  );\n  ruleGrammar.accept(visitor);\n  return lookAheadSequenceFromAlternatives(visitor.result, k);\n}\n\nexport function getLookaheadPathsForOptionalProd(\n  occurrence: number,\n  ruleGrammar: Rule,\n  prodType: PROD_TYPE,\n  k: number,\n): LookaheadSequence[] {\n  const insideDefVisitor = new InsideDefinitionFinderVisitor(\n    occurrence,\n    prodType,\n  );\n  ruleGrammar.accept(insideDefVisitor);\n  const insideDef = insideDefVisitor.result;\n\n  const afterDefWalker = new RestDefinitionFinderWalker(\n    ruleGrammar,\n    occurrence,\n    prodType,\n  );\n  const afterDef = afterDefWalker.startWalking();\n\n  const insideFlat = new AlternativeGAST({ definition: insideDef });\n  const afterFlat = new AlternativeGAST({ definition: afterDef });\n\n  return lookAheadSequenceFromAlternatives([insideFlat, afterFlat], k);\n}\n\nexport function containsPath(\n  alternative: Alternative,\n  searchPath: TokenType[],\n): boolean {\n  compareOtherPath: for (let i = 0; i < alternative.length; i++) {\n    const otherPath = alternative[i];\n    if (otherPath.length !== searchPath.length) {\n      continue;\n    }\n    for (let j = 0; j < otherPath.length; j++) {\n      const searchTok = searchPath[j];\n      const otherTok = otherPath[j];\n\n      const matchingTokens =\n        searchTok === otherTok ||\n        otherTok.categoryMatchesMap![searchTok.tokenTypeIdx!] !== undefined;\n      if (matchingTokens === false) {\n        continue compareOtherPath;\n      }\n    }\n    return true;\n  }\n\n  return false;\n}\n\nexport function isStrictPrefixOfPath(\n  prefix: TokenType[],\n  other: TokenType[],\n): boolean {\n  return (\n    prefix.length < other.length &&\n    prefix.every((tokType, idx) => {\n      const otherTokType = other[idx];\n      return (\n        tokType === otherTokType ||\n        otherTokType.categoryMatchesMap![tokType.tokenTypeIdx!]\n      );\n    })\n  );\n}\n\nexport function areTokenCategoriesNotUsed(\n  lookAheadPaths: LookaheadSequence[],\n): boolean {\n  return lookAheadPaths.every((singleAltPaths) =>\n    singleAltPaths.every((singlePath) =>\n      singlePath.every((token) => token.categoryMatches!.length === 0),\n    ),\n  );\n}\n", "import {\n  IParserAmbiguousAlternativesDefinitionError,\n  IParserDuplicatesDefinitionError,\n  IParserEmptyAlternativeDefinitionError,\n  ParserDefinitionErrorType,\n} from \"../parser/parser.js\";\nimport {\n  Alternation,\n  Alternative as AlternativeGAST,\n  GAstVisitor,\n  getProductionDslName,\n  isOptionalProd,\n  NonTerminal,\n  Option,\n  Repetition,\n  RepetitionMandatory,\n  RepetitionMandatoryWithSeparator,\n  RepetitionWithSeparator,\n  Terminal,\n} from \"@chevrotain/gast\";\nimport {\n  Alternative,\n  containsPath,\n  getLookaheadPathsForOptionalProd,\n  getLookaheadPathsForOr,\n  getProdType,\n  isStrictPrefixOfPath,\n} from \"./lookahead.js\";\nimport { nextPossibleTokensAfter } from \"./interpreter.js\";\nimport {\n  ILookaheadStrategy,\n  IProduction,\n  IProductionWithOccurrence,\n  Rule,\n  TokenType,\n} from \"@chevrotain/types\";\nimport {\n  IGrammarValidatorErrorMessageProvider,\n  IParserDefinitionError,\n} from \"./types.js\";\nimport { tokenStructuredMatcher } from \"../../scan/tokens.js\";\n\nexport function validateLookahead(options: {\n  lookaheadStrategy: ILookaheadStrategy;\n  rules: Rule[];\n  tokenTypes: TokenType[];\n  grammarName: string;\n}): IParserDefinitionError[] {\n  const lookaheadValidationErrorMessages = options.lookaheadStrategy.validate({\n    rules: options.rules,\n    tokenTypes: options.tokenTypes,\n    grammarName: options.grammarName,\n  });\n  return lookaheadValidationErrorMessages.map((errorMessage) => ({\n    type: ParserDefinitionErrorType.CUSTOM_LOOKAHEAD_VALIDATION,\n    ...errorMessage,\n  }));\n}\n\nexport function validateGrammar(\n  topLevels: Rule[],\n  tokenTypes: TokenType[],\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n  grammarName: string,\n): IParserDefinitionError[] {\n  const duplicateErrors: IParserDefinitionError[] = topLevels.flatMap(\n    (currTopLevel) =>\n      validateDuplicateProductions(currTopLevel, errMsgProvider),\n  );\n\n  const termsNamespaceConflictErrors = checkTerminalAndNoneTerminalsNameSpace(\n    topLevels,\n    tokenTypes,\n    errMsgProvider,\n  );\n\n  const tooManyAltsErrors = topLevels.flatMap((curRule) =>\n    validateTooManyAlts(curRule, errMsgProvider),\n  );\n\n  const duplicateRulesError = topLevels.flatMap((curRule) =>\n    validateRuleDoesNotAlreadyExist(\n      curRule,\n      topLevels,\n      grammarName,\n      errMsgProvider,\n    ),\n  );\n\n  return duplicateErrors.concat(\n    termsNamespaceConflictErrors,\n    tooManyAltsErrors,\n    duplicateRulesError,\n  );\n}\n\nfunction validateDuplicateProductions(\n  topLevelRule: Rule,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserDuplicatesDefinitionError[] {\n  const collectorVisitor = new OccurrenceValidationCollector();\n  topLevelRule.accept(collectorVisitor);\n  const allRuleProductions = collectorVisitor.allProductions;\n\n  const productionGroups = Object.groupBy(\n    allRuleProductions,\n    identifyProductionForDuplicates,\n  );\n\n  const duplicates = Object.fromEntries(\n    Object.entries(productionGroups).filter(\n      ([_k, currGroup]) => currGroup!.length > 1,\n    ),\n  );\n\n  const errors = Object.values(duplicates).map((currDuplicates: any) => {\n    const firstProd: any = currDuplicates[0];\n    const msg = errMsgProvider.buildDuplicateFoundError(\n      topLevelRule,\n      currDuplicates,\n    );\n    const dslName = getProductionDslName(firstProd);\n    const defError: IParserDuplicatesDefinitionError = {\n      message: msg,\n      type: ParserDefinitionErrorType.DUPLICATE_PRODUCTIONS,\n      ruleName: topLevelRule.name,\n      dslName: dslName,\n      occurrence: firstProd.idx,\n    };\n\n    const param = getExtraProductionArgument(firstProd);\n    if (param) {\n      defError.parameter = param;\n    }\n\n    return defError;\n  });\n  return errors;\n}\n\nexport function identifyProductionForDuplicates(\n  prod: IProductionWithOccurrence,\n): string {\n  return `${getProductionDslName(prod)}_#_${\n    prod.idx\n  }_#_${getExtraProductionArgument(prod)}`;\n}\n\nfunction getExtraProductionArgument(prod: IProductionWithOccurrence): string {\n  if (prod instanceof Terminal) {\n    return prod.terminalType.name;\n  } else if (prod instanceof NonTerminal) {\n    return prod.nonTerminalName;\n  } else {\n    return \"\";\n  }\n}\n\nexport class OccurrenceValidationCollector extends GAstVisitor {\n  public allProductions: IProductionWithOccurrence[] = [];\n\n  public visitNonTerminal(subrule: NonTerminal): void {\n    this.allProductions.push(subrule);\n  }\n\n  public visitOption(option: Option): void {\n    this.allProductions.push(option);\n  }\n\n  public visitRepetitionWithSeparator(manySep: RepetitionWithSeparator): void {\n    this.allProductions.push(manySep);\n  }\n\n  public visitRepetitionMandatory(atLeastOne: RepetitionMandatory): void {\n    this.allProductions.push(atLeastOne);\n  }\n\n  public visitRepetitionMandatoryWithSeparator(\n    atLeastOneSep: RepetitionMandatoryWithSeparator,\n  ): void {\n    this.allProductions.push(atLeastOneSep);\n  }\n\n  public visitRepetition(many: Repetition): void {\n    this.allProductions.push(many);\n  }\n\n  public visitAlternation(or: Alternation): void {\n    this.allProductions.push(or);\n  }\n\n  public visitTerminal(terminal: Terminal): void {\n    this.allProductions.push(terminal);\n  }\n}\n\nexport function validateRuleDoesNotAlreadyExist(\n  rule: Rule,\n  allRules: Rule[],\n  className: string,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserDefinitionError[] {\n  const errors = [];\n  const occurrences = allRules.reduce((result, curRule) => {\n    if (curRule.name === rule.name) {\n      return result + 1;\n    }\n    return result;\n  }, 0);\n  if (occurrences > 1) {\n    const errMsg = errMsgProvider.buildDuplicateRuleNameError({\n      topLevelRule: rule,\n      grammarName: className,\n    });\n    errors.push({\n      message: errMsg,\n      type: ParserDefinitionErrorType.DUPLICATE_RULE_NAME,\n      ruleName: rule.name,\n    });\n  }\n\n  return errors;\n}\n\n// TODO: is there anyway to get only the rule names of rules inherited from the super grammars?\n// This is not part of the IGrammarErrorProvider because the validation cannot be performed on\n// The grammar structure, only at runtime.\nexport function validateRuleIsOverridden(\n  ruleName: string,\n  definedRulesNames: string[],\n  className: string,\n): IParserDefinitionError[] {\n  const errors = [];\n  let errMsg;\n\n  if (!definedRulesNames.includes(ruleName)) {\n    errMsg =\n      `Invalid rule override, rule: ->${ruleName}<- cannot be overridden in the grammar: ->${className}<-` +\n      `as it is not defined in any of the super grammars `;\n    errors.push({\n      message: errMsg,\n      type: ParserDefinitionErrorType.INVALID_RULE_OVERRIDE,\n      ruleName: ruleName,\n    });\n  }\n\n  return errors;\n}\n\nexport function validateNoLeftRecursion(\n  topRule: Rule,\n  currRule: Rule,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n  path: Rule[] = [],\n): IParserDefinitionError[] {\n  const errors: IParserDefinitionError[] = [];\n  const nextNonTerminals = getFirstNoneTerminal(currRule.definition);\n  if (nextNonTerminals.length === 0) {\n    return [];\n  } else {\n    const ruleName = topRule.name;\n    const foundLeftRecursion = nextNonTerminals.includes(topRule);\n    if (foundLeftRecursion) {\n      errors.push({\n        message: errMsgProvider.buildLeftRecursionError({\n          topLevelRule: topRule,\n          leftRecursionPath: path,\n        }),\n        type: ParserDefinitionErrorType.LEFT_RECURSION,\n        ruleName: ruleName,\n      });\n    }\n\n    // we are only looking for cyclic paths leading back to the specific topRule\n    // other cyclic paths are ignored, we still need this difference to avoid infinite loops...\n    const excluded = path.concat([topRule]);\n    const validNextSteps = nextNonTerminals.filter(\n      (x) => !excluded.includes(x),\n    );\n    const errorsFromNextSteps = validNextSteps.flatMap((currRefRule) => {\n      const newPath = [...path];\n      newPath.push(currRefRule);\n      return validateNoLeftRecursion(\n        topRule,\n        currRefRule,\n        errMsgProvider,\n        newPath,\n      );\n    });\n\n    return errors.concat(errorsFromNextSteps);\n  }\n}\n\nexport function getFirstNoneTerminal(definition: IProduction[]): Rule[] {\n  let result: Rule[] = [];\n  if (definition.length === 0) {\n    return result;\n  }\n  const firstProd = definition[0];\n\n  /* istanbul ignore else */\n  if (firstProd instanceof NonTerminal) {\n    result.push(firstProd.referencedRule);\n  } else if (\n    firstProd instanceof AlternativeGAST ||\n    firstProd instanceof Option ||\n    firstProd instanceof RepetitionMandatory ||\n    firstProd instanceof RepetitionMandatoryWithSeparator ||\n    firstProd instanceof RepetitionWithSeparator ||\n    firstProd instanceof Repetition\n  ) {\n    result = result.concat(\n      getFirstNoneTerminal(<IProduction[]>firstProd.definition),\n    );\n  } else if (firstProd instanceof Alternation) {\n    // each sub definition in alternation is a FLAT\n    result = firstProd.definition\n      .map((currSubDef) =>\n        getFirstNoneTerminal((<AlternativeGAST>currSubDef).definition),\n      )\n      .flat();\n  } else if (firstProd instanceof Terminal) {\n    // nothing to see, move along\n  } else {\n    throw Error(\"non exhaustive match\");\n  }\n\n  const isFirstOptional = isOptionalProd(firstProd);\n  const hasMore = definition.length > 1;\n  if (isFirstOptional && hasMore) {\n    const rest = definition.slice(1);\n    return result.concat(getFirstNoneTerminal(rest));\n  } else {\n    return result;\n  }\n}\n\nclass OrCollector extends GAstVisitor {\n  public alternations: Alternation[] = [];\n\n  public visitAlternation(node: Alternation): void {\n    this.alternations.push(node);\n  }\n}\n\nexport function validateEmptyOrAlternative(\n  topLevelRule: Rule,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserEmptyAlternativeDefinitionError[] {\n  const orCollector = new OrCollector();\n  topLevelRule.accept(orCollector);\n  const ors = orCollector.alternations;\n\n  const errors = ors.flatMap<IParserEmptyAlternativeDefinitionError>(\n    (currOr) => {\n      const exceptLast = currOr.definition.slice(0, -1);\n      return exceptLast.flatMap((currAlternative, currAltIdx) => {\n        const possibleFirstInAlt = nextPossibleTokensAfter(\n          [currAlternative],\n          [],\n          tokenStructuredMatcher,\n          1,\n        );\n        if (possibleFirstInAlt.length === 0) {\n          return [\n            {\n              message: errMsgProvider.buildEmptyAlternationError({\n                topLevelRule: topLevelRule,\n                alternation: currOr,\n                emptyChoiceIdx: currAltIdx,\n              }),\n              type: ParserDefinitionErrorType.NONE_LAST_EMPTY_ALT,\n              ruleName: topLevelRule.name,\n              occurrence: currOr.idx,\n              alternative: currAltIdx + 1,\n            },\n          ];\n        } else {\n          return [];\n        }\n      });\n    },\n  );\n\n  return errors;\n}\n\nexport function validateAmbiguousAlternationAlternatives(\n  topLevelRule: Rule,\n  globalMaxLookahead: number,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserAmbiguousAlternativesDefinitionError[] {\n  const orCollector = new OrCollector();\n  topLevelRule.accept(orCollector);\n  let ors = orCollector.alternations;\n\n  // New Handling of ignoring ambiguities\n  // - https://github.com/chevrotain/chevrotain/issues/869\n  ors = ors.filter((currOr) => currOr.ignoreAmbiguities !== true);\n\n  const errors = ors.flatMap((currOr: Alternation) => {\n    const currOccurrence = currOr.idx;\n    const actualMaxLookahead = currOr.maxLookahead || globalMaxLookahead;\n    const alternatives = getLookaheadPathsForOr(\n      currOccurrence,\n      topLevelRule,\n      actualMaxLookahead,\n      currOr,\n    );\n    const altsAmbiguityErrors = checkAlternativesAmbiguities(\n      alternatives,\n      currOr,\n      topLevelRule,\n      errMsgProvider,\n    );\n    const altsPrefixAmbiguityErrors = checkPrefixAlternativesAmbiguities(\n      alternatives,\n      currOr,\n      topLevelRule,\n      errMsgProvider,\n    );\n\n    return altsAmbiguityErrors.concat(altsPrefixAmbiguityErrors);\n  });\n\n  return errors;\n}\n\nexport class RepetitionCollector extends GAstVisitor {\n  public allProductions: (IProductionWithOccurrence & {\n    maxLookahead?: number;\n  })[] = [];\n\n  public visitRepetitionWithSeparator(manySep: RepetitionWithSeparator): void {\n    this.allProductions.push(manySep);\n  }\n\n  public visitRepetitionMandatory(atLeastOne: RepetitionMandatory): void {\n    this.allProductions.push(atLeastOne);\n  }\n\n  public visitRepetitionMandatoryWithSeparator(\n    atLeastOneSep: RepetitionMandatoryWithSeparator,\n  ): void {\n    this.allProductions.push(atLeastOneSep);\n  }\n\n  public visitRepetition(many: Repetition): void {\n    this.allProductions.push(many);\n  }\n}\n\nexport function validateTooManyAlts(\n  topLevelRule: Rule,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserDefinitionError[] {\n  const orCollector = new OrCollector();\n  topLevelRule.accept(orCollector);\n  const ors = orCollector.alternations;\n\n  const errors = ors.flatMap((currOr) => {\n    if (currOr.definition.length > 255) {\n      return [\n        {\n          message: errMsgProvider.buildTooManyAlternativesError({\n            topLevelRule: topLevelRule,\n            alternation: currOr,\n          }),\n          type: ParserDefinitionErrorType.TOO_MANY_ALTS,\n          ruleName: topLevelRule.name,\n          occurrence: currOr.idx,\n        },\n      ];\n    } else {\n      return [];\n    }\n  });\n\n  return errors;\n}\n\nexport function validateSomeNonEmptyLookaheadPath(\n  topLevelRules: Rule[],\n  maxLookahead: number,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserDefinitionError[] {\n  const errors: IParserDefinitionError[] = [];\n  topLevelRules.forEach((currTopRule) => {\n    const collectorVisitor = new RepetitionCollector();\n    currTopRule.accept(collectorVisitor);\n    const allRuleProductions = collectorVisitor.allProductions;\n    allRuleProductions.forEach((currProd) => {\n      const prodType = getProdType(currProd);\n      const actualMaxLookahead = currProd.maxLookahead || maxLookahead;\n      const currOccurrence = currProd.idx;\n      const paths = getLookaheadPathsForOptionalProd(\n        currOccurrence,\n        currTopRule,\n        prodType,\n        actualMaxLookahead,\n      );\n      const pathsInsideProduction = paths[0];\n      if (pathsInsideProduction.flat().length === 0) {\n        const errMsg = errMsgProvider.buildEmptyRepetitionError({\n          topLevelRule: currTopRule,\n          repetition: currProd,\n        });\n        errors.push({\n          message: errMsg,\n          type: ParserDefinitionErrorType.NO_NON_EMPTY_LOOKAHEAD,\n          ruleName: currTopRule.name,\n        });\n      }\n    });\n  });\n\n  return errors;\n}\n\nexport interface IAmbiguityDescriptor {\n  alts: number[];\n  path: TokenType[];\n}\n\nfunction checkAlternativesAmbiguities(\n  alternatives: Alternative[],\n  alternation: Alternation,\n  rule: Rule,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserAmbiguousAlternativesDefinitionError[] {\n  const foundAmbiguousPaths: Alternative = [];\n  const identicalAmbiguities = alternatives.reduce(\n    (result, currAlt, currAltIdx) => {\n      // ignore (skip) ambiguities with this alternative\n      if (alternation.definition[currAltIdx].ignoreAmbiguities === true) {\n        return result;\n      }\n\n      currAlt.forEach((currPath) => {\n        const altsCurrPathAppearsIn = [currAltIdx];\n        alternatives.forEach((currOtherAlt, currOtherAltIdx) => {\n          if (\n            currAltIdx !== currOtherAltIdx &&\n            containsPath(currOtherAlt, currPath) &&\n            // ignore (skip) ambiguities with this \"other\" alternative\n            alternation.definition[currOtherAltIdx].ignoreAmbiguities !== true\n          ) {\n            altsCurrPathAppearsIn.push(currOtherAltIdx);\n          }\n        });\n\n        if (\n          altsCurrPathAppearsIn.length > 1 &&\n          !containsPath(foundAmbiguousPaths, currPath)\n        ) {\n          foundAmbiguousPaths.push(currPath);\n          result.push({\n            alts: altsCurrPathAppearsIn,\n            path: currPath,\n          });\n        }\n      });\n      return result;\n    },\n    [] as { alts: number[]; path: TokenType[] }[],\n  );\n\n  const currErrors = identicalAmbiguities.map((currAmbDescriptor) => {\n    const ambgIndices = currAmbDescriptor.alts.map(\n      (currAltIdx) => currAltIdx + 1,\n    );\n\n    const currMessage = errMsgProvider.buildAlternationAmbiguityError({\n      topLevelRule: rule,\n      alternation: alternation,\n      ambiguityIndices: ambgIndices,\n      prefixPath: currAmbDescriptor.path,\n    });\n\n    return {\n      message: currMessage,\n      type: ParserDefinitionErrorType.AMBIGUOUS_ALTS,\n      ruleName: rule.name,\n      occurrence: alternation.idx,\n      alternatives: currAmbDescriptor.alts,\n    };\n  });\n\n  return currErrors;\n}\n\nexport function checkPrefixAlternativesAmbiguities(\n  alternatives: Alternative[],\n  alternation: Alternation,\n  rule: Rule,\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserAmbiguousAlternativesDefinitionError[] {\n  // flatten\n  const pathsAndIndices = alternatives.reduce(\n    (result, currAlt, idx) => {\n      const currPathsAndIdx = currAlt.map((currPath) => {\n        return { idx: idx, path: currPath };\n      });\n      return result.concat(currPathsAndIdx);\n    },\n    [] as { idx: number; path: TokenType[] }[],\n  );\n\n  const errors = pathsAndIndices.flatMap((currPathAndIdx) => {\n    const alternativeGast = alternation.definition[currPathAndIdx.idx];\n    // ignore (skip) ambiguities with this alternative\n    if (alternativeGast.ignoreAmbiguities === true) {\n      return [];\n    }\n    const targetIdx = currPathAndIdx.idx;\n    const targetPath = currPathAndIdx.path;\n\n    const prefixAmbiguitiesPathsAndIndices = pathsAndIndices.filter(\n      (searchPathAndIdx) => {\n        // prefix ambiguity can only be created from lower idx (higher priority) path\n        return (\n          // ignore (skip) ambiguities with this \"other\" alternative\n          alternation.definition[searchPathAndIdx.idx].ignoreAmbiguities !==\n            true &&\n          searchPathAndIdx.idx < targetIdx &&\n          // checking for strict prefix because identical lookaheads\n          // will be be detected using a different validation.\n          isStrictPrefixOfPath(searchPathAndIdx.path, targetPath)\n        );\n      },\n    );\n\n    const currPathPrefixErrors = prefixAmbiguitiesPathsAndIndices.map(\n      (currAmbPathAndIdx): IParserAmbiguousAlternativesDefinitionError => {\n        const ambgIndices = [currAmbPathAndIdx.idx + 1, targetIdx + 1];\n        const occurrence = alternation.idx === 0 ? \"\" : alternation.idx;\n\n        const message = errMsgProvider.buildAlternationPrefixAmbiguityError({\n          topLevelRule: rule,\n          alternation: alternation,\n          ambiguityIndices: ambgIndices,\n          prefixPath: currAmbPathAndIdx.path,\n        });\n        return {\n          message: message,\n          type: ParserDefinitionErrorType.AMBIGUOUS_PREFIX_ALTS,\n          ruleName: rule.name,\n          occurrence: occurrence,\n          alternatives: ambgIndices,\n        };\n      },\n    );\n\n    return currPathPrefixErrors;\n  });\n\n  return errors;\n}\n\nfunction checkTerminalAndNoneTerminalsNameSpace(\n  topLevels: Rule[],\n  tokenTypes: TokenType[],\n  errMsgProvider: IGrammarValidatorErrorMessageProvider,\n): IParserDefinitionError[] {\n  const errors: IParserDefinitionError[] = [];\n\n  const tokenNames = tokenTypes.map((currToken) => currToken.name);\n\n  topLevels.forEach((currRule) => {\n    const currRuleName = currRule.name;\n    if (tokenNames.includes(currRuleName)) {\n      const errMsg = errMsgProvider.buildNamespaceConflictError(currRule);\n\n      errors.push({\n        message: errMsg,\n        type: ParserDefinitionErrorType.CONFLICT_TOKENS_RULES_NAMESPACE,\n        ruleName: currRuleName,\n      });\n    }\n  });\n\n  return errors;\n}\n", "import { Rule } from \"@chevrotain/gast\";\nimport { resolveGrammar as orgResolveGrammar } from \"../resolver.js\";\nimport { validateGrammar as orgValidateGrammar } from \"../checks.js\";\nimport {\n  defaultGrammarResolverErrorProvider,\n  defaultGrammarValidatorErrorProvider,\n} from \"../../errors_public.js\";\nimport { TokenType } from \"@chevrotain/types\";\nimport {\n  IGrammarResolverErrorMessageProvider,\n  IGrammarValidatorErrorMessageProvider,\n  IParserDefinitionError,\n} from \"../types.js\";\n\ntype ResolveGrammarOpts = {\n  rules: Rule[];\n  errMsgProvider?: IGrammarResolverErrorMessageProvider;\n};\nexport function resolveGrammar(\n  options: ResolveGrammarOpts,\n): IParserDefinitionError[] {\n  const actualOptions: Required<ResolveGrammarOpts> = {\n    errMsgProvider: defaultGrammarResolverErrorProvider,\n    ...options,\n  };\n\n  const topRulesTable: { [ruleName: string]: Rule } = {};\n  options.rules.forEach((rule) => {\n    topRulesTable[rule.name] = rule;\n  });\n  return orgResolveGrammar(topRulesTable, actualOptions.errMsgProvider);\n}\n\nexport function validateGrammar(options: {\n  rules: Rule[];\n  tokenTypes: TokenType[];\n  grammarName: string;\n  errMsgProvider?: IGrammarValidatorErrorMessageProvider;\n}): IParserDefinitionError[] {\n  const errMsgProvider =\n    options.errMsgProvider ?? defaultGrammarValidatorErrorProvider;\n\n  return orgValidateGrammar(\n    options.rules,\n    options.tokenTypes,\n    errMsgProvider,\n    options.grammarName,\n  );\n}\n", "import {\n  IRecognitionException,\n  IRecognizerContext,\n  IToken,\n} from \"@chevrotain/types\";\n\nconst MISMATCHED_TOKEN_EXCEPTION = \"MismatchedTokenException\";\nconst NO_VIABLE_ALT_EXCEPTION = \"NoViableAltException\";\nconst EARLY_EXIT_EXCEPTION = \"EarlyExitException\";\nconst NOT_ALL_INPUT_PARSED_EXCEPTION = \"NotAllInputParsedException\";\n\nconst RECOGNITION_EXCEPTION_NAMES = [\n  MISMATCHED_TOKEN_EXCEPTION,\n  NO_VIABLE_ALT_EXCEPTION,\n  EARLY_EXIT_EXCEPTION,\n  NOT_ALL_INPUT_PARSED_EXCEPTION,\n];\n\nObject.freeze(RECOGNITION_EXCEPTION_NAMES);\n\n// hacks to bypass no support for custom Errors in javascript/typescript\nexport function isRecognitionException(error: Error) {\n  // can't do instanceof on hacked custom js exceptions\n  return RECOGNITION_EXCEPTION_NAMES.includes(error.name);\n}\n\nabstract class RecognitionException\n  extends Error\n  implements IRecognitionException\n{\n  context: IRecognizerContext;\n  resyncedTokens: IToken[] = [];\n\n  protected constructor(\n    message: string,\n    public token: IToken,\n  ) {\n    super(message);\n\n    // fix prototype chain when typescript target is ES5\n    Object.setPrototypeOf(this, new.target.prototype);\n\n    /* istanbul ignore next - V8 workaround to remove constructor from stacktrace when typescript target is ES5 */\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, this.constructor);\n    }\n  }\n}\n\nexport class MismatchedTokenException extends RecognitionException {\n  constructor(\n    message: string,\n    token: IToken,\n    public previousToken: IToken,\n  ) {\n    super(message, token);\n    this.name = MISMATCHED_TOKEN_EXCEPTION;\n  }\n}\n\nexport class NoViableAltException extends RecognitionException {\n  constructor(\n    message: string,\n    token: IToken,\n    public previousToken: IToken,\n  ) {\n    super(message, token);\n    this.name = NO_VIABLE_ALT_EXCEPTION;\n  }\n}\n\nexport class NotAllInputParsedException extends RecognitionException {\n  constructor(message: string, token: IToken) {\n    super(message, token);\n    this.name = NOT_ALL_INPUT_PARSED_EXCEPTION;\n  }\n}\n\nexport class EarlyExitException extends RecognitionException {\n  constructor(\n    message: string,\n    token: IToken,\n    public previousToken: IToken,\n  ) {\n    super(message, token);\n    this.name = EARLY_EXIT_EXCEPTION;\n  }\n}\n", "import {\n  createTokenInstance,\n  EOF,\n  tokenMatcher,\n} from \"../../../scan/tokens_public.js\";\nimport {\n  AbstractNextTerminalAfterProductionWalker,\n  IFirstAfterRepetition,\n  NextAfterTokenWalker,\n} from \"../../grammar/interpreter.js\";\n\nimport {\n  IParserConfig,\n  IToken,\n  ITokenGrammarPath,\n  TokenType,\n} from \"@chevrotain/types\";\nimport { MismatchedTokenException } from \"../../exceptions_public.js\";\nimport { IN } from \"../../constants.js\";\nimport { MixedInParser } from \"./parser_traits.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n\nexport const EOF_FOLLOW_KEY: any = {};\n\nexport interface IFollowKey {\n  ruleName: string;\n  idxInCallingRule: number;\n  inRule: string;\n}\n\nexport const IN_RULE_RECOVERY_EXCEPTION = \"InRuleRecoveryException\";\n\nexport class InRuleRecoveryException extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = IN_RULE_RECOVERY_EXCEPTION;\n  }\n}\n\n/**\n * This trait is responsible for the error recovery and fault tolerant logic\n */\nexport class Recoverable {\n  recoveryEnabled: boolean;\n  firstAfterRepMap: Record<string, IFirstAfterRepetition>;\n  resyncFollows: Record<string, TokenType[]>;\n\n  initRecoverable(config: IParserConfig) {\n    this.firstAfterRepMap = {};\n    this.resyncFollows = {};\n\n    this.recoveryEnabled = Object.hasOwn(config, \"recoveryEnabled\")\n      ? (config.recoveryEnabled as boolean) // assumes end user provides the correct config value/type\n      : DEFAULT_PARSER_CONFIG.recoveryEnabled;\n\n    // performance optimization, NOOP will be inlined which\n    // effectively means that this optional feature does not exist\n    // when not used.\n    if (this.recoveryEnabled) {\n      this.attemptInRepetitionRecovery = attemptInRepetitionRecovery;\n    }\n  }\n\n  public getTokenToInsert(tokType: TokenType): IToken {\n    const tokToInsert = createTokenInstance(\n      tokType,\n      \"\",\n      NaN,\n      NaN,\n      NaN,\n      NaN,\n      NaN,\n      NaN,\n    );\n    tokToInsert.isInsertedInRecovery = true;\n    return tokToInsert;\n  }\n\n  public canTokenTypeBeInsertedInRecovery(tokType: TokenType): boolean {\n    return true;\n  }\n\n  public canTokenTypeBeDeletedInRecovery(tokType: TokenType): boolean {\n    return true;\n  }\n\n  tryInRepetitionRecovery(\n    this: MixedInParser,\n    grammarRule: Function,\n    grammarRuleArgs: any[],\n    lookAheadFunc: () => boolean,\n    expectedTokType: TokenType,\n  ): void {\n    // TODO: can the resyncTokenType be cached?\n    const reSyncTokType = this.findReSyncTokenType();\n    const savedLexerState = this.exportLexerState();\n    const resyncedTokens: IToken[] = [];\n    let passedResyncPoint = false;\n\n    const nextTokenWithoutResync = this.LA_FAST(1);\n    let currToken = this.LA_FAST(1);\n\n    const generateErrorMessage = () => {\n      const previousToken = this.LA(0);\n      // we are preemptively re-syncing before an error has been detected, therefor we must reproduce\n      // the error that would have been thrown\n      const msg = this.errorMessageProvider.buildMismatchTokenMessage({\n        expected: expectedTokType,\n        actual: nextTokenWithoutResync,\n        previous: previousToken,\n        ruleName: this.getCurrRuleFullName(),\n      });\n      const error = new MismatchedTokenException(\n        msg,\n        nextTokenWithoutResync,\n        this.LA(0),\n      );\n      // the first token here will be the original cause of the error, this is not part of the resyncedTokens property.\n      error.resyncedTokens = resyncedTokens.slice(0, -1);\n      this.SAVE_ERROR(error);\n    };\n\n    while (!passedResyncPoint) {\n      // re-synced to a point where we can safely exit the repetition/\n      if (this.tokenMatcher(currToken, expectedTokType)) {\n        generateErrorMessage();\n        return; // must return here to avoid reverting the inputIdx\n      } else if (lookAheadFunc.call(this)) {\n        // we skipped enough tokens so we can resync right back into another iteration of the repetition grammar rule\n        generateErrorMessage();\n        // recursive invocation in other to support multiple re-syncs in the same top level repetition grammar rule\n        grammarRule.apply(this, grammarRuleArgs);\n        return; // must return here to avoid reverting the inputIdx\n      } else if (this.tokenMatcher(currToken, reSyncTokType)) {\n        passedResyncPoint = true;\n      } else {\n        currToken = this.SKIP_TOKEN();\n        this.addToResyncTokens(currToken, resyncedTokens);\n      }\n    }\n\n    // we were unable to find a CLOSER point to resync inside the Repetition, reset the state.\n    // The parsing exception we were trying to prevent will happen in the NEXT parsing step. it may be handled by\n    // \"between rules\" resync recovery later in the flow.\n    this.importLexerState(savedLexerState);\n  }\n\n  shouldInRepetitionRecoveryBeTried(\n    this: MixedInParser,\n    expectTokAfterLastMatch: TokenType,\n    nextTokIdx: number,\n    notStuck: boolean | undefined,\n  ): boolean {\n    // Edge case of arriving from a MANY repetition which is stuck\n    // Attempting recovery in this case could cause an infinite loop\n    if (notStuck === false) {\n      return false;\n    }\n\n    // no need to recover, next token is what we expect...\n    if (this.tokenMatcher(this.LA_FAST(1), expectTokAfterLastMatch)) {\n      return false;\n    }\n\n    // error recovery is disabled during backtracking as it can make the parser ignore a valid grammar path\n    // and prefer some backtracking path that includes recovered errors.\n    if (this.isBackTracking()) {\n      return false;\n    }\n\n    // if we can perform inRule recovery (single token insertion or deletion) we always prefer that recovery algorithm\n    // because if it works, it makes the least amount of changes to the input stream (greedy algorithm)\n    //noinspection RedundantIfStatementJS\n    if (\n      this.canPerformInRuleRecovery(\n        expectTokAfterLastMatch,\n        this.getFollowsForInRuleRecovery(expectTokAfterLastMatch, nextTokIdx),\n      )\n    ) {\n      return false;\n    }\n\n    return true;\n  }\n\n  // TODO: should this be a member method or a utility? it does not have any state or usage of 'this'...\n  // TODO: should this be more explicitly part of the public API?\n  getNextPossibleTokenTypes(\n    this: MixedInParser,\n    grammarPath: ITokenGrammarPath,\n  ): TokenType[] {\n    const topRuleName = grammarPath.ruleStack[0]!;\n    const gastProductions = this.getGAstProductions();\n    const topProduction = gastProductions[topRuleName];\n    const nextPossibleTokenTypes = new NextAfterTokenWalker(\n      topProduction,\n      grammarPath,\n    ).startWalking();\n    return nextPossibleTokenTypes;\n  }\n\n  // Error Recovery functionality\n  getFollowsForInRuleRecovery(\n    this: MixedInParser,\n    tokType: TokenType,\n    tokIdxInRule: number,\n  ): TokenType[] {\n    const grammarPath = this.getCurrentGrammarPath(tokType, tokIdxInRule);\n    const follows = this.getNextPossibleTokenTypes(grammarPath);\n    return follows;\n  }\n\n  tryInRuleRecovery(\n    this: MixedInParser,\n    expectedTokType: TokenType,\n    follows: TokenType[],\n  ): IToken {\n    if (this.canRecoverWithSingleTokenInsertion(expectedTokType, follows)) {\n      const tokToInsert = this.getTokenToInsert(expectedTokType);\n      return tokToInsert;\n    }\n\n    if (this.canRecoverWithSingleTokenDeletion(expectedTokType)) {\n      const nextTok = this.SKIP_TOKEN();\n      this.consumeToken();\n      return nextTok;\n    }\n\n    throw new InRuleRecoveryException(\"sad sad panda\");\n  }\n\n  canPerformInRuleRecovery(\n    this: MixedInParser,\n    expectedToken: TokenType,\n    follows: TokenType[],\n  ): boolean {\n    return (\n      this.canRecoverWithSingleTokenInsertion(expectedToken, follows) ||\n      this.canRecoverWithSingleTokenDeletion(expectedToken)\n    );\n  }\n\n  canRecoverWithSingleTokenInsertion(\n    this: MixedInParser,\n    expectedTokType: TokenType,\n    follows: TokenType[],\n  ): boolean {\n    if (!this.canTokenTypeBeInsertedInRecovery(expectedTokType)) {\n      return false;\n    }\n\n    // must know the possible following tokens to perform single token insertion\n    if (follows.length === 0) {\n      return false;\n    }\n\n    const mismatchedTok = this.LA_FAST(1);\n    const isMisMatchedTokInFollows =\n      follows.find((possibleFollowsTokType: TokenType) => {\n        return this.tokenMatcher(mismatchedTok, possibleFollowsTokType);\n      }) !== undefined;\n\n    return isMisMatchedTokInFollows;\n  }\n\n  canRecoverWithSingleTokenDeletion(\n    this: MixedInParser,\n    expectedTokType: TokenType,\n  ): boolean {\n    if (!this.canTokenTypeBeDeletedInRecovery(expectedTokType)) {\n      return false;\n    }\n\n    const isNextTokenWhatIsExpected = this.tokenMatcher(\n      // not using LA_FAST because LA(2) might be un-safe with maxLookahead=1\n      // in some edge cases (?)\n      this.LA(2),\n      expectedTokType,\n    );\n    return isNextTokenWhatIsExpected;\n  }\n\n  isInCurrentRuleReSyncSet(\n    this: MixedInParser,\n    tokenTypeIdx: TokenType,\n  ): boolean {\n    const followKey = this.getCurrFollowKey();\n    const currentRuleReSyncSet = this.getFollowSetFromFollowKey(followKey);\n    return currentRuleReSyncSet.includes(tokenTypeIdx);\n  }\n\n  findReSyncTokenType(this: MixedInParser): TokenType {\n    const allPossibleReSyncTokTypes = this.flattenFollowSet();\n    // this loop will always terminate as EOF is always in the follow stack and also always (virtually) in the input\n    let nextToken = this.LA_FAST(1);\n    let k = 2;\n    while (true) {\n      const foundMatch = allPossibleReSyncTokTypes.find((resyncTokType) => {\n        const canMatch = tokenMatcher(nextToken, resyncTokType);\n        return canMatch;\n      });\n      if (foundMatch !== undefined) {\n        return foundMatch;\n      }\n      nextToken = this.LA(k);\n      k++;\n    }\n  }\n\n  getCurrFollowKey(this: MixedInParser): IFollowKey {\n    // the length is at least one as we always add the ruleName to the stack before invoking the rule.\n    if (this.RULE_STACK_IDX === 0) {\n      return EOF_FOLLOW_KEY;\n    }\n    const currRuleShortName = this.currRuleShortName;\n    const currRuleIdx = this.getLastExplicitRuleOccurrenceIndex();\n    const prevRuleShortName = this.getPreviousExplicitRuleShortName();\n\n    return {\n      ruleName: this.shortRuleNameToFullName(currRuleShortName),\n      idxInCallingRule: currRuleIdx,\n      inRule: this.shortRuleNameToFullName(prevRuleShortName),\n    };\n  }\n\n  buildFullFollowKeyStack(this: MixedInParser): IFollowKey[] {\n    const explicitRuleStack = this.RULE_STACK;\n    const explicitOccurrenceStack = this.RULE_OCCURRENCE_STACK;\n    const len = this.RULE_STACK_IDX + 1;\n\n    const result: IFollowKey[] = new Array(len);\n    for (let idx = 0; idx < len; idx++) {\n      if (idx === 0) {\n        result[idx] = EOF_FOLLOW_KEY;\n      } else {\n        result[idx] = {\n          ruleName: this.shortRuleNameToFullName(explicitRuleStack[idx]),\n          idxInCallingRule: explicitOccurrenceStack[idx],\n          inRule: this.shortRuleNameToFullName(explicitRuleStack[idx - 1]),\n        };\n      }\n    }\n    return result;\n  }\n\n  flattenFollowSet(this: MixedInParser): TokenType[] {\n    const followStack = this.buildFullFollowKeyStack().map((currKey) => {\n      return this.getFollowSetFromFollowKey(currKey);\n    });\n    return <any>followStack.flat();\n  }\n\n  getFollowSetFromFollowKey(\n    this: MixedInParser,\n    followKey: IFollowKey,\n  ): TokenType[] {\n    if (followKey === EOF_FOLLOW_KEY) {\n      return [EOF];\n    }\n\n    const followName =\n      followKey.ruleName + followKey.idxInCallingRule + IN + followKey.inRule;\n\n    return this.resyncFollows[followName];\n  }\n\n  // It does not make any sense to include a virtual EOF token in the list of resynced tokens\n  // as EOF does not really exist and thus does not contain any useful information (line/column numbers)\n  addToResyncTokens(\n    this: MixedInParser,\n    token: IToken,\n    resyncTokens: IToken[],\n  ): IToken[] {\n    if (!this.tokenMatcher(token, EOF)) {\n      resyncTokens.push(token);\n    }\n    return resyncTokens;\n  }\n\n  reSyncTo(this: MixedInParser, tokType: TokenType): IToken[] {\n    const resyncedTokens: IToken[] = [];\n    let nextTok = this.LA_FAST(1);\n    while (this.tokenMatcher(nextTok, tokType) === false) {\n      nextTok = this.SKIP_TOKEN();\n      this.addToResyncTokens(nextTok, resyncedTokens);\n    }\n    // the last token is not part of the error.\n    return resyncedTokens.slice(0, -1);\n  }\n\n  attemptInRepetitionRecovery(\n    this: MixedInParser,\n    prodFunc: Function,\n    args: any[],\n    lookaheadFunc: () => boolean,\n    dslMethodIdx: number,\n    prodOccurrence: number,\n    nextToksWalker: typeof AbstractNextTerminalAfterProductionWalker,\n    notStuck?: boolean,\n  ): void {\n    // by default this is a NO-OP\n    // The actual implementation is with the function(not method) below\n  }\n\n  getCurrentGrammarPath(\n    this: MixedInParser,\n    tokType: TokenType,\n    tokIdxInRule: number,\n  ): ITokenGrammarPath {\n    const pathRuleStack: string[] = this.getHumanReadableRuleStack();\n    const pathOccurrenceStack: number[] = this.RULE_OCCURRENCE_STACK.slice(\n      0,\n      this.RULE_OCCURRENCE_STACK_IDX + 1,\n    );\n    const grammarPath: any = {\n      ruleStack: pathRuleStack,\n      occurrenceStack: pathOccurrenceStack,\n      lastTok: tokType,\n      lastTokOccurrence: tokIdxInRule,\n    };\n\n    return grammarPath;\n  }\n  getHumanReadableRuleStack(this: MixedInParser): string[] {\n    const len = this.RULE_STACK_IDX + 1;\n    const result: string[] = new Array(len);\n    for (let i = 0; i < len; i++) {\n      result[i] = this.shortRuleNameToFullName(this.RULE_STACK[i]);\n    }\n    return result;\n  }\n}\n\nexport function attemptInRepetitionRecovery(\n  this: MixedInParser,\n  prodFunc: Function,\n  args: any[],\n  lookaheadFunc: () => boolean,\n  dslMethodIdx: number,\n  prodOccurrence: number,\n  nextToksWalker: typeof AbstractNextTerminalAfterProductionWalker,\n  notStuck?: boolean,\n): void {\n  const key = this.getKeyForAutomaticLookahead(dslMethodIdx, prodOccurrence);\n  let firstAfterRepInfo = this.firstAfterRepMap[key];\n  if (firstAfterRepInfo === undefined) {\n    const currRuleName = this.getCurrRuleFullName();\n    const ruleGrammar = this.getGAstProductions()[currRuleName];\n    const walker: AbstractNextTerminalAfterProductionWalker =\n      new nextToksWalker(ruleGrammar, prodOccurrence);\n    firstAfterRepInfo = walker.startWalking();\n    this.firstAfterRepMap[key] = firstAfterRepInfo;\n  }\n\n  let expectTokAfterLastMatch = firstAfterRepInfo.token;\n  let nextTokIdx = firstAfterRepInfo.occurrence;\n  const isEndOfRule = firstAfterRepInfo.isEndOfRule;\n\n  // special edge case of a TOP most repetition after which the input should END.\n  // this will force an attempt for inRule recovery in that scenario.\n  if (\n    this.RULE_STACK_IDX === 0 &&\n    isEndOfRule &&\n    expectTokAfterLastMatch === undefined\n  ) {\n    expectTokAfterLastMatch = EOF;\n    nextTokIdx = 1;\n  }\n\n  // We don't have anything to re-sync to...\n  // this condition was extracted from `shouldInRepetitionRecoveryBeTried` to act as a type-guard\n  if (expectTokAfterLastMatch === undefined || nextTokIdx === undefined) {\n    return;\n  }\n\n  if (\n    this.shouldInRepetitionRecoveryBeTried(\n      expectTokAfterLastMatch,\n      nextTokIdx,\n      notStuck,\n    )\n  ) {\n    // TODO: performance optimization: instead of passing the original args here, we modify\n    // the args param (or create a new one) and make sure the lookahead func is explicitly provided\n    // to avoid searching the cache for it once more.\n    this.tryInRepetitionRecovery(\n      prodFunc,\n      args,\n      lookaheadFunc,\n      expectTokAfterLastMatch,\n    );\n  }\n}\n", "// Lookahead keys are 32Bit integers in the form\n// TTTTTTTT-ZZZZZZZZZZZZ-YYYY-XXXXXXXX\n// XXXX -> Occurrence Index bitmap.\n// YYYY -> DSL Method Type bitmap.\n// ZZZZZZZZZZZZZZZ -> Rule short Index bitmap.\n// TTTTTTTTT -> alternation alternative index bitmap\n\nexport const BITS_FOR_METHOD_TYPE = 4;\nexport const BITS_FOR_OCCURRENCE_IDX = 8;\nexport const BITS_FOR_RULE_IDX = 12;\n// TODO: validation, this means that there may at most 2^8 --> 256 alternatives for an alternation.\nexport const BITS_FOR_ALT_IDX = 8;\n\n// short string used as part of mapping keys.\n// being short improves the performance when composing KEYS for maps out of these\n// The 5 - 8 bits (16 possible values, are reserved for the DSL method indices)\nexport const OR_IDX = 1 << BITS_FOR_OCCURRENCE_IDX;\nexport const OPTION_IDX = 2 << BITS_FOR_OCCURRENCE_IDX;\nexport const MANY_IDX = 3 << BITS_FOR_OCCURRENCE_IDX;\nexport const AT_LEAST_ONE_IDX = 4 << BITS_FOR_OCCURRENCE_IDX;\nexport const MANY_SEP_IDX = 5 << BITS_FOR_OCCURRENCE_IDX;\nexport const AT_LEAST_ONE_SEP_IDX = 6 << BITS_FOR_OCCURRENCE_IDX;\n\n// this actually returns a number, but it is always used as a string (object prop key)\nexport function getKeyForAutomaticLookahead(\n  ruleIdx: number,\n  dslMethodIdx: number,\n  occurrence: number,\n): number {\n  return occurrence | dslMethodIdx | ruleIdx;\n}\n\nconst BITS_START_FOR_ALT_IDX = 32 - BITS_FOR_ALT_IDX;\n", "import {\n  ILookaheadStrategy,\n  ILookaheadValidationError,\n  IOrAlt,\n  OptionalProductionType,\n  Rule,\n  TokenType,\n} from \"@chevrotain/types\";\nimport { defaultGrammarValidatorErrorProvider } from \"../errors_public.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser/parser.js\";\nimport {\n  validateAmbiguousAlternationAlternatives,\n  validateEmptyOrAlternative,\n  validateNoLeftRecursion,\n  validateSomeNonEmptyLookaheadPath,\n} from \"./checks.js\";\nimport {\n  buildAlternativesLookAheadFunc,\n  buildLookaheadFuncForOptionalProd,\n  buildLookaheadFuncForOr,\n  buildSingleAlternativeLookaheadFunction,\n  getProdType,\n} from \"./lookahead.js\";\nimport { IParserDefinitionError } from \"./types.js\";\n\nexport class LLkLookaheadStrategy implements ILookaheadStrategy {\n  readonly maxLookahead: number;\n\n  constructor(options?: { maxLookahead?: number }) {\n    this.maxLookahead =\n      options?.maxLookahead ?? DEFAULT_PARSER_CONFIG.maxLookahead;\n  }\n\n  validate(options: {\n    rules: Rule[];\n    tokenTypes: TokenType[];\n    grammarName: string;\n  }): ILookaheadValidationError[] {\n    const leftRecursionErrors = this.validateNoLeftRecursion(options.rules);\n\n    if (leftRecursionErrors.length === 0) {\n      const emptyAltErrors = this.validateEmptyOrAlternatives(options.rules);\n      const ambiguousAltsErrors = this.validateAmbiguousAlternationAlternatives(\n        options.rules,\n        this.maxLookahead,\n      );\n      const emptyRepetitionErrors = this.validateSomeNonEmptyLookaheadPath(\n        options.rules,\n        this.maxLookahead,\n      );\n      const allErrors = [\n        ...leftRecursionErrors,\n        ...emptyAltErrors,\n        ...ambiguousAltsErrors,\n        ...emptyRepetitionErrors,\n      ];\n      return allErrors;\n    }\n    return leftRecursionErrors;\n  }\n\n  validateNoLeftRecursion(rules: Rule[]): IParserDefinitionError[] {\n    return rules.flatMap((currTopRule) =>\n      validateNoLeftRecursion(\n        currTopRule,\n        currTopRule,\n        defaultGrammarValidatorErrorProvider,\n      ),\n    );\n  }\n\n  validateEmptyOrAlternatives(rules: Rule[]): IParserDefinitionError[] {\n    return rules.flatMap((currTopRule) =>\n      validateEmptyOrAlternative(\n        currTopRule,\n        defaultGrammarValidatorErrorProvider,\n      ),\n    );\n  }\n\n  validateAmbiguousAlternationAlternatives(\n    rules: Rule[],\n    maxLookahead: number,\n  ): IParserDefinitionError[] {\n    return rules.flatMap((currTopRule) =>\n      validateAmbiguousAlternationAlternatives(\n        currTopRule,\n        maxLookahead,\n        defaultGrammarValidatorErrorProvider,\n      ),\n    );\n  }\n\n  validateSomeNonEmptyLookaheadPath(\n    rules: Rule[],\n    maxLookahead: number,\n  ): IParserDefinitionError[] {\n    return validateSomeNonEmptyLookaheadPath(\n      rules,\n      maxLookahead,\n      defaultGrammarValidatorErrorProvider,\n    );\n  }\n\n  buildLookaheadForAlternation(options: {\n    prodOccurrence: number;\n    rule: Rule;\n    maxLookahead: number;\n    hasPredicates: boolean;\n    dynamicTokensEnabled: boolean;\n  }): (orAlts?: IOrAlt<any>[] | undefined) => number | undefined {\n    return buildLookaheadFuncForOr(\n      options.prodOccurrence,\n      options.rule,\n      options.maxLookahead,\n      options.hasPredicates,\n      options.dynamicTokensEnabled,\n      buildAlternativesLookAheadFunc,\n    );\n  }\n\n  buildLookaheadForOptional(options: {\n    prodOccurrence: number;\n    prodType: OptionalProductionType;\n    rule: Rule;\n    maxLookahead: number;\n    dynamicTokensEnabled: boolean;\n  }): () => boolean {\n    return buildLookaheadFuncForOptionalProd(\n      options.prodOccurrence,\n      options.rule,\n      options.maxLookahead,\n      options.dynamicTokensEnabled,\n      getProdType(options.prodType),\n      buildSingleAlternativeLookaheadFunction,\n    );\n  }\n}\n", "import { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\nimport {\n  ILookaheadStrategy,\n  IParserConfig,\n  OptionalProductionType,\n} from \"@chevrotain/types\";\nimport {\n  AT_LEAST_ONE_IDX,\n  AT_LEAST_ONE_SEP_IDX,\n  getKeyForAutomaticLookahead,\n  MANY_IDX,\n  MANY_SEP_IDX,\n  OPTION_IDX,\n  OR_IDX,\n} from \"../../grammar/keys.js\";\nimport { MixedInParser } from \"./parser_traits.js\";\nimport {\n  Alternation,\n  GAstVisitor,\n  getProductionDslName,\n  Option,\n  Repetition,\n  RepetitionMandatory,\n  RepetitionMandatoryWithSeparator,\n  RepetitionWithSeparator,\n  Rule,\n} from \"@chevrotain/gast\";\nimport { LLkLookaheadStrategy } from \"../../grammar/llk_lookahead.js\";\n\n/**\n * Trait responsible for the lookahead related utilities and optimizations.\n */\nexport class LooksAhead {\n  maxLookahead: number;\n  lookAheadFuncsCache: any;\n  dynamicTokensEnabled: boolean;\n  lookaheadStrategy: ILookaheadStrategy;\n\n  initLooksAhead(config: IParserConfig) {\n    this.dynamicTokensEnabled = Object.hasOwn(config, \"dynamicTokensEnabled\")\n      ? (config.dynamicTokensEnabled as boolean) // assumes end user provides the correct config value/type\n      : DEFAULT_PARSER_CONFIG.dynamicTokensEnabled;\n\n    this.maxLookahead = Object.hasOwn(config, \"maxLookahead\")\n      ? (config.maxLookahead as number) // assumes end user provides the correct config value/type\n      : DEFAULT_PARSER_CONFIG.maxLookahead;\n\n    this.lookaheadStrategy = Object.hasOwn(config, \"lookaheadStrategy\")\n      ? (config.lookaheadStrategy as ILookaheadStrategy) // assumes end user provides the correct config value/type\n      : new LLkLookaheadStrategy({ maxLookahead: this.maxLookahead });\n\n    this.lookAheadFuncsCache = new Map();\n  }\n\n  preComputeLookaheadFunctions(this: MixedInParser, rules: Rule[]): void {\n    rules.forEach((currRule) => {\n      this.TRACE_INIT(`${currRule.name} Rule Lookahead`, () => {\n        const {\n          alternation,\n          repetition,\n          option,\n          repetitionMandatory,\n          repetitionMandatoryWithSeparator,\n          repetitionWithSeparator,\n        } = collectMethods(currRule);\n\n        alternation.forEach((currProd) => {\n          const prodIdx = currProd.idx === 0 ? \"\" : currProd.idx;\n          this.TRACE_INIT(`${getProductionDslName(currProd)}${prodIdx}`, () => {\n            const laFunc = this.lookaheadStrategy.buildLookaheadForAlternation({\n              prodOccurrence: currProd.idx,\n              rule: currRule,\n              maxLookahead: currProd.maxLookahead || this.maxLookahead,\n              hasPredicates: currProd.hasPredicates,\n              dynamicTokensEnabled: this.dynamicTokensEnabled,\n            });\n\n            const key = getKeyForAutomaticLookahead(\n              this.fullRuleNameToShort[currRule.name],\n              OR_IDX,\n              currProd.idx,\n            );\n            this.setLaFuncCache(key, laFunc);\n          });\n        });\n\n        repetition.forEach((currProd) => {\n          this.computeLookaheadFunc(\n            currRule,\n            currProd.idx,\n            MANY_IDX,\n            \"Repetition\",\n            currProd.maxLookahead,\n            getProductionDslName(currProd),\n          );\n        });\n\n        option.forEach((currProd) => {\n          this.computeLookaheadFunc(\n            currRule,\n            currProd.idx,\n            OPTION_IDX,\n            \"Option\",\n            currProd.maxLookahead,\n            getProductionDslName(currProd),\n          );\n        });\n\n        repetitionMandatory.forEach((currProd) => {\n          this.computeLookaheadFunc(\n            currRule,\n            currProd.idx,\n            AT_LEAST_ONE_IDX,\n            \"RepetitionMandatory\",\n            currProd.maxLookahead,\n            getProductionDslName(currProd),\n          );\n        });\n\n        repetitionMandatoryWithSeparator.forEach((currProd) => {\n          this.computeLookaheadFunc(\n            currRule,\n            currProd.idx,\n            AT_LEAST_ONE_SEP_IDX,\n            \"RepetitionMandatoryWithSeparator\",\n            currProd.maxLookahead,\n            getProductionDslName(currProd),\n          );\n        });\n\n        repetitionWithSeparator.forEach((currProd) => {\n          this.computeLookaheadFunc(\n            currRule,\n            currProd.idx,\n            MANY_SEP_IDX,\n            \"RepetitionWithSeparator\",\n            currProd.maxLookahead,\n            getProductionDslName(currProd),\n          );\n        });\n      });\n    });\n  }\n\n  computeLookaheadFunc(\n    this: MixedInParser,\n    rule: Rule,\n    prodOccurrence: number,\n    prodKey: number,\n    prodType: OptionalProductionType,\n    prodMaxLookahead: number | undefined,\n    dslMethodName: string,\n  ): void {\n    this.TRACE_INIT(\n      `${dslMethodName}${prodOccurrence === 0 ? \"\" : prodOccurrence}`,\n      () => {\n        const laFunc = this.lookaheadStrategy.buildLookaheadForOptional({\n          prodOccurrence,\n          rule,\n          maxLookahead: prodMaxLookahead || this.maxLookahead,\n          dynamicTokensEnabled: this.dynamicTokensEnabled,\n          prodType,\n        });\n        const key = getKeyForAutomaticLookahead(\n          this.fullRuleNameToShort[rule.name],\n          prodKey,\n          prodOccurrence,\n        );\n        this.setLaFuncCache(key, laFunc);\n      },\n    );\n  }\n\n  // this actually returns a number, but it is always used as a string (object prop key)\n  getKeyForAutomaticLookahead(\n    this: MixedInParser,\n    dslMethodIdx: number,\n    occurrence: number,\n  ): number {\n    return getKeyForAutomaticLookahead(\n      this.currRuleShortName,\n      dslMethodIdx,\n      occurrence,\n    );\n  }\n\n  getLaFuncFromCache(this: MixedInParser, key: number): Function {\n    return this.lookAheadFuncsCache.get(key);\n  }\n\n  /* istanbul ignore next */\n  setLaFuncCache(this: MixedInParser, key: number, value: Function): void {\n    this.lookAheadFuncsCache.set(key, value);\n  }\n}\n\nclass DslMethodsCollectorVisitor extends GAstVisitor {\n  public dslMethods: {\n    option: Option[];\n    alternation: Alternation[];\n    repetition: Repetition[];\n    repetitionWithSeparator: RepetitionWithSeparator[];\n    repetitionMandatory: RepetitionMandatory[];\n    repetitionMandatoryWithSeparator: RepetitionMandatoryWithSeparator[];\n  } = {\n    option: [],\n    alternation: [],\n    repetition: [],\n    repetitionWithSeparator: [],\n    repetitionMandatory: [],\n    repetitionMandatoryWithSeparator: [],\n  };\n\n  reset() {\n    this.dslMethods = {\n      option: [],\n      alternation: [],\n      repetition: [],\n      repetitionWithSeparator: [],\n      repetitionMandatory: [],\n      repetitionMandatoryWithSeparator: [],\n    };\n  }\n\n  public visitOption(option: Option): void {\n    this.dslMethods.option.push(option);\n  }\n\n  public visitRepetitionWithSeparator(manySep: RepetitionWithSeparator): void {\n    this.dslMethods.repetitionWithSeparator.push(manySep);\n  }\n\n  public visitRepetitionMandatory(atLeastOne: RepetitionMandatory): void {\n    this.dslMethods.repetitionMandatory.push(atLeastOne);\n  }\n\n  public visitRepetitionMandatoryWithSeparator(\n    atLeastOneSep: RepetitionMandatoryWithSeparator,\n  ): void {\n    this.dslMethods.repetitionMandatoryWithSeparator.push(atLeastOneSep);\n  }\n\n  public visitRepetition(many: Repetition): void {\n    this.dslMethods.repetition.push(many);\n  }\n\n  public visitAlternation(or: Alternation): void {\n    this.dslMethods.alternation.push(or);\n  }\n}\n\nconst collectorVisitor = new DslMethodsCollectorVisitor();\nexport function collectMethods(rule: Rule): {\n  option: Option[];\n  alternation: Alternation[];\n  repetition: Repetition[];\n  repetitionWithSeparator: RepetitionWithSeparator[];\n  repetitionMandatory: RepetitionMandatory[];\n  repetitionMandatoryWithSeparator: RepetitionMandatoryWithSeparator[];\n} {\n  collectorVisitor.reset();\n  rule.accept(collectorVisitor);\n  const dslMethods = collectorVisitor.dslMethods;\n  // avoid uncleaned references\n  collectorVisitor.reset();\n  return <any>dslMethods;\n}\n", "import { CstNode, CstNodeLocation, IToken } from \"@chevrotain/types\";\n\n/**\n * This nodeLocation tracking is not efficient and should only be used\n * when error recovery is enabled or the Token Vector contains virtual Tokens\n * (e.g, Python Indent/Outdent)\n * As it executes the calculation for every single terminal/nonTerminal\n * and does not rely on the fact the token vector is **sorted**\n */\nexport function setNodeLocationOnlyOffset(\n  currNodeLocation: CstNodeLocation,\n  newLocationInfo: Required<Pick<IToken, \"startOffset\" | \"endOffset\">>,\n): void {\n  // First (valid) update for this cst node\n  if (isNaN(currNodeLocation.startOffset) === true) {\n    // assumption1: Token location information is either NaN or a valid number\n    // assumption2: Token location information is fully valid if it exist\n    // (both start/end offsets exist and are numbers).\n    currNodeLocation.startOffset = newLocationInfo.startOffset;\n    currNodeLocation.endOffset = newLocationInfo.endOffset;\n  }\n  // Once the startOffset has been updated with a valid number it should never receive\n  // any farther updates as the Token vector is sorted.\n  // We still have to check this this condition for every new possible location info\n  // because with error recovery enabled we may encounter invalid tokens (NaN location props)\n  else if (currNodeLocation.endOffset! < newLocationInfo.endOffset === true) {\n    currNodeLocation.endOffset = newLocationInfo.endOffset;\n  }\n}\n\n/**\n * This nodeLocation tracking is not efficient and should only be used\n * when error recovery is enabled or the Token Vector contains virtual Tokens\n * (e.g, Python Indent/Outdent)\n * As it executes the calculation for every single terminal/nonTerminal\n * and does not rely on the fact the token vector is **sorted**\n */\nexport function setNodeLocationFull(\n  currNodeLocation: CstNodeLocation,\n  newLocationInfo: CstNodeLocation,\n): void {\n  // First (valid) update for this cst node\n  if (isNaN(currNodeLocation.startOffset) === true) {\n    // assumption1: Token location information is either NaN or a valid number\n    // assumption2: Token location information is fully valid if it exist\n    // (all start/end props exist and are numbers).\n    currNodeLocation.startOffset = newLocationInfo.startOffset;\n    currNodeLocation.startColumn = newLocationInfo.startColumn;\n    currNodeLocation.startLine = newLocationInfo.startLine;\n    currNodeLocation.endOffset = newLocationInfo.endOffset;\n    currNodeLocation.endColumn = newLocationInfo.endColumn;\n    currNodeLocation.endLine = newLocationInfo.endLine;\n  }\n  // Once the start props has been updated with a valid number it should never receive\n  // any farther updates as the Token vector is sorted.\n  // We still have to check this this condition for every new possible location info\n  // because with error recovery enabled we may encounter invalid tokens (NaN location props)\n  else if (currNodeLocation.endOffset! < newLocationInfo.endOffset! === true) {\n    currNodeLocation.endOffset = newLocationInfo.endOffset;\n    currNodeLocation.endColumn = newLocationInfo.endColumn;\n    currNodeLocation.endLine = newLocationInfo.endLine;\n  }\n}\n\nexport function addTerminalToCst(\n  node: CstNode,\n  token: IToken,\n  tokenTypeName: string,\n): void {\n  if (node.children[tokenTypeName] === undefined) {\n    node.children[tokenTypeName] = [token];\n  } else {\n    node.children[tokenTypeName].push(token);\n  }\n}\n\nexport function addNoneTerminalToCst(\n  node: CstNode,\n  ruleName: string,\n  ruleResult: any,\n): void {\n  if (node.children[ruleName] === undefined) {\n    node.children[ruleName] = [ruleResult];\n  } else {\n    node.children[ruleName].push(ruleResult);\n  }\n}\n", "const NAME = \"name\";\n\nexport function defineNameProp(obj: {}, nameValue: string): void {\n  Object.defineProperty(obj, NAME, {\n    enumerable: false,\n    configurable: true,\n    writable: false,\n    value: nameValue,\n  });\n}\n", "import { defineNameProp } from \"../../lang/lang_extensions.js\";\nimport { CstNode, ICstVisitor } from \"@chevrotain/types\";\n\nexport function defaultVisit<IN>(ctx: any, param: IN): void {\n  const childrenNames = Object.keys(ctx);\n  const childrenNamesLength = childrenNames.length;\n  for (let i = 0; i < childrenNamesLength; i++) {\n    const currChildName = childrenNames[i];\n    const currChildArray = ctx[currChildName];\n    const currChildArrayLength = currChildArray.length;\n    for (let j = 0; j < currChildArrayLength; j++) {\n      const currChild: any = currChildArray[j];\n      // distinction between Tokens Children and CstNode children\n      if (currChild.tokenTypeIdx === undefined) {\n        this[currChild.name](currChild.children, param);\n      }\n    }\n  }\n  // defaultVisit does not support generic out param\n}\n\nexport function createBaseSemanticVisitorConstructor(\n  grammarName: string,\n  ruleNames: string[],\n): {\n  new (...args: any[]): ICstVisitor<any, any>;\n} {\n  const derivedConstructor: any = function () {};\n\n  // can be overwritten according to:\n  // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/\n  // name?redirectlocale=en-US&redirectslug=JavaScript%2FReference%2FGlobal_Objects%2FFunction%2Fname\n  defineNameProp(derivedConstructor, grammarName + \"BaseSemantics\");\n\n  const semanticProto = {\n    visit: function (cstNode: CstNode | CstNode[], param: any) {\n      // enables writing more concise visitor methods when CstNode has only a single child\n      if (Array.isArray(cstNode)) {\n        // A CST Node's children dictionary can never have empty arrays as values\n        // If a key is defined there will be at least one element in the corresponding value array.\n        cstNode = cstNode[0];\n      }\n\n      // enables passing optional CstNodes concisely.\n      if (cstNode === undefined) {\n        return undefined;\n      }\n\n      return this[cstNode.name](cstNode.children, param);\n    },\n\n    validateVisitor: function () {\n      const semanticDefinitionErrors = validateVisitor(this, ruleNames);\n      if (semanticDefinitionErrors.length !== 0) {\n        const errorMessages = semanticDefinitionErrors.map(\n          (currDefError) => currDefError.msg,\n        );\n        throw Error(\n          `Errors Detected in CST Visitor <${this.constructor.name}>:\\n\\t` +\n            `${errorMessages.join(\"\\n\\n\").replace(/\\n/g, \"\\n\\t\")}`,\n        );\n      }\n    },\n  };\n\n  derivedConstructor.prototype = semanticProto;\n  derivedConstructor.prototype.constructor = derivedConstructor;\n\n  derivedConstructor._RULE_NAMES = ruleNames;\n\n  return derivedConstructor;\n}\n\nexport function createBaseVisitorConstructorWithDefaults(\n  grammarName: string,\n  ruleNames: string[],\n  baseConstructor: Function,\n): {\n  new (...args: any[]): ICstVisitor<any, any>;\n} {\n  const derivedConstructor: any = function () {};\n\n  // can be overwritten according to:\n  // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/\n  // name?redirectlocale=en-US&redirectslug=JavaScript%2FReference%2FGlobal_Objects%2FFunction%2Fname\n  defineNameProp(derivedConstructor, grammarName + \"BaseSemanticsWithDefaults\");\n\n  const withDefaultsProto = Object.create(baseConstructor.prototype);\n  ruleNames.forEach((ruleName) => {\n    withDefaultsProto[ruleName] = defaultVisit;\n  });\n\n  derivedConstructor.prototype = withDefaultsProto;\n  derivedConstructor.prototype.constructor = derivedConstructor;\n\n  return derivedConstructor;\n}\n\nexport enum CstVisitorDefinitionError {\n  REDUNDANT_METHOD,\n  MISSING_METHOD,\n}\n\nexport interface IVisitorDefinitionError {\n  msg: string;\n  type: CstVisitorDefinitionError;\n  methodName: string;\n}\n\nexport function validateVisitor(\n  visitorInstance: ICstVisitor<unknown, unknown>,\n  ruleNames: string[],\n): IVisitorDefinitionError[] {\n  const missingErrors = validateMissingCstMethods(visitorInstance, ruleNames);\n\n  return missingErrors;\n}\n\nexport function validateMissingCstMethods(\n  visitorInstance: ICstVisitor<unknown, unknown>,\n  ruleNames: string[],\n): IVisitorDefinitionError[] {\n  const missingRuleNames = ruleNames.filter((currRuleName) => {\n    return (\n      (typeof (visitorInstance as any)[currRuleName] === \"function\") === false\n    );\n  });\n\n  const errors: IVisitorDefinitionError[] = missingRuleNames.map(\n    (currRuleName) => {\n      return {\n        msg: `Missing visitor method: <${currRuleName}> on ${<any>(\n          visitorInstance.constructor.name\n        )} CST Visitor.`,\n        type: CstVisitorDefinitionError.MISSING_METHOD,\n        methodName: currRuleName,\n      };\n    },\n  );\n\n  return errors.filter(Boolean) as IVisitorDefinitionError[];\n}\n", "import {\n  addNoneTerminalToCst,\n  addTerminalToCst,\n  setNodeLocationFull,\n  setNodeLocationOnlyOffset,\n} from \"../../cst/cst.js\";\nimport {\n  createBaseSemanticVisitorConstructor,\n  createBaseVisitorConstructorWithDefaults,\n} from \"../../cst/cst_visitor.js\";\nimport {\n  CstNode,\n  CstNodeLocation,\n  ICstVisitor,\n  IParserConfig,\n  IToken,\n  nodeLocationTrackingOptions,\n} from \"@chevrotain/types\";\nimport { MixedInParser } from \"./parser_traits.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n\n/**\n * This trait is responsible for the CST building logic.\n */\nexport class TreeBuilder {\n  outputCst: boolean;\n  CST_STACK: CstNode[];\n  baseCstVisitorConstructor: Function;\n  baseCstVisitorWithDefaultsConstructor: Function;\n\n  // dynamically assigned Methods\n  setNodeLocationFromNode: (\n    nodeLocation: CstNodeLocation,\n    locationInformation: CstNodeLocation,\n  ) => void;\n  setNodeLocationFromToken: (\n    nodeLocation: CstNodeLocation,\n    locationInformation: CstNodeLocation,\n  ) => void;\n  cstPostRule: (this: MixedInParser, ruleCstNode: CstNode) => void;\n\n  setInitialNodeLocation: (cstNode: CstNode) => void;\n  nodeLocationTracking: nodeLocationTrackingOptions;\n\n  initTreeBuilder(this: MixedInParser, config: IParserConfig) {\n    this.CST_STACK = [];\n\n    // outputCst is no longer exposed/defined in the pubic API\n    this.outputCst = (config as any).outputCst;\n\n    this.nodeLocationTracking = Object.hasOwn(config, \"nodeLocationTracking\")\n      ? (config.nodeLocationTracking as nodeLocationTrackingOptions) // assumes end user provides the correct config value/type\n      : DEFAULT_PARSER_CONFIG.nodeLocationTracking;\n\n    if (!this.outputCst) {\n      this.cstInvocationStateUpdate = () => {};\n      this.cstFinallyStateUpdate = () => {};\n      this.cstPostTerminal = () => {};\n      this.cstPostNonTerminal = () => {};\n      this.cstPostRule = () => {};\n    } else {\n      if (/full/i.test(this.nodeLocationTracking)) {\n        if (this.recoveryEnabled) {\n          this.setNodeLocationFromToken = setNodeLocationFull;\n          this.setNodeLocationFromNode = setNodeLocationFull;\n          this.cstPostRule = () => {};\n          this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery;\n        } else {\n          this.setNodeLocationFromToken = () => {};\n          this.setNodeLocationFromNode = () => {};\n          this.cstPostRule = this.cstPostRuleFull;\n          this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular;\n        }\n      } else if (/onlyOffset/i.test(this.nodeLocationTracking)) {\n        if (this.recoveryEnabled) {\n          this.setNodeLocationFromToken = <any>setNodeLocationOnlyOffset;\n          this.setNodeLocationFromNode = <any>setNodeLocationOnlyOffset;\n          this.cstPostRule = () => {};\n          this.setInitialNodeLocation =\n            this.setInitialNodeLocationOnlyOffsetRecovery;\n        } else {\n          this.setNodeLocationFromToken = () => {};\n          this.setNodeLocationFromNode = () => {};\n          this.cstPostRule = this.cstPostRuleOnlyOffset;\n          this.setInitialNodeLocation =\n            this.setInitialNodeLocationOnlyOffsetRegular;\n        }\n      } else if (/none/i.test(this.nodeLocationTracking)) {\n        this.setNodeLocationFromToken = () => {};\n        this.setNodeLocationFromNode = () => {};\n        this.cstPostRule = () => {};\n        this.setInitialNodeLocation = () => {};\n      } else {\n        throw Error(\n          `Invalid <nodeLocationTracking> config option: \"${config.nodeLocationTracking}\"`,\n        );\n      }\n    }\n  }\n\n  setInitialNodeLocationOnlyOffsetRecovery(\n    this: MixedInParser,\n    cstNode: any,\n  ): void {\n    cstNode.location = {\n      startOffset: NaN,\n      endOffset: NaN,\n    };\n  }\n\n  setInitialNodeLocationOnlyOffsetRegular(\n    this: MixedInParser,\n    cstNode: any,\n  ): void {\n    cstNode.location = {\n      // without error recovery the starting Location of a new CstNode is guaranteed\n      // To be the next Token's startOffset (for valid inputs).\n      // For invalid inputs there won't be any CSTOutput so this potential\n      // inaccuracy does not matter\n      startOffset: this.LA_FAST(1).startOffset,\n      endOffset: NaN,\n    };\n  }\n\n  setInitialNodeLocationFullRecovery(this: MixedInParser, cstNode: any): void {\n    cstNode.location = {\n      startOffset: NaN,\n      startLine: NaN,\n      startColumn: NaN,\n      endOffset: NaN,\n      endLine: NaN,\n      endColumn: NaN,\n    };\n  }\n\n  /**\n     *  @see setInitialNodeLocationOnlyOffsetRegular for explanation why this work\n\n     * @param cstNode\n     */\n  setInitialNodeLocationFullRegular(this: MixedInParser, cstNode: any): void {\n    const nextToken = this.LA_FAST(1);\n    cstNode.location = {\n      startOffset: nextToken.startOffset,\n      startLine: nextToken.startLine,\n      startColumn: nextToken.startColumn,\n      endOffset: NaN,\n      endLine: NaN,\n      endColumn: NaN,\n    };\n  }\n\n  cstInvocationStateUpdate(this: MixedInParser, fullRuleName: string): void {\n    const cstNode: CstNode = {\n      name: fullRuleName,\n      children: Object.create(null),\n    };\n\n    this.setInitialNodeLocation(cstNode);\n    this.CST_STACK.push(cstNode);\n  }\n\n  cstFinallyStateUpdate(this: MixedInParser): void {\n    this.CST_STACK.pop();\n  }\n\n  cstPostRuleFull(this: MixedInParser, ruleCstNode: CstNode): void {\n    // casts to `required<CstNodeLocation>` are safe because `cstPostRuleFull` should only be invoked when full location is enabled\n    // TODO(perf): can we replace this with LA_FAST?\n    //       edge case is the empty CstNode on first rule invocation.\n    //       perhaps create a test case to verify correctness of LA vs LA_FAST in this scenario?\n    const prevToken = this.LA(0) as Required<CstNodeLocation>;\n    const loc = ruleCstNode.location as Required<CstNodeLocation>;\n\n    // If this condition is true it means we consumed at least one Token\n    // In this CstNode.\n    if (loc.startOffset <= prevToken.startOffset === true) {\n      loc.endOffset = prevToken.endOffset;\n      loc.endLine = prevToken.endLine;\n      loc.endColumn = prevToken.endColumn;\n    }\n    // \"empty\" CstNode edge case\n    else {\n      loc.startOffset = NaN;\n      loc.startLine = NaN;\n      loc.startColumn = NaN;\n    }\n  }\n\n  cstPostRuleOnlyOffset(this: MixedInParser, ruleCstNode: CstNode): void {\n    // TODO: can we replace this with LA_FAST? see comment in `cstPostRuleFull()`\n    const prevToken = this.LA(0);\n    // `location' is not null because `cstPostRuleOnlyOffset` will only be invoked when location tracking is enabled.\n    const loc = ruleCstNode.location!;\n\n    // If this condition is true it means we consumed at least one Token\n    // In this CstNode.\n    if (loc.startOffset <= prevToken.startOffset === true) {\n      loc.endOffset = prevToken.endOffset;\n    }\n    // \"empty\" CstNode edge case\n    else {\n      loc.startOffset = NaN;\n    }\n  }\n\n  cstPostTerminal(\n    this: MixedInParser,\n    key: string,\n    consumedToken: IToken,\n  ): void {\n    const rootCst = this.CST_STACK[this.CST_STACK.length - 1];\n    addTerminalToCst(rootCst, consumedToken, key);\n    // This is only used when **both** error recovery and CST Output are enabled.\n    this.setNodeLocationFromToken(rootCst.location!, <any>consumedToken);\n  }\n\n  cstPostNonTerminal(\n    this: MixedInParser,\n    ruleCstResult: CstNode,\n    ruleName: string,\n  ): void {\n    const preCstNode = this.CST_STACK[this.CST_STACK.length - 1];\n    addNoneTerminalToCst(preCstNode, ruleName, ruleCstResult);\n    // This is only used when **both** error recovery and CST Output are enabled.\n    this.setNodeLocationFromNode(preCstNode.location!, ruleCstResult.location!);\n  }\n\n  getBaseCstVisitorConstructor<IN = any, OUT = any>(\n    this: MixedInParser,\n  ): {\n    new (...args: any[]): ICstVisitor<IN, OUT>;\n  } {\n    if (this.baseCstVisitorConstructor === undefined) {\n      const newBaseCstVisitorConstructor = createBaseSemanticVisitorConstructor(\n        this.className,\n        Object.keys(this.gastProductionsCache),\n      );\n      this.baseCstVisitorConstructor = newBaseCstVisitorConstructor;\n      return newBaseCstVisitorConstructor;\n    }\n\n    return <any>this.baseCstVisitorConstructor;\n  }\n\n  getBaseCstVisitorConstructorWithDefaults<IN = any, OUT = any>(\n    this: MixedInParser,\n  ): {\n    new (...args: any[]): ICstVisitor<IN, OUT>;\n  } {\n    if (this.baseCstVisitorWithDefaultsConstructor === undefined) {\n      const newConstructor = createBaseVisitorConstructorWithDefaults(\n        this.className,\n        Object.keys(this.gastProductionsCache),\n        this.getBaseCstVisitorConstructor(),\n      );\n      this.baseCstVisitorWithDefaultsConstructor = newConstructor;\n      return newConstructor;\n    }\n\n    return <any>this.baseCstVisitorWithDefaultsConstructor;\n  }\n\n  getPreviousExplicitRuleShortName(this: MixedInParser): number {\n    return this.RULE_STACK[this.RULE_STACK_IDX - 1];\n  }\n\n  getLastExplicitRuleOccurrenceIndex(this: MixedInParser): number {\n    return this.RULE_OCCURRENCE_STACK[this.RULE_OCCURRENCE_STACK_IDX];\n  }\n}\n", "import { END_OF_FILE } from \"../parser.js\";\nimport { IToken } from \"@chevrotain/types\";\nimport { MixedInParser } from \"./parser_traits.js\";\n\n/**\n * Trait responsible abstracting over the interaction with Lexer output (Token vector).\n *\n * This could be generalized to support other kinds of lexers, e.g.\n * - Just in Time Lexing / Lexer-Less parsing.\n * - Streaming Lexer.\n */\nexport class LexerAdapter {\n  tokVector: IToken[];\n  tokVectorLength: number;\n  currIdx: number;\n\n  initLexerAdapter() {\n    this.tokVector = [];\n    this.tokVectorLength = 0;\n    this.currIdx = -1;\n  }\n\n  set input(newInput: IToken[]) {\n    // @ts-ignore - `this parameter` not supported in setters/getters\n    //   - https://www.typescriptlang.org/docs/handbook/functions.html#this-parameters\n    if (this.selfAnalysisDone !== true) {\n      throw Error(\n        `Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.`,\n      );\n    }\n    // @ts-ignore - `this parameter` not supported in setters/getters\n    //   - https://www.typescriptlang.org/docs/handbook/functions.html#this-parameters\n    this.reset();\n    this.tokVector = newInput;\n    this.tokVectorLength = newInput.length;\n  }\n\n  get input(): IToken[] {\n    return this.tokVector;\n  }\n\n  // skips a token and returns the next token\n  SKIP_TOKEN(this: MixedInParser): IToken {\n    if (this.currIdx <= this.tokVectorLength - 2) {\n      this.consumeToken();\n      return this.LA_FAST(1);\n    } else {\n      return END_OF_FILE;\n    }\n  }\n\n  // Lexer (accessing Token vector) related methods which can be overridden to implement lazy lexers\n  // or lexers dependent on parser context.\n\n  // Performance Optimized version of LA without bound checks\n  // note that token beyond the end of the token vector EOF Token will still be returned\n  // due to using sentinels at the end of the token vector. (for K=max lookahead)\n  LA_FAST(this: MixedInParser, howMuch: number): IToken {\n    const soughtIdx = this.currIdx + howMuch;\n    return this.tokVector[soughtIdx];\n  }\n\n  LA(this: MixedInParser, howMuch: number): IToken {\n    const soughtIdx = this.currIdx + howMuch;\n    if (soughtIdx < 0 || this.tokVectorLength <= soughtIdx) {\n      return END_OF_FILE;\n    } else {\n      return this.tokVector[soughtIdx];\n    }\n  }\n\n  consumeToken(this: MixedInParser) {\n    this.currIdx++;\n  }\n\n  exportLexerState(this: MixedInParser): number {\n    return this.currIdx;\n  }\n\n  importLexerState(this: MixedInParser, newState: number) {\n    this.currIdx = newState;\n  }\n\n  resetLexerState(this: MixedInParser): void {\n    this.currIdx = -1;\n  }\n\n  moveToTerminatedState(this: MixedInParser): void {\n    this.currIdx = this.tokVectorLength - 1;\n  }\n\n  getLexerPosition(this: MixedInParser): number {\n    return this.exportLexerState();\n  }\n}\n", "import {\n  AtLeastOneSepMethodOpts,\n  ConsumeMethodOpts,\n  DSLMethodOpts,\n  DSLMethodOptsWithErr,\n  GrammarAction,\n  IOrAlt,\n  IRuleConfig,\n  ISerializedGast,\n  IToken,\n  ManySepMethodOpts,\n  OrMethodOpts,\n  SubruleMethodOpts,\n  TokenType,\n} from \"@chevrotain/types\";\nimport { isRecognitionException } from \"../../exceptions_public.js\";\nimport { DEFAULT_RULE_CONFIG, ParserDefinitionErrorType } from \"../parser.js\";\nimport { defaultGrammarValidatorErrorProvider } from \"../../errors_public.js\";\nimport { validateRuleIsOverridden } from \"../../grammar/checks.js\";\nimport { MixedInParser } from \"./parser_traits.js\";\nimport { Rule, serializeGrammar } from \"@chevrotain/gast\";\nimport { IParserDefinitionError } from \"../../grammar/types.js\";\nimport { ParserMethodInternal } from \"../types.js\";\n\n/**\n * This trait is responsible for implementing the public API\n * for defining Chevrotain parsers, i.e:\n * - CONSUME\n * - RULE\n * - OPTION\n * - ...\n */\nexport class RecognizerApi {\n  ACTION<T>(this: MixedInParser, impl: () => T): T {\n    return impl.call(this);\n  }\n\n  consume(\n    this: MixedInParser,\n    idx: number,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, idx, options);\n  }\n\n  subrule<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    idx: number,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, idx, options);\n  }\n\n  option<OUT>(\n    this: MixedInParser,\n    idx: number,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, idx);\n  }\n\n  or(\n    this: MixedInParser,\n    idx: number,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<any>,\n  ): any {\n    return this.orInternal(altsOrOpts, idx);\n  }\n\n  many(\n    this: MixedInParser,\n    idx: number,\n    actionORMethodDef: GrammarAction<any> | DSLMethodOpts<any>,\n  ): void {\n    return this.manyInternal(idx, actionORMethodDef);\n  }\n\n  atLeastOne(\n    this: MixedInParser,\n    idx: number,\n    actionORMethodDef: GrammarAction<any> | DSLMethodOptsWithErr<any>,\n  ): void {\n    return this.atLeastOneInternal(idx, actionORMethodDef);\n  }\n\n  CONSUME(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 0, options);\n  }\n\n  CONSUME1(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 1, options);\n  }\n\n  CONSUME2(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 2, options);\n  }\n\n  CONSUME3(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 3, options);\n  }\n\n  CONSUME4(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 4, options);\n  }\n\n  CONSUME5(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 5, options);\n  }\n\n  CONSUME6(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 6, options);\n  }\n\n  CONSUME7(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 7, options);\n  }\n\n  CONSUME8(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 8, options);\n  }\n\n  CONSUME9(\n    this: MixedInParser,\n    tokType: TokenType,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    return this.consumeInternal(tokType, 9, options);\n  }\n\n  SUBRULE<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 0, options);\n  }\n\n  SUBRULE1<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 1, options);\n  }\n\n  SUBRULE2<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 2, options);\n  }\n\n  SUBRULE3<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 3, options);\n  }\n\n  SUBRULE4<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 4, options);\n  }\n\n  SUBRULE5<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 5, options);\n  }\n\n  SUBRULE6<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 6, options);\n  }\n\n  SUBRULE7<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 7, options);\n  }\n\n  SUBRULE8<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 8, options);\n  }\n\n  SUBRULE9<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    return this.subruleInternal(ruleToCall, 9, options);\n  }\n\n  OPTION<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 0);\n  }\n\n  OPTION1<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 1);\n  }\n\n  OPTION2<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 2);\n  }\n\n  OPTION3<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 3);\n  }\n\n  OPTION4<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 4);\n  }\n\n  OPTION5<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 5);\n  }\n\n  OPTION6<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 6);\n  }\n\n  OPTION7<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 7);\n  }\n\n  OPTION8<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 8);\n  }\n\n  OPTION9<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): OUT | undefined {\n    return this.optionInternal(actionORMethodDef, 9);\n  }\n\n  OR<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 0);\n  }\n\n  OR1<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 1);\n  }\n\n  OR2<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 2);\n  }\n\n  OR3<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 3);\n  }\n\n  OR4<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 4);\n  }\n\n  OR5<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 5);\n  }\n\n  OR6<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 6);\n  }\n\n  OR7<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 7);\n  }\n\n  OR8<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 8);\n  }\n\n  OR9<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n  ): T {\n    return this.orInternal(altsOrOpts, 9);\n  }\n\n  MANY<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(0, actionORMethodDef);\n  }\n\n  MANY1<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(1, actionORMethodDef);\n  }\n\n  MANY2<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(2, actionORMethodDef);\n  }\n\n  MANY3<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(3, actionORMethodDef);\n  }\n\n  MANY4<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(4, actionORMethodDef);\n  }\n\n  MANY5<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(5, actionORMethodDef);\n  }\n\n  MANY6<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(6, actionORMethodDef);\n  }\n\n  MANY7<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(7, actionORMethodDef);\n  }\n\n  MANY8<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(8, actionORMethodDef);\n  }\n\n  MANY9<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    this.manyInternal(9, actionORMethodDef);\n  }\n\n  MANY_SEP<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(0, options);\n  }\n\n  MANY_SEP1<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(1, options);\n  }\n\n  MANY_SEP2<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(2, options);\n  }\n\n  MANY_SEP3<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(3, options);\n  }\n\n  MANY_SEP4<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(4, options);\n  }\n\n  MANY_SEP5<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(5, options);\n  }\n\n  MANY_SEP6<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(6, options);\n  }\n\n  MANY_SEP7<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(7, options);\n  }\n\n  MANY_SEP8<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(8, options);\n  }\n\n  MANY_SEP9<OUT>(this: MixedInParser, options: ManySepMethodOpts<OUT>): void {\n    this.manySepFirstInternal(9, options);\n  }\n\n  AT_LEAST_ONE<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(0, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE1<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    return this.atLeastOneInternal(1, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE2<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(2, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE3<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(3, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE4<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(4, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE5<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(5, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE6<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(6, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE7<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(7, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE8<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(8, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE9<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    this.atLeastOneInternal(9, actionORMethodDef);\n  }\n\n  AT_LEAST_ONE_SEP<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(0, options);\n  }\n\n  AT_LEAST_ONE_SEP1<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(1, options);\n  }\n\n  AT_LEAST_ONE_SEP2<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(2, options);\n  }\n\n  AT_LEAST_ONE_SEP3<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(3, options);\n  }\n\n  AT_LEAST_ONE_SEP4<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(4, options);\n  }\n\n  AT_LEAST_ONE_SEP5<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(5, options);\n  }\n\n  AT_LEAST_ONE_SEP6<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(6, options);\n  }\n\n  AT_LEAST_ONE_SEP7<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(7, options);\n  }\n\n  AT_LEAST_ONE_SEP8<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(8, options);\n  }\n\n  AT_LEAST_ONE_SEP9<OUT>(\n    this: MixedInParser,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    this.atLeastOneSepFirstInternal(9, options);\n  }\n\n  RULE<T>(\n    this: MixedInParser,\n    name: string,\n    implementation: (...implArgs: any[]) => T,\n    config: IRuleConfig<T> = DEFAULT_RULE_CONFIG,\n  ): (idxInCallingRule?: number, ...args: any[]) => T | any {\n    if (this.definedRulesNames.includes(name)) {\n      const errMsg =\n        defaultGrammarValidatorErrorProvider.buildDuplicateRuleNameError({\n          topLevelRule: name,\n          grammarName: this.className,\n        });\n\n      const error = {\n        message: errMsg,\n        type: ParserDefinitionErrorType.DUPLICATE_RULE_NAME,\n        ruleName: name,\n      };\n      this.definitionErrors.push(error);\n    }\n\n    this.definedRulesNames.push(name);\n\n    const ruleImplementation = this.defineRule(name, implementation, config);\n    (this as any)[name] = ruleImplementation;\n    return ruleImplementation;\n  }\n\n  OVERRIDE_RULE<T>(\n    this: MixedInParser,\n    name: string,\n    impl: (...implArgs: any[]) => T,\n    config: IRuleConfig<T> = DEFAULT_RULE_CONFIG,\n  ): (idxInCallingRule?: number, ...args: any[]) => T {\n    const ruleErrors: IParserDefinitionError[] = validateRuleIsOverridden(\n      name,\n      this.definedRulesNames,\n      this.className,\n    );\n    this.definitionErrors = this.definitionErrors.concat(ruleErrors);\n\n    const ruleImplementation = this.defineRule(name, impl, config);\n    (this as any)[name] = ruleImplementation;\n    return ruleImplementation;\n  }\n\n  BACKTRACK<T>(\n    this: MixedInParser,\n    grammarRule: (...args: any[]) => T,\n    args?: any[],\n  ): () => boolean {\n    // Use coreRule to bypass root-level hooks (onBeforeParse/onAfterParse).\n    // Backtracking is speculative and should not trigger parse lifecycle hooks.\n    const ruleToCall = (grammarRule as any).coreRule ?? grammarRule;\n    return function () {\n      // save org state\n      this.isBackTrackingStack.push(1);\n      const orgState = this.saveRecogState();\n      try {\n        ruleToCall.apply(this, args);\n        // if no exception was thrown we have succeed parsing the rule.\n        return true;\n      } catch (e) {\n        if (isRecognitionException(e)) {\n          return false;\n        } else {\n          throw e;\n        }\n      } finally {\n        this.reloadRecogState(orgState);\n        this.isBackTrackingStack.pop();\n      }\n    };\n  }\n\n  // GAST export APIs\n  public getGAstProductions(this: MixedInParser): Record<string, Rule> {\n    return this.gastProductionsCache;\n  }\n\n  public getSerializedGastProductions(this: MixedInParser): ISerializedGast[] {\n    return serializeGrammar(Object.values(this.gastProductionsCache));\n  }\n}\n", "import {\n  AtLeastOneSepMethodOpts,\n  ConsumeMethodOpts,\n  DSLMethodOpts,\n  DSLMethodOptsWithErr,\n  GrammarAction,\n  IOrAlt,\n  IParserConfig,\n  IRuleConfig,\n  IToken,\n  ManySepMethodOpts,\n  OrMethodOpts,\n  ParserMethod,\n  SubruleMethodOpts,\n  TokenType,\n  TokenTypeDictionary,\n  TokenVocabulary,\n} from \"@chevrotain/types\";\n\nimport {\n  AT_LEAST_ONE_IDX,\n  AT_LEAST_ONE_SEP_IDX,\n  BITS_FOR_METHOD_TYPE,\n  BITS_FOR_OCCURRENCE_IDX,\n  MANY_IDX,\n  MANY_SEP_IDX,\n  OPTION_IDX,\n  OR_IDX,\n} from \"../../grammar/keys.js\";\nimport {\n  isRecognitionException,\n  MismatchedTokenException,\n  NotAllInputParsedException,\n} from \"../../exceptions_public.js\";\nimport { PROD_TYPE } from \"../../grammar/lookahead.js\";\nimport {\n  AbstractNextTerminalAfterProductionWalker,\n  NextTerminalAfterAtLeastOneSepWalker,\n  NextTerminalAfterAtLeastOneWalker,\n  NextTerminalAfterManySepWalker,\n  NextTerminalAfterManyWalker,\n} from \"../../grammar/interpreter.js\";\nimport {\n  DEFAULT_RULE_CONFIG,\n  END_OF_FILE,\n  IParserState,\n  TokenMatcher,\n} from \"../parser.js\";\nimport { IN_RULE_RECOVERY_EXCEPTION } from \"./recoverable.js\";\nimport { EOF } from \"../../../scan/tokens_public.js\";\nimport { MixedInParser } from \"./parser_traits.js\";\nimport {\n  augmentTokenTypes,\n  isTokenType,\n  tokenStructuredMatcher,\n  tokenStructuredMatcherNoCategories,\n} from \"../../../scan/tokens.js\";\nimport { Rule } from \"@chevrotain/gast\";\nimport { ParserMethodInternal } from \"../types.js\";\n\n/**\n * This trait is responsible for the runtime parsing engine\n * Used by the official API (recognizer_api.ts)\n */\nexport class RecognizerEngine {\n  isBackTrackingStack: boolean[];\n  className: string;\n  RULE_STACK: number[];\n  RULE_OCCURRENCE_STACK: number[];\n  // Depth counters for the pre-allocated state stacks.\n  // Using index-based access (arr[++idx] = val / idx--) instead of push/pop\n  // avoids method-call overhead on every rule entry/exit.\n  RULE_STACK_IDX: number;\n  RULE_OCCURRENCE_STACK_IDX: number;\n  definedRulesNames: string[];\n  tokensMap: { [fqn: string]: TokenType };\n  gastProductionsCache: Record<string, Rule>;\n  shortRuleNameToFull: Record<string, string>;\n  fullRuleNameToShort: Record<string, number>;\n  // The shortName Index must be coded \"after\" the first 8bits to enable building unique lookahead keys\n  ruleShortNameIdx: number;\n  tokenMatcher: TokenMatcher;\n  subruleIdx: number;\n  // Cached value of the current rule's short name to avoid repeated RULE_STACK[length-1] lookups.\n  // Updated on rule entry/exit and state reload.\n  currRuleShortName: number;\n\n  initRecognizerEngine(\n    tokenVocabulary: TokenVocabulary,\n    config: IParserConfig,\n  ) {\n    this.className = this.constructor.name;\n    // TODO: would using an ES6 Map or plain object be faster (CST building scenario)\n    this.shortRuleNameToFull = {};\n    this.fullRuleNameToShort = {};\n    this.ruleShortNameIdx = 256;\n    this.tokenMatcher = tokenStructuredMatcherNoCategories;\n    this.subruleIdx = 0;\n    this.currRuleShortName = 0;\n\n    this.definedRulesNames = [];\n    this.tokensMap = {};\n    this.isBackTrackingStack = [];\n    this.RULE_STACK = [];\n    this.RULE_STACK_IDX = -1;\n    this.RULE_OCCURRENCE_STACK = [];\n    this.RULE_OCCURRENCE_STACK_IDX = -1;\n    this.gastProductionsCache = {};\n\n    if (Object.hasOwn(config, \"serializedGrammar\")) {\n      throw Error(\n        \"The Parser's configuration can no longer contain a <serializedGrammar> property.\\n\" +\n          \"\\tSee: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0\\n\" +\n          \"\\tFor Further details.\",\n      );\n    }\n\n    if (Array.isArray(tokenVocabulary)) {\n      // This only checks for Token vocabularies provided as arrays.\n      // That is good enough because the main objective is to detect users of pre-V4.0 APIs\n      // rather than all edge cases of empty Token vocabularies.\n      if ((tokenVocabulary as any[]).length === 0) {\n        throw Error(\n          \"A Token Vocabulary cannot be empty.\\n\" +\n            \"\\tNote that the first argument for the parser constructor\\n\" +\n            \"\\tis no longer a Token vector (since v4.0).\",\n        );\n      }\n\n      if (typeof (tokenVocabulary as any[])[0].startOffset === \"number\") {\n        throw Error(\n          \"The Parser constructor no longer accepts a token vector as the first argument.\\n\" +\n            \"\\tSee: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_4-0-0\\n\" +\n            \"\\tFor Further details.\",\n        );\n      }\n    }\n\n    if (Array.isArray(tokenVocabulary)) {\n      this.tokensMap = (tokenVocabulary as TokenType[]).reduce(\n        (acc: { [tokenName: string]: TokenType }, tokType: TokenType) => {\n          acc[tokType.name] = tokType;\n          return acc;\n        },\n        {} as { [tokenName: string]: TokenType },\n      );\n    } else if (\n      Object.hasOwn(tokenVocabulary, \"modes\") &&\n      (Object.values((<any>tokenVocabulary).modes) as any[][])\n        .flat()\n        .every(isTokenType)\n    ) {\n      const allTokenTypes = (\n        Object.values((<any>tokenVocabulary).modes) as any[][]\n      ).flat();\n      const uniqueTokens = [...new Set(allTokenTypes)];\n      this.tokensMap = <any>uniqueTokens.reduce(\n        (acc: { [tokenName: string]: TokenType }, tokType: TokenType) => {\n          acc[tokType.name] = tokType;\n          return acc;\n        },\n        {} as { [tokenName: string]: TokenType },\n      );\n    } else if (\n      typeof tokenVocabulary === \"object\" &&\n      tokenVocabulary !== null\n    ) {\n      this.tokensMap = { ...(tokenVocabulary as TokenTypeDictionary) };\n    } else {\n      throw new Error(\n        \"<tokensDictionary> argument must be An Array of Token constructors,\" +\n          \" A dictionary of Token constructors or an IMultiModeLexerDefinition\",\n      );\n    }\n\n    // always add EOF to the tokenNames -> constructors map. it is useful to assure all the input has been\n    // parsed with a clear error message (\"expecting EOF but found ...\")\n    this.tokensMap[\"EOF\"] = EOF;\n\n    const allTokenTypes = Object.hasOwn(tokenVocabulary, \"modes\")\n      ? (Object.values((<any>tokenVocabulary).modes) as any[][]).flat()\n      : Object.values(tokenVocabulary);\n    const noTokenCategoriesUsed = allTokenTypes.every(\n      // intentional \"==\" to also cover \"undefined\"\n      (tokenConstructor: any) => tokenConstructor.categoryMatches?.length == 0,\n    );\n\n    this.tokenMatcher = noTokenCategoriesUsed\n      ? tokenStructuredMatcherNoCategories\n      : tokenStructuredMatcher;\n\n    // Because ES2015+ syntax should be supported for creating Token classes\n    // We cannot assume that the Token classes were created using the \"extendToken\" utilities\n    // Therefore we must augment the Token classes both on Lexer initialization and on Parser initialization\n    augmentTokenTypes(Object.values(this.tokensMap));\n  }\n\n  defineRule<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleName: string,\n    impl: (...args: ARGS) => R,\n    config: IRuleConfig<R>,\n  ): ParserMethodInternal<ARGS, R> {\n    if (this.selfAnalysisDone) {\n      throw Error(\n        `Grammar rule <${ruleName}> may not be defined after the 'performSelfAnalysis' method has been called'\\n` +\n          `Make sure that all grammar rule definitions are done before 'performSelfAnalysis' is called.`,\n      );\n    }\n    const resyncEnabled: boolean = Object.hasOwn(config, \"resyncEnabled\")\n      ? (config.resyncEnabled as boolean) // assumes end user provides the correct config value/type\n      : DEFAULT_RULE_CONFIG.resyncEnabled;\n    const recoveryValueFunc = Object.hasOwn(config, \"recoveryValueFunc\")\n      ? (config.recoveryValueFunc as () => R) // assumes end user provides the correct config value/type\n      : DEFAULT_RULE_CONFIG.recoveryValueFunc;\n\n    // performance optimization: Use small integers as keys for the longer human readable \"full\" rule names.\n    // this greatly improves Map access time (as much as 8% for some performance benchmarks).\n    const shortName =\n      this.ruleShortNameIdx << (BITS_FOR_METHOD_TYPE + BITS_FOR_OCCURRENCE_IDX);\n\n    this.ruleShortNameIdx++;\n    this.shortRuleNameToFull[shortName] = ruleName;\n    this.fullRuleNameToShort[ruleName] = shortName;\n\n    let coreRuleFunction: ParserMethod<ARGS, R>;\n\n    // Micro optimization, only check the condition **once** on rule definition\n    // instead of **every single** rule invocation.\n    if (this.outputCst === true) {\n      coreRuleFunction = function invokeRuleWithTry(\n        this: MixedInParser,\n        ...args: ARGS\n      ): R {\n        try {\n          this.ruleInvocationStateUpdate(shortName, ruleName, this.subruleIdx);\n          impl.apply(this, args);\n          const cst = this.CST_STACK[this.CST_STACK.length - 1];\n          this.cstPostRule(cst);\n          return cst as unknown as R;\n        } catch (e) {\n          return this.invokeRuleCatch(e, resyncEnabled, recoveryValueFunc) as R;\n        } finally {\n          this.ruleFinallyStateUpdate();\n        }\n      };\n    } else {\n      coreRuleFunction = function invokeRuleWithTryCst(\n        this: MixedInParser,\n        ...args: ARGS\n      ): R {\n        try {\n          this.ruleInvocationStateUpdate(shortName, ruleName, this.subruleIdx);\n          return impl.apply(this, args);\n        } catch (e) {\n          return this.invokeRuleCatch(e, resyncEnabled, recoveryValueFunc) as R;\n        } finally {\n          this.ruleFinallyStateUpdate();\n        }\n      };\n    }\n\n    // wrapper to allow before/after parsing hooks\n    const rootRuleFunction: ParserMethod<ARGS, R> = function rootRule(\n      this: MixedInParser,\n      ...args: ARGS\n    ): R {\n      this.onBeforeParse(ruleName);\n      try {\n        return coreRuleFunction.apply(this, args);\n      } finally {\n        this.onAfterParse(ruleName);\n      }\n    };\n\n    const wrappedGrammarRule: ParserMethodInternal<ARGS, R> = Object.assign(\n      rootRuleFunction as any,\n      { ruleName, originalGrammarAction: impl, coreRule: coreRuleFunction },\n    );\n\n    return wrappedGrammarRule;\n  }\n\n  invokeRuleCatch(\n    this: MixedInParser,\n    e: Error,\n    resyncEnabledConfig: boolean,\n    recoveryValueFunc: Function,\n  ): unknown {\n    const isFirstInvokedRule = this.RULE_STACK_IDX === 0;\n    // note the reSync is always enabled for the first rule invocation, because we must always be able to\n    // reSync with EOF and just output some INVALID ParseTree\n    // during backtracking reSync recovery is disabled, otherwise we can't be certain the backtracking\n    // path is really the most valid one\n    const reSyncEnabled =\n      resyncEnabledConfig && !this.isBackTracking() && this.recoveryEnabled;\n\n    if (isRecognitionException(e)) {\n      const recogError: any = e;\n      if (reSyncEnabled) {\n        const reSyncTokType = this.findReSyncTokenType();\n        if (this.isInCurrentRuleReSyncSet(reSyncTokType)) {\n          recogError.resyncedTokens = this.reSyncTo(reSyncTokType);\n          if (this.outputCst) {\n            const partialCstResult: any =\n              this.CST_STACK[this.CST_STACK.length - 1];\n            partialCstResult.recoveredNode = true;\n            return partialCstResult;\n          } else {\n            return recoveryValueFunc(e);\n          }\n        } else {\n          if (this.outputCst) {\n            const partialCstResult: any =\n              this.CST_STACK[this.CST_STACK.length - 1];\n            partialCstResult.recoveredNode = true;\n            recogError.partialCstResult = partialCstResult;\n          }\n          // to be handled Further up the call stack\n          throw recogError;\n        }\n      } else if (isFirstInvokedRule) {\n        // otherwise a Redundant input error will be created as well and we cannot guarantee that this is indeed the case\n        this.moveToTerminatedState();\n        // the parser should never throw one of its own errors outside its flow.\n        // even if error recovery is disabled\n        return recoveryValueFunc(e);\n      } else {\n        // to be recovered Further up the call stack\n        throw recogError;\n      }\n    } else {\n      // some other Error type which we don't know how to handle (for example a built in JavaScript Error)\n      throw e;\n    }\n  }\n\n  // Implementation of parsing DSL\n  optionInternal<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n    occurrence: number,\n  ): OUT | undefined {\n    const key = this.getKeyForAutomaticLookahead(OPTION_IDX, occurrence);\n    return this.optionInternalLogic(actionORMethodDef, occurrence, key);\n  }\n\n  optionInternalLogic<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n    occurrence: number,\n    key: number,\n  ): OUT | undefined {\n    let lookAheadFunc = this.getLaFuncFromCache(key);\n    let action: GrammarAction<OUT>;\n    if (typeof actionORMethodDef !== \"function\") {\n      action = actionORMethodDef.DEF;\n      const predicate = actionORMethodDef.GATE;\n      // predicate present\n      if (predicate !== undefined) {\n        const orgLookaheadFunction = lookAheadFunc;\n        lookAheadFunc = () => {\n          return predicate.call(this) && orgLookaheadFunction.call(this);\n        };\n      }\n    } else {\n      action = actionORMethodDef;\n    }\n\n    if (lookAheadFunc.call(this) === true) {\n      return action.call(this);\n    }\n    return undefined;\n  }\n\n  atLeastOneInternal<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    const laKey = this.getKeyForAutomaticLookahead(\n      AT_LEAST_ONE_IDX,\n      prodOccurrence,\n    );\n    return this.atLeastOneInternalLogic(\n      prodOccurrence,\n      actionORMethodDef,\n      laKey,\n    );\n  }\n\n  atLeastOneInternalLogic<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n    key: number,\n  ): void {\n    let lookAheadFunc = this.getLaFuncFromCache(key);\n    let action;\n    if (typeof actionORMethodDef !== \"function\") {\n      action = actionORMethodDef.DEF;\n      const predicate = actionORMethodDef.GATE;\n      // predicate present\n      if (predicate !== undefined) {\n        const orgLookaheadFunction = lookAheadFunc;\n        lookAheadFunc = () => {\n          return predicate.call(this) && orgLookaheadFunction.call(this);\n        };\n      }\n    } else {\n      action = actionORMethodDef;\n    }\n\n    if ((<Function>lookAheadFunc).call(this) === true) {\n      let notStuck = this.doSingleRepetition(action);\n      while (\n        (<Function>lookAheadFunc).call(this) === true &&\n        notStuck === true\n      ) {\n        notStuck = this.doSingleRepetition(action);\n      }\n    } else {\n      throw this.raiseEarlyExitException(\n        prodOccurrence,\n        PROD_TYPE.REPETITION_MANDATORY,\n        (<DSLMethodOptsWithErr<OUT>>actionORMethodDef).ERR_MSG,\n      );\n    }\n\n    // note that while it may seem that this can cause an error because by using a recursive call to\n    // AT_LEAST_ONE we change the grammar to AT_LEAST_TWO, AT_LEAST_THREE ... , the possible recursive call\n    // from the tryInRepetitionRecovery(...) will only happen IFF there really are TWO/THREE/.... items.\n\n    // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n    this.attemptInRepetitionRecovery(\n      this.atLeastOneInternal,\n      [prodOccurrence, actionORMethodDef],\n      <any>lookAheadFunc,\n      AT_LEAST_ONE_IDX,\n      prodOccurrence,\n      NextTerminalAfterAtLeastOneWalker,\n    );\n  }\n\n  atLeastOneSepFirstInternal<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    const laKey = this.getKeyForAutomaticLookahead(\n      AT_LEAST_ONE_SEP_IDX,\n      prodOccurrence,\n    );\n    this.atLeastOneSepFirstInternalLogic(prodOccurrence, options, laKey);\n  }\n\n  atLeastOneSepFirstInternalLogic<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    options: AtLeastOneSepMethodOpts<OUT>,\n    key: number,\n  ): void {\n    const action = options.DEF;\n    const separator = options.SEP;\n\n    const firstIterationLookaheadFunc = this.getLaFuncFromCache(key);\n\n    // 1st iteration\n    if (firstIterationLookaheadFunc.call(this) === true) {\n      (<GrammarAction<OUT>>action).call(this);\n\n      //  TODO: Optimization can move this function construction into \"attemptInRepetitionRecovery\"\n      //  because it is only needed in error recovery scenarios.\n      const separatorLookAheadFunc = () => {\n        return this.tokenMatcher(this.LA_FAST(1), separator);\n      };\n\n      // 2nd..nth iterations\n      while (this.tokenMatcher(this.LA_FAST(1), separator) === true) {\n        // note that this CONSUME will never enter recovery because\n        // the separatorLookAheadFunc checks that the separator really does exist.\n        this.CONSUME(separator);\n        // No need for checking infinite loop here due to consuming the separator.\n        (<GrammarAction<OUT>>action).call(this);\n      }\n\n      // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n      this.attemptInRepetitionRecovery(\n        this.repetitionSepSecondInternal,\n        [\n          prodOccurrence,\n          separator,\n          separatorLookAheadFunc,\n          action,\n          NextTerminalAfterAtLeastOneSepWalker,\n        ],\n        separatorLookAheadFunc,\n        AT_LEAST_ONE_SEP_IDX,\n        prodOccurrence,\n        NextTerminalAfterAtLeastOneSepWalker,\n      );\n    } else {\n      throw this.raiseEarlyExitException(\n        prodOccurrence,\n        PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR,\n        options.ERR_MSG,\n      );\n    }\n  }\n\n  manyInternal<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    const laKey = this.getKeyForAutomaticLookahead(MANY_IDX, prodOccurrence);\n    return this.manyInternalLogic(prodOccurrence, actionORMethodDef, laKey);\n  }\n\n  manyInternalLogic<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n    key: number,\n  ) {\n    let lookaheadFunction = this.getLaFuncFromCache(key);\n    let action;\n    if (typeof actionORMethodDef !== \"function\") {\n      action = actionORMethodDef.DEF;\n      const predicate = actionORMethodDef.GATE;\n      // predicate present\n      if (predicate !== undefined) {\n        const orgLookaheadFunction = lookaheadFunction;\n        lookaheadFunction = () => {\n          return predicate.call(this) && orgLookaheadFunction.call(this);\n        };\n      }\n    } else {\n      action = actionORMethodDef;\n    }\n\n    let notStuck = true;\n    while (lookaheadFunction.call(this) === true && notStuck === true) {\n      notStuck = this.doSingleRepetition(action);\n    }\n\n    // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n    this.attemptInRepetitionRecovery(\n      this.manyInternal,\n      [prodOccurrence, actionORMethodDef],\n      <any>lookaheadFunction,\n      MANY_IDX,\n      prodOccurrence,\n      NextTerminalAfterManyWalker,\n      // The notStuck parameter is only relevant when \"attemptInRepetitionRecovery\"\n      // is invoked from manyInternal, in the MANY_SEP case and AT_LEAST_ONE[_SEP]\n      // An infinite loop cannot occur as:\n      // - Either the lookahead is guaranteed to consume something (Single Token Separator)\n      // - AT_LEAST_ONE by definition is guaranteed to consume something (or error out).\n      notStuck,\n    );\n  }\n\n  manySepFirstInternal<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    options: ManySepMethodOpts<OUT>,\n  ): void {\n    const laKey = this.getKeyForAutomaticLookahead(\n      MANY_SEP_IDX,\n      prodOccurrence,\n    );\n    this.manySepFirstInternalLogic(prodOccurrence, options, laKey);\n  }\n\n  manySepFirstInternalLogic<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    options: ManySepMethodOpts<OUT>,\n    key: number,\n  ): void {\n    const action = options.DEF;\n    const separator = options.SEP;\n    const firstIterationLaFunc = this.getLaFuncFromCache(key);\n\n    // 1st iteration\n    if (firstIterationLaFunc.call(this) === true) {\n      action.call(this);\n\n      const separatorLookAheadFunc = () => {\n        return this.tokenMatcher(this.LA_FAST(1), separator);\n      };\n      // 2nd..nth iterations\n      while (this.tokenMatcher(this.LA_FAST(1), separator) === true) {\n        // note that this CONSUME will never enter recovery because\n        // the separatorLookAheadFunc checks that the separator really does exist.\n        this.CONSUME(separator);\n        // No need for checking infinite loop here due to consuming the separator.\n        action.call(this);\n      }\n\n      // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n      this.attemptInRepetitionRecovery(\n        this.repetitionSepSecondInternal,\n        [\n          prodOccurrence,\n          separator,\n          separatorLookAheadFunc,\n          action,\n          NextTerminalAfterManySepWalker,\n        ],\n        separatorLookAheadFunc,\n        MANY_SEP_IDX,\n        prodOccurrence,\n        NextTerminalAfterManySepWalker,\n      );\n    }\n  }\n\n  repetitionSepSecondInternal<OUT>(\n    this: MixedInParser,\n    prodOccurrence: number,\n    separator: TokenType,\n    separatorLookAheadFunc: () => boolean,\n    action: GrammarAction<OUT>,\n    nextTerminalAfterWalker: typeof AbstractNextTerminalAfterProductionWalker,\n  ): void {\n    while (separatorLookAheadFunc()) {\n      // note that this CONSUME will never enter recovery because\n      // the separatorLookAheadFunc checks that the separator really does exist.\n      this.CONSUME(separator);\n      action.call(this);\n    }\n\n    // we can only arrive to this function after an error\n    // has occurred (hence the name 'second') so the following\n    // IF will always be entered, its possible to remove it...\n    // however it is kept to avoid confusion and be consistent.\n    // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n    /* istanbul ignore else */\n    this.attemptInRepetitionRecovery(\n      this.repetitionSepSecondInternal,\n      [\n        prodOccurrence,\n        separator,\n        separatorLookAheadFunc,\n        action,\n        nextTerminalAfterWalker,\n      ],\n      separatorLookAheadFunc,\n      AT_LEAST_ONE_SEP_IDX,\n      prodOccurrence,\n      nextTerminalAfterWalker,\n    );\n  }\n\n  doSingleRepetition(this: MixedInParser, action: Function): any {\n    const beforeIteration = this.getLexerPosition();\n    action.call(this);\n    const afterIteration = this.getLexerPosition();\n\n    // This boolean will indicate if this repetition progressed\n    // or if we are \"stuck\" (potential infinite loop in the repetition).\n    return afterIteration > beforeIteration;\n  }\n\n  orInternal<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n    occurrence: number,\n  ): T {\n    const laKey = this.getKeyForAutomaticLookahead(OR_IDX, occurrence);\n    const alts = Array.isArray(altsOrOpts) ? altsOrOpts : altsOrOpts.DEF;\n\n    const laFunc = this.getLaFuncFromCache(laKey);\n    const altIdxToTake = laFunc.call(this, alts);\n    if (altIdxToTake !== undefined) {\n      const chosenAlternative: any = alts[altIdxToTake];\n      return chosenAlternative.ALT.call(this);\n    }\n    this.raiseNoAltException(\n      occurrence,\n      (altsOrOpts as OrMethodOpts<unknown>).ERR_MSG,\n    );\n  }\n\n  ruleFinallyStateUpdate(this: MixedInParser): void {\n    this.RULE_STACK_IDX--;\n    this.RULE_OCCURRENCE_STACK_IDX--;\n\n    // Restore the cached short name to the parent rule.\n    // When the stack is empty (top-level rule exiting), the stale value\n    // is harmless \u2014 no DSL methods will be called before the next ruleInvocationStateUpdate.\n    if (this.RULE_STACK_IDX >= 0) {\n      this.currRuleShortName = this.RULE_STACK[this.RULE_STACK_IDX];\n    }\n\n    // NOOP when cst is disabled\n    this.cstFinallyStateUpdate();\n  }\n\n  subruleInternal<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    idx: number,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R {\n    let ruleResult;\n    try {\n      const args = options !== undefined ? options.ARGS : undefined;\n      this.subruleIdx = idx;\n      // Use coreRule to bypass root-level hooks (onBeforeParse/onAfterParse)\n      ruleResult = ruleToCall.coreRule.apply(this, args);\n      this.cstPostNonTerminal(\n        ruleResult,\n        options !== undefined && options.LABEL !== undefined\n          ? options.LABEL\n          : ruleToCall.ruleName,\n      );\n      return ruleResult;\n    } catch (e) {\n      throw this.subruleInternalError(e, options, ruleToCall.ruleName);\n    }\n  }\n\n  subruleInternalError(\n    this: MixedInParser,\n    e: any,\n    options: SubruleMethodOpts<unknown[]> | undefined,\n    ruleName: string,\n  ): void {\n    if (isRecognitionException(e) && e.partialCstResult !== undefined) {\n      this.cstPostNonTerminal(\n        e.partialCstResult,\n        options !== undefined && options.LABEL !== undefined\n          ? options.LABEL\n          : ruleName,\n      );\n\n      delete e.partialCstResult;\n    }\n    throw e;\n  }\n\n  consumeInternal(\n    this: MixedInParser,\n    tokType: TokenType,\n    idx: number,\n    options: ConsumeMethodOpts | undefined,\n  ): IToken {\n    let consumedToken!: IToken;\n    try {\n      const nextToken = this.LA_FAST(1);\n      if (this.tokenMatcher(nextToken, tokType) === true) {\n        this.consumeToken();\n        consumedToken = nextToken;\n      } else {\n        this.consumeInternalError(tokType, nextToken, options);\n      }\n    } catch (eFromConsumption) {\n      consumedToken = this.consumeInternalRecovery(\n        tokType,\n        idx,\n        eFromConsumption,\n      );\n    }\n\n    this.cstPostTerminal(\n      options !== undefined && options.LABEL !== undefined\n        ? options.LABEL\n        : tokType.name,\n      consumedToken,\n    );\n    return consumedToken;\n  }\n\n  consumeInternalError(\n    this: MixedInParser,\n    tokType: TokenType,\n    nextToken: IToken,\n    options: ConsumeMethodOpts | undefined,\n  ): void {\n    let msg;\n    const previousToken = this.LA(0);\n    if (options !== undefined && options.ERR_MSG) {\n      msg = options.ERR_MSG;\n    } else {\n      msg = this.errorMessageProvider.buildMismatchTokenMessage({\n        expected: tokType,\n        actual: nextToken,\n        previous: previousToken,\n        ruleName: this.getCurrRuleFullName(),\n      });\n    }\n    throw this.SAVE_ERROR(\n      new MismatchedTokenException(msg, nextToken, previousToken),\n    );\n  }\n\n  consumeInternalRecovery(\n    this: MixedInParser,\n    tokType: TokenType,\n    idx: number,\n    eFromConsumption: Error,\n  ): IToken {\n    // no recovery allowed during backtracking, otherwise backtracking may recover invalid syntax and accept it\n    // but the original syntax could have been parsed successfully without any backtracking + recovery\n    if (\n      this.recoveryEnabled &&\n      // TODO: more robust checking of the exception type. Perhaps Typescript extending expressions?\n      eFromConsumption.name === \"MismatchedTokenException\" &&\n      !this.isBackTracking()\n    ) {\n      const follows = this.getFollowsForInRuleRecovery(<any>tokType, idx);\n      try {\n        return this.tryInRuleRecovery(<any>tokType, follows);\n      } catch (eFromInRuleRecovery) {\n        if (eFromInRuleRecovery.name === IN_RULE_RECOVERY_EXCEPTION) {\n          // failed in RuleRecovery.\n          // throw the original error in order to trigger reSync error recovery\n          throw eFromConsumption;\n        } else {\n          throw eFromInRuleRecovery;\n        }\n      }\n    } else {\n      throw eFromConsumption;\n    }\n  }\n\n  saveRecogState(this: MixedInParser): IParserState {\n    // errors is a getter which will clone the errors array\n    const savedErrors = this.errors;\n    // Slice only the active portion of the pre-allocated stack\n    const savedRuleStack = this.RULE_STACK.slice(0, this.RULE_STACK_IDX + 1);\n    return {\n      errors: savedErrors,\n      lexerState: this.exportLexerState(),\n      RULE_STACK: savedRuleStack,\n      CST_STACK: this.CST_STACK,\n    };\n  }\n\n  reloadRecogState(this: MixedInParser, newState: IParserState) {\n    this.errors = newState.errors;\n    this.importLexerState(newState.lexerState);\n    // Copy saved stack back into the pre-allocated array and restore the index\n    const saved = newState.RULE_STACK;\n    for (let i = 0; i < saved.length; i++) {\n      this.RULE_STACK[i] = saved[i];\n    }\n    this.RULE_STACK_IDX = saved.length - 1;\n    // Restore cached short name from the restored stack\n    if (this.RULE_STACK_IDX >= 0) {\n      this.currRuleShortName = this.RULE_STACK[this.RULE_STACK_IDX];\n    }\n  }\n\n  ruleInvocationStateUpdate(\n    this: MixedInParser,\n    shortName: number,\n    fullName: string,\n    idxInCallingRule: number,\n  ): void {\n    this.RULE_OCCURRENCE_STACK[++this.RULE_OCCURRENCE_STACK_IDX] =\n      idxInCallingRule;\n    this.RULE_STACK[++this.RULE_STACK_IDX] = shortName;\n    this.currRuleShortName = shortName;\n    // NOOP when cst is disabled\n    this.cstInvocationStateUpdate(fullName);\n  }\n\n  isBackTracking(this: MixedInParser): boolean {\n    return this.isBackTrackingStack.length !== 0;\n  }\n\n  getCurrRuleFullName(this: MixedInParser): string {\n    const shortName = this.currRuleShortName;\n    return this.shortRuleNameToFull[shortName];\n  }\n\n  shortRuleNameToFullName(this: MixedInParser, shortName: number) {\n    return this.shortRuleNameToFull[shortName];\n  }\n\n  public isAtEndOfInput(this: MixedInParser): boolean {\n    return this.tokenMatcher(this.LA(1), EOF);\n  }\n\n  public reset(this: MixedInParser): void {\n    this.resetLexerState();\n    this.subruleIdx = 0;\n    this.currRuleShortName = 0;\n    this.isBackTrackingStack = [];\n    this.errors = [];\n    // Reset depth counters but keep arrays allocated to avoid re-allocation.\n    // Stale number values in unused slots are harmless.\n    this.RULE_STACK_IDX = -1;\n    this.RULE_OCCURRENCE_STACK_IDX = -1;\n    // TODO: extract a specific reset for TreeBuilder trait\n    this.CST_STACK = [];\n  }\n\n  /**\n   * Hook called before the root-level parsing rule is invoked.\n   * This is only called when a rule is invoked directly by the consumer\n   * (e.g., `parser.json()`), not when invoked as a sub-rule via SUBRULE.\n   *\n   * Override this method to perform actions before parsing begins.\n   * The default implementation is a no-op.\n   *\n   * @param ruleName - The name of the root rule being invoked.\n   */\n  onBeforeParse(this: MixedInParser, ruleName: string): void {\n    // Pad with sentinels for bounds-free forward LA()\n    for (let i = 0; i < this.maxLookahead + 1; i++) {\n      this.tokVector.push(END_OF_FILE);\n    }\n  }\n\n  /**\n   * Hook called after the root-level parsing rule has completed (or thrown).\n   * This is only called when a rule is invoked directly by the consumer\n   * (e.g., `parser.json()`), not when invoked as a sub-rule via SUBRULE.\n   *\n   * This hook is called in a `finally` block, so it executes regardless of\n   * whether parsing succeeded or threw an error.\n   *\n   * Override this method to perform actions after parsing completes.\n   * The default implementation is a no-op.\n   *\n   * @param ruleName - The name of the root rule that was invoked.\n   */\n  onAfterParse(this: MixedInParser, ruleName: string): void {\n    if (this.isAtEndOfInput() === false) {\n      const firstRedundantTok = this.LA(1);\n      const errMsg = this.errorMessageProvider.buildNotAllInputParsedMessage({\n        firstRedundant: firstRedundantTok,\n        ruleName: this.getCurrRuleFullName(),\n      });\n      this.SAVE_ERROR(\n        new NotAllInputParsedException(errMsg, firstRedundantTok),\n      );\n    }\n\n    // undo the padding of sentinels for bounds-free forward LA() in onBeforeParse\n    while (this.tokVector.at(-1) === END_OF_FILE) {\n      this.tokVector.pop();\n    }\n  }\n}\n", "import {\n  IParserConfig,\n  IParserErrorMessageProvider,\n  IRecognitionException,\n} from \"@chevrotain/types\";\nimport {\n  EarlyExitException,\n  isRecognitionException,\n  NoViableAltException,\n} from \"../../exceptions_public.js\";\nimport {\n  getLookaheadPathsForOptionalProd,\n  getLookaheadPathsForOr,\n  PROD_TYPE,\n} from \"../../grammar/lookahead.js\";\nimport { MixedInParser } from \"./parser_traits.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n\n/**\n * Trait responsible for runtime parsing errors.\n */\nexport class ErrorHandler {\n  _errors: IRecognitionException[];\n  errorMessageProvider: IParserErrorMessageProvider;\n\n  initErrorHandler(config: IParserConfig) {\n    this._errors = [];\n    this.errorMessageProvider = Object.hasOwn(config, \"errorMessageProvider\")\n      ? (config.errorMessageProvider as IParserErrorMessageProvider) // assumes end user provides the correct config value/type\n      : DEFAULT_PARSER_CONFIG.errorMessageProvider;\n  }\n\n  SAVE_ERROR(\n    this: MixedInParser,\n    error: IRecognitionException,\n  ): IRecognitionException {\n    if (isRecognitionException(error)) {\n      error.context = {\n        ruleStack: this.getHumanReadableRuleStack(),\n        ruleOccurrenceStack: this.RULE_OCCURRENCE_STACK.slice(\n          0,\n          this.RULE_OCCURRENCE_STACK_IDX + 1,\n        ),\n      };\n      this._errors.push(error);\n      return error;\n    } else {\n      throw Error(\n        \"Trying to save an Error which is not a RecognitionException\",\n      );\n    }\n  }\n\n  get errors(): IRecognitionException[] {\n    return [...this._errors];\n  }\n\n  set errors(newErrors: IRecognitionException[]) {\n    this._errors = newErrors;\n  }\n\n  // TODO: consider caching the error message computed information\n  raiseEarlyExitException(\n    this: MixedInParser,\n    occurrence: number,\n    prodType: PROD_TYPE,\n    userDefinedErrMsg: string | undefined,\n  ): never {\n    const ruleName = this.getCurrRuleFullName();\n    const ruleGrammar = this.getGAstProductions()[ruleName];\n    const lookAheadPathsPerAlternative = getLookaheadPathsForOptionalProd(\n      occurrence,\n      ruleGrammar,\n      prodType,\n      this.maxLookahead,\n    );\n    const insideProdPaths = lookAheadPathsPerAlternative[0];\n    const actualTokens = [];\n    for (let i = 1; i <= this.maxLookahead; i++) {\n      actualTokens.push(this.LA(i));\n    }\n    const msg = this.errorMessageProvider.buildEarlyExitMessage({\n      expectedIterationPaths: insideProdPaths,\n      actual: actualTokens,\n      previous: this.LA(0),\n      customUserDescription: userDefinedErrMsg,\n      ruleName: ruleName,\n    });\n\n    throw this.SAVE_ERROR(new EarlyExitException(msg, this.LA(1), this.LA(0)));\n  }\n\n  // TODO: consider caching the error message computed information\n  raiseNoAltException(\n    this: MixedInParser,\n    occurrence: number,\n    errMsgTypes: string | undefined,\n  ): never {\n    const ruleName = this.getCurrRuleFullName();\n    const ruleGrammar = this.getGAstProductions()[ruleName];\n    // TODO: getLookaheadPathsForOr can be slow for large enough maxLookahead and certain grammars, consider caching ?\n    const lookAheadPathsPerAlternative = getLookaheadPathsForOr(\n      occurrence,\n      ruleGrammar,\n      this.maxLookahead,\n    );\n\n    const actualTokens = [];\n    for (let i = 1; i <= this.maxLookahead; i++) {\n      actualTokens.push(this.LA(i));\n    }\n    const previousToken = this.LA(0);\n\n    const errMsg = this.errorMessageProvider.buildNoViableAltMessage({\n      expectedPathsPerAlt: lookAheadPathsPerAlternative,\n      actual: actualTokens,\n      previous: previousToken,\n      customUserDescription: errMsgTypes,\n      ruleName: this.getCurrRuleFullName(),\n    });\n\n    throw this.SAVE_ERROR(\n      new NoViableAltException(errMsg, this.LA(1), previousToken),\n    );\n  }\n}\n", "import {\n  AtLeastOneSepMethodOpts,\n  ConsumeMethodOpts,\n  CstNode,\n  DSLMethodOpts,\n  DSLMethodOptsWithErr,\n  GrammarAction,\n  IOrAlt,\n  IParserConfig,\n  IProduction,\n  IToken,\n  ManySepMethodOpts,\n  OrMethodOpts,\n  SubruleMethodOpts,\n  TokenType,\n} from \"@chevrotain/types\";\n\nimport { MixedInParser } from \"./parser_traits.js\";\nimport {\n  Alternation,\n  Alternative,\n  NonTerminal,\n  Option,\n  Repetition,\n  RepetitionMandatory,\n  RepetitionMandatoryWithSeparator,\n  RepetitionWithSeparator,\n  Rule,\n  Terminal,\n} from \"@chevrotain/gast\";\nimport { Lexer } from \"../../../scan/lexer_public.js\";\nimport {\n  augmentTokenTypes,\n  hasShortKeyProperty,\n} from \"../../../scan/tokens.js\";\nimport {\n  createToken,\n  createTokenInstance,\n} from \"../../../scan/tokens_public.js\";\nimport { END_OF_FILE } from \"../parser.js\";\nimport { BITS_FOR_OCCURRENCE_IDX } from \"../../grammar/keys.js\";\nimport { ParserMethodInternal } from \"../types.js\";\n\ntype ProdWithDef = IProduction & { definition?: IProduction[] };\nconst RECORDING_NULL_OBJECT = {\n  description: \"This Object indicates the Parser is during Recording Phase\",\n};\nObject.freeze(RECORDING_NULL_OBJECT);\n\nconst HANDLE_SEPARATOR = true;\nconst MAX_METHOD_IDX = Math.pow(2, BITS_FOR_OCCURRENCE_IDX) - 1;\n\nconst RFT = createToken({ name: \"RECORDING_PHASE_TOKEN\", pattern: Lexer.NA });\naugmentTokenTypes([RFT]);\nconst RECORDING_PHASE_TOKEN = createTokenInstance(\n  RFT,\n  \"This IToken indicates the Parser is in Recording Phase\\n\\t\" +\n    \"\" +\n    \"See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details\",\n  // Using \"-1\" instead of NaN (as in EOF) because an actual number is less likely to\n  // cause errors if the output of LA or CONSUME would be (incorrectly) used during the recording phase.\n  -1,\n  -1,\n  -1,\n  -1,\n  -1,\n  -1,\n);\nObject.freeze(RECORDING_PHASE_TOKEN);\n\nconst RECORDING_PHASE_CSTNODE: CstNode = {\n  name:\n    \"This CSTNode indicates the Parser is in Recording Phase\\n\\t\" +\n    \"See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details\",\n  children: {},\n};\n\n/**\n * This trait handles the creation of the GAST structure for Chevrotain Grammars\n */\nexport class GastRecorder {\n  recordingProdStack: ProdWithDef[];\n  RECORDING_PHASE: boolean;\n\n  initGastRecorder(this: MixedInParser, config: IParserConfig): void {\n    this.recordingProdStack = [];\n    this.RECORDING_PHASE = false;\n  }\n\n  enableRecording(this: MixedInParser): void {\n    this.RECORDING_PHASE = true;\n\n    this.TRACE_INIT(\"Enable Recording\", () => {\n      /**\n       * Warning Dark Voodoo Magic upcoming!\n       * We are \"replacing\" the public parsing DSL methods API\n       * With **new** alternative implementations on the Parser **instance**\n       *\n       * So far this is the only way I've found to avoid performance regressions during parsing time.\n       * - Approx 30% performance regression was measured on Chrome 75 Canary when attempting to replace the \"internal\"\n       *   implementations directly instead.\n       */\n      for (let i = 0; i < 10; i++) {\n        const idx = i > 0 ? i : \"\";\n        this[`CONSUME${idx}` as \"CONSUME\"] = function (arg1, arg2) {\n          return this.consumeInternalRecord(arg1, i, arg2);\n        };\n        this[`SUBRULE${idx}` as \"SUBRULE\"] = function (arg1, arg2) {\n          return this.subruleInternalRecord(arg1, i, arg2) as any;\n        };\n        this[`OPTION${idx}` as \"OPTION\"] = function (arg1) {\n          return this.optionInternalRecord(arg1, i);\n        };\n        this[`OR${idx}` as \"OR\"] = function (arg1) {\n          return this.orInternalRecord(arg1, i);\n        };\n        this[`MANY${idx}` as \"MANY\"] = function (arg1) {\n          this.manyInternalRecord(i, arg1);\n        };\n        this[`MANY_SEP${idx}` as \"MANY_SEP\"] = function (arg1) {\n          this.manySepFirstInternalRecord(i, arg1);\n        };\n        this[`AT_LEAST_ONE${idx}` as \"AT_LEAST_ONE\"] = function (arg1) {\n          this.atLeastOneInternalRecord(i, arg1);\n        };\n        this[`AT_LEAST_ONE_SEP${idx}` as \"AT_LEAST_ONE_SEP\"] = function (arg1) {\n          this.atLeastOneSepFirstInternalRecord(i, arg1);\n        };\n      }\n\n      // DSL methods with the idx(suffix) as an argument\n      this[`consume`] = function (idx, arg1, arg2) {\n        return this.consumeInternalRecord(arg1, idx, arg2);\n      };\n      this[`subrule`] = function (idx, arg1, arg2) {\n        return this.subruleInternalRecord(arg1, idx, arg2) as any;\n      };\n      this[`option`] = function (idx, arg1) {\n        return this.optionInternalRecord(arg1, idx);\n      };\n      this[`or`] = function (idx, arg1) {\n        return this.orInternalRecord(arg1, idx);\n      };\n      this[`many`] = function (idx, arg1) {\n        this.manyInternalRecord(idx, arg1);\n      };\n      this[`atLeastOne`] = function (idx, arg1) {\n        this.atLeastOneInternalRecord(idx, arg1);\n      };\n\n      this.ACTION = this.ACTION_RECORD;\n      this.BACKTRACK = this.BACKTRACK_RECORD;\n      this.LA = this.LA_RECORD;\n    });\n  }\n\n  disableRecording(this: MixedInParser) {\n    this.RECORDING_PHASE = false;\n    // By deleting these **instance** properties, any future invocation\n    // will be deferred to the original methods on the **prototype** object\n    // This seems to get rid of any incorrect optimizations that V8 may\n    // do during the recording phase.\n    this.TRACE_INIT(\"Deleting Recording methods\", () => {\n      const that: any = this;\n\n      for (let i = 0; i < 10; i++) {\n        const idx = i > 0 ? i : \"\";\n        delete that[`CONSUME${idx}`];\n        delete that[`SUBRULE${idx}`];\n        delete that[`OPTION${idx}`];\n        delete that[`OR${idx}`];\n        delete that[`MANY${idx}`];\n        delete that[`MANY_SEP${idx}`];\n        delete that[`AT_LEAST_ONE${idx}`];\n        delete that[`AT_LEAST_ONE_SEP${idx}`];\n      }\n\n      delete that[`consume`];\n      delete that[`subrule`];\n      delete that[`option`];\n      delete that[`or`];\n      delete that[`many`];\n      delete that[`atLeastOne`];\n\n      delete that.ACTION;\n      delete that.BACKTRACK;\n      delete that.LA;\n    });\n  }\n\n  //   Parser methods are called inside an ACTION?\n  //   Maybe try/catch/finally on ACTIONS while disabling the recorders state changes?\n  // @ts-expect-error -- noop place holder\n  ACTION_RECORD<T>(this: MixedInParser, impl: () => T): T {\n    // NO-OP during recording\n  }\n\n  // Executing backtracking logic will break our recording logic assumptions\n  BACKTRACK_RECORD<T>(\n    grammarRule: (...args: any[]) => T,\n    args?: any[],\n  ): () => boolean {\n    return () => true;\n  }\n\n  // LA is part of the official API and may be used for custom lookahead logic\n  // by end users who may forget to wrap it in ACTION or inside a GATE\n  LA_RECORD(howMuch: number): IToken {\n    // We cannot use the RECORD_PHASE_TOKEN here because someone may depend\n    // On LA return EOF at the end of the input so an infinite loop may occur.\n    return END_OF_FILE;\n  }\n\n  topLevelRuleRecord(name: string, def: Function): Rule {\n    try {\n      const newTopLevelRule = new Rule({ definition: [], name: name });\n      newTopLevelRule.name = name;\n      this.recordingProdStack.push(newTopLevelRule);\n      def.call(this);\n      this.recordingProdStack.pop();\n      return newTopLevelRule;\n    } catch (originalError) {\n      if (originalError.KNOWN_RECORDER_ERROR !== true) {\n        try {\n          originalError.message =\n            originalError.message +\n            '\\n\\t This error was thrown during the \"grammar recording phase\" For more info see:\\n\\t' +\n            \"https://chevrotain.io/docs/guide/internals.html#grammar-recording\";\n        } catch (mutabilityError) {\n          // We may not be able to modify the original error object\n          throw originalError;\n        }\n      }\n      throw originalError;\n    }\n  }\n\n  // Implementation of parsing DSL\n  optionInternalRecord<OUT>(\n    this: MixedInParser,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n    occurrence: number,\n  ): OUT {\n    return recordProd.call(this, Option, actionORMethodDef, occurrence);\n  }\n\n  atLeastOneInternalRecord<OUT>(\n    this: MixedInParser,\n    occurrence: number,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOptsWithErr<OUT>,\n  ): void {\n    recordProd.call(this, RepetitionMandatory, actionORMethodDef, occurrence);\n  }\n\n  atLeastOneSepFirstInternalRecord<OUT>(\n    this: MixedInParser,\n    occurrence: number,\n    options: AtLeastOneSepMethodOpts<OUT>,\n  ): void {\n    recordProd.call(\n      this,\n      RepetitionMandatoryWithSeparator,\n      options,\n      occurrence,\n      HANDLE_SEPARATOR,\n    );\n  }\n\n  manyInternalRecord<OUT>(\n    this: MixedInParser,\n    occurrence: number,\n    actionORMethodDef: GrammarAction<OUT> | DSLMethodOpts<OUT>,\n  ): void {\n    recordProd.call(this, Repetition, actionORMethodDef, occurrence);\n  }\n\n  manySepFirstInternalRecord<OUT>(\n    this: MixedInParser,\n    occurrence: number,\n    options: ManySepMethodOpts<OUT>,\n  ): void {\n    recordProd.call(\n      this,\n      RepetitionWithSeparator,\n      options,\n      occurrence,\n      HANDLE_SEPARATOR,\n    );\n  }\n\n  orInternalRecord<T>(\n    this: MixedInParser,\n    altsOrOpts: IOrAlt<any>[] | OrMethodOpts<unknown>,\n    occurrence: number,\n  ): T {\n    return recordOrProd.call(this, altsOrOpts, occurrence);\n  }\n\n  subruleInternalRecord<ARGS extends unknown[], R>(\n    this: MixedInParser,\n    ruleToCall: ParserMethodInternal<ARGS, R>,\n    occurrence: number,\n    options?: SubruleMethodOpts<ARGS>,\n  ): R | CstNode {\n    assertMethodIdxIsValid(occurrence);\n    if (!ruleToCall || !Object.hasOwn(ruleToCall, \"ruleName\")) {\n      const error: any = new Error(\n        `<SUBRULE${getIdxSuffix(occurrence)}> argument is invalid` +\n          ` expecting a Parser method reference but got: <${JSON.stringify(\n            ruleToCall,\n          )}>` +\n          `\\n inside top level rule: <${\n            (<Rule>this.recordingProdStack[0]).name\n          }>`,\n      );\n      error.KNOWN_RECORDER_ERROR = true;\n      throw error;\n    }\n\n    const prevProd: any = this.recordingProdStack.at(-1);\n    const ruleName = ruleToCall.ruleName;\n    const newNoneTerminal = new NonTerminal({\n      idx: occurrence,\n      nonTerminalName: ruleName,\n      label: options?.LABEL,\n      // The resolving of the `referencedRule` property will be done once all the Rule's GASTs have been created\n      referencedRule: undefined,\n    });\n    prevProd.definition.push(newNoneTerminal);\n\n    return this.outputCst\n      ? RECORDING_PHASE_CSTNODE\n      : <any>RECORDING_NULL_OBJECT;\n  }\n\n  consumeInternalRecord(\n    this: MixedInParser,\n    tokType: TokenType,\n    occurrence: number,\n    options?: ConsumeMethodOpts,\n  ): IToken {\n    assertMethodIdxIsValid(occurrence);\n    if (!hasShortKeyProperty(tokType)) {\n      const error: any = new Error(\n        `<CONSUME${getIdxSuffix(occurrence)}> argument is invalid` +\n          ` expecting a TokenType reference but got: <${JSON.stringify(\n            tokType,\n          )}>` +\n          `\\n inside top level rule: <${\n            (<Rule>this.recordingProdStack[0]).name\n          }>`,\n      );\n      error.KNOWN_RECORDER_ERROR = true;\n      throw error;\n    }\n    const prevProd: any = this.recordingProdStack.at(-1);\n    const newNoneTerminal = new Terminal({\n      idx: occurrence,\n      terminalType: tokType,\n      label: options?.LABEL,\n    });\n    prevProd.definition.push(newNoneTerminal);\n\n    return RECORDING_PHASE_TOKEN;\n  }\n}\n\nfunction recordProd(\n  prodConstructor: any,\n  mainProdArg: any,\n  occurrence: number,\n  handleSep: boolean = false,\n): any {\n  assertMethodIdxIsValid(occurrence);\n  const prevProd: any = this.recordingProdStack.at(-1);\n  const grammarAction =\n    typeof mainProdArg === \"function\" ? mainProdArg : mainProdArg.DEF;\n\n  const newProd = new prodConstructor({ definition: [], idx: occurrence });\n  if (handleSep) {\n    newProd.separator = mainProdArg.SEP;\n  }\n  if (Object.hasOwn(mainProdArg, \"MAX_LOOKAHEAD\")) {\n    newProd.maxLookahead = mainProdArg.MAX_LOOKAHEAD;\n  }\n\n  this.recordingProdStack.push(newProd);\n  grammarAction.call(this);\n  prevProd.definition.push(newProd);\n  this.recordingProdStack.pop();\n\n  return RECORDING_NULL_OBJECT;\n}\n\nfunction recordOrProd(mainProdArg: any, occurrence: number): any {\n  assertMethodIdxIsValid(occurrence);\n  const prevProd: any = this.recordingProdStack.at(-1);\n  // Only an array of alternatives\n  const hasOptions = Array.isArray(mainProdArg) === false;\n  const alts: IOrAlt<unknown>[] =\n    hasOptions === false ? mainProdArg : mainProdArg.DEF;\n\n  const newOrProd = new Alternation({\n    definition: [],\n    idx: occurrence,\n    ignoreAmbiguities: hasOptions && mainProdArg.IGNORE_AMBIGUITIES === true,\n  });\n  if (Object.hasOwn(mainProdArg, \"MAX_LOOKAHEAD\")) {\n    newOrProd.maxLookahead = mainProdArg.MAX_LOOKAHEAD;\n  }\n\n  const hasPredicates = alts.some(\n    (currAlt: any) => typeof currAlt.GATE === \"function\",\n  );\n  newOrProd.hasPredicates = hasPredicates;\n\n  prevProd.definition.push(newOrProd);\n\n  alts.forEach((currAlt) => {\n    const currAltFlat = new Alternative({ definition: [] });\n    newOrProd.definition.push(currAltFlat);\n    if (Object.hasOwn(currAlt, \"IGNORE_AMBIGUITIES\")) {\n      currAltFlat.ignoreAmbiguities = currAlt.IGNORE_AMBIGUITIES as boolean; // assumes end user provides the correct config value/type\n    }\n    // **implicit** ignoreAmbiguities due to usage of gate\n    else if (Object.hasOwn(currAlt, \"GATE\")) {\n      currAltFlat.ignoreAmbiguities = true;\n    }\n    this.recordingProdStack.push(currAltFlat);\n    currAlt.ALT.call(this);\n    this.recordingProdStack.pop();\n  });\n  return RECORDING_NULL_OBJECT;\n}\n\nfunction getIdxSuffix(idx: number): string {\n  return idx === 0 ? \"\" : `${idx}`;\n}\n\nfunction assertMethodIdxIsValid(idx: number): void {\n  if (idx < 0 || idx > MAX_METHOD_IDX) {\n    const error: any = new Error(\n      // The stack trace will contain all the needed details\n      `Invalid DSL Method idx value: <${idx}>\\n\\t` +\n        `Idx value must be a none negative value smaller than ${\n          MAX_METHOD_IDX + 1\n        }`,\n    );\n    error.KNOWN_RECORDER_ERROR = true;\n    throw error;\n  }\n}\n", "import { IParserConfig } from \"@chevrotain/types\";\nimport { timer } from \"@chevrotain/utils\";\nimport { MixedInParser } from \"./parser_traits.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n\n/**\n * Trait responsible for runtime parsing errors.\n */\nexport class PerformanceTracer {\n  traceInitPerf: boolean | number;\n  traceInitMaxIdent: number;\n  traceInitIndent: number;\n\n  initPerformanceTracer(config: IParserConfig) {\n    if (Object.hasOwn(config, \"traceInitPerf\")) {\n      const userTraceInitPerf = config.traceInitPerf;\n      const traceIsNumber = typeof userTraceInitPerf === \"number\";\n      this.traceInitMaxIdent = traceIsNumber\n        ? <number>userTraceInitPerf\n        : Infinity;\n      this.traceInitPerf = traceIsNumber\n        ? userTraceInitPerf > 0\n        : (userTraceInitPerf as boolean); // assumes end user provides the correct config value/type\n    } else {\n      this.traceInitMaxIdent = 0;\n      this.traceInitPerf = DEFAULT_PARSER_CONFIG.traceInitPerf;\n    }\n\n    this.traceInitIndent = -1;\n  }\n\n  TRACE_INIT<T>(this: MixedInParser, phaseDesc: string, phaseImpl: () => T): T {\n    // No need to optimize this using NOOP pattern because\n    // It is not called in a hot spot...\n    if (this.traceInitPerf === true) {\n      this.traceInitIndent++;\n      const indent = new Array(this.traceInitIndent + 1).join(\"\\t\");\n      if (this.traceInitIndent < this.traceInitMaxIdent) {\n        console.log(`${indent}--> <${phaseDesc}>`);\n      }\n      const { time, value } = timer(phaseImpl);\n      /* istanbul ignore next - Difficult to reproduce specific performance behavior (>10ms) in tests */\n      const traceMethod = time > 10 ? console.warn : console.log;\n      if (this.traceInitIndent < this.traceInitMaxIdent) {\n        traceMethod(`${indent}<-- <${phaseDesc}> time: ${time}ms`);\n      }\n      this.traceInitIndent--;\n      return value;\n    } else {\n      return phaseImpl();\n    }\n  }\n}\n", "export function applyMixins(derivedCtor: any, baseCtors: any[]) {\n  baseCtors.forEach((baseCtor) => {\n    const baseProto = baseCtor.prototype;\n    Object.getOwnPropertyNames(baseProto).forEach((propName) => {\n      if (propName === \"constructor\") {\n        return;\n      }\n\n      const basePropDescriptor = Object.getOwnPropertyDescriptor(\n        baseProto,\n        propName,\n      );\n      // Handle Accessors\n      if (\n        basePropDescriptor &&\n        (basePropDescriptor.get || basePropDescriptor.set)\n      ) {\n        Object.defineProperty(\n          derivedCtor.prototype,\n          propName,\n          basePropDescriptor,\n        );\n      } else {\n        derivedCtor.prototype[propName] = baseCtor.prototype[propName];\n      }\n    });\n  });\n}\n", "import { toFastProperties } from \"@chevrotain/utils\";\nimport { computeAllProdsFollows } from \"../grammar/follow.js\";\nimport { createTokenInstance, EOF } from \"../../scan/tokens_public.js\";\nimport {\n  defaultGrammarValidatorErrorProvider,\n  defaultParserErrorProvider,\n} from \"../errors_public.js\";\nimport {\n  resolveGrammar,\n  validateGrammar,\n} from \"../grammar/gast/gast_resolver_public.js\";\nimport {\n  CstNode,\n  IParserConfig,\n  IRecognitionException,\n  IRuleConfig,\n  IToken,\n  TokenType,\n  TokenVocabulary,\n} from \"@chevrotain/types\";\nimport { Recoverable } from \"./traits/recoverable.js\";\nimport { LooksAhead } from \"./traits/looksahead.js\";\nimport { TreeBuilder } from \"./traits/tree_builder.js\";\nimport { LexerAdapter } from \"./traits/lexer_adapter.js\";\nimport { RecognizerApi } from \"./traits/recognizer_api.js\";\nimport { RecognizerEngine } from \"./traits/recognizer_engine.js\";\n\nimport { ErrorHandler } from \"./traits/error_handler.js\";\nimport { MixedInParser } from \"./traits/parser_traits.js\";\nimport { GastRecorder } from \"./traits/gast_recorder.js\";\nimport { PerformanceTracer } from \"./traits/perf_tracer.js\";\nimport { applyMixins } from \"./utils/apply_mixins.js\";\nimport { IParserDefinitionError } from \"../grammar/types.js\";\nimport { Rule } from \"@chevrotain/gast\";\nimport { IParserConfigInternal, ParserMethodInternal } from \"./types.js\";\nimport { validateLookahead } from \"../grammar/checks.js\";\n\nexport const END_OF_FILE = createTokenInstance(\n  EOF,\n  \"\",\n  NaN,\n  NaN,\n  NaN,\n  NaN,\n  NaN,\n  NaN,\n);\nObject.freeze(END_OF_FILE);\n\nexport type TokenMatcher = (token: IToken, tokType: TokenType) => boolean;\n\nexport const DEFAULT_PARSER_CONFIG: Required<\n  Omit<IParserConfigInternal, \"lookaheadStrategy\">\n> = Object.freeze({\n  recoveryEnabled: false,\n  maxLookahead: 3,\n  dynamicTokensEnabled: false,\n  outputCst: true,\n  errorMessageProvider: defaultParserErrorProvider,\n  nodeLocationTracking: \"none\",\n  traceInitPerf: false,\n  skipValidations: false,\n});\n\nexport const DEFAULT_RULE_CONFIG: Required<IRuleConfig<any>> = Object.freeze({\n  recoveryValueFunc: () => undefined,\n  resyncEnabled: true,\n});\n\nexport enum ParserDefinitionErrorType {\n  INVALID_RULE_NAME = 0,\n  DUPLICATE_RULE_NAME = 1,\n  INVALID_RULE_OVERRIDE = 2,\n  DUPLICATE_PRODUCTIONS = 3,\n  UNRESOLVED_SUBRULE_REF = 4,\n  LEFT_RECURSION = 5,\n  NONE_LAST_EMPTY_ALT = 6,\n  AMBIGUOUS_ALTS = 7,\n  CONFLICT_TOKENS_RULES_NAMESPACE = 8,\n  INVALID_TOKEN_NAME = 9,\n  NO_NON_EMPTY_LOOKAHEAD = 10,\n  AMBIGUOUS_PREFIX_ALTS = 11,\n  TOO_MANY_ALTS = 12,\n  CUSTOM_LOOKAHEAD_VALIDATION = 13,\n}\n\nexport interface IParserDuplicatesDefinitionError extends IParserDefinitionError {\n  dslName: string;\n  occurrence: number;\n  parameter?: string;\n}\n\nexport interface IParserEmptyAlternativeDefinitionError extends IParserDefinitionError {\n  occurrence: number;\n  alternative: number;\n}\n\nexport interface IParserAmbiguousAlternativesDefinitionError extends IParserDefinitionError {\n  occurrence: number | string;\n  alternatives: number[];\n}\n\nexport interface IParserUnresolvedRefDefinitionError extends IParserDefinitionError {\n  unresolvedRefName: string;\n}\n\nexport interface IParserState {\n  errors: IRecognitionException[];\n  lexerState: any;\n  RULE_STACK: number[];\n  CST_STACK: CstNode[];\n}\n\nexport type Predicate = () => boolean;\n\nexport function EMPTY_ALT(): () => undefined;\nexport function EMPTY_ALT<T>(value: T): () => T;\nexport function EMPTY_ALT(value: any = undefined) {\n  return function () {\n    return value;\n  };\n}\n\nexport class Parser {\n  // Set this flag to true if you don't want the Parser to throw error when problems in it's definition are detected.\n  // (normally during the parser's constructor).\n  // This is a design time flag, it will not affect the runtime error handling of the parser, just design time errors,\n  // for example: duplicate rule names, referencing an unresolved subrule, etc...\n  // This flag should not be enabled during normal usage, it is used in special situations, for example when\n  // needing to display the parser definition errors in some GUI(online playground).\n  static DEFER_DEFINITION_ERRORS_HANDLING: boolean = false;\n\n  /**\n   *  @deprecated use the **instance** method with the same name instead\n   */\n  static performSelfAnalysis(parserInstance: Parser): void {\n    throw Error(\n      \"The **static** `performSelfAnalysis` method has been deprecated.\" +\n        \"\\t\\nUse the **instance** method with the same name instead.\",\n    );\n  }\n\n  public performSelfAnalysis(this: MixedInParser): void {\n    this.TRACE_INIT(\"performSelfAnalysis\", () => {\n      let defErrorsMsgs;\n\n      this.selfAnalysisDone = true;\n      const className = this.className;\n\n      this.TRACE_INIT(\"toFastProps\", () => {\n        // Without this voodoo magic the parser would be x3-x4 slower\n        // It seems it is better to invoke `toFastProperties` **before**\n        // Any manipulations of the `this` object done during the recording phase.\n        toFastProperties(this);\n      });\n\n      this.TRACE_INIT(\"Grammar Recording\", () => {\n        try {\n          this.enableRecording();\n          // Building the GAST\n          this.definedRulesNames.forEach((currRuleName: string) => {\n            const wrappedRule = (this as any)[\n              currRuleName\n            ] as ParserMethodInternal<unknown[], unknown>;\n            const originalGrammarAction = wrappedRule[\"originalGrammarAction\"];\n            let recordedRuleGast!: Rule;\n            this.TRACE_INIT(`${currRuleName} Rule`, () => {\n              recordedRuleGast = this.topLevelRuleRecord(\n                currRuleName,\n                originalGrammarAction,\n              );\n            });\n            this.gastProductionsCache[currRuleName] = recordedRuleGast;\n          });\n        } finally {\n          this.disableRecording();\n        }\n      });\n\n      let resolverErrors: IParserDefinitionError[] = [];\n      this.TRACE_INIT(\"Grammar Resolving\", () => {\n        resolverErrors = resolveGrammar({\n          rules: Object.values(this.gastProductionsCache),\n        });\n        this.definitionErrors = this.definitionErrors.concat(resolverErrors);\n      });\n\n      this.TRACE_INIT(\"Grammar Validations\", () => {\n        // only perform additional grammar validations IFF no resolving errors have occurred.\n        // as unresolved grammar may lead to unhandled runtime exceptions in the follow up validations.\n        if (resolverErrors.length === 0 && this.skipValidations === false) {\n          const validationErrors = validateGrammar({\n            rules: Object.values(this.gastProductionsCache),\n            tokenTypes: Object.values(this.tokensMap),\n            errMsgProvider: defaultGrammarValidatorErrorProvider,\n            grammarName: className,\n          });\n          const lookaheadValidationErrors = validateLookahead({\n            lookaheadStrategy: this.lookaheadStrategy,\n            rules: Object.values(this.gastProductionsCache),\n            tokenTypes: Object.values(this.tokensMap),\n            grammarName: className,\n          });\n          this.definitionErrors = this.definitionErrors.concat(\n            validationErrors,\n            lookaheadValidationErrors,\n          );\n        }\n      });\n\n      // this analysis may fail if the grammar is not perfectly valid\n      if (this.definitionErrors.length === 0) {\n        // The results of these computations are not needed unless error recovery is enabled.\n        if (this.recoveryEnabled) {\n          this.TRACE_INIT(\"computeAllProdsFollows\", () => {\n            const allFollows = computeAllProdsFollows(\n              Object.values(this.gastProductionsCache),\n            );\n            this.resyncFollows = allFollows;\n          });\n        }\n\n        this.TRACE_INIT(\"ComputeLookaheadFunctions\", () => {\n          this.lookaheadStrategy.initialize?.({\n            rules: Object.values(this.gastProductionsCache),\n          });\n          this.preComputeLookaheadFunctions(\n            Object.values(this.gastProductionsCache),\n          );\n        });\n      }\n\n      if (\n        !Parser.DEFER_DEFINITION_ERRORS_HANDLING &&\n        this.definitionErrors.length !== 0\n      ) {\n        defErrorsMsgs = this.definitionErrors.map(\n          (defError) => defError.message,\n        );\n        throw new Error(\n          `Parser Definition Errors detected:\\n ${defErrorsMsgs.join(\n            \"\\n-------------------------------\\n\",\n          )}`,\n        );\n      }\n    });\n  }\n\n  definitionErrors: IParserDefinitionError[] = [];\n  selfAnalysisDone = false;\n  protected skipValidations: boolean;\n\n  constructor(tokenVocabulary: TokenVocabulary, config: IParserConfig) {\n    const that: MixedInParser = this as any;\n    that.initErrorHandler(config);\n    that.initLexerAdapter();\n    that.initLooksAhead(config);\n    that.initRecognizerEngine(tokenVocabulary, config);\n    that.initRecoverable(config);\n    that.initTreeBuilder(config);\n    that.initGastRecorder(config);\n    that.initPerformanceTracer(config);\n\n    if (Object.hasOwn(config, \"ignoredIssues\")) {\n      throw new Error(\n        \"The <ignoredIssues> IParserConfig property has been deprecated.\\n\\t\" +\n          \"Please use the <IGNORE_AMBIGUITIES> flag on the relevant DSL method instead.\\n\\t\" +\n          \"See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#IGNORING_AMBIGUITIES\\n\\t\" +\n          \"For further details.\",\n      );\n    }\n\n    this.skipValidations = Object.hasOwn(config, \"skipValidations\")\n      ? (config.skipValidations as boolean) // casting assumes the end user passing the correct type\n      : DEFAULT_PARSER_CONFIG.skipValidations;\n  }\n}\n\napplyMixins(Parser, [\n  Recoverable,\n  LooksAhead,\n  TreeBuilder,\n  LexerAdapter,\n  RecognizerEngine,\n  RecognizerApi,\n  ErrorHandler,\n  GastRecorder,\n  PerformanceTracer,\n]);\n\nexport class CstParser extends Parser {\n  constructor(\n    tokenVocabulary: TokenVocabulary,\n    config: IParserConfigInternal = DEFAULT_PARSER_CONFIG,\n  ) {\n    const configClone = { ...config };\n    configClone.outputCst = true;\n    super(tokenVocabulary, configClone);\n  }\n}\n\nexport class EmbeddedActionsParser extends Parser {\n  constructor(\n    tokenVocabulary: TokenVocabulary,\n    config: IParserConfigInternal = DEFAULT_PARSER_CONFIG,\n  ) {\n    const configClone = { ...config };\n    configClone.outputCst = false;\n    super(tokenVocabulary, configClone);\n  }\n}\n", "/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nexport default arrayMap;\n", "/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nexport default listCacheClear;\n", "/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n", "import eq from './eq.js';\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nexport default assocIndexOf;\n", "import assocIndexOf from './_assocIndexOf.js';\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nexport default listCacheDelete;\n", "import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nexport default listCacheGet;\n", "import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nexport default listCacheHas;\n", "import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nexport default listCacheSet;\n", "import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n", "import ListCache from './_ListCache.js';\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nexport default stackClear;\n", "/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nexport default stackDelete;\n", "/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nexport default stackGet;\n", "/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nexport default stackHas;\n", "/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n", "import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n", "import root from './_root.js';\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nexport default Symbol;\n", "import Symbol from './_Symbol.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nexport default getRawTag;\n", "/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n", "import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nexport default baseGetTag;\n", "/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n", "import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nexport default isFunction;\n", "import root from './_root.js';\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nexport default coreJsData;\n", "import coreJsData from './_coreJsData.js';\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nexport default isMasked;\n", "/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nexport default toSource;\n", "import isFunction from './isFunction.js';\nimport isMasked from './_isMasked.js';\nimport isObject from './isObject.js';\nimport toSource from './_toSource.js';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nexport default baseIsNative;\n", "/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nexport default getValue;\n", "import baseIsNative from './_baseIsNative.js';\nimport getValue from './_getValue.js';\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nexport default getNative;\n", "import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nexport default Map;\n", "import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n", "import nativeCreate from './_nativeCreate.js';\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nexport default hashClear;\n", "/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default hashDelete;\n", "import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nexport default hashGet;\n", "import nativeCreate from './_nativeCreate.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nexport default hashHas;\n", "import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nexport default hashSet;\n", "import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n", "import Hash from './_Hash.js';\nimport ListCache from './_ListCache.js';\nimport Map from './_Map.js';\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nexport default mapCacheClear;\n", "/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nexport default isKeyable;\n", "import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nexport default getMapData;\n", "import getMapData from './_getMapData.js';\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default mapCacheDelete;\n", "import getMapData from './_getMapData.js';\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nexport default mapCacheGet;\n", "import getMapData from './_getMapData.js';\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nexport default mapCacheHas;\n", "import getMapData from './_getMapData.js';\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nexport default mapCacheSet;\n", "import mapCacheClear from './_mapCacheClear.js';\nimport mapCacheDelete from './_mapCacheDelete.js';\nimport mapCacheGet from './_mapCacheGet.js';\nimport mapCacheHas from './_mapCacheHas.js';\nimport mapCacheSet from './_mapCacheSet.js';\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nexport default MapCache;\n", "import ListCache from './_ListCache.js';\nimport Map from './_Map.js';\nimport MapCache from './_MapCache.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nexport default stackSet;\n", "import ListCache from './_ListCache.js';\nimport stackClear from './_stackClear.js';\nimport stackDelete from './_stackDelete.js';\nimport stackGet from './_stackGet.js';\nimport stackHas from './_stackHas.js';\nimport stackSet from './_stackSet.js';\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nexport default Stack;\n", "/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nexport default setCacheAdd;\n", "/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nexport default setCacheHas;\n", "import MapCache from './_MapCache.js';\nimport setCacheAdd from './_setCacheAdd.js';\nimport setCacheHas from './_setCacheHas.js';\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nexport default SetCache;\n", "/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nexport default arraySome;\n", "/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nexport default cacheHas;\n", "import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalArrays;\n", "import root from './_root.js';\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nexport default Uint8Array;\n", "/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nexport default mapToArray;\n", "/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nexport default setToArray;\n", "import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nexport default equalByTag;\n", "/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nexport default arrayPush;\n", "/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nexport default isArray;\n", "import arrayPush from './_arrayPush.js';\nimport isArray from './isArray.js';\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nexport default baseGetAllKeys;\n", "/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nexport default arrayFilter;\n", "/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nexport default stubArray;\n", "import arrayFilter from './_arrayFilter.js';\nimport stubArray from './stubArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nexport default getSymbols;\n", "/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nexport default baseTimes;\n", "/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n", "import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nexport default baseIsArguments;\n", "import baseIsArguments from './_baseIsArguments.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nexport default isArguments;\n", "/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nexport default stubFalse;\n", "import root from './_root.js';\nimport stubFalse from './stubFalse.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nexport default isBuffer;\n", "/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nexport default isIndex;\n", "/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nexport default isLength;\n", "import baseGetTag from './_baseGetTag.js';\nimport isLength from './isLength.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nexport default baseIsTypedArray;\n", "/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nexport default baseUnary;\n", "import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nexport default nodeUtil;\n", "import baseIsTypedArray from './_baseIsTypedArray.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nexport default isTypedArray;\n", "import baseTimes from './_baseTimes.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isIndex from './_isIndex.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default arrayLikeKeys;\n", "/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nexport default isPrototype;\n", "/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nexport default overArg;\n", "import overArg from './_overArg.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nexport default nativeKeys;\n", "import isPrototype from './_isPrototype.js';\nimport nativeKeys from './_nativeKeys.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default baseKeys;\n", "import isFunction from './isFunction.js';\nimport isLength from './isLength.js';\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nexport default isArrayLike;\n", "import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeys from './_baseKeys.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nexport default keys;\n", "import baseGetAllKeys from './_baseGetAllKeys.js';\nimport getSymbols from './_getSymbols.js';\nimport keys from './keys.js';\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nexport default getAllKeys;\n", "import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalObjects;\n", "import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nexport default DataView;\n", "import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nexport default Promise;\n", "import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nexport default Set;\n", "import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nexport default WeakMap;\n", "import DataView from './_DataView.js';\nimport Map from './_Map.js';\nimport Promise from './_Promise.js';\nimport Set from './_Set.js';\nimport WeakMap from './_WeakMap.js';\nimport baseGetTag from './_baseGetTag.js';\nimport toSource from './_toSource.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nexport default getTag;\n", "import Stack from './_Stack.js';\nimport equalArrays from './_equalArrays.js';\nimport equalByTag from './_equalByTag.js';\nimport equalObjects from './_equalObjects.js';\nimport getTag from './_getTag.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nexport default baseIsEqualDeep;\n", "import baseIsEqualDeep from './_baseIsEqualDeep.js';\nimport isObjectLike from './isObjectLike.js';\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nexport default baseIsEqual;\n", "import Stack from './_Stack.js';\nimport baseIsEqual from './_baseIsEqual.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\nfunction baseIsMatch(object, source, matchData, customizer) {\n  var index = matchData.length,\n      length = index,\n      noCustomizer = !customizer;\n\n  if (object == null) {\n    return !length;\n  }\n  object = Object(object);\n  while (index--) {\n    var data = matchData[index];\n    if ((noCustomizer && data[2])\n          ? data[1] !== object[data[0]]\n          : !(data[0] in object)\n        ) {\n      return false;\n    }\n  }\n  while (++index < length) {\n    data = matchData[index];\n    var key = data[0],\n        objValue = object[key],\n        srcValue = data[1];\n\n    if (noCustomizer && data[2]) {\n      if (objValue === undefined && !(key in object)) {\n        return false;\n      }\n    } else {\n      var stack = new Stack;\n      if (customizer) {\n        var result = customizer(objValue, srcValue, key, object, source, stack);\n      }\n      if (!(result === undefined\n            ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n            : result\n          )) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nexport default baseIsMatch;\n", "import isObject from './isObject.js';\n\n/**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n *  equality comparisons, else `false`.\n */\nfunction isStrictComparable(value) {\n  return value === value && !isObject(value);\n}\n\nexport default isStrictComparable;\n", "import isStrictComparable from './_isStrictComparable.js';\nimport keys from './keys.js';\n\n/**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\nfunction getMatchData(object) {\n  var result = keys(object),\n      length = result.length;\n\n  while (length--) {\n    var key = result[length],\n        value = object[key];\n\n    result[length] = [key, value, isStrictComparable(value)];\n  }\n  return result;\n}\n\nexport default getMatchData;\n", "/**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction matchesStrictComparable(key, srcValue) {\n  return function(object) {\n    if (object == null) {\n      return false;\n    }\n    return object[key] === srcValue &&\n      (srcValue !== undefined || (key in Object(object)));\n  };\n}\n\nexport default matchesStrictComparable;\n", "import baseIsMatch from './_baseIsMatch.js';\nimport getMatchData from './_getMatchData.js';\nimport matchesStrictComparable from './_matchesStrictComparable.js';\n\n/**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatches(source) {\n  var matchData = getMatchData(source);\n  if (matchData.length == 1 && matchData[0][2]) {\n    return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n  }\n  return function(object) {\n    return object === source || baseIsMatch(object, source, matchData);\n  };\n}\n\nexport default baseMatches;\n", "import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nexport default isSymbol;\n", "import isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nexport default isKey;\n", "import MapCache from './_MapCache.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nexport default memoize;\n", "import memoize from './memoize.js';\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nexport default memoizeCapped;\n", "import memoizeCapped from './_memoizeCapped.js';\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nexport default stringToPath;\n", "import Symbol from './_Symbol.js';\nimport arrayMap from './_arrayMap.js';\nimport isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default baseToString;\n", "import baseToString from './_baseToString.js';\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nexport default toString;\n", "import isArray from './isArray.js';\nimport isKey from './_isKey.js';\nimport stringToPath from './_stringToPath.js';\nimport toString from './toString.js';\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nexport default castPath;\n", "import isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nexport default toKey;\n", "import castPath from './_castPath.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nexport default baseGet;\n", "import baseGet from './_baseGet.js';\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nexport default get;\n", "/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nexport default baseHasIn;\n", "import castPath from './_castPath.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isIndex from './_isIndex.js';\nimport isLength from './isLength.js';\nimport toKey from './_toKey.js';\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nexport default hasPath;\n", "import baseHasIn from './_baseHasIn.js';\nimport hasPath from './_hasPath.js';\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nexport default hasIn;\n", "import baseIsEqual from './_baseIsEqual.js';\nimport get from './get.js';\nimport hasIn from './hasIn.js';\nimport isKey from './_isKey.js';\nimport isStrictComparable from './_isStrictComparable.js';\nimport matchesStrictComparable from './_matchesStrictComparable.js';\nimport toKey from './_toKey.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatchesProperty(path, srcValue) {\n  if (isKey(path) && isStrictComparable(srcValue)) {\n    return matchesStrictComparable(toKey(path), srcValue);\n  }\n  return function(object) {\n    var objValue = get(object, path);\n    return (objValue === undefined && objValue === srcValue)\n      ? hasIn(object, path)\n      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n  };\n}\n\nexport default baseMatchesProperty;\n", "/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nexport default identity;\n", "/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nexport default baseProperty;\n", "import baseGet from './_baseGet.js';\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nexport default basePropertyDeep;\n", "import baseProperty from './_baseProperty.js';\nimport basePropertyDeep from './_basePropertyDeep.js';\nimport isKey from './_isKey.js';\nimport toKey from './_toKey.js';\n\n/**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n *   { 'a': { 'b': 2 } },\n *   { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\nfunction property(path) {\n  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nexport default property;\n", "import baseMatches from './_baseMatches.js';\nimport baseMatchesProperty from './_baseMatchesProperty.js';\nimport identity from './identity.js';\nimport isArray from './isArray.js';\nimport property from './property.js';\n\n/**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\nfunction baseIteratee(value) {\n  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n  if (typeof value == 'function') {\n    return value;\n  }\n  if (value == null) {\n    return identity;\n  }\n  if (typeof value == 'object') {\n    return isArray(value)\n      ? baseMatchesProperty(value[0], value[1])\n      : baseMatches(value);\n  }\n  return property(value);\n}\n\nexport default baseIteratee;\n", "/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nexport default createBaseFor;\n", "import createBaseFor from './_createBaseFor.js';\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nexport default baseFor;\n", "import baseFor from './_baseFor.js';\nimport keys from './keys.js';\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nexport default baseForOwn;\n", "import isArrayLike from './isArrayLike.js';\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nexport default createBaseEach;\n", "import baseForOwn from './_baseForOwn.js';\nimport createBaseEach from './_createBaseEach.js';\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nexport default baseEach;\n", "import baseEach from './_baseEach.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nexport default baseMap;\n", "import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport isArray from './isArray.js';\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nexport default map;\n", "import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction baseFilter(collection, predicate) {\n  var result = [];\n  baseEach(collection, function(value, index, collection) {\n    if (predicate(value, index, collection)) {\n      result.push(value);\n    }\n  });\n  return result;\n}\n\nexport default baseFilter;\n", "import arrayFilter from './_arrayFilter.js';\nimport baseFilter from './_baseFilter.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\n\n/**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': true },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\nfunction filter(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default filter;\n", "/******************************************************************************\r\n * Copyright 2022 TypeFox GmbH\r\n * This program and the accompanying materials are made available under the\r\n * terms of the MIT License, which is available in the project root.\r\n ******************************************************************************/\r\n\r\nimport map from \"lodash-es/map.js\"\r\nimport filter from \"lodash-es/filter.js\"\r\nimport {\r\n    IProduction,\r\n    IProductionWithOccurrence,\r\n    TokenType,\r\n    Alternation,\r\n    NonTerminal,\r\n    Rule,\r\n    Option,\r\n    RepetitionMandatory,\r\n    Repetition,\r\n    Terminal,\r\n    Alternative,\r\n    RepetitionWithSeparator,\r\n    RepetitionMandatoryWithSeparator,\r\n    LookaheadProductionType\r\n} from \"chevrotain\"\r\n\r\nexport function buildATNKey(rule: Rule, type: LookaheadProductionType, occurrence: number): string {\r\n    return `${rule.name}_${type}_${occurrence}`;\r\n}\r\n\r\nexport interface ATN {\r\n    decisionMap: Record<string, DecisionState>\r\n    states: ATNState[]\r\n    decisionStates: DecisionState[]\r\n    ruleToStartState: Map<Rule, RuleStartState>\r\n    ruleToStopState: Map<Rule, RuleStopState>\r\n}\r\n\r\nexport const ATN_INVALID_TYPE = 0\r\nexport const ATN_BASIC = 1\r\nexport const ATN_RULE_START = 2\r\nexport const ATN_PLUS_BLOCK_START = 4\r\nexport const ATN_STAR_BLOCK_START = 5\r\n// Currently unused as the ATN is not used for lexing\r\nexport const ATN_TOKEN_START = 6\r\nexport const ATN_RULE_STOP = 7\r\nexport const ATN_BLOCK_END = 8\r\nexport const ATN_STAR_LOOP_BACK = 9\r\nexport const ATN_STAR_LOOP_ENTRY = 10\r\nexport const ATN_PLUS_LOOP_BACK = 11\r\nexport const ATN_LOOP_END = 12\r\n\r\nexport type ATNState =\r\n    | BasicState\r\n    | BasicBlockStartState\r\n    | PlusBlockStartState\r\n    | PlusLoopbackState\r\n    | StarBlockStartState\r\n    | StarLoopbackState\r\n    | StarLoopEntryState\r\n    | BlockEndState\r\n    | RuleStartState\r\n    | RuleStopState\r\n    | LoopEndState\r\n\r\nexport interface ATNBaseState {\r\n    atn: ATN\r\n    production: IProductionWithOccurrence\r\n    stateNumber: number\r\n    rule: Rule\r\n    epsilonOnlyTransitions: boolean\r\n    transitions: Transition[]\r\n    nextTokenWithinRule: number[]\r\n}\r\n\r\nexport interface BasicState extends ATNBaseState {\r\n    type: typeof ATN_BASIC\r\n}\r\n\r\nexport interface BlockStartState extends DecisionState {\r\n    end: BlockEndState\r\n}\r\n\r\nexport interface BasicBlockStartState extends BlockStartState {\r\n    type: typeof ATN_BASIC\r\n}\r\n\r\nexport interface PlusBlockStartState extends BlockStartState {\r\n    loopback: PlusLoopbackState\r\n    type: typeof ATN_PLUS_BLOCK_START\r\n}\r\n\r\nexport interface PlusLoopbackState extends DecisionState {\r\n    type: typeof ATN_PLUS_LOOP_BACK\r\n}\r\n\r\nexport interface StarBlockStartState extends BlockStartState {\r\n    type: typeof ATN_STAR_BLOCK_START\r\n}\r\n\r\nexport interface StarLoopbackState extends ATNBaseState {\r\n    type: typeof ATN_STAR_LOOP_BACK\r\n}\r\n\r\nexport interface StarLoopEntryState extends DecisionState {\r\n    loopback: StarLoopbackState\r\n    type: typeof ATN_STAR_LOOP_ENTRY\r\n}\r\n\r\nexport interface BlockEndState extends ATNBaseState {\r\n    start: BlockStartState\r\n    type: typeof ATN_BLOCK_END\r\n}\r\n\r\nexport interface DecisionState extends ATNBaseState {\r\n    decision: number\r\n}\r\n\r\nexport interface LoopEndState extends ATNBaseState {\r\n    loopback: ATNState\r\n    type: typeof ATN_LOOP_END\r\n}\r\n\r\nexport interface RuleStartState extends ATNBaseState {\r\n    stop: RuleStopState\r\n    type: typeof ATN_RULE_START\r\n}\r\n\r\nexport interface RuleStopState extends ATNBaseState {\r\n    type: typeof ATN_RULE_STOP\r\n}\r\n\r\nexport interface Transition {\r\n    target: ATNState\r\n    isEpsilon(): boolean\r\n}\r\n\r\nexport abstract class AbstractTransition implements Transition {\r\n    target: ATNState\r\n\r\n    constructor(target: ATNState) {\r\n        this.target = target\r\n    }\r\n\r\n    isEpsilon() {\r\n        return false\r\n    }\r\n}\r\n\r\nexport class AtomTransition extends AbstractTransition {\r\n    tokenType: TokenType\r\n\r\n    constructor(target: ATNState, tokenType: TokenType) {\r\n        super(target)\r\n        this.tokenType = tokenType\r\n    }\r\n}\r\n\r\nexport class EpsilonTransition extends AbstractTransition {\r\n    constructor(target: ATNState) {\r\n        super(target)\r\n    }\r\n\r\n    isEpsilon() {\r\n        return true\r\n    }\r\n}\r\n\r\nexport class RuleTransition extends AbstractTransition {\r\n    rule: Rule\r\n    followState: ATNState\r\n\r\n    constructor(ruleStart: RuleStartState, rule: Rule, followState: ATNState) {\r\n        super(ruleStart)\r\n        this.rule = rule\r\n        this.followState = followState\r\n    }\r\n\r\n    isEpsilon() {\r\n        return true\r\n    }\r\n}\r\n\r\ninterface ATNHandle {\r\n    left: ATNState\r\n    right: ATNState\r\n}\r\n\r\nexport function createATN(rules: Rule[]): ATN {\r\n    const atn: ATN = {\r\n        decisionMap: {},\r\n        decisionStates: [],\r\n        ruleToStartState: new Map(),\r\n        ruleToStopState: new Map(),\r\n        states: []\r\n    }\r\n    createRuleStartAndStopATNStates(atn, rules)\r\n    const ruleLength = rules.length\r\n    for (let i = 0; i < ruleLength; i++) {\r\n        const rule = rules[i]\r\n        const ruleBlock = block(atn, rule, rule)\r\n        if (ruleBlock === undefined) {\r\n            continue\r\n        }\r\n        buildRuleHandle(atn, rule, ruleBlock)\r\n    }\r\n    return atn\r\n}\r\n\r\nfunction createRuleStartAndStopATNStates(atn: ATN, rules: Rule[]): void {\r\n    const ruleLength = rules.length\r\n    for (let i = 0; i < ruleLength; i++) {\r\n        const rule = rules[i]\r\n        const start = newState<RuleStartState>(atn, rule, undefined, {\r\n            type: ATN_RULE_START\r\n        })\r\n        const stop = newState<RuleStopState>(atn, rule, undefined, {\r\n            type: ATN_RULE_STOP\r\n        })\r\n        start.stop = stop\r\n        atn.ruleToStartState.set(rule, start)\r\n        atn.ruleToStopState.set(rule, stop)\r\n    }\r\n}\r\n\r\nfunction atom(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    production: IProduction\r\n): ATNHandle | undefined {\r\n    if (production instanceof Terminal) {\r\n        return tokenRef(atn, rule, production.terminalType, production)\r\n    } else if (production instanceof NonTerminal) {\r\n        return ruleRef(atn, rule, production)\r\n    } else if (production instanceof Alternation) {\r\n        return alternation(atn, rule, production)\r\n    } else if (production instanceof Option) {\r\n        return option(atn, rule, production)\r\n    } else if (production instanceof Repetition) {\r\n        return repetition(atn, rule, production)\r\n    } else if (production instanceof RepetitionWithSeparator) {\r\n        return repetitionSep(atn, rule, production)\r\n    } else if (production instanceof RepetitionMandatory) {\r\n        return repetitionMandatory(atn, rule, production)\r\n    } else if (production instanceof RepetitionMandatoryWithSeparator) {\r\n        return repetitionMandatorySep(atn, rule, production)\r\n    } else {\r\n        return block(atn, rule, production as Alternative)\r\n    }\r\n}\r\n\r\nfunction repetition(atn: ATN, rule: Rule, repetition: Repetition): ATNHandle {\r\n    const starState = newState<StarBlockStartState>(atn, rule, repetition, {\r\n        type: ATN_STAR_BLOCK_START\r\n    })\r\n    defineDecisionState(atn, starState)\r\n    const handle = makeAlts(\r\n        atn,\r\n        rule,\r\n        starState,\r\n        repetition,\r\n        block(atn, rule, repetition)\r\n    )\r\n    return star(atn, rule, repetition, handle)\r\n}\r\n\r\nfunction repetitionSep(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    repetition: RepetitionWithSeparator\r\n): ATNHandle {\r\n    const starState = newState<StarBlockStartState>(atn, rule, repetition, {\r\n        type: ATN_STAR_BLOCK_START\r\n    })\r\n    defineDecisionState(atn, starState)\r\n    const handle = makeAlts(\r\n        atn,\r\n        rule,\r\n        starState,\r\n        repetition,\r\n        block(atn, rule, repetition)\r\n    )\r\n    const sep = tokenRef(atn, rule, repetition.separator, repetition)\r\n    return star(atn, rule, repetition, handle, sep)\r\n}\r\n\r\nfunction repetitionMandatory(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    repetition: RepetitionMandatory\r\n): ATNHandle {\r\n    const plusState = newState<PlusBlockStartState>(atn, rule, repetition, {\r\n        type: ATN_PLUS_BLOCK_START\r\n    })\r\n    defineDecisionState(atn, plusState)\r\n    const handle = makeAlts(\r\n        atn,\r\n        rule,\r\n        plusState,\r\n        repetition,\r\n        block(atn, rule, repetition)\r\n    )\r\n    return plus(atn, rule, repetition, handle)\r\n}\r\n\r\nfunction repetitionMandatorySep(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    repetition: RepetitionMandatoryWithSeparator\r\n): ATNHandle {\r\n    const plusState = newState<PlusBlockStartState>(atn, rule, repetition, {\r\n        type: ATN_PLUS_BLOCK_START\r\n    })\r\n    defineDecisionState(atn, plusState)\r\n    const handle = makeAlts(\r\n        atn,\r\n        rule,\r\n        plusState,\r\n        repetition,\r\n        block(atn, rule, repetition)\r\n    )\r\n    const sep = tokenRef(atn, rule, repetition.separator, repetition)\r\n    return plus(atn, rule, repetition, handle, sep)\r\n}\r\n\r\nfunction alternation(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    alternation: Alternation\r\n): ATNHandle {\r\n    const start = newState<BasicBlockStartState>(atn, rule, alternation, {\r\n        type: ATN_BASIC\r\n    })\r\n    defineDecisionState(atn, start)\r\n    const alts = map(alternation.definition, (e) => atom(atn, rule, e))\r\n    const handle = makeAlts(atn, rule, start, alternation, ...alts)\r\n    return handle\r\n}\r\n\r\nfunction option(atn: ATN, rule: Rule, option: Option): ATNHandle {\r\n    const start = newState<BasicBlockStartState>(atn, rule, option, {\r\n        type: ATN_BASIC\r\n    })\r\n    defineDecisionState(atn, start)\r\n    const handle = makeAlts(atn, rule, start, option, block(atn, rule, option))\r\n    return optional(atn, rule, option, handle)\r\n}\r\n\r\nfunction block(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    block: { definition: IProduction[] }\r\n): ATNHandle | undefined {\r\n    const handles = filter(\r\n        map(block.definition, (e) => atom(atn, rule, e)),\r\n        (e) => e !== undefined\r\n    ) as ATNHandle[]\r\n    if (handles.length === 1) {\r\n        return handles[0]\r\n    } else if (handles.length === 0) {\r\n        return undefined\r\n    } else {\r\n        return makeBlock(atn, handles)\r\n    }\r\n}\r\n\r\nfunction plus(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    plus: IProductionWithOccurrence,\r\n    handle: ATNHandle,\r\n    sep?: ATNHandle\r\n): ATNHandle {\r\n    const blkStart = handle.left as PlusBlockStartState\r\n    const blkEnd = handle.right\r\n\r\n    const loop = newState<PlusLoopbackState>(atn, rule, plus, {\r\n        type: ATN_PLUS_LOOP_BACK\r\n    })\r\n    defineDecisionState(atn, loop)\r\n    const end = newState<LoopEndState>(atn, rule, plus, {\r\n        type: ATN_LOOP_END\r\n    })\r\n    blkStart.loopback = loop\r\n    end.loopback = loop\r\n    atn.decisionMap[buildATNKey(rule, sep ? 'RepetitionMandatoryWithSeparator' : 'RepetitionMandatory', plus.idx)] = loop;\r\n    epsilon(blkEnd, loop) // block can see loop back\r\n\r\n    // Depending on whether we have a separator we put the exit transition at index 1 or 0\r\n    // This influences the chosen option in the lookahead DFA\r\n    if (sep === undefined) {\r\n        epsilon(loop, blkStart) // loop back to start\r\n        epsilon(loop, end) // exit\r\n    } else {\r\n        epsilon(loop, end) // exit\r\n        // loop back to start with separator\r\n        epsilon(loop, sep.left)\r\n        epsilon(sep.right, blkStart)\r\n    }\r\n\r\n    return {\r\n        left: blkStart,\r\n        right: end\r\n    }\r\n}\r\n\r\nfunction star(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    star: IProductionWithOccurrence,\r\n    handle: ATNHandle,\r\n    sep?: ATNHandle\r\n): ATNHandle {\r\n    const start = handle.left\r\n    const end = handle.right\r\n\r\n    const entry = newState<StarLoopEntryState>(atn, rule, star, {\r\n        type: ATN_STAR_LOOP_ENTRY\r\n    })\r\n    defineDecisionState(atn, entry)\r\n    const loopEnd = newState<LoopEndState>(atn, rule, star, {\r\n        type: ATN_LOOP_END\r\n    })\r\n    const loop = newState<StarLoopbackState>(atn, rule, star, {\r\n        type: ATN_STAR_LOOP_BACK\r\n    })\r\n    entry.loopback = loop\r\n    loopEnd.loopback = loop\r\n\r\n    epsilon(entry, start) // loop enter edge (alt 2)\r\n    epsilon(entry, loopEnd) // bypass loop edge (alt 1)\r\n    epsilon(end, loop) // block end hits loop back\r\n\r\n    if (sep !== undefined) {\r\n        epsilon(loop, loopEnd) // end loop\r\n        // loop back to start of handle using separator\r\n        epsilon(loop, sep.left)\r\n        epsilon(sep.right, start)\r\n    } else {\r\n        epsilon(loop, entry) // loop back to entry/exit decision\r\n    }\r\n\r\n    atn.decisionMap[buildATNKey(rule, sep ? 'RepetitionWithSeparator' : 'Repetition', star.idx)] = entry;\r\n    return {\r\n        left: entry,\r\n        right: loopEnd\r\n    }\r\n}\r\n\r\nfunction optional(atn: ATN, rule: Rule, optional: Option, handle: ATNHandle): ATNHandle {\r\n    const start = handle.left as DecisionState\r\n    const end = handle.right\r\n\r\n    epsilon(start, end)\r\n\r\n    atn.decisionMap[buildATNKey(rule, 'Option', optional.idx)] = start;\r\n    return handle\r\n}\r\n\r\nfunction defineDecisionState(atn: ATN, state: DecisionState): number {\r\n    atn.decisionStates.push(state)\r\n    state.decision = atn.decisionStates.length - 1\r\n    return state.decision\r\n}\r\n\r\nfunction makeAlts(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    start: BlockStartState,\r\n    production: IProductionWithOccurrence,\r\n    ...alts: (ATNHandle | undefined)[]\r\n): ATNHandle {\r\n    const end = newState<BlockEndState>(atn, rule, production, {\r\n        type: ATN_BLOCK_END,\r\n        start\r\n    })\r\n    start.end = end\r\n    for (const alt of alts) {\r\n        if (alt !== undefined) {\r\n            // hook alts up to decision block\r\n            epsilon(start, alt.left)\r\n            epsilon(alt.right, end)\r\n        } else {\r\n            epsilon(start, end)\r\n        }\r\n    }\r\n\r\n    const handle: ATNHandle = {\r\n        left: start as ATNState,\r\n        right: end\r\n    }\r\n    atn.decisionMap[buildATNKey(rule, getProdType(production), production.idx)] = start\r\n    return handle\r\n}\r\n\r\nfunction getProdType(production: IProduction): LookaheadProductionType {\r\n    if (production instanceof Alternation) {\r\n        return 'Alternation';\r\n    } else if (production instanceof Option) {\r\n        return 'Option';\r\n    } else if (production instanceof Repetition) {\r\n        return 'Repetition';\r\n    } else if (production instanceof RepetitionWithSeparator) {\r\n        return 'RepetitionWithSeparator';\r\n    } else if (production instanceof RepetitionMandatory) {\r\n        return 'RepetitionMandatory';\r\n    } else if (production instanceof RepetitionMandatoryWithSeparator) {\r\n        return 'RepetitionMandatoryWithSeparator';\r\n    } else {\r\n        throw new Error('Invalid production type encountered');\r\n    }\r\n}\r\n\r\nfunction makeBlock(atn: ATN, alts: ATNHandle[]): ATNHandle {\r\n    const altsLength = alts.length\r\n    for (let i = 0; i < altsLength - 1; i++) {\r\n        const handle = alts[i]\r\n        let transition: Transition | undefined\r\n        if (handle.left.transitions.length === 1) {\r\n            transition = handle.left.transitions[0]\r\n        }\r\n        const isRuleTransition = transition instanceof RuleTransition\r\n        const ruleTransition = transition as RuleTransition\r\n        const next = alts[i + 1].left\r\n        if (\r\n            handle.left.type === ATN_BASIC &&\r\n            handle.right.type === ATN_BASIC &&\r\n            transition !== undefined &&\r\n            ((isRuleTransition && ruleTransition.followState === handle.right) ||\r\n                transition.target === handle.right)\r\n        ) {\r\n            // we can avoid epsilon edge to next element\r\n            if (isRuleTransition) {\r\n                ruleTransition.followState = next\r\n            } else {\r\n                transition.target = next\r\n            }\r\n            removeState(atn, handle.right) // we skipped over this state\r\n        } else {\r\n            // need epsilon if previous block's right end node is complex\r\n            epsilon(handle.right, next)\r\n        }\r\n    }\r\n\r\n    const first = alts[0]\r\n    const last = alts[altsLength - 1]\r\n    return {\r\n        left: first.left,\r\n        right: last.right\r\n    }\r\n}\r\n\r\nfunction tokenRef(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    tokenType: TokenType,\r\n    production: IProductionWithOccurrence\r\n): ATNHandle {\r\n    const left = newState<BasicState>(atn, rule, production, {\r\n        type: ATN_BASIC\r\n    })\r\n    const right = newState<BasicState>(atn, rule, production, {\r\n        type: ATN_BASIC\r\n    })\r\n    addTransition(left, new AtomTransition(right, tokenType))\r\n    return {\r\n        left,\r\n        right\r\n    }\r\n}\r\n\r\nfunction ruleRef(\r\n    atn: ATN,\r\n    currentRule: Rule,\r\n    nonTerminal: NonTerminal\r\n): ATNHandle {\r\n    const rule = nonTerminal.referencedRule\r\n    const start = atn.ruleToStartState.get(rule)!\r\n    const left = newState<BasicBlockStartState>(atn, currentRule, nonTerminal, {\r\n        type: ATN_BASIC\r\n    })\r\n    const right = newState<BasicBlockStartState>(atn, currentRule, nonTerminal, {\r\n        type: ATN_BASIC\r\n    })\r\n\r\n    const call = new RuleTransition(start, rule, right)\r\n    addTransition(left, call)\r\n\r\n    return {\r\n        left,\r\n        right\r\n    }\r\n}\r\n\r\nfunction buildRuleHandle(atn: ATN, rule: Rule, block: ATNHandle): ATNHandle {\r\n    const start = atn.ruleToStartState.get(rule)!\r\n    epsilon(start, block.left)\r\n    const stop = atn.ruleToStopState.get(rule)!\r\n    epsilon(block.right, stop)\r\n    const handle: ATNHandle = {\r\n        left: start,\r\n        right: stop\r\n    }\r\n    return handle\r\n}\r\n\r\nfunction epsilon(a: ATNBaseState, b: ATNBaseState): void {\r\n    const transition = new EpsilonTransition(b as ATNState)\r\n    addTransition(a, transition)\r\n}\r\n\r\nfunction newState<T extends ATNState>(\r\n    atn: ATN,\r\n    rule: Rule,\r\n    production: IProductionWithOccurrence | undefined,\r\n    partial: Partial<T>\r\n): T {\r\n    const t: T = {\r\n        atn,\r\n        production,\r\n        epsilonOnlyTransitions: false,\r\n        rule,\r\n        transitions: [],\r\n        nextTokenWithinRule: [],\r\n        stateNumber: atn.states.length,\r\n        ...partial\r\n    } as unknown as T\r\n    atn.states.push(t)\r\n    return t\r\n}\r\n\r\nfunction addTransition(state: ATNBaseState, transition: Transition) {\r\n    // A single ATN state can only contain epsilon transitions or non-epsilon transitions\r\n    // Because they are never mixed, only setting the property for the first transition is fine\r\n    if (state.transitions.length === 0) {\r\n        state.epsilonOnlyTransitions = transition.isEpsilon()\r\n    }\r\n    state.transitions.push(transition)\r\n}\r\n\r\nfunction removeState(atn: ATN, state: ATNState): void {\r\n    atn.states.splice(atn.states.indexOf(state), 1)\r\n}\r\n", "/******************************************************************************\r\n * Copyright 2022 TypeFox GmbH\r\n * This program and the accompanying materials are made available under the\r\n * terms of the MIT License, which is available in the project root.\r\n ******************************************************************************/\r\n\r\nimport map from \"lodash-es/map.js\"\r\nimport { ATNState, DecisionState } from \"./atn.js\"\r\n\r\nexport interface DFA {\r\n  start?: DFAState\r\n  states: Record<string, DFAState>\r\n  decision: number\r\n  atnStartState: DecisionState\r\n}\r\n\r\nexport interface DFAState {\r\n  configs: ATNConfigSet\r\n  edges: Record<number, DFAState>\r\n  isAcceptState: boolean\r\n  prediction: number\r\n}\r\n\r\nexport const DFA_ERROR = {} as DFAState\r\n\r\nexport interface ATNConfig {\r\n  state: ATNState\r\n  alt: number\r\n  stack: ATNState[]\r\n}\r\n\r\nexport class ATNConfigSet {\r\n  private map: Record<string, number> = {}\r\n  private configs: ATNConfig[] = []\r\n\r\n  uniqueAlt: number | undefined\r\n\r\n  get size(): number {\r\n    return this.configs.length\r\n  }\r\n\r\n  finalize(): void {\r\n    // Empties the map to free up memory\r\n    this.map = {}\r\n  }\r\n\r\n  add(config: ATNConfig): void {\r\n    const key = getATNConfigKey(config)\r\n    // Only add configs which don't exist in our map already\r\n    // While this does not influence the actual algorithm, adding them anyway would massively increase memory consumption\r\n    if (!(key in this.map)) {\r\n      this.map[key] = this.configs.length\r\n      this.configs.push(config)\r\n    }\r\n  }\r\n\r\n  get elements(): readonly ATNConfig[] {\r\n    return this.configs\r\n  }\r\n\r\n  get alts(): number[] {\r\n    return map(this.configs, (e) => e.alt)\r\n  }\r\n\r\n  get key(): string {\r\n    let value = \"\"\r\n    for (const k in this.map) {\r\n      value += k + \":\"\r\n    }\r\n    return value\r\n  }\r\n}\r\n\r\nexport function getATNConfigKey(config: ATNConfig, alt = true) {\r\n  return `${alt ? `a${config.alt}` : \"\"}s${\r\n    config.state.stateNumber\r\n  }:${config.stack.map((e) => e.stateNumber.toString()).join(\"_\")}`\r\n}\r\n", "import isSymbol from './isSymbol.js';\n\n/**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\nfunction baseExtremum(array, iteratee, comparator) {\n  var index = -1,\n      length = array.length;\n\n  while (++index < length) {\n    var value = array[index],\n        current = iteratee(value);\n\n    if (current != null && (computed === undefined\n          ? (current === current && !isSymbol(current))\n          : comparator(current, computed)\n        )) {\n      var computed = current,\n          result = value;\n    }\n  }\n  return result;\n}\n\nexport default baseExtremum;\n", "/**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n *  else `false`.\n */\nfunction baseLt(value, other) {\n  return value < other;\n}\n\nexport default baseLt;\n", "import baseExtremum from './_baseExtremum.js';\nimport baseLt from './_baseLt.js';\nimport identity from './identity.js';\n\n/**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\nfunction min(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseLt)\n    : undefined;\n}\n\nexport default min;\n", "import Symbol from './_Symbol.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nexport default isFlattenable;\n", "import arrayPush from './_arrayPush.js';\nimport isFlattenable from './_isFlattenable.js';\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nexport default baseFlatten;\n", "import baseFlatten from './_baseFlatten.js';\nimport map from './map.js';\n\n/**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n *   return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\nfunction flatMap(collection, iteratee) {\n  return baseFlatten(map(collection, iteratee), 1);\n}\n\nexport default flatMap;\n", "/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nexport default baseFindIndex;\n", "/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nexport default baseIsNaN;\n", "/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nexport default strictIndexOf;\n", "import baseFindIndex from './_baseFindIndex.js';\nimport baseIsNaN from './_baseIsNaN.js';\nimport strictIndexOf from './_strictIndexOf.js';\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nexport default baseIndexOf;\n", "import baseIndexOf from './_baseIndexOf.js';\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nexport default arrayIncludes;\n", "/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nexport default arrayIncludesWith;\n", "/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nexport default noop;\n", "import Set from './_Set.js';\nimport noop from './noop.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nexport default createSet;\n", "import SetCache from './_SetCache.js';\nimport arrayIncludes from './_arrayIncludes.js';\nimport arrayIncludesWith from './_arrayIncludesWith.js';\nimport cacheHas from './_cacheHas.js';\nimport createSet from './_createSet.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nexport default baseUniq;\n", "import baseIteratee from './_baseIteratee.js';\nimport baseUniq from './_baseUniq.js';\n\n/**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\nfunction uniqBy(array, iteratee) {\n  return (array && array.length) ? baseUniq(array, baseIteratee(iteratee, 2)) : [];\n}\n\nexport default uniqBy;\n", "import baseFlatten from './_baseFlatten.js';\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n", "/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nexport default arrayEach;\n", "import identity from './identity.js';\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nexport default castFunction;\n", "import arrayEach from './_arrayEach.js';\nimport baseEach from './_baseEach.js';\nimport castFunction from './_castFunction.js';\nimport isArray from './isArray.js';\n\n/**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n *   console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forEach(collection, iteratee) {\n  var func = isArray(collection) ? arrayEach : baseEach;\n  return func(collection, castFunction(iteratee));\n}\n\nexport default forEach;\n", "import baseKeys from './_baseKeys.js';\nimport getTag from './_getTag.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isArrayLike from './isArrayLike.js';\nimport isBuffer from './isBuffer.js';\nimport isPrototype from './_isPrototype.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\nfunction isEmpty(value) {\n  if (value == null) {\n    return true;\n  }\n  if (isArrayLike(value) &&\n      (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n        isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n    return !value.length;\n  }\n  var tag = getTag(value);\n  if (tag == mapTag || tag == setTag) {\n    return !value.size;\n  }\n  if (isPrototype(value)) {\n    return !baseKeys(value).length;\n  }\n  for (var key in value) {\n    if (hasOwnProperty.call(value, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport default isEmpty;\n", "/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nexport default arrayReduce;\n", "/**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n *  `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n  eachFunc(collection, function(value, index, collection) {\n    accumulator = initAccum\n      ? (initAccum = false, value)\n      : iteratee(accumulator, value, index, collection);\n  });\n  return accumulator;\n}\n\nexport default baseReduce;\n", "import arrayReduce from './_arrayReduce.js';\nimport baseEach from './_baseEach.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseReduce from './_baseReduce.js';\nimport isArray from './isArray.js';\n\n/**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n *   return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n *   return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\nfunction reduce(collection, iteratee, accumulator) {\n  var func = isArray(collection) ? arrayReduce : baseReduce,\n      initAccum = arguments.length < 3;\n\n  return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nexport default reduce;\n", "/******************************************************************************\r\n * Copyright 2022 TypeFox GmbH\r\n * This program and the accompanying materials are made available under the\r\n * terms of the MIT License, which is available in the project root.\r\n ******************************************************************************/\r\n\r\nimport {\r\n    IToken,\r\n    TokenType,\r\n    tokenMatcher,\r\n    tokenLabel,\r\n    Rule,\r\n    IProductionWithOccurrence,\r\n    NonTerminal,\r\n    Alternation,\r\n    Option,\r\n    RepetitionMandatory,\r\n    RepetitionMandatoryWithSeparator,\r\n    RepetitionWithSeparator,\r\n    Repetition,\r\n    Terminal,\r\n    BaseParser,\r\n    LLkLookaheadStrategy,\r\n    ILookaheadValidationError,\r\n    IOrAlt,\r\n    getLookaheadPaths,\r\n    OptionalProductionType,\r\n    EOF\r\n} from \"chevrotain\";\r\nimport {\r\n    ATN,\r\n    ATNState,\r\n    ATN_RULE_STOP,\r\n    AtomTransition,\r\n    buildATNKey,\r\n    createATN,\r\n    DecisionState,\r\n    EpsilonTransition,\r\n    RuleTransition,\r\n    Transition\r\n} from \"./atn.js\";\r\nimport {\r\n    ATNConfig,\r\n    ATNConfigSet,\r\n    DFA,\r\n    DFAState,\r\n    DFA_ERROR,\r\n    getATNConfigKey\r\n} from \"./dfa.js\";\r\nimport min from \"lodash-es/min.js\";\r\nimport flatMap from \"lodash-es/flatMap.js\";\r\nimport uniqBy from \"lodash-es/uniqBy.js\";\r\nimport map from \"lodash-es/map.js\";\r\nimport flatten from \"lodash-es/flatten.js\";\r\nimport forEach from \"lodash-es/forEach.js\";\r\nimport isEmpty from \"lodash-es/isEmpty.js\";\r\nimport reduce from \"lodash-es/reduce.js\";\r\n\r\ntype DFACache = (predicateSet: PredicateSet) => DFA\r\n\r\nexport type AmbiguityReport = (message: string) => void;\r\n\r\nfunction createDFACache(startState: DecisionState, decision: number): DFACache {\r\n    const map: Record<string, DFA | undefined> = {}\r\n    return (predicateSet) => {\r\n        const key = predicateSet.toString()\r\n        let existing = map[key]\r\n        if (existing !== undefined) {\r\n            return existing\r\n        } else {\r\n            existing = {\r\n                atnStartState: startState,\r\n                decision,\r\n                states: {}\r\n            }\r\n            map[key] = existing\r\n            return existing\r\n        }\r\n    }\r\n}\r\n\r\nclass PredicateSet {\r\n    private predicates: boolean[] = []\r\n\r\n    is(index: number): boolean {\r\n        return index >= this.predicates.length || this.predicates[index]\r\n    }\r\n\r\n    set(index: number, value: boolean) {\r\n        this.predicates[index] = value\r\n    }\r\n\r\n    toString(): string {\r\n        let value = \"\"\r\n        const size = this.predicates.length\r\n        for (let i = 0; i < size; i++) {\r\n            value += this.predicates[i] === true ? \"1\" : \"0\"\r\n        }\r\n        return value\r\n    }\r\n}\r\n\r\ninterface AdaptivePredictError {\r\n    tokenPath: IToken[]\r\n    possibleTokenTypes: TokenType[]\r\n    actualToken: IToken\r\n}\r\n\r\nconst EMPTY_PREDICATES = new PredicateSet()\r\n\r\nexport interface LLStarLookaheadOptions {\r\n    logging?: AmbiguityReport\r\n    // The incomplete flag is used when the input is very likely to be incomplete (e.g. during code completion)\r\n    // In this case, the lookahead strategy will try to make educated guesses on which alternatives are more likely to be correct, even if they don't fully match the input\r\n    incomplete?: boolean\r\n}\r\n\r\nexport class LLStarLookaheadStrategy extends LLkLookaheadStrategy {\r\n\r\n    private atn: ATN;\r\n    private dfas: DFACache[];\r\n    private logging: AmbiguityReport;\r\n    private incomplete: boolean;\r\n\r\n    constructor(options?: LLStarLookaheadOptions) {\r\n        super();\r\n        this.logging = options?.logging ?? ((message) => console.log(message));\r\n        this.incomplete = options?.incomplete ?? false;\r\n    }\r\n\r\n    override initialize(options: { rules: Rule[] }): void {\r\n        this.atn = createATN(options.rules);\r\n        this.dfas = initATNSimulator(this.atn);\r\n    }\r\n\r\n    override validateAmbiguousAlternationAlternatives(): ILookaheadValidationError[] {\r\n        return [];\r\n    }\r\n\r\n    override validateEmptyOrAlternatives(): ILookaheadValidationError[] {\r\n        return [];\r\n    }\r\n\r\n    override buildLookaheadForAlternation(options: {\r\n        prodOccurrence: number;\r\n        rule: Rule;\r\n        maxLookahead: number;\r\n        hasPredicates: boolean;\r\n        dynamicTokensEnabled: boolean\r\n    }): (this: BaseParser, orAlts?: IOrAlt<any>[] | undefined) => number | undefined {\r\n        const { prodOccurrence, rule, hasPredicates, dynamicTokensEnabled } = options;\r\n        const dfas = this.dfas;\r\n        const logging = this.logging;\r\n        const incomplete = this.incomplete;\r\n        const key = buildATNKey(rule, 'Alternation', prodOccurrence);\r\n        const decisionState = this.atn.decisionMap[key];\r\n        const decisionIndex = decisionState.decision;\r\n        const partialAlts: (TokenType | undefined)[][] = map(\r\n            getLookaheadPaths({\r\n                maxLookahead: 1,\r\n                occurrence: prodOccurrence,\r\n                prodType: \"Alternation\",\r\n                rule: rule\r\n            }),\r\n            (currAlt) => map(currAlt, (path) => path[0])\r\n        )\r\n\r\n        if (isLL1Sequence(partialAlts, false) && !dynamicTokensEnabled) {\r\n            const choiceToAlt = reduce(\r\n                partialAlts,\r\n                (result, currAlt, idx) => {\r\n                    forEach(currAlt, (currTokType) => {\r\n                        if (currTokType) {\r\n                            result[currTokType.tokenTypeIdx!] = idx\r\n                            forEach(currTokType.categoryMatches!, (currExtendingType) => {\r\n                                result[currExtendingType] = idx\r\n                            })\r\n                        }\r\n                    })\r\n                    return result\r\n                },\r\n                {} as Record<number, number>\r\n            )\r\n\r\n            if (hasPredicates) {\r\n                return function (this: BaseParser, orAlts) {\r\n                    const nextToken = this.LA_FAST(1)\r\n                    const prediction: number | undefined = choiceToAlt[nextToken.tokenTypeIdx]\r\n                    if (orAlts !== undefined && prediction !== undefined) {\r\n                        const gate = orAlts[prediction]?.GATE\r\n                        if (gate !== undefined && gate.call(this) === false) {\r\n                            return undefined;\r\n                        }\r\n                    }\r\n                    return prediction\r\n                }\r\n            } else {\r\n                return function (this: BaseParser): number | undefined {\r\n                    const nextToken = this.LA_FAST(1)\r\n                    return choiceToAlt[nextToken.tokenTypeIdx];\r\n                }\r\n            }\r\n        } else if (hasPredicates) {\r\n            return function (this: BaseParser, orAlts) {\r\n                const predicates = new PredicateSet()\r\n                const length = orAlts === undefined ? 0 : orAlts.length\r\n                for (let i = 0; i < length; i++) {\r\n                    const gate = orAlts?.[i].GATE\r\n                    predicates.set(i, gate === undefined || gate.call(this))\r\n                }\r\n                const result = adaptivePredict.call(this, dfas, decisionIndex, predicates, logging, incomplete);\r\n                return typeof result === 'number' ? result : undefined;\r\n            }\r\n        } else {\r\n            return function (this: BaseParser) {\r\n                const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging, incomplete);\r\n                return typeof result === 'number' ? result : undefined;\r\n            }\r\n        }\r\n    }\r\n\r\n    override buildLookaheadForOptional(options: {\r\n        prodOccurrence: number;\r\n        prodType: OptionalProductionType;\r\n        rule: Rule;\r\n        maxLookahead: number;\r\n        dynamicTokensEnabled: boolean\r\n    }): (this: BaseParser) => boolean {\r\n        const { prodOccurrence, rule, prodType, dynamicTokensEnabled } = options;\r\n        const dfas = this.dfas;\r\n        const logging = this.logging;\r\n        const incomplete = this.incomplete;\r\n        const key = buildATNKey(rule, prodType, prodOccurrence);\r\n        const decisionState = this.atn.decisionMap[key];\r\n        const decisionIndex = decisionState.decision;\r\n        const alts = map(\r\n            getLookaheadPaths({\r\n                maxLookahead: 1,\r\n                occurrence: prodOccurrence,\r\n                prodType,\r\n                rule\r\n            }),\r\n            (e) => {\r\n              return map(e, (g) => g[0])\r\n            }\r\n          )\r\n        \r\n          if (isLL1Sequence(alts) && alts[0][0] && !dynamicTokensEnabled) {\r\n            const alt = alts[0]\r\n            const singleTokensTypes = flatten(alt)\r\n        \r\n            if (\r\n              singleTokensTypes.length === 1 &&\r\n              isEmpty(singleTokensTypes[0].categoryMatches)\r\n            ) {\r\n              const expectedTokenType = singleTokensTypes[0]\r\n              const expectedTokenUniqueKey = expectedTokenType.tokenTypeIdx\r\n        \r\n              return function (this: BaseParser): boolean {\r\n                return this.LA_FAST(1).tokenTypeIdx === expectedTokenUniqueKey\r\n              }\r\n            } else {\r\n              const choiceToAlt = reduce(\r\n                singleTokensTypes,\r\n                (result, currTokType) => {\r\n                  if (currTokType !== undefined) {\r\n                    result[currTokType.tokenTypeIdx!] = true\r\n                    forEach(currTokType.categoryMatches, (currExtendingType) => {\r\n                      result[currExtendingType] = true\r\n                    })\r\n                  }\r\n                  return result\r\n                },\r\n                {} as Record<number, boolean>\r\n              )\r\n        \r\n              return function (this: BaseParser): boolean {\r\n                const nextToken = this.LA_FAST(1)\r\n                return choiceToAlt[nextToken.tokenTypeIdx] === true\r\n              }\r\n            }\r\n          }\r\n          return function (this: BaseParser) {\r\n            const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging, incomplete)\r\n              return typeof result === \"object\" ? false : result === 0;\r\n          }\r\n    }\r\n\r\n}\r\n\r\nfunction isLL1Sequence(sequences: (TokenType | undefined)[][], allowEmpty = true): boolean {\r\n    const fullSet = new Set<number>()\r\n\r\n    for (const alt of sequences) {\r\n        const altSet = new Set<number>()\r\n        for (const tokType of alt) {\r\n            if (tokType === undefined) {\r\n                if (allowEmpty) {\r\n                    // Epsilon production encountered\r\n                    break\r\n                } else {\r\n                    return false;\r\n                }\r\n            }\r\n            const indices = [tokType.tokenTypeIdx!].concat(tokType.categoryMatches!)\r\n            for (const index of indices) {\r\n                if (fullSet.has(index)) {\r\n                    if (!altSet.has(index)) {\r\n                        return false\r\n                    }\r\n                } else {\r\n                    fullSet.add(index)\r\n                    altSet.add(index)\r\n                }\r\n            }\r\n        }\r\n    }\r\n    return true\r\n}\r\n\r\nfunction initATNSimulator(atn: ATN): DFACache[] {\r\n    const decisionLength = atn.decisionStates.length\r\n    const decisionToDFA: DFACache[] = Array(decisionLength)\r\n    for (let i = 0; i < decisionLength; i++) {\r\n        decisionToDFA[i] = createDFACache(atn.decisionStates[i], i)\r\n    }\r\n    return decisionToDFA;\r\n}\r\n\r\nfunction adaptivePredict(\r\n    this: BaseParser,\r\n    dfaCaches: DFACache[],\r\n    decision: number,\r\n    predicateSet: PredicateSet,\r\n    logging: AmbiguityReport,\r\n    incomplete: boolean\r\n): number | AdaptivePredictError {\r\n    const dfa = dfaCaches[decision](predicateSet)\r\n    let start = dfa.start\r\n    if (start === undefined) {\r\n        const closure = computeStartState(dfa.atnStartState as ATNState)\r\n        start = addDFAState(dfa, newDFAState(closure))\r\n        dfa.start = start\r\n    }\r\n\r\n    const alt = performLookahead.apply(this, [dfa, start, predicateSet, logging, incomplete])\r\n    return alt\r\n}\r\n\r\nfunction performLookahead(\r\n    this: BaseParser,\r\n    dfa: DFA,\r\n    s0: DFAState,\r\n    predicateSet: PredicateSet,\r\n    logging: AmbiguityReport,\r\n    incomplete: boolean,\r\n): number | AdaptivePredictError {\r\n    let previousD = s0\r\n\r\n    let i = 1\r\n    const path: IToken[] = []\r\n    // Using LA_FAST is fine here\r\n    let t = this.LA_FAST(i++)\r\n\r\n    while (true) {\r\n        let d = getExistingTargetState(previousD, t)\r\n        if (d === undefined) {\r\n            d = computeLookaheadTarget.apply(this, [dfa, previousD, t, i, predicateSet, logging])\r\n        }\r\n\r\n        if (d === DFA_ERROR) {\r\n            return buildAdaptivePredictError(path, previousD, t)\r\n        }\r\n\r\n        if (d.isAcceptState === true) {\r\n            if (incomplete === true && tokenMatcher(t, EOF)) {\r\n                // We run into this case, when we reached the end of the input, but we are in the middle of evaluating a lookahead sequence\r\n                // The sequence is incomplete, but we can still make an educated guess on which alternative is more likely to be correct\r\n                const bestGuess = getBestGuess(previousD, predicateSet)\r\n                if (bestGuess !== undefined) {\r\n                    return bestGuess\r\n                }\r\n            }\r\n            return d.prediction\r\n        }\r\n\r\n        previousD = d\r\n        path.push(t)\r\n        // We might be reading out of bounds\r\n        // Therefore, no LA_FAST here\r\n        t = this.LA(i++)\r\n    }\r\n}\r\n\r\nfunction computeLookaheadTarget(\r\n    this: BaseParser,\r\n    dfa: DFA,\r\n    previousD: DFAState,\r\n    token: IToken,\r\n    lookahead: number,\r\n    predicateSet: PredicateSet,\r\n    logging: AmbiguityReport\r\n): DFAState {\r\n    const reach = computeReachSet(previousD.configs, token, predicateSet)\r\n    if (reach.size === 0) {\r\n        addDFAEdge(dfa, previousD, token, DFA_ERROR)\r\n        return DFA_ERROR\r\n    }\r\n\r\n    let newState = newDFAState(reach)\r\n    const predictedAlt = getUniqueAlt(reach, predicateSet)\r\n\r\n    if (predictedAlt !== undefined) {\r\n        newState.isAcceptState = true\r\n        newState.prediction = predictedAlt\r\n        newState.configs.uniqueAlt = predictedAlt\r\n    } else if (hasConflictTerminatingPrediction(reach)) {\r\n        const prediction = min(reach.alts)!\r\n        newState.isAcceptState = true\r\n        newState.prediction = prediction\r\n        newState.configs.uniqueAlt = prediction\r\n        reportLookaheadAmbiguity.apply(this, [dfa, lookahead, reach.alts, logging])\r\n    }\r\n\r\n    newState = addDFAEdge(dfa, previousD, token, newState)\r\n    return newState\r\n}\r\n\r\nfunction reportLookaheadAmbiguity(\r\n    this: BaseParser,\r\n    dfa: DFA,\r\n    lookahead: number,\r\n    ambiguityIndices: number[],\r\n    logging: AmbiguityReport\r\n) {\r\n    const prefixPath: TokenType[] = []\r\n    for (let i = 1; i <= lookahead; i++) {\r\n        prefixPath.push(this.LA(i).tokenType)\r\n    }\r\n    const atnState = dfa.atnStartState\r\n    const topLevelRule = atnState.rule\r\n    const production = atnState.production\r\n    const message = buildAmbiguityError({\r\n        topLevelRule,\r\n        ambiguityIndices,\r\n        production,\r\n        prefixPath\r\n    })\r\n    logging(message)\r\n}\r\n\r\nfunction buildAmbiguityError(options: {\r\n    topLevelRule: Rule\r\n    prefixPath: TokenType[]\r\n    ambiguityIndices: number[]\r\n    production: IProductionWithOccurrence\r\n}): string {\r\n    const pathMsg = map(options.prefixPath, (currtok) =>\r\n        tokenLabel(currtok)\r\n    ).join(\", \")\r\n    const occurrence =\r\n        options.production.idx === 0 ? \"\" : options.production.idx\r\n    let currMessage =\r\n        `Ambiguous Alternatives Detected: <${options.ambiguityIndices.join(\r\n            \", \"\r\n        )}> in <${getProductionDslName(options.production)}${occurrence}>` +\r\n        ` inside <${options.topLevelRule.name}> Rule,\\n` +\r\n        `<${pathMsg}> may appears as a prefix path in all these alternatives.\\n`\r\n\r\n    currMessage =\r\n        currMessage +\r\n        `See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\\n` +\r\n        `For Further details.`\r\n    return currMessage\r\n}\r\n\r\nfunction getProductionDslName(prod: IProductionWithOccurrence): string {\r\n    if (prod instanceof NonTerminal) {\r\n        return \"SUBRULE\"\r\n    } else if (prod instanceof Option) {\r\n        return \"OPTION\"\r\n    } else if (prod instanceof Alternation) {\r\n        return \"OR\"\r\n    } else if (prod instanceof RepetitionMandatory) {\r\n        return \"AT_LEAST_ONE\"\r\n    } else if (prod instanceof RepetitionMandatoryWithSeparator) {\r\n        return \"AT_LEAST_ONE_SEP\"\r\n    } else if (prod instanceof RepetitionWithSeparator) {\r\n        return \"MANY_SEP\"\r\n    } else if (prod instanceof Repetition) {\r\n        return \"MANY\"\r\n    } else if (prod instanceof Terminal) {\r\n        return \"CONSUME\"\r\n    } else {\r\n        throw Error(\"non exhaustive match\")\r\n    }\r\n}\r\n\r\nfunction buildAdaptivePredictError(\r\n    path: IToken[],\r\n    previous: DFAState,\r\n    current: IToken\r\n): AdaptivePredictError {\r\n    const nextTransitions = flatMap(\r\n        previous.configs.elements,\r\n        (e) => e.state.transitions\r\n    )\r\n    const nextTokenTypes = uniqBy(\r\n        nextTransitions\r\n            .filter((e): e is AtomTransition => e instanceof AtomTransition)\r\n            .map((e) => e.tokenType),\r\n        (e) => e.tokenTypeIdx\r\n    )\r\n    return {\r\n        actualToken: current,\r\n        possibleTokenTypes: nextTokenTypes,\r\n        tokenPath: path\r\n    }\r\n}\r\n\r\nfunction getExistingTargetState(\r\n    state: DFAState,\r\n    token: IToken\r\n): DFAState | undefined {\r\n    return state.edges[token.tokenTypeIdx]\r\n}\r\n\r\nfunction computeReachSet(\r\n    configs: ATNConfigSet,\r\n    token: IToken,\r\n    predicateSet: PredicateSet\r\n): ATNConfigSet {\r\n    const intermediate = new ATNConfigSet()\r\n    const skippedStopStates: ATNConfig[] = []\r\n\r\n    for (const c of configs.elements) {\r\n        if (predicateSet.is(c.alt) === false) {\r\n            continue\r\n        }\r\n        if (c.state.type === ATN_RULE_STOP) {\r\n            skippedStopStates.push(c)\r\n            continue\r\n        }\r\n        const transitionLength = c.state.transitions.length\r\n        for (let i = 0; i < transitionLength; i++) {\r\n            const transition = c.state.transitions[i]\r\n            const target = getReachableTarget(transition, token)\r\n            if (target !== undefined) {\r\n                intermediate.add({\r\n                    state: target,\r\n                    alt: c.alt,\r\n                    stack: c.stack\r\n                })\r\n            }\r\n        }\r\n    }\r\n\r\n    let reach: ATNConfigSet | undefined\r\n\r\n    if (skippedStopStates.length === 0 && intermediate.size === 1) {\r\n        reach = intermediate\r\n    }\r\n\r\n    if (reach === undefined) {\r\n        reach = new ATNConfigSet()\r\n        for (const c of intermediate.elements) {\r\n            closure(c, reach)\r\n        }\r\n    }\r\n\r\n    if (skippedStopStates.length > 0 && !hasConfigInRuleStopState(reach)) {\r\n        for (const c of skippedStopStates) {\r\n            reach.add(c)\r\n        }\r\n    }\r\n\r\n    return reach\r\n}\r\n\r\nfunction getReachableTarget(\r\n    transition: Transition,\r\n    token: IToken\r\n): ATNState | undefined {\r\n    if (\r\n        transition instanceof AtomTransition &&\r\n        tokenMatcher(token, transition.tokenType)\r\n    ) {\r\n        return transition.target\r\n    }\r\n    return undefined\r\n}\r\n\r\nfunction getUniqueAlt(\r\n    configs: ATNConfigSet,\r\n    predicateSet: PredicateSet\r\n): number | undefined {\r\n    let alt: number | undefined\r\n    for (const c of configs.elements) {\r\n        if (predicateSet.is(c.alt) === true) {\r\n            if (alt === undefined) {\r\n                alt = c.alt\r\n            } else if (alt !== c.alt) {\r\n                return undefined\r\n            }\r\n        }\r\n    }\r\n    return alt\r\n}\r\n\r\nfunction newDFAState(closure: ATNConfigSet): DFAState {\r\n    return {\r\n        configs: closure,\r\n        edges: {},\r\n        isAcceptState: false,\r\n        prediction: -1\r\n    }\r\n}\r\n\r\nfunction addDFAEdge(\r\n    dfa: DFA,\r\n    from: DFAState,\r\n    token: IToken,\r\n    to: DFAState\r\n): DFAState {\r\n    to = addDFAState(dfa, to)\r\n    from.edges[token.tokenTypeIdx] = to\r\n    return to\r\n}\r\n\r\nfunction addDFAState(dfa: DFA, state: DFAState): DFAState {\r\n    if (state === DFA_ERROR) {\r\n        return state\r\n    }\r\n    // Repetitions have the same config set\r\n    // Therefore, storing the key of the config in a map allows us to create a loop in our DFA\r\n    const mapKey = state.configs.key\r\n    const existing = dfa.states[mapKey]\r\n    if (existing !== undefined) {\r\n        return existing\r\n    }\r\n    state.configs.finalize()\r\n    dfa.states[mapKey] = state\r\n    return state\r\n}\r\n\r\nfunction computeStartState(atnState: ATNState): ATNConfigSet {\r\n    const configs = new ATNConfigSet()\r\n\r\n    const numberOfTransitions = atnState.transitions.length\r\n    for (let i = 0; i < numberOfTransitions; i++) {\r\n        const target = atnState.transitions[i].target\r\n        const config: ATNConfig = {\r\n            state: target,\r\n            alt: i,\r\n            stack: []\r\n        }\r\n        closure(config, configs)\r\n    }\r\n\r\n    return configs\r\n}\r\n\r\nfunction closure(config: ATNConfig, configs: ATNConfigSet): void {\r\n    const p = config.state\r\n\r\n    if (p.type === ATN_RULE_STOP) {\r\n        if (config.stack.length > 0) {\r\n            const atnStack = [...config.stack]\r\n            const followState = atnStack.pop()!\r\n            const followConfig: ATNConfig = {\r\n                state: followState,\r\n                alt: config.alt,\r\n                stack: atnStack\r\n            }\r\n            closure(followConfig, configs)\r\n        } else {\r\n            // Dipping into outer context, simply add the config\r\n            // This will stop computation once every config is at the rule stop state\r\n            configs.add(config)\r\n        }\r\n        return\r\n    }\r\n\r\n    if (!p.epsilonOnlyTransitions) {\r\n        configs.add(config)\r\n    }\r\n\r\n    const transitionLength = p.transitions.length\r\n    for (let i = 0; i < transitionLength; i++) {\r\n        const transition = p.transitions[i]\r\n        const c = getEpsilonTarget(config, transition)\r\n\r\n        if (c !== undefined) {\r\n            closure(c, configs)\r\n        }\r\n    }\r\n}\r\n\r\nfunction getEpsilonTarget(\r\n    config: ATNConfig,\r\n    transition: Transition\r\n): ATNConfig | undefined {\r\n    if (transition instanceof EpsilonTransition) {\r\n        return {\r\n            state: transition.target,\r\n            alt: config.alt,\r\n            stack: config.stack\r\n        }\r\n    } else if (transition instanceof RuleTransition) {\r\n        const stack = [...config.stack, transition.followState]\r\n        return {\r\n            state: transition.target,\r\n            alt: config.alt,\r\n            stack\r\n        }\r\n    }\r\n    return undefined\r\n}\r\n\r\nfunction hasConfigInRuleStopState(configs: ATNConfigSet): boolean {\r\n    for (const c of configs.elements) {\r\n        if (c.state.type === ATN_RULE_STOP) {\r\n            return true\r\n        }\r\n    }\r\n    return false\r\n}\r\n\r\nfunction allConfigsInRuleStopStates(configs: ATNConfigSet): boolean {\r\n    for (const c of configs.elements) {\r\n        if (c.state.type !== ATN_RULE_STOP) {\r\n            return false\r\n        }\r\n    }\r\n    return true\r\n}\r\n\r\nfunction hasConflictTerminatingPrediction(configs: ATNConfigSet): boolean {\r\n    if (allConfigsInRuleStopStates(configs)) {\r\n        return true\r\n    }\r\n    const altSets = getConflictingAltSets(configs.elements)\r\n    const heuristic =\r\n        hasConflictingAltSet(altSets) && !hasStateAssociatedWithOneAlt(altSets)\r\n    return heuristic\r\n}\r\n\r\nfunction getConflictingAltSets(\r\n    configs: readonly ATNConfig[]\r\n): Map<string, Record<number, boolean>> {\r\n    const configToAlts = new Map<string, Record<number, boolean>>()\r\n    for (const c of configs) {\r\n        const key = getATNConfigKey(c, false)\r\n        let alts = configToAlts.get(key)\r\n        if (alts === undefined) {\r\n            alts = {}\r\n            configToAlts.set(key, alts)\r\n        }\r\n        alts[c.alt] = true\r\n    }\r\n    return configToAlts\r\n}\r\n\r\nfunction hasConflictingAltSet(\r\n    altSets: Map<string, Record<number, boolean>>\r\n): boolean {\r\n    for (const value of Array.from(altSets.values())) {\r\n        if (Object.keys(value).length > 1) {\r\n            return true\r\n        }\r\n    }\r\n    return false\r\n}\r\n\r\nfunction hasStateAssociatedWithOneAlt(\r\n    altSets: Map<string, Record<number, boolean>>\r\n): boolean {\r\n    for (const value of Array.from(altSets.values())) {\r\n        if (Object.keys(value).length === 1) {\r\n            return true\r\n        }\r\n    }\r\n    return false\r\n}\r\n\r\nfunction getBestGuess(state: DFAState, predicateSet: PredicateSet): number | undefined {\r\n    let bestAlt: number | undefined = undefined\r\n    for (const c of state.configs.elements) {\r\n        // Ignore invalid and stop states\r\n        if (predicateSet.is(c.alt) === false || c.state.type === ATN_RULE_STOP) {\r\n            continue\r\n        }\r\n        if (bestAlt === undefined) {\r\n            bestAlt = c.alt\r\n        } else if (bestAlt !== c.alt) {\r\n            return undefined;\r\n        }\r\n    }\r\n    return bestAlt;\r\n}\r\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { IToken, TokenType } from 'chevrotain';\nimport type { Range } from 'vscode-languageserver-types';\nimport type { AbstractElement } from '../languages/generated/ast.js';\nimport type { AstNode, CompositeCstNode, CstNode, LeafCstNode, RootCstNode } from '../syntax-tree.js';\nimport { Position } from 'vscode-languageserver-types';\nimport { tokenToRange } from '../utils/cst-utils.js';\n\nexport class CstNodeBuilder {\n\n    private rootNode!: RootCstNodeImpl;\n    private nodeStack: CompositeCstNodeImpl[] = [];\n\n    get current(): CompositeCstNodeImpl {\n        return this.nodeStack[this.nodeStack.length - 1] ?? this.rootNode;\n    }\n\n    buildRootNode(input: string): RootCstNode {\n        this.rootNode = new RootCstNodeImpl(input);\n        this.rootNode.root = this.rootNode;\n        this.nodeStack = [this.rootNode];\n        return this.rootNode;\n    }\n\n    buildCompositeNode(feature: AbstractElement): CompositeCstNode {\n        const compositeNode = new CompositeCstNodeImpl();\n        compositeNode.grammarSource = feature;\n        compositeNode.root = this.rootNode;\n        this.current.content.push(compositeNode);\n        this.nodeStack.push(compositeNode);\n        return compositeNode;\n    }\n\n    buildLeafNode(token: IToken, feature?: AbstractElement): LeafCstNode {\n        const leafNode = new LeafCstNodeImpl(token.startOffset, token.image.length, tokenToRange(token), token.tokenType, !feature);\n        leafNode.grammarSource = feature;\n        leafNode.root = this.rootNode;\n        this.current.content.push(leafNode);\n        return leafNode;\n    }\n\n    removeNode(node: CstNode): void {\n        const parent = node.container;\n        if (parent) {\n            const index = parent.content.indexOf(node);\n            if (index >= 0) {\n                parent.content.splice(index, 1);\n            }\n        }\n    }\n\n    addHiddenNodes(tokens: IToken[]): void {\n        const nodes: LeafCstNode[] = [];\n        for (const token of tokens) {\n            const leafNode = new LeafCstNodeImpl(token.startOffset, token.image.length, tokenToRange(token), token.tokenType, true);\n            leafNode.root = this.rootNode;\n            nodes.push(leafNode);\n        }\n        let current: CompositeCstNode = this.current;\n        let added = false;\n        // If we are within a composite node, we add the hidden nodes to the content\n        if (current.content.length > 0) {\n            current.content.push(...nodes);\n            return;\n        }\n        // Otherwise we are at a newly created node\n        // Instead of adding the hidden nodes here, we search for the first parent node with content\n        while (current.container) {\n            const index = current.container.content.indexOf(current);\n            if (index > 0) {\n                // Add the hidden nodes before the current node\n                current.container.content.splice(index, 0, ...nodes);\n                added = true;\n                break;\n            }\n            current = current.container;\n        }\n        // If we arrive at the root node, we add the hidden nodes at the beginning\n        // This is the case if the hidden nodes are the first nodes in the tree\n        if (!added) {\n            this.rootNode.content.unshift(...nodes);\n        }\n    }\n\n    construct(item: { $type: string | symbol | undefined, $cstNode: CstNode, $infixName?: string }): void {\n        const current: CstNode = this.current;\n        // The specified item could be a datatype ($type is symbol), fragment ($type is undefined) or infix rule ($infix is true)\n        // Only if the $type is a string, we actually assign the element\n        if (typeof item.$type === 'string' && !item.$infixName) {\n            this.current.astNode = <AstNode>item;\n        }\n        item.$cstNode = current;\n        const node = this.nodeStack.pop();\n        // Empty composite nodes are not valid\n        // Simply remove the node from the tree\n        if (node?.content.length === 0) {\n            this.removeNode(node);\n        }\n    }\n}\n\nexport abstract class AbstractCstNode implements CstNode {\n    abstract get offset(): number;\n    abstract get length(): number;\n    abstract get end(): number;\n    abstract get range(): Range;\n\n    container?: CompositeCstNode;\n    grammarSource?: AbstractElement;\n    root: RootCstNode;\n    private _astNode?: AstNode;\n\n    get hidden(): boolean {\n        return false;\n    }\n\n    get astNode(): AstNode {\n        const node = typeof this._astNode?.$type === 'string' ? this._astNode : this.container?.astNode;\n        if (!node) {\n            throw new Error('This node has no associated AST element');\n        }\n        return node;\n    }\n\n    set astNode(value: AstNode | undefined) {\n        this._astNode = value;\n    }\n\n    get text(): string {\n        return this.root.fullText.substring(this.offset, this.end);\n    }\n}\n\nexport class LeafCstNodeImpl extends AbstractCstNode implements LeafCstNode {\n    get offset(): number {\n        return this._offset;\n    }\n\n    get length(): number {\n        return this._length;\n    }\n\n    get end(): number {\n        return this._offset + this._length;\n    }\n\n    override get hidden(): boolean {\n        return this._hidden;\n    }\n\n    get tokenType(): TokenType {\n        return this._tokenType;\n    }\n\n    get range(): Range {\n        return this._range;\n    }\n\n    private _hidden: boolean;\n    private _offset: number;\n    private _length: number;\n    private _range: Range;\n    private _tokenType: TokenType;\n\n    constructor(offset: number, length: number, range: Range, tokenType: TokenType, hidden = false) {\n        super();\n        this._hidden = hidden;\n        this._offset = offset;\n        this._tokenType = tokenType;\n        this._length = length;\n        this._range = range;\n    }\n}\n\nexport class CompositeCstNodeImpl extends AbstractCstNode implements CompositeCstNode {\n    readonly content: CstNode[] = new CstNodeContainer(this);\n    private _rangeCache?: Range;\n\n    get offset(): number {\n        return this.firstNonHiddenNode?.offset ?? 0;\n    }\n\n    get length(): number {\n        return this.end - this.offset;\n    }\n\n    get end(): number {\n        return this.lastNonHiddenNode?.end ?? 0;\n    }\n\n    get range(): Range {\n        const firstNode = this.firstNonHiddenNode;\n        const lastNode = this.lastNonHiddenNode;\n        if (firstNode && lastNode) {\n            if (this._rangeCache === undefined) {\n                const { range: firstRange } = firstNode;\n                const { range: lastRange } = lastNode;\n                this._rangeCache = { start: firstRange.start, end: lastRange.end.line < firstRange.start.line ? firstRange.start : lastRange.end };\n            }\n            return this._rangeCache;\n        } else {\n            return { start: Position.create(0, 0), end: Position.create(0, 0) };\n        }\n    }\n\n    private get firstNonHiddenNode(): CstNode | undefined {\n        for (const child of this.content) {\n            if (!child.hidden) {\n                return child;\n            }\n        }\n        return this.content[0];\n    }\n\n    private get lastNonHiddenNode(): CstNode | undefined {\n        for (let i = this.content.length - 1; i >= 0; i--) {\n            const child = this.content[i];\n            if (!child.hidden) {\n                return child;\n            }\n        }\n        return this.content[this.content.length - 1];\n    }\n}\n\nclass CstNodeContainer extends Array<CstNode> {\n    readonly parent: CompositeCstNode;\n\n    constructor(parent: CompositeCstNode) {\n        super();\n        this.parent = parent;\n        Object.setPrototypeOf(this, CstNodeContainer.prototype);\n    }\n\n    override push(...items: CstNode[]): number {\n        this.addParents(items);\n        return super.push(...items);\n    }\n\n    override unshift(...items: CstNode[]): number {\n        this.addParents(items);\n        return super.unshift(...items);\n    }\n\n    override splice(start: number, count: number, ...items: CstNode[]): CstNode[] {\n        this.addParents(items);\n        return super.splice(start, count, ...items);\n    }\n\n    private addParents(items: CstNode[]): void {\n        for (const item of items) {\n            (<AbstractCstNode>item).container = this.parent;\n        }\n    }\n}\n\nexport class RootCstNodeImpl extends CompositeCstNodeImpl implements RootCstNode {\n    private _text = '';\n\n    override get text(): string {\n        return this._text.substring(this.offset, this.end);\n    }\n\n    get fullText(): string {\n        return this._text;\n    }\n\n    constructor(input?: string) {\n        super();\n        this._text = input ?? '';\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\n/* eslint-disable @typescript-eslint/no-explicit-any */\nimport { isInfixRule } from '../languages/generated/ast.js';\nimport type { AbstractElement, Action, Assignment, InfixRule, ParserRule } from '../languages/generated/ast.js';\nimport type { DSLMethodOpts, ILexingError, IOrAlt, IParserErrorMessageProvider, IRecognitionException, IToken, ParserMethod, SubruleMethodOpts, TokenType, TokenVocabulary, IRuleConfig } from 'chevrotain';\nimport type { Linker } from '../references/linker.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, AstReflection, CompositeCstNode, CstNode } from '../syntax-tree.js';\nimport type { Lexer, LexerResult } from './lexer.js';\nimport type { IParserConfig } from './parser-config.js';\nimport type { ValueConverter } from './value-converter.js';\nimport { defaultParserErrorProvider, EmbeddedActionsParser, LLkLookaheadStrategy } from 'chevrotain';\nimport { LLStarLookaheadStrategy } from 'chevrotain-allstar';\nimport { isAssignment, isCrossReference, isKeyword, isParserRule } from '../languages/generated/ast.js';\nimport { getTypeName, isDataTypeRule } from '../utils/grammar-utils.js';\nimport { assignMandatoryProperties, getContainerOfType, linkContentToContainer } from '../utils/ast-utils.js';\nimport { CstNodeBuilder } from './cst-node-builder.js';\nimport type { LexingReport } from './token-builder.js';\nimport type { ProfilingTask } from '../workspace/profiler.js';\n\nexport type ParseResult<T = AstNode> = {\n    value: T,\n    parserErrors: IRecognitionException[],\n    lexerErrors: ILexingError[],\n    lexerReport?: LexingReport\n}\n\nexport const DatatypeSymbol = Symbol('Datatype');\n\ninterface DataTypeNode {\n    $cstNode: CompositeCstNode\n    /** Instead of a string, this node is uniquely identified by the `Datatype` symbol */\n    $type: symbol\n    /** Used as a storage for all parsed terminals, keywords and sub-datatype rules */\n    value: string\n}\n\ninterface InfixElement {\n    $infixName: string;\n    $type: string;\n    $cstNode: CompositeCstNode;\n    parts?: AstNode[];\n    operators?: string[];\n}\n\nfunction isDataTypeNode(node: { $type: string | symbol | undefined }): node is DataTypeNode {\n    return node.$type === DatatypeSymbol;\n}\n\ntype RuleResult = (args: Args) => any;\n\ntype Args = Record<string, boolean>;\n\ntype RuleImpl = (args: Args) => any;\n\ninterface AssignmentElement {\n    assignment?: Assignment\n    crossRef?: 'single' | 'multi'\n}\n\n/**\n * Base interface for all parsers. Mainly used by the `parser-builder-base.ts` to perform work on different kinds of parsers.\n * The main use cases are:\n * * AST parser: Based on a string, create an AST for the current grammar\n * * Completion parser: Based on a partial string, identify the current position of the input within the grammar\n */\nexport interface BaseParser {\n    /**\n     * Adds a new parser rule to the parser\n     */\n    rule(rule: ParserRule | InfixRule, impl: RuleImpl): RuleResult;\n    /**\n     * Returns the executable rule function for the specified rule name\n     */\n    getRule(name: string): RuleResult | undefined;\n    /**\n     * Performs alternatives parsing (the `|` operation in EBNF/Langium)\n     */\n    alternatives(idx: number, choices: Array<IOrAlt<any>>): void;\n    /**\n     * Parses the callback as optional (the `?` operation in EBNF/Langium)\n     */\n    optional(idx: number, callback: DSLMethodOpts<unknown>): void;\n    /**\n     * Parses the callback 0 or more times (the `*` operation in EBNF/Langium)\n     */\n    many(idx: number, callback: DSLMethodOpts<unknown>): void;\n    /**\n     * Parses the callback 1 or more times (the `+` operation in EBNF/Langium)\n     */\n    atLeastOne(idx: number, callback: DSLMethodOpts<unknown>): void;\n    /**\n     * Consumes a specific token type from the token input stream.\n     * Requires a unique index within the rule for a specific token type.\n     */\n    consume(idx: number, tokenType: TokenType, feature: AbstractElement): void;\n    /**\n     * Invokes the executable function for a given parser rule.\n     * Requires a unique index within the rule for a specific sub rule.\n     * Arguments can be supplied to the rule invocation for semantic predicates\n     */\n    subrule(idx: number, rule: RuleResult, fragment: boolean, feature: AbstractElement, args: Args): void;\n    /**\n     * Executes a grammar action that modifies the currently active AST node\n     */\n    action($type: string, action: Action): void;\n    /**\n     * Whether the parser is currently actually in use or in \"recording mode\".\n     * Recording mode is activated once when the parser is analyzing itself.\n     * During this phase, no input exists and therefore no AST should be constructed\n     */\n    isRecording(): boolean;\n    /**\n     * Current state of the unordered groups\n     */\n    get unorderedGroups(): Map<string, boolean[]>;\n    /**\n     * The rule stack indicates the indices of rules that are currently invoked,\n     * in order of their invocation.\n     */\n    getRuleStack(): number[];\n}\n\nconst ruleSuffix = '\\u200B';\nconst withRuleSuffix = (name: string): string => name.endsWith(ruleSuffix) ? name : name + ruleSuffix;\n\nexport abstract class AbstractLangiumParser implements BaseParser {\n\n    protected readonly lexer: Lexer;\n    protected readonly wrapper: ChevrotainWrapper;\n    protected _unorderedGroups: Map<string, boolean[]> = new Map<string, boolean[]>();\n\n    protected allRules = new Map<string, RuleResult>();\n    protected mainRule!: RuleResult;\n\n    constructor(services: LangiumCoreServices, incomplete: boolean) {\n        this.lexer = services.parser.Lexer;\n        const tokens = this.lexer.definition;\n        const production = services.LanguageMetaData.mode === 'production';\n        if (services.shared.profilers.LangiumProfiler?.isActive('parsing')) {\n            this.wrapper = new ProfilerWrapper(tokens, {\n                ...services.parser.ParserConfig,\n                skipValidations: production,\n                errorMessageProvider: services.parser.ParserErrorMessageProvider\n            }, incomplete, services.shared.profilers.LangiumProfiler.createTask('parsing', services.LanguageMetaData.languageId));\n        } else {\n            this.wrapper = new ChevrotainWrapper(tokens, {\n                ...services.parser.ParserConfig,\n                skipValidations: production,\n                errorMessageProvider: services.parser.ParserErrorMessageProvider\n            }, incomplete);\n        }\n    }\n\n    alternatives(idx: number, choices: Array<IOrAlt<any>>): void {\n        this.wrapper.wrapOr(idx, choices);\n    }\n\n    optional(idx: number, callback: DSLMethodOpts<unknown>): void {\n        this.wrapper.wrapOption(idx, callback);\n    }\n\n    many(idx: number, callback: DSLMethodOpts<unknown>): void {\n        this.wrapper.wrapMany(idx, callback);\n    }\n\n    atLeastOne(idx: number, callback: DSLMethodOpts<unknown>): void {\n        this.wrapper.wrapAtLeastOne(idx, callback);\n    }\n\n    abstract rule(rule: ParserRule | InfixRule, impl: RuleImpl): RuleResult;\n    abstract consume(idx: number, tokenType: TokenType, feature: AbstractElement): void;\n    abstract subrule(idx: number, rule: RuleResult, fragment: boolean, feature: AbstractElement, args: Args): void;\n    abstract action($type: string, action: Action): void;\n\n    getRule(name: string): RuleResult | undefined {\n        return this.allRules.get(name);\n    }\n\n    isRecording(): boolean {\n        return this.wrapper.IS_RECORDING;\n    }\n\n    get unorderedGroups(): Map<string, boolean[]> {\n        return this._unorderedGroups;\n    }\n\n    getRuleStack(): number[] {\n        return (this.wrapper as any).RULE_STACK;\n    }\n\n    finalize(): void {\n        this.wrapper.wrapSelfAnalysis();\n    }\n}\n\nexport interface ParserOptions {\n    rule?: string\n}\n\ninterface OperatorPrecedence {\n    precedence: number\n    rightAssoc: boolean\n}\n\nexport class LangiumParser extends AbstractLangiumParser {\n    private readonly linker: Linker;\n    private readonly converter: ValueConverter;\n    private readonly astReflection: AstReflection;\n    private readonly nodeBuilder = new CstNodeBuilder();\n    private lexerResult?: LexerResult;\n    private stack: any[] = [];\n    private assignmentMap = new Map<AbstractElement, AssignmentElement | undefined>();\n    private operatorPrecedence = new Map<string, Map<string, OperatorPrecedence>>();\n\n    private get current(): any {\n        return this.stack[this.stack.length - 1];\n    }\n\n    constructor(services: LangiumCoreServices) {\n        super(services, false);\n        this.linker = services.references.Linker;\n        this.converter = services.parser.ValueConverter;\n        this.astReflection = services.shared.AstReflection;\n    }\n\n    rule(rule: ParserRule | InfixRule, impl: RuleImpl): RuleResult {\n        const type = this.computeRuleType(rule);\n        let infixName: string | undefined = undefined;\n        if (isInfixRule(rule)) {\n            infixName = rule.name;\n            this.registerPrecedenceMap(rule);\n        }\n        const ruleMethod = this.wrapper.DEFINE_RULE(withRuleSuffix(rule.name), this.startImplementation(type, infixName, impl).bind(this));\n        this.allRules.set(rule.name, ruleMethod);\n        if (isParserRule(rule) && rule.entry) {\n            this.mainRule = ruleMethod;\n        }\n        return ruleMethod;\n    }\n\n    private registerPrecedenceMap(rule: InfixRule): void {\n        const name = rule.name;\n        const map = new Map<string, OperatorPrecedence>();\n        for (let i = 0; i < rule.operators.precedences.length; i++) {\n            const precedence = rule.operators.precedences[i];\n            for (const keyword of precedence.operators) {\n                map.set(keyword.value, {\n                    precedence: i,\n                    rightAssoc: precedence.associativity === 'right'\n                });\n            }\n        }\n        this.operatorPrecedence.set(name, map);\n    }\n\n    private computeRuleType(rule: ParserRule | InfixRule): string | symbol | undefined {\n        if (isInfixRule(rule)) {\n            return getTypeName(rule);\n        } else if (rule.fragment) {\n            return undefined;\n        } else if (isDataTypeRule(rule)) {\n            return DatatypeSymbol;\n        } else {\n            return getTypeName(rule);\n        }\n    }\n\n    parse<T extends AstNode = AstNode>(input: string, options: ParserOptions = {}): ParseResult<T> {\n        this.nodeBuilder.buildRootNode(input);\n        const lexerResult = this.lexerResult = this.lexer.tokenize(input);\n        this.wrapper.input = lexerResult.tokens;\n        const ruleMethod = options.rule ? this.allRules.get(options.rule) : this.mainRule;\n        if (!ruleMethod) {\n            throw new Error(options.rule ? `No rule found with name '${options.rule}'` : 'No main rule available.');\n        }\n        const result = this.doParse(ruleMethod);\n        this.nodeBuilder.addHiddenNodes(lexerResult.hidden);\n        this.unorderedGroups.clear();\n        this.lexerResult = undefined;\n        linkContentToContainer(result, { deep: true });\n        return {\n            value: result,\n            lexerErrors: lexerResult.errors,\n            lexerReport: lexerResult.report,\n            parserErrors: this.wrapper.errors\n        };\n    }\n\n    private doParse(rule: RuleResult): any {\n        let result = this.wrapper.rule(rule);\n        if (this.stack.length > 0) {\n            // In case the parser throws on the entry rule, `construct` is not called\n            // We need to call it manually here\n            result = this.construct();\n        }\n        // Perform some sanity checking\n        if (result === undefined) {\n            throw new Error('No result from parser');\n        } else if (this.stack.length > 0) {\n            throw new Error('Parser stack is not empty after parsing');\n        }\n        return result;\n    }\n\n    private startImplementation($type: string | symbol | undefined, infixName: string | undefined, implementation: RuleImpl): RuleImpl {\n        return (args) => {\n            // Only create a new AST node in case the calling rule is not a fragment rule\n            const createNode = !this.isRecording() && $type !== undefined;\n            if (createNode) {\n                const node: any = { $type };\n                this.stack.push(node);\n                if ($type === DatatypeSymbol) {\n                    node.value = '';\n                } else if (infixName !== undefined) {\n                    node.$infixName = infixName;\n                }\n            }\n            // Execute the actual rule implementation\n            // The `implementation` never returns anything and only manipulates the parser state.\n            implementation(args);\n            // Once the rule implementation is done, we need to construct the AST node\n            // If the implementation throws (likely a recognition error), we relay the construction to the `subrule` method\n            return createNode ? this.construct() : undefined;\n        };\n    }\n\n    private extractHiddenTokens(token: IToken): IToken[] {\n        const hiddenTokens = this.lexerResult!.hidden;\n        if (!hiddenTokens.length) {\n            return [];\n        }\n        const offset = token.startOffset;\n        for (let i = 0; i < hiddenTokens.length; i++) {\n            const token = hiddenTokens[i];\n            if (token.startOffset > offset) {\n                return hiddenTokens.splice(0, i);\n            }\n        }\n        return hiddenTokens.splice(0, hiddenTokens.length);\n    }\n\n    consume(idx: number, tokenType: TokenType, feature: AbstractElement): void {\n        const token = this.wrapper.wrapConsume(idx, tokenType);\n        if (!this.isRecording() && this.isValidToken(token)) {\n            // Before inserting the current token into the CST, we want add the hidden tokens (i.e. comments)\n            // These are located directly before the current token, but are not part of the token stream.\n            // Adding the hidden tokens to the CST requires searching through the CST and finding the correct position.\n            // Performing this work here is more efficient than doing it later on.\n            const hiddenTokens = this.extractHiddenTokens(token);\n            this.nodeBuilder.addHiddenNodes(hiddenTokens);\n            const leafNode = this.nodeBuilder.buildLeafNode(token, feature);\n            const { assignment, crossRef } = this.getAssignment(feature);\n            const current = this.current;\n            if (assignment) {\n                const convertedValue = isKeyword(feature) ? token.image : this.converter.convert(token.image, leafNode);\n                this.assign(assignment.operator, assignment.feature, convertedValue, leafNode, crossRef);\n            } else if (isDataTypeNode(current)) {\n                let text = token.image;\n                if (!isKeyword(feature)) {\n                    text = this.converter.convert(text, leafNode).toString();\n                }\n                current.value += text;\n            }\n        }\n    }\n\n    /**\n     * Most consumed parser tokens are valid. However there are two cases in which they are not valid:\n     *\n     * 1. They were inserted during error recovery by the parser. These tokens don't really exist and should not be further processed\n     * 2. They contain invalid token ranges. This might include the special EOF token, or other tokens produced by invalid token builders.\n     */\n    private isValidToken(token: IToken): boolean {\n        return !token.isInsertedInRecovery && !isNaN(token.startOffset) && typeof token.endOffset === 'number' && !isNaN(token.endOffset);\n    }\n\n    subrule(idx: number, rule: RuleResult, fragment: boolean, feature: AbstractElement, args: Args): void {\n        let cstNode: CompositeCstNode | undefined;\n        if (!this.isRecording() && !fragment) {\n            // We only want to create a new CST node if the subrule actually creates a new AST node.\n            // In other cases like calls of fragment rules the current CST/AST is populated further.\n            // Note that skipping this initialization and leaving cstNode unassigned also skips the subrule assignment later on.\n            // This is intended, as fragment rules only enrich the current AST node\n            cstNode = this.nodeBuilder.buildCompositeNode(feature);\n        }\n        let result: any;\n        try {\n            result = this.wrapper.wrapSubrule(idx, rule, args);\n        } finally {\n            if (!this.isRecording()) {\n                // Calling `subrule` on chevrotain parsers can result in a recognition error\n                // This likely means that we encounter a syntax error in the input.\n                // In this case, the result of the subrule is `undefined` and we need to call `construct` manually.\n                if (result === undefined && !fragment) {\n                    result = this.construct();\n                }\n                // We want to perform the subrule assignment regardless of the recognition error\n                // But only if the subrule call actually consumed any tokens\n                if (result !== undefined && cstNode && cstNode.length > 0) {\n                    this.performSubruleAssignment(result, feature, cstNode);\n                }\n            }\n            // We don't have a catch block in here because we want to propagate the recognition error to the caller\n            // This results in much better error recovery and error messages from chevrotain\n        }\n    }\n\n    private performSubruleAssignment(result: any, feature: AbstractElement, cstNode: CompositeCstNode): void {\n        const { assignment, crossRef } = this.getAssignment(feature);\n        if (assignment) {\n            this.assign(assignment.operator, assignment.feature, result, cstNode, crossRef);\n        } else if (!assignment) {\n            // If we call a subrule without an assignment we either:\n            // 1. append the result of the subrule (data type rule)\n            // 2. override the current object with the newly parsed object\n            // If the current element is an AST node and the result of the subrule\n            // is a data type rule, we can safely discard the results.\n            const current = this.current;\n            if (isDataTypeNode(current)) {\n                current.value += result.toString();\n            } else if (typeof result === 'object' && result) {\n                const object = this.assignWithoutOverride(result, current);\n                const newItem = object;\n                this.stack.pop();\n                this.stack.push(newItem);\n            }\n        }\n    }\n\n    action($type: string, action: Action): void {\n        if (!this.isRecording()) {\n            let last = this.current;\n            if (action.feature && action.operator) {\n                last = this.construct();\n                this.nodeBuilder.removeNode(last.$cstNode);\n                const node = this.nodeBuilder.buildCompositeNode(action);\n                node.content.push(last.$cstNode);\n                const newItem = { $type };\n                this.stack.push(newItem);\n                this.assign(action.operator, action.feature, last, last.$cstNode);\n            } else {\n                last.$type = $type;\n            }\n        }\n    }\n\n    private construct(): unknown {\n        if (this.isRecording()) {\n            return undefined;\n        }\n        const obj = this.stack.pop();\n        this.nodeBuilder.construct(obj);\n        if ('$infixName' in obj) {\n            return this.constructInfix(obj, this.operatorPrecedence.get(obj.$infixName)!);\n        } else if (isDataTypeNode(obj)) {\n            return this.converter.convert(obj.value, obj.$cstNode);\n        } else {\n            assignMandatoryProperties(this.astReflection, obj);\n        }\n        return obj;\n    }\n\n    private constructInfix(obj: InfixElement, precedence: Map<string, OperatorPrecedence>): any {\n        const parts = obj.parts;\n        if (!Array.isArray(parts) || parts.length === 0) {\n            // Likely the result of a syntax error, simply return undefined\n            return undefined;\n        }\n        const operators = obj.operators;\n        if (!Array.isArray(operators) || parts.length < 2) {\n            // Captured just a single, non-binary expression\n            // Simply return the expression as is.\n            return parts[0];\n        }\n        // Find the operator with the lowest precedence (highest value in precedence map)\n        let lowestPrecedenceIdx = 0;\n        let lowestPrecedenceValue = -1;\n\n        for (let i = 0; i < operators.length; i++) {\n            const operator = operators[i];\n            const opPrecedence = precedence.get(operator) ?? {\n                precedence: Infinity,\n                rightAssoc: false\n            };\n\n            // For equal precedence, use associativity to determine which operator to pick\n            if (opPrecedence.precedence > lowestPrecedenceValue) {\n                // Always pick operators with lower precedence (higher precedence value)\n                lowestPrecedenceValue = opPrecedence.precedence;\n                lowestPrecedenceIdx = i;\n            } else if (opPrecedence.precedence === lowestPrecedenceValue) {\n                // Check associativity when precedence is equal\n                if (!opPrecedence.rightAssoc) {\n                    // For left associative operators (default), pick the leftmost one\n                    // This means choosing the rightmost equal-precedence operator when working backwards\n                    lowestPrecedenceIdx = i;\n                }\n                // For right associative operators with equal precedence,\n                // we keep the previous (rightmost) index\n            }\n        }\n\n        // Split the expression at the lowest precedence operator\n        const leftOperators = operators.slice(0, lowestPrecedenceIdx);\n        const rightOperators = operators.slice(lowestPrecedenceIdx + 1);\n\n        const leftParts = parts.slice(0, lowestPrecedenceIdx + 1);\n        const rightParts = parts.slice(lowestPrecedenceIdx + 1);\n\n        // Create sub-expressions\n        const leftInfix: InfixElement = {\n            $infixName: obj.$infixName,\n            $type: obj.$type,\n            $cstNode: obj.$cstNode,\n            parts: leftParts,\n            operators: leftOperators\n        };\n        const rightInfix: InfixElement = {\n            $infixName: obj.$infixName,\n            $type: obj.$type,\n            $cstNode: obj.$cstNode,\n            parts: rightParts,\n            operators: rightOperators\n        };\n\n        // Recursively build the left and right subtrees\n        const leftTree = this.constructInfix(leftInfix, precedence);\n        const rightTree = this.constructInfix(rightInfix, precedence);\n\n        // Create the final binary expression\n        return {\n            $type: obj.$type,\n            $cstNode: obj.$cstNode,\n            left: leftTree,\n            operator: operators[lowestPrecedenceIdx],\n            right: rightTree\n        };\n    }\n\n    private getAssignment(feature: AbstractElement): AssignmentElement {\n        if (!this.assignmentMap.has(feature)) {\n            const assignment = getContainerOfType(feature, isAssignment);\n            this.assignmentMap.set(feature, {\n                assignment: assignment,\n                crossRef: assignment && isCrossReference(assignment.terminal) ? (assignment.terminal.isMulti ? 'multi' : 'single') : undefined\n            });\n        }\n        return this.assignmentMap.get(feature)!;\n    }\n\n    private assign(operator: string, feature: string, value: unknown, cstNode: CstNode, crossRef?: 'multi' | 'single'): void {\n        const obj = this.current;\n        let item: unknown;\n        if (crossRef === 'single' && typeof value === 'string') {\n            item = this.linker.buildReference(obj, feature, cstNode, value);\n        } else if (crossRef === 'multi' && typeof value === 'string') {\n            item = this.linker.buildMultiReference(obj, feature, cstNode, value);\n        } else {\n            item = value;\n        }\n        switch (operator) {\n            case '=': {\n                obj[feature] = item;\n                break;\n            }\n            case '?=': {\n                obj[feature] = true;\n                break;\n            }\n            case '+=': {\n                if (!Array.isArray(obj[feature])) {\n                    obj[feature] = [];\n                }\n                obj[feature].push(item);\n            }\n        }\n    }\n\n    private assignWithoutOverride(target: any, source: any): any {\n        for (const [name, existingValue] of Object.entries(source)) {\n            const newValue = target[name];\n            if (newValue === undefined) {\n                target[name] = existingValue;\n            } else if (Array.isArray(newValue) && Array.isArray(existingValue)) {\n                existingValue.push(...newValue);\n                target[name] = existingValue;\n            }\n        }\n        // The target was parsed from a unassigned subrule\n        // After the subrule construction, it received a cst node\n        // This CST node will later be overriden by the cst node builder\n        // To prevent references to stale AST nodes in the CST,\n        // we need to remove the reference here\n        const targetCstNode = target.$cstNode;\n        if (targetCstNode) {\n            targetCstNode.astNode = undefined;\n            target.$cstNode = undefined;\n        }\n        return target;\n    }\n\n    get definitionErrors(): IParserDefinitionError[] {\n        return this.wrapper.definitionErrors;\n    }\n}\n\nexport interface IParserDefinitionError {\n    message: string\n    type: number\n    ruleName?: string\n}\n\nexport abstract class AbstractParserErrorMessageProvider implements IParserErrorMessageProvider {\n\n    buildMismatchTokenMessage(options: {\n        expected: TokenType\n        actual: IToken\n        previous: IToken\n        ruleName: string\n    }): string {\n        return defaultParserErrorProvider.buildMismatchTokenMessage(options);\n    }\n\n    buildNotAllInputParsedMessage(options: {\n        firstRedundant: IToken\n        ruleName: string\n    }): string {\n        return defaultParserErrorProvider.buildNotAllInputParsedMessage(options);\n    }\n\n    buildNoViableAltMessage(options: {\n        expectedPathsPerAlt: TokenType[][][]\n        actual: IToken[]\n        previous: IToken\n        customUserDescription: string\n        ruleName: string\n    }): string {\n        return defaultParserErrorProvider.buildNoViableAltMessage(options);\n    }\n\n    buildEarlyExitMessage(options: {\n        expectedIterationPaths: TokenType[][]\n        actual: IToken[]\n        previous: IToken\n        customUserDescription: string\n        ruleName: string\n    }): string {\n        return defaultParserErrorProvider.buildEarlyExitMessage(options);\n    }\n\n}\n\nexport class LangiumParserErrorMessageProvider extends AbstractParserErrorMessageProvider {\n\n    override buildMismatchTokenMessage({ expected, actual }: {\n        expected: TokenType\n        actual: IToken\n        previous: IToken\n        ruleName: string\n    }): string {\n        const expectedMsg = expected.LABEL\n            ? '`' + expected.LABEL + '`'\n            : expected.name.endsWith(':KW')\n                ? `keyword '${expected.name.substring(0, expected.name.length - 3)}'`\n                : `token of type '${expected.name}'`;\n        return `Expecting ${expectedMsg} but found \\`${actual.image}\\`.`;\n    }\n\n    override buildNotAllInputParsedMessage({ firstRedundant }: {\n        firstRedundant: IToken\n        ruleName: string\n    }): string {\n        return `Expecting end of file but found \\`${firstRedundant.image}\\`.`;\n    }\n}\n\nexport interface CompletionParserResult {\n    tokens: IToken[]\n    elementStack: AbstractElement[]\n    tokenIndex: number\n}\n\nexport class LangiumCompletionParser extends AbstractLangiumParser {\n    private tokens: IToken[] = [];\n\n    private elementStack: AbstractElement[] = [];\n    private lastElementStack: AbstractElement[] = [];\n    private nextTokenIndex = 0;\n    private stackSize = 0;\n\n    constructor(services: LangiumCoreServices) {\n        super(services, true);\n    }\n\n    action(): void {\n        // NOOP\n    }\n\n    construct(): unknown {\n        // NOOP\n        return undefined;\n    }\n\n    parse(input: string): CompletionParserResult {\n        this.resetState();\n        const tokens = this.lexer.tokenize(input, { mode: 'partial' });\n        this.tokens = tokens.tokens;\n        this.wrapper.input = [...this.tokens];\n        this.mainRule.call(this.wrapper, {});\n        this.unorderedGroups.clear();\n        return {\n            tokens: this.tokens,\n            elementStack: [...this.lastElementStack],\n            tokenIndex: this.nextTokenIndex\n        };\n    }\n\n    rule(rule: ParserRule, impl: RuleImpl): RuleResult {\n        const ruleMethod = this.wrapper.DEFINE_RULE(withRuleSuffix(rule.name), this.startImplementation(impl).bind(this));\n        this.allRules.set(rule.name, ruleMethod);\n        if (rule.entry) {\n            this.mainRule = ruleMethod;\n        }\n        return ruleMethod;\n    }\n\n    private resetState(): void {\n        this.elementStack = [];\n        this.lastElementStack = [];\n        this.nextTokenIndex = 0;\n        this.stackSize = 0;\n    }\n\n    private startImplementation(implementation: RuleImpl): RuleImpl {\n        return (args) => {\n            const size = this.keepStackSize();\n            try {\n                implementation(args);\n            } finally {\n                this.resetStackSize(size);\n            }\n        };\n    }\n\n    private removeUnexpectedElements(): void {\n        this.elementStack.splice(this.stackSize);\n    }\n\n    keepStackSize(): number {\n        const size = this.elementStack.length;\n        this.stackSize = size;\n        return size;\n    }\n\n    resetStackSize(size: number): void {\n        this.removeUnexpectedElements();\n        this.stackSize = size;\n    }\n\n    consume(idx: number, tokenType: TokenType, feature: AbstractElement): void {\n        this.wrapper.wrapConsume(idx, tokenType);\n        if (!this.isRecording()) {\n            this.lastElementStack = [...this.elementStack, feature];\n            this.nextTokenIndex = this.currIdx + 1;\n        }\n    }\n\n    subrule(idx: number, rule: RuleResult, fragment: boolean, feature: AbstractElement, args: Args): void {\n        this.before(feature);\n        this.wrapper.wrapSubrule(idx, rule, args);\n        this.after(feature);\n    }\n\n    before(element: AbstractElement): void {\n        if (!this.isRecording()) {\n            this.elementStack.push(element);\n        }\n    }\n\n    after(element: AbstractElement): void {\n        if (!this.isRecording()) {\n            const index = this.elementStack.lastIndexOf(element);\n            if (index >= 0) {\n                this.elementStack.splice(index);\n            }\n        }\n    }\n\n    get currIdx(): number {\n        return (this.wrapper as any).currIdx;\n    }\n}\n\nconst defaultConfig: IParserConfig = {\n    recoveryEnabled: true,\n    nodeLocationTracking: 'full',\n    skipValidations: true,\n    errorMessageProvider: new LangiumParserErrorMessageProvider()\n};\n\n/**\n * This class wraps the embedded actions parser of chevrotain and exposes protected methods.\n * This way, we can build the `LangiumParser` as a composition.\n */\nclass ChevrotainWrapper extends EmbeddedActionsParser {\n\n    // This array is set in the base implementation of Chevrotain.\n    definitionErrors: IParserDefinitionError[];\n\n    constructor(tokens: TokenVocabulary, config: IParserConfig, incomplete: boolean) {\n        const useDefaultLookahead = config && 'maxLookahead' in config;\n        super(tokens, {\n            ...defaultConfig,\n            lookaheadStrategy: useDefaultLookahead\n                ? new LLkLookaheadStrategy({ maxLookahead: config.maxLookahead })\n                : new LLStarLookaheadStrategy({\n                    // If validations are skipped, don't log the lookahead warnings\n                    logging: config.skipValidations ? () => { } : undefined,\n                    incomplete,\n                }),\n            ...config,\n        });\n    }\n\n    get IS_RECORDING(): boolean {\n        return this.RECORDING_PHASE;\n    }\n\n    DEFINE_RULE(name: string, impl: RuleImpl, config?: IRuleConfig<any>): RuleResult {\n        return this.RULE(name, impl, config);\n    }\n\n    wrapSelfAnalysis(): void {\n        this.performSelfAnalysis();\n    }\n\n    wrapConsume(idx: number, tokenType: TokenType): IToken {\n        return this.consume(idx, tokenType, undefined);\n    }\n\n    wrapSubrule(idx: number, rule: RuleResult, args: Args): unknown {\n        return this.subrule(idx, rule, {\n            ARGS: [args]\n        });\n    }\n\n    wrapOr(idx: number, choices: Array<IOrAlt<any>>): void {\n        this.or(idx, choices);\n    }\n\n    wrapOption(idx: number, callback: DSLMethodOpts<unknown>): void {\n        this.option(idx, callback);\n    }\n\n    wrapMany(idx: number, callback: DSLMethodOpts<unknown>): void {\n        this.many(idx, callback);\n    }\n\n    wrapAtLeastOne(idx: number, callback: DSLMethodOpts<unknown>): void {\n        this.atLeastOne(idx, callback);\n    }\n    rule(rule: RuleResult): any {\n        return rule.call(this, {});\n    }\n}\n\nclass ProfilerWrapper extends ChevrotainWrapper {\n    private readonly task: ProfilingTask;\n    constructor(tokens: TokenVocabulary, config: IParserConfig, incomplete: boolean, task: ProfilingTask) {\n        super(tokens, config, incomplete);\n        this.task = task;\n    }\n\n    override rule(rule: RuleResult): any {\n        this.task.start();\n        this.task.startSubTask(this.ruleName(rule));\n        try {\n            return super.rule(rule);\n        }\n        finally {\n            this.task.stopSubTask(this.ruleName(rule));\n            this.task.stop();\n        }\n    }\n\n    private ruleName(rule: any): string {\n        return rule.ruleName as string;\n    }\n    protected override subrule<ARGS extends unknown[], R>(idx: number, ruleToCall: ParserMethod<ARGS, R>, options?: SubruleMethodOpts<ARGS>): R {\n        this.task.startSubTask(this.ruleName(ruleToCall));\n        try {\n            return super.subrule<ARGS, R>(idx, ruleToCall, options);\n        }\n        finally {\n            this.task.stopSubTask(this.ruleName(ruleToCall));\n        }\n    }\n}\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { IOrAlt, TokenType, TokenTypeDictionary } from 'chevrotain';\nimport type { AbstractElement, Action, Alternatives, Assignment, Condition, CrossReference, Grammar, Group, InfixRule, Keyword, NamedArgument, ParserRule, RuleCall, UnorderedGroup } from '../languages/generated/ast.js';\nimport type { BaseParser } from './langium-parser.js';\nimport type { AstNode } from '../syntax-tree.js';\nimport type { Cardinality } from '../utils/grammar-utils.js';\nimport { EMPTY_ALT, EOF } from 'chevrotain';\nimport { isAction, isAlternatives, isEndOfFile, isAssignment, isConjunction, isCrossReference, isDisjunction, isGroup, isKeyword, isNegation, isParameterReference, isParserRule, isRuleCall, isTerminalRule, isUnorderedGroup, isBooleanLiteral, isInfixRule, isAbstractParserRule } from '../languages/generated/ast.js';\nimport { assertUnreachable, ErrorWithLocation } from '../utils/errors.js';\nimport { stream } from '../utils/stream.js';\nimport { findNameAssignment, getAllReachableRules, getTypeName } from '../utils/grammar-utils.js';\n\ntype RuleContext = {\n    optional: number,\n    consume: number,\n    subrule: number,\n    many: number,\n    or: number\n} & ParserContext;\n\ntype ParserContext = {\n    parser: BaseParser\n    tokens: TokenTypeDictionary\n    ruleNames: Map<AstNode, string>\n}\n\ntype Rule = (args: Args) => unknown;\n\ntype Args = Record<string, boolean>;\n\ntype Predicate = (args: Args) => boolean;\n\ntype Method = (args: Args) => void;\n\nexport function createParser<T extends BaseParser>(grammar: Grammar, parser: T, tokens: TokenTypeDictionary): T {\n    const parserContext: ParserContext = {\n        parser,\n        tokens,\n        ruleNames: new Map()\n    };\n    buildRules(parserContext, grammar);\n    return parser;\n}\n\nfunction buildRules(parserContext: ParserContext, grammar: Grammar): void {\n    const reachable = getAllReachableRules(grammar, false);\n    const parserRules = stream(grammar.rules).filter(isParserRule).filter(rule => reachable.has(rule));\n    for (const rule of parserRules) {\n        const ctx: RuleContext = {\n            ...parserContext,\n            consume: 1,\n            optional: 1,\n            subrule: 1,\n            many: 1,\n            or: 1\n        };\n        parserContext.parser.rule(rule, buildElement(ctx, rule.definition));\n    }\n    const infixRules = stream(grammar.rules).filter(isInfixRule).filter(rule => reachable.has(rule));\n    for (const rule of infixRules) {\n        parserContext.parser.rule(rule, buildInfixRule(parserContext, rule));\n    }\n}\n\nfunction buildInfixRule(ctx: ParserContext, rule: InfixRule): Method {\n    const expressionRule = rule.call.rule.ref;\n    if (!expressionRule) {\n        throw new Error('Could not resolve reference to infix operator rule: ' + rule.call.rule.$refText);\n    }\n    if (isTerminalRule(expressionRule)) {\n        throw new Error('Cannot use terminal rule in infix expression');\n    }\n    // We need to construct a bunch of synthetic grammar AST nodes here\n    // This ensures that the CST and completion engine get populated as expected\n    const allKeywords = rule.operators.precedences.flatMap(e => e.operators);\n    // The outer group represents the first expression call and the whole (optional) loop\n    const outerGroup: Group = {\n        $type: 'Group',\n        elements: []\n    };\n    const part1Assignment: Assignment = {\n        $container: outerGroup,\n        $type: 'Assignment',\n        feature: 'parts',\n        operator: '+=',\n        terminal: rule.call\n    };\n    // The inner group represents the loop that contains the operator and expression call\n    // It can be infinitely repeated\n    const innerGroup: Group = {\n        $container: outerGroup,\n        $type: 'Group',\n        elements: [],\n        cardinality: '*'\n    };\n    outerGroup.elements.push(part1Assignment, innerGroup);\n    // Store all operator keywords in one alternative/assignment\n    const alternatives: Alternatives = {\n        $type: 'Alternatives',\n        elements: allKeywords\n    };\n    const operatorAssignment: Assignment = {\n        $container: innerGroup,\n        $type: 'Assignment',\n        feature: 'operators',\n        operator: '+=',\n        terminal: alternatives\n    };\n    // We need a second assignment of the called expression here\n    const part2Assignment: Assignment = {\n        ...part1Assignment,\n        $container: innerGroup\n    };\n    innerGroup.elements.push(operatorAssignment, part2Assignment);\n    const tokens = allKeywords.map(e => ctx.tokens[e.value]);\n    const orAlts: Array<IOrAlt<unknown>> = tokens.map((token, index) => ({\n        ALT: () => ctx.parser.consume(index, token, operatorAssignment)\n    }));\n    let subrule: Rule;\n    return (args) => {\n        subrule ??= getRule(ctx, expressionRule);\n        ctx.parser.subrule(0, subrule, false, part1Assignment, args);\n        ctx.parser.many(0, {\n            DEF: () => {\n                ctx.parser.alternatives(0, orAlts);\n                ctx.parser.subrule(1, subrule, false, part2Assignment, args);\n            }\n        });\n    };\n}\n\nfunction buildElement(ctx: RuleContext, element: AbstractElement, ignoreGuard = false): Method {\n    let method: Method;\n    if (isKeyword(element)) {\n        method = buildKeyword(ctx, element);\n    } else if (isAction(element)) {\n        method = buildAction(ctx, element);\n    } else if (isAssignment(element)) {\n        method = buildElement(ctx, element.terminal);\n    } else if (isCrossReference(element)) {\n        method = buildCrossReference(ctx, element);\n    } else if (isRuleCall(element)) {\n        method = buildRuleCall(ctx, element);\n    } else if (isAlternatives(element)) {\n        method = buildAlternatives(ctx, element);\n    } else if (isUnorderedGroup(element)) {\n        method = buildUnorderedGroup(ctx, element);\n    } else if (isGroup(element)) {\n        method = buildGroup(ctx, element);\n    } else if(isEndOfFile(element)) {\n        const idx = ctx.consume++;\n        method = () => ctx.parser.consume(idx, EOF, element);\n    } else {\n        throw new ErrorWithLocation(element.$cstNode, `Unexpected element type: ${element.$type}`);\n    }\n    return wrap(ctx, ignoreGuard ? undefined : getGuardCondition(element), method, element.cardinality);\n}\n\nfunction buildAction(ctx: RuleContext, action: Action): Method {\n    const actionType = getTypeName(action);\n    return () => ctx.parser.action(actionType, action);\n}\n\nfunction buildRuleCall(ctx: RuleContext, ruleCall: RuleCall): Method {\n    const rule = ruleCall.rule.ref;\n    if (isAbstractParserRule(rule)) {\n        const idx = ctx.subrule++;\n        const fragment = isParserRule(rule) && rule.fragment;\n        const predicate = ruleCall.arguments.length > 0 ? buildRuleCallPredicate(rule, ruleCall.arguments) : () => ({});\n        let subrule: Rule;\n        return (args) => {\n            subrule ??= getRule(ctx, rule);\n            ctx.parser.subrule(idx, subrule, fragment, ruleCall, predicate(args));\n        };\n    } else if (isTerminalRule(rule)) {\n        const idx = ctx.consume++;\n        const method = getToken(ctx, rule.name);\n        return () => ctx.parser.consume(idx, method, ruleCall);\n    } else if (!rule) {\n        throw new ErrorWithLocation(ruleCall.$cstNode, `Undefined rule: ${ruleCall.rule.$refText}`);\n    } else {\n        assertUnreachable(rule);\n    }\n}\n\nfunction buildRuleCallPredicate(rule: ParserRule | InfixRule, namedArgs: NamedArgument[]): (args: Args) => Args {\n    const hasNamedArguments = namedArgs.some(arg => arg.calledByName);\n    if (hasNamedArguments) {\n        const namedPredicates = namedArgs.map(arg => ({\n            parameterName: arg.parameter?.ref?.name,\n            predicate: buildPredicate(arg.value)\n        }));\n        return (args) => {\n            const ruleArgs: Args = {};\n            for (const { parameterName, predicate } of namedPredicates) {\n                if (parameterName) {\n                    ruleArgs[parameterName] = predicate(args);\n                }\n            }\n            return ruleArgs;\n        };\n    } else {\n        const predicates = namedArgs.map(arg => buildPredicate(arg.value));\n        return (args) => {\n            const ruleArgs: Args = {};\n            for (let i = 0; i < predicates.length; i++) {\n                if (i < rule.parameters.length) {\n                    const parameterName = rule.parameters[i].name;\n                    const predicate = predicates[i];\n                    ruleArgs[parameterName] = predicate(args);\n                }\n            }\n            return ruleArgs;\n        };\n    }\n}\n\ninterface PredicatedMethod {\n    ALT: Method,\n    GATE?: Predicate\n}\n\nfunction buildPredicate(condition: Condition): Predicate {\n    if (isDisjunction(condition)) {\n        const left = buildPredicate(condition.left);\n        const right = buildPredicate(condition.right);\n        return (args) => (left(args) || right(args));\n    } else if (isConjunction(condition)) {\n        const left = buildPredicate(condition.left);\n        const right = buildPredicate(condition.right);\n        return (args) => (left(args) && right(args));\n    } else if (isNegation(condition)) {\n        const value = buildPredicate(condition.value);\n        return (args) => !value(args);\n    } else if (isParameterReference(condition)) {\n        const name = condition.parameter.ref!.name;\n        return (args) => args !== undefined && args[name] === true;\n    } else if (isBooleanLiteral(condition)) {\n        const value = Boolean(condition.true);\n        return () => value;\n    }\n    assertUnreachable(condition);\n}\n\nfunction buildAlternatives(ctx: RuleContext, alternatives: Alternatives): Method {\n    if (alternatives.elements.length === 1) {\n        return buildElement(ctx, alternatives.elements[0]);\n    } else {\n        const methods: PredicatedMethod[] = [];\n\n        for (const element of alternatives.elements) {\n            const predicatedMethod: PredicatedMethod = {\n                // Since we handle the guard condition in the alternative already\n                // We can ignore the group guard condition inside\n                ALT: buildElement(ctx, element, true)\n            };\n            const guard = getGuardCondition(element);\n            if (guard) {\n                predicatedMethod.GATE = buildPredicate(guard);\n            }\n            methods.push(predicatedMethod);\n        }\n\n        const idx = ctx.or++;\n        return (args) => ctx.parser.alternatives(idx, methods.map(method => {\n            const alt: IOrAlt<unknown> = {\n                ALT: () => method.ALT(args)\n            };\n            const gate = method.GATE;\n            if (gate) {\n                alt.GATE = () => gate(args);\n            }\n            return alt;\n        }));\n    }\n}\n\nfunction buildUnorderedGroup(ctx: RuleContext, group: UnorderedGroup): Method {\n    if (group.elements.length === 1) {\n        return buildElement(ctx, group.elements[0]);\n    }\n    const methods: PredicatedMethod[] = [];\n\n    for (const element of group.elements) {\n        const predicatedMethod: PredicatedMethod = {\n            // Since we handle the guard condition in the alternative already\n            // We can ignore the group guard condition inside\n            ALT: buildElement(ctx, element, true)\n        };\n        const guard = getGuardCondition(element);\n        if (guard) {\n            predicatedMethod.GATE = buildPredicate(guard);\n        }\n        methods.push(predicatedMethod);\n    }\n\n    const orIdx = ctx.or++;\n\n    const idFunc = (groupIdx: number, lParser: BaseParser) => {\n        const stackId = lParser.getRuleStack().join('-');\n        return `uGroup_${groupIdx}_${stackId}`;\n    };\n    const alternatives: Method = (args) => ctx.parser.alternatives(orIdx, methods.map((method, idx) => {\n        const alt: IOrAlt<unknown> = { ALT: () => true };\n        const parser = ctx.parser;\n        alt.ALT = () => {\n            method.ALT(args);\n            if (!parser.isRecording()) {\n                const key = idFunc(orIdx, parser);\n                if (!parser.unorderedGroups.get(key)) {\n                    // init after clear state\n                    parser.unorderedGroups.set(key, []);\n                }\n                const groupState = parser.unorderedGroups.get(key)!;\n                if (typeof groupState?.[idx] === 'undefined') {\n                    // Not accessed yet\n                    groupState[idx] = true;\n                }\n            }\n        };\n        const gate = method.GATE;\n        if (gate) {\n            alt.GATE = () => gate(args);\n        } else {\n            alt.GATE = () => {\n                const trackedAlternatives = parser.unorderedGroups.get(idFunc(orIdx, parser));\n                const allow = !trackedAlternatives?.[idx];\n                return allow;\n            };\n        }\n        return alt;\n    }));\n    const wrapped = wrap(ctx, getGuardCondition(group), alternatives, '*');\n    return (args) => {\n        wrapped(args);\n        if (!ctx.parser.isRecording()) {\n            ctx.parser.unorderedGroups.delete(idFunc(orIdx, ctx.parser));\n        }\n    };\n}\n\nfunction buildGroup(ctx: RuleContext, group: Group): Method {\n    const methods = group.elements.map(e => buildElement(ctx, e));\n    return (args) => methods.forEach(method => method(args));\n}\n\nfunction getGuardCondition(element: AbstractElement): Condition | undefined {\n    if (isGroup(element)) {\n        return element.guardCondition;\n    }\n    return undefined;\n}\n\nfunction buildCrossReference(ctx: RuleContext, crossRef: CrossReference, terminal = crossRef.terminal): Method {\n    if (!terminal) {\n        if (!crossRef.type.ref) {\n            throw new Error('Could not resolve reference to type: ' + crossRef.type.$refText);\n        }\n        const assignment = findNameAssignment(crossRef.type.ref);\n        const assignTerminal = assignment?.terminal;\n        if (!assignTerminal) {\n            throw new Error('Could not find name assignment for type: ' + getTypeName(crossRef.type.ref));\n        }\n        return buildCrossReference(ctx, crossRef, assignTerminal);\n    } else if (isRuleCall(terminal) && isParserRule(terminal.rule.ref)) {\n        // The terminal is a data type rule here. Everything else will result in a validation error.\n        const rule = terminal.rule.ref;\n        const idx = ctx.subrule++;\n        let subrule: Rule;\n        return (args) => {\n            subrule ??= getRule(ctx, rule);\n            ctx.parser.subrule(idx, subrule, false, crossRef, args);\n        };\n    } else if (isRuleCall(terminal) && isTerminalRule(terminal.rule.ref)) {\n        const idx = ctx.consume++;\n        const terminalRule = getToken(ctx, terminal.rule.ref.name);\n        return () => ctx.parser.consume(idx, terminalRule, crossRef);\n    } else if (isKeyword(terminal)) {\n        const idx = ctx.consume++;\n        const keyword = getToken(ctx, terminal.value);\n        return () => ctx.parser.consume(idx, keyword, crossRef);\n    }\n    else {\n        throw new Error('Could not build cross reference parser');\n    }\n}\n\nfunction buildKeyword(ctx: RuleContext, keyword: Keyword): Method {\n    const idx = ctx.consume++;\n    const token = ctx.tokens[keyword.value];\n    if (!token) {\n        throw new Error('Could not find token for keyword: ' + keyword.value);\n    }\n    return () => ctx.parser.consume(idx, token, keyword);\n}\n\nfunction wrap(ctx: RuleContext, guard: Condition | undefined, method: Method, cardinality: Cardinality): Method {\n    const gate = guard && buildPredicate(guard);\n\n    if (!cardinality) {\n        if (gate) {\n            const idx = ctx.or++;\n            return (args) => ctx.parser.alternatives(idx, [\n                {\n                    ALT: () => method(args),\n                    GATE: () => gate(args)\n                },\n                {\n                    ALT: EMPTY_ALT(),\n                    GATE: () => !gate(args)\n                }\n            ]);\n        } else {\n            return method;\n        }\n    }\n\n    if (cardinality === '*') {\n        const idx = ctx.many++;\n        return (args) => ctx.parser.many(idx, {\n            DEF: () => method(args),\n            GATE: gate ? () => gate(args) : undefined\n        });\n    } else if (cardinality === '+') {\n        const idx = ctx.many++;\n        if (gate) {\n            const orIdx = ctx.or++;\n            // In the case of a guard condition for the `+` group\n            // We combine it with an empty alternative\n            // If the condition returns true, it needs to parse at least a single iteration\n            // If its false, it is not allowed to parse anything\n            return (args) => ctx.parser.alternatives(orIdx, [\n                {\n                    ALT: () => ctx.parser.atLeastOne(idx, {\n                        DEF: () => method(args)\n                    }),\n                    GATE: () => gate(args)\n                },\n                {\n                    ALT: EMPTY_ALT(),\n                    GATE: () => !gate(args)\n                }\n            ]);\n        } else {\n            return (args) => ctx.parser.atLeastOne(idx, {\n                DEF: () => method(args),\n            });\n        }\n    } else if (cardinality === '?') {\n        const idx = ctx.optional++;\n        return (args) => ctx.parser.optional(idx, {\n            DEF: () => method(args),\n            GATE: gate ? () => gate(args) : undefined\n        });\n    } else {\n        assertUnreachable(cardinality);\n    }\n}\n\nfunction getRule(ctx: ParserContext, element: ParserRule | InfixRule | AbstractElement): Rule {\n    const name = getRuleName(ctx, element);\n    const rule = ctx.parser.getRule(name);\n    if (!rule) throw new Error(`Rule \"${name}\" not found.\"`);\n    return rule;\n}\n\nfunction getRuleName(ctx: ParserContext, element: ParserRule | InfixRule | AbstractElement): string {\n    if (isAbstractParserRule(element)) {\n        return element.name;\n    } else if (ctx.ruleNames.has(element)) {\n        return ctx.ruleNames.get(element)!;\n    } else {\n        let item: AstNode = element;\n        let parent: AstNode = item.$container!;\n        let ruleName: string = element.$type;\n        while (!isParserRule(parent)) {\n            if (isGroup(parent) || isAlternatives(parent) || isUnorderedGroup(parent)) {\n                const index = parent.elements.indexOf(item as AbstractElement);\n                ruleName = index.toString() + ':' + ruleName;\n            }\n            item = parent;\n            parent = parent.$container!;\n        }\n        const rule = parent as ParserRule;\n        ruleName = rule.name + ':' + ruleName;\n        ctx.ruleNames.set(element, ruleName);\n        return ruleName;\n    }\n}\n\nfunction getToken(ctx: ParserContext, name: string): TokenType {\n    const token = ctx.tokens[name];\n    if (!token) throw new Error(`Token \"${name}\" not found.\"`);\n    return token;\n}\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices } from '../services.js';\nimport { LangiumCompletionParser } from './langium-parser.js';\nimport { createParser } from './parser-builder-base.js';\n\nexport function createCompletionParser(services: LangiumCoreServices): LangiumCompletionParser {\n    const grammar = services.Grammar;\n    const lexer = services.parser.Lexer;\n    const parser = new LangiumCompletionParser(services);\n    createParser(grammar, parser, lexer.definition);\n    parser.finalize();\n    return parser;\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices } from '../services.js';\nimport { LangiumParser } from './langium-parser.js';\nimport { createParser } from './parser-builder-base.js';\n\n/**\n * Create and finalize a Langium parser. The parser rules are derived from the grammar, which is\n * available at `services.Grammar`.\n */\nexport function createLangiumParser(services: LangiumCoreServices): LangiumParser {\n    const parser = prepareLangiumParser(services);\n    parser.finalize();\n    return parser;\n}\n\n/**\n * Create a Langium parser without finalizing it. This is used to extract more detailed error\n * information when the parser is initially validated.\n */\nexport function prepareLangiumParser(services: LangiumCoreServices): LangiumParser {\n    const grammar = services.Grammar;\n    const lexer = services.parser.Lexer;\n    const parser = new LangiumParser(services);\n    return createParser(grammar, parser, lexer.definition);\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { CustomPatternMatcherFunc, ILexingError, TokenPattern, TokenType, TokenVocabulary } from 'chevrotain';\nimport type { AbstractRule, Grammar, Keyword, TerminalRule } from '../languages/generated/ast.js';\nimport type { Stream } from '../utils/stream.js';\nimport { Lexer } from 'chevrotain';\nimport { isAbstractParserRule, isKeyword, isTerminalRule } from '../languages/generated/ast.js';\nimport { streamAllContents } from '../utils/ast-utils.js';\nimport { getAllReachableRules, terminalRegex } from '../utils/grammar-utils.js';\nimport { escapeRegExp, isWhitespace, partialMatches } from '../utils/regexp-utils.js';\nimport { stream } from '../utils/stream.js';\n\nexport interface TokenBuilderOptions {\n    caseInsensitive?: boolean\n}\n\nexport interface TokenBuilder {\n    buildTokens(grammar: Grammar, options?: TokenBuilderOptions): TokenVocabulary;\n    /**\n     * Produces a lexing report for the given text that was just tokenized using the tokens provided by this builder.\n     *\n     * @param text The text that was tokenized.\n     */\n    flushLexingReport?(text: string): LexingReport;\n}\n\n/**\n * A custom lexing report that can be produced by the token builder during the lexing process.\n * Adopters need to ensure that the any custom fields are serializable so they can be sent across worker threads.\n */\nexport interface LexingReport {\n    diagnostics: LexingDiagnostic[];\n}\n\nexport type LexingDiagnosticSeverity = 'error' | 'warning' | 'info' | 'hint';\n\nexport interface LexingDiagnostic extends ILexingError {\n    severity?: LexingDiagnosticSeverity;\n}\n\nexport class DefaultTokenBuilder implements TokenBuilder {\n    /**\n     * The list of diagnostics stored during the lexing process of a single text.\n     */\n    protected diagnostics: LexingDiagnostic[] = [];\n\n    buildTokens(grammar: Grammar, options?: TokenBuilderOptions): TokenVocabulary {\n        const reachableRules = stream(getAllReachableRules(grammar, false));\n        const terminalTokens: TokenType[] = this.buildTerminalTokens(reachableRules);\n        const tokens: TokenType[] = this.buildKeywordTokens(reachableRules, terminalTokens, options);\n\n        // Add all terminals tokens to the end in the order they were defined\n        // Chevrotain documentation recommends to add Whitespace-like tokens at the start\n        // However, assuming the lexer is able to optimize the tokens, it should not matter\n        tokens.push(...terminalTokens);\n        // We don't need to add the EOF token explicitly.\n        // It is automatically available at the end of the token stream.\n        return tokens;\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    flushLexingReport(text: string): LexingReport {\n        return { diagnostics: this.popDiagnostics() };\n    }\n\n    protected popDiagnostics(): LexingDiagnostic[] {\n        const diagnostics = [...this.diagnostics];\n        this.diagnostics = [];\n        return diagnostics;\n    }\n\n    protected buildTerminalTokens(rules: Stream<AbstractRule>): TokenType[] {\n        return rules.filter(isTerminalRule).filter(e => !e.fragment)\n            .map(terminal => this.buildTerminalToken(terminal)).toArray();\n    }\n\n    protected buildTerminalToken(terminal: TerminalRule): TokenType {\n        const regex = terminalRegex(terminal);\n        const pattern = this.requiresCustomPattern(regex) ? this.regexPatternFunction(regex) : regex;\n        const tokenType: TokenType = {\n            name: terminal.name,\n            PATTERN: pattern,\n        };\n        if (typeof pattern === 'function') {\n            tokenType.LINE_BREAKS = true;\n        }\n        if (terminal.hidden) {\n            // Only skip tokens that are able to accept whitespace\n            tokenType.GROUP = isWhitespace(regex) ? Lexer.SKIPPED : 'hidden';\n        }\n        return tokenType;\n    }\n\n    protected requiresCustomPattern(regex: RegExp): boolean {\n        if (regex.flags.includes('u') || regex.flags.includes('s')) {\n            // Unicode and dotall regexes are not supported by Chevrotain.\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    protected regexPatternFunction(regex: RegExp): CustomPatternMatcherFunc {\n        const stickyRegex = new RegExp(regex, regex.flags + 'y');\n        return (text, offset) => {\n            stickyRegex.lastIndex = offset;\n            const execResult = stickyRegex.exec(text);\n            return execResult;\n        };\n    }\n\n    protected buildKeywordTokens(rules: Stream<AbstractRule>, terminalTokens: TokenType[], options?: TokenBuilderOptions): TokenType[] {\n        return rules\n            // We filter by parser rules, since keywords in terminal rules get transformed into regex and are not actual tokens\n            .filter(isAbstractParserRule)\n            .flatMap(rule => streamAllContents(rule).filter(isKeyword))\n            .distinct(e => e.value).toArray()\n            // Sort keywords by descending length\n            .sort((a, b) => b.value.length - a.value.length)\n            .map(keyword => this.buildKeywordToken(keyword, terminalTokens, Boolean(options?.caseInsensitive)));\n    }\n\n    protected buildKeywordToken(keyword: Keyword, terminalTokens: TokenType[], caseInsensitive: boolean): TokenType {\n        const keywordPattern = this.buildKeywordPattern(keyword, caseInsensitive);\n        const tokenType: TokenType = {\n            name: keyword.value,\n            PATTERN: keywordPattern,\n            LONGER_ALT: this.findLongerAlt(keyword, terminalTokens)\n        };\n\n        if (typeof keywordPattern === 'function') {\n            tokenType.LINE_BREAKS = true;\n        }\n\n        return tokenType;\n    }\n\n    protected buildKeywordPattern(keyword: Keyword, caseInsensitive: boolean): TokenPattern {\n        return caseInsensitive ?\n            new RegExp(escapeRegExp(keyword.value), 'i') :\n            keyword.value;\n    }\n\n    protected findLongerAlt(keyword: Keyword, terminalTokens: TokenType[]): TokenType[] {\n        return terminalTokens.reduce((longerAlts: TokenType[], token) => {\n            const pattern = token?.PATTERN as RegExp;\n            if (pattern?.source && partialMatches('^' + pattern.source + '$', keyword.value)) {\n                longerAlts.push(token);\n            }\n            return longerAlts;\n        }, []);\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { AbstractElement, AbstractRule } from '../languages/generated/ast.js';\nimport type { CstNode } from '../syntax-tree.js';\nimport { isCrossReference, isRuleCall } from '../languages/generated/ast.js';\nimport { getCrossReferenceTerminal, getRuleType } from '../utils/grammar-utils.js';\n\n/**\n * Language-specific service for converting string values from the source text format into a value to be held in the AST.\n */\nexport interface ValueConverter {\n    /**\n     * Converts a string value from the source text format into a value to be held in the AST.\n     */\n    convert(input: string, cstNode: CstNode): ValueType;\n}\n\nexport type ValueType = string | number | boolean | bigint | Date;\n\nexport class DefaultValueConverter implements ValueConverter {\n\n    convert(input: string, cstNode: CstNode): ValueType {\n        let feature: AbstractElement | undefined = cstNode.grammarSource;\n        if (isCrossReference(feature)) {\n            feature = getCrossReferenceTerminal(feature);\n        }\n        if (isRuleCall(feature)) {\n            const rule = feature.rule.ref;\n            if (!rule) {\n                throw new Error('This cst node was not parsed by a rule.');\n            }\n            return this.runConverter(rule, input, cstNode);\n        }\n        return input;\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    protected runConverter(rule: AbstractRule, input: string, cstNode: CstNode): ValueType {\n        switch (rule.name.toUpperCase()) {\n            case 'INT': return ValueConverter.convertInt(input);\n            case 'STRING': return ValueConverter.convertString(input);\n            case 'ID': return ValueConverter.convertID(input);\n        }\n        switch (getRuleType(rule)?.toLowerCase()) {\n            case 'number': return ValueConverter.convertNumber(input);\n            case 'boolean': return ValueConverter.convertBoolean(input);\n            case 'bigint': return ValueConverter.convertBigint(input);\n            case 'date': return ValueConverter.convertDate(input);\n            default: return input;\n        }\n    }\n}\n\nexport namespace ValueConverter {\n\n    export function convertString(input: string): string {\n        let result = '';\n        for (let i = 1; i < input.length - 1; i++) {\n            const c = input.charAt(i);\n            if (c === '\\\\') {\n                const c1 = input.charAt(++i);\n                result += convertEscapeCharacter(c1);\n            } else {\n                result += c;\n            }\n        }\n        return result;\n    }\n\n    function convertEscapeCharacter(char: string): string {\n        switch (char) {\n            case 'b': return '\\b';\n            case 'f': return '\\f';\n            case 'n': return '\\n';\n            case 'r': return '\\r';\n            case 't': return '\\t';\n            case 'v': return '\\v';\n            case '0': return '\\0';\n            default: return char;\n        }\n    }\n\n    export function convertID(input: string): string {\n        if (input.charAt(0) === '^') {\n            return input.substring(1);\n        } else {\n            return input;\n        }\n    }\n\n    export function convertInt(input: string): number {\n        return parseInt(input);\n    }\n\n    export function convertBigint(input: string): bigint {\n        return BigInt(input);\n    }\n\n    export function convertDate(input: string): Date {\n        return new Date(input);\n    }\n\n    export function convertNumber(input: string): number {\n        return Number(input);\n    }\n\n    export function convertBoolean(input: string): boolean {\n        return input.toLowerCase() === 'true';\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2024 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nexport { CancellationToken, type AbstractCancellationTokenSource, CancellationTokenSource } from 'vscode-languageserver-protocol';\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { CancellationToken, CancellationTokenSource, type AbstractCancellationTokenSource } from '../utils/cancellation.js';\n\nexport type MaybePromise<T> = T | Promise<T>\n\n/**\n * Delays the execution of the current code to the next tick of the event loop.\n * Don't call this method directly in a tight loop to prevent too many promises from being created.\n */\nexport function delayNextTick(): Promise<void> {\n    return new Promise(resolve => {\n        // In case we are running in a non-node environment, `setImmediate` isn't available.\n        // Using `setTimeout` of the browser API accomplishes the same result.\n        if (typeof setImmediate === 'undefined') {\n            setTimeout(resolve, 0);\n        } else {\n            setImmediate(resolve);\n        }\n    });\n}\n\nlet lastTick = 0;\nlet globalInterruptionPeriod = 10;\n\n/**\n * Reset the global interruption period and create a cancellation token source.\n */\nexport function startCancelableOperation(): AbstractCancellationTokenSource {\n    lastTick = performance.now();\n    return new CancellationTokenSource();\n}\n\n/**\n * Change the period duration for `interruptAndCheck` to the given number of milliseconds.\n * The default value is 10ms.\n */\nexport function setInterruptionPeriod(period: number): void {\n    globalInterruptionPeriod = period;\n}\n\n/**\n * This symbol may be thrown in an asynchronous context by any Langium service that receives\n * a `CancellationToken`. This means that the promise returned by such a service is rejected with\n * this symbol as rejection reason.\n */\nexport const OperationCancelled = Symbol('OperationCancelled');\n\n/**\n * Use this in a `catch` block to check whether the thrown object indicates that the operation\n * has been cancelled.\n */\nexport function isOperationCancelled(err: unknown): err is typeof OperationCancelled {\n    return err === OperationCancelled;\n}\n\n/**\n * This function does two things:\n *  1. Check the elapsed time since the last call to this function or to `startCancelableOperation`. If the predefined\n *     period (configured with `setInterruptionPeriod`) is exceeded, execution is delayed with `delayNextTick`.\n *  2. If the predefined period is not met yet or execution is resumed after an interruption, the given cancellation\n *     token is checked, and if cancellation is requested, `OperationCanceled` is thrown.\n *\n * All services in Langium that receive a `CancellationToken` may potentially call this function, so the\n * `CancellationToken` must be caught (with an `async` try-catch block or a `catch` callback attached to\n * the promise) to avoid that event being exposed as an error.\n */\nexport async function interruptAndCheck(token: CancellationToken): Promise<void> {\n    if (token === CancellationToken.None) {\n        // Early exit in case cancellation was disabled by the caller\n        return;\n    }\n    const current = performance.now();\n    if (current - lastTick >= globalInterruptionPeriod) {\n        lastTick = current;\n        await delayNextTick();\n        // prevent calling delayNextTick every iteration of loop\n        // where delayNextTick takes up the majority or all of the\n        // globalInterruptionPeriod itself\n        lastTick = performance.now();\n    }\n    if (token.isCancellationRequested) {\n        throw OperationCancelled;\n    }\n}\n\n/**\n * Simple implementation of the deferred pattern.\n * An object that exposes a promise and functions to resolve and reject it.\n */\nexport class Deferred<T = void> {\n    resolve: (value: T) => this;\n    reject: (err?: unknown) => this;\n\n    promise = new Promise<T>((resolve, reject) => {\n        this.resolve = (arg) => {\n            resolve(arg);\n            return this;\n        };\n        this.reject = (err) => {\n            reject(err);\n            return this;\n        };\n    });\n}\n", "/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\n'use strict';\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 (const 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        const 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            const 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        const line = low - 1;\n        offset = this.ensureBeforeEOL(offset, lineOffsets[line]);\n        return { line, character: offset - lineOffsets[line] };\n    }\n    offsetAt(position) {\n        const 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        const lineOffset = lineOffsets[position.line];\n        if (position.character <= 0) {\n            return lineOffset;\n        }\n        const nextLineOffset = (position.line + 1 < lineOffsets.length) ? lineOffsets[position.line + 1] : this._content.length;\n        const offset = Math.min(lineOffset + position.character, nextLineOffset);\n        return this.ensureBeforeEOL(offset, lineOffset);\n    }\n    getLineRange(line) {\n        const lineOffsets = this.getLineOffsets();\n        if (line >= lineOffsets.length) {\n            const lastLine = lineOffsets.length - 1;\n            return { start: { line: lastLine, character: 0 }, end: { line: lastLine, character: this._content.length - lineOffsets[lastLine] } };\n        }\n        else if (line < 0) {\n            return { start: { line: 0, character: 0 }, end: { line: 0, character: 0 } };\n        }\n        const startOffset = lineOffsets[line];\n        const nextLineOffset = (line + 1 < lineOffsets.length) ? lineOffsets[line + 1] : this._content.length;\n        const endOffset = this.ensureBeforeEOL(nextLineOffset, startOffset);\n        return { start: { line, character: 0 }, end: { line, character: endOffset - startOffset } };\n    }\n    getEOLCharacters(line) {\n        const lineOffsets = this.getLineOffsets();\n        if (line >= lineOffsets.length) {\n            return '';\n        }\n        else if (line < 0) {\n            return '';\n        }\n        const nextLineOffset = (line + 1 < lineOffsets.length) ? lineOffsets[line + 1] : this._content.length;\n        const eolOffset = this.ensureBeforeEOL(nextLineOffset, lineOffsets[line]);\n        return this._content.substring(eolOffset, nextLineOffset);\n    }\n    ensureBeforeEOL(offset, lineOffset) {\n        while (offset > lineOffset && isEOL(this._content.charCodeAt(offset - 1))) {\n            offset--;\n        }\n        return offset;\n    }\n    get lineCount() {\n        return this.getLineOffsets().length;\n    }\n    static isIncremental(event) {\n        const 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        const candidate = event;\n        return candidate !== undefined && candidate !== null &&\n            typeof candidate.text === 'string' && candidate.range === undefined && candidate.rangeLength === undefined;\n    }\n}\nexport var 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        const text = document.getText();\n        const sortedEdits = mergeSort(edits.map(getWellformedEdit), (a, b) => {\n            const 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            const 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        const 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        const ch = text.charCodeAt(i);\n        if (isEOL(ch)) {\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 isEOL(char) {\n    return char === 13 /* CharCode.CarriageReturn */ || char === 10 /* CharCode.LineFeed */;\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", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\n/**\n * Re-export 'TextDocument' from 'vscode-languageserver-textdocument' for convenience,\n *  including both type _and_ symbol (namespace), as we here and there also refer to the symbol,\n *  the overhead is very small, just a few kilobytes.\n * Everything else of that package (at the time contributing) is also defined\n *  in 'vscode-languageserver-protocol' or 'vscode-languageserver-types'.\n */\nexport { TextDocument } from 'vscode-languageserver-textdocument';\n\nimport type { Diagnostic, Range } from 'vscode-languageserver-types';\nimport type { FileSystemProvider } from './file-system-provider.js';\nimport type { ParseResult, ParserOptions } from '../parser/langium-parser.js';\nimport type { ServiceRegistry } from '../service-registry.js';\nimport type { LangiumSharedCoreServices } from '../services.js';\nimport type { AstNode, AstNodeDescription, MultiReference, Mutable, Reference } from '../syntax-tree.js';\nimport type { Stream } from '../utils/stream.js';\nimport { TextDocument } from './documents.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { stream } from '../utils/stream.js';\nimport { URI, UriTrie } from '../utils/uri-utils.js';\nimport type { DocumentBuilder } from './document-builder.js';\n\n/**\n * A Langium document holds the parse result (AST and CST) and any additional state that is derived\n * from the AST, e.g. the result of scope precomputation.\n */\nexport interface LangiumDocument<T extends AstNode = AstNode> {\n    /** The Uniform Resource Identifier (URI) of the document */\n    readonly uri: URI;\n    /** The text document used to convert between offsets and positions */\n    readonly textDocument: TextDocument;\n    /** The current state of the document */\n    state: DocumentState;\n    /** The parse result holds the Abstract Syntax Tree (AST) and potentially also parser / lexer errors */\n    parseResult: ParseResult<T>;\n    /** Result of the scope precomputation phase */\n    localSymbols?: LocalSymbols;\n    /** An array of all cross-references found in the AST while linking */\n    references: Array<Reference | MultiReference>;\n    /** Result of the validation phase */\n    diagnostics?: Diagnostic[]\n}\n\n/**\n * A document is subject to several phases that are run in predefined order. Any state value implies that\n * smaller state values are finished as well.\n */\nexport enum DocumentState {\n    /**\n     * The text content has changed and needs to be parsed again. The AST held by this outdated\n     * document instance is no longer valid.\n     */\n    Changed = 0,\n    /**\n     * An AST has been created from the text content. The document structure can be traversed,\n     * but cross-references cannot be resolved yet. If necessary, the structure can be manipulated\n     * at this stage as a preprocessing step.\n     */\n    Parsed = 1,\n    /**\n     * The `IndexManager` service has processed AST nodes of this document. This means the\n     * exported symbols are available in the global scope and can be resolved from other documents.\n     */\n    IndexedContent = 2,\n    /**\n     * The `ScopeComputation` service has processed this document. This means the document's locally accessible\n     * symbols are captured in a `DocumentSymbols` table and can be looked up by the `ScopeProvider` service.\n     * Once a document has reached this state, you may follow every reference - it will lazily\n     * resolve its `ref` property and yield either the target AST node or `undefined` in case\n     * the target is not in scope.\n     */\n    ComputedScopes = 3,\n    /**\n     * The `Linker` service has processed this document. All outgoing references have been\n     * resolved or marked as erroneous.\n     */\n    Linked = 4,\n    /**\n     * The `IndexManager` service has processed AST node references of this document. This is\n     * necessary to determine which documents are affected by a change in one of the workspace\n     * documents.\n     */\n    IndexedReferences = 5,\n    /**\n     * The `DocumentValidator` service has processed this document. The language server listens\n     * to the results of this phase and sends diagnostics to the client.\n     */\n    Validated = 6\n}\n\n/**\n * Result of the scope pre-computation phase performed by the `ScopeComputation` service.\n * It maps AST nodes of a document to their corresponding sets of symbols that are accessible\n * by those nodes/subtrees, provided any symbols corresponding specifically to those nodes/subtrees exist.\n * The sets of symbols are assumed to be un-ordered. Hence, no assumptions about the order of\n * symbols in the sets should be made. The default `ScopeComputation` implementation uses an\n * instance of `MultiMap<AstNode, AstNodeDescription>`, which conforms to this interface.\n */\nexport interface LocalSymbols {\n    has(node: AstNode): boolean\n    getStream(key: AstNode): Stream<AstNodeDescription>\n}\n\nexport interface DocumentSegment {\n    readonly range: Range\n    readonly offset: number\n    readonly length: number\n    readonly end: number\n}\n\n/**\n * Surrogate definition of the `TextDocuments` interface from the `vscode-languageserver` package.\n * No implementation object is expected to be offered by `LangiumCoreServices`, but only by `LangiumLSPServices`.\n */\nexport type TextDocumentProvider = {\n    get(uri: string | URI): TextDocument | undefined\n}\n\n/**\n * Shared service for creating `LangiumDocument` instances.\n *\n * Register a custom implementation if special (additional) behavior is required for your language(s).\n * Note: If you specialize {@link fromString} or {@link fromTextDocument} you probably might want to\n * specialize {@link update}, too!\n */\nexport interface LangiumDocumentFactory {\n    /**\n     * Create a Langium document from a `TextDocument` (usually associated with a file).\n     */\n    fromTextDocument<T extends AstNode = AstNode>(textDocument: TextDocument, uri?: URI, options?: ParserOptions): LangiumDocument<T>;\n    /**\n     * Create a Langium document from a `TextDocument` asynchronously. This action can be cancelled if a cancellable parser implementation has been provided.\n     */\n    fromTextDocument<T extends AstNode = AstNode>(textDocument: TextDocument, uri: URI | undefined, cancellationToken: CancellationToken): Promise<LangiumDocument<T>>;\n\n    /**\n     * Create an Langium document from an in-memory string.\n     */\n    fromString<T extends AstNode = AstNode>(text: string, uri: URI, options?: ParserOptions): LangiumDocument<T>;\n    /**\n     * Create a Langium document from an in-memory string asynchronously. This action can be cancelled if a cancellable parser implementation has been provided.\n     */\n    fromString<T extends AstNode = AstNode>(text: string, uri: URI, cancellationToken: CancellationToken): Promise<LangiumDocument<T>>;\n\n    /**\n     * Create an Langium document from a model that has been constructed in memory.\n     */\n    fromModel<T extends AstNode = AstNode>(model: T, uri: URI): LangiumDocument<T>;\n\n    /**\n     * Create an Langium document from a specified `URI`. The factory will use the `FileSystemAccess` service to read the file.\n     */\n    fromUri<T extends AstNode = AstNode>(uri: URI, cancellationToken?: CancellationToken): Promise<LangiumDocument<T>>;\n\n    /**\n     * Update the given document after changes in the corresponding textual representation.\n     * Method is called by the document builder after it has been requested to build an existing\n     * document and the document's state is {@link DocumentState.Changed}.\n     * The text parsing is expected to be done the same way as in {@link fromTextDocument}\n     * and {@link fromString}.\n     */\n    update<T extends AstNode = AstNode>(document: LangiumDocument<T>, cancellationToken: CancellationToken): Promise<LangiumDocument<T>>\n}\n\nexport class DefaultLangiumDocumentFactory implements LangiumDocumentFactory {\n\n    protected readonly serviceRegistry: ServiceRegistry;\n    protected readonly textDocuments?: TextDocumentProvider;\n    protected readonly fileSystemProvider: FileSystemProvider;\n\n    constructor(services: LangiumSharedCoreServices) {\n        this.serviceRegistry = services.ServiceRegistry;\n        this.textDocuments = services.workspace.TextDocuments;\n        this.fileSystemProvider = services.workspace.FileSystemProvider;\n    }\n\n    async fromUri<T extends AstNode = AstNode>(uri: URI, cancellationToken = CancellationToken.None): Promise<LangiumDocument<T>> {\n        const content = await this.fileSystemProvider.readFile(uri);\n        return this.createAsync<T>(uri, content, cancellationToken);\n    }\n\n    fromTextDocument<T extends AstNode = AstNode>(textDocument: TextDocument, uri?: URI, options?: ParserOptions): LangiumDocument<T>;\n    fromTextDocument<T extends AstNode = AstNode>(textDocument: TextDocument, uri: URI | undefined, cancellationToken: CancellationToken): Promise<LangiumDocument<T>>;\n    fromTextDocument<T extends AstNode = AstNode>(textDocument: TextDocument, uri?: URI, token?: CancellationToken | ParserOptions): LangiumDocument<T> | Promise<LangiumDocument<T>> {\n        uri = uri ?? URI.parse(textDocument.uri);\n        if (CancellationToken.is(token)) {\n            return this.createAsync<T>(uri, textDocument, token);\n        } else {\n            return this.create<T>(uri, textDocument, token);\n        }\n    }\n\n    fromString<T extends AstNode = AstNode>(text: string, uri: URI, options?: ParserOptions): LangiumDocument<T>;\n    fromString<T extends AstNode = AstNode>(text: string, uri: URI, cancellationToken: CancellationToken): Promise<LangiumDocument<T>>;\n    fromString<T extends AstNode = AstNode>(text: string, uri: URI, token?: CancellationToken | ParserOptions): LangiumDocument<T> | Promise<LangiumDocument<T>> {\n        if (CancellationToken.is(token)) {\n            return this.createAsync<T>(uri, text, token);\n        } else {\n            return this.create<T>(uri, text, token);\n        }\n    }\n\n    fromModel<T extends AstNode = AstNode>(model: T, uri: URI): LangiumDocument<T> {\n        return this.create<T>(uri, { $model: model });\n    }\n\n    protected create<T extends AstNode = AstNode>(uri: URI, content: string | TextDocument | { $model: T }, options?: ParserOptions): LangiumDocument<T> {\n        if (typeof content === 'string') {\n            const parseResult = this.parse<T>(uri, content, options);\n            return this.createLangiumDocument<T>(parseResult, uri, undefined, content);\n\n        } else if ('$model' in content) {\n            const parseResult = { value: content.$model, parserErrors: [], lexerErrors: [] };\n            return this.createLangiumDocument<T>(parseResult, uri);\n\n        } else {\n            const parseResult = this.parse<T>(uri, content.getText(), options);\n            return this.createLangiumDocument(parseResult, uri, content);\n        }\n    }\n\n    protected async createAsync<T extends AstNode = AstNode>(uri: URI, content: string | TextDocument, cancelToken: CancellationToken): Promise<LangiumDocument<T>> {\n        if (typeof content === 'string') {\n            const parseResult = await this.parseAsync<T>(uri, content, cancelToken);\n            return this.createLangiumDocument<T>(parseResult, uri, undefined, content);\n        } else {\n            const parseResult = await this.parseAsync<T>(uri, content.getText(), cancelToken);\n            return this.createLangiumDocument(parseResult, uri, content);\n        }\n    }\n\n    /**\n     * Create a LangiumDocument from a given parse result.\n     *\n     * A TextDocument is created on demand if it is not provided as argument here. Usually this\n     * should not be necessary because the main purpose of the TextDocument is to convert between\n     * text ranges and offsets, which is done solely in LSP request handling.\n     *\n     * With the introduction of {@link update} below this method is supposed to be mainly called\n     * during workspace initialization and on addition/recognition of new files, while changes in\n     * existing documents are processed via {@link update}.\n     */\n    protected createLangiumDocument<T extends AstNode = AstNode>(parseResult: ParseResult<T>, uri: URI, textDocument?: TextDocument, text?: string): LangiumDocument<T> {\n        let document: LangiumDocument<T>;\n        if (textDocument) {\n            document = {\n                parseResult,\n                uri,\n                state: DocumentState.Parsed,\n                references: [],\n                textDocument\n            };\n        } else {\n            const textDocumentGetter = this.createTextDocumentGetter(uri, text);\n            document = {\n                parseResult,\n                uri,\n                state: DocumentState.Parsed,\n                references: [],\n                get textDocument() {\n                    return textDocumentGetter();\n                }\n            };\n        }\n        (parseResult.value as Mutable<AstNode>).$document = document;\n        return document;\n    }\n\n    async update<T extends AstNode = AstNode>(document: Mutable<LangiumDocument<T>>, cancellationToken: CancellationToken): Promise<LangiumDocument<T>> {\n        // The CST full text property contains the original text that was used to create the AST.\n        const oldText = document.parseResult.value.$cstNode?.root.fullText;\n        const textDocument = this.textDocuments?.get(document.uri.toString());\n        const text = textDocument ? textDocument.getText() : await this.fileSystemProvider.readFile(document.uri);\n\n        if (textDocument) {\n            Object.defineProperty(\n                document,\n                'textDocument',\n                {\n                    value: textDocument\n                }\n            );\n        } else {\n            const textDocumentGetter = this.createTextDocumentGetter(document.uri, text);\n            Object.defineProperty(\n                document,\n                'textDocument',\n                {\n                    get: textDocumentGetter\n                }\n            );\n        }\n\n        // Some of these documents can be pretty large, so parsing them again can be quite expensive.\n        // Therefore, we only parse if the text has actually changed.\n        if (oldText !== text) {\n            document.parseResult = await this.parseAsync(document.uri, text, cancellationToken);\n            (document.parseResult.value as Mutable<AstNode>).$document = document;\n        }\n        document.state = DocumentState.Parsed;\n        return document;\n    }\n\n    protected parse<T extends AstNode>(uri: URI, text: string, options?: ParserOptions): ParseResult<T> {\n        const services = this.serviceRegistry.getServices(uri);\n        return services.parser.LangiumParser.parse<T>(text, options);\n    }\n\n    protected parseAsync<T extends AstNode>(uri: URI, text: string, cancellationToken: CancellationToken): Promise<ParseResult<T>> {\n        const services = this.serviceRegistry.getServices(uri);\n        return services.parser.AsyncParser.parse<T>(text, cancellationToken);\n    }\n\n    protected createTextDocumentGetter(uri: URI, text?: string): () => TextDocument {\n        const serviceRegistry = this.serviceRegistry;\n        let textDoc: TextDocument | undefined = undefined;\n        return () => {\n            return textDoc ??= TextDocument.create(\n                uri.toString(), serviceRegistry.getServices(uri).LanguageMetaData.languageId, 0, text ?? ''\n            );\n        };\n    }\n}\n\n/**\n * Shared service for managing Langium documents.\n */\nexport interface LangiumDocuments {\n\n    /**\n     * A stream of all documents managed under this service.\n     */\n    readonly all: Stream<LangiumDocument>\n\n    /**\n     * Manage a new document under this service.\n     * @throws an error if a document with the same URI is already present.\n     */\n    addDocument(document: LangiumDocument): void;\n\n    /**\n     * Retrieve the document with the given URI, if present. Otherwise returns `undefined`.\n     */\n    getDocument(uri: URI): LangiumDocument | undefined;\n\n    /**\n     * If the given URI is a directory, all documents within this directory are retrieved.\n     * If it is a file, just that single document is retrieved.\n     */\n    getDocuments(folder: URI): LangiumDocument[];\n\n    /**\n     * Retrieve the document with the given URI. If not present, a new one will be created using the file system access.\n     * The new document will be added to the list of documents managed under this service.\n     */\n    getOrCreateDocument(uri: URI, cancellationToken?: CancellationToken): Promise<LangiumDocument>;\n\n    /**\n     * Creates a new document with the given URI and text content.\n     * The new document is automatically added to this service and can be retrieved using {@link getDocument}.\n     *\n     * @throws an error if a document with the same URI is already present.\n     */\n    createDocument(uri: URI, text: string): LangiumDocument;\n\n    /**\n     * Creates a new document with the given URI and text content asynchronously.\n     * The process can be interrupted with a cancellation token.\n     * The new document is automatically added to this service and can be retrieved using {@link getDocument}.\n     *\n     * @throws an error if a document with the same URI is already present.\n     */\n    createDocument(uri: URI, text: string, cancellationToken: CancellationToken): Promise<LangiumDocument>;\n\n    /**\n     * Flag the document with the given URI as `Changed`, if present, meaning that its content\n     * is no longer valid. The content (parseResult) stays untouched, while internal data may\n     * be dropped to reduce memory footprint.\n     *\n     * @returns the affected {@link LangiumDocument} if existing for convenience\n     *\n     * @deprecated Since 4.2 use `DocumentBuilder.resetToState(DocumentState.Changed)` instead\n     */\n    invalidateDocument(uri: URI): LangiumDocument | undefined;\n\n    /**\n     * Returns `true` if a document with the given URI is managed under this service.\n     */\n    hasDocument(uri: URI): boolean;\n\n    /**\n     * Remove the document with the given URI, if present, and mark it as `Changed`, meaning\n     * that its content is no longer valid. The next call to `getOrCreateDocument` with the same\n     * URI will create a new document instance.\n     *\n     * @returns the affected {@link LangiumDocument} if existing for convenience\n     */\n    deleteDocument(uri: URI): LangiumDocument | undefined;\n    /**\n     * If the given URI is a directory, remove all documents within this directory.\n     * If it is a file, just remove that single document from the documents.\n     *\n     * @returns the affected {@link LangiumDocument}s if existing for convenience\n     */\n    deleteDocuments(uri: URI): LangiumDocument[];\n}\n\nexport class DefaultLangiumDocuments implements LangiumDocuments {\n\n    protected readonly services: LangiumSharedCoreServices;\n    protected readonly langiumDocumentFactory: LangiumDocumentFactory;\n    private documentBuilder: () => DocumentBuilder;\n\n    protected readonly documentTrie = new UriTrie<LangiumDocument>();\n\n    constructor(services: LangiumSharedCoreServices) {\n        this.services = services;\n        this.langiumDocumentFactory = services.workspace.LangiumDocumentFactory;\n        this.documentBuilder = () => services.workspace.DocumentBuilder;\n    }\n\n    get all(): Stream<LangiumDocument> {\n        return stream(this.documentTrie.all());\n    }\n\n    addDocument(document: LangiumDocument): void {\n        const uriString = document.uri.toString();\n        if (this.documentTrie.has(uriString)) {\n            throw new Error(`A document with the URI '${uriString}' is already present.`);\n        }\n        this.documentTrie.insert(uriString, document);\n    }\n\n    getDocument(uri: URI): LangiumDocument | undefined {\n        const uriString = uri.toString();\n        return this.documentTrie.find(uriString);\n    }\n\n    getDocuments(folder: URI): LangiumDocument[] {\n        const uriString = folder.toString();\n        return this.documentTrie.findAll(uriString);\n    }\n\n    async getOrCreateDocument(uri: URI, cancellationToken?: CancellationToken): Promise<LangiumDocument> {\n        let document = this.getDocument(uri);\n        if (document) {\n            return document;\n        }\n        document = await this.langiumDocumentFactory.fromUri(uri, cancellationToken);\n        this.addDocument(document);\n        return document;\n    }\n\n    createDocument(uri: URI, text: string): LangiumDocument;\n    createDocument(uri: URI, text: string, cancellationToken: CancellationToken): Promise<LangiumDocument>;\n    createDocument(uri: URI, text: string, cancellationToken?: CancellationToken): LangiumDocument | Promise<LangiumDocument> {\n        if (cancellationToken) {\n            return this.langiumDocumentFactory.fromString(text, uri, cancellationToken).then(document => {\n                this.addDocument(document);\n                return document;\n            });\n        } else {\n            const document = this.langiumDocumentFactory.fromString(text, uri);\n            this.addDocument(document);\n            return document;\n        }\n    }\n\n    hasDocument(uri: URI): boolean {\n        return this.documentTrie.has(uri.toString());\n    }\n\n    /**\n     * @deprecated Since 4.2 use `DocumentBuilder.resetToState(DocumentState.Changed)` instead\n     * TODO remove this for the next major release\n     */\n    invalidateDocument(uri: URI): LangiumDocument | undefined {\n        const uriString = uri.toString();\n        const langiumDoc = this.documentTrie.find(uriString);\n        if (langiumDoc) {\n            this.documentBuilder().resetToState(langiumDoc, DocumentState.Changed);\n        }\n        return langiumDoc;\n    }\n\n    deleteDocument(uri: URI): LangiumDocument | undefined {\n        const uriString = uri.toString();\n        const langiumDoc = this.documentTrie.find(uriString);\n        if (langiumDoc) {\n            langiumDoc.state = DocumentState.Changed;\n            this.documentTrie.delete(uriString);\n        }\n        return langiumDoc;\n    }\n\n    deleteDocuments(folder: URI): LangiumDocument[] {\n        const uriString = folder.toString();\n        const langiumDocs = this.documentTrie.findAll(uriString);\n        for (const langiumDoc of langiumDocs) {\n            langiumDoc.state = DocumentState.Changed;\n        }\n        this.documentTrie.delete(uriString);\n        return langiumDocs;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, AstNodeDescription, AstReflection, CstNode, LinkingError, MultiReference, MultiReferenceItem, Reference, ReferenceInfo } from '../syntax-tree.js';\nimport type { AstNodeLocator } from '../workspace/ast-node-locator.js';\nimport type { LangiumDocument, LangiumDocuments } from '../workspace/documents.js';\nimport type { ScopeProvider } from './scope-provider.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { isAstNode, isAstNodeDescription, isLinkingError } from '../syntax-tree.js';\nimport { findRootNode, streamAst, streamReferences } from '../utils/ast-utils.js';\nimport { interruptAndCheck } from '../utils/promise-utils.js';\nimport { DocumentState } from '../workspace/documents.js';\nimport type { LangiumProfiler } from '../workspace/profiler.js';\n\n/**\n * Language-specific service for resolving cross-references in the AST.\n */\nexport interface Linker {\n\n    /**\n     * Links all cross-references within the specified document. The default implementation loads only target\n     * elements from documents that are present in the `LangiumDocuments` service. The linked references are\n     * stored in the document's `references` property.\n     *\n     * @param document A LangiumDocument that shall be linked.\n     * @param cancelToken A token for cancelling the operation.\n     *\n     * @throws `OperationCancelled` if a cancellation event is detected\n     */\n    link(document: LangiumDocument, cancelToken?: CancellationToken): Promise<void>;\n\n    /**\n     * Unlinks all references within the specified document and removes them from the list of `references`.\n     *\n     * @param document A LangiumDocument that shall be unlinked.\n     */\n    unlink(document: LangiumDocument): void;\n\n    /**\n     * Determines a candidate AST node description for linking the given reference.\n     *\n     * @param refInfo Information about the reference.\n     */\n    getCandidate(refInfo: ReferenceInfo): AstNodeDescription | LinkingError;\n\n    /**\n     * Determines a candidate AST node description for linking the given reference.\n     *\n     * @param node The AST node containing the reference.\n     * @param refId The reference identifier used to build a scope.\n     * @param reference The actual reference to resolve.\n     */\n    getCandidates(refInfo: ReferenceInfo): AstNodeDescription[] | LinkingError;\n\n    /**\n     * Creates a cross reference node being aware of its containing AstNode, the corresponding CstNode,\n     * the cross reference text denoting the target AstNode being already extracted of the document text,\n     * as well as the unique cross reference identifier.\n     *\n     * Default behavior:\n     *  - The returned Reference's 'ref' property pointing to the target AstNode is populated lazily on its\n     *    first visit.\n     *  - If the target AstNode cannot be resolved on the first visit, an error indicator will be installed\n     *    and further resolution attempts will *not* be performed.\n     *\n     * @param node The containing AST node\n     * @param property The AST node property being referenced\n     * @param refNode The corresponding CST node\n     * @param refText The cross reference text denoting the target AstNode\n     * @returns the desired Reference node, whose behavior wrt. resolving the cross reference is implementation specific.\n     */\n    buildReference(node: AstNode, property: string, refNode: CstNode | undefined, refText: string): Reference;\n\n    buildMultiReference(node: AstNode, property: string, refNode: CstNode | undefined, refText: string): MultiReference;\n\n}\n\nexport const RefResolving = Symbol('RefResolving');\n\nexport interface DefaultReference extends Reference {\n    _ref?: AstNode | LinkingError | typeof RefResolving;\n    _nodeDescription?: AstNodeDescription;\n}\n\nexport interface DefaultMultiReference extends MultiReference {\n    _items: MultiReferenceItem[] | typeof RefResolving | undefined;\n    _linkingError?: LinkingError;\n}\n\ninterface ReferenceResolver {\n    resolveReference(reference: DefaultReference, node: AstNode, property: string): AstNode | undefined;\n    resolveMultiReference(reference: DefaultMultiReference, node: AstNode, property: string): MultiReferenceItem[];\n}\n\nclass DefaultReferenceImpl implements DefaultReference {\n    readonly $refNode: CstNode | undefined;\n    readonly $refText: string;\n    _ref: AstNode | LinkingError | typeof RefResolving | undefined = undefined;\n    _nodeDescription?: AstNodeDescription;\n\n    constructor(\n        private readonly resolver: ReferenceResolver,\n        private readonly node: AstNode,\n        private readonly property: string,\n        refNode: CstNode | undefined,\n        refText: string\n    ) {\n        this.$refNode = refNode;\n        this.$refText = refText;\n    }\n\n    get ref(): AstNode | undefined {\n        return this.resolver.resolveReference(this, this.node, this.property);\n    }\n\n    get $nodeDescription(): AstNodeDescription | undefined {\n        return this._nodeDescription;\n    }\n\n    get error(): LinkingError | undefined {\n        return isLinkingError(this._ref) ? this._ref : undefined;\n    }\n}\n\nclass DefaultMultiReferenceImpl implements DefaultMultiReference {\n    readonly $refNode: CstNode | undefined;\n    readonly $refText: string;\n    _items: MultiReferenceItem[] | typeof RefResolving | undefined = undefined;\n    _linkingError?: LinkingError;\n\n    constructor(\n        private readonly resolver: ReferenceResolver,\n        private readonly node: AstNode,\n        private readonly property: string,\n        refNode: CstNode | undefined,\n        refText: string\n    ) {\n        this.$refNode = refNode;\n        this.$refText = refText;\n    }\n\n    get items(): MultiReferenceItem[] {\n        return this.resolver.resolveMultiReference(this, this.node, this.property);\n    }\n\n    get error(): LinkingError | undefined {\n        return this._linkingError;\n    }\n}\n\nexport class DefaultLinker implements Linker {\n    protected readonly reflection: AstReflection;\n    protected readonly scopeProvider: ScopeProvider;\n    protected readonly astNodeLocator: AstNodeLocator;\n    protected readonly langiumDocuments: () => LangiumDocuments;\n    protected readonly profiler: LangiumProfiler | undefined;\n    protected readonly languageId: string;\n    protected readonly referenceResolver: ReferenceResolver;\n\n    constructor(services: LangiumCoreServices) {\n        this.reflection = services.shared.AstReflection;\n        this.langiumDocuments = () => services.shared.workspace.LangiumDocuments;\n        this.scopeProvider = services.references.ScopeProvider;\n        this.astNodeLocator = services.workspace.AstNodeLocator;\n        this.profiler = services.shared.profilers.LangiumProfiler;\n        this.languageId = services.LanguageMetaData.languageId;\n        this.referenceResolver = {\n            resolveReference: this.resolveReference.bind(this),\n            resolveMultiReference: this.resolveMultiReference.bind(this)\n        };\n    }\n\n    async link(document: LangiumDocument, cancelToken = CancellationToken.None): Promise<void> {\n        if (this.profiler?.isActive('linking')) {\n            const task = this.profiler.createTask('linking', this.languageId);\n            task.start();\n            try {\n                for (const node of streamAst(document.parseResult.value)) {\n                    await interruptAndCheck(cancelToken);\n                    streamReferences(node).forEach(ref => {\n                        const name = `${node.$type}:${ref.property}`;\n                        task.startSubTask(name);\n                        try {\n                            this.doLink(ref, document);\n                        } finally {\n                            task.stopSubTask(name);\n                        }\n                    });\n                }\n            } finally {\n                task.stop();\n            }\n        }\n        else {\n            for (const node of streamAst(document.parseResult.value)) {\n                await interruptAndCheck(cancelToken);\n                streamReferences(node).forEach(ref => this.doLink(ref, document));\n            }\n        }\n    }\n\n    protected doLink(refInfo: ReferenceInfo, document: LangiumDocument): void {\n        const ref = refInfo.reference as DefaultReference | DefaultMultiReference;\n        // The reference may already have been resolved lazily by accessing its `ref` property.\n        if ('_ref' in ref && ref._ref === undefined) {\n            ref._ref = RefResolving;\n            try {\n                const description = this.getCandidate(refInfo);\n                if (isLinkingError(description)) {\n                    ref._ref = description;\n                } else {\n                    ref._nodeDescription = description;\n                    const linkedNode = this.loadAstNode(description);\n                    ref._ref = linkedNode ?? this.createLinkingError(refInfo, description);\n                }\n            } catch (err) {\n                console.error(`An error occurred while resolving reference to '${ref.$refText}':`, err);\n                const errorMessage = (err as Error).message ?? String(err);\n                ref._ref = {\n                    info: refInfo,\n                    message: `An error occurred while resolving reference to '${ref.$refText}': ${errorMessage}`\n                };\n            }\n            document.references.push(ref);\n        } else if ('_items' in ref && ref._items === undefined) {\n            ref._items = RefResolving;\n            try {\n                const descriptions = this.getCandidates(refInfo);\n                const items: MultiReferenceItem[] = [];\n                if (isLinkingError(descriptions)) {\n                    ref._linkingError = descriptions;\n                } else {\n                    for (const description of descriptions) {\n                        const linkedNode = this.loadAstNode(description);\n                        if (linkedNode) {\n                            items.push({ ref: linkedNode, $nodeDescription: description });\n                        }\n                    }\n                }\n                ref._items = items;\n            } catch (err) {\n                ref._linkingError = {\n                    info: refInfo,\n                    message: `An error occurred while resolving reference to '${ref.$refText}': ${err}`\n                };\n                ref._items = [];\n            }\n            document.references.push(ref);\n        }\n    }\n\n    unlink(document: LangiumDocument): void {\n        for (const ref of document.references) {\n            if ('_ref' in ref) {\n                (ref as DefaultReference)._ref = undefined;\n                delete (ref as DefaultReference)._nodeDescription;\n            } else if ('_items' in ref) {\n                (ref as DefaultMultiReference)._items = undefined;\n                delete (ref as DefaultMultiReference)._linkingError;\n            }\n        }\n        document.references = [];\n    }\n\n    getCandidate(refInfo: ReferenceInfo): AstNodeDescription | LinkingError {\n        const scope = this.scopeProvider.getScope(refInfo);\n        const description = scope.getElement(refInfo.reference.$refText);\n        return description ?? this.createLinkingError(refInfo);\n    }\n\n    getCandidates(refInfo: ReferenceInfo): AstNodeDescription[] | LinkingError {\n        const scope = this.scopeProvider.getScope(refInfo);\n        const descriptions = scope.getElements(refInfo.reference.$refText).distinct(desc => `${desc.documentUri}#${desc.path}`).toArray();\n        return descriptions.length > 0 ? descriptions : this.createLinkingError(refInfo);\n    }\n\n    buildReference(node: AstNode, property: string, refNode: CstNode | undefined, refText: string): Reference {\n        // See behavior description in doc of Linker, update that on changes in here.\n        return new DefaultReferenceImpl(this.referenceResolver, node, property, refNode, refText);\n    }\n\n    buildMultiReference(node: AstNode, property: string, refNode: CstNode | undefined, refText: string): MultiReference {\n        // See behavior description in doc of Linker, update that on changes in here.\n        return new DefaultMultiReferenceImpl(this.referenceResolver, node, property, refNode, refText);\n    }\n\n    protected resolveReference(reference: DefaultReference, node: AstNode, property: string): AstNode | undefined {\n        if (isAstNode(reference._ref)) {\n            // Most frequent case: the target is already resolved.\n            return reference._ref;\n        } else if (isAstNodeDescription(reference._nodeDescription)) {\n            // A candidate has been found before, but it is not loaded yet.\n            const linkedNode = this.loadAstNode(reference._nodeDescription);\n            reference._ref = linkedNode ??\n                this.createLinkingError({ reference, container: node, property }, reference._nodeDescription);\n        } else if (reference._ref === undefined) {\n            // The reference has not been linked yet, so do that now.\n            reference._ref = RefResolving;\n            const document = findRootNode(node).$document;\n            const refData = this.getLinkedNode({ reference, container: node, property });\n            if (refData.error && document && document.state < DocumentState.ComputedScopes) {\n                // Document scope is not ready, don't set `reference._ref` so linker can retry later.\n                return reference._ref = undefined;\n            }\n            reference._ref = refData.node ?? refData.error;\n            reference._nodeDescription = refData.descr;\n            document?.references.push(reference);\n        } else if (reference._ref === RefResolving) {\n            this.throwCyclicReferenceError(node, property, reference.$refText);\n        }\n        return isAstNode(reference._ref) ? reference._ref : undefined;\n    }\n\n    protected resolveMultiReference(reference: DefaultMultiReference, node: AstNode, property: string): MultiReferenceItem[] {\n        if (Array.isArray(reference._items)) {\n            return reference._items;\n        } else if (reference._items === undefined) {\n            reference._items = RefResolving;\n            const document = findRootNode(node).$document;\n            const descriptions = this.getCandidates({\n                reference,\n                container: node,\n                property\n            });\n            const items: MultiReferenceItem[] = [];\n            if (isLinkingError(descriptions)) {\n                reference._linkingError = descriptions;\n            } else {\n                for (const description of descriptions) {\n                    const linkedNode = this.loadAstNode(description);\n                    if (linkedNode) {\n                        items.push({ ref: linkedNode, $nodeDescription: description });\n                    }\n                }\n                if (items.length === 0) {\n                    reference._linkingError = this.createLinkingError({ reference, container: node, property });\n                }\n            }\n            reference._items = items;\n            document?.references.push(reference);\n        } else if (reference._items === RefResolving) {\n            this.throwCyclicReferenceError(node, property, reference.$refText);\n        }\n        return Array.isArray(reference._items) ? reference._items : [];\n    }\n\n    protected throwCyclicReferenceError(node: AstNode, property: string, refText: string): never {\n        throw new Error(`Cyclic reference resolution detected: ${this.astNodeLocator.getAstNodePath(node)}/${property} (symbol '${refText}')`);\n    }\n\n    protected getLinkedNode(refInfo: ReferenceInfo): { node?: AstNode, descr?: AstNodeDescription, error?: LinkingError } {\n        try {\n            const description = this.getCandidate(refInfo);\n            if (isLinkingError(description)) {\n                return { error: description };\n            }\n            const linkedNode = this.loadAstNode(description);\n            if (linkedNode) {\n                return { node: linkedNode, descr: description };\n            }\n            else {\n                return {\n                    descr: description,\n                    error:\n                        this.createLinkingError(refInfo, description)\n                };\n            }\n        } catch (err) {\n            console.error(`An error occurred while resolving reference to '${refInfo.reference.$refText}':`, err);\n            const errorMessage = (err as Error).message ?? String(err);\n            return {\n                error: {\n                    info: refInfo,\n                    message: `An error occurred while resolving reference to '${refInfo.reference.$refText}': ${errorMessage}`\n                }\n            };\n        }\n    }\n\n    protected loadAstNode(nodeDescription: AstNodeDescription): AstNode | undefined {\n        if (nodeDescription.node) {\n            return nodeDescription.node;\n        }\n        const doc = this.langiumDocuments().getDocument(nodeDescription.documentUri);\n        if (!doc) {\n            return undefined;\n        }\n        return this.astNodeLocator.getAstNode(doc.parseResult.value, nodeDescription.path);\n    }\n\n    protected createLinkingError(refInfo: ReferenceInfo, targetDescription?: AstNodeDescription): LinkingError {\n        // Check whether the document is sufficiently processed by the DocumentBuilder. If not, this is a hint for a bug\n        // in the language implementation.\n        const document = findRootNode(refInfo.container).$document;\n        if (document && document.state < DocumentState.ComputedScopes) {\n            console.warn(`Attempted reference resolution before document reached ComputedScopes state (${document.uri}).`);\n        }\n        const referenceType = this.reflection.getReferenceType(refInfo);\n        return {\n            info: refInfo,\n            message: `Could not resolve reference to ${referenceType} named '${refInfo.reference.$refText}'.`,\n            targetDescription\n        };\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { AstNode, CstNode } from '../syntax-tree.js';\nimport { findNodeForProperty } from '../utils/grammar-utils.js';\n\nexport interface NamedAstNode extends AstNode {\n    name: string;\n}\n\nexport function isNamed(node: AstNode): node is NamedAstNode {\n    return typeof (node as NamedAstNode).name === 'string';\n}\n\n/**\n * Utility service for retrieving the `name` of an `AstNode` or the `CstNode` containing a `name`.\n */\nexport interface NameProvider {\n    /**\n     * Returns the `name` of a given AstNode.\n     * @param node Specified `AstNode` whose name node shall be retrieved.\n     */\n    getName(node: AstNode): string | undefined;\n    /**\n     * Returns the `CstNode` which contains the parsed value of the `name` assignment.\n     * @param node Specified `AstNode` whose name node shall be retrieved.\n     */\n    getNameNode(node: AstNode): CstNode | undefined;\n}\n\nexport class DefaultNameProvider implements NameProvider {\n    getName(node: AstNode): string | undefined {\n        if (isNamed(node)) {\n            return node.name;\n        }\n        return undefined;\n    }\n\n    getNameNode(node: AstNode): CstNode | undefined {\n        return findNodeForProperty(node.$cstNode, 'name');\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, CstNode, GenericAstNode } from '../syntax-tree.js';\nimport type { Stream } from '../utils/stream.js';\nimport type { ReferenceDescription } from '../workspace/ast-descriptions.js';\nimport type { AstNodeLocator } from '../workspace/ast-node-locator.js';\nimport type { IndexManager } from '../workspace/index-manager.js';\nimport type { NameProvider } from './name-provider.js';\nimport type { URI } from '../utils/uri-utils.js';\nimport { findAssignment } from '../utils/grammar-utils.js';\nimport { isMultiReference, isReference } from '../syntax-tree.js';\nimport { getDocument, getReferenceNodes, streamAst, streamReferences } from '../utils/ast-utils.js';\nimport { isChildNode, toDocumentSegment } from '../utils/cst-utils.js';\nimport { stream } from '../utils/stream.js';\nimport { UriUtils } from '../utils/uri-utils.js';\nimport { isCrossReference } from '../languages/generated/ast.js';\nimport type { LangiumDocuments } from '../workspace/documents.js';\n\n/**\n * Language-specific service for finding references and declaration of a given `CstNode`.\n */\nexport interface References {\n\n    /**\n     * If the CstNode is a reference node the target AstNodes will be returned.\n     * If the CstNode is a significant node of the CstNode this AstNode will be returned.\n     *\n     * @param sourceCstNode CstNode that points to a AstNode\n     */\n    findDeclarations(sourceCstNode: CstNode): AstNode[];\n\n    /**\n     * If the CstNode is a reference node the target CstNodes will be returned.\n     * If the CstNode is a significant node of the CstNode this CstNode will be returned.\n     *\n     * @param sourceCstNode CstNode that points to a AstNode\n     */\n    findDeclarationNodes(sourceCstNode: CstNode): CstNode[];\n\n    /**\n     * Finds all references to the target node as references (local references) or reference descriptions.\n     *\n     * @param targetNode Specified target node whose references should be returned\n     */\n    findReferences(targetNode: AstNode, options: FindReferencesOptions): Stream<ReferenceDescription>;\n}\n\nexport interface FindReferencesOptions {\n    /**\n     * When set, the `findReferences` method will only return references/declarations from the specified document.\n     */\n    documentUri?: URI;\n    /**\n     * Whether the returned list of references should include the declaration.\n     */\n    includeDeclaration?: boolean;\n}\n\nexport class DefaultReferences implements References {\n    protected readonly nameProvider: NameProvider;\n    protected readonly index: IndexManager;\n    protected readonly nodeLocator: AstNodeLocator;\n    protected readonly documents: LangiumDocuments;\n    protected hasMultiReference: boolean;\n\n    constructor(services: LangiumCoreServices) {\n        this.nameProvider = services.references.NameProvider;\n        this.index = services.shared.workspace.IndexManager;\n        this.nodeLocator = services.workspace.AstNodeLocator;\n        this.documents = services.shared.workspace.LangiumDocuments;\n        this.hasMultiReference = streamAst(services.Grammar).some(node => isCrossReference(node) && node.isMulti);\n    }\n\n    findDeclarations(sourceCstNode: CstNode): AstNode[] {\n        if (sourceCstNode) {\n            const assignment = findAssignment(sourceCstNode);\n            const nodeElem = sourceCstNode.astNode;\n            if (assignment && nodeElem) {\n                const reference = (nodeElem as GenericAstNode)[assignment.feature];\n\n                if (isReference(reference) || isMultiReference(reference)) {\n                    return getReferenceNodes(reference);\n                } else if (Array.isArray(reference)) {\n                    for (const ref of reference) {\n                        if ((isReference(ref) || isMultiReference(ref)) && ref.$refNode\n                            && ref.$refNode.offset <= sourceCstNode.offset\n                            && ref.$refNode.end >= sourceCstNode.end) {\n                            return getReferenceNodes(ref);\n                        }\n                    }\n                }\n            }\n            if (nodeElem) {\n                const nameNode = this.nameProvider.getNameNode(nodeElem);\n                // Only return the targeted node in case the targeted cst node is the name node or part of it\n                if (nameNode && (nameNode === sourceCstNode || isChildNode(sourceCstNode, nameNode))) {\n                    return this.getSelfNodes(nodeElem);\n                }\n            }\n        }\n        return [];\n    }\n\n    /**\n     * Returns all self-references for the specified node.\n     * Since the node can be part of a multi-reference, this method returns all nodes that are part of the same multi-reference.\n     */\n    protected getSelfNodes(node: AstNode): AstNode[] {\n        if (!this.hasMultiReference) {\n            return [node];\n        } else {\n            // In order to find all nodes that are part of the same multi-reference,\n            // we need to find a reference that points to the node.\n            // It will also point to the logical siblings of the node.\n            const references = this.index.findAllReferences(node, this.nodeLocator.getAstNodePath(node));\n            // We can simply use the first reference to find all logical siblings.\n            // Looking through all references is not necessary and very inefficient.\n            const headNode = this.getNodeFromReferenceDescription(references.head());\n            if (headNode) {\n                // We need to iterate over all references to find the one that points to the node.\n                for (const ref of streamReferences(headNode)) {\n                    if (isMultiReference(ref.reference) && ref.reference.items.some(item => item.ref === node)) {\n                        // Once we found the reference, simply return all items of the multi-reference.\n                        return ref.reference.items.map(item => item.ref);\n                    }\n                }\n            }\n            return [node];\n        }\n    }\n\n    protected getNodeFromReferenceDescription(ref?: ReferenceDescription): AstNode | undefined {\n        if (!ref) {\n            return undefined;\n        }\n        const doc = this.documents.getDocument(ref.sourceUri);\n        if (doc) {\n            return this.nodeLocator.getAstNode(doc.parseResult.value, ref.sourcePath);\n        }\n        return undefined;\n    }\n\n    findDeclarationNodes(sourceCstNode: CstNode): CstNode[] {\n        const astNodes = this.findDeclarations(sourceCstNode);\n        const cstNodes: CstNode[] = [];\n        for (const astNode of astNodes) {\n            const cstNode = this.nameProvider.getNameNode(astNode) ?? astNode.$cstNode;\n            if (cstNode) {\n                cstNodes.push(cstNode);\n            }\n        }\n        return cstNodes;\n    }\n\n    findReferences(targetNode: AstNode, options: FindReferencesOptions): Stream<ReferenceDescription> {\n        const refs: ReferenceDescription[] = [];\n        if (options.includeDeclaration) {\n            refs.push(...this.getSelfReferences(targetNode));\n        }\n        let indexReferences = this.index.findAllReferences(targetNode, this.nodeLocator.getAstNodePath(targetNode));\n        if (options.documentUri) {\n            indexReferences = indexReferences.filter(ref => UriUtils.equals(ref.sourceUri, options.documentUri));\n        }\n        refs.push(...indexReferences);\n        return stream(refs);\n    }\n\n    protected getSelfReferences(targetNode: AstNode): ReferenceDescription[] {\n        const selfNodes = this.getSelfNodes(targetNode);\n        const references: ReferenceDescription[] = [];\n        for (const selfNode of selfNodes) {\n            const nameNode = this.nameProvider.getNameNode(selfNode);\n            if (nameNode) {\n                const doc = getDocument(selfNode);\n                const path = this.nodeLocator.getAstNodePath(selfNode);\n                references.push({\n                    sourceUri: doc.uri,\n                    sourcePath: path,\n                    targetUri: doc.uri,\n                    targetPath: path,\n                    segment: toDocumentSegment(nameNode),\n                    local: true\n                });\n            }\n        }\n        return references;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { Stream } from './stream.js';\nimport { EMPTY_STREAM, Reduction, stream } from './stream.js';\n\n/**\n * A multimap is a variation of a Map that has potentially multiple values for every key.\n */\nexport class MultiMap<K, V> {\n\n    private map = new Map<K, V[]>();\n\n    constructor()\n    constructor(elements: Iterable<[K, V]>)\n    constructor(elements?: Iterable<[K, V]>) {\n        if (elements) {\n            for (const [key, value] of elements) {\n                this.add(key, value);\n            }\n        }\n    }\n\n    /**\n     * The total number of values in the multimap.\n     */\n    get size(): number {\n        return Reduction.sum(stream(this.map.values()).map(a => a.length));\n    }\n\n    /**\n     * Clear all entries in the multimap.\n     */\n    clear(): void {\n        this.map.clear();\n    }\n\n    /**\n     * Operates differently depending on whether a `value` is given:\n     *  * With a value, this method deletes the specific key / value pair from the multimap.\n     *  * Without a value, all values associated with the given key are deleted.\n     *\n     * @returns `true` if a value existed and has been removed, or `false` if the specified\n     *     key / value does not exist.\n     */\n    delete(key: K, value?: V): boolean {\n        if (value === undefined) {\n            return this.map.delete(key);\n        } else {\n            const values = this.map.get(key);\n            if (values) {\n                const index = values.indexOf(value);\n                if (index >= 0) {\n                    if (values.length === 1) {\n                        this.map.delete(key);\n                    } else {\n                        values.splice(index, 1);\n                    }\n                    return true;\n                }\n            }\n            return false;\n        }\n    }\n\n    /**\n     * Returns an array of all values associated with the given key. If no value exists,\n     * an empty array is returned.\n     *\n     * _Note:_ The returned array is assumed not to be modified. Use the `set` method to add a\n     * value and `delete` to remove a value from the multimap.\n     */\n    get(key: K): readonly V[] {\n        return this.map.get(key) ?? [];\n    }\n\n    /**\n     * Returns a stream of all values associated with the given key. If no value exists,\n     * {@link EMPTY_STREAM} is returned.\n     */\n    getStream(key: K): Stream<V> {\n        const values = this.map.get(key);\n        return values ? stream(values) : EMPTY_STREAM;\n    }\n\n    /**\n     * Operates differently depending on whether a `value` is given:\n     *  * With a value, this method returns `true` if the specific key / value pair is present in the multimap.\n     *  * Without a value, this method returns `true` if the given key is present in the multimap.\n     */\n    has(key: K, value?: V): boolean {\n        if (value === undefined) {\n            return this.map.has(key);\n        } else {\n            const values = this.map.get(key);\n            if (values) {\n                return values.indexOf(value) >= 0;\n            }\n            return false;\n        }\n    }\n\n    /**\n     * Add the given key / value pair to the multimap.\n     */\n    add(key: K, value: V): this {\n        if (this.map.has(key)) {\n            this.map.get(key)!.push(value);\n        } else {\n            this.map.set(key, [value]);\n        }\n        return this;\n    }\n\n    /**\n     * Add the given set of key / value pairs to the multimap.\n     */\n    addAll(key: K, values: Iterable<V>): this {\n        if (this.map.has(key)) {\n            this.map.get(key)!.push(...values);\n        } else {\n            this.map.set(key, Array.from(values));\n        }\n        return this;\n    }\n\n    /**\n     * Invokes the given callback function for every key / value pair in the multimap.\n     */\n    forEach(callbackfn: (value: V, key: K, map: this) => void): void {\n        this.map.forEach((array, key) =>\n            array.forEach(value => callbackfn(value, key, this))\n        );\n    }\n\n    /**\n     * Returns an iterator of key, value pairs for every entry in the map.\n     */\n    [Symbol.iterator](): Iterator<[K, V]> {\n        return this.entries().iterator();\n    }\n\n    /**\n     * Returns a stream of key, value pairs for every entry in the map.\n     */\n    entries(): Stream<[K, V]> {\n        return stream(this.map.entries())\n            .flatMap(([key, array]) => array.map(value => [key, value] as [K, V]));\n    }\n\n    /**\n     * Returns a stream of keys in the map.\n     */\n    keys(): Stream<K> {\n        return stream(this.map.keys());\n    }\n\n    /**\n     * Returns a stream of values in the map.\n     */\n    values(): Stream<V> {\n        return stream(this.map.values()).flat();\n    }\n\n    /**\n     * Returns a stream of key, value set pairs for every key in the map.\n     */\n    entriesGroupedByKey(): Stream<[K, V[]]> {\n        return stream(this.map.entries());\n    }\n\n}\n\nexport class BiMap<K, V> {\n\n    private map = new Map<K, V>();\n    private inverse = new Map<V, K>();\n\n    get size(): number {\n        return this.map.size;\n    }\n\n    constructor()\n    constructor(elements: Array<[K, V]>)\n    constructor(elements?: Array<[K, V]>) {\n        if (elements) {\n            for (const [key, value] of elements) {\n                this.set(key, value);\n            }\n        }\n    }\n\n    clear(): void {\n        this.map.clear();\n        this.inverse.clear();\n    }\n\n    set(key: K, value: V): this {\n        this.map.set(key, value);\n        this.inverse.set(value, key);\n        return this;\n    }\n\n    get(key: K): V | undefined {\n        return this.map.get(key);\n    }\n\n    getKey(value: V): K | undefined {\n        return this.inverse.get(value);\n    }\n\n    delete(key: K): boolean {\n        const value = this.map.get(key);\n        if (value !== undefined) {\n            this.map.delete(key);\n            this.inverse.delete(value);\n            return true;\n        }\n        return false;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021-2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, AstNodeDescription } from '../syntax-tree.js';\nimport { streamAllContents, streamContents } from '../utils/ast-utils.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { MultiMap } from '../utils/collections.js';\nimport { interruptAndCheck } from '../utils/promise-utils.js';\nimport type { AstNodeDescriptionProvider } from '../workspace/ast-descriptions.js';\nimport type { LangiumDocument, LocalSymbols } from '../workspace/documents.js';\nimport type { NameProvider } from './name-provider.js';\n\n/**\n * Language-specific service for precomputing global and local scopes. The service methods are executed\n * as the first and second phase in the `DocumentBuilder`.\n */\nexport interface ScopeComputation {\n\n    /**\n     * Creates descriptions of all AST nodes that shall be exported into the _global_ scope from the given\n     * document. These descriptions are gathered by the `IndexManager` and stored in the global index so\n     * they can be referenced from other documents.\n     *\n     * _Note:_ You should not resolve any cross-references in this service method. Cross-reference resolution\n     * depends on the scope computation phase to be completed (`computeScope` method), which runs after the\n     * initial indexing where this method is used.\n     *\n     * @param document The document from which to gather exported AST nodes.\n     * @param cancelToken Indicates when to cancel the current operation.\n     * @throws `OperationCanceled` if a user action occurs during execution\n     */\n    collectExportedSymbols(document: LangiumDocument, cancelToken?: CancellationToken): Promise<AstNodeDescription[]>;\n\n    /**\n     * Creates descriptions of the _local_ symbols being accessible within a document.\n     * The result is a `LocalSymbols` table assigning sets of AST node descriptions to the corresponding\n     * nodes/subtrees within the AST. The descriptions are considered in the default reference resolution\n     * implementation, i.e. they are used by the `ScopeProvider` service to determine which symbols\n     * are visible in the context of a specific cross-reference.\n     *\n     * _Note:_ You should not resolve any cross-references in this service method. Cross-reference\n     * resolution depends on the scope computation phase to be completed.\n     *\n     * @param document The document for which to compute its local symbols.\n     * @param cancelToken Indicates when to cancel the current operation.\n     * @throws `OperationCanceled` if a user action occurs during execution\n     */\n    collectLocalSymbols(document: LangiumDocument, cancelToken?: CancellationToken): Promise<LocalSymbols>;\n}\n\n/**\n * The default scope computation creates and collects descriptions of the AST nodes to be exported into the\n * _global_ scope from the given document. By default those are the document's root AST node and its directly\n * contained child nodes.\n *\n * Besides, it gathers all AST nodes that have a name (according to the `NameProvider` service) and that are to be\n * included in the local scope of their particular container nodes. They are collected in a `DocumentSymbols` table.\n * As a result, for every cross-reference in the AST, target elements from the same level (siblings) and further up\n * towards the root (parents and siblings of parents) are visible.\n * Elements being nested inside lower levels (children, children of siblings and parents' siblings)\n * are _invisible_ by default, but that can be changed by customizing this service.\n */\nexport class DefaultScopeComputation implements ScopeComputation {\n\n    protected readonly nameProvider: NameProvider;\n    protected readonly descriptions: AstNodeDescriptionProvider;\n\n    constructor(services: LangiumCoreServices) {\n        this.nameProvider = services.references.NameProvider;\n        this.descriptions = services.workspace.AstNodeDescriptionProvider;\n    }\n\n    async collectExportedSymbols(document: LangiumDocument, cancelToken = CancellationToken.None): Promise<AstNodeDescription[]> {\n        return this.collectExportedSymbolsForNode(document.parseResult.value, document, undefined, cancelToken);\n    }\n\n    /**\n     * Creates {@link AstNodeDescription AstNodeDescriptions} for the given {@link AstNode parentNode} and its children.\n     * The list of children to be considered is determined by the function parameter {@link children}.\n     * By default only the direct children of {@link parentNode} are visited, nested nodes are not exported.\n     *\n     * @param parentNode AST node to be exported, i.e., of which an {@link AstNodeDescription} shall be added to the returned list.\n     * @param document The document containing the AST node to be exported.\n     * @param children A function called with {@link parentNode} as single argument and returning an {@link Iterable} supplying the children to be visited, which must be directly or transitively contained in {@link parentNode}.\n     * @param cancelToken Indicates when to cancel the current operation.\n     * @throws `OperationCancelled` if a user action occurs during execution.\n     * @returns A list of {@link AstNodeDescription AstNodeDescriptions} to be published to index.\n     */\n    async collectExportedSymbolsForNode(parentNode: AstNode, document: LangiumDocument<AstNode>, children: (root: AstNode) => Iterable<AstNode> = streamContents, cancelToken: CancellationToken = CancellationToken.None): Promise<AstNodeDescription[]> {\n        const exports: AstNodeDescription[] = [];\n\n        this.addExportedSymbol(parentNode, exports, document);\n        for (const node of children(parentNode)) {\n            await interruptAndCheck(cancelToken);\n            this.addExportedSymbol(node, exports, document);\n        }\n        return exports;\n    }\n\n    /**\n     * Adds a single node to the list of exports if it has a name. Override this method to change how\n     * symbols are exported, e.g. by modifying their exported name.\n     */\n    protected addExportedSymbol(node: AstNode, exports: AstNodeDescription[], document: LangiumDocument): void {\n        const name = this.nameProvider.getName(node);\n        if (name) {\n            exports.push(this.descriptions.createDescription(node, name, document));\n        }\n    }\n\n    // --- local symbols gathering ---\n\n    async collectLocalSymbols(document: LangiumDocument, cancelToken = CancellationToken.None): Promise<LocalSymbols> {\n        const rootNode = document.parseResult.value;\n        const symbols = new MultiMap<AstNode, AstNodeDescription>();\n        // Here we navigate the full AST - local scopes shall be available in the whole document\n        for (const node of streamAllContents(rootNode)) {\n            await interruptAndCheck(cancelToken);\n            this.addLocalSymbol(node, document, symbols);\n        }\n        return symbols;\n    }\n\n    /**\n     * Adds a single node to the local symbols of its containing document if it has a name.\n     * The default implementation makes the node visible in the subtree of its container if it does have a container.\n     * Override this method to change this, e.g. by increasing the visibility to a higher level in the AST.\n     */\n    protected addLocalSymbol(node: AstNode, document: LangiumDocument, symbols: MultiMap<AstNode, AstNodeDescription>): void {\n        const container = node.$container;\n        if (container) {\n            const name = this.nameProvider.getName(node);\n            if (name) {\n                symbols.add(container, this.descriptions.createDescription(node, name, document));\n            }\n        }\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { AstNodeDescription } from '../syntax-tree.js';\nimport { MultiMap } from '../utils/collections.js';\nimport type { Stream } from '../utils/stream.js';\nimport { EMPTY_STREAM, stream } from '../utils/stream.js';\n\n/**\n * A scope describes what target elements are visible from a specific cross-reference context.\n */\nexport interface Scope {\n\n    /**\n     * Find a target element matching the given name. If no element is found, `undefined` is returned.\n     * If multiple matching elements are present, the selection of the returned element should be done\n     * according to the semantics of your language. Usually it is the element that is most closely defined.\n     *\n     * @param name Name of the cross-reference target as it appears in the source text.\n     */\n    getElement(name: string): AstNodeDescription | undefined;\n\n    /**\n     * Finds all target elements matching the given name. If no element is found, an empty stream is returned.\n     *\n     * @param name Name of the cross-reference target as it appears in the source text.\n     */\n    getElements(name: string): Stream<AstNodeDescription>;\n\n    /**\n     * Create a stream of all elements in the scope. This is used to compute completion proposals to be\n     * shown in the editor.\n     */\n    getAllElements(): Stream<AstNodeDescription>;\n\n}\n\nexport interface ScopeOptions {\n    /**\n     * Whether the scope should be case insensitive.\n     * Defaults to `false`.\n     */\n    caseInsensitive?: boolean;\n    /**\n     * Whether the outer scope should be concatenated with the local scope when calling `getElements`.\n     * Defaults to `true`.\n     */\n    concatOuterScope?: boolean;\n}\n\n/**\n * The default scope implementation is based on a `Stream`. It has an optional _outer scope_ describing\n * the next level of elements, which are queried when a target element is not found in the stream provided\n * to this scope.\n */\nexport class StreamScope implements Scope {\n    readonly elements: Stream<AstNodeDescription>;\n    readonly outerScope?: Scope;\n    readonly caseInsensitive: boolean;\n    readonly concatOuterScope: boolean;\n\n    constructor(elements: Stream<AstNodeDescription>, outerScope?: Scope, options?: ScopeOptions) {\n        this.elements = elements;\n        this.outerScope = outerScope;\n        this.caseInsensitive = options?.caseInsensitive ?? false;\n        this.concatOuterScope = options?.concatOuterScope ?? true;\n    }\n\n    getAllElements(): Stream<AstNodeDescription> {\n        if (this.outerScope) {\n            return this.elements.concat(this.outerScope.getAllElements());\n        } else {\n            return this.elements;\n        }\n    }\n\n    getElement(name: string): AstNodeDescription | undefined {\n        const lowerCaseName = this.caseInsensitive ? name.toLowerCase() : name;\n        const local = this.caseInsensitive\n            ? this.elements.find(e => e.name.toLowerCase() === lowerCaseName)\n            : this.elements.find(e => e.name === name);\n        if (local) {\n            return local;\n        }\n        if (this.outerScope) {\n            return this.outerScope.getElement(name);\n        }\n        return undefined;\n    }\n\n    getElements(name: string): Stream<AstNodeDescription> {\n        const lowerCaseName = this.caseInsensitive ? name.toLowerCase() : name;\n        const local = this.caseInsensitive\n            ? this.elements.filter(e => e.name.toLowerCase() === lowerCaseName)\n            : this.elements.filter(e => e.name === name);\n        if ((this.concatOuterScope || local.isEmpty()) && this.outerScope) {\n            return local.concat(this.outerScope.getElements(name));\n        } else {\n            return local;\n        }\n    }\n}\n\nexport class MapScope implements Scope {\n    readonly elements: Map<string, AstNodeDescription>;\n    readonly outerScope?: Scope;\n    readonly caseInsensitive: boolean;\n    readonly concatOuterScope: boolean;\n\n    constructor(elements: Iterable<AstNodeDescription>, outerScope?: Scope, options?: ScopeOptions) {\n        this.elements = new Map();\n        this.caseInsensitive = options?.caseInsensitive ?? false;\n        this.concatOuterScope = options?.concatOuterScope ?? true;\n        for (const element of elements) {\n            const name = this.caseInsensitive\n                ? element.name.toLowerCase()\n                : element.name;\n            this.elements.set(name, element);\n        }\n        this.outerScope = outerScope;\n    }\n\n    getElement(name: string): AstNodeDescription | undefined {\n        const localName = this.caseInsensitive ? name.toLowerCase() : name;\n        const local = this.elements.get(localName);\n        if (local) {\n            return local;\n        }\n        if (this.outerScope) {\n            return this.outerScope.getElement(name);\n        }\n        return undefined;\n    }\n\n    getElements(name: string): Stream<AstNodeDescription> {\n        const localName = this.caseInsensitive ? name.toLowerCase() : name;\n        const local = this.elements.get(localName);\n        const arr = local ? [local] : [];\n        if ((this.concatOuterScope || arr.length > 0) && this.outerScope) {\n            return stream(arr).concat(this.outerScope.getElements(name));\n        } else {\n            return stream(arr);\n        }\n    }\n\n    getAllElements(): Stream<AstNodeDescription> {\n        let elementStream = stream(this.elements.values());\n        if (this.outerScope) {\n            elementStream = elementStream.concat(this.outerScope.getAllElements());\n        }\n        return elementStream;\n    }\n\n}\n\nexport class MultiMapScope implements Scope {\n    readonly elements: MultiMap<string, AstNodeDescription>;\n    readonly outerScope?: Scope;\n    readonly caseInsensitive: boolean;\n    readonly concatOuterScope: boolean;\n\n    constructor(elements: Iterable<AstNodeDescription>, outerScope?: Scope, options?: ScopeOptions) {\n        this.elements = new MultiMap();\n        this.caseInsensitive = options?.caseInsensitive ?? false;\n        this.concatOuterScope = options?.concatOuterScope ?? true;\n        for (const element of elements) {\n            const name = this.caseInsensitive\n                ? element.name.toLowerCase()\n                : element.name;\n            this.elements.add(name, element);\n        }\n        this.outerScope = outerScope;\n    }\n\n    getElement(name: string): AstNodeDescription | undefined {\n        const localName = this.caseInsensitive ? name.toLowerCase() : name;\n        const local = this.elements.get(localName)[0];\n        if (local) {\n            return local;\n        }\n        if (this.outerScope) {\n            return this.outerScope.getElement(name);\n        }\n        return undefined;\n    }\n\n    getElements(name: string): Stream<AstNodeDescription> {\n        const localName = this.caseInsensitive ? name.toLowerCase() : name;\n        const local = this.elements.get(localName);\n        if ((this.concatOuterScope || local.length === 0) && this.outerScope) {\n            return stream(local).concat(this.outerScope.getElements(name));\n        } else {\n            return stream(local);\n        }\n    }\n\n    getAllElements(): Stream<AstNodeDescription> {\n        let elementStream = stream(this.elements.values());\n        if (this.outerScope) {\n            elementStream = elementStream.concat(this.outerScope.getAllElements());\n        }\n        return elementStream;\n    }\n\n}\n\nexport const EMPTY_SCOPE: Scope = {\n    getElement(): undefined {\n        return undefined;\n    },\n    getElements(): Stream<AstNodeDescription> {\n        return EMPTY_STREAM;\n    },\n    getAllElements(): Stream<AstNodeDescription> {\n        return EMPTY_STREAM;\n    }\n};\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { Disposable } from './disposable.js';\nimport type { URI } from './uri-utils.js';\nimport type { LangiumSharedCoreServices } from '../services.js';\nimport type { DocumentState } from '../workspace/documents.js';\n\nexport abstract class DisposableCache implements Disposable {\n\n    protected toDispose: Disposable[] = [];\n    protected isDisposed = false;\n\n    onDispose(disposable: Disposable): void {\n        this.toDispose.push(disposable);\n    }\n\n    dispose(): void {\n        this.throwIfDisposed();\n        this.clear();\n        this.isDisposed = true;\n        this.toDispose.forEach(disposable => disposable.dispose());\n    }\n\n    protected throwIfDisposed(): void {\n        if (this.isDisposed) {\n            throw new Error('This cache has already been disposed');\n        }\n    }\n\n    abstract clear(): void;\n}\n\nexport class SimpleCache<K, V> extends DisposableCache {\n    protected readonly cache = new Map<K, V>();\n\n    has(key: K): boolean {\n        this.throwIfDisposed();\n        return this.cache.has(key);\n    }\n\n    set(key: K, value: V): void {\n        this.throwIfDisposed();\n        this.cache.set(key, value);\n    }\n\n    get(key: K): V | undefined;\n    get(key: K, provider: () => V): V;\n    get(key: K, provider?: () => V): V | undefined {\n        this.throwIfDisposed();\n        if (this.cache.has(key)) {\n            return this.cache.get(key);\n        } else if (provider) {\n            const value = provider();\n            this.cache.set(key, value);\n            return value;\n        } else {\n            return undefined;\n        }\n    }\n\n    delete(key: K): boolean {\n        this.throwIfDisposed();\n        return this.cache.delete(key);\n    }\n\n    clear(): void {\n        this.throwIfDisposed();\n        this.cache.clear();\n    }\n}\n\nexport class ContextCache<Context, Key, Value, ContextKey = Context> extends DisposableCache {\n\n    private readonly cache = new Map<ContextKey | Context, Map<Key, Value>>();\n    private readonly converter: (input: Context) => ContextKey | Context;\n\n    constructor(converter?: (input: Context) => ContextKey) {\n        super();\n        this.converter = converter ?? (value => value);\n    }\n\n    has(contextKey: Context, key: Key): boolean {\n        this.throwIfDisposed();\n        return this.cacheForContext(contextKey).has(key);\n    }\n\n    set(contextKey: Context, key: Key, value: Value): void {\n        this.throwIfDisposed();\n        this.cacheForContext(contextKey).set(key, value);\n    }\n\n    get(contextKey: Context, key: Key): Value | undefined;\n    get(contextKey: Context, key: Key, provider: () => Value): Value;\n    get(contextKey: Context, key: Key, provider?: () => Value): Value | undefined {\n        this.throwIfDisposed();\n        const contextCache = this.cacheForContext(contextKey);\n        if (contextCache.has(key)) {\n            return contextCache.get(key);\n        } else if (provider) {\n            const value = provider();\n            contextCache.set(key, value);\n            return value;\n        } else {\n            return undefined;\n        }\n    }\n\n    delete(contextKey: Context, key: Key): boolean {\n        this.throwIfDisposed();\n        return this.cacheForContext(contextKey).delete(key);\n    }\n\n    clear(): void;\n    clear(contextKey: Context): void;\n    clear(contextKey?: Context): void {\n        this.throwIfDisposed();\n        if (contextKey) {\n            const mapKey = this.converter(contextKey);\n            this.cache.delete(mapKey);\n        } else {\n            this.cache.clear();\n        }\n    }\n\n    protected cacheForContext(contextKey: Context): Map<Key, Value> {\n        const mapKey = this.converter(contextKey);\n        let documentCache = this.cache.get(mapKey);\n        if (!documentCache) {\n            documentCache = new Map();\n            this.cache.set(mapKey, documentCache);\n        }\n        return documentCache;\n    }\n}\n\n/**\n * Every key/value pair in this cache is scoped to a document.\n * If this document is changed or deleted, all associated key/value pairs are deleted.\n */\nexport class DocumentCache<K, V> extends ContextCache<URI | string, K, V, string> {\n\n    /**\n     * Creates a new document cache.\n     *\n     * @param sharedServices Service container instance to hook into document lifecycle events.\n     * @param state Optional document state on which the cache should evict.\n     * If not provided, the cache will evict on `DocumentBuilder#onUpdate`.\n     * *Deleted* documents are considered in both cases.\n     *\n     * Providing a state here will use `DocumentBuilder#onDocumentPhase` instead,\n     * which triggers on all documents that have been affected by this change, assuming that the\n     * state is `DocumentState.Linked` or a later state.\n     */\n    constructor(sharedServices: LangiumSharedCoreServices, state?: DocumentState) {\n        super(uri => uri.toString());\n        if (state) {\n            this.toDispose.push(sharedServices.workspace.DocumentBuilder.onDocumentPhase(state, document => {\n                this.clear(document.uri.toString());\n            }));\n            this.toDispose.push(sharedServices.workspace.DocumentBuilder.onUpdate((_changed, deleted) => {\n                for (const uri of deleted) { // react only on deleted documents\n                    this.clear(uri);\n                }\n            }));\n        } else {\n            this.toDispose.push(sharedServices.workspace.DocumentBuilder.onUpdate((changed, deleted) => {\n                const allUris = changed.concat(deleted); // react on both changed and deleted documents\n                for (const uri of allUris) {\n                    this.clear(uri);\n                }\n            }));\n        }\n    }\n}\n\n/**\n * Every key/value pair in this cache is scoped to the whole workspace.\n * If any document in the workspace is added, changed or deleted, the whole cache is evicted.\n */\nexport class WorkspaceCache<K, V> extends SimpleCache<K, V> {\n\n    /**\n     * Creates a new workspace cache.\n     *\n     * @param sharedServices Service container instance to hook into document lifecycle events.\n     * @param state Optional document state on which the cache should evict.\n     * If not provided, the cache will evict on `DocumentBuilder#onUpdate`.\n     * *Deleted* documents are considered in both cases.\n     */\n    constructor(sharedServices: LangiumSharedCoreServices, state?: DocumentState) {\n        super();\n        if (state) {\n            this.toDispose.push(sharedServices.workspace.DocumentBuilder.onBuildPhase(state, () => {\n                this.clear();\n            }));\n            this.toDispose.push(sharedServices.workspace.DocumentBuilder.onUpdate((_changed, deleted) => {\n                if (deleted.length > 0) { // react only on deleted documents\n                    this.clear();\n                }\n            }));\n        } else {\n            this.toDispose.push(sharedServices.workspace.DocumentBuilder.onUpdate(() => { // react on both changed and deleted documents\n                this.clear();\n            }));\n        }\n    }\n}\n", "/******************************************************************************\n * Copyright 2021-2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, AstNodeDescription, AstReflection, ReferenceInfo } from '../syntax-tree.js';\nimport type { Stream } from '../utils/stream.js';\nimport type { AstNodeDescriptionProvider } from '../workspace/ast-descriptions.js';\nimport type { IndexManager } from '../workspace/index-manager.js';\nimport type { NameProvider } from './name-provider.js';\nimport type { Scope, ScopeOptions} from './scope.js';\nimport { MultiMapScope, StreamScope } from './scope.js';\nimport { getDocument } from '../utils/ast-utils.js';\nimport { stream } from '../utils/stream.js';\nimport { WorkspaceCache } from '../utils/caching.js';\n\n/**\n * Language-specific service for determining the scope of target elements visible in a specific cross-reference context.\n */\nexport interface ScopeProvider {\n\n    /**\n     * Return a scope describing what elements are visible for the given AST node and cross-reference\n     * identifier.\n     *\n     * @param context Information about the reference for which a scope is requested.\n     */\n    getScope(context: ReferenceInfo): Scope;\n\n}\n\nexport class DefaultScopeProvider implements ScopeProvider {\n\n    protected readonly reflection: AstReflection;\n    protected readonly nameProvider: NameProvider;\n    protected readonly descriptions: AstNodeDescriptionProvider;\n    protected readonly indexManager: IndexManager;\n\n    protected readonly globalScopeCache: WorkspaceCache<string, Scope>;\n\n    constructor(services: LangiumCoreServices) {\n        this.reflection = services.shared.AstReflection;\n        this.nameProvider = services.references.NameProvider;\n        this.descriptions = services.workspace.AstNodeDescriptionProvider;\n        this.indexManager = services.shared.workspace.IndexManager;\n        this.globalScopeCache = new WorkspaceCache<string, Scope>(services.shared);\n    }\n\n    getScope(context: ReferenceInfo): Scope {\n        const scopes: Array<Stream<AstNodeDescription>> = [];\n        const referenceType = this.reflection.getReferenceType(context);\n\n        const localSymbols = getDocument(context.container).localSymbols;\n        if (localSymbols) {\n            let currentNode: AstNode | undefined = context.container;\n            do {\n                if (localSymbols.has(currentNode)) {\n                    scopes.push(localSymbols.getStream(currentNode).filter(\n                        desc => this.reflection.isSubtype(desc.type, referenceType)));\n                }\n                currentNode = currentNode.$container;\n            } while (currentNode);\n        }\n\n        let result: Scope = this.getGlobalScope(referenceType, context);\n        for (let i = scopes.length - 1; i >= 0; i--) {\n            result = this.createScope(scopes[i], result);\n        }\n        return result;\n    }\n\n    /**\n     * Create a scope for the given collection of AST node descriptions.\n     */\n    protected createScope(elements: Iterable<AstNodeDescription>, outerScope?: Scope, options?: ScopeOptions): Scope {\n        return new StreamScope(stream(elements), outerScope, options);\n    }\n\n    /**\n     * Create a scope for the given collection of AST nodes, which need to be transformed into respective\n     * descriptions first. This is done using the `NameProvider` and `AstNodeDescriptionProvider` services.\n     */\n    protected createScopeForNodes(elements: Iterable<AstNode>, outerScope?: Scope, options?: ScopeOptions): Scope {\n        const s = stream(elements).map(e => {\n            const name = this.nameProvider.getName(e);\n            if (name) {\n                return this.descriptions.createDescription(e, name);\n            }\n            return undefined;\n        }).nonNullable();\n        return new StreamScope(s, outerScope, options);\n    }\n\n    /**\n     * Create a global scope filtered for the given reference type.\n     */\n    protected getGlobalScope(referenceType: string, _context: ReferenceInfo): Scope {\n        return this.globalScopeCache.get(referenceType, () => new MultiMapScope(this.indexManager.allElements(referenceType)));\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { URI } from 'vscode-uri';\nimport type { CommentProvider } from '../documentation/comment-provider.js';\nimport type { NameProvider } from '../references/name-provider.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, CstNode, GenericAstNode, MultiReference, MultiReferenceItem, Mutable, Reference } from '../syntax-tree.js';\nimport { isAstNode, isMultiReference, isReference } from '../syntax-tree.js';\nimport { getDocument } from '../utils/ast-utils.js';\nimport { findNodesForProperty } from '../utils/grammar-utils.js';\nimport type { AstNodeLocator } from '../workspace/ast-node-locator.js';\nimport type { DocumentSegment, LangiumDocument, LangiumDocuments } from '../workspace/documents.js';\n\nexport interface JsonSerializeOptions {\n    /** The space parameter for `JSON.stringify`, controlling whether and how to pretty-print the output. */\n    space?: string | number;\n    /** Whether to include the `$refText` property for references (the name used to identify the target node). */\n    refText?: boolean;\n    /** Whether to include the `$sourceText` property, which holds the full source text from which an AST node was parsed. */\n    sourceText?: boolean;\n    /** Whether to include the `$textRegion` property, which holds information to trace AST node properties to their respective source text regions. */\n    textRegions?: boolean;\n    /** Whether to include the `$comment` property, which holds comments according to the CommentProvider service. */\n    comments?: boolean;\n    /** The replacer parameter for `JSON.stringify`; the default replacer given as parameter should be used to apply basic replacements. */\n    replacer?: (key: string, value: unknown, defaultReplacer: (key: string, value: unknown) => unknown) => unknown\n    /** Used to convert and serialize URIs when the target of a cross-reference is in a different document. */\n    uriConverter?: (uri: URI, node: AstNode) => string\n}\n\nexport interface JsonDeserializeOptions {\n    /** Used to parse and convert URIs when the target of a cross-reference is in a different document. */\n    uriConverter?: (uri: string) => URI\n}\n\n/**\n * {@link AstNode}s that may carry information on their definition area within the DSL text.\n */\nexport interface AstNodeWithTextRegion extends AstNode {\n    $sourceText?: string;\n    $textRegion?: AstNodeRegionWithAssignments;\n}\n\n/**\n * {@link AstNode}s that may carry a semantically relevant comment.\n */\nexport interface AstNodeWithComment extends AstNode {\n    $comment?: string;\n}\n\nexport function isAstNodeWithComment(node: AstNode): node is AstNodeWithComment {\n    return typeof (node as AstNodeWithComment).$comment === 'string';\n}\n\n/**\n * A {@link DocumentSegment} representing the definition area of an AstNode within the DSL text.\n * Usually contains text region information on all assigned property values of the AstNode,\n * and may contain the defining file's URI as string.\n */\nexport interface AstNodeRegionWithAssignments extends DocumentSegment {\n    /**\n     * A record containing an entry for each assigned property of the AstNode.\n     * The key is equal to the property name and the value is an array of the property values'\n     * text regions, regardless of whether the property is a single value or list property.\n     */\n    assignments?: Record<string, DocumentSegment[]>;\n    /**\n     * The AstNode defining file's URI as string\n     */\n    documentURI?: string;\n}\n\n/**\n * Utility service for transforming an `AstNode` into a JSON string and vice versa.\n */\nexport interface JsonSerializer {\n    /**\n     * Serialize an `AstNode` into a JSON `string`.\n     * @param node The `AstNode` to be serialized.\n     * @param options Serialization options\n     */\n    serialize(node: AstNode, options?: JsonSerializeOptions): string;\n    /**\n     * Deserialize (parse) a JSON `string` into an `AstNode`.\n     */\n    deserialize<T extends AstNode = AstNode>(content: string, options?: JsonDeserializeOptions): T;\n}\n\n/**\n * A cross-reference in the serialized JSON representation of an AstNode.\n */\ninterface IntermediateReference {\n    /** URI pointing to the target element. This is either `#${path}` if the target is in the same document, or `${documentURI}#${path}` otherwise. */\n    $ref?: string\n    /** URI pointing to the target elements. This is the multi reference equivalent for {@link $ref}. */\n    $refs?: string[]\n    /** The actual text used to look up the reference target in the surrounding scope. */\n    $refText?: string\n    /** If any problem occurred while resolving the reference, it is described by this property. */\n    $error?: string\n}\n\nfunction isIntermediateReference(obj: unknown): obj is IntermediateReference {\n    return typeof obj === 'object' && !!obj && ('$ref' in obj || '$error' in obj);\n}\n\nexport class DefaultJsonSerializer implements JsonSerializer {\n\n    /** The set of AstNode properties to be ignored by the serializer. */\n    ignoreProperties = new Set(['$container', '$containerProperty', '$containerIndex', '$document', '$cstNode']);\n\n    /** The document that is currently processed by the serializer; this is used by the replacer function.  */\n    protected currentDocument: LangiumDocument | undefined;\n\n    protected readonly langiumDocuments: LangiumDocuments;\n    protected readonly astNodeLocator: AstNodeLocator;\n    protected readonly nameProvider: NameProvider;\n    protected readonly commentProvider: CommentProvider;\n\n    constructor(services: LangiumCoreServices) {\n        this.langiumDocuments = services.shared.workspace.LangiumDocuments;\n        this.astNodeLocator = services.workspace.AstNodeLocator;\n        this.nameProvider = services.references.NameProvider;\n        this.commentProvider = services.documentation.CommentProvider;\n    }\n\n    serialize(node: AstNode, options?: JsonSerializeOptions): string {\n        const serializeOptions = options ?? {};\n        const specificReplacer = options?.replacer;\n        const defaultReplacer = (key: string, value: unknown) => this.replacer(key, value, serializeOptions);\n        const replacer = specificReplacer ? (key: string, value: unknown) => specificReplacer(key, value, defaultReplacer) : defaultReplacer;\n\n        try {\n            this.currentDocument = getDocument(node);\n            return JSON.stringify(node, replacer, options?.space);\n        } finally {\n            this.currentDocument = undefined;\n        }\n    }\n\n    deserialize<T extends AstNode = AstNode>(content: string, options?: JsonDeserializeOptions): T {\n        const deserializeOptions = options ?? {};\n        const root = JSON.parse(content);\n        this.linkNode(root, root, deserializeOptions);\n        return root;\n    }\n\n    protected replacer(key: string, value: unknown, { refText, sourceText, textRegions, comments, uriConverter }: JsonSerializeOptions): unknown {\n        if (this.ignoreProperties.has(key)) {\n            return undefined;\n        } else if (isReference(value)) {\n            const refValue = value.ref;\n            const $refText = refText ? value.$refText : undefined;\n            if (refValue) {\n                const targetDocument = getDocument(refValue);\n                let targetUri = '';\n                if (this.currentDocument && this.currentDocument !== targetDocument) {\n                    if (uriConverter) {\n                        targetUri = uriConverter(targetDocument.uri, refValue);\n                    } else {\n                        targetUri = targetDocument.uri.toString();\n                    }\n                }\n                const targetPath = this.astNodeLocator.getAstNodePath(refValue);\n                return {\n                    $ref: `${targetUri}#${targetPath}`,\n                    $refText\n                } satisfies IntermediateReference;\n            } else {\n                return {\n                    $error: value.error?.message ?? 'Could not resolve reference',\n                    $refText\n                } satisfies IntermediateReference;\n            }\n        } else if (isMultiReference(value)) {\n            const $refText = refText ? value.$refText : undefined;\n            const $refs: string[] = [];\n            for (const item of value.items) {\n                const refValue = item.ref;\n                const targetDocument = getDocument(item.ref);\n                let targetUri = '';\n                if (this.currentDocument && this.currentDocument !== targetDocument) {\n                    if (uriConverter) {\n                        targetUri = uriConverter(targetDocument.uri, refValue);\n                    } else {\n                        targetUri = targetDocument.uri.toString();\n                    }\n                }\n                const targetPath = this.astNodeLocator.getAstNodePath(refValue);\n                $refs.push(`${targetUri}#${targetPath}`);\n            }\n            return {\n                $refs,\n                $refText\n            } satisfies IntermediateReference;\n        } else if (isAstNode(value)) {\n            let astNode: AstNodeWithTextRegion | undefined = undefined;\n            if (textRegions) {\n                astNode = this.addAstNodeRegionWithAssignmentsTo({ ...value });\n                if ((!key || value.$document) && astNode?.$textRegion) {\n                    // The document URI is added to the root node of the resulting JSON tree\n                    astNode.$textRegion.documentURI = this.currentDocument?.uri.toString();\n                }\n            }\n            if (sourceText && !key) {\n                astNode ??= { ...value };\n                astNode.$sourceText = value.$cstNode?.text;\n            }\n            if (comments) {\n                astNode ??= { ...value };\n                const comment = this.commentProvider.getComment(value);\n                if (comment) {\n                    (astNode as AstNodeWithComment).$comment = comment.replace(/\\r/g, '');\n                }\n            }\n            return astNode ?? value;\n        } else {\n            return value;\n        }\n    }\n\n    protected addAstNodeRegionWithAssignmentsTo(node: AstNodeWithTextRegion) {\n        const createDocumentSegment: (cstNode: CstNode) => AstNodeRegionWithAssignments = cstNode => <DocumentSegment>{\n            offset: cstNode.offset,\n            end: cstNode.end,\n            length: cstNode.length,\n            range: cstNode.range,\n        };\n\n        if (node.$cstNode) {\n            const textRegion = node.$textRegion = createDocumentSegment(node.$cstNode);\n            const assignments: Record<string, DocumentSegment[]> = textRegion.assignments = {};\n\n            Object.keys(node).filter(key => !key.startsWith('$')).forEach(key => {\n                const propertyAssignments = findNodesForProperty(node.$cstNode, key).map(createDocumentSegment);\n                if (propertyAssignments.length !== 0) {\n                    assignments[key] = propertyAssignments;\n                }\n            });\n\n            return node;\n        }\n        return undefined;\n    }\n\n    protected linkNode(node: GenericAstNode, root: AstNode, options: JsonDeserializeOptions, container?: AstNode, containerProperty?: string, containerIndex?: number) {\n        for (const [propertyName, item] of Object.entries(node)) {\n            if (Array.isArray(item)) {\n                for (let index = 0; index < item.length; index++) {\n                    const element = item[index];\n                    if (isIntermediateReference(element)) {\n                        item[index] = this.reviveReference(node, propertyName, root, element, options);\n                    } else if (isAstNode(element)) {\n                        this.linkNode(element as GenericAstNode, root, options, node, propertyName, index);\n                    }\n                }\n            } else if (isIntermediateReference(item)) {\n                node[propertyName] = this.reviveReference(node, propertyName, root, item, options);\n            } else if (isAstNode(item)) {\n                this.linkNode(item as GenericAstNode, root, options, node, propertyName);\n            }\n        }\n        const mutable = node as Mutable<AstNode>;\n        mutable.$container = container;\n        mutable.$containerProperty = containerProperty;\n        mutable.$containerIndex = containerIndex;\n    }\n\n    protected reviveReference(container: AstNode, property: string, root: AstNode, reference: IntermediateReference, options: JsonDeserializeOptions): Reference | MultiReference | undefined {\n        let refText = reference.$refText;\n        let error = reference.$error;\n        let ref: Mutable<Reference> | Mutable<MultiReference> | undefined;\n        if (reference.$ref) {\n            const refNode = this.getRefNode(root, reference.$ref, options.uriConverter);\n            if (isAstNode(refNode)) {\n                if (!refText) {\n                    refText = this.nameProvider.getName(refNode);\n                }\n                return {\n                    $refText: refText ?? '',\n                    ref: refNode\n                };\n            } else {\n                error = refNode;\n            }\n        } else if (reference.$refs) {\n            const refs: MultiReferenceItem[] = [];\n            for (const refUri of reference.$refs) {\n                const refNode = this.getRefNode(root, refUri, options.uriConverter);\n                if (isAstNode(refNode)) {\n                    refs.push({ ref: refNode });\n                }\n            }\n            if (refs.length === 0) {\n                ref = {\n                    $refText: refText ?? '',\n                    items: refs\n                };\n                error ??= 'Could not resolve multi-reference';\n            } else {\n                return {\n                    $refText: refText ?? '',\n                    items: refs\n                };\n            }\n        }\n        if (error) {\n            ref ??= {\n                $refText: refText ?? '',\n                ref: undefined\n            };\n            ref.error = {\n                info: {\n                    container,\n                    property,\n                    reference: ref\n                },\n                message: error\n            };\n            return ref;\n        } else {\n            return undefined;\n        }\n    }\n\n    protected getRefNode(root: AstNode, uri: string, uriConverter?: (uri: string) => URI): AstNode | string {\n        try {\n            const fragmentIndex = uri.indexOf('#');\n            if (fragmentIndex === 0) {\n                const node = this.astNodeLocator.getAstNode(root, uri.substring(1));\n                if (!node) {\n                    return 'Could not resolve path: ' + uri;\n                }\n                return node;\n            }\n            if (fragmentIndex < 0) {\n                const documentUri = uriConverter ? uriConverter(uri) : URI.parse(uri);\n                const document = this.langiumDocuments.getDocument(documentUri);\n                if (!document) {\n                    return 'Could not find document for URI: ' + uri;\n                }\n                return document.parseResult.value;\n            }\n            const documentUri = uriConverter ? uriConverter(uri.substring(0, fragmentIndex)) : URI.parse(uri.substring(0, fragmentIndex));\n            const document = this.langiumDocuments.getDocument(documentUri);\n            if (!document) {\n                return 'Could not find document for URI: ' + uri;\n            }\n            if (fragmentIndex === uri.length - 1) {\n                return document.parseResult.value;\n            }\n            const node = this.astNodeLocator.getAstNode(document.parseResult.value, uri.substring(fragmentIndex + 1));\n            if (!node) {\n                return 'Could not resolve URI: ' + uri;\n            }\n            return node;\n        } catch (err) {\n            return String(err);\n        }\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices, LangiumSharedCoreServices } from './services.js';\nimport type { TextDocumentProvider } from './workspace/documents.js';\nimport { UriUtils, type URI } from './utils/uri-utils.js';\n\n/**\n * The service registry provides access to the language-specific {@link LangiumCoreServices} optionally including LSP-related services.\n * These are resolved via the URI of a text document.\n */\nexport interface ServiceRegistry {\n\n    /**\n     * Register a language via its injected services.\n     */\n    register(language: LangiumCoreServices): void;\n\n    /**\n     * Retrieve the language-specific services for the given URI. In case only one language is\n     * registered, it may be used regardless of the URI format.\n     */\n    getServices(uri: URI): LangiumCoreServices;\n\n    /**\n     * Check whether services are available for the given URI.\n     */\n    hasServices(uri: URI): boolean;\n\n    /**\n     * The full set of registered language services.\n     */\n    readonly all: readonly LangiumCoreServices[];\n}\n\n/**\n * Generic registry for Langium services, but capable of being used with extending service sets as well (such as the lsp-complete LangiumCoreServices set)\n */\nexport class DefaultServiceRegistry implements ServiceRegistry {\n\n    protected readonly languageIdMap = new Map<string, LangiumCoreServices>();\n    protected readonly fileExtensionMap = new Map<string, LangiumCoreServices>();\n    protected readonly fileNameMap = new Map<string, LangiumCoreServices>();\n\n    /**\n     * @deprecated Since 3.1.0. Use the new `fileExtensionMap` (or `languageIdMap`) property instead.\n     */\n    protected get map(): Map<string, LangiumCoreServices> | undefined {\n        return this.fileExtensionMap;\n    }\n\n    protected readonly textDocuments?: TextDocumentProvider;\n\n    constructor(services?: LangiumSharedCoreServices) {\n        this.textDocuments = services?.workspace.TextDocuments;\n    }\n\n    register(language: LangiumCoreServices): void {\n        const data = language.LanguageMetaData;\n        for (const ext of data.fileExtensions) {\n            if (this.fileExtensionMap.has(ext)) {\n                console.warn(`The file extension ${ext} is used by multiple languages. It is now assigned to '${data.languageId}'.`);\n            }\n            this.fileExtensionMap.set(ext, language);\n        }\n        if (data.fileNames) {\n            for (const name of data.fileNames) {\n                if (this.fileNameMap.has(name)) {\n                    console.warn(`The file name ${name} is used by multiple languages. It is now assigned to '${data.languageId}'.`);\n                }\n                this.fileNameMap.set(name, language);\n            }\n        }\n        this.languageIdMap.set(data.languageId, language);\n    }\n\n    getServices(uri: URI): LangiumCoreServices {\n        if (this.languageIdMap.size === 0) {\n            throw new Error('The service registry is empty. Use `register` to register the services of a language.');\n        }\n        const languageId = this.textDocuments?.get(uri)?.languageId;\n        if (languageId !== undefined) {\n            const services = this.languageIdMap.get(languageId);\n            if (services) {\n                return services;\n            }\n        }\n        const ext = UriUtils.extname(uri);\n        const name = UriUtils.basename(uri);\n        const services = this.fileNameMap.get(name) ?? this.fileExtensionMap.get(ext);\n\n        if (!services) {\n            if (languageId) {\n                throw new Error(`The service registry contains no services for the extension '${ext}' for language '${languageId}'.`);\n            } else {\n                throw new Error(`The service registry contains no services for the extension '${ext}'.`);\n            }\n        }\n        return services;\n    }\n\n    hasServices(uri: URI): boolean {\n        try {\n            this.getServices(uri);\n            return true;\n        } catch {\n            return false;\n        }\n    }\n\n    get all(): readonly LangiumCoreServices[] {\n        return Array.from(this.languageIdMap.values());\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\n/* eslint-disable @typescript-eslint/no-explicit-any */\n\n/**\n * A `Module<I>` is a description of possibly grouped service factories.\n *\n * Given a type I = { group: { service: A } },\n * Module<I> := { group: { service: (injector: I) => A } }\n *\n * Making `I` available during the creation of `I` allows us to create cyclic\n * dependencies.\n */\nexport type Module<I, T = I> = {\n    [K in keyof T]: Module<I, T[K]> | ((injector: I) => T[K])\n}\n\nexport namespace Module {\n    /**\n     * Merges two dependency injection modules into a new (third) one that is returned.\n     * At that `m1` and `m2` stay unchanged. Therefore, `m1` is deep-copied first,\n     * and m2 is merged onto the copy afterwards.\n     *\n     * Note that the leaf values of `m1` and `m2`, i.e. the service constructor functions,\n     * cannot be copied generically, since they are functions. They are shared by the source and merged modules.\n     *\n     * @returns the merged module being a deep copy of `m1` with `m2` merged onto it.\n     */\n    export const merge = <M1, M2, R extends M1 & M2>(m1: Module<R, M1>, m2: Module<R, M2>) => (_merge(_merge({}, m1), m2) as Module<R, M1 & M2>);\n}\n\n/**\n * Given a set of modules, the inject function returns a lazily evaluated injector\n * that injects dependencies into the requested service when it is requested the\n * first time. Subsequent requests will return the same service.\n *\n * In the case of cyclic dependencies, an Error will be thrown. This can be fixed\n * by injecting a provider `() => T` instead of a `T`.\n *\n * Please note that the arguments may be objects or arrays. However, the result will\n * be an object. Using it with for..of will have no effect.\n *\n * @param module1 first Module\n * @param module2 (optional) second Module\n * @param module3 (optional) third Module\n * @param module4 (optional) fourth Module\n * @param module5 (optional) fifth Module\n * @param module6 (optional) sixth Module\n * @param module7 (optional) seventh Module\n * @param module8 (optional) eighth Module\n * @param module9 (optional) ninth Module\n * @returns a new object of type I\n */\nexport function inject<I1, I2, I3, I4, I5, I6, I7, I8, I9, I extends I1 & I2 & I3 & I4 & I5 & I6 & I7 & I8 & I9>(\n    module1: Module<I, I1>, module2?: Module<I, I2>, module3?: Module<I, I3>, module4?: Module<I, I4>, module5?: Module<I, I5>, module6?: Module<I, I6>, module7?: Module<I, I7>, module8?: Module<I, I8>, module9?: Module<I, I9>\n): I {\n    const module = [module1, module2, module3, module4, module5, module6, module7, module8, module9].reduce(_merge, {}) as Module<I>;\n    return _inject(module);\n}\n\nconst isProxy = Symbol('isProxy');\n\n/**\n * Eagerly load all services in the given dependency injection container. This is sometimes\n * necessary because services can register event listeners in their constructors.\n */\nexport function eagerLoad<T>(item: T): T {\n    if (item && (item as any)[isProxy]) {\n        for (const value of Object.values(item)) {\n            eagerLoad(value);\n        }\n    }\n    return item;\n}\n\n/**\n * Helper function that returns an injector by creating a proxy.\n * Invariant: injector is of type I. If injector is undefined, then T = I.\n */\nfunction _inject<I, T>(module: Module<I, T>, injector?: any): T {\n    const proxy: any = new Proxy({} as any, {\n        deleteProperty: () => false,\n        set: () => {\n            throw new Error('Cannot set property on injected service container');\n        },\n        get: (obj, prop) => {\n            if (prop === isProxy) {\n                return true;\n            } else {\n                return _resolve(obj, prop, module, injector || proxy);\n            }\n        },\n        getOwnPropertyDescriptor: (obj, prop) => (_resolve(obj, prop, module, injector || proxy), Object.getOwnPropertyDescriptor(obj, prop)), // used by for..in\n        has: (_, prop) => prop in module, // used by ..in..\n        ownKeys: () => [...Object.getOwnPropertyNames(module)] // used by for..in\n    });\n    return proxy;\n}\n\n/**\n * Internally used to tag a requested dependency, directly before calling the factory.\n * This allows us to find cycles during instance creation.\n */\nconst __requested__ = Symbol();\n\n/**\n * Returns the value `obj[prop]`. If the value does not exist, yet, it is resolved from\n * the module description. The result of service factories is cached. Groups are\n * recursively proxied.\n *\n * @param obj an object holding all group proxies and services\n * @param prop the key of a value within obj\n * @param module an object containing groups and service factories\n * @param injector the first level proxy that provides access to all values\n * @returns the requested value `obj[prop]`\n * @throws Error if a dependency cycle is detected\n */\nfunction _resolve<I, T>(obj: any, prop: string | symbol | number, module: Module<I, T>, injector: I): T[keyof T] | undefined {\n    if (prop in obj) {\n        if (obj[prop] instanceof Error) {\n            throw new Error('Construction failure. Please make sure that your dependencies are constructable. Cause: ' + obj[prop]);\n        }\n        if (obj[prop] === __requested__) {\n            throw new Error('Cycle detected. Please make \"' + String(prop) + '\" lazy. Visit https://langium.org/docs/reference/configuration-services/#resolving-cyclic-dependencies');\n        }\n        return obj[prop];\n    } else if (prop in module) {\n        const value: Module<I, T[keyof T]> | ((injector: I) => T[keyof T]) = module[prop as keyof T];\n        obj[prop] = __requested__;\n        try {\n            obj[prop] = (typeof value === 'function') ? value(injector) : _inject(value, injector);\n        } catch (error) {\n            obj[prop] = error instanceof Error ? error : undefined;\n            throw error;\n        }\n        return obj[prop];\n    } else {\n        return undefined;\n    }\n}\n\n/**\n * Performs a deep-merge of two modules by writing source entries into the target module.\n *\n * @param target the module which is written\n * @param source the module which is read\n * @returns the target module\n */\nfunction _merge(target: Module<any>, source?: Module<any>): Module<unknown> {\n    if (source) {\n        for (const [key, sourceValue] of Object.entries(source)) {\n            if (sourceValue !== undefined && sourceValue !== null) {\n                if (typeof sourceValue === 'object') {\n                    const targetValue = target[key];\n\n                    if (typeof targetValue === 'object' && targetValue !== null) {\n                        // in case both values are real (non-null) objects merge them recursively\n                        target[key] = _merge(targetValue, sourceValue);\n                    } else {\n                        // in case 'target[key]' is not a non-null object\n                        //  we overwrite any existing value with a deep copy of 'sourceValue'\n                        //  by recursively calling this function with a new 'target' object to be populated\n                        //  that is assigned to 'target[key]' afterwards\n                        target[key] = _merge({}, sourceValue);\n                    }\n                } else {\n                    // in case 'sourceValue' is defined and assigned (non-null) but not an object\n                    //  we assume it to be a service constructor function according to the Module<I> type definition\n                    target[key] = sourceValue;\n                    // note the following for such service constructor functions:\n                    // 'target[key]' will now reference the same function object being referenced by 'source[key]'.\n                    // This is accepted here, since function objects cannot be safely copied in general.\n                }\n            }\n        }\n    }\n    return target;\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { GrammarConfig } from '../languages/grammar-config.js';\nimport { isAstNodeWithComment } from '../serializer/json-serializer.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode } from '../syntax-tree.js';\nimport { findCommentNode } from '../utils/cst-utils.js';\n\n/**\n * Provides comments for AST nodes.\n */\nexport interface CommentProvider {\n    /**\n     * Returns the comment associated with the specified AST node.\n     * @param node The AST node to get the comment for.\n     * @returns The comment associated with the specified AST node or `undefined` if there is no comment.\n     */\n    getComment(node: AstNode): string | undefined;\n}\n\nexport class DefaultCommentProvider implements CommentProvider {\n    protected readonly grammarConfig: () => GrammarConfig;\n    constructor(services: LangiumCoreServices) {\n        this.grammarConfig = () => services.parser.GrammarConfig;\n    }\n    getComment(node: AstNode): string | undefined {\n        if(isAstNodeWithComment(node)) {\n            return node.$comment;\n        }\n        return findCommentNode(node.$cstNode, this.grammarConfig().multilineCommentRules)?.text;\n    }\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { Position, Range } from 'vscode-languageserver-types';\nimport type { CstNode } from '../syntax-tree.js';\nimport { NEWLINE_REGEXP, escapeRegExp } from '../utils/regexp-utils.js';\nimport { URI } from '../utils/uri-utils.js';\n\nexport interface JSDocComment extends JSDocValue {\n    readonly elements: JSDocElement[]\n    getTag(name: string): JSDocTag | undefined\n    getTags(name: string): JSDocTag[]\n}\n\nexport type JSDocElement = JSDocParagraph | JSDocTag;\n\nexport type JSDocInline = JSDocTag | JSDocLine;\n\nexport interface JSDocValue {\n    /**\n     * Represents the range that this JSDoc element occupies.\n     * If the JSDoc was parsed from a `CstNode`, the range will represent the location in the source document.\n     */\n    readonly range: Range\n    /**\n     * Renders this JSDoc element to a plain text representation.\n     */\n    toString(): string\n    /**\n     * Renders this JSDoc element to a markdown representation.\n     *\n     * @param options Rendering options to customize the markdown result.\n     */\n    toMarkdown(options?: JSDocRenderOptions): string\n}\n\nexport interface JSDocParagraph extends JSDocValue {\n    readonly inlines: JSDocInline[]\n}\n\nexport interface JSDocLine extends JSDocValue {\n    readonly text: string\n}\n\nexport interface JSDocTag extends JSDocValue {\n    readonly name: string\n    readonly content: JSDocParagraph\n    readonly inline: boolean\n}\n\nexport interface JSDocParseOptions {\n    /**\n     * The start symbol of your comment format. Defaults to `/**`.\n     */\n    readonly start?: RegExp | string\n    /**\n     * The symbol that start a line of your comment format. Defaults to `*`.\n     */\n    readonly line?: RegExp | string\n    /**\n     * The end symbol of your comment format. Defaults to `*\\/`.\n     */\n    readonly end?: RegExp | string\n}\n\nexport interface JSDocRenderOptions {\n    /**\n     * Determines the style for rendering tags. Defaults to `italic`.\n     */\n    tag?: 'plain' | 'italic' | 'bold' | 'bold-italic'\n    /**\n     * Determines the default for rendering `@link` tags. Defaults to `plain`.\n     */\n    link?: 'code' | 'plain'\n    /**\n     * Custom tag rendering function.\n     * Return a markdown formatted tag or `undefined` to fall back to the default rendering.\n     */\n    renderTag?(tag: JSDocTag): string | undefined\n    /**\n     * Custom link rendering function. Accepts a link target and a display value for the link.\n     * Return a markdown formatted link with the format `[$display]($link)` or `undefined` if the link is not a valid target.\n     */\n    renderLink?(link: string, display: string): string | undefined\n}\n\n/**\n * Parses a JSDoc from a `CstNode` containing a comment.\n *\n * @param node A `CstNode` from a parsed Langium document.\n * @param options Parsing options specialized to your language. See {@link JSDocParseOptions}.\n */\nexport function parseJSDoc(node: CstNode, options?: JSDocParseOptions): JSDocComment;\n/**\n * Parses a JSDoc from a string comment.\n *\n * @param content A string containing the source of the JSDoc comment.\n * @param start The start position the comment occupies in the source document.\n * @param options Parsing options specialized to your language. See {@link JSDocParseOptions}.\n */\nexport function parseJSDoc(content: string, start?: Position, options?: JSDocParseOptions): JSDocComment;\nexport function parseJSDoc(node: CstNode | string, start?: Position | JSDocParseOptions, options?: JSDocParseOptions): JSDocComment {\n    let opts: JSDocParseOptions | undefined;\n    let position: Position | undefined;\n    if (typeof node === 'string') {\n        position = start as Position | undefined;\n        opts = options as JSDocParseOptions | undefined;\n    } else {\n        position = node.range.start;\n        opts = start as JSDocParseOptions | undefined;\n    }\n    if (!position) {\n        position = Position.create(0, 0);\n    }\n\n    const lines = getLines(node);\n    const normalizedOptions = normalizeOptions(opts);\n\n    const tokens = tokenize({\n        lines,\n        position,\n        options: normalizedOptions\n    });\n\n    return parseJSDocComment({\n        index: 0,\n        tokens,\n        position\n    });\n}\n\nexport function isJSDoc(node: CstNode | string, options?: JSDocParseOptions): boolean {\n    const normalizedOptions = normalizeOptions(options);\n    const lines = getLines(node);\n    if (lines.length === 0) {\n        return false;\n    }\n\n    const first = lines[0];\n    const last = lines[lines.length - 1];\n    const firstRegex = normalizedOptions.start;\n    const lastRegex = normalizedOptions.end;\n\n    return Boolean(firstRegex?.exec(first)) && Boolean(lastRegex?.exec(last));\n}\n\nfunction getLines(node: CstNode | string): string[] {\n    let content = '';\n    if (typeof node === 'string') {\n        content = node;\n    } else {\n        content = node.text;\n    }\n    const lines = content.split(NEWLINE_REGEXP);\n    return lines;\n}\n\n// Tokenization\n\ninterface JSDocToken {\n    type: 'text' | 'tag' | 'inline-tag' | 'break'\n    content: string\n    range: Range\n}\n\nconst tagRegex = /\\s*(@([\\p{L}][\\p{L}\\p{N}]*)?)/uy;\nconst inlineTagRegex = /\\{(@[\\p{L}][\\p{L}\\p{N}]*)(\\s*)([^\\r\\n}]+)?\\}/gu;\n\nfunction tokenize(context: TokenizationContext): JSDocToken[] {\n    const tokens: JSDocToken[] = [];\n    let currentLine = context.position.line;\n    let currentCharacter = context.position.character;\n    for (let i = 0; i < context.lines.length; i++) {\n        const first = i === 0;\n        const last = i === context.lines.length - 1;\n        let line = context.lines[i];\n        let index = 0;\n\n        if (first && context.options.start) {\n            const match = context.options.start?.exec(line);\n            if (match) {\n                index = match.index + match[0].length;\n            }\n        } else {\n            const match = context.options.line?.exec(line);\n            if (match) {\n                index = match.index + match[0].length;\n            }\n        }\n        if (last) {\n            const match = context.options.end?.exec(line);\n            if (match) {\n                line = line.substring(0, match.index);\n            }\n        }\n\n        line = line.substring(0, lastCharacter(line));\n        const whitespaceEnd = skipWhitespace(line, index);\n\n        if (whitespaceEnd >= line.length) {\n            // Only create a break token when we already have previous tokens\n            if (tokens.length > 0) {\n                const position = Position.create(currentLine, currentCharacter);\n                tokens.push({\n                    type: 'break',\n                    content: '',\n                    range: Range.create(position, position)\n                });\n            }\n        } else {\n            tagRegex.lastIndex = index;\n            const tagMatch = tagRegex.exec(line);\n            if (tagMatch) {\n                const fullMatch = tagMatch[0];\n                const value = tagMatch[1];\n                const start = Position.create(currentLine, currentCharacter + index);\n                const end = Position.create(currentLine, currentCharacter + index + fullMatch.length);\n                tokens.push({\n                    type: 'tag',\n                    content: value,\n                    range: Range.create(start, end)\n                });\n                index += fullMatch.length;\n                index = skipWhitespace(line, index);\n            }\n\n            if (index < line.length) {\n                const rest = line.substring(index);\n                const inlineTagMatches = Array.from(rest.matchAll(inlineTagRegex));\n                tokens.push(...buildInlineTokens(inlineTagMatches, rest, currentLine, currentCharacter + index));\n            }\n        }\n\n        currentLine++;\n        currentCharacter = 0;\n    }\n\n    // Remove last break token if there is one\n    if (tokens.length > 0 && tokens[tokens.length - 1].type === 'break') {\n        return tokens.slice(0, -1);\n    }\n\n    return tokens;\n}\n\nfunction buildInlineTokens(tags: RegExpMatchArray[], line: string, lineIndex: number, characterIndex: number): JSDocToken[] {\n    const tokens: JSDocToken[] = [];\n\n    if (tags.length === 0) {\n        const start = Position.create(lineIndex, characterIndex);\n        const end = Position.create(lineIndex, characterIndex + line.length);\n        tokens.push({\n            type: 'text',\n            content: line,\n            range: Range.create(start, end)\n        });\n    } else {\n        let lastIndex = 0;\n        for (const match of tags) {\n            const matchIndex = match.index!;\n            const startContent = line.substring(lastIndex, matchIndex);\n            if (startContent.length > 0) {\n                tokens.push({\n                    type: 'text',\n                    content: line.substring(lastIndex, matchIndex),\n                    range: Range.create(\n                        Position.create(lineIndex, lastIndex + characterIndex),\n                        Position.create(lineIndex, matchIndex + characterIndex)\n                    )\n                });\n            }\n            let offset = startContent.length + 1;\n            const tagName = match[1];\n            tokens.push({\n                type: 'inline-tag',\n                content: tagName,\n                range: Range.create(\n                    Position.create(lineIndex, lastIndex + offset + characterIndex),\n                    Position.create(lineIndex, lastIndex + offset + tagName.length + characterIndex)\n                )\n            });\n            offset += tagName.length;\n            if (match.length === 4) {\n                offset += match[2].length;\n                const value = match[3];\n                tokens.push({\n                    type: 'text',\n                    content: value,\n                    range: Range.create(\n                        Position.create(lineIndex, lastIndex + offset + characterIndex),\n                        Position.create(lineIndex, lastIndex + offset + value.length + characterIndex)\n                    )\n                });\n            } else {\n                tokens.push({\n                    type: 'text',\n                    content: '',\n                    range: Range.create(\n                        Position.create(lineIndex, lastIndex + offset + characterIndex),\n                        Position.create(lineIndex, lastIndex + offset + characterIndex)\n                    )\n                });\n            }\n            lastIndex = matchIndex + match[0].length;\n        }\n        const endContent = line.substring(lastIndex);\n        if (endContent.length > 0) {\n            tokens.push({\n                type: 'text',\n                content: endContent,\n                range: Range.create(\n                    Position.create(lineIndex, lastIndex + characterIndex),\n                    Position.create(lineIndex, lastIndex + characterIndex + endContent.length)\n                )\n            });\n        }\n    }\n\n    return tokens;\n}\n\nconst nonWhitespaceRegex = /\\S/;\nconst whitespaceEndRegex = /\\s*$/;\n\nfunction skipWhitespace(line: string, index: number): number {\n    const match = line.substring(index).match(nonWhitespaceRegex);\n    if (match) {\n        return index + match.index!;\n    } else {\n        return line.length;\n    }\n}\n\nfunction lastCharacter(line: string): number | undefined {\n    const match = line.match(whitespaceEndRegex);\n    if (match && typeof match.index === 'number') {\n        return match.index;\n    }\n    return undefined;\n}\n\n// Parsing\n\nfunction parseJSDocComment(context: ParseContext): JSDocComment {\n    const startPosition: Position = Position.create(context.position.line, context.position.character);\n    if (context.tokens.length === 0) {\n        return new JSDocCommentImpl([], Range.create(startPosition, startPosition));\n    }\n    const elements: JSDocElement[] = [];\n    while (context.index < context.tokens.length) {\n        const element = parseJSDocElement(context, elements[elements.length - 1]);\n        if (element) {\n            elements.push(element);\n        }\n    }\n    const start = elements[0]?.range.start ?? startPosition;\n    const end = elements[elements.length - 1]?.range.end ?? startPosition;\n    return new JSDocCommentImpl(elements, Range.create(start, end));\n}\n\nfunction parseJSDocElement(context: ParseContext, last?: JSDocElement): JSDocElement | undefined {\n    const next = context.tokens[context.index];\n    if (next.type === 'tag') {\n        return parseJSDocTag(context, false);\n    } else if (next.type === 'text' || next.type === 'inline-tag') {\n        return parseJSDocText(context);\n    } else {\n        appendEmptyLine(next, last);\n        context.index++;\n        return undefined;\n    }\n}\n\nfunction appendEmptyLine(token: JSDocToken, element?: JSDocElement): void {\n    if (element) {\n        const line = new JSDocLineImpl('', token.range);\n        if ('inlines' in element) {\n            element.inlines.push(line);\n        } else {\n            element.content.inlines.push(line);\n        }\n    }\n}\n\nfunction parseJSDocText(context: ParseContext): JSDocParagraph {\n    let token = context.tokens[context.index];\n    const firstToken = token;\n    let lastToken = token;\n    const lines: JSDocInline[] = [];\n    while (token && token.type !== 'break' && token.type !== 'tag') {\n        lines.push(parseJSDocInline(context));\n        lastToken = token;\n        token = context.tokens[context.index];\n    }\n    return new JSDocTextImpl(lines, Range.create(firstToken.range.start, lastToken.range.end));\n}\n\nfunction parseJSDocInline(context: ParseContext): JSDocInline {\n    const token = context.tokens[context.index];\n    if (token.type === 'inline-tag') {\n        return parseJSDocTag(context, true);\n    } else {\n        return parseJSDocLine(context);\n    }\n}\n\nfunction parseJSDocTag(context: ParseContext, inline: boolean): JSDocTag {\n    const tagToken = context.tokens[context.index++];\n    const name = tagToken.content.substring(1);\n    const nextToken = context.tokens[context.index];\n    if (nextToken?.type === 'text') {\n        if (inline) {\n            const docLine = parseJSDocLine(context);\n            return new JSDocTagImpl(\n                name,\n                new JSDocTextImpl([docLine], docLine.range),\n                inline,\n                Range.create(tagToken.range.start, docLine.range.end)\n            );\n        } else {\n            const textDoc = parseJSDocText(context);\n            return new JSDocTagImpl(\n                name,\n                textDoc,\n                inline,\n                Range.create(tagToken.range.start, textDoc.range.end)\n            );\n        }\n    } else {\n        const range = tagToken.range;\n        return new JSDocTagImpl(name, new JSDocTextImpl([], range), inline, range);\n    }\n}\n\nfunction parseJSDocLine(context: ParseContext): JSDocLine {\n    const token = context.tokens[context.index++];\n    return new JSDocLineImpl(token.content, token.range);\n}\n\ninterface NormalizedOptions {\n    start?: RegExp\n    end?: RegExp\n    line?: RegExp\n}\n\ninterface TokenizationContext {\n    position: Position\n    lines: string[]\n    options: NormalizedOptions\n}\n\ninterface ParseContext {\n    position: Position\n    tokens: JSDocToken[]\n    index: number\n}\n\nfunction normalizeOptions(options?: JSDocParseOptions): NormalizedOptions {\n    if (!options) {\n        return normalizeOptions({\n            start: '/**',\n            end: '*/',\n            line: '*'\n        });\n    }\n    const { start, end, line } = options;\n    return {\n        start: normalizeOption(start, true),\n        end: normalizeOption(end, false),\n        line: normalizeOption(line, true)\n    };\n}\n\nfunction normalizeOption(option: RegExp | string | undefined, start: boolean): RegExp | undefined {\n    if (typeof option === 'string' || typeof option === 'object') {\n        const escaped = typeof option === 'string' ? escapeRegExp(option) : option.source;\n        if (start) {\n            return new RegExp(`^\\\\s*${escaped}`);\n        } else {\n            return new RegExp(`\\\\s*${escaped}\\\\s*$`);\n        }\n    } else {\n        return option;\n    }\n}\n\nclass JSDocCommentImpl implements JSDocComment {\n\n    readonly elements: JSDocElement[];\n    readonly range: Range;\n\n    constructor(elements: JSDocElement[], range: Range) {\n        this.elements = elements;\n        this.range = range;\n    }\n\n    getTag(name: string): JSDocTag | undefined {\n        return this.getAllTags().find(e => e.name === name);\n    }\n\n    getTags(name: string): JSDocTag[] {\n        return this.getAllTags().filter(e => e.name === name);\n    }\n\n    private getAllTags(): JSDocTag[] {\n        return this.elements.filter(e => 'name' in e);\n    }\n\n    toString(): string {\n        let value = '';\n        for (const element of this.elements) {\n            if (value.length === 0) {\n                value = element.toString();\n            } else {\n                const text = element.toString();\n                value += fillNewlines(value) + text;\n            }\n        }\n        return value.trim();\n    }\n\n    toMarkdown(options?: JSDocRenderOptions): string {\n        let value = '';\n        for (const element of this.elements) {\n            if (value.length === 0) {\n                value = element.toMarkdown(options);\n            } else {\n                const text = element.toMarkdown(options);\n                value += fillNewlines(value) + text;\n            }\n        }\n        return value.trim();\n    }\n}\n\nclass JSDocTagImpl implements JSDocTag {\n    name: string;\n    content: JSDocParagraph;\n    range: Range;\n    inline: boolean;\n\n    constructor(name: string, content: JSDocParagraph, inline: boolean, range: Range) {\n        this.name = name;\n        this.content = content;\n        this.inline = inline;\n        this.range = range;\n    }\n\n    toString(): string {\n        let text = `@${this.name}`;\n        const content = this.content.toString();\n        if (this.content.inlines.length === 1) {\n            text = `${text} ${content}`;\n        } else if (this.content.inlines.length > 1) {\n            text = `${text}\\n${content}`;\n        }\n        if (this.inline) {\n            // Inline tags are surrounded by curly braces\n            return `{${text}}`;\n        } else {\n            return text;\n        }\n    }\n\n    toMarkdown(options?: JSDocRenderOptions): string {\n        return options?.renderTag?.(this) ?? this.toMarkdownDefault(options);\n    }\n\n    private toMarkdownDefault(options?: JSDocRenderOptions): string {\n        const content = this.content.toMarkdown(options);\n        if (this.inline) {\n            const rendered = renderInlineTag(this.name, content, options ?? {});\n            if (typeof rendered === 'string') {\n                return rendered;\n            }\n        }\n        let marker = '';\n        if (options?.tag === 'italic' || options?.tag === undefined) {\n            marker = '*';\n        } else if (options?.tag === 'bold') {\n            marker = '**';\n        } else if (options?.tag === 'bold-italic') {\n            marker = '***';\n        }\n        let text = `${marker}@${this.name}${marker}`;\n        if (this.content.inlines.length === 1) {\n            text = `${text} \u2014 ${content}`;\n        } else if (this.content.inlines.length > 1) {\n            text = `${text}\\n${content}`;\n        }\n        if (this.inline) {\n            // Inline tags are surrounded by curly braces\n            return `{${text}}`;\n        } else {\n            return text;\n        }\n    }\n}\n\nfunction renderInlineTag(tag: string, content: string, options: JSDocRenderOptions): string | undefined {\n    if (tag === 'linkplain' || tag === 'linkcode' || tag === 'link') {\n        const index = content.indexOf(' ');\n        let display = content;\n        if (index > 0) {\n            const displayStart = skipWhitespace(content, index);\n            display = content.substring(displayStart);\n            content = content.substring(0, index);\n        }\n        if (tag === 'linkcode' || (tag === 'link' && options.link === 'code')) {\n            // Surround the display value in a markdown inline code block\n            display = `\\`${display}\\``;\n        }\n        const renderedLink = options.renderLink?.(content, display) ?? renderLinkDefault(content, display);\n        return renderedLink;\n    }\n    return undefined;\n}\n\nfunction renderLinkDefault(content: string, display: string): string {\n    try {\n        URI.parse(content, true);\n        return `[${display}](${content})`;\n    } catch {\n        return content;\n    }\n}\n\nclass JSDocTextImpl implements JSDocParagraph {\n    inlines: JSDocInline[];\n    range: Range;\n\n    constructor(lines: JSDocInline[], range: Range) {\n        this.inlines = lines;\n        this.range = range;\n    }\n\n    toString(): string {\n        let text = '';\n        for (let i = 0; i < this.inlines.length; i++) {\n            const inline = this.inlines[i];\n            const next = this.inlines[i + 1];\n            text += inline.toString();\n            if (next && next.range.start.line > inline.range.start.line) {\n                text += '\\n';\n            }\n        }\n        return text;\n    }\n\n    toMarkdown(options?: JSDocRenderOptions): string {\n        let text = '';\n        for (let i = 0; i < this.inlines.length; i++) {\n            const inline = this.inlines[i];\n            const next = this.inlines[i + 1];\n            text += inline.toMarkdown(options);\n            if (next && next.range.start.line > inline.range.start.line) {\n                text += '\\n';\n            }\n        }\n        return text;\n    }\n}\n\nclass JSDocLineImpl implements JSDocLine {\n    text: string;\n    range: Range;\n\n    constructor(text: string, range: Range) {\n        this.text = text;\n        this.range = range;\n    }\n\n    toString(): string {\n        return this.text;\n    }\n    toMarkdown(): string {\n        return this.text;\n    }\n\n}\n\nfunction fillNewlines(text: string): string {\n    if (text.endsWith('\\n')) {\n        return '\\n';\n    } else {\n        return '\\n\\n';\n    }\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, AstNodeDescription } from '../syntax-tree.js';\nimport type { IndexManager } from '../workspace/index-manager.js';\nimport type { CommentProvider } from './comment-provider.js';\nimport type { JSDocTag } from './jsdoc.js';\nimport { getDocument } from '../utils/ast-utils.js';\nimport { isJSDoc, parseJSDoc } from './jsdoc.js';\n\n/**\n * Provides documentation for AST nodes.\n */\nexport interface DocumentationProvider {\n    /**\n     * Returns a markdown documentation string for the specified AST node.\n     *\n     * The default implementation `JSDocDocumentationProvider` will inspect the comment associated with the specified node.\n     */\n    getDocumentation(node: AstNode): string | undefined;\n}\n\nexport class JSDocDocumentationProvider implements DocumentationProvider {\n\n    protected readonly indexManager: IndexManager;\n    protected readonly commentProvider: CommentProvider;\n\n    constructor(services: LangiumCoreServices) {\n        this.indexManager = services.shared.workspace.IndexManager;\n        this.commentProvider = services.documentation.CommentProvider;\n    }\n\n    getDocumentation(node: AstNode): string | undefined {\n        const comment = this.commentProvider.getComment(node);\n        if (comment && isJSDoc(comment)) {\n            const parsedJSDoc = parseJSDoc(comment);\n            return parsedJSDoc.toMarkdown({\n                renderLink: (link, display) => {\n                    return this.documentationLinkRenderer(node, link, display);\n                },\n                renderTag: (tag) => {\n                    return this.documentationTagRenderer(node, tag);\n                }\n            });\n        }\n        return undefined;\n    }\n\n    protected documentationLinkRenderer(node: AstNode, name: string, display: string): string | undefined {\n        const description = this.findNameInLocalSymbols(node, name) ?? this.findNameInGlobalScope(node, name);\n        if (description && description.nameSegment) {\n            const line = description.nameSegment.range.start.line + 1;\n            const character = description.nameSegment.range.start.character + 1;\n            const uri = description.documentUri.with({ fragment: `L${line},${character}` });\n            return `[${display}](${uri.toString()})`;\n        } else {\n            return undefined;\n        }\n    }\n\n    protected documentationTagRenderer(_node: AstNode, _tag: JSDocTag): string | undefined {\n        // Fall back to the default tag rendering\n        return undefined;\n    }\n\n    protected findNameInLocalSymbols(node: AstNode, name: string): AstNodeDescription | undefined {\n        const document = getDocument(node);\n        const precomputed = document.localSymbols;\n        if (!precomputed) {\n            return undefined;\n        }\n        let currentNode: AstNode | undefined = node;\n        do {\n            const allDescriptions = precomputed.getStream(currentNode);\n            const description = allDescriptions.find(e => e.name === name);\n            if (description) {\n                return description;\n            }\n            currentNode = currentNode.$container;\n        } while (currentNode);\n\n        return undefined;\n    }\n\n    protected findNameInGlobalScope(node: AstNode, name: string): AstNodeDescription | undefined {\n        const description = this.indexManager.allElements().find(e => e.name === name);\n        return description;\n    }\n}\n", "/******************************************************************************\n * Copyright 2024 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nexport { type Event, Emitter } from 'vscode-languageserver-protocol';\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode } from '../syntax-tree.js';\nimport type { LangiumParser, ParseResult } from './langium-parser.js';\nimport type { Hydrator } from '../serializer/hydrator.js';\nimport type { Event } from '../utils/event.js';\nimport { Deferred, OperationCancelled } from '../utils/promise-utils.js';\nimport { Emitter } from '../utils/event.js';\n\n/**\n * Async parser that allows cancellation of the current parsing process.\n *\n * @remarks\n * The sync parser implementation is blocking the event loop, which can become quite problematic for large files.\n * The default implementation is not actually async. It just wraps the sync parser in a promise. A real implementation would create worker threads or web workers to offload the parsing work.\n */\nexport interface AsyncParser {\n    /**\n     * Parses the given text and returns the parse result.\n     *\n     * @param text The text to parse.\n     * @param cancelToken A cancellation token that can be used to cancel the parsing process.\n     * @returns A promise that resolves to the parse result.\n     *\n     * @throws `OperationCancelled` if the parsing process is cancelled.\n     */\n    parse<T extends AstNode>(text: string, cancelToken: CancellationToken): Promise<ParseResult<T>>;\n}\n\n/**\n * Default implementation of the async parser which simply wraps the sync parser in a promise.\n *\n * @remarks\n * A real implementation would create worker threads or web workers to offload the parsing work.\n */\nexport class DefaultAsyncParser implements AsyncParser {\n\n    protected readonly syncParser: LangiumParser;\n\n    constructor(services: LangiumCoreServices) {\n        this.syncParser = services.parser.LangiumParser;\n    }\n\n    parse<T extends AstNode>(text: string, _cancelToken: CancellationToken): Promise<ParseResult<T>> {\n        return Promise.resolve(this.syncParser.parse<T>(text));\n    }\n}\n\nexport abstract class AbstractThreadedAsyncParser implements AsyncParser {\n\n    /**\n     * The thread count determines how many threads are used to parse files in parallel.\n     * The default value is 8. Decreasing this value increases startup performance, but decreases parallel parsing performance.\n     */\n    protected threadCount = 8;\n    /**\n     * The termination delay determines how long the parser waits for a thread to finish after a cancellation request.\n     * The default value is 200(ms).\n     */\n    protected terminationDelay = 200;\n    protected workerPool: ParserWorker[] = [];\n    protected queue: Array<Deferred<ParserWorker>> = [];\n\n    protected readonly hydrator: Hydrator;\n\n    constructor(services: LangiumCoreServices) {\n        this.hydrator = services.serializer.Hydrator;\n    }\n\n    protected initializeWorkers(): void {\n        while (this.workerPool.length < this.threadCount) {\n            const worker = this.createWorker();\n            worker.onReady(() => {\n                if (this.queue.length > 0) {\n                    const deferred = this.queue.shift();\n                    if (deferred) {\n                        worker.lock();\n                        deferred.resolve(worker);\n                    }\n                }\n            });\n            this.workerPool.push(worker);\n        }\n    }\n\n    async parse<T extends AstNode>(text: string, cancelToken: CancellationToken): Promise<ParseResult<T>> {\n        const worker = await this.acquireParserWorker(cancelToken);\n        const deferred = new Deferred<ParseResult<T>>();\n        let timeout: NodeJS.Timeout | undefined;\n        // If the cancellation token is requested, we wait for a certain time before terminating the worker.\n        // Since the cancellation token lives longer than the parsing process, we need to dispose the event listener.\n        // Otherwise, we might accidentally terminate the worker after the parsing process has finished.\n        const cancellation = cancelToken.onCancellationRequested(() => {\n            timeout = setTimeout(() => {\n                this.terminateWorker(worker);\n            }, this.terminationDelay);\n        });\n        worker.parse(text).then(result => {\n            const hydrated = this.hydrator.hydrate<T>(result);\n            deferred.resolve(hydrated);\n        }).catch(err => {\n            deferred.reject(err);\n        }).finally(() => {\n            cancellation.dispose();\n            clearTimeout(timeout);\n        });\n        return deferred.promise;\n    }\n\n    protected terminateWorker(worker: ParserWorker): void {\n        worker.terminate();\n        const index = this.workerPool.indexOf(worker);\n        if (index >= 0) {\n            this.workerPool.splice(index, 1);\n        }\n    }\n\n    protected async acquireParserWorker(cancelToken: CancellationToken): Promise<ParserWorker> {\n        this.initializeWorkers();\n        for (const worker of this.workerPool) {\n            if (worker.ready) {\n                worker.lock();\n                return worker;\n            }\n        }\n        const deferred = new Deferred<ParserWorker>();\n        cancelToken.onCancellationRequested(() => {\n            const index = this.queue.indexOf(deferred);\n            if (index >= 0) {\n                this.queue.splice(index, 1);\n            }\n            deferred.reject(OperationCancelled);\n        });\n        this.queue.push(deferred);\n        return deferred.promise;\n    }\n\n    protected abstract createWorker(): ParserWorker;\n}\n\nexport type WorkerMessagePost = (message: unknown) => void;\nexport type WorkerMessageCallback = (cb: (message: unknown) => void) => void;\n\nexport class ParserWorker {\n\n    protected readonly sendMessage: WorkerMessagePost;\n    protected readonly _terminate: () => void;\n    protected readonly onReadyEmitter = new Emitter<void>();\n\n    protected deferred = new Deferred<ParseResult>();\n    protected _ready = true;\n    protected _parsing = false;\n\n    get ready(): boolean {\n        return this._ready;\n    }\n\n    get onReady(): Event<void> {\n        return this.onReadyEmitter.event;\n    }\n\n    constructor(sendMessage: WorkerMessagePost, onMessage: WorkerMessageCallback, onError: WorkerMessageCallback, terminate: () => void) {\n        this.sendMessage = sendMessage;\n        this._terminate = terminate;\n        onMessage(result => {\n            const parseResult = result as ParseResult;\n            this.deferred.resolve(parseResult);\n            this.unlock();\n        });\n        onError(error => {\n            this.deferred.reject(error);\n            this.unlock();\n        });\n    }\n\n    terminate(): void {\n        this.deferred.reject(OperationCancelled);\n        this._terminate();\n    }\n\n    lock(): void {\n        this._ready = false;\n    }\n\n    unlock(): void {\n        this._parsing = false;\n        this._ready = true;\n        this.onReadyEmitter.fire();\n    }\n\n    parse(text: string): Promise<ParseResult> {\n        if (this._parsing) {\n            throw new Error('Parser worker is busy');\n        }\n        this._parsing = true;\n        this.deferred = new Deferred();\n        this.sendMessage(text);\n        return this.deferred.promise;\n    }\n}\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { ILexerErrorMessageProvider, ILexingError, IMultiModeLexerDefinition, IToken, TokenType, TokenTypeDictionary, TokenVocabulary } from 'chevrotain';\nimport type { LangiumCoreServices } from '../services.js';\nimport { Lexer as ChevrotainLexer, defaultLexerErrorProvider } from 'chevrotain';\nimport type { LexingReport, TokenBuilder } from './token-builder.js';\n\nexport class DefaultLexerErrorMessageProvider implements ILexerErrorMessageProvider {\n\n    buildUnexpectedCharactersMessage(fullText: string, startOffset: number, length: number, line?: number, column?: number): string {\n        return defaultLexerErrorProvider.buildUnexpectedCharactersMessage(fullText, startOffset, length, line, column);\n    }\n\n    buildUnableToPopLexerModeMessage(token: IToken): string {\n        return defaultLexerErrorProvider.buildUnableToPopLexerModeMessage(token);\n    }\n}\n\nexport interface LexerResult {\n    /**\n     * A list of all tokens that were lexed from the input.\n     *\n     * Note that Langium requires the optional properties\n     * `startLine`, `startColumn`, `endOffset`, `endLine` and `endColumn` to be set on each token.\n     */\n    tokens: IToken[];\n    /**\n     * Contains hidden tokens, usually comments.\n     */\n    hidden: IToken[];\n    errors: ILexingError[];\n    report?: LexingReport;\n}\n\nexport type TokenizeMode = 'full' | 'partial';\n\nexport interface TokenizeOptions {\n    mode?: TokenizeMode;\n}\n\nexport const DEFAULT_TOKENIZE_OPTIONS: TokenizeOptions = { mode: 'full' };\n\nexport interface Lexer {\n    readonly definition: TokenTypeDictionary;\n    tokenize(text: string, options?: TokenizeOptions): LexerResult;\n}\n\nexport class DefaultLexer implements Lexer {\n\n    protected readonly tokenBuilder: TokenBuilder;\n    protected readonly errorMessageProvider: ILexerErrorMessageProvider;\n    protected tokenTypes: TokenTypeDictionary;\n    protected chevrotainLexer: ChevrotainLexer;\n\n    constructor(services: LangiumCoreServices) {\n        this.errorMessageProvider = services.parser.LexerErrorMessageProvider;\n        this.tokenBuilder = services.parser.TokenBuilder;\n        const tokens = this.tokenBuilder.buildTokens(services.Grammar, {\n            caseInsensitive: services.LanguageMetaData.caseInsensitive\n        });\n        this.tokenTypes = this.toTokenTypeDictionary(tokens);\n        const lexerTokens = isTokenTypeDictionary(tokens) ? Object.values(tokens) : tokens;\n        const production = services.LanguageMetaData.mode === 'production';\n        this.chevrotainLexer = new ChevrotainLexer(lexerTokens, {\n            positionTracking: 'full',\n            skipValidations: production,\n            errorMessageProvider: this.errorMessageProvider\n        });\n    }\n\n    get definition(): TokenTypeDictionary {\n        return this.tokenTypes;\n    }\n\n    tokenize(text: string, _options: TokenizeOptions = DEFAULT_TOKENIZE_OPTIONS): LexerResult {\n        const chevrotainResult = this.chevrotainLexer.tokenize(text);\n        return {\n            tokens: chevrotainResult.tokens,\n            errors: chevrotainResult.errors,\n            hidden: chevrotainResult.groups.hidden ?? [],\n            report: this.tokenBuilder.flushLexingReport?.(text)\n        };\n    }\n\n    protected toTokenTypeDictionary(buildTokens: TokenVocabulary): TokenTypeDictionary {\n        if (isTokenTypeDictionary(buildTokens)) return buildTokens;\n        const tokens = isIMultiModeLexerDefinition(buildTokens) ? Object.values(buildTokens.modes).flat() : buildTokens;\n        const res: TokenTypeDictionary = {};\n        tokens.forEach(token => res[token.name] = token);\n        return res;\n    }\n}\n\n/**\n * Returns a check whether the given TokenVocabulary is TokenType array\n */\nexport function isTokenTypeArray(tokenVocabulary: TokenVocabulary): tokenVocabulary is TokenType[] {\n    return Array.isArray(tokenVocabulary) && (tokenVocabulary.length === 0 || 'name' in tokenVocabulary[0]);\n}\n\n/**\n * Returns a check whether the given TokenVocabulary is IMultiModeLexerDefinition\n */\nexport function isIMultiModeLexerDefinition(tokenVocabulary: TokenVocabulary): tokenVocabulary is IMultiModeLexerDefinition {\n    return tokenVocabulary && 'modes' in tokenVocabulary && 'defaultMode' in tokenVocabulary;\n}\n\n/**\n * Returns a check whether the given TokenVocabulary is TokenTypeDictionary\n */\nexport function isTokenTypeDictionary(tokenVocabulary: TokenVocabulary): tokenVocabulary is TokenTypeDictionary {\n    return !isTokenTypeArray(tokenVocabulary) && !isIMultiModeLexerDefinition(tokenVocabulary);\n}\n", "/******************************************************************************\n * Copyright 2024 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\n/* eslint-disable @typescript-eslint/no-explicit-any */\n\nimport type { TokenType } from 'chevrotain';\nimport { CompositeCstNodeImpl, LeafCstNodeImpl, RootCstNodeImpl } from '../parser/cst-node-builder.js';\nimport { isAbstractElement, type AbstractElement, type Grammar } from '../languages/generated/ast.js';\nimport type { Linker } from '../references/linker.js';\nimport type { Lexer } from '../parser/lexer.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport type { ParseResult } from '../parser/langium-parser.js';\nimport type { Reference, AstNode, CstNode, LeafCstNode, GenericAstNode, Mutable, RootCstNode } from '../syntax-tree.js';\nimport { isRootCstNode, isCompositeCstNode, isLeafCstNode, isAstNode, isReference } from '../syntax-tree.js';\nimport { streamAst } from '../utils/ast-utils.js';\nimport { BiMap } from '../utils/collections.js';\nimport { streamCst } from '../utils/cst-utils.js';\nimport type { LexingReport } from '../parser/token-builder.js';\n\n/**\n * The hydrator service is responsible for allowing AST parse results to be sent across worker threads.\n */\nexport interface Hydrator {\n    /**\n     * Converts a parse result to a plain object. The resulting object can be sent across worker threads.\n     */\n    dehydrate(result: ParseResult<AstNode>): ParseResult<object>;\n    /**\n     * Converts a plain object to a parse result. The included AST node can then be used in the main thread.\n     * Calling this method on objects that have not been dehydrated first will result in undefined behavior.\n     */\n    hydrate<T extends AstNode = AstNode>(result: ParseResult<object>): ParseResult<T>;\n}\n\nexport interface DehydrateContext {\n    astNodes: Map<AstNode, any>;\n    cstNodes: Map<CstNode, any>;\n}\n\nexport interface HydrateContext {\n    astNodes: Map<any, AstNode>;\n    cstNodes: Map<any, CstNode>;\n}\n\nexport class DefaultHydrator implements Hydrator {\n\n    protected readonly grammar: Grammar;\n    protected readonly lexer: Lexer;\n    protected readonly linker: Linker;\n\n    protected readonly grammarElementIdMap = new BiMap<AbstractElement, number>();\n    protected readonly tokenTypeIdMap = new BiMap<number, TokenType>();\n\n    constructor(services: LangiumCoreServices) {\n        this.grammar = services.Grammar;\n        this.lexer = services.parser.Lexer;\n        this.linker = services.references.Linker;\n    }\n\n    dehydrate(result: ParseResult<AstNode>): ParseResult<object> {\n        return {\n            lexerErrors: result.lexerErrors,\n            lexerReport: result.lexerReport ? this.dehydrateLexerReport(result.lexerReport) : undefined,\n            // We need to create shallow copies of the errors\n            // The original errors inherit from the `Error` class, which is not transferable across worker threads\n            parserErrors: result.parserErrors.map(e => ({ ...e, message: e.message })),\n            value: this.dehydrateAstNode(result.value, this.createDehyrationContext(result.value))\n        };\n    }\n\n    protected dehydrateLexerReport(lexerReport: LexingReport): LexingReport {\n        // By default, lexer reports are serializable\n        return lexerReport;\n    }\n\n    protected createDehyrationContext(node: AstNode): DehydrateContext {\n        const astNodes = new Map<AstNode, any>();\n        const cstNodes = new Map<CstNode, any>();\n        for (const astNode of streamAst(node)) {\n            astNodes.set(astNode, {});\n        }\n        if (node.$cstNode) {\n            for (const cstNode of streamCst(node.$cstNode)) {\n                cstNodes.set(cstNode, {});\n            }\n        }\n        return {\n            astNodes,\n            cstNodes\n        };\n    }\n\n    protected dehydrateAstNode(node: AstNode, context: DehydrateContext): object {\n        const obj = context.astNodes.get(node) as Record<string, any>;\n        obj.$type = node.$type;\n        obj.$containerIndex = node.$containerIndex;\n        obj.$containerProperty = node.$containerProperty;\n        if (node.$cstNode !== undefined) {\n            obj.$cstNode = this.dehydrateCstNode(node.$cstNode, context);\n        }\n        for (const [name, value] of Object.entries(node)) {\n            if (name.startsWith('$')) {\n                continue;\n            }\n            if (Array.isArray(value)) {\n                const arr: any[] = [];\n                obj[name] = arr;\n                for (const item of value) {\n                    if (isAstNode(item)) {\n                        arr.push(this.dehydrateAstNode(item, context));\n                    } else if (isReference(item)) {\n                        arr.push(this.dehydrateReference(item, context));\n                    } else {\n                        arr.push(item);\n                    }\n                }\n            } else if (isAstNode(value)) {\n                obj[name] = this.dehydrateAstNode(value, context);\n            } else if (isReference(value)) {\n                obj[name] = this.dehydrateReference(value, context);\n            } else if (value !== undefined) {\n                obj[name] = value;\n            }\n        }\n        return obj;\n    }\n\n    protected dehydrateReference(reference: Reference, context: DehydrateContext): any {\n        const obj: Record<string, unknown> = {};\n        obj.$refText = reference.$refText;\n        if (reference.$refNode) {\n            obj.$refNode = context.cstNodes.get(reference.$refNode);\n        }\n        return obj;\n    }\n\n    protected dehydrateCstNode(node: CstNode, context: DehydrateContext): any {\n        const cstNode = context.cstNodes.get(node) as Record<string, any>;\n        if (isRootCstNode(node)) {\n            cstNode.fullText = node.fullText;\n        } else {\n            // Note: This returns undefined for hidden nodes (i.e. comments)\n            cstNode.grammarSource = this.getGrammarElementId(node.grammarSource);\n        }\n        cstNode.hidden = node.hidden;\n        cstNode.astNode = context.astNodes.get(node.astNode);\n        if (isCompositeCstNode(node)) {\n            cstNode.content = node.content.map(child => this.dehydrateCstNode(child, context));\n        } else if (isLeafCstNode(node)) {\n            cstNode.tokenType = node.tokenType.name;\n            cstNode.offset = node.offset;\n            cstNode.length = node.length;\n            cstNode.startLine = node.range.start.line;\n            cstNode.startColumn = node.range.start.character;\n            cstNode.endLine = node.range.end.line;\n            cstNode.endColumn = node.range.end.character;\n        }\n        return cstNode;\n    }\n\n    hydrate<T extends AstNode = AstNode>(result: ParseResult<object>): ParseResult<T> {\n        const node = result.value;\n        const context = this.createHydrationContext(node);\n        if ('$cstNode' in node) {\n            this.hydrateCstNode(node.$cstNode, context);\n        }\n        return {\n            lexerErrors: result.lexerErrors,\n            lexerReport: result.lexerReport,\n            parserErrors: result.parserErrors,\n            value: this.hydrateAstNode(node, context) as T\n        };\n    }\n\n    protected createHydrationContext(node: any): HydrateContext {\n        const astNodes = new Map<any, AstNode>();\n        const cstNodes = new Map<any, CstNode>();\n        for (const astNode of streamAst(node)) {\n            astNodes.set(astNode, {} as AstNode);\n        }\n        let root: RootCstNode;\n        if (node.$cstNode) {\n            for (const cstNode of streamCst(node.$cstNode)) {\n                let cst: Mutable<CstNode> | undefined;\n                if ('fullText' in cstNode) {\n                    cst = new RootCstNodeImpl(cstNode.fullText as string);\n                    root = cst as RootCstNode;\n                } else if ('content' in cstNode) {\n                    cst = new CompositeCstNodeImpl();\n                } else if ('tokenType' in cstNode) {\n                    cst = this.hydrateCstLeafNode(cstNode);\n                }\n                if (cst) {\n                    cstNodes.set(cstNode, cst);\n                    cst.root = root!;\n                }\n            }\n        }\n        return {\n            astNodes,\n            cstNodes\n        };\n    }\n\n    protected hydrateAstNode(node: any, context: HydrateContext): AstNode {\n        const astNode = context.astNodes.get(node) as Mutable<GenericAstNode>;\n        astNode.$type = node.$type;\n        astNode.$containerIndex = node.$containerIndex;\n        astNode.$containerProperty = node.$containerProperty;\n        if (node.$cstNode) {\n            astNode.$cstNode = context.cstNodes.get(node.$cstNode);\n        }\n        for (const [name, value] of Object.entries(node)) {\n            if (name.startsWith('$')) {\n                continue;\n            }\n            if (Array.isArray(value)) {\n                const arr: unknown[] = [];\n                astNode[name] = arr;\n                for (const item of value) {\n                    if (isAstNode(item)) {\n                        arr.push(this.setParent(this.hydrateAstNode(item, context), astNode));\n                    } else if (isReference(item)) {\n                        arr.push(this.hydrateReference(item, astNode, name, context));\n                    } else {\n                        arr.push(item);\n                    }\n                }\n            } else if (isAstNode(value)) {\n                astNode[name] = this.setParent(this.hydrateAstNode(value, context), astNode);\n            } else if (isReference(value)) {\n                astNode[name] = this.hydrateReference(value, astNode, name, context);\n            } else if (value !== undefined) {\n                astNode[name] = value;\n            }\n        }\n        return astNode;\n    }\n\n    protected setParent(node: any, parent: any): any {\n        node.$container = parent as AstNode;\n        return node;\n    }\n\n    protected hydrateReference(reference: any, node: AstNode, name: string, context: HydrateContext): Reference {\n        return this.linker.buildReference(node, name, context.cstNodes.get(reference.$refNode)!, reference.$refText);\n    }\n\n    protected hydrateCstNode(cstNode: any, context: HydrateContext, num = 0): CstNode {\n        const cstNodeObj = context.cstNodes.get(cstNode) as Mutable<CstNode>;\n        if (typeof cstNode.grammarSource === 'number') {\n            cstNodeObj.grammarSource = this.getGrammarElement(cstNode.grammarSource);\n        }\n        cstNodeObj.astNode = context.astNodes.get(cstNode.astNode)!;\n        if (isCompositeCstNode(cstNodeObj)) {\n            for (const child of cstNode.content) {\n                const hydrated = this.hydrateCstNode(child, context, num++);\n                cstNodeObj.content.push(hydrated);\n            }\n        }\n        return cstNodeObj;\n    }\n\n    protected hydrateCstLeafNode(cstNode: any): LeafCstNode {\n        const tokenType = this.getTokenType(cstNode.tokenType);\n        const offset = cstNode.offset;\n        const length = cstNode.length;\n        const startLine = cstNode.startLine;\n        const startColumn = cstNode.startColumn;\n        const endLine = cstNode.endLine;\n        const endColumn = cstNode.endColumn;\n        const hidden = cstNode.hidden;\n        const node = new LeafCstNodeImpl(\n            offset,\n            length,\n            {\n                start: {\n                    line: startLine,\n                    character: startColumn\n                },\n                end: {\n                    line: endLine,\n                    character: endColumn\n                }\n            },\n            tokenType,\n            hidden\n        );\n        return node;\n    }\n\n    protected getTokenType(name: string): TokenType {\n        return this.lexer.definition[name];\n    }\n\n    protected getGrammarElementId(node: AbstractElement | undefined): number | undefined {\n        if (!node) {\n            return undefined;\n        }\n        if (this.grammarElementIdMap.size === 0) {\n            this.createGrammarElementIdMap();\n        }\n        return this.grammarElementIdMap.get(node);\n    }\n\n    protected getGrammarElement(id: number): AbstractElement | undefined {\n        if (this.grammarElementIdMap.size === 0) {\n            this.createGrammarElementIdMap();\n        }\n        const element = this.grammarElementIdMap.getKey(id);\n        return element;\n    }\n\n    protected createGrammarElementIdMap(): void {\n        let id = 0;\n        for (const element of streamAst(this.grammar)) {\n            if (isAbstractElement(element)) {\n                this.grammarElementIdMap.set(element, id++);\n            }\n        }\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nexport interface Disposable {\n    /**\n     * Dispose this object.\n     */\n    dispose(): void;\n}\n\nexport interface AsyncDisposable {\n    /**\n     * Dispose this object.\n     */\n    dispose(): Promise<void>;\n}\n\nexport namespace Disposable {\n    export function create(callback: () => Promise<void>): AsyncDisposable;\n    export function create(callback: () => void): Disposable;\n    export function create(callback: () => void | Promise<void>): Disposable | AsyncDisposable {\n        return {\n            dispose: async () => await callback()\n        };\n    }\n}\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { URI } from '../utils/uri-utils.js';\n\nexport interface FileSystemNode {\n    readonly isFile: boolean;\n    readonly isDirectory: boolean;\n    readonly uri: URI;\n}\n\nexport type FileSystemFilter = (node: FileSystemNode) => boolean;\n\n/**\n * Provides methods to interact with an abstract file system. The default implementation is based on the node.js `fs` API.\n */\nexport interface FileSystemProvider {\n    /**\n     * Gets the status of a file or directory.\n     * The status includes meta data such as whether the node is a file or directory.\n     * @param uri The URI of the file or directory.\n     */\n    stat(uri: URI): Promise<FileSystemNode>;\n    /**\n     * Gets the status of a file or directory synchronously.\n     * The status includes meta data such as whether the node is a file or directory.\n     * @param uri The URI of the file or directory.\n     */\n    statSync(uri: URI): FileSystemNode;\n    /**\n     * Checks if a file exists at the specified URI.\n     * @returns `true` if a file exists at the specified URI, `false` otherwise.\n     */\n    exists(uri: URI): Promise<boolean>;\n    /**\n     * Checks if a file exists at the specified URI synchronously.\n     * @returns `true` if a file exists at the specified URI, `false` otherwise.\n     */\n    existsSync(uri: URI): boolean;\n    /**\n     * Reads a binary file asynchronously from a given URI.\n     * @returns The binary content of the file with the specified URI.\n     */\n    readBinary(uri: URI): Promise<Uint8Array>;\n    /**\n     * Reads a binary file synchronously from a given URI.\n     * @returns The binary content of the file with the specified URI.\n     */\n    readBinarySync(uri: URI): Uint8Array;\n    /**\n     * Reads a document asynchronously from a given URI.\n     * @returns The string content of the file with the specified URI.\n     */\n    readFile(uri: URI): Promise<string>;\n    /**\n     * Reads a document synchronously from a given URI.\n     * @returns The string content of the file with the specified\n     */\n    readFileSync(uri: URI): string;\n    /**\n     * Reads the directory information for the given URI.\n     * @returns The list of file system entries that are contained within the specified directory.\n     */\n    readDirectory(uri: URI): Promise<FileSystemNode[]>;\n    /**\n     * Reads the directory information for the given URI synchronously.\n     * @returns The list of file system entries that are contained within the specified directory.\n     */\n    readDirectorySync(uri: URI): FileSystemNode[];\n}\n\nexport class EmptyFileSystemProvider implements FileSystemProvider {\n\n    stat(_uri: URI): Promise<FileSystemNode> {\n        throw new Error('No file system is available.');\n    }\n\n    statSync(_uri: URI): FileSystemNode {\n        throw new Error('No file system is available.');\n    }\n    async exists(): Promise<boolean> {\n        return false;\n    }\n\n    existsSync(): boolean {\n        return false;\n    }\n\n    readBinary(): Promise<Uint8Array> {\n        throw new Error('No file system is available.');\n    }\n\n    readBinarySync(): Uint8Array {\n        throw new Error('No file system is available.');\n    }\n\n    readFile(): Promise<string> {\n        throw new Error('No file system is available.');\n    }\n\n    readFileSync(): string {\n        throw new Error('No file system is available.');\n    }\n\n    async readDirectory(): Promise<FileSystemNode[]> {\n        return [];\n    }\n\n    readDirectorySync(): FileSystemNode[] {\n        return [];\n    }\n\n}\n\nexport const EmptyFileSystem = {\n    fileSystemProvider: () => new EmptyFileSystemProvider()\n};\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { createDefaultCoreModule, createDefaultSharedCoreModule } from '../default-module.js';\nimport type { Module } from '../dependency-injection.js';\nimport { inject } from '../dependency-injection.js';\nimport * as ast from '../languages/generated/ast.js';\nimport type { LangiumCoreServices, LangiumSharedCoreServices, PartialLangiumCoreServices, PartialLangiumSharedCoreServices } from '../services.js';\nimport type { Mutable } from '../syntax-tree.js';\nimport { EmptyFileSystem } from '../workspace/file-system-provider.js';\nimport { URI } from './uri-utils.js';\n\nconst minimalGrammarModule: Module<LangiumCoreServices, PartialLangiumCoreServices> = {\n    Grammar: () => undefined as unknown as ast.Grammar,\n    LanguageMetaData: () => ({\n        caseInsensitive: false,\n        fileExtensions: ['.langium'],\n        languageId: 'langium'\n    })\n};\n\nconst minimalSharedGrammarModule: Module<LangiumSharedCoreServices, PartialLangiumSharedCoreServices> = {\n    AstReflection: () => new ast.LangiumGrammarAstReflection()\n};\n\nfunction createMinimalGrammarServices(): LangiumCoreServices {\n    const shared = inject(\n        createDefaultSharedCoreModule(EmptyFileSystem),\n        minimalSharedGrammarModule\n    );\n    const grammar = inject(\n        createDefaultCoreModule({ shared }),\n        minimalGrammarModule\n    );\n    shared.ServiceRegistry.register(grammar);\n    return grammar;\n}\n\n/**\n * Load a Langium grammar for your language from a JSON string. This is used by several services,\n * most notably the parser builder which interprets the grammar to create a parser.\n */\nexport function loadGrammarFromJson(json: string): ast.Grammar {\n    const services = createMinimalGrammarServices();\n    const astNode = services.serializer.JsonSerializer.deserialize(json) as Mutable<ast.Grammar>;\n    services.shared.workspace.LangiumDocumentFactory.fromModel(astNode, URI.parse(`memory:/${astNode.name ?? 'grammar'}.langium`));\n    return astNode;\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { URI } from '../utils/uri-utils.js';\nimport type { NameProvider } from '../references/name-provider.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, AstNodeDescription, ReferenceInfo } from '../syntax-tree.js';\nimport type { AstNodeLocator } from './ast-node-locator.js';\nimport type { DocumentSegment, LangiumDocument } from './documents.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { isMultiReference, isReference } from '../syntax-tree.js';\nimport { getDocument, streamAst, streamReferences } from '../utils/ast-utils.js';\nimport { toDocumentSegment } from '../utils/cst-utils.js';\nimport { interruptAndCheck } from '../utils/promise-utils.js';\nimport { UriUtils } from '../utils/uri-utils.js';\n\n/**\n * Language-specific service for creating descriptions of AST nodes to be used for cross-reference resolutions.\n */\nexport interface AstNodeDescriptionProvider {\n\n    /**\n     * Create a description for the given AST node. This service method is typically used while indexing\n     * the contents of a document and during scope computation.\n     *\n     * @param node An AST node.\n     * @param name The name to be used to refer to the AST node. By default, this is determined by the\n     *     `NameProvider` service, but alternative names may be provided according to the semantics\n     *     of your language.\n     * @param document The document containing the AST node. If omitted, it is taken from the root AST node.\n     */\n    createDescription(node: AstNode, name: string | undefined, document?: LangiumDocument): AstNodeDescription;\n\n}\n\nexport class DefaultAstNodeDescriptionProvider implements AstNodeDescriptionProvider {\n\n    protected readonly astNodeLocator: AstNodeLocator;\n    protected readonly nameProvider: NameProvider;\n\n    constructor(services: LangiumCoreServices) {\n        this.astNodeLocator = services.workspace.AstNodeLocator;\n        this.nameProvider = services.references.NameProvider;\n    }\n\n    createDescription(node: AstNode, name: string | undefined, document?: LangiumDocument): AstNodeDescription {\n        const doc = document ?? getDocument(node);\n        name ??= this.nameProvider.getName(node);\n        const path = this.astNodeLocator.getAstNodePath(node);\n        if (!name) {\n            throw new Error(`Node at path ${path} has no name.`);\n        }\n        let nameNodeSegment: DocumentSegment | undefined;\n        const nameSegmentGetter = () => nameNodeSegment ??= toDocumentSegment(this.nameProvider.getNameNode(node) ?? node.$cstNode);\n        return {\n            node,\n            name,\n            get nameSegment() {\n                return nameSegmentGetter();\n            },\n            selectionSegment: toDocumentSegment(node.$cstNode),\n            type: node.$type,\n            documentUri: doc.uri,\n            path\n        };\n    }\n\n}\n\n/**\n * Describes a cross-reference within a document or between two documents.\n */\nexport interface ReferenceDescription {\n    /** URI of the document that holds a reference */\n    sourceUri: URI\n    /** Path to AstNode that holds a reference */\n    sourcePath: string\n    /** Target document uri */\n    targetUri: URI\n    /** Path to the target AstNode inside the document */\n    targetPath: string\n    /** Segment of the reference text. */\n    segment: DocumentSegment\n    /** Marks a local reference i.e. a cross reference inside a document.   */\n    local?: boolean\n}\n\n/**\n * Language-specific service to create descriptions of all cross-references in a document. These are used by the `IndexManager`\n * to determine which documents are affected and should be rebuilt when a document is changed.\n */\nexport interface ReferenceDescriptionProvider {\n    /**\n     * Create descriptions of all cross-references found in the given document. These descriptions are\n     * gathered by the `IndexManager` and stored in the global index so they can be considered when\n     * a document change is reported by the client.\n     *\n     * @param document The document in which to gather cross-references.\n     * @param cancelToken Indicates when to cancel the current operation.\n     * @throws `OperationCanceled` if a user action occurs during execution\n     */\n    createDescriptions(document: LangiumDocument, cancelToken?: CancellationToken): Promise<ReferenceDescription[]>;\n}\n\nexport class DefaultReferenceDescriptionProvider implements ReferenceDescriptionProvider {\n\n    protected readonly nodeLocator: AstNodeLocator;\n\n    constructor(services: LangiumCoreServices) {\n        this.nodeLocator = services.workspace.AstNodeLocator;\n    }\n\n    async createDescriptions(document: LangiumDocument, cancelToken = CancellationToken.None): Promise<ReferenceDescription[]> {\n        const descr: ReferenceDescription[] = [];\n        const rootNode = document.parseResult.value;\n        for (const astNode of streamAst(rootNode)) {\n            await interruptAndCheck(cancelToken);\n            streamReferences(astNode).forEach(refInfo => {\n                if (!refInfo.reference.error) {\n                    descr.push(...this.createInfoDescriptions(refInfo));\n                }\n            });\n        }\n        return descr;\n    }\n\n    protected createInfoDescriptions(refInfo: ReferenceInfo): ReferenceDescription[] {\n        const reference = refInfo.reference;\n        if (reference.error || !reference.$refNode) {\n            return [];\n        }\n        let items: AstNodeDescription[] = [];\n        if (isReference(reference) && reference.$nodeDescription) {\n            items = [reference.$nodeDescription];\n        } else if (isMultiReference(reference)) {\n            items = reference.items.map(e => e.$nodeDescription).filter(e => e !== undefined);\n        }\n        const sourceUri = getDocument(refInfo.container).uri;\n        const sourcePath = this.nodeLocator.getAstNodePath(refInfo.container);\n        const descriptions: ReferenceDescription[] = [];\n        const segment = toDocumentSegment(reference.$refNode);\n        for (const item of items) {\n            descriptions.push({\n                sourceUri,\n                sourcePath,\n                targetUri: item.documentUri,\n                targetPath: item.path,\n                segment,\n                local: UriUtils.equals(item.documentUri, sourceUri)\n            });\n        }\n        return descriptions;\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { AstNode } from '../syntax-tree.js';\n\n/**\n * Language-specific service for locating an `AstNode` in a document.\n */\nexport interface AstNodeLocator {\n\n    /**\n     * Creates a path represented by a `string` that identifies an `AstNode` inside its document.\n     * It must be possible to retrieve exactly the same `AstNode` from the document using this path.\n     *\n     * @param node The `AstNode` for which to create the path.\n     * @returns a path represented by a `string` that identifies `node` inside its document.\n     * @see {@link getAstNode}\n     */\n    getAstNodePath(node: AstNode): string;\n\n    /**\n     * Locates an `AstNode` inside another node by following the given path.\n     *\n     * @param node Parent element.\n     * @param path Describes how to locate the `AstNode` inside the given `node`.\n     * @returns The `AstNode` located under the given path, or `undefined` if the path cannot be resolved.\n     * @see {@link getAstNodePath}\n     */\n    getAstNode<T extends AstNode = AstNode>(node: AstNode, path: string): T | undefined;\n\n}\n\nexport class DefaultAstNodeLocator implements AstNodeLocator {\n    protected segmentSeparator = '/';\n    protected indexSeparator = '@';\n\n    getAstNodePath(node: AstNode): string {\n        if (node.$container) {\n            const containerPath = this.getAstNodePath(node.$container);\n            const newSegment = this.getPathSegment(node);\n            const nodePath = containerPath + this.segmentSeparator + newSegment;\n            return nodePath;\n        }\n        return '';\n    }\n\n    protected getPathSegment({ $containerProperty, $containerIndex }: AstNode): string {\n        if (!$containerProperty) {\n            throw new Error(\"Missing '$containerProperty' in AST node.\");\n        }\n        if ($containerIndex !== undefined) {\n            return $containerProperty + this.indexSeparator + $containerIndex;\n        }\n        return $containerProperty;\n    }\n\n    getAstNode<T extends AstNode = AstNode>(node: AstNode, path: string): T | undefined {\n        const segments = path.split(this.segmentSeparator);\n        return segments.reduce((previousValue, currentValue) => {\n            if (!previousValue || currentValue.length === 0) {\n                return previousValue;\n            }\n            const propertyIndex = currentValue.indexOf(this.indexSeparator);\n            if (propertyIndex > 0) {\n                const property = currentValue.substring(0, propertyIndex);\n                const arrayIndex = parseInt(currentValue.substring(propertyIndex + 1));\n                const array = (previousValue as unknown as Record<string, AstNode[]>)[property];\n                return array?.[arrayIndex];\n            }\n            return (previousValue as unknown as Record<string, AstNode>)[currentValue];\n        }, node) as T;\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { Emitter } from '../utils/event.js';\nimport type {\n    ConfigurationItem,\n    DidChangeConfigurationParams,\n    DidChangeConfigurationRegistrationOptions,\n    Disposable,\n    Event,\n    InitializeParams,\n    InitializedParams\n} from 'vscode-languageserver-protocol';\nimport type { ServiceRegistry } from '../service-registry.js';\nimport type { LangiumSharedCoreServices } from '../services.js';\nimport { Deferred } from '../utils/promise-utils.js';\n\n/* eslint-disable @typescript-eslint/no-explicit-any */\n\nexport interface ConfigurationProvider {\n\n    /**\n     * A promise that resolves when the configuration provider is ready to be used.\n     */\n    readonly ready: Promise<void>;\n\n    /**\n     * When used in a language server context, this method is called when the server receives\n     * the `initialize` request.\n     */\n    initialize(params: InitializeParams): void;\n\n    /**\n     * When used in a language server context, this method is called when the server receives\n     * the `initialized` notification.\n     */\n    initialized(params: ConfigurationInitializedParams): Promise<void>;\n\n    /**\n     * Returns a configuration value stored for the given language.\n     *\n     * @param language The language id\n     * @param configuration Configuration name\n     */\n    getConfiguration(language: string, configuration: string): Promise<any>;\n\n    /**\n     *  Updates the cached configurations using the `change` notification parameters.\n     *\n     * @param change The parameters of a change configuration notification.\n     * `settings` property of the change object could be expressed as `Record<string, Record<string, any>>`\n     */\n    updateConfiguration(change: DidChangeConfigurationParams): void;\n\n    /**\n     * Get notified after a configuration section has been updated.\n     */\n    onConfigurationSectionUpdate(callback: ConfigurationSectionUpdateListener): Disposable\n}\n\nexport interface ConfigurationInitializedParams extends InitializedParams {\n    register?: (params: DidChangeConfigurationRegistrationOptions) => void,\n    fetchConfiguration?: (configuration: ConfigurationItem[]) => Promise<any>\n}\n\nexport interface ConfigurationSectionUpdate {\n    /**\n     * The name of the configuration section that has been updated.\n     */\n    section: string;\n\n    /**\n     * The updated configuration section.\n     */\n    configuration: any;\n}\n\nexport type ConfigurationSectionUpdateListener = (update: ConfigurationSectionUpdate) => void;\n\n/**\n * Base configuration provider for building up other configuration providers\n */\nexport class DefaultConfigurationProvider implements ConfigurationProvider {\n\n    protected readonly serviceRegistry: ServiceRegistry;\n    protected readonly _ready = new Deferred<void>();\n    protected readonly onConfigurationSectionUpdateEmitter = new Emitter<ConfigurationSectionUpdate>();\n    protected settings: Record<string, Record<string, any>> = {};\n    protected workspaceConfig = false;\n\n    constructor(services: LangiumSharedCoreServices) {\n        this.serviceRegistry = services.ServiceRegistry;\n    }\n\n    get ready(): Promise<void> {\n        return this._ready.promise;\n    }\n\n    initialize(params: InitializeParams): void {\n        this.workspaceConfig = params.capabilities.workspace?.configuration ?? false;\n    }\n\n    async initialized(params: ConfigurationInitializedParams): Promise<void> {\n        if (this.workspaceConfig) {\n            if (params.register) {\n                // params.register(...) is a function to be provided by the calling language server for the sake of\n                //  decoupling this implementation from the concrete LSP implementations, specifically the LSP Connection\n\n                const languages = this.serviceRegistry.all;\n                params.register({\n                    // Listen to configuration changes for all languages\n                    section: languages.map(lang => this.toSectionName(lang.LanguageMetaData.languageId))\n                });\n            }\n\n            if (params.fetchConfiguration) {\n                // params.fetchConfiguration(...) is a function to be provided by the calling language server for the sake of\n                //  decoupling this implementation from the concrete LSP implementations, specifically the LSP Connection\n                const configToUpdate = this.serviceRegistry.all.map(lang => <ConfigurationItem>{\n                    // Fetch the configuration changes for all languages\n                    section: this.toSectionName(lang.LanguageMetaData.languageId)\n                });\n\n                // get workspace configurations (default scope URI)\n                const configs = await params.fetchConfiguration(configToUpdate);\n                configToUpdate.forEach((conf, idx) => {\n                    this.updateSectionConfiguration(conf.section!, configs[idx]);\n                });\n            }\n        }\n        this._ready.resolve();\n    }\n\n    /**\n     *  Updates the cached configurations using the `change` notification parameters.\n     *\n     * @param change The parameters of a change configuration notification.\n     * `settings` property of the change object could be expressed as `Record<string, Record<string, any>>`\n     */\n    updateConfiguration(change: DidChangeConfigurationParams): void {\n        if (typeof change.settings !== 'object' || change.settings === null) {\n            return;\n        }\n        Object.entries(change.settings).forEach(([section, configuration]) => {\n            this.updateSectionConfiguration(section, configuration);\n            this.onConfigurationSectionUpdateEmitter.fire({ section, configuration });\n        });\n    }\n\n    protected updateSectionConfiguration(section: string, configuration: any): void {\n        this.settings[section] = configuration;\n    }\n\n    /**\n    * Returns a configuration value stored for the given language.\n    *\n    * @param language The language id\n    * @param configuration Configuration name\n    */\n    async getConfiguration(language: string, configuration: string): Promise<any> {\n        await this.ready;\n\n        const sectionName = this.toSectionName(language);\n        if (this.settings[sectionName]) {\n            return this.settings[sectionName][configuration];\n        }\n    }\n\n    protected toSectionName(languageId: string): string {\n        return `${languageId}`;\n    }\n\n    get onConfigurationSectionUpdate(): Event<ConfigurationSectionUpdate> {\n        return this.onConfigurationSectionUpdateEmitter.event;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { LSPErrorCodes, ResponseError } from 'vscode-languageserver-protocol';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { Disposable } from '../utils/disposable.js';\nimport type { ServiceRegistry } from '../service-registry.js';\nimport type { LangiumSharedCoreServices } from '../services.js';\nimport type { AstNode } from '../syntax-tree.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { Deferred } from '../utils/promise-utils.js';\nimport type { ValidationOptions } from '../validation/document-validator.js';\nimport type { IndexManager } from '../workspace/index-manager.js';\nimport type { LangiumDocument, LangiumDocuments, LangiumDocumentFactory, TextDocumentProvider } from './documents.js';\nimport { MultiMap } from '../utils/collections.js';\nimport { OperationCancelled, interruptAndCheck, isOperationCancelled } from '../utils/promise-utils.js';\nimport { stream } from '../utils/stream.js';\nimport { UriUtils, type URI } from '../utils/uri-utils.js';\nimport type { ValidationCategory } from '../validation/validation-registry.js';\nimport { DocumentState } from './documents.js';\nimport type { FileSystemProvider } from './file-system-provider.js';\nimport type { WorkspaceManager } from './workspace-manager.js';\n\nexport interface BuildOptions {\n    /**\n     * Control the linking and references indexing phase with this option. The default if not specified is `true`.\n     * If set to `false`, references can still be resolved - that's done lazily when you access the `ref` property of\n     * a reference. But you won't get any diagnostics for linking errors and the references won't be considered\n     * when updating other documents.\n     */\n    eagerLinking?: boolean\n\n    /**\n     * Control the validation phase with this option:\n     *  - `true` enables all validation checks and forces revalidating the documents\n     *    In order to include additional, custom validation categories, override `DefaultDocumentBuilder.getAllValidationCategories(...)`.\n     *  - `false` or `undefined` disables all validation checks\n     *  - An object runs only the necessary validation checks; the `categories` property restricts this to a specific subset (which might include custom categories as well).\n     */\n    validation?: boolean | ValidationOptions\n}\n\nexport interface DocumentBuildState {\n    /** Whether a document has completed its last build process. */\n    completed: boolean\n    /** The options used for the last build process. */\n    options: BuildOptions\n    /** Additional information about the last build result. */\n    result?: {\n        validationChecks?: ValidationCategory[]\n    }\n}\n\n/**\n * Shared-service for building and updating `LangiumDocument`s.\n */\nexport interface DocumentBuilder {\n\n    /** The options used for rebuilding documents after an update. */\n    updateBuildOptions: BuildOptions;\n\n    /**\n     * Execute all necessary build steps for the given documents.\n     *\n     * @param documents Set of documents to be built.\n     * @param options Options for the document builder.\n     * @param cancelToken Indicates when to cancel the current operation.\n     * @throws `OperationCanceled` if a user action occurs during execution\n     */\n    build<T extends AstNode>(documents: Array<LangiumDocument<T>>, options?: BuildOptions, cancelToken?: CancellationToken): Promise<void>;\n\n    /**\n     * This method is called when a document change is detected. It updates the state of all\n     * affected documents, including those with references to the changed ones, so they are rebuilt.\n     *\n     * @param changed URIs of changed or created documents\n     * @param deleted URIs of deleted documents\n     * @param cancelToken allows to cancel the current operation\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     */\n    update(changed: URI[], deleted: URI[], cancelToken?: CancellationToken): Promise<void>;\n\n    /**\n     * Notify the given callback when a document update was triggered, but before any document\n     * is rebuilt. Listeners to this event should not perform any long-running task.\n     */\n    onUpdate(callback: DocumentUpdateListener): Disposable;\n\n    /**\n     * Reset the state of a document to the specified state, removing any derived data as needed.\n     *\n     * @param document The document to reset.\n     * @param state The state to reset the document to.\n     */\n    resetToState<T extends AstNode>(document: LangiumDocument<T>, state: DocumentState): void;\n\n    /**\n     * Notify the given callback when a set of documents has been built reaching the specified target state.\n     */\n    onBuildPhase(targetState: DocumentState, callback: DocumentBuildListener): Disposable;\n\n    /**\n     * Notify the specified callback when a document has been built reaching the specified target state.\n     * Unlike {@link onBuildPhase} the listener is called for every single document.\n     *\n     * There are two main advantages compared to {@link onBuildPhase}:\n     * 1. If the build is cancelled, {@link onDocumentPhase} will still fire for documents that have reached a specific state.\n     *    Meanwhile, {@link onBuildPhase} won't fire for that state.\n     * 2. The {@link DocumentBuilder} ensures that all {@link DocumentPhaseListener} instances are called for a built document.\n     *    Even if the build is cancelled before those listeners were called.\n     */\n    onDocumentPhase(targetState: DocumentState, callback: DocumentPhaseListener): Disposable;\n\n    /**\n     * Wait until the workspace has reached the specified state for all documents.\n     *\n     * @param state The desired state. The promise won't resolve until all documents have reached this state\n     * @param cancelToken Optionally allows to cancel the wait operation, disposing any listeners in the process\n     * @throws `OperationCancelled` if cancellation has been requested before the state has been reached\n     */\n    waitUntil(state: DocumentState, cancelToken?: CancellationToken): Promise<void>;\n\n    /**\n     * Wait until the document specified by the {@link uri} has reached the specified state.\n     *\n     * @param state The desired state. The promise won't resolve until the document has reached this state.\n     * @param uri The specified URI that points to the document. If the URI does not exist, the promise will resolve once the workspace has reached the specified state.\n     * @param cancelToken Optionally allows to cancel the wait operation, disposing any listeners in the process.\n     * @return The URI of the document that has reached the desired state, or `undefined` if the document does not exist.\n     * @throws `OperationCancelled` if cancellation has been requested before the state has been reached\n     */\n    waitUntil(state: DocumentState, uri?: URI, cancelToken?: CancellationToken): Promise<URI | undefined>;\n}\n\nexport type DocumentUpdateListener = (changed: URI[], deleted: URI[]) => void | Promise<void>\nexport type DocumentBuildListener = (built: LangiumDocument[], cancelToken: CancellationToken) => void | Promise<void>\nexport type DocumentPhaseListener = (built: LangiumDocument, cancelToken: CancellationToken) => void | Promise<void>\nexport class DefaultDocumentBuilder implements DocumentBuilder {\n\n    updateBuildOptions: BuildOptions = {\n        // Default: run only the built-in validation checks and those in the _fast_ category (includes those without category)\n        validation: {\n            categories: ['built-in', 'fast']\n        }\n    };\n\n    protected readonly langiumDocuments: LangiumDocuments;\n    protected readonly langiumDocumentFactory: LangiumDocumentFactory;\n    protected readonly textDocuments: TextDocumentProvider | undefined;\n    protected readonly indexManager: IndexManager;\n    protected readonly fileSystemProvider: FileSystemProvider;\n    protected readonly workspaceManager: () => WorkspaceManager;\n    protected readonly serviceRegistry: ServiceRegistry;\n\n    protected readonly updateListeners: DocumentUpdateListener[] = [];\n    protected readonly buildPhaseListeners = new MultiMap<DocumentState, DocumentBuildListener>();\n    protected readonly documentPhaseListeners = new MultiMap<DocumentState, DocumentPhaseListener>();\n    protected readonly buildState = new Map<string, DocumentBuildState>();\n    protected readonly documentBuildWaiters = new Map<string, Deferred<void>>();\n    protected currentState = DocumentState.Changed;\n\n    constructor(services: LangiumSharedCoreServices) {\n        this.langiumDocuments = services.workspace.LangiumDocuments;\n        this.langiumDocumentFactory = services.workspace.LangiumDocumentFactory;\n        this.textDocuments = services.workspace.TextDocuments;\n        this.indexManager = services.workspace.IndexManager;\n        this.fileSystemProvider = services.workspace.FileSystemProvider;\n        this.workspaceManager = () => services.workspace.WorkspaceManager;\n        this.serviceRegistry = services.ServiceRegistry;\n    }\n\n    async build<T extends AstNode>(documents: Array<LangiumDocument<T>>, options: BuildOptions = {}, cancelToken = CancellationToken.None): Promise<void> {\n        for (const document of documents) {\n            const key = document.uri.toString();\n            if (document.state === DocumentState.Validated) {\n                if (typeof options.validation === 'boolean' && options.validation) {\n                    // Force re-running all validation checks\n                    this.resetToState(document, DocumentState.IndexedReferences);\n                } else if (typeof options.validation === 'object') {\n                    // Validation with explicit options was requested for a document that has already been partly validated.\n                    // In this case, we need to execute only the missing validation categories.\n                    const categories = this.findMissingValidationCategories(document, options);\n                    if (categories.length > 0) {\n                        // Validate this document, since some of the requested validation categories are not executed yet.\n                        //  In all other cases/else-branches, the document is not build at all.\n                        this.buildState.set(key, {\n                            completed: false,\n                            options: {\n                                validation: {\n                                    categories\n                                }\n                            },\n                            result: this.buildState.get(key)?.result,\n                        });\n                        // Reset the state, but keep the existing validation markers of the already completed validation categories.\n                        document.state = DocumentState.IndexedReferences;\n                    }\n                }\n            } else {\n                // Default: forget any previous build options\n                this.buildState.delete(key);\n            }\n        }\n        this.currentState = DocumentState.Changed;\n        await this.emitUpdate(documents.map(e => e.uri), []);\n        await this.buildDocuments(documents, options, cancelToken);\n    }\n\n    async update(changed: URI[], deleted: URI[], cancelToken = CancellationToken.None): Promise<void> {\n        this.currentState = DocumentState.Changed;\n        // Remove all metadata of documents that are reported as deleted\n        const deletedUris: URI[] = [];\n        for (const deletedUri of deleted) {\n            // Since the deleted URI might point to a directory, we delete all documents within\n            const deletedDocs = this.langiumDocuments.deleteDocuments(deletedUri);\n            for (const doc of deletedDocs) {\n                deletedUris.push(doc.uri);\n                this.cleanUpDeleted(doc);\n            }\n        }\n        // Since the changed URI might point to a directory, we need to check all (nested) documents in that directory\n        const changedUris = (await Promise.all(changed.map(uri => this.findChangedUris(uri)))).flat();\n        // Set the state of all changed documents to `Changed` so they are completely rebuilt\n        for (const changedUri of changedUris) {\n            let changedDocument = this.langiumDocuments.getDocument(changedUri);\n            if (changedDocument === undefined) {\n                // We create an unparsed, invalid document.\n                // This will be parsed as soon as we reach the first document builder phase.\n                // This allows to cancel the parsing process later in case we need it.\n                changedDocument = this.langiumDocumentFactory.fromModel({ $type: 'INVALID' }, changedUri);\n                changedDocument.state = DocumentState.Changed; // required, since `langiumDocumentFactory.fromModel` marks the new document as `DocumentState.Parsed`\n                this.langiumDocuments.addDocument(changedDocument);\n            }\n            this.resetToState(changedDocument, DocumentState.Changed);\n        }\n        // Set the state of all documents that should be relinked to `ComputedScopes` (if not already lower)\n        const allChangedUris = stream(changedUris).concat(deletedUris).map(uri => uri.toString()).toSet();\n        this.langiumDocuments.all\n            .filter(doc => !allChangedUris.has(doc.uri.toString()) && this.shouldRelink(doc, allChangedUris))\n            .forEach(doc => this.resetToState(doc, DocumentState.ComputedScopes));\n        // Notify listeners of the update\n        await this.emitUpdate(changedUris, deletedUris);\n        // Only allow interrupting the execution after all state changes are done\n        await interruptAndCheck(cancelToken);\n\n        // Collect and sort all documents that we should rebuild\n        const rebuildDocuments = this.sortDocuments(\n            this.langiumDocuments.all\n                .filter(doc =>\n                    // This includes those that were reported as changed and those that we selected for relinking\n                    doc.state < DocumentState.Validated\n                    // This includes those for which a previous build has been cancelled\n                    || !this.buildState.get(doc.uri.toString())?.completed\n                    // `updateBuildOptions` changed between the last build (which is completed) and the current build,\n                    //  leading to incomplete results, e.g. some validation categories are requested, which are not executed during the last build\n                    || this.resultsAreIncomplete(doc, this.updateBuildOptions)\n                )\n                .toArray()\n        );\n        await this.buildDocuments(rebuildDocuments, this.updateBuildOptions, cancelToken);\n    }\n\n    protected resultsAreIncomplete(document: LangiumDocument, options: BuildOptions | undefined): boolean {\n        return this.findMissingValidationCategories(document, options).length >= 1;\n    }\n\n    protected findMissingValidationCategories(document: LangiumDocument, options: BuildOptions | undefined): ValidationCategory[] {\n        const state = this.buildState.get(document.uri.toString());\n        const allCategories = this.serviceRegistry.getServices(document.uri).validation.ValidationRegistry.getAllValidationCategories(document);\n        const executedCategories = state?.result?.validationChecks ? new Set(state?.result?.validationChecks) : state?.completed ? allCategories : new Set();\n        const requestedCategories = (options === undefined || options.validation === true) ? allCategories\n            : typeof options.validation === 'object' ? (options.validation.categories ?? allCategories) : [];\n        return stream(requestedCategories).filter(requested => !executedCategories.has(requested)).toArray();\n    }\n\n    protected async findChangedUris(changed: URI): Promise<URI[]> {\n        // Most common case is that the document/textDocument at the specified URI has changed\n        const document = this.langiumDocuments.getDocument(changed) ?? this.textDocuments?.get(changed);\n        if (document) {\n            return [changed];\n        }\n        // If the document doesn't exist yet, we need to check what kind of file has changed\n        try {\n            const stat = await this.fileSystemProvider.stat(changed);\n            if (stat.isDirectory) {\n                // If a directory has changed, we need to check all documents in that directory\n                const uris = await this.workspaceManager().searchFolder(changed);\n                return uris;\n            } else if (this.workspaceManager().shouldIncludeEntry(stat)) {\n                // Return the changed URI if it's a file that we can handle\n                return [changed];\n            }\n        } catch {\n            // If we can't determine the file type, we discard the change\n        }\n        return [];\n    }\n\n    protected async emitUpdate(changed: URI[], deleted: URI[]): Promise<void> {\n        await Promise.all(this.updateListeners.map(listener => listener(changed, deleted)));\n    }\n\n    /**\n     * Sort the given documents by priority. By default, documents with an open text document are prioritized.\n     * This is useful to ensure that visible documents show their diagnostics before all other documents.\n     *\n     * This improves the responsiveness in large workspaces as users usually don't care about diagnostics\n     * in files that are currently not opened in the editor.\n     */\n    protected sortDocuments(documents: LangiumDocument[]): LangiumDocument[] {\n        let left = 0;\n        let right = documents.length - 1;\n\n        while (left < right) {\n            while (left < documents.length && this.hasTextDocument(documents[left])) {\n                left++;\n            }\n\n            while (right >= 0 && !this.hasTextDocument(documents[right])) {\n                right--;\n            }\n\n            if (left < right) {\n                [documents[left], documents[right]] = [documents[right], documents[left]];\n            }\n        }\n\n        return documents;\n    }\n\n    private hasTextDocument(doc: LangiumDocument): boolean {\n        return Boolean(this.textDocuments?.get(doc.uri));\n    }\n\n    /**\n     * Check whether the given document should be relinked after changes were found in the given URIs.\n     */\n    protected shouldRelink(document: LangiumDocument, changedUris: Set<string>): boolean {\n        // Relink documents with linking errors -- maybe those references can be resolved now\n        if (document.references.some(ref => ref.error !== undefined)) {\n            return true;\n        }\n        // Check whether the document is affected by any of the changed URIs\n        return this.indexManager.isAffected(document, changedUris);\n    }\n\n    onUpdate(callback: DocumentUpdateListener): Disposable {\n        this.updateListeners.push(callback);\n        return Disposable.create(() => {\n            const index = this.updateListeners.indexOf(callback);\n            if (index >= 0) {\n                this.updateListeners.splice(index, 1);\n            }\n        });\n    }\n\n    resetToState<T extends AstNode>(document: LangiumDocument<T>, state: DocumentState): void {\n        switch (state) {\n            case DocumentState.Changed: {\n                // Fall through\n            }\n            case DocumentState.Parsed:\n                this.indexManager.removeContent(document.uri);\n                // Fall through\n            case DocumentState.IndexedContent:\n                document.localSymbols = undefined;\n                // Fall through\n            case DocumentState.ComputedScopes: {\n                const linker = this.serviceRegistry.getServices(document.uri).references.Linker;\n                linker.unlink(document);\n                // Fall through\n            }\n            case DocumentState.Linked:\n                this.indexManager.removeReferences(document.uri);\n                // Fall through\n            case DocumentState.IndexedReferences:\n                document.diagnostics = undefined;\n                this.buildState.delete(document.uri.toString());\n                // Fall through\n            case DocumentState.Validated:\n                // do nothing and keep the buildState\n        }\n        if (document.state > state) {\n            document.state = state;\n        }\n    }\n\n    protected cleanUpDeleted<T extends AstNode>(document: LangiumDocument<T>): void {\n        this.buildState.delete(document.uri.toString());\n        this.indexManager.remove(document.uri);\n        // Since this method `cleanUpDeleted` is not available from outside, the following line is not necessary, since the state is already set before.\n        //  This line does not hurt and makes the code to be in sync with `resetToState`.\n        //  If `cleanUpDeleted` is called in custom document builders at some more places, this line becomes necessary.\n        document.state = DocumentState.Changed;\n    }\n\n    /**\n     * Build the given documents by stepping through all build phases. If a document's state indicates\n     * that a certain build phase is already done, the phase is skipped for that document.\n     *\n     * @param documents The documents to build.\n     * @param options the {@link BuildOptions} to use.\n     * @param cancelToken A cancellation token that can be used to cancel the build.\n     * @returns A promise that resolves when the build is done.\n     */\n    protected async buildDocuments(documents: LangiumDocument[], options: BuildOptions, cancelToken: CancellationToken): Promise<void> {\n        this.prepareBuild(documents, options);\n        // 0. Parse content\n        await this.runCancelable(documents, DocumentState.Parsed, cancelToken, doc =>\n            this.langiumDocumentFactory.update(doc, cancelToken)\n        );\n        // 1. Index content: collect the documents' symbols being accessible by other documents\n        await this.runCancelable(documents, DocumentState.IndexedContent, cancelToken, doc =>\n            this.indexManager.updateContent(doc, cancelToken)\n        );\n        // 2. Local symbols: collect each documents' symbols being accessible within the document (only)\n        await this.runCancelable(documents, DocumentState.ComputedScopes, cancelToken, async doc => {\n            const scopeComputation = this.serviceRegistry.getServices(doc.uri).references.ScopeComputation;\n            doc.localSymbols = await scopeComputation.collectLocalSymbols(doc, cancelToken);\n        });\n        // 3. Linking\n        const toBeLinked = documents.filter(doc => this.shouldLink(doc));\n        await this.runCancelable(toBeLinked, DocumentState.Linked, cancelToken, doc => {\n            const linker = this.serviceRegistry.getServices(doc.uri).references.Linker;\n            return linker.link(doc, cancelToken);\n        });\n        // 4. Index references\n        await this.runCancelable(toBeLinked, DocumentState.IndexedReferences, cancelToken, doc =>\n            this.indexManager.updateReferences(doc, cancelToken)\n        );\n        // 5. Validation\n        const toBeValidated = documents.filter(doc => {\n            if (this.shouldValidate(doc)) {\n                return true; // the build state is marked as completed after finishing the validation for the current document\n            } else {\n                this.markAsCompleted(doc); // since the validation is skipped for this document, it is already completed now\n                return false;\n            }\n        });\n        await this.runCancelable(toBeValidated, DocumentState.Validated, cancelToken, async doc => {\n            await this.validate(doc, cancelToken);\n            this.markAsCompleted(doc);\n        });\n    }\n\n    protected markAsCompleted(document: LangiumDocument): void {\n        const state = this.buildState.get(document.uri.toString());\n        if (state) {\n            state.completed = true;\n        }\n    }\n\n    /**\n     * Runs prior to beginning the build process to update the {@link DocumentBuildState} for each document\n     *\n     * @param documents collection of documents to be built\n     * @param options the {@link BuildOptions} to use\n     */\n    protected prepareBuild(documents: LangiumDocument[], options: BuildOptions): void {\n        for (const doc of documents) {\n            const key = doc.uri.toString();\n            const state = this.buildState.get(key);\n            if (\n                !state             // If the document has no previous build state, we set it.\n                || state.completed // If it has one, but it's already marked as completed, we overwrite it.\n            ) {\n                this.buildState.set(key, {\n                    completed: false,\n                    options,\n                    result: state?.result\n                });\n            } else {\n                // If the previous build was not completed, we keep its DocumentState and continue from the DocumentState where it was cancelled,\n                //  e.g. the previous build options are used, including the previously requested validation categories.\n            }\n        }\n    }\n\n    /**\n     * Runs a cancelable operation on a set of documents to bring them to a specified {@link DocumentState}.\n     *\n     * @param documents The array of documents to process.\n     * @param targetState The target {@link DocumentState} to bring the documents to.\n     * @param cancelToken A token that can be used to cancel the operation.\n     * @param callback A function to be called for each document.\n     * @returns A promise that resolves when all documents have been processed or the operation is canceled.\n     * @throws Will throw `OperationCancelled` if the operation is canceled via a `CancellationToken`.\n     */\n    protected async runCancelable(documents: LangiumDocument[], targetState: DocumentState, cancelToken: CancellationToken,\n        callback: (document: LangiumDocument) => MaybePromise<unknown>): Promise<void> {\n        for (const document of documents) {\n            if (document.state < targetState) {\n                await interruptAndCheck(cancelToken);\n                await callback(document);\n                document.state = targetState;\n                await this.notifyDocumentPhase(document, targetState, cancelToken);\n            }\n        }\n\n        // Do not use `filtered` here, as that will miss documents that have previously reached the current target state.\n        // For example, this happens in case the cancellation triggers between the processing of two documents\n        // or files that were picked up during the workspace initialization.\n        const targetStateDocs = documents.filter(doc => doc.state === targetState);\n        await this.notifyBuildPhase(targetStateDocs, targetState, cancelToken);\n        this.currentState = targetState;\n    }\n\n    onBuildPhase(targetState: DocumentState, callback: DocumentBuildListener): Disposable {\n        this.buildPhaseListeners.add(targetState, callback);\n        return Disposable.create(() => {\n            this.buildPhaseListeners.delete(targetState, callback);\n        });\n    }\n\n    onDocumentPhase(targetState: DocumentState, callback: DocumentPhaseListener): Disposable {\n        this.documentPhaseListeners.add(targetState, callback);\n        return Disposable.create(() => {\n            this.documentPhaseListeners.delete(targetState, callback);\n        });\n    }\n\n    waitUntil(state: DocumentState, cancelToken?: CancellationToken): Promise<void>;\n    waitUntil(state: DocumentState, uri?: URI, cancelToken?: CancellationToken): Promise<URI>;\n    waitUntil(state: DocumentState, uriOrToken?: URI | CancellationToken, cancelToken?: CancellationToken): Promise<URI | void> {\n        let uri: URI | undefined = undefined;\n        if (uriOrToken && 'path' in uriOrToken) {\n            uri = uriOrToken;\n        } else {\n            cancelToken = uriOrToken;\n        }\n        cancelToken ??= CancellationToken.None;\n        if (uri) {\n            return this.awaitDocumentState(state, uri, cancelToken);\n\n        } else {\n            return this.awaitBuilderState(state, cancelToken);\n        }\n    }\n\n    protected awaitDocumentState(state: DocumentState, uri: URI, cancelToken: CancellationToken): Promise<URI> {\n        const document = this.langiumDocuments.getDocument(uri);\n        if (!document) {\n            return Promise.reject(\n                new ResponseError(\n                    LSPErrorCodes.ServerCancelled,\n                    `No document found for URI: ${uri.toString()}`\n                )\n            );\n\n        } else if (document.state >= state) {\n            return Promise.resolve(uri);\n\n        } else if (cancelToken.isCancellationRequested) {\n            return Promise.reject(OperationCancelled);\n\n        } else if (this.currentState >= state && state > document.state) {\n            // this would imply that the document has been excluded from linking or validation, for example;\n            // this should never occur, the LS need to make sure that the affected document is properly built,\n            //  alternatively, the build state requirement need to be relaxed.\n            return Promise.reject(\n                new ResponseError(\n                    LSPErrorCodes.RequestFailed,\n                    `Document state of ${uri.toString()} is ${DocumentState[document.state]}, requiring ${DocumentState[state]}, but workspace state is already ${DocumentState[this.currentState]}. Returning undefined.`\n                )\n            );\n        }\n        return new Promise((resolve, reject) => {\n            const buildDisposable = this.onDocumentPhase(state, (doc) => {\n                if (UriUtils.equals(doc.uri, uri)) {\n                    buildDisposable.dispose();\n                    cancelDisposable.dispose();\n                    resolve(doc.uri);\n                }\n            });\n            const cancelDisposable = cancelToken!.onCancellationRequested(() => {\n                buildDisposable.dispose();\n                cancelDisposable.dispose();\n                reject(OperationCancelled);\n            });\n        });\n    }\n\n    protected awaitBuilderState(state: DocumentState, cancelToken: CancellationToken): Promise<void> {\n        if (this.currentState >= state) {\n            return Promise.resolve();\n        } else if (cancelToken.isCancellationRequested) {\n            return Promise.reject(OperationCancelled);\n        }\n        return new Promise((resolve, reject) => {\n            const buildDisposable = this.onBuildPhase(state, () => {\n                buildDisposable.dispose();\n                cancelDisposable.dispose();\n                resolve();\n            });\n            const cancelDisposable = cancelToken!.onCancellationRequested(() => {\n                buildDisposable.dispose();\n                cancelDisposable.dispose();\n                reject(OperationCancelled);\n            });\n        });\n    }\n\n    protected async notifyDocumentPhase(document: LangiumDocument, state: DocumentState, cancelToken: CancellationToken): Promise<void> {\n        const listeners = this.documentPhaseListeners.get(state);\n        const listenersCopy = listeners.slice();\n        for (const listener of listenersCopy) {\n            try {\n                await interruptAndCheck(cancelToken);\n                await listener(document, cancelToken);\n            } catch (err) {\n                // Ignore cancellation errors\n                // We want to finish the listeners before throwing\n                if (!isOperationCancelled(err)) {\n                    throw err;\n                }\n            }\n        }\n    }\n\n    protected async notifyBuildPhase(documents: LangiumDocument[], state: DocumentState, cancelToken: CancellationToken): Promise<void> {\n        if (documents.length === 0) {\n            // Don't notify when no document has been processed\n            return;\n        }\n        const listeners = this.buildPhaseListeners.get(state);\n        const listenersCopy = listeners.slice();\n        for (const listener of listenersCopy) {\n            await interruptAndCheck(cancelToken);\n            await listener(documents, cancelToken);\n        }\n    }\n\n    /**\n     * Determine whether the given document should be linked during a build. The default\n     * implementation checks the `eagerLinking` property of the build options. If it's set to `true`\n     * or `undefined`, the document is included in the linking phase. This also affects the\n     * references indexing phase, which depends on eager linking.\n     */\n    protected shouldLink(document: LangiumDocument): boolean {\n        return this.getBuildOptions(document).eagerLinking ?? true;\n    }\n\n    /**\n     * Determine whether the given document should be validated during a build. The default\n     * implementation checks the `validation` property of the build options. If it's set to `true`\n     * or a `ValidationOptions` object, the document is included in the validation phase.\n     */\n    protected shouldValidate(document: LangiumDocument): boolean {\n        return Boolean(this.getBuildOptions(document).validation);\n    }\n\n    /**\n     * Run validation checks on the given document and store the resulting diagnostics in the document.\n     * If the document already contains diagnostics, the new ones are added to the list.\n     */\n    protected async validate(document: LangiumDocument, cancelToken: CancellationToken): Promise<void> {\n        const validator = this.serviceRegistry.getServices(document.uri).validation.DocumentValidator;\n        const options = this.getBuildOptions(document);\n        const validationOptions = typeof options.validation === 'object' ? { ...options.validation } : {};\n        validationOptions.categories = this.findMissingValidationCategories(document, options); // execute only not-yet-executed categories\n        const diagnostics = await validator.validateDocument(document, validationOptions, cancelToken);\n        if (document.diagnostics) {\n            document.diagnostics.push(...diagnostics); // keep diagnostics of previously executed categories\n        } else {\n            document.diagnostics = diagnostics;\n        }\n\n        // Store information about the executed validation in the build state\n        const state = this.buildState.get(document.uri.toString());\n        if (state) {\n            state.result ??= {};\n            if (state.result.validationChecks) {\n                state.result.validationChecks = stream(state.result.validationChecks).concat(validationOptions.categories).distinct().toArray();\n            } else {\n                state.result.validationChecks = [...validationOptions.categories];\n            }\n        }\n    }\n\n    protected getBuildOptions(document: LangiumDocument): BuildOptions {\n        return this.buildState.get(document.uri.toString())?.options ?? {};\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { ServiceRegistry } from '../service-registry.js';\nimport type { LangiumSharedCoreServices } from '../services.js';\nimport type { AstNode, AstNodeDescription, AstReflection } from '../syntax-tree.js';\nimport { getDocument } from '../utils/ast-utils.js';\nimport { ContextCache } from '../utils/caching.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport type { Stream } from '../utils/stream.js';\nimport { stream } from '../utils/stream.js';\nimport type { URI } from '../utils/uri-utils.js';\nimport { UriUtils } from '../utils/uri-utils.js';\nimport type { ReferenceDescription } from './ast-descriptions.js';\nimport type { LangiumDocument, LangiumDocuments } from './documents.js';\n\n/**\n * The index manager is responsible for keeping metadata about symbols and cross-references\n * in the workspace. It is used to look up symbols in the global scope, mostly during linking\n * and completion. This service is shared between all languages of a language server.\n */\nexport interface IndexManager {\n\n    /**\n     * Remove the specified document URI from the index.\n     * Necessary when documents are deleted and not referenceable anymore.\n     *\n     * @param uri The URI of the document for which index data shall be removed\n     */\n    remove(uri: URI): void;\n\n    /**\n     * Remove only the information about the exportable content of a document.\n     */\n    removeContent(uri: URI): void;\n\n    /**\n     * Remove only the information about the cross-references of a document.\n     */\n    removeReferences(uri: URI): void;\n\n    /**\n     * Update the information about the exportable content of a document inside the index.\n     *\n     * @param document Document to be updated\n     * @param cancelToken Indicates when to cancel the current operation.\n     * @throws `OperationCanceled` if a user action occurs during execution\n     */\n    updateContent(document: LangiumDocument, cancelToken?: CancellationToken): Promise<void>;\n\n    /**\n     * Update the information about the cross-references of a document inside the index.\n     *\n     * @param document Document to be updated\n     * @param cancelToken Indicates when to cancel the current operation.\n     * @throws `OperationCanceled` if a user action occurs during execution\n     */\n    updateReferences(document: LangiumDocument, cancelToken?: CancellationToken): Promise<void>;\n\n    /**\n     * Determine whether the given document could be affected by changes of the documents\n     * identified by the given URIs (second parameter). The document is typically regarded as\n     * affected if it contains a reference to any of the changed files.\n     *\n     * @param document Document to check whether it's affected\n     * @param changedUris URIs of the changed documents\n     */\n    isAffected(document: LangiumDocument, changedUris: Set<string>): boolean;\n\n    /**\n     * Compute a list of all exported elements, optionally filtered using a type identifier and document URIs.\n     *\n     * @param nodeType The type to filter with, or `undefined` to return descriptions of all types.\n     * @param uris If specified, only returns elements from the given URIs.\n     * @returns a `Stream` containing all globally visible nodes (of a given type).\n     */\n    allElements(nodeType?: string, uris?: Set<string>): Stream<AstNodeDescription>;\n\n    /**\n     * Returns all known references that are pointing to the given `targetNode`.\n     *\n     * @param targetNode the `AstNode` to look up references for\n     * @param astNodePath the path that points to the `targetNode` inside the document. See also `AstNodeLocator`\n     *\n     * @returns a `Stream` of references that are targeting the `targetNode`\n     */\n    findAllReferences(targetNode: AstNode, astNodePath: string): Stream<ReferenceDescription>;\n\n}\n\nexport class DefaultIndexManager implements IndexManager {\n\n    protected readonly serviceRegistry: ServiceRegistry;\n    protected readonly documents: LangiumDocuments;\n    protected readonly astReflection: AstReflection;\n\n    /**\n     * The symbol index stores all `AstNodeDescription` items exported by a document.\n     * The key used in this map is the string representation of the specific document URI.\n     */\n    protected readonly symbolIndex = new Map<string, AstNodeDescription[]>();\n    /**\n     * This is a cache for the `allElements()` method.\n     * It caches the descriptions from `symbolIndex` grouped by types.\n     */\n    protected readonly symbolByTypeIndex = new ContextCache<string, string, AstNodeDescription[]>();\n    /**\n     * This index keeps track of all `ReferenceDescription` items exported by a document.\n     * This is used to compute which elements are affected by a document change\n     * and for finding references to an AST node.\n     */\n    protected readonly referenceIndex = new Map<string, ReferenceDescription[]>();\n\n    constructor(services: LangiumSharedCoreServices) {\n        this.documents = services.workspace.LangiumDocuments;\n        this.serviceRegistry = services.ServiceRegistry;\n        this.astReflection = services.AstReflection;\n    }\n\n    findAllReferences(targetNode: AstNode, astNodePath: string): Stream<ReferenceDescription> {\n        const targetDocUri = getDocument(targetNode).uri;\n        const result: ReferenceDescription[] = [];\n        this.referenceIndex.forEach(docRefs => {\n            docRefs.forEach(refDescr => {\n                if (UriUtils.equals(refDescr.targetUri, targetDocUri) && refDescr.targetPath === astNodePath) {\n                    result.push(refDescr);\n                }\n            });\n        });\n        return stream(result);\n    }\n\n    allElements(nodeType?: string, uris?: Set<string>): Stream<AstNodeDescription> {\n        let documentUris = stream(this.symbolIndex.keys());\n        if (uris) {\n            documentUris = documentUris.filter(uri => !uris || uris.has(uri));\n        }\n        return documentUris\n            .map(uri => this.getFileDescriptions(uri, nodeType))\n            .flat();\n    }\n\n    protected getFileDescriptions(uri: string, nodeType?: string): AstNodeDescription[] {\n        if (!nodeType) {\n            return this.symbolIndex.get(uri) ?? [];\n        }\n        const descriptions = this.symbolByTypeIndex.get(uri, nodeType, () => {\n            const allFileDescriptions = this.symbolIndex.get(uri) ?? [];\n            return allFileDescriptions.filter(e => this.astReflection.isSubtype(e.type, nodeType));\n        });\n        return descriptions;\n    }\n\n    remove(uri: URI): void {\n        this.removeContent(uri);\n        this.removeReferences(uri);\n    }\n\n    removeContent(uri: URI): void {\n        const uriString = uri.toString();\n        this.symbolIndex.delete(uriString);\n        this.symbolByTypeIndex.clear(uriString);\n    }\n\n    removeReferences(uri: URI): void {\n        const uriString = uri.toString();\n        this.referenceIndex.delete(uriString);\n    }\n\n    async updateContent(document: LangiumDocument, cancelToken = CancellationToken.None): Promise<void> {\n        const services = this.serviceRegistry.getServices(document.uri);\n        const exports = await services.references.ScopeComputation.collectExportedSymbols(document, cancelToken);\n        const uri = document.uri.toString();\n        this.symbolIndex.set(uri, exports);\n        this.symbolByTypeIndex.clear(uri);\n    }\n\n    async updateReferences(document: LangiumDocument, cancelToken = CancellationToken.None): Promise<void> {\n        const services = this.serviceRegistry.getServices(document.uri);\n        const indexData = await services.workspace.ReferenceDescriptionProvider.createDescriptions(document, cancelToken);\n        this.referenceIndex.set(document.uri.toString(), indexData);\n    }\n\n    isAffected(document: LangiumDocument, changedUris: Set<string>): boolean {\n        const references = this.referenceIndex.get(document.uri.toString());\n        if (!references) {\n            return false;\n        }\n        return references.some(ref => !ref.local && changedUris.has(ref.targetUri.toString()));\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { type AbstractCancellationTokenSource, CancellationToken, CancellationTokenSource } from '../utils/cancellation.js';\nimport { Deferred, isOperationCancelled, startCancelableOperation, type MaybePromise } from '../utils/promise-utils.js';\n\n/**\n * Utility service to execute mutually exclusive actions.\n */\nexport interface WorkspaceLock {\n    /**\n     * Performs a single async action, like initializing the workspace or processing document changes.\n     * Only one action will be executed at a time.\n     *\n     * When another action is queued up, the token provided for the action will be cancelled.\n     * Assuming the action makes use of this token, the next action only has to wait for the current action to finish cancellation.\n     */\n    write(action: (token: CancellationToken) => MaybePromise<void>): Promise<void>;\n\n    /**\n     * Performs a single action, like computing completion results or providing workspace symbols.\n     * Read actions will only be executed after all write actions have finished. They will be executed in parallel if possible.\n     *\n     * If a write action is currently running, the read action will be queued up and executed afterwards.\n     * If a new write action is queued up while a read action is waiting, the write action will receive priority and will be handled before the read action.\n     *\n     * Note that read actions are not allowed to modify anything in the workspace. Please use {@link write} instead.\n     */\n    read<T>(action: () => MaybePromise<T>): Promise<T>;\n\n    /**\n     * Cancels the last queued write action. All previous write actions already have been cancelled.\n     */\n    cancelWrite(): void;\n}\n\ntype LockAction<T = void> = (token: CancellationToken) => MaybePromise<T>;\n\ninterface LockEntry {\n    action: LockAction<unknown>;\n    deferred: Deferred<unknown>;\n    cancellationToken: CancellationToken;\n}\n\nexport class DefaultWorkspaceLock implements WorkspaceLock {\n\n    private previousTokenSource: AbstractCancellationTokenSource = new CancellationTokenSource();\n    private writeQueue: LockEntry[] = [];\n    private readQueue: LockEntry[] = [];\n    private done = true;\n\n    write(action: (token: CancellationToken) => MaybePromise<void>): Promise<void> {\n        this.cancelWrite();\n        const tokenSource = startCancelableOperation();\n        this.previousTokenSource = tokenSource;\n        return this.enqueue(this.writeQueue, action, tokenSource.token);\n    }\n\n    read<T>(action: () => MaybePromise<T>): Promise<T> {\n        return this.enqueue(this.readQueue, action);\n    }\n\n    private enqueue<T = void>(queue: LockEntry[], action: LockAction<T>, cancellationToken = CancellationToken.None): Promise<T> {\n        const deferred = new Deferred<unknown>();\n        const entry: LockEntry = {\n            action,\n            deferred,\n            cancellationToken\n        };\n        queue.push(entry);\n        this.performNextOperation();\n        return deferred.promise as Promise<T>;\n    }\n\n    private async performNextOperation(): Promise<void> {\n        if (!this.done) {\n            return;\n        }\n        const entries: LockEntry[] = [];\n        if (this.writeQueue.length > 0) {\n            // Just perform the next write action\n            entries.push(this.writeQueue.shift()!);\n        } else if (this.readQueue.length > 0) {\n            // Empty the read queue and perform all actions in parallel\n            entries.push(...this.readQueue.splice(0, this.readQueue.length));\n        } else {\n            return;\n        }\n        this.done = false;\n        await Promise.all(entries.map(async ({ action, deferred, cancellationToken }) => {\n            try {\n                // Move the execution of the action to the next event loop tick via `Promise.resolve()`\n                const result = await Promise.resolve().then(() => action(cancellationToken));\n                deferred.resolve(result);\n            } catch (err) {\n                if (isOperationCancelled(err)) {\n                    // If the operation was cancelled, we don't want to reject the promise\n                    deferred.resolve(undefined);\n                } else {\n                    deferred.reject(err);\n                }\n            }\n        }));\n        this.done = true;\n        this.performNextOperation();\n    }\n\n    cancelWrite(): void {\n        this.previousTokenSource.cancel();\n    }\n}\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { InitializeParams, InitializedParams } from 'vscode-languageserver-protocol';\nimport type { WorkspaceFolder } from 'vscode-languageserver-types';\nimport type { ServiceRegistry } from '../service-registry.js';\nimport type { LangiumSharedCoreServices } from '../services.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { Deferred, interruptAndCheck } from '../utils/promise-utils.js';\nimport { URI, UriUtils } from '../utils/uri-utils.js';\nimport type { BuildOptions, DocumentBuilder } from './document-builder.js';\nimport type { LangiumDocument, LangiumDocuments } from './documents.js';\nimport type { FileSystemNode, FileSystemProvider } from './file-system-provider.js';\nimport type { WorkspaceLock } from './workspace-lock.js';\nimport { stream, type Stream } from '../utils/stream.js';\n// export type WorkspaceFolder from 'vscode-languageserver-types' for convenience,\n//  is supposed to avoid confusion as 'WorkspaceFolder' might accidentally be imported via 'vscode-languageclient'\nexport type { WorkspaceFolder };\n\n/**\n * The workspace manager is responsible for finding source files in the workspace.\n * This service is shared between all languages of a language server.\n */\nexport interface WorkspaceManager {\n\n    /** The options used for the initial workspace build. */\n    initialBuildOptions: BuildOptions | undefined;\n\n    /**\n     * A promise that resolves when the workspace manager is ready to be used.\n     * Use this to ensure that the workspace manager has finished its initialization.\n     */\n    readonly ready: Promise<void>;\n\n    /**\n     * The workspace folders of the current workspace.\n     * Available only after the `ready` promise resolves.\n     */\n    get workspaceFolders(): readonly WorkspaceFolder[] | undefined;\n\n    /**\n     * When used in a language server context, this method is called when the server receives\n     * the `initialize` request.\n     */\n    initialize(params: InitializeParams): void;\n\n    /**\n     * When used in a language server context, this method is called when the server receives\n     * the `initialized` notification.\n     */\n    initialized(params: InitializedParams): Promise<void>;\n\n    /**\n     * Does the initial indexing of workspace folders.\n     * Collects information about exported and referenced AstNodes in\n     * each language file and stores it locally.\n     *\n     * @param folders The set of workspace folders to be indexed.\n     * @param cancelToken A cancellation token that can be used to cancel the operation.\n     *\n     * @throws OperationCancelled if a cancellation event has been detected\n     */\n    initializeWorkspace(folders: WorkspaceFolder[], cancelToken?: CancellationToken): Promise<void>;\n\n    /**\n     * Searches for workspace files in the given folder and its subdirectories.\n     * Note that this method does not create documents for the found files.\n     * @param uri The URI of the folder to search in.\n     * @returns A promise that resolves to an array of URIs of the found files.\n     */\n    searchFolder(uri: URI): Promise<URI[]>;\n\n    /**\n     * Determine whether the given file system node shall be included in the workspace.\n     * @param entry The file system node to check.\n     * @returns `true` if the entry shall be included, `false` otherwise.\n     */\n    shouldIncludeEntry(entry: FileSystemNode): boolean;\n\n}\n/**\n * The FileSelector provides file names and extensions used by this extension.\n */\nexport interface FileSelector {\n    /** Allowed file extensions (e.g., [\"ts\", \"js\"]). */\n    fileExtensions: string[];\n    /** Allowed file names (e.g., [\"config\", \"settings\"]). */\n    fileNames: string[];\n}\n\nexport class DefaultWorkspaceManager implements WorkspaceManager {\n\n    initialBuildOptions: BuildOptions = {};\n\n    protected readonly serviceRegistry: ServiceRegistry;\n    protected readonly langiumDocuments: LangiumDocuments;\n    protected readonly documentBuilder: DocumentBuilder;\n    protected readonly fileSystemProvider: FileSystemProvider;\n    protected readonly mutex: WorkspaceLock;\n    protected readonly _ready = new Deferred<void>();\n    protected folders?: WorkspaceFolder[];\n\n    constructor(services: LangiumSharedCoreServices) {\n        this.serviceRegistry = services.ServiceRegistry;\n        this.langiumDocuments = services.workspace.LangiumDocuments;\n        this.documentBuilder = services.workspace.DocumentBuilder;\n        this.fileSystemProvider = services.workspace.FileSystemProvider;\n        this.mutex = services.workspace.WorkspaceLock;\n    }\n\n    get ready(): Promise<void> {\n        return this._ready.promise;\n    }\n\n    get workspaceFolders(): readonly WorkspaceFolder[] | undefined {\n        return this.folders;\n    }\n\n    initialize(params: InitializeParams): void {\n        this.folders = params.workspaceFolders ?? undefined;\n    }\n\n    initialized(_params: InitializedParams): Promise<void> {\n        // Initialize the workspace even if there are no workspace folders\n        // We still want to load additional documents (language library or similar) during initialization\n        return this.mutex.write(token => this.initializeWorkspace(this.folders ?? [], token));\n    }\n\n    async initializeWorkspace(folders: WorkspaceFolder[], cancelToken = CancellationToken.None): Promise<void> {\n        const documents = await this.performStartup(folders);\n        // Only after creating all documents do we check whether we need to cancel the initialization\n        // The document builder will later pick up on all unprocessed documents\n        await interruptAndCheck(cancelToken);\n        await this.documentBuilder.build(documents, this.initialBuildOptions, cancelToken);\n    }\n\n    /**\n     * Performs the uninterruptable startup sequence of the workspace manager.\n     * This methods loads all documents in the workspace and other documents and returns them.\n     */\n    protected async performStartup(folders: WorkspaceFolder[]): Promise<LangiumDocument[]> {\n        const documents: LangiumDocument[] = [];\n        const collector = (document: LangiumDocument) => {\n            documents.push(document);\n            if (!this.langiumDocuments.hasDocument(document.uri)) {\n                this.langiumDocuments.addDocument(document);\n            }\n        };\n        // Even though we don't await the initialization of the workspace manager,\n        // we can still assume that all library documents and file documents are loaded by the time we start building documents.\n        // The mutex prevents anything from performing a workspace build until we check the cancellation token\n        await this.loadAdditionalDocuments(folders, collector);\n        const uris: URI[] = [];\n        await Promise.all(\n            folders.map(wf => this.getRootFolder(wf))\n                .map(async entry => this.traverseFolder(entry, uris))\n        );\n        const uniqueUris = stream(uris)\n            // Ensure that we only create one document per URI/file\n            .distinct(uri => uri.toString())\n            // Also ensure that the documents don't already exist\n            .filter(uri => !this.langiumDocuments.hasDocument(uri));\n        await this.loadWorkspaceDocuments(uniqueUris, collector);\n        this._ready.resolve();\n        return documents;\n    }\n\n    protected async loadWorkspaceDocuments(uris: Stream<URI>, collector: (document: LangiumDocument) => void): Promise<void> {\n        await Promise.all(uris.map(async uri => {\n            const document = await this.langiumDocuments.getOrCreateDocument(uri);\n            collector(document);\n        }));\n    }\n\n    /**\n     * Load all additional documents that shall be visible in the context of the given workspace\n     * folders and add them to the collector. This can be used to include built-in libraries of\n     * your language, which can be either loaded from provided files or constructed in memory.\n     */\n    protected loadAdditionalDocuments(_folders: WorkspaceFolder[], _collector: (document: LangiumDocument) => void): Promise<void> {\n        return Promise.resolve();\n    }\n\n    /**\n     * Determine the root folder of the source documents in the given workspace folder.\n     * The default implementation returns the URI of the workspace folder, but you can override\n     * this to return a subfolder like `src` instead.\n     */\n    protected getRootFolder(workspaceFolder: WorkspaceFolder): URI {\n        return URI.parse(workspaceFolder.uri);\n    }\n\n    /**\n     * Traverse the file system folder identified by the given URI and its subfolders. All\n     * contained files that match the file extensions are added to the `uris` array.\n     */\n    protected async traverseFolder(folderPath: URI, uris: URI[]): Promise<void> {\n        try {\n            const content = await this.fileSystemProvider.readDirectory(folderPath);\n            await Promise.all(content.map(async entry => {\n                if (this.shouldIncludeEntry(entry)) {\n                    if (entry.isDirectory) {\n                        await this.traverseFolder(entry.uri, uris);\n                    } else if (entry.isFile) {\n                        uris.push(entry.uri);\n                    }\n                }\n            }));\n        } catch (e) {\n            console.error('Failure to read directory content of ' + folderPath.toString(true), e);\n        }\n    }\n\n    async searchFolder(uri: URI): Promise<URI[]> {\n        const uris: URI[] = [];\n        await this.traverseFolder(uri, uris);\n        return uris;\n    }\n\n    /**\n     * Determine whether the given folder entry shall be included while indexing the workspace.\n     */\n    shouldIncludeEntry(entry: FileSystemNode): boolean {\n        const name = UriUtils.basename(entry.uri);\n        if (name.startsWith('.')) {\n            return false;\n        }\n        if (entry.isDirectory) {\n            return name !== 'node_modules' && name !== 'out';\n        } else if (entry.isFile) {\n            return this.serviceRegistry.hasServices(entry.uri);\n        }\n        return false;\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { CodeDescription, DiagnosticRelatedInformation, DiagnosticTag, integer, Range } from 'vscode-languageserver-types';\nimport { assertUnreachable } from '../index.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, AstReflection, Properties } from '../syntax-tree.js';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport { MultiMap } from '../utils/collections.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport { isOperationCancelled } from '../utils/promise-utils.js';\nimport type { Stream } from '../utils/stream.js';\nimport { stream } from '../utils/stream.js';\nimport type { DocumentSegment, LangiumDocument } from '../workspace/documents.js';\n\nexport type DiagnosticInfo<N extends AstNode, P extends string = Properties<N>> = {\n    /** The AST node to which the diagnostic is attached. */\n    node: N;\n    /** If a property name is given, the diagnostic is restricted to the corresponding text region. */\n    property?: P;\n    /** If the value of a keyword is given, the diagnostic will appear at its corresponding text region */\n    keyword?: string;\n    /** In case of a multi-value property (array), an index can be given to select a specific element. */\n    index?: number;\n    /** If you want to create a diagnostic independent to any property, use the range property. */\n    range?: Range;\n    /** The diagnostic's code, which usually appear in the user interface. */\n    code?: integer | string;\n    /** An optional property to describe the error code. */\n    codeDescription?: CodeDescription;\n    /** Additional metadata about the diagnostic. */\n    tags?: DiagnosticTag[];\n    /** An array of related diagnostic information, e.g. when symbol-names within a scope collide all definitions can be marked via this property. */\n    relatedInformation?: DiagnosticRelatedInformation[];\n    /** A data entry field that is preserved between a `textDocument/publishDiagnostics` notification and `textDocument/codeAction` request. */\n    data?: unknown;\n}\n\n/**\n * Shape of information commonly used in the `data` field of diagnostics.\n */\nexport interface DiagnosticData {\n    /** Diagnostic code for identifying which code action to apply. This code is _not_ shown in the user interface. */\n    code: string\n    /** Specifies where to apply the code action in the form of a `DocumentSegment`. */\n    actionSegment?: DocumentSegment\n    /** Specifies where to apply the code action in the form of a `Range`. */\n    actionRange?: Range\n}\n\n/**\n * Create DiagnosticData for a given diagnostic code. The result can be put into the `data` field of a DiagnosticInfo.\n */\nexport function diagnosticData(code: string): DiagnosticData {\n    return { code };\n}\n\nexport type ValidationSeverity = 'error' | 'warning' | 'info' | 'hint';\n\nexport type ValidationAcceptor = <N extends AstNode>(severity: ValidationSeverity, message: string, info: DiagnosticInfo<N>) => void\n\nexport type ValidationCheck<T extends AstNode = AstNode> = (node: T, accept: ValidationAcceptor, cancelToken: CancellationToken) => MaybePromise<void>;\n\n/**\n * A utility type for describing functions which will be called once before or after all the AstNodes of an AST/Langium document are validated.\n *\n * The AST is represented by its root AstNode.\n *\n * The given validation acceptor helps to report some early or lately detected issues.\n *\n * The 'categories' indicate, which validation categories are executed for all the AstNodes.\n * This helps to tailor the preparations/tear-down logic to the actually executed checks on the nodes.\n *\n * It is recommended to support interrupts during long-running logic with 'interruptAndCheck(cancelToken)'.\n */\nexport type ValidationPreparation = (rootNode: AstNode, accept: ValidationAcceptor, categories: ValidationCategory[], cancelToken: CancellationToken) => MaybePromise<void>;\n\n/**\n * A utility type for associating non-primitive AST types to corresponding validation checks. For example:\n *\n * ```ts\n *   const checks: ValidationChecks<StatemachineAstType> = {\n *       State: validator.checkStateNameStartsWithCapital\n *    };\n * ```\n *\n * If an AST type does not extend AstNode, e.g. if it describes a union of string literals, that type's name must not occur as a key in objects of type `ValidationCheck<...>`.\n *\n * @param T a type definition mapping language specific type names (keys) to the corresponding types (values)\n */\nexport type ValidationChecks<T> = {\n    [K in keyof T]?: T[K] extends AstNode ? ValidationCheck<T[K]> | Array<ValidationCheck<T[K]>> : never\n} & {\n    AstNode?: ValidationCheck<AstNode> | Array<ValidationCheck<AstNode>>;\n}\n\n/**\n * There are 3 pre-defined categories: `fast`, `slow` and `built-in`.\n *\n * `fast` checks can be executed after every document change (i.e. as the user is typing). If a check\n * is too slow it can delay the response to document changes, yielding bad user experience. By marking\n * it as `slow`, it will be skipped for normal as-you-type validation. Then it's up to you when to\n * schedule these long-running checks: after the fast checks are done, or after saving a document,\n * or with an explicit command, etc.\n *\n * `built-in` checks are errors produced by the lexer, the parser, or the linker. They cannot be used\n * for custom validation checks.\n *\n * You can also provide user-defined categories. These check will be skipped by default. Then it's up\n * to you to schedule these checks: after the fast checks are done, or after saving a document,\n * or with an explicit command, etc.\n */\nexport type ValidationCategory = 'fast' | 'slow' | 'built-in' | (string & {});\n\nexport namespace ValidationCategory {\n    export const defaults: readonly ValidationCategory[] = ['fast', 'slow', 'built-in'];\n    /**\n     * @deprecated since 4.2 Use `ValidationCategory.defaults` instead,\n     * since \"all\" does not include user-defined, custom validation categories.\n     */\n    export const all: readonly ValidationCategory[] = defaults;\n}\n\ntype ValidationCheckEntry = {\n    check: ValidationCheck\n    category: ValidationCategory\n}\n\n/**\n * Manages a set of `ValidationCheck`s to be applied when documents are validated.\n */\nexport class ValidationRegistry {\n    protected readonly entries = new MultiMap<string, ValidationCheckEntry>();\n    protected readonly knownCategories = new Set(ValidationCategory.defaults);\n\n    protected readonly reflection: AstReflection;\n\n    protected entriesBefore: ValidationPreparation[] = [];\n    protected entriesAfter: ValidationPreparation[] = [];\n\n    constructor(services: LangiumCoreServices) {\n        this.reflection = services.shared.AstReflection;\n    }\n\n    /**\n     * Register a set of validation checks. Each value in the record can be either a single validation check (i.e. a function)\n     * or an array of validation checks.\n     *\n     * @param checksRecord Set of validation checks to register.\n     * @param thisObj Optional object to be used as `this` when calling the validation check functions.\n     * @param category Optional category for the validation checks (defaults to `'fast'`).\n     */\n    register<T>(checksRecord: ValidationChecks<T>, thisObj: ThisParameterType<unknown> = this, category: ValidationCategory = 'fast'): void {\n        if (category === 'built-in') {\n            throw new Error(\"The 'built-in' category is reserved for lexer, parser, and linker errors.\");\n        }\n        this.knownCategories.add(category); // remember custom/user-defined categories\n        for (const [type, ch] of Object.entries(checksRecord)) {\n            const callbacks = ch as ValidationCheck | ValidationCheck[];\n            if (Array.isArray(callbacks)) {\n                for (const check of callbacks) {\n                    const entry: ValidationCheckEntry = {\n                        check: this.wrapValidationException(check, thisObj),\n                        category\n                    };\n                    this.addEntry(type, entry);\n                }\n            } else if (typeof callbacks === 'function') {\n                const entry: ValidationCheckEntry = {\n                    check: this.wrapValidationException(callbacks, thisObj),\n                    category\n                };\n                this.addEntry(type, entry);\n            } else {\n                assertUnreachable(callbacks);\n            }\n        }\n    }\n\n    protected wrapValidationException(check: ValidationCheck, thisObj: unknown): ValidationCheck {\n        return async (node, accept, cancelToken) => {\n            await this.handleException(() => check.call(thisObj, node, accept, cancelToken), 'An error occurred during validation', accept, node);\n        };\n    }\n\n    protected async handleException(functionality: () => MaybePromise<void>, messageContext: string, accept: ValidationAcceptor, node: AstNode): Promise<void> {\n        try {\n            await functionality();\n        } catch (err) {\n            if (isOperationCancelled(err)) {\n                throw err;\n            }\n            console.error(`${messageContext}:`, err);\n            if (err instanceof Error && err.stack) {\n                console.error(err.stack);\n            }\n            const messageDetails = err instanceof Error ? err.message : String(err);\n            accept('error', `${messageContext}: ${messageDetails}`, { node });\n        }\n    }\n\n    protected addEntry(type: string, entry: ValidationCheckEntry): void {\n        if (type === 'AstNode') {\n            this.entries.add('AstNode', entry);\n            return;\n        }\n        for (const subtype of this.reflection.getAllSubTypes(type)) {\n            this.entries.add(subtype, entry);\n        }\n    }\n\n    getChecks(type: string, categories?: ValidationCategory[]): Stream<ValidationCheck> {\n        let checks = stream(this.entries.get(type))\n            .concat(this.entries.get('AstNode'));\n        if (categories) {\n            checks = checks.filter(entry => categories.includes(entry.category));\n        }\n        return checks.map(entry => entry.check);\n    }\n\n    /**\n     * Register logic which will be executed once before validating all the nodes of an AST/Langium document.\n     * This helps to prepare or initialize some information which are required or reusable for the following checks on the AstNodes.\n     *\n     * As an example, for validating unique fully-qualified names of nodes in the AST,\n     * here the map for mapping names to nodes could be established.\n     * During the usual checks on the nodes, they are put into this map with their name.\n     *\n     * Note that this approach makes validations stateful, which is relevant e.g. when cancelling the validation.\n     * Therefore it is recommended to clear stored information\n     * _before_ validating an AST to validate each AST unaffected from other ASTs\n     * AND _after_ validating the AST to free memory by information which are no longer used.\n     *\n     * @param checkBefore a set-up function which will be called once before actually validating an AST\n     * @param thisObj Optional object to be used as `this` when calling the validation check functions.\n     */\n    registerBeforeDocument(checkBefore: ValidationPreparation, thisObj: ThisParameterType<unknown> = this): void {\n        this.entriesBefore.push(this.wrapPreparationException(checkBefore, 'An error occurred during set-up of the validation', thisObj));\n    }\n\n    /**\n     * Register logic which will be executed once after validating all the nodes of an AST/Langium document.\n     * This helps to finally evaluate information which are collected during the checks on the AstNodes.\n     *\n     * As an example, for validating unique fully-qualified names of nodes in the AST,\n     * here the map with all the collected nodes and their names is checked\n     * and validation hints are created for all nodes with the same name.\n     *\n     * Note that this approach makes validations stateful, which is relevant e.g. when cancelling the validation.\n     * Therefore it is recommended to clear stored information\n     * _before_ validating an AST to validate each AST unaffected from other ASTs\n     * AND _after_ validating the AST to free memory by information which are no longer used.\n     *\n     * @param checkBefore a set-up function which will be called once before actually validating an AST\n     * @param thisObj Optional object to be used as `this` when calling the validation check functions.\n     */\n    registerAfterDocument(checkAfter: ValidationPreparation, thisObj: ThisParameterType<unknown> = this): void {\n        this.entriesAfter.push(this.wrapPreparationException(checkAfter, 'An error occurred during tear-down of the validation', thisObj));\n    }\n\n    protected wrapPreparationException(check: ValidationPreparation, messageContext: string, thisObj: unknown): ValidationPreparation {\n        return async (rootNode, accept, categories, cancelToken) => {\n            await this.handleException(() => check.call(thisObj, rootNode, accept, categories, cancelToken), messageContext, accept, rootNode);\n        };\n    }\n\n    get checksBefore(): ValidationPreparation[] {\n        return this.entriesBefore;\n    }\n\n    get checksAfter(): ValidationPreparation[] {\n        return this.entriesAfter;\n    }\n\n    getAllValidationCategories(_document: LangiumDocument): ReadonlySet<ValidationCategory> {\n        return this.knownCategories;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { MismatchedTokenException } from 'chevrotain';\nimport type { DiagnosticSeverity, Position, Range, Diagnostic } from 'vscode-languageserver-types';\nimport type { LanguageMetaData } from '../languages/language-meta-data.js';\nimport type { ParseResult } from '../parser/langium-parser.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport type { AstNode, CstNode } from '../syntax-tree.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport type { DiagnosticData, DiagnosticInfo, ValidationAcceptor, ValidationCategory, ValidationRegistry, ValidationSeverity } from './validation-registry.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { findNodeForKeyword, findNodeForProperty } from '../utils/grammar-utils.js';\nimport { streamAst } from '../utils/ast-utils.js';\nimport { tokenToRange } from '../utils/cst-utils.js';\nimport { interruptAndCheck, isOperationCancelled } from '../utils/promise-utils.js';\nimport { diagnosticData } from './validation-registry.js';\nimport type { LexingDiagnostic, LexingDiagnosticSeverity } from '../parser/token-builder.js';\nimport type { LangiumProfiler } from '../workspace/profiler.js';\n\nexport interface ValidationOptions {\n    /**\n     * If this is set, only the checks associated with these categories are executed; otherwise\n     * all checks are executed. The default category if not specified to the registry is `'fast'`.\n     */\n    categories?: ValidationCategory[];\n    /** If true, no further diagnostics are reported if there are lexing errors. */\n    stopAfterLexingErrors?: boolean\n    /** If true, no further diagnostics are reported if there are parsing errors. Lexing errors are reported first. */\n    stopAfterParsingErrors?: boolean\n    /** If true, no further diagnostics are reported if there are linking errors. Lexing and parsing errors are reported first. */\n    stopAfterLinkingErrors?: boolean\n}\n\n/**\n * Language-specific service for validating `LangiumDocument`s.\n */\nexport interface DocumentValidator {\n    /**\n     * Validates the whole specified document.\n     *\n     * @param document specified document to validate\n     * @param options options to control the validation process\n     * @param cancelToken allows to cancel the current operation\n     * @throws `OperationCanceled` if a user action occurs during execution\n     */\n    validateDocument(document: LangiumDocument, options?: ValidationOptions, cancelToken?: CancellationToken): Promise<Diagnostic[]>;\n}\n\nexport interface ValidateSingleNodeOptions {\n    validateNode: boolean;\n    validateChildren: boolean;\n}\n\nexport const VALIDATE_EACH_NODE: ValidateSingleNodeOptions = Object.freeze({\n    validateNode: true,\n    validateChildren: true,\n});\n\nexport class DefaultDocumentValidator implements DocumentValidator {\n\n    protected readonly validationRegistry: ValidationRegistry;\n    protected readonly metadata: LanguageMetaData;\n    protected readonly profiler: LangiumProfiler | undefined;\n    protected readonly languageId: string;\n\n    constructor(services: LangiumCoreServices) {\n        this.validationRegistry = services.validation.ValidationRegistry;\n        this.metadata = services.LanguageMetaData;\n        this.profiler = services.shared.profilers.LangiumProfiler;\n        this.languageId = services.LanguageMetaData.languageId;\n    }\n\n    async validateDocument(document: LangiumDocument, options: ValidationOptions = {}, cancelToken = CancellationToken.None): Promise<Diagnostic[]> {\n        const parseResult = document.parseResult;\n        const diagnostics: Diagnostic[] = [];\n\n        await interruptAndCheck(cancelToken);\n\n        if (!options.categories || options.categories.includes('built-in')) {\n            this.processLexingErrors(parseResult, diagnostics, options);\n            if (options.stopAfterLexingErrors && diagnostics.some(d => d.data?.code === DocumentValidator.LexingError)) {\n                return diagnostics;\n            }\n\n            this.processParsingErrors(parseResult, diagnostics, options);\n            if (options.stopAfterParsingErrors && diagnostics.some(d => d.data?.code === DocumentValidator.ParsingError)) {\n                return diagnostics;\n            }\n\n            this.processLinkingErrors(document, diagnostics, options);\n            if (options.stopAfterLinkingErrors && diagnostics.some(d => d.data?.code === DocumentValidator.LinkingError)) {\n                return diagnostics;\n            }\n        }\n\n        // Process custom validations\n        try {\n            diagnostics.push(...await this.validateAst(parseResult.value, options, cancelToken));\n        } catch (err) {\n            if (isOperationCancelled(err)) {\n                throw err;\n            }\n            console.error('An error occurred during validation:', err);\n        }\n\n        await interruptAndCheck(cancelToken);\n\n        return diagnostics;\n    }\n\n    protected processLexingErrors(parseResult: ParseResult, diagnostics: Diagnostic[], _options: ValidationOptions): void {\n        const lexerDiagnostics = [...parseResult.lexerErrors, ...parseResult.lexerReport?.diagnostics ?? []] as LexingDiagnostic[];\n        for (const lexerDiagnostic of lexerDiagnostics) {\n            const severity = lexerDiagnostic.severity ?? 'error';\n            const diagnostic: Diagnostic = {\n                severity: toDiagnosticSeverity(severity),\n                range: {\n                    start: {\n                        line: lexerDiagnostic.line! - 1,\n                        character: lexerDiagnostic.column! - 1\n                    },\n                    end: {\n                        line: lexerDiagnostic.line! - 1,\n                        character: lexerDiagnostic.column! + lexerDiagnostic.length - 1\n                    }\n                },\n                message: lexerDiagnostic.message,\n                data: toDiagnosticData(severity),\n                source: this.getSource()\n            };\n            diagnostics.push(diagnostic);\n        }\n    }\n\n    protected processParsingErrors(parseResult: ParseResult, diagnostics: Diagnostic[], _options: ValidationOptions): void {\n        for (const parserError of parseResult.parserErrors) {\n            let range: Range | undefined = undefined;\n            // We can run into the chevrotain error recovery here\n            // The token contained in the parser error might be automatically inserted\n            // In this case every position value will be `NaN`\n            if (isNaN(parserError.token.startOffset)) {\n                // Some special parser error types contain a `previousToken`\n                // We can simply append our diagnostic to that token\n                if ('previousToken' in parserError) {\n                    const token = (parserError as MismatchedTokenException).previousToken;\n                    if (!isNaN(token.startOffset)) {\n                        const position: Position = { line: token.endLine! - 1, character: token.endColumn! };\n                        range = { start: position, end: position};\n                    } else {\n                        // No valid prev token. Might be empty document or containing only hidden tokens.\n                        // Point to document start\n                        const position: Position = { line: 0, character: 0 };\n                        range = { start: position, end: position};\n                    }\n                }\n            } else {\n                range = tokenToRange(parserError.token);\n            }\n            if (range) {\n                const diagnostic: Diagnostic = {\n                    severity: toDiagnosticSeverity('error'),\n                    range,\n                    message: parserError.message,\n                    data: diagnosticData(DocumentValidator.ParsingError),\n                    source: this.getSource()\n                };\n                diagnostics.push(diagnostic);\n            }\n        }\n    }\n\n    protected processLinkingErrors(document: LangiumDocument, diagnostics: Diagnostic[], _options: ValidationOptions): void {\n        for (const reference of document.references) {\n            const linkingError = reference.error;\n            if (linkingError) {\n                const info: DiagnosticInfo<AstNode, string> = {\n                    node: linkingError.info.container,\n                    range: reference.$refNode?.range,\n                    property: linkingError.info.property,\n                    index: linkingError.info.index,\n                    data: {\n                        code: DocumentValidator.LinkingError,\n                        containerType: linkingError.info.container.$type,\n                        property: linkingError.info.property,\n                        refText: linkingError.info.reference.$refText\n                    } satisfies LinkingErrorData\n                };\n                diagnostics.push(this.toDiagnostic('error', linkingError.message, info));\n            }\n        }\n    }\n\n    protected async validateAst(rootNode: AstNode, options: ValidationOptions, cancelToken = CancellationToken.None): Promise<Diagnostic[]> {\n        const validationItems: Diagnostic[] = [];\n        const acceptor: ValidationAcceptor = <N extends AstNode>(severity: ValidationSeverity, message: string, info: DiagnosticInfo<N>) => {\n            validationItems.push(this.toDiagnostic(severity, message, info));\n        };\n\n        await this.validateAstBefore(rootNode, options, acceptor, cancelToken);\n        await this.validateAstNodes(rootNode, options, acceptor, cancelToken);\n        await this.validateAstAfter(rootNode, options, acceptor, cancelToken);\n\n        return validationItems;\n    }\n\n    protected async validateAstBefore(rootNode: AstNode, options: ValidationOptions, acceptor: ValidationAcceptor, cancelToken = CancellationToken.None): Promise<void> {\n        const checksBefore = this.validationRegistry.checksBefore;\n        for (const checkBefore of checksBefore) {\n            await interruptAndCheck(cancelToken);\n            await checkBefore(rootNode, acceptor, options.categories ?? [], cancelToken);\n        }\n    }\n\n    protected async validateAstNodes(rootNode: AstNode, options: ValidationOptions, acceptor: ValidationAcceptor, cancelToken = CancellationToken.None): Promise<void> {\n        if (this.profiler?.isActive('validating')) {\n            const task = this.profiler.createTask('validating', this.languageId);\n            task.start();\n            try {\n                const nodes = streamAst(rootNode).iterator();\n                for (const node of nodes) {\n                    task.startSubTask(node.$type);\n                    const nodeOptions = this.validateSingleNodeOptions(node, options);\n                    if (nodeOptions.validateNode) {\n                        try {\n                            const checks = this.validationRegistry.getChecks(node.$type, options.categories);\n                            for (const check of checks) {\n                                await check(node, acceptor, cancelToken);\n                            }\n                        } finally {\n                            task.stopSubTask(node.$type);\n                        }\n                    }\n                    if (!nodeOptions.validateChildren) {\n                        nodes.prune();\n                    }\n                }\n            } finally {\n                task.stop();\n            }\n        }\n        else {\n            const nodes = streamAst(rootNode).iterator();\n            for (const node of nodes) {\n                await interruptAndCheck(cancelToken);\n                const nodeOptions = this.validateSingleNodeOptions(node, options);\n                if (nodeOptions.validateNode) {\n                    const checks = this.validationRegistry.getChecks(node.$type, options.categories);\n                    for (const check of checks) {\n                        await check(node, acceptor, cancelToken);\n                    }\n                }\n                if (!nodeOptions.validateChildren) {\n                    nodes.prune();\n                }\n            }\n        }\n    }\n\n    protected validateSingleNodeOptions(_node: AstNode, _options: ValidationOptions): ValidateSingleNodeOptions {\n        return VALIDATE_EACH_NODE;\n    }\n\n    protected async validateAstAfter(rootNode: AstNode, options: ValidationOptions, acceptor: ValidationAcceptor, cancelToken = CancellationToken.None): Promise<void> {\n        const checksAfter = this.validationRegistry.checksAfter;\n        for (const checkAfter of checksAfter) {\n            await interruptAndCheck(cancelToken);\n            await checkAfter(rootNode, acceptor, options.categories ?? [], cancelToken);\n        }\n    }\n\n    protected toDiagnostic<N extends AstNode>(severity: ValidationSeverity, message: string, info: DiagnosticInfo<N, string>): Diagnostic {\n        return {\n            message,\n            range: getDiagnosticRange(info),\n            severity: toDiagnosticSeverity(severity),\n            code: info.code,\n            codeDescription: info.codeDescription,\n            tags: info.tags,\n            relatedInformation: info.relatedInformation,\n            data: info.data,\n            source: this.getSource()\n        };\n    }\n\n    protected getSource(): string | undefined {\n        return this.metadata.languageId;\n    }\n}\n\nexport function getDiagnosticRange<N extends AstNode>(info: DiagnosticInfo<N, string>): Range {\n    if (info.range) {\n        return info.range;\n    }\n    let cstNode: CstNode | undefined;\n    if (typeof info.property === 'string') {\n        cstNode = findNodeForProperty(info.node.$cstNode, info.property, info.index);\n    } else if (typeof info.keyword === 'string') {\n        cstNode = findNodeForKeyword(info.node.$cstNode, info.keyword, info.index);\n    }\n    cstNode ??= info.node.$cstNode;\n    if (!cstNode) {\n        return {\n            start: { line: 0, character: 0 },\n            end: { line: 0, character: 0 }\n        };\n    }\n    return cstNode.range;\n}\n\n/**\n * Transforms the diagnostic severity from the {@link LexingDiagnosticSeverity} format to LSP's `DiagnosticSeverity` format.\n *\n * @param severity The lexing diagnostic severity\n * @returns Diagnostic severity according to `vscode-languageserver-types/lib/esm/main.js#DiagnosticSeverity`\n */\nexport function toDiagnosticSeverity(severity: LexingDiagnosticSeverity): DiagnosticSeverity {\n    switch (severity) {\n        case 'error':\n            return 1 satisfies typeof DiagnosticSeverity.Error;\n        case 'warning':\n            return 2 satisfies typeof DiagnosticSeverity.Warning;\n        case 'info':\n            return 3 satisfies typeof DiagnosticSeverity.Information;\n        case 'hint':\n            return 4 satisfies typeof DiagnosticSeverity.Hint;\n        default:\n            throw new Error('Invalid diagnostic severity: ' + severity);\n    }\n}\n\nexport function toDiagnosticData(severity: LexingDiagnosticSeverity): DiagnosticData {\n    switch (severity) {\n        case 'error':\n            return diagnosticData(DocumentValidator.LexingError);\n        case 'warning':\n            return diagnosticData(DocumentValidator.LexingWarning);\n        case 'info':\n            return diagnosticData(DocumentValidator.LexingInfo);\n        case 'hint':\n            return diagnosticData(DocumentValidator.LexingHint);\n        default:\n            throw new Error('Invalid diagnostic severity: ' + severity);\n    }\n}\n\nexport namespace DocumentValidator {\n    export const LexingError = 'lexing-error';\n    export const LexingWarning = 'lexing-warning';\n    export const LexingInfo = 'lexing-info';\n    export const LexingHint = 'lexing-hint';\n    export const ParsingError = 'parsing-error';\n    export const LinkingError = 'linking-error';\n}\n\nexport interface LinkingErrorData extends DiagnosticData {\n    containerType: string\n    property: string\n    refText: string\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n******************************************************************************/\n\nimport type { Module } from './dependency-injection.js';\nimport type { LangiumDefaultCoreServices, LangiumDefaultSharedCoreServices, LangiumCoreServices, LangiumSharedCoreServices } from './services.js';\nimport type { FileSystemProvider } from './workspace/file-system-provider.js';\nimport { createGrammarConfig } from './languages/grammar-config.js';\nimport { createCompletionParser } from './parser/completion-parser-builder.js';\nimport { createLangiumParser } from './parser/langium-parser-builder.js';\nimport { DefaultTokenBuilder } from './parser/token-builder.js';\nimport { DefaultValueConverter } from './parser/value-converter.js';\nimport { DefaultLinker } from './references/linker.js';\nimport { DefaultNameProvider } from './references/name-provider.js';\nimport { DefaultReferences } from './references/references.js';\nimport { DefaultScopeComputation } from './references/scope-computation.js';\nimport { DefaultScopeProvider } from './references/scope-provider.js';\nimport { DefaultJsonSerializer } from './serializer/json-serializer.js';\nimport { DefaultServiceRegistry } from './service-registry.js';\nimport { DefaultDocumentValidator } from './validation/document-validator.js';\nimport { ValidationRegistry } from './validation/validation-registry.js';\nimport { DefaultAstNodeDescriptionProvider, DefaultReferenceDescriptionProvider } from './workspace/ast-descriptions.js';\nimport { DefaultAstNodeLocator } from './workspace/ast-node-locator.js';\nimport { DefaultConfigurationProvider } from './workspace/configuration.js';\nimport { DefaultDocumentBuilder } from './workspace/document-builder.js';\nimport { DefaultLangiumDocumentFactory, DefaultLangiumDocuments } from './workspace/documents.js';\nimport { DefaultIndexManager } from './workspace/index-manager.js';\nimport { DefaultWorkspaceManager } from './workspace/workspace-manager.js';\nimport { DefaultLexer, DefaultLexerErrorMessageProvider } from './parser/lexer.js';\nimport { JSDocDocumentationProvider } from './documentation/documentation-provider.js';\nimport { DefaultCommentProvider } from './documentation/comment-provider.js';\nimport { LangiumParserErrorMessageProvider } from './parser/langium-parser.js';\nimport { DefaultAsyncParser } from './parser/async-parser.js';\nimport { DefaultWorkspaceLock } from './workspace/workspace-lock.js';\nimport { DefaultHydrator } from './serializer/hydrator.js';\n\n/**\n * Context required for creating the default language-specific dependency injection module.\n */\nexport interface DefaultCoreModuleContext {\n    shared: LangiumSharedCoreServices;\n}\n\n/**\n * Creates a dependency injection module configuring the default core services.\n * This is a set of services that are dedicated to a specific language.\n */\nexport function createDefaultCoreModule(context: DefaultCoreModuleContext): Module<LangiumCoreServices, LangiumDefaultCoreServices> {\n    return {\n        documentation: {\n            CommentProvider: (services) => new DefaultCommentProvider(services),\n            DocumentationProvider: (services) => new JSDocDocumentationProvider(services)\n        },\n        parser: {\n            AsyncParser: (services) => new DefaultAsyncParser(services),\n            GrammarConfig: (services) => createGrammarConfig(services),\n            LangiumParser: (services) => createLangiumParser(services),\n            CompletionParser: (services) => createCompletionParser(services),\n            ValueConverter: () => new DefaultValueConverter(),\n            TokenBuilder: () => new DefaultTokenBuilder(),\n            Lexer: (services) => new DefaultLexer(services),\n            ParserErrorMessageProvider: () => new LangiumParserErrorMessageProvider(),\n            LexerErrorMessageProvider: () => new DefaultLexerErrorMessageProvider()\n        },\n        workspace: {\n            AstNodeLocator: () => new DefaultAstNodeLocator(),\n            AstNodeDescriptionProvider: (services) => new DefaultAstNodeDescriptionProvider(services),\n            ReferenceDescriptionProvider: (services) => new DefaultReferenceDescriptionProvider(services)\n        },\n        references: {\n            Linker: (services) => new DefaultLinker(services),\n            NameProvider: () => new DefaultNameProvider(),\n            ScopeProvider: (services) => new DefaultScopeProvider(services),\n            ScopeComputation: (services) => new DefaultScopeComputation(services),\n            References: (services) => new DefaultReferences(services)\n        },\n        serializer: {\n            Hydrator: (services) => new DefaultHydrator(services),\n            JsonSerializer: (services) => new DefaultJsonSerializer(services)\n        },\n        validation: {\n            DocumentValidator: (services) => new DefaultDocumentValidator(services),\n            ValidationRegistry: (services) => new ValidationRegistry(services)\n        },\n        shared: () => context.shared\n    };\n}\n\n/**\n * Context required for creating the default shared dependency injection module.\n */\nexport interface DefaultSharedCoreModuleContext {\n    /**\n     * Factory function to create a {@link FileSystemProvider}.\n     *\n     * Langium exposes an `EmptyFileSystem` and `NodeFileSystem`, exported through `langium/node`.\n     * When running Langium as part of a vscode language server or a Node.js app, using the `NodeFileSystem` is recommended,\n     * the `EmptyFileSystem` in every other use case.\n     */\n    fileSystemProvider: (services: LangiumSharedCoreServices) => FileSystemProvider;\n}\n\n/**\n * Creates a dependency injection module configuring the default shared core services.\n * This is the set of services that are shared between multiple languages.\n */\nexport function createDefaultSharedCoreModule(context: DefaultSharedCoreModuleContext): Module<LangiumSharedCoreServices, LangiumDefaultSharedCoreServices> {\n    return {\n        ServiceRegistry: (services) => new DefaultServiceRegistry(services),\n        workspace: {\n            LangiumDocuments: (services) => new DefaultLangiumDocuments(services),\n            LangiumDocumentFactory: (services) => new DefaultLangiumDocumentFactory(services),\n            DocumentBuilder: (services) => new DefaultDocumentBuilder(services),\n            IndexManager: (services) => new DefaultIndexManager(services),\n            WorkspaceManager: (services) => new DefaultWorkspaceManager(services),\n            FileSystemProvider: (services) => context.fileSystemProvider(services),\n            WorkspaceLock: () => new DefaultWorkspaceLock(),\n            ConfigurationProvider: (services) => new DefaultConfigurationProvider(services),\n        },\n        profilers: {}\n    };\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { DocumentHighlightParams } from 'vscode-languageserver';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { GrammarConfig } from '../languages/grammar-config.js';\nimport type { NameProvider } from '../references/name-provider.js';\nimport type { FindReferencesOptions, References } from '../references/references.js';\nimport type { LangiumServices } from './lsp-services.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { ReferenceDescription } from '../workspace/ast-descriptions.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport { DocumentHighlight } from 'vscode-languageserver';\nimport { getDocument } from '../utils/ast-utils.js';\nimport { findDeclarationNodeAtOffset } from '../utils/cst-utils.js';\nimport { UriUtils } from '../utils/uri-utils.js';\n\n/**\n * Language-specific service for handling document highlight requests.\n */\nexport interface DocumentHighlightProvider {\n    /**\n     * Handle a document highlight request.\n     *\n     * @param document The document in which the request was received.\n     * @param params The parameters of the document highlight request.\n     * @param cancelToken A cancellation token that can be used to cancel the request.\n     * @returns The document highlights or `undefined` if no highlights are available.\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    getDocumentHighlight(document: LangiumDocument, params: DocumentHighlightParams, cancelToken?: CancellationToken): MaybePromise<DocumentHighlight[] | undefined>;\n}\n\nexport class DefaultDocumentHighlightProvider implements DocumentHighlightProvider {\n    protected readonly references: References;\n    protected readonly nameProvider: NameProvider;\n    protected readonly grammarConfig: GrammarConfig;\n\n    constructor(services: LangiumServices) {\n        this.references = services.references.References;\n        this.nameProvider = services.references.NameProvider;\n        this.grammarConfig = services.parser.GrammarConfig;\n    }\n\n    getDocumentHighlight(document: LangiumDocument, params: DocumentHighlightParams, _cancelToken?: CancellationToken): MaybePromise<DocumentHighlight[] | undefined> {\n        const rootNode = document.parseResult.value.$cstNode;\n        if (!rootNode) {\n            return undefined;\n        }\n        const selectedNode = findDeclarationNodeAtOffset(rootNode, document.textDocument.offsetAt(params.position), this.grammarConfig.nameRegexp);\n        if (!selectedNode) {\n            return undefined;\n        }\n        const targetAstNode = this.references.findDeclarations(selectedNode);\n        const highlights: DocumentHighlight[] = [];\n        for (const target of targetAstNode) {\n            const includeDeclaration = UriUtils.equals(getDocument(target).uri, document.uri);\n            const options: FindReferencesOptions = { documentUri: document.uri, includeDeclaration: includeDeclaration };\n            const references = this.references.findReferences(target, options);\n            highlights.push(...references.map(ref => this.createDocumentHighlight(ref)).toArray());\n        }\n        return highlights;\n    }\n\n    /**\n    * Override this method to determine the highlight kind of the given reference.\n    */\n    protected createDocumentHighlight(reference: ReferenceDescription): DocumentHighlight {\n        return DocumentHighlight.create(reference.segment.range);\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { DocumentSymbol, DocumentSymbolParams } from 'vscode-languageserver-protocol';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { NameProvider } from '../references/name-provider.js';\nimport type { LangiumServices } from './lsp-services.js';\nimport type { AstNode, CstNode } from '../syntax-tree.js';\nimport { streamContents } from '../utils/ast-utils.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport type { NodeKindProvider } from './node-kind-provider.js';\n\n/**\n * Language-specific service for handling document symbols requests.\n */\nexport interface DocumentSymbolProvider {\n    /**\n     * Handle a document symbols request.\n     *\n     * @param document The document in the workspace.\n     * @param params The parameters of the request.\n     * @param cancelToken A cancellation token that migh be used to cancel the request.\n     * @returns The symbols for the given document.\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    getSymbols(document: LangiumDocument, params: DocumentSymbolParams, cancelToken?: CancellationToken): MaybePromise<DocumentSymbol[]>;\n}\n\nexport class DefaultDocumentSymbolProvider implements DocumentSymbolProvider {\n\n    protected readonly nameProvider: NameProvider;\n    protected readonly nodeKindProvider: NodeKindProvider;\n\n    constructor(services: LangiumServices) {\n        this.nameProvider = services.references.NameProvider;\n        this.nodeKindProvider = services.shared.lsp.NodeKindProvider;\n    }\n\n    getSymbols(document: LangiumDocument, _params: DocumentSymbolParams, _cancelToken?: CancellationToken): MaybePromise<DocumentSymbol[]> {\n        return this.getSymbol(document, document.parseResult.value);\n    }\n\n    protected getSymbol(document: LangiumDocument, astNode: AstNode): DocumentSymbol[] {\n        const nameNode = this.nameProvider.getNameNode(astNode);\n        if (nameNode && astNode.$cstNode) {\n            const computedName = this.nameProvider.getName(astNode);\n            return [ this.createSymbol(document, astNode, astNode.$cstNode, nameNode, computedName) ];\n        } else {\n            return this.getChildSymbols(document, astNode) || [];\n        }\n    }\n\n    protected createSymbol(document: LangiumDocument, astNode: AstNode, cstNode: CstNode, nameNode: CstNode, computedName?: string): DocumentSymbol {\n        return {\n            kind: this.nodeKindProvider.getSymbolKind(astNode),\n            name: computedName || nameNode.text,\n            range: cstNode.range,\n            selectionRange: nameNode.range,\n            children: this.getChildSymbols(document, astNode)\n        };\n    }\n\n    protected getChildSymbols(document: LangiumDocument, astNode: AstNode): DocumentSymbol[] | undefined {\n        const children: DocumentSymbol[] = [];\n\n        for (const child of streamContents(astNode)) {\n            const result = this.getSymbol(document, child);\n            children.push(...result);\n        }\n        if (children.length > 0) {\n            return children;\n        }\n        return undefined;\n    }\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type {\n    DidChangeWatchedFilesParams, DidChangeWatchedFilesRegistrationOptions, Disposable, Event, TextDocumentChangeEvent, TextDocumentWillSaveEvent, TextEdit, FileSystemWatcher\n} from 'vscode-languageserver';\nimport { DidChangeWatchedFilesNotification, FileChangeType } from 'vscode-languageserver';\nimport { stream } from '../utils/stream.js';\nimport { URI } from '../utils/uri-utils.js';\nimport type { DocumentBuilder } from '../workspace/document-builder.js';\nimport type { TextDocument } from '../workspace/documents.js';\nimport type { WorkspaceLock } from '../workspace/workspace-lock.js';\nimport type { LangiumSharedServices } from './lsp-services.js';\nimport type { WorkspaceManager } from '../workspace/workspace-manager.js';\nimport type { ServiceRegistry } from '../service-registry.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport { Emitter } from '../utils/event.js';\n\n/**\n * Shared service for handling text document changes and watching relevant files.\n */\nexport interface DocumentUpdateHandler {\n\n    /**\n     * A document open event was triggered by the `TextDocuments` service.\n     * @param event The document change event.\n     */\n    didOpenDocument?(event: TextDocumentChangeEvent<TextDocument>): void;\n\n    /**\n     * A content change event was triggered by the `TextDocuments` service.\n     * @param event The document change event.\n     */\n    didChangeContent?(event: TextDocumentChangeEvent<TextDocument>): void;\n\n    /**\n     * A document save event (initiated) was triggered by the `TextDocuments` service.\n     * @param event The document change event.\n     */\n    willSaveDocument?(event: TextDocumentWillSaveEvent<TextDocument>): void;\n\n    /**\n     * A document save event (initiated) was triggered by the `TextDocuments` service.\n     * @param event The document change event.\n     * @returns An array of text edits which will be applied to the document before it is saved.\n     */\n    willSaveDocumentWaitUntil?(event: TextDocumentWillSaveEvent<TextDocument>): MaybePromise<TextEdit[]>;\n\n    /**\n     * A document save event (completed) was triggered by the `TextDocuments` service.\n     * @param event The document change event.\n     */\n    didSaveDocument?(event: TextDocumentChangeEvent<TextDocument>): void;\n\n    /**\n     * A document close event was triggered by the `TextDocuments` service.\n     * @param event The document change event.\n     */\n    didCloseDocument?(event: TextDocumentChangeEvent<TextDocument>): void;\n\n    /**\n     * The client detected changes to files and folders watched by the language client.\n     * @param params The files/folders change event.\n     */\n    didChangeWatchedFiles?(params: DidChangeWatchedFilesParams): void;\n\n    /**\n     * Register a listener for raw file system changes. Which changes are actually reported\n     * depends on the file system watcher configuration.\n     */\n    onWatchedFilesChange(callback: (params: DidChangeWatchedFilesParams) => void): Disposable;\n\n}\n\nexport class DefaultDocumentUpdateHandler implements DocumentUpdateHandler {\n\n    protected readonly workspaceManager: WorkspaceManager;\n    protected readonly documentBuilder: DocumentBuilder;\n    protected readonly workspaceLock: WorkspaceLock;\n    protected readonly serviceRegistry: ServiceRegistry;\n    protected readonly onWatchedFilesChangeEmitter = new Emitter<DidChangeWatchedFilesParams>();\n\n    constructor(services: LangiumSharedServices) {\n        this.workspaceManager = services.workspace.WorkspaceManager;\n        this.documentBuilder = services.workspace.DocumentBuilder;\n        this.workspaceLock = services.workspace.WorkspaceLock;\n        this.serviceRegistry = services.ServiceRegistry;\n\n        let canRegisterFileWatcher = false;\n        services.lsp.LanguageServer.onInitialize(params => {\n            canRegisterFileWatcher = Boolean(params.capabilities.workspace?.didChangeWatchedFiles?.dynamicRegistration);\n        });\n\n        services.lsp.LanguageServer.onInitialized(_params => {\n            if (canRegisterFileWatcher) {\n                this.registerFileWatcher(services);\n            }\n        });\n    }\n\n    protected registerFileWatcher(services: LangiumSharedServices): void {\n        const watchers = this.getWatchers();\n        if (watchers.length > 0) {\n            const connection = services.lsp.Connection;\n            const options: DidChangeWatchedFilesRegistrationOptions = { watchers };\n            connection?.client.register(DidChangeWatchedFilesNotification.type, options);\n        }\n    }\n\n    protected getWatchers(): FileSystemWatcher[] {\n        return [{\n            // We need to watch all file changes in the workspace\n            // Otherwise we miss changes to directories\n            // This is a limitation of specific language client implementations\n            globPattern: '**/*'\n        }];\n    }\n\n    protected fireDocumentUpdate(changed: URI[], deleted: URI[]): void {\n        // Only fire the document update when the workspace manager is ready\n        // Otherwise, we might miss the initial indexing of the workspace\n        this.workspaceManager.ready.then(() => {\n            this.workspaceLock.write(token => this.documentBuilder.update(changed, deleted, token));\n        }).catch(err => {\n            // This should never happen, but if it does, we want to know about it\n            console.error('Workspace initialization failed. Could not perform document update.', err);\n        });\n    }\n\n    didChangeContent(change: TextDocumentChangeEvent<TextDocument>): void {\n        this.fireDocumentUpdate([URI.parse(change.document.uri)], []);\n    }\n\n    didChangeWatchedFiles(params: DidChangeWatchedFilesParams): void {\n        this.onWatchedFilesChangeEmitter.fire(params);\n        const changedUris = stream(params.changes)\n            .filter(c => c.type !== FileChangeType.Deleted)\n            .distinct(c => c.uri)\n            .map(c => URI.parse(c.uri))\n            .toArray();\n        const deletedUris = stream(params.changes)\n            .filter(c => c.type === FileChangeType.Deleted)\n            .distinct(c => c.uri)\n            .map(c => URI.parse(c.uri))\n            .toArray();\n        this.fireDocumentUpdate(changedUris, deletedUris);\n    }\n\n    get onWatchedFilesChange(): Event<DidChangeWatchedFilesParams> {\n        return this.onWatchedFilesChangeEmitter.event;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { FoldingRangeParams } from 'vscode-languageserver';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { LangiumServices } from './lsp-services.js';\nimport type { AstNode, CstNode } from '../syntax-tree.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport { FoldingRange, FoldingRangeKind } from 'vscode-languageserver';\nimport { streamAllContents } from '../utils/ast-utils.js';\nimport { flattenCst } from '../utils/cst-utils.js';\n\n/**\n * Language-specific service for handling folding range requests.\n */\nexport interface FoldingRangeProvider {\n    /**\n     * Handle a folding range request.\n     *\n     * @param document The document to compute folding ranges for\n     * @param params The folding range parameters\n     * @param cancelToken A cancellation token that can be used to cancel the request\n     * @returns The computed folding ranges\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    getFoldingRanges(document: LangiumDocument, params: FoldingRangeParams, cancelToken?: CancellationToken): MaybePromise<FoldingRange[]>;\n}\n\nexport type FoldingRangeAcceptor = (foldingRange: FoldingRange) => void;\n\nexport class DefaultFoldingRangeProvider implements FoldingRangeProvider {\n\n    protected readonly commentNames: string[];\n\n    constructor(services: LangiumServices) {\n        this.commentNames = services.parser.GrammarConfig.multilineCommentRules;\n    }\n\n    getFoldingRanges(document: LangiumDocument, _params: FoldingRangeParams, _cancelToken?: CancellationToken): MaybePromise<FoldingRange[]> {\n        const foldings: FoldingRange[] = [];\n        const acceptor: FoldingRangeAcceptor = (foldingRange) => foldings.push(foldingRange);\n        this.collectFolding(document, acceptor);\n        return foldings;\n    }\n\n    protected collectFolding(document: LangiumDocument, acceptor: FoldingRangeAcceptor): void {\n        const root = document.parseResult?.value;\n        if (root) {\n            if (this.shouldProcessContent(root)) {\n                const treeIterator = streamAllContents(root).iterator();\n                let result: IteratorResult<AstNode>;\n                do {\n                    result = treeIterator.next();\n                    if (!result.done) {\n                        const node = result.value;\n                        if (this.shouldProcess(node)) {\n                            this.collectObjectFolding(document, node, acceptor);\n                        }\n                        if (!this.shouldProcessContent(node)) {\n                            treeIterator.prune();\n                        }\n                    }\n                } while (!result.done);\n            }\n\n            this.collectCommentFolding(document, root, acceptor);\n        }\n    }\n\n    /**\n     * Template method to determine whether the specified `AstNode` should be handled by the folding range provider.\n     * Returns true by default for all nodes. Returning false only ignores the specified node and not its content.\n     * To ignore the content of a node use `shouldProcessContent`.\n     */\n    protected shouldProcess(_node: AstNode): boolean {\n        return true;\n    }\n\n    /**\n     * Template method to determine whether the content/children of the specified `AstNode` should be handled by the folding range provider.\n     * Returns true by default for all nodes. Returning false ignores _all_ content of this node, even transitive ones.\n     * For more precise control over foldings use the `shouldProcess` method.\n     */\n    protected shouldProcessContent(_node: AstNode): boolean {\n        return true;\n    }\n\n    protected collectObjectFolding(document: LangiumDocument, node: AstNode, acceptor: FoldingRangeAcceptor): void {\n        const cstNode = node.$cstNode;\n        if (cstNode) {\n            const foldingRange = this.toFoldingRange(document, cstNode);\n            if (foldingRange) {\n                acceptor(foldingRange);\n            }\n        }\n    }\n\n    protected collectCommentFolding(document: LangiumDocument, node: AstNode, acceptor: FoldingRangeAcceptor): void {\n        const cstNode = node.$cstNode;\n        if (cstNode) {\n            for (const node of flattenCst(cstNode)) {\n                if (this.commentNames.includes(node.tokenType.name)) {\n                    const foldingRange = this.toFoldingRange(document, node, FoldingRangeKind.Comment);\n                    if (foldingRange) {\n                        acceptor(foldingRange);\n                    }\n                }\n            }\n        }\n    }\n\n    protected toFoldingRange(document: LangiumDocument, node: CstNode, kind?: string): FoldingRange | undefined {\n        const range = node.range;\n        const start = range.start;\n        let end = range.end;\n        // Don't generate foldings for nodes that are less than 3 lines\n        if (end.line - start.line < 2) {\n            return undefined;\n        }\n        // As we don't want to hide the end token like 'if { ... --> } <--',\n        // we simply select the end of the previous line as the end position\n        if (!this.includeLastFoldingLine(node, kind)) {\n            end = document.textDocument.positionAt(document.textDocument.offsetAt({ line: end.line, character: 0 }) - 1);\n        }\n        return FoldingRange.create(start.line, end.line, start.character, end.character, kind);\n    }\n\n    /**\n     * Template method to determine whether the folding range for this cst node should include its last line.\n     * Returns false by default for ast nodes which end in braces and for comments.\n     */\n    protected includeLastFoldingLine(node: CstNode, kind?: string): boolean {\n        if (kind === FoldingRangeKind.Comment) {\n            return false;\n        }\n\n        const nodeText = node.text;\n        const endChar = nodeText.charAt(nodeText.length - 1);\n        if (endChar === '}' || endChar === ')' || endChar === ']') {\n            return false;\n        }\n\n        return true;\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\n/**\n * This service implements a [fuzzy matching](https://en.wikipedia.org/wiki/Approximate_string_matching) method.\n */\nexport interface FuzzyMatcher {\n    /**\n     * Performs [fuzzy matching](https://en.wikipedia.org/wiki/Approximate_string_matching).\n     *\n     * Fuzzy matching improves search/completion user experience by allowing to omit characters.\n     * For example, a query such as `FuMa` matches the text `FuzzyMatcher`.\n     *\n     * @param query The user input search query.\n     * @param text The text that should be matched against the query.\n     * @returns Whether the query matches the text.\n     */\n    match(query: string, text: string): boolean;\n}\n\nexport class DefaultFuzzyMatcher implements FuzzyMatcher {\n\n    match(query: string, text: string): boolean {\n        if (query.length === 0) {\n            return true;\n        }\n\n        let matchedFirstCharacter = false;\n        let previous: number | undefined;\n        let character = 0;\n        const len = text.length;\n        for (let i = 0; i < len; i++) {\n            const strChar = text.charCodeAt(i);\n            const testChar = query.charCodeAt(character);\n            if (strChar === testChar || this.toUpperCharCode(strChar) === this.toUpperCharCode(testChar)) {\n                matchedFirstCharacter ||=\n                    previous === undefined || // Beginning of word\n                    this.isWordTransition(previous, strChar);\n                if (matchedFirstCharacter) {\n                    character++;\n                }\n                if (character === query.length) {\n                    return true;\n                }\n            }\n            previous = strChar;\n        }\n        return false;\n    }\n\n    protected isWordTransition(previous: number, current: number): boolean {\n        return a <= previous && previous <= z && A <= current && current <= Z || // camelCase transition\n            previous === _ && current !== _; // snake_case transition\n    }\n\n    protected toUpperCharCode(charCode: number) {\n        if (a <= charCode && charCode <= z) {\n            return charCode - 32;\n        }\n        return charCode;\n    }\n}\n\nconst a = 'a'.charCodeAt(0);\nconst z = 'z'.charCodeAt(0);\nconst A = 'A'.charCodeAt(0);\nconst Z = 'Z'.charCodeAt(0);\nconst _ = '_'.charCodeAt(0);\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { Hover, HoverParams } from 'vscode-languageserver';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { GrammarConfig } from '../languages/grammar-config.js';\nimport type { References } from '../references/references.js';\nimport type { LangiumServices } from './lsp-services.js';\nimport type { AstNode } from '../syntax-tree.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport type { DocumentationProvider } from '../documentation/documentation-provider.js';\nimport { findCommentNode, findDeclarationNodeAtOffset } from '../utils/cst-utils.js';\nimport { isKeyword } from '../languages/generated/ast.js';\nimport { isJSDoc, parseJSDoc } from '../documentation/jsdoc.js';\nimport { isAstNodeWithComment } from '../serializer/json-serializer.js';\n\n/**\n * Language-specific service for handling hover requests.\n */\nexport interface HoverProvider {\n    /**\n     * Handle a hover request.\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    getHoverContent(document: LangiumDocument, params: HoverParams, cancelToken?: CancellationToken): MaybePromise<Hover | undefined>;\n}\n\nexport abstract class AstNodeHoverProvider implements HoverProvider {\n\n    protected readonly references: References;\n    protected readonly grammarConfig: GrammarConfig;\n\n    constructor(services: LangiumServices) {\n        this.references = services.references.References;\n        this.grammarConfig = services.parser.GrammarConfig;\n    }\n\n    async getHoverContent(document: LangiumDocument, params: HoverParams): Promise<Hover | undefined> {\n        const rootNode = document.parseResult?.value?.$cstNode;\n        if (rootNode) {\n            const offset = document.textDocument.offsetAt(params.position);\n            const cstNode = findDeclarationNodeAtOffset(rootNode, offset, this.grammarConfig.nameRegexp);\n            if (cstNode && cstNode.offset + cstNode.length > offset) {\n                const contents: string[] = [];\n                const targetNodes = this.references.findDeclarations(cstNode);\n                for (const targetNode of targetNodes) {\n                    const content = await this.getAstNodeHoverContent(targetNode);\n                    if (typeof content === 'string') {\n                        contents.push(content);\n                    }\n                }\n                if (contents.length > 0) {\n                    return {\n                        contents: {\n                            kind: 'markdown',\n                            value: contents.join(' ')\n                        }\n                    };\n                }\n\n                // Add support for documentation on keywords\n                if (isKeyword(cstNode.grammarSource)) {\n                    return this.getKeywordHoverContent(cstNode.grammarSource);\n                }\n            }\n        }\n        return undefined;\n    }\n\n    protected abstract getAstNodeHoverContent(node: AstNode): MaybePromise<string | undefined>;\n\n    protected getKeywordHoverContent(node: AstNode): MaybePromise<Hover | undefined> {\n        let comment = isAstNodeWithComment(node) ? node.$comment : undefined;\n        if (!comment) {\n            comment = findCommentNode(node.$cstNode, ['ML_COMMENT'])?.text;\n        }\n        if (comment && isJSDoc(comment)) {\n            const content = parseJSDoc(comment).toMarkdown();\n            if (content) {\n                return {\n                    contents: {\n                        kind: 'markdown',\n                        value: content\n                    }\n                };\n            }\n        }\n        return undefined;\n    }\n}\n\nexport class MultilineCommentHoverProvider extends AstNodeHoverProvider {\n\n    protected readonly documentationProvider: DocumentationProvider;\n\n    constructor(services: LangiumServices) {\n        super(services);\n        this.documentationProvider = services.documentation.DocumentationProvider;\n    }\n\n    protected getAstNodeHoverContent(node: AstNode): MaybePromise<string | undefined> {\n        const content = this.documentationProvider.getDocumentation(node);\n\n        if (content) {\n            return content;\n        }\n        return undefined;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type {\n    CallHierarchyIncomingCallsParams,\n    CallHierarchyOutgoingCallsParams,\n    CancellationToken,\n    Connection,\n    Disposable,\n    Event,\n    HandlerResult,\n    InitializedParams,\n    InitializeParams,\n    InitializeResult,\n    SemanticTokens,\n    SemanticTokensDelta,\n    SemanticTokensDeltaParams,\n    SemanticTokensDeltaPartialResult,\n    SemanticTokensParams,\n    SemanticTokensPartialResult,\n    SemanticTokensRangeParams,\n    TextDocumentIdentifier,\n    TypeHierarchySubtypesParams,\n    TypeHierarchySupertypesParams\n} from 'vscode-languageserver';\nimport { DidChangeConfigurationNotification, Emitter, LSPErrorCodes, ResponseError, TextDocumentSyncKind } from 'vscode-languageserver-protocol';\nimport { eagerLoad } from '../dependency-injection.js';\nimport type { LangiumCoreServices } from '../services.js';\nimport { isOperationCancelled, type MaybePromise } from '../utils/promise-utils.js';\nimport { URI } from '../utils/uri-utils.js';\nimport type { ConfigurationInitializedParams } from '../workspace/configuration.js';\nimport { DocumentState, type LangiumDocument } from '../workspace/documents.js';\nimport { mergeCompletionProviderOptions } from './completion/completion-provider.js';\nimport type { LangiumSharedServices, PartialLangiumLSPServices } from './lsp-services.js';\nimport { mergeSemanticTokenProviderOptions } from './semantic-token-provider.js';\nimport { mergeSignatureHelpOptions } from './signature-help-provider.js';\n\nexport interface LanguageServer {\n    initialize(params: InitializeParams): Promise<InitializeResult>\n    initialized(params: InitializedParams): void\n    onInitialize(callback: (params: InitializeParams) => void): Disposable\n    onInitialized(callback: (params: InitializedParams) => void): Disposable\n}\n\n/**\n * Language-specific core and optional LSP services.\n * To be used while accessing the language-specific services via the service registry without a-priori knowledge about the presence of LSP services for the particular languages.\n * Shared services should be accessed via the language server's `services` property.\n */\nexport type LangiumCoreAndPartialLSPServices = Omit<LangiumCoreServices & PartialLangiumLSPServices, 'shared'>\n\ntype LangiumServerRequestHandler<P, R, E> = (params: P, token: CancellationToken) => HandlerResult<R | null, E, R | null>;\ntype LangiumRequestHandler<P, R, E> = (params: P, token: CancellationToken) => HandlerResult<R | null, E, R | null>;\n\nexport class DefaultLanguageServer implements LanguageServer {\n\n    protected onInitializeEmitter = new Emitter<InitializeParams>();\n    protected onInitializedEmitter = new Emitter<InitializedParams>();\n\n    protected readonly services: LangiumSharedServices;\n\n    constructor(services: LangiumSharedServices) {\n        this.services = services;\n    }\n\n    get onInitialize(): Event<InitializeParams> {\n        return this.onInitializeEmitter.event;\n    }\n\n    get onInitialized(): Event<InitializedParams> {\n        return this.onInitializedEmitter.event;\n    }\n\n    async initialize(params: InitializeParams): Promise<InitializeResult> {\n        this.eagerLoadServices();\n\n        this.fireInitializeOnDefaultServices(params);\n\n        this.onInitializeEmitter.fire(params);\n        this.onInitializeEmitter.dispose();\n        return this.buildInitializeResult(params);\n    }\n\n    /**\n     * Eagerly loads all services before emitting the `onInitialize` event.\n     * Ensures that all services are able to catch the event.\n     */\n    protected eagerLoadServices(): void {\n        eagerLoad(this.services);\n        this.services.ServiceRegistry.all.forEach(language => eagerLoad(language));\n    }\n\n    protected hasService(callback: (language: LangiumCoreAndPartialLSPServices) => object | undefined): boolean {\n        const allServices: readonly LangiumCoreAndPartialLSPServices[] = this.services.ServiceRegistry.all;\n        return allServices.some(services => callback(services) !== undefined);\n    }\n\n    protected buildInitializeResult(_params: InitializeParams): InitializeResult {\n        const documentUpdateHandler = this.services.lsp.DocumentUpdateHandler;\n        const fileOperationOptions = this.services.lsp.FileOperationHandler?.fileOperationOptions;\n        const allServices: readonly LangiumCoreAndPartialLSPServices[] = this.services.ServiceRegistry.all;\n        const hasFormattingService = this.hasService(e => e.lsp?.Formatter);\n        const formattingOnTypeOptions = allServices.map(e => e.lsp?.Formatter?.formatOnTypeOptions).find(e => Boolean(e));\n        const hasCodeActionProvider = this.hasService(e => e.lsp?.CodeActionProvider);\n        const hasSemanticTokensProvider = this.hasService(e => e.lsp?.SemanticTokenProvider);\n        const semanticTokensOptions = mergeSemanticTokenProviderOptions(allServices.map(e => e.lsp?.SemanticTokenProvider?.semanticTokensOptions));\n        const commandNames = this.services.lsp?.ExecuteCommandHandler?.commands;\n        const hasDocumentLinkProvider = this.hasService(e => e.lsp?.DocumentLinkProvider);\n        const signatureHelpOptions = mergeSignatureHelpOptions(allServices.map(e => e.lsp?.SignatureHelp?.signatureHelpOptions));\n        const hasGoToTypeProvider = this.hasService(e => e.lsp?.TypeProvider);\n        const hasGoToImplementationProvider = this.hasService(e => e.lsp?.ImplementationProvider);\n        const hasCompletionProvider = this.hasService(e => e.lsp?.CompletionProvider);\n        const completionOptions = mergeCompletionProviderOptions(allServices.map(e => e.lsp?.CompletionProvider?.completionOptions));\n        const hasReferencesProvider = this.hasService(e => e.lsp?.ReferencesProvider);\n        const hasDocumentSymbolProvider = this.hasService(e => e.lsp?.DocumentSymbolProvider);\n        const hasDefinitionProvider = this.hasService(e => e.lsp?.DefinitionProvider);\n        const hasDocumentHighlightProvider = this.hasService(e => e.lsp?.DocumentHighlightProvider);\n        const hasFoldingRangeProvider = this.hasService(e => e.lsp?.FoldingRangeProvider);\n        const hasHoverProvider = this.hasService(e => e.lsp?.HoverProvider);\n        const hasRenameProvider = this.hasService(e => e.lsp?.RenameProvider);\n        const hasCallHierarchyProvider = this.hasService(e => e.lsp?.CallHierarchyProvider);\n        const hasTypeHierarchyProvider = this.hasService((e) => e.lsp?.TypeHierarchyProvider);\n        const hasCodeLensProvider = this.hasService(e => e.lsp?.CodeLensProvider);\n        const hasDeclarationProvider = this.hasService(e => e.lsp?.DeclarationProvider);\n        const hasInlayHintProvider = this.hasService(e => e.lsp?.InlayHintProvider);\n        const workspaceSymbolProvider = this.services.lsp?.WorkspaceSymbolProvider;\n\n        const result: InitializeResult = {\n            capabilities: {\n                workspace: {\n                    workspaceFolders: {\n                        supported: true\n                    },\n                    fileOperations: fileOperationOptions\n                },\n                executeCommandProvider: commandNames && {\n                    commands: commandNames\n                },\n                textDocumentSync: {\n                    change: TextDocumentSyncKind.Incremental,\n                    openClose: true,\n                    save: Boolean(documentUpdateHandler.didSaveDocument),\n                    willSave: Boolean(documentUpdateHandler.willSaveDocument),\n                    willSaveWaitUntil: Boolean(documentUpdateHandler.willSaveDocumentWaitUntil)\n                },\n                completionProvider: hasCompletionProvider ? completionOptions : undefined,\n                referencesProvider: hasReferencesProvider,\n                documentSymbolProvider: hasDocumentSymbolProvider,\n                definitionProvider: hasDefinitionProvider,\n                typeDefinitionProvider: hasGoToTypeProvider,\n                documentHighlightProvider: hasDocumentHighlightProvider,\n                codeActionProvider: hasCodeActionProvider,\n                documentFormattingProvider: hasFormattingService,\n                documentRangeFormattingProvider: hasFormattingService,\n                documentOnTypeFormattingProvider: formattingOnTypeOptions,\n                foldingRangeProvider: hasFoldingRangeProvider,\n                hoverProvider: hasHoverProvider,\n                renameProvider: hasRenameProvider ? {\n                    prepareProvider: true\n                } : undefined,\n                semanticTokensProvider: hasSemanticTokensProvider\n                    ? semanticTokensOptions\n                    : undefined,\n                signatureHelpProvider: signatureHelpOptions,\n                implementationProvider: hasGoToImplementationProvider,\n                callHierarchyProvider: hasCallHierarchyProvider\n                    ? {}\n                    : undefined,\n                typeHierarchyProvider: hasTypeHierarchyProvider\n                    ? {}\n                    : undefined,\n                documentLinkProvider: hasDocumentLinkProvider\n                    ? { resolveProvider: false }\n                    : undefined,\n                codeLensProvider: hasCodeLensProvider\n                    ? { resolveProvider: false }\n                    : undefined,\n                declarationProvider: hasDeclarationProvider,\n                inlayHintProvider: hasInlayHintProvider\n                    ? { resolveProvider: false }\n                    : undefined,\n                workspaceSymbolProvider: workspaceSymbolProvider\n                    ? { resolveProvider: Boolean(workspaceSymbolProvider.resolveSymbol) }\n                    : undefined\n            }\n        };\n\n        return result;\n    }\n\n    initialized(params: InitializedParams): void {\n        this.fireInitializedOnDefaultServices(params);\n\n        this.onInitializedEmitter.fire(params);\n        this.onInitializedEmitter.dispose();\n    }\n\n    protected fireInitializeOnDefaultServices(params: InitializeParams): void {\n        this.services.workspace.ConfigurationProvider.initialize(params);\n        this.services.workspace.WorkspaceManager.initialize(params);\n    }\n\n    protected fireInitializedOnDefaultServices(params: InitializedParams): void {\n        const connection = this.services.lsp.Connection;\n        const configurationParams = connection ? <ConfigurationInitializedParams>{\n            ...params,\n            register: params => connection.client.register(DidChangeConfigurationNotification.type, params),\n            fetchConfiguration: params => connection.workspace.getConfiguration(params)\n        } : params;\n\n        // do not await the promises of the following calls, as they must not block the initialization process!\n        //  otherwise, there is the danger of out-of-order processing of subsequent incoming messages from the language client\n        // however, awaiting should be possible in general, e.g. in unit test scenarios\n        this.services.workspace.ConfigurationProvider.initialized(configurationParams)\n            .catch(err => console.error('Error in ConfigurationProvider initialization:', err));\n        this.services.workspace.WorkspaceManager.initialized(params)\n            .catch(err => console.error('Error in WorkspaceManager initialization:', err));\n    }\n}\n\nexport interface ServiceRequirements {\n    readonly CallHierarchyProvider: ServiceRequirement\n    readonly CodeActionProvider: ServiceRequirement\n    readonly CodeLensProvider: ServiceRequirement\n    readonly CompletionProvider: ServiceRequirement\n    readonly DeclarationProvider: ServiceRequirement\n    readonly DefinitionProvider: ServiceRequirement\n    readonly DocumentHighlightProvider: ServiceRequirement\n    readonly DocumentLinkProvider: ServiceRequirement\n    readonly DocumentSymbolProvider: ServiceRequirement\n    readonly FoldingRangeProvider: ServiceRequirement\n    readonly Formatter: ServiceRequirement\n    readonly HoverProvider: ServiceRequirement\n    readonly ImplementationProvider: ServiceRequirement\n    readonly InlayHintProvider: ServiceRequirement\n    readonly ReferencesProvider: ServiceRequirement\n    readonly RenameProvider: ServiceRequirement\n    readonly SemanticTokenProvider: ServiceRequirement\n    readonly SignatureHelp: ServiceRequirement\n    readonly TypeHierarchyProvider: ServiceRequirement\n    readonly TypeProvider: ServiceRequirement\n    readonly WorkspaceSymbolProvider: ServiceRequirement\n}\n\nexport type ServiceRequirement = DocumentState | {\n    // Either wait for the specific document or for the whole workspace to arrive at the given state\n    readonly type: 'document' | 'workspace';\n    readonly state: DocumentState;\n}\n\nfunction isDocumentState(obj: ServiceRequirement): obj is DocumentState {\n    return typeof obj === 'number';\n}\n\nexport namespace WorkspaceState {\n    export const Parsed: ServiceRequirement = Object.freeze({ type: 'workspace', state: DocumentState.Parsed });\n    export const IndexedContent: ServiceRequirement = Object.freeze({ type: 'workspace', state: DocumentState.IndexedContent });\n    export const ComputedScopes: ServiceRequirement = Object.freeze({ type: 'workspace', state: DocumentState.ComputedScopes });\n    export const Linked: ServiceRequirement = Object.freeze({ type: 'workspace', state: DocumentState.Linked });\n    export const IndexedReferences: ServiceRequirement = Object.freeze({ type: 'workspace', state: DocumentState.IndexedReferences });\n    export const Validated: ServiceRequirement = Object.freeze({ type: 'workspace', state: DocumentState.Validated });\n}\n\nexport function startLanguageServer(services: LangiumSharedServices, serviceRequirements: Partial<ServiceRequirements> = {}): void {\n    const connection = services.lsp.Connection;\n    if (!connection) {\n        throw new Error('Starting a language server requires the languageServer.Connection service to be set.');\n    }\n\n    addDocumentUpdateHandler(connection, services);\n    addFileOperationHandler(connection, services);\n    addDiagnosticsHandler(connection, services);\n    addCompletionHandler(connection, services, serviceRequirements.CompletionProvider);\n    addFindReferencesHandler(connection, services, serviceRequirements.ReferencesProvider);\n    addDocumentSymbolHandler(connection, services, serviceRequirements.DocumentSymbolProvider);\n    addGotoDefinitionHandler(connection, services, serviceRequirements.DefinitionProvider);\n    addGoToTypeDefinitionHandler(connection, services, serviceRequirements.TypeProvider);\n    addGoToImplementationHandler(connection, services, serviceRequirements.ImplementationProvider);\n    addDocumentHighlightHandler(connection, services, serviceRequirements.DocumentHighlightProvider);\n    addFoldingRangeHandler(connection, services, serviceRequirements.FoldingRangeProvider);\n    addFormattingHandler(connection, services, serviceRequirements.Formatter);\n    addCodeActionHandler(connection, services, serviceRequirements.CodeActionProvider);\n    addRenameHandler(connection, services, serviceRequirements.RenameProvider);\n    addHoverHandler(connection, services, serviceRequirements.HoverProvider);\n    addInlayHintHandler(connection, services, serviceRequirements.InlayHintProvider);\n    addSemanticTokenHandler(connection, services, serviceRequirements.SemanticTokenProvider);\n    addExecuteCommandHandler(connection, services);\n    addSignatureHelpHandler(connection, services, serviceRequirements.SignatureHelp);\n    addCallHierarchyHandler(connection, services, serviceRequirements.CallHierarchyProvider);\n    addTypeHierarchyHandler(connection, services, serviceRequirements.TypeHierarchyProvider);\n    addCodeLensHandler(connection, services, serviceRequirements.CodeLensProvider);\n    addDocumentLinkHandler(connection, services, serviceRequirements.DocumentLinkProvider);\n    addConfigurationChangeHandler(connection, services);\n    addGoToDeclarationHandler(connection, services, serviceRequirements.DeclarationProvider);\n    addWorkspaceSymbolHandler(connection, services, serviceRequirements.WorkspaceSymbolProvider);\n\n    connection.onInitialize(params => {\n        return services.lsp.LanguageServer.initialize(params);\n    });\n    connection.onInitialized(params => {\n        services.lsp.LanguageServer.initialized(params);\n    });\n\n    // Make the text document manager listen on the connection for open, change and close text document events.\n    const documents = services.workspace.TextDocuments;\n    documents.listen(connection);\n\n    // Start listening for incoming messages from the client.\n    connection.listen();\n}\n\n/**\n * Adds a handler for document updates when content changes, or watch catches a change.\n * In the case there is no handler service registered, this function does nothing.\n */\nexport function addDocumentUpdateHandler(connection: Connection, services: LangiumSharedServices): void {\n    const handler = services.lsp.DocumentUpdateHandler;\n    const documents = services.workspace.TextDocuments;\n    if (handler.didOpenDocument) {\n        documents.onDidOpen(change => handler.didOpenDocument!(change));\n    }\n    if (handler.didChangeContent) {\n        documents.onDidChangeContent(change => handler.didChangeContent!(change));\n    }\n    if (handler.didCloseDocument) {\n        documents.onDidClose(change => handler.didCloseDocument!(change));\n    }\n    if (handler.didSaveDocument) {\n        documents.onDidSave(change => handler.didSaveDocument!(change));\n    }\n    if (handler.willSaveDocument) {\n        documents.onWillSave(event => handler.willSaveDocument!(event));\n    }\n    if (handler.willSaveDocumentWaitUntil) {\n        documents.onWillSaveWaitUntil(event => handler.willSaveDocumentWaitUntil!(event));\n    }\n    if (handler.didChangeWatchedFiles) {\n        connection.onDidChangeWatchedFiles(params => handler.didChangeWatchedFiles!(params));\n    }\n}\n\nexport function addFileOperationHandler(connection: Connection, services: LangiumSharedServices): void {\n    const handler = services.lsp.FileOperationHandler;\n    if (!handler) {\n        return;\n    }\n    if (handler.didCreateFiles) {\n        connection.workspace.onDidCreateFiles(params => handler.didCreateFiles!(params));\n    }\n    if (handler.didRenameFiles) {\n        connection.workspace.onDidRenameFiles(params => handler.didRenameFiles!(params));\n    }\n    if (handler.didDeleteFiles) {\n        connection.workspace.onDidDeleteFiles(params => handler.didDeleteFiles!(params));\n    }\n    if (handler.willCreateFiles) {\n        connection.workspace.onWillCreateFiles(params => handler.willCreateFiles!(params));\n    }\n    if (handler.willRenameFiles) {\n        connection.workspace.onWillRenameFiles(params => handler.willRenameFiles!(params));\n    }\n    if (handler.willDeleteFiles) {\n        connection.workspace.onWillDeleteFiles(params => handler.willDeleteFiles!(params));\n    }\n}\n\nexport function addDiagnosticsHandler(connection: Connection, services: LangiumSharedServices): void {\n    const documentBuilder = services.workspace.DocumentBuilder;\n    documentBuilder.onUpdate(async (_, deleted) => {\n        for (const uri of deleted) {\n            connection.sendDiagnostics({\n                uri: uri.toString(),\n                diagnostics: []\n            });\n        }\n    });\n    documentBuilder.onDocumentPhase(DocumentState.Validated, async (document) => {\n        if (document.diagnostics) {\n            connection.sendDiagnostics({\n                uri: document.uri.toString(),\n                diagnostics: document.diagnostics\n            });\n        }\n    });\n}\n\nexport function addCompletionHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Linked): void {\n    connection.onCompletion(createRequestHandler(\n        (services, document, params, cancelToken) => {\n            return services.lsp?.CompletionProvider?.getCompletion(document, params, cancelToken);\n        },\n        services,\n        requiredState\n    ));\n}\n\nexport function addFindReferencesHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = WorkspaceState.IndexedReferences): void {\n    connection.onReferences(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.ReferencesProvider?.findReferences(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addCodeActionHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Validated): void {\n    connection.onCodeAction(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.CodeActionProvider?.getCodeActions(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addDocumentSymbolHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Parsed): void {\n    connection.onDocumentSymbol(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.DocumentSymbolProvider?.getSymbols(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addGotoDefinitionHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Linked): void {\n    connection.onDefinition(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.DefinitionProvider?.getDefinition(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addGoToTypeDefinitionHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Linked): void {\n    connection.onTypeDefinition(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.TypeProvider?.getTypeDefinition(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addGoToImplementationHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = WorkspaceState.IndexedReferences): void {\n    connection.onImplementation(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.ImplementationProvider?.getImplementation(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addGoToDeclarationHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Linked): void {\n    connection.onDeclaration(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.DeclarationProvider?.getDeclaration(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addDocumentHighlightHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = WorkspaceState.IndexedReferences): void {\n    connection.onDocumentHighlight(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.DocumentHighlightProvider?.getDocumentHighlight(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addHoverHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Linked): void {\n    connection.onHover(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.HoverProvider?.getHoverContent(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addFoldingRangeHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Parsed): void {\n    connection.onFoldingRanges(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.FoldingRangeProvider?.getFoldingRanges(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addFormattingHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Parsed): void {\n    connection.onDocumentFormatting(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.Formatter?.formatDocument(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n    connection.onDocumentRangeFormatting(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.Formatter?.formatDocumentRange(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n    connection.onDocumentOnTypeFormatting(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.Formatter?.formatDocumentOnType(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addRenameHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = WorkspaceState.IndexedReferences): void {\n\n    connection.onRenameRequest(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.RenameProvider?.rename(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n    connection.onPrepareRename(createRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.RenameProvider?.prepareRename(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addInlayHintHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.IndexedReferences): void {\n    connection.languages.inlayHint.on(createServerRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.InlayHintProvider?.getInlayHints(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addSemanticTokenHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Linked): void {\n    // If no semantic token provider is registered that's fine. Just return an empty result\n    const emptyResult: SemanticTokens = { data: [] };\n    connection.languages.semanticTokens.on(createServerRequestHandler<SemanticTokensParams, SemanticTokens, SemanticTokensPartialResult, void>(\n        (services, document, params, cancelToken) => {\n            if (services.lsp?.SemanticTokenProvider) {\n                return services.lsp.SemanticTokenProvider.semanticHighlight(document, params, cancelToken);\n            }\n            return emptyResult;\n        },\n        services,\n        requiredState\n    ));\n    connection.languages.semanticTokens.onDelta(createServerRequestHandler<SemanticTokensDeltaParams, SemanticTokens | SemanticTokensDelta, SemanticTokensDeltaPartialResult, void>(\n        (services, document, params, cancelToken) => {\n            if (services.lsp?.SemanticTokenProvider) {\n                return services.lsp.SemanticTokenProvider.semanticHighlightDelta(document, params, cancelToken);\n            }\n            return emptyResult;\n        },\n        services,\n        requiredState\n    ));\n    connection.languages.semanticTokens.onRange(createServerRequestHandler<SemanticTokensRangeParams, SemanticTokens, SemanticTokensPartialResult, void>(\n        (services, document, params, cancelToken) => {\n            if (services.lsp?.SemanticTokenProvider) {\n                return services.lsp.SemanticTokenProvider.semanticHighlightRange(document, params, cancelToken);\n            }\n            return emptyResult;\n        },\n        services,\n        requiredState\n    ));\n}\nexport function addConfigurationChangeHandler(connection: Connection, services: LangiumSharedServices): void {\n    connection.onDidChangeConfiguration(change => {\n        services.workspace.ConfigurationProvider.updateConfiguration(change);\n    });\n}\n\nexport function addExecuteCommandHandler(connection: Connection, services: LangiumSharedServices): void {\n    const commandHandler = services.lsp.ExecuteCommandHandler;\n    if (commandHandler) {\n        connection.onExecuteCommand(async (params, token) => {\n            try {\n                return await commandHandler.executeCommand(params.command, params.arguments ?? [], token);\n            } catch (err) {\n                return responseError(err);\n            }\n        });\n    }\n}\n\nexport function addDocumentLinkHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.Parsed): void {\n    connection.onDocumentLinks(createServerRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.DocumentLinkProvider?.getDocumentLinks(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addSignatureHelpHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.IndexedReferences): void {\n    connection.onSignatureHelp(createServerRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.SignatureHelp?.provideSignatureHelp(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addCodeLensHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = DocumentState.IndexedReferences): void {\n    connection.onCodeLens(createServerRequestHandler(\n        (services, document, params, cancelToken) => services.lsp?.CodeLensProvider?.provideCodeLens(document, params, cancelToken),\n        services,\n        requiredState\n    ));\n}\n\nexport function addWorkspaceSymbolHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = WorkspaceState.IndexedContent): void {\n    const workspaceSymbolProvider = services.lsp.WorkspaceSymbolProvider;\n    if (workspaceSymbolProvider) {\n\n        if (isDocumentState(requiredState) || requiredState.type === 'document') {\n            throw new Error('Workspace symbol requests are independent of a certain document, so the given document-specific required state is invalid. Provide a service requirement of type \"workspace\".');\n        }\n\n        const documentBuilder = services.workspace.DocumentBuilder;\n        connection.onWorkspaceSymbol(async (params, token) => {\n            try {\n                await documentBuilder.waitUntil(requiredState.state, token);\n                return await workspaceSymbolProvider.getSymbols(params, token);\n            } catch (err) {\n                return responseError(err);\n            }\n        });\n        const resolveWorkspaceSymbol = workspaceSymbolProvider.resolveSymbol?.bind(workspaceSymbolProvider);\n        if (resolveWorkspaceSymbol) {\n            connection.onWorkspaceSymbolResolve(async (workspaceSymbol, token) => {\n                try {\n                    await documentBuilder.waitUntil(requiredState.state, token);\n                    return await resolveWorkspaceSymbol(workspaceSymbol, token);\n                } catch (err) {\n                    return responseError(err);\n                }\n            });\n        }\n    }\n}\n\nexport function addCallHierarchyHandler(connection: Connection, services: LangiumSharedServices, requiredState: ServiceRequirement = WorkspaceState.IndexedReferences): void {\n    connection.languages.callHierarchy.onPrepare(createServerRequestHandler(\n        async (services, document, params, cancelToken) => {\n            if (services.lsp?.CallHierarchyProvider) {\n                const result = await services.lsp.CallHierarchyProvider.prepareCallHierarchy(document, params, cancelToken);\n                return result ?? null;\n            }\n            return null;\n        },\n        services,\n        requiredState\n    ));\n\n    connection.languages.callHierarchy.onIncomingCalls(createHierarchyRequestHandler(\n        async (services, params, cancelToken) => {\n            if (services.lsp?.CallHierarchyProvider) {\n                const result = await services.lsp.CallHierarchyProvider.incomingCalls(params, cancelToken);\n                return result ?? null;\n            }\n            return null;\n        },\n        services,\n        requiredState\n    ));\n\n    connection.languages.callHierarchy.onOutgoingCalls(createHierarchyRequestHandler(\n        async (services, params, cancelToken) => {\n            if (services.lsp?.CallHierarchyProvider) {\n                const result = await services.lsp.CallHierarchyProvider.outgoingCalls(params, cancelToken);\n                return result ?? null;\n            }\n            return null;\n        },\n        services,\n        requiredState\n    ));\n}\n\nexport function addTypeHierarchyHandler(connection: Connection, sharedServices: LangiumSharedServices, requiredState: ServiceRequirement = WorkspaceState.IndexedReferences): void {\n    // Don't register type hierarchy handlers if no type hierarchy provider is registered\n    if (!sharedServices.ServiceRegistry.all.some((services: LangiumCoreAndPartialLSPServices) => services.lsp?.TypeHierarchyProvider)) {\n        return;\n    }\n\n    connection.languages.typeHierarchy.onPrepare(\n        createServerRequestHandler(\n            async (services, document, params, cancelToken) => {\n                const result = await services.lsp?.TypeHierarchyProvider?.prepareTypeHierarchy(document, params, cancelToken);\n                return result ?? null;\n            },\n            sharedServices,\n            requiredState\n        ),\n    );\n\n    connection.languages.typeHierarchy.onSupertypes(\n        createHierarchyRequestHandler(\n            async (services, params, cancelToken) => {\n                const result = await services.lsp?.TypeHierarchyProvider?.supertypes(params, cancelToken);\n                return result ?? null;\n            },\n            sharedServices,\n            requiredState\n        ),\n    );\n\n    connection.languages.typeHierarchy.onSubtypes(\n        createHierarchyRequestHandler(\n            async (services, params, cancelToken) => {\n                const result = await services.lsp?.TypeHierarchyProvider?.subtypes(params, cancelToken);\n                return result ?? null;\n            },\n            sharedServices,\n            requiredState\n        ),\n    );\n}\n\nexport function createHierarchyRequestHandler<P extends TypeHierarchySupertypesParams | TypeHierarchySubtypesParams | CallHierarchyIncomingCallsParams | CallHierarchyOutgoingCallsParams, R extends NonNullable<unknown>, _PR, E = void>(\n    serviceCall: (services: LangiumCoreAndPartialLSPServices, params: P, cancelToken: CancellationToken) => MaybePromise<R | null | undefined | ResponseError<E>>,\n    sharedServices: LangiumSharedServices,\n    requiredState?: ServiceRequirement\n): LangiumServerRequestHandler<P, R, E> {\n    const serviceRegistry = sharedServices.ServiceRegistry;\n    return async (params: P, cancelToken: CancellationToken) => {\n        const uri = URI.parse(params.item.uri);\n        const cancellationError = await waitUntilPhase<E>(sharedServices, cancelToken, uri, requiredState);\n        if (cancellationError) {\n            return cancellationError;\n        }\n        if (!serviceRegistry.hasServices(uri)) {\n            const errorText = `Could not find service instance for uri: '${uri}'`;\n            console.debug(errorText);\n            return responseError<E>(new Error(errorText));\n        }\n        const language = serviceRegistry.getServices(uri);\n        try {\n            return await serviceCall(language, params, cancelToken) ?? null;\n        } catch (err) {\n            return responseError<E>(err);\n        }\n    };\n}\n\nexport function createServerRequestHandler<P extends { textDocument: TextDocumentIdentifier }, R extends NonNullable<unknown>, _PR, E = void>(\n    serviceCall: (services: LangiumCoreAndPartialLSPServices, document: LangiumDocument, params: P, cancelToken: CancellationToken) => MaybePromise<R | null | undefined | ResponseError<E>>,\n    sharedServices: LangiumSharedServices,\n    requiredState?: ServiceRequirement\n): LangiumServerRequestHandler<P, R, E> {\n    const documents = sharedServices.workspace.LangiumDocuments;\n    const serviceRegistry = sharedServices.ServiceRegistry;\n    return async (params: P, cancelToken: CancellationToken) => {\n        const uri = URI.parse(params.textDocument.uri);\n        const cancellationError = await waitUntilPhase<E>(sharedServices, cancelToken, uri, requiredState);\n        if (cancellationError) {\n            return cancellationError;\n        }\n        if (!serviceRegistry.hasServices(uri)) {\n            const errorText = `Could not find service instance for uri: '${uri}'`;\n            console.debug(errorText);\n            return responseError<E>(new Error(errorText));\n        }\n        const language = serviceRegistry.getServices(uri);\n        try {\n            const document = await documents.getOrCreateDocument(uri);\n            return await serviceCall(language, document, params, cancelToken) ?? null;\n        } catch (err) {\n            return responseError<E>(err);\n        }\n    };\n}\n\nexport function createRequestHandler<P extends { textDocument: TextDocumentIdentifier }, R extends NonNullable<unknown>, E = void>(\n    serviceCall: (services: LangiumCoreAndPartialLSPServices, document: LangiumDocument, params: P, cancelToken: CancellationToken) => MaybePromise<R | null | undefined | ResponseError<E>>,\n    sharedServices: LangiumSharedServices,\n    requiredState?: ServiceRequirement\n): LangiumRequestHandler<P, R, E> {\n    const documents = sharedServices.workspace.LangiumDocuments;\n    const serviceRegistry = sharedServices.ServiceRegistry;\n    return async (params: P, cancelToken: CancellationToken) => {\n        const uri = URI.parse(params.textDocument.uri);\n        const cancellationError = await waitUntilPhase<E>(sharedServices, cancelToken, uri, requiredState);\n        if (cancellationError) {\n            return cancellationError;\n        }\n        if (!serviceRegistry.hasServices(uri)) {\n            console.debug(`Could not find service instance for uri: '${uri.toString()}'`);\n            return null;\n        }\n        const language = serviceRegistry.getServices(uri);\n        try {\n            const document = await documents.getOrCreateDocument(uri);\n            return await serviceCall(language, document, params, cancelToken) ?? null;\n        } catch (err) {\n            return responseError<E>(err);\n        }\n    };\n}\n\nasync function waitUntilPhase<E>(services: LangiumSharedServices, cancelToken: CancellationToken, uri?: URI, requiredState?: ServiceRequirement): Promise<ResponseError<E> | undefined> {\n    if (requiredState !== undefined) {\n        const documentBuilder = services.workspace.DocumentBuilder;\n        const workspaceManager = services.workspace.WorkspaceManager;\n        try {\n            await workspaceManager.ready; // mandatory if awaiting the state of a document (uri !== undefined) while the LS is starting\n            if (isDocumentState(requiredState)) {\n                await documentBuilder.waitUntil(requiredState, uri, cancelToken);\n            } else if (requiredState.type === 'document') {\n                await documentBuilder.waitUntil(requiredState.state, uri, cancelToken);\n            } else {\n                await documentBuilder.waitUntil(requiredState.state, cancelToken);\n            }\n        } catch (err) {\n            return responseError(err);\n        }\n    }\n    return undefined;\n}\n\nfunction responseError<E = void>(err: unknown): ResponseError<E> {\n    if (isOperationCancelled(err)) {\n        return new ResponseError(LSPErrorCodes.RequestCancelled, 'The request has been cancelled.');\n    }\n    if (err instanceof ResponseError) {\n        return err;\n    }\n    throw err;\n}\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\n/* eslint-disable no-bitwise */\n\nimport type { Range, SemanticTokens, SemanticTokensClientCapabilities, SemanticTokensDelta, SemanticTokensDeltaParams, SemanticTokensOptions, SemanticTokensParams, SemanticTokensRangeParams } from 'vscode-languageserver';\nimport { SemanticTokensBuilder as BaseSemanticTokensBuilder, SemanticTokenModifiers, SemanticTokenTypes } from 'vscode-languageserver';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport type { AstNode, CstNode, Properties } from '../syntax-tree.js';\nimport { streamAst } from '../utils/ast-utils.js';\nimport { inRange } from '../utils/cst-utils.js';\nimport { findNodeForKeyword, findNodeForProperty, findNodesForKeyword, findNodesForProperty } from '../utils/grammar-utils.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport { interruptAndCheck } from '../utils/promise-utils.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport type { LangiumServices } from './lsp-services.js';\n\nexport const AllSemanticTokenTypes: Record<string, number> = {\n    [SemanticTokenTypes.class]: 0,\n    [SemanticTokenTypes.comment]: 1,\n    [SemanticTokenTypes.enum]: 2,\n    [SemanticTokenTypes.enumMember]: 3,\n    [SemanticTokenTypes.event]: 4,\n    [SemanticTokenTypes.function]: 5,\n    [SemanticTokenTypes.interface]: 6,\n    [SemanticTokenTypes.keyword]: 7,\n    [SemanticTokenTypes.macro]: 8,\n    [SemanticTokenTypes.method]: 9,\n    [SemanticTokenTypes.modifier]: 10,\n    [SemanticTokenTypes.namespace]: 11,\n    [SemanticTokenTypes.number]: 12,\n    [SemanticTokenTypes.operator]: 13,\n    [SemanticTokenTypes.parameter]: 14,\n    [SemanticTokenTypes.property]: 15,\n    [SemanticTokenTypes.regexp]: 16,\n    [SemanticTokenTypes.string]: 17,\n    [SemanticTokenTypes.struct]: 18,\n    [SemanticTokenTypes.type]: 19,\n    [SemanticTokenTypes.typeParameter]: 20,\n    [SemanticTokenTypes.variable]: 21,\n    [SemanticTokenTypes.decorator]: 22\n};\n\nexport const AllSemanticTokenModifiers: Record<string, number> = {\n    [SemanticTokenModifiers.abstract]: 1 << 0,\n    [SemanticTokenModifiers.async]: 1 << 1,\n    [SemanticTokenModifiers.declaration]: 1 << 2,\n    [SemanticTokenModifiers.defaultLibrary]: 1 << 3,\n    [SemanticTokenModifiers.definition]: 1 << 4,\n    [SemanticTokenModifiers.deprecated]: 1 << 5,\n    [SemanticTokenModifiers.documentation]: 1 << 6,\n    [SemanticTokenModifiers.modification]: 1 << 7,\n    [SemanticTokenModifiers.readonly]: 1 << 8,\n    [SemanticTokenModifiers.static]: 1 << 9\n};\n\n/**\n * @deprecated Since 3.2.0. `SemanticTokenProvider` now supplies its own options.\n */\nexport const DefaultSemanticTokenOptions: SemanticTokensOptions = {\n    legend: {\n        tokenTypes: Object.keys(AllSemanticTokenTypes),\n        tokenModifiers: Object.keys(AllSemanticTokenModifiers)\n    },\n    full: {\n        delta: false\n    },\n    range: true\n};\n\nexport interface SemanticTokenProvider {\n    semanticHighlight(document: LangiumDocument, params: SemanticTokensParams, cancelToken?: CancellationToken): MaybePromise<SemanticTokens>\n    semanticHighlightRange(document: LangiumDocument, params: SemanticTokensRangeParams, cancelToken?: CancellationToken): MaybePromise<SemanticTokens>\n    semanticHighlightDelta(document: LangiumDocument, params: SemanticTokensDeltaParams, cancelToken?: CancellationToken): MaybePromise<SemanticTokens | SemanticTokensDelta>\n    readonly tokenTypes: Record<string, number>\n    readonly tokenModifiers: Record<string, number>\n    readonly semanticTokensOptions: SemanticTokensOptions\n}\n\nexport function mergeSemanticTokenProviderOptions(options: Array<SemanticTokensOptions | undefined>): SemanticTokensOptions {\n    const tokenTypes: string[] = [];\n    const tokenModifiers: string[] = [];\n    let full = true;\n    let delta = true;\n    let range = true;\n    for (const option of options) {\n        if (!option) {\n            continue;\n        }\n        option.legend.tokenTypes.forEach((tokenType, index) => {\n            const existing = tokenTypes[index];\n            if (existing && existing !== tokenType) {\n                throw new Error(`Cannot merge '${existing}' and '${tokenType}' token types. They use the same index ${index}.`);\n            } else {\n                tokenTypes[index] = tokenType;\n            }\n        });\n        option.legend.tokenModifiers.forEach((tokenModifier, index) => {\n            const existing = tokenModifiers[index];\n            if (existing && existing !== tokenModifier) {\n                throw new Error(`Cannot merge '${existing}' and '${tokenModifier}' token modifier. They use the same index ${index}.`);\n            } else {\n                tokenModifiers[index] = tokenModifier;\n            }\n        });\n        if (!option.full) {\n            full = false;\n        } else if (typeof option.full === 'object' && !option.full.delta) {\n            delta = false;\n        }\n        if (!option.range) {\n            range = false;\n        }\n    }\n    return {\n        legend: {\n            tokenTypes,\n            tokenModifiers,\n        },\n        full: full && { delta },\n        range,\n    };\n}\n\nexport interface SemanticToken {\n    line: number\n    char: number\n    length: number\n    tokenType: number\n    tokenModifiers: number\n}\n\nexport type SemanticTokenAcceptorOptions<N extends AstNode = AstNode> = ({\n    line: number;\n    char: number;\n    length: number;\n} | {\n    node: N;\n    property: Properties<N>;\n    index?: number;\n} | {\n    node: N;\n    keyword: string;\n    index?: number;\n} | {\n    cst: CstNode;\n} | {\n    range: Range;\n}) & {\n    type: string;\n    modifier?: string | string[];\n}\n\nexport interface SemanticTokenPropertyOptions<T extends AstNode> {\n    node: T;\n    property: Properties<T>;\n    index?: number;\n    type: string;\n    modifier?: string | string[];\n}\n\nexport interface SemanticTokenKeywordOptions {\n    node: AstNode;\n    keyword: string;\n    index?: number;\n    type: string;\n    modifier?: string | string[];\n}\n\nexport interface SemanticTokenNodeOptions {\n    node: CstNode;\n    type: string;\n    modifier?: string | string[];\n}\n\nexport interface SemanticTokenRangeOptions {\n    range: Range\n    type: string\n    modifier?: string | string[]\n}\n\nexport class SemanticTokensBuilder extends BaseSemanticTokensBuilder {\n    private _tokens: SemanticToken[] = [];\n\n    override push(line: number, char: number, length: number, tokenType: number, tokenModifiers: number): void {\n        this._tokens.push({\n            line,\n            char,\n            length,\n            tokenType,\n            tokenModifiers\n        });\n    }\n\n    override build(): SemanticTokens {\n        this.applyTokens();\n        return super.build();\n    }\n\n    override buildEdits(): SemanticTokens | SemanticTokensDelta {\n        this.applyTokens();\n        return super.buildEdits();\n    }\n\n    /**\n     * Flushes the cached delta token values\n     */\n    flush(): void {\n        this.previousResult(this.id);\n    }\n\n    private applyTokens(): void {\n        for (const token of this._tokens.sort(this.compareTokens)) {\n            super.push(token.line, token.char, token.length, token.tokenType, token.tokenModifiers);\n        }\n        this._tokens = [];\n    }\n\n    private compareTokens(a: SemanticToken, b: SemanticToken): number {\n        // Branchless comparison for line and character\n        return (a.line - b.line) || (a.char - b.char);\n    }\n}\n\nexport type SemanticTokenAcceptor = <N extends AstNode = AstNode>(options: SemanticTokenAcceptorOptions<N>) => void;\n\n/**\n * A basic super class for providing semantic token data.\n * Users of Langium should extend this class to create their own `SemanticTokenProvider`.\n *\n * The entry method for generating semantic tokens based on an `AstNode` is the `highlightElement` method.\n */\nexport abstract class AbstractSemanticTokenProvider implements SemanticTokenProvider {\n\n    /**\n     * Store a token builder for each open document.\n     */\n    protected tokensBuilders = new Map<string, SemanticTokensBuilder>();\n    protected currentDocument?: LangiumDocument;\n    protected currentTokensBuilder?: SemanticTokensBuilder;\n    protected currentRange?: Range;\n    protected clientCapabilities?: SemanticTokensClientCapabilities;\n\n    constructor(services: LangiumServices) {\n        // Delete the token builder once the text document has been closed\n        services.shared.workspace.TextDocuments.onDidClose(e => {\n            this.tokensBuilders.delete(e.document.uri);\n        });\n        services.shared.lsp.LanguageServer.onInitialize(params => {\n            this.initialize(params.capabilities.textDocument?.semanticTokens);\n        });\n    }\n\n    initialize(clientCapabilities?: SemanticTokensClientCapabilities): void {\n        this.clientCapabilities = clientCapabilities;\n    }\n\n    get tokenTypes(): Record<string, number> {\n        return AllSemanticTokenTypes;\n    }\n\n    get tokenModifiers(): Record<string, number> {\n        return AllSemanticTokenModifiers;\n    }\n\n    get semanticTokensOptions(): SemanticTokensOptions {\n        return {\n            legend: {\n                tokenTypes: Object.keys(this.tokenTypes),\n                tokenModifiers: Object.keys(this.tokenModifiers),\n            },\n            full: {\n                // The semantic token delta support is disabled by default in Langium.\n                // Since Langium recomputes the whole document on every change, we cannot provide a good delta.\n                // Adopters can override this if they support it.\n                delta: false\n            },\n            range: true,\n        };\n    }\n\n    async semanticHighlight(document: LangiumDocument, _params: SemanticTokensParams, cancelToken = CancellationToken.None): Promise<SemanticTokens> {\n        this.currentRange = undefined;\n        this.currentDocument = document;\n        this.currentTokensBuilder = this.getDocumentTokensBuilder(document);\n        this.currentTokensBuilder.flush();\n        await this.computeHighlighting(document, this.createAcceptor(), cancelToken);\n        return this.currentTokensBuilder.build();\n    }\n\n    async semanticHighlightRange(document: LangiumDocument, params: SemanticTokensRangeParams, cancelToken = CancellationToken.None): Promise<SemanticTokens> {\n        this.currentRange = params.range;\n        this.currentDocument = document;\n        this.currentTokensBuilder = this.getDocumentTokensBuilder(document);\n        this.currentTokensBuilder.flush();\n        await this.computeHighlighting(document, this.createAcceptor(), cancelToken);\n        return this.currentTokensBuilder.build();\n    }\n\n    async semanticHighlightDelta(document: LangiumDocument, params: SemanticTokensDeltaParams, cancelToken = CancellationToken.None): Promise<SemanticTokens | SemanticTokensDelta> {\n        this.currentRange = undefined;\n        this.currentDocument = document;\n        this.currentTokensBuilder = this.getDocumentTokensBuilder(document);\n        this.currentTokensBuilder.previousResult(params.previousResultId);\n        await this.computeHighlighting(document, this.createAcceptor(), cancelToken);\n        return this.currentTokensBuilder.buildEdits();\n    }\n\n    protected createAcceptor(): SemanticTokenAcceptor {\n        const acceptor: SemanticTokenAcceptor = options => {\n            if ('line' in options) {\n                this.highlightToken({\n                    range: {\n                        start: {\n                            line: options.line,\n                            character: options.char\n                        },\n                        end: {\n                            line: options.line,\n                            character: options.char + options.length\n                        }\n                    },\n                    type: options.type,\n                    modifier: options.modifier\n                });\n            } else if ('range' in options) {\n                this.highlightToken(options);\n            } else if ('keyword' in options) {\n                this.highlightKeyword(options);\n            } else if ('property' in options) {\n                this.highlightProperty(options);\n            } else {\n                this.highlightNode({\n                    node: options.cst,\n                    type: options.type,\n                    modifier: options.modifier\n                });\n            }\n        };\n        return acceptor;\n    }\n\n    protected getDocumentTokensBuilder(document: LangiumDocument): SemanticTokensBuilder {\n        const existing = this.tokensBuilders.get(document.uri.toString());\n        if (existing) {\n            return existing;\n        }\n        const builder = new SemanticTokensBuilder();\n        this.tokensBuilders.set(document.uri.toString(), builder);\n        return builder;\n    }\n\n    protected async computeHighlighting(document: LangiumDocument, acceptor: SemanticTokenAcceptor, cancelToken: CancellationToken): Promise<void> {\n        const root = document.parseResult.value;\n        const treeIterator = streamAst(root, { range: this.currentRange }).iterator();\n        let result: IteratorResult<AstNode>;\n        do {\n            result = treeIterator.next();\n            if (!result.done) {\n                await interruptAndCheck(cancelToken);\n                const node = result.value;\n                if (this.highlightElement(node, acceptor) === 'prune') {\n                    treeIterator.prune();\n                }\n            }\n        } while (!result.done);\n    }\n\n    /**\n     * @return `'prune'` to skip the children of this element, nothing otherwise.\n     */\n    protected abstract highlightElement(node: AstNode, acceptor: SemanticTokenAcceptor): void | undefined | 'prune';\n\n    protected highlightToken(options: SemanticTokenRangeOptions): void {\n        const { range, type } = options;\n        let modifiers = options.modifier;\n        if ((this.currentRange && !inRange(range, this.currentRange)) || !this.currentDocument || !this.currentTokensBuilder) {\n            return;\n        }\n        const intType = this.tokenTypes[type];\n        let totalModifier = 0;\n        if (modifiers !== undefined) {\n            if (typeof modifiers === 'string') {\n                modifiers = [modifiers];\n            }\n            for (const modifier of modifiers) {\n                const intModifier = this.tokenModifiers[modifier];\n                totalModifier |= intModifier;\n            }\n        }\n        const startLine = range.start.line;\n        const endLine = range.end.line;\n        if (startLine === endLine) {\n            // Token only spans a single line\n            const char = range.start.character;\n            const length = range.end.character - char;\n            this.currentTokensBuilder.push(startLine, char, length, intType, totalModifier);\n        } else if (this.clientCapabilities?.multilineTokenSupport) {\n            // Let token span multiple lines\n            const startChar = range.start.character;\n            const startOffset = this.currentDocument.textDocument.offsetAt(range.start);\n            const endOffset = this.currentDocument.textDocument.offsetAt(range.end);\n            this.currentTokensBuilder.push(startLine, startChar, endOffset - startOffset, intType, totalModifier);\n        } else {\n            // Token spans multiple lines, but the client doesn't support it\n            // Split the range into multiple semantic tokens\n            const firstLineStart = range.start;\n            let nextLineOffset = this.currentDocument.textDocument.offsetAt({\n                line: startLine + 1,\n                character: 0\n            });\n            // Build first line\n            this.currentTokensBuilder.push(\n                firstLineStart.line,\n                firstLineStart.character,\n                nextLineOffset - firstLineStart.character - 1,\n                intType,\n                totalModifier\n            );\n            // Build all lines in between first and last\n            for (let i = startLine + 1; i < endLine; i++) {\n                const currentLineOffset = nextLineOffset;\n                nextLineOffset = this.currentDocument.textDocument.offsetAt({\n                    line: i + 1,\n                    character: 0\n                });\n                this.currentTokensBuilder.push(\n                    i,\n                    0,\n                    nextLineOffset - currentLineOffset - 1,\n                    intType, totalModifier\n                );\n            }\n            // Build last line\n            this.currentTokensBuilder.push(\n                endLine,\n                0,\n                range.end.character,\n                intType,\n                totalModifier\n            );\n        }\n    }\n\n    protected highlightProperty<N extends AstNode>(options: SemanticTokenPropertyOptions<N>): void {\n        const nodes: CstNode[] = [];\n        if (typeof options.index === 'number') {\n            const node = findNodeForProperty(options.node.$cstNode, options.property, options.index);\n            if (node) {\n                nodes.push(node);\n            }\n        } else {\n            nodes.push(...findNodesForProperty(options.node.$cstNode, options.property));\n        }\n        const { type, modifier } = options;\n        for (const node of nodes) {\n            this.highlightNode({\n                node,\n                type,\n                modifier\n            });\n        }\n    }\n\n    protected highlightKeyword(options: SemanticTokenKeywordOptions): void {\n        const { node, keyword, type, index, modifier } = options;\n        const nodes: CstNode[] = [];\n        if (typeof index === 'number') {\n            const keywordNode = findNodeForKeyword(node.$cstNode, keyword, index);\n            if (keywordNode) {\n                nodes.push(keywordNode);\n            }\n        } else {\n            nodes.push(...findNodesForKeyword(node.$cstNode, keyword));\n        }\n        for (const keywordNode of nodes) {\n            this.highlightNode({\n                node: keywordNode,\n                type,\n                modifier\n            });\n        }\n    }\n\n    protected highlightNode(options: SemanticTokenNodeOptions): void {\n        const { node, type, modifier } = options;\n        const range = node.range;\n        this.highlightToken({\n            range,\n            type,\n            modifier\n        });\n    }\n\n}\n\nexport namespace SemanticTokensDecoder {\n    export interface DecodedSemanticToken {\n        offset: number;\n        tokenType: SemanticTokenTypes;\n        tokenModifiers: number;\n        text: string;\n    }\n\n    export function decode<T extends AstNode = AstNode>(tokens: SemanticTokens, tokenTypes: Record<string, number>, document: LangiumDocument<T>): DecodedSemanticToken[] {\n        const typeMap = new Map<number, SemanticTokenTypes>();\n        Object.entries(tokenTypes).forEach(([type, index]) => typeMap.set(index, type as SemanticTokenTypes));\n        let line = 0;\n        let character = 0;\n        return sliceIntoChunks(tokens.data, 5).map(t => {\n            line += t[0];\n            if (t[0] !== 0) {\n                character = 0;\n            }\n            character += t[1];\n            const length = t[2];\n            const offset = document.textDocument.offsetAt({ line, character });\n            return {\n                offset,\n                tokenType: typeMap.get(t[3])!,\n                tokenModifiers: t[4],\n                text: document.textDocument.getText({ start: { line, character }, end: { line, character: character + length } })\n            } as DecodedSemanticToken;\n        });\n    }\n\n    function sliceIntoChunks<T>(arr: T[], chunkSize: number) {\n        const res = [];\n        for (let i = 0; i < arr.length; i += chunkSize) {\n            const chunk = arr.slice(i, i + chunkSize);\n            res.push(chunk);\n        }\n        return res;\n    }\n}\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { SignatureHelp, SignatureHelpOptions, SignatureHelpParams } from 'vscode-languageserver';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport type { AstNode } from '../syntax-tree.js';\nimport { findLeafNodeAtOffset } from '../utils/cst-utils.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\n\n/**\n * Language-specific service for handling signature help requests.\n */\nexport interface SignatureHelpProvider {\n    /**\n     * Handles a signature help request\n     */\n    provideSignatureHelp(document: LangiumDocument, params: SignatureHelpParams, cancelToken?: CancellationToken): MaybePromise<SignatureHelp | undefined>;\n    /**\n     * Options that determine the server capabilities for a signature help request. It contains the list of triggering characters.\n     */\n    get signatureHelpOptions(): SignatureHelpOptions;\n}\n\nexport abstract class AbstractSignatureHelpProvider implements SignatureHelpProvider {\n    provideSignatureHelp(document: LangiumDocument, params: SignatureHelpParams, cancelToken = CancellationToken.None): MaybePromise<SignatureHelp | undefined> {\n        const rootNode = document.parseResult.value;\n        const cst = rootNode.$cstNode;\n        if (cst) {\n            const sourceCstNode = findLeafNodeAtOffset(cst, document.textDocument.offsetAt(params.position));\n            if (sourceCstNode) {\n                return this.getSignatureFromElement(sourceCstNode.astNode, cancelToken);\n            }\n        }\n        return undefined;\n    }\n\n    /**\n     * Override this method to return the desired SignatureHelp\n     */\n    protected abstract getSignatureFromElement(element: AstNode, cancelToken: CancellationToken): MaybePromise<SignatureHelp | undefined>;\n\n    /**\n     * Override this getter to return the list of triggering characters for your language. To deactivate the signature help, return an empty object.\n     */\n    get signatureHelpOptions(): SignatureHelpOptions {\n        return {\n            triggerCharacters: ['('],\n            retriggerCharacters: [',']\n        };\n    }\n}\n\n/**\n * Merges the SignatureHelpOptions of all languages\n */\nexport function mergeSignatureHelpOptions(options: Array<SignatureHelpOptions | undefined>): SignatureHelpOptions | undefined {\n    const triggerCharacters: string[] = [];\n    const retriggerCharacters: string[] = [];\n\n    options.forEach(option => {\n        if (option?.triggerCharacters) {\n            triggerCharacters.push(...option.triggerCharacters);\n        }\n        if (option?.retriggerCharacters) {\n            retriggerCharacters.push(...option.retriggerCharacters);\n        }\n    });\n\n    const mergedOptions: SignatureHelpOptions = {\n        triggerCharacters: triggerCharacters.length > 0 ? Array.from(new Set(triggerCharacters)).sort() : undefined,\n        retriggerCharacters: retriggerCharacters.length > 0 ? Array.from(new Set(retriggerCharacters)).sort() : undefined\n    };\n\n    return mergedOptions.triggerCharacters ? mergedOptions : undefined;\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { AstNode, AstNodeDescription } from '../syntax-tree.js';\nimport { CompletionItemKind, SymbolKind } from 'vscode-languageserver';\n\n/**\n * This service consolidates the logic for gathering LSP kind information based on AST nodes or their descriptions.\n */\nexport interface NodeKindProvider {\n    /**\n     * Returns a `SymbolKind` as used by `WorkspaceSymbolProvider` or `DocumentSymbolProvider`.\n     * @param node AST node or node description.\n     * @returns The corresponding symbol kind.\n     */\n    getSymbolKind(node: AstNode | AstNodeDescription): SymbolKind;\n    /**\n     * Returns a `CompletionItemKind` as used by the `CompletionProvider`.\n     * @param node AST node or node description.\n     * @returns The corresponding completion item kind.\n     */\n    getCompletionItemKind(node: AstNode | AstNodeDescription): CompletionItemKind;\n}\n\n/**\n * Default implementation of the `NodeKindProvider` interface.\n * @remarks This implementation returns `SymbolKind.Field` for all nodes and `CompletionItemKind.Reference` for all nodes. Extend this class to customize symbol and completion types your langauge.\n */\nexport class DefaultNodeKindProvider implements NodeKindProvider {\n    /**\n     * @remarks The default implementation returns `SymbolKind.Field` for all nodes.\n     */\n    getSymbolKind(_node: AstNode | AstNodeDescription): SymbolKind {\n        return SymbolKind.Field;\n    }\n    /**\n     * @remarks The default implementation returns `CompletionItemKind.Reference` for all nodes.\n     */\n    getCompletionItemKind(_node: AstNode | AstNodeDescription): CompletionItemKind {\n        return CompletionItemKind.Reference;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { ReferenceParams } from 'vscode-languageserver';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { NameProvider } from '../references/name-provider.js';\nimport type { References } from '../references/references.js';\nimport type { LeafCstNode } from '../syntax-tree.js';\nimport type { LangiumServices } from './lsp-services.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport type { GrammarConfig } from '../languages/grammar-config.js';\nimport { Location } from 'vscode-languageserver';\nimport { findDeclarationNodeAtOffset } from '../utils/cst-utils.js';\n\n/**\n * Language-specific service for handling find references requests.\n */\nexport interface ReferencesProvider {\n    /**\n     * Handle a find references request.\n     *\n     * @param document The document in which to search for references.\n     * @param params The parameters of the find references request.\n     * @param cancelToken A cancellation token that can be used to cancel the request.\n     * @returns The locations of the references.\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    findReferences(document: LangiumDocument, params: ReferenceParams, cancelToken?: CancellationToken): MaybePromise<Location[]>;\n}\n\nexport class DefaultReferencesProvider implements ReferencesProvider {\n    protected readonly nameProvider: NameProvider;\n    protected readonly references: References;\n    protected readonly grammarConfig: GrammarConfig;\n\n    constructor(services: LangiumServices) {\n        this.nameProvider = services.references.NameProvider;\n        this.references = services.references.References;\n        this.grammarConfig = services.parser.GrammarConfig;\n    }\n\n    findReferences(document: LangiumDocument, params: ReferenceParams, _cancelToken?: CancellationToken): MaybePromise<Location[]> {\n        const rootNode = document.parseResult.value.$cstNode;\n        if (!rootNode) {\n            return [];\n        }\n\n        const selectedNode = findDeclarationNodeAtOffset(rootNode, document.textDocument.offsetAt(params.position), this.grammarConfig.nameRegexp);\n        if (!selectedNode) {\n            return [];\n        }\n\n        return this.getReferences(selectedNode, params, document);\n    }\n\n    protected getReferences(selectedNode: LeafCstNode, params: ReferenceParams, _document: LangiumDocument): Location[] {\n        const locations: Location[] = [];\n        const targetAstNode = this.references.findDeclarations(selectedNode);\n        for (const target of targetAstNode) {\n            const options = { includeDeclaration: params.context.includeDeclaration };\n            this.references.findReferences(target, options).forEach(reference => {\n                locations.push(Location.create(reference.sourceUri.toString(), reference.segment.range));\n            });\n        }\n        return locations;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { Position, Range, RenameParams, TextDocumentPositionParams, WorkspaceEdit } from 'vscode-languageserver-protocol';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { GrammarConfig } from '../languages/grammar-config.js';\nimport type { NameProvider } from '../references/name-provider.js';\nimport type { References } from '../references/references.js';\nimport type { LangiumServices } from './lsp-services.js';\nimport type { CstNode } from '../syntax-tree.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { LangiumDocument } from '../workspace/documents.js';\nimport { TextEdit } from 'vscode-languageserver-types';\nimport { isNamed } from '../references/name-provider.js';\nimport { findDeclarationNodeAtOffset } from '../utils/cst-utils.js';\n\n/**\n * Language-specific service for handling rename requests and prepare rename requests.\n */\nexport interface RenameProvider {\n    /**\n     * Handle a rename request.\n     *\n     * @param document The document in which the rename request was triggered.\n     * @param params The rename parameters.\n     * @param cancelToken A cancellation token that can be used to cancel the request.\n     * @returns A workspace edit that describes the changes to be applied to the workspace.\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    rename(document: LangiumDocument, params: RenameParams, cancelToken?: CancellationToken): MaybePromise<WorkspaceEdit | undefined>;\n\n    /**\n     * Handle a prepare rename request.\n     *\n     * @param document The document in which the prepare rename request was triggered.\n     * @param params The prepare rename parameters.\n     * @param cancelToken A cancellation token that can be used to cancel the request.\n     * @returns A range that describes the range of the symbol to be renamed.\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    prepareRename(document: LangiumDocument, params: TextDocumentPositionParams, cancelToken?: CancellationToken): MaybePromise<Range | undefined>;\n}\n\nexport class DefaultRenameProvider implements RenameProvider {\n\n    protected readonly references: References;\n    protected readonly nameProvider: NameProvider;\n    protected readonly grammarConfig: GrammarConfig;\n\n    constructor(services: LangiumServices) {\n        this.references = services.references.References;\n        this.nameProvider = services.references.NameProvider;\n        this.grammarConfig = services.parser.GrammarConfig;\n    }\n\n    async rename(document: LangiumDocument, params: RenameParams, _cancelToken?: CancellationToken): Promise<WorkspaceEdit | undefined> {\n        const changes: Record<string, TextEdit[]> = {};\n        const rootNode = document.parseResult.value.$cstNode;\n        if (!rootNode) {\n            return undefined;\n        }\n        const offset = document.textDocument.offsetAt(params.position);\n        const leafNode = findDeclarationNodeAtOffset(rootNode, offset, this.grammarConfig.nameRegexp);\n        if (!leafNode) {\n            return undefined;\n        }\n        const targetNodes = this.references.findDeclarations(leafNode);\n        if (targetNodes.length === 0) {\n            return undefined;\n        }\n        // We only need to find the references to a single target node\n        // All other nodes should be found via `findReferences` if done correctly\n        const targetNode = targetNodes[0];\n        const options = { onlyLocal: false, includeDeclaration: true };\n        const references = this.references.findReferences(targetNode, options);\n        for (const ref of references) {\n            const change = TextEdit.replace(ref.segment.range, params.newName);\n            const uri = ref.sourceUri.toString();\n            if (changes[uri]) {\n                changes[uri].push(change);\n            } else {\n                changes[uri] = [change];\n            }\n        }\n        return { changes };\n    }\n\n    prepareRename(document: LangiumDocument, params: TextDocumentPositionParams, _cancelToken?: CancellationToken): MaybePromise<Range | undefined> {\n        return this.renameNodeRange(document, params.position);\n    }\n\n    protected renameNodeRange(doc: LangiumDocument, position: Position): Range | undefined {\n        const rootNode = doc.parseResult.value.$cstNode;\n        const offset = doc.textDocument.offsetAt(position);\n        if (rootNode) {\n            const leafNode = findDeclarationNodeAtOffset(rootNode, offset, this.grammarConfig.nameRegexp);\n            if (!leafNode) {\n                return undefined;\n            }\n            const isCrossRef = this.references.findDeclarations(leafNode).length > 0;\n            // return range if selected CstNode is the name node or it is a crosslink which points to a declaration\n            if (isCrossRef || this.isNameNode(leafNode)) {\n                return leafNode.range;\n            }\n        }\n        return undefined;\n    }\n\n    protected isNameNode(leafNode: CstNode | undefined): boolean | undefined {\n        return leafNode?.astNode && isNamed(leafNode.astNode) && leafNode === this.nameProvider.getNameNode(leafNode.astNode);\n    }\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { WorkspaceSymbol, WorkspaceSymbolParams } from 'vscode-languageserver';\nimport type { LangiumSharedServices } from './lsp-services.js';\nimport type { IndexManager } from '../workspace/index-manager.js';\nimport type { MaybePromise} from '../utils/promise-utils.js';\nimport type { AstNodeDescription } from '../syntax-tree.js';\nimport type { NodeKindProvider } from './node-kind-provider.js';\nimport type { FuzzyMatcher } from './fuzzy-matcher.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { interruptAndCheck } from '../utils/promise-utils.js';\n\n/**\n * Shared service for handling workspace symbols requests.\n */\nexport interface WorkspaceSymbolProvider {\n    /**\n     * Handle a workspace symbols request.\n     *\n     * @param params workspaces symbols request parameters\n     * @param cancelToken a cancellation token tha can be used to cancel the request\n     * @returns a list of workspace symbols\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    getSymbols(params: WorkspaceSymbolParams, cancelToken?: CancellationToken): MaybePromise<WorkspaceSymbol[]>;\n    /**\n     * Handle a resolve request for a workspace symbol.\n     *\n     * @param symbol the workspace symbol to resolve\n     * @param cancelToken a cancellation token tha can be used to cancel the request\n     * @returns the resolved workspace symbol\n     *\n     * @throws `OperationCancelled` if cancellation is detected during execution\n     * @throws `ResponseError` if an error is detected that should be sent as response to the client\n     */\n    resolveSymbol?(symbol: WorkspaceSymbol, cancelToken?: CancellationToken): MaybePromise<WorkspaceSymbol>;\n}\n\nexport class DefaultWorkspaceSymbolProvider implements WorkspaceSymbolProvider {\n\n    protected readonly indexManager: IndexManager;\n    protected readonly nodeKindProvider: NodeKindProvider;\n    protected readonly fuzzyMatcher: FuzzyMatcher;\n\n    constructor(services: LangiumSharedServices) {\n        this.indexManager = services.workspace.IndexManager;\n        this.nodeKindProvider = services.lsp.NodeKindProvider;\n        this.fuzzyMatcher = services.lsp.FuzzyMatcher;\n    }\n\n    async getSymbols(params: WorkspaceSymbolParams, cancelToken = CancellationToken.None): Promise<WorkspaceSymbol[]> {\n        const workspaceSymbols: WorkspaceSymbol[] = [];\n        const query = params.query.toLowerCase();\n        for (const description of this.indexManager.allElements()) {\n            await interruptAndCheck(cancelToken);\n            if (this.fuzzyMatcher.match(query, description.name)) {\n                const symbol = this.getWorkspaceSymbol(description);\n                if (symbol) {\n                    workspaceSymbols.push(symbol);\n                }\n            }\n        }\n        return workspaceSymbols;\n    }\n\n    protected getWorkspaceSymbol(astDescription: AstNodeDescription): WorkspaceSymbol | undefined {\n        const nameSegment = astDescription.nameSegment;\n        if (nameSegment) {\n            return {\n                kind: this.nodeKindProvider.getSymbolKind(astDescription),\n                name: astDescription.name,\n                location: {\n                    range: nameSegment.range,\n                    uri: astDescription.documentUri.toString()\n                }\n            };\n        } else {\n            return undefined;\n        }\n    }\n}\n", "/******************************************************************************\n * Copyright 2024 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type {\n    Connection, DidOpenTextDocumentParams, DidChangeTextDocumentParams, DidCloseTextDocumentParams, TextDocumentsConfiguration, TextDocumentChangeEvent,\n    TextDocumentWillSaveEvent, RequestHandler, TextEdit, Event, WillSaveTextDocumentParams, CancellationToken, DidSaveTextDocumentParams,\n    NotebookCell,\n    NotebookDocument,\n    DocumentUri,\n    NotificationHandler,\n    NotebookDocuments as LSPNotebookDocuments\n} from 'vscode-languageserver';\nimport { TextDocumentSyncKind, Disposable, Emitter } from 'vscode-languageserver';\nimport type { URI } from '../utils/uri-utils.js';\nimport { UriUtils } from '../utils/uri-utils.js';\n\n// `NotebookDocumentChangeEvent` is not re-exported from vscode-languageserver's public entry,\n// so we derive it from the public `NotebookDocuments#onDidChange` event instead of duplicating it.\nexport type NotebookDocumentChangeEvent =\n    LSPNotebookDocuments<{ uri: DocumentUri }>['onDidChange'] extends Event<infer E> ? E : never;\n\nexport type TextDocumentConnection = Pick<Connection,\n'onDidOpenTextDocument' |\n'onDidChangeTextDocument' |\n'onDidCloseTextDocument' |\n'onWillSaveTextDocument' |\n'onWillSaveTextDocumentWaitUntil' |\n'onDidSaveTextDocument'\n>;\n\n/**\n * A manager service that keeps track of all currently opened text documents.\n *\n * Designed to be compatible with the `TextDocuments` class in the `vscode-languageserver` package.\n */\nexport interface TextDocuments<T extends { uri: string }> {\n    /**\n     * An event that fires when a text document managed by this manager\n     * has been opened.\n     */\n    readonly onDidOpen: Event<TextDocumentChangeEvent<T>>;\n    /**\n     * An event that fires when a text document managed by this manager\n     * has been opened or the content changes.\n     */\n    readonly onDidChangeContent: Event<TextDocumentChangeEvent<T>>;\n    /**\n     * An event that fires when a text document managed by this manager\n     * will be saved.\n     */\n    readonly onWillSave: Event<TextDocumentWillSaveEvent<T>>;\n    /**\n     * Sets a handler that will be called if a participant wants to provide\n     * edits during a text document save.\n     */\n    onWillSaveWaitUntil(handler: RequestHandler<TextDocumentWillSaveEvent<T>, TextEdit[], void>): void;\n    /**\n     * An event that fires when a text document managed by this manager\n     * has been saved.\n     */\n    readonly onDidSave: Event<TextDocumentChangeEvent<T>>;\n    /**\n     * An event that fires when a text document managed by this manager\n     * has been closed.\n     */\n    readonly onDidClose: Event<TextDocumentChangeEvent<T>>;\n    /**\n     * Returns the document for the given URI. Returns undefined if\n     * the document is not managed by this instance.\n     *\n     * @param uri The text document's URI to retrieve.\n     * @return the text document or `undefined`.\n     */\n    get(uri: string | URI): T | undefined;\n    /**\n     * Sets the text document managed by this instance.\n     * @param document The text document to add.\n     * @returns `true` if the document didn't exist yet, `false` if it was already present.\n     */\n    set(document: T): boolean;\n    /**\n     * Deletes a text document managed by this instance.\n     */\n    delete(uri: string | URI | T): void;\n    /**\n     * Returns all text documents managed by this instance.\n     *\n     * @return all text documents.\n     */\n    all(): T[];\n    /**\n     * Returns the URIs of all text documents managed by this instance.\n     *\n     * @return the URI's of all text documents.\n     */\n    keys(): string[];\n    /**\n     * Listens for `low level` notification on the given connection to\n     * update the text documents managed by this instance.\n     *\n     * Please note that the connection only provides handlers not an event model. Therefore\n     * listening on a connection will overwrite the following handlers on a connection:\n     * `onDidOpenTextDocument`, `onDidChangeTextDocument`, `onDidCloseTextDocument`,\n     * `onWillSaveTextDocument`, `onWillSaveTextDocumentWaitUntil` and `onDidSaveTextDocument`.\n     *\n     * Use the corresponding events on the TextDocuments instance instead.\n     *\n     * @param connection The connection to listen on.\n     */\n    listen(connection: TextDocumentConnection): Disposable;\n}\n\n// Adapted from:\n// https://github.com/microsoft/vscode-languageserver-node/blob/8f5fa710d3a9f60ff5e7583a9e61b19f86e39da3/server/src/common/textDocuments.ts\n\n/* --------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n * ------------------------------------------------------------------------------------------ */\n\n/**\n * Normalizing text document manager. Normalizes all incoming URIs to the same format used by VS Code.\n */\nexport class NormalizedTextDocuments<T extends { uri: string }> implements TextDocuments<T> {\n\n    private readonly _configuration: TextDocumentsConfiguration<T>;\n\n    private readonly _syncedDocuments: Map<string, T>;\n\n    private readonly _onDidChangeContent: Emitter<TextDocumentChangeEvent<T>>;\n    private readonly _onDidOpen: Emitter<TextDocumentChangeEvent<T>>;\n    private readonly _onDidClose: Emitter<TextDocumentChangeEvent<T>>;\n    private readonly _onDidSave: Emitter<TextDocumentChangeEvent<T>>;\n    private readonly _onWillSave: Emitter<TextDocumentWillSaveEvent<T>>;\n    private _willSaveWaitUntil: RequestHandler<TextDocumentWillSaveEvent<T>, TextEdit[], void> | undefined;\n\n    public constructor(configuration: TextDocumentsConfiguration<T>) {\n        this._configuration = configuration;\n        this._syncedDocuments = new Map();\n\n        this._onDidChangeContent = new Emitter<TextDocumentChangeEvent<T>>();\n        this._onDidOpen = new Emitter<TextDocumentChangeEvent<T>>();\n        this._onDidClose = new Emitter<TextDocumentChangeEvent<T>>();\n        this._onDidSave = new Emitter<TextDocumentChangeEvent<T>>();\n        this._onWillSave = new Emitter<TextDocumentWillSaveEvent<T>>();\n    }\n\n    public get onDidOpen(): Event<TextDocumentChangeEvent<T>> {\n        return this._onDidOpen.event;\n    }\n\n    public get onDidChangeContent(): Event<TextDocumentChangeEvent<T>> {\n        return this._onDidChangeContent.event;\n    }\n\n    public get onWillSave(): Event<TextDocumentWillSaveEvent<T>> {\n        return this._onWillSave.event;\n    }\n\n    public onWillSaveWaitUntil(handler: RequestHandler<TextDocumentWillSaveEvent<T>, TextEdit[], void>) {\n        this._willSaveWaitUntil = handler;\n    }\n\n    public get onDidSave(): Event<TextDocumentChangeEvent<T>> {\n        return this._onDidSave.event;\n    }\n\n    public get onDidClose(): Event<TextDocumentChangeEvent<T>> {\n        return this._onDidClose.event;\n    }\n\n    public get(uri: string | URI): T | undefined {\n        return this._syncedDocuments.get(UriUtils.normalize(uri));\n    }\n\n    public set(document: T): boolean {\n        const uri = UriUtils.normalize(document.uri);\n        let result = true;\n        if (this._syncedDocuments.has(uri)) {\n            result = false;\n        }\n        this._syncedDocuments.set(uri, document);\n        const toFire = Object.freeze({ document });\n        this._onDidOpen.fire(toFire);\n        this._onDidChangeContent.fire(toFire);\n        return result;\n    }\n\n    public delete(uri: string | T | URI): void {\n        const uriString = UriUtils.normalize(typeof uri === 'object' && 'uri' in uri ? uri.uri : uri);\n        const syncedDocument = this._syncedDocuments.get(uriString);\n        if (syncedDocument !== undefined) {\n            this._syncedDocuments.delete(uriString);\n            this._onDidClose.fire(Object.freeze({ document: syncedDocument }));\n        }\n    }\n\n    public all(): T[] {\n        return Array.from(this._syncedDocuments.values());\n    }\n\n    public keys(): string[] {\n        return Array.from(this._syncedDocuments.keys());\n    }\n\n    public listen(connection: Connection): Disposable {\n        // Required for interoperability with the the vscode-languageserver package\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        (connection as any).__textDocumentSync = TextDocumentSyncKind.Incremental;\n        const disposables: Disposable[] = [];\n        disposables.push(connection.onDidOpenTextDocument((event: DidOpenTextDocumentParams) => {\n            const td = event.textDocument;\n            const uri = UriUtils.normalize(td.uri);\n            const document = this._configuration.create(uri, td.languageId, td.version, td.text);\n\n            this._syncedDocuments.set(uri, document);\n            const toFire = Object.freeze({ document });\n            this._onDidOpen.fire(toFire);\n            this._onDidChangeContent.fire(toFire);\n        }));\n        disposables.push(connection.onDidChangeTextDocument((event: DidChangeTextDocumentParams) => {\n            const td = event.textDocument;\n            const changes = event.contentChanges;\n            if (changes.length === 0) {\n                return;\n            }\n\n            const { version } = td;\n            if (version === null || version === undefined) {\n                throw new Error(`Received document change event for ${td.uri} without valid version identifier`);\n            }\n            const uri = UriUtils.normalize(td.uri);\n\n            let syncedDocument = this._syncedDocuments.get(uri);\n            if (syncedDocument !== undefined) {\n                syncedDocument = this._configuration.update(syncedDocument, changes, version);\n                this._syncedDocuments.set(uri, syncedDocument);\n                this._onDidChangeContent.fire(Object.freeze({ document: syncedDocument }));\n            }\n        }));\n        disposables.push(connection.onDidCloseTextDocument((event: DidCloseTextDocumentParams) => {\n            const uri = UriUtils.normalize(event.textDocument.uri);\n            const syncedDocument = this._syncedDocuments.get(uri);\n            if (syncedDocument !== undefined) {\n                this._syncedDocuments.delete(uri);\n                this._onDidClose.fire(Object.freeze({ document: syncedDocument }));\n            }\n        }));\n        disposables.push(connection.onWillSaveTextDocument((event: WillSaveTextDocumentParams) => {\n            const syncedDocument = this._syncedDocuments.get(UriUtils.normalize(event.textDocument.uri));\n            if (syncedDocument !== undefined) {\n                this._onWillSave.fire(Object.freeze({ document: syncedDocument, reason: event.reason }));\n            }\n        }));\n        disposables.push(connection.onWillSaveTextDocumentWaitUntil((event: WillSaveTextDocumentParams, token: CancellationToken) => {\n            const syncedDocument = this._syncedDocuments.get(UriUtils.normalize(event.textDocument.uri));\n            if (syncedDocument !== undefined && this._willSaveWaitUntil) {\n                return this._willSaveWaitUntil(Object.freeze({ document: syncedDocument, reason: event.reason }), token);\n            } else {\n                return [];\n            }\n        }));\n        disposables.push(connection.onDidSaveTextDocument((event: DidSaveTextDocumentParams) => {\n            const syncedDocument = this._syncedDocuments.get(UriUtils.normalize(event.textDocument.uri));\n            if (syncedDocument !== undefined) {\n                this._onDidSave.fire(Object.freeze({ document: syncedDocument }));\n            }\n        }));\n        return Disposable.create(() => { disposables.forEach(disposable => disposable.dispose()); });\n    }\n}\n\nexport interface NotebookDocuments<T extends { uri: string }> {\n    get cellTextDocuments(): TextDocuments<T>;\n    getCellTextDocument(cell: NotebookCell): T | undefined;\n    getNotebookDocument(uri: string | URI): NotebookDocument | undefined;\n    getNotebookCell(uri: string | URI): NotebookCell | undefined;\n    findNotebookDocumentForCell(cell: string | URI | NotebookCell): NotebookDocument | undefined;\n    get onDidOpen(): Event<NotebookDocument>;\n    get onDidSave(): Event<NotebookDocument>;\n    get onDidChange(): Event<NotebookDocumentChangeEvent>;\n    get onDidClose(): Event<NotebookDocument>;\n    /**\n     * Listens for `low level` notification on the given connection to\n     * update the notebook documents managed by this instance.\n     *\n     * Please note that the connection only provides handlers not an event model. Therefore\n     * listening on a connection will overwrite the following handlers on a connection:\n     * `onDidOpenNotebookDocument`, `onDidChangeNotebookDocument`, `onDidSaveNotebookDocument`,\n     *  and `onDidCloseNotebookDocument`.\n     *\n     * @param connection The connection to listen on.\n     */\n    listen(connection: Connection): Disposable;\n}\n\nexport class NormalizedNotebookDocuments<T extends { uri: DocumentUri }> implements NotebookDocuments<T> {\n\n    private readonly notebookDocuments = new Map<DocumentUri, NotebookDocument>();\n    private readonly notebookCellMap = new Map<DocumentUri, [NotebookCell, NotebookDocument]>();\n\n    private readonly _onDidOpen = new Emitter<NotebookDocument>();\n    private readonly _onDidSave = new Emitter<NotebookDocument>();\n    private readonly _onDidChange = new Emitter<NotebookDocumentChangeEvent>();\n    private readonly _onDidClose = new Emitter<NotebookDocument>();\n\n    private readonly _cellTextDocuments: TextDocuments<T>;\n\n    constructor(configurationOrTextDocuments: TextDocumentsConfiguration<T> | TextDocuments<T>) {\n        if ('listen' in configurationOrTextDocuments) {\n            this._cellTextDocuments = configurationOrTextDocuments;\n        } else {\n            this._cellTextDocuments = new NormalizedTextDocuments<T>(configurationOrTextDocuments);\n        }\n    }\n\n    get cellTextDocuments(): TextDocuments<T> {\n        return this._cellTextDocuments;\n    }\n\n    getCellTextDocument(cell: NotebookCell): T | undefined {\n        return this._cellTextDocuments.get(cell.document);\n    }\n\n    getNotebookDocument(uri: string | URI): NotebookDocument | undefined {\n        return this.notebookDocuments.get(UriUtils.normalize(uri));\n    }\n\n    getNotebookCell(uri: string | URI): NotebookCell | undefined {\n        const value = this.notebookCellMap.get(UriUtils.normalize(uri));\n        return value && value[0];\n    }\n\n    findNotebookDocumentForCell(cell: string | URI | NotebookCell): NotebookDocument | undefined {\n        const key = typeof cell === 'string' || 'scheme' in cell ? cell : cell.document;\n        const value = this.notebookCellMap.get(UriUtils.normalize(key));\n        return value && value[1];\n    }\n\n    get onDidOpen(): Event<NotebookDocument> {\n        return this._onDidOpen.event;\n    }\n\n    get onDidSave(): Event<NotebookDocument> {\n        return this._onDidSave.event;\n    }\n\n    get onDidChange(): Event<NotebookDocumentChangeEvent> {\n        return this._onDidChange.event;\n    }\n\n    get onDidClose(): Event<NotebookDocument> {\n        return this._onDidClose.event;\n    }\n\n    /**\n     * Listens for `low level` notification on the given connection to\n     * update the notebook documents managed by this instance.\n     *\n     * Please note that the connection only provides handlers not an event model. Therefore\n     * listening on a connection will overwrite the following handlers on a connection:\n     * `onDidOpenNotebookDocument`, `onDidChangeNotebookDocument`, `onDidSaveNotebookDocument`,\n     *  and `onDidCloseNotebookDocument`.\n     *\n     * @param connection The connection to listen on.\n     */\n    listen(connection: Connection): Disposable {\n        const cellTextDocumentConnection = new CellTextDocumentConnection();\n        const disposables: Disposable[] = [];\n\n        disposables.push(this.cellTextDocuments.listen(cellTextDocumentConnection));\n        disposables.push(connection.notebooks.synchronization.onDidOpenNotebookDocument((params) => {\n            const uri = UriUtils.normalize(params.notebookDocument.uri);\n            this.notebookDocuments.set(uri, params.notebookDocument);\n            for (const cellTextDocument of params.cellTextDocuments) {\n                cellTextDocumentConnection.openTextDocument({ textDocument: cellTextDocument });\n            }\n            this.updateCellMap(params.notebookDocument);\n            this._onDidOpen.fire(params.notebookDocument);\n        }));\n        disposables.push(connection.notebooks.synchronization.onDidChangeNotebookDocument((params) => {\n            const uri = UriUtils.normalize(params.notebookDocument.uri);\n            const notebookDocument = this.notebookDocuments.get(uri);\n            if (notebookDocument === undefined) {\n                return;\n            }\n            notebookDocument.version = params.notebookDocument.version;\n            const oldMetadata = notebookDocument.metadata;\n            let metadataChanged: boolean = false;\n            const change = params.change;\n            if (change.metadata !== undefined) {\n                metadataChanged = true;\n                notebookDocument.metadata = change.metadata;\n            }\n\n            const opened: DocumentUri[] = [];\n            const closed: DocumentUri[] = [];\n            const data: Required<Required<Required<NotebookDocumentChangeEvent>['cells']>['changed']>['data'] = [];\n            const text: DocumentUri[] = [];\n            if (change.cells !== undefined) {\n                const changedCells = change.cells;\n                if (changedCells.structure !== undefined) {\n                    const array = changedCells.structure.array;\n                    notebookDocument.cells.splice(array.start, array.deleteCount, ...(array.cells !== undefined ? array.cells : []));\n                    // Additional open cell text documents.\n                    if (changedCells.structure.didOpen !== undefined) {\n                        for (const open of changedCells.structure.didOpen) {\n                            cellTextDocumentConnection.openTextDocument({ textDocument: open });\n                            opened.push(open.uri);\n                        }\n                    }\n                    // Additional closed cell test documents.\n                    if (changedCells.structure.didClose) {\n                        for (const close of changedCells.structure.didClose) {\n                            cellTextDocumentConnection.closeTextDocument({ textDocument: close });\n                            closed.push(close.uri);\n                        }\n                    }\n                }\n                if (changedCells.data !== undefined) {\n                    const cellUpdates: Map<string, NotebookCell> = new Map(changedCells.data.map(cell => [cell.document, cell]));\n                    for (let i = 0; i <= notebookDocument.cells.length; i++) {\n                        const change = cellUpdates.get(notebookDocument.cells[i].document);\n                        if (change !== undefined) {\n                            const old = notebookDocument.cells.splice(i, 1, change);\n                            data.push({ old: old[0], new: change });\n                            cellUpdates.delete(change.document);\n                            if (cellUpdates.size === 0) {\n                                break;\n                            }\n                        }\n                    }\n                }\n                if (changedCells.textContent !== undefined) {\n                    for (const cellTextDocument of changedCells.textContent) {\n                        cellTextDocumentConnection.changeTextDocument({ textDocument: cellTextDocument.document, contentChanges: cellTextDocument.changes });\n                        text.push(cellTextDocument.document.uri);\n                    }\n                }\n            }\n\n            // Update internal data structure.\n            this.updateCellMap(notebookDocument);\n\n            const changeEvent: NotebookDocumentChangeEvent = { notebookDocument };\n            if (metadataChanged) {\n                changeEvent.metadata = { old: oldMetadata, new: notebookDocument.metadata };\n            }\n\n            const added: NotebookCell[] = [];\n            for (const open of opened) {\n                added.push(this.getNotebookCell(open)!);\n            }\n            const removed: NotebookCell[] = [];\n            for (const close of closed) {\n                removed.push(this.getNotebookCell(close)!);\n            }\n            const textContent: NotebookCell[] = [];\n            for (const change of text) {\n                textContent.push(this.getNotebookCell(change)!);\n            }\n            if (added.length > 0 || removed.length > 0 || data.length > 0 || textContent.length > 0) {\n                changeEvent.cells = { added, removed, changed: { data, textContent } };\n            }\n            if (changeEvent.metadata !== undefined || changeEvent.cells !== undefined) {\n                this._onDidChange.fire(changeEvent);\n            }\n        }));\n        disposables.push(connection.notebooks.synchronization.onDidSaveNotebookDocument((params) => {\n            const notebookDocument = this.getNotebookDocument(params.notebookDocument.uri);\n            if (notebookDocument === undefined) {\n                return;\n            }\n            this._onDidSave.fire(notebookDocument);\n        }));\n        disposables.push(connection.notebooks.synchronization.onDidCloseNotebookDocument((params) => {\n            const uri = UriUtils.normalize(params.notebookDocument.uri);\n            const notebookDocument = this.notebookDocuments.get(uri);\n            if (notebookDocument === undefined) {\n                return;\n            }\n            this._onDidClose.fire(notebookDocument);\n            for (const cellTextDocument of params.cellTextDocuments) {\n                cellTextDocumentConnection.closeTextDocument({ textDocument: cellTextDocument });\n            }\n            this.notebookDocuments.delete(uri);\n            for (const cell of notebookDocument.cells) {\n                this.notebookCellMap.delete(cell.document);\n            }\n        }));\n        return Disposable.create(() => { disposables.forEach(disposable => disposable.dispose()); });\n    }\n\n    private updateCellMap(notebookDocument: NotebookDocument): void {\n        for (const cell of notebookDocument.cells) {\n            this.notebookCellMap.set(cell.document, [cell, notebookDocument]);\n        }\n    }\n}\n\nclass CellTextDocumentConnection implements TextDocumentConnection {\n\n    private static readonly NULL_DISPOSE = Object.freeze({ dispose: () => { } });\n\n    private openHandler: NotificationHandler<DidOpenTextDocumentParams> | undefined;\n    private changeHandler: NotificationHandler<DidChangeTextDocumentParams> | undefined;\n    private closeHandler: NotificationHandler<DidCloseTextDocumentParams> | undefined;\n\n    onDidOpenTextDocument(handler: NotificationHandler<DidOpenTextDocumentParams>): Disposable {\n        this.openHandler = handler;\n        return Disposable.create(() => { this.openHandler = undefined; });\n    }\n\n    openTextDocument(params: DidOpenTextDocumentParams): void {\n        this.openHandler && this.openHandler(params);\n    }\n\n    onDidChangeTextDocument(handler: NotificationHandler<DidChangeTextDocumentParams>): Disposable {\n        this.changeHandler = handler;\n        return Disposable.create(() => { this.changeHandler = handler; });\n    }\n\n    changeTextDocument(params: DidChangeTextDocumentParams): void {\n        this.changeHandler && this.changeHandler(params);\n    }\n\n    onDidCloseTextDocument(handler: NotificationHandler<DidCloseTextDocumentParams>): Disposable {\n        this.closeHandler = handler;\n        return Disposable.create(() => { this.closeHandler = undefined; });\n    }\n\n    closeTextDocument(params: DidCloseTextDocumentParams): void {\n        this.closeHandler && this.closeHandler(params);\n    }\n\n    onWillSaveTextDocument(): Disposable {\n        return CellTextDocumentConnection.NULL_DISPOSE;\n    }\n\n    onWillSaveTextDocumentWaitUntil(): Disposable {\n        return CellTextDocumentConnection.NULL_DISPOSE;\n    }\n\n    onDidSaveTextDocument(): Disposable {\n        return CellTextDocumentConnection.NULL_DISPOSE;\n    }\n}\n", "/******************************************************************************\n * Copyright 2023 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n******************************************************************************/\n\nimport type { Connection } from 'vscode-languageserver';\nimport { createDefaultCoreModule, createDefaultSharedCoreModule, type DefaultCoreModuleContext, type DefaultSharedCoreModuleContext } from '../default-module.js';\nimport { Module } from '../dependency-injection.js';\nimport type { LangiumDefaultCoreServices, LangiumDefaultSharedCoreServices } from '../services.js';\nimport { TextDocument } from '../workspace/documents.js';\nimport { DefaultCompletionProvider } from './completion/completion-provider.js';\nimport { DefaultDefinitionProvider } from './definition-provider.js';\nimport { DefaultDocumentHighlightProvider } from './document-highlight-provider.js';\nimport { DefaultDocumentSymbolProvider } from './document-symbol-provider.js';\nimport { DefaultDocumentUpdateHandler } from './document-update-handler.js';\nimport { DefaultFoldingRangeProvider } from './folding-range-provider.js';\nimport { DefaultFuzzyMatcher } from './fuzzy-matcher.js';\nimport { MultilineCommentHoverProvider } from './hover-provider.js';\nimport { DefaultLanguageServer } from './language-server.js';\nimport type { LangiumLSPServices, LangiumServices, LangiumSharedLSPServices, LangiumSharedServices } from './lsp-services.js';\nimport { DefaultNodeKindProvider } from './node-kind-provider.js';\nimport { DefaultReferencesProvider } from './references-provider.js';\nimport { DefaultRenameProvider } from './rename-provider.js';\nimport { DefaultWorkspaceSymbolProvider } from './workspace-symbol-provider.js';\nimport { NormalizedNotebookDocuments, NormalizedTextDocuments } from './normalized-text-documents.js';\n\n/**\n * Context required for creating the default language-specific dependency injection module.\n */\nexport interface DefaultModuleContext extends DefaultCoreModuleContext {\n    readonly shared: LangiumSharedServices;\n}\n\n/**\n * Creates a dependency injection module configuring the default Core & LSP services for a Langium-based language implementation.\n * This is a set of services that are dedicated to a specific language.\n */\nexport function createDefaultModule(context: DefaultModuleContext): Module<LangiumServices, LangiumDefaultCoreServices & LangiumLSPServices> {\n    return Module.merge(\n        createDefaultCoreModule(context),\n        createDefaultLSPModule(context)\n    );\n}\n\n/**\n * Creates a dependency injection module configuring the default LSP services.\n * This is a set of services that are dedicated to a specific language.\n */\nexport function createDefaultLSPModule(context: DefaultModuleContext): Module<LangiumServices, LangiumLSPServices> {\n    return {\n        lsp: {\n            CompletionProvider: (services) => new DefaultCompletionProvider(services),\n            DocumentSymbolProvider: (services) => new DefaultDocumentSymbolProvider(services),\n            HoverProvider: (services) => new MultilineCommentHoverProvider(services),\n            FoldingRangeProvider: (services) => new DefaultFoldingRangeProvider(services),\n            ReferencesProvider: (services) => new DefaultReferencesProvider(services),\n            DefinitionProvider: (services) => new DefaultDefinitionProvider(services),\n            DocumentHighlightProvider: (services) => new DefaultDocumentHighlightProvider(services),\n            RenameProvider: (services) => new DefaultRenameProvider(services)\n        },\n        shared: () => context.shared\n    };\n}\n\nexport interface DefaultSharedModuleContext extends DefaultSharedCoreModuleContext {\n    /**\n     * Represents an abstract language server connection\n     */\n    readonly connection?: Connection;\n}\n\n/**\n * Creates a dependency injection module configuring the default core & LSP services shared among languages supported by a Langium-based language server.\n * This is the set of services that are shared between multiple languages.\n */\nexport function createDefaultSharedModule(context: DefaultSharedModuleContext): Module<LangiumSharedServices, LangiumDefaultSharedCoreServices & LangiumSharedLSPServices> {\n    return Module.merge(\n        createDefaultSharedCoreModule(context),\n        createDefaultSharedLSPModule(context)\n    );\n}\n\n/**\n * Creates a dependency injection module configuring the default shared LSP services.\n * This is the set of services that are shared between multiple languages.\n */\nexport function createDefaultSharedLSPModule(context: DefaultSharedModuleContext): Module<LangiumSharedServices, LangiumSharedLSPServices> {\n    return {\n        lsp: {\n            Connection: () => context.connection,\n            LanguageServer: (services) => new DefaultLanguageServer(services),\n            DocumentUpdateHandler: (services) => new DefaultDocumentUpdateHandler(services),\n            WorkspaceSymbolProvider: (services) => new DefaultWorkspaceSymbolProvider(services),\n            NodeKindProvider: () => new DefaultNodeKindProvider(),\n            FuzzyMatcher: () => new DefaultFuzzyMatcher(),\n        },\n        workspace: {\n            TextDocuments: () => new NormalizedTextDocuments(TextDocument),\n            NotebookDocuments: (services) => new NormalizedNotebookDocuments(services.workspace.TextDocuments)\n        }\n    };\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { DocumentFormattingParams, DocumentOnTypeFormattingOptions, DocumentOnTypeFormattingParams, DocumentRangeFormattingParams, FormattingOptions, Range, TextEdit } from 'vscode-languageserver-protocol';\nimport type { CancellationToken } from '../utils/cancellation.js';\nimport type { AstNode, CstNode, Properties } from '../syntax-tree.js';\nimport type { MaybePromise } from '../utils/promise-utils.js';\nimport type { Stream } from '../utils/stream.js';\nimport type { LangiumDocument, TextDocument } from '../workspace/documents.js';\nimport { findNodeForKeyword, findNodesForKeyword, findNodeForProperty, findNodesForProperty } from '../utils/grammar-utils.js';\nimport { isCompositeCstNode, isLeafCstNode } from '../syntax-tree.js';\nimport { streamAllContents } from '../utils/ast-utils.js';\nimport { getInteriorNodes, getNextNode } from '../utils/cst-utils.js';\nimport { DONE_RESULT, EMPTY_STREAM, StreamImpl, TreeStreamImpl } from '../utils/stream.js';\n\n/**\n * Language specific service for handling formatting related LSP requests.\n */\nexport interface Formatter {\n    /**\n     * Handles full document formatting.\n     */\n    formatDocument(document: LangiumDocument, params: DocumentFormattingParams, cancelToken?: CancellationToken): MaybePromise<TextEdit[]>\n    /**\n     * Handles partial document formatting. Only parts of the document within the `params.range` property are formatted.\n     */\n    formatDocumentRange(document: LangiumDocument, params: DocumentRangeFormattingParams, cancelToken?: CancellationToken): MaybePromise<TextEdit[]>\n    /**\n     * Handles document formatting while typing. Only formats the current line.\n     */\n    formatDocumentOnType(document: LangiumDocument, params: DocumentOnTypeFormattingParams, cancelToken?: CancellationToken): MaybePromise<TextEdit[]>\n    /**\n     * Options that determine when the `formatDocumentOnType` method should be invoked by the language client.\n     * When `undefined` is returned, document format on type will be disabled.\n     */\n    get formatOnTypeOptions(): DocumentOnTypeFormattingOptions | undefined\n}\n\nexport abstract class AbstractFormatter implements Formatter {\n\n    protected collector: FormattingCollector = () => { /* Does nothing at first */ };\n\n    /**\n     * Creates a formatter scoped to the supplied AST node.\n     * Allows to define fine-grained formatting rules for elements.\n     *\n     * Example usage:\n     *\n     * ```ts\n     * export class CustomFormatter extends AbstractFormatter {\n     *   protected override format(node: AstNode): void {\n     *     if (isPerson(node)) {\n     *       const formatter = this.getNodeFormatter(node);\n     *       formatter.property('name').prepend(Formatting.oneSpace());\n     *     }\n     *   }\n     * }\n     * ```\n     * @param node The specific node the formatter should be scoped to. Every call to properties or keywords will only select those which belong to the supplied AST node.\n     */\n    protected getNodeFormatter<T extends AstNode>(node: T): NodeFormatter<T> {\n        return new DefaultNodeFormatter(node, this.collector);\n    }\n\n    formatDocument(document: LangiumDocument, params: DocumentFormattingParams): MaybePromise<TextEdit[]> {\n        const pr = document.parseResult;\n        if (pr.lexerErrors.length === 0 && pr.parserErrors.length === 0) {\n            // safe to format\n            return this.doDocumentFormat(document, params.options);\n        } else {\n            // don't format a potentially broken document, return no edits\n            return [];\n        }\n    }\n\n    /**\n     * Returns whether a range for a given document is error free, i.e. safe to format\n     *\n     * @param document Document to inspect for lexer & parser errors that may produce an unsafe range\n     * @param range Formatting range to check for safety\n     * @returns Whether the given formatting range does not overlap with or follow any regions with an error\n     */\n    protected isFormatRangeErrorFree(document: LangiumDocument, range: Range): boolean {\n        const pr = document.parseResult;\n        if (pr.lexerErrors.length || pr.parserErrors.length) {\n            // collect the earliest error line from either\n            const earliestErrLine = Math.min(\n                ...pr.lexerErrors.map(e => e.line ?? Number.MAX_VALUE),\n                ...pr.parserErrors.map(e => e.token.startLine ?? Number.MAX_VALUE)\n            );\n            // if the earliest error line occurs before or at the end line of the range, then don't format\n            return earliestErrLine > range.end.line;\n        } else {\n            // no errors, ok to format\n            return true;\n        }\n    }\n\n    formatDocumentRange(document: LangiumDocument, params: DocumentRangeFormattingParams): MaybePromise<TextEdit[]> {\n        if (this.isFormatRangeErrorFree(document, params.range)) {\n            return this.doDocumentFormat(document, params.options, params.range);\n        } else {\n            return [];\n        }\n    }\n\n    formatDocumentOnType(document: LangiumDocument, params: DocumentOnTypeFormattingParams): MaybePromise<TextEdit[]> {\n        // Format the current line after typing something\n        const range = {\n            start: {\n                character: 0,\n                line: params.position.line\n            },\n            end: params.position\n        };\n\n        if (this.isFormatRangeErrorFree(document, range)) {\n            return this.doDocumentFormat(document, params.options, range);\n        } else {\n            return [];\n        }\n    }\n\n    get formatOnTypeOptions(): DocumentOnTypeFormattingOptions | undefined {\n        return undefined;\n    }\n\n    protected doDocumentFormat(document: LangiumDocument, options: FormattingOptions, range?: Range): TextEdit[] {\n        const map = new Map<string, FormattingAction>();\n        const collector: FormattingCollector = (node, mode, formatting) => {\n            const key = this.nodeModeToKey(node, mode);\n            const existing = map.get(key);\n            const priority = formatting.options.priority ?? 0;\n            const existingPriority = existing?.options.priority ?? 0;\n            if (!existing || existingPriority <= priority) {\n                map.set(key, formatting);\n            }\n        };\n        this.collector = collector;\n\n        this.iterateAstFormatting(document, range);\n        const edits = this.iterateCstFormatting(document, map, options, range);\n\n        return this.avoidOverlappingEdits(document.textDocument, edits);\n    }\n\n    protected avoidOverlappingEdits(textDocument: TextDocument, textEdits: TextEdit[]): TextEdit[] {\n        const edits: TextEdit[] = [];\n        for (const edit of textEdits) {\n            let last = edits[edits.length - 1];\n            while (last) {\n                const currentStart = textDocument.offsetAt(edit.range.start);\n                const lastEnd = textDocument.offsetAt(last.range.end);\n                if (currentStart < lastEnd) {\n                    edits.pop();\n                    last = edits[edits.length - 1];\n                }\n                else {\n                    break;\n                }\n            }\n            edits.push(edit);\n        }\n        return edits.filter(edit => this.isNecessary(edit, textDocument));\n    }\n\n    protected iterateAstFormatting(document: LangiumDocument, range?: Range): void {\n        const root = document.parseResult.value;\n        this.format(root);\n        const treeIterator = streamAllContents(root).iterator();\n        let result: IteratorResult<AstNode>;\n        do {\n            result = treeIterator.next();\n            if (!result.done) {\n                const node = result.value;\n                const inside = this.insideRange(node.$cstNode!.range, range);\n                if (inside) {\n                    this.format(node);\n                } else {\n                    treeIterator.prune();\n                }\n            }\n        } while (!result.done);\n    }\n\n    protected abstract format(node: AstNode): void;\n\n    protected nodeModeToKey(node: CstNode, mode: 'prepend' | 'append'): string {\n        return `${node.offset}:${node.end}:${mode}`;\n    }\n\n    protected insideRange(inside: Range, total?: Range): boolean {\n        if (!total) {\n            return true;\n        }\n        if ((inside.start.line <= total.start.line && inside.end.line >= total.end.line) ||\n            (inside.start.line >= total.start.line && inside.end.line <= total.end.line) ||\n            (inside.start.line <= total.end.line && inside.end.line >= total.end.line)) {\n            return true;\n        }\n        return false;\n    }\n\n    protected isNecessary(edit: TextEdit, document: TextDocument): boolean {\n        return edit.newText !== document.getText(edit.range).replace(/\\r/g, '');\n    }\n\n    protected iterateCstFormatting(document: LangiumDocument, formattings: Map<string, FormattingAction>, options: FormattingOptions, range?: Range): TextEdit[] {\n        const context: FormattingContext = {\n            indentation: 0,\n            options,\n            document: document.textDocument\n        };\n        const edits: TextEdit[] = [];\n        const cstTreeStream = this.iterateCstTree(document, context);\n        const iterator = cstTreeStream.iterator();\n        let lastNode: CstNode | undefined;\n        let result: IteratorResult<CstNode>;\n        do {\n            result = iterator.next();\n            if (!result.done) {\n                const node = result.value;\n                const isLeaf = isLeafCstNode(node);\n                const prependKey = this.nodeModeToKey(node, 'prepend');\n                const prependFormatting = formattings.get(prependKey);\n                formattings.delete(prependKey);\n                if (prependFormatting) {\n                    const nodeEdits = this.createTextEdit(lastNode, node, prependFormatting, context);\n                    for (const edit of nodeEdits) {\n                        if (edit && this.insideRange(edit.range, range)) {\n                            edits.push(edit);\n                        }\n                    }\n                }\n                const appendKey = this.nodeModeToKey(node, 'append');\n                const appendFormatting = formattings.get(appendKey);\n                formattings.delete(appendKey);\n                if (appendFormatting) {\n                    const nextNode = getNextNode(node);\n                    if (nextNode) {\n                        const nodeEdits = this.createTextEdit(node, nextNode, appendFormatting, context);\n                        for (const edit of nodeEdits) {\n                            if (edit && this.insideRange(edit.range, range)) {\n                                edits.push(edit);\n                            }\n                        }\n                    }\n                }\n\n                if (!prependFormatting && node.hidden) {\n                    const hiddenEdits = this.createHiddenTextEdits(lastNode, node, undefined, context);\n                    for (const edit of hiddenEdits) {\n                        if (edit && this.insideRange(edit.range, range)) {\n                            edits.push(edit);\n                        }\n                    }\n                }\n                if (isLeaf) {\n                    lastNode = node;\n                }\n            }\n        } while (!result.done);\n\n        return edits;\n    }\n\n    protected createHiddenTextEdits(previous: CstNode | undefined, hidden: CstNode, formatting: FormattingAction | undefined, context: FormattingContext): TextEdit[] {\n        // Don't format the hidden node if it is on the same line as its previous node\n        const startLine = hidden.range.start.line;\n        if (previous && previous.range.end.line === startLine) {\n            return [];\n        }\n        const edits: TextEdit[] = [];\n\n        const startRange: Range = {\n            start: {\n                character: 0,\n                line: startLine\n            },\n            end: hidden.range.start\n        };\n        const hiddenStartText = context.document.getText(startRange);\n        const move = this.findFittingMove(startRange, formatting?.moves ?? [], context);\n        const hiddenStartChar = this.getExistingIndentationCharacterCount(hiddenStartText, context);\n        const expectedStartChar = this.getIndentationCharacterCount(context, move);\n\n        const characterIncrease = expectedStartChar - hiddenStartChar;\n\n        if (characterIncrease === 0) {\n            return [];\n        }\n\n        let newText = '';\n        if (characterIncrease > 0) {\n            newText = (context.options.insertSpaces ? ' ' : '\\t').repeat(characterIncrease);\n        }\n\n        const lines = hidden.text.split('\\n');\n        lines[0] = hiddenStartText + lines[0];\n        for (let i = 0; i < lines.length; i++) {\n            const currentLine = startLine + i;\n            const pos = {\n                character: 0,\n                line: currentLine\n            };\n            if (characterIncrease > 0) {\n                edits.push({\n                    newText,\n                    range: {\n                        start: pos,\n                        end: pos\n                    }\n                });\n            } else {\n                const currentText = lines[i];\n                let j = 0;\n                for (; j < currentText.length; j++) {\n                    const char = currentText.charAt(j);\n                    if (char !== ' ' && char !== '\\t') {\n                        break;\n                    }\n                }\n                edits.push({\n                    newText: '',\n                    range: {\n                        start: pos,\n                        end: {\n                            line: currentLine,\n                            // Remove as much whitespace characters as necessary\n                            // In some cases `characterIncrease` is actually larger than the amount of whitespace available\n                            // So we simply remove all whitespace characters `j`\n                            character: Math.min(j, Math.abs(characterIncrease))\n                        }\n                    }\n                });\n            }\n        }\n\n        return edits;\n    }\n\n    protected getExistingIndentationCharacterCount(text: string, context: FormattingContext): number {\n        const tabWhitespace = ' '.repeat(context.options.tabSize);\n        let replacement = '';\n        let regex;\n        if (context.options.insertSpaces) {\n            regex = new RegExp('\\\\t', 'g');\n            replacement = tabWhitespace;\n        } else {\n            regex = new RegExp(tabWhitespace, 'g');\n            replacement = '\\t';\n        }\n        const normalized = text.replace(regex, replacement);\n        return normalized.length;\n    }\n\n    protected getIndentationCharacterCount(context: FormattingContext, formattingMove?: FormattingMove): number {\n        let indentation = context.indentation;\n        if (formattingMove && formattingMove.tabs) {\n            indentation += formattingMove.tabs;\n        }\n        return (context.options.insertSpaces ? context.options.tabSize : 1) * indentation;\n    }\n\n    protected createTextEdit(a: CstNode | undefined, b: CstNode, formatting: FormattingAction, context: FormattingContext): TextEdit[] {\n        if (b.hidden) {\n            return this.createHiddenTextEdits(a, b, formatting, context);\n        }\n        // Ignore the edit if the previous node ends after the current node starts\n        if (a && (a.range.end.line > b.range.start.line ||\n            (a.range.end.line === b.range.start.line && a.range.end.character > b.range.start.character))) {\n            return [];\n        }\n        const betweenRange: Range = {\n            start: a?.range.end ?? {\n                character: 0,\n                line: 0\n            },\n            end: b.range.start\n        };\n        const move = this.findFittingMove(betweenRange, formatting.moves, context);\n        if (!move) {\n            return [];\n        }\n        const chars = move.characters;\n        const lines = move.lines;\n        const tabs = move.tabs;\n        const existingIndentation = context.indentation;\n        context.indentation += (tabs ?? 0);\n        const edits: TextEdit[] = [];\n        if (chars !== undefined) {\n            // Do not apply formatting on the same line if preceding node is hidden\n            if (!a?.hidden) {\n                edits.push(this.createSpaceTextEdit(betweenRange, chars, formatting.options));\n            }\n        } else if (lines !== undefined) {\n            edits.push(this.createLineTextEdit(betweenRange, lines, context, formatting.options));\n        } else if (tabs !== undefined) {\n            edits.push(this.createTabTextEdit(betweenRange, Boolean(a), context));\n        }\n        if (isLeafCstNode(b)) {\n            context.indentation = existingIndentation;\n        }\n        return edits;\n    }\n\n    protected createSpaceTextEdit(range: Range, spaces: number, options: FormattingActionOptions): TextEdit {\n        if (range.start.line === range.end.line) {\n            const existingSpaces = range.end.character - range.start.character;\n            spaces = this.fitIntoOptions(spaces, existingSpaces, options);\n        }\n        const newText = ' '.repeat(spaces);\n        return {\n            newText,\n            range\n        };\n    }\n\n    protected createLineTextEdit(range: Range, lines: number, context: FormattingContext, options: FormattingActionOptions): TextEdit {\n        const existingLines = range.end.line - range.start.line;\n        lines = this.fitIntoOptions(lines, existingLines, options);\n        const indent = context.options.insertSpaces ? ' '.repeat(context.options.tabSize) : '\\t';\n        const nodeIndent = indent.repeat(context.indentation);\n        const newText = `${'\\n'.repeat(lines)}${nodeIndent}`;\n        return {\n            newText,\n            range\n        };\n    }\n\n    protected createTabTextEdit(range: Range, hasPrevious: boolean, context: FormattingContext): TextEdit {\n        const indent = context.options.insertSpaces ? ' '.repeat(context.options.tabSize) : '\\t';\n        const nodeIndent = indent.repeat(context.indentation);\n        const minimumLines = hasPrevious ? 1 : 0;\n        const lines = Math.max(range.end.line - range.start.line, minimumLines);\n        const newText = `${'\\n'.repeat(lines)}${nodeIndent}`;\n        return {\n            newText,\n            range\n        };\n    }\n\n    protected fitIntoOptions(value: number, existing: number, options: FormattingActionOptions): number {\n        if (options.allowMore) {\n            value = Math.max(existing, value);\n        } else if (options.allowLess) {\n            value = Math.min(existing, value);\n        }\n        return value;\n    }\n\n    protected findFittingMove(range: Range, moves: FormattingMove[], _context: FormattingContext): FormattingMove | undefined {\n        if (moves.length === 0) {\n            return undefined;\n        } else if (moves.length === 1) {\n            return moves[0];\n        }\n\n        const existingLines = range.end.line - range.start.line;\n\n        for (const move of moves) {\n            if (move.lines !== undefined && existingLines <= move.lines) {\n                return move;\n            } else if (move.lines === undefined && existingLines === 0) {\n                return move;\n            }\n        }\n\n        // Return the last move\n        return moves[moves.length - 1];\n    }\n\n    protected iterateCstTree(document: LangiumDocument, context: FormattingContext): Stream<CstNode> {\n        const root = document.parseResult.value;\n        const rootCst = root.$cstNode;\n        if (!rootCst) {\n            return EMPTY_STREAM;\n        }\n        return new TreeStreamImpl(rootCst, node => this.iterateCst(node, context));\n    }\n\n    protected iterateCst(node: CstNode, context: FormattingContext): Stream<CstNode> {\n        if (!isCompositeCstNode(node)) {\n            return EMPTY_STREAM;\n        }\n        const initial = context.indentation;\n        return new StreamImpl<{ index: number }, CstNode>(\n            () => ({ index: 0 }),\n            (state) => {\n                if (state.index < node.content.length) {\n                    return { done: false, value: node.content[state.index++] };\n                } else {\n                    // Reset the indentation to the level when we entered the node\n                    context.indentation = initial;\n                    return DONE_RESULT;\n                }\n            }\n        );\n    }\n\n}\n\n/**\n * Represents an object that allows to format certain parts of a specific node, like its keywords or properties.\n */\nexport interface NodeFormatter<T extends AstNode> {\n    /**\n     * Creates a new formatting region that contains the specified node.\n     */\n    node(node: AstNode): FormattingRegion\n    /**\n     * Creates a new formatting region that contains all of the specified nodes.\n     */\n    nodes(...nodes: AstNode[]): FormattingRegion\n    /**\n     * Creates a new formatting region that contains the specified property of the supplied node.\n     *\n     * @param property The name of the property to format. Scoped to the supplied node.\n     * @param index The index of the property, if the property is an array. `0` by default. To retrieve all elements of this array, use the {@link properties} method instead.\n     */\n    property(property: Properties<T>, index?: number): FormattingRegion\n    /**\n     * Creates a new formatting region that contains the all of the specified properties of the supplied node.\n     *\n     * @param properties The names of the properties to format. Scoped to the supplied node.\n     */\n    properties(...properties: Array<Properties<T>>): FormattingRegion\n    /**\n     * Creates a new formatting region that contains the specified keyword of the supplied node.\n     *\n     * @param keyword The keyword to format. Scoped to the supplied node.\n     * @param index The index of the keyword, necessary if the keyword appears multiple times. `0` by default. To retrieve all keywords, use the {@link keywords} method instead.\n     */\n    keyword(keyword: string, index?: number): FormattingRegion\n    /**\n     * Creates a new formatting region that contains the all of the specified keywords of the supplied node.\n     *\n     * @param keywords The keywords to format. Scoped to the supplied node.\n     */\n    keywords(...keywords: string[]): FormattingRegion\n    /**\n     * Creates a new formatting region that contains the all of the specified CST nodes.\n     *\n     * @param nodes A list of CST nodes to format\n     */\n    cst(nodes: CstNode[]): FormattingRegion\n    /**\n     * Creates a new formatting region that contains all nodes between the given formatting regions.\n     *\n     * For example, can be used to retrieve a formatting region that contains all nodes between two curly braces:\n     *\n     * ```ts\n     * const formatter = this.getNodeFormatter(node);\n     * const bracesOpen = formatter.keyword('{');\n     * const bracesClose = formatter.keyword('}');\n     * formatter.interior(bracesOpen, bracesClose).prepend(Formatting.indent());\n     * ```\n     *\n     * @param start Determines where the search for interior nodes should start\n     * @param end Determines where the search for interior nodes should end\n     */\n    interior(start: FormattingRegion, end: FormattingRegion): FormattingRegion\n}\n\nexport class DefaultNodeFormatter<T extends AstNode> implements NodeFormatter<T> {\n\n    protected readonly astNode: T;\n    protected readonly collector: FormattingCollector;\n\n    constructor(astNode: T, collector: FormattingCollector) {\n        this.astNode = astNode;\n        this.collector = collector;\n    }\n\n    node(node: AstNode): FormattingRegion {\n        return new FormattingRegion(node.$cstNode ? [node.$cstNode] : [], this.collector);\n    }\n\n    nodes(...nodes: AstNode[]): FormattingRegion {\n        const cstNodes: CstNode[] = [];\n        for (const node of nodes) {\n            if (node.$cstNode) {\n                cstNodes.push(node.$cstNode);\n            }\n        }\n        return new FormattingRegion(cstNodes, this.collector);\n    }\n\n    property(feature: Properties<T>, index?: number): FormattingRegion {\n        const cstNode = findNodeForProperty(this.astNode.$cstNode, feature, index);\n        return new FormattingRegion(cstNode ? [cstNode] : [], this.collector);\n    }\n\n    properties(...features: Array<Properties<T>>): FormattingRegion {\n        const nodes: CstNode[] = [];\n        for (const feature of features) {\n            const cstNodes = findNodesForProperty(this.astNode.$cstNode, feature);\n            nodes.push(...cstNodes);\n        }\n        return new FormattingRegion(nodes, this.collector);\n    }\n\n    keyword(keyword: string, index?: number): FormattingRegion {\n        const cstNode = findNodeForKeyword(this.astNode.$cstNode, keyword, index);\n        return new FormattingRegion(cstNode ? [cstNode] : [], this.collector);\n    }\n\n    keywords(...keywords: string[]): FormattingRegion {\n        const nodes: CstNode[] = [];\n        for (const feature of keywords) {\n            const cstNodes = findNodesForKeyword(this.astNode.$cstNode, feature);\n            nodes.push(...cstNodes);\n        }\n        return new FormattingRegion(nodes, this.collector);\n    }\n\n    cst(nodes: CstNode[]): FormattingRegion {\n        return new FormattingRegion([...nodes], this.collector);\n    }\n\n    interior(start: FormattingRegion, end: FormattingRegion): FormattingRegion {\n        const startNodes = start.nodes;\n        const endNodes = end.nodes;\n        if (startNodes.length !== 1 || endNodes.length !== 1) {\n            return new FormattingRegion([], this.collector);\n        }\n        let startNode = startNodes[0];\n        let endNode = endNodes[0];\n\n        if (startNode.offset > endNode.offset) {\n            const intermediate = startNode;\n            startNode = endNode;\n            endNode = intermediate;\n        }\n\n        return new FormattingRegion(getInteriorNodes(startNode, endNode), this.collector);\n    }\n}\n\nexport interface FormattingContext {\n    document: TextDocument\n    options: FormattingOptions\n    indentation: number // Level of indentation, not the amount of spaces/tabs\n}\n\nexport class FormattingRegion {\n\n    readonly nodes: CstNode[];\n    protected readonly collector: FormattingCollector;\n\n    constructor(nodes: CstNode[], collector: FormattingCollector) {\n        this.nodes = nodes;\n        this.collector = collector;\n    }\n\n    /**\n     * Prepends the specified formatting to all nodes of this region.\n     */\n    prepend(formatting: FormattingAction): FormattingRegion {\n        for (const node of this.nodes) {\n            this.collector(node, 'prepend', formatting);\n        }\n        return this;\n    }\n\n    /**\n     * Appends the specified formatting to all nodes of this region.\n     */\n    append(formatting: FormattingAction): FormattingRegion {\n        for (const node of this.nodes) {\n            this.collector(node, 'append', formatting);\n        }\n        return this;\n    }\n\n    /**\n     * Sorrounds all nodes of this region with the specified formatting.\n     * Functionally the same as invoking `prepend` and `append` with the same formatting.\n     */\n    surround(formatting: FormattingAction): FormattingRegion {\n        for (const node of this.nodes) {\n            this.collector(node, 'prepend', formatting);\n            this.collector(node, 'append', formatting);\n        }\n        return this;\n    }\n\n    /**\n     * Creates a copy of this region with a slice of the selected nodes.\n     * For both start and end, a negative index can be used to indicate an offset from the end of the array.\n     * For example, -2 refers to the second to last element of the array.\n     * @param start The beginning index of the specified portion of the region. If start is undefined, then the slice begins at index 0.\n     * @param end The end index of the specified portion of the region. This is exclusive of the element at the index 'end'. If end is undefined, then the slice extends to the end of the region.\n     */\n    slice(start?: number, end?: number): FormattingRegion {\n        return new FormattingRegion(this.nodes.slice(start, end), this.collector);\n    }\n}\n\nexport interface FormattingAction {\n    options: FormattingActionOptions\n    moves: FormattingMove[]\n}\n\nexport interface FormattingActionOptions {\n    /**\n     * The priority of this formatting. Formattings with a higher priority override those with lower priority.\n     * `0` by default.\n     */\n    priority?: number\n    /**\n     * Determines whether this formatting allows more spaces/lines than expected. For example, if {@link Formatting.newLine} is used, but 2 empty lines already exist between the elements, no formatting is applied.\n     */\n    allowMore?: boolean\n    /**\n     * Determines whether this formatting allows less spaces/lines than expected. For example, if {@link Formatting.oneSpace} is used, but no spaces exist between the elements, no formatting is applied.\n     */\n    allowLess?: boolean\n}\n\nexport interface FormattingMove {\n    characters?: number\n    tabs?: number\n    lines?: number\n}\n\n/**\n * Contains utilities to easily create formatting actions that can be applied to a {@link FormattingRegion}.\n */\nexport namespace Formatting {\n\n    /**\n     * Creates a new formatting that tries to fit the existing text into one of the specified formattings.\n     * @param formattings All possible formattings.\n     */\n    export function fit(...formattings: FormattingAction[]): FormattingAction {\n        return {\n            options: {},\n            moves: formattings.flatMap(e => e.moves).sort(compareMoves)\n        };\n    }\n\n    /**\n     * Creates a new formatting that removes all spaces\n     */\n    export function noSpace(options?: FormattingActionOptions): FormattingAction {\n        return spaces(0, options);\n    }\n\n    /**\n     * Creates a new formatting that creates a single space\n     */\n    export function oneSpace(options?: FormattingActionOptions): FormattingAction {\n        return spaces(1, options);\n    }\n\n    /**\n     * Creates a new formatting that creates the specified amount of spaces\n     *\n     * @param count The amount of spaces to be inserted\n     */\n    export function spaces(count: number, options?: FormattingActionOptions): FormattingAction {\n        return {\n            options: options ?? {},\n            moves: [{\n                characters: count\n            }]\n        };\n    }\n\n    /**\n     * Creates a new formatting that moves an element to the next line\n     */\n    export function newLine(options?: FormattingActionOptions): FormattingAction {\n        return newLines(1, options);\n    }\n\n    /**\n     * Creates a new formatting that creates the specified amount of new lines.\n     */\n    export function newLines(count: number, options?: FormattingActionOptions): FormattingAction {\n        return {\n            options: options ?? {},\n            moves: [{\n                lines: count\n            }]\n        };\n    }\n\n    /**\n     * Creates a new formatting that moves the element to a new line and indents that line.\n     */\n    export function indent(options?: FormattingActionOptions): FormattingAction {\n        return {\n            options: options ?? {},\n            moves: [{\n                tabs: 1,\n                lines: 1\n            }]\n        };\n    }\n\n    /**\n     * Creates a new formatting that removes all indentation.\n     */\n    export function noIndent(options?: FormattingActionOptions): FormattingAction {\n        return {\n            options: options ?? {},\n            moves: [{\n                tabs: 0\n            }]\n        };\n    }\n\n    function compareMoves(a: FormattingMove, b: FormattingMove): number {\n        const aLines = a.lines ?? 0;\n        const bLines = b.lines ?? 0;\n        const aTabs = a.tabs ?? 0;\n        const bTabs = b.tabs ?? 0;\n        const aSpaces = a.characters ?? 0;\n        const bSpaces = b.characters ?? 0;\n        if (aLines < bLines) {\n            return -1;\n        } else if (aLines > bLines) {\n            return 1;\n        } else if (aTabs < bTabs) {\n            return -1;\n        } else if (aTabs > bTabs) {\n            return 1;\n        } else if (aSpaces < bSpaces) {\n            return -1;\n        } else if (aSpaces > bSpaces) {\n            return 1;\n        } else {\n            return 0;\n        }\n    }\n}\n\nexport type FormattingCollector = (node: CstNode, mode: 'prepend' | 'append', formatting: FormattingAction) => void;\n", "/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { URI } from '../utils/uri-utils.js';\nimport { UriUtils } from '../utils/uri-utils.js';\nimport type { FileSystemNode, FileSystemProvider } from '../workspace/file-system-provider.js';\nimport * as fs from 'node:fs';\n\nexport type NodeTextEncoding = 'ascii' | 'utf8' | 'utf-8' | 'utf16le' | 'ucs2' | 'ucs-2' | 'latin1';\n\nexport class NodeFileSystemProvider implements FileSystemProvider {\n\n    encoding: NodeTextEncoding = 'utf-8';\n\n    async stat(uri: URI): Promise<FileSystemNode> {\n        const stat = await fs.promises.stat(uri.fsPath);\n        return {\n            isFile: stat.isFile(),\n            isDirectory: stat.isDirectory(),\n            uri\n        };\n    }\n\n    statSync(uri: URI): FileSystemNode {\n        const stat = fs.statSync(uri.fsPath);\n        return {\n            isFile: stat.isFile(),\n            isDirectory: stat.isDirectory(),\n            uri\n        };\n    }\n\n    exists(uri: URI): Promise<boolean> {\n        return new Promise(resolve => {\n            fs.stat(uri.fsPath, err => {\n                resolve(!err);\n            });\n        });\n    }\n\n    existsSync(uri: URI): boolean {\n        return fs.existsSync(uri.fsPath);\n    }\n\n    readBinary(uri: URI): Promise<Uint8Array> {\n        return fs.promises.readFile(uri.fsPath);\n    }\n\n    readBinarySync(uri: URI): Uint8Array {\n        return fs.readFileSync(uri.fsPath);\n    }\n\n    readFile(uri: URI): Promise<string> {\n        return fs.promises.readFile(uri.fsPath, this.encoding);\n    }\n\n    readFileSync(uri: URI): string {\n        return fs.readFileSync(uri.fsPath, this.encoding);\n    }\n\n    async readDirectory(uri: URI): Promise<FileSystemNode[]> {\n        const dirents = await fs.promises.readdir(uri.fsPath, { withFileTypes: true });\n        return dirents.map(dirent => ({\n            dirent, // Include the raw entry, it may be useful...\n            isFile: dirent.isFile(),\n            isDirectory: dirent.isDirectory(),\n            uri: UriUtils.joinPath(uri, dirent.name)\n        }));\n    }\n\n    readDirectorySync(uri: URI): FileSystemNode[] {\n        const dirents = fs.readdirSync(uri.fsPath, { withFileTypes: true });\n        return dirents.map(dirent => ({\n            dirent, // Include the raw entry, it may be useful...\n            isFile: dirent.isFile(),\n            isDirectory: dirent.isDirectory(),\n            uri: UriUtils.joinPath(uri, dirent.name)\n        }));\n    }\n}\n\nexport const NodeFileSystem = {\n    fileSystemProvider: () => new NodeFileSystemProvider()\n};\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { startLanguageServer } from 'langium/lsp';\nimport { NodeFileSystem } from 'langium/node';\nimport { createConnection, ProposedFeatures } from 'vscode-languageserver/node';\nimport { createDomainModelServices } from './domain-model-module.js';\n\nconst connection = createConnection(ProposedFeatures.all);\nconst { shared } = createDomainModelServices({ connection, ...NodeFileSystem });\nstartLanguageServer(shared);\n", "/******************************************************************************\n * This file was generated by langium-cli 4.3.0.\n * DO NOT EDIT MANUALLY!\n ******************************************************************************/\n\n/* eslint-disable */\nimport * as langium from 'langium';\n\nexport const DomainModelTerminals = {\n    WS: /\\s+/,\n    ID: /[_a-zA-Z][\\w_]*/,\n    ML_COMMENT: /\\/\\*[\\s\\S]*?\\*\\//,\n    SL_COMMENT: /\\/\\/[^\\n\\r]*/,\n};\n\nexport type DomainModelTerminalNames = keyof typeof DomainModelTerminals;\n\nexport type DomainModelKeywordNames =\n    | \".\"\n    | \":\"\n    | \"datatype\"\n    | \"entity\"\n    | \"extends\"\n    | \"many\"\n    | \"package\"\n    | \"{\"\n    | \"}\";\n\nexport type DomainModelTokenNames = DomainModelTerminalNames | DomainModelKeywordNames;\n\nexport type AbstractElement = PackageDeclaration | Type;\n\nexport const AbstractElement = {\n    $type: 'AbstractElement'\n} as const;\n\nexport function isAbstractElement(item: unknown): item is AbstractElement {\n    return reflection.isInstance(item, AbstractElement.$type);\n}\n\nexport interface DataType extends langium.AstNode {\n    readonly $container: Domainmodel | PackageDeclaration;\n    readonly $type: 'DataType';\n    name: string;\n}\n\nexport const DataType = {\n    $type: 'DataType',\n    name: 'name'\n} as const;\n\nexport function isDataType(item: unknown): item is DataType {\n    return reflection.isInstance(item, DataType.$type);\n}\n\nexport interface Domainmodel extends langium.AstNode {\n    readonly $type: 'Domainmodel';\n    elements: Array<AbstractElement>;\n}\n\nexport const Domainmodel = {\n    $type: 'Domainmodel',\n    elements: 'elements'\n} as const;\n\nexport function isDomainmodel(item: unknown): item is Domainmodel {\n    return reflection.isInstance(item, Domainmodel.$type);\n}\n\nexport interface Entity extends langium.AstNode {\n    readonly $container: Domainmodel | PackageDeclaration;\n    readonly $type: 'Entity';\n    features: Array<Feature>;\n    name: string;\n    superType?: langium.MultiReference<Entity>;\n}\n\nexport const Entity = {\n    $type: 'Entity',\n    features: 'features',\n    name: 'name',\n    superType: 'superType'\n} as const;\n\nexport function isEntity(item: unknown): item is Entity {\n    return reflection.isInstance(item, Entity.$type);\n}\n\nexport interface Feature extends langium.AstNode {\n    readonly $container: Entity;\n    readonly $type: 'Feature';\n    many: boolean;\n    name: string;\n    type: langium.Reference<Type>;\n}\n\nexport const Feature = {\n    $type: 'Feature',\n    many: 'many',\n    name: 'name',\n    type: 'type'\n} as const;\n\nexport function isFeature(item: unknown): item is Feature {\n    return reflection.isInstance(item, Feature.$type);\n}\n\nexport interface PackageDeclaration extends langium.AstNode {\n    readonly $container: Domainmodel | PackageDeclaration;\n    readonly $type: 'PackageDeclaration';\n    elements: Array<AbstractElement>;\n    name: QualifiedName;\n}\n\nexport const PackageDeclaration = {\n    $type: 'PackageDeclaration',\n    elements: 'elements',\n    name: 'name'\n} as const;\n\nexport function isPackageDeclaration(item: unknown): item is PackageDeclaration {\n    return reflection.isInstance(item, PackageDeclaration.$type);\n}\n\nexport type QualifiedName = string;\n\nexport function isQualifiedName(item: unknown): item is QualifiedName {\n    return typeof item === 'string';\n}\n\nexport type Type = DataType | Entity;\n\nexport const Type = {\n    $type: 'Type'\n} as const;\n\nexport function isType(item: unknown): item is Type {\n    return reflection.isInstance(item, Type.$type);\n}\n\nexport type DomainModelAstType = {\n    AbstractElement: AbstractElement\n    DataType: DataType\n    Domainmodel: Domainmodel\n    Entity: Entity\n    Feature: Feature\n    PackageDeclaration: PackageDeclaration\n    Type: Type\n}\n\nexport class DomainModelAstReflection extends langium.AbstractAstReflection {\n    override readonly types = {\n        AbstractElement: {\n            name: AbstractElement.$type,\n            properties: {\n            },\n            superTypes: []\n        },\n        DataType: {\n            name: DataType.$type,\n            properties: {\n                name: {\n                    name: DataType.name\n                }\n            },\n            superTypes: [Type.$type]\n        },\n        Domainmodel: {\n            name: Domainmodel.$type,\n            properties: {\n                elements: {\n                    name: Domainmodel.elements,\n                    defaultValue: [],\n                    optional: true\n                }\n            },\n            superTypes: []\n        },\n        Entity: {\n            name: Entity.$type,\n            properties: {\n                features: {\n                    name: Entity.features,\n                    defaultValue: [],\n                    optional: true\n                },\n                name: {\n                    name: Entity.name\n                },\n                superType: {\n                    name: Entity.superType,\n                    referenceType: Entity.$type,\n                    optional: true\n                }\n            },\n            superTypes: [Type.$type]\n        },\n        Feature: {\n            name: Feature.$type,\n            properties: {\n                many: {\n                    name: Feature.many,\n                    defaultValue: false,\n                    optional: true\n                },\n                name: {\n                    name: Feature.name\n                },\n                type: {\n                    name: Feature.type,\n                    referenceType: Type.$type\n                }\n            },\n            superTypes: []\n        },\n        PackageDeclaration: {\n            name: PackageDeclaration.$type,\n            properties: {\n                elements: {\n                    name: PackageDeclaration.elements,\n                    defaultValue: [],\n                    optional: true\n                },\n                name: {\n                    name: PackageDeclaration.name\n                }\n            },\n            superTypes: [AbstractElement.$type]\n        },\n        Type: {\n            name: Type.$type,\n            properties: {\n            },\n            superTypes: [AbstractElement.$type]\n        }\n    } as const satisfies langium.AstMetaData\n}\n\nexport const reflection = new DomainModelAstReflection();\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { AstNode } from 'langium';\nimport { AbstractFormatter, Formatting } from 'langium/lsp';\nimport * as ast from './generated/ast.js';\n\nexport class DomainModelFormatter extends AbstractFormatter {\n\n    protected format(node: AstNode): void {\n        if (ast.isPackageDeclaration(node)) {\n            const formatter = this.getNodeFormatter(node);\n            const bracesOpen = formatter.keyword('{');\n            const bracesClose = formatter.keyword('}');\n            formatter.interior(bracesOpen, bracesClose).prepend(Formatting.indent());\n            bracesClose.prepend(Formatting.newLine());\n        } else if (ast.isEntity(node)) {\n            const formatter = this.getNodeFormatter(node);\n            const bracesOpen = formatter.keyword('{');\n            const bracesClose = formatter.keyword('}');\n            formatter.interior(bracesOpen, bracesClose).prepend(Formatting.indent());\n            bracesClose.prepend(Formatting.newLine());\n        } else if (ast.isDomainmodel(node)) {\n            const formatter = this.getNodeFormatter(node);\n            const nodes = formatter.nodes(...node.elements);\n            nodes.prepend(Formatting.noIndent());\n        }\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { PackageDeclaration } from './generated/ast.js';\nimport { isPackageDeclaration } from './generated/ast.js';\n\nexport function toQualifiedName(pack: PackageDeclaration, childName: string): string {\n    return (isPackageDeclaration(pack.$container) ? toQualifiedName(pack.$container, pack.name) : pack.name) + '.' + childName;\n}\n\nexport class QualifiedNameProvider {\n\n    /**\n     * @param qualifier if the qualifier is a `string`, simple string concatenation is done: `qualifier.name`.\n     *      if the qualifier is a `PackageDeclaration` fully qualified name is created: `package1.package2.name`.\n     * @param name simple name\n     * @returns qualified name separated by `.`\n     */\n    getQualifiedName(qualifier: PackageDeclaration | string, name: string): string {\n        let prefix = qualifier;\n        if (isPackageDeclaration(prefix)) {\n            prefix = (isPackageDeclaration(prefix.$container)\n                ? this.getQualifiedName(prefix.$container, prefix.name) : prefix.name);\n        }\n        return prefix ? prefix + '.' + name : name;\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { AstNode, LangiumDocument, LangiumDocuments, ReferenceDescription, URI } from 'langium';\nimport { AstUtils, CstUtils, isNamed } from 'langium';\nimport { DefaultRenameProvider } from 'langium/lsp';\nimport type { RenameParams } from 'vscode-languageserver-protocol';\nimport { Location, TextEdit, type Range, type WorkspaceEdit } from 'vscode-languageserver-types';\nimport type { DomainModelServices } from './domain-model-module.js';\nimport type { QualifiedNameProvider } from './domain-model-naming.js';\nimport { isPackageDeclaration } from './generated/ast.js';\n\nexport class DomainModelRenameProvider extends DefaultRenameProvider {\n\n    protected readonly langiumDocuments: LangiumDocuments;\n    protected readonly qualifiedNameProvider: QualifiedNameProvider;\n\n    constructor(services: DomainModelServices) {\n        super(services);\n        this.langiumDocuments = services.shared.workspace.LangiumDocuments;\n        this.qualifiedNameProvider = services.references.QualifiedNameProvider;\n    }\n\n    override async rename(document: LangiumDocument, params: RenameParams): Promise<WorkspaceEdit | undefined> {\n        const changes: Record<string, TextEdit[]> = {};\n        const rootNode = document.parseResult.value.$cstNode;\n        if (!rootNode) return undefined;\n        const offset = document.textDocument.offsetAt(params.position);\n        const leafNode = CstUtils.findDeclarationNodeAtOffset(rootNode, offset, this.grammarConfig.nameRegexp);\n        if (!leafNode) return undefined;\n        const targetNodes = this.references.findDeclarations(leafNode);\n        if (!targetNodes.length) return undefined;\n        for (const node of targetNodes) {\n            if (isNamed(node)) node.name = params.newName;\n            const location = this.getNodeLocation(node);\n            if (location) {\n                const change = TextEdit.replace(location.range, params.newName);\n                const uri = location.uri;\n                if (uri) {\n                    if (changes[uri]) {\n                        changes[uri].push(change);\n                    } else {\n                        changes[uri] = [change];\n                    }\n                }\n            }\n        }\n        const targetNode = targetNodes[0];\n        for (const node of AstUtils.streamAst(targetNode)) {\n            const qn = this.buildQualifiedName(node);\n            if (qn) {\n                const options = { onlyLocal: false, includeDeclaration: false };\n                this.references.findReferences(node, options).forEach(reference => {\n                    const nodeLocation = this.getRefLocation(reference);\n                    const isQn = this.hasQualifiedNameText(reference.sourceUri, reference.segment.range);\n                    let newName = qn;\n                    if (!isQn) newName = params.newName;\n                    const nodeChange = TextEdit.replace(nodeLocation.range, newName);\n                    if (changes[nodeLocation.uri]) {\n                        changes[nodeLocation.uri].push(nodeChange);\n                    } else {\n                        changes[nodeLocation.uri] = [nodeChange];\n                    }\n                });\n            }\n        }\n        return { changes };\n    }\n\n    protected hasQualifiedNameText(uri: URI, range: Range): boolean {\n        const langiumDoc = this.langiumDocuments.getDocument(uri);\n        if (!langiumDoc) {\n            return false;\n        }\n        const rangeText = langiumDoc.textDocument.getText(range);\n        return rangeText.includes('.', 0);\n    }\n\n    getRefLocation(ref: ReferenceDescription): Location {\n        return Location.create(\n            ref.sourceUri.toString(),\n            ref.segment.range\n        );\n    }\n\n    getNodeLocation(targetNode: AstNode): Location | undefined {\n        const nameNode = this.nameProvider.getNameNode(targetNode);\n        if (nameNode) {\n            const doc = AstUtils.getDocument(targetNode);\n            return Location.create(\n                doc.uri.toString(),\n                CstUtils.toDocumentSegment(nameNode).range\n            );\n        }\n        return undefined;\n    }\n\n    protected buildQualifiedName(node: AstNode): string | undefined {\n        if (node.$type === 'Feature') return undefined;\n        let name = this.nameProvider.getName(node);\n        if (name) {\n            if (isPackageDeclaration(node.$container)) {\n                name = this.qualifiedNameProvider.getQualifiedName(node.$container, name);\n            }\n        }\n        return name;\n    }\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { AstNode, AstNodeDescription, LangiumDocument, LocalSymbols } from 'langium';\nimport type { DomainModelServices } from './domain-model-module.js';\nimport type { QualifiedNameProvider } from './domain-model-naming.js';\nimport type { Domainmodel, PackageDeclaration } from './generated/ast.js';\nimport { AstUtils, Cancellation, DefaultScopeComputation, interruptAndCheck, MultiMap } from 'langium';\nimport { isType, isPackageDeclaration } from './generated/ast.js';\n\nexport class DomainModelScopeComputation extends DefaultScopeComputation {\n\n    qualifiedNameProvider: QualifiedNameProvider;\n\n    constructor(services: DomainModelServices) {\n        super(services);\n        this.qualifiedNameProvider = services.references.QualifiedNameProvider;\n    }\n\n    /**\n     * Exports only types (`DataType or `Entity`) with their qualified names.\n     */\n    override async collectExportedSymbols(document: LangiumDocument, cancelToken = Cancellation.CancellationToken.None): Promise<AstNodeDescription[]> {\n        const descr: AstNodeDescription[] = [];\n        for (const modelNode of AstUtils.streamAllContents(document.parseResult.value)) {\n            await interruptAndCheck(cancelToken);\n            if (isType(modelNode)) {\n                let name = this.nameProvider.getName(modelNode);\n                if (name) {\n                    if (isPackageDeclaration(modelNode.$container)) {\n                        name = this.qualifiedNameProvider.getQualifiedName(modelNode.$container as PackageDeclaration, name);\n                    }\n                    descr.push(this.descriptions.createDescription(modelNode, name, document));\n                }\n            }\n        }\n        return descr;\n    }\n\n    override async collectLocalSymbols(document: LangiumDocument<Domainmodel>, cancelToken = Cancellation.CancellationToken.None): Promise<LocalSymbols> {\n        const model = document.parseResult.value;\n        const symbols = new MultiMap<AstNode, AstNodeDescription>();\n        await this.processContainer(model, symbols, document, cancelToken);\n        return symbols;\n    }\n\n    protected async processContainer(container: Domainmodel | PackageDeclaration, symbols: MultiMap<AstNode, AstNodeDescription>, document: LangiumDocument, cancelToken: Cancellation.CancellationToken): Promise<AstNodeDescription[]> {\n        const localDescriptions: AstNodeDescription[] = [];\n        for (const element of container.elements) {\n            await interruptAndCheck(cancelToken);\n            if (isType(element) && element.name) {\n                const description = this.descriptions.createDescription(element, element.name, document);\n                localDescriptions.push(description);\n            } else if (isPackageDeclaration(element)) {\n                const nestedDescriptions = await this.processContainer(element, symbols, document, cancelToken);\n                for (const description of nestedDescriptions) {\n                    // Add qualified names to the container\n                    const qualified = this.createQualifiedDescription(element, description, document);\n                    localDescriptions.push(qualified);\n                }\n            }\n        }\n        symbols.addAll(container, localDescriptions);\n        return localDescriptions;\n    }\n\n    protected createQualifiedDescription(pack: PackageDeclaration, description: AstNodeDescription, document: LangiumDocument): AstNodeDescription {\n        const name = this.qualifiedNameProvider.getQualifiedName(pack.name, description.name);\n        return this.descriptions.createDescription(description.node!, name, document);\n    }\n\n}\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport type { ValidationAcceptor, ValidationChecks } from 'langium';\nimport type { DomainModelAstType, Type } from './generated/ast.js';\nimport type { DomainModelServices } from './domain-model-module.js';\n\nexport function registerValidationChecks(services: DomainModelServices) {\n    const registry = services.validation.ValidationRegistry;\n    const validator = services.validation.DomainModelValidator;\n    const checks: ValidationChecks<DomainModelAstType> = {\n        Type: validator.checkTypeStartsWithCapital\n    };\n    registry.register(checks, validator);\n}\n\nexport class DomainModelValidator {\n\n    checkTypeStartsWithCapital(type: Type, accept: ValidationAcceptor): void {\n        if (type.name) {\n            const firstChar = type.name.substring(0, 1);\n            if (firstChar.toUpperCase() !== firstChar) {\n                accept('warning', 'Type name should start with a capital.', { node: type, property: 'name' });\n            }\n        }\n    }\n\n}\n", "/******************************************************************************\n * This file was generated by langium-cli 4.3.0.\n * DO NOT EDIT MANUALLY!\n ******************************************************************************/\n\nimport type { Grammar } from 'langium';\nimport { loadGrammarFromJson } from 'langium';\n\nlet loadedDomainModelGrammar: Grammar | undefined;\nexport const DomainModelGrammar = (): Grammar => loadedDomainModelGrammar ?? (loadedDomainModelGrammar = loadGrammarFromJson(`{\n  \"$type\": \"Grammar\",\n  \"isDeclared\": true,\n  \"name\": \"DomainModel\",\n  \"rules\": [\n    {\n      \"$type\": \"ParserRule\",\n      \"entry\": true,\n      \"name\": \"Domainmodel\",\n      \"definition\": {\n        \"$type\": \"Assignment\",\n        \"feature\": \"elements\",\n        \"operator\": \"+=\",\n        \"terminal\": {\n          \"$type\": \"RuleCall\",\n          \"rule\": {\n            \"$ref\": \"#/rules@1\"\n          },\n          \"arguments\": []\n        },\n        \"cardinality\": \"*\"\n      },\n      \"fragment\": false,\n      \"parameters\": []\n    },\n    {\n      \"$type\": \"ParserRule\",\n      \"name\": \"AbstractElement\",\n      \"definition\": {\n        \"$type\": \"Alternatives\",\n        \"elements\": [\n          {\n            \"$type\": \"RuleCall\",\n            \"rule\": {\n              \"$ref\": \"#/rules@2\"\n            },\n            \"arguments\": []\n          },\n          {\n            \"$type\": \"RuleCall\",\n            \"rule\": {\n              \"$ref\": \"#/rules@3\"\n            },\n            \"arguments\": []\n          }\n        ]\n      },\n      \"entry\": false,\n      \"fragment\": false,\n      \"parameters\": []\n    },\n    {\n      \"$type\": \"ParserRule\",\n      \"name\": \"PackageDeclaration\",\n      \"definition\": {\n        \"$type\": \"Group\",\n        \"elements\": [\n          {\n            \"$type\": \"Keyword\",\n            \"value\": \"package\"\n          },\n          {\n            \"$type\": \"Assignment\",\n            \"feature\": \"name\",\n            \"operator\": \"=\",\n            \"terminal\": {\n              \"$type\": \"RuleCall\",\n              \"rule\": {\n                \"$ref\": \"#/rules@7\"\n              },\n              \"arguments\": []\n            }\n          },\n          {\n            \"$type\": \"Keyword\",\n            \"value\": \"{\"\n          },\n          {\n            \"$type\": \"Assignment\",\n            \"feature\": \"elements\",\n            \"operator\": \"+=\",\n            \"terminal\": {\n              \"$type\": \"RuleCall\",\n              \"rule\": {\n                \"$ref\": \"#/rules@1\"\n              },\n              \"arguments\": []\n            },\n            \"cardinality\": \"*\"\n          },\n          {\n            \"$type\": \"Keyword\",\n            \"value\": \"}\"\n          }\n        ]\n      },\n      \"entry\": false,\n      \"fragment\": false,\n      \"parameters\": []\n    },\n    {\n      \"$type\": \"ParserRule\",\n      \"name\": \"Type\",\n      \"definition\": {\n        \"$type\": \"Alternatives\",\n        \"elements\": [\n          {\n            \"$type\": \"RuleCall\",\n            \"rule\": {\n              \"$ref\": \"#/rules@4\"\n            },\n            \"arguments\": []\n          },\n          {\n            \"$type\": \"RuleCall\",\n            \"rule\": {\n              \"$ref\": \"#/rules@5\"\n            },\n            \"arguments\": []\n          }\n        ]\n      },\n      \"entry\": false,\n      \"fragment\": false,\n      \"parameters\": []\n    },\n    {\n      \"$type\": \"ParserRule\",\n      \"name\": \"DataType\",\n      \"definition\": {\n        \"$type\": \"Group\",\n        \"elements\": [\n          {\n            \"$type\": \"Keyword\",\n            \"value\": \"datatype\"\n          },\n          {\n            \"$type\": \"Assignment\",\n            \"feature\": \"name\",\n            \"operator\": \"=\",\n            \"terminal\": {\n              \"$type\": \"RuleCall\",\n              \"rule\": {\n                \"$ref\": \"#/rules@9\"\n              },\n              \"arguments\": []\n            }\n          }\n        ]\n      },\n      \"entry\": false,\n      \"fragment\": false,\n      \"parameters\": []\n    },\n    {\n      \"$type\": \"ParserRule\",\n      \"name\": \"Entity\",\n      \"definition\": {\n        \"$type\": \"Group\",\n        \"elements\": [\n          {\n            \"$type\": \"Keyword\",\n            \"value\": \"entity\"\n          },\n          {\n            \"$type\": \"Assignment\",\n            \"feature\": \"name\",\n            \"operator\": \"=\",\n            \"terminal\": {\n              \"$type\": \"RuleCall\",\n              \"rule\": {\n                \"$ref\": \"#/rules@9\"\n              },\n              \"arguments\": []\n            }\n          },\n          {\n            \"$type\": \"Group\",\n            \"elements\": [\n              {\n                \"$type\": \"Keyword\",\n                \"value\": \"extends\"\n              },\n              {\n                \"$type\": \"Assignment\",\n                \"feature\": \"superType\",\n                \"operator\": \"=\",\n                \"terminal\": {\n                  \"$type\": \"CrossReference\",\n                  \"isMulti\": true,\n                  \"type\": {\n                    \"$ref\": \"#/rules@5\"\n                  },\n                  \"terminal\": {\n                    \"$type\": \"RuleCall\",\n                    \"rule\": {\n                      \"$ref\": \"#/rules@7\"\n                    },\n                    \"arguments\": []\n                  },\n                  \"deprecatedSyntax\": false\n                }\n              }\n            ],\n            \"cardinality\": \"?\"\n          },\n          {\n            \"$type\": \"Keyword\",\n            \"value\": \"{\"\n          },\n          {\n            \"$type\": \"Assignment\",\n            \"feature\": \"features\",\n            \"operator\": \"+=\",\n            \"terminal\": {\n              \"$type\": \"RuleCall\",\n              \"rule\": {\n                \"$ref\": \"#/rules@6\"\n              },\n              \"arguments\": []\n            },\n            \"cardinality\": \"*\"\n          },\n          {\n            \"$type\": \"Keyword\",\n            \"value\": \"}\"\n          }\n        ]\n      },\n      \"entry\": false,\n      \"fragment\": false,\n      \"parameters\": []\n    },\n    {\n      \"$type\": \"ParserRule\",\n      \"name\": \"Feature\",\n      \"definition\": {\n        \"$type\": \"Group\",\n        \"elements\": [\n          {\n            \"$type\": \"Assignment\",\n            \"feature\": \"many\",\n            \"operator\": \"?=\",\n            \"terminal\": {\n              \"$type\": \"Keyword\",\n              \"value\": \"many\"\n            },\n            \"cardinality\": \"?\"\n          },\n          {\n            \"$type\": \"Assignment\",\n            \"feature\": \"name\",\n            \"operator\": \"=\",\n            \"terminal\": {\n              \"$type\": \"RuleCall\",\n              \"rule\": {\n                \"$ref\": \"#/rules@9\"\n              },\n              \"arguments\": []\n            }\n          },\n          {\n            \"$type\": \"Keyword\",\n            \"value\": \":\"\n          },\n          {\n            \"$type\": \"Assignment\",\n            \"feature\": \"type\",\n            \"operator\": \"=\",\n            \"terminal\": {\n              \"$type\": \"CrossReference\",\n              \"type\": {\n                \"$ref\": \"#/rules@3\"\n              },\n              \"terminal\": {\n                \"$type\": \"RuleCall\",\n                \"rule\": {\n                  \"$ref\": \"#/rules@7\"\n                },\n                \"arguments\": []\n              },\n              \"deprecatedSyntax\": false,\n              \"isMulti\": false\n            }\n          }\n        ]\n      },\n      \"entry\": false,\n      \"fragment\": false,\n      \"parameters\": []\n    },\n    {\n      \"$type\": \"ParserRule\",\n      \"name\": \"QualifiedName\",\n      \"dataType\": \"string\",\n      \"definition\": {\n        \"$type\": \"Group\",\n        \"elements\": [\n          {\n            \"$type\": \"RuleCall\",\n            \"rule\": {\n              \"$ref\": \"#/rules@9\"\n            },\n            \"arguments\": []\n          },\n          {\n            \"$type\": \"Group\",\n            \"elements\": [\n              {\n                \"$type\": \"Keyword\",\n                \"value\": \".\"\n              },\n              {\n                \"$type\": \"RuleCall\",\n                \"rule\": {\n                  \"$ref\": \"#/rules@9\"\n                },\n                \"arguments\": []\n              }\n            ],\n            \"cardinality\": \"*\"\n          }\n        ]\n      },\n      \"entry\": false,\n      \"fragment\": false,\n      \"parameters\": []\n    },\n    {\n      \"$type\": \"TerminalRule\",\n      \"hidden\": true,\n      \"name\": \"WS\",\n      \"definition\": {\n        \"$type\": \"RegexToken\",\n        \"regex\": \"/\\\\\\\\s+/\",\n        \"parenthesized\": false\n      },\n      \"fragment\": false\n    },\n    {\n      \"$type\": \"TerminalRule\",\n      \"name\": \"ID\",\n      \"definition\": {\n        \"$type\": \"RegexToken\",\n        \"regex\": \"/[_a-zA-Z][\\\\\\\\w_]*/\",\n        \"parenthesized\": false\n      },\n      \"fragment\": false,\n      \"hidden\": false\n    },\n    {\n      \"$type\": \"TerminalRule\",\n      \"hidden\": true,\n      \"name\": \"ML_COMMENT\",\n      \"definition\": {\n        \"$type\": \"RegexToken\",\n        \"regex\": \"/\\\\\\\\/\\\\\\\\*[\\\\\\\\s\\\\\\\\S]*?\\\\\\\\*\\\\\\\\//\",\n        \"parenthesized\": false\n      },\n      \"fragment\": false\n    },\n    {\n      \"$type\": \"TerminalRule\",\n      \"hidden\": true,\n      \"name\": \"SL_COMMENT\",\n      \"definition\": {\n        \"$type\": \"RegexToken\",\n        \"regex\": \"/\\\\\\\\/\\\\\\\\/[^\\\\\\\\n\\\\\\\\r]*/\",\n        \"parenthesized\": false\n      },\n      \"fragment\": false\n    }\n  ],\n  \"imports\": [],\n  \"interfaces\": [],\n  \"types\": []\n}`));\n", "/******************************************************************************\n * This file was generated by langium-cli 4.3.0.\n * DO NOT EDIT MANUALLY!\n ******************************************************************************/\n\nimport type { LangiumSharedCoreServices, LangiumCoreServices, LangiumGeneratedCoreServices, LangiumGeneratedSharedCoreServices, LanguageMetaData, Module, IParserConfig } from 'langium';\nimport { DomainModelAstReflection } from './ast.js';\nimport { DomainModelGrammar } from './grammar.js';\n\nexport const DomainModelLanguageMetaData = {\n    languageId: 'domain-model',\n    fileExtensions: ['.dmodel'],\n    caseInsensitive: false,\n    mode: 'development'\n} as const satisfies LanguageMetaData;\n\nexport const parserConfig: IParserConfig = {\n    recoveryEnabled: true,\n    nodeLocationTracking: 'full',\n    maxLookahead: 3,\n};\n\nexport const DomainModelGeneratedSharedModule: Module<LangiumSharedCoreServices, LangiumGeneratedSharedCoreServices> = {\n    AstReflection: () => new DomainModelAstReflection()\n};\n\nexport const DomainModelGeneratedModule: Module<LangiumCoreServices, LangiumGeneratedCoreServices> = {\n    Grammar: () => DomainModelGrammar(),\n    LanguageMetaData: () => DomainModelLanguageMetaData,\n    parser: {\n        ParserConfig: () => parserConfig\n    }\n};\n", "/******************************************************************************\n * Copyright 2021 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\n\nimport { type Module, inject } from 'langium';\nimport type { LangiumServices, LangiumSharedServices, PartialLangiumServices } from 'langium/lsp';\nimport { createDefaultModule, createDefaultSharedModule, type DefaultSharedModuleContext } from 'langium/lsp';\nimport { DomainModelFormatter } from './domain-model-formatter.js';\nimport { QualifiedNameProvider } from './domain-model-naming.js';\nimport { DomainModelRenameProvider } from './domain-model-rename-refactoring.js';\nimport { DomainModelScopeComputation } from './domain-model-scope.js';\nimport { DomainModelValidator, registerValidationChecks } from './domain-model-validator.js';\nimport { DomainModelGeneratedModule, DomainModelGeneratedSharedModule } from './generated/module.js';\n\nexport type DomainModelAddedServices = {\n    references: {\n        QualifiedNameProvider: QualifiedNameProvider\n    },\n    validation: {\n        DomainModelValidator: DomainModelValidator\n    }\n}\n\nexport type DomainModelServices = LangiumServices & DomainModelAddedServices;\n\nexport const DomainModelModule: Module<DomainModelServices, PartialLangiumServices & DomainModelAddedServices> = {\n    references: {\n        ScopeComputation: (services) => new DomainModelScopeComputation(services),\n        QualifiedNameProvider: () => new QualifiedNameProvider()\n    },\n    validation: {\n        DomainModelValidator: () => new DomainModelValidator()\n    },\n    lsp: {\n        Formatter: () => new DomainModelFormatter(),\n        RenameProvider: (services) => new DomainModelRenameProvider(services)\n    }\n};\n\nexport function createDomainModelServices(context: DefaultSharedModuleContext): {\n    shared: LangiumSharedServices,\n    domainmodel: DomainModelServices\n} {\n    const shared = inject(\n        createDefaultSharedModule(context),\n        DomainModelGeneratedSharedModule\n    );\n    const domainmodel = inject(\n        createDefaultModule({ shared }),\n        DomainModelGeneratedModule,\n        DomainModelModule\n    );\n    shared.ServiceRegistry.register(domainmodel);\n    registerValidationChecks(domainmodel);\n    if (!context.connection) {\n        // We don't run inside a language server\n        // Therefore, initialize the configuration provider instantly\n        shared.workspace.ConfigurationProvider.initialized({});\n    }\n    return { shared, domainmodel };\n}\n"],
  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA,uDAAAA,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,UAAU;AAClB,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,OAAO;AACf,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,cAAc;AACtB,aAAS,QAAQ,OAAO;AACpB,aAAO,UAAU,QAAQ,UAAU;AAAA,IACvC;AACA,aAAS,OAAO,OAAO;AACnB,aAAO,OAAO,UAAU,YAAY,iBAAiB;AAAA,IACzD;AACA,aAAS,OAAO,OAAO;AACnB,aAAO,OAAO,UAAU,YAAY,iBAAiB;AAAA,IACzD;AACA,aAAS,MAAM,OAAO;AAClB,aAAO,iBAAiB;AAAA,IAC5B;AACA,aAAS,KAAK,OAAO;AACjB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,aAAS,MAAM,OAAO;AAClB,aAAO,MAAM,QAAQ,KAAK;AAAA,IAC9B;AACA,aAAS,YAAY,OAAO;AACxB,aAAO,MAAM,KAAK,KAAK,MAAM,MAAM,UAAQ,OAAO,IAAI,CAAC;AAAA,IAC3D;AAAA;AAAA;;;ACjCA;AAAA,6DAAAC,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,UAAUA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,mBAAmBA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,cAAcA,SAAQ,eAAeA,SAAQ,2BAA2BA,SAAQ,sBAAsBA,SAAQ,gBAAgBA,SAAQ,aAAa;AAC/qB,QAAM,KAAK,aAAa,YAAe;AAIvC,QAAI;AACJ,KAAC,SAAUE,aAAY;AAEnB,MAAAA,YAAW,aAAa;AACxB,MAAAA,YAAW,iBAAiB;AAC5B,MAAAA,YAAW,iBAAiB;AAC5B,MAAAA,YAAW,gBAAgB;AAC3B,MAAAA,YAAW,gBAAgB;AAU3B,MAAAA,YAAW,iCAAiC;AAE5C,MAAAA,YAAW,mBAAmB;AAI9B,MAAAA,YAAW,oBAAoB;AAI/B,MAAAA,YAAW,mBAAmB;AAK9B,MAAAA,YAAW,0BAA0B;AAIrC,MAAAA,YAAW,qBAAqB;AAKhC,MAAAA,YAAW,uBAAuB;AAClC,MAAAA,YAAW,mBAAmB;AAO9B,MAAAA,YAAW,+BAA+B;AAE1C,MAAAA,YAAW,iBAAiB;AAAA,IAChC,GAAG,eAAeF,SAAQ,aAAa,aAAa,CAAC,EAAE;AAKvD,QAAMG,iBAAN,MAAM,uBAAsB,MAAM;AAAA,MAG9B,YAAY,MAAM,SAAS,MAAM;AAC7B,cAAM,OAAO;AAHjB;AACA;AAGI,aAAK,OAAO,GAAG,OAAO,IAAI,IAAI,OAAO,WAAW;AAChD,aAAK,OAAO;AACZ,eAAO,eAAe,MAAM,eAAc,SAAS;AAAA,MACvD;AAAA,MACA,SAAS;AACL,cAAM,SAAS;AAAA,UACX,MAAM,KAAK;AAAA,UACX,SAAS,KAAK;AAAA,QAClB;AACA,YAAI,KAAK,SAAS,QAAW;AACzB,iBAAO,OAAO,KAAK;AAAA,QACvB;AACA,eAAO;AAAA,MACX;AAAA,IACJ;AACA,IAAAH,SAAQ,gBAAgBG;AACxB,QAAM,uBAAN,MAAM,qBAAoB;AAAA,MAkBtB,YAAY,MAAM;AAjBlB;AAkBI,aAAK,OAAO;AAAA,MAChB;AAAA,MACA,OAAO,GAAG,OAAO;AACb,eAAO,UAAU,qBAAoB,QAAQ,UAAU,qBAAoB,UAAU,UAAU,qBAAoB;AAAA,MACvH;AAAA,MACA,WAAW;AACP,eAAO,KAAK;AAAA,MAChB;AAAA,IACJ;AArBI;AAAA;AAAA;AAAA;AAAA,kBANE,sBAMK,QAAO,IAAI,qBAAoB,MAAM;AAK5C;AAAA;AAAA;AAAA;AAAA,kBAXE,sBAWK,cAAa,IAAI,qBAAoB,YAAY;AAMxD;AAAA;AAAA;AAAA;AAAA;AAAA,kBAjBE,sBAiBK,UAAS,IAAI,qBAAoB,QAAQ;AAjBpD,QAAM,sBAAN;AA4BA,IAAAH,SAAQ,sBAAsB;AAI9B,QAAM,2BAAN,MAA+B;AAAA,MAG3B,YAAY,QAAQ,gBAAgB;AAFpC;AACA;AAEI,aAAK,SAAS;AACd,aAAK,iBAAiB;AAAA,MAC1B;AAAA,MACA,IAAI,sBAAsB;AACtB,eAAO,oBAAoB;AAAA,MAC/B;AAAA,IACJ;AACA,IAAAA,SAAQ,2BAA2B;AAInC,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,cAAN,cAA0B,yBAAyB;AAAA,MAM/C,YAAY,QAAQ,uBAAuB,oBAAoB,MAAM;AACjE,cAAM,QAAQ,CAAC;AANnB;AAIA;AAAA;AAAA;AAAA;AAGI,aAAK,uBAAuB;AAAA,MAChC;AAAA,MACA,IAAI,sBAAsB;AACtB,eAAO,KAAK;AAAA,MAChB;AAAA,IACJ;AACA,IAAAA,SAAQ,cAAc;AACtB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAMhD,YAAY,QAAQ,uBAAuB,oBAAoB,MAAM;AACjE,cAAM,QAAQ,CAAC;AANnB;AAIA;AAAA;AAAA;AAAA;AAGI,aAAK,uBAAuB;AAAA,MAChC;AAAA,MACA,IAAI,sBAAsB;AACtB,eAAO,KAAK;AAAA,MAChB;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,eAAN,cAA2B,yBAAyB;AAAA,MAKhD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,eAAe;AACvB,QAAM,mBAAN,cAA+B,yBAAyB;AAAA,MAMpD,YAAY,QAAQ,uBAAuB,oBAAoB,MAAM;AACjE,cAAM,QAAQ,CAAC;AANnB;AAIA;AAAA;AAAA;AAAA;AAGI,aAAK,uBAAuB;AAAA,MAChC;AAAA,MACA,IAAI,sBAAsB;AACtB,eAAO,KAAK;AAAA,MAChB;AAAA,IACJ;AACA,IAAAA,SAAQ,mBAAmB;AAC3B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAMrD,YAAY,QAAQ,uBAAuB,oBAAoB,MAAM;AACjE,cAAM,QAAQ,CAAC;AANnB;AAIA;AAAA;AAAA;AAAA;AAGI,aAAK,uBAAuB;AAAA,MAChC;AAAA,MACA,IAAI,sBAAsB;AACtB,eAAO,KAAK;AAAA,MAChB;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,yBAAyB;AAAA,MAKrD,YAAY,QAAQ;AAChB,cAAM,QAAQ,CAAC;AAFnB;AAAA;AAAA;AAAA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAI;AACJ,KAAC,SAAUI,UAAS;AAIhB,eAAS,UAAU,SAAS;AACxB,cAAM,YAAY;AAClB,eAAO,aAAa,GAAG,OAAO,UAAU,MAAM,MAAM,GAAG,OAAO,UAAU,EAAE,KAAK,GAAG,OAAO,UAAU,EAAE;AAAA,MACzG;AACA,MAAAA,SAAQ,YAAY;AAIpB,eAAS,eAAe,SAAS;AAC7B,cAAM,YAAY;AAClB,eAAO,aAAa,GAAG,OAAO,UAAU,MAAM,KAAK,QAAQ,OAAO;AAAA,MACtE;AACA,MAAAA,SAAQ,iBAAiB;AAIzB,eAAS,WAAW,SAAS;AACzB,cAAM,YAAY;AAClB,eAAO,cAAc,UAAU,WAAW,UAAU,CAAC,CAAC,UAAU,WAAW,GAAG,OAAO,UAAU,EAAE,KAAK,GAAG,OAAO,UAAU,EAAE,KAAK,UAAU,OAAO;AAAA,MACtJ;AACA,MAAAA,SAAQ,aAAa;AAAA,IACzB,GAAG,YAAYJ,SAAQ,UAAU,UAAU,CAAC,EAAE;AAAA;AAAA;;;ACnb9C;AAAA,8DAAAK,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,WAAWA,SAAQ,YAAYA,SAAQ,QAAQ;AACvD,QAAI;AACJ,KAAC,SAAUC,QAAO;AACd,MAAAA,OAAM,OAAO;AACb,MAAAA,OAAM,QAAQ;AACd,MAAAA,OAAM,QAAQA,OAAM;AACpB,MAAAA,OAAM,OAAO;AACb,MAAAA,OAAM,QAAQA,OAAM;AAAA,IACxB,GAAG,UAAUD,SAAQ,QAAQ,QAAQ,CAAC,EAAE;AAdxC;AAeA,QAAM,YAAN,MAAgB;AAAA,MAOZ,cAAc;AANd,4BAAC,IAAsB;AACvB;AACA;AACA;AACA;AACA;AAEI,aAAK,OAAO,oBAAI,IAAI;AACpB,aAAK,QAAQ;AACb,aAAK,QAAQ;AACb,aAAK,QAAQ;AACb,aAAK,SAAS;AAAA,MAClB;AAAA,MACA,QAAQ;AACJ,aAAK,KAAK,MAAM;AAChB,aAAK,QAAQ;AACb,aAAK,QAAQ;AACb,aAAK,QAAQ;AACb,aAAK;AAAA,MACT;AAAA,MACA,UAAU;AACN,eAAO,CAAC,KAAK,SAAS,CAAC,KAAK;AAAA,MAChC;AAAA,MACA,IAAI,OAAO;AACP,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,QAAQ;AA1ChB,YAAAE;AA2CQ,gBAAOA,MAAA,KAAK,UAAL,gBAAAA,IAAY;AAAA,MACvB;AAAA,MACA,IAAI,OAAO;AA7Cf,YAAAA;AA8CQ,gBAAOA,MAAA,KAAK,UAAL,gBAAAA,IAAY;AAAA,MACvB;AAAA,MACA,OAAO,KAAK;AAhDhB,YAAAA;AAiDQ,cAAM,OAAO,KAAK,KAAK,IAAI,GAAG;AAC9B,eAAO,QAAOA,MAAA,KAAK,aAAL,gBAAAA,IAAe,QAAQ;AAAA,MACzC;AAAA,MACA,MAAM,KAAK;AApDf,YAAAA;AAqDQ,cAAM,OAAO,KAAK,KAAK,IAAI,GAAG;AAC9B,eAAO,QAAOA,MAAA,KAAK,SAAL,gBAAAA,IAAW,QAAQ;AAAA,MACrC;AAAA,MACA,IAAI,KAAK;AACL,eAAO,KAAK,KAAK,IAAI,GAAG;AAAA,MAC5B;AAAA,MACA,IAAI,KAAK,QAAQ,MAAM,MAAM;AACzB,cAAM,OAAO,KAAK,KAAK,IAAI,GAAG;AAC9B,YAAI,CAAC,MAAM;AACP,iBAAO;AAAA,QACX;AACA,YAAI,UAAU,MAAM,MAAM;AACtB,eAAK,MAAM,MAAM,KAAK;AAAA,QAC1B;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,KAAK,OAAO,QAAQ,MAAM,MAAM;AAChC,YAAI,OAAO,KAAK,KAAK,IAAI,GAAG;AAC5B,YAAI,MAAM;AACN,eAAK,QAAQ;AACb,cAAI,UAAU,MAAM,MAAM;AACtB,iBAAK,MAAM,MAAM,KAAK;AAAA,UAC1B;AAAA,QACJ,OACK;AACD,iBAAO,EAAE,KAAK,OAAO,MAAM,QAAW,UAAU,OAAU;AAC1D,kBAAQ,OAAO;AAAA,YACX,KAAK,MAAM;AACP,mBAAK,YAAY,IAAI;AACrB;AAAA,YACJ,KAAK,MAAM;AACP,mBAAK,aAAa,IAAI;AACtB;AAAA,YACJ,KAAK,MAAM;AACP,mBAAK,YAAY,IAAI;AACrB;AAAA,YACJ;AACI,mBAAK,YAAY,IAAI;AACrB;AAAA,UACR;AACA,eAAK,KAAK,IAAI,KAAK,IAAI;AACvB,eAAK;AAAA,QACT;AACA,eAAO;AAAA,MACX;AAAA,MACA,OAAO,KAAK;AACR,eAAO,CAAC,CAAC,KAAK,OAAO,GAAG;AAAA,MAC5B;AAAA,MACA,OAAO,KAAK;AACR,cAAM,OAAO,KAAK,KAAK,IAAI,GAAG;AAC9B,YAAI,CAAC,MAAM;AACP,iBAAO;AAAA,QACX;AACA,aAAK,KAAK,OAAO,GAAG;AACpB,aAAK,WAAW,IAAI;AACpB,aAAK;AACL,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,QAAQ;AACJ,YAAI,CAAC,KAAK,SAAS,CAAC,KAAK,OAAO;AAC5B,iBAAO;AAAA,QACX;AACA,YAAI,CAAC,KAAK,SAAS,CAAC,KAAK,OAAO;AAC5B,gBAAM,IAAI,MAAM,cAAc;AAAA,QAClC;AACA,cAAM,OAAO,KAAK;AAClB,aAAK,KAAK,OAAO,KAAK,GAAG;AACzB,aAAK,WAAW,IAAI;AACpB,aAAK;AACL,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,QAAQ,YAAY,SAAS;AACzB,cAAM,QAAQ,KAAK;AACnB,YAAI,UAAU,KAAK;AACnB,eAAO,SAAS;AACZ,cAAI,SAAS;AACT,uBAAW,KAAK,OAAO,EAAE,QAAQ,OAAO,QAAQ,KAAK,IAAI;AAAA,UAC7D,OACK;AACD,uBAAW,QAAQ,OAAO,QAAQ,KAAK,IAAI;AAAA,UAC/C;AACA,cAAI,KAAK,WAAW,OAAO;AACvB,kBAAM,IAAI,MAAM,0CAA0C;AAAA,UAC9D;AACA,oBAAU,QAAQ;AAAA,QACtB;AAAA,MACJ;AAAA,MACA,OAAO;AACH,cAAM,QAAQ,KAAK;AACnB,YAAI,UAAU,KAAK;AACnB,cAAM,WAAW;AAAA,UACb,CAAC,OAAO,QAAQ,GAAG,MAAM;AACrB,mBAAO;AAAA,UACX;AAAA,UACA,MAAM,MAAM;AACR,gBAAI,KAAK,WAAW,OAAO;AACvB,oBAAM,IAAI,MAAM,0CAA0C;AAAA,YAC9D;AACA,gBAAI,SAAS;AACT,oBAAM,SAAS,EAAE,OAAO,QAAQ,KAAK,MAAM,MAAM;AACjD,wBAAU,QAAQ;AAClB,qBAAO;AAAA,YACX,OACK;AACD,qBAAO,EAAE,OAAO,QAAW,MAAM,KAAK;AAAA,YAC1C;AAAA,UACJ;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA,MACA,SAAS;AACL,cAAM,QAAQ,KAAK;AACnB,YAAI,UAAU,KAAK;AACnB,cAAM,WAAW;AAAA,UACb,CAAC,OAAO,QAAQ,GAAG,MAAM;AACrB,mBAAO;AAAA,UACX;AAAA,UACA,MAAM,MAAM;AACR,gBAAI,KAAK,WAAW,OAAO;AACvB,oBAAM,IAAI,MAAM,0CAA0C;AAAA,YAC9D;AACA,gBAAI,SAAS;AACT,oBAAM,SAAS,EAAE,OAAO,QAAQ,OAAO,MAAM,MAAM;AACnD,wBAAU,QAAQ;AAClB,qBAAO;AAAA,YACX,OACK;AACD,qBAAO,EAAE,OAAO,QAAW,MAAM,KAAK;AAAA,YAC1C;AAAA,UACJ;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA,MACA,UAAU;AACN,cAAM,QAAQ,KAAK;AACnB,YAAI,UAAU,KAAK;AACnB,cAAM,WAAW;AAAA,UACb,CAAC,OAAO,QAAQ,GAAG,MAAM;AACrB,mBAAO;AAAA,UACX;AAAA,UACA,MAAM,MAAM;AACR,gBAAI,KAAK,WAAW,OAAO;AACvB,oBAAM,IAAI,MAAM,0CAA0C;AAAA,YAC9D;AACA,gBAAI,SAAS;AACT,oBAAM,SAAS,EAAE,OAAO,CAAC,QAAQ,KAAK,QAAQ,KAAK,GAAG,MAAM,MAAM;AAClE,wBAAU,QAAQ;AAClB,qBAAO;AAAA,YACX,OACK;AACD,qBAAO,EAAE,OAAO,QAAW,MAAM,KAAK;AAAA,YAC1C;AAAA,UACJ;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA,MACA,EAjMC,YAAO,aAiMP,OAAO,SAAQ,IAAI;AAChB,eAAO,KAAK,QAAQ;AAAA,MACxB;AAAA,MACA,QAAQ,SAAS;AACb,YAAI,WAAW,KAAK,MAAM;AACtB;AAAA,QACJ;AACA,YAAI,YAAY,GAAG;AACf,eAAK,MAAM;AACX;AAAA,QACJ;AACA,YAAI,UAAU,KAAK;AACnB,YAAI,cAAc,KAAK;AACvB,eAAO,WAAW,cAAc,SAAS;AACrC,eAAK,KAAK,OAAO,QAAQ,GAAG;AAC5B,oBAAU,QAAQ;AAClB;AAAA,QACJ;AACA,aAAK,QAAQ;AACb,aAAK,QAAQ;AACb,YAAI,SAAS;AACT,kBAAQ,WAAW;AAAA,QACvB;AACA,aAAK;AAAA,MACT;AAAA,MACA,aAAa,MAAM;AAEf,YAAI,CAAC,KAAK,SAAS,CAAC,KAAK,OAAO;AAC5B,eAAK,QAAQ;AAAA,QACjB,WACS,CAAC,KAAK,OAAO;AAClB,gBAAM,IAAI,MAAM,cAAc;AAAA,QAClC,OACK;AACD,eAAK,OAAO,KAAK;AACjB,eAAK,MAAM,WAAW;AAAA,QAC1B;AACA,aAAK,QAAQ;AACb,aAAK;AAAA,MACT;AAAA,MACA,YAAY,MAAM;AAEd,YAAI,CAAC,KAAK,SAAS,CAAC,KAAK,OAAO;AAC5B,eAAK,QAAQ;AAAA,QACjB,WACS,CAAC,KAAK,OAAO;AAClB,gBAAM,IAAI,MAAM,cAAc;AAAA,QAClC,OACK;AACD,eAAK,WAAW,KAAK;AACrB,eAAK,MAAM,OAAO;AAAA,QACtB;AACA,aAAK,QAAQ;AACb,aAAK;AAAA,MACT;AAAA,MACA,WAAW,MAAM;AACb,YAAI,SAAS,KAAK,SAAS,SAAS,KAAK,OAAO;AAC5C,eAAK,QAAQ;AACb,eAAK,QAAQ;AAAA,QACjB,WACS,SAAS,KAAK,OAAO;AAG1B,cAAI,CAAC,KAAK,MAAM;AACZ,kBAAM,IAAI,MAAM,cAAc;AAAA,UAClC;AACA,eAAK,KAAK,WAAW;AACrB,eAAK,QAAQ,KAAK;AAAA,QACtB,WACS,SAAS,KAAK,OAAO;AAG1B,cAAI,CAAC,KAAK,UAAU;AAChB,kBAAM,IAAI,MAAM,cAAc;AAAA,UAClC;AACA,eAAK,SAAS,OAAO;AACrB,eAAK,QAAQ,KAAK;AAAA,QACtB,OACK;AACD,gBAAM,OAAO,KAAK;AAClB,gBAAM,WAAW,KAAK;AACtB,cAAI,CAAC,QAAQ,CAAC,UAAU;AACpB,kBAAM,IAAI,MAAM,cAAc;AAAA,UAClC;AACA,eAAK,WAAW;AAChB,mBAAS,OAAO;AAAA,QACpB;AACA,aAAK,OAAO;AACZ,aAAK,WAAW;AAChB,aAAK;AAAA,MACT;AAAA,MACA,MAAM,MAAM,OAAO;AACf,YAAI,CAAC,KAAK,SAAS,CAAC,KAAK,OAAO;AAC5B,gBAAM,IAAI,MAAM,cAAc;AAAA,QAClC;AACA,YAAK,UAAU,MAAM,SAAS,UAAU,MAAM,MAAO;AACjD;AAAA,QACJ;AACA,YAAI,UAAU,MAAM,OAAO;AACvB,cAAI,SAAS,KAAK,OAAO;AACrB;AAAA,UACJ;AACA,gBAAM,OAAO,KAAK;AAClB,gBAAM,WAAW,KAAK;AAEtB,cAAI,SAAS,KAAK,OAAO;AAGrB,qBAAS,OAAO;AAChB,iBAAK,QAAQ;AAAA,UACjB,OACK;AAED,iBAAK,WAAW;AAChB,qBAAS,OAAO;AAAA,UACpB;AAEA,eAAK,WAAW;AAChB,eAAK,OAAO,KAAK;AACjB,eAAK,MAAM,WAAW;AACtB,eAAK,QAAQ;AACb,eAAK;AAAA,QACT,WACS,UAAU,MAAM,MAAM;AAC3B,cAAI,SAAS,KAAK,OAAO;AACrB;AAAA,UACJ;AACA,gBAAM,OAAO,KAAK;AAClB,gBAAM,WAAW,KAAK;AAEtB,cAAI,SAAS,KAAK,OAAO;AAGrB,iBAAK,WAAW;AAChB,iBAAK,QAAQ;AAAA,UACjB,OACK;AAED,iBAAK,WAAW;AAChB,qBAAS,OAAO;AAAA,UACpB;AACA,eAAK,OAAO;AACZ,eAAK,WAAW,KAAK;AACrB,eAAK,MAAM,OAAO;AAClB,eAAK,QAAQ;AACb,eAAK;AAAA,QACT;AAAA,MACJ;AAAA,MACA,SAAS;AACL,cAAM,OAAO,CAAC;AACd,aAAK,QAAQ,CAAC,OAAO,QAAQ;AACzB,eAAK,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,QAC1B,CAAC;AACD,eAAO;AAAA,MACX;AAAA,MACA,SAAS,MAAM;AACX,aAAK,MAAM;AACX,mBAAW,CAAC,KAAK,KAAK,KAAK,MAAM;AAC7B,eAAK,IAAI,KAAK,KAAK;AAAA,QACvB;AAAA,MACJ;AAAA,IACJ;AACA,IAAAF,SAAQ,YAAY;AACpB,QAAM,WAAN,cAAuB,UAAU;AAAA,MAG7B,YAAY,OAAO,QAAQ,GAAG;AAC1B,cAAM;AAHV;AACA;AAGI,aAAK,SAAS;AACd,aAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,GAAG,CAAC;AAAA,MAChD;AAAA,MACA,IAAI,QAAQ;AACR,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,MAAM,OAAO;AACb,aAAK,SAAS;AACd,aAAK,UAAU;AAAA,MACnB;AAAA,MACA,IAAI,QAAQ;AACR,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,MAAM,OAAO;AACb,aAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,GAAG,CAAC;AAC5C,aAAK,UAAU;AAAA,MACnB;AAAA,MACA,IAAI,KAAK,QAAQ,MAAM,OAAO;AAC1B,eAAO,MAAM,IAAI,KAAK,KAAK;AAAA,MAC/B;AAAA,MACA,KAAK,KAAK;AACN,eAAO,MAAM,IAAI,KAAK,MAAM,IAAI;AAAA,MACpC;AAAA,MACA,IAAI,KAAK,OAAO;AACZ,cAAM,IAAI,KAAK,OAAO,MAAM,IAAI;AAChC,aAAK,UAAU;AACf,eAAO;AAAA,MACX;AAAA,MACA,YAAY;AACR,YAAI,KAAK,OAAO,KAAK,QAAQ;AACzB,eAAK,QAAQ,KAAK,MAAM,KAAK,SAAS,KAAK,MAAM,CAAC;AAAA,QACtD;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,WAAW;AAAA;AAAA;;;AC3ZnB;AAAA,+DAAAG,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,aAAa;AACrB,QAAIC;AACJ,KAAC,SAAUA,aAAY;AACnB,eAAS,OAAO,MAAM;AAClB,eAAO;AAAA,UACH,SAAS;AAAA,QACb;AAAA,MACJ;AACA,MAAAA,YAAW,SAAS;AAAA,IACxB,GAAGA,gBAAeD,SAAQ,aAAaC,cAAa,CAAC,EAAE;AAAA;AAAA;;;ACfvD;AAAA,wDAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,QAAI;AACJ,aAAS,MAAM;AACX,UAAI,SAAS,QAAW;AACpB,cAAM,IAAI,MAAM,wCAAwC;AAAA,MAC5D;AACA,aAAO;AAAA,IACX;AACA,KAAC,SAAUC,MAAK;AACZ,eAAS,QAAQ,KAAK;AAClB,YAAI,QAAQ,QAAW;AACnB,gBAAM,IAAI,MAAM,uCAAuC;AAAA,QAC3D;AACA,eAAO;AAAA,MACX;AACA,MAAAA,KAAI,UAAU;AAAA,IAClB,GAAG,QAAQ,MAAM,CAAC,EAAE;AACpB,IAAAD,SAAQ,UAAU;AAAA;AAAA;;;ACtBlB;AAAA,2DAAAE,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAI;AAAA,IAC5D;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,UAAUA,SAAQ,QAAQ;AAClC,QAAM,QAAQ,gBAAgB,aAAgB;AAC9C,QAAI;AACJ,KAAC,SAAUC,QAAO;AACd,YAAM,cAAc,EAAE,UAAU;AAAA,MAAE,EAAE;AACpC,MAAAA,OAAM,OAAO,WAAY;AAAE,eAAO;AAAA,MAAa;AAAA,IACnD,GAAG,UAAUD,SAAQ,QAAQ,QAAQ,CAAC,EAAE;AACxC,QAAM,eAAN,MAAmB;AAAA,MAAnB;AACI;AACA;AAAA;AAAA,MACA,IAAI,UAAU,UAAU,MAAM,QAAQ;AAClC,YAAI,CAAC,KAAK,YAAY;AAClB,eAAK,aAAa,CAAC;AACnB,eAAK,YAAY,CAAC;AAAA,QACtB;AACA,aAAK,WAAW,KAAK,QAAQ;AAC7B,aAAK,UAAU,KAAK,OAAO;AAC3B,YAAI,MAAM,QAAQ,MAAM,GAAG;AACvB,iBAAO,KAAK,EAAE,SAAS,MAAM,KAAK,OAAO,UAAU,OAAO,EAAE,CAAC;AAAA,QACjE;AAAA,MACJ;AAAA,MACA,OAAO,UAAU,UAAU,MAAM;AAC7B,YAAI,CAAC,KAAK,YAAY;AAClB;AAAA,QACJ;AACA,YAAI,oCAAoC;AACxC,iBAAS,IAAI,GAAG,MAAM,KAAK,WAAW,QAAQ,IAAI,KAAK,KAAK;AACxD,cAAI,KAAK,WAAW,CAAC,MAAM,UAAU;AACjC,gBAAI,KAAK,UAAU,CAAC,MAAM,SAAS;AAE/B,mBAAK,WAAW,OAAO,GAAG,CAAC;AAC3B,mBAAK,UAAU,OAAO,GAAG,CAAC;AAC1B;AAAA,YACJ,OACK;AACD,kDAAoC;AAAA,YACxC;AAAA,UACJ;AAAA,QACJ;AACA,YAAI,mCAAmC;AACnC,gBAAM,IAAI,MAAM,mFAAmF;AAAA,QACvG;AAAA,MACJ;AAAA,MACA,UAAU,MAAM;AACZ,YAAI,CAAC,KAAK,YAAY;AAClB,iBAAO,CAAC;AAAA,QACZ;AACA,cAAM,MAAM,CAAC,GAAG,YAAY,KAAK,WAAW,MAAM,CAAC,GAAG,WAAW,KAAK,UAAU,MAAM,CAAC;AACvF,iBAAS,IAAI,GAAG,MAAM,UAAU,QAAQ,IAAI,KAAK,KAAK;AAClD,cAAI;AACA,gBAAI,KAAK,UAAU,CAAC,EAAE,MAAM,SAAS,CAAC,GAAG,IAAI,CAAC;AAAA,UAClD,SACO,GAAG;AACN,aAAC,GAAG,MAAM,SAAS,EAAE,QAAQ,MAAM,CAAC;AAAA,UACxC;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA,MACA,UAAU;AACN,eAAO,CAAC,KAAK,cAAc,KAAK,WAAW,WAAW;AAAA,MAC1D;AAAA,MACA,UAAU;AACN,aAAK,aAAa;AAClB,aAAK,YAAY;AAAA,MACrB;AAAA,IACJ;AACA,QAAM,WAAN,MAAM,SAAQ;AAAA,MAKV,YAAY,UAAU;AAJtB;AAEA;AACA;AAEI,aAAK,WAAW;AAAA,MACpB;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,QAAQ;AACR,YAAI,CAAC,KAAK,QAAQ;AACd,eAAK,SAAS,CAAC,UAAU,UAAU,gBAAgB;AAC/C,gBAAI,CAAC,KAAK,YAAY;AAClB,mBAAK,aAAa,IAAI,aAAa;AAAA,YACvC;AACA,gBAAI,KAAK,YAAY,KAAK,SAAS,sBAAsB,KAAK,WAAW,QAAQ,GAAG;AAChF,mBAAK,SAAS,mBAAmB,IAAI;AAAA,YACzC;AACA,iBAAK,WAAW,IAAI,UAAU,QAAQ;AACtC,kBAAM,SAAS;AAAA,cACX,SAAS,MAAM;AACX,oBAAI,CAAC,KAAK,YAAY;AAElB;AAAA,gBACJ;AACA,qBAAK,WAAW,OAAO,UAAU,QAAQ;AACzC,uBAAO,UAAU,SAAQ;AACzB,oBAAI,KAAK,YAAY,KAAK,SAAS,wBAAwB,KAAK,WAAW,QAAQ,GAAG;AAClF,uBAAK,SAAS,qBAAqB,IAAI;AAAA,gBAC3C;AAAA,cACJ;AAAA,YACJ;AACA,gBAAI,MAAM,QAAQ,WAAW,GAAG;AAC5B,0BAAY,KAAK,MAAM;AAAA,YAC3B;AACA,mBAAO;AAAA,UACX;AAAA,QACJ;AACA,eAAO,KAAK;AAAA,MAChB;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,KAAK,OAAO;AACR,YAAI,KAAK,YAAY;AACjB,eAAK,WAAW,OAAO,KAAK,KAAK,YAAY,KAAK;AAAA,QACtD;AAAA,MACJ;AAAA,MACA,UAAU;AACN,YAAI,KAAK,YAAY;AACjB,eAAK,WAAW,QAAQ;AACxB,eAAK,aAAa;AAAA,QACtB;AAAA,MACJ;AAAA,IACJ;AAxDI,kBAFE,UAEK,SAAQ,WAAY;AAAA,IAAE;AAFjC,QAAME,WAAN;AA2DA,IAAAF,SAAQ,UAAUE;AAAA;AAAA;;;ACtIlB;AAAA,iEAAAC,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,QAAI,kBAAmBD,YAAQA,SAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAI;AAAA,IAC5D;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,0BAA0BA,SAAQ,oBAAoB;AAC9D,QAAM,QAAQ,gBAAgB,aAAgB;AAC9C,QAAME,MAAK,aAAa,YAAe;AACvC,QAAM,WAAW;AACjB,QAAIC;AACJ,KAAC,SAAUA,oBAAmB;AAC1B,MAAAA,mBAAkB,OAAO,OAAO,OAAO;AAAA,QACnC,yBAAyB;AAAA,QACzB,yBAAyB,SAAS,MAAM;AAAA,MAC5C,CAAC;AACD,MAAAA,mBAAkB,YAAY,OAAO,OAAO;AAAA,QACxC,yBAAyB;AAAA,QACzB,yBAAyB,SAAS,MAAM;AAAA,MAC5C,CAAC;AACD,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cAAc,cAAcA,mBAAkB,QAC9C,cAAcA,mBAAkB,aAC/BD,IAAG,QAAQ,UAAU,uBAAuB,KAAK,CAAC,CAAC,UAAU;AAAA,MACzE;AACA,MAAAC,mBAAkB,KAAK;AAAA,IAC3B,GAAGA,uBAAsBH,SAAQ,oBAAoBG,qBAAoB,CAAC,EAAE;AAC5E,QAAM,gBAAgB,OAAO,OAAO,SAAU,UAAU,SAAS;AAC7D,YAAM,UAAU,GAAG,MAAM,SAAS,EAAE,MAAM,WAAW,SAAS,KAAK,OAAO,GAAG,CAAC;AAC9E,aAAO,EAAE,UAAU;AAAE,eAAO,QAAQ;AAAA,MAAG,EAAE;AAAA,IAC7C,CAAC;AACD,QAAM,eAAN,MAAmB;AAAA,MAAnB;AACI,4CAAe;AACf;AAAA;AAAA,MACA,SAAS;AACL,YAAI,CAAC,KAAK,cAAc;AACpB,eAAK,eAAe;AACpB,cAAI,KAAK,UAAU;AACf,iBAAK,SAAS,KAAK,MAAS;AAC5B,iBAAK,QAAQ;AAAA,UACjB;AAAA,QACJ;AAAA,MACJ;AAAA,MACA,IAAI,0BAA0B;AAC1B,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,0BAA0B;AAC1B,YAAI,KAAK,cAAc;AACnB,iBAAO;AAAA,QACX;AACA,YAAI,CAAC,KAAK,UAAU;AAChB,eAAK,WAAW,IAAI,SAAS,QAAQ;AAAA,QACzC;AACA,eAAO,KAAK,SAAS;AAAA,MACzB;AAAA,MACA,UAAU;AACN,YAAI,KAAK,UAAU;AACf,eAAK,SAAS,QAAQ;AACtB,eAAK,WAAW;AAAA,QACpB;AAAA,MACJ;AAAA,IACJ;AACA,QAAMC,2BAAN,MAA8B;AAAA,MAA9B;AACI;AAAA;AAAA,MACA,IAAI,QAAQ;AACR,YAAI,CAAC,KAAK,QAAQ;AAGd,eAAK,SAAS,IAAI,aAAa;AAAA,QACnC;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,SAAS;AACL,YAAI,CAAC,KAAK,QAAQ;AAId,eAAK,SAASD,mBAAkB;AAAA,QACpC,OACK;AACD,eAAK,OAAO,OAAO;AAAA,QACvB;AAAA,MACJ;AAAA,MACA,UAAU;AACN,YAAI,CAAC,KAAK,QAAQ;AAEd,eAAK,SAASA,mBAAkB;AAAA,QACpC,WACS,KAAK,kBAAkB,cAAc;AAE1C,eAAK,OAAO,QAAQ;AAAA,QACxB;AAAA,MACJ;AAAA,IACJ;AACA,IAAAH,SAAQ,0BAA0BI;AAAA;AAAA;;;ACnIlC;AAAA,4EAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,8BAA8BA,SAAQ,4BAA4B;AAC1E,QAAM,iBAAiB;AACvB,QAAI;AACJ,KAAC,SAAUC,oBAAmB;AAC1B,MAAAA,mBAAkB,WAAW;AAC7B,MAAAA,mBAAkB,YAAY;AAAA,IAClC,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAChD,QAAM,4BAAN,MAAgC;AAAA,MAE5B,cAAc;AADd;AAEI,aAAK,UAAU,oBAAI,IAAI;AAAA,MAC3B;AAAA,MACA,mBAAmB,SAAS;AACxB,YAAI,QAAQ,OAAO,MAAM;AACrB;AAAA,QACJ;AACA,cAAM,SAAS,IAAI,kBAAkB,CAAC;AACtC,cAAM,OAAO,IAAI,WAAW,QAAQ,GAAG,CAAC;AACxC,aAAK,CAAC,IAAI,kBAAkB;AAC5B,aAAK,QAAQ,IAAI,QAAQ,IAAI,MAAM;AACnC,gBAAQ,oBAAoB;AAAA,MAChC;AAAA,MACA,MAAM,iBAAiB,OAAO,IAAI;AAC9B,cAAM,SAAS,KAAK,QAAQ,IAAI,EAAE;AAClC,YAAI,WAAW,QAAW;AACtB;AAAA,QACJ;AACA,cAAM,OAAO,IAAI,WAAW,QAAQ,GAAG,CAAC;AACxC,gBAAQ,MAAM,MAAM,GAAG,kBAAkB,SAAS;AAAA,MACtD;AAAA,MACA,QAAQ,IAAI;AACR,aAAK,QAAQ,OAAO,EAAE;AAAA,MAC1B;AAAA,MACA,UAAU;AACN,aAAK,QAAQ,MAAM;AAAA,MACvB;AAAA,IACJ;AACA,IAAAD,SAAQ,4BAA4B;AACpC,QAAM,qCAAN,MAAyC;AAAA,MAErC,YAAY,QAAQ;AADpB;AAEI,aAAK,OAAO,IAAI,WAAW,QAAQ,GAAG,CAAC;AAAA,MAC3C;AAAA,MACA,IAAI,0BAA0B;AAC1B,eAAO,QAAQ,KAAK,KAAK,MAAM,CAAC,MAAM,kBAAkB;AAAA,MAC5D;AAAA,MACA,IAAI,0BAA0B;AAC1B,cAAM,IAAI,MAAM,yEAAyE;AAAA,MAC7F;AAAA,IACJ;AACA,QAAM,2CAAN,MAA+C;AAAA,MAE3C,YAAY,QAAQ;AADpB;AAEI,aAAK,QAAQ,IAAI,mCAAmC,MAAM;AAAA,MAC9D;AAAA,MACA,SAAS;AAAA,MACT;AAAA,MACA,UAAU;AAAA,MACV;AAAA,IACJ;AACA,QAAM,8BAAN,MAAkC;AAAA,MAAlC;AACI,oCAAO;AAAA;AAAA,MACP,8BAA8B,SAAS;AACnC,cAAM,SAAS,QAAQ;AACvB,YAAI,WAAW,QAAW;AACtB,iBAAO,IAAI,eAAe,wBAAwB;AAAA,QACtD;AACA,eAAO,IAAI,yCAAyC,MAAM;AAAA,MAC9D;AAAA,IACJ;AACA,IAAAA,SAAQ,8BAA8B;AAAA;AAAA;;;AC5EtC;AAAA,8DAAAE,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAI;AAAA,IAC5D;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,YAAY;AACpB,QAAM,QAAQ,gBAAgB,aAAgB;AAC9C,QAAM,YAAN,MAAgB;AAAA,MAIZ,YAAY,WAAW,GAAG;AAH1B;AACA;AACA;AAEI,YAAI,YAAY,GAAG;AACf,gBAAM,IAAI,MAAM,iCAAiC;AAAA,QACrD;AACA,aAAK,YAAY;AACjB,aAAK,UAAU;AACf,aAAK,WAAW,CAAC;AAAA,MACrB;AAAA,MACA,KAAK,OAAO;AACR,eAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,eAAK,SAAS,KAAK,EAAE,OAAO,SAAS,OAAO,CAAC;AAC7C,eAAK,QAAQ;AAAA,QACjB,CAAC;AAAA,MACL;AAAA,MACA,IAAI,SAAS;AACT,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,UAAU;AACN,YAAI,KAAK,SAAS,WAAW,KAAK,KAAK,YAAY,KAAK,WAAW;AAC/D;AAAA,QACJ;AACA,SAAC,GAAG,MAAM,SAAS,EAAE,MAAM,aAAa,MAAM,KAAK,UAAU,CAAC;AAAA,MAClE;AAAA,MACA,YAAY;AACR,YAAI,KAAK,SAAS,WAAW,KAAK,KAAK,YAAY,KAAK,WAAW;AAC/D;AAAA,QACJ;AACA,cAAM,OAAO,KAAK,SAAS,MAAM;AACjC,aAAK;AACL,YAAI,KAAK,UAAU,KAAK,WAAW;AAC/B,gBAAM,IAAI,MAAM,wBAAwB;AAAA,QAC5C;AACA,YAAI;AACA,gBAAM,SAAS,KAAK,MAAM;AAC1B,cAAI,kBAAkB,SAAS;AAC3B,mBAAO,KAAK,CAAC,UAAU;AACnB,mBAAK;AACL,mBAAK,QAAQ,KAAK;AAClB,mBAAK,QAAQ;AAAA,YACjB,GAAG,CAAC,QAAQ;AACR,mBAAK;AACL,mBAAK,OAAO,GAAG;AACf,mBAAK,QAAQ;AAAA,YACjB,CAAC;AAAA,UACL,OACK;AACD,iBAAK;AACL,iBAAK,QAAQ,MAAM;AACnB,iBAAK,QAAQ;AAAA,UACjB;AAAA,QACJ,SACO,KAAK;AACR,eAAK;AACL,eAAK,OAAO,GAAG;AACf,eAAK,QAAQ;AAAA,QACjB;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,YAAY;AAAA;AAAA;;;ACzEpB;AAAA,kEAAAC,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,QAAI,kBAAmBD,YAAQA,SAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAI;AAAA,IAC5D;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,8BAA8BA,SAAQ,wBAAwBA,SAAQ,gBAAgB;AAC9F,QAAM,QAAQ,gBAAgB,aAAgB;AAC9C,QAAME,MAAK,aAAa,YAAe;AACvC,QAAM,WAAW;AACjB,QAAM,cAAc;AACpB,QAAI;AACJ,KAAC,SAAUC,gBAAe;AACtB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAaD,IAAG,KAAK,UAAU,MAAM,KAAKA,IAAG,KAAK,UAAU,OAAO,KACtEA,IAAG,KAAK,UAAU,OAAO,KAAKA,IAAG,KAAK,UAAU,OAAO,KAAKA,IAAG,KAAK,UAAU,gBAAgB;AAAA,MACtG;AACA,MAAAC,eAAc,KAAK;AAAA,IACvB,GAAG,kBAAkBH,SAAQ,gBAAgB,gBAAgB,CAAC,EAAE;AAChE,QAAM,wBAAN,MAA4B;AAAA,MAIxB,cAAc;AAHd;AACA;AACA;AAEI,aAAK,eAAe,IAAI,SAAS,QAAQ;AACzC,aAAK,eAAe,IAAI,SAAS,QAAQ;AACzC,aAAK,wBAAwB,IAAI,SAAS,QAAQ;AAAA,MACtD;AAAA,MACA,UAAU;AACN,aAAK,aAAa,QAAQ;AAC1B,aAAK,aAAa,QAAQ;AAC1B,aAAK,sBAAsB,QAAQ;AAAA,MACvC;AAAA,MACA,IAAI,UAAU;AACV,eAAO,KAAK,aAAa;AAAA,MAC7B;AAAA,MACA,UAAU,OAAO;AACb,aAAK,aAAa,KAAK,KAAK,QAAQ,KAAK,CAAC;AAAA,MAC9C;AAAA,MACA,IAAI,UAAU;AACV,eAAO,KAAK,aAAa;AAAA,MAC7B;AAAA,MACA,YAAY;AACR,aAAK,aAAa,KAAK,MAAS;AAAA,MACpC;AAAA,MACA,IAAI,mBAAmB;AACnB,eAAO,KAAK,sBAAsB;AAAA,MACtC;AAAA,MACA,mBAAmB,MAAM;AACrB,aAAK,sBAAsB,KAAK,IAAI;AAAA,MACxC;AAAA,MACA,QAAQ,OAAO;AACX,YAAI,iBAAiB,OAAO;AACxB,iBAAO;AAAA,QACX,OACK;AACD,iBAAO,IAAI,MAAM,kCAAkCE,IAAG,OAAO,MAAM,OAAO,IAAI,MAAM,UAAU,SAAS,EAAE;AAAA,QAC7G;AAAA,MACJ;AAAA,IACJ;AACA,IAAAF,SAAQ,wBAAwB;AAChC,QAAI;AACJ,KAAC,SAAUI,+BAA8B;AACrC,eAAS,YAAY,SAAS;AApGlC;AAqGQ,YAAI;AACJ,YAAI;AACJ,YAAI;AACJ,cAAM,kBAAkB,oBAAI,IAAI;AAChC,YAAI;AACJ,cAAM,sBAAsB,oBAAI,IAAI;AACpC,YAAI,YAAY,UAAa,OAAO,YAAY,UAAU;AACtD,oBAAU,4BAAW;AAAA,QACzB,OACK;AACD,qBAAU,aAAQ,YAAR,YAAmB;AAC7B,cAAI,QAAQ,mBAAmB,QAAW;AACtC,6BAAiB,QAAQ;AACzB,4BAAgB,IAAI,eAAe,MAAM,cAAc;AAAA,UAC3D;AACA,cAAI,QAAQ,oBAAoB,QAAW;AACvC,uBAAW,WAAW,QAAQ,iBAAiB;AAC3C,8BAAgB,IAAI,QAAQ,MAAM,OAAO;AAAA,YAC7C;AAAA,UACJ;AACA,cAAI,QAAQ,uBAAuB,QAAW;AAC1C,iCAAqB,QAAQ;AAC7B,gCAAoB,IAAI,mBAAmB,MAAM,kBAAkB;AAAA,UACvE;AACA,cAAI,QAAQ,wBAAwB,QAAW;AAC3C,uBAAW,WAAW,QAAQ,qBAAqB;AAC/C,kCAAoB,IAAI,QAAQ,MAAM,OAAO;AAAA,YACjD;AAAA,UACJ;AAAA,QACJ;AACA,YAAI,uBAAuB,QAAW;AAClC,gCAAsB,GAAG,MAAM,SAAS,EAAE,gBAAgB;AAC1D,8BAAoB,IAAI,mBAAmB,MAAM,kBAAkB;AAAA,QACvE;AACA,eAAO,EAAE,SAAS,gBAAgB,iBAAiB,oBAAoB,oBAAoB;AAAA,MAC/F;AACA,MAAAA,8BAA6B,cAAc;AAAA,IAC/C,GAAG,iCAAiC,+BAA+B,CAAC,EAAE;AACtE,QAAM,8BAAN,cAA0C,sBAAsB;AAAA,MAU5D,YAAY,UAAU,SAAS;AAC3B,cAAM;AAVV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAGI,aAAK,WAAW;AAChB,aAAK,UAAU,6BAA6B,YAAY,OAAO;AAC/D,aAAK,UAAU,GAAG,MAAM,SAAS,EAAE,cAAc,OAAO,KAAK,QAAQ,OAAO;AAC5E,aAAK,yBAAyB;AAC9B,aAAK,oBAAoB;AACzB,aAAK,eAAe;AACpB,aAAK,gBAAgB,IAAI,YAAY,UAAU,CAAC;AAAA,MACpD;AAAA,MACA,IAAI,sBAAsB,SAAS;AAC/B,aAAK,yBAAyB;AAAA,MAClC;AAAA,MACA,IAAI,wBAAwB;AACxB,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,OAAO,UAAU;AACb,aAAK,oBAAoB;AACzB,aAAK,eAAe;AACpB,aAAK,sBAAsB;AAC3B,aAAK,WAAW;AAChB,cAAM,SAAS,KAAK,SAAS,OAAO,CAAC,SAAS;AAC1C,eAAK,OAAO,IAAI;AAAA,QACpB,CAAC;AACD,aAAK,SAAS,QAAQ,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC;AACtD,aAAK,SAAS,QAAQ,MAAM,KAAK,UAAU,CAAC;AAC5C,eAAO;AAAA,MACX;AAAA,MACA,OAAO,MAAM;AACT,YAAI;AACA,eAAK,OAAO,OAAO,IAAI;AACvB,iBAAO,MAAM;AACT,gBAAI,KAAK,sBAAsB,IAAI;AAC/B,oBAAM,UAAU,KAAK,OAAO,eAAe,IAAI;AAC/C,kBAAI,CAAC,SAAS;AACV;AAAA,cACJ;AACA,oBAAM,gBAAgB,QAAQ,IAAI,gBAAgB;AAClD,kBAAI,CAAC,eAAe;AAChB,qBAAK,UAAU,IAAI,MAAM;AAAA,EAAmD,KAAK,UAAU,OAAO,YAAY,OAAO,CAAC,CAAC,EAAE,CAAC;AAC1H;AAAA,cACJ;AACA,oBAAM,SAAS,SAAS,aAAa;AACrC,kBAAI,MAAM,MAAM,GAAG;AACf,qBAAK,UAAU,IAAI,MAAM,8CAA8C,aAAa,EAAE,CAAC;AACvF;AAAA,cACJ;AACA,mBAAK,oBAAoB;AAAA,YAC7B;AACA,kBAAM,OAAO,KAAK,OAAO,YAAY,KAAK,iBAAiB;AAC3D,gBAAI,SAAS,QAAW;AAEpB,mBAAK,uBAAuB;AAC5B;AAAA,YACJ;AACA,iBAAK,yBAAyB;AAC9B,iBAAK,oBAAoB;AAKzB,iBAAK,cAAc,KAAK,YAAY;AAChC,oBAAM,QAAQ,KAAK,QAAQ,mBAAmB,SACxC,MAAM,KAAK,QAAQ,eAAe,OAAO,IAAI,IAC7C;AACN,oBAAM,UAAU,MAAM,KAAK,QAAQ,mBAAmB,OAAO,OAAO,KAAK,OAAO;AAChF,mBAAK,SAAS,OAAO;AAAA,YACzB,CAAC,EAAE,MAAM,CAAC,UAAU;AAChB,mBAAK,UAAU,KAAK;AAAA,YACxB,CAAC;AAAA,UACL;AAAA,QACJ,SACO,OAAO;AACV,eAAK,UAAU,KAAK;AAAA,QACxB;AAAA,MACJ;AAAA,MACA,2BAA2B;AACvB,YAAI,KAAK,qBAAqB;AAC1B,eAAK,oBAAoB,QAAQ;AACjC,eAAK,sBAAsB;AAAA,QAC/B;AAAA,MACJ;AAAA,MACA,yBAAyB;AACrB,aAAK,yBAAyB;AAC9B,YAAI,KAAK,0BAA0B,GAAG;AAClC;AAAA,QACJ;AACA,aAAK,uBAAuB,GAAG,MAAM,SAAS,EAAE,MAAM,WAAW,CAAC,OAAO,YAAY;AACjF,eAAK,sBAAsB;AAC3B,cAAI,UAAU,KAAK,cAAc;AAC7B,iBAAK,mBAAmB,EAAE,cAAc,OAAO,aAAa,QAAQ,CAAC;AACrE,iBAAK,uBAAuB;AAAA,UAChC;AAAA,QACJ,GAAG,KAAK,wBAAwB,KAAK,cAAc,KAAK,sBAAsB;AAAA,MAClF;AAAA,IACJ;AACA,IAAAJ,SAAQ,8BAA8B;AAAA;AAAA;;;ACrPtC;AAAA,kEAAAK,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,QAAI,kBAAmBD,YAAQA,SAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAI;AAAA,IAC5D;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,+BAA+BA,SAAQ,wBAAwBA,SAAQ,gBAAgB;AAC/F,QAAM,QAAQ,gBAAgB,aAAgB;AAC9C,QAAME,MAAK,aAAa,YAAe;AACvC,QAAM,cAAc;AACpB,QAAM,WAAW;AACjB,QAAM,gBAAgB;AACtB,QAAM,OAAO;AACb,QAAI;AACJ,KAAC,SAAUC,gBAAe;AACtB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAaD,IAAG,KAAK,UAAU,OAAO,KAAKA,IAAG,KAAK,UAAU,OAAO,KACvEA,IAAG,KAAK,UAAU,OAAO,KAAKA,IAAG,KAAK,UAAU,KAAK;AAAA,MAC7D;AACA,MAAAC,eAAc,KAAK;AAAA,IACvB,GAAG,kBAAkBH,SAAQ,gBAAgB,gBAAgB,CAAC,EAAE;AAChE,QAAM,wBAAN,MAA4B;AAAA,MAGxB,cAAc;AAFd;AACA;AAEI,aAAK,eAAe,IAAI,SAAS,QAAQ;AACzC,aAAK,eAAe,IAAI,SAAS,QAAQ;AAAA,MAC7C;AAAA,MACA,UAAU;AACN,aAAK,aAAa,QAAQ;AAC1B,aAAK,aAAa,QAAQ;AAAA,MAC9B;AAAA,MACA,IAAI,UAAU;AACV,eAAO,KAAK,aAAa;AAAA,MAC7B;AAAA,MACA,UAAU,OAAO,SAAS,OAAO;AAC7B,aAAK,aAAa,KAAK,CAAC,KAAK,QAAQ,KAAK,GAAG,SAAS,KAAK,CAAC;AAAA,MAChE;AAAA,MACA,IAAI,UAAU;AACV,eAAO,KAAK,aAAa;AAAA,MAC7B;AAAA,MACA,YAAY;AACR,aAAK,aAAa,KAAK,MAAS;AAAA,MACpC;AAAA,MACA,QAAQ,OAAO;AACX,YAAI,iBAAiB,OAAO;AACxB,iBAAO;AAAA,QACX,OACK;AACD,iBAAO,IAAI,MAAM,kCAAkCE,IAAG,OAAO,MAAM,OAAO,IAAI,MAAM,UAAU,SAAS,EAAE;AAAA,QAC7G;AAAA,MACJ;AAAA,IACJ;AACA,IAAAF,SAAQ,wBAAwB;AAChC,QAAI;AACJ,KAAC,SAAUI,+BAA8B;AACrC,eAAS,YAAY,SAAS;AA7FlC;AA8FQ,YAAI,YAAY,UAAa,OAAO,YAAY,UAAU;AACtD,iBAAO,EAAE,SAAS,4BAAW,SAAS,qBAAqB,GAAG,MAAM,SAAS,EAAE,gBAAgB,QAAQ;AAAA,QAC3G,OACK;AACD,iBAAO,EAAE,UAAS,aAAQ,YAAR,YAAmB,SAAS,gBAAgB,QAAQ,gBAAgB,qBAAoB,aAAQ,uBAAR,aAA+B,GAAG,MAAM,SAAS,EAAE,gBAAgB,QAAQ;AAAA,QACzL;AAAA,MACJ;AACA,MAAAA,8BAA6B,cAAc;AAAA,IAC/C,GAAG,iCAAiC,+BAA+B,CAAC,EAAE;AACtE,QAAM,+BAAN,cAA2C,sBAAsB;AAAA,MAK7D,YAAY,UAAU,SAAS;AAC3B,cAAM;AALV;AACA;AACA;AACA;AAGI,aAAK,WAAW;AAChB,aAAK,UAAU,6BAA6B,YAAY,OAAO;AAC/D,aAAK,aAAa;AAClB,aAAK,iBAAiB,IAAI,YAAY,UAAU,CAAC;AACjD,aAAK,SAAS,QAAQ,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC;AACtD,aAAK,SAAS,QAAQ,MAAM,KAAK,UAAU,CAAC;AAAA,MAChD;AAAA,MACA,MAAM,MAAM,KAAK;AACb,eAAO,KAAK,eAAe,KAAK,YAAY;AACxC,gBAAM,UAAU,KAAK,QAAQ,mBAAmB,OAAO,KAAK,KAAK,OAAO,EAAE,KAAK,CAAC,WAAW;AACvF,gBAAI,KAAK,QAAQ,mBAAmB,QAAW;AAC3C,qBAAO,KAAK,QAAQ,eAAe,OAAO,MAAM;AAAA,YACpD,OACK;AACD,qBAAO;AAAA,YACX;AAAA,UACJ,CAAC;AACD,iBAAO,QAAQ,KAAK,CAAC,WAAW;AAC5B,kBAAM,UAAU,CAAC;AACjB,oBAAQ,KAAK,eAAe,OAAO,WAAW,SAAS,GAAG,IAAI;AAC9D,oBAAQ,KAAK,IAAI;AACjB,mBAAO,KAAK,QAAQ,KAAK,SAAS,MAAM;AAAA,UAC5C,GAAG,CAAC,UAAU;AACV,iBAAK,UAAU,KAAK;AACpB,kBAAM;AAAA,UACV,CAAC;AAAA,QACL,CAAC;AAAA,MACL;AAAA,MACA,MAAM,QAAQ,KAAK,SAAS,MAAM;AAC9B,YAAI;AACA,gBAAM,KAAK,SAAS,MAAM,QAAQ,KAAK,EAAE,GAAG,OAAO;AACnD,iBAAO,KAAK,SAAS,MAAM,IAAI;AAAA,QACnC,SACO,OAAO;AACV,eAAK,YAAY,OAAO,GAAG;AAC3B,iBAAO,QAAQ,OAAO,KAAK;AAAA,QAC/B;AAAA,MACJ;AAAA,MACA,YAAY,OAAO,KAAK;AACpB,aAAK;AACL,aAAK,UAAU,OAAO,KAAK,KAAK,UAAU;AAAA,MAC9C;AAAA,MACA,MAAM;AACF,aAAK,SAAS,IAAI;AAAA,MACtB;AAAA,IACJ;AACA,IAAAJ,SAAQ,+BAA+B;AAAA;AAAA;;;AC5JvC;AAAA,kEAAAK,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,wBAAwB;AAChC,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,OAAO;AACb,QAAM,wBAAN,MAA4B;AAAA,MAIxB,YAAY,WAAW,SAAS;AAHhC;AACA;AACA;AAEI,aAAK,YAAY;AACjB,aAAK,UAAU,CAAC;AAChB,aAAK,eAAe;AAAA,MACxB;AAAA,MACA,IAAI,WAAW;AACX,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,OAAO,OAAO;AACV,cAAM,WAAW,OAAO,UAAU,WAAW,KAAK,WAAW,OAAO,KAAK,SAAS,IAAI;AACtF,aAAK,QAAQ,KAAK,QAAQ;AAC1B,aAAK,gBAAgB,SAAS;AAAA,MAClC;AAAA,MACA,eAAe,gBAAgB,OAAO;AAClC,YAAI,KAAK,QAAQ,WAAW,GAAG;AAC3B,iBAAO;AAAA,QACX;AACA,YAAI,QAAQ;AACZ,YAAI,aAAa;AACjB,YAAI,SAAS;AACb,YAAI,iBAAiB;AACrB,YAAK,QAAO,aAAa,KAAK,QAAQ,QAAQ;AAC1C,gBAAM,QAAQ,KAAK,QAAQ,UAAU;AACrC,mBAAS;AACT,iBAAO,SAAS,MAAM,QAAQ;AAC1B,kBAAM,QAAQ,MAAM,MAAM;AAC1B,oBAAQ,OAAO;AAAA,cACX,KAAK;AACD,wBAAQ,OAAO;AAAA,kBACX,KAAK;AACD,4BAAQ;AACR;AAAA,kBACJ,KAAK;AACD,4BAAQ;AACR;AAAA,kBACJ;AACI,4BAAQ;AAAA,gBAChB;AACA;AAAA,cACJ,KAAK;AACD,wBAAQ,OAAO;AAAA,kBACX,KAAK;AACD,4BAAQ;AACR;AAAA,kBACJ,KAAK;AACD,4BAAQ;AACR;AACA,0BAAM;AAAA,kBACV;AACI,4BAAQ;AAAA,gBAChB;AACA;AAAA,cACJ;AACI,wBAAQ;AAAA,YAChB;AACA;AAAA,UACJ;AACA,4BAAkB,MAAM;AACxB;AAAA,QACJ;AACA,YAAI,UAAU,GAAG;AACb,iBAAO;AAAA,QACX;AAGA,cAAM,SAAS,KAAK,MAAM,iBAAiB,MAAM;AACjD,cAAM,SAAS,oBAAI,IAAI;AACvB,cAAM,UAAU,KAAK,SAAS,QAAQ,OAAO,EAAE,MAAM,IAAI;AACzD,YAAI,QAAQ,SAAS,GAAG;AACpB,iBAAO;AAAA,QACX;AACA,iBAAS,IAAI,GAAG,IAAI,QAAQ,SAAS,GAAG,KAAK;AACzC,gBAAM,SAAS,QAAQ,CAAC;AACxB,gBAAM,QAAQ,OAAO,QAAQ,GAAG;AAChC,cAAI,UAAU,IAAI;AACd,kBAAM,IAAI,MAAM;AAAA,EAAyD,MAAM,EAAE;AAAA,UACrF;AACA,gBAAM,MAAM,OAAO,OAAO,GAAG,KAAK;AAClC,gBAAM,QAAQ,OAAO,OAAO,QAAQ,CAAC,EAAE,KAAK;AAC5C,iBAAO,IAAI,gBAAgB,IAAI,YAAY,IAAI,KAAK,KAAK;AAAA,QAC7D;AACA,eAAO;AAAA,MACX;AAAA,MACA,YAAY,QAAQ;AAChB,YAAI,KAAK,eAAe,QAAQ;AAC5B,iBAAO;AAAA,QACX;AACA,eAAO,KAAK,MAAM,MAAM;AAAA,MAC5B;AAAA,MACA,IAAI,gBAAgB;AAChB,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,MAAM,WAAW;AACb,YAAI,cAAc,GAAG;AACjB,iBAAO,KAAK,YAAY;AAAA,QAC5B;AACA,YAAI,YAAY,KAAK,cAAc;AAC/B,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAChD;AACA,YAAI,KAAK,QAAQ,CAAC,EAAE,eAAe,WAAW;AAE1C,gBAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,eAAK,QAAQ,MAAM;AACnB,eAAK,gBAAgB;AACrB,iBAAO,KAAK,SAAS,KAAK;AAAA,QAC9B;AACA,YAAI,KAAK,QAAQ,CAAC,EAAE,aAAa,WAAW;AAExC,gBAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,gBAAMC,UAAS,KAAK,SAAS,OAAO,SAAS;AAC7C,eAAK,QAAQ,CAAC,IAAI,MAAM,MAAM,SAAS;AACvC,eAAK,gBAAgB;AACrB,iBAAOA;AAAA,QACX;AACA,cAAM,SAAS,KAAK,YAAY,SAAS;AACzC,YAAI,eAAe;AACnB,cAAM,aAAa;AACnB,eAAO,YAAY,GAAG;AAClB,gBAAM,QAAQ,KAAK,QAAQ,UAAU;AACrC,cAAI,MAAM,aAAa,WAAW;AAE9B,kBAAM,YAAY,MAAM,MAAM,GAAG,SAAS;AAC1C,mBAAO,IAAI,WAAW,YAAY;AAClC,4BAAgB;AAChB,iBAAK,QAAQ,UAAU,IAAI,MAAM,MAAM,SAAS;AAChD,iBAAK,gBAAgB;AACrB,yBAAa;AAAA,UACjB,OACK;AAED,mBAAO,IAAI,OAAO,YAAY;AAC9B,4BAAgB,MAAM;AACtB,iBAAK,QAAQ,MAAM;AACnB,iBAAK,gBAAgB,MAAM;AAC3B,yBAAa,MAAM;AAAA,UACvB;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA,IACJ;AACA,IAAAD,SAAQ,wBAAwB;AAAA;AAAA;;;AC1JhC;AAAA,+DAAAE,UAAA;AAAA;AAMA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,QAAI,kBAAmBD,YAAQA,SAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAI;AAAA,IAC5D;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,oBAAoBA,SAAQ,kBAAkBA,SAAQ,uBAAuBA,SAAQ,6BAA6BA,SAAQ,+BAA+BA,SAAQ,sCAAsCA,SAAQ,iCAAiCA,SAAQ,qBAAqBA,SAAQ,kBAAkBA,SAAQ,mBAAmBA,SAAQ,uBAAuBA,SAAQ,uBAAuBA,SAAQ,cAAcA,SAAQ,cAAcA,SAAQ,aAAaA,SAAQ,QAAQA,SAAQ,aAAaA,SAAQ,eAAeA,SAAQ,gBAAgB;AAC7hB,IAAAA,SAAQ,0BAA0B;AAClC,QAAM,QAAQ,gBAAgB,aAAgB;AAC9C,QAAME,MAAK,aAAa,YAAe;AACvC,QAAM,aAAa;AACnB,QAAM,cAAc;AACpB,QAAM,WAAW;AACjB,QAAM,iBAAiB;AACvB,QAAI;AACJ,KAAC,SAAUC,qBAAoB;AAC3B,MAAAA,oBAAmB,OAAO,IAAI,WAAW,iBAAiB,iBAAiB;AAAA,IAC/E,GAAG,uBAAuB,qBAAqB,CAAC,EAAE;AAClD,QAAI;AACJ,KAAC,SAAUC,gBAAe;AACtB,eAAS,GAAG,OAAO;AACf,eAAO,OAAO,UAAU,YAAY,OAAO,UAAU;AAAA,MACzD;AACA,MAAAA,eAAc,KAAK;AAAA,IACvB,GAAG,kBAAkBJ,SAAQ,gBAAgB,gBAAgB,CAAC,EAAE;AAChE,QAAI;AACJ,KAAC,SAAUK,uBAAsB;AAC7B,MAAAA,sBAAqB,OAAO,IAAI,WAAW,iBAAiB,YAAY;AAAA,IAC5E,GAAG,yBAAyB,uBAAuB,CAAC,EAAE;AACtD,QAAM,eAAN,MAAmB;AAAA,MAOf,cAAc;AAFd;AAAA;AAAA;AAAA;AAAA;AACA;AAAA,MAEA;AAAA,IACJ;AACA,IAAAL,SAAQ,eAAe;AACvB,QAAI;AACJ,KAAC,SAAUM,qBAAoB;AAC3B,eAAS,GAAG,OAAO;AACf,eAAOJ,IAAG,KAAK,KAAK;AAAA,MACxB;AACA,MAAAI,oBAAmB,KAAK;AAAA,IAC5B,GAAG,uBAAuB,qBAAqB,CAAC,EAAE;AAClD,IAAAN,SAAQ,aAAa,OAAO,OAAO;AAAA,MAC/B,OAAO,MAAM;AAAA,MAAE;AAAA,MACf,MAAM,MAAM;AAAA,MAAE;AAAA,MACd,MAAM,MAAM;AAAA,MAAE;AAAA,MACd,KAAK,MAAM;AAAA,MAAE;AAAA,IACjB,CAAC;AACD,QAAI;AACJ,KAAC,SAAUO,QAAO;AACd,MAAAA,OAAMA,OAAM,KAAK,IAAI,CAAC,IAAI;AAC1B,MAAAA,OAAMA,OAAM,UAAU,IAAI,CAAC,IAAI;AAC/B,MAAAA,OAAMA,OAAM,SAAS,IAAI,CAAC,IAAI;AAC9B,MAAAA,OAAMA,OAAM,SAAS,IAAI,CAAC,IAAI;AAAA,IAClC,GAAG,UAAUP,SAAQ,QAAQ,QAAQ,CAAC,EAAE;AACxC,QAAI;AACJ,KAAC,SAAUQ,aAAY;AAInB,MAAAA,YAAW,MAAM;AAIjB,MAAAA,YAAW,WAAW;AAItB,MAAAA,YAAW,UAAU;AAIrB,MAAAA,YAAW,UAAU;AAAA,IACzB,GAAG,eAAeR,SAAQ,aAAa,aAAa,CAAC,EAAE;AAIvD,IAAAA,SAAQ,cAAc;AACtB,KAAC,SAAUO,QAAO;AACd,eAAS,WAAW,OAAO;AACvB,YAAI,CAACL,IAAG,OAAO,KAAK,GAAG;AACnB,iBAAOK,OAAM;AAAA,QACjB;AACA,gBAAQ,MAAM,YAAY;AAC1B,gBAAQ,OAAO;AAAA,UACX,KAAK;AACD,mBAAOA,OAAM;AAAA,UACjB,KAAK;AACD,mBAAOA,OAAM;AAAA,UACjB,KAAK;AACD,mBAAOA,OAAM;AAAA,UACjB,KAAK;AACD,mBAAOA,OAAM;AAAA,UACjB;AACI,mBAAOA,OAAM;AAAA,QACrB;AAAA,MACJ;AACA,MAAAA,OAAM,aAAa;AACnB,eAASE,UAAS,OAAO;AACrB,gBAAQ,OAAO;AAAA,UACX,KAAKF,OAAM;AACP,mBAAO;AAAA,UACX,KAAKA,OAAM;AACP,mBAAO;AAAA,UACX,KAAKA,OAAM;AACP,mBAAO;AAAA,UACX,KAAKA,OAAM;AACP,mBAAO;AAAA,UACX;AACI,mBAAO;AAAA,QACf;AAAA,MACJ;AACA,MAAAA,OAAM,WAAWE;AAAA,IACrB,GAAG,UAAUT,SAAQ,QAAQ,QAAQ,CAAC,EAAE;AACxC,QAAI;AACJ,KAAC,SAAUU,cAAa;AACpB,MAAAA,aAAY,MAAM,IAAI;AACtB,MAAAA,aAAY,MAAM,IAAI;AAAA,IAC1B,GAAG,gBAAgBV,SAAQ,cAAc,cAAc,CAAC,EAAE;AAC1D,KAAC,SAAUU,cAAa;AACpB,eAAS,WAAW,OAAO;AACvB,YAAI,CAACR,IAAG,OAAO,KAAK,GAAG;AACnB,iBAAOQ,aAAY;AAAA,QACvB;AACA,gBAAQ,MAAM,YAAY;AAC1B,YAAI,UAAU,QAAQ;AAClB,iBAAOA,aAAY;AAAA,QACvB,OACK;AACD,iBAAOA,aAAY;AAAA,QACvB;AAAA,MACJ;AACA,MAAAA,aAAY,aAAa;AAAA,IAC7B,GAAG,gBAAgBV,SAAQ,cAAc,cAAc,CAAC,EAAE;AAC1D,QAAI;AACJ,KAAC,SAAUW,uBAAsB;AAC7B,MAAAA,sBAAqB,OAAO,IAAI,WAAW,iBAAiB,YAAY;AAAA,IAC5E,GAAG,yBAAyBX,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AACrF,QAAI;AACJ,KAAC,SAAUY,uBAAsB;AAC7B,MAAAA,sBAAqB,OAAO,IAAI,WAAW,iBAAiB,YAAY;AAAA,IAC5E,GAAG,yBAAyBZ,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AACrF,QAAI;AACJ,KAAC,SAAUa,mBAAkB;AAIzB,MAAAA,kBAAiBA,kBAAiB,QAAQ,IAAI,CAAC,IAAI;AAInD,MAAAA,kBAAiBA,kBAAiB,UAAU,IAAI,CAAC,IAAI;AAIrD,MAAAA,kBAAiBA,kBAAiB,kBAAkB,IAAI,CAAC,IAAI;AAAA,IACjE,GAAG,qBAAqBb,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AACzE,QAAM,kBAAN,MAAM,yBAAwB,MAAM;AAAA,MAEhC,YAAY,MAAM,SAAS;AACvB,cAAM,OAAO;AAFjB;AAGI,aAAK,OAAO;AACZ,eAAO,eAAe,MAAM,iBAAgB,SAAS;AAAA,MACzD;AAAA,IACJ;AACA,IAAAA,SAAQ,kBAAkB;AAC1B,QAAI;AACJ,KAAC,SAAUc,qBAAoB;AAC3B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAaZ,IAAG,KAAK,UAAU,kBAAkB;AAAA,MAC5D;AACA,MAAAY,oBAAmB,KAAK;AAAA,IAC5B,GAAG,uBAAuBd,SAAQ,qBAAqB,qBAAqB,CAAC,EAAE;AAC/E,QAAI;AACJ,KAAC,SAAUe,iCAAgC;AACvC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cAAc,UAAU,SAAS,UAAa,UAAU,SAAS,SAASb,IAAG,KAAK,UAAU,6BAA6B,MAAM,UAAU,YAAY,UAAaA,IAAG,KAAK,UAAU,OAAO;AAAA,MACtM;AACA,MAAAa,gCAA+B,KAAK;AAAA,IACxC,GAAG,mCAAmCf,SAAQ,iCAAiC,iCAAiC,CAAC,EAAE;AACnH,QAAI;AACJ,KAAC,SAAUgB,sCAAqC;AAC5C,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAa,UAAU,SAAS,aAAad,IAAG,KAAK,UAAU,6BAA6B,MAAM,UAAU,YAAY,UAAaA,IAAG,KAAK,UAAU,OAAO;AAAA,MACzK;AACA,MAAAc,qCAAoC,KAAK;AAAA,IAC7C,GAAG,wCAAwChB,SAAQ,sCAAsC,sCAAsC,CAAC,EAAE;AAClI,QAAI;AACJ,KAAC,SAAUiB,+BAA8B;AACrC,MAAAA,8BAA6B,UAAU,OAAO,OAAO;AAAA,QACjD,8BAA8BC,IAAG;AAC7B,iBAAO,IAAI,eAAe,wBAAwB;AAAA,QACtD;AAAA,MACJ,CAAC;AACD,eAAS,GAAG,OAAO;AACf,eAAO,+BAA+B,GAAG,KAAK,KAAK,oCAAoC,GAAG,KAAK;AAAA,MACnG;AACA,MAAAD,8BAA6B,KAAK;AAAA,IACtC,GAAG,iCAAiCjB,SAAQ,+BAA+B,+BAA+B,CAAC,EAAE;AAC7G,QAAI;AACJ,KAAC,SAAUmB,6BAA4B;AACnC,MAAAA,4BAA2B,UAAU,OAAO,OAAO;AAAA,QAC/C,iBAAiB,MAAM,IAAI;AACvB,iBAAO,KAAK,iBAAiB,mBAAmB,MAAM,EAAE,GAAG,CAAC;AAAA,QAChE;AAAA,QACA,QAAQD,IAAG;AAAA,QAAE;AAAA,MACjB,CAAC;AACD,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAahB,IAAG,KAAK,UAAU,gBAAgB,KAAKA,IAAG,KAAK,UAAU,OAAO;AAAA,MACxF;AACA,MAAAiB,4BAA2B,KAAK;AAAA,IACpC,GAAG,+BAA+BnB,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AACvG,QAAI;AACJ,KAAC,SAAUoB,uBAAsB;AAC7B,MAAAA,sBAAqB,UAAU,OAAO,OAAO;AAAA,QACzC,UAAU,6BAA6B;AAAA,QACvC,QAAQ,2BAA2B;AAAA,MACvC,CAAC;AACD,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAa,6BAA6B,GAAG,UAAU,QAAQ,KAAK,2BAA2B,GAAG,UAAU,MAAM;AAAA,MAC7H;AACA,MAAAA,sBAAqB,KAAK;AAAA,IAC9B,GAAG,yBAAyBpB,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AACrF,QAAI;AACJ,KAAC,SAAUqB,kBAAiB;AACxB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAanB,IAAG,KAAK,UAAU,aAAa;AAAA,MACvD;AACA,MAAAmB,iBAAgB,KAAK;AAAA,IACzB,GAAG,oBAAoBrB,SAAQ,kBAAkB,kBAAkB,CAAC,EAAE;AACtE,QAAI;AACJ,KAAC,SAAUsB,oBAAmB;AAC1B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cACC,qBAAqB,GAAG,UAAU,oBAAoB,KAAK,mBAAmB,GAAG,UAAU,kBAAkB,KAAK,gBAAgB,GAAG,UAAU,eAAe,KAAKpB,IAAG,OAAO,UAAU,cAAc;AAAA,MACjN;AACA,MAAAoB,mBAAkB,KAAK;AAAA,IAC3B,GAAG,sBAAsBtB,SAAQ,oBAAoB,oBAAoB,CAAC,EAAE;AAC5E,QAAI;AACJ,KAAC,SAAUuB,kBAAiB;AACxB,MAAAA,iBAAgBA,iBAAgB,KAAK,IAAI,CAAC,IAAI;AAC9C,MAAAA,iBAAgBA,iBAAgB,WAAW,IAAI,CAAC,IAAI;AACpD,MAAAA,iBAAgBA,iBAAgB,QAAQ,IAAI,CAAC,IAAI;AACjD,MAAAA,iBAAgBA,iBAAgB,UAAU,IAAI,CAAC,IAAI;AAAA,IACvD,GAAG,oBAAoB,kBAAkB,CAAC,EAAE;AAC5C,aAAS,wBAAwB,eAAe,eAAe,SAAS,SAAS;AAtSjF;AAuSI,YAAM,SAAS,YAAY,SAAY,UAAUvB,SAAQ;AACzD,UAAI,iBAAiB;AACrB,UAAI,6BAA6B;AACjC,UAAI,gCAAgC;AACpC,YAAM,UAAU;AAChB,YAAM,kBAAiB,wCAAS,mBAAT,YAA2B;AAClD,UAAI,WAAW;AACf,UAAI,qBAAqB;AACzB,YAAM,kBAAkB,oBAAI,IAAI;AAChC,UAAI,0BAA0B;AAC9B,YAAM,uBAAuB,oBAAI,IAAI;AACrC,YAAM,mBAAmB,oBAAI,IAAI;AACjC,UAAIwB;AACJ,UAAI,eAAe,IAAI,YAAY,UAAU;AAC7C,UAAI,mBAAmB,oBAAI,IAAI;AAC/B,UAAI,wBAAwB,oBAAI,IAAI;AACpC,UAAI,gBAAgB,oBAAI,IAAI;AAC5B,UAAI,QAAQ,MAAM;AAClB,UAAI,cAAc,YAAY;AAC9B,UAAI;AACJ,UAAI,QAAQ,gBAAgB;AAC5B,YAAM,eAAe,IAAI,SAAS,QAAQ;AAC1C,YAAM,eAAe,IAAI,SAAS,QAAQ;AAC1C,YAAM,+BAA+B,IAAI,SAAS,QAAQ;AAC1D,YAAM,2BAA2B,IAAI,SAAS,QAAQ;AACtD,YAAM,iBAAiB,IAAI,SAAS,QAAQ;AAC5C,YAAM,uBAAwB,WAAW,QAAQ,uBAAwB,QAAQ,uBAAuB,qBAAqB;AAC7H,eAAS,mBAAmB,UAAU;AAClC,eAAO;AAAA,MACX;AACA,eAAS,cAAc;AACnB,eAAO,UAAU,gBAAgB;AAAA,MACrC;AACA,eAAS,WAAW;AAChB,eAAO,UAAU,gBAAgB;AAAA,MACrC;AACA,eAAS,aAAa;AAClB,eAAO,UAAU,gBAAgB;AAAA,MACrC;AACA,eAAS,eAAe;AACpB,YAAI,UAAU,gBAAgB,OAAO,UAAU,gBAAgB,WAAW;AACtE,kBAAQ,gBAAgB;AACxB,uBAAa,KAAK,MAAS;AAAA,QAC/B;AAAA,MAEJ;AACA,eAAS,iBAAiB,OAAO;AAC7B,qBAAa,KAAK,CAAC,OAAO,QAAW,MAAS,CAAC;AAAA,MACnD;AACA,eAAS,kBAAkB,MAAM;AAC7B,qBAAa,KAAK,IAAI;AAAA,MAC1B;AACA,oBAAc,QAAQ,YAAY;AAClC,oBAAc,QAAQ,gBAAgB;AACtC,oBAAc,QAAQ,YAAY;AAClC,oBAAc,QAAQ,iBAAiB;AACvC,eAAS,sBAAsB,IAAI;AAC/B,YAAI,OAAO,MAAM;AACb,gBAAM,IAAI,MAAM,0EAA0E;AAAA,QAC9F;AACA,eAAO,SAAS,GAAG,SAAS;AAAA,MAChC;AACA,eAAS,uBAAuB,IAAI;AAChC,YAAI,OAAO,MAAM;AACb,iBAAO,kBAAkB,EAAE,+BAA+B,SAAS;AAAA,QACvE,OACK;AACD,iBAAO,SAAS,GAAG,SAAS;AAAA,QAChC;AAAA,MACJ;AACA,eAAS,6BAA6B;AAClC,eAAO,UAAU,EAAE,4BAA4B,SAAS;AAAA,MAC5D;AACA,eAAS,kBAAkB,OAAO,SAAS;AACvC,YAAI,WAAW,QAAQ,UAAU,OAAO,GAAG;AACvC,gBAAM,IAAI,sBAAsB,QAAQ,EAAE,GAAG,OAAO;AAAA,QACxD,WACS,WAAW,QAAQ,WAAW,OAAO,GAAG;AAG7C,cAAI,mBAAmB,IAAI;AACvB,kBAAM,IAAI,uBAAuB,QAAQ,EAAE,GAAG,OAAO;AAAA,UACzD,OACK;AAGD,2BAAe,OAAO;AAAA,UAC1B;AAAA,QACJ,OACK;AACD,gBAAM,IAAI,2BAA2B,GAAG,OAAO;AAAA,QACnD;AAAA,MACJ;AACA,eAAS,sBAAsB;AAC3B,YAAIA,UAAS,aAAa,SAAS,GAAG;AAClC;AAAA,QACJ;AACA,YAAI,mBAAmB,MAAM,YAAY,gBAAgB;AACrD;AAAA,QACJ;AACA,QAAAA,UAAS,GAAG,MAAM,SAAS,EAAE,MAAM,aAAa,YAAY;AACxD,UAAAA,SAAQ;AACR,cAAI,aAAa,SAAS,GAAG;AACzB;AAAA,UACJ;AACA,cAAI,mBAAmB,MAAM,YAAY,gBAAgB;AACrD;AAAA,UACJ;AACA,gBAAM,UAAU,aAAa,MAAM;AACnC,cAAI;AACJ,cAAI;AACA;AACA,kBAAM,kBAAkB,mCAAS;AACjC,gBAAI,gBAAgB,GAAG,eAAe,GAAG;AACrC,uBAAS,gBAAgB,cAAc,SAAS,aAAa;AAAA,YACjE,OACK;AACD,uBAAS,cAAc,OAAO;AAAA,YAClC;AAAA,UACJ,SACO,OAAO;AACV,mBAAO,MAAM,oCAAoC,MAAM,SAAS,CAAC,EAAE;AAAA,UACvE,UACA;AACI,gBAAI,kBAAkB,SAAS;AAC3B,qBAAO,KAAK,MAAM;AACd;AACA,oCAAoB;AAAA,cACxB,CAAC,EAAE,MAAM,CAAC,UAAU;AAChB,uBAAO,MAAM,oCAAoC,MAAM,SAAS,CAAC,EAAE;AAAA,cACvE,CAAC;AAAA,YACL,OACK;AACD;AAAA,YACJ;AACA,gCAAoB;AAAA,UACxB;AAAA,QACJ,CAAC;AAAA,MACL;AACA,qBAAe,cAAc,SAAS;AAClC,YAAI,WAAW,QAAQ,UAAU,OAAO,GAAG;AACvC,iBAAO,cAAc,OAAO;AAAA,QAChC,WACS,WAAW,QAAQ,eAAe,OAAO,GAAG;AACjD,iBAAO,mBAAmB,OAAO;AAAA,QACrC,WACS,WAAW,QAAQ,WAAW,OAAO,GAAG;AAC7C,iBAAO,eAAe,OAAO;AAAA,QACjC,OACK;AACD,iBAAO,qBAAqB,OAAO;AAAA,QACvC;AAAA,MACJ;AACA,YAAM,WAAW,CAAC,YAAY;AAC1B,YAAI;AAGA,cAAI,WAAW,QAAQ,eAAe,OAAO,KAAK,QAAQ,WAAW,mBAAmB,KAAK,QAAQ;AACjG,kBAAM,WAAW,QAAQ,OAAO;AAChC,kBAAM,MAAM,sBAAsB,QAAQ;AAC1C,kBAAM,WAAW,aAAa,IAAI,GAAG;AACrC,gBAAI,WAAW,QAAQ,UAAU,QAAQ,GAAG;AACxC,oBAAM,WAAW,mCAAS;AAC1B,oBAAM,WAAY,YAAY,SAAS,qBAAsB,SAAS,mBAAmB,UAAU,kBAAkB,IAAI,mBAAmB,QAAQ;AACpJ,kBAAI,aAAa,SAAS,UAAU,UAAa,SAAS,WAAW,SAAY;AAC7E,6BAAa,OAAO,GAAG;AACvB,8BAAc,OAAO,QAAQ;AAC7B,yBAAS,KAAK,SAAS;AACvB,qCAAqB,UAAU,QAAQ,QAAQ,KAAK,IAAI,CAAC;AACzD,8BAAc,MAAM,QAAQ,EAAE,MAAM,MAAM,OAAO,MAAM,+CAA+C,CAAC;AACvG;AAAA,cACJ;AAAA,YACJ;AACA,kBAAM,oBAAoB,cAAc,IAAI,QAAQ;AAEpD,gBAAI,sBAAsB,QAAW;AACjC,gCAAkB,OAAO;AACzB,wCAA0B,OAAO;AACjC;AAAA,YACJ,OACK;AAGD,oCAAsB,IAAI,QAAQ;AAAA,YACtC;AAAA,UACJ;AACA,4BAAkB,cAAc,OAAO;AAAA,QAC3C,UACA;AACI,8BAAoB;AAAA,QACxB;AAAA,MACJ;AACA,qBAAe,cAAc,gBAAgB;AAvejD,YAAAC;AAweQ,YAAI,WAAW,GAAG;AAGd,iBAAO,QAAQ,QAAQ;AAAA,QAC3B;AACA,iBAAS,MAAM,eAAe,QAAQC,YAAW;AAC7C,gBAAM,UAAU;AAAA,YACZ,SAAS;AAAA,YACT,IAAI,eAAe;AAAA,UACvB;AACA,cAAI,yBAAyB,WAAW,eAAe;AACnD,oBAAQ,QAAQ,cAAc,OAAO;AAAA,UACzC,OACK;AACD,oBAAQ,SAAS,kBAAkB,SAAY,OAAO;AAAA,UAC1D;AACA,+BAAqB,SAAS,QAAQA,UAAS;AAC/C,iBAAO,cAAc,MAAM,OAAO;AAAA,QACtC;AACA,iBAAS,WAAW,OAAO,QAAQA,YAAW;AAC1C,gBAAM,UAAU;AAAA,YACZ,SAAS;AAAA,YACT,IAAI,eAAe;AAAA,YACnB,OAAO,MAAM,OAAO;AAAA,UACxB;AACA,+BAAqB,SAAS,QAAQA,UAAS;AAC/C,iBAAO,cAAc,MAAM,OAAO;AAAA,QACtC;AACA,6BAAqB,cAAc;AACnC,cAAM,UAAU,gBAAgB,IAAI,eAAe,MAAM;AACzD,YAAI;AACJ,YAAI;AACJ,YAAI,SAAS;AACT,iBAAO,QAAQ;AACf,2BAAiB,QAAQ;AAAA,QAC7B;AACA,cAAM,YAAY,KAAK,IAAI;AAC3B,YAAI,kBAAkB,oBAAoB;AACtC,gBAAM,YAAWD,MAAA,eAAe,OAAf,OAAAA,MAAqB,OAAO,KAAK,IAAI,CAAC;AACvD,gBAAM,qBAAqB,+BAA+B,GAAG,qBAAqB,QAAQ,IACpF,qBAAqB,SAAS,8BAA8B,QAAQ,IACpE,qBAAqB,SAAS,8BAA8B,cAAc;AAChF,cAAI,eAAe,OAAO,QAAQ,sBAAsB,IAAI,eAAe,EAAE,GAAG;AAC5E,+BAAmB,OAAO;AAAA,UAC9B;AACA,cAAI,eAAe,OAAO,MAAM;AAC5B,0BAAc,IAAI,UAAU,kBAAkB;AAAA,UAClD;AACA,cAAI;AACA,gBAAI;AACJ,gBAAI,gBAAgB;AAChB,kBAAI,eAAe,WAAW,QAAW;AACrC,oBAAI,SAAS,UAAa,KAAK,mBAAmB,GAAG;AACjD,yBAAO,WAAW,IAAI,WAAW,cAAc,WAAW,WAAW,eAAe,WAAW,eAAe,MAAM,YAAY,KAAK,cAAc,4BAA4B,GAAG,eAAe,QAAQ,SAAS;AAAA,gBACtN;AACA,gCAAgB,eAAe,mBAAmB,KAAK;AAAA,cAC3D,WACS,MAAM,QAAQ,eAAe,MAAM,GAAG;AAC3C,oBAAI,SAAS,UAAa,KAAK,wBAAwB,WAAW,oBAAoB,QAAQ;AAC1F,yBAAO,WAAW,IAAI,WAAW,cAAc,WAAW,WAAW,eAAe,WAAW,eAAe,MAAM,iEAAiE,GAAG,eAAe,QAAQ,SAAS;AAAA,gBAC5N;AACA,gCAAgB,eAAe,GAAG,eAAe,QAAQ,mBAAmB,KAAK;AAAA,cACrF,OACK;AACD,oBAAI,SAAS,UAAa,KAAK,wBAAwB,WAAW,oBAAoB,YAAY;AAC9F,yBAAO,WAAW,IAAI,WAAW,cAAc,WAAW,WAAW,eAAe,WAAW,eAAe,MAAM,iEAAiE,GAAG,eAAe,QAAQ,SAAS;AAAA,gBAC5N;AACA,gCAAgB,eAAe,eAAe,QAAQ,mBAAmB,KAAK;AAAA,cAClF;AAAA,YACJ,WACS,oBAAoB;AACzB,8BAAgB,mBAAmB,eAAe,QAAQ,eAAe,QAAQ,mBAAmB,KAAK;AAAA,YAC7G;AACA,kBAAM,gBAAgB,MAAM;AAC5B,kBAAM,MAAM,eAAe,eAAe,QAAQ,SAAS;AAAA,UAC/D,SACO,OAAO;AACV,gBAAI,iBAAiB,WAAW,eAAe;AAC3C,oBAAM,MAAM,OAAO,eAAe,QAAQ,SAAS;AAAA,YACvD,WACS,SAASvB,IAAG,OAAO,MAAM,OAAO,GAAG;AACxC,oBAAM,WAAW,IAAI,WAAW,cAAc,WAAW,WAAW,eAAe,WAAW,eAAe,MAAM,yBAAyB,MAAM,OAAO,EAAE,GAAG,eAAe,QAAQ,SAAS;AAAA,YAClM,OACK;AACD,oBAAM,WAAW,IAAI,WAAW,cAAc,WAAW,WAAW,eAAe,WAAW,eAAe,MAAM,qDAAqD,GAAG,eAAe,QAAQ,SAAS;AAAA,YAC/M;AAAA,UACJ,UACA;AACI,0BAAc,OAAO,QAAQ;AAAA,UACjC;AAAA,QACJ,OACK;AACD,gBAAM,WAAW,IAAI,WAAW,cAAc,WAAW,WAAW,gBAAgB,oBAAoB,eAAe,MAAM,EAAE,GAAG,eAAe,QAAQ,SAAS;AAAA,QACtK;AAAA,MACJ;AACA,eAAS,eAAe,iBAAiB;AACrC,YAAI,WAAW,GAAG;AAEd;AAAA,QACJ;AACA,YAAI,gBAAgB,OAAO,MAAM;AAC7B,cAAI,gBAAgB,OAAO;AACvB,mBAAO,MAAM;AAAA,EAAqD,KAAK,UAAU,gBAAgB,OAAO,QAAW,CAAC,CAAC,EAAE;AAAA,UAC3H,OACK;AACD,mBAAO,MAAM,8EAA8E;AAAA,UAC/F;AAAA,QACJ,OACK;AACD,gBAAM,MAAM,gBAAgB;AAC5B,gBAAM,kBAAkB,iBAAiB,IAAI,GAAG;AAChD,gCAAsB,iBAAiB,eAAe;AACtD,cAAI,oBAAoB,QAAW;AAC/B,6BAAiB,OAAO,GAAG;AAC3B,gBAAI;AACA,kBAAI,gBAAgB,OAAO;AACvB,sBAAM,QAAQ,gBAAgB;AAC9B,gCAAgB,OAAO,IAAI,WAAW,cAAc,MAAM,MAAM,MAAM,SAAS,MAAM,IAAI,CAAC;AAAA,cAC9F,WACS,gBAAgB,WAAW,QAAW;AAC3C,gCAAgB,QAAQ,gBAAgB,MAAM;AAAA,cAClD,OACK;AACD,sBAAM,IAAI,MAAM,sBAAsB;AAAA,cAC1C;AAAA,YACJ,SACO,OAAO;AACV,kBAAI,MAAM,SAAS;AACf,uBAAO,MAAM,qBAAqB,gBAAgB,MAAM,0BAA0B,MAAM,OAAO,EAAE;AAAA,cACrG,OACK;AACD,uBAAO,MAAM,qBAAqB,gBAAgB,MAAM,wBAAwB;AAAA,cACpF;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AACA,qBAAe,mBAAmB,SAAS;AACvC,YAAI,WAAW,GAAG;AAEd;AAAA,QACJ;AACA,YAAI,OAAO;AACX,YAAI;AACJ,YAAI,QAAQ,WAAW,mBAAmB,KAAK,QAAQ;AACnD,gBAAM,WAAW,QAAQ,OAAO;AAChC,gCAAsB,OAAO,QAAQ;AACrC,oCAA0B,OAAO;AACjC;AAAA,QACJ,OACK;AACD,gBAAM,UAAU,qBAAqB,IAAI,QAAQ,MAAM;AACvD,cAAI,SAAS;AACT,kCAAsB,QAAQ;AAC9B,mBAAO,QAAQ;AAAA,UACnB;AAAA,QACJ;AACA,YAAI,uBAAuB,yBAAyB;AAChD,cAAI;AACA,sCAA0B,OAAO;AACjC,gBAAI,qBAAqB;AACrB,kBAAI,QAAQ,WAAW,QAAW;AAC9B,oBAAI,SAAS,QAAW;AACpB,sBAAI,KAAK,mBAAmB,KAAK,KAAK,wBAAwB,WAAW,oBAAoB,QAAQ;AACjG,2BAAO,MAAM,gBAAgB,QAAQ,MAAM,YAAY,KAAK,cAAc,4BAA4B;AAAA,kBAC1G;AAAA,gBACJ;AACA,sBAAM,oBAAoB;AAAA,cAC9B,WACS,MAAM,QAAQ,QAAQ,MAAM,GAAG;AAGpC,sBAAM,SAAS,QAAQ;AACvB,oBAAI,QAAQ,WAAW,qBAAqB,KAAK,UAAU,OAAO,WAAW,KAAK,cAAc,GAAG,OAAO,CAAC,CAAC,GAAG;AAC3G,wBAAM,oBAAoB,EAAE,OAAO,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE,CAAC;AAAA,gBACpE,OACK;AACD,sBAAI,SAAS,QAAW;AACpB,wBAAI,KAAK,wBAAwB,WAAW,oBAAoB,QAAQ;AACpE,6BAAO,MAAM,gBAAgB,QAAQ,MAAM,iEAAiE;AAAA,oBAChH;AACA,wBAAI,KAAK,mBAAmB,QAAQ,OAAO,QAAQ;AAC/C,6BAAO,MAAM,gBAAgB,QAAQ,MAAM,YAAY,KAAK,cAAc,wBAAwB,OAAO,MAAM,YAAY;AAAA,oBAC/H;AAAA,kBACJ;AACA,wBAAM,oBAAoB,GAAG,MAAM;AAAA,gBACvC;AAAA,cACJ,OACK;AACD,oBAAI,SAAS,UAAa,KAAK,wBAAwB,WAAW,oBAAoB,YAAY;AAC9F,yBAAO,MAAM,gBAAgB,QAAQ,MAAM,iEAAiE;AAAA,gBAChH;AACA,sBAAM,oBAAoB,QAAQ,MAAM;AAAA,cAC5C;AAAA,YACJ,WACS,yBAAyB;AAC9B,oBAAM,wBAAwB,QAAQ,QAAQ,QAAQ,MAAM;AAAA,YAChE;AAAA,UACJ,SACO,OAAO;AACV,gBAAI,MAAM,SAAS;AACf,qBAAO,MAAM,yBAAyB,QAAQ,MAAM,0BAA0B,MAAM,OAAO,EAAE;AAAA,YACjG,OACK;AACD,qBAAO,MAAM,yBAAyB,QAAQ,MAAM,wBAAwB;AAAA,YAChF;AAAA,UACJ;AAAA,QACJ,OACK;AACD,uCAA6B,KAAK,OAAO;AAAA,QAC7C;AAAA,MACJ;AACA,eAAS,qBAAqB,SAAS;AACnC,YAAI,CAAC,SAAS;AACV,iBAAO,MAAM,yBAAyB;AACtC;AAAA,QACJ;AACA,eAAO,MAAM;AAAA,EAA6E,KAAK,UAAU,SAAS,MAAM,CAAC,CAAC,EAAE;AAE5H,cAAM,kBAAkB;AACxB,YAAIA,IAAG,OAAO,gBAAgB,EAAE,KAAKA,IAAG,OAAO,gBAAgB,EAAE,GAAG;AAChE,gBAAM,MAAM,gBAAgB;AAC5B,gBAAM,kBAAkB,iBAAiB,IAAI,GAAG;AAChD,cAAI,iBAAiB;AACjB,4BAAgB,OAAO,IAAI,MAAM,mEAAmE,CAAC;AAAA,UACzG;AAAA,QACJ;AAAA,MACJ;AACA,eAAS,eAAe,QAAQ;AAC5B,YAAI,WAAW,UAAa,WAAW,MAAM;AACzC,iBAAO;AAAA,QACX;AACA,gBAAQ,OAAO;AAAA,UACX,KAAK,MAAM;AACP,mBAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;AAAA,UACzC,KAAK,MAAM;AACP,mBAAO,KAAK,UAAU,MAAM;AAAA,UAChC;AACI,mBAAO;AAAA,QACf;AAAA,MACJ;AACA,eAAS,oBAAoB,SAAS;AAClC,YAAI,UAAU,MAAM,OAAO,CAAC,QAAQ;AAChC;AAAA,QACJ;AACA,YAAI,gBAAgB,YAAY,MAAM;AAClC,cAAI,OAAO;AACX,eAAK,UAAU,MAAM,WAAW,UAAU,MAAM,YAAY,QAAQ,QAAQ;AACxE,mBAAO,WAAW,eAAe,QAAQ,MAAM,CAAC;AAAA,UACpD;AACA,iBAAO,IAAI,oBAAoB,QAAQ,MAAM,OAAO,QAAQ,EAAE,OAAO,IAAI;AAAA,QAC7E,OACK;AACD,wBAAc,gBAAgB,OAAO;AAAA,QACzC;AAAA,MACJ;AACA,eAAS,yBAAyB,SAAS;AACvC,YAAI,UAAU,MAAM,OAAO,CAAC,QAAQ;AAChC;AAAA,QACJ;AACA,YAAI,gBAAgB,YAAY,MAAM;AAClC,cAAI,OAAO;AACX,cAAI,UAAU,MAAM,WAAW,UAAU,MAAM,SAAS;AACpD,gBAAI,QAAQ,QAAQ;AAChB,qBAAO,WAAW,eAAe,QAAQ,MAAM,CAAC;AAAA,YACpD,OACK;AACD,qBAAO;AAAA,YACX;AAAA,UACJ;AACA,iBAAO,IAAI,yBAAyB,QAAQ,MAAM,MAAM,IAAI;AAAA,QAChE,OACK;AACD,wBAAc,qBAAqB,OAAO;AAAA,QAC9C;AAAA,MACJ;AACA,eAAS,qBAAqB,SAAS,QAAQ,WAAW;AACtD,YAAI,UAAU,MAAM,OAAO,CAAC,QAAQ;AAChC;AAAA,QACJ;AACA,YAAI,gBAAgB,YAAY,MAAM;AAClC,cAAI,OAAO;AACX,cAAI,UAAU,MAAM,WAAW,UAAU,MAAM,SAAS;AACpD,gBAAI,QAAQ,SAAS,QAAQ,MAAM,MAAM;AACrC,qBAAO,eAAe,eAAe,QAAQ,MAAM,IAAI,CAAC;AAAA,YAC5D,OACK;AACD,kBAAI,QAAQ,QAAQ;AAChB,uBAAO,WAAW,eAAe,QAAQ,MAAM,CAAC;AAAA,cACpD,WACS,QAAQ,UAAU,QAAW;AAClC,uBAAO;AAAA,cACX;AAAA,YACJ;AAAA,UACJ;AACA,iBAAO,IAAI,qBAAqB,MAAM,OAAO,QAAQ,EAAE,+BAA+B,KAAK,IAAI,IAAI,SAAS,MAAM,IAAI;AAAA,QAC1H,OACK;AACD,wBAAc,iBAAiB,OAAO;AAAA,QAC1C;AAAA,MACJ;AACA,eAAS,qBAAqB,SAAS;AACnC,YAAI,UAAU,MAAM,OAAO,CAAC,QAAQ;AAChC;AAAA,QACJ;AACA,YAAI,gBAAgB,YAAY,MAAM;AAClC,cAAI,OAAO;AACX,eAAK,UAAU,MAAM,WAAW,UAAU,MAAM,YAAY,QAAQ,QAAQ;AACxE,mBAAO,WAAW,eAAe,QAAQ,MAAM,CAAC;AAAA,UACpD;AACA,iBAAO,IAAI,qBAAqB,QAAQ,MAAM,OAAO,QAAQ,EAAE,OAAO,IAAI;AAAA,QAC9E,OACK;AACD,wBAAc,mBAAmB,OAAO;AAAA,QAC5C;AAAA,MACJ;AACA,eAAS,0BAA0B,SAAS;AACxC,YAAI,UAAU,MAAM,OAAO,CAAC,UAAU,QAAQ,WAAW,qBAAqB,KAAK,QAAQ;AACvF;AAAA,QACJ;AACA,YAAI,gBAAgB,YAAY,MAAM;AAClC,cAAI,OAAO;AACX,cAAI,UAAU,MAAM,WAAW,UAAU,MAAM,SAAS;AACpD,gBAAI,QAAQ,QAAQ;AAChB,qBAAO,WAAW,eAAe,QAAQ,MAAM,CAAC;AAAA,YACpD,OACK;AACD,qBAAO;AAAA,YACX;AAAA,UACJ;AACA,iBAAO,IAAI,0BAA0B,QAAQ,MAAM,MAAM,IAAI;AAAA,QACjE,OACK;AACD,wBAAc,wBAAwB,OAAO;AAAA,QACjD;AAAA,MACJ;AACA,eAAS,sBAAsB,SAAS,iBAAiB;AACrD,YAAI,UAAU,MAAM,OAAO,CAAC,QAAQ;AAChC;AAAA,QACJ;AACA,YAAI,gBAAgB,YAAY,MAAM;AAClC,cAAI,OAAO;AACX,cAAI,UAAU,MAAM,WAAW,UAAU,MAAM,SAAS;AACpD,gBAAI,QAAQ,SAAS,QAAQ,MAAM,MAAM;AACrC,qBAAO,eAAe,eAAe,QAAQ,MAAM,IAAI,CAAC;AAAA,YAC5D,OACK;AACD,kBAAI,QAAQ,QAAQ;AAChB,uBAAO,WAAW,eAAe,QAAQ,MAAM,CAAC;AAAA,cACpD,WACS,QAAQ,UAAU,QAAW;AAClC,uBAAO;AAAA,cACX;AAAA,YACJ;AAAA,UACJ;AACA,cAAI,iBAAiB;AACjB,kBAAM,QAAQ,QAAQ,QAAQ,oBAAoB,QAAQ,MAAM,OAAO,KAAK,QAAQ,MAAM,IAAI,OAAO;AACrG,mBAAO,IAAI,sBAAsB,gBAAgB,MAAM,OAAO,QAAQ,EAAE,SAAS,KAAK,IAAI,IAAI,gBAAgB,UAAU,MAAM,KAAK,IAAI,IAAI;AAAA,UAC/I,OACK;AACD,mBAAO,IAAI,qBAAqB,QAAQ,EAAE,qCAAqC,IAAI;AAAA,UACvF;AAAA,QACJ,OACK;AACD,wBAAc,oBAAoB,OAAO;AAAA,QAC7C;AAAA,MACJ;AACA,eAAS,cAAc,MAAM,SAAS;AAClC,YAAI,CAAC,UAAU,UAAU,MAAM,KAAK;AAChC;AAAA,QACJ;AACA,cAAM,aAAa;AAAA,UACf,cAAc;AAAA,UACd;AAAA,UACA;AAAA,UACA,WAAW,KAAK,IAAI;AAAA,QACxB;AACA,eAAO,IAAI,UAAU;AAAA,MACzB;AACA,eAAS,0BAA0B;AAC/B,YAAI,SAAS,GAAG;AACZ,gBAAM,IAAI,gBAAgB,iBAAiB,QAAQ,uBAAuB;AAAA,QAC9E;AACA,YAAI,WAAW,GAAG;AACd,gBAAM,IAAI,gBAAgB,iBAAiB,UAAU,yBAAyB;AAAA,QAClF;AAAA,MACJ;AACA,eAAS,mBAAmB;AACxB,YAAI,YAAY,GAAG;AACf,gBAAM,IAAI,gBAAgB,iBAAiB,kBAAkB,iCAAiC;AAAA,QAClG;AAAA,MACJ;AACA,eAAS,sBAAsB;AAC3B,YAAI,CAAC,YAAY,GAAG;AAChB,gBAAM,IAAI,MAAM,sBAAsB;AAAA,QAC1C;AAAA,MACJ;AACA,eAAS,gBAAgB,OAAO;AAC5B,YAAI,UAAU,QAAW;AACrB,iBAAO;AAAA,QACX,OACK;AACD,iBAAO;AAAA,QACX;AAAA,MACJ;AACA,eAAS,gBAAgB,OAAO;AAC5B,YAAI,UAAU,MAAM;AAChB,iBAAO;AAAA,QACX,OACK;AACD,iBAAO;AAAA,QACX;AAAA,MACJ;AACA,eAAS,aAAa,OAAO;AACzB,eAAO,UAAU,UAAa,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,KAAK,OAAO,UAAU;AAAA,MAC9F;AACA,eAAS,mBAAmB,qBAAqB,OAAO;AACpD,gBAAQ,qBAAqB;AAAA,UACzB,KAAK,WAAW,oBAAoB;AAChC,gBAAI,aAAa,KAAK,GAAG;AACrB,qBAAO,gBAAgB,KAAK;AAAA,YAChC,OACK;AACD,qBAAO,CAAC,gBAAgB,KAAK,CAAC;AAAA,YAClC;AAAA,UACJ,KAAK,WAAW,oBAAoB;AAChC,gBAAI,CAAC,aAAa,KAAK,GAAG;AACtB,oBAAM,IAAI,MAAM,iEAAiE;AAAA,YACrF;AACA,mBAAO,gBAAgB,KAAK;AAAA,UAChC,KAAK,WAAW,oBAAoB;AAChC,mBAAO,CAAC,gBAAgB,KAAK,CAAC;AAAA,UAClC;AACI,kBAAM,IAAI,MAAM,+BAA+B,oBAAoB,SAAS,CAAC,EAAE;AAAA,QACvF;AAAA,MACJ;AACA,eAAS,qBAAqB,MAAM,QAAQ;AACxC,YAAI;AACJ,cAAM,iBAAiB,KAAK;AAC5B,gBAAQ,gBAAgB;AAAA,UACpB,KAAK;AACD,qBAAS;AACT;AAAA,UACJ,KAAK;AACD,qBAAS,mBAAmB,KAAK,qBAAqB,OAAO,CAAC,CAAC;AAC/D;AAAA,UACJ;AACI,qBAAS,CAAC;AACV,qBAAS,IAAI,GAAG,IAAI,OAAO,UAAU,IAAI,gBAAgB,KAAK;AAC1D,qBAAO,KAAK,gBAAgB,OAAO,CAAC,CAAC,CAAC;AAAA,YAC1C;AACA,gBAAI,OAAO,SAAS,gBAAgB;AAChC,uBAAS,IAAI,OAAO,QAAQ,IAAI,gBAAgB,KAAK;AACjD,uBAAO,KAAK,IAAI;AAAA,cACpB;AAAA,YACJ;AACA;AAAA,QACR;AACA,eAAO;AAAA,MACX;AACA,YAAMyB,cAAa;AAAA,QACf,kBAAkB,CAAC,SAAS,SAAS;AACjC,kCAAwB;AACxB,cAAI;AACJ,cAAI;AACJ,cAAIzB,IAAG,OAAO,IAAI,GAAG;AACjB,qBAAS;AACT,kBAAM0B,SAAQ,KAAK,CAAC;AACpB,gBAAI,aAAa;AACjB,gBAAI,sBAAsB,WAAW,oBAAoB;AACzD,gBAAI,WAAW,oBAAoB,GAAGA,MAAK,GAAG;AAC1C,2BAAa;AACb,oCAAsBA;AAAA,YAC1B;AACA,kBAAM,WAAW,KAAK;AACtB,kBAAM,iBAAiB,WAAW;AAClC,oBAAQ,gBAAgB;AAAA,cACpB,KAAK;AACD,gCAAgB;AAChB;AAAA,cACJ,KAAK;AACD,gCAAgB,mBAAmB,qBAAqB,KAAK,UAAU,CAAC;AACxE;AAAA,cACJ;AACI,oBAAI,wBAAwB,WAAW,oBAAoB,QAAQ;AAC/D,wBAAM,IAAI,MAAM,YAAY,cAAc,6DAA6D;AAAA,gBAC3G;AACA,gCAAgB,KAAK,MAAM,YAAY,QAAQ,EAAE,IAAI,WAAS,gBAAgB,KAAK,CAAC;AACpF;AAAA,YACR;AAAA,UACJ,OACK;AACD,kBAAM,SAAS;AACf,qBAAS,KAAK;AACd,4BAAgB,qBAAqB,MAAM,MAAM;AAAA,UACrD;AACA,gBAAM,sBAAsB;AAAA,YACxB,SAAS;AAAA,YACT;AAAA,YACA,QAAQ;AAAA,UACZ;AACA,mCAAyB,mBAAmB;AAC5C,iBAAO,cAAc,MAAM,mBAAmB,EAAE,MAAM,CAAC,UAAU;AAC7D,mBAAO,MAAM,8BAA8B;AAC3C,kBAAM;AAAA,UACV,CAAC;AAAA,QACL;AAAA,QACA,gBAAgB,CAAC,MAAM,YAAY;AAC/B,kCAAwB;AACxB,cAAI;AACJ,cAAI1B,IAAG,KAAK,IAAI,GAAG;AACf,sCAA0B;AAAA,UAC9B,WACS,SAAS;AACd,gBAAIA,IAAG,OAAO,IAAI,GAAG;AACjB,uBAAS;AACT,mCAAqB,IAAI,MAAM,EAAE,MAAM,QAAW,QAAQ,CAAC;AAAA,YAC/D,OACK;AACD,uBAAS,KAAK;AACd,mCAAqB,IAAI,KAAK,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAAA,YAC3D;AAAA,UACJ;AACA,iBAAO;AAAA,YACH,SAAS,MAAM;AAp/B/B,kBAAAuB;AAq/BoB,kBAAI,WAAW,QAAW;AACtB,sBAAIA,MAAA,qBAAqB,IAAI,MAAM,MAA/B,gBAAAA,IAAkC,aAAY,SAAS;AACvD,uCAAqB,OAAO,MAAM;AAAA,gBACtC;AAAA,cACJ,WACS,4BAA4B,MAAM;AACvC,0CAA0B;AAAA,cAC9B;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AAAA,QACA,YAAY,CAAC,OAAO,OAAO,YAAY;AACnC,cAAI,iBAAiB,IAAI,KAAK,GAAG;AAC7B,kBAAM,IAAI,MAAM,8BAA8B,KAAK,qBAAqB;AAAA,UAC5E;AACA,2BAAiB,IAAI,OAAO,OAAO;AACnC,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,kBAAI,iBAAiB,IAAI,KAAK,MAAM,SAAS;AACzC,iCAAiB,OAAO,KAAK;AAAA,cACjC;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AAAA,QACA,cAAc,CAAC,OAAO,OAAO,UAAU;AAGnC,iBAAOE,YAAW,iBAAiB,qBAAqB,MAAM,EAAE,OAAO,MAAM,CAAC;AAAA,QAClF;AAAA,QACA,qBAAqB,yBAAyB;AAAA,QAC9C,aAAa,CAAC,SAAS,SAAS;AAC5B,kCAAwB;AACxB,8BAAoB;AACpB,mBAAS,iBAAiBA,aAAYE,KAAI;AACtC,kBAAM,IAAI,qBAAqB,OAAO,iBAAiBF,aAAYE,GAAE;AACrE,gBAAI,MAAM,QAAW;AACjB,qBAAO,IAAI,qEAAqEA,GAAE,EAAE;AAAA,YACxF,OACK;AACD,gBAAE,MAAM,MAAM;AACV,uBAAO,IAAI,wCAAwCA,GAAE,UAAU;AAAA,cACnE,CAAC;AAAA,YACL;AAAA,UACJ;AACA,cAAI;AACJ,cAAI;AACJ,cAAI,QAAQ;AACZ,cAAI3B,IAAG,OAAO,IAAI,GAAG;AACjB,qBAAS;AACT,kBAAM0B,SAAQ,KAAK,CAAC;AACpB,kBAAM,OAAO,KAAK,KAAK,SAAS,CAAC;AACjC,gBAAI,aAAa;AACjB,gBAAI,sBAAsB,WAAW,oBAAoB;AACzD,gBAAI,WAAW,oBAAoB,GAAGA,MAAK,GAAG;AAC1C,2BAAa;AACb,oCAAsBA;AAAA,YAC1B;AACA,gBAAI,WAAW,KAAK;AACpB,gBAAI,eAAe,kBAAkB,GAAG,IAAI,GAAG;AAC3C,yBAAW,WAAW;AACtB,sBAAQ;AAAA,YACZ;AACA,kBAAM,iBAAiB,WAAW;AAClC,oBAAQ,gBAAgB;AAAA,cACpB,KAAK;AACD,gCAAgB;AAChB;AAAA,cACJ,KAAK;AACD,gCAAgB,mBAAmB,qBAAqB,KAAK,UAAU,CAAC;AACxE;AAAA,cACJ;AACI,oBAAI,wBAAwB,WAAW,oBAAoB,QAAQ;AAC/D,wBAAM,IAAI,MAAM,YAAY,cAAc,wDAAwD;AAAA,gBACtG;AACA,gCAAgB,KAAK,MAAM,YAAY,QAAQ,EAAE,IAAI,WAAS,gBAAgB,KAAK,CAAC;AACpF;AAAA,YACR;AAAA,UACJ,OACK;AACD,kBAAM,SAAS;AACf,qBAAS,KAAK;AACd,4BAAgB,qBAAqB,MAAM,MAAM;AACjD,kBAAM,iBAAiB,KAAK;AAC5B,oBAAQ,eAAe,kBAAkB,GAAG,OAAO,cAAc,CAAC,IAAI,OAAO,cAAc,IAAI;AAAA,UACnG;AACA,gBAAM,KAAK;AACX,cAAI;AACJ,cAAI,oBAAoB;AACxB,cAAI,UAAU,QAAW;AACrB,gBAAI,MAAM,yBAAyB;AAC/B,kCAAoB;AAAA,YACxB,OACK;AACD,2BAAa,MAAM,wBAAwB,MAAM;AAC7C,iCAAiBD,aAAY,EAAE;AAAA,cACnC,CAAC;AAAA,YACL;AAAA,UACJ;AACA,gBAAM,iBAAiB;AAAA,YACnB,SAAS;AAAA,YACT;AAAA,YACA;AAAA,YACA,QAAQ;AAAA,UACZ;AACA,8BAAoB,cAAc;AAClC,cAAI,OAAO,qBAAqB,OAAO,uBAAuB,YAAY;AACtE,iCAAqB,OAAO,mBAAmB,cAAc;AAAA,UACjE;AAEA,iBAAO,IAAI,QAAQ,OAAO,SAAS,WAAW;AAC1C,kBAAM,qBAAqB,CAAC,MAAM;AAC9B,sBAAQ,CAAC;AACT,mCAAqB,OAAO,QAAQ,EAAE;AACtC,uDAAY;AAAA,YAChB;AACA,kBAAM,oBAAoB,CAAC,MAAM;AAC7B,qBAAO,CAAC;AACR,mCAAqB,OAAO,QAAQ,EAAE;AACtC,uDAAY;AAAA,YAChB;AACA,kBAAM,kBAAkB,EAAE,QAAgB,YAAY,KAAK,IAAI,GAAG,SAAS,oBAAoB,QAAQ,kBAAkB;AACzH,gBAAI;AACA,+BAAiB,IAAI,IAAI,eAAe;AACxC,oBAAM,cAAc,MAAM,cAAc;AACxC,kBAAI,mBAAmB;AACnB,iCAAiBA,aAAY,EAAE;AAAA,cACnC;AAAA,YACJ,SACO,OAAO;AAGV,+BAAiB,OAAO,EAAE;AAC1B,8BAAgB,OAAO,IAAI,WAAW,cAAc,WAAW,WAAW,mBAAmB,MAAM,UAAU,MAAM,UAAU,gBAAgB,CAAC;AAC9I,qBAAO,MAAM,yBAAyB;AACtC,oBAAM;AAAA,YACV;AAAA,UACJ,CAAC;AAAA,QACL;AAAA,QACA,WAAW,CAAC,MAAM,YAAY;AAC1B,kCAAwB;AACxB,cAAI,SAAS;AACb,cAAI,mBAAmB,GAAG,IAAI,GAAG;AAC7B,qBAAS;AACT,iCAAqB;AAAA,UACzB,WACSzB,IAAG,OAAO,IAAI,GAAG;AACtB,qBAAS;AACT,gBAAI,YAAY,QAAW;AACvB,uBAAS;AACT,8BAAgB,IAAI,MAAM,EAAE,SAAkB,MAAM,OAAU,CAAC;AAAA,YACnE;AAAA,UACJ,OACK;AACD,gBAAI,YAAY,QAAW;AACvB,uBAAS,KAAK;AACd,8BAAgB,IAAI,KAAK,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAAA,YACtD;AAAA,UACJ;AACA,iBAAO;AAAA,YACH,SAAS,MAAM;AAppC/B,kBAAAuB;AAqpCoB,kBAAI,WAAW,MAAM;AACjB;AAAA,cACJ;AACA,kBAAI,WAAW,QAAW;AACtB,sBAAIA,MAAA,gBAAgB,IAAI,MAAM,MAA1B,gBAAAA,IAA6B,aAAY,SAAS;AAClD,kCAAgB,OAAO,MAAM;AAAA,gBACjC;AAAA,cACJ,WACS,uBAAuB,MAAM;AAClC,qCAAqB;AAAA,cACzB;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AAAA,QACA,oBAAoB,MAAM;AACtB,iBAAO,iBAAiB,OAAO;AAAA,QACnC;AAAA,QACA,OAAO,OAAO,QAAQ,SAAS,mCAAmC;AAC9D,cAAI,oBAAoB;AACxB,cAAI,eAAe,YAAY;AAC/B,cAAI,mCAAmC,QAAW;AAC9C,gBAAIvB,IAAG,QAAQ,8BAA8B,GAAG;AAC5C,kCAAoB;AAAA,YACxB,OACK;AACD,kCAAoB,+BAA+B,oBAAoB;AACvE,6BAAe,+BAA+B,eAAe,YAAY;AAAA,YAC7E;AAAA,UACJ;AACA,kBAAQ;AACR,wBAAc;AACd,cAAI,UAAU,MAAM,KAAK;AACrB,qBAAS;AAAA,UACb,OACK;AACD,qBAAS;AAAA,UACb;AACA,cAAI,qBAAqB,CAAC,SAAS,KAAK,CAAC,WAAW,GAAG;AACnD,kBAAMyB,YAAW,iBAAiB,qBAAqB,MAAM,EAAE,OAAO,MAAM,SAAS,MAAM,EAAE,CAAC;AAAA,UAClG;AAAA,QACJ;AAAA,QACA,SAAS,aAAa;AAAA,QACtB,SAAS,aAAa;AAAA,QACtB,yBAAyB,6BAA6B;AAAA,QACtD,WAAW,eAAe;AAAA,QAC1B,KAAK,MAAM;AACP,wBAAc,IAAI;AAAA,QACtB;AAAA,QACA,SAAS,MAAM;AACX,cAAI,WAAW,GAAG;AACd;AAAA,UACJ;AACA,kBAAQ,gBAAgB;AACxB,yBAAe,KAAK,MAAS;AAC7B,gBAAM,QAAQ,IAAI,WAAW,cAAc,WAAW,WAAW,yBAAyB,yDAAyD;AACnJ,qBAAW,WAAW,iBAAiB,OAAO,GAAG;AAC7C,oBAAQ,OAAO,KAAK;AAAA,UACxB;AACA,6BAAmB,oBAAI,IAAI;AAC3B,0BAAgB,oBAAI,IAAI;AACxB,kCAAwB,oBAAI,IAAI;AAChC,yBAAe,IAAI,YAAY,UAAU;AAEzC,cAAIzB,IAAG,KAAK,cAAc,OAAO,GAAG;AAChC,0BAAc,QAAQ;AAAA,UAC1B;AACA,cAAIA,IAAG,KAAK,cAAc,OAAO,GAAG;AAChC,0BAAc,QAAQ;AAAA,UAC1B;AAAA,QACJ;AAAA,QACA,QAAQ,MAAM;AACV,kCAAwB;AACxB,2BAAiB;AACjB,kBAAQ,gBAAgB;AACxB,wBAAc,OAAO,QAAQ;AAAA,QACjC;AAAA,QACA,SAAS,MAAM;AACX,WAAC,GAAG,MAAM,SAAS,EAAE,QAAQ,IAAI,SAAS;AAAA,QAC9C;AAAA,MACJ;AACA,MAAAyB,YAAW,eAAe,qBAAqB,MAAM,CAAC,WAAW;AAC7D,YAAI,UAAU,MAAM,OAAO,CAAC,QAAQ;AAChC;AAAA,QACJ;AACA,cAAM,UAAU,UAAU,MAAM,WAAW,UAAU,MAAM;AAC3D,eAAO,IAAI,OAAO,SAAS,UAAU,OAAO,UAAU,MAAS;AAAA,MACnE,CAAC;AACD,MAAAA,YAAW,eAAe,qBAAqB,MAAM,OAAO,WAAW;AACnE,cAAM,UAAU,iBAAiB,IAAI,OAAO,KAAK;AACjD,YAAI,SAAS;AACT,gBAAM,QAAQ,OAAO,KAAK;AAAA,QAC9B,OACK;AACD,mCAAyB,KAAK,MAAM;AAAA,QACxC;AAAA,MACJ,CAAC;AACD,aAAOA;AAAA,IACX;AAAA;AAAA;;;ACtvCA;AAAA,wDAAAG,UAAA;AAAA;AAMA,QAAI,kBAAmBA,YAAQA,SAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAI;AAAA,IAC5D;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,eAAeA,SAAQ,gBAAgBA,SAAQ,0BAA0BA,SAAQ,aAAaA,SAAQ,oBAAoBA,SAAQ,qBAAqBA,SAAQ,wBAAwBA,SAAQ,+BAA+BA,SAAQ,wBAAwBA,SAAQ,gBAAgBA,SAAQ,8BAA8BA,SAAQ,wBAAwBA,SAAQ,gBAAgBA,SAAQ,8BAA8BA,SAAQ,4BAA4BA,SAAQ,oBAAoBA,SAAQ,0BAA0BA,SAAQ,UAAUA,SAAQ,QAAQA,SAAQ,aAAaA,SAAQ,WAAWA,SAAQ,QAAQA,SAAQ,YAAYA,SAAQ,sBAAsBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,mBAAmBA,SAAQ,aAAaA,SAAQ,gBAAgBA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,eAAeA,SAAQ,cAAcA,SAAQ,UAAUA,SAAQ,MAAM;AAC5wC,IAAAA,SAAQ,kBAAkBA,SAAQ,uBAAuBA,SAAQ,6BAA6BA,SAAQ,sCAAsCA,SAAQ,iCAAiCA,SAAQ,+BAA+BA,SAAQ,kBAAkBA,SAAQ,mBAAmBA,SAAQ,uBAAuBA,SAAQ,uBAAuBA,SAAQ,cAAcA,SAAQ,cAAcA,SAAQ,aAAaA,SAAQ,QAAQ;AACha,QAAM,aAAa;AACnB,WAAO,eAAeA,UAAS,WAAW,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAS,EAAE,CAAC;AAC/G,WAAO,eAAeA,UAAS,eAAe,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAa,EAAE,CAAC;AACvH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAc,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,iBAAiB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAe,EAAE,CAAC;AAC3H,WAAO,eAAeA,UAAS,cAAc,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAY,EAAE,CAAC;AACrH,WAAO,eAAeA,UAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAkB,EAAE,CAAC;AACjI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,uBAAuB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAqB,EAAE,CAAC;AACvI,QAAM,cAAc;AACpB,WAAO,eAAeA,UAAS,aAAa,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,YAAY;AAAA,IAAW,EAAE,CAAC;AACpH,WAAO,eAAeA,UAAS,YAAY,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,YAAY;AAAA,IAAU,EAAE,CAAC;AAClH,WAAO,eAAeA,UAAS,SAAS,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,YAAY;AAAA,IAAO,EAAE,CAAC;AAC5G,QAAM,eAAe;AACrB,WAAO,eAAeA,UAAS,cAAc,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAY,EAAE,CAAC;AACvH,QAAM,WAAW;AACjB,WAAO,eAAeA,UAAS,SAAS,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,SAAS;AAAA,IAAO,EAAE,CAAC;AACzG,WAAO,eAAeA,UAAS,WAAW,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,SAAS;AAAA,IAAS,EAAE,CAAC;AAC7G,QAAM,iBAAiB;AACvB,WAAO,eAAeA,UAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,eAAe;AAAA,IAAyB,EAAE,CAAC;AACnJ,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,eAAe;AAAA,IAAmB,EAAE,CAAC;AACvI,QAAM,4BAA4B;AAClC,WAAO,eAAeA,UAAS,6BAA6B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA2B,EAAE,CAAC;AAClK,WAAO,eAAeA,UAAS,+BAA+B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA6B,EAAE,CAAC;AACtK,QAAM,kBAAkB;AACxB,WAAO,eAAeA,UAAS,iBAAiB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,gBAAgB;AAAA,IAAe,EAAE,CAAC;AAChI,WAAO,eAAeA,UAAS,yBAAyB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,gBAAgB;AAAA,IAAuB,EAAE,CAAC;AAChJ,WAAO,eAAeA,UAAS,+BAA+B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,gBAAgB;AAAA,IAA6B,EAAE,CAAC;AAC5J,QAAM,kBAAkB;AACxB,WAAO,eAAeA,UAAS,iBAAiB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,gBAAgB;AAAA,IAAe,EAAE,CAAC;AAChI,WAAO,eAAeA,UAAS,yBAAyB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,gBAAgB;AAAA,IAAuB,EAAE,CAAC;AAChJ,WAAO,eAAeA,UAAS,gCAAgC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,gBAAgB;AAAA,IAA8B,EAAE,CAAC;AAC9J,QAAM,kBAAkB;AACxB,WAAO,eAAeA,UAAS,yBAAyB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,gBAAgB;AAAA,IAAuB,EAAE,CAAC;AAChJ,QAAM,eAAe;AACrB,WAAO,eAAeA,UAAS,sBAAsB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAoB,EAAE,CAAC;AACvI,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAmB,EAAE,CAAC;AACrI,WAAO,eAAeA,UAAS,cAAc,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAY,EAAE,CAAC;AACvH,WAAO,eAAeA,UAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAyB,EAAE,CAAC;AACjJ,WAAO,eAAeA,UAAS,iBAAiB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAe,EAAE,CAAC;AAC7H,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAc,EAAE,CAAC;AAC3H,WAAO,eAAeA,UAAS,SAAS,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAO,EAAE,CAAC;AAC7G,WAAO,eAAeA,UAAS,cAAc,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAY,EAAE,CAAC;AACvH,WAAO,eAAeA,UAAS,eAAe,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAa,EAAE,CAAC;AACzH,WAAO,eAAeA,UAAS,wBAAwB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAsB,EAAE,CAAC;AAC3I,WAAO,eAAeA,UAAS,wBAAwB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAsB,EAAE,CAAC;AAC3I,WAAO,eAAeA,UAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAkB,EAAE,CAAC;AACnI,WAAO,eAAeA,UAAS,mBAAmB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAiB,EAAE,CAAC;AACjI,WAAO,eAAeA,UAAS,gCAAgC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAA8B,EAAE,CAAC;AAC3J,WAAO,eAAeA,UAAS,kCAAkC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAgC,EAAE,CAAC;AAC/J,WAAO,eAAeA,UAAS,uCAAuC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAqC,EAAE,CAAC;AACzK,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAA4B,EAAE,CAAC;AACvJ,WAAO,eAAeA,UAAS,wBAAwB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAsB,EAAE,CAAC;AAC3I,WAAO,eAAeA,UAAS,mBAAmB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAiB,EAAE,CAAC;AACjI,WAAO,eAAeA,UAAS,eAAe,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAAa,EAAE,CAAC;AACzH,QAAM,QAAQ,gBAAgB,aAAgB;AAC9C,IAAAA,SAAQ,MAAM,MAAM;AAAA;AAAA;;;ACtFpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAKW,aAOA,KAOA,SASA,UAaA,UA8BA,OA2BA,UAwBA,cA4BA,OA8BA,kBAyBA,mBA2BA,kBAmBA,cAyCA,8BAwBA,oBAwBA,eAqBA,iBAYA,YA0EA,SA0BA,UAoCA,kBAqBA,4BAQA,mBA4CA,kBAiBA,YAuBA,YAwBA,YAuBA,eAiBL,oBAgFK,iBAeL,mBAuCO,iBA4KF,wBAuBA,iCAwBA,yCAwBA,cA8EA,kBA6BA,YAmBA,eAcA,oBAgCA,kBAwBA,mBAYA,mBAwBA,gBA2BA,WAeA,4BAaA,gBAeA,gBAaA,cAoBA,OAiBA,sBAiBA,sBAoBA,uBAmBA,mBAmBA,YAkCA,WAOA,mBAwBA,iBAkBA,gBA4CA,gBA+FA,uBAkBA,mBAgCA,eAcA,YAsCA,UA0BA,mBAsBA,cAsBA,gBAwBA,oBA4CA,wBAgBA,gBAcA,iBAqBA,2BAqBA,kCAsBA,oBAuBA,eAeA,oBAeA,WAsBA,aAcA,sBAOA,sBAYA,6BAWA,wBAOA,yBAOA,iBAQE,KAIF,cAmFL,kBA0FF;AA5zEJ;AAAA;AAAA;AAMA,KAAC,SAAUC,cAAa;AACpB,eAAS,GAAG,OAAO;AACf,eAAO,OAAO,UAAU;AAAA,MAC5B;AACA,MAAAA,aAAY,KAAK;AAAA,IACrB,GAAG,gBAAgB,cAAc,CAAC,EAAE;AAEpC,KAAC,SAAUC,MAAK;AACZ,eAAS,GAAG,OAAO;AACf,eAAO,OAAO,UAAU;AAAA,MAC5B;AACA,MAAAA,KAAI,KAAK;AAAA,IACb,GAAG,QAAQ,MAAM,CAAC,EAAE;AAEpB,KAAC,SAAUC,UAAS;AAChB,MAAAA,SAAQ,YAAY;AACpB,MAAAA,SAAQ,YAAY;AACpB,eAAS,GAAG,OAAO;AACf,eAAO,OAAO,UAAU,YAAYA,SAAQ,aAAa,SAAS,SAASA,SAAQ;AAAA,MACvF;AACA,MAAAA,SAAQ,KAAK;AAAA,IACjB,GAAG,YAAY,UAAU,CAAC,EAAE;AAE5B,KAAC,SAAUC,WAAU;AACjB,MAAAA,UAAS,YAAY;AACrB,MAAAA,UAAS,YAAY;AACrB,eAAS,GAAG,OAAO;AACf,eAAO,OAAO,UAAU,YAAYA,UAAS,aAAa,SAAS,SAASA,UAAS;AAAA,MACzF;AACA,MAAAA,UAAS,KAAK;AAAA,IAClB,GAAG,aAAa,WAAW,CAAC,EAAE;AAM9B,KAAC,SAAUC,WAAU;AAMjB,eAAS,OAAO,MAAM,WAAW;AAC7B,YAAI,SAAS,OAAO,WAAW;AAC3B,iBAAO,SAAS;AAAA,QACpB;AACA,YAAI,cAAc,OAAO,WAAW;AAChC,sBAAY,SAAS;AAAA,QACzB;AACA,eAAO,EAAE,MAAM,UAAU;AAAA,MAC7B;AACA,MAAAA,UAAS,SAAS;AAIlB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,GAAG,SAAS,UAAU,IAAI,KAAK,GAAG,SAAS,UAAU,SAAS;AAAA,MACxG;AACA,MAAAA,UAAS,KAAK;AAAA,IAClB,GAAG,aAAa,WAAW,CAAC,EAAE;AAM9B,KAAC,SAAUC,QAAO;AACd,eAAS,OAAO,KAAK,KAAK,OAAO,MAAM;AACnC,YAAI,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,KAAK,KAAK,GAAG,SAAS,IAAI,GAAG;AACjF,iBAAO,EAAE,OAAO,SAAS,OAAO,KAAK,GAAG,GAAG,KAAK,SAAS,OAAO,OAAO,IAAI,EAAE;AAAA,QACjF,WACS,SAAS,GAAG,GAAG,KAAK,SAAS,GAAG,GAAG,GAAG;AAC3C,iBAAO,EAAE,OAAO,KAAK,KAAK,IAAI;AAAA,QAClC,OACK;AACD,gBAAM,IAAI,MAAM,8CAA8C,GAAG,KAAK,GAAG,KAAK,KAAK,KAAK,IAAI,GAAG;AAAA,QACnG;AAAA,MACJ;AACA,MAAAA,OAAM,SAAS;AAIf,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,SAAS,GAAG,UAAU,KAAK,KAAK,SAAS,GAAG,UAAU,GAAG;AAAA,MACnG;AACA,MAAAA,OAAM,KAAK;AAAA,IACf,GAAG,UAAU,QAAQ,CAAC,EAAE;AAMxB,KAAC,SAAUC,WAAU;AAMjB,eAAS,OAAO,KAAK,OAAO;AACxB,eAAO,EAAE,KAAK,MAAM;AAAA,MACxB;AACA,MAAAA,UAAS,SAAS;AAIlB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,MAAM,GAAG,UAAU,KAAK,MAAM,GAAG,OAAO,UAAU,GAAG,KAAK,GAAG,UAAU,UAAU,GAAG;AAAA,MAC9H;AACA,MAAAA,UAAS,KAAK;AAAA,IAClB,GAAG,aAAa,WAAW,CAAC,EAAE;AAM9B,KAAC,SAAUC,eAAc;AAQrB,eAAS,OAAO,WAAW,aAAa,sBAAsB,sBAAsB;AAChF,eAAO,EAAE,WAAW,aAAa,sBAAsB,qBAAqB;AAAA,MAChF;AACA,MAAAA,cAAa,SAAS;AAItB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,MAAM,GAAG,UAAU,WAAW,KAAK,GAAG,OAAO,UAAU,SAAS,KAC/F,MAAM,GAAG,UAAU,oBAAoB,MACtC,MAAM,GAAG,UAAU,oBAAoB,KAAK,GAAG,UAAU,UAAU,oBAAoB;AAAA,MACnG;AACA,MAAAA,cAAa,KAAK;AAAA,IACtB,GAAG,iBAAiB,eAAe,CAAC,EAAE;AAMtC,KAAC,SAAUC,QAAO;AAId,eAAS,OAAO,KAAK,OAAO,MAAM,OAAO;AACrC,eAAO;AAAA,UACH;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACJ;AAAA,MACJ;AACA,MAAAA,OAAM,SAAS;AAIf,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,GAAG,YAAY,UAAU,KAAK,GAAG,CAAC,KACjE,GAAG,YAAY,UAAU,OAAO,GAAG,CAAC,KACpC,GAAG,YAAY,UAAU,MAAM,GAAG,CAAC,KACnC,GAAG,YAAY,UAAU,OAAO,GAAG,CAAC;AAAA,MAC/C;AACA,MAAAA,OAAM,KAAK;AAAA,IACf,GAAG,UAAU,QAAQ,CAAC,EAAE;AAMxB,KAAC,SAAUC,mBAAkB;AAIzB,eAAS,OAAO,OAAO,OAAO;AAC1B,eAAO;AAAA,UACH;AAAA,UACA;AAAA,QACJ;AAAA,MACJ;AACA,MAAAA,kBAAiB,SAAS;AAI1B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,MAAM,GAAG,UAAU,KAAK,KAAK,MAAM,GAAG,UAAU,KAAK;AAAA,MAC/F;AACA,MAAAA,kBAAiB,KAAK;AAAA,IAC1B,GAAG,qBAAqB,mBAAmB,CAAC,EAAE;AAM9C,KAAC,SAAUC,oBAAmB;AAI1B,eAAS,OAAO,OAAO,UAAU,qBAAqB;AAClD,eAAO;AAAA,UACH;AAAA,UACA;AAAA,UACA;AAAA,QACJ;AAAA,MACJ;AACA,MAAAA,mBAAkB,SAAS;AAI3B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,GAAG,OAAO,UAAU,KAAK,MACvD,GAAG,UAAU,UAAU,QAAQ,KAAK,SAAS,GAAG,SAAS,OACzD,GAAG,UAAU,UAAU,mBAAmB,KAAK,GAAG,WAAW,UAAU,qBAAqB,SAAS,EAAE;AAAA,MACnH;AACA,MAAAA,mBAAkB,KAAK;AAAA,IAC3B,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAKhD,KAAC,SAAUC,mBAAkB;AAIzB,MAAAA,kBAAiB,UAAU;AAI3B,MAAAA,kBAAiB,UAAU;AAI3B,MAAAA,kBAAiB,SAAS;AAAA,IAC9B,GAAG,qBAAqB,mBAAmB,CAAC,EAAE;AAM9C,KAAC,SAAUC,eAAc;AAIrB,eAAS,OAAO,WAAW,SAAS,gBAAgB,cAAc,MAAM,eAAe;AACnF,cAAM,SAAS;AAAA,UACX;AAAA,UACA;AAAA,QACJ;AACA,YAAI,GAAG,QAAQ,cAAc,GAAG;AAC5B,iBAAO,iBAAiB;AAAA,QAC5B;AACA,YAAI,GAAG,QAAQ,YAAY,GAAG;AAC1B,iBAAO,eAAe;AAAA,QAC1B;AACA,YAAI,GAAG,QAAQ,IAAI,GAAG;AAClB,iBAAO,OAAO;AAAA,QAClB;AACA,YAAI,GAAG,QAAQ,aAAa,GAAG;AAC3B,iBAAO,gBAAgB;AAAA,QAC3B;AACA,eAAO;AAAA,MACX;AACA,MAAAA,cAAa,SAAS;AAItB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,GAAG,SAAS,UAAU,SAAS,KAAK,GAAG,SAAS,UAAU,SAAS,MACjG,GAAG,UAAU,UAAU,cAAc,KAAK,GAAG,SAAS,UAAU,cAAc,OAC9E,GAAG,UAAU,UAAU,YAAY,KAAK,GAAG,SAAS,UAAU,YAAY,OAC1E,GAAG,UAAU,UAAU,IAAI,KAAK,GAAG,OAAO,UAAU,IAAI;AAAA,MACpE;AACA,MAAAA,cAAa,KAAK;AAAA,IACtB,GAAG,iBAAiB,eAAe,CAAC,EAAE;AAMtC,KAAC,SAAUC,+BAA8B;AAIrC,eAAS,OAAO,UAAU,SAAS;AAC/B,eAAO;AAAA,UACH;AAAA,UACA;AAAA,QACJ;AAAA,MACJ;AACA,MAAAA,8BAA6B,SAAS;AAItC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,SAAS,GAAG,UAAU,QAAQ,KAAK,GAAG,OAAO,UAAU,OAAO;AAAA,MAClG;AACA,MAAAA,8BAA6B,KAAK;AAAA,IACtC,GAAG,iCAAiC,+BAA+B,CAAC,EAAE;AAKtE,KAAC,SAAUC,qBAAoB;AAI3B,MAAAA,oBAAmB,QAAQ;AAI3B,MAAAA,oBAAmB,UAAU;AAI7B,MAAAA,oBAAmB,cAAc;AAIjC,MAAAA,oBAAmB,OAAO;AAAA,IAC9B,GAAG,uBAAuB,qBAAqB,CAAC,EAAE;AAOlD,KAAC,SAAUC,gBAAe;AAOtB,MAAAA,eAAc,cAAc;AAM5B,MAAAA,eAAc,aAAa;AAAA,IAC/B,GAAG,kBAAkB,gBAAgB,CAAC,EAAE;AAOxC,KAAC,SAAUC,kBAAiB;AACxB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,GAAG,OAAO,UAAU,IAAI;AAAA,MAClE;AACA,MAAAA,iBAAgB,KAAK;AAAA,IACzB,GAAG,oBAAoB,kBAAkB,CAAC,EAAE;AAM5C,KAAC,SAAUC,aAAY;AAInB,eAAS,OAAO,OAAO,SAAS,UAAU,MAAM,QAAQ,oBAAoB;AACxE,cAAM,SAAS,EAAE,OAAO,QAAQ;AAChC,YAAI,GAAG,QAAQ,QAAQ,GAAG;AACtB,iBAAO,WAAW;AAAA,QACtB;AACA,YAAI,GAAG,QAAQ,IAAI,GAAG;AAClB,iBAAO,OAAO;AAAA,QAClB;AACA,YAAI,GAAG,QAAQ,MAAM,GAAG;AACpB,iBAAO,SAAS;AAAA,QACpB;AACA,YAAI,GAAG,QAAQ,kBAAkB,GAAG;AAChC,iBAAO,qBAAqB;AAAA,QAChC;AACA,eAAO;AAAA,MACX;AACA,MAAAA,YAAW,SAAS;AAIpB,eAAS,GAAG,OAAO;AACf,YAAI;AACJ,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KACpB,MAAM,GAAG,UAAU,KAAK,MACvB,GAAG,OAAO,UAAU,OAAO,KAAK,cAAc,GAAG,UAAU,OAAO,OAClE,GAAG,OAAO,UAAU,QAAQ,KAAK,GAAG,UAAU,UAAU,QAAQ,OAChE,GAAG,QAAQ,UAAU,IAAI,KAAK,GAAG,OAAO,UAAU,IAAI,KAAK,GAAG,UAAU,UAAU,IAAI,OACtF,GAAG,UAAU,UAAU,eAAe,KAAM,GAAG,QAAQ,KAAK,UAAU,qBAAqB,QAAQ,OAAO,SAAS,SAAS,GAAG,IAAI,OACnI,GAAG,OAAO,UAAU,MAAM,KAAK,GAAG,UAAU,UAAU,MAAM,OAC5D,GAAG,UAAU,UAAU,kBAAkB,KAAK,GAAG,WAAW,UAAU,oBAAoB,6BAA6B,EAAE;AAAA,MACrI;AACA,MAAAA,YAAW,KAAK;AAQhB,eAAS,OAAO,OAAO;AACnB,eAAO,GAAG,OAAO,MAAM,OAAO;AAAA,MAClC;AACA,MAAAA,YAAW,SAAS;AASpB,eAAS,iBAAiB,YAAY;AAClC,YAAI,GAAG,OAAO,WAAW,OAAO,GAAG;AAC/B,iBAAO,WAAW;AAAA,QACtB,WACS,cAAc,GAAG,WAAW,OAAO,GAAG;AAC3C,iBAAO,WAAW,QAAQ;AAAA,QAC9B,OACK;AACD,gBAAM,IAAI,MAAM,wBAAwB,OAAO,WAAW,OAAO,EAAE;AAAA,QACvE;AAAA,MACJ;AACA,MAAAA,YAAW,mBAAmB;AAAA,IAClC,GAAG,eAAe,aAAa,CAAC,EAAE;AAMlC,KAAC,SAAUC,UAAS;AAIhB,eAAS,OAAO,OAAO,YAAY,MAAM;AACrC,cAAM,SAAS,EAAE,OAAO,QAAQ;AAChC,YAAI,GAAG,QAAQ,IAAI,KAAK,KAAK,SAAS,GAAG;AACrC,iBAAO,YAAY;AAAA,QACvB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,SAAQ,SAAS;AAIjB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,GAAG,OAAO,UAAU,KAAK,MAAM,UAAU,YAAY,UAAa,GAAG,OAAO,UAAU,OAAO,MAAM,GAAG,OAAO,UAAU,OAAO;AAAA,MAClK;AACA,MAAAA,SAAQ,KAAK;AAAA,IACjB,GAAG,YAAY,UAAU,CAAC,EAAE;AAM5B,KAAC,SAAUC,WAAU;AAMjB,eAAS,QAAQ,OAAO,SAAS;AAC7B,eAAO,EAAE,OAAO,QAAQ;AAAA,MAC5B;AACA,MAAAA,UAAS,UAAU;AAMnB,eAAS,OAAO,UAAU,SAAS;AAC/B,eAAO,EAAE,OAAO,EAAE,OAAO,UAAU,KAAK,SAAS,GAAG,QAAQ;AAAA,MAChE;AACA,MAAAA,UAAS,SAAS;AAKlB,eAAS,IAAI,OAAO;AAChB,eAAO,EAAE,OAAO,SAAS,GAAG;AAAA,MAChC;AACA,MAAAA,UAAS,MAAM;AACf,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAC1B,GAAG,OAAO,UAAU,OAAO,KAC3B,MAAM,GAAG,UAAU,KAAK;AAAA,MACnC;AACA,MAAAA,UAAS,KAAK;AAAA,IAClB,GAAG,aAAa,WAAW,CAAC,EAAE;AAE9B,KAAC,SAAUC,mBAAkB;AACzB,eAAS,OAAO,OAAO,mBAAmB,aAAa;AACnD,cAAM,SAAS,EAAE,MAAM;AACvB,YAAI,sBAAsB,QAAW;AACjC,iBAAO,oBAAoB;AAAA,QAC/B;AACA,YAAI,gBAAgB,QAAW;AAC3B,iBAAO,cAAc;AAAA,QACzB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,kBAAiB,SAAS;AAC1B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,GAAG,OAAO,UAAU,KAAK,MAC1D,GAAG,QAAQ,UAAU,iBAAiB,KAAK,UAAU,sBAAsB,YAC3E,GAAG,OAAO,UAAU,WAAW,KAAK,UAAU,gBAAgB;AAAA,MACvE;AACA,MAAAA,kBAAiB,KAAK;AAAA,IAC1B,GAAG,qBAAqB,mBAAmB,CAAC,EAAE;AAE9C,KAAC,SAAUC,6BAA4B;AACnC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,OAAO,SAAS;AAAA,MAC9B;AACA,MAAAA,4BAA2B,KAAK;AAAA,IACpC,GAAG,+BAA+B,6BAA6B,CAAC,EAAE;AAElE,KAAC,SAAUC,oBAAmB;AAQ1B,eAAS,QAAQ,OAAO,SAAS,YAAY;AACzC,eAAO,EAAE,OAAO,SAAS,cAAc,WAAW;AAAA,MACtD;AACA,MAAAA,mBAAkB,UAAU;AAQ5B,eAAS,OAAO,UAAU,SAAS,YAAY;AAC3C,eAAO,EAAE,OAAO,EAAE,OAAO,UAAU,KAAK,SAAS,GAAG,SAAS,cAAc,WAAW;AAAA,MAC1F;AACA,MAAAA,mBAAkB,SAAS;AAO3B,eAAS,IAAI,OAAO,YAAY;AAC5B,eAAO,EAAE,OAAO,SAAS,IAAI,cAAc,WAAW;AAAA,MAC1D;AACA,MAAAA,mBAAkB,MAAM;AACxB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,SAAS,GAAG,SAAS,MAAM,iBAAiB,GAAG,UAAU,YAAY,KAAK,2BAA2B,GAAG,UAAU,YAAY;AAAA,MACzI;AACA,MAAAA,mBAAkB,KAAK;AAAA,IAC3B,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAMhD,KAAC,SAAUC,mBAAkB;AAIzB,eAAS,OAAO,cAAc,OAAO;AACjC,eAAO,EAAE,cAAc,MAAM;AAAA,MACjC;AACA,MAAAA,kBAAiB,SAAS;AAC1B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KACpB,wCAAwC,GAAG,UAAU,YAAY,KACjE,MAAM,QAAQ,UAAU,KAAK;AAAA,MACxC;AACA,MAAAA,kBAAiB,KAAK;AAAA,IAC1B,GAAG,qBAAqB,mBAAmB,CAAC,EAAE;AAE9C,KAAC,SAAUC,aAAY;AACnB,eAAS,OAAO,KAAK,SAAS,YAAY;AACtC,cAAM,SAAS;AAAA,UACX,MAAM;AAAA,UACN;AAAA,QACJ;AACA,YAAI,YAAY,WAAc,QAAQ,cAAc,UAAa,QAAQ,mBAAmB,SAAY;AACpG,iBAAO,UAAU;AAAA,QACrB;AACA,YAAI,eAAe,QAAW;AAC1B,iBAAO,eAAe;AAAA,QAC1B;AACA,eAAO;AAAA,MACX;AACA,MAAAA,YAAW,SAAS;AACpB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAa,UAAU,SAAS,YAAY,GAAG,OAAO,UAAU,GAAG,MAAM,UAAU,YAAY,WAChG,UAAU,QAAQ,cAAc,UAAa,GAAG,QAAQ,UAAU,QAAQ,SAAS,OAAO,UAAU,QAAQ,mBAAmB,UAAa,GAAG,QAAQ,UAAU,QAAQ,cAAc,QAAS,UAAU,iBAAiB,UAAa,2BAA2B,GAAG,UAAU,YAAY;AAAA,MACtS;AACA,MAAAA,YAAW,KAAK;AAAA,IACpB,GAAG,eAAe,aAAa,CAAC,EAAE;AAElC,KAAC,SAAUC,aAAY;AACnB,eAAS,OAAO,QAAQ,QAAQ,SAAS,YAAY;AACjD,cAAM,SAAS;AAAA,UACX,MAAM;AAAA,UACN;AAAA,UACA;AAAA,QACJ;AACA,YAAI,YAAY,WAAc,QAAQ,cAAc,UAAa,QAAQ,mBAAmB,SAAY;AACpG,iBAAO,UAAU;AAAA,QACrB;AACA,YAAI,eAAe,QAAW;AAC1B,iBAAO,eAAe;AAAA,QAC1B;AACA,eAAO;AAAA,MACX;AACA,MAAAA,YAAW,SAAS;AACpB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAa,UAAU,SAAS,YAAY,GAAG,OAAO,UAAU,MAAM,KAAK,GAAG,OAAO,UAAU,MAAM,MAAM,UAAU,YAAY,WAClI,UAAU,QAAQ,cAAc,UAAa,GAAG,QAAQ,UAAU,QAAQ,SAAS,OAAO,UAAU,QAAQ,mBAAmB,UAAa,GAAG,QAAQ,UAAU,QAAQ,cAAc,QAAS,UAAU,iBAAiB,UAAa,2BAA2B,GAAG,UAAU,YAAY;AAAA,MACtS;AACA,MAAAA,YAAW,KAAK;AAAA,IACpB,GAAG,eAAe,aAAa,CAAC,EAAE;AAElC,KAAC,SAAUC,aAAY;AACnB,eAAS,OAAO,KAAK,SAAS,YAAY;AACtC,cAAM,SAAS;AAAA,UACX,MAAM;AAAA,UACN;AAAA,QACJ;AACA,YAAI,YAAY,WAAc,QAAQ,cAAc,UAAa,QAAQ,sBAAsB,SAAY;AACvG,iBAAO,UAAU;AAAA,QACrB;AACA,YAAI,eAAe,QAAW;AAC1B,iBAAO,eAAe;AAAA,QAC1B;AACA,eAAO;AAAA,MACX;AACA,MAAAA,YAAW,SAAS;AACpB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAa,UAAU,SAAS,YAAY,GAAG,OAAO,UAAU,GAAG,MAAM,UAAU,YAAY,WAChG,UAAU,QAAQ,cAAc,UAAa,GAAG,QAAQ,UAAU,QAAQ,SAAS,OAAO,UAAU,QAAQ,sBAAsB,UAAa,GAAG,QAAQ,UAAU,QAAQ,iBAAiB,QAAS,UAAU,iBAAiB,UAAa,2BAA2B,GAAG,UAAU,YAAY;AAAA,MAC5S;AACA,MAAAA,YAAW,KAAK;AAAA,IACpB,GAAG,eAAe,aAAa,CAAC,EAAE;AAElC,KAAC,SAAUC,gBAAe;AACtB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cACF,UAAU,YAAY,UAAa,UAAU,oBAAoB,YACjE,UAAU,oBAAoB,UAAa,UAAU,gBAAgB,MAAM,CAAC,WAAW;AACpF,cAAI,GAAG,OAAO,OAAO,IAAI,GAAG;AACxB,mBAAO,WAAW,GAAG,MAAM,KAAK,WAAW,GAAG,MAAM,KAAK,WAAW,GAAG,MAAM;AAAA,UACjF,OACK;AACD,mBAAO,iBAAiB,GAAG,MAAM;AAAA,UACrC;AAAA,QACJ,CAAC;AAAA,MACT;AACA,MAAAA,eAAc,KAAK;AAAA,IACvB,GAAG,kBAAkB,gBAAgB,CAAC,EAAE;AACxC,IAAM,qBAAN,MAAyB;AAAA,MACrB,YAAY,OAAO,mBAAmB;AAClC,aAAK,QAAQ;AACb,aAAK,oBAAoB;AAAA,MAC7B;AAAA,MACA,OAAO,UAAU,SAAS,YAAY;AAClC,YAAI;AACJ,YAAI;AACJ,YAAI,eAAe,QAAW;AAC1B,iBAAO,SAAS,OAAO,UAAU,OAAO;AAAA,QAC5C,WACS,2BAA2B,GAAG,UAAU,GAAG;AAChD,eAAK;AACL,iBAAO,kBAAkB,OAAO,UAAU,SAAS,UAAU;AAAA,QACjE,OACK;AACD,eAAK,wBAAwB,KAAK,iBAAiB;AACnD,eAAK,KAAK,kBAAkB,OAAO,UAAU;AAC7C,iBAAO,kBAAkB,OAAO,UAAU,SAAS,EAAE;AAAA,QACzD;AACA,aAAK,MAAM,KAAK,IAAI;AACpB,YAAI,OAAO,QAAW;AAClB,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,MACA,QAAQ,OAAO,SAAS,YAAY;AAChC,YAAI;AACJ,YAAI;AACJ,YAAI,eAAe,QAAW;AAC1B,iBAAO,SAAS,QAAQ,OAAO,OAAO;AAAA,QAC1C,WACS,2BAA2B,GAAG,UAAU,GAAG;AAChD,eAAK;AACL,iBAAO,kBAAkB,QAAQ,OAAO,SAAS,UAAU;AAAA,QAC/D,OACK;AACD,eAAK,wBAAwB,KAAK,iBAAiB;AACnD,eAAK,KAAK,kBAAkB,OAAO,UAAU;AAC7C,iBAAO,kBAAkB,QAAQ,OAAO,SAAS,EAAE;AAAA,QACvD;AACA,aAAK,MAAM,KAAK,IAAI;AACpB,YAAI,OAAO,QAAW;AAClB,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,MACA,OAAO,OAAO,YAAY;AACtB,YAAI;AACJ,YAAI;AACJ,YAAI,eAAe,QAAW;AAC1B,iBAAO,SAAS,IAAI,KAAK;AAAA,QAC7B,WACS,2BAA2B,GAAG,UAAU,GAAG;AAChD,eAAK;AACL,iBAAO,kBAAkB,IAAI,OAAO,UAAU;AAAA,QAClD,OACK;AACD,eAAK,wBAAwB,KAAK,iBAAiB;AACnD,eAAK,KAAK,kBAAkB,OAAO,UAAU;AAC7C,iBAAO,kBAAkB,IAAI,OAAO,EAAE;AAAA,QAC1C;AACA,aAAK,MAAM,KAAK,IAAI;AACpB,YAAI,OAAO,QAAW;AAClB,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,MACA,IAAI,MAAM;AACN,aAAK,MAAM,KAAK,IAAI;AAAA,MACxB;AAAA,MACA,MAAM;AACF,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,QAAQ;AACJ,aAAK,MAAM,OAAO,GAAG,KAAK,MAAM,MAAM;AAAA,MAC1C;AAAA,MACA,wBAAwB,OAAO;AAC3B,YAAI,UAAU,QAAW;AACrB,gBAAM,IAAI,MAAM,kEAAkE;AAAA,QACtF;AAAA,MACJ;AAAA,IACJ;AAEA,KAAC,SAAUC,kBAAiB;AACxB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAC1B,MAAM,GAAG,UAAU,KAAK,KACxB,YAAY,UAAU,UAAU,OAAO,MACtC,UAAU,iBAAiB,WAC1B,iBAAiB,GAAG,UAAU,YAAY,KAAK,2BAA2B,GAAG,UAAU,YAAY;AAAA,MAChH;AACA,MAAAA,iBAAgB,KAAK;AAAA,IACzB,GAAG,oBAAoB,kBAAkB,CAAC,EAAE;AAI5C,IAAM,oBAAN,MAAwB;AAAA,MACpB,YAAY,aAAa;AACrB,aAAK,eAAe,gBAAgB,SAAY,uBAAO,OAAO,IAAI,IAAI;AACtE,aAAK,WAAW;AAChB,aAAK,QAAQ;AAAA,MACjB;AAAA,MACA,MAAM;AACF,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,OAAO;AACP,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,OAAO,gBAAgB,YAAY;AAC/B,YAAI;AACJ,YAAI,2BAA2B,GAAG,cAAc,GAAG;AAC/C,eAAK;AAAA,QACT,OACK;AACD,eAAK,KAAK,OAAO;AACjB,uBAAa;AAAA,QACjB;AACA,YAAI,KAAK,aAAa,EAAE,MAAM,QAAW;AACrC,gBAAM,IAAI,MAAM,MAAM,EAAE,qBAAqB;AAAA,QACjD;AACA,YAAI,eAAe,QAAW;AAC1B,gBAAM,IAAI,MAAM,iCAAiC,EAAE,EAAE;AAAA,QACzD;AACA,aAAK,aAAa,EAAE,IAAI;AACxB,aAAK;AACL,eAAO;AAAA,MACX;AAAA,MACA,SAAS;AACL,aAAK;AACL,eAAO,KAAK,SAAS,SAAS;AAAA,MAClC;AAAA,IACJ;AAIO,IAAM,kBAAN,MAAsB;AAAA,MACzB,YAAY,eAAe;AACvB,aAAK,mBAAmB,uBAAO,OAAO,IAAI;AAC1C,YAAI,kBAAkB,QAAW;AAC7B,eAAK,iBAAiB;AACtB,cAAI,cAAc,iBAAiB;AAC/B,iBAAK,qBAAqB,IAAI,kBAAkB,cAAc,iBAAiB;AAC/E,0BAAc,oBAAoB,KAAK,mBAAmB,IAAI;AAC9D,0BAAc,gBAAgB,QAAQ,CAAC,WAAW;AAC9C,kBAAI,iBAAiB,GAAG,MAAM,GAAG;AAC7B,sBAAM,iBAAiB,IAAI,mBAAmB,OAAO,OAAO,KAAK,kBAAkB;AACnF,qBAAK,iBAAiB,OAAO,aAAa,GAAG,IAAI;AAAA,cACrD;AAAA,YACJ,CAAC;AAAA,UACL,WACS,cAAc,SAAS;AAC5B,mBAAO,KAAK,cAAc,OAAO,EAAE,QAAQ,CAAC,QAAQ;AAChD,oBAAM,iBAAiB,IAAI,mBAAmB,cAAc,QAAQ,GAAG,CAAC;AACxE,mBAAK,iBAAiB,GAAG,IAAI;AAAA,YACjC,CAAC;AAAA,UACL;AAAA,QACJ,OACK;AACD,eAAK,iBAAiB,CAAC;AAAA,QAC3B;AAAA,MACJ;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,OAAO;AACP,aAAK,oBAAoB;AACzB,YAAI,KAAK,uBAAuB,QAAW;AACvC,cAAI,KAAK,mBAAmB,SAAS,GAAG;AACpC,iBAAK,eAAe,oBAAoB;AAAA,UAC5C,OACK;AACD,iBAAK,eAAe,oBAAoB,KAAK,mBAAmB,IAAI;AAAA,UACxE;AAAA,QACJ;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,kBAAkB,KAAK;AACnB,YAAI,wCAAwC,GAAG,GAAG,GAAG;AACjD,eAAK,oBAAoB;AACzB,cAAI,KAAK,eAAe,oBAAoB,QAAW;AACnD,kBAAM,IAAI,MAAM,wDAAwD;AAAA,UAC5E;AACA,gBAAM,eAAe,EAAE,KAAK,IAAI,KAAK,SAAS,IAAI,QAAQ;AAC1D,cAAI,SAAS,KAAK,iBAAiB,aAAa,GAAG;AACnD,cAAI,CAAC,QAAQ;AACT,kBAAM,QAAQ,CAAC;AACf,kBAAM,mBAAmB;AAAA,cACrB;AAAA,cACA;AAAA,YACJ;AACA,iBAAK,eAAe,gBAAgB,KAAK,gBAAgB;AACzD,qBAAS,IAAI,mBAAmB,OAAO,KAAK,kBAAkB;AAC9D,iBAAK,iBAAiB,aAAa,GAAG,IAAI;AAAA,UAC9C;AACA,iBAAO;AAAA,QACX,OACK;AACD,eAAK,YAAY;AACjB,cAAI,KAAK,eAAe,YAAY,QAAW;AAC3C,kBAAM,IAAI,MAAM,gEAAgE;AAAA,UACpF;AACA,cAAI,SAAS,KAAK,iBAAiB,GAAG;AACtC,cAAI,CAAC,QAAQ;AACT,kBAAM,QAAQ,CAAC;AACf,iBAAK,eAAe,QAAQ,GAAG,IAAI;AACnC,qBAAS,IAAI,mBAAmB,KAAK;AACrC,iBAAK,iBAAiB,GAAG,IAAI;AAAA,UACjC;AACA,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,MACA,sBAAsB;AAClB,YAAI,KAAK,eAAe,oBAAoB,UAAa,KAAK,eAAe,YAAY,QAAW;AAChG,eAAK,qBAAqB,IAAI,kBAAkB;AAChD,eAAK,eAAe,kBAAkB,CAAC;AACvC,eAAK,eAAe,oBAAoB,KAAK,mBAAmB,IAAI;AAAA,QACxE;AAAA,MACJ;AAAA,MACA,cAAc;AACV,YAAI,KAAK,eAAe,oBAAoB,UAAa,KAAK,eAAe,YAAY,QAAW;AAChG,eAAK,eAAe,UAAU,uBAAO,OAAO,IAAI;AAAA,QACpD;AAAA,MACJ;AAAA,MACA,WAAW,KAAK,qBAAqB,SAAS;AAC1C,aAAK,oBAAoB;AACzB,YAAI,KAAK,eAAe,oBAAoB,QAAW;AACnD,gBAAM,IAAI,MAAM,wDAAwD;AAAA,QAC5E;AACA,YAAI;AACJ,YAAI,iBAAiB,GAAG,mBAAmB,KAAK,2BAA2B,GAAG,mBAAmB,GAAG;AAChG,uBAAa;AAAA,QACjB,OACK;AACD,oBAAU;AAAA,QACd;AACA,YAAI;AACJ,YAAI;AACJ,YAAI,eAAe,QAAW;AAC1B,sBAAY,WAAW,OAAO,KAAK,OAAO;AAAA,QAC9C,OACK;AACD,eAAK,2BAA2B,GAAG,UAAU,IAAI,aAAa,KAAK,mBAAmB,OAAO,UAAU;AACvG,sBAAY,WAAW,OAAO,KAAK,SAAS,EAAE;AAAA,QAClD;AACA,aAAK,eAAe,gBAAgB,KAAK,SAAS;AAClD,YAAI,OAAO,QAAW;AAClB,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,MACA,WAAW,QAAQ,QAAQ,qBAAqB,SAAS;AACrD,aAAK,oBAAoB;AACzB,YAAI,KAAK,eAAe,oBAAoB,QAAW;AACnD,gBAAM,IAAI,MAAM,wDAAwD;AAAA,QAC5E;AACA,YAAI;AACJ,YAAI,iBAAiB,GAAG,mBAAmB,KAAK,2BAA2B,GAAG,mBAAmB,GAAG;AAChG,uBAAa;AAAA,QACjB,OACK;AACD,oBAAU;AAAA,QACd;AACA,YAAI;AACJ,YAAI;AACJ,YAAI,eAAe,QAAW;AAC1B,sBAAY,WAAW,OAAO,QAAQ,QAAQ,OAAO;AAAA,QACzD,OACK;AACD,eAAK,2BAA2B,GAAG,UAAU,IAAI,aAAa,KAAK,mBAAmB,OAAO,UAAU;AACvG,sBAAY,WAAW,OAAO,QAAQ,QAAQ,SAAS,EAAE;AAAA,QAC7D;AACA,aAAK,eAAe,gBAAgB,KAAK,SAAS;AAClD,YAAI,OAAO,QAAW;AAClB,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,MACA,WAAW,KAAK,qBAAqB,SAAS;AAC1C,aAAK,oBAAoB;AACzB,YAAI,KAAK,eAAe,oBAAoB,QAAW;AACnD,gBAAM,IAAI,MAAM,wDAAwD;AAAA,QAC5E;AACA,YAAI;AACJ,YAAI,iBAAiB,GAAG,mBAAmB,KAAK,2BAA2B,GAAG,mBAAmB,GAAG;AAChG,uBAAa;AAAA,QACjB,OACK;AACD,oBAAU;AAAA,QACd;AACA,YAAI;AACJ,YAAI;AACJ,YAAI,eAAe,QAAW;AAC1B,sBAAY,WAAW,OAAO,KAAK,OAAO;AAAA,QAC9C,OACK;AACD,eAAK,2BAA2B,GAAG,UAAU,IAAI,aAAa,KAAK,mBAAmB,OAAO,UAAU;AACvG,sBAAY,WAAW,OAAO,KAAK,SAAS,EAAE;AAAA,QAClD;AACA,aAAK,eAAe,gBAAgB,KAAK,SAAS;AAClD,YAAI,OAAO,QAAW;AAClB,iBAAO;AAAA,QACX;AAAA,MACJ;AAAA,IACJ;AAMA,KAAC,SAAUC,yBAAwB;AAK/B,eAAS,OAAO,KAAK;AACjB,eAAO,EAAE,IAAI;AAAA,MACjB;AACA,MAAAA,wBAAuB,SAAS;AAIhC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,GAAG,OAAO,UAAU,GAAG;AAAA,MAC3D;AACA,MAAAA,wBAAuB,KAAK;AAAA,IAChC,GAAG,2BAA2B,yBAAyB,CAAC,EAAE;AAM1D,KAAC,SAAUC,kCAAiC;AAMxC,eAAS,OAAO,KAAK,SAAS;AAC1B,eAAO,EAAE,KAAK,QAAQ;AAAA,MAC1B;AACA,MAAAA,iCAAgC,SAAS;AAIzC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,GAAG,OAAO,UAAU,GAAG,KAAK,GAAG,QAAQ,UAAU,OAAO;AAAA,MAC5F;AACA,MAAAA,iCAAgC,KAAK;AAAA,IACzC,GAAG,oCAAoC,kCAAkC,CAAC,EAAE;AAM5E,KAAC,SAAUC,0CAAyC;AAMhD,eAAS,OAAO,KAAK,SAAS;AAC1B,eAAO,EAAE,KAAK,QAAQ;AAAA,MAC1B;AACA,MAAAA,yCAAwC,SAAS;AAIjD,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,GAAG,OAAO,UAAU,GAAG,MAAM,UAAU,YAAY,QAAQ,GAAG,QAAQ,UAAU,OAAO;AAAA,MAC3H;AACA,MAAAA,yCAAwC,KAAK;AAAA,IACjD,GAAG,4CAA4C,0CAA0C,CAAC,EAAE;AAM5F,KAAC,SAAUC,eAAc;AACrB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,aAAa;AAC1B,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,UAAU;AACvB,MAAAA,cAAa,eAAe;AAC5B,MAAAA,cAAa,IAAI;AACjB,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,MAAM;AAInB,MAAAA,cAAa,IAAI;AAIjB,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,aAAa;AAC1B,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,YAAY;AACzB,MAAAA,cAAa,YAAY;AACzB,MAAAA,cAAa,KAAK;AAClB,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,aAAa;AAC1B,MAAAA,cAAa,UAAU;AACvB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,aAAa;AAC1B,MAAAA,cAAa,kBAAkB;AAC/B,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,QAAQ;AACrB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,WAAW;AACxB,MAAAA,cAAa,WAAW;AACxB,MAAAA,cAAa,aAAa;AAC1B,MAAAA,cAAa,eAAe;AAI5B,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,QAAQ;AACrB,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,YAAY;AACzB,MAAAA,cAAa,aAAa;AAC1B,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,IAAI;AACjB,MAAAA,cAAa,QAAQ;AACrB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,OAAO;AACpB,MAAAA,cAAa,QAAQ;AACrB,MAAAA,cAAa,YAAY;AACzB,MAAAA,cAAa,cAAc;AAC3B,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,QAAQ;AACrB,MAAAA,cAAa,aAAa;AAC1B,MAAAA,cAAa,kBAAkB;AAC/B,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,cAAc;AAC3B,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,MAAM;AACnB,MAAAA,cAAa,OAAO;AAAA,IACxB,GAAG,iBAAiB,eAAe,CAAC,EAAE;AAMtC,KAAC,SAAUC,mBAAkB;AAQzB,eAAS,OAAO,KAAK,YAAY,SAAS,MAAM;AAC5C,eAAO,EAAE,KAAK,YAAY,SAAS,KAAK;AAAA,MAC5C;AACA,MAAAA,kBAAiB,SAAS;AAI1B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,GAAG,OAAO,UAAU,GAAG,KAAK,GAAG,OAAO,UAAU,UAAU,KAAK,GAAG,QAAQ,UAAU,OAAO,KAAK,GAAG,OAAO,UAAU,IAAI;AAAA,MAC5J;AACA,MAAAA,kBAAiB,KAAK;AAAA,IAC1B,GAAG,qBAAqB,mBAAmB,CAAC,EAAE;AAS9C,KAAC,SAAUC,aAAY;AAInB,MAAAA,YAAW,YAAY;AAIvB,MAAAA,YAAW,WAAW;AAItB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cAAcA,YAAW,aAAa,cAAcA,YAAW;AAAA,MAC1E;AACA,MAAAA,YAAW,KAAK;AAAA,IACpB,GAAG,eAAe,aAAa,CAAC,EAAE;AAElC,KAAC,SAAUC,gBAAe;AAItB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,KAAK,KAAK,WAAW,GAAG,UAAU,IAAI,KAAK,GAAG,OAAO,UAAU,KAAK;AAAA,MAChG;AACA,MAAAA,eAAc,KAAK;AAAA,IACvB,GAAG,kBAAkB,gBAAgB,CAAC,EAAE;AAKxC,KAAC,SAAUC,qBAAoB;AAC3B,MAAAA,oBAAmB,OAAO;AAC1B,MAAAA,oBAAmB,SAAS;AAC5B,MAAAA,oBAAmB,WAAW;AAC9B,MAAAA,oBAAmB,cAAc;AACjC,MAAAA,oBAAmB,QAAQ;AAC3B,MAAAA,oBAAmB,WAAW;AAC9B,MAAAA,oBAAmB,QAAQ;AAC3B,MAAAA,oBAAmB,YAAY;AAC/B,MAAAA,oBAAmB,SAAS;AAC5B,MAAAA,oBAAmB,WAAW;AAC9B,MAAAA,oBAAmB,OAAO;AAC1B,MAAAA,oBAAmB,QAAQ;AAC3B,MAAAA,oBAAmB,OAAO;AAC1B,MAAAA,oBAAmB,UAAU;AAC7B,MAAAA,oBAAmB,UAAU;AAC7B,MAAAA,oBAAmB,QAAQ;AAC3B,MAAAA,oBAAmB,OAAO;AAC1B,MAAAA,oBAAmB,YAAY;AAC/B,MAAAA,oBAAmB,SAAS;AAC5B,MAAAA,oBAAmB,aAAa;AAChC,MAAAA,oBAAmB,WAAW;AAC9B,MAAAA,oBAAmB,SAAS;AAC5B,MAAAA,oBAAmB,QAAQ;AAC3B,MAAAA,oBAAmB,WAAW;AAC9B,MAAAA,oBAAmB,gBAAgB;AAAA,IACvC,GAAG,uBAAuB,qBAAqB,CAAC,EAAE;AAMlD,KAAC,SAAUC,mBAAkB;AAIzB,MAAAA,kBAAiB,YAAY;AAW7B,MAAAA,kBAAiB,UAAU;AAAA,IAC/B,GAAG,qBAAqB,mBAAmB,CAAC,EAAE;AAQ9C,KAAC,SAAUC,oBAAmB;AAI1B,MAAAA,mBAAkB,aAAa;AAAA,IACnC,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAOhD,KAAC,SAAUC,oBAAmB;AAI1B,eAAS,OAAO,SAAS,QAAQ,SAAS;AACtC,eAAO,EAAE,SAAS,QAAQ,QAAQ;AAAA,MACtC;AACA,MAAAA,mBAAkB,SAAS;AAI3B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAa,GAAG,OAAO,UAAU,OAAO,KAAK,MAAM,GAAG,UAAU,MAAM,KAAK,MAAM,GAAG,UAAU,OAAO;AAAA,MAChH;AACA,MAAAA,mBAAkB,KAAK;AAAA,IAC3B,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAQhD,KAAC,SAAUC,iBAAgB;AAQvB,MAAAA,gBAAe,OAAO;AAUtB,MAAAA,gBAAe,oBAAoB;AAAA,IACvC,GAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAQ1C,KAAC,SAAUC,YAAW;AAKlB,MAAAA,WAAU,UAAU;AAOpB,MAAAA,WAAU,QAAQ;AAAA,IACtB,GAAG,cAAc,YAAY,CAAC,EAAE;AAEhC,KAAC,SAAUC,6BAA4B;AACnC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cAAc,GAAG,OAAO,UAAU,MAAM,KAAK,UAAU,WAAW,YACpE,GAAG,OAAO,UAAU,WAAW,KAAK,UAAU,gBAAgB;AAAA,MACvE;AACA,MAAAA,4BAA2B,KAAK;AAAA,IACpC,GAAG,+BAA+B,6BAA6B,CAAC,EAAE;AAMlE,KAAC,SAAUC,iBAAgB;AAKvB,eAAS,OAAO,OAAO;AACnB,eAAO,EAAE,MAAM;AAAA,MACnB;AACA,MAAAA,gBAAe,SAAS;AAAA,IAC5B,GAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAM1C,KAAC,SAAUC,iBAAgB;AAOvB,eAAS,OAAO,OAAO,cAAc;AACjC,eAAO,EAAE,OAAO,QAAQ,QAAQ,CAAC,GAAG,cAAc,CAAC,CAAC,aAAa;AAAA,MACrE;AACA,MAAAA,gBAAe,SAAS;AAAA,IAC5B,GAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAE1C,KAAC,SAAUC,eAAc;AAMrB,eAAS,cAAc,WAAW;AAC9B,eAAO,UAAU,QAAQ,yBAAyB,MAAM;AAAA,MAC5D;AACA,MAAAA,cAAa,gBAAgB;AAI7B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,OAAO,SAAS,KAAM,GAAG,cAAc,SAAS,KAAK,GAAG,OAAO,UAAU,QAAQ,KAAK,GAAG,OAAO,UAAU,KAAK;AAAA,MAC7H;AACA,MAAAA,cAAa,KAAK;AAAA,IACtB,GAAG,iBAAiB,eAAe,CAAC,EAAE;AAEtC,KAAC,SAAUC,QAAO;AAId,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,CAAC,CAAC,aAAa,GAAG,cAAc,SAAS,MAAM,cAAc,GAAG,UAAU,QAAQ,KACrF,aAAa,GAAG,UAAU,QAAQ,KAClC,GAAG,WAAW,UAAU,UAAU,aAAa,EAAE,OAAO,MAAM,UAAU,UAAa,MAAM,GAAG,MAAM,KAAK;AAAA,MACjH;AACA,MAAAA,OAAM,KAAK;AAAA,IACf,GAAG,UAAU,QAAQ,CAAC,EAAE;AAMxB,KAAC,SAAUC,uBAAsB;AAO7B,eAAS,OAAO,OAAO,eAAe;AAClC,eAAO,gBAAgB,EAAE,OAAO,cAAc,IAAI,EAAE,MAAM;AAAA,MAC9D;AACA,MAAAA,sBAAqB,SAAS;AAAA,IAClC,GAAG,yBAAyB,uBAAuB,CAAC,EAAE;AAMtD,KAAC,SAAUC,uBAAsB;AAC7B,eAAS,OAAO,OAAO,kBAAkB,YAAY;AACjD,cAAM,SAAS,EAAE,MAAM;AACvB,YAAI,GAAG,QAAQ,aAAa,GAAG;AAC3B,iBAAO,gBAAgB;AAAA,QAC3B;AACA,YAAI,GAAG,QAAQ,UAAU,GAAG;AACxB,iBAAO,aAAa;AAAA,QACxB,OACK;AACD,iBAAO,aAAa,CAAC;AAAA,QACzB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,sBAAqB,SAAS;AAAA,IAClC,GAAG,yBAAyB,uBAAuB,CAAC,EAAE;AAKtD,KAAC,SAAUC,wBAAuB;AAI9B,MAAAA,uBAAsB,OAAO;AAI7B,MAAAA,uBAAsB,OAAO;AAI7B,MAAAA,uBAAsB,QAAQ;AAAA,IAClC,GAAG,0BAA0B,wBAAwB,CAAC,EAAE;AAMxD,KAAC,SAAUC,oBAAmB;AAM1B,eAAS,OAAO,OAAO,MAAM;AACzB,cAAM,SAAS,EAAE,MAAM;AACvB,YAAI,GAAG,OAAO,IAAI,GAAG;AACjB,iBAAO,OAAO;AAAA,QAClB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,mBAAkB,SAAS;AAAA,IAC/B,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAKhD,KAAC,SAAUC,aAAY;AACnB,MAAAA,YAAW,OAAO;AAClB,MAAAA,YAAW,SAAS;AACpB,MAAAA,YAAW,YAAY;AACvB,MAAAA,YAAW,UAAU;AACrB,MAAAA,YAAW,QAAQ;AACnB,MAAAA,YAAW,SAAS;AACpB,MAAAA,YAAW,WAAW;AACtB,MAAAA,YAAW,QAAQ;AACnB,MAAAA,YAAW,cAAc;AACzB,MAAAA,YAAW,OAAO;AAClB,MAAAA,YAAW,YAAY;AACvB,MAAAA,YAAW,WAAW;AACtB,MAAAA,YAAW,WAAW;AACtB,MAAAA,YAAW,WAAW;AACtB,MAAAA,YAAW,SAAS;AACpB,MAAAA,YAAW,SAAS;AACpB,MAAAA,YAAW,UAAU;AACrB,MAAAA,YAAW,QAAQ;AACnB,MAAAA,YAAW,SAAS;AACpB,MAAAA,YAAW,MAAM;AACjB,MAAAA,YAAW,OAAO;AAClB,MAAAA,YAAW,aAAa;AACxB,MAAAA,YAAW,SAAS;AACpB,MAAAA,YAAW,QAAQ;AACnB,MAAAA,YAAW,WAAW;AACtB,MAAAA,YAAW,gBAAgB;AAAA,IAC/B,GAAG,eAAe,aAAa,CAAC,EAAE;AAOlC,KAAC,SAAUC,YAAW;AAIlB,MAAAA,WAAU,aAAa;AAAA,IAC3B,GAAG,cAAc,YAAY,CAAC,EAAE;AAEhC,KAAC,SAAUC,oBAAmB;AAU1B,eAAS,OAAO,MAAM,MAAM,OAAO,KAAK,eAAe;AACnD,cAAM,SAAS;AAAA,UACX;AAAA,UACA;AAAA,UACA,UAAU,EAAE,KAAK,MAAM;AAAA,QAC3B;AACA,YAAI,eAAe;AACf,iBAAO,gBAAgB;AAAA,QAC3B;AACA,eAAO;AAAA,MACX;AACA,MAAAA,mBAAkB,SAAS;AAAA,IAC/B,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAEhD,KAAC,SAAUC,kBAAiB;AAUxB,eAAS,OAAO,MAAM,MAAM,KAAK,OAAO;AACpC,eAAO,UAAU,SACX,EAAE,MAAM,MAAM,UAAU,EAAE,KAAK,MAAM,EAAE,IACvC,EAAE,MAAM,MAAM,UAAU,EAAE,IAAI,EAAE;AAAA,MAC1C;AACA,MAAAA,iBAAgB,SAAS;AAAA,IAC7B,GAAG,oBAAoB,kBAAkB,CAAC,EAAE;AAE5C,KAAC,SAAUC,iBAAgB;AAWvB,eAAS,OAAO,MAAM,QAAQ,MAAM,OAAO,gBAAgB,UAAU;AACjE,cAAM,SAAS;AAAA,UACX;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACJ;AACA,YAAI,aAAa,QAAW;AACxB,iBAAO,WAAW;AAAA,QACtB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,gBAAe,SAAS;AAIxB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aACH,GAAG,OAAO,UAAU,IAAI,KAAK,GAAG,OAAO,UAAU,IAAI,KACrD,MAAM,GAAG,UAAU,KAAK,KAAK,MAAM,GAAG,UAAU,cAAc,MAC7D,UAAU,WAAW,UAAa,GAAG,OAAO,UAAU,MAAM,OAC5D,UAAU,eAAe,UAAa,GAAG,QAAQ,UAAU,UAAU,OACrE,UAAU,aAAa,UAAa,MAAM,QAAQ,UAAU,QAAQ,OACpE,UAAU,SAAS,UAAa,MAAM,QAAQ,UAAU,IAAI;AAAA,MACrE;AACA,MAAAA,gBAAe,KAAK;AAAA,IACxB,GAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAK1C,KAAC,SAAUC,iBAAgB;AAIvB,MAAAA,gBAAe,QAAQ;AAIvB,MAAAA,gBAAe,WAAW;AAI1B,MAAAA,gBAAe,WAAW;AAY1B,MAAAA,gBAAe,kBAAkB;AAWjC,MAAAA,gBAAe,iBAAiB;AAahC,MAAAA,gBAAe,eAAe;AAa9B,MAAAA,gBAAe,kBAAkB;AAMjC,MAAAA,gBAAe,SAAS;AAIxB,MAAAA,gBAAe,wBAAwB;AASvC,MAAAA,gBAAe,eAAe;AAO9B,MAAAA,gBAAe,WAAW;AAAA,IAC9B,GAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAO1C,KAAC,SAAUC,wBAAuB;AAI9B,MAAAA,uBAAsB,UAAU;AAOhC,MAAAA,uBAAsB,YAAY;AAAA,IACtC,GAAG,0BAA0B,wBAAwB,CAAC,EAAE;AAMxD,KAAC,SAAUC,oBAAmB;AAI1B,eAAS,OAAO,aAAa,MAAM,aAAa;AAC5C,cAAM,SAAS,EAAE,YAAY;AAC7B,YAAI,SAAS,UAAa,SAAS,MAAM;AACrC,iBAAO,OAAO;AAAA,QAClB;AACA,YAAI,gBAAgB,UAAa,gBAAgB,MAAM;AACnD,iBAAO,cAAc;AAAA,QACzB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,mBAAkB,SAAS;AAI3B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,GAAG,WAAW,UAAU,aAAa,WAAW,EAAE,MAC1E,UAAU,SAAS,UAAa,GAAG,WAAW,UAAU,MAAM,GAAG,MAAM,OACvE,UAAU,gBAAgB,UAAa,UAAU,gBAAgB,sBAAsB,WAAW,UAAU,gBAAgB,sBAAsB;AAAA,MAC9J;AACA,MAAAA,mBAAkB,KAAK;AAAA,IAC3B,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAOhD,KAAC,SAAUC,gBAAe;AAItB,MAAAA,eAAc,eAAe;AAI7B,eAAS,GAAG,OAAO;AACf,eAAO,GAAG,QAAQ,KAAK,KAAK,UAAUA,eAAc;AAAA,MACxD;AACA,MAAAA,eAAc,KAAK;AAAA,IACvB,GAAG,kBAAkB,gBAAgB,CAAC,EAAE;AAExC,KAAC,SAAUC,aAAY;AACnB,eAAS,OAAO,OAAO,qBAAqB,MAAM;AAC9C,cAAM,SAAS,EAAE,MAAM;AACvB,YAAI,YAAY;AAChB,YAAI,OAAO,wBAAwB,UAAU;AACzC,sBAAY;AACZ,iBAAO,OAAO;AAAA,QAClB,WACS,QAAQ,GAAG,mBAAmB,GAAG;AACtC,iBAAO,UAAU;AAAA,QACrB,OACK;AACD,iBAAO,OAAO;AAAA,QAClB;AACA,YAAI,aAAa,SAAS,QAAW;AACjC,iBAAO,OAAO;AAAA,QAClB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,YAAW,SAAS;AACpB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAa,GAAG,OAAO,UAAU,KAAK,MACxC,UAAU,gBAAgB,UAAa,GAAG,WAAW,UAAU,aAAa,WAAW,EAAE,OACzF,UAAU,SAAS,UAAa,GAAG,OAAO,UAAU,IAAI,OACxD,UAAU,SAAS,UAAa,UAAU,YAAY,YACtD,UAAU,YAAY,UAAa,QAAQ,GAAG,UAAU,OAAO,OAC/D,UAAU,gBAAgB,UAAa,GAAG,QAAQ,UAAU,WAAW,OACvE,UAAU,SAAS,UAAa,cAAc,GAAG,UAAU,IAAI,OAC/D,UAAU,SAAS,UAAa,GAAG,WAAW,UAAU,MAAM,cAAc,EAAE;AAAA,MACvF;AACA,MAAAA,YAAW,KAAK;AAAA,IACpB,GAAG,eAAe,aAAa,CAAC,EAAE;AAMlC,KAAC,SAAUC,WAAU;AAIjB,eAAS,OAAO,OAAO,MAAM;AACzB,cAAM,SAAS,EAAE,MAAM;AACvB,YAAI,GAAG,QAAQ,IAAI,GAAG;AAClB,iBAAO,OAAO;AAAA,QAClB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,UAAS,SAAS;AAIlB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,MAAM,GAAG,UAAU,KAAK,MAAM,GAAG,UAAU,UAAU,OAAO,KAAK,QAAQ,GAAG,UAAU,OAAO;AAAA,MACjI;AACA,MAAAA,UAAS,KAAK;AAAA,IAClB,GAAG,aAAa,WAAW,CAAC,EAAE;AAM9B,KAAC,SAAUC,oBAAmB;AAI1B,eAAS,OAAO,SAAS,cAAc;AACnC,eAAO,EAAE,SAAS,aAAa;AAAA,MACnC;AACA,MAAAA,mBAAkB,SAAS;AAI3B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,GAAG,SAAS,UAAU,OAAO,KAAK,GAAG,QAAQ,UAAU,YAAY;AAAA,MACvG;AACA,MAAAA,mBAAkB,KAAK;AAAA,IAC3B,GAAG,sBAAsB,oBAAoB,CAAC,EAAE;AAMhD,KAAC,SAAUC,eAAc;AAIrB,eAAS,OAAO,OAAO,QAAQ,MAAM;AACjC,eAAO,EAAE,OAAO,QAAQ,KAAK;AAAA,MACjC;AACA,MAAAA,cAAa,SAAS;AAItB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,MAAM,GAAG,UAAU,KAAK,MAAM,GAAG,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,UAAU,MAAM;AAAA,MAC9H;AACA,MAAAA,cAAa,KAAK;AAAA,IACtB,GAAG,iBAAiB,eAAe,CAAC,EAAE;AAMtC,KAAC,SAAUC,iBAAgB;AAMvB,eAAS,OAAO,OAAO,QAAQ;AAC3B,eAAO,EAAE,OAAO,OAAO;AAAA,MAC3B;AACA,MAAAA,gBAAe,SAAS;AACxB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,MAAM,GAAG,UAAU,KAAK,MAAM,UAAU,WAAW,UAAaA,gBAAe,GAAG,UAAU,MAAM;AAAA,MAC5I;AACA,MAAAA,gBAAe,KAAK;AAAA,IACxB,GAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAS1C,KAAC,SAAUC,qBAAoB;AAC3B,MAAAA,oBAAmB,WAAW,IAAI;AAKlC,MAAAA,oBAAmB,MAAM,IAAI;AAC7B,MAAAA,oBAAmB,OAAO,IAAI;AAC9B,MAAAA,oBAAmB,MAAM,IAAI;AAC7B,MAAAA,oBAAmB,WAAW,IAAI;AAClC,MAAAA,oBAAmB,QAAQ,IAAI;AAC/B,MAAAA,oBAAmB,eAAe,IAAI;AACtC,MAAAA,oBAAmB,WAAW,IAAI;AAClC,MAAAA,oBAAmB,UAAU,IAAI;AACjC,MAAAA,oBAAmB,UAAU,IAAI;AACjC,MAAAA,oBAAmB,YAAY,IAAI;AACnC,MAAAA,oBAAmB,OAAO,IAAI;AAC9B,MAAAA,oBAAmB,UAAU,IAAI;AACjC,MAAAA,oBAAmB,QAAQ,IAAI;AAC/B,MAAAA,oBAAmB,OAAO,IAAI;AAC9B,MAAAA,oBAAmB,SAAS,IAAI;AAChC,MAAAA,oBAAmB,UAAU,IAAI;AACjC,MAAAA,oBAAmB,SAAS,IAAI;AAChC,MAAAA,oBAAmB,QAAQ,IAAI;AAC/B,MAAAA,oBAAmB,QAAQ,IAAI;AAC/B,MAAAA,oBAAmB,QAAQ,IAAI;AAC/B,MAAAA,oBAAmB,UAAU,IAAI;AAIjC,MAAAA,oBAAmB,WAAW,IAAI;AAIlC,MAAAA,oBAAmB,OAAO,IAAI;AAAA,IAClC,GAAG,uBAAuB,qBAAqB,CAAC,EAAE;AASlD,KAAC,SAAUC,yBAAwB;AAC/B,MAAAA,wBAAuB,aAAa,IAAI;AACxC,MAAAA,wBAAuB,YAAY,IAAI;AACvC,MAAAA,wBAAuB,UAAU,IAAI;AACrC,MAAAA,wBAAuB,QAAQ,IAAI;AACnC,MAAAA,wBAAuB,YAAY,IAAI;AACvC,MAAAA,wBAAuB,UAAU,IAAI;AACrC,MAAAA,wBAAuB,OAAO,IAAI;AAClC,MAAAA,wBAAuB,cAAc,IAAI;AACzC,MAAAA,wBAAuB,eAAe,IAAI;AAC1C,MAAAA,wBAAuB,gBAAgB,IAAI;AAAA,IAC/C,GAAG,2BAA2B,yBAAyB,CAAC,EAAE;AAK1D,KAAC,SAAUC,iBAAgB;AACvB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,MAAM,UAAU,aAAa,UAAa,OAAO,UAAU,aAAa,aACrG,MAAM,QAAQ,UAAU,IAAI,MAAM,UAAU,KAAK,WAAW,KAAK,OAAO,UAAU,KAAK,CAAC,MAAM;AAAA,MACtG;AACA,MAAAA,gBAAe,KAAK;AAAA,IACxB,GAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAO1C,KAAC,SAAUC,kBAAiB;AAIxB,eAAS,OAAO,OAAO,MAAM;AACzB,eAAO,EAAE,OAAO,KAAK;AAAA,MACzB;AACA,MAAAA,iBAAgB,SAAS;AACzB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cAAc,UAAa,cAAc,QAAQ,MAAM,GAAG,UAAU,KAAK,KAAK,GAAG,OAAO,UAAU,IAAI;AAAA,MACjH;AACA,MAAAA,iBAAgB,KAAK;AAAA,IACzB,GAAG,oBAAoB,kBAAkB,CAAC,EAAE;AAQ5C,KAAC,SAAUC,4BAA2B;AAIlC,eAAS,OAAO,OAAO,cAAc,qBAAqB;AACtD,eAAO,EAAE,OAAO,cAAc,oBAAoB;AAAA,MACtD;AACA,MAAAA,2BAA0B,SAAS;AACnC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cAAc,UAAa,cAAc,QAAQ,MAAM,GAAG,UAAU,KAAK,KAAK,GAAG,QAAQ,UAAU,mBAAmB,MACrH,GAAG,OAAO,UAAU,YAAY,KAAK,UAAU,iBAAiB;AAAA,MAC5E;AACA,MAAAA,2BAA0B,KAAK;AAAA,IACnC,GAAG,8BAA8B,4BAA4B,CAAC,EAAE;AAOhE,KAAC,SAAUC,mCAAkC;AAIzC,eAAS,OAAO,OAAO,YAAY;AAC/B,eAAO,EAAE,OAAO,WAAW;AAAA,MAC/B;AACA,MAAAA,kCAAiC,SAAS;AAC1C,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cAAc,UAAa,cAAc,QAAQ,MAAM,GAAG,UAAU,KAAK,MACxE,GAAG,OAAO,UAAU,UAAU,KAAK,UAAU,eAAe;AAAA,MACxE;AACA,MAAAA,kCAAiC,KAAK;AAAA,IAC1C,GAAG,qCAAqC,mCAAmC,CAAC,EAAE;AAQ9E,KAAC,SAAUC,qBAAoB;AAI3B,eAAS,OAAO,SAAS,iBAAiB;AACtC,eAAO,EAAE,SAAS,gBAAgB;AAAA,MACtC;AACA,MAAAA,oBAAmB,SAAS;AAI5B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,MAAM,GAAG,MAAM,eAAe;AAAA,MAClE;AACA,MAAAA,oBAAmB,KAAK;AAAA,IAC5B,GAAG,uBAAuB,qBAAqB,CAAC,EAAE;AAOlD,KAAC,SAAUC,gBAAe;AAItB,MAAAA,eAAc,OAAO;AAIrB,MAAAA,eAAc,YAAY;AAC1B,eAAS,GAAG,OAAO;AACf,eAAO,UAAU,KAAK,UAAU;AAAA,MACpC;AACA,MAAAA,eAAc,KAAK;AAAA,IACvB,GAAG,kBAAkB,gBAAgB,CAAC,EAAE;AAExC,KAAC,SAAUC,qBAAoB;AAC3B,eAAS,OAAO,OAAO;AACnB,eAAO,EAAE,MAAM;AAAA,MACnB;AACA,MAAAA,oBAAmB,SAAS;AAC5B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,MACzB,UAAU,YAAY,UAAa,GAAG,OAAO,UAAU,OAAO,KAAK,cAAc,GAAG,UAAU,OAAO,OACrG,UAAU,aAAa,UAAa,SAAS,GAAG,UAAU,QAAQ,OAClE,UAAU,YAAY,UAAa,QAAQ,GAAG,UAAU,OAAO;AAAA,MAC3E;AACA,MAAAA,oBAAmB,KAAK;AAAA,IAC5B,GAAG,uBAAuB,qBAAqB,CAAC,EAAE;AAElD,KAAC,SAAUC,YAAW;AAClB,eAAS,OAAO,UAAU,OAAO,MAAM;AACnC,cAAM,SAAS,EAAE,UAAU,MAAM;AACjC,YAAI,SAAS,QAAW;AACpB,iBAAO,OAAO;AAAA,QAClB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,WAAU,SAAS;AACnB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,SAAS,GAAG,UAAU,QAAQ,MAC5D,GAAG,OAAO,UAAU,KAAK,KAAK,GAAG,WAAW,UAAU,OAAO,mBAAmB,EAAE,OAClF,UAAU,SAAS,UAAa,cAAc,GAAG,UAAU,IAAI,MAC/D,UAAU,cAAc,UAAc,GAAG,WAAW,UAAU,WAAW,SAAS,EAAE,MACpF,UAAU,YAAY,UAAa,GAAG,OAAO,UAAU,OAAO,KAAK,cAAc,GAAG,UAAU,OAAO,OACrG,UAAU,gBAAgB,UAAa,GAAG,QAAQ,UAAU,WAAW,OACvE,UAAU,iBAAiB,UAAa,GAAG,QAAQ,UAAU,YAAY;AAAA,MACrF;AACA,MAAAA,WAAU,KAAK;AAAA,IACnB,GAAG,cAAc,YAAY,CAAC,EAAE;AAEhC,KAAC,SAAUC,cAAa;AACpB,eAAS,cAAc,OAAO;AAC1B,eAAO,EAAE,MAAM,WAAW,MAAM;AAAA,MACpC;AACA,MAAAA,aAAY,gBAAgB;AAC5B,eAAS,UAAU,OAAO;AACtB,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAC1B,UAAU,SAAS,aACnB,GAAG,OAAO,UAAU,KAAK;AAAA,MACpC;AACA,MAAAA,aAAY,YAAY;AAAA,IAC5B,GAAG,gBAAgB,cAAc,CAAC,EAAE;AAEpC,KAAC,SAAUC,uBAAsB;AAC7B,eAAS,OAAO,YAAY,YAAY,OAAO,SAAS;AACpD,eAAO,EAAE,YAAY,YAAY,OAAO,QAAQ;AAAA,MACpD;AACA,MAAAA,sBAAqB,SAAS;AAAA,IAClC,GAAG,yBAAyB,uBAAuB,CAAC,EAAE;AAEtD,KAAC,SAAUC,uBAAsB;AAC7B,eAAS,OAAO,OAAO;AACnB,eAAO,EAAE,MAAM;AAAA,MACnB;AACA,MAAAA,sBAAqB,SAAS;AAAA,IAClC,GAAG,yBAAyB,uBAAuB,CAAC,EAAE;AAOtD,KAAC,SAAUC,8BAA6B;AAIpC,MAAAA,6BAA4B,UAAU;AAItC,MAAAA,6BAA4B,YAAY;AAAA,IAC5C,GAAG,gCAAgC,8BAA8B,CAAC,EAAE;AAEpE,KAAC,SAAUC,yBAAwB;AAC/B,eAAS,OAAO,OAAO,MAAM;AACzB,eAAO,EAAE,OAAO,KAAK;AAAA,MACzB;AACA,MAAAA,wBAAuB,SAAS;AAAA,IACpC,GAAG,2BAA2B,yBAAyB,CAAC,EAAE;AAE1D,KAAC,SAAUC,0BAAyB;AAChC,eAAS,OAAO,aAAa,wBAAwB;AACjD,eAAO,EAAE,aAAa,uBAAuB;AAAA,MACjD;AACA,MAAAA,yBAAwB,SAAS;AAAA,IACrC,GAAG,4BAA4B,0BAA0B,CAAC,EAAE;AAE5D,KAAC,SAAUC,kBAAiB;AACxB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,cAAc,SAAS,KAAK,IAAI,GAAG,UAAU,GAAG,KAAK,GAAG,OAAO,UAAU,IAAI;AAAA,MAC3F;AACA,MAAAA,iBAAgB,KAAK;AAAA,IACzB,GAAG,oBAAoB,kBAAkB,CAAC,EAAE;AACrC,IAAM,MAAM,CAAC,MAAM,QAAQ,IAAI;AAKtC,KAAC,SAAUC,eAAc;AAQrB,eAAS,OAAO,KAAK,YAAY,SAAS,SAAS;AAC/C,eAAO,IAAI,iBAAiB,KAAK,YAAY,SAAS,OAAO;AAAA,MACjE;AACA,MAAAA,cAAa,SAAS;AAItB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,GAAG,QAAQ,SAAS,KAAK,GAAG,OAAO,UAAU,GAAG,MAAM,GAAG,UAAU,UAAU,UAAU,KAAK,GAAG,OAAO,UAAU,UAAU,MAAM,GAAG,SAAS,UAAU,SAAS,KAC/J,GAAG,KAAK,UAAU,OAAO,KAAK,GAAG,KAAK,UAAU,UAAU,KAAK,GAAG,KAAK,UAAU,QAAQ,IAAI,OAAO;AAAA,MAC/G;AACA,MAAAA,cAAa,KAAK;AAClB,eAAS,WAAW,UAAU,OAAO;AACjC,YAAI,OAAO,SAAS,QAAQ;AAC5B,cAAM,cAAcC,WAAU,OAAO,CAACC,IAAG,MAAM;AAC3C,gBAAM,OAAOA,GAAE,MAAM,MAAM,OAAO,EAAE,MAAM,MAAM;AAChD,cAAI,SAAS,GAAG;AACZ,mBAAOA,GAAE,MAAM,MAAM,YAAY,EAAE,MAAM,MAAM;AAAA,UACnD;AACA,iBAAO;AAAA,QACX,CAAC;AACD,YAAI,qBAAqB,KAAK;AAC9B,iBAAS,IAAI,YAAY,SAAS,GAAG,KAAK,GAAG,KAAK;AAC9C,gBAAM,IAAI,YAAY,CAAC;AACvB,gBAAM,cAAc,SAAS,SAAS,EAAE,MAAM,KAAK;AACnD,gBAAM,YAAY,SAAS,SAAS,EAAE,MAAM,GAAG;AAC/C,cAAI,aAAa,oBAAoB;AACjC,mBAAO,KAAK,UAAU,GAAG,WAAW,IAAI,EAAE,UAAU,KAAK,UAAU,WAAW,KAAK,MAAM;AAAA,UAC7F,OACK;AACD,kBAAM,IAAI,MAAM,kBAAkB;AAAA,UACtC;AACA,+BAAqB;AAAA,QACzB;AACA,eAAO;AAAA,MACX;AACA,MAAAF,cAAa,aAAa;AAC1B,eAASC,WAAU,MAAM,SAAS;AAC9B,YAAI,KAAK,UAAU,GAAG;AAElB,iBAAO;AAAA,QACX;AACA,cAAM,IAAK,KAAK,SAAS,IAAK;AAC9B,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC;AAC5B,cAAM,QAAQ,KAAK,MAAM,CAAC;AAC1B,QAAAA,WAAU,MAAM,OAAO;AACvB,QAAAA,WAAU,OAAO,OAAO;AACxB,YAAI,UAAU;AACd,YAAI,WAAW;AACf,YAAI,IAAI;AACR,eAAO,UAAU,KAAK,UAAU,WAAW,MAAM,QAAQ;AACrD,gBAAM,MAAM,QAAQ,KAAK,OAAO,GAAG,MAAM,QAAQ,CAAC;AAClD,cAAI,OAAO,GAAG;AAEV,iBAAK,GAAG,IAAI,KAAK,SAAS;AAAA,UAC9B,OACK;AAED,iBAAK,GAAG,IAAI,MAAM,UAAU;AAAA,UAChC;AAAA,QACJ;AACA,eAAO,UAAU,KAAK,QAAQ;AAC1B,eAAK,GAAG,IAAI,KAAK,SAAS;AAAA,QAC9B;AACA,eAAO,WAAW,MAAM,QAAQ;AAC5B,eAAK,GAAG,IAAI,MAAM,UAAU;AAAA,QAChC;AACA,eAAO;AAAA,MACX;AAAA,IACJ,GAAG,iBAAiB,eAAe,CAAC,EAAE;AAItC,IAAM,mBAAN,MAAuB;AAAA,MACnB,YAAY,KAAK,YAAY,SAAS,SAAS;AAC3C,aAAK,OAAO;AACZ,aAAK,cAAc;AACnB,aAAK,WAAW;AAChB,aAAK,WAAW;AAChB,aAAK,eAAe;AAAA,MACxB;AAAA,MACA,IAAI,MAAM;AACN,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,aAAa;AACb,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,UAAU;AACV,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,QAAQ,OAAO;AACX,YAAI,OAAO;AACP,gBAAM,QAAQ,KAAK,SAAS,MAAM,KAAK;AACvC,gBAAM,MAAM,KAAK,SAAS,MAAM,GAAG;AACnC,iBAAO,KAAK,SAAS,UAAU,OAAO,GAAG;AAAA,QAC7C;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,OAAO,OAAO,SAAS;AACnB,aAAK,WAAW,MAAM;AACtB,aAAK,WAAW;AAChB,aAAK,eAAe;AAAA,MACxB;AAAA,MACA,iBAAiB;AACb,YAAI,KAAK,iBAAiB,QAAW;AACjC,gBAAM,cAAc,CAAC;AACrB,gBAAM,OAAO,KAAK;AAClB,cAAI,cAAc;AAClB,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,gBAAI,aAAa;AACb,0BAAY,KAAK,CAAC;AAClB,4BAAc;AAAA,YAClB;AACA,kBAAM,KAAK,KAAK,OAAO,CAAC;AACxB,0BAAe,OAAO,QAAQ,OAAO;AACrC,gBAAI,OAAO,QAAQ,IAAI,IAAI,KAAK,UAAU,KAAK,OAAO,IAAI,CAAC,MAAM,MAAM;AACnE;AAAA,YACJ;AAAA,UACJ;AACA,cAAI,eAAe,KAAK,SAAS,GAAG;AAChC,wBAAY,KAAK,KAAK,MAAM;AAAA,UAChC;AACA,eAAK,eAAe;AAAA,QACxB;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,QAAQ;AACf,iBAAS,KAAK,IAAI,KAAK,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,CAAC;AAC3D,cAAM,cAAc,KAAK,eAAe;AACxC,YAAI,MAAM,GAAG,OAAO,YAAY;AAChC,YAAI,SAAS,GAAG;AACZ,iBAAO,SAAS,OAAO,GAAG,MAAM;AAAA,QACpC;AACA,eAAO,MAAM,MAAM;AACf,gBAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,cAAI,YAAY,GAAG,IAAI,QAAQ;AAC3B,mBAAO;AAAA,UACX,OACK;AACD,kBAAM,MAAM;AAAA,UAChB;AAAA,QACJ;AAGA,cAAM,OAAO,MAAM;AACnB,eAAO,SAAS,OAAO,MAAM,SAAS,YAAY,IAAI,CAAC;AAAA,MAC3D;AAAA,MACA,SAAS,UAAU;AACf,cAAM,cAAc,KAAK,eAAe;AACxC,YAAI,SAAS,QAAQ,YAAY,QAAQ;AACrC,iBAAO,KAAK,SAAS;AAAA,QACzB,WACS,SAAS,OAAO,GAAG;AACxB,iBAAO;AAAA,QACX;AACA,cAAM,aAAa,YAAY,SAAS,IAAI;AAC5C,cAAM,iBAAkB,SAAS,OAAO,IAAI,YAAY,SAAU,YAAY,SAAS,OAAO,CAAC,IAAI,KAAK,SAAS;AACjH,eAAO,KAAK,IAAI,KAAK,IAAI,aAAa,SAAS,WAAW,cAAc,GAAG,UAAU;AAAA,MACzF;AAAA,MACA,IAAI,YAAY;AACZ,eAAO,KAAK,eAAe,EAAE;AAAA,MACjC;AAAA,IACJ;AAEA,KAAC,SAAUE,KAAI;AACX,YAAMC,YAAW,OAAO,UAAU;AAClC,eAAS,QAAQ,OAAO;AACpB,eAAO,OAAO,UAAU;AAAA,MAC5B;AACA,MAAAD,IAAG,UAAU;AACb,eAASE,WAAU,OAAO;AACtB,eAAO,OAAO,UAAU;AAAA,MAC5B;AACA,MAAAF,IAAG,YAAYE;AACf,eAAS,QAAQ,OAAO;AACpB,eAAO,UAAU,QAAQ,UAAU;AAAA,MACvC;AACA,MAAAF,IAAG,UAAU;AACb,eAAS,OAAO,OAAO;AACnB,eAAOC,UAAS,KAAK,KAAK,MAAM;AAAA,MACpC;AACA,MAAAD,IAAG,SAAS;AACZ,eAAS,OAAO,OAAO;AACnB,eAAOC,UAAS,KAAK,KAAK,MAAM;AAAA,MACpC;AACA,MAAAD,IAAG,SAAS;AACZ,eAAS,YAAY,OAAOG,MAAK,KAAK;AAClC,eAAOF,UAAS,KAAK,KAAK,MAAM,qBAAqBE,QAAO,SAAS,SAAS;AAAA,MAClF;AACA,MAAAH,IAAG,cAAc;AACjB,eAASnF,SAAQ,OAAO;AACpB,eAAOoF,UAAS,KAAK,KAAK,MAAM,qBAAqB,eAAe,SAAS,SAAS;AAAA,MAC1F;AACA,MAAAD,IAAG,UAAUnF;AACb,eAASC,UAAS,OAAO;AACrB,eAAOmF,UAAS,KAAK,KAAK,MAAM,qBAAqB,KAAK,SAAS,SAAS;AAAA,MAChF;AACA,MAAAD,IAAG,WAAWlF;AACd,eAAS,KAAK,OAAO;AACjB,eAAOmF,UAAS,KAAK,KAAK,MAAM;AAAA,MACpC;AACA,MAAAD,IAAG,OAAO;AACV,eAAS,cAAc,OAAO;AAI1B,eAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,MAC9C;AACA,MAAAA,IAAG,gBAAgB;AACnB,eAAS,WAAW,OAAO,OAAO;AAC9B,eAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,KAAK;AAAA,MACpD;AACA,MAAAA,IAAG,aAAa;AAAA,IACpB,GAAG,OAAO,KAAK,CAAC,EAAE;AAAA;AAAA;;;AC92ElB,IAAAI,oBAAA;AAAA,6EAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,KAAKA,SAAQ,2BAA2BA,SAAQ,4BAA4BA,SAAQ,sBAAsBA,SAAQ,uBAAuBA,SAAQ,mBAAmBA,SAAQ,mBAAmB;AACvM,QAAM,mBAAmB;AACzB,QAAI;AACJ,KAAC,SAAUC,mBAAkB;AACzB,MAAAA,kBAAiB,gBAAgB,IAAI;AACrC,MAAAA,kBAAiB,gBAAgB,IAAI;AACrC,MAAAA,kBAAiB,MAAM,IAAI;AAAA,IAC/B,GAAG,qBAAqBD,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AACzE,QAAM,mBAAN,MAAuB;AAAA,MAMnB,YAAY,QAAQ;AAFpB;AAAA;AAAA;AAAA;AACA;AAEI,aAAK,SAAS;AAAA,MAClB;AAAA,IACJ;AACA,IAAAA,SAAQ,mBAAmB;AAC3B,QAAM,uBAAN,cAAmC,iBAAiB,aAAa;AAAA,MAS7D,YAAY,QAAQ;AAChB,cAAM,MAAM;AALhB;AAAA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,uBAAuB;AAC/B,QAAM,sBAAN,cAAkC,iBAAiB,YAAY;AAAA,MAQ3D,YAAY,QAAQ;AAChB,cAAM,QAAQ,iBAAiB,oBAAoB,MAAM;AAL7D;AAAA;AAAA;AAAA;AACA;AACA;AACA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,4BAAN,cAAwC,iBAAiB,kBAAkB;AAAA,MAMvE,YAAY,QAAQ;AAChB,cAAM,MAAM;AAHhB;AAAA;AAAA;AAAA;AACA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,4BAA4B;AACpC,QAAM,2BAAN,cAAuC,iBAAiB,iBAAiB;AAAA,MAMrE,YAAY,QAAQ;AAChB,cAAM,QAAQ,iBAAiB,oBAAoB,MAAM;AAH7D;AAAA;AAAA;AAAA;AACA;AAAA,MAGA;AAAA,IACJ;AACA,IAAAA,SAAQ,2BAA2B;AACnC,QAAI;AACJ,KAAC,SAAUE,KAAI;AACX,eAAS,OAAO,QAAQ,QAAQ;AAC5B,eAAO,EAAE,QAAQ,OAAO;AAAA,MAC5B;AACA,MAAAA,IAAG,SAAS;AAAA,IAChB,GAAG,OAAOF,SAAQ,KAAK,KAAK,CAAC,EAAE;AAAA;AAAA;;;AChF/B,IAAAG,cAAA;AAAA,6EAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,UAAU;AAClB,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,OAAO;AACf,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,cAAc;AACtB,IAAAA,SAAQ,aAAa;AACrB,IAAAA,SAAQ,gBAAgB;AACxB,aAAS,QAAQ,OAAO;AACpB,aAAO,UAAU,QAAQ,UAAU;AAAA,IACvC;AACA,aAAS,OAAO,OAAO;AACnB,aAAO,OAAO,UAAU,YAAY,iBAAiB;AAAA,IACzD;AACA,aAAS,OAAO,OAAO;AACnB,aAAO,OAAO,UAAU,YAAY,iBAAiB;AAAA,IACzD;AACA,aAAS,MAAM,OAAO;AAClB,aAAO,iBAAiB;AAAA,IAC5B;AACA,aAAS,KAAK,OAAO;AACjB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,aAAS,MAAM,OAAO;AAClB,aAAO,MAAM,QAAQ,KAAK;AAAA,IAC9B;AACA,aAAS,YAAY,OAAO;AACxB,aAAO,MAAM,KAAK,KAAK,MAAM,MAAM,UAAQ,OAAO,IAAI,CAAC;AAAA,IAC3D;AACA,aAAS,WAAW,OAAO,OAAO;AAC9B,aAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,KAAK;AAAA,IACpD;AACA,aAAS,cAAc,OAAO;AAI1B,aAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,IAC9C;AAAA;AAAA;;;AC5CA;AAAA,4FAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,wBAAwB;AAChC,QAAM,aAAa;AAQnB,QAAI;AACJ,KAAC,SAAUC,wBAAuB;AAC9B,MAAAA,uBAAsB,SAAS;AAC/B,MAAAA,uBAAsB,mBAAmB,WAAW,iBAAiB;AACrE,MAAAA,uBAAsB,OAAO,IAAI,WAAW,oBAAoBA,uBAAsB,MAAM;AAC5F,MAAAA,uBAAsB,eAAe,WAAW,GAAG,OAAO,+BAA+B,wBAAwB;AAAA,IACrH,GAAG,0BAA0BD,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AAAA;AAAA;;;ACrBxF;AAAA,4FAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,wBAAwB;AAChC,QAAM,aAAa;AAQnB,QAAI;AACJ,KAAC,SAAUC,wBAAuB;AAC9B,MAAAA,uBAAsB,SAAS;AAC/B,MAAAA,uBAAsB,mBAAmB,WAAW,iBAAiB;AACrE,MAAAA,uBAAsB,OAAO,IAAI,WAAW,oBAAoBA,uBAAsB,MAAM;AAC5F,MAAAA,uBAAsB,eAAe,WAAW,GAAG,OAAO,+BAA+B,wBAAwB;AAAA,IACrH,GAAG,0BAA0BD,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AAAA;AAAA;;;ACrBxF;AAAA,6FAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,wCAAwCA,SAAQ,0BAA0B;AAClF,QAAM,aAAa;AAInB,QAAI;AACJ,KAAC,SAAUC,0BAAyB;AAChC,MAAAA,yBAAwB,SAAS;AACjC,MAAAA,yBAAwB,mBAAmB,WAAW,iBAAiB;AACvE,MAAAA,yBAAwB,OAAO,IAAI,WAAW,qBAAqBA,yBAAwB,MAAM;AACjG,MAAAA,yBAAwB,eAAe,WAAW,GAAG,OAAO,8BAA8B,4BAA4B;AAAA,IAC1H,GAAG,4BAA4BD,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAK9F,QAAI;AACJ,KAAC,SAAUE,wCAAuC;AAC9C,MAAAA,uCAAsC,SAAS;AAC/C,MAAAA,uCAAsC,mBAAmB,WAAW,iBAAiB;AACrF,MAAAA,uCAAsC,OAAO,IAAI,WAAW,yBAAyBA,uCAAsC,MAAM;AACjI,MAAAA,uCAAsC,eAAe,WAAW,GAAG,OAAO,QAAW,gDAAgD;AAAA,IACzI,GAAG,0CAA0CF,SAAQ,wCAAwC,wCAAwC,CAAC,EAAE;AAAA;AAAA;;;AC5BxI;AAAA,2FAAAG,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,uBAAuB;AAC/B,QAAM,aAAa;AAWnB,QAAI;AACJ,KAAC,SAAUC,uBAAsB;AAC7B,MAAAA,sBAAqB,SAAS;AAC9B,MAAAA,sBAAqB,mBAAmB,WAAW,iBAAiB;AACpE,MAAAA,sBAAqB,OAAO,IAAI,WAAW,oBAAoBA,sBAAqB,MAAM;AAC1F,MAAAA,sBAAqB,eAAe,WAAW,GAAG,OAAO,2BAA2B,MAAS;AAAA,IACjG,GAAG,yBAAyBD,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AAAA;AAAA;;;ACxBrF;AAAA,2FAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,2BAA2BA,SAAQ,uBAAuB;AAClE,QAAM,aAAa;AAOnB,QAAI;AACJ,KAAC,SAAUC,uBAAsB;AAC7B,MAAAA,sBAAqB,SAAS;AAC9B,MAAAA,sBAAqB,mBAAmB,WAAW,iBAAiB;AACpE,MAAAA,sBAAqB,OAAO,IAAI,WAAW,oBAAoBA,sBAAqB,MAAM;AAC1F,MAAAA,sBAAqB,eAAe,WAAW,GAAG,OAAO,8BAA8B,eAAe;AAAA,IAC1G,GAAG,yBAAyBD,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AAOrF,QAAI;AACJ,KAAC,SAAUE,2BAA0B;AACjC,MAAAA,0BAAyB,SAAS;AAClC,MAAAA,0BAAyB,mBAAmB,WAAW,iBAAiB;AACxE,MAAAA,0BAAyB,OAAO,IAAI,WAAW,oBAAoBA,0BAAyB,MAAM;AAClG,MAAAA,0BAAyB,eAAe,WAAW,GAAG,OAAO,8BAA8B,eAAe;AAAA,IAC9G,GAAG,6BAA6BF,SAAQ,2BAA2B,2BAA2B,CAAC,EAAE;AAAA;AAAA;;;ACjCjG;AAAA,0FAAAG,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,6BAA6BA,SAAQ,sBAAsB;AACnE,QAAM,aAAa;AAOnB,QAAI;AACJ,KAAC,SAAUC,sBAAqB;AAC5B,MAAAA,qBAAoB,SAAS;AAC7B,MAAAA,qBAAoB,mBAAmB,WAAW,iBAAiB;AACnE,MAAAA,qBAAoB,OAAO,IAAI,WAAW,oBAAoBA,qBAAoB,MAAM;AACxF,MAAAA,qBAAoB,eAAe,WAAW,GAAG,OAAO,6BAA6B,sBAAsB;AAAA,IAC/G,GAAG,wBAAwBD,SAAQ,sBAAsB,sBAAsB,CAAC,EAAE;AAMlF,QAAI;AACJ,KAAC,SAAUE,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,qBAAqBA,4BAA2B,MAAM;AACvG,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,yCAAyC,MAAS;AAAA,IACrH,GAAG,+BAA+BF,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAAA;AAAA;;;AChCvG;AAAA,yFAAAG,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,qBAAqB;AAC7B,QAAM,aAAa;AASnB,QAAI;AACJ,KAAC,SAAUC,qBAAoB;AAC3B,MAAAA,oBAAmB,SAAS;AAC5B,MAAAA,oBAAmB,mBAAmB,WAAW,iBAAiB;AAClE,MAAAA,oBAAmB,OAAO,IAAI,WAAW,oBAAoBA,oBAAmB,MAAM;AACtF,MAAAA,oBAAmB,eAAe,WAAW,GAAG,OAAO,4BAA4B,qBAAqB;AAAA,IAC5G,GAAG,uBAAuBD,SAAQ,qBAAqB,qBAAqB,CAAC,EAAE;AAAA;AAAA;;;ACtB/E;AAAA,4FAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,wBAAwB;AAChC,QAAM,aAAa;AAOnB,QAAI;AACJ,KAAC,SAAUC,wBAAuB;AAC9B,MAAAA,uBAAsB,SAAS;AAC/B,MAAAA,uBAAsB,mBAAmB,WAAW,iBAAiB;AACrE,MAAAA,uBAAsB,OAAO,IAAI,WAAW,oBAAoBA,uBAAsB,MAAM;AAC5F,MAAAA,uBAAsB,eAAe,WAAW,GAAG,OAAO,+BAA+B,wBAAwB;AAAA,IACrH,GAAG,0BAA0BD,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AAAA;AAAA;;;ACpBxF;AAAA,sFAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,qCAAqCA,SAAQ,gCAAgCA,SAAQ,mBAAmB;AAChH,QAAM,mBAAmB;AACzB,QAAM,aAAa;AACnB,QAAI;AACJ,KAAC,SAAUC,mBAAkB;AACzB,MAAAA,kBAAiB,OAAO,IAAI,iBAAiB,aAAa;AAC1D,eAAS,GAAG,OAAO;AACf,eAAO,UAAUA,kBAAiB;AAAA,MACtC;AACA,MAAAA,kBAAiB,KAAK;AAAA,IAC1B,GAAG,qBAAqBD,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AAKzE,QAAI;AACJ,KAAC,SAAUE,gCAA+B;AACtC,MAAAA,+BAA8B,SAAS;AACvC,MAAAA,+BAA8B,mBAAmB,WAAW,iBAAiB;AAC7E,MAAAA,+BAA8B,OAAO,IAAI,WAAW,oBAAoBA,+BAA8B,MAAM;AAC5G,MAAAA,+BAA8B,eAAe,WAAW,GAAG,OAAO,2BAA2B,MAAS;AAAA,IAC1G,GAAG,kCAAkCF,SAAQ,gCAAgC,gCAAgC,CAAC,EAAE;AAKhH,QAAI;AACJ,KAAC,SAAUG,qCAAoC;AAC3C,MAAAA,oCAAmC,SAAS;AAC5C,MAAAA,oCAAmC,mBAAmB,WAAW,iBAAiB;AAClF,MAAAA,oCAAmC,OAAO,IAAI,WAAW,yBAAyBA,oCAAmC,MAAM;AAAA,IAC/H,GAAG,uCAAuCH,SAAQ,qCAAqC,qCAAqC,CAAC,EAAE;AAAA;AAAA;;;ACrC/H;AAAA,2FAAAI,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,oCAAoCA,SAAQ,oCAAoCA,SAAQ,8BAA8B;AAC9H,QAAM,aAAa;AAOnB,QAAI;AACJ,KAAC,SAAUC,8BAA6B;AACpC,MAAAA,6BAA4B,SAAS;AACrC,MAAAA,6BAA4B,mBAAmB,WAAW,iBAAiB;AAC3E,MAAAA,6BAA4B,OAAO,IAAI,WAAW,oBAAoBA,6BAA4B,MAAM;AACxG,MAAAA,6BAA4B,eAAe,WAAW,GAAG,OAAO,8BAA8B,uBAAuB;AAAA,IACzH,GAAG,gCAAgCD,SAAQ,8BAA8B,8BAA8B,CAAC,EAAE;AAM1G,QAAI;AACJ,KAAC,SAAUE,oCAAmC;AAC1C,MAAAA,mCAAkC,SAAS;AAC3C,MAAAA,mCAAkC,mBAAmB,WAAW,iBAAiB;AACjF,MAAAA,mCAAkC,OAAO,IAAI,WAAW,oBAAoBA,mCAAkC,MAAM;AACpH,MAAAA,mCAAkC,eAAe,WAAW,GAAG,OAAO,8BAA8B,uBAAuB;AAAA,IAC/H,GAAG,sCAAsCF,SAAQ,oCAAoC,oCAAoC,CAAC,EAAE;AAM5H,QAAI;AACJ,KAAC,SAAUG,oCAAmC;AAC1C,MAAAA,mCAAkC,SAAS;AAC3C,MAAAA,mCAAkC,mBAAmB,WAAW,iBAAiB;AACjF,MAAAA,mCAAkC,OAAO,IAAI,WAAW,oBAAoBA,mCAAkC,MAAM;AACpH,MAAAA,mCAAkC,eAAe,WAAW,GAAG,OAAO,8BAA8B,uBAAuB;AAAA,IAC/H,GAAG,sCAAsCH,SAAQ,oCAAoC,oCAAoC,CAAC,EAAE;AAAA;AAAA;;;AC5C5H;AAAA,4FAAAI,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,+BAA+BA,SAAQ,6BAA6BA,SAAQ,6BAA6BA,SAAQ,wBAAwBA,SAAQ,iCAAiCA,SAAQ,cAAc;AAChN,QAAM,aAAa;AAEnB,QAAI;AACJ,KAAC,SAAUC,cAAa;AACpB,MAAAA,aAAY,WAAW;AAAA,IAC3B,GAAG,gBAAgBD,SAAQ,cAAc,cAAc,CAAC,EAAE;AAC1D,QAAI;AACJ,KAAC,SAAUE,iCAAgC;AACvC,MAAAA,gCAA+B,SAAS;AACxC,MAAAA,gCAA+B,OAAO,IAAI,WAAW,iBAAiBA,gCAA+B,MAAM;AAAA,IAC/G,GAAG,mCAAmCF,SAAQ,iCAAiC,iCAAiC,CAAC,EAAE;AAInH,QAAI;AACJ,KAAC,SAAUG,wBAAuB;AAC9B,MAAAA,uBAAsB,SAAS;AAC/B,MAAAA,uBAAsB,mBAAmB,WAAW,iBAAiB;AACrE,MAAAA,uBAAsB,OAAO,IAAI,WAAW,oBAAoBA,uBAAsB,MAAM;AAC5F,MAAAA,uBAAsB,qBAAqB,+BAA+B;AAC1E,MAAAA,uBAAsB,eAAe,WAAW,GAAG,OAAO,+BAA+B,wBAAwB;AAAA,IACrH,GAAG,0BAA0BH,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AAIxF,QAAI;AACJ,KAAC,SAAUI,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,oBAAoBA,4BAA2B,MAAM;AACtG,MAAAA,4BAA2B,qBAAqB,+BAA+B;AAC/E,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,mDAAmD,mCAAmC;AAAA,IACzJ,GAAG,+BAA+BJ,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAIvG,QAAI;AACJ,KAAC,SAAUK,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,oBAAoBA,4BAA2B,MAAM;AACtG,MAAAA,4BAA2B,qBAAqB,+BAA+B;AAC/E,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,8CAA8C,8BAA8B;AAAA,IAC/I,GAAG,+BAA+BL,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAIvG,QAAI;AACJ,KAAC,SAAUM,+BAA8B;AACrC,MAAAA,8BAA6B,SAAS;AACtC,MAAAA,8BAA6B,mBAAmB,WAAW,iBAAiB;AAC5E,MAAAA,8BAA6B,OAAO,IAAI,WAAW,qBAAqBA,8BAA6B,MAAM;AAC3G,MAAAA,8BAA6B,eAAe,WAAW,GAAG,OAAO,2CAA2C,MAAS;AAAA,IACzH,GAAG,iCAAiCN,SAAQ,+BAA+B,+BAA+B,CAAC,EAAE;AAAA;AAAA;;;AC5D7G;AAAA,0FAAAO,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,aAAa;AASnB,QAAI;AACJ,KAAC,SAAUC,sBAAqB;AAC5B,MAAAA,qBAAoB,SAAS;AAC7B,MAAAA,qBAAoB,mBAAmB,WAAW,iBAAiB;AACnE,MAAAA,qBAAoB,OAAO,IAAI,WAAW,oBAAoBA,qBAAoB,MAAM;AACxF,MAAAA,qBAAoB,eAAe,WAAW,GAAG,OAAO,+BAA+B,MAAS;AAAA,IACpG,GAAG,wBAAwBD,SAAQ,sBAAsB,sBAAsB,CAAC,EAAE;AAAA;AAAA;;;ACtBlF;AAAA,gGAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,4BAA4B;AACpC,QAAM,aAAa;AAMnB,QAAI;AACJ,KAAC,SAAUC,4BAA2B;AAClC,MAAAA,2BAA0B,SAAS;AACnC,MAAAA,2BAA0B,mBAAmB,WAAW,iBAAiB;AACzE,MAAAA,2BAA0B,OAAO,IAAI,WAAW,oBAAoBA,2BAA0B,MAAM;AACpG,MAAAA,2BAA0B,eAAe,WAAW,GAAG,OAAO,mCAAmC,4BAA4B;AAAA,IACjI,GAAG,8BAA8BD,SAAQ,4BAA4B,4BAA4B,CAAC,EAAE;AAAA;AAAA;;;ACnBpG;AAAA,4FAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,yBAAyBA,SAAQ,6BAA6BA,SAAQ,6BAA6BA,SAAQ,yBAAyBA,SAAQ,6BAA6BA,SAAQ,yBAAyBA,SAAQ,2BAA2B;AACrP,QAAM,aAAa;AAOnB,QAAI;AACJ,KAAC,SAAUC,2BAA0B;AAIjC,MAAAA,0BAAyB,OAAO;AAIhC,MAAAA,0BAAyB,SAAS;AAAA,IACtC,GAAG,6BAA6BD,SAAQ,2BAA2B,2BAA2B,CAAC,EAAE;AAWjG,QAAI;AACJ,KAAC,SAAUE,yBAAwB;AAC/B,MAAAA,wBAAuB,SAAS;AAChC,MAAAA,wBAAuB,mBAAmB,WAAW,iBAAiB;AACtE,MAAAA,wBAAuB,OAAO,IAAI,WAAW,oBAAoBA,wBAAuB,MAAM;AAC9F,MAAAA,wBAAuB,eAAe,WAAW,GAAG,OAAO,uCAAuC,qCAAqC;AAAA,IAC3I,GAAG,2BAA2BF,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAO3F,QAAI;AACJ,KAAC,SAAUG,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,yBAAyBA,4BAA2B,MAAM;AAC3G,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,sCAAsC,oCAAoC;AAAA,IAC7I,GAAG,+BAA+BH,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAOvG,QAAI;AACJ,KAAC,SAAUI,yBAAwB;AAC/B,MAAAA,wBAAuB,SAAS;AAChC,MAAAA,wBAAuB,mBAAmB,WAAW,iBAAiB;AACtE,MAAAA,wBAAuB,OAAO,IAAI,WAAW,oBAAoBA,wBAAuB,MAAM;AAC9F,MAAAA,wBAAuB,eAAe,WAAW,GAAG,OAAO,uCAAuC,qCAAqC;AAAA,IAC3I,GAAG,2BAA2BJ,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAO3F,QAAI;AACJ,KAAC,SAAUK,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,yBAAyBA,4BAA2B,MAAM;AAC3G,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,sCAAsC,oCAAoC;AAAA,IAC7I,GAAG,+BAA+BL,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAOvG,QAAI;AACJ,KAAC,SAAUM,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,yBAAyBA,4BAA2B,MAAM;AAC3G,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,sCAAsC,oCAAoC;AAAA,IAC7I,GAAG,+BAA+BN,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAOvG,QAAI;AACJ,KAAC,SAAUO,yBAAwB;AAC/B,MAAAA,wBAAuB,SAAS;AAChC,MAAAA,wBAAuB,mBAAmB,WAAW,iBAAiB;AACtE,MAAAA,wBAAuB,OAAO,IAAI,WAAW,oBAAoBA,wBAAuB,MAAM;AAC9F,MAAAA,wBAAuB,eAAe,WAAW,GAAG,OAAO,uCAAuC,qCAAqC;AAAA,IAC3I,GAAG,2BAA2BP,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAAA;AAAA;;;AC1G3F;AAAA,qFAAAQ,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,iBAAiBA,SAAQ,cAAcA,SAAQ,kBAAkB;AACzE,QAAM,aAAa;AAMnB,QAAI;AACJ,KAAC,SAAUC,kBAAiB;AAIxB,MAAAA,iBAAgB,WAAW;AAI3B,MAAAA,iBAAgB,UAAU;AAI1B,MAAAA,iBAAgB,QAAQ;AAIxB,MAAAA,iBAAgB,SAAS;AAIzB,MAAAA,iBAAgB,SAAS;AAAA,IAC7B,GAAG,oBAAoBD,SAAQ,kBAAkB,kBAAkB,CAAC,EAAE;AAMtE,QAAI;AACJ,KAAC,SAAUE,cAAa;AAIpB,MAAAA,aAAY,UAAU;AAItB,MAAAA,aAAY,UAAU;AAKtB,MAAAA,aAAY,QAAQ;AAAA,IACxB,GAAG,gBAAgBF,SAAQ,cAAc,cAAc,CAAC,EAAE;AAM1D,QAAI;AACJ,KAAC,SAAUG,iBAAgB;AACvB,MAAAA,gBAAe,SAAS;AACxB,MAAAA,gBAAe,mBAAmB,WAAW,iBAAiB;AAC9D,MAAAA,gBAAe,OAAO,IAAI,WAAW,oBAAoBA,gBAAe,MAAM;AAC9E,MAAAA,gBAAe,eAAe,WAAW,GAAG,OAAO,wBAAwB,iBAAiB;AAAA,IAChG,GAAG,mBAAmBH,SAAQ,iBAAiB,iBAAiB,CAAC,EAAE;AAAA;AAAA;;;ACpEnE;AAAA,2FAAAI,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,+BAA+BA,SAAQ,iCAAiCA,SAAQ,8BAA8B;AACtH,QAAM,aAAa;AAOnB,QAAI;AACJ,KAAC,SAAUC,8BAA6B;AACpC,MAAAA,6BAA4B,SAAS;AACrC,MAAAA,6BAA4B,mBAAmB,WAAW,iBAAiB;AAC3E,MAAAA,6BAA4B,OAAO,IAAI,WAAW,oBAAoBA,6BAA4B,MAAM;AACxG,MAAAA,6BAA4B,eAAe,WAAW,GAAG,OAAO,8BAA8B,uBAAuB;AAAA,IACzH,GAAG,gCAAgCD,SAAQ,8BAA8B,8BAA8B,CAAC,EAAE;AAM1G,QAAI;AACJ,KAAC,SAAUE,iCAAgC;AACvC,MAAAA,gCAA+B,SAAS;AACxC,MAAAA,gCAA+B,mBAAmB,WAAW,iBAAiB;AAC9E,MAAAA,gCAA+B,OAAO,IAAI,WAAW,oBAAoBA,gCAA+B,MAAM;AAAA,IAClH,GAAG,mCAAmCF,SAAQ,iCAAiC,iCAAiC,CAAC,EAAE;AAMnH,QAAI;AACJ,KAAC,SAAUG,+BAA8B;AACrC,MAAAA,8BAA6B,SAAS;AACtC,MAAAA,8BAA6B,mBAAmB,WAAW,iBAAiB;AAC5E,MAAAA,8BAA6B,OAAO,IAAI,WAAW,oBAAoBA,8BAA6B,MAAM;AAAA,IAC9G,GAAG,iCAAiCH,SAAQ,+BAA+B,+BAA+B,CAAC,EAAE;AAAA;AAAA;;;AC1C7G;AAAA,yFAAAI,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,4BAA4BA,SAAQ,qBAAqB;AACjE,QAAM,aAAa;AAQnB,QAAI;AACJ,KAAC,SAAUC,qBAAoB;AAC3B,MAAAA,oBAAmB,SAAS;AAC5B,MAAAA,oBAAmB,mBAAmB,WAAW,iBAAiB;AAClE,MAAAA,oBAAmB,OAAO,IAAI,WAAW,oBAAoBA,oBAAmB,MAAM;AACtF,MAAAA,oBAAmB,eAAe,WAAW,GAAG,OAAO,4BAA4B,qBAAqB;AAAA,IAC5G,GAAG,uBAAuBD,SAAQ,qBAAqB,qBAAqB,CAAC,EAAE;AAI/E,QAAI;AACJ,KAAC,SAAUE,4BAA2B;AAClC,MAAAA,2BAA0B,SAAS;AACnC,MAAAA,2BAA0B,mBAAmB,WAAW,iBAAiB;AACzE,MAAAA,2BAA0B,OAAO,IAAI,WAAW,qBAAqBA,2BAA0B,MAAM;AACrG,MAAAA,2BAA0B,eAAe,WAAW,GAAG,OAAO,wCAAwC,MAAS;AAAA,IACnH,GAAG,8BAA8BF,SAAQ,4BAA4B,4BAA4B,CAAC,EAAE;AAAA;AAAA;;;AC/BpG;AAAA,uFAAAG,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,0BAA0BA,SAAQ,0BAA0BA,SAAQ,mBAAmB;AAC/F,QAAM,aAAa;AAQnB,QAAI;AACJ,KAAC,SAAUC,mBAAkB;AACzB,MAAAA,kBAAiB,SAAS;AAC1B,MAAAA,kBAAiB,mBAAmB,WAAW,iBAAiB;AAChE,MAAAA,kBAAiB,OAAO,IAAI,WAAW,oBAAoBA,kBAAiB,MAAM;AAClF,MAAAA,kBAAiB,eAAe,WAAW,GAAG,OAAO,0BAA0B,mBAAmB;AAAA,IACtG,GAAG,qBAAqBD,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AAQzE,QAAI;AACJ,KAAC,SAAUE,0BAAyB;AAChC,MAAAA,yBAAwB,SAAS;AACjC,MAAAA,yBAAwB,mBAAmB,WAAW,iBAAiB;AACvE,MAAAA,yBAAwB,OAAO,IAAI,WAAW,oBAAoBA,yBAAwB,MAAM;AAChG,MAAAA,yBAAwB,eAAe,WAAW,GAAG,OAAO,yCAAyC,mCAAmC;AAAA,IAC5I,GAAG,4BAA4BF,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAI9F,QAAI;AACJ,KAAC,SAAUG,0BAAyB;AAChC,MAAAA,yBAAwB,SAAS;AACjC,MAAAA,yBAAwB,mBAAmB,WAAW,iBAAiB;AACvE,MAAAA,yBAAwB,OAAO,IAAI,WAAW,qBAAqBA,yBAAwB,MAAM;AACjG,MAAAA,yBAAwB,eAAe,WAAW,GAAG,OAAO,sCAAsC,MAAS;AAAA,IAC/G,GAAG,4BAA4BH,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAAA;AAAA;;;AC7C9F;AAAA,wFAAAI,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,2BAA2BA,SAAQ,6BAA6BA,SAAQ,4BAA4BA,SAAQ,+BAA+BA,SAAQ,mCAAmC;AAC9L,QAAM,mBAAmB;AACzB,QAAME,MAAK,aAAa,aAAqB;AAC7C,QAAM,aAAa;AAInB,QAAI;AACJ,KAAC,SAAUC,mCAAkC;AACzC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,aAAaD,IAAG,QAAQ,UAAU,gBAAgB;AAAA,MAC7D;AACA,MAAAC,kCAAiC,KAAK;AAAA,IAC1C,GAAG,qCAAqCH,SAAQ,mCAAmC,mCAAmC,CAAC,EAAE;AAMzH,QAAI;AACJ,KAAC,SAAUI,+BAA8B;AAKrC,MAAAA,8BAA6B,OAAO;AAKpC,MAAAA,8BAA6B,YAAY;AAAA,IAC7C,GAAG,iCAAiCJ,SAAQ,+BAA+B,+BAA+B,CAAC,EAAE;AAM7G,QAAI;AACJ,KAAC,SAAUK,4BAA2B;AAClC,MAAAA,2BAA0B,SAAS;AACnC,MAAAA,2BAA0B,mBAAmB,WAAW,iBAAiB;AACzE,MAAAA,2BAA0B,OAAO,IAAI,WAAW,oBAAoBA,2BAA0B,MAAM;AACpG,MAAAA,2BAA0B,gBAAgB,IAAI,iBAAiB,aAAa;AAC5E,MAAAA,2BAA0B,eAAe,WAAW,GAAG,OAAO,2BAA2B,oBAAoB;AAAA,IACjH,GAAG,8BAA8BL,SAAQ,4BAA4B,4BAA4B,CAAC,EAAE;AAMpG,QAAI;AACJ,KAAC,SAAUM,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,oBAAoBA,4BAA2B,MAAM;AACtG,MAAAA,4BAA2B,gBAAgB,IAAI,iBAAiB,aAAa;AAC7E,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,yBAAyB,yCAAyC;AAAA,IACrI,GAAG,+BAA+BN,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAMvG,QAAI;AACJ,KAAC,SAAUO,2BAA0B;AACjC,MAAAA,0BAAyB,SAAS;AAClC,MAAAA,0BAAyB,mBAAmB,WAAW,iBAAiB;AACxE,MAAAA,0BAAyB,OAAO,IAAI,WAAW,qBAAqBA,0BAAyB,MAAM;AACnG,MAAAA,0BAAyB,eAAe,WAAW,GAAG,OAAO,wCAAwC,MAAS;AAAA,IAClH,GAAG,6BAA6BP,SAAQ,2BAA2B,2BAA2B,CAAC,EAAE;AAAA;AAAA;;;AC7GjG;AAAA,sFAAAQ,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,uCAAuCA,SAAQ,sCAAsCA,SAAQ,wCAAwCA,SAAQ,0BAA0BA,SAAQ,sCAAsCA,SAAQ,uCAAuCA,SAAQ,mBAAmBA,SAAQ,eAAeA,SAAQ,mBAAmBA,SAAQ,mBAAmB;AACpX,QAAM,gCAAgC;AACtC,QAAME,MAAK,aAAa,aAAqB;AAC7C,QAAM,aAAa;AAMnB,QAAI;AACJ,KAAC,SAAUC,mBAAkB;AAIzB,MAAAA,kBAAiB,SAAS;AAI1B,MAAAA,kBAAiB,OAAO;AACxB,eAAS,GAAG,OAAO;AACf,eAAO,UAAU,KAAK,UAAU;AAAA,MACpC;AACA,MAAAA,kBAAiB,KAAK;AAAA,IAC1B,GAAG,qBAAqBH,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AACzE,QAAI;AACJ,KAAC,SAAUI,mBAAkB;AACzB,eAAS,OAAO,gBAAgB,SAAS;AACrC,cAAM,SAAS,EAAE,eAAe;AAChC,YAAI,YAAY,QAAQ,YAAY,OAAO;AACvC,iBAAO,UAAU;AAAA,QACrB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,kBAAiB,SAAS;AAC1B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOF,IAAG,cAAc,SAAS,KAAK,8BAA8B,SAAS,GAAG,UAAU,cAAc,MAAM,UAAU,YAAY,UAAaA,IAAG,QAAQ,UAAU,OAAO;AAAA,MACjL;AACA,MAAAE,kBAAiB,KAAK;AACtB,eAAS,OAAO,KAAK,OAAO;AACxB,YAAI,QAAQ,OAAO;AACf,iBAAO;AAAA,QACX;AACA,YAAI,QAAQ,QAAQ,QAAQ,UAAa,UAAU,QAAQ,UAAU,QAAW;AAC5E,iBAAO;AAAA,QACX;AACA,eAAO,IAAI,mBAAmB,MAAM,kBAAkB,IAAI,YAAY,MAAM;AAAA,MAChF;AACA,MAAAA,kBAAiB,SAAS;AAAA,IAC9B,GAAG,qBAAqBJ,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AACzE,QAAI;AACJ,KAAC,SAAUK,eAAc;AACrB,eAAS,OAAO,MAAM,UAAU;AAC5B,eAAO,EAAE,MAAM,SAAS;AAAA,MAC5B;AACA,MAAAA,cAAa,SAAS;AACtB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOH,IAAG,cAAc,SAAS,KAAK,iBAAiB,GAAG,UAAU,IAAI,KAAK,8BAA8B,YAAY,GAAG,UAAU,QAAQ,MACvI,UAAU,aAAa,UAAaA,IAAG,cAAc,UAAU,QAAQ;AAAA,MAChF;AACA,MAAAG,cAAa,KAAK;AAClB,eAAS,KAAK,KAAK,KAAK;AACpB,cAAM,SAAS,oBAAI,IAAI;AACvB,YAAI,IAAI,aAAa,IAAI,UAAU;AAC/B,iBAAO,IAAI,UAAU;AAAA,QACzB;AACA,YAAI,IAAI,SAAS,IAAI,MAAM;AACvB,iBAAO,IAAI,MAAM;AAAA,QACrB;AACA,YAAI,IAAI,qBAAqB,IAAI,kBAAkB;AAC/C,iBAAO,IAAI,kBAAkB;AAAA,QACjC;AACA,aAAK,IAAI,aAAa,UAAa,IAAI,aAAa,WAAc,CAAC,eAAe,IAAI,UAAU,IAAI,QAAQ,GAAG;AAC3G,iBAAO,IAAI,UAAU;AAAA,QACzB;AACA,aAAK,IAAI,qBAAqB,UAAa,IAAI,qBAAqB,WAAc,CAAC,iBAAiB,OAAO,IAAI,kBAAkB,IAAI,gBAAgB,GAAG;AACpJ,iBAAO,IAAI,kBAAkB;AAAA,QACjC;AACA,eAAO;AAAA,MACX;AACA,MAAAA,cAAa,OAAO;AACpB,eAAS,eAAe,KAAK,OAAO;AAChC,YAAI,QAAQ,OAAO;AACf,iBAAO;AAAA,QACX;AACA,YAAI,QAAQ,QAAQ,QAAQ,UAAa,UAAU,QAAQ,UAAU,QAAW;AAC5E,iBAAO;AAAA,QACX;AACA,YAAI,OAAO,QAAQ,OAAO,OAAO;AAC7B,iBAAO;AAAA,QACX;AACA,YAAI,OAAO,QAAQ,UAAU;AACzB,iBAAO;AAAA,QACX;AACA,cAAM,WAAW,MAAM,QAAQ,GAAG;AAClC,cAAM,aAAa,MAAM,QAAQ,KAAK;AACtC,YAAI,aAAa,YAAY;AACzB,iBAAO;AAAA,QACX;AACA,YAAI,YAAY,YAAY;AACxB,cAAI,IAAI,WAAW,MAAM,QAAQ;AAC7B,mBAAO;AAAA,UACX;AACA,mBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,gBAAI,CAAC,eAAe,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG;AACnC,qBAAO;AAAA,YACX;AAAA,UACJ;AAAA,QACJ;AACA,YAAIH,IAAG,cAAc,GAAG,KAAKA,IAAG,cAAc,KAAK,GAAG;AAClD,gBAAM,UAAU,OAAO,KAAK,GAAG;AAC/B,gBAAM,YAAY,OAAO,KAAK,KAAK;AACnC,cAAI,QAAQ,WAAW,UAAU,QAAQ;AACrC,mBAAO;AAAA,UACX;AACA,kBAAQ,KAAK;AACb,oBAAU,KAAK;AACf,cAAI,CAAC,eAAe,SAAS,SAAS,GAAG;AACrC,mBAAO;AAAA,UACX;AACA,mBAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACrC,kBAAM,OAAO,QAAQ,CAAC;AACtB,gBAAI,CAAC,eAAe,IAAI,IAAI,GAAG,MAAM,IAAI,CAAC,GAAG;AACzC,qBAAO;AAAA,YACX;AAAA,UACJ;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAAA,IACJ,GAAG,iBAAiBF,SAAQ,eAAe,eAAe,CAAC,EAAE;AAC7D,QAAI;AACJ,KAAC,SAAUM,mBAAkB;AACzB,eAAS,OAAO,KAAK,cAAc,SAAS,OAAO;AAC/C,eAAO,EAAE,KAAK,cAAc,SAAS,MAAM;AAAA,MAC/C;AACA,MAAAA,kBAAiB,SAAS;AAC1B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOJ,IAAG,cAAc,SAAS,KAAKA,IAAG,OAAO,UAAU,GAAG,KAAK,8BAA8B,QAAQ,GAAG,UAAU,OAAO,KAAKA,IAAG,WAAW,UAAU,OAAO,aAAa,EAAE;AAAA,MACnL;AACA,MAAAI,kBAAiB,KAAK;AAAA,IAC1B,GAAG,qBAAqBN,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AACzE,QAAI;AACJ,KAAC,SAAUO,uCAAsC;AAC7C,MAAAA,sCAAqC,SAAS;AAC9C,MAAAA,sCAAqC,mBAAmB,WAAW,iBAAiB;AACpF,MAAAA,sCAAqC,OAAO,IAAI,WAAW,iBAAiBA,sCAAqC,MAAM;AAAA,IAC3H,GAAG,yCAAyCP,SAAQ,uCAAuC,uCAAuC,CAAC,EAAE;AAMrI,QAAI;AACJ,KAAC,SAAUQ,sCAAqC;AAC5C,MAAAA,qCAAoC,SAAS;AAC7C,MAAAA,qCAAoC,mBAAmB,WAAW,iBAAiB;AACnF,MAAAA,qCAAoC,OAAO,IAAI,WAAW,yBAAyBA,qCAAoC,MAAM;AAC7H,MAAAA,qCAAoC,qBAAqB,qCAAqC;AAAA,IAClG,GAAG,wCAAwCR,SAAQ,sCAAsC,sCAAsC,CAAC,EAAE;AAClI,QAAI;AACJ,KAAC,SAAUS,0BAAyB;AAChC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOP,IAAG,cAAc,SAAS,KAAK,8BAA8B,SAAS,GAAG,UAAU,KAAK,KAAK,8BAA8B,SAAS,GAAG,UAAU,WAAW,MAAM,UAAU,UAAU,UAAaA,IAAG,WAAW,UAAU,OAAO,aAAa,EAAE;AAAA,MAC5P;AACA,MAAAO,yBAAwB,KAAK;AAC7B,eAAS,OAAO,OAAO,aAAa,OAAO;AACvC,cAAM,SAAS,EAAE,OAAO,YAAY;AACpC,YAAI,UAAU,QAAW;AACrB,iBAAO,QAAQ;AAAA,QACnB;AACA,eAAO;AAAA,MACX;AACA,MAAAA,yBAAwB,SAAS;AAAA,IACrC,GAAG,4BAA4BT,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAC9F,QAAI;AACJ,KAAC,SAAUU,wCAAuC;AAC9C,MAAAA,uCAAsC,SAAS;AAC/C,MAAAA,uCAAsC,mBAAmB,WAAW,iBAAiB;AACrF,MAAAA,uCAAsC,OAAO,IAAI,WAAW,yBAAyBA,uCAAsC,MAAM;AACjI,MAAAA,uCAAsC,qBAAqB,qCAAqC;AAAA,IACpG,GAAG,0CAA0CV,SAAQ,wCAAwC,wCAAwC,CAAC,EAAE;AAMxI,QAAI;AACJ,KAAC,SAAUW,sCAAqC;AAC5C,MAAAA,qCAAoC,SAAS;AAC7C,MAAAA,qCAAoC,mBAAmB,WAAW,iBAAiB;AACnF,MAAAA,qCAAoC,OAAO,IAAI,WAAW,yBAAyBA,qCAAoC,MAAM;AAC7H,MAAAA,qCAAoC,qBAAqB,qCAAqC;AAAA,IAClG,GAAG,wCAAwCX,SAAQ,sCAAsC,sCAAsC,CAAC,EAAE;AAMlI,QAAI;AACJ,KAAC,SAAUY,uCAAsC;AAC7C,MAAAA,sCAAqC,SAAS;AAC9C,MAAAA,sCAAqC,mBAAmB,WAAW,iBAAiB;AACpF,MAAAA,sCAAqC,OAAO,IAAI,WAAW,yBAAyBA,sCAAqC,MAAM;AAC/H,MAAAA,sCAAqC,qBAAqB,qCAAqC;AAAA,IACnG,GAAG,yCAAyCZ,SAAQ,uCAAuC,uCAAuC,CAAC,EAAE;AAAA;AAAA;;;ACtPrI;AAAA,8FAAAa,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,0BAA0B;AAClC,QAAM,aAAa;AAQnB,QAAI;AACJ,KAAC,SAAUC,0BAAyB;AAChC,MAAAA,yBAAwB,SAAS;AACjC,MAAAA,yBAAwB,mBAAmB,WAAW,iBAAiB;AACvE,MAAAA,yBAAwB,OAAO,IAAI,WAAW,oBAAoBA,yBAAwB,MAAM;AAChG,MAAAA,yBAAwB,eAAe,WAAW,GAAG,OAAO,iCAAiC,0BAA0B;AAAA,IAC3H,GAAG,4BAA4BD,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAAA;AAAA;;;ACrB9F;AAAA,iGAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,oCAAoCA,SAAQ,6BAA6B;AACjF,QAAM,aAAa;AAOnB,QAAI;AACJ,KAAC,SAAUC,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,oBAAoBA,4BAA2B,MAAM;AACtG,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,iCAAiC,+BAA+B;AAAA,IACnI,GAAG,+BAA+BD,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAOvG,QAAI;AACJ,KAAC,SAAUE,oCAAmC;AAC1C,MAAAA,mCAAkC,SAAS;AAC3C,MAAAA,mCAAkC,mBAAmB,WAAW,iBAAiB;AACjF,MAAAA,mCAAkC,OAAO,IAAI,WAAW,oBAAoBA,mCAAkC,MAAM;AAAA,IACxH,GAAG,sCAAsCF,SAAQ,oCAAoC,oCAAoC,CAAC,EAAE;AAAA;AAAA;;;AChC5H;AAAA,6EAAAG,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,oBAAoBA,SAAQ,wBAAwBA,SAAQ,2BAA2BA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,uBAAuBA,SAAQ,2BAA2BA,SAAQ,eAAeA,SAAQ,2BAA2BA,SAAQ,oBAAoBA,SAAQ,wBAAwBA,SAAQ,iCAAiCA,SAAQ,YAAYA,SAAQ,cAAcA,SAAQ,kBAAkBA,SAAQ,iBAAiBA,SAAQ,oCAAoCA,SAAQ,uCAAuCA,SAAQ,mCAAmCA,SAAQ,yBAAyBA,SAAQ,kCAAkCA,SAAQ,mCAAmCA,SAAQ,oCAAoCA,SAAQ,iCAAiCA,SAAQ,kCAAkCA,SAAQ,uBAAuBA,SAAQ,6BAA6BA,SAAQ,yBAAyBA,SAAQ,qBAAqBA,SAAQ,0BAA0BA,SAAQ,cAAcA,SAAQ,qCAAqCA,SAAQ,mBAAmBA,SAAQ,kBAAkBA,SAAQ,0BAA0BA,SAAQ,uBAAuBA,SAAQ,oBAAoBA,SAAQ,0BAA0BA,SAAQ,kCAAkCA,SAAQ,4BAA4BA,SAAQ,uBAAuBA,SAAQ,8BAA8BA,SAAQ,sBAAsBA,SAAQ,wBAAwBA,SAAQ,wBAAwBA,SAAQ,sBAAsBA,SAAQ,mBAAmBA,SAAQ,iCAAiCA,SAAQ,yBAAyBA,SAAQ,qBAAqB;AAC5nD,IAAAA,SAAQ,kBAAkBA,SAAQ,yBAAyBA,SAAQ,6BAA6BA,SAAQ,yBAAyBA,SAAQ,6BAA6BA,SAAQ,yBAAyBA,SAAQ,6BAA6BA,SAAQ,2BAA2BA,SAAQ,4BAA4BA,SAAQ,sBAAsBA,SAAQ,iCAAiCA,SAAQ,+BAA+BA,SAAQ,6BAA6BA,SAAQ,6BAA6BA,SAAQ,wBAAwBA,SAAQ,cAAcA,SAAQ,8BAA8BA,SAAQ,oCAAoCA,SAAQ,oCAAoCA,SAAQ,qCAAqCA,SAAQ,gCAAgCA,SAAQ,mBAAmBA,SAAQ,wBAAwBA,SAAQ,qBAAqBA,SAAQ,6BAA6BA,SAAQ,sBAAsBA,SAAQ,2BAA2BA,SAAQ,uBAAuBA,SAAQ,uBAAuBA,SAAQ,wCAAwCA,SAAQ,0BAA0BA,SAAQ,wBAAwBA,SAAQ,wBAAwBA,SAAQ,4BAA4BA,SAAQ,wBAAwBA,SAAQ,uBAAuBA,SAAQ,gBAAgBA,SAAQ,gCAAgCA,SAAQ,kCAAkCA,SAAQ,kCAAkCA,SAAQ,iCAAiCA,SAAQ,4BAA4BA,SAAQ,6BAA6BA,SAAQ,sBAAsBA,SAAQ,yBAAyBA,SAAQ,yBAAyBA,SAAQ,kBAAkBA,SAAQ,gCAAgCA,SAAQ,yBAAyBA,SAAQ,2BAA2B;AACjtD,IAAAA,SAAQ,oCAAoCA,SAAQ,6BAA6BA,SAAQ,0BAA0BA,SAAQ,uCAAuCA,SAAQ,sCAAsCA,SAAQ,wCAAwCA,SAAQ,0BAA0BA,SAAQ,sCAAsCA,SAAQ,uCAAuCA,SAAQ,mBAAmBA,SAAQ,eAAeA,SAAQ,mBAAmBA,SAAQ,mBAAmBA,SAAQ,2BAA2BA,SAAQ,6BAA6BA,SAAQ,4BAA4BA,SAAQ,+BAA+BA,SAAQ,mCAAmCA,SAAQ,0BAA0BA,SAAQ,0BAA0BA,SAAQ,mBAAmBA,SAAQ,4BAA4BA,SAAQ,qBAAqBA,SAAQ,iCAAiCA,SAAQ,+BAA+BA,SAAQ,8BAA8BA,SAAQ,iBAAiBA,SAAQ,cAAc;AAC1+B,QAAM,aAAa;AACnB,QAAM,gCAAgC;AACtC,QAAME,MAAK,aAAa,aAAqB;AAC7C,QAAM,4BAA4B;AAClC,WAAO,eAAeF,UAAS,yBAAyB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAuB,EAAE,CAAC;AAC1J,QAAM,4BAA4B;AAClC,WAAO,eAAeA,UAAS,yBAAyB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAuB,EAAE,CAAC;AAC1J,QAAM,6BAA6B;AACnC,WAAO,eAAeA,UAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,2BAA2B;AAAA,IAAyB,EAAE,CAAC;AAC/J,WAAO,eAAeA,UAAS,yCAAyC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,2BAA2B;AAAA,IAAuC,EAAE,CAAC;AAC3L,QAAM,2BAA2B;AACjC,WAAO,eAAeA,UAAS,wBAAwB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAAsB,EAAE,CAAC;AACvJ,QAAM,2BAA2B;AACjC,WAAO,eAAeA,UAAS,wBAAwB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAAsB,EAAE,CAAC;AACvJ,WAAO,eAAeA,UAAS,4BAA4B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAA0B,EAAE,CAAC;AAC/J,QAAM,0BAA0B;AAChC,WAAO,eAAeA,UAAS,uBAAuB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,wBAAwB;AAAA,IAAqB,EAAE,CAAC;AACpJ,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,wBAAwB;AAAA,IAA4B,EAAE,CAAC;AAClK,QAAM,yBAAyB;AAC/B,WAAO,eAAeA,UAAS,sBAAsB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,uBAAuB;AAAA,IAAoB,EAAE,CAAC;AACjJ,QAAM,4BAA4B;AAClC,WAAO,eAAeA,UAAS,yBAAyB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAuB,EAAE,CAAC;AAC1J,QAAM,sBAAsB;AAC5B,WAAO,eAAeA,UAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAkB,EAAE,CAAC;AAC1I,WAAO,eAAeA,UAAS,iCAAiC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAA+B,EAAE,CAAC;AACpK,WAAO,eAAeA,UAAS,sCAAsC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAoC,EAAE,CAAC;AAC9K,QAAM,2BAA2B;AACjC,WAAO,eAAeA,UAAS,qCAAqC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAAmC,EAAE,CAAC;AACjL,WAAO,eAAeA,UAAS,qCAAqC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAAmC,EAAE,CAAC;AACjL,WAAO,eAAeA,UAAS,+BAA+B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAA6B,EAAE,CAAC;AACrK,QAAM,4BAA4B;AAClC,WAAO,eAAeA,UAAS,eAAe,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAa,EAAE,CAAC;AACtI,WAAO,eAAeA,UAAS,yBAAyB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAuB,EAAE,CAAC;AAC1J,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA4B,EAAE,CAAC;AACpK,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA4B,EAAE,CAAC;AACpK,WAAO,eAAeA,UAAS,gCAAgC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA8B,EAAE,CAAC;AACxK,WAAO,eAAeA,UAAS,kCAAkC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAgC,EAAE,CAAC;AAC5K,QAAM,0BAA0B;AAChC,WAAO,eAAeA,UAAS,uBAAuB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,wBAAwB;AAAA,IAAqB,EAAE,CAAC;AACpJ,QAAM,gCAAgC;AACtC,WAAO,eAAeA,UAAS,6BAA6B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,8BAA8B;AAAA,IAA2B,EAAE,CAAC;AACtK,QAAM,4BAA4B;AAClC,WAAO,eAAeA,UAAS,4BAA4B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA0B,EAAE,CAAC;AAChK,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA4B,EAAE,CAAC;AACpK,WAAO,eAAeA,UAAS,0BAA0B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAwB,EAAE,CAAC;AAC5J,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA4B,EAAE,CAAC;AACpK,WAAO,eAAeA,UAAS,0BAA0B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAwB,EAAE,CAAC;AAC5J,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAA4B,EAAE,CAAC;AACpK,WAAO,eAAeA,UAAS,0BAA0B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,0BAA0B;AAAA,IAAwB,EAAE,CAAC;AAC5J,QAAM,qBAAqB;AAC3B,WAAO,eAAeA,UAAS,mBAAmB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,mBAAmB;AAAA,IAAiB,EAAE,CAAC;AACvI,WAAO,eAAeA,UAAS,eAAe,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,mBAAmB;AAAA,IAAa,EAAE,CAAC;AAC/H,WAAO,eAAeA,UAAS,kBAAkB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,mBAAmB;AAAA,IAAgB,EAAE,CAAC;AACrI,QAAM,2BAA2B;AACjC,WAAO,eAAeA,UAAS,+BAA+B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAA6B,EAAE,CAAC;AACrK,WAAO,eAAeA,UAAS,gCAAgC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAA8B,EAAE,CAAC;AACvK,WAAO,eAAeA,UAAS,kCAAkC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,yBAAyB;AAAA,IAAgC,EAAE,CAAC;AAC3K,QAAM,yBAAyB;AAC/B,WAAO,eAAeA,UAAS,sBAAsB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,uBAAuB;AAAA,IAAoB,EAAE,CAAC;AACjJ,WAAO,eAAeA,UAAS,6BAA6B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,uBAAuB;AAAA,IAA2B,EAAE,CAAC;AAC/J,QAAM,uBAAuB;AAC7B,WAAO,eAAeA,UAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,qBAAqB;AAAA,IAAkB,EAAE,CAAC;AAC3I,WAAO,eAAeA,UAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,qBAAqB;AAAA,IAAyB,EAAE,CAAC;AACzJ,WAAO,eAAeA,UAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,qBAAqB;AAAA,IAAyB,EAAE,CAAC;AACzJ,QAAM,wBAAwB;AAC9B,WAAO,eAAeA,UAAS,oCAAoC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,sBAAsB;AAAA,IAAkC,EAAE,CAAC;AAC5K,WAAO,eAAeA,UAAS,gCAAgC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,sBAAsB;AAAA,IAA8B,EAAE,CAAC;AACpK,WAAO,eAAeA,UAAS,6BAA6B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,sBAAsB;AAAA,IAA2B,EAAE,CAAC;AAC9J,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,sBAAsB;AAAA,IAA4B,EAAE,CAAC;AAChK,WAAO,eAAeA,UAAS,4BAA4B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,sBAAsB;AAAA,IAA0B,EAAE,CAAC;AAC5J,QAAM,sBAAsB;AAC5B,WAAO,eAAeA,UAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAkB,EAAE,CAAC;AAC1I,WAAO,eAAeA,UAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAkB,EAAE,CAAC;AAC1I,WAAO,eAAeA,UAAS,gBAAgB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAc,EAAE,CAAC;AAClI,WAAO,eAAeA,UAAS,oBAAoB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAkB,EAAE,CAAC;AAC1I,WAAO,eAAeA,UAAS,wCAAwC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAsC,EAAE,CAAC;AAClL,WAAO,eAAeA,UAAS,uCAAuC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAqC,EAAE,CAAC;AAChL,WAAO,eAAeA,UAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAyB,EAAE,CAAC;AACxJ,WAAO,eAAeA,UAAS,yCAAyC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAuC,EAAE,CAAC;AACpL,WAAO,eAAeA,UAAS,uCAAuC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAqC,EAAE,CAAC;AAChL,WAAO,eAAeA,UAAS,wCAAwC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,oBAAoB;AAAA,IAAsC,EAAE,CAAC;AAClL,QAAM,8BAA8B;AACpC,WAAO,eAAeA,UAAS,2BAA2B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,4BAA4B;AAAA,IAAyB,EAAE,CAAC;AAChK,QAAM,iCAAiC;AACvC,WAAO,eAAeA,UAAS,8BAA8B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,+BAA+B;AAAA,IAA4B,EAAE,CAAC;AACzK,WAAO,eAAeA,UAAS,qCAAqC,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,+BAA+B;AAAA,IAAmC,EAAE,CAAC;AASvL,QAAI;AACJ,KAAC,SAAUG,qBAAoB;AAC3B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOD,IAAG,OAAO,SAAS,MAAMA,IAAG,OAAO,UAAU,QAAQ,KAAKA,IAAG,OAAO,UAAU,MAAM,KAAK,YAAY,GAAG,UAAU,OAAO;AAAA,MACpI;AACA,MAAAC,oBAAmB,KAAK;AAAA,IAC5B,GAAG,uBAAuBH,SAAQ,qBAAqB,qBAAqB,CAAC,EAAE;AAO/E,QAAI;AACJ,KAAC,SAAUI,yBAAwB;AAC/B,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOF,IAAG,cAAc,SAAS,MAAMA,IAAG,OAAO,UAAU,YAAY,KAAKA,IAAG,OAAO,UAAU,MAAM,KAAKA,IAAG,OAAO,UAAU,OAAO;AAAA,MAC1I;AACA,MAAAE,wBAAuB,KAAK;AAAA,IAChC,GAAG,2BAA2BJ,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAO3F,QAAI;AACJ,KAAC,SAAUK,iCAAgC;AACvC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOH,IAAG,cAAc,SAAS,MACzBA,IAAG,OAAO,UAAU,QAAQ,KAAK,uBAAuB,GAAG,UAAU,QAAQ,OAC7E,UAAU,aAAa,UAAaA,IAAG,OAAO,UAAU,QAAQ;AAAA,MAC5E;AACA,MAAAG,gCAA+B,KAAK;AAAA,IACxC,GAAG,mCAAmCL,SAAQ,iCAAiC,iCAAiC,CAAC,EAAE;AAKnH,QAAI;AACJ,KAAC,SAAUM,mBAAkB;AACzB,eAAS,GAAG,OAAO;AACf,YAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACvB,iBAAO;AAAA,QACX;AACA,mBAAW,QAAQ,OAAO;AACtB,cAAI,CAACJ,IAAG,OAAO,IAAI,KAAK,CAAC,mBAAmB,GAAG,IAAI,KAAK,CAAC,+BAA+B,GAAG,IAAI,GAAG;AAC9F,mBAAO;AAAA,UACX;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AACA,MAAAI,kBAAiB,KAAK;AAAA,IAC1B,GAAG,qBAAqBN,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AAKzE,QAAI;AACJ,KAAC,SAAUO,sBAAqB;AAC5B,MAAAA,qBAAoB,SAAS;AAC7B,MAAAA,qBAAoB,mBAAmB,WAAW,iBAAiB;AACnE,MAAAA,qBAAoB,OAAO,IAAI,WAAW,oBAAoBA,qBAAoB,MAAM;AAAA,IAC5F,GAAG,wBAAwBP,SAAQ,sBAAsB,sBAAsB,CAAC,EAAE;AAKlF,QAAI;AACJ,KAAC,SAAUQ,wBAAuB;AAC9B,MAAAA,uBAAsB,SAAS;AAC/B,MAAAA,uBAAsB,mBAAmB,WAAW,iBAAiB;AACrE,MAAAA,uBAAsB,OAAO,IAAI,WAAW,oBAAoBA,uBAAsB,MAAM;AAAA,IAChG,GAAG,0BAA0BR,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AACxF,QAAI;AACJ,KAAC,SAAUS,wBAAuB;AAI9B,MAAAA,uBAAsB,SAAS;AAI/B,MAAAA,uBAAsB,SAAS;AAI/B,MAAAA,uBAAsB,SAAS;AAAA,IACnC,GAAG,0BAA0BT,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AACxF,QAAI;AACJ,KAAC,SAAUU,sBAAqB;AAK5B,MAAAA,qBAAoB,QAAQ;AAK5B,MAAAA,qBAAoB,gBAAgB;AAMpC,MAAAA,qBAAoB,wBAAwB;AAK5C,MAAAA,qBAAoB,OAAO;AAAA,IAC/B,GAAG,wBAAwBV,SAAQ,sBAAsB,sBAAsB,CAAC,EAAE;AAMlF,QAAI;AACJ,KAAC,SAAUW,8BAA6B;AACpC,MAAAA,6BAA4B,SAAS;AAAA,IACzC,GAAG,gCAAgCX,SAAQ,8BAA8B,8BAA8B,CAAC,EAAE;AAM1G,QAAI;AACJ,KAAC,SAAUY,uBAAsB;AAI7B,MAAAA,sBAAqB,OAAO;AAO5B,MAAAA,sBAAqB,QAAQ;AAQ7B,MAAAA,sBAAqB,QAAQ;AAAA,IACjC,GAAG,yBAAyBZ,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AAKrF,QAAI;AACJ,KAAC,SAAUa,4BAA2B;AAClC,eAAS,MAAM,OAAO;AAClB,cAAM,YAAY;AAClB,eAAO,aAAaX,IAAG,OAAO,UAAU,EAAE,KAAK,UAAU,GAAG,SAAS;AAAA,MACzE;AACA,MAAAW,2BAA0B,QAAQ;AAAA,IACtC,GAAG,8BAA8Bb,SAAQ,4BAA4B,4BAA4B,CAAC,EAAE;AAKpG,QAAI;AACJ,KAAC,SAAUc,kCAAiC;AACxC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAO,cAAc,UAAU,qBAAqB,QAAQ,iBAAiB,GAAG,UAAU,gBAAgB;AAAA,MAC9G;AACA,MAAAA,iCAAgC,KAAK;AAAA,IACzC,GAAG,oCAAoCd,SAAQ,kCAAkC,kCAAkC,CAAC,EAAE;AAKtH,QAAI;AACJ,KAAC,SAAUe,0BAAyB;AAChC,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOb,IAAG,cAAc,SAAS,MAAM,UAAU,qBAAqB,UAAaA,IAAG,QAAQ,UAAU,gBAAgB;AAAA,MAC5H;AACA,MAAAa,yBAAwB,KAAK;AAC7B,eAAS,oBAAoB,OAAO;AAChC,cAAM,YAAY;AAClB,eAAO,aAAab,IAAG,QAAQ,UAAU,gBAAgB;AAAA,MAC7D;AACA,MAAAa,yBAAwB,sBAAsB;AAAA,IAClD,GAAG,4BAA4Bf,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAQ9F,QAAI;AACJ,KAAC,SAAUgB,oBAAmB;AAC1B,MAAAA,mBAAkB,SAAS;AAC3B,MAAAA,mBAAkB,mBAAmB,WAAW,iBAAiB;AACjE,MAAAA,mBAAkB,OAAO,IAAI,WAAW,oBAAoBA,mBAAkB,MAAM;AAAA,IACxF,GAAG,sBAAsBhB,SAAQ,oBAAoB,oBAAoB,CAAC,EAAE;AAI5E,QAAI;AACJ,KAAC,SAAUiB,uBAAsB;AAO7B,MAAAA,sBAAqB,yBAAyB;AAAA,IAClD,GAAG,yBAAyBjB,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AAMrF,QAAI;AACJ,KAAC,SAAUkB,0BAAyB;AAChC,MAAAA,yBAAwB,SAAS;AACjC,MAAAA,yBAAwB,mBAAmB,WAAW,iBAAiB;AACvE,MAAAA,yBAAwB,OAAO,IAAI,WAAW,yBAAyBA,yBAAwB,MAAM;AAAA,IACzG,GAAG,4BAA4BlB,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAQ9F,QAAI;AACJ,KAAC,SAAUmB,kBAAiB;AACxB,MAAAA,iBAAgB,SAAS;AACzB,MAAAA,iBAAgB,mBAAmB,WAAW,iBAAiB;AAC/D,MAAAA,iBAAgB,OAAO,IAAI,WAAW,qBAAqBA,iBAAgB,MAAM;AAAA,IACrF,GAAG,oBAAoBnB,SAAQ,kBAAkB,kBAAkB,CAAC,EAAE;AAMtE,QAAI;AACJ,KAAC,SAAUoB,mBAAkB;AACzB,MAAAA,kBAAiB,SAAS;AAC1B,MAAAA,kBAAiB,mBAAmB,WAAW,iBAAiB;AAChE,MAAAA,kBAAiB,OAAO,IAAI,WAAW,0BAA0BA,kBAAiB,MAAM;AAAA,IAC5F,GAAG,qBAAqBpB,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AAMzE,QAAIqB;AACJ,KAAC,SAAUA,qCAAoC;AAC3C,MAAAA,oCAAmC,SAAS;AAC5C,MAAAA,oCAAmC,mBAAmB,WAAW,iBAAiB;AAClF,MAAAA,oCAAmC,OAAO,IAAI,WAAW,yBAAyBA,oCAAmC,MAAM;AAC3H,MAAAA,oCAAmC,eAAe,WAAW,GAAG,OAAO,oCAAoC,MAAS;AAAA,IACxH,GAAGA,wCAAuCrB,SAAQ,qCAAqCqB,sCAAqC,CAAC,EAAE;AAK/H,QAAI;AACJ,KAAC,SAAUC,cAAa;AAIpB,MAAAA,aAAY,QAAQ;AAIpB,MAAAA,aAAY,UAAU;AAItB,MAAAA,aAAY,OAAO;AAInB,MAAAA,aAAY,MAAM;AAMlB,MAAAA,aAAY,QAAQ;AAAA,IACxB,GAAG,gBAAgBtB,SAAQ,cAAc,cAAc,CAAC,EAAE;AAK1D,QAAI;AACJ,KAAC,SAAUuB,0BAAyB;AAChC,MAAAA,yBAAwB,SAAS;AACjC,MAAAA,yBAAwB,mBAAmB,WAAW,iBAAiB;AACvE,MAAAA,yBAAwB,OAAO,IAAI,WAAW,yBAAyBA,yBAAwB,MAAM;AACrG,MAAAA,yBAAwB,eAAe,WAAW,GAAG,OAAO,sBAAsB,MAAS;AAAA,IAC/F,GAAG,4BAA4BvB,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAK9F,QAAI;AACJ,KAAC,SAAUwB,qBAAoB;AAC3B,MAAAA,oBAAmB,SAAS;AAC5B,MAAAA,oBAAmB,mBAAmB,WAAW,iBAAiB;AAClE,MAAAA,oBAAmB,OAAO,IAAI,WAAW,oBAAoBA,oBAAmB,MAAM;AACtF,MAAAA,oBAAmB,eAAe,WAAW,GAAG,OAAO,sBAAsB,MAAS;AAAA,IAC1F,GAAG,uBAAuBxB,SAAQ,qBAAqB,qBAAqB,CAAC,EAAE;AAK/E,QAAI;AACJ,KAAC,SAAUyB,yBAAwB;AAC/B,MAAAA,wBAAuB,SAAS;AAChC,MAAAA,wBAAuB,mBAAmB,WAAW,iBAAiB;AACtE,MAAAA,wBAAuB,OAAO,IAAI,WAAW,yBAAyBA,wBAAuB,MAAM;AAAA,IACvG,GAAG,2BAA2BzB,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAM3F,QAAI;AACJ,KAAC,SAAU0B,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,yBAAyBA,4BAA2B,MAAM;AAAA,IAC/G,GAAG,+BAA+B1B,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAKvG,QAAI2B;AACJ,KAAC,SAAUA,uBAAsB;AAI7B,MAAAA,sBAAqB,OAAO;AAK5B,MAAAA,sBAAqB,OAAO;AAM5B,MAAAA,sBAAqB,cAAc;AAAA,IACvC,GAAGA,0BAAyB3B,SAAQ,uBAAuB2B,wBAAuB,CAAC,EAAE;AAWrF,QAAI;AACJ,KAAC,SAAUC,kCAAiC;AACxC,MAAAA,iCAAgC,SAAS;AACzC,MAAAA,iCAAgC,mBAAmB,WAAW,iBAAiB;AAC/E,MAAAA,iCAAgC,OAAO,IAAI,WAAW,yBAAyBA,iCAAgC,MAAM;AACrH,MAAAA,iCAAgC,eAAe,WAAW,GAAG,OAAO,gCAAgC,4BAA4B;AAAA,IACpI,GAAG,oCAAoC5B,SAAQ,kCAAkC,kCAAkC,CAAC,EAAE;AACtH,QAAI;AACJ,KAAC,SAAU6B,iCAAgC;AAIvC,eAAS,cAAc,OAAO;AAC1B,cAAM,YAAY;AAClB,eAAO,cAAc,UAAa,cAAc,QAC5C,OAAO,UAAU,SAAS,YAAY,UAAU,UAAU,WACzD,UAAU,gBAAgB,UAAa,OAAO,UAAU,gBAAgB;AAAA,MACjF;AACA,MAAAA,gCAA+B,gBAAgB;AAI/C,eAAS,OAAO,OAAO;AACnB,cAAM,YAAY;AAClB,eAAO,cAAc,UAAa,cAAc,QAC5C,OAAO,UAAU,SAAS,YAAY,UAAU,UAAU,UAAa,UAAU,gBAAgB;AAAA,MACzG;AACA,MAAAA,gCAA+B,SAAS;AAAA,IAC5C,GAAG,mCAAmC7B,SAAQ,iCAAiC,iCAAiC,CAAC,EAAE;AAKnH,QAAI;AACJ,KAAC,SAAU8B,oCAAmC;AAC1C,MAAAA,mCAAkC,SAAS;AAC3C,MAAAA,mCAAkC,mBAAmB,WAAW,iBAAiB;AACjF,MAAAA,mCAAkC,OAAO,IAAI,WAAW,yBAAyBA,mCAAkC,MAAM;AACzH,MAAAA,mCAAkC,eAAe,WAAW,GAAG,OAAO,gCAAgC,kBAAkB;AAAA,IAC5H,GAAG,sCAAsC9B,SAAQ,oCAAoC,oCAAoC,CAAC,EAAE;AAU5H,QAAI;AACJ,KAAC,SAAU+B,mCAAkC;AACzC,MAAAA,kCAAiC,SAAS;AAC1C,MAAAA,kCAAiC,mBAAmB,WAAW,iBAAiB;AAChF,MAAAA,kCAAiC,OAAO,IAAI,WAAW,yBAAyBA,kCAAiC,MAAM;AACvH,MAAAA,kCAAiC,eAAe,WAAW,GAAG,OAAO,gCAAgC,4BAA4B;AAAA,IACrI,GAAG,qCAAqC/B,SAAQ,mCAAmC,mCAAmC,CAAC,EAAE;AAKzH,QAAI;AACJ,KAAC,SAAUgC,kCAAiC;AACxC,MAAAA,iCAAgC,SAAS;AACzC,MAAAA,iCAAgC,mBAAmB,WAAW,iBAAiB;AAC/E,MAAAA,iCAAgC,OAAO,IAAI,WAAW,yBAAyBA,iCAAgC,MAAM;AACrH,MAAAA,iCAAgC,eAAe,WAAW,GAAG,OAAO,wCAAwC,uBAAuB;AAAA,IACvI,GAAG,oCAAoChC,SAAQ,kCAAkC,kCAAkC,CAAC,EAAE;AAItH,QAAI;AACJ,KAAC,SAAUiC,yBAAwB;AAK/B,MAAAA,wBAAuB,SAAS;AAIhC,MAAAA,wBAAuB,aAAa;AAIpC,MAAAA,wBAAuB,WAAW;AAAA,IACtC,GAAG,2BAA2BjC,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAK3F,QAAI;AACJ,KAAC,SAAUkC,mCAAkC;AACzC,MAAAA,kCAAiC,SAAS;AAC1C,MAAAA,kCAAiC,mBAAmB,WAAW,iBAAiB;AAChF,MAAAA,kCAAiC,OAAO,IAAI,WAAW,yBAAyBA,kCAAiC,MAAM;AACvH,MAAAA,kCAAiC,eAAe,WAAW,GAAG,OAAO,yCAAyC,2BAA2B;AAAA,IAC7I,GAAG,qCAAqClC,SAAQ,mCAAmC,mCAAmC,CAAC,EAAE;AASzH,QAAI;AACJ,KAAC,SAAUmC,uCAAsC;AAC7C,MAAAA,sCAAqC,SAAS;AAC9C,MAAAA,sCAAqC,mBAAmB,WAAW,iBAAiB;AACpF,MAAAA,sCAAqC,OAAO,IAAI,WAAW,oBAAoBA,sCAAqC,MAAM;AAC1H,MAAAA,sCAAqC,eAAe,WAAW,GAAG,OAAO,kDAAkD,oCAAoC;AAAA,IACnK,GAAG,yCAAyCnC,SAAQ,uCAAuC,uCAAuC,CAAC,EAAE;AAKrI,QAAIoC;AACJ,KAAC,SAAUA,oCAAmC;AAC1C,MAAAA,mCAAkC,SAAS;AAC3C,MAAAA,mCAAkC,mBAAmB,WAAW,iBAAiB;AACjF,MAAAA,mCAAkC,OAAO,IAAI,WAAW,yBAAyBA,mCAAkC,MAAM;AACzH,MAAAA,mCAAkC,eAAe,WAAW,GAAG,OAAO,mCAAmC,MAAS;AAAA,IACtH,GAAGA,uCAAsCpC,SAAQ,oCAAoCoC,qCAAoC,CAAC,EAAE;AAI5H,QAAIC;AACJ,KAAC,SAAUA,iBAAgB;AAIvB,MAAAA,gBAAe,UAAU;AAIzB,MAAAA,gBAAe,UAAU;AAIzB,MAAAA,gBAAe,UAAU;AAAA,IAC7B,GAAGA,oBAAmBrC,SAAQ,iBAAiBqC,kBAAiB,CAAC,EAAE;AACnE,QAAI;AACJ,KAAC,SAAUC,kBAAiB;AACxB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOpC,IAAG,cAAc,SAAS,MAAM,8BAA8B,IAAI,GAAG,UAAU,OAAO,KAAK,8BAA8B,gBAAgB,GAAG,UAAU,OAAO,MAAMA,IAAG,OAAO,UAAU,OAAO;AAAA,MACzM;AACA,MAAAoC,iBAAgB,KAAK;AAAA,IACzB,GAAG,oBAAoBtC,SAAQ,kBAAkB,kBAAkB,CAAC,EAAE;AACtE,QAAI;AACJ,KAAC,SAAUuC,cAAa;AACpB,eAAS,GAAG,OAAO;AACf,cAAM,YAAY;AAClB,eAAOrC,IAAG,OAAO,SAAS,KAAK,gBAAgB,GAAG,SAAS;AAAA,MAC/D;AACA,MAAAqC,aAAY,KAAK;AAAA,IACrB,GAAG,gBAAgBvC,SAAQ,cAAc,cAAc,CAAC,EAAE;AAC1D,QAAI;AACJ,KAAC,SAAUwC,YAAW;AAIlB,MAAAA,WAAU,SAAS;AAInB,MAAAA,WAAU,SAAS;AAInB,MAAAA,WAAU,SAAS;AAAA,IACvB,GAAG,cAAcxC,SAAQ,YAAY,YAAY,CAAC,EAAE;AAKpD,QAAI;AACJ,KAAC,SAAUyC,iCAAgC;AACvC,MAAAA,gCAA+B,SAAS;AACxC,MAAAA,gCAA+B,mBAAmB,WAAW,iBAAiB;AAC9E,MAAAA,gCAA+B,OAAO,IAAI,WAAW,yBAAyBA,gCAA+B,MAAM;AACnH,MAAAA,gCAA+B,eAAe,WAAW,GAAG,OAAO,mCAAmC,MAAS;AAAA,IACnH,GAAG,mCAAmCzC,SAAQ,iCAAiC,iCAAiC,CAAC,EAAE;AAInH,QAAI;AACJ,KAAC,SAAU0C,wBAAuB;AAK9B,MAAAA,uBAAsB,UAAU;AAKhC,MAAAA,uBAAsB,mBAAmB;AAIzC,MAAAA,uBAAsB,kCAAkC;AAAA,IAC5D,GAAG,0BAA0B1C,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AAYxF,QAAI;AACJ,KAAC,SAAU2C,oBAAmB;AAC1B,MAAAA,mBAAkB,SAAS;AAC3B,MAAAA,mBAAkB,mBAAmB,WAAW,iBAAiB;AACjE,MAAAA,mBAAkB,OAAO,IAAI,WAAW,oBAAoBA,mBAAkB,MAAM;AACpF,MAAAA,mBAAkB,eAAe,WAAW,GAAG,OAAO,2BAA2B,oBAAoB;AAAA,IACzG,GAAG,sBAAsB3C,SAAQ,oBAAoB,oBAAoB,CAAC,EAAE;AAM5E,QAAI;AACJ,KAAC,SAAU4C,2BAA0B;AACjC,MAAAA,0BAAyB,SAAS;AAClC,MAAAA,0BAAyB,mBAAmB,WAAW,iBAAiB;AACxE,MAAAA,0BAAyB,OAAO,IAAI,WAAW,oBAAoBA,0BAAyB,MAAM;AAClG,MAAAA,0BAAyB,eAAe,WAAW,GAAG,OAAO,yDAAyD,oCAAoC;AAAA,IAC9J,GAAG,6BAA6B5C,SAAQ,2BAA2B,2BAA2B,CAAC,EAAE;AAMjG,QAAI;AACJ,KAAC,SAAU6C,eAAc;AACrB,MAAAA,cAAa,SAAS;AACtB,MAAAA,cAAa,mBAAmB,WAAW,iBAAiB;AAC5D,MAAAA,cAAa,OAAO,IAAI,WAAW,oBAAoBA,cAAa,MAAM;AAC1E,MAAAA,cAAa,eAAe,WAAW,GAAG,OAAO,sBAAsB,eAAe;AAAA,IAC1F,GAAG,iBAAiB7C,SAAQ,eAAe,eAAe,CAAC,EAAE;AAM7D,QAAI;AACJ,KAAC,SAAU8C,2BAA0B;AAIjC,MAAAA,0BAAyB,UAAU;AAInC,MAAAA,0BAAyB,mBAAmB;AAI5C,MAAAA,0BAAyB,gBAAgB;AAAA,IAC7C,GAAG,6BAA6B9C,SAAQ,2BAA2B,2BAA2B,CAAC,EAAE;AACjG,QAAI;AACJ,KAAC,SAAU+C,uBAAsB;AAC7B,MAAAA,sBAAqB,SAAS;AAC9B,MAAAA,sBAAqB,mBAAmB,WAAW,iBAAiB;AACpE,MAAAA,sBAAqB,OAAO,IAAI,WAAW,oBAAoBA,sBAAqB,MAAM;AAC1F,MAAAA,sBAAqB,eAAe,WAAW,GAAG,OAAO,8BAA8B,uBAAuB;AAAA,IAClH,GAAG,yBAAyB/C,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AAOrF,QAAI;AACJ,KAAC,SAAUgD,oBAAmB;AAC1B,MAAAA,mBAAkB,SAAS;AAC3B,MAAAA,mBAAkB,mBAAmB,WAAW,iBAAiB;AACjE,MAAAA,mBAAkB,OAAO,IAAI,WAAW,oBAAoBA,mBAAkB,MAAM;AACpF,MAAAA,mBAAkB,eAAe,WAAW,GAAG,OAAO,2BAA2B,oBAAoB;AAAA,IACzG,GAAG,sBAAsBhD,SAAQ,oBAAoB,oBAAoB,CAAC,EAAE;AAO5E,QAAI;AACJ,KAAC,SAAUiD,oBAAmB;AAC1B,MAAAA,mBAAkB,SAAS;AAC3B,MAAAA,mBAAkB,mBAAmB,WAAW,iBAAiB;AACjE,MAAAA,mBAAkB,OAAO,IAAI,WAAW,oBAAoBA,mBAAkB,MAAM;AACpF,MAAAA,mBAAkB,eAAe,WAAW,GAAG,OAAO,2BAA2B,oBAAoB;AAAA,IACzG,GAAG,sBAAsBjD,SAAQ,oBAAoB,oBAAoB,CAAC,EAAE;AAO5E,QAAI;AACJ,KAAC,SAAUkD,2BAA0B;AACjC,MAAAA,0BAAyB,SAAS;AAClC,MAAAA,0BAAyB,mBAAmB,WAAW,iBAAiB;AACxE,MAAAA,0BAAyB,OAAO,IAAI,WAAW,oBAAoBA,0BAAyB,MAAM;AAClG,MAAAA,0BAAyB,eAAe,WAAW,GAAG,OAAO,kCAAkC,2BAA2B;AAAA,IAC9H,GAAG,6BAA6BlD,SAAQ,2BAA2B,2BAA2B,CAAC,EAAE;AAOjG,QAAI;AACJ,KAAC,SAAUmD,wBAAuB;AAC9B,MAAAA,uBAAsB,SAAS;AAC/B,MAAAA,uBAAsB,mBAAmB,WAAW,iBAAiB;AACrE,MAAAA,uBAAsB,OAAO,IAAI,WAAW,oBAAoBA,uBAAsB,MAAM;AAC5F,MAAAA,uBAAsB,eAAe,WAAW,GAAG,OAAO,+BAA+B,wBAAwB;AAAA,IACrH,GAAG,0BAA0BnD,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AAIxF,QAAI;AACJ,KAAC,SAAUoD,oBAAmB;AAC1B,MAAAA,mBAAkB,SAAS;AAC3B,MAAAA,mBAAkB,mBAAmB,WAAW,iBAAiB;AACjE,MAAAA,mBAAkB,OAAO,IAAI,WAAW,oBAAoBA,mBAAkB,MAAM;AACpF,MAAAA,mBAAkB,eAAe,WAAW,GAAG,OAAO,2BAA2B,oBAAoB;AAAA,IACzG,GAAG,sBAAsBpD,SAAQ,oBAAoB,oBAAoB,CAAC,EAAE;AAM5E,QAAI;AACJ,KAAC,SAAUqD,2BAA0B;AACjC,MAAAA,0BAAyB,SAAS;AAClC,MAAAA,0BAAyB,mBAAmB,WAAW,iBAAiB;AACxE,MAAAA,0BAAyB,OAAO,IAAI,WAAW,oBAAoBA,0BAAyB,MAAM;AAClG,MAAAA,0BAAyB,eAAe,WAAW,GAAG,OAAO,0CAA0C,oCAAoC;AAAA,IAC/I,GAAG,6BAA6BrD,SAAQ,2BAA2B,2BAA2B,CAAC,EAAE;AAYjG,QAAI;AACJ,KAAC,SAAUsD,yBAAwB;AAC/B,MAAAA,wBAAuB,SAAS;AAChC,MAAAA,wBAAuB,mBAAmB,WAAW,iBAAiB;AACtE,MAAAA,wBAAuB,OAAO,IAAI,WAAW,oBAAoBA,wBAAuB,MAAM;AAC9F,MAAAA,wBAAuB,eAAe,WAAW,GAAG,OAAO,oBAAoB,yBAAyB;AAAA,IAC5G,GAAG,2BAA2BtD,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAO3F,QAAI;AACJ,KAAC,SAAUuD,gCAA+B;AACtC,MAAAA,+BAA8B,SAAS;AACvC,MAAAA,+BAA8B,mBAAmB,WAAW,iBAAiB;AAC7E,MAAAA,+BAA8B,OAAO,IAAI,WAAW,oBAAoBA,+BAA8B,MAAM;AAC5G,MAAAA,+BAA8B,eAAe,WAAW,GAAG,OAAO,mCAAmC,yCAAyC;AAAA,IAClJ,GAAG,kCAAkCvD,SAAQ,gCAAgC,gCAAgC,CAAC,EAAE;AAIhH,QAAI;AACJ,KAAC,SAAUwD,kBAAiB;AACxB,MAAAA,iBAAgB,SAAS;AACzB,MAAAA,iBAAgB,mBAAmB,WAAW,iBAAiB;AAC/D,MAAAA,iBAAgB,OAAO,IAAI,WAAW,oBAAoBA,iBAAgB,MAAM;AAChF,MAAAA,iBAAgB,eAAe,WAAW,GAAG,OAAO,yBAAyB,kBAAkB;AAAA,IACnG,GAAG,oBAAoBxD,SAAQ,kBAAkB,kBAAkB,CAAC,EAAE;AAItE,QAAI;AACJ,KAAC,SAAUyD,yBAAwB;AAC/B,MAAAA,wBAAuB,SAAS;AAChC,MAAAA,wBAAuB,mBAAmB,WAAW,iBAAiB;AACtE,MAAAA,wBAAuB,OAAO,IAAI,WAAW,oBAAoBA,wBAAuB,MAAM;AAC9F,MAAAA,wBAAuB,eAAe,WAAW,GAAG,OAAO,wCAAwC,kCAAkC;AAAA,IACzI,GAAG,2BAA2BzD,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAM3F,QAAI;AACJ,KAAC,SAAU0D,yBAAwB;AAC/B,MAAAA,wBAAuB,SAAS;AAChC,MAAAA,wBAAuB,mBAAmB,WAAW,iBAAiB;AACtE,MAAAA,wBAAuB,OAAO,IAAI,WAAW,qBAAqBA,wBAAuB,MAAM;AAC/F,MAAAA,wBAAuB,eAAe,WAAW,GAAG,OAAO,sBAAsB,MAAS;AAAA,IAC9F,GAAG,2BAA2B1D,SAAQ,yBAAyB,yBAAyB,CAAC,EAAE;AAI3F,QAAI;AACJ,KAAC,SAAU2D,sBAAqB;AAC5B,MAAAA,qBAAoB,SAAS;AAC7B,MAAAA,qBAAoB,mBAAmB,WAAW,iBAAiB;AACnE,MAAAA,qBAAoB,OAAO,IAAI,WAAW,oBAAoBA,qBAAoB,MAAM;AACxF,MAAAA,qBAAoB,eAAe,WAAW,GAAG,OAAO,6BAA6B,sBAAsB;AAAA,IAC/G,GAAG,wBAAwB3D,SAAQ,sBAAsB,sBAAsB,CAAC,EAAE;AAMlF,QAAI;AACJ,KAAC,SAAU4D,6BAA4B;AACnC,MAAAA,4BAA2B,SAAS;AACpC,MAAAA,4BAA2B,mBAAmB,WAAW,iBAAiB;AAC1E,MAAAA,4BAA2B,OAAO,IAAI,WAAW,oBAAoBA,4BAA2B,MAAM;AACtG,MAAAA,4BAA2B,eAAe,WAAW,GAAG,OAAO,6BAA6B,sCAAsC;AAAA,IACtI,GAAG,+BAA+B5D,SAAQ,6BAA6B,6BAA6B,CAAC,EAAE;AAIvG,QAAI;AACJ,KAAC,SAAU6D,4BAA2B;AAClC,MAAAA,2BAA0B,SAAS;AACnC,MAAAA,2BAA0B,mBAAmB,WAAW,iBAAiB;AACzE,MAAAA,2BAA0B,OAAO,IAAI,WAAW,oBAAoBA,2BAA0B,MAAM;AACpG,MAAAA,2BAA0B,eAAe,WAAW,GAAG,OAAO,2BAA2B,4BAA4B;AAAA,IACzH,GAAG,8BAA8B7D,SAAQ,4BAA4B,4BAA4B,CAAC,EAAE;AAIpG,QAAI;AACJ,KAAC,SAAU8D,iCAAgC;AACvC,MAAAA,gCAA+B,SAAS;AACxC,MAAAA,gCAA+B,mBAAmB,WAAW,iBAAiB;AAC9E,MAAAA,gCAA+B,OAAO,IAAI,WAAW,oBAAoBA,gCAA+B,MAAM;AAC9G,MAAAA,gCAA+B,eAAe,WAAW,GAAG,OAAO,gCAAgC,iCAAiC;AAAA,IACxI,GAAG,mCAAmC9D,SAAQ,iCAAiC,iCAAiC,CAAC,EAAE;AAMnH,QAAI;AACJ,KAAC,SAAU+D,kCAAiC;AACxC,MAAAA,iCAAgC,SAAS;AACzC,MAAAA,iCAAgC,mBAAmB,WAAW,iBAAiB;AAC/E,MAAAA,iCAAgC,OAAO,IAAI,WAAW,oBAAoBA,iCAAgC,MAAM;AAChH,MAAAA,iCAAgC,eAAe,WAAW,GAAG,OAAO,8CAA8C,+CAA+C;AAAA,IACrK,GAAG,oCAAoC/D,SAAQ,kCAAkC,kCAAkC,CAAC,EAAE;AAItH,QAAI;AACJ,KAAC,SAAUgE,kCAAiC;AACxC,MAAAA,iCAAgC,SAAS;AACzC,MAAAA,iCAAgC,mBAAmB,WAAW,iBAAiB;AAC/E,MAAAA,iCAAgC,OAAO,IAAI,WAAW,oBAAoBA,iCAAgC,MAAM;AAChH,MAAAA,iCAAgC,eAAe,WAAW,GAAG,OAAO,iCAAiC,kCAAkC;AAAA,IAC3I,GAAG,oCAAoChE,SAAQ,kCAAkC,kCAAkC,CAAC,EAAE;AAEtH,QAAI;AACJ,KAAC,SAAUiE,gCAA+B;AAKtC,MAAAA,+BAA8B,aAAa;AAAA,IAC/C,GAAG,kCAAkCjE,SAAQ,gCAAgC,gCAAgC,CAAC,EAAE;AAIhH,QAAI;AACJ,KAAC,SAAUkE,gBAAe;AACtB,MAAAA,eAAc,SAAS;AACvB,MAAAA,eAAc,mBAAmB,WAAW,iBAAiB;AAC7D,MAAAA,eAAc,OAAO,IAAI,WAAW,oBAAoBA,eAAc,MAAM;AAC5E,MAAAA,eAAc,eAAe,WAAW,GAAG,OAAO,uBAAuB,gBAAgB;AAAA,IAC7F,GAAG,kBAAkBlE,SAAQ,gBAAgB,gBAAgB,CAAC,EAAE;AAMhE,QAAI;AACJ,KAAC,SAAUmE,uBAAsB;AAC7B,MAAAA,sBAAqB,SAAS;AAC9B,MAAAA,sBAAqB,mBAAmB,WAAW,iBAAiB;AACpE,MAAAA,sBAAqB,OAAO,IAAI,WAAW,oBAAoBA,sBAAqB,MAAM;AAC1F,MAAAA,sBAAqB,eAAe,WAAW,GAAG,OAAO,sCAAsC,gCAAgC;AAAA,IACnI,GAAG,yBAAyBnE,SAAQ,uBAAuB,uBAAuB,CAAC,EAAE;AAKrF,QAAI;AACJ,KAAC,SAAUoE,wBAAuB;AAC9B,MAAAA,uBAAsB,SAAS;AAC/B,MAAAA,uBAAsB,mBAAmB,WAAW,iBAAiB;AACrE,MAAAA,uBAAsB,OAAO,IAAI,WAAW,oBAAoBA,uBAAsB,MAAM;AAC5F,MAAAA,uBAAsB,eAAe,WAAW,GAAG,OAAO,4BAA4B,wBAAwB;AAAA,IAClH,GAAG,0BAA0BpE,SAAQ,wBAAwB,wBAAwB,CAAC,EAAE;AAIxF,QAAI;AACJ,KAAC,SAAUqE,4BAA2B;AAClC,MAAAA,2BAA0B,SAAS;AACnC,MAAAA,2BAA0B,mBAAmB,WAAW,iBAAiB;AACzE,MAAAA,2BAA0B,OAAO,IAAI,WAAW,oBAAoB,qBAAqB;AACzF,MAAAA,2BAA0B,eAAe,WAAW,GAAG,OAAO,uBAAuB,MAAS;AAAA,IAClG,GAAG,8BAA8BrE,SAAQ,4BAA4B,4BAA4B,CAAC,EAAE;AAAA;AAAA;;;ACtgCpG,IAAAsE,sBAAA;AAAA,+EAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,2BAA2B;AACnC,QAAM,mBAAmB;AACzB,aAAS,yBAAyB,OAAO,QAAQ,QAAQ,SAAS;AAC9D,UAAI,iBAAiB,mBAAmB,GAAG,OAAO,GAAG;AACjD,kBAAU,EAAE,oBAAoB,QAAQ;AAAA,MAC5C;AACA,cAAQ,GAAG,iBAAiB,yBAAyB,OAAO,QAAQ,QAAQ,OAAO;AAAA,IACvF;AAAA;AAAA;;;ACbA,IAAAC,eAAA;AAAA,wEAAAC,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAiB,SAAS,GAAGA,UAAS;AACnE,eAAS,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKA,UAAS,CAAC,EAAG,iBAAgBA,UAAS,GAAG,CAAC;AAAA,IAC5H;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,gBAAgBA,SAAQ,2BAA2B;AAC3D,iBAAa,eAA2BA,QAAO;AAC/C,iBAAa,2CAAwCA,QAAO;AAC5D,iBAAa,qBAAuBA,QAAO;AAC3C,iBAAa,oBAAuBA,QAAO;AAC3C,QAAI,eAAe;AACnB,WAAO,eAAeA,UAAS,4BAA4B,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,aAAa;AAAA,IAA0B,EAAE,CAAC;AACnJ,QAAIC;AACJ,KAAC,SAAUA,gBAAe;AAOtB,MAAAA,eAAc,6BAA6B;AAS3C,MAAAA,eAAc,gBAAgB;AAQ9B,MAAAA,eAAc,kBAAkB;AAWhC,MAAAA,eAAc,kBAAkB;AAKhC,MAAAA,eAAc,mBAAmB;AAOjC,MAAAA,eAAc,2BAA2B;AAAA,IAC7C,GAAGA,mBAAkBD,SAAQ,gBAAgBC,iBAAgB,CAAC,EAAE;AAAA;AAAA;;;AC5EhE;AAAA,0EAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,wBAAwBA,SAAQ,qBAAqBA,SAAQ,wBAAwB;AAC7F,QAAM,mCAAmC;AACzC,QAAM,wBAAwB,CAAC,SAAS;AACpC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,iBAAiB;AACjB,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,qBAAO,KAAK,WAAW,YAAY,iCAAiC,6BAA6B,IAAI;AAAA,YACzG;AAAA,YACA,IAAI,CAAC,YAAY;AACb,oBAAM,OAAO,iCAAiC,sBAAsB;AACpE,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,YACA,SAAS,CAAC,YAAY;AAClB,oBAAM,OAAO,iCAAiC,2BAA2B;AACzE,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,YACA,SAAS,CAAC,YAAY;AAClB,oBAAM,OAAO,iCAAiC,2BAA2B;AACzE,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,wBAAwB;AAChC,QAAM,qBAAN,MAAyB;AAAA,MAGrB,YAAY,kBAAkB,kBAAkB;AAFhD;AACA;AAEI,aAAK,mBAAmB;AACxB,aAAK,mBAAmB;AAAA,MAC5B;AAAA,MACA,cAAc;AACV,cAAM,iBAAiB,KAAK,iBAAiB;AAC7C,cAAM,iBAAiB,KAAK,iBAAiB;AAC7C,YAAI,aAAa;AACjB,eAAO,aAAa,kBAAkB,aAAa,kBAAkB,KAAK,iBAAiB,UAAU,MAAM,KAAK,iBAAiB,UAAU,GAAG;AAC1I;AAAA,QACJ;AACA,YAAI,aAAa,kBAAkB,aAAa,gBAAgB;AAC5D,cAAI,mBAAmB,iBAAiB;AACxC,cAAI,mBAAmB,iBAAiB;AACxC,iBAAO,oBAAoB,cAAc,oBAAoB,cAAc,KAAK,iBAAiB,gBAAgB,MAAM,KAAK,iBAAiB,gBAAgB,GAAG;AAC5J;AACA;AAAA,UACJ;AAEA,cAAI,mBAAmB,cAAc,mBAAmB,YAAY;AAChE;AACA;AAAA,UACJ;AACA,gBAAM,cAAc,mBAAmB,aAAa;AACpD,gBAAM,UAAU,KAAK,iBAAiB,MAAM,YAAY,mBAAmB,CAAC;AAE5E,cAAI,QAAQ,WAAW,KAAK,QAAQ,CAAC,MAAM,KAAK,iBAAiB,gBAAgB,GAAG;AAChF,mBAAO;AAAA,cACH,EAAE,OAAO,YAAY,aAAa,cAAc,EAAE;AAAA,YACtD;AAAA,UACJ,OACK;AACD,mBAAO;AAAA,cACH,EAAE,OAAO,YAAY,aAAa,MAAM,QAAQ;AAAA,YACpD;AAAA,UACJ;AAAA,QACJ,WACS,aAAa,gBAAgB;AAClC,iBAAO;AAAA,YACH,EAAE,OAAO,YAAY,aAAa,GAAG,MAAM,KAAK,iBAAiB,MAAM,UAAU,EAAE;AAAA,UACvF;AAAA,QACJ,WACS,aAAa,gBAAgB;AAClC,iBAAO;AAAA,YACH,EAAE,OAAO,YAAY,aAAa,iBAAiB,WAAW;AAAA,UAClE;AAAA,QACJ,OACK;AAED,iBAAO,CAAC;AAAA,QACZ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,qBAAqB;AAC7B,QAAM,wBAAN,MAAM,uBAAsB;AAAA,MASxB,cAAc;AARd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEI,aAAK,YAAY;AACjB,aAAK,WAAW;AAAA,MACpB;AAAA,MACA,aAAa;AACT,aAAK,MAAM,KAAK,IAAI;AACpB,aAAK,YAAY;AACjB,aAAK,YAAY;AACjB,aAAK,QAAQ,CAAC;AACd,aAAK,gBAAgB,CAAC;AACtB,aAAK,WAAW;AAChB,aAAK,+BAA+B;AAAA,MACxC;AAAA,MACA,KAAK,MAAM,MAAM,QAAQ,WAAW,gBAAgB;AAChD,YAAI,KAAK,iCAAiC,OAAO,KAAK,aAAc,SAAS,KAAK,aAAa,OAAO,KAAK,YAAa;AAEpH,eAAK,+BAA+B;AACpC,eAAK,gBAAgB,uBAAsB,aAAa,KAAK,KAAK;AAAA,QACtE;AACA,YAAI,WAAW;AACf,YAAI,WAAW;AACf,YAAI,KAAK,gCAAgC,KAAK,WAAW,GAAG;AACxD,sBAAY,KAAK;AACjB,cAAI,aAAa,GAAG;AAChB,wBAAY,KAAK;AAAA,UACrB;AAAA,QACJ;AACA,cAAM,aAAa,KAAK,+BAA+B,KAAK,QAAQ,KAAK;AACzE,mBAAW,KAAK,UAAU,IAAI;AAC9B,mBAAW,KAAK,UAAU,IAAI;AAC9B,mBAAW,KAAK,UAAU,IAAI;AAC9B,mBAAW,KAAK,UAAU,IAAI;AAC9B,mBAAW,KAAK,UAAU,IAAI;AAC9B,aAAK,YAAY;AACjB,aAAK,YAAY;AAAA,MACrB;AAAA,MACA,IAAI,KAAK;AACL,eAAO,KAAK,IAAI,SAAS;AAAA,MAC7B;AAAA,MACA,OAAO,aAAa,MAAM;AAEtB,cAAM,aAAc,KAAK,SAAS,IAAK;AACvC,YAAI,WAAW;AACf,YAAI,WAAW;AACf,cAAM,SAAS,CAAC;AAChB,iBAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACjC,gBAAM,YAAY,IAAI;AACtB,cAAI,OAAO,KAAK,SAAS;AACzB,cAAI,OAAO,KAAK,YAAY,CAAC;AAC7B,cAAI,SAAS,GAAG;AAEZ,mBAAO;AACP,oBAAQ;AAAA,UACZ,OACK;AAED,oBAAQ;AAAA,UACZ;AACA,gBAAM,SAAS,KAAK,YAAY,CAAC;AACjC,gBAAM,YAAY,KAAK,YAAY,CAAC;AACpC,gBAAM,iBAAiB,KAAK,YAAY,CAAC;AACzC,iBAAO,YAAY,CAAC,IAAI;AACxB,iBAAO,YAAY,CAAC,IAAI;AACxB,iBAAO,YAAY,CAAC,IAAI;AACxB,iBAAO,YAAY,CAAC,IAAI;AACxB,iBAAO,YAAY,CAAC,IAAI;AACxB,qBAAW;AACX,qBAAW;AAAA,QACf;AACA,eAAO;AAAA,MACX;AAAA,MACA,OAAO,oBAAoB,MAAM;AAC7B,cAAM,MAAM,CAAC;AACb,cAAM,aAAc,KAAK,SAAS,IAAK;AACvC,iBAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACjC,cAAI,CAAC,IAAI;AAAA,QACb;AACA,YAAI,KAAK,CAACC,IAAG,MAAM;AACf,gBAAM,QAAQ,KAAK,IAAIA,EAAC;AACxB,gBAAM,QAAQ,KAAK,IAAI,CAAC;AACxB,cAAI,UAAU,OAAO;AACjB,kBAAM,QAAQ,KAAK,IAAIA,KAAI,CAAC;AAC5B,kBAAM,QAAQ,KAAK,IAAI,IAAI,CAAC;AAC5B,mBAAO,QAAQ;AAAA,UACnB;AACA,iBAAO,QAAQ;AAAA,QACnB,CAAC;AACD,cAAM,SAAS,CAAC;AAChB,YAAI,WAAW;AACf,YAAI,WAAW;AACf,iBAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACjC,gBAAM,YAAY,IAAI,IAAI,CAAC;AAC3B,gBAAM,OAAO,KAAK,YAAY,CAAC;AAC/B,gBAAM,OAAO,KAAK,YAAY,CAAC;AAC/B,gBAAM,SAAS,KAAK,YAAY,CAAC;AACjC,gBAAM,YAAY,KAAK,YAAY,CAAC;AACpC,gBAAM,iBAAiB,KAAK,YAAY,CAAC;AACzC,gBAAM,WAAW,OAAO;AACxB,gBAAM,WAAY,aAAa,IAAI,OAAO,WAAW;AACrD,gBAAM,YAAY,IAAI;AACtB,iBAAO,YAAY,CAAC,IAAI;AACxB,iBAAO,YAAY,CAAC,IAAI;AACxB,iBAAO,YAAY,CAAC,IAAI;AACxB,iBAAO,YAAY,CAAC,IAAI;AACxB,iBAAO,YAAY,CAAC,IAAI;AACxB,qBAAW;AACX,qBAAW;AAAA,QACf;AACA,eAAO;AAAA,MACX;AAAA,MACA,oBAAoB;AAChB,YAAI,KAAK,8BAA8B;AACnC,iBAAO,KAAK;AAAA,QAChB,OACK;AACD,iBAAO,uBAAsB,oBAAoB,KAAK,aAAa;AAAA,QACvE;AAAA,MACJ;AAAA,MACA,eAAe,IAAI;AACf,YAAI,KAAK,OAAO,IAAI;AAChB,eAAK,YAAY,KAAK,kBAAkB;AAAA,QAC5C;AACA,aAAK,WAAW;AAAA,MACpB;AAAA,MACA,QAAQ;AACJ,aAAK,YAAY;AACjB,eAAO;AAAA,UACH,UAAU,KAAK;AAAA,UACf,MAAM,KAAK,kBAAkB;AAAA,QACjC;AAAA,MACJ;AAAA,MACA,gBAAgB;AACZ,eAAO,KAAK,cAAc;AAAA,MAC9B;AAAA,MACA,aAAa;AACT,YAAI,KAAK,cAAc,QAAW;AAC9B,iBAAO;AAAA,YACH,UAAU,KAAK;AAAA,YACf,OAAQ,IAAI,mBAAmB,KAAK,WAAW,KAAK,kBAAkB,CAAC,EAAG,YAAY;AAAA,UAC1F;AAAA,QACJ,OACK;AACD,iBAAO,KAAK,MAAM;AAAA,QACtB;AAAA,MACJ;AAAA,IACJ;AACA,IAAAD,SAAQ,wBAAwB;AAAA;AAAA;;;AC1PhC;AAAA,qFAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,0BAA0B;AAClC,QAAM,mCAAmC;AACzC,QAAM,0BAA0B,CAAC,SAAS;AACtC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,mBAAmB;AACnB,iBAAO;AAAA,YACH,IAAI,CAAC,YAAY;AACb,qBAAO,KAAK,WAAW,UAAU,iCAAiC,wBAAwB,MAAM,CAAC,QAAQ,WAAW;AAChH,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,CAAC;AAAA,cACtE,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,0BAA0B;AAAA;AAAA;;;ACrBlC;AAAA,+EAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,6BAA6B;AACrC,QAAM,mCAAmC;AACzC,QAAM,6BAA6B,CAAC,SAAS;AACzC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,sBAAsB;AACtB,iBAAO;AAAA,YACH,SAAS,CAAC,QAAQ;AACd,qBAAO,KAAK,WAAW,YAAY,iCAAiC,kCAAkC,MAAM,EAAE,IAAI,CAAC;AAAA,YACvH;AAAA,YACA,IAAI,CAAC,YAAY;AACb,qBAAO,KAAK,WAAW,UAAU,iCAAiC,2BAA2B,MAAM,CAAC,QAAQ,WAAW;AACnH,uBAAO,QAAQ,QAAQ,MAAM;AAAA,cACjC,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,6BAA6B;AAAA;AAAA;;;ACxBrC;AAAA,yEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,gBAAgB;AACxB,QAAM,mCAAmC;AAWzC,QAAM,gBAAN,MAAoB;AAAA;AAAA;AAAA;AAAA,MAYhB,YAAY,eAAe;AAX3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAKI,aAAK,iBAAiB;AACtB,aAAK,mBAAmB,oBAAI,IAAI;AAChC,aAAK,sBAAsB,IAAI,iCAAiC,QAAQ;AACxE,aAAK,aAAa,IAAI,iCAAiC,QAAQ;AAC/D,aAAK,cAAc,IAAI,iCAAiC,QAAQ;AAChE,aAAK,aAAa,IAAI,iCAAiC,QAAQ;AAC/D,aAAK,cAAc,IAAI,iCAAiC,QAAQ;AAAA,MACpE;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,YAAY;AACZ,eAAO,KAAK,WAAW;AAAA,MAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,qBAAqB;AACrB,eAAO,KAAK,oBAAoB;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,aAAa;AACb,eAAO,KAAK,YAAY;AAAA,MAC5B;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,oBAAoB,SAAS;AACzB,aAAK,qBAAqB;AAAA,MAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,YAAY;AACZ,eAAO,KAAK,WAAW;AAAA,MAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,aAAa;AACb,eAAO,KAAK,YAAY;AAAA,MAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,KAAK;AACL,eAAO,KAAK,iBAAiB,IAAI,GAAG;AAAA,MACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM;AACF,eAAO,MAAM,KAAK,KAAK,iBAAiB,OAAO,CAAC;AAAA,MACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO;AACH,eAAO,MAAM,KAAK,KAAK,iBAAiB,KAAK,CAAC;AAAA,MAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAcA,OAAOC,aAAY;AACf,QAAAA,YAAW,qBAAqB,iCAAiC,qBAAqB;AACtF,cAAM,cAAc,CAAC;AACrB,oBAAY,KAAKA,YAAW,sBAAsB,CAAC,UAAU;AACzD,gBAAM,KAAK,MAAM;AACjB,gBAAM,WAAW,KAAK,eAAe,OAAO,GAAG,KAAK,GAAG,YAAY,GAAG,SAAS,GAAG,IAAI;AACtF,eAAK,iBAAiB,IAAI,GAAG,KAAK,QAAQ;AAC1C,gBAAM,SAAS,OAAO,OAAO,EAAE,SAAS,CAAC;AACzC,eAAK,WAAW,KAAK,MAAM;AAC3B,eAAK,oBAAoB,KAAK,MAAM;AAAA,QACxC,CAAC,CAAC;AACF,oBAAY,KAAKA,YAAW,wBAAwB,CAAC,UAAU;AAC3D,gBAAM,KAAK,MAAM;AACjB,gBAAM,UAAU,MAAM;AACtB,cAAI,QAAQ,WAAW,GAAG;AACtB;AAAA,UACJ;AACA,gBAAM,EAAE,QAAQ,IAAI;AACpB,cAAI,YAAY,QAAQ,YAAY,QAAW;AAC3C,kBAAM,IAAI,MAAM,sCAAsC,GAAG,GAAG,mCAAmC;AAAA,UACnG;AACA,cAAI,iBAAiB,KAAK,iBAAiB,IAAI,GAAG,GAAG;AACrD,cAAI,mBAAmB,QAAW;AAC9B,6BAAiB,KAAK,eAAe,OAAO,gBAAgB,SAAS,OAAO;AAC5E,iBAAK,iBAAiB,IAAI,GAAG,KAAK,cAAc;AAChD,iBAAK,oBAAoB,KAAK,OAAO,OAAO,EAAE,UAAU,eAAe,CAAC,CAAC;AAAA,UAC7E;AAAA,QACJ,CAAC,CAAC;AACF,oBAAY,KAAKA,YAAW,uBAAuB,CAAC,UAAU;AAC1D,gBAAM,iBAAiB,KAAK,iBAAiB,IAAI,MAAM,aAAa,GAAG;AACvE,cAAI,mBAAmB,QAAW;AAC9B,iBAAK,iBAAiB,OAAO,MAAM,aAAa,GAAG;AACnD,iBAAK,YAAY,KAAK,OAAO,OAAO,EAAE,UAAU,eAAe,CAAC,CAAC;AAAA,UACrE;AAAA,QACJ,CAAC,CAAC;AACF,oBAAY,KAAKA,YAAW,uBAAuB,CAAC,UAAU;AAC1D,gBAAM,iBAAiB,KAAK,iBAAiB,IAAI,MAAM,aAAa,GAAG;AACvE,cAAI,mBAAmB,QAAW;AAC9B,iBAAK,YAAY,KAAK,OAAO,OAAO,EAAE,UAAU,gBAAgB,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,UAC3F;AAAA,QACJ,CAAC,CAAC;AACF,oBAAY,KAAKA,YAAW,gCAAgC,CAAC,OAAO,UAAU;AAC1E,gBAAM,iBAAiB,KAAK,iBAAiB,IAAI,MAAM,aAAa,GAAG;AACvE,cAAI,mBAAmB,UAAa,KAAK,oBAAoB;AACzD,mBAAO,KAAK,mBAAmB,OAAO,OAAO,EAAE,UAAU,gBAAgB,QAAQ,MAAM,OAAO,CAAC,GAAG,KAAK;AAAA,UAC3G,OACK;AACD,mBAAO,CAAC;AAAA,UACZ;AAAA,QACJ,CAAC,CAAC;AACF,oBAAY,KAAKA,YAAW,sBAAsB,CAAC,UAAU;AACzD,gBAAM,iBAAiB,KAAK,iBAAiB,IAAI,MAAM,aAAa,GAAG;AACvE,cAAI,mBAAmB,QAAW;AAC9B,iBAAK,WAAW,KAAK,OAAO,OAAO,EAAE,UAAU,eAAe,CAAC,CAAC;AAAA,UACpE;AAAA,QACJ,CAAC,CAAC;AACF,eAAO,iCAAiC,WAAW,OAAO,MAAM;AAAE,sBAAY,QAAQ,gBAAc,WAAW,QAAQ,CAAC;AAAA,QAAG,CAAC;AAAA,MAChI;AAAA,IACJ;AACA,IAAAD,SAAQ,gBAAgB;AAAA;AAAA;;;ACnLxB;AAAA,oEAAAE,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,oBAAoBA,SAAQ,sBAAsB;AAC1D,QAAM,mCAAmC;AACzC,QAAM,kBAAkB;AACxB,QAAM,sBAAsB,CAAC,SAAS;AAClC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,kBAAkB;AAClB,iBAAO;AAAA,YACH,2BAA2B,CAAC,YAAY;AACpC,qBAAO,KAAK,WAAW,eAAe,iCAAiC,oCAAoC,MAAM,CAAC,WAAW;AACzH,uBAAO,QAAQ,MAAM;AAAA,cACzB,CAAC;AAAA,YACL;AAAA,YACA,6BAA6B,CAAC,YAAY;AACtC,qBAAO,KAAK,WAAW,eAAe,iCAAiC,sCAAsC,MAAM,CAAC,WAAW;AAC3H,uBAAO,QAAQ,MAAM;AAAA,cACzB,CAAC;AAAA,YACL;AAAA,YACA,2BAA2B,CAAC,YAAY;AACpC,qBAAO,KAAK,WAAW,eAAe,iCAAiC,oCAAoC,MAAM,CAAC,WAAW;AACzH,uBAAO,QAAQ,MAAM;AAAA,cACzB,CAAC;AAAA,YACL;AAAA,YACA,4BAA4B,CAAC,YAAY;AACrC,qBAAO,KAAK,WAAW,eAAe,iCAAiC,qCAAqC,MAAM,CAAC,WAAW;AAC1H,uBAAO,QAAQ,MAAM;AAAA,cACzB,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,8BAAN,MAAM,4BAA2B;AAAA,MAAjC;AAEI;AACA;AACA;AAAA;AAAA,MACA,sBAAsB,SAAS;AAC3B,aAAK,cAAc;AACnB,eAAO,iCAAiC,WAAW,OAAO,MAAM;AAAE,eAAK,cAAc;AAAA,QAAW,CAAC;AAAA,MACrG;AAAA,MACA,iBAAiB,QAAQ;AACrB,eAAO,KAAK,eAAe,KAAK,YAAY,MAAM;AAAA,MACtD;AAAA,MACA,wBAAwB,SAAS;AAC7B,aAAK,gBAAgB;AACrB,eAAO,iCAAiC,WAAW,OAAO,MAAM;AAAE,eAAK,gBAAgB;AAAA,QAAS,CAAC;AAAA,MACrG;AAAA,MACA,mBAAmB,QAAQ;AACvB,eAAO,KAAK,iBAAiB,KAAK,cAAc,MAAM;AAAA,MAC1D;AAAA,MACA,uBAAuB,SAAS;AAC5B,aAAK,eAAe;AACpB,eAAO,iCAAiC,WAAW,OAAO,MAAM;AAAE,eAAK,eAAe;AAAA,QAAW,CAAC;AAAA,MACtG;AAAA,MACA,kBAAkB,QAAQ;AACtB,eAAO,KAAK,gBAAgB,KAAK,aAAa,MAAM;AAAA,MACxD;AAAA,MACA,yBAAyB;AACrB,eAAO,4BAA2B;AAAA,MACtC;AAAA,MACA,kCAAkC;AAC9B,eAAO,4BAA2B;AAAA,MACtC;AAAA,MACA,wBAAwB;AACpB,eAAO,4BAA2B;AAAA,MACtC;AAAA,IACJ;AAlCI,kBADE,6BACK,gBAAe,OAAO,OAAO,EAAE,SAAS,MAAM;AAAA,IAAE,EAAE,CAAC;AAD9D,QAAMC,8BAAN;AAoCA,QAAM,oBAAN,MAAwB;AAAA,MAQpB,YAAY,8BAA8B;AAP1C;AACA;AACA;AACA;AACA;AACA;AACA;AAEI,YAAI,wCAAwC,gBAAgB,eAAe;AACvE,eAAK,qBAAqB;AAAA,QAC9B,OACK;AACD,eAAK,qBAAqB,IAAI,gBAAgB,cAAc,4BAA4B;AAAA,QAC5F;AACA,aAAK,oBAAoB,oBAAI,IAAI;AACjC,aAAK,kBAAkB,oBAAI,IAAI;AAC/B,aAAK,aAAa,IAAI,iCAAiC,QAAQ;AAC/D,aAAK,eAAe,IAAI,iCAAiC,QAAQ;AACjE,aAAK,aAAa,IAAI,iCAAiC,QAAQ;AAC/D,aAAK,cAAc,IAAI,iCAAiC,QAAQ;AAAA,MACpE;AAAA,MACA,IAAI,oBAAoB;AACpB,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,oBAAoB,MAAM;AACtB,eAAO,KAAK,mBAAmB,IAAI,KAAK,QAAQ;AAAA,MACpD;AAAA,MACA,oBAAoB,KAAK;AACrB,eAAO,KAAK,kBAAkB,IAAI,GAAG;AAAA,MACzC;AAAA,MACA,gBAAgB,KAAK;AACjB,cAAM,QAAQ,KAAK,gBAAgB,IAAI,GAAG;AAC1C,eAAO,SAAS,MAAM,CAAC;AAAA,MAC3B;AAAA,MACA,4BAA4B,MAAM;AAC9B,cAAM,MAAM,OAAO,SAAS,WAAW,OAAO,KAAK;AACnD,cAAM,QAAQ,KAAK,gBAAgB,IAAI,GAAG;AAC1C,eAAO,SAAS,MAAM,CAAC;AAAA,MAC3B;AAAA,MACA,IAAI,YAAY;AACZ,eAAO,KAAK,WAAW;AAAA,MAC3B;AAAA,MACA,IAAI,YAAY;AACZ,eAAO,KAAK,WAAW;AAAA,MAC3B;AAAA,MACA,IAAI,cAAc;AACd,eAAO,KAAK,aAAa;AAAA,MAC7B;AAAA,MACA,IAAI,aAAa;AACb,eAAO,KAAK,YAAY;AAAA,MAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAYA,OAAOC,aAAY;AACf,cAAM,6BAA6B,IAAID,4BAA2B;AAClE,cAAM,cAAc,CAAC;AACrB,oBAAY,KAAK,KAAK,kBAAkB,OAAO,0BAA0B,CAAC;AAC1E,oBAAY,KAAKC,YAAW,UAAU,gBAAgB,0BAA0B,OAAO,WAAW;AAC9F,eAAK,kBAAkB,IAAI,OAAO,iBAAiB,KAAK,OAAO,gBAAgB;AAC/E,qBAAW,oBAAoB,OAAO,mBAAmB;AACrD,kBAAM,2BAA2B,iBAAiB,EAAE,cAAc,iBAAiB,CAAC;AAAA,UACxF;AACA,eAAK,cAAc,OAAO,gBAAgB;AAC1C,eAAK,WAAW,KAAK,OAAO,gBAAgB;AAAA,QAChD,CAAC,CAAC;AACF,oBAAY,KAAKA,YAAW,UAAU,gBAAgB,4BAA4B,OAAO,WAAW;AAChG,gBAAM,mBAAmB,KAAK,kBAAkB,IAAI,OAAO,iBAAiB,GAAG;AAC/E,cAAI,qBAAqB,QAAW;AAChC;AAAA,UACJ;AACA,2BAAiB,UAAU,OAAO,iBAAiB;AACnD,gBAAM,cAAc,iBAAiB;AACrC,cAAI,kBAAkB;AACtB,gBAAM,SAAS,OAAO;AACtB,cAAI,OAAO,aAAa,QAAW;AAC/B,8BAAkB;AAClB,6BAAiB,WAAW,OAAO;AAAA,UACvC;AACA,gBAAM,SAAS,CAAC;AAChB,gBAAM,SAAS,CAAC;AAChB,gBAAM,OAAO,CAAC;AACd,gBAAM,OAAO,CAAC;AACd,cAAI,OAAO,UAAU,QAAW;AAC5B,kBAAM,eAAe,OAAO;AAC5B,gBAAI,aAAa,cAAc,QAAW;AACtC,oBAAM,QAAQ,aAAa,UAAU;AACrC,+BAAiB,MAAM,OAAO,MAAM,OAAO,MAAM,aAAa,GAAI,MAAM,UAAU,SAAY,MAAM,QAAQ,CAAC,CAAE;AAE/G,kBAAI,aAAa,UAAU,YAAY,QAAW;AAC9C,2BAAW,QAAQ,aAAa,UAAU,SAAS;AAC/C,wBAAM,2BAA2B,iBAAiB,EAAE,cAAc,KAAK,CAAC;AACxE,yBAAO,KAAK,KAAK,GAAG;AAAA,gBACxB;AAAA,cACJ;AAEA,kBAAI,aAAa,UAAU,UAAU;AACjC,2BAAW,SAAS,aAAa,UAAU,UAAU;AACjD,wBAAM,2BAA2B,kBAAkB,EAAE,cAAc,MAAM,CAAC;AAC1E,yBAAO,KAAK,MAAM,GAAG;AAAA,gBACzB;AAAA,cACJ;AAAA,YACJ;AACA,gBAAI,aAAa,SAAS,QAAW;AACjC,oBAAM,cAAc,IAAI,IAAI,aAAa,KAAK,IAAI,UAAQ,CAAC,KAAK,UAAU,IAAI,CAAC,CAAC;AAChF,uBAAS,IAAI,GAAG,KAAK,iBAAiB,MAAM,QAAQ,KAAK;AACrD,sBAAMC,UAAS,YAAY,IAAI,iBAAiB,MAAM,CAAC,EAAE,QAAQ;AACjE,oBAAIA,YAAW,QAAW;AACtB,wBAAM,MAAM,iBAAiB,MAAM,OAAO,GAAG,GAAGA,OAAM;AACtD,uBAAK,KAAK,EAAE,KAAK,IAAI,CAAC,GAAG,KAAKA,QAAO,CAAC;AACtC,8BAAY,OAAOA,QAAO,QAAQ;AAClC,sBAAI,YAAY,SAAS,GAAG;AACxB;AAAA,kBACJ;AAAA,gBACJ;AAAA,cACJ;AAAA,YACJ;AACA,gBAAI,aAAa,gBAAgB,QAAW;AACxC,yBAAW,oBAAoB,aAAa,aAAa;AACrD,sBAAM,2BAA2B,mBAAmB,EAAE,cAAc,iBAAiB,UAAU,gBAAgB,iBAAiB,QAAQ,CAAC;AACzI,qBAAK,KAAK,iBAAiB,SAAS,GAAG;AAAA,cAC3C;AAAA,YACJ;AAAA,UACJ;AAEA,eAAK,cAAc,gBAAgB;AACnC,gBAAM,cAAc,EAAE,iBAAiB;AACvC,cAAI,iBAAiB;AACjB,wBAAY,WAAW,EAAE,KAAK,aAAa,KAAK,iBAAiB,SAAS;AAAA,UAC9E;AACA,gBAAM,QAAQ,CAAC;AACf,qBAAW,QAAQ,QAAQ;AACvB,kBAAM,KAAK,KAAK,gBAAgB,IAAI,CAAC;AAAA,UACzC;AACA,gBAAM,UAAU,CAAC;AACjB,qBAAW,SAAS,QAAQ;AACxB,oBAAQ,KAAK,KAAK,gBAAgB,KAAK,CAAC;AAAA,UAC5C;AACA,gBAAM,cAAc,CAAC;AACrB,qBAAWA,WAAU,MAAM;AACvB,wBAAY,KAAK,KAAK,gBAAgBA,OAAM,CAAC;AAAA,UACjD;AACA,cAAI,MAAM,SAAS,KAAK,QAAQ,SAAS,KAAK,KAAK,SAAS,KAAK,YAAY,SAAS,GAAG;AACrF,wBAAY,QAAQ,EAAE,OAAO,SAAS,SAAS,EAAE,MAAM,YAAY,EAAE;AAAA,UACzE;AACA,cAAI,YAAY,aAAa,UAAa,YAAY,UAAU,QAAW;AACvE,iBAAK,aAAa,KAAK,WAAW;AAAA,UACtC;AAAA,QACJ,CAAC,CAAC;AACF,oBAAY,KAAKD,YAAW,UAAU,gBAAgB,0BAA0B,CAAC,WAAW;AACxF,gBAAM,mBAAmB,KAAK,kBAAkB,IAAI,OAAO,iBAAiB,GAAG;AAC/E,cAAI,qBAAqB,QAAW;AAChC;AAAA,UACJ;AACA,eAAK,WAAW,KAAK,gBAAgB;AAAA,QACzC,CAAC,CAAC;AACF,oBAAY,KAAKA,YAAW,UAAU,gBAAgB,2BAA2B,OAAO,WAAW;AAC/F,gBAAM,mBAAmB,KAAK,kBAAkB,IAAI,OAAO,iBAAiB,GAAG;AAC/E,cAAI,qBAAqB,QAAW;AAChC;AAAA,UACJ;AACA,eAAK,YAAY,KAAK,gBAAgB;AACtC,qBAAW,oBAAoB,OAAO,mBAAmB;AACrD,kBAAM,2BAA2B,kBAAkB,EAAE,cAAc,iBAAiB,CAAC;AAAA,UACzF;AACA,eAAK,kBAAkB,OAAO,OAAO,iBAAiB,GAAG;AACzD,qBAAW,QAAQ,iBAAiB,OAAO;AACvC,iBAAK,gBAAgB,OAAO,KAAK,QAAQ;AAAA,UAC7C;AAAA,QACJ,CAAC,CAAC;AACF,eAAO,iCAAiC,WAAW,OAAO,MAAM;AAAE,sBAAY,QAAQ,gBAAc,WAAW,QAAQ,CAAC;AAAA,QAAG,CAAC;AAAA,MAChI;AAAA,MACA,cAAc,kBAAkB;AAC5B,mBAAW,QAAQ,iBAAiB,OAAO;AACvC,eAAK,gBAAgB,IAAI,KAAK,UAAU,CAAC,MAAM,gBAAgB,CAAC;AAAA,QACpE;AAAA,MACJ;AAAA,IACJ;AACA,IAAAF,SAAQ,oBAAoB;AAAA;AAAA;;;ACrQ5B,IAAAI,cAAA;AAAA,oEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,UAAU;AAClB,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,OAAO;AACf,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,cAAc;AACtB,IAAAA,SAAQ,aAAa;AACrB,IAAAA,SAAQ,WAAW;AACnB,aAAS,QAAQ,OAAO;AACpB,aAAO,UAAU,QAAQ,UAAU;AAAA,IACvC;AACA,aAAS,OAAO,OAAO;AACnB,aAAO,OAAO,UAAU,YAAY,iBAAiB;AAAA,IACzD;AACA,aAAS,OAAO,OAAO;AACnB,aAAO,OAAO,UAAU,YAAY,iBAAiB;AAAA,IACzD;AACA,aAAS,MAAM,OAAO;AAClB,aAAO,iBAAiB;AAAA,IAC5B;AACA,aAAS,KAAK,OAAO;AACjB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,aAAS,MAAM,OAAO;AAClB,aAAO,MAAM,QAAQ,KAAK;AAAA,IAC9B;AACA,aAAS,YAAY,OAAO;AACxB,aAAO,MAAM,KAAK,KAAK,MAAM,MAAM,UAAQ,OAAO,IAAI,CAAC;AAAA,IAC3D;AACA,aAAS,WAAW,OAAO,OAAO;AAC9B,aAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,KAAK;AAAA,IACpD;AACA,aAAS,SAAS,OAAO;AACrB,aAAO,SAAS,KAAK,MAAM,IAAI;AAAA,IACnC;AAAA;AAAA;;;ACzCA;AAAA,sEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,KAAK;AACb,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,eAAe;AACvB,QAAM,YAAN,MAAgB;AAAA,MAEZ,YAAY,QAAQ;AADpB;AAEI,aAAK,SAAS;AAAA,MAElB;AAAA,MACA,QAAQ;AACJ,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,OAAO,OAAO;AACV,eAAO,KAAK,MAAM,MAAM,MAAM,MAAM;AAAA,MACxC;AAAA,IACJ;AACA,QAAM,UAAN,MAAM,gBAAe,UAAU;AAAA,MAG3B,OAAO,OAAO,OAAO;AACjB,eAAO,MAAM,KAAK,MAAM,MAAM,SAAS,KAAK,OAAO,CAAC,CAAC;AAAA,MACzD;AAAA,MACA,OAAO,aAAa;AAChB,eAAO,QAAO,OAAO,QAAO,MAAM;AAAA,MACtC;AAAA,MACA,cAAc;AACV,cAAM;AAAA,UACF,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB;AAAA,UACA,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB;AAAA,UACA;AAAA,UACA,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB;AAAA,UACA,QAAO,OAAO,QAAO,aAAa;AAAA,UAClC,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB;AAAA,UACA,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,UAClB,QAAO,WAAW;AAAA,QACtB,EAAE,KAAK,EAAE,CAAC;AAAA,MACd;AAAA,IACJ;AAhDI,kBADE,SACK,UAAS,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACpG,kBAFE,SAEK,iBAAgB,CAAC,KAAK,KAAK,KAAK,GAAG;AAF9C,QAAM,SAAN;AAqDA,IAAAA,SAAQ,QAAQ,IAAI,UAAU,sCAAsC;AACpE,aAAS,KAAK;AACV,aAAO,IAAI,OAAO;AAAA,IACtB;AACA,QAAM,eAAe;AACrB,aAAS,OAAO,OAAO;AACnB,aAAO,aAAa,KAAK,KAAK;AAAA,IAClC;AAKA,aAAS,MAAM,OAAO;AAClB,UAAI,CAAC,OAAO,KAAK,GAAG;AAChB,cAAM,IAAI,MAAM,cAAc;AAAA,MAClC;AACA,aAAO,IAAI,UAAU,KAAK;AAAA,IAC9B;AACA,aAAS,eAAe;AACpB,aAAO,GAAG,EAAE,MAAM;AAAA,IACtB;AAAA;AAAA;;;ACjGA;AAAA,oEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,kBAAkB;AAC1B,IAAAA,SAAQ,iBAAiB;AACzB,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,mCAAmC;AACzC,QAAM,SAAS;AACf,QAAM,gCAAN,MAAM,8BAA6B;AAAA,MAI/B,YAAY,aAAa,QAAQ;AAHjC;AACA;AAGI,aAAK,cAAc;AACnB,aAAK,SAAS;AACd,sCAA6B,UAAU,IAAI,KAAK,QAAQ,IAAI;AAAA,MAChE;AAAA,MACA,MAAM,OAAO,YAAY,SAAS,aAAa;AAC3C,cAAM,QAAQ;AAAA,UACV,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA;AAAA,QACJ;AACA,YAAI,OAAO,eAAe,UAAU;AAGhC,gBAAM,aAAa,KAAK,MAAM,UAAU;AAAA,QAC5C;AACA,aAAK,YAAY,aAAa,iCAAiC,iBAAiB,MAAM,KAAK,QAAQ,KAAK;AAAA,MAC5G;AAAA,MACA,OAAO,MAAM,MAAM;AACf,cAAM,QAAQ;AAAA,UACV,MAAM;AAAA,QACV;AACA,YAAI,OAAO,SAAS,UAAU;AAG1B,gBAAM,aAAa,KAAK,MAAM,IAAI;AAClC,cAAI,SAAS,QAAW;AACpB,kBAAM,UAAU;AAAA,UACpB;AAAA,QACJ,OACK;AACD,gBAAM,UAAU;AAAA,QACpB;AACA,aAAK,YAAY,aAAa,iCAAiC,iBAAiB,MAAM,KAAK,QAAQ,KAAK;AAAA,MAC5G;AAAA,MACA,OAAO;AACH,sCAA6B,UAAU,OAAO,KAAK,MAAM;AACzD,aAAK,YAAY,aAAa,iCAAiC,iBAAiB,MAAM,KAAK,QAAQ,EAAE,MAAM,MAAM,CAAC;AAAA,MACtH;AAAA,IACJ;AAzCI,kBAHE,+BAGK,aAAY,oBAAI,IAAI;AAH/B,QAAM,+BAAN;AA6CA,QAAM,qCAAN,cAAiD,6BAA6B;AAAA,MAE1E,YAAYC,aAAY,OAAO;AAC3B,cAAMA,aAAY,KAAK;AAF3B;AAGI,aAAK,UAAU,IAAI,iCAAiC,wBAAwB;AAAA,MAChF;AAAA,MACA,IAAI,QAAQ;AACR,eAAO,KAAK,QAAQ;AAAA,MACxB;AAAA,MACA,OAAO;AACH,aAAK,QAAQ,QAAQ;AACrB,cAAM,KAAK;AAAA,MACf;AAAA,MACA,SAAS;AACL,aAAK,QAAQ,OAAO;AAAA,MACxB;AAAA,IACJ;AACA,QAAM,uBAAN,MAA2B;AAAA,MACvB,cAAc;AAAA,MACd;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA,SAAS;AAAA,MACT;AAAA,MACA,OAAO;AAAA,MACP;AAAA,IACJ;AACA,QAAM,6BAAN,cAAyC,qBAAqB;AAAA,MAE1D,cAAc;AACV,cAAM;AAFV;AAGI,aAAK,UAAU,IAAI,iCAAiC,wBAAwB;AAAA,MAChF;AAAA,MACA,IAAI,QAAQ;AACR,eAAO,KAAK,QAAQ;AAAA,MACxB;AAAA,MACA,OAAO;AACH,aAAK,QAAQ,QAAQ;AAAA,MACzB;AAAA,MACA,SAAS;AACL,aAAK,QAAQ,OAAO;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,eAAeA,aAAY,QAAQ;AACxC,UAAI,WAAW,UAAa,OAAO,kBAAkB,QAAW;AAC5D,eAAO,IAAI,qBAAqB;AAAA,MACpC;AACA,YAAM,QAAQ,OAAO;AACrB,aAAO,OAAO;AACd,aAAO,IAAI,6BAA6BA,aAAY,KAAK;AAAA,IAC7D;AACA,QAAM,kBAAkB,CAAC,SAAS;AAC9B,aAAO,cAAc,KAAK;AAAA,QAEtB,cAAc;AACV,gBAAM;AAFV;AAGI,eAAK,qBAAqB;AAAA,QAC9B;AAAA,QACA,WAAW,cAAc;AAlHjC;AAmHY,gBAAM,WAAW,YAAY;AAC7B,gBAAI,kDAAc,WAAd,mBAAsB,sBAAqB,MAAM;AACjD,iBAAK,qBAAqB;AAC1B,iBAAK,WAAW,eAAe,iCAAiC,mCAAmC,MAAM,CAAC,WAAW;AACjH,oBAAM,WAAW,6BAA6B,UAAU,IAAI,OAAO,KAAK;AACxE,kBAAI,oBAAoB,sCAAsC,oBAAoB,4BAA4B;AAC1G,yBAAS,OAAO;AAAA,cACpB;AAAA,YACJ,CAAC;AAAA,UACL;AAAA,QACJ;AAAA,QACA,uBAAuB,OAAO;AAC1B,cAAI,UAAU,QAAW;AACrB,mBAAO,IAAI,qBAAqB;AAAA,UACpC,OACK;AACD,mBAAO,IAAI,6BAA6B,KAAK,YAAY,KAAK;AAAA,UAClE;AAAA,QACJ;AAAA,QACA,yBAAyB;AACrB,cAAI,KAAK,oBAAoB;AACzB,kBAAM,SAAS,GAAG,OAAO,cAAc;AACvC,mBAAO,KAAK,WAAW,YAAY,iCAAiC,8BAA8B,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,MAAM;AAC1H,oBAAM,SAAS,IAAI,mCAAmC,KAAK,YAAY,KAAK;AAC5E,qBAAO;AAAA,YACX,CAAC;AAAA,UACL,OACK;AACD,mBAAO,QAAQ,QAAQ,IAAI,2BAA2B,CAAC;AAAA,UAC3D;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAD,SAAQ,kBAAkB;AAC1B,QAAI;AACJ,KAAC,SAAUE,iBAAgB;AACvB,MAAAA,gBAAe,OAAO,IAAI,iCAAiC,aAAa;AAAA,IAC5E,GAAG,mBAAmB,iBAAiB,CAAC,EAAE;AAC1C,QAAM,6BAAN,MAAiC;AAAA,MAG7B,YAAY,aAAa,QAAQ;AAFjC;AACA;AAEI,aAAK,cAAc;AACnB,aAAK,SAAS;AAAA,MAClB;AAAA,MACA,OAAO,MAAM;AACT,aAAK,YAAY,aAAa,eAAe,MAAM,KAAK,QAAQ,IAAI;AAAA,MACxE;AAAA,IACJ;AACA,aAAS,oBAAoBD,aAAY,QAAQ;AAC7C,UAAI,WAAW,UAAa,OAAO,uBAAuB,QAAW;AACjE,eAAO;AAAA,MACX;AACA,YAAM,QAAQ,OAAO;AACrB,aAAO,OAAO;AACd,aAAO,IAAI,2BAA2BA,aAAY,KAAK;AAAA,IAC3D;AAAA;AAAA;;;AC3KA;AAAA,yEAAAE,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,uBAAuB;AAC/B,QAAM,mCAAmC;AACzC,QAAME,MAAK,aAAa,aAAqB;AAC7C,QAAM,uBAAuB,CAAC,SAAS;AACnC,aAAO,cAAc,KAAK;AAAA,QACtB,iBAAiB,KAAK;AAClB,cAAI,CAAC,KAAK;AACN,mBAAO,KAAK,kBAAkB,CAAC,CAAC;AAAA,UACpC,WACSA,IAAG,OAAO,GAAG,GAAG;AACrB,mBAAO,KAAK,kBAAkB,EAAE,SAAS,IAAI,CAAC;AAAA,UAClD,OACK;AACD,mBAAO,KAAK,kBAAkB,GAAG;AAAA,UACrC;AAAA,QACJ;AAAA,QACA,kBAAkB,KAAK;AACnB,gBAAM,SAAS;AAAA,YACX,OAAO,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,GAAG;AAAA,UAC1C;AACA,iBAAO,KAAK,WAAW,YAAY,iCAAiC,qBAAqB,MAAM,MAAM,EAAE,KAAK,CAAC,WAAW;AACpH,gBAAI,MAAM,QAAQ,MAAM,GAAG;AACvB,qBAAO,MAAM,QAAQ,GAAG,IAAI,SAAS,OAAO,CAAC;AAAA,YACjD,OACK;AACD,qBAAO,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI;AAAA,YACrC;AAAA,UACJ,CAAC;AAAA,QACL;AAAA,MACJ;AAAA,IACJ;AACA,IAAAF,SAAQ,uBAAuB;AAAA;AAAA;;;ACtE/B;AAAA,2EAAAG,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,0BAA0B;AAClC,QAAM,mCAAmC;AACzC,QAAM,0BAA0B,CAAC,SAAS;AACtC,aAAO,cAAc,KAAK;AAAA,QAItB,cAAc;AACV,gBAAM;AAJV;AACA;AACA;AAGI,eAAK,gCAAgC;AAAA,QACzC;AAAA,QACA,WAAW,cAAc;AACrB,gBAAM,WAAW,YAAY;AAC7B,gBAAM,wBAAwB,aAAa;AAC3C,cAAI,yBAAyB,sBAAsB,kBAAkB;AACjE,iBAAK,+BAA+B,IAAI,iCAAiC,QAAQ;AACjF,iBAAK,WAAW,eAAe,iCAAiC,sCAAsC,MAAM,CAAC,WAAW;AACpH,mBAAK,6BAA6B,KAAK,OAAO,KAAK;AAAA,YACvD,CAAC;AAAA,UACL;AAAA,QACJ;AAAA,QACA,uBAAuB,cAAc;AA3B7C;AA4BY,gBAAM,uBAAuB,YAAY;AACzC,gBAAM,uBAAsB,wBAAa,cAAb,mBAAwB,qBAAxB,mBAA0C;AACtE,eAAK,gCAAgC,wBAAwB,QAAQ,OAAO,wBAAwB;AAAA,QACxG;AAAA,QACA,sBAAsB;AAClB,iBAAO,KAAK,WAAW,YAAY,iCAAiC,wBAAwB,IAAI;AAAA,QACpG;AAAA,QACA,IAAI,8BAA8B;AAC9B,cAAI,CAAC,KAAK,8BAA8B;AACpC,kBAAM,IAAI,MAAM,gEAAiE;AAAA,UACrF;AACA,cAAI,CAAC,KAAK,iCAAiC,CAAC,KAAK,iBAAiB;AAC9D,iBAAK,kBAAkB,KAAK,WAAW,OAAO,SAAS,iCAAiC,sCAAsC,IAAI;AAAA,UACtI;AACA,iBAAO,KAAK,6BAA6B;AAAA,QAC7C;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,0BAA0B;AAAA;AAAA;;;AC9ClC;AAAA,yEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,uBAAuB;AAC/B,QAAM,mCAAmC;AACzC,QAAM,uBAAuB,CAAC,SAAS;AACnC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,gBAAgB;AAChB,iBAAO;AAAA,YACH,WAAW,CAAC,YAAY;AACpB,qBAAO,KAAK,WAAW,UAAU,iCAAiC,4BAA4B,MAAM,CAAC,QAAQ,WAAW;AACpH,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,MAAS;AAAA,cACjF,CAAC;AAAA,YACL;AAAA,YACA,iBAAiB,CAAC,YAAY;AAC1B,oBAAM,OAAO,iCAAiC,kCAAkC;AAChF,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,YACA,iBAAiB,CAAC,YAAY;AAC1B,oBAAM,OAAO,iCAAiC,kCAAkC;AAChF,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,uBAAuB;AAAA;AAAA;;;ACjC/B;AAAA,wEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,mCAAmC;AACzC,QAAM,sBAAsB,CAAC,SAAS;AAClC,aAAO,cAAc,KAAK;AAAA,QACtB,aAAa,QAAQ;AACjB,iBAAO,KAAK,WAAW,YAAY,iCAAiC,oBAAoB,MAAM,MAAM;AAAA,QACxG;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,sBAAsB;AAAA;AAAA;;;ACf9B;AAAA,0EAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,wBAAwB;AAChC,QAAM,mCAAmC;AACzC,QAAM,wBAAwB,CAAC,SAAS;AACpC,aAAO,cAAc,KAAK;AAAA,QACtB,iBAAiB,SAAS;AACtB,iBAAO,KAAK,WAAW,eAAe,iCAAiC,2BAA2B,MAAM,CAAC,WAAW;AAChH,mBAAO,QAAQ,MAAM;AAAA,UACzB,CAAC;AAAA,QACL;AAAA,QACA,iBAAiB,SAAS;AACtB,iBAAO,KAAK,WAAW,eAAe,iCAAiC,2BAA2B,MAAM,CAAC,WAAW;AAChH,mBAAO,QAAQ,MAAM;AAAA,UACzB,CAAC;AAAA,QACL;AAAA,QACA,iBAAiB,SAAS;AACtB,iBAAO,KAAK,WAAW,eAAe,iCAAiC,2BAA2B,MAAM,CAAC,WAAW;AAChH,mBAAO,QAAQ,MAAM;AAAA,UACzB,CAAC;AAAA,QACL;AAAA,QACA,kBAAkB,SAAS;AACvB,iBAAO,KAAK,WAAW,UAAU,iCAAiC,uBAAuB,MAAM,CAAC,QAAQ,WAAW;AAC/G,mBAAO,QAAQ,QAAQ,MAAM;AAAA,UACjC,CAAC;AAAA,QACL;AAAA,QACA,kBAAkB,SAAS;AACvB,iBAAO,KAAK,WAAW,UAAU,iCAAiC,uBAAuB,MAAM,CAAC,QAAQ,WAAW;AAC/G,mBAAO,QAAQ,QAAQ,MAAM;AAAA,UACjC,CAAC;AAAA,QACL;AAAA,QACA,kBAAkB,SAAS;AACvB,iBAAO,KAAK,WAAW,UAAU,iCAAiC,uBAAuB,MAAM,CAAC,QAAQ,WAAW;AAC/G,mBAAO,QAAQ,QAAQ,MAAM;AAAA,UACjC,CAAC;AAAA,QACL;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,wBAAwB;AAAA;AAAA;;;AC1ChC;AAAA,8EAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,4BAA4B;AACpC,QAAM,mCAAmC;AACzC,QAAM,4BAA4B,CAAC,SAAS;AACxC,aAAO,cAAc,KAAK;AAAA,QACtB,qBAAqB,SAAS;AAC1B,iBAAO,KAAK,WAAW,UAAU,iCAAiC,0BAA0B,MAAM,CAAC,QAAQ,WAAW;AAClH,mBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,MAAS;AAAA,UACjF,CAAC;AAAA,QACL;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,4BAA4B;AAAA;AAAA;;;ACjBpC;AAAA,yEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,uBAAuB;AAC/B,QAAM,mCAAmC;AACzC,QAAM,uBAAuB,CAAC,SAAS;AACnC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,gBAAgB;AAChB,iBAAO;AAAA,YACH,WAAW,CAAC,YAAY;AACpB,qBAAO,KAAK,WAAW,UAAU,iCAAiC,4BAA4B,MAAM,CAAC,QAAQ,WAAW;AACpH,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,MAAS;AAAA,cACjF,CAAC;AAAA,YACL;AAAA,YACA,cAAc,CAAC,YAAY;AACvB,oBAAM,OAAO,iCAAiC,+BAA+B;AAC7E,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,YACA,YAAY,CAAC,YAAY;AACrB,oBAAM,OAAO,iCAAiC,6BAA6B;AAC3E,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,uBAAuB;AAAA;AAAA;;;ACjC/B;AAAA,uEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,qBAAqB;AAC7B,QAAM,mCAAmC;AACzC,QAAM,qBAAqB,CAAC,SAAS;AACjC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,cAAc;AACd,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,qBAAO,KAAK,WAAW,YAAY,iCAAiC,0BAA0B,IAAI;AAAA,YACtG;AAAA,YACA,IAAI,CAAC,YAAY;AACb,qBAAO,KAAK,WAAW,UAAU,iCAAiC,mBAAmB,MAAM,CAAC,QAAQ,WAAW;AAC3G,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,CAAC;AAAA,cACtE,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,qBAAqB;AAAA;AAAA;;;ACxB7B;AAAA,wEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,mCAAmC;AACzC,QAAM,sBAAsB,CAAC,SAAS;AAClC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,eAAe;AACf,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,qBAAO,KAAK,WAAW,YAAY,iCAAiC,2BAA2B,IAAI;AAAA,YACvG;AAAA,YACA,IAAI,CAAC,YAAY;AACb,oBAAM,OAAO,iCAAiC,oBAAoB;AAClE,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,sBAAsB;AAAA;AAAA;;;ACzB9B;AAAA,qEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,mBAAmB;AAC3B,QAAM,mCAAmC;AACzC,QAAM,mBAAmB,CAAC,SAAS;AAC/B,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,YAAY;AACZ,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,qBAAO,KAAK,WAAW,YAAY,iCAAiC,wBAAwB,IAAI;AAAA,YACpG;AAAA,YACA,IAAI,CAAC,YAAY;AACb,qBAAO,KAAK,WAAW,UAAU,iCAAiC,iBAAiB,MAAM,CAAC,QAAQ,WAAW;AACzG,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,CAAC;AAAA,cACtE,CAAC;AAAA,YACL;AAAA,YACA,SAAS,CAAC,YAAY;AAClB,qBAAO,KAAK,WAAW,UAAU,iCAAiC,wBAAwB,MAAM,CAAC,QAAQ,WAAW;AAChH,uBAAO,QAAQ,QAAQ,MAAM;AAAA,cACjC,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,mBAAmB;AAAA;AAAA;;;AC7B3B;AAAA,sEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,mCAAmC;AACzC,QAAM,oBAAoB,CAAC,SAAS;AAChC,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,cAAc;AACd,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,qBAAO,KAAK,WAAW,YAAY,iCAAiC,yBAAyB,IAAI;AAAA,YACrG;AAAA,YACA,IAAI,CAAC,YAAY;AACb,qBAAO,KAAK,WAAW,UAAU,iCAAiC,0BAA0B,MAAM,CAAC,QAAQ,WAAW;AAClH,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,iCAAiC,0BAA0B,eAAe,MAAM,CAAC;AAAA,cAC1L,CAAC;AAAA,YACL;AAAA,YACA,aAAa,CAAC,YAAY;AACtB,qBAAO,KAAK,WAAW,UAAU,iCAAiC,2BAA2B,MAAM,CAAC,QAAQ,WAAW;AACnH,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,iCAAiC,2BAA2B,eAAe,MAAM,CAAC;AAAA,cAC3L,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAAA;AAAA;;;AC7B5B;AAAA,mEAAAC,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,iBAAiB;AACzB,QAAM,mCAAmC;AACzC,QAAM,iBAAiB,CAAC,SAAS;AAC7B,aAAO,cAAc,KAAK;AAAA,QACtB,IAAI,UAAU;AACV,iBAAO;AAAA,YACH,IAAI,CAAC,YAAY;AACb,oBAAM,OAAO,iCAAiC,eAAe;AAC7D,qBAAO,KAAK,WAAW,UAAU,MAAM,CAAC,QAAQ,WAAW;AACvD,uBAAO,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,MAAM,GAAG,KAAK,4BAA4B,MAAM,MAAM,CAAC;AAAA,cACtH,CAAC;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,IAAAA,SAAQ,iBAAiB;AAAA;AAAA;;;ACtBzB;AAAA,kEAAAC,UAAA;AAAA;AAMA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,iBAAiBA,SAAQ,iBAAiBA,SAAQ,qBAAqBA,SAAQ,mBAAmBA,SAAQ,sBAAsB;AACxI,IAAAA,SAAQ,yBAAyB;AACjC,IAAAA,SAAQ,2BAA2B;AACnC,IAAAA,SAAQ,wBAAwB;AAChC,IAAAA,SAAQ,wBAAwB;AAChC,IAAAA,SAAQ,wBAAwB;AAChC,IAAAA,SAAQ,2BAA2B;AACnC,IAAAA,SAAQ,2BAA2B;AACnC,IAAAA,SAAQ,2BAA2B;AACnC,IAAAA,SAAQ,kBAAkB;AAC1B,IAAAA,SAAQ,mBAAmBE;AAC3B,QAAM,mCAAmC;AACzC,QAAMC,MAAK,aAAa,aAAqB;AAC7C,QAAM,OAAO,aAAa,cAAuB;AACjD,QAAM,aAAa;AACnB,QAAM,kBAAkB;AACxB,QAAM,oBAAoB;AAC1B,QAAM,kBAAkB;AACxB,QAAM,mBAAmB;AACzB,QAAM,iBAAiB;AACvB,QAAM,mBAAmB;AACzB,QAAM,uBAAuB;AAC7B,QAAM,kBAAkB;AACxB,QAAM,gBAAgB;AACtB,QAAM,iBAAiB;AAEvB,QAAM,cAAc;AACpB,QAAM,eAAe;AACrB,QAAM,aAAa;AACnB,QAAM,YAAY;AAClB,aAAS,eAAe,OAAO;AAC3B,UAAI,UAAU,MAAM;AAChB,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AAOA,QAAM,sBAAN,MAA0B;AAAA,MAEtB,cAAc;AADd;AAEI,aAAK,YAAY,uBAAO,OAAO,IAAI;AAAA,MACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,IAAI,SAAS;AACT,YAAI,QAAQ,KAAK,UAAU,OAAO;AAClC,YAAI,CAAC,OAAO;AACR,kBAAQ;AAAA,QACZ;AACA;AACA,aAAK,UAAU,OAAO,IAAI;AAAA,MAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,WAAWC,aAAY;AACnB,eAAO,KAAK,KAAK,SAAS,EAAE,QAAQ,aAAW;AAC3C,UAAAA,YAAW,OAAO,iBAAiB,OAAO;AAAA,QAC9C,CAAC;AAAA,MACL;AAAA,IACJ;AACA,IAAAJ,SAAQ,sBAAsB;AAC9B,QAAM,oBAAN,MAAwB;AAAA,MAGpB,cAAc;AAFd;AACA;AAAA,MAEA;AAAA,MACA,UAAUI,aAAY;AAClB,aAAK,iBAAiBA;AAAA,MAC1B;AAAA,MACA,OAAOA,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,aAAa;AACb,YAAI,CAAC,KAAK,aAAa;AACnB,gBAAM,IAAI,MAAM,6CAA6C;AAAA,QACjE;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,uBAAuB,eAAe;AAAA,MACtC;AAAA,MACA,WAAW,eAAe;AAAA,MAC1B;AAAA,MACA,MAAM,SAAS;AACX,aAAK,KAAK,iCAAiC,YAAY,OAAO,OAAO;AAAA,MACzE;AAAA,MACA,KAAK,SAAS;AACV,aAAK,KAAK,iCAAiC,YAAY,SAAS,OAAO;AAAA,MAC3E;AAAA,MACA,KAAK,SAAS;AACV,aAAK,KAAK,iCAAiC,YAAY,MAAM,OAAO;AAAA,MACxE;AAAA,MACA,IAAI,SAAS;AACT,aAAK,KAAK,iCAAiC,YAAY,KAAK,OAAO;AAAA,MACvE;AAAA,MACA,MAAM,SAAS;AACX,aAAK,KAAK,iCAAiC,YAAY,OAAO,OAAO;AAAA,MACzE;AAAA,MACA,KAAK,MAAM,SAAS;AAChB,YAAI,KAAK,gBAAgB;AACrB,eAAK,eAAe,iBAAiB,iCAAiC,uBAAuB,MAAM,EAAE,MAAM,QAAQ,CAAC,EAAE,MAAM,MAAM;AAC9H,aAAC,GAAG,iCAAiC,KAAK,EAAE,QAAQ,MAAM,4BAA4B;AAAA,UAC1F,CAAC;AAAA,QACL;AAAA,MACJ;AAAA,IACJ;AACA,QAAM,oBAAN,MAAwB;AAAA,MAEpB,cAAc;AADd;AAAA,MAEA;AAAA,MACA,OAAOA,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,aAAa;AACb,YAAI,CAAC,KAAK,aAAa;AACnB,gBAAM,IAAI,MAAM,6CAA6C;AAAA,QACjE;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,eAAe;AAAA,MAC1B;AAAA,MACA,uBAAuB,eAAe;AAAA,MACtC;AAAA,MACA,iBAAiB,YAAY,SAAS;AAClC,cAAM,SAAS,EAAE,MAAM,iCAAiC,YAAY,OAAO,SAAS,QAAQ;AAC5F,eAAO,KAAK,WAAW,YAAY,iCAAiC,mBAAmB,MAAM,MAAM,EAAE,KAAK,cAAc;AAAA,MAC5H;AAAA,MACA,mBAAmB,YAAY,SAAS;AACpC,cAAM,SAAS,EAAE,MAAM,iCAAiC,YAAY,SAAS,SAAS,QAAQ;AAC9F,eAAO,KAAK,WAAW,YAAY,iCAAiC,mBAAmB,MAAM,MAAM,EAAE,KAAK,cAAc;AAAA,MAC5H;AAAA,MACA,uBAAuB,YAAY,SAAS;AACxC,cAAM,SAAS,EAAE,MAAM,iCAAiC,YAAY,MAAM,SAAS,QAAQ;AAC3F,eAAO,KAAK,WAAW,YAAY,iCAAiC,mBAAmB,MAAM,MAAM,EAAE,KAAK,cAAc;AAAA,MAC5H;AAAA,IACJ;AACA,QAAM,oBAAoB,GAAG,eAAe,sBAAsB,GAAG,WAAW,iBAAiB,iBAAiB,CAAC;AACnH,QAAI;AACJ,KAAC,SAAUC,mBAAkB;AAKzB,eAAS,SAAS;AACd,eAAO,IAAI,qBAAqB;AAAA,MACpC;AACA,MAAAA,kBAAiB,SAAS;AAAA,IAC9B,GAAG,qBAAqBL,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AACzE,QAAM,uBAAN,MAA2B;AAAA,MAA3B;AACI,8CAAiB,CAAC;AAClB,2CAAc,oBAAI,IAAI;AAAA;AAAA,MACtB,IAAI,MAAM,iBAAiB;AACvB,cAAM,SAASG,IAAG,OAAO,IAAI,IAAI,OAAO,KAAK;AAC7C,YAAI,KAAK,YAAY,IAAI,MAAM,GAAG;AAC9B,gBAAM,IAAI,MAAM,GAAG,MAAM,wCAAwC;AAAA,QACrE;AACA,cAAM,KAAK,KAAK,aAAa;AAC7B,aAAK,eAAe,KAAK;AAAA,UACrB;AAAA,UACA;AAAA,UACA,iBAAiB,mBAAmB,CAAC;AAAA,QACzC,CAAC;AACD,aAAK,YAAY,IAAI,MAAM;AAAA,MAC/B;AAAA,MACA,uBAAuB;AACnB,eAAO;AAAA,UACH,eAAe,KAAK;AAAA,QACxB;AAAA,MACJ;AAAA,IACJ;AACA,QAAI;AACJ,KAAC,SAAUG,qBAAoB;AAC3B,eAAS,SAAS;AACd,eAAO,IAAI,uBAAuB,QAAW,CAAC,CAAC;AAAA,MACnD;AACA,MAAAA,oBAAmB,SAAS;AAAA,IAChC,GAAG,uBAAuBN,SAAQ,qBAAqB,qBAAqB,CAAC,EAAE;AAC/E,QAAM,yBAAN,MAA6B;AAAA,MAGzB,YAAY,aAAa,iBAAiB;AAF1C;AACA,gDAAmB,oBAAI,IAAI;AAEvB,aAAK,cAAc;AACnB,wBAAgB,QAAQ,oBAAkB;AACtC,eAAK,iBAAiB,IAAI,eAAe,QAAQ,cAAc;AAAA,QACnE,CAAC;AAAA,MACL;AAAA,MACA,IAAI,aAAa;AACb,eAAO,CAAC,CAAC,KAAK;AAAA,MAClB;AAAA,MACA,OAAOI,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,gBAAgB;AAChB,aAAK,iBAAiB,IAAI,eAAe,QAAQ,cAAc;AAAA,MACnE;AAAA,MACA,UAAU;AACN,cAAM,kBAAkB,CAAC;AACzB,mBAAW,kBAAkB,KAAK,iBAAiB,OAAO,GAAG;AACzD,0BAAgB,KAAK,cAAc;AAAA,QACvC;AACA,cAAM,SAAS;AAAA,UACX,kBAAkB;AAAA,QACtB;AACA,aAAK,YAAY,YAAY,iCAAiC,sBAAsB,MAAM,MAAM,EAAE,MAAM,MAAM;AAC1G,eAAK,YAAY,QAAQ,KAAK,6BAA6B;AAAA,QAC/D,CAAC;AAAA,MACL;AAAA,MACA,cAAc,KAAK;AACf,cAAM,SAASD,IAAG,OAAO,GAAG,IAAI,MAAM,IAAI;AAC1C,cAAM,iBAAiB,KAAK,iBAAiB,IAAI,MAAM;AACvD,YAAI,CAAC,gBAAgB;AACjB,iBAAO;AAAA,QACX;AACA,cAAM,SAAS;AAAA,UACX,kBAAkB,CAAC,cAAc;AAAA,QACrC;AACA,aAAK,YAAY,YAAY,iCAAiC,sBAAsB,MAAM,MAAM,EAAE,KAAK,MAAM;AACzG,eAAK,iBAAiB,OAAO,MAAM;AAAA,QACvC,GAAG,CAAC,WAAW;AACX,eAAK,YAAY,QAAQ,KAAK,sCAAsC,eAAe,EAAE,UAAU;AAAA,QACnG,CAAC;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AACA,QAAM,mBAAN,MAAuB;AAAA,MAAvB;AACI;AAAA;AAAA,MACA,OAAOC,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,aAAa;AACb,YAAI,CAAC,KAAK,aAAa;AACnB,gBAAM,IAAI,MAAM,6CAA6C;AAAA,QACjE;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,eAAe;AAAA,MAC1B;AAAA,MACA,uBAAuB,eAAe;AAAA,MACtC;AAAA,MACA,SAAS,qBAAqB,uBAAuB,iBAAiB;AAClE,YAAI,+BAA+B,sBAAsB;AACrD,iBAAO,KAAK,aAAa,mBAAmB;AAAA,QAChD,WACS,+BAA+B,wBAAwB;AAC5D,iBAAO,KAAK,gBAAgB,qBAAqB,uBAAuB,eAAe;AAAA,QAC3F,OACK;AACD,iBAAO,KAAK,gBAAgB,qBAAqB,qBAAqB;AAAA,QAC1E;AAAA,MACJ;AAAA,MACA,gBAAgB,gBAAgB,MAAM,iBAAiB;AACnD,cAAM,SAASD,IAAG,OAAO,IAAI,IAAI,OAAO,KAAK;AAC7C,cAAM,KAAK,KAAK,aAAa;AAC7B,cAAM,SAAS;AAAA,UACX,eAAe,CAAC,EAAE,IAAI,QAAQ,iBAAiB,mBAAmB,CAAC,EAAE,CAAC;AAAA,QAC1E;AACA,YAAI,CAAC,eAAe,YAAY;AAC5B,yBAAe,OAAO,KAAK,UAAU;AAAA,QACzC;AACA,eAAO,KAAK,WAAW,YAAY,iCAAiC,oBAAoB,MAAM,MAAM,EAAE,KAAK,CAAC,YAAY;AACpH,yBAAe,IAAI,EAAE,IAAQ,OAAe,CAAC;AAC7C,iBAAO;AAAA,QACX,GAAG,CAAC,WAAW;AACX,eAAK,WAAW,QAAQ,KAAK,mCAAmC,MAAM,UAAU;AAChF,iBAAO,QAAQ,OAAO,MAAM;AAAA,QAChC,CAAC;AAAA,MACL;AAAA,MACA,gBAAgB,MAAM,iBAAiB;AACnC,cAAM,SAASA,IAAG,OAAO,IAAI,IAAI,OAAO,KAAK;AAC7C,cAAM,KAAK,KAAK,aAAa;AAC7B,cAAM,SAAS;AAAA,UACX,eAAe,CAAC,EAAE,IAAI,QAAQ,iBAAiB,mBAAmB,CAAC,EAAE,CAAC;AAAA,QAC1E;AACA,eAAO,KAAK,WAAW,YAAY,iCAAiC,oBAAoB,MAAM,MAAM,EAAE,KAAK,CAAC,YAAY;AACpH,iBAAO,iCAAiC,WAAW,OAAO,MAAM;AAC5D,iBAAK,iBAAiB,IAAI,MAAM,EAAE,MAAM,MAAM;AAAE,mBAAK,WAAW,QAAQ,KAAK,qCAAqC,EAAE,UAAU;AAAA,YAAG,CAAC;AAAA,UACtI,CAAC;AAAA,QACL,GAAG,CAAC,WAAW;AACX,eAAK,WAAW,QAAQ,KAAK,mCAAmC,MAAM,UAAU;AAChF,iBAAO,QAAQ,OAAO,MAAM;AAAA,QAChC,CAAC;AAAA,MACL;AAAA,MACA,iBAAiB,IAAI,QAAQ;AACzB,cAAM,SAAS;AAAA,UACX,kBAAkB,CAAC,EAAE,IAAI,OAAO,CAAC;AAAA,QACrC;AACA,eAAO,KAAK,WAAW,YAAY,iCAAiC,sBAAsB,MAAM,MAAM,EAAE,MAAM,MAAM;AAChH,eAAK,WAAW,QAAQ,KAAK,sCAAsC,EAAE,UAAU;AAAA,QACnF,CAAC;AAAA,MACL;AAAA,MACA,aAAa,eAAe;AACxB,cAAM,SAAS,cAAc,qBAAqB;AAClD,eAAO,KAAK,WAAW,YAAY,iCAAiC,oBAAoB,MAAM,MAAM,EAAE,KAAK,MAAM;AAC7G,iBAAO,IAAI,uBAAuB,KAAK,aAAa,OAAO,cAAc,IAAI,kBAAgB;AAAE,mBAAO,EAAE,IAAI,aAAa,IAAI,QAAQ,aAAa,OAAO;AAAA,UAAG,CAAC,CAAC;AAAA,QAClK,GAAG,CAAC,WAAW;AACX,eAAK,WAAW,QAAQ,KAAK,2BAA2B;AACxD,iBAAO,QAAQ,OAAO,MAAM;AAAA,QAChC,CAAC;AAAA,MACL;AAAA,IACJ;AACA,QAAM,uBAAN,MAA2B;AAAA,MAEvB,cAAc;AADd;AAAA,MAEA;AAAA,MACA,OAAOC,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,aAAa;AACb,YAAI,CAAC,KAAK,aAAa;AACnB,gBAAM,IAAI,MAAM,6CAA6C;AAAA,QACjE;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,eAAe;AAAA,MAC1B;AAAA,MACA,uBAAuB,eAAe;AAAA,MACtC;AAAA,MACA,UAAU,aAAa;AACnB,iBAAS,2BAA2B,OAAO;AACvC,iBAAO,SAAS,CAAC,CAAC,MAAM;AAAA,QAC5B;AACA,cAAM,SAAS,2BAA2B,WAAW,IAAI,cAAc,EAAE,MAAM,YAAY;AAC3F,eAAO,KAAK,WAAW,YAAY,iCAAiC,0BAA0B,MAAM,MAAM;AAAA,MAC9G;AAAA,IACJ;AACA,QAAM,uBAAuB,GAAG,iBAAiB,wBAAwB,GAAG,kBAAkB,0BAA0B,GAAG,gBAAgB,sBAAsB,oBAAoB,CAAC,CAAC;AACvL,QAAM,aAAN,MAAiB;AAAA,MAGb,cAAc;AAFd;AACA;AAEI,aAAK,SAAS,iCAAiC,MAAM;AAAA,MACzD;AAAA,MACA,OAAOA,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,aAAa;AACb,YAAI,CAAC,KAAK,aAAa;AACnB,gBAAM,IAAI,MAAM,6CAA6C;AAAA,QACjE;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,eAAe;AAAA,MAC1B;AAAA,MACA,uBAAuB,eAAe;AAAA,MACtC;AAAA,MACA,IAAI,MAAM,OAAO;AACb,aAAK,SAAS;AAAA,MAClB;AAAA,MACA,IAAI,SAAS,SAAS;AAClB,YAAI,KAAK,WAAW,iCAAiC,MAAM,KAAK;AAC5D;AAAA,QACJ;AACA,aAAK,WAAW,iBAAiB,iCAAiC,qBAAqB,MAAM;AAAA,UACzF;AAAA,UACA,SAAS,KAAK,WAAW,iCAAiC,MAAM,UAAU,UAAU;AAAA,QACxF,CAAC,EAAE,MAAM,MAAM;AAAA,QAGf,CAAC;AAAA,MACL;AAAA,IACJ;AACA,QAAM,gBAAN,MAAoB;AAAA,MAEhB,cAAc;AADd;AAAA,MAEA;AAAA,MACA,OAAOA,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,aAAa;AACb,YAAI,CAAC,KAAK,aAAa;AACnB,gBAAM,IAAI,MAAM,6CAA6C;AAAA,QACjE;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,eAAe;AAAA,MAC1B;AAAA,MACA,uBAAuB,eAAe;AAAA,MACtC;AAAA,MACA,SAAS,MAAM;AACX,aAAK,WAAW,iBAAiB,iCAAiC,2BAA2B,MAAM,IAAI,EAAE,MAAM,MAAM;AACjH,eAAK,WAAW,QAAQ,IAAI,2CAA2C;AAAA,QAC3E,CAAC;AAAA,MACL;AAAA,IACJ;AACA,QAAM,iBAAN,MAAqB;AAAA,MAEjB,cAAc;AADd;AAAA,MAEA;AAAA,MACA,OAAOA,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,aAAa;AACb,YAAI,CAAC,KAAK,aAAa;AACnB,gBAAM,IAAI,MAAM,6CAA6C;AAAA,QACjE;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,eAAe;AAAA,MAC1B;AAAA,MACA,uBAAuB,eAAe;AAAA,MACtC;AAAA,MACA,uBAAuB,QAAQ;AAC3B,gBAAQ,GAAG,WAAW,gBAAgB,KAAK,YAAY,MAAM;AAAA,MACjE;AAAA,MACA,4BAA4B,OAAO,QAAQ;AACvC,gBAAQ,GAAG,WAAW,qBAAqB,KAAK,YAAY,MAAM;AAAA,MACtE;AAAA,IACJ;AACA,IAAAJ,SAAQ,iBAAiB;AACzB,QAAM,iBAAiB,GAAG,eAAe,sBAAsB,GAAG,UAAU,iBAAiB,GAAG,aAAa,oBAAoB,GAAG,YAAY,mBAAmB,GAAG,cAAc,qBAAqB,GAAG,gBAAgB,uBAAuB,GAAG,qBAAqB,4BAA4B,GAAG,iBAAiB,wBAAwB,GAAG,gBAAgB,sBAAsB,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClZ,QAAM,iBAAN,MAAqB;AAAA,MAEjB,cAAc;AADd;AAAA,MAEA;AAAA,MACA,OAAOI,aAAY;AACf,aAAK,cAAcA;AAAA,MACvB;AAAA,MACA,IAAI,aAAa;AACb,YAAI,CAAC,KAAK,aAAa;AACnB,gBAAM,IAAI,MAAM,6CAA6C;AAAA,QACjE;AACA,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,eAAe;AAAA,MAC1B;AAAA,MACA,uBAAuB,eAAe;AAAA,MACtC;AAAA,MACA,uBAAuB,QAAQ;AAC3B,gBAAQ,GAAG,WAAW,gBAAgB,KAAK,YAAY,MAAM;AAAA,MACjE;AAAA,MACA,4BAA4B,OAAO,QAAQ;AACvC,gBAAQ,GAAG,WAAW,qBAAqB,KAAK,YAAY,MAAM;AAAA,MACtE;AAAA,IACJ;AACA,IAAAJ,SAAQ,iBAAiB;AACzB,QAAM,iBAAiB,GAAG,WAAW,qBAAqB,cAAc;AACxE,aAAS,uBAAuB,KAAK,KAAK;AACtC,aAAO,SAAU,MAAM;AACnB,eAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,yBAAyB,KAAK,KAAK;AACxC,aAAO,SAAU,MAAM;AACnB,eAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,sBAAsB,KAAK,KAAK;AACrC,aAAO,SAAU,MAAM;AACnB,eAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,sBAAsB,KAAK,KAAK;AACrC,aAAO,SAAU,MAAM;AACnB,eAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,sBAAsB,KAAK,KAAK;AACrC,aAAO,SAAU,MAAM;AACnB,eAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,yBAAyB,KAAK,KAAK;AACxC,aAAO,SAAU,MAAM;AACnB,eAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,yBAAyB,KAAK,KAAK;AACxC,aAAO,SAAU,MAAM;AACnB,eAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,yBAAyB,KAAK,KAAK;AACxC,aAAO,SAAU,MAAM;AACnB,eAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MACxB;AAAA,IACJ;AACA,aAAS,gBAAgB,KAAK,KAAK;AAC/B,eAAS,QAAQO,MAAKC,MAAK,MAAM;AAC7B,YAAID,QAAOC,MAAK;AACZ,iBAAO,KAAKD,MAAKC,IAAG;AAAA,QACxB,WACSD,MAAK;AACV,iBAAOA;AAAA,QACX,OACK;AACD,iBAAOC;AAAA,QACX;AAAA,MACJ;AACA,YAAM,SAAS;AAAA,QACX,SAAS;AAAA,QACT,SAAS,QAAQ,IAAI,SAAS,IAAI,SAAS,sBAAsB;AAAA,QACjE,QAAQ,QAAQ,IAAI,QAAQ,IAAI,QAAQ,qBAAqB;AAAA,QAC7D,WAAW,QAAQ,IAAI,WAAW,IAAI,WAAW,wBAAwB;AAAA,QACzE,QAAQ,QAAQ,IAAI,QAAQ,IAAI,QAAQ,qBAAqB;AAAA,QAC7D,QAAQ,QAAQ,IAAI,QAAQ,IAAI,QAAQ,qBAAqB;AAAA,QAC7D,WAAW,QAAQ,IAAI,WAAW,IAAI,WAAW,wBAAwB;AAAA,QACzE,WAAW,QAAQ,IAAI,WAAW,IAAI,WAAW,wBAAwB;AAAA,QACzE,WAAW,QAAQ,IAAI,WAAW,IAAI,WAAW,wBAAwB;AAAA,MAC7E;AACA,aAAO;AAAA,IACX;AACA,aAASN,kBAAiB,mBAAmB,UAAU,WAAW;AAC9D,YAAM,SAAU,aAAa,UAAU,UAAU,KAAK,UAAU,QAAQ,iBAAiB,GAAG,IAAI,IAAI,kBAAkB;AACtH,YAAME,cAAa,kBAAkB,MAAM;AAC3C,aAAO,UAAUA,WAAU;AAC3B,YAAM,SAAU,aAAa,UAAU,SAAS,KAAK,UAAU,OAAO,UAAU,GAAG,IAAI,IAAI,WAAW;AACtG,YAAM,YAAa,aAAa,UAAU,YAAY,KAAK,UAAU,UAAU,aAAa,GAAG,IAAI,IAAI,cAAc;AACrH,YAAM,SAAU,aAAa,UAAU,SAAS,KAAK,UAAU,OAAO,gBAAgB,GAAG,IAAI,IAAI,iBAAiB;AAClH,YAAM,eAAgB,aAAa,UAAU,SAAS,KAAK,UAAU,OAAO,gBAAgB,GAAG,IAAI,IAAI,iBAAiB;AACxH,YAAM,YAAa,aAAa,UAAU,YAAY,KAAK,UAAU,UAAU,mBAAmB,GAAG,IAAI,IAAI,oBAAoB;AACjI,YAAM,YAAa,aAAa,UAAU,YAAY,KAAK,UAAU,UAAU,aAAa,GAAG,IAAI,IAAI,cAAc;AACrH,YAAM,YAAa,aAAa,UAAU,YAAY,KAAK,UAAU,UAAU,aAAa,GAAG,IAAI,IAAI,cAAc;AACrH,YAAM,aAAa,CAAC,QAAQ,QAAQ,WAAW,QAAQ,cAAc,WAAW,WAAW,SAAS;AACpG,eAAS,UAAU,OAAO;AACtB,YAAI,iBAAiB,SAAS;AAC1B,iBAAO;AAAA,QACX,WACSD,IAAG,SAAS,KAAK,GAAG;AACzB,iBAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,kBAAM,KAAK,CAAC,aAAa,QAAQ,QAAQ,GAAG,CAAC,UAAU,OAAO,KAAK,CAAC;AAAA,UACxE,CAAC;AAAA,QACL,OACK;AACD,iBAAO,QAAQ,QAAQ,KAAK;AAAA,QAChC;AAAA,MACJ;AACA,UAAI,kBAAkB;AACtB,UAAI,oBAAoB;AACxB,UAAI,cAAc;AAClB,YAAM,qBAAqB;AAAA,QACvB,QAAQ,MAAMC,YAAW,OAAO;AAAA,QAChC,aAAa,CAAC,SAAS,WAAWA,YAAW,YAAYD,IAAG,OAAO,IAAI,IAAI,OAAO,KAAK,QAAQ,GAAG,MAAM;AAAA,QACxG,WAAW,CAAC,MAAM,YAAYC,YAAW,UAAU,MAAM,OAAO;AAAA,QAChE,kBAAkB,CAAC,MAAM,UAAU;AAC/B,gBAAM,SAASD,IAAG,OAAO,IAAI,IAAI,OAAO,KAAK;AAC7C,iBAAOC,YAAW,iBAAiB,QAAQ,KAAK;AAAA,QACpD;AAAA,QACA,gBAAgB,CAAC,MAAM,YAAYA,YAAW,eAAe,MAAM,OAAO;AAAA,QAC1E,YAAYA,YAAW;AAAA,QACvB,cAAcA,YAAW;AAAA,QACzB,cAAc,CAAC,YAAY;AACvB,8BAAoB;AACpB,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,kCAAoB;AAAA,YACxB;AAAA,UACJ;AAAA,QACJ;AAAA,QACA,eAAe,CAAC,YAAYA,YAAW,eAAe,iCAAiC,wBAAwB,MAAM,OAAO;AAAA,QAC5H,YAAY,CAAC,YAAY;AACrB,4BAAkB;AAClB,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,gCAAkB;AAAA,YACtB;AAAA,UACJ;AAAA,QACJ;AAAA,QACA,QAAQ,CAAC,YAAY;AACjB,wBAAc;AACd,iBAAO;AAAA,YACH,SAAS,MAAM;AACX,4BAAc;AAAA,YAClB;AAAA,UACJ;AAAA,QACJ;AAAA,QACA,IAAI,UAAU;AAAE,iBAAO;AAAA,QAAQ;AAAA,QAC/B,IAAI,YAAY;AAAE,iBAAO;AAAA,QAAW;AAAA,QACpC,IAAI,SAAS;AAAE,iBAAO;AAAA,QAAQ;AAAA,QAC9B,IAAI,SAAS;AAAE,iBAAO;AAAA,QAAQ;AAAA,QAC9B,IAAI,SAAS;AAAE,iBAAO;AAAA,QAAc;AAAA,QACpC,IAAI,YAAY;AAAE,iBAAO;AAAA,QAAW;AAAA,QACpC,IAAI,YAAY;AAAE,iBAAO;AAAA,QAAW;AAAA,QACpC,IAAI,YAAY;AAAE,iBAAO;AAAA,QAAW;AAAA,QACpC,0BAA0B,CAAC,YAAYA,YAAW,eAAe,iCAAiC,mCAAmC,MAAM,OAAO;AAAA,QAClJ,yBAAyB,CAAC,YAAYA,YAAW,eAAe,iCAAiC,kCAAkC,MAAM,OAAO;AAAA,QAChJ,oBAAoB;AAAA,QACpB,uBAAuB,CAAC,YAAYA,YAAW,eAAe,iCAAiC,gCAAgC,MAAM,OAAO;AAAA,QAC5I,yBAAyB,CAAC,YAAYA,YAAW,eAAe,iCAAiC,kCAAkC,MAAM,OAAO;AAAA,QAChJ,wBAAwB,CAAC,YAAYA,YAAW,eAAe,iCAAiC,iCAAiC,MAAM,OAAO;AAAA,QAC9I,wBAAwB,CAAC,YAAYA,YAAW,eAAe,iCAAiC,iCAAiC,MAAM,OAAO;AAAA,QAC9I,iCAAiC,CAAC,YAAYA,YAAW,UAAU,iCAAiC,qCAAqC,MAAM,OAAO;AAAA,QACtJ,uBAAuB,CAAC,YAAYA,YAAW,eAAe,iCAAiC,gCAAgC,MAAM,OAAO;AAAA,QAC5I,iBAAiB,CAAC,WAAWA,YAAW,iBAAiB,iCAAiC,+BAA+B,MAAM,MAAM;AAAA,QACrI,SAAS,CAAC,YAAYA,YAAW,UAAU,iCAAiC,aAAa,MAAM,CAAC,QAAQ,WAAW;AAC/G,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,GAAG,MAAS;AAAA,QAChG,CAAC;AAAA,QACD,cAAc,CAAC,YAAYA,YAAW,UAAU,iCAAiC,kBAAkB,MAAM,CAAC,QAAQ,WAAW;AACzH,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,qBAAqB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,yBAAyB,MAAM,OAAO;AAAA,QAC9H,iBAAiB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,qBAAqB,MAAM,CAAC,QAAQ,WAAW;AAC/H,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,GAAG,MAAS;AAAA,QAChG,CAAC;AAAA,QACD,eAAe,CAAC,YAAYA,YAAW,UAAU,iCAAiC,mBAAmB,MAAM,CAAC,QAAQ,WAAW;AAC3H,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,cAAc,CAAC,YAAYA,YAAW,UAAU,iCAAiC,kBAAkB,MAAM,CAAC,QAAQ,WAAW;AACzH,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,kBAAkB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,sBAAsB,MAAM,CAAC,QAAQ,WAAW;AACjI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,kBAAkB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,sBAAsB,MAAM,CAAC,QAAQ,WAAW;AACjI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,cAAc,CAAC,YAAYA,YAAW,UAAU,iCAAiC,kBAAkB,MAAM,CAAC,QAAQ,WAAW;AACzH,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,qBAAqB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,yBAAyB,MAAM,CAAC,QAAQ,WAAW;AACvI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,kBAAkB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,sBAAsB,MAAM,CAAC,QAAQ,WAAW;AACjI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,mBAAmB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,uBAAuB,MAAM,CAAC,QAAQ,WAAW;AACnI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,0BAA0B,CAAC,YAAYA,YAAW,UAAU,iCAAiC,8BAA8B,MAAM,OAAO;AAAA,QACxI,cAAc,CAAC,YAAYA,YAAW,UAAU,iCAAiC,kBAAkB,MAAM,CAAC,QAAQ,WAAW;AACzH,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,qBAAqB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,yBAAyB,MAAM,CAAC,QAAQ,WAAW;AACvI,iBAAO,QAAQ,QAAQ,MAAM;AAAA,QACjC,CAAC;AAAA,QACD,YAAY,CAAC,YAAYA,YAAW,UAAU,iCAAiC,gBAAgB,MAAM,CAAC,QAAQ,WAAW;AACrH,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,mBAAmB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,uBAAuB,MAAM,CAAC,QAAQ,WAAW;AACnI,iBAAO,QAAQ,QAAQ,MAAM;AAAA,QACjC,CAAC;AAAA,QACD,sBAAsB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,0BAA0B,MAAM,CAAC,QAAQ,WAAW;AACzI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,GAAG,MAAS;AAAA,QAChG,CAAC;AAAA,QACD,2BAA2B,CAAC,YAAYA,YAAW,UAAU,iCAAiC,+BAA+B,MAAM,CAAC,QAAQ,WAAW;AACnJ,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,GAAG,MAAS;AAAA,QAChG,CAAC;AAAA,QACD,4BAA4B,CAAC,YAAYA,YAAW,UAAU,iCAAiC,gCAAgC,MAAM,CAAC,QAAQ,WAAW;AACrJ,iBAAO,QAAQ,QAAQ,MAAM;AAAA,QACjC,CAAC;AAAA,QACD,iBAAiB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,cAAc,MAAM,CAAC,QAAQ,WAAW;AACxH,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,GAAG,MAAS;AAAA,QAChG,CAAC;AAAA,QACD,iBAAiB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,qBAAqB,MAAM,CAAC,QAAQ,WAAW;AAC/H,iBAAO,QAAQ,QAAQ,MAAM;AAAA,QACjC,CAAC;AAAA,QACD,iBAAiB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,oBAAoB,MAAM,CAAC,QAAQ,WAAW;AAC9H,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,uBAAuB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,2BAA2B,MAAM,CAAC,QAAQ,WAAW;AAC3I,iBAAO,QAAQ,QAAQ,MAAM;AAAA,QACjC,CAAC;AAAA,QACD,iBAAiB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,qBAAqB,MAAM,CAAC,QAAQ,WAAW;AAC/H,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,qBAAqB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,yBAAyB,MAAM,CAAC,QAAQ,WAAW;AACvI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,iBAAiB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,oBAAoB,MAAM,CAAC,QAAQ,WAAW;AAC9H,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,mBAAmB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,sBAAsB,MAAM,CAAC,QAAQ,WAAW;AAClI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,IAAI,GAAG,WAAW,qBAAqBA,aAAY,MAAM,CAAC;AAAA,QAC9I,CAAC;AAAA,QACD,kBAAkB,CAAC,YAAYA,YAAW,UAAU,iCAAiC,sBAAsB,MAAM,CAAC,QAAQ,WAAW;AACjI,iBAAO,QAAQ,QAAQ,SAAS,GAAG,WAAW,gBAAgBA,aAAY,MAAM,GAAG,MAAS;AAAA,QAChG,CAAC;AAAA,QACD,SAAS,MAAMA,YAAW,QAAQ;AAAA,MACtC;AACA,iBAAW,UAAU,YAAY;AAC7B,eAAO,OAAO,kBAAkB;AAAA,MACpC;AACA,MAAAA,YAAW,UAAU,iCAAiC,kBAAkB,MAAM,CAAC,WAAW;AACtF,iBAAS,WAAW,MAAM;AAC1B,YAAID,IAAG,OAAO,OAAO,KAAK,GAAG;AACzB,iBAAO,QAAQ,iCAAiC,MAAM,WAAW,OAAO,KAAK;AAAA,QACjF;AACA,mBAAW,UAAU,YAAY;AAC7B,iBAAO,WAAW,OAAO,YAAY;AAAA,QACzC;AACA,YAAI,mBAAmB;AACnB,gBAAM,SAAS,kBAAkB,QAAQ,IAAI,iCAAiC,wBAAwB,EAAE,QAAQ,GAAG,WAAW,gBAAgBC,aAAY,MAAM,GAAG,MAAS;AAC5K,iBAAO,UAAU,MAAM,EAAE,KAAK,CAAC,UAAU;AACrC,gBAAI,iBAAiB,iCAAiC,eAAe;AACjE,qBAAO;AAAA,YACX;AACA,gBAAIK,UAAS;AACb,gBAAI,CAACA,SAAQ;AACT,cAAAA,UAAS,EAAE,cAAc,CAAC,EAAE;AAAA,YAChC;AACA,gBAAI,eAAeA,QAAO;AAC1B,gBAAI,CAAC,cAAc;AACf,6BAAe,CAAC;AAChB,cAAAA,QAAO,eAAe;AAAA,YAC1B;AACA,gBAAI,aAAa,qBAAqB,UAAa,aAAa,qBAAqB,MAAM;AACvF,2BAAa,mBAAmBN,IAAG,OAAO,mBAAmB,kBAAkB,IAAI,mBAAmB,qBAAqB,iCAAiC,qBAAqB;AAAA,YACrL,WACS,CAACA,IAAG,OAAO,aAAa,gBAAgB,KAAK,CAACA,IAAG,OAAO,aAAa,iBAAiB,MAAM,GAAG;AACpG,2BAAa,iBAAiB,SAASA,IAAG,OAAO,mBAAmB,kBAAkB,IAAI,mBAAmB,qBAAqB,iCAAiC,qBAAqB;AAAA,YAC5L;AACA,uBAAW,UAAU,YAAY;AAC7B,qBAAO,uBAAuB,YAAY;AAAA,YAC9C;AACA,mBAAOM;AAAA,UACX,CAAC;AAAA,QACL,OACK;AACD,gBAAM,SAAS,EAAE,cAAc,EAAE,kBAAkB,iCAAiC,qBAAqB,KAAK,EAAE;AAChH,qBAAW,UAAU,YAAY;AAC7B,mBAAO,uBAAuB,OAAO,YAAY;AAAA,UACrD;AACA,iBAAO;AAAA,QACX;AAAA,MACJ,CAAC;AACD,MAAAL,YAAW,UAAU,iCAAiC,gBAAgB,MAAM,MAAM;AAC9E,iBAAS,mBAAmB;AAC5B,YAAI,iBAAiB;AACjB,iBAAO,gBAAgB,IAAI,iCAAiC,wBAAwB,EAAE,KAAK;AAAA,QAC/F,OACK;AACD,iBAAO;AAAA,QACX;AAAA,MACJ,CAAC;AACD,MAAAA,YAAW,eAAe,iCAAiC,iBAAiB,MAAM,MAAM;AACpF,YAAI;AACA,cAAI,aAAa;AACb,mBAAO,YAAY;AAAA,UACvB;AAAA,QACJ,UACA;AACI,cAAI,SAAS,kBAAkB;AAC3B,qBAAS,KAAK,CAAC;AAAA,UACnB,OACK;AACD,qBAAS,KAAK,CAAC;AAAA,UACnB;AAAA,QACJ;AAAA,MACJ,CAAC;AACD,MAAAA,YAAW,eAAe,iCAAiC,qBAAqB,MAAM,CAAC,WAAW;AAC9F,eAAO,QAAQ,iCAAiC,MAAM,WAAW,OAAO,KAAK;AAAA,MACjF,CAAC;AACD,aAAO;AAAA,IACX;AAAA;AAAA;;;ACxxBA,IAAAM,eAAA;AAAA,+DAAAC,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,QAAI,eAAgBD,YAAQA,SAAK,gBAAiB,SAAS,GAAGA,UAAS;AACnE,eAAS,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKA,UAAS,CAAC,EAAG,iBAAgBA,UAAS,GAAG,CAAC;AAAA,IAC5H;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,mBAAmBA,SAAQ,oBAAoBA,SAAQ,gBAAgBA,SAAQ,wBAAwB;AAC/G,QAAM,mBAAmB;AACzB,WAAO,eAAeA,UAAS,yBAAyB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,iBAAiB;AAAA,IAAuB,EAAE,CAAC;AACjJ,QAAM,KAAK,aAAa,mCAAsC;AAC9D,QAAM,MAAM,aAAa,6BAAgC;AACzD,iBAAa,gBAA2CA,QAAO;AAC/D,QAAM,kBAAkB;AACxB,WAAO,eAAeA,UAAS,iBAAiB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,gBAAgB;AAAA,IAAe,EAAE,CAAC;AAChI,QAAM,aAAa;AACnB,WAAO,eAAeA,UAAS,qBAAqB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,WAAW;AAAA,IAAmB,EAAE,CAAC;AACnI,iBAAa,kBAAqBA,QAAO;AACzC,QAAIE;AACJ,KAAC,SAAUA,mBAAkB;AACzB,MAAAA,kBAAiB,MAAM;AAAA,QACnB,SAAS;AAAA,QACT,WAAW,IAAI;AAAA,QACf,WAAW,GAAG;AAAA,MAClB;AAAA,IACJ,GAAGA,sBAAqBF,SAAQ,mBAAmBE,oBAAmB,CAAC,EAAE;AAAA;AAAA;;;AC5DzE;AAAA,+DAAAC,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,aAAa;AACrB,IAAAA,SAAQ,gBAAgB;AACxB,IAAAA,SAAQ,UAAU;AAClB,IAAAA,SAAQ,wBAAwB;AAChC,IAAAA,SAAQ,wBAAwB;AAChC,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,MAAM,aAAa,QAAQ,KAAK,CAAC;AACvC,QAAM,OAAO,aAAa,QAAQ,MAAM,CAAC;AACzC,QAAME,MAAK,aAAa,QAAQ,IAAI,CAAC;AACrC,QAAM,kBAAkB,QAAQ,eAAe;AAK/C,aAAS,cAAc,KAAK;AACxB,YAAM,SAAS,IAAI,MAAM,GAAG;AAC5B,UAAI,OAAO,aAAa,WAAW,CAAC,OAAO,MAAM;AAC7C,eAAO;AAAA,MACX;AACA,YAAM,WAAW,OAAO,KAAK,MAAM,GAAG;AACtC,eAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,IAAI,KAAK,KAAK;AACjD,iBAAS,CAAC,IAAI,mBAAmB,SAAS,CAAC,CAAC;AAAA,MAChD;AACA,UAAI,QAAQ,aAAa,WAAW,SAAS,SAAS,GAAG;AACrD,cAAMC,SAAQ,SAAS,CAAC;AACxB,cAAM,SAAS,SAAS,CAAC;AAGzB,YAAIA,OAAM,WAAW,KAAK,OAAO,SAAS,KAAK,OAAO,CAAC,MAAM,KAAK;AAE9D,mBAAS,MAAM;AAAA,QACnB;AAAA,MACJ;AACA,aAAO,KAAK,UAAU,SAAS,KAAK,GAAG,CAAC;AAAA,IAC5C;AACA,aAAS,YAAY;AACjB,aAAO,QAAQ,aAAa;AAAA,IAChC;AACA,aAAS,QAAQ,YAAY,UAAU,KAAK,QAAQ;AAChD,YAAM,cAAc;AACpB,YAAM,MAAM;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACJ,EAAE,KAAK,EAAE;AACT,aAAO,IAAI,QAAQ,CAACC,UAAS,WAAW;AACpC,cAAM,MAAM,QAAQ;AACpB,cAAM,SAAS,uBAAO,OAAO,IAAI;AACjC,eAAO,KAAK,GAAG,EAAE,QAAQ,SAAO,OAAO,GAAG,IAAI,IAAI,GAAG,CAAC;AACtD,YAAI,YAAYF,IAAG,WAAW,QAAQ,GAAuB;AACzD,cAAI,OAAO,WAAW,GAAG;AACrB,mBAAO,WAAW,IAAI,WAAW,KAAK,YAAY,OAAO,WAAW;AAAA,UACxE,OACK;AACD,mBAAO,WAAW,IAAI;AAAA,UAC1B;AACA,cAAI,QAAQ;AACR,mBAAO,uBAAuB,OAAO,WAAW,CAAC,EAAE;AAAA,UACvD;AAAA,QACJ;AACA,eAAO,sBAAsB,IAAI;AACjC,YAAI;AACA,gBAAM,MAAM,GAAG,gBAAgB,MAAM,IAAI,CAAC,GAAG;AAAA,YACzC;AAAA,YACA,KAAK;AAAA,YACL,UAAU,CAAC,MAAM,GAAG;AAAA,UACxB,CAAC;AACD,cAAI,GAAG,QAAQ,QAAQ;AACnB,mBAAO,IAAI,MAAM,4CAA4C,UAAU,SAAS,CAAC;AACjF;AAAA,UACJ;AACA,aAAG,GAAG,SAAS,CAAC,UAAU;AACtB,mBAAO,KAAK;AAAA,UAChB,CAAC;AACD,aAAG,GAAG,WAAW,CAACG,aAAY;AAC1B,gBAAIA,SAAQ,MAAM,KAAK;AACnB,iBAAG,KAAK,EAAE,GAAG,IAAI,CAAC;AAClB,kBAAIA,SAAQ,GAAG;AACX,gBAAAD,SAAQC,SAAQ,CAAC;AAAA,cACrB,OACK;AACD,uBAAO,IAAI,MAAM,6BAA6B,UAAU,EAAE,CAAC;AAAA,cAC/D;AAAA,YACJ;AAAA,UACJ,CAAC;AACD,gBAAM,UAAU;AAAA,YACZ,GAAG;AAAA,YACH,GAAG;AAAA,UACP;AACA,aAAG,KAAK,OAAO;AAAA,QACnB,SACO,OAAO;AACV,iBAAO,KAAK;AAAA,QAChB;AAAA,MACJ,CAAC;AAAA,IACL;AAOA,aAAS,sBAAsB,QAAQ;AACnC,UAAI,aAAa;AACjB,YAAM,MAAM,uBAAO,OAAO,IAAI;AAC9B,aAAO,KAAK,QAAQ,GAAG,EAAE,QAAQ,SAAO,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG,CAAC;AACnE,UAAI,oBAAoB,IAAI;AAC5B,YAAM,UAAU;AAAA,QACZ,UAAU;AAAA,QACV;AAAA,MACJ;AACA,UAAI,UAAU,GAAG;AACb,qBAAa;AACb,gBAAQ,QAAQ;AAAA,MACpB;AACA,YAAM,UAAU,MAAM;AAAA,MAAE;AACxB,UAAI;AACA,gBAAQ,GAAG,WAAW,OAAO;AAC7B,cAAM,UAAU,GAAG,gBAAgB,WAAW,YAAY,CAAC,UAAU,OAAO,QAAQ,GAAG,OAAO,EAAE;AAChG,YAAI,CAAC,QAAQ;AACT,cAAI,QAAQ;AACR,mBAAO,gDAAgD;AAAA,UAC3D;AACA,iBAAO;AAAA,QACX;AACA,cAAM,SAAS,OAAO,KAAK;AAC3B,YAAI,QAAQ;AACR,iBAAO,qCAAqC,MAAM,EAAE;AAAA,QACxD;AACA,YAAI,OAAO,SAAS,GAAG;AACnB,cAAI,UAAU,GAAG;AACb,mBAAO,KAAK,KAAK,QAAQ,cAAc;AAAA,UAC3C,OACK;AACD,mBAAO,KAAK,KAAK,QAAQ,OAAO,cAAc;AAAA,UAClD;AAAA,QACJ;AACA,eAAO;AAAA,MACX,SACO,KAAK;AACR,eAAO;AAAA,MACX,UACA;AACI,gBAAQ,eAAe,WAAW,OAAO;AAAA,MAC7C;AAAA,IACJ;AAOA,aAAS,sBAAsB,QAAQ;AACnC,UAAI,cAAc;AAClB,YAAM,UAAU;AAAA,QACZ,UAAU;AAAA,MACd;AACA,UAAI,UAAU,GAAG;AACb,sBAAc;AACd,gBAAQ,QAAQ;AAAA,MACpB;AACA,YAAM,UAAU,MAAM;AAAA,MAAE;AACxB,UAAI;AACA,gBAAQ,GAAG,WAAW,OAAO;AAC7B,cAAM,WAAW,GAAG,gBAAgB,WAAW,aAAa,CAAC,UAAU,OAAO,QAAQ,GAAG,OAAO;AAChG,cAAM,SAAS,QAAQ;AACvB,YAAI,CAAC,QAAQ;AACT,cAAI,QAAQ;AACR,mBAAO,0CAA0C;AACjD,gBAAI,QAAQ,QAAQ;AAChB,qBAAO,QAAQ,MAAM;AAAA,YACzB;AAAA,UACJ;AACA,iBAAO;AAAA,QACX;AACA,cAAM,QAAQ,OAAO,KAAK,EAAE,MAAM,OAAO;AACzC,mBAAW,QAAQ,OAAO;AACtB,cAAI;AACA,kBAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,gBAAI,KAAK,SAAS,OAAO;AACrB,qBAAO,KAAK,KAAK,KAAK,MAAM,cAAc;AAAA,YAC9C;AAAA,UACJ,SACO,GAAG;AAAA,UAEV;AAAA,QACJ;AACA,eAAO;AAAA,MACX,SACO,KAAK;AACR,eAAO;AAAA,MACX,UACA;AACI,gBAAQ,eAAe,WAAW,OAAO;AAAA,MAC7C;AAAA,IACJ;AACA,QAAI;AACJ,KAAC,SAAUC,aAAY;AACnB,UAAI,mBAAmB;AACvB,eAAS,kBAAkB;AACvB,YAAI,qBAAqB,QAAQ;AAC7B,iBAAO;AAAA,QACX;AACA,YAAI,QAAQ,aAAa,SAAS;AAC9B,6BAAmB;AAAA,QACvB,OACK;AAGD,6BAAmB,CAACJ,IAAG,WAAW,WAAW,YAAY,CAAC,KAAK,CAACA,IAAG,WAAW,WAAW,YAAY,CAAC;AAAA,QAC1G;AACA,eAAO;AAAA,MACX;AACA,MAAAI,YAAW,kBAAkB;AAC7B,eAAS,SAAS,QAAQ,OAAO;AAC7B,YAAI,gBAAgB,GAAG;AACnB,iBAAO,KAAK,UAAU,KAAK,EAAE,QAAQ,KAAK,UAAU,MAAM,CAAC,MAAM;AAAA,QACrE,OACK;AACD,iBAAO,KAAK,UAAU,KAAK,EAAE,YAAY,EAAE,QAAQ,KAAK,UAAU,MAAM,EAAE,YAAY,CAAC,MAAM;AAAA,QACjG;AAAA,MACJ;AACA,MAAAA,YAAW,WAAW;AAAA,IAC1B,GAAG,eAAeN,SAAQ,aAAa,aAAa,CAAC,EAAE;AACvD,aAAS,kBAAkB,eAAe,YAAY,UAAU,QAAQ;AACpE,UAAI,UAAU;AACV,YAAI,CAAC,KAAK,WAAW,QAAQ,GAAG;AAC5B,qBAAW,KAAK,KAAK,eAAe,QAAQ;AAAA,QAChD;AACA,eAAO,QAAQ,YAAY,UAAU,UAAU,MAAM,EAAE,KAAK,CAAC,UAAU;AACnE,cAAI,WAAW,SAAS,UAAU,KAAK,GAAG;AACtC,mBAAO;AAAA,UACX,OACK;AACD,mBAAO,QAAQ,OAAO,IAAI,MAAM,kBAAkB,UAAU,2BAA2B,CAAC;AAAA,UAC5F;AAAA,QACJ,CAAC,EAAE,KAAK,QAAW,CAAC,WAAW;AAC3B,iBAAO,QAAQ,YAAY,sBAAsB,MAAM,GAAG,eAAe,MAAM;AAAA,QACnF,CAAC;AAAA,MACL,OACK;AACD,eAAO,QAAQ,YAAY,sBAAsB,MAAM,GAAG,eAAe,MAAM;AAAA,MACnF;AAAA,IACJ;AAAA;AAAA;;;ACtSA;AAAA,sDAAAO,UAAA;AAAA;AAKA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,QAAM,SAAS,QAAQ,MAAM;AAC7B,QAAM,QAAQ;AACd,QAAM,iBAAN,MAAM,uBAAsB,MAAM,sBAAsB;AAAA,MAEpD,YAAY,WAAW,SAAS;AAC5B,cAAM,QAAQ;AAAA,MAClB;AAAA,MACA,cAAc;AACV,eAAO,eAAc;AAAA,MACzB;AAAA,MACA,WAAW,OAAO,UAAU;AACxB,eAAO,OAAO,KAAK,OAAO,QAAQ;AAAA,MACtC;AAAA,MACA,SAAS,OAAO,UAAU;AACtB,YAAI,iBAAiB,QAAQ;AACzB,iBAAO,MAAM,SAAS,QAAQ;AAAA,QAClC,OACK;AACD,iBAAO,IAAI,OAAO,YAAY,QAAQ,EAAE,OAAO,KAAK;AAAA,QACxD;AAAA,MACJ;AAAA,MACA,SAAS,QAAQ,QAAQ;AACrB,YAAI,WAAW,QAAW;AACtB,iBAAO,kBAAkB,SAAS,SAAS,OAAO,KAAK,MAAM;AAAA,QACjE,OACK;AACD,iBAAO,kBAAkB,SAAS,OAAO,MAAM,GAAG,MAAM,IAAI,OAAO,KAAK,QAAQ,GAAG,MAAM;AAAA,QAC7F;AAAA,MACJ;AAAA,MACA,YAAY,QAAQ;AAChB,eAAO,OAAO,YAAY,MAAM;AAAA,MACpC;AAAA,IACJ;AA7BI,kBADE,gBACK,eAAc,OAAO,YAAY,CAAC;AAD7C,QAAM,gBAAN;AA+BA,QAAM,wBAAN,MAA4B;AAAA,MAExB,YAAYC,SAAQ;AADpB;AAEI,aAAK,SAASA;AAAA,MAClB;AAAA,MACA,QAAQ,UAAU;AACd,aAAK,OAAO,GAAG,SAAS,QAAQ;AAChC,eAAO,MAAM,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI,SAAS,QAAQ,CAAC;AAAA,MAC3E;AAAA,MACA,QAAQ,UAAU;AACd,aAAK,OAAO,GAAG,SAAS,QAAQ;AAChC,eAAO,MAAM,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI,SAAS,QAAQ,CAAC;AAAA,MAC3E;AAAA,MACA,MAAM,UAAU;AACZ,aAAK,OAAO,GAAG,OAAO,QAAQ;AAC9B,eAAO,MAAM,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI,OAAO,QAAQ,CAAC;AAAA,MACzE;AAAA,MACA,OAAO,UAAU;AACb,aAAK,OAAO,GAAG,QAAQ,QAAQ;AAC/B,eAAO,MAAM,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI,QAAQ,QAAQ,CAAC;AAAA,MAC1E;AAAA,IACJ;AACA,QAAM,wBAAN,MAA4B;AAAA,MAExB,YAAYA,SAAQ;AADpB;AAEI,aAAK,SAASA;AAAA,MAClB;AAAA,MACA,QAAQ,UAAU;AACd,aAAK,OAAO,GAAG,SAAS,QAAQ;AAChC,eAAO,MAAM,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI,SAAS,QAAQ,CAAC;AAAA,MAC3E;AAAA,MACA,QAAQ,UAAU;AACd,aAAK,OAAO,GAAG,SAAS,QAAQ;AAChC,eAAO,MAAM,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI,SAAS,QAAQ,CAAC;AAAA,MAC3E;AAAA,MACA,MAAM,UAAU;AACZ,aAAK,OAAO,GAAG,OAAO,QAAQ;AAC9B,eAAO,MAAM,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI,OAAO,QAAQ,CAAC;AAAA,MACzE;AAAA,MACA,MAAM,MAAM,UAAU;AAClB,eAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,gBAAM,WAAW,CAAC,UAAU;AACxB,gBAAI,UAAU,UAAa,UAAU,MAAM;AACvC,sBAAQ;AAAA,YACZ,OACK;AACD,qBAAO,KAAK;AAAA,YAChB;AAAA,UACJ;AACA,cAAI,OAAO,SAAS,UAAU;AAC1B,iBAAK,OAAO,MAAM,MAAM,UAAU,QAAQ;AAAA,UAC9C,OACK;AACD,iBAAK,OAAO,MAAM,MAAM,QAAQ;AAAA,UACpC;AAAA,QACJ,CAAC;AAAA,MACL;AAAA,MACA,MAAM;AACF,aAAK,OAAO,IAAI;AAAA,MACpB;AAAA,IACJ;AACA,QAAM,OAAO,OAAO,OAAO;AAAA,MACvB,eAAe,OAAO,OAAO;AAAA,QACzB,QAAQ,CAAC,aAAa,IAAI,cAAc,QAAQ;AAAA,MACpD,CAAC;AAAA,MACD,iBAAiB,OAAO,OAAO;AAAA,QAC3B,SAAS,OAAO,OAAO;AAAA,UACnB,MAAM;AAAA,UACN,QAAQ,CAAC,KAAK,YAAY;AACtB,gBAAI;AACA,qBAAO,QAAQ,QAAQ,OAAO,KAAK,KAAK,UAAU,KAAK,QAAW,CAAC,GAAG,QAAQ,OAAO,CAAC;AAAA,YAC1F,SACO,KAAK;AACR,qBAAO,QAAQ,OAAO,GAAG;AAAA,YAC7B;AAAA,UACJ;AAAA,QACJ,CAAC;AAAA,QACD,SAAS,OAAO,OAAO;AAAA,UACnB,MAAM;AAAA,UACN,QAAQ,CAAC,QAAQ,YAAY;AACzB,gBAAI;AACA,kBAAI,kBAAkB,QAAQ;AAC1B,uBAAO,QAAQ,QAAQ,KAAK,MAAM,OAAO,SAAS,QAAQ,OAAO,CAAC,CAAC;AAAA,cACvE,OACK;AACD,uBAAO,QAAQ,QAAQ,KAAK,MAAM,IAAI,OAAO,YAAY,QAAQ,OAAO,EAAE,OAAO,MAAM,CAAC,CAAC;AAAA,cAC7F;AAAA,YACJ,SACO,KAAK;AACR,qBAAO,QAAQ,OAAO,GAAG;AAAA,YAC7B;AAAA,UACJ;AAAA,QACJ,CAAC;AAAA,MACL,CAAC;AAAA,MACD,QAAQ,OAAO,OAAO;AAAA,QAClB,kBAAkB,CAACA,YAAW,IAAI,sBAAsBA,OAAM;AAAA,QAC9D,kBAAkB,CAACA,YAAW,IAAI,sBAAsBA,OAAM;AAAA,MAClE,CAAC;AAAA,MACD;AAAA,MACA,OAAO,OAAO,OAAO;AAAA,QACjB,WAAW,UAAU,OAAO,MAAM;AAC9B,gBAAM,SAAS,WAAW,UAAU,IAAI,GAAG,IAAI;AAC/C,iBAAO,EAAE,SAAS,MAAM,aAAa,MAAM,EAAE;AAAA,QACjD;AAAA,QACA,aAAa,aAAa,MAAM;AAC5B,gBAAM,SAAS,aAAa,UAAU,GAAG,IAAI;AAC7C,iBAAO,EAAE,SAAS,MAAM,eAAe,MAAM,EAAE;AAAA,QACnD;AAAA,QACA,YAAY,UAAU,OAAO,MAAM;AAC/B,gBAAM,SAAS,YAAY,UAAU,IAAI,GAAG,IAAI;AAChD,iBAAO,EAAE,SAAS,MAAM,cAAc,MAAM,EAAE;AAAA,QAClD;AAAA,MACJ,CAAC;AAAA,IACL,CAAC;AACD,aAAS,MAAM;AACX,aAAO;AAAA,IACX;AACA,KAAC,SAAUC,MAAK;AACZ,eAAS,UAAU;AACf,cAAM,IAAI,QAAQ,IAAI;AAAA,MAC1B;AACA,MAAAA,KAAI,UAAU;AAAA,IAClB,GAAG,QAAQ,MAAM,CAAC,EAAE;AACpB,IAAAF,SAAQ,UAAU;AAAA;AAAA;;;AClKlB;AAAA,uDAAAG,UAAA;AAAA;AACA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,QAAI,eAAgBD,YAAQA,SAAK,gBAAiB,SAAS,GAAGA,UAAS;AACnE,eAAS,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKA,UAAS,CAAC,EAAG,iBAAgBA,UAAS,GAAG,CAAC;AAAA,IAC5H;AACA,QAAI,kBAAmBA,YAAQA,SAAK,mBAAoB,SAAU,KAAK;AACnE,aAAQ,OAAO,IAAI,aAAc,MAAM,EAAE,WAAW,IAAI;AAAA,IAC5D;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,sBAAsBA,SAAQ,sBAAsBA,SAAQ,sBAAsBA,SAAQ,sBAAsBA,SAAQ,oBAAoBA,SAAQ,oBAAoBA,SAAQ,mBAAmBA,SAAQ,mBAAmB;AACtO,IAAAA,SAAQ,yBAAyB;AACjC,IAAAA,SAAQ,4BAA4B;AACpC,IAAAA,SAAQ,4BAA4B;AACpC,IAAAA,SAAQ,8BAA8B;AACtC,IAAAA,SAAQ,8BAA8B;AACtC,IAAAA,SAAQ,0BAA0B;AAKlC,QAAM,QAAQ,gBAAgB,aAAgB;AAE9C,UAAM,QAAQ,QAAQ;AACtB,QAAM,OAAO,aAAa,QAAQ,MAAM,CAAC;AACzC,QAAM,KAAK,aAAa,QAAQ,IAAI,CAAC;AACrC,QAAME,MAAK,aAAa,QAAQ,IAAI,CAAC;AACrC,QAAM,WAAW,QAAQ,QAAQ;AACjC,QAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAM,QAAQ;AACd,iBAAa,eAA0BF,QAAO;AAC9C,QAAM,mBAAN,cAA+B,MAAM,sBAAsB;AAAA,MAEvD,YAAYG,UAAS;AACjB,cAAM;AAFV;AAGI,aAAK,UAAUA;AACf,cAAM,eAAe,KAAK;AAC1B,qBAAa,GAAG,SAAS,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC;AACzD,qBAAa,GAAG,SAAS,MAAM,KAAK,UAAU,CAAC;AAAA,MACnD;AAAA,MACA,OAAO,UAAU;AACb,aAAK,QAAQ,GAAG,WAAW,QAAQ;AACnC,eAAO,MAAM,WAAW,OAAO,MAAM,KAAK,QAAQ,IAAI,WAAW,QAAQ,CAAC;AAAA,MAC9E;AAAA,IACJ;AACA,IAAAH,SAAQ,mBAAmB;AAC3B,QAAM,mBAAN,cAA+B,MAAM,sBAAsB;AAAA,MAGvD,YAAYG,UAAS;AACjB,cAAM;AAHV;AACA;AAGI,aAAK,UAAUA;AACf,aAAK,aAAa;AAClB,cAAM,eAAe,KAAK;AAC1B,qBAAa,GAAG,SAAS,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC;AACzD,qBAAa,GAAG,SAAS,MAAM,KAAK,SAAS;AAAA,MACjD;AAAA,MACA,MAAM,KAAK;AACP,YAAI;AACA,cAAI,OAAO,KAAK,QAAQ,SAAS,YAAY;AACzC,iBAAK,QAAQ,KAAK,KAAK,QAAW,QAAW,CAAC,UAAU;AACpD,kBAAI,OAAO;AACP,qBAAK;AACL,qBAAK,YAAY,OAAO,GAAG;AAAA,cAC/B,OACK;AACD,qBAAK,aAAa;AAAA,cACtB;AAAA,YACJ,CAAC;AAAA,UACL;AACA,iBAAO,QAAQ,QAAQ;AAAA,QAC3B,SACO,OAAO;AACV,eAAK,YAAY,OAAO,GAAG;AAC3B,iBAAO,QAAQ,OAAO,KAAK;AAAA,QAC/B;AAAA,MACJ;AAAA,MACA,YAAY,OAAO,KAAK;AACpB,aAAK;AACL,aAAK,UAAU,OAAO,KAAK,KAAK,UAAU;AAAA,MAC9C;AAAA,MACA,MAAM;AAAA,MACN;AAAA,IACJ;AACA,IAAAH,SAAQ,mBAAmB;AAC3B,QAAM,oBAAN,cAAgC,MAAM,sBAAsB;AAAA,MAExD,YAAY,MAAM;AACd,cAAM;AAFV;AAGI,aAAK,SAAS,IAAI,MAAM;AACxB,aAAK,GAAG,SAAS,MAAM,KAAK,SAAS;AACrC,aAAK,GAAG,SAAS,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC;AACjD,aAAK,GAAG,WAAW,CAAC,YAAY;AAC5B,eAAK,OAAO,KAAK,OAAO;AAAA,QAC5B,CAAC;AAAA,MACL;AAAA,MACA,OAAO,UAAU;AACb,eAAO,KAAK,OAAO,MAAM,QAAQ;AAAA,MACrC;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,oBAAN,cAAgC,MAAM,sBAAsB;AAAA,MAGxD,YAAY,MAAM;AACd,cAAM;AAHV;AACA;AAGI,aAAK,OAAO;AACZ,aAAK,aAAa;AAClB,aAAK,GAAG,SAAS,MAAM,KAAK,UAAU,CAAC;AACvC,aAAK,GAAG,SAAS,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC;AAAA,MACrD;AAAA,MACA,MAAM,KAAK;AACP,YAAI;AACA,eAAK,KAAK,YAAY,GAAG;AACzB,iBAAO,QAAQ,QAAQ;AAAA,QAC3B,SACO,OAAO;AACV,eAAK,YAAY,OAAO,GAAG;AAC3B,iBAAO,QAAQ,OAAO,KAAK;AAAA,QAC/B;AAAA,MACJ;AAAA,MACA,YAAY,OAAO,KAAK;AACpB,aAAK;AACL,aAAK,UAAU,OAAO,KAAK,KAAK,UAAU;AAAA,MAC9C;AAAA,MACA,MAAM;AAAA,MACN;AAAA,IACJ;AACA,IAAAA,SAAQ,oBAAoB;AAC5B,QAAM,sBAAN,cAAkC,MAAM,4BAA4B;AAAA,MAChE,YAAY,QAAQ,WAAW,SAAS;AACpC,eAAO,GAAG,MAAM,SAAS,EAAE,OAAO,iBAAiB,MAAM,GAAG,QAAQ;AAAA,MACxE;AAAA,IACJ;AACA,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,sBAAN,cAAkC,MAAM,6BAA6B;AAAA,MAEjE,YAAY,QAAQ,SAAS;AACzB,eAAO,GAAG,MAAM,SAAS,EAAE,OAAO,iBAAiB,MAAM,GAAG,OAAO;AAFvE;AAGI,aAAK,SAAS;AAAA,MAClB;AAAA,MACA,UAAU;AACN,cAAM,QAAQ;AACd,aAAK,OAAO,QAAQ;AAAA,MACxB;AAAA,IACJ;AACA,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,sBAAN,cAAkC,MAAM,4BAA4B;AAAA,MAChE,YAAY,UAAU,UAAU;AAC5B,eAAO,GAAG,MAAM,SAAS,EAAE,OAAO,iBAAiB,QAAQ,GAAG,QAAQ;AAAA,MAC1E;AAAA,IACJ;AACA,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,sBAAN,cAAkC,MAAM,6BAA6B;AAAA,MACjE,YAAY,UAAU,SAAS;AAC3B,eAAO,GAAG,MAAM,SAAS,EAAE,OAAO,iBAAiB,QAAQ,GAAG,OAAO;AAAA,MACzE;AAAA,IACJ;AACA,IAAAA,SAAQ,sBAAsB;AAC9B,QAAM,kBAAkB,QAAQ,IAAI,iBAAiB;AACrD,QAAM,qBAAqB,oBAAI,IAAI;AAAA,MAC/B,CAAC,SAAS,GAAG;AAAA,MACb,CAAC,UAAU,GAAG;AAAA,IAClB,CAAC;AACD,aAAS,yBAAyB;AAC9B,UAAI,QAAQ,aAAa,SAAS;AAC9B,eAAO,qBAAqB,GAAG,SAAS,aAAa,EAAE,EAAE,SAAS,KAAK,CAAC;AAAA,MAC5E;AACA,UAAI,eAAe;AACnB,YAAM,cAAc,aAAa;AACjC,YAAM,SAASE,IAAG,aAAa,4CAAmB,GAAG,OAAO,CAAC;AAC7D,YAAM,QAAQ,mBAAmB,IAAI,QAAQ,QAAQ;AACrD,UAAI,UAAU,QAAW;AACrB,uBAAe,KAAK,IAAI,QAAQ,OAAO,SAAS,aAAa,YAAY;AAAA,MAC7E;AACA,UAAI,eAAe,IAAI;AACnB,cAAM,IAAI,MAAM,8CAA8C,YAAY,cAAc;AAAA,MAC5F;AACA,YAAM,gBAAgB,GAAG,SAAS,aAAa,KAAK,MAAM,eAAe,CAAC,CAAC,EAAE,SAAS,KAAK;AAC3F,aAAO,KAAK,KAAK,QAAQ,OAAO,YAAY,OAAO;AAAA,IACvD;AACA,aAAS,0BAA0B,UAAU,WAAW,SAAS;AAC7D,UAAI;AACJ,YAAM,YAAY,IAAI,QAAQ,CAAC,SAAS,YAAY;AAChD,yBAAiB;AAAA,MACrB,CAAC;AACD,aAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,cAAM,UAAU,GAAG,MAAM,cAAc,CAAC,WAAW;AAC/C,iBAAO,MAAM;AACb,yBAAe;AAAA,YACX,IAAI,oBAAoB,QAAQ,QAAQ;AAAA,YACxC,IAAI,oBAAoB,QAAQ,QAAQ;AAAA,UAC5C,CAAC;AAAA,QACL,CAAC;AACD,eAAO,GAAG,SAAS,MAAM;AACzB,eAAO,OAAO,UAAU,MAAM;AAC1B,iBAAO,eAAe,SAAS,MAAM;AACrC,kBAAQ;AAAA,YACJ,aAAa,MAAM;AAAE,qBAAO;AAAA,YAAW;AAAA,UAC3C,CAAC;AAAA,QACL,CAAC;AAAA,MACL,CAAC;AAAA,IACL;AACA,aAAS,0BAA0B,UAAU,WAAW,SAAS;AAC7D,YAAM,UAAU,GAAG,MAAM,kBAAkB,QAAQ;AACnD,aAAO;AAAA,QACH,IAAI,oBAAoB,QAAQ,QAAQ;AAAA,QACxC,IAAI,oBAAoB,QAAQ,QAAQ;AAAA,MAC5C;AAAA,IACJ;AACA,aAAS,4BAA4B,MAAM,WAAW,SAAS;AAC3D,UAAI;AACJ,YAAM,YAAY,IAAI,QAAQ,CAAC,SAAS,YAAY;AAChD,yBAAiB;AAAA,MACrB,CAAC;AACD,aAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,cAAM,UAAU,GAAG,MAAM,cAAc,CAAC,WAAW;AAC/C,iBAAO,MAAM;AACb,yBAAe;AAAA,YACX,IAAI,oBAAoB,QAAQ,QAAQ;AAAA,YACxC,IAAI,oBAAoB,QAAQ,QAAQ;AAAA,UAC5C,CAAC;AAAA,QACL,CAAC;AACD,eAAO,GAAG,SAAS,MAAM;AACzB,eAAO,OAAO,MAAM,aAAa,MAAM;AACnC,iBAAO,eAAe,SAAS,MAAM;AACrC,kBAAQ;AAAA,YACJ,aAAa,MAAM;AAAE,qBAAO;AAAA,YAAW;AAAA,UAC3C,CAAC;AAAA,QACL,CAAC;AAAA,MACL,CAAC;AAAA,IACL;AACA,aAAS,4BAA4B,MAAM,WAAW,SAAS;AAC3D,YAAM,UAAU,GAAG,MAAM,kBAAkB,MAAM,WAAW;AAC5D,aAAO;AAAA,QACH,IAAI,oBAAoB,QAAQ,QAAQ;AAAA,QACxC,IAAI,oBAAoB,QAAQ,QAAQ;AAAA,MAC5C;AAAA,IACJ;AACA,aAAS,iBAAiB,OAAO;AAC7B,YAAM,YAAY;AAClB,aAAO,UAAU,SAAS,UAAa,UAAU,gBAAgB;AAAA,IACrE;AACA,aAAS,iBAAiB,OAAO;AAC7B,YAAM,YAAY;AAClB,aAAO,UAAU,UAAU,UAAa,UAAU,gBAAgB;AAAA,IACtE;AACA,aAAS,wBAAwB,OAAO,QAAQ,QAAQ,SAAS;AAC7D,UAAI,CAAC,QAAQ;AACT,iBAAS,MAAM;AAAA,MACnB;AACA,YAAM,SAAS,iBAAiB,KAAK,IAAI,IAAI,oBAAoB,KAAK,IAAI;AAC1E,YAAM,SAAS,iBAAiB,MAAM,IAAI,IAAI,oBAAoB,MAAM,IAAI;AAC5E,UAAI,MAAM,mBAAmB,GAAG,OAAO,GAAG;AACtC,kBAAU,EAAE,oBAAoB,QAAQ;AAAA,MAC5C;AACA,cAAQ,GAAG,MAAM,yBAAyB,QAAQ,QAAQ,QAAQ,OAAO;AAAA,IAC7E;AAAA;AAAA;;;AChSA,IAAAE,gBAAA;AAAA,uEAAAC,UAAA;AAAA;AAKA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAiB,SAAS,GAAGA,UAAS;AACnE,eAAS,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKA,UAAS,CAAC,EAAG,iBAAgBA,UAAS,GAAG,CAAC;AAAA,IAC5H;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,2BAA2B;AACnC,QAAM,SAAS;AACf,iBAAa,gBAAgCA,QAAO;AACpD,iBAAa,gBAA0BA,QAAO;AAC9C,aAAS,yBAAyB,OAAO,QAAQ,QAAQ,SAAS;AAC9D,cAAQ,GAAG,OAAO,yBAAyB,OAAO,QAAQ,QAAQ,OAAO;AAAA,IAC7E;AAAA;AAAA;;;AC1BA,IAAAC,gBAAA;AAAA,8DAAAC,UAAA;AAAA;AAMA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyB,GAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAAC,EAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAI,EAAE,CAAC;AAAA,IACf;AACA,QAAI,qBAAsBA,YAAQA,SAAK,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;AAC3F,aAAO,eAAe,GAAG,WAAW,EAAE,YAAY,MAAM,OAAO,EAAE,CAAC;AAAA,IACtE,KAAK,SAAS,GAAG,GAAG;AAChB,QAAE,SAAS,IAAI;AAAA,IACnB;AACA,QAAI,eAAgBA,YAAQA,SAAK,gBAAkB,4BAAY;AAC3D,UAAI,UAAU,SAAS,GAAG;AACtB,kBAAU,OAAO,uBAAuB,SAAUC,IAAG;AACjD,cAAI,KAAK,CAAC;AACV,mBAAS,KAAKA,GAAG,KAAI,OAAO,UAAU,eAAe,KAAKA,IAAG,CAAC,EAAG,IAAG,GAAG,MAAM,IAAI;AACjF,iBAAO;AAAA,QACX;AACA,eAAO,QAAQ,CAAC;AAAA,MACpB;AACA,aAAO,SAAU,KAAK;AAClB,YAAI,OAAO,IAAI,WAAY,QAAO;AAClC,YAAI,SAAS,CAAC;AACd,YAAI,OAAO;AAAM,mBAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,EAAE,CAAC,MAAM,UAAW,iBAAgB,QAAQ,KAAK,EAAE,CAAC,CAAC;AAAA;AAC/H,2BAAmB,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACX;AAAA,IACJ,GAAG;AACH,QAAI,eAAgBD,YAAQA,SAAK,gBAAiB,SAAS,GAAGA,UAAS;AACnE,eAAS,KAAK,EAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKA,UAAS,CAAC,EAAG,iBAAgBA,UAAS,GAAG,CAAC;AAAA,IAC5H;AACA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,mBAAmBE;AAC3B,QAAM,cAAc,QAAQ,WAAW;AACvC,QAAMC,MAAK,aAAa,aAA6B;AACrD,QAAM,WAAW;AACjB,QAAM,KAAK,aAAa,eAAkB;AAC1C,QAAM,SAAS;AACf,iBAAa,iBAAgDH,QAAO;AACpE,iBAAa,gBAA0BA,QAAO;AAC9C,QAAI;AACJ,KAAC,SAAUI,QAAO;AACd,MAAAA,OAAM,gBAAgB,GAAG;AACzB,MAAAA,OAAM,wBAAwB,GAAG;AACjC,MAAAA,OAAM,wBAAwB,GAAG;AACjC,MAAAA,OAAM,UAAU,GAAG;AACnB,MAAAA,OAAM,oBAAoB,GAAG;AAAA,IACjC,GAAG,UAAUJ,SAAQ,QAAQ,QAAQ,CAAC,EAAE;AACxC,QAAI;AACJ,aAAS,wBAAwB;AAC7B,UAAI,wBAAwB,QAAW;AACnC;AAAA,MACJ;AACA,UAAI;AACA,4BAAoB,IAAI;AAAA,MAC5B,SACO,MAAM;AAAA,MAGb;AAAA,IACJ;AACA,QAAI,oBAAoB;AACxB,QAAI,YAAY;AAChB,aAAS,iBAAiB;AACtB,YAAM,UAAU;AAChB,eAAS,SAAS,OAAO;AACrB,YAAI;AACA,gBAAM,YAAY,SAAS,KAAK;AAChC,cAAI,CAAC,MAAM,SAAS,GAAG;AACnB,wBAAY,YAAY,MAAM;AAC1B,kBAAI;AACA,wBAAQ,KAAK,WAAW,CAAC;AAAA,cAC7B,SACO,IAAI;AAEP,sCAAsB;AACtB,wBAAQ,KAAK,oBAAoB,IAAI,CAAC;AAAA,cAC1C;AAAA,YACJ,GAAG,GAAI;AAAA,UACX;AAAA,QACJ,SACO,GAAG;AAAA,QAEV;AAAA,MACJ;AACA,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK,QAAQ,KAAK;AAC1C,cAAM,MAAM,QAAQ,KAAK,CAAC;AAC1B,YAAI,QAAQ,WAAW,IAAI,IAAI,QAAQ,KAAK,QAAQ;AAChD,mBAAS,QAAQ,KAAK,IAAI,CAAC,CAAC;AAC5B;AAAA,QACJ,OACK;AACD,gBAAM,OAAO,IAAI,MAAM,GAAG;AAC1B,cAAI,KAAK,CAAC,MAAM,SAAS;AACrB,qBAAS,KAAK,CAAC,CAAC;AAAA,UACpB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,mBAAe;AACf,QAAM,WAAW;AAAA,MACb,YAAY,CAAC,WAAW;AACpB,cAAM,YAAY,OAAO;AACzB,YAAIG,IAAG,OAAO,SAAS,KAAK,cAAc,QAAW;AAGjD,sBAAY,MAAM;AACd,gBAAI;AACA,sBAAQ,KAAK,WAAW,CAAC;AAAA,YAC7B,SACO,IAAI;AAEP,sBAAQ,KAAK,oBAAoB,IAAI,CAAC;AAAA,YAC1C;AAAA,UACJ,GAAG,GAAI;AAAA,QACX;AAAA,MACJ;AAAA,MACA,IAAI,mBAAmB;AACnB,eAAO;AAAA,MACX;AAAA,MACA,IAAI,iBAAiB,OAAO;AACxB,4BAAoB;AAAA,MACxB;AAAA,MACA,MAAM,CAAC,SAAS;AACZ,8BAAsB;AACtB,gBAAQ,KAAK,IAAI;AAAA,MACrB;AAAA,IACJ;AACA,aAASD,kBAAiB,MAAM,MAAM,MAAM,MAAM;AAC9C,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,SAAS,UAAa,KAAK,YAAY,YAAY;AACnD,oBAAY;AACZ,eAAO;AACP,eAAO;AACP,eAAO;AAAA,MACX;AACA,UAAI,OAAO,mBAAmB,GAAG,IAAI,KAAK,OAAO,kBAAkB,GAAG,IAAI,GAAG;AACzE,kBAAU;AAAA,MACd,OACK;AACD,gBAAQ;AACR,iBAAS;AACT,kBAAU;AAAA,MACd;AACA,aAAO,kBAAkB,OAAO,QAAQ,SAAS,SAAS;AAAA,IAC9D;AACA,aAAS,kBAAkB,OAAO,QAAQ,SAAS,WAAW;AAC1D,UAAI,QAAQ;AACZ,UAAI,CAAC,SAAS,CAAC,UAAU,QAAQ,KAAK,SAAS,GAAG;AAC9C,YAAI,OAAO;AACX,YAAI,WAAW;AACf,cAAM,OAAO,QAAQ,KAAK,MAAM,CAAC;AACjC,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,gBAAM,MAAM,KAAK,CAAC;AAClB,cAAI,QAAQ,cAAc;AACtB,oBAAQ,IAAI,OAAO,iBAAiB,OAAO;AAC3C,qBAAS,IAAI,OAAO,iBAAiB,OAAO;AAC5C;AAAA,UACJ,WACS,QAAQ,WAAW;AACxB,oBAAQ;AACR,oBAAQ,QAAQ;AAChB,qBAAS,QAAQ;AACjB;AAAA,UACJ,WACS,QAAQ,YAAY;AACzB,mBAAO,SAAS,KAAK,IAAI,CAAC,CAAC;AAC3B;AAAA,UACJ,WACS,QAAQ,UAAU;AACvB,uBAAW,KAAK,IAAI,CAAC;AACrB;AAAA,UACJ,OACK;AACD,kBAAM,OAAO,IAAI,MAAM,GAAG;AAC1B,gBAAI,KAAK,CAAC,MAAM,YAAY;AACxB,qBAAO,SAAS,KAAK,CAAC,CAAC;AACvB;AAAA,YACJ,WACS,KAAK,CAAC,MAAM,UAAU;AAC3B,yBAAW,KAAK,CAAC;AACjB;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AACA,YAAI,MAAM;AACN,gBAAM,aAAa,GAAG,OAAO,6BAA6B,IAAI;AAC9D,kBAAQ,UAAU,CAAC;AACnB,mBAAS,UAAU,CAAC;AAAA,QACxB,WACS,UAAU;AACf,gBAAM,aAAa,GAAG,OAAO,2BAA2B,QAAQ;AAChE,kBAAQ,UAAU,CAAC;AACnB,mBAAS,UAAU,CAAC;AAAA,QACxB;AAAA,MACJ;AACA,YAAM,qBAAqB;AAC3B,UAAI,CAAC,OAAO;AACR,cAAM,IAAI,MAAM,yCAAyC,kBAAkB;AAAA,MAC/E;AACA,UAAI,CAAC,QAAQ;AACT,cAAM,IAAI,MAAM,0CAA0C,kBAAkB;AAAA,MAChF;AAEA,UAAIC,IAAG,KAAK,MAAM,IAAI,KAAKA,IAAG,KAAK,MAAM,EAAE,GAAG;AAC1C,cAAM,cAAc;AACpB,oBAAY,GAAG,OAAO,MAAM;AACxB,gCAAsB;AACtB,kBAAQ,KAAK,oBAAoB,IAAI,CAAC;AAAA,QAC1C,CAAC;AACD,oBAAY,GAAG,SAAS,MAAM;AAC1B,gCAAsB;AACtB,kBAAQ,KAAK,oBAAoB,IAAI,CAAC;AAAA,QAC1C,CAAC;AAAA,MACL;AACA,YAAM,oBAAoB,CAAC,WAAW;AAClC,cAAM,UAAU,GAAG,OAAO,0BAA0B,OAAO,QAAQ,QAAQ,OAAO;AAClF,YAAI,OAAO;AACP,uBAAa,MAAM;AAAA,QACvB;AACA,eAAO;AAAA,MACX;AACA,cAAQ,GAAG,SAAS,kBAAkB,mBAAmB,UAAU,SAAS;AAAA,IAChF;AACA,aAAS,aAAa,QAAQ;AAC1B,eAAS,UAAU,MAAM;AACrB,eAAO,KAAK,IAAI,SAAO,OAAO,QAAQ,WAAW,OAAO,GAAG,YAAY,SAAS,GAAG,CAAC,EAAE,KAAK,GAAG;AAAA,MAClG;AACA,YAAM,WAAW,oBAAI,IAAI;AACzB,cAAQ,SAAS,SAAS,OAAO,cAAc,MAAM;AACjD,YAAI,WAAW;AACX;AAAA,QACJ;AACA,YAAI,KAAK,WAAW,GAAG;AACnB,iBAAO,MAAM,kBAAkB;AAAA,QACnC,OACK;AACD,gBAAM,CAAC,SAAS,GAAG,IAAI,IAAI;AAC3B,iBAAO,MAAM,qBAAqB,OAAO,IAAI,UAAU,IAAI,CAAC,EAAE;AAAA,QAClE;AAAA,MACJ;AACA,cAAQ,QAAQ,SAAS,MAAM,QAAQ,WAAW;AAhQtD;AAiQQ,cAAM,UAAU,OAAO,KAAK;AAC5B,YAAI,WAAU,cAAS,IAAI,OAAO,MAApB,YAAyB;AACvC,mBAAW;AACX,iBAAS,IAAI,SAAS,OAAO;AAC7B,eAAO,IAAI,GAAG,OAAO,KAAK,OAAO,EAAE;AAAA,MACvC;AACA,cAAQ,aAAa,SAAS,WAAW,OAAO;AAC5C,YAAI,UAAU,QAAW;AACrB,mBAAS,MAAM;AAAA,QACnB,OACK;AACD,mBAAS,OAAO,OAAO,KAAK,CAAC;AAAA,QACjC;AAAA,MACJ;AACA,cAAQ,QAAQ,SAAS,SAAS,MAAM;AACpC,eAAO,IAAI,UAAU,IAAI,CAAC;AAAA,MAC9B;AACA,cAAQ,MAAM,SAAS,IAAI,KAAK,SAAS;AACrC,eAAO,KAAK,GAAG,YAAY,SAAS,KAAK,OAAO,CAAC;AAAA,MACrD;AACA,cAAQ,MAAM,SAAS,OAAO,MAAM;AAChC,eAAO,IAAI,UAAU,IAAI,CAAC;AAAA,MAC9B;AACA,cAAQ,QAAQ,SAAS,SAAS,MAAM;AACpC,eAAO,MAAM,UAAU,IAAI,CAAC;AAAA,MAChC;AACA,cAAQ,QAAQ,SAAS,SAAS,MAAM;AACpC,cAAM,QAAQ,IAAI,MAAM,EAAE,MAAM,QAAQ,aAAa,EAAE;AACvD,YAAI,UAAU;AACd,YAAI,KAAK,WAAW,GAAG;AACnB,qBAAW,KAAK,UAAU,IAAI,CAAC;AAAA,QACnC;AACA,eAAO,IAAI,GAAG,OAAO;AAAA,EAAK,KAAK,EAAE;AAAA,MACrC;AACA,cAAQ,OAAO,SAAS,QAAQ,MAAM;AAClC,eAAO,KAAK,UAAU,IAAI,CAAC;AAAA,MAC/B;AAAA,IACJ;AAAA;AAAA;;;AC/QA,mCAA6D;;;ACMvD,SAAU,UAAU,KAAY;AAClC,SAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,OAAQ,IAAgB,UAAU;AACxF;AA8DM,SAAU,YAAY,KAAY;AACpC,SAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,OAAQ,IAAkB,aAAa,YAAY,SAAS;AAClH;AAEM,SAAU,iBAAiB,KAAY;AACzC,SAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,OAAQ,IAAkB,aAAa,YAAY,WAAW;AACpH;AA8BM,SAAU,qBAAqB,KAAY;AAC7C,SAAO,OAAO,QAAQ,YAAY,QAAQ,QACnC,OAAQ,IAA2B,SAAS,YAC5C,OAAQ,IAA2B,SAAS,YAC5C,OAAQ,IAA2B,SAAS;AACvD;AAsBM,SAAU,eAAe,KAAY;AACvC,SAAO,OAAO,QAAQ,YAAY,QAAQ,QACnC,OAAQ,IAAqB,SAAS,YACtC,OAAQ,IAAqB,YAAY;AACpD;AAqBM,IAAgB,wBAAhB,MAAqC;EAA3C,cAAA;AAGc,SAAA,WAAgE,CAAA;AAChE,SAAA,cAAoD,CAAA;EA0FlE;EAxFI,cAAW;AACP,WAAO,OAAO,KAAK,KAAK,KAAK;EACjC;EAEA,iBAAiB,SAAsB;AA/L3C;AAgMQ,UAAM,WAAW,KAAK,MAAM,QAAQ,UAAU,KAAK;AACnD,QAAI,CAAC,UAAU;AACX,YAAM,IAAI,MAAM,QAAQ,QAAQ,UAAU,SAAS,WAAW,aAAa;IAC/E;AACA,UAAM,iBAAgB,cAAS,WAAW,QAAQ,QAAQ,MAApC,mBAAuC;AAC7D,QAAI,CAAC,eAAe;AAChB,YAAM,IAAI,MAAM,YAAY,QAAQ,YAAY,WAAW,YAAY,QAAQ,UAAU,KAAK,sBAAsB;IACxH;AACA,WAAO;EACX;EAEA,gBAAgB,MAAY;AACxB,UAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,QAAI,CAAC,QAAQ;AACT,aAAO;QACH,MAAM;QACN,YAAY,CAAA;QACZ,YAAY,CAAA;;IAEpB;AACA,WAAO;EACX;EAEA,WAAW,MAAe,MAAY;AAClC,WAAO,UAAU,IAAI,KAAK,KAAK,UAAU,KAAK,OAAO,IAAI;EAC7D;EAEA,UAAU,SAAiB,WAAiB;AACxC,QAAI,YAAY,WAAW;AACvB,aAAO;IACX;AACA,QAAI,SAAS,KAAK,SAAS,OAAO;AAClC,QAAI,CAAC,QAAQ;AACT,eAAS,KAAK,SAAS,OAAO,IAAI,CAAA;IACtC;AACA,UAAM,WAAW,OAAO,SAAS;AACjC,QAAI,aAAa,QAAW;AACxB,aAAO;IACX,OAAO;AACH,YAAM,WAAW,KAAK,MAAM,OAAO;AACnC,YAAM,SAAS,WAAW,SAAS,WAAW,KAAK,OAAK,KAAK,UAAU,GAAG,SAAS,CAAC,IAAI;AACxF,aAAO,SAAS,IAAI;AACpB,aAAO;IACX;EACJ;EAEA,eAAe,MAAY;AACvB,UAAM,WAAW,KAAK,YAAY,IAAI;AACtC,QAAI,UAAU;AACV,aAAO;IACX,OAAO;AACH,YAAM,WAAW,KAAK,YAAW;AACjC,YAAM,QAAkB,CAAA;AACxB,iBAAW,mBAAmB,UAAU;AACpC,YAAI,KAAK,UAAU,iBAAiB,IAAI,GAAG;AACvC,gBAAM,KAAK,eAAe;QAC9B;MACJ;AACA,WAAK,YAAY,IAAI,IAAI;AACzB,aAAO;IACX;EACJ;;;;;;EAOA,WAAW,MAAa;AACpB,UAAM,OAAO,KAAK,gBAAgB,KAAK,KAAK;AAC5C,eAAW,OAAO,OAAO,KAAK,KAAK,UAAU,GAAG;AAC5C,YAAM,OAAO,KAAK,WAAW,GAAG;AAChC,UAAI,KAAK,UAAU;AACf;MACJ;AAEA,YAAM,QAAS,KAAwB,KAAK,IAAI;AAChD,UAAI,UAAU,UAAa,UAAU,MAAM;AACvC,eAAO;MACX;IACJ;AACA,WAAO;EACX;;AAgFE,SAAU,mBAAmB,MAAa;AAC5C,SAAO,OAAO,SAAS,YAAY,SAAS,QAAQ,MAAM,QAAS,KAA0B,OAAO;AACxG;AASM,SAAU,cAAc,MAAa;AACvC,SAAO,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAQ,KAAqB,cAAc;AACnG;AAMM,SAAU,cAAc,MAAa;AACvC,SAAO,mBAAmB,IAAI,KAAK,OAAQ,KAAqB,aAAa;AACjF;;;ACnSO,IAAM,kBAAkB;EAC3B,OAAO;EACP,aAAa;;AAGX,SAAU,kBAAkB,MAAa;AAC3C,SAAO,WAAW,WAAW,MAAM,gBAAgB,KAAK;AAC5D;AAIO,IAAM,qBAAqB;EAC9B,OAAO;;AAGL,SAAU,qBAAqB,MAAa;AAC9C,SAAO,WAAW,WAAW,MAAM,mBAAmB,KAAK;AAC/D;AAIO,IAAM,eAAe;EACxB,OAAO;;AASJ,IAAM,eAAe;EACxB,OAAO;;AAeJ,IAAM,SAAS;EAClB,OAAO;EACP,aAAa;EACb,SAAS;EACT,cAAc;EACd,UAAU;EACV,MAAM;;AAGJ,SAAU,SAAS,MAAa;AAClC,SAAO,WAAW,WAAW,MAAM,OAAO,KAAK;AACnD;AAOO,IAAM,eAAe;EACxB,OAAO;EACP,aAAa;EACb,UAAU;;AAGR,SAAU,eAAe,MAAa;AACxC,SAAO,WAAW,WAAW,MAAM,aAAa,KAAK;AACzD;AAQO,IAAM,eAAe;EACxB,OAAO;EACP,UAAU;;AAaP,IAAM,YAAY;EACrB,OAAO;EACP,aAAa;;AAeV,IAAM,aAAa;EACtB,OAAO;EACP,aAAa;EACb,SAAS;EACT,UAAU;EACV,WAAW;EACX,UAAU;;AAGR,SAAU,aAAa,MAAa;AACtC,SAAO,WAAW,WAAW,MAAM,WAAW,KAAK;AACvD;AAUO,IAAM,iBAAiB;EAC1B,OAAO;EACP,MAAM;;AAGJ,SAAU,iBAAiB,MAAa;AAC1C,SAAO,WAAW,WAAW,MAAM,eAAe,KAAK;AAC3D;AAQO,IAAM,iBAAiB;EAC1B,OAAO;EACP,aAAa;EACb,MAAM;EACN,WAAW;EACX,eAAe;EACf,OAAO;;AAGL,SAAU,iBAAiB,MAAa;AAC1C,SAAO,WAAW,WAAW,MAAM,eAAe,KAAK;AAC3D;AAIO,IAAM,YAAY;EACrB,OAAO;;AAcJ,IAAM,cAAc;EACvB,OAAO;EACP,MAAM;EACN,OAAO;;AAGL,SAAU,cAAc,MAAa;AACvC,SAAO,WAAW,WAAW,MAAM,YAAY,KAAK;AACxD;AAUO,IAAM,iBAAiB;EAC1B,OAAO;EACP,aAAa;EACb,kBAAkB;EAClB,SAAS;EACT,UAAU;EACV,MAAM;;AAGJ,SAAU,iBAAiB,MAAa;AAC1C,SAAO,WAAW,WAAW,MAAM,eAAe,KAAK;AAC3D;AASO,IAAM,cAAc;EACvB,OAAO;EACP,MAAM;EACN,OAAO;;AAGL,SAAU,cAAc,MAAa;AACvC,SAAO,WAAW,WAAW,MAAM,YAAY,KAAK;AACxD;AAMO,IAAM,YAAY;EACrB,OAAO;EACP,aAAa;;AAGX,SAAU,YAAY,MAAa;AACrC,SAAO,WAAW,WAAW,MAAM,UAAU,KAAK;AACtD;AAcO,IAAM,UAAU;EACnB,OAAO;EACP,SAAS;EACT,YAAY;EACZ,YAAY;EACZ,MAAM;EACN,OAAO;EACP,OAAO;;AAaJ,IAAM,gBAAgB;EACzB,OAAO;EACP,MAAM;;AAcH,IAAM,QAAQ;EACjB,OAAO;EACP,aAAa;EACb,UAAU;EACV,gBAAgB;EAChB,WAAW;;AAGT,SAAU,QAAQ,MAAa;AACjC,SAAO,WAAW,WAAW,MAAM,MAAM,KAAK;AAClD;AAQO,IAAM,eAAe;EACxB,OAAO;EACP,MAAM;;AAGJ,SAAU,eAAe,MAAa;AACxC,SAAO,WAAW,WAAW,MAAM,aAAa,KAAK;AACzD;AAcO,IAAM,YAAY;EACrB,OAAO;EACP,MAAM;EACN,UAAU;EACV,cAAc;EACd,MAAM;EACN,WAAW;EACX,YAAY;EACZ,YAAY;;AAGV,SAAU,YAAY,MAAa;AACrC,SAAO,WAAW,WAAW,MAAM,UAAU,KAAK;AACtD;AASO,IAAM,wBAAwB;EACjC,OAAO;EACP,eAAe;EACf,WAAW;;AAaR,IAAM,qBAAqB;EAC9B,OAAO;EACP,aAAa;;AAeV,IAAM,YAAY;EACrB,OAAO;EACP,YAAY;EACZ,MAAM;EACN,YAAY;;AAGV,SAAU,YAAY,MAAa;AACrC,SAAO,WAAW,WAAW,MAAM,UAAU,KAAK;AACtD;AASO,IAAM,UAAU;EACnB,OAAO;EACP,aAAa;EACb,WAAW;EACX,OAAO;;AAGL,SAAU,UAAU,MAAa;AACnC,SAAO,WAAW,WAAW,MAAM,QAAQ,KAAK;AACpD;AAUO,IAAM,gBAAgB;EACzB,OAAO;EACP,cAAc;EACd,WAAW;EACX,OAAO;;AAYJ,IAAM,eAAe;EACxB,OAAO;EACP,aAAa;EACb,WAAW;EACX,eAAe;EACf,UAAU;;AAGR,SAAU,eAAe,MAAa;AACxC,SAAO,WAAW,WAAW,MAAM,aAAa,KAAK;AACzD;AAQO,IAAM,WAAW;EACpB,OAAO;EACP,OAAO;;AAGL,SAAU,WAAW,MAAa;AACpC,SAAO,WAAW,WAAW,MAAM,SAAS,KAAK;AACrD;AAQO,IAAM,gBAAgB;EACzB,OAAO;EACP,OAAO;;AAaJ,IAAM,YAAY;EACrB,OAAO;EACP,MAAM;;AAaH,IAAM,qBAAqB;EAC9B,OAAO;EACP,WAAW;;AAGT,SAAU,qBAAqB,MAAa;AAC9C,SAAO,WAAW,WAAW,MAAM,mBAAmB,KAAK;AAC/D;AAeO,IAAM,aAAa;EACtB,OAAO;EACP,UAAU;EACV,YAAY;EACZ,OAAO;EACP,UAAU;EACV,cAAc;EACd,MAAM;EACN,YAAY;EACZ,YAAY;;AAGV,SAAU,aAAa,MAAa;AACtC,SAAO,WAAW,WAAW,MAAM,WAAW,KAAK;AACvD;AAWO,IAAM,gBAAgB;EACzB,OAAO;EACP,SAAS;EACT,eAAe;;AAYZ,IAAM,aAAa;EACtB,OAAO;EACP,aAAa;EACb,WAAW;EACX,eAAe;EACf,OAAO;;AAGL,SAAU,aAAa,MAAa;AACtC,SAAO,WAAW,WAAW,MAAM,WAAW,KAAK;AACvD;AAQO,IAAM,aAAa;EACtB,OAAO;EACP,MAAM;;AAGJ,SAAU,aAAa,MAAa;AACtC,SAAO,WAAW,WAAW,MAAM,WAAW,KAAK;AACvD;AAUO,IAAM,WAAW;EACpB,OAAO;EACP,WAAW;EACX,aAAa;EACb,WAAW;EACX,MAAM;;AAGJ,SAAU,WAAW,MAAa;AACpC,SAAO,WAAW,WAAW,MAAM,SAAS,KAAK;AACrD;AAUO,IAAM,aAAa;EACtB,OAAO;EACP,eAAe;EACf,YAAY;EACZ,SAAS;;AAGP,SAAU,aAAa,MAAa;AACtC,SAAO,WAAW,WAAW,MAAM,WAAW,KAAK;AACvD;AAQO,IAAM,gBAAgB;EACzB,OAAO;EACP,OAAO;;AAYJ,IAAM,uBAAuB;EAChC,OAAO;EACP,aAAa;EACb,UAAU;EACV,WAAW;EACX,eAAe;;AAGb,SAAU,uBAAuB,MAAa;AAChD,SAAO,WAAW,WAAW,MAAM,qBAAqB,KAAK;AACjE;AAQO,IAAM,kBAAkB;EAC3B,OAAO;EACP,aAAa;EACb,WAAW;EACX,eAAe;;AAYZ,IAAM,gBAAgB;EACzB,OAAO;EACP,aAAa;EACb,UAAU;EACV,WAAW;EACX,eAAe;;AAGb,SAAU,gBAAgB,MAAa;AACzC,SAAO,WAAW,WAAW,MAAM,cAAc,KAAK;AAC1D;AAYO,IAAM,eAAe;EACxB,OAAO;EACP,YAAY;EACZ,UAAU;EACV,QAAQ;EACR,MAAM;EACN,MAAM;;AAGJ,SAAU,eAAe,MAAa;AACxC,SAAO,WAAW,WAAW,MAAM,aAAa,KAAK;AACzD;AAOO,IAAM,mBAAmB;EAC5B,OAAO;EACP,aAAa;EACb,WAAW;EACX,eAAe;EACf,MAAM;;AAGJ,SAAU,mBAAmB,MAAa;AAC5C,SAAO,WAAW,WAAW,MAAM,iBAAiB,KAAK;AAC7D;AASO,IAAM,OAAO;EAChB,OAAO;EACP,MAAM;EACN,MAAM;;AAGJ,SAAU,OAAO,MAAa;AAChC,SAAO,WAAW,WAAW,MAAM,KAAK,KAAK;AACjD;AAWO,IAAM,gBAAgB;EACzB,OAAO;EACP,cAAc;EACd,YAAY;EACZ,MAAM;EACN,MAAM;;AASH,IAAM,iBAAiB;EAC1B,OAAO;;AAaJ,IAAM,YAAY;EACrB,OAAO;EACP,OAAO;;AAYJ,IAAM,iBAAiB;EAC1B,OAAO;EACP,aAAa;EACb,UAAU;;AAGR,SAAU,iBAAiB,MAAa;AAC1C,SAAO,WAAW,WAAW,MAAM,eAAe,KAAK;AAC3D;AAOO,IAAM,aAAa;EACtB,OAAO;EACP,aAAa;EACb,WAAW;EACX,eAAe;EACf,UAAU;;AAGR,SAAU,aAAa,MAAa;AACtC,SAAO,WAAW,WAAW,MAAM,WAAW,KAAK;AACvD;AAIO,IAAM,eAAe;EACxB,OAAO;;AAWJ,IAAM,WAAW;EACpB,OAAO;EACP,aAAa;EACb,WAAW;EACX,eAAe;;AAGb,SAAU,WAAW,MAAa;AACpC,SAAO,WAAW,WAAW,MAAM,SAAS,KAAK;AACrD;AAwDM,IAAO,8BAAP,cAAmD,sBAAqB;EAA9E,cAAA;;AACsB,SAAA,QAAQ;MACtB,iBAAiB;QACb,MAAM,gBAAgB;QACtB,YAAY;UACR,aAAa;YACT,MAAM,gBAAgB;YACtB,UAAU;;;QAGlB,YAAY,CAAA;;MAEhB,oBAAoB;QAChB,MAAM,mBAAmB;QACzB,YAAY,CAAA;QAEZ,YAAY,CAAC,aAAa,OAAO,aAAa,KAAK;;MAEvD,cAAc;QACV,MAAM,aAAa;QACnB,YAAY,CAAA;QAEZ,YAAY,CAAA;;MAEhB,cAAc;QACV,MAAM,aAAa;QACnB,YAAY,CAAA;QAEZ,YAAY,CAAA;;MAEhB,QAAQ;QACJ,MAAM,OAAO;QACb,YAAY;UACR,aAAa;YACT,MAAM,OAAO;YACb,UAAU;;UAEd,SAAS;YACL,MAAM,OAAO;YACb,UAAU;;UAEd,cAAc;YACV,MAAM,OAAO;YACb,UAAU;;UAEd,UAAU;YACN,MAAM,OAAO;YACb,UAAU;;UAEd,MAAM;YACF,MAAM,OAAO;YACb,eAAe,aAAa;YAC5B,UAAU;;;QAGlB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,cAAc;QACV,MAAM,aAAa;QACnB,YAAY;UACR,aAAa;YACT,MAAM,aAAa;YACnB,UAAU;;UAEd,UAAU;YACN,MAAM,aAAa;YACnB,cAAc,CAAA;;;QAGtB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,cAAc;QACV,MAAM,aAAa;QACnB,YAAY;UACR,UAAU;YACN,MAAM,aAAa;YACnB,cAAc,CAAA;;;QAGtB,YAAY,CAAC,aAAa,KAAK;;MAEnC,WAAW;QACP,MAAM,UAAU;QAChB,YAAY;UACR,aAAa;YACT,MAAM,UAAU;;;QAGxB,YAAY,CAAC,eAAe,KAAK;;MAErC,YAAY;QACR,MAAM,WAAW;QACjB,YAAY;UACR,aAAa;YACT,MAAM,WAAW;YACjB,UAAU;;UAEd,SAAS;YACL,MAAM,WAAW;;UAErB,UAAU;YACN,MAAM,WAAW;;UAErB,WAAW;YACP,MAAM,WAAW;YACjB,UAAU;;UAEd,UAAU;YACN,MAAM,WAAW;;;QAGzB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,gBAAgB;QACZ,MAAM,eAAe;QACrB,YAAY;UACR,MAAM;YACF,MAAM,eAAe;YACrB,cAAc;;;QAGtB,YAAY,CAAC,UAAU,OAAO,aAAa,KAAK;;MAEpD,gBAAgB;QACZ,MAAM,eAAe;QACrB,YAAY;UACR,aAAa;YACT,MAAM,eAAe;YACrB,UAAU;;UAEd,MAAM;YACF,MAAM,eAAe;;UAEzB,WAAW;YACP,MAAM,eAAe;YACrB,UAAU;;UAEd,eAAe;YACX,MAAM,eAAe;YACrB,cAAc;YACd,UAAU;;UAEd,OAAO;YACH,MAAM,eAAe;YACrB,UAAU;;;QAGlB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,WAAW;QACP,MAAM,UAAU;QAChB,YAAY,CAAA;QAEZ,YAAY,CAAA;;MAEhB,aAAa;QACT,MAAM,YAAY;QAClB,YAAY;UACR,MAAM;YACF,MAAM,YAAY;;UAEtB,OAAO;YACH,MAAM,YAAY;;;QAG1B,YAAY,CAAC,UAAU,KAAK;;MAEhC,gBAAgB;QACZ,MAAM,eAAe;QACrB,YAAY;UACR,aAAa;YACT,MAAM,eAAe;YACrB,UAAU;;UAEd,kBAAkB;YACd,MAAM,eAAe;YACrB,cAAc;;UAElB,SAAS;YACL,MAAM,eAAe;YACrB,cAAc;;UAElB,UAAU;YACN,MAAM,eAAe;YACrB,UAAU;;UAEd,MAAM;YACF,MAAM,eAAe;YACrB,eAAe,aAAa;;;QAGpC,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,aAAa;QACT,MAAM,YAAY;QAClB,YAAY;UACR,MAAM;YACF,MAAM,YAAY;;UAEtB,OAAO;YACH,MAAM,YAAY;;;QAG1B,YAAY,CAAC,UAAU,KAAK;;MAEhC,WAAW;QACP,MAAM,UAAU;QAChB,YAAY;UACR,aAAa;YACT,MAAM,UAAU;YAChB,UAAU;;;QAGlB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,SAAS;QACL,MAAM,QAAQ;QACd,YAAY;UACR,SAAS;YACL,MAAM,QAAQ;YACd,cAAc,CAAA;;UAElB,YAAY;YACR,MAAM,QAAQ;YACd,cAAc,CAAA;;UAElB,YAAY;YACR,MAAM,QAAQ;YACd,cAAc;;UAElB,MAAM;YACF,MAAM,QAAQ;YACd,UAAU;;UAEd,OAAO;YACH,MAAM,QAAQ;YACd,cAAc,CAAA;;UAElB,OAAO;YACH,MAAM,QAAQ;YACd,cAAc,CAAA;;;QAGtB,YAAY,CAAA;;MAEhB,eAAe;QACX,MAAM,cAAc;QACpB,YAAY;UACR,MAAM;YACF,MAAM,cAAc;;;QAG5B,YAAY,CAAA;;MAEhB,OAAO;QACH,MAAM,MAAM;QACZ,YAAY;UACR,aAAa;YACT,MAAM,MAAM;YACZ,UAAU;;UAEd,UAAU;YACN,MAAM,MAAM;YACZ,cAAc,CAAA;;UAElB,gBAAgB;YACZ,MAAM,MAAM;YACZ,UAAU;;UAEd,WAAW;YACP,MAAM,MAAM;YACZ,UAAU;;;QAGlB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,cAAc;QACV,MAAM,aAAa;QACnB,YAAY;UACR,MAAM;YACF,MAAM,aAAa;;;QAG3B,YAAY,CAAC,aAAa,KAAK;;MAEnC,WAAW;QACP,MAAM,UAAU;QAChB,YAAY;UACR,MAAM;YACF,MAAM,UAAU;;UAEpB,UAAU;YACN,MAAM,UAAU;YAChB,UAAU;;UAEd,cAAc;YACV,MAAM,UAAU;YAChB,UAAU;;UAEd,MAAM;YACF,MAAM,UAAU;;UAEpB,WAAW;YACP,MAAM,UAAU;;UAEpB,YAAY;YACR,MAAM,UAAU;YAChB,cAAc,CAAA;;UAElB,YAAY;YACR,MAAM,UAAU;YAChB,eAAe,aAAa;YAC5B,UAAU;;;QAGlB,YAAY,CAAC,mBAAmB,KAAK;;MAEzC,uBAAuB;QACnB,MAAM,sBAAsB;QAC5B,YAAY;UACR,eAAe;YACX,MAAM,sBAAsB;YAC5B,UAAU;;UAEd,WAAW;YACP,MAAM,sBAAsB;YAC5B,cAAc,CAAA;;;QAGtB,YAAY,CAAA;;MAEhB,oBAAoB;QAChB,MAAM,mBAAmB;QACzB,YAAY;UACR,aAAa;YACT,MAAM,mBAAmB;YACzB,cAAc,CAAA;;;QAGtB,YAAY,CAAA;;MAEhB,WAAW;QACP,MAAM,UAAU;QAChB,YAAY;UACR,YAAY;YACR,MAAM,UAAU;YAChB,cAAc,CAAA;;UAElB,MAAM;YACF,MAAM,UAAU;;UAEpB,YAAY;YACR,MAAM,UAAU;YAChB,cAAc,CAAA;YACd,eAAe,aAAa;;;QAGpC,YAAY,CAAC,aAAa,KAAK;;MAEnC,SAAS;QACL,MAAM,QAAQ;QACd,YAAY;UACR,aAAa;YACT,MAAM,QAAQ;YACd,UAAU;;UAEd,WAAW;YACP,MAAM,QAAQ;YACd,UAAU;;UAEd,OAAO;YACH,MAAM,QAAQ;;;QAGtB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,eAAe;QACX,MAAM,cAAc;QACpB,YAAY;UACR,cAAc;YACV,MAAM,cAAc;YACpB,cAAc;;UAElB,WAAW;YACP,MAAM,cAAc;YACpB,eAAe,UAAU;YACzB,UAAU;;UAEd,OAAO;YACH,MAAM,cAAc;;;QAG5B,YAAY,CAAA;;MAEhB,cAAc;QACV,MAAM,aAAa;QACnB,YAAY;UACR,aAAa;YACT,MAAM,aAAa;YACnB,UAAU;;UAEd,WAAW;YACP,MAAM,aAAa;YACnB,UAAU;;UAEd,eAAe;YACX,MAAM,aAAa;YACnB,cAAc;YACd,UAAU;;UAEd,UAAU;YACN,MAAM,aAAa;;;QAG3B,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,UAAU;QACN,MAAM,SAAS;QACf,YAAY;UACR,OAAO;YACH,MAAM,SAAS;;;QAGvB,YAAY,CAAC,UAAU,KAAK;;MAEhC,eAAe;QACX,MAAM,cAAc;QACpB,YAAY;UACR,OAAO;YACH,MAAM,cAAc;;;QAG5B,YAAY,CAAC,aAAa,KAAK;;MAEnC,WAAW;QACP,MAAM,UAAU;QAChB,YAAY;UACR,MAAM;YACF,MAAM,UAAU;;;QAGxB,YAAY,CAAA;;MAEhB,oBAAoB;QAChB,MAAM,mBAAmB;QACzB,YAAY;UACR,WAAW;YACP,MAAM,mBAAmB;YACzB,eAAe,UAAU;;;QAGjC,YAAY,CAAC,UAAU,KAAK;;MAEhC,YAAY;QACR,MAAM,WAAW;QACjB,YAAY;UACR,UAAU;YACN,MAAM,WAAW;YACjB,UAAU;;UAEd,YAAY;YACR,MAAM,WAAW;;UAErB,OAAO;YACH,MAAM,WAAW;YACjB,cAAc;;UAElB,UAAU;YACN,MAAM,WAAW;YACjB,cAAc;;UAElB,cAAc;YACV,MAAM,WAAW;YACjB,UAAU;;UAEd,MAAM;YACF,MAAM,WAAW;;UAErB,YAAY;YACR,MAAM,WAAW;YACjB,cAAc,CAAA;;UAElB,YAAY;YACR,MAAM,WAAW;YACjB,eAAe,aAAa;YAC5B,UAAU;;;QAGlB,YAAY,CAAC,mBAAmB,KAAK;;MAEzC,eAAe;QACX,MAAM,cAAc;QACpB,YAAY;UACR,SAAS;YACL,MAAM,cAAc;YACpB,cAAc;;UAElB,eAAe;YACX,MAAM,cAAc;;;QAG5B,YAAY,CAAC,eAAe,KAAK;;MAErC,YAAY;QACR,MAAM,WAAW;QACjB,YAAY;UACR,aAAa;YACT,MAAM,WAAW;YACjB,UAAU;;UAEd,WAAW;YACP,MAAM,WAAW;YACjB,UAAU;;UAEd,eAAe;YACX,MAAM,WAAW;YACjB,cAAc;YACd,UAAU;;UAEd,OAAO;YACH,MAAM,WAAW;;;QAGzB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,YAAY;QACR,MAAM,WAAW;QACjB,YAAY;UACR,MAAM;YACF,MAAM,WAAW;;;QAGzB,YAAY,CAAA;;MAEhB,UAAU;QACN,MAAM,SAAS;QACf,YAAY;UACR,WAAW;YACP,MAAM,SAAS;YACf,cAAc,CAAA;;UAElB,aAAa;YACT,MAAM,SAAS;YACf,UAAU;;UAEd,WAAW;YACP,MAAM,SAAS;YACf,UAAU;;UAEd,MAAM;YACF,MAAM,SAAS;YACf,eAAe,aAAa;;;QAGpC,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,YAAY;QACR,MAAM,WAAW;QACjB,YAAY;UACR,eAAe;YACX,MAAM,WAAW;YACjB,UAAU;;UAEd,YAAY;YACR,MAAM,WAAW;YACjB,UAAU;;UAEd,SAAS;YACL,MAAM,WAAW;YACjB,eAAe,aAAa;YAC5B,UAAU;;;QAGlB,YAAY,CAAC,eAAe,KAAK;;MAErC,eAAe;QACX,MAAM,cAAc;QACpB,YAAY;UACR,OAAO;YACH,MAAM,cAAc;;;QAG5B,YAAY,CAAC,aAAa,KAAK;;MAEnC,sBAAsB;QAClB,MAAM,qBAAqB;QAC3B,YAAY;UACR,aAAa;YACT,MAAM,qBAAqB;YAC3B,UAAU;;UAEd,UAAU;YACN,MAAM,qBAAqB;YAC3B,cAAc,CAAA;;UAElB,WAAW;YACP,MAAM,qBAAqB;YAC3B,UAAU;;UAEd,eAAe;YACX,MAAM,qBAAqB;YAC3B,cAAc;YACd,UAAU;;;QAGlB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,iBAAiB;QACb,MAAM,gBAAgB;QACtB,YAAY;UACR,aAAa;YACT,MAAM,gBAAgB;YACtB,UAAU;;UAEd,WAAW;YACP,MAAM,gBAAgB;YACtB,UAAU;;UAEd,eAAe;YACX,MAAM,gBAAgB;YACtB,cAAc;YACd,UAAU;;;QAGlB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,eAAe;QACX,MAAM,cAAc;QACpB,YAAY;UACR,aAAa;YACT,MAAM,cAAc;YACpB,UAAU;;UAEd,UAAU;YACN,MAAM,cAAc;YACpB,cAAc,CAAA;;UAElB,WAAW;YACP,MAAM,cAAc;YACpB,UAAU;;UAEd,eAAe;YACX,MAAM,cAAc;YACpB,cAAc;YACd,UAAU;;;QAGlB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,cAAc;QACV,MAAM,aAAa;QACnB,YAAY;UACR,YAAY;YACR,MAAM,aAAa;;UAEvB,UAAU;YACN,MAAM,aAAa;YACnB,cAAc;;UAElB,QAAQ;YACJ,MAAM,aAAa;YACnB,cAAc;;UAElB,MAAM;YACF,MAAM,aAAa;;UAEvB,MAAM;YACF,MAAM,aAAa;YACnB,UAAU;;;QAGlB,YAAY,CAAC,aAAa,KAAK;;MAEnC,kBAAkB;QACd,MAAM,iBAAiB;QACvB,YAAY;UACR,aAAa;YACT,MAAM,iBAAiB;YACvB,UAAU;;UAEd,WAAW;YACP,MAAM,iBAAiB;YACvB,UAAU;;UAEd,eAAe;YACX,MAAM,iBAAiB;YACvB,cAAc;YACd,UAAU;;UAEd,MAAM;YACF,MAAM,iBAAiB;YACvB,eAAe,aAAa;;;QAGpC,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,MAAM;QACF,MAAM,KAAK;QACX,YAAY;UACR,MAAM;YACF,MAAM,KAAK;;UAEf,MAAM;YACF,MAAM,KAAK;;;QAGnB,YAAY,CAAC,aAAa,KAAK;;MAEnC,eAAe;QACX,MAAM,cAAc;QACpB,YAAY;UACR,cAAc;YACV,MAAM,cAAc;YACpB,UAAU;;UAEd,YAAY;YACR,MAAM,cAAc;YACpB,cAAc;;UAElB,MAAM;YACF,MAAM,cAAc;;UAExB,MAAM;YACF,MAAM,cAAc;;;QAG5B,YAAY,CAAA;;MAEhB,gBAAgB;QACZ,MAAM,eAAe;QACrB,YAAY,CAAA;QAEZ,YAAY,CAAA;;MAEhB,WAAW;QACP,MAAM,UAAU;QAChB,YAAY;UACR,OAAO;YACH,MAAM,UAAU;YAChB,cAAc,CAAA;;;QAGtB,YAAY,CAAC,eAAe,KAAK;;MAErC,gBAAgB;QACZ,MAAM,eAAe;QACrB,YAAY;UACR,aAAa;YACT,MAAM,eAAe;YACrB,UAAU;;UAEd,UAAU;YACN,MAAM,eAAe;YACrB,cAAc,CAAA;;;QAGtB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,YAAY;QACR,MAAM,WAAW;QACjB,YAAY;UACR,aAAa;YACT,MAAM,WAAW;YACjB,UAAU;;UAEd,WAAW;YACP,MAAM,WAAW;YACjB,UAAU;;UAEd,eAAe;YACX,MAAM,WAAW;YACjB,cAAc;YACd,UAAU;;UAEd,UAAU;YACN,MAAM,WAAW;;;QAGzB,YAAY,CAAC,gBAAgB,KAAK;;MAEtC,cAAc;QACV,MAAM,aAAa;QACnB,YAAY,CAAA;QAEZ,YAAY,CAAA;;MAEhB,UAAU;QACN,MAAM,SAAS;QACf,YAAY;UACR,aAAa;YACT,MAAM,SAAS;YACf,UAAU;;UAEd,WAAW;YACP,MAAM,SAAS;YACf,UAAU;;UAEd,eAAe;YACX,MAAM,SAAS;YACf,cAAc;YACd,UAAU;;;QAGlB,YAAY,CAAC,gBAAgB,KAAK;;;EAG9C;;AAEO,IAAM,aAAa,IAAI,4BAA2B;;;ACtwDzD;;;;;;;;;;;;;;;;;ACoQM,IAAO,aAAP,MAAO,YAAU;EAInB,YAAY,SAAkB,QAAkD;AAC5E,SAAK,UAAU;AACf,SAAK,SAAS;EAClB;EAEA,WAAQ;AACJ,UAAM,WAAW;MACb,OAAO,KAAK,QAAO;MACnB,MAAM,MAAM,KAAK,OAAO,SAAS,KAAK;MACtC,CAAC,OAAO,QAAQ,GAAG,MAAM;;AAE7B,WAAO;EACX;EAEA,CAAC,OAAO,QAAQ,IAAC;AACb,WAAO,KAAK,SAAQ;EACxB;EAEA,UAAO;AACH,UAAM,WAAW,KAAK,SAAQ;AAC9B,WAAO,QAAQ,SAAS,KAAI,EAAG,IAAI;EACvC;EAEA,QAAK;AACD,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,QAAQ;AACZ,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf;AACA,aAAO,SAAS,KAAI;IACxB;AACA,WAAO;EACX;EAEA,UAAO;AACH,UAAM,SAAc,CAAA;AACpB,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI;AACJ,OAAG;AACC,aAAO,SAAS,KAAI;AACpB,UAAI,KAAK,UAAU,QAAW;AAC1B,eAAO,KAAK,KAAK,KAAK;MAC1B;IACJ,SAAS,CAAC,KAAK;AACf,WAAO;EACX;EAEA,QAAK;AACD,WAAO,IAAI,IAAI,IAAI;EACvB;EAEA,MAAoB,OAAqB,SAAqB;AAC1D,UAAM,cAAc,KAAK,IAAI,aAAmB;MAC5C,QAAQ,MAAM,OAAO,IAAI;MACzB,UAAU,QAAQ,OAAO,IAAI;KAChC;AACD,WAAO,IAAI,IAAI,WAAW;EAC9B;EAEA,WAAQ;AACJ,WAAO,KAAK,KAAI;EACpB;EAEA,OAAW,OAAmB;AAC1B,WAAO,IAAI,YACP,OAAO,EAAE,OAAO,KAAK,QAAO,GAAI,WAAW,OAAO,UAAU,MAAM,OAAO,QAAQ,EAAC,EAAE,IACpF,WAAQ;AACJ,UAAI;AACJ,UAAI,CAAC,MAAM,WAAW;AAClB,WAAG;AACC,mBAAS,KAAK,OAAO,MAAM,KAAK;AAChC,cAAI,CAAC,OAAO,MAAM;AACd,mBAAO;UACX;QACJ,SAAS,CAAC,OAAO;AACjB,cAAM,YAAY;MACtB;AACA,SAAG;AACC,iBAAS,MAAM,SAAS,KAAI;AAC5B,YAAI,CAAC,OAAO,MAAM;AACd,iBAAO;QACX;MACJ,SAAS,CAAC,OAAO;AACjB,aAAO;IACX,CAAC;EAET;EAEA,KAAK,YAAY,KAAG;AAChB,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,QAAQ;AACZ,QAAI;AACJ,QAAI,eAAe;AACnB,OAAG;AACC,eAAS,SAAS,KAAI;AACtB,UAAI,CAAC,OAAO,MAAM;AACd,YAAI,cAAc;AACd,mBAAS;QACb;AACA,iBAAS,SAAS,OAAO,KAAK;MAClC;AACA,qBAAe;IACnB,SAAS,CAAC,OAAO;AACjB,WAAO;EACX;EAEA,QAAQ,eAAkB,YAAY,GAAC;AACnC,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,QAAQ;AACZ,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf,UAAI,SAAS,aAAa,KAAK,UAAU,eAAe;AACpD,eAAO;MACX;AACA,aAAO,SAAS,KAAI;AACpB;IACJ;AACA,WAAO;EACX;EAeA,MAAM,WAAgC;AAClC,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf,UAAI,CAAC,UAAU,KAAK,KAAK,GAAG;AACxB,eAAO;MACX;AACA,aAAO,SAAS,KAAI;IACxB;AACA,WAAO;EACX;EAEA,KAAK,WAAgC;AACjC,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf,UAAI,UAAU,KAAK,KAAK,GAAG;AACvB,eAAO;MACX;AACA,aAAO,SAAS,KAAI;IACxB;AACA,WAAO;EACX;EAEA,QAAQ,YAA6C;AACjD,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,QAAQ;AACZ,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf,iBAAW,KAAK,OAAO,KAAK;AAC5B,aAAO,SAAS,KAAI;AACpB;IACJ;EACJ;EAEA,IAAO,YAA2B;AAC9B,WAAO,IAAI,YACP,KAAK,SACL,CAAC,UAAS;AACN,YAAM,EAAE,MAAM,MAAK,IAAK,KAAK,OAAO,KAAK;AACzC,UAAI,MAAM;AACN,eAAO;MACX,OAAO;AACH,eAAO,EAAE,MAAM,OAAO,OAAO,WAAW,KAAK,EAAC;MAClD;IACJ,CAAC;EAET;EAKA,OAAO,WAAgC;AACnC,WAAO,IAAI,YACP,KAAK,SACL,WAAQ;AACJ,UAAI;AACJ,SAAG;AACC,iBAAS,KAAK,OAAO,KAAK;AAC1B,YAAI,CAAC,OAAO,QAAQ,UAAU,OAAO,KAAK,GAAG;AACzC,iBAAO;QACX;MACJ,SAAS,CAAC,OAAO;AACjB,aAAO;IACX,CAAC;EAET;EAEA,cAAW;AACP,WAAO,KAAK,OAAO,OAAK,MAAM,UAAa,MAAM,IAAI;EACzD;EAIA,OAAU,YAA0D,cAAgB;AAChF,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,gBAAmC;AACvC,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf,UAAI,kBAAkB,QAAW;AAC7B,wBAAgB,KAAK;MACzB,OAAO;AACH,wBAAgB,WAAW,eAAe,KAAK,KAAK;MACxD;AACA,aAAO,SAAS,KAAI;IACxB;AACA,WAAO;EACX;EAIA,YAAe,YAA0D,cAAgB;AACrF,WAAO,KAAK,gBAAgB,KAAK,SAAQ,GAAI,YAAY,YAAY;EACzE;EAEU,gBAAmB,UAAuB,YAA0D,cAAgB;AAC1H,UAAM,OAAO,SAAS,KAAI;AAC1B,QAAI,KAAK,MAAM;AACX,aAAO;IACX;AACA,UAAM,gBAAgB,KAAK,gBAAgB,UAAU,YAAY,YAAY;AAC7E,QAAI,kBAAkB,QAAW;AAC7B,aAAO,KAAK;IAChB;AACA,WAAO,WAAW,eAAe,KAAK,KAAK;EAC/C;EAIA,KAAK,WAAgC;AACjC,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf,UAAI,UAAU,KAAK,KAAK,GAAG;AACvB,eAAO,KAAK;MAChB;AACA,aAAO,SAAS,KAAI;IACxB;AACA,WAAO;EACX;EAEA,UAAU,WAAgC;AACtC,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,QAAQ;AACZ,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf,UAAI,UAAU,KAAK,KAAK,GAAG;AACvB,eAAO;MACX;AACA,aAAO,SAAS,KAAI;AACpB;IACJ;AACA,WAAO;EACX;EAEA,SAAS,eAAgB;AACrB,UAAM,WAAW,KAAK,SAAQ;AAC9B,QAAI,OAAO,SAAS,KAAI;AACxB,WAAO,CAAC,KAAK,MAAM;AACf,UAAI,KAAK,UAAU,eAAe;AAC9B,eAAO;MACX;AACA,aAAO,SAAS,KAAI;IACxB;AACA,WAAO;EACX;EAEA,QAAW,YAAyC;AAEhD,WAAO,IAAI,YACP,OAAO,EAAE,MAAM,KAAK,QAAO,EAAE,IAC7B,CAAC,UAAS;AACN,SAAG;AACC,YAAI,MAAM,UAAU;AAChB,gBAAM,OAAO,MAAM,SAAS,KAAI;AAChC,cAAI,KAAK,MAAM;AACX,kBAAM,WAAW;UACrB,OAAO;AACH,mBAAO;UACX;QACJ;AACA,cAAM,EAAE,MAAM,MAAK,IAAK,KAAK,OAAO,MAAM,IAAI;AAC9C,YAAI,CAAC,MAAM;AACP,gBAAM,SAAS,WAAW,KAAK;AAC/B,cAAI,WAAW,MAAM,GAAG;AACpB,kBAAM,WAAW,OAAO,OAAO,QAAQ,EAAC;UAC5C,OAAO;AACH,mBAAO,EAAE,MAAM,OAAO,OAAO,OAAM;UACvC;QACJ;MACJ,SAAS,MAAM;AACf,aAAO;IACX,CAAC;EAET;EAEA,KAA2B,OAAS;AAChC,QAAI,UAAU,QAAW;AACrB,cAAQ;IACZ;AACA,QAAI,SAAS,GAAG;AACZ,aAAO;IACX;AACA,UAAME,UAAS,QAAQ,IAAI,KAAK,KAAK,QAAQ,CAAC,IAAmC;AAEjF,WAAO,IAAI,YACP,OAAO,EAAE,MAAMA,QAAO,QAAO,EAAE,IAC/B,CAAC,UAAS;AACN,SAAG;AACC,YAAI,MAAM,UAAU;AAChB,gBAAM,OAAO,MAAM,SAAS,KAAI;AAChC,cAAI,KAAK,MAAM;AACX,kBAAM,WAAW;UACrB,OAAO;AACH,mBAAO;UACX;QACJ;AACA,cAAM,EAAE,MAAM,MAAK,IAAKA,QAAO,OAAO,MAAM,IAAI;AAChD,YAAI,CAAC,MAAM;AACP,cAAI,WAAW,KAAK,GAAG;AACnB,kBAAM,WAAW,MAAM,OAAO,QAAQ,EAAC;UAC3C,OAAO;AACH,mBAAO,EAAE,MAAM,OAAO,MAAY;UACtC;QACJ;MACJ,SAAS,MAAM;AACf,aAAO;IACX,CAAC;EAET;EAEA,OAAI;AACA,UAAM,WAAW,KAAK,SAAQ;AAC9B,UAAM,SAAS,SAAS,KAAI;AAC5B,QAAI,OAAO,MAAM;AACb,aAAO;IACX;AACA,WAAO,OAAO;EAClB;EAEA,KAAK,YAAY,GAAC;AACd,WAAO,IAAI,YACP,MAAK;AACD,YAAM,QAAQ,KAAK,QAAO;AAC1B,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,cAAM,OAAO,KAAK,OAAO,KAAK;AAC9B,YAAI,KAAK,MAAM;AACX,iBAAO;QACX;MACJ;AACA,aAAO;IACX,GACA,KAAK,MAAM;EAEnB;EAEA,MAAM,SAAe;AACjB,WAAO,IAAI,YACP,OAAO,EAAE,MAAM,GAAG,OAAO,KAAK,QAAO,EAAE,IACvC,WAAQ;AACJ,YAAM;AACN,UAAI,MAAM,OAAO,SAAS;AACtB,eAAO;MACX;AACA,aAAO,KAAK,OAAO,MAAM,KAAK;IAClC,CAAC;EAET;EAEA,SAAkB,IAAwB;AACtC,WAAO,IAAI,YACP,OAAO,EAAE,KAAK,oBAAI,IAAG,GAAa,eAAe,KAAK,QAAO,EAAE,IAC/D,WAAQ;AACJ,UAAI;AACJ,SAAG;AACC,iBAAS,KAAK,OAAO,MAAM,aAAa;AACxC,YAAI,CAAC,OAAO,MAAM;AACd,gBAAM,QAAQ,KAAK,GAAG,OAAO,KAAK,IAAI,OAAO;AAC7C,cAAI,CAAC,MAAM,IAAI,IAAI,KAAK,GAAG;AACvB,kBAAM,IAAI,IAAI,KAAK;AACnB,mBAAO;UACX;QACJ;MACJ,SAAS,CAAC,OAAO;AACjB,aAAO;IACX,CAAC;EAET;EAEA,QAAiB,OAAoB,KAAyB;AAC1D,UAAM,cAAc,oBAAI,IAAG;AAC3B,eAAW,QAAQ,OAAO;AACtB,YAAM,QAAQ,MAAM,IAAI,IAAI,IAAI;AAChC,kBAAY,IAAI,KAAK;IACzB;AACA,WAAO,KAAK,OAAO,OAAI;AACnB,YAAM,SAAS,MAAM,IAAI,CAAC,IAAI;AAC9B,aAAO,CAAC,YAAY,IAAI,MAAM;IAClC,CAAC;EACL;;AAGJ,SAAS,SAAS,MAAa;AAC3B,MAAI,OAAO,SAAS,UAAU;AAC1B,WAAO;EACX;AACA,MAAI,OAAO,SAAS,aAAa;AAC7B,WAAO;EACX;AAEA,MAAI,OAAQ,KAAa,aAAa,YAAY;AAE9C,WAAQ,KAAa,SAAQ;EACjC;AACA,SAAO,OAAO,UAAU,SAAS,KAAK,IAAI;AAC9C;AAEA,SAAS,WAAc,KAAY;AAC/B,SAAO,CAAC,CAAC,OAAO,OAAQ,IAAoB,OAAO,QAAQ,MAAM;AACrE;AAMO,IAAM,eAA4B,IAAI,WAA2B,MAAM,QAAW,MAAM,WAAW;AAKnG,IAAM,cAA+C,OAAO,OAAO,EAAE,MAAM,MAAM,OAAO,OAAS,CAAE;AAKpG,SAAU,UAAa,aAA8C;AACvE,MAAI,YAAY,WAAW,GAAG;AAC1B,UAAM,aAAa,YAAY,CAAC;AAChC,QAAI,sBAAsB,YAAY;AAClC,aAAO;IACX;AACA,QAAI,WAAW,UAAU,GAAG;AACxB,aAAO,IAAI,WACP,MAAM,WAAW,OAAO,QAAQ,EAAC,GACjC,CAAC,aAAa,SAAS,KAAI,CAAE;IAErC;AACA,QAAI,OAAO,WAAW,WAAW,UAAU;AACvC,aAAO,IAAI,WACP,OAAO,EAAE,OAAO,EAAC,IACjB,CAAC,UAAS;AACN,YAAI,MAAM,QAAQ,WAAW,QAAQ;AACjC,iBAAO,EAAE,MAAM,OAAO,OAAO,WAAW,MAAM,OAAO,EAAC;QAC1D,OAAO;AACH,iBAAO;QACX;MACJ,CAAC;IAET;EACJ;AACA,MAAI,YAAY,SAAS,GAAG;AAExB,WAAO,IAAI,WACP,OAAO,EAAE,WAAW,GAAG,UAAU,EAAC,IAClC,CAAC,UAAS;AACN,SAAG;AACC,YAAI,MAAM,UAAU;AAChB,gBAAM,OAAO,MAAM,SAAS,KAAI;AAChC,cAAI,CAAC,KAAK,MAAM;AACZ,mBAAO;UACX;AACA,gBAAM,WAAW;QACrB;AACA,YAAI,MAAM,OAAO;AACb,cAAI,MAAM,WAAW,MAAM,MAAM,QAAQ;AACrC,mBAAO,EAAE,MAAM,OAAO,OAAO,MAAM,MAAM,MAAM,UAAU,EAAC;UAC9D;AACA,gBAAM,QAAQ;AACd,gBAAM,WAAW;QACrB;AACA,YAAI,MAAM,YAAY,YAAY,QAAQ;AACtC,gBAAM,aAAa,YAAY,MAAM,WAAW;AAChD,cAAI,WAAW,UAAU,GAAG;AACxB,kBAAM,WAAW,WAAW,OAAO,QAAQ,EAAC;UAChD,WAAW,cAAc,OAAO,WAAW,WAAW,UAAU;AAC5D,kBAAM,QAAQ;UAClB;QACJ;MACJ,SAAS,MAAM,YAAY,MAAM,SAAS,MAAM,YAAY,YAAY;AACxE,aAAO;IACX,CAAC;EAET;AACA,SAAO;AACX;AAyBM,IAAO,iBAAP,cACM,WAAiE;EAGzE,YAAYC,OAAS,UAAoC,SAAmC;AACxF,UACI,OAAO;MACH,YAAW,mCAAS,eAAc,CAAC,CAACA,KAAI,EAAE,OAAO,QAAQ,EAAC,CAAE,IAAI,CAAC,SAASA,KAAI,EAAE,OAAO,QAAQ,EAAC,CAAE;MAClG,QAAQ;QAEZ,WAAQ;AACJ,UAAI,MAAM,QAAQ;AACd,cAAM,UAAU,IAAG;AACnB,cAAM,SAAS;MACnB;AACA,aAAO,MAAM,UAAU,SAAS,GAAG;AAC/B,cAAM,WAAW,MAAM,UAAU,MAAM,UAAU,SAAS,CAAC;AAC3D,cAAM,OAAO,SAAS,KAAI;AAC1B,YAAI,KAAK,MAAM;AACX,gBAAM,UAAU,IAAG;QACvB,OAAO;AACH,gBAAM,UAAU,KAAK,SAAS,KAAK,KAAK,EAAE,OAAO,QAAQ,EAAC,CAAE;AAC5D,iBAAO;QACX;MACJ;AACA,aAAO;IACX,CAAC;EAET;EAES,WAAQ;AACb,UAAM,WAAW;MACb,OAAO,KAAK,QAAO;MACnB,MAAM,MAAM,KAAK,OAAO,SAAS,KAAK;MACtC,OAAO,MAAK;AACR,iBAAS,MAAM,SAAS;MAC5B;MACA,CAAC,OAAO,QAAQ,GAAG,MAAM;;AAE7B,WAAO;EACX;;AAME,IAAW;CAAjB,SAAiBC,YAAS;AAKtB,WAAgB,IAAIF,SAAsB;AACtC,WAAOA,QAAO,OAAO,CAACG,IAAG,MAAMA,KAAI,GAAG,CAAC;EAC3C;AAFgB,EAAAD,WAAA,MAAG;AAOnB,WAAgB,QAAQF,SAAsB;AAC1C,WAAOA,QAAO,OAAO,CAACG,IAAG,MAAMA,KAAI,GAAG,CAAC;EAC3C;AAFgB,EAAAD,WAAA,UAAO;AAOvB,WAAgBE,KAAIJ,SAAsB;AACtC,WAAOA,QAAO,OAAO,CAACG,IAAG,MAAM,KAAK,IAAIA,IAAG,CAAC,CAAC;EACjD;AAFgB,EAAAD,WAAA,MAAGE;AAOnB,WAAgB,IAAIJ,SAAsB;AACtC,WAAOA,QAAO,OAAO,CAACG,IAAG,MAAM,KAAK,IAAIA,IAAG,CAAC,CAAC;EACjD;AAFgB,EAAAD,WAAA,MAAG;AAIvB,GA9BiB,cAAA,YAAS,CAAA,EAAA;;;AC10B1B;;;;;;;;;;;;;;;;;;;;;;AAsBM,SAAU,gBAAgB,SAAgB;AAC5C,MAAI,UAA+B;AACnC,MAAI,QAAQ;AACZ,SAAO,SAAS;AACZ,UAAM,eAAe,mBAAmB,QAAQ,eAAe,YAAY;AAC3E,QAAI,gBAAgB,aAAa,UAAU;AAEvC,gBAAU,QAAQ;AAClB,cAAQ;IACZ,WAAW,OAAO;AAEd,aAAO;IACX,OAAO;AAEH,aAAO;IACX;EACJ;AACA,SAAO;AACX;AAMM,SAAU,UAAU,MAAa;AACnC,SAAO,IAAI,eAAe,MAAM,aAAU;AACtC,QAAI,mBAAmB,OAAO,GAAG;AAC7B,aAAO,QAAQ;IACnB,OAAO;AACH,aAAO,CAAA;IACX;EACJ,GAAG,EAAE,aAAa,KAAI,CAAE;AAC5B;AAKM,SAAU,WAAW,MAAa;AACpC,SAAO,UAAU,IAAI,EAAE,OAAO,aAAa;AAC/C;AAKM,SAAU,YAAY,OAAgB,QAAe;AACvD,SAAO,MAAM,WAAW;AACpB,YAAQ,MAAM;AACd,QAAI,UAAU,QAAQ;AAClB,aAAO;IACX;EACJ;AACA,SAAO;AACX;AAEM,SAAU,aAAa,OAAa;AAGtC,SAAO;IACH,OAAO;MACH,WAAW,MAAM,cAAe;MAChC,MAAM,MAAM,YAAa;;IAE7B,KAAK;MACD,WAAW,MAAM;;MACjB,MAAM,MAAM,UAAW;;;AAGnC;AAIM,SAAU,kBAAkB,MAAc;AAC5C,MAAI,CAAC,MAAM;AACP,WAAO;EACX;AACA,QAAM,EAAE,QAAQ,KAAK,MAAK,IAAK;AAC/B,SAAO;IACH;IACA;IACA;IACA,QAAQ,MAAM;;AAEtB;AAEA,IAAY;CAAZ,SAAYG,kBAAe;AACvB,EAAAA,iBAAAA,iBAAA,QAAA,IAAA,CAAA,IAAA;AACA,EAAAA,iBAAAA,iBAAA,OAAA,IAAA,CAAA,IAAA;AACA,EAAAA,iBAAAA,iBAAA,cAAA,IAAA,CAAA,IAAA;AACA,EAAAA,iBAAAA,iBAAA,aAAA,IAAA,CAAA,IAAA;AACA,EAAAA,iBAAAA,iBAAA,QAAA,IAAA,CAAA,IAAA;AACA,EAAAA,iBAAAA,iBAAA,SAAA,IAAA,CAAA,IAAA;AACJ,GAPY,oBAAA,kBAAe,CAAA,EAAA;AASrB,SAAU,aAAa,OAAc,IAAS;AAChD,MAAI,MAAM,IAAI,OAAO,GAAG,MAAM,QAAS,MAAM,IAAI,SAAS,GAAG,MAAM,QAAQ,MAAM,IAAI,aAAa,GAAG,MAAM,WAAY;AACnH,WAAO,gBAAgB;EAC3B,WAAW,MAAM,MAAM,OAAO,GAAG,IAAI,QAAS,MAAM,MAAM,SAAS,GAAG,IAAI,QAAQ,MAAM,MAAM,aAAa,GAAG,IAAI,WAAY;AAC1H,WAAO,gBAAgB;EAC3B;AACA,QAAM,cAAc,MAAM,MAAM,OAAO,GAAG,MAAM,QAAS,MAAM,MAAM,SAAS,GAAG,MAAM,QAAQ,MAAM,MAAM,aAAa,GAAG,MAAM;AACjI,QAAM,YAAY,MAAM,IAAI,OAAO,GAAG,IAAI,QAAS,MAAM,IAAI,SAAS,GAAG,IAAI,QAAQ,MAAM,IAAI,aAAa,GAAG,IAAI;AACnH,MAAI,eAAe,WAAW;AAC1B,WAAO,gBAAgB;EAC3B,WAAW,aAAa;AACpB,WAAO,gBAAgB;EAC3B,WAAW,WAAW;AAClB,WAAO,gBAAgB;EAC3B,OAAO;AACH,WAAO,gBAAgB;EAC3B;AACJ;AAEM,SAAU,QAAQ,OAAc,IAAS;AAC3C,QAAM,aAAa,aAAa,OAAO,EAAE;AACzC,SAAO,aAAa,gBAAgB;AACxC;AAIO,IAAM,oBAAoB;AAQ3B,SAAU,4BAA4B,SAA8B,QAAgB,aAAa,mBAAiB;AACpH,MAAI,SAAS;AACT,QAAI,SAAS,GAAG;AACZ,YAAM,cAAc,SAAS,QAAQ;AACrC,YAAM,eAAe,QAAQ,KAAK,OAAO,WAAW;AACpD,UAAI,CAAC,WAAW,KAAK,YAAY,GAAG;AAChC;MACJ;IACJ;AACA,WAAO,qBAAqB,SAAS,MAAM;EAC/C;AACA,SAAO;AACX;AAEM,SAAU,gBAAgB,SAA8B,cAAsB;AAChF,MAAI,SAAS;AACT,UAAM,WAAW,gBAAgB,SAAS,IAAI;AAC9C,QAAI,YAAY,cAAc,UAAU,YAAY,GAAG;AACnD,aAAO;IACX;AACA,QAAI,cAAc,OAAO,GAAG;AAGxB,YAAM,WAAW,QAAQ,QAAQ,UAAU,OAAK,CAAC,EAAE,MAAM;AACzD,eAAS,IAAI,WAAW,GAAG,KAAK,GAAG,KAAK;AACpC,cAAM,QAAQ,QAAQ,QAAQ,CAAC;AAC/B,YAAI,cAAc,OAAO,YAAY,GAAG;AACpC,iBAAO;QACX;MACJ;IACJ;EACJ;AACA,SAAO;AACX;AAEM,SAAU,cAAc,SAAkB,cAAsB;AAClE,SAAO,cAAc,OAAO,KAAK,aAAa,SAAS,QAAQ,UAAU,IAAI;AACjF;AAYM,SAAU,qBAAqB,MAAe,QAAc;AAC9D,MAAI,cAAc,IAAI,GAAG;AACrB,WAAO;EACX,WAAW,mBAAmB,IAAI,GAAG;AACjC,UAAM,eAAe,aAAa,MAAM,QAAQ,KAAK;AACrD,QAAI,cAAc;AACd,aAAO,qBAAqB,cAAc,MAAM;IACpD;EACJ;AACA,SAAO;AACX;AAYM,SAAU,yBAAyB,MAAe,QAAc;AAClE,MAAI,cAAc,IAAI,GAAG;AACrB,WAAO;EACX,WAAW,mBAAmB,IAAI,GAAG;AACjC,UAAM,eAAe,aAAa,MAAM,QAAQ,IAAI;AACpD,QAAI,cAAc;AACd,aAAO,yBAAyB,cAAc,MAAM;IACxD;EACJ;AACA,SAAO;AACX;AAEA,SAAS,aAAa,MAAwB,QAAgB,SAAgB;AAC1E,MAAI,OAAO;AACX,MAAI,QAAQ,KAAK,QAAQ,SAAS;AAClC,MAAI,cAAmC;AAEvC,SAAO,QAAQ,OAAO;AAClB,UAAM,SAAS,KAAK,OAAO,OAAO,SAAS,CAAC;AAC5C,UAAM,aAAa,KAAK,QAAQ,MAAM;AAEtC,QAAI,WAAW,UAAU,UAAU,WAAW,MAAM,QAAQ;AAExD,aAAO;IACX;AAEA,QAAI,WAAW,OAAO,QAAQ;AAE1B,oBAAc,UAAU,aAAa;AACrC,aAAO,SAAS;IACpB,OAAO;AAEH,cAAQ,SAAS;IACrB;EACJ;AAEA,SAAO;AACX;AAEM,SAAU,gBAAgB,MAAe,SAAS,MAAI;AACxD,SAAO,KAAK,WAAW;AACnB,UAAM,SAAS,KAAK;AACpB,QAAI,QAAQ,OAAO,QAAQ,QAAQ,IAAI;AACvC,WAAO,QAAQ,GAAG;AACd;AACA,YAAM,WAAW,OAAO,QAAQ,KAAK;AACrC,UAAI,UAAU,CAAC,SAAS,QAAQ;AAC5B,eAAO;MACX;IACJ;AACA,WAAO;EACX;AACA,SAAO;AACX;AAEM,SAAU,YAAY,MAAe,SAAS,MAAI;AACpD,SAAO,KAAK,WAAW;AACnB,UAAM,SAAS,KAAK;AACpB,QAAI,QAAQ,OAAO,QAAQ,QAAQ,IAAI;AACvC,UAAM,OAAO,OAAO,QAAQ,SAAS;AACrC,WAAO,QAAQ,MAAM;AACjB;AACA,YAAM,OAAO,OAAO,QAAQ,KAAK;AACjC,UAAI,UAAU,CAAC,KAAK,QAAQ;AACxB,eAAO;MACX;IACJ;AACA,WAAO;EACX;AACA,SAAO;AACX;AAEM,SAAU,iBAAiB,MAAa;AAC1C,MAAI,KAAK,MAAM,MAAM,cAAc,GAAG;AAClC,WAAO;EACX;AACA,QAAM,OAAO,KAAK,MAAM,MAAM;AAC9B,MAAI,OAAO;AACX,MAAI;AACJ,SAAO,KAAK,WAAW;AACnB,UAAM,SAAS,KAAK;AACpB,UAAM,YAAY,wBAAS,OAAO,QAAQ,QAAQ,IAAI;AACtD,QAAI,cAAc,GAAG;AACjB,aAAO;AACP,cAAQ;IACZ,OAAO;AACH,cAAQ,YAAY;AACpB,aAAO,OAAO,QAAQ,KAAK;IAC/B;AACA,QAAI,KAAK,MAAM,MAAM,SAAS,MAAM;AAChC;IACJ;AACA,WAAO;EACX;AACA,SAAO;AACX;AAEM,SAAU,iBAAiB,OAAgB,KAAY;AACzD,QAAM,eAAe,gBAAgB,OAAO,GAAG;AAC/C,MAAI,CAAC,cAAc;AACf,WAAO,CAAA;EACX;AACA,SAAO,aAAa,OAAO,QAAQ,MAAM,aAAa,IAAI,GAAG,aAAa,CAAC;AAC/E;AAEA,SAAS,gBAAgBC,IAAY,GAAU;AAC3C,QAAM,WAAW,eAAeA,EAAC;AACjC,QAAM,WAAW,eAAe,CAAC;AACjC,MAAI;AACJ,WAAS,IAAI,GAAG,IAAI,SAAS,UAAU,IAAI,SAAS,QAAQ,KAAK;AAC7D,UAAM,UAAU,SAAS,CAAC;AAC1B,UAAM,UAAU,SAAS,CAAC;AAC1B,QAAI,QAAQ,WAAW,QAAQ,QAAQ;AACnC,gBAAU;QACN,QAAQ,QAAQ;QAChB,GAAG,QAAQ;QACX,GAAG,QAAQ;;IAEnB,OAAO;AACH;IACJ;EACJ;AACA,SAAO;AACX;AAQA,SAAS,eAAe,MAAa;AACjC,QAAM,QAAsB,CAAA;AAC5B,SAAO,KAAK,WAAW;AACnB,UAAM,SAAS,KAAK;AACpB,UAAM,QAAQ,OAAO,QAAQ,QAAQ,IAAI;AACzC,UAAM,KAAK;MACP;MACA;KACH;AACD,WAAO;EACX;AACA,SAAO,MAAM,QAAO;AACxB;;;AFzVM,SAAU,uBAAuB,MAAe,UAMlD,CAAA,GAAE;AACF,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC9C,QAAI,CAAC,KAAK,WAAW,GAAG,GAAG;AACvB,UAAI,MAAM,QAAQ,KAAK,GAAG;AACtB,cAAM,QAAQ,CAAC,MAAM,UAAS;AAC1B,cAAI,UAAU,IAAI,GAAG;AAChB,iBAA0B,aAAa;AACvC,iBAA0B,qBAAqB;AAC/C,iBAA0B,kBAAkB;AAC7C,gBAAI,QAAQ,MAAM;AACd,qCAAuB,MAAM,OAAO;YACxC;UACJ;QACJ,CAAC;MACL,WAAW,UAAU,KAAK,GAAG;AACxB,cAA2B,aAAa;AACxC,cAA2B,qBAAqB;AACjD,YAAI,QAAQ,MAAM;AACd,iCAAuB,OAAO,OAAO;QACzC;MACJ;IACJ;EACJ;AACJ;AAOM,SAAU,mBAAsC,MAA2B,eAAqC;AAClH,MAAI,OAAO;AACX,SAAO,MAAM;AACT,QAAI,cAAc,IAAI,GAAG;AACrB,aAAO;IACX;AACA,WAAO,KAAK;EAChB;AACA,SAAO;AACX;AAMM,SAAU,mBAAmB,MAA2B,WAAkC;AAC5F,MAAI,OAAO;AACX,SAAO,MAAM;AACT,QAAI,UAAU,IAAI,GAAG;AACjB,aAAO;IACX;AACA,WAAO,KAAK;EAChB;AACA,SAAO;AACX;AAQM,SAAU,YAAyC,MAAa;AAClE,QAAM,WAAW,aAAa,IAAI;AAClC,QAAM,SAAS,SAAS;AACxB,MAAI,CAAC,QAAQ;AACT,UAAM,IAAI,MAAM,2BAA2B;EAC/C;AACA,SAAO;AACX;AAKM,SAAU,aAAa,MAAa;AACtC,SAAO,KAAK,YAAY;AACpB,WAAO,KAAK;EAChB;AACA,SAAO;AACX;AAKM,SAAU,kBAAkB,WAAqC;AACnE,MAAI,YAAY,SAAS,GAAG;AACxB,WAAO,UAAU,MAAM,CAAC,UAAU,GAAG,IAAI,CAAA;EAC7C,WAAW,iBAAiB,SAAS,GAAG;AACpC,WAAO,UAAU,MAAM,IAAI,UAAQ,KAAK,GAAG;EAC/C;AACA,SAAO,CAAA;AACX;AAaM,SAAU,eAAe,MAAe,SAA0B;AACpE,MAAI,CAAC,MAAM;AACP,UAAM,IAAI,MAAM,0BAA0B;EAC9C;AACA,QAAM,QAAQ,mCAAS;AAEvB,SAAO,IAAI,WAA2B,OAAO;IACzC,MAAM,OAAO,KAAK,IAAI;IACtB,UAAU;IACV,YAAY;MACZ,WAAQ;AACR,WAAO,MAAM,WAAW,MAAM,KAAK,QAAQ;AACvC,YAAMC,YAAW,MAAM,KAAK,MAAM,QAAQ;AAC1C,UAAI,CAACA,UAAS,WAAW,GAAG,GAAG;AAC3B,cAAM,QAAS,KAAwBA,SAAQ;AAC/C,YAAI,UAAU,KAAK,GAAG;AAClB,gBAAM;AACN,cAAI,iBAAiB,OAAO,KAAK,GAAG;AAChC,mBAAO,EAAE,MAAM,OAAO,MAAK;UAC/B;QACJ,WAAW,MAAM,QAAQ,KAAK,GAAG;AAC7B,iBAAO,MAAM,aAAa,MAAM,QAAQ;AACpC,kBAAM,QAAQ,MAAM;AACpB,kBAAM,UAAU,MAAM,KAAK;AAC3B,gBAAI,UAAU,OAAO,KAAK,iBAAiB,SAAS,KAAK,GAAG;AACxD,qBAAO,EAAE,MAAM,OAAO,OAAO,QAAO;YACxC;UACJ;AACA,gBAAM,aAAa;QACvB;MACJ;AACA,YAAM;IACV;AACA,WAAO;EACX,CAAC;AACL;AAMM,SAAU,kBAAkBC,OAAe,SAA0B;AACvE,MAAI,CAACA,OAAM;AACP,UAAM,IAAI,MAAM,+BAA+B;EACnD;AACA,SAAO,IAAI,eAAeA,OAAM,UAAQ,eAAe,MAAM,OAAO,CAAC;AACzE;AAMM,SAAU,UAAUA,OAAe,SAA0B;AAC/D,MAAI,CAACA,OAAM;AACP,UAAM,IAAI,MAAM,+BAA+B;EACnD,YAAW,mCAAS,UAAS,CAAC,iBAAiBA,OAAM,QAAQ,KAAK,GAAG;AAEjE,WAAO,IAAI,eAAeA,OAAM,MAAM,CAAA,CAAE;EAC5C;AACA,SAAO,IAAI,eAAeA,OAAM,UAAQ,eAAe,MAAM,OAAO,GAAG,EAAE,aAAa,KAAI,CAAE;AAChG;AAEA,SAAS,iBAAiB,SAAkB,OAAa;AA9LzD;AA+LI,MAAI,CAAC,OAAO;AACR,WAAO;EACX;AACA,QAAM,aAAY,aAAQ,aAAR,mBAAkB;AACpC,MAAI,CAAC,WAAW;AACZ,WAAO;EACX;AACA,SAAO,QAAQ,WAAW,KAAK;AACnC;AAMM,SAAU,iBAAiB,MAAa;AAE1C,SAAO,IAAI,WAAiC,OAAO;IAC/C,MAAM,OAAO,KAAK,IAAI;IACtB,UAAU;IACV,YAAY;MACZ,WAAQ;AACR,WAAO,MAAM,WAAW,MAAM,KAAK,QAAQ;AACvC,YAAMD,YAAW,MAAM,KAAK,MAAM,QAAQ;AAC1C,UAAI,CAACA,UAAS,WAAW,GAAG,GAAG;AAC3B,cAAM,QAAS,KAAwBA,SAAQ;AAC/C,YAAI,YAAY,KAAK,KAAK,iBAAiB,KAAK,GAAG;AAC/C,gBAAM;AACN,iBAAO,EAAE,MAAM,OAAO,OAAO,EAAE,WAAW,OAAO,WAAW,MAAM,UAAAA,UAAQ,EAAE;QAChF,WAAW,MAAM,QAAQ,KAAK,GAAG;AAC7B,iBAAO,MAAM,aAAa,MAAM,QAAQ;AACpC,kBAAM,QAAQ,MAAM;AACpB,kBAAM,UAAU,MAAM,KAAK;AAC3B,gBAAI,YAAY,OAAO,KAAK,iBAAiB,KAAK,GAAG;AACjD,qBAAO,EAAE,MAAM,OAAO,OAAO,EAAE,WAAW,SAAS,WAAW,MAAM,UAAAA,WAAU,MAAK,EAAE;YACzF;UACJ;AACA,gBAAM,aAAa;QACvB;MACJ;AACA,YAAM;IACV;AACA,WAAO;EACX,CAAC;AACL;AAQM,SAAU,0BAA0BE,aAA2B,MAAa;AAC9E,QAAM,eAAeA,YAAW,gBAAgB,KAAK,KAAK;AAC1D,QAAM,cAAc;AACpB,aAAWF,aAAY,OAAO,OAAO,aAAa,UAAU,GAAG;AAE3D,QAAIA,UAAS,iBAAiB,UAAa,YAAYA,UAAS,IAAI,MAAM,QAAW;AACjF,kBAAYA,UAAS,IAAI,IAAI,iBAAiBA,UAAS,YAAY;IACvE;EACJ;AACJ;AAEA,SAAS,iBAAiB,cAA0B;AAChD,MAAI,MAAM,QAAQ,YAAY,GAAG;AAC7B,WAAO,CAAC,GAAG,aAAa,IAAI,gBAAgB,CAAC;EACjD,OAAO;AACH,WAAO;EACX;AACJ;AAUM,SAAU,YAAyC,MAAS,gBAA2J,OAA6B;AACtP,QAAM,OAAuB,EAAE,OAAO,KAAK,MAAK;AAEhD,MAAI,OAAO;AACP,UAAM,IAAI,MAAM,IAAI;AACpB,UAAM,IAAI,MAAM,IAAI;EACxB;AAEA,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC9C,QAAI,CAAC,KAAK,WAAW,GAAG,GAAG;AACvB,UAAI,UAAU,KAAK,GAAG;AAClB,aAAK,IAAI,IAAI,YAAY,OAAO,gBAAgB,KAAK;MACzD,WAAW,YAAY,KAAK,GAAG;AAC3B,aAAK,IAAI,IAAI,eACT,MACA,MACA,MAAM,UACN,MAAM,UACN,KAAK;MAEb,WAAW,MAAM,QAAQ,KAAK,GAAG;AAC7B,cAAM,cAAyB,CAAA;AAC/B,mBAAW,WAAW,OAAO;AACzB,cAAI,UAAU,OAAO,GAAG;AACpB,wBAAY,KAAK,YAAY,SAAS,gBAAgB,KAAK,CAAC;UAChE,WAAW,YAAY,OAAO,GAAG;AAC7B,wBAAY,KACR,eACI,MACA,MACA,QAAQ,UACR,QAAQ,UACR,OAAO,CACV;UAET,OAAO;AACH,wBAAY,KAAK,OAAO;UAC5B;QACJ;AACA,aAAK,IAAI,IAAI;MACjB,OAAO;AACH,aAAK,IAAI,IAAI;MACjB;IACJ;EACJ;AAEA,yBAAuB,MAAM,EAAE,MAAM,KAAI,CAAE;AAC3C,SAAO;AACX;;;AGrTM,IAAO,oBAAP,cAAiC,MAAK;EACxC,YAAY,MAA2B,SAAe;AAClD,UAAM,OAAO,GAAG,OAAO,OAAO,KAAK,MAAM,MAAM,IAAI,IAAI,KAAK,MAAM,MAAM,SAAS,KAAK,OAAO;EACjG;;AAGE,SAAU,kBAAkBG,IAAU,UAAU,gCAA8B;AAChF,QAAM,IAAI,MAAM,OAAO;AAC3B;;;ACdM,SAAU,GAAG,MAAY;AAC7B,SAAO,KAAK,WAAW,CAAC;AAC1B;AAEM,SAAU,YAAe,MAAe,KAAQ;AACpD,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,SAAK,QAAQ,SAAU,SAAO;AAC5B,UAAI,KAAK,OAAO;IAClB,CAAC;EACH,OAAO;AACL,QAAI,KAAK,IAAI;EACf;AACF;AAEM,SAAU,QACd,SACA,SAAkD;AAElD,MAAI,QAAQ,OAAO,MAAM,MAAM;AAC7B,UAAM,oBAAoB;EAC5B;AAEA,QAAM,IAAa,QAAQ,OAAO;AAClC,UAAQ,OAAO,IAAI;AACrB;AAEM,SAAU,cAA0B,KAAQ;AAEhD,MAAI,QAAQ,QAAW;AACrB,UAAM,MAAM,yCAAyC;EACvD;AACA,SAAO;AACT;AAGM,SAAU,0BAAuB;AACrC,QAAM,MAAM,yCAAyC;AACvD;AAEM,SAAU,YAAY,KAAqB;AAC/C,SAAO,IAAI,MAAM,MAAM;AACzB;;;ACzCO,IAAM,kBAA4B,CAAA;AACzC,SAAS,IAAI,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK;AACvC,kBAAgB,KAAK,CAAC;AACxB;AAEO,IAAM,gBAA0B,CAAC,GAAG,GAAG,CAAC,EAAE,OAAO,eAAe;AACvE,SAAS,IAAI,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK;AACvC,gBAAc,KAAK,CAAC;AACtB;AAEA,SAAS,IAAI,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK;AACvC,gBAAc,KAAK,CAAC;AACtB;AAGO,IAAM,kBAA4B;EACvC,GAAG,GAAG;EACN,GAAG,IAAI;EACP,GAAG,IAAI;EACP,GAAG,IAAI;EACP,GAAG,GAAI;EACP,GAAG,IAAI;EACP,GAAG,GAAI;EACP,GAAG,MAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;EACX,GAAG,QAAQ;;;;ACZb,IAAM,kBAAkB;AACxB,IAAM,iBAAiB;AACvB,IAAM,uBAAuB;AAIvB,IAAO,eAAP,MAAmB;EAAzB,cAAA;AACY,SAAA,MAAc;AACd,SAAA,QAAgB;AAChB,SAAA,WAAmB;EAizB/B;EA/yBY,YAAS;AACjB,WAAO;MACL,KAAK,KAAK;MACV,OAAO,KAAK;MACZ,UAAU,KAAK;;EAEnB;EAEU,aAAaC,WAItB;AACC,SAAK,MAAMA,UAAS;AACpB,SAAK,QAAQA,UAAS;AACtB,SAAK,WAAWA,UAAS;EAC3B;EAEO,QAAQ,OAAa;AAE1B,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,WAAW;AAEhB,SAAK,YAAY,GAAG;AACpB,UAAM,QAAQ,KAAK,YAAW;AAC9B,SAAK,YAAY,GAAG;AAEpB,UAAM,QAAqB;MACzB,MAAM;MACN,KAAK,EAAE,OAAO,KAAK,KAAK,KAAK,MAAM,OAAM;MACzC,QAAQ;MACR,YAAY;MACZ,WAAW;MACX,SAAS;MACT,QAAQ;;AAGV,WAAO,KAAK,aAAY,GAAI;AAC1B,cAAQ,KAAK,QAAO,GAAI;QACtB,KAAK;AACH,kBAAQ,OAAO,QAAQ;AACvB;QACF,KAAK;AACH,kBAAQ,OAAO,YAAY;AAC3B;QACF,KAAK;AACH,kBAAQ,OAAO,WAAW;AAC1B;QACF,KAAK;AACH,kBAAQ,OAAO,SAAS;AACxB;QACF,KAAK;AACH,kBAAQ,OAAO,QAAQ;AACvB;MACJ;IACF;AAEA,QAAI,KAAK,QAAQ,KAAK,MAAM,QAAQ;AAClC,YAAM,MAAM,sBAAsB,KAAK,MAAM,UAAU,KAAK,GAAG,CAAC;IAClE;AACA,WAAO;MACL,MAAM;MACN;MACA;MACA,KAAK,KAAK,IAAI,CAAC;;EAEnB;EAEU,cAAW;AACnB,UAAM,OAAO,CAAA;AACb,UAAM,QAAQ,KAAK;AAEnB,SAAK,KAAK,KAAK,YAAW,CAAE;AAE5B,WAAO,KAAK,SAAQ,MAAO,KAAK;AAC9B,WAAK,YAAY,GAAG;AACpB,WAAK,KAAK,KAAK,YAAW,CAAE;IAC9B;AAEA,WAAO,EAAE,MAAM,eAAe,OAAO,MAAM,KAAK,KAAK,IAAI,KAAK,EAAC;EACjE;EAEU,cAAW;AACnB,UAAM,QAAQ,CAAA;AACd,UAAM,QAAQ,KAAK;AAEnB,WAAO,KAAK,OAAM,GAAI;AACpB,YAAM,KAAK,KAAK,KAAI,CAAE;IACxB;AAEA,WAAO,EAAE,MAAM,eAAe,OAAO,OAAO,KAAK,KAAK,IAAI,KAAK,EAAC;EAClE;EAEU,OAAI;AACZ,QAAI,KAAK,YAAW,GAAI;AACtB,aAAO,KAAK,UAAS;IACvB,OAAO;AACL,aAAO,KAAK,KAAI;IAClB;EACF;EAEU,YAAS;AACjB,UAAM,QAAQ,KAAK;AACnB,YAAQ,KAAK,QAAO,GAAI;MACtB,KAAK;AACH,eAAO;UACL,MAAM;UACN,KAAK,KAAK,IAAI,KAAK;;MAEvB,KAAK;AACH,eAAO,EAAE,MAAM,aAAa,KAAK,KAAK,IAAI,KAAK,EAAC;;MAElD,KAAK;AACH,gBAAQ,KAAK,QAAO,GAAI;UACtB,KAAK;AACH,mBAAO;cACL,MAAM;cACN,KAAK,KAAK,IAAI,KAAK;;UAEvB,KAAK;AACH,mBAAO;cACL,MAAM;cACN,KAAK,KAAK,IAAI,KAAK;;QAEzB;AAEA,cAAM,MAAM,0BAA0B;;MAExC,KAAK;AACH,aAAK,YAAY,GAAG;AAEpB,YAAI;AAMJ,gBAAQ,KAAK,QAAO,GAAI;UACtB,KAAK;AACH,mBAAO;AACP;UACF,KAAK;AACH,mBAAO;AACP;UACF,KAAK,KAAK;AACR,oBAAQ,KAAK,QAAO,GAAI;cACtB,KAAK;AACH,uBAAO;AACP;cACF,KAAK;AACH,uBAAO;YACX;AACA;UACF;QACF;AACA,sBAAc,IAAI;AAElB,cAAM,cAAc,KAAK,YAAW;AAEpC,aAAK,YAAY,GAAG;AAEpB,eAAO;UACL;UACA,OAAO;UACP,KAAK,KAAK,IAAI,KAAK;;IAEzB;AAEA,WAAO,wBAAuB;EAChC;EAEU,WACR,iBAA0B,OAAK;AAE/B,QAAI,QAAyC;AAC7C,UAAM,QAAQ,KAAK;AACnB,YAAQ,KAAK,QAAO,GAAI;MACtB,KAAK;AACH,gBAAQ;UACN,SAAS;UACT,QAAQ;;AAEV;MACF,KAAK;AACH,gBAAQ;UACN,SAAS;UACT,QAAQ;;AAEV;MACF,KAAK;AACH,gBAAQ;UACN,SAAS;UACT,QAAQ;;AAEV;MACF,KAAK;AACH,cAAM,UAAU,KAAK,qBAAoB;AACzC,gBAAQ,KAAK,QAAO,GAAI;UACtB,KAAK;AACH,oBAAQ;cACN;cACA,QAAQ;;AAEV;UACF,KAAK;AACH,gBAAI;AACJ,gBAAI,KAAK,QAAO,GAAI;AAClB,uBAAS,KAAK,qBAAoB;AAClC,sBAAQ;gBACN;gBACA;;YAEJ,OAAO;AACL,sBAAQ;gBACN;gBACA,QAAQ;;YAEZ;AACA,iBAAK,YAAY,GAAG;AACpB;QACJ;AAGA,YAAI,mBAAmB,QAAQ,UAAU,QAAW;AAClD,iBAAO;QACT;AACA,sBAAc,KAAK;AACnB;IACJ;AAIA,QAAI,mBAAmB,QAAQ,UAAU,QAAW;AAClD,aAAO;IACT;AAGA,QAAI,cAAc,KAAK,GAAG;AACxB,UAAI,KAAK,SAAS,CAAC,MAAM,KAAK;AAC5B,aAAK,YAAY,GAAG;AACpB,cAAM,SAAS;MACjB,OAAO;AACL,cAAM,SAAS;MACjB;AAEA,YAAM,OAAO;AACb,YAAM,MAAM,KAAK,IAAI,KAAK;AAC1B,aAAO;IACT;EACF;EAEU,OAAI;AACZ,QAAIC;AACJ,UAAM,QAAQ,KAAK;AACnB,YAAQ,KAAK,SAAQ,GAAI;MACvB,KAAK;AACH,QAAAA,QAAO,KAAK,OAAM;AAClB;MACF,KAAK;AACH,QAAAA,QAAO,KAAK,WAAU;AACtB;MACF,KAAK;AACH,QAAAA,QAAO,KAAK,eAAc;AAC1B;MACF,KAAK;AACH,QAAAA,QAAO,KAAK,MAAK;AACjB;IACJ;AAEA,QAAIA,UAAS,UAAa,KAAK,mBAAkB,GAAI;AACnD,MAAAA,QAAO,KAAK,iBAAgB;IAC9B;AAGA,QAAI,cAAoBA,KAAI,GAAG;AAC7B,MAAAA,MAAK,MAAM,KAAK,IAAI,KAAK;AAEzB,UAAI,KAAK,aAAY,GAAI;AACvB,QAAAA,MAAK,aAAa,KAAK,WAAU;MACnC;AAEA,aAAOA;IACT;AAGA,WAAO,wBAAuB;EAChC;EAEU,SAAM;AACd,SAAK,YAAY,GAAG;AACpB,WAAO;MACL,MAAM;MACN,YAAY;MACZ,OAAO,CAAC,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,QAAQ,GAAG,GAAG,QAAQ,CAAC;;EAE1D;EAEU,aAAU;AAClB,SAAK,YAAY,IAAI;AAErB,YAAQ,KAAK,SAAQ,GAAI;MACvB,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO,KAAK,kBAAiB;MAC/B,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO,KAAK,qBAAoB;MAClC,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO,KAAK,kBAAiB;MAC/B,KAAK;AACH,eAAO,KAAK,wBAAuB;MACrC,KAAK;AACH,eAAO,KAAK,iBAAgB;MAC9B,KAAK;AACH,eAAO,KAAK,sBAAqB;MACnC,KAAK;AACH,eAAO,KAAK,gCAA+B;MAC7C;AACE,eAAO,KAAK,mBAAkB;IAClC;EACF;EAEU,oBAAiB;AACzB,UAAM,QAAQ,KAAK,gBAAe;AAElC,WAAO,EAAE,MAAM,sBAAsB,MAAY;EACnD;EAEU,uBAAoB;AAC5B,QAAI;AACJ,QAAI,aAAa;AACjB,YAAQ,KAAK,QAAO,GAAI;MACtB,KAAK;AACH,cAAM;AACN;MACF,KAAK;AACH,cAAM;AACN,qBAAa;AACb;MACF,KAAK;AACH,cAAM;AACN;MACF,KAAK;AACH,cAAM;AACN,qBAAa;AACb;MACF,KAAK;AACH,cAAM;AACN;MACF,KAAK;AACH,cAAM;AACN,qBAAa;AACb;IACJ;AAGA,QAAI,cAAc,GAAG,GAAG;AACtB,aAAO,EAAE,MAAM,OAAO,OAAO,KAAK,WAAsB;IAC1D;AAEA,WAAO,wBAAuB;EAChC;EAEU,oBAAiB;AACzB,QAAI;AACJ,YAAQ,KAAK,QAAO,GAAI;MACtB,KAAK;AACH,qBAAa,GAAG,IAAI;AACpB;MACF,KAAK;AACH,qBAAa,GAAG,IAAI;AACpB;MACF,KAAK;AACH,qBAAa,GAAG,IAAI;AACpB;MACF,KAAK;AACH,qBAAa,GAAG,GAAI;AACpB;MACF,KAAK;AACH,qBAAa,GAAG,IAAI;AACpB;IACJ;AAGA,QAAI,cAAc,UAAU,GAAG;AAC7B,aAAO,EAAE,MAAM,aAAa,OAAO,WAAU;IAC/C;AAEA,WAAO,wBAAuB;EAChC;EAEU,0BAAuB;AAC/B,SAAK,YAAY,GAAG;AACpB,UAAM,SAAS,KAAK,QAAO;AAC3B,QAAI,WAAW,KAAK,MAAM,MAAM,OAAO;AACrC,YAAM,MAAM,UAAU;IACxB;AAEA,UAAM,aAAa,OAAO,YAAW,EAAG,WAAW,CAAC,IAAI;AACxD,WAAO,EAAE,MAAM,aAAa,OAAO,WAAU;EAC/C;EAEU,mBAAgB;AAGxB,SAAK,YAAY,GAAG;AACpB,WAAO,EAAE,MAAM,aAAa,OAAO,GAAG,IAAI,EAAC;EAC7C;EAEU,wBAAqB;AAC7B,SAAK,YAAY,GAAG;AACpB,WAAO,KAAK,eAAe,CAAC;EAC9B;EAEU,kCAA+B;AACvC,SAAK,YAAY,GAAG;AACpB,WAAO,KAAK,eAAe,CAAC;EAC9B;EAEU,qBAAkB;AAG1B,UAAM,cAAc,KAAK,QAAO;AAChC,WAAO,EAAE,MAAM,aAAa,OAAO,GAAG,WAAW,EAAC;EACpD;EAEU,4BAAyB;AACjC,YAAQ,KAAK,SAAQ,GAAI;;MAEvB,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;AACH,cAAM,MAAM,KAAK;MACnB;AACE,cAAM,WAAW,KAAK,QAAO;AAC7B,eAAO,EAAE,MAAM,aAAa,OAAO,GAAG,QAAQ,EAAC;IACnD;EACF;EAEU,iBAAc;AACtB,UAAM,MAA0B,CAAA;AAChC,QAAI,aAAa;AACjB,SAAK,YAAY,GAAG;AACpB,QAAI,KAAK,SAAS,CAAC,MAAM,KAAK;AAC5B,WAAK,YAAY,GAAG;AACpB,mBAAa;IACf;AAEA,WAAO,KAAK,YAAW,GAAI;AACzB,YAAM,OAAO,KAAK,UAAS;AAC3B,YAAM,mBAAmB,KAAK,SAAS;AACvC,UAAI,YAAY,IAAI,KAAK,KAAK,YAAW,GAAI;AAC3C,aAAK,YAAY,GAAG;AACpB,cAAM,KAAK,KAAK,UAAS;AACzB,cAAM,iBAAiB,GAAG,SAAS;AAGnC,YAAI,YAAY,EAAE,GAAG;AACnB,cAAI,GAAG,QAAQ,KAAK,OAAO;AACzB,kBAAM,MAAM,uCAAuC;UACrD;AACA,cAAI,KAAK,EAAE,MAAM,KAAK,OAAO,IAAI,GAAG,MAAK,CAAE;QAC7C,OAAO;AAEL,sBAAY,KAAK,OAAO,GAAG;AAC3B,cAAI,KAAK,GAAG,GAAG,CAAC;AAChB,sBAAY,GAAG,OAAO,GAAG;QAC3B;MACF,OAAO;AACL,oBAAY,KAAK,OAAO,GAAG;MAC7B;IACF;AAEA,SAAK,YAAY,GAAG;AAEpB,WAAO,EAAE,MAAM,OAAO,YAAwB,OAAO,IAAG;EAC1D;EAEU,YAAS;AACjB,YAAQ,KAAK,SAAQ,GAAI;;MAEvB,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;AACH,cAAM,MAAM,KAAK;MACnB,KAAK;AACH,eAAO,KAAK,YAAW;MACzB;AACE,eAAO,KAAK,0BAAyB;IACzC;EACF;EAEU,cAAW;AACnB,SAAK,YAAY,IAAI;AACrB,YAAQ,KAAK,SAAQ,GAAI;;;MAGvB,KAAK;AACH,aAAK,YAAY,GAAG;AACpB,eAAO,EAAE,MAAM,aAAa,OAAO,GAAG,IAAQ,EAAC;MACjD,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO,KAAK,qBAAoB;MAClC,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO,KAAK,kBAAiB;MAC/B,KAAK;AACH,eAAO,KAAK,wBAAuB;MACrC,KAAK;AACH,eAAO,KAAK,iBAAgB;MAC9B,KAAK;AACH,eAAO,KAAK,sBAAqB;MACnC,KAAK;AACH,eAAO,KAAK,gCAA+B;MAC7C;AACE,eAAO,KAAK,mBAAkB;IAClC;EACF;EAEU,QAAK;AACb,QAAI,YAAY;AAChB,SAAK,YAAY,GAAG;AACpB,YAAQ,KAAK,SAAS,CAAC,GAAG;MACxB,KAAK;AACH,aAAK,YAAY,GAAG;AACpB,aAAK,YAAY,GAAG;AACpB,oBAAY;AACZ;MACF;AACE,aAAK;AACL;IACJ;AACA,UAAM,QAAQ,KAAK,YAAW;AAC9B,SAAK,YAAY,GAAG;AAEpB,UAAM,WAA+B;MACnC,MAAM;MACN;MACA;;AAGF,QAAI,WAAW;AACb,eAAS,KAAK,IAAI,KAAK;IACzB;AAEA,WAAO;EACT;EAEU,kBAAe;AACvB,QAAI,SAAS,KAAK,QAAO;AAIzB,QAAI,qBAAqB,KAAK,MAAM,MAAM,OAAO;AAC/C,YAAM,MAAM,8BAA8B;IAC5C;AAEA,WAAO,eAAe,KAAK,KAAK,SAAS,CAAC,CAAC,GAAG;AAC5C,gBAAU,KAAK,QAAO;IACxB;AAEA,WAAO,SAAS,QAAQ,EAAE;EAC5B;EAEU,uBAAoB;AAC5B,QAAI,SAAS,KAAK,QAAO;AACzB,QAAI,eAAe,KAAK,MAAM,MAAM,OAAO;AACzC,YAAM,MAAM,sBAAsB;IACpC;AAEA,WAAO,eAAe,KAAK,KAAK,SAAS,CAAC,CAAC,GAAG;AAC5C,gBAAU,KAAK,QAAO;IACxB;AAEA,WAAO,SAAS,QAAQ,EAAE;EAC5B;EAEU,mBAAgB;AACxB,UAAM,WAAW,KAAK,QAAO;AAC7B,YAAQ,UAAU;;MAEhB,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;;MAEL,KAAK;AAEH,cAAM,MAAM,KAAK;MACnB;AACE,eAAO,EAAE,MAAM,aAAa,OAAO,GAAG,QAAQ,EAAC;IACnD;EACF;EACU,eAAY;AACpB,YAAQ,KAAK,SAAS,CAAC,GAAG;MACxB,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO;MACT;AACE,eAAO;IACX;EACF;EAEU,cAAW;AACnB,WAAO,KAAK,SAAQ,MAAO,OAAO,KAAK,YAAY,CAAC;EACtD;EAEU,UAAO;AACf,WAAO,eAAe,KAAK,KAAK,SAAS,CAAC,CAAC;EAC7C;EAEU,YAAY,UAAU,GAAC;AAC/B,YAAQ,KAAK,SAAS,OAAO,GAAG;MAC9B,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO;MACT;AACE,eAAO;IACX;EACF;EAEU,SAAM;AACd,WAAO,KAAK,OAAM,KAAM,KAAK,YAAW;EAC1C;EAEU,SAAM;AACd,QAAI,KAAK,mBAAkB,GAAI;AAC7B,aAAO;IACT;AAEA,YAAQ,KAAK,SAAS,CAAC,GAAG;MACxB,KAAK;MACL,KAAK;;MACL,KAAK;;;MAEL,KAAK;AACH,eAAO;MACT;AACE,eAAO;IACX;EACF;EAEU,cAAW;AACnB,YAAQ,KAAK,SAAS,CAAC,GAAG;MACxB,KAAK;MACL,KAAK;AACH,eAAO;;MAET,KAAK;AACH,gBAAQ,KAAK,SAAS,CAAC,GAAG;UACxB,KAAK;UACL,KAAK;AACH,mBAAO;UACT;AACE,mBAAO;QACX;;MAEF,KAAK;AACH,eACE,KAAK,SAAS,CAAC,MAAM,QACpB,KAAK,SAAS,CAAC,MAAM,OACpB,KAAK,SAAS,CAAC,MAAM,OACpB,KAAK,SAAS,CAAC,MAAM,QACnB,KAAK,SAAS,CAAC,MAAM,OAAO,KAAK,SAAS,CAAC,MAAM;MAE1D;AACE,eAAO;IACX;EACF;EAEU,eAAY;AACpB,UAAM,YAAY,KAAK,UAAS;AAChC,QAAI;AACF,aAAO,KAAK,WAAW,IAAI,MAAM;IACnC,SAAS,GAAG;AACV,aAAO;IACT;AACE,WAAK,aAAa,SAAS;IAC7B;EACF;EAEU,qBAAkB;AAC1B,YAAQ,KAAK,SAAQ,GAAI;MACvB,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;AACH,eAAO;MACT;AACE,eAAO;IACX;EACF;EAEU,eAAe,SAAe;AACtC,QAAI,YAAY;AAChB,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAM,UAAU,KAAK,QAAO;AAC5B,UAAI,gBAAgB,KAAK,OAAO,MAAM,OAAO;AAC3C,cAAM,MAAM,+BAA+B;MAC7C;AACA,mBAAa;IACf;AACA,UAAM,WAAW,SAAS,WAAW,EAAE;AACvC,WAAO,EAAE,MAAM,aAAa,OAAO,SAAQ;EAC7C;EAEU,SAAS,UAAU,GAAC;AAC5B,WAAO,KAAK,MAAM,KAAK,MAAM,OAAO;EACtC;EAEU,UAAO;AACf,UAAM,WAAW,KAAK,SAAS,CAAC;AAChC,SAAK,YAAY,MAAS;AAC1B,WAAO;EACT;EAEU,YAAY,MAAwB;AAC5C,QAAI,SAAS,UAAa,KAAK,MAAM,KAAK,GAAG,MAAM,MAAM;AACvD,YAAM,MACJ,gBACE,OACA,mBACA,KAAK,MAAM,KAAK,GAAG,IACnB,kBACA,KAAK,GAAG;IAEd;AAEA,QAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AACjC,YAAM,MAAM,yBAAyB;IACvC;AACA,SAAK;EACP;EAEU,IAAI,OAAa;AACzB,WAAO,EAAE,OAAc,KAAK,KAAK,IAAG;EACtC;;;;ACz0BI,IAAO,oBAAP,MAAwB;EACrB,cAAc,MAAgB;AACnC,eAAW,OAAO,MAAM;AACtB,YAAM,QAAS,KAAa,GAAG;AAE/B,UAAI,KAAK,eAAe,GAAG,GAAG;AAC5B,YAAI,MAAM,SAAS,QAAW;AAC5B,eAAK,MAAM,KAAK;QAClB,WAAW,MAAM,QAAQ,KAAK,GAAG;AAC/B,gBAAM,QAAQ,CAAC,aAAY;AACzB,iBAAK,MAAM,QAAQ;UACrB,GAAG,IAAI;QACT;MACF;IACF;EACF;EAEO,MAAM,MAAmB;AAC9B,YAAQ,KAAK,MAAM;MACjB,KAAK;AACH,aAAK,aAAa,IAAI;AACtB;MACF,KAAK;AACH,aAAK,WAAW,IAAI;AACpB;MACF,KAAK;AACH,aAAK,iBAAiB,IAAI;AAC1B;MACF,KAAK;AACH,aAAK,iBAAiB,IAAI;AAC1B;MACF,KAAK;AACH,aAAK,iBAAiB,IAAI;AAC1B;MACF,KAAK;AACH,aAAK,eAAe,IAAI;AACxB;MACF,KAAK;AACH,aAAK,kBAAkB,IAAI;AAC3B;MACF,KAAK;AACH,aAAK,qBAAqB,IAAI;AAC9B;MACF,KAAK;AACH,aAAK,eAAe,IAAI;AACxB;MACF,KAAK;AACH,aAAK,uBAAuB,IAAI;AAChC;MACF,KAAK;AACH,aAAK,gBAAgB,IAAI;AACzB;MACF,KAAK;AACH,aAAK,wBAAwB,IAAI;AACjC;MACF,KAAK;AACH,aAAK,eAAe,IAAI;AACxB;MACF,KAAK;AACH,aAAK,SAAS,IAAI;AAClB;MACF,KAAK;AACH,aAAK,WAAW,IAAI;AACpB;MACF,KAAK;AACH,aAAK,wBAAwB,IAAI;AACjC;MACF,KAAK;AACH,aAAK,gBAAgB,IAAI;AACzB;IACJ;AAEA,SAAK,cAAc,IAAI;EACzB;EAEO,aAAa,MAAmB;EAAS;EAEzC,WAAW,MAAiB;EAAS;EAErC,iBAAiB,MAAiB;EAAS;EAE3C,iBAAiB,MAAiB;EAAS;;EAG3C,iBAAiB,MAAe;EAAS;EAEzC,eAAe,MAAe;EAAS;EAEvC,kBAAkB,MAAe;EAAS;EAE1C,qBAAqB,MAAe;EAAS;EAE7C,eAAe,MAAe;EAAS;EAEvC,uBAAuB,MAAe;EAAS;EAE/C,gBAAgB,MAAe;EAAS;EAExC,wBAAwB,MAAe;EAAS;;EAGhD,eAAe,MAAe;EAAS;EAEvC,SAAS,MAAS;EAAS;EAE3B,WAAW,MAAW;EAAS;EAE/B,wBAAwB,MAAwB;EAAS;EAEzD,gBAAgB,MAAgB;EAAS;;;;ACnH3C,IAAM,iBAAiB;AAE9B,IAAM,eAAe,IAAI,aAAY;AAerC,IAAM,wBAAN,cAAoC,kBAAiB;EAArD,cAAA;;AAEY,SAAA,aAAa;AAEb,SAAA,iBAA2B,CAAA;AACnC,SAAA,YAAY;EAoEhB;EAjEI,IAAI,WAAQ;AACR,WAAO,KAAK,eAAe,KAAK,EAAE;EACtC;EAEA,MAAM,OAAa;AACf,SAAK,YAAY;AACjB,SAAK,QAAQ;AACb,SAAK,cAAc;AACnB,SAAK,aAAa;AAClB,SAAK,iBAAiB,CAAA;EAC1B;EAES,WAAW,MAAW;AAC3B,QAAI,KAAK,YAAY;AACjB,WAAK,aAAa;AAClB,WAAK,iBAAiB,CAAA;IAC1B;EACJ;EAES,eAAe,MAAe;AACnC,UAAM,OAAO,OAAO,aAAa,KAAK,KAAK;AAC3C,QAAI,CAAC,KAAK,aAAa,SAAS,MAAM;AAClC,WAAK,YAAY;IACrB;AACA,QAAI,KAAK,YAAY;AACjB,WAAK,aAAa;AAClB,WAAK,iBAAiB,CAAA;IAC1B,OAAO;AACH,YAAM,cAAc,aAAa,IAAI;AACrC,WAAK,eAAe,KAAK,WAAW;AACpC,UAAI,KAAK,YAAY;AACjB,aAAK,eAAe;MACxB;IACJ;EACJ;EAES,SAAS,MAAS;AACvB,QAAI,CAAC,KAAK,WAAW;AACjB,YAAM,MAAM,KAAK,MAAM,UAAU,KAAK,IAAI,OAAO,KAAK,IAAI,GAAG;AAC7D,YAAM,QAAQ,IAAI,OAAO,GAAG;AAC5B,WAAK,YAAY,QAAQ,KAAK,MAAM,KAAK,CAAC;IAC9C;AACA,QAAI,KAAK,YAAY;AACjB,WAAK,aAAa;AAClB,WAAK,iBAAiB,CAAA;IAC1B,OAAO;AACH,YAAM,MAAM,KAAK,MAAM,UAAU,KAAK,IAAI,OAAO,KAAK,IAAI,GAAG;AAC7D,WAAK,eAAe,KAAK,GAAG;AAC5B,UAAI,KAAK,YAAY;AACjB,aAAK,eAAe;MACxB;IACJ;EACJ;EAES,cAAc,MAAgB;AACnC,QAAI,KAAK,SAAS,SAAS;AAGvB,YAAM,QAAQ;AACd,UAAI,MAAM,YAAY;AAClB;MACJ;IACJ;AACA,UAAM,cAAc,IAAI;EAC5B;;AAGJ,IAAM,UAAU,IAAI,sBAAqB;AAwBnC,SAAU,mBAAmB,QAAuB;AACtD,MAAI;AACA,QAAI,OAAO,WAAW,UAAU;AAC5B,eAAS,IAAI,OAAO,MAAM;IAC9B;AACA,aAAS,OAAO,SAAQ;AACxB,YAAQ,MAAM,MAAM;AAEpB,YAAQ,MAAM,aAAa,QAAQ,MAAM,CAAC;AAC1C,WAAO,QAAQ;EACnB,SAAQ;AACJ,WAAO;EACX;AACJ;AAMO,IAAM,uBACT,6HAC0D,MAAM,EAAE;AAEhE,SAAU,aAAa,OAAsB;AAC/C,QAAM,SAAS,OAAO,UAAU,WAAW,IAAI,OAAO,KAAK,IAAI;AAC/D,SAAO,qBAAqB,KAAK,CAAC,OAAO,OAAO,KAAK,EAAE,CAAC;AAC5D;AAEM,SAAU,aAAa,OAAa;AACtC,SAAO,MAAM,QAAQ,uBAAuB,MAAM;AACtD;AAQM,SAAU,eAAe,OAAwB,OAAa;AAChE,QAAM,UAAU,cAAc,KAAK;AACnC,QAAM,QAAQ,MAAM,MAAM,OAAO;AACjC,SAAO,CAAC,CAAC,SAAS,MAAM,CAAC,EAAE,SAAS;AACxC;AAQM,SAAU,cAAc,OAAsB;AAChD,MAAI,OAAO,UAAU,UAAU;AAC3B,YAAQ,IAAI,OAAO,KAAK;EAC5B;AACA,QAAM,KAAK,OAAO,SAAS,MAAM;AACjC,MAAI,IAAI;AAER,WAASC,WAAO;AACZ,QAAI,SAAS,IACT;AAEJ,aAAS,UAAU,SAAe;AAC9B,gBAAU,OAAO,OAAO,GAAG,OAAO;AAClC,WAAK;IACT;AAEA,aAAS,eAAe,SAAe;AACnC,gBAAU,QAAQ,OAAO,OAAO,GAAG,OAAO,IAAI;AAC9C,WAAK;IACT;AAEA,WAAO,IAAI,OAAO,QAAQ;AACtB,cAAQ,OAAO,CAAC,GAAG;QACf,KAAK;AACD,kBAAQ,OAAO,IAAI,CAAC,GAAG;YACnB,KAAK;AACD,6BAAe,CAAC;AAChB;YACJ,KAAK;AACD,6BAAe,CAAC;AAChB;YACJ,KAAK;AACD,kBAAI,GAAG,SAAS;AACZ,oBAAI,OAAO,IAAI,CAAC,MAAM,KAAK;AACvB,iCAAe,OAAO,QAAQ,KAAK,CAAC,IAAI,IAAI,CAAC;gBACjD,OAAO;AACH,iCAAe,CAAC;gBACpB;cACJ,OAAO;AACH,+BAAe,CAAC;cACpB;AACA;YACJ,KAAK;YACL,KAAK;AACD,kBAAI,GAAG,SAAS;AACZ,+BAAe,OAAO,QAAQ,KAAK,CAAC,IAAI,IAAI,CAAC;cACjD,OAAO;AACH,+BAAe,CAAC;cACpB;AACA;YACJ,KAAK;AACD,6BAAe,OAAO,QAAQ,KAAK,CAAC,IAAI,IAAI,CAAC;AAC7C;YACJ;AACI,6BAAe,CAAC;AAChB;UACR;AACA;QAEJ,KAAK;AACD,gBAAM;AACN,cAAI,YAAY;AAChB,gBAAM,IAAI,KAAK,MAAM,KAAK,CAAA;AAC1B,yBAAe,IAAI,CAAC,EAAE,MAAM;AAC5B;QAEJ,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;AACD,oBAAU,CAAC;AACX;QACJ,KAAK;AACD,gBAAM;AACN,cAAI,YAAY;AAChB,gBAAM,IAAI,KAAK,MAAM;AACrB,cAAI,KAAK;AACL,sBAAU,IAAI,CAAC,EAAE,MAAM;UAC3B,OAAO;AACH,2BAAe,CAAC;UACpB;AACA;QACJ,KAAK;AACD,cAAI,OAAO,IAAI,CAAC,MAAM,KAAK;AACvB,oBAAQ,OAAO,IAAI,CAAC,GAAG;cACnB,KAAK;AACD,0BAAU;AACV,qBAAK;AACL,0BAAUA,SAAO,IAAK;AACtB;cACJ,KAAK;AACD,0BAAU;AACV,qBAAK;AACL,0BAAUA,SAAO,IAAK;AACtB;cACJ,KAAK;AACD,sBAAM;AACN,qBAAK;AACL,gBAAAA,SAAO;AACP,0BAAU,OAAO,OAAO,KAAK,IAAI,GAAG;AACpC;cACJ,KAAK;AACD,wBAAQ,OAAO,IAAI,CAAC,GAAG;kBACnB,KAAK;kBACL,KAAK;AACD,0BAAM;AACN,yBAAK;AACL,oBAAAA,SAAO;AACP,8BAAU,OAAO,OAAO,KAAK,IAAI,GAAG;AACpC;kBACJ;AACI,8BAAU,OAAO,QAAQ,KAAK,CAAC,IAAI,IAAI,CAAC;AACxC,8BAAUA,SAAO,IAAK;AACtB;gBACR;AACA;YACR;UACJ,OAAO;AACH,sBAAU,CAAC;AACX,sBAAUA,SAAO,IAAK;UAC1B;AACA;QACJ,KAAK;AACD,YAAE;AACF,iBAAO;QACX;AACI,yBAAe,CAAC;AAChB;MACR;IACJ;AAEA,WAAO;EACX;AAEA,SAAO,IAAI,OAAOA,SAAO,GAAI,MAAM,KAAK;AAC5C;;;ACtSM,SAAU,aAAa,SAAoB;AAC7C,SAAO,QAAQ,MAAM,KAAK,OAAS,aAAa,CAAC,KAAK,EAAE,KAAK;AACjE;AAKM,SAAU,eAAe,SAAoB;AAC/C,SAAO,QAAQ,MAAM,OAAO,OAAS,eAAe,CAAC,KAAK,EAAE,MAAM;AACtE;AAUM,SAAU,qBAAqB,SAAsB,cAAqB;AAC5E,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,YAAY,aAAa,OAAO;AACtC,MAAI,CAAC,WAAW;AACZ,WAAO,IAAI,IAAI,QAAQ,KAAK;EAChC;AAEA,QAAM,eAAe,CAAC,SAA6B,EAAE,OAAO,eAAe,OAAO,CAAC;AACnF,aAAW,QAAQ,cAAc;AAC7B,YAAQ,MAAM,WAAW,YAAY;EACzC;AAEA,QAAM,QAAQ,oBAAI,IAAG;AACrB,aAAW,QAAQ,QAAQ,OAAO;AAC9B,QAAI,UAAU,IAAI,KAAK,IAAI,KAAU,eAAe,IAAI,KAAK,KAAK,QAAS;AACvE,YAAM,IAAI,IAAI;IAClB;EACJ;AACA,SAAO;AACX;AAEA,SAAS,QAAQ,MAAwB,YAAyB,cAAqB;AACnF,aAAW,IAAI,KAAK,IAAI;AACxB,oBAAkB,IAAI,EAAE,QAAQ,UAAO;AACnC,QAAQ,WAAW,IAAI,KAAM,gBAAoB,mBAAmB,IAAI,GAAI;AACxE,YAAM,UAAU,KAAK,KAAK;AAC1B,UAAI,WAAW,CAAC,WAAW,IAAI,QAAQ,IAAI,GAAG;AAC1C,gBAAQ,SAAS,YAAY,YAAY;MAC7C;IACJ;EACJ,CAAC;AACL;AAgCM,SAAU,0BAA0B,UAA4B;AAClE,MAAI,SAAS,UAAU;AACnB,WAAO,SAAS;EACpB,WAAW,SAAS,KAAK,KAAK;AAC1B,UAAM,gBAAgB,mBAAmB,SAAS,KAAK,GAAG;AAC1D,WAAO,+CAAe;EAC1B;AACA,SAAO;AACX;AAOM,SAAU,kBAAkB,cAA8B;AAC5D,SAAO,aAAa,UAAU,CAAC,aAAa,cAAc,YAAY,CAAC;AAC3E;AAQM,SAAU,qBAAqB,MAA2BC,WAA4B;AACxF,MAAI,CAAC,QAAQ,CAACA,WAAU;AACpB,WAAO,CAAA;EACX;AACA,SAAO,6BAA6B,MAAMA,WAAU,KAAK,SAAS,IAAI;AAC1E;AAWM,SAAU,oBAAoB,MAA2BA,WAA8B,OAAc;AACvG,MAAI,CAAC,QAAQ,CAACA,WAAU;AACpB,WAAO;EACX;AACA,QAAM,QAAQ,6BAA6B,MAAMA,WAAU,KAAK,SAAS,IAAI;AAC7E,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;EACX;AACA,MAAI,UAAU,QAAW;AACrB,YAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,MAAM,SAAS,CAAC,CAAC;EACzD,OAAO;AACH,YAAQ;EACZ;AACA,SAAO,MAAM,KAAK;AACtB;AAEA,SAAS,6BAA6B,MAAeA,WAAkB,SAA8BC,QAAc;AAC/G,MAAI,CAACA,QAAO;AACR,UAAM,cAAc,mBAAmB,KAAK,eAAmB,YAAY;AAC3E,QAAI,eAAe,YAAY,YAAYD,WAAU;AACjD,aAAO,CAAC,IAAI;IAChB;EACJ;AACA,MAAI,mBAAmB,IAAI,KAAK,KAAK,YAAY,SAAS;AACtD,WAAO,KAAK,QAAQ,QAAQ,OAAK,6BAA6B,GAAGA,WAAU,SAAS,KAAK,CAAC;EAC9F;AACA,SAAO,CAAA;AACX;AAQM,SAAU,oBAAoB,MAA2B,SAAe;AAC1E,MAAI,CAAC,MAAM;AACP,WAAO,CAAA;EACX;AACA,SAAO,4BAA4B,MAAM,SAAS,6BAAM,OAAO;AACnE;AAWM,SAAU,mBAAmB,MAA2B,SAAiB,OAAc;AACzF,MAAI,CAAC,MAAM;AACP,WAAO;EACX;AACA,QAAM,QAAQ,4BAA4B,MAAM,SAAS,6BAAM,OAAO;AACtE,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;EACX;AACA,MAAI,UAAU,QAAW;AACrB,YAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,MAAM,SAAS,CAAC,CAAC;EACzD,OAAO;AACH,YAAQ;EACZ;AACA,SAAO,MAAM,KAAK;AACtB;AAEM,SAAU,4BAA4B,MAAe,SAAiB,SAA4B;AACpG,MAAI,KAAK,YAAY,SAAS;AAC1B,WAAO,CAAA;EACX;AACA,MAAQ,UAAU,KAAK,aAAa,KAAK,KAAK,cAAc,UAAU,SAAS;AAC3E,WAAO,CAAC,IAAI;EAChB;AACA,QAAM,eAAe,UAAU,IAAI,EAAE,SAAQ;AAC7C,MAAI;AACJ,QAAM,eAA0B,CAAA;AAChC,KAAG;AACC,aAAS,aAAa,KAAI;AAC1B,QAAI,CAAC,OAAO,MAAM;AACd,YAAM,YAAY,OAAO;AACzB,UAAI,UAAU,YAAY,SAAS;AAC/B,YAAQ,UAAU,UAAU,aAAa,KAAK,UAAU,cAAc,UAAU,SAAS;AACrF,uBAAa,KAAK,SAAS;QAC/B;MACJ,OAAO;AACH,qBAAa,MAAK;MACtB;IACJ;EACJ,SAAS,CAAC,OAAO;AACjB,SAAO;AACX;AAQM,SAAU,eAAe,SAAgB;AAhP/C;AAiPI,QAAM,UAAU,QAAQ;AAGxB,SAAO,cAAY,aAAQ,cAAR,mBAAmB,UAAS;AAC3C,UAAM,aAAa,mBAAmB,QAAQ,eAAmB,YAAY;AAC7E,QAAI,YAAY;AACZ,aAAO;IACX;AACA,cAAU,QAAQ;EACtB;AACA,SAAO;AACX;AAOM,SAAU,mBAAmB,MAAsB;AACrD,MAAI,YAAqB;AACzB,MAAQ,eAAe,SAAS,GAAG;AAE/B,QAAQ,SAAS,UAAU,UAAU,GAAG;AAEpC,kBAAY,UAAU,WAAW;IACrC,WAAe,qBAAqB,UAAU,UAAU,GAAG;AAEvD,kBAAY,UAAU;IAC1B,OAAO;AACH,wBAAkB,UAAU,UAAU;IAC1C;EACJ;AACA,SAAO,2BAA2B,MAAM,WAAW,oBAAI,IAAG,CAAE;AAChE;AAEA,SAAS,2BAA2B,MAAwB,WAAoB,OAAwD;AApRxI;AAsRI,WAAS,GAAG,MAAe,SAAyB;AAChD,QAAI,kBAA8C;AAClD,UAAM,mBAAmB,mBAAmB,MAAU,YAAY;AAElE,QAAI,CAAC,kBAAkB;AACnB,wBAAkB,2BAA2B,SAAS,SAAS,KAAK;IACxE;AACA,UAAM,IAAI,MAAM,eAAe;AAC/B,WAAO;EACX;AAEA,MAAI,MAAM,IAAI,IAAI,GAAG;AACjB,WAAO,MAAM,IAAI,IAAI;EACzB;AACA,QAAM,IAAI,MAAM,MAAS;AACzB,aAAW,QAAQ,kBAAkB,SAAS,GAAG;AAC7C,QAAQ,aAAa,IAAI,KAAK,KAAK,QAAQ,YAAW,MAAO,QAAQ;AACjE,YAAM,IAAI,MAAM,IAAI;AACpB,aAAO;IACX,WAAe,WAAW,IAAI,KAAS,aAAa,KAAK,KAAK,GAAG,GAAG;AAChE,aAAO,GAAG,MAAM,KAAK,KAAK,GAAG;IACjC,WAAe,aAAa,IAAI,OAAK,UAAK,YAAL,mBAAc,MAAK;AACpD,aAAO,GAAG,MAAM,KAAK,QAAQ,GAAG;IACpC;EACJ;AACA,SAAO;AACX;AA6BM,SAAU,sBAAsB,aAA2B,SAA6B;AAC1F,SAAO,gBAAgB,OAAO,gBAAgB,OAAY,QAAQ,OAAO,KAAK,QAAQ,QAAQ,cAAc;AAChH;AAEM,SAAU,mBAAmB,aAAyB;AACxD,SAAO,gBAAgB,OAAO,gBAAgB;AAClD;AAUM,SAAU,eAAe,MAAoB;AAC/C,SAAO,uBAAuB,MAAM,oBAAI,IAAG,CAAE;AACjD;AAEA,SAAS,uBAAuB,MAAsB,SAA4B;AAC9E,MAAI,QAAQ,IAAI,IAAI,GAAG;AACnB,WAAO;EACX,OAAO;AACH,YAAQ,IAAI,IAAI;EACpB;AACA,aAAW,QAAQ,kBAAkB,IAAI,GAAG;AACxC,QAAQ,WAAW,IAAI,GAAG;AACtB,UAAI,CAAC,KAAK,KAAK,KAAK;AAEhB,eAAO;MACX;AACA,UAAQ,aAAa,KAAK,KAAK,GAAG,KAAK,CAAC,uBAAuB,KAAK,KAAK,KAAK,OAAO,GAAG;AACpF,eAAO;MACX;AACA,UAAQ,YAAY,KAAK,KAAK,GAAG,GAAG;AAChC,eAAO;MACX;IACJ,WAAe,aAAa,IAAI,GAAG;AAC/B,aAAO;IACX,WAAe,SAAS,IAAI,GAAG;AAC3B,aAAO;IACX;EACJ;AACA,SAAO,QAAQ,KAAK,UAAU;AAClC;AAsCM,SAAU,oBAAoB,MAAsB;AACtD,MAAQ,eAAe,IAAI,GAAG;AAC1B,WAAO;EACX;AACA,MAAI,KAAK,cAAc;AACnB,WAAO,KAAK,aAAa;EAC7B,WAAW,KAAK,UAAU;AACtB,WAAO,KAAK;EAChB,WAAW,KAAK,YAAY;AACxB,UAAM,UAAU,KAAK,WAAW;AAChC,QAAI,SAAS;AACT,aAAO,QAAQ;IACnB;EACJ;AACA,SAAO;AACX;AAEM,SAAU,YAAY,MAAmC;AAjb/D;AAkbI,MAAQ,qBAAqB,IAAI,GAAG;AAChC,WAAW,aAAa,IAAI,KAAK,eAAe,IAAI,IAAI,KAAK,QAAO,yBAAoB,IAAI,MAAxB,YAA6B,KAAK;EAC1G,WAAe,YAAY,IAAI,KAAS,OAAO,IAAI,KAAS,aAAa,IAAI,GAAG;AAC5E,WAAO,KAAK;EAChB,WAAe,SAAS,IAAI,GAAG;AAC3B,UAAM,aAAa,cAAc,IAAI;AACrC,QAAI,YAAY;AACZ,aAAO;IACX;EACJ,WAAe,eAAe,IAAI,GAAG;AACjC,WAAO,KAAK;EAChB;AACA,QAAM,IAAI,MAAM,iCAAiC;AACrD;AAEM,SAAU,cAAc,QAAkB;AAjchD;AAkcI,MAAI,OAAO,cAAc;AACrB,WAAO,OAAO,aAAa;EAC/B,YAAW,YAAO,SAAP,mBAAa,KAAK;AACzB,WAAO,YAAY,OAAO,KAAK,GAAG;EACtC;AACA,SAAO;AACX;AAwBM,SAAU,YAAY,MAAsB;AAhelD;AAieI,MAAQ,eAAe,IAAI,GAAG;AAC1B,YAAO,gBAAK,SAAL,mBAAW,SAAX,YAAmB;EAC9B,OAAO;AACH,YAAO,yBAAoB,IAAI,MAAxB,YAA6B,KAAK;EAC7C;AACJ;AAEM,SAAU,cAAc,cAA8B;AACxD,QAAM,QAAe;IACjB,GAAG;IACH,GAAG;IACH,GAAG;;AAEP,QAAM,SAAS,uBAAuB,aAAa,YAAY,KAAK;AACpE,QAAM,WAAW,OAAO,QAAQ,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,KAAK,EAAE,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI,EAAE,KAAK,EAAE;AACjG,SAAO,IAAI,OAAO,QAAQ,QAAQ;AACtC;AAGA,IAAM,WAAW,SAAS;AAQ1B,SAAS,uBAAuB,SAA8B,OAAa;AA5f3E;AA6fI,MAAQ,uBAAuB,OAAO,GAAG;AACrC,WAAO,4BAA4B,OAAO;EAC9C,WAAe,gBAAgB,OAAO,GAAG;AACrC,WAAO,qBAAqB,OAAO;EACvC,WAAe,iBAAiB,OAAO,GAAG;AACtC,WAAO,sBAAsB,OAAO;EACxC,WAAe,mBAAmB,OAAO,GAAG;AACxC,UAAM,OAAO,QAAQ,KAAK;AAC1B,QAAI,CAAC,MAAM;AACP,YAAM,IAAI,MAAM,yBAAyB;IAC7C;AACA,WAAO,gBAAgB,uBAAuB,KAAK,UAAU,GAAG;MAC5D,aAAa,QAAQ;MACrB,WAAW,QAAQ;MACnB,eAAe,QAAQ;KAC1B;EACL,WAAe,eAAe,OAAO,GAAG;AACpC,WAAO,mBAAmB,OAAO;EACrC,WAAe,aAAa,OAAO,GAAG;AAClC,WAAO,kBAAkB,OAAO;EACpC,WAAe,aAAa,OAAO,GAAG;AAClC,UAAM,YAAY,QAAQ,MAAM,YAAY,GAAG;AAC/C,UAAM,SAAS,QAAQ,MAAM,UAAU,GAAG,SAAS;AACnD,UAAM,aAAa,QAAQ,MAAM,UAAU,YAAY,CAAC;AACxD,QAAI,OAAO;AACP,YAAM,IAAI,WAAW,SAAS,GAAG;AACjC,YAAM,IAAI,WAAW,SAAS,GAAG;AACjC,YAAM,IAAI,WAAW,SAAS,GAAG;IACrC;AACA,WAAO,gBAAgB,QAAQ;MAC3B,aAAa,QAAQ;MACrB,WAAW,QAAQ;MACnB,eAAe,QAAQ;MACvB,MAAM;KACT;EACL,WAAe,WAAW,OAAO,GAAG;AAChC,WAAO,gBAAgB,UAAU;MAC7B,aAAa,QAAQ;MACrB,WAAW,QAAQ;MACnB,eAAe,QAAQ;KAC1B;EACL,OAAO;AACH,UAAM,IAAI,MAAM,6BAA6B,mCAAS,KAAK,MAAK,wCAAS,aAAT,mBAAmB,IAAI,EAAE;EAC7F;AACJ;AAEA,SAAS,4BAA4B,cAAsC;AACvE,SAAO,gBAAgB,aAAa,SAAS,IAAI,OAAK,uBAAuB,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG;IACxF,aAAa,aAAa;IAC1B,WAAW,aAAa;IACxB,eAAe,aAAa;IAC5B,MAAM;;GACT;AACL;AAEA,SAAS,qBAAqB,OAAwB;AAClD,SAAO,gBAAgB,MAAM,SAAS,IAAI,OAAK,uBAAuB,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG;IAChF,aAAa,MAAM;IACnB,WAAW,MAAM;IACjB,eAAe,MAAM;IACrB,MAAM;;GACT;AACL;AAEA,SAAS,kBAAkB,OAAqB;AAC5C,SAAO,gBAAgB,GAAG,QAAQ,KAAK,uBAAuB,MAAM,QAAQ,CAAC,IAAI;IAC7E,aAAa,MAAM;IACnB,WAAW,MAAM;IACjB,eAAe,MAAM;GACxB;AACL;AAEA,SAAS,mBAAmB,QAAwB;AAChD,SAAO,gBAAgB,MAAM,uBAAuB,OAAO,QAAQ,CAAC,IAAI,QAAQ,MAAM;IAClF,aAAa,OAAO;IACpB,WAAW,OAAO;IAClB,eAAe,OAAO;GACzB;AACL;AAEA,SAAS,sBAAsB,OAAyB;AACpD,MAAI,MAAM,OAAO;AACb,WAAO,gBAAgB,IAAI,eAAe,MAAM,IAAI,CAAC,IAAI,eAAe,MAAM,KAAK,CAAC,KAAK;MACrF,aAAa,MAAM;MACnB,WAAW,MAAM;MACjB,eAAe,MAAM;MACrB,MAAM;KACT;EACL;AACA,SAAO,gBAAgB,eAAe,MAAM,IAAI,GAAG;IAC/C,aAAa,MAAM;IACnB,WAAW,MAAM;IACjB,eAAe,MAAM;IACrB,MAAM;GACT;AACL;AAEA,SAAS,eAAe,SAAoB;AACxC,SAAO,aAAa,QAAQ,KAAK;AACrC;AAEA,SAAS,gBAAgB,OAAe,SAKvC;AAvmBD;AAwmBI,MAAI,QAAQ,iBAAiB,QAAQ,aAAa,QAAQ,SAAS,OAAO;AACtE,UAAM,eAAc,aAAQ,cAAR,YAAsB,QAAQ,gBAAgB,KAAK;AACvE,YAAQ,IAAI,WAAW,GAAG,KAAK;EACnC;AACA,MAAI,QAAQ,aAAa;AACrB,WAAO,GAAG,KAAK,GAAG,QAAQ,WAAW;EACzC;AACA,SAAO;AACX;;;AC/kBM,SAAU,iBAAiB,cAA+B,gBAAwB;AACpF,QAAM,UAAiC;IACnC,QAAQ;IACR,QAAQ;;AAEZ,kBAAgB,OAAO;AAEvB,UAAQ,OAAO,KAAI,EAAG,QAAQ,aAAU;AAAG,YAAQ,WAAW;EAAW,CAAC;AAC1E,QAAM,aAAa,sBAAsB,QAAQ,MAAM;AAEvD,SAAO,WAAW,IAAI,OAAK,EAAE,EAAE,SAAS,CAAC,CAAC;AAC9C;AAEA,SAAS,yBAAyB,OAAoB;AAClD,QAAM,WAA4B,CAAA;AAClC,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;EACX;AACA,QAAM,MAAM,MAAM,MAAM,SAAS,CAAC;AAClC,QAAM,EAAE,OAAO,MAAK,IAAK,kBAAkB,IAAI,OAAO;AAEtD,MAAI,mBAAmB,MAAM,WAAW,GAAG;AAEvC,UAAM,oBAAoB,0BAA0B;MAChD,SAAS;MACT,MAAM,IAAI;MACV,UAAU,IAAI;KACjB;AACD,aAAS,KAAK,GAAG,iBAAiB;EACtC;AAEA,MAAI,aAAa;AACjB,MAAI,OAAO;AACP,iBAAa,MAAM,SAAS,QAAQ,KAAK;EAC7C;AAEA,QAAM,cAAc,MAAM,MAAM,GAAG,EAAE;AACrC,MAAI,CAAC,OAAO;AACR,UAAM,SAAS,yBAAyB,KAAK;AAC7C,QAAI,QAAQ;AAGR,eAAS,KAAK,GAAG,yBAAyB;QACtC,GAAG;QACH;UACI,SAAS;;OAEhB,CAAC;IACN,OAAO;AAGH,eAAS,KAAK,GAAG,yBAAyB,WAAW,CAAC;IAC1D;EACJ,OAAO;AAEH,UAAM,YAAY,aAAa;AAC/B,UAAM,EAAE,QAAQ,IAAG,IAAK,wBAAwB;MAC5C,SAAS;MACT,MAAM,IAAI;OACX,SAAS;AACZ,eAAW,YAAY,QAAQ;AAC3B,eAAS,KAAK,CAAC,GAAG,aAAa,GAAG,QAAQ,CAAC;IAC/C;AAEA,QAAI,KAAK;AAGL,mBAAa,MAAM,SAAS,SAAS;IACzC;EACJ;AACA,MAAI,SAAS,eAAe,MAAM,SAAS,SAAS,GAAG;AAGnD,aAAS,KAAK,GAAG,yBAAyB;MACtC,GAAG;MACH;QACI,SAAS;;KAEhB,CAAC;EACN;AAEA,SAAO;AACX;AAMM,SAAU,kBAAkB,MAAyB;AACvD,SAAO,0BAA0B,EAAE,SAAS,KAAI,CAAE;AACtD;AAEA,SAAS,0BAA0B,MAAiB;AA7HpD;AA8HI,QAAM,EAAE,SAAS,KAAI,IAAK;AAC1B,MAAQ,QAAQ,OAAO,GAAG;AACtB,WAAO,wBAAwB,MAAgC,CAAC,EAAE;EACtE,WAAe,eAAe,OAAO,KAAS,iBAAiB,OAAO,GAAG;AACrE,WAAO,QAAQ,SAAS,QAAQ,OAAK,0BAA0B;MAC3D,SAAS;MACT;MACA,UAAU,KAAK;KAClB,CAAC;EACN,WAAe,aAAa,OAAO,GAAG;AAClC,WAAO,0BAA0B;MAC7B,SAAS,QAAQ;MACjB;MACA,WAAU,UAAK,aAAL,YAAiB,QAAQ;KACtC;EACL,WAAe,SAAS,OAAO,GAAG;AAC9B,WAAO,yBAAyB,CAAC;MAC7B;MACA,MAAM,YAAY,OAAO;MACzB,WAAU,UAAK,aAAL,YAAiB,QAAQ;KACtC,CAAC;EACN,WAAe,WAAW,OAAO,KAAS,aAAa,QAAQ,KAAK,GAAG,GAAG;AACtE,UAAM,OAAO,QAAQ,KAAK;AAC1B,UAAM,SAAS,0BAA0B;MACrC,SAAS,KAAK;MACd,MAAM,KAAK,YAAY,KAAK,WAAW,UAAa,yBAAoB,IAAI,MAAxB,YAA6B,KAAK;MACtF,UAAU,KAAK;KAClB;AACD,eAAW,SAAS,QAAQ;AACxB,YAAM,QAAQ,IAAI;IACtB;AACA,WAAO;EACX,WAAe,WAAW,OAAO,KAAS,YAAY,QAAQ,KAAK,GAAG,GAAG;AACrE,UAAM,OAAO,QAAQ,KAAK;AAC1B,UAAM,OAAO,KAAK,KAAK,KAAK;AAC5B,QAAI,CAAK,aAAa,IAAI,GAAG;AACzB,cAAQ,MAAM,oCAAoC,KAAK,KAAK,KAAK,QAAQ;AACzE,aAAO,CAAA;IACX;AACA,UAAM,SAAS,0BAA0B;MACrC,SAAS,KAAK;MACd,OAAM,yBAAoB,IAAI,MAAxB,YAA6B,KAAK;MACxC,UAAU;KACb;AACD,eAAW,SAAS,QAAQ;AACxB,YAAM,QAAQ,IAAI;IACtB;AACA,WAAO;EACX,OAAO;AACH,WAAO,CAAC,CAAC,IAAI,CAAC;EAClB;AACJ;AAWA,SAAS,wBAAwB,MAA8B,OAAa;AACxE,QAAM,WAA4B,CAAA;AAClC,MAAI;AACJ,SAAO,QAAQ,KAAK,QAAQ,SAAS,QAAQ;AACzC,UAAM,UAAU,KAAK,QAAQ,SAAS,KAAK;AAC3C,mBAAe;MACX;MACA,MAAM,KAAK;;AAEf,UAAM,SAAS,0BAA0B,YAAY;AACrD,aAAS,KAAK,GAAG,MAAM;AACvB,QAAI,kBAAkB,SAAS,oBAAI,IAAG,CAAE,GAAG;AAEvC;IACJ,OAAO;AACH;IACJ;EACJ;AACA,SAAO;IACH,QAAQ;IACR,KAAK,SAAS,KAAK,QAAQ,SAAS;;AAE5C;AAMA,SAAS,kBAAkB,SAA8B,SAA0C;AAC/F,QAAM,gBAAgB,QAAQ,IAAI,OAAO;AACzC,MAAI,kBAAkB,QAAW;AAC7B,WAAO;EACX;AACA,UAAQ,IAAI,SAAS,KAAK;AAC1B,MAAI,sBAAsB,QAAQ,aAAa,OAAO,GAAG;AACrD,YAAQ,IAAI,SAAS,IAAI;AACzB,WAAO;EACX;AACA,MAAQ,QAAQ,OAAO,GAAG;AACtB,eAAW,WAAW,QAAQ,UAAU;AACpC,UAAI,CAAC,kBAAkB,SAAS,OAAO,GAAG;AACtC,gBAAQ,IAAI,SAAS,KAAK;AAC1B,eAAO;MACX;IACJ;AACA,YAAQ,IAAI,SAAS,IAAI;AACzB,WAAO;EACX,WAAe,eAAe,OAAO,KAAS,iBAAiB,OAAO,GAAG;AACrE,eAAW,WAAW,QAAQ,UAAU;AACpC,UAAI,kBAAkB,SAAS,OAAO,GAAG;AACrC,gBAAQ,IAAI,SAAS,IAAI;AACzB,eAAO;MACX;IACJ;AACA,YAAQ,IAAI,SAAS,KAAK;AAC1B,WAAO;EACX,WAAe,WAAW,OAAO,KAAS,aAAa,QAAQ,KAAK,GAAG,GAAG;AACtE,UAAM,OAAO,QAAQ,KAAK;AAC1B,UAAM,SAAS,kBAAkB,KAAK,YAAY,OAAO;AACzD,YAAQ,IAAI,SAAS,MAAM;AAC3B,WAAO;EACX;AACA,SAAO;AACX;AAOA,SAAS,gBAAgB,SAA8B;AACnD,aAAW,SAAS,QAAQ,QAAQ;AAChC,UAAM,oBAAoB,sBAAsB,QAAQ,QAAQ,KAAK;AACrE,YAAQ,SAAS;EACrB;AACJ;AAEA,SAAS,sBAAsB,QAAyB,OAAc;AAClE,QAAM,YAA6B,CAAA;AACnC,aAAW,SAAS,QAAQ;AACxB,cAAU,KAAK,GAAG,oBAAoB,OAAO,KAAK,CAAC;EACvD;AACA,SAAO;AACX;AAEA,SAAS,oBAAoB,OAAsB,OAAc;AAC7D,QAAM,kBAAkB,yBAAyB,KAAK;AACtD,QAAM,uBAAuB,gBAAgB,OAAO,UAAQ,QAAQ,eAAe,KAAK,KAAK,SAAS,CAAC,EAAE,SAAS,KAAK,IAAI,IAAI;AAC/H,SAAO;AACX;AAEM,SAAU,kBAAkB,SAA4B;AAvR9D;AAwRI,MAAI;AACJ,MAAI,OAAO;AACX,SAAO,KAAK,YAAY;AACpB,QAAQ,QAAQ,KAAK,UAAU,GAAG;AAC9B,eAAS,KAAK;AACd;IACJ,WAAe,kBAAkB,KAAK,UAAU,GAAG;AAC/C,aAAO,KAAK;IAChB,OAAO;AACH;IACJ;EACJ;AACA,MAAI,QAAQ;AACR,WAAO,EAAE,OAAO,QAAQ,OAAO,KAAI;EACvC;AACA,SAAO;IACH,OAAO;;;IAGP,QAAO,wBAAmB,SAAa,YAAY,MAA5C,YAAiD;;AAEhE;AAEA,SAAS,yBAAyB,SAA4B;AAC1D,QAAM,SAAS,QAAQ;AACvB,QAAM,aAAa,mBAAmB,QAAY,YAAY;AAC9D,MAAI,YAAY;AACZ,WAAO,yBAAyB,UAAU;EAC9C,OAAO;AACH,QAAI,UAAc,kBAAkB,MAAM,GAAG;AACzC,aAAO;IACX;EACJ;AACA,SAAO;AACX;AAEA,SAAS,eAAe,SAA8B,OAAa;AAC/D,MAAQ,UAAU,OAAO,GAAG;AACxB,UAAM,UAAU,QAAQ;AACxB,WAAO,YAAY,MAAM,UAAU;EACvC,WAAe,WAAW,OAAO,GAAG;AAChC,WAAO,YAAY,QAAQ,KAAK,KAAK,KAAK;EAC9C,WAAe,iBAAiB,OAAO,GAAG;AACtC,UAAM,mBAAmB,0BAA0B,OAAO;AAC1D,QAAI,kBAAkB;AAClB,aAAO,eAAe,kBAAkB,KAAK;IACjD;EACJ;AACA,SAAO;AACX;AAEA,SAAS,YAAY,MAAoC,OAAa;AAClE,MAAQ,aAAa,IAAI,GAAG;AACxB,UAAM,eAAe,kBAAkB,KAAK,UAAU;AACtD,WAAO,aAAa,KAAK,OAAK,eAAe,EAAE,EAAE,SAAS,CAAC,EAAE,SAAS,KAAK,CAAC;EAChF,WAAe,eAAe,IAAI,GAAG;AACjC,WAAO,cAAc,IAAI,EAAE,KAAK,MAAM,KAAK;EAC/C,OAAO;AACH,WAAO;EACX;AACJ;;;AbvPM,SAAU,+BAA+B,SAAqD;AAChG,QAAM,oBAAoB,MAAM,KAAK,IAAI,IAAI,QAAQ,QAAQ,CAAAE,YAAO;AA9FxE;AA8F2E,iBAAAA,WAAA,gBAAAA,QAAQ,sBAAR,YAA6B,CAAA;GAAE,CAAC,CAAC;AACxG,QAAM,sBAAsB,MAAM,KAAK,IAAI,IAAI,QAAQ,QAAQ,CAAAA,YAAO;AA/F1E;AA+F6E,iBAAAA,WAAA,gBAAAA,QAAQ,wBAAR,YAA+B,CAAA;GAAE,CAAC,CAAC;AAC5G,SAAO;IACH,mBAAmB,kBAAkB,SAAS,IAAI,oBAAoB;IACtE,qBAAqB,oBAAoB,SAAS,IAAI,sBAAsB;;AAEpF;AAyBM,IAAO,4BAAP,MAAgC;EAclC,YAAY,UAAyB;AACjC,SAAK,gBAAgB,SAAS,WAAW;AACzC,SAAK,UAAU,SAAS;AACxB,SAAK,mBAAmB,SAAS,OAAO;AACxC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,QAAQ,SAAS,OAAO;AAC7B,SAAK,mBAAmB,SAAS,OAAO,IAAI;AAC5C,SAAK,eAAe,SAAS,OAAO,IAAI;AACxC,SAAK,gBAAgB,SAAS,OAAO;AACrC,SAAK,gBAAgB,SAAS,OAAO;AACrC,SAAK,wBAAwB,SAAS,cAAc;EACxD;EAEA,MAAM,cAAc,UAA2B,QAA0B,cAAgC;AACrG,UAAM,QAA0B,CAAA;AAChC,UAAM,WAAW,KAAK,cAAc,UAAU,OAAO,QAAQ;AAE7D,UAAM,WAA+B,CAAC,SAAS,UAAS;AACpD,YAAM,iBAAiB,KAAK,mBAAmB,SAAS,KAAK;AAC7D,UAAI,gBAAgB;AAChB,cAAM,KAAK,cAAc;MAC7B;IACJ;AAEA,UAAM,sBAAsB,CAAC,YAAwB;AACjD,UAAQ,UAAU,QAAQ,OAAO,GAAG;AAChC,eAAO,QAAQ,QAAQ;MAC3B,OAAO;AACH,eAAO,QAAQ;MACnB;IACJ;AAEA,UAAM,oBAAmC,CAAA;AACzC,eAAW,WAAW,UAAU;AAC5B,YAAM,QAAQ,IACV,OAAO,QAAQ,QAAQ,EAClB,SAAS,mBAAmB,EAC5B,QAAQ,iBAAiB,EACzB,IAAI,OAAK,KAAK,cAAc,SAAS,GAAG,QAAQ,CAAC,CAAC;AAG3D,wBAAkB,KAAK,GAAG,QAAQ,QAAQ;AAE1C,UAAI,CAAC,KAAK,mBAAmB,KAAK,GAAG;AACjC;MACJ;IACJ;AAEA,WAAO,4CAAe,OAAO,KAAK,iBAAiB,KAAK,GAAG,IAAI;EACnE;;;;;;;EAQU,iBAAiB,OAAuB;AAC9C,WAAO,OAAO,KAAK,EAAE,SAAS,UAAQ,GAAG,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,EAAE,EAAE,QAAO;EAC9F;EAEU,eAAe,UAAwB,QAAc;AAC3D,UAAM,OAAO,SAAS,QAAQ;MAC1B,OAAO,sCAAS,OAAO,GAAG,CAAC;MAC3B,KAAK,SAAS,WAAW,MAAM;KAClC;AACD,UAAM,eAAe,KAAK,iBAAiB,MAAM,IAAI;AACrD,UAAM,SAAS,aAAa;AAE5B,QAAI,aAAa,eAAe,GAAG;AAC/B,YAAM,aAAa,aAAa,KAAK,OAAO;AAE5C,YAAM,yBAAyB,KAAK,4BAA4B,UAAU;AAC1E,aAAO,iBAAiB,CAAC,CAAC,sBAAsB,CAAC,GAAG,MAAM;IAC9D;AACA,UAAM,iBAAiB,CAAC,GAAG,MAAM,EAAE,OAAO,aAAa,UAAU;AACjE,UAAM,WAAW,iBAAiB,CAAC,aAAa,aAAa,IAAI,cAAY,EAAE,QAAO,EAAG,CAAC,GAAG,cAAc;AAC3G,WAAO;EACX;EAEU,4BAA4B,MAAoB;AAEtD,UAAM,QAAmB;MACrB,OAAO;MACP,YAAY;MACZ,UAAU,CAAA;;AAEd,UAAM,YAAoC;MACtC,SAAS;;AAGb,UAAM,WAAyB;MAC3B,OAAO;MACP,YAAY;MACZ,MAAM;QACF,KAAK;QACL,UAAU,KAAK;;MAEnB,WAAW,CAAA;;AAEf,UAAM,QAAmB;MACrB,OAAO;MACP,YAAY;MACZ,UAAU;QACN;QACA;;;AAGP,UAA2B,aAAa;AACxC,aAA8B,aAAa;AAC5C,WAAO;EACX;EAEU,CAAC,cAAc,UAA2B,UAAkB;AA5P1E;AA6PQ,UAAM,MAAM,SAAS,YAAY,MAAM;AACvC,QAAI,CAAC,KAAK;AACN;IACJ;AACA,UAAM,eAAe,SAAS;AAC9B,UAAM,OAAO,aAAa,QAAO;AACjC,UAAM,SAAS,aAAa,SAAS,QAAQ;AAC7C,UAAM,iBAAiB;MACnB;MACA;MACA;MACA;;AAIJ,UAAM,sBAAsB,KAAK,sBAAsB,KAAK,MAAM;AAClE,QAAI,qBAAqB;AACrB,YAAM,CAAC,WAAW,OAAO,IAAI;AAC7B,YAAM,cAAa,8BAAyB,KAAK,SAAS,MAAvC,mBAA0C;AAC7D,YAAM,iCACC,iBADD;QAEF,MAAM;QACN,aAAa;QACb,gBAAgB;QAChB,UAAU,KAAK,eAAe,cAAc,SAAS;;IAE7D;AAEA,UAAM,EAAE,gBAAgB,cAAc,oBAAoB,iBAAgB,IAAK,KAAK,oBAAoB,MAAM,MAAM;AACpH,QAAI,gBAAgB;AACpB,QAAI,UAAU,kBAAkB,uBAAuB,QAAW;AAE9D,sBAAgB;IACpB;AACA,UAAM,WAAU,8BAAyB,KAAK,aAAa,MAA3C,mBAA8C;AAC9D,QAAI,wBAAwB;AAC5B,QAAI,uBAAuB,UAAa,qBAAqB,UAAa,qBAAqB,QAAQ;AAEnG,YAAM,iCACC,iBADD;QAEF,MAAM;QACN,aAAa;QACb,gBAAgB;QAChB,UAAU,KAAK,eAAe,cAAc,kBAAkB;;AAIlE,8BAAwB,KAAK,2BACzB,UACA,KAAK,UAAU,oBAAoB,gBAAgB,GACnD,oBACA,gBAAgB;AAEpB,UAAI,uBAAuB;AAGvB,cAAM,iCACC,iBADD;UAEF,MAAM;UACN,aAAa;UACb,gBAAgB;UAChB,UAAU,KAAK,eAAe,cAAc,gBAAgB;;MAEpE;IACJ;AAEA,QAAI,CAAC,SAAS;AACV,YAAM,aAAa,aAAa,KAAK,OAAO;AAC5C,UAAI,CAAC,YAAY;AACb,cAAM,IAAI,MAAM,2BAA2B;MAC/C;AAEA,YAAM,iCACC,iBADD;QAEF,aAAa;QACb,gBAAgB;QAChB,UAAU,kBAAkB,WAAW,UAAU,EAAE,IAAI,OAAK,EAAE,EAAE,SAAS,CAAC,CAAC;;IAEnF,WAAW,uBAAuB;AAE9B,YAAM,iCACC,iBADD;QAEF,MAAM;QACN,aAAa;QACb,gBAAgB;QAChB,UAAU,KAAK,eAAe,cAAc,cAAc;;IAElE;EACJ;EAEU,2BAA2B,UAA2B,MAAc,SAAiB,MAAY;AAKvG,WAAO,WAAA,WAAA,GAAS,EAAC,KAAK,IAAI;EAC9B;EAEU,sBAAsB,KAAc,QAAc;AACxD,UAAM,gBAAgB,4BAA4B,KAAK,QAAQ,KAAK,cAAc,UAAU;AAC5F,QAAI,CAAC,eAAe;AAChB,aAAO;IACX;AAEA,UAAM,WAAW,gBAAgB,aAAa;AAC9C,QAAI,UAAU;AACV,aAAO,CAAC,SAAS,QAAQ,SAAS,GAAG;IACzC;AACA,WAAO;EACX;;;;;;EAOU,mBAAmB,OAAuB;AAChD,WAAO,MAAM,WAAW;EAC5B;;;;;;;;;;EAWU,oBAAoB,MAAc,QAAc;AACtD,UAAM,SAAS,KAAK,MAAM,SAAS,IAAI,EAAE;AACzC,QAAI,OAAO,WAAW,GAAG;AAErB,aAAO;QACH,gBAAgB;QAChB,cAAc;;IAEtB;AACA,QAAI;AACJ,eAAW,SAAS,QAAQ;AACxB,UAAI,MAAM,eAAe,QAAQ;AAG7B,eAAO;UACH,gBAAgB;UAChB,cAAc;UACd,oBAAoB,gBAAgB,cAAc,cAAc;UAChE,kBAAkB,gBAAgB,cAAc,YAAa,IAAI;;MAEzE;AACA,UAAI,MAAM,aAAc,QAAQ;AAG5B,eAAO;UACH,gBAAgB,MAAM;UACtB,cAAc,MAAM,YAAa;UACjC,oBAAoB,gBAAgB,cAAc,cAAc;UAChE,kBAAkB,gBAAgB,cAAc,YAAa,IAAI;;MAEzE;AACA,sBAAgB;IACpB;AAGA,WAAO;MACH,gBAAgB;MAChB,cAAc;MACd,oBAAoB,gBAAgB,cAAc,cAAc;MAChE,kBAAkB,gBAAgB,cAAc,YAAa,IAAI;;EAEzE;EAEU,cAAc,SAA4B,MAAmB,UAA4B;AAC/F,QAAQ,UAAU,KAAK,OAAO,GAAG;AAC7B,aAAO,KAAK,qBAAqB,SAAS,KAAK,SAAS,QAAQ;IACpE,WAAe,iBAAiB,KAAK,OAAO,KAAK,QAAQ,MAAM;AAC3D,aAAO,KAAK,4BAA4B,SAAS,MAAyC,QAAQ;IACtG;EAIJ;EAEU,4BAA4B,SAA4B,MAAuC,UAA4B;AACjI,UAAM,aAAa,mBAAmB,KAAK,SAAa,YAAY;AACpE,QAAI,OAAO,QAAQ;AACnB,QAAI,cAAc,MAAM;AACpB,UAAI,KAAK,MAAM;AAIX,eAAO;UACH,OAAO,KAAK;UACZ,YAAY;UACZ,oBAAoB,KAAK;;AAE7B,kCAA0B,KAAK,eAAe,IAAI;MACtD;AACA,UAAI;AACJ,UAAI,KAAK,QAAQ,SAAS;AACtB,oBAAY;UACR,UAAU;UACV,OAAO,CAAA;;MAEf,OAAO;AACH,oBAAY;UACR,UAAU;UACV,KAAK;;MAEb;AACA,YAAM,UAAyB;QAC3B;QACA,WAAW;QACX,UAAU,WAAW;;AAEzB,UAAI;AACA,mBAAW,aAAa,KAAK,uBAAuB,SAAS,OAAO,GAAG;AACnE,mBAAS,SAAS,KAAK,8BAA8B,WAAW,SAAS,OAAO,CAAC;QACrF;MACJ,SAAS,KAAK;AACV,gBAAQ,MAAM,GAAG;MACrB;IACJ;EACJ;;;;;;;;;;EAWU,uBAAuB,SAAwB,UAA2B;AAChF,WAAO,KAAK,cAAc,SAAS,OAAO,EAAE,eAAc;EAC9D;;;;;;;;;;;;EAaU,8BAA8B,iBAAqC,UAAyB,UAA2B;AAC7H,UAAM,OAAO,KAAK,iBAAiB,sBAAsB,eAAe;AACxE,UAAM,gBAAgB,KAAK,0BAA0B,eAAe;AACpE,WAAO;MACH;MACA;MACA;MACA,QAAQ,gBAAgB;MACxB,UAAU;;EAElB;EAEU,0BAA0B,iBAAmC;AACnE,QAAI,CAAC,gBAAgB,MAAM;AACvB,aAAO;IACX;AACA,UAAM,oBAAoB,KAAK,sBAAsB,iBAAiB,gBAAgB,IAAI;AAC1F,QAAI,CAAC,mBAAmB;AACpB,aAAO;IACX;AACA,WAAO,EAAE,MAAM,YAAY,OAAO,kBAAiB;EACvD;EAEU,qBAAqB,SAA4B,SAAsB,UAA4B;AACzG,QAAI,CAAC,KAAK,cAAc,SAAS,OAAO,GAAG;AACvC;IACJ;AACA,aAAS,SAAS;MACd,OAAO,QAAQ;MACf,MAAM,KAAK,6BAA6B,OAAO;MAC/C,QAAQ;MACR,UAAU;KACb;EACL;EAEU,6BAA6B,UAAqB;AACxD,WAAO,gDAAmB;EAC9B;EAEU,cAAc,SAA4B,SAAoB;AAEpE,WAAO,WAAA,UAAA,GAAQ,EAAC,KAAK,QAAQ,KAAK;EACtC;EAEU,mBAAmB,SAA4B,MAAyB;AAliBtF;AAmiBQ,QAAI;AACJ,QAAI,OAAO,KAAK,UAAU,UAAU;AAChC,cAAQ,KAAK;IACjB,WAAW,UAAU,MAAM;AACvB,YAAM,OAAO,KAAK,aAAa,QAAQ,KAAK,IAAI;AAChD,UAAI,CAAC,MAAM;AACP,eAAO;MACX;AACA,cAAQ;IACZ,WAAW,qBAAqB,MAAM;AAClC,cAAQ,KAAK,gBAAgB;IACjC,OAAO;AACH,aAAO;IACX;AACA,QAAI;AACJ,QAAI,SAAO,UAAK,aAAL,mBAAe,aAAY,UAAU;AAC5C,mBAAa,KAAK,SAAS;IAC/B,WAAW,OAAO,KAAK,eAAe,UAAU;AAC5C,mBAAa,KAAK;IACtB,OAAO;AACH,mBAAa;IACjB;AACA,UAAM,YAAW,UAAK,aAAL,YAAiB,KAAK,wBAAwB,SAAS,OAAO,UAAU;AACzF,QAAI,CAAC,UAAU;AACX,aAAO;IACX;AAEA,UAAM,iBAAiC;MACnC,qBAAqB,KAAK;MAC1B,SAAS,KAAK;MACd,kBAAkB,KAAK;MACvB,MAAM,KAAK;MACX,QAAQ,KAAK;MACb,eAAe,KAAK;MACpB,YAAY,KAAK;MACjB,YAAY,KAAK;MACjB,kBAAkB,KAAK;MACvB,gBAAgB,KAAK;MACrB,MAAM,KAAK;MACX,cAAc,KAAK;MACnB,WAAW,KAAK;MAChB,UAAU,KAAK;MACf,MAAM,KAAK;MACX,cAAc,KAAK;MACnB;MACA;;AAEJ,WAAO;EACX;EAEU,wBAAwB,SAA4B,OAAe,SAAe;AACxF,UAAM,UAAU,QAAQ,aAAa,QAAO;AAC5C,UAAM,aAAa,QAAQ,UAAU,QAAQ,aAAa,QAAQ,MAAM;AACxE,QAAI,KAAK,aAAa,MAAM,YAAY,KAAK,GAAG;AAC5C,YAAM,QAAQ,QAAQ,aAAa,WAAW,QAAQ,WAAW;AACjE,YAAM,MAAM,QAAQ;AACpB,aAAO;QACH;QACA,OAAO;UACH;UACA;;;IAGZ,OAAO;AACH,aAAO;IACX;EACJ;;;;;;;;Ac3kBJ,aAASC,GAAWC,IAAAA;AAClB,UAAoB,YAAA,OAATA,GACT,OAAM,IAAIC,UAAU,qCAAqCC,KAAKC,UAAUH,EAAAA,CAAAA;IAE5E;AAGA,aAASI,GAAqBJ,IAAMK,IAAAA;AAMlC,eADIC,IAJAC,KAAM,IACNC,KAAoB,GACpBC,KAAAA,IACAC,KAAO,GAEFC,KAAI,GAAGA,MAAKX,GAAKY,QAAAA,EAAUD,IAAG;AACrC,YAAIA,KAAIX,GAAKY,OACXN,CAAAA,KAAON,GAAKa,WAAWF,EAAAA;aACpB;AAAA,cAAa,OAATL,GACP;AAEAA,UAAAA,KAAO;QAAQ;AACjB,YAAa,OAATA,IAAmB;AACrB,cAAIG,OAAcE,KAAI,KAAc,MAATD,GAAAA;mBAEhBD,OAAcE,KAAI,KAAc,MAATD,IAAY;AAC5C,gBAAIH,GAAIK,SAAS,KAA2B,MAAtBJ,MAA8D,OAAnCD,GAAIM,WAAWN,GAAIK,SAAS,CAAA,KAAsD,OAAnCL,GAAIM,WAAWN,GAAIK,SAAS,CAAA;AAC1H,kBAAIL,GAAIK,SAAS,GAAG;AAClB,oBAAIE,KAAiBP,GAAIQ,YAAY,GAAA;AACrC,oBAAID,OAAmBP,GAAIK,SAAS,GAAG;AAAA,yBACjCE,MACFP,KAAM,IACNC,KAAoB,KAGpBA,MADAD,KAAMA,GAAIS,MAAM,GAAGF,EAAAA,GACKF,SAAS,IAAIL,GAAIQ,YAAY,GAAA,GAEvDN,KAAYE,IACZD,KAAO;AACP;gBACF;cACF,WAA0B,MAAfH,GAAIK,UAA+B,MAAfL,GAAIK,QAAc;AAC/CL,gBAAAA,KAAM,IACNC,KAAoB,GACpBC,KAAYE,IACZD,KAAO;AACP;cACF;;AAEEL,YAAAA,OACEE,GAAIK,SAAS,IACfL,MAAO,QAEPA,KAAM,MACRC,KAAoB;UAExB,MACMD,CAAAA,GAAIK,SAAS,IACfL,MAAO,MAAMP,GAAKgB,MAAMP,KAAY,GAAGE,EAAAA,IAEvCJ,KAAMP,GAAKgB,MAAMP,KAAY,GAAGE,EAAAA,GAClCH,KAAoBG,KAAIF,KAAY;AAEtCA,UAAAA,KAAYE,IACZD,KAAO;QACT,MAAoB,QAATJ,MAAAA,OAAqBI,KAAAA,EAC5BA,KAEFA,KAAAA;MAEJ;AACA,aAAOH;IACT;AAcA,QAAIU,KAAQ,EAEVC,SAAS,WAAA;AAKP,eAFIC,IAFAC,KAAe,IACfC,KAAAA,OAGKV,KAAIW,UAAUV,SAAS,GAAGD,MAAAA,MAAM,CAAMU,IAAkBV,MAAK;AACpE,YAAIX;AACAW,QAAAA,MAAK,IACPX,KAAOsB,UAAUX,EAAAA,KAAAA,WAEbQ,OACFA,KAAMI,QAAQJ,IAAAA,IAChBnB,KAAOmB,KAGTpB,GAAWC,EAAAA,GAGS,MAAhBA,GAAKY,WAITQ,KAAepB,KAAO,MAAMoB,IAC5BC,KAA0C,OAAvBrB,GAAKa,WAAW,CAAA;MACrC;AAQA,aAFAO,KAAehB,GAAqBgB,IAAAA,CAAeC,EAAAA,GAE/CA,KACED,GAAaR,SAAS,IACjB,MAAMQ,KAEN,MACAA,GAAaR,SAAS,IACxBQ,KAEA;IAEX,GAEAI,WAAW,SAAmBxB,IAAAA;AAG5B,UAFAD,GAAWC,EAAAA,GAES,MAAhBA,GAAKY,OAAc,QAAO;AAE9B,UAAIa,KAAoC,OAAvBzB,GAAKa,WAAW,CAAA,GAC7Ba,KAAyD,OAArC1B,GAAKa,WAAWb,GAAKY,SAAS,CAAA;AAQtD,aAHoB,OAFpBZ,KAAOI,GAAqBJ,IAAAA,CAAOyB,EAAAA,GAE1Bb,UAAiBa,OAAYzB,KAAO,MACzCA,GAAKY,SAAS,KAAKc,OAAmB1B,MAAQ,MAE9CyB,KAAmB,MAAMzB,KACtBA;IACT,GAEAyB,YAAY,SAAoBzB,IAAAA;AAE9B,aADAD,GAAWC,EAAAA,GACJA,GAAKY,SAAS,KAA4B,OAAvBZ,GAAKa,WAAW,CAAA;IAC5C,GAEAc,MAAM,WAAA;AACJ,UAAyB,MAArBL,UAAUV,OACZ,QAAO;AAET,eADIgB,IACKjB,KAAI,GAAGA,KAAIW,UAAUV,QAAAA,EAAUD,IAAG;AACzC,YAAIkB,KAAMP,UAAUX,EAAAA;AACpBZ,QAAAA,GAAW8B,EAAAA,GACPA,GAAIjB,SAAS,MAAA,WACXgB,KACFA,KAASC,KAETD,MAAU,MAAMC;MAEtB;AACA,aAAA,WAAID,KACK,MACFX,GAAMO,UAAUI,EAAAA;IACzB,GAEAE,UAAU,SAAkBC,IAAMC,IAAAA;AAIhC,UAHAjC,GAAWgC,EAAAA,GACXhC,GAAWiC,EAAAA,GAEPD,OAASC,GAAI,QAAO;AAKxB,WAHAD,KAAOd,GAAMC,QAAQa,EAAAA,QACrBC,KAAKf,GAAMC,QAAQc,EAAAA,GAEF,QAAO;AAIxB,eADIC,KAAY,GACTA,KAAYF,GAAKnB,UACa,OAA/BmB,GAAKlB,WAAWoB,EAAAA,GAAAA,EADYA,GAAAA;AASlC,eALIC,KAAUH,GAAKnB,QACfuB,KAAUD,KAAUD,IAGpBG,KAAU,GACPA,KAAUJ,GAAGpB,UACa,OAA3BoB,GAAGnB,WAAWuB,EAAAA,GAAAA,EADUA,GAAAA;AAW9B,eANIC,KADQL,GAAGpB,SACKwB,IAGhBxB,KAASuB,KAAUE,KAAQF,KAAUE,IACrCC,KAAAA,IACA3B,KAAI,GACDA,MAAKC,IAAAA,EAAUD,IAAG;AACvB,YAAIA,OAAMC,IAAQ;AAChB,cAAIyB,KAAQzB,IAAQ;AAClB,gBAAmC,OAA/BoB,GAAGnB,WAAWuB,KAAUzB,EAAAA,EAG1B,QAAOqB,GAAGhB,MAAMoB,KAAUzB,KAAI,CAAA;AACzB,gBAAU,MAANA,GAGT,QAAOqB,GAAGhB,MAAMoB,KAAUzB,EAAAA;UAE9B,MAAWwB,CAAAA,KAAUvB,OACoB,OAAnCmB,GAAKlB,WAAWoB,KAAYtB,EAAAA,IAG9B2B,KAAgB3B,KACD,MAANA,OAGT2B,KAAgB;AAGpB;QACF;AACA,YAAIC,KAAWR,GAAKlB,WAAWoB,KAAYtB,EAAAA;AAE3C,YAAI4B,OADSP,GAAGnB,WAAWuB,KAAUzB,EAAAA,EAEnC;AACoB,eAAb4B,OACPD,KAAgB3B;MACpB;AAEA,UAAI6B,KAAM;AAGV,WAAK7B,KAAIsB,KAAYK,KAAgB,GAAG3B,MAAKuB,IAAAA,EAAWvB,GAClDA,CAAAA,OAAMuB,MAAkC,OAAvBH,GAAKlB,WAAWF,EAAAA,MAChB,MAAf6B,GAAI5B,SACN4B,MAAO,OAEPA,MAAO;AAMb,aAAIA,GAAI5B,SAAS,IACR4B,KAAMR,GAAGhB,MAAMoB,KAAUE,EAAAA,KAEhCF,MAAWE,IACoB,OAA3BN,GAAGnB,WAAWuB,EAAAA,KAAAA,EACdA,IACGJ,GAAGhB,MAAMoB,EAAAA;IAEpB,GAEAK,WAAW,SAAmBzC,IAAAA;AAC5B,aAAOA;IACT,GAEA0C,SAAS,SAAiB1C,IAAAA;AAExB,UADAD,GAAWC,EAAAA,GACS,MAAhBA,GAAKY,OAAc,QAAO;AAK9B,eAJIN,KAAON,GAAKa,WAAW,CAAA,GACvB8B,KAAmB,OAATrC,IACVsC,KAAAA,IACAC,KAAAA,MACKlC,KAAIX,GAAKY,SAAS,GAAGD,MAAK,GAAA,EAAKA,GAEtC,KAAa,QADbL,KAAON,GAAKa,WAAWF,EAAAA,IAAAA;AAEnB,YAAA,CAAKkC,IAAc;AACjBD,UAAAA,KAAMjC;AACN;QACF;MAAA,MAGFkC,CAAAA,KAAAA;AAIJ,aAAA,OAAID,KAAmBD,KAAU,MAAM,MACnCA,MAAmB,MAARC,KAAkB,OAC1B5C,GAAKgB,MAAM,GAAG4B,EAAAA;IACvB,GAEAE,UAAU,SAAkB9C,IAAM+C,IAAAA;AAChC,UAAA,WAAIA,MAAoC,YAAA,OAARA,GAAkB,OAAM,IAAI9C,UAAU,iCAAA;AACtEF,MAAAA,GAAWC,EAAAA;AAEX,UAGIW,IAHAqC,KAAQ,GACRJ,KAAAA,IACAC,KAAAA;AAGJ,UAAA,WAAIE,MAAqBA,GAAInC,SAAS,KAAKmC,GAAInC,UAAUZ,GAAKY,QAAQ;AACpE,YAAImC,GAAInC,WAAWZ,GAAKY,UAAUmC,OAAQ/C,GAAM,QAAO;AACvD,YAAIiD,KAASF,GAAInC,SAAS,GACtBsC,KAAAA;AACJ,aAAKvC,KAAIX,GAAKY,SAAS,GAAGD,MAAK,GAAA,EAAKA,IAAG;AACrC,cAAIL,KAAON,GAAKa,WAAWF,EAAAA;AAC3B,cAAa,OAATL,IAAAA;AAGA,gBAAA,CAAKuC,IAAc;AACjBG,cAAAA,KAAQrC,KAAI;AACZ;YACF;UAAA,MAAA,QAEEuC,OAGFL,KAAAA,OACAK,KAAmBvC,KAAI,IAErBsC,MAAU,MAER3C,OAASyC,GAAIlC,WAAWoC,EAAAA,IAAAA,MACR,EAAZA,OAGJL,KAAMjC,OAKRsC,KAAAA,IACAL,KAAMM;QAId;AAGA,eADIF,OAAUJ,KAAKA,KAAMM,KAAAA,OAA0BN,OAAYA,KAAM5C,GAAKY,SACnEZ,GAAKgB,MAAMgC,IAAOJ,EAAAA;MAC3B;AACE,WAAKjC,KAAIX,GAAKY,SAAS,GAAGD,MAAK,GAAA,EAAKA,GAClC,KAA2B,OAAvBX,GAAKa,WAAWF,EAAAA,GAAAA;AAGhB,YAAA,CAAKkC,IAAc;AACjBG,UAAAA,KAAQrC,KAAI;AACZ;QACF;MAAA,MAAA,QACSiC,OAGXC,KAAAA,OACAD,KAAMjC,KAAI;AAId,aAAA,OAAIiC,KAAmB,KAChB5C,GAAKgB,MAAMgC,IAAOJ,EAAAA;IAE7B,GAEAO,SAAS,SAAiBnD,IAAAA;AACxBD,MAAAA,GAAWC,EAAAA;AAQX,eAPIoD,KAAAA,IACAC,KAAY,GACZT,KAAAA,IACAC,KAAAA,MAGAS,KAAc,GACT3C,KAAIX,GAAKY,SAAS,GAAGD,MAAK,GAAA,EAAKA,IAAG;AACzC,YAAIL,KAAON,GAAKa,WAAWF,EAAAA;AAC3B,YAAa,OAATL,GAAAA,QASAsC,OAGFC,KAAAA,OACAD,KAAMjC,KAAI,IAEC,OAATL,KAAAA,OAEI8C,KACFA,KAAWzC,KACY,MAAhB2C,OACPA,KAAc,KAAA,OACTF,OAGTE,KAAAA;iBArBE,CAAKT,IAAc;AACjBQ,UAAAA,KAAY1C,KAAI;AAChB;QACF;MAoBN;AAEA,aAAA,OAAIyC,MAAAA,OAAmBR,MAEH,MAAhBU,MAEgB,MAAhBA,MAAqBF,OAAaR,KAAM,KAAKQ,OAAaC,KAAY,IACjE,KAEFrD,GAAKgB,MAAMoC,IAAUR,EAAAA;IAC9B,GAEAW,QAAQ,SAAgBC,IAAAA;AACtB,UAAmB,SAAfA,MAA6C,YAAA,OAAfA,GAChC,OAAM,IAAIvD,UAAU,qEAAA,OAA4EuD,EAAAA;AAElG,cAvVJ,SAAiBC,IAAKD,IAAAA;AACpB,YAAIE,KAAMF,GAAWE,OAAOF,GAAWG,MACnCC,KAAOJ,GAAWI,SAASJ,GAAWK,QAAQ,OAAOL,GAAWT,OAAO;AAC3E,eAAKW,KAGDA,OAAQF,GAAWG,OACdD,KAAME,KAERF,KA8UU,MA9UEE,KALVA;MAMX,GA6UmB,GAAKJ,EAAAA;IACtB,GAEAM,OAAO,SAAe9D,IAAAA;AACpBD,MAAAA,GAAWC,EAAAA;AAEX,UAAI+D,KAAM,EAAEJ,MAAM,IAAID,KAAK,IAAIE,MAAM,IAAIb,KAAK,IAAIc,MAAM,GAAA;AACxD,UAAoB,MAAhB7D,GAAKY,OAAc,QAAOmD;AAC9B,UAEIf,IAFA1C,KAAON,GAAKa,WAAW,CAAA,GACvBY,KAAsB,OAATnB;AAEbmB,MAAAA,MACFsC,GAAIJ,OAAO,KACXX,KAAQ,KAERA,KAAQ;AAaV,eAXII,KAAAA,IACAC,KAAY,GACZT,KAAAA,IACAC,KAAAA,MACAlC,KAAIX,GAAKY,SAAS,GAIlB0C,KAAc,GAGX3C,MAAKqC,IAAAA,EAASrC,GAEnB,KAAa,QADbL,KAAON,GAAKa,WAAWF,EAAAA,GAAAA,QAUnBiC,OAGFC,KAAAA,OACAD,KAAMjC,KAAI,IAEC,OAATL,KAAAA,OAEI8C,KAAiBA,KAAWzC,KAA2B,MAAhB2C,OAAmBA,KAAc,KAAA,OACnEF,OAGXE,KAAAA;eAlBE,CAAKT,IAAc;AACjBQ,QAAAA,KAAY1C,KAAI;AAChB;MACF;AAwCN,aAAA,OArBIyC,MAAAA,OAAmBR,MAEP,MAAhBU,MAEgB,MAAhBA,MAAqBF,OAAaR,KAAM,KAAKQ,OAAaC,KAAY,IAAA,OAChET,OACiCmB,GAAIH,OAAOG,GAAIF,OAAhC,MAAdR,MAAmB5B,KAAkCzB,GAAKgB,MAAM,GAAG4B,EAAAA,IAAgC5C,GAAKgB,MAAMqC,IAAWT,EAAAA,MAG7G,MAAdS,MAAmB5B,MACrBsC,GAAIF,OAAO7D,GAAKgB,MAAM,GAAGoC,EAAAA,GACzBW,GAAIH,OAAO5D,GAAKgB,MAAM,GAAG4B,EAAAA,MAEzBmB,GAAIF,OAAO7D,GAAKgB,MAAMqC,IAAWD,EAAAA,GACjCW,GAAIH,OAAO5D,GAAKgB,MAAMqC,IAAWT,EAAAA,IAEnCmB,GAAIhB,MAAM/C,GAAKgB,MAAMoC,IAAUR,EAAAA,IAG7BS,KAAY,IAAGU,GAAIL,MAAM1D,GAAKgB,MAAM,GAAGqC,KAAY,CAAA,IAAY5B,OAAYsC,GAAIL,MAAM,MAElFK;IACT,GAEAN,KAAK,KACLO,WAAW,KACXC,OAAO,MACPhD,OAAO,KAAA;AAGTA,IAAAA,GAAMA,QAAQA,IAEdiD,GAAOC,UAAUlD;EAAAA,EAAAA,GC/gBbmD,IAA2B,CAAC;AAGhC,WAASC,EAAoBC,IAAAA;AAE5B,QAAIC,KAAeH,EAAyBE,EAAAA;AAC5C,QAAA,WAAIC,GACH,QAAOA,GAAaJ;AAGrB,QAAID,KAASE,EAAyBE,EAAAA,IAAY,EAGjDH,SAAS,CAAC,EAAA;AAOX,WAHAK,EAAoBF,EAAAA,EAAUJ,IAAQA,GAAOC,SAASE,CAAAA,GAG/CH,GAAOC;EACf;ACrBAE,IAAoBI,IAAI,CAACN,IAASO,OAAAA;AACjC,aAAQC,MAAOD,GACXL,GAAoBO,EAAEF,IAAYC,EAAAA,KAAAA,CAASN,EAAoBO,EAAET,IAASQ,EAAAA,KAC5EE,OAAOC,eAAeX,IAASQ,IAAK,EAAEI,YAAAA,MAAkBC,KAAKN,GAAWC,EAAAA,EAAAA,CAAAA;EAE1E,GCNDN,EAAoBO,IAAI,CAACK,IAAKC,OAAUL,OAAOM,UAAUC,eAAeC,KAAKJ,IAAKC,EAAAA,GCClFb,EAAoBiB,IAAKnB,CAAAA,OAAAA;AACH,mBAAA,OAAXoB,UAA0BA,OAAOC,eAC1CX,OAAOC,eAAeX,IAASoB,OAAOC,aAAa,EAAEC,OAAO,SAAA,CAAA,GAE7DZ,OAAOC,eAAeX,IAAS,cAAc,EAAEsB,OAAAA,KAAO,CAAA;EAAO;AAAA,MAAA,IAAA,CAAA;ACQvD,MAAIC;AAEX,MAAA,EAAA,EAAA,CAAA,GAAA,EAAA,EAAA,GAAA,EAAA,KAAA,MAAA,GAAA,OAAA,MAAA,EAAA,CAAA,GAAuB,YAAA,OAAZnE,QACVmE,KAAiC,YAArBnE,QAAQoE;WACW,YAAA,OAAdC,WAAwB;AACzC,QAAIC,KAAYD,UAAUC;AAC1BH,QAAYG,GAAUC,QAAQ,SAAA,KAAc;EAAA;ACV7C,QAAMC,IAAiB,kBACjBC,IAAoB,OACpBC,IAAoB;AAE1B,WAASC,GAAanC,IAAUoC,IAAAA;AAG/B,QAAA,CAAKpC,GAAIqC,UAAUD,GAClB,OAAM,IAAIE,MAAM,2DAA2DtC,GAAIuC,SAAAA,aAAsBvC,GAAI/D,IAAAA,cAAkB+D,GAAIwC,KAAAA,iBAAsBxC,GAAIyC,QAAAA,IAAAA;AAK1J,QAAIzC,GAAIqC,UAAAA,CAAWL,EAAeU,KAAK1C,GAAIqC,MAAAA,EAC1C,OAAM,IAAIC,MAAM,iDAAA;AAQjB,QAAItC,GAAI/D;AACP,UAAI+D,GAAIuC,WAAAA;AACP,YAAA,CAAKN,EAAkBS,KAAK1C,GAAI/D,IAAAA,EAC/B,OAAM,IAAIqG,MAAM,0IAAA;MAAA,WAGbJ,EAAkBQ,KAAK1C,GAAI/D,IAAAA,EAC9B,OAAM,IAAIqG,MAAM,2HAAA;;EAIpB;AAkCA,QAAMK,IAAS,IACTC,IAAS,KACTC,IAAU;EAkBT,MAAMC,EAAAA;IA2DZ,YAAsBC,IAAsCR,IAAoBtG,IAAeuG,IAAgBC,IAAmBL,KAAAA,OAAmB;AApC5IC;AAMAE;AAKAtG;AAKAuG;AAKAC;AAiBoB,kBAAA,OAAjBM,MACVC,KAAKX,SAASU,GAAaV,UAAUM,GACrCK,KAAKT,YAAYQ,GAAaR,aAAaI,GAC3CK,KAAK/G,OAAO8G,GAAa9G,QAAQ0G,GACjCK,KAAKR,QAAQO,GAAaP,SAASG,GACnCK,KAAKP,WAAWM,GAAaN,YAAYE,MAKzCK,KAAKX,SAvHR,0BAAoBA,IAAgBD,IAAAA;AACnC,eAAKC,MAAWD,KAGTC,KAFC;MAGT,GAkH4BU,IAAcX,EAAAA,GACvCY,KAAKT,YAAYA,MAAaI,GAC9BK,KAAK/G,QAjHR,SAA8BoG,IAAgBpG,IAAAA;AAM7C,gBAAQoG,IAAAA;UACP,KAAK;UACL,KAAK;UACL,KAAK;AACCpG,YAAAA,KAEMA,GAAK,CAAA,MAAO2G,MACtB3G,KAAO2G,IAAS3G,MAFhBA,KAAO2G;QAAAA;AAMV,eAAO3G;MACR,GA+FoC+G,KAAKX,QAAQpG,MAAQ0G,CAAAA,GACtDK,KAAKR,QAAQA,MAASG,GACtBK,KAAKP,WAAWA,MAAYE,GAE5BR,GAAaa,MAAMZ,EAAAA;IAErB;IA7EA,OAAA,MAAaa,IAAAA;AACZ,aAAIA,cAAiBH,KAAAA,CAAAA,CAGhBG,MAGoC,YAAA,OAArBA,GAAOV,aACU,YAAA,OAApBU,GAAOR,YACS,YAAA,OAAhBQ,GAAOhH,QACU,YAAA,OAAjBgH,GAAOT,SACW,YAAA,OAAlBS,GAAOZ,UACW,YAAA,OAAlBY,GAAOC,UACS,cAAA,OAAhBD,GAAOE,QACa,cAAA,OAApBF,GAAOG;IACzB;IA0FA,IAAA,SAAIF;AAIH,aAAOG,EAAYL,MAAAA,KAAM;IAC1B;IAIA,KAAKM,IAAAA;AAEJ,UAAA,CAAKA,GACJ,QAAON;AAGR,UAAA,EAAI,QAAEX,IAAM,WAAEE,IAAS,MAAEtG,IAAI,OAAEuG,IAAK,UAAEC,GAAAA,IAAaa;AA2BnD,aAAA,WA1BIjB,KACHA,KAASW,KAAKX,SACO,SAAXA,OACVA,KAASM,IAAAA,WAENJ,KACHA,KAAYS,KAAKT,YACO,SAAdA,OACVA,KAAYI,IAAAA,WAET1G,KACHA,KAAO+G,KAAK/G,OACO,SAATA,OACVA,KAAO0G,IAAAA,WAEJH,KACHA,KAAQQ,KAAKR,QACO,SAAVA,OACVA,KAAQG,IAAAA,WAELF,KACHA,KAAWO,KAAKP,WACO,SAAbA,OACVA,KAAWE,IAGRN,OAAWW,KAAKX,UAChBE,OAAcS,KAAKT,aACnBtG,OAAS+G,KAAK/G,QACduG,OAAUQ,KAAKR,SACfC,OAAaO,KAAKP,WAEdO,OAGD,IAAIO,EAAIlB,IAAQE,IAAWtG,IAAMuG,IAAOC,EAAAA;IAChD;IAUA,OAAA,MAAaf,IAAeU,KAAAA,OAAmB;AAC9C,YAAMoB,KAAQX,EAAQY,KAAK/B,EAAAA;AAC3B,aAAK8B,KAGE,IAAID,EACVC,GAAM,CAAA,KAAMb,GACZe,EAAcF,GAAM,CAAA,KAAMb,CAAAA,GAC1Be,EAAcF,GAAM,CAAA,KAAMb,CAAAA,GAC1Be,EAAcF,GAAM,CAAA,KAAMb,CAAAA,GAC1Be,EAAcF,GAAM,CAAA,KAAMb,CAAAA,GAC1BP,EAAAA,IARO,IAAImB,EAAIZ,GAAQA,GAAQA,GAAQA,GAAQA,CAAAA;IAUjD;IAuBA,OAAA,KAAY1G,IAAAA;AAEX,UAAIsG,KAAYI;AAWhB,UANIhB,MACH1F,KAAOA,GAAK0H,QAAQ,OAAOf,CAAAA,IAKxB3G,GAAK,CAAA,MAAO2G,KAAU3G,GAAK,CAAA,MAAO2G,GAAQ;AAC7C,cAAMgB,KAAM3H,GAAK8F,QAAQa,GAAQ,CAAA;AAAA,eAC7BgB,MACHrB,KAAYtG,GAAK4H,UAAU,CAAA,GAC3B5H,KAAO2G,MAEPL,KAAYtG,GAAK4H,UAAU,GAAGD,EAAAA,GAC9B3H,KAAOA,GAAK4H,UAAUD,EAAAA,KAAQhB;MAAAA;AAIhC,aAAO,IAAIW,EAAI,QAAQhB,IAAWtG,IAAM0G,GAAQA,CAAAA;IACjD;IAEA,OAAA,KAAYmB,IAAAA;AACX,YAAMC,KAAS,IAAIR,EAClBO,GAAWzB,QACXyB,GAAWvB,WACXuB,GAAW7H,MACX6H,GAAWtB,OACXsB,GAAWrB,QAAAA;AAGZ,aADAN,GAAa4B,IAAAA,IAAQ,GACdA;IACR;IAeA,SAASC,KAAAA,OAAwB;AAChC,aAAOC,EAAajB,MAAMgB,EAAAA;IAC3B;IAEA,SAAAE;AACC,aAAOlB;IACR;IAMA,OAAA,OAAcmB,IAAAA;AACb,UAAKA,IAEE;AAAA,YAAIA,cAAgBrB,EAC1B,QAAOqB;AACD;AACN,gBAAMJ,KAAS,IAAIR,EAAIY,EAAAA;AAGvB,iBAFAJ,GAAOK,aAAwBD,GAAME,UACrCN,GAAOO,UAAqBH,GAAMI,SAASC,IAA4BL,GAAMjB,SAAS,MAC/Ea;QAAAA;MAAAA;AAPP,aAAYI;IASd;EAAA;AAkBD,QAAMK,IAAiB7C,IAAY,IAAA;EAGnC,MAAM4B,UAAYT,EAAAA;IAAlB;;AAECsB,wCAA4B;AAC5BE,qCAAyB;;IAEzB,IAAA,SAAapB;AAIZ,aAHKF,KAAKsB,YACTtB,KAAKsB,UAAUjB,EAAYL,MAAAA,KAAM,IAE3BA,KAAKsB;IACb;IAES,SAASN,KAAAA,OAAwB;AACzC,aAAKA,KAOGC,EAAajB,MAAAA,IAAM,KANrBA,KAAKoB,eACTpB,KAAKoB,aAAaH,EAAajB,MAAAA,KAAM,IAE/BA,KAAKoB;IAKd;IAES,SAAAF;AACR,YAAM1H,KAAgB,EACrBiI,MAAM,EAAA;AA0BP,aAvBIzB,KAAKsB,YACR9H,GAAI0G,SAASF,KAAKsB,SAClB9H,GAAI+H,OAAOC,IAERxB,KAAKoB,eACR5H,GAAI6H,WAAWrB,KAAKoB,aAGjBpB,KAAK/G,SACRO,GAAIP,OAAO+G,KAAK/G,OAEb+G,KAAKX,WACR7F,GAAI6F,SAASW,KAAKX,SAEfW,KAAKT,cACR/F,GAAI+F,YAAYS,KAAKT,YAElBS,KAAKR,UACRhG,GAAIgG,QAAQQ,KAAKR,QAEdQ,KAAKP,aACRjG,GAAIiG,WAAWO,KAAKP,WAEdjG;IACR;EAAA;AAID,QAAMkI,IAAwC,EAC7C,IAAkB,OAClB,IAAkB,OAClB,IAAyB,OACzB,IAAiB,OACjB,IAA8B,OAC9B,IAA+B,OAC/B,IAAmB,OAEnB,IAA4B,OAC5B,IAAuB,OACvB,IAAsB,OACtB,IAAwB,OACxB,IAAsB,OACtB,IAAuB,OACvB,IAAqB,OACrB,IAAiB,OACjB,IAAkB,OAClB,IAAsB,OACtB,IAAmB,OAEnB,IAAkB,MAAA;AAGnB,WAASC,EAAuBC,IAAsBC,IAAiBC,IAAAA;AACtE,QAAItI,IACAuI,KAAAA;AAEJ,aAASC,KAAM,GAAGA,KAAMJ,GAAa/H,QAAQmI,MAAO;AACnD,YAAMzI,KAAOqI,GAAa9H,WAAWkI,EAAAA;AAGrC,UACEzI,MAAQ,MAAcA,MAAQ,OAC3BA,MAAQ,MAAcA,MAAQ,MAC9BA,MAAQ,MAAmBA,MAAQ,MAC3B,OAATA,MACS,OAATA,MACS,OAATA,MACS,QAATA,MACCsI,MAAmB,OAATtI,MACVuI,MAAwB,OAATvI,MACfuI,MAAwB,OAATvI,MACfuI,MAAwB,OAATvI,GAAAA,QAGfwI,OACHvI,MAAOyI,mBAAmBL,GAAaf,UAAUkB,IAAiBC,EAAAA,CAAAA,GAClED,KAAAA,KAAmB,WAGhBvI,OACHA,MAAOoI,GAAaM,OAAOF,EAAAA;WAGtB;AAAA,mBAEFxI,OACHA,KAAMoI,GAAaO,OAAO,GAAGH,EAAAA;AAI9B,cAAMI,KAAUV,EAAYnI,EAAAA;AAAAA,mBACxB6I,MAAAA,OAGCL,OACHvI,MAAOyI,mBAAmBL,GAAaf,UAAUkB,IAAiBC,EAAAA,CAAAA,GAClED,KAAAA,KAIDvI,MAAO4I,MAAAA,OAEGL,OAEVA,KAAkBC;MAAAA;IAAAA;AASrB,WAAA,OAJID,OACHvI,MAAOyI,mBAAmBL,GAAaf,UAAUkB,EAAAA,CAAAA,IAAAA,WAG3CvI,KAAoBA,KAAMoI;EAClC;AAEA,WAASS,EAA0BpJ,IAAAA;AAClC,QAAIO;AACJ,aAASwI,KAAM,GAAGA,KAAM/I,GAAKY,QAAQmI,MAAO;AAC3C,YAAMzI,KAAON,GAAKa,WAAWkI,EAAAA;AAChB,aAATzI,MAAmC,OAATA,MAAAA,WACzBC,OACHA,KAAMP,GAAKkJ,OAAO,GAAGH,EAAAA,IAEtBxI,MAAOkI,EAAYnI,EAAAA,KAAAA,WAEfC,OACHA,MAAOP,GAAK+I,EAAAA;IAAAA;AAIf,WAAA,WAAOxI,KAAoBA,KAAMP;EAClC;AAKO,WAASoH,EAAYiC,IAAUC,IAAAA;AAErC,QAAI7D;AAsBJ,WAnBCA,KAFG4D,GAAI/C,aAAa+C,GAAIrJ,KAAKY,SAAS,KAAoB,WAAfyI,GAAIjD,SAEvC,KAAKiD,GAAI/C,SAAAA,GAAY+C,GAAIrJ,IAAAA,KAEN,OAA3BqJ,GAAIrJ,KAAKa,WAAW,CAAA,MAChBwI,GAAIrJ,KAAKa,WAAW,CAAA,KAAM,MAAcwI,GAAIrJ,KAAKa,WAAW,CAAA,KAAM,MAAcwI,GAAIrJ,KAAKa,WAAW,CAAA,KAAM,MAAcwI,GAAIrJ,KAAKa,WAAW,CAAA,KAAM,QACxH,OAA3BwI,GAAIrJ,KAAKa,WAAW,CAAA,IAElByI,KAIID,GAAIrJ,KAAKkJ,OAAO,CAAA,IAFhBG,GAAIrJ,KAAK,CAAA,EAAGuJ,YAAAA,IAAgBF,GAAIrJ,KAAKkJ,OAAO,CAAA,IAM7CG,GAAIrJ,MAET0F,MACHD,KAAQA,GAAMiC,QAAQ,OAAO,IAAA,IAEvBjC;EACR;AAKA,WAASuC,EAAaqB,IAAUtB,IAAAA;AAE/B,UAAMyB,KAAWzB,KAEdqB,IADAV;AAGH,QAAInI,KAAM,IAAA,EACN,QAAE6F,IAAM,WAAEE,IAAS,MAAEtG,IAAI,OAAEuG,IAAK,UAAEC,GAAAA,IAAa6C;AASnD,QARIjD,OACH7F,MAAO6F,IACP7F,MAAO,OAEJ+F,MAAwB,WAAXF,QAChB7F,MAAOoG,GACPpG,MAAOoG,IAEJL,IAAW;AACd,UAAIqB,KAAMrB,GAAUR,QAAQ,GAAA;AAC5B,UAAA,OAAI6B,IAAY;AAEf,cAAM8B,KAAWnD,GAAU4C,OAAO,GAAGvB,EAAAA;AACrCrB,QAAAA,KAAYA,GAAU4C,OAAOvB,KAAM,CAAA,GACnCA,KAAM8B,GAAS1I,YAAY,GAAA,GAAA,OACvB4G,KACHpH,MAAOiJ,GAAQC,IAAAA,OAAU,KAAO,KAGhClJ,MAAOiJ,GAAQC,GAASP,OAAO,GAAGvB,EAAAA,GAAAA,OAAM,KAAO,GAC/CpH,MAAO,KACPA,MAAOiJ,GAAQC,GAASP,OAAOvB,KAAM,CAAA,GAAA,OAAI,IAAO,IAEjDpH,MAAO;MAAA;AAER+F,MAAAA,KAAYA,GAAUiD,YAAAA,GACtB5B,KAAMrB,GAAUvF,YAAY,GAAA,GAAA,OACxB4G,KACHpH,MAAOiJ,GAAQlD,IAAAA,OAAW,IAAO,KAGjC/F,MAAOiJ,GAAQlD,GAAU4C,OAAO,GAAGvB,EAAAA,GAAAA,OAAM,IAAO,GAChDpH,MAAO+F,GAAU4C,OAAOvB,EAAAA;IAAAA;AAG1B,QAAI3H,IAAM;AAET,UAAIA,GAAKY,UAAU,KAA4B,OAAvBZ,GAAKa,WAAW,CAAA,KAAgD,OAAvBb,GAAKa,WAAW,CAAA,GAAuB;AACvG,cAAMP,KAAON,GAAKa,WAAW,CAAA;AACzBP,QAAAA,MAAQ,MAAcA,MAAQ,OACjCN,KAAO,IAAI0J,OAAOC,aAAarJ,KAAO,EAAA,CAAA,IAAON,GAAKkJ,OAAO,CAAA,CAAA;MAAA,WAEhDlJ,GAAKY,UAAU,KAA4B,OAAvBZ,GAAKa,WAAW,CAAA,GAAuB;AACrE,cAAMP,KAAON,GAAKa,WAAW,CAAA;AACzBP,QAAAA,MAAQ,MAAcA,MAAQ,OACjCN,KAAO,GAAG0J,OAAOC,aAAarJ,KAAO,EAAA,CAAA,IAAON,GAAKkJ,OAAO,CAAA,CAAA;MAAA;AAI1D3I,MAAAA,MAAOiJ,GAAQxJ,IAAAA,MAAM,KAAM;IAAA;AAU5B,WARIuG,OACHhG,MAAO,KACPA,MAAOiJ,GAAQjD,IAAAA,OAAO,KAAO,IAE1BC,OACHjG,MAAO,KACPA,MAAQwH,KAAgEvB,KAAjDkC,EAAuBlC,IAAAA,OAAU,KAAO,IAEzDjG;EACR;AAIA,WAASqJ,EAA2BC,IAAAA;AACnC,QAAA;AACC,aAAOC,mBAAmBD,EAAAA;IAAAA,SACzBE,IAAA;AACD,aAAIF,GAAIjJ,SAAS,IACTiJ,GAAIX,OAAO,GAAG,CAAA,IAAKU,EAA2BC,GAAIX,OAAO,CAAA,CAAA,IAEzDW;IAAAA;EAGV;AAEA,QAAMG,KAAiB;AAEvB,WAASvC,EAAcoC,IAAAA;AACtB,WAAKA,GAAItC,MAAMyC,EAAAA,IAGRH,GAAInC,QAAQsC,KAAiBzC,CAAAA,OAAUqC,EAA2BrC,EAAAA,EAAAA,IAFjEsC;EAGT;AAAA,MAAA,IAAA,EAAA,GAAA;ACjqBA,QAAMI,IAAY,EAAA,SAAkB,GAC9BC,KAAQ;AAEP,MAAUC;AAAAA,IAAjB,SAAiBA,IAAAA;AAeG,IAAAC,GAAAC,WAAhB,SAAyBhB,OAAaiB,IAAAA;AAClC,aAAOjB,GAAInC,KAAK,EAAElH,MAAMiK,EAAUtI,KAAK0H,GAAIrJ,MAAAA,GAASsK,EAAAA,EAAAA,CAAAA;IACxD,GAgBgBF,GAAAG,cAAhB,SAA4BlB,OAAaiB,IAAAA;AACrC,UAAItK,KAAOqJ,GAAIrJ,MACXwK,KAAAA;AACAxK,MAAAA,GAAK,CAAA,MAAOkK,OACZlK,KAAOkK,KAAQlK,IACfwK,KAAAA;AAEJ,UAAIpJ,KAAe6I,EAAU/I,QAAQlB,IAAAA,GAASsK,EAAAA;AAI9C,aAHIE,MAAcpJ,GAAa,CAAA,MAAO8I,MAAAA,CAAUb,GAAI/C,cAChDlF,KAAeA,GAAawG,UAAU,CAAA,IAEnCyB,GAAInC,KAAK,EAAElH,MAAMoB,GAAAA,CAAAA;IAC5B,GAUgBgJ,GAAA1H,UAAhB,SAAwB2G,IAAAA;AACpB,UAAwB,MAApBA,GAAIrJ,KAAKY,UAAgByI,GAAIrJ,SAASkK,GACtC,QAAOb;AAEX,UAAIrJ,KAAOiK,EAAUvH,QAAQ2G,GAAIrJ,IAAAA;AAIjC,aAHoB,MAAhBA,GAAKY,UAAuC,OAAvBZ,GAAKa,WAAW,CAAA,MACrCb,KAAO,KAEJqJ,GAAInC,KAAK,EAAElH,MAAAA,GAAAA,CAAAA;IACtB,GAUgBoK,GAAAtH,WAAhB,SAAyBuG,IAAAA;AACrB,aAAOY,EAAUnH,SAASuG,GAAIrJ,IAAAA;IAClC,GAUgBoK,GAAAjH,UAAhB,SAAwBkG,IAAAA;AACpB,aAAOY,EAAU9G,QAAQkG,GAAIrJ,IAAAA;IACjC;EACH,GAzFgBmK,MAAAA,IAAK,CAAA,EAAA,GAAA,MAAA;AAAA,GAAA;AAAA,IAAA,EAAA,KAAAtD,MAAA,MAAA,IAAA;;;ACJhB,IAAW;CAAjB,SAAiB4D,WAAQ;AAER,EAAAA,UAAA,WAAW,MAAM;AACjB,EAAAA,UAAA,UAAU,MAAM;AAChB,EAAAA,UAAA,UAAU,MAAM;AAChB,EAAAA,UAAA,WAAW,MAAM;AACjB,EAAAA,UAAA,cAAc,MAAM;AAEjC,QAAM,YAAY,OAAO,YAAY,aAAY,mCAAS,cAAa;AAEvE,WAAgB,OAAOC,IAAkB,GAAgB;AACrD,YAAOA,MAAA,gBAAAA,GAAG,iBAAe,uBAAG;EAChC;AAFgB,EAAAD,UAAA,SAAM;AAItB,WAAgB,SAAS,MAAoB,IAAgB;AACzD,UAAM,WAAW,OAAO,SAAS,WAAWE,KAAI,MAAM,IAAI,EAAE,OAAO,KAAK;AACxE,UAAM,SAAW,OAAS,OAAO,WAAWA,KAAI,MAAM,EAAE,EAAE,OAAS,GAAG;AACtE,UAAM,YAAY,SAAS,MAAM,GAAG,EAAE,OAAO,OAAK,EAAE,SAAS,CAAC;AAC9D,UAAM,UAAc,OAAO,MAAM,GAAG,EAAE,OAAO,OAAK,EAAE,SAAS,CAAC;AAE9D,QAAI,WAAW;AACX,YAAM,uBAAuB;AAC7B,UAAI,UAAU,CAAC,KAAK,qBAAqB,KAAK,UAAU,CAAC,CAAC,GAAG;AACzD,kBAAU,CAAC,IAAI,UAAU,CAAC,EAAE,YAAW;MAC3C;AACA,UAAI,QAAQ,CAAC,KAAK,qBAAqB,KAAK,QAAQ,CAAC,CAAC,GAAG;AACrD,gBAAQ,CAAC,IAAI,QAAQ,CAAC,EAAE,YAAW;MACvC;AACA,UAAI,UAAU,CAAC,MAAM,QAAQ,CAAC,GAAG;AAE7B,eAAO,OAAO,UAAU,CAAC;MAC7B;IACJ;AAEA,QAAI,IAAI;AACR,WAAO,IAAI,UAAU,QAAQ,KAAK;AAC9B,UAAI,UAAU,CAAC,MAAM,QAAQ,CAAC,GAAG;AAC7B;MACJ;IACJ;AACA,UAAM,WAAW,MAAM,OAAO,UAAU,SAAS,CAAC;AAClD,UAAM,SAAS,QAAQ,MAAM,CAAC,EAAE,KAAK,GAAG;AACxC,WAAO,WAAW;EACtB;AA7BgB,EAAAF,UAAA,WAAQ;AA+BxB,WAAgB,UAAU,KAAiB;AACvC,WAAOE,KAAI,MAAM,IAAI,SAAQ,CAAE,EAAE,SAAQ;EAC7C;AAFgB,EAAAF,UAAA,YAAS;AAIzB,WAAgB,SAAS,QAAsB,OAAmB;AAC9D,QAAI,aAAa,OAAO,WAAW,WAAW,SAAS,OAAO;AAC9D,QAAI,YAAY,OAAO,UAAU,WAAW,QAAQ,MAAM;AAE1D,QAAI,UAAU,OAAO,UAAU,SAAS,CAAC,MAAM,KAAK;AAChD,kBAAY,UAAU,MAAM,GAAG,EAAE;IACrC;AACA,QAAI,WAAW,OAAO,WAAW,SAAS,CAAC,MAAM,KAAK;AAClD,mBAAa,WAAW,MAAM,GAAG,EAAE;IACvC;AAEA,QAAI,cAAc,YAAY;AAC1B,aAAO;IACX;AAEA,QAAI,UAAU,SAAS,WAAW,QAAQ;AACtC,aAAO;IACX;AAEA,QAAI,UAAU,OAAO,WAAW,MAAM,MAAM,KAAK;AAC7C,aAAO;IACX;AAEA,WAAO,UAAU,WAAW,UAAU;EAC1C;AAxBgB,EAAAA,UAAA,WAAQ;AA0B5B,GA3EiB,aAAA,WAAQ,CAAA,EAAA;AAmGnB,IAAO,UAAP,MAAc;EAApB,cAAA;AAEuB,SAAA,OAA+B,EAAE,MAAM,IAAI,UAAU,oBAAI,IAAG,EAAE;EA+GrF;EA7Gc,aAAa,KAAiB;AACpC,WAAO,SAAS,UAAU,GAAG;EACjC;EAEA,QAAK;AACD,SAAK,KAAK,SAAS,MAAK;EAC5B;EAEA,OAAO,KAAmB,SAAU;AAChC,UAAM,OAAO,KAAK,QAAQ,KAAK,aAAa,GAAG,GAAG,IAAI;AACtD,SAAK,UAAU;EACnB;EAEA,OAAO,KAAiB;AACpB,UAAM,eAAe,KAAK,QAAQ,KAAK,aAAa,GAAG,GAAG,KAAK;AAC/D,QAAI,6CAAc,QAAQ;AACtB,mBAAa,OAAO,SAAS,OAAO,aAAa,IAAI;IACzD;EACJ;EAEA,IAAI,KAAiB;AArIzB;AAsIQ,aAAO,UAAK,QAAQ,KAAK,aAAa,GAAG,GAAG,KAAK,MAA1C,mBAA6C,aAAY;EACpE;EAEA,QAAQ,KAAiB;AACrB,WAAO,KAAK,QAAQ,KAAK,aAAa,GAAG,GAAG,KAAK,MAAM;EAC3D;EAEA,KAAK,KAAiB;AA7I1B;AA8IQ,YAAO,UAAK,QAAQ,KAAK,aAAa,GAAG,GAAG,KAAK,MAA1C,mBAA6C;EACxD;EAEA,SAAS,KAAiB;AACtB,UAAM,YAAY,KAAK,aAAa,GAAG;AACvC,UAAM,OAAO,KAAK,QAAQ,WAAW,KAAK;AAC1C,QAAI,CAAC,MAAM;AACP,aAAO;IACX;AACA,WAAO;MACH,MAAM,KAAK;MACX,KAAK,SAAS,SAASE,KAAI,MAAM,SAAS,GAAG,KAAK,IAAI,EAAE,SAAQ;MAChE,SAAS,KAAK;;EAEtB;EAEA,aAAa,KAAiB;AAC1B,UAAM,YAAY,KAAK,aAAa,GAAG;AACvC,UAAM,OAAO,KAAK,QAAQ,WAAW,KAAK;AAC1C,QAAI,CAAC,MAAM;AACP,aAAO,CAAA;IACX;AACA,WAAO,MAAM,KAAK,KAAK,SAAS,OAAM,CAAE,EAAE,IAAI,YAAU;MACpD,MAAM,MAAM;MACZ,KAAK,SAAS,SAASA,KAAI,MAAM,SAAS,GAAG,MAAM,IAAI,EAAE,SAAQ;MACjE,SAAS,MAAM;MACjB;EACN;EAEA,MAAG;AACC,WAAO,KAAK,cAAc,KAAK,IAAI;EACvC;EAEA,QAAQ,QAAoB;AACxB,UAAM,OAAO,KAAK,QAAQ,SAAS,UAAU,MAAM,GAAG,KAAK;AAC3D,QAAI,CAAC,MAAM;AACP,aAAO,CAAA;IACX;AACA,WAAO,KAAK,cAAc,IAAI;EAClC;EAIU,QAAQ,KAAa,QAAe;AAC1C,UAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,QAAI,IAAI,OAAO,IAAI,SAAS,CAAC,MAAM,KAAK;AAEpC,YAAM,IAAG;IACb;AACA,QAAI,UAAU,KAAK;AACnB,eAAW,QAAQ,OAAO;AACtB,UAAI,QAAQ,QAAQ,SAAS,IAAI,IAAI;AACrC,UAAI,CAAC,OAAO;AACR,YAAI,QAAQ;AACR,kBAAQ;YACJ,MAAM;YACN,UAAU,oBAAI,IAAG;YACjB,QAAQ;;AAEZ,kBAAQ,SAAS,IAAI,MAAM,KAAK;QACpC,OAAO;AACH,iBAAO;QACX;MACJ;AACA,gBAAU;IACd;AACA,WAAO;EACX;EAEU,cAAc,MAA4B;AAChD,UAAM,SAAc,CAAA;AACpB,QAAI,KAAK,SAAS;AACd,aAAO,KAAK,KAAK,OAAO;IAC5B;AACA,eAAW,SAAS,KAAK,SAAS,OAAM,GAAI;AACxC,aAAO,KAAK,GAAG,KAAK,cAAc,KAAK,CAAC;IAC5C;AACA,WAAO;EACX;;;;AC7MJ,IAAAC,gCAA6B;AA4BvB,IAAO,4BAAP,MAAgC;EAMlC,YAAY,UAAyB;AACjC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,aAAa,SAAS,WAAW;AACtC,SAAK,gBAAgB,SAAS,OAAO;EACzC;EAEA,cAAc,UAA2B,QAA0B,cAAgC;AAC/F,UAAM,WAAW,SAAS,YAAY;AACtC,QAAI,SAAS,UAAU;AACnB,YAAM,MAAM,SAAS;AACrB,YAAM,gBAAgB,4BAA4B,KAAK,SAAS,aAAa,SAAS,OAAO,QAAQ,GAAG,KAAK,cAAc,UAAU;AACrI,UAAI,eAAe;AACf,eAAO,KAAK,qBAAqB,eAAe,MAAM;MAC1D;IACJ;AACA,WAAO;EACX;EAEU,qBAAqB,eAAwB,SAAyB;AAC5E,UAAM,YAAY,KAAK,UAAU,aAAa;AAC9C,QAAI,UAAU,SAAS,GAAG;AACtB,aAAO,UAAU,IAAI,UAAK;AAtEtC;AAsEyC,0DAAa,OACtC,KAAK,eAAe,aAAa,OAChC,UAAK,OAAO,QAAQ,aAApB,YAAgC,KAAK,QAAQ,OAC9C,KAAK,OAAO,OACZ,KAAK,OAAO,KAAK;OACpB;IACL;AACA,WAAO;EACX;EAEU,UAAU,QAAe;AAhFvC;AAiFQ,UAAM,sBAAqB,qBAAgB,MAAM,MAAtB,YAA2B;AACtD,UAAM,UAAU,KAAK,WAAW,qBAAqB,MAAM;AAC3D,UAAM,QAAoB,CAAA;AAC1B,eAAW,UAAU,SAAS;AAC1B,YAAM,iBAAiB,YAAY,OAAO,OAAO;AACjD,UAAI,WAAW,gBAAgB;AAC3B,cAAM,KAAK;UACP,QAAQ;UACR;UACA;SACH;MACL;IACJ;AACA,WAAO;EACX;;;;ACpEE,SAAU,oBAAoB,UAA6B;AAC7D,QAAM,QAAkB,CAAA;AACxB,QAAM,UAAU,SAAS;AACzB,aAAW,QAAQ,QAAQ,OAAO;AAC9B,QAAI,eAAe,IAAI,KAAK,kBAAkB,IAAI,KAAK,mBAAmB,cAAc,IAAI,CAAC,GAAG;AAC5F,YAAM,KAAK,KAAK,IAAI;IACxB;EACJ;AACA,SAAO;IACH,uBAAuB;IACvB,YAAY;;AAEpB;;;ACvCM,SAAU,YAAY,KAAW;AAErC,MAAI,WAAW,QAAQ,OAAO;AAC5B,YAAQ,MAAM,UAAU,GAAG,EAAE;EAC/B;AACF;AAEM,SAAU,cAAc,KAAW;AAEvC,MAAI,WAAW,QAAQ,MAAM;AAE3B,YAAQ,KAAK,YAAY,GAAG,EAAE;EAChC;AACF;;;ACbM,SAAU,MAAS,MAAa;AACpC,QAAM,SAAQ,oBAAI,KAAI,GAAG,QAAO;AAChC,QAAM,MAAM,KAAI;AAChB,QAAM,OAAM,oBAAI,KAAI,GAAG,QAAO;AAC9B,QAAM,QAAQ,MAAM;AACpB,SAAO,EAAE,MAAM,OAAO,OAAO,IAAG;AAClC;;;ACLM,SAAU,iBAAiB,cAAiB;AAChD,WAAS,kBAAe;EAAI;AAG5B,kBAAgB,YAAY;AAC5B,QAAM,eAAe,IAAK,gBAAuB;AAEjD,WAAS,aAAU;AACjB,WAAO,OAAO,aAAa;EAC7B;AAIA,aAAU;AACV,aAAU;AAIV,MAAI;AAAG,WAAO;AAMd,GAAC,GAAG,MAAM,YAAY;AACxB;;;ACjBA,SAAS,WAAW,SAAkB;AACpC,MAAI,cAAc,OAAO,GAAG;AAC1B,WAAO,QAAQ;EACjB,OAAO;AACL,WAAO,QAAQ;EACjB;AACF;AAGA,SAAS,cACP,KAAc;AAEd,SAAO,OAAO,IAAI,UAAU,YAAY,IAAI,UAAU;AACxD;AAEM,IAAgB,qBAAhB,MAAkC;EAGtC,IAAW,aAAU;AACnB,WAAO,KAAK;EACd;EACA,IAAW,WAAW,OAAU;AAC9B,SAAK,cAAc;EACrB;EAEA,YAAsB,aAAgB;AAAhB,SAAA,cAAA;EAAmB;EAEzC,OAAOC,UAAqB;AAC1B,IAAAA,SAAQ,MAAM,IAAI;AAClB,SAAK,WAAW,QAAQ,CAAC,SAAQ;AAC/B,WAAK,OAAOA,QAAO;IACrB,CAAC;EACH;;AAGI,IAAO,cAAP,cACI,mBAAkB;EAQ1B,YAAY,SAKX;AACC,UAAM,CAAA,CAAE;AARH,SAAA,MAAc;AASnB,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;EAEA,IAAI,WAAW,YAAyB;EAExC;EAEA,IAAI,aAAU;AACZ,QAAI,KAAK,mBAAmB,QAAW;AACrC,aAAO,KAAK,eAAe;IAC7B;AACA,WAAO,CAAA;EACT;EAEA,OAAOA,UAAqB;AAC1B,IAAAA,SAAQ,MAAM,IAAI;EAEpB;;AAGI,IAAO,OAAP,cAAoB,mBAAkB;EAI1C,YAAY,SAIX;AACC,UAAM,QAAQ,UAAU;AAPnB,SAAA,UAAkB;AAQvB,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;;AAGI,IAAO,cAAP,cAA2B,mBAAkB;EAGjD,YAAY,SAGX;AACC,UAAM,QAAQ,UAAU;AANnB,SAAA,oBAA6B;AAOlC,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;;AAGI,IAAO,SAAP,cACI,mBAAkB;EAM1B,YAAY,SAIX;AACC,UAAM,QAAQ,UAAU;AARnB,SAAA,MAAc;AASnB,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;;AAGI,IAAO,sBAAP,cACI,mBAAkB;EAM1B,YAAY,SAIX;AACC,UAAM,QAAQ,UAAU;AARnB,SAAA,MAAc;AASnB,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;;AAGI,IAAO,mCAAP,cACI,mBAAkB;EAO1B,YAAY,SAIX;AACC,UAAM,QAAQ,UAAU;AARnB,SAAA,MAAc;AASnB,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;;AAGI,IAAO,aAAP,cACI,mBAAkB;EAO1B,YAAY,SAIX;AACC,UAAM,QAAQ,UAAU;AARnB,SAAA,MAAc;AASnB,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;;AAGI,IAAO,0BAAP,cACI,mBAAkB;EAO1B,YAAY,SAIX;AACC,UAAM,QAAQ,UAAU;AARnB,SAAA,MAAc;AASnB,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;;AAGI,IAAO,cAAP,cACI,mBAA+B;EAQvC,IAAW,aAAU;AACnB,WAAO,KAAK;EACd;EACA,IAAW,WAAW,OAAoB;AACxC,SAAK,cAAc;EACrB;EAEA,YAAY,SAMX;AACC,UAAM,QAAQ,UAAU;AAnBnB,SAAA,MAAc;AACd,SAAA,oBAA6B;AAC7B,SAAA,gBAAyB;AAkB9B,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;;AAGI,IAAO,WAAP,MAAe;EAKnB,YAAY,SAIX;AANM,SAAA,MAAc;AAOnB,WAAO,OAAO,MAAM,gBAAgB,OAAO,CAAC;EAC9C;EAEA,OAAOA,UAAqB;AAC1B,IAAAA,SAAQ,MAAM,IAAI;EACpB;;AAgDI,SAAU,iBAAiB,UAAgB;AAC/C,SAAO,SAAS,IAAI,mBAAmB;AACzC;AAEM,SAAU,oBAAoB,MAAiB;AACnD,WAAS,kBAAkB,YAAyB;AAClD,WAAO,WAAW,IAAI,mBAAmB;EAC3C;AAEA,MAAI,gBAAgB,aAAa;AAC/B,UAAM,wBAAgD;MACpD,MAAM;MACN,MAAM,KAAK;MACX,KAAK,KAAK;;AAGZ,QAAI,OAAO,KAAK,UAAU,UAAU;AAClC,4BAAsB,QAAQ,KAAK;IACrC;AAEA,WAAO;EACT,WAAW,gBAAgB,aAAa;AACtC,WAAyB;MACvB,MAAM;MACN,YAAY,kBAAkB,KAAK,UAAU;;EAEjD,WAAW,gBAAgB,QAAQ;AACjC,WAAyB;MACvB,MAAM;MACN,KAAK,KAAK;MACV,YAAY,kBAAkB,KAAK,UAAU;;EAEjD,WAAW,gBAAgB,qBAAqB;AAC9C,WAAyB;MACvB,MAAM;MACN,KAAK,KAAK;MACV,YAAY,kBAAkB,KAAK,UAAU;;EAEjD,WAAW,gBAAgB,kCAAkC;AAC3D,WAAyC;MACvC,MAAM;MACN,KAAK,KAAK;MACV,WACE,oBAAoB,IAAI,SAAS,EAAE,cAAc,KAAK,UAAS,CAAE,CAAC;MAEpE,YAAY,kBAAkB,KAAK,UAAU;;EAEjD,WAAW,gBAAgB,yBAAyB;AAClD,WAAyC;MACvC,MAAM;MACN,KAAK,KAAK;MACV,WACE,oBAAoB,IAAI,SAAS,EAAE,cAAc,KAAK,UAAS,CAAE,CAAC;MAEpE,YAAY,kBAAkB,KAAK,UAAU;;EAEjD,WAAW,gBAAgB,YAAY;AACrC,WAAyB;MACvB,MAAM;MACN,KAAK,KAAK;MACV,YAAY,kBAAkB,KAAK,UAAU;;EAEjD,WAAW,gBAAgB,aAAa;AACtC,WAAyB;MACvB,MAAM;MACN,KAAK,KAAK;MACV,YAAY,kBAAkB,KAAK,UAAU;;EAEjD,WAAW,gBAAgB,UAAU;AACnC,UAAM,qBAA0C;MAC9C,MAAM;MACN,MAAM,KAAK,aAAa;MACxB,OAAO,WAAW,KAAK,YAAY;MACnC,KAAK,KAAK;;AAGZ,QAAI,OAAO,KAAK,UAAU,UAAU;AAClC,yBAAmB,gBAAgB,KAAK;IAC1C;AAEA,UAAM,UAAU,KAAK,aAAa;AAClC,QAAI,KAAK,aAAa,SAAS;AAC7B,yBAAmB,UACjB,mBAAmB,SAAe,QAAS,SAAS;IACxD;AAEA,WAAO;EACT,WAAW,gBAAgB,MAAM;AAC/B,WAA4B;MAC1B,MAAM;MACN,MAAM,KAAK;MACX,SAAS,KAAK;MACd,YAAY,kBAAkB,KAAK,UAAU;;EAGjD,OAAO;AACL,UAAM,MAAM,sBAAsB;EACpC;AACF;AAEA,SAAS,gBAAgB,KAAW;AAClC,SAAO,OAAO,YACZ,OAAO,QAAQ,GAAG,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,MAAM,MAAS,CAAC;AAE1D;;;ACvXM,IAAgB,cAAhB,MAA2B;EACxB,MAAM,MAAiB;AAC5B,UAAM,UAAe;AACrB,YAAQ,QAAQ,aAAa;MAC3B,KAAK;AACH,eAAO,KAAK,iBAAiB,OAAO;MACtC,KAAK;AACH,eAAO,KAAK,iBAAiB,OAAO;MACtC,KAAK;AACH,eAAO,KAAK,YAAY,OAAO;MACjC,KAAK;AACH,eAAO,KAAK,yBAAyB,OAAO;MAC9C,KAAK;AACH,eAAO,KAAK,sCAAsC,OAAO;MAC3D,KAAK;AACH,eAAO,KAAK,6BAA6B,OAAO;MAClD,KAAK;AACH,eAAO,KAAK,gBAAgB,OAAO;MACrC,KAAK;AACH,eAAO,KAAK,iBAAiB,OAAO;MACtC,KAAK;AACH,eAAO,KAAK,cAAc,OAAO;MACnC,KAAK;AACH,eAAO,KAAK,UAAU,OAAO;;MAE/B;AACE,cAAM,MAAM,sBAAsB;IACtC;EACF;;EAGO,iBAAiB,MAAiB;EAAQ;;EAG1C,iBAAiB,MAAiB;EAAQ;;EAG1C,YAAY,MAAY;EAAQ;;EAGhC,gBAAgB,MAAgB;EAAQ;;EAGxC,yBAAyB,MAAyB;EAAQ;;EAG1D,sCACL,MAAsC;EAChC;;EAGD,6BAA6B,MAA6B;EAAQ;;EAGlE,iBAAiB,MAAiB;EAAQ;;EAG1C,cAAc,MAAc;EAAQ;;EAGpC,UAAU,MAAU;EAAQ;;;;AC3D/B,SAAU,eACd,MAAiB;AAEjB,SACE,gBAAgB,eAChB,gBAAgB,UAChB,gBAAgB,cAChB,gBAAgB,uBAChB,gBAAgB,oCAChB,gBAAgB,2BAChB,gBAAgB,YAChB,gBAAgB;AAEpB;AAEM,SAAU,eACd,MACA,iBAAgC,CAAA,GAAE;AAElC,QAAM,qBACJ,gBAAgB,UAChB,gBAAgB,cAChB,gBAAgB;AAClB,MAAI,oBAAoB;AACtB,WAAO;EACT;AAKA,MAAI,gBAAgB,aAAa;AAE/B,WAAqB,KAAM,WAAW,KAAK,CAAC,YAAwB;AAClE,aAAO,eAAe,SAAS,cAAc;IAC/C,CAAC;EACH,WAAW,gBAAgB,eAAe,eAAe,SAAS,IAAI,GAAG;AAEvE,WAAO;EACT,WAAW,gBAAgB,oBAAoB;AAC7C,QAAI,gBAAgB,aAAa;AAC/B,qBAAe,KAAK,IAAI;IAC1B;AACA,WAA4B,KAAM,WAAW,MAC3C,CAAC,YAAwB;AACvB,aAAO,eAAe,SAAS,cAAc;IAC/C,CAAC;EAEL,OAAO;AACL,WAAO;EACT;AACF;AAEM,SAAU,gBACd,MAAiB;AAEjB,SAAO,gBAAgB;AACzB;AAEM,SAAU,qBAAqB,MAA+B;AAElE,MAAI,gBAAgB,aAAa;AAC/B,WAAO;EACT,WAAW,gBAAgB,QAAQ;AACjC,WAAO;EACT,WAAW,gBAAgB,aAAa;AACtC,WAAO;EACT,WAAW,gBAAgB,qBAAqB;AAC9C,WAAO;EACT,WAAW,gBAAgB,kCAAkC;AAC3D,WAAO;EACT,WAAW,gBAAgB,yBAAyB;AAClD,WAAO;EACT,WAAW,gBAAgB,YAAY;AACrC,WAAO;EACT,WAAW,gBAAgB,UAAU;AACnC,WAAO;EAET,OAAO;AACL,UAAM,MAAM,sBAAsB;EACpC;AACF;;;AC/EM,IAAgB,aAAhB,MAA0B;EAC9B,KAAK,MAAqC,WAAkB,CAAA,GAAE;AAC5D,SAAK,WAAW,QAAQ,CAAC,SAAsB,UAAS;AACtD,YAAM,WAAW,KAAK,WAAW,MAAM,QAAQ,CAAC;AAEhD,UAAI,mBAAmB,aAAa;AAClC,aAAK,YAAY,SAAS,UAAU,QAAQ;MAC9C,WAAW,mBAAmB,UAAU;AACtC,aAAK,aAAa,SAAS,UAAU,QAAQ;MAC/C,WAAW,mBAAmB,aAAa;AACzC,aAAK,SAAS,SAAS,UAAU,QAAQ;MAC3C,WAAW,mBAAmB,QAAQ;AACpC,aAAK,WAAW,SAAS,UAAU,QAAQ;MAC7C,WAAW,mBAAmB,qBAAqB;AACjD,aAAK,eAAe,SAAS,UAAU,QAAQ;MACjD,WAAW,mBAAmB,kCAAkC;AAC9D,aAAK,kBAAkB,SAAS,UAAU,QAAQ;MACpD,WAAW,mBAAmB,yBAAyB;AACrD,aAAK,YAAY,SAAS,UAAU,QAAQ;MAC9C,WAAW,mBAAmB,YAAY;AACxC,aAAK,SAAS,SAAS,UAAU,QAAQ;MAC3C,WAAW,mBAAmB,aAAa;AACzC,aAAK,OAAO,SAAS,UAAU,QAAQ;MACzC,OAAO;AACL,cAAM,MAAM,sBAAsB;MACpC;IACF,CAAC;EACH;EAEA,aACE,UACA,UACA,UAAuB;EAChB;EAET,YACE,SACA,UACA,UAAuB;EAChB;EAET,SACE,UACA,UACA,UAAuB;AAGvB,UAAM,aAAa,SAAS,OAAO,QAAQ;AAC3C,SAAK,KAAK,UAAe,UAAU;EACrC;EAEA,WACE,YACA,UACA,UAAuB;AAGvB,UAAM,aAAa,SAAS,OAAO,QAAQ;AAC3C,SAAK,KAAK,YAAiB,UAAU;EACvC;EAEA,eACE,gBACA,UACA,UAAuB;AAGvB,UAAM,qBAAoC;MACxC,IAAI,OAAO,EAAE,YAAY,eAAe,WAAU,CAAE;MACpD,OAAY,UAAe,QAAQ;AACrC,SAAK,KAAK,gBAAgB,kBAAkB;EAC9C;EAEA,kBACE,mBACA,UACA,UAAuB;AAGvB,UAAM,wBAAwB,+BAC5B,mBACA,UACA,QAAQ;AAEV,SAAK,KAAK,mBAAmB,qBAAqB;EACpD;EAEA,SACE,UACA,UACA,UAAuB;AAGvB,UAAM,eAA8B;MAClC,IAAI,OAAO,EAAE,YAAY,SAAS,WAAU,CAAE;MAC9C,OAAY,UAAe,QAAQ;AACrC,SAAK,KAAK,UAAU,YAAY;EAClC;EAEA,YACE,aACA,UACA,UAAuB;AAGvB,UAAM,kBAAkB,+BACtB,aACA,UACA,QAAQ;AAEV,SAAK,KAAK,aAAa,eAAe;EACxC;EAEA,OACE,QACA,UACA,UAAuB;AAGvB,UAAM,aAAa,SAAS,OAAO,QAAQ;AAE3C,WAAO,WAAW,QAAQ,CAAC,QAAO;AAIhC,YAAM,cAAc,IAAI,YAAY,EAAE,YAAY,CAAC,GAAG,EAAC,CAAE;AACzD,WAAK,KAAK,aAAkB,UAAU;IACxC,CAAC;EACH;;AAGF,SAAS,+BACP,YACA,UACA,UAAuB;AAEvB,QAAM,aAAa;IACjB,IAAI,OAAO;MACT,YAAY;QACV,IAAI,SAAS,EAAE,cAAc,WAAW,UAAS,CAAE;QACnD,OAAO,WAAW,UAAU;KAC/B;;AAEH,QAAM,iBAAgC,WAAW,OAAO,UAAU,QAAQ;AAC1E,SAAO;AACT;;;ACxJM,SAAU,MAAM,MAAiB;AAErC,MAAI,gBAAgB,aAAa;AAS/B,WAAO,MAAoB,KAAM,cAAc;EACjD,WAAW,gBAAgB,UAAU;AACnC,WAAO,iBAA2B,IAAI;EACxC,WAAW,eAAe,IAAI,GAAG;AAC/B,WAAO,iBAAiB,IAAI;EAC9B,WAAW,gBAAgB,IAAI,GAAG;AAChC,WAAO,kBAAkB,IAAI;EAC/B,OAAO;AACL,UAAM,MAAM,sBAAsB;EACpC;AACF;AAEM,SAAU,iBAAiB,MAEhC;AACC,MAAI,WAAwB,CAAA;AAC5B,QAAM,MAAM,KAAK;AACjB,MAAI,iBAAiB;AACrB,MAAI,yBAAyB,IAAI,SAAS;AAC1C,MAAI;AAEJ,MAAI,0BAA0B;AAE9B,SAAO,0BAA0B,yBAAyB;AACxD,kBAAc,IAAI,cAAc;AAChC,8BAA0B,eAAe,WAAW;AACpD,eAAW,SAAS,OAAO,MAAM,WAAW,CAAC;AAC7C,qBAAiB,iBAAiB;AAClC,6BAAyB,IAAI,SAAS;EACxC;AAEA,SAAO,CAAC,GAAG,IAAI,IAAI,QAAQ,CAAC;AAC9B;AAEM,SAAU,kBAAkB,MAEjC;AACC,QAAM,wBAAuC,KAAK,WAAW,IAC3D,CAAC,cAAa;AACZ,WAAO,MAAM,SAAS;EACxB,CAAC;AAEH,SAAO,CAAC,GAAG,IAAI,IAAI,sBAAsB,KAAI,CAAE,CAAC;AAClD;AAEM,SAAU,iBAAiB,UAAkB;AACjD,SAAO,CAAC,SAAS,YAAY;AAC/B;;;AClEO,IAAM,KAAK;;;ACOZ,IAAO,sBAAP,cAAmC,WAAU;EAGjD,YAAoB,SAAa;AAC/B,UAAK;AADa,SAAA,UAAA;AAFb,SAAA,UAAuC,CAAA;EAI9C;EAEA,eAAY;AACV,SAAK,KAAK,KAAK,OAAO;AACtB,WAAO,KAAK;EACd;EAEA,aACE,UACA,UACA,UAAuB;EAGzB;EAEA,YACE,SACA,UACA,UAAuB;AAEvB,UAAM,aACJ,8BAA8B,QAAQ,gBAAgB,QAAQ,GAAG,IACjE,KAAK,QAAQ;AACf,UAAM,WAA0B,SAAS,OAAO,QAAQ;AACxD,UAAM,WAAW,IAAI,YAAY,EAAE,YAAY,SAAQ,CAAE;AACzD,UAAM,uBAAuB,MAAM,QAAQ;AAC3C,SAAK,QAAQ,UAAU,IAAI;EAC7B;;AAGI,SAAU,uBACd,gBAAsB;AAEtB,QAAM,gBAAgB,CAAA;AAEtB,iBAAe,QAAQ,CAAC,YAAW;AACjC,UAAM,iBAAiB,IAAI,oBAAoB,OAAO,EAAE,aAAY;AACpE,WAAO,OAAO,eAAe,cAAc;EAC7C,CAAC;AACD,SAAO;AACT;AAEM,SAAU,8BACd,OACA,mBAAyB;AAEzB,SAAO,MAAM,OAAO,oBAAoB;AAC1C;;;ACnDA,IAAI,iBAAqD,CAAA;AACzD,IAAM,eAAe,IAAI,aAAY;AAU/B,SAAU,aAAa,QAAc;AACzC,QAAM,YAAY,OAAO,SAAQ;AACjC,MAAI,eAAe,eAAe,SAAS,GAAG;AAC5C,WAAO,eAAe,SAAS;EACjC,OAAO;AACL,UAAM,YAAY,aAAa,QAAQ,SAAS;AAChD,mBAAe,SAAS,IAAI;AAC5B,WAAO;EACT;AACF;AAEM,SAAU,yBAAsB;AACpC,mBAAiB,CAAA;AACnB;;;ACpBA,IAAM,yBACJ;AACK,IAAM,8BACX;AAEI,SAAU,8BACd,QACA,sBAAsB,OAAK;AAE3B,MAAI;AACF,UAAM,MAAM,aAAa,MAAM;AAC/B,UAAM,aAAa,0BACjB,IAAI,OACJ,CAAA,GACA,IAAI,MAAM,UAAU;AAEtB,WAAO;EACT,SAAS,GAAG;AAIV,QAAI,EAAE,YAAY,wBAAwB;AACxC,UAAI,qBAAqB;AACvB,sBACE,GAAG,2BAA2B,0BACD,OAAO,SAAQ,CAAE;;;2FAGiD;MAEnG;IACF,OAAO;AACL,UAAI,YAAY;AAChB,UAAI,qBAAqB;AACvB,oBACE;MAEJ;AACA,kBACE,GAAG,2BAA2B;qBACL,OAAO,SAAQ,CAAE;;6EAGxC,SAAS;IAEf;EACF;AAEA,SAAO,CAAA;AACT;AAEM,SAAU,0BACd,KACA,QACA,YAAmB;AAEnB,UAAQ,IAAI,MAAM;IAChB,KAAK;AACH,eAAS,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK;AACzC,kCAA0B,IAAI,MAAM,CAAC,GAAG,QAAQ,UAAU;MAC5D;AACA;IACF,KAAK;AACH,YAAM,QAAQ,IAAI;AAClB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAM,OAAO,MAAM,CAAC;AAGpB,gBAAQ,KAAK,MAAM;UACjB,KAAK;;;;UAIL,KAAK;;UAEL,KAAK;UACL,KAAK;UACL,KAAK;UACL,KAAK;UACL,KAAK;UACL,KAAK;UACL,KAAK;AACH;QACJ;AAEA,cAAMC,QAAO;AACb,gBAAQA,MAAK,MAAM;UACjB,KAAK;AACH,oCAAwBA,MAAK,OAAO,QAAQ,UAAU;AACtD;UACF,KAAK;AACH,gBAAIA,MAAK,eAAe,MAAM;AAC5B,oBAAM,MAAM,sBAAsB;YACpC;AACA,YAAAA,MAAK,MAAM,QAAQ,CAAC,SAAQ;AAC1B,kBAAI,OAAO,SAAS,UAAU;AAC5B,wCAAwB,MAAM,QAAQ,UAAU;cAClD,OAAO;AAEL,sBAAM,QAAQ;AAEd,oBAAI,eAAe,MAAM;AACvB,2BACM,YAAY,MAAM,MACtB,aAAa,MAAM,IACnB,aACA;AACA,4CAAwB,WAAW,QAAQ,UAAU;kBACvD;gBACF,OAEK;AAEH,2BACM,YAAY,MAAM,MACtB,aAAa,MAAM,MAAM,YAAY,oBACrC,aACA;AACA,4CAAwB,WAAW,QAAQ,UAAU;kBACvD;AAGA,sBAAI,MAAM,MAAM,oBAAoB;AAClC,0BAAM,cACJ,MAAM,QAAQ,qBACV,MAAM,OACN;AACN,0BAAM,cAAc,MAAM;AAC1B,0BAAM,YAAY,yBAAyB,WAAW;AACtD,0BAAM,YAAY,yBAAyB,WAAW;AAEtD,6BACM,aAAa,WACjB,cAAc,WACd,cACA;AACA,6BAAO,UAAU,IAAI;oBACvB;kBACF;gBACF;cACF;YACF,CAAC;AACD;UACF,KAAK;AACH,sCAA0BA,MAAK,OAAO,QAAQ,UAAU;AACxD;;UAEF;AACE,kBAAM,MAAM,sBAAsB;QACtC;AAGA,cAAM,uBACJA,MAAK,eAAe,UAAaA,MAAK,WAAW,YAAY;AAC/D;;;UAGGA,MAAK,SAAS,WAAW,gBAAgBA,KAAI,MAAM;UAEnDA,MAAK,SAAS,WAAW,yBAAyB;UACnD;AACA;QACF;MACF;AACA;;IAEF;AACE,YAAM,MAAM,uBAAuB;EACvC;AAGA,SAAO,OAAO,OAAO,MAAM;AAC7B;AAEA,SAAS,wBACP,MACA,QACA,YAAmB;AAEnB,QAAM,mBAAmB,yBAAyB,IAAI;AACtD,SAAO,gBAAgB,IAAI;AAE3B,MAAI,eAAe,MAAM;AACvB,qBAAiB,MAAM,MAAM;EAC/B;AACF;AAEA,SAAS,iBACP,MACA,QAAsC;AAEtC,QAAM,OAAO,OAAO,aAAa,IAAI;AACrC,QAAM,YAAY,KAAK,YAAW;AAElC,MAAI,cAAc,MAAM;AACtB,UAAM,mBAAmB,yBAAyB,UAAU,WAAW,CAAC,CAAC;AACzE,WAAO,gBAAgB,IAAI;EAC7B,OAAO;AACL,UAAM,YAAY,KAAK,YAAW;AAClC,QAAI,cAAc,MAAM;AACtB,YAAM,mBAAmB,yBACvB,UAAU,WAAW,CAAC,CAAC;AAEzB,aAAO,gBAAgB,IAAI;IAC7B;EACF;AACF;AAEA,SAAS,SAAS,SAAc,iBAAyB;AACvD,SAAO,QAAQ,MAAM,KAAK,CAAC,gBAAe;AACxC,QAAI,OAAO,gBAAgB,UAAU;AACnC,aAAO,gBAAgB,SAAS,WAAW;IAC7C,OAAO;AAEL,YAAM,QAAa;AACnB,aACE,gBAAgB,KACd,CAAC,eAAe,MAAM,QAAQ,cAAc,cAAc,MAAM,EAAE,MAC9D;IAEV;EACF,CAAC;AACH;AAEA,SAAS,gBAAgB,KAAQ;AAC/B,QAAM,aAAc,IAAa;AACjC,MAAI,cAAc,WAAW,YAAY,GAAG;AAC1C,WAAO;EACT;AAEA,MAAI,CAAC,IAAI,OAAO;AACd,WAAO;EACT;AAEA,SAAO,MAAM,QAAQ,IAAI,KAAK,IAC1B,IAAI,MAAM,MAAM,eAAe,IAC/B,gBAAgB,IAAI,KAAK;AAC/B;AAEA,IAAM,iBAAN,cAA6B,kBAAiB;EAG5C,YAAoB,iBAAyB;AAC3C,UAAK;AADa,SAAA,kBAAA;AAFpB,SAAA,QAAiB;EAIjB;EAEA,cAAc,MAAa;AAEzB,QAAI,KAAK,UAAU,MAAM;AACvB;IACF;AAIA,YAAQ,KAAK,MAAM;MACjB,KAAK;AACH,aAAK,eAAe,IAAI;AACxB;MACF,KAAK;AACH,aAAK,uBAAuB,IAAI;AAChC;MACF,KAAK;AACH,aAAK,gBAAgB,IAAI;AACzB;MACF,KAAK;AACH,aAAK,wBAAwB,IAAI;AACjC;IACJ;AAEA,UAAM,cAAc,IAAI;EAC1B;EAEA,eAAe,MAAe;AAC5B,QAAI,KAAK,gBAAgB,SAAS,KAAK,KAAK,GAAG;AAC7C,WAAK,QAAQ;IACf;EACF;EAEA,SAAS,MAAS;AAChB,QAAI,KAAK,YAAY;AACnB,UAAI,SAAS,MAAM,KAAK,eAAe,MAAM,QAAW;AACtD,aAAK,QAAQ;MACf;IACF,OAAO;AACL,UAAI,SAAS,MAAM,KAAK,eAAe,MAAM,QAAW;AACtD,aAAK,QAAQ;MACf;IACF;EACF;;AAGI,SAAU,iBACd,WACA,SAAwB;AAExB,MAAI,mBAAmB,QAAQ;AAC7B,UAAM,MAAM,aAAa,OAAO;AAChC,UAAM,iBAAiB,IAAI,eAAe,SAAS;AACnD,mBAAe,MAAM,GAAG;AACxB,WAAO,eAAe;EACxB,OAAO;AACL,eAAW,QAAQ,SAAS;AAC1B,YAAM,WAAW,KAAK,WAAW,CAAC;AAClC,UAAI,UAAU,SAAS,QAAQ,GAAG;AAChC,eAAO;MACT;IACF;AACA,WAAO;EACT;AACF;;;AC5SA,IAAM,UAAU;AACT,IAAM,eAAe;AACrB,IAAM,QAAQ;AAuBf,SAAU,kBACd,YACA,SAMC;AAED,YAAO,OAAA,OAAA,EACL,UAAU,OACV,kBAAkB,QAClB,0BAA0B,CAAC,MAAM,IAAI,GACrC,QAAQ,CAAC,KAAa,WAAqB,OAAM,EAAE,GAChD,OAAO;AAGZ,QAAM,SAAS,QAAQ;AAEvB,SAAO,mCAAmC,MAAK;AAC7C,oCAA+B;EACjC,CAAC;AAED,MAAI;AACJ,SAAO,mBAAmB,MAAK;AAC7B,wBAAoB,WAAW,OAAO,CAAC,aAAY;AACjD,aAAO,SAAS,OAAO,MAAM,MAAM;IACrC,CAAC;EACH,CAAC;AAED,MAAI,YAAY;AAChB,MAAI;AACJ,SAAO,sBAAsB,MAAK;AAChC,gBAAY;AACZ,6BAAyB,kBAAkB,IACzC,CAAC,aAAkC;AACjC,YAAM,cAAc,SAAS,OAAO;AAGpC,UAAI,uBAAuB,QAAQ;AACjC,cAAM,eAAe,YAAY;AACjC,YACE,aAAa,WAAW;QAExB,iBAAiB,OACjB,iBAAiB,OACjB,iBAAiB,OACjB,CAAC,YAAY,YACb;AACA,iBAAO;QACT,WACE,aAAa,WAAW,KACxB,aAAa,CAAC,MAAM;QAEpB,CAAC;UACC;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA,SAAS,aAAa,CAAC,CAAC,GAC1B;AAIA,iBAAO,aAAa,CAAC;QACvB,OAAO;AACL,iBAAO,cAAc,WAAW;QAClC;MACF,WAAW,OAAO,gBAAgB,YAAY;AAC5C,oBAAY;AAEZ,eAAO,EAAE,MAAM,YAAW;MAC5B,WAAW,OAAO,gBAAgB,UAAU;AAC1C,oBAAY;AAEZ,eAAO;MACT,WAAW,OAAO,gBAAgB,UAAU;AAC1C,YAAI,YAAY,WAAW,GAAG;AAC5B,iBAAO;QACT,OAAO;AACL,gBAAM,sBAAsB,YAAY,QACtC,uBACA,MAAM;AAER,gBAAM,gBAAgB,IAAI,OAAO,mBAAmB;AACpD,iBAAO,cAAc,aAAa;QACpC;MACF,OAAO;AACL,cAAM,MAAM,sBAAsB;MACpC;IACF,CAAC;EAEL,CAAC;AAED,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,SAAO,gBAAgB,MAAK;AAC1B,uBAAmB,kBAAkB,IACnC,CAAC,aAAa,SAAS,YAAa;AAGtC,wBAAoB,kBAAkB,IAAI,CAAC,UAAc;AACvD,YAAM,YAAY,MAAM;AAExB,UAAI,cAAc,MAAM,SAAS;AAC/B,eAAO;MACT,WAAW,OAAO,cAAc,UAAU;AACxC,eAAO;MACT,WAAW,cAAc,QAAW;AAClC,eAAO;MACT,OAAO;AACL,cAAM,MAAM,sBAAsB;MACpC;IACF,CAAC;AAED,kCAA8B,kBAAkB,IAAI,CAAC,UAAc;AACjE,YAAM,gBAAgB,MAAM;AAE5B,UAAI,eAAe;AACjB,cAAM,kBAAkB,MAAM,QAAQ,aAAa,IAC/C,cAAc,IAAI,CAAC,SAAc,kBAAkB,QAAQ,IAAI,CAAC,IAChE,CAAC,kBAAkB,QAAQ,aAAa,CAAC;AAC7C,eAAO;MACT;IACF,CAAC;AAED,2BAAuB,kBAAkB,IACvC,CAAC,UAAe,MAAM,SAAS;AAGjC,0BAAsB,kBAAkB,IAAI,CAAC,UAC3C,OAAO,OAAO,OAAO,UAAU,CAAC;EAEpC,CAAC;AAED,MAAI;AACJ,SAAO,4BAA4B,MAAK;AACtC,UAAM,0BAA0B,aAC9B,QAAQ,wBAAyB;AAEnC,oCAAgC,kBAAkB,IAAI,CAAC,YAAY,KAAK;AACxE,QAAI,QAAQ,qBAAqB,cAAc;AAC7C,sCAAgC,kBAAkB,IAAI,CAAC,YAAW;AAChE,YAAI,OAAO,OAAO,SAAS,aAAa,GAAG;AACzC,iBAAO,CAAC,CAAC,QAAQ;QACnB,OAAO;AACL,iBACE,sBAAsB,SAAS,uBAAuB,MAAM,SAC5D,iBACE,yBACA,QAAQ,OAA0B;QAGxC;MACF,CAAC;IACH;EACF,CAAC;AAED,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,SAAO,mBAAmB,MAAK;AAC7B,2BAAuB,kBAAkB,IAAI,eAAe;AAC5D,wBAAoB,uBAAuB,IAAI,cAAc;AAE7D,kBAAc,kBAAkB,OAC9B,CAAC,KAAK,UAAc;AAClB,YAAM,YAAY,MAAM;AACxB,UAAI,OAAO,cAAc,YAAY,EAAE,cAAc,MAAM,UAAU;AACnE,YAAI,SAAS,IAAI,CAAA;MACnB;AACA,aAAO;IACT,GACA,CAAA,CAAuC;AAGzC,yBAAqB,uBAAuB,IAC1C,CAAC,GAAG,QAAuB;AACzB,aAAO;QACL,SAAS,uBAAuB,GAAG;QACnC,WAAW,4BAA4B,GAAG;QAC1C,mBAAmB,8BAA8B,GAAG;QACpD,UAAU,qBAAqB,GAAG;QAClC,OAAO,kBAAkB,GAAG;QAC5B,OAAO,kBAAkB,GAAG;QAC5B,MAAM,qBAAqB,GAAG;QAC9B,KAAK,oBAAoB,GAAG;QAC5B,cAAc,iBAAiB,GAAG;QAClC,WAAW,kBAAkB,GAAG;;IAEpC,CAAC;EAEL,CAAC;AAED,MAAI,iBAAiB;AACrB,MAAI,+BACF,CAAA;AAEF,MAAI,CAAC,QAAQ,UAAU;AACrB,WAAO,2BAA2B,MAAK;AACrC,qCAA+B,kBAAkB,OAC/C,CAAC,QAAQ,aAAa,QAAO;AAC3B,YAAI,OAAO,YAAY,YAAY,UAAU;AAC3C,gBAAM,WAAW,YAAY,QAAQ,WAAW,CAAC;AACjD,gBAAM,eAAe,yBAAyB,QAAQ;AACtD,2BAAiB,QAAQ,cAAc,mBAAmB,GAAG,CAAC;QAChE,WAAW,MAAM,QAAQ,YAAY,gBAAgB,GAAG;AACtD,cAAI;AACJ,sBAAY,iBAAiB,QAAQ,CAAC,cAAa;AACjD,kBAAM,WACJ,OAAO,cAAc,WACjB,UAAU,WAAW,CAAC,IACtB;AACN,kBAAM,mBAAmB,yBAAyB,QAAQ;AAK1D,gBAAI,qBAAqB,kBAAkB;AACzC,iCAAmB;AACnB,+BACE,QACA,kBACA,mBAAmB,GAAG,CAAC;YAE3B;UACF,CAAC;QACH,WAAW,YAAY,mBAAmB,QAAQ;AAChD,cAAI,YAAY,QAAQ,SAAS;AAC/B,6BAAiB;AACjB,gBAAI,QAAQ,qBAAqB;AAC/B,0BACE,GAAG,2BAA2B,wBACH,YAAY,QAAQ,SAAQ,CAAE;;;gGAG2C;YAExG;UACF,OAAO;AACL,kBAAM,iBAAiB,8BACrB,YAAY,SACZ,QAAQ,mBAAmB;AAK7B,gBAAI,eAAe,WAAW,GAAG;AAI/B,+BAAiB;YACnB;AACA,2BAAe,QAAQ,CAAC,SAAQ;AAC9B,+BAAiB,QAAQ,MAAM,mBAAmB,GAAG,CAAC;YACxD,CAAC;UACH;QACF,OAAO;AACL,cAAI,QAAQ,qBAAqB;AAC/B,wBACE,GAAG,2BAA2B,gBACX,YAAY,IAAI;;+FAEgE;UAEvG;AACA,2BAAiB;QACnB;AAEA,eAAO;MACT,GACA,CAAA,CAA8C;IAElD,CAAC;EACH;AAEA,SAAO;IACL;IACA;IACA;IACA;IACA;;AAEJ;AAEM,SAAU,iBACd,YACA,iBAAyB;AAEzB,MAAI,SAAkC,CAAA;AAEtC,QAAM,gBAAgB,oBAAoB,UAAU;AACpD,WAAS,OAAO,OAAO,cAAc,MAAM;AAE3C,QAAM,gBAAgB,oBAAoB,cAAc,KAAK;AAC7D,QAAM,kBAAkB,cAAc;AACtC,WAAS,OAAO,OAAO,cAAc,MAAM;AAE3C,WAAS,OAAO,OAAO,sBAAsB,eAAe,CAAC;AAE7D,WAAS,OAAO,OAAO,qBAAqB,eAAe,CAAC;AAE5D,WAAS,OAAO,OACd,wBAAwB,iBAAiB,eAAe,CAAC;AAG3D,WAAS,OAAO,OAAO,wBAAwB,eAAe,CAAC;AAE/D,SAAO;AACT;AAEA,SAAS,sBACP,YAAuB;AAEvB,MAAI,SAAkC,CAAA;AACtC,QAAM,qBAAqB,WAAW,OACpC,CAAC,gBAAgB,YAAY,OAAO,aAAa,MAAM;AAGzD,WAAS,OAAO,OAAO,qBAAqB,kBAAkB,CAAC;AAE/D,WAAS,OAAO,OAAO,uBAAuB,kBAAkB,CAAC;AAEjE,WAAS,OAAO,OAAO,qBAAqB,kBAAkB,CAAC;AAE/D,WAAS,OAAO,OAAO,sBAAsB,kBAAkB,CAAC;AAEhE,WAAS,OAAO,OAAO,sBAAsB,kBAAkB,CAAC;AAEhE,SAAO;AACT;AAOM,SAAU,oBACd,YAAuB;AAEvB,QAAM,+BAA+B,WAAW,OAAO,CAAC,aAAY;AAClE,WAAO,CAAC,OAAO,OAAO,UAAU,OAAO;EACzC,CAAC;AAED,QAAM,SAAS,6BAA6B,IAAI,CAAC,aAAY;AAC3D,WAAO;MACL,SACE,mBACA,SAAS,OACT;MACF,MAAM,yBAAyB;MAC/B,YAAY,CAAC,QAAQ;;EAEzB,CAAC;AAED,QAAM,QAAQ,WAAW,OACvB,CAAC,MAAM,CAAC,6BAA6B,SAAS,CAAC,CAAC;AAElD,SAAO,EAAE,QAAQ,MAAK;AACxB;AAEM,SAAU,oBACd,YAAuB;AAEvB,QAAM,+BAA+B,WAAW,OAAO,CAAC,aAAY;AAClE,UAAM,UAAU,SAAS,OAAO;AAChC,WACE,EAAE,mBAAmB,WACrB,EAAE,OAAO,YAAY,eACrB,CAAC,OAAO,OAAO,SAAgB,MAAM,KACrC,EAAE,OAAO,YAAY;EAEzB,CAAC;AAED,QAAM,SAAS,6BAA6B,IAAI,CAAC,aAAY;AAC3D,WAAO;MACL,SACE,mBACA,SAAS,OACT;MAEF,MAAM,yBAAyB;MAC/B,YAAY,CAAC,QAAQ;;EAEzB,CAAC;AAED,QAAM,QAAQ,WAAW,OACvB,CAAC,MAAM,CAAC,6BAA6B,SAAS,CAAC,CAAC;AAElD,SAAO,EAAE,QAAQ,MAAK;AACxB;AAEA,IAAM,eAAe;AAEf,SAAU,qBACd,YAAuB;EAEvB,MAAM,wBAAwB,kBAAiB;IAA/C,cAAA;;AACE,WAAA,QAAQ;IAKV;IAHE,eAAe,MAAa;AAC1B,WAAK,QAAQ;IACf;;AAGF,QAAM,eAAe,WAAW,OAAO,CAAC,aAAY;AAClD,UAAM,UAAU,SAAS;AAEzB,QAAI;AACF,YAAM,YAAY,aAAa,OAAiB;AAChD,YAAM,mBAAmB,IAAI,gBAAe;AAC5C,uBAAiB,MAAM,SAAS;AAEhC,aAAO,iBAAiB;IAC1B,SAAS,GAAG;AAGV,aAAO,aAAa,KAAM,QAAmB,MAAM;IACrD;EACF,CAAC;AAED,QAAM,SAAS,aAAa,IAAI,CAAC,aAAY;AAC3C,WAAO;MACL,SACE,qDAEA,SAAS,OACT;MAGF,MAAM,yBAAyB;MAC/B,YAAY,CAAC,QAAQ;;EAEzB,CAAC;AAED,SAAO;AACT;AAEM,SAAU,sBACd,YAAuB;AAEvB,QAAM,qBAAqB,WAAW,OAAO,CAAC,aAAY;AACxD,UAAM,UAAU,SAAS;AACzB,WAAO,QAAQ,KAAK,EAAE;EACxB,CAAC;AAED,QAAM,SAAS,mBAAmB,IAAI,CAAC,aAAY;AACjD,WAAO;MACL,SACE,mBACA,SAAS,OACT;MACF,MAAM,yBAAyB;MAC/B,YAAY,CAAC,QAAQ;;EAEzB,CAAC;AAED,SAAO;AACT;AAEA,IAAM,iBAAiB;AAEjB,SAAU,uBACd,YAAuB;EAEvB,MAAM,0BAA0B,kBAAiB;IAAjD,cAAA;;AACE,WAAA,QAAQ;IAKV;IAHE,iBAAiB,MAAa;AAC5B,WAAK,QAAQ;IACf;;AAGF,QAAM,eAAe,WAAW,OAAO,CAAC,aAAY;AAClD,UAAM,UAAU,SAAS;AACzB,QAAI;AACF,YAAM,YAAY,aAAa,OAAO;AACtC,YAAM,qBAAqB,IAAI,kBAAiB;AAChD,yBAAmB,MAAM,SAAS;AAElC,aAAO,mBAAmB;IAC5B,SAAS,GAAG;AAGV,aAAO,eAAe,KAAK,QAAQ,MAAM;IAC3C;EACF,CAAC;AAED,QAAM,SAAS,aAAa,IAAI,CAAC,aAAY;AAC3C,WAAO;MACL,SACE,qDAEA,SAAS,OACT;MAGF,MAAM,yBAAyB;MAC/B,YAAY,CAAC,QAAQ;;EAEzB,CAAC;AAED,SAAO;AACT;AAEM,SAAU,qBACd,YAAuB;AAEvB,QAAM,eAAe,WAAW,OAAO,CAAC,aAAY;AAClD,UAAM,UAAU,SAAS,OAAO;AAChC,WAAO,mBAAmB,WAAW,QAAQ,aAAa,QAAQ;EACpE,CAAC;AAED,QAAM,SAAS,aAAa,IAAI,CAAC,aAAY;AAC3C,WAAO;MACL,SACE,mBACA,SAAS,OACT;MACF,MAAM,yBAAyB;MAC/B,YAAY,CAAC,QAAQ;;EAEzB,CAAC;AAED,SAAO;AACT;AAGM,SAAU,sBACd,YAAuB;AAEvB,QAAM,QAAqB,CAAA;AAC3B,MAAI,oBAAoB,WAAW,IAAI,CAAC,cAAkB;AACxD,WAAO,WAAW,OAAO,CAAC,QAAQ,cAAa;AAC7C,UACE,UAAU,QAAQ,WAAY,UAAU,QAAmB,UAC3D,CAAC,MAAM,SAAS,SAAS,KACzB,UAAU,YAAY,MAAM,IAC5B;AAGA,cAAM,KAAK,SAAS;AACpB,eAAO,KAAK,SAAS;AACrB,eAAO;MACT;AACA,aAAO;IACT,GAAG,CAAA,CAAiB;EACtB,CAAC;AAED,sBAAoB,kBAAkB,OAAO,OAAO;AAEpD,QAAM,oBAAoB,kBAAkB,OAAO,CAAC,qBAAoB;AACtE,WAAO,iBAAiB,SAAS;EACnC,CAAC;AAED,QAAM,SAAS,kBAAkB,IAAI,CAAC,mBAAuB;AAC3D,UAAM,iBAAiB,eAAe,IAAI,CAAC,aAAiB;AAC1D,aAAO,SAAS;IAClB,CAAC;AAED,UAAM,gBAAsB,eAAe,CAAC,EAAG;AAC/C,WAAO;MACL,SACE,6BAA6B,aAAa,wDACY,eAAe,KACnE,IAAI,CACL;MACH,MAAM,yBAAyB;MAC/B,YAAY;;EAEhB,CAAC;AAED,SAAO;AACT;AAEM,SAAU,qBACd,YAAuB;AAEvB,QAAM,eAAe,WAAW,OAAO,CAAC,UAAc;AACpD,QAAI,CAAC,OAAO,OAAO,OAAO,OAAO,GAAG;AAClC,aAAO;IACT;AACA,UAAM,QAAQ,MAAM;AAEpB,WACE,UAAU,MAAM,WAChB,UAAU,MAAM,MAChB,EAAE,OAAO,UAAU;EAEvB,CAAC;AAED,QAAM,SAAS,aAAa,IAAI,CAAC,aAAY;AAC3C,WAAO;MACL,SACE,mBACA,SAAS,OACT;MACF,MAAM,yBAAyB;MAC/B,YAAY,CAAC,QAAQ;;EAEzB,CAAC;AAED,SAAO;AACT;AAEM,SAAU,wBACd,YACA,YAAoB;AAEpB,QAAM,eAAe,WAAW,OAAO,CAAC,UAAc;AACpD,WACE,MAAM,cAAc,UAAa,CAAC,WAAW,SAAS,MAAM,SAAS;EAEzE,CAAC;AAED,QAAM,SAAS,aAAa,IAAI,CAAC,YAAW;AAC1C,UAAM,MACJ,iBAAiB,QAAQ,IAAI,8DAA8D,QAAQ,SAAS;AAE9G,WAAO;MACL,SAAS;MACT,MAAM,yBAAyB;MAC/B,YAAY,CAAC,OAAO;;EAExB,CAAC;AAED,SAAO;AACT;AAEM,SAAU,wBACd,YAAuB;AAEvB,QAAM,SAAkC,CAAA;AAExC,QAAM,cAAc,WAAW,OAC7B,CAAC,QAAQ,SAAS,QAAO;AACvB,UAAM,UAAU,QAAQ;AAExB,QAAI,YAAY,MAAM,IAAI;AACxB,aAAO;IACT;AAIA,QAAI,OAAO,YAAY,UAAU;AAC/B,aAAO,KAAK,EAAE,KAAK,SAAS,KAAK,WAAW,QAAO,CAAE;IACvD,WAAW,mBAAmB,UAAU,WAAW,OAAO,GAAG;AAC3D,aAAO,KAAK,EAAE,KAAK,QAAQ,QAAQ,KAAK,WAAW,QAAO,CAAE;IAC9D;AACA,WAAO;EACT,GACA,CAAA,CAA0D;AAG5D,aAAW,QAAQ,CAAC,UAAU,SAAQ;AACpC,gBAAY,QAAQ,CAAC,EAAE,KAAK,MAAM,KAAK,MAAM,WAAW,SAAQ,MAAM;AACpE,UAAI,OAAO,QAAQ,uBAAuB,MAAM,SAAS,OAAO,GAAG;AACjE,cAAM,MACJ,YAAY,SAAS,IAAI;4CACoB,SAAS,IAAI;;AAG5D,eAAO,KAAK;UACV,SAAS;UACT,MAAM,yBAAyB;UAC/B,YAAY,CAAC,UAAU,QAAQ;SAChC;MACH;IACF,CAAC;EACH,CAAC;AAED,SAAO;AACT;AAEA,SAAS,uBAAuB,KAAa,SAAY;AACvD,MAAI,mBAAmB,QAAQ;AAC7B,QAAI,sBAAsB,OAAO,GAAG;AAKlC,aAAO;IACT;AACA,UAAM,cAAc,QAAQ,KAAK,GAAG;AACpC,WAAO,gBAAgB,QAAQ,YAAY,UAAU;EACvD,WAAW,OAAO,YAAY,YAAY;AAExC,WAAO,QAAQ,KAAK,GAAG,CAAA,GAAI,CAAA,CAAE;EAC/B,WAAW,OAAO,OAAO,SAAS,MAAM,GAAG;AAEzC,WAAO,QAAQ,KAAK,KAAK,GAAG,CAAA,GAAI,CAAA,CAAE;EACpC,WAAW,OAAO,YAAY,UAAU;AACtC,WAAO,YAAY;EACrB,OAAO;AACL,UAAM,MAAM,sBAAsB;EACpC;AACF;AAEA,SAAS,WAAW,QAAc;AAEhC,QAAM,YAAY;IAChB;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;;AAEF,SACE,UAAU,KAAK,CAAC,SAAS,OAAO,OAAO,QAAQ,IAAI,MAAM,EAAE,MAAM;AAErE;AAEA,SAAS,sBAAsB,QAAc;AAC3C,SAAO,oCAAoC,KAAK,OAAO,MAAM;AAC/D;AASM,SAAU,cAAc,SAAe;AAC3C,QAAM,QAAQ,QAAQ,aAAa,OAAO;AAC1C,SAAO,IAAI,OAAO,GAAG,QAAQ,MAAM,IAAI,KAAK;AAC9C;AAEM,SAAU,qBACd,iBACA,YACA,0BAA6C;AAE7C,QAAM,SAAkC,CAAA;AAGxC,MAAI,CAAC,OAAO,OAAO,iBAAiB,YAAY,GAAG;AACjD,WAAO,KAAK;MACV,SACE,wDACA,eACA;MACF,MAAM,yBAAyB;KAChC;EACH;AACA,MAAI,CAAC,OAAO,OAAO,iBAAiB,KAAK,GAAG;AAC1C,WAAO,KAAK;MACV,SACE,wDACA,QACA;MACF,MAAM,yBAAyB;KAChC;EACH;AAEA,MACE,OAAO,OAAO,iBAAiB,KAAK,KACpC,OAAO,OAAO,iBAAiB,YAAY,KAC3C,CAAC,OAAO,OAAO,gBAAgB,OAAO,gBAAgB,WAAW,GACjE;AACA,WAAO,KAAK;MACV,SACE,kDAAkD,YAAY,MAAM,gBAAgB,WAAW;;MAEjG,MAAM,yBAAyB;KAChC;EACH;AAEA,MAAI,OAAO,OAAO,iBAAiB,KAAK,GAAG;AACzC,WAAO,KAAK,gBAAgB,KAAK,EAAE,QAAQ,CAAC,iBAAgB;AAC1D,YAAM,gBAAgB,gBAAgB,MAAM,YAAY;AACxD,oBAAc,QAAQ,CAAC,aAAa,YAAW;AAC7C,YAAI,gBAAgB,QAAW;AAC7B,iBAAO,KAAK;YACV,SACE,sEACI,YAAY,gBAAgB,OAAO;;YACzC,MAAM,yBAAyB;WAChC;QACH,WAAW,OAAO,OAAO,aAAa,YAAY,GAAG;AACnD,gBAAM,YAAY,MAAM,QAAQ,YAAY,UAAU,IAClD,YAAY,aACZ,CAAC,YAAY,UAAU;AAC3B,oBAAU,QAAQ,CAAC,kBAAiB;AAClC,gBACE,kBAAkB,UAClB,CAAC,cAAc,SAAS,aAAa,GACrC;AACA,qBAAO,KAAK;gBACV,SAAS,8DAA8D,cAAe,IAAI,eAAe,YAAY,IAAI,sBAAsB,YAAY;;gBAC3J,MAAM,yBAAyB;eAChC;YACH;UACF,CAAC;QACH;MACF,CAAC;IACH,CAAC;EACH;AAEA,SAAO;AACT;AAEM,SAAU,4BACd,iBACA,YACA,0BAA6C;AAE7C,QAAM,WAAW,CAAA;AACjB,MAAI,kBAAkB;AACtB,QAAM,gBAAgB,OAAO,OAAO,gBAAgB,SAAS,CAAA,CAAE,EAC5D,KAAI,EACJ,OAAO,OAAO;AAEjB,QAAM,qBAAqB,cAAc,OACvC,CAAC,aAAa,SAAS,OAAO,MAAM,MAAM,EAAE;AAE9C,QAAM,sBAAsB,aAAa,wBAAwB;AACjE,MAAI,YAAY;AACd,uBAAmB,QAAQ,CAAC,YAAW;AACrC,YAAM,YAAY,sBAAsB,SAAS,mBAAmB;AACpE,UAAI,cAAc,OAAO;AACvB,cAAM,UAAU,2BAA2B,SAAS,SAAS;AAC7D,cAAM,oBAAoB;UACxB;UACA,MAAM,UAAU;UAChB,WAAW;;AAEb,iBAAS,KAAK,iBAAiB;MACjC,OAAO;AAEL,YAAI,OAAO,OAAO,SAAS,aAAa,GAAG;AACzC,cAAI,QAAQ,gBAAgB,MAAM;AAChC,8BAAkB;UACpB;QACF,OAAO;AACL,cACE,iBAAiB,qBAAqB,QAAQ,OAAiB,GAC/D;AACA,8BAAkB;UACpB;QACF;MACF;IACF,CAAC;EACH;AAEA,MAAI,cAAc,CAAC,iBAAiB;AAClC,aAAS,KAAK;MACZ,SACE;MAKF,MAAM,yBAAyB;KAChC;EACH;AACA,SAAO;AACT;AAEM,SAAU,iBAAiB,aAEhC;AACC,QAAM,eAAoB,CAAA;AAC1B,QAAM,YAAY,OAAO,KAAK,WAAW;AAEzC,YAAU,QAAQ,CAAC,YAAW;AAC5B,UAAM,iBAAiB,YAAY,OAAO;AAG1C,QAAI,MAAM,QAAQ,cAAc,GAAG;AACjC,mBAAa,OAAO,IAAI,CAAA;IAC1B,OAAO;AACL,YAAM,MAAM,sBAAsB;IACpC;EACF,CAAC;AAED,SAAO;AACT;AAGM,SAAU,gBAAgB,WAAoB;AAClD,QAAM,UAAU,UAAU;AAE1B,MAAI,mBAAmB,QAAQ;AAC7B,WAAO;EACT,WAAW,OAAO,YAAY,YAAY;AAExC,WAAO;EACT,WAAW,OAAO,OAAO,SAAgB,MAAM,GAAG;AAEhD,WAAO;EACT,WAAW,OAAO,YAAY,UAAU;AACtC,WAAO;EACT,OAAO;AACL,UAAM,MAAM,sBAAsB;EACpC;AACF;AAEM,SAAU,eAAe,SAAY;AACzC,MAAI,OAAO,YAAY,YAAY,QAAQ,WAAW,GAAG;AACvD,WAAO,QAAQ,WAAW,CAAC;EAC7B,OAAO;AACL,WAAO;EACT;AACF;AAKO,IAAM,gCAAwD;;EAEnE,MAAM,SAAU,MAAI;AAClB,UAAM,MAAM,KAAK;AACjB,aAAS,IAAI,KAAK,WAAW,IAAI,KAAK,KAAK;AACzC,YAAM,IAAI,KAAK,WAAW,CAAC;AAC3B,UAAI,MAAM,IAAI;AACZ,aAAK,YAAY,IAAI;AACrB,eAAO;MACT,WAAW,MAAM,IAAI;AACnB,YAAI,KAAK,WAAW,IAAI,CAAC,MAAM,IAAI;AACjC,eAAK,YAAY,IAAI;QACvB,OAAO;AACL,eAAK,YAAY,IAAI;QACvB;AACA,eAAO;MACT;IACF;AACA,WAAO;EACT;EAEA,WAAW;;AAGb,SAAS,sBACP,SACA,yBAAiC;AASjC,MAAI,OAAO,OAAO,SAAS,aAAa,GAAG;AAGzC,WAAO;EACT,OAAO;AAEL,QAAI,QAAQ,mBAAmB,QAAQ;AACrC,UAAI;AAEF,yBAAiB,yBAAyB,QAAQ,OAAiB;MACrE,SAAS,GAAG;AAEV,eAAO;UACL,OAAO,yBAAyB;UAChC,QAAS,EAAY;;MAEzB;AACA,aAAO;IACT,WAAW,OAAO,QAAQ,YAAY,UAAU;AAE9C,aAAO;IACT,WAAW,gBAAgB,OAAO,GAAG;AAEnC,aAAO,EAAE,OAAO,yBAAyB,kBAAiB;IAC5D,OAAO;AACL,YAAM,MAAM,sBAAsB;IACpC;EACF;AACF;AAEM,SAAU,2BACd,SACA,SAKC;AAGD,MAAI,QAAQ,UAAU,yBAAyB,qBAAqB;AAClE,WACE;0BAC4B,QAAQ,IAAI;gBACtB,QAAQ,MAAM;;EAGpC,WAAW,QAAQ,UAAU,yBAAyB,mBAAmB;AACvE,WACE;0BAC4B,QAAQ,IAAI;;EAG5C,OAAO;AACL,UAAM,MAAM,sBAAsB;EACpC;AACF;AAEA,SAAS,aAAa,cAAiC;AACrD,QAAM,YAAY,aAAa,IAAI,CAAC,gBAAe;AACjD,QAAI,OAAO,gBAAgB,UAAU;AACnC,aAAO,YAAY,WAAW,CAAC;IACjC,OAAO;AACL,aAAO;IACT;EACF,CAAC;AAED,SAAO;AACT;AAEA,SAAS,iBACPC,MACA,KACA,OAAQ;AAER,MAAIA,KAAI,GAAG,MAAM,QAAW;AAC1B,IAAAA,KAAI,GAAG,IAAI,CAAC,KAAK;EACnB,OAAO;AACL,IAAAA,KAAI,GAAG,EAAE,KAAK,KAAK;EACrB;AACF;AAEO,IAAM,qBAAqB;AAiBlC,IAAI,4BAAsC,CAAA;AACpC,SAAU,yBAAyB,UAAgB;AACvD,SAAO,WAAW,qBACd,WACA,0BAA0B,QAAQ;AACxC;AAUA,SAAS,kCAA+B;AACtC,MAAI,0BAA0B,WAAW,GAAG;AAC1C,gCAA4B,IAAI,MAAM,KAAK;AAC3C,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,gCAA0B,CAAC,IAAI,IAAI,MAAM,MAAM,CAAC,EAAE,IAAI,OAAO;IAC/D;EACF;AACF;;;AC/mCM,SAAU,uBACd,aACA,gBAAyB;AAEzB,QAAM,eAAe,YAAY;AACjC,MAAI,iBAAiB,eAAe,cAAc;AAChD,WAAO;EACT,OAAO;AACL,WACE,eAAe,aAAa,QAC5B,eAAe,mBAAoB,YAAY,MAAM;EAEzD;AACF;AAIM,SAAU,mCACd,OACA,SAAkB;AAElB,SAAO,MAAM,iBAAiB,QAAQ;AACxC;AAEO,IAAI,oBAAoB;AACxB,IAAM,kBAAqD,CAAA;AAE5D,SAAU,kBAAkB,YAAuB;AAEvD,QAAM,uBAAuB,iBAAiB,UAAU;AAGxD,0BAAwB,oBAAoB;AAG5C,0BAAwB,oBAAoB;AAC5C,6BAA2B,oBAAoB;AAE/C,uBAAqB,QAAQ,CAAC,YAAW;AACvC,YAAQ,WAAW,QAAQ,gBAAiB,SAAS;EACvD,CAAC;AACH;AAEM,SAAU,iBAAiB,YAAuB;AACtD,MAAI,SAAS,CAAC,GAAG,UAAU;AAE3B,MAAI,aAAa;AACjB,MAAI,YAAY;AAChB,SAAO,WAAW;AAChB,iBAAa,WACV,IAAI,CAAC,gBAAgB,YAAY,UAAU,EAC3C,KAAI,EACJ,OAAO,OAAO;AAEjB,UAAM,gBAAgB,WAAW,OAAO,CAAC,MAAM,CAAC,OAAO,SAAS,CAAC,CAAC;AAElE,aAAS,OAAO,OAAO,aAAa;AAEpC,QAAI,cAAc,WAAW,GAAG;AAC9B,kBAAY;IACd,OAAO;AACL,mBAAa;IACf;EACF;AACA,SAAO;AACT;AAEM,SAAU,wBAAwB,YAAuB;AAC7D,aAAW,QAAQ,CAAC,gBAAe;AACjC,QAAI,CAAC,oBAAoB,WAAW,GAAG;AACrC,sBAAgB,iBAAiB,IAAI;AAC/B,kBAAa,eAAe;IACpC;AAGA,QACE,sBAAsB,WAAW,KACjC,CAAC,MAAM,QAAQ,YAAY,UAAU,GAGrC;AACA,kBAAY,aAAa,CAAC,YAAY,UAAkC;IAC1E;AAEA,QAAI,CAAC,sBAAsB,WAAW,GAAG;AACvC,kBAAY,aAAa,CAAA;IAC3B;AAEA,QAAI,CAAC,gCAAgC,WAAW,GAAG;AACjD,kBAAY,kBAAkB,CAAA;IAChC;AAEA,QAAI,CAAC,mCAAmC,WAAW,GAAG;AACpD,kBAAY,qBAAqB,CAAA;IACnC;EACF,CAAC;AACH;AAEM,SAAU,2BAA2B,YAAuB;AAChE,aAAW,QAAQ,CAAC,gBAAe;AAEjC,gBAAY,kBAAkB,CAAA;AAC9B,WAAO,KAAK,YAAY,kBAAmB,EAAE,QAAQ,CAAC,QAAO;AAC3D,kBAAY,gBAAiB,KAC3B,gBAAgB,GAAwB,EAAE,YAAa;IAE3D,CAAC;EACH,CAAC;AACH;AAEM,SAAU,wBAAwB,YAAuB;AAC7D,aAAW,QAAQ,CAAC,gBAAe;AACjC,kCAA8B,CAAA,GAAI,WAAW;EAC/C,CAAC;AACH;AAEM,SAAU,8BACd,MACA,UAAmB;AAEnB,OAAK,QAAQ,CAAC,aAAY;AACxB,aAAS,mBAAoB,SAAS,YAAa,IAAI;EACzD,CAAC;AAED,WAAS,WAAY,QAAQ,CAAC,iBAAgB;AAC5C,UAAM,UAAU,KAAK,OAAO,QAAQ;AAEpC,QAAI,CAAC,QAAQ,SAAS,YAAY,GAAG;AACnC,oCAA8B,SAAS,YAAY;IACrD;EACF,CAAC;AACH;AAEM,SAAU,oBAAoB,SAAkB;AACpD,SAAO,OAAO,OAAO,YAAO,QAAP,YAAO,SAAP,UAAW,CAAA,GAAI,cAAc;AACpD;AAEM,SAAU,sBAAsB,SAAkB;AACtD,SAAO,OAAO,OAAO,YAAO,QAAP,YAAO,SAAP,UAAW,CAAA,GAAI,YAAY;AAClD;AAEM,SAAU,gCAAgC,SAAkB;AAChE,SAAO,OAAO,OAAO,YAAO,QAAP,YAAO,SAAP,UAAW,CAAA,GAAI,iBAAiB;AACvD;AAEM,SAAU,mCACd,SAAkB;AAElB,SAAO,OAAO,OAAO,YAAO,QAAP,YAAO,SAAP,UAAW,CAAA,GAAI,oBAAoB;AAC1D;AAEM,SAAU,YAAY,SAAkB;AAC5C,SAAO,OAAO,OAAO,YAAO,QAAP,YAAO,SAAP,UAAW,CAAA,GAAI,cAAc;AACpD;;;ACzJO,IAAM,4BAAwD;EACnE,iCAAiC,OAAa;AAC5C,WAAO,uDAAuD,MAAM,KAAK;EAC3E;EAEA,iCACE,UACA,aACA,QACA,MACA,QACA,MAAa;AAEb,WACE,2BAA2B,SAAS,OAClC,WAAW,CACZ,iBAAiB,WAAW,aAAkB,MAAM;EAEzD;;;;ACaF,IAAY;CAAZ,SAAYC,2BAAwB;AAClC,EAAAA,0BAAAA,0BAAA,iBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,iBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,kBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,yBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,0BAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,0BAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,0BAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,uCAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,yCAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,oDAAA,IAAA,CAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,2CAAA,IAAA,EAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,kBAAA,IAAA,EAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,qBAAA,IAAA,EAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,sBAAA,IAAA,EAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,qBAAA,IAAA,EAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,qBAAA,IAAA,EAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,mBAAA,IAAA,EAAA,IAAA;AACA,EAAAA,0BAAAA,0BAAA,iDAAA,IAAA,EAAA,IAAA;AACF,GAnBY,6BAAA,2BAAwB,CAAA,EAAA;AAyBpC,IAAM,uBAA+C;EACnD,+BAA+B;EAC/B,kBAAkB;EAClB,wBAAwB;EACxB,0BAA0B,CAAC,MAAM,IAAI;EACrC,qBAAqB;EACrB,UAAU;EACV,sBAAsB;EACtB,eAAe;EACf,iBAAiB;EACjB,iBAAiB;;AAGnB,OAAO,OAAO,oBAAoB;AAE5B,IAAO,QAAP,MAAY;EA4BhB,YACY,iBACV,SAAuB,sBAAoB;AADjC,SAAA,kBAAA;AAvBL,SAAA,wBAAiD,CAAA;AACjD,SAAA,yBAAkD,CAAA;AAE/C,SAAA,qBAAuD,CAAA;AACvD,SAAA,+BAEN,CAAA;AAEM,SAAA,QAAkB,CAAA;AAElB,SAAA,cAA+C,CAAA;AAGjD,SAAA,kBAA2B;AAC3B,SAAA,gBAAyB;AACzB,SAAA,YAAqB;AACrB,SAAA,qBAA8C,CAAA;AAwzBtD,SAAA,aAAa,CAAI,WAAmB,cAAyB;AAG3D,UAAI,KAAK,kBAAkB,MAAM;AAC/B,aAAK;AACL,cAAM,SAAS,IAAI,MAAM,KAAK,kBAAkB,CAAC,EAAE,KAAK,GAAI;AAC5D,YAAI,KAAK,kBAAkB,KAAK,mBAAmB;AACjD,kBAAQ,IAAI,GAAG,MAAM,QAAQ,SAAS,GAAG;QAC3C;AACA,cAAM,EAAE,MAAM,MAAK,IAAK,MAAM,SAAS;AAEvC,cAAM,cAAc,OAAO,KAAK,QAAQ,OAAO,QAAQ;AACvD,YAAI,KAAK,kBAAkB,KAAK,mBAAmB;AACjD,sBAAY,GAAG,MAAM,QAAQ,SAAS,WAAW,IAAI,IAAI;QAC3D;AACA,aAAK;AACL,eAAO;MACT,OAAO;AACL,eAAO,UAAS;MAClB;IACF;AAl0BE,QAAI,OAAO,WAAW,WAAW;AAC/B,YAAM,MACJ,4HACiD;IAErD;AAEA,SAAK,SAAS,OAAO,OAAO,CAAA,GAAI,sBAAsB,MAAM;AAE5D,UAAM,eAAe,KAAK,OAAO;AACjC,QAAI,iBAAiB,MAAM;AACzB,WAAK,oBAAoB;AACzB,WAAK,gBAAgB;IACvB,WAAW,OAAO,iBAAiB,UAAU;AAC3C,WAAK,oBAAoB;AACzB,WAAK,gBAAgB;IACvB;AACA,SAAK,kBAAkB;AAEvB,SAAK,WAAW,qBAAqB,MAAK;AACxC,UAAI;AACJ,UAAI,oBAAoB;AACxB,WAAK,WAAW,yBAAyB,MAAK;AAC5C,YACE,KAAK,OAAO,2BACZ,qBAAqB,wBACrB;AAEA,eAAK,OAAO,yBAAyB;QACvC,OAAO;AACL,cACE,KAAK,OAAO,6BACZ,qBAAqB,0BACrB;AACA,kBAAM,MACJ,iLAC2G;UAE/G;QACF;AAEA,YAAI,OAAO,YAAY,OAAO,qBAAqB;AACjD,gBAAM,MACJ,oEAAoE;QAExE;AAEA,aAAK,kBAAkB,kBAAkB,KACvC,KAAK,OAAO,gBAAgB;AAE9B,aAAK,gBAAgB,QAAQ,KAAK,KAAK,OAAO,gBAAgB;AAG9D,YAAI,MAAM,QAAQ,eAAe,GAAG;AAClC,6BAAmB;YACjB,OAAO,EAAE,aAAa,CAAC,GAAG,eAAe,EAAC;YAC1C,aAAa;;QAEjB,OAAO;AAEL,8BAAoB;AACpB,6BAAgB,OAAA,OAAA,CAAA,GACiB,eAAgB;QAEnD;MACF,CAAC;AAED,UAAI,KAAK,OAAO,oBAAoB,OAAO;AACzC,aAAK,WAAW,wBAAwB,MAAK;AAC3C,eAAK,wBAAwB,KAAK,sBAAsB,OACtD,qBACE,kBACA,KAAK,iBACL,KAAK,OAAO,wBAAwB,CACrC;QAEL,CAAC;AAED,aAAK,WAAW,+BAA+B,MAAK;AAClD,eAAK,yBAAyB,KAAK,uBAAuB,OACxD,4BACE,kBACA,KAAK,iBACL,KAAK,OAAO,wBAAwB,CACrC;QAEL,CAAC;MACH;AAGA,uBAAiB,QAAQ,iBAAiB,QACtC,iBAAiB,QACjB,CAAA;AAIJ,aAAO,QAAQ,iBAAiB,KAAK,EAAE,QACrC,CAAC,CAAC,cAAc,aAAa,MAAK;AAChC,yBAAiB,MAAM,YAAY,IAAI,cAAc,OACnD,CAAC,gBAA2B,gBAAgB,MAAS;MAEzD,CAAC;AAGH,YAAM,eAAe,OAAO,KAAK,iBAAiB,KAAK;AAEvD,aAAO,QAAQ,iBAAiB,KAAK,EAAE,QACrC,CAAC,CAAC,aAAa,UAAU,MAA4B;AACnD,aAAK,WAAW,UAAU,WAAW,gBAAgB,MAAK;AACxD,eAAK,MAAM,KAAK,WAAW;AAE3B,cAAI,KAAK,OAAO,oBAAoB,OAAO;AACzC,iBAAK,WAAW,oBAAoB,MAAK;AACvC,mBAAK,wBAAwB,KAAK,sBAAsB,OACtD,iBAAiB,YAAY,YAAY,CAAC;YAE9C,CAAC;UACH;AAKA,cAAI,KAAK,sBAAsB,WAAW,GAAG;AAC3C,8BAAkB,UAAU;AAE5B,gBAAI;AACJ,iBAAK,WAAW,qBAAqB,MAAK;AACxC,kCAAoB,kBAAkB,YAAY;gBAChD,0BACE,KAAK,OAAO;gBACd,kBAAkB,OAAO;gBACzB,qBAAqB,OAAO;gBAC5B,UAAU,OAAO;gBACjB,QAAQ,KAAK;eACd;YACH,CAAC;AAED,iBAAK,mBAAmB,WAAW,IACjC,kBAAkB;AAEpB,iBAAK,6BAA6B,WAAW,IAC3C,kBAAkB;AAEpB,iBAAK,cAAc,OAAO,OACxB,CAAA,GACA,KAAK,aACL,kBAAkB,WAAW;AAG/B,iBAAK,YAAY,kBAAkB,aAAa,KAAK;AAErD,iBAAK,mBAAmB,WAAW,IACjC,kBAAkB;UACtB;QACF,CAAC;MACH,CAAC;AAGH,WAAK,cAAc,iBAAiB;AAEpC,UACE,KAAK,sBAAsB,SAAS,KACpC,CAAC,KAAK,OAAO,+BACb;AACA,cAAM,iBAAiB,KAAK,sBAAsB,IAAI,CAAC,UAAS;AAC9D,iBAAO,MAAM;QACf,CAAC;AACD,cAAM,uBAAuB,eAAe,KAC1C,2BAA2B;AAE7B,cAAM,IAAI,MACR,8CAA8C,oBAAoB;MAEtE;AAGA,WAAK,uBAAuB,QAAQ,CAAC,sBAAqB;AACxD,sBAAc,kBAAkB,OAAO;MACzC,CAAC;AAED,WAAK,WAAW,wCAAwC,MAAK;AAK3D,YAAI,mBAAmB;AACrB,eAAK,cAAc,MAAK;UAAE;QAC5B;AAEA,YAAI,KAAK,oBAAoB,OAAO;AAClC,eAAK,mBAAmB,CAAC,MAAW;QACtC;AAEA,YAAI,KAAK,kBAAkB,OAAO;AAChC,eAAK,mCAAmC,MAAK;UAAE;QACjD;AAEA,YAAI,QAAQ,KAAK,KAAK,OAAO,gBAAgB,GAAG;AAC9C,eAAK,sBAAsB,KAAK;QAClC,WAAW,aAAa,KAAK,KAAK,OAAO,gBAAgB,GAAG;AAC1D,eAAK,sBAAsB,KAAK;QAClC,WAAW,cAAc,KAAK,KAAK,OAAO,gBAAgB,GAAG;AAC3D,eAAK,sBAAsB,KAAK;QAClC,OAAO;AACL,gBAAM,MACJ,8CAA8C,KAAK,OAAO,gBAAgB,GAAG;QAEjF;AAEA,YAAI,KAAK,WAAW;AAClB,eAAK,WAAW,KAAK;AACrB,eAAK,gBAAgB,KAAK;QAC5B,OAAO;AACL,eAAK,WAAW,KAAK;AACrB,eAAK,gBAAgB,KAAK;QAC5B;MACF,CAAC;AAED,WAAK,WAAW,gCAAgC,MAAK;AACnD,cAAM,mBAAmB,OAAO,QAAQ,KAAK,kBAAkB,EAAE,OAC/D,CAAC,mBAAmB,CAAC,UAAU,cAAc,MAAK;AAChD,cAAI,mBAAmB,OAAO;AAC5B,8BAAkB,KAAK,QAAQ;UACjC;AACA,iBAAO;QACT,GACA,CAAA,CAAc;AAGhB,YAAI,OAAO,uBAAuB,iBAAiB,SAAS,GAAG;AAC7D,gBAAM,MACJ,kBAAkB,iBAAiB,KACjC,IAAI,CACL;;yEAE4E;QAEjF;MACF,CAAC;AAED,WAAK,WAAW,0BAA0B,MAAK;AAC7C,+BAAsB;MACxB,CAAC;AAED,WAAK,WAAW,oBAAoB,MAAK;AACvC,yBAAiB,IAAI;MACvB,CAAC;IACH,CAAC;EACH;EAEO,SACL,MACA,cAAsB,KAAK,aAAW;AAEtC,QAAI,KAAK,sBAAsB,SAAS,GAAG;AACzC,YAAM,iBAAiB,KAAK,sBAAsB,IAAI,CAAC,UAAS;AAC9D,eAAO,MAAM;MACf,CAAC;AACD,YAAM,uBAAuB,eAAe,KAC1C,2BAA2B;AAE7B,YAAM,IAAI,MACR,yEACE,oBAAoB;IAE1B;AAEA,WAAO,KAAK,iBAAiB,MAAM,WAAW;EAChD;;;;;EAMQ,iBAAiB,MAAc,aAAmB;AACxD,QAAI,GACF,GACA,GACA,eACA,WACA,cACA,SACA,YACA,aACA,OACA,SACA,UACA,WACA,KACA;AACF,UAAM,UAAU;AAChB,UAAM,YAAY,QAAQ;AAC1B,QAAI,SAAS;AACb,QAAI,qBAAqB;AAKzB,UAAM,wBAAwB,KAAK,YAC/B,IACA,KAAK,MAAM,KAAK,SAAS,EAAE;AAC/B,UAAM,gBAAgB,IAAI,MAAM,qBAAqB;AACrD,UAAM,SAAyB,CAAA;AAC/B,QAAI,OAAO,KAAK,kBAAkB,IAAI;AACtC,QAAI,SAAS,KAAK,kBAAkB,IAAI;AACxC,UAAM,SAAc,iBAAiB,KAAK,WAAW;AACrD,UAAM,aAAa,KAAK;AACxB,UAAM,wBAAwB,KAAK,OAAO;AAE1C,QAAI,yBAAyB;AAC7B,QAAI,qBAAuC,CAAA;AAC3C,QAAI,mCAEA,CAAA;AAEJ,UAAM,YAAsB,CAAA;AAE5B,UAAM,aAA+B,CAAA;AACrC,WAAO,OAAO,UAAU;AACxB,QAAI,kBAAkB;AAEtB,UAAM,WAAW,CAAC,aAAoB;AAEpC,UACE,UAAU,WAAW;;MAGrB,SAAS,UAAU,cAAc,QACjC;AAGA,cAAMC,OACJ,KAAK,OAAO,qBAAqB,iCAC/B,QAAQ;AAGZ,eAAO,KAAK;UACV,QAAQ,SAAS;UACjB,MAAM,SAAS;UACf,QAAQ,SAAS;UACjB,QAAQ,SAAS,MAAM;UACvB,SAASA;SACV;MACH,OAAO;AACL,kBAAU,IAAG;AACb,cAAM,UAAU,UAAU,GAAG,EAAE;AAC/B,6BAAqB,KAAK,mBAAmB,OAAO;AACpD,2CACE,KAAK,6BAA6B,OAAO;AAC3C,iCAAyB,mBAAmB;AAC5C,cAAM,qBACJ,KAAK,mBAAmB,OAAO,KAAK,KAAK,OAAO,aAAa;AAE/D,YAAI,oCAAoC,oBAAoB;AAC1D,4BAAkB;QACpB,OAAO;AACL,4BAAkB;QACpB;MACF;IACF;AAEA,aAAS,UAAuB,SAAe;AAC7C,gBAAU,KAAK,OAAO;AACtB,yCACE,KAAK,6BAA6B,OAAO;AAE3C,2BAAqB,KAAK,mBAAmB,OAAO;AACpD,+BAAyB,mBAAmB;AAE5C,+BAAyB,mBAAmB;AAC5C,YAAM,qBACJ,KAAK,mBAAmB,OAAO,KAAK,KAAK,OAAO,aAAa;AAE/D,UAAI,oCAAoC,oBAAoB;AAC1D,0BAAkB;MACpB,OAAO;AACL,0BAAkB;MACpB;IACF;AAIA,cAAU,KAAK,MAAM,WAAW;AAEhC,QAAI;AAEJ,UAAM,kBAAkB,KAAK,OAAO;AAEpC,WAAO,SAAS,WAAW;AACzB,qBAAe;AACf,oBAAc;AAEd,YAAM,eAAe,QAAQ,WAAW,MAAM;AAC9C,UAAI;AACJ,UAAI,iBAAiB;AACnB,cAAM,mBAAmB,yBAAyB,YAAY;AAC9D,cAAM,mBACJ,iCAAiC,gBAAgB;AACnD,mCACE,qBAAqB,SAAY,mBAAmB;MACxD,OAAO;AACL,mCAA2B;MAC7B;AACA,YAAM,uBAAuB,yBAAyB;AAEtD,WAAK,IAAI,GAAG,IAAI,sBAAsB,KAAK;AACzC,qBAAa,yBAAyB,CAAC;AACvC,cAAM,cAAc,WAAW;AAC/B,kBAAU;AAGV,cAAM,iBAAiB,WAAW;AAClC,YAAI,mBAAmB,OAAO;AAC5B,cAAI,iBAAiB,gBAAgB;AAEnC,0BAAc;AACd,2BAAe;UACjB;QACF,WAAW,WAAW,aAAa,MAAM;AACvC,kBAAS,YAA4B,KACnC,SACA,QACA,eACA,MAAM;AAER,cAAI,UAAU,MAAM;AAClB,2BAAe,MAAM,CAAC;AACtB,0BAAc,aAAa;AAC3B,gBAAK,MAAqC,YAAY,QAAW;AAC/D,wBAAW,MAAqC;YAClD;UACF,OAAO;AACL,2BAAe;UACjB;QACF,OAAO;AACJ,sBAAuB,YAAY;AACpC,wBAAc,KAAK,YAAY,aAAuB,MAAM,MAAM;QACpE;AAGA,YAAI,gBAAgB,IAAI;AAGtB,sBAAY,WAAW;AACvB,cAAI,cAAc,QAAW;AAC3B,2BAAe,KAAK,UAAU,QAAQ,SAAS,WAAW;AAC1D,kBAAM,kBAAkB,UAAU;AAClC,iBAAK,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACpC,oBAAM,kBAAkB,mBAAmB,UAAU,CAAC,CAAC;AACvD,oBAAM,mBAAmB,gBAAgB;AACzC,2BAAa;AAIb,kBAAI,gBAAgB,aAAa,MAAM;AACrC,wBAAS,iBAAiC,KACxC,SACA,QACA,eACA,MAAM;AAER,oBAAI,UAAU,MAAM;AAClB,kCAAgB,MAAM,CAAC;AACvB,sBACG,MAAqC,YAAY,QAClD;AACA,iCAAc,MAAqC;kBACrD;gBACF,OAAO;AACL,kCAAgB;gBAClB;cACF,OAAO;AACJ,iCAA4B,YAAY;AACzC,gCAAgB,KAAK,MACnB,kBACA,MACA,MAAM;cAEV;AAEA,kBAAI,iBAAiB,cAAc,SAAS,aAAa,QAAQ;AAC/D,+BAAe;AACf,8BAAc,cAAc;AAC5B,0BAAU;AACV,6BAAa;AAGb;cACF;YACF;UACF;AACA;QACF;MACF;AAGA,UAAI,gBAAgB,IAAI;AACtB,gBAAQ,WAAW;AACnB,YAAI,UAAU,QAAW;AACvB,yBACE,iBAAiB,OACb,eACA,KAAK,UAAU,QAAQ,SAAS,WAAW;AACjD,oBAAU,WAAW;AACrB,qBAAW,KAAK,oBACd,cACA,QACA,SACA,WAAW,WACX,MACA,QACA,WAAW;AAGb,eAAK,cAAc,UAAU,OAAO;AAEpC,cAAI,UAAU,OAAO;AACnB,iCAAqB,KAAK,SACxB,eACA,oBACA,QAAQ;UAEZ,OAAO;AACL,mBAAO,KAAK,EAAE,KAAK,QAAQ;UAC7B;QACF;AAGA,YAAI,eAAe,QAAQ,WAAW,sBAAsB,MAAM;AAChE,cAAI,kBAAkB;AACtB,cAAI;AACJ,cAAI;AACJ,gCAAsB,YAAY;AAClC,aAAG;AAED,2BACE,iBAAiB,OACb,eACA,KAAK,UAAU,QAAQ,SAAS,WAAW;AACjD,8BAAkB,sBAAsB,KAAK,YAAY;AACzD,gBAAI,oBAAoB,MAAM;AAC5B,gCAAkB,sBAAsB,YAAY;AACpD;YACF;UACF,SAAS,oBAAoB;AAE7B,cAAI,oBAAoB,GAAG;AACzB,mBAAO,OAAQ;AACf,qBAAS,cAAc;AACvB,iBAAK,iCACH,UACA,OACA,iBACA,iBACA,MACA,QACA,WAAW;UAEf,OAAO;AACL,qBAAS,KAAK,iBAAiB,QAAS,WAAW;UACrD;QACF,OAAO;AACL,mBAAS,KAAK,iBAAiB,QAAS,WAAW;QACrD;AAEA,iBAAS,SAAS;AAGlB,aAAK,YAAY,YAAY,UAAU,WAAW,QAAS;MAC7D,OAAO;AAEL,cAAM,mBAAmB;AACzB,cAAM,YAAY;AAClB,cAAM,cAAc;AACpB,YAAI,mBAAmB,oBAAoB;AAE3C,eAAO,qBAAqB,SAAS,SAAS,WAAW;AACvD;AACA,eAAK,IAAI,GAAG,IAAI,wBAAwB,KAAK;AAC3C,kBAAMC,cAAa,mBAAmB,CAAC;AACvC,kBAAM,cAAcA,YAAW;AAG/B,kBAAM,iBAAiBA,YAAW;AAClC,gBAAI,mBAAmB,OAAO;AAC5B,kBAAI,QAAQ,WAAW,MAAM,MAAM,gBAAgB;AAEjD,mCAAmB;cACrB;YACF,WAAWA,YAAW,aAAa,MAAM;AACvC,iCACG,YAA4B,KAC3B,SACA,QACA,eACA,MAAM,MACF;YACV,OAAO;AACJ,0BAAuB,YAAY;AACpC,iCAAoB,YAAuB,KAAK,IAAI,MAAM;YAC5D;AAEA,gBAAI,qBAAqB,MAAM;AAC7B;YACF;UACF;QACF;AAEA,oBAAY,SAAS;AACrB,iBAAS,KAAK,iBAAiB,QAAS,SAAS;AAEjD,cAAM,KAAK,OAAO,qBAAqB,iCACrC,SACA,kBACA,WACA,WACA,aACA,UAAU,GAAG,EAAE,CAAC;AAElB,eAAO,KAAK;UACV,QAAQ;UACR,MAAM;UACN,QAAQ;UACR,QAAQ;UACR,SAAS;SACV;AAED,YAAI,oBAAoB,OAAO;AAC7B;QACF;MACF;IACF;AAIA,QAAI,CAAC,KAAK,WAAW;AAEnB,oBAAc,SAAS;IACzB;AAEA,WAAO;MACL,QAAQ;MACR;MACA;;EAEJ;EAEQ,YACN,QACA,UACA,WACA,UAAgB;AAEhB,QAAI,OAAO,QAAQ,MAAM;AAGvB,YAAM,WAAW,OAAO;AACxB,eAAS,QAAQ;AACjB,UAAI,aAAa,QAAW;AAC1B,kBAAU,KAAK,MAAM,QAAQ;MAC/B;IACF,WAAW,OAAO,SAAS,QAAW;AACpC,gBAAU,KAAK,MAAM,OAAO,IAAI;IAClC;EACF;;EAGQ,iCACN,UACA,OACA,WACA,iBACA,MACA,QACA,aAAmB;AAEnB,QAAI,cAAc;AAClB,QAAI,UAAU,QAAW;AAEvB,qBAAe,cAAc,cAAc;AAC3C,yBAAmB,eAAe,KAAK;AACvC,UAAI,EAAE,oBAAoB,KAAK,iBAAiB,OAAO;AAErD,iBAAS,UAAU,OAAO;AAG1B,iBAAS,YAAY,SAAS,IAAI,CAAC;MACrC;IAEF;EACF;EAEQ,iBAAiB,WAAmB,aAAmB;AAC7D,WAAO,YAAY;EACrB;EAMQ,sBACN,OACA,aACA,cACA,WAAoB;AAEpB,WAAO;MACL;MACA;MACA;MACA;;EAEJ;EAEQ,qBACN,OACA,aACA,cACA,WACA,WACA,aAAmB;AAEnB,WAAO;MACL;MACA;MACA;MACA;MACA;MACA;;EAEJ;EAEQ,gBACN,OACA,aACA,cACA,WACA,WACA,aACA,aAAmB;AAEnB,WAAO;MACL;MACA;MACA,WAAW,cAAc,cAAc;MACvC;MACA,SAAS;MACT;MACA,WAAW,cAAc,cAAc;MACvC;MACA;;EAEJ;EAUQ,kBACN,aACA,OACA,YAAkB;AAElB,gBAAY,KAAK,UAAU;AAC3B,WAAO;EACT;EAEQ,0BACN,aACA,OACA,YAAkB;AAElB,gBAAY,KAAK,IAAI;AACrB;AACA,WAAO;EACT;EAKQ,sBAAsB,OAAe,SAAY;EAAS;EAE1D,wBAAwB,OAAe,SAAY;AACzD,QAAI,YAAY,MAAM;AACpB,YAAM,UAAU;IAClB;EACF;EAEQ,MAAM,SAAiB,MAAc,QAAc;AACzD,UAAM,QAAQ,QAAQ,KAAK,IAAI;AAC/B,QAAI,UAAU,MAAM;AAClB,aAAO,KAAK,UAAU,QAAQ,QAAQ,SAAS;IACjD;AACA,WAAO;EACT;EAEQ,YACN,SACA,MACA,QAAc;AAEd,UAAM,QAAQ,QAAQ,KAAK,IAAI;AAC/B,QAAI,UAAU,MAAM;AAClB,aAAO,QAAQ,YAAY;IAC7B;AACA,WAAO;EACT;;AAz0Bc,MAAA,UACZ;AAGY,MAAA,KAAK;;;AC1Ef,SAAUC,YAAW,SAAkB;AAC3C,MAAIC,eAAc,OAAO,GAAG;AAC1B,WAAO,QAAQ;EACjB,OAAO;AACL,WAAO,QAAQ;EACjB;AACF;AAMM,SAAUC,eACd,KAAc;AAEd,SAAO,OAAO,IAAI,UAAU,YAAY,IAAI,UAAU;AACxD;AAEA,IAAM,SAAS;AACf,IAAM,aAAa;AACnB,IAAM,QAAQ;AACd,IAAM,QAAQ;AACd,IAAM,YAAY;AAClB,IAAM,WAAW;AACjB,IAAM,aAAa;AACnB,IAAM,cAAc;AACpB,IAAM,mBAAmB;AAEnB,SAAU,YAAY,QAAoB;AAC9C,SAAO,oBAAoB,MAAM;AACnC;AAEA,SAAS,oBAAoB,QAAoB;AAC/C,QAAM,UAAU,OAAO;AAEvB,QAAM,YAA4B,CAAA;AAClC,YAAU,OAAO,OAAO;AAExB,MAAI,YAAY,QAAW;AACzB,cAAU,UAAU;EACtB;AAEA,MAAI,OAAO,OAAO,QAAQ,MAAM,GAAG;AACjC,UACE;EAGJ;AAEA,MAAI,OAAO,OAAO,QAAQ,UAAU,GAAG;AAErC,cAAU,aAAkB,OAAO,UAAU;EAC/C;AAEA,oBAAkB,CAAC,SAAS,CAAC;AAE7B,MAAI,OAAO,OAAO,QAAQ,KAAK,GAAG;AAChC,cAAU,QAAQ,OAAO,KAAK;EAChC;AAEA,MAAI,OAAO,OAAO,QAAQ,KAAK,GAAG;AAChC,cAAU,QAAQ,OAAO,KAAK;EAChC;AAEA,MAAI,OAAO,OAAO,QAAQ,QAAQ,GAAG;AACnC,cAAU,WAAW,OAAO,QAAQ;EACtC;AAEA,MAAI,OAAO,OAAO,QAAQ,SAAS,GAAG;AACpC,cAAU,YAAY,OAAO,SAAS;EACxC;AAEA,MAAI,OAAO,OAAO,QAAQ,UAAU,GAAG;AACrC,cAAU,aAAa,OAAO,UAAU;EAC1C;AAEA,MAAI,OAAO,OAAO,QAAQ,WAAW,GAAG;AACtC,cAAU,cAAc,OAAO,WAAW;EAC5C;AAEA,MAAI,OAAO,OAAO,QAAQ,gBAAgB,GAAG;AAC3C,cAAU,mBAAmB,OAAO,gBAAgB;EACtD;AAEA,SAAO;AACT;AAEO,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,MAAM,GAAE,CAAE;AACjE,kBAAkB,CAAC,GAAG,CAAC;AAEjB,SAAU,oBACd,SACA,OACA,aACA,WACA,WACA,SACA,aACA,WAAiB;AAEjB,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;IACA;IACA,cAAoB,QAAS;IAC7B,WAAW;;AAEf;AAEM,SAAU,aAAa,OAAe,SAAkB;AAC5D,SAAO,uBAAuB,OAAO,OAAO;AAC9C;;;ACrGO,IAAM,6BAA0D;EACrE,0BAA0B,EAAE,UAAU,QAAQ,UAAU,SAAQ,GAAE;AAChE,UAAM,WAAWC,eAAc,QAAQ;AACvC,UAAM,cAAc,WAChB,OAAOC,YAAW,QAAQ,CAAC,SAC3B,qBAAqB,SAAS,IAAI;AAEtC,UAAM,MAAM,aAAa,WAAW,mBAAmB,OAAO,KAAK;AAEnE,WAAO;EACT;EAEA,8BAA8B,EAAE,gBAAgB,SAAQ,GAAE;AACxD,WAAO,+CAA+C,eAAe;EACvE;EAEA,wBAAwB,EACtB,qBACA,QACA,UACA,uBACA,SAAQ,GACT;AACC,UAAM,YAAY;AAElB,UAAM,aAAa,OAAO,CAAC,EAAG;AAC9B,UAAM,YAAY,mBAAmB,aAAa;AAElD,QAAI,uBAAuB;AACzB,aAAO,YAAY,wBAAwB;IAC7C,OAAO;AACL,YAAM,oBAAoB,oBAAoB,OAC5C,CAAC,QAAQ,iBAAiB,OAAO,OAAO,YAAY,GACpD,CAAA,CAAmB;AAErB,YAAM,0BAA0B,kBAAkB,IAChD,CAAC,aACC,IAAI,SACD,IAAI,CAAC,kBAAkBA,YAAW,aAAa,CAAC,EAChD,KAAK,IAAI,CAAC,GAAG;AAEpB,YAAM,yBAAyB,wBAAwB,IACrD,CAAC,SAAS,QAAQ,KAAK,MAAM,CAAC,KAAK,OAAO,EAAE;AAE9C,YAAM,wBAAwB;EAA2C,uBAAuB,KAC9F,IAAI,CACL;AAED,aAAO,YAAY,wBAAwB;IAC7C;EACF;EAEA,sBAAsB,EACpB,wBACA,QACA,uBACA,SAAQ,GACT;AACC,UAAM,YAAY;AAElB,UAAM,aAAa,OAAO,CAAC,EAAG;AAC9B,UAAM,YAAY,mBAAmB,aAAa;AAElD,QAAI,uBAAuB;AACzB,aAAO,YAAY,wBAAwB;IAC7C,OAAO;AACL,YAAM,0BAA0B,uBAAuB,IACrD,CAAC,aACC,IAAI,SACD,IAAI,CAAC,kBAAkBA,YAAW,aAAa,CAAC,EAChD,KAAK,GAAG,CAAC,GAAG;AAEnB,YAAM,wBACJ;KACI,wBAAwB,KAAK,IAAI,CAAC;AAExC,aAAO,YAAY,wBAAwB;IAC7C;EACF;;AAGF,OAAO,OAAO,0BAA0B;AAEjC,IAAM,sCACX;EACE,uBACE,cACA,eAA0B;AAE1B,UAAM,MACJ,kEACA,cAAc,kBACd,kCAEA,aAAa,OACb;AACF,WAAO;EACT;;AAGG,IAAM,uCACX;EACE,yBACE,cACA,gBAA2C;AAE3C,aAASC,4BACP,MAA+B;AAE/B,UAAI,gBAAgB,UAAU;AAC5B,eAAO,KAAK,aAAa;MAC3B,WAAW,gBAAgB,aAAa;AACtC,eAAO,KAAK;MACd,OAAO;AACL,eAAO;MACT;IACF;AAEA,UAAM,eAAe,aAAa;AAClC,UAAM,gBAAgB,eAAe,CAAC;AACtC,UAAM,QAAQ,cAAc;AAC5B,UAAM,UAAU,qBAAqB,aAAa;AAClD,UAAM,gBAAgBA,4BAA2B,aAAa;AAE9D,UAAM,mBAAmB,QAAQ;AACjC,QAAI,MAAM,KAAK,OAAO,GAAG,mBAAmB,QAAQ,EAAE,MACpD,gBAAgB,oBAAoB,aAAa,OAAO,EAC1D;4CAEc,eAAe,MACjB,oCAAoC,YAAY;;;AAK5D,UAAM,IAAI,QAAQ,WAAW,GAAG;AAChC,UAAM,IAAI,QAAQ,UAAU,IAAI;AAEhC,WAAO;EACT;EAEA,4BAA4B,MAAU;AACpC,UAAM,SACJ;0EAC2E,KAAK,IAAI;;;;AAKtF,WAAO;EACT;EAEA,qCAAqC,SAKpC;AACC,UAAM,UAAU,QAAQ,WACrB,IAAI,CAAC,YAAYD,YAAW,OAAO,CAAC,EACpC,KAAK,IAAI;AACZ,UAAM,aACJ,QAAQ,YAAY,QAAQ,IAAI,KAAK,QAAQ,YAAY;AAC3D,UAAM,SACJ,4BAA4B,QAAQ,iBAAiB,KACnD,IAAI,CACL;QACQ,UAAU,aAAa,QAAQ,aAAa,IAAI;GACrD,OAAO;;;AAIb,WAAO;EACT;EAEA,+BAA+B,SAK9B;AACC,UAAM,aACJ,QAAQ,YAAY,QAAQ,IAAI,KAAK,QAAQ,YAAY;AAE3D,UAAM,cAAc,QAAQ,WAAW,WAAW;AAElD,QAAI,cACF,qCAAqC,QAAQ,iBAAiB,KAC5D,IAAI,CACL,WAAW,UAAU,aACV,QAAQ,aAAa,IAAI;;AAEvC,QAAI,aAAa;AACf,qBACE;;;IAEJ,OAAO;AACL,YAAM,UAAU,QAAQ,WACrB,IAAI,CAAC,YAAYA,YAAW,OAAO,CAAC,EACpC,KAAK,IAAI;AACZ,qBAAe,IAAI,OAAO;;IAC5B;AAEA,mBACE;;AAEF,WAAO;EACT;EAEA,0BAA0B,SAGzB;AACC,QAAI,UAAU,qBAAqB,QAAQ,UAAU;AACrD,QAAI,QAAQ,WAAW,QAAQ,GAAG;AAChC,iBAAW,QAAQ,WAAW;IAChC;AAEA,UAAM,SACJ,mBAAmB,OAAO,kBAAkB,QAAQ,aAAa,IAAI;;AAGvE,WAAO;EACT;;;EAIA,oBAAoB,SAGnB;AAEC,WAAO;EACT;EAEA,2BAA2B,SAI1B;AACC,UAAM,SACJ,iCAAiC,QAAQ,iBAAiB,CAAC,WACjD,QAAQ,YAAY,GAAG,aAAa,QAAQ,aAAa,IAAI;;AAGzE,WAAO;EACT;EAEA,8BAA8B,SAG7B;AACC,UAAM,SACJ;KACM,QAAQ,YAAY,GAAG,aAC3B,QAAQ,aAAa,IACvB;OACE,QAAQ,YAAY,WAAW,SAAS,CAC1C;AAEF,WAAO;EACT;EAEA,wBAAwB,SAGvB;AACC,UAAM,WAAW,QAAQ,aAAa;AACtC,UAAM,YAAY,QAAQ,kBAAkB,IAC1C,CAAC,aAAa,SAAS,IAAI;AAE7B,UAAM,oBAAoB,GAAG,QAAQ,QAAQ,UAC1C,OAAO,CAAC,QAAQ,CAAC,EACjB,KAAK,OAAO,CAAC;AAChB,UAAM,SACJ;SACU,QAAQ;;GACwD,iBAAiB;;;AAI7F,WAAO;EACT;;;EAIA,0BAA0B,SAGzB;AAEC,WAAO;EACT;EAEA,4BAA4B,SAG3B;AACC,QAAI;AACJ,QAAI,QAAQ,wBAAwB,MAAM;AACxC,iBAAW,QAAQ,aAAa;IAClC,OAAO;AACL,iBAAW,QAAQ;IACrB;AAEA,UAAM,SAAS,iCAAiC,QAAQ,2CAA2C,QAAQ,WAAW;AAEtH,WAAO;EACT;;;;AC5TE,SAAU,eACd,WACA,gBAAoD;AAEpD,QAAM,cAAc,IAAI,uBAAuB,WAAW,cAAc;AACxE,cAAY,YAAW;AACvB,SAAO,YAAY;AACrB;AAEM,IAAO,yBAAP,cAAsC,YAAW;EAIrD,YACU,eACA,gBAAoD;AAE5D,UAAK;AAHG,SAAA,gBAAA;AACA,SAAA,iBAAA;AALH,SAAA,SAAgD,CAAA;EAQvD;EAEO,cAAW;AAChB,WAAO,OAAO,KAAK,aAAa,EAAE,QAAQ,CAAC,SAAQ;AACjD,WAAK,eAAe;AACpB,WAAK,OAAO,IAAI;IAClB,CAAC;EACH;EAEO,iBAAiB,MAAiB;AACvC,UAAM,MAAM,KAAK,cAAc,KAAK,eAAe;AAEnD,QAAI,CAAC,KAAK;AACR,YAAM,MAAM,KAAK,eAAe,uBAC9B,KAAK,cACL,IAAI;AAEN,WAAK,OAAO,KAAK;QACf,SAAS;QACT,MAAM,0BAA0B;QAChC,UAAU,KAAK,aAAa;QAC5B,mBAAmB,KAAK;OACzB;IACH,OAAO;AACL,WAAK,iBAAiB;IACxB;EACF;;;;AC1BI,IAAgB,mCAAhB,cAAyD,WAAU;EAUvE,YACY,SACA,MAAkB;AAE5B,UAAK;AAHK,SAAA,UAAA;AACA,SAAA,OAAA;AAXF,SAAA,mBAAgC,CAAA;AAIhC,SAAA,qBAAqB;AACrB,SAAA,2BAA2B;AAC3B,SAAA,QAAQ;AACR,SAAA,gBAAgB;EAO1B;EAEA,eAAY;AACV,SAAK,QAAQ;AAEb,QAAI,KAAK,KAAK,UAAU,CAAC,MAAM,KAAK,QAAQ,MAAM;AAChD,YAAM,MAAM,qDAAqD;IACnE;AAGA,SAAK,YAAY,CAAC,GAAG,KAAK,KAAK,SAAS,EAAE,QAAO;AACjD,SAAK,kBAAkB,CAAC,GAAG,KAAK,KAAK,eAAe,EAAE,QAAO;AAG7D,SAAK,UAAU,IAAG;AAClB,SAAK,gBAAgB,IAAG;AAExB,SAAK,mBAAkB;AACvB,SAAK,KAAK,KAAK,OAAO;AAEtB,WAAO,KAAK;EACd;EAEA,KACE,MACA,WAA0B,CAAA,GAAE;AAG5B,QAAI,CAAC,KAAK,OAAO;AACf,YAAM,KAAK,MAAM,QAAQ;IAC3B;EACF;EAEA,YACE,SACA,UACA,UAAuB;AAGvB,QACE,QAAQ,eAAe,SAAS,KAAK,sBACrC,QAAQ,QAAQ,KAAK,0BACrB;AACA,YAAM,WAAW,SAAS,OAAO,QAAQ;AACzC,WAAK,mBAAkB;AACvB,WAAK,KAAK,QAAQ,gBAAqB,QAAQ;IACjD;EACF;EAEA,qBAAkB;AAEhB,QAAI,KAAK,UAAU,WAAW,GAAG;AAG/B,WAAK,qBAAqB;AAC1B,WAAK,2BAA2B;AAChC,WAAK,gBAAgB;IACvB,OAAO;AACL,WAAK,qBAAqB,KAAK,UAAU,IAAG;AAC5C,WAAK,2BAA2B,KAAK,gBAAgB,IAAG;IAC1D;EACF;;AAGI,IAAO,uBAAP,cAAoC,iCAAgC;EAIxE,YACE,SACU,MAAuB;AAEjC,UAAM,SAAS,IAAI;AAFT,SAAA,OAAA;AALJ,SAAA,mBAAmB;AACnB,SAAA,yBAAyB;AAO/B,SAAK,mBAAmB,KAAK,KAAK,QAAQ;AAC1C,SAAK,yBAAyB,KAAK,KAAK;EAC1C;EAEA,aACE,UACA,UACA,UAAuB;AAEvB,QACE,KAAK,iBACL,SAAS,aAAa,SAAS,KAAK,oBACpC,SAAS,QAAQ,KAAK,0BACtB,CAAC,KAAK,OACN;AACA,YAAM,WAAW,SAAS,OAAO,QAAQ;AACzC,YAAM,WAAW,IAAI,YAAY,EAAE,YAAY,SAAQ,CAAE;AACzD,WAAK,mBAAmB,MAAM,QAAQ;AACtC,WAAK,QAAQ;IACf;EACF;;AAeI,IAAO,4CAAP,cAAyD,WAAU;EAOvE,YACY,SACA,YAAkB;AAE5B,UAAK;AAHK,SAAA,UAAA;AACA,SAAA,aAAA;AARF,SAAA,SAAgC;MACxC,OAAO;MACP,YAAY;MACZ,aAAa;;EAQf;EAEA,eAAY;AACV,SAAK,KAAK,KAAK,OAAO;AACtB,WAAO,KAAK;EACd;;AAGI,IAAO,8BAAP,cAA2C,0CAAyC;EACxF,SACE,UACA,UACA,UAAuB;AAEvB,QAAI,SAAS,QAAQ,KAAK,YAAY;AACpC,YAAM,iBAAiB,SAAS,OAAO,QAAQ,EAAE,CAAC;AAClD,WAAK,OAAO,cAAc,mBAAmB;AAC7C,UAAI,0BAA0B,UAAU;AACtC,aAAK,OAAO,QAAQ,eAAe;AACnC,aAAK,OAAO,aAAa,eAAe;MAC1C;IACF,OAAO;AACL,YAAM,SAAS,UAAU,UAAU,QAAQ;IAC7C;EACF;;AAGI,IAAO,iCAAP,cAA8C,0CAAyC;EAC3F,YACE,aACA,UACA,UAAuB;AAEvB,QAAI,YAAY,QAAQ,KAAK,YAAY;AACvC,YAAM,oBAAoB,SAAS,OAAO,QAAQ,EAAE,CAAC;AACrD,WAAK,OAAO,cAAc,sBAAsB;AAChD,UAAI,6BAA6B,UAAU;AACzC,aAAK,OAAO,QAAQ,kBAAkB;AACtC,aAAK,OAAO,aAAa,kBAAkB;MAC7C;IACF,OAAO;AACL,YAAM,YAAY,aAAa,UAAU,QAAQ;IACnD;EACF;;AAGI,IAAO,oCAAP,cAAiD,0CAAyC;EAC9F,eACE,gBACA,UACA,UAAuB;AAEvB,QAAI,eAAe,QAAQ,KAAK,YAAY;AAC1C,YAAM,uBAAuB,SAAS,OAAO,QAAQ,EAAE,CAAC;AACxD,WAAK,OAAO,cAAc,yBAAyB;AACnD,UAAI,gCAAgC,UAAU;AAC5C,aAAK,OAAO,QAAQ,qBAAqB;AACzC,aAAK,OAAO,aAAa,qBAAqB;MAChD;IACF,OAAO;AACL,YAAM,eAAe,gBAAgB,UAAU,QAAQ;IACzD;EACF;;AAII,IAAO,uCAAP,cAAoD,0CAAyC;EACjG,kBACE,mBACA,UACA,UAAuB;AAEvB,QAAI,kBAAkB,QAAQ,KAAK,YAAY;AAC7C,YAAM,oCAAoC,SAAS,OAAO,QAAQ,EAAE,CAAC;AACrE,WAAK,OAAO,cAAc,sCAAsC;AAChE,UAAI,6CAA6C,UAAU;AACzD,aAAK,OAAO,QAAQ,kCAAkC;AACtD,aAAK,OAAO,aAAa,kCAAkC;MAC7D;IACF,OAAO;AACL,YAAM,kBAAkB,mBAAmB,UAAU,QAAQ;IAC/D;EACF;;AAQI,SAAU,kBACd,WACA,WACA,WAAwB,CAAA,GAAE;AAG1B,aAAW,CAAC,GAAG,QAAQ;AACvB,MAAI,SAAmC,CAAA;AACvC,MAAI,IAAI;AAGR,WAAS,kBAAkB,SAAsB;AAC/C,WAAO,QAAQ,OAAO,UAAU,MAAM,IAAI,CAAC,CAAC;EAC9C;AAGA,WAAS,uBAAuB,YAAyB;AACvD,UAAM,eAAe,kBACnB,kBAAkB,UAAU,GAC5B,WACA,QAAQ;AAEV,WAAO,OAAO,OAAO,YAAY;EACnC;AASA,SAAO,SAAS,SAAS,aAAa,IAAI,UAAU,QAAQ;AAC1D,UAAM,OAAO,UAAU,CAAC;AAGxB,QAAI,gBAAgB,aAAa;AAC/B,aAAO,uBAAuB,KAAK,UAAU;IAC/C,WAAW,gBAAgB,aAAa;AACtC,aAAO,uBAAuB,KAAK,UAAU;IAC/C,WAAW,gBAAgB,QAAQ;AACjC,eAAS,uBAAuB,KAAK,UAAU;IACjD,WAAW,gBAAgB,qBAAqB;AAC9C,YAAM,SAAS,KAAK,WAAW,OAAO;QACpC,IAAI,WAAW;UACb,YAAY,KAAK;SAClB;OACF;AACD,aAAO,uBAAuB,MAAM;IACtC,WAAW,gBAAgB,kCAAkC;AAC3D,YAAM,SAAS;QACb,IAAI,YAAY,EAAE,YAAY,KAAK,WAAU,CAAE;QAC/C,IAAI,WAAW;UACb,YAAY,CAAC,IAAI,SAAS,EAAE,cAAc,KAAK,UAAS,CAAE,CAAC,EAAE,OACtD,KAAK,UAAU;SAEvB;;AAEH,aAAO,uBAAuB,MAAM;IACtC,WAAW,gBAAgB,yBAAyB;AAClD,YAAM,SAAS,KAAK,WAAW,OAAO;QACpC,IAAI,WAAW;UACb,YAAY,CAAC,IAAI,SAAS,EAAE,cAAc,KAAK,UAAS,CAAE,CAAC,EAAE,OACtD,KAAK,UAAU;SAEvB;OACF;AACD,eAAS,uBAAuB,MAAM;IACxC,WAAW,gBAAgB,YAAY;AACrC,YAAM,SAAS,KAAK,WAAW,OAAO;QACpC,IAAI,WAAW;UACb,YAAY,KAAK;SAClB;OACF;AACD,eAAS,uBAAuB,MAAM;IACxC,WAAW,gBAAgB,aAAa;AACtC,WAAK,WAAW,QAAQ,CAAC,YAAW;AAIlC,YAAI,QAAQ,WAAW,WAAW,GAAG;AACnC,mBAAS,uBAAuB,QAAQ,UAAU;QACpD;MACF,CAAC;AACD,aAAO;IACT,WAAW,gBAAgB,UAAU;AACnC,eAAS,KAAK,KAAK,YAAY;IACjC,OAAO;AACL,YAAM,MAAM,sBAAsB;IACpC;AAEA;EACF;AACA,SAAO,KAAK;IACV,aAAa;IACb,WAAW,UAAU,MAAM,CAAC;GAC7B;AAED,SAAO;AACT;AASM,SAAU,wBACd,YACA,aACA,YACA,cAAoB;AAEpB,QAAM,oBAAyB;AAE/B,QAAM,wBAAwB,CAAC,iBAAiB;AAChD,QAAM,mBAAwB;AAC9B,MAAI,oBAAoB;AAExB,QAAM,oBAAoB,YAAY;AACtC,QAAM,2BAA2B,oBAAoB,eAAe;AAEpE,QAAM,SAA2B,CAAA;AAEjC,QAAM,gBAAkC,CAAA;AACxC,gBAAc,KAAK;IACjB,KAAK;IACL,KAAK;IACL,WAAW,CAAA;IACX,iBAAiB,CAAA;GAClB;AAED,SAAO,cAAc,WAAW,GAAG;AACjC,UAAM,WAAW,cAAc,IAAG;AAGlC,QAAI,aAAa,kBAAkB;AACjC,UACE,qBACA,cAAc,GAAG,EAAE,EAAG,OAAO,0BAC7B;AAEA,sBAAc,IAAG;MACnB;AACA;IACF;AAEA,UAAM,UAAU,SAAS;AACzB,UAAM,UAAU,SAAS;AACzB,UAAM,gBAAgB,SAAS;AAC/B,UAAM,sBAAsB,SAAS;AAGrC,QAAI,QAAQ,WAAW,GAAG;AACxB;IACF;AAEA,UAAM,OAAO,QAAQ,CAAC;AAEtB,QAAI,SAAS,mBAAmB;AAC9B,YAAM,WAAW;QACf,KAAK;QACL,KAAK,QAAQ,MAAM,CAAC;QACpB,WAAW,cAAc,MAAM,GAAG,EAAE;QACpC,iBAAiB,oBAAoB,MAAM,GAAG,EAAE;;AAElD,oBAAc,KAAK,QAAQ;IAC7B,WAAW,gBAAgB,UAAU;AAEnC,UAAI,UAAU,oBAAoB,GAAG;AACnC,cAAM,UAAU,UAAU;AAC1B,cAAM,cAAc,YAAY,OAAO;AACvC,YAAI,WAAY,aAAa,KAAK,YAAY,GAAG;AAC/C,gBAAM,WAAW;YACf,KAAK;YACL,KAAK,QAAQ,MAAM,CAAC;YACpB,WAAW;YACX,iBAAiB;;AAEnB,wBAAc,KAAK,QAAQ;QAC7B;MAEF,WAAW,YAAY,oBAAoB,GAAG;AAE5C,eAAO,KAAK;UACV,eAAe,KAAK;UACpB,qBAAqB,KAAK;UAC1B,WAAW;UACX,iBAAiB;SAClB;AACD,4BAAoB;MACtB,OAAO;AACL,cAAM,MAAM,sBAAsB;MACpC;IACF,WAAW,gBAAgB,aAAa;AACtC,YAAM,eAAe,CAAC,GAAG,aAAa;AACtC,mBAAa,KAAK,KAAK,eAAe;AAEtC,YAAM,qBAAqB,CAAC,GAAG,mBAAmB;AAClD,yBAAmB,KAAK,KAAK,GAAG;AAEhC,YAAM,WAAW;QACf,KAAK;QACL,KAAK,KAAK,WAAW,OAAO,uBAAuB,QAAQ,MAAM,CAAC,CAAC;QACnE,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,QAAQ;IAC7B,WAAW,gBAAgB,QAAQ;AAEjC,YAAM,kBAAkB;QACtB,KAAK;QACL,KAAK,QAAQ,MAAM,CAAC;QACpB,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,eAAe;AAElC,oBAAc,KAAK,gBAAgB;AAEnC,YAAM,eAAe;QACnB,KAAK;QACL,KAAK,KAAK,WAAW,OAAO,QAAQ,MAAM,CAAC,CAAC;QAC5C,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,YAAY;IACjC,WAAW,gBAAgB,qBAAqB;AAE9C,YAAM,kBAAkB,IAAI,WAAW;QACrC,YAAY,KAAK;QACjB,KAAK,KAAK;OACX;AACD,YAAM,UAAU,KAAK,WAAW,OAC9B,CAAC,eAAe,GAChB,QAAQ,MAAM,CAAC,CAAC;AAElB,YAAM,WAAW;QACf,KAAK;QACL,KAAK;QACL,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,QAAQ;IAC7B,WAAW,gBAAgB,kCAAkC;AAE3D,YAAM,gBAAgB,IAAI,SAAS;QACjC,cAAc,KAAK;OACpB;AACD,YAAM,kBAAkB,IAAI,WAAW;QACrC,YAAY,CAAM,aAAa,EAAE,OAAO,KAAK,UAAU;QACvD,KAAK,KAAK;OACX;AACD,YAAM,UAAU,KAAK,WAAW,OAC9B,CAAC,eAAe,GAChB,QAAQ,MAAM,CAAC,CAAC;AAElB,YAAM,WAAW;QACf,KAAK;QACL,KAAK;QACL,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,QAAQ;IAC7B,WAAW,gBAAgB,yBAAyB;AAElD,YAAM,kBAAkB;QACtB,KAAK;QACL,KAAK,QAAQ,MAAM,CAAC;QACpB,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,eAAe;AAElC,oBAAc,KAAK,gBAAgB;AAEnC,YAAM,gBAAgB,IAAI,SAAS;QACjC,cAAc,KAAK;OACpB;AACD,YAAM,gBAAgB,IAAI,WAAW;QACnC,YAAY,CAAM,aAAa,EAAE,OAAO,KAAK,UAAU;QACvD,KAAK,KAAK;OACX;AACD,YAAM,UAAU,KAAK,WAAW,OAAO,CAAC,aAAa,GAAG,QAAQ,MAAM,CAAC,CAAC;AACxE,YAAM,eAAe;QACnB,KAAK;QACL,KAAK;QACL,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,YAAY;IACjC,WAAW,gBAAgB,YAAY;AAErC,YAAM,kBAAkB;QACtB,KAAK;QACL,KAAK,QAAQ,MAAM,CAAC;QACpB,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,eAAe;AAElC,oBAAc,KAAK,gBAAgB;AAGnC,YAAM,gBAAgB,IAAI,WAAW;QACnC,YAAY,KAAK;QACjB,KAAK,KAAK;OACX;AACD,YAAM,UAAU,KAAK,WAAW,OAAO,CAAC,aAAa,GAAG,QAAQ,MAAM,CAAC,CAAC;AACxE,YAAM,eAAe;QACnB,KAAK;QACL,KAAK;QACL,WAAW;QACX,iBAAiB;;AAEnB,oBAAc,KAAK,YAAY;IACjC,WAAW,gBAAgB,aAAa;AAEtC,eAAS,IAAI,KAAK,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;AACpD,cAAM,UAAe,KAAK,WAAW,CAAC;AACtC,cAAM,cAAc;UAClB,KAAK;UACL,KAAK,QAAQ,WAAW,OAAO,QAAQ,MAAM,CAAC,CAAC;UAC/C,WAAW;UACX,iBAAiB;;AAEnB,sBAAc,KAAK,WAAW;AAC9B,sBAAc,KAAK,gBAAgB;MACrC;IACF,WAAW,gBAAgB,aAAa;AACtC,oBAAc,KAAK;QACjB,KAAK;QACL,KAAK,KAAK,WAAW,OAAO,QAAQ,MAAM,CAAC,CAAC;QAC5C,WAAW;QACX,iBAAiB;OAClB;IACH,WAAW,gBAAgB,MAAM;AAE/B,oBAAc,KACZ,mBAAmB,MAAM,SAAS,eAAe,mBAAmB,CAAC;IAEzE,OAAO;AACL,YAAM,MAAM,sBAAsB;IACpC;EACF;AACA,SAAO;AACT;AAEA,SAAS,mBACP,SACA,SACA,eACA,qBAA6B;AAE7B,QAAM,eAAe,CAAC,GAAG,aAAa;AACtC,eAAa,KAAK,QAAQ,IAAI;AAE9B,QAAM,yBAAyB,CAAC,GAAG,mBAAmB;AAEtD,yBAAuB,KAAK,CAAC;AAE7B,SAAO;IACL,KAAK;IACL,KAAK,QAAQ;IACb,WAAW;IACX,iBAAiB;;AAErB;;;ACjlBA,IAAY;CAAZ,SAAYE,YAAS;AACnB,EAAAA,WAAAA,WAAA,QAAA,IAAA,CAAA,IAAA;AACA,EAAAA,WAAAA,WAAA,YAAA,IAAA,CAAA,IAAA;AACA,EAAAA,WAAAA,WAAA,sBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,WAAAA,WAAA,qCAAA,IAAA,CAAA,IAAA;AACA,EAAAA,WAAAA,WAAA,2BAAA,IAAA,CAAA,IAAA;AACA,EAAAA,WAAAA,WAAA,aAAA,IAAA,CAAA,IAAA;AACF,GAPY,cAAA,YAAS,CAAA,EAAA;AASf,SAAU,YACd,MAA2C;AAG3C,MAAI,gBAAgB,UAAU,SAAS,UAAU;AAC/C,WAAO,UAAU;EACnB,WAAW,gBAAgB,cAAc,SAAS,cAAc;AAC9D,WAAO,UAAU;EACnB,WACE,gBAAgB,uBAChB,SAAS,uBACT;AACA,WAAO,UAAU;EACnB,WACE,gBAAgB,oCAChB,SAAS,oCACT;AACA,WAAO,UAAU;EACnB,WACE,gBAAgB,2BAChB,SAAS,2BACT;AACA,WAAO,UAAU;EACnB,WAAW,gBAAgB,eAAe,SAAS,eAAe;AAChE,WAAO,UAAU;EACnB,OAAO;AACL,UAAM,MAAM,sBAAsB;EACpC;AACF;AAEM,SAAU,kBAAkB,SAKjC;AACC,QAAM,EAAE,YAAY,MAAM,UAAU,aAAY,IAAK;AACrD,QAAM,OAAO,YAAY,QAAQ;AACjC,MAAI,SAAS,UAAU,aAAa;AAClC,WAAO,uBAAuB,YAAY,MAAM,YAAY;EAC9D,OAAO;AACL,WAAO,iCACL,YACA,MACA,MACA,YAAY;EAEhB;AACF;AAEM,SAAU,wBACd,YACA,aACA,cACA,eACA,sBACA,eAAuB;AAEvB,QAAM,iBAAiB,uBACrB,YACA,aACA,YAAY;AAGd,QAAMC,gBAAe,0BAA0B,cAAc,IACzD,qCACA;AAEJ,SAAO,cACL,gBACA,eACAA,eACA,oBAAoB;AAExB;AAcM,SAAU,kCACd,YACA,aACA,GACA,sBACA,UACA,kBAIkB;AAElB,QAAM,iBAAiB,iCACrB,YACA,aACA,UACA,CAAC;AAGH,QAAMA,gBAAe,0BAA0B,cAAc,IACzD,qCACA;AAEJ,SAAO,iBACL,eAAe,CAAC,GAChBA,eACA,oBAAoB;AAExB;AAIM,SAAU,+BACd,MACA,eACAA,eACA,sBAA6B;AAE7B,QAAM,YAAY,KAAK;AACvB,QAAM,0BAA0B,KAAK,MAAM,CAAC,YAAW;AACrD,WAAO,QAAQ,MAAM,CAAC,aAAY;AAChC,aAAO,SAAS,WAAW;IAC7B,CAAC;EACH,CAAC;AAGD,MAAI,eAAe;AAIjB,WAAO,SAEL,QAAqB;AAKrB,YAAM,aAAwC,OAAO,IACnD,CAAC,YAAY,QAAQ,IAAI;AAG3B,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,cAAM,UAAU,KAAK,CAAC;AACtB,cAAM,iBAAiB,QAAQ;AAE/B,cAAM,gBAAgB,WAAW,CAAC;AAClC,YAAI,kBAAkB,UAAa,cAAc,KAAK,IAAI,MAAM,OAAO;AAErE;QACF;AACA,iBAAU,UAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACjD,gBAAM,WAAW,QAAQ,CAAC;AAC1B,gBAAM,iBAAiB,SAAS;AAChC,mBAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,kBAAM,YAAY,KAAK,QAAQ,IAAI,CAAC;AACpC,gBAAIA,cAAa,WAAW,SAAS,CAAC,CAAC,MAAM,OAAO;AAGlD,uBAAS;YACX;UACF;AAGA,iBAAO;QACT;MAGF;AAEA,aAAO;IACT;EACF,WAAW,2BAA2B,CAAC,sBAAsB;AAG3D,UAAM,kBAAkB,KAAK,IAAI,CAAC,YAAW;AAC3C,aAAO,QAAQ,KAAI;IACrB,CAAC;AAED,UAAM,cAAc,gBAAgB,OAClC,CAAC,QAAQ,SAAS,QAAO;AACvB,cAAQ,QAAQ,CAAC,gBAAe;AAC9B,YAAI,EAAE,YAAY,gBAAiB,SAAS;AAC1C,iBAAO,YAAY,YAAa,IAAI;QACtC;AACA,oBAAY,gBAAiB,QAAQ,CAAC,sBAAqB;AACzD,cAAI,CAAC,OAAO,OAAO,QAAQ,iBAAiB,GAAG;AAC7C,mBAAO,iBAAiB,IAAI;UAC9B;QACF,CAAC;MACH,CAAC;AACD,aAAO;IACT,GACA,CAAA,CAA4B;AAM9B,WAAO,WAAA;AACL,YAAM,YAAY,KAAK,QAAQ,CAAC;AAChC,aAAO,YAAY,UAAU,YAAY;IAC3C;EACF,OAAO;AAML,WAAO,WAAA;AACL,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,cAAM,UAAU,KAAK,CAAC;AACtB,cAAM,iBAAiB,QAAQ;AAC/B,iBAAU,UAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACjD,gBAAM,WAAW,QAAQ,CAAC;AAC1B,gBAAM,iBAAiB,SAAS;AAChC,mBAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,kBAAM,YAAY,KAAK,QAAQ,IAAI,CAAC;AACpC,gBAAIA,cAAa,WAAW,SAAS,CAAC,CAAC,MAAM,OAAO;AAGlD,uBAAS;YACX;UACF;AAGA,iBAAO;QACT;MAGF;AAEA,aAAO;IACT;EACF;AACF;AAEM,SAAU,wCACd,KACAA,eACA,sBAA6B;AAE7B,QAAM,0BAA0B,IAAI,MAAM,CAAC,aAAY;AACrD,WAAO,SAAS,WAAW;EAC7B,CAAC;AAED,QAAM,aAAa,IAAI;AAIvB,MAAI,2BAA2B,CAAC,sBAAsB;AACpD,UAAM,oBAAoB,IAAI,KAAI;AAElC,QACE,kBAAkB,WAAW,KACvB,kBAAkB,CAAC,EAAG,gBAAgB,WAAW,GACvD;AACA,YAAM,oBAAoB,kBAAkB,CAAC;AAC7C,YAAM,yBAA+B,kBAAmB;AAExD,aAAO,WAAA;AACL,eAAO,KAAK,QAAQ,CAAC,EAAE,iBAAiB;MAC1C;IACF,OAAO;AACL,YAAM,cAAc,kBAAkB,OACpC,CAAC,QAAQ,aAAa,QAAO;AAC3B,eAAO,YAAY,YAAa,IAAI;AACpC,oBAAY,gBAAiB,QAAQ,CAAC,sBAAqB;AACzD,iBAAO,iBAAiB,IAAI;QAC9B,CAAC;AACD,eAAO;MACT,GACA,CAAA,CAAe;AAGjB,aAAO,WAAA;AACL,cAAM,YAAY,KAAK,QAAQ,CAAC;AAChC,eAAO,YAAY,UAAU,YAAY,MAAM;MACjD;IACF;EACF,OAAO;AACL,WAAO,WAAA;AACL,eAAU,UAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AAC7C,cAAM,WAAW,IAAI,CAAC;AACtB,cAAM,iBAAiB,SAAS;AAChC,iBAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,gBAAM,YAAY,KAAK,QAAQ,IAAI,CAAC;AACpC,cAAIA,cAAa,WAAW,SAAS,CAAC,CAAC,MAAM,OAAO;AAGlD,qBAAS;UACX;QACF;AAEA,eAAO;MACT;AAGA,aAAO;IACT;EACF;AACF;AAEA,IAAM,6BAAN,cAAyC,WAAU;EAGjD,YACU,SACA,kBACA,gBAAyB;AAEjC,UAAK;AAJG,SAAA,UAAA;AACA,SAAA,mBAAA;AACA,SAAA,iBAAA;EAGV;EAEA,eAAY;AACV,SAAK,KAAK,KAAK,OAAO;AACtB,WAAO,KAAK;EACd;EAEQ,cACN,MACA,kBACA,UACA,UAAuB;AAEvB,QACE,KAAK,QAAQ,KAAK,oBAClB,KAAK,mBAAmB,kBACxB;AACA,WAAK,UAAU,SAAS,OAAO,QAAQ;AACvC,aAAO;IACT;AAEA,WAAO;EACT;EAEA,WACE,YACA,UACA,UAAuB;AAEvB,QAAI,CAAC,KAAK,cAAc,YAAY,UAAU,QAAQ,UAAU,QAAQ,GAAG;AACzE,YAAM,WAAW,YAAY,UAAU,QAAQ;IACjD;EACF;EAEA,eACE,gBACA,UACA,UAAuB;AAEvB,QACE,CAAC,KAAK,cACJ,gBACA,UAAU,sBACV,UACA,QAAQ,GAEV;AACA,YAAM,WAAW,gBAAgB,UAAU,QAAQ;IACrD;EACF;EAEA,kBACE,mBACA,UACA,UAAuB;AAEvB,QACE,CAAC,KAAK,cACJ,mBACA,UAAU,qCACV,UACA,QAAQ,GAEV;AACA,YAAM,WAAW,mBAAmB,UAAU,QAAQ;IACxD;EACF;EAEA,SACE,UACA,UACA,UAAuB;AAEvB,QACE,CAAC,KAAK,cAAc,UAAU,UAAU,YAAY,UAAU,QAAQ,GACtE;AACA,YAAM,WAAW,UAAU,UAAU,QAAQ;IAC/C;EACF;EAEA,YACE,aACA,UACA,UAAuB;AAEvB,QACE,CAAC,KAAK,cACJ,aACA,UAAU,2BACV,UACA,QAAQ,GAEV;AACA,YAAM,WAAW,aAAa,UAAU,QAAQ;IAClD;EACF;;AAMF,IAAM,gCAAN,cAA4C,YAAW;EAGrD,YACU,kBACA,gBACA,WAAe;AAEvB,UAAK;AAJG,SAAA,mBAAA;AACA,SAAA,iBAAA;AACA,SAAA,YAAA;AALH,SAAA,SAAwB,CAAA;EAQ/B;EAEQ,cACN,MACA,kBAA2B;AAE3B,QACE,KAAK,QAAQ,KAAK,oBAClB,KAAK,mBAAmB,qBACvB,KAAK,cAAc,UAAa,SAAS,KAAK,YAC/C;AACA,WAAK,SAAS,KAAK;IACrB;EACF;EAEO,YAAY,MAAY;AAC7B,SAAK,cAAc,MAAM,UAAU,MAAM;EAC3C;EAEO,gBAAgB,MAAgB;AACrC,SAAK,cAAc,MAAM,UAAU,UAAU;EAC/C;EAEO,yBAAyB,MAAyB;AACvD,SAAK,cAAc,MAAM,UAAU,oBAAoB;EACzD;EAEO,sCACL,MAAsC;AAEtC,SAAK,cAAc,MAAM,UAAU,mCAAmC;EACxE;EAEO,6BAA6B,MAA6B;AAC/D,SAAK,cAAc,MAAM,UAAU,yBAAyB;EAC9D;EAEO,iBAAiB,MAAiB;AACvC,SAAK,cAAc,MAAM,UAAU,WAAW;EAChD;;AAGF,SAAS,wBAAwB,MAAY;AAC3C,QAAM,SAAS,IAAI,MAAM,IAAI;AAC7B,WAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,WAAO,CAAC,IAAI,CAAA;EACd;AACA,SAAO;AACT;AAOA,SAAS,eAAe,MAAiB;AACvC,MAAIC,QAAO,CAAC,EAAE;AACd,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,UAAU,KAAK,CAAC;AACtB,UAAM,aAAa,CAAA;AACnB,aAAS,IAAI,GAAG,IAAIA,MAAK,QAAQ,KAAK;AACpC,YAAM,iBAAiBA,MAAK,CAAC;AAC7B,iBAAW,KAAK,iBAAiB,MAAM,QAAQ,YAAY;AAC3D,eAAS,IAAI,GAAG,IAAI,QAAQ,gBAAiB,QAAQ,KAAK;AACxD,cAAM,sBAAsB,MAAM,QAAQ,gBAAiB,CAAC;AAC5D,mBAAW,KAAK,iBAAiB,mBAAmB;MACtD;IACF;AACA,IAAAA,QAAO;EACT;AACA,SAAOA;AACT;AAKA,SAAS,mBACP,mBACA,gBACA,KAAW;AAEX,WACM,aAAa,GACjB,aAAa,kBAAkB,QAC/B,cACA;AAEA,QAAI,eAAe,KAAK;AACtB;IACF;AACA,UAAM,yBAAyB,kBAAkB,UAAU;AAC3D,aAAS,YAAY,GAAG,YAAY,eAAe,QAAQ,aAAa;AACtE,YAAM,YAAY,eAAe,SAAS;AAC1C,UAAI,uBAAuB,SAAS,MAAM,MAAM;AAC9C,eAAO;MACT;IACF;EACF;AAEA,SAAO;AACT;AAEM,SAAU,kCACd,UACA,GAAS;AAET,QAAM,cAAc,SAAS,IAAI,CAAC,YAChC,kBAAkB,CAAC,OAAO,GAAG,CAAC,CAAC;AAEjC,QAAM,cAAc,wBAAwB,YAAY,MAAM;AAC9D,QAAM,aAAa,YAAY,IAAI,CAAC,iBAAgB;AAClD,UAAM,OAAmC,CAAA;AACzC,iBAAa,QAAQ,CAAC,SAAQ;AAC5B,YAAMA,QAAO,eAAe,KAAK,WAAW;AAC5C,MAAAA,MAAK,QAAQ,CAAC,YAAW;AACvB,aAAK,OAAO,IAAI;MAClB,CAAC;IACH,CAAC;AACD,WAAO;EACT,CAAC;AACD,MAAI,UAAU;AAGd,WAAS,aAAa,GAAG,cAAc,GAAG,cAAc;AACtD,UAAM,cAAc;AACpB,cAAU,wBAAwB,YAAY,MAAM;AAGpD,aAAS,SAAS,GAAG,SAAS,YAAY,QAAQ,UAAU;AAC1D,YAAM,0BAA0B,YAAY,MAAM;AAElD,eACM,cAAc,GAClB,cAAc,wBAAwB,QACtC,eACA;AACA,cAAM,iBAAiB,wBAAwB,WAAW,EAAE;AAC5D,cAAM,YAAY,wBAAwB,WAAW,EAAE;AACvD,cAAM,aAAa,eAAe,cAAc;AAChD,cAAM,WAAW,mBAAmB,YAAY,YAAY,MAAM;AAElE,YAAI,YAAY,UAAU,WAAW,KAAK,eAAe,WAAW,GAAG;AACrE,gBAAM,gBAAgB,YAAY,MAAM;AAExC,cAAI,aAAa,eAAe,cAAc,MAAM,OAAO;AACzD,0BAAc,KAAK,cAAc;AAEjC,qBAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,oBAAM,UAAU,WAAW,CAAC;AAC5B,yBAAW,MAAM,EAAE,OAAO,IAAI;YAChC;UACF;QACF,OAEK;AACH,gBAAM,6BAA6B,kBACjC,WACA,aAAa,GACb,cAAc;AAEhB,kBAAQ,MAAM,IAAI,QAAQ,MAAM,EAAE,OAAO,0BAA0B;AAGnE,qCAA2B,QAAQ,CAAC,SAAQ;AAC1C,kBAAMC,cAAa,eAAe,KAAK,WAAW;AAClD,YAAAA,YAAW,QAAQ,CAAC,QAAO;AACzB,yBAAW,MAAM,EAAE,GAAG,IAAI;YAC5B,CAAC;UACH,CAAC;QACH;MACF;IACF;EACF;AAEA,SAAO;AACT;AAEM,SAAU,uBACd,YACA,aACA,GACA,QAAoB;AAEpB,QAAMC,WAAU,IAAI,8BAClB,YACA,UAAU,aACV,MAAM;AAER,cAAY,OAAOA,QAAO;AAC1B,SAAO,kCAAkCA,SAAQ,QAAQ,CAAC;AAC5D;AAEM,SAAU,iCACd,YACA,aACA,UACA,GAAS;AAET,QAAM,mBAAmB,IAAI,8BAC3B,YACA,QAAQ;AAEV,cAAY,OAAO,gBAAgB;AACnC,QAAM,YAAY,iBAAiB;AAEnC,QAAM,iBAAiB,IAAI,2BACzB,aACA,YACA,QAAQ;AAEV,QAAM,WAAW,eAAe,aAAY;AAE5C,QAAM,aAAa,IAAI,YAAgB,EAAE,YAAY,UAAS,CAAE;AAChE,QAAM,YAAY,IAAI,YAAgB,EAAE,YAAY,SAAQ,CAAE;AAE9D,SAAO,kCAAkC,CAAC,YAAY,SAAS,GAAG,CAAC;AACrE;AAEM,SAAU,aACd,aACA,YAAuB;AAEvB,mBAAkB,UAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC7D,UAAM,YAAY,YAAY,CAAC;AAC/B,QAAI,UAAU,WAAW,WAAW,QAAQ;AAC1C;IACF;AACA,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,YAAM,YAAY,WAAW,CAAC;AAC9B,YAAM,WAAW,UAAU,CAAC;AAE5B,YAAM,iBACJ,cAAc,YACd,SAAS,mBAAoB,UAAU,YAAa,MAAM;AAC5D,UAAI,mBAAmB,OAAO;AAC5B,iBAAS;MACX;IACF;AACA,WAAO;EACT;AAEA,SAAO;AACT;AAEM,SAAU,qBACd,QACA,OAAkB;AAElB,SACE,OAAO,SAAS,MAAM,UACtB,OAAO,MAAM,CAAC,SAAS,QAAO;AAC5B,UAAM,eAAe,MAAM,GAAG;AAC9B,WACE,YAAY,gBACZ,aAAa,mBAAoB,QAAQ,YAAa;EAE1D,CAAC;AAEL;AAEM,SAAU,0BACd,gBAAmC;AAEnC,SAAO,eAAe,MAAM,CAAC,mBAC3B,eAAe,MAAM,CAAC,eACpB,WAAW,MAAM,CAAC,UAAU,MAAM,gBAAiB,WAAW,CAAC,CAAC,CACjE;AAEL;;;ACprBM,SAAU,kBAAkB,SAKjC;AACC,QAAM,mCAAmC,QAAQ,kBAAkB,SAAS;IAC1E,OAAO,QAAQ;IACf,YAAY,QAAQ;IACpB,aAAa,QAAQ;GACtB;AACD,SAAO,iCAAiC,IAAI,CAAC,iBAAiB,OAAA,OAAA,EAC5D,MAAM,0BAA0B,4BAA2B,GACxD,YAAY,CACf;AACJ;AAEM,SAAU,gBACd,WACA,YACA,gBACA,aAAmB;AAEnB,QAAM,kBAA4C,UAAU,QAC1D,CAAC,iBACC,6BAA6B,cAAc,cAAc,CAAC;AAG9D,QAAM,+BAA+B,uCACnC,WACA,YACA,cAAc;AAGhB,QAAM,oBAAoB,UAAU,QAAQ,CAAC,YAC3C,oBAAoB,SAAS,cAAc,CAAC;AAG9C,QAAM,sBAAsB,UAAU,QAAQ,CAAC,YAC7C,gCACE,SACA,WACA,aACA,cAAc,CACf;AAGH,SAAO,gBAAgB,OACrB,8BACA,mBACA,mBAAmB;AAEvB;AAEA,SAAS,6BACP,cACA,gBAAqD;AAErD,QAAMC,oBAAmB,IAAI,8BAA6B;AAC1D,eAAa,OAAOA,iBAAgB;AACpC,QAAM,qBAAqBA,kBAAiB;AAE5C,QAAM,mBAAmB,OAAO,QAC9B,oBACA,+BAA+B;AAGjC,QAAM,aAAa,OAAO,YACxB,OAAO,QAAQ,gBAAgB,EAAE,OAC/B,CAAC,CAAC,IAAI,SAAS,MAAM,UAAW,SAAS,CAAC,CAC3C;AAGH,QAAM,SAAS,OAAO,OAAO,UAAU,EAAE,IAAI,CAAC,mBAAuB;AACnE,UAAM,YAAiB,eAAe,CAAC;AACvC,UAAM,MAAM,eAAe,yBACzB,cACA,cAAc;AAEhB,UAAM,UAAU,qBAAqB,SAAS;AAC9C,UAAM,WAA6C;MACjD,SAAS;MACT,MAAM,0BAA0B;MAChC,UAAU,aAAa;MACvB;MACA,YAAY,UAAU;;AAGxB,UAAM,QAAQ,2BAA2B,SAAS;AAClD,QAAI,OAAO;AACT,eAAS,YAAY;IACvB;AAEA,WAAO;EACT,CAAC;AACD,SAAO;AACT;AAEM,SAAU,gCACd,MAA+B;AAE/B,SAAO,GAAG,qBAAqB,IAAI,CAAC,MAClC,KAAK,GACP,MAAM,2BAA2B,IAAI,CAAC;AACxC;AAEA,SAAS,2BAA2B,MAA+B;AACjE,MAAI,gBAAgB,UAAU;AAC5B,WAAO,KAAK,aAAa;EAC3B,WAAW,gBAAgB,aAAa;AACtC,WAAO,KAAK;EACd,OAAO;AACL,WAAO;EACT;AACF;AAEM,IAAO,gCAAP,cAA6C,YAAW;EAA9D,cAAA;;AACS,SAAA,iBAA8C,CAAA;EAmCvD;EAjCS,iBAAiB,SAAoB;AAC1C,SAAK,eAAe,KAAK,OAAO;EAClC;EAEO,YAAYC,SAAc;AAC/B,SAAK,eAAe,KAAKA,OAAM;EACjC;EAEO,6BAA6B,SAAgC;AAClE,SAAK,eAAe,KAAK,OAAO;EAClC;EAEO,yBAAyB,YAA+B;AAC7D,SAAK,eAAe,KAAK,UAAU;EACrC;EAEO,sCACL,eAA+C;AAE/C,SAAK,eAAe,KAAK,aAAa;EACxC;EAEO,gBAAgB,MAAgB;AACrC,SAAK,eAAe,KAAK,IAAI;EAC/B;EAEO,iBAAiB,IAAe;AACrC,SAAK,eAAe,KAAK,EAAE;EAC7B;EAEO,cAAc,UAAkB;AACrC,SAAK,eAAe,KAAK,QAAQ;EACnC;;AAGI,SAAU,gCACd,MACA,UACA,WACA,gBAAqD;AAErD,QAAM,SAAS,CAAA;AACf,QAAM,cAAc,SAAS,OAAO,CAAC,QAAQ,YAAW;AACtD,QAAI,QAAQ,SAAS,KAAK,MAAM;AAC9B,aAAO,SAAS;IAClB;AACA,WAAO;EACT,GAAG,CAAC;AACJ,MAAI,cAAc,GAAG;AACnB,UAAM,SAAS,eAAe,4BAA4B;MACxD,cAAc;MACd,aAAa;KACd;AACD,WAAO,KAAK;MACV,SAAS;MACT,MAAM,0BAA0B;MAChC,UAAU,KAAK;KAChB;EACH;AAEA,SAAO;AACT;AAKM,SAAU,yBACd,UACA,mBACA,WAAiB;AAEjB,QAAM,SAAS,CAAA;AACf,MAAI;AAEJ,MAAI,CAAC,kBAAkB,SAAS,QAAQ,GAAG;AACzC,aACE,kCAAkC,QAAQ,6CAA6C,SAAS;AAElG,WAAO,KAAK;MACV,SAAS;MACT,MAAM,0BAA0B;MAChC;KACD;EACH;AAEA,SAAO;AACT;AAEM,SAAU,wBACd,SACA,UACA,gBACA,OAAe,CAAA,GAAE;AAEjB,QAAM,SAAmC,CAAA;AACzC,QAAM,mBAAmB,qBAAqB,SAAS,UAAU;AACjE,MAAI,iBAAiB,WAAW,GAAG;AACjC,WAAO,CAAA;EACT,OAAO;AACL,UAAM,WAAW,QAAQ;AACzB,UAAM,qBAAqB,iBAAiB,SAAS,OAAO;AAC5D,QAAI,oBAAoB;AACtB,aAAO,KAAK;QACV,SAAS,eAAe,wBAAwB;UAC9C,cAAc;UACd,mBAAmB;SACpB;QACD,MAAM,0BAA0B;QAChC;OACD;IACH;AAIA,UAAM,WAAW,KAAK,OAAO,CAAC,OAAO,CAAC;AACtC,UAAM,iBAAiB,iBAAiB,OACtC,CAAC,MAAM,CAAC,SAAS,SAAS,CAAC,CAAC;AAE9B,UAAM,sBAAsB,eAAe,QAAQ,CAAC,gBAAe;AACjE,YAAM,UAAU,CAAC,GAAG,IAAI;AACxB,cAAQ,KAAK,WAAW;AACxB,aAAO,wBACL,SACA,aACA,gBACA,OAAO;IAEX,CAAC;AAED,WAAO,OAAO,OAAO,mBAAmB;EAC1C;AACF;AAEM,SAAU,qBAAqB,YAAyB;AAC5D,MAAI,SAAiB,CAAA;AACrB,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,QAAM,YAAY,WAAW,CAAC;AAG9B,MAAI,qBAAqB,aAAa;AACpC,WAAO,KAAK,UAAU,cAAc;EACtC,WACE,qBAAqB,eACrB,qBAAqB,UACrB,qBAAqB,uBACrB,qBAAqB,oCACrB,qBAAqB,2BACrB,qBAAqB,YACrB;AACA,aAAS,OAAO,OACd,qBAAoC,UAAU,UAAU,CAAC;EAE7D,WAAW,qBAAqB,aAAa;AAE3C,aAAS,UAAU,WAChB,IAAI,CAAC,eACJ,qBAAuC,WAAY,UAAU,CAAC,EAE/D,KAAI;EACT,WAAW,qBAAqB,UAAU;EAE1C,OAAO;AACL,UAAM,MAAM,sBAAsB;EACpC;AAEA,QAAM,kBAAkB,eAAe,SAAS;AAChD,QAAM,UAAU,WAAW,SAAS;AACpC,MAAI,mBAAmB,SAAS;AAC9B,UAAM,OAAO,WAAW,MAAM,CAAC;AAC/B,WAAO,OAAO,OAAO,qBAAqB,IAAI,CAAC;EACjD,OAAO;AACL,WAAO;EACT;AACF;AAEA,IAAM,cAAN,cAA0B,YAAW;EAArC,cAAA;;AACS,SAAA,eAA8B,CAAA;EAKvC;EAHS,iBAAiB,MAAiB;AACvC,SAAK,aAAa,KAAK,IAAI;EAC7B;;AAGI,SAAU,2BACd,cACA,gBAAqD;AAErD,QAAM,cAAc,IAAI,YAAW;AACnC,eAAa,OAAO,WAAW;AAC/B,QAAM,MAAM,YAAY;AAExB,QAAM,SAAS,IAAI,QACjB,CAAC,WAAU;AACT,UAAM,aAAa,OAAO,WAAW,MAAM,GAAG,EAAE;AAChD,WAAO,WAAW,QAAQ,CAAC,iBAAiB,eAAc;AACxD,YAAM,qBAAqB,wBACzB,CAAC,eAAe,GAChB,CAAA,GACA,wBACA,CAAC;AAEH,UAAI,mBAAmB,WAAW,GAAG;AACnC,eAAO;UACL;YACE,SAAS,eAAe,2BAA2B;cACjD;cACA,aAAa;cACb,gBAAgB;aACjB;YACD,MAAM,0BAA0B;YAChC,UAAU,aAAa;YACvB,YAAY,OAAO;YACnB,aAAa,aAAa;;;MAGhC,OAAO;AACL,eAAO,CAAA;MACT;IACF,CAAC;EACH,CAAC;AAGH,SAAO;AACT;AAEM,SAAU,yCACd,cACA,oBACA,gBAAqD;AAErD,QAAM,cAAc,IAAI,YAAW;AACnC,eAAa,OAAO,WAAW;AAC/B,MAAI,MAAM,YAAY;AAItB,QAAM,IAAI,OAAO,CAAC,WAAW,OAAO,sBAAsB,IAAI;AAE9D,QAAM,SAAS,IAAI,QAAQ,CAAC,WAAuB;AACjD,UAAM,iBAAiB,OAAO;AAC9B,UAAM,qBAAqB,OAAO,gBAAgB;AAClD,UAAM,eAAe,uBACnB,gBACA,cACA,oBACA,MAAM;AAER,UAAM,sBAAsB,6BAC1B,cACA,QACA,cACA,cAAc;AAEhB,UAAM,4BAA4B,mCAChC,cACA,QACA,cACA,cAAc;AAGhB,WAAO,oBAAoB,OAAO,yBAAyB;EAC7D,CAAC;AAED,SAAO;AACT;AAEM,IAAO,sBAAP,cAAmC,YAAW;EAApD,cAAA;;AACS,SAAA,iBAEA,CAAA;EAmBT;EAjBS,6BAA6B,SAAgC;AAClE,SAAK,eAAe,KAAK,OAAO;EAClC;EAEO,yBAAyB,YAA+B;AAC7D,SAAK,eAAe,KAAK,UAAU;EACrC;EAEO,sCACL,eAA+C;AAE/C,SAAK,eAAe,KAAK,aAAa;EACxC;EAEO,gBAAgB,MAAgB;AACrC,SAAK,eAAe,KAAK,IAAI;EAC/B;;AAGI,SAAU,oBACd,cACA,gBAAqD;AAErD,QAAM,cAAc,IAAI,YAAW;AACnC,eAAa,OAAO,WAAW;AAC/B,QAAM,MAAM,YAAY;AAExB,QAAM,SAAS,IAAI,QAAQ,CAAC,WAAU;AACpC,QAAI,OAAO,WAAW,SAAS,KAAK;AAClC,aAAO;QACL;UACE,SAAS,eAAe,8BAA8B;YACpD;YACA,aAAa;WACd;UACD,MAAM,0BAA0B;UAChC,UAAU,aAAa;UACvB,YAAY,OAAO;;;IAGzB,OAAO;AACL,aAAO,CAAA;IACT;EACF,CAAC;AAED,SAAO;AACT;AAEM,SAAU,kCACd,eACA,cACA,gBAAqD;AAErD,QAAM,SAAmC,CAAA;AACzC,gBAAc,QAAQ,CAAC,gBAAe;AACpC,UAAMD,oBAAmB,IAAI,oBAAmB;AAChD,gBAAY,OAAOA,iBAAgB;AACnC,UAAM,qBAAqBA,kBAAiB;AAC5C,uBAAmB,QAAQ,CAAC,aAAY;AACtC,YAAM,WAAW,YAAY,QAAQ;AACrC,YAAM,qBAAqB,SAAS,gBAAgB;AACpD,YAAM,iBAAiB,SAAS;AAChC,YAAM,QAAQ,iCACZ,gBACA,aACA,UACA,kBAAkB;AAEpB,YAAM,wBAAwB,MAAM,CAAC;AACrC,UAAI,sBAAsB,KAAI,EAAG,WAAW,GAAG;AAC7C,cAAM,SAAS,eAAe,0BAA0B;UACtD,cAAc;UACd,YAAY;SACb;AACD,eAAO,KAAK;UACV,SAAS;UACT,MAAM,0BAA0B;UAChC,UAAU,YAAY;SACvB;MACH;IACF,CAAC;EACH,CAAC;AAED,SAAO;AACT;AAOA,SAAS,6BACP,cACAE,cACA,MACA,gBAAqD;AAErD,QAAM,sBAAmC,CAAA;AACzC,QAAM,uBAAuB,aAAa,OACxC,CAAC,QAAQ,SAAS,eAAc;AAE9B,QAAIA,aAAY,WAAW,UAAU,EAAE,sBAAsB,MAAM;AACjE,aAAO;IACT;AAEA,YAAQ,QAAQ,CAAC,aAAY;AAC3B,YAAM,wBAAwB,CAAC,UAAU;AACzC,mBAAa,QAAQ,CAAC,cAAc,oBAAmB;AACrD,YACE,eAAe,mBACf,aAAa,cAAc,QAAQ;QAEnCA,aAAY,WAAW,eAAe,EAAE,sBAAsB,MAC9D;AACA,gCAAsB,KAAK,eAAe;QAC5C;MACF,CAAC;AAED,UACE,sBAAsB,SAAS,KAC/B,CAAC,aAAa,qBAAqB,QAAQ,GAC3C;AACA,4BAAoB,KAAK,QAAQ;AACjC,eAAO,KAAK;UACV,MAAM;UACN,MAAM;SACP;MACH;IACF,CAAC;AACD,WAAO;EACT,GACA,CAAA,CAA6C;AAG/C,QAAM,aAAa,qBAAqB,IAAI,CAAC,sBAAqB;AAChE,UAAM,cAAc,kBAAkB,KAAK,IACzC,CAAC,eAAe,aAAa,CAAC;AAGhC,UAAM,cAAc,eAAe,+BAA+B;MAChE,cAAc;MACd,aAAaA;MACb,kBAAkB;MAClB,YAAY,kBAAkB;KAC/B;AAED,WAAO;MACL,SAAS;MACT,MAAM,0BAA0B;MAChC,UAAU,KAAK;MACf,YAAYA,aAAY;MACxB,cAAc,kBAAkB;;EAEpC,CAAC;AAED,SAAO;AACT;AAEM,SAAU,mCACd,cACAA,cACA,MACA,gBAAqD;AAGrD,QAAM,kBAAkB,aAAa,OACnC,CAAC,QAAQ,SAAS,QAAO;AACvB,UAAM,kBAAkB,QAAQ,IAAI,CAAC,aAAY;AAC/C,aAAO,EAAE,KAAU,MAAM,SAAQ;IACnC,CAAC;AACD,WAAO,OAAO,OAAO,eAAe;EACtC,GACA,CAAA,CAA0C;AAG5C,QAAM,SAAS,gBAAgB,QAAQ,CAAC,mBAAkB;AACxD,UAAM,kBAAkBA,aAAY,WAAW,eAAe,GAAG;AAEjE,QAAI,gBAAgB,sBAAsB,MAAM;AAC9C,aAAO,CAAA;IACT;AACA,UAAM,YAAY,eAAe;AACjC,UAAM,aAAa,eAAe;AAElC,UAAM,mCAAmC,gBAAgB,OACvD,CAAC,qBAAoB;AAEnB;;QAEEA,aAAY,WAAW,iBAAiB,GAAG,EAAE,sBAC3C,QACF,iBAAiB,MAAM;;QAGvB,qBAAqB,iBAAiB,MAAM,UAAU;;IAE1D,CAAC;AAGH,UAAM,uBAAuB,iCAAiC,IAC5D,CAAC,sBAAkE;AACjE,YAAM,cAAc,CAAC,kBAAkB,MAAM,GAAG,YAAY,CAAC;AAC7D,YAAM,aAAaA,aAAY,QAAQ,IAAI,KAAKA,aAAY;AAE5D,YAAM,UAAU,eAAe,qCAAqC;QAClE,cAAc;QACd,aAAaA;QACb,kBAAkB;QAClB,YAAY,kBAAkB;OAC/B;AACD,aAAO;QACL;QACA,MAAM,0BAA0B;QAChC,UAAU,KAAK;QACf;QACA,cAAc;;IAElB,CAAC;AAGH,WAAO;EACT,CAAC;AAED,SAAO;AACT;AAEA,SAAS,uCACP,WACA,YACA,gBAAqD;AAErD,QAAM,SAAmC,CAAA;AAEzC,QAAM,aAAa,WAAW,IAAI,CAAC,cAAc,UAAU,IAAI;AAE/D,YAAU,QAAQ,CAAC,aAAY;AAC7B,UAAM,eAAe,SAAS;AAC9B,QAAI,WAAW,SAAS,YAAY,GAAG;AACrC,YAAM,SAAS,eAAe,4BAA4B,QAAQ;AAElE,aAAO,KAAK;QACV,SAAS;QACT,MAAM,0BAA0B;QAChC,UAAU;OACX;IACH;EACF,CAAC;AAED,SAAO;AACT;;;ACzpBM,SAAUC,gBACd,SAA2B;AAE3B,QAAM,gBAAa,OAAA,OAAA,EACjB,gBAAgB,oCAAmC,GAChD,OAAO;AAGZ,QAAM,gBAA8C,CAAA;AACpD,UAAQ,MAAM,QAAQ,CAAC,SAAQ;AAC7B,kBAAc,KAAK,IAAI,IAAI;EAC7B,CAAC;AACD,SAAO,eAAkB,eAAe,cAAc,cAAc;AACtE;AAEM,SAAUC,iBAAgB,SAK/B;;AACC,QAAM,kBACJ,KAAA,QAAQ,oBAAc,QAAA,OAAA,SAAA,KAAI;AAE5B,SAAO,gBACL,QAAQ,OACR,QAAQ,YACR,gBACA,QAAQ,WAAW;AAEvB;;;AC1CA,IAAM,6BAA6B;AACnC,IAAM,0BAA0B;AAChC,IAAM,uBAAuB;AAC7B,IAAM,iCAAiC;AAEvC,IAAM,8BAA8B;EAClC;EACA;EACA;EACA;;AAGF,OAAO,OAAO,2BAA2B;AAGnC,SAAU,uBAAuB,OAAY;AAEjD,SAAO,4BAA4B,SAAS,MAAM,IAAI;AACxD;AAEA,IAAe,uBAAf,cACU,MAAK;EAMb,YACE,SACO,OAAa;AAEpB,UAAM,OAAO;AAFN,SAAA,QAAA;AAJT,SAAA,iBAA2B,CAAA;AASzB,WAAO,eAAe,MAAM,WAAW,SAAS;AAGhD,QAAI,MAAM,mBAAmB;AAC3B,YAAM,kBAAkB,MAAM,KAAK,WAAW;IAChD;EACF;;AAGI,IAAO,2BAAP,cAAwC,qBAAoB;EAChE,YACE,SACA,OACO,eAAqB;AAE5B,UAAM,SAAS,KAAK;AAFb,SAAA,gBAAA;AAGP,SAAK,OAAO;EACd;;AAGI,IAAO,uBAAP,cAAoC,qBAAoB;EAC5D,YACE,SACA,OACO,eAAqB;AAE5B,UAAM,SAAS,KAAK;AAFb,SAAA,gBAAA;AAGP,SAAK,OAAO;EACd;;AAGI,IAAO,6BAAP,cAA0C,qBAAoB;EAClE,YAAY,SAAiB,OAAa;AACxC,UAAM,SAAS,KAAK;AACpB,SAAK,OAAO;EACd;;AAGI,IAAO,qBAAP,cAAkC,qBAAoB;EAC1D,YACE,SACA,OACO,eAAqB;AAE5B,UAAM,SAAS,KAAK;AAFb,SAAA,gBAAA;AAGP,SAAK,OAAO;EACd;;;;AChEK,IAAM,iBAAsB,CAAA;AAQ5B,IAAM,6BAA6B;AAEpC,IAAO,0BAAP,cAAuC,MAAK;EAChD,YAAY,SAAe;AACzB,UAAM,OAAO;AACb,SAAK,OAAO;EACd;;AAMI,IAAO,cAAP,MAAkB;EAKtB,gBAAgB,QAAqB;AACnC,SAAK,mBAAmB,CAAA;AACxB,SAAK,gBAAgB,CAAA;AAErB,SAAK,kBAAkB,OAAO,OAAO,QAAQ,iBAAiB,IACzD,OAAO,kBACR,sBAAsB;AAK1B,QAAI,KAAK,iBAAiB;AACxB,WAAK,8BAA8B;IACrC;EACF;EAEO,iBAAiB,SAAkB;AACxC,UAAM,cAAc,oBAClB,SACA,IACA,KACA,KACA,KACA,KACA,KACA,GAAG;AAEL,gBAAY,uBAAuB;AACnC,WAAO;EACT;EAEO,iCAAiC,SAAkB;AACxD,WAAO;EACT;EAEO,gCAAgC,SAAkB;AACvD,WAAO;EACT;EAEA,wBAEE,aACA,iBACA,eACA,iBAA0B;AAG1B,UAAM,gBAAgB,KAAK,oBAAmB;AAC9C,UAAM,kBAAkB,KAAK,iBAAgB;AAC7C,UAAM,iBAA2B,CAAA;AACjC,QAAI,oBAAoB;AAExB,UAAM,yBAAyB,KAAK,QAAQ,CAAC;AAC7C,QAAI,YAAY,KAAK,QAAQ,CAAC;AAE9B,UAAM,uBAAuB,MAAK;AAChC,YAAM,gBAAgB,KAAK,GAAG,CAAC;AAG/B,YAAM,MAAM,KAAK,qBAAqB,0BAA0B;QAC9D,UAAU;QACV,QAAQ;QACR,UAAU;QACV,UAAU,KAAK,oBAAmB;OACnC;AACD,YAAM,QAAQ,IAAI,yBAChB,KACA,wBACA,KAAK,GAAG,CAAC,CAAC;AAGZ,YAAM,iBAAiB,eAAe,MAAM,GAAG,EAAE;AACjD,WAAK,WAAW,KAAK;IACvB;AAEA,WAAO,CAAC,mBAAmB;AAEzB,UAAI,KAAK,aAAa,WAAW,eAAe,GAAG;AACjD,6BAAoB;AACpB;MACF,WAAW,cAAc,KAAK,IAAI,GAAG;AAEnC,6BAAoB;AAEpB,oBAAY,MAAM,MAAM,eAAe;AACvC;MACF,WAAW,KAAK,aAAa,WAAW,aAAa,GAAG;AACtD,4BAAoB;MACtB,OAAO;AACL,oBAAY,KAAK,WAAU;AAC3B,aAAK,kBAAkB,WAAW,cAAc;MAClD;IACF;AAKA,SAAK,iBAAiB,eAAe;EACvC;EAEA,kCAEE,yBACA,YACA,UAA6B;AAI7B,QAAI,aAAa,OAAO;AACtB,aAAO;IACT;AAGA,QAAI,KAAK,aAAa,KAAK,QAAQ,CAAC,GAAG,uBAAuB,GAAG;AAC/D,aAAO;IACT;AAIA,QAAI,KAAK,eAAc,GAAI;AACzB,aAAO;IACT;AAKA,QACE,KAAK,yBACH,yBACA,KAAK,4BAA4B,yBAAyB,UAAU,CAAC,GAEvE;AACA,aAAO;IACT;AAEA,WAAO;EACT;;;EAIA,0BAEE,aAA8B;AAE9B,UAAM,cAAc,YAAY,UAAU,CAAC;AAC3C,UAAM,kBAAkB,KAAK,mBAAkB;AAC/C,UAAM,gBAAgB,gBAAgB,WAAW;AACjD,UAAM,yBAAyB,IAAI,qBACjC,eACA,WAAW,EACX,aAAY;AACd,WAAO;EACT;;EAGA,4BAEE,SACA,cAAoB;AAEpB,UAAM,cAAc,KAAK,sBAAsB,SAAS,YAAY;AACpE,UAAM,UAAU,KAAK,0BAA0B,WAAW;AAC1D,WAAO;EACT;EAEA,kBAEE,iBACA,SAAoB;AAEpB,QAAI,KAAK,mCAAmC,iBAAiB,OAAO,GAAG;AACrE,YAAM,cAAc,KAAK,iBAAiB,eAAe;AACzD,aAAO;IACT;AAEA,QAAI,KAAK,kCAAkC,eAAe,GAAG;AAC3D,YAAM,UAAU,KAAK,WAAU;AAC/B,WAAK,aAAY;AACjB,aAAO;IACT;AAEA,UAAM,IAAI,wBAAwB,eAAe;EACnD;EAEA,yBAEE,eACA,SAAoB;AAEpB,WACE,KAAK,mCAAmC,eAAe,OAAO,KAC9D,KAAK,kCAAkC,aAAa;EAExD;EAEA,mCAEE,iBACA,SAAoB;AAEpB,QAAI,CAAC,KAAK,iCAAiC,eAAe,GAAG;AAC3D,aAAO;IACT;AAGA,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;IACT;AAEA,UAAM,gBAAgB,KAAK,QAAQ,CAAC;AACpC,UAAM,2BACJ,QAAQ,KAAK,CAAC,2BAAqC;AACjD,aAAO,KAAK,aAAa,eAAe,sBAAsB;IAChE,CAAC,MAAM;AAET,WAAO;EACT;EAEA,kCAEE,iBAA0B;AAE1B,QAAI,CAAC,KAAK,gCAAgC,eAAe,GAAG;AAC1D,aAAO;IACT;AAEA,UAAM,4BAA4B,KAAK;;;MAGrC,KAAK,GAAG,CAAC;MACT;IAAe;AAEjB,WAAO;EACT;EAEA,yBAEE,cAAuB;AAEvB,UAAM,YAAY,KAAK,iBAAgB;AACvC,UAAM,uBAAuB,KAAK,0BAA0B,SAAS;AACrE,WAAO,qBAAqB,SAAS,YAAY;EACnD;EAEA,sBAAmB;AACjB,UAAM,4BAA4B,KAAK,iBAAgB;AAEvD,QAAI,YAAY,KAAK,QAAQ,CAAC;AAC9B,QAAI,IAAI;AACR,WAAO,MAAM;AACX,YAAM,aAAa,0BAA0B,KAAK,CAAC,kBAAiB;AAClE,cAAM,WAAW,aAAa,WAAW,aAAa;AACtD,eAAO;MACT,CAAC;AACD,UAAI,eAAe,QAAW;AAC5B,eAAO;MACT;AACA,kBAAY,KAAK,GAAG,CAAC;AACrB;IACF;EACF;EAEA,mBAAgB;AAEd,QAAI,KAAK,mBAAmB,GAAG;AAC7B,aAAO;IACT;AACA,UAAM,oBAAoB,KAAK;AAC/B,UAAM,cAAc,KAAK,mCAAkC;AAC3D,UAAM,oBAAoB,KAAK,iCAAgC;AAE/D,WAAO;MACL,UAAU,KAAK,wBAAwB,iBAAiB;MACxD,kBAAkB;MAClB,QAAQ,KAAK,wBAAwB,iBAAiB;;EAE1D;EAEA,0BAAuB;AACrB,UAAM,oBAAoB,KAAK;AAC/B,UAAM,0BAA0B,KAAK;AACrC,UAAM,MAAM,KAAK,iBAAiB;AAElC,UAAM,SAAuB,IAAI,MAAM,GAAG;AAC1C,aAAS,MAAM,GAAG,MAAM,KAAK,OAAO;AAClC,UAAI,QAAQ,GAAG;AACb,eAAO,GAAG,IAAI;MAChB,OAAO;AACL,eAAO,GAAG,IAAI;UACZ,UAAU,KAAK,wBAAwB,kBAAkB,GAAG,CAAC;UAC7D,kBAAkB,wBAAwB,GAAG;UAC7C,QAAQ,KAAK,wBAAwB,kBAAkB,MAAM,CAAC,CAAC;;MAEnE;IACF;AACA,WAAO;EACT;EAEA,mBAAgB;AACd,UAAM,cAAc,KAAK,wBAAuB,EAAG,IAAI,CAAC,YAAW;AACjE,aAAO,KAAK,0BAA0B,OAAO;IAC/C,CAAC;AACD,WAAY,YAAY,KAAI;EAC9B;EAEA,0BAEE,WAAqB;AAErB,QAAI,cAAc,gBAAgB;AAChC,aAAO,CAAC,GAAG;IACb;AAEA,UAAM,aACJ,UAAU,WAAW,UAAU,mBAAmB,KAAK,UAAU;AAEnE,WAAO,KAAK,cAAc,UAAU;EACtC;;;EAIA,kBAEE,OACA,cAAsB;AAEtB,QAAI,CAAC,KAAK,aAAa,OAAO,GAAG,GAAG;AAClC,mBAAa,KAAK,KAAK;IACzB;AACA,WAAO;EACT;EAEA,SAA8B,SAAkB;AAC9C,UAAM,iBAA2B,CAAA;AACjC,QAAI,UAAU,KAAK,QAAQ,CAAC;AAC5B,WAAO,KAAK,aAAa,SAAS,OAAO,MAAM,OAAO;AACpD,gBAAU,KAAK,WAAU;AACzB,WAAK,kBAAkB,SAAS,cAAc;IAChD;AAEA,WAAO,eAAe,MAAM,GAAG,EAAE;EACnC;EAEA,4BAEE,UACA,MACA,eACA,cACA,gBACA,gBACA,UAAkB;EAIpB;EAEA,sBAEE,SACA,cAAoB;AAEpB,UAAM,gBAA0B,KAAK,0BAAyB;AAC9D,UAAM,sBAAgC,KAAK,sBAAsB,MAC/D,GACA,KAAK,4BAA4B,CAAC;AAEpC,UAAM,cAAmB;MACvB,WAAW;MACX,iBAAiB;MACjB,SAAS;MACT,mBAAmB;;AAGrB,WAAO;EACT;EACA,4BAAyB;AACvB,UAAM,MAAM,KAAK,iBAAiB;AAClC,UAAM,SAAmB,IAAI,MAAM,GAAG;AACtC,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,aAAO,CAAC,IAAI,KAAK,wBAAwB,KAAK,WAAW,CAAC,CAAC;IAC7D;AACA,WAAO;EACT;;AAGI,SAAU,4BAEd,UACA,MACA,eACA,cACA,gBACA,gBACA,UAAkB;AAElB,QAAM,MAAM,KAAK,4BAA4B,cAAc,cAAc;AACzE,MAAI,oBAAoB,KAAK,iBAAiB,GAAG;AACjD,MAAI,sBAAsB,QAAW;AACnC,UAAM,eAAe,KAAK,oBAAmB;AAC7C,UAAM,cAAc,KAAK,mBAAkB,EAAG,YAAY;AAC1D,UAAM,SACJ,IAAI,eAAe,aAAa,cAAc;AAChD,wBAAoB,OAAO,aAAY;AACvC,SAAK,iBAAiB,GAAG,IAAI;EAC/B;AAEA,MAAI,0BAA0B,kBAAkB;AAChD,MAAI,aAAa,kBAAkB;AACnC,QAAM,cAAc,kBAAkB;AAItC,MACE,KAAK,mBAAmB,KACxB,eACA,4BAA4B,QAC5B;AACA,8BAA0B;AAC1B,iBAAa;EACf;AAIA,MAAI,4BAA4B,UAAa,eAAe,QAAW;AACrE;EACF;AAEA,MACE,KAAK,kCACH,yBACA,YACA,QAAQ,GAEV;AAIA,SAAK,wBACH,UACA,MACA,eACA,uBAAuB;EAE3B;AACF;;;ACreO,IAAM,uBAAuB;AAC7B,IAAM,0BAA0B;AAGhC,IAAM,mBAAmB;AAKzB,IAAM,SAAS,KAAK;AACpB,IAAM,aAAa,KAAK;AACxB,IAAM,WAAW,KAAK;AACtB,IAAM,mBAAmB,KAAK;AAC9B,IAAM,eAAe,KAAK;AAC1B,IAAM,uBAAuB,KAAK;AAGnC,SAAU,4BACd,SACA,cACA,YAAkB;AAElB,SAAO,aAAa,eAAe;AACrC;AAEA,IAAM,yBAAyB,KAAK;;;ACP9B,IAAO,uBAAP,MAA2B;EAG/B,YAAY,SAAmC;;AAC7C,SAAK,gBACH,KAAA,YAAO,QAAP,YAAO,SAAA,SAAP,QAAS,kBAAY,QAAA,OAAA,SAAA,KAAI,sBAAsB;EACnD;EAEA,SAAS,SAIR;AACC,UAAM,sBAAsB,KAAK,wBAAwB,QAAQ,KAAK;AAEtE,QAAI,oBAAoB,WAAW,GAAG;AACpC,YAAM,iBAAiB,KAAK,4BAA4B,QAAQ,KAAK;AACrE,YAAM,sBAAsB,KAAK,yCAC/B,QAAQ,OACR,KAAK,YAAY;AAEnB,YAAM,wBAAwB,KAAK,kCACjC,QAAQ,OACR,KAAK,YAAY;AAEnB,YAAM,YAAY;QAChB,GAAG;QACH,GAAG;QACH,GAAG;QACH,GAAG;;AAEL,aAAO;IACT;AACA,WAAO;EACT;EAEA,wBAAwB,OAAa;AACnC,WAAO,MAAM,QAAQ,CAAC,gBACpB,wBACE,aACA,aACA,oCAAoC,CACrC;EAEL;EAEA,4BAA4B,OAAa;AACvC,WAAO,MAAM,QAAQ,CAAC,gBACpB,2BACE,aACA,oCAAoC,CACrC;EAEL;EAEA,yCACE,OACA,cAAoB;AAEpB,WAAO,MAAM,QAAQ,CAAC,gBACpB,yCACE,aACA,cACA,oCAAoC,CACrC;EAEL;EAEA,kCACE,OACA,cAAoB;AAEpB,WAAO,kCACL,OACA,cACA,oCAAoC;EAExC;EAEA,6BAA6B,SAM5B;AACC,WAAO,wBACL,QAAQ,gBACR,QAAQ,MACR,QAAQ,cACR,QAAQ,eACR,QAAQ,sBACR,8BAA8B;EAElC;EAEA,0BAA0B,SAMzB;AACC,WAAO,kCACL,QAAQ,gBACR,QAAQ,MACR,QAAQ,cACR,QAAQ,sBACR,YAAY,QAAQ,QAAQ,GAC5B,uCAAuC;EAE3C;;;;ACxGI,IAAO,aAAP,MAAiB;EAMrB,eAAe,QAAqB;AAClC,SAAK,uBAAuB,OAAO,OAAO,QAAQ,sBAAsB,IACnE,OAAO,uBACR,sBAAsB;AAE1B,SAAK,eAAe,OAAO,OAAO,QAAQ,cAAc,IACnD,OAAO,eACR,sBAAsB;AAE1B,SAAK,oBAAoB,OAAO,OAAO,QAAQ,mBAAmB,IAC7D,OAAO,oBACR,IAAI,qBAAqB,EAAE,cAAc,KAAK,aAAY,CAAE;AAEhE,SAAK,sBAAsB,oBAAI,IAAG;EACpC;EAEA,6BAAkD,OAAa;AAC7D,UAAM,QAAQ,CAAC,aAAY;AACzB,WAAK,WAAW,GAAG,SAAS,IAAI,mBAAmB,MAAK;AACtD,cAAM,EACJ,aAAAC,cACA,YAAAC,aACA,QAAAC,SACA,qBAAAC,sBACA,kCACA,wBAAuB,IACrB,eAAe,QAAQ;AAE3B,QAAAH,aAAY,QAAQ,CAAC,aAAY;AAC/B,gBAAM,UAAU,SAAS,QAAQ,IAAI,KAAK,SAAS;AACnD,eAAK,WAAW,GAAG,qBAAqB,QAAQ,CAAC,GAAG,OAAO,IAAI,MAAK;AAClE,kBAAM,SAAS,KAAK,kBAAkB,6BAA6B;cACjE,gBAAgB,SAAS;cACzB,MAAM;cACN,cAAc,SAAS,gBAAgB,KAAK;cAC5C,eAAe,SAAS;cACxB,sBAAsB,KAAK;aAC5B;AAED,kBAAM,MAAM,4BACV,KAAK,oBAAoB,SAAS,IAAI,GACtC,QACA,SAAS,GAAG;AAEd,iBAAK,eAAe,KAAK,MAAM;UACjC,CAAC;QACH,CAAC;AAED,QAAAC,YAAW,QAAQ,CAAC,aAAY;AAC9B,eAAK,qBACH,UACA,SAAS,KACT,UACA,cACA,SAAS,cACT,qBAAqB,QAAQ,CAAC;QAElC,CAAC;AAED,QAAAC,QAAO,QAAQ,CAAC,aAAY;AAC1B,eAAK,qBACH,UACA,SAAS,KACT,YACA,UACA,SAAS,cACT,qBAAqB,QAAQ,CAAC;QAElC,CAAC;AAED,QAAAC,qBAAoB,QAAQ,CAAC,aAAY;AACvC,eAAK,qBACH,UACA,SAAS,KACT,kBACA,uBACA,SAAS,cACT,qBAAqB,QAAQ,CAAC;QAElC,CAAC;AAED,yCAAiC,QAAQ,CAAC,aAAY;AACpD,eAAK,qBACH,UACA,SAAS,KACT,sBACA,oCACA,SAAS,cACT,qBAAqB,QAAQ,CAAC;QAElC,CAAC;AAED,gCAAwB,QAAQ,CAAC,aAAY;AAC3C,eAAK,qBACH,UACA,SAAS,KACT,cACA,2BACA,SAAS,cACT,qBAAqB,QAAQ,CAAC;QAElC,CAAC;MACH,CAAC;IACH,CAAC;EACH;EAEA,qBAEE,MACA,gBACA,SACA,UACA,kBACA,eAAqB;AAErB,SAAK,WACH,GAAG,aAAa,GAAG,mBAAmB,IAAI,KAAK,cAAc,IAC7D,MAAK;AACH,YAAM,SAAS,KAAK,kBAAkB,0BAA0B;QAC9D;QACA;QACA,cAAc,oBAAoB,KAAK;QACvC,sBAAsB,KAAK;QAC3B;OACD;AACD,YAAM,MAAM,4BACV,KAAK,oBAAoB,KAAK,IAAI,GAClC,SACA,cAAc;AAEhB,WAAK,eAAe,KAAK,MAAM;IACjC,CAAC;EAEL;;EAGA,4BAEE,cACA,YAAkB;AAElB,WAAO,4BACL,KAAK,mBACL,cACA,UAAU;EAEd;EAEA,mBAAwC,KAAW;AACjD,WAAO,KAAK,oBAAoB,IAAI,GAAG;EACzC;;EAGA,eAAoC,KAAa,OAAe;AAC9D,SAAK,oBAAoB,IAAI,KAAK,KAAK;EACzC;;AAGF,IAAM,6BAAN,cAAyC,YAAW;EAApD,cAAA;;AACS,SAAA,aAOH;MACF,QAAQ,CAAA;MACR,aAAa,CAAA;MACb,YAAY,CAAA;MACZ,yBAAyB,CAAA;MACzB,qBAAqB,CAAA;MACrB,kCAAkC,CAAA;;EAuCtC;EApCE,QAAK;AACH,SAAK,aAAa;MAChB,QAAQ,CAAA;MACR,aAAa,CAAA;MACb,YAAY,CAAA;MACZ,yBAAyB,CAAA;MACzB,qBAAqB,CAAA;MACrB,kCAAkC,CAAA;;EAEtC;EAEO,YAAYD,SAAc;AAC/B,SAAK,WAAW,OAAO,KAAKA,OAAM;EACpC;EAEO,6BAA6B,SAAgC;AAClE,SAAK,WAAW,wBAAwB,KAAK,OAAO;EACtD;EAEO,yBAAyB,YAA+B;AAC7D,SAAK,WAAW,oBAAoB,KAAK,UAAU;EACrD;EAEO,sCACL,eAA+C;AAE/C,SAAK,WAAW,iCAAiC,KAAK,aAAa;EACrE;EAEO,gBAAgB,MAAgB;AACrC,SAAK,WAAW,WAAW,KAAK,IAAI;EACtC;EAEO,iBAAiB,IAAe;AACrC,SAAK,WAAW,YAAY,KAAK,EAAE;EACrC;;AAGF,IAAM,mBAAmB,IAAI,2BAA0B;AACjD,SAAU,eAAe,MAAU;AAQvC,mBAAiB,MAAK;AACtB,OAAK,OAAO,gBAAgB;AAC5B,QAAM,aAAa,iBAAiB;AAEpC,mBAAiB,MAAK;AACtB,SAAY;AACd;;;ACjQM,SAAU,0BACd,kBACA,iBAAoE;AAGpE,MAAI,MAAM,iBAAiB,WAAW,MAAM,MAAM;AAIhD,qBAAiB,cAAc,gBAAgB;AAC/C,qBAAiB,YAAY,gBAAgB;EAC/C,WAKS,iBAAiB,YAAa,gBAAgB,cAAc,MAAM;AACzE,qBAAiB,YAAY,gBAAgB;EAC/C;AACF;AASM,SAAU,oBACd,kBACA,iBAAgC;AAGhC,MAAI,MAAM,iBAAiB,WAAW,MAAM,MAAM;AAIhD,qBAAiB,cAAc,gBAAgB;AAC/C,qBAAiB,cAAc,gBAAgB;AAC/C,qBAAiB,YAAY,gBAAgB;AAC7C,qBAAiB,YAAY,gBAAgB;AAC7C,qBAAiB,YAAY,gBAAgB;AAC7C,qBAAiB,UAAU,gBAAgB;EAC7C,WAKS,iBAAiB,YAAa,gBAAgB,cAAe,MAAM;AAC1E,qBAAiB,YAAY,gBAAgB;AAC7C,qBAAiB,YAAY,gBAAgB;AAC7C,qBAAiB,UAAU,gBAAgB;EAC7C;AACF;AAEM,SAAU,iBACd,MACA,OACA,eAAqB;AAErB,MAAI,KAAK,SAAS,aAAa,MAAM,QAAW;AAC9C,SAAK,SAAS,aAAa,IAAI,CAAC,KAAK;EACvC,OAAO;AACL,SAAK,SAAS,aAAa,EAAE,KAAK,KAAK;EACzC;AACF;AAEM,SAAU,qBACd,MACA,UACA,YAAe;AAEf,MAAI,KAAK,SAAS,QAAQ,MAAM,QAAW;AACzC,SAAK,SAAS,QAAQ,IAAI,CAAC,UAAU;EACvC,OAAO;AACL,SAAK,SAAS,QAAQ,EAAE,KAAK,UAAU;EACzC;AACF;;;ACtFA,IAAM,OAAO;AAEP,SAAU,eAAe,KAAS,WAAiB;AACvD,SAAO,eAAe,KAAK,MAAM;IAC/B,YAAY;IACZ,cAAc;IACd,UAAU;IACV,OAAO;GACR;AACH;;;ACNM,SAAU,aAAiB,KAAU,OAAS;AAClD,QAAM,gBAAgB,OAAO,KAAK,GAAG;AACrC,QAAM,sBAAsB,cAAc;AAC1C,WAAS,IAAI,GAAG,IAAI,qBAAqB,KAAK;AAC5C,UAAM,gBAAgB,cAAc,CAAC;AACrC,UAAM,iBAAiB,IAAI,aAAa;AACxC,UAAM,uBAAuB,eAAe;AAC5C,aAAS,IAAI,GAAG,IAAI,sBAAsB,KAAK;AAC7C,YAAM,YAAiB,eAAe,CAAC;AAEvC,UAAI,UAAU,iBAAiB,QAAW;AACxC,aAAK,UAAU,IAAI,EAAE,UAAU,UAAU,KAAK;MAChD;IACF;EACF;AAEF;AAEM,SAAU,qCACd,aACA,WAAmB;AAInB,QAAM,qBAA0B,WAAA;EAAa;AAK7C,iBAAe,oBAAoB,cAAc,eAAe;AAEhE,QAAM,gBAAgB;IACpB,OAAO,SAAU,SAA8B,OAAU;AAEvD,UAAI,MAAM,QAAQ,OAAO,GAAG;AAG1B,kBAAU,QAAQ,CAAC;MACrB;AAGA,UAAI,YAAY,QAAW;AACzB,eAAO;MACT;AAEA,aAAO,KAAK,QAAQ,IAAI,EAAE,QAAQ,UAAU,KAAK;IACnD;IAEA,iBAAiB,WAAA;AACf,YAAM,2BAA2B,gBAAgB,MAAM,SAAS;AAChE,UAAI,yBAAyB,WAAW,GAAG;AACzC,cAAM,gBAAgB,yBAAyB,IAC7C,CAAC,iBAAiB,aAAa,GAAG;AAEpC,cAAM,MACJ,mCAAmC,KAAK,YAAY,IAAI;GACnD,cAAc,KAAK,MAAM,EAAE,QAAQ,OAAO,KAAM,CAAC,EAAE;MAE5D;IACF;;AAGF,qBAAmB,YAAY;AAC/B,qBAAmB,UAAU,cAAc;AAE3C,qBAAmB,cAAc;AAEjC,SAAO;AACT;AAEM,SAAU,yCACd,aACA,WACA,iBAAyB;AAIzB,QAAM,qBAA0B,WAAA;EAAa;AAK7C,iBAAe,oBAAoB,cAAc,2BAA2B;AAE5E,QAAM,oBAAoB,OAAO,OAAO,gBAAgB,SAAS;AACjE,YAAU,QAAQ,CAAC,aAAY;AAC7B,sBAAkB,QAAQ,IAAI;EAChC,CAAC;AAED,qBAAmB,YAAY;AAC/B,qBAAmB,UAAU,cAAc;AAE3C,SAAO;AACT;AAEA,IAAY;CAAZ,SAAYE,4BAAyB;AACnC,EAAAA,2BAAAA,2BAAA,kBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,gBAAA,IAAA,CAAA,IAAA;AACF,GAHY,8BAAA,4BAAyB,CAAA,EAAA;AAW/B,SAAU,gBACd,iBACA,WAAmB;AAEnB,QAAM,gBAAgB,0BAA0B,iBAAiB,SAAS;AAE1E,SAAO;AACT;AAEM,SAAU,0BACd,iBACA,WAAmB;AAEnB,QAAM,mBAAmB,UAAU,OAAO,CAAC,iBAAgB;AACzD,WACG,OAAQ,gBAAwB,YAAY,MAAM,eAAgB;EAEvE,CAAC;AAED,QAAM,SAAoC,iBAAiB,IACzD,CAAC,iBAAgB;AACf,WAAO;MACL,KAAK,4BAA4B,YAAY,QAC3C,gBAAgB,YAAY,IAC7B;MACD,MAAM,0BAA0B;MAChC,YAAY;;EAEhB,CAAC;AAGH,SAAO,OAAO,OAAO,OAAO;AAC9B;;;ACrHM,IAAO,cAAP,MAAkB;EAoBtB,gBAAqC,QAAqB;AACxD,SAAK,YAAY,CAAA;AAGjB,SAAK,YAAa,OAAe;AAEjC,SAAK,uBAAuB,OAAO,OAAO,QAAQ,sBAAsB,IACnE,OAAO,uBACR,sBAAsB;AAE1B,QAAI,CAAC,KAAK,WAAW;AACnB,WAAK,2BAA2B,MAAK;MAAE;AACvC,WAAK,wBAAwB,MAAK;MAAE;AACpC,WAAK,kBAAkB,MAAK;MAAE;AAC9B,WAAK,qBAAqB,MAAK;MAAE;AACjC,WAAK,cAAc,MAAK;MAAE;IAC5B,OAAO;AACL,UAAI,QAAQ,KAAK,KAAK,oBAAoB,GAAG;AAC3C,YAAI,KAAK,iBAAiB;AACxB,eAAK,2BAA2B;AAChC,eAAK,0BAA0B;AAC/B,eAAK,cAAc,MAAK;UAAE;AAC1B,eAAK,yBAAyB,KAAK;QACrC,OAAO;AACL,eAAK,2BAA2B,MAAK;UAAE;AACvC,eAAK,0BAA0B,MAAK;UAAE;AACtC,eAAK,cAAc,KAAK;AACxB,eAAK,yBAAyB,KAAK;QACrC;MACF,WAAW,cAAc,KAAK,KAAK,oBAAoB,GAAG;AACxD,YAAI,KAAK,iBAAiB;AACxB,eAAK,2BAAgC;AACrC,eAAK,0BAA+B;AACpC,eAAK,cAAc,MAAK;UAAE;AAC1B,eAAK,yBACH,KAAK;QACT,OAAO;AACL,eAAK,2BAA2B,MAAK;UAAE;AACvC,eAAK,0BAA0B,MAAK;UAAE;AACtC,eAAK,cAAc,KAAK;AACxB,eAAK,yBACH,KAAK;QACT;MACF,WAAW,QAAQ,KAAK,KAAK,oBAAoB,GAAG;AAClD,aAAK,2BAA2B,MAAK;QAAE;AACvC,aAAK,0BAA0B,MAAK;QAAE;AACtC,aAAK,cAAc,MAAK;QAAE;AAC1B,aAAK,yBAAyB,MAAK;QAAE;MACvC,OAAO;AACL,cAAM,MACJ,kDAAkD,OAAO,oBAAoB,GAAG;MAEpF;IACF;EACF;EAEA,yCAEE,SAAY;AAEZ,YAAQ,WAAW;MACjB,aAAa;MACb,WAAW;;EAEf;EAEA,wCAEE,SAAY;AAEZ,YAAQ,WAAW;;;;;MAKjB,aAAa,KAAK,QAAQ,CAAC,EAAE;MAC7B,WAAW;;EAEf;EAEA,mCAAwD,SAAY;AAClE,YAAQ,WAAW;MACjB,aAAa;MACb,WAAW;MACX,aAAa;MACb,WAAW;MACX,SAAS;MACT,WAAW;;EAEf;;;;;;EAOA,kCAAuD,SAAY;AACjE,UAAM,YAAY,KAAK,QAAQ,CAAC;AAChC,YAAQ,WAAW;MACjB,aAAa,UAAU;MACvB,WAAW,UAAU;MACrB,aAAa,UAAU;MACvB,WAAW;MACX,SAAS;MACT,WAAW;;EAEf;EAEA,yBAA8C,cAAoB;AAChE,UAAM,UAAmB;MACvB,MAAM;MACN,UAAU,uBAAO,OAAO,IAAI;;AAG9B,SAAK,uBAAuB,OAAO;AACnC,SAAK,UAAU,KAAK,OAAO;EAC7B;EAEA,wBAAqB;AACnB,SAAK,UAAU,IAAG;EACpB;EAEA,gBAAqC,aAAoB;AAKvD,UAAM,YAAY,KAAK,GAAG,CAAC;AAC3B,UAAM,MAAM,YAAY;AAIxB,QAAI,IAAI,eAAe,UAAU,gBAAgB,MAAM;AACrD,UAAI,YAAY,UAAU;AAC1B,UAAI,UAAU,UAAU;AACxB,UAAI,YAAY,UAAU;IAC5B,OAEK;AACH,UAAI,cAAc;AAClB,UAAI,YAAY;AAChB,UAAI,cAAc;IACpB;EACF;EAEA,sBAA2C,aAAoB;AAE7D,UAAM,YAAY,KAAK,GAAG,CAAC;AAE3B,UAAM,MAAM,YAAY;AAIxB,QAAI,IAAI,eAAe,UAAU,gBAAgB,MAAM;AACrD,UAAI,YAAY,UAAU;IAC5B,OAEK;AACH,UAAI,cAAc;IACpB;EACF;EAEA,gBAEE,KACA,eAAqB;AAErB,UAAM,UAAU,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AACxD,qBAAiB,SAAS,eAAe,GAAG;AAE5C,SAAK,yBAAyB,QAAQ,UAAgB,aAAa;EACrE;EAEA,mBAEE,eACA,UAAgB;AAEhB,UAAM,aAAa,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AAC3D,yBAAqB,YAAY,UAAU,aAAa;AAExD,SAAK,wBAAwB,WAAW,UAAW,cAAc,QAAS;EAC5E;EAEA,+BAA4B;AAK1B,QAAI,KAAK,8BAA8B,QAAW;AAChD,YAAM,+BAA+B,qCACnC,KAAK,WACL,OAAO,KAAK,KAAK,oBAAoB,CAAC;AAExC,WAAK,4BAA4B;AACjC,aAAO;IACT;AAEA,WAAY,KAAK;EACnB;EAEA,2CAAwC;AAKtC,QAAI,KAAK,0CAA0C,QAAW;AAC5D,YAAM,iBAAiB,yCACrB,KAAK,WACL,OAAO,KAAK,KAAK,oBAAoB,GACrC,KAAK,6BAA4B,CAAE;AAErC,WAAK,wCAAwC;AAC7C,aAAO;IACT;AAEA,WAAY,KAAK;EACnB;EAEA,mCAAgC;AAC9B,WAAO,KAAK,WAAW,KAAK,iBAAiB,CAAC;EAChD;EAEA,qCAAkC;AAChC,WAAO,KAAK,sBAAsB,KAAK,yBAAyB;EAClE;;;;AClQI,IAAO,eAAP,MAAmB;EAKvB,mBAAgB;AACd,SAAK,YAAY,CAAA;AACjB,SAAK,kBAAkB;AACvB,SAAK,UAAU;EACjB;EAEA,IAAI,MAAM,UAAkB;AAG1B,QAAI,KAAK,qBAAqB,MAAM;AAClC,YAAM,MACJ,kFAAkF;IAEtF;AAGA,SAAK,MAAK;AACV,SAAK,YAAY;AACjB,SAAK,kBAAkB,SAAS;EAClC;EAEA,IAAI,QAAK;AACP,WAAO,KAAK;EACd;;EAGA,aAAU;AACR,QAAI,KAAK,WAAW,KAAK,kBAAkB,GAAG;AAC5C,WAAK,aAAY;AACjB,aAAO,KAAK,QAAQ,CAAC;IACvB,OAAO;AACL,aAAO;IACT;EACF;;;;;;EAQA,QAA6B,SAAe;AAC1C,UAAM,YAAY,KAAK,UAAU;AACjC,WAAO,KAAK,UAAU,SAAS;EACjC;EAEA,GAAwB,SAAe;AACrC,UAAM,YAAY,KAAK,UAAU;AACjC,QAAI,YAAY,KAAK,KAAK,mBAAmB,WAAW;AACtD,aAAO;IACT,OAAO;AACL,aAAO,KAAK,UAAU,SAAS;IACjC;EACF;EAEA,eAAY;AACV,SAAK;EACP;EAEA,mBAAgB;AACd,WAAO,KAAK;EACd;EAEA,iBAAsCC,WAAgB;AACpD,SAAK,UAAUA;EACjB;EAEA,kBAAe;AACb,SAAK,UAAU;EACjB;EAEA,wBAAqB;AACnB,SAAK,UAAU,KAAK,kBAAkB;EACxC;EAEA,mBAAgB;AACd,WAAO,KAAK,iBAAgB;EAC9B;;;;AC7DI,IAAO,gBAAP,MAAoB;EACxB,OAA+B,MAAa;AAC1C,WAAO,KAAK,KAAK,IAAI;EACvB;EAEA,QAEE,KACA,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,KAAK,OAAO;EACnD;EAEA,QAEE,KACA,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,KAAK,OAAO;EACtD;EAEA,OAEE,KACA,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,GAAG;EACnD;EAEA,GAEE,KACA,YAA6C;AAE7C,WAAO,KAAK,WAAW,YAAY,GAAG;EACxC;EAEA,KAEE,KACA,mBAA0D;AAE1D,WAAO,KAAK,aAAa,KAAK,iBAAiB;EACjD;EAEA,WAEE,KACA,mBAAiE;AAEjE,WAAO,KAAK,mBAAmB,KAAK,iBAAiB;EACvD;EAEA,QAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,SAEE,SACA,SAA2B;AAE3B,WAAO,KAAK,gBAAgB,SAAS,GAAG,OAAO;EACjD;EAEA,QAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,SAEE,YACA,SAAiC;AAEjC,WAAO,KAAK,gBAAgB,YAAY,GAAG,OAAO;EACpD;EAEA,OAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,QAEE,mBAA0D;AAE1D,WAAO,KAAK,eAAe,mBAAmB,CAAC;EACjD;EAEA,GAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,IAEE,YAAiD;AAEjD,WAAO,KAAK,WAAW,YAAY,CAAC;EACtC;EAEA,KAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,MAEE,mBAA0D;AAE1D,SAAK,aAAa,GAAG,iBAAiB;EACxC;EAEA,SAAmC,SAA+B;AAChE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,UAAoC,SAA+B;AACjE,SAAK,qBAAqB,GAAG,OAAO;EACtC;EAEA,aAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,cAEE,mBAAiE;AAEjE,WAAO,KAAK,mBAAmB,GAAG,iBAAiB;EACrD;EAEA,cAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,cAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,cAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,cAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,cAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,cAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,cAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,cAEE,mBAAiE;AAEjE,SAAK,mBAAmB,GAAG,iBAAiB;EAC9C;EAEA,iBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,kBAEE,SAAqC;AAErC,SAAK,2BAA2B,GAAG,OAAO;EAC5C;EAEA,KAEE,MACA,gBACA,SAAyB,qBAAmB;AAE5C,QAAI,KAAK,kBAAkB,SAAS,IAAI,GAAG;AACzC,YAAM,SACJ,qCAAqC,4BAA4B;QAC/D,cAAc;QACd,aAAa,KAAK;OACnB;AAEH,YAAM,QAAQ;QACZ,SAAS;QACT,MAAM,0BAA0B;QAChC,UAAU;;AAEZ,WAAK,iBAAiB,KAAK,KAAK;IAClC;AAEA,SAAK,kBAAkB,KAAK,IAAI;AAEhC,UAAM,qBAAqB,KAAK,WAAW,MAAM,gBAAgB,MAAM;AACtE,SAAa,IAAI,IAAI;AACtB,WAAO;EACT;EAEA,cAEE,MACA,MACA,SAAyB,qBAAmB;AAE5C,UAAM,aAAuC,yBAC3C,MACA,KAAK,mBACL,KAAK,SAAS;AAEhB,SAAK,mBAAmB,KAAK,iBAAiB,OAAO,UAAU;AAE/D,UAAM,qBAAqB,KAAK,WAAW,MAAM,MAAM,MAAM;AAC5D,SAAa,IAAI,IAAI;AACtB,WAAO;EACT;EAEA,UAEE,aACA,MAAY;;AAIZ,UAAM,cAAa,KAAC,YAAoB,cAAQ,QAAA,OAAA,SAAA,KAAI;AACpD,WAAO,WAAA;AAEL,WAAK,oBAAoB,KAAK,CAAC;AAC/B,YAAM,WAAW,KAAK,eAAc;AACpC,UAAI;AACF,mBAAW,MAAM,MAAM,IAAI;AAE3B,eAAO;MACT,SAAS,GAAG;AACV,YAAI,uBAAuB,CAAC,GAAG;AAC7B,iBAAO;QACT,OAAO;AACL,gBAAM;QACR;MACF;AACE,aAAK,iBAAiB,QAAQ;AAC9B,aAAK,oBAAoB,IAAG;MAC9B;IACF;EACF;;EAGO,qBAAkB;AACvB,WAAO,KAAK;EACd;EAEO,+BAA4B;AACjC,WAAO,iBAAiB,OAAO,OAAO,KAAK,oBAAoB,CAAC;EAClE;;;;AC/oBI,IAAO,mBAAP,MAAuB;EAuB3B,qBACE,iBACA,QAAqB;AAErB,SAAK,YAAY,KAAK,YAAY;AAElC,SAAK,sBAAsB,CAAA;AAC3B,SAAK,sBAAsB,CAAA;AAC3B,SAAK,mBAAmB;AACxB,SAAK,eAAe;AACpB,SAAK,aAAa;AAClB,SAAK,oBAAoB;AAEzB,SAAK,oBAAoB,CAAA;AACzB,SAAK,YAAY,CAAA;AACjB,SAAK,sBAAsB,CAAA;AAC3B,SAAK,aAAa,CAAA;AAClB,SAAK,iBAAiB;AACtB,SAAK,wBAAwB,CAAA;AAC7B,SAAK,4BAA4B;AACjC,SAAK,uBAAuB,CAAA;AAE5B,QAAI,OAAO,OAAO,QAAQ,mBAAmB,GAAG;AAC9C,YAAM,MACJ,gLAE0B;IAE9B;AAEA,QAAI,MAAM,QAAQ,eAAe,GAAG;AAIlC,UAAK,gBAA0B,WAAW,GAAG;AAC3C,cAAM,MACJ,2IAE+C;MAEnD;AAEA,UAAI,OAAQ,gBAA0B,CAAC,EAAE,gBAAgB,UAAU;AACjE,cAAM,MACJ,8KAE0B;MAE9B;IACF;AAEA,QAAI,MAAM,QAAQ,eAAe,GAAG;AAClC,WAAK,YAAa,gBAAgC,OAChD,CAAC,KAAyC,YAAsB;AAC9D,YAAI,QAAQ,IAAI,IAAI;AACpB,eAAO;MACT,GACA,CAAA,CAAwC;IAE5C,WACE,OAAO,OAAO,iBAAiB,OAAO,KACrC,OAAO,OAAa,gBAAiB,KAAK,EACxC,KAAI,EACJ,MAAM,WAAW,GACpB;AACA,YAAMC,iBACJ,OAAO,OAAa,gBAAiB,KAAK,EAC1C,KAAI;AACN,YAAM,eAAe,CAAC,GAAG,IAAI,IAAIA,cAAa,CAAC;AAC/C,WAAK,YAAiB,aAAa,OACjC,CAAC,KAAyC,YAAsB;AAC9D,YAAI,QAAQ,IAAI,IAAI;AACpB,eAAO;MACT,GACA,CAAA,CAAwC;IAE5C,WACE,OAAO,oBAAoB,YAC3B,oBAAoB,MACpB;AACA,WAAK,YAAS,OAAA,OAAA,CAAA,GAAS,eAAuC;IAChE,OAAO;AACL,YAAM,IAAI,MACR,wIACuE;IAE3E;AAIA,SAAK,UAAU,KAAK,IAAI;AAExB,UAAM,gBAAgB,OAAO,OAAO,iBAAiB,OAAO,IACvD,OAAO,OAAa,gBAAiB,KAAK,EAAc,KAAI,IAC7D,OAAO,OAAO,eAAe;AACjC,UAAM,wBAAwB,cAAc;;MAE1C,CAAC,qBAAyB;AAAA,YAAA;AAAC,iBAAA,KAAA,iBAAiB,qBAAe,QAAA,OAAA,SAAA,SAAA,GAAE,WAAU;MAAC;IAAA;AAG1E,SAAK,eAAe,wBAChB,qCACA;AAKJ,sBAAkB,OAAO,OAAO,KAAK,SAAS,CAAC;EACjD;EAEA,WAEE,UACA,MACA,QAAsB;AAEtB,QAAI,KAAK,kBAAkB;AACzB,YAAM,MACJ,iBAAiB,QAAQ;6FACuE;IAEpG;AACA,UAAM,gBAAyB,OAAO,OAAO,QAAQ,eAAe,IAC/D,OAAO,gBACR,oBAAoB;AACxB,UAAM,oBAAoB,OAAO,OAAO,QAAQ,mBAAmB,IAC9D,OAAO,oBACR,oBAAoB;AAIxB,UAAM,YACJ,KAAK,oBAAqB,uBAAuB;AAEnD,SAAK;AACL,SAAK,oBAAoB,SAAS,IAAI;AACtC,SAAK,oBAAoB,QAAQ,IAAI;AAErC,QAAI;AAIJ,QAAI,KAAK,cAAc,MAAM;AAC3B,yBAAmB,SAAS,qBAEvB,MAAU;AAEb,YAAI;AACF,eAAK,0BAA0B,WAAW,UAAU,KAAK,UAAU;AACnE,eAAK,MAAM,MAAM,IAAI;AACrB,gBAAM,MAAM,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AACpD,eAAK,YAAY,GAAG;AACpB,iBAAO;QACT,SAAS,GAAG;AACV,iBAAO,KAAK,gBAAgB,GAAG,eAAe,iBAAiB;QACjE;AACE,eAAK,uBAAsB;QAC7B;MACF;IACF,OAAO;AACL,yBAAmB,SAAS,wBAEvB,MAAU;AAEb,YAAI;AACF,eAAK,0BAA0B,WAAW,UAAU,KAAK,UAAU;AACnE,iBAAO,KAAK,MAAM,MAAM,IAAI;QAC9B,SAAS,GAAG;AACV,iBAAO,KAAK,gBAAgB,GAAG,eAAe,iBAAiB;QACjE;AACE,eAAK,uBAAsB;QAC7B;MACF;IACF;AAGA,UAAM,mBAA0C,SAAS,YAEpD,MAAU;AAEb,WAAK,cAAc,QAAQ;AAC3B,UAAI;AACF,eAAO,iBAAiB,MAAM,MAAM,IAAI;MAC1C;AACE,aAAK,aAAa,QAAQ;MAC5B;IACF;AAEA,UAAM,qBAAoD,OAAO,OAC/D,kBACA,EAAE,UAAU,uBAAuB,MAAM,UAAU,iBAAgB,CAAE;AAGvE,WAAO;EACT;EAEA,gBAEE,GACA,qBACA,mBAA2B;AAE3B,UAAM,qBAAqB,KAAK,mBAAmB;AAKnD,UAAM,gBACJ,uBAAuB,CAAC,KAAK,eAAc,KAAM,KAAK;AAExD,QAAI,uBAAuB,CAAC,GAAG;AAC7B,YAAM,aAAkB;AACxB,UAAI,eAAe;AACjB,cAAM,gBAAgB,KAAK,oBAAmB;AAC9C,YAAI,KAAK,yBAAyB,aAAa,GAAG;AAChD,qBAAW,iBAAiB,KAAK,SAAS,aAAa;AACvD,cAAI,KAAK,WAAW;AAClB,kBAAM,mBACJ,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AAC1C,6BAAiB,gBAAgB;AACjC,mBAAO;UACT,OAAO;AACL,mBAAO,kBAAkB,CAAC;UAC5B;QACF,OAAO;AACL,cAAI,KAAK,WAAW;AAClB,kBAAM,mBACJ,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AAC1C,6BAAiB,gBAAgB;AACjC,uBAAW,mBAAmB;UAChC;AAEA,gBAAM;QACR;MACF,WAAW,oBAAoB;AAE7B,aAAK,sBAAqB;AAG1B,eAAO,kBAAkB,CAAC;MAC5B,OAAO;AAEL,cAAM;MACR;IACF,OAAO;AAEL,YAAM;IACR;EACF;;EAGA,eAEE,mBACA,YAAkB;AAElB,UAAM,MAAM,KAAK,4BAA4B,YAAY,UAAU;AACnE,WAAO,KAAK,oBAAoB,mBAAmB,YAAY,GAAG;EACpE;EAEA,oBAEE,mBACA,YACA,KAAW;AAEX,QAAI,gBAAgB,KAAK,mBAAmB,GAAG;AAC/C,QAAI;AACJ,QAAI,OAAO,sBAAsB,YAAY;AAC3C,eAAS,kBAAkB;AAC3B,YAAM,YAAY,kBAAkB;AAEpC,UAAI,cAAc,QAAW;AAC3B,cAAM,uBAAuB;AAC7B,wBAAgB,MAAK;AACnB,iBAAO,UAAU,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI;QAC/D;MACF;IACF,OAAO;AACL,eAAS;IACX;AAEA,QAAI,cAAc,KAAK,IAAI,MAAM,MAAM;AACrC,aAAO,OAAO,KAAK,IAAI;IACzB;AACA,WAAO;EACT;EAEA,mBAEE,gBACA,mBAAiE;AAEjE,UAAM,QAAQ,KAAK,4BACjB,kBACA,cAAc;AAEhB,WAAO,KAAK,wBACV,gBACA,mBACA,KAAK;EAET;EAEA,wBAEE,gBACA,mBACA,KAAW;AAEX,QAAI,gBAAgB,KAAK,mBAAmB,GAAG;AAC/C,QAAI;AACJ,QAAI,OAAO,sBAAsB,YAAY;AAC3C,eAAS,kBAAkB;AAC3B,YAAM,YAAY,kBAAkB;AAEpC,UAAI,cAAc,QAAW;AAC3B,cAAM,uBAAuB;AAC7B,wBAAgB,MAAK;AACnB,iBAAO,UAAU,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI;QAC/D;MACF;IACF,OAAO;AACL,eAAS;IACX;AAEA,QAAe,cAAe,KAAK,IAAI,MAAM,MAAM;AACjD,UAAI,WAAW,KAAK,mBAAmB,MAAM;AAC7C,aACa,cAAe,KAAK,IAAI,MAAM,QACzC,aAAa,MACb;AACA,mBAAW,KAAK,mBAAmB,MAAM;MAC3C;IACF,OAAO;AACL,YAAM,KAAK,wBACT,gBACA,UAAU,sBACkB,kBAAmB,OAAO;IAE1D;AAOA,SAAK,4BACH,KAAK,oBACL,CAAC,gBAAgB,iBAAiB,GAC7B,eACL,kBACA,gBACA,iCAAiC;EAErC;EAEA,2BAEE,gBACA,SAAqC;AAErC,UAAM,QAAQ,KAAK,4BACjB,sBACA,cAAc;AAEhB,SAAK,gCAAgC,gBAAgB,SAAS,KAAK;EACrE;EAEA,gCAEE,gBACA,SACA,KAAW;AAEX,UAAM,SAAS,QAAQ;AACvB,UAAM,YAAY,QAAQ;AAE1B,UAAM,8BAA8B,KAAK,mBAAmB,GAAG;AAG/D,QAAI,4BAA4B,KAAK,IAAI,MAAM,MAAM;AAC9B,aAAQ,KAAK,IAAI;AAItC,YAAM,yBAAyB,MAAK;AAClC,eAAO,KAAK,aAAa,KAAK,QAAQ,CAAC,GAAG,SAAS;MACrD;AAGA,aAAO,KAAK,aAAa,KAAK,QAAQ,CAAC,GAAG,SAAS,MAAM,MAAM;AAG7D,aAAK,QAAQ,SAAS;AAED,eAAQ,KAAK,IAAI;MACxC;AAGA,WAAK,4BACH,KAAK,6BACL;QACE;QACA;QACA;QACA;QACA;SAEF,wBACA,sBACA,gBACA,oCAAoC;IAExC,OAAO;AACL,YAAM,KAAK,wBACT,gBACA,UAAU,qCACV,QAAQ,OAAO;IAEnB;EACF;EAEA,aAEE,gBACA,mBAA0D;AAE1D,UAAM,QAAQ,KAAK,4BAA4B,UAAU,cAAc;AACvE,WAAO,KAAK,kBAAkB,gBAAgB,mBAAmB,KAAK;EACxE;EAEA,kBAEE,gBACA,mBACA,KAAW;AAEX,QAAI,oBAAoB,KAAK,mBAAmB,GAAG;AACnD,QAAI;AACJ,QAAI,OAAO,sBAAsB,YAAY;AAC3C,eAAS,kBAAkB;AAC3B,YAAM,YAAY,kBAAkB;AAEpC,UAAI,cAAc,QAAW;AAC3B,cAAM,uBAAuB;AAC7B,4BAAoB,MAAK;AACvB,iBAAO,UAAU,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI;QAC/D;MACF;IACF,OAAO;AACL,eAAS;IACX;AAEA,QAAI,WAAW;AACf,WAAO,kBAAkB,KAAK,IAAI,MAAM,QAAQ,aAAa,MAAM;AACjE,iBAAW,KAAK,mBAAmB,MAAM;IAC3C;AAGA,SAAK;MACH,KAAK;MACL,CAAC,gBAAgB,iBAAiB;MAC7B;MACL;MACA;MACA;;;;;;MAMA;IAAQ;EAEZ;EAEA,qBAEE,gBACA,SAA+B;AAE/B,UAAM,QAAQ,KAAK,4BACjB,cACA,cAAc;AAEhB,SAAK,0BAA0B,gBAAgB,SAAS,KAAK;EAC/D;EAEA,0BAEE,gBACA,SACA,KAAW;AAEX,UAAM,SAAS,QAAQ;AACvB,UAAM,YAAY,QAAQ;AAC1B,UAAM,uBAAuB,KAAK,mBAAmB,GAAG;AAGxD,QAAI,qBAAqB,KAAK,IAAI,MAAM,MAAM;AAC5C,aAAO,KAAK,IAAI;AAEhB,YAAM,yBAAyB,MAAK;AAClC,eAAO,KAAK,aAAa,KAAK,QAAQ,CAAC,GAAG,SAAS;MACrD;AAEA,aAAO,KAAK,aAAa,KAAK,QAAQ,CAAC,GAAG,SAAS,MAAM,MAAM;AAG7D,aAAK,QAAQ,SAAS;AAEtB,eAAO,KAAK,IAAI;MAClB;AAGA,WAAK,4BACH,KAAK,6BACL;QACE;QACA;QACA;QACA;QACA;SAEF,wBACA,cACA,gBACA,8BAA8B;IAElC;EACF;EAEA,4BAEE,gBACA,WACA,wBACA,QACA,yBAAyE;AAEzE,WAAO,uBAAsB,GAAI;AAG/B,WAAK,QAAQ,SAAS;AACtB,aAAO,KAAK,IAAI;IAClB;AAQA,SAAK,4BACH,KAAK,6BACL;MACE;MACA;MACA;MACA;MACA;OAEF,wBACA,sBACA,gBACA,uBAAuB;EAE3B;EAEA,mBAAwC,QAAgB;AACtD,UAAM,kBAAkB,KAAK,iBAAgB;AAC7C,WAAO,KAAK,IAAI;AAChB,UAAM,iBAAiB,KAAK,iBAAgB;AAI5C,WAAO,iBAAiB;EAC1B;EAEA,WAEE,YACA,YAAkB;AAElB,UAAM,QAAQ,KAAK,4BAA4B,QAAQ,UAAU;AACjE,UAAM,OAAO,MAAM,QAAQ,UAAU,IAAI,aAAa,WAAW;AAEjE,UAAM,SAAS,KAAK,mBAAmB,KAAK;AAC5C,UAAM,eAAe,OAAO,KAAK,MAAM,IAAI;AAC3C,QAAI,iBAAiB,QAAW;AAC9B,YAAM,oBAAyB,KAAK,YAAY;AAChD,aAAO,kBAAkB,IAAI,KAAK,IAAI;IACxC;AACA,SAAK,oBACH,YACC,WAAqC,OAAO;EAEjD;EAEA,yBAAsB;AACpB,SAAK;AACL,SAAK;AAKL,QAAI,KAAK,kBAAkB,GAAG;AAC5B,WAAK,oBAAoB,KAAK,WAAW,KAAK,cAAc;IAC9D;AAGA,SAAK,sBAAqB;EAC5B;EAEA,gBAEE,YACA,KACA,SAAiC;AAEjC,QAAI;AACJ,QAAI;AACF,YAAM,OAAO,YAAY,SAAY,QAAQ,OAAO;AACpD,WAAK,aAAa;AAElB,mBAAa,WAAW,SAAS,MAAM,MAAM,IAAI;AACjD,WAAK,mBACH,YACA,YAAY,UAAa,QAAQ,UAAU,SACvC,QAAQ,QACR,WAAW,QAAQ;AAEzB,aAAO;IACT,SAAS,GAAG;AACV,YAAM,KAAK,qBAAqB,GAAG,SAAS,WAAW,QAAQ;IACjE;EACF;EAEA,qBAEE,GACA,SACA,UAAgB;AAEhB,QAAI,uBAAuB,CAAC,KAAK,EAAE,qBAAqB,QAAW;AACjE,WAAK,mBACH,EAAE,kBACF,YAAY,UAAa,QAAQ,UAAU,SACvC,QAAQ,QACR,QAAQ;AAGd,aAAO,EAAE;IACX;AACA,UAAM;EACR;EAEA,gBAEE,SACA,KACA,SAAsC;AAEtC,QAAI;AACJ,QAAI;AACF,YAAM,YAAY,KAAK,QAAQ,CAAC;AAChC,UAAI,KAAK,aAAa,WAAW,OAAO,MAAM,MAAM;AAClD,aAAK,aAAY;AACjB,wBAAgB;MAClB,OAAO;AACL,aAAK,qBAAqB,SAAS,WAAW,OAAO;MACvD;IACF,SAAS,kBAAkB;AACzB,sBAAgB,KAAK,wBACnB,SACA,KACA,gBAAgB;IAEpB;AAEA,SAAK,gBACH,YAAY,UAAa,QAAQ,UAAU,SACvC,QAAQ,QACR,QAAQ,MACZ,aAAa;AAEf,WAAO;EACT;EAEA,qBAEE,SACA,WACA,SAAsC;AAEtC,QAAI;AACJ,UAAM,gBAAgB,KAAK,GAAG,CAAC;AAC/B,QAAI,YAAY,UAAa,QAAQ,SAAS;AAC5C,YAAM,QAAQ;IAChB,OAAO;AACL,YAAM,KAAK,qBAAqB,0BAA0B;QACxD,UAAU;QACV,QAAQ;QACR,UAAU;QACV,UAAU,KAAK,oBAAmB;OACnC;IACH;AACA,UAAM,KAAK,WACT,IAAI,yBAAyB,KAAK,WAAW,aAAa,CAAC;EAE/D;EAEA,wBAEE,SACA,KACA,kBAAuB;AAIvB,QACE,KAAK;IAEL,iBAAiB,SAAS,8BAC1B,CAAC,KAAK,eAAc,GACpB;AACA,YAAM,UAAU,KAAK,4BAAiC,SAAS,GAAG;AAClE,UAAI;AACF,eAAO,KAAK,kBAAuB,SAAS,OAAO;MACrD,SAAS,qBAAqB;AAC5B,YAAI,oBAAoB,SAAS,4BAA4B;AAG3D,gBAAM;QACR,OAAO;AACL,gBAAM;QACR;MACF;IACF,OAAO;AACL,YAAM;IACR;EACF;EAEA,iBAAc;AAEZ,UAAM,cAAc,KAAK;AAEzB,UAAM,iBAAiB,KAAK,WAAW,MAAM,GAAG,KAAK,iBAAiB,CAAC;AACvE,WAAO;MACL,QAAQ;MACR,YAAY,KAAK,iBAAgB;MACjC,YAAY;MACZ,WAAW,KAAK;;EAEpB;EAEA,iBAAsCC,WAAsB;AAC1D,SAAK,SAASA,UAAS;AACvB,SAAK,iBAAiBA,UAAS,UAAU;AAEzC,UAAM,QAAQA,UAAS;AACvB,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAK,WAAW,CAAC,IAAI,MAAM,CAAC;IAC9B;AACA,SAAK,iBAAiB,MAAM,SAAS;AAErC,QAAI,KAAK,kBAAkB,GAAG;AAC5B,WAAK,oBAAoB,KAAK,WAAW,KAAK,cAAc;IAC9D;EACF;EAEA,0BAEE,WACA,UACA,kBAAwB;AAExB,SAAK,sBAAsB,EAAE,KAAK,yBAAyB,IACzD;AACF,SAAK,WAAW,EAAE,KAAK,cAAc,IAAI;AACzC,SAAK,oBAAoB;AAEzB,SAAK,yBAAyB,QAAQ;EACxC;EAEA,iBAAc;AACZ,WAAO,KAAK,oBAAoB,WAAW;EAC7C;EAEA,sBAAmB;AACjB,UAAM,YAAY,KAAK;AACvB,WAAO,KAAK,oBAAoB,SAAS;EAC3C;EAEA,wBAA6C,WAAiB;AAC5D,WAAO,KAAK,oBAAoB,SAAS;EAC3C;EAEO,iBAAc;AACnB,WAAO,KAAK,aAAa,KAAK,GAAG,CAAC,GAAG,GAAG;EAC1C;EAEO,QAAK;AACV,SAAK,gBAAe;AACpB,SAAK,aAAa;AAClB,SAAK,oBAAoB;AACzB,SAAK,sBAAsB,CAAA;AAC3B,SAAK,SAAS,CAAA;AAGd,SAAK,iBAAiB;AACtB,SAAK,4BAA4B;AAEjC,SAAK,YAAY,CAAA;EACnB;;;;;;;;;;;EAYA,cAAmC,UAAgB;AAEjD,aAAS,IAAI,GAAG,IAAI,KAAK,eAAe,GAAG,KAAK;AAC9C,WAAK,UAAU,KAAK,WAAW;IACjC;EACF;;;;;;;;;;;;;;EAeA,aAAkC,UAAgB;AAChD,QAAI,KAAK,eAAc,MAAO,OAAO;AACnC,YAAM,oBAAoB,KAAK,GAAG,CAAC;AACnC,YAAM,SAAS,KAAK,qBAAqB,8BAA8B;QACrE,gBAAgB;QAChB,UAAU,KAAK,oBAAmB;OACnC;AACD,WAAK,WACH,IAAI,2BAA2B,QAAQ,iBAAiB,CAAC;IAE7D;AAGA,WAAO,KAAK,UAAU,GAAG,EAAE,MAAM,aAAa;AAC5C,WAAK,UAAU,IAAG;IACpB;EACF;;;;ACh6BI,IAAO,eAAP,MAAmB;EAIvB,iBAAiB,QAAqB;AACpC,SAAK,UAAU,CAAA;AACf,SAAK,uBAAuB,OAAO,OAAO,QAAQ,sBAAsB,IACnE,OAAO,uBACR,sBAAsB;EAC5B;EAEA,WAEE,OAA4B;AAE5B,QAAI,uBAAuB,KAAK,GAAG;AACjC,YAAM,UAAU;QACd,WAAW,KAAK,0BAAyB;QACzC,qBAAqB,KAAK,sBAAsB,MAC9C,GACA,KAAK,4BAA4B,CAAC;;AAGtC,WAAK,QAAQ,KAAK,KAAK;AACvB,aAAO;IACT,OAAO;AACL,YAAM,MACJ,6DAA6D;IAEjE;EACF;EAEA,IAAI,SAAM;AACR,WAAO,CAAC,GAAG,KAAK,OAAO;EACzB;EAEA,IAAI,OAAO,WAAkC;AAC3C,SAAK,UAAU;EACjB;;EAGA,wBAEE,YACA,UACA,mBAAqC;AAErC,UAAM,WAAW,KAAK,oBAAmB;AACzC,UAAM,cAAc,KAAK,mBAAkB,EAAG,QAAQ;AACtD,UAAM,+BAA+B,iCACnC,YACA,aACA,UACA,KAAK,YAAY;AAEnB,UAAM,kBAAkB,6BAA6B,CAAC;AACtD,UAAM,eAAe,CAAA;AACrB,aAAS,IAAI,GAAG,KAAK,KAAK,cAAc,KAAK;AAC3C,mBAAa,KAAK,KAAK,GAAG,CAAC,CAAC;IAC9B;AACA,UAAM,MAAM,KAAK,qBAAqB,sBAAsB;MAC1D,wBAAwB;MACxB,QAAQ;MACR,UAAU,KAAK,GAAG,CAAC;MACnB,uBAAuB;MACvB;KACD;AAED,UAAM,KAAK,WAAW,IAAI,mBAAmB,KAAK,KAAK,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;EAC3E;;EAGA,oBAEE,YACA,aAA+B;AAE/B,UAAM,WAAW,KAAK,oBAAmB;AACzC,UAAM,cAAc,KAAK,mBAAkB,EAAG,QAAQ;AAEtD,UAAM,+BAA+B,uBACnC,YACA,aACA,KAAK,YAAY;AAGnB,UAAM,eAAe,CAAA;AACrB,aAAS,IAAI,GAAG,KAAK,KAAK,cAAc,KAAK;AAC3C,mBAAa,KAAK,KAAK,GAAG,CAAC,CAAC;IAC9B;AACA,UAAM,gBAAgB,KAAK,GAAG,CAAC;AAE/B,UAAM,SAAS,KAAK,qBAAqB,wBAAwB;MAC/D,qBAAqB;MACrB,QAAQ;MACR,UAAU;MACV,uBAAuB;MACvB,UAAU,KAAK,oBAAmB;KACnC;AAED,UAAM,KAAK,WACT,IAAI,qBAAqB,QAAQ,KAAK,GAAG,CAAC,GAAG,aAAa,CAAC;EAE/D;;;;AChFF,IAAM,wBAAwB;EAC5B,aAAa;;AAEf,OAAO,OAAO,qBAAqB;AAEnC,IAAM,mBAAmB;AACzB,IAAM,iBAAiB,KAAK,IAAI,GAAG,uBAAuB,IAAI;AAE9D,IAAM,MAAM,YAAY,EAAE,MAAM,yBAAyB,SAAS,MAAM,GAAE,CAAE;AAC5E,kBAAkB,CAAC,GAAG,CAAC;AACvB,IAAM,wBAAwB;EAC5B;EACA;;;EAKA;EACA;EACA;EACA;EACA;EACA;AAAE;AAEJ,OAAO,OAAO,qBAAqB;AAEnC,IAAM,0BAAmC;EACvC,MACE;EAEF,UAAU,CAAA;;AAMN,IAAO,eAAP,MAAmB;EAIvB,iBAAsC,QAAqB;AACzD,SAAK,qBAAqB,CAAA;AAC1B,SAAK,kBAAkB;EACzB;EAEA,kBAAe;AACb,SAAK,kBAAkB;AAEvB,SAAK,WAAW,oBAAoB,MAAK;AAUvC,eAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,cAAM,MAAM,IAAI,IAAI,IAAI;AACxB,aAAK,UAAU,GAAG,EAAe,IAAI,SAAU,MAAM,MAAI;AACvD,iBAAO,KAAK,sBAAsB,MAAM,GAAG,IAAI;QACjD;AACA,aAAK,UAAU,GAAG,EAAe,IAAI,SAAU,MAAM,MAAI;AACvD,iBAAO,KAAK,sBAAsB,MAAM,GAAG,IAAI;QACjD;AACA,aAAK,SAAS,GAAG,EAAc,IAAI,SAAU,MAAI;AAC/C,iBAAO,KAAK,qBAAqB,MAAM,CAAC;QAC1C;AACA,aAAK,KAAK,GAAG,EAAU,IAAI,SAAU,MAAI;AACvC,iBAAO,KAAK,iBAAiB,MAAM,CAAC;QACtC;AACA,aAAK,OAAO,GAAG,EAAY,IAAI,SAAU,MAAI;AAC3C,eAAK,mBAAmB,GAAG,IAAI;QACjC;AACA,aAAK,WAAW,GAAG,EAAgB,IAAI,SAAU,MAAI;AACnD,eAAK,2BAA2B,GAAG,IAAI;QACzC;AACA,aAAK,eAAe,GAAG,EAAoB,IAAI,SAAU,MAAI;AAC3D,eAAK,yBAAyB,GAAG,IAAI;QACvC;AACA,aAAK,mBAAmB,GAAG,EAAwB,IAAI,SAAU,MAAI;AACnE,eAAK,iCAAiC,GAAG,IAAI;QAC/C;MACF;AAGA,WAAK,SAAS,IAAI,SAAU,KAAK,MAAM,MAAI;AACzC,eAAO,KAAK,sBAAsB,MAAM,KAAK,IAAI;MACnD;AACA,WAAK,SAAS,IAAI,SAAU,KAAK,MAAM,MAAI;AACzC,eAAO,KAAK,sBAAsB,MAAM,KAAK,IAAI;MACnD;AACA,WAAK,QAAQ,IAAI,SAAU,KAAK,MAAI;AAClC,eAAO,KAAK,qBAAqB,MAAM,GAAG;MAC5C;AACA,WAAK,IAAI,IAAI,SAAU,KAAK,MAAI;AAC9B,eAAO,KAAK,iBAAiB,MAAM,GAAG;MACxC;AACA,WAAK,MAAM,IAAI,SAAU,KAAK,MAAI;AAChC,aAAK,mBAAmB,KAAK,IAAI;MACnC;AACA,WAAK,YAAY,IAAI,SAAU,KAAK,MAAI;AACtC,aAAK,yBAAyB,KAAK,IAAI;MACzC;AAEA,WAAK,SAAS,KAAK;AACnB,WAAK,YAAY,KAAK;AACtB,WAAK,KAAK,KAAK;IACjB,CAAC;EACH;EAEA,mBAAgB;AACd,SAAK,kBAAkB;AAKvB,SAAK,WAAW,8BAA8B,MAAK;AACjD,YAAM,OAAY;AAElB,eAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,cAAM,MAAM,IAAI,IAAI,IAAI;AACxB,eAAO,KAAK,UAAU,GAAG,EAAE;AAC3B,eAAO,KAAK,UAAU,GAAG,EAAE;AAC3B,eAAO,KAAK,SAAS,GAAG,EAAE;AAC1B,eAAO,KAAK,KAAK,GAAG,EAAE;AACtB,eAAO,KAAK,OAAO,GAAG,EAAE;AACxB,eAAO,KAAK,WAAW,GAAG,EAAE;AAC5B,eAAO,KAAK,eAAe,GAAG,EAAE;AAChC,eAAO,KAAK,mBAAmB,GAAG,EAAE;MACtC;AAEA,aAAO,KAAK,SAAS;AACrB,aAAO,KAAK,SAAS;AACrB,aAAO,KAAK,QAAQ;AACpB,aAAO,KAAK,IAAI;AAChB,aAAO,KAAK,MAAM;AAClB,aAAO,KAAK,YAAY;AAExB,aAAO,KAAK;AACZ,aAAO,KAAK;AACZ,aAAO,KAAK;IACd,CAAC;EACH;;;;EAKA,cAAsC,MAAa;EAEnD;;EAGA,iBACE,aACA,MAAY;AAEZ,WAAO,MAAM;EACf;;;EAIA,UAAU,SAAe;AAGvB,WAAO;EACT;EAEA,mBAAmB,MAAc,KAAa;AAC5C,QAAI;AACF,YAAM,kBAAkB,IAAI,KAAK,EAAE,YAAY,CAAA,GAAI,KAAU,CAAE;AAC/D,sBAAgB,OAAO;AACvB,WAAK,mBAAmB,KAAK,eAAe;AAC5C,UAAI,KAAK,IAAI;AACb,WAAK,mBAAmB,IAAG;AAC3B,aAAO;IACT,SAAS,eAAe;AACtB,UAAI,cAAc,yBAAyB,MAAM;AAC/C,YAAI;AACF,wBAAc,UACZ,cAAc,UACd;QAEJ,SAAS,iBAAiB;AAExB,gBAAM;QACR;MACF;AACA,YAAM;IACR;EACF;;EAGA,qBAEE,mBACA,YAAkB;AAElB,WAAO,WAAW,KAAK,MAAM,QAAQ,mBAAmB,UAAU;EACpE;EAEA,yBAEE,YACA,mBAAiE;AAEjE,eAAW,KAAK,MAAM,qBAAqB,mBAAmB,UAAU;EAC1E;EAEA,iCAEE,YACA,SAAqC;AAErC,eAAW,KACT,MACA,kCACA,SACA,YACA,gBAAgB;EAEpB;EAEA,mBAEE,YACA,mBAA0D;AAE1D,eAAW,KAAK,MAAM,YAAY,mBAAmB,UAAU;EACjE;EAEA,2BAEE,YACA,SAA+B;AAE/B,eAAW,KACT,MACA,yBACA,SACA,YACA,gBAAgB;EAEpB;EAEA,iBAEE,YACA,YAAkB;AAElB,WAAO,aAAa,KAAK,MAAM,YAAY,UAAU;EACvD;EAEA,sBAEE,YACA,YACA,SAAiC;AAEjC,2BAAuB,UAAU;AACjC,QAAI,CAAC,cAAc,CAAC,OAAO,OAAO,YAAY,UAAU,GAAG;AACzD,YAAM,QAAa,IAAI,MACrB,WAAW,aAAa,UAAU,CAAC,uEACiB,KAAK,UACrD,UAAU,CACX;2BAEQ,KAAK,mBAAmB,CAAC,EAAG,IACrC,GAAG;AAEP,YAAM,uBAAuB;AAC7B,YAAM;IACR;AAEA,UAAM,WAAgB,KAAK,mBAAmB,GAAG,EAAE;AACnD,UAAM,WAAW,WAAW;AAC5B,UAAM,kBAAkB,IAAI,YAAY;MACtC,KAAK;MACL,iBAAiB;MACjB,OAAO,YAAO,QAAP,YAAO,SAAA,SAAP,QAAS;;MAEhB,gBAAgB;KACjB;AACD,aAAS,WAAW,KAAK,eAAe;AAExC,WAAO,KAAK,YACR,0BACK;EACX;EAEA,sBAEE,SACA,YACA,SAA2B;AAE3B,2BAAuB,UAAU;AACjC,QAAI,CAAC,oBAAoB,OAAO,GAAG;AACjC,YAAM,QAAa,IAAI,MACrB,WAAW,aAAa,UAAU,CAAC,mEACa,KAAK,UACjD,OAAO,CACR;2BAEQ,KAAK,mBAAmB,CAAC,EAAG,IACrC,GAAG;AAEP,YAAM,uBAAuB;AAC7B,YAAM;IACR;AACA,UAAM,WAAgB,KAAK,mBAAmB,GAAG,EAAE;AACnD,UAAM,kBAAkB,IAAI,SAAS;MACnC,KAAK;MACL,cAAc;MACd,OAAO,YAAO,QAAP,YAAO,SAAA,SAAP,QAAS;KACjB;AACD,aAAS,WAAW,KAAK,eAAe;AAExC,WAAO;EACT;;AAGF,SAAS,WACP,iBACA,aACA,YACA,YAAqB,OAAK;AAE1B,yBAAuB,UAAU;AACjC,QAAM,WAAgB,KAAK,mBAAmB,GAAG,EAAE;AACnD,QAAM,gBACJ,OAAO,gBAAgB,aAAa,cAAc,YAAY;AAEhE,QAAM,UAAU,IAAI,gBAAgB,EAAE,YAAY,CAAA,GAAI,KAAK,WAAU,CAAE;AACvE,MAAI,WAAW;AACb,YAAQ,YAAY,YAAY;EAClC;AACA,MAAI,OAAO,OAAO,aAAa,eAAe,GAAG;AAC/C,YAAQ,eAAe,YAAY;EACrC;AAEA,OAAK,mBAAmB,KAAK,OAAO;AACpC,gBAAc,KAAK,IAAI;AACvB,WAAS,WAAW,KAAK,OAAO;AAChC,OAAK,mBAAmB,IAAG;AAE3B,SAAO;AACT;AAEA,SAAS,aAAa,aAAkB,YAAkB;AACxD,yBAAuB,UAAU;AACjC,QAAM,WAAgB,KAAK,mBAAmB,GAAG,EAAE;AAEnD,QAAM,aAAa,MAAM,QAAQ,WAAW,MAAM;AAClD,QAAM,OACJ,eAAe,QAAQ,cAAc,YAAY;AAEnD,QAAM,YAAY,IAAI,YAAY;IAChC,YAAY,CAAA;IACZ,KAAK;IACL,mBAAmB,cAAc,YAAY,uBAAuB;GACrE;AACD,MAAI,OAAO,OAAO,aAAa,eAAe,GAAG;AAC/C,cAAU,eAAe,YAAY;EACvC;AAEA,QAAM,gBAAgB,KAAK,KACzB,CAAC,YAAiB,OAAO,QAAQ,SAAS,UAAU;AAEtD,YAAU,gBAAgB;AAE1B,WAAS,WAAW,KAAK,SAAS;AAElC,OAAK,QAAQ,CAAC,YAAW;AACvB,UAAM,cAAc,IAAI,YAAY,EAAE,YAAY,CAAA,EAAE,CAAE;AACtD,cAAU,WAAW,KAAK,WAAW;AACrC,QAAI,OAAO,OAAO,SAAS,oBAAoB,GAAG;AAChD,kBAAY,oBAAoB,QAAQ;IAC1C,WAES,OAAO,OAAO,SAAS,MAAM,GAAG;AACvC,kBAAY,oBAAoB;IAClC;AACA,SAAK,mBAAmB,KAAK,WAAW;AACxC,YAAQ,IAAI,KAAK,IAAI;AACrB,SAAK,mBAAmB,IAAG;EAC7B,CAAC;AACD,SAAO;AACT;AAEA,SAAS,aAAa,KAAW;AAC/B,SAAO,QAAQ,IAAI,KAAK,GAAG,GAAG;AAChC;AAEA,SAAS,uBAAuB,KAAW;AACzC,MAAI,MAAM,KAAK,MAAM,gBAAgB;AACnC,UAAM,QAAa,IAAI;;MAErB,kCAAkC,GAAG;wDAEjC,iBAAiB,CACnB;IAAE;AAEN,UAAM,uBAAuB;AAC7B,UAAM;EACR;AACF;;;AC3bM,IAAO,oBAAP,MAAwB;EAK5B,sBAAsB,QAAqB;AACzC,QAAI,OAAO,OAAO,QAAQ,eAAe,GAAG;AAC1C,YAAM,oBAAoB,OAAO;AACjC,YAAM,gBAAgB,OAAO,sBAAsB;AACnD,WAAK,oBAAoB,gBACb,oBACR;AACJ,WAAK,gBAAgB,gBACjB,oBAAoB,IACnB;IACP,OAAO;AACL,WAAK,oBAAoB;AACzB,WAAK,gBAAgB,sBAAsB;IAC7C;AAEA,SAAK,kBAAkB;EACzB;EAEA,WAAmC,WAAmB,WAAkB;AAGtE,QAAI,KAAK,kBAAkB,MAAM;AAC/B,WAAK;AACL,YAAM,SAAS,IAAI,MAAM,KAAK,kBAAkB,CAAC,EAAE,KAAK,GAAI;AAC5D,UAAI,KAAK,kBAAkB,KAAK,mBAAmB;AACjD,gBAAQ,IAAI,GAAG,MAAM,QAAQ,SAAS,GAAG;MAC3C;AACA,YAAM,EAAE,MAAM,MAAK,IAAK,MAAM,SAAS;AAEvC,YAAM,cAAc,OAAO,KAAK,QAAQ,OAAO,QAAQ;AACvD,UAAI,KAAK,kBAAkB,KAAK,mBAAmB;AACjD,oBAAY,GAAG,MAAM,QAAQ,SAAS,WAAW,IAAI,IAAI;MAC3D;AACA,WAAK;AACL,aAAO;IACT,OAAO;AACL,aAAO,UAAS;IAClB;EACF;;;;ACnDI,SAAU,YAAY,aAAkB,WAAgB;AAC5D,YAAU,QAAQ,CAAC,aAAY;AAC7B,UAAM,YAAY,SAAS;AAC3B,WAAO,oBAAoB,SAAS,EAAE,QAAQ,CAAC,aAAY;AACzD,UAAI,aAAa,eAAe;AAC9B;MACF;AAEA,YAAM,qBAAqB,OAAO,yBAChC,WACA,QAAQ;AAGV,UACE,uBACC,mBAAmB,OAAO,mBAAmB,MAC9C;AACA,eAAO,eACL,YAAY,WACZ,UACA,kBAAkB;MAEtB,OAAO;AACL,oBAAY,UAAU,QAAQ,IAAI,SAAS,UAAU,QAAQ;MAC/D;IACF,CAAC;EACH,CAAC;AACH;;;ACUO,IAAM,cAAc,oBACzB,KACA,IACA,KACA,KACA,KACA,KACA,KACA,GAAG;AAEL,OAAO,OAAO,WAAW;AAIlB,IAAM,wBAET,OAAO,OAAO;EAChB,iBAAiB;EACjB,cAAc;EACd,sBAAsB;EACtB,WAAW;EACX,sBAAsB;EACtB,sBAAsB;EACtB,eAAe;EACf,iBAAiB;CAClB;AAEM,IAAM,sBAAkD,OAAO,OAAO;EAC3E,mBAAmB,MAAM;EACzB,eAAe;CAChB;AAED,IAAY;CAAZ,SAAYC,4BAAyB;AACnC,EAAAA,2BAAAA,2BAAA,mBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,qBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,uBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,uBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,wBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,gBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,qBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,gBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,iCAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,oBAAA,IAAA,CAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,wBAAA,IAAA,EAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,uBAAA,IAAA,EAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,eAAA,IAAA,EAAA,IAAA;AACA,EAAAA,2BAAAA,2BAAA,6BAAA,IAAA,EAAA,IAAA;AACF,GAfY,8BAAA,4BAAyB,CAAA,EAAA;AAgD/B,SAAU,UAAU,QAAa,QAAS;AAC9C,SAAO,WAAA;AACL,WAAO;EACT;AACF;AAEM,IAAO,SAAP,MAAO,QAAM;;;;EAYjB,OAAO,oBAAoB,gBAAsB;AAC/C,UAAM,MACJ,4HAC+D;EAEnE;EAEO,sBAAmB;AACxB,SAAK,WAAW,uBAAuB,MAAK;AAC1C,UAAI;AAEJ,WAAK,mBAAmB;AACxB,YAAM,YAAY,KAAK;AAEvB,WAAK,WAAW,eAAe,MAAK;AAIlC,yBAAiB,IAAI;MACvB,CAAC;AAED,WAAK,WAAW,qBAAqB,MAAK;AACxC,YAAI;AACF,eAAK,gBAAe;AAEpB,eAAK,kBAAkB,QAAQ,CAAC,iBAAwB;AACtD,kBAAM,cAAe,KACnB,YAAY;AAEd,kBAAM,wBAAwB,YAAY,uBAAuB;AACjE,gBAAI;AACJ,iBAAK,WAAW,GAAG,YAAY,SAAS,MAAK;AAC3C,iCAAmB,KAAK,mBACtB,cACA,qBAAqB;YAEzB,CAAC;AACD,iBAAK,qBAAqB,YAAY,IAAI;UAC5C,CAAC;QACH;AACE,eAAK,iBAAgB;QACvB;MACF,CAAC;AAED,UAAI,iBAA2C,CAAA;AAC/C,WAAK,WAAW,qBAAqB,MAAK;AACxC,yBAAiBC,gBAAe;UAC9B,OAAO,OAAO,OAAO,KAAK,oBAAoB;SAC/C;AACD,aAAK,mBAAmB,KAAK,iBAAiB,OAAO,cAAc;MACrE,CAAC;AAED,WAAK,WAAW,uBAAuB,MAAK;AAG1C,YAAI,eAAe,WAAW,KAAK,KAAK,oBAAoB,OAAO;AACjE,gBAAM,mBAAmBC,iBAAgB;YACvC,OAAO,OAAO,OAAO,KAAK,oBAAoB;YAC9C,YAAY,OAAO,OAAO,KAAK,SAAS;YACxC,gBAAgB;YAChB,aAAa;WACd;AACD,gBAAM,4BAA4B,kBAAkB;YAClD,mBAAmB,KAAK;YACxB,OAAO,OAAO,OAAO,KAAK,oBAAoB;YAC9C,YAAY,OAAO,OAAO,KAAK,SAAS;YACxC,aAAa;WACd;AACD,eAAK,mBAAmB,KAAK,iBAAiB,OAC5C,kBACA,yBAAyB;QAE7B;MACF,CAAC;AAGD,UAAI,KAAK,iBAAiB,WAAW,GAAG;AAEtC,YAAI,KAAK,iBAAiB;AACxB,eAAK,WAAW,0BAA0B,MAAK;AAC7C,kBAAM,aAAa,uBACjB,OAAO,OAAO,KAAK,oBAAoB,CAAC;AAE1C,iBAAK,gBAAgB;UACvB,CAAC;QACH;AAEA,aAAK,WAAW,6BAA6B,MAAK;;AAChD,WAAA,MAAA,KAAA,KAAK,mBAAkB,gBAAU,QAAA,OAAA,SAAA,SAAA,GAAA,KAAA,IAAG;YAClC,OAAO,OAAO,OAAO,KAAK,oBAAoB;WAC/C;AACD,eAAK,6BACH,OAAO,OAAO,KAAK,oBAAoB,CAAC;QAE5C,CAAC;MACH;AAEA,UACE,CAAC,QAAO,oCACR,KAAK,iBAAiB,WAAW,GACjC;AACA,wBAAgB,KAAK,iBAAiB,IACpC,CAAC,aAAa,SAAS,OAAO;AAEhC,cAAM,IAAI,MACR;GAAwC,cAAc,KACpD,qCAAqC,CACtC,EAAE;MAEP;IACF,CAAC;EACH;EAMA,YAAY,iBAAkC,QAAqB;AAJnE,SAAA,mBAA6C,CAAA;AAC7C,SAAA,mBAAmB;AAIjB,UAAM,OAAsB;AAC5B,SAAK,iBAAiB,MAAM;AAC5B,SAAK,iBAAgB;AACrB,SAAK,eAAe,MAAM;AAC1B,SAAK,qBAAqB,iBAAiB,MAAM;AACjD,SAAK,gBAAgB,MAAM;AAC3B,SAAK,gBAAgB,MAAM;AAC3B,SAAK,iBAAiB,MAAM;AAC5B,SAAK,sBAAsB,MAAM;AAEjC,QAAI,OAAO,OAAO,QAAQ,eAAe,GAAG;AAC1C,YAAM,IAAI,MACR,kQAGwB;IAE5B;AAEA,SAAK,kBAAkB,OAAO,OAAO,QAAQ,iBAAiB,IACzD,OAAO,kBACR,sBAAsB;EAC5B;;AAjJO,OAAA,mCAA4C;AAoJrD,YAAY,QAAQ;EAClB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AAaK,IAAO,wBAAP,cAAqC,OAAM;EAC/C,YACE,iBACA,SAAgC,uBAAqB;AAErD,UAAM,cAAW,OAAA,OAAA,CAAA,GAAQ,MAAM;AAC/B,gBAAY,YAAY;AACxB,UAAM,iBAAiB,WAAW;EACpC;;;;AC5SF,SAAS,SAAS,OAAO,UAAU;AACjC,MAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,SAAS,MAAM,MAAM;AAEzB,SAAO,EAAE,QAAQ,QAAQ;AACvB,WAAO,KAAK,IAAI,SAAS,MAAM,KAAK,GAAG,OAAO,KAAK;AAAA,EACrD;AACA,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACbf,SAAS,iBAAiB;AACxB,OAAK,WAAW,CAAC;AACjB,OAAK,OAAO;AACd;AAEA,IAAO,yBAAQ;;;ACoBf,SAAS,GAAG,OAAO,OAAO;AACxB,SAAO,UAAU,SAAU,UAAU,SAAS,UAAU;AAC1D;AAEA,IAAO,aAAQ;;;AC1Bf,SAAS,aAAa,OAAO,KAAK;AAChC,MAAI,SAAS,MAAM;AACnB,SAAO,UAAU;AACf,QAAI,WAAG,MAAM,MAAM,EAAE,CAAC,GAAG,GAAG,GAAG;AAC7B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACjBf,IAAI,aAAa,MAAM;AAGvB,IAAI,SAAS,WAAW;AAWxB,SAAS,gBAAgB,KAAK;AAC5B,MAAI,OAAO,KAAK,UACZ,QAAQ,qBAAa,MAAM,GAAG;AAElC,MAAI,QAAQ,GAAG;AACb,WAAO;AAAA,EACT;AACA,MAAI,YAAY,KAAK,SAAS;AAC9B,MAAI,SAAS,WAAW;AACtB,SAAK,IAAI;AAAA,EACX,OAAO;AACL,WAAO,KAAK,MAAM,OAAO,CAAC;AAAA,EAC5B;AACA,IAAE,KAAK;AACP,SAAO;AACT;AAEA,IAAO,0BAAQ;;;ACvBf,SAAS,aAAa,KAAK;AACzB,MAAI,OAAO,KAAK,UACZ,QAAQ,qBAAa,MAAM,GAAG;AAElC,SAAO,QAAQ,IAAI,SAAY,KAAK,KAAK,EAAE,CAAC;AAC9C;AAEA,IAAO,uBAAQ;;;ACPf,SAAS,aAAa,KAAK;AACzB,SAAO,qBAAa,KAAK,UAAU,GAAG,IAAI;AAC5C;AAEA,IAAO,uBAAQ;;;ACHf,SAAS,aAAa,KAAK,OAAO;AAChC,MAAI,OAAO,KAAK,UACZ,QAAQ,qBAAa,MAAM,GAAG;AAElC,MAAI,QAAQ,GAAG;AACb,MAAE,KAAK;AACP,SAAK,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,EACxB,OAAO;AACL,SAAK,KAAK,EAAE,CAAC,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACZf,SAAS,UAAU,SAAS;AAC1B,MAAI,QAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAM;AACX,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,QAAQ,QAAQ,KAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGA,UAAU,UAAU,QAAQ;AAC5B,UAAU,UAAU,QAAQ,IAAI;AAChC,UAAU,UAAU,MAAM;AAC1B,UAAU,UAAU,MAAM;AAC1B,UAAU,UAAU,MAAM;AAE1B,IAAO,oBAAQ;;;ACtBf,SAAS,aAAa;AACpB,OAAK,WAAW,IAAI;AACpB,OAAK,OAAO;AACd;AAEA,IAAO,qBAAQ;;;ACLf,SAAS,YAAY,KAAK;AACxB,MAAI,OAAO,KAAK,UACZ,SAAS,KAAK,QAAQ,EAAE,GAAG;AAE/B,OAAK,OAAO,KAAK;AACjB,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACRf,SAAS,SAAS,KAAK;AACrB,SAAO,KAAK,SAAS,IAAI,GAAG;AAC9B;AAEA,IAAO,mBAAQ;;;ACJf,SAAS,SAAS,KAAK;AACrB,SAAO,KAAK,SAAS,IAAI,GAAG;AAC9B;AAEA,IAAO,mBAAQ;;;ACZf,IAAI,aAAa,OAAO,UAAU,YAAY,UAAU,OAAO,WAAW,UAAU;AAEpF,IAAO,qBAAQ;;;ACAf,IAAI,WAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU;AAG5E,IAAI,OAAO,sBAAc,YAAY,SAAS,aAAa,EAAE;AAE7D,IAAO,eAAQ;;;ACLf,IAAIC,UAAS,aAAK;AAElB,IAAO,iBAAQA;;;ACFf,IAAI,cAAc,OAAO;AAGzB,IAAI,iBAAiB,YAAY;AAOjC,IAAI,uBAAuB,YAAY;AAGvC,IAAI,iBAAiB,iBAAS,eAAO,cAAc;AASnD,SAAS,UAAU,OAAO;AACxB,MAAI,QAAQ,eAAe,KAAK,OAAO,cAAc,GACjD,MAAM,MAAM,cAAc;AAE9B,MAAI;AACF,UAAM,cAAc,IAAI;AACxB,QAAI,WAAW;AAAA,EACjB,SAAS,GAAG;AAAA,EAAC;AAEb,MAAI,SAAS,qBAAqB,KAAK,KAAK;AAC5C,MAAI,UAAU;AACZ,QAAI,OAAO;AACT,YAAM,cAAc,IAAI;AAAA,IAC1B,OAAO;AACL,aAAO,MAAM,cAAc;AAAA,IAC7B;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;AC5Cf,IAAIC,eAAc,OAAO;AAOzB,IAAIC,wBAAuBD,aAAY;AASvC,SAAS,eAAe,OAAO;AAC7B,SAAOC,sBAAqB,KAAK,KAAK;AACxC;AAEA,IAAO,yBAAQ;;;AChBf,IAAI,UAAU;AAAd,IACI,eAAe;AAGnB,IAAIC,kBAAiB,iBAAS,eAAO,cAAc;AASnD,SAAS,WAAW,OAAO;AACzB,MAAI,SAAS,MAAM;AACjB,WAAO,UAAU,SAAY,eAAe;AAAA,EAC9C;AACA,SAAQA,mBAAkBA,mBAAkB,OAAO,KAAK,IACpD,kBAAU,KAAK,IACf,uBAAe,KAAK;AAC1B;AAEA,IAAO,qBAAQ;;;ACFf,SAAS,SAAS,OAAO;AACvB,MAAI,OAAO,OAAO;AAClB,SAAO,SAAS,SAAS,QAAQ,YAAY,QAAQ;AACvD;AAEA,IAAO,mBAAQ;;;AC1Bf,IAAI,WAAW;AAAf,IACI,UAAU;AADd,IAEI,SAAS;AAFb,IAGI,WAAW;AAmBf,SAAS,WAAW,OAAO;AACzB,MAAI,CAAC,iBAAS,KAAK,GAAG;AACpB,WAAO;AAAA,EACT;AAGA,MAAI,MAAM,mBAAW,KAAK;AAC1B,SAAO,OAAO,WAAW,OAAO,UAAU,OAAO,YAAY,OAAO;AACtE;AAEA,IAAO,qBAAQ;;;ACjCf,IAAI,aAAa,aAAK,oBAAoB;AAE1C,IAAO,qBAAQ;;;ACFf,IAAI,cAAc,WAAW;AAC3B,MAAI,MAAM,SAAS,KAAK,sBAAc,mBAAW,QAAQ,mBAAW,KAAK,YAAY,EAAE;AACvF,SAAO,MAAO,mBAAmB,MAAO;AAC1C,GAAE;AASF,SAAS,SAAS,MAAM;AACtB,SAAO,CAAC,CAAC,cAAe,cAAc;AACxC;AAEA,IAAO,mBAAQ;;;AClBf,IAAI,YAAY,SAAS;AAGzB,IAAI,eAAe,UAAU;AAS7B,SAAS,SAAS,MAAM;AACtB,MAAI,QAAQ,MAAM;AAChB,QAAI;AACF,aAAO,aAAa,KAAK,IAAI;AAAA,IAC/B,SAAS,GAAG;AAAA,IAAC;AACb,QAAI;AACF,aAAQ,OAAO;AAAA,IACjB,SAAS,GAAG;AAAA,IAAC;AAAA,EACf;AACA,SAAO;AACT;AAEA,IAAO,mBAAQ;;;AChBf,IAAI,eAAe;AAGnB,IAAI,eAAe;AAGnB,IAAIC,aAAY,SAAS;AAAzB,IACIC,eAAc,OAAO;AAGzB,IAAIC,gBAAeF,WAAU;AAG7B,IAAIG,kBAAiBF,aAAY;AAGjC,IAAI,aAAa;AAAA,EAAO,MACtBC,cAAa,KAAKC,eAAc,EAAE,QAAQ,cAAc,MAAM,EAC7D,QAAQ,0DAA0D,OAAO,IAAI;AAChF;AAUA,SAAS,aAAa,OAAO;AAC3B,MAAI,CAAC,iBAAS,KAAK,KAAK,iBAAS,KAAK,GAAG;AACvC,WAAO;AAAA,EACT;AACA,MAAI,UAAU,mBAAW,KAAK,IAAI,aAAa;AAC/C,SAAO,QAAQ,KAAK,iBAAS,KAAK,CAAC;AACrC;AAEA,IAAO,uBAAQ;;;ACtCf,SAAS,SAAS,QAAQ,KAAK;AAC7B,SAAO,UAAU,OAAO,SAAY,OAAO,GAAG;AAChD;AAEA,IAAO,mBAAQ;;;ACDf,SAAS,UAAU,QAAQ,KAAK;AAC9B,MAAI,QAAQ,iBAAS,QAAQ,GAAG;AAChC,SAAO,qBAAa,KAAK,IAAI,QAAQ;AACvC;AAEA,IAAO,oBAAQ;;;ACZf,IAAIC,OAAM,kBAAU,cAAM,KAAK;AAE/B,IAAO,cAAQA;;;ACHf,IAAI,eAAe,kBAAU,QAAQ,QAAQ;AAE7C,IAAO,uBAAQ;;;ACIf,SAAS,YAAY;AACnB,OAAK,WAAW,uBAAe,qBAAa,IAAI,IAAI,CAAC;AACrD,OAAK,OAAO;AACd;AAEA,IAAO,oBAAQ;;;ACJf,SAAS,WAAW,KAAK;AACvB,MAAI,SAAS,KAAK,IAAI,GAAG,KAAK,OAAO,KAAK,SAAS,GAAG;AACtD,OAAK,QAAQ,SAAS,IAAI;AAC1B,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACbf,IAAI,iBAAiB;AAGrB,IAAIC,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AAWjC,SAAS,QAAQ,KAAK;AACpB,MAAI,OAAO,KAAK;AAChB,MAAI,sBAAc;AAChB,QAAI,SAAS,KAAK,GAAG;AACrB,WAAO,WAAW,iBAAiB,SAAY;AAAA,EACjD;AACA,SAAOC,gBAAe,KAAK,MAAM,GAAG,IAAI,KAAK,GAAG,IAAI;AACtD;AAEA,IAAO,kBAAQ;;;AC1Bf,IAAIC,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AAWjC,SAAS,QAAQ,KAAK;AACpB,MAAI,OAAO,KAAK;AAChB,SAAO,uBAAgB,KAAK,GAAG,MAAM,SAAaC,gBAAe,KAAK,MAAM,GAAG;AACjF;AAEA,IAAO,kBAAQ;;;ACnBf,IAAIC,kBAAiB;AAYrB,SAAS,QAAQ,KAAK,OAAO;AAC3B,MAAI,OAAO,KAAK;AAChB,OAAK,QAAQ,KAAK,IAAI,GAAG,IAAI,IAAI;AACjC,OAAK,GAAG,IAAK,wBAAgB,UAAU,SAAaA,kBAAiB;AACrE,SAAO;AACT;AAEA,IAAO,kBAAQ;;;ACTf,SAAS,KAAK,SAAS;AACrB,MAAI,QAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAM;AACX,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,QAAQ,QAAQ,KAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGA,KAAK,UAAU,QAAQ;AACvB,KAAK,UAAU,QAAQ,IAAI;AAC3B,KAAK,UAAU,MAAM;AACrB,KAAK,UAAU,MAAM;AACrB,KAAK,UAAU,MAAM;AAErB,IAAO,eAAQ;;;ACpBf,SAAS,gBAAgB;AACvB,OAAK,OAAO;AACZ,OAAK,WAAW;AAAA,IACd,QAAQ,IAAI;AAAA,IACZ,OAAO,KAAK,eAAO;AAAA,IACnB,UAAU,IAAI;AAAA,EAChB;AACF;AAEA,IAAO,wBAAQ;;;ACbf,SAAS,UAAU,OAAO;AACxB,MAAI,OAAO,OAAO;AAClB,SAAQ,QAAQ,YAAY,QAAQ,YAAY,QAAQ,YAAY,QAAQ,YACvE,UAAU,cACV,UAAU;AACjB;AAEA,IAAO,oBAAQ;;;ACJf,SAAS,WAAWC,MAAK,KAAK;AAC5B,MAAI,OAAOA,KAAI;AACf,SAAO,kBAAU,GAAG,IAChB,KAAK,OAAO,OAAO,WAAW,WAAW,MAAM,IAC/C,KAAK;AACX;AAEA,IAAO,qBAAQ;;;ACNf,SAAS,eAAe,KAAK;AAC3B,MAAI,SAAS,mBAAW,MAAM,GAAG,EAAE,QAAQ,EAAE,GAAG;AAChD,OAAK,QAAQ,SAAS,IAAI;AAC1B,SAAO;AACT;AAEA,IAAO,yBAAQ;;;ACNf,SAAS,YAAY,KAAK;AACxB,SAAO,mBAAW,MAAM,GAAG,EAAE,IAAI,GAAG;AACtC;AAEA,IAAO,sBAAQ;;;ACJf,SAAS,YAAY,KAAK;AACxB,SAAO,mBAAW,MAAM,GAAG,EAAE,IAAI,GAAG;AACtC;AAEA,IAAO,sBAAQ;;;ACHf,SAAS,YAAY,KAAK,OAAO;AAC/B,MAAI,OAAO,mBAAW,MAAM,GAAG,GAC3B,OAAO,KAAK;AAEhB,OAAK,IAAI,KAAK,KAAK;AACnB,OAAK,QAAQ,KAAK,QAAQ,OAAO,IAAI;AACrC,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACRf,SAAS,SAAS,SAAS;AACzB,MAAI,QAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAM;AACX,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,QAAQ,QAAQ,KAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGA,SAAS,UAAU,QAAQ;AAC3B,SAAS,UAAU,QAAQ,IAAI;AAC/B,SAAS,UAAU,MAAM;AACzB,SAAS,UAAU,MAAM;AACzB,SAAS,UAAU,MAAM;AAEzB,IAAO,mBAAQ;;;AC1Bf,IAAI,mBAAmB;AAYvB,SAAS,SAAS,KAAK,OAAO;AAC5B,MAAI,OAAO,KAAK;AAChB,MAAI,gBAAgB,mBAAW;AAC7B,QAAI,QAAQ,KAAK;AACjB,QAAI,CAAC,eAAQ,MAAM,SAAS,mBAAmB,GAAI;AACjD,YAAM,KAAK,CAAC,KAAK,KAAK,CAAC;AACvB,WAAK,OAAO,EAAE,KAAK;AACnB,aAAO;AAAA,IACT;AACA,WAAO,KAAK,WAAW,IAAI,iBAAS,KAAK;AAAA,EAC3C;AACA,OAAK,IAAI,KAAK,KAAK;AACnB,OAAK,OAAO,KAAK;AACjB,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACnBf,SAAS,MAAM,SAAS;AACtB,MAAI,OAAO,KAAK,WAAW,IAAI,kBAAU,OAAO;AAChD,OAAK,OAAO,KAAK;AACnB;AAGA,MAAM,UAAU,QAAQ;AACxB,MAAM,UAAU,QAAQ,IAAI;AAC5B,MAAM,UAAU,MAAM;AACtB,MAAM,UAAU,MAAM;AACtB,MAAM,UAAU,MAAM;AAEtB,IAAO,gBAAQ;;;ACzBf,IAAIC,kBAAiB;AAYrB,SAAS,YAAY,OAAO;AAC1B,OAAK,SAAS,IAAI,OAAOA,eAAc;AACvC,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACTf,SAAS,YAAY,OAAO;AAC1B,SAAO,KAAK,SAAS,IAAI,KAAK;AAChC;AAEA,IAAO,sBAAQ;;;ACDf,SAAS,SAAS,QAAQ;AACxB,MAAI,QAAQ,IACR,SAAS,UAAU,OAAO,IAAI,OAAO;AAEzC,OAAK,WAAW,IAAI;AACpB,SAAO,EAAE,QAAQ,QAAQ;AACvB,SAAK,IAAI,OAAO,KAAK,CAAC;AAAA,EACxB;AACF;AAGA,SAAS,UAAU,MAAM,SAAS,UAAU,OAAO;AACnD,SAAS,UAAU,MAAM;AAEzB,IAAO,mBAAQ;;;AChBf,SAAS,UAAU,OAAO,WAAW;AACnC,MAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,UAAU,MAAM,KAAK,GAAG,OAAO,KAAK,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACdf,SAAS,SAAS,OAAO,KAAK;AAC5B,SAAO,MAAM,IAAI,GAAG;AACtB;AAEA,IAAO,mBAAQ;;;ACPf,IAAI,uBAAuB;AAA3B,IACI,yBAAyB;AAe7B,SAAS,YAAY,OAAO,OAAO,SAAS,YAAY,WAAW,OAAO;AACxE,MAAI,YAAY,UAAU,sBACtB,YAAY,MAAM,QAClB,YAAY,MAAM;AAEtB,MAAI,aAAa,aAAa,EAAE,aAAa,YAAY,YAAY;AACnE,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,MAAM,IAAI,KAAK;AAChC,MAAI,aAAa,MAAM,IAAI,KAAK;AAChC,MAAI,cAAc,YAAY;AAC5B,WAAO,cAAc,SAAS,cAAc;AAAA,EAC9C;AACA,MAAI,QAAQ,IACR,SAAS,MACT,OAAQ,UAAU,yBAA0B,IAAI,qBAAW;AAE/D,QAAM,IAAI,OAAO,KAAK;AACtB,QAAM,IAAI,OAAO,KAAK;AAGtB,SAAO,EAAE,QAAQ,WAAW;AAC1B,QAAI,WAAW,MAAM,KAAK,GACtB,WAAW,MAAM,KAAK;AAE1B,QAAI,YAAY;AACd,UAAI,WAAW,YACX,WAAW,UAAU,UAAU,OAAO,OAAO,OAAO,KAAK,IACzD,WAAW,UAAU,UAAU,OAAO,OAAO,OAAO,KAAK;AAAA,IAC/D;AACA,QAAI,aAAa,QAAW;AAC1B,UAAI,UAAU;AACZ;AAAA,MACF;AACA,eAAS;AACT;AAAA,IACF;AAEA,QAAI,MAAM;AACR,UAAI,CAAC,kBAAU,OAAO,SAASC,WAAU,UAAU;AAC7C,YAAI,CAAC,iBAAS,MAAM,QAAQ,MACvB,aAAaA,aAAY,UAAU,UAAUA,WAAU,SAAS,YAAY,KAAK,IAAI;AACxF,iBAAO,KAAK,KAAK,QAAQ;AAAA,QAC3B;AAAA,MACF,CAAC,GAAG;AACN,iBAAS;AACT;AAAA,MACF;AAAA,IACF,WAAW,EACL,aAAa,YACX,UAAU,UAAU,UAAU,SAAS,YAAY,KAAK,IACzD;AACL,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,QAAM,QAAQ,EAAE,KAAK;AACrB,QAAM,QAAQ,EAAE,KAAK;AACrB,SAAO;AACT;AAEA,IAAO,sBAAQ;;;AChFf,IAAIC,cAAa,aAAK;AAEtB,IAAO,qBAAQA;;;ACEf,SAAS,WAAWC,MAAK;AACvB,MAAI,QAAQ,IACR,SAAS,MAAMA,KAAI,IAAI;AAE3B,EAAAA,KAAI,QAAQ,SAAS,OAAO,KAAK;AAC/B,WAAO,EAAE,KAAK,IAAI,CAAC,KAAK,KAAK;AAAA,EAC/B,CAAC;AACD,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACVf,SAAS,WAAW,KAAK;AACvB,MAAI,QAAQ,IACR,SAAS,MAAM,IAAI,IAAI;AAE3B,MAAI,QAAQ,SAAS,OAAO;AAC1B,WAAO,EAAE,KAAK,IAAI;AAAA,EACpB,CAAC;AACD,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACTf,IAAIC,wBAAuB;AAA3B,IACIC,0BAAyB;AAG7B,IAAI,UAAU;AAAd,IACI,UAAU;AADd,IAEI,WAAW;AAFf,IAGI,SAAS;AAHb,IAII,YAAY;AAJhB,IAKI,YAAY;AALhB,IAMI,SAAS;AANb,IAOI,YAAY;AAPhB,IAQI,YAAY;AAEhB,IAAI,iBAAiB;AAArB,IACI,cAAc;AAGlB,IAAI,cAAc,iBAAS,eAAO,YAAY;AAA9C,IACI,gBAAgB,cAAc,YAAY,UAAU;AAmBxD,SAAS,WAAW,QAAQ,OAAO,KAAK,SAAS,YAAY,WAAW,OAAO;AAC7E,UAAQ,KAAK;AAAA,IACX,KAAK;AACH,UAAK,OAAO,cAAc,MAAM,cAC3B,OAAO,cAAc,MAAM,YAAa;AAC3C,eAAO;AAAA,MACT;AACA,eAAS,OAAO;AAChB,cAAQ,MAAM;AAAA,IAEhB,KAAK;AACH,UAAK,OAAO,cAAc,MAAM,cAC5B,CAAC,UAAU,IAAI,mBAAW,MAAM,GAAG,IAAI,mBAAW,KAAK,CAAC,GAAG;AAC7D,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IAET,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAGH,aAAO,WAAG,CAAC,QAAQ,CAAC,KAAK;AAAA,IAE3B,KAAK;AACH,aAAO,OAAO,QAAQ,MAAM,QAAQ,OAAO,WAAW,MAAM;AAAA,IAE9D,KAAK;AAAA,IACL,KAAK;AAIH,aAAO,UAAW,QAAQ;AAAA,IAE5B,KAAK;AACH,UAAI,UAAU;AAAA,IAEhB,KAAK;AACH,UAAI,YAAY,UAAUD;AAC1B,kBAAY,UAAU;AAEtB,UAAI,OAAO,QAAQ,MAAM,QAAQ,CAAC,WAAW;AAC3C,eAAO;AAAA,MACT;AAEA,UAAI,UAAU,MAAM,IAAI,MAAM;AAC9B,UAAI,SAAS;AACX,eAAO,WAAW;AAAA,MACpB;AACA,iBAAWC;AAGX,YAAM,IAAI,QAAQ,KAAK;AACvB,UAAI,SAAS,oBAAY,QAAQ,MAAM,GAAG,QAAQ,KAAK,GAAG,SAAS,YAAY,WAAW,KAAK;AAC/F,YAAM,QAAQ,EAAE,MAAM;AACtB,aAAO;AAAA,IAET,KAAK;AACH,UAAI,eAAe;AACjB,eAAO,cAAc,KAAK,MAAM,KAAK,cAAc,KAAK,KAAK;AAAA,MAC/D;AAAA,EACJ;AACA,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACvGf,SAAS,UAAU,OAAO,QAAQ;AAChC,MAAI,QAAQ,IACR,SAAS,OAAO,QAChB,SAAS,MAAM;AAEnB,SAAO,EAAE,QAAQ,QAAQ;AACvB,UAAM,SAAS,KAAK,IAAI,OAAO,KAAK;AAAA,EACtC;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACIf,IAAI,UAAU,MAAM;AAEpB,IAAO,kBAAQ;;;ACXf,SAAS,eAAe,QAAQ,UAAU,aAAa;AACrD,MAAI,SAAS,SAAS,MAAM;AAC5B,SAAO,gBAAQ,MAAM,IAAI,SAAS,kBAAU,QAAQ,YAAY,MAAM,CAAC;AACzE;AAEA,IAAO,yBAAQ;;;ACVf,SAAS,YAAY,OAAO,WAAW;AACrC,MAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,WAAW,GACX,SAAS,CAAC;AAEd,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,QAAQ,MAAM,KAAK;AACvB,QAAI,UAAU,OAAO,OAAO,KAAK,GAAG;AAClC,aAAO,UAAU,IAAI;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACNf,SAAS,YAAY;AACnB,SAAO,CAAC;AACV;AAEA,IAAO,oBAAQ;;;AClBf,IAAIC,eAAc,OAAO;AAGzB,IAAI,uBAAuBA,aAAY;AAGvC,IAAI,mBAAmB,OAAO;AAS9B,IAAI,aAAa,CAAC,mBAAmB,oBAAY,SAAS,QAAQ;AAChE,MAAI,UAAU,MAAM;AAClB,WAAO,CAAC;AAAA,EACV;AACA,WAAS,OAAO,MAAM;AACtB,SAAO,oBAAY,iBAAiB,MAAM,GAAG,SAAS,QAAQ;AAC5D,WAAO,qBAAqB,KAAK,QAAQ,MAAM;AAAA,EACjD,CAAC;AACH;AAEA,IAAO,qBAAQ;;;ACpBf,SAAS,UAAU,GAAG,UAAU;AAC9B,MAAI,QAAQ,IACR,SAAS,MAAM,CAAC;AAEpB,SAAO,EAAE,QAAQ,GAAG;AAClB,WAAO,KAAK,IAAI,SAAS,KAAK;AAAA,EAChC;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACKf,SAAS,aAAa,OAAO;AAC3B,SAAO,SAAS,QAAQ,OAAO,SAAS;AAC1C;AAEA,IAAO,uBAAQ;;;ACxBf,IAAI,UAAU;AASd,SAAS,gBAAgB,OAAO;AAC9B,SAAO,qBAAa,KAAK,KAAK,mBAAW,KAAK,KAAK;AACrD;AAEA,IAAO,0BAAQ;;;ACbf,IAAIC,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AAGjC,IAAIE,wBAAuBF,aAAY;AAoBvC,IAAI,cAAc,wBAAgB,4BAAW;AAAE,SAAO;AAAW,GAAE,CAAC,IAAI,0BAAkB,SAAS,OAAO;AACxG,SAAO,qBAAa,KAAK,KAAKC,gBAAe,KAAK,OAAO,QAAQ,KAC/D,CAACC,sBAAqB,KAAK,OAAO,QAAQ;AAC9C;AAEA,IAAO,sBAAQ;;;ACtBf,SAAS,YAAY;AACnB,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACbf,IAAI,cAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY;AAGhF,IAAI,aAAa,eAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY;AAG3F,IAAI,gBAAgB,cAAc,WAAW,YAAY;AAGzD,IAAIC,UAAS,gBAAgB,aAAK,SAAS;AAG3C,IAAI,iBAAiBA,UAASA,QAAO,WAAW;AAmBhD,IAAI,WAAW,kBAAkB;AAEjC,IAAO,mBAAQ;;;ACpCf,IAAI,mBAAmB;AAGvB,IAAI,WAAW;AAUf,SAAS,QAAQ,OAAO,QAAQ;AAC9B,MAAI,OAAO,OAAO;AAClB,WAAS,UAAU,OAAO,mBAAmB;AAE7C,SAAO,CAAC,CAAC,WACN,QAAQ,YACN,QAAQ,YAAY,SAAS,KAAK,KAAK,OACrC,QAAQ,MAAM,QAAQ,KAAK,KAAK,QAAQ;AACjD;AAEA,IAAO,kBAAQ;;;ACvBf,IAAIC,oBAAmB;AA4BvB,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,SAAS,YACrB,QAAQ,MAAM,QAAQ,KAAK,KAAK,SAASA;AAC7C;AAEA,IAAO,mBAAQ;;;AC7Bf,IAAIC,WAAU;AAAd,IACI,WAAW;AADf,IAEIC,WAAU;AAFd,IAGIC,WAAU;AAHd,IAIIC,YAAW;AAJf,IAKIC,WAAU;AALd,IAMIC,UAAS;AANb,IAOIC,aAAY;AAPhB,IAQI,YAAY;AARhB,IASIC,aAAY;AAThB,IAUIC,UAAS;AAVb,IAWIC,aAAY;AAXhB,IAYI,aAAa;AAEjB,IAAIC,kBAAiB;AAArB,IACIC,eAAc;AADlB,IAEI,aAAa;AAFjB,IAGI,aAAa;AAHjB,IAII,UAAU;AAJd,IAKI,WAAW;AALf,IAMI,WAAW;AANf,IAOI,WAAW;AAPf,IAQI,kBAAkB;AARtB,IASI,YAAY;AAThB,IAUI,YAAY;AAGhB,IAAI,iBAAiB,CAAC;AACtB,eAAe,UAAU,IAAI,eAAe,UAAU,IACtD,eAAe,OAAO,IAAI,eAAe,QAAQ,IACjD,eAAe,QAAQ,IAAI,eAAe,QAAQ,IAClD,eAAe,eAAe,IAAI,eAAe,SAAS,IAC1D,eAAe,SAAS,IAAI;AAC5B,eAAeX,QAAO,IAAI,eAAe,QAAQ,IACjD,eAAeU,eAAc,IAAI,eAAeT,QAAO,IACvD,eAAeU,YAAW,IAAI,eAAeT,QAAO,IACpD,eAAeC,SAAQ,IAAI,eAAeC,QAAO,IACjD,eAAeC,OAAM,IAAI,eAAeC,UAAS,IACjD,eAAe,SAAS,IAAI,eAAeC,UAAS,IACpD,eAAeC,OAAM,IAAI,eAAeC,UAAS,IACjD,eAAe,UAAU,IAAI;AAS7B,SAAS,iBAAiB,OAAO;AAC/B,SAAO,qBAAa,KAAK,KACvB,iBAAS,MAAM,MAAM,KAAK,CAAC,CAAC,eAAe,mBAAW,KAAK,CAAC;AAChE;AAEA,IAAO,2BAAQ;;;ACpDf,SAAS,UAAU,MAAM;AACvB,SAAO,SAAS,OAAO;AACrB,WAAO,KAAK,KAAK;AAAA,EACnB;AACF;AAEA,IAAO,oBAAQ;;;ACVf,IAAIG,eAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY;AAGhF,IAAIC,cAAaD,gBAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY;AAG3F,IAAIE,iBAAgBD,eAAcA,YAAW,YAAYD;AAGzD,IAAI,cAAcE,kBAAiB,mBAAW;AAG9C,IAAI,YAAY,WAAW;AACzB,MAAI;AAEF,QAAI,QAAQD,eAAcA,YAAW,WAAWA,YAAW,QAAQ,MAAM,EAAE;AAE3E,QAAI,OAAO;AACT,aAAO;AAAA,IACT;AAGA,WAAO,eAAe,YAAY,WAAW,YAAY,QAAQ,MAAM;AAAA,EACzE,SAAS,GAAG;AAAA,EAAC;AACf,GAAE;AAEF,IAAO,mBAAQ;;;ACxBf,IAAI,mBAAmB,oBAAY,iBAAS;AAmB5C,IAAI,eAAe,mBAAmB,kBAAU,gBAAgB,IAAI;AAEpE,IAAO,uBAAQ;;;AClBf,IAAIE,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AAUjC,SAAS,cAAc,OAAO,WAAW;AACvC,MAAI,QAAQ,gBAAQ,KAAK,GACrB,QAAQ,CAAC,SAAS,oBAAY,KAAK,GACnC,SAAS,CAAC,SAAS,CAAC,SAAS,iBAAS,KAAK,GAC3CE,UAAS,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,qBAAa,KAAK,GAC1D,cAAc,SAAS,SAAS,UAAUA,SAC1C,SAAS,cAAc,kBAAU,MAAM,QAAQ,MAAM,IAAI,CAAC,GAC1D,SAAS,OAAO;AAEpB,WAAS,OAAO,OAAO;AACrB,SAAK,aAAaD,gBAAe,KAAK,OAAO,GAAG,MAC5C,EAAE;AAAA,KAEC,OAAO;AAAA,IAEN,WAAW,OAAO,YAAY,OAAO;AAAA,IAErCC,YAAW,OAAO,YAAY,OAAO,gBAAgB,OAAO;AAAA,IAE7D,gBAAQ,KAAK,MAAM,KAClB;AACN,aAAO,KAAK,GAAG;AAAA,IACjB;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,wBAAQ;;;AC/Cf,IAAIC,eAAc,OAAO;AASzB,SAAS,YAAY,OAAO;AAC1B,MAAI,OAAO,SAAS,MAAM,aACtB,QAAS,OAAO,QAAQ,cAAc,KAAK,aAAcA;AAE7D,SAAO,UAAU;AACnB;AAEA,IAAO,sBAAQ;;;ACTf,SAAS,QAAQ,MAAM,WAAW;AAChC,SAAO,SAAS,KAAK;AACnB,WAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5B;AACF;AAEA,IAAO,kBAAQ;;;ACXf,IAAI,aAAa,gBAAQ,OAAO,MAAM,MAAM;AAE5C,IAAO,qBAAQ;;;ACDf,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,kBAAiBD,cAAY;AASjC,SAAS,SAAS,QAAQ;AACxB,MAAI,CAAC,oBAAY,MAAM,GAAG;AACxB,WAAO,mBAAW,MAAM;AAAA,EAC1B;AACA,MAAI,SAAS,CAAC;AACd,WAAS,OAAO,OAAO,MAAM,GAAG;AAC9B,QAAIC,gBAAe,KAAK,QAAQ,GAAG,KAAK,OAAO,eAAe;AAC5D,aAAO,KAAK,GAAG;AAAA,IACjB;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACDf,SAAS,YAAY,OAAO;AAC1B,SAAO,SAAS,QAAQ,iBAAS,MAAM,MAAM,KAAK,CAAC,mBAAW,KAAK;AACrE;AAEA,IAAO,sBAAQ;;;ACAf,SAAS,KAAK,QAAQ;AACpB,SAAO,oBAAY,MAAM,IAAI,sBAAc,MAAM,IAAI,iBAAS,MAAM;AACtE;AAEA,IAAO,eAAQ;;;ACzBf,SAAS,WAAW,QAAQ;AAC1B,SAAO,uBAAe,QAAQ,cAAM,kBAAU;AAChD;AAEA,IAAO,qBAAQ;;;ACZf,IAAIC,wBAAuB;AAG3B,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,kBAAiBD,cAAY;AAejC,SAAS,aAAa,QAAQ,OAAO,SAAS,YAAY,WAAW,OAAO;AAC1E,MAAI,YAAY,UAAUD,uBACtB,WAAW,mBAAW,MAAM,GAC5B,YAAY,SAAS,QACrB,WAAW,mBAAW,KAAK,GAC3B,YAAY,SAAS;AAEzB,MAAI,aAAa,aAAa,CAAC,WAAW;AACxC,WAAO;AAAA,EACT;AACA,MAAI,QAAQ;AACZ,SAAO,SAAS;AACd,QAAI,MAAM,SAAS,KAAK;AACxB,QAAI,EAAE,YAAY,OAAO,QAAQE,gBAAe,KAAK,OAAO,GAAG,IAAI;AACjE,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,aAAa,MAAM,IAAI,MAAM;AACjC,MAAI,aAAa,MAAM,IAAI,KAAK;AAChC,MAAI,cAAc,YAAY;AAC5B,WAAO,cAAc,SAAS,cAAc;AAAA,EAC9C;AACA,MAAI,SAAS;AACb,QAAM,IAAI,QAAQ,KAAK;AACvB,QAAM,IAAI,OAAO,MAAM;AAEvB,MAAI,WAAW;AACf,SAAO,EAAE,QAAQ,WAAW;AAC1B,UAAM,SAAS,KAAK;AACpB,QAAI,WAAW,OAAO,GAAG,GACrB,WAAW,MAAM,GAAG;AAExB,QAAI,YAAY;AACd,UAAI,WAAW,YACX,WAAW,UAAU,UAAU,KAAK,OAAO,QAAQ,KAAK,IACxD,WAAW,UAAU,UAAU,KAAK,QAAQ,OAAO,KAAK;AAAA,IAC9D;AAEA,QAAI,EAAE,aAAa,SACV,aAAa,YAAY,UAAU,UAAU,UAAU,SAAS,YAAY,KAAK,IAClF,WACD;AACL,eAAS;AACT;AAAA,IACF;AACA,iBAAa,WAAW,OAAO;AAAA,EACjC;AACA,MAAI,UAAU,CAAC,UAAU;AACvB,QAAI,UAAU,OAAO,aACjB,UAAU,MAAM;AAGpB,QAAI,WAAW,YACV,iBAAiB,UAAU,iBAAiB,UAC7C,EAAE,OAAO,WAAW,cAAc,mBAAmB,WACnD,OAAO,WAAW,cAAc,mBAAmB,UAAU;AACjE,eAAS;AAAA,IACX;AAAA,EACF;AACA,QAAM,QAAQ,EAAE,MAAM;AACtB,QAAM,QAAQ,EAAE,KAAK;AACrB,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACrFf,IAAI,WAAW,kBAAU,cAAM,UAAU;AAEzC,IAAO,mBAAQ;;;ACFf,IAAIC,WAAU,kBAAU,cAAM,SAAS;AAEvC,IAAO,kBAAQA;;;ACFf,IAAIC,OAAM,kBAAU,cAAM,KAAK;AAE/B,IAAO,cAAQA;;;ACFf,IAAI,UAAU,kBAAU,cAAM,SAAS;AAEvC,IAAO,kBAAQ;;;ACGf,IAAIC,UAAS;AAAb,IACIC,aAAY;AADhB,IAEI,aAAa;AAFjB,IAGIC,UAAS;AAHb,IAIIC,cAAa;AAEjB,IAAIC,eAAc;AAGlB,IAAI,qBAAqB,iBAAS,gBAAQ;AAA1C,IACI,gBAAgB,iBAAS,WAAG;AADhC,IAEI,oBAAoB,iBAAS,eAAO;AAFxC,IAGI,gBAAgB,iBAAS,WAAG;AAHhC,IAII,oBAAoB,iBAAS,eAAO;AASxC,IAAI,SAAS;AAGb,IAAK,oBAAY,OAAO,IAAI,iBAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAKA,gBACxD,eAAO,OAAO,IAAI,aAAG,KAAKJ,WAC1B,mBAAW,OAAO,gBAAQ,QAAQ,CAAC,KAAK,cACxC,eAAO,OAAO,IAAI,aAAG,KAAKE,WAC1B,mBAAW,OAAO,IAAI,iBAAO,KAAKC,aAAa;AAClD,WAAS,SAAS,OAAO;AACvB,QAAI,SAAS,mBAAW,KAAK,GACzB,OAAO,UAAUF,aAAY,MAAM,cAAc,QACjD,aAAa,OAAO,iBAAS,IAAI,IAAI;AAEzC,QAAI,YAAY;AACd,cAAQ,YAAY;AAAA,QAClB,KAAK;AAAoB,iBAAOG;AAAA,QAChC,KAAK;AAAe,iBAAOJ;AAAA,QAC3B,KAAK;AAAmB,iBAAO;AAAA,QAC/B,KAAK;AAAe,iBAAOE;AAAA,QAC3B,KAAK;AAAmB,iBAAOC;AAAA,MACjC;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAEA,IAAO,iBAAQ;;;AC/Cf,IAAIE,wBAAuB;AAG3B,IAAIC,WAAU;AAAd,IACIC,YAAW;AADf,IAEIC,aAAY;AAGhB,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,kBAAiBD,cAAY;AAgBjC,SAAS,gBAAgB,QAAQ,OAAO,SAAS,YAAY,WAAW,OAAO;AAC7E,MAAI,WAAW,gBAAQ,MAAM,GACzB,WAAW,gBAAQ,KAAK,GACxB,SAAS,WAAWF,YAAW,eAAO,MAAM,GAC5C,SAAS,WAAWA,YAAW,eAAO,KAAK;AAE/C,WAAS,UAAUD,WAAUE,aAAY;AACzC,WAAS,UAAUF,WAAUE,aAAY;AAEzC,MAAI,WAAW,UAAUA,YACrB,WAAW,UAAUA,YACrB,YAAY,UAAU;AAE1B,MAAI,aAAa,iBAAS,MAAM,GAAG;AACjC,QAAI,CAAC,iBAAS,KAAK,GAAG;AACpB,aAAO;AAAA,IACT;AACA,eAAW;AACX,eAAW;AAAA,EACb;AACA,MAAI,aAAa,CAAC,UAAU;AAC1B,cAAU,QAAQ,IAAI;AACtB,WAAQ,YAAY,qBAAa,MAAM,IACnC,oBAAY,QAAQ,OAAO,SAAS,YAAY,WAAW,KAAK,IAChE,mBAAW,QAAQ,OAAO,QAAQ,SAAS,YAAY,WAAW,KAAK;AAAA,EAC7E;AACA,MAAI,EAAE,UAAUH,wBAAuB;AACrC,QAAI,eAAe,YAAYK,gBAAe,KAAK,QAAQ,aAAa,GACpE,eAAe,YAAYA,gBAAe,KAAK,OAAO,aAAa;AAEvE,QAAI,gBAAgB,cAAc;AAChC,UAAI,eAAe,eAAe,OAAO,MAAM,IAAI,QAC/C,eAAe,eAAe,MAAM,MAAM,IAAI;AAElD,gBAAU,QAAQ,IAAI;AACtB,aAAO,UAAU,cAAc,cAAc,SAAS,YAAY,KAAK;AAAA,IACzE;AAAA,EACF;AACA,MAAI,CAAC,WAAW;AACd,WAAO;AAAA,EACT;AACA,YAAU,QAAQ,IAAI;AACtB,SAAO,qBAAa,QAAQ,OAAO,SAAS,YAAY,WAAW,KAAK;AAC1E;AAEA,IAAO,0BAAQ;;;ACjEf,SAAS,YAAY,OAAO,OAAO,SAAS,YAAY,OAAO;AAC7D,MAAI,UAAU,OAAO;AACnB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,QAAQ,SAAS,QAAS,CAAC,qBAAa,KAAK,KAAK,CAAC,qBAAa,KAAK,GAAI;AACpF,WAAO,UAAU,SAAS,UAAU;AAAA,EACtC;AACA,SAAO,wBAAgB,OAAO,OAAO,SAAS,YAAY,aAAa,KAAK;AAC9E;AAEA,IAAO,sBAAQ;;;ACvBf,IAAIC,wBAAuB;AAA3B,IACIC,0BAAyB;AAY7B,SAAS,YAAY,QAAQ,QAAQ,WAAW,YAAY;AAC1D,MAAI,QAAQ,UAAU,QAClB,SAAS,OACT,eAAe,CAAC;AAEpB,MAAI,UAAU,MAAM;AAClB,WAAO,CAAC;AAAA,EACV;AACA,WAAS,OAAO,MAAM;AACtB,SAAO,SAAS;AACd,QAAI,OAAO,UAAU,KAAK;AAC1B,QAAK,gBAAgB,KAAK,CAAC,IACnB,KAAK,CAAC,MAAM,OAAO,KAAK,CAAC,CAAC,IAC1B,EAAE,KAAK,CAAC,KAAK,SACf;AACJ,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,EAAE,QAAQ,QAAQ;AACvB,WAAO,UAAU,KAAK;AACtB,QAAI,MAAM,KAAK,CAAC,GACZ,WAAW,OAAO,GAAG,GACrB,WAAW,KAAK,CAAC;AAErB,QAAI,gBAAgB,KAAK,CAAC,GAAG;AAC3B,UAAI,aAAa,UAAa,EAAE,OAAO,SAAS;AAC9C,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AACL,UAAI,QAAQ,IAAI;AAChB,UAAI,YAAY;AACd,YAAI,SAAS,WAAW,UAAU,UAAU,KAAK,QAAQ,QAAQ,KAAK;AAAA,MACxE;AACA,UAAI,EAAE,WAAW,SACT,oBAAY,UAAU,UAAUD,wBAAuBC,yBAAwB,YAAY,KAAK,IAChG,SACD;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACnDf,SAAS,mBAAmB,OAAO;AACjC,SAAO,UAAU,SAAS,CAAC,iBAAS,KAAK;AAC3C;AAEA,IAAO,6BAAQ;;;ACJf,SAAS,aAAa,QAAQ;AAC5B,MAAI,SAAS,aAAK,MAAM,GACpB,SAAS,OAAO;AAEpB,SAAO,UAAU;AACf,QAAI,MAAM,OAAO,MAAM,GACnB,QAAQ,OAAO,GAAG;AAEtB,WAAO,MAAM,IAAI,CAAC,KAAK,OAAO,2BAAmB,KAAK,CAAC;AAAA,EACzD;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACdf,SAAS,wBAAwB,KAAK,UAAU;AAC9C,SAAO,SAAS,QAAQ;AACtB,QAAI,UAAU,MAAM;AAClB,aAAO;AAAA,IACT;AACA,WAAO,OAAO,GAAG,MAAM,aACpB,aAAa,UAAc,OAAO,OAAO,MAAM;AAAA,EACpD;AACF;AAEA,IAAO,kCAAQ;;;ACRf,SAAS,YAAY,QAAQ;AAC3B,MAAI,YAAY,qBAAa,MAAM;AACnC,MAAI,UAAU,UAAU,KAAK,UAAU,CAAC,EAAE,CAAC,GAAG;AAC5C,WAAO,gCAAwB,UAAU,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;AAAA,EACjE;AACA,SAAO,SAAS,QAAQ;AACtB,WAAO,WAAW,UAAU,oBAAY,QAAQ,QAAQ,SAAS;AAAA,EACnE;AACF;AAEA,IAAO,sBAAQ;;;ACjBf,IAAIC,aAAY;AAmBhB,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,SAAS,YACpB,qBAAa,KAAK,KAAK,mBAAW,KAAK,KAAKA;AACjD;AAEA,IAAO,mBAAQ;;;ACxBf,IAAI,eAAe;AAAnB,IACI,gBAAgB;AAUpB,SAAS,MAAM,OAAO,QAAQ;AAC5B,MAAI,gBAAQ,KAAK,GAAG;AAClB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,OAAO;AAClB,MAAI,QAAQ,YAAY,QAAQ,YAAY,QAAQ,aAChD,SAAS,QAAQ,iBAAS,KAAK,GAAG;AACpC,WAAO;AAAA,EACT;AACA,SAAO,cAAc,KAAK,KAAK,KAAK,CAAC,aAAa,KAAK,KAAK,KACzD,UAAU,QAAQ,SAAS,OAAO,MAAM;AAC7C;AAEA,IAAO,gBAAQ;;;ACzBf,IAAI,kBAAkB;AA8CtB,SAAS,QAAQ,MAAM,UAAU;AAC/B,MAAI,OAAO,QAAQ,cAAe,YAAY,QAAQ,OAAO,YAAY,YAAa;AACpF,UAAM,IAAI,UAAU,eAAe;AAAA,EACrC;AACA,MAAI,WAAW,WAAW;AACxB,QAAI,OAAO,WACP,MAAM,WAAW,SAAS,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC,GACpD,QAAQ,SAAS;AAErB,QAAI,MAAM,IAAI,GAAG,GAAG;AAClB,aAAO,MAAM,IAAI,GAAG;AAAA,IACtB;AACA,QAAI,SAAS,KAAK,MAAM,MAAM,IAAI;AAClC,aAAS,QAAQ,MAAM,IAAI,KAAK,MAAM,KAAK;AAC3C,WAAO;AAAA,EACT;AACA,WAAS,QAAQ,KAAK,QAAQ,SAAS;AACvC,SAAO;AACT;AAGA,QAAQ,QAAQ;AAEhB,IAAO,kBAAQ;;;ACrEf,IAAI,mBAAmB;AAUvB,SAAS,cAAc,MAAM;AAC3B,MAAI,SAAS,gBAAQ,MAAM,SAAS,KAAK;AACvC,QAAI,MAAM,SAAS,kBAAkB;AACnC,YAAM,MAAM;AAAA,IACd;AACA,WAAO;AAAA,EACT,CAAC;AAED,MAAI,QAAQ,OAAO;AACnB,SAAO;AACT;AAEA,IAAO,wBAAQ;;;ACtBf,IAAI,aAAa;AAGjB,IAAI,eAAe;AASnB,IAAI,eAAe,sBAAc,SAAS,QAAQ;AAChD,MAAI,SAAS,CAAC;AACd,MAAI,OAAO,WAAW,CAAC,MAAM,IAAY;AACvC,WAAO,KAAK,EAAE;AAAA,EAChB;AACA,SAAO,QAAQ,YAAY,SAAS,OAAO,QAAQ,OAAO,WAAW;AACnE,WAAO,KAAK,QAAQ,UAAU,QAAQ,cAAc,IAAI,IAAK,UAAU,KAAM;AAAA,EAC/E,CAAC;AACD,SAAO;AACT,CAAC;AAED,IAAO,uBAAQ;;;ACpBf,IAAI,WAAW,IAAI;AAGnB,IAAIC,eAAc,iBAAS,eAAO,YAAY;AAA9C,IACI,iBAAiBA,eAAcA,aAAY,WAAW;AAU1D,SAAS,aAAa,OAAO;AAE3B,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,gBAAQ,KAAK,GAAG;AAElB,WAAO,iBAAS,OAAO,YAAY,IAAI;AAAA,EACzC;AACA,MAAI,iBAAS,KAAK,GAAG;AACnB,WAAO,iBAAiB,eAAe,KAAK,KAAK,IAAI;AAAA,EACvD;AACA,MAAI,SAAU,QAAQ;AACtB,SAAQ,UAAU,OAAQ,IAAI,SAAU,CAAC,WAAY,OAAO;AAC9D;AAEA,IAAO,uBAAQ;;;ACbf,SAASC,UAAS,OAAO;AACvB,SAAO,SAAS,OAAO,KAAK,qBAAa,KAAK;AAChD;AAEA,IAAO,mBAAQA;;;ACdf,SAAS,SAAS,OAAO,QAAQ;AAC/B,MAAI,gBAAQ,KAAK,GAAG;AAClB,WAAO;AAAA,EACT;AACA,SAAO,cAAM,OAAO,MAAM,IAAI,CAAC,KAAK,IAAI,qBAAa,iBAAS,KAAK,CAAC;AACtE;AAEA,IAAO,mBAAQ;;;ACjBf,IAAIC,YAAW,IAAI;AASnB,SAAS,MAAM,OAAO;AACpB,MAAI,OAAO,SAAS,YAAY,iBAAS,KAAK,GAAG;AAC/C,WAAO;AAAA,EACT;AACA,MAAI,SAAU,QAAQ;AACtB,SAAQ,UAAU,OAAQ,IAAI,SAAU,CAACA,YAAY,OAAO;AAC9D;AAEA,IAAO,gBAAQ;;;ACTf,SAAS,QAAQ,QAAQ,MAAM;AAC7B,SAAO,iBAAS,MAAM,MAAM;AAE5B,MAAI,QAAQ,GACR,SAAS,KAAK;AAElB,SAAO,UAAU,QAAQ,QAAQ,QAAQ;AACvC,aAAS,OAAO,cAAM,KAAK,OAAO,CAAC,CAAC;AAAA,EACtC;AACA,SAAQ,SAAS,SAAS,SAAU,SAAS;AAC/C;AAEA,IAAO,kBAAQ;;;ACIf,SAAS,IAAI,QAAQ,MAAM,cAAc;AACvC,MAAI,SAAS,UAAU,OAAO,SAAY,gBAAQ,QAAQ,IAAI;AAC9D,SAAO,WAAW,SAAY,eAAe;AAC/C;AAEA,IAAO,cAAQ;;;ACxBf,SAAS,UAAU,QAAQ,KAAK;AAC9B,SAAO,UAAU,QAAQ,OAAO,OAAO,MAAM;AAC/C;AAEA,IAAO,oBAAQ;;;ACIf,SAAS,QAAQ,QAAQ,MAAM,SAAS;AACtC,SAAO,iBAAS,MAAM,MAAM;AAE5B,MAAI,QAAQ,IACR,SAAS,KAAK,QACd,SAAS;AAEb,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,MAAM,cAAM,KAAK,KAAK,CAAC;AAC3B,QAAI,EAAE,SAAS,UAAU,QAAQ,QAAQ,QAAQ,GAAG,IAAI;AACtD;AAAA,IACF;AACA,aAAS,OAAO,GAAG;AAAA,EACrB;AACA,MAAI,UAAU,EAAE,SAAS,QAAQ;AAC/B,WAAO;AAAA,EACT;AACA,WAAS,UAAU,OAAO,IAAI,OAAO;AACrC,SAAO,CAAC,CAAC,UAAU,iBAAS,MAAM,KAAK,gBAAQ,KAAK,MAAM,MACvD,gBAAQ,MAAM,KAAK,oBAAY,MAAM;AAC1C;AAEA,IAAO,kBAAQ;;;ACTf,SAAS,MAAM,QAAQ,MAAM;AAC3B,SAAO,UAAU,QAAQ,gBAAQ,QAAQ,MAAM,iBAAS;AAC1D;AAEA,IAAO,gBAAQ;;;ACxBf,IAAIC,wBAAuB;AAA3B,IACIC,0BAAyB;AAU7B,SAAS,oBAAoB,MAAM,UAAU;AAC3C,MAAI,cAAM,IAAI,KAAK,2BAAmB,QAAQ,GAAG;AAC/C,WAAO,gCAAwB,cAAM,IAAI,GAAG,QAAQ;AAAA,EACtD;AACA,SAAO,SAAS,QAAQ;AACtB,QAAI,WAAW,YAAI,QAAQ,IAAI;AAC/B,WAAQ,aAAa,UAAa,aAAa,WAC3C,cAAM,QAAQ,IAAI,IAClB,oBAAY,UAAU,UAAUD,wBAAuBC,uBAAsB;AAAA,EACnF;AACF;AAEA,IAAO,8BAAQ;;;AChBf,SAAS,SAAS,OAAO;AACvB,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACbf,SAAS,aAAa,KAAK;AACzB,SAAO,SAAS,QAAQ;AACtB,WAAO,UAAU,OAAO,SAAY,OAAO,GAAG;AAAA,EAChD;AACF;AAEA,IAAO,uBAAQ;;;ACJf,SAAS,iBAAiB,MAAM;AAC9B,SAAO,SAAS,QAAQ;AACtB,WAAO,gBAAQ,QAAQ,IAAI;AAAA,EAC7B;AACF;AAEA,IAAO,2BAAQ;;;ACYf,SAAS,SAAS,MAAM;AACtB,SAAO,cAAM,IAAI,IAAI,qBAAa,cAAM,IAAI,CAAC,IAAI,yBAAiB,IAAI;AACxE;AAEA,IAAO,mBAAQ;;;AClBf,SAAS,aAAa,OAAO;AAG3B,MAAI,OAAO,SAAS,YAAY;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,SAAS,MAAM;AACjB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,gBAAQ,KAAK,IAChB,4BAAoB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,IACtC,oBAAY,KAAK;AAAA,EACvB;AACA,SAAO,iBAAS,KAAK;AACvB;AAEA,IAAO,uBAAQ;;;ACvBf,SAAS,cAAc,WAAW;AAChC,SAAO,SAAS,QAAQ,UAAU,UAAU;AAC1C,QAAI,QAAQ,IACR,WAAW,OAAO,MAAM,GACxB,QAAQ,SAAS,MAAM,GACvB,SAAS,MAAM;AAEnB,WAAO,UAAU;AACf,UAAI,MAAM,MAAM,YAAY,SAAS,EAAE,KAAK;AAC5C,UAAI,SAAS,SAAS,GAAG,GAAG,KAAK,QAAQ,MAAM,OAAO;AACpD;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAEA,IAAO,wBAAQ;;;ACXf,IAAI,UAAU,sBAAc;AAE5B,IAAO,kBAAQ;;;ACJf,SAAS,WAAW,QAAQ,UAAU;AACpC,SAAO,UAAU,gBAAQ,QAAQ,UAAU,YAAI;AACjD;AAEA,IAAO,qBAAQ;;;ACLf,SAAS,eAAe,UAAU,WAAW;AAC3C,SAAO,SAAS,YAAY,UAAU;AACpC,QAAI,cAAc,MAAM;AACtB,aAAO;AAAA,IACT;AACA,QAAI,CAAC,oBAAY,UAAU,GAAG;AAC5B,aAAO,SAAS,YAAY,QAAQ;AAAA,IACtC;AACA,QAAI,SAAS,WAAW,QACpB,QAAQ,YAAY,SAAS,IAC7B,WAAW,OAAO,UAAU;AAEhC,WAAQ,YAAY,UAAU,EAAE,QAAQ,QAAS;AAC/C,UAAI,SAAS,SAAS,KAAK,GAAG,OAAO,QAAQ,MAAM,OAAO;AACxD;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAEA,IAAO,yBAAQ;;;ACpBf,IAAI,WAAW,uBAAe,kBAAU;AAExC,IAAO,mBAAQ;;;ACFf,SAAS,QAAQ,YAAY,UAAU;AACrC,MAAI,QAAQ,IACR,SAAS,oBAAY,UAAU,IAAI,MAAM,WAAW,MAAM,IAAI,CAAC;AAEnE,mBAAS,YAAY,SAAS,OAAO,KAAKC,aAAY;AACpD,WAAO,EAAE,KAAK,IAAI,SAAS,OAAO,KAAKA,WAAU;AAAA,EACnD,CAAC;AACD,SAAO;AACT;AAEA,IAAO,kBAAQ;;;AC0Bf,SAAS,IAAI,YAAY,UAAU;AACjC,MAAI,OAAO,gBAAQ,UAAU,IAAI,mBAAW;AAC5C,SAAO,KAAK,YAAY,qBAAa,UAAU,CAAC,CAAC;AACnD;AAEA,IAAO,cAAQ;;;AC1Cf,SAAS,WAAW,YAAY,WAAW;AACzC,MAAI,SAAS,CAAC;AACd,mBAAS,YAAY,SAAS,OAAO,OAAOC,aAAY;AACtD,QAAI,UAAU,OAAO,OAAOA,WAAU,GAAG;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,IAAO,qBAAQ;;;AC0Bf,SAAS,OAAO,YAAY,WAAW;AACrC,MAAI,OAAO,gBAAQ,UAAU,IAAI,sBAAc;AAC/C,SAAO,KAAK,YAAY,qBAAa,WAAW,CAAC,CAAC;AACpD;AAEA,IAAO,iBAAQ;;;AC1BT,SAAU,YAAY,MAAY,MAA+B,YAAkB;AACrF,SAAO,GAAG,KAAK,IAAI,IAAI,IAAI,IAAI,UAAU;AAC7C;AAWO,IAAM,YAAY;AAClB,IAAM,iBAAiB;AACvB,IAAM,uBAAuB;AAC7B,IAAM,uBAAuB;AAG7B,IAAM,gBAAgB;AACtB,IAAM,gBAAgB;AACtB,IAAM,qBAAqB;AAC3B,IAAM,sBAAsB;AAC5B,IAAM,qBAAqB;AAC3B,IAAM,eAAe;AAuFtB,IAAgB,qBAAhB,MAAkC;EAGpC,YAAY,QAAgB;AACxB,SAAK,SAAS;EAClB;EAEA,YAAS;AACL,WAAO;EACX;;AAGE,IAAO,iBAAP,cAA8B,mBAAkB;EAGlD,YAAY,QAAkB,WAAoB;AAC9C,UAAM,MAAM;AACZ,SAAK,YAAY;EACrB;;AAGE,IAAO,oBAAP,cAAiC,mBAAkB;EACrD,YAAY,QAAgB;AACxB,UAAM,MAAM;EAChB;EAEA,YAAS;AACL,WAAO;EACX;;AAGE,IAAO,iBAAP,cAA8B,mBAAkB;EAIlD,YAAY,WAA2B,MAAY,aAAqB;AACpE,UAAM,SAAS;AACf,SAAK,OAAO;AACZ,SAAK,cAAc;EACvB;EAEA,YAAS;AACL,WAAO;EACX;;AAQE,SAAU,UAAU,OAAa;AACnC,QAAM,MAAW;IACb,aAAa,CAAA;IACb,gBAAgB,CAAA;IAChB,kBAAkB,oBAAI,IAAG;IACzB,iBAAiB,oBAAI,IAAG;IACxB,QAAQ,CAAA;;AAEZ,kCAAgC,KAAK,KAAK;AAC1C,QAAM,aAAa,MAAM;AACzB,WAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACjC,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,YAAY,MAAM,KAAK,MAAM,IAAI;AACvC,QAAI,cAAc,QAAW;AACzB;IACJ;AACA,oBAAgB,KAAK,MAAM,SAAS;EACxC;AACA,SAAO;AACX;AAEA,SAAS,gCAAgC,KAAU,OAAa;AAC5D,QAAM,aAAa,MAAM;AACzB,WAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACjC,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,QAAQ,SAAyB,KAAK,MAAM,QAAW;MACzD,MAAM;KACT;AACD,UAAM,OAAO,SAAwB,KAAK,MAAM,QAAW;MACvD,MAAM;KACT;AACD,UAAM,OAAO;AACb,QAAI,iBAAiB,IAAI,MAAM,KAAK;AACpC,QAAI,gBAAgB,IAAI,MAAM,IAAI;EACtC;AACJ;AAEA,SAAS,KACL,KACA,MACA,YAAuB;AAEvB,MAAI,sBAAsB,UAAU;AAChC,WAAO,SAAS,KAAK,MAAM,WAAW,cAAc,UAAU;EAClE,WAAW,sBAAsB,aAAa;AAC1C,WAAO,QAAQ,KAAK,MAAM,UAAU;EACxC,WAAW,sBAAsB,aAAa;AAC1C,WAAO,YAAY,KAAK,MAAM,UAAU;EAC5C,WAAW,sBAAsB,QAAQ;AACrC,WAAO,OAAO,KAAK,MAAM,UAAU;EACvC,WAAW,sBAAsB,YAAY;AACzC,WAAO,WAAW,KAAK,MAAM,UAAU;EAC3C,WAAW,sBAAsB,yBAAyB;AACtD,WAAO,cAAc,KAAK,MAAM,UAAU;EAC9C,WAAW,sBAAsB,qBAAqB;AAClD,WAAO,oBAAoB,KAAK,MAAM,UAAU;EACpD,WAAW,sBAAsB,kCAAkC;AAC/D,WAAO,uBAAuB,KAAK,MAAM,UAAU;EACvD,OAAO;AACH,WAAO,MAAM,KAAK,MAAM,UAAyB;EACrD;AACJ;AAEA,SAAS,WAAW,KAAU,MAAYC,aAAsB;AAC5D,QAAM,YAAY,SAA8B,KAAK,MAAMA,aAAY;IACnE,MAAM;GACT;AACD,sBAAoB,KAAK,SAAS;AAClC,QAAM,SAAS,SACX,KACA,MACA,WACAA,aACA,MAAM,KAAK,MAAMA,WAAU,CAAC;AAEhC,SAAO,KAAK,KAAK,MAAMA,aAAY,MAAM;AAC7C;AAEA,SAAS,cACL,KACA,MACAA,aAAmC;AAEnC,QAAM,YAAY,SAA8B,KAAK,MAAMA,aAAY;IACnE,MAAM;GACT;AACD,sBAAoB,KAAK,SAAS;AAClC,QAAM,SAAS,SACX,KACA,MACA,WACAA,aACA,MAAM,KAAK,MAAMA,WAAU,CAAC;AAEhC,QAAM,MAAM,SAAS,KAAK,MAAMA,YAAW,WAAWA,WAAU;AAChE,SAAO,KAAK,KAAK,MAAMA,aAAY,QAAQ,GAAG;AAClD;AAEA,SAAS,oBACL,KACA,MACAA,aAA+B;AAE/B,QAAM,YAAY,SAA8B,KAAK,MAAMA,aAAY;IACnE,MAAM;GACT;AACD,sBAAoB,KAAK,SAAS;AAClC,QAAM,SAAS,SACX,KACA,MACA,WACAA,aACA,MAAM,KAAK,MAAMA,WAAU,CAAC;AAEhC,SAAO,KAAK,KAAK,MAAMA,aAAY,MAAM;AAC7C;AAEA,SAAS,uBACL,KACA,MACAA,aAA4C;AAE5C,QAAM,YAAY,SAA8B,KAAK,MAAMA,aAAY;IACnE,MAAM;GACT;AACD,sBAAoB,KAAK,SAAS;AAClC,QAAM,SAAS,SACX,KACA,MACA,WACAA,aACA,MAAM,KAAK,MAAMA,WAAU,CAAC;AAEhC,QAAM,MAAM,SAAS,KAAK,MAAMA,YAAW,WAAWA,WAAU;AAChE,SAAO,KAAK,KAAK,MAAMA,aAAY,QAAQ,GAAG;AAClD;AAEA,SAAS,YACL,KACA,MACAC,cAAwB;AAExB,QAAM,QAAQ,SAA+B,KAAK,MAAMA,cAAa;IACjE,MAAM;GACT;AACD,sBAAoB,KAAK,KAAK;AAC9B,QAAM,OAAO,YAAIA,aAAY,YAAY,CAAC,MAAM,KAAK,KAAK,MAAM,CAAC,CAAC;AAClE,QAAM,SAAS,SAAS,KAAK,MAAM,OAAOA,cAAa,GAAG,IAAI;AAC9D,SAAO;AACX;AAEA,SAAS,OAAO,KAAU,MAAYC,SAAc;AAChD,QAAM,QAAQ,SAA+B,KAAK,MAAMA,SAAQ;IAC5D,MAAM;GACT;AACD,sBAAoB,KAAK,KAAK;AAC9B,QAAM,SAAS,SAAS,KAAK,MAAM,OAAOA,SAAQ,MAAM,KAAK,MAAMA,OAAM,CAAC;AAC1E,SAAO,SAAS,KAAK,MAAMA,SAAQ,MAAM;AAC7C;AAEA,SAAS,MACL,KACA,MACAC,QAAoC;AAEpC,QAAM,UAAU,eACZ,YAAIA,OAAM,YAAY,CAAC,MAAM,KAAK,KAAK,MAAM,CAAC,CAAC,GAC/C,CAAC,MAAM,MAAM,MAAS;AAE1B,MAAI,QAAQ,WAAW,GAAG;AACtB,WAAO,QAAQ,CAAC;EACpB,WAAW,QAAQ,WAAW,GAAG;AAC7B,WAAO;EACX,OAAO;AACH,WAAO,UAAU,KAAK,OAAO;EACjC;AACJ;AAEA,SAAS,KACL,KACA,MACAC,OACA,QACA,KAAe;AAEf,QAAM,WAAW,OAAO;AACxB,QAAM,SAAS,OAAO;AAEtB,QAAM,OAAO,SAA4B,KAAK,MAAMA,OAAM;IACtD,MAAM;GACT;AACD,sBAAoB,KAAK,IAAI;AAC7B,QAAM,MAAM,SAAuB,KAAK,MAAMA,OAAM;IAChD,MAAM;GACT;AACD,WAAS,WAAW;AACpB,MAAI,WAAW;AACf,MAAI,YAAY,YAAY,MAAM,MAAM,qCAAqC,uBAAuBA,MAAK,GAAG,CAAC,IAAI;AACjH,UAAQ,QAAQ,IAAI;AAIpB,MAAI,QAAQ,QAAW;AACnB,YAAQ,MAAM,QAAQ;AACtB,YAAQ,MAAM,GAAG;EACrB,OAAO;AACH,YAAQ,MAAM,GAAG;AAEjB,YAAQ,MAAM,IAAI,IAAI;AACtB,YAAQ,IAAI,OAAO,QAAQ;EAC/B;AAEA,SAAO;IACH,MAAM;IACN,OAAO;;AAEf;AAEA,SAAS,KACL,KACA,MACAC,OACA,QACA,KAAe;AAEf,QAAM,QAAQ,OAAO;AACrB,QAAM,MAAM,OAAO;AAEnB,QAAM,QAAQ,SAA6B,KAAK,MAAMA,OAAM;IACxD,MAAM;GACT;AACD,sBAAoB,KAAK,KAAK;AAC9B,QAAM,UAAU,SAAuB,KAAK,MAAMA,OAAM;IACpD,MAAM;GACT;AACD,QAAM,OAAO,SAA4B,KAAK,MAAMA,OAAM;IACtD,MAAM;GACT;AACD,QAAM,WAAW;AACjB,UAAQ,WAAW;AAEnB,UAAQ,OAAO,KAAK;AACpB,UAAQ,OAAO,OAAO;AACtB,UAAQ,KAAK,IAAI;AAEjB,MAAI,QAAQ,QAAW;AACnB,YAAQ,MAAM,OAAO;AAErB,YAAQ,MAAM,IAAI,IAAI;AACtB,YAAQ,IAAI,OAAO,KAAK;EAC5B,OAAO;AACH,YAAQ,MAAM,KAAK;EACvB;AAEA,MAAI,YAAY,YAAY,MAAM,MAAM,4BAA4B,cAAcA,MAAK,GAAG,CAAC,IAAI;AAC/F,SAAO;IACH,MAAM;IACN,OAAO;;AAEf;AAEA,SAAS,SAAS,KAAU,MAAYC,WAAkB,QAAiB;AACvE,QAAM,QAAQ,OAAO;AACrB,QAAM,MAAM,OAAO;AAEnB,UAAQ,OAAO,GAAG;AAElB,MAAI,YAAY,YAAY,MAAM,UAAUA,UAAS,GAAG,CAAC,IAAI;AAC7D,SAAO;AACX;AAEA,SAAS,oBAAoB,KAAU,OAAoB;AACvD,MAAI,eAAe,KAAK,KAAK;AAC7B,QAAM,WAAW,IAAI,eAAe,SAAS;AAC7C,SAAO,MAAM;AACjB;AAEA,SAAS,SACL,KACA,MACA,OACA,eACG,MAA+B;AAElC,QAAM,MAAM,SAAwB,KAAK,MAAM,YAAY;IACvD,MAAM;IACN;GACH;AACD,QAAM,MAAM;AACZ,aAAW,OAAO,MAAM;AACpB,QAAI,QAAQ,QAAW;AAEnB,cAAQ,OAAO,IAAI,IAAI;AACvB,cAAQ,IAAI,OAAO,GAAG;IAC1B,OAAO;AACH,cAAQ,OAAO,GAAG;IACtB;EACJ;AAEA,QAAM,SAAoB;IACtB,MAAM;IACN,OAAO;;AAEX,MAAI,YAAY,YAAY,MAAMC,aAAY,UAAU,GAAG,WAAW,GAAG,CAAC,IAAI;AAC9E,SAAO;AACX;AAEA,SAASA,aAAY,YAAuB;AACxC,MAAI,sBAAsB,aAAa;AACnC,WAAO;EACX,WAAW,sBAAsB,QAAQ;AACrC,WAAO;EACX,WAAW,sBAAsB,YAAY;AACzC,WAAO;EACX,WAAW,sBAAsB,yBAAyB;AACtD,WAAO;EACX,WAAW,sBAAsB,qBAAqB;AAClD,WAAO;EACX,WAAW,sBAAsB,kCAAkC;AAC/D,WAAO;EACX,OAAO;AACH,UAAM,IAAI,MAAM,qCAAqC;EACzD;AACJ;AAEA,SAAS,UAAU,KAAU,MAAiB;AAC1C,QAAM,aAAa,KAAK;AACxB,WAAS,IAAI,GAAG,IAAI,aAAa,GAAG,KAAK;AACrC,UAAM,SAAS,KAAK,CAAC;AACrB,QAAI;AACJ,QAAI,OAAO,KAAK,YAAY,WAAW,GAAG;AACtC,mBAAa,OAAO,KAAK,YAAY,CAAC;IAC1C;AACA,UAAM,mBAAmB,sBAAsB;AAC/C,UAAM,iBAAiB;AACvB,UAAM,OAAO,KAAK,IAAI,CAAC,EAAE;AACzB,QACI,OAAO,KAAK,SAAS,aACrB,OAAO,MAAM,SAAS,aACtB,eAAe,WACb,oBAAoB,eAAe,gBAAgB,OAAO,SACxD,WAAW,WAAW,OAAO,QACnC;AAEE,UAAI,kBAAkB;AAClB,uBAAe,cAAc;MACjC,OAAO;AACH,mBAAW,SAAS;MACxB;AACA,kBAAY,KAAK,OAAO,KAAK;IACjC,OAAO;AAEH,cAAQ,OAAO,OAAO,IAAI;IAC9B;EACJ;AAEA,QAAMC,SAAQ,KAAK,CAAC;AACpB,QAAM,OAAO,KAAK,aAAa,CAAC;AAChC,SAAO;IACH,MAAMA,OAAM;IACZ,OAAO,KAAK;;AAEpB;AAEA,SAAS,SACL,KACA,MACA,WACA,YAAqC;AAErC,QAAM,OAAO,SAAqB,KAAK,MAAM,YAAY;IACrD,MAAM;GACT;AACD,QAAM,QAAQ,SAAqB,KAAK,MAAM,YAAY;IACtD,MAAM;GACT;AACD,gBAAc,MAAM,IAAI,eAAe,OAAO,SAAS,CAAC;AACxD,SAAO;IACH;IACA;;AAER;AAEA,SAAS,QACL,KACA,aACA,aAAwB;AAExB,QAAM,OAAO,YAAY;AACzB,QAAM,QAAQ,IAAI,iBAAiB,IAAI,IAAI;AAC3C,QAAM,OAAO,SAA+B,KAAK,aAAa,aAAa;IACvE,MAAM;GACT;AACD,QAAM,QAAQ,SAA+B,KAAK,aAAa,aAAa;IACxE,MAAM;GACT;AAED,QAAM,OAAO,IAAI,eAAe,OAAO,MAAM,KAAK;AAClD,gBAAc,MAAM,IAAI;AAExB,SAAO;IACH;IACA;;AAER;AAEA,SAAS,gBAAgB,KAAU,MAAYL,QAAgB;AAC3D,QAAM,QAAQ,IAAI,iBAAiB,IAAI,IAAI;AAC3C,UAAQ,OAAOA,OAAM,IAAI;AACzB,QAAM,OAAO,IAAI,gBAAgB,IAAI,IAAI;AACzC,UAAQA,OAAM,OAAO,IAAI;AACzB,QAAM,SAAoB;IACtB,MAAM;IACN,OAAO;;AAEX,SAAO;AACX;AAEA,SAAS,QAAQM,IAAiB,GAAe;AAC7C,QAAM,aAAa,IAAI,kBAAkB,CAAa;AACtD,gBAAcA,IAAG,UAAU;AAC/B;AAEA,SAAS,SACL,KACA,MACA,YACA,SAAmB;AAEnB,QAAM,IAAO,OAAA,OAAA;IACT;IACA;IACA,wBAAwB;IACxB;IACA,aAAa,CAAA;IACb,qBAAqB,CAAA;IACrB,aAAa,IAAI,OAAO;EAAM,GAC3B,OAAO;AAEd,MAAI,OAAO,KAAK,CAAC;AACjB,SAAO;AACX;AAEA,SAAS,cAAc,OAAqB,YAAsB;AAG9D,MAAI,MAAM,YAAY,WAAW,GAAG;AAChC,UAAM,yBAAyB,WAAW,UAAS;EACvD;AACA,QAAM,YAAY,KAAK,UAAU;AACrC;AAEA,SAAS,YAAY,KAAU,OAAe;AAC1C,MAAI,OAAO,OAAO,IAAI,OAAO,QAAQ,KAAK,GAAG,CAAC;AAClD;;;AC1mBO,IAAM,YAAY,CAAA;AAQnB,IAAO,eAAP,MAAmB;EAAzB,cAAA;AACU,SAAA,MAA8B,CAAA;AAC9B,SAAA,UAAuB,CAAA;EAsCjC;EAlCE,IAAI,OAAI;AACN,WAAO,KAAK,QAAQ;EACtB;EAEA,WAAQ;AAEN,SAAK,MAAM,CAAA;EACb;EAEA,IAAI,QAAiB;AACnB,UAAM,MAAM,gBAAgB,MAAM;AAGlC,QAAI,EAAE,OAAO,KAAK,MAAM;AACtB,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ;AAC7B,WAAK,QAAQ,KAAK,MAAM;IAC1B;EACF;EAEA,IAAI,WAAQ;AACV,WAAO,KAAK;EACd;EAEA,IAAI,OAAI;AACN,WAAO,YAAI,KAAK,SAAS,CAAC,MAAM,EAAE,GAAG;EACvC;EAEA,IAAI,MAAG;AACL,QAAI,QAAQ;AACZ,eAAW,KAAK,KAAK,KAAK;AACxB,eAAS,IAAI;IACf;AACA,WAAO;EACT;;AAGI,SAAU,gBAAgB,QAAmB,MAAM,MAAI;AAC3D,SAAO,GAAG,MAAM,IAAI,OAAO,GAAG,KAAK,EAAE,IACnC,OAAO,MAAM,WACf,IAAI,OAAO,MAAM,IAAI,CAAC,MAAM,EAAE,YAAY,SAAQ,CAAE,EAAE,KAAK,GAAG,CAAC;AACjE;;;ACjEA,SAAS,aAAa,OAAO,UAAU,YAAY;AACjD,MAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,QAAQ,MAAM,KAAK,GACnB,UAAU,SAAS,KAAK;AAE5B,QAAI,WAAW,SAAS,aAAa,SAC5B,YAAY,WAAW,CAAC,iBAAS,OAAO,IACzC,WAAW,SAAS,QAAQ,IAC7B;AACL,UAAI,WAAW,SACX,SAAS;AAAA,IACf;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACtBf,SAAS,OAAO,OAAO,OAAO;AAC5B,SAAO,QAAQ;AACjB;AAEA,IAAO,iBAAQ;;;ACSf,SAAS,IAAI,OAAO;AAClB,SAAQ,SAAS,MAAM,SACnB,qBAAa,OAAO,kBAAU,cAAM,IACpC;AACN;AAEA,IAAO,cAAQ;;;ACvBf,IAAI,mBAAmB,iBAAS,eAAO,qBAAqB;AAS5D,SAAS,cAAc,OAAO;AAC5B,SAAO,gBAAQ,KAAK,KAAK,oBAAY,KAAK,KACxC,CAAC,EAAE,oBAAoB,SAAS,MAAM,gBAAgB;AAC1D;AAEA,IAAO,wBAAQ;;;ACLf,SAAS,YAAY,OAAO,OAAO,WAAW,UAAU,QAAQ;AAC9D,MAAI,QAAQ,IACR,SAAS,MAAM;AAEnB,gBAAc,YAAY;AAC1B,aAAW,SAAS,CAAC;AAErB,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,QAAQ,MAAM,KAAK;AACvB,QAAI,QAAQ,KAAK,UAAU,KAAK,GAAG;AACjC,UAAI,QAAQ,GAAG;AAEb,oBAAY,OAAO,QAAQ,GAAG,WAAW,UAAU,MAAM;AAAA,MAC3D,OAAO;AACL,0BAAU,QAAQ,KAAK;AAAA,MACzB;AAAA,IACF,WAAW,CAAC,UAAU;AACpB,aAAO,OAAO,MAAM,IAAI;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACbf,SAAS,QAAQ,YAAY,UAAU;AACrC,SAAO,oBAAY,YAAI,YAAY,QAAQ,GAAG,CAAC;AACjD;AAEA,IAAO,kBAAQ;;;ACjBf,SAAS,cAAc,OAAO,WAAW,WAAW,WAAW;AAC7D,MAAI,SAAS,MAAM,QACf,QAAQ,aAAa,YAAY,IAAI;AAEzC,SAAQ,YAAY,UAAU,EAAE,QAAQ,QAAS;AAC/C,QAAI,UAAU,MAAM,KAAK,GAAG,OAAO,KAAK,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,wBAAQ;;;AChBf,SAAS,UAAU,OAAO;AACxB,SAAO,UAAU;AACnB;AAEA,IAAO,oBAAQ;;;ACDf,SAAS,cAAc,OAAO,OAAO,WAAW;AAC9C,MAAI,QAAQ,YAAY,GACpB,SAAS,MAAM;AAEnB,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,MAAM,KAAK,MAAM,OAAO;AAC1B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,wBAAQ;;;ACTf,SAAS,YAAY,OAAO,OAAO,WAAW;AAC5C,SAAO,UAAU,QACb,sBAAc,OAAO,OAAO,SAAS,IACrC,sBAAc,OAAO,mBAAW,SAAS;AAC/C;AAEA,IAAO,sBAAQ;;;ACRf,SAAS,cAAc,OAAO,OAAO;AACnC,MAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,SAAO,CAAC,CAAC,UAAU,oBAAY,OAAO,OAAO,CAAC,IAAI;AACpD;AAEA,IAAO,wBAAQ;;;ACPf,SAAS,kBAAkB,OAAO,OAAO,YAAY;AACnD,MAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,WAAW,OAAO,MAAM,KAAK,CAAC,GAAG;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,4BAAQ;;;ACTf,SAAS,OAAO;AAEhB;AAEA,IAAO,eAAQ;;;ACXf,IAAIC,YAAW,IAAI;AASnB,IAAI,YAAY,EAAE,eAAQ,IAAI,mBAAW,IAAI,YAAI,CAAC,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAMA,aAAY,eAAO,SAAS,QAAQ;AAClG,SAAO,IAAI,YAAI,MAAM;AACvB;AAEA,IAAO,oBAAQ;;;ACVf,IAAIC,oBAAmB;AAWvB,SAAS,SAAS,OAAO,UAAU,YAAY;AAC7C,MAAI,QAAQ,IACR,WAAW,uBACX,SAAS,MAAM,QACf,WAAW,MACX,SAAS,CAAC,GACV,OAAO;AAEX,MAAI,YAAY;AACd,eAAW;AACX,eAAW;AAAA,EACb,WACS,UAAUA,mBAAkB;AACnC,QAAI,MAAM,WAAW,OAAO,kBAAU,KAAK;AAC3C,QAAI,KAAK;AACP,aAAO,mBAAW,GAAG;AAAA,IACvB;AACA,eAAW;AACX,eAAW;AACX,WAAO,IAAI;AAAA,EACb,OACK;AACH,WAAO,WAAW,CAAC,IAAI;AAAA,EACzB;AACA;AACA,WAAO,EAAE,QAAQ,QAAQ;AACvB,UAAI,QAAQ,MAAM,KAAK,GACnB,WAAW,WAAW,SAAS,KAAK,IAAI;AAE5C,cAAS,cAAc,UAAU,IAAK,QAAQ;AAC9C,UAAI,YAAY,aAAa,UAAU;AACrC,YAAI,YAAY,KAAK;AACrB,eAAO,aAAa;AAClB,cAAI,KAAK,SAAS,MAAM,UAAU;AAChC,qBAAS;AAAA,UACX;AAAA,QACF;AACA,YAAI,UAAU;AACZ,eAAK,KAAK,QAAQ;AAAA,QACpB;AACA,eAAO,KAAK,KAAK;AAAA,MACnB,WACS,CAAC,SAAS,MAAM,UAAU,UAAU,GAAG;AAC9C,YAAI,SAAS,QAAQ;AACnB,eAAK,KAAK,QAAQ;AAAA,QACpB;AACA,eAAO,KAAK,KAAK;AAAA,MACnB;AAAA,IACF;AACA,SAAO;AACT;AAEA,IAAO,mBAAQ;;;AC7Cf,SAAS,OAAO,OAAO,UAAU;AAC/B,SAAQ,SAAS,MAAM,SAAU,iBAAS,OAAO,qBAAa,UAAU,CAAC,CAAC,IAAI,CAAC;AACjF;AAEA,IAAO,iBAAQ;;;ACdf,SAAS,QAAQ,OAAO;AACtB,MAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,SAAO,SAAS,oBAAY,OAAO,CAAC,IAAI,CAAC;AAC3C;AAEA,IAAO,kBAAQ;;;ACZf,SAAS,UAAU,OAAO,UAAU;AAClC,MAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,SAAS,MAAM,KAAK,GAAG,OAAO,KAAK,MAAM,OAAO;AAClD;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACZf,SAAS,aAAa,OAAO;AAC3B,SAAO,OAAO,SAAS,aAAa,QAAQ;AAC9C;AAEA,IAAO,uBAAQ;;;ACsBf,SAAS,QAAQ,YAAY,UAAU;AACrC,MAAI,OAAO,gBAAQ,UAAU,IAAI,oBAAY;AAC7C,SAAO,KAAK,YAAY,qBAAa,QAAQ,CAAC;AAChD;AAEA,IAAO,kBAAQ;;;AC9Bf,IAAIC,UAAS;AAAb,IACIC,UAAS;AAGb,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,mBAAiBD,cAAY;AAmCjC,SAAS,QAAQ,OAAO;AACtB,MAAI,SAAS,MAAM;AACjB,WAAO;AAAA,EACT;AACA,MAAI,oBAAY,KAAK,MAChB,gBAAQ,KAAK,KAAK,OAAO,SAAS,YAAY,OAAO,MAAM,UAAU,cACpE,iBAAS,KAAK,KAAK,qBAAa,KAAK,KAAK,oBAAY,KAAK,IAAI;AACnE,WAAO,CAAC,MAAM;AAAA,EAChB;AACA,MAAI,MAAM,eAAO,KAAK;AACtB,MAAI,OAAOF,WAAU,OAAOC,SAAQ;AAClC,WAAO,CAAC,MAAM;AAAA,EAChB;AACA,MAAI,oBAAY,KAAK,GAAG;AACtB,WAAO,CAAC,iBAAS,KAAK,EAAE;AAAA,EAC1B;AACA,WAAS,OAAO,OAAO;AACrB,QAAIE,iBAAe,KAAK,OAAO,GAAG,GAAG;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,kBAAQ;;;AChEf,SAAS,YAAY,OAAO,UAAU,aAAa,WAAW;AAC5D,MAAI,QAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,MAAI,aAAa,QAAQ;AACvB,kBAAc,MAAM,EAAE,KAAK;AAAA,EAC7B;AACA,SAAO,EAAE,QAAQ,QAAQ;AACvB,kBAAc,SAAS,aAAa,MAAM,KAAK,GAAG,OAAO,KAAK;AAAA,EAChE;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACZf,SAAS,WAAW,YAAY,UAAU,aAAa,WAAW,UAAU;AAC1E,WAAS,YAAY,SAAS,OAAO,OAAOC,aAAY;AACtD,kBAAc,aACT,YAAY,OAAO,SACpB,SAAS,aAAa,OAAO,OAAOA,WAAU;AAAA,EACpD,CAAC;AACD,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACqBf,SAAS,OAAO,YAAY,UAAU,aAAa;AACjD,MAAI,OAAO,gBAAQ,UAAU,IAAI,sBAAc,oBAC3C,YAAY,UAAU,SAAS;AAEnC,SAAO,KAAK,YAAY,qBAAa,UAAU,CAAC,GAAG,aAAa,WAAW,gBAAQ;AACrF;AAEA,IAAO,iBAAQ;;;ACYf,SAAS,eAAe,YAA2B,UAAgB;AAC/D,QAAMC,OAAuC,CAAA;AAC7C,SAAO,CAAC,iBAAgB;AACpB,UAAM,MAAM,aAAa,SAAQ;AACjC,QAAI,WAAWA,KAAI,GAAG;AACtB,QAAI,aAAa,QAAW;AACxB,aAAO;IACX,OAAO;AACH,iBAAW;QACP,eAAe;QACf;QACA,QAAQ,CAAA;;AAEZ,MAAAA,KAAI,GAAG,IAAI;AACX,aAAO;IACX;EACJ;AACJ;AAEA,IAAM,eAAN,MAAkB;EAAlB,cAAA;AACY,SAAA,aAAwB,CAAA;EAkBpC;EAhBI,GAAG,OAAa;AACZ,WAAO,SAAS,KAAK,WAAW,UAAU,KAAK,WAAW,KAAK;EACnE;EAEA,IAAI,OAAe,OAAc;AAC7B,SAAK,WAAW,KAAK,IAAI;EAC7B;EAEA,WAAQ;AACJ,QAAI,QAAQ;AACZ,UAAM,OAAO,KAAK,WAAW;AAC7B,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,eAAS,KAAK,WAAW,CAAC,MAAM,OAAO,MAAM;IACjD;AACA,WAAO;EACX;;AASJ,IAAM,mBAAmB,IAAI,aAAY;AASnC,IAAO,0BAAP,cAAuC,qBAAoB;EAO7D,YAAY,SAAgC;;AACxC,UAAK;AACL,SAAK,WAAU,KAAA,YAAO,QAAP,YAAO,SAAA,SAAP,QAAS,aAAO,QAAA,OAAA,SAAA,MAAK,CAAC,YAAY,QAAQ,IAAI,OAAO;AACpE,SAAK,cAAa,KAAA,YAAO,QAAP,YAAO,SAAA,SAAP,QAAS,gBAAU,QAAA,OAAA,SAAA,KAAI;EAC7C;EAES,WAAW,SAA0B;AAC1C,SAAK,MAAM,UAAU,QAAQ,KAAK;AAClC,SAAK,OAAO,iBAAiB,KAAK,GAAG;EACzC;EAES,2CAAwC;AAC7C,WAAO,CAAA;EACX;EAES,8BAA2B;AAChC,WAAO,CAAA;EACX;EAES,6BAA6B,SAMrC;AACG,UAAM,EAAE,gBAAgB,MAAM,eAAe,qBAAoB,IAAK;AACtE,UAAM,OAAO,KAAK;AAClB,UAAM,UAAU,KAAK;AACrB,UAAM,aAAa,KAAK;AACxB,UAAM,MAAM,YAAY,MAAM,eAAe,cAAc;AAC3D,UAAM,gBAAgB,KAAK,IAAI,YAAY,GAAG;AAC9C,UAAM,gBAAgB,cAAc;AACpC,UAAM,cAA2C,YAC7C,kBAAkB;MACd,cAAc;MACd,YAAY;MACZ,UAAU;MACV;KACH,GACD,CAAC,YAAY,YAAI,SAAS,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC;AAGhD,QAAI,cAAc,aAAa,KAAK,KAAK,CAAC,sBAAsB;AAC5D,YAAM,cAAc,eAChB,aACA,CAAC,QAAQ,SAAS,QAAO;AACrB,wBAAQ,SAAS,CAAC,gBAAe;AAC7B,cAAI,aAAa;AACb,mBAAO,YAAY,YAAa,IAAI;AACpC,4BAAQ,YAAY,iBAAkB,CAAC,sBAAqB;AACxD,qBAAO,iBAAiB,IAAI;YAChC,CAAC;UACL;QACJ,CAAC;AACD,eAAO;MACX,GACA,CAAA,CAA4B;AAGhC,UAAI,eAAe;AACf,eAAO,SAA4B,QAAM;;AACrC,gBAAM,YAAY,KAAK,QAAQ,CAAC;AAChC,gBAAM,aAAiC,YAAY,UAAU,YAAY;AACzE,cAAI,WAAW,UAAa,eAAe,QAAW;AAClD,kBAAM,QAAO,KAAA,OAAO,UAAU,OAAC,QAAA,OAAA,SAAA,SAAA,GAAE;AACjC,gBAAI,SAAS,UAAa,KAAK,KAAK,IAAI,MAAM,OAAO;AACjD,qBAAO;YACX;UACJ;AACA,iBAAO;QACX;MACJ,OAAO;AACH,eAAO,WAAA;AACH,gBAAM,YAAY,KAAK,QAAQ,CAAC;AAChC,iBAAO,YAAY,UAAU,YAAY;QAC7C;MACJ;IACJ,WAAW,eAAe;AACtB,aAAO,SAA4B,QAAM;AACrC,cAAM,aAAa,IAAI,aAAY;AACnC,cAAM,SAAS,WAAW,SAAY,IAAI,OAAO;AACjD,iBAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,gBAAM,OAAO,WAAM,QAAN,WAAM,SAAA,SAAN,OAAS,CAAC,EAAE;AACzB,qBAAW,IAAI,GAAG,SAAS,UAAa,KAAK,KAAK,IAAI,CAAC;QAC3D;AACA,cAAM,SAAS,gBAAgB,KAAK,MAAM,MAAM,eAAe,YAAY,SAAS,UAAU;AAC9F,eAAO,OAAO,WAAW,WAAW,SAAS;MACjD;IACJ,OAAO;AACH,aAAO,WAAA;AACH,cAAM,SAAS,gBAAgB,KAAK,MAAM,MAAM,eAAe,kBAAkB,SAAS,UAAU;AACpG,eAAO,OAAO,WAAW,WAAW,SAAS;MACjD;IACJ;EACJ;EAES,0BAA0B,SAMlC;AACG,UAAM,EAAE,gBAAgB,MAAM,UAAU,qBAAoB,IAAK;AACjE,UAAM,OAAO,KAAK;AAClB,UAAM,UAAU,KAAK;AACrB,UAAM,aAAa,KAAK;AACxB,UAAM,MAAM,YAAY,MAAM,UAAU,cAAc;AACtD,UAAM,gBAAgB,KAAK,IAAI,YAAY,GAAG;AAC9C,UAAM,gBAAgB,cAAc;AACpC,UAAM,OAAO,YACT,kBAAkB;MACd,cAAc;MACd,YAAY;MACZ;MACA;KACH,GACD,CAAC,MAAK;AACJ,aAAO,YAAI,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3B,CAAC;AAGH,QAAI,cAAc,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,sBAAsB;AAC9D,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,oBAAoB,gBAAQ,GAAG;AAErC,UACE,kBAAkB,WAAW,KAC7B,gBAAQ,kBAAkB,CAAC,EAAE,eAAe,GAC5C;AACA,cAAM,oBAAoB,kBAAkB,CAAC;AAC7C,cAAM,yBAAyB,kBAAkB;AAEjD,eAAO,WAAA;AACL,iBAAO,KAAK,QAAQ,CAAC,EAAE,iBAAiB;QAC1C;MACF,OAAO;AACL,cAAM,cAAc,eAClB,mBACA,CAAC,QAAQ,gBAAe;AACtB,cAAI,gBAAgB,QAAW;AAC7B,mBAAO,YAAY,YAAa,IAAI;AACpC,4BAAQ,YAAY,iBAAiB,CAAC,sBAAqB;AACzD,qBAAO,iBAAiB,IAAI;YAC9B,CAAC;UACH;AACA,iBAAO;QACT,GACA,CAAA,CAA6B;AAG/B,eAAO,WAAA;AACL,gBAAM,YAAY,KAAK,QAAQ,CAAC;AAChC,iBAAO,YAAY,UAAU,YAAY,MAAM;QACjD;MACF;IACF;AACA,WAAO,WAAA;AACL,YAAM,SAAS,gBAAgB,KAAK,MAAM,MAAM,eAAe,kBAAkB,SAAS,UAAU;AAClG,aAAO,OAAO,WAAW,WAAW,QAAQ,WAAW;IAC3D;EACN;;AAIJ,SAAS,cAAc,WAAwC,aAAa,MAAI;AAC5E,QAAM,UAAU,oBAAI,IAAG;AAEvB,aAAW,OAAO,WAAW;AACzB,UAAM,SAAS,oBAAI,IAAG;AACtB,eAAW,WAAW,KAAK;AACvB,UAAI,YAAY,QAAW;AACvB,YAAI,YAAY;AAEZ;QACJ,OAAO;AACH,iBAAO;QACX;MACJ;AACA,YAAM,UAAU,CAAC,QAAQ,YAAa,EAAE,OAAO,QAAQ,eAAgB;AACvE,iBAAW,SAAS,SAAS;AACzB,YAAI,QAAQ,IAAI,KAAK,GAAG;AACpB,cAAI,CAAC,OAAO,IAAI,KAAK,GAAG;AACpB,mBAAO;UACX;QACJ,OAAO;AACH,kBAAQ,IAAI,KAAK;AACjB,iBAAO,IAAI,KAAK;QACpB;MACJ;IACJ;EACJ;AACA,SAAO;AACX;AAEA,SAAS,iBAAiB,KAAQ;AAC9B,QAAM,iBAAiB,IAAI,eAAe;AAC1C,QAAM,gBAA4B,MAAM,cAAc;AACtD,WAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACrC,kBAAc,CAAC,IAAI,eAAe,IAAI,eAAe,CAAC,GAAG,CAAC;EAC9D;AACA,SAAO;AACX;AAEA,SAAS,gBAEL,WACA,UACA,cACA,SACA,YAAmB;AAEnB,QAAM,MAAM,UAAU,QAAQ,EAAE,YAAY;AAC5C,MAAI,QAAQ,IAAI;AAChB,MAAI,UAAU,QAAW;AACrB,UAAMC,WAAU,kBAAkB,IAAI,aAAyB;AAC/D,YAAQ,YAAY,KAAK,YAAYA,QAAO,CAAC;AAC7C,QAAI,QAAQ;EAChB;AAEA,QAAM,MAAM,iBAAiB,MAAM,MAAM,CAAC,KAAK,OAAO,cAAc,SAAS,UAAU,CAAC;AACxF,SAAO;AACX;AAEA,SAAS,iBAEL,KACA,IACA,cACA,SACA,YAAmB;AAEnB,MAAI,YAAY;AAEhB,MAAI,IAAI;AACR,QAAM,OAAiB,CAAA;AAEvB,MAAI,IAAI,KAAK,QAAQ,GAAG;AAExB,SAAO,MAAM;AACT,QAAI,IAAI,uBAAuB,WAAW,CAAC;AAC3C,QAAI,MAAM,QAAW;AACjB,UAAI,uBAAuB,MAAM,MAAM,CAAC,KAAK,WAAW,GAAG,GAAG,cAAc,OAAO,CAAC;IACxF;AAEA,QAAI,MAAM,WAAW;AACjB,aAAO,0BAA0B,MAAM,WAAW,CAAC;IACvD;AAEA,QAAI,EAAE,kBAAkB,MAAM;AAC1B,UAAI,eAAe,QAAQ,aAAa,GAAG,GAAG,GAAG;AAG7C,cAAM,YAAY,aAAa,WAAW,YAAY;AACtD,YAAI,cAAc,QAAW;AACzB,iBAAO;QACX;MACJ;AACA,aAAO,EAAE;IACb;AAEA,gBAAY;AACZ,SAAK,KAAK,CAAC;AAGX,QAAI,KAAK,GAAG,GAAG;EACnB;AACJ;AAEA,SAAS,uBAEL,KACA,WACA,OACA,WACA,cACA,SAAwB;AAExB,QAAM,QAAQ,gBAAgB,UAAU,SAAS,OAAO,YAAY;AACpE,MAAI,MAAM,SAAS,GAAG;AAClB,eAAW,KAAK,WAAW,OAAO,SAAS;AAC3C,WAAO;EACX;AAEA,MAAIC,YAAW,YAAY,KAAK;AAChC,QAAM,eAAe,aAAa,OAAO,YAAY;AAErD,MAAI,iBAAiB,QAAW;AAC5B,IAAAA,UAAS,gBAAgB;AACzB,IAAAA,UAAS,aAAa;AACtB,IAAAA,UAAS,QAAQ,YAAY;EACjC,WAAW,iCAAiC,KAAK,GAAG;AAChD,UAAM,aAAa,YAAI,MAAM,IAAI;AACjC,IAAAA,UAAS,gBAAgB;AACzB,IAAAA,UAAS,aAAa;AACtB,IAAAA,UAAS,QAAQ,YAAY;AAC7B,6BAAyB,MAAM,MAAM,CAAC,KAAK,WAAW,MAAM,MAAM,OAAO,CAAC;EAC9E;AAEA,EAAAA,YAAW,WAAW,KAAK,WAAW,OAAOA,SAAQ;AACrD,SAAOA;AACX;AAEA,SAAS,yBAEL,KACA,WACA,kBACA,SAAwB;AAExB,QAAM,aAA0B,CAAA;AAChC,WAAS,IAAI,GAAG,KAAK,WAAW,KAAK;AACjC,eAAW,KAAK,KAAK,GAAG,CAAC,EAAE,SAAS;EACxC;AACA,QAAM,WAAW,IAAI;AACrB,QAAM,eAAe,SAAS;AAC9B,QAAM,aAAa,SAAS;AAC5B,QAAM,UAAU,oBAAoB;IAChC;IACA;IACA;IACA;GACH;AACD,UAAQ,OAAO;AACnB;AAEA,SAAS,oBAAoB,SAK5B;AACG,QAAM,UAAU,YAAI,QAAQ,YAAY,CAAC,YACrCC,YAAW,OAAO,CAAC,EACrB,KAAK,IAAI;AACX,QAAM,aACF,QAAQ,WAAW,QAAQ,IAAI,KAAK,QAAQ,WAAW;AAC3D,MAAI,cACA,qCAAqC,QAAQ,iBAAiB,KAC1D,IAAI,CACP,SAASC,sBAAqB,QAAQ,UAAU,CAAC,GAAG,UAAU,aACnD,QAAQ,aAAa,IAAI;GACjC,OAAO;;AAEf,gBACI,cACA;;AAEJ,SAAO;AACX;AAEA,SAASA,sBAAqB,MAA+B;AACzD,MAAI,gBAAgB,aAAa;AAC7B,WAAO;EACX,WAAW,gBAAgB,QAAQ;AAC/B,WAAO;EACX,WAAW,gBAAgB,aAAa;AACpC,WAAO;EACX,WAAW,gBAAgB,qBAAqB;AAC5C,WAAO;EACX,WAAW,gBAAgB,kCAAkC;AACzD,WAAO;EACX,WAAW,gBAAgB,yBAAyB;AAChD,WAAO;EACX,WAAW,gBAAgB,YAAY;AACnC,WAAO;EACX,WAAW,gBAAgB,UAAU;AACjC,WAAO;EACX,OAAO;AACH,UAAM,MAAM,sBAAsB;EACtC;AACJ;AAEA,SAAS,0BACL,MACA,UACA,SAAe;AAEf,QAAM,kBAAkB,gBACpB,SAAS,QAAQ,UACjB,CAAC,MAAM,EAAE,MAAM,WAAW;AAE9B,QAAM,iBAAiB,eACnB,gBACK,OAAO,CAAC,MAA2B,aAAa,cAAc,EAC9D,IAAI,CAAC,MAAM,EAAE,SAAS,GAC3B,CAAC,MAAM,EAAE,YAAY;AAEzB,SAAO;IACH,aAAa;IACb,oBAAoB;IACpB,WAAW;;AAEnB;AAEA,SAAS,uBACL,OACA,OAAa;AAEb,SAAO,MAAM,MAAM,MAAM,YAAY;AACzC;AAEA,SAAS,gBACL,SACA,OACA,cAA0B;AAE1B,QAAM,eAAe,IAAI,aAAY;AACrC,QAAM,oBAAiC,CAAA;AAEvC,aAAW,KAAK,QAAQ,UAAU;AAC9B,QAAI,aAAa,GAAG,EAAE,GAAG,MAAM,OAAO;AAClC;IACJ;AACA,QAAI,EAAE,MAAM,SAAS,eAAe;AAChC,wBAAkB,KAAK,CAAC;AACxB;IACJ;AACA,UAAM,mBAAmB,EAAE,MAAM,YAAY;AAC7C,aAAS,IAAI,GAAG,IAAI,kBAAkB,KAAK;AACvC,YAAM,aAAa,EAAE,MAAM,YAAY,CAAC;AACxC,YAAM,SAAS,mBAAmB,YAAY,KAAK;AACnD,UAAI,WAAW,QAAW;AACtB,qBAAa,IAAI;UACb,OAAO;UACP,KAAK,EAAE;UACP,OAAO,EAAE;SACZ;MACL;IACJ;EACJ;AAEA,MAAI;AAEJ,MAAI,kBAAkB,WAAW,KAAK,aAAa,SAAS,GAAG;AAC3D,YAAQ;EACZ;AAEA,MAAI,UAAU,QAAW;AACrB,YAAQ,IAAI,aAAY;AACxB,eAAW,KAAK,aAAa,UAAU;AACnC,cAAQ,GAAG,KAAK;IACpB;EACJ;AAEA,MAAI,kBAAkB,SAAS,KAAK,CAAC,yBAAyB,KAAK,GAAG;AAClE,eAAW,KAAK,mBAAmB;AAC/B,YAAM,IAAI,CAAC;IACf;EACJ;AAEA,SAAO;AACX;AAEA,SAAS,mBACL,YACA,OAAa;AAEb,MACI,sBAAsB,kBACtB,aAAa,OAAO,WAAW,SAAS,GAC1C;AACE,WAAO,WAAW;EACtB;AACA,SAAO;AACX;AAEA,SAAS,aACL,SACA,cAA0B;AAE1B,MAAI;AACJ,aAAW,KAAK,QAAQ,UAAU;AAC9B,QAAI,aAAa,GAAG,EAAE,GAAG,MAAM,MAAM;AACjC,UAAI,QAAQ,QAAW;AACnB,cAAM,EAAE;MACZ,WAAW,QAAQ,EAAE,KAAK;AACtB,eAAO;MACX;IACJ;EACJ;AACA,SAAO;AACX;AAEA,SAAS,YAAYH,UAAqB;AACtC,SAAO;IACH,SAASA;IACT,OAAO,CAAA;IACP,eAAe;IACf,YAAY;;AAEpB;AAEA,SAAS,WACL,KACA,MACA,OACA,IAAY;AAEZ,OAAK,YAAY,KAAK,EAAE;AACxB,OAAK,MAAM,MAAM,YAAY,IAAI;AACjC,SAAO;AACX;AAEA,SAAS,YAAY,KAAU,OAAe;AAC1C,MAAI,UAAU,WAAW;AACrB,WAAO;EACX;AAGA,QAAM,SAAS,MAAM,QAAQ;AAC7B,QAAM,WAAW,IAAI,OAAO,MAAM;AAClC,MAAI,aAAa,QAAW;AACxB,WAAO;EACX;AACA,QAAM,QAAQ,SAAQ;AACtB,MAAI,OAAO,MAAM,IAAI;AACrB,SAAO;AACX;AAEA,SAAS,kBAAkB,UAAkB;AACzC,QAAM,UAAU,IAAI,aAAY;AAEhC,QAAM,sBAAsB,SAAS,YAAY;AACjD,WAAS,IAAI,GAAG,IAAI,qBAAqB,KAAK;AAC1C,UAAM,SAAS,SAAS,YAAY,CAAC,EAAE;AACvC,UAAM,SAAoB;MACtB,OAAO;MACP,KAAK;MACL,OAAO,CAAA;;AAEX,YAAQ,QAAQ,OAAO;EAC3B;AAEA,SAAO;AACX;AAEA,SAAS,QAAQ,QAAmB,SAAqB;AACrD,QAAM,IAAI,OAAO;AAEjB,MAAI,EAAE,SAAS,eAAe;AAC1B,QAAI,OAAO,MAAM,SAAS,GAAG;AACzB,YAAM,WAAW,CAAC,GAAG,OAAO,KAAK;AACjC,YAAM,cAAc,SAAS,IAAG;AAChC,YAAM,eAA0B;QAC5B,OAAO;QACP,KAAK,OAAO;QACZ,OAAO;;AAEX,cAAQ,cAAc,OAAO;IACjC,OAAO;AAGH,cAAQ,IAAI,MAAM;IACtB;AACA;EACJ;AAEA,MAAI,CAAC,EAAE,wBAAwB;AAC3B,YAAQ,IAAI,MAAM;EACtB;AAEA,QAAM,mBAAmB,EAAE,YAAY;AACvC,WAAS,IAAI,GAAG,IAAI,kBAAkB,KAAK;AACvC,UAAM,aAAa,EAAE,YAAY,CAAC;AAClC,UAAM,IAAI,iBAAiB,QAAQ,UAAU;AAE7C,QAAI,MAAM,QAAW;AACjB,cAAQ,GAAG,OAAO;IACtB;EACJ;AACJ;AAEA,SAAS,iBACL,QACA,YAAsB;AAEtB,MAAI,sBAAsB,mBAAmB;AACzC,WAAO;MACH,OAAO,WAAW;MAClB,KAAK,OAAO;MACZ,OAAO,OAAO;;EAEtB,WAAW,sBAAsB,gBAAgB;AAC7C,UAAM,QAAQ,CAAC,GAAG,OAAO,OAAO,WAAW,WAAW;AACtD,WAAO;MACH,OAAO,WAAW;MAClB,KAAK,OAAO;MACZ;;EAER;AACA,SAAO;AACX;AAEA,SAAS,yBAAyB,SAAqB;AACnD,aAAW,KAAK,QAAQ,UAAU;AAC9B,QAAI,EAAE,MAAM,SAAS,eAAe;AAChC,aAAO;IACX;EACJ;AACA,SAAO;AACX;AAEA,SAAS,2BAA2B,SAAqB;AACrD,aAAW,KAAK,QAAQ,UAAU;AAC9B,QAAI,EAAE,MAAM,SAAS,eAAe;AAChC,aAAO;IACX;EACJ;AACA,SAAO;AACX;AAEA,SAAS,iCAAiC,SAAqB;AAC3D,MAAI,2BAA2B,OAAO,GAAG;AACrC,WAAO;EACX;AACA,QAAM,UAAU,sBAAsB,QAAQ,QAAQ;AACtD,QAAM,YACF,qBAAqB,OAAO,KAAK,CAAC,6BAA6B,OAAO;AAC1E,SAAO;AACX;AAEA,SAAS,sBACL,SAA6B;AAE7B,QAAM,eAAe,oBAAI,IAAG;AAC5B,aAAW,KAAK,SAAS;AACrB,UAAM,MAAM,gBAAgB,GAAG,KAAK;AACpC,QAAI,OAAO,aAAa,IAAI,GAAG;AAC/B,QAAI,SAAS,QAAW;AACpB,aAAO,CAAA;AACP,mBAAa,IAAI,KAAK,IAAI;IAC9B;AACA,SAAK,EAAE,GAAG,IAAI;EAClB;AACA,SAAO;AACX;AAEA,SAAS,qBACL,SAA6C;AAE7C,aAAW,SAAS,MAAM,KAAK,QAAQ,OAAM,CAAE,GAAG;AAC9C,QAAI,OAAO,KAAK,KAAK,EAAE,SAAS,GAAG;AAC/B,aAAO;IACX;EACJ;AACA,SAAO;AACX;AAEA,SAAS,6BACL,SAA6C;AAE7C,aAAW,SAAS,MAAM,KAAK,QAAQ,OAAM,CAAE,GAAG;AAC9C,QAAI,OAAO,KAAK,KAAK,EAAE,WAAW,GAAG;AACjC,aAAO;IACX;EACJ;AACA,SAAO;AACX;AAEA,SAAS,aAAa,OAAiB,cAA0B;AAC7D,MAAI,UAA8B;AAClC,aAAW,KAAK,MAAM,QAAQ,UAAU;AAEpC,QAAI,aAAa,GAAG,EAAE,GAAG,MAAM,SAAS,EAAE,MAAM,SAAS,eAAe;AACpE;IACJ;AACA,QAAI,YAAY,QAAW;AACvB,gBAAU,EAAE;IAChB,WAAW,YAAY,EAAE,KAAK;AAC1B,aAAO;IACX;EACJ;AACA,SAAO;AACX;;;ACrxBA;AAGM,IAAO,iBAAP,MAAqB;EAA3B,cAAA;AAGY,SAAA,YAAoC,CAAA;EAwFhD;EAtFI,IAAI,UAAO;AAlBf;AAmBQ,YAAO,UAAK,UAAU,KAAK,UAAU,SAAS,CAAC,MAAxC,YAA6C,KAAK;EAC7D;EAEA,cAAc,OAAa;AACvB,SAAK,WAAW,IAAI,gBAAgB,KAAK;AACzC,SAAK,SAAS,OAAO,KAAK;AAC1B,SAAK,YAAY,CAAC,KAAK,QAAQ;AAC/B,WAAO,KAAK;EAChB;EAEA,mBAAmB,SAAwB;AACvC,UAAM,gBAAgB,IAAI,qBAAoB;AAC9C,kBAAc,gBAAgB;AAC9B,kBAAc,OAAO,KAAK;AAC1B,SAAK,QAAQ,QAAQ,KAAK,aAAa;AACvC,SAAK,UAAU,KAAK,aAAa;AACjC,WAAO;EACX;EAEA,cAAc,OAAe,SAAyB;AAClD,UAAM,WAAW,IAAI,gBAAgB,MAAM,aAAa,MAAM,MAAM,QAAQ,aAAa,KAAK,GAAG,MAAM,WAAW,CAAC,OAAO;AAC1H,aAAS,gBAAgB;AACzB,aAAS,OAAO,KAAK;AACrB,SAAK,QAAQ,QAAQ,KAAK,QAAQ;AAClC,WAAO;EACX;EAEA,WAAW,MAAa;AACpB,UAAM,SAAS,KAAK;AACpB,QAAI,QAAQ;AACR,YAAM,QAAQ,OAAO,QAAQ,QAAQ,IAAI;AACzC,UAAI,SAAS,GAAG;AACZ,eAAO,QAAQ,OAAO,OAAO,CAAC;MAClC;IACJ;EACJ;EAEA,eAAe,QAAgB;AAC3B,UAAM,QAAuB,CAAA;AAC7B,eAAW,SAAS,QAAQ;AACxB,YAAM,WAAW,IAAI,gBAAgB,MAAM,aAAa,MAAM,MAAM,QAAQ,aAAa,KAAK,GAAG,MAAM,WAAW,IAAI;AACtH,eAAS,OAAO,KAAK;AACrB,YAAM,KAAK,QAAQ;IACvB;AACA,QAAI,UAA4B,KAAK;AACrC,QAAI,QAAQ;AAEZ,QAAI,QAAQ,QAAQ,SAAS,GAAG;AAC5B,cAAQ,QAAQ,KAAK,GAAG,KAAK;AAC7B;IACJ;AAGA,WAAO,QAAQ,WAAW;AACtB,YAAM,QAAQ,QAAQ,UAAU,QAAQ,QAAQ,OAAO;AACvD,UAAI,QAAQ,GAAG;AAEX,gBAAQ,UAAU,QAAQ,OAAO,OAAO,GAAG,GAAG,KAAK;AACnD,gBAAQ;AACR;MACJ;AACA,gBAAU,QAAQ;IACtB;AAGA,QAAI,CAAC,OAAO;AACR,WAAK,SAAS,QAAQ,QAAQ,GAAG,KAAK;IAC1C;EACJ;EAEA,UAAU,MAAoF;AAC1F,UAAM,UAAmB,KAAK;AAG9B,QAAI,OAAO,KAAK,UAAU,YAAY,CAAC,KAAK,YAAY;AACpD,WAAK,QAAQ,UAAmB;IACpC;AACA,SAAK,WAAW;AAChB,UAAM,OAAO,KAAK,UAAU,IAAG;AAG/B,SAAI,6BAAM,QAAQ,YAAW,GAAG;AAC5B,WAAK,WAAW,IAAI;IACxB;EACJ;;AAGE,IAAgB,kBAAhB,MAA+B;EAWjC,IAAI,SAAM;AACN,WAAO;EACX;EAEA,IAAI,UAAO;AAzHf;AA0HQ,UAAM,OAAO,SAAO,UAAK,aAAL,mBAAe,WAAU,WAAW,KAAK,YAAW,UAAK,cAAL,mBAAgB;AACxF,QAAI,CAAC,MAAM;AACP,YAAM,IAAI,MAAM,yCAAyC;IAC7D;AACA,WAAO;EACX;EAEA,IAAI,QAAQ,OAA0B;AAClC,SAAK,WAAW;EACpB;EAEA,IAAI,OAAI;AACJ,WAAO,KAAK,KAAK,SAAS,UAAU,KAAK,QAAQ,KAAK,GAAG;EAC7D;;AAGE,IAAO,kBAAP,cAA+B,gBAAe;EAChD,IAAI,SAAM;AACN,WAAO,KAAK;EAChB;EAEA,IAAI,SAAM;AACN,WAAO,KAAK;EAChB;EAEA,IAAI,MAAG;AACH,WAAO,KAAK,UAAU,KAAK;EAC/B;EAEA,IAAa,SAAM;AACf,WAAO,KAAK;EAChB;EAEA,IAAI,YAAS;AACT,WAAO,KAAK;EAChB;EAEA,IAAI,QAAK;AACL,WAAO,KAAK;EAChB;EAQA,YAAY,QAAgB,QAAgB,OAAc,WAAsB,SAAS,OAAK;AAC1F,UAAK;AACL,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,aAAa;AAClB,SAAK,UAAU;AACf,SAAK,SAAS;EAClB;;AAGE,IAAO,uBAAP,cAAoC,gBAAe;EAAzD,cAAA;;AACa,SAAA,UAAqB,IAAI,iBAAiB,IAAI;EAgD3D;EA7CI,IAAI,SAAM;AAvLd;AAwLQ,YAAO,gBAAK,uBAAL,mBAAyB,WAAzB,YAAmC;EAC9C;EAEA,IAAI,SAAM;AACN,WAAO,KAAK,MAAM,KAAK;EAC3B;EAEA,IAAI,MAAG;AA/LX;AAgMQ,YAAO,gBAAK,sBAAL,mBAAwB,QAAxB,YAA+B;EAC1C;EAEA,IAAI,QAAK;AACL,UAAM,YAAY,KAAK;AACvB,UAAM,WAAW,KAAK;AACtB,QAAI,aAAa,UAAU;AACvB,UAAI,KAAK,gBAAgB,QAAW;AAChC,cAAM,EAAE,OAAO,WAAU,IAAK;AAC9B,cAAM,EAAE,OAAO,UAAS,IAAK;AAC7B,aAAK,cAAc,EAAE,OAAO,WAAW,OAAO,KAAK,UAAU,IAAI,OAAO,WAAW,MAAM,OAAO,WAAW,QAAQ,UAAU,IAAG;MACpI;AACA,aAAO,KAAK;IAChB,OAAO;AACH,aAAO,EAAE,OAAO,SAAS,OAAO,GAAG,CAAC,GAAG,KAAK,SAAS,OAAO,GAAG,CAAC,EAAC;IACrE;EACJ;EAEA,IAAY,qBAAkB;AAC1B,eAAW,SAAS,KAAK,SAAS;AAC9B,UAAI,CAAC,MAAM,QAAQ;AACf,eAAO;MACX;IACJ;AACA,WAAO,KAAK,QAAQ,CAAC;EACzB;EAEA,IAAY,oBAAiB;AACzB,aAAS,IAAI,KAAK,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;AAC/C,YAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,UAAI,CAAC,MAAM,QAAQ;AACf,eAAO;MACX;IACJ;AACA,WAAO,KAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC;EAC/C;;AAGJ,IAAM,mBAAN,MAAM,0BAAyB,MAAc;EAGzC,YAAY,QAAwB;AAChC,UAAK;AACL,SAAK,SAAS;AACd,WAAO,eAAe,MAAM,kBAAiB,SAAS;EAC1D;EAES,QAAQ,OAAgB;AAC7B,SAAK,WAAW,KAAK;AACrB,WAAO,MAAM,KAAK,GAAG,KAAK;EAC9B;EAES,WAAW,OAAgB;AAChC,SAAK,WAAW,KAAK;AACrB,WAAO,MAAM,QAAQ,GAAG,KAAK;EACjC;EAES,OAAO,OAAe,UAAkB,OAAgB;AAC7D,SAAK,WAAW,KAAK;AACrB,WAAO,MAAM,OAAO,OAAO,OAAO,GAAG,KAAK;EAC9C;EAEQ,WAAW,OAAgB;AAC/B,eAAW,QAAQ,OAAO;AACJ,WAAM,YAAY,KAAK;IAC7C;EACJ;;AAGE,IAAO,kBAAP,cAA+B,qBAAoB;EAGrD,IAAa,OAAI;AACb,WAAO,KAAK,MAAM,UAAU,KAAK,QAAQ,KAAK,GAAG;EACrD;EAEA,IAAI,WAAQ;AACR,WAAO,KAAK;EAChB;EAEA,YAAY,OAAc;AACtB,UAAK;AAXD,SAAA,QAAQ;AAYZ,SAAK,QAAQ,wBAAS;EAC1B;;;;ACnPG,IAAM,iBAAiB,uBAAO,UAAU;AAkB/C,SAAS,eAAe,MAA4C;AAChE,SAAO,KAAK,UAAU;AAC1B;AA4EA,IAAM,aAAa;AACnB,IAAM,iBAAiB,CAAC,SAAyB,KAAK,SAAS,UAAU,IAAI,OAAO,OAAO;AAErF,IAAgB,wBAAhB,MAAqC;EASvC,YAAY,UAA+B,YAAmB;AA5IlE;AAuIc,SAAA,mBAA2C,oBAAI,IAAG;AAElD,SAAA,WAAW,oBAAI,IAAG;AAIxB,SAAK,QAAQ,SAAS,OAAO;AAC7B,UAAM,SAAS,KAAK,MAAM;AAC1B,UAAM,aAAa,SAAS,iBAAiB,SAAS;AACtD,SAAI,cAAS,OAAO,UAAU,oBAA1B,mBAA2C,SAAS,YAAY;AAChE,WAAK,UAAU,IAAI,gBAAgB,QAAQ,iCACpC,SAAS,OAAO,eADoB;QAEvC,iBAAiB;QACjB,sBAAsB,SAAS,OAAO;UACvC,YAAY,SAAS,OAAO,UAAU,gBAAgB,WAAW,WAAW,SAAS,iBAAiB,UAAU,CAAC;IACxH,OAAO;AACH,WAAK,UAAU,IAAI,kBAAkB,QAAQ,iCACtC,SAAS,OAAO,eADsB;QAEzC,iBAAiB;QACjB,sBAAsB,SAAS,OAAO;UACvC,UAAU;IACjB;EACJ;EAEA,aAAa,KAAa,SAA2B;AACjD,SAAK,QAAQ,OAAO,KAAK,OAAO;EACpC;EAEA,SAAS,KAAa,UAAgC;AAClD,SAAK,QAAQ,WAAW,KAAK,QAAQ;EACzC;EAEA,KAAK,KAAa,UAAgC;AAC9C,SAAK,QAAQ,SAAS,KAAK,QAAQ;EACvC;EAEA,WAAW,KAAa,UAAgC;AACpD,SAAK,QAAQ,eAAe,KAAK,QAAQ;EAC7C;EAOA,QAAQ,MAAY;AAChB,WAAO,KAAK,SAAS,IAAI,IAAI;EACjC;EAEA,cAAW;AACP,WAAO,KAAK,QAAQ;EACxB;EAEA,IAAI,kBAAe;AACf,WAAO,KAAK;EAChB;EAEA,eAAY;AACR,WAAQ,KAAK,QAAgB;EACjC;EAEA,WAAQ;AACJ,SAAK,QAAQ,iBAAgB;EACjC;;AAYE,IAAO,gBAAP,cAA6B,sBAAqB;EAUpD,IAAY,UAAO;AACf,WAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;EAC3C;EAEA,YAAY,UAA6B;AACrC,UAAM,UAAU,KAAK;AAXR,SAAA,cAAc,IAAI,eAAc;AAEzC,SAAA,QAAe,CAAA;AACf,SAAA,gBAAgB,oBAAI,IAAG;AACvB,SAAA,qBAAqB,oBAAI,IAAG;AAQhC,SAAK,SAAS,SAAS,WAAW;AAClC,SAAK,YAAY,SAAS,OAAO;AACjC,SAAK,gBAAgB,SAAS,OAAO;EACzC;EAEA,KAAK,MAA8B,MAAc;AAC7C,UAAM,OAAO,KAAK,gBAAgB,IAAI;AACtC,QAAI,YAAgC;AACpC,QAAI,YAAY,IAAI,GAAG;AACnB,kBAAY,KAAK;AACjB,WAAK,sBAAsB,IAAI;IACnC;AACA,UAAM,aAAa,KAAK,QAAQ,YAAY,eAAe,KAAK,IAAI,GAAG,KAAK,oBAAoB,MAAM,WAAW,IAAI,EAAE,KAAK,IAAI,CAAC;AACjI,SAAK,SAAS,IAAI,KAAK,MAAM,UAAU;AACvC,QAAI,aAAa,IAAI,KAAK,KAAK,OAAO;AAClC,WAAK,WAAW;IACpB;AACA,WAAO;EACX;EAEQ,sBAAsB,MAAe;AACzC,UAAM,OAAO,KAAK;AAClB,UAAMI,OAAM,oBAAI,IAAG;AACnB,aAAS,IAAI,GAAG,IAAI,KAAK,UAAU,YAAY,QAAQ,KAAK;AACxD,YAAM,aAAa,KAAK,UAAU,YAAY,CAAC;AAC/C,iBAAW,WAAW,WAAW,WAAW;AACxC,QAAAA,KAAI,IAAI,QAAQ,OAAO;UACnB,YAAY;UACZ,YAAY,WAAW,kBAAkB;SAC5C;MACL;IACJ;AACA,SAAK,mBAAmB,IAAI,MAAMA,IAAG;EACzC;EAEQ,gBAAgB,MAA4B;AAChD,QAAI,YAAY,IAAI,GAAG;AACnB,aAAO,YAAY,IAAI;IAC3B,WAAW,KAAK,UAAU;AACtB,aAAO;IACX,WAAW,eAAe,IAAI,GAAG;AAC7B,aAAO;IACX,OAAO;AACH,aAAO,YAAY,IAAI;IAC3B;EACJ;EAEA,MAAmC,OAAe,UAAyB,CAAA,GAAE;AACzE,SAAK,YAAY,cAAc,KAAK;AACpC,UAAM,cAAc,KAAK,cAAc,KAAK,MAAM,SAAS,KAAK;AAChE,SAAK,QAAQ,QAAQ,YAAY;AACjC,UAAM,aAAa,QAAQ,OAAO,KAAK,SAAS,IAAI,QAAQ,IAAI,IAAI,KAAK;AACzE,QAAI,CAAC,YAAY;AACb,YAAM,IAAI,MAAM,QAAQ,OAAO,4BAA4B,QAAQ,IAAI,MAAM,yBAAyB;IAC1G;AACA,UAAM,SAAS,KAAK,QAAQ,UAAU;AACtC,SAAK,YAAY,eAAe,YAAY,MAAM;AAClD,SAAK,gBAAgB,MAAK;AAC1B,SAAK,cAAc;AACnB,2BAAuB,QAAQ,EAAE,MAAM,KAAI,CAAE;AAC7C,WAAO;MACH,OAAO;MACP,aAAa,YAAY;MACzB,aAAa,YAAY;MACzB,cAAc,KAAK,QAAQ;;EAEnC;EAEQ,QAAQ,MAAgB;AAC5B,QAAI,SAAS,KAAK,QAAQ,KAAK,IAAI;AACnC,QAAI,KAAK,MAAM,SAAS,GAAG;AAGvB,eAAS,KAAK,UAAS;IAC3B;AAEA,QAAI,WAAW,QAAW;AACtB,YAAM,IAAI,MAAM,uBAAuB;IAC3C,WAAW,KAAK,MAAM,SAAS,GAAG;AAC9B,YAAM,IAAI,MAAM,yCAAyC;IAC7D;AACA,WAAO;EACX;EAEQ,oBAAoB,OAAoC,WAA+B,gBAAwB;AACnH,WAAO,CAAC,SAAQ;AAEZ,YAAM,aAAa,CAAC,KAAK,YAAW,KAAM,UAAU;AACpD,UAAI,YAAY;AACZ,cAAM,OAAY,EAAE,MAAK;AACzB,aAAK,MAAM,KAAK,IAAI;AACpB,YAAI,UAAU,gBAAgB;AAC1B,eAAK,QAAQ;QACjB,WAAW,cAAc,QAAW;AAChC,eAAK,aAAa;QACtB;MACJ;AAGA,qBAAe,IAAI;AAGnB,aAAO,aAAa,KAAK,UAAS,IAAK;IAC3C;EACJ;EAEQ,oBAAoB,OAAa;AACrC,UAAM,eAAe,KAAK,YAAa;AACvC,QAAI,CAAC,aAAa,QAAQ;AACtB,aAAO,CAAA;IACX;AACA,UAAM,SAAS,MAAM;AACrB,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC1C,YAAMC,SAAQ,aAAa,CAAC;AAC5B,UAAIA,OAAM,cAAc,QAAQ;AAC5B,eAAO,aAAa,OAAO,GAAG,CAAC;MACnC;IACJ;AACA,WAAO,aAAa,OAAO,GAAG,aAAa,MAAM;EACrD;EAEA,QAAQ,KAAa,WAAsB,SAAwB;AAC/D,UAAM,QAAQ,KAAK,QAAQ,YAAY,KAAK,SAAS;AACrD,QAAI,CAAC,KAAK,YAAW,KAAM,KAAK,aAAa,KAAK,GAAG;AAKjD,YAAM,eAAe,KAAK,oBAAoB,KAAK;AACnD,WAAK,YAAY,eAAe,YAAY;AAC5C,YAAM,WAAW,KAAK,YAAY,cAAc,OAAO,OAAO;AAC9D,YAAM,EAAE,YAAY,SAAQ,IAAK,KAAK,cAAc,OAAO;AAC3D,YAAM,UAAU,KAAK;AACrB,UAAI,YAAY;AACZ,cAAM,iBAAiB,UAAU,OAAO,IAAI,MAAM,QAAQ,KAAK,UAAU,QAAQ,MAAM,OAAO,QAAQ;AACtG,aAAK,OAAO,WAAW,UAAU,WAAW,SAAS,gBAAgB,UAAU,QAAQ;MAC3F,WAAW,eAAe,OAAO,GAAG;AAChC,YAAI,OAAO,MAAM;AACjB,YAAI,CAAC,UAAU,OAAO,GAAG;AACrB,iBAAO,KAAK,UAAU,QAAQ,MAAM,QAAQ,EAAE,SAAQ;QAC1D;AACA,gBAAQ,SAAS;MACrB;IACJ;EACJ;;;;;;;EAQQ,aAAa,OAAa;AAC9B,WAAO,CAAC,MAAM,wBAAwB,CAAC,MAAM,MAAM,WAAW,KAAK,OAAO,MAAM,cAAc,YAAY,CAAC,MAAM,MAAM,SAAS;EACpI;EAEA,QAAQ,KAAa,MAAkB,UAAmB,SAA0B,MAAU;AAC1F,QAAI;AACJ,QAAI,CAAC,KAAK,YAAW,KAAM,CAAC,UAAU;AAKlC,gBAAU,KAAK,YAAY,mBAAmB,OAAO;IACzD;AACA,QAAI;AACJ,QAAI;AACA,eAAS,KAAK,QAAQ,YAAY,KAAK,MAAM,IAAI;IACrD;AACI,UAAI,CAAC,KAAK,YAAW,GAAI;AAIrB,YAAI,WAAW,UAAa,CAAC,UAAU;AACnC,mBAAS,KAAK,UAAS;QAC3B;AAGA,YAAI,WAAW,UAAa,WAAW,QAAQ,SAAS,GAAG;AACvD,eAAK,yBAAyB,QAAQ,SAAS,OAAO;QAC1D;MACJ;IAGJ;EACJ;EAEQ,yBAAyB,QAAa,SAA0B,SAAyB;AAC7F,UAAM,EAAE,YAAY,SAAQ,IAAK,KAAK,cAAc,OAAO;AAC3D,QAAI,YAAY;AACZ,WAAK,OAAO,WAAW,UAAU,WAAW,SAAS,QAAQ,SAAS,QAAQ;IAClF,WAAW,CAAC,YAAY;AAMpB,YAAM,UAAU,KAAK;AACrB,UAAI,eAAe,OAAO,GAAG;AACzB,gBAAQ,SAAS,OAAO,SAAQ;MACpC,WAAW,OAAO,WAAW,YAAY,QAAQ;AAC7C,cAAM,SAAS,KAAK,sBAAsB,QAAQ,OAAO;AACzD,cAAM,UAAU;AAChB,aAAK,MAAM,IAAG;AACd,aAAK,MAAM,KAAK,OAAO;MAC3B;IACJ;EACJ;EAEA,OAAO,OAAe,QAAc;AAChC,QAAI,CAAC,KAAK,YAAW,GAAI;AACrB,UAAI,OAAO,KAAK;AAChB,UAAI,OAAO,WAAW,OAAO,UAAU;AACnC,eAAO,KAAK,UAAS;AACrB,aAAK,YAAY,WAAW,KAAK,QAAQ;AACzC,cAAM,OAAO,KAAK,YAAY,mBAAmB,MAAM;AACvD,aAAK,QAAQ,KAAK,KAAK,QAAQ;AAC/B,cAAM,UAAU,EAAE,MAAK;AACvB,aAAK,MAAM,KAAK,OAAO;AACvB,aAAK,OAAO,OAAO,UAAU,OAAO,SAAS,MAAM,KAAK,QAAQ;MACpE,OAAO;AACH,aAAK,QAAQ;MACjB;IACJ;EACJ;EAEQ,YAAS;AACb,QAAI,KAAK,YAAW,GAAI;AACpB,aAAO;IACX;AACA,UAAM,MAAM,KAAK,MAAM,IAAG;AAC1B,SAAK,YAAY,UAAU,GAAG;AAC9B,QAAI,gBAAgB,KAAK;AACrB,aAAO,KAAK,eAAe,KAAK,KAAK,mBAAmB,IAAI,IAAI,UAAU,CAAE;IAChF,WAAW,eAAe,GAAG,GAAG;AAC5B,aAAO,KAAK,UAAU,QAAQ,IAAI,OAAO,IAAI,QAAQ;IACzD,OAAO;AACH,gCAA0B,KAAK,eAAe,GAAG;IACrD;AACA,WAAO;EACX;EAEQ,eAAe,KAAmB,YAA2C;AApdzF;AAqdQ,UAAM,QAAQ,IAAI;AAClB,QAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAAG;AAE7C,aAAO;IACX;AACA,UAAM,YAAY,IAAI;AACtB,QAAI,CAAC,MAAM,QAAQ,SAAS,KAAK,MAAM,SAAS,GAAG;AAG/C,aAAO,MAAM,CAAC;IAClB;AAEA,QAAI,sBAAsB;AAC1B,QAAI,wBAAwB;AAE5B,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,YAAM,WAAW,UAAU,CAAC;AAC5B,YAAM,gBAAe,gBAAW,IAAI,QAAQ,MAAvB,YAA4B;QAC7C,YAAY;QACZ,YAAY;;AAIhB,UAAI,aAAa,aAAa,uBAAuB;AAEjD,gCAAwB,aAAa;AACrC,8BAAsB;MAC1B,WAAW,aAAa,eAAe,uBAAuB;AAE1D,YAAI,CAAC,aAAa,YAAY;AAG1B,gCAAsB;QAC1B;MAGJ;IACJ;AAGA,UAAM,gBAAgB,UAAU,MAAM,GAAG,mBAAmB;AAC5D,UAAM,iBAAiB,UAAU,MAAM,sBAAsB,CAAC;AAE9D,UAAM,YAAY,MAAM,MAAM,GAAG,sBAAsB,CAAC;AACxD,UAAM,aAAa,MAAM,MAAM,sBAAsB,CAAC;AAGtD,UAAM,YAA0B;MAC5B,YAAY,IAAI;MAChB,OAAO,IAAI;MACX,UAAU,IAAI;MACd,OAAO;MACP,WAAW;;AAEf,UAAM,aAA2B;MAC7B,YAAY,IAAI;MAChB,OAAO,IAAI;MACX,UAAU,IAAI;MACd,OAAO;MACP,WAAW;;AAIf,UAAM,WAAW,KAAK,eAAe,WAAW,UAAU;AAC1D,UAAM,YAAY,KAAK,eAAe,YAAY,UAAU;AAG5D,WAAO;MACH,OAAO,IAAI;MACX,UAAU,IAAI;MACd,MAAM;MACN,UAAU,UAAU,mBAAmB;MACvC,OAAO;;EAEf;EAEQ,cAAc,SAAwB;AAC1C,QAAI,CAAC,KAAK,cAAc,IAAI,OAAO,GAAG;AAClC,YAAM,aAAa,mBAAmB,SAAS,YAAY;AAC3D,WAAK,cAAc,IAAI,SAAS;QAC5B;QACA,UAAU,cAAc,iBAAiB,WAAW,QAAQ,IAAK,WAAW,SAAS,UAAU,UAAU,WAAY;OACxH;IACL;AACA,WAAO,KAAK,cAAc,IAAI,OAAO;EACzC;EAEQ,OAAO,UAAkB,SAAiB,OAAgB,SAAkB,UAA6B;AAC7G,UAAM,MAAM,KAAK;AACjB,QAAI;AACJ,QAAI,aAAa,YAAY,OAAO,UAAU,UAAU;AACpD,aAAO,KAAK,OAAO,eAAe,KAAK,SAAS,SAAS,KAAK;IAClE,WAAW,aAAa,WAAW,OAAO,UAAU,UAAU;AAC1D,aAAO,KAAK,OAAO,oBAAoB,KAAK,SAAS,SAAS,KAAK;IACvE,OAAO;AACH,aAAO;IACX;AACA,YAAQ,UAAU;MACd,KAAK,KAAK;AACN,YAAI,OAAO,IAAI;AACf;MACJ;MACA,KAAK,MAAM;AACP,YAAI,OAAO,IAAI;AACf;MACJ;MACA,KAAK,MAAM;AACP,YAAI,CAAC,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG;AAC9B,cAAI,OAAO,IAAI,CAAA;QACnB;AACA,YAAI,OAAO,EAAE,KAAK,IAAI;MAC1B;IACJ;EACJ;EAEQ,sBAAsB,QAAa,QAAW;AAClD,eAAW,CAAC,MAAM,aAAa,KAAK,OAAO,QAAQ,MAAM,GAAG;AACxD,YAAM,WAAW,OAAO,IAAI;AAC5B,UAAI,aAAa,QAAW;AACxB,eAAO,IAAI,IAAI;MACnB,WAAW,MAAM,QAAQ,QAAQ,KAAK,MAAM,QAAQ,aAAa,GAAG;AAChE,sBAAc,KAAK,GAAG,QAAQ;AAC9B,eAAO,IAAI,IAAI;MACnB;IACJ;AAMA,UAAM,gBAAgB,OAAO;AAC7B,QAAI,eAAe;AACf,oBAAc,UAAU;AACxB,aAAO,WAAW;IACtB;AACA,WAAO;EACX;EAEA,IAAI,mBAAgB;AAChB,WAAO,KAAK,QAAQ;EACxB;;AASE,IAAgB,qCAAhB,MAAkD;EAEpD,0BAA0B,SAKzB;AACG,WAAO,2BAA2B,0BAA0B,OAAO;EACvE;EAEA,8BAA8B,SAG7B;AACG,WAAO,2BAA2B,8BAA8B,OAAO;EAC3E;EAEA,wBAAwB,SAMvB;AACG,WAAO,2BAA2B,wBAAwB,OAAO;EACrE;EAEA,sBAAsB,SAMrB;AACG,WAAO,2BAA2B,sBAAsB,OAAO;EACnE;;AAIE,IAAO,oCAAP,cAAiD,mCAAkC;EAE5E,0BAA0B,EAAE,UAAU,OAAM,GAKpD;AACG,UAAM,cAAc,SAAS,QACvB,MAAM,SAAS,QAAQ,MACvB,SAAS,KAAK,SAAS,KAAK,IACxB,YAAY,SAAS,KAAK,UAAU,GAAG,SAAS,KAAK,SAAS,CAAC,CAAC,MAChE,kBAAkB,SAAS,IAAI;AACzC,WAAO,aAAa,WAAW,gBAAgB,OAAO,KAAK;EAC/D;EAES,8BAA8B,EAAE,eAAc,GAGtD;AACG,WAAO,qCAAqC,eAAe,KAAK;EACpE;;AASE,IAAO,0BAAP,cAAuC,sBAAqB;EAQ9D,YAAY,UAA6B;AACrC,UAAM,UAAU,IAAI;AARhB,SAAA,SAAmB,CAAA;AAEnB,SAAA,eAAkC,CAAA;AAClC,SAAA,mBAAsC,CAAA;AACtC,SAAA,iBAAiB;AACjB,SAAA,YAAY;EAIpB;EAEA,SAAM;EAEN;EAEA,YAAS;AAEL,WAAO;EACX;EAEA,MAAM,OAAa;AACf,SAAK,WAAU;AACf,UAAM,SAAS,KAAK,MAAM,SAAS,OAAO,EAAE,MAAM,UAAS,CAAE;AAC7D,SAAK,SAAS,OAAO;AACrB,SAAK,QAAQ,QAAQ,CAAC,GAAG,KAAK,MAAM;AACpC,SAAK,SAAS,KAAK,KAAK,SAAS,CAAA,CAAE;AACnC,SAAK,gBAAgB,MAAK;AAC1B,WAAO;MACH,QAAQ,KAAK;MACb,cAAc,CAAC,GAAG,KAAK,gBAAgB;MACvC,YAAY,KAAK;;EAEzB;EAEA,KAAK,MAAkB,MAAc;AACjC,UAAM,aAAa,KAAK,QAAQ,YAAY,eAAe,KAAK,IAAI,GAAG,KAAK,oBAAoB,IAAI,EAAE,KAAK,IAAI,CAAC;AAChH,SAAK,SAAS,IAAI,KAAK,MAAM,UAAU;AACvC,QAAI,KAAK,OAAO;AACZ,WAAK,WAAW;IACpB;AACA,WAAO;EACX;EAEQ,aAAU;AACd,SAAK,eAAe,CAAA;AACpB,SAAK,mBAAmB,CAAA;AACxB,SAAK,iBAAiB;AACtB,SAAK,YAAY;EACrB;EAEQ,oBAAoB,gBAAwB;AAChD,WAAO,CAAC,SAAQ;AACZ,YAAM,OAAO,KAAK,cAAa;AAC/B,UAAI;AACA,uBAAe,IAAI;MACvB;AACI,aAAK,eAAe,IAAI;MAC5B;IACJ;EACJ;EAEQ,2BAAwB;AAC5B,SAAK,aAAa,OAAO,KAAK,SAAS;EAC3C;EAEA,gBAAa;AACT,UAAM,OAAO,KAAK,aAAa;AAC/B,SAAK,YAAY;AACjB,WAAO;EACX;EAEA,eAAe,MAAY;AACvB,SAAK,yBAAwB;AAC7B,SAAK,YAAY;EACrB;EAEA,QAAQ,KAAa,WAAsB,SAAwB;AAC/D,SAAK,QAAQ,YAAY,KAAK,SAAS;AACvC,QAAI,CAAC,KAAK,YAAW,GAAI;AACrB,WAAK,mBAAmB,CAAC,GAAG,KAAK,cAAc,OAAO;AACtD,WAAK,iBAAiB,KAAK,UAAU;IACzC;EACJ;EAEA,QAAQ,KAAa,MAAkB,UAAmB,SAA0B,MAAU;AAC1F,SAAK,OAAO,OAAO;AACnB,SAAK,QAAQ,YAAY,KAAK,MAAM,IAAI;AACxC,SAAK,MAAM,OAAO;EACtB;EAEA,OAAO,SAAwB;AAC3B,QAAI,CAAC,KAAK,YAAW,GAAI;AACrB,WAAK,aAAa,KAAK,OAAO;IAClC;EACJ;EAEA,MAAM,SAAwB;AAC1B,QAAI,CAAC,KAAK,YAAW,GAAI;AACrB,YAAM,QAAQ,KAAK,aAAa,YAAY,OAAO;AACnD,UAAI,SAAS,GAAG;AACZ,aAAK,aAAa,OAAO,KAAK;MAClC;IACJ;EACJ;EAEA,IAAI,UAAO;AACP,WAAQ,KAAK,QAAgB;EACjC;;AAGJ,IAAM,gBAA+B;EACjC,iBAAiB;EACjB,sBAAsB;EACtB,iBAAiB;EACjB,sBAAsB,IAAI,kCAAiC;;AAO/D,IAAM,oBAAN,cAAgC,sBAAqB;EAKjD,YAAY,QAAyB,QAAuB,YAAmB;AAC3E,UAAM,sBAAsB,UAAU,kBAAkB;AACxD,UAAM,QAAQ,gDACP,gBADO;MAEV,mBAAmB,sBACb,IAAI,qBAAqB,EAAE,cAAc,OAAO,aAAY,CAAE,IAC9D,IAAI,wBAAwB;;QAE1B,SAAS,OAAO,kBAAkB,MAAK;QAAG,IAAI;QAC9C;OACH;QACF,OACN;EACL;EAEA,IAAI,eAAY;AACZ,WAAO,KAAK;EAChB;EAEA,YAAY,MAAc,MAAgB,QAAyB;AAC/D,WAAO,KAAK,KAAK,MAAM,MAAM,MAAM;EACvC;EAEA,mBAAgB;AACZ,SAAK,oBAAmB;EAC5B;EAEA,YAAY,KAAa,WAAoB;AACzC,WAAO,KAAK,QAAQ,KAAK,WAAW,MAAS;EACjD;EAEA,YAAY,KAAa,MAAkB,MAAU;AACjD,WAAO,KAAK,QAAQ,KAAK,MAAM;MAC3B,MAAM,CAAC,IAAI;KACd;EACL;EAEA,OAAO,KAAa,SAA2B;AAC3C,SAAK,GAAG,KAAK,OAAO;EACxB;EAEA,WAAW,KAAa,UAAgC;AACpD,SAAK,OAAO,KAAK,QAAQ;EAC7B;EAEA,SAAS,KAAa,UAAgC;AAClD,SAAK,KAAK,KAAK,QAAQ;EAC3B;EAEA,eAAe,KAAa,UAAgC;AACxD,SAAK,WAAW,KAAK,QAAQ;EACjC;EACA,KAAK,MAAgB;AACjB,WAAO,KAAK,KAAK,MAAM,CAAA,CAAE;EAC7B;;AAGJ,IAAM,kBAAN,cAA8B,kBAAiB;EAE3C,YAAY,QAAyB,QAAuB,YAAqB,MAAmB;AAChG,UAAM,QAAQ,QAAQ,UAAU;AAChC,SAAK,OAAO;EAChB;EAES,KAAK,MAAgB;AAC1B,SAAK,KAAK,MAAK;AACf,SAAK,KAAK,aAAa,KAAK,SAAS,IAAI,CAAC;AAC1C,QAAI;AACA,aAAO,MAAM,KAAK,IAAI;IAC1B;AAEI,WAAK,KAAK,YAAY,KAAK,SAAS,IAAI,CAAC;AACzC,WAAK,KAAK,KAAI;IAClB;EACJ;EAEQ,SAAS,MAAS;AACtB,WAAO,KAAK;EAChB;EACmB,QAAmC,KAAa,YAAmC,SAAiC;AACnI,SAAK,KAAK,aAAa,KAAK,SAAS,UAAU,CAAC;AAChD,QAAI;AACA,aAAO,MAAM,QAAiB,KAAK,YAAY,OAAO;IAC1D;AAEI,WAAK,KAAK,YAAY,KAAK,SAAS,UAAU,CAAC;IACnD;EACJ;;;;AC/1BE,SAAU,aAAmC,SAAkB,QAAW,QAA2B;AACvG,QAAM,gBAA+B;IACjC;IACA;IACA,WAAW,oBAAI,IAAG;;AAEtB,aAAW,eAAe,OAAO;AACjC,SAAO;AACX;AAEA,SAAS,WAAW,eAA8B,SAAgB;AAC9D,QAAM,YAAY,qBAAqB,SAAS,KAAK;AACrD,QAAM,cAAc,OAAO,QAAQ,KAAK,EAAE,OAAO,YAAY,EAAE,OAAO,UAAQ,UAAU,IAAI,IAAI,CAAC;AACjG,aAAW,QAAQ,aAAa;AAC5B,UAAM,MAAmB,iCAClB,gBADkB;MAErB,SAAS;MACT,UAAU;MACV,SAAS;MACT,MAAM;MACN,IAAI;;AAER,kBAAc,OAAO,KAAK,MAAM,aAAa,KAAK,KAAK,UAAU,CAAC;EACtE;AACA,QAAM,aAAa,OAAO,QAAQ,KAAK,EAAE,OAAO,WAAW,EAAE,OAAO,UAAQ,UAAU,IAAI,IAAI,CAAC;AAC/F,aAAW,QAAQ,YAAY;AAC3B,kBAAc,OAAO,KAAK,MAAM,eAAe,eAAe,IAAI,CAAC;EACvE;AACJ;AAEA,SAAS,eAAe,KAAoB,MAAe;AACvD,QAAM,iBAAiB,KAAK,KAAK,KAAK;AACtC,MAAI,CAAC,gBAAgB;AACjB,UAAM,IAAI,MAAM,yDAAyD,KAAK,KAAK,KAAK,QAAQ;EACpG;AACA,MAAI,eAAe,cAAc,GAAG;AAChC,UAAM,IAAI,MAAM,8CAA8C;EAClE;AAGA,QAAM,cAAc,KAAK,UAAU,YAAY,QAAQ,OAAK,EAAE,SAAS;AAEvE,QAAM,aAAoB;IACtB,OAAO;IACP,UAAU,CAAA;;AAEd,QAAM,kBAA8B;IAChC,YAAY;IACZ,OAAO;IACP,SAAS;IACT,UAAU;IACV,UAAU,KAAK;;AAInB,QAAM,aAAoB;IACtB,YAAY;IACZ,OAAO;IACP,UAAU,CAAA;IACV,aAAa;;AAEjB,aAAW,SAAS,KAAK,iBAAiB,UAAU;AAEpD,QAAM,eAA6B;IAC/B,OAAO;IACP,UAAU;;AAEd,QAAM,qBAAiC;IACnC,YAAY;IACZ,OAAO;IACP,SAAS;IACT,UAAU;IACV,UAAU;;AAGd,QAAM,kBAA8B,iCAC7B,kBAD6B;IAEhC,YAAY;;AAEhB,aAAW,SAAS,KAAK,oBAAoB,eAAe;AAC5D,QAAM,SAAS,YAAY,IAAI,OAAK,IAAI,OAAO,EAAE,KAAK,CAAC;AACvD,QAAM,SAAiC,OAAO,IAAI,CAAC,OAAO,WAAW;IACjE,KAAK,MAAM,IAAI,OAAO,QAAQ,OAAO,OAAO,kBAAkB;IAChE;AACF,MAAI;AACJ,SAAO,CAAC,SAAQ;AACZ,gCAAA,UAAY,QAAQ,KAAK,cAAc;AACvC,QAAI,OAAO,QAAQ,GAAG,SAAS,OAAO,iBAAiB,IAAI;AAC3D,QAAI,OAAO,KAAK,GAAG;MACf,KAAK,MAAK;AACN,YAAI,OAAO,aAAa,GAAG,MAAM;AACjC,YAAI,OAAO,QAAQ,GAAG,SAAS,OAAO,iBAAiB,IAAI;MAC/D;KACH;EACL;AACJ;AAEA,SAAS,aAAa,KAAkB,SAA0B,cAAc,OAAK;AACjF,MAAI;AACJ,MAAI,UAAU,OAAO,GAAG;AACpB,aAAS,aAAa,KAAK,OAAO;EACtC,WAAW,SAAS,OAAO,GAAG;AAC1B,aAAS,YAAY,KAAK,OAAO;EACrC,WAAW,aAAa,OAAO,GAAG;AAC9B,aAAS,aAAa,KAAK,QAAQ,QAAQ;EAC/C,WAAW,iBAAiB,OAAO,GAAG;AAClC,aAAS,oBAAoB,KAAK,OAAO;EAC7C,WAAW,WAAW,OAAO,GAAG;AAC5B,aAAS,cAAc,KAAK,OAAO;EACvC,WAAW,eAAe,OAAO,GAAG;AAChC,aAAS,kBAAkB,KAAK,OAAO;EAC3C,WAAW,iBAAiB,OAAO,GAAG;AAClC,aAAS,oBAAoB,KAAK,OAAO;EAC7C,WAAW,QAAQ,OAAO,GAAG;AACzB,aAAS,WAAW,KAAK,OAAO;EACpC,WAAU,YAAY,OAAO,GAAG;AAC5B,UAAM,MAAM,IAAI;AAChB,aAAS,MAAM,IAAI,OAAO,QAAQ,KAAK,KAAK,OAAO;EACvD,OAAO;AACH,UAAM,IAAI,kBAAkB,QAAQ,UAAU,4BAA4B,QAAQ,KAAK,EAAE;EAC7F;AACA,SAAO,KAAK,KAAK,cAAc,SAAY,kBAAkB,OAAO,GAAG,QAAQ,QAAQ,WAAW;AACtG;AAEA,SAAS,YAAY,KAAkB,QAAc;AACjD,QAAM,aAAa,YAAY,MAAM;AACrC,SAAO,MAAM,IAAI,OAAO,OAAO,YAAY,MAAM;AACrD;AAEA,SAAS,cAAc,KAAkB,UAAkB;AACvD,QAAM,OAAO,SAAS,KAAK;AAC3B,MAAI,qBAAqB,IAAI,GAAG;AAC5B,UAAM,MAAM,IAAI;AAChB,UAAM,WAAW,aAAa,IAAI,KAAK,KAAK;AAC5C,UAAM,YAAY,SAAS,UAAU,SAAS,IAAI,uBAAuB,MAAM,SAAS,SAAS,IAAI,OAAO,CAAA;AAC5G,QAAI;AACJ,WAAO,CAAC,SAAQ;AACZ,kCAAA,UAAY,QAAQ,KAAK,IAAI;AAC7B,UAAI,OAAO,QAAQ,KAAK,SAAS,UAAU,UAAU,UAAU,IAAI,CAAC;IACxE;EACJ,WAAW,eAAe,IAAI,GAAG;AAC7B,UAAM,MAAM,IAAI;AAChB,UAAM,SAAS,SAAS,KAAK,KAAK,IAAI;AACtC,WAAO,MAAM,IAAI,OAAO,QAAQ,KAAK,QAAQ,QAAQ;EACzD,WAAW,CAAC,MAAM;AACd,UAAM,IAAI,kBAAkB,SAAS,UAAU,mBAAmB,SAAS,KAAK,QAAQ,EAAE;EAC9F,OAAO;AACH,sBAAkB,IAAI;EAC1B;AACJ;AAEA,SAAS,uBAAuB,MAA8B,WAA0B;AACpF,QAAM,oBAAoB,UAAU,KAAK,SAAO,IAAI,YAAY;AAChE,MAAI,mBAAmB;AACnB,UAAM,kBAAkB,UAAU,IAAI,SAAI;AAjMlD;AAiMsD;QAC1C,gBAAe,eAAI,cAAJ,mBAAe,QAAf,mBAAoB;QACnC,WAAW,eAAe,IAAI,KAAK;;KACrC;AACF,WAAO,CAAC,SAAQ;AACZ,YAAM,WAAiB,CAAA;AACvB,iBAAW,EAAE,eAAe,UAAS,KAAM,iBAAiB;AACxD,YAAI,eAAe;AACf,mBAAS,aAAa,IAAI,UAAU,IAAI;QAC5C;MACJ;AACA,aAAO;IACX;EACJ,OAAO;AACH,UAAM,aAAa,UAAU,IAAI,SAAO,eAAe,IAAI,KAAK,CAAC;AACjE,WAAO,CAAC,SAAQ;AACZ,YAAM,WAAiB,CAAA;AACvB,eAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AACxC,YAAI,IAAI,KAAK,WAAW,QAAQ;AAC5B,gBAAM,gBAAgB,KAAK,WAAW,CAAC,EAAE;AACzC,gBAAM,YAAY,WAAW,CAAC;AAC9B,mBAAS,aAAa,IAAI,UAAU,IAAI;QAC5C;MACJ;AACA,aAAO;IACX;EACJ;AACJ;AAOA,SAAS,eAAe,WAAoB;AACxC,MAAI,cAAc,SAAS,GAAG;AAC1B,UAAM,OAAO,eAAe,UAAU,IAAI;AAC1C,UAAM,QAAQ,eAAe,UAAU,KAAK;AAC5C,WAAO,CAAC,SAAU,KAAK,IAAI,KAAK,MAAM,IAAI;EAC9C,WAAW,cAAc,SAAS,GAAG;AACjC,UAAM,OAAO,eAAe,UAAU,IAAI;AAC1C,UAAM,QAAQ,eAAe,UAAU,KAAK;AAC5C,WAAO,CAAC,SAAU,KAAK,IAAI,KAAK,MAAM,IAAI;EAC9C,WAAW,WAAW,SAAS,GAAG;AAC9B,UAAM,QAAQ,eAAe,UAAU,KAAK;AAC5C,WAAO,CAAC,SAAS,CAAC,MAAM,IAAI;EAChC,WAAW,qBAAqB,SAAS,GAAG;AACxC,UAAM,OAAO,UAAU,UAAU,IAAK;AACtC,WAAO,CAAC,SAAS,SAAS,UAAa,KAAK,IAAI,MAAM;EAC1D,WAAW,iBAAiB,SAAS,GAAG;AACpC,UAAM,QAAQ,QAAQ,UAAU,IAAI;AACpC,WAAO,MAAM;EACjB;AACA,oBAAkB,SAAS;AAC/B;AAEA,SAAS,kBAAkB,KAAkB,cAA0B;AACnE,MAAI,aAAa,SAAS,WAAW,GAAG;AACpC,WAAO,aAAa,KAAK,aAAa,SAAS,CAAC,CAAC;EACrD,OAAO;AACH,UAAM,UAA8B,CAAA;AAEpC,eAAW,WAAW,aAAa,UAAU;AACzC,YAAM,mBAAqC;;;QAGvC,KAAK,aAAa,KAAK,SAAS,IAAI;;AAExC,YAAM,QAAQ,kBAAkB,OAAO;AACvC,UAAI,OAAO;AACP,yBAAiB,OAAO,eAAe,KAAK;MAChD;AACA,cAAQ,KAAK,gBAAgB;IACjC;AAEA,UAAM,MAAM,IAAI;AAChB,WAAO,CAAC,SAAS,IAAI,OAAO,aAAa,KAAK,QAAQ,IAAI,YAAS;AAC/D,YAAM,MAAuB;QACzB,KAAK,MAAM,OAAO,IAAI,IAAI;;AAE9B,YAAM,OAAO,OAAO;AACpB,UAAI,MAAM;AACN,YAAI,OAAO,MAAM,KAAK,IAAI;MAC9B;AACA,aAAO;IACX,CAAC,CAAC;EACN;AACJ;AAEA,SAAS,oBAAoB,KAAkB,OAAqB;AAChE,MAAI,MAAM,SAAS,WAAW,GAAG;AAC7B,WAAO,aAAa,KAAK,MAAM,SAAS,CAAC,CAAC;EAC9C;AACA,QAAM,UAA8B,CAAA;AAEpC,aAAW,WAAW,MAAM,UAAU;AAClC,UAAM,mBAAqC;;;MAGvC,KAAK,aAAa,KAAK,SAAS,IAAI;;AAExC,UAAM,QAAQ,kBAAkB,OAAO;AACvC,QAAI,OAAO;AACP,uBAAiB,OAAO,eAAe,KAAK;IAChD;AACA,YAAQ,KAAK,gBAAgB;EACjC;AAEA,QAAM,QAAQ,IAAI;AAElB,QAAM,SAAS,CAAC,UAAkB,YAAuB;AACrD,UAAM,UAAU,QAAQ,aAAY,EAAG,KAAK,GAAG;AAC/C,WAAO,UAAU,QAAQ,IAAI,OAAO;EACxC;AACA,QAAM,eAAuB,CAAC,SAAS,IAAI,OAAO,aAAa,OAAO,QAAQ,IAAI,CAAC,QAAQ,QAAO;AAC9F,UAAM,MAAuB,EAAE,KAAK,MAAM,KAAI;AAC9C,UAAM,SAAS,IAAI;AACnB,QAAI,MAAM,MAAK;AACX,aAAO,IAAI,IAAI;AACf,UAAI,CAAC,OAAO,YAAW,GAAI;AACvB,cAAM,MAAM,OAAO,OAAO,MAAM;AAChC,YAAI,CAAC,OAAO,gBAAgB,IAAI,GAAG,GAAG;AAElC,iBAAO,gBAAgB,IAAI,KAAK,CAAA,CAAE;QACtC;AACA,cAAM,aAAa,OAAO,gBAAgB,IAAI,GAAG;AACjD,YAAI,QAAO,yCAAa,UAAS,aAAa;AAE1C,qBAAW,GAAG,IAAI;QACtB;MACJ;IACJ;AACA,UAAM,OAAO,OAAO;AACpB,QAAI,MAAM;AACN,UAAI,OAAO,MAAM,KAAK,IAAI;IAC9B,OAAO;AACH,UAAI,OAAO,MAAK;AACZ,cAAM,sBAAsB,OAAO,gBAAgB,IAAI,OAAO,OAAO,MAAM,CAAC;AAC5E,cAAM,QAAQ,EAAC,2DAAsB;AACrC,eAAO;MACX;IACJ;AACA,WAAO;EACX,CAAC,CAAC;AACF,QAAM,UAAU,KAAK,KAAK,kBAAkB,KAAK,GAAG,cAAc,GAAG;AACrE,SAAO,CAAC,SAAQ;AACZ,YAAQ,IAAI;AACZ,QAAI,CAAC,IAAI,OAAO,YAAW,GAAI;AAC3B,UAAI,OAAO,gBAAgB,OAAO,OAAO,OAAO,IAAI,MAAM,CAAC;IAC/D;EACJ;AACJ;AAEA,SAAS,WAAW,KAAkB,OAAY;AAC9C,QAAM,UAAU,MAAM,SAAS,IAAI,OAAK,aAAa,KAAK,CAAC,CAAC;AAC5D,SAAO,CAAC,SAAS,QAAQ,QAAQ,YAAU,OAAO,IAAI,CAAC;AAC3D;AAEA,SAAS,kBAAkB,SAAwB;AAC/C,MAAI,QAAQ,OAAO,GAAG;AAClB,WAAO,QAAQ;EACnB;AACA,SAAO;AACX;AAEA,SAAS,oBAAoB,KAAkB,UAA0B,WAAW,SAAS,UAAQ;AACjG,MAAI,CAAC,UAAU;AACX,QAAI,CAAC,SAAS,KAAK,KAAK;AACpB,YAAM,IAAI,MAAM,0CAA0C,SAAS,KAAK,QAAQ;IACpF;AACA,UAAM,aAAa,mBAAmB,SAAS,KAAK,GAAG;AACvD,UAAM,iBAAiB,yCAAY;AACnC,QAAI,CAAC,gBAAgB;AACjB,YAAM,IAAI,MAAM,8CAA8C,YAAY,SAAS,KAAK,GAAG,CAAC;IAChG;AACA,WAAO,oBAAoB,KAAK,UAAU,cAAc;EAC5D,WAAW,WAAW,QAAQ,KAAK,aAAa,SAAS,KAAK,GAAG,GAAG;AAEhE,UAAM,OAAO,SAAS,KAAK;AAC3B,UAAM,MAAM,IAAI;AAChB,QAAI;AACJ,WAAO,CAAC,SAAQ;AACZ,kCAAA,UAAY,QAAQ,KAAK,IAAI;AAC7B,UAAI,OAAO,QAAQ,KAAK,SAAS,OAAO,UAAU,IAAI;IAC1D;EACJ,WAAW,WAAW,QAAQ,KAAK,eAAe,SAAS,KAAK,GAAG,GAAG;AAClE,UAAM,MAAM,IAAI;AAChB,UAAM,eAAe,SAAS,KAAK,SAAS,KAAK,IAAI,IAAI;AACzD,WAAO,MAAM,IAAI,OAAO,QAAQ,KAAK,cAAc,QAAQ;EAC/D,WAAW,UAAU,QAAQ,GAAG;AAC5B,UAAM,MAAM,IAAI;AAChB,UAAM,UAAU,SAAS,KAAK,SAAS,KAAK;AAC5C,WAAO,MAAM,IAAI,OAAO,QAAQ,KAAK,SAAS,QAAQ;EAC1D,OACK;AACD,UAAM,IAAI,MAAM,wCAAwC;EAC5D;AACJ;AAEA,SAAS,aAAa,KAAkB,SAAgB;AACpD,QAAM,MAAM,IAAI;AAChB,QAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK;AACtC,MAAI,CAAC,OAAO;AACR,UAAM,IAAI,MAAM,uCAAuC,QAAQ,KAAK;EACxE;AACA,SAAO,MAAM,IAAI,OAAO,QAAQ,KAAK,OAAO,OAAO;AACvD;AAEA,SAAS,KAAK,KAAkB,OAA8B,QAAgB,aAAwB;AAClG,QAAM,OAAO,SAAS,eAAe,KAAK;AAE1C,MAAI,CAAC,aAAa;AACd,QAAI,MAAM;AACN,YAAM,MAAM,IAAI;AAChB,aAAO,CAAC,SAAS,IAAI,OAAO,aAAa,KAAK;QAC1C;UACI,KAAK,MAAM,OAAO,IAAI;UACtB,MAAM,MAAM,KAAK,IAAI;;QAEzB;UACI,KAAK,UAAS;UACd,MAAM,MAAM,CAAC,KAAK,IAAI;;OAE7B;IACL,OAAO;AACH,aAAO;IACX;EACJ;AAEA,MAAI,gBAAgB,KAAK;AACrB,UAAM,MAAM,IAAI;AAChB,WAAO,CAAC,SAAS,IAAI,OAAO,KAAK,KAAK;MAClC,KAAK,MAAM,OAAO,IAAI;MACtB,MAAM,OAAO,MAAM,KAAK,IAAI,IAAI;KACnC;EACL,WAAW,gBAAgB,KAAK;AAC5B,UAAM,MAAM,IAAI;AAChB,QAAI,MAAM;AACN,YAAM,QAAQ,IAAI;AAKlB,aAAO,CAAC,SAAS,IAAI,OAAO,aAAa,OAAO;QAC5C;UACI,KAAK,MAAM,IAAI,OAAO,WAAW,KAAK;YAClC,KAAK,MAAM,OAAO,IAAI;WACzB;UACD,MAAM,MAAM,KAAK,IAAI;;QAEzB;UACI,KAAK,UAAS;UACd,MAAM,MAAM,CAAC,KAAK,IAAI;;OAE7B;IACL,OAAO;AACH,aAAO,CAAC,SAAS,IAAI,OAAO,WAAW,KAAK;QACxC,KAAK,MAAM,OAAO,IAAI;OACzB;IACL;EACJ,WAAW,gBAAgB,KAAK;AAC5B,UAAM,MAAM,IAAI;AAChB,WAAO,CAAC,SAAS,IAAI,OAAO,SAAS,KAAK;MACtC,KAAK,MAAM,OAAO,IAAI;MACtB,MAAM,OAAO,MAAM,KAAK,IAAI,IAAI;KACnC;EACL,OAAO;AACH,sBAAkB,WAAW;EACjC;AACJ;AAEA,SAAS,QAAQ,KAAoB,SAAiD;AAClF,QAAM,OAAO,YAAY,KAAK,OAAO;AACrC,QAAM,OAAO,IAAI,OAAO,QAAQ,IAAI;AACpC,MAAI,CAAC;AAAM,UAAM,IAAI,MAAM,SAAS,IAAI,eAAe;AACvD,SAAO;AACX;AAEA,SAAS,YAAY,KAAoB,SAAiD;AACtF,MAAI,qBAAqB,OAAO,GAAG;AAC/B,WAAO,QAAQ;EACnB,WAAW,IAAI,UAAU,IAAI,OAAO,GAAG;AACnC,WAAO,IAAI,UAAU,IAAI,OAAO;EACpC,OAAO;AACH,QAAI,OAAgB;AACpB,QAAI,SAAkB,KAAK;AAC3B,QAAI,WAAmB,QAAQ;AAC/B,WAAO,CAAC,aAAa,MAAM,GAAG;AAC1B,UAAI,QAAQ,MAAM,KAAK,eAAe,MAAM,KAAK,iBAAiB,MAAM,GAAG;AACvE,cAAM,QAAQ,OAAO,SAAS,QAAQ,IAAuB;AAC7D,mBAAW,MAAM,SAAQ,IAAK,MAAM;MACxC;AACA,aAAO;AACP,eAAS,OAAO;IACpB;AACA,UAAM,OAAO;AACb,eAAW,KAAK,OAAO,MAAM;AAC7B,QAAI,UAAU,IAAI,SAAS,QAAQ;AACnC,WAAO;EACX;AACJ;AAEA,SAAS,SAAS,KAAoB,MAAY;AAC9C,QAAM,QAAQ,IAAI,OAAO,IAAI;AAC7B,MAAI,CAAC;AAAO,UAAM,IAAI,MAAM,UAAU,IAAI,eAAe;AACzD,SAAO;AACX;;;ACzeM,SAAU,uBAAuB,UAA6B;AAChE,QAAM,UAAU,SAAS;AACzB,QAAM,QAAQ,SAAS,OAAO;AAC9B,QAAM,SAAS,IAAI,wBAAwB,QAAQ;AACnD,eAAa,SAAS,QAAQ,MAAM,UAAU;AAC9C,SAAO,SAAQ;AACf,SAAO;AACX;;;ACHM,SAAU,oBAAoB,UAA6B;AAC7D,QAAM,SAAS,qBAAqB,QAAQ;AAC5C,SAAO,SAAQ;AACf,SAAO;AACX;AAMM,SAAU,qBAAqB,UAA6B;AAC9D,QAAM,UAAU,SAAS;AACzB,QAAM,QAAQ,SAAS,OAAO;AAC9B,QAAM,SAAS,IAAI,cAAc,QAAQ;AACzC,SAAO,aAAa,SAAS,QAAQ,MAAM,UAAU;AACzD;;;ACeM,IAAO,sBAAP,MAA0B;EAAhC,cAAA;AAIc,SAAA,cAAkC,CAAA;EA4GhD;EA1GI,YAAY,SAAkB,SAA6B;AACvD,UAAM,iBAAiB,OAAO,qBAAqB,SAAS,KAAK,CAAC;AAClE,UAAM,iBAA8B,KAAK,oBAAoB,cAAc;AAC3E,UAAM,SAAsB,KAAK,mBAAmB,gBAAgB,gBAAgB,OAAO;AAK3F,WAAO,KAAK,GAAG,cAAc;AAG7B,WAAO;EACX;;EAGA,kBAAkB,MAAY;AAC1B,WAAO,EAAE,aAAa,KAAK,eAAc,EAAE;EAC/C;EAEU,iBAAc;AACpB,UAAM,cAAc,CAAC,GAAG,KAAK,WAAW;AACxC,SAAK,cAAc,CAAA;AACnB,WAAO;EACX;EAEU,oBAAoB,OAA2B;AACrD,WAAO,MAAM,OAAO,cAAc,EAAE,OAAO,OAAK,CAAC,EAAE,QAAQ,EACtD,IAAI,cAAY,KAAK,mBAAmB,QAAQ,CAAC,EAAE,QAAO;EACnE;EAEU,mBAAmB,UAAsB;AAC/C,UAAM,QAAQ,cAAc,QAAQ;AACpC,UAAM,UAAU,KAAK,sBAAsB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI;AACvF,UAAM,YAAuB;MACzB,MAAM,SAAS;MACf,SAAS;;AAEb,QAAI,OAAO,YAAY,YAAY;AAC/B,gBAAU,cAAc;IAC5B;AACA,QAAI,SAAS,QAAQ;AAEjB,gBAAU,QAAQ,aAAa,KAAK,IAAI,MAAM,UAAU;IAC5D;AACA,WAAO;EACX;EAEU,sBAAsB,OAAa;AACzC,QAAI,MAAM,MAAM,SAAS,GAAG,KAAK,MAAM,MAAM,SAAS,GAAG,GAAG;AAExD,aAAO;IACX,OAAO;AACH,aAAO;IACX;EACJ;EAEU,qBAAqB,OAAa;AACxC,UAAM,cAAc,IAAI,OAAO,OAAO,MAAM,QAAQ,GAAG;AACvD,WAAO,CAAC,MAAM,WAAU;AACpB,kBAAY,YAAY;AACxB,YAAM,aAAa,YAAY,KAAK,IAAI;AACxC,aAAO;IACX;EACJ;EAEU,mBAAmB,OAA6B,gBAA6B,SAA6B;AAChH,WAAO,MAEF,OAAO,oBAAoB,EAC3B,QAAQ,UAAQ,kBAAkB,IAAI,EAAE,OAAO,SAAS,CAAC,EACzD,SAAS,OAAK,EAAE,KAAK,EAAE,QAAO,EAE9B,KAAK,CAACC,IAAG,MAAM,EAAE,MAAM,SAASA,GAAE,MAAM,MAAM,EAC9C,IAAI,aAAW,KAAK,kBAAkB,SAAS,gBAAgB,QAAQ,mCAAS,eAAe,CAAC,CAAC;EAC1G;EAEU,kBAAkB,SAAkB,gBAA6B,iBAAwB;AAC/F,UAAM,iBAAiB,KAAK,oBAAoB,SAAS,eAAe;AACxE,UAAM,YAAuB;MACzB,MAAM,QAAQ;MACd,SAAS;MACT,YAAY,KAAK,cAAc,SAAS,cAAc;;AAG1D,QAAI,OAAO,mBAAmB,YAAY;AACtC,gBAAU,cAAc;IAC5B;AAEA,WAAO;EACX;EAEU,oBAAoB,SAAkB,iBAAwB;AACpE,WAAO,kBACH,IAAI,OAAO,aAAa,QAAQ,KAAK,GAAG,GAAG,IAC3C,QAAQ;EAChB;EAEU,cAAc,SAAkB,gBAA2B;AACjE,WAAO,eAAe,OAAO,CAAC,YAAyB,UAAS;AAC5D,YAAM,UAAU,+BAAO;AACvB,WAAI,mCAAS,WAAU,eAAe,MAAM,QAAQ,SAAS,KAAK,QAAQ,KAAK,GAAG;AAC9E,mBAAW,KAAK,KAAK;MACzB;AACA,aAAO;IACX,GAAG,CAAA,CAAE;EACT;;;;ACpIE,IAAO,wBAAP,MAA4B;EAE9B,QAAQ,OAAe,SAAgB;AACnC,QAAI,UAAuC,QAAQ;AACnD,QAAI,iBAAiB,OAAO,GAAG;AAC3B,gBAAU,0BAA0B,OAAO;IAC/C;AACA,QAAI,WAAW,OAAO,GAAG;AACrB,YAAM,OAAO,QAAQ,KAAK;AAC1B,UAAI,CAAC,MAAM;AACP,cAAM,IAAI,MAAM,yCAAyC;MAC7D;AACA,aAAO,KAAK,aAAa,MAAM,OAAO,OAAO;IACjD;AACA,WAAO;EACX;;EAGU,aAAa,MAAoB,OAAe,SAAgB;AAzC9E;AA0CQ,YAAQ,KAAK,KAAK,YAAW,GAAI;MAC7B,KAAK;AAAO,eAAO,eAAe,WAAW,KAAK;MAClD,KAAK;AAAU,eAAO,eAAe,cAAc,KAAK;MACxD,KAAK;AAAM,eAAO,eAAe,UAAU,KAAK;IACpD;AACA,aAAQ,iBAAY,IAAI,MAAhB,mBAAmB,eAAe;MACtC,KAAK;AAAU,eAAO,eAAe,cAAc,KAAK;MACxD,KAAK;AAAW,eAAO,eAAe,eAAe,KAAK;MAC1D,KAAK;AAAU,eAAO,eAAe,cAAc,KAAK;MACxD,KAAK;AAAQ,eAAO,eAAe,YAAY,KAAK;MACpD;AAAS,eAAO;IACpB;EACJ;;AAGE,IAAW;CAAjB,SAAiBC,iBAAc;AAE3B,WAAgB,cAAc,OAAa;AACvC,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;AACvC,YAAM,IAAI,MAAM,OAAO,CAAC;AACxB,UAAI,MAAM,MAAM;AACZ,cAAM,KAAK,MAAM,OAAO,EAAE,CAAC;AAC3B,kBAAU,uBAAuB,EAAE;MACvC,OAAO;AACH,kBAAU;MACd;IACJ;AACA,WAAO;EACX;AAZgB,EAAAA,gBAAA,gBAAa;AAc7B,WAAS,uBAAuB,MAAY;AACxC,YAAQ,MAAM;MACV,KAAK;AAAK,eAAO;MACjB,KAAK;AAAK,eAAO;MACjB,KAAK;AAAK,eAAO;MACjB,KAAK;AAAK,eAAO;MACjB,KAAK;AAAK,eAAO;MACjB,KAAK;AAAK,eAAO;MACjB,KAAK;AAAK,eAAO;MACjB;AAAS,eAAO;IACpB;EACJ;AAEA,WAAgB,UAAU,OAAa;AACnC,QAAI,MAAM,OAAO,CAAC,MAAM,KAAK;AACzB,aAAO,MAAM,UAAU,CAAC;IAC5B,OAAO;AACH,aAAO;IACX;EACJ;AANgB,EAAAA,gBAAA,YAAS;AAQzB,WAAgB,WAAW,OAAa;AACpC,WAAO,SAAS,KAAK;EACzB;AAFgB,EAAAA,gBAAA,aAAU;AAI1B,WAAgB,cAAc,OAAa;AACvC,WAAO,OAAO,KAAK;EACvB;AAFgB,EAAAA,gBAAA,gBAAa;AAI7B,WAAgB,YAAY,OAAa;AACrC,WAAO,IAAI,KAAK,KAAK;EACzB;AAFgB,EAAAA,gBAAA,cAAW;AAI3B,WAAgB,cAAc,OAAa;AACvC,WAAO,OAAO,KAAK;EACvB;AAFgB,EAAAA,gBAAA,gBAAa;AAI7B,WAAgB,eAAe,OAAa;AACxC,WAAO,MAAM,YAAW,MAAO;EACnC;AAFgB,EAAAA,gBAAA,iBAAc;AAIlC,GAzDiB,mBAAA,iBAAc,CAAA,EAAA;;;ACzD/B;;;;;AAMA,4CAAiG;;;ACQ3F,SAAU,gBAAa;AACzB,SAAO,IAAI,QAAQ,aAAU;AAGzB,QAAI,OAAO,iBAAiB,aAAa;AACrC,iBAAW,SAAS,CAAC;IACzB,OAAO;AACH,mBAAa,OAAO;IACxB;EACJ,CAAC;AACL;AAEA,IAAI,WAAW;AACf,IAAI,2BAA2B;AAKzB,SAAU,2BAAwB;AACpC,aAAW,YAAY,IAAG;AAC1B,SAAO,IAAI,8DAAuB;AACtC;AAeO,IAAM,qBAAqB,uBAAO,oBAAoB;AAMvD,SAAU,qBAAqB,KAAY;AAC7C,SAAO,QAAQ;AACnB;AAaA,eAAsB,kBAAkB,OAAwB;AAC5D,MAAI,UAAU,wDAAkB,MAAM;AAElC;EACJ;AACA,QAAM,UAAU,YAAY,IAAG;AAC/B,MAAI,UAAU,YAAY,0BAA0B;AAChD,eAAW;AACX,UAAM,cAAa;AAInB,eAAW,YAAY,IAAG;EAC9B;AACA,MAAI,MAAM,yBAAyB;AAC/B,UAAM;EACV;AACJ;AAMM,IAAO,WAAP,MAAe;EAArB,cAAA;AAII,SAAA,UAAU,IAAI,QAAW,CAAC,SAAS,WAAU;AACzC,WAAK,UAAU,CAAC,QAAO;AACnB,gBAAQ,GAAG;AACX,eAAO;MACX;AACA,WAAK,SAAS,CAAC,QAAO;AAClB,eAAO,GAAG;AACV,eAAO;MACX;IACJ,CAAC;EACL;;;;ACvGA,IAAMC,oBAAN,MAAM,kBAAiB;AAAA,EACnB,YAAY,KAAK,YAAY,SAAS,SAAS;AAC3C,SAAK,OAAO;AACZ,SAAK,cAAc;AACnB,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,eAAe;AAAA,EACxB;AAAA,EACA,IAAI,MAAM;AACN,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,aAAa;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,QAAQ,OAAO;AACX,QAAI,OAAO;AACP,YAAM,QAAQ,KAAK,SAAS,MAAM,KAAK;AACvC,YAAM,MAAM,KAAK,SAAS,MAAM,GAAG;AACnC,aAAO,KAAK,SAAS,UAAU,OAAO,GAAG;AAAA,IAC7C;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAO,SAAS,SAAS;AACrB,eAAW,UAAU,SAAS;AAC1B,UAAI,kBAAiB,cAAc,MAAM,GAAG;AAExC,cAAM,QAAQ,mBAAmB,OAAO,KAAK;AAE7C,cAAM,cAAc,KAAK,SAAS,MAAM,KAAK;AAC7C,cAAM,YAAY,KAAK,SAAS,MAAM,GAAG;AACzC,aAAK,WAAW,KAAK,SAAS,UAAU,GAAG,WAAW,IAAI,OAAO,OAAO,KAAK,SAAS,UAAU,WAAW,KAAK,SAAS,MAAM;AAE/H,cAAM,YAAY,KAAK,IAAI,MAAM,MAAM,MAAM,CAAC;AAC9C,cAAM,UAAU,KAAK,IAAI,MAAM,IAAI,MAAM,CAAC;AAC1C,YAAI,cAAc,KAAK;AACvB,cAAM,mBAAmB,mBAAmB,OAAO,MAAM,OAAO,WAAW;AAC3E,YAAI,UAAU,cAAc,iBAAiB,QAAQ;AACjD,mBAAS,IAAI,GAAG,MAAM,iBAAiB,QAAQ,IAAI,KAAK,KAAK;AACzD,wBAAY,IAAI,YAAY,CAAC,IAAI,iBAAiB,CAAC;AAAA,UACvD;AAAA,QACJ,OACK;AACD,cAAI,iBAAiB,SAAS,KAAO;AACjC,wBAAY,OAAO,YAAY,GAAG,UAAU,WAAW,GAAG,gBAAgB;AAAA,UAC9E,OACK;AACD,iBAAK,eAAe,cAAc,YAAY,MAAM,GAAG,YAAY,CAAC,EAAE,OAAO,kBAAkB,YAAY,MAAM,UAAU,CAAC,CAAC;AAAA,UACjI;AAAA,QACJ;AACA,cAAM,OAAO,OAAO,KAAK,UAAU,YAAY;AAC/C,YAAI,SAAS,GAAG;AACZ,mBAAS,IAAI,YAAY,IAAI,iBAAiB,QAAQ,MAAM,YAAY,QAAQ,IAAI,KAAK,KAAK;AAC1F,wBAAY,CAAC,IAAI,YAAY,CAAC,IAAI;AAAA,UACtC;AAAA,QACJ;AAAA,MACJ,WACS,kBAAiB,OAAO,MAAM,GAAG;AACtC,aAAK,WAAW,OAAO;AACvB,aAAK,eAAe;AAAA,MACxB,OACK;AACD,cAAM,IAAI,MAAM,+BAA+B;AAAA,MACnD;AAAA,IACJ;AACA,SAAK,WAAW;AAAA,EACpB;AAAA,EACA,iBAAiB;AACb,QAAI,KAAK,iBAAiB,QAAW;AACjC,WAAK,eAAe,mBAAmB,KAAK,UAAU,IAAI;AAAA,IAC9D;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,WAAW,QAAQ;AACf,aAAS,KAAK,IAAI,KAAK,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,CAAC;AAC3D,UAAM,cAAc,KAAK,eAAe;AACxC,QAAI,MAAM,GAAG,OAAO,YAAY;AAChC,QAAI,SAAS,GAAG;AACZ,aAAO,EAAE,MAAM,GAAG,WAAW,OAAO;AAAA,IACxC;AACA,WAAO,MAAM,MAAM;AACf,YAAM,MAAM,KAAK,OAAO,MAAM,QAAQ,CAAC;AACvC,UAAI,YAAY,GAAG,IAAI,QAAQ;AAC3B,eAAO;AAAA,MACX,OACK;AACD,cAAM,MAAM;AAAA,MAChB;AAAA,IACJ;AAGA,UAAM,OAAO,MAAM;AACnB,aAAS,KAAK,gBAAgB,QAAQ,YAAY,IAAI,CAAC;AACvD,WAAO,EAAE,MAAM,WAAW,SAAS,YAAY,IAAI,EAAE;AAAA,EACzD;AAAA,EACA,SAAS,UAAU;AACf,UAAM,cAAc,KAAK,eAAe;AACxC,QAAI,SAAS,QAAQ,YAAY,QAAQ;AACrC,aAAO,KAAK,SAAS;AAAA,IACzB,WACS,SAAS,OAAO,GAAG;AACxB,aAAO;AAAA,IACX;AACA,UAAM,aAAa,YAAY,SAAS,IAAI;AAC5C,QAAI,SAAS,aAAa,GAAG;AACzB,aAAO;AAAA,IACX;AACA,UAAM,iBAAkB,SAAS,OAAO,IAAI,YAAY,SAAU,YAAY,SAAS,OAAO,CAAC,IAAI,KAAK,SAAS;AACjH,UAAM,SAAS,KAAK,IAAI,aAAa,SAAS,WAAW,cAAc;AACvE,WAAO,KAAK,gBAAgB,QAAQ,UAAU;AAAA,EAClD;AAAA,EACA,aAAa,MAAM;AACf,UAAM,cAAc,KAAK,eAAe;AACxC,QAAI,QAAQ,YAAY,QAAQ;AAC5B,YAAM,WAAW,YAAY,SAAS;AACtC,aAAO,EAAE,OAAO,EAAE,MAAM,UAAU,WAAW,EAAE,GAAG,KAAK,EAAE,MAAM,UAAU,WAAW,KAAK,SAAS,SAAS,YAAY,QAAQ,EAAE,EAAE;AAAA,IACvI,WACS,OAAO,GAAG;AACf,aAAO,EAAE,OAAO,EAAE,MAAM,GAAG,WAAW,EAAE,GAAG,KAAK,EAAE,MAAM,GAAG,WAAW,EAAE,EAAE;AAAA,IAC9E;AACA,UAAM,cAAc,YAAY,IAAI;AACpC,UAAM,iBAAkB,OAAO,IAAI,YAAY,SAAU,YAAY,OAAO,CAAC,IAAI,KAAK,SAAS;AAC/F,UAAM,YAAY,KAAK,gBAAgB,gBAAgB,WAAW;AAClE,WAAO,EAAE,OAAO,EAAE,MAAM,WAAW,EAAE,GAAG,KAAK,EAAE,MAAM,WAAW,YAAY,YAAY,EAAE;AAAA,EAC9F;AAAA,EACA,iBAAiB,MAAM;AACnB,UAAM,cAAc,KAAK,eAAe;AACxC,QAAI,QAAQ,YAAY,QAAQ;AAC5B,aAAO;AAAA,IACX,WACS,OAAO,GAAG;AACf,aAAO;AAAA,IACX;AACA,UAAM,iBAAkB,OAAO,IAAI,YAAY,SAAU,YAAY,OAAO,CAAC,IAAI,KAAK,SAAS;AAC/F,UAAM,YAAY,KAAK,gBAAgB,gBAAgB,YAAY,IAAI,CAAC;AACxE,WAAO,KAAK,SAAS,UAAU,WAAW,cAAc;AAAA,EAC5D;AAAA,EACA,gBAAgB,QAAQ,YAAY;AAChC,WAAO,SAAS,cAAc,MAAM,KAAK,SAAS,WAAW,SAAS,CAAC,CAAC,GAAG;AACvE;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,YAAY;AACZ,WAAO,KAAK,eAAe,EAAE;AAAA,EACjC;AAAA,EACA,OAAO,cAAc,OAAO;AACxB,UAAM,YAAY;AAClB,WAAO,cAAc,UAAa,cAAc,QAC5C,OAAO,UAAU,SAAS,YAAY,UAAU,UAAU,WACzD,UAAU,gBAAgB,UAAa,OAAO,UAAU,gBAAgB;AAAA,EACjF;AAAA,EACA,OAAO,OAAO,OAAO;AACjB,UAAM,YAAY;AAClB,WAAO,cAAc,UAAa,cAAc,QAC5C,OAAO,UAAU,SAAS,YAAY,UAAU,UAAU,UAAa,UAAU,gBAAgB;AAAA,EACzG;AACJ;AACO,IAAIC;AAAA,CACV,SAAUA,eAAc;AASrB,WAAS,OAAO,KAAK,YAAY,SAAS,SAAS;AAC/C,WAAO,IAAID,kBAAiB,KAAK,YAAY,SAAS,OAAO;AAAA,EACjE;AACA,EAAAC,cAAa,SAAS;AAUtB,WAAS,OAAO,UAAU,SAAS,SAAS;AACxC,QAAI,oBAAoBD,mBAAkB;AACtC,eAAS,OAAO,SAAS,OAAO;AAChC,aAAO;AAAA,IACX,OACK;AACD,YAAM,IAAI,MAAM,sEAAsE;AAAA,IAC1F;AAAA,EACJ;AACA,EAAAC,cAAa,SAAS;AACtB,WAAS,WAAW,UAAU,OAAO;AACjC,UAAM,OAAO,SAAS,QAAQ;AAC9B,UAAM,cAAc,UAAU,MAAM,IAAI,iBAAiB,GAAG,CAACC,IAAG,MAAM;AAClE,YAAM,OAAOA,GAAE,MAAM,MAAM,OAAO,EAAE,MAAM,MAAM;AAChD,UAAI,SAAS,GAAG;AACZ,eAAOA,GAAE,MAAM,MAAM,YAAY,EAAE,MAAM,MAAM;AAAA,MACnD;AACA,aAAO;AAAA,IACX,CAAC;AACD,QAAI,qBAAqB;AACzB,UAAM,QAAQ,CAAC;AACf,eAAW,KAAK,aAAa;AACzB,YAAM,cAAc,SAAS,SAAS,EAAE,MAAM,KAAK;AACnD,UAAI,cAAc,oBAAoB;AAClC,cAAM,IAAI,MAAM,kBAAkB;AAAA,MACtC,WACS,cAAc,oBAAoB;AACvC,cAAM,KAAK,KAAK,UAAU,oBAAoB,WAAW,CAAC;AAAA,MAC9D;AACA,UAAI,EAAE,QAAQ,QAAQ;AAClB,cAAM,KAAK,EAAE,OAAO;AAAA,MACxB;AACA,2BAAqB,SAAS,SAAS,EAAE,MAAM,GAAG;AAAA,IACtD;AACA,UAAM,KAAK,KAAK,OAAO,kBAAkB,CAAC;AAC1C,WAAO,MAAM,KAAK,EAAE;AAAA,EACxB;AACA,EAAAD,cAAa,aAAa;AAC9B,GAAGA,kBAAiBA,gBAAe,CAAC,EAAE;AACtC,SAAS,UAAU,MAAM,SAAS;AAC9B,MAAI,KAAK,UAAU,GAAG;AAElB,WAAO;AAAA,EACX;AACA,QAAM,IAAK,KAAK,SAAS,IAAK;AAC9B,QAAM,OAAO,KAAK,MAAM,GAAG,CAAC;AAC5B,QAAM,QAAQ,KAAK,MAAM,CAAC;AAC1B,YAAU,MAAM,OAAO;AACvB,YAAU,OAAO,OAAO;AACxB,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,IAAI;AACR,SAAO,UAAU,KAAK,UAAU,WAAW,MAAM,QAAQ;AACrD,UAAM,MAAM,QAAQ,KAAK,OAAO,GAAG,MAAM,QAAQ,CAAC;AAClD,QAAI,OAAO,GAAG;AAEV,WAAK,GAAG,IAAI,KAAK,SAAS;AAAA,IAC9B,OACK;AAED,WAAK,GAAG,IAAI,MAAM,UAAU;AAAA,IAChC;AAAA,EACJ;AACA,SAAO,UAAU,KAAK,QAAQ;AAC1B,SAAK,GAAG,IAAI,KAAK,SAAS;AAAA,EAC9B;AACA,SAAO,WAAW,MAAM,QAAQ;AAC5B,SAAK,GAAG,IAAI,MAAM,UAAU;AAAA,EAChC;AACA,SAAO;AACX;AACA,SAAS,mBAAmB,MAAM,eAAe,aAAa,GAAG;AAC7D,QAAM,SAAS,gBAAgB,CAAC,UAAU,IAAI,CAAC;AAC/C,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAClC,UAAM,KAAK,KAAK,WAAW,CAAC;AAC5B,QAAI,MAAM,EAAE,GAAG;AACX,UAAI,OAAO,MAAoC,IAAI,IAAI,KAAK,UAAU,KAAK,WAAW,IAAI,CAAC,MAAM,IAA4B;AACzH;AAAA,MACJ;AACA,aAAO,KAAK,aAAa,IAAI,CAAC;AAAA,IAClC;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,MAAM,MAAM;AACjB,SAAO,SAAS,MAAoC,SAAS;AACjE;AACA,SAAS,mBAAmB,OAAO;AAC/B,QAAM,QAAQ,MAAM;AACpB,QAAM,MAAM,MAAM;AAClB,MAAI,MAAM,OAAO,IAAI,QAAS,MAAM,SAAS,IAAI,QAAQ,MAAM,YAAY,IAAI,WAAY;AACvF,WAAO,EAAE,OAAO,KAAK,KAAK,MAAM;AAAA,EACpC;AACA,SAAO;AACX;AACA,SAAS,kBAAkB,UAAU;AACjC,QAAM,QAAQ,mBAAmB,SAAS,KAAK;AAC/C,MAAI,UAAU,SAAS,OAAO;AAC1B,WAAO,EAAE,SAAS,SAAS,SAAS,MAAM;AAAA,EAC9C;AACA,SAAO;AACX;;;AC5OA,IAAY;CAAZ,SAAYE,gBAAa;AAKrB,EAAAA,eAAAA,eAAA,SAAA,IAAA,CAAA,IAAA;AAMA,EAAAA,eAAAA,eAAA,QAAA,IAAA,CAAA,IAAA;AAKA,EAAAA,eAAAA,eAAA,gBAAA,IAAA,CAAA,IAAA;AAQA,EAAAA,eAAAA,eAAA,gBAAA,IAAA,CAAA,IAAA;AAKA,EAAAA,eAAAA,eAAA,QAAA,IAAA,CAAA,IAAA;AAMA,EAAAA,eAAAA,eAAA,mBAAA,IAAA,CAAA,IAAA;AAKA,EAAAA,eAAAA,eAAA,WAAA,IAAA,CAAA,IAAA;AACJ,GAzCY,kBAAA,gBAAa,CAAA,EAAA;AAqHnB,IAAO,gCAAP,MAAoC;EAMtC,YAAY,UAAmC;AAC3C,SAAK,kBAAkB,SAAS;AAChC,SAAK,gBAAgB,SAAS,UAAU;AACxC,SAAK,qBAAqB,SAAS,UAAU;EACjD;EAEA,MAAM,QAAqC,KAAU,oBAAoB,wDAAkB,MAAI;AAC3F,UAAM,UAAU,MAAM,KAAK,mBAAmB,SAAS,GAAG;AAC1D,WAAO,KAAK,YAAe,KAAK,SAAS,iBAAiB;EAC9D;EAIA,iBAA8C,cAA4B,KAAW,OAAyC;AAC1H,UAAM,oBAAOC,KAAI,MAAM,aAAa,GAAG;AACvC,QAAI,wDAAkB,GAAG,KAAK,GAAG;AAC7B,aAAO,KAAK,YAAe,KAAK,cAAc,KAAK;IACvD,OAAO;AACH,aAAO,KAAK,OAAU,KAAK,cAAc,KAAK;IAClD;EACJ;EAIA,WAAwC,MAAc,KAAU,OAAyC;AACrG,QAAI,wDAAkB,GAAG,KAAK,GAAG;AAC7B,aAAO,KAAK,YAAe,KAAK,MAAM,KAAK;IAC/C,OAAO;AACH,aAAO,KAAK,OAAU,KAAK,MAAM,KAAK;IAC1C;EACJ;EAEA,UAAuC,OAAU,KAAQ;AACrD,WAAO,KAAK,OAAU,KAAK,EAAE,QAAQ,MAAK,CAAE;EAChD;EAEU,OAAoC,KAAU,SAAgD,SAAuB;AAC3H,QAAI,OAAO,YAAY,UAAU;AAC7B,YAAM,cAAc,KAAK,MAAS,KAAK,SAAS,OAAO;AACvD,aAAO,KAAK,sBAAyB,aAAa,KAAK,QAAW,OAAO;IAE7E,WAAW,YAAY,SAAS;AAC5B,YAAM,cAAc,EAAE,OAAO,QAAQ,QAAQ,cAAc,CAAA,GAAI,aAAa,CAAA,EAAE;AAC9E,aAAO,KAAK,sBAAyB,aAAa,GAAG;IAEzD,OAAO;AACH,YAAM,cAAc,KAAK,MAAS,KAAK,QAAQ,QAAO,GAAI,OAAO;AACjE,aAAO,KAAK,sBAAsB,aAAa,KAAK,OAAO;IAC/D;EACJ;EAEU,MAAM,YAAyC,KAAU,SAAgC,aAA8B;AAC7H,QAAI,OAAO,YAAY,UAAU;AAC7B,YAAM,cAAc,MAAM,KAAK,WAAc,KAAK,SAAS,WAAW;AACtE,aAAO,KAAK,sBAAyB,aAAa,KAAK,QAAW,OAAO;IAC7E,OAAO;AACH,YAAM,cAAc,MAAM,KAAK,WAAc,KAAK,QAAQ,QAAO,GAAI,WAAW;AAChF,aAAO,KAAK,sBAAsB,aAAa,KAAK,OAAO;IAC/D;EACJ;;;;;;;;;;;;EAaU,sBAAmD,aAA6B,KAAU,cAA6B,MAAa;AAC1I,QAAI;AACJ,QAAI,cAAc;AACd,iBAAW;QACP;QACA;QACA,OAAO,cAAc;QACrB,YAAY,CAAA;QACZ;;IAER,OAAO;AACH,YAAM,qBAAqB,KAAK,yBAAyB,KAAK,IAAI;AAClE,iBAAW;QACP;QACA;QACA,OAAO,cAAc;QACrB,YAAY,CAAA;QACZ,IAAI,eAAY;AACZ,iBAAO,mBAAkB;QAC7B;;IAER;AACC,gBAAY,MAA2B,YAAY;AACpD,WAAO;EACX;EAEA,MAAM,OAAoC,UAAuC,mBAAoC;AAlRzH;AAoRQ,UAAM,WAAU,cAAS,YAAY,MAAM,aAA3B,mBAAqC,KAAK;AAC1D,UAAM,gBAAe,UAAK,kBAAL,mBAAoB,IAAI,SAAS,IAAI,SAAQ;AAClE,UAAM,OAAO,eAAe,aAAa,QAAO,IAAK,MAAM,KAAK,mBAAmB,SAAS,SAAS,GAAG;AAExG,QAAI,cAAc;AACd,aAAO,eACH,UACA,gBACA;QACI,OAAO;OACV;IAET,OAAO;AACH,YAAM,qBAAqB,KAAK,yBAAyB,SAAS,KAAK,IAAI;AAC3E,aAAO,eACH,UACA,gBACA;QACI,KAAK;OACR;IAET;AAIA,QAAI,YAAY,MAAM;AAClB,eAAS,cAAc,MAAM,KAAK,WAAW,SAAS,KAAK,MAAM,iBAAiB;AACjF,eAAS,YAAY,MAA2B,YAAY;IACjE;AACA,aAAS,QAAQ,cAAc;AAC/B,WAAO;EACX;EAEU,MAAyB,KAAU,MAAc,SAAuB;AAC9E,UAAM,WAAW,KAAK,gBAAgB,YAAY,GAAG;AACrD,WAAO,SAAS,OAAO,cAAc,MAAS,MAAM,OAAO;EAC/D;EAEU,WAA8B,KAAU,MAAc,mBAAoC;AAChG,UAAM,WAAW,KAAK,gBAAgB,YAAY,GAAG;AACrD,WAAO,SAAS,OAAO,YAAY,MAAS,MAAM,iBAAiB;EACvE;EAEU,yBAAyB,KAAU,MAAa;AACtD,UAAM,kBAAkB,KAAK;AAC7B,QAAI,UAAoC;AACxC,WAAO,MAAK;AACR,aAAO,4BAAA,UAAYC,cAAa,OAC5B,IAAI,SAAQ,GAAI,gBAAgB,YAAY,GAAG,EAAE,iBAAiB,YAAY,GAAG,sBAAQ,EAAE;IAEnG;EACJ;;AAsFE,IAAO,0BAAP,MAA8B;EAQhC,YAAY,UAAmC;AAF5B,SAAA,eAAe,IAAI,QAAO;AAGzC,SAAK,WAAW;AAChB,SAAK,yBAAyB,SAAS,UAAU;AACjD,SAAK,kBAAkB,MAAM,SAAS,UAAU;EACpD;EAEA,IAAI,MAAG;AACH,WAAO,OAAO,KAAK,aAAa,IAAG,CAAE;EACzC;EAEA,YAAY,UAAyB;AACjC,UAAM,YAAY,SAAS,IAAI,SAAQ;AACvC,QAAI,KAAK,aAAa,IAAI,SAAS,GAAG;AAClC,YAAM,IAAI,MAAM,4BAA4B,SAAS,uBAAuB;IAChF;AACA,SAAK,aAAa,OAAO,WAAW,QAAQ;EAChD;EAEA,YAAY,KAAQ;AAChB,UAAM,YAAY,IAAI,SAAQ;AAC9B,WAAO,KAAK,aAAa,KAAK,SAAS;EAC3C;EAEA,aAAa,QAAW;AACpB,UAAM,YAAY,OAAO,SAAQ;AACjC,WAAO,KAAK,aAAa,QAAQ,SAAS;EAC9C;EAEA,MAAM,oBAAoB,KAAU,mBAAqC;AACrE,QAAI,WAAW,KAAK,YAAY,GAAG;AACnC,QAAI,UAAU;AACV,aAAO;IACX;AACA,eAAW,MAAM,KAAK,uBAAuB,QAAQ,KAAK,iBAAiB;AAC3E,SAAK,YAAY,QAAQ;AACzB,WAAO;EACX;EAIA,eAAe,KAAU,MAAc,mBAAqC;AACxE,QAAI,mBAAmB;AACnB,aAAO,KAAK,uBAAuB,WAAW,MAAM,KAAK,iBAAiB,EAAE,KAAK,cAAW;AACxF,aAAK,YAAY,QAAQ;AACzB,eAAO;MACX,CAAC;IACL,OAAO;AACH,YAAM,WAAW,KAAK,uBAAuB,WAAW,MAAM,GAAG;AACjE,WAAK,YAAY,QAAQ;AACzB,aAAO;IACX;EACJ;EAEA,YAAY,KAAQ;AAChB,WAAO,KAAK,aAAa,IAAI,IAAI,SAAQ,CAAE;EAC/C;;;;;EAMA,mBAAmB,KAAQ;AACvB,UAAM,YAAY,IAAI,SAAQ;AAC9B,UAAM,aAAa,KAAK,aAAa,KAAK,SAAS;AACnD,QAAI,YAAY;AACZ,WAAK,gBAAe,EAAG,aAAa,YAAY,cAAc,OAAO;IACzE;AACA,WAAO;EACX;EAEA,eAAe,KAAQ;AACnB,UAAM,YAAY,IAAI,SAAQ;AAC9B,UAAM,aAAa,KAAK,aAAa,KAAK,SAAS;AACnD,QAAI,YAAY;AACZ,iBAAW,QAAQ,cAAc;AACjC,WAAK,aAAa,OAAO,SAAS;IACtC;AACA,WAAO;EACX;EAEA,gBAAgB,QAAW;AACvB,UAAM,YAAY,OAAO,SAAQ;AACjC,UAAM,cAAc,KAAK,aAAa,QAAQ,SAAS;AACvD,eAAW,cAAc,aAAa;AAClC,iBAAW,QAAQ,cAAc;IACrC;AACA,SAAK,aAAa,OAAO,SAAS;AAClC,WAAO;EACX;;;;AC5aG,IAAM,eAAe,uBAAO,cAAc;AAiBjD,IAAM,uBAAN,MAA0B;EAMtB,YACqB,UACA,MACAC,WACjB,SACA,SAAe;AAJE,SAAA,WAAA;AACA,SAAA,OAAA;AACA,SAAA,WAAAA;AANrB,SAAA,OAAiE;AAU7D,SAAK,WAAW;AAChB,SAAK,WAAW;EACpB;EAEA,IAAI,MAAG;AACH,WAAO,KAAK,SAAS,iBAAiB,MAAM,KAAK,MAAM,KAAK,QAAQ;EACxE;EAEA,IAAI,mBAAgB;AAChB,WAAO,KAAK;EAChB;EAEA,IAAI,QAAK;AACL,WAAO,eAAe,KAAK,IAAI,IAAI,KAAK,OAAO;EACnD;;AAGJ,IAAM,4BAAN,MAA+B;EAM3B,YACqB,UACA,MACAA,WACjB,SACA,SAAe;AAJE,SAAA,WAAA;AACA,SAAA,OAAA;AACA,SAAA,WAAAA;AANrB,SAAA,SAAiE;AAU7D,SAAK,WAAW;AAChB,SAAK,WAAW;EACpB;EAEA,IAAI,QAAK;AACL,WAAO,KAAK,SAAS,sBAAsB,MAAM,KAAK,MAAM,KAAK,QAAQ;EAC7E;EAEA,IAAI,QAAK;AACL,WAAO,KAAK;EAChB;;AAGE,IAAO,gBAAP,MAAoB;EAStB,YAAY,UAA6B;AACrC,SAAK,aAAa,SAAS,OAAO;AAClC,SAAK,mBAAmB,MAAM,SAAS,OAAO,UAAU;AACxD,SAAK,gBAAgB,SAAS,WAAW;AACzC,SAAK,iBAAiB,SAAS,UAAU;AACzC,SAAK,WAAW,SAAS,OAAO,UAAU;AAC1C,SAAK,aAAa,SAAS,iBAAiB;AAC5C,SAAK,oBAAoB;MACrB,kBAAkB,KAAK,iBAAiB,KAAK,IAAI;MACjD,uBAAuB,KAAK,sBAAsB,KAAK,IAAI;;EAEnE;EAEA,MAAM,KAAK,UAA2B,cAAc,wDAAkB,MAAI;AAhL9E;AAiLQ,SAAI,UAAK,aAAL,mBAAe,SAAS,YAAY;AACpC,YAAM,OAAO,KAAK,SAAS,WAAW,WAAW,KAAK,UAAU;AAChE,WAAK,MAAK;AACV,UAAI;AACA,mBAAW,QAAQ,UAAU,SAAS,YAAY,KAAK,GAAG;AACtD,gBAAM,kBAAkB,WAAW;AACnC,2BAAiB,IAAI,EAAE,QAAQ,SAAM;AACjC,kBAAM,OAAO,GAAG,KAAK,KAAK,IAAI,IAAI,QAAQ;AAC1C,iBAAK,aAAa,IAAI;AACtB,gBAAI;AACA,mBAAK,OAAO,KAAK,QAAQ;YAC7B;AACI,mBAAK,YAAY,IAAI;YACzB;UACJ,CAAC;QACL;MACJ;AACI,aAAK,KAAI;MACb;IACJ,OACK;AACD,iBAAW,QAAQ,UAAU,SAAS,YAAY,KAAK,GAAG;AACtD,cAAM,kBAAkB,WAAW;AACnC,yBAAiB,IAAI,EAAE,QAAQ,SAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;MACpE;IACJ;EACJ;EAEU,OAAO,SAAwB,UAAyB;AA7MtE;AA8MQ,UAAM,MAAM,QAAQ;AAEpB,QAAI,UAAU,OAAO,IAAI,SAAS,QAAW;AACzC,UAAI,OAAO;AACX,UAAI;AACA,cAAM,cAAc,KAAK,aAAa,OAAO;AAC7C,YAAI,eAAe,WAAW,GAAG;AAC7B,cAAI,OAAO;QACf,OAAO;AACH,cAAI,mBAAmB;AACvB,gBAAM,aAAa,KAAK,YAAY,WAAW;AAC/C,cAAI,OAAO,kCAAc,KAAK,mBAAmB,SAAS,WAAW;QACzE;MACJ,SAAS,KAAK;AACV,gBAAQ,MAAM,mDAAmD,IAAI,QAAQ,MAAM,GAAG;AACtF,cAAM,gBAAgB,SAAc,YAAd,YAAyB,OAAO,GAAG;AACzD,YAAI,OAAO;UACP,MAAM;UACN,SAAS,mDAAmD,IAAI,QAAQ,MAAM,YAAY;;MAElG;AACA,eAAS,WAAW,KAAK,GAAG;IAChC,WAAW,YAAY,OAAO,IAAI,WAAW,QAAW;AACpD,UAAI,SAAS;AACb,UAAI;AACA,cAAM,eAAe,KAAK,cAAc,OAAO;AAC/C,cAAM,QAA8B,CAAA;AACpC,YAAI,eAAe,YAAY,GAAG;AAC9B,cAAI,gBAAgB;QACxB,OAAO;AACH,qBAAW,eAAe,cAAc;AACpC,kBAAM,aAAa,KAAK,YAAY,WAAW;AAC/C,gBAAI,YAAY;AACZ,oBAAM,KAAK,EAAE,KAAK,YAAY,kBAAkB,YAAW,CAAE;YACjE;UACJ;QACJ;AACA,YAAI,SAAS;MACjB,SAAS,KAAK;AACV,YAAI,gBAAgB;UAChB,MAAM;UACN,SAAS,mDAAmD,IAAI,QAAQ,MAAM,GAAG;;AAErF,YAAI,SAAS,CAAA;MACjB;AACA,eAAS,WAAW,KAAK,GAAG;IAChC;EACJ;EAEA,OAAO,UAAyB;AAC5B,eAAW,OAAO,SAAS,YAAY;AACnC,UAAI,UAAU,KAAK;AACd,YAAyB,OAAO;AACjC,eAAQ,IAAyB;MACrC,WAAW,YAAY,KAAK;AACvB,YAA8B,SAAS;AACxC,eAAQ,IAA8B;MAC1C;IACJ;AACA,aAAS,aAAa,CAAA;EAC1B;EAEA,aAAa,SAAsB;AAC/B,UAAM,QAAQ,KAAK,cAAc,SAAS,OAAO;AACjD,UAAM,cAAc,MAAM,WAAW,QAAQ,UAAU,QAAQ;AAC/D,WAAO,oCAAe,KAAK,mBAAmB,OAAO;EACzD;EAEA,cAAc,SAAsB;AAChC,UAAM,QAAQ,KAAK,cAAc,SAAS,OAAO;AACjD,UAAM,eAAe,MAAM,YAAY,QAAQ,UAAU,QAAQ,EAAE,SAAS,UAAQ,GAAG,KAAK,WAAW,IAAI,KAAK,IAAI,EAAE,EAAE,QAAO;AAC/H,WAAO,aAAa,SAAS,IAAI,eAAe,KAAK,mBAAmB,OAAO;EACnF;EAEA,eAAe,MAAeA,WAAkB,SAA8B,SAAe;AAEzF,WAAO,IAAI,qBAAqB,KAAK,mBAAmB,MAAMA,WAAU,SAAS,OAAO;EAC5F;EAEA,oBAAoB,MAAeA,WAAkB,SAA8B,SAAe;AAE9F,WAAO,IAAI,0BAA0B,KAAK,mBAAmB,MAAMA,WAAU,SAAS,OAAO;EACjG;EAEU,iBAAiB,WAA6B,MAAeA,WAAgB;AAlS3F;AAmSQ,QAAI,UAAU,UAAU,IAAI,GAAG;AAE3B,aAAO,UAAU;IACrB,WAAW,qBAAqB,UAAU,gBAAgB,GAAG;AAEzD,YAAM,aAAa,KAAK,YAAY,UAAU,gBAAgB;AAC9D,gBAAU,OAAO,kCACb,KAAK,mBAAmB,EAAE,WAAW,WAAW,MAAM,UAAAA,UAAQ,GAAI,UAAU,gBAAgB;IACpG,WAAW,UAAU,SAAS,QAAW;AAErC,gBAAU,OAAO;AACjB,YAAM,WAAW,aAAa,IAAI,EAAE;AACpC,YAAM,UAAU,KAAK,cAAc,EAAE,WAAW,WAAW,MAAM,UAAAA,UAAQ,CAAE;AAC3E,UAAI,QAAQ,SAAS,YAAY,SAAS,QAAQ,cAAc,gBAAgB;AAE5E,eAAO,UAAU,OAAO;MAC5B;AACA,gBAAU,QAAO,aAAQ,SAAR,YAAgB,QAAQ;AACzC,gBAAU,mBAAmB,QAAQ;AACrC,2CAAU,WAAW,KAAK;IAC9B,WAAW,UAAU,SAAS,cAAc;AACxC,WAAK,0BAA0B,MAAMA,WAAU,UAAU,QAAQ;IACrE;AACA,WAAO,UAAU,UAAU,IAAI,IAAI,UAAU,OAAO;EACxD;EAEU,sBAAsB,WAAkC,MAAeA,WAAgB;AAC7F,QAAI,MAAM,QAAQ,UAAU,MAAM,GAAG;AACjC,aAAO,UAAU;IACrB,WAAW,UAAU,WAAW,QAAW;AACvC,gBAAU,SAAS;AACnB,YAAM,WAAW,aAAa,IAAI,EAAE;AACpC,YAAM,eAAe,KAAK,cAAc;QACpC;QACA,WAAW;QACX,UAAAA;OACH;AACD,YAAM,QAA8B,CAAA;AACpC,UAAI,eAAe,YAAY,GAAG;AAC9B,kBAAU,gBAAgB;MAC9B,OAAO;AACH,mBAAW,eAAe,cAAc;AACpC,gBAAM,aAAa,KAAK,YAAY,WAAW;AAC/C,cAAI,YAAY;AACZ,kBAAM,KAAK,EAAE,KAAK,YAAY,kBAAkB,YAAW,CAAE;UACjE;QACJ;AACA,YAAI,MAAM,WAAW,GAAG;AACpB,oBAAU,gBAAgB,KAAK,mBAAmB,EAAE,WAAW,WAAW,MAAM,UAAAA,UAAQ,CAAE;QAC9F;MACJ;AACA,gBAAU,SAAS;AACnB,2CAAU,WAAW,KAAK;IAC9B,WAAW,UAAU,WAAW,cAAc;AAC1C,WAAK,0BAA0B,MAAMA,WAAU,UAAU,QAAQ;IACrE;AACA,WAAO,MAAM,QAAQ,UAAU,MAAM,IAAI,UAAU,SAAS,CAAA;EAChE;EAEU,0BAA0B,MAAeA,WAAkB,SAAe;AAChF,UAAM,IAAI,MAAM,yCAAyC,KAAK,eAAe,eAAe,IAAI,CAAC,IAAIA,SAAQ,aAAa,OAAO,IAAI;EACzI;EAEU,cAAc,SAAsB;AAlWlD;AAmWQ,QAAI;AACA,YAAM,cAAc,KAAK,aAAa,OAAO;AAC7C,UAAI,eAAe,WAAW,GAAG;AAC7B,eAAO,EAAE,OAAO,YAAW;MAC/B;AACA,YAAM,aAAa,KAAK,YAAY,WAAW;AAC/C,UAAI,YAAY;AACZ,eAAO,EAAE,MAAM,YAAY,OAAO,YAAW;MACjD,OACK;AACD,eAAO;UACH,OAAO;UACP,OACI,KAAK,mBAAmB,SAAS,WAAW;;MAExD;IACJ,SAAS,KAAK;AACV,cAAQ,MAAM,mDAAmD,QAAQ,UAAU,QAAQ,MAAM,GAAG;AACpG,YAAM,gBAAgB,SAAc,YAAd,YAAyB,OAAO,GAAG;AACzD,aAAO;QACH,OAAO;UACH,MAAM;UACN,SAAS,mDAAmD,QAAQ,UAAU,QAAQ,MAAM,YAAY;;;IAGpH;EACJ;EAEU,YAAY,iBAAmC;AACrD,QAAI,gBAAgB,MAAM;AACtB,aAAO,gBAAgB;IAC3B;AACA,UAAM,MAAM,KAAK,iBAAgB,EAAG,YAAY,gBAAgB,WAAW;AAC3E,QAAI,CAAC,KAAK;AACN,aAAO;IACX;AACA,WAAO,KAAK,eAAe,WAAW,IAAI,YAAY,OAAO,gBAAgB,IAAI;EACrF;EAEU,mBAAmB,SAAwB,mBAAsC;AAGvF,UAAM,WAAW,aAAa,QAAQ,SAAS,EAAE;AACjD,QAAI,YAAY,SAAS,QAAQ,cAAc,gBAAgB;AAC3D,cAAQ,KAAK,gFAAgF,SAAS,GAAG,IAAI;IACjH;AACA,UAAM,gBAAgB,KAAK,WAAW,iBAAiB,OAAO;AAC9D,WAAO;MACH,MAAM;MACN,SAAS,kCAAkC,aAAa,WAAW,QAAQ,UAAU,QAAQ;MAC7F;;EAER;;;;AC1YE,SAAU,QAAQ,MAAa;AACjC,SAAO,OAAQ,KAAsB,SAAS;AAClD;AAkBM,IAAO,sBAAP,MAA0B;EAC5B,QAAQ,MAAa;AACjB,QAAI,QAAQ,IAAI,GAAG;AACf,aAAO,KAAK;IAChB;AACA,WAAO;EACX;EAEA,YAAY,MAAa;AACrB,WAAO,oBAAoB,KAAK,UAAU,MAAM;EACpD;;;;ACoBE,IAAO,oBAAP,MAAwB;EAO1B,YAAY,UAA6B;AACrC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,QAAQ,SAAS,OAAO,UAAU;AACvC,SAAK,cAAc,SAAS,UAAU;AACtC,SAAK,YAAY,SAAS,OAAO,UAAU;AAC3C,SAAK,oBAAoB,UAAU,SAAS,OAAO,EAAE,KAAK,UAAQ,iBAAiB,IAAI,KAAK,KAAK,OAAO;EAC5G;EAEA,iBAAiB,eAAsB;AACnC,QAAI,eAAe;AACf,YAAM,aAAa,eAAe,aAAa;AAC/C,YAAM,WAAW,cAAc;AAC/B,UAAI,cAAc,UAAU;AACxB,cAAM,YAAa,SAA4B,WAAW,OAAO;AAEjE,YAAI,YAAY,SAAS,KAAK,iBAAiB,SAAS,GAAG;AACvD,iBAAO,kBAAkB,SAAS;QACtC,WAAW,MAAM,QAAQ,SAAS,GAAG;AACjC,qBAAW,OAAO,WAAW;AACzB,iBAAK,YAAY,GAAG,KAAK,iBAAiB,GAAG,MAAM,IAAI,YAChD,IAAI,SAAS,UAAU,cAAc,UACrC,IAAI,SAAS,OAAO,cAAc,KAAK;AAC1C,qBAAO,kBAAkB,GAAG;YAChC;UACJ;QACJ;MACJ;AACA,UAAI,UAAU;AACV,cAAM,WAAW,KAAK,aAAa,YAAY,QAAQ;AAEvD,YAAI,aAAa,aAAa,iBAAiB,YAAY,eAAe,QAAQ,IAAI;AAClF,iBAAO,KAAK,aAAa,QAAQ;QACrC;MACJ;IACJ;AACA,WAAO,CAAA;EACX;;;;;EAMU,aAAa,MAAa;AAChC,QAAI,CAAC,KAAK,mBAAmB;AACzB,aAAO,CAAC,IAAI;IAChB,OAAO;AAIH,YAAM,aAAa,KAAK,MAAM,kBAAkB,MAAM,KAAK,YAAY,eAAe,IAAI,CAAC;AAG3F,YAAM,WAAW,KAAK,gCAAgC,WAAW,KAAI,CAAE;AACvE,UAAI,UAAU;AAEV,mBAAW,OAAO,iBAAiB,QAAQ,GAAG;AAC1C,cAAI,iBAAiB,IAAI,SAAS,KAAK,IAAI,UAAU,MAAM,KAAK,UAAQ,KAAK,QAAQ,IAAI,GAAG;AAExF,mBAAO,IAAI,UAAU,MAAM,IAAI,UAAQ,KAAK,GAAG;UACnD;QACJ;MACJ;AACA,aAAO,CAAC,IAAI;IAChB;EACJ;EAEU,gCAAgC,KAA0B;AAChE,QAAI,CAAC,KAAK;AACN,aAAO;IACX;AACA,UAAM,MAAM,KAAK,UAAU,YAAY,IAAI,SAAS;AACpD,QAAI,KAAK;AACL,aAAO,KAAK,YAAY,WAAW,IAAI,YAAY,OAAO,IAAI,UAAU;IAC5E;AACA,WAAO;EACX;EAEA,qBAAqB,eAAsB;AAnJ/C;AAoJQ,UAAM,WAAW,KAAK,iBAAiB,aAAa;AACpD,UAAM,WAAsB,CAAA;AAC5B,eAAW,WAAW,UAAU;AAC5B,YAAM,WAAU,UAAK,aAAa,YAAY,OAAO,MAArC,YAA0C,QAAQ;AAClE,UAAI,SAAS;AACT,iBAAS,KAAK,OAAO;MACzB;IACJ;AACA,WAAO;EACX;EAEA,eAAe,YAAqB,SAA8B;AAC9D,UAAM,OAA+B,CAAA;AACrC,QAAI,QAAQ,oBAAoB;AAC5B,WAAK,KAAK,GAAG,KAAK,kBAAkB,UAAU,CAAC;IACnD;AACA,QAAI,kBAAkB,KAAK,MAAM,kBAAkB,YAAY,KAAK,YAAY,eAAe,UAAU,CAAC;AAC1G,QAAI,QAAQ,aAAa;AACrB,wBAAkB,gBAAgB,OAAO,SAAO,SAAS,OAAO,IAAI,WAAW,QAAQ,WAAW,CAAC;IACvG;AACA,SAAK,KAAK,GAAG,eAAe;AAC5B,WAAO,OAAO,IAAI;EACtB;EAEU,kBAAkB,YAAmB;AAC3C,UAAM,YAAY,KAAK,aAAa,UAAU;AAC9C,UAAM,aAAqC,CAAA;AAC3C,eAAW,YAAY,WAAW;AAC9B,YAAM,WAAW,KAAK,aAAa,YAAY,QAAQ;AACvD,UAAI,UAAU;AACV,cAAM,MAAM,YAAY,QAAQ;AAChC,cAAM,OAAO,KAAK,YAAY,eAAe,QAAQ;AACrD,mBAAW,KAAK;UACZ,WAAW,IAAI;UACf,YAAY;UACZ,WAAW,IAAI;UACf,YAAY;UACZ,SAAS,kBAAkB,QAAQ;UACnC,OAAO;SACV;MACL;IACJ;AACA,WAAO;EACX;;;;ACnLE,IAAO,WAAP,MAAe;EAMjB,YAAY,UAA2B;AAJ/B,SAAA,MAAM,oBAAI,IAAG;AAKjB,QAAI,UAAU;AACV,iBAAW,CAAC,KAAK,KAAK,KAAK,UAAU;AACjC,aAAK,IAAI,KAAK,KAAK;MACvB;IACJ;EACJ;;;;EAKA,IAAI,OAAI;AACJ,WAAO,UAAU,IAAI,OAAO,KAAK,IAAI,OAAM,CAAE,EAAE,IAAI,CAAAC,OAAKA,GAAE,MAAM,CAAC;EACrE;;;;EAKA,QAAK;AACD,SAAK,IAAI,MAAK;EAClB;;;;;;;;;EAUA,OAAO,KAAQ,OAAS;AACpB,QAAI,UAAU,QAAW;AACrB,aAAO,KAAK,IAAI,OAAO,GAAG;IAC9B,OAAO;AACH,YAAM,SAAS,KAAK,IAAI,IAAI,GAAG;AAC/B,UAAI,QAAQ;AACR,cAAM,QAAQ,OAAO,QAAQ,KAAK;AAClC,YAAI,SAAS,GAAG;AACZ,cAAI,OAAO,WAAW,GAAG;AACrB,iBAAK,IAAI,OAAO,GAAG;UACvB,OAAO;AACH,mBAAO,OAAO,OAAO,CAAC;UAC1B;AACA,iBAAO;QACX;MACJ;AACA,aAAO;IACX;EACJ;;;;;;;;EASA,IAAI,KAAM;AA3Ed;AA4EQ,YAAO,UAAK,IAAI,IAAI,GAAG,MAAhB,YAAqB,CAAA;EAChC;;;;;EAMA,UAAU,KAAM;AACZ,UAAM,SAAS,KAAK,IAAI,IAAI,GAAG;AAC/B,WAAO,SAAS,OAAO,MAAM,IAAI;EACrC;;;;;;EAOA,IAAI,KAAQ,OAAS;AACjB,QAAI,UAAU,QAAW;AACrB,aAAO,KAAK,IAAI,IAAI,GAAG;IAC3B,OAAO;AACH,YAAM,SAAS,KAAK,IAAI,IAAI,GAAG;AAC/B,UAAI,QAAQ;AACR,eAAO,OAAO,QAAQ,KAAK,KAAK;MACpC;AACA,aAAO;IACX;EACJ;;;;EAKA,IAAI,KAAQ,OAAQ;AAChB,QAAI,KAAK,IAAI,IAAI,GAAG,GAAG;AACnB,WAAK,IAAI,IAAI,GAAG,EAAG,KAAK,KAAK;IACjC,OAAO;AACH,WAAK,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC;IAC7B;AACA,WAAO;EACX;;;;EAKA,OAAO,KAAQ,QAAmB;AAC9B,QAAI,KAAK,IAAI,IAAI,GAAG,GAAG;AACnB,WAAK,IAAI,IAAI,GAAG,EAAG,KAAK,GAAG,MAAM;IACrC,OAAO;AACH,WAAK,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM,CAAC;IACxC;AACA,WAAO;EACX;;;;EAKA,QAAQ,YAAiD;AACrD,SAAK,IAAI,QAAQ,CAAC,OAAO,QACrB,MAAM,QAAQ,WAAS,WAAW,OAAO,KAAK,IAAI,CAAC,CAAC;EAE5D;;;;EAKA,CAAC,OAAO,QAAQ,IAAC;AACb,WAAO,KAAK,QAAO,EAAG,SAAQ;EAClC;;;;EAKA,UAAO;AACH,WAAO,OAAO,KAAK,IAAI,QAAO,CAAE,EAC3B,QAAQ,CAAC,CAAC,KAAK,KAAK,MAAM,MAAM,IAAI,WAAS,CAAC,KAAK,KAAK,CAAW,CAAC;EAC7E;;;;EAKA,OAAI;AACA,WAAO,OAAO,KAAK,IAAI,KAAI,CAAE;EACjC;;;;EAKA,SAAM;AACF,WAAO,OAAO,KAAK,IAAI,OAAM,CAAE,EAAE,KAAI;EACzC;;;;EAKA,sBAAmB;AACf,WAAO,OAAO,KAAK,IAAI,QAAO,CAAE;EACpC;;AAIE,IAAO,QAAP,MAAY;EAKd,IAAI,OAAI;AACJ,WAAO,KAAK,IAAI;EACpB;EAIA,YAAY,UAAwB;AAT5B,SAAA,MAAM,oBAAI,IAAG;AACb,SAAA,UAAU,oBAAI,IAAG;AASrB,QAAI,UAAU;AACV,iBAAW,CAAC,KAAK,KAAK,KAAK,UAAU;AACjC,aAAK,IAAI,KAAK,KAAK;MACvB;IACJ;EACJ;EAEA,QAAK;AACD,SAAK,IAAI,MAAK;AACd,SAAK,QAAQ,MAAK;EACtB;EAEA,IAAI,KAAQ,OAAQ;AAChB,SAAK,IAAI,IAAI,KAAK,KAAK;AACvB,SAAK,QAAQ,IAAI,OAAO,GAAG;AAC3B,WAAO;EACX;EAEA,IAAI,KAAM;AACN,WAAO,KAAK,IAAI,IAAI,GAAG;EAC3B;EAEA,OAAO,OAAQ;AACX,WAAO,KAAK,QAAQ,IAAI,KAAK;EACjC;EAEA,OAAO,KAAM;AACT,UAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;AAC9B,QAAI,UAAU,QAAW;AACrB,WAAK,IAAI,OAAO,GAAG;AACnB,WAAK,QAAQ,OAAO,KAAK;AACzB,aAAO;IACX;AACA,WAAO;EACX;;;;AC5JE,IAAO,0BAAP,MAA8B;EAKhC,YAAY,UAA6B;AACrC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,eAAe,SAAS,UAAU;EAC3C;EAEA,MAAM,uBAAuB,UAA2B,cAAc,wDAAkB,MAAI;AACxF,WAAO,KAAK,8BAA8B,SAAS,YAAY,OAAO,UAAU,QAAW,WAAW;EAC1G;;;;;;;;;;;;;EAcA,MAAM,8BAA8B,YAAqB,UAAoC,WAAiD,gBAAgB,cAAiC,wDAAkB,MAAI;AACjN,UAAMC,WAAgC,CAAA;AAEtC,SAAK,kBAAkB,YAAYA,UAAS,QAAQ;AACpD,eAAW,QAAQ,SAAS,UAAU,GAAG;AACrC,YAAM,kBAAkB,WAAW;AACnC,WAAK,kBAAkB,MAAMA,UAAS,QAAQ;IAClD;AACA,WAAOA;EACX;;;;;EAMU,kBAAkB,MAAeA,UAA+B,UAAyB;AAC/F,UAAM,OAAO,KAAK,aAAa,QAAQ,IAAI;AAC3C,QAAI,MAAM;AACN,MAAAA,SAAQ,KAAK,KAAK,aAAa,kBAAkB,MAAM,MAAM,QAAQ,CAAC;IAC1E;EACJ;;EAIA,MAAM,oBAAoB,UAA2B,cAAc,wDAAkB,MAAI;AACrF,UAAM,WAAW,SAAS,YAAY;AACtC,UAAM,UAAU,IAAI,SAAQ;AAE5B,eAAW,QAAQ,kBAAkB,QAAQ,GAAG;AAC5C,YAAM,kBAAkB,WAAW;AACnC,WAAK,eAAe,MAAM,UAAU,OAAO;IAC/C;AACA,WAAO;EACX;;;;;;EAOU,eAAe,MAAe,UAA2B,SAA8C;AAC7G,UAAM,YAAY,KAAK;AACvB,QAAI,WAAW;AACX,YAAM,OAAO,KAAK,aAAa,QAAQ,IAAI;AAC3C,UAAI,MAAM;AACN,gBAAQ,IAAI,WAAW,KAAK,aAAa,kBAAkB,MAAM,MAAM,QAAQ,CAAC;MACpF;IACJ;EACJ;;;;AClFE,IAAO,cAAP,MAAkB;EAMpB,YAAY,UAAsC,YAAoB,SAAsB;AAhEhG;AAiEQ,SAAK,WAAW;AAChB,SAAK,aAAa;AAClB,SAAK,mBAAkB,wCAAS,oBAAT,YAA4B;AACnD,SAAK,oBAAmB,wCAAS,qBAAT,YAA6B;EACzD;EAEA,iBAAc;AACV,QAAI,KAAK,YAAY;AACjB,aAAO,KAAK,SAAS,OAAO,KAAK,WAAW,eAAc,CAAE;IAChE,OAAO;AACH,aAAO,KAAK;IAChB;EACJ;EAEA,WAAW,MAAY;AACnB,UAAM,gBAAgB,KAAK,kBAAkB,KAAK,YAAW,IAAK;AAClE,UAAM,QAAQ,KAAK,kBACb,KAAK,SAAS,KAAK,OAAK,EAAE,KAAK,YAAW,MAAO,aAAa,IAC9D,KAAK,SAAS,KAAK,OAAK,EAAE,SAAS,IAAI;AAC7C,QAAI,OAAO;AACP,aAAO;IACX;AACA,QAAI,KAAK,YAAY;AACjB,aAAO,KAAK,WAAW,WAAW,IAAI;IAC1C;AACA,WAAO;EACX;EAEA,YAAY,MAAY;AACpB,UAAM,gBAAgB,KAAK,kBAAkB,KAAK,YAAW,IAAK;AAClE,UAAM,QAAQ,KAAK,kBACb,KAAK,SAAS,OAAO,OAAK,EAAE,KAAK,YAAW,MAAO,aAAa,IAChE,KAAK,SAAS,OAAO,OAAK,EAAE,SAAS,IAAI;AAC/C,SAAK,KAAK,oBAAoB,MAAM,QAAO,MAAO,KAAK,YAAY;AAC/D,aAAO,MAAM,OAAO,KAAK,WAAW,YAAY,IAAI,CAAC;IACzD,OAAO;AACH,aAAO;IACX;EACJ;;AAuDE,IAAO,gBAAP,MAAoB;EAMtB,YAAY,UAAwC,YAAoB,SAAsB;AApKlG;AAqKQ,SAAK,WAAW,IAAI,SAAQ;AAC5B,SAAK,mBAAkB,wCAAS,oBAAT,YAA4B;AACnD,SAAK,oBAAmB,wCAAS,qBAAT,YAA6B;AACrD,eAAW,WAAW,UAAU;AAC5B,YAAM,OAAO,KAAK,kBACZ,QAAQ,KAAK,YAAW,IACxB,QAAQ;AACd,WAAK,SAAS,IAAI,MAAM,OAAO;IACnC;AACA,SAAK,aAAa;EACtB;EAEA,WAAW,MAAY;AACnB,UAAM,YAAY,KAAK,kBAAkB,KAAK,YAAW,IAAK;AAC9D,UAAM,QAAQ,KAAK,SAAS,IAAI,SAAS,EAAE,CAAC;AAC5C,QAAI,OAAO;AACP,aAAO;IACX;AACA,QAAI,KAAK,YAAY;AACjB,aAAO,KAAK,WAAW,WAAW,IAAI;IAC1C;AACA,WAAO;EACX;EAEA,YAAY,MAAY;AACpB,UAAM,YAAY,KAAK,kBAAkB,KAAK,YAAW,IAAK;AAC9D,UAAM,QAAQ,KAAK,SAAS,IAAI,SAAS;AACzC,SAAK,KAAK,oBAAoB,MAAM,WAAW,MAAM,KAAK,YAAY;AAClE,aAAO,OAAO,KAAK,EAAE,OAAO,KAAK,WAAW,YAAY,IAAI,CAAC;IACjE,OAAO;AACH,aAAO,OAAO,KAAK;IACvB;EACJ;EAEA,iBAAc;AACV,QAAI,gBAAgB,OAAO,KAAK,SAAS,OAAM,CAAE;AACjD,QAAI,KAAK,YAAY;AACjB,sBAAgB,cAAc,OAAO,KAAK,WAAW,eAAc,CAAE;IACzE;AACA,WAAO;EACX;;;;AClME,IAAgB,kBAAhB,MAA+B;EAArC,cAAA;AAEc,SAAA,YAA0B,CAAA;AAC1B,SAAA,aAAa;EAoB3B;EAlBI,UAAU,YAAsB;AAC5B,SAAK,UAAU,KAAK,UAAU;EAClC;EAEA,UAAO;AACH,SAAK,gBAAe;AACpB,SAAK,MAAK;AACV,SAAK,aAAa;AAClB,SAAK,UAAU,QAAQ,gBAAc,WAAW,QAAO,CAAE;EAC7D;EAEU,kBAAe;AACrB,QAAI,KAAK,YAAY;AACjB,YAAM,IAAI,MAAM,sCAAsC;IAC1D;EACJ;;AAKE,IAAO,cAAP,cAAiC,gBAAe;EAAtD,cAAA;;AACuB,SAAA,QAAQ,oBAAI,IAAG;EAoCtC;EAlCI,IAAI,KAAM;AACN,SAAK,gBAAe;AACpB,WAAO,KAAK,MAAM,IAAI,GAAG;EAC7B;EAEA,IAAI,KAAQ,OAAQ;AAChB,SAAK,gBAAe;AACpB,SAAK,MAAM,IAAI,KAAK,KAAK;EAC7B;EAIA,IAAI,KAAQ,UAAkB;AAC1B,SAAK,gBAAe;AACpB,QAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACrB,aAAO,KAAK,MAAM,IAAI,GAAG;IAC7B,WAAW,UAAU;AACjB,YAAM,QAAQ,SAAQ;AACtB,WAAK,MAAM,IAAI,KAAK,KAAK;AACzB,aAAO;IACX,OAAO;AACH,aAAO;IACX;EACJ;EAEA,OAAO,KAAM;AACT,SAAK,gBAAe;AACpB,WAAO,KAAK,MAAM,OAAO,GAAG;EAChC;EAEA,QAAK;AACD,SAAK,gBAAe;AACpB,SAAK,MAAM,MAAK;EACpB;;AAGE,IAAO,eAAP,cAAuE,gBAAe;EAKxF,YAAY,WAA0C;AAClD,UAAK;AAJQ,SAAA,QAAQ,oBAAI,IAAG;AAK5B,SAAK,YAAY,iCAAc,WAAS;EAC5C;EAEA,IAAI,YAAqB,KAAQ;AAC7B,SAAK,gBAAe;AACpB,WAAO,KAAK,gBAAgB,UAAU,EAAE,IAAI,GAAG;EACnD;EAEA,IAAI,YAAqB,KAAU,OAAY;AAC3C,SAAK,gBAAe;AACpB,SAAK,gBAAgB,UAAU,EAAE,IAAI,KAAK,KAAK;EACnD;EAIA,IAAI,YAAqB,KAAU,UAAsB;AACrD,SAAK,gBAAe;AACpB,UAAM,eAAe,KAAK,gBAAgB,UAAU;AACpD,QAAI,aAAa,IAAI,GAAG,GAAG;AACvB,aAAO,aAAa,IAAI,GAAG;IAC/B,WAAW,UAAU;AACjB,YAAM,QAAQ,SAAQ;AACtB,mBAAa,IAAI,KAAK,KAAK;AAC3B,aAAO;IACX,OAAO;AACH,aAAO;IACX;EACJ;EAEA,OAAO,YAAqB,KAAQ;AAChC,SAAK,gBAAe;AACpB,WAAO,KAAK,gBAAgB,UAAU,EAAE,OAAO,GAAG;EACtD;EAIA,MAAM,YAAoB;AACtB,SAAK,gBAAe;AACpB,QAAI,YAAY;AACZ,YAAM,SAAS,KAAK,UAAU,UAAU;AACxC,WAAK,MAAM,OAAO,MAAM;IAC5B,OAAO;AACH,WAAK,MAAM,MAAK;IACpB;EACJ;EAEU,gBAAgB,YAAmB;AACzC,UAAM,SAAS,KAAK,UAAU,UAAU;AACxC,QAAI,gBAAgB,KAAK,MAAM,IAAI,MAAM;AACzC,QAAI,CAAC,eAAe;AAChB,sBAAgB,oBAAI,IAAG;AACvB,WAAK,MAAM,IAAI,QAAQ,aAAa;IACxC;AACA,WAAO;EACX;;AA+CE,IAAO,iBAAP,cAAoC,YAAiB;;;;;;;;;EAUvD,YAAY,gBAA2C,OAAqB;AACxE,UAAK;AACL,QAAI,OAAO;AACP,WAAK,UAAU,KAAK,eAAe,UAAU,gBAAgB,aAAa,OAAO,MAAK;AAClF,aAAK,MAAK;MACd,CAAC,CAAC;AACF,WAAK,UAAU,KAAK,eAAe,UAAU,gBAAgB,SAAS,CAAC,UAAU,YAAW;AACxF,YAAI,QAAQ,SAAS,GAAG;AACpB,eAAK,MAAK;QACd;MACJ,CAAC,CAAC;IACN,OAAO;AACH,WAAK,UAAU,KAAK,eAAe,UAAU,gBAAgB,SAAS,MAAK;AACvE,aAAK,MAAK;MACd,CAAC,CAAC;IACN;EACJ;;;;AChLE,IAAO,uBAAP,MAA2B;EAS7B,YAAY,UAA6B;AACrC,SAAK,aAAa,SAAS,OAAO;AAClC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,eAAe,SAAS,UAAU;AACvC,SAAK,eAAe,SAAS,OAAO,UAAU;AAC9C,SAAK,mBAAmB,IAAI,eAA8B,SAAS,MAAM;EAC7E;EAEA,SAAS,SAAsB;AAC3B,UAAM,SAA4C,CAAA;AAClD,UAAM,gBAAgB,KAAK,WAAW,iBAAiB,OAAO;AAE9D,UAAM,eAAe,YAAY,QAAQ,SAAS,EAAE;AACpD,QAAI,cAAc;AACd,UAAI,cAAmC,QAAQ;AAC/C,SAAG;AACC,YAAI,aAAa,IAAI,WAAW,GAAG;AAC/B,iBAAO,KAAK,aAAa,UAAU,WAAW,EAAE,OAC5C,UAAQ,KAAK,WAAW,UAAU,KAAK,MAAM,aAAa,CAAC,CAAC;QACpE;AACA,sBAAc,YAAY;MAC9B,SAAS;IACb;AAEA,QAAI,SAAgB,KAAK,eAAe,eAAe,OAAO;AAC9D,aAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,eAAS,KAAK,YAAY,OAAO,CAAC,GAAG,MAAM;IAC/C;AACA,WAAO;EACX;;;;EAKU,YAAY,UAAwC,YAAoB,SAAsB;AACpG,WAAO,IAAI,YAAY,OAAO,QAAQ,GAAG,YAAY,OAAO;EAChE;;;;;EAMU,oBAAoB,UAA6B,YAAoB,SAAsB;AACjG,UAAM,IAAI,OAAO,QAAQ,EAAE,IAAI,OAAI;AAC/B,YAAM,OAAO,KAAK,aAAa,QAAQ,CAAC;AACxC,UAAI,MAAM;AACN,eAAO,KAAK,aAAa,kBAAkB,GAAG,IAAI;MACtD;AACA,aAAO;IACX,CAAC,EAAE,YAAW;AACd,WAAO,IAAI,YAAY,GAAG,YAAY,OAAO;EACjD;;;;EAKU,eAAe,eAAuB,UAAuB;AACnE,WAAO,KAAK,iBAAiB,IAAI,eAAe,MAAM,IAAI,cAAc,KAAK,aAAa,YAAY,aAAa,CAAC,CAAC;EACzH;;;;AC9CE,SAAU,qBAAqB,MAAa;AAC9C,SAAO,OAAQ,KAA4B,aAAa;AAC5D;AAkDA,SAAS,wBAAwB,KAAY;AACzC,SAAO,OAAO,QAAQ,YAAY,CAAC,CAAC,QAAQ,UAAU,OAAO,YAAY;AAC7E;AAEM,IAAO,wBAAP,MAA4B;EAa9B,YAAY,UAA6B;AAVzC,SAAA,mBAAmB,oBAAI,IAAI,CAAC,cAAc,sBAAsB,mBAAmB,aAAa,UAAU,CAAC;AAWvG,SAAK,mBAAmB,SAAS,OAAO,UAAU;AAClD,SAAK,iBAAiB,SAAS,UAAU;AACzC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,kBAAkB,SAAS,cAAc;EAClD;EAEA,UAAU,MAAe,SAA8B;AACnD,UAAM,mBAAmB,4BAAW,CAAA;AACpC,UAAM,mBAAmB,mCAAS;AAClC,UAAM,kBAAkB,CAAC,KAAa,UAAmB,KAAK,SAAS,KAAK,OAAO,gBAAgB;AACnG,UAAM,WAAW,mBAAmB,CAAC,KAAa,UAAmB,iBAAiB,KAAK,OAAO,eAAe,IAAI;AAErH,QAAI;AACA,WAAK,kBAAkB,YAAY,IAAI;AACvC,aAAO,KAAK,UAAU,MAAM,UAAU,mCAAS,KAAK;IACxD;AACI,WAAK,kBAAkB;IAC3B;EACJ;EAEA,YAAyC,SAAiB,SAAgC;AACtF,UAAM,qBAAqB,4BAAW,CAAA;AACtC,UAAMC,QAAO,KAAK,MAAM,OAAO;AAC/B,SAAK,SAASA,OAAMA,OAAM,kBAAkB;AAC5C,WAAOA;EACX;EAEU,SAAS,KAAa,OAAgB,EAAE,SAAS,YAAY,aAAa,UAAU,aAAY,GAAwB;AAvJtI;AAwJQ,QAAI,KAAK,iBAAiB,IAAI,GAAG,GAAG;AAChC,aAAO;IACX,WAAW,YAAY,KAAK,GAAG;AAC3B,YAAM,WAAW,MAAM;AACvB,YAAM,WAAW,UAAU,MAAM,WAAW;AAC5C,UAAI,UAAU;AACV,cAAM,iBAAiB,YAAY,QAAQ;AAC3C,YAAI,YAAY;AAChB,YAAI,KAAK,mBAAmB,KAAK,oBAAoB,gBAAgB;AACjE,cAAI,cAAc;AACd,wBAAY,aAAa,eAAe,KAAK,QAAQ;UACzD,OAAO;AACH,wBAAY,eAAe,IAAI,SAAQ;UAC3C;QACJ;AACA,cAAM,aAAa,KAAK,eAAe,eAAe,QAAQ;AAC9D,eAAO;UACH,MAAM,GAAG,SAAS,IAAI,UAAU;UAChC;;MAER,OAAO;AACH,eAAO;UACH,SAAQ,iBAAM,UAAN,mBAAa,YAAb,YAAwB;UAChC;;MAER;IACJ,WAAW,iBAAiB,KAAK,GAAG;AAChC,YAAM,WAAW,UAAU,MAAM,WAAW;AAC5C,YAAM,QAAkB,CAAA;AACxB,iBAAW,QAAQ,MAAM,OAAO;AAC5B,cAAM,WAAW,KAAK;AACtB,cAAM,iBAAiB,YAAY,KAAK,GAAG;AAC3C,YAAI,YAAY;AAChB,YAAI,KAAK,mBAAmB,KAAK,oBAAoB,gBAAgB;AACjE,cAAI,cAAc;AACd,wBAAY,aAAa,eAAe,KAAK,QAAQ;UACzD,OAAO;AACH,wBAAY,eAAe,IAAI,SAAQ;UAC3C;QACJ;AACA,cAAM,aAAa,KAAK,eAAe,eAAe,QAAQ;AAC9D,cAAM,KAAK,GAAG,SAAS,IAAI,UAAU,EAAE;MAC3C;AACA,aAAO;QACH;QACA;;IAER,WAAW,UAAU,KAAK,GAAG;AACzB,UAAI,UAA6C;AACjD,UAAI,aAAa;AACb,kBAAU,KAAK,kCAAkC,mBAAK,MAAO;AAC7D,aAAK,CAAC,OAAO,MAAM,eAAc,mCAAS,cAAa;AAEnD,kBAAQ,YAAY,eAAc,UAAK,oBAAL,mBAAsB,IAAI;QAChE;MACJ;AACA,UAAI,cAAc,CAAC,KAAK;AACpB,oCAAA,UAAY,mBAAK;AACjB,gBAAQ,eAAc,WAAM,aAAN,mBAAgB;MAC1C;AACA,UAAI,UAAU;AACV,oCAAA,UAAY,mBAAK;AACjB,cAAM,UAAU,KAAK,gBAAgB,WAAW,KAAK;AACrD,YAAI,SAAS;AACR,kBAA+B,WAAW,QAAQ,QAAQ,OAAO,EAAE;QACxE;MACJ;AACA,aAAO,4BAAW;IACtB,OAAO;AACH,aAAO;IACX;EACJ;EAEU,kCAAkC,MAA2B;AACnE,UAAM,wBAA4E,cAA4B;MAC1G,QAAQ,QAAQ;MAChB,KAAK,QAAQ;MACb,QAAQ,QAAQ;MAChB,OAAO,QAAQ;;AAGnB,QAAI,KAAK,UAAU;AACf,YAAM,aAAa,KAAK,cAAc,sBAAsB,KAAK,QAAQ;AACzE,YAAM,cAAiD,WAAW,cAAc,CAAA;AAEhF,aAAO,KAAK,IAAI,EAAE,OAAO,SAAO,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,QAAQ,SAAM;AAChE,cAAM,sBAAsB,qBAAqB,KAAK,UAAU,GAAG,EAAE,IAAI,qBAAqB;AAC9F,YAAI,oBAAoB,WAAW,GAAG;AAClC,sBAAY,GAAG,IAAI;QACvB;MACJ,CAAC;AAED,aAAO;IACX;AACA,WAAO;EACX;EAEU,SAAS,MAAsBA,OAAe,SAAiC,WAAqB,mBAA4B,gBAAuB;AAC7J,eAAW,CAAC,cAAc,IAAI,KAAK,OAAO,QAAQ,IAAI,GAAG;AACrD,UAAI,MAAM,QAAQ,IAAI,GAAG;AACrB,iBAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;AAC9C,gBAAM,UAAU,KAAK,KAAK;AAC1B,cAAI,wBAAwB,OAAO,GAAG;AAClC,iBAAK,KAAK,IAAI,KAAK,gBAAgB,MAAM,cAAcA,OAAM,SAAS,OAAO;UACjF,WAAW,UAAU,OAAO,GAAG;AAC3B,iBAAK,SAAS,SAA2BA,OAAM,SAAS,MAAM,cAAc,KAAK;UACrF;QACJ;MACJ,WAAW,wBAAwB,IAAI,GAAG;AACtC,aAAK,YAAY,IAAI,KAAK,gBAAgB,MAAM,cAAcA,OAAM,MAAM,OAAO;MACrF,WAAW,UAAU,IAAI,GAAG;AACxB,aAAK,SAAS,MAAwBA,OAAM,SAAS,MAAM,YAAY;MAC3E;IACJ;AACA,UAAM,UAAU;AAChB,YAAQ,aAAa;AACrB,YAAQ,qBAAqB;AAC7B,YAAQ,kBAAkB;EAC9B;EAEU,gBAAgB,WAAoBC,WAAkBD,OAAe,WAAkC,SAA+B;AAC5I,QAAI,UAAU,UAAU;AACxB,QAAI,QAAQ,UAAU;AACtB,QAAI;AACJ,QAAI,UAAU,MAAM;AAChB,YAAM,UAAU,KAAK,WAAWA,OAAM,UAAU,MAAM,QAAQ,YAAY;AAC1E,UAAI,UAAU,OAAO,GAAG;AACpB,YAAI,CAAC,SAAS;AACV,oBAAU,KAAK,aAAa,QAAQ,OAAO;QAC/C;AACA,eAAO;UACH,UAAU,4BAAW;UACrB,KAAK;;MAEb,OAAO;AACH,gBAAQ;MACZ;IACJ,WAAW,UAAU,OAAO;AACxB,YAAM,OAA6B,CAAA;AACnC,iBAAW,UAAU,UAAU,OAAO;AAClC,cAAM,UAAU,KAAK,WAAWA,OAAM,QAAQ,QAAQ,YAAY;AAClE,YAAI,UAAU,OAAO,GAAG;AACpB,eAAK,KAAK,EAAE,KAAK,QAAO,CAAE;QAC9B;MACJ;AACA,UAAI,KAAK,WAAW,GAAG;AACnB,cAAM;UACF,UAAU,4BAAW;UACrB,OAAO;;AAEX,gCAAA,QAAU;MACd,OAAO;AACH,eAAO;UACH,UAAU,4BAAW;UACrB,OAAO;;MAEf;IACJ;AACA,QAAI,OAAO;AACP,0BAAA,MAAQ;QACJ,UAAU,4BAAW;QACrB,KAAK;;AAET,UAAI,QAAQ;QACR,MAAM;UACF;UACA,UAAAC;UACA,WAAW;;QAEf,SAAS;;AAEb,aAAO;IACX,OAAO;AACH,aAAO;IACX;EACJ;EAEU,WAAWD,OAAe,KAAa,cAAmC;AAChF,QAAI;AACA,YAAM,gBAAgB,IAAI,QAAQ,GAAG;AACrC,UAAI,kBAAkB,GAAG;AACrB,cAAME,QAAO,KAAK,eAAe,WAAWF,OAAM,IAAI,UAAU,CAAC,CAAC;AAClE,YAAI,CAACE,OAAM;AACP,iBAAO,6BAA6B;QACxC;AACA,eAAOA;MACX;AACA,UAAI,gBAAgB,GAAG;AACnB,cAAMC,eAAc,eAAe,aAAa,GAAG,IAAIC,KAAI,MAAM,GAAG;AACpE,cAAMC,YAAW,KAAK,iBAAiB,YAAYF,YAAW;AAC9D,YAAI,CAACE,WAAU;AACX,iBAAO,sCAAsC;QACjD;AACA,eAAOA,UAAS,YAAY;MAChC;AACA,YAAM,cAAc,eAAe,aAAa,IAAI,UAAU,GAAG,aAAa,CAAC,IAAID,KAAI,MAAM,IAAI,UAAU,GAAG,aAAa,CAAC;AAC5H,YAAM,WAAW,KAAK,iBAAiB,YAAY,WAAW;AAC9D,UAAI,CAAC,UAAU;AACX,eAAO,sCAAsC;MACjD;AACA,UAAI,kBAAkB,IAAI,SAAS,GAAG;AAClC,eAAO,SAAS,YAAY;MAChC;AACA,YAAM,OAAO,KAAK,eAAe,WAAW,SAAS,YAAY,OAAO,IAAI,UAAU,gBAAgB,CAAC,CAAC;AACxG,UAAI,CAAC,MAAM;AACP,eAAO,4BAA4B;MACvC;AACA,aAAO;IACX,SAAS,KAAK;AACV,aAAO,OAAO,GAAG;IACrB;EACJ;;;;AClUE,IAAO,yBAAP,MAA6B;;;;EAS/B,IAAc,MAAG;AACb,WAAO,KAAK;EAChB;EAIA,YAAY,UAAoC;AAb7B,SAAA,gBAAgB,oBAAI,IAAG;AACvB,SAAA,mBAAmB,oBAAI,IAAG;AAC1B,SAAA,cAAc,oBAAI,IAAG;AAYpC,SAAK,gBAAgB,qCAAU,UAAU;EAC7C;EAEA,SAAS,UAA6B;AAClC,UAAM,OAAO,SAAS;AACtB,eAAW,OAAO,KAAK,gBAAgB;AACnC,UAAI,KAAK,iBAAiB,IAAI,GAAG,GAAG;AAChC,gBAAQ,KAAK,sBAAsB,GAAG,0DAA0D,KAAK,UAAU,IAAI;MACvH;AACA,WAAK,iBAAiB,IAAI,KAAK,QAAQ;IAC3C;AACA,QAAI,KAAK,WAAW;AAChB,iBAAW,QAAQ,KAAK,WAAW;AAC/B,YAAI,KAAK,YAAY,IAAI,IAAI,GAAG;AAC5B,kBAAQ,KAAK,iBAAiB,IAAI,0DAA0D,KAAK,UAAU,IAAI;QACnH;AACA,aAAK,YAAY,IAAI,MAAM,QAAQ;MACvC;IACJ;AACA,SAAK,cAAc,IAAI,KAAK,YAAY,QAAQ;EACpD;EAEA,YAAY,KAAQ;AA/ExB;AAgFQ,QAAI,KAAK,cAAc,SAAS,GAAG;AAC/B,YAAM,IAAI,MAAM,uFAAuF;IAC3G;AACA,UAAM,cAAa,gBAAK,kBAAL,mBAAoB,IAAI,SAAxB,mBAA8B;AACjD,QAAI,eAAe,QAAW;AAC1B,YAAME,YAAW,KAAK,cAAc,IAAI,UAAU;AAClD,UAAIA,WAAU;AACV,eAAOA;MACX;IACJ;AACA,UAAM,MAAM,SAAS,QAAQ,GAAG;AAChC,UAAM,OAAO,SAAS,SAAS,GAAG;AAClC,UAAM,YAAW,UAAK,YAAY,IAAI,IAAI,MAAzB,YAA8B,KAAK,iBAAiB,IAAI,GAAG;AAE5E,QAAI,CAAC,UAAU;AACX,UAAI,YAAY;AACZ,cAAM,IAAI,MAAM,gEAAgE,GAAG,mBAAmB,UAAU,IAAI;MACxH,OAAO;AACH,cAAM,IAAI,MAAM,gEAAgE,GAAG,IAAI;MAC3F;IACJ;AACA,WAAO;EACX;EAEA,YAAY,KAAQ;AAChB,QAAI;AACA,WAAK,YAAY,GAAG;AACpB,aAAO;IACX,SAAQ;AACJ,aAAO;IACX;EACJ;EAEA,IAAI,MAAG;AACH,WAAO,MAAM,KAAK,KAAK,cAAc,OAAM,CAAE;EACjD;;;;AC9FE,IAAW;CAAjB,SAAiBC,SAAM;AAWN,EAAAA,QAAA,QAAQ,CAA4B,IAAmB,OAAuB,OAAO,OAAO,CAAA,GAAI,EAAE,GAAG,EAAE;AACxH,GAZiB,WAAA,SAAM,CAAA,EAAA;AAoCjB,SAAU,OACZ,SAAwB,SAAyB,SAAyB,SAAyB,SAAyB,SAAyB,SAAyB,SAAyB,SAAuB;AAE9N,QAAMC,WAAS,CAAC,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,OAAO,EAAE,OAAO,QAAQ,CAAA,CAAE;AAClH,SAAO,QAAQA,QAAM;AACzB;AAEA,IAAM,UAAU,uBAAO,SAAS;AAM1B,SAAU,UAAa,MAAO;AAChC,MAAI,QAAS,KAAa,OAAO,GAAG;AAChC,eAAW,SAAS,OAAO,OAAO,IAAI,GAAG;AACrC,gBAAU,KAAK;IACnB;EACJ;AACA,SAAO;AACX;AAMA,SAAS,QAAcA,SAAsB,UAAc;AACvD,QAAM,QAAa,IAAI,MAAM,CAAA,GAAW;IACpC,gBAAgB,MAAM;IACtB,KAAK,MAAK;AACN,YAAM,IAAI,MAAM,mDAAmD;IACvE;IACA,KAAK,CAAC,KAAK,SAAQ;AACf,UAAI,SAAS,SAAS;AAClB,eAAO;MACX,OAAO;AACH,eAAO,SAAS,KAAK,MAAMA,SAAQ,YAAY,KAAK;MACxD;IACJ;IACA,0BAA0B,CAAC,KAAK,UAAU,SAAS,KAAK,MAAMA,SAAQ,YAAY,KAAK,GAAG,OAAO,yBAAyB,KAAK,IAAI;;IACnI,KAAK,CAACC,IAAG,SAAS,QAAQD;;IAC1B,SAAS,MAAM,CAAC,GAAG,OAAO,oBAAoBA,OAAM,CAAC;;GACxD;AACD,SAAO;AACX;AAMA,IAAM,gBAAgB,uBAAM;AAc5B,SAAS,SAAe,KAAU,MAAgCA,SAAsB,UAAW;AAC/F,MAAI,QAAQ,KAAK;AACb,QAAI,IAAI,IAAI,aAAa,OAAO;AAC5B,YAAM,IAAI,MAAM,6FAA6F,IAAI,IAAI,CAAC;IAC1H;AACA,QAAI,IAAI,IAAI,MAAM,eAAe;AAC7B,YAAM,IAAI,MAAM,kCAAkC,OAAO,IAAI,IAAI,wGAAwG;IAC7K;AACA,WAAO,IAAI,IAAI;EACnB,WAAW,QAAQA,SAAQ;AACvB,UAAM,QAA+DA,QAAO,IAAe;AAC3F,QAAI,IAAI,IAAI;AACZ,QAAI;AACA,UAAI,IAAI,IAAK,OAAO,UAAU,aAAc,MAAM,QAAQ,IAAI,QAAQ,OAAO,QAAQ;IACzF,SAAS,OAAO;AACZ,UAAI,IAAI,IAAI,iBAAiB,QAAQ,QAAQ;AAC7C,YAAM;IACV;AACA,WAAO,IAAI,IAAI;EACnB,OAAO;AACH,WAAO;EACX;AACJ;AASA,SAAS,OAAO,QAAqB,QAAoB;AACrD,MAAI,QAAQ;AACR,eAAW,CAAC,KAAK,WAAW,KAAK,OAAO,QAAQ,MAAM,GAAG;AACrD,UAAI,gBAAgB,UAAa,gBAAgB,MAAM;AACnD,YAAI,OAAO,gBAAgB,UAAU;AACjC,gBAAM,cAAc,OAAO,GAAG;AAE9B,cAAI,OAAO,gBAAgB,YAAY,gBAAgB,MAAM;AAEzD,mBAAO,GAAG,IAAI,OAAO,aAAa,WAAW;UACjD,OAAO;AAKH,mBAAO,GAAG,IAAI,OAAO,CAAA,GAAI,WAAW;UACxC;QACJ,OAAO;AAGH,iBAAO,GAAG,IAAI;QAIlB;MACJ;IACJ;EACJ;AACA,SAAO;AACX;;;AC7JM,IAAO,yBAAP,MAA6B;EAE/B,YAAY,UAA6B;AACrC,SAAK,gBAAgB,MAAM,SAAS,OAAO;EAC/C;EACA,WAAW,MAAa;AA7B5B;AA8BQ,QAAG,qBAAqB,IAAI,GAAG;AAC3B,aAAO,KAAK;IAChB;AACA,YAAO,qBAAgB,KAAK,UAAU,KAAK,cAAa,EAAG,qBAAqB,MAAzE,mBAA4E;EACvF;;;;AC5BJ;AAkGM,SAAU,WAAW,MAAwB,OAAsC,SAA2B;AAChH,MAAI;AACJ,MAAI;AACJ,MAAI,OAAO,SAAS,UAAU;AAC1B,eAAW;AACX,WAAO;EACX,OAAO;AACH,eAAW,KAAK,MAAM;AACtB,WAAO;EACX;AACA,MAAI,CAAC,UAAU;AACX,eAAW,SAAS,OAAO,GAAG,CAAC;EACnC;AAEA,QAAM,QAAQ,SAAS,IAAI;AAC3B,QAAM,oBAAoB,iBAAiB,IAAI;AAE/C,QAAM,SAAS,SAAS;IACpB;IACA;IACA,SAAS;GACZ;AAED,SAAO,kBAAkB;IACrB,OAAO;IACP;IACA;GACH;AACL;AAEM,SAAU,QAAQ,MAAwB,SAA2B;AACvE,QAAM,oBAAoB,iBAAiB,OAAO;AAClD,QAAM,QAAQ,SAAS,IAAI;AAC3B,MAAI,MAAM,WAAW,GAAG;AACpB,WAAO;EACX;AAEA,QAAME,SAAQ,MAAM,CAAC;AACrB,QAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,QAAM,aAAa,kBAAkB;AACrC,QAAM,YAAY,kBAAkB;AAEpC,SAAO,QAAQ,yCAAY,KAAKA,OAAM,KAAK,QAAQ,uCAAW,KAAK,KAAK;AAC5E;AAEA,SAAS,SAAS,MAAsB;AACpC,MAAI,UAAU;AACd,MAAI,OAAO,SAAS,UAAU;AAC1B,cAAU;EACd,OAAO;AACH,cAAU,KAAK;EACnB;AACA,QAAM,QAAQ,QAAQ,MAAM,cAAc;AAC1C,SAAO;AACX;AAUA,IAAM,WAAW;AACjB,IAAM,iBAAiB;AAEvB,SAAS,SAAS,SAA4B;AA3K9C;AA4KI,QAAM,SAAuB,CAAA;AAC7B,MAAI,cAAc,QAAQ,SAAS;AACnC,MAAI,mBAAmB,QAAQ,SAAS;AACxC,WAAS,IAAI,GAAG,IAAI,QAAQ,MAAM,QAAQ,KAAK;AAC3C,UAAMA,SAAQ,MAAM;AACpB,UAAM,OAAO,MAAM,QAAQ,MAAM,SAAS;AAC1C,QAAI,OAAO,QAAQ,MAAM,CAAC;AAC1B,QAAI,QAAQ;AAEZ,QAAIA,UAAS,QAAQ,QAAQ,OAAO;AAChC,YAAM,SAAQ,aAAQ,QAAQ,UAAhB,mBAAuB,KAAK;AAC1C,UAAI,OAAO;AACP,gBAAQ,MAAM,QAAQ,MAAM,CAAC,EAAE;MACnC;IACJ,OAAO;AACH,YAAM,SAAQ,aAAQ,QAAQ,SAAhB,mBAAsB,KAAK;AACzC,UAAI,OAAO;AACP,gBAAQ,MAAM,QAAQ,MAAM,CAAC,EAAE;MACnC;IACJ;AACA,QAAI,MAAM;AACN,YAAM,SAAQ,aAAQ,QAAQ,QAAhB,mBAAqB,KAAK;AACxC,UAAI,OAAO;AACP,eAAO,KAAK,UAAU,GAAG,MAAM,KAAK;MACxC;IACJ;AAEA,WAAO,KAAK,UAAU,GAAG,cAAc,IAAI,CAAC;AAC5C,UAAM,gBAAgB,eAAe,MAAM,KAAK;AAEhD,QAAI,iBAAiB,KAAK,QAAQ;AAE9B,UAAI,OAAO,SAAS,GAAG;AACnB,cAAM,WAAW,SAAS,OAAO,aAAa,gBAAgB;AAC9D,eAAO,KAAK;UACR,MAAM;UACN,SAAS;UACT,OAAO,MAAM,OAAO,UAAU,QAAQ;SACzC;MACL;IACJ,OAAO;AACH,eAAS,YAAY;AACrB,YAAM,WAAW,SAAS,KAAK,IAAI;AACnC,UAAI,UAAU;AACV,cAAM,YAAY,SAAS,CAAC;AAC5B,cAAM,QAAQ,SAAS,CAAC;AACxB,cAAM,QAAQ,SAAS,OAAO,aAAa,mBAAmB,KAAK;AACnE,cAAM,MAAM,SAAS,OAAO,aAAa,mBAAmB,QAAQ,UAAU,MAAM;AACpF,eAAO,KAAK;UACR,MAAM;UACN,SAAS;UACT,OAAO,MAAM,OAAO,OAAO,GAAG;SACjC;AACD,iBAAS,UAAU;AACnB,gBAAQ,eAAe,MAAM,KAAK;MACtC;AAEA,UAAI,QAAQ,KAAK,QAAQ;AACrB,cAAM,OAAO,KAAK,UAAU,KAAK;AACjC,cAAM,mBAAmB,MAAM,KAAK,KAAK,SAAS,cAAc,CAAC;AACjE,eAAO,KAAK,GAAG,kBAAkB,kBAAkB,MAAM,aAAa,mBAAmB,KAAK,CAAC;MACnG;IACJ;AAEA;AACA,uBAAmB;EACvB;AAGA,MAAI,OAAO,SAAS,KAAK,OAAO,OAAO,SAAS,CAAC,EAAE,SAAS,SAAS;AACjE,WAAO,OAAO,MAAM,GAAG,EAAE;EAC7B;AAEA,SAAO;AACX;AAEA,SAAS,kBAAkB,MAA0B,MAAc,WAAmB,gBAAsB;AACxG,QAAM,SAAuB,CAAA;AAE7B,MAAI,KAAK,WAAW,GAAG;AACnB,UAAM,QAAQ,SAAS,OAAO,WAAW,cAAc;AACvD,UAAM,MAAM,SAAS,OAAO,WAAW,iBAAiB,KAAK,MAAM;AACnE,WAAO,KAAK;MACR,MAAM;MACN,SAAS;MACT,OAAO,MAAM,OAAO,OAAO,GAAG;KACjC;EACL,OAAO;AACH,QAAI,YAAY;AAChB,eAAW,SAAS,MAAM;AACtB,YAAM,aAAa,MAAM;AACzB,YAAM,eAAe,KAAK,UAAU,WAAW,UAAU;AACzD,UAAI,aAAa,SAAS,GAAG;AACzB,eAAO,KAAK;UACR,MAAM;UACN,SAAS,KAAK,UAAU,WAAW,UAAU;UAC7C,OAAO,MAAM,OACT,SAAS,OAAO,WAAW,YAAY,cAAc,GACrD,SAAS,OAAO,WAAW,aAAa,cAAc,CAAC;SAE9D;MACL;AACA,UAAI,SAAS,aAAa,SAAS;AACnC,YAAM,UAAU,MAAM,CAAC;AACvB,aAAO,KAAK;QACR,MAAM;QACN,SAAS;QACT,OAAO,MAAM,OACT,SAAS,OAAO,WAAW,YAAY,SAAS,cAAc,GAC9D,SAAS,OAAO,WAAW,YAAY,SAAS,QAAQ,SAAS,cAAc,CAAC;OAEvF;AACD,gBAAU,QAAQ;AAClB,UAAI,MAAM,WAAW,GAAG;AACpB,kBAAU,MAAM,CAAC,EAAE;AACnB,cAAM,QAAQ,MAAM,CAAC;AACrB,eAAO,KAAK;UACR,MAAM;UACN,SAAS;UACT,OAAO,MAAM,OACT,SAAS,OAAO,WAAW,YAAY,SAAS,cAAc,GAC9D,SAAS,OAAO,WAAW,YAAY,SAAS,MAAM,SAAS,cAAc,CAAC;SAErF;MACL,OAAO;AACH,eAAO,KAAK;UACR,MAAM;UACN,SAAS;UACT,OAAO,MAAM,OACT,SAAS,OAAO,WAAW,YAAY,SAAS,cAAc,GAC9D,SAAS,OAAO,WAAW,YAAY,SAAS,cAAc,CAAC;SAEtE;MACL;AACA,kBAAY,aAAa,MAAM,CAAC,EAAE;IACtC;AACA,UAAM,aAAa,KAAK,UAAU,SAAS;AAC3C,QAAI,WAAW,SAAS,GAAG;AACvB,aAAO,KAAK;QACR,MAAM;QACN,SAAS;QACT,OAAO,MAAM,OACT,SAAS,OAAO,WAAW,YAAY,cAAc,GACrD,SAAS,OAAO,WAAW,YAAY,iBAAiB,WAAW,MAAM,CAAC;OAEjF;IACL;EACJ;AAEA,SAAO;AACX;AAEA,IAAM,qBAAqB;AAC3B,IAAM,qBAAqB;AAE3B,SAAS,eAAe,MAAc,OAAa;AAC/C,QAAM,QAAQ,KAAK,UAAU,KAAK,EAAE,MAAM,kBAAkB;AAC5D,MAAI,OAAO;AACP,WAAO,QAAQ,MAAM;EACzB,OAAO;AACH,WAAO,KAAK;EAChB;AACJ;AAEA,SAAS,cAAc,MAAY;AAC/B,QAAM,QAAQ,KAAK,MAAM,kBAAkB;AAC3C,MAAI,SAAS,OAAO,MAAM,UAAU,UAAU;AAC1C,WAAO,MAAM;EACjB;AACA,SAAO;AACX;AAIA,SAAS,kBAAkB,SAAqB;AA1VhD;AA2VI,QAAM,gBAA0B,SAAS,OAAO,QAAQ,SAAS,MAAM,QAAQ,SAAS,SAAS;AACjG,MAAI,QAAQ,OAAO,WAAW,GAAG;AAC7B,WAAO,IAAI,iBAAiB,CAAA,GAAI,MAAM,OAAO,eAAe,aAAa,CAAC;EAC9E;AACA,QAAM,WAA2B,CAAA;AACjC,SAAO,QAAQ,QAAQ,QAAQ,OAAO,QAAQ;AAC1C,UAAM,UAAU,kBAAkB,SAAS,SAAS,SAAS,SAAS,CAAC,CAAC;AACxE,QAAI,SAAS;AACT,eAAS,KAAK,OAAO;IACzB;EACJ;AACA,QAAM,SAAQ,oBAAS,CAAC,MAAV,mBAAa,MAAM,UAAnB,YAA4B;AAC1C,QAAM,OAAM,oBAAS,SAAS,SAAS,CAAC,MAA5B,mBAA+B,MAAM,QAArC,YAA4C;AACxD,SAAO,IAAI,iBAAiB,UAAU,MAAM,OAAO,OAAO,GAAG,CAAC;AAClE;AAEA,SAAS,kBAAkB,SAAuB,MAAmB;AACjE,QAAM,OAAO,QAAQ,OAAO,QAAQ,KAAK;AACzC,MAAI,KAAK,SAAS,OAAO;AACrB,WAAO,cAAc,SAAS,KAAK;EACvC,WAAW,KAAK,SAAS,UAAU,KAAK,SAAS,cAAc;AAC3D,WAAO,eAAe,OAAO;EACjC,OAAO;AACH,oBAAgB,MAAM,IAAI;AAC1B,YAAQ;AACR,WAAO;EACX;AACJ;AAEA,SAAS,gBAAgB,OAAmB,SAAsB;AAC9D,MAAI,SAAS;AACT,UAAM,OAAO,IAAI,cAAc,IAAI,MAAM,KAAK;AAC9C,QAAI,aAAa,SAAS;AACtB,cAAQ,QAAQ,KAAK,IAAI;IAC7B,OAAO;AACH,cAAQ,QAAQ,QAAQ,KAAK,IAAI;IACrC;EACJ;AACJ;AAEA,SAAS,eAAe,SAAqB;AACzC,MAAI,QAAQ,QAAQ,OAAO,QAAQ,KAAK;AACxC,QAAM,aAAa;AACnB,MAAI,YAAY;AAChB,QAAM,QAAuB,CAAA;AAC7B,SAAO,SAAS,MAAM,SAAS,WAAW,MAAM,SAAS,OAAO;AAC5D,UAAM,KAAK,iBAAiB,OAAO,CAAC;AACpC,gBAAY;AACZ,YAAQ,QAAQ,OAAO,QAAQ,KAAK;EACxC;AACA,SAAO,IAAI,cAAc,OAAO,MAAM,OAAO,WAAW,MAAM,OAAO,UAAU,MAAM,GAAG,CAAC;AAC7F;AAEA,SAAS,iBAAiB,SAAqB;AAC3C,QAAM,QAAQ,QAAQ,OAAO,QAAQ,KAAK;AAC1C,MAAI,MAAM,SAAS,cAAc;AAC7B,WAAO,cAAc,SAAS,IAAI;EACtC,OAAO;AACH,WAAO,eAAe,OAAO;EACjC;AACJ;AAEA,SAAS,cAAc,SAAuB,QAAe;AACzD,QAAM,WAAW,QAAQ,OAAO,QAAQ,OAAO;AAC/C,QAAM,OAAO,SAAS,QAAQ,UAAU,CAAC;AACzC,QAAM,YAAY,QAAQ,OAAO,QAAQ,KAAK;AAC9C,OAAI,uCAAW,UAAS,QAAQ;AAC5B,QAAI,QAAQ;AACR,YAAM,UAAU,eAAe,OAAO;AACtC,aAAO,IAAI,aACP,MACA,IAAI,cAAc,CAAC,OAAO,GAAG,QAAQ,KAAK,GAC1C,QACA,MAAM,OAAO,SAAS,MAAM,OAAO,QAAQ,MAAM,GAAG,CAAC;IAE7D,OAAO;AACH,YAAM,UAAU,eAAe,OAAO;AACtC,aAAO,IAAI,aACP,MACA,SACA,QACA,MAAM,OAAO,SAAS,MAAM,OAAO,QAAQ,MAAM,GAAG,CAAC;IAE7D;EACJ,OAAO;AACH,UAAM,QAAQ,SAAS;AACvB,WAAO,IAAI,aAAa,MAAM,IAAI,cAAc,CAAA,GAAI,KAAK,GAAG,QAAQ,KAAK;EAC7E;AACJ;AAEA,SAAS,eAAe,SAAqB;AACzC,QAAM,QAAQ,QAAQ,OAAO,QAAQ,OAAO;AAC5C,SAAO,IAAI,cAAc,MAAM,SAAS,MAAM,KAAK;AACvD;AAoBA,SAAS,iBAAiB,SAA2B;AACjD,MAAI,CAAC,SAAS;AACV,WAAO,iBAAiB;MACpB,OAAO;MACP,KAAK;MACL,MAAM;KACT;EACL;AACA,QAAM,EAAE,OAAO,KAAK,KAAI,IAAK;AAC7B,SAAO;IACH,OAAO,gBAAgB,OAAO,IAAI;IAClC,KAAK,gBAAgB,KAAK,KAAK;IAC/B,MAAM,gBAAgB,MAAM,IAAI;;AAExC;AAEA,SAAS,gBAAgBC,SAAqC,OAAc;AACxE,MAAI,OAAOA,YAAW,YAAY,OAAOA,YAAW,UAAU;AAC1D,UAAM,UAAU,OAAOA,YAAW,WAAW,aAAaA,OAAM,IAAIA,QAAO;AAC3E,QAAI,OAAO;AACP,aAAO,IAAI,OAAO,QAAQ,OAAO,EAAE;IACvC,OAAO;AACH,aAAO,IAAI,OAAO,OAAO,OAAO,OAAO;IAC3C;EACJ,OAAO;AACH,WAAOA;EACX;AACJ;AAEA,IAAM,mBAAN,MAAsB;EAKlB,YAAY,UAA0B,OAAY;AAC9C,SAAK,WAAW;AAChB,SAAK,QAAQ;EACjB;EAEA,OAAO,MAAY;AACf,WAAO,KAAK,WAAU,EAAG,KAAK,OAAK,EAAE,SAAS,IAAI;EACtD;EAEA,QAAQ,MAAY;AAChB,WAAO,KAAK,WAAU,EAAG,OAAO,OAAK,EAAE,SAAS,IAAI;EACxD;EAEQ,aAAU;AACd,WAAO,KAAK,SAAS,OAAO,OAAK,UAAU,CAAC;EAChD;EAEA,WAAQ;AACJ,QAAI,QAAQ;AACZ,eAAW,WAAW,KAAK,UAAU;AACjC,UAAI,MAAM,WAAW,GAAG;AACpB,gBAAQ,QAAQ,SAAQ;MAC5B,OAAO;AACH,cAAM,OAAO,QAAQ,SAAQ;AAC7B,iBAAS,aAAa,KAAK,IAAI;MACnC;IACJ;AACA,WAAO,MAAM,KAAI;EACrB;EAEA,WAAW,SAA4B;AACnC,QAAI,QAAQ;AACZ,eAAW,WAAW,KAAK,UAAU;AACjC,UAAI,MAAM,WAAW,GAAG;AACpB,gBAAQ,QAAQ,WAAW,OAAO;MACtC,OAAO;AACH,cAAM,OAAO,QAAQ,WAAW,OAAO;AACvC,iBAAS,aAAa,KAAK,IAAI;MACnC;IACJ;AACA,WAAO,MAAM,KAAI;EACrB;;AAGJ,IAAM,eAAN,MAAkB;EAMd,YAAY,MAAc,SAAyB,QAAiB,OAAY;AAC5E,SAAK,OAAO;AACZ,SAAK,UAAU;AACf,SAAK,SAAS;AACd,SAAK,QAAQ;EACjB;EAEA,WAAQ;AACJ,QAAI,OAAO,IAAI,KAAK,IAAI;AACxB,UAAM,UAAU,KAAK,QAAQ,SAAQ;AACrC,QAAI,KAAK,QAAQ,QAAQ,WAAW,GAAG;AACnC,aAAO,GAAG,IAAI,IAAI,OAAO;IAC7B,WAAW,KAAK,QAAQ,QAAQ,SAAS,GAAG;AACxC,aAAO,GAAG,IAAI;EAAK,OAAO;IAC9B;AACA,QAAI,KAAK,QAAQ;AAEb,aAAO,IAAI,IAAI;IACnB,OAAO;AACH,aAAO;IACX;EACJ;EAEA,WAAW,SAA4B;AAvjB3C;AAwjBQ,YAAO,8CAAS,cAAT,iCAAqB,UAArB,YAA8B,KAAK,kBAAkB,OAAO;EACvE;EAEQ,kBAAkB,SAA4B;AAClD,UAAM,UAAU,KAAK,QAAQ,WAAW,OAAO;AAC/C,QAAI,KAAK,QAAQ;AACb,YAAM,WAAW,gBAAgB,KAAK,MAAM,SAAS,4BAAW,CAAA,CAAE;AAClE,UAAI,OAAO,aAAa,UAAU;AAC9B,eAAO;MACX;IACJ;AACA,QAAI,SAAS;AACb,SAAI,mCAAS,SAAQ,aAAY,mCAAS,SAAQ,QAAW;AACzD,eAAS;IACb,YAAW,mCAAS,SAAQ,QAAQ;AAChC,eAAS;IACb,YAAW,mCAAS,SAAQ,eAAe;AACvC,eAAS;IACb;AACA,QAAI,OAAO,GAAG,MAAM,IAAI,KAAK,IAAI,GAAG,MAAM;AAC1C,QAAI,KAAK,QAAQ,QAAQ,WAAW,GAAG;AACnC,aAAO,GAAG,IAAI,WAAM,OAAO;IAC/B,WAAW,KAAK,QAAQ,QAAQ,SAAS,GAAG;AACxC,aAAO,GAAG,IAAI;EAAK,OAAO;IAC9B;AACA,QAAI,KAAK,QAAQ;AAEb,aAAO,IAAI,IAAI;IACnB,OAAO;AACH,aAAO;IACX;EACJ;;AAGJ,SAAS,gBAAgB,KAAa,SAAiB,SAA2B;AA1lBlF;AA2lBI,MAAI,QAAQ,eAAe,QAAQ,cAAc,QAAQ,QAAQ;AAC7D,UAAM,QAAQ,QAAQ,QAAQ,GAAG;AACjC,QAAI,UAAU;AACd,QAAI,QAAQ,GAAG;AACX,YAAM,eAAe,eAAe,SAAS,KAAK;AAClD,gBAAU,QAAQ,UAAU,YAAY;AACxC,gBAAU,QAAQ,UAAU,GAAG,KAAK;IACxC;AACA,QAAI,QAAQ,cAAe,QAAQ,UAAU,QAAQ,SAAS,QAAS;AAEnE,gBAAU,KAAK,OAAO;IAC1B;AACA,UAAM,gBAAe,mBAAQ,eAAR,iCAAqB,SAAS,aAA9B,YAA0C,kBAAkB,SAAS,OAAO;AACjG,WAAO;EACX;AACA,SAAO;AACX;AAEA,SAAS,kBAAkB,SAAiB,SAAe;AACvD,MAAI;AACA,IAAAC,KAAI,MAAM,SAAS,IAAI;AACvB,WAAO,IAAI,OAAO,KAAK,OAAO;EAClC,SAAQ;AACJ,WAAO;EACX;AACJ;AAEA,IAAM,gBAAN,MAAmB;EAIf,YAAY,OAAsB,OAAY;AAC1C,SAAK,UAAU;AACf,SAAK,QAAQ;EACjB;EAEA,WAAQ;AACJ,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;AAC1C,YAAM,SAAS,KAAK,QAAQ,CAAC;AAC7B,YAAM,OAAO,KAAK,QAAQ,IAAI,CAAC;AAC/B,cAAQ,OAAO,SAAQ;AACvB,UAAI,QAAQ,KAAK,MAAM,MAAM,OAAO,OAAO,MAAM,MAAM,MAAM;AACzD,gBAAQ;MACZ;IACJ;AACA,WAAO;EACX;EAEA,WAAW,SAA4B;AACnC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;AAC1C,YAAM,SAAS,KAAK,QAAQ,CAAC;AAC7B,YAAM,OAAO,KAAK,QAAQ,IAAI,CAAC;AAC/B,cAAQ,OAAO,WAAW,OAAO;AACjC,UAAI,QAAQ,KAAK,MAAM,MAAM,OAAO,OAAO,MAAM,MAAM,MAAM;AACzD,gBAAQ;MACZ;IACJ;AACA,WAAO;EACX;;AAGJ,IAAM,gBAAN,MAAmB;EAIf,YAAY,MAAc,OAAY;AAClC,SAAK,OAAO;AACZ,SAAK,QAAQ;EACjB;EAEA,WAAQ;AACJ,WAAO,KAAK;EAChB;EACA,aAAU;AACN,WAAO,KAAK;EAChB;;AAIJ,SAAS,aAAa,MAAY;AAC9B,MAAI,KAAK,SAAS,IAAI,GAAG;AACrB,WAAO;EACX,OAAO;AACH,WAAO;EACX;AACJ;;;ACxpBM,IAAO,6BAAP,MAAiC;EAKnC,YAAY,UAA6B;AACrC,SAAK,eAAe,SAAS,OAAO,UAAU;AAC9C,SAAK,kBAAkB,SAAS,cAAc;EAClD;EAEA,iBAAiB,MAAa;AAC1B,UAAM,UAAU,KAAK,gBAAgB,WAAW,IAAI;AACpD,QAAI,WAAW,QAAQ,OAAO,GAAG;AAC7B,YAAM,cAAc,WAAW,OAAO;AACtC,aAAO,YAAY,WAAW;QAC1B,YAAY,CAAC,MAAM,YAAW;AAC1B,iBAAO,KAAK,0BAA0B,MAAM,MAAM,OAAO;QAC7D;QACA,WAAW,CAAC,QAAO;AACf,iBAAO,KAAK,yBAAyB,MAAM,GAAG;QAClD;OACH;IACL;AACA,WAAO;EACX;EAEU,0BAA0B,MAAe,MAAc,SAAe;AApDpF;AAqDQ,UAAM,eAAc,UAAK,uBAAuB,MAAM,IAAI,MAAtC,YAA2C,KAAK,sBAAsB,MAAM,IAAI;AACpG,QAAI,eAAe,YAAY,aAAa;AACxC,YAAM,OAAO,YAAY,YAAY,MAAM,MAAM,OAAO;AACxD,YAAM,YAAY,YAAY,YAAY,MAAM,MAAM,YAAY;AAClE,YAAM,MAAM,YAAY,YAAY,KAAK,EAAE,UAAU,IAAI,IAAI,IAAI,SAAS,GAAE,CAAE;AAC9E,aAAO,IAAI,OAAO,KAAK,IAAI,SAAQ,CAAE;IACzC,OAAO;AACH,aAAO;IACX;EACJ;EAEU,yBAAyB,OAAgB,MAAc;AAE7D,WAAO;EACX;EAEU,uBAAuB,MAAe,MAAY;AACxD,UAAM,WAAW,YAAY,IAAI;AACjC,UAAM,cAAc,SAAS;AAC7B,QAAI,CAAC,aAAa;AACd,aAAO;IACX;AACA,QAAI,cAAmC;AACvC,OAAG;AACC,YAAM,kBAAkB,YAAY,UAAU,WAAW;AACzD,YAAM,cAAc,gBAAgB,KAAK,OAAK,EAAE,SAAS,IAAI;AAC7D,UAAI,aAAa;AACb,eAAO;MACX;AACA,oBAAc,YAAY;IAC9B,SAAS;AAET,WAAO;EACX;EAEU,sBAAsB,MAAe,MAAY;AACvD,UAAM,cAAc,KAAK,aAAa,YAAW,EAAG,KAAK,OAAK,EAAE,SAAS,IAAI;AAC7E,WAAO;EACX;;;;ACrFJ,IAAAC,yCAAoC;;;ACmC9B,IAAO,qBAAP,MAAyB;EAI3B,YAAY,UAA6B;AACrC,SAAK,aAAa,SAAS,OAAO;EACtC;EAEA,MAAyB,MAAc,cAA+B;AAClE,WAAO,QAAQ,QAAQ,KAAK,WAAW,MAAS,IAAI,CAAC;EACzD;;;;ACxCE,IAAO,mCAAP,MAAuC;EAEzC,iCAAiC,UAAkB,aAAqB,QAAgB,MAAe,QAAe;AAClH,WAAO,0BAA0B,iCAAiC,UAAU,aAAa,QAAQ,MAAM,MAAM;EACjH;EAEA,iCAAiC,OAAa;AAC1C,WAAO,0BAA0B,iCAAiC,KAAK;EAC3E;;AAyBG,IAAM,2BAA4C,EAAE,MAAM,OAAM;AAOjE,IAAO,eAAP,MAAmB;EAOrB,YAAY,UAA6B;AACrC,SAAK,uBAAuB,SAAS,OAAO;AAC5C,SAAK,eAAe,SAAS,OAAO;AACpC,UAAM,SAAS,KAAK,aAAa,YAAY,SAAS,SAAS;MAC3D,iBAAiB,SAAS,iBAAiB;KAC9C;AACD,SAAK,aAAa,KAAK,sBAAsB,MAAM;AACnD,UAAM,cAAc,sBAAsB,MAAM,IAAI,OAAO,OAAO,MAAM,IAAI;AAC5E,UAAM,aAAa,SAAS,iBAAiB,SAAS;AACtD,SAAK,kBAAkB,IAAI,MAAgB,aAAa;MACpD,kBAAkB;MAClB,iBAAiB;MACjB,sBAAsB,KAAK;KAC9B;EACL;EAEA,IAAI,aAAU;AACV,WAAO,KAAK;EAChB;EAEA,SAAS,MAAc,WAA4B,0BAAwB;AA9E/E;AA+EQ,UAAM,mBAAmB,KAAK,gBAAgB,SAAS,IAAI;AAC3D,WAAO;MACH,QAAQ,iBAAiB;MACzB,QAAQ,iBAAiB;MACzB,SAAQ,sBAAiB,OAAO,WAAxB,YAAkC,CAAA;MAC1C,SAAQ,gBAAK,cAAa,sBAAlB,4BAAsC;;EAEtD;EAEU,sBAAsB,aAA4B;AACxD,QAAI,sBAAsB,WAAW;AAAG,aAAO;AAC/C,UAAM,SAAS,4BAA4B,WAAW,IAAI,OAAO,OAAO,YAAY,KAAK,EAAE,KAAI,IAAK;AACpG,UAAM,MAA2B,CAAA;AACjC,WAAO,QAAQ,WAAS,IAAI,MAAM,IAAI,IAAI,KAAK;AAC/C,WAAO;EACX;;AAME,SAAU,iBAAiB,iBAAgC;AAC7D,SAAO,MAAM,QAAQ,eAAe,MAAM,gBAAgB,WAAW,KAAK,UAAU,gBAAgB,CAAC;AACzG;AAKM,SAAU,4BAA4B,iBAAgC;AACxE,SAAO,mBAAmB,WAAW,mBAAmB,iBAAiB;AAC7E;AAKM,SAAU,sBAAsB,iBAAgC;AAClE,SAAO,CAAC,iBAAiB,eAAe,KAAK,CAAC,4BAA4B,eAAe;AAC7F;;;ACrEM,IAAO,kBAAP,MAAsB;EASxB,YAAY,UAA6B;AAHtB,SAAA,sBAAsB,IAAI,MAAK;AAC/B,SAAA,iBAAiB,IAAI,MAAK;AAGzC,SAAK,UAAU,SAAS;AACxB,SAAK,QAAQ,SAAS,OAAO;AAC7B,SAAK,SAAS,SAAS,WAAW;EACtC;EAEA,UAAU,QAA4B;AAClC,WAAO;MACH,aAAa,OAAO;MACpB,aAAa,OAAO,cAAc,KAAK,qBAAqB,OAAO,WAAW,IAAI;;;MAGlF,cAAc,OAAO,aAAa,IAAI,OAAM,iCAAK,IAAL,EAAQ,SAAS,EAAE,QAAO,EAAG;MACzE,OAAO,KAAK,iBAAiB,OAAO,OAAO,KAAK,wBAAwB,OAAO,KAAK,CAAC;;EAE7F;EAEU,qBAAqB,aAAyB;AAEpD,WAAO;EACX;EAEU,wBAAwB,MAAa;AAC3C,UAAM,WAAW,oBAAI,IAAG;AACxB,UAAM,WAAW,oBAAI,IAAG;AACxB,eAAW,WAAW,UAAU,IAAI,GAAG;AACnC,eAAS,IAAI,SAAS,CAAA,CAAE;IAC5B;AACA,QAAI,KAAK,UAAU;AACf,iBAAW,WAAW,UAAU,KAAK,QAAQ,GAAG;AAC5C,iBAAS,IAAI,SAAS,CAAA,CAAE;MAC5B;IACJ;AACA,WAAO;MACH;MACA;;EAER;EAEU,iBAAiB,MAAe,SAAyB;AAC/D,UAAM,MAAM,QAAQ,SAAS,IAAI,IAAI;AACrC,QAAI,QAAQ,KAAK;AACjB,QAAI,kBAAkB,KAAK;AAC3B,QAAI,qBAAqB,KAAK;AAC9B,QAAI,KAAK,aAAa,QAAW;AAC7B,UAAI,WAAW,KAAK,iBAAiB,KAAK,UAAU,OAAO;IAC/D;AACA,eAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC9C,UAAI,KAAK,WAAW,GAAG,GAAG;AACtB;MACJ;AACA,UAAI,MAAM,QAAQ,KAAK,GAAG;AACtB,cAAM,MAAa,CAAA;AACnB,YAAI,IAAI,IAAI;AACZ,mBAAW,QAAQ,OAAO;AACtB,cAAI,UAAU,IAAI,GAAG;AACjB,gBAAI,KAAK,KAAK,iBAAiB,MAAM,OAAO,CAAC;UACjD,WAAW,YAAY,IAAI,GAAG;AAC1B,gBAAI,KAAK,KAAK,mBAAmB,MAAM,OAAO,CAAC;UACnD,OAAO;AACH,gBAAI,KAAK,IAAI;UACjB;QACJ;MACJ,WAAW,UAAU,KAAK,GAAG;AACzB,YAAI,IAAI,IAAI,KAAK,iBAAiB,OAAO,OAAO;MACpD,WAAW,YAAY,KAAK,GAAG;AAC3B,YAAI,IAAI,IAAI,KAAK,mBAAmB,OAAO,OAAO;MACtD,WAAW,UAAU,QAAW;AAC5B,YAAI,IAAI,IAAI;MAChB;IACJ;AACA,WAAO;EACX;EAEU,mBAAmB,WAAsB,SAAyB;AACxE,UAAM,MAA+B,CAAA;AACrC,QAAI,WAAW,UAAU;AACzB,QAAI,UAAU,UAAU;AACpB,UAAI,WAAW,QAAQ,SAAS,IAAI,UAAU,QAAQ;IAC1D;AACA,WAAO;EACX;EAEU,iBAAiB,MAAe,SAAyB;AAC/D,UAAM,UAAU,QAAQ,SAAS,IAAI,IAAI;AACzC,QAAI,cAAc,IAAI,GAAG;AACrB,cAAQ,WAAW,KAAK;IAC5B,OAAO;AAEH,cAAQ,gBAAgB,KAAK,oBAAoB,KAAK,aAAa;IACvE;AACA,YAAQ,SAAS,KAAK;AACtB,YAAQ,UAAU,QAAQ,SAAS,IAAI,KAAK,OAAO;AACnD,QAAI,mBAAmB,IAAI,GAAG;AAC1B,cAAQ,UAAU,KAAK,QAAQ,IAAI,WAAS,KAAK,iBAAiB,OAAO,OAAO,CAAC;IACrF,WAAW,cAAc,IAAI,GAAG;AAC5B,cAAQ,YAAY,KAAK,UAAU;AACnC,cAAQ,SAAS,KAAK;AACtB,cAAQ,SAAS,KAAK;AACtB,cAAQ,YAAY,KAAK,MAAM,MAAM;AACrC,cAAQ,cAAc,KAAK,MAAM,MAAM;AACvC,cAAQ,UAAU,KAAK,MAAM,IAAI;AACjC,cAAQ,YAAY,KAAK,MAAM,IAAI;IACvC;AACA,WAAO;EACX;EAEA,QAAqC,QAA2B;AAC5D,UAAM,OAAO,OAAO;AACpB,UAAM,UAAU,KAAK,uBAAuB,IAAI;AAChD,QAAI,cAAc,MAAM;AACpB,WAAK,eAAe,KAAK,UAAU,OAAO;IAC9C;AACA,WAAO;MACH,aAAa,OAAO;MACpB,aAAa,OAAO;MACpB,cAAc,OAAO;MACrB,OAAO,KAAK,eAAe,MAAM,OAAO;;EAEhD;EAEU,uBAAuB,MAAS;AACtC,UAAM,WAAW,oBAAI,IAAG;AACxB,UAAM,WAAW,oBAAI,IAAG;AACxB,eAAW,WAAW,UAAU,IAAI,GAAG;AACnC,eAAS,IAAI,SAAS,CAAA,CAAa;IACvC;AACA,QAAIC;AACJ,QAAI,KAAK,UAAU;AACf,iBAAW,WAAW,UAAU,KAAK,QAAQ,GAAG;AAC5C,YAAI;AACJ,YAAI,cAAc,SAAS;AACvB,gBAAM,IAAI,gBAAgB,QAAQ,QAAkB;AACpD,UAAAA,QAAO;QACX,WAAW,aAAa,SAAS;AAC7B,gBAAM,IAAI,qBAAoB;QAClC,WAAW,eAAe,SAAS;AAC/B,gBAAM,KAAK,mBAAmB,OAAO;QACzC;AACA,YAAI,KAAK;AACL,mBAAS,IAAI,SAAS,GAAG;AACzB,cAAI,OAAOA;QACf;MACJ;IACJ;AACA,WAAO;MACH;MACA;;EAER;EAEU,eAAe,MAAW,SAAuB;AACvD,UAAM,UAAU,QAAQ,SAAS,IAAI,IAAI;AACzC,YAAQ,QAAQ,KAAK;AACrB,YAAQ,kBAAkB,KAAK;AAC/B,YAAQ,qBAAqB,KAAK;AAClC,QAAI,KAAK,UAAU;AACf,cAAQ,WAAW,QAAQ,SAAS,IAAI,KAAK,QAAQ;IACzD;AACA,eAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC9C,UAAI,KAAK,WAAW,GAAG,GAAG;AACtB;MACJ;AACA,UAAI,MAAM,QAAQ,KAAK,GAAG;AACtB,cAAM,MAAiB,CAAA;AACvB,gBAAQ,IAAI,IAAI;AAChB,mBAAW,QAAQ,OAAO;AACtB,cAAI,UAAU,IAAI,GAAG;AACjB,gBAAI,KAAK,KAAK,UAAU,KAAK,eAAe,MAAM,OAAO,GAAG,OAAO,CAAC;UACxE,WAAW,YAAY,IAAI,GAAG;AAC1B,gBAAI,KAAK,KAAK,iBAAiB,MAAM,SAAS,MAAM,OAAO,CAAC;UAChE,OAAO;AACH,gBAAI,KAAK,IAAI;UACjB;QACJ;MACJ,WAAW,UAAU,KAAK,GAAG;AACzB,gBAAQ,IAAI,IAAI,KAAK,UAAU,KAAK,eAAe,OAAO,OAAO,GAAG,OAAO;MAC/E,WAAW,YAAY,KAAK,GAAG;AAC3B,gBAAQ,IAAI,IAAI,KAAK,iBAAiB,OAAO,SAAS,MAAM,OAAO;MACvE,WAAW,UAAU,QAAW;AAC5B,gBAAQ,IAAI,IAAI;MACpB;IACJ;AACA,WAAO;EACX;EAEU,UAAU,MAAW,QAAW;AACtC,SAAK,aAAa;AAClB,WAAO;EACX;EAEU,iBAAiB,WAAgB,MAAe,MAAc,SAAuB;AAC3F,WAAO,KAAK,OAAO,eAAe,MAAM,MAAM,QAAQ,SAAS,IAAI,UAAU,QAAQ,GAAI,UAAU,QAAQ;EAC/G;EAEU,eAAe,SAAc,SAAyB,MAAM,GAAC;AACnE,UAAM,aAAa,QAAQ,SAAS,IAAI,OAAO;AAC/C,QAAI,OAAO,QAAQ,kBAAkB,UAAU;AAC3C,iBAAW,gBAAgB,KAAK,kBAAkB,QAAQ,aAAa;IAC3E;AACA,eAAW,UAAU,QAAQ,SAAS,IAAI,QAAQ,OAAO;AACzD,QAAI,mBAAmB,UAAU,GAAG;AAChC,iBAAW,SAAS,QAAQ,SAAS;AACjC,cAAM,WAAW,KAAK,eAAe,OAAO,SAAS,KAAK;AAC1D,mBAAW,QAAQ,KAAK,QAAQ;MACpC;IACJ;AACA,WAAO;EACX;EAEU,mBAAmB,SAAY;AACrC,UAAM,YAAY,KAAK,aAAa,QAAQ,SAAS;AACrD,UAAM,SAAS,QAAQ;AACvB,UAAM,SAAS,QAAQ;AACvB,UAAM,YAAY,QAAQ;AAC1B,UAAM,cAAc,QAAQ;AAC5B,UAAM,UAAU,QAAQ;AACxB,UAAM,YAAY,QAAQ;AAC1B,UAAM,SAAS,QAAQ;AACvB,UAAM,OAAO,IAAI,gBACb,QACA,QACA;MACI,OAAO;QACH,MAAM;QACN,WAAW;;MAEf,KAAK;QACD,MAAM;QACN,WAAW;;OAGnB,WACA,MAAM;AAEV,WAAO;EACX;EAEU,aAAa,MAAY;AAC/B,WAAO,KAAK,MAAM,WAAW,IAAI;EACrC;EAEU,oBAAoB,MAAiC;AAC3D,QAAI,CAAC,MAAM;AACP,aAAO;IACX;AACA,QAAI,KAAK,oBAAoB,SAAS,GAAG;AACrC,WAAK,0BAAyB;IAClC;AACA,WAAO,KAAK,oBAAoB,IAAI,IAAI;EAC5C;EAEU,kBAAkB,IAAU;AAClC,QAAI,KAAK,oBAAoB,SAAS,GAAG;AACrC,WAAK,0BAAyB;IAClC;AACA,UAAM,UAAU,KAAK,oBAAoB,OAAO,EAAE;AAClD,WAAO;EACX;EAEU,4BAAyB;AAC/B,QAAI,KAAK;AACT,eAAW,WAAW,UAAU,KAAK,OAAO,GAAG;AAC3C,UAAI,kBAAkB,OAAO,GAAG;AAC5B,aAAK,oBAAoB,IAAI,SAAS,IAAI;MAC9C;IACJ;EACJ;;;;AC/SE,IAAW;CAAjB,SAAiBC,aAAU;AAGvB,WAAgB,OAAO,UAAoC;AACvD,WAAO;MACH,SAAS,YAAY,MAAM,SAAQ;;EAE3C;AAJgB,EAAAA,YAAA,SAAM;AAK1B,GARiB,eAAA,aAAU,CAAA,EAAA;;;ACsDrB,IAAO,0BAAP,MAA8B;EAEhC,KAAK,MAAS;AACV,UAAM,IAAI,MAAM,8BAA8B;EAClD;EAEA,SAAS,MAAS;AACd,UAAM,IAAI,MAAM,8BAA8B;EAClD;EACA,MAAM,SAAM;AACR,WAAO;EACX;EAEA,aAAU;AACN,WAAO;EACX;EAEA,aAAU;AACN,UAAM,IAAI,MAAM,8BAA8B;EAClD;EAEA,iBAAc;AACV,UAAM,IAAI,MAAM,8BAA8B;EAClD;EAEA,WAAQ;AACJ,UAAM,IAAI,MAAM,8BAA8B;EAClD;EAEA,eAAY;AACR,UAAM,IAAI,MAAM,8BAA8B;EAClD;EAEA,MAAM,gBAAa;AACf,WAAO,CAAA;EACX;EAEA,oBAAiB;AACb,WAAO,CAAA;EACX;;AAIG,IAAM,kBAAkB;EAC3B,oBAAoB,MAAM,IAAI,wBAAuB;;;;ACvGzD,IAAM,uBAAgF;EAClF,SAAS,MAAM;EACf,kBAAkB,OAAO;IACrB,iBAAiB;IACjB,gBAAgB,CAAC,UAAU;IAC3B,YAAY;;;AAIpB,IAAM,6BAAkG;EACpG,eAAe,MAAM,IAAQ,4BAA2B;;AAG5D,SAAS,+BAA4B;AACjC,QAAMC,UAAS,OACX,8BAA8B,eAAe,GAC7C,0BAA0B;AAE9B,QAAM,UAAU,OACZ,wBAAwB,EAAE,QAAAA,QAAM,CAAE,GAClC,oBAAoB;AAExB,EAAAA,QAAO,gBAAgB,SAAS,OAAO;AACvC,SAAO;AACX;AAMM,SAAU,oBAAoB,MAAY;AA7ChD;AA8CI,QAAM,WAAW,6BAA4B;AAC7C,QAAM,UAAU,SAAS,WAAW,eAAe,YAAY,IAAI;AACnE,WAAS,OAAO,UAAU,uBAAuB,UAAU,SAASC,KAAI,MAAM,YAAW,aAAQ,SAAR,YAAgB,SAAS,UAAU,CAAC;AAC7H,SAAO;AACX;;;ACZM,IAAO,oCAAP,MAAwC;EAK1C,YAAY,UAA6B;AACrC,SAAK,iBAAiB,SAAS,UAAU;AACzC,SAAK,eAAe,SAAS,WAAW;EAC5C;EAEA,kBAAkB,MAAe,MAA0B,UAA0B;AACjF,UAAM,MAAM,8BAAY,YAAY,IAAI;AACxC,0BAAA,OAAS,KAAK,aAAa,QAAQ,IAAI;AACvC,UAAM,OAAO,KAAK,eAAe,eAAe,IAAI;AACpD,QAAI,CAAC,MAAM;AACP,YAAM,IAAI,MAAM,gBAAgB,IAAI,eAAe;IACvD;AACA,QAAI;AACJ,UAAM,oBAAoB,MAAG;AAxDrC;AAwDwC,yDAAA,kBAAoB,mBAAkB,UAAK,aAAa,YAAY,IAAI,MAAlC,YAAuC,KAAK,QAAQ;;AAC1H,WAAO;MACH;MACA;MACA,IAAI,cAAW;AACX,eAAO,kBAAiB;MAC5B;MACA,kBAAkB,kBAAkB,KAAK,QAAQ;MACjD,MAAM,KAAK;MACX,aAAa,IAAI;MACjB;;EAER;;AAuCE,IAAO,sCAAP,MAA0C;EAI5C,YAAY,UAA6B;AACrC,SAAK,cAAc,SAAS,UAAU;EAC1C;EAEA,MAAM,mBAAmB,UAA2B,cAAc,wDAAkB,MAAI;AACpF,UAAM,QAAgC,CAAA;AACtC,UAAM,WAAW,SAAS,YAAY;AACtC,eAAW,WAAW,UAAU,QAAQ,GAAG;AACvC,YAAM,kBAAkB,WAAW;AACnC,uBAAiB,OAAO,EAAE,QAAQ,aAAU;AACxC,YAAI,CAAC,QAAQ,UAAU,OAAO;AAC1B,gBAAM,KAAK,GAAG,KAAK,uBAAuB,OAAO,CAAC;QACtD;MACJ,CAAC;IACL;AACA,WAAO;EACX;EAEU,uBAAuB,SAAsB;AACnD,UAAM,YAAY,QAAQ;AAC1B,QAAI,UAAU,SAAS,CAAC,UAAU,UAAU;AACxC,aAAO,CAAA;IACX;AACA,QAAI,QAA8B,CAAA;AAClC,QAAI,YAAY,SAAS,KAAK,UAAU,kBAAkB;AACtD,cAAQ,CAAC,UAAU,gBAAgB;IACvC,WAAW,iBAAiB,SAAS,GAAG;AACpC,cAAQ,UAAU,MAAM,IAAI,OAAK,EAAE,gBAAgB,EAAE,OAAO,OAAK,MAAM,MAAS;IACpF;AACA,UAAM,YAAY,YAAY,QAAQ,SAAS,EAAE;AACjD,UAAM,aAAa,KAAK,YAAY,eAAe,QAAQ,SAAS;AACpE,UAAM,eAAuC,CAAA;AAC7C,UAAM,UAAU,kBAAkB,UAAU,QAAQ;AACpD,eAAW,QAAQ,OAAO;AACtB,mBAAa,KAAK;QACd;QACA;QACA,WAAW,KAAK;QAChB,YAAY,KAAK;QACjB;QACA,OAAO,SAAS,OAAO,KAAK,aAAa,SAAS;OACrD;IACL;AACA,WAAO;EACX;;;;ACxHE,IAAO,wBAAP,MAA4B;EAAlC,cAAA;AACc,SAAA,mBAAmB;AACnB,SAAA,iBAAiB;EAuC/B;EArCI,eAAe,MAAa;AACxB,QAAI,KAAK,YAAY;AACjB,YAAM,gBAAgB,KAAK,eAAe,KAAK,UAAU;AACzD,YAAM,aAAa,KAAK,eAAe,IAAI;AAC3C,YAAM,WAAW,gBAAgB,KAAK,mBAAmB;AACzD,aAAO;IACX;AACA,WAAO;EACX;EAEU,eAAe,EAAE,oBAAoB,gBAAe,GAAW;AACrE,QAAI,CAAC,oBAAoB;AACrB,YAAM,IAAI,MAAM,2CAA2C;IAC/D;AACA,QAAI,oBAAoB,QAAW;AAC/B,aAAO,qBAAqB,KAAK,iBAAiB;IACtD;AACA,WAAO;EACX;EAEA,WAAwC,MAAe,MAAY;AAC/D,UAAM,WAAW,KAAK,MAAM,KAAK,gBAAgB;AACjD,WAAO,SAAS,OAAO,CAAC,eAAe,iBAAgB;AACnD,UAAI,CAAC,iBAAiB,aAAa,WAAW,GAAG;AAC7C,eAAO;MACX;AACA,YAAM,gBAAgB,aAAa,QAAQ,KAAK,cAAc;AAC9D,UAAI,gBAAgB,GAAG;AACnB,cAAMC,YAAW,aAAa,UAAU,GAAG,aAAa;AACxD,cAAM,aAAa,SAAS,aAAa,UAAU,gBAAgB,CAAC,CAAC;AACrE,cAAM,QAAS,cAAuDA,SAAQ;AAC9E,eAAO,+BAAQ;MACnB;AACA,aAAQ,cAAqD,YAAY;IAC7E,GAAG,IAAI;EACX;;;;ACWE,IAAO,+BAAP,MAAmC;EAQrC,YAAY,UAAmC;AAL5B,SAAA,SAAS,IAAI,SAAQ;AACrB,SAAA,sCAAsC,IAAI,+CAAO;AAC1D,SAAA,WAAgD,CAAA;AAChD,SAAA,kBAAkB;AAGxB,SAAK,kBAAkB,SAAS;EACpC;EAEA,IAAI,QAAK;AACL,WAAO,KAAK,OAAO;EACvB;EAEA,WAAW,QAAwB;AArGvC;AAsGQ,SAAK,mBAAkB,kBAAO,aAAa,cAApB,mBAA+B,kBAA/B,YAAgD;EAC3E;EAEA,MAAM,YAAY,QAAsC;AACpD,QAAI,KAAK,iBAAiB;AACtB,UAAI,OAAO,UAAU;AAIjB,cAAM,YAAY,KAAK,gBAAgB;AACvC,eAAO,SAAS;;UAEZ,SAAS,UAAU,IAAI,UAAQ,KAAK,cAAc,KAAK,iBAAiB,UAAU,CAAC;SACtF;MACL;AAEA,UAAI,OAAO,oBAAoB;AAG3B,cAAM,iBAAiB,KAAK,gBAAgB,IAAI,IAAI,WAA2B;;UAE3E,SAAS,KAAK,cAAc,KAAK,iBAAiB,UAAU;UAC/D;AAGD,cAAM,UAAU,MAAM,OAAO,mBAAmB,cAAc;AAC9D,uBAAe,QAAQ,CAAC,MAAM,QAAO;AACjC,eAAK,2BAA2B,KAAK,SAAU,QAAQ,GAAG,CAAC;QAC/D,CAAC;MACL;IACJ;AACA,SAAK,OAAO,QAAO;EACvB;;;;;;;EAQA,oBAAoB,QAAoC;AACpD,QAAI,OAAO,OAAO,aAAa,YAAY,OAAO,aAAa,MAAM;AACjE;IACJ;AACA,WAAO,QAAQ,OAAO,QAAQ,EAAE,QAAQ,CAAC,CAAC,SAAS,aAAa,MAAK;AACjE,WAAK,2BAA2B,SAAS,aAAa;AACtD,WAAK,oCAAoC,KAAK,EAAE,SAAS,cAAa,CAAE;IAC5E,CAAC;EACL;EAEU,2BAA2B,SAAiB,eAAkB;AACpE,SAAK,SAAS,OAAO,IAAI;EAC7B;;;;;;;EAQA,MAAM,iBAAiB,UAAkB,eAAqB;AAC1D,UAAM,KAAK;AAEX,UAAM,cAAc,KAAK,cAAc,QAAQ;AAC/C,QAAI,KAAK,SAAS,WAAW,GAAG;AAC5B,aAAO,KAAK,SAAS,WAAW,EAAE,aAAa;IACnD;EACJ;EAEU,cAAc,YAAkB;AACtC,WAAO,GAAG,UAAU;EACxB;EAEA,IAAI,+BAA4B;AAC5B,WAAO,KAAK,oCAAoC;EACpD;;;;AC3KJ,IAAAC,yCAA6C;AAsIvC,IAAO,yBAAP,MAA6B;EAwB/B,YAAY,UAAmC;AAtB/C,SAAA,qBAAmC;;MAE/B,YAAY;QACR,YAAY,CAAC,YAAY,MAAM;;;AAYpB,SAAA,kBAA4C,CAAA;AAC5C,SAAA,sBAAsB,IAAI,SAAQ;AAClC,SAAA,yBAAyB,IAAI,SAAQ;AACrC,SAAA,aAAa,oBAAI,IAAG;AACpB,SAAA,uBAAuB,oBAAI,IAAG;AACvC,SAAA,eAAe,cAAc;AAGnC,SAAK,mBAAmB,SAAS,UAAU;AAC3C,SAAK,yBAAyB,SAAS,UAAU;AACjD,SAAK,gBAAgB,SAAS,UAAU;AACxC,SAAK,eAAe,SAAS,UAAU;AACvC,SAAK,qBAAqB,SAAS,UAAU;AAC7C,SAAK,mBAAmB,MAAM,SAAS,UAAU;AACjD,SAAK,kBAAkB,SAAS;EACpC;EAEA,MAAM,MAAyB,WAAsC,UAAwB,CAAA,GAAI,cAAc,wDAAkB,MAAI;AA9KzI;AA+KQ,eAAW,YAAY,WAAW;AAC9B,YAAM,MAAM,SAAS,IAAI,SAAQ;AACjC,UAAI,SAAS,UAAU,cAAc,WAAW;AAC5C,YAAI,OAAO,QAAQ,eAAe,aAAa,QAAQ,YAAY;AAE/D,eAAK,aAAa,UAAU,cAAc,iBAAiB;QAC/D,WAAW,OAAO,QAAQ,eAAe,UAAU;AAG/C,gBAAM,aAAa,KAAK,gCAAgC,UAAU,OAAO;AACzE,cAAI,WAAW,SAAS,GAAG;AAGvB,iBAAK,WAAW,IAAI,KAAK;cACrB,WAAW;cACX,SAAS;gBACL,YAAY;kBACR;;;cAGR,SAAQ,UAAK,WAAW,IAAI,GAAG,MAAvB,mBAA0B;aACrC;AAED,qBAAS,QAAQ,cAAc;UACnC;QACJ;MACJ,OAAO;AAEH,aAAK,WAAW,OAAO,GAAG;MAC9B;IACJ;AACA,SAAK,eAAe,cAAc;AAClC,UAAM,KAAK,WAAW,UAAU,IAAI,OAAK,EAAE,GAAG,GAAG,CAAA,CAAE;AACnD,UAAM,KAAK,eAAe,WAAW,SAAS,WAAW;EAC7D;EAEA,MAAM,OAAO,SAAgB,SAAgB,cAAc,wDAAkB,MAAI;AAC7E,SAAK,eAAe,cAAc;AAElC,UAAM,cAAqB,CAAA;AAC3B,eAAW,cAAc,SAAS;AAE9B,YAAM,cAAc,KAAK,iBAAiB,gBAAgB,UAAU;AACpE,iBAAW,OAAO,aAAa;AAC3B,oBAAY,KAAK,IAAI,GAAG;AACxB,aAAK,eAAe,GAAG;MAC3B;IACJ;AAEA,UAAM,eAAe,MAAM,QAAQ,IAAI,QAAQ,IAAI,SAAO,KAAK,gBAAgB,GAAG,CAAC,CAAC,GAAG,KAAI;AAE3F,eAAW,cAAc,aAAa;AAClC,UAAI,kBAAkB,KAAK,iBAAiB,YAAY,UAAU;AAClE,UAAI,oBAAoB,QAAW;AAI/B,0BAAkB,KAAK,uBAAuB,UAAU,EAAE,OAAO,UAAS,GAAI,UAAU;AACxF,wBAAgB,QAAQ,cAAc;AACtC,aAAK,iBAAiB,YAAY,eAAe;MACrD;AACA,WAAK,aAAa,iBAAiB,cAAc,OAAO;IAC5D;AAEA,UAAM,iBAAiB,OAAO,WAAW,EAAE,OAAO,WAAW,EAAE,IAAI,SAAO,IAAI,SAAQ,CAAE,EAAE,MAAK;AAC/F,SAAK,iBAAiB,IACjB,OAAO,SAAO,CAAC,eAAe,IAAI,IAAI,IAAI,SAAQ,CAAE,KAAK,KAAK,aAAa,KAAK,cAAc,CAAC,EAC/F,QAAQ,SAAO,KAAK,aAAa,KAAK,cAAc,cAAc,CAAC;AAExE,UAAM,KAAK,WAAW,aAAa,WAAW;AAE9C,UAAM,kBAAkB,WAAW;AAGnC,UAAM,mBAAmB,KAAK,cAC1B,KAAK,iBAAiB,IACjB,OAAO,SAAI;AA3P5B;AA6PoB;;YAAI,QAAQ,cAAc,aAEvB,GAAC,UAAK,WAAW,IAAI,IAAI,IAAI,SAAQ,CAAE,MAAtC,mBAAyC,cAG1C,KAAK,qBAAqB,KAAK,KAAK,kBAAkB;;KAAC,EAE7D,QAAO,CAAE;AAElB,UAAM,KAAK,eAAe,kBAAkB,KAAK,oBAAoB,WAAW;EACpF;EAEU,qBAAqB,UAA2B,SAAiC;AACvF,WAAO,KAAK,gCAAgC,UAAU,OAAO,EAAE,UAAU;EAC7E;EAEU,gCAAgC,UAA2B,SAAiC;AA7Q1G;AA8QQ,UAAM,QAAQ,KAAK,WAAW,IAAI,SAAS,IAAI,SAAQ,CAAE;AACzD,UAAM,gBAAgB,KAAK,gBAAgB,YAAY,SAAS,GAAG,EAAE,WAAW,mBAAmB,2BAA2B,QAAQ;AACtI,UAAM,uBAAqB,oCAAO,WAAP,mBAAe,oBAAmB,IAAI,KAAI,oCAAO,WAAP,mBAAe,gBAAgB,KAAI,+BAAO,aAAY,gBAAgB,oBAAI,IAAG;AAClJ,UAAM,sBAAuB,YAAY,UAAa,QAAQ,eAAe,OAAQ,gBAC/E,OAAO,QAAQ,eAAe,YAAY,aAAQ,WAAW,eAAnB,YAAiC,gBAAiB,CAAA;AAClG,WAAO,OAAO,mBAAmB,EAAE,OAAO,eAAa,CAAC,mBAAmB,IAAI,SAAS,CAAC,EAAE,QAAO;EACtG;EAEU,MAAM,gBAAgB,SAAY;AAtRhD;AAwRQ,UAAM,YAAW,UAAK,iBAAiB,YAAY,OAAO,MAAzC,aAA8C,UAAK,kBAAL,mBAAoB,IAAI;AACvF,QAAI,UAAU;AACV,aAAO,CAAC,OAAO;IACnB;AAEA,QAAI;AACA,YAAMC,QAAO,MAAM,KAAK,mBAAmB,KAAK,OAAO;AACvD,UAAIA,MAAK,aAAa;AAElB,cAAM,OAAO,MAAM,KAAK,iBAAgB,EAAG,aAAa,OAAO;AAC/D,eAAO;MACX,WAAW,KAAK,iBAAgB,EAAG,mBAAmBA,KAAI,GAAG;AAEzD,eAAO,CAAC,OAAO;MACnB;IACJ,SAAQ;IAER;AACA,WAAO,CAAA;EACX;EAEU,MAAM,WAAW,SAAgB,SAAc;AACrD,UAAM,QAAQ,IAAI,KAAK,gBAAgB,IAAI,cAAY,SAAS,SAAS,OAAO,CAAC,CAAC;EACtF;;;;;;;;EASU,cAAc,WAA4B;AAChD,QAAI,OAAO;AACX,QAAI,QAAQ,UAAU,SAAS;AAE/B,WAAO,OAAO,OAAO;AACjB,aAAO,OAAO,UAAU,UAAU,KAAK,gBAAgB,UAAU,IAAI,CAAC,GAAG;AACrE;MACJ;AAEA,aAAO,SAAS,KAAK,CAAC,KAAK,gBAAgB,UAAU,KAAK,CAAC,GAAG;AAC1D;MACJ;AAEA,UAAI,OAAO,OAAO;AACd,SAAC,UAAU,IAAI,GAAG,UAAU,KAAK,CAAC,IAAI,CAAC,UAAU,KAAK,GAAG,UAAU,IAAI,CAAC;MAC5E;IACJ;AAEA,WAAO;EACX;EAEQ,gBAAgB,KAAoB;AA7UhD;AA8UQ,WAAO,SAAQ,UAAK,kBAAL,mBAAoB,IAAI,IAAI,IAAI;EACnD;;;;EAKU,aAAa,UAA2B,aAAwB;AAEtE,QAAI,SAAS,WAAW,KAAK,SAAO,IAAI,UAAU,MAAS,GAAG;AAC1D,aAAO;IACX;AAEA,WAAO,KAAK,aAAa,WAAW,UAAU,WAAW;EAC7D;EAEA,SAAS,UAAgC;AACrC,SAAK,gBAAgB,KAAK,QAAQ;AAClC,WAAO,WAAW,OAAO,MAAK;AAC1B,YAAM,QAAQ,KAAK,gBAAgB,QAAQ,QAAQ;AACnD,UAAI,SAAS,GAAG;AACZ,aAAK,gBAAgB,OAAO,OAAO,CAAC;MACxC;IACJ,CAAC;EACL;EAEA,aAAgC,UAA8B,OAAoB;AAC9E,YAAQ,OAAO;MACX,KAAK,cAAc,SAAS;MAE5B;MACA,KAAK,cAAc;AACf,aAAK,aAAa,cAAc,SAAS,GAAG;;MAEhD,KAAK,cAAc;AACf,iBAAS,eAAe;;MAE5B,KAAK,cAAc,gBAAgB;AAC/B,cAAM,SAAS,KAAK,gBAAgB,YAAY,SAAS,GAAG,EAAE,WAAW;AACzE,eAAO,OAAO,QAAQ;MAE1B;MACA,KAAK,cAAc;AACf,aAAK,aAAa,iBAAiB,SAAS,GAAG;;MAEnD,KAAK,cAAc;AACf,iBAAS,cAAc;AACvB,aAAK,WAAW,OAAO,SAAS,IAAI,SAAQ,CAAE;;MAElD,KAAK,cAAc;IAEvB;AACA,QAAI,SAAS,QAAQ,OAAO;AACxB,eAAS,QAAQ;IACrB;EACJ;EAEU,eAAkC,UAA4B;AACpE,SAAK,WAAW,OAAO,SAAS,IAAI,SAAQ,CAAE;AAC9C,SAAK,aAAa,OAAO,SAAS,GAAG;AAIrC,aAAS,QAAQ,cAAc;EACnC;;;;;;;;;;EAWU,MAAM,eAAe,WAA8B,SAAuB,aAA8B;AAC9G,SAAK,aAAa,WAAW,OAAO;AAEpC,UAAM,KAAK,cAAc,WAAW,cAAc,QAAQ,aAAa,SACnE,KAAK,uBAAuB,OAAO,KAAK,WAAW,CAAC;AAGxD,UAAM,KAAK,cAAc,WAAW,cAAc,gBAAgB,aAAa,SAC3E,KAAK,aAAa,cAAc,KAAK,WAAW,CAAC;AAGrD,UAAM,KAAK,cAAc,WAAW,cAAc,gBAAgB,aAAa,OAAM,QAAM;AACvF,YAAM,mBAAmB,KAAK,gBAAgB,YAAY,IAAI,GAAG,EAAE,WAAW;AAC9E,UAAI,eAAe,MAAM,iBAAiB,oBAAoB,KAAK,WAAW;IAClF,CAAC;AAED,UAAM,aAAa,UAAU,OAAO,SAAO,KAAK,WAAW,GAAG,CAAC;AAC/D,UAAM,KAAK,cAAc,YAAY,cAAc,QAAQ,aAAa,SAAM;AAC1E,YAAM,SAAS,KAAK,gBAAgB,YAAY,IAAI,GAAG,EAAE,WAAW;AACpE,aAAO,OAAO,KAAK,KAAK,WAAW;IACvC,CAAC;AAED,UAAM,KAAK,cAAc,YAAY,cAAc,mBAAmB,aAAa,SAC/E,KAAK,aAAa,iBAAiB,KAAK,WAAW,CAAC;AAGxD,UAAM,gBAAgB,UAAU,OAAO,SAAM;AACzC,UAAI,KAAK,eAAe,GAAG,GAAG;AAC1B,eAAO;MACX,OAAO;AACH,aAAK,gBAAgB,GAAG;AACxB,eAAO;MACX;IACJ,CAAC;AACD,UAAM,KAAK,cAAc,eAAe,cAAc,WAAW,aAAa,OAAM,QAAM;AACtF,YAAM,KAAK,SAAS,KAAK,WAAW;AACpC,WAAK,gBAAgB,GAAG;IAC5B,CAAC;EACL;EAEU,gBAAgB,UAAyB;AAC/C,UAAM,QAAQ,KAAK,WAAW,IAAI,SAAS,IAAI,SAAQ,CAAE;AACzD,QAAI,OAAO;AACP,YAAM,YAAY;IACtB;EACJ;;;;;;;EAQU,aAAa,WAA8B,SAAqB;AACtE,eAAW,OAAO,WAAW;AACzB,YAAM,MAAM,IAAI,IAAI,SAAQ;AAC5B,YAAM,QAAQ,KAAK,WAAW,IAAI,GAAG;AACrC,UACI,CAAC,SACE,MAAM,WACX;AACE,aAAK,WAAW,IAAI,KAAK;UACrB,WAAW;UACX;UACA,QAAQ,+BAAO;SAClB;MACL,OAAO;MAGP;IACJ;EACJ;;;;;;;;;;;EAYU,MAAM,cAAc,WAA8B,aAA4B,aACpF,UAA8D;AAC9D,eAAW,YAAY,WAAW;AAC9B,UAAI,SAAS,QAAQ,aAAa;AAC9B,cAAM,kBAAkB,WAAW;AACnC,cAAM,SAAS,QAAQ;AACvB,iBAAS,QAAQ;AACjB,cAAM,KAAK,oBAAoB,UAAU,aAAa,WAAW;MACrE;IACJ;AAKA,UAAM,kBAAkB,UAAU,OAAO,SAAO,IAAI,UAAU,WAAW;AACzE,UAAM,KAAK,iBAAiB,iBAAiB,aAAa,WAAW;AACrE,SAAK,eAAe;EACxB;EAEA,aAAa,aAA4B,UAA+B;AACpE,SAAK,oBAAoB,IAAI,aAAa,QAAQ;AAClD,WAAO,WAAW,OAAO,MAAK;AAC1B,WAAK,oBAAoB,OAAO,aAAa,QAAQ;IACzD,CAAC;EACL;EAEA,gBAAgB,aAA4B,UAA+B;AACvE,SAAK,uBAAuB,IAAI,aAAa,QAAQ;AACrD,WAAO,WAAW,OAAO,MAAK;AAC1B,WAAK,uBAAuB,OAAO,aAAa,QAAQ;IAC5D,CAAC;EACL;EAIA,UAAU,OAAsB,YAAsC,aAA+B;AACjG,QAAI,MAAuB;AAC3B,QAAI,cAAc,UAAU,YAAY;AACpC,YAAM;IACV,OAAO;AACH,oBAAc;IAClB;AACA,wCAAA,cAAgB,wDAAkB;AAClC,QAAI,KAAK;AACL,aAAO,KAAK,mBAAmB,OAAO,KAAK,WAAW;IAE1D,OAAO;AACH,aAAO,KAAK,kBAAkB,OAAO,WAAW;IACpD;EACJ;EAEU,mBAAmB,OAAsB,KAAU,aAA8B;AACvF,UAAM,WAAW,KAAK,iBAAiB,YAAY,GAAG;AACtD,QAAI,CAAC,UAAU;AACX,aAAO,QAAQ,OACX,IAAI,qDACA,qDAAc,iBACd,8BAA8B,IAAI,SAAQ,CAAE,EAAE,CACjD;IAGT,WAAW,SAAS,SAAS,OAAO;AAChC,aAAO,QAAQ,QAAQ,GAAG;IAE9B,WAAW,YAAY,yBAAyB;AAC5C,aAAO,QAAQ,OAAO,kBAAkB;IAE5C,WAAW,KAAK,gBAAgB,SAAS,QAAQ,SAAS,OAAO;AAI7D,aAAO,QAAQ,OACX,IAAI,qDACA,qDAAc,eACd,qBAAqB,IAAI,SAAQ,CAAE,OAAO,cAAc,SAAS,KAAK,CAAC,eAAe,cAAc,KAAK,CAAC,oCAAoC,cAAc,KAAK,YAAY,CAAC,wBAAwB,CACzM;IAET;AACA,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAU;AACnC,YAAM,kBAAkB,KAAK,gBAAgB,OAAO,CAAC,QAAO;AACxD,YAAI,SAAS,OAAO,IAAI,KAAK,GAAG,GAAG;AAC/B,0BAAgB,QAAO;AACvB,2BAAiB,QAAO;AACxB,kBAAQ,IAAI,GAAG;QACnB;MACJ,CAAC;AACD,YAAM,mBAAmB,YAAa,wBAAwB,MAAK;AAC/D,wBAAgB,QAAO;AACvB,yBAAiB,QAAO;AACxB,eAAO,kBAAkB;MAC7B,CAAC;IACL,CAAC;EACL;EAEU,kBAAkB,OAAsB,aAA8B;AAC5E,QAAI,KAAK,gBAAgB,OAAO;AAC5B,aAAO,QAAQ,QAAO;IAC1B,WAAW,YAAY,yBAAyB;AAC5C,aAAO,QAAQ,OAAO,kBAAkB;IAC5C;AACA,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAU;AACnC,YAAM,kBAAkB,KAAK,aAAa,OAAO,MAAK;AAClD,wBAAgB,QAAO;AACvB,yBAAiB,QAAO;AACxB,gBAAO;MACX,CAAC;AACD,YAAM,mBAAmB,YAAa,wBAAwB,MAAK;AAC/D,wBAAgB,QAAO;AACvB,yBAAiB,QAAO;AACxB,eAAO,kBAAkB;MAC7B,CAAC;IACL,CAAC;EACL;EAEU,MAAM,oBAAoB,UAA2B,OAAsB,aAA8B;AAC/G,UAAM,YAAY,KAAK,uBAAuB,IAAI,KAAK;AACvD,UAAM,gBAAgB,UAAU,MAAK;AACrC,eAAW,YAAY,eAAe;AAClC,UAAI;AACA,cAAM,kBAAkB,WAAW;AACnC,cAAM,SAAS,UAAU,WAAW;MACxC,SAAS,KAAK;AAGV,YAAI,CAAC,qBAAqB,GAAG,GAAG;AAC5B,gBAAM;QACV;MACJ;IACJ;EACJ;EAEU,MAAM,iBAAiB,WAA8B,OAAsB,aAA8B;AAC/G,QAAI,UAAU,WAAW,GAAG;AAExB;IACJ;AACA,UAAM,YAAY,KAAK,oBAAoB,IAAI,KAAK;AACpD,UAAM,gBAAgB,UAAU,MAAK;AACrC,eAAW,YAAY,eAAe;AAClC,YAAM,kBAAkB,WAAW;AACnC,YAAM,SAAS,WAAW,WAAW;IACzC;EACJ;;;;;;;EAQU,WAAW,UAAyB;AAjoBlD;AAkoBQ,YAAO,UAAK,gBAAgB,QAAQ,EAAE,iBAA/B,YAA+C;EAC1D;;;;;;EAOU,eAAe,UAAyB;AAC9C,WAAO,QAAQ,KAAK,gBAAgB,QAAQ,EAAE,UAAU;EAC5D;;;;;EAMU,MAAM,SAAS,UAA2B,aAA8B;AAlpBtF;AAmpBQ,UAAM,YAAY,KAAK,gBAAgB,YAAY,SAAS,GAAG,EAAE,WAAW;AAC5E,UAAM,UAAU,KAAK,gBAAgB,QAAQ;AAC7C,UAAM,oBAAoB,OAAO,QAAQ,eAAe,WAAW,mBAAK,QAAQ,cAAe,CAAA;AAC/F,sBAAkB,aAAa,KAAK,gCAAgC,UAAU,OAAO;AACrF,UAAM,cAAc,MAAM,UAAU,iBAAiB,UAAU,mBAAmB,WAAW;AAC7F,QAAI,SAAS,aAAa;AACtB,eAAS,YAAY,KAAK,GAAG,WAAW;IAC5C,OAAO;AACH,eAAS,cAAc;IAC3B;AAGA,UAAM,QAAQ,KAAK,WAAW,IAAI,SAAS,IAAI,SAAQ,CAAE;AACzD,QAAI,OAAO;AACP,kBAAM,WAAN,YAAA,MAAM,SAAW,CAAA;AACjB,UAAI,MAAM,OAAO,kBAAkB;AAC/B,cAAM,OAAO,mBAAmB,OAAO,MAAM,OAAO,gBAAgB,EAAE,OAAO,kBAAkB,UAAU,EAAE,SAAQ,EAAG,QAAO;MACjI,OAAO;AACH,cAAM,OAAO,mBAAmB,CAAC,GAAG,kBAAkB,UAAU;MACpE;IACJ;EACJ;EAEU,gBAAgB,UAAyB;AA1qBvD;AA2qBQ,YAAO,gBAAK,WAAW,IAAI,SAAS,IAAI,SAAQ,CAAE,MAA3C,mBAA8C,YAA9C,YAAyD,CAAA;EACpE;;;;AC/kBE,IAAO,sBAAP,MAA0B;EAuB5B,YAAY,UAAmC;AAb5B,SAAA,cAAc,oBAAI,IAAG;AAKrB,SAAA,oBAAoB,IAAI,aAAY;AAMpC,SAAA,iBAAiB,oBAAI,IAAG;AAGvC,SAAK,YAAY,SAAS,UAAU;AACpC,SAAK,kBAAkB,SAAS;AAChC,SAAK,gBAAgB,SAAS;EAClC;EAEA,kBAAkB,YAAqB,aAAmB;AACtD,UAAM,eAAe,YAAY,UAAU,EAAE;AAC7C,UAAM,SAAiC,CAAA;AACvC,SAAK,eAAe,QAAQ,aAAU;AAClC,cAAQ,QAAQ,cAAW;AACvB,YAAI,SAAS,OAAO,SAAS,WAAW,YAAY,KAAK,SAAS,eAAe,aAAa;AAC1F,iBAAO,KAAK,QAAQ;QACxB;MACJ,CAAC;IACL,CAAC;AACD,WAAO,OAAO,MAAM;EACxB;EAEA,YAAY,UAAmB,MAAkB;AAC7C,QAAI,eAAe,OAAO,KAAK,YAAY,KAAI,CAAE;AACjD,QAAI,MAAM;AACN,qBAAe,aAAa,OAAO,SAAO,CAAC,QAAQ,KAAK,IAAI,GAAG,CAAC;IACpE;AACA,WAAO,aACF,IAAI,SAAO,KAAK,oBAAoB,KAAK,QAAQ,CAAC,EAClD,KAAI;EACb;EAEU,oBAAoB,KAAa,UAAiB;AAjJhE;AAkJQ,QAAI,CAAC,UAAU;AACX,cAAO,UAAK,YAAY,IAAI,GAAG,MAAxB,YAA6B,CAAA;IACxC;AACA,UAAM,eAAe,KAAK,kBAAkB,IAAI,KAAK,UAAU,MAAK;AArJ5E,UAAAC;AAsJY,YAAM,uBAAsBA,MAAA,KAAK,YAAY,IAAI,GAAG,MAAxB,OAAAA,MAA6B,CAAA;AACzD,aAAO,oBAAoB,OAAO,OAAK,KAAK,cAAc,UAAU,EAAE,MAAM,QAAQ,CAAC;IACzF,CAAC;AACD,WAAO;EACX;EAEA,OAAO,KAAQ;AACX,SAAK,cAAc,GAAG;AACtB,SAAK,iBAAiB,GAAG;EAC7B;EAEA,cAAc,KAAQ;AAClB,UAAM,YAAY,IAAI,SAAQ;AAC9B,SAAK,YAAY,OAAO,SAAS;AACjC,SAAK,kBAAkB,MAAM,SAAS;EAC1C;EAEA,iBAAiB,KAAQ;AACrB,UAAM,YAAY,IAAI,SAAQ;AAC9B,SAAK,eAAe,OAAO,SAAS;EACxC;EAEA,MAAM,cAAc,UAA2B,cAAc,wDAAkB,MAAI;AAC/E,UAAM,WAAW,KAAK,gBAAgB,YAAY,SAAS,GAAG;AAC9D,UAAMC,WAAU,MAAM,SAAS,WAAW,iBAAiB,uBAAuB,UAAU,WAAW;AACvG,UAAM,MAAM,SAAS,IAAI,SAAQ;AACjC,SAAK,YAAY,IAAI,KAAKA,QAAO;AACjC,SAAK,kBAAkB,MAAM,GAAG;EACpC;EAEA,MAAM,iBAAiB,UAA2B,cAAc,wDAAkB,MAAI;AAClF,UAAM,WAAW,KAAK,gBAAgB,YAAY,SAAS,GAAG;AAC9D,UAAM,YAAY,MAAM,SAAS,UAAU,6BAA6B,mBAAmB,UAAU,WAAW;AAChH,SAAK,eAAe,IAAI,SAAS,IAAI,SAAQ,GAAI,SAAS;EAC9D;EAEA,WAAW,UAA2B,aAAwB;AAC1D,UAAM,aAAa,KAAK,eAAe,IAAI,SAAS,IAAI,SAAQ,CAAE;AAClE,QAAI,CAAC,YAAY;AACb,aAAO;IACX;AACA,WAAO,WAAW,KAAK,SAAO,CAAC,IAAI,SAAS,YAAY,IAAI,IAAI,UAAU,SAAQ,CAAE,CAAC;EACzF;;;;ACjJE,IAAO,uBAAP,MAA2B;EAAjC,cAAA;AAEY,SAAA,sBAAuD,IAAI,8DAAuB;AAClF,SAAA,aAA0B,CAAA;AAC1B,SAAA,YAAyB,CAAA;AACzB,SAAA,OAAO;EA6DnB;EA3DI,MAAM,QAAwD;AAC1D,SAAK,YAAW;AAChB,UAAM,cAAc,yBAAwB;AAC5C,SAAK,sBAAsB;AAC3B,WAAO,KAAK,QAAQ,KAAK,YAAY,QAAQ,YAAY,KAAK;EAClE;EAEA,KAAQ,QAA6B;AACjC,WAAO,KAAK,QAAQ,KAAK,WAAW,MAAM;EAC9C;EAEQ,QAAkB,OAAoB,QAAuB,oBAAoB,wDAAkB,MAAI;AAC3G,UAAM,WAAW,IAAI,SAAQ;AAC7B,UAAM,QAAmB;MACrB;MACA;MACA;;AAEJ,UAAM,KAAK,KAAK;AAChB,SAAK,qBAAoB;AACzB,WAAO,SAAS;EACpB;EAEQ,MAAM,uBAAoB;AAC9B,QAAI,CAAC,KAAK,MAAM;AACZ;IACJ;AACA,UAAM,UAAuB,CAAA;AAC7B,QAAI,KAAK,WAAW,SAAS,GAAG;AAE5B,cAAQ,KAAK,KAAK,WAAW,MAAK,CAAG;IACzC,WAAW,KAAK,UAAU,SAAS,GAAG;AAElC,cAAQ,KAAK,GAAG,KAAK,UAAU,OAAO,GAAG,KAAK,UAAU,MAAM,CAAC;IACnE,OAAO;AACH;IACJ;AACA,SAAK,OAAO;AACZ,UAAM,QAAQ,IAAI,QAAQ,IAAI,OAAO,EAAE,QAAQ,UAAU,kBAAiB,MAAM;AAC5E,UAAI;AAEA,cAAM,SAAS,MAAM,QAAQ,QAAO,EAAG,KAAK,MAAM,OAAO,iBAAiB,CAAC;AAC3E,iBAAS,QAAQ,MAAM;MAC3B,SAAS,KAAK;AACV,YAAI,qBAAqB,GAAG,GAAG;AAE3B,mBAAS,QAAQ,MAAS;QAC9B,OAAO;AACH,mBAAS,OAAO,GAAG;QACvB;MACJ;IACJ,CAAC,CAAC;AACF,SAAK,OAAO;AACZ,SAAK,qBAAoB;EAC7B;EAEA,cAAW;AACP,SAAK,oBAAoB,OAAM;EACnC;;;;ACnBE,IAAO,0BAAP,MAA8B;EAYhC,YAAY,UAAmC;AAV/C,SAAA,sBAAoC,CAAA;AAOjB,SAAA,SAAS,IAAI,SAAQ;AAIpC,SAAK,kBAAkB,SAAS;AAChC,SAAK,mBAAmB,SAAS,UAAU;AAC3C,SAAK,kBAAkB,SAAS,UAAU;AAC1C,SAAK,qBAAqB,SAAS,UAAU;AAC7C,SAAK,QAAQ,SAAS,UAAU;EACpC;EAEA,IAAI,QAAK;AACL,WAAO,KAAK,OAAO;EACvB;EAEA,IAAI,mBAAgB;AAChB,WAAO,KAAK;EAChB;EAEA,WAAW,QAAwB;AAzHvC;AA0HQ,SAAK,WAAU,YAAO,qBAAP,YAA2B;EAC9C;EAEA,YAAY,SAA0B;AAGlC,WAAO,KAAK,MAAM,MAAM,WAAM;AAhItC;AAgIyC,kBAAK,qBAAoB,UAAK,YAAL,YAAgB,CAAA,GAAI,KAAK;KAAC;EACxF;EAEA,MAAM,oBAAoB,SAA4B,cAAc,wDAAkB,MAAI;AACtF,UAAM,YAAY,MAAM,KAAK,eAAe,OAAO;AAGnD,UAAM,kBAAkB,WAAW;AACnC,UAAM,KAAK,gBAAgB,MAAM,WAAW,KAAK,qBAAqB,WAAW;EACrF;;;;;EAMU,MAAM,eAAe,SAA0B;AACrD,UAAM,YAA+B,CAAA;AACrC,UAAM,YAAY,CAAC,aAA6B;AAC5C,gBAAU,KAAK,QAAQ;AACvB,UAAI,CAAC,KAAK,iBAAiB,YAAY,SAAS,GAAG,GAAG;AAClD,aAAK,iBAAiB,YAAY,QAAQ;MAC9C;IACJ;AAIA,UAAM,KAAK,wBAAwB,SAAS,SAAS;AACrD,UAAM,OAAc,CAAA;AACpB,UAAM,QAAQ,IACV,QAAQ,IAAI,QAAM,KAAK,cAAc,EAAE,CAAC,EACnC,IAAI,OAAM,UAAS,KAAK,eAAe,OAAO,IAAI,CAAC,CAAC;AAE7D,UAAM,aAAa,OAAO,IAAI,EAEzB,SAAS,SAAO,IAAI,SAAQ,CAAE,EAE9B,OAAO,SAAO,CAAC,KAAK,iBAAiB,YAAY,GAAG,CAAC;AAC1D,UAAM,KAAK,uBAAuB,YAAY,SAAS;AACvD,SAAK,OAAO,QAAO;AACnB,WAAO;EACX;EAEU,MAAM,uBAAuB,MAAmB,WAA8C;AACpG,UAAM,QAAQ,IAAI,KAAK,IAAI,OAAM,QAAM;AACnC,YAAM,WAAW,MAAM,KAAK,iBAAiB,oBAAoB,GAAG;AACpE,gBAAU,QAAQ;IACtB,CAAC,CAAC;EACN;;;;;;EAOU,wBAAwB,UAA6B,YAA+C;AAC1G,WAAO,QAAQ,QAAO;EAC1B;;;;;;EAOU,cAAc,iBAAgC;AACpD,WAAOC,KAAI,MAAM,gBAAgB,GAAG;EACxC;;;;;EAMU,MAAM,eAAe,YAAiB,MAAW;AACvD,QAAI;AACA,YAAM,UAAU,MAAM,KAAK,mBAAmB,cAAc,UAAU;AACtE,YAAM,QAAQ,IAAI,QAAQ,IAAI,OAAM,UAAQ;AACxC,YAAI,KAAK,mBAAmB,KAAK,GAAG;AAChC,cAAI,MAAM,aAAa;AACnB,kBAAM,KAAK,eAAe,MAAM,KAAK,IAAI;UAC7C,WAAW,MAAM,QAAQ;AACrB,iBAAK,KAAK,MAAM,GAAG;UACvB;QACJ;MACJ,CAAC,CAAC;IACN,SAAS,GAAG;AACR,cAAQ,MAAM,0CAA0C,WAAW,SAAS,IAAI,GAAG,CAAC;IACxF;EACJ;EAEA,MAAM,aAAa,KAAQ;AACvB,UAAM,OAAc,CAAA;AACpB,UAAM,KAAK,eAAe,KAAK,IAAI;AACnC,WAAO;EACX;;;;EAKA,mBAAmB,OAAqB;AACpC,UAAM,OAAO,SAAS,SAAS,MAAM,GAAG;AACxC,QAAI,KAAK,WAAW,GAAG,GAAG;AACtB,aAAO;IACX;AACA,QAAI,MAAM,aAAa;AACnB,aAAO,SAAS,kBAAkB,SAAS;IAC/C,WAAW,MAAM,QAAQ;AACrB,aAAO,KAAK,gBAAgB,YAAY,MAAM,GAAG;IACrD;AACA,WAAO;EACX;;;;ACpLE,SAAU,eAAe,MAAY;AACvC,SAAO,EAAE,KAAI;AACjB;AA2DM,IAAW;CAAjB,SAAiBC,qBAAkB;AAClB,EAAAA,oBAAA,WAA0C,CAAC,QAAQ,QAAQ,UAAU;AAKrE,EAAAA,oBAAA,MAAqCA,oBAAA;AACtD,GAPiB,uBAAA,qBAAkB,CAAA,EAAA;AAiB7B,IAAO,qBAAP,MAAyB;EAS3B,YAAY,UAA6B;AARtB,SAAA,UAAU,IAAI,SAAQ;AACtB,SAAA,kBAAkB,IAAI,IAAI,mBAAmB,QAAQ;AAI9D,SAAA,gBAAyC,CAAA;AACzC,SAAA,eAAwC,CAAA;AAG9C,SAAK,aAAa,SAAS,OAAO;EACtC;;;;;;;;;EAUA,SAAY,cAAmC,UAAsC,MAAM,WAA+B,QAAM;AAC5H,QAAI,aAAa,YAAY;AACzB,YAAM,IAAI,MAAM,2EAA2E;IAC/F;AACA,SAAK,gBAAgB,IAAI,QAAQ;AACjC,eAAW,CAAC,MAAM,EAAE,KAAK,OAAO,QAAQ,YAAY,GAAG;AACnD,YAAM,YAAY;AAClB,UAAI,MAAM,QAAQ,SAAS,GAAG;AAC1B,mBAAW,SAAS,WAAW;AAC3B,gBAAM,QAA8B;YAChC,OAAO,KAAK,wBAAwB,OAAO,OAAO;YAClD;;AAEJ,eAAK,SAAS,MAAM,KAAK;QAC7B;MACJ,WAAW,OAAO,cAAc,YAAY;AACxC,cAAM,QAA8B;UAChC,OAAO,KAAK,wBAAwB,WAAW,OAAO;UACtD;;AAEJ,aAAK,SAAS,MAAM,KAAK;MAC7B,OAAO;AACH,0BAAkB,SAAS;MAC/B;IACJ;EACJ;EAEU,wBAAwB,OAAwB,SAAgB;AACtE,WAAO,OAAO,MAAM,QAAQ,gBAAe;AACvC,YAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,SAAS,MAAM,QAAQ,WAAW,GAAG,uCAAuC,QAAQ,IAAI;IACxI;EACJ;EAEU,MAAM,gBAAgB,eAAyC,gBAAwB,QAA4B,MAAa;AACtI,QAAI;AACA,YAAM,cAAa;IACvB,SAAS,KAAK;AACV,UAAI,qBAAqB,GAAG,GAAG;AAC3B,cAAM;MACV;AACA,cAAQ,MAAM,GAAG,cAAc,KAAK,GAAG;AACvC,UAAI,eAAe,SAAS,IAAI,OAAO;AACnC,gBAAQ,MAAM,IAAI,KAAK;MAC3B;AACA,YAAM,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACtE,aAAO,SAAS,GAAG,cAAc,KAAK,cAAc,IAAI,EAAE,KAAI,CAAE;IACpE;EACJ;EAEU,SAAS,MAAc,OAA2B;AACxD,QAAI,SAAS,WAAW;AACpB,WAAK,QAAQ,IAAI,WAAW,KAAK;AACjC;IACJ;AACA,eAAW,WAAW,KAAK,WAAW,eAAe,IAAI,GAAG;AACxD,WAAK,QAAQ,IAAI,SAAS,KAAK;IACnC;EACJ;EAEA,UAAU,MAAc,YAAiC;AACrD,QAAI,SAAS,OAAO,KAAK,QAAQ,IAAI,IAAI,CAAC,EACrC,OAAO,KAAK,QAAQ,IAAI,SAAS,CAAC;AACvC,QAAI,YAAY;AACZ,eAAS,OAAO,OAAO,WAAS,WAAW,SAAS,MAAM,QAAQ,CAAC;IACvE;AACA,WAAO,OAAO,IAAI,WAAS,MAAM,KAAK;EAC1C;;;;;;;;;;;;;;;;;EAkBA,uBAAuB,aAAoC,UAAsC,MAAI;AACjG,SAAK,cAAc,KAAK,KAAK,yBAAyB,aAAa,qDAAqD,OAAO,CAAC;EACpI;;;;;;;;;;;;;;;;;EAkBA,sBAAsB,YAAmC,UAAsC,MAAI;AAC/F,SAAK,aAAa,KAAK,KAAK,yBAAyB,YAAY,wDAAwD,OAAO,CAAC;EACrI;EAEU,yBAAyB,OAA8B,gBAAwB,SAAgB;AACrG,WAAO,OAAO,UAAU,QAAQ,YAAY,gBAAe;AACvD,YAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,SAAS,UAAU,QAAQ,YAAY,WAAW,GAAG,gBAAgB,QAAQ,QAAQ;IACrI;EACJ;EAEA,IAAI,eAAY;AACZ,WAAO,KAAK;EAChB;EAEA,IAAI,cAAW;AACX,WAAO,KAAK;EAChB;EAEA,2BAA2B,WAA0B;AACjD,WAAO,KAAK;EAChB;;;;AC9NG,IAAM,qBAAgD,OAAO,OAAO;EACvE,cAAc;EACd,kBAAkB;CACrB;AAEK,IAAO,2BAAP,MAA+B;EAOjC,YAAY,UAA6B;AACrC,SAAK,qBAAqB,SAAS,WAAW;AAC9C,SAAK,WAAW,SAAS;AACzB,SAAK,WAAW,SAAS,OAAO,UAAU;AAC1C,SAAK,aAAa,SAAS,iBAAiB;EAChD;EAEA,MAAM,iBAAiB,UAA2B,UAA6B,CAAA,GAAI,cAAc,wDAAkB,MAAI;AACnH,UAAM,cAAc,SAAS;AAC7B,UAAM,cAA4B,CAAA;AAElC,UAAM,kBAAkB,WAAW;AAEnC,QAAI,CAAC,QAAQ,cAAc,QAAQ,WAAW,SAAS,UAAU,GAAG;AAChE,WAAK,oBAAoB,aAAa,aAAa,OAAO;AAC1D,UAAI,QAAQ,yBAAyB,YAAY,KAAK,OAAE;AApFpE;AAoFuE,wBAAE,SAAF,mBAAQ,UAAS,kBAAkB;OAAW,GAAG;AACxG,eAAO;MACX;AAEA,WAAK,qBAAqB,aAAa,aAAa,OAAO;AAC3D,UAAI,QAAQ,0BAA0B,YAAY,KAAK,OAAE;AAzFrE;AAyFwE,wBAAE,SAAF,mBAAQ,UAAS,kBAAkB;OAAY,GAAG;AAC1G,eAAO;MACX;AAEA,WAAK,qBAAqB,UAAU,aAAa,OAAO;AACxD,UAAI,QAAQ,0BAA0B,YAAY,KAAK,OAAE;AA9FrE;AA8FwE,wBAAE,SAAF,mBAAQ,UAAS,kBAAkB;OAAY,GAAG;AAC1G,eAAO;MACX;IACJ;AAGA,QAAI;AACA,kBAAY,KAAK,GAAG,MAAM,KAAK,YAAY,YAAY,OAAO,SAAS,WAAW,CAAC;IACvF,SAAS,KAAK;AACV,UAAI,qBAAqB,GAAG,GAAG;AAC3B,cAAM;MACV;AACA,cAAQ,MAAM,wCAAwC,GAAG;IAC7D;AAEA,UAAM,kBAAkB,WAAW;AAEnC,WAAO;EACX;EAEU,oBAAoB,aAA0B,aAA2B,UAA2B;AAlHlH;AAmHQ,UAAM,mBAAmB,CAAC,GAAG,YAAY,aAAa,IAAG,uBAAY,gBAAZ,mBAAyB,gBAAzB,YAAwC,CAAA,CAAE;AACnG,eAAW,mBAAmB,kBAAkB;AAC5C,YAAM,YAAW,qBAAgB,aAAhB,YAA4B;AAC7C,YAAM,aAAyB;QAC3B,UAAU,qBAAqB,QAAQ;QACvC,OAAO;UACH,OAAO;YACH,MAAM,gBAAgB,OAAQ;YAC9B,WAAW,gBAAgB,SAAU;;UAEzC,KAAK;YACD,MAAM,gBAAgB,OAAQ;YAC9B,WAAW,gBAAgB,SAAU,gBAAgB,SAAS;;;QAGtE,SAAS,gBAAgB;QACzB,MAAM,iBAAiB,QAAQ;QAC/B,QAAQ,KAAK,UAAS;;AAE1B,kBAAY,KAAK,UAAU;IAC/B;EACJ;EAEU,qBAAqB,aAA0B,aAA2B,UAA2B;AAC3G,eAAW,eAAe,YAAY,cAAc;AAChD,UAAI,QAA2B;AAI/B,UAAI,MAAM,YAAY,MAAM,WAAW,GAAG;AAGtC,YAAI,mBAAmB,aAAa;AAChC,gBAAM,QAAS,YAAyC;AACxD,cAAI,CAAC,MAAM,MAAM,WAAW,GAAG;AAC3B,kBAAM,WAAqB,EAAE,MAAM,MAAM,UAAW,GAAG,WAAW,MAAM,UAAU;AAClF,oBAAQ,EAAE,OAAO,UAAU,KAAK,SAAQ;UAC5C,OAAO;AAGH,kBAAM,WAAqB,EAAE,MAAM,GAAG,WAAW,EAAC;AAClD,oBAAQ,EAAE,OAAO,UAAU,KAAK,SAAQ;UAC5C;QACJ;MACJ,OAAO;AACH,gBAAQ,aAAa,YAAY,KAAK;MAC1C;AACA,UAAI,OAAO;AACP,cAAM,aAAyB;UAC3B,UAAU,qBAAqB,OAAO;UACtC;UACA,SAAS,YAAY;UACrB,MAAM,eAAe,kBAAkB,YAAY;UACnD,QAAQ,KAAK,UAAS;;AAE1B,oBAAY,KAAK,UAAU;MAC/B;IACJ;EACJ;EAEU,qBAAqB,UAA2B,aAA2B,UAA2B;AA/KpH;AAgLQ,eAAW,aAAa,SAAS,YAAY;AACzC,YAAM,eAAe,UAAU;AAC/B,UAAI,cAAc;AACd,cAAM,OAAwC;UAC1C,MAAM,aAAa,KAAK;UACxB,QAAO,eAAU,aAAV,mBAAoB;UAC3B,UAAU,aAAa,KAAK;UAC5B,OAAO,aAAa,KAAK;UACzB,MAAM;YACF,MAAM,kBAAkB;YACxB,eAAe,aAAa,KAAK,UAAU;YAC3C,UAAU,aAAa,KAAK;YAC5B,SAAS,aAAa,KAAK,UAAU;;;AAG7C,oBAAY,KAAK,KAAK,aAAa,SAAS,aAAa,SAAS,IAAI,CAAC;MAC3E;IACJ;EACJ;EAEU,MAAM,YAAY,UAAmB,SAA4B,cAAc,wDAAkB,MAAI;AAC3G,UAAM,kBAAgC,CAAA;AACtC,UAAM,WAA+B,CAAoB,UAA8B,SAAiB,SAA2B;AAC/H,sBAAgB,KAAK,KAAK,aAAa,UAAU,SAAS,IAAI,CAAC;IACnE;AAEA,UAAM,KAAK,kBAAkB,UAAU,SAAS,UAAU,WAAW;AACrE,UAAM,KAAK,iBAAiB,UAAU,SAAS,UAAU,WAAW;AACpE,UAAM,KAAK,iBAAiB,UAAU,SAAS,UAAU,WAAW;AAEpE,WAAO;EACX;EAEU,MAAM,kBAAkB,UAAmB,SAA4B,UAA8B,cAAc,wDAAkB,MAAI;AAjNvJ;AAkNQ,UAAM,eAAe,KAAK,mBAAmB;AAC7C,eAAW,eAAe,cAAc;AACpC,YAAM,kBAAkB,WAAW;AACnC,YAAM,YAAY,UAAU,WAAU,aAAQ,eAAR,YAAsB,CAAA,GAAI,WAAW;IAC/E;EACJ;EAEU,MAAM,iBAAiB,UAAmB,SAA4B,UAA8B,cAAc,wDAAkB,MAAI;AAzNtJ;AA0NQ,SAAI,UAAK,aAAL,mBAAe,SAAS,eAAe;AACvC,YAAM,OAAO,KAAK,SAAS,WAAW,cAAc,KAAK,UAAU;AACnE,WAAK,MAAK;AACV,UAAI;AACA,cAAM,QAAQ,UAAU,QAAQ,EAAE,SAAQ;AAC1C,mBAAW,QAAQ,OAAO;AACtB,eAAK,aAAa,KAAK,KAAK;AAC5B,gBAAM,cAAc,KAAK,0BAA0B,MAAM,OAAO;AAChE,cAAI,YAAY,cAAc;AAC1B,gBAAI;AACA,oBAAM,SAAS,KAAK,mBAAmB,UAAU,KAAK,OAAO,QAAQ,UAAU;AAC/E,yBAAW,SAAS,QAAQ;AACxB,sBAAM,MAAM,MAAM,UAAU,WAAW;cAC3C;YACJ;AACI,mBAAK,YAAY,KAAK,KAAK;YAC/B;UACJ;AACA,cAAI,CAAC,YAAY,kBAAkB;AAC/B,kBAAM,MAAK;UACf;QACJ;MACJ;AACI,aAAK,KAAI;MACb;IACJ,OACK;AACD,YAAM,QAAQ,UAAU,QAAQ,EAAE,SAAQ;AAC1C,iBAAW,QAAQ,OAAO;AACtB,cAAM,kBAAkB,WAAW;AACnC,cAAM,cAAc,KAAK,0BAA0B,MAAM,OAAO;AAChE,YAAI,YAAY,cAAc;AAC1B,gBAAM,SAAS,KAAK,mBAAmB,UAAU,KAAK,OAAO,QAAQ,UAAU;AAC/E,qBAAW,SAAS,QAAQ;AACxB,kBAAM,MAAM,MAAM,UAAU,WAAW;UAC3C;QACJ;AACA,YAAI,CAAC,YAAY,kBAAkB;AAC/B,gBAAM,MAAK;QACf;MACJ;IACJ;EACJ;EAEU,0BAA0B,OAAgB,UAA2B;AAC3E,WAAO;EACX;EAEU,MAAM,iBAAiB,UAAmB,SAA4B,UAA8B,cAAc,wDAAkB,MAAI;AA1QtJ;AA2QQ,UAAM,cAAc,KAAK,mBAAmB;AAC5C,eAAW,cAAc,aAAa;AAClC,YAAM,kBAAkB,WAAW;AACnC,YAAM,WAAW,UAAU,WAAU,aAAQ,eAAR,YAAsB,CAAA,GAAI,WAAW;IAC9E;EACJ;EAEU,aAAgC,UAA8B,SAAiB,MAA+B;AACpH,WAAO;MACH;MACA,OAAO,mBAAmB,IAAI;MAC9B,UAAU,qBAAqB,QAAQ;MACvC,MAAM,KAAK;MACX,iBAAiB,KAAK;MACtB,MAAM,KAAK;MACX,oBAAoB,KAAK;MACzB,MAAM,KAAK;MACX,QAAQ,KAAK,UAAS;;EAE9B;EAEU,YAAS;AACf,WAAO,KAAK,SAAS;EACzB;;AAGE,SAAU,mBAAsC,MAA+B;AACjF,MAAI,KAAK,OAAO;AACZ,WAAO,KAAK;EAChB;AACA,MAAI;AACJ,MAAI,OAAO,KAAK,aAAa,UAAU;AACnC,cAAU,oBAAoB,KAAK,KAAK,UAAU,KAAK,UAAU,KAAK,KAAK;EAC/E,WAAW,OAAO,KAAK,YAAY,UAAU;AACzC,cAAU,mBAAmB,KAAK,KAAK,UAAU,KAAK,SAAS,KAAK,KAAK;EAC7E;AACA,8BAAA,UAAY,KAAK,KAAK;AACtB,MAAI,CAAC,SAAS;AACV,WAAO;MACH,OAAO,EAAE,MAAM,GAAG,WAAW,EAAC;MAC9B,KAAK,EAAE,MAAM,GAAG,WAAW,EAAC;;EAEpC;AACA,SAAO,QAAQ;AACnB;AAQM,SAAU,qBAAqB,UAAkC;AACnE,UAAQ,UAAU;IACd,KAAK;AACD,aAAO;IACX,KAAK;AACD,aAAO;IACX,KAAK;AACD,aAAO;IACX,KAAK;AACD,aAAO;IACX;AACI,YAAM,IAAI,MAAM,kCAAkC,QAAQ;EAClE;AACJ;AAEM,SAAU,iBAAiB,UAAkC;AAC/D,UAAQ,UAAU;IACd,KAAK;AACD,aAAO,eAAe,kBAAkB,WAAW;IACvD,KAAK;AACD,aAAO,eAAe,kBAAkB,aAAa;IACzD,KAAK;AACD,aAAO,eAAe,kBAAkB,UAAU;IACtD,KAAK;AACD,aAAO,eAAe,kBAAkB,UAAU;IACtD;AACI,YAAM,IAAI,MAAM,kCAAkC,QAAQ;EAClE;AACJ;AAEM,IAAW;CAAjB,SAAiBC,oBAAiB;AACjB,EAAAA,mBAAA,cAAc;AACd,EAAAA,mBAAA,gBAAgB;AAChB,EAAAA,mBAAA,aAAa;AACb,EAAAA,mBAAA,aAAa;AACb,EAAAA,mBAAA,eAAe;AACf,EAAAA,mBAAA,eAAe;AAChC,GAPiB,sBAAA,oBAAiB,CAAA,EAAA;;;AC5S5B,SAAU,wBAAwB,SAAiC;AACrE,SAAO;IACH,eAAe;MACX,iBAAiB,CAAC,aAAa,IAAI,uBAAuB,QAAQ;MAClE,uBAAuB,CAAC,aAAa,IAAI,2BAA2B,QAAQ;;IAEhF,QAAQ;MACJ,aAAa,CAAC,aAAa,IAAI,mBAAmB,QAAQ;MAC1D,eAAe,CAAC,aAAa,oBAAoB,QAAQ;MACzD,eAAe,CAAC,aAAa,oBAAoB,QAAQ;MACzD,kBAAkB,CAAC,aAAa,uBAAuB,QAAQ;MAC/D,gBAAgB,MAAM,IAAI,sBAAqB;MAC/C,cAAc,MAAM,IAAI,oBAAmB;MAC3C,OAAO,CAAC,aAAa,IAAI,aAAa,QAAQ;MAC9C,4BAA4B,MAAM,IAAI,kCAAiC;MACvE,2BAA2B,MAAM,IAAI,iCAAgC;;IAEzE,WAAW;MACP,gBAAgB,MAAM,IAAI,sBAAqB;MAC/C,4BAA4B,CAAC,aAAa,IAAI,kCAAkC,QAAQ;MACxF,8BAA8B,CAAC,aAAa,IAAI,oCAAoC,QAAQ;;IAEhG,YAAY;MACR,QAAQ,CAAC,aAAa,IAAI,cAAc,QAAQ;MAChD,cAAc,MAAM,IAAI,oBAAmB;MAC3C,eAAe,CAAC,aAAa,IAAI,qBAAqB,QAAQ;MAC9D,kBAAkB,CAAC,aAAa,IAAI,wBAAwB,QAAQ;MACpE,YAAY,CAAC,aAAa,IAAI,kBAAkB,QAAQ;;IAE5D,YAAY;MACR,UAAU,CAAC,aAAa,IAAI,gBAAgB,QAAQ;MACpD,gBAAgB,CAAC,aAAa,IAAI,sBAAsB,QAAQ;;IAEpE,YAAY;MACR,mBAAmB,CAAC,aAAa,IAAI,yBAAyB,QAAQ;MACtE,oBAAoB,CAAC,aAAa,IAAI,mBAAmB,QAAQ;;IAErE,QAAQ,MAAM,QAAQ;;AAE9B;AAoBM,SAAU,8BAA8B,SAAuC;AACjF,SAAO;IACH,iBAAiB,CAAC,aAAa,IAAI,uBAAuB,QAAQ;IAClE,WAAW;MACP,kBAAkB,CAAC,aAAa,IAAI,wBAAwB,QAAQ;MACpE,wBAAwB,CAAC,aAAa,IAAI,8BAA8B,QAAQ;MAChF,iBAAiB,CAAC,aAAa,IAAI,uBAAuB,QAAQ;MAClE,cAAc,CAAC,aAAa,IAAI,oBAAoB,QAAQ;MAC5D,kBAAkB,CAAC,aAAa,IAAI,wBAAwB,QAAQ;MACpE,oBAAoB,CAAC,aAAa,QAAQ,mBAAmB,QAAQ;MACrE,eAAe,MAAM,IAAI,qBAAoB;MAC7C,uBAAuB,CAAC,aAAa,IAAI,6BAA6B,QAAQ;;IAElF,WAAW,CAAA;;AAEnB;;;AC5GA,IAAAC,gCAAkC;AAsB5B,IAAO,mCAAP,MAAuC;EAKzC,YAAY,UAAyB;AACjC,SAAK,aAAa,SAAS,WAAW;AACtC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,gBAAgB,SAAS,OAAO;EACzC;EAEA,qBAAqB,UAA2B,QAAiC,cAAgC;AAC7G,UAAM,WAAW,SAAS,YAAY,MAAM;AAC5C,QAAI,CAAC,UAAU;AACX,aAAO;IACX;AACA,UAAM,eAAe,4BAA4B,UAAU,SAAS,aAAa,SAAS,OAAO,QAAQ,GAAG,KAAK,cAAc,UAAU;AACzI,QAAI,CAAC,cAAc;AACf,aAAO;IACX;AACA,UAAM,gBAAgB,KAAK,WAAW,iBAAiB,YAAY;AACnE,UAAM,aAAkC,CAAA;AACxC,eAAW,UAAU,eAAe;AAChC,YAAM,qBAAqB,SAAS,OAAO,YAAY,MAAM,EAAE,KAAK,SAAS,GAAG;AAChF,YAAM,UAAiC,EAAE,aAAa,SAAS,KAAK,mBAAsC;AAC1G,YAAM,aAAa,KAAK,WAAW,eAAe,QAAQ,OAAO;AACjE,iBAAW,KAAK,GAAG,WAAW,IAAI,SAAO,KAAK,wBAAwB,GAAG,CAAC,EAAE,QAAO,CAAE;IACzF;AACA,WAAO;EACX;;;;EAKU,wBAAwB,WAA+B;AAC7D,WAAO,gDAAkB,OAAO,UAAU,QAAQ,KAAK;EAC3D;;;;ACvCE,IAAO,gCAAP,MAAoC;EAKtC,YAAY,UAAyB;AACjC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,mBAAmB,SAAS,OAAO,IAAI;EAChD;EAEA,WAAW,UAA2B,SAA+B,cAAgC;AACjG,WAAO,KAAK,UAAU,UAAU,SAAS,YAAY,KAAK;EAC9D;EAEU,UAAU,UAA2B,SAAgB;AAC3D,UAAM,WAAW,KAAK,aAAa,YAAY,OAAO;AACtD,QAAI,YAAY,QAAQ,UAAU;AAC9B,YAAM,eAAe,KAAK,aAAa,QAAQ,OAAO;AACtD,aAAO,CAAE,KAAK,aAAa,UAAU,SAAS,QAAQ,UAAU,UAAU,YAAY,CAAC;IAC3F,OAAO;AACH,aAAO,KAAK,gBAAgB,UAAU,OAAO,KAAK,CAAA;IACtD;EACJ;EAEU,aAAa,UAA2B,SAAkB,SAAkB,UAAmB,cAAqB;AAC1H,WAAO;MACH,MAAM,KAAK,iBAAiB,cAAc,OAAO;MACjD,MAAM,gBAAgB,SAAS;MAC/B,OAAO,QAAQ;MACf,gBAAgB,SAAS;MACzB,UAAU,KAAK,gBAAgB,UAAU,OAAO;;EAExD;EAEU,gBAAgB,UAA2B,SAAgB;AACjE,UAAM,WAA6B,CAAA;AAEnC,eAAW,SAAS,eAAe,OAAO,GAAG;AACzC,YAAM,SAAS,KAAK,UAAU,UAAU,KAAK;AAC7C,eAAS,KAAK,GAAG,MAAM;IAC3B;AACA,QAAI,SAAS,SAAS,GAAG;AACrB,aAAO;IACX;AACA,WAAO;EACX;;;;ACtEJ,IAAAC,gCAAkE;AAoE5D,IAAO,+BAAP,MAAmC;EAQrC,YAAY,UAA+B;AAFxB,SAAA,8BAA8B,IAAI,+CAAO;AAGxD,SAAK,mBAAmB,SAAS,UAAU;AAC3C,SAAK,kBAAkB,SAAS,UAAU;AAC1C,SAAK,gBAAgB,SAAS,UAAU;AACxC,SAAK,kBAAkB,SAAS;AAEhC,QAAI,yBAAyB;AAC7B,aAAS,IAAI,eAAe,aAAa,YAAS;AA5F1D;AA6FY,+BAAyB,SAAQ,kBAAO,aAAa,cAApB,mBAA+B,0BAA/B,mBAAsD,mBAAmB;IAC9G,CAAC;AAED,aAAS,IAAI,eAAe,cAAc,aAAU;AAChD,UAAI,wBAAwB;AACxB,aAAK,oBAAoB,QAAQ;MACrC;IACJ,CAAC;EACL;EAEU,oBAAoB,UAA+B;AACzD,UAAM,WAAW,KAAK,YAAW;AACjC,QAAI,SAAS,SAAS,GAAG;AACrB,YAAMC,cAAa,SAAS,IAAI;AAChC,YAAM,UAAoD,EAAE,SAAQ;AACpE,MAAAA,eAAA,gBAAAA,YAAY,OAAO,SAAS,gEAAkC,MAAM;IACxE;EACJ;EAEU,cAAW;AACjB,WAAO,CAAC;;;;MAIJ,aAAa;KAChB;EACL;EAEU,mBAAmB,SAAgB,SAAc;AAGvD,SAAK,iBAAiB,MAAM,KAAK,MAAK;AAClC,WAAK,cAAc,MAAM,WAAS,KAAK,gBAAgB,OAAO,SAAS,SAAS,KAAK,CAAC;IAC1F,CAAC,EAAE,MAAM,SAAM;AAEX,cAAQ,MAAM,uEAAuE,GAAG;IAC5F,CAAC;EACL;EAEA,iBAAiB,QAA6C;AAC1D,SAAK,mBAAmB,CAACC,KAAI,MAAM,OAAO,SAAS,GAAG,CAAC,GAAG,CAAA,CAAE;EAChE;EAEA,sBAAsB,QAAmC;AACrD,SAAK,4BAA4B,KAAK,MAAM;AAC5C,UAAM,cAAc,OAAO,OAAO,OAAO,EACpC,OAAO,OAAK,EAAE,SAAS,6CAAe,OAAO,EAC7C,SAAS,OAAK,EAAE,GAAG,EACnB,IAAI,OAAKA,KAAI,MAAM,EAAE,GAAG,CAAC,EACzB,QAAO;AACZ,UAAM,cAAc,OAAO,OAAO,OAAO,EACpC,OAAO,OAAK,EAAE,SAAS,6CAAe,OAAO,EAC7C,SAAS,OAAK,EAAE,GAAG,EACnB,IAAI,OAAKA,KAAI,MAAM,EAAE,GAAG,CAAC,EACzB,QAAO;AACZ,SAAK,mBAAmB,aAAa,WAAW;EACpD;EAEA,IAAI,uBAAoB;AACpB,WAAO,KAAK,4BAA4B;EAC5C;;;;AC7IJ,IAAAC,gCAA+C;AAwBzC,IAAO,8BAAP,MAAkC;EAIpC,YAAY,UAAyB;AACjC,SAAK,eAAe,SAAS,OAAO,cAAc;EACtD;EAEA,iBAAiB,UAA2B,SAA6B,cAAgC;AACrG,UAAM,WAA2B,CAAA;AACjC,UAAM,WAAiC,CAAC,iBAAiB,SAAS,KAAK,YAAY;AACnF,SAAK,eAAe,UAAU,QAAQ;AACtC,WAAO;EACX;EAEU,eAAe,UAA2B,UAA8B;AAnDtF;AAoDQ,UAAMC,SAAO,cAAS,gBAAT,mBAAsB;AACnC,QAAIA,OAAM;AACN,UAAI,KAAK,qBAAqBA,KAAI,GAAG;AACjC,cAAM,eAAe,kBAAkBA,KAAI,EAAE,SAAQ;AACrD,YAAI;AACJ,WAAG;AACC,mBAAS,aAAa,KAAI;AAC1B,cAAI,CAAC,OAAO,MAAM;AACd,kBAAM,OAAO,OAAO;AACpB,gBAAI,KAAK,cAAc,IAAI,GAAG;AAC1B,mBAAK,qBAAqB,UAAU,MAAM,QAAQ;YACtD;AACA,gBAAI,CAAC,KAAK,qBAAqB,IAAI,GAAG;AAClC,2BAAa,MAAK;YACtB;UACJ;QACJ,SAAS,CAAC,OAAO;MACrB;AAEA,WAAK,sBAAsB,UAAUA,OAAM,QAAQ;IACvD;EACJ;;;;;;EAOU,cAAc,OAAc;AAClC,WAAO;EACX;;;;;;EAOU,qBAAqB,OAAc;AACzC,WAAO;EACX;EAEU,qBAAqB,UAA2B,MAAe,UAA8B;AACnG,UAAM,UAAU,KAAK;AACrB,QAAI,SAAS;AACT,YAAM,eAAe,KAAK,eAAe,UAAU,OAAO;AAC1D,UAAI,cAAc;AACd,iBAAS,YAAY;MACzB;IACJ;EACJ;EAEU,sBAAsB,UAA2B,MAAe,UAA8B;AACpG,UAAM,UAAU,KAAK;AACrB,QAAI,SAAS;AACT,iBAAWC,SAAQ,WAAW,OAAO,GAAG;AACpC,YAAI,KAAK,aAAa,SAASA,MAAK,UAAU,IAAI,GAAG;AACjD,gBAAM,eAAe,KAAK,eAAe,UAAUA,OAAM,+CAAiB,OAAO;AACjF,cAAI,cAAc;AACd,qBAAS,YAAY;UACzB;QACJ;MACJ;IACJ;EACJ;EAEU,eAAe,UAA2B,MAAe,MAAa;AAC5E,UAAM,QAAQ,KAAK;AACnB,UAAM,QAAQ,MAAM;AACpB,QAAI,MAAM,MAAM;AAEhB,QAAI,IAAI,OAAO,MAAM,OAAO,GAAG;AAC3B,aAAO;IACX;AAGA,QAAI,CAAC,KAAK,uBAAuB,MAAM,IAAI,GAAG;AAC1C,YAAM,SAAS,aAAa,WAAW,SAAS,aAAa,SAAS,EAAE,MAAM,IAAI,MAAM,WAAW,EAAC,CAAE,IAAI,CAAC;IAC/G;AACA,WAAO,2CAAa,OAAO,MAAM,MAAM,IAAI,MAAM,MAAM,WAAW,IAAI,WAAW,IAAI;EACzF;;;;;EAMU,uBAAuB,MAAe,MAAa;AACzD,QAAI,SAAS,+CAAiB,SAAS;AACnC,aAAO;IACX;AAEA,UAAM,WAAW,KAAK;AACtB,UAAM,UAAU,SAAS,OAAO,SAAS,SAAS,CAAC;AACnD,QAAI,YAAY,OAAO,YAAY,OAAO,YAAY,KAAK;AACvD,aAAO;IACX;AAEA,WAAO;EACX;;;;AC9HE,IAAO,sBAAP,MAA0B;EAE5B,MAAM,OAAe,MAAY;AAC7B,QAAI,MAAM,WAAW,GAAG;AACpB,aAAO;IACX;AAEA,QAAI,wBAAwB;AAC5B,QAAI;AACJ,QAAI,YAAY;AAChB,UAAM,MAAM,KAAK;AACjB,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,YAAM,UAAU,KAAK,WAAW,CAAC;AACjC,YAAM,WAAW,MAAM,WAAW,SAAS;AAC3C,UAAI,YAAY,YAAY,KAAK,gBAAgB,OAAO,MAAM,KAAK,gBAAgB,QAAQ,GAAG;AAC1F,kCAAA,wBACI,aAAa;QACb,KAAK,iBAAiB,UAAU,OAAO;AAC3C,YAAI,uBAAuB;AACvB;QACJ;AACA,YAAI,cAAc,MAAM,QAAQ;AAC5B,iBAAO;QACX;MACJ;AACA,iBAAW;IACf;AACA,WAAO;EACX;EAEU,iBAAiB,UAAkB,SAAe;AACxD,WAAO,KAAK,YAAY,YAAY,KAAK,KAAK,WAAW,WAAW;IAChE,aAAa,KAAK,YAAY;EACtC;EAEU,gBAAgB,UAAgB;AACtC,QAAI,KAAK,YAAY,YAAY,GAAG;AAChC,aAAO,WAAW;IACtB;AACA,WAAO;EACX;;AAGJ,IAAM,IAAI,IAAI,WAAW,CAAC;AAC1B,IAAM,IAAI,IAAI,WAAW,CAAC;AAC1B,IAAM,IAAI,IAAI,WAAW,CAAC;AAC1B,IAAM,IAAI,IAAI,WAAW,CAAC;AAC1B,IAAM,IAAI,IAAI,WAAW,CAAC;;;ACrCpB,IAAgB,uBAAhB,MAAoC;EAKtC,YAAY,UAAyB;AACjC,SAAK,aAAa,SAAS,WAAW;AACtC,SAAK,gBAAgB,SAAS,OAAO;EACzC;EAEA,MAAM,gBAAgB,UAA2B,QAAmB;AA3CxE;AA4CQ,UAAM,YAAW,oBAAS,gBAAT,mBAAsB,UAAtB,mBAA6B;AAC9C,QAAI,UAAU;AACV,YAAM,SAAS,SAAS,aAAa,SAAS,OAAO,QAAQ;AAC7D,YAAM,UAAU,4BAA4B,UAAU,QAAQ,KAAK,cAAc,UAAU;AAC3F,UAAI,WAAW,QAAQ,SAAS,QAAQ,SAAS,QAAQ;AACrD,cAAM,WAAqB,CAAA;AAC3B,cAAM,cAAc,KAAK,WAAW,iBAAiB,OAAO;AAC5D,mBAAW,cAAc,aAAa;AAClC,gBAAM,UAAU,MAAM,KAAK,uBAAuB,UAAU;AAC5D,cAAI,OAAO,YAAY,UAAU;AAC7B,qBAAS,KAAK,OAAO;UACzB;QACJ;AACA,YAAI,SAAS,SAAS,GAAG;AACrB,iBAAO;YACH,UAAU;cACN,MAAM;cACN,OAAO,SAAS,KAAK,GAAG;;;QAGpC;AAGA,YAAI,UAAU,QAAQ,aAAa,GAAG;AAClC,iBAAO,KAAK,uBAAuB,QAAQ,aAAa;QAC5D;MACJ;IACJ;AACA,WAAO;EACX;EAIU,uBAAuB,MAAa;AA7ElD;AA8EQ,QAAI,UAAU,qBAAqB,IAAI,IAAI,KAAK,WAAW;AAC3D,QAAI,CAAC,SAAS;AACV,iBAAU,qBAAgB,KAAK,UAAU,CAAC,YAAY,CAAC,MAA7C,mBAAgD;IAC9D;AACA,QAAI,WAAW,QAAQ,OAAO,GAAG;AAC7B,YAAM,UAAU,WAAW,OAAO,EAAE,WAAU;AAC9C,UAAI,SAAS;AACT,eAAO;UACH,UAAU;YACN,MAAM;YACN,OAAO;;;MAGnB;IACJ;AACA,WAAO;EACX;;AAGE,IAAO,gCAAP,cAA6C,qBAAoB;EAInE,YAAY,UAAyB;AACjC,UAAM,QAAQ;AACd,SAAK,wBAAwB,SAAS,cAAc;EACxD;EAEU,uBAAuB,MAAa;AAC1C,UAAM,UAAU,KAAK,sBAAsB,iBAAiB,IAAI;AAEhE,QAAI,SAAS;AACT,aAAO;IACX;AACA,WAAO;EACX;;;;ACrFJ,IAAAC,yCAAgH;;;ACnBhH,IAAAC,gCAA+G;AAWxG,IAAM,wBAAgD;EACzD,CAAC,iDAAmB,KAAK,GAAG;EAC5B,CAAC,iDAAmB,OAAO,GAAG;EAC9B,CAAC,iDAAmB,IAAI,GAAG;EAC3B,CAAC,iDAAmB,UAAU,GAAG;EACjC,CAAC,iDAAmB,KAAK,GAAG;EAC5B,CAAC,iDAAmB,QAAQ,GAAG;EAC/B,CAAC,iDAAmB,SAAS,GAAG;EAChC,CAAC,iDAAmB,OAAO,GAAG;EAC9B,CAAC,iDAAmB,KAAK,GAAG;EAC5B,CAAC,iDAAmB,MAAM,GAAG;EAC7B,CAAC,iDAAmB,QAAQ,GAAG;EAC/B,CAAC,iDAAmB,SAAS,GAAG;EAChC,CAAC,iDAAmB,MAAM,GAAG;EAC7B,CAAC,iDAAmB,QAAQ,GAAG;EAC/B,CAAC,iDAAmB,SAAS,GAAG;EAChC,CAAC,iDAAmB,QAAQ,GAAG;EAC/B,CAAC,iDAAmB,MAAM,GAAG;EAC7B,CAAC,iDAAmB,MAAM,GAAG;EAC7B,CAAC,iDAAmB,MAAM,GAAG;EAC7B,CAAC,iDAAmB,IAAI,GAAG;EAC3B,CAAC,iDAAmB,aAAa,GAAG;EACpC,CAAC,iDAAmB,QAAQ,GAAG;EAC/B,CAAC,iDAAmB,SAAS,GAAG;;AAG7B,IAAM,4BAAoD;EAC7D,CAAC,qDAAuB,QAAQ,GAAG,KAAK;EACxC,CAAC,qDAAuB,KAAK,GAAG,KAAK;EACrC,CAAC,qDAAuB,WAAW,GAAG,KAAK;EAC3C,CAAC,qDAAuB,cAAc,GAAG,KAAK;EAC9C,CAAC,qDAAuB,UAAU,GAAG,KAAK;EAC1C,CAAC,qDAAuB,UAAU,GAAG,KAAK;EAC1C,CAAC,qDAAuB,aAAa,GAAG,KAAK;EAC7C,CAAC,qDAAuB,YAAY,GAAG,KAAK;EAC5C,CAAC,qDAAuB,QAAQ,GAAG,KAAK;EACxC,CAAC,qDAAuB,MAAM,GAAG,KAAK;;AAMnC,IAAM,8BAAqD;EAC9D,QAAQ;IACJ,YAAY,OAAO,KAAK,qBAAqB;IAC7C,gBAAgB,OAAO,KAAK,yBAAyB;;EAEzD,MAAM;IACF,OAAO;;EAEX,OAAO;;AAYL,SAAU,kCAAkC,SAAiD;AAC/F,QAAM,aAAuB,CAAA;AAC7B,QAAM,iBAA2B,CAAA;AACjC,MAAI,OAAO;AACX,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,aAAWC,WAAU,SAAS;AAC1B,QAAI,CAACA,SAAQ;AACT;IACJ;AACA,IAAAA,QAAO,OAAO,WAAW,QAAQ,CAAC,WAAW,UAAS;AAClD,YAAM,WAAW,WAAW,KAAK;AACjC,UAAI,YAAY,aAAa,WAAW;AACpC,cAAM,IAAI,MAAM,iBAAiB,QAAQ,UAAU,SAAS,0CAA0C,KAAK,GAAG;MAClH,OAAO;AACH,mBAAW,KAAK,IAAI;MACxB;IACJ,CAAC;AACD,IAAAA,QAAO,OAAO,eAAe,QAAQ,CAAC,eAAe,UAAS;AAC1D,YAAM,WAAW,eAAe,KAAK;AACrC,UAAI,YAAY,aAAa,eAAe;AACxC,cAAM,IAAI,MAAM,iBAAiB,QAAQ,UAAU,aAAa,6CAA6C,KAAK,GAAG;MACzH,OAAO;AACH,uBAAe,KAAK,IAAI;MAC5B;IACJ,CAAC;AACD,QAAI,CAACA,QAAO,MAAM;AACd,aAAO;IACX,WAAW,OAAOA,QAAO,SAAS,YAAY,CAACA,QAAO,KAAK,OAAO;AAC9D,cAAQ;IACZ;AACA,QAAI,CAACA,QAAO,OAAO;AACf,cAAQ;IACZ;EACJ;AACA,SAAO;IACH,QAAQ;MACJ;MACA;;IAEJ,MAAM,QAAQ,EAAE,MAAK;IACrB;;AAER;AAsXM,IAAW;CAAjB,SAAiBC,wBAAqB;AAQlC,WAAgB,OAAoC,QAAwB,YAAoC,UAA4B;AACxI,UAAM,UAAU,oBAAI,IAAG;AACvB,WAAO,QAAQ,UAAU,EAAE,QAAQ,CAAC,CAAC,MAAM,KAAK,MAAM,QAAQ,IAAI,OAAO,IAA0B,CAAC;AACpG,QAAI,OAAO;AACX,QAAI,YAAY;AAChB,WAAO,gBAAgB,OAAO,MAAM,CAAC,EAAE,IAAI,OAAI;AAC3C,cAAQ,EAAE,CAAC;AACX,UAAI,EAAE,CAAC,MAAM,GAAG;AACZ,oBAAY;MAChB;AACA,mBAAa,EAAE,CAAC;AAChB,YAAM,SAAS,EAAE,CAAC;AAClB,YAAM,SAAS,SAAS,aAAa,SAAS,EAAE,MAAM,UAAS,CAAE;AACjE,aAAO;QACH;QACA,WAAW,QAAQ,IAAI,EAAE,CAAC,CAAC;QAC3B,gBAAgB,EAAE,CAAC;QACnB,MAAM,SAAS,aAAa,QAAQ,EAAE,OAAO,EAAE,MAAM,UAAS,GAAI,KAAK,EAAE,MAAM,WAAW,YAAY,OAAM,EAAE,CAAE;;IAExH,CAAC;EACL;AApBgB,EAAAA,uBAAA,SAAM;AAsBtB,WAAS,gBAAmB,KAAU,WAAiB;AACnD,UAAM,MAAM,CAAA;AACZ,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,WAAW;AAC5C,YAAM,QAAQ,IAAI,MAAM,GAAG,IAAI,SAAS;AACxC,UAAI,KAAK,KAAK;IAClB;AACA,WAAO;EACX;AACJ,GAtCiB,0BAAA,wBAAqB,CAAA,EAAA;;;ACxbhC,SAAU,0BAA0B,SAAgD;AACtF,QAAM,oBAA8B,CAAA;AACpC,QAAM,sBAAgC,CAAA;AAEtC,UAAQ,QAAQ,CAAAC,YAAS;AACrB,QAAIA,WAAA,gBAAAA,QAAQ,mBAAmB;AAC3B,wBAAkB,KAAK,GAAGA,QAAO,iBAAiB;IACtD;AACA,QAAIA,WAAA,gBAAAA,QAAQ,qBAAqB;AAC7B,0BAAoB,KAAK,GAAGA,QAAO,mBAAmB;IAC1D;EACJ,CAAC;AAED,QAAM,gBAAsC;IACxC,mBAAmB,kBAAkB,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI,iBAAiB,CAAC,EAAE,KAAI,IAAK;IAClG,qBAAqB,oBAAoB,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI,mBAAmB,CAAC,EAAE,KAAI,IAAK;;AAG5G,SAAO,cAAc,oBAAoB,gBAAgB;AAC7D;;;AFrBM,IAAO,wBAAP,MAA4B;EAO9B,YAAY,UAA+B;AALjC,SAAA,sBAAsB,IAAI,+CAAO;AACjC,SAAA,uBAAuB,IAAI,+CAAO;AAKxC,SAAK,WAAW;EACpB;EAEA,IAAI,eAAY;AACZ,WAAO,KAAK,oBAAoB;EACpC;EAEA,IAAI,gBAAa;AACb,WAAO,KAAK,qBAAqB;EACrC;EAEA,MAAM,WAAW,QAAwB;AACrC,SAAK,kBAAiB;AAEtB,SAAK,gCAAgC,MAAM;AAE3C,SAAK,oBAAoB,KAAK,MAAM;AACpC,SAAK,oBAAoB,QAAO;AAChC,WAAO,KAAK,sBAAsB,MAAM;EAC5C;;;;;EAMU,oBAAiB;AACvB,cAAU,KAAK,QAAQ;AACvB,SAAK,SAAS,gBAAgB,IAAI,QAAQ,cAAY,UAAU,QAAQ,CAAC;EAC7E;EAEU,WAAW,UAA4E;AAC7F,UAAM,cAA2D,KAAK,SAAS,gBAAgB;AAC/F,WAAO,YAAY,KAAK,cAAY,SAAS,QAAQ,MAAM,MAAS;EACxE;EAEU,sBAAsB,SAAyB;AApG7D;AAqGQ,UAAM,wBAAwB,KAAK,SAAS,IAAI;AAChD,UAAM,wBAAuB,UAAK,SAAS,IAAI,yBAAlB,mBAAwC;AACrE,UAAM,cAA2D,KAAK,SAAS,gBAAgB;AAC/F,UAAM,uBAAuB,KAAK,WAAW,OAAE;AAxGvD,UAAAC;AAwG0D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAS;AAClE,UAAM,0BAA0B,YAAY,IAAI,OAAE;AAzG1D,UAAAA,KAAAC;AAyG6D,cAAAA,OAAAD,MAAA,EAAE,QAAF,gBAAAA,IAAO,cAAP,gBAAAC,IAAkB;KAAmB,EAAE,KAAK,OAAK,QAAQ,CAAC,CAAC;AAChH,UAAM,wBAAwB,KAAK,WAAW,OAAE;AA1GxD,UAAAD;AA0G2D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAkB;AAC5E,UAAM,4BAA4B,KAAK,WAAW,OAAE;AA3G5D,UAAAA;AA2G+D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAqB;AACnF,UAAM,wBAAwB,kCAAkC,YAAY,IAAI,OAAE;AA5G1F,UAAAA,KAAAC;AA4G6F,cAAAA,OAAAD,MAAA,EAAE,QAAF,gBAAAA,IAAO,0BAAP,gBAAAC,IAA8B;KAAqB,CAAC;AACzI,UAAM,gBAAe,gBAAK,SAAS,QAAd,mBAAmB,0BAAnB,mBAA0C;AAC/D,UAAM,0BAA0B,KAAK,WAAW,OAAE;AA9G1D,UAAAD;AA8G6D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAoB;AAChF,UAAM,uBAAuB,0BAA0B,YAAY,IAAI,OAAE;AA/GjF,UAAAA,KAAAC;AA+GoF,cAAAA,OAAAD,MAAA,EAAE,QAAF,gBAAAA,IAAO,kBAAP,gBAAAC,IAAsB;KAAoB,CAAC;AACvH,UAAM,sBAAsB,KAAK,WAAW,OAAE;AAhHtD,UAAAD;AAgHyD,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAY;AACpE,UAAM,gCAAgC,KAAK,WAAW,OAAE;AAjHhE,UAAAA;AAiHmE,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAsB;AACxF,UAAM,wBAAwB,KAAK,WAAW,OAAE;AAlHxD,UAAAA;AAkH2D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAkB;AAC5E,UAAM,oBAAoB,+BAA+B,YAAY,IAAI,OAAE;AAnHnF,UAAAA,KAAAC;AAmHsF,cAAAA,OAAAD,MAAA,EAAE,QAAF,gBAAAA,IAAO,uBAAP,gBAAAC,IAA2B;KAAiB,CAAC;AAC3H,UAAM,wBAAwB,KAAK,WAAW,OAAE;AApHxD,UAAAD;AAoH2D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAkB;AAC5E,UAAM,4BAA4B,KAAK,WAAW,OAAE;AArH5D,UAAAA;AAqH+D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAsB;AACpF,UAAM,wBAAwB,KAAK,WAAW,OAAE;AAtHxD,UAAAA;AAsH2D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAkB;AAC5E,UAAM,+BAA+B,KAAK,WAAW,OAAE;AAvH/D,UAAAA;AAuHkE,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAyB;AAC1F,UAAM,0BAA0B,KAAK,WAAW,OAAE;AAxH1D,UAAAA;AAwH6D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAoB;AAChF,UAAM,mBAAmB,KAAK,WAAW,OAAE;AAzHnD,UAAAA;AAyHsD,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAa;AAClE,UAAM,oBAAoB,KAAK,WAAW,OAAE;AA1HpD,UAAAA;AA0HuD,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAc;AACpE,UAAM,2BAA2B,KAAK,WAAW,OAAE;AA3H3D,UAAAA;AA2H8D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAqB;AAClF,UAAM,2BAA2B,KAAK,WAAW,CAAC,MAAG;AA5H7D,UAAAA;AA4HgE,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAqB;AACpF,UAAM,sBAAsB,KAAK,WAAW,OAAE;AA7HtD,UAAAA;AA6HyD,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAgB;AACxE,UAAM,yBAAyB,KAAK,WAAW,OAAE;AA9HzD,UAAAA;AA8H4D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAmB;AAC9E,UAAM,uBAAuB,KAAK,WAAW,OAAE;AA/HvD,UAAAA;AA+H0D,cAAAA,MAAA,EAAE,QAAF,gBAAAA,IAAO;KAAiB;AAC1E,UAAM,2BAA0B,UAAK,SAAS,QAAd,mBAAmB;AAEnD,UAAM,SAA2B;MAC7B,cAAc;QACV,WAAW;UACP,kBAAkB;YACd,WAAW;;UAEf,gBAAgB;;QAEpB,wBAAwB,gBAAgB;UACpC,UAAU;;QAEd,kBAAkB;UACd,QAAQ,4DAAqB;UAC7B,WAAW;UACX,MAAM,QAAQ,sBAAsB,eAAe;UACnD,UAAU,QAAQ,sBAAsB,gBAAgB;UACxD,mBAAmB,QAAQ,sBAAsB,yBAAyB;;QAE9E,oBAAoB,wBAAwB,oBAAoB;QAChE,oBAAoB;QACpB,wBAAwB;QACxB,oBAAoB;QACpB,wBAAwB;QACxB,2BAA2B;QAC3B,oBAAoB;QACpB,4BAA4B;QAC5B,iCAAiC;QACjC,kCAAkC;QAClC,sBAAsB;QACtB,eAAe;QACf,gBAAgB,oBAAoB;UAChC,iBAAiB;YACjB;QACJ,wBAAwB,4BAClB,wBACA;QACN,uBAAuB;QACvB,wBAAwB;QACxB,uBAAuB,2BACjB,CAAA,IACA;QACN,uBAAuB,2BACjB,CAAA,IACA;QACN,sBAAsB,0BAChB,EAAE,iBAAiB,MAAK,IACxB;QACN,kBAAkB,sBACZ,EAAE,iBAAiB,MAAK,IACxB;QACN,qBAAqB;QACrB,mBAAmB,uBACb,EAAE,iBAAiB,MAAK,IACxB;QACN,yBAAyB,0BACnB,EAAE,iBAAiB,QAAQ,wBAAwB,aAAa,EAAC,IACjE;;;AAId,WAAO;EACX;EAEA,YAAY,QAAyB;AACjC,SAAK,iCAAiC,MAAM;AAE5C,SAAK,qBAAqB,KAAK,MAAM;AACrC,SAAK,qBAAqB,QAAO;EACrC;EAEU,gCAAgC,QAAwB;AAC9D,SAAK,SAAS,UAAU,sBAAsB,WAAW,MAAM;AAC/D,SAAK,SAAS,UAAU,iBAAiB,WAAW,MAAM;EAC9D;EAEU,iCAAiC,QAAyB;AAChE,UAAME,cAAa,KAAK,SAAS,IAAI;AACrC,UAAM,sBAAsBA,cAA6C,iCAClE,SADkE;MAErE,UAAU,CAAAC,YAAUD,YAAW,OAAO,SAAS,0EAAmC,MAAMC,OAAM;MAC9F,oBAAoB,CAAAA,YAAUD,YAAW,UAAU,iBAAiBC,OAAM;SAC1E;AAKJ,SAAK,SAAS,UAAU,sBAAsB,YAAY,mBAAmB,EACxE,MAAM,SAAO,QAAQ,MAAM,kDAAkD,GAAG,CAAC;AACtF,SAAK,SAAS,UAAU,iBAAiB,YAAY,MAAM,EACtD,MAAM,SAAO,QAAQ,MAAM,6CAA6C,GAAG,CAAC;EACrF;;AAiCJ,SAAS,gBAAgB,KAAuB;AAC5C,SAAO,OAAO,QAAQ;AAC1B;AAEM,IAAW;CAAjB,SAAiBC,iBAAc;AACd,EAAAA,gBAAA,SAA6B,OAAO,OAAO,EAAE,MAAM,aAAa,OAAO,cAAc,OAAM,CAAE;AAC7F,EAAAA,gBAAA,iBAAqC,OAAO,OAAO,EAAE,MAAM,aAAa,OAAO,cAAc,eAAc,CAAE;AAC7G,EAAAA,gBAAA,iBAAqC,OAAO,OAAO,EAAE,MAAM,aAAa,OAAO,cAAc,eAAc,CAAE;AAC7G,EAAAA,gBAAA,SAA6B,OAAO,OAAO,EAAE,MAAM,aAAa,OAAO,cAAc,OAAM,CAAE;AAC7F,EAAAA,gBAAA,oBAAwC,OAAO,OAAO,EAAE,MAAM,aAAa,OAAO,cAAc,kBAAiB,CAAE;AACnH,EAAAA,gBAAA,YAAgC,OAAO,OAAO,EAAE,MAAM,aAAa,OAAO,cAAc,UAAS,CAAE;AACpH,GAPiB,mBAAA,iBAAc,CAAA,EAAA;AASzB,SAAU,oBAAoB,UAAiC,sBAAoD,CAAA,GAAE;AACvH,QAAMF,cAAa,SAAS,IAAI;AAChC,MAAI,CAACA,aAAY;AACb,UAAM,IAAI,MAAM,sFAAsF;EAC1G;AAEA,2BAAyBA,aAAY,QAAQ;AAC7C,0BAAwBA,aAAY,QAAQ;AAC5C,wBAAsBA,aAAY,QAAQ;AAC1C,uBAAqBA,aAAY,UAAU,oBAAoB,kBAAkB;AACjF,2BAAyBA,aAAY,UAAU,oBAAoB,kBAAkB;AACrF,2BAAyBA,aAAY,UAAU,oBAAoB,sBAAsB;AACzF,2BAAyBA,aAAY,UAAU,oBAAoB,kBAAkB;AACrF,+BAA6BA,aAAY,UAAU,oBAAoB,YAAY;AACnF,+BAA6BA,aAAY,UAAU,oBAAoB,sBAAsB;AAC7F,8BAA4BA,aAAY,UAAU,oBAAoB,yBAAyB;AAC/F,yBAAuBA,aAAY,UAAU,oBAAoB,oBAAoB;AACrF,uBAAqBA,aAAY,UAAU,oBAAoB,SAAS;AACxE,uBAAqBA,aAAY,UAAU,oBAAoB,kBAAkB;AACjF,mBAAiBA,aAAY,UAAU,oBAAoB,cAAc;AACzE,kBAAgBA,aAAY,UAAU,oBAAoB,aAAa;AACvE,sBAAoBA,aAAY,UAAU,oBAAoB,iBAAiB;AAC/E,0BAAwBA,aAAY,UAAU,oBAAoB,qBAAqB;AACvF,2BAAyBA,aAAY,QAAQ;AAC7C,0BAAwBA,aAAY,UAAU,oBAAoB,aAAa;AAC/E,0BAAwBA,aAAY,UAAU,oBAAoB,qBAAqB;AACvF,0BAAwBA,aAAY,UAAU,oBAAoB,qBAAqB;AACvF,qBAAmBA,aAAY,UAAU,oBAAoB,gBAAgB;AAC7E,yBAAuBA,aAAY,UAAU,oBAAoB,oBAAoB;AACrF,gCAA8BA,aAAY,QAAQ;AAClD,4BAA0BA,aAAY,UAAU,oBAAoB,mBAAmB;AACvF,4BAA0BA,aAAY,UAAU,oBAAoB,uBAAuB;AAE3F,EAAAA,YAAW,aAAa,YAAS;AAC7B,WAAO,SAAS,IAAI,eAAe,WAAW,MAAM;EACxD,CAAC;AACD,EAAAA,YAAW,cAAc,YAAS;AAC9B,aAAS,IAAI,eAAe,YAAY,MAAM;EAClD,CAAC;AAGD,QAAM,YAAY,SAAS,UAAU;AACrC,YAAU,OAAOA,WAAU;AAG3B,EAAAA,YAAW,OAAM;AACrB;AAMM,SAAU,yBAAyBA,aAAwB,UAA+B;AAC5F,QAAM,UAAU,SAAS,IAAI;AAC7B,QAAM,YAAY,SAAS,UAAU;AACrC,MAAI,QAAQ,iBAAiB;AACzB,cAAU,UAAU,YAAU,QAAQ,gBAAiB,MAAM,CAAC;EAClE;AACA,MAAI,QAAQ,kBAAkB;AAC1B,cAAU,mBAAmB,YAAU,QAAQ,iBAAkB,MAAM,CAAC;EAC5E;AACA,MAAI,QAAQ,kBAAkB;AAC1B,cAAU,WAAW,YAAU,QAAQ,iBAAkB,MAAM,CAAC;EACpE;AACA,MAAI,QAAQ,iBAAiB;AACzB,cAAU,UAAU,YAAU,QAAQ,gBAAiB,MAAM,CAAC;EAClE;AACA,MAAI,QAAQ,kBAAkB;AAC1B,cAAU,WAAW,WAAS,QAAQ,iBAAkB,KAAK,CAAC;EAClE;AACA,MAAI,QAAQ,2BAA2B;AACnC,cAAU,oBAAoB,WAAS,QAAQ,0BAA2B,KAAK,CAAC;EACpF;AACA,MAAI,QAAQ,uBAAuB;AAC/B,IAAAA,YAAW,wBAAwB,YAAU,QAAQ,sBAAuB,MAAM,CAAC;EACvF;AACJ;AAEM,SAAU,wBAAwBA,aAAwB,UAA+B;AAC3F,QAAM,UAAU,SAAS,IAAI;AAC7B,MAAI,CAAC,SAAS;AACV;EACJ;AACA,MAAI,QAAQ,gBAAgB;AACxB,IAAAA,YAAW,UAAU,iBAAiB,YAAU,QAAQ,eAAgB,MAAM,CAAC;EACnF;AACA,MAAI,QAAQ,gBAAgB;AACxB,IAAAA,YAAW,UAAU,iBAAiB,YAAU,QAAQ,eAAgB,MAAM,CAAC;EACnF;AACA,MAAI,QAAQ,gBAAgB;AACxB,IAAAA,YAAW,UAAU,iBAAiB,YAAU,QAAQ,eAAgB,MAAM,CAAC;EACnF;AACA,MAAI,QAAQ,iBAAiB;AACzB,IAAAA,YAAW,UAAU,kBAAkB,YAAU,QAAQ,gBAAiB,MAAM,CAAC;EACrF;AACA,MAAI,QAAQ,iBAAiB;AACzB,IAAAA,YAAW,UAAU,kBAAkB,YAAU,QAAQ,gBAAiB,MAAM,CAAC;EACrF;AACA,MAAI,QAAQ,iBAAiB;AACzB,IAAAA,YAAW,UAAU,kBAAkB,YAAU,QAAQ,gBAAiB,MAAM,CAAC;EACrF;AACJ;AAEM,SAAU,sBAAsBA,aAAwB,UAA+B;AACzF,QAAM,kBAAkB,SAAS,UAAU;AAC3C,kBAAgB,SAAS,OAAOG,IAAG,YAAW;AAC1C,eAAW,OAAO,SAAS;AACvB,MAAAH,YAAW,gBAAgB;QACvB,KAAK,IAAI,SAAQ;QACjB,aAAa,CAAA;OAChB;IACL;EACJ,CAAC;AACD,kBAAgB,gBAAgB,cAAc,WAAW,OAAO,aAAY;AACxE,QAAI,SAAS,aAAa;AACtB,MAAAA,YAAW,gBAAgB;QACvB,KAAK,SAAS,IAAI,SAAQ;QAC1B,aAAa,SAAS;OACzB;IACL;EACJ,CAAC;AACL;AAEM,SAAU,qBAAqBA,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AAClJ,EAAAA,YAAW,aAAa,qBACpB,CAACI,WAAU,UAAU,QAAQ,gBAAe;AAvYpD;AAwYY,YAAO,WAAAA,UAAS,QAAT,mBAAc,uBAAd,mBAAkC,cAAc,UAAU,QAAQ;EAC7E,GACA,UACA,aAAa,CAChB;AACL;AAEM,SAAU,yBAAyBJ,aAAwB,UAAiC,gBAAoC,eAAe,mBAAiB;AAClK,EAAAA,YAAW,aAAa,qBACpB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAjZlD;AAiZqD,uBAAAA,UAAS,QAAT,mBAAc,uBAAd,mBAAkC,eAAe,UAAU,QAAQ;KAChH,UACA,aAAa,CAChB;AACL;AAEM,SAAU,qBAAqBJ,aAAwB,UAAiC,gBAAoC,cAAc,WAAS;AACrJ,EAAAA,YAAW,aAAa,qBACpB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAzZlD;AAyZqD,uBAAAA,UAAS,QAAT,mBAAc,uBAAd,mBAAkC,eAAe,UAAU,QAAQ;KAChH,UACA,aAAa,CAChB;AACL;AAEM,SAAU,yBAAyBJ,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AACtJ,EAAAA,YAAW,iBAAiB,qBACxB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAjalD;AAiaqD,uBAAAA,UAAS,QAAT,mBAAc,2BAAd,mBAAsC,WAAW,UAAU,QAAQ;KAChH,UACA,aAAa,CAChB;AACL;AAEM,SAAU,yBAAyBJ,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AACtJ,EAAAA,YAAW,aAAa,qBACpB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAzalD;AAyaqD,uBAAAA,UAAS,QAAT,mBAAc,uBAAd,mBAAkC,cAAc,UAAU,QAAQ;KAC/G,UACA,aAAa,CAChB;AACL;AAEM,SAAU,6BAA6BJ,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AAC1J,EAAAA,YAAW,iBAAiB,qBACxB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAjblD;AAibqD,uBAAAA,UAAS,QAAT,mBAAc,iBAAd,mBAA4B,kBAAkB,UAAU,QAAQ;KAC7G,UACA,aAAa,CAChB;AACL;AAEM,SAAU,6BAA6BJ,aAAwB,UAAiC,gBAAoC,eAAe,mBAAiB;AACtK,EAAAA,YAAW,iBAAiB,qBACxB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAzblD;AAybqD,uBAAAA,UAAS,QAAT,mBAAc,2BAAd,mBAAsC,kBAAkB,UAAU,QAAQ;KACvH,UACA,aAAa,CAChB;AACL;AAEM,SAAU,0BAA0BJ,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AACvJ,EAAAA,YAAW,cAAc,qBACrB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAjclD;AAicqD,uBAAAA,UAAS,QAAT,mBAAc,wBAAd,mBAAmC,eAAe,UAAU,QAAQ;KACjH,UACA,aAAa,CAChB;AACL;AAEM,SAAU,4BAA4BJ,aAAwB,UAAiC,gBAAoC,eAAe,mBAAiB;AACrK,EAAAA,YAAW,oBAAoB,qBAC3B,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAzclD;AAycqD,uBAAAA,UAAS,QAAT,mBAAc,8BAAd,mBAAyC,qBAAqB,UAAU,QAAQ;KAC7H,UACA,aAAa,CAChB;AACL;AAEM,SAAU,gBAAgBJ,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AAC7I,EAAAA,YAAW,QAAQ,qBACf,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAjdlD;AAidqD,uBAAAA,UAAS,QAAT,mBAAc,kBAAd,mBAA6B,gBAAgB,UAAU,QAAQ;KAC5G,UACA,aAAa,CAChB;AACL;AAEM,SAAU,uBAAuBJ,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AACpJ,EAAAA,YAAW,gBAAgB,qBACvB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAzdlD;AAydqD,uBAAAA,UAAS,QAAT,mBAAc,yBAAd,mBAAoC,iBAAiB,UAAU,QAAQ;KACpH,UACA,aAAa,CAChB;AACL;AAEM,SAAU,qBAAqBJ,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AAClJ,EAAAA,YAAW,qBAAqB,qBAC5B,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAjelD;AAieqD,uBAAAA,UAAS,QAAT,mBAAc,cAAd,mBAAyB,eAAe,UAAU,QAAQ;KACvG,UACA,aAAa,CAChB;AACD,EAAAJ,YAAW,0BAA0B,qBACjC,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAtelD;AAseqD,uBAAAA,UAAS,QAAT,mBAAc,cAAd,mBAAyB,oBAAoB,UAAU,QAAQ;KAC5G,UACA,aAAa,CAChB;AACD,EAAAJ,YAAW,2BAA2B,qBAClC,CAACI,WAAU,UAAU,QAAQ,gBAAa;AA3elD;AA2eqD,uBAAAA,UAAS,QAAT,mBAAc,cAAd,mBAAyB,qBAAqB,UAAU,QAAQ;KAC7G,UACA,aAAa,CAChB;AACL;AAEM,SAAU,iBAAiBJ,aAAwB,UAAiC,gBAAoC,eAAe,mBAAiB;AAE1J,EAAAA,YAAW,gBAAgB,qBACvB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AApflD;AAofqD,uBAAAA,UAAS,QAAT,mBAAc,mBAAd,mBAA8B,OAAO,UAAU,QAAQ;KACpG,UACA,aAAa,CAChB;AACD,EAAAJ,YAAW,gBAAgB,qBACvB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAzflD;AAyfqD,uBAAAA,UAAS,QAAT,mBAAc,mBAAd,mBAA8B,cAAc,UAAU,QAAQ;KAC3G,UACA,aAAa,CAChB;AACL;AAEM,SAAU,oBAAoBJ,aAAwB,UAAiC,gBAAoC,cAAc,mBAAiB;AAC5J,EAAAA,YAAW,UAAU,UAAU,GAAG,2BAC9B,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAjgBlD;AAigBqD,uBAAAA,UAAS,QAAT,mBAAc,sBAAd,mBAAiC,cAAc,UAAU,QAAQ;KAC9G,UACA,aAAa,CAChB;AACL;AAEM,SAAU,wBAAwBJ,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AAErJ,QAAM,cAA8B,EAAE,MAAM,CAAA,EAAE;AAC9C,EAAAA,YAAW,UAAU,eAAe,GAAG,2BACnC,CAACI,WAAU,UAAU,QAAQ,gBAAe;AA3gBpD;AA4gBY,SAAI,KAAAA,UAAS,QAAT,mBAAc,uBAAuB;AACrC,aAAOA,UAAS,IAAI,sBAAsB,kBAAkB,UAAU,QAAQ,WAAW;IAC7F;AACA,WAAO;EACX,GACA,UACA,aAAa,CAChB;AACD,EAAAJ,YAAW,UAAU,eAAe,QAAQ,2BACxC,CAACI,WAAU,UAAU,QAAQ,gBAAe;AArhBpD;AAshBY,SAAI,KAAAA,UAAS,QAAT,mBAAc,uBAAuB;AACrC,aAAOA,UAAS,IAAI,sBAAsB,uBAAuB,UAAU,QAAQ,WAAW;IAClG;AACA,WAAO;EACX,GACA,UACA,aAAa,CAChB;AACD,EAAAJ,YAAW,UAAU,eAAe,QAAQ,2BACxC,CAACI,WAAU,UAAU,QAAQ,gBAAe;AA/hBpD;AAgiBY,SAAI,KAAAA,UAAS,QAAT,mBAAc,uBAAuB;AACrC,aAAOA,UAAS,IAAI,sBAAsB,uBAAuB,UAAU,QAAQ,WAAW;IAClG;AACA,WAAO;EACX,GACA,UACA,aAAa,CAChB;AACL;AACM,SAAU,8BAA8BJ,aAAwB,UAA+B;AACjG,EAAAA,YAAW,yBAAyB,YAAS;AACzC,aAAS,UAAU,sBAAsB,oBAAoB,MAAM;EACvE,CAAC;AACL;AAEM,SAAU,yBAAyBA,aAAwB,UAA+B;AAC5F,QAAM,iBAAiB,SAAS,IAAI;AACpC,MAAI,gBAAgB;AAChB,IAAAA,YAAW,iBAAiB,OAAO,QAAQ,UAAS;AAljB5D;AAmjBY,UAAI;AACA,eAAO,MAAM,eAAe,eAAe,OAAO,UAAS,YAAO,cAAP,YAAoB,CAAA,GAAI,KAAK;MAC5F,SAAS,KAAK;AACV,eAAO,cAAc,GAAG;MAC5B;IACJ,CAAC;EACL;AACJ;AAEM,SAAU,uBAAuBA,aAAwB,UAAiC,gBAAoC,cAAc,QAAM;AACpJ,EAAAA,YAAW,gBAAgB,2BACvB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AA9jBlD;AA8jBqD,uBAAAA,UAAS,QAAT,mBAAc,yBAAd,mBAAoC,iBAAiB,UAAU,QAAQ;KACpH,UACA,aAAa,CAChB;AACL;AAEM,SAAU,wBAAwBJ,aAAwB,UAAiC,gBAAoC,cAAc,mBAAiB;AAChK,EAAAA,YAAW,gBAAgB,2BACvB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AAtkBlD;AAskBqD,uBAAAA,UAAS,QAAT,mBAAc,kBAAd,mBAA6B,qBAAqB,UAAU,QAAQ;KACjH,UACA,aAAa,CAChB;AACL;AAEM,SAAU,mBAAmBJ,aAAwB,UAAiC,gBAAoC,cAAc,mBAAiB;AAC3J,EAAAA,YAAW,WAAW,2BAClB,CAACI,WAAU,UAAU,QAAQ,gBAAa;AA9kBlD;AA8kBqD,uBAAAA,UAAS,QAAT,mBAAc,qBAAd,mBAAgC,gBAAgB,UAAU,QAAQ;KAC/G,UACA,aAAa,CAChB;AACL;AAEM,SAAU,0BAA0BJ,aAAwB,UAAiC,gBAAoC,eAAe,gBAAc;AAplBpK;AAqlBI,QAAM,0BAA0B,SAAS,IAAI;AAC7C,MAAI,yBAAyB;AAEzB,QAAI,gBAAgB,aAAa,KAAK,cAAc,SAAS,YAAY;AACrE,YAAM,IAAI,MAAM,+KAA+K;IACnM;AAEA,UAAM,kBAAkB,SAAS,UAAU;AAC3C,IAAAA,YAAW,kBAAkB,OAAO,QAAQ,UAAS;AACjD,UAAI;AACA,cAAM,gBAAgB,UAAU,cAAc,OAAO,KAAK;AAC1D,eAAO,MAAM,wBAAwB,WAAW,QAAQ,KAAK;MACjE,SAAS,KAAK;AACV,eAAO,cAAc,GAAG;MAC5B;IACJ,CAAC;AACD,UAAM,0BAAyB,6BAAwB,kBAAxB,mBAAuC,KAAK;AAC3E,QAAI,wBAAwB;AACxB,MAAAA,YAAW,yBAAyB,OAAO,iBAAiB,UAAS;AACjE,YAAI;AACA,gBAAM,gBAAgB,UAAU,cAAc,OAAO,KAAK;AAC1D,iBAAO,MAAM,uBAAuB,iBAAiB,KAAK;QAC9D,SAAS,KAAK;AACV,iBAAO,cAAc,GAAG;QAC5B;MACJ,CAAC;IACL;EACJ;AACJ;AAEM,SAAU,wBAAwBA,aAAwB,UAAiC,gBAAoC,eAAe,mBAAiB;AACjK,EAAAA,YAAW,UAAU,cAAc,UAAU,2BACzC,OAAOI,WAAU,UAAU,QAAQ,gBAAe;AArnB1D;AAsnBY,SAAI,KAAAA,UAAS,QAAT,mBAAc,uBAAuB;AACrC,YAAM,SAAS,MAAMA,UAAS,IAAI,sBAAsB,qBAAqB,UAAU,QAAQ,WAAW;AAC1G,aAAO,0BAAU;IACrB;AACA,WAAO;EACX,GACA,UACA,aAAa,CAChB;AAED,EAAAJ,YAAW,UAAU,cAAc,gBAAgB,8BAC/C,OAAOI,WAAU,QAAQ,gBAAe;AAjoBhD;AAkoBY,SAAI,KAAAA,UAAS,QAAT,mBAAc,uBAAuB;AACrC,YAAM,SAAS,MAAMA,UAAS,IAAI,sBAAsB,cAAc,QAAQ,WAAW;AACzF,aAAO,0BAAU;IACrB;AACA,WAAO;EACX,GACA,UACA,aAAa,CAChB;AAED,EAAAJ,YAAW,UAAU,cAAc,gBAAgB,8BAC/C,OAAOI,WAAU,QAAQ,gBAAe;AA7oBhD;AA8oBY,SAAI,KAAAA,UAAS,QAAT,mBAAc,uBAAuB;AACrC,YAAM,SAAS,MAAMA,UAAS,IAAI,sBAAsB,cAAc,QAAQ,WAAW;AACzF,aAAO,0BAAU;IACrB;AACA,WAAO;EACX,GACA,UACA,aAAa,CAChB;AACL;AAEM,SAAU,wBAAwBJ,aAAwB,gBAAuC,gBAAoC,eAAe,mBAAiB;AAEvK,MAAI,CAAC,eAAe,gBAAgB,IAAI,KAAK,CAAC,aAA4C;AA3pB9F;AA2pBiG,0BAAS,QAAT,mBAAc;GAAqB,GAAG;AAC/H;EACJ;AAEA,EAAAA,YAAW,UAAU,cAAc,UAC/B,2BACI,OAAO,UAAU,UAAU,QAAQ,gBAAe;AAjqB9D;AAkqBgB,UAAM,SAAS,QAAM,oBAAS,QAAT,mBAAc,0BAAd,mBAAqC,qBAAqB,UAAU,QAAQ;AACjG,WAAO,0BAAU;EACrB,GACA,gBACA,aAAa,CAChB;AAGL,EAAAA,YAAW,UAAU,cAAc,aAC/B,8BACI,OAAO,UAAU,QAAQ,gBAAe;AA5qBpD;AA6qBgB,UAAM,SAAS,QAAM,oBAAS,QAAT,mBAAc,0BAAd,mBAAqC,WAAW,QAAQ;AAC7E,WAAO,0BAAU;EACrB,GACA,gBACA,aAAa,CAChB;AAGL,EAAAA,YAAW,UAAU,cAAc,WAC/B,8BACI,OAAO,UAAU,QAAQ,gBAAe;AAvrBpD;AAwrBgB,UAAM,SAAS,QAAM,oBAAS,QAAT,mBAAc,0BAAd,mBAAqC,SAAS,QAAQ;AAC3E,WAAO,0BAAU;EACrB,GACA,gBACA,aAAa,CAChB;AAET;AAEM,SAAU,8BACZ,aACA,gBACA,eAAkC;AAElC,QAAM,kBAAkB,eAAe;AACvC,SAAO,OAAO,QAAW,gBAAkC;AAvsB/D;AAwsBQ,UAAM,MAAMK,KAAI,MAAM,OAAO,KAAK,GAAG;AACrC,UAAM,oBAAoB,MAAM,eAAkB,gBAAgB,aAAa,KAAK,aAAa;AACjG,QAAI,mBAAmB;AACnB,aAAO;IACX;AACA,QAAI,CAAC,gBAAgB,YAAY,GAAG,GAAG;AACnC,YAAM,YAAY,6CAA6C,GAAG;AAClE,cAAQ,MAAM,SAAS;AACvB,aAAO,cAAiB,IAAI,MAAM,SAAS,CAAC;IAChD;AACA,UAAM,WAAW,gBAAgB,YAAY,GAAG;AAChD,QAAI;AACA,cAAO,WAAM,YAAY,UAAU,QAAQ,WAAW,MAA/C,YAAoD;IAC/D,SAAS,KAAK;AACV,aAAO,cAAiB,GAAG;IAC/B;EACJ;AACJ;AAEM,SAAU,2BACZ,aACA,gBACA,eAAkC;AAElC,QAAM,YAAY,eAAe,UAAU;AAC3C,QAAM,kBAAkB,eAAe;AACvC,SAAO,OAAO,QAAW,gBAAkC;AAluB/D;AAmuBQ,UAAM,MAAMA,KAAI,MAAM,OAAO,aAAa,GAAG;AAC7C,UAAM,oBAAoB,MAAM,eAAkB,gBAAgB,aAAa,KAAK,aAAa;AACjG,QAAI,mBAAmB;AACnB,aAAO;IACX;AACA,QAAI,CAAC,gBAAgB,YAAY,GAAG,GAAG;AACnC,YAAM,YAAY,6CAA6C,GAAG;AAClE,cAAQ,MAAM,SAAS;AACvB,aAAO,cAAiB,IAAI,MAAM,SAAS,CAAC;IAChD;AACA,UAAM,WAAW,gBAAgB,YAAY,GAAG;AAChD,QAAI;AACA,YAAM,WAAW,MAAM,UAAU,oBAAoB,GAAG;AACxD,cAAO,WAAM,YAAY,UAAU,UAAU,QAAQ,WAAW,MAAzD,YAA8D;IACzE,SAAS,KAAK;AACV,aAAO,cAAiB,GAAG;IAC/B;EACJ;AACJ;AAEM,SAAU,qBACZ,aACA,gBACA,eAAkC;AAElC,QAAM,YAAY,eAAe,UAAU;AAC3C,QAAM,kBAAkB,eAAe;AACvC,SAAO,OAAO,QAAW,gBAAkC;AA9vB/D;AA+vBQ,UAAM,MAAMA,KAAI,MAAM,OAAO,aAAa,GAAG;AAC7C,UAAM,oBAAoB,MAAM,eAAkB,gBAAgB,aAAa,KAAK,aAAa;AACjG,QAAI,mBAAmB;AACnB,aAAO;IACX;AACA,QAAI,CAAC,gBAAgB,YAAY,GAAG,GAAG;AACnC,cAAQ,MAAM,6CAA6C,IAAI,SAAQ,CAAE,GAAG;AAC5E,aAAO;IACX;AACA,UAAM,WAAW,gBAAgB,YAAY,GAAG;AAChD,QAAI;AACA,YAAM,WAAW,MAAM,UAAU,oBAAoB,GAAG;AACxD,cAAO,WAAM,YAAY,UAAU,UAAU,QAAQ,WAAW,MAAzD,YAA8D;IACzE,SAAS,KAAK;AACV,aAAO,cAAiB,GAAG;IAC/B;EACJ;AACJ;AAEA,eAAe,eAAkB,UAAiC,aAAgC,KAAW,eAAkC;AAC3I,MAAI,kBAAkB,QAAW;AAC7B,UAAM,kBAAkB,SAAS,UAAU;AAC3C,UAAM,mBAAmB,SAAS,UAAU;AAC5C,QAAI;AACA,YAAM,iBAAiB;AACvB,UAAI,gBAAgB,aAAa,GAAG;AAChC,cAAM,gBAAgB,UAAU,eAAe,KAAK,WAAW;MACnE,WAAW,cAAc,SAAS,YAAY;AAC1C,cAAM,gBAAgB,UAAU,cAAc,OAAO,KAAK,WAAW;MACzE,OAAO;AACH,cAAM,gBAAgB,UAAU,cAAc,OAAO,WAAW;MACpE;IACJ,SAAS,KAAK;AACV,aAAO,cAAc,GAAG;IAC5B;EACJ;AACA,SAAO;AACX;AAEA,SAAS,cAAwB,KAAY;AACzC,MAAI,qBAAqB,GAAG,GAAG;AAC3B,WAAO,IAAI,qDAAc,qDAAc,kBAAkB,iCAAiC;EAC9F;AACA,MAAI,eAAe,sDAAe;AAC9B,WAAO;EACX;AACA,QAAM;AACV;;;AGvyBA,IAAAC,gCAA+C;AAwBzC,IAAO,0BAAP,MAA8B;;;;EAIhC,cAAc,OAAmC;AAC7C,WAAO,yCAAW;EACtB;;;;EAIA,sBAAsB,OAAmC;AACrD,WAAO,iDAAmB;EAC9B;;;;AC5BJ,IAAAC,gCAAyB;AAqBnB,IAAO,4BAAP,MAAgC;EAKlC,YAAY,UAAyB;AACjC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,aAAa,SAAS,WAAW;AACtC,SAAK,gBAAgB,SAAS,OAAO;EACzC;EAEA,eAAe,UAA2B,QAAyB,cAAgC;AAC/F,UAAM,WAAW,SAAS,YAAY,MAAM;AAC5C,QAAI,CAAC,UAAU;AACX,aAAO,CAAA;IACX;AAEA,UAAM,eAAe,4BAA4B,UAAU,SAAS,aAAa,SAAS,OAAO,QAAQ,GAAG,KAAK,cAAc,UAAU;AACzI,QAAI,CAAC,cAAc;AACf,aAAO,CAAA;IACX;AAEA,WAAO,KAAK,cAAc,cAAc,QAAQ,QAAQ;EAC5D;EAEU,cAAc,cAA2B,QAAyB,WAA0B;AAClG,UAAM,YAAwB,CAAA;AAC9B,UAAM,gBAAgB,KAAK,WAAW,iBAAiB,YAAY;AACnE,eAAW,UAAU,eAAe;AAChC,YAAM,UAAU,EAAE,oBAAoB,OAAO,QAAQ,mBAAkB;AACvE,WAAK,WAAW,eAAe,QAAQ,OAAO,EAAE,QAAQ,eAAY;AAChE,kBAAU,KAAK,uCAAS,OAAO,UAAU,UAAU,SAAQ,GAAI,UAAU,QAAQ,KAAK,CAAC;MAC3F,CAAC;IACL;AACA,WAAO;EACX;;;;ACxDJ;AAmCM,IAAO,wBAAP,MAA4B;EAM9B,YAAY,UAAyB;AACjC,SAAK,aAAa,SAAS,WAAW;AACtC,SAAK,eAAe,SAAS,WAAW;AACxC,SAAK,gBAAgB,SAAS,OAAO;EACzC;EAEA,MAAM,OAAO,UAA2B,QAAsB,cAAgC;AAC1F,UAAM,UAAsC,CAAA;AAC5C,UAAM,WAAW,SAAS,YAAY,MAAM;AAC5C,QAAI,CAAC,UAAU;AACX,aAAO;IACX;AACA,UAAM,SAAS,SAAS,aAAa,SAAS,OAAO,QAAQ;AAC7D,UAAM,WAAW,4BAA4B,UAAU,QAAQ,KAAK,cAAc,UAAU;AAC5F,QAAI,CAAC,UAAU;AACX,aAAO;IACX;AACA,UAAM,cAAc,KAAK,WAAW,iBAAiB,QAAQ;AAC7D,QAAI,YAAY,WAAW,GAAG;AAC1B,aAAO;IACX;AAGA,UAAM,aAAa,YAAY,CAAC;AAChC,UAAM,UAAU,EAAE,WAAW,OAAO,oBAAoB,KAAI;AAC5D,UAAM,aAAa,KAAK,WAAW,eAAe,YAAY,OAAO;AACrE,eAAW,OAAO,YAAY;AAC1B,YAAM,SAAS,SAAS,QAAQ,IAAI,QAAQ,OAAO,OAAO,OAAO;AACjE,YAAM,MAAM,IAAI,UAAU,SAAQ;AAClC,UAAI,QAAQ,GAAG,GAAG;AACd,gBAAQ,GAAG,EAAE,KAAK,MAAM;MAC5B,OAAO;AACH,gBAAQ,GAAG,IAAI,CAAC,MAAM;MAC1B;IACJ;AACA,WAAO,EAAE,QAAO;EACpB;EAEA,cAAc,UAA2B,QAAoC,cAAgC;AACzG,WAAO,KAAK,gBAAgB,UAAU,OAAO,QAAQ;EACzD;EAEU,gBAAgB,KAAsB,UAAkB;AAC9D,UAAM,WAAW,IAAI,YAAY,MAAM;AACvC,UAAM,SAAS,IAAI,aAAa,SAAS,QAAQ;AACjD,QAAI,UAAU;AACV,YAAM,WAAW,4BAA4B,UAAU,QAAQ,KAAK,cAAc,UAAU;AAC5F,UAAI,CAAC,UAAU;AACX,eAAO;MACX;AACA,YAAM,aAAa,KAAK,WAAW,iBAAiB,QAAQ,EAAE,SAAS;AAEvE,UAAI,cAAc,KAAK,WAAW,QAAQ,GAAG;AACzC,eAAO,SAAS;MACpB;IACJ;AACA,WAAO;EACX;EAEU,WAAW,UAA6B;AAC9C,YAAO,qCAAU,YAAW,QAAQ,SAAS,OAAO,KAAK,aAAa,KAAK,aAAa,YAAY,SAAS,OAAO;EACxH;;;;ACzEE,IAAO,iCAAP,MAAqC;EAMvC,YAAY,UAA+B;AACvC,SAAK,eAAe,SAAS,UAAU;AACvC,SAAK,mBAAmB,SAAS,IAAI;AACrC,SAAK,eAAe,SAAS,IAAI;EACrC;EAEA,MAAM,WAAW,QAA+B,cAAc,wDAAkB,MAAI;AAChF,UAAM,mBAAsC,CAAA;AAC5C,UAAM,QAAQ,OAAO,MAAM,YAAW;AACtC,eAAW,eAAe,KAAK,aAAa,YAAW,GAAI;AACvD,YAAM,kBAAkB,WAAW;AACnC,UAAI,KAAK,aAAa,MAAM,OAAO,YAAY,IAAI,GAAG;AAClD,cAAM,SAAS,KAAK,mBAAmB,WAAW;AAClD,YAAI,QAAQ;AACR,2BAAiB,KAAK,MAAM;QAChC;MACJ;IACJ;AACA,WAAO;EACX;EAEU,mBAAmB,gBAAkC;AAC3D,UAAM,cAAc,eAAe;AACnC,QAAI,aAAa;AACb,aAAO;QACH,MAAM,KAAK,iBAAiB,cAAc,cAAc;QACxD,MAAM,eAAe;QACrB,UAAU;UACN,OAAO,YAAY;UACnB,KAAK,eAAe,YAAY,SAAQ;;;IAGpD,OAAO;AACH,aAAO;IACX;EACJ;;;;ACtEJ,IAAAC,gCAA0D;AA+GpD,IAAO,0BAAP,MAA8B;EAahC,YAAmB,eAA4C;AAC3D,SAAK,iBAAiB;AACtB,SAAK,mBAAmB,oBAAI,IAAG;AAE/B,SAAK,sBAAsB,IAAI,sCAAO;AACtC,SAAK,aAAa,IAAI,sCAAO;AAC7B,SAAK,cAAc,IAAI,sCAAO;AAC9B,SAAK,aAAa,IAAI,sCAAO;AAC7B,SAAK,cAAc,IAAI,sCAAO;EAClC;EAEA,IAAW,YAAS;AAChB,WAAO,KAAK,WAAW;EAC3B;EAEA,IAAW,qBAAkB;AACzB,WAAO,KAAK,oBAAoB;EACpC;EAEA,IAAW,aAAU;AACjB,WAAO,KAAK,YAAY;EAC5B;EAEO,oBAAoB,SAAuE;AAC9F,SAAK,qBAAqB;EAC9B;EAEA,IAAW,YAAS;AAChB,WAAO,KAAK,WAAW;EAC3B;EAEA,IAAW,aAAU;AACjB,WAAO,KAAK,YAAY;EAC5B;EAEO,IAAI,KAAiB;AACxB,WAAO,KAAK,iBAAiB,IAAI,SAAS,UAAU,GAAG,CAAC;EAC5D;EAEO,IAAI,UAAW;AAClB,UAAM,MAAM,SAAS,UAAU,SAAS,GAAG;AAC3C,QAAI,SAAS;AACb,QAAI,KAAK,iBAAiB,IAAI,GAAG,GAAG;AAChC,eAAS;IACb;AACA,SAAK,iBAAiB,IAAI,KAAK,QAAQ;AACvC,UAAM,SAAS,OAAO,OAAO,EAAE,SAAQ,CAAE;AACzC,SAAK,WAAW,KAAK,MAAM;AAC3B,SAAK,oBAAoB,KAAK,MAAM;AACpC,WAAO;EACX;EAEO,OAAO,KAAqB;AAC/B,UAAM,YAAY,SAAS,UAAU,OAAO,QAAQ,YAAY,SAAS,MAAM,IAAI,MAAM,GAAG;AAC5F,UAAM,iBAAiB,KAAK,iBAAiB,IAAI,SAAS;AAC1D,QAAI,mBAAmB,QAAW;AAC9B,WAAK,iBAAiB,OAAO,SAAS;AACtC,WAAK,YAAY,KAAK,OAAO,OAAO,EAAE,UAAU,eAAc,CAAE,CAAC;IACrE;EACJ;EAEO,MAAG;AACN,WAAO,MAAM,KAAK,KAAK,iBAAiB,OAAM,CAAE;EACpD;EAEO,OAAI;AACP,WAAO,MAAM,KAAK,KAAK,iBAAiB,KAAI,CAAE;EAClD;EAEO,OAAOC,aAAsB;AAG/B,IAAAA,YAAmB,qBAAqB,mDAAqB;AAC9D,UAAM,cAA4B,CAAA;AAClC,gBAAY,KAAKA,YAAW,sBAAsB,CAAC,UAAoC;AACnF,YAAM,KAAK,MAAM;AACjB,YAAM,MAAM,SAAS,UAAU,GAAG,GAAG;AACrC,YAAM,WAAW,KAAK,eAAe,OAAO,KAAK,GAAG,YAAY,GAAG,SAAS,GAAG,IAAI;AAEnF,WAAK,iBAAiB,IAAI,KAAK,QAAQ;AACvC,YAAM,SAAS,OAAO,OAAO,EAAE,SAAQ,CAAE;AACzC,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,oBAAoB,KAAK,MAAM;IACxC,CAAC,CAAC;AACF,gBAAY,KAAKA,YAAW,wBAAwB,CAAC,UAAsC;AACvF,YAAM,KAAK,MAAM;AACjB,YAAM,UAAU,MAAM;AACtB,UAAI,QAAQ,WAAW,GAAG;AACtB;MACJ;AAEA,YAAM,EAAE,QAAO,IAAK;AACpB,UAAI,YAAY,QAAQ,YAAY,QAAW;AAC3C,cAAM,IAAI,MAAM,sCAAsC,GAAG,GAAG,mCAAmC;MACnG;AACA,YAAM,MAAM,SAAS,UAAU,GAAG,GAAG;AAErC,UAAI,iBAAiB,KAAK,iBAAiB,IAAI,GAAG;AAClD,UAAI,mBAAmB,QAAW;AAC9B,yBAAiB,KAAK,eAAe,OAAO,gBAAgB,SAAS,OAAO;AAC5E,aAAK,iBAAiB,IAAI,KAAK,cAAc;AAC7C,aAAK,oBAAoB,KAAK,OAAO,OAAO,EAAE,UAAU,eAAc,CAAE,CAAC;MAC7E;IACJ,CAAC,CAAC;AACF,gBAAY,KAAKA,YAAW,uBAAuB,CAAC,UAAqC;AACrF,YAAM,MAAM,SAAS,UAAU,MAAM,aAAa,GAAG;AACrD,YAAM,iBAAiB,KAAK,iBAAiB,IAAI,GAAG;AACpD,UAAI,mBAAmB,QAAW;AAC9B,aAAK,iBAAiB,OAAO,GAAG;AAChC,aAAK,YAAY,KAAK,OAAO,OAAO,EAAE,UAAU,eAAc,CAAE,CAAC;MACrE;IACJ,CAAC,CAAC;AACF,gBAAY,KAAKA,YAAW,uBAAuB,CAAC,UAAqC;AACrF,YAAM,iBAAiB,KAAK,iBAAiB,IAAI,SAAS,UAAU,MAAM,aAAa,GAAG,CAAC;AAC3F,UAAI,mBAAmB,QAAW;AAC9B,aAAK,YAAY,KAAK,OAAO,OAAO,EAAE,UAAU,gBAAgB,QAAQ,MAAM,OAAM,CAAE,CAAC;MAC3F;IACJ,CAAC,CAAC;AACF,gBAAY,KAAKA,YAAW,gCAAgC,CAAC,OAAmC,UAA4B;AACxH,YAAM,iBAAiB,KAAK,iBAAiB,IAAI,SAAS,UAAU,MAAM,aAAa,GAAG,CAAC;AAC3F,UAAI,mBAAmB,UAAa,KAAK,oBAAoB;AACzD,eAAO,KAAK,mBAAmB,OAAO,OAAO,EAAE,UAAU,gBAAgB,QAAQ,MAAM,OAAM,CAAE,GAAG,KAAK;MAC3G,OAAO;AACH,eAAO,CAAA;MACX;IACJ,CAAC,CAAC;AACF,gBAAY,KAAKA,YAAW,sBAAsB,CAAC,UAAoC;AACnF,YAAM,iBAAiB,KAAK,iBAAiB,IAAI,SAAS,UAAU,MAAM,aAAa,GAAG,CAAC;AAC3F,UAAI,mBAAmB,QAAW;AAC9B,aAAK,WAAW,KAAK,OAAO,OAAO,EAAE,UAAU,eAAc,CAAE,CAAC;MACpE;IACJ,CAAC,CAAC;AACF,WAAO,yCAAW,OAAO,MAAK;AAAG,kBAAY,QAAQ,gBAAc,WAAW,QAAO,CAAE;IAAG,CAAC;EAC/F;;AA2BE,IAAO,8BAAP,MAAkC;EAYpC,YAAY,8BAA8E;AAVzE,SAAA,oBAAoB,oBAAI,IAAG;AAC3B,SAAA,kBAAkB,oBAAI,IAAG;AAEzB,SAAA,aAAa,IAAI,sCAAO;AACxB,SAAA,aAAa,IAAI,sCAAO;AACxB,SAAA,eAAe,IAAI,sCAAO;AAC1B,SAAA,cAAc,IAAI,sCAAO;AAKtC,QAAI,YAAY,8BAA8B;AAC1C,WAAK,qBAAqB;IAC9B,OAAO;AACH,WAAK,qBAAqB,IAAI,wBAA2B,4BAA4B;IACzF;EACJ;EAEA,IAAI,oBAAiB;AACjB,WAAO,KAAK;EAChB;EAEA,oBAAoB,MAAkB;AAClC,WAAO,KAAK,mBAAmB,IAAI,KAAK,QAAQ;EACpD;EAEA,oBAAoB,KAAiB;AACjC,WAAO,KAAK,kBAAkB,IAAI,SAAS,UAAU,GAAG,CAAC;EAC7D;EAEA,gBAAgB,KAAiB;AAC7B,UAAM,QAAQ,KAAK,gBAAgB,IAAI,SAAS,UAAU,GAAG,CAAC;AAC9D,WAAO,SAAS,MAAM,CAAC;EAC3B;EAEA,4BAA4B,MAAiC;AACzD,UAAM,MAAM,OAAO,SAAS,YAAY,YAAY,OAAO,OAAO,KAAK;AACvE,UAAM,QAAQ,KAAK,gBAAgB,IAAI,SAAS,UAAU,GAAG,CAAC;AAC9D,WAAO,SAAS,MAAM,CAAC;EAC3B;EAEA,IAAI,YAAS;AACT,WAAO,KAAK,WAAW;EAC3B;EAEA,IAAI,YAAS;AACT,WAAO,KAAK,WAAW;EAC3B;EAEA,IAAI,cAAW;AACX,WAAO,KAAK,aAAa;EAC7B;EAEA,IAAI,aAAU;AACV,WAAO,KAAK,YAAY;EAC5B;;;;;;;;;;;;EAaA,OAAOA,aAAsB;AACzB,UAAM,6BAA6B,IAAI,2BAA0B;AACjE,UAAM,cAA4B,CAAA;AAElC,gBAAY,KAAK,KAAK,kBAAkB,OAAO,0BAA0B,CAAC;AAC1E,gBAAY,KAAKA,YAAW,UAAU,gBAAgB,0BAA0B,CAAC,WAAU;AACvF,YAAM,MAAM,SAAS,UAAU,OAAO,iBAAiB,GAAG;AAC1D,WAAK,kBAAkB,IAAI,KAAK,OAAO,gBAAgB;AACvD,iBAAW,oBAAoB,OAAO,mBAAmB;AACrD,mCAA2B,iBAAiB,EAAE,cAAc,iBAAgB,CAAE;MAClF;AACA,WAAK,cAAc,OAAO,gBAAgB;AAC1C,WAAK,WAAW,KAAK,OAAO,gBAAgB;IAChD,CAAC,CAAC;AACF,gBAAY,KAAKA,YAAW,UAAU,gBAAgB,4BAA4B,CAAC,WAAU;AACzF,YAAM,MAAM,SAAS,UAAU,OAAO,iBAAiB,GAAG;AAC1D,YAAM,mBAAmB,KAAK,kBAAkB,IAAI,GAAG;AACvD,UAAI,qBAAqB,QAAW;AAChC;MACJ;AACA,uBAAiB,UAAU,OAAO,iBAAiB;AACnD,YAAM,cAAc,iBAAiB;AACrC,UAAI,kBAA2B;AAC/B,YAAM,SAAS,OAAO;AACtB,UAAI,OAAO,aAAa,QAAW;AAC/B,0BAAkB;AAClB,yBAAiB,WAAW,OAAO;MACvC;AAEA,YAAM,SAAwB,CAAA;AAC9B,YAAM,SAAwB,CAAA;AAC9B,YAAM,OAA8F,CAAA;AACpG,YAAM,OAAsB,CAAA;AAC5B,UAAI,OAAO,UAAU,QAAW;AAC5B,cAAM,eAAe,OAAO;AAC5B,YAAI,aAAa,cAAc,QAAW;AACtC,gBAAM,QAAQ,aAAa,UAAU;AACrC,2BAAiB,MAAM,OAAO,MAAM,OAAO,MAAM,aAAa,GAAI,MAAM,UAAU,SAAY,MAAM,QAAQ,CAAA,CAAG;AAE/G,cAAI,aAAa,UAAU,YAAY,QAAW;AAC9C,uBAAW,QAAQ,aAAa,UAAU,SAAS;AAC/C,yCAA2B,iBAAiB,EAAE,cAAc,KAAI,CAAE;AAClE,qBAAO,KAAK,KAAK,GAAG;YACxB;UACJ;AAEA,cAAI,aAAa,UAAU,UAAU;AACjC,uBAAW,SAAS,aAAa,UAAU,UAAU;AACjD,yCAA2B,kBAAkB,EAAE,cAAc,MAAK,CAAE;AACpE,qBAAO,KAAK,MAAM,GAAG;YACzB;UACJ;QACJ;AACA,YAAI,aAAa,SAAS,QAAW;AACjC,gBAAM,cAAyC,IAAI,IAAI,aAAa,KAAK,IAAI,UAAQ,CAAC,KAAK,UAAU,IAAI,CAAC,CAAC;AAC3G,mBAAS,IAAI,GAAG,KAAK,iBAAiB,MAAM,QAAQ,KAAK;AACrD,kBAAMC,UAAS,YAAY,IAAI,iBAAiB,MAAM,CAAC,EAAE,QAAQ;AACjE,gBAAIA,YAAW,QAAW;AACtB,oBAAM,MAAM,iBAAiB,MAAM,OAAO,GAAG,GAAGA,OAAM;AACtD,mBAAK,KAAK,EAAE,KAAK,IAAI,CAAC,GAAG,KAAKA,QAAM,CAAE;AACtC,0BAAY,OAAOA,QAAO,QAAQ;AAClC,kBAAI,YAAY,SAAS,GAAG;AACxB;cACJ;YACJ;UACJ;QACJ;AACA,YAAI,aAAa,gBAAgB,QAAW;AACxC,qBAAW,oBAAoB,aAAa,aAAa;AACrD,uCAA2B,mBAAmB,EAAE,cAAc,iBAAiB,UAAU,gBAAgB,iBAAiB,QAAO,CAAE;AACnI,iBAAK,KAAK,iBAAiB,SAAS,GAAG;UAC3C;QACJ;MACJ;AAGA,WAAK,cAAc,gBAAgB;AAEnC,YAAM,cAA2C,EAAE,iBAAgB;AACnE,UAAI,iBAAiB;AACjB,oBAAY,WAAW,EAAE,KAAK,aAAa,KAAK,iBAAiB,SAAQ;MAC7E;AAEA,YAAM,QAAwB,CAAA;AAC9B,iBAAW,QAAQ,QAAQ;AACvB,cAAM,KAAK,KAAK,gBAAgB,IAAI,CAAE;MAC1C;AACA,YAAM,UAA0B,CAAA;AAChC,iBAAW,SAAS,QAAQ;AACxB,gBAAQ,KAAK,KAAK,gBAAgB,KAAK,CAAE;MAC7C;AACA,YAAM,cAA8B,CAAA;AACpC,iBAAWA,WAAU,MAAM;AACvB,oBAAY,KAAK,KAAK,gBAAgBA,OAAM,CAAE;MAClD;AACA,UAAI,MAAM,SAAS,KAAK,QAAQ,SAAS,KAAK,KAAK,SAAS,KAAK,YAAY,SAAS,GAAG;AACrF,oBAAY,QAAQ,EAAE,OAAO,SAAS,SAAS,EAAE,MAAM,YAAW,EAAE;MACxE;AACA,UAAI,YAAY,aAAa,UAAa,YAAY,UAAU,QAAW;AACvE,aAAK,aAAa,KAAK,WAAW;MACtC;IACJ,CAAC,CAAC;AACF,gBAAY,KAAKD,YAAW,UAAU,gBAAgB,0BAA0B,CAAC,WAAU;AACvF,YAAM,mBAAmB,KAAK,oBAAoB,OAAO,iBAAiB,GAAG;AAC7E,UAAI,qBAAqB,QAAW;AAChC;MACJ;AACA,WAAK,WAAW,KAAK,gBAAgB;IACzC,CAAC,CAAC;AACF,gBAAY,KAAKA,YAAW,UAAU,gBAAgB,2BAA2B,CAAC,WAAU;AACxF,YAAM,MAAM,SAAS,UAAU,OAAO,iBAAiB,GAAG;AAC1D,YAAM,mBAAmB,KAAK,kBAAkB,IAAI,GAAG;AACvD,UAAI,qBAAqB,QAAW;AAChC;MACJ;AACA,WAAK,YAAY,KAAK,gBAAgB;AACtC,iBAAW,oBAAoB,OAAO,mBAAmB;AACrD,mCAA2B,kBAAkB,EAAE,cAAc,iBAAgB,CAAE;MACnF;AACA,WAAK,kBAAkB,OAAO,GAAG;AACjC,iBAAW,QAAQ,iBAAiB,OAAO;AACvC,aAAK,gBAAgB,OAAO,KAAK,QAAQ;MAC7C;IACJ,CAAC,CAAC;AACF,WAAO,yCAAW,OAAO,MAAK;AAAG,kBAAY,QAAQ,gBAAc,WAAW,QAAO,CAAE;IAAG,CAAC;EAC/F;EAEQ,cAAc,kBAAkC;AACpD,eAAW,QAAQ,iBAAiB,OAAO;AACvC,WAAK,gBAAgB,IAAI,KAAK,UAAU,CAAC,MAAM,gBAAgB,CAAC;IACpE;EACJ;;AAGJ,IAAM,6BAAN,MAAM,4BAA0B;EAQ5B,sBAAsB,SAAuD;AACzE,SAAK,cAAc;AACnB,WAAO,yCAAW,OAAO,MAAK;AAAG,WAAK,cAAc;IAAW,CAAC;EACpE;EAEA,iBAAiB,QAAiC;AAC9C,SAAK,eAAe,KAAK,YAAY,MAAM;EAC/C;EAEA,wBAAwB,SAAyD;AAC7E,SAAK,gBAAgB;AACrB,WAAO,yCAAW,OAAO,MAAK;AAAG,WAAK,gBAAgB;IAAS,CAAC;EACpE;EAEA,mBAAmB,QAAmC;AAClD,SAAK,iBAAiB,KAAK,cAAc,MAAM;EACnD;EAEA,uBAAuB,SAAwD;AAC3E,SAAK,eAAe;AACpB,WAAO,yCAAW,OAAO,MAAK;AAAG,WAAK,eAAe;IAAW,CAAC;EACrE;EAEA,kBAAkB,QAAkC;AAChD,SAAK,gBAAgB,KAAK,aAAa,MAAM;EACjD;EAEA,yBAAsB;AAClB,WAAO,4BAA2B;EACtC;EAEA,kCAA+B;AAC3B,WAAO,4BAA2B;EACtC;EAEA,wBAAqB;AACjB,WAAO,4BAA2B;EACtC;;AA3CwB,2BAAA,eAAe,OAAO,OAAO,EAAE,SAAS,MAAK;AAAG,EAAC,CAAE;;;ACndzE,SAAU,oBAAoB,SAA6B;AAC7D,SAAO,OAAO,MACV,wBAAwB,OAAO,GAC/B,uBAAuB,OAAO,CAAC;AAEvC;AAMM,SAAU,uBAAuB,SAA6B;AAChE,SAAO;IACH,KAAK;MACD,oBAAoB,CAAC,aAAa,IAAI,0BAA0B,QAAQ;MACxE,wBAAwB,CAAC,aAAa,IAAI,8BAA8B,QAAQ;MAChF,eAAe,CAAC,aAAa,IAAI,8BAA8B,QAAQ;MACvE,sBAAsB,CAAC,aAAa,IAAI,4BAA4B,QAAQ;MAC5E,oBAAoB,CAAC,aAAa,IAAI,0BAA0B,QAAQ;MACxE,oBAAoB,CAAC,aAAa,IAAI,0BAA0B,QAAQ;MACxE,2BAA2B,CAAC,aAAa,IAAI,iCAAiC,QAAQ;MACtF,gBAAgB,CAAC,aAAa,IAAI,sBAAsB,QAAQ;;IAEpE,QAAQ,MAAM,QAAQ;;AAE9B;AAaM,SAAU,0BAA0B,SAAmC;AACzE,SAAO,OAAO,MACV,8BAA8B,OAAO,GACrC,6BAA6B,OAAO,CAAC;AAE7C;AAMM,SAAU,6BAA6B,SAAmC;AAC5E,SAAO;IACH,KAAK;MACD,YAAY,MAAM,QAAQ;MAC1B,gBAAgB,CAAC,aAAa,IAAI,sBAAsB,QAAQ;MAChE,uBAAuB,CAAC,aAAa,IAAI,6BAA6B,QAAQ;MAC9E,yBAAyB,CAAC,aAAa,IAAI,+BAA+B,QAAQ;MAClF,kBAAkB,MAAM,IAAI,wBAAuB;MACnD,cAAc,MAAM,IAAI,oBAAmB;;IAE/C,WAAW;MACP,eAAe,MAAM,IAAI,wBAAwBE,aAAY;MAC7D,mBAAmB,CAAC,aAAa,IAAI,4BAA4B,SAAS,UAAU,aAAa;;;AAG7G;;;AC7DM,IAAgB,oBAAhB,MAAiC;EAAvC,cAAA;AAEc,SAAA,YAAiC,MAAK;IAA+B;EA4cnF;;;;;;;;;;;;;;;;;;;EAxbc,iBAAoC,MAAO;AACjD,WAAO,IAAI,qBAAqB,MAAM,KAAK,SAAS;EACxD;EAEA,eAAe,UAA2B,QAAgC;AACtE,UAAM,KAAK,SAAS;AACpB,QAAI,GAAG,YAAY,WAAW,KAAK,GAAG,aAAa,WAAW,GAAG;AAE7D,aAAO,KAAK,iBAAiB,UAAU,OAAO,OAAO;IACzD,OAAO;AAEH,aAAO,CAAA;IACX;EACJ;;;;;;;;EASU,uBAAuB,UAA2B,OAAY;AACpE,UAAM,KAAK,SAAS;AACpB,QAAI,GAAG,YAAY,UAAU,GAAG,aAAa,QAAQ;AAEjD,YAAM,kBAAkB,KAAK,IACzB,GAAG,GAAG,YAAY,IAAI,OAAE;AA1FxC;AA0F2C,uBAAE,SAAF,YAAU,OAAO;OAAS,GACrD,GAAG,GAAG,aAAa,IAAI,OAAE;AA3FzC;AA2F4C,uBAAE,MAAM,cAAR,YAAqB,OAAO;OAAS,CAAC;AAGtE,aAAO,kBAAkB,MAAM,IAAI;IACvC,OAAO;AAEH,aAAO;IACX;EACJ;EAEA,oBAAoB,UAA2B,QAAqC;AAChF,QAAI,KAAK,uBAAuB,UAAU,OAAO,KAAK,GAAG;AACrD,aAAO,KAAK,iBAAiB,UAAU,OAAO,SAAS,OAAO,KAAK;IACvE,OAAO;AACH,aAAO,CAAA;IACX;EACJ;EAEA,qBAAqB,UAA2B,QAAsC;AAElF,UAAM,QAAQ;MACV,OAAO;QACH,WAAW;QACX,MAAM,OAAO,SAAS;;MAE1B,KAAK,OAAO;;AAGhB,QAAI,KAAK,uBAAuB,UAAU,KAAK,GAAG;AAC9C,aAAO,KAAK,iBAAiB,UAAU,OAAO,SAAS,KAAK;IAChE,OAAO;AACH,aAAO,CAAA;IACX;EACJ;EAEA,IAAI,sBAAmB;AACnB,WAAO;EACX;EAEU,iBAAiB,UAA2B,SAA4B,OAAa;AAC3F,UAAMC,OAAM,oBAAI,IAAG;AACnB,UAAM,YAAiC,CAAC,MAAM,MAAM,eAAc;AApI1E;AAqIY,YAAM,MAAM,KAAK,cAAc,MAAM,IAAI;AACzC,YAAM,WAAWA,KAAI,IAAI,GAAG;AAC5B,YAAM,YAAW,gBAAW,QAAQ,aAAnB,YAA+B;AAChD,YAAM,oBAAmB,0CAAU,QAAQ,aAAlB,YAA8B;AACvD,UAAI,CAAC,YAAY,oBAAoB,UAAU;AAC3C,QAAAA,KAAI,IAAI,KAAK,UAAU;MAC3B;IACJ;AACA,SAAK,YAAY;AAEjB,SAAK,qBAAqB,UAAU,KAAK;AACzC,UAAM,QAAQ,KAAK,qBAAqB,UAAUA,MAAK,SAAS,KAAK;AAErE,WAAO,KAAK,sBAAsB,SAAS,cAAc,KAAK;EAClE;EAEU,sBAAsB,cAA4B,WAAqB;AAC7E,UAAM,QAAoB,CAAA;AAC1B,eAAW,QAAQ,WAAW;AAC1B,UAAI,OAAO,MAAM,MAAM,SAAS,CAAC;AACjC,aAAO,MAAM;AACT,cAAM,eAAe,aAAa,SAAS,KAAK,MAAM,KAAK;AAC3D,cAAM,UAAU,aAAa,SAAS,KAAK,MAAM,GAAG;AACpD,YAAI,eAAe,SAAS;AACxB,gBAAM,IAAG;AACT,iBAAO,MAAM,MAAM,SAAS,CAAC;QACjC,OACK;AACD;QACJ;MACJ;AACA,YAAM,KAAK,IAAI;IACnB;AACA,WAAO,MAAM,OAAO,UAAQ,KAAK,YAAY,MAAM,YAAY,CAAC;EACpE;EAEU,qBAAqB,UAA2B,OAAa;AACnE,UAAMC,QAAO,SAAS,YAAY;AAClC,SAAK,OAAOA,KAAI;AAChB,UAAM,eAAe,kBAAkBA,KAAI,EAAE,SAAQ;AACrD,QAAI;AACJ,OAAG;AACC,eAAS,aAAa,KAAI;AAC1B,UAAI,CAAC,OAAO,MAAM;AACd,cAAM,OAAO,OAAO;AACpB,cAAM,SAAS,KAAK,YAAY,KAAK,SAAU,OAAO,KAAK;AAC3D,YAAI,QAAQ;AACR,eAAK,OAAO,IAAI;QACpB,OAAO;AACH,uBAAa,MAAK;QACtB;MACJ;IACJ,SAAS,CAAC,OAAO;EACrB;EAIU,cAAc,MAAe,MAA0B;AAC7D,WAAO,GAAG,KAAK,MAAM,IAAI,KAAK,GAAG,IAAI,IAAI;EAC7C;EAEU,YAAY,QAAe,OAAa;AAC9C,QAAI,CAAC,OAAO;AACR,aAAO;IACX;AACA,QAAK,OAAO,MAAM,QAAQ,MAAM,MAAM,QAAQ,OAAO,IAAI,QAAQ,MAAM,IAAI,QACtE,OAAO,MAAM,QAAQ,MAAM,MAAM,QAAQ,OAAO,IAAI,QAAQ,MAAM,IAAI,QACtE,OAAO,MAAM,QAAQ,MAAM,IAAI,QAAQ,OAAO,IAAI,QAAQ,MAAM,IAAI,MAAO;AAC5E,aAAO;IACX;AACA,WAAO;EACX;EAEU,YAAY,MAAgB,UAAsB;AACxD,WAAO,KAAK,YAAY,SAAS,QAAQ,KAAK,KAAK,EAAE,QAAQ,OAAO,EAAE;EAC1E;EAEU,qBAAqB,UAA2B,aAA4C,SAA4B,OAAa;AAC3I,UAAM,UAA6B;MAC/B,aAAa;MACb;MACA,UAAU,SAAS;;AAEvB,UAAM,QAAoB,CAAA;AAC1B,UAAM,gBAAgB,KAAK,eAAe,UAAU,OAAO;AAC3D,UAAM,WAAW,cAAc,SAAQ;AACvC,QAAI;AACJ,QAAI;AACJ,OAAG;AACC,eAAS,SAAS,KAAI;AACtB,UAAI,CAAC,OAAO,MAAM;AACd,cAAM,OAAO,OAAO;AACpB,cAAM,SAAS,cAAc,IAAI;AACjC,cAAM,aAAa,KAAK,cAAc,MAAM,SAAS;AACrD,cAAM,oBAAoB,YAAY,IAAI,UAAU;AACpD,oBAAY,OAAO,UAAU;AAC7B,YAAI,mBAAmB;AACnB,gBAAM,YAAY,KAAK,eAAe,UAAU,MAAM,mBAAmB,OAAO;AAChF,qBAAW,QAAQ,WAAW;AAC1B,gBAAI,QAAQ,KAAK,YAAY,KAAK,OAAO,KAAK,GAAG;AAC7C,oBAAM,KAAK,IAAI;YACnB;UACJ;QACJ;AACA,cAAM,YAAY,KAAK,cAAc,MAAM,QAAQ;AACnD,cAAM,mBAAmB,YAAY,IAAI,SAAS;AAClD,oBAAY,OAAO,SAAS;AAC5B,YAAI,kBAAkB;AAClB,gBAAM,WAAW,YAAY,IAAI;AACjC,cAAI,UAAU;AACV,kBAAM,YAAY,KAAK,eAAe,MAAM,UAAU,kBAAkB,OAAO;AAC/E,uBAAW,QAAQ,WAAW;AAC1B,kBAAI,QAAQ,KAAK,YAAY,KAAK,OAAO,KAAK,GAAG;AAC7C,sBAAM,KAAK,IAAI;cACnB;YACJ;UACJ;QACJ;AAEA,YAAI,CAAC,qBAAqB,KAAK,QAAQ;AACnC,gBAAM,cAAc,KAAK,sBAAsB,UAAU,MAAM,QAAW,OAAO;AACjF,qBAAW,QAAQ,aAAa;AAC5B,gBAAI,QAAQ,KAAK,YAAY,KAAK,OAAO,KAAK,GAAG;AAC7C,oBAAM,KAAK,IAAI;YACnB;UACJ;QACJ;AACA,YAAI,QAAQ;AACR,qBAAW;QACf;MACJ;IACJ,SAAS,CAAC,OAAO;AAEjB,WAAO;EACX;EAEU,sBAAsB,UAA+B,QAAiB,YAA0C,SAA0B;AA7QxJ;AA+QQ,UAAM,YAAY,OAAO,MAAM,MAAM;AACrC,QAAI,YAAY,SAAS,MAAM,IAAI,SAAS,WAAW;AACnD,aAAO,CAAA;IACX;AACA,UAAM,QAAoB,CAAA;AAE1B,UAAM,aAAoB;MACtB,OAAO;QACH,WAAW;QACX,MAAM;;MAEV,KAAK,OAAO,MAAM;;AAEtB,UAAM,kBAAkB,QAAQ,SAAS,QAAQ,UAAU;AAC3D,UAAM,OAAO,KAAK,gBAAgB,aAAY,8CAAY,UAAZ,YAAqB,CAAA,GAAI,OAAO;AAC9E,UAAM,kBAAkB,KAAK,qCAAqC,iBAAiB,OAAO;AAC1F,UAAM,oBAAoB,KAAK,6BAA6B,SAAS,IAAI;AAEzE,UAAM,oBAAoB,oBAAoB;AAE9C,QAAI,sBAAsB,GAAG;AACzB,aAAO,CAAA;IACX;AAEA,QAAI,UAAU;AACd,QAAI,oBAAoB,GAAG;AACvB,iBAAW,QAAQ,QAAQ,eAAe,MAAM,KAAM,OAAO,iBAAiB;IAClF;AAEA,UAAM,QAAQ,OAAO,KAAK,MAAM,IAAI;AACpC,UAAM,CAAC,IAAI,kBAAkB,MAAM,CAAC;AACpC,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,YAAM,cAAc,YAAY;AAChC,YAAM,MAAM;QACR,WAAW;QACX,MAAM;;AAEV,UAAI,oBAAoB,GAAG;AACvB,cAAM,KAAK;UACP;UACA,OAAO;YACH,OAAO;YACP,KAAK;;SAEZ;MACL,OAAO;AACH,cAAM,cAAc,MAAM,CAAC;AAC3B,YAAI,IAAI;AACR,eAAO,IAAI,YAAY,QAAQ,KAAK;AAChC,gBAAM,OAAO,YAAY,OAAO,CAAC;AACjC,cAAI,SAAS,OAAO,SAAS,KAAM;AAC/B;UACJ;QACJ;AACA,cAAM,KAAK;UACP,SAAS;UACT,OAAO;YACH,OAAO;YACP,KAAK;cACD,MAAM;;;;cAIN,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,iBAAiB,CAAC;;;SAG7D;MACL;IACJ;AAEA,WAAO;EACX;EAEU,qCAAqC,MAAc,SAA0B;AACnF,UAAM,gBAAgB,IAAI,OAAO,QAAQ,QAAQ,OAAO;AACxD,QAAI,cAAc;AAClB,QAAI;AACJ,QAAI,QAAQ,QAAQ,cAAc;AAC9B,cAAQ,IAAI,OAAO,OAAO,GAAG;AAC7B,oBAAc;IAClB,OAAO;AACH,cAAQ,IAAI,OAAO,eAAe,GAAG;AACrC,oBAAc;IAClB;AACA,UAAM,aAAa,KAAK,QAAQ,OAAO,WAAW;AAClD,WAAO,WAAW;EACtB;EAEU,6BAA6B,SAA4B,gBAA+B;AAC9F,QAAI,cAAc,QAAQ;AAC1B,QAAI,kBAAkB,eAAe,MAAM;AACvC,qBAAe,eAAe;IAClC;AACA,YAAQ,QAAQ,QAAQ,eAAe,QAAQ,QAAQ,UAAU,KAAK;EAC1E;EAEU,eAAeC,IAAwB,GAAY,YAA8B,SAA0B;AA/WzH;AAgXQ,QAAI,EAAE,QAAQ;AACV,aAAO,KAAK,sBAAsBA,IAAG,GAAG,YAAY,OAAO;IAC/D;AAEA,QAAIA,OAAMA,GAAE,MAAM,IAAI,OAAO,EAAE,MAAM,MAAM,QACtCA,GAAE,MAAM,IAAI,SAAS,EAAE,MAAM,MAAM,QAAQA,GAAE,MAAM,IAAI,YAAY,EAAE,MAAM,MAAM,YAAa;AAC/F,aAAO,CAAA;IACX;AACA,UAAM,eAAsB;MACxB,QAAO,KAAAA,MAAA,gBAAAA,GAAG,MAAM,QAAT,YAAgB;QACnB,WAAW;QACX,MAAM;;MAEV,KAAK,EAAE,MAAM;;AAEjB,UAAM,OAAO,KAAK,gBAAgB,cAAc,WAAW,OAAO,OAAO;AACzE,QAAI,CAAC,MAAM;AACP,aAAO,CAAA;IACX;AACA,UAAM,QAAQ,KAAK;AACnB,UAAM,QAAQ,KAAK;AACnB,UAAM,OAAO,KAAK;AAClB,UAAM,sBAAsB,QAAQ;AACpC,YAAQ,eAAgB,sBAAQ;AAChC,UAAM,QAAoB,CAAA;AAC1B,QAAI,UAAU,QAAW;AAErB,UAAI,EAACA,MAAA,gBAAAA,GAAG,SAAQ;AACZ,cAAM,KAAK,KAAK,oBAAoB,cAAc,OAAO,WAAW,OAAO,CAAC;MAChF;IACJ,WAAW,UAAU,QAAW;AAC5B,YAAM,KAAK,KAAK,mBAAmB,cAAc,OAAO,SAAS,WAAW,OAAO,CAAC;IACxF,WAAW,SAAS,QAAW;AAC3B,YAAM,KAAK,KAAK,kBAAkB,cAAc,QAAQA,EAAC,GAAG,OAAO,CAAC;IACxE;AACA,QAAI,cAAc,CAAC,GAAG;AAClB,cAAQ,cAAc;IAC1B;AACA,WAAO;EACX;EAEU,oBAAoB,OAAc,QAAgB,SAAgC;AACxF,QAAI,MAAM,MAAM,SAAS,MAAM,IAAI,MAAM;AACrC,YAAM,iBAAiB,MAAM,IAAI,YAAY,MAAM,MAAM;AACzD,eAAS,KAAK,eAAe,QAAQ,gBAAgB,OAAO;IAChE;AACA,UAAM,UAAU,IAAI,OAAO,MAAM;AACjC,WAAO;MACH;MACA;;EAER;EAEU,mBAAmB,OAAc,OAAe,SAA4B,SAAgC;AAClH,UAAM,gBAAgB,MAAM,IAAI,OAAO,MAAM,MAAM;AACnD,YAAQ,KAAK,eAAe,OAAO,eAAe,OAAO;AACzD,UAAM,SAAS,QAAQ,QAAQ,eAAe,IAAI,OAAO,QAAQ,QAAQ,OAAO,IAAI;AACpF,UAAM,aAAa,OAAO,OAAO,QAAQ,WAAW;AACpD,UAAM,UAAU,GAAG,KAAK,OAAO,KAAK,CAAC,GAAG,UAAU;AAClD,WAAO;MACH;MACA;;EAER;EAEU,kBAAkB,OAAc,aAAsB,SAA0B;AACtF,UAAM,SAAS,QAAQ,QAAQ,eAAe,IAAI,OAAO,QAAQ,QAAQ,OAAO,IAAI;AACpF,UAAM,aAAa,OAAO,OAAO,QAAQ,WAAW;AACpD,UAAM,eAAe,cAAc,IAAI;AACvC,UAAM,QAAQ,KAAK,IAAI,MAAM,IAAI,OAAO,MAAM,MAAM,MAAM,YAAY;AACtE,UAAM,UAAU,GAAG,KAAK,OAAO,KAAK,CAAC,GAAG,UAAU;AAClD,WAAO;MACH;MACA;;EAER;EAEU,eAAe,OAAe,UAAkB,SAAgC;AACtF,QAAI,QAAQ,WAAW;AACnB,cAAQ,KAAK,IAAI,UAAU,KAAK;IACpC,WAAW,QAAQ,WAAW;AAC1B,cAAQ,KAAK,IAAI,UAAU,KAAK;IACpC;AACA,WAAO;EACX;EAEU,gBAAgB,OAAc,OAAyB,UAA2B;AACxF,QAAI,MAAM,WAAW,GAAG;AACpB,aAAO;IACX,WAAW,MAAM,WAAW,GAAG;AAC3B,aAAO,MAAM,CAAC;IAClB;AAEA,UAAM,gBAAgB,MAAM,IAAI,OAAO,MAAM,MAAM;AAEnD,eAAW,QAAQ,OAAO;AACtB,UAAI,KAAK,UAAU,UAAa,iBAAiB,KAAK,OAAO;AACzD,eAAO;MACX,WAAW,KAAK,UAAU,UAAa,kBAAkB,GAAG;AACxD,eAAO;MACX;IACJ;AAGA,WAAO,MAAM,MAAM,SAAS,CAAC;EACjC;EAEU,eAAe,UAA2B,SAA0B;AAC1E,UAAMD,QAAO,SAAS,YAAY;AAClC,UAAM,UAAUA,MAAK;AACrB,QAAI,CAAC,SAAS;AACV,aAAO;IACX;AACA,WAAO,IAAI,eAAe,SAAS,UAAQ,KAAK,WAAW,MAAM,OAAO,CAAC;EAC7E;EAEU,WAAW,MAAe,SAA0B;AAC1D,QAAI,CAAC,mBAAmB,IAAI,GAAG;AAC3B,aAAO;IACX;AACA,UAAM,UAAU,QAAQ;AACxB,WAAO,IAAI,WACP,OAAO,EAAE,OAAO,EAAC,IACjB,CAAC,UAAS;AACN,UAAI,MAAM,QAAQ,KAAK,QAAQ,QAAQ;AACnC,eAAO,EAAE,MAAM,OAAO,OAAO,KAAK,QAAQ,MAAM,OAAO,EAAC;MAC5D,OAAO;AAEH,gBAAQ,cAAc;AACtB,eAAO;MACX;IACJ,CAAC;EAET;;AAkEE,IAAO,uBAAP,MAA2B;EAK7B,YAAY,SAAY,WAA8B;AAClD,SAAK,UAAU;AACf,SAAK,YAAY;EACrB;EAEA,KAAK,MAAa;AACd,WAAO,IAAI,iBAAiB,KAAK,WAAW,CAAC,KAAK,QAAQ,IAAI,CAAA,GAAI,KAAK,SAAS;EACpF;EAEA,SAAS,OAAgB;AACrB,UAAM,WAAsB,CAAA;AAC5B,eAAW,QAAQ,OAAO;AACtB,UAAI,KAAK,UAAU;AACf,iBAAS,KAAK,KAAK,QAAQ;MAC/B;IACJ;AACA,WAAO,IAAI,iBAAiB,UAAU,KAAK,SAAS;EACxD;EAEA,SAAS,SAAwB,OAAc;AAC3C,UAAM,UAAU,oBAAoB,KAAK,QAAQ,UAAU,SAAS,KAAK;AACzE,WAAO,IAAI,iBAAiB,UAAU,CAAC,OAAO,IAAI,CAAA,GAAI,KAAK,SAAS;EACxE;EAEA,cAAc,UAA8B;AACxC,UAAM,QAAmB,CAAA;AACzB,eAAW,WAAW,UAAU;AAC5B,YAAM,WAAW,qBAAqB,KAAK,QAAQ,UAAU,OAAO;AACpE,YAAM,KAAK,GAAG,QAAQ;IAC1B;AACA,WAAO,IAAI,iBAAiB,OAAO,KAAK,SAAS;EACrD;EAEA,QAAQ,SAAiB,OAAc;AACnC,UAAM,UAAU,mBAAmB,KAAK,QAAQ,UAAU,SAAS,KAAK;AACxE,WAAO,IAAI,iBAAiB,UAAU,CAAC,OAAO,IAAI,CAAA,GAAI,KAAK,SAAS;EACxE;EAEA,YAAY,UAAkB;AAC1B,UAAM,QAAmB,CAAA;AACzB,eAAW,WAAW,UAAU;AAC5B,YAAM,WAAW,oBAAoB,KAAK,QAAQ,UAAU,OAAO;AACnE,YAAM,KAAK,GAAG,QAAQ;IAC1B;AACA,WAAO,IAAI,iBAAiB,OAAO,KAAK,SAAS;EACrD;EAEA,IAAI,OAAgB;AAChB,WAAO,IAAI,iBAAiB,CAAC,GAAG,KAAK,GAAG,KAAK,SAAS;EAC1D;EAEA,SAAS,OAAyB,KAAqB;AACnD,UAAM,aAAa,MAAM;AACzB,UAAM,WAAW,IAAI;AACrB,QAAI,WAAW,WAAW,KAAK,SAAS,WAAW,GAAG;AAClD,aAAO,IAAI,iBAAiB,CAAA,GAAI,KAAK,SAAS;IAClD;AACA,QAAI,YAAY,WAAW,CAAC;AAC5B,QAAI,UAAU,SAAS,CAAC;AAExB,QAAI,UAAU,SAAS,QAAQ,QAAQ;AACnC,YAAM,eAAe;AACrB,kBAAY;AACZ,gBAAU;IACd;AAEA,WAAO,IAAI,iBAAiB,iBAAiB,WAAW,OAAO,GAAG,KAAK,SAAS;EACpF;;AASE,IAAO,mBAAP,MAAO,kBAAgB;EAKzB,YAAY,OAAkB,WAA8B;AACxD,SAAK,QAAQ;AACb,SAAK,YAAY;EACrB;;;;EAKA,QAAQ,YAA4B;AAChC,eAAW,QAAQ,KAAK,OAAO;AAC3B,WAAK,UAAU,MAAM,WAAW,UAAU;IAC9C;AACA,WAAO;EACX;;;;EAKA,OAAO,YAA4B;AAC/B,eAAW,QAAQ,KAAK,OAAO;AAC3B,WAAK,UAAU,MAAM,UAAU,UAAU;IAC7C;AACA,WAAO;EACX;;;;;EAMA,SAAS,YAA4B;AACjC,eAAW,QAAQ,KAAK,OAAO;AAC3B,WAAK,UAAU,MAAM,WAAW,UAAU;AAC1C,WAAK,UAAU,MAAM,UAAU,UAAU;IAC7C;AACA,WAAO;EACX;;;;;;;;EASA,MAAM,OAAgB,KAAY;AAC9B,WAAO,IAAI,kBAAiB,KAAK,MAAM,MAAM,OAAO,GAAG,GAAG,KAAK,SAAS;EAC5E;;AAiCE,IAAW;CAAjB,SAAiBE,aAAU;AAMvB,WAAgB,OAAO,aAA+B;AAClD,WAAO;MACH,SAAS,CAAA;MACT,OAAO,YAAY,QAAQ,OAAK,EAAE,KAAK,EAAE,KAAK,YAAY;;EAElE;AALgB,EAAAA,YAAA,MAAG;AAUnB,WAAgB,QAAQ,SAAiC;AACrD,WAAO,OAAO,GAAG,OAAO;EAC5B;AAFgB,EAAAA,YAAA,UAAO;AAOvB,WAAgB,SAAS,SAAiC;AACtD,WAAO,OAAO,GAAG,OAAO;EAC5B;AAFgB,EAAAA,YAAA,WAAQ;AASxB,WAAgB,OAAO,OAAe,SAAiC;AACnE,WAAO;MACH,SAAS,4BAAW,CAAA;MACpB,OAAO,CAAC;QACJ,YAAY;OACf;;EAET;AAPgB,EAAAA,YAAA,SAAM;AAYtB,WAAgB,QAAQ,SAAiC;AACrD,WAAO,SAAS,GAAG,OAAO;EAC9B;AAFgB,EAAAA,YAAA,UAAO;AAOvB,WAAgB,SAAS,OAAe,SAAiC;AACrE,WAAO;MACH,SAAS,4BAAW,CAAA;MACpB,OAAO,CAAC;QACJ,OAAO;OACV;;EAET;AAPgB,EAAAA,YAAA,WAAQ;AAYxB,WAAgB,OAAO,SAAiC;AACpD,WAAO;MACH,SAAS,4BAAW,CAAA;MACpB,OAAO,CAAC;QACJ,MAAM;QACN,OAAO;OACV;;EAET;AARgB,EAAAA,YAAA,SAAM;AAatB,WAAgB,SAAS,SAAiC;AACtD,WAAO;MACH,SAAS,4BAAW,CAAA;MACpB,OAAO,CAAC;QACJ,MAAM;OACT;;EAET;AAPgB,EAAAA,YAAA,WAAQ;AASxB,WAAS,aAAaD,IAAmB,GAAiB;AAjzB9D;AAkzBQ,UAAM,UAAS,KAAAA,GAAE,UAAF,YAAW;AAC1B,UAAM,UAAS,OAAE,UAAF,YAAW;AAC1B,UAAM,SAAQ,KAAAA,GAAE,SAAF,YAAU;AACxB,UAAM,SAAQ,OAAE,SAAF,YAAU;AACxB,UAAM,WAAU,KAAAA,GAAE,eAAF,YAAgB;AAChC,UAAM,WAAU,OAAE,eAAF,YAAgB;AAChC,QAAI,SAAS,QAAQ;AACjB,aAAO;IACX,WAAW,SAAS,QAAQ;AACxB,aAAO;IACX,WAAW,QAAQ,OAAO;AACtB,aAAO;IACX,WAAW,QAAQ,OAAO;AACtB,aAAO;IACX,WAAW,UAAU,SAAS;AAC1B,aAAO;IACX,WAAW,UAAU,SAAS;AAC1B,aAAO;IACX,OAAO;AACH,aAAO;IACX;EACJ;AACJ,GA5GiB,eAAA,aAAU,CAAA,EAAA;;;ACntB3B,SAAoB;AAId,IAAO,yBAAP,MAA6B;EAAnC,cAAA;AAEI,SAAA,WAA6B;EAmEjC;EAjEI,MAAM,KAAK,KAAQ;AACf,UAAME,QAAO,MAAS,YAAS,KAAK,IAAI,MAAM;AAC9C,WAAO;MACH,QAAQA,MAAK,OAAM;MACnB,aAAaA,MAAK,YAAW;MAC7B;;EAER;EAEA,SAAS,KAAQ;AACb,UAAMA,QAAU,YAAS,IAAI,MAAM;AACnC,WAAO;MACH,QAAQA,MAAK,OAAM;MACnB,aAAaA,MAAK,YAAW;MAC7B;;EAER;EAEA,OAAO,KAAQ;AACX,WAAO,IAAI,QAAQ,aAAU;AACzB,MAAG,QAAK,IAAI,QAAQ,SAAM;AACtB,gBAAQ,CAAC,GAAG;MAChB,CAAC;IACL,CAAC;EACL;EAEA,WAAW,KAAQ;AACf,WAAU,cAAW,IAAI,MAAM;EACnC;EAEA,WAAW,KAAQ;AACf,WAAU,YAAS,SAAS,IAAI,MAAM;EAC1C;EAEA,eAAe,KAAQ;AACnB,WAAU,gBAAa,IAAI,MAAM;EACrC;EAEA,SAAS,KAAQ;AACb,WAAU,YAAS,SAAS,IAAI,QAAQ,KAAK,QAAQ;EACzD;EAEA,aAAa,KAAQ;AACjB,WAAU,gBAAa,IAAI,QAAQ,KAAK,QAAQ;EACpD;EAEA,MAAM,cAAc,KAAQ;AACxB,UAAM,UAAU,MAAS,YAAS,QAAQ,IAAI,QAAQ,EAAE,eAAe,KAAI,CAAE;AAC7E,WAAO,QAAQ,IAAI,aAAW;MAC1B;;MACA,QAAQ,OAAO,OAAM;MACrB,aAAa,OAAO,YAAW;MAC/B,KAAK,SAAS,SAAS,KAAK,OAAO,IAAI;MACzC;EACN;EAEA,kBAAkB,KAAQ;AACtB,UAAM,UAAa,eAAY,IAAI,QAAQ,EAAE,eAAe,KAAI,CAAE;AAClE,WAAO,QAAQ,IAAI,aAAW;MAC1B;;MACA,QAAQ,OAAO,OAAM;MACrB,aAAa,OAAO,YAAW;MAC/B,KAAK,SAAS,SAAS,KAAK,OAAO,IAAI;MACzC;EACN;;AAGG,IAAM,iBAAiB;EAC1B,oBAAoB,MAAM,IAAI,uBAAsB;;;;AC7ExD,IAAAC,eAAmD;;;ACwB5C,IAAMC,mBAAkB;AAAA,EAC3B,OAAO;AACX;AAYO,IAAM,WAAW;AAAA,EACpB,OAAO;AAAA,EACP,MAAM;AACV;AAWO,IAAM,cAAc;AAAA,EACvB,OAAO;AAAA,EACP,UAAU;AACd;AAEO,SAAS,cAAc,MAAoC;AAC9D,SAAOC,YAAW,WAAW,MAAM,YAAY,KAAK;AACxD;AAUO,IAAM,SAAS;AAAA,EAClB,OAAO;AAAA,EACP,UAAU;AAAA,EACV,MAAM;AAAA,EACN,WAAW;AACf;AAEO,SAAS,SAAS,MAA+B;AACpD,SAAOA,YAAW,WAAW,MAAM,OAAO,KAAK;AACnD;AAUO,IAAM,UAAU;AAAA,EACnB,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AACV;AAaO,IAAM,qBAAqB;AAAA,EAC9B,OAAO;AAAA,EACP,UAAU;AAAA,EACV,MAAM;AACV;AAEO,SAAS,qBAAqB,MAA2C;AAC5E,SAAOC,YAAW,WAAW,MAAM,mBAAmB,KAAK;AAC/D;AAUO,IAAMC,QAAO;AAAA,EAChB,OAAO;AACX;AAEO,SAASC,QAAO,MAA6B;AAChD,SAAOC,YAAW,WAAW,MAAMF,MAAK,KAAK;AACjD;AAYO,IAAM,2BAAN,cAA+C,sBAAsB;AAAA,EAArE;AAAA;AACH,SAAkB,QAAQ;AAAA,MACtB,iBAAiB;AAAA,QACb,MAAMG,iBAAgB;AAAA,QACtB,YAAY,CACZ;AAAA,QACA,YAAY,CAAC;AAAA,MACjB;AAAA,MACA,UAAU;AAAA,QACN,MAAM,SAAS;AAAA,QACf,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAM,SAAS;AAAA,UACnB;AAAA,QACJ;AAAA,QACA,YAAY,CAACH,MAAK,KAAK;AAAA,MAC3B;AAAA,MACA,aAAa;AAAA,QACT,MAAM,YAAY;AAAA,QAClB,YAAY;AAAA,UACR,UAAU;AAAA,YACN,MAAM,YAAY;AAAA,YAClB,cAAc,CAAC;AAAA,YACf,UAAU;AAAA,UACd;AAAA,QACJ;AAAA,QACA,YAAY,CAAC;AAAA,MACjB;AAAA,MACA,QAAQ;AAAA,QACJ,MAAM,OAAO;AAAA,QACb,YAAY;AAAA,UACR,UAAU;AAAA,YACN,MAAM,OAAO;AAAA,YACb,cAAc,CAAC;AAAA,YACf,UAAU;AAAA,UACd;AAAA,UACA,MAAM;AAAA,YACF,MAAM,OAAO;AAAA,UACjB;AAAA,UACA,WAAW;AAAA,YACP,MAAM,OAAO;AAAA,YACb,eAAe,OAAO;AAAA,YACtB,UAAU;AAAA,UACd;AAAA,QACJ;AAAA,QACA,YAAY,CAACA,MAAK,KAAK;AAAA,MAC3B;AAAA,MACA,SAAS;AAAA,QACL,MAAM,QAAQ;AAAA,QACd,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAM,QAAQ;AAAA,YACd,cAAc;AAAA,YACd,UAAU;AAAA,UACd;AAAA,UACA,MAAM;AAAA,YACF,MAAM,QAAQ;AAAA,UAClB;AAAA,UACA,MAAM;AAAA,YACF,MAAM,QAAQ;AAAA,YACd,eAAeA,MAAK;AAAA,UACxB;AAAA,QACJ;AAAA,QACA,YAAY,CAAC;AAAA,MACjB;AAAA,MACA,oBAAoB;AAAA,QAChB,MAAM,mBAAmB;AAAA,QACzB,YAAY;AAAA,UACR,UAAU;AAAA,YACN,MAAM,mBAAmB;AAAA,YACzB,cAAc,CAAC;AAAA,YACf,UAAU;AAAA,UACd;AAAA,UACA,MAAM;AAAA,YACF,MAAM,mBAAmB;AAAA,UAC7B;AAAA,QACJ;AAAA,QACA,YAAY,CAACG,iBAAgB,KAAK;AAAA,MACtC;AAAA,MACA,MAAM;AAAA,QACF,MAAMH,MAAK;AAAA,QACX,YAAY,CACZ;AAAA,QACA,YAAY,CAACG,iBAAgB,KAAK;AAAA,MACtC;AAAA,IACJ;AAAA;AACJ;AAEO,IAAMD,cAAa,IAAI,yBAAyB;;;ACpOhD,IAAM,uBAAN,cAAmC,kBAAkB;AAAA,EAE9C,OAAO,MAAqB;AAClC,QAAQ,qBAAqB,IAAI,GAAG;AAChC,YAAM,YAAY,KAAK,iBAAiB,IAAI;AAC5C,YAAM,aAAa,UAAU,QAAQ,GAAG;AACxC,YAAM,cAAc,UAAU,QAAQ,GAAG;AACzC,gBAAU,SAAS,YAAY,WAAW,EAAE,QAAQ,WAAW,OAAO,CAAC;AACvE,kBAAY,QAAQ,WAAW,QAAQ,CAAC;AAAA,IAC5C,WAAe,SAAS,IAAI,GAAG;AAC3B,YAAM,YAAY,KAAK,iBAAiB,IAAI;AAC5C,YAAM,aAAa,UAAU,QAAQ,GAAG;AACxC,YAAM,cAAc,UAAU,QAAQ,GAAG;AACzC,gBAAU,SAAS,YAAY,WAAW,EAAE,QAAQ,WAAW,OAAO,CAAC;AACvE,kBAAY,QAAQ,WAAW,QAAQ,CAAC;AAAA,IAC5C,WAAe,cAAc,IAAI,GAAG;AAChC,YAAM,YAAY,KAAK,iBAAiB,IAAI;AAC5C,YAAM,QAAQ,UAAU,MAAM,GAAG,KAAK,QAAQ;AAC9C,YAAM,QAAQ,WAAW,SAAS,CAAC;AAAA,IACvC;AAAA,EACJ;AAEJ;;;ACnBO,IAAM,wBAAN,MAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ/B,iBAAiB,WAAwC,MAAsB;AAC3E,QAAI,SAAS;AACb,QAAI,qBAAqB,MAAM,GAAG;AAC9B,eAAU,qBAAqB,OAAO,UAAU,IAC1C,KAAK,iBAAiB,OAAO,YAAY,OAAO,IAAI,IAAI,OAAO;AAAA,IACzE;AACA,WAAO,SAAS,SAAS,MAAM,OAAO;AAAA,EAC1C;AAEJ;;;ACpBA;AAKO,IAAM,4BAAN,cAAwC,sBAAsB;AAAA,EAKjE,YAAY,UAA+B;AACvC,UAAM,QAAQ;AACd,SAAK,mBAAmB,SAAS,OAAO,UAAU;AAClD,SAAK,wBAAwB,SAAS,WAAW;AAAA,EACrD;AAAA,EAEA,MAAe,OAAO,UAA2B,QAA0D;AACvG,UAAM,UAAsC,CAAC;AAC7C,UAAM,WAAW,SAAS,YAAY,MAAM;AAC5C,QAAI,CAAC,SAAU,QAAO;AACtB,UAAM,SAAS,SAAS,aAAa,SAAS,OAAO,QAAQ;AAC7D,UAAM,WAAW,kBAAS,4BAA4B,UAAU,QAAQ,KAAK,cAAc,UAAU;AACrG,QAAI,CAAC,SAAU,QAAO;AACtB,UAAM,cAAc,KAAK,WAAW,iBAAiB,QAAQ;AAC7D,QAAI,CAAC,YAAY,OAAQ,QAAO;AAChC,eAAW,QAAQ,aAAa;AAC5B,UAAI,QAAQ,IAAI,EAAG,MAAK,OAAO,OAAO;AACtC,YAAM,WAAW,KAAK,gBAAgB,IAAI;AAC1C,UAAI,UAAU;AACV,cAAM,SAAS,SAAS,QAAQ,SAAS,OAAO,OAAO,OAAO;AAC9D,cAAM,MAAM,SAAS;AACrB,YAAI,KAAK;AACL,cAAI,QAAQ,GAAG,GAAG;AACd,oBAAQ,GAAG,EAAE,KAAK,MAAM;AAAA,UAC5B,OAAO;AACH,oBAAQ,GAAG,IAAI,CAAC,MAAM;AAAA,UAC1B;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,UAAM,aAAa,YAAY,CAAC;AAChC,eAAW,QAAQ,kBAAS,UAAU,UAAU,GAAG;AAC/C,YAAM,KAAK,KAAK,mBAAmB,IAAI;AACvC,UAAI,IAAI;AACJ,cAAM,UAAU,EAAE,WAAW,OAAO,oBAAoB,MAAM;AAC9D,aAAK,WAAW,eAAe,MAAM,OAAO,EAAE,QAAQ,eAAa;AAC/D,gBAAM,eAAe,KAAK,eAAe,SAAS;AAClD,gBAAM,OAAO,KAAK,qBAAqB,UAAU,WAAW,UAAU,QAAQ,KAAK;AACnF,cAAI,UAAU;AACd,cAAI,CAAC,KAAM,WAAU,OAAO;AAC5B,gBAAM,aAAa,SAAS,QAAQ,aAAa,OAAO,OAAO;AAC/D,cAAI,QAAQ,aAAa,GAAG,GAAG;AAC3B,oBAAQ,aAAa,GAAG,EAAE,KAAK,UAAU;AAAA,UAC7C,OAAO;AACH,oBAAQ,aAAa,GAAG,IAAI,CAAC,UAAU;AAAA,UAC3C;AAAA,QACJ,CAAC;AAAA,MACL;AAAA,IACJ;AACA,WAAO,EAAE,QAAQ;AAAA,EACrB;AAAA,EAEU,qBAAqB,KAAU,OAAuB;AAC5D,UAAM,aAAa,KAAK,iBAAiB,YAAY,GAAG;AACxD,QAAI,CAAC,YAAY;AACb,aAAO;AAAA,IACX;AACA,UAAM,YAAY,WAAW,aAAa,QAAQ,KAAK;AACvD,WAAO,UAAU,SAAS,KAAK,CAAC;AAAA,EACpC;AAAA,EAEA,eAAe,KAAqC;AAChD,WAAO,SAAS;AAAA,MACZ,IAAI,UAAU,SAAS;AAAA,MACvB,IAAI,QAAQ;AAAA,IAChB;AAAA,EACJ;AAAA,EAEA,gBAAgB,YAA2C;AACvD,UAAM,WAAW,KAAK,aAAa,YAAY,UAAU;AACzD,QAAI,UAAU;AACV,YAAM,MAAM,kBAAS,YAAY,UAAU;AAC3C,aAAO,SAAS;AAAA,QACZ,IAAI,IAAI,SAAS;AAAA,QACjB,kBAAS,kBAAkB,QAAQ,EAAE;AAAA,MACzC;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EAEU,mBAAmB,MAAmC;AAC5D,QAAI,KAAK,UAAU,UAAW,QAAO;AACrC,QAAI,OAAO,KAAK,aAAa,QAAQ,IAAI;AACzC,QAAI,MAAM;AACN,UAAI,qBAAqB,KAAK,UAAU,GAAG;AACvC,eAAO,KAAK,sBAAsB,iBAAiB,KAAK,YAAY,IAAI;AAAA,MAC5E;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;;;ACjGO,IAAM,8BAAN,cAA0C,wBAAwB;AAAA,EAIrE,YAAY,UAA+B;AACvC,UAAM,QAAQ;AACd,SAAK,wBAAwB,SAAS,WAAW;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAe,uBAAuB,UAA2B,cAAc,qBAAa,kBAAkB,MAAqC;AAC/I,UAAM,QAA8B,CAAC;AACrC,eAAW,aAAa,kBAAS,kBAAkB,SAAS,YAAY,KAAK,GAAG;AAC5E,YAAM,kBAAkB,WAAW;AACnC,UAAIE,QAAO,SAAS,GAAG;AACnB,YAAI,OAAO,KAAK,aAAa,QAAQ,SAAS;AAC9C,YAAI,MAAM;AACN,cAAI,qBAAqB,UAAU,UAAU,GAAG;AAC5C,mBAAO,KAAK,sBAAsB,iBAAiB,UAAU,YAAkC,IAAI;AAAA,UACvG;AACA,gBAAM,KAAK,KAAK,aAAa,kBAAkB,WAAW,MAAM,QAAQ,CAAC;AAAA,QAC7E;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EAEA,MAAe,oBAAoB,UAAwC,cAAc,qBAAa,kBAAkB,MAA6B;AACjJ,UAAM,QAAQ,SAAS,YAAY;AACnC,UAAM,UAAU,IAAI,SAAsC;AAC1D,UAAM,KAAK,iBAAiB,OAAO,SAAS,UAAU,WAAW;AACjE,WAAO;AAAA,EACX;AAAA,EAEA,MAAgB,iBAAiB,WAA6C,SAAgD,UAA2B,aAA4E;AACjO,UAAM,oBAA0C,CAAC;AACjD,eAAW,WAAW,UAAU,UAAU;AACtC,YAAM,kBAAkB,WAAW;AACnC,UAAIA,QAAO,OAAO,KAAK,QAAQ,MAAM;AACjC,cAAM,cAAc,KAAK,aAAa,kBAAkB,SAAS,QAAQ,MAAM,QAAQ;AACvF,0BAAkB,KAAK,WAAW;AAAA,MACtC,WAAW,qBAAqB,OAAO,GAAG;AACtC,cAAM,qBAAqB,MAAM,KAAK,iBAAiB,SAAS,SAAS,UAAU,WAAW;AAC9F,mBAAW,eAAe,oBAAoB;AAE1C,gBAAM,YAAY,KAAK,2BAA2B,SAAS,aAAa,QAAQ;AAChF,4BAAkB,KAAK,SAAS;AAAA,QACpC;AAAA,MACJ;AAAA,IACJ;AACA,YAAQ,OAAO,WAAW,iBAAiB;AAC3C,WAAO;AAAA,EACX;AAAA,EAEU,2BAA2B,MAA0B,aAAiC,UAA+C;AAC3I,UAAM,OAAO,KAAK,sBAAsB,iBAAiB,KAAK,MAAM,YAAY,IAAI;AACpF,WAAO,KAAK,aAAa,kBAAkB,YAAY,MAAO,MAAM,QAAQ;AAAA,EAChF;AAEJ;;;AChEO,SAAS,yBAAyB,UAA+B;AACpE,QAAM,WAAW,SAAS,WAAW;AACrC,QAAM,YAAY,SAAS,WAAW;AACtC,QAAM,SAA+C;AAAA,IACjD,MAAM,UAAU;AAAA,EACpB;AACA,WAAS,SAAS,QAAQ,SAAS;AACvC;AAEO,IAAM,uBAAN,MAA2B;AAAA,EAE9B,2BAA2B,MAAY,QAAkC;AACrE,QAAI,KAAK,MAAM;AACX,YAAM,YAAY,KAAK,KAAK,UAAU,GAAG,CAAC;AAC1C,UAAI,UAAU,YAAY,MAAM,WAAW;AACvC,eAAO,WAAW,0CAA0C,EAAE,MAAM,MAAM,UAAU,OAAO,CAAC;AAAA,MAChG;AAAA,IACJ;AAAA,EACJ;AAEJ;;;ACtBA,IAAI;AACG,IAAM,qBAAqB,MAAe,8DAA6B,2BAA2B,oBAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwX3H;;;ACxXK,IAAM,8BAA8B;AAAA,EACvC,YAAY;AAAA,EACZ,gBAAgB,CAAC,SAAS;AAAA,EAC1B,iBAAiB;AAAA,EACjB,MAAM;AACV;AAEO,IAAM,eAA8B;AAAA,EACvC,iBAAiB;AAAA,EACjB,sBAAsB;AAAA,EACtB,cAAc;AAClB;AAEO,IAAM,mCAA0G;AAAA,EACnH,eAAe,MAAM,IAAI,yBAAyB;AACtD;AAEO,IAAM,6BAAwF;AAAA,EACjG,SAAS,MAAM,mBAAmB;AAAA,EAClC,kBAAkB,MAAM;AAAA,EACxB,QAAQ;AAAA,IACJ,cAAc,MAAM;AAAA,EACxB;AACJ;;;ACLO,IAAM,oBAAoG;AAAA,EAC7G,YAAY;AAAA,IACR,kBAAkB,CAAC,aAAa,IAAI,4BAA4B,QAAQ;AAAA,IACxE,uBAAuB,MAAM,IAAI,sBAAsB;AAAA,EAC3D;AAAA,EACA,YAAY;AAAA,IACR,sBAAsB,MAAM,IAAI,qBAAqB;AAAA,EACzD;AAAA,EACA,KAAK;AAAA,IACD,WAAW,MAAM,IAAI,qBAAqB;AAAA,IAC1C,gBAAgB,CAAC,aAAa,IAAI,0BAA0B,QAAQ;AAAA,EACxE;AACJ;AAEO,SAAS,0BAA0B,SAGxC;AACE,QAAMC,UAAS;AAAA,IACX,0BAA0B,OAAO;AAAA,IACjC;AAAA,EACJ;AACA,QAAM,cAAc;AAAA,IAChB,oBAAoB,EAAE,QAAAA,QAAO,CAAC;AAAA,IAC9B;AAAA,IACA;AAAA,EACJ;AACA,EAAAA,QAAO,gBAAgB,SAAS,WAAW;AAC3C,2BAAyB,WAAW;AACpC,MAAI,CAAC,QAAQ,YAAY;AAGrB,IAAAA,QAAO,UAAU,sBAAsB,YAAY,CAAC,CAAC;AAAA,EACzD;AACA,SAAO,EAAE,QAAAA,SAAQ,YAAY;AACjC;;;ATnDA,IAAM,iBAAa,+BAAiB,8BAAiB,GAAG;AACxD,IAAM,EAAE,OAAO,IAAI,0BAA0B,iBAAE,cAAe,eAAgB;AAC9E,oBAAoB,MAAM;",
  "names": ["exports", "exports", "o", "ErrorCodes", "ResponseError", "Message", "exports", "Touch", "_a", "exports", "Disposable", "exports", "RAL", "exports", "Event", "Emitter", "exports", "o", "Is", "CancellationToken", "CancellationTokenSource", "exports", "CancellationState", "exports", "exports", "o", "Is", "MessageReader", "ResolvedMessageReaderOptions", "exports", "o", "Is", "MessageWriter", "ResolvedMessageWriterOptions", "exports", "result", "exports", "o", "Is", "CancelNotification", "ProgressToken", "ProgressNotification", "StarRequestHandler", "Trace", "TraceValue", "toString", "TraceFormat", "SetTraceNotification", "LogTraceNotification", "ConnectionErrors", "ConnectionStrategy", "IdCancellationReceiverStrategy", "RequestCancellationReceiverStrategy", "CancellationReceiverStrategy", "_", "CancellationSenderStrategy", "CancellationStrategy", "MessageStrategy", "ConnectionOptions", "ConnectionState", "timer", "_a", "startTime", "connection", "first", "id", "exports", "DocumentUri", "URI", "integer", "uinteger", "Position", "Range", "Location", "LocationLink", "Color", "ColorInformation", "ColorPresentation", "FoldingRangeKind", "FoldingRange", "DiagnosticRelatedInformation", "DiagnosticSeverity", "DiagnosticTag", "CodeDescription", "Diagnostic", "Command", "TextEdit", "ChangeAnnotation", "ChangeAnnotationIdentifier", "AnnotatedTextEdit", "TextDocumentEdit", "CreateFile", "RenameFile", "DeleteFile", "WorkspaceEdit", "SnippetTextEdit", "TextDocumentIdentifier", "VersionedTextDocumentIdentifier", "OptionalVersionedTextDocumentIdentifier", "LanguageKind", "TextDocumentItem", "MarkupKind", "MarkupContent", "CompletionItemKind", "InsertTextFormat", "CompletionItemTag", "InsertReplaceEdit", "InsertTextMode", "ApplyKind", "CompletionItemLabelDetails", "CompletionItem", "CompletionList", "MarkedString", "Hover", "ParameterInformation", "SignatureInformation", "DocumentHighlightKind", "DocumentHighlight", "SymbolKind", "SymbolTag", "SymbolInformation", "WorkspaceSymbol", "DocumentSymbol", "CodeActionKind", "CodeActionTriggerKind", "CodeActionContext", "CodeActionTag", "CodeAction", "CodeLens", "FormattingOptions", "DocumentLink", "SelectionRange", "SemanticTokenTypes", "SemanticTokenModifiers", "SemanticTokens", "InlineValueText", "InlineValueVariableLookup", "InlineValueEvaluatableExpression", "InlineValueContext", "InlayHintKind", "InlayHintLabelPart", "InlayHint", "StringValue", "InlineCompletionItem", "InlineCompletionList", "InlineCompletionTriggerKind", "SelectedCompletionInfo", "InlineCompletionContext", "WorkspaceFolder", "TextDocument", "mergeSort", "a", "Is", "toString", "undefined", "min", "require_messages", "exports", "MessageDirection", "CM", "require_is", "exports", "exports", "ImplementationRequest", "exports", "TypeDefinitionRequest", "exports", "WorkspaceFoldersRequest", "DidChangeWorkspaceFoldersNotification", "exports", "ConfigurationRequest", "exports", "DocumentColorRequest", "ColorPresentationRequest", "exports", "FoldingRangeRequest", "FoldingRangeRefreshRequest", "exports", "DeclarationRequest", "exports", "SelectionRangeRequest", "exports", "WorkDoneProgress", "WorkDoneProgressCreateRequest", "WorkDoneProgressCancelNotification", "exports", "CallHierarchyPrepareRequest", "CallHierarchyIncomingCallsRequest", "CallHierarchyOutgoingCallsRequest", "exports", "TokenFormat", "SemanticTokensRegistrationType", "SemanticTokensRequest", "SemanticTokensDeltaRequest", "SemanticTokensRangeRequest", "SemanticTokensRefreshRequest", "exports", "ShowDocumentRequest", "exports", "LinkedEditingRangeRequest", "exports", "FileOperationPatternKind", "WillCreateFilesRequest", "DidCreateFilesNotification", "WillRenameFilesRequest", "DidRenameFilesNotification", "DidDeleteFilesNotification", "WillDeleteFilesRequest", "exports", "UniquenessLevel", "MonikerKind", "MonikerRequest", "exports", "TypeHierarchyPrepareRequest", "TypeHierarchySupertypesRequest", "TypeHierarchySubtypesRequest", "exports", "InlineValueRequest", "InlineValueRefreshRequest", "exports", "InlayHintRequest", "InlayHintResolveRequest", "InlayHintRefreshRequest", "exports", "o", "Is", "DiagnosticServerCancellationData", "DocumentDiagnosticReportKind", "DocumentDiagnosticRequest", "WorkspaceDiagnosticRequest", "DiagnosticRefreshRequest", "exports", "o", "Is", "NotebookCellKind", "ExecutionSummary", "NotebookCell", "NotebookDocument", "NotebookDocumentSyncRegistrationType", "DidOpenNotebookDocumentNotification", "NotebookCellArrayChange", "DidChangeNotebookDocumentNotification", "DidSaveNotebookDocumentNotification", "DidCloseNotebookDocumentNotification", "exports", "InlineCompletionRequest", "exports", "TextDocumentContentRequest", "TextDocumentContentRefreshRequest", "exports", "o", "Is", "TextDocumentFilter", "NotebookDocumentFilter", "NotebookCellTextDocumentFilter", "DocumentSelector", "RegistrationRequest", "UnregistrationRequest", "ResourceOperationKind", "FailureHandlingKind", "RegularExpressionEngineKind", "PositionEncodingKind", "StaticRegistrationOptions", "TextDocumentRegistrationOptions", "WorkDoneProgressOptions", "InitializeRequest", "InitializeErrorCodes", "InitializedNotification", "ShutdownRequest", "ExitNotification", "DidChangeConfigurationNotification", "MessageType", "ShowMessageNotification", "ShowMessageRequest", "LogMessageNotification", "TelemetryEventNotification", "TextDocumentSyncKind", "DidOpenTextDocumentNotification", "TextDocumentContentChangeEvent", "DidChangeTextDocumentNotification", "DidCloseTextDocumentNotification", "DidSaveTextDocumentNotification", "TextDocumentSaveReason", "WillSaveTextDocumentNotification", "WillSaveTextDocumentWaitUntilRequest", "DidChangeWatchedFilesNotification", "FileChangeType", "RelativePattern", "GlobPattern", "WatchKind", "PublishDiagnosticsNotification", "CompletionTriggerKind", "CompletionRequest", "CompletionResolveRequest", "HoverRequest", "SignatureHelpTriggerKind", "SignatureHelpRequest", "DefinitionRequest", "ReferencesRequest", "DocumentHighlightRequest", "DocumentSymbolRequest", "CodeActionRequest", "CodeActionResolveRequest", "WorkspaceSymbolRequest", "WorkspaceSymbolResolveRequest", "CodeLensRequest", "CodeLensResolveRequest", "CodeLensRefreshRequest", "DocumentLinkRequest", "DocumentLinkResolveRequest", "DocumentFormattingRequest", "DocumentRangeFormattingRequest", "DocumentRangesFormattingRequest", "DocumentOnTypeFormattingRequest", "PrepareSupportDefaultBehavior", "RenameRequest", "PrepareRenameRequest", "ExecuteCommandRequest", "ApplyWorkspaceEditRequest", "require_connection", "exports", "require_api", "exports", "LSPErrorCodes", "exports", "a", "exports", "exports", "exports", "connection", "exports", "CellTextDocumentConnection", "connection", "change", "require_is", "exports", "exports", "exports", "connection", "ResultProgress", "exports", "o", "Is", "exports", "exports", "exports", "exports", "exports", "exports", "exports", "exports", "exports", "exports", "exports", "exports", "o", "createConnection", "Is", "connection", "BulkRegistration", "BulkUnregistration", "one", "two", "result", "require_api", "exports", "o", "ProposedFeatures", "exports", "o", "fs", "first", "resolve", "message", "FileSystem", "exports", "stream", "RIL", "exports", "o", "fs", "process", "require_main", "exports", "require_main", "exports", "o", "createConnection", "Is", "Files", "stream", "root", "Reduction", "a", "min", "RangeComparison", "a", "property", "root", "reflection", "_", "newState", "atom", "process", "property", "first", "option", "assertPath", "path", "TypeError", "JSON", "stringify", "normalizeStringPosix", "allowAboveRoot", "code", "res", "lastSegmentLength", "lastSlash", "dots", "i", "length", "charCodeAt", "lastSlashIndex", "lastIndexOf", "slice", "posix", "resolve", "cwd", "resolvedPath", "resolvedAbsolute", "arguments", "process", "normalize", "isAbsolute", "trailingSeparator", "join", "joined", "arg", "relative", "from", "to", "fromStart", "fromEnd", "fromLen", "toStart", "toLen", "lastCommonSep", "fromCode", "out", "_makeLong", "dirname", "hasRoot", "end", "matchedSlash", "basename", "ext", "start", "extIdx", "firstNonSlashEnd", "extname", "startDot", "startPart", "preDotState", "format", "pathObject", "sep", "dir", "root", "base", "name", "parse", "ret", "delimiter", "win32", "module", "exports", "__webpack_module_cache__", "__webpack_require__", "moduleId", "cachedModule", "__webpack_modules__", "d", "definition", "key", "o", "Object", "defineProperty", "enumerable", "get", "obj", "prop", "prototype", "hasOwnProperty", "call", "r", "Symbol", "toStringTag", "value", "isWindows", "platform", "navigator", "userAgent", "indexOf", "_schemePattern", "_singleSlashStart", "_doubleSlashStart", "_validateUri", "_strict", "scheme", "Error", "authority", "query", "fragment", "test", "_empty", "_slash", "_regexp", "URI", "schemeOrData", "this", "thing", "fsPath", "with", "toString", "uriToFsPath", "change", "Uri", "match", "exec", "percentDecode", "replace", "idx", "substring", "components", "result", "skipEncoding", "_asFormatted", "toJSON", "data", "_formatted", "external", "_fsPath", "_sep", "_pathSepMarker", "$mid", "encodeTable", "encodeURIComponentFast", "uriComponent", "isPath", "isAuthority", "nativeEncodePos", "pos", "encodeURIComponent", "charAt", "substr", "escaped", "encodeURIComponentMinimal", "uri", "keepDriveLetterCasing", "toLowerCase", "encoder", "userinfo", "String", "fromCharCode", "decodeURIComponentGraceful", "str", "decodeURIComponent", "e", "_rEncodedAsHex", "posixPath", "slash", "Utils", "t", "joinPath", "paths", "resolvePath", "slashAdded", "UriUtils", "a", "URI", "import_vscode_languageserver", "visitor", "atom", "map", "LexerDefinitionErrorType", "msg", "currConfig", "tokenLabel", "hasTokenLabel", "hasTokenLabel", "hasTokenLabel", "tokenLabel", "getExtraProductionArgument", "PROD_TYPE", "tokenMatcher", "keys", "prefixKeys", "visitor", "collectorVisitor", "option", "alternation", "resolveGrammar", "validateGrammar", "alternation", "repetition", "option", "repetitionMandatory", "CstVisitorDefinitionError", "newState", "allTokenTypes", "newState", "ParserDefinitionErrorType", "resolveGrammar", "validateGrammar", "Symbol", "objectProto", "nativeObjectToString", "symToStringTag", "funcProto", "objectProto", "funcToString", "hasOwnProperty", "Map", "objectProto", "hasOwnProperty", "objectProto", "hasOwnProperty", "HASH_UNDEFINED", "map", "HASH_UNDEFINED", "othValue", "Uint8Array", "map", "COMPARE_PARTIAL_FLAG", "COMPARE_UNORDERED_FLAG", "objectProto", "objectProto", "hasOwnProperty", "propertyIsEnumerable", "Buffer", "MAX_SAFE_INTEGER", "argsTag", "boolTag", "dateTag", "errorTag", "funcTag", "mapTag", "numberTag", "regexpTag", "setTag", "stringTag", "arrayBufferTag", "dataViewTag", "freeExports", "freeModule", "moduleExports", "objectProto", "hasOwnProperty", "isType", "objectProto", "objectProto", "hasOwnProperty", "COMPARE_PARTIAL_FLAG", "objectProto", "hasOwnProperty", "Promise", "Set", "mapTag", "objectTag", "setTag", "weakMapTag", "dataViewTag", "COMPARE_PARTIAL_FLAG", "argsTag", "arrayTag", "objectTag", "objectProto", "hasOwnProperty", "COMPARE_PARTIAL_FLAG", "COMPARE_UNORDERED_FLAG", "symbolTag", "symbolProto", "toString", "INFINITY", "COMPARE_PARTIAL_FLAG", "COMPARE_UNORDERED_FLAG", "collection", "collection", "repetition", "alternation", "option", "block", "plus", "star", "optional", "getProdType", "first", "a", "INFINITY", "LARGE_ARRAY_SIZE", "mapTag", "setTag", "objectProto", "hasOwnProperty", "collection", "map", "closure", "newState", "tokenLabel", "getProductionDslName", "map", "token", "a", "ValueConverter", "FullTextDocument", "TextDocument", "a", "DocumentState", "URI", "TextDocument", "property", "a", "exports", "root", "property", "node", "documentUri", "URI", "document", "services", "Module", "module", "_", "first", "option", "URI", "import_vscode_languageserver_protocol", "root", "Disposable", "shared", "URI", "property", "import_vscode_languageserver_protocol", "stat", "_a", "exports", "URI", "ValidationCategory", "DocumentValidator", "import_vscode_languageserver", "import_vscode_languageserver", "connection", "URI", "import_vscode_languageserver", "root", "node", "import_vscode_languageserver_protocol", "import_vscode_languageserver", "option", "SemanticTokensDecoder", "option", "_a", "_b", "connection", "params", "WorkspaceState", "_", "services", "URI", "import_vscode_languageserver", "import_vscode_languageserver", "import_vscode_languageserver", "connection", "change", "TextDocument", "map", "root", "a", "Formatting", "stat", "import_node", "AbstractElement", "reflection", "reflection", "Type", "isType", "reflection", "AbstractElement", "isType", "shared"]
}