@pinkpixel/marzipan 1.1.0 → 1.1.2

package/dist/treemap-GDKQZRPO-rbQo3Em-.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"treemap-GDKQZRPO-rbQo3Em-.js","sources":["../node_modules/lodash-es/assign.js","../node_modules/lodash-es/_baseSlice.js","../node_modules/lodash-es/compact.js","../node_modules/lodash-es/_arrayAggregator.js","../node_modules/lodash-es/_baseAggregator.js","../node_modules/lodash-es/_createAggregator.js","../node_modules/lodash-es/_baseDifference.js","../node_modules/lodash-es/difference.js","../node_modules/lodash-es/drop.js","../node_modules/lodash-es/dropRight.js","../node_modules/lodash-es/_arrayEvery.js","../node_modules/lodash-es/_baseEvery.js","../node_modules/lodash-es/every.js","../node_modules/lodash-es/head.js","../node_modules/lodash-es/flatMap.js","../node_modules/lodash-es/groupBy.js","../node_modules/lodash-es/isString.js","../node_modules/lodash-es/includes.js","../node_modules/lodash-es/indexOf.js","../node_modules/lodash-es/_baseIsRegExp.js","../node_modules/lodash-es/isRegExp.js","../node_modules/lodash-es/negate.js","../node_modules/lodash-es/pickBy.js","../node_modules/lodash-es/reject.js","../node_modules/lodash-es/_baseSome.js","../node_modules/lodash-es/some.js","../node_modules/lodash-es/uniq.js","../node_modules/lodash-es/uniqBy.js","../node_modules/langium/lib/syntax-tree.js","../node_modules/langium/lib/utils/stream.js","../node_modules/langium/lib/utils/ast-utils.js","../node_modules/langium/lib/languages/generated/ast.js","../node_modules/langium/lib/utils/cst-utils.js","../node_modules/langium/lib/utils/errors.js","../node_modules/@chevrotain/regexp-to-ast/lib/src/utils.js","../node_modules/@chevrotain/regexp-to-ast/lib/src/character-classes.js","../node_modules/@chevrotain/regexp-to-ast/lib/src/regexp-parser.js","../node_modules/@chevrotain/regexp-to-ast/lib/src/base-regexp-visitor.js","../node_modules/langium/lib/utils/regexp-utils.js","../node_modules/langium/lib/utils/grammar-utils.js","../node_modules/langium/lib/languages/grammar-config.js","../node_modules/@chevrotain/utils/lib/src/print.js","../node_modules/@chevrotain/utils/lib/src/timer.js","../node_modules/@chevrotain/utils/lib/src/to-fast-properties.js","../node_modules/@chevrotain/gast/lib/src/model.js","../node_modules/@chevrotain/gast/lib/src/visitor.js","../node_modules/@chevrotain/gast/lib/src/helpers.js","../node_modules/chevrotain/lib/src/parse/grammar/rest.js","../node_modules/chevrotain/lib/src/parse/grammar/first.js","../node_modules/chevrotain/lib/src/parse/constants.js","../node_modules/chevrotain/lib/src/parse/grammar/follow.js","../node_modules/chevrotain/lib/src/scan/reg_exp_parser.js","../node_modules/chevrotain/lib/src/scan/reg_exp.js","../node_modules/chevrotain/lib/src/scan/lexer.js","../node_modules/chevrotain/lib/src/scan/tokens.js","../node_modules/chevrotain/lib/src/scan/lexer_errors_public.js","../node_modules/chevrotain/lib/src/scan/lexer_public.js","../node_modules/chevrotain/lib/src/scan/tokens_public.js","../node_modules/chevrotain/lib/src/parse/errors_public.js","../node_modules/chevrotain/lib/src/parse/grammar/resolver.js","../node_modules/chevrotain/lib/src/parse/grammar/interpreter.js","../node_modules/chevrotain/lib/src/parse/grammar/lookahead.js","../node_modules/chevrotain/lib/src/parse/grammar/checks.js","../node_modules/chevrotain/lib/src/parse/grammar/gast/gast_resolver_public.js","../node_modules/chevrotain/lib/src/parse/exceptions_public.js","../node_modules/chevrotain/lib/src/parse/parser/traits/recoverable.js","../node_modules/chevrotain/lib/src/parse/grammar/keys.js","../node_modules/chevrotain/lib/src/parse/grammar/llk_lookahead.js","../node_modules/chevrotain/lib/src/parse/parser/traits/looksahead.js","../node_modules/chevrotain/lib/src/parse/cst/cst.js","../node_modules/chevrotain/lib/src/lang/lang_extensions.js","../node_modules/chevrotain/lib/src/parse/cst/cst_visitor.js","../node_modules/chevrotain/lib/src/parse/parser/traits/tree_builder.js","../node_modules/chevrotain/lib/src/parse/parser/traits/lexer_adapter.js","../node_modules/chevrotain/lib/src/parse/parser/traits/recognizer_api.js","../node_modules/chevrotain/lib/src/parse/parser/traits/recognizer_engine.js","../node_modules/chevrotain/lib/src/parse/parser/traits/error_handler.js","../node_modules/chevrotain/lib/src/parse/parser/traits/context_assist.js","../node_modules/chevrotain/lib/src/parse/parser/traits/gast_recorder.js","../node_modules/chevrotain/lib/src/parse/parser/traits/perf_tracer.js","../node_modules/chevrotain/lib/src/parse/parser/utils/apply_mixins.js","../node_modules/chevrotain/lib/src/parse/parser/parser.js","../node_modules/chevrotain-allstar/lib/atn.js","../node_modules/chevrotain-allstar/lib/dfa.js","../node_modules/chevrotain-allstar/lib/all-star-lookahead.js","../node_modules/vscode-languageserver-types/lib/esm/main.js","../node_modules/langium/lib/parser/cst-node-builder.js","../node_modules/langium/lib/parser/langium-parser.js","../node_modules/langium/lib/parser/parser-builder-base.js","../node_modules/langium/lib/parser/completion-parser-builder.js","../node_modules/langium/lib/parser/langium-parser-builder.js","../node_modules/langium/lib/parser/token-builder.js","../node_modules/langium/lib/parser/value-converter.js","../node_modules/vscode-jsonrpc/lib/common/ral.js","../node_modules/vscode-jsonrpc/lib/common/is.js","../node_modules/vscode-jsonrpc/lib/common/events.js","../node_modules/vscode-jsonrpc/lib/common/cancellation.js","../node_modules/langium/lib/utils/promise-utils.js","../node_modules/vscode-languageserver-textdocument/lib/esm/main.js","../node_modules/vscode-uri/lib/esm/index.mjs","../node_modules/langium/lib/utils/uri-utils.js","../node_modules/langium/lib/workspace/documents.js","../node_modules/langium/lib/references/linker.js","../node_modules/langium/lib/references/name-provider.js","../node_modules/langium/lib/references/references.js","../node_modules/langium/lib/utils/collections.js","../node_modules/langium/lib/references/scope-computation.js","../node_modules/langium/lib/references/scope.js","../node_modules/langium/lib/utils/caching.js","../node_modules/langium/lib/references/scope-provider.js","../node_modules/langium/lib/serializer/json-serializer.js","../node_modules/langium/lib/service-registry.js","../node_modules/langium/lib/validation/validation-registry.js","../node_modules/langium/lib/validation/document-validator.js","../node_modules/langium/lib/workspace/ast-descriptions.js","../node_modules/langium/lib/workspace/ast-node-locator.js","../node_modules/langium/lib/workspace/configuration.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/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-jsonrpc/lib/browser/ril.js","../node_modules/vscode-jsonrpc/lib/browser/main.js","../node_modules/vscode-jsonrpc/browser.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.js","../node_modules/vscode-languageserver-protocol/lib/common/connection.js","../node_modules/vscode-languageserver-protocol/lib/common/api.js","../node_modules/vscode-languageserver-protocol/lib/browser/main.js","../node_modules/langium/lib/utils/disposable.js","../node_modules/langium/lib/workspace/document-builder.js","../node_modules/langium/lib/workspace/index-manager.js","../node_modules/langium/lib/workspace/workspace-manager.js","../node_modules/langium/lib/parser/lexer.js","../node_modules/langium/lib/documentation/jsdoc.js","../node_modules/langium/lib/documentation/documentation-provider.js","../node_modules/langium/lib/documentation/comment-provider.js","../node_modules/langium/lib/parser/async-parser.js","../node_modules/langium/lib/workspace/workspace-lock.js","../node_modules/langium/lib/serializer/hydrator.js","../node_modules/langium/lib/default-module.js","../node_modules/langium/lib/dependency-injection.js","../node_modules/langium/lib/workspace/file-system-provider.js","../node_modules/langium/lib/utils/grammar-loader.js","../node_modules/@mermaid-js/parser/dist/chunks/mermaid-parser.core/chunk-TCCFYFTB.mjs","../node_modules/@mermaid-js/parser/dist/chunks/mermaid-parser.core/chunk-4F5CHEZ2.mjs","../node_modules/@mermaid-js/parser/dist/chunks/mermaid-parser.core/chunk-FRFDVMJY.mjs","../node_modules/@mermaid-js/parser/dist/chunks/mermaid-parser.core/chunk-SJTYNZTY.mjs","../node_modules/@mermaid-js/parser/dist/chunks/mermaid-parser.core/chunk-PL6DKKU2.mjs","../node_modules/@mermaid-js/parser/dist/chunks/mermaid-parser.core/chunk-UMXZTB3W.mjs","../node_modules/@mermaid-js/parser/dist/chunks/mermaid-parser.core/chunk-TQ3KTPDO.mjs","../node_modules/@mermaid-js/parser/dist/chunks/mermaid-parser.core/chunk-B2363JML.mjs","../node_modules/@mermaid-js/parser/dist/mermaid-parser.core.mjs"],"sourcesContent":["import assignValue from './_assignValue.js';\nimport copyObject from './_copyObject.js';\nimport createAssigner from './_createAssigner.js';\nimport isArrayLike from './isArrayLike.js';\nimport isPrototype from './_isPrototype.js';\nimport keys from './keys.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 * Assigns own enumerable string keyed properties of source objects to the\n * destination object. Source objects are applied from left to right.\n * Subsequent sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object` and is loosely based on\n * [`Object.assign`](https://mdn.io/Object/assign).\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assignIn\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * function Bar() {\n *   this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assign({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'c': 3 }\n */\nvar assign = createAssigner(function(object, source) {\n  if (isPrototype(source) || isArrayLike(source)) {\n    copyObject(source, keys(source), object);\n    return;\n  }\n  for (var key in source) {\n    if (hasOwnProperty.call(source, key)) {\n      assignValue(object, key, source[key]);\n    }\n  }\n});\n\nexport default assign;\n","/**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseSlice(array, start, end) {\n  var index = -1,\n      length = array.length;\n\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = end > length ? length : end;\n  if (end < 0) {\n    end += length;\n  }\n  length = start > end ? 0 : ((end - start) >>> 0);\n  start >>>= 0;\n\n  var result = Array(length);\n  while (++index < length) {\n    result[index] = array[index + start];\n  }\n  return result;\n}\n\nexport default baseSlice;\n","/**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\nfunction compact(array) {\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 (value) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nexport default compact;\n","/**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\nfunction arrayAggregator(array, setter, iteratee, accumulator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    var value = array[index];\n    setter(accumulator, value, iteratee(value), array);\n  }\n  return accumulator;\n}\n\nexport default arrayAggregator;\n","import baseEach from './_baseEach.js';\n\n/**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\nfunction baseAggregator(collection, setter, iteratee, accumulator) {\n  baseEach(collection, function(value, key, collection) {\n    setter(accumulator, value, iteratee(value), collection);\n  });\n  return accumulator;\n}\n\nexport default baseAggregator;\n","import arrayAggregator from './_arrayAggregator.js';\nimport baseAggregator from './_baseAggregator.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\n\n/**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\nfunction createAggregator(setter, initializer) {\n  return function(collection, iteratee) {\n    var func = isArray(collection) ? arrayAggregator : baseAggregator,\n        accumulator = initializer ? initializer() : {};\n\n    return func(collection, setter, baseIteratee(iteratee, 2), accumulator);\n  };\n}\n\nexport default createAggregator;\n","import SetCache from './_SetCache.js';\nimport arrayIncludes from './_arrayIncludes.js';\nimport arrayIncludesWith from './_arrayIncludesWith.js';\nimport arrayMap from './_arrayMap.js';\nimport baseUnary from './_baseUnary.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee == null ? value : iteratee(value);\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nexport default baseDifference;\n","import baseDifference from './_baseDifference.js';\nimport baseFlatten from './_baseFlatten.js';\nimport baseRest from './_baseRest.js';\nimport isArrayLikeObject from './isArrayLikeObject.js';\n\n/**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\nvar difference = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n    : [];\n});\n\nexport default difference;\n","import baseSlice from './_baseSlice.js';\nimport toInteger from './toInteger.js';\n\n/**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\nfunction drop(array, n, guard) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  n = (guard || n === undefined) ? 1 : toInteger(n);\n  return baseSlice(array, n < 0 ? 0 : n, length);\n}\n\nexport default drop;\n","import baseSlice from './_baseSlice.js';\nimport toInteger from './toInteger.js';\n\n/**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\nfunction dropRight(array, n, guard) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return [];\n  }\n  n = (guard || n === undefined) ? 1 : toInteger(n);\n  n = length - n;\n  return baseSlice(array, 0, n < 0 ? 0 : n);\n}\n\nexport default dropRight;\n","/**\n * A specialized version of `_.every` 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 {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`.\n */\nfunction arrayEvery(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 false;\n    }\n  }\n  return true;\n}\n\nexport default arrayEvery;\n","import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.every` 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 {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`\n */\nfunction baseEvery(collection, predicate) {\n  var result = true;\n  baseEach(collection, function(value, index, collection) {\n    result = !!predicate(value, index, collection);\n    return result;\n  });\n  return result;\n}\n\nexport default baseEvery;\n","import arrayEvery from './_arrayEvery.js';\nimport baseEvery from './_baseEvery.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\nimport isIterateeCall from './_isIterateeCall.js';\n\n/**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\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 * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': false },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\nfunction every(collection, predicate, guard) {\n  var func = isArray(collection) ? arrayEvery : baseEvery;\n  if (guard && isIterateeCall(collection, predicate, guard)) {\n    predicate = undefined;\n  }\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default every;\n","/**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\nfunction head(array) {\n  return (array && array.length) ? array[0] : undefined;\n}\n\nexport default head;\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","import baseAssignValue from './_baseAssignValue.js';\nimport createAggregator from './_createAggregator.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 object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\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 iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\nvar groupBy = createAggregator(function(result, value, key) {\n  if (hasOwnProperty.call(result, key)) {\n    result[key].push(value);\n  } else {\n    baseAssignValue(result, key, [value]);\n  }\n});\n\nexport default groupBy;\n","import baseGetTag from './_baseGetTag.js';\nimport isArray from './isArray.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nexport default isString;\n","import baseIndexOf from './_baseIndexOf.js';\nimport isArrayLike from './isArrayLike.js';\nimport isString from './isString.js';\nimport toInteger from './toInteger.js';\nimport values from './values.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\nfunction includes(collection, value, fromIndex, guard) {\n  collection = isArrayLike(collection) ? collection : values(collection);\n  fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n  var length = collection.length;\n  if (fromIndex < 0) {\n    fromIndex = nativeMax(length + fromIndex, 0);\n  }\n  return isString(collection)\n    ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n    : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n}\n\nexport default includes;\n","import baseIndexOf from './_baseIndexOf.js';\nimport toInteger from './toInteger.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\nfunction indexOf(array, value, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseIndexOf(array, value, index);\n}\n\nexport default indexOf;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar regexpTag = '[object RegExp]';\n\n/**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\nfunction baseIsRegExp(value) {\n  return isObjectLike(value) && baseGetTag(value) == regexpTag;\n}\n\nexport default baseIsRegExp;\n","import baseIsRegExp from './_baseIsRegExp.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsRegExp = nodeUtil && nodeUtil.isRegExp;\n\n/**\n * Checks if `value` is classified as a `RegExp` 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 regexp, else `false`.\n * @example\n *\n * _.isRegExp(/abc/);\n * // => true\n *\n * _.isRegExp('/abc/');\n * // => false\n */\nvar isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\nexport default isRegExp;\n","/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n *   return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\nfunction negate(predicate) {\n  if (typeof predicate != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  return function() {\n    var args = arguments;\n    switch (args.length) {\n      case 0: return !predicate.call(this);\n      case 1: return !predicate.call(this, args[0]);\n      case 2: return !predicate.call(this, args[0], args[1]);\n      case 3: return !predicate.call(this, args[0], args[1], args[2]);\n    }\n    return !predicate.apply(this, args);\n  };\n}\n\nexport default negate;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport basePickBy from './_basePickBy.js';\nimport getAllKeysIn from './_getAllKeysIn.js';\n\n/**\n * Creates an object composed of the `object` properties `predicate` returns\n * truthy for. The predicate is invoked with two arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pickBy(object, _.isNumber);\n * // => { 'a': 1, 'c': 3 }\n */\nfunction pickBy(object, predicate) {\n  if (object == null) {\n    return {};\n  }\n  var props = arrayMap(getAllKeysIn(object), function(prop) {\n    return [prop];\n  });\n  predicate = baseIteratee(predicate);\n  return basePickBy(object, props, function(value, path) {\n    return predicate(value, path[0]);\n  });\n}\n\nexport default pickBy;\n","import arrayFilter from './_arrayFilter.js';\nimport baseFilter from './_baseFilter.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\nimport negate from './negate.js';\n\n/**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\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 _.filter\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': false },\n *   { 'user': 'fred',   'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\nfunction reject(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, negate(baseIteratee(predicate, 3)));\n}\n\nexport default reject;\n","import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.some` 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 {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction baseSome(collection, predicate) {\n  var result;\n\n  baseEach(collection, function(value, index, collection) {\n    result = predicate(value, index, collection);\n    return !result;\n  });\n  return !!result;\n}\n\nexport default baseSome;\n","import arraySome from './_arraySome.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseSome from './_baseSome.js';\nimport isArray from './isArray.js';\nimport isIterateeCall from './_isIterateeCall.js';\n\n/**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\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 * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n *   { 'user': 'barney', 'active': true },\n *   { 'user': 'fred',   'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\nfunction some(collection, predicate, guard) {\n  var func = isArray(collection) ? arraySome : baseSome;\n  if (guard && isIterateeCall(collection, predicate, guard)) {\n    predicate = undefined;\n  }\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default some;\n","import baseUniq from './_baseUniq.js';\n\n/**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\nfunction uniq(array) {\n  return (array && array.length) ? baseUniq(array) : [];\n}\n\nexport default uniq;\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","/******************************************************************************\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 ******************************************************************************/\nexport function isAstNode(obj) {\n    return typeof obj === 'object' && obj !== null && typeof obj.$type === 'string';\n}\nexport function isReference(obj) {\n    return typeof obj === 'object' && obj !== null && typeof obj.$refText === 'string' && 'ref' in obj;\n}\nexport function isMultiReference(obj) {\n    return typeof obj === 'object' && obj !== null && typeof obj.$refText === 'string' && 'items' in obj;\n}\nexport function isAstNodeDescription(obj) {\n    return typeof obj === 'object' && obj !== null\n        && typeof obj.name === 'string'\n        && typeof obj.type === 'string'\n        && typeof obj.path === 'string';\n}\nexport function isLinkingError(obj) {\n    return typeof obj === 'object' && obj !== null\n        && typeof obj.info === 'object'\n        && typeof obj.message === 'string';\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 class AbstractAstReflection {\n    constructor() {\n        this.subtypes = {};\n        this.allSubtypes = {};\n    }\n    getAllTypes() {\n        return Object.keys(this.types);\n    }\n    getReferenceType(refInfo) {\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    getTypeMetaData(type) {\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    isInstance(node, type) {\n        return isAstNode(node) && this.isSubtype(node.$type, type);\n    }\n    isSubtype(subtype, supertype) {\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        }\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    getAllSubTypes(type) {\n        const existing = this.allSubtypes[type];\n        if (existing) {\n            return existing;\n        }\n        else {\n            const allTypes = this.getAllTypes();\n            const types = [];\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}\nexport function isCompositeCstNode(node) {\n    return typeof node === 'object' && node !== null && Array.isArray(node.content);\n}\nexport function isLeafCstNode(node) {\n    return typeof node === 'object' && node !== null && typeof node.tokenType === 'object';\n}\nexport function isRootCstNode(node) {\n    return isCompositeCstNode(node) && typeof node.fullText === 'string';\n}\n//# sourceMappingURL=syntax-tree.js.map","/******************************************************************************\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 * 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 {\n    constructor(startFn, nextFn) {\n        this.startFn = startFn;\n        this.nextFn = nextFn;\n    }\n    iterator() {\n        const iterator = {\n            state: this.startFn(),\n            next: () => this.nextFn(iterator.state),\n            [Symbol.iterator]: () => iterator\n        };\n        return iterator;\n    }\n    [Symbol.iterator]() {\n        return this.iterator();\n    }\n    isEmpty() {\n        const iterator = this.iterator();\n        return Boolean(iterator.next().done);\n    }\n    count() {\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    toArray() {\n        const result = [];\n        const iterator = this.iterator();\n        let next;\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    toSet() {\n        return new Set(this);\n    }\n    toMap(keyFn, valueFn) {\n        const entryStream = this.map(element => [\n            keyFn ? keyFn(element) : element,\n            valueFn ? valueFn(element) : element\n        ]);\n        return new Map(entryStream);\n    }\n    toString() {\n        return this.join();\n    }\n    concat(other) {\n        return new StreamImpl(() => ({ first: this.startFn(), firstDone: false, iterator: other[Symbol.iterator]() }), state => {\n            let result;\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    join(separator = ',') {\n        const iterator = this.iterator();\n        let value = '';\n        let result;\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    indexOf(searchElement, fromIndex = 0) {\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    every(predicate) {\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    some(predicate) {\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    forEach(callbackfn) {\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    map(callbackfn) {\n        return new StreamImpl(this.startFn, (state) => {\n            const { done, value } = this.nextFn(state);\n            if (done) {\n                return DONE_RESULT;\n            }\n            else {\n                return { done: false, value: callbackfn(value) };\n            }\n        });\n    }\n    filter(predicate) {\n        return new StreamImpl(this.startFn, state => {\n            let result;\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    nonNullable() {\n        return this.filter(e => e !== undefined && e !== null);\n    }\n    reduce(callbackfn, initialValue) {\n        const iterator = this.iterator();\n        let previousValue = initialValue;\n        let next = iterator.next();\n        while (!next.done) {\n            if (previousValue === undefined) {\n                previousValue = next.value;\n            }\n            else {\n                previousValue = callbackfn(previousValue, next.value);\n            }\n            next = iterator.next();\n        }\n        return previousValue;\n    }\n    reduceRight(callbackfn, initialValue) {\n        return this.recursiveReduce(this.iterator(), callbackfn, initialValue);\n    }\n    recursiveReduce(iterator, callbackfn, initialValue) {\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    find(predicate) {\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    findIndex(predicate) {\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    includes(searchElement) {\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    flatMap(callbackfn) {\n        return new StreamImpl(() => ({ this: this.startFn() }), (state) => {\n            do {\n                if (state.iterator) {\n                    const next = state.iterator.next();\n                    if (next.done) {\n                        state.iterator = undefined;\n                    }\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                    }\n                    else {\n                        return { done: false, value: mapped };\n                    }\n                }\n            } while (state.iterator);\n            return DONE_RESULT;\n        });\n    }\n    flat(depth) {\n        if (depth === undefined) {\n            depth = 1;\n        }\n        if (depth <= 0) {\n            return this;\n        }\n        const stream = depth > 1 ? this.flat(depth - 1) : this;\n        return new StreamImpl(() => ({ this: stream.startFn() }), (state) => {\n            do {\n                if (state.iterator) {\n                    const next = state.iterator.next();\n                    if (next.done) {\n                        state.iterator = undefined;\n                    }\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]();\n                    }\n                    else {\n                        return { done: false, value: value };\n                    }\n                }\n            } while (state.iterator);\n            return DONE_RESULT;\n        });\n    }\n    head() {\n        const iterator = this.iterator();\n        const result = iterator.next();\n        if (result.done) {\n            return undefined;\n        }\n        return result.value;\n    }\n    tail(skipCount = 1) {\n        return new StreamImpl(() => {\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        }, this.nextFn);\n    }\n    limit(maxSize) {\n        return new StreamImpl(() => ({ size: 0, state: this.startFn() }), state => {\n            state.size++;\n            if (state.size > maxSize) {\n                return DONE_RESULT;\n            }\n            return this.nextFn(state.state);\n        });\n    }\n    distinct(by) {\n        return new StreamImpl(() => ({ set: new Set(), internalState: this.startFn() }), state => {\n            let result;\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    exclude(other, key) {\n        const otherKeySet = new Set();\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}\nfunction toString(item) {\n    if (typeof item === 'string') {\n        return item;\n    }\n    if (typeof item === 'undefined') {\n        return 'undefined';\n    }\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    if (typeof item.toString === 'function') {\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        return item.toString();\n    }\n    return Object.prototype.toString.call(item);\n}\nfunction isIterable(obj) {\n    return !!obj && typeof obj[Symbol.iterator] === 'function';\n}\n/**\n * An empty stream of any type.\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport const EMPTY_STREAM = new StreamImpl(() => undefined, () => DONE_RESULT);\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 = Object.freeze({ done: true, value: undefined });\n/**\n * Create a stream from one or more iterables or array-likes.\n */\nexport function stream(...collections) {\n    if (collections.length === 1) {\n        const collection = collections[0];\n        if (collection instanceof StreamImpl) {\n            return collection;\n        }\n        if (isIterable(collection)) {\n            return new StreamImpl(() => collection[Symbol.iterator](), (iterator) => iterator.next());\n        }\n        if (typeof collection.length === 'number') {\n            return new StreamImpl(() => ({ index: 0 }), (state) => {\n                if (state.index < collection.length) {\n                    return { done: false, value: collection[state.index++] };\n                }\n                else {\n                    return DONE_RESULT;\n                }\n            });\n        }\n    }\n    if (collections.length > 1) {\n        return new StreamImpl(() => ({ collIndex: 0, arrIndex: 0 }), (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                    }\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    return EMPTY_STREAM;\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 extends StreamImpl {\n    constructor(root, children, options) {\n        super(() => ({\n            iterators: options?.includeRoot ? [[root][Symbol.iterator]()] : [children(root)[Symbol.iterator]()],\n            pruned: false\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                }\n                else {\n                    state.iterators.push(children(next.value)[Symbol.iterator]());\n                    return next;\n                }\n            }\n            return DONE_RESULT;\n        });\n    }\n    iterator() {\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 * A set of utility functions that reduce a stream to a single value.\n */\nexport var Reduction;\n(function (Reduction) {\n    /**\n     * Compute the sum of a number stream.\n     */\n    function sum(stream) {\n        return stream.reduce((a, b) => a + b, 0);\n    }\n    Reduction.sum = sum;\n    /**\n     * Compute the product of a number stream.\n     */\n    function product(stream) {\n        return stream.reduce((a, b) => a * b, 0);\n    }\n    Reduction.product = product;\n    /**\n     * Compute the minimum of a number stream. Returns `undefined` if the stream is empty.\n     */\n    function min(stream) {\n        return stream.reduce((a, b) => Math.min(a, b));\n    }\n    Reduction.min = min;\n    /**\n     * Compute the maximum of a number stream. Returns `undefined` if the stream is empty.\n     */\n    function max(stream) {\n        return stream.reduce((a, b) => Math.max(a, b));\n    }\n    Reduction.max = max;\n})(Reduction || (Reduction = {}));\n//# sourceMappingURL=stream.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { isAstNode, isMultiReference, isReference } from '../syntax-tree.js';\nimport { DONE_RESULT, StreamImpl, TreeStreamImpl } from './stream.js';\nimport { inRange } from './cst-utils.js';\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, options = {}) {\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.$container = node;\n                        item.$containerProperty = name;\n                        item.$containerIndex = index;\n                        if (options.deep) {\n                            linkContentToContainer(item, options);\n                        }\n                    }\n                });\n            }\n            else if (isAstNode(value)) {\n                value.$container = node;\n                value.$containerProperty = name;\n                if (options.deep) {\n                    linkContentToContainer(value, options);\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(node, typePredicate) {\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 * 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, predicate) {\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 * 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(node) {\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;\n}\n/**\n * Returns the root node of the given AST node by following the `$container` references.\n */\nexport function findRootNode(node) {\n    while (node.$container) {\n        node = node.$container;\n    }\n    return node;\n}\n/**\n * Returns all AST nodes that are referenced by the given reference or multi-reference.\n */\nexport function getReferenceNodes(reference) {\n    if (isReference(reference)) {\n        return reference.ref ? [reference.ref] : [];\n    }\n    else if (isMultiReference(reference)) {\n        return reference.items.map(item => item.ref);\n    }\n    return [];\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, options) {\n    if (!node) {\n        throw new Error('Node must be an AstNode.');\n    }\n    const range = options?.range;\n    return new StreamImpl(() => ({\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[property];\n                if (isAstNode(value)) {\n                    state.keyIndex++;\n                    if (isAstNodeInRange(value, range)) {\n                        return { done: false, value };\n                    }\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 * 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, options) {\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 * 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, options) {\n    if (!root) {\n        throw new Error('Root node must be an AstNode.');\n    }\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}\nfunction isAstNodeInRange(astNode, range) {\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 * 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) {\n    return new StreamImpl(() => ({\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[property];\n                if (isReference(value) || isMultiReference(value)) {\n                    state.keyIndex++;\n                    return { done: false, value: { reference: value, container: node, property } };\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 (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 * 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, node) {\n    const typeMetaData = reflection.getTypeMetaData(node.$type);\n    const genericNode = node;\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}\nfunction copyDefaultValue(propertyType) {\n    if (Array.isArray(propertyType)) {\n        return [...propertyType.map(copyDefaultValue)];\n    }\n    else {\n        return propertyType;\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(node, buildReference, trace) {\n    const copy = { $type: node.$type };\n    if (trace) {\n        trace.set(node, copy);\n        trace.set(copy, node);\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            }\n            else if (isReference(value)) {\n                copy[name] = buildReference(copy, name, value.$refNode, value.$refText, value);\n            }\n            else if (Array.isArray(value)) {\n                const copiedArray = [];\n                for (const element of value) {\n                    if (isAstNode(element)) {\n                        copiedArray.push(copyAstNode(element, buildReference, trace));\n                    }\n                    else if (isReference(element)) {\n                        copiedArray.push(buildReference(copy, name, element.$refNode, element.$refText, element));\n                    }\n                    else {\n                        copiedArray.push(element);\n                    }\n                }\n                copy[name] = copiedArray;\n            }\n            else {\n                copy[name] = value;\n            }\n        }\n    }\n    linkContentToContainer(copy, { deep: true });\n    return copy;\n}\n//# sourceMappingURL=ast-utils.js.map","/******************************************************************************\n * This file was generated by langium-cli 4.2.0.\n * DO NOT EDIT MANUALLY!\n ******************************************************************************/\n/* eslint-disable */\nimport * as langium from '../../syntax-tree.js';\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};\nexport const AbstractElement = {\n    $type: 'AbstractElement',\n    cardinality: 'cardinality'\n};\nexport function isAbstractElement(item) {\n    return reflection.isInstance(item, AbstractElement.$type);\n}\nexport const AbstractParserRule = {\n    $type: 'AbstractParserRule'\n};\nexport function isAbstractParserRule(item) {\n    return reflection.isInstance(item, AbstractParserRule.$type);\n}\nexport const AbstractRule = {\n    $type: 'AbstractRule'\n};\nexport function isAbstractRule(item) {\n    return reflection.isInstance(item, AbstractRule.$type);\n}\nexport const AbstractType = {\n    $type: 'AbstractType'\n};\nexport function isAbstractType(item) {\n    return reflection.isInstance(item, AbstractType.$type);\n}\nexport const Action = {\n    $type: 'Action',\n    cardinality: 'cardinality',\n    feature: 'feature',\n    inferredType: 'inferredType',\n    operator: 'operator',\n    type: 'type'\n};\nexport function isAction(item) {\n    return reflection.isInstance(item, Action.$type);\n}\nexport const Alternatives = {\n    $type: 'Alternatives',\n    cardinality: 'cardinality',\n    elements: 'elements'\n};\nexport function isAlternatives(item) {\n    return reflection.isInstance(item, Alternatives.$type);\n}\nexport const ArrayLiteral = {\n    $type: 'ArrayLiteral',\n    elements: 'elements'\n};\nexport function isArrayLiteral(item) {\n    return reflection.isInstance(item, ArrayLiteral.$type);\n}\nexport const ArrayType = {\n    $type: 'ArrayType',\n    elementType: 'elementType'\n};\nexport function isArrayType(item) {\n    return reflection.isInstance(item, ArrayType.$type);\n}\nexport const Assignment = {\n    $type: 'Assignment',\n    cardinality: 'cardinality',\n    feature: 'feature',\n    operator: 'operator',\n    predicate: 'predicate',\n    terminal: 'terminal'\n};\nexport function isAssignment(item) {\n    return reflection.isInstance(item, Assignment.$type);\n}\nexport const BooleanLiteral = {\n    $type: 'BooleanLiteral',\n    true: 'true'\n};\nexport function isBooleanLiteral(item) {\n    return reflection.isInstance(item, BooleanLiteral.$type);\n}\nexport const CharacterRange = {\n    $type: 'CharacterRange',\n    cardinality: 'cardinality',\n    left: 'left',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    right: 'right'\n};\nexport function isCharacterRange(item) {\n    return reflection.isInstance(item, CharacterRange.$type);\n}\nexport const Condition = {\n    $type: 'Condition'\n};\nexport function isCondition(item) {\n    return reflection.isInstance(item, Condition.$type);\n}\nexport const Conjunction = {\n    $type: 'Conjunction',\n    left: 'left',\n    right: 'right'\n};\nexport function isConjunction(item) {\n    return reflection.isInstance(item, Conjunction.$type);\n}\nexport const CrossReference = {\n    $type: 'CrossReference',\n    cardinality: 'cardinality',\n    deprecatedSyntax: 'deprecatedSyntax',\n    isMulti: 'isMulti',\n    terminal: 'terminal',\n    type: 'type'\n};\nexport function isCrossReference(item) {\n    return reflection.isInstance(item, CrossReference.$type);\n}\nexport const Disjunction = {\n    $type: 'Disjunction',\n    left: 'left',\n    right: 'right'\n};\nexport function isDisjunction(item) {\n    return reflection.isInstance(item, Disjunction.$type);\n}\nexport const EndOfFile = {\n    $type: 'EndOfFile',\n    cardinality: 'cardinality'\n};\nexport function isEndOfFile(item) {\n    return reflection.isInstance(item, EndOfFile.$type);\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};\nexport function isGrammar(item) {\n    return reflection.isInstance(item, Grammar.$type);\n}\nexport const GrammarImport = {\n    $type: 'GrammarImport',\n    path: 'path'\n};\nexport function isGrammarImport(item) {\n    return reflection.isInstance(item, GrammarImport.$type);\n}\nexport const Group = {\n    $type: 'Group',\n    cardinality: 'cardinality',\n    elements: 'elements',\n    guardCondition: 'guardCondition',\n    predicate: 'predicate'\n};\nexport function isGroup(item) {\n    return reflection.isInstance(item, Group.$type);\n}\nexport const InferredType = {\n    $type: 'InferredType',\n    name: 'name'\n};\nexport function isInferredType(item) {\n    return reflection.isInstance(item, InferredType.$type);\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};\nexport function isInfixRule(item) {\n    return reflection.isInstance(item, InfixRule.$type);\n}\nexport const InfixRuleOperatorList = {\n    $type: 'InfixRuleOperatorList',\n    associativity: 'associativity',\n    operators: 'operators'\n};\nexport function isInfixRuleOperatorList(item) {\n    return reflection.isInstance(item, InfixRuleOperatorList.$type);\n}\nexport const InfixRuleOperators = {\n    $type: 'InfixRuleOperators',\n    precedences: 'precedences'\n};\nexport function isInfixRuleOperators(item) {\n    return reflection.isInstance(item, InfixRuleOperators.$type);\n}\nexport const Interface = {\n    $type: 'Interface',\n    attributes: 'attributes',\n    name: 'name',\n    superTypes: 'superTypes'\n};\nexport function isInterface(item) {\n    return reflection.isInstance(item, Interface.$type);\n}\nexport const Keyword = {\n    $type: 'Keyword',\n    cardinality: 'cardinality',\n    predicate: 'predicate',\n    value: 'value'\n};\nexport function isKeyword(item) {\n    return reflection.isInstance(item, Keyword.$type);\n}\nexport const NamedArgument = {\n    $type: 'NamedArgument',\n    calledByName: 'calledByName',\n    parameter: 'parameter',\n    value: 'value'\n};\nexport function isNamedArgument(item) {\n    return reflection.isInstance(item, NamedArgument.$type);\n}\nexport const NegatedToken = {\n    $type: 'NegatedToken',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    terminal: 'terminal'\n};\nexport function isNegatedToken(item) {\n    return reflection.isInstance(item, NegatedToken.$type);\n}\nexport const Negation = {\n    $type: 'Negation',\n    value: 'value'\n};\nexport function isNegation(item) {\n    return reflection.isInstance(item, Negation.$type);\n}\nexport const NumberLiteral = {\n    $type: 'NumberLiteral',\n    value: 'value'\n};\nexport function isNumberLiteral(item) {\n    return reflection.isInstance(item, NumberLiteral.$type);\n}\nexport const Parameter = {\n    $type: 'Parameter',\n    name: 'name'\n};\nexport function isParameter(item) {\n    return reflection.isInstance(item, Parameter.$type);\n}\nexport const ParameterReference = {\n    $type: 'ParameterReference',\n    parameter: 'parameter'\n};\nexport function isParameterReference(item) {\n    return reflection.isInstance(item, ParameterReference.$type);\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};\nexport function isParserRule(item) {\n    return reflection.isInstance(item, ParserRule.$type);\n}\nexport const ReferenceType = {\n    $type: 'ReferenceType',\n    isMulti: 'isMulti',\n    referenceType: 'referenceType'\n};\nexport function isReferenceType(item) {\n    return reflection.isInstance(item, ReferenceType.$type);\n}\nexport const RegexToken = {\n    $type: 'RegexToken',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    regex: 'regex'\n};\nexport function isRegexToken(item) {\n    return reflection.isInstance(item, RegexToken.$type);\n}\nexport const ReturnType = {\n    $type: 'ReturnType',\n    name: 'name'\n};\nexport function isReturnType(item) {\n    return reflection.isInstance(item, ReturnType.$type);\n}\nexport const RuleCall = {\n    $type: 'RuleCall',\n    arguments: 'arguments',\n    cardinality: 'cardinality',\n    predicate: 'predicate',\n    rule: 'rule'\n};\nexport function isRuleCall(item) {\n    return reflection.isInstance(item, RuleCall.$type);\n}\nexport const SimpleType = {\n    $type: 'SimpleType',\n    primitiveType: 'primitiveType',\n    stringType: 'stringType',\n    typeRef: 'typeRef'\n};\nexport function isSimpleType(item) {\n    return reflection.isInstance(item, SimpleType.$type);\n}\nexport const StringLiteral = {\n    $type: 'StringLiteral',\n    value: 'value'\n};\nexport function isStringLiteral(item) {\n    return reflection.isInstance(item, StringLiteral.$type);\n}\nexport const TerminalAlternatives = {\n    $type: 'TerminalAlternatives',\n    cardinality: 'cardinality',\n    elements: 'elements',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized'\n};\nexport function isTerminalAlternatives(item) {\n    return reflection.isInstance(item, TerminalAlternatives.$type);\n}\nexport const TerminalElement = {\n    $type: 'TerminalElement',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized'\n};\nexport function isTerminalElement(item) {\n    return reflection.isInstance(item, TerminalElement.$type);\n}\nexport const TerminalGroup = {\n    $type: 'TerminalGroup',\n    cardinality: 'cardinality',\n    elements: 'elements',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized'\n};\nexport function isTerminalGroup(item) {\n    return reflection.isInstance(item, TerminalGroup.$type);\n}\nexport const TerminalRule = {\n    $type: 'TerminalRule',\n    definition: 'definition',\n    fragment: 'fragment',\n    hidden: 'hidden',\n    name: 'name',\n    type: 'type'\n};\nexport function isTerminalRule(item) {\n    return reflection.isInstance(item, TerminalRule.$type);\n}\nexport const TerminalRuleCall = {\n    $type: 'TerminalRuleCall',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    rule: 'rule'\n};\nexport function isTerminalRuleCall(item) {\n    return reflection.isInstance(item, TerminalRuleCall.$type);\n}\nexport const Type = {\n    $type: 'Type',\n    name: 'name',\n    type: 'type'\n};\nexport function isType(item) {\n    return reflection.isInstance(item, Type.$type);\n}\nexport const TypeAttribute = {\n    $type: 'TypeAttribute',\n    defaultValue: 'defaultValue',\n    isOptional: 'isOptional',\n    name: 'name',\n    type: 'type'\n};\nexport function isTypeAttribute(item) {\n    return reflection.isInstance(item, TypeAttribute.$type);\n}\nexport const TypeDefinition = {\n    $type: 'TypeDefinition'\n};\nexport function isTypeDefinition(item) {\n    return reflection.isInstance(item, TypeDefinition.$type);\n}\nexport const UnionType = {\n    $type: 'UnionType',\n    types: 'types'\n};\nexport function isUnionType(item) {\n    return reflection.isInstance(item, UnionType.$type);\n}\nexport const UnorderedGroup = {\n    $type: 'UnorderedGroup',\n    cardinality: 'cardinality',\n    elements: 'elements'\n};\nexport function isUnorderedGroup(item) {\n    return reflection.isInstance(item, UnorderedGroup.$type);\n}\nexport const UntilToken = {\n    $type: 'UntilToken',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized',\n    terminal: 'terminal'\n};\nexport function isUntilToken(item) {\n    return reflection.isInstance(item, UntilToken.$type);\n}\nexport const ValueLiteral = {\n    $type: 'ValueLiteral'\n};\nexport function isValueLiteral(item) {\n    return reflection.isInstance(item, ValueLiteral.$type);\n}\nexport const Wildcard = {\n    $type: 'Wildcard',\n    cardinality: 'cardinality',\n    lookahead: 'lookahead',\n    parenthesized: 'parenthesized'\n};\nexport function isWildcard(item) {\n    return reflection.isInstance(item, Wildcard.$type);\n}\nexport class LangiumGrammarAstReflection extends langium.AbstractAstReflection {\n    constructor() {\n        super(...arguments);\n        this.types = {\n            AbstractElement: {\n                name: AbstractElement.$type,\n                properties: {\n                    cardinality: {\n                        name: AbstractElement.cardinality\n                    }\n                },\n                superTypes: []\n            },\n            AbstractParserRule: {\n                name: AbstractParserRule.$type,\n                properties: {},\n                superTypes: [AbstractRule.$type, AbstractType.$type]\n            },\n            AbstractRule: {\n                name: AbstractRule.$type,\n                properties: {},\n                superTypes: []\n            },\n            AbstractType: {\n                name: AbstractType.$type,\n                properties: {},\n                superTypes: []\n            },\n            Action: {\n                name: Action.$type,\n                properties: {\n                    cardinality: {\n                        name: Action.cardinality\n                    },\n                    feature: {\n                        name: Action.feature\n                    },\n                    inferredType: {\n                        name: Action.inferredType\n                    },\n                    operator: {\n                        name: Action.operator\n                    },\n                    type: {\n                        name: Action.type,\n                        referenceType: AbstractType.$type\n                    }\n                },\n                superTypes: [AbstractElement.$type]\n            },\n            Alternatives: {\n                name: Alternatives.$type,\n                properties: {\n                    cardinality: {\n                        name: Alternatives.cardinality\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                    },\n                    feature: {\n                        name: Assignment.feature\n                    },\n                    operator: {\n                        name: Assignment.operator\n                    },\n                    predicate: {\n                        name: Assignment.predicate\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                    },\n                    left: {\n                        name: CharacterRange.left\n                    },\n                    lookahead: {\n                        name: CharacterRange.lookahead\n                    },\n                    parenthesized: {\n                        name: CharacterRange.parenthesized,\n                        defaultValue: false\n                    },\n                    right: {\n                        name: CharacterRange.right\n                    }\n                },\n                superTypes: [TerminalElement.$type]\n            },\n            Condition: {\n                name: Condition.$type,\n                properties: {},\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                    },\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                    },\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                    }\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                    },\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                    },\n                    elements: {\n                        name: Group.elements,\n                        defaultValue: []\n                    },\n                    guardCondition: {\n                        name: Group.guardCondition\n                    },\n                    predicate: {\n                        name: Group.predicate\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                    },\n                    inferredType: {\n                        name: InfixRule.inferredType\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                    }\n                },\n                superTypes: [AbstractParserRule.$type]\n            },\n            InfixRuleOperatorList: {\n                name: InfixRuleOperatorList.$type,\n                properties: {\n                    associativity: {\n                        name: InfixRuleOperatorList.associativity\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                    },\n                    predicate: {\n                        name: Keyword.predicate\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                    },\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                    },\n                    lookahead: {\n                        name: NegatedToken.lookahead\n                    },\n                    parenthesized: {\n                        name: NegatedToken.parenthesized,\n                        defaultValue: false\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                    },\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                    },\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                    }\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                    },\n                    lookahead: {\n                        name: RegexToken.lookahead\n                    },\n                    parenthesized: {\n                        name: RegexToken.parenthesized,\n                        defaultValue: false\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                    },\n                    predicate: {\n                        name: RuleCall.predicate\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                    },\n                    stringType: {\n                        name: SimpleType.stringType\n                    },\n                    typeRef: {\n                        name: SimpleType.typeRef,\n                        referenceType: AbstractType.$type\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                    },\n                    elements: {\n                        name: TerminalAlternatives.elements,\n                        defaultValue: []\n                    },\n                    lookahead: {\n                        name: TerminalAlternatives.lookahead\n                    },\n                    parenthesized: {\n                        name: TerminalAlternatives.parenthesized,\n                        defaultValue: false\n                    }\n                },\n                superTypes: [TerminalElement.$type]\n            },\n            TerminalElement: {\n                name: TerminalElement.$type,\n                properties: {\n                    cardinality: {\n                        name: TerminalElement.cardinality\n                    },\n                    lookahead: {\n                        name: TerminalElement.lookahead\n                    },\n                    parenthesized: {\n                        name: TerminalElement.parenthesized,\n                        defaultValue: false\n                    }\n                },\n                superTypes: [AbstractElement.$type]\n            },\n            TerminalGroup: {\n                name: TerminalGroup.$type,\n                properties: {\n                    cardinality: {\n                        name: TerminalGroup.cardinality\n                    },\n                    elements: {\n                        name: TerminalGroup.elements,\n                        defaultValue: []\n                    },\n                    lookahead: {\n                        name: TerminalGroup.lookahead\n                    },\n                    parenthesized: {\n                        name: TerminalGroup.parenthesized,\n                        defaultValue: false\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                    }\n                },\n                superTypes: [AbstractRule.$type]\n            },\n            TerminalRuleCall: {\n                name: TerminalRuleCall.$type,\n                properties: {\n                    cardinality: {\n                        name: TerminalRuleCall.cardinality\n                    },\n                    lookahead: {\n                        name: TerminalRuleCall.lookahead\n                    },\n                    parenthesized: {\n                        name: TerminalRuleCall.parenthesized,\n                        defaultValue: false\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                    },\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                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                    },\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                    },\n                    lookahead: {\n                        name: UntilToken.lookahead\n                    },\n                    parenthesized: {\n                        name: UntilToken.parenthesized,\n                        defaultValue: false\n                    },\n                    terminal: {\n                        name: UntilToken.terminal\n                    }\n                },\n                superTypes: [TerminalElement.$type]\n            },\n            ValueLiteral: {\n                name: ValueLiteral.$type,\n                properties: {},\n                superTypes: []\n            },\n            Wildcard: {\n                name: Wildcard.$type,\n                properties: {\n                    cardinality: {\n                        name: Wildcard.cardinality\n                    },\n                    lookahead: {\n                        name: Wildcard.lookahead\n                    },\n                    parenthesized: {\n                        name: Wildcard.parenthesized,\n                        defaultValue: false\n                    }\n                },\n                superTypes: [TerminalElement.$type]\n            }\n        };\n    }\n}\nexport const reflection = new LangiumGrammarAstReflection();\n//# sourceMappingURL=ast.js.map","/******************************************************************************\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 ******************************************************************************/\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 * 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) {\n    let current = 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        }\n        else if (found) {\n            // The last datatype node is the one we are looking for\n            return current;\n        }\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 * 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) {\n    return new TreeStreamImpl(node, element => {\n        if (isCompositeCstNode(element)) {\n            return element.content;\n        }\n        else {\n            return [];\n        }\n    }, { includeRoot: true });\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) {\n    return streamCst(node).filter(isLeafCstNode);\n}\n/**\n * Determines whether the specified cst node is a child of the specified parent node.\n */\nexport function isChildNode(child, parent) {\n    while (child.container) {\n        child = child.container;\n        if (child === parent) {\n            return true;\n        }\n    }\n    return false;\n}\nexport function tokenToRange(token) {\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}\nexport function toDocumentSegment(node) {\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}\nexport var RangeComparison;\n(function (RangeComparison) {\n    RangeComparison[RangeComparison[\"Before\"] = 0] = \"Before\";\n    RangeComparison[RangeComparison[\"After\"] = 1] = \"After\";\n    RangeComparison[RangeComparison[\"OverlapFront\"] = 2] = \"OverlapFront\";\n    RangeComparison[RangeComparison[\"OverlapBack\"] = 3] = \"OverlapBack\";\n    RangeComparison[RangeComparison[\"Inside\"] = 4] = \"Inside\";\n    RangeComparison[RangeComparison[\"Outside\"] = 5] = \"Outside\";\n})(RangeComparison || (RangeComparison = {}));\nexport function compareRange(range, to) {\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    }\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    }\n    else if (startInside) {\n        return RangeComparison.OverlapBack;\n    }\n    else if (endInside) {\n        return RangeComparison.OverlapFront;\n    }\n    else {\n        return RangeComparison.Outside;\n    }\n}\nexport function inRange(range, to) {\n    const comparison = compareRange(range, to);\n    return comparison > RangeComparison.After;\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 * 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, offset, nameRegexp = DefaultNameRegexp) {\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}\nexport function findCommentNode(cstNode, commentNames) {\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}\nexport function isCommentNode(cstNode, commentNames) {\n    return isLeafCstNode(cstNode) && commentNames.includes(cstNode.tokenType.name);\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, offset) {\n    if (isLeafCstNode(node)) {\n        return node;\n    }\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 * 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, offset) {\n    if (isLeafCstNode(node)) {\n        return node;\n    }\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}\nfunction binarySearch(node, offset, closest) {\n    let left = 0;\n    let right = node.content.length - 1;\n    let closestNode = undefined;\n    while (left <= right) {\n        const middle = Math.floor((left + right) / 2);\n        const middleNode = node.content[middle];\n        if (middleNode.offset <= offset && middleNode.end > offset) {\n            // Found an exact match\n            return middleNode;\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        }\n        else {\n            // Move to the left half\n            right = middle - 1;\n        }\n    }\n    return closestNode;\n}\nexport function getPreviousNode(node, hidden = true) {\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}\nexport function getNextNode(node, hidden = true) {\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}\nexport function getStartlineNode(node) {\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;\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        }\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}\nexport function getInteriorNodes(start, end) {\n    const commonParent = getCommonParent(start, end);\n    if (!commonParent) {\n        return [];\n    }\n    return commonParent.parent.content.slice(commonParent.a + 1, commonParent.b);\n}\nfunction getCommonParent(a, b) {\n    const aParents = getParentChain(a);\n    const bParents = getParentChain(b);\n    let current;\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        }\n        else {\n            break;\n        }\n    }\n    return current;\n}\nfunction getParentChain(node) {\n    const chain = [];\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//# sourceMappingURL=cst-utils.js.map","/******************************************************************************\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 ******************************************************************************/\nexport class ErrorWithLocation extends Error {\n    constructor(node, message) {\n        super(node ? `${message} at ${node.range.start.line}:${node.range.start.character}` : message);\n    }\n}\nexport function assertUnreachable(_, message = 'Error: Got unexpected value.') {\n    throw new Error(message);\n}\nexport function assertCondition(condition, message = 'Error: Condition is violated.') {\n    if (!condition) {\n        throw new Error(message);\n    }\n}\n//# sourceMappingURL=errors.js.map","export function cc(char) {\n    return char.charCodeAt(0);\n}\nexport function insertToSet(item, set) {\n    if (Array.isArray(item)) {\n        item.forEach(function (subItem) {\n            set.push(subItem);\n        });\n    }\n    else {\n        set.push(item);\n    }\n}\nexport function addFlag(flagObj, flagKey) {\n    if (flagObj[flagKey] === true) {\n        throw \"duplicate flag \" + flagKey;\n    }\n    const x = flagObj[flagKey];\n    flagObj[flagKey] = true;\n}\nexport function ASSERT_EXISTS(obj) {\n    // istanbul ignore next\n    if (obj === undefined) {\n        throw Error(\"Internal Error - Should never get here!\");\n    }\n    return true;\n}\n// istanbul ignore next\nexport function ASSERT_NEVER_REACH_HERE() {\n    throw Error(\"Internal Error - Should never get here!\");\n}\nexport function isCharacter(obj) {\n    return obj[\"type\"] === \"Character\";\n}\n//# sourceMappingURL=utils.js.map","import { cc } from \"./utils.js\";\nexport const digitsCharCodes = [];\nfor (let i = cc(\"0\"); i <= cc(\"9\"); i++) {\n    digitsCharCodes.push(i);\n}\nexport const wordCharCodes = [cc(\"_\")].concat(digitsCharCodes);\nfor (let i = cc(\"a\"); i <= cc(\"z\"); i++) {\n    wordCharCodes.push(i);\n}\nfor (let i = cc(\"A\"); i <= cc(\"Z\"); i++) {\n    wordCharCodes.push(i);\n}\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp#character-classes\nexport const whitespaceCodes = [\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//# sourceMappingURL=character-classes.js.map","import { addFlag, ASSERT_EXISTS, ASSERT_NEVER_REACH_HERE, cc, insertToSet, isCharacter, } from \"./utils.js\";\nimport { digitsCharCodes, whitespaceCodes, wordCharCodes, } from \"./character-classes.js\";\n// consts and utilities\nconst hexDigitPattern = /[0-9a-fA-F]/;\nconst decimalPattern = /[0-9]/;\nconst decimalPatternNoZero = /[1-9]/;\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    constructor() {\n        this.idx = 0;\n        this.input = \"\";\n        this.groupIdx = 0;\n    }\n    saveState() {\n        return {\n            idx: this.idx,\n            input: this.input,\n            groupIdx: this.groupIdx,\n        };\n    }\n    restoreState(newState) {\n        this.idx = newState.idx;\n        this.input = newState.input;\n        this.groupIdx = newState.groupIdx;\n    }\n    pattern(input) {\n        // parser state\n        this.idx = 0;\n        this.input = input;\n        this.groupIdx = 0;\n        this.consumeChar(\"/\");\n        const value = this.disjunction();\n        this.consumeChar(\"/\");\n        const flags = {\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        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        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    disjunction() {\n        const alts = [];\n        const begin = this.idx;\n        alts.push(this.alternative());\n        while (this.peekChar() === \"|\") {\n            this.consumeChar(\"|\");\n            alts.push(this.alternative());\n        }\n        return { type: \"Disjunction\", value: alts, loc: this.loc(begin) };\n    }\n    alternative() {\n        const terms = [];\n        const begin = this.idx;\n        while (this.isTerm()) {\n            terms.push(this.term());\n        }\n        return { type: \"Alternative\", value: terms, loc: this.loc(begin) };\n    }\n    term() {\n        if (this.isAssertion()) {\n            return this.assertion();\n        }\n        else {\n            return this.atom();\n        }\n    }\n    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                let type;\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                const disjunction = this.disjunction();\n                this.consumeChar(\")\");\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    quantifier(isBacktracking = false) {\n        let range = 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                        }\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        // throwing exceptions from \"ASSERT_EXISTS\" during backtracking\n        // causes severe performance degradations\n        if (isBacktracking === true && range === undefined) {\n            return undefined;\n        }\n        // istanbul ignore else\n        if (ASSERT_EXISTS(range)) {\n            if (this.peekChar(0) === \"?\") {\n                this.consumeChar(\"?\");\n                range.greedy = false;\n            }\n            else {\n                range.greedy = true;\n            }\n            range.type = \"Quantifier\";\n            range.loc = this.loc(begin);\n            return range;\n        }\n    }\n    atom() {\n        let atom;\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        if (atom === undefined && this.isPatternCharacter()) {\n            atom = this.patternCharacter();\n        }\n        // istanbul ignore else\n        if (ASSERT_EXISTS(atom)) {\n            atom.loc = this.loc(begin);\n            if (this.isQuantifier()) {\n                atom.quantifier = this.quantifier();\n            }\n            return atom;\n        }\n        // istanbul ignore next\n        return ASSERT_NEVER_REACH_HERE();\n    }\n    dotAll() {\n        this.consumeChar(\".\");\n        return {\n            type: \"Set\",\n            complement: true,\n            value: [cc(\"\\n\"), cc(\"\\r\"), cc(\"\\u2028\"), cc(\"\\u2029\")],\n        };\n    }\n    atomEscape() {\n        this.consumeChar(\"\\\\\");\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    decimalEscapeAtom() {\n        const value = this.positiveInteger();\n        return { type: \"GroupBackReference\", value: value };\n    }\n    characterClassEscape() {\n        let set;\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        // 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    controlEscapeAtom() {\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        // 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    controlLetterEscapeAtom() {\n        this.consumeChar(\"c\");\n        const letter = this.popChar();\n        if (/[a-zA-Z]/.test(letter) === false) {\n            throw Error(\"Invalid \");\n        }\n        const letterCode = letter.toUpperCase().charCodeAt(0) - 64;\n        return { type: \"Character\", value: letterCode };\n    }\n    nulCharacterAtom() {\n        // TODO implement '[lookahead ∉ DecimalDigit]'\n        // TODO: for the deprecated octal escape sequence\n        this.consumeChar(\"0\");\n        return { type: \"Character\", value: cc(\"\\0\") };\n    }\n    hexEscapeSequenceAtom() {\n        this.consumeChar(\"x\");\n        return this.parseHexDigits(2);\n    }\n    regExpUnicodeEscapeSequenceAtom() {\n        this.consumeChar(\"u\");\n        return this.parseHexDigits(4);\n    }\n    identityEscapeAtom() {\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    classPatternCharacterAtom() {\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    characterClass() {\n        const set = [];\n        let complement = false;\n        this.consumeChar(\"[\");\n        if (this.peekChar(0) === \"^\") {\n            this.consumeChar(\"^\");\n            complement = true;\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                // 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                }\n                else {\n                    // literal dash\n                    insertToSet(from.value, set);\n                    set.push(cc(\"-\"));\n                    insertToSet(to.value, set);\n                }\n            }\n            else {\n                insertToSet(from.value, set);\n            }\n        }\n        this.consumeChar(\"]\");\n        return { type: \"Set\", complement: complement, value: set };\n    }\n    classAtom() {\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    classEscape() {\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    group() {\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        const groupAst = {\n            type: \"Group\",\n            capturing: capturing,\n            value: value,\n        };\n        if (capturing) {\n            groupAst[\"idx\"] = this.groupIdx;\n        }\n        return groupAst;\n    }\n    positiveInteger() {\n        let number = this.popChar();\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        while (decimalPattern.test(this.peekChar(0))) {\n            number += this.popChar();\n        }\n        return parseInt(number, 10);\n    }\n    integerIncludingZero() {\n        let number = this.popChar();\n        if (decimalPattern.test(number) === false) {\n            throw Error(\"Expecting an integer\");\n        }\n        while (decimalPattern.test(this.peekChar(0))) {\n            number += this.popChar();\n        }\n        return parseInt(number, 10);\n    }\n    patternCharacter() {\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    isRegExpFlag() {\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    isRangeDash() {\n        return this.peekChar() === \"-\" && this.isClassAtom(1);\n    }\n    isDigit() {\n        return decimalPattern.test(this.peekChar(0));\n    }\n    isClassAtom(howMuch = 0) {\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    isTerm() {\n        return this.isAtom() || this.isAssertion();\n    }\n    isAtom() {\n        if (this.isPatternCharacter()) {\n            return true;\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    isAssertion() {\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 (this.peekChar(1) === \"?\" &&\n                    (this.peekChar(2) === \"=\" ||\n                        this.peekChar(2) === \"!\" ||\n                        (this.peekChar(2) === \"<\" &&\n                            (this.peekChar(3) === \"=\" || this.peekChar(3) === \"!\"))));\n            default:\n                return false;\n        }\n    }\n    isQuantifier() {\n        const prevState = this.saveState();\n        try {\n            return this.quantifier(true) !== undefined;\n        }\n        catch (e) {\n            return false;\n        }\n        finally {\n            this.restoreState(prevState);\n        }\n    }\n    isPatternCharacter() {\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    parseHexDigits(howMany) {\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    peekChar(howMuch = 0) {\n        return this.input[this.idx + howMuch];\n    }\n    popChar() {\n        const nextChar = this.peekChar(0);\n        this.consumeChar(undefined);\n        return nextChar;\n    }\n    consumeChar(char) {\n        if (char !== undefined && this.input[this.idx] !== char) {\n            throw Error(\"Expected: '\" +\n                char +\n                \"' but found: '\" +\n                this.input[this.idx] +\n                \"' at offset: \" +\n                this.idx);\n        }\n        if (this.idx >= this.input.length) {\n            throw Error(\"Unexpected end of input\");\n        }\n        this.idx++;\n    }\n    loc(begin) {\n        return { begin: begin, end: this.idx };\n    }\n}\n//# sourceMappingURL=regexp-parser.js.map","export class BaseRegExpVisitor {\n    visitChildren(node) {\n        for (const key in node) {\n            const child = node[key];\n            /* istanbul ignore else */\n            if (node.hasOwnProperty(key)) {\n                if (child.type !== undefined) {\n                    this.visit(child);\n                }\n                else if (Array.isArray(child)) {\n                    child.forEach((subChild) => {\n                        this.visit(subChild);\n                    }, this);\n                }\n            }\n        }\n    }\n    visit(node) {\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        this.visitChildren(node);\n    }\n    visitPattern(node) { }\n    visitFlags(node) { }\n    visitDisjunction(node) { }\n    visitAlternative(node) { }\n    // Assertion\n    visitStartAnchor(node) { }\n    visitEndAnchor(node) { }\n    visitWordBoundary(node) { }\n    visitNonWordBoundary(node) { }\n    visitLookahead(node) { }\n    visitNegativeLookahead(node) { }\n    visitLookbehind(node) { }\n    visitNegativeLookbehind(node) { }\n    // atoms\n    visitCharacter(node) { }\n    visitSet(node) { }\n    visitGroup(node) { }\n    visitGroupBackReference(node) { }\n    visitQuantifier(node) { }\n}\n//# sourceMappingURL=base-regexp-visitor.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { RegExpParser, BaseRegExpVisitor } from '@chevrotain/regexp-to-ast';\nexport const NEWLINE_REGEXP = /\\r?\\n/gm;\nconst regexpParser = new RegExpParser();\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    constructor() {\n        super(...arguments);\n        this.isStarting = true;\n        this.endRegexpStack = [];\n        this.multiline = false;\n    }\n    get endRegex() {\n        return this.endRegexpStack.join('');\n    }\n    reset(regex) {\n        this.multiline = false;\n        this.regex = regex;\n        this.startRegexp = '';\n        this.isStarting = true;\n        this.endRegexpStack = [];\n    }\n    visitGroup(node) {\n        if (node.quantifier) {\n            this.isStarting = false;\n            this.endRegexpStack = [];\n        }\n    }\n    visitCharacter(node) {\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        }\n        else {\n            const escapedChar = escapeRegExp(char);\n            this.endRegexpStack.push(escapedChar);\n            if (this.isStarting) {\n                this.startRegexp += escapedChar;\n            }\n        }\n    }\n    visitSet(node) {\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        }\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    visitChildren(node) {\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;\n            if (group.quantifier) {\n                return;\n            }\n        }\n        super.visitChildren(node);\n    }\n}\nconst visitor = new TerminalRegExpVisitor();\nexport function getTerminalParts(regexp) {\n    try {\n        if (typeof regexp !== 'string') {\n            regexp = regexp.source;\n        }\n        regexp = `/${regexp}/`;\n        const pattern = regexpParser.pattern(regexp);\n        const parts = [];\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    }\n    catch {\n        return [];\n    }\n}\nexport function isMultilineComment(regexp) {\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    }\n    catch {\n        return false;\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 = ('\\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('');\nexport function isWhitespace(value) {\n    const regexp = typeof value === 'string' ? new RegExp(value) : value;\n    return whitespaceCharacters.some((ws) => regexp.test(ws));\n}\nexport function escapeRegExp(value) {\n    return value.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\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, input) {\n    const partial = partialRegExp(regex);\n    const match = input.match(partial);\n    return !!match && match[0].length > 0;\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) {\n    if (typeof regex === 'string') {\n        regex = new RegExp(regex);\n    }\n    const re = regex, source = regex.source;\n    let i = 0;\n    function process() {\n        let result = '', tmp;\n        function appendRaw(nbChars) {\n            result += source.substr(i, nbChars);\n            i += nbChars;\n        }\n        function appendOptional(nbChars) {\n            result += '(?:' + source.substr(i, nbChars) + '|$)';\n            i += nbChars;\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                                }\n                                else {\n                                    appendOptional(6);\n                                }\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                            }\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                case '[':\n                    tmp = /\\[(?:\\\\.|.)*?\\]/g;\n                    tmp.lastIndex = i;\n                    tmp = tmp.exec(source) || [];\n                    appendOptional(tmp[0].length);\n                    break;\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                    }\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                    }\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        return result;\n    }\n    return new RegExp(process(), regex.flags);\n}\n//# sourceMappingURL=regexp-utils.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { assertUnreachable } from '../utils/errors.js';\nimport * as ast from '../languages/generated/ast.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 * 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) {\n    return grammar.rules.find(e => ast.isParserRule(e) && e.entry);\n}\n/**\n * Returns all hidden terminal rules of the given grammar, if any.\n */\nexport function getHiddenRules(grammar) {\n    return grammar.rules.filter(e => ast.isTerminalRule(e) && e.hidden);\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, allTerminals) {\n    const ruleNames = new Set();\n    const entryRule = getEntryRule(grammar);\n    if (!entryRule) {\n        return new Set(grammar.rules);\n    }\n    const topMostRules = [entryRule].concat(getHiddenRules(grammar));\n    for (const rule of topMostRules) {\n        ruleDfs(rule, ruleNames, allTerminals);\n    }\n    const rules = new Set();\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}\nfunction ruleDfs(rule, visitedSet, allTerminals) {\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 * 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) {\n    const result = new Set();\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 * 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) {\n    if (crossRef.terminal) {\n        return crossRef.terminal;\n    }\n    else if (crossRef.type.ref) {\n        const nameAssigment = findNameAssignment(crossRef.type.ref);\n        return nameAssigment?.terminal;\n    }\n    return undefined;\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) {\n    return terminalRule.hidden && !isWhitespace(terminalRegex(terminalRule));\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, property) {\n    if (!node || !property) {\n        return [];\n    }\n    return findNodesForPropertyInternal(node, property, node.astNode, true);\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, property, index) {\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    }\n    else {\n        index = 0;\n    }\n    return nodes[index];\n}\nfunction findNodesForPropertyInternal(node, property, element, first) {\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 * 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, keyword) {\n    if (!node) {\n        return [];\n    }\n    return findNodesForKeywordInternal(node, keyword, node?.astNode);\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, keyword, index) {\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    }\n    else {\n        index = 0;\n    }\n    return nodes[index];\n}\nexport function findNodesForKeywordInternal(node, keyword, element) {\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;\n    const keywordNodes = [];\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            }\n            else {\n                treeIterator.prune();\n            }\n        }\n    } while (!result.done);\n    return keywordNodes;\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) {\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 * 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) {\n    let startNode = 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        }\n        else if (ast.isAbstractParserRule(startNode.$container)) {\n            // investigate the parser rule with the explicitly inferred type\n            startNode = startNode.$container;\n        }\n        else {\n            assertUnreachable(startNode.$container);\n        }\n    }\n    return findNameAssignmentInternal(type, startNode, new Map());\n}\nfunction findNameAssignmentInternal(type, startNode, cache) {\n    // the cache is only required to prevent infinite loops\n    function go(node, refType) {\n        let childAssignment = 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    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        }\n        else if (ast.isRuleCall(node) && ast.isParserRule(node.rule.ref)) {\n            return go(node, node.rule.ref);\n        }\n        else if (ast.isSimpleType(node) && node.typeRef?.ref) {\n            return go(node, node.typeRef.ref);\n        }\n    }\n    return undefined;\n}\nexport function getActionAtElement(element) {\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            }\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    }\n    else {\n        return undefined;\n    }\n}\nexport function isOptionalCardinality(cardinality, element) {\n    return cardinality === '?' || cardinality === '*' || (ast.isGroup(element) && Boolean(element.guardCondition));\n}\nexport function isArrayCardinality(cardinality) {\n    return cardinality === '*' || cardinality === '+';\n}\nexport function isArrayOperator(operator) {\n    return operator === '+=';\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) {\n    return isDataTypeRuleInternal(rule, new Set());\n}\nfunction isDataTypeRuleInternal(rule, visited) {\n    if (visited.has(rule)) {\n        return true;\n    }\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        }\n        else if (ast.isAssignment(node)) {\n            return false;\n        }\n        else if (ast.isAction(node)) {\n            return false;\n        }\n    }\n    return Boolean(rule.definition);\n}\nexport function isDataType(type) {\n    return isDataTypeInternal(type.type, new Set());\n}\nfunction isDataTypeInternal(type, visited) {\n    if (visited.has(type)) {\n        return true;\n    }\n    else {\n        visited.add(type);\n    }\n    if (ast.isArrayType(type)) {\n        return false;\n    }\n    else if (ast.isReferenceType(type)) {\n        return false;\n    }\n    else if (ast.isUnionType(type)) {\n        return type.types.every(e => isDataTypeInternal(e, visited));\n    }\n    else if (ast.isSimpleType(type)) {\n        if (type.primitiveType !== undefined) {\n            return true;\n        }\n        else if (type.stringType !== undefined) {\n            return true;\n        }\n        else if (type.typeRef !== undefined) {\n            const ref = type.typeRef.ref;\n            if (ast.isType(ref)) {\n                return isDataTypeInternal(ref.type, visited);\n            }\n            else {\n                return false;\n            }\n        }\n        else {\n            return false;\n        }\n    }\n    else {\n        return false;\n    }\n}\nexport function getExplicitRuleType(rule) {\n    if (ast.isTerminalRule(rule)) {\n        return undefined;\n    }\n    if (rule.inferredType) {\n        return rule.inferredType.name;\n    }\n    else if (rule.dataType) {\n        return rule.dataType;\n    }\n    else if (rule.returnType) {\n        const refType = rule.returnType.ref;\n        if (refType) {\n            return refType.name;\n        }\n    }\n    return undefined;\n}\nexport function getTypeName(type) {\n    if (ast.isAbstractParserRule(type)) {\n        return ast.isParserRule(type) && isDataTypeRule(type) ? type.name : getExplicitRuleType(type) ?? type.name;\n    }\n    else if (ast.isInterface(type) || ast.isType(type) || ast.isReturnType(type)) {\n        return type.name;\n    }\n    else if (ast.isAction(type)) {\n        const actionType = getActionType(type);\n        if (actionType) {\n            return actionType;\n        }\n    }\n    else if (ast.isInferredType(type)) {\n        return type.name;\n    }\n    throw new Error('Cannot get name of Unknown Type');\n}\nexport function getActionType(action) {\n    if (action.inferredType) {\n        return action.inferredType.name;\n    }\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 * 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) {\n    if (ast.isTerminalRule(rule)) {\n        return rule.type?.name ?? 'string';\n    }\n    else {\n        return ast.isParserRule(rule) && isDataTypeRule(rule) ? rule.name : getExplicitRuleType(rule) ?? rule.name;\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) {\n    if (ast.isTerminalRule(rule)) {\n        return rule.type?.name ?? 'string';\n    }\n    else {\n        return getExplicitRuleType(rule) ?? rule.name;\n    }\n}\nexport function terminalRegex(terminalRule) {\n    const 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// Using [\\s\\S]* allows to match everything, compared to . which doesn't match line terminators\nconst WILDCARD = /[\\s\\S]/.source;\nfunction abstractElementToRegex(element, flags) {\n    if (ast.isTerminalAlternatives(element)) {\n        return terminalAlternativesToRegex(element);\n    }\n    else if (ast.isTerminalGroup(element)) {\n        return terminalGroupToRegex(element);\n    }\n    else if (ast.isCharacterRange(element)) {\n        return characterRangeToRegex(element);\n    }\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    }\n    else if (ast.isNegatedToken(element)) {\n        return negateTokenToRegex(element);\n    }\n    else if (ast.isUntilToken(element)) {\n        return untilTokenToRegex(element);\n    }\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    }\n    else if (ast.isWildcard(element)) {\n        return withCardinality(WILDCARD, {\n            cardinality: element.cardinality,\n            lookahead: element.lookahead,\n            parenthesized: element.parenthesized\n        });\n    }\n    else {\n        throw new Error(`Invalid terminal element: ${element?.$type}, ${element?.$cstNode?.text}`);\n    }\n}\nfunction terminalAlternativesToRegex(alternatives) {\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}\nfunction terminalGroupToRegex(group) {\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}\nfunction untilTokenToRegex(until) {\n    return withCardinality(`${WILDCARD}*?${abstractElementToRegex(until.terminal)}`, {\n        cardinality: until.cardinality,\n        lookahead: until.lookahead,\n        parenthesized: until.parenthesized\n    });\n}\nfunction negateTokenToRegex(negate) {\n    return withCardinality(`(?!${abstractElementToRegex(negate.terminal)})${WILDCARD}*?`, {\n        cardinality: negate.cardinality,\n        lookahead: negate.lookahead,\n        parenthesized: negate.parenthesized\n    });\n}\nfunction characterRangeToRegex(range) {\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}\nfunction keywordToRegex(keyword) {\n    return escapeRegExp(keyword.value);\n}\nfunction withCardinality(regex, options) {\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//# sourceMappingURL=grammar-utils.js.map","/******************************************************************************\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 ******************************************************************************/\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/**\n * Create the default grammar configuration (used by `createDefaultModule`). This can be overridden in a\n * language-specific module.\n */\nexport function createGrammarConfig(services) {\n    const rules = [];\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//# sourceMappingURL=grammar-config.js.map","export function PRINT_ERROR(msg) {\n    /* istanbul ignore else - can't override global.console in node.js */\n    if (console && console.error) {\n        console.error(`Error: ${msg}`);\n    }\n}\nexport function PRINT_WARNING(msg) {\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//# sourceMappingURL=print.js.map","export function timer(func) {\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//# sourceMappingURL=timer.js.map","// based on: https://github.com/petkaantonov/bluebird/blob/b97c0d2d487e8c5076e8bd897e0dcd4622d31846/src/util.js#L201-L216\nexport function toFastProperties(toBecomeFast) {\n    function FakeConstructor() { }\n    // If our object is used as a constructor, it would receive\n    FakeConstructor.prototype = toBecomeFast;\n    const fakeInstance = new FakeConstructor();\n    function fakeAccess() {\n        return typeof fakeInstance.bar;\n    }\n    // help V8 understand this is a \"real\" prototype by actually using\n    // the fake instance.\n    fakeAccess();\n    fakeAccess();\n    // Always true condition to suppress the Firefox warning of unreachable\n    // code after a return statement.\n    if (1)\n        return toBecomeFast;\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//# sourceMappingURL=to-fast-properties.js.map","import { assign, forEach, isRegExp, isString, map, pickBy } from \"lodash-es\";\n// TODO: duplicated code to avoid extracting another sub-package -- how to avoid?\nfunction tokenLabel(tokType) {\n    if (hasTokenLabel(tokType)) {\n        return tokType.LABEL;\n    }\n    else {\n        return tokType.name;\n    }\n}\n// TODO: duplicated code to avoid extracting another sub-package -- how to avoid?\nfunction hasTokenLabel(obj) {\n    return isString(obj.LABEL) && obj.LABEL !== \"\";\n}\nexport class AbstractProduction {\n    get definition() {\n        return this._definition;\n    }\n    set definition(value) {\n        this._definition = value;\n    }\n    constructor(_definition) {\n        this._definition = _definition;\n    }\n    accept(visitor) {\n        visitor.visit(this);\n        forEach(this.definition, (prod) => {\n            prod.accept(visitor);\n        });\n    }\n}\nexport class NonTerminal extends AbstractProduction {\n    constructor(options) {\n        super([]);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n    set definition(definition) {\n        // immutable\n    }\n    get definition() {\n        if (this.referencedRule !== undefined) {\n            return this.referencedRule.definition;\n        }\n        return [];\n    }\n    accept(visitor) {\n        visitor.visit(this);\n        // don't visit children of a reference, we will get cyclic infinite loops if we do so\n    }\n}\nexport class Rule extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.orgText = \"\";\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Alternative extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.ignoreAmbiguities = false;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Option extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class RepetitionMandatory extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class RepetitionMandatoryWithSeparator extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Repetition extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class RepetitionWithSeparator extends AbstractProduction {\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Alternation extends AbstractProduction {\n    get definition() {\n        return this._definition;\n    }\n    set definition(value) {\n        this._definition = value;\n    }\n    constructor(options) {\n        super(options.definition);\n        this.idx = 1;\n        this.ignoreAmbiguities = false;\n        this.hasPredicates = false;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n}\nexport class Terminal {\n    constructor(options) {\n        this.idx = 1;\n        assign(this, pickBy(options, (v) => v !== undefined));\n    }\n    accept(visitor) {\n        visitor.visit(this);\n    }\n}\nexport function serializeGrammar(topRules) {\n    return map(topRules, serializeProduction);\n}\nexport function serializeProduction(node) {\n    function convertDefinition(definition) {\n        return map(definition, serializeProduction);\n    }\n    /* istanbul ignore else */\n    if (node instanceof NonTerminal) {\n        const serializedNonTerminal = {\n            type: \"NonTerminal\",\n            name: node.nonTerminalName,\n            idx: node.idx,\n        };\n        if (isString(node.label)) {\n            serializedNonTerminal.label = node.label;\n        }\n        return serializedNonTerminal;\n    }\n    else if (node instanceof Alternative) {\n        return {\n            type: \"Alternative\",\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof Option) {\n        return {\n            type: \"Option\",\n            idx: node.idx,\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof RepetitionMandatory) {\n        return {\n            type: \"RepetitionMandatory\",\n            idx: node.idx,\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof RepetitionMandatoryWithSeparator) {\n        return {\n            type: \"RepetitionMandatoryWithSeparator\",\n            idx: node.idx,\n            separator: (serializeProduction(new Terminal({ terminalType: node.separator }))),\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof RepetitionWithSeparator) {\n        return {\n            type: \"RepetitionWithSeparator\",\n            idx: node.idx,\n            separator: (serializeProduction(new Terminal({ terminalType: node.separator }))),\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof Repetition) {\n        return {\n            type: \"Repetition\",\n            idx: node.idx,\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof Alternation) {\n        return {\n            type: \"Alternation\",\n            idx: node.idx,\n            definition: convertDefinition(node.definition),\n        };\n    }\n    else if (node instanceof Terminal) {\n        const serializedTerminal = {\n            type: \"Terminal\",\n            name: node.terminalType.name,\n            label: tokenLabel(node.terminalType),\n            idx: node.idx,\n        };\n        if (isString(node.label)) {\n            serializedTerminal.terminalLabel = node.label;\n        }\n        const pattern = node.terminalType.PATTERN;\n        if (node.terminalType.PATTERN) {\n            serializedTerminal.pattern = isRegExp(pattern)\n                ? pattern.source\n                : pattern;\n        }\n        return serializedTerminal;\n    }\n    else if (node instanceof Rule) {\n        return {\n            type: \"Rule\",\n            name: node.name,\n            orgText: node.orgText,\n            definition: convertDefinition(node.definition),\n        };\n        /* c8 ignore next 3 */\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\n//# sourceMappingURL=model.js.map","import { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Rule, Terminal, } from \"./model.js\";\nexport class GAstVisitor {\n    visit(node) {\n        const nodeAny = 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    /* c8 ignore next */\n    visitNonTerminal(node) { }\n    /* c8 ignore next */\n    visitAlternative(node) { }\n    /* c8 ignore next */\n    visitOption(node) { }\n    /* c8 ignore next */\n    visitRepetition(node) { }\n    /* c8 ignore next */\n    visitRepetitionMandatory(node) { }\n    /* c8 ignore next 3 */\n    visitRepetitionMandatoryWithSeparator(node) { }\n    /* c8 ignore next */\n    visitRepetitionWithSeparator(node) { }\n    /* c8 ignore next */\n    visitAlternation(node) { }\n    /* c8 ignore next */\n    visitTerminal(node) { }\n    /* c8 ignore next */\n    visitRule(node) { }\n}\n//# sourceMappingURL=visitor.js.map","import { every, includes, some } from \"lodash-es\";\nimport { AbstractProduction, Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Rule, Terminal, } from \"./model.js\";\nexport function isSequenceProd(prod) {\n    return (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}\nexport function isOptionalProd(prod, alreadyVisited = []) {\n    const isDirectlyOptional = prod instanceof Option ||\n        prod instanceof Repetition ||\n        prod instanceof RepetitionWithSeparator;\n    if (isDirectlyOptional) {\n        return true;\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 some(prod.definition, (subProd) => {\n            return isOptionalProd(subProd, alreadyVisited);\n        });\n    }\n    else if (prod instanceof NonTerminal && includes(alreadyVisited, prod)) {\n        // avoiding stack overflow due to infinite recursion\n        return false;\n    }\n    else if (prod instanceof AbstractProduction) {\n        if (prod instanceof NonTerminal) {\n            alreadyVisited.push(prod);\n        }\n        return every(prod.definition, (subProd) => {\n            return isOptionalProd(subProd, alreadyVisited);\n        });\n    }\n    else {\n        return false;\n    }\n}\nexport function isBranchingProd(prod) {\n    return prod instanceof Alternation;\n}\nexport function getProductionDslName(prod) {\n    /* istanbul ignore else */\n    if (prod instanceof NonTerminal) {\n        return \"SUBRULE\";\n    }\n    else if (prod instanceof Option) {\n        return \"OPTION\";\n    }\n    else if (prod instanceof Alternation) {\n        return \"OR\";\n    }\n    else if (prod instanceof RepetitionMandatory) {\n        return \"AT_LEAST_ONE\";\n    }\n    else if (prod instanceof RepetitionMandatoryWithSeparator) {\n        return \"AT_LEAST_ONE_SEP\";\n    }\n    else if (prod instanceof RepetitionWithSeparator) {\n        return \"MANY_SEP\";\n    }\n    else if (prod instanceof Repetition) {\n        return \"MANY\";\n    }\n    else if (prod instanceof Terminal) {\n        return \"CONSUME\";\n        /* c8 ignore next 3 */\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\n//# sourceMappingURL=helpers.js.map","import { drop, forEach } from \"lodash-es\";\nimport { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Terminal, } from \"@chevrotain/gast\";\n/**\n *  A Grammar Walker that computes the \"remaining\" grammar \"after\" a productions in the grammar.\n */\nexport class RestWalker {\n    walk(prod, prevRest = []) {\n        forEach(prod.definition, (subProd, index) => {\n            const currRest = drop(prod.definition, index + 1);\n            /* istanbul ignore else */\n            if (subProd instanceof NonTerminal) {\n                this.walkProdRef(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Terminal) {\n                this.walkTerminal(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Alternative) {\n                this.walkFlat(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Option) {\n                this.walkOption(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof RepetitionMandatory) {\n                this.walkAtLeastOne(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof RepetitionMandatoryWithSeparator) {\n                this.walkAtLeastOneSep(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof RepetitionWithSeparator) {\n                this.walkManySep(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Repetition) {\n                this.walkMany(subProd, currRest, prevRest);\n            }\n            else if (subProd instanceof Alternation) {\n                this.walkOr(subProd, currRest, prevRest);\n            }\n            else {\n                throw Error(\"non exhaustive match\");\n            }\n        });\n    }\n    walkTerminal(terminal, currRest, prevRest) { }\n    walkProdRef(refProd, currRest, prevRest) { }\n    walkFlat(flatProd, currRest, prevRest) {\n        // ABCDEF => after the D the rest is EF\n        const fullOrRest = currRest.concat(prevRest);\n        this.walk(flatProd, fullOrRest);\n    }\n    walkOption(optionProd, currRest, prevRest) {\n        // ABC(DE)?F => after the (DE)? the rest is F\n        const fullOrRest = currRest.concat(prevRest);\n        this.walk(optionProd, fullOrRest);\n    }\n    walkAtLeastOne(atLeastOneProd, currRest, prevRest) {\n        // ABC(DE)+F => after the (DE)+ the rest is (DE)?F\n        const fullAtLeastOneRest = [\n            new Option({ definition: atLeastOneProd.definition }),\n        ].concat(currRest, prevRest);\n        this.walk(atLeastOneProd, fullAtLeastOneRest);\n    }\n    walkAtLeastOneSep(atLeastOneSepProd, currRest, prevRest) {\n        // ABC DE(,DE)* F => after the (,DE)+ the rest is (,DE)?F\n        const fullAtLeastOneSepRest = restForRepetitionWithSeparator(atLeastOneSepProd, currRest, prevRest);\n        this.walk(atLeastOneSepProd, fullAtLeastOneSepRest);\n    }\n    walkMany(manyProd, currRest, prevRest) {\n        // ABC(DE)*F => after the (DE)* the rest is (DE)?F\n        const fullManyRest = [\n            new Option({ definition: manyProd.definition }),\n        ].concat(currRest, prevRest);\n        this.walk(manyProd, fullManyRest);\n    }\n    walkManySep(manySepProd, currRest, prevRest) {\n        // ABC (DE(,DE)*)? F => after the (,DE)* the rest is (,DE)?F\n        const fullManySepRest = restForRepetitionWithSeparator(manySepProd, currRest, prevRest);\n        this.walk(manySepProd, fullManySepRest);\n    }\n    walkOr(orProd, currRest, prevRest) {\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        forEach(orProd.definition, (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, fullOrRest);\n        });\n    }\n}\nfunction restForRepetitionWithSeparator(repSepProd, currRest, prevRest) {\n    const repSepRest = [\n        new Option({\n            definition: [\n                new Terminal({ terminalType: repSepProd.separator }),\n            ].concat(repSepProd.definition),\n        }),\n    ];\n    const fullRepSepRest = repSepRest.concat(currRest, prevRest);\n    return fullRepSepRest;\n}\n//# sourceMappingURL=rest.js.map","import { flatten, map, uniq } from \"lodash-es\";\nimport { isBranchingProd, isOptionalProd, isSequenceProd, NonTerminal, Terminal, } from \"@chevrotain/gast\";\nexport function first(prod) {\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(prod.referencedRule);\n    }\n    else if (prod instanceof Terminal) {\n        return firstForTerminal(prod);\n    }\n    else if (isSequenceProd(prod)) {\n        return firstForSequence(prod);\n    }\n    else if (isBranchingProd(prod)) {\n        return firstForBranching(prod);\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nexport function firstForSequence(prod) {\n    let firstSet = [];\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    return uniq(firstSet);\n}\nexport function firstForBranching(prod) {\n    const allAlternativesFirsts = map(prod.definition, (innerProd) => {\n        return first(innerProd);\n    });\n    return uniq(flatten(allAlternativesFirsts));\n}\nexport function firstForTerminal(terminal) {\n    return [terminal.terminalType];\n}\n//# sourceMappingURL=first.js.map","// TODO: can this be removed? where is it used?\nexport const IN = \"_~IN~_\";\n//# sourceMappingURL=constants.js.map","import { RestWalker } from \"./rest.js\";\nimport { first } from \"./first.js\";\nimport { assign, forEach } from \"lodash-es\";\nimport { IN } from \"../constants.js\";\nimport { Alternative } from \"@chevrotain/gast\";\n// This ResyncFollowsWalker computes all of the follows required for RESYNC\n// (skipping reference production).\nexport class ResyncFollowsWalker extends RestWalker {\n    constructor(topProd) {\n        super();\n        this.topProd = topProd;\n        this.follows = {};\n    }\n    startWalking() {\n        this.walk(this.topProd);\n        return this.follows;\n    }\n    walkTerminal(terminal, currRest, prevRest) {\n        // do nothing! just like in the public sector after 13:00\n    }\n    walkProdRef(refProd, currRest, prevRest) {\n        const followName = buildBetweenProdsFollowPrefix(refProd.referencedRule, refProd.idx) +\n            this.topProd.name;\n        const fullRest = 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}\nexport function computeAllProdsFollows(topProductions) {\n    const reSyncFollows = {};\n    forEach(topProductions, (topProd) => {\n        const currRefsFollow = new ResyncFollowsWalker(topProd).startWalking();\n        assign(reSyncFollows, currRefsFollow);\n    });\n    return reSyncFollows;\n}\nexport function buildBetweenProdsFollowPrefix(inner, occurenceInParent) {\n    return inner.name + occurenceInParent + IN;\n}\nexport function buildInProdFollowPrefix(terminal) {\n    const terminalName = terminal.terminalType.name;\n    return terminalName + terminal.idx + IN;\n}\n//# sourceMappingURL=follow.js.map","import { RegExpParser, } from \"@chevrotain/regexp-to-ast\";\nlet regExpAstCache = {};\nconst regExpParser = new RegExpParser();\nexport function getRegExpAst(regExp) {\n    const regExpStr = regExp.toString();\n    if (regExpAstCache.hasOwnProperty(regExpStr)) {\n        return regExpAstCache[regExpStr];\n    }\n    else {\n        const regExpAst = regExpParser.pattern(regExpStr);\n        regExpAstCache[regExpStr] = regExpAst;\n        return regExpAst;\n    }\n}\nexport function clearRegExpParserCache() {\n    regExpAstCache = {};\n}\n//# sourceMappingURL=reg_exp_parser.js.map","import { BaseRegExpVisitor, } from \"@chevrotain/regexp-to-ast\";\nimport { every, find, forEach, includes, isArray, values } from \"lodash-es\";\nimport { PRINT_ERROR, PRINT_WARNING } from \"@chevrotain/utils\";\nimport { getRegExpAst } from \"./reg_exp_parser.js\";\nimport { charCodeToOptimizedIndex, minOptimizationVal } from \"./lexer.js\";\nconst complementErrorMessage = \"Complement Sets are not supported for first char optimization\";\nexport const failedOptimizationPrefixMsg = 'Unable to use \"first char\" lexer optimizations:\\n';\nexport function getOptimizedStartCodesIndices(regExp, ensureOptimizations = false) {\n    try {\n        const ast = getRegExpAst(regExp);\n        const firstChars = firstCharOptimizedIndices(ast.value, {}, ast.flags.ignoreCase);\n        return firstChars;\n    }\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(`${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(`${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    return [];\n}\nexport function firstCharOptimizedIndices(ast, result, ignoreCase) {\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                // 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                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                        forEach(atom.value, (code) => {\n                            if (typeof code === \"number\") {\n                                addOptimizedIdxToResult(code, result, ignoreCase);\n                            }\n                            else {\n                                // range\n                                const range = code;\n                                // cannot optimize when ignoreCase is\n                                if (ignoreCase === true) {\n                                    for (let rangeCode = range.from; rangeCode <= range.to; rangeCode++) {\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 (let rangeCode = range.from; rangeCode <= range.to && rangeCode < minOptimizationVal; rangeCode++) {\n                                        addOptimizedIdxToResult(rangeCode, result, ignoreCase);\n                                    }\n                                    // Less common charCode where we optimize for faster init time, by using larger \"buckets\"\n                                    if (range.to >= minOptimizationVal) {\n                                        const minUnOptVal = range.from >= minOptimizationVal\n                                            ? range.from\n                                            : minOptimizationVal;\n                                        const maxUnOptVal = range.to;\n                                        const minOptIdx = charCodeToOptimizedIndex(minUnOptVal);\n                                        const maxOptIdx = charCodeToOptimizedIndex(maxUnOptVal);\n                                        for (let currOptIdx = minOptIdx; currOptIdx <= maxOptIdx; currOptIdx++) {\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                // reached a mandatory production, no more **start** codes can be found on this alternative\n                const isOptionalQuantifier = 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                    break;\n                }\n            }\n            break;\n        /* istanbul ignore next */\n        default:\n            throw Error(\"non exhaustive match!\");\n    }\n    // console.log(Object.keys(result).length)\n    return values(result);\n}\nfunction addOptimizedIdxToResult(code, result, ignoreCase) {\n    const optimizedCharIdx = charCodeToOptimizedIndex(code);\n    result[optimizedCharIdx] = optimizedCharIdx;\n    if (ignoreCase === true) {\n        handleIgnoreCase(code, result);\n    }\n}\nfunction handleIgnoreCase(code, result) {\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    }\n    else {\n        const lowerChar = char.toLowerCase();\n        if (lowerChar !== char) {\n            const optimizedCharIdx = charCodeToOptimizedIndex(lowerChar.charCodeAt(0));\n            result[optimizedCharIdx] = optimizedCharIdx;\n        }\n    }\n}\nfunction findCode(setNode, targetCharCodes) {\n    return find(setNode.value, (codeOrRange) => {\n        if (typeof codeOrRange === \"number\") {\n            return includes(targetCharCodes, codeOrRange);\n        }\n        else {\n            // range\n            const range = codeOrRange;\n            return (find(targetCharCodes, (targetCode) => range.from <= targetCode && targetCode <= range.to) !== undefined);\n        }\n    });\n}\nfunction isWholeOptional(ast) {\n    const quantifier = ast.quantifier;\n    if (quantifier && quantifier.atLeast === 0) {\n        return true;\n    }\n    if (!ast.value) {\n        return false;\n    }\n    return isArray(ast.value)\n        ? every(ast.value, isWholeOptional)\n        : isWholeOptional(ast.value);\n}\nclass CharCodeFinder extends BaseRegExpVisitor {\n    constructor(targetCharCodes) {\n        super();\n        this.targetCharCodes = targetCharCodes;\n        this.found = false;\n    }\n    visitChildren(node) {\n        // No need to keep looking...\n        if (this.found === true) {\n            return;\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        super.visitChildren(node);\n    }\n    visitCharacter(node) {\n        if (includes(this.targetCharCodes, node.value)) {\n            this.found = true;\n        }\n    }\n    visitSet(node) {\n        if (node.complement) {\n            if (findCode(node, this.targetCharCodes) === undefined) {\n                this.found = true;\n            }\n        }\n        else {\n            if (findCode(node, this.targetCharCodes) !== undefined) {\n                this.found = true;\n            }\n        }\n    }\n}\nexport function canMatchCharCode(charCodes, pattern) {\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    }\n    else {\n        return (find(pattern, (char) => {\n            return includes(charCodes, char.charCodeAt(0));\n        }) !== undefined);\n    }\n}\n//# sourceMappingURL=reg_exp.js.map","import { BaseRegExpVisitor } from \"@chevrotain/regexp-to-ast\";\nimport { Lexer, LexerDefinitionErrorType, } from \"./lexer_public.js\";\nimport { compact, defaults, difference, filter, find, first, flatten, forEach, has, includes, indexOf, isArray, isEmpty, isFunction, isRegExp, isString, isUndefined, keys, map, reduce, reject, values, } from \"lodash-es\";\nimport { PRINT_ERROR } from \"@chevrotain/utils\";\nimport { canMatchCharCode, failedOptimizationPrefixMsg, getOptimizedStartCodesIndices, } from \"./reg_exp.js\";\nimport { getRegExpAst } from \"./reg_exp_parser.js\";\nconst PATTERN = \"PATTERN\";\nexport const DEFAULT_MODE = \"defaultMode\";\nexport const MODES = \"modes\";\nexport function analyzeTokenTypes(tokenTypes, options) {\n    options = defaults(options, {\n        debug: false,\n        safeMode: false,\n        positionTracking: \"full\",\n        lineTerminatorCharacters: [\"\\r\", \"\\n\"],\n        tracer: (msg, action) => action(),\n    });\n    const tracer = options.tracer;\n    tracer(\"initCharCodeToOptimizedIndexMap\", () => {\n        initCharCodeToOptimizedIndexMap();\n    });\n    let onlyRelevantTypes;\n    tracer(\"Reject Lexer.NA\", () => {\n        onlyRelevantTypes = reject(tokenTypes, (currType) => {\n            return currType[PATTERN] === Lexer.NA;\n        });\n    });\n    let hasCustom = false;\n    let allTransformedPatterns;\n    tracer(\"Transform Patterns\", () => {\n        hasCustom = false;\n        allTransformedPatterns = map(onlyRelevantTypes, (currType) => {\n            const currPattern = currType[PATTERN];\n            /* istanbul ignore else */\n            if (isRegExp(currPattern)) {\n                const regExpSource = currPattern.source;\n                if (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                    return regExpSource;\n                }\n                else if (regExpSource.length === 2 &&\n                    regExpSource[0] === \"\\\\\" &&\n                    // not a meta character\n                    !includes([\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                    ], regExpSource[1])) {\n                    // escaped meta Characters: /\\+/ /\\[/\n                    // or redundant escaping: /\\a/\n                    // without the escaping \"\\\"\n                    return regExpSource[1];\n                }\n                else {\n                    return addStickyFlag(currPattern);\n                }\n            }\n            else if (isFunction(currPattern)) {\n                hasCustom = true;\n                // CustomPatternMatcherFunc - custom patterns do not require any transformations, only wrapping in a RegExp Like object\n                return { exec: currPattern };\n            }\n            else if (typeof currPattern === \"object\") {\n                hasCustom = true;\n                // ICustomPattern\n                return currPattern;\n            }\n            else if (typeof currPattern === \"string\") {\n                if (currPattern.length === 1) {\n                    return currPattern;\n                }\n                else {\n                    const escapedRegExpString = currPattern.replace(/[\\\\^$.*+?()[\\]{}|]/g, \"\\\\$&\");\n                    const wrappedRegExp = new RegExp(escapedRegExpString);\n                    return addStickyFlag(wrappedRegExp);\n                }\n            }\n            else {\n                throw Error(\"non exhaustive match\");\n            }\n        });\n    });\n    let patternIdxToType;\n    let patternIdxToGroup;\n    let patternIdxToLongerAltIdxArr;\n    let patternIdxToPushMode;\n    let patternIdxToPopMode;\n    tracer(\"misc mapping\", () => {\n        patternIdxToType = map(onlyRelevantTypes, (currType) => currType.tokenTypeIdx);\n        patternIdxToGroup = map(onlyRelevantTypes, (clazz) => {\n            const groupName = clazz.GROUP;\n            /* istanbul ignore next */\n            if (groupName === Lexer.SKIPPED) {\n                return undefined;\n            }\n            else if (isString(groupName)) {\n                return groupName;\n            }\n            else if (isUndefined(groupName)) {\n                return false;\n            }\n            else {\n                throw Error(\"non exhaustive match\");\n            }\n        });\n        patternIdxToLongerAltIdxArr = map(onlyRelevantTypes, (clazz) => {\n            const longerAltType = clazz.LONGER_ALT;\n            if (longerAltType) {\n                const longerAltIdxArr = isArray(longerAltType)\n                    ? map(longerAltType, (type) => indexOf(onlyRelevantTypes, type))\n                    : [indexOf(onlyRelevantTypes, longerAltType)];\n                return longerAltIdxArr;\n            }\n        });\n        patternIdxToPushMode = map(onlyRelevantTypes, (clazz) => clazz.PUSH_MODE);\n        patternIdxToPopMode = map(onlyRelevantTypes, (clazz) => has(clazz, \"POP_MODE\"));\n    });\n    let patternIdxToCanLineTerminator;\n    tracer(\"Line Terminator Handling\", () => {\n        const lineTerminatorCharCodes = getCharCodes(options.lineTerminatorCharacters);\n        patternIdxToCanLineTerminator = map(onlyRelevantTypes, (tokType) => false);\n        if (options.positionTracking !== \"onlyOffset\") {\n            patternIdxToCanLineTerminator = map(onlyRelevantTypes, (tokType) => {\n                if (has(tokType, \"LINE_BREAKS\")) {\n                    return !!tokType.LINE_BREAKS;\n                }\n                else {\n                    return (checkLineBreaksIssues(tokType, lineTerminatorCharCodes) === false &&\n                        canMatchCharCode(lineTerminatorCharCodes, tokType.PATTERN));\n                }\n            });\n        }\n    });\n    let patternIdxToIsCustom;\n    let patternIdxToShort;\n    let emptyGroups;\n    let patternIdxToConfig;\n    tracer(\"Misc Mapping #2\", () => {\n        patternIdxToIsCustom = map(onlyRelevantTypes, isCustomPattern);\n        patternIdxToShort = map(allTransformedPatterns, isShortPattern);\n        emptyGroups = reduce(onlyRelevantTypes, (acc, clazz) => {\n            const groupName = clazz.GROUP;\n            if (isString(groupName) && !(groupName === Lexer.SKIPPED)) {\n                acc[groupName] = [];\n            }\n            return acc;\n        }, {});\n        patternIdxToConfig = map(allTransformedPatterns, (x, idx) => {\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    let canBeOptimized = true;\n    let charCodeToPatternIdxToConfig = [];\n    if (!options.safeMode) {\n        tracer(\"First Char Optimization\", () => {\n            charCodeToPatternIdxToConfig = reduce(onlyRelevantTypes, (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                }\n                else if (isArray(currTokType.START_CHARS_HINT)) {\n                    let lastOptimizedIdx;\n                    forEach(currTokType.START_CHARS_HINT, (charOrInt) => {\n                        const charCode = 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(result, currOptimizedIdx, patternIdxToConfig[idx]);\n                        }\n                    });\n                }\n                else if (isRegExp(currTokType.PATTERN)) {\n                    if (currTokType.PATTERN.unicode) {\n                        canBeOptimized = false;\n                        if (options.ensureOptimizations) {\n                            PRINT_ERROR(`${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(currTokType.PATTERN, options.ensureOptimizations);\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 (isEmpty(optimizedCodes)) {\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                        forEach(optimizedCodes, (code) => {\n                            addToMapOfArrays(result, code, patternIdxToConfig[idx]);\n                        });\n                    }\n                }\n                else {\n                    if (options.ensureOptimizations) {\n                        PRINT_ERROR(`${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                    canBeOptimized = false;\n                }\n                return result;\n            }, []);\n        });\n    }\n    return {\n        emptyGroups: emptyGroups,\n        patternIdxToConfig: patternIdxToConfig,\n        charCodeToPatternIdxToConfig: charCodeToPatternIdxToConfig,\n        hasCustom: hasCustom,\n        canBeOptimized: canBeOptimized,\n    };\n}\nexport function validatePatterns(tokenTypes, validModesNames) {\n    let errors = [];\n    const missingResult = findMissingPatterns(tokenTypes);\n    errors = errors.concat(missingResult.errors);\n    const invalidResult = findInvalidPatterns(missingResult.valid);\n    const validTokenTypes = invalidResult.valid;\n    errors = errors.concat(invalidResult.errors);\n    errors = errors.concat(validateRegExpPattern(validTokenTypes));\n    errors = errors.concat(findInvalidGroupType(validTokenTypes));\n    errors = errors.concat(findModesThatDoNotExist(validTokenTypes, validModesNames));\n    errors = errors.concat(findUnreachablePatterns(validTokenTypes));\n    return errors;\n}\nfunction validateRegExpPattern(tokenTypes) {\n    let errors = [];\n    const withRegExpPatterns = filter(tokenTypes, (currTokType) => isRegExp(currTokType[PATTERN]));\n    errors = errors.concat(findEndOfInputAnchor(withRegExpPatterns));\n    errors = errors.concat(findStartOfInputAnchor(withRegExpPatterns));\n    errors = errors.concat(findUnsupportedFlags(withRegExpPatterns));\n    errors = errors.concat(findDuplicatePatterns(withRegExpPatterns));\n    errors = errors.concat(findEmptyMatchRegExps(withRegExpPatterns));\n    return errors;\n}\nexport function findMissingPatterns(tokenTypes) {\n    const tokenTypesWithMissingPattern = filter(tokenTypes, (currType) => {\n        return !has(currType, PATTERN);\n    });\n    const errors = map(tokenTypesWithMissingPattern, (currType) => {\n        return {\n            message: \"Token Type: ->\" +\n                currType.name +\n                \"<- missing static 'PATTERN' property\",\n            type: LexerDefinitionErrorType.MISSING_PATTERN,\n            tokenTypes: [currType],\n        };\n    });\n    const valid = difference(tokenTypes, tokenTypesWithMissingPattern);\n    return { errors, valid };\n}\nexport function findInvalidPatterns(tokenTypes) {\n    const tokenTypesWithInvalidPattern = filter(tokenTypes, (currType) => {\n        const pattern = currType[PATTERN];\n        return (!isRegExp(pattern) &&\n            !isFunction(pattern) &&\n            !has(pattern, \"exec\") &&\n            !isString(pattern));\n    });\n    const errors = map(tokenTypesWithInvalidPattern, (currType) => {\n        return {\n            message: \"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    const valid = difference(tokenTypes, tokenTypesWithInvalidPattern);\n    return { errors, valid };\n}\nconst end_of_input = /[^\\\\][$]/;\nexport function findEndOfInputAnchor(tokenTypes) {\n    class EndAnchorFinder extends BaseRegExpVisitor {\n        constructor() {\n            super(...arguments);\n            this.found = false;\n        }\n        visitEndAnchor(node) {\n            this.found = true;\n        }\n    }\n    const invalidRegex = filter(tokenTypes, (currType) => {\n        const pattern = currType.PATTERN;\n        try {\n            const regexpAst = getRegExpAst(pattern);\n            const endAnchorVisitor = new EndAnchorFinder();\n            endAnchorVisitor.visit(regexpAst);\n            return endAnchorVisitor.found;\n        }\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.source);\n        }\n    });\n    const errors = map(invalidRegex, (currType) => {\n        return {\n            message: \"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    return errors;\n}\nexport function findEmptyMatchRegExps(tokenTypes) {\n    const matchesEmptyString = filter(tokenTypes, (currType) => {\n        const pattern = currType.PATTERN;\n        return pattern.test(\"\");\n    });\n    const errors = map(matchesEmptyString, (currType) => {\n        return {\n            message: \"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    return errors;\n}\nconst start_of_input = /[^\\\\[][\\^]|^\\^/;\nexport function findStartOfInputAnchor(tokenTypes) {\n    class StartAnchorFinder extends BaseRegExpVisitor {\n        constructor() {\n            super(...arguments);\n            this.found = false;\n        }\n        visitStartAnchor(node) {\n            this.found = true;\n        }\n    }\n    const invalidRegex = filter(tokenTypes, (currType) => {\n        const pattern = currType.PATTERN;\n        try {\n            const regexpAst = getRegExpAst(pattern);\n            const startAnchorVisitor = new StartAnchorFinder();\n            startAnchorVisitor.visit(regexpAst);\n            return startAnchorVisitor.found;\n        }\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    const errors = map(invalidRegex, (currType) => {\n        return {\n            message: \"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    return errors;\n}\nexport function findUnsupportedFlags(tokenTypes) {\n    const invalidFlags = filter(tokenTypes, (currType) => {\n        const pattern = currType[PATTERN];\n        return pattern instanceof RegExp && (pattern.multiline || pattern.global);\n    });\n    const errors = map(invalidFlags, (currType) => {\n        return {\n            message: \"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    return errors;\n}\n// This can only test for identical duplicate RegExps, not semantically equivalent ones.\nexport function findDuplicatePatterns(tokenTypes) {\n    const found = [];\n    let identicalPatterns = map(tokenTypes, (outerType) => {\n        return reduce(tokenTypes, (result, innerType) => {\n            if (outerType.PATTERN.source === innerType.PATTERN.source &&\n                !includes(found, innerType) &&\n                innerType.PATTERN !== Lexer.NA) {\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        }, []);\n    });\n    identicalPatterns = compact(identicalPatterns);\n    const duplicatePatterns = filter(identicalPatterns, (currIdenticalSet) => {\n        return currIdenticalSet.length > 1;\n    });\n    const errors = map(duplicatePatterns, (setOfIdentical) => {\n        const tokenTypeNames = map(setOfIdentical, (currType) => {\n            return currType.name;\n        });\n        const dupPatternSrc = first(setOfIdentical).PATTERN;\n        return {\n            message: `The same RegExp pattern ->${dupPatternSrc}<-` +\n                `has been used in all of the following Token Types: ${tokenTypeNames.join(\", \")} <-`,\n            type: LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,\n            tokenTypes: setOfIdentical,\n        };\n    });\n    return errors;\n}\nexport function findInvalidGroupType(tokenTypes) {\n    const invalidTypes = filter(tokenTypes, (clazz) => {\n        if (!has(clazz, \"GROUP\")) {\n            return false;\n        }\n        const group = clazz.GROUP;\n        return group !== Lexer.SKIPPED && group !== Lexer.NA && !isString(group);\n    });\n    const errors = map(invalidTypes, (currType) => {\n        return {\n            message: \"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    return errors;\n}\nexport function findModesThatDoNotExist(tokenTypes, validModes) {\n    const invalidModes = filter(tokenTypes, (clazz) => {\n        return (clazz.PUSH_MODE !== undefined && !includes(validModes, clazz.PUSH_MODE));\n    });\n    const errors = map(invalidModes, (tokType) => {\n        const msg = `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    return errors;\n}\nexport function findUnreachablePatterns(tokenTypes) {\n    const errors = [];\n    const canBeTested = reduce(tokenTypes, (result, tokType, idx) => {\n        const pattern = tokType.PATTERN;\n        if (pattern === Lexer.NA) {\n            return result;\n        }\n        // a more comprehensive validation for all forms of regExps would require\n        // deeper regExp analysis capabilities\n        if (isString(pattern)) {\n            result.push({ str: pattern, idx, tokenType: tokType });\n        }\n        else if (isRegExp(pattern) && noMetaChar(pattern)) {\n            result.push({ str: pattern.source, idx, tokenType: tokType });\n        }\n        return result;\n    }, []);\n    forEach(tokenTypes, (aTokType, aIdx) => {\n        forEach(canBeTested, ({ str: bStr, idx: bIdx, tokenType: bTokType }) => {\n            if (aIdx < bIdx && tryToMatchStrToPattern(bStr, aTokType.PATTERN)) {\n                const msg = `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    return errors;\n}\nfunction tryToMatchStrToPattern(str, pattern) {\n    if (isRegExp(pattern)) {\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    }\n    else if (isFunction(pattern)) {\n        // maintain the API of custom patterns\n        return pattern(str, 0, [], {});\n    }\n    else if (has(pattern, \"exec\")) {\n        // maintain the API of custom patterns\n        return pattern.exec(str, 0, [], {});\n    }\n    else if (typeof pattern === \"string\") {\n        return pattern === str;\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nfunction noMetaChar(regExp) {\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 (find(metaChars, (char) => regExp.source.indexOf(char) !== -1) === undefined);\n}\nfunction usesLookAheadOrBehind(regExp) {\n    return /(\\(\\?=)|(\\(\\?!)|(\\(\\?<=)|(\\(\\?<!)/.test(regExp.source);\n}\nexport function addStartOfInput(pattern) {\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}\nexport function addStickyFlag(pattern) {\n    const flags = pattern.ignoreCase ? \"iy\" : \"y\";\n    return new RegExp(`${pattern.source}`, flags);\n}\nexport function performRuntimeChecks(lexerDefinition, trackLines, lineTerminatorCharacters) {\n    const errors = [];\n    // some run time checks to help the end users.\n    if (!has(lexerDefinition, DEFAULT_MODE)) {\n        errors.push({\n            message: \"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 (!has(lexerDefinition, MODES)) {\n        errors.push({\n            message: \"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    if (has(lexerDefinition, MODES) &&\n        has(lexerDefinition, DEFAULT_MODE) &&\n        !has(lexerDefinition.modes, lexerDefinition.defaultMode)) {\n        errors.push({\n            message: `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    if (has(lexerDefinition, MODES)) {\n        forEach(lexerDefinition.modes, (currModeValue, currModeName) => {\n            forEach(currModeValue, (currTokType, currIdx) => {\n                if (isUndefined(currTokType)) {\n                    errors.push({\n                        message: `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                }\n                else if (has(currTokType, \"LONGER_ALT\")) {\n                    const longerAlt = isArray(currTokType.LONGER_ALT)\n                        ? currTokType.LONGER_ALT\n                        : [currTokType.LONGER_ALT];\n                    forEach(longerAlt, (currLongerAlt) => {\n                        if (!isUndefined(currLongerAlt) &&\n                            !includes(currModeValue, currLongerAlt)) {\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    return errors;\n}\nexport function performWarningRuntimeChecks(lexerDefinition, trackLines, lineTerminatorCharacters) {\n    const warnings = [];\n    let hasAnyLineBreak = false;\n    const allTokenTypes = compact(flatten(values(lexerDefinition.modes)));\n    const concreteTokenTypes = reject(allTokenTypes, (currType) => currType[PATTERN] === Lexer.NA);\n    const terminatorCharCodes = getCharCodes(lineTerminatorCharacters);\n    if (trackLines) {\n        forEach(concreteTokenTypes, (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            }\n            else {\n                // we don't want to attempt to scan if the user explicitly specified the line_breaks option.\n                if (has(tokType, \"LINE_BREAKS\")) {\n                    if (tokType.LINE_BREAKS === true) {\n                        hasAnyLineBreak = true;\n                    }\n                }\n                else {\n                    if (canMatchCharCode(terminatorCharCodes, tokType.PATTERN)) {\n                        hasAnyLineBreak = true;\n                    }\n                }\n            }\n        });\n    }\n    if (trackLines && !hasAnyLineBreak) {\n        warnings.push({\n            message: \"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}\nexport function cloneEmptyGroups(emptyGroups) {\n    const clonedResult = {};\n    const groupKeys = keys(emptyGroups);\n    forEach(groupKeys, (currKey) => {\n        const currGroupValue = emptyGroups[currKey];\n        /* istanbul ignore else */\n        if (isArray(currGroupValue)) {\n            clonedResult[currKey] = [];\n        }\n        else {\n            throw Error(\"non exhaustive match\");\n        }\n    });\n    return clonedResult;\n}\n// TODO: refactor to avoid duplication\nexport function isCustomPattern(tokenType) {\n    const pattern = tokenType.PATTERN;\n    /* istanbul ignore else */\n    if (isRegExp(pattern)) {\n        return false;\n    }\n    else if (isFunction(pattern)) {\n        // CustomPatternMatcherFunc - custom patterns do not require any transformations, only wrapping in a RegExp Like object\n        return true;\n    }\n    else if (has(pattern, \"exec\")) {\n        // ICustomPattern\n        return true;\n    }\n    else if (isString(pattern)) {\n        return false;\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nexport function isShortPattern(pattern) {\n    if (isString(pattern) && pattern.length === 1) {\n        return pattern.charCodeAt(0);\n    }\n    else {\n        return false;\n    }\n}\n/**\n * Faster than using a RegExp for default newline detection during lexing.\n */\nexport const LineTerminatorOptimizedTester = {\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            }\n            else if (c === 13) {\n                if (text.charCodeAt(i + 1) === 10) {\n                    this.lastIndex = i + 2;\n                }\n                else {\n                    this.lastIndex = i + 1;\n                }\n                return true;\n            }\n        }\n        return false;\n    },\n    lastIndex: 0,\n};\nfunction checkLineBreaksIssues(tokType, lineTerminatorCharCodes) {\n    if (has(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    }\n    else {\n        /* istanbul ignore else */\n        if (isRegExp(tokType.PATTERN)) {\n            try {\n                // TODO: why is the casting suddenly needed?\n                canMatchCharCode(lineTerminatorCharCodes, tokType.PATTERN);\n            }\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.message,\n                };\n            }\n            return false;\n        }\n        else if (isString(tokType.PATTERN)) {\n            // string literal patterns can always be analyzed to detect line terminator usage\n            return false;\n        }\n        else if (isCustomPattern(tokType)) {\n            // custom token types\n            return { issue: LexerDefinitionErrorType.CUSTOM_LINE_BREAK };\n        }\n        else {\n            throw Error(\"non exhaustive match\");\n        }\n    }\n}\nexport function buildLineBreakIssueMessage(tokType, details) {\n    /* istanbul ignore else */\n    if (details.issue === LexerDefinitionErrorType.IDENTIFY_TERMINATOR) {\n        return (\"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 (\"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}\nfunction getCharCodes(charsOrCodes) {\n    const charCodes = map(charsOrCodes, (numOrString) => {\n        if (isString(numOrString)) {\n            return numOrString.charCodeAt(0);\n        }\n        else {\n            return numOrString;\n        }\n    });\n    return charCodes;\n}\nfunction addToMapOfArrays(map, key, value) {\n    if (map[key] === undefined) {\n        map[key] = [value];\n    }\n    else {\n        map[key].push(value);\n    }\n}\nexport const minOptimizationVal = 256;\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 = [];\nexport function charCodeToOptimizedIndex(charCode) {\n    return charCode < minOptimizationVal\n        ? charCode\n        : charCodeToOptimizedIdxMap[charCode];\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 (isEmpty(charCodeToOptimizedIdxMap)) {\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//# sourceMappingURL=lexer.js.map","import { clone, compact, difference, flatten, forEach, has, includes, isArray, isEmpty, map, } from \"lodash-es\";\nexport function tokenStructuredMatcher(tokInstance, tokConstructor) {\n    const instanceType = tokInstance.tokenTypeIdx;\n    if (instanceType === tokConstructor.tokenTypeIdx) {\n        return true;\n    }\n    else {\n        return (tokConstructor.isParent === true &&\n            tokConstructor.categoryMatchesMap[instanceType] === true);\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(token, tokType) {\n    return token.tokenTypeIdx === tokType.tokenTypeIdx;\n}\nexport let tokenShortNameIdx = 1;\nexport const tokenIdxToClass = {};\nexport function augmentTokenTypes(tokenTypes) {\n    // collect the parent Token Types as well.\n    const tokenTypesAndParents = expandCategories(tokenTypes);\n    // add required tokenType and categoryMatches properties\n    assignTokenDefaultProps(tokenTypesAndParents);\n    // fill up the categoryMatches\n    assignCategoriesMapProp(tokenTypesAndParents);\n    assignCategoriesTokensProp(tokenTypesAndParents);\n    forEach(tokenTypesAndParents, (tokType) => {\n        tokType.isParent = tokType.categoryMatches.length > 0;\n    });\n}\nexport function expandCategories(tokenTypes) {\n    let result = clone(tokenTypes);\n    let categories = tokenTypes;\n    let searching = true;\n    while (searching) {\n        categories = compact(flatten(map(categories, (currTokType) => currTokType.CATEGORIES)));\n        const newCategories = difference(categories, result);\n        result = result.concat(newCategories);\n        if (isEmpty(newCategories)) {\n            searching = false;\n        }\n        else {\n            categories = newCategories;\n        }\n    }\n    return result;\n}\nexport function assignTokenDefaultProps(tokenTypes) {\n    forEach(tokenTypes, (currTokType) => {\n        if (!hasShortKeyProperty(currTokType)) {\n            tokenIdxToClass[tokenShortNameIdx] = currTokType;\n            currTokType.tokenTypeIdx = tokenShortNameIdx++;\n        }\n        // CATEGORIES? : TokenType | TokenType[]\n        if (hasCategoriesProperty(currTokType) &&\n            !isArray(currTokType.CATEGORIES)\n        // &&\n        // !isUndefined(currTokType.CATEGORIES.PATTERN)\n        ) {\n            currTokType.CATEGORIES = [currTokType.CATEGORIES];\n        }\n        if (!hasCategoriesProperty(currTokType)) {\n            currTokType.CATEGORIES = [];\n        }\n        if (!hasExtendingTokensTypesProperty(currTokType)) {\n            currTokType.categoryMatches = [];\n        }\n        if (!hasExtendingTokensTypesMapProperty(currTokType)) {\n            currTokType.categoryMatchesMap = {};\n        }\n    });\n}\nexport function assignCategoriesTokensProp(tokenTypes) {\n    forEach(tokenTypes, (currTokType) => {\n        // avoid duplications\n        currTokType.categoryMatches = [];\n        forEach(currTokType.categoryMatchesMap, (val, key) => {\n            currTokType.categoryMatches.push(tokenIdxToClass[key].tokenTypeIdx);\n        });\n    });\n}\nexport function assignCategoriesMapProp(tokenTypes) {\n    forEach(tokenTypes, (currTokType) => {\n        singleAssignCategoriesToksMap([], currTokType);\n    });\n}\nexport function singleAssignCategoriesToksMap(path, nextNode) {\n    forEach(path, (pathNode) => {\n        nextNode.categoryMatchesMap[pathNode.tokenTypeIdx] = true;\n    });\n    forEach(nextNode.CATEGORIES, (nextCategory) => {\n        const newPath = path.concat(nextNode);\n        // avoids infinite loops due to cyclic categories.\n        if (!includes(newPath, nextCategory)) {\n            singleAssignCategoriesToksMap(newPath, nextCategory);\n        }\n    });\n}\nexport function hasShortKeyProperty(tokType) {\n    return has(tokType, \"tokenTypeIdx\");\n}\nexport function hasCategoriesProperty(tokType) {\n    return has(tokType, \"CATEGORIES\");\n}\nexport function hasExtendingTokensTypesProperty(tokType) {\n    return has(tokType, \"categoryMatches\");\n}\nexport function hasExtendingTokensTypesMapProperty(tokType) {\n    return has(tokType, \"categoryMatchesMap\");\n}\nexport function isTokenType(tokType) {\n    return has(tokType, \"tokenTypeIdx\");\n}\n//# sourceMappingURL=tokens.js.map","export const defaultLexerErrorProvider = {\n    buildUnableToPopLexerModeMessage(token) {\n        return `Unable to pop Lexer Mode after encountering Token ->${token.image}<- The Mode Stack is empty`;\n    },\n    buildUnexpectedCharactersMessage(fullText, startOffset, length, line, column, mode) {\n        return (`unexpected character: ->${fullText.charAt(startOffset)}<- at offset: ${startOffset},` + ` skipped ${length} characters.`);\n    },\n};\n//# sourceMappingURL=lexer_errors_public.js.map","import { analyzeTokenTypes, charCodeToOptimizedIndex, cloneEmptyGroups, DEFAULT_MODE, LineTerminatorOptimizedTester, performRuntimeChecks, performWarningRuntimeChecks, validatePatterns, } from \"./lexer.js\";\nimport { assign, clone, forEach, identity, isArray, isEmpty, isUndefined, keys, last, map, noop, reduce, reject, } from \"lodash-es\";\nimport { PRINT_WARNING, timer, toFastProperties } from \"@chevrotain/utils\";\nimport { augmentTokenTypes } from \"./tokens.js\";\nimport { defaultLexerErrorProvider } from \"./lexer_errors_public.js\";\nimport { clearRegExpParserCache } from \"./reg_exp_parser.js\";\nexport var LexerDefinitionErrorType;\n(function (LexerDefinitionErrorType) {\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MISSING_PATTERN\"] = 0] = \"MISSING_PATTERN\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"INVALID_PATTERN\"] = 1] = \"INVALID_PATTERN\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"EOI_ANCHOR_FOUND\"] = 2] = \"EOI_ANCHOR_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"UNSUPPORTED_FLAGS_FOUND\"] = 3] = \"UNSUPPORTED_FLAGS_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"DUPLICATE_PATTERNS_FOUND\"] = 4] = \"DUPLICATE_PATTERNS_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"INVALID_GROUP_TYPE_FOUND\"] = 5] = \"INVALID_GROUP_TYPE_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"PUSH_MODE_DOES_NOT_EXIST\"] = 6] = \"PUSH_MODE_DOES_NOT_EXIST\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE\"] = 7] = \"MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY\"] = 8] = \"MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST\"] = 9] = \"MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED\"] = 10] = \"LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"SOI_ANCHOR_FOUND\"] = 11] = \"SOI_ANCHOR_FOUND\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"EMPTY_MATCH_PATTERN\"] = 12] = \"EMPTY_MATCH_PATTERN\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"NO_LINE_BREAKS_FLAGS\"] = 13] = \"NO_LINE_BREAKS_FLAGS\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"UNREACHABLE_PATTERN\"] = 14] = \"UNREACHABLE_PATTERN\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"IDENTIFY_TERMINATOR\"] = 15] = \"IDENTIFY_TERMINATOR\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"CUSTOM_LINE_BREAK\"] = 16] = \"CUSTOM_LINE_BREAK\";\n    LexerDefinitionErrorType[LexerDefinitionErrorType[\"MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE\"] = 17] = \"MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE\";\n})(LexerDefinitionErrorType || (LexerDefinitionErrorType = {}));\nconst DEFAULT_LEXER_CONFIG = {\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};\nObject.freeze(DEFAULT_LEXER_CONFIG);\nexport class Lexer {\n    constructor(lexerDefinition, config = DEFAULT_LEXER_CONFIG) {\n        this.lexerDefinition = lexerDefinition;\n        this.lexerDefinitionErrors = [];\n        this.lexerDefinitionWarning = [];\n        this.patternIdxToConfig = {};\n        this.charCodeToPatternIdxToConfig = {};\n        this.modes = [];\n        this.emptyGroups = {};\n        this.trackStartLines = true;\n        this.trackEndLines = true;\n        this.hasCustom = false;\n        this.canModeBeOptimized = {};\n        // Duplicated from the parser's perf trace trait to allow future extraction\n        // of the lexer to a separate package.\n        this.TRACE_INIT = (phaseDesc, phaseImpl) => {\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            }\n            else {\n                return phaseImpl();\n            }\n        };\n        if (typeof config === \"boolean\") {\n            throw Error(\"The second argument to the Lexer constructor is now an ILexerConfig Object.\\n\" +\n                \"a boolean 2nd argument is no longer supported\");\n        }\n        this.config = assign({}, DEFAULT_LEXER_CONFIG, config);\n        const traceInitVal = this.config.traceInitPerf;\n        if (traceInitVal === true) {\n            this.traceInitMaxIdent = Infinity;\n            this.traceInitPerf = true;\n        }\n        else if (typeof traceInitVal === \"number\") {\n            this.traceInitMaxIdent = traceInitVal;\n            this.traceInitPerf = true;\n        }\n        this.traceInitIndent = -1;\n        this.TRACE_INIT(\"Lexer Constructor\", () => {\n            let actualDefinition;\n            let hasOnlySingleMode = true;\n            this.TRACE_INIT(\"Lexer Config handling\", () => {\n                if (this.config.lineTerminatorsPattern ===\n                    DEFAULT_LEXER_CONFIG.lineTerminatorsPattern) {\n                    // optimized built-in implementation for the defaults definition of lineTerminators\n                    this.config.lineTerminatorsPattern = LineTerminatorOptimizedTester;\n                }\n                else {\n                    if (this.config.lineTerminatorCharacters ===\n                        DEFAULT_LEXER_CONFIG.lineTerminatorCharacters) {\n                        throw Error(\"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                if (config.safeMode && config.ensureOptimizations) {\n                    throw Error('\"safeMode\" and \"ensureOptimizations\" flags are mutually exclusive.');\n                }\n                this.trackStartLines = /full|onlyStart/i.test(this.config.positionTracking);\n                this.trackEndLines = /full/i.test(this.config.positionTracking);\n                // Convert SingleModeLexerDefinition into a IMultiModeLexerDefinition.\n                if (isArray(lexerDefinition)) {\n                    actualDefinition = {\n                        modes: { defaultMode: clone(lexerDefinition) },\n                        defaultMode: DEFAULT_MODE,\n                    };\n                }\n                else {\n                    // no conversion needed, input should already be a IMultiModeLexerDefinition\n                    hasOnlySingleMode = false;\n                    actualDefinition = clone(lexerDefinition);\n                }\n            });\n            if (this.config.skipValidations === false) {\n                this.TRACE_INIT(\"performRuntimeChecks\", () => {\n                    this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(performRuntimeChecks(actualDefinition, this.trackStartLines, this.config.lineTerminatorCharacters));\n                });\n                this.TRACE_INIT(\"performWarningRuntimeChecks\", () => {\n                    this.lexerDefinitionWarning = this.lexerDefinitionWarning.concat(performWarningRuntimeChecks(actualDefinition, this.trackStartLines, this.config.lineTerminatorCharacters));\n                });\n            }\n            // for extra robustness to avoid throwing a none informative error message\n            actualDefinition.modes = actualDefinition.modes\n                ? actualDefinition.modes\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            forEach(actualDefinition.modes, (currModeValue, currModeName) => {\n                actualDefinition.modes[currModeName] = reject(currModeValue, (currTokType) => isUndefined(currTokType));\n            });\n            const allModeNames = keys(actualDefinition.modes);\n            forEach(actualDefinition.modes, (currModDef, currModName) => {\n                this.TRACE_INIT(`Mode: <${currModName}> processing`, () => {\n                    this.modes.push(currModName);\n                    if (this.config.skipValidations === false) {\n                        this.TRACE_INIT(`validatePatterns`, () => {\n                            this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(validatePatterns(currModDef, allModeNames));\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 (isEmpty(this.lexerDefinitionErrors)) {\n                        augmentTokenTypes(currModDef);\n                        let currAnalyzeResult;\n                        this.TRACE_INIT(`analyzeTokenTypes`, () => {\n                            currAnalyzeResult = analyzeTokenTypes(currModDef, {\n                                lineTerminatorCharacters: this.config.lineTerminatorCharacters,\n                                positionTracking: config.positionTracking,\n                                ensureOptimizations: config.ensureOptimizations,\n                                safeMode: config.safeMode,\n                                tracer: this.TRACE_INIT,\n                            });\n                        });\n                        this.patternIdxToConfig[currModName] =\n                            currAnalyzeResult.patternIdxToConfig;\n                        this.charCodeToPatternIdxToConfig[currModName] =\n                            currAnalyzeResult.charCodeToPatternIdxToConfig;\n                        this.emptyGroups = assign({}, this.emptyGroups, currAnalyzeResult.emptyGroups);\n                        this.hasCustom = currAnalyzeResult.hasCustom || this.hasCustom;\n                        this.canModeBeOptimized[currModName] =\n                            currAnalyzeResult.canBeOptimized;\n                    }\n                });\n            });\n            this.defaultMode = actualDefinition.defaultMode;\n            if (!isEmpty(this.lexerDefinitionErrors) &&\n                !this.config.deferDefinitionErrorsHandling) {\n                const allErrMessages = map(this.lexerDefinitionErrors, (error) => {\n                    return error.message;\n                });\n                const allErrMessagesString = allErrMessages.join(\"-----------------------\\n\");\n                throw new Error(\"Errors detected in definition of Lexer:\\n\" + allErrMessagesString);\n            }\n            // Only print warning if there are no errors, This will avoid pl\n            forEach(this.lexerDefinitionWarning, (warningDescriptor) => {\n                PRINT_WARNING(warningDescriptor.message);\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                if (hasOnlySingleMode) {\n                    this.handleModes = noop;\n                }\n                if (this.trackStartLines === false) {\n                    this.computeNewColumn = identity;\n                }\n                if (this.trackEndLines === false) {\n                    this.updateTokenEndLineColumnLocation = noop;\n                }\n                if (/full/i.test(this.config.positionTracking)) {\n                    this.createTokenInstance = this.createFullToken;\n                }\n                else if (/onlyStart/i.test(this.config.positionTracking)) {\n                    this.createTokenInstance = this.createStartOnlyToken;\n                }\n                else if (/onlyOffset/i.test(this.config.positionTracking)) {\n                    this.createTokenInstance = this.createOffsetOnlyToken;\n                }\n                else {\n                    throw Error(`Invalid <positionTracking> config option: \"${this.config.positionTracking}\"`);\n                }\n                if (this.hasCustom) {\n                    this.addToken = this.addTokenUsingPush;\n                    this.handlePayload = this.handlePayloadWithCustom;\n                }\n                else {\n                    this.addToken = this.addTokenUsingMemberAccess;\n                    this.handlePayload = this.handlePayloadNoCustom;\n                }\n            });\n            this.TRACE_INIT(\"Failed Optimization Warnings\", () => {\n                const unOptimizedModes = reduce(this.canModeBeOptimized, (cannotBeOptimized, canBeOptimized, modeName) => {\n                    if (canBeOptimized === false) {\n                        cannotBeOptimized.push(modeName);\n                    }\n                    return cannotBeOptimized;\n                }, []);\n                if (config.ensureOptimizations && !isEmpty(unOptimizedModes)) {\n                    throw Error(`Lexer Modes: < ${unOptimizedModes.join(\", \")} > 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            this.TRACE_INIT(\"clearRegExpParserCache\", () => {\n                clearRegExpParserCache();\n            });\n            this.TRACE_INIT(\"toFastProperties\", () => {\n                toFastProperties(this);\n            });\n        });\n    }\n    tokenize(text, initialMode = this.defaultMode) {\n        if (!isEmpty(this.lexerDefinitionErrors)) {\n            const allErrMessages = map(this.lexerDefinitionErrors, (error) => {\n                return error.message;\n            });\n            const allErrMessagesString = allErrMessages.join(\"-----------------------\\n\");\n            throw new Error(\"Unable to Tokenize because Errors detected in definition of Lexer:\\n\" +\n                allErrMessagesString);\n        }\n        return this.tokenizeInternal(text, initialMode);\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    tokenizeInternal(text, initialMode) {\n        let i, j, k, matchAltImage, longerAlt, matchedImage, payload, altPayload, imageLength, group, tokType, newToken, errLength, msg, 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 = [];\n        let line = this.trackStartLines ? 1 : undefined;\n        let column = this.trackStartLines ? 1 : undefined;\n        const groups = cloneEmptyGroups(this.emptyGroups);\n        const trackLines = this.trackStartLines;\n        const lineTerminatorPattern = this.config.lineTerminatorsPattern;\n        let currModePatternsLength = 0;\n        let patternIdxToConfig = [];\n        let currCharCodeToPatternIdxToConfig = [];\n        const modeStack = [];\n        const emptyArray = [];\n        Object.freeze(emptyArray);\n        let isOptimizedMode = false;\n        const pop_mode = (popToken) => {\n            // TODO: perhaps avoid this error in the edge case there is no more input?\n            if (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                // 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 = this.config.errorMessageProvider.buildUnableToPopLexerModeMessage(popToken);\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            }\n            else {\n                modeStack.pop();\n                const newMode = last(modeStack);\n                patternIdxToConfig = this.patternIdxToConfig[newMode];\n                currCharCodeToPatternIdxToConfig =\n                    this.charCodeToPatternIdxToConfig[newMode];\n                currModePatternsLength = patternIdxToConfig.length;\n                const modeCanBeOptimized = this.canModeBeOptimized[newMode] && this.config.safeMode === false;\n                if (currCharCodeToPatternIdxToConfig && modeCanBeOptimized) {\n                    isOptimizedMode = true;\n                }\n                else {\n                    isOptimizedMode = false;\n                }\n            }\n        };\n        function push_mode(newMode) {\n            modeStack.push(newMode);\n            currCharCodeToPatternIdxToConfig =\n                this.charCodeToPatternIdxToConfig[newMode];\n            patternIdxToConfig = this.patternIdxToConfig[newMode];\n            currModePatternsLength = patternIdxToConfig.length;\n            currModePatternsLength = patternIdxToConfig.length;\n            const modeCanBeOptimized = this.canModeBeOptimized[newMode] && this.config.safeMode === false;\n            if (currCharCodeToPatternIdxToConfig && modeCanBeOptimized) {\n                isOptimizedMode = true;\n            }\n            else {\n                isOptimizedMode = false;\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        let currConfig;\n        const recoveryEnabled = this.config.recoveryEnabled;\n        while (offset < orgLength) {\n            matchedImage = null;\n            imageLength = -1;\n            const nextCharCode = orgText.charCodeAt(offset);\n            let chosenPatternIdxToConfig;\n            if (isOptimizedMode) {\n                const optimizedCharIdx = charCodeToOptimizedIndex(nextCharCode);\n                const possiblePatterns = currCharCodeToPatternIdxToConfig[optimizedCharIdx];\n                chosenPatternIdxToConfig =\n                    possiblePatterns !== undefined ? possiblePatterns : emptyArray;\n            }\n            else {\n                chosenPatternIdxToConfig = patternIdxToConfig;\n            }\n            const chosenPatternsLength = chosenPatternIdxToConfig.length;\n            for (i = 0; i < chosenPatternsLength; i++) {\n                currConfig = chosenPatternIdxToConfig[i];\n                const currPattern = currConfig.pattern;\n                payload = null;\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;\n                    }\n                }\n                else if (currConfig.isCustom === true) {\n                    match = currPattern.exec(orgText, offset, matchedTokens, groups);\n                    if (match !== null) {\n                        matchedImage = match[0];\n                        imageLength = matchedImage.length;\n                        if (match.payload !== undefined) {\n                            payload = match.payload;\n                        }\n                    }\n                    else {\n                        matchedImage = null;\n                    }\n                }\n                else {\n                    currPattern.lastIndex = offset;\n                    imageLength = this.matchLength(currPattern, text, offset);\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                            // 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.exec(orgText, offset, matchedTokens, groups);\n                                if (match !== null) {\n                                    matchAltImage = match[0];\n                                    if (match.payload !== undefined) {\n                                        altPayload = match.payload;\n                                    }\n                                }\n                                else {\n                                    matchAltImage = null;\n                                }\n                            }\n                            else {\n                                longerAltPattern.lastIndex = offset;\n                                matchAltImage = this.match(longerAltPattern, text, offset);\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            // 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(matchedImage, offset, tokType, currConfig.tokenType, line, column, imageLength);\n                    this.handlePayload(newToken, payload);\n                    if (group === false) {\n                        matchedTokensIndex = this.addToken(matchedTokens, matchedTokensIndex, newToken);\n                    }\n                    else {\n                        groups[group].push(newToken);\n                    }\n                }\n                // line terminator handling\n                if (trackLines === true && currConfig.canLineTerminator === true) {\n                    let numOfLTsInMatch = 0;\n                    let foundTerminator;\n                    let lastLTEndOffset;\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                    if (numOfLTsInMatch !== 0) {\n                        line = line + numOfLTsInMatch;\n                        column = imageLength - lastLTEndOffset;\n                        this.updateTokenEndLineColumnLocation(newToken, group, lastLTEndOffset, numOfLTsInMatch, line, column, imageLength);\n                    }\n                    else {\n                        column = this.computeNewColumn(column, imageLength);\n                    }\n                }\n                else {\n                    column = this.computeNewColumn(column, imageLength);\n                }\n                offset = offset + imageLength;\n                // will be NOOP if no modes present\n                this.handleModes(currConfig, pop_mode, push_mode, newToken);\n            }\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                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                        // 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                        }\n                        else if (currConfig.isCustom === true) {\n                            foundResyncPoint =\n                                currPattern.exec(orgText, offset, matchedTokens, groups) !== null;\n                        }\n                        else {\n                            currPattern.lastIndex = offset;\n                            foundResyncPoint = currPattern.exec(text) !== null;\n                        }\n                        if (foundResyncPoint === true) {\n                            break;\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(orgText, errorStartOffset, errLength, errorLine, errorColumn, last(modeStack));\n                errors.push({\n                    offset: errorStartOffset,\n                    line: errorLine,\n                    column: errorColumn,\n                    length: errLength,\n                    message: msg,\n                });\n                if (recoveryEnabled === false) {\n                    break;\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        return {\n            tokens: matchedTokens,\n            groups: groups,\n            errors: errors,\n        };\n    }\n    handleModes(config, pop_mode, push_mode, newToken) {\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        }\n        else if (config.push !== undefined) {\n            push_mode.call(this, config.push);\n        }\n    }\n    // TODO: decrease this under 600 characters? inspect stripping comments option in TSC compiler\n    updateTokenEndLineColumnLocation(newToken, group, lastLTIdx, numOfLTsInMatch, line, column, imageLength) {\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    computeNewColumn(oldColumn, imageLength) {\n        return oldColumn + imageLength;\n    }\n    createOffsetOnlyToken(image, startOffset, tokenTypeIdx, tokenType) {\n        return {\n            image,\n            startOffset,\n            tokenTypeIdx,\n            tokenType,\n        };\n    }\n    createStartOnlyToken(image, startOffset, tokenTypeIdx, tokenType, startLine, startColumn) {\n        return {\n            image,\n            startOffset,\n            startLine,\n            startColumn,\n            tokenTypeIdx,\n            tokenType,\n        };\n    }\n    createFullToken(image, startOffset, tokenTypeIdx, tokenType, startLine, startColumn, imageLength) {\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    addTokenUsingPush(tokenVector, index, tokenToAdd) {\n        tokenVector.push(tokenToAdd);\n        return index;\n    }\n    addTokenUsingMemberAccess(tokenVector, index, tokenToAdd) {\n        tokenVector[index] = tokenToAdd;\n        index++;\n        return index;\n    }\n    handlePayloadNoCustom(token, payload) { }\n    handlePayloadWithCustom(token, payload) {\n        if (payload !== null) {\n            token.payload = payload;\n        }\n    }\n    match(pattern, text, offset) {\n        const found = pattern.test(text);\n        if (found === true) {\n            return text.substring(offset, pattern.lastIndex);\n        }\n        return null;\n    }\n    matchLength(pattern, text, offset) {\n        const found = pattern.test(text);\n        if (found === true) {\n            return pattern.lastIndex - offset;\n        }\n        return -1;\n    }\n}\nLexer.SKIPPED = \"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.\";\nLexer.NA = /NOT_APPLICABLE/;\n//# sourceMappingURL=lexer_public.js.map","import { has, isString, isUndefined } from \"lodash-es\";\nimport { Lexer } from \"./lexer_public.js\";\nimport { augmentTokenTypes, tokenStructuredMatcher } from \"./tokens.js\";\nexport function tokenLabel(tokType) {\n    if (hasTokenLabel(tokType)) {\n        return tokType.LABEL;\n    }\n    else {\n        return tokType.name;\n    }\n}\nexport function tokenName(tokType) {\n    return tokType.name;\n}\nexport function hasTokenLabel(obj) {\n    return isString(obj.LABEL) && obj.LABEL !== \"\";\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\";\nexport function createToken(config) {\n    return createTokenInternal(config);\n}\nfunction createTokenInternal(config) {\n    const pattern = config.pattern;\n    const tokenType = {};\n    tokenType.name = config.name;\n    if (!isUndefined(pattern)) {\n        tokenType.PATTERN = pattern;\n    }\n    if (has(config, PARENT)) {\n        throw (\"The parent property is no longer supported.\\n\" +\n            \"See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.\");\n    }\n    if (has(config, CATEGORIES)) {\n        // casting to ANY as this will be fixed inside `augmentTokenTypes``\n        tokenType.CATEGORIES = config[CATEGORIES];\n    }\n    augmentTokenTypes([tokenType]);\n    if (has(config, LABEL)) {\n        tokenType.LABEL = config[LABEL];\n    }\n    if (has(config, GROUP)) {\n        tokenType.GROUP = config[GROUP];\n    }\n    if (has(config, POP_MODE)) {\n        tokenType.POP_MODE = config[POP_MODE];\n    }\n    if (has(config, PUSH_MODE)) {\n        tokenType.PUSH_MODE = config[PUSH_MODE];\n    }\n    if (has(config, LONGER_ALT)) {\n        tokenType.LONGER_ALT = config[LONGER_ALT];\n    }\n    if (has(config, LINE_BREAKS)) {\n        tokenType.LINE_BREAKS = config[LINE_BREAKS];\n    }\n    if (has(config, START_CHARS_HINT)) {\n        tokenType.START_CHARS_HINT = config[START_CHARS_HINT];\n    }\n    return tokenType;\n}\nexport const EOF = createToken({ name: \"EOF\", pattern: Lexer.NA });\naugmentTokenTypes([EOF]);\nexport function createTokenInstance(tokType, image, startOffset, endOffset, startLine, endLine, startColumn, endColumn) {\n    return {\n        image,\n        startOffset,\n        endOffset,\n        startLine,\n        endLine,\n        startColumn,\n        endColumn,\n        tokenTypeIdx: tokType.tokenTypeIdx,\n        tokenType: tokType,\n    };\n}\nexport function tokenMatcher(token, tokType) {\n    return tokenStructuredMatcher(token, tokType);\n}\n//# sourceMappingURL=tokens_public.js.map","import { hasTokenLabel, tokenLabel } from \"../scan/tokens_public.js\";\nimport { first, map, reduce } from \"lodash-es\";\nimport { getProductionDslName, NonTerminal, Rule, Terminal, } from \"@chevrotain/gast\";\nexport const defaultParserErrorProvider = {\n    buildMismatchTokenMessage({ expected, actual, previous, ruleName }) {\n        const hasLabel = hasTokenLabel(expected);\n        const expectedMsg = hasLabel\n            ? `--> ${tokenLabel(expected)} <--`\n            : `token of type --> ${expected.name} <--`;\n        const msg = `Expecting ${expectedMsg} but found --> '${actual.image}' <--`;\n        return msg;\n    },\n    buildNotAllInputParsedMessage({ firstRedundant, ruleName }) {\n        return \"Redundant input, expecting EOF but found: \" + firstRedundant.image;\n    },\n    buildNoViableAltMessage({ expectedPathsPerAlt, actual, previous, customUserDescription, ruleName, }) {\n        const errPrefix = \"Expecting: \";\n        // TODO: issue: No Viable Alternative Error may have incomplete details. #502\n        const actualText = first(actual).image;\n        const errSuffix = \"\\nbut found: '\" + actualText + \"'\";\n        if (customUserDescription) {\n            return errPrefix + customUserDescription + errSuffix;\n        }\n        else {\n            const allLookAheadPaths = reduce(expectedPathsPerAlt, (result, currAltPaths) => result.concat(currAltPaths), []);\n            const nextValidTokenSequences = map(allLookAheadPaths, (currPath) => `[${map(currPath, (currTokenType) => tokenLabel(currTokenType)).join(\", \")}]`);\n            const nextValidSequenceItems = map(nextValidTokenSequences, (itemMsg, idx) => `  ${idx + 1}. ${itemMsg}`);\n            const calculatedDescription = `one of these possible Token sequences:\\n${nextValidSequenceItems.join(\"\\n\")}`;\n            return errPrefix + calculatedDescription + errSuffix;\n        }\n    },\n    buildEarlyExitMessage({ expectedIterationPaths, actual, customUserDescription, ruleName, }) {\n        const errPrefix = \"Expecting: \";\n        // TODO: issue: No Viable Alternative Error may have incomplete details. #502\n        const actualText = first(actual).image;\n        const errSuffix = \"\\nbut found: '\" + actualText + \"'\";\n        if (customUserDescription) {\n            return errPrefix + customUserDescription + errSuffix;\n        }\n        else {\n            const nextValidTokenSequences = map(expectedIterationPaths, (currPath) => `[${map(currPath, (currTokenType) => tokenLabel(currTokenType)).join(\",\")}]`);\n            const calculatedDescription = `expecting at least one iteration which starts with one of these possible Token sequences::\\n  ` +\n                `<${nextValidTokenSequences.join(\" ,\")}>`;\n            return errPrefix + calculatedDescription + errSuffix;\n        }\n    },\n};\nObject.freeze(defaultParserErrorProvider);\nexport const defaultGrammarResolverErrorProvider = {\n    buildRuleNotFoundError(topLevelRule, undefinedRule) {\n        const msg = \"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};\nexport const defaultGrammarValidatorErrorProvider = {\n    buildDuplicateFoundError(topLevelRule, duplicateProds) {\n        function getExtraProductionArgument(prod) {\n            if (prod instanceof Terminal) {\n                return prod.terminalType.name;\n            }\n            else if (prod instanceof NonTerminal) {\n                return prod.nonTerminalName;\n            }\n            else {\n                return \"\";\n            }\n        }\n        const topLevelName = topLevelRule.name;\n        const duplicateProd = first(duplicateProds);\n        const index = duplicateProd.idx;\n        const dslName = getProductionDslName(duplicateProd);\n        const extraArgument = getExtraProductionArgument(duplicateProd);\n        const hasExplicitIndex = index > 0;\n        let msg = `->${dslName}${hasExplicitIndex ? index : \"\"}<- ${extraArgument ? `with argument: ->${extraArgument}<-` : \"\"}\n                  appears more than once (${duplicateProds.length} times) in the top level rule: ->${topLevelName}<-.                  \n                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES \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        return msg;\n    },\n    buildNamespaceConflictError(rule) {\n        const errMsg = `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        return errMsg;\n    },\n    buildAlternationPrefixAmbiguityError(options) {\n        const pathMsg = map(options.prefixPath, (currTok) => tokenLabel(currTok)).join(\", \");\n        const occurrence = options.alternation.idx === 0 ? \"\" : options.alternation.idx;\n        const errMsg = `Ambiguous alternatives: <${options.ambiguityIndices.join(\" ,\")}> 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        return errMsg;\n    },\n    buildAlternationAmbiguityError(options) {\n        const occurrence = options.alternation.idx === 0 ? \"\" : options.alternation.idx;\n        const isEmptyPath = options.prefixPath.length === 0;\n        let currMessage = `Ambiguous Alternatives Detected: <${options.ambiguityIndices.join(\" ,\")}> in <OR${occurrence}>` +\n            ` inside <${options.topLevelRule.name}> Rule,\\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        }\n        else {\n            const pathMsg = map(options.prefixPath, (currtok) => tokenLabel(currtok)).join(\", \");\n            currMessage += `<${pathMsg}> may appears as a prefix path in all these alternatives.\\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    buildEmptyRepetitionError(options) {\n        let dslName = getProductionDslName(options.repetition);\n        if (options.repetition.idx !== 0) {\n            dslName += options.repetition.idx;\n        }\n        const errMsg = `The repetition <${dslName}> within Rule <${options.topLevelRule.name}> can never consume any tokens.\\n` +\n            `This could lead to an infinite loop.`;\n        return errMsg;\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        /* istanbul ignore next */\n        return \"deprecated\";\n    },\n    buildEmptyAlternationError(options) {\n        const errMsg = `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        return errMsg;\n    },\n    buildTooManyAlternativesError(options) {\n        const errMsg = `An Alternation cannot have more than 256 alternatives:\\n` +\n            `<OR${options.alternation.idx}> inside <${options.topLevelRule.name}> Rule.\\n has ${options.alternation.definition.length + 1} alternatives.`;\n        return errMsg;\n    },\n    buildLeftRecursionError(options) {\n        const ruleName = options.topLevelRule.name;\n        const pathNames = map(options.leftRecursionPath, (currRule) => currRule.name);\n        const leftRecursivePath = `${ruleName} --> ${pathNames\n            .concat([ruleName])\n            .join(\" --> \")}`;\n        const errMsg = `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        return errMsg;\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        /* istanbul ignore next */\n        return \"deprecated\";\n    },\n    buildDuplicateRuleNameError(options) {\n        let ruleName;\n        if (options.topLevelRule instanceof Rule) {\n            ruleName = options.topLevelRule.name;\n        }\n        else {\n            ruleName = options.topLevelRule;\n        }\n        const errMsg = `Duplicate definition, rule: ->${ruleName}<- is already defined in the grammar: ->${options.grammarName}<-`;\n        return errMsg;\n    },\n};\n//# sourceMappingURL=errors_public.js.map","import { ParserDefinitionErrorType, } from \"../parser/parser.js\";\nimport { forEach, values } from \"lodash-es\";\nimport { GAstVisitor } from \"@chevrotain/gast\";\nexport function resolveGrammar(topLevels, errMsgProvider) {\n    const refResolver = new GastRefResolverVisitor(topLevels, errMsgProvider);\n    refResolver.resolveRefs();\n    return refResolver.errors;\n}\nexport class GastRefResolverVisitor extends GAstVisitor {\n    constructor(nameToTopRule, errMsgProvider) {\n        super();\n        this.nameToTopRule = nameToTopRule;\n        this.errMsgProvider = errMsgProvider;\n        this.errors = [];\n    }\n    resolveRefs() {\n        forEach(values(this.nameToTopRule), (prod) => {\n            this.currTopLevel = prod;\n            prod.accept(this);\n        });\n    }\n    visitNonTerminal(node) {\n        const ref = this.nameToTopRule[node.nonTerminalName];\n        if (!ref) {\n            const msg = this.errMsgProvider.buildRuleNotFoundError(this.currTopLevel, node);\n            this.errors.push({\n                message: msg,\n                type: ParserDefinitionErrorType.UNRESOLVED_SUBRULE_REF,\n                ruleName: this.currTopLevel.name,\n                unresolvedRefName: node.nonTerminalName,\n            });\n        }\n        else {\n            node.referencedRule = ref;\n        }\n    }\n}\n//# sourceMappingURL=resolver.js.map","import { clone, drop, dropRight, first as _first, forEach, isEmpty, last, } from \"lodash-es\";\nimport { first } from \"./first.js\";\nimport { RestWalker } from \"./rest.js\";\nimport { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Rule, Terminal, } from \"@chevrotain/gast\";\nexport class AbstractNextPossibleTokensWalker extends RestWalker {\n    constructor(topProd, path) {\n        super();\n        this.topProd = topProd;\n        this.path = path;\n        this.possibleTokTypes = [];\n        this.nextProductionName = \"\";\n        this.nextProductionOccurrence = 0;\n        this.found = false;\n        this.isAtEndOfPath = false;\n    }\n    startWalking() {\n        this.found = false;\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        // immutable for the win\n        this.ruleStack = clone(this.path.ruleStack).reverse(); // intelij bug requires assertion\n        this.occurrenceStack = clone(this.path.occurrenceStack).reverse(); // intelij bug requires assertion\n        // already verified that the first production is valid, we now seek the 2nd production\n        this.ruleStack.pop();\n        this.occurrenceStack.pop();\n        this.updateExpectedNext();\n        this.walk(this.topProd);\n        return this.possibleTokTypes;\n    }\n    walk(prod, prevRest = []) {\n        // stop scanning once we found the path\n        if (!this.found) {\n            super.walk(prod, prevRest);\n        }\n    }\n    walkProdRef(refProd, currRest, prevRest) {\n        // found the next production, need to keep walking in it\n        if (refProd.referencedRule.name === this.nextProductionName &&\n            refProd.idx === this.nextProductionOccurrence) {\n            const fullRest = currRest.concat(prevRest);\n            this.updateExpectedNext();\n            this.walk(refProd.referencedRule, fullRest);\n        }\n    }\n    updateExpectedNext() {\n        // need to consume the Terminal\n        if (isEmpty(this.ruleStack)) {\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        }\n        else {\n            this.nextProductionName = this.ruleStack.pop();\n            this.nextProductionOccurrence = this.occurrenceStack.pop();\n        }\n    }\n}\nexport class NextAfterTokenWalker extends AbstractNextPossibleTokensWalker {\n    constructor(topProd, path) {\n        super(topProd, path);\n        this.path = path;\n        this.nextTerminalName = \"\";\n        this.nextTerminalOccurrence = 0;\n        this.nextTerminalName = this.path.lastTok.name;\n        this.nextTerminalOccurrence = this.path.lastTokOccurrence;\n    }\n    walkTerminal(terminal, currRest, prevRest) {\n        if (this.isAtEndOfPath &&\n            terminal.terminalType.name === this.nextTerminalName &&\n            terminal.idx === this.nextTerminalOccurrence &&\n            !this.found) {\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/**\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    constructor(topRule, occurrence) {\n        super();\n        this.topRule = topRule;\n        this.occurrence = occurrence;\n        this.result = {\n            token: undefined,\n            occurrence: undefined,\n            isEndOfRule: undefined,\n        };\n    }\n    startWalking() {\n        this.walk(this.topRule);\n        return this.result;\n    }\n}\nexport class NextTerminalAfterManyWalker extends AbstractNextTerminalAfterProductionWalker {\n    walkMany(manyProd, currRest, prevRest) {\n        if (manyProd.idx === this.occurrence) {\n            const firstAfterMany = _first(currRest.concat(prevRest));\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        }\n        else {\n            super.walkMany(manyProd, currRest, prevRest);\n        }\n    }\n}\nexport class NextTerminalAfterManySepWalker extends AbstractNextTerminalAfterProductionWalker {\n    walkManySep(manySepProd, currRest, prevRest) {\n        if (manySepProd.idx === this.occurrence) {\n            const firstAfterManySep = _first(currRest.concat(prevRest));\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        }\n        else {\n            super.walkManySep(manySepProd, currRest, prevRest);\n        }\n    }\n}\nexport class NextTerminalAfterAtLeastOneWalker extends AbstractNextTerminalAfterProductionWalker {\n    walkAtLeastOne(atLeastOneProd, currRest, prevRest) {\n        if (atLeastOneProd.idx === this.occurrence) {\n            const firstAfterAtLeastOne = _first(currRest.concat(prevRest));\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        }\n        else {\n            super.walkAtLeastOne(atLeastOneProd, currRest, prevRest);\n        }\n    }\n}\n// TODO: reduce code duplication in the AfterWalkers\nexport class NextTerminalAfterAtLeastOneSepWalker extends AbstractNextTerminalAfterProductionWalker {\n    walkAtLeastOneSep(atleastOneSepProd, currRest, prevRest) {\n        if (atleastOneSepProd.idx === this.occurrence) {\n            const firstAfterfirstAfterAtLeastOneSep = _first(currRest.concat(prevRest));\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        }\n        else {\n            super.walkAtLeastOneSep(atleastOneSepProd, currRest, prevRest);\n        }\n    }\n}\nexport function possiblePathsFrom(targetDef, maxLength, currPath = []) {\n    // avoid side effects\n    currPath = clone(currPath);\n    let result = [];\n    let i = 0;\n    // TODO: avoid inner funcs\n    function remainingPathWith(nextDef) {\n        return nextDef.concat(drop(targetDef, i + 1));\n    }\n    // TODO: avoid inner funcs\n    function getAlternativesForProd(definition) {\n        const alternatives = possiblePathsFrom(remainingPathWith(definition), maxLength, currPath);\n        return result.concat(alternatives);\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        /* istanbul ignore else */\n        if (prod instanceof Alternative) {\n            return getAlternativesForProd(prod.definition);\n        }\n        else if (prod instanceof NonTerminal) {\n            return getAlternativesForProd(prod.definition);\n        }\n        else if (prod instanceof Option) {\n            result = getAlternativesForProd(prod.definition);\n        }\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        }\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(prod.definition),\n                }),\n            ];\n            return getAlternativesForProd(newDef);\n        }\n        else if (prod instanceof RepetitionWithSeparator) {\n            const newDef = prod.definition.concat([\n                new Repetition({\n                    definition: [new Terminal({ terminalType: prod.separator })].concat(prod.definition),\n                }),\n            ]);\n            result = getAlternativesForProd(newDef);\n        }\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        }\n        else if (prod instanceof Alternation) {\n            forEach(prod.definition, (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 (isEmpty(currAlt.definition) === false) {\n                    result = getAlternativesForProd(currAlt.definition);\n                }\n            });\n            return result;\n        }\n        else if (prod instanceof Terminal) {\n            currPath.push(prod.terminalType);\n        }\n        else {\n            throw Error(\"non exhaustive match\");\n        }\n        i++;\n    }\n    result.push({\n        partialPath: currPath,\n        suffixDef: drop(targetDef, i),\n    });\n    return result;\n}\nexport function nextPossibleTokensAfter(initialDef, tokenVector, tokMatcher, maxLookAhead) {\n    const EXIT_NON_TERMINAL = \"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 = \"EXIT_ALTERNATIVE\";\n    let foundCompletePath = false;\n    const tokenVectorLength = tokenVector.length;\n    const minimalAlternativesIndex = tokenVectorLength - maxLookAhead - 1;\n    const result = [];\n    const possiblePaths = [];\n    possiblePaths.push({\n        idx: -1,\n        def: initialDef,\n        ruleStack: [],\n        occurrenceStack: [],\n    });\n    while (!isEmpty(possiblePaths)) {\n        const currPath = possiblePaths.pop();\n        // skip alternatives if no more results can be found (assuming deterministic grammar with fixed lookahead)\n        if (currPath === EXIT_ALTERNATIVE) {\n            if (foundCompletePath &&\n                last(possiblePaths).idx <= minimalAlternativesIndex) {\n                // remove irrelevant alternative\n                possiblePaths.pop();\n            }\n            continue;\n        }\n        const currDef = currPath.def;\n        const currIdx = currPath.idx;\n        const currRuleStack = currPath.ruleStack;\n        const currOccurrenceStack = currPath.occurrenceStack;\n        // For Example: an empty path could exist in a valid grammar in the case of an EMPTY_ALT\n        if (isEmpty(currDef)) {\n            continue;\n        }\n        const prod = currDef[0];\n        /* istanbul ignore else */\n        if (prod === EXIT_NON_TERMINAL) {\n            const nextPath = {\n                idx: currIdx,\n                def: drop(currDef),\n                ruleStack: dropRight(currRuleStack),\n                occurrenceStack: dropRight(currOccurrenceStack),\n            };\n            possiblePaths.push(nextPath);\n        }\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: drop(currDef),\n                        ruleStack: currRuleStack,\n                        occurrenceStack: currOccurrenceStack,\n                    };\n                    possiblePaths.push(nextPath);\n                }\n                // end of the line\n            }\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            }\n            else {\n                throw Error(\"non exhaustive match\");\n            }\n        }\n        else if (prod instanceof NonTerminal) {\n            const newRuleStack = clone(currRuleStack);\n            newRuleStack.push(prod.nonTerminalName);\n            const newOccurrenceStack = clone(currOccurrenceStack);\n            newOccurrenceStack.push(prod.idx);\n            const nextPath = {\n                idx: currIdx,\n                def: prod.definition.concat(EXIT_NON_TERMINAL_ARR, drop(currDef)),\n                ruleStack: newRuleStack,\n                occurrenceStack: newOccurrenceStack,\n            };\n            possiblePaths.push(nextPath);\n        }\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: drop(currDef),\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            const nextPathWith = {\n                idx: currIdx,\n                def: prod.definition.concat(drop(currDef)),\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWith);\n        }\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([secondIteration], drop(currDef));\n            const nextPath = {\n                idx: currIdx,\n                def: nextDef,\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPath);\n        }\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: [separatorGast].concat(prod.definition),\n                idx: prod.idx,\n            });\n            const nextDef = prod.definition.concat([secondIteration], drop(currDef));\n            const nextPath = {\n                idx: currIdx,\n                def: nextDef,\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPath);\n        }\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: drop(currDef),\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            const separatorGast = new Terminal({\n                terminalType: prod.separator,\n            });\n            const nthRepetition = new Repetition({\n                definition: [separatorGast].concat(prod.definition),\n                idx: prod.idx,\n            });\n            const nextDef = prod.definition.concat([nthRepetition], drop(currDef));\n            const nextPathWith = {\n                idx: currIdx,\n                def: nextDef,\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWith);\n        }\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: drop(currDef),\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            // 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], drop(currDef));\n            const nextPathWith = {\n                idx: currIdx,\n                def: nextDef,\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            };\n            possiblePaths.push(nextPathWith);\n        }\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 = prod.definition[i];\n                const currAltPath = {\n                    idx: currIdx,\n                    def: currAlt.definition.concat(drop(currDef)),\n                    ruleStack: currRuleStack,\n                    occurrenceStack: currOccurrenceStack,\n                };\n                possiblePaths.push(currAltPath);\n                possiblePaths.push(EXIT_ALTERNATIVE);\n            }\n        }\n        else if (prod instanceof Alternative) {\n            possiblePaths.push({\n                idx: currIdx,\n                def: prod.definition.concat(drop(currDef)),\n                ruleStack: currRuleStack,\n                occurrenceStack: currOccurrenceStack,\n            });\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(expandTopLevelRule(prod, currIdx, currRuleStack, currOccurrenceStack));\n        }\n        else {\n            throw Error(\"non exhaustive match\");\n        }\n    }\n    return result;\n}\nfunction expandTopLevelRule(topRule, currIdx, currRuleStack, currOccurrenceStack) {\n    const newRuleStack = clone(currRuleStack);\n    newRuleStack.push(topRule.name);\n    const newCurrOccurrenceStack = clone(currOccurrenceStack);\n    // top rule is always assumed to have been called with occurrence index 1\n    newCurrOccurrenceStack.push(1);\n    return {\n        idx: currIdx,\n        def: topRule.definition,\n        ruleStack: newRuleStack,\n        occurrenceStack: newCurrOccurrenceStack,\n    };\n}\n//# sourceMappingURL=interpreter.js.map","import { every, flatten, forEach, has, isEmpty, map, reduce } from \"lodash-es\";\nimport { possiblePathsFrom } from \"./interpreter.js\";\nimport { RestWalker } from \"./rest.js\";\nimport { tokenStructuredMatcher, tokenStructuredMatcherNoCategories, } from \"../../scan/tokens.js\";\nimport { Alternation, Alternative as AlternativeGAST, GAstVisitor, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, } from \"@chevrotain/gast\";\nexport var PROD_TYPE;\n(function (PROD_TYPE) {\n    PROD_TYPE[PROD_TYPE[\"OPTION\"] = 0] = \"OPTION\";\n    PROD_TYPE[PROD_TYPE[\"REPETITION\"] = 1] = \"REPETITION\";\n    PROD_TYPE[PROD_TYPE[\"REPETITION_MANDATORY\"] = 2] = \"REPETITION_MANDATORY\";\n    PROD_TYPE[PROD_TYPE[\"REPETITION_MANDATORY_WITH_SEPARATOR\"] = 3] = \"REPETITION_MANDATORY_WITH_SEPARATOR\";\n    PROD_TYPE[PROD_TYPE[\"REPETITION_WITH_SEPARATOR\"] = 4] = \"REPETITION_WITH_SEPARATOR\";\n    PROD_TYPE[PROD_TYPE[\"ALTERNATION\"] = 5] = \"ALTERNATION\";\n})(PROD_TYPE || (PROD_TYPE = {}));\nexport function getProdType(prod) {\n    /* istanbul ignore else */\n    if (prod instanceof Option || prod === \"Option\") {\n        return PROD_TYPE.OPTION;\n    }\n    else if (prod instanceof Repetition || prod === \"Repetition\") {\n        return PROD_TYPE.REPETITION;\n    }\n    else if (prod instanceof RepetitionMandatory ||\n        prod === \"RepetitionMandatory\") {\n        return PROD_TYPE.REPETITION_MANDATORY;\n    }\n    else if (prod instanceof RepetitionMandatoryWithSeparator ||\n        prod === \"RepetitionMandatoryWithSeparator\") {\n        return PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR;\n    }\n    else if (prod instanceof RepetitionWithSeparator ||\n        prod === \"RepetitionWithSeparator\") {\n        return PROD_TYPE.REPETITION_WITH_SEPARATOR;\n    }\n    else if (prod instanceof Alternation || prod === \"Alternation\") {\n        return PROD_TYPE.ALTERNATION;\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nexport function getLookaheadPaths(options) {\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    }\n    else {\n        return getLookaheadPathsForOptionalProd(occurrence, rule, type, maxLookahead);\n    }\n}\nexport function buildLookaheadFuncForOr(occurrence, ruleGrammar, maxLookahead, hasPredicates, dynamicTokensEnabled, laFuncBuilder) {\n    const lookAheadPaths = getLookaheadPathsForOr(occurrence, ruleGrammar, maxLookahead);\n    const tokenMatcher = areTokenCategoriesNotUsed(lookAheadPaths)\n        ? tokenStructuredMatcherNoCategories\n        : tokenStructuredMatcher;\n    return laFuncBuilder(lookAheadPaths, hasPredicates, tokenMatcher, dynamicTokensEnabled);\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(occurrence, ruleGrammar, k, dynamicTokensEnabled, prodType, lookaheadBuilder) {\n    const lookAheadPaths = getLookaheadPathsForOptionalProd(occurrence, ruleGrammar, prodType, k);\n    const tokenMatcher = areTokenCategoriesNotUsed(lookAheadPaths)\n        ? tokenStructuredMatcherNoCategories\n        : tokenStructuredMatcher;\n    return lookaheadBuilder(lookAheadPaths[0], tokenMatcher, dynamicTokensEnabled);\n}\nexport function buildAlternativesLookAheadFunc(alts, hasPredicates, tokenMatcher, dynamicTokensEnabled) {\n    const numOfAlts = alts.length;\n    const areAllOneTokenLookahead = every(alts, (currAlt) => {\n        return every(currAlt, (currPath) => {\n            return currPath.length === 1;\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 (orAlts) {\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 = map(orAlts, (currAlt) => currAlt.GATE);\n            for (let t = 0; t < numOfAlts; t++) {\n                const currAlt = alts[t];\n                const currNumOfPaths = currAlt.length;\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(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    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 = map(alts, (currAlt) => {\n            return flatten(currAlt);\n        });\n        const choiceToAlt = reduce(singleTokenAlts, (result, currAlt, idx) => {\n            forEach(currAlt, (currTokType) => {\n                if (!has(result, currTokType.tokenTypeIdx)) {\n                    result[currTokType.tokenTypeIdx] = idx;\n                }\n                forEach(currTokType.categoryMatches, (currExtendingType) => {\n                    if (!has(result, currExtendingType)) {\n                        result[currExtendingType] = idx;\n                    }\n                });\n            });\n            return result;\n        }, {});\n        /**\n         * @returns {number} - The chosen alternative index\n         */\n        return function () {\n            const nextToken = this.LA(1);\n            return choiceToAlt[nextToken.tokenTypeIdx];\n        };\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 () {\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(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}\nexport function buildSingleAlternativeLookaheadFunction(alt, tokenMatcher, dynamicTokensEnabled) {\n    const areAllOneTokenLookahead = every(alt, (currPath) => {\n        return currPath.length === 1;\n    });\n    const numOfPaths = alt.length;\n    // optimized (common) case of all the lookaheads paths requiring only\n    // a single token lookahead.\n    if (areAllOneTokenLookahead && !dynamicTokensEnabled) {\n        const singleTokensTypes = flatten(alt);\n        if (singleTokensTypes.length === 1 &&\n            isEmpty(singleTokensTypes[0].categoryMatches)) {\n            const expectedTokenType = singleTokensTypes[0];\n            const expectedTokenUniqueKey = expectedTokenType.tokenTypeIdx;\n            return function () {\n                return this.LA(1).tokenTypeIdx === expectedTokenUniqueKey;\n            };\n        }\n        else {\n            const choiceToAlt = reduce(singleTokensTypes, (result, currTokType, idx) => {\n                result[currTokType.tokenTypeIdx] = true;\n                forEach(currTokType.categoryMatches, (currExtendingType) => {\n                    result[currExtendingType] = true;\n                });\n                return result;\n            }, []);\n            return function () {\n                const nextToken = this.LA(1);\n                return choiceToAlt[nextToken.tokenTypeIdx] === true;\n            };\n        }\n    }\n    else {\n        return function () {\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(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            // none of the paths matched\n            return false;\n        };\n    }\n}\nclass RestDefinitionFinderWalker extends RestWalker {\n    constructor(topProd, targetOccurrence, targetProdType) {\n        super();\n        this.topProd = topProd;\n        this.targetOccurrence = targetOccurrence;\n        this.targetProdType = targetProdType;\n    }\n    startWalking() {\n        this.walk(this.topProd);\n        return this.restDef;\n    }\n    checkIsTarget(node, expectedProdType, currRest, prevRest) {\n        if (node.idx === this.targetOccurrence &&\n            this.targetProdType === expectedProdType) {\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    walkOption(optionProd, currRest, prevRest) {\n        if (!this.checkIsTarget(optionProd, PROD_TYPE.OPTION, currRest, prevRest)) {\n            super.walkOption(optionProd, currRest, prevRest);\n        }\n    }\n    walkAtLeastOne(atLeastOneProd, currRest, prevRest) {\n        if (!this.checkIsTarget(atLeastOneProd, PROD_TYPE.REPETITION_MANDATORY, currRest, prevRest)) {\n            super.walkOption(atLeastOneProd, currRest, prevRest);\n        }\n    }\n    walkAtLeastOneSep(atLeastOneSepProd, currRest, prevRest) {\n        if (!this.checkIsTarget(atLeastOneSepProd, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, currRest, prevRest)) {\n            super.walkOption(atLeastOneSepProd, currRest, prevRest);\n        }\n    }\n    walkMany(manyProd, currRest, prevRest) {\n        if (!this.checkIsTarget(manyProd, PROD_TYPE.REPETITION, currRest, prevRest)) {\n            super.walkOption(manyProd, currRest, prevRest);\n        }\n    }\n    walkManySep(manySepProd, currRest, prevRest) {\n        if (!this.checkIsTarget(manySepProd, PROD_TYPE.REPETITION_WITH_SEPARATOR, currRest, prevRest)) {\n            super.walkOption(manySepProd, currRest, prevRest);\n        }\n    }\n}\n/**\n * Returns the definition of a target production in a top level level rule.\n */\nclass InsideDefinitionFinderVisitor extends GAstVisitor {\n    constructor(targetOccurrence, targetProdType, targetRef) {\n        super();\n        this.targetOccurrence = targetOccurrence;\n        this.targetProdType = targetProdType;\n        this.targetRef = targetRef;\n        this.result = [];\n    }\n    checkIsTarget(node, expectedProdName) {\n        if (node.idx === this.targetOccurrence &&\n            this.targetProdType === expectedProdName &&\n            (this.targetRef === undefined || node === this.targetRef)) {\n            this.result = node.definition;\n        }\n    }\n    visitOption(node) {\n        this.checkIsTarget(node, PROD_TYPE.OPTION);\n    }\n    visitRepetition(node) {\n        this.checkIsTarget(node, PROD_TYPE.REPETITION);\n    }\n    visitRepetitionMandatory(node) {\n        this.checkIsTarget(node, PROD_TYPE.REPETITION_MANDATORY);\n    }\n    visitRepetitionMandatoryWithSeparator(node) {\n        this.checkIsTarget(node, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR);\n    }\n    visitRepetitionWithSeparator(node) {\n        this.checkIsTarget(node, PROD_TYPE.REPETITION_WITH_SEPARATOR);\n    }\n    visitAlternation(node) {\n        this.checkIsTarget(node, PROD_TYPE.ALTERNATION);\n    }\n}\nfunction initializeArrayOfArrays(size) {\n    const result = new Array(size);\n    for (let i = 0; i < size; i++) {\n        result[i] = [];\n    }\n    return result;\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) {\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 * Imperative style due to being called from a hot spot\n */\nfunction isUniquePrefixHash(altKnownPathsKeys, searchPathKeys, idx) {\n    for (let currAltIdx = 0; currAltIdx < altKnownPathsKeys.length; currAltIdx++) {\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}\nexport function lookAheadSequenceFromAlternatives(altsDefs, k) {\n    const partialAlts = map(altsDefs, (currAlt) => possiblePathsFrom([currAlt], 1));\n    const finalResult = initializeArrayOfArrays(partialAlts.length);\n    const altsHashes = map(partialAlts, (currAltPaths) => {\n        const dict = {};\n        forEach(currAltPaths, (item) => {\n            const keys = pathToHashKeys(item.partialPath);\n            forEach(keys, (currKey) => {\n                dict[currKey] = true;\n            });\n        });\n        return dict;\n    });\n    let newData = partialAlts;\n    // maxLookahead loop\n    for (let pathLength = 1; pathLength <= k; pathLength++) {\n        const currDataset = newData;\n        newData = initializeArrayOfArrays(currDataset.length);\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 (let currPathIdx = 0; currPathIdx < currAltPathsAndSuffixes.length; currPathIdx++) {\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 || isEmpty(suffixDef) || 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(suffixDef, pathLength + 1, currPathPrefix);\n                    newData[altIdx] = newData[altIdx].concat(newPartialPathsAndSuffixes);\n                    // Update keys for new known paths\n                    forEach(newPartialPathsAndSuffixes, (item) => {\n                        const prefixKeys = pathToHashKeys(item.partialPath);\n                        forEach(prefixKeys, (key) => {\n                            altsHashes[altIdx][key] = true;\n                        });\n                    });\n                }\n            }\n        }\n    }\n    return finalResult;\n}\nexport function getLookaheadPathsForOr(occurrence, ruleGrammar, k, orProd) {\n    const visitor = new InsideDefinitionFinderVisitor(occurrence, PROD_TYPE.ALTERNATION, orProd);\n    ruleGrammar.accept(visitor);\n    return lookAheadSequenceFromAlternatives(visitor.result, k);\n}\nexport function getLookaheadPathsForOptionalProd(occurrence, ruleGrammar, prodType, k) {\n    const insideDefVisitor = new InsideDefinitionFinderVisitor(occurrence, prodType);\n    ruleGrammar.accept(insideDefVisitor);\n    const insideDef = insideDefVisitor.result;\n    const afterDefWalker = new RestDefinitionFinderWalker(ruleGrammar, occurrence, prodType);\n    const afterDef = afterDefWalker.startWalking();\n    const insideFlat = new AlternativeGAST({ definition: insideDef });\n    const afterFlat = new AlternativeGAST({ definition: afterDef });\n    return lookAheadSequenceFromAlternatives([insideFlat, afterFlat], k);\n}\nexport function containsPath(alternative, searchPath) {\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            const matchingTokens = searchTok === otherTok ||\n                otherTok.categoryMatchesMap[searchTok.tokenTypeIdx] !== undefined;\n            if (matchingTokens === false) {\n                continue compareOtherPath;\n            }\n        }\n        return true;\n    }\n    return false;\n}\nexport function isStrictPrefixOfPath(prefix, other) {\n    return (prefix.length < other.length &&\n        every(prefix, (tokType, idx) => {\n            const otherTokType = other[idx];\n            return (tokType === otherTokType ||\n                otherTokType.categoryMatchesMap[tokType.tokenTypeIdx]);\n        }));\n}\nexport function areTokenCategoriesNotUsed(lookAheadPaths) {\n    return every(lookAheadPaths, (singleAltPaths) => every(singleAltPaths, (singlePath) => every(singlePath, (token) => isEmpty(token.categoryMatches))));\n}\n//# sourceMappingURL=lookahead.js.map","import { clone, compact, difference, drop, dropRight, filter, first, flatMap, flatten, forEach, groupBy, includes, isEmpty, map, pickBy, reduce, reject, values, } from \"lodash-es\";\nimport { ParserDefinitionErrorType, } from \"../parser/parser.js\";\nimport { Alternation, Alternative as AlternativeGAST, GAstVisitor, getProductionDslName, isOptionalProd, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Terminal, } from \"@chevrotain/gast\";\nimport { containsPath, getLookaheadPathsForOptionalProd, getLookaheadPathsForOr, getProdType, isStrictPrefixOfPath, } from \"./lookahead.js\";\nimport { nextPossibleTokensAfter } from \"./interpreter.js\";\nimport { tokenStructuredMatcher } from \"../../scan/tokens.js\";\nexport function validateLookahead(options) {\n    const lookaheadValidationErrorMessages = options.lookaheadStrategy.validate({\n        rules: options.rules,\n        tokenTypes: options.tokenTypes,\n        grammarName: options.grammarName,\n    });\n    return map(lookaheadValidationErrorMessages, (errorMessage) => (Object.assign({ type: ParserDefinitionErrorType.CUSTOM_LOOKAHEAD_VALIDATION }, errorMessage)));\n}\nexport function validateGrammar(topLevels, tokenTypes, errMsgProvider, grammarName) {\n    const duplicateErrors = flatMap(topLevels, (currTopLevel) => validateDuplicateProductions(currTopLevel, errMsgProvider));\n    const termsNamespaceConflictErrors = checkTerminalAndNoneTerminalsNameSpace(topLevels, tokenTypes, errMsgProvider);\n    const tooManyAltsErrors = flatMap(topLevels, (curRule) => validateTooManyAlts(curRule, errMsgProvider));\n    const duplicateRulesError = flatMap(topLevels, (curRule) => validateRuleDoesNotAlreadyExist(curRule, topLevels, grammarName, errMsgProvider));\n    return duplicateErrors.concat(termsNamespaceConflictErrors, tooManyAltsErrors, duplicateRulesError);\n}\nfunction validateDuplicateProductions(topLevelRule, errMsgProvider) {\n    const collectorVisitor = new OccurrenceValidationCollector();\n    topLevelRule.accept(collectorVisitor);\n    const allRuleProductions = collectorVisitor.allProductions;\n    const productionGroups = groupBy(allRuleProductions, identifyProductionForDuplicates);\n    const duplicates = pickBy(productionGroups, (currGroup) => {\n        return currGroup.length > 1;\n    });\n    const errors = map(values(duplicates), (currDuplicates) => {\n        const firstProd = first(currDuplicates);\n        const msg = errMsgProvider.buildDuplicateFoundError(topLevelRule, currDuplicates);\n        const dslName = getProductionDslName(firstProd);\n        const defError = {\n            message: msg,\n            type: ParserDefinitionErrorType.DUPLICATE_PRODUCTIONS,\n            ruleName: topLevelRule.name,\n            dslName: dslName,\n            occurrence: firstProd.idx,\n        };\n        const param = getExtraProductionArgument(firstProd);\n        if (param) {\n            defError.parameter = param;\n        }\n        return defError;\n    });\n    return errors;\n}\nexport function identifyProductionForDuplicates(prod) {\n    return `${getProductionDslName(prod)}_#_${prod.idx}_#_${getExtraProductionArgument(prod)}`;\n}\nfunction getExtraProductionArgument(prod) {\n    if (prod instanceof Terminal) {\n        return prod.terminalType.name;\n    }\n    else if (prod instanceof NonTerminal) {\n        return prod.nonTerminalName;\n    }\n    else {\n        return \"\";\n    }\n}\nexport class OccurrenceValidationCollector extends GAstVisitor {\n    constructor() {\n        super(...arguments);\n        this.allProductions = [];\n    }\n    visitNonTerminal(subrule) {\n        this.allProductions.push(subrule);\n    }\n    visitOption(option) {\n        this.allProductions.push(option);\n    }\n    visitRepetitionWithSeparator(manySep) {\n        this.allProductions.push(manySep);\n    }\n    visitRepetitionMandatory(atLeastOne) {\n        this.allProductions.push(atLeastOne);\n    }\n    visitRepetitionMandatoryWithSeparator(atLeastOneSep) {\n        this.allProductions.push(atLeastOneSep);\n    }\n    visitRepetition(many) {\n        this.allProductions.push(many);\n    }\n    visitAlternation(or) {\n        this.allProductions.push(or);\n    }\n    visitTerminal(terminal) {\n        this.allProductions.push(terminal);\n    }\n}\nexport function validateRuleDoesNotAlreadyExist(rule, allRules, className, errMsgProvider) {\n    const errors = [];\n    const occurrences = reduce(allRules, (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    return errors;\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(ruleName, definedRulesNames, className) {\n    const errors = [];\n    let errMsg;\n    if (!includes(definedRulesNames, 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    return errors;\n}\nexport function validateNoLeftRecursion(topRule, currRule, errMsgProvider, path = []) {\n    const errors = [];\n    const nextNonTerminals = getFirstNoneTerminal(currRule.definition);\n    if (isEmpty(nextNonTerminals)) {\n        return [];\n    }\n    else {\n        const ruleName = topRule.name;\n        const foundLeftRecursion = includes(nextNonTerminals, 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        // 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 validNextSteps = difference(nextNonTerminals, path.concat([topRule]));\n        const errorsFromNextSteps = flatMap(validNextSteps, (currRefRule) => {\n            const newPath = clone(path);\n            newPath.push(currRefRule);\n            return validateNoLeftRecursion(topRule, currRefRule, errMsgProvider, newPath);\n        });\n        return errors.concat(errorsFromNextSteps);\n    }\n}\nexport function getFirstNoneTerminal(definition) {\n    let result = [];\n    if (isEmpty(definition)) {\n        return result;\n    }\n    const firstProd = first(definition);\n    /* istanbul ignore else */\n    if (firstProd instanceof NonTerminal) {\n        result.push(firstProd.referencedRule);\n    }\n    else if (firstProd instanceof AlternativeGAST ||\n        firstProd instanceof Option ||\n        firstProd instanceof RepetitionMandatory ||\n        firstProd instanceof RepetitionMandatoryWithSeparator ||\n        firstProd instanceof RepetitionWithSeparator ||\n        firstProd instanceof Repetition) {\n        result = result.concat(getFirstNoneTerminal(firstProd.definition));\n    }\n    else if (firstProd instanceof Alternation) {\n        // each sub definition in alternation is a FLAT\n        result = flatten(map(firstProd.definition, (currSubDef) => getFirstNoneTerminal(currSubDef.definition)));\n    }\n    else if (firstProd instanceof Terminal) {\n        // nothing to see, move along\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n    const isFirstOptional = isOptionalProd(firstProd);\n    const hasMore = definition.length > 1;\n    if (isFirstOptional && hasMore) {\n        const rest = drop(definition);\n        return result.concat(getFirstNoneTerminal(rest));\n    }\n    else {\n        return result;\n    }\n}\nclass OrCollector extends GAstVisitor {\n    constructor() {\n        super(...arguments);\n        this.alternations = [];\n    }\n    visitAlternation(node) {\n        this.alternations.push(node);\n    }\n}\nexport function validateEmptyOrAlternative(topLevelRule, errMsgProvider) {\n    const orCollector = new OrCollector();\n    topLevelRule.accept(orCollector);\n    const ors = orCollector.alternations;\n    const errors = flatMap(ors, (currOr) => {\n        const exceptLast = dropRight(currOr.definition);\n        return flatMap(exceptLast, (currAlternative, currAltIdx) => {\n            const possibleFirstInAlt = nextPossibleTokensAfter([currAlternative], [], tokenStructuredMatcher, 1);\n            if (isEmpty(possibleFirstInAlt)) {\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            }\n            else {\n                return [];\n            }\n        });\n    });\n    return errors;\n}\nexport function validateAmbiguousAlternationAlternatives(topLevelRule, globalMaxLookahead, errMsgProvider) {\n    const orCollector = new OrCollector();\n    topLevelRule.accept(orCollector);\n    let ors = orCollector.alternations;\n    // New Handling of ignoring ambiguities\n    // - https://github.com/chevrotain/chevrotain/issues/869\n    ors = reject(ors, (currOr) => currOr.ignoreAmbiguities === true);\n    const errors = flatMap(ors, (currOr) => {\n        const currOccurrence = currOr.idx;\n        const actualMaxLookahead = currOr.maxLookahead || globalMaxLookahead;\n        const alternatives = getLookaheadPathsForOr(currOccurrence, topLevelRule, actualMaxLookahead, currOr);\n        const altsAmbiguityErrors = checkAlternativesAmbiguities(alternatives, currOr, topLevelRule, errMsgProvider);\n        const altsPrefixAmbiguityErrors = checkPrefixAlternativesAmbiguities(alternatives, currOr, topLevelRule, errMsgProvider);\n        return altsAmbiguityErrors.concat(altsPrefixAmbiguityErrors);\n    });\n    return errors;\n}\nexport class RepetitionCollector extends GAstVisitor {\n    constructor() {\n        super(...arguments);\n        this.allProductions = [];\n    }\n    visitRepetitionWithSeparator(manySep) {\n        this.allProductions.push(manySep);\n    }\n    visitRepetitionMandatory(atLeastOne) {\n        this.allProductions.push(atLeastOne);\n    }\n    visitRepetitionMandatoryWithSeparator(atLeastOneSep) {\n        this.allProductions.push(atLeastOneSep);\n    }\n    visitRepetition(many) {\n        this.allProductions.push(many);\n    }\n}\nexport function validateTooManyAlts(topLevelRule, errMsgProvider) {\n    const orCollector = new OrCollector();\n    topLevelRule.accept(orCollector);\n    const ors = orCollector.alternations;\n    const errors = flatMap(ors, (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        }\n        else {\n            return [];\n        }\n    });\n    return errors;\n}\nexport function validateSomeNonEmptyLookaheadPath(topLevelRules, maxLookahead, errMsgProvider) {\n    const errors = [];\n    forEach(topLevelRules, (currTopRule) => {\n        const collectorVisitor = new RepetitionCollector();\n        currTopRule.accept(collectorVisitor);\n        const allRuleProductions = collectorVisitor.allProductions;\n        forEach(allRuleProductions, (currProd) => {\n            const prodType = getProdType(currProd);\n            const actualMaxLookahead = currProd.maxLookahead || maxLookahead;\n            const currOccurrence = currProd.idx;\n            const paths = getLookaheadPathsForOptionalProd(currOccurrence, currTopRule, prodType, actualMaxLookahead);\n            const pathsInsideProduction = paths[0];\n            if (isEmpty(flatten(pathsInsideProduction))) {\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    return errors;\n}\nfunction checkAlternativesAmbiguities(alternatives, alternation, rule, errMsgProvider) {\n    const foundAmbiguousPaths = [];\n    const identicalAmbiguities = reduce(alternatives, (result, currAlt, currAltIdx) => {\n        // ignore (skip) ambiguities with this alternative\n        if (alternation.definition[currAltIdx].ignoreAmbiguities === true) {\n            return result;\n        }\n        forEach(currAlt, (currPath) => {\n            const altsCurrPathAppearsIn = [currAltIdx];\n            forEach(alternatives, (currOtherAlt, currOtherAltIdx) => {\n                if (currAltIdx !== currOtherAltIdx &&\n                    containsPath(currOtherAlt, currPath) &&\n                    // ignore (skip) ambiguities with this \"other\" alternative\n                    alternation.definition[currOtherAltIdx].ignoreAmbiguities !== true) {\n                    altsCurrPathAppearsIn.push(currOtherAltIdx);\n                }\n            });\n            if (altsCurrPathAppearsIn.length > 1 &&\n                !containsPath(foundAmbiguousPaths, currPath)) {\n                foundAmbiguousPaths.push(currPath);\n                result.push({\n                    alts: altsCurrPathAppearsIn,\n                    path: currPath,\n                });\n            }\n        });\n        return result;\n    }, []);\n    const currErrors = map(identicalAmbiguities, (currAmbDescriptor) => {\n        const ambgIndices = map(currAmbDescriptor.alts, (currAltIdx) => currAltIdx + 1);\n        const currMessage = errMsgProvider.buildAlternationAmbiguityError({\n            topLevelRule: rule,\n            alternation: alternation,\n            ambiguityIndices: ambgIndices,\n            prefixPath: currAmbDescriptor.path,\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    return currErrors;\n}\nexport function checkPrefixAlternativesAmbiguities(alternatives, alternation, rule, errMsgProvider) {\n    // flatten\n    const pathsAndIndices = reduce(alternatives, (result, currAlt, idx) => {\n        const currPathsAndIdx = map(currAlt, (currPath) => {\n            return { idx: idx, path: currPath };\n        });\n        return result.concat(currPathsAndIdx);\n    }, []);\n    const errors = compact(flatMap(pathsAndIndices, (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        const prefixAmbiguitiesPathsAndIndices = filter(pathsAndIndices, (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        const currPathPrefixErrors = map(prefixAmbiguitiesPathsAndIndices, (currAmbPathAndIdx) => {\n            const ambgIndices = [currAmbPathAndIdx.idx + 1, targetIdx + 1];\n            const occurrence = alternation.idx === 0 ? \"\" : alternation.idx;\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        return currPathPrefixErrors;\n    }));\n    return errors;\n}\nfunction checkTerminalAndNoneTerminalsNameSpace(topLevels, tokenTypes, errMsgProvider) {\n    const errors = [];\n    const tokenNames = map(tokenTypes, (currToken) => currToken.name);\n    forEach(topLevels, (currRule) => {\n        const currRuleName = currRule.name;\n        if (includes(tokenNames, currRuleName)) {\n            const errMsg = errMsgProvider.buildNamespaceConflictError(currRule);\n            errors.push({\n                message: errMsg,\n                type: ParserDefinitionErrorType.CONFLICT_TOKENS_RULES_NAMESPACE,\n                ruleName: currRuleName,\n            });\n        }\n    });\n    return errors;\n}\n//# sourceMappingURL=checks.js.map","import { defaults, forEach } from \"lodash-es\";\nimport { resolveGrammar as orgResolveGrammar } from \"../resolver.js\";\nimport { validateGrammar as orgValidateGrammar } from \"../checks.js\";\nimport { defaultGrammarResolverErrorProvider, defaultGrammarValidatorErrorProvider, } from \"../../errors_public.js\";\nexport function resolveGrammar(options) {\n    const actualOptions = defaults(options, {\n        errMsgProvider: defaultGrammarResolverErrorProvider,\n    });\n    const topRulesTable = {};\n    forEach(options.rules, (rule) => {\n        topRulesTable[rule.name] = rule;\n    });\n    return orgResolveGrammar(topRulesTable, actualOptions.errMsgProvider);\n}\nexport function validateGrammar(options) {\n    options = defaults(options, {\n        errMsgProvider: defaultGrammarValidatorErrorProvider,\n    });\n    return orgValidateGrammar(options.rules, options.tokenTypes, options.errMsgProvider, options.grammarName);\n}\n//# sourceMappingURL=gast_resolver_public.js.map","import { includes } from \"lodash-es\";\nconst MISMATCHED_TOKEN_EXCEPTION = \"MismatchedTokenException\";\nconst NO_VIABLE_ALT_EXCEPTION = \"NoViableAltException\";\nconst EARLY_EXIT_EXCEPTION = \"EarlyExitException\";\nconst NOT_ALL_INPUT_PARSED_EXCEPTION = \"NotAllInputParsedException\";\nconst RECOGNITION_EXCEPTION_NAMES = [\n    MISMATCHED_TOKEN_EXCEPTION,\n    NO_VIABLE_ALT_EXCEPTION,\n    EARLY_EXIT_EXCEPTION,\n    NOT_ALL_INPUT_PARSED_EXCEPTION,\n];\nObject.freeze(RECOGNITION_EXCEPTION_NAMES);\n// hacks to bypass no support for custom Errors in javascript/typescript\nexport function isRecognitionException(error) {\n    // can't do instanceof on hacked custom js exceptions\n    return includes(RECOGNITION_EXCEPTION_NAMES, error.name);\n}\nclass RecognitionException extends Error {\n    constructor(message, token) {\n        super(message);\n        this.token = token;\n        this.resyncedTokens = [];\n        // fix prototype chain when typescript target is ES5\n        Object.setPrototypeOf(this, new.target.prototype);\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}\nexport class MismatchedTokenException extends RecognitionException {\n    constructor(message, token, previousToken) {\n        super(message, token);\n        this.previousToken = previousToken;\n        this.name = MISMATCHED_TOKEN_EXCEPTION;\n    }\n}\nexport class NoViableAltException extends RecognitionException {\n    constructor(message, token, previousToken) {\n        super(message, token);\n        this.previousToken = previousToken;\n        this.name = NO_VIABLE_ALT_EXCEPTION;\n    }\n}\nexport class NotAllInputParsedException extends RecognitionException {\n    constructor(message, token) {\n        super(message, token);\n        this.name = NOT_ALL_INPUT_PARSED_EXCEPTION;\n    }\n}\nexport class EarlyExitException extends RecognitionException {\n    constructor(message, token, previousToken) {\n        super(message, token);\n        this.previousToken = previousToken;\n        this.name = EARLY_EXIT_EXCEPTION;\n    }\n}\n//# sourceMappingURL=exceptions_public.js.map","import { createTokenInstance, EOF, tokenMatcher, } from \"../../../scan/tokens_public.js\";\nimport { clone, dropRight, find, flatten, has, includes, isEmpty, map, } from \"lodash-es\";\nimport { MismatchedTokenException } from \"../../exceptions_public.js\";\nimport { IN } from \"../../constants.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\nexport const EOF_FOLLOW_KEY = {};\nexport const IN_RULE_RECOVERY_EXCEPTION = \"InRuleRecoveryException\";\nexport class InRuleRecoveryException extends Error {\n    constructor(message) {\n        super(message);\n        this.name = IN_RULE_RECOVERY_EXCEPTION;\n    }\n}\n/**\n * This trait is responsible for the error recovery and fault tolerant logic\n */\nexport class Recoverable {\n    initRecoverable(config) {\n        this.firstAfterRepMap = {};\n        this.resyncFollows = {};\n        this.recoveryEnabled = has(config, \"recoveryEnabled\")\n            ? config.recoveryEnabled // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.recoveryEnabled;\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    getTokenToInsert(tokType) {\n        const tokToInsert = createTokenInstance(tokType, \"\", NaN, NaN, NaN, NaN, NaN, NaN);\n        tokToInsert.isInsertedInRecovery = true;\n        return tokToInsert;\n    }\n    canTokenTypeBeInsertedInRecovery(tokType) {\n        return true;\n    }\n    canTokenTypeBeDeletedInRecovery(tokType) {\n        return true;\n    }\n    tryInRepetitionRecovery(grammarRule, grammarRuleArgs, lookAheadFunc, expectedTokType) {\n        // TODO: can the resyncTokenType be cached?\n        const reSyncTokType = this.findReSyncTokenType();\n        const savedLexerState = this.exportLexerState();\n        const resyncedTokens = [];\n        let passedResyncPoint = false;\n        const nextTokenWithoutResync = this.LA(1);\n        let currToken = this.LA(1);\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(msg, nextTokenWithoutResync, this.LA(0));\n            // the first token here will be the original cause of the error, this is not part of the resyncedTokens property.\n            error.resyncedTokens = dropRight(resyncedTokens);\n            this.SAVE_ERROR(error);\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            }\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            }\n            else if (this.tokenMatcher(currToken, reSyncTokType)) {\n                passedResyncPoint = true;\n            }\n            else {\n                currToken = this.SKIP_TOKEN();\n                this.addToResyncTokens(currToken, resyncedTokens);\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    shouldInRepetitionRecoveryBeTried(expectTokAfterLastMatch, nextTokIdx, notStuck) {\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        // no need to recover, next token is what we expect...\n        if (this.tokenMatcher(this.LA(1), expectTokAfterLastMatch)) {\n            return false;\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        // 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 (this.canPerformInRuleRecovery(expectTokAfterLastMatch, this.getFollowsForInRuleRecovery(expectTokAfterLastMatch, nextTokIdx))) {\n            return false;\n        }\n        return true;\n    }\n    // Error Recovery functionality\n    getFollowsForInRuleRecovery(tokType, tokIdxInRule) {\n        const grammarPath = this.getCurrentGrammarPath(tokType, tokIdxInRule);\n        const follows = this.getNextPossibleTokenTypes(grammarPath);\n        return follows;\n    }\n    tryInRuleRecovery(expectedTokType, follows) {\n        if (this.canRecoverWithSingleTokenInsertion(expectedTokType, follows)) {\n            const tokToInsert = this.getTokenToInsert(expectedTokType);\n            return tokToInsert;\n        }\n        if (this.canRecoverWithSingleTokenDeletion(expectedTokType)) {\n            const nextTok = this.SKIP_TOKEN();\n            this.consumeToken();\n            return nextTok;\n        }\n        throw new InRuleRecoveryException(\"sad sad panda\");\n    }\n    canPerformInRuleRecovery(expectedToken, follows) {\n        return (this.canRecoverWithSingleTokenInsertion(expectedToken, follows) ||\n            this.canRecoverWithSingleTokenDeletion(expectedToken));\n    }\n    canRecoverWithSingleTokenInsertion(expectedTokType, follows) {\n        if (!this.canTokenTypeBeInsertedInRecovery(expectedTokType)) {\n            return false;\n        }\n        // must know the possible following tokens to perform single token insertion\n        if (isEmpty(follows)) {\n            return false;\n        }\n        const mismatchedTok = this.LA(1);\n        const isMisMatchedTokInFollows = find(follows, (possibleFollowsTokType) => {\n            return this.tokenMatcher(mismatchedTok, possibleFollowsTokType);\n        }) !== undefined;\n        return isMisMatchedTokInFollows;\n    }\n    canRecoverWithSingleTokenDeletion(expectedTokType) {\n        if (!this.canTokenTypeBeDeletedInRecovery(expectedTokType)) {\n            return false;\n        }\n        const isNextTokenWhatIsExpected = this.tokenMatcher(this.LA(2), expectedTokType);\n        return isNextTokenWhatIsExpected;\n    }\n    isInCurrentRuleReSyncSet(tokenTypeIdx) {\n        const followKey = this.getCurrFollowKey();\n        const currentRuleReSyncSet = this.getFollowSetFromFollowKey(followKey);\n        return includes(currentRuleReSyncSet, tokenTypeIdx);\n    }\n    findReSyncTokenType() {\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(1);\n        let k = 2;\n        while (true) {\n            const foundMatch = find(allPossibleReSyncTokTypes, (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    getCurrFollowKey() {\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.length === 1) {\n            return EOF_FOLLOW_KEY;\n        }\n        const currRuleShortName = this.getLastExplicitRuleShortName();\n        const currRuleIdx = this.getLastExplicitRuleOccurrenceIndex();\n        const prevRuleShortName = this.getPreviousExplicitRuleShortName();\n        return {\n            ruleName: this.shortRuleNameToFullName(currRuleShortName),\n            idxInCallingRule: currRuleIdx,\n            inRule: this.shortRuleNameToFullName(prevRuleShortName),\n        };\n    }\n    buildFullFollowKeyStack() {\n        const explicitRuleStack = this.RULE_STACK;\n        const explicitOccurrenceStack = this.RULE_OCCURRENCE_STACK;\n        return map(explicitRuleStack, (ruleName, idx) => {\n            if (idx === 0) {\n                return EOF_FOLLOW_KEY;\n            }\n            return {\n                ruleName: this.shortRuleNameToFullName(ruleName),\n                idxInCallingRule: explicitOccurrenceStack[idx],\n                inRule: this.shortRuleNameToFullName(explicitRuleStack[idx - 1]),\n            };\n        });\n    }\n    flattenFollowSet() {\n        const followStack = map(this.buildFullFollowKeyStack(), (currKey) => {\n            return this.getFollowSetFromFollowKey(currKey);\n        });\n        return flatten(followStack);\n    }\n    getFollowSetFromFollowKey(followKey) {\n        if (followKey === EOF_FOLLOW_KEY) {\n            return [EOF];\n        }\n        const followName = followKey.ruleName + followKey.idxInCallingRule + IN + followKey.inRule;\n        return this.resyncFollows[followName];\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(token, resyncTokens) {\n        if (!this.tokenMatcher(token, EOF)) {\n            resyncTokens.push(token);\n        }\n        return resyncTokens;\n    }\n    reSyncTo(tokType) {\n        const resyncedTokens = [];\n        let nextTok = this.LA(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 dropRight(resyncedTokens);\n    }\n    attemptInRepetitionRecovery(prodFunc, args, lookaheadFunc, dslMethodIdx, prodOccurrence, nextToksWalker, notStuck) {\n        // by default this is a NO-OP\n        // The actual implementation is with the function(not method) below\n    }\n    getCurrentGrammarPath(tokType, tokIdxInRule) {\n        const pathRuleStack = this.getHumanReadableRuleStack();\n        const pathOccurrenceStack = clone(this.RULE_OCCURRENCE_STACK);\n        const grammarPath = {\n            ruleStack: pathRuleStack,\n            occurrenceStack: pathOccurrenceStack,\n            lastTok: tokType,\n            lastTokOccurrence: tokIdxInRule,\n        };\n        return grammarPath;\n    }\n    getHumanReadableRuleStack() {\n        return map(this.RULE_STACK, (currShortName) => this.shortRuleNameToFullName(currShortName));\n    }\n}\nexport function attemptInRepetitionRecovery(prodFunc, args, lookaheadFunc, dslMethodIdx, prodOccurrence, nextToksWalker, notStuck) {\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 = new nextToksWalker(ruleGrammar, prodOccurrence);\n        firstAfterRepInfo = walker.startWalking();\n        this.firstAfterRepMap[key] = firstAfterRepInfo;\n    }\n    let expectTokAfterLastMatch = firstAfterRepInfo.token;\n    let nextTokIdx = firstAfterRepInfo.occurrence;\n    const isEndOfRule = firstAfterRepInfo.isEndOfRule;\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 (this.RULE_STACK.length === 1 &&\n        isEndOfRule &&\n        expectTokAfterLastMatch === undefined) {\n        expectTokAfterLastMatch = EOF;\n        nextTokIdx = 1;\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    if (this.shouldInRepetitionRecoveryBeTried(expectTokAfterLastMatch, nextTokIdx, notStuck)) {\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(prodFunc, args, lookaheadFunc, expectTokAfterLastMatch);\n    }\n}\n//# sourceMappingURL=recoverable.js.map","// 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\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// 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// this actually returns a number, but it is always used as a string (object prop key)\nexport function getKeyForAutomaticLookahead(ruleIdx, dslMethodIdx, occurrence) {\n    return occurrence | dslMethodIdx | ruleIdx;\n}\nconst BITS_START_FOR_ALT_IDX = 32 - BITS_FOR_ALT_IDX;\n//# sourceMappingURL=keys.js.map","import { flatMap, isEmpty } from \"lodash-es\";\nimport { defaultGrammarValidatorErrorProvider } from \"../errors_public.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser/parser.js\";\nimport { validateAmbiguousAlternationAlternatives, validateEmptyOrAlternative, validateNoLeftRecursion, validateSomeNonEmptyLookaheadPath, } from \"./checks.js\";\nimport { buildAlternativesLookAheadFunc, buildLookaheadFuncForOptionalProd, buildLookaheadFuncForOr, buildSingleAlternativeLookaheadFunction, getProdType, } from \"./lookahead.js\";\nexport class LLkLookaheadStrategy {\n    constructor(options) {\n        var _a;\n        this.maxLookahead =\n            (_a = options === null || options === void 0 ? void 0 : options.maxLookahead) !== null && _a !== void 0 ? _a : DEFAULT_PARSER_CONFIG.maxLookahead;\n    }\n    validate(options) {\n        const leftRecursionErrors = this.validateNoLeftRecursion(options.rules);\n        if (isEmpty(leftRecursionErrors)) {\n            const emptyAltErrors = this.validateEmptyOrAlternatives(options.rules);\n            const ambiguousAltsErrors = this.validateAmbiguousAlternationAlternatives(options.rules, this.maxLookahead);\n            const emptyRepetitionErrors = this.validateSomeNonEmptyLookaheadPath(options.rules, this.maxLookahead);\n            const allErrors = [\n                ...leftRecursionErrors,\n                ...emptyAltErrors,\n                ...ambiguousAltsErrors,\n                ...emptyRepetitionErrors,\n            ];\n            return allErrors;\n        }\n        return leftRecursionErrors;\n    }\n    validateNoLeftRecursion(rules) {\n        return flatMap(rules, (currTopRule) => validateNoLeftRecursion(currTopRule, currTopRule, defaultGrammarValidatorErrorProvider));\n    }\n    validateEmptyOrAlternatives(rules) {\n        return flatMap(rules, (currTopRule) => validateEmptyOrAlternative(currTopRule, defaultGrammarValidatorErrorProvider));\n    }\n    validateAmbiguousAlternationAlternatives(rules, maxLookahead) {\n        return flatMap(rules, (currTopRule) => validateAmbiguousAlternationAlternatives(currTopRule, maxLookahead, defaultGrammarValidatorErrorProvider));\n    }\n    validateSomeNonEmptyLookaheadPath(rules, maxLookahead) {\n        return validateSomeNonEmptyLookaheadPath(rules, maxLookahead, defaultGrammarValidatorErrorProvider);\n    }\n    buildLookaheadForAlternation(options) {\n        return buildLookaheadFuncForOr(options.prodOccurrence, options.rule, options.maxLookahead, options.hasPredicates, options.dynamicTokensEnabled, buildAlternativesLookAheadFunc);\n    }\n    buildLookaheadForOptional(options) {\n        return buildLookaheadFuncForOptionalProd(options.prodOccurrence, options.rule, options.maxLookahead, options.dynamicTokensEnabled, getProdType(options.prodType), buildSingleAlternativeLookaheadFunction);\n    }\n}\n//# sourceMappingURL=llk_lookahead.js.map","import { forEach, has } from \"lodash-es\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\nimport { AT_LEAST_ONE_IDX, AT_LEAST_ONE_SEP_IDX, getKeyForAutomaticLookahead, MANY_IDX, MANY_SEP_IDX, OPTION_IDX, OR_IDX, } from \"../../grammar/keys.js\";\nimport { GAstVisitor, getProductionDslName, } from \"@chevrotain/gast\";\nimport { LLkLookaheadStrategy } from \"../../grammar/llk_lookahead.js\";\n/**\n * Trait responsible for the lookahead related utilities and optimizations.\n */\nexport class LooksAhead {\n    initLooksAhead(config) {\n        this.dynamicTokensEnabled = has(config, \"dynamicTokensEnabled\")\n            ? config.dynamicTokensEnabled // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.dynamicTokensEnabled;\n        this.maxLookahead = has(config, \"maxLookahead\")\n            ? config.maxLookahead // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.maxLookahead;\n        this.lookaheadStrategy = has(config, \"lookaheadStrategy\")\n            ? config.lookaheadStrategy // assumes end user provides the correct config value/type\n            : new LLkLookaheadStrategy({ maxLookahead: this.maxLookahead });\n        this.lookAheadFuncsCache = new Map();\n    }\n    preComputeLookaheadFunctions(rules) {\n        forEach(rules, (currRule) => {\n            this.TRACE_INIT(`${currRule.name} Rule Lookahead`, () => {\n                const { alternation, repetition, option, repetitionMandatory, repetitionMandatoryWithSeparator, repetitionWithSeparator, } = collectMethods(currRule);\n                forEach(alternation, (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                        const key = getKeyForAutomaticLookahead(this.fullRuleNameToShort[currRule.name], OR_IDX, currProd.idx);\n                        this.setLaFuncCache(key, laFunc);\n                    });\n                });\n                forEach(repetition, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, MANY_IDX, \"Repetition\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n                forEach(option, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, OPTION_IDX, \"Option\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n                forEach(repetitionMandatory, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, AT_LEAST_ONE_IDX, \"RepetitionMandatory\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n                forEach(repetitionMandatoryWithSeparator, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, AT_LEAST_ONE_SEP_IDX, \"RepetitionMandatoryWithSeparator\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n                forEach(repetitionWithSeparator, (currProd) => {\n                    this.computeLookaheadFunc(currRule, currProd.idx, MANY_SEP_IDX, \"RepetitionWithSeparator\", currProd.maxLookahead, getProductionDslName(currProd));\n                });\n            });\n        });\n    }\n    computeLookaheadFunc(rule, prodOccurrence, prodKey, prodType, prodMaxLookahead, dslMethodName) {\n        this.TRACE_INIT(`${dslMethodName}${prodOccurrence === 0 ? \"\" : prodOccurrence}`, () => {\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(this.fullRuleNameToShort[rule.name], prodKey, prodOccurrence);\n            this.setLaFuncCache(key, laFunc);\n        });\n    }\n    // this actually returns a number, but it is always used as a string (object prop key)\n    getKeyForAutomaticLookahead(dslMethodIdx, occurrence) {\n        const currRuleShortName = this.getLastExplicitRuleShortName();\n        return getKeyForAutomaticLookahead(currRuleShortName, dslMethodIdx, occurrence);\n    }\n    getLaFuncFromCache(key) {\n        return this.lookAheadFuncsCache.get(key);\n    }\n    /* istanbul ignore next */\n    setLaFuncCache(key, value) {\n        this.lookAheadFuncsCache.set(key, value);\n    }\n}\nclass DslMethodsCollectorVisitor extends GAstVisitor {\n    constructor() {\n        super(...arguments);\n        this.dslMethods = {\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    visitOption(option) {\n        this.dslMethods.option.push(option);\n    }\n    visitRepetitionWithSeparator(manySep) {\n        this.dslMethods.repetitionWithSeparator.push(manySep);\n    }\n    visitRepetitionMandatory(atLeastOne) {\n        this.dslMethods.repetitionMandatory.push(atLeastOne);\n    }\n    visitRepetitionMandatoryWithSeparator(atLeastOneSep) {\n        this.dslMethods.repetitionMandatoryWithSeparator.push(atLeastOneSep);\n    }\n    visitRepetition(many) {\n        this.dslMethods.repetition.push(many);\n    }\n    visitAlternation(or) {\n        this.dslMethods.alternation.push(or);\n    }\n}\nconst collectorVisitor = new DslMethodsCollectorVisitor();\nexport function collectMethods(rule) {\n    collectorVisitor.reset();\n    rule.accept(collectorVisitor);\n    const dslMethods = collectorVisitor.dslMethods;\n    // avoid uncleaned references\n    collectorVisitor.reset();\n    return dslMethods;\n}\n//# sourceMappingURL=looksahead.js.map","/**\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(currNodeLocation, newLocationInfo) {\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 * 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(currNodeLocation, newLocationInfo) {\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}\nexport function addTerminalToCst(node, token, tokenTypeName) {\n    if (node.children[tokenTypeName] === undefined) {\n        node.children[tokenTypeName] = [token];\n    }\n    else {\n        node.children[tokenTypeName].push(token);\n    }\n}\nexport function addNoneTerminalToCst(node, ruleName, ruleResult) {\n    if (node.children[ruleName] === undefined) {\n        node.children[ruleName] = [ruleResult];\n    }\n    else {\n        node.children[ruleName].push(ruleResult);\n    }\n}\n//# sourceMappingURL=cst.js.map","const NAME = \"name\";\nexport function defineNameProp(obj, nameValue) {\n    Object.defineProperty(obj, NAME, {\n        enumerable: false,\n        configurable: true,\n        writable: false,\n        value: nameValue,\n    });\n}\n//# sourceMappingURL=lang_extensions.js.map","import { compact, filter, forEach, isArray, isEmpty, isFunction, isUndefined, keys, map, } from \"lodash-es\";\nimport { defineNameProp } from \"../../lang/lang_extensions.js\";\nexport function defaultVisit(ctx, param) {\n    const childrenNames = 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 = 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}\nexport function createBaseSemanticVisitorConstructor(grammarName, ruleNames) {\n    const derivedConstructor = function () { };\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    const semanticProto = {\n        visit: function (cstNode, param) {\n            // enables writing more concise visitor methods when CstNode has only a single child\n            if (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            // enables passing optional CstNodes concisely.\n            if (isUndefined(cstNode)) {\n                return undefined;\n            }\n            return this[cstNode.name](cstNode.children, param);\n        },\n        validateVisitor: function () {\n            const semanticDefinitionErrors = validateVisitor(this, ruleNames);\n            if (!isEmpty(semanticDefinitionErrors)) {\n                const errorMessages = map(semanticDefinitionErrors, (currDefError) => currDefError.msg);\n                throw Error(`Errors Detected in CST Visitor <${this.constructor.name}>:\\n\\t` +\n                    `${errorMessages.join(\"\\n\\n\").replace(/\\n/g, \"\\n\\t\")}`);\n            }\n        },\n    };\n    derivedConstructor.prototype = semanticProto;\n    derivedConstructor.prototype.constructor = derivedConstructor;\n    derivedConstructor._RULE_NAMES = ruleNames;\n    return derivedConstructor;\n}\nexport function createBaseVisitorConstructorWithDefaults(grammarName, ruleNames, baseConstructor) {\n    const derivedConstructor = function () { };\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    const withDefaultsProto = Object.create(baseConstructor.prototype);\n    forEach(ruleNames, (ruleName) => {\n        withDefaultsProto[ruleName] = defaultVisit;\n    });\n    derivedConstructor.prototype = withDefaultsProto;\n    derivedConstructor.prototype.constructor = derivedConstructor;\n    return derivedConstructor;\n}\nexport var CstVisitorDefinitionError;\n(function (CstVisitorDefinitionError) {\n    CstVisitorDefinitionError[CstVisitorDefinitionError[\"REDUNDANT_METHOD\"] = 0] = \"REDUNDANT_METHOD\";\n    CstVisitorDefinitionError[CstVisitorDefinitionError[\"MISSING_METHOD\"] = 1] = \"MISSING_METHOD\";\n})(CstVisitorDefinitionError || (CstVisitorDefinitionError = {}));\nexport function validateVisitor(visitorInstance, ruleNames) {\n    const missingErrors = validateMissingCstMethods(visitorInstance, ruleNames);\n    return missingErrors;\n}\nexport function validateMissingCstMethods(visitorInstance, ruleNames) {\n    const missingRuleNames = filter(ruleNames, (currRuleName) => {\n        return isFunction(visitorInstance[currRuleName]) === false;\n    });\n    const errors = map(missingRuleNames, (currRuleName) => {\n        return {\n            msg: `Missing visitor method: <${currRuleName}> on ${(visitorInstance.constructor.name)} CST Visitor.`,\n            type: CstVisitorDefinitionError.MISSING_METHOD,\n            methodName: currRuleName,\n        };\n    });\n    return compact(errors);\n}\n//# sourceMappingURL=cst_visitor.js.map","import { addNoneTerminalToCst, addTerminalToCst, setNodeLocationFull, setNodeLocationOnlyOffset, } from \"../../cst/cst.js\";\nimport { has, isUndefined, keys, noop } from \"lodash-es\";\nimport { createBaseSemanticVisitorConstructor, createBaseVisitorConstructorWithDefaults, } from \"../../cst/cst_visitor.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n/**\n * This trait is responsible for the CST building logic.\n */\nexport class TreeBuilder {\n    initTreeBuilder(config) {\n        this.CST_STACK = [];\n        // outputCst is no longer exposed/defined in the pubic API\n        this.outputCst = config.outputCst;\n        this.nodeLocationTracking = has(config, \"nodeLocationTracking\")\n            ? config.nodeLocationTracking // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.nodeLocationTracking;\n        if (!this.outputCst) {\n            this.cstInvocationStateUpdate = noop;\n            this.cstFinallyStateUpdate = noop;\n            this.cstPostTerminal = noop;\n            this.cstPostNonTerminal = noop;\n            this.cstPostRule = noop;\n        }\n        else {\n            if (/full/i.test(this.nodeLocationTracking)) {\n                if (this.recoveryEnabled) {\n                    this.setNodeLocationFromToken = setNodeLocationFull;\n                    this.setNodeLocationFromNode = setNodeLocationFull;\n                    this.cstPostRule = noop;\n                    this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery;\n                }\n                else {\n                    this.setNodeLocationFromToken = noop;\n                    this.setNodeLocationFromNode = noop;\n                    this.cstPostRule = this.cstPostRuleFull;\n                    this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular;\n                }\n            }\n            else if (/onlyOffset/i.test(this.nodeLocationTracking)) {\n                if (this.recoveryEnabled) {\n                    this.setNodeLocationFromToken = setNodeLocationOnlyOffset;\n                    this.setNodeLocationFromNode = setNodeLocationOnlyOffset;\n                    this.cstPostRule = noop;\n                    this.setInitialNodeLocation =\n                        this.setInitialNodeLocationOnlyOffsetRecovery;\n                }\n                else {\n                    this.setNodeLocationFromToken = noop;\n                    this.setNodeLocationFromNode = noop;\n                    this.cstPostRule = this.cstPostRuleOnlyOffset;\n                    this.setInitialNodeLocation =\n                        this.setInitialNodeLocationOnlyOffsetRegular;\n                }\n            }\n            else if (/none/i.test(this.nodeLocationTracking)) {\n                this.setNodeLocationFromToken = noop;\n                this.setNodeLocationFromNode = noop;\n                this.cstPostRule = noop;\n                this.setInitialNodeLocation = noop;\n            }\n            else {\n                throw Error(`Invalid <nodeLocationTracking> config option: \"${config.nodeLocationTracking}\"`);\n            }\n        }\n    }\n    setInitialNodeLocationOnlyOffsetRecovery(cstNode) {\n        cstNode.location = {\n            startOffset: NaN,\n            endOffset: NaN,\n        };\n    }\n    setInitialNodeLocationOnlyOffsetRegular(cstNode) {\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(1).startOffset,\n            endOffset: NaN,\n        };\n    }\n    setInitialNodeLocationFullRecovery(cstNode) {\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       *  @see setInitialNodeLocationOnlyOffsetRegular for explanation why this work\n  \n       * @param cstNode\n       */\n    setInitialNodeLocationFullRegular(cstNode) {\n        const nextToken = this.LA(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    cstInvocationStateUpdate(fullRuleName) {\n        const cstNode = {\n            name: fullRuleName,\n            children: Object.create(null),\n        };\n        this.setInitialNodeLocation(cstNode);\n        this.CST_STACK.push(cstNode);\n    }\n    cstFinallyStateUpdate() {\n        this.CST_STACK.pop();\n    }\n    cstPostRuleFull(ruleCstNode) {\n        // casts to `required<CstNodeLocation>` are safe because `cstPostRuleFull` should only be invoked when full location is enabled\n        const prevToken = this.LA(0);\n        const loc = ruleCstNode.location;\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    cstPostRuleOnlyOffset(ruleCstNode) {\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        // 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    cstPostTerminal(key, consumedToken) {\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, consumedToken);\n    }\n    cstPostNonTerminal(ruleCstResult, ruleName) {\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    getBaseCstVisitorConstructor() {\n        if (isUndefined(this.baseCstVisitorConstructor)) {\n            const newBaseCstVisitorConstructor = createBaseSemanticVisitorConstructor(this.className, keys(this.gastProductionsCache));\n            this.baseCstVisitorConstructor = newBaseCstVisitorConstructor;\n            return newBaseCstVisitorConstructor;\n        }\n        return this.baseCstVisitorConstructor;\n    }\n    getBaseCstVisitorConstructorWithDefaults() {\n        if (isUndefined(this.baseCstVisitorWithDefaultsConstructor)) {\n            const newConstructor = createBaseVisitorConstructorWithDefaults(this.className, keys(this.gastProductionsCache), this.getBaseCstVisitorConstructor());\n            this.baseCstVisitorWithDefaultsConstructor = newConstructor;\n            return newConstructor;\n        }\n        return this.baseCstVisitorWithDefaultsConstructor;\n    }\n    getLastExplicitRuleShortName() {\n        const ruleStack = this.RULE_STACK;\n        return ruleStack[ruleStack.length - 1];\n    }\n    getPreviousExplicitRuleShortName() {\n        const ruleStack = this.RULE_STACK;\n        return ruleStack[ruleStack.length - 2];\n    }\n    getLastExplicitRuleOccurrenceIndex() {\n        const occurrenceStack = this.RULE_OCCURRENCE_STACK;\n        return occurrenceStack[occurrenceStack.length - 1];\n    }\n}\n//# sourceMappingURL=tree_builder.js.map","import { END_OF_FILE } from \"../parser.js\";\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    initLexerAdapter() {\n        this.tokVector = [];\n        this.tokVectorLength = 0;\n        this.currIdx = -1;\n    }\n    set input(newInput) {\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(`Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.`);\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    get input() {\n        return this.tokVector;\n    }\n    // skips a token and returns the next token\n    SKIP_TOKEN() {\n        if (this.currIdx <= this.tokVector.length - 2) {\n            this.consumeToken();\n            return this.LA(1);\n        }\n        else {\n            return END_OF_FILE;\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    LA(howMuch) {\n        const soughtIdx = this.currIdx + howMuch;\n        if (soughtIdx < 0 || this.tokVectorLength <= soughtIdx) {\n            return END_OF_FILE;\n        }\n        else {\n            return this.tokVector[soughtIdx];\n        }\n    }\n    consumeToken() {\n        this.currIdx++;\n    }\n    exportLexerState() {\n        return this.currIdx;\n    }\n    importLexerState(newState) {\n        this.currIdx = newState;\n    }\n    resetLexerState() {\n        this.currIdx = -1;\n    }\n    moveToTerminatedState() {\n        this.currIdx = this.tokVector.length - 1;\n    }\n    getLexerPosition() {\n        return this.exportLexerState();\n    }\n}\n//# sourceMappingURL=lexer_adapter.js.map","import { includes, values } from \"lodash-es\";\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 { serializeGrammar } from \"@chevrotain/gast\";\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(impl) {\n        return impl.call(this);\n    }\n    consume(idx, tokType, options) {\n        return this.consumeInternal(tokType, idx, options);\n    }\n    subrule(idx, ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, idx, options);\n    }\n    option(idx, actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, idx);\n    }\n    or(idx, altsOrOpts) {\n        return this.orInternal(altsOrOpts, idx);\n    }\n    many(idx, actionORMethodDef) {\n        return this.manyInternal(idx, actionORMethodDef);\n    }\n    atLeastOne(idx, actionORMethodDef) {\n        return this.atLeastOneInternal(idx, actionORMethodDef);\n    }\n    CONSUME(tokType, options) {\n        return this.consumeInternal(tokType, 0, options);\n    }\n    CONSUME1(tokType, options) {\n        return this.consumeInternal(tokType, 1, options);\n    }\n    CONSUME2(tokType, options) {\n        return this.consumeInternal(tokType, 2, options);\n    }\n    CONSUME3(tokType, options) {\n        return this.consumeInternal(tokType, 3, options);\n    }\n    CONSUME4(tokType, options) {\n        return this.consumeInternal(tokType, 4, options);\n    }\n    CONSUME5(tokType, options) {\n        return this.consumeInternal(tokType, 5, options);\n    }\n    CONSUME6(tokType, options) {\n        return this.consumeInternal(tokType, 6, options);\n    }\n    CONSUME7(tokType, options) {\n        return this.consumeInternal(tokType, 7, options);\n    }\n    CONSUME8(tokType, options) {\n        return this.consumeInternal(tokType, 8, options);\n    }\n    CONSUME9(tokType, options) {\n        return this.consumeInternal(tokType, 9, options);\n    }\n    SUBRULE(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 0, options);\n    }\n    SUBRULE1(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 1, options);\n    }\n    SUBRULE2(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 2, options);\n    }\n    SUBRULE3(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 3, options);\n    }\n    SUBRULE4(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 4, options);\n    }\n    SUBRULE5(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 5, options);\n    }\n    SUBRULE6(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 6, options);\n    }\n    SUBRULE7(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 7, options);\n    }\n    SUBRULE8(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 8, options);\n    }\n    SUBRULE9(ruleToCall, options) {\n        return this.subruleInternal(ruleToCall, 9, options);\n    }\n    OPTION(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 0);\n    }\n    OPTION1(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 1);\n    }\n    OPTION2(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 2);\n    }\n    OPTION3(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 3);\n    }\n    OPTION4(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 4);\n    }\n    OPTION5(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 5);\n    }\n    OPTION6(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 6);\n    }\n    OPTION7(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 7);\n    }\n    OPTION8(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 8);\n    }\n    OPTION9(actionORMethodDef) {\n        return this.optionInternal(actionORMethodDef, 9);\n    }\n    OR(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 0);\n    }\n    OR1(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 1);\n    }\n    OR2(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 2);\n    }\n    OR3(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 3);\n    }\n    OR4(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 4);\n    }\n    OR5(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 5);\n    }\n    OR6(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 6);\n    }\n    OR7(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 7);\n    }\n    OR8(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 8);\n    }\n    OR9(altsOrOpts) {\n        return this.orInternal(altsOrOpts, 9);\n    }\n    MANY(actionORMethodDef) {\n        this.manyInternal(0, actionORMethodDef);\n    }\n    MANY1(actionORMethodDef) {\n        this.manyInternal(1, actionORMethodDef);\n    }\n    MANY2(actionORMethodDef) {\n        this.manyInternal(2, actionORMethodDef);\n    }\n    MANY3(actionORMethodDef) {\n        this.manyInternal(3, actionORMethodDef);\n    }\n    MANY4(actionORMethodDef) {\n        this.manyInternal(4, actionORMethodDef);\n    }\n    MANY5(actionORMethodDef) {\n        this.manyInternal(5, actionORMethodDef);\n    }\n    MANY6(actionORMethodDef) {\n        this.manyInternal(6, actionORMethodDef);\n    }\n    MANY7(actionORMethodDef) {\n        this.manyInternal(7, actionORMethodDef);\n    }\n    MANY8(actionORMethodDef) {\n        this.manyInternal(8, actionORMethodDef);\n    }\n    MANY9(actionORMethodDef) {\n        this.manyInternal(9, actionORMethodDef);\n    }\n    MANY_SEP(options) {\n        this.manySepFirstInternal(0, options);\n    }\n    MANY_SEP1(options) {\n        this.manySepFirstInternal(1, options);\n    }\n    MANY_SEP2(options) {\n        this.manySepFirstInternal(2, options);\n    }\n    MANY_SEP3(options) {\n        this.manySepFirstInternal(3, options);\n    }\n    MANY_SEP4(options) {\n        this.manySepFirstInternal(4, options);\n    }\n    MANY_SEP5(options) {\n        this.manySepFirstInternal(5, options);\n    }\n    MANY_SEP6(options) {\n        this.manySepFirstInternal(6, options);\n    }\n    MANY_SEP7(options) {\n        this.manySepFirstInternal(7, options);\n    }\n    MANY_SEP8(options) {\n        this.manySepFirstInternal(8, options);\n    }\n    MANY_SEP9(options) {\n        this.manySepFirstInternal(9, options);\n    }\n    AT_LEAST_ONE(actionORMethodDef) {\n        this.atLeastOneInternal(0, actionORMethodDef);\n    }\n    AT_LEAST_ONE1(actionORMethodDef) {\n        return this.atLeastOneInternal(1, actionORMethodDef);\n    }\n    AT_LEAST_ONE2(actionORMethodDef) {\n        this.atLeastOneInternal(2, actionORMethodDef);\n    }\n    AT_LEAST_ONE3(actionORMethodDef) {\n        this.atLeastOneInternal(3, actionORMethodDef);\n    }\n    AT_LEAST_ONE4(actionORMethodDef) {\n        this.atLeastOneInternal(4, actionORMethodDef);\n    }\n    AT_LEAST_ONE5(actionORMethodDef) {\n        this.atLeastOneInternal(5, actionORMethodDef);\n    }\n    AT_LEAST_ONE6(actionORMethodDef) {\n        this.atLeastOneInternal(6, actionORMethodDef);\n    }\n    AT_LEAST_ONE7(actionORMethodDef) {\n        this.atLeastOneInternal(7, actionORMethodDef);\n    }\n    AT_LEAST_ONE8(actionORMethodDef) {\n        this.atLeastOneInternal(8, actionORMethodDef);\n    }\n    AT_LEAST_ONE9(actionORMethodDef) {\n        this.atLeastOneInternal(9, actionORMethodDef);\n    }\n    AT_LEAST_ONE_SEP(options) {\n        this.atLeastOneSepFirstInternal(0, options);\n    }\n    AT_LEAST_ONE_SEP1(options) {\n        this.atLeastOneSepFirstInternal(1, options);\n    }\n    AT_LEAST_ONE_SEP2(options) {\n        this.atLeastOneSepFirstInternal(2, options);\n    }\n    AT_LEAST_ONE_SEP3(options) {\n        this.atLeastOneSepFirstInternal(3, options);\n    }\n    AT_LEAST_ONE_SEP4(options) {\n        this.atLeastOneSepFirstInternal(4, options);\n    }\n    AT_LEAST_ONE_SEP5(options) {\n        this.atLeastOneSepFirstInternal(5, options);\n    }\n    AT_LEAST_ONE_SEP6(options) {\n        this.atLeastOneSepFirstInternal(6, options);\n    }\n    AT_LEAST_ONE_SEP7(options) {\n        this.atLeastOneSepFirstInternal(7, options);\n    }\n    AT_LEAST_ONE_SEP8(options) {\n        this.atLeastOneSepFirstInternal(8, options);\n    }\n    AT_LEAST_ONE_SEP9(options) {\n        this.atLeastOneSepFirstInternal(9, options);\n    }\n    RULE(name, implementation, config = DEFAULT_RULE_CONFIG) {\n        if (includes(this.definedRulesNames, name)) {\n            const errMsg = defaultGrammarValidatorErrorProvider.buildDuplicateRuleNameError({\n                topLevelRule: name,\n                grammarName: this.className,\n            });\n            const error = {\n                message: errMsg,\n                type: ParserDefinitionErrorType.DUPLICATE_RULE_NAME,\n                ruleName: name,\n            };\n            this.definitionErrors.push(error);\n        }\n        this.definedRulesNames.push(name);\n        const ruleImplementation = this.defineRule(name, implementation, config);\n        this[name] = ruleImplementation;\n        return ruleImplementation;\n    }\n    OVERRIDE_RULE(name, impl, config = DEFAULT_RULE_CONFIG) {\n        const ruleErrors = validateRuleIsOverridden(name, this.definedRulesNames, this.className);\n        this.definitionErrors = this.definitionErrors.concat(ruleErrors);\n        const ruleImplementation = this.defineRule(name, impl, config);\n        this[name] = ruleImplementation;\n        return ruleImplementation;\n    }\n    BACKTRACK(grammarRule, args) {\n        return function () {\n            // save org state\n            this.isBackTrackingStack.push(1);\n            const orgState = this.saveRecogState();\n            try {\n                grammarRule.apply(this, args);\n                // if no exception was thrown we have succeed parsing the rule.\n                return true;\n            }\n            catch (e) {\n                if (isRecognitionException(e)) {\n                    return false;\n                }\n                else {\n                    throw e;\n                }\n            }\n            finally {\n                this.reloadRecogState(orgState);\n                this.isBackTrackingStack.pop();\n            }\n        };\n    }\n    // GAST export APIs\n    getGAstProductions() {\n        return this.gastProductionsCache;\n    }\n    getSerializedGastProductions() {\n        return serializeGrammar(values(this.gastProductionsCache));\n    }\n}\n//# sourceMappingURL=recognizer_api.js.map","import { clone, every, flatten, has, isArray, isEmpty, isObject, reduce, uniq, values, } from \"lodash-es\";\nimport { AT_LEAST_ONE_IDX, AT_LEAST_ONE_SEP_IDX, BITS_FOR_METHOD_TYPE, BITS_FOR_OCCURRENCE_IDX, MANY_IDX, MANY_SEP_IDX, OPTION_IDX, OR_IDX, } from \"../../grammar/keys.js\";\nimport { isRecognitionException, MismatchedTokenException, NotAllInputParsedException, } from \"../../exceptions_public.js\";\nimport { PROD_TYPE } from \"../../grammar/lookahead.js\";\nimport { NextTerminalAfterAtLeastOneSepWalker, NextTerminalAfterAtLeastOneWalker, NextTerminalAfterManySepWalker, NextTerminalAfterManyWalker, } from \"../../grammar/interpreter.js\";\nimport { DEFAULT_RULE_CONFIG } from \"../parser.js\";\nimport { IN_RULE_RECOVERY_EXCEPTION } from \"./recoverable.js\";\nimport { EOF } from \"../../../scan/tokens_public.js\";\nimport { augmentTokenTypes, isTokenType, tokenStructuredMatcher, tokenStructuredMatcherNoCategories, } from \"../../../scan/tokens.js\";\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    initRecognizerEngine(tokenVocabulary, config) {\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.definedRulesNames = [];\n        this.tokensMap = {};\n        this.isBackTrackingStack = [];\n        this.RULE_STACK = [];\n        this.RULE_OCCURRENCE_STACK = [];\n        this.gastProductionsCache = {};\n        if (has(config, \"serializedGrammar\")) {\n            throw Error(\"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        if (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 (isEmpty(tokenVocabulary)) {\n                throw Error(\"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            if (typeof tokenVocabulary[0].startOffset === \"number\") {\n                throw Error(\"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        if (isArray(tokenVocabulary)) {\n            this.tokensMap = reduce(tokenVocabulary, (acc, tokType) => {\n                acc[tokType.name] = tokType;\n                return acc;\n            }, {});\n        }\n        else if (has(tokenVocabulary, \"modes\") &&\n            every(flatten(values(tokenVocabulary.modes)), isTokenType)) {\n            const allTokenTypes = flatten(values(tokenVocabulary.modes));\n            const uniqueTokens = uniq(allTokenTypes);\n            this.tokensMap = reduce(uniqueTokens, (acc, tokType) => {\n                acc[tokType.name] = tokType;\n                return acc;\n            }, {});\n        }\n        else if (isObject(tokenVocabulary)) {\n            this.tokensMap = clone(tokenVocabulary);\n        }\n        else {\n            throw new Error(\"<tokensDictionary> argument must be An Array of Token constructors,\" +\n                \" A dictionary of Token constructors or an IMultiModeLexerDefinition\");\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        const allTokenTypes = has(tokenVocabulary, \"modes\")\n            ? flatten(values(tokenVocabulary.modes))\n            : values(tokenVocabulary);\n        const noTokenCategoriesUsed = every(allTokenTypes, (tokenConstructor) => isEmpty(tokenConstructor.categoryMatches));\n        this.tokenMatcher = noTokenCategoriesUsed\n            ? tokenStructuredMatcherNoCategories\n            : tokenStructuredMatcher;\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(values(this.tokensMap));\n    }\n    defineRule(ruleName, impl, config) {\n        if (this.selfAnalysisDone) {\n            throw Error(`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        const resyncEnabled = has(config, \"resyncEnabled\")\n            ? config.resyncEnabled // assumes end user provides the correct config value/type\n            : DEFAULT_RULE_CONFIG.resyncEnabled;\n        const recoveryValueFunc = has(config, \"recoveryValueFunc\")\n            ? config.recoveryValueFunc // assumes end user provides the correct config value/type\n            : DEFAULT_RULE_CONFIG.recoveryValueFunc;\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 = this.ruleShortNameIdx << (BITS_FOR_METHOD_TYPE + BITS_FOR_OCCURRENCE_IDX);\n        this.ruleShortNameIdx++;\n        this.shortRuleNameToFull[shortName] = ruleName;\n        this.fullRuleNameToShort[ruleName] = shortName;\n        let invokeRuleWithTry;\n        // Micro optimization, only check the condition **once** on rule definition\n        // instead of **every single** rule invocation.\n        if (this.outputCst === true) {\n            invokeRuleWithTry = function invokeRuleWithTry(...args) {\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;\n                }\n                catch (e) {\n                    return this.invokeRuleCatch(e, resyncEnabled, recoveryValueFunc);\n                }\n                finally {\n                    this.ruleFinallyStateUpdate();\n                }\n            };\n        }\n        else {\n            invokeRuleWithTry = function invokeRuleWithTryCst(...args) {\n                try {\n                    this.ruleInvocationStateUpdate(shortName, ruleName, this.subruleIdx);\n                    return impl.apply(this, args);\n                }\n                catch (e) {\n                    return this.invokeRuleCatch(e, resyncEnabled, recoveryValueFunc);\n                }\n                finally {\n                    this.ruleFinallyStateUpdate();\n                }\n            };\n        }\n        const wrappedGrammarRule = Object.assign(invokeRuleWithTry, { ruleName, originalGrammarAction: impl });\n        return wrappedGrammarRule;\n    }\n    invokeRuleCatch(e, resyncEnabledConfig, recoveryValueFunc) {\n        const isFirstInvokedRule = this.RULE_STACK.length === 1;\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 = resyncEnabledConfig && !this.isBackTracking() && this.recoveryEnabled;\n        if (isRecognitionException(e)) {\n            const recogError = 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 = this.CST_STACK[this.CST_STACK.length - 1];\n                        partialCstResult.recoveredNode = true;\n                        return partialCstResult;\n                    }\n                    else {\n                        return recoveryValueFunc(e);\n                    }\n                }\n                else {\n                    if (this.outputCst) {\n                        const partialCstResult = 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            }\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            }\n            else {\n                // to be recovered Further up the call stack\n                throw recogError;\n            }\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    // Implementation of parsing DSL\n    optionInternal(actionORMethodDef, occurrence) {\n        const key = this.getKeyForAutomaticLookahead(OPTION_IDX, occurrence);\n        return this.optionInternalLogic(actionORMethodDef, occurrence, key);\n    }\n    optionInternalLogic(actionORMethodDef, occurrence, key) {\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        }\n        else {\n            action = actionORMethodDef;\n        }\n        if (lookAheadFunc.call(this) === true) {\n            return action.call(this);\n        }\n        return undefined;\n    }\n    atLeastOneInternal(prodOccurrence, actionORMethodDef) {\n        const laKey = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_IDX, prodOccurrence);\n        return this.atLeastOneInternalLogic(prodOccurrence, actionORMethodDef, laKey);\n    }\n    atLeastOneInternalLogic(prodOccurrence, actionORMethodDef, key) {\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        }\n        else {\n            action = actionORMethodDef;\n        }\n        if (lookAheadFunc.call(this) === true) {\n            let notStuck = this.doSingleRepetition(action);\n            while (lookAheadFunc.call(this) === true &&\n                notStuck === true) {\n                notStuck = this.doSingleRepetition(action);\n            }\n        }\n        else {\n            throw this.raiseEarlyExitException(prodOccurrence, PROD_TYPE.REPETITION_MANDATORY, actionORMethodDef.ERR_MSG);\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        // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n        this.attemptInRepetitionRecovery(this.atLeastOneInternal, [prodOccurrence, actionORMethodDef], lookAheadFunc, AT_LEAST_ONE_IDX, prodOccurrence, NextTerminalAfterAtLeastOneWalker);\n    }\n    atLeastOneSepFirstInternal(prodOccurrence, options) {\n        const laKey = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_SEP_IDX, prodOccurrence);\n        this.atLeastOneSepFirstInternalLogic(prodOccurrence, options, laKey);\n    }\n    atLeastOneSepFirstInternalLogic(prodOccurrence, options, key) {\n        const action = options.DEF;\n        const separator = options.SEP;\n        const firstIterationLookaheadFunc = this.getLaFuncFromCache(key);\n        // 1st iteration\n        if (firstIterationLookaheadFunc.call(this) === true) {\n            action.call(this);\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(1), separator);\n            };\n            // 2nd..nth iterations\n            while (this.tokenMatcher(this.LA(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            // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n            this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [\n                prodOccurrence,\n                separator,\n                separatorLookAheadFunc,\n                action,\n                NextTerminalAfterAtLeastOneSepWalker,\n            ], separatorLookAheadFunc, AT_LEAST_ONE_SEP_IDX, prodOccurrence, NextTerminalAfterAtLeastOneSepWalker);\n        }\n        else {\n            throw this.raiseEarlyExitException(prodOccurrence, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, options.ERR_MSG);\n        }\n    }\n    manyInternal(prodOccurrence, actionORMethodDef) {\n        const laKey = this.getKeyForAutomaticLookahead(MANY_IDX, prodOccurrence);\n        return this.manyInternalLogic(prodOccurrence, actionORMethodDef, laKey);\n    }\n    manyInternalLogic(prodOccurrence, actionORMethodDef, key) {\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        }\n        else {\n            action = actionORMethodDef;\n        }\n        let notStuck = true;\n        while (lookaheadFunction.call(this) === true && notStuck === true) {\n            notStuck = this.doSingleRepetition(action);\n        }\n        // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n        this.attemptInRepetitionRecovery(this.manyInternal, [prodOccurrence, actionORMethodDef], lookaheadFunction, MANY_IDX, prodOccurrence, 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    manySepFirstInternal(prodOccurrence, options) {\n        const laKey = this.getKeyForAutomaticLookahead(MANY_SEP_IDX, prodOccurrence);\n        this.manySepFirstInternalLogic(prodOccurrence, options, laKey);\n    }\n    manySepFirstInternalLogic(prodOccurrence, options, key) {\n        const action = options.DEF;\n        const separator = options.SEP;\n        const firstIterationLaFunc = this.getLaFuncFromCache(key);\n        // 1st iteration\n        if (firstIterationLaFunc.call(this) === true) {\n            action.call(this);\n            const separatorLookAheadFunc = () => {\n                return this.tokenMatcher(this.LA(1), separator);\n            };\n            // 2nd..nth iterations\n            while (this.tokenMatcher(this.LA(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            // Performance optimization: \"attemptInRepetitionRecovery\" will be defined as NOOP unless recovery is enabled\n            this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [\n                prodOccurrence,\n                separator,\n                separatorLookAheadFunc,\n                action,\n                NextTerminalAfterManySepWalker,\n            ], separatorLookAheadFunc, MANY_SEP_IDX, prodOccurrence, NextTerminalAfterManySepWalker);\n        }\n    }\n    repetitionSepSecondInternal(prodOccurrence, separator, separatorLookAheadFunc, action, nextTerminalAfterWalker) {\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        // 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(this.repetitionSepSecondInternal, [\n            prodOccurrence,\n            separator,\n            separatorLookAheadFunc,\n            action,\n            nextTerminalAfterWalker,\n        ], separatorLookAheadFunc, AT_LEAST_ONE_SEP_IDX, prodOccurrence, nextTerminalAfterWalker);\n    }\n    doSingleRepetition(action) {\n        const beforeIteration = this.getLexerPosition();\n        action.call(this);\n        const afterIteration = this.getLexerPosition();\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    orInternal(altsOrOpts, occurrence) {\n        const laKey = this.getKeyForAutomaticLookahead(OR_IDX, occurrence);\n        const alts = isArray(altsOrOpts) ? altsOrOpts : altsOrOpts.DEF;\n        const laFunc = this.getLaFuncFromCache(laKey);\n        const altIdxToTake = laFunc.call(this, alts);\n        if (altIdxToTake !== undefined) {\n            const chosenAlternative = alts[altIdxToTake];\n            return chosenAlternative.ALT.call(this);\n        }\n        this.raiseNoAltException(occurrence, altsOrOpts.ERR_MSG);\n    }\n    ruleFinallyStateUpdate() {\n        this.RULE_STACK.pop();\n        this.RULE_OCCURRENCE_STACK.pop();\n        // NOOP when cst is disabled\n        this.cstFinallyStateUpdate();\n        if (this.RULE_STACK.length === 0 && 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(new NotAllInputParsedException(errMsg, firstRedundantTok));\n        }\n    }\n    subruleInternal(ruleToCall, idx, options) {\n        let ruleResult;\n        try {\n            const args = options !== undefined ? options.ARGS : undefined;\n            this.subruleIdx = idx;\n            ruleResult = ruleToCall.apply(this, args);\n            this.cstPostNonTerminal(ruleResult, options !== undefined && options.LABEL !== undefined\n                ? options.LABEL\n                : ruleToCall.ruleName);\n            return ruleResult;\n        }\n        catch (e) {\n            throw this.subruleInternalError(e, options, ruleToCall.ruleName);\n        }\n    }\n    subruleInternalError(e, options, ruleName) {\n        if (isRecognitionException(e) && e.partialCstResult !== undefined) {\n            this.cstPostNonTerminal(e.partialCstResult, options !== undefined && options.LABEL !== undefined\n                ? options.LABEL\n                : ruleName);\n            delete e.partialCstResult;\n        }\n        throw e;\n    }\n    consumeInternal(tokType, idx, options) {\n        let consumedToken;\n        try {\n            const nextToken = this.LA(1);\n            if (this.tokenMatcher(nextToken, tokType) === true) {\n                this.consumeToken();\n                consumedToken = nextToken;\n            }\n            else {\n                this.consumeInternalError(tokType, nextToken, options);\n            }\n        }\n        catch (eFromConsumption) {\n            consumedToken = this.consumeInternalRecovery(tokType, idx, eFromConsumption);\n        }\n        this.cstPostTerminal(options !== undefined && options.LABEL !== undefined\n            ? options.LABEL\n            : tokType.name, consumedToken);\n        return consumedToken;\n    }\n    consumeInternalError(tokType, nextToken, options) {\n        let msg;\n        const previousToken = this.LA(0);\n        if (options !== undefined && options.ERR_MSG) {\n            msg = options.ERR_MSG;\n        }\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(new MismatchedTokenException(msg, nextToken, previousToken));\n    }\n    consumeInternalRecovery(tokType, idx, eFromConsumption) {\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 (this.recoveryEnabled &&\n            // TODO: more robust checking of the exception type. Perhaps Typescript extending expressions?\n            eFromConsumption.name === \"MismatchedTokenException\" &&\n            !this.isBackTracking()) {\n            const follows = this.getFollowsForInRuleRecovery(tokType, idx);\n            try {\n                return this.tryInRuleRecovery(tokType, follows);\n            }\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                }\n                else {\n                    throw eFromInRuleRecovery;\n                }\n            }\n        }\n        else {\n            throw eFromConsumption;\n        }\n    }\n    saveRecogState() {\n        // errors is a getter which will clone the errors array\n        const savedErrors = this.errors;\n        const savedRuleStack = clone(this.RULE_STACK);\n        return {\n            errors: savedErrors,\n            lexerState: this.exportLexerState(),\n            RULE_STACK: savedRuleStack,\n            CST_STACK: this.CST_STACK,\n        };\n    }\n    reloadRecogState(newState) {\n        this.errors = newState.errors;\n        this.importLexerState(newState.lexerState);\n        this.RULE_STACK = newState.RULE_STACK;\n    }\n    ruleInvocationStateUpdate(shortName, fullName, idxInCallingRule) {\n        this.RULE_OCCURRENCE_STACK.push(idxInCallingRule);\n        this.RULE_STACK.push(shortName);\n        // NOOP when cst is disabled\n        this.cstInvocationStateUpdate(fullName);\n    }\n    isBackTracking() {\n        return this.isBackTrackingStack.length !== 0;\n    }\n    getCurrRuleFullName() {\n        const shortName = this.getLastExplicitRuleShortName();\n        return this.shortRuleNameToFull[shortName];\n    }\n    shortRuleNameToFullName(shortName) {\n        return this.shortRuleNameToFull[shortName];\n    }\n    isAtEndOfInput() {\n        return this.tokenMatcher(this.LA(1), EOF);\n    }\n    reset() {\n        this.resetLexerState();\n        this.subruleIdx = 0;\n        this.isBackTrackingStack = [];\n        this.errors = [];\n        this.RULE_STACK = [];\n        // TODO: extract a specific reset for TreeBuilder trait\n        this.CST_STACK = [];\n        this.RULE_OCCURRENCE_STACK = [];\n    }\n}\n//# sourceMappingURL=recognizer_engine.js.map","import { EarlyExitException, isRecognitionException, NoViableAltException, } from \"../../exceptions_public.js\";\nimport { clone, has } from \"lodash-es\";\nimport { getLookaheadPathsForOptionalProd, getLookaheadPathsForOr, } from \"../../grammar/lookahead.js\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n/**\n * Trait responsible for runtime parsing errors.\n */\nexport class ErrorHandler {\n    initErrorHandler(config) {\n        this._errors = [];\n        this.errorMessageProvider = has(config, \"errorMessageProvider\")\n            ? config.errorMessageProvider // assumes end user provides the correct config value/type\n            : DEFAULT_PARSER_CONFIG.errorMessageProvider;\n    }\n    SAVE_ERROR(error) {\n        if (isRecognitionException(error)) {\n            error.context = {\n                ruleStack: this.getHumanReadableRuleStack(),\n                ruleOccurrenceStack: clone(this.RULE_OCCURRENCE_STACK),\n            };\n            this._errors.push(error);\n            return error;\n        }\n        else {\n            throw Error(\"Trying to save an Error which is not a RecognitionException\");\n        }\n    }\n    get errors() {\n        return clone(this._errors);\n    }\n    set errors(newErrors) {\n        this._errors = newErrors;\n    }\n    // TODO: consider caching the error message computed information\n    raiseEarlyExitException(occurrence, prodType, userDefinedErrMsg) {\n        const ruleName = this.getCurrRuleFullName();\n        const ruleGrammar = this.getGAstProductions()[ruleName];\n        const lookAheadPathsPerAlternative = getLookaheadPathsForOptionalProd(occurrence, ruleGrammar, prodType, this.maxLookahead);\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        throw this.SAVE_ERROR(new EarlyExitException(msg, this.LA(1), this.LA(0)));\n    }\n    // TODO: consider caching the error message computed information\n    raiseNoAltException(occurrence, errMsgTypes) {\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(occurrence, ruleGrammar, this.maxLookahead);\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        const errMsg = this.errorMessageProvider.buildNoViableAltMessage({\n            expectedPathsPerAlt: lookAheadPathsPerAlternative,\n            actual: actualTokens,\n            previous: previousToken,\n            customUserDescription: errMsgTypes,\n            ruleName: this.getCurrRuleFullName(),\n        });\n        throw this.SAVE_ERROR(new NoViableAltException(errMsg, this.LA(1), previousToken));\n    }\n}\n//# sourceMappingURL=error_handler.js.map","import { NextAfterTokenWalker, nextPossibleTokensAfter, } from \"../../grammar/interpreter.js\";\nimport { first, isUndefined } from \"lodash-es\";\nexport class ContentAssist {\n    initContentAssist() { }\n    computeContentAssist(startRuleName, precedingInput) {\n        const startRuleGast = this.gastProductionsCache[startRuleName];\n        if (isUndefined(startRuleGast)) {\n            throw Error(`Rule ->${startRuleName}<- does not exist in this grammar.`);\n        }\n        return nextPossibleTokensAfter([startRuleGast], precedingInput, this.tokenMatcher, this.maxLookahead);\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(grammarPath) {\n        const topRuleName = first(grammarPath.ruleStack);\n        const gastProductions = this.getGAstProductions();\n        const topProduction = gastProductions[topRuleName];\n        const nextPossibleTokenTypes = new NextAfterTokenWalker(topProduction, grammarPath).startWalking();\n        return nextPossibleTokenTypes;\n    }\n}\n//# sourceMappingURL=context_assist.js.map","import { forEach, has, isArray, isFunction, last as peek, some, } from \"lodash-es\";\nimport { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Rule, Terminal, } from \"@chevrotain/gast\";\nimport { Lexer } from \"../../../scan/lexer_public.js\";\nimport { augmentTokenTypes, hasShortKeyProperty, } from \"../../../scan/tokens.js\";\nimport { createToken, createTokenInstance, } from \"../../../scan/tokens_public.js\";\nimport { END_OF_FILE } from \"../parser.js\";\nimport { BITS_FOR_OCCURRENCE_IDX } from \"../../grammar/keys.js\";\nconst RECORDING_NULL_OBJECT = {\n    description: \"This Object indicates the Parser is during Recording Phase\",\n};\nObject.freeze(RECORDING_NULL_OBJECT);\nconst HANDLE_SEPARATOR = true;\nconst MAX_METHOD_IDX = Math.pow(2, BITS_FOR_OCCURRENCE_IDX) - 1;\nconst RFT = createToken({ name: \"RECORDING_PHASE_TOKEN\", pattern: Lexer.NA });\naugmentTokenTypes([RFT]);\nconst RECORDING_PHASE_TOKEN = createTokenInstance(RFT, \"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, -1, -1, -1, -1, -1);\nObject.freeze(RECORDING_PHASE_TOKEN);\nconst RECORDING_PHASE_CSTNODE = {\n    name: \"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 * This trait handles the creation of the GAST structure for Chevrotain Grammars\n */\nexport class GastRecorder {\n    initGastRecorder(config) {\n        this.recordingProdStack = [];\n        this.RECORDING_PHASE = false;\n    }\n    enableRecording() {\n        this.RECORDING_PHASE = true;\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}`] = function (arg1, arg2) {\n                    return this.consumeInternalRecord(arg1, i, arg2);\n                };\n                this[`SUBRULE${idx}`] = function (arg1, arg2) {\n                    return this.subruleInternalRecord(arg1, i, arg2);\n                };\n                this[`OPTION${idx}`] = function (arg1) {\n                    return this.optionInternalRecord(arg1, i);\n                };\n                this[`OR${idx}`] = function (arg1) {\n                    return this.orInternalRecord(arg1, i);\n                };\n                this[`MANY${idx}`] = function (arg1) {\n                    this.manyInternalRecord(i, arg1);\n                };\n                this[`MANY_SEP${idx}`] = function (arg1) {\n                    this.manySepFirstInternalRecord(i, arg1);\n                };\n                this[`AT_LEAST_ONE${idx}`] = function (arg1) {\n                    this.atLeastOneInternalRecord(i, arg1);\n                };\n                this[`AT_LEAST_ONE_SEP${idx}`] = function (arg1) {\n                    this.atLeastOneSepFirstInternalRecord(i, arg1);\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);\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            this.ACTION = this.ACTION_RECORD;\n            this.BACKTRACK = this.BACKTRACK_RECORD;\n            this.LA = this.LA_RECORD;\n        });\n    }\n    disableRecording() {\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 = this;\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            delete that[`consume`];\n            delete that[`subrule`];\n            delete that[`option`];\n            delete that[`or`];\n            delete that[`many`];\n            delete that[`atLeastOne`];\n            delete that.ACTION;\n            delete that.BACKTRACK;\n            delete that.LA;\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(impl) {\n        // NO-OP during recording\n    }\n    // Executing backtracking logic will break our recording logic assumptions\n    BACKTRACK_RECORD(grammarRule, args) {\n        return () => true;\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) {\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    topLevelRuleRecord(name, def) {\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        }\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                }\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    // Implementation of parsing DSL\n    optionInternalRecord(actionORMethodDef, occurrence) {\n        return recordProd.call(this, Option, actionORMethodDef, occurrence);\n    }\n    atLeastOneInternalRecord(occurrence, actionORMethodDef) {\n        recordProd.call(this, RepetitionMandatory, actionORMethodDef, occurrence);\n    }\n    atLeastOneSepFirstInternalRecord(occurrence, options) {\n        recordProd.call(this, RepetitionMandatoryWithSeparator, options, occurrence, HANDLE_SEPARATOR);\n    }\n    manyInternalRecord(occurrence, actionORMethodDef) {\n        recordProd.call(this, Repetition, actionORMethodDef, occurrence);\n    }\n    manySepFirstInternalRecord(occurrence, options) {\n        recordProd.call(this, RepetitionWithSeparator, options, occurrence, HANDLE_SEPARATOR);\n    }\n    orInternalRecord(altsOrOpts, occurrence) {\n        return recordOrProd.call(this, altsOrOpts, occurrence);\n    }\n    subruleInternalRecord(ruleToCall, occurrence, options) {\n        assertMethodIdxIsValid(occurrence);\n        if (!ruleToCall || has(ruleToCall, \"ruleName\") === false) {\n            const error = new Error(`<SUBRULE${getIdxSuffix(occurrence)}> argument is invalid` +\n                ` expecting a Parser method reference but got: <${JSON.stringify(ruleToCall)}>` +\n                `\\n inside top level rule: <${this.recordingProdStack[0].name}>`);\n            error.KNOWN_RECORDER_ERROR = true;\n            throw error;\n        }\n        const prevProd = peek(this.recordingProdStack);\n        const ruleName = ruleToCall.ruleName;\n        const newNoneTerminal = new NonTerminal({\n            idx: occurrence,\n            nonTerminalName: ruleName,\n            label: options === null || options === void 0 ? void 0 : 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        return this.outputCst\n            ? RECORDING_PHASE_CSTNODE\n            : RECORDING_NULL_OBJECT;\n    }\n    consumeInternalRecord(tokType, occurrence, options) {\n        assertMethodIdxIsValid(occurrence);\n        if (!hasShortKeyProperty(tokType)) {\n            const error = new Error(`<CONSUME${getIdxSuffix(occurrence)}> argument is invalid` +\n                ` expecting a TokenType reference but got: <${JSON.stringify(tokType)}>` +\n                `\\n inside top level rule: <${this.recordingProdStack[0].name}>`);\n            error.KNOWN_RECORDER_ERROR = true;\n            throw error;\n        }\n        const prevProd = peek(this.recordingProdStack);\n        const newNoneTerminal = new Terminal({\n            idx: occurrence,\n            terminalType: tokType,\n            label: options === null || options === void 0 ? void 0 : options.LABEL,\n        });\n        prevProd.definition.push(newNoneTerminal);\n        return RECORDING_PHASE_TOKEN;\n    }\n}\nfunction recordProd(prodConstructor, mainProdArg, occurrence, handleSep = false) {\n    assertMethodIdxIsValid(occurrence);\n    const prevProd = peek(this.recordingProdStack);\n    const grammarAction = isFunction(mainProdArg) ? mainProdArg : mainProdArg.DEF;\n    const newProd = new prodConstructor({ definition: [], idx: occurrence });\n    if (handleSep) {\n        newProd.separator = mainProdArg.SEP;\n    }\n    if (has(mainProdArg, \"MAX_LOOKAHEAD\")) {\n        newProd.maxLookahead = mainProdArg.MAX_LOOKAHEAD;\n    }\n    this.recordingProdStack.push(newProd);\n    grammarAction.call(this);\n    prevProd.definition.push(newProd);\n    this.recordingProdStack.pop();\n    return RECORDING_NULL_OBJECT;\n}\nfunction recordOrProd(mainProdArg, occurrence) {\n    assertMethodIdxIsValid(occurrence);\n    const prevProd = peek(this.recordingProdStack);\n    // Only an array of alternatives\n    const hasOptions = isArray(mainProdArg) === false;\n    const alts = hasOptions === false ? mainProdArg : mainProdArg.DEF;\n    const newOrProd = new Alternation({\n        definition: [],\n        idx: occurrence,\n        ignoreAmbiguities: hasOptions && mainProdArg.IGNORE_AMBIGUITIES === true,\n    });\n    if (has(mainProdArg, \"MAX_LOOKAHEAD\")) {\n        newOrProd.maxLookahead = mainProdArg.MAX_LOOKAHEAD;\n    }\n    const hasPredicates = some(alts, (currAlt) => isFunction(currAlt.GATE));\n    newOrProd.hasPredicates = hasPredicates;\n    prevProd.definition.push(newOrProd);\n    forEach(alts, (currAlt) => {\n        const currAltFlat = new Alternative({ definition: [] });\n        newOrProd.definition.push(currAltFlat);\n        if (has(currAlt, \"IGNORE_AMBIGUITIES\")) {\n            currAltFlat.ignoreAmbiguities = currAlt.IGNORE_AMBIGUITIES; // assumes end user provides the correct config value/type\n        }\n        // **implicit** ignoreAmbiguities due to usage of gate\n        else if (has(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}\nfunction getIdxSuffix(idx) {\n    return idx === 0 ? \"\" : `${idx}`;\n}\nfunction assertMethodIdxIsValid(idx) {\n    if (idx < 0 || idx > MAX_METHOD_IDX) {\n        const error = 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 ${MAX_METHOD_IDX + 1}`);\n        error.KNOWN_RECORDER_ERROR = true;\n        throw error;\n    }\n}\n//# sourceMappingURL=gast_recorder.js.map","import { has } from \"lodash-es\";\nimport { timer } from \"@chevrotain/utils\";\nimport { DEFAULT_PARSER_CONFIG } from \"../parser.js\";\n/**\n * Trait responsible for runtime parsing errors.\n */\nexport class PerformanceTracer {\n    initPerformanceTracer(config) {\n        if (has(config, \"traceInitPerf\")) {\n            const userTraceInitPerf = config.traceInitPerf;\n            const traceIsNumber = typeof userTraceInitPerf === \"number\";\n            this.traceInitMaxIdent = traceIsNumber\n                ? userTraceInitPerf\n                : Infinity;\n            this.traceInitPerf = traceIsNumber\n                ? userTraceInitPerf > 0\n                : userTraceInitPerf; // assumes end user provides the correct config value/type\n        }\n        else {\n            this.traceInitMaxIdent = 0;\n            this.traceInitPerf = DEFAULT_PARSER_CONFIG.traceInitPerf;\n        }\n        this.traceInitIndent = -1;\n    }\n    TRACE_INIT(phaseDesc, phaseImpl) {\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        }\n        else {\n            return phaseImpl();\n        }\n    }\n}\n//# sourceMappingURL=perf_tracer.js.map","export function applyMixins(derivedCtor, baseCtors) {\n    baseCtors.forEach((baseCtor) => {\n        const baseProto = baseCtor.prototype;\n        Object.getOwnPropertyNames(baseProto).forEach((propName) => {\n            if (propName === \"constructor\") {\n                return;\n            }\n            const basePropDescriptor = Object.getOwnPropertyDescriptor(baseProto, propName);\n            // Handle Accessors\n            if (basePropDescriptor &&\n                (basePropDescriptor.get || basePropDescriptor.set)) {\n                Object.defineProperty(derivedCtor.prototype, propName, basePropDescriptor);\n            }\n            else {\n                derivedCtor.prototype[propName] = baseCtor.prototype[propName];\n            }\n        });\n    });\n}\n//# sourceMappingURL=apply_mixins.js.map","import { clone, forEach, has, isEmpty, map, values } from \"lodash-es\";\nimport { toFastProperties } from \"@chevrotain/utils\";\nimport { computeAllProdsFollows } from \"../grammar/follow.js\";\nimport { createTokenInstance, EOF } from \"../../scan/tokens_public.js\";\nimport { defaultGrammarValidatorErrorProvider, defaultParserErrorProvider, } from \"../errors_public.js\";\nimport { resolveGrammar, validateGrammar, } from \"../grammar/gast/gast_resolver_public.js\";\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\";\nimport { ErrorHandler } from \"./traits/error_handler.js\";\nimport { ContentAssist } from \"./traits/context_assist.js\";\nimport { GastRecorder } from \"./traits/gast_recorder.js\";\nimport { PerformanceTracer } from \"./traits/perf_tracer.js\";\nimport { applyMixins } from \"./utils/apply_mixins.js\";\nimport { validateLookahead } from \"../grammar/checks.js\";\nexport const END_OF_FILE = createTokenInstance(EOF, \"\", NaN, NaN, NaN, NaN, NaN, NaN);\nObject.freeze(END_OF_FILE);\nexport const DEFAULT_PARSER_CONFIG = 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});\nexport const DEFAULT_RULE_CONFIG = Object.freeze({\n    recoveryValueFunc: () => undefined,\n    resyncEnabled: true,\n});\nexport var ParserDefinitionErrorType;\n(function (ParserDefinitionErrorType) {\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"INVALID_RULE_NAME\"] = 0] = \"INVALID_RULE_NAME\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"DUPLICATE_RULE_NAME\"] = 1] = \"DUPLICATE_RULE_NAME\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"INVALID_RULE_OVERRIDE\"] = 2] = \"INVALID_RULE_OVERRIDE\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"DUPLICATE_PRODUCTIONS\"] = 3] = \"DUPLICATE_PRODUCTIONS\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"UNRESOLVED_SUBRULE_REF\"] = 4] = \"UNRESOLVED_SUBRULE_REF\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"LEFT_RECURSION\"] = 5] = \"LEFT_RECURSION\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"NONE_LAST_EMPTY_ALT\"] = 6] = \"NONE_LAST_EMPTY_ALT\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"AMBIGUOUS_ALTS\"] = 7] = \"AMBIGUOUS_ALTS\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"CONFLICT_TOKENS_RULES_NAMESPACE\"] = 8] = \"CONFLICT_TOKENS_RULES_NAMESPACE\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"INVALID_TOKEN_NAME\"] = 9] = \"INVALID_TOKEN_NAME\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"NO_NON_EMPTY_LOOKAHEAD\"] = 10] = \"NO_NON_EMPTY_LOOKAHEAD\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"AMBIGUOUS_PREFIX_ALTS\"] = 11] = \"AMBIGUOUS_PREFIX_ALTS\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"TOO_MANY_ALTS\"] = 12] = \"TOO_MANY_ALTS\";\n    ParserDefinitionErrorType[ParserDefinitionErrorType[\"CUSTOM_LOOKAHEAD_VALIDATION\"] = 13] = \"CUSTOM_LOOKAHEAD_VALIDATION\";\n})(ParserDefinitionErrorType || (ParserDefinitionErrorType = {}));\nexport function EMPTY_ALT(value = undefined) {\n    return function () {\n        return value;\n    };\n}\nexport class Parser {\n    /**\n     *  @deprecated use the **instance** method with the same name instead\n     */\n    static performSelfAnalysis(parserInstance) {\n        throw Error(\"The **static** `performSelfAnalysis` method has been deprecated.\" +\n            \"\\t\\nUse the **instance** method with the same name instead.\");\n    }\n    performSelfAnalysis() {\n        this.TRACE_INIT(\"performSelfAnalysis\", () => {\n            let defErrorsMsgs;\n            this.selfAnalysisDone = true;\n            const className = this.className;\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            this.TRACE_INIT(\"Grammar Recording\", () => {\n                try {\n                    this.enableRecording();\n                    // Building the GAST\n                    forEach(this.definedRulesNames, (currRuleName) => {\n                        const wrappedRule = this[currRuleName];\n                        const originalGrammarAction = wrappedRule[\"originalGrammarAction\"];\n                        let recordedRuleGast;\n                        this.TRACE_INIT(`${currRuleName} Rule`, () => {\n                            recordedRuleGast = this.topLevelRuleRecord(currRuleName, originalGrammarAction);\n                        });\n                        this.gastProductionsCache[currRuleName] = recordedRuleGast;\n                    });\n                }\n                finally {\n                    this.disableRecording();\n                }\n            });\n            let resolverErrors = [];\n            this.TRACE_INIT(\"Grammar Resolving\", () => {\n                resolverErrors = resolveGrammar({\n                    rules: values(this.gastProductionsCache),\n                });\n                this.definitionErrors = this.definitionErrors.concat(resolverErrors);\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 (isEmpty(resolverErrors) && this.skipValidations === false) {\n                    const validationErrors = validateGrammar({\n                        rules: values(this.gastProductionsCache),\n                        tokenTypes: values(this.tokensMap),\n                        errMsgProvider: defaultGrammarValidatorErrorProvider,\n                        grammarName: className,\n                    });\n                    const lookaheadValidationErrors = validateLookahead({\n                        lookaheadStrategy: this.lookaheadStrategy,\n                        rules: values(this.gastProductionsCache),\n                        tokenTypes: values(this.tokensMap),\n                        grammarName: className,\n                    });\n                    this.definitionErrors = this.definitionErrors.concat(validationErrors, lookaheadValidationErrors);\n                }\n            });\n            // this analysis may fail if the grammar is not perfectly valid\n            if (isEmpty(this.definitionErrors)) {\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(values(this.gastProductionsCache));\n                        this.resyncFollows = allFollows;\n                    });\n                }\n                this.TRACE_INIT(\"ComputeLookaheadFunctions\", () => {\n                    var _a, _b;\n                    (_b = (_a = this.lookaheadStrategy).initialize) === null || _b === void 0 ? void 0 : _b.call(_a, {\n                        rules: values(this.gastProductionsCache),\n                    });\n                    this.preComputeLookaheadFunctions(values(this.gastProductionsCache));\n                });\n            }\n            if (!Parser.DEFER_DEFINITION_ERRORS_HANDLING &&\n                !isEmpty(this.definitionErrors)) {\n                defErrorsMsgs = map(this.definitionErrors, (defError) => defError.message);\n                throw new Error(`Parser Definition Errors detected:\\n ${defErrorsMsgs.join(\"\\n-------------------------------\\n\")}`);\n            }\n        });\n    }\n    constructor(tokenVocabulary, config) {\n        this.definitionErrors = [];\n        this.selfAnalysisDone = false;\n        const that = this;\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.initContentAssist();\n        that.initGastRecorder(config);\n        that.initPerformanceTracer(config);\n        if (has(config, \"ignoredIssues\")) {\n            throw new Error(\"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        this.skipValidations = has(config, \"skipValidations\")\n            ? config.skipValidations // casting assumes the end user passing the correct type\n            : DEFAULT_PARSER_CONFIG.skipValidations;\n    }\n}\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).\nParser.DEFER_DEFINITION_ERRORS_HANDLING = false;\napplyMixins(Parser, [\n    Recoverable,\n    LooksAhead,\n    TreeBuilder,\n    LexerAdapter,\n    RecognizerEngine,\n    RecognizerApi,\n    ErrorHandler,\n    ContentAssist,\n    GastRecorder,\n    PerformanceTracer,\n]);\nexport class CstParser extends Parser {\n    constructor(tokenVocabulary, config = DEFAULT_PARSER_CONFIG) {\n        const configClone = clone(config);\n        configClone.outputCst = true;\n        super(tokenVocabulary, configClone);\n    }\n}\nexport class EmbeddedActionsParser extends Parser {\n    constructor(tokenVocabulary, config = DEFAULT_PARSER_CONFIG) {\n        const configClone = clone(config);\n        configClone.outputCst = false;\n        super(tokenVocabulary, configClone);\n    }\n}\n//# sourceMappingURL=parser.js.map","/******************************************************************************\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 ******************************************************************************/\nimport map from \"lodash-es/map.js\";\nimport filter from \"lodash-es/filter.js\";\nimport { Alternation, NonTerminal, Option, RepetitionMandatory, Repetition, Terminal, RepetitionWithSeparator, RepetitionMandatoryWithSeparator } from \"chevrotain\";\nexport function buildATNKey(rule, type, occurrence) {\n    return `${rule.name}_${type}_${occurrence}`;\n}\nexport const ATN_INVALID_TYPE = 0;\nexport const ATN_BASIC = 1;\nexport const ATN_RULE_START = 2;\nexport const ATN_PLUS_BLOCK_START = 4;\nexport const ATN_STAR_BLOCK_START = 5;\n// Currently unused as the ATN is not used for lexing\nexport const ATN_TOKEN_START = 6;\nexport const ATN_RULE_STOP = 7;\nexport const ATN_BLOCK_END = 8;\nexport const ATN_STAR_LOOP_BACK = 9;\nexport const ATN_STAR_LOOP_ENTRY = 10;\nexport const ATN_PLUS_LOOP_BACK = 11;\nexport const ATN_LOOP_END = 12;\nexport class AbstractTransition {\n    constructor(target) {\n        this.target = target;\n    }\n    isEpsilon() {\n        return false;\n    }\n}\nexport class AtomTransition extends AbstractTransition {\n    constructor(target, tokenType) {\n        super(target);\n        this.tokenType = tokenType;\n    }\n}\nexport class EpsilonTransition extends AbstractTransition {\n    constructor(target) {\n        super(target);\n    }\n    isEpsilon() {\n        return true;\n    }\n}\nexport class RuleTransition extends AbstractTransition {\n    constructor(ruleStart, rule, followState) {\n        super(ruleStart);\n        this.rule = rule;\n        this.followState = followState;\n    }\n    isEpsilon() {\n        return true;\n    }\n}\nexport function createATN(rules) {\n    const atn = {\n        decisionMap: {},\n        decisionStates: [],\n        ruleToStartState: new Map(),\n        ruleToStopState: new Map(),\n        states: []\n    };\n    createRuleStartAndStopATNStates(atn, rules);\n    const ruleLength = rules.length;\n    for (let i = 0; i < ruleLength; i++) {\n        const rule = rules[i];\n        const ruleBlock = block(atn, rule, rule);\n        if (ruleBlock === undefined) {\n            continue;\n        }\n        buildRuleHandle(atn, rule, ruleBlock);\n    }\n    return atn;\n}\nfunction createRuleStartAndStopATNStates(atn, rules) {\n    const ruleLength = rules.length;\n    for (let i = 0; i < ruleLength; i++) {\n        const rule = rules[i];\n        const start = newState(atn, rule, undefined, {\n            type: ATN_RULE_START\n        });\n        const stop = newState(atn, rule, undefined, {\n            type: ATN_RULE_STOP\n        });\n        start.stop = stop;\n        atn.ruleToStartState.set(rule, start);\n        atn.ruleToStopState.set(rule, stop);\n    }\n}\nfunction atom(atn, rule, production) {\n    if (production instanceof Terminal) {\n        return tokenRef(atn, rule, production.terminalType, production);\n    }\n    else if (production instanceof NonTerminal) {\n        return ruleRef(atn, rule, production);\n    }\n    else if (production instanceof Alternation) {\n        return alternation(atn, rule, production);\n    }\n    else if (production instanceof Option) {\n        return option(atn, rule, production);\n    }\n    else if (production instanceof Repetition) {\n        return repetition(atn, rule, production);\n    }\n    else if (production instanceof RepetitionWithSeparator) {\n        return repetitionSep(atn, rule, production);\n    }\n    else if (production instanceof RepetitionMandatory) {\n        return repetitionMandatory(atn, rule, production);\n    }\n    else if (production instanceof RepetitionMandatoryWithSeparator) {\n        return repetitionMandatorySep(atn, rule, production);\n    }\n    else {\n        return block(atn, rule, production);\n    }\n}\nfunction repetition(atn, rule, repetition) {\n    const starState = newState(atn, rule, repetition, {\n        type: ATN_STAR_BLOCK_START\n    });\n    defineDecisionState(atn, starState);\n    const handle = makeAlts(atn, rule, starState, repetition, block(atn, rule, repetition));\n    return star(atn, rule, repetition, handle);\n}\nfunction repetitionSep(atn, rule, repetition) {\n    const starState = newState(atn, rule, repetition, {\n        type: ATN_STAR_BLOCK_START\n    });\n    defineDecisionState(atn, starState);\n    const handle = makeAlts(atn, rule, starState, repetition, block(atn, rule, repetition));\n    const sep = tokenRef(atn, rule, repetition.separator, repetition);\n    return star(atn, rule, repetition, handle, sep);\n}\nfunction repetitionMandatory(atn, rule, repetition) {\n    const plusState = newState(atn, rule, repetition, {\n        type: ATN_PLUS_BLOCK_START\n    });\n    defineDecisionState(atn, plusState);\n    const handle = makeAlts(atn, rule, plusState, repetition, block(atn, rule, repetition));\n    return plus(atn, rule, repetition, handle);\n}\nfunction repetitionMandatorySep(atn, rule, repetition) {\n    const plusState = newState(atn, rule, repetition, {\n        type: ATN_PLUS_BLOCK_START\n    });\n    defineDecisionState(atn, plusState);\n    const handle = makeAlts(atn, rule, plusState, repetition, block(atn, rule, repetition));\n    const sep = tokenRef(atn, rule, repetition.separator, repetition);\n    return plus(atn, rule, repetition, handle, sep);\n}\nfunction alternation(atn, rule, alternation) {\n    const start = newState(atn, rule, alternation, {\n        type: ATN_BASIC\n    });\n    defineDecisionState(atn, start);\n    const alts = map(alternation.definition, (e) => atom(atn, rule, e));\n    const handle = makeAlts(atn, rule, start, alternation, ...alts);\n    return handle;\n}\nfunction option(atn, rule, option) {\n    const start = newState(atn, rule, option, {\n        type: ATN_BASIC\n    });\n    defineDecisionState(atn, start);\n    const handle = makeAlts(atn, rule, start, option, block(atn, rule, option));\n    return optional(atn, rule, option, handle);\n}\nfunction block(atn, rule, block) {\n    const handles = filter(map(block.definition, (e) => atom(atn, rule, e)), (e) => e !== undefined);\n    if (handles.length === 1) {\n        return handles[0];\n    }\n    else if (handles.length === 0) {\n        return undefined;\n    }\n    else {\n        return makeBlock(atn, handles);\n    }\n}\nfunction plus(atn, rule, plus, handle, sep) {\n    const blkStart = handle.left;\n    const blkEnd = handle.right;\n    const loop = newState(atn, rule, plus, {\n        type: ATN_PLUS_LOOP_BACK\n    });\n    defineDecisionState(atn, loop);\n    const end = newState(atn, rule, plus, {\n        type: ATN_LOOP_END\n    });\n    blkStart.loopback = loop;\n    end.loopback = loop;\n    atn.decisionMap[buildATNKey(rule, sep ? 'RepetitionMandatoryWithSeparator' : 'RepetitionMandatory', plus.idx)] = loop;\n    epsilon(blkEnd, loop); // block can see loop back\n    // Depending on whether we have a separator we put the exit transition at index 1 or 0\n    // This influences the chosen option in the lookahead DFA\n    if (sep === undefined) {\n        epsilon(loop, blkStart); // loop back to start\n        epsilon(loop, end); // exit\n    }\n    else {\n        epsilon(loop, end); // exit\n        // loop back to start with separator\n        epsilon(loop, sep.left);\n        epsilon(sep.right, blkStart);\n    }\n    return {\n        left: blkStart,\n        right: end\n    };\n}\nfunction star(atn, rule, star, handle, sep) {\n    const start = handle.left;\n    const end = handle.right;\n    const entry = newState(atn, rule, star, {\n        type: ATN_STAR_LOOP_ENTRY\n    });\n    defineDecisionState(atn, entry);\n    const loopEnd = newState(atn, rule, star, {\n        type: ATN_LOOP_END\n    });\n    const loop = newState(atn, rule, star, {\n        type: ATN_STAR_LOOP_BACK\n    });\n    entry.loopback = loop;\n    loopEnd.loopback = loop;\n    epsilon(entry, start); // loop enter edge (alt 2)\n    epsilon(entry, loopEnd); // bypass loop edge (alt 1)\n    epsilon(end, loop); // block end hits loop back\n    if (sep !== undefined) {\n        epsilon(loop, loopEnd); // end loop\n        // loop back to start of handle using separator\n        epsilon(loop, sep.left);\n        epsilon(sep.right, start);\n    }\n    else {\n        epsilon(loop, entry); // loop back to entry/exit decision\n    }\n    atn.decisionMap[buildATNKey(rule, sep ? 'RepetitionWithSeparator' : 'Repetition', star.idx)] = entry;\n    return {\n        left: entry,\n        right: loopEnd\n    };\n}\nfunction optional(atn, rule, optional, handle) {\n    const start = handle.left;\n    const end = handle.right;\n    epsilon(start, end);\n    atn.decisionMap[buildATNKey(rule, 'Option', optional.idx)] = start;\n    return handle;\n}\nfunction defineDecisionState(atn, state) {\n    atn.decisionStates.push(state);\n    state.decision = atn.decisionStates.length - 1;\n    return state.decision;\n}\nfunction makeAlts(atn, rule, start, production, ...alts) {\n    const end = newState(atn, rule, production, {\n        type: ATN_BLOCK_END,\n        start\n    });\n    start.end = end;\n    for (const alt of alts) {\n        if (alt !== undefined) {\n            // hook alts up to decision block\n            epsilon(start, alt.left);\n            epsilon(alt.right, end);\n        }\n        else {\n            epsilon(start, end);\n        }\n    }\n    const handle = {\n        left: start,\n        right: end\n    };\n    atn.decisionMap[buildATNKey(rule, getProdType(production), production.idx)] = start;\n    return handle;\n}\nfunction getProdType(production) {\n    if (production instanceof Alternation) {\n        return 'Alternation';\n    }\n    else if (production instanceof Option) {\n        return 'Option';\n    }\n    else if (production instanceof Repetition) {\n        return 'Repetition';\n    }\n    else if (production instanceof RepetitionWithSeparator) {\n        return 'RepetitionWithSeparator';\n    }\n    else if (production instanceof RepetitionMandatory) {\n        return 'RepetitionMandatory';\n    }\n    else if (production instanceof RepetitionMandatoryWithSeparator) {\n        return 'RepetitionMandatoryWithSeparator';\n    }\n    else {\n        throw new Error('Invalid production type encountered');\n    }\n}\nfunction makeBlock(atn, alts) {\n    const altsLength = alts.length;\n    for (let i = 0; i < altsLength - 1; i++) {\n        const handle = alts[i];\n        let transition;\n        if (handle.left.transitions.length === 1) {\n            transition = handle.left.transitions[0];\n        }\n        const isRuleTransition = transition instanceof RuleTransition;\n        const ruleTransition = transition;\n        const next = alts[i + 1].left;\n        if (handle.left.type === ATN_BASIC &&\n            handle.right.type === ATN_BASIC &&\n            transition !== undefined &&\n            ((isRuleTransition && ruleTransition.followState === handle.right) ||\n                transition.target === handle.right)) {\n            // we can avoid epsilon edge to next element\n            if (isRuleTransition) {\n                ruleTransition.followState = next;\n            }\n            else {\n                transition.target = next;\n            }\n            removeState(atn, handle.right); // we skipped over this state\n        }\n        else {\n            // need epsilon if previous block's right end node is complex\n            epsilon(handle.right, next);\n        }\n    }\n    const first = alts[0];\n    const last = alts[altsLength - 1];\n    return {\n        left: first.left,\n        right: last.right\n    };\n}\nfunction tokenRef(atn, rule, tokenType, production) {\n    const left = newState(atn, rule, production, {\n        type: ATN_BASIC\n    });\n    const right = newState(atn, rule, production, {\n        type: ATN_BASIC\n    });\n    addTransition(left, new AtomTransition(right, tokenType));\n    return {\n        left,\n        right\n    };\n}\nfunction ruleRef(atn, currentRule, nonTerminal) {\n    const rule = nonTerminal.referencedRule;\n    const start = atn.ruleToStartState.get(rule);\n    const left = newState(atn, currentRule, nonTerminal, {\n        type: ATN_BASIC\n    });\n    const right = newState(atn, currentRule, nonTerminal, {\n        type: ATN_BASIC\n    });\n    const call = new RuleTransition(start, rule, right);\n    addTransition(left, call);\n    return {\n        left,\n        right\n    };\n}\nfunction buildRuleHandle(atn, rule, block) {\n    const start = atn.ruleToStartState.get(rule);\n    epsilon(start, block.left);\n    const stop = atn.ruleToStopState.get(rule);\n    epsilon(block.right, stop);\n    const handle = {\n        left: start,\n        right: stop\n    };\n    return handle;\n}\nfunction epsilon(a, b) {\n    const transition = new EpsilonTransition(b);\n    addTransition(a, transition);\n}\nfunction newState(atn, rule, production, partial) {\n    const t = Object.assign({ atn,\n        production, epsilonOnlyTransitions: false, rule, transitions: [], nextTokenWithinRule: [], stateNumber: atn.states.length }, partial);\n    atn.states.push(t);\n    return t;\n}\nfunction addTransition(state, transition) {\n    // A single ATN state can only contain epsilon transitions or non-epsilon transitions\n    // Because they are never mixed, only setting the property for the first transition is fine\n    if (state.transitions.length === 0) {\n        state.epsilonOnlyTransitions = transition.isEpsilon();\n    }\n    state.transitions.push(transition);\n}\nfunction removeState(atn, state) {\n    atn.states.splice(atn.states.indexOf(state), 1);\n}\n//# sourceMappingURL=atn.js.map","/******************************************************************************\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 ******************************************************************************/\nimport map from \"lodash-es/map.js\";\nexport const DFA_ERROR = {};\nexport class ATNConfigSet {\n    constructor() {\n        this.map = {};\n        this.configs = [];\n    }\n    get size() {\n        return this.configs.length;\n    }\n    finalize() {\n        // Empties the map to free up memory\n        this.map = {};\n    }\n    add(config) {\n        const key = getATNConfigKey(config);\n        // Only add configs which don't exist in our map already\n        // While this does not influence the actual algorithm, adding them anyway would massively increase memory consumption\n        if (!(key in this.map)) {\n            this.map[key] = this.configs.length;\n            this.configs.push(config);\n        }\n    }\n    get elements() {\n        return this.configs;\n    }\n    get alts() {\n        return map(this.configs, (e) => e.alt);\n    }\n    get key() {\n        let value = \"\";\n        for (const k in this.map) {\n            value += k + \":\";\n        }\n        return value;\n    }\n}\nexport function getATNConfigKey(config, alt = true) {\n    return `${alt ? `a${config.alt}` : \"\"}s${config.state.stateNumber}:${config.stack.map((e) => e.stateNumber.toString()).join(\"_\")}`;\n}\n//# sourceMappingURL=dfa.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { tokenMatcher, tokenLabel, NonTerminal, Alternation, Option, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Repetition, Terminal, LLkLookaheadStrategy, getLookaheadPaths } from \"chevrotain\";\nimport { ATN_RULE_STOP, AtomTransition, buildATNKey, createATN, EpsilonTransition, RuleTransition } from \"./atn.js\";\nimport { ATNConfigSet, DFA_ERROR, getATNConfigKey } from \"./dfa.js\";\nimport min from \"lodash-es/min.js\";\nimport flatMap from \"lodash-es/flatMap.js\";\nimport uniqBy from \"lodash-es/uniqBy.js\";\nimport map from \"lodash-es/map.js\";\nimport flatten from \"lodash-es/flatten.js\";\nimport forEach from \"lodash-es/forEach.js\";\nimport isEmpty from \"lodash-es/isEmpty.js\";\nimport reduce from \"lodash-es/reduce.js\";\nfunction createDFACache(startState, decision) {\n    const map = {};\n    return (predicateSet) => {\n        const key = predicateSet.toString();\n        let existing = map[key];\n        if (existing !== undefined) {\n            return existing;\n        }\n        else {\n            existing = {\n                atnStartState: startState,\n                decision,\n                states: {}\n            };\n            map[key] = existing;\n            return existing;\n        }\n    };\n}\nclass PredicateSet {\n    constructor() {\n        this.predicates = [];\n    }\n    is(index) {\n        return index >= this.predicates.length || this.predicates[index];\n    }\n    set(index, value) {\n        this.predicates[index] = value;\n    }\n    toString() {\n        let value = \"\";\n        const size = this.predicates.length;\n        for (let i = 0; i < size; i++) {\n            value += this.predicates[i] === true ? \"1\" : \"0\";\n        }\n        return value;\n    }\n}\nconst EMPTY_PREDICATES = new PredicateSet();\nexport class LLStarLookaheadStrategy extends LLkLookaheadStrategy {\n    constructor(options) {\n        var _a;\n        super();\n        this.logging = (_a = options === null || options === void 0 ? void 0 : options.logging) !== null && _a !== void 0 ? _a : ((message) => console.log(message));\n    }\n    initialize(options) {\n        this.atn = createATN(options.rules);\n        this.dfas = initATNSimulator(this.atn);\n    }\n    validateAmbiguousAlternationAlternatives() {\n        return [];\n    }\n    validateEmptyOrAlternatives() {\n        return [];\n    }\n    buildLookaheadForAlternation(options) {\n        const { prodOccurrence, rule, hasPredicates, dynamicTokensEnabled } = options;\n        const dfas = this.dfas;\n        const logging = this.logging;\n        const key = buildATNKey(rule, 'Alternation', prodOccurrence);\n        const decisionState = this.atn.decisionMap[key];\n        const decisionIndex = decisionState.decision;\n        const partialAlts = map(getLookaheadPaths({\n            maxLookahead: 1,\n            occurrence: prodOccurrence,\n            prodType: \"Alternation\",\n            rule: rule\n        }), (currAlt) => map(currAlt, (path) => path[0]));\n        if (isLL1Sequence(partialAlts, false) && !dynamicTokensEnabled) {\n            const choiceToAlt = reduce(partialAlts, (result, currAlt, idx) => {\n                forEach(currAlt, (currTokType) => {\n                    if (currTokType) {\n                        result[currTokType.tokenTypeIdx] = idx;\n                        forEach(currTokType.categoryMatches, (currExtendingType) => {\n                            result[currExtendingType] = idx;\n                        });\n                    }\n                });\n                return result;\n            }, {});\n            if (hasPredicates) {\n                return function (orAlts) {\n                    var _a;\n                    const nextToken = this.LA(1);\n                    const prediction = choiceToAlt[nextToken.tokenTypeIdx];\n                    if (orAlts !== undefined && prediction !== undefined) {\n                        const gate = (_a = orAlts[prediction]) === null || _a === void 0 ? void 0 : _a.GATE;\n                        if (gate !== undefined && gate.call(this) === false) {\n                            return undefined;\n                        }\n                    }\n                    return prediction;\n                };\n            }\n            else {\n                return function () {\n                    const nextToken = this.LA(1);\n                    return choiceToAlt[nextToken.tokenTypeIdx];\n                };\n            }\n        }\n        else if (hasPredicates) {\n            return function (orAlts) {\n                const predicates = new PredicateSet();\n                const length = orAlts === undefined ? 0 : orAlts.length;\n                for (let i = 0; i < length; i++) {\n                    const gate = orAlts === null || orAlts === void 0 ? void 0 : orAlts[i].GATE;\n                    predicates.set(i, gate === undefined || gate.call(this));\n                }\n                const result = adaptivePredict.call(this, dfas, decisionIndex, predicates, logging);\n                return typeof result === 'number' ? result : undefined;\n            };\n        }\n        else {\n            return function () {\n                const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging);\n                return typeof result === 'number' ? result : undefined;\n            };\n        }\n    }\n    buildLookaheadForOptional(options) {\n        const { prodOccurrence, rule, prodType, dynamicTokensEnabled } = options;\n        const dfas = this.dfas;\n        const logging = this.logging;\n        const key = buildATNKey(rule, prodType, prodOccurrence);\n        const decisionState = this.atn.decisionMap[key];\n        const decisionIndex = decisionState.decision;\n        const alts = map(getLookaheadPaths({\n            maxLookahead: 1,\n            occurrence: prodOccurrence,\n            prodType,\n            rule\n        }), (e) => {\n            return map(e, (g) => g[0]);\n        });\n        if (isLL1Sequence(alts) && alts[0][0] && !dynamicTokensEnabled) {\n            const alt = alts[0];\n            const singleTokensTypes = flatten(alt);\n            if (singleTokensTypes.length === 1 &&\n                isEmpty(singleTokensTypes[0].categoryMatches)) {\n                const expectedTokenType = singleTokensTypes[0];\n                const expectedTokenUniqueKey = expectedTokenType.tokenTypeIdx;\n                return function () {\n                    return this.LA(1).tokenTypeIdx === expectedTokenUniqueKey;\n                };\n            }\n            else {\n                const choiceToAlt = reduce(singleTokensTypes, (result, currTokType) => {\n                    if (currTokType !== undefined) {\n                        result[currTokType.tokenTypeIdx] = true;\n                        forEach(currTokType.categoryMatches, (currExtendingType) => {\n                            result[currExtendingType] = true;\n                        });\n                    }\n                    return result;\n                }, {});\n                return function () {\n                    const nextToken = this.LA(1);\n                    return choiceToAlt[nextToken.tokenTypeIdx] === true;\n                };\n            }\n        }\n        return function () {\n            const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging);\n            return typeof result === \"object\" ? false : result === 0;\n        };\n    }\n}\nfunction isLL1Sequence(sequences, allowEmpty = true) {\n    const fullSet = new Set();\n    for (const alt of sequences) {\n        const altSet = new Set();\n        for (const tokType of alt) {\n            if (tokType === undefined) {\n                if (allowEmpty) {\n                    // Epsilon production encountered\n                    break;\n                }\n                else {\n                    return false;\n                }\n            }\n            const indices = [tokType.tokenTypeIdx].concat(tokType.categoryMatches);\n            for (const index of indices) {\n                if (fullSet.has(index)) {\n                    if (!altSet.has(index)) {\n                        return false;\n                    }\n                }\n                else {\n                    fullSet.add(index);\n                    altSet.add(index);\n                }\n            }\n        }\n    }\n    return true;\n}\nfunction initATNSimulator(atn) {\n    const decisionLength = atn.decisionStates.length;\n    const decisionToDFA = Array(decisionLength);\n    for (let i = 0; i < decisionLength; i++) {\n        decisionToDFA[i] = createDFACache(atn.decisionStates[i], i);\n    }\n    return decisionToDFA;\n}\nfunction adaptivePredict(dfaCaches, decision, predicateSet, logging) {\n    const dfa = dfaCaches[decision](predicateSet);\n    let start = dfa.start;\n    if (start === undefined) {\n        const closure = computeStartState(dfa.atnStartState);\n        start = addDFAState(dfa, newDFAState(closure));\n        dfa.start = start;\n    }\n    const alt = performLookahead.apply(this, [dfa, start, predicateSet, logging]);\n    return alt;\n}\nfunction performLookahead(dfa, s0, predicateSet, logging) {\n    let previousD = s0;\n    let i = 1;\n    const path = [];\n    let t = this.LA(i++);\n    while (true) {\n        let d = getExistingTargetState(previousD, t);\n        if (d === undefined) {\n            d = computeLookaheadTarget.apply(this, [dfa, previousD, t, i, predicateSet, logging]);\n        }\n        if (d === DFA_ERROR) {\n            return buildAdaptivePredictError(path, previousD, t);\n        }\n        if (d.isAcceptState === true) {\n            return d.prediction;\n        }\n        previousD = d;\n        path.push(t);\n        t = this.LA(i++);\n    }\n}\nfunction computeLookaheadTarget(dfa, previousD, token, lookahead, predicateSet, logging) {\n    const reach = computeReachSet(previousD.configs, token, predicateSet);\n    if (reach.size === 0) {\n        addDFAEdge(dfa, previousD, token, DFA_ERROR);\n        return DFA_ERROR;\n    }\n    let newState = newDFAState(reach);\n    const predictedAlt = getUniqueAlt(reach, predicateSet);\n    if (predictedAlt !== undefined) {\n        newState.isAcceptState = true;\n        newState.prediction = predictedAlt;\n        newState.configs.uniqueAlt = predictedAlt;\n    }\n    else if (hasConflictTerminatingPrediction(reach)) {\n        const prediction = min(reach.alts);\n        newState.isAcceptState = true;\n        newState.prediction = prediction;\n        newState.configs.uniqueAlt = prediction;\n        reportLookaheadAmbiguity.apply(this, [dfa, lookahead, reach.alts, logging]);\n    }\n    newState = addDFAEdge(dfa, previousD, token, newState);\n    return newState;\n}\nfunction reportLookaheadAmbiguity(dfa, lookahead, ambiguityIndices, logging) {\n    const prefixPath = [];\n    for (let i = 1; i <= lookahead; i++) {\n        prefixPath.push(this.LA(i).tokenType);\n    }\n    const atnState = dfa.atnStartState;\n    const topLevelRule = atnState.rule;\n    const production = atnState.production;\n    const message = buildAmbiguityError({\n        topLevelRule,\n        ambiguityIndices,\n        production,\n        prefixPath\n    });\n    logging(message);\n}\nfunction buildAmbiguityError(options) {\n    const pathMsg = map(options.prefixPath, (currtok) => tokenLabel(currtok)).join(\", \");\n    const occurrence = options.production.idx === 0 ? \"\" : options.production.idx;\n    let currMessage = `Ambiguous Alternatives Detected: <${options.ambiguityIndices.join(\", \")}> in <${getProductionDslName(options.production)}${occurrence}>` +\n        ` inside <${options.topLevelRule.name}> Rule,\\n` +\n        `<${pathMsg}> may appears as a prefix path in all these alternatives.\\n`;\n    currMessage =\n        currMessage +\n            `See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\\n` +\n            `For Further details.`;\n    return currMessage;\n}\nfunction getProductionDslName(prod) {\n    if (prod instanceof NonTerminal) {\n        return \"SUBRULE\";\n    }\n    else if (prod instanceof Option) {\n        return \"OPTION\";\n    }\n    else if (prod instanceof Alternation) {\n        return \"OR\";\n    }\n    else if (prod instanceof RepetitionMandatory) {\n        return \"AT_LEAST_ONE\";\n    }\n    else if (prod instanceof RepetitionMandatoryWithSeparator) {\n        return \"AT_LEAST_ONE_SEP\";\n    }\n    else if (prod instanceof RepetitionWithSeparator) {\n        return \"MANY_SEP\";\n    }\n    else if (prod instanceof Repetition) {\n        return \"MANY\";\n    }\n    else if (prod instanceof Terminal) {\n        return \"CONSUME\";\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nfunction buildAdaptivePredictError(path, previous, current) {\n    const nextTransitions = flatMap(previous.configs.elements, (e) => e.state.transitions);\n    const nextTokenTypes = uniqBy(nextTransitions\n        .filter((e) => e instanceof AtomTransition)\n        .map((e) => e.tokenType), (e) => e.tokenTypeIdx);\n    return {\n        actualToken: current,\n        possibleTokenTypes: nextTokenTypes,\n        tokenPath: path\n    };\n}\nfunction getExistingTargetState(state, token) {\n    return state.edges[token.tokenTypeIdx];\n}\nfunction computeReachSet(configs, token, predicateSet) {\n    const intermediate = new ATNConfigSet();\n    const skippedStopStates = [];\n    for (const c of configs.elements) {\n        if (predicateSet.is(c.alt) === false) {\n            continue;\n        }\n        if (c.state.type === ATN_RULE_STOP) {\n            skippedStopStates.push(c);\n            continue;\n        }\n        const transitionLength = c.state.transitions.length;\n        for (let i = 0; i < transitionLength; i++) {\n            const transition = c.state.transitions[i];\n            const target = getReachableTarget(transition, token);\n            if (target !== undefined) {\n                intermediate.add({\n                    state: target,\n                    alt: c.alt,\n                    stack: c.stack\n                });\n            }\n        }\n    }\n    let reach;\n    if (skippedStopStates.length === 0 && intermediate.size === 1) {\n        reach = intermediate;\n    }\n    if (reach === undefined) {\n        reach = new ATNConfigSet();\n        for (const c of intermediate.elements) {\n            closure(c, reach);\n        }\n    }\n    if (skippedStopStates.length > 0 && !hasConfigInRuleStopState(reach)) {\n        for (const c of skippedStopStates) {\n            reach.add(c);\n        }\n    }\n    return reach;\n}\nfunction getReachableTarget(transition, token) {\n    if (transition instanceof AtomTransition &&\n        tokenMatcher(token, transition.tokenType)) {\n        return transition.target;\n    }\n    return undefined;\n}\nfunction getUniqueAlt(configs, predicateSet) {\n    let alt;\n    for (const c of configs.elements) {\n        if (predicateSet.is(c.alt) === true) {\n            if (alt === undefined) {\n                alt = c.alt;\n            }\n            else if (alt !== c.alt) {\n                return undefined;\n            }\n        }\n    }\n    return alt;\n}\nfunction newDFAState(closure) {\n    return {\n        configs: closure,\n        edges: {},\n        isAcceptState: false,\n        prediction: -1\n    };\n}\nfunction addDFAEdge(dfa, from, token, to) {\n    to = addDFAState(dfa, to);\n    from.edges[token.tokenTypeIdx] = to;\n    return to;\n}\nfunction addDFAState(dfa, state) {\n    if (state === DFA_ERROR) {\n        return state;\n    }\n    // Repetitions have the same config set\n    // Therefore, storing the key of the config in a map allows us to create a loop in our DFA\n    const mapKey = state.configs.key;\n    const existing = dfa.states[mapKey];\n    if (existing !== undefined) {\n        return existing;\n    }\n    state.configs.finalize();\n    dfa.states[mapKey] = state;\n    return state;\n}\nfunction computeStartState(atnState) {\n    const configs = new ATNConfigSet();\n    const numberOfTransitions = atnState.transitions.length;\n    for (let i = 0; i < numberOfTransitions; i++) {\n        const target = atnState.transitions[i].target;\n        const config = {\n            state: target,\n            alt: i,\n            stack: []\n        };\n        closure(config, configs);\n    }\n    return configs;\n}\nfunction closure(config, configs) {\n    const p = config.state;\n    if (p.type === ATN_RULE_STOP) {\n        if (config.stack.length > 0) {\n            const atnStack = [...config.stack];\n            const followState = atnStack.pop();\n            const followConfig = {\n                state: followState,\n                alt: config.alt,\n                stack: atnStack\n            };\n            closure(followConfig, configs);\n        }\n        else {\n            // Dipping into outer context, simply add the config\n            // This will stop computation once every config is at the rule stop state\n            configs.add(config);\n        }\n        return;\n    }\n    if (!p.epsilonOnlyTransitions) {\n        configs.add(config);\n    }\n    const transitionLength = p.transitions.length;\n    for (let i = 0; i < transitionLength; i++) {\n        const transition = p.transitions[i];\n        const c = getEpsilonTarget(config, transition);\n        if (c !== undefined) {\n            closure(c, configs);\n        }\n    }\n}\nfunction getEpsilonTarget(config, transition) {\n    if (transition instanceof EpsilonTransition) {\n        return {\n            state: transition.target,\n            alt: config.alt,\n            stack: config.stack\n        };\n    }\n    else if (transition instanceof RuleTransition) {\n        const stack = [...config.stack, transition.followState];\n        return {\n            state: transition.target,\n            alt: config.alt,\n            stack\n        };\n    }\n    return undefined;\n}\nfunction hasConfigInRuleStopState(configs) {\n    for (const c of configs.elements) {\n        if (c.state.type === ATN_RULE_STOP) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction allConfigsInRuleStopStates(configs) {\n    for (const c of configs.elements) {\n        if (c.state.type !== ATN_RULE_STOP) {\n            return false;\n        }\n    }\n    return true;\n}\nfunction hasConflictTerminatingPrediction(configs) {\n    if (allConfigsInRuleStopStates(configs)) {\n        return true;\n    }\n    const altSets = getConflictingAltSets(configs.elements);\n    const heuristic = hasConflictingAltSet(altSets) && !hasStateAssociatedWithOneAlt(altSets);\n    return heuristic;\n}\nfunction getConflictingAltSets(configs) {\n    const configToAlts = new Map();\n    for (const c of configs) {\n        const key = getATNConfigKey(c, false);\n        let alts = configToAlts.get(key);\n        if (alts === undefined) {\n            alts = {};\n            configToAlts.set(key, alts);\n        }\n        alts[c.alt] = true;\n    }\n    return configToAlts;\n}\nfunction hasConflictingAltSet(altSets) {\n    for (const value of Array.from(altSets.values())) {\n        if (Object.keys(value).length > 1) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction hasStateAssociatedWithOneAlt(altSets) {\n    for (const value of Array.from(altSets.values())) {\n        if (Object.keys(value).length === 1) {\n            return true;\n        }\n    }\n    return false;\n}\n//# sourceMappingURL=all-star-lookahead.js.map","/* --------------------------------------------------------------------------------------------\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        let candidate = value;\n        return Is.objectLiteral(candidate) && Is.uinteger(candidate.line) && Is.uinteger(candidate.character);\n    }\n    Position.is = is;\n})(Position || (Position = {}));\n/**\n * The Range namespace provides helper functions to work with\n * {@link Range} literals.\n */\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        let candidate = value;\n        return Is.objectLiteral(candidate) && Position.is(candidate.start) && Position.is(candidate.end);\n    }\n    Range.is = is;\n})(Range || (Range = {}));\n/**\n * The Location namespace provides helper functions to work with\n * {@link Location} literals.\n */\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        let candidate = value;\n        return Is.objectLiteral(candidate) && Range.is(candidate.range) && (Is.string(candidate.uri) || Is.undefined(candidate.uri));\n    }\n    Location.is = is;\n})(Location || (Location = {}));\n/**\n * The LocationLink namespace provides helper functions to work with\n * {@link LocationLink} literals.\n */\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        let candidate = value;\n        return Is.objectLiteral(candidate) && Range.is(candidate.targetRange) && Is.string(candidate.targetUri)\n            && Range.is(candidate.targetSelectionRange)\n            && (Range.is(candidate.originSelectionRange) || Is.undefined(candidate.originSelectionRange));\n    }\n    LocationLink.is = is;\n})(LocationLink || (LocationLink = {}));\n/**\n * The Color namespace provides helper functions to work with\n * {@link Color} literals.\n */\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        let candidate = value;\n        return Is.defined(candidate) && Location.is(candidate.location) && Is.string(candidate.message);\n    }\n    DiagnosticRelatedInformation.is = is;\n})(DiagnosticRelatedInformation || (DiagnosticRelatedInformation = {}));\n/**\n * The diagnostic's severity.\n */\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        let result = { range, message };\n        if (Is.defined(severity)) {\n            result.severity = severity;\n        }\n        if (Is.defined(code)) {\n            result.code = code;\n        }\n        if (Is.defined(source)) {\n            result.source = source;\n        }\n        if (Is.defined(relatedInformation)) {\n            result.relatedInformation = relatedInformation;\n        }\n        return result;\n    }\n    Diagnostic.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link Diagnostic} interface.\n     */\n    function is(value) {\n        var _a;\n        let candidate = value;\n        return Is.defined(candidate)\n            && Range.is(candidate.range)\n            && Is.string(candidate.message)\n            && (Is.number(candidate.severity) || Is.undefined(candidate.severity))\n            && (Is.integer(candidate.code) || Is.string(candidate.code) || Is.undefined(candidate.code))\n            && (Is.undefined(candidate.codeDescription) || (Is.string((_a = candidate.codeDescription) === null || _a === void 0 ? void 0 : _a.href)))\n            && (Is.string(candidate.source) || Is.undefined(candidate.source))\n            && (Is.undefined(candidate.relatedInformation) || Is.typedArray(candidate.relatedInformation, DiagnosticRelatedInformation.is));\n    }\n    Diagnostic.is = is;\n})(Diagnostic || (Diagnostic = {}));\n/**\n * The Command namespace provides helper functions to work with\n * {@link Command} literals.\n */\nexport var Command;\n(function (Command) {\n    /**\n     * Creates a new Command literal.\n     */\n    function create(title, command, ...args) {\n        let result = { title, command };\n        if (Is.defined(args) && args.length > 0) {\n            result.arguments = args;\n        }\n        return result;\n    }\n    Command.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link Command} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.title) && Is.string(candidate.command);\n    }\n    Command.is = is;\n})(Command || (Command = {}));\n/**\n * The TextEdit namespace provides helper function to create replace,\n * insert and delete edits more easily.\n */\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        let candidate = value;\n        return Is.defined(candidate)\n            && OptionalVersionedTextDocumentIdentifier.is(candidate.textDocument)\n            && Array.isArray(candidate.edits);\n    }\n    TextDocumentEdit.is = is;\n})(TextDocumentEdit || (TextDocumentEdit = {}));\nexport var CreateFile;\n(function (CreateFile) {\n    function create(uri, options, annotation) {\n        let result = {\n            kind: 'create',\n            uri\n        };\n        if (options !== undefined && (options.overwrite !== undefined || options.ignoreIfExists !== undefined)) {\n            result.options = options;\n        }\n        if (annotation !== undefined) {\n            result.annotationId = annotation;\n        }\n        return result;\n    }\n    CreateFile.create = create;\n    function is(value) {\n        let candidate = value;\n        return candidate && candidate.kind === 'create' && Is.string(candidate.uri) && (candidate.options === undefined ||\n            ((candidate.options.overwrite === undefined || Is.boolean(candidate.options.overwrite)) && (candidate.options.ignoreIfExists === undefined || Is.boolean(candidate.options.ignoreIfExists)))) && (candidate.annotationId === undefined || ChangeAnnotationIdentifier.is(candidate.annotationId));\n    }\n    CreateFile.is = is;\n})(CreateFile || (CreateFile = {}));\nexport var RenameFile;\n(function (RenameFile) {\n    function create(oldUri, newUri, options, annotation) {\n        let result = {\n            kind: 'rename',\n            oldUri,\n            newUri\n        };\n        if (options !== undefined && (options.overwrite !== undefined || options.ignoreIfExists !== undefined)) {\n            result.options = options;\n        }\n        if (annotation !== undefined) {\n            result.annotationId = annotation;\n        }\n        return result;\n    }\n    RenameFile.create = create;\n    function is(value) {\n        let candidate = value;\n        return candidate && candidate.kind === 'rename' && Is.string(candidate.oldUri) && Is.string(candidate.newUri) && (candidate.options === undefined ||\n            ((candidate.options.overwrite === undefined || Is.boolean(candidate.options.overwrite)) && (candidate.options.ignoreIfExists === undefined || Is.boolean(candidate.options.ignoreIfExists)))) && (candidate.annotationId === undefined || ChangeAnnotationIdentifier.is(candidate.annotationId));\n    }\n    RenameFile.is = is;\n})(RenameFile || (RenameFile = {}));\nexport var DeleteFile;\n(function (DeleteFile) {\n    function create(uri, options, annotation) {\n        let result = {\n            kind: 'delete',\n            uri\n        };\n        if (options !== undefined && (options.recursive !== undefined || options.ignoreIfNotExists !== undefined)) {\n            result.options = options;\n        }\n        if (annotation !== undefined) {\n            result.annotationId = annotation;\n        }\n        return result;\n    }\n    DeleteFile.create = create;\n    function is(value) {\n        let candidate = value;\n        return candidate && candidate.kind === 'delete' && Is.string(candidate.uri) && (candidate.options === undefined ||\n            ((candidate.options.recursive === undefined || Is.boolean(candidate.options.recursive)) && (candidate.options.ignoreIfNotExists === undefined || Is.boolean(candidate.options.ignoreIfNotExists)))) && (candidate.annotationId === undefined || ChangeAnnotationIdentifier.is(candidate.annotationId));\n    }\n    DeleteFile.is = is;\n})(DeleteFile || (DeleteFile = {}));\nexport var WorkspaceEdit;\n(function (WorkspaceEdit) {\n    function is(value) {\n        let candidate = value;\n        return candidate &&\n            (candidate.changes !== undefined || candidate.documentChanges !== undefined) &&\n            (candidate.documentChanges === undefined || candidate.documentChanges.every((change) => {\n                if (Is.string(change.kind)) {\n                    return CreateFile.is(change) || RenameFile.is(change) || DeleteFile.is(change);\n                }\n                else {\n                    return TextDocumentEdit.is(change);\n                }\n            }));\n    }\n    WorkspaceEdit.is = is;\n})(WorkspaceEdit || (WorkspaceEdit = {}));\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}\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                let 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        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri);\n    }\n    TextDocumentIdentifier.is = is;\n})(TextDocumentIdentifier || (TextDocumentIdentifier = {}));\n/**\n * The VersionedTextDocumentIdentifier namespace provides helper functions to work with\n * {@link VersionedTextDocumentIdentifier} literals.\n */\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        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri) && Is.integer(candidate.version);\n    }\n    VersionedTextDocumentIdentifier.is = is;\n})(VersionedTextDocumentIdentifier || (VersionedTextDocumentIdentifier = {}));\n/**\n * The OptionalVersionedTextDocumentIdentifier namespace provides helper functions to work with\n * {@link OptionalVersionedTextDocumentIdentifier} literals.\n */\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        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri) && (candidate.version === null || Is.integer(candidate.version));\n    }\n    OptionalVersionedTextDocumentIdentifier.is = is;\n})(OptionalVersionedTextDocumentIdentifier || (OptionalVersionedTextDocumentIdentifier = {}));\n/**\n * The TextDocumentItem namespace provides helper functions to work with\n * {@link TextDocumentItem} literals.\n */\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        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri) && Is.string(candidate.languageId) && Is.integer(candidate.version) && Is.string(candidate.text);\n    }\n    TextDocumentItem.is = is;\n})(TextDocumentItem || (TextDocumentItem = {}));\n/**\n * Describes the content type that a client supports in various\n * result literals like `Hover`, `ParameterInfo` or `CompletionItem`.\n *\n * Please note that `MarkupKinds` must not start with a `$`. This kinds\n * are reserved for internal usage.\n */\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 = {}));\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        let candidate = value;\n        return !!candidate && Is.objectLiteral(candidate) && (MarkupContent.is(candidate.contents) ||\n            MarkedString.is(candidate.contents) ||\n            Is.typedArray(candidate.contents, MarkedString.is)) && (value.range === undefined || Range.is(value.range));\n    }\n    Hover.is = is;\n})(Hover || (Hover = {}));\n/**\n * The ParameterInformation namespace provides helper functions to work with\n * {@link ParameterInformation} literals.\n */\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        let result = { label };\n        if (Is.defined(documentation)) {\n            result.documentation = documentation;\n        }\n        if (Is.defined(parameters)) {\n            result.parameters = parameters;\n        }\n        else {\n            result.parameters = [];\n        }\n        return result;\n    }\n    SignatureInformation.create = create;\n})(SignatureInformation || (SignatureInformation = {}));\n/**\n * A document highlight kind.\n */\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        let result = { range };\n        if (Is.number(kind)) {\n            result.kind = kind;\n        }\n        return result;\n    }\n    DocumentHighlight.create = create;\n})(DocumentHighlight || (DocumentHighlight = {}));\n/**\n * A symbol kind.\n */\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        let result = {\n            name,\n            kind,\n            location: { uri, range }\n        };\n        if (containerName) {\n            result.containerName = containerName;\n        }\n        return result;\n    }\n    SymbolInformation.create = create;\n})(SymbolInformation || (SymbolInformation = {}));\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        let result = {\n            name,\n            detail,\n            kind,\n            range,\n            selectionRange\n        };\n        if (children !== undefined) {\n            result.children = children;\n        }\n        return result;\n    }\n    DocumentSymbol.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link DocumentSymbol} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return candidate &&\n            Is.string(candidate.name) && Is.number(candidate.kind) &&\n            Range.is(candidate.range) && Range.is(candidate.selectionRange) &&\n            (candidate.detail === undefined || Is.string(candidate.detail)) &&\n            (candidate.deprecated === undefined || Is.boolean(candidate.deprecated)) &&\n            (candidate.children === undefined || Array.isArray(candidate.children)) &&\n            (candidate.tags === undefined || Array.isArray(candidate.tags));\n    }\n    DocumentSymbol.is = is;\n})(DocumentSymbol || (DocumentSymbol = {}));\n/**\n * A set of predefined code action kinds\n */\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 rewrite actions: 'refactor.rewrite'\n     *\n     * Example rewrite actions:\n     *\n     * - Convert JavaScript function to class\n     * - Add or remove parameter\n     * - Encapsulate field\n     * - Make method static\n     * - Move method to base class\n     * - ...\n     */\n    CodeActionKind.RefactorRewrite = 'refactor.rewrite';\n    /**\n     * Base kind for source actions: `source`\n     *\n     * Source code actions apply to the entire file.\n     */\n    CodeActionKind.Source = 'source';\n    /**\n     * Base kind for an organize imports source action: `source.organizeImports`\n     */\n    CodeActionKind.SourceOrganizeImports = 'source.organizeImports';\n    /**\n     * Base kind for auto-fix source actions: `source.fixAll`.\n     *\n     * Fix all actions automatically fix errors that have a clear fix that do not require user input.\n     * They should not suppress errors or perform unsafe fixes such as generating new types or classes.\n     *\n     * @since 3.15.0\n     */\n    CodeActionKind.SourceFixAll = 'source.fixAll';\n})(CodeActionKind || (CodeActionKind = {}));\n/**\n * The reason why code actions were requested.\n *\n * @since 3.17.0\n */\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        let result = { diagnostics };\n        if (only !== undefined && only !== null) {\n            result.only = only;\n        }\n        if (triggerKind !== undefined && triggerKind !== null) {\n            result.triggerKind = triggerKind;\n        }\n        return result;\n    }\n    CodeActionContext.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link CodeActionContext} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Is.typedArray(candidate.diagnostics, Diagnostic.is)\n            && (candidate.only === undefined || Is.typedArray(candidate.only, Is.string))\n            && (candidate.triggerKind === undefined || candidate.triggerKind === CodeActionTriggerKind.Invoked || candidate.triggerKind === CodeActionTriggerKind.Automatic);\n    }\n    CodeActionContext.is = is;\n})(CodeActionContext || (CodeActionContext = {}));\nexport var CodeAction;\n(function (CodeAction) {\n    function create(title, kindOrCommandOrEdit, kind) {\n        let result = { title };\n        let checkKind = true;\n        if (typeof kindOrCommandOrEdit === 'string') {\n            checkKind = false;\n            result.kind = kindOrCommandOrEdit;\n        }\n        else if (Command.is(kindOrCommandOrEdit)) {\n            result.command = kindOrCommandOrEdit;\n        }\n        else {\n            result.edit = kindOrCommandOrEdit;\n        }\n        if (checkKind && kind !== undefined) {\n            result.kind = kind;\n        }\n        return result;\n    }\n    CodeAction.create = create;\n    function is(value) {\n        let candidate = value;\n        return candidate && Is.string(candidate.title) &&\n            (candidate.diagnostics === undefined || Is.typedArray(candidate.diagnostics, Diagnostic.is)) &&\n            (candidate.kind === undefined || Is.string(candidate.kind)) &&\n            (candidate.edit !== undefined || candidate.command !== undefined) &&\n            (candidate.command === undefined || Command.is(candidate.command)) &&\n            (candidate.isPreferred === undefined || Is.boolean(candidate.isPreferred)) &&\n            (candidate.edit === undefined || WorkspaceEdit.is(candidate.edit));\n    }\n    CodeAction.is = is;\n})(CodeAction || (CodeAction = {}));\n/**\n * The CodeLens namespace provides helper functions to work with\n * {@link CodeLens} literals.\n */\nexport var CodeLens;\n(function (CodeLens) {\n    /**\n     * Creates a new CodeLens literal.\n     */\n    function create(range, data) {\n        let result = { range };\n        if (Is.defined(data)) {\n            result.data = data;\n        }\n        return result;\n    }\n    CodeLens.create = create;\n    /**\n     * Checks whether the given literal conforms to the {@link CodeLens} interface.\n     */\n    function is(value) {\n        let candidate = value;\n        return Is.defined(candidate) && Range.is(candidate.range) && (Is.undefined(candidate.command) || Command.is(candidate.command));\n    }\n    CodeLens.is = is;\n})(CodeLens || (CodeLens = {}));\n/**\n * The FormattingOptions namespace provides helper functions to work with\n * {@link FormattingOptions} literals.\n */\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        let candidate = value;\n        return Is.defined(candidate) && Is.uinteger(candidate.tabSize) && Is.boolean(candidate.insertSpaces);\n    }\n    FormattingOptions.is = is;\n})(FormattingOptions || (FormattingOptions = {}));\n/**\n * The DocumentLink namespace provides helper functions to work with\n * {@link DocumentLink} literals.\n */\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        let candidate = value;\n        return Is.defined(candidate) && Range.is(candidate.range) && (Is.undefined(candidate.target) || Is.string(candidate.target));\n    }\n    DocumentLink.is = is;\n})(DocumentLink || (DocumentLink = {}));\n/**\n * The SelectionRange namespace provides helper function to work with\n * SelectionRange literals.\n */\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        let candidate = value;\n        return Is.objectLiteral(candidate) && Range.is(candidate.range) && (candidate.parent === undefined || SelectionRange.is(candidate.parent));\n    }\n    SelectionRange.is = is;\n})(SelectionRange || (SelectionRange = {}));\n/**\n * A set of predefined token types. This set is not fixed\n * an clients can specify additional token types via the\n * corresponding client capabilities.\n *\n * @since 3.16.0\n */\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})(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 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})(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 * @proposed\n */\nexport var InlineCompletionTriggerKind;\n(function (InlineCompletionTriggerKind) {\n    /**\n     * Completion was triggered explicitly by a user gesture.\n     */\n    InlineCompletionTriggerKind.Invoked = 0;\n    /**\n     * Completion was triggered automatically while editing.\n     */\n    InlineCompletionTriggerKind.Automatic = 1;\n})(InlineCompletionTriggerKind || (InlineCompletionTriggerKind = {}));\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        let candidate = value;\n        return Is.defined(candidate) && Is.string(candidate.uri) && (Is.undefined(candidate.languageId) || Is.string(candidate.languageId)) && Is.uinteger(candidate.lineCount)\n            && Is.func(candidate.getText) && Is.func(candidate.positionAt) && Is.func(candidate.offsetAt) ? true : false;\n    }\n    TextDocument.is = is;\n    function applyEdits(document, edits) {\n        let text = document.getText();\n        let sortedEdits = mergeSort(edits, (a, b) => {\n            let diff = a.range.start.line - b.range.start.line;\n            if (diff === 0) {\n                return a.range.start.character - b.range.start.character;\n            }\n            return diff;\n        });\n        let lastModifiedOffset = text.length;\n        for (let i = sortedEdits.length - 1; i >= 0; i--) {\n            let e = sortedEdits[i];\n            let startOffset = document.offsetAt(e.range.start);\n            let endOffset = document.offsetAt(e.range.end);\n            if (endOffset <= lastModifiedOffset) {\n                text = text.substring(0, startOffset) + e.newText + text.substring(endOffset, text.length);\n            }\n            else {\n                throw new Error('Overlapping edit');\n            }\n            lastModifiedOffset = startOffset;\n        }\n        return text;\n    }\n    TextDocument.applyEdits = applyEdits;\n    function mergeSort(data, compare) {\n        if (data.length <= 1) {\n            // sorted\n            return data;\n        }\n        const p = (data.length / 2) | 0;\n        const left = data.slice(0, p);\n        const right = data.slice(p);\n        mergeSort(left, compare);\n        mergeSort(right, compare);\n        let leftIdx = 0;\n        let rightIdx = 0;\n        let i = 0;\n        while (leftIdx < left.length && rightIdx < right.length) {\n            let ret = compare(left[leftIdx], right[rightIdx]);\n            if (ret <= 0) {\n                // smaller_equal -> take left to preserve order\n                data[i++] = left[leftIdx++];\n            }\n            else {\n                // greater -> take right\n                data[i++] = right[rightIdx++];\n            }\n        }\n        while (leftIdx < left.length) {\n            data[i++] = left[leftIdx++];\n        }\n        while (rightIdx < right.length) {\n            data[i++] = right[rightIdx++];\n        }\n        return data;\n    }\n})(TextDocument || (TextDocument = {}));\n/**\n * @deprecated Use the text document from the new vscode-languageserver-textdocument package.\n */\nclass FullTextDocument {\n    constructor(uri, languageId, version, content) {\n        this._uri = uri;\n        this._languageId = languageId;\n        this._version = version;\n        this._content = content;\n        this._lineOffsets = undefined;\n    }\n    get uri() {\n        return this._uri;\n    }\n    get languageId() {\n        return this._languageId;\n    }\n    get version() {\n        return this._version;\n    }\n    getText(range) {\n        if (range) {\n            let start = this.offsetAt(range.start);\n            let end = this.offsetAt(range.end);\n            return this._content.substring(start, end);\n        }\n        return this._content;\n    }\n    update(event, version) {\n        this._content = event.text;\n        this._version = version;\n        this._lineOffsets = undefined;\n    }\n    getLineOffsets() {\n        if (this._lineOffsets === undefined) {\n            let lineOffsets = [];\n            let text = this._content;\n            let isLineStart = true;\n            for (let i = 0; i < text.length; i++) {\n                if (isLineStart) {\n                    lineOffsets.push(i);\n                    isLineStart = false;\n                }\n                let ch = text.charAt(i);\n                isLineStart = (ch === '\\r' || ch === '\\n');\n                if (ch === '\\r' && i + 1 < text.length && text.charAt(i + 1) === '\\n') {\n                    i++;\n                }\n            }\n            if (isLineStart && text.length > 0) {\n                lineOffsets.push(text.length);\n            }\n            this._lineOffsets = lineOffsets;\n        }\n        return this._lineOffsets;\n    }\n    positionAt(offset) {\n        offset = Math.max(Math.min(offset, this._content.length), 0);\n        let lineOffsets = this.getLineOffsets();\n        let low = 0, high = lineOffsets.length;\n        if (high === 0) {\n            return Position.create(0, offset);\n        }\n        while (low < high) {\n            let mid = Math.floor((low + high) / 2);\n            if (lineOffsets[mid] > offset) {\n                high = mid;\n            }\n            else {\n                low = mid + 1;\n            }\n        }\n        // low is the least x for which the line offset is larger than the current offset\n        // or array.length if no line offset is larger than the current offset\n        let line = low - 1;\n        return Position.create(line, offset - lineOffsets[line]);\n    }\n    offsetAt(position) {\n        let lineOffsets = this.getLineOffsets();\n        if (position.line >= lineOffsets.length) {\n            return this._content.length;\n        }\n        else if (position.line < 0) {\n            return 0;\n        }\n        let lineOffset = lineOffsets[position.line];\n        let nextLineOffset = (position.line + 1 < lineOffsets.length) ? lineOffsets[position.line + 1] : this._content.length;\n        return Math.max(Math.min(lineOffset + position.character, nextLineOffset), lineOffset);\n    }\n    get lineCount() {\n        return this.getLineOffsets().length;\n    }\n}\nvar Is;\n(function (Is) {\n    const toString = Object.prototype.toString;\n    function defined(value) {\n        return typeof value !== 'undefined';\n    }\n    Is.defined = defined;\n    function undefined(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","/******************************************************************************\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 ******************************************************************************/\nimport { Position } from 'vscode-languageserver-types';\nimport { tokenToRange } from '../utils/cst-utils.js';\nexport class CstNodeBuilder {\n    constructor() {\n        this.nodeStack = [];\n    }\n    get current() {\n        return this.nodeStack[this.nodeStack.length - 1] ?? this.rootNode;\n    }\n    buildRootNode(input) {\n        this.rootNode = new RootCstNodeImpl(input);\n        this.rootNode.root = this.rootNode;\n        this.nodeStack = [this.rootNode];\n        return this.rootNode;\n    }\n    buildCompositeNode(feature) {\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    buildLeafNode(token, feature) {\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    removeNode(node) {\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    addHiddenNodes(tokens) {\n        const nodes = [];\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 = 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    construct(item) {\n        const current = 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 = 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}\nexport class AbstractCstNode {\n    get hidden() {\n        return false;\n    }\n    get 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    set astNode(value) {\n        this._astNode = value;\n    }\n    get text() {\n        return this.root.fullText.substring(this.offset, this.end);\n    }\n}\nexport class LeafCstNodeImpl extends AbstractCstNode {\n    get offset() {\n        return this._offset;\n    }\n    get length() {\n        return this._length;\n    }\n    get end() {\n        return this._offset + this._length;\n    }\n    get hidden() {\n        return this._hidden;\n    }\n    get tokenType() {\n        return this._tokenType;\n    }\n    get range() {\n        return this._range;\n    }\n    constructor(offset, length, range, 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}\nexport class CompositeCstNodeImpl extends AbstractCstNode {\n    constructor() {\n        super(...arguments);\n        this.content = new CstNodeContainer(this);\n    }\n    get offset() {\n        return this.firstNonHiddenNode?.offset ?? 0;\n    }\n    get length() {\n        return this.end - this.offset;\n    }\n    get end() {\n        return this.lastNonHiddenNode?.end ?? 0;\n    }\n    get 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        }\n        else {\n            return { start: Position.create(0, 0), end: Position.create(0, 0) };\n        }\n    }\n    get firstNonHiddenNode() {\n        for (const child of this.content) {\n            if (!child.hidden) {\n                return child;\n            }\n        }\n        return this.content[0];\n    }\n    get lastNonHiddenNode() {\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}\nclass CstNodeContainer extends Array {\n    constructor(parent) {\n        super();\n        this.parent = parent;\n        Object.setPrototypeOf(this, CstNodeContainer.prototype);\n    }\n    push(...items) {\n        this.addParents(items);\n        return super.push(...items);\n    }\n    unshift(...items) {\n        this.addParents(items);\n        return super.unshift(...items);\n    }\n    splice(start, count, ...items) {\n        this.addParents(items);\n        return super.splice(start, count, ...items);\n    }\n    addParents(items) {\n        for (const item of items) {\n            item.container = this.parent;\n        }\n    }\n}\nexport class RootCstNodeImpl extends CompositeCstNodeImpl {\n    get text() {\n        return this._text.substring(this.offset, this.end);\n    }\n    get fullText() {\n        return this._text;\n    }\n    constructor(input) {\n        super();\n        this._text = '';\n        this._text = input ?? '';\n    }\n}\n//# sourceMappingURL=cst-node-builder.js.map","/******************************************************************************\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/* eslint-disable @typescript-eslint/no-explicit-any */\nimport { isInfixRule } from '../languages/generated/ast.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';\nexport const DatatypeSymbol = Symbol('Datatype');\nfunction isDataTypeNode(node) {\n    return node.$type === DatatypeSymbol;\n}\nconst ruleSuffix = '\\u200B';\nconst withRuleSuffix = (name) => name.endsWith(ruleSuffix) ? name : name + ruleSuffix;\nexport class AbstractLangiumParser {\n    constructor(services) {\n        this._unorderedGroups = new Map();\n        this.allRules = new Map();\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            }, services.shared.profilers.LangiumProfiler.createTask('parsing', services.LanguageMetaData.languageId));\n        }\n        else {\n            this.wrapper = new ChevrotainWrapper(tokens, {\n                ...services.parser.ParserConfig,\n                skipValidations: production,\n                errorMessageProvider: services.parser.ParserErrorMessageProvider\n            });\n        }\n    }\n    alternatives(idx, choices) {\n        this.wrapper.wrapOr(idx, choices);\n    }\n    optional(idx, callback) {\n        this.wrapper.wrapOption(idx, callback);\n    }\n    many(idx, callback) {\n        this.wrapper.wrapMany(idx, callback);\n    }\n    atLeastOne(idx, callback) {\n        this.wrapper.wrapAtLeastOne(idx, callback);\n    }\n    getRule(name) {\n        return this.allRules.get(name);\n    }\n    isRecording() {\n        return this.wrapper.IS_RECORDING;\n    }\n    get unorderedGroups() {\n        return this._unorderedGroups;\n    }\n    getRuleStack() {\n        return this.wrapper.RULE_STACK;\n    }\n    finalize() {\n        this.wrapper.wrapSelfAnalysis();\n    }\n}\nexport class LangiumParser extends AbstractLangiumParser {\n    get current() {\n        return this.stack[this.stack.length - 1];\n    }\n    constructor(services) {\n        super(services);\n        this.nodeBuilder = new CstNodeBuilder();\n        this.stack = [];\n        this.assignmentMap = new Map();\n        this.operatorPrecedence = new Map();\n        this.linker = services.references.Linker;\n        this.converter = services.parser.ValueConverter;\n        this.astReflection = services.shared.AstReflection;\n    }\n    rule(rule, impl) {\n        const type = this.computeRuleType(rule);\n        let infixName = 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    registerPrecedenceMap(rule) {\n        const name = rule.name;\n        const map = new Map();\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    computeRuleType(rule) {\n        if (isInfixRule(rule)) {\n            return getTypeName(rule);\n        }\n        else if (rule.fragment) {\n            return undefined;\n        }\n        else if (isDataTypeRule(rule)) {\n            return DatatypeSymbol;\n        }\n        else {\n            return getTypeName(rule);\n        }\n    }\n    parse(input, options = {}) {\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    doParse(rule) {\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        }\n        else if (this.stack.length > 0) {\n            throw new Error('Parser stack is not empty after parsing');\n        }\n        return result;\n    }\n    startImplementation($type, infixName, implementation) {\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 = { $type };\n                this.stack.push(node);\n                if ($type === DatatypeSymbol) {\n                    node.value = '';\n                }\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    extractHiddenTokens(token) {\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    consume(idx, tokenType, feature) {\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            }\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     * 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    isValidToken(token) {\n        return !token.isInsertedInRecovery && !isNaN(token.startOffset) && typeof token.endOffset === 'number' && !isNaN(token.endOffset);\n    }\n    subrule(idx, rule, fragment, feature, args) {\n        let cstNode;\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;\n        try {\n            result = this.wrapper.wrapSubrule(idx, rule, args);\n        }\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    performSubruleAssignment(result, feature, cstNode) {\n        const { assignment, crossRef } = this.getAssignment(feature);\n        if (assignment) {\n            this.assign(assignment.operator, assignment.feature, result, cstNode, crossRef);\n        }\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            }\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    action($type, action) {\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            }\n            else {\n                last.$type = $type;\n            }\n        }\n    }\n    construct() {\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        }\n        else if (isDataTypeNode(obj)) {\n            return this.converter.convert(obj.value, obj.$cstNode);\n        }\n        else {\n            assignMandatoryProperties(this.astReflection, obj);\n        }\n        return obj;\n    }\n    constructInfix(obj, precedence) {\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        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            // 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            }\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        // Split the expression at the lowest precedence operator\n        const leftOperators = operators.slice(0, lowestPrecedenceIdx);\n        const rightOperators = operators.slice(lowestPrecedenceIdx + 1);\n        const leftParts = parts.slice(0, lowestPrecedenceIdx + 1);\n        const rightParts = parts.slice(lowestPrecedenceIdx + 1);\n        // Create sub-expressions\n        const leftInfix = {\n            $infixName: obj.$infixName,\n            $type: obj.$type,\n            $cstNode: obj.$cstNode,\n            parts: leftParts,\n            operators: leftOperators\n        };\n        const rightInfix = {\n            $infixName: obj.$infixName,\n            $type: obj.$type,\n            $cstNode: obj.$cstNode,\n            parts: rightParts,\n            operators: rightOperators\n        };\n        // Recursively build the left and right subtrees\n        const leftTree = this.constructInfix(leftInfix, precedence);\n        const rightTree = this.constructInfix(rightInfix, precedence);\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    getAssignment(feature) {\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    assign(operator, feature, value, cstNode, crossRef) {\n        const obj = this.current;\n        let item;\n        if (crossRef === 'single' && typeof value === 'string') {\n            item = this.linker.buildReference(obj, feature, cstNode, value);\n        }\n        else if (crossRef === 'multi' && typeof value === 'string') {\n            item = this.linker.buildMultiReference(obj, feature, cstNode, value);\n        }\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    assignWithoutOverride(target, source) {\n        for (const [name, existingValue] of Object.entries(source)) {\n            const newValue = target[name];\n            if (newValue === undefined) {\n                target[name] = existingValue;\n            }\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    get definitionErrors() {\n        return this.wrapper.definitionErrors;\n    }\n}\nexport class AbstractParserErrorMessageProvider {\n    buildMismatchTokenMessage(options) {\n        return defaultParserErrorProvider.buildMismatchTokenMessage(options);\n    }\n    buildNotAllInputParsedMessage(options) {\n        return defaultParserErrorProvider.buildNotAllInputParsedMessage(options);\n    }\n    buildNoViableAltMessage(options) {\n        return defaultParserErrorProvider.buildNoViableAltMessage(options);\n    }\n    buildEarlyExitMessage(options) {\n        return defaultParserErrorProvider.buildEarlyExitMessage(options);\n    }\n}\nexport class LangiumParserErrorMessageProvider extends AbstractParserErrorMessageProvider {\n    buildMismatchTokenMessage({ expected, actual }) {\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    buildNotAllInputParsedMessage({ firstRedundant }) {\n        return `Expecting end of file but found \\`${firstRedundant.image}\\`.`;\n    }\n}\nexport class LangiumCompletionParser extends AbstractLangiumParser {\n    constructor() {\n        super(...arguments);\n        this.tokens = [];\n        this.elementStack = [];\n        this.lastElementStack = [];\n        this.nextTokenIndex = 0;\n        this.stackSize = 0;\n    }\n    action() {\n        // NOOP\n    }\n    construct() {\n        // NOOP\n        return undefined;\n    }\n    parse(input) {\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    rule(rule, impl) {\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    resetState() {\n        this.elementStack = [];\n        this.lastElementStack = [];\n        this.nextTokenIndex = 0;\n        this.stackSize = 0;\n    }\n    startImplementation(implementation) {\n        return (args) => {\n            const size = this.keepStackSize();\n            try {\n                implementation(args);\n            }\n            finally {\n                this.resetStackSize(size);\n            }\n        };\n    }\n    removeUnexpectedElements() {\n        this.elementStack.splice(this.stackSize);\n    }\n    keepStackSize() {\n        const size = this.elementStack.length;\n        this.stackSize = size;\n        return size;\n    }\n    resetStackSize(size) {\n        this.removeUnexpectedElements();\n        this.stackSize = size;\n    }\n    consume(idx, tokenType, feature) {\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    subrule(idx, rule, fragment, feature, args) {\n        this.before(feature);\n        this.wrapper.wrapSubrule(idx, rule, args);\n        this.after(feature);\n    }\n    before(element) {\n        if (!this.isRecording()) {\n            this.elementStack.push(element);\n        }\n    }\n    after(element) {\n        if (!this.isRecording()) {\n            const index = this.elementStack.lastIndexOf(element);\n            if (index >= 0) {\n                this.elementStack.splice(index);\n            }\n        }\n    }\n    get currIdx() {\n        return this.wrapper.currIdx;\n    }\n}\nconst defaultConfig = {\n    recoveryEnabled: true,\n    nodeLocationTracking: 'full',\n    skipValidations: true,\n    errorMessageProvider: new LangiumParserErrorMessageProvider()\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    constructor(tokens, config) {\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                }),\n            ...config,\n        });\n    }\n    get IS_RECORDING() {\n        return this.RECORDING_PHASE;\n    }\n    DEFINE_RULE(name, impl, config) {\n        return this.RULE(name, impl, config);\n    }\n    wrapSelfAnalysis() {\n        this.performSelfAnalysis();\n    }\n    wrapConsume(idx, tokenType) {\n        return this.consume(idx, tokenType, undefined);\n    }\n    wrapSubrule(idx, rule, args) {\n        return this.subrule(idx, rule, {\n            ARGS: [args]\n        });\n    }\n    wrapOr(idx, choices) {\n        this.or(idx, choices);\n    }\n    wrapOption(idx, callback) {\n        this.option(idx, callback);\n    }\n    wrapMany(idx, callback) {\n        this.many(idx, callback);\n    }\n    wrapAtLeastOne(idx, callback) {\n        this.atLeastOne(idx, callback);\n    }\n    rule(rule) {\n        return rule.call(this, {});\n    }\n}\nclass ProfilerWrapper extends ChevrotainWrapper {\n    constructor(tokens, config, task) {\n        super(tokens, config);\n        this.task = task;\n    }\n    rule(rule) {\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    ruleName(rule) {\n        return rule.ruleName;\n    }\n    subrule(idx, ruleToCall, options) {\n        this.task.startSubTask(this.ruleName(ruleToCall));\n        try {\n            return super.subrule(idx, ruleToCall, options);\n        }\n        finally {\n            this.task.stopSubTask(this.ruleName(ruleToCall));\n        }\n    }\n}\n//# sourceMappingURL=langium-parser.js.map","/******************************************************************************\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 ******************************************************************************/\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';\nexport function createParser(grammar, parser, tokens) {\n    const parserContext = {\n        parser,\n        tokens,\n        ruleNames: new Map()\n    };\n    buildRules(parserContext, grammar);\n    return parser;\n}\nfunction buildRules(parserContext, grammar) {\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 = {\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}\nfunction buildInfixRule(ctx, rule) {\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 = {\n        $type: 'Group',\n        elements: []\n    };\n    const part1Assignment = {\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 = {\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 = {\n        $type: 'Alternatives',\n        elements: allKeywords\n    };\n    const operatorAssignment = {\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 = {\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 = tokens.map((token, index) => ({\n        ALT: () => ctx.parser.consume(index, token, operatorAssignment)\n    }));\n    let subrule;\n    return (args) => {\n        subrule ?? (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}\nfunction buildElement(ctx, element, ignoreGuard = false) {\n    let method;\n    if (isKeyword(element)) {\n        method = buildKeyword(ctx, element);\n    }\n    else if (isAction(element)) {\n        method = buildAction(ctx, element);\n    }\n    else if (isAssignment(element)) {\n        method = buildElement(ctx, element.terminal);\n    }\n    else if (isCrossReference(element)) {\n        method = buildCrossReference(ctx, element);\n    }\n    else if (isRuleCall(element)) {\n        method = buildRuleCall(ctx, element);\n    }\n    else if (isAlternatives(element)) {\n        method = buildAlternatives(ctx, element);\n    }\n    else if (isUnorderedGroup(element)) {\n        method = buildUnorderedGroup(ctx, element);\n    }\n    else if (isGroup(element)) {\n        method = buildGroup(ctx, element);\n    }\n    else if (isEndOfFile(element)) {\n        const idx = ctx.consume++;\n        method = () => ctx.parser.consume(idx, EOF, element);\n    }\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}\nfunction buildAction(ctx, action) {\n    const actionType = getTypeName(action);\n    return () => ctx.parser.action(actionType, action);\n}\nfunction buildRuleCall(ctx, ruleCall) {\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;\n        return (args) => {\n            subrule ?? (subrule = getRule(ctx, rule));\n            ctx.parser.subrule(idx, subrule, fragment, ruleCall, predicate(args));\n        };\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    }\n    else if (!rule) {\n        throw new ErrorWithLocation(ruleCall.$cstNode, `Undefined rule: ${ruleCall.rule.$refText}`);\n    }\n    else {\n        assertUnreachable(rule);\n    }\n}\nfunction buildRuleCallPredicate(rule, namedArgs) {\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 = {};\n            for (const { parameterName, predicate } of namedPredicates) {\n                if (parameterName) {\n                    ruleArgs[parameterName] = predicate(args);\n                }\n            }\n            return ruleArgs;\n        };\n    }\n    else {\n        const predicates = namedArgs.map(arg => buildPredicate(arg.value));\n        return (args) => {\n            const ruleArgs = {};\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}\nfunction buildPredicate(condition) {\n    if (isDisjunction(condition)) {\n        const left = buildPredicate(condition.left);\n        const right = buildPredicate(condition.right);\n        return (args) => (left(args) || right(args));\n    }\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    }\n    else if (isNegation(condition)) {\n        const value = buildPredicate(condition.value);\n        return (args) => !value(args);\n    }\n    else if (isParameterReference(condition)) {\n        const name = condition.parameter.ref.name;\n        return (args) => args !== undefined && args[name] === true;\n    }\n    else if (isBooleanLiteral(condition)) {\n        const value = Boolean(condition.true);\n        return () => value;\n    }\n    assertUnreachable(condition);\n}\nfunction buildAlternatives(ctx, alternatives) {\n    if (alternatives.elements.length === 1) {\n        return buildElement(ctx, alternatives.elements[0]);\n    }\n    else {\n        const methods = [];\n        for (const element of alternatives.elements) {\n            const 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        const idx = ctx.or++;\n        return (args) => ctx.parser.alternatives(idx, methods.map(method => {\n            const alt = {\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}\nfunction buildUnorderedGroup(ctx, group) {\n    if (group.elements.length === 1) {\n        return buildElement(ctx, group.elements[0]);\n    }\n    const methods = [];\n    for (const element of group.elements) {\n        const 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    const orIdx = ctx.or++;\n    const idFunc = (groupIdx, lParser) => {\n        const stackId = lParser.getRuleStack().join('-');\n        return `uGroup_${groupIdx}_${stackId}`;\n    };\n    const alternatives = (args) => ctx.parser.alternatives(orIdx, methods.map((method, idx) => {\n        const alt = { 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        }\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}\nfunction buildGroup(ctx, group) {\n    const methods = group.elements.map(e => buildElement(ctx, e));\n    return (args) => methods.forEach(method => method(args));\n}\nfunction getGuardCondition(element) {\n    if (isGroup(element)) {\n        return element.guardCondition;\n    }\n    return undefined;\n}\nfunction buildCrossReference(ctx, crossRef, terminal = crossRef.terminal) {\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    }\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;\n        return (args) => {\n            subrule ?? (subrule = getRule(ctx, rule));\n            ctx.parser.subrule(idx, subrule, false, crossRef, args);\n        };\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    }\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}\nfunction buildKeyword(ctx, keyword) {\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}\nfunction wrap(ctx, guard, method, cardinality) {\n    const gate = guard && buildPredicate(guard);\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        }\n        else {\n            return method;\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    }\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        }\n        else {\n            return (args) => ctx.parser.atLeastOne(idx, {\n                DEF: () => method(args),\n            });\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    }\n    else {\n        assertUnreachable(cardinality);\n    }\n}\nfunction getRule(ctx, element) {\n    const name = getRuleName(ctx, element);\n    const rule = ctx.parser.getRule(name);\n    if (!rule)\n        throw new Error(`Rule \"${name}\" not found.\"`);\n    return rule;\n}\nfunction getRuleName(ctx, element) {\n    if (isAbstractParserRule(element)) {\n        return element.name;\n    }\n    else if (ctx.ruleNames.has(element)) {\n        return ctx.ruleNames.get(element);\n    }\n    else {\n        let item = element;\n        let parent = item.$container;\n        let ruleName = element.$type;\n        while (!isParserRule(parent)) {\n            if (isGroup(parent) || isAlternatives(parent) || isUnorderedGroup(parent)) {\n                const index = parent.elements.indexOf(item);\n                ruleName = index.toString() + ':' + ruleName;\n            }\n            item = parent;\n            parent = parent.$container;\n        }\n        const rule = parent;\n        ruleName = rule.name + ':' + ruleName;\n        ctx.ruleNames.set(element, ruleName);\n        return ruleName;\n    }\n}\nfunction getToken(ctx, name) {\n    const token = ctx.tokens[name];\n    if (!token)\n        throw new Error(`Token \"${name}\" not found.\"`);\n    return token;\n}\n//# sourceMappingURL=parser-builder-base.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { LangiumCompletionParser } from './langium-parser.js';\nimport { createParser } from './parser-builder-base.js';\nexport function createCompletionParser(services) {\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//# sourceMappingURL=completion-parser-builder.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { LangiumParser } from './langium-parser.js';\nimport { createParser } from './parser-builder-base.js';\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) {\n    const parser = prepareLangiumParser(services);\n    parser.finalize();\n    return parser;\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) {\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//# sourceMappingURL=langium-parser-builder.js.map","/******************************************************************************\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 ******************************************************************************/\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';\nexport class DefaultTokenBuilder {\n    constructor() {\n        /**\n         * The list of diagnostics stored during the lexing process of a single text.\n         */\n        this.diagnostics = [];\n    }\n    buildTokens(grammar, options) {\n        const reachableRules = stream(getAllReachableRules(grammar, false));\n        const terminalTokens = this.buildTerminalTokens(reachableRules);\n        const tokens = this.buildKeywordTokens(reachableRules, terminalTokens, options);\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    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    flushLexingReport(text) {\n        return { diagnostics: this.popDiagnostics() };\n    }\n    popDiagnostics() {\n        const diagnostics = [...this.diagnostics];\n        this.diagnostics = [];\n        return diagnostics;\n    }\n    buildTerminalTokens(rules) {\n        return rules.filter(isTerminalRule).filter(e => !e.fragment)\n            .map(terminal => this.buildTerminalToken(terminal)).toArray();\n    }\n    buildTerminalToken(terminal) {\n        const regex = terminalRegex(terminal);\n        const pattern = this.requiresCustomPattern(regex) ? this.regexPatternFunction(regex) : regex;\n        const 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    requiresCustomPattern(regex) {\n        if (regex.flags.includes('u') || regex.flags.includes('s')) {\n            // Unicode and dotall regexes are not supported by Chevrotain.\n            return true;\n        }\n        else {\n            return false;\n        }\n    }\n    regexPatternFunction(regex) {\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    buildKeywordTokens(rules, terminalTokens, options) {\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    buildKeywordToken(keyword, terminalTokens, caseInsensitive) {\n        const keywordPattern = this.buildKeywordPattern(keyword, caseInsensitive);\n        const tokenType = {\n            name: keyword.value,\n            PATTERN: keywordPattern,\n            LONGER_ALT: this.findLongerAlt(keyword, terminalTokens)\n        };\n        if (typeof keywordPattern === 'function') {\n            tokenType.LINE_BREAKS = true;\n        }\n        return tokenType;\n    }\n    buildKeywordPattern(keyword, caseInsensitive) {\n        return caseInsensitive ?\n            new RegExp(escapeRegExp(keyword.value), 'i') :\n            keyword.value;\n    }\n    findLongerAlt(keyword, terminalTokens) {\n        return terminalTokens.reduce((longerAlts, token) => {\n            const pattern = token?.PATTERN;\n            if (pattern?.source && partialMatches('^' + pattern.source + '$', keyword.value)) {\n                longerAlts.push(token);\n            }\n            return longerAlts;\n        }, []);\n    }\n}\n//# sourceMappingURL=token-builder.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { isCrossReference, isRuleCall } from '../languages/generated/ast.js';\nimport { getCrossReferenceTerminal, getRuleType } from '../utils/grammar-utils.js';\nexport class DefaultValueConverter {\n    convert(input, cstNode) {\n        let feature = 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    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    runConverter(rule, input, cstNode) {\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}\nexport var ValueConverter;\n(function (ValueConverter) {\n    function convertString(input) {\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            }\n            else {\n                result += c;\n            }\n        }\n        return result;\n    }\n    ValueConverter.convertString = convertString;\n    function convertEscapeCharacter(char) {\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    function convertID(input) {\n        if (input.charAt(0) === '^') {\n            return input.substring(1);\n        }\n        else {\n            return input;\n        }\n    }\n    ValueConverter.convertID = convertID;\n    function convertInt(input) {\n        return parseInt(input);\n    }\n    ValueConverter.convertInt = convertInt;\n    function convertBigint(input) {\n        return BigInt(input);\n    }\n    ValueConverter.convertBigint = convertBigint;\n    function convertDate(input) {\n        return new Date(input);\n    }\n    ValueConverter.convertDate = convertDate;\n    function convertNumber(input) {\n        return Number(input);\n    }\n    ValueConverter.convertNumber = convertNumber;\n    function convertBoolean(input) {\n        return input.toLowerCase() === 'true';\n    }\n    ValueConverter.convertBoolean = convertBoolean;\n})(ValueConverter || (ValueConverter = {}));\n//# sourceMappingURL=value-converter.js.map","\"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 * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.stringArray = exports.array = exports.func = exports.error = exports.number = exports.string = exports.boolean = void 0;\nfunction boolean(value) {\n    return value === true || value === false;\n}\nexports.boolean = boolean;\nfunction string(value) {\n    return typeof value === 'string' || value instanceof String;\n}\nexports.string = string;\nfunction number(value) {\n    return typeof value === 'number' || value instanceof Number;\n}\nexports.number = number;\nfunction error(value) {\n    return value instanceof Error;\n}\nexports.error = error;\nfunction func(value) {\n    return typeof value === 'function';\n}\nexports.func = func;\nfunction array(value) {\n    return Array.isArray(value);\n}\nexports.array = array;\nfunction stringArray(value) {\n    return array(value) && value.every(elem => string(elem));\n}\nexports.stringArray = stringArray;\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.Emitter = exports.Event = void 0;\nconst ral_1 = 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    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                // eslint-disable-next-line no-console\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    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;\nEmitter._noop = function () { };\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.CancellationTokenSource = exports.CancellationToken = void 0;\nconst ral_1 = require(\"./ral\");\nconst Is = 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    constructor() {\n        this._isCancelled = false;\n    }\n    cancel() {\n        if (!this._isCancelled) {\n            this._isCancelled = true;\n            if (this._emitter) {\n                this._emitter.fire(undefined);\n                this.dispose();\n            }\n        }\n    }\n    get isCancellationRequested() {\n        return this._isCancelled;\n    }\n    get onCancellationRequested() {\n        if (this._isCancelled) {\n            return shortcutEvent;\n        }\n        if (!this._emitter) {\n            this._emitter = new 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    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","/******************************************************************************\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 ******************************************************************************/\nimport { CancellationToken, CancellationTokenSource } from '../utils/cancellation.js';\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() {\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        }\n        else {\n            setImmediate(resolve);\n        }\n    });\n}\nlet lastTick = 0;\nlet globalInterruptionPeriod = 10;\n/**\n * Reset the global interruption period and create a cancellation token source.\n */\nexport function startCancelableOperation() {\n    lastTick = performance.now();\n    return new CancellationTokenSource();\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) {\n    globalInterruptionPeriod = period;\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 * 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) {\n    return err === OperationCancelled;\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) {\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 * Simple implementation of the deferred pattern.\n * An object that exposes a promise and functions to resolve and reject it.\n */\nexport class Deferred {\n    constructor() {\n        this.promise = new Promise((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//# sourceMappingURL=promise-utils.js.map","/* --------------------------------------------------------------------------------------------\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    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","var LIB;(()=>{\"use strict\";var t={975:t=>{function e(t){if(\"string\"!=typeof t)throw new TypeError(\"Path must be a string. Received \"+JSON.stringify(t))}function r(t,e){for(var r,n=\"\",i=0,o=-1,s=0,h=0;h<=t.length;++h){if(h<t.length)r=t.charCodeAt(h);else{if(47===r)break;r=47}if(47===r){if(o===h-1||1===s);else if(o!==h-1&&2===s){if(n.length<2||2!==i||46!==n.charCodeAt(n.length-1)||46!==n.charCodeAt(n.length-2))if(n.length>2){var a=n.lastIndexOf(\"/\");if(a!==n.length-1){-1===a?(n=\"\",i=0):i=(n=n.slice(0,a)).length-1-n.lastIndexOf(\"/\"),o=h,s=0;continue}}else if(2===n.length||1===n.length){n=\"\",i=0,o=h,s=0;continue}e&&(n.length>0?n+=\"/..\":n=\"..\",i=2)}else n.length>0?n+=\"/\"+t.slice(o+1,h):n=t.slice(o+1,h),i=h-o-1;o=h,s=0}else 46===r&&-1!==s?++s:s=-1}return n}var n={resolve:function(){for(var t,n=\"\",i=!1,o=arguments.length-1;o>=-1&&!i;o--){var s;o>=0?s=arguments[o]:(void 0===t&&(t=process.cwd()),s=t),e(s),0!==s.length&&(n=s+\"/\"+n,i=47===s.charCodeAt(0))}return n=r(n,!i),i?n.length>0?\"/\"+n:\"/\":n.length>0?n:\".\"},normalize:function(t){if(e(t),0===t.length)return\".\";var n=47===t.charCodeAt(0),i=47===t.charCodeAt(t.length-1);return 0!==(t=r(t,!n)).length||n||(t=\".\"),t.length>0&&i&&(t+=\"/\"),n?\"/\"+t:t},isAbsolute:function(t){return e(t),t.length>0&&47===t.charCodeAt(0)},join:function(){if(0===arguments.length)return\".\";for(var t,r=0;r<arguments.length;++r){var i=arguments[r];e(i),i.length>0&&(void 0===t?t=i:t+=\"/\"+i)}return void 0===t?\".\":n.normalize(t)},relative:function(t,r){if(e(t),e(r),t===r)return\"\";if((t=n.resolve(t))===(r=n.resolve(r)))return\"\";for(var i=1;i<t.length&&47===t.charCodeAt(i);++i);for(var o=t.length,s=o-i,h=1;h<r.length&&47===r.charCodeAt(h);++h);for(var a=r.length-h,c=s<a?s:a,f=-1,u=0;u<=c;++u){if(u===c){if(a>c){if(47===r.charCodeAt(h+u))return r.slice(h+u+1);if(0===u)return r.slice(h+u)}else s>c&&(47===t.charCodeAt(i+u)?f=u:0===u&&(f=0));break}var l=t.charCodeAt(i+u);if(l!==r.charCodeAt(h+u))break;47===l&&(f=u)}var g=\"\";for(u=i+f+1;u<=o;++u)u!==o&&47!==t.charCodeAt(u)||(0===g.length?g+=\"..\":g+=\"/..\");return g.length>0?g+r.slice(h+f):(h+=f,47===r.charCodeAt(h)&&++h,r.slice(h))},_makeLong:function(t){return t},dirname:function(t){if(e(t),0===t.length)return\".\";for(var r=t.charCodeAt(0),n=47===r,i=-1,o=!0,s=t.length-1;s>=1;--s)if(47===(r=t.charCodeAt(s))){if(!o){i=s;break}}else o=!1;return-1===i?n?\"/\":\".\":n&&1===i?\"//\":t.slice(0,i)},basename:function(t,r){if(void 0!==r&&\"string\"!=typeof r)throw new TypeError('\"ext\" argument must be a string');e(t);var n,i=0,o=-1,s=!0;if(void 0!==r&&r.length>0&&r.length<=t.length){if(r.length===t.length&&r===t)return\"\";var h=r.length-1,a=-1;for(n=t.length-1;n>=0;--n){var c=t.charCodeAt(n);if(47===c){if(!s){i=n+1;break}}else-1===a&&(s=!1,a=n+1),h>=0&&(c===r.charCodeAt(h)?-1==--h&&(o=n):(h=-1,o=a))}return i===o?o=a:-1===o&&(o=t.length),t.slice(i,o)}for(n=t.length-1;n>=0;--n)if(47===t.charCodeAt(n)){if(!s){i=n+1;break}}else-1===o&&(s=!1,o=n+1);return-1===o?\"\":t.slice(i,o)},extname:function(t){e(t);for(var r=-1,n=0,i=-1,o=!0,s=0,h=t.length-1;h>=0;--h){var a=t.charCodeAt(h);if(47!==a)-1===i&&(o=!1,i=h+1),46===a?-1===r?r=h:1!==s&&(s=1):-1!==r&&(s=-1);else if(!o){n=h+1;break}}return-1===r||-1===i||0===s||1===s&&r===i-1&&r===n+1?\"\":t.slice(r,i)},format:function(t){if(null===t||\"object\"!=typeof t)throw new TypeError('The \"pathObject\" argument must be of type Object. Received type '+typeof t);return function(t,e){var r=e.dir||e.root,n=e.base||(e.name||\"\")+(e.ext||\"\");return r?r===e.root?r+n:r+\"/\"+n:n}(0,t)},parse:function(t){e(t);var r={root:\"\",dir:\"\",base:\"\",ext:\"\",name:\"\"};if(0===t.length)return r;var n,i=t.charCodeAt(0),o=47===i;o?(r.root=\"/\",n=1):n=0;for(var s=-1,h=0,a=-1,c=!0,f=t.length-1,u=0;f>=n;--f)if(47!==(i=t.charCodeAt(f)))-1===a&&(c=!1,a=f+1),46===i?-1===s?s=f:1!==u&&(u=1):-1!==s&&(u=-1);else if(!c){h=f+1;break}return-1===s||-1===a||0===u||1===u&&s===a-1&&s===h+1?-1!==a&&(r.base=r.name=0===h&&o?t.slice(1,a):t.slice(h,a)):(0===h&&o?(r.name=t.slice(1,s),r.base=t.slice(1,a)):(r.name=t.slice(h,s),r.base=t.slice(h,a)),r.ext=t.slice(s,a)),h>0?r.dir=t.slice(0,h-1):o&&(r.dir=\"/\"),r},sep:\"/\",delimiter:\":\",win32:null,posix:null};n.posix=n,t.exports=n}},e={};function r(n){var i=e[n];if(void 0!==i)return i.exports;var o=e[n]={exports:{}};return t[n](o,o.exports,r),o.exports}r.d=(t,e)=>{for(var n in e)r.o(e,n)&&!r.o(t,n)&&Object.defineProperty(t,n,{enumerable:!0,get:e[n]})},r.o=(t,e)=>Object.prototype.hasOwnProperty.call(t,e),r.r=t=>{\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(t,\"__esModule\",{value:!0})};var n={};let i;if(r.r(n),r.d(n,{URI:()=>l,Utils:()=>I}),\"object\"==typeof process)i=\"win32\"===process.platform;else if(\"object\"==typeof navigator){let t=navigator.userAgent;i=t.indexOf(\"Windows\")>=0}const o=/^\\w[\\w\\d+.-]*$/,s=/^\\//,h=/^\\/\\//;function a(t,e){if(!t.scheme&&e)throw new Error(`[UriError]: Scheme is missing: {scheme: \"\", authority: \"${t.authority}\", path: \"${t.path}\", query: \"${t.query}\", fragment: \"${t.fragment}\"}`);if(t.scheme&&!o.test(t.scheme))throw new Error(\"[UriError]: Scheme contains illegal characters.\");if(t.path)if(t.authority){if(!s.test(t.path))throw new Error('[UriError]: If a URI contains an authority component, then the path component must either be empty or begin with a slash (\"/\") character')}else if(h.test(t.path))throw new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters (\"//\")')}const c=\"\",f=\"/\",u=/^(([^:/?#]+?):)?(\\/\\/([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?/;class l{static isUri(t){return t instanceof l||!!t&&\"string\"==typeof t.authority&&\"string\"==typeof t.fragment&&\"string\"==typeof t.path&&\"string\"==typeof t.query&&\"string\"==typeof t.scheme&&\"string\"==typeof t.fsPath&&\"function\"==typeof t.with&&\"function\"==typeof t.toString}scheme;authority;path;query;fragment;constructor(t,e,r,n,i,o=!1){\"object\"==typeof t?(this.scheme=t.scheme||c,this.authority=t.authority||c,this.path=t.path||c,this.query=t.query||c,this.fragment=t.fragment||c):(this.scheme=function(t,e){return t||e?t:\"file\"}(t,o),this.authority=e||c,this.path=function(t,e){switch(t){case\"https\":case\"http\":case\"file\":e?e[0]!==f&&(e=f+e):e=f}return e}(this.scheme,r||c),this.query=n||c,this.fragment=i||c,a(this,o))}get fsPath(){return v(this,!1)}with(t){if(!t)return this;let{scheme:e,authority:r,path:n,query:i,fragment:o}=t;return void 0===e?e=this.scheme:null===e&&(e=c),void 0===r?r=this.authority:null===r&&(r=c),void 0===n?n=this.path:null===n&&(n=c),void 0===i?i=this.query:null===i&&(i=c),void 0===o?o=this.fragment:null===o&&(o=c),e===this.scheme&&r===this.authority&&n===this.path&&i===this.query&&o===this.fragment?this:new d(e,r,n,i,o)}static parse(t,e=!1){const r=u.exec(t);return r?new d(r[2]||c,w(r[4]||c),w(r[5]||c),w(r[7]||c),w(r[9]||c),e):new d(c,c,c,c,c)}static file(t){let e=c;if(i&&(t=t.replace(/\\\\/g,f)),t[0]===f&&t[1]===f){const r=t.indexOf(f,2);-1===r?(e=t.substring(2),t=f):(e=t.substring(2,r),t=t.substring(r)||f)}return new d(\"file\",e,t,c,c)}static from(t){const e=new d(t.scheme,t.authority,t.path,t.query,t.fragment);return a(e,!0),e}toString(t=!1){return b(this,t)}toJSON(){return this}static revive(t){if(t){if(t instanceof l)return t;{const e=new d(t);return e._formatted=t.external,e._fsPath=t._sep===g?t.fsPath:null,e}}return t}}const g=i?1:void 0;class d extends l{_formatted=null;_fsPath=null;get fsPath(){return this._fsPath||(this._fsPath=v(this,!1)),this._fsPath}toString(t=!1){return t?b(this,!0):(this._formatted||(this._formatted=b(this,!1)),this._formatted)}toJSON(){const t={$mid:1};return this._fsPath&&(t.fsPath=this._fsPath,t._sep=g),this._formatted&&(t.external=this._formatted),this.path&&(t.path=this.path),this.scheme&&(t.scheme=this.scheme),this.authority&&(t.authority=this.authority),this.query&&(t.query=this.query),this.fragment&&(t.fragment=this.fragment),t}}const p={58:\"%3A\",47:\"%2F\",63:\"%3F\",35:\"%23\",91:\"%5B\",93:\"%5D\",64:\"%40\",33:\"%21\",36:\"%24\",38:\"%26\",39:\"%27\",40:\"%28\",41:\"%29\",42:\"%2A\",43:\"%2B\",44:\"%2C\",59:\"%3B\",61:\"%3D\",32:\"%20\"};function m(t,e,r){let n,i=-1;for(let o=0;o<t.length;o++){const s=t.charCodeAt(o);if(s>=97&&s<=122||s>=65&&s<=90||s>=48&&s<=57||45===s||46===s||95===s||126===s||e&&47===s||r&&91===s||r&&93===s||r&&58===s)-1!==i&&(n+=encodeURIComponent(t.substring(i,o)),i=-1),void 0!==n&&(n+=t.charAt(o));else{void 0===n&&(n=t.substr(0,o));const e=p[s];void 0!==e?(-1!==i&&(n+=encodeURIComponent(t.substring(i,o)),i=-1),n+=e):-1===i&&(i=o)}}return-1!==i&&(n+=encodeURIComponent(t.substring(i))),void 0!==n?n:t}function y(t){let e;for(let r=0;r<t.length;r++){const n=t.charCodeAt(r);35===n||63===n?(void 0===e&&(e=t.substr(0,r)),e+=p[n]):void 0!==e&&(e+=t[r])}return void 0!==e?e:t}function v(t,e){let r;return r=t.authority&&t.path.length>1&&\"file\"===t.scheme?`//${t.authority}${t.path}`:47===t.path.charCodeAt(0)&&(t.path.charCodeAt(1)>=65&&t.path.charCodeAt(1)<=90||t.path.charCodeAt(1)>=97&&t.path.charCodeAt(1)<=122)&&58===t.path.charCodeAt(2)?e?t.path.substr(1):t.path[1].toLowerCase()+t.path.substr(2):t.path,i&&(r=r.replace(/\\//g,\"\\\\\")),r}function b(t,e){const r=e?y:m;let n=\"\",{scheme:i,authority:o,path:s,query:h,fragment:a}=t;if(i&&(n+=i,n+=\":\"),(o||\"file\"===i)&&(n+=f,n+=f),o){let t=o.indexOf(\"@\");if(-1!==t){const e=o.substr(0,t);o=o.substr(t+1),t=e.lastIndexOf(\":\"),-1===t?n+=r(e,!1,!1):(n+=r(e.substr(0,t),!1,!1),n+=\":\",n+=r(e.substr(t+1),!1,!0)),n+=\"@\"}o=o.toLowerCase(),t=o.lastIndexOf(\":\"),-1===t?n+=r(o,!1,!0):(n+=r(o.substr(0,t),!1,!0),n+=o.substr(t))}if(s){if(s.length>=3&&47===s.charCodeAt(0)&&58===s.charCodeAt(2)){const t=s.charCodeAt(1);t>=65&&t<=90&&(s=`/${String.fromCharCode(t+32)}:${s.substr(3)}`)}else if(s.length>=2&&58===s.charCodeAt(1)){const t=s.charCodeAt(0);t>=65&&t<=90&&(s=`${String.fromCharCode(t+32)}:${s.substr(2)}`)}n+=r(s,!0,!1)}return h&&(n+=\"?\",n+=r(h,!1,!1)),a&&(n+=\"#\",n+=e?a:m(a,!1,!1)),n}function C(t){try{return decodeURIComponent(t)}catch{return t.length>3?t.substr(0,3)+C(t.substr(3)):t}}const A=/(%[0-9A-Za-z][0-9A-Za-z])+/g;function w(t){return t.match(A)?t.replace(A,(t=>C(t))):t}var x=r(975);const P=x.posix||x,_=\"/\";var I;!function(t){t.joinPath=function(t,...e){return t.with({path:P.join(t.path,...e)})},t.resolvePath=function(t,...e){let r=t.path,n=!1;r[0]!==_&&(r=_+r,n=!0);let i=P.resolve(r,...e);return n&&i[0]===_&&!t.authority&&(i=i.substring(1)),t.with({path:i})},t.dirname=function(t){if(0===t.path.length||t.path===_)return t;let e=P.dirname(t.path);return 1===e.length&&46===e.charCodeAt(0)&&(e=\"\"),t.with({path:e})},t.basename=function(t){return P.basename(t.path)},t.extname=function(t){return P.extname(t.path)}}(I||(I={})),LIB=n})();export const{URI,Utils}=LIB;\n//# sourceMappingURL=index.mjs.map","/******************************************************************************\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 ******************************************************************************/\nimport { URI, Utils } from 'vscode-uri';\nexport { URI };\nexport var UriUtils;\n(function (UriUtils) {\n    UriUtils.basename = Utils.basename;\n    UriUtils.dirname = Utils.dirname;\n    UriUtils.extname = Utils.extname;\n    UriUtils.joinPath = Utils.joinPath;\n    UriUtils.resolvePath = Utils.resolvePath;\n    const isWindows = typeof process === 'object' && process?.platform === 'win32';\n    function equals(a, b) {\n        return a?.toString() === b?.toString();\n    }\n    UriUtils.equals = equals;\n    function relative(from, to) {\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        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        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    UriUtils.relative = relative;\n    function normalize(uri) {\n        return URI.parse(uri.toString()).toString();\n    }\n    UriUtils.normalize = normalize;\n    function contains(parent, child) {\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    UriUtils.contains = contains;\n})(UriUtils || (UriUtils = {}));\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 {\n    constructor() {\n        this.root = { name: '', children: new Map() };\n    }\n    normalizeUri(uri) {\n        return UriUtils.normalize(uri);\n    }\n    clear() {\n        this.root.children.clear();\n    }\n    insert(uri, element) {\n        const node = this.getNode(this.normalizeUri(uri), true);\n        node.element = element;\n    }\n    delete(uri) {\n        const nodeToDelete = this.getNode(this.normalizeUri(uri), false);\n        if (nodeToDelete?.parent) {\n            nodeToDelete.parent.children.delete(nodeToDelete.name);\n        }\n    }\n    has(uri) {\n        return this.getNode(this.normalizeUri(uri), false)?.element !== undefined;\n    }\n    hasNode(uri) {\n        return this.getNode(this.normalizeUri(uri), false) !== undefined;\n    }\n    find(uri) {\n        return this.getNode(this.normalizeUri(uri), false)?.element;\n    }\n    findNode(uri) {\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    findChildren(uri) {\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    all() {\n        return this.collectValues(this.root);\n    }\n    findAll(prefix) {\n        const node = this.getNode(UriUtils.normalize(prefix), false);\n        if (!node) {\n            return [];\n        }\n        return this.collectValues(node);\n    }\n    getNode(uri, create) {\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                }\n                else {\n                    return undefined;\n                }\n            }\n            current = child;\n        }\n        return current;\n    }\n    collectValues(node) {\n        const result = [];\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//# sourceMappingURL=uri-utils.js.map","/******************************************************************************\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 * 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';\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';\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 var DocumentState;\n(function (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    DocumentState[DocumentState[\"Changed\"] = 0] = \"Changed\";\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    DocumentState[DocumentState[\"Parsed\"] = 1] = \"Parsed\";\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    DocumentState[DocumentState[\"IndexedContent\"] = 2] = \"IndexedContent\";\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    DocumentState[DocumentState[\"ComputedScopes\"] = 3] = \"ComputedScopes\";\n    /**\n     * The `Linker` service has processed this document. All outgoing references have been\n     * resolved or marked as erroneous.\n     */\n    DocumentState[DocumentState[\"Linked\"] = 4] = \"Linked\";\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    DocumentState[DocumentState[\"IndexedReferences\"] = 5] = \"IndexedReferences\";\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    DocumentState[DocumentState[\"Validated\"] = 6] = \"Validated\";\n})(DocumentState || (DocumentState = {}));\nexport class DefaultLangiumDocumentFactory {\n    constructor(services) {\n        this.serviceRegistry = services.ServiceRegistry;\n        this.textDocuments = services.workspace.TextDocuments;\n        this.fileSystemProvider = services.workspace.FileSystemProvider;\n    }\n    async fromUri(uri, cancellationToken = CancellationToken.None) {\n        const content = await this.fileSystemProvider.readFile(uri);\n        return this.createAsync(uri, content, cancellationToken);\n    }\n    fromTextDocument(textDocument, uri, token) {\n        uri = uri ?? URI.parse(textDocument.uri);\n        if (CancellationToken.is(token)) {\n            return this.createAsync(uri, textDocument, token);\n        }\n        else {\n            return this.create(uri, textDocument, token);\n        }\n    }\n    fromString(text, uri, token) {\n        if (CancellationToken.is(token)) {\n            return this.createAsync(uri, text, token);\n        }\n        else {\n            return this.create(uri, text, token);\n        }\n    }\n    fromModel(model, uri) {\n        return this.create(uri, { $model: model });\n    }\n    create(uri, content, options) {\n        if (typeof content === 'string') {\n            const parseResult = this.parse(uri, content, options);\n            return this.createLangiumDocument(parseResult, uri, undefined, content);\n        }\n        else if ('$model' in content) {\n            const parseResult = { value: content.$model, parserErrors: [], lexerErrors: [] };\n            return this.createLangiumDocument(parseResult, uri);\n        }\n        else {\n            const parseResult = this.parse(uri, content.getText(), options);\n            return this.createLangiumDocument(parseResult, uri, content);\n        }\n    }\n    async createAsync(uri, content, cancelToken) {\n        if (typeof content === 'string') {\n            const parseResult = await this.parseAsync(uri, content, cancelToken);\n            return this.createLangiumDocument(parseResult, uri, undefined, content);\n        }\n        else {\n            const parseResult = await this.parseAsync(uri, content.getText(), cancelToken);\n            return this.createLangiumDocument(parseResult, uri, content);\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    createLangiumDocument(parseResult, uri, textDocument, text) {\n        let document;\n        if (textDocument) {\n            document = {\n                parseResult,\n                uri,\n                state: DocumentState.Parsed,\n                references: [],\n                textDocument\n            };\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.$document = document;\n        return document;\n    }\n    async update(document, cancellationToken) {\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        if (textDocument) {\n            Object.defineProperty(document, 'textDocument', {\n                value: textDocument\n            });\n        }\n        else {\n            const textDocumentGetter = this.createTextDocumentGetter(document.uri, text);\n            Object.defineProperty(document, 'textDocument', {\n                get: textDocumentGetter\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.$document = document;\n        }\n        document.state = DocumentState.Parsed;\n        return document;\n    }\n    parse(uri, text, options) {\n        const services = this.serviceRegistry.getServices(uri);\n        return services.parser.LangiumParser.parse(text, options);\n    }\n    parseAsync(uri, text, cancellationToken) {\n        const services = this.serviceRegistry.getServices(uri);\n        return services.parser.AsyncParser.parse(text, cancellationToken);\n    }\n    createTextDocumentGetter(uri, text) {\n        const serviceRegistry = this.serviceRegistry;\n        let textDoc = undefined;\n        return () => {\n            return textDoc ?? (textDoc = TextDocument.create(uri.toString(), serviceRegistry.getServices(uri).LanguageMetaData.languageId, 0, text ?? ''));\n        };\n    }\n}\nexport class DefaultLangiumDocuments {\n    constructor(services) {\n        this.documentTrie = new UriTrie();\n        this.services = services;\n        this.langiumDocumentFactory = services.workspace.LangiumDocumentFactory;\n        this.documentBuilder = () => services.workspace.DocumentBuilder;\n    }\n    get all() {\n        return stream(this.documentTrie.all());\n    }\n    addDocument(document) {\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    getDocument(uri) {\n        const uriString = uri.toString();\n        return this.documentTrie.find(uriString);\n    }\n    getDocuments(folder) {\n        const uriString = folder.toString();\n        return this.documentTrie.findAll(uriString);\n    }\n    async getOrCreateDocument(uri, cancellationToken) {\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    createDocument(uri, text, cancellationToken) {\n        if (cancellationToken) {\n            return this.langiumDocumentFactory.fromString(text, uri, cancellationToken).then(document => {\n                this.addDocument(document);\n                return document;\n            });\n        }\n        else {\n            const document = this.langiumDocumentFactory.fromString(text, uri);\n            this.addDocument(document);\n            return document;\n        }\n    }\n    hasDocument(uri) {\n        return this.documentTrie.has(uri.toString());\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) {\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    deleteDocument(uri) {\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    deleteDocuments(folder) {\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//# sourceMappingURL=documents.js.map","/******************************************************************************\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 ******************************************************************************/\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';\nexport const RefResolving = Symbol('RefResolving');\nexport class DefaultLinker {\n    constructor(services) {\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    }\n    async link(document, cancelToken = CancellationToken.None) {\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                        }\n                        finally {\n                            task.stopSubTask(name);\n                        }\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    doLink(refInfo, document) {\n        const ref = refInfo.reference;\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                }\n                else {\n                    ref._nodeDescription = description;\n                    const linkedNode = this.loadAstNode(description);\n                    ref._ref = linkedNode ?? this.createLinkingError(refInfo, description);\n                }\n            }\n            catch (err) {\n                console.error(`An error occurred while resolving reference to '${ref.$refText}':`, err);\n                const errorMessage = err.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        }\n        else if ('_items' in ref && ref._items === undefined) {\n            ref._items = RefResolving;\n            try {\n                const descriptions = this.getCandidates(refInfo);\n                const items = [];\n                if (isLinkingError(descriptions)) {\n                    ref._linkingError = descriptions;\n                }\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            }\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    unlink(document) {\n        for (const ref of document.references) {\n            if ('_ref' in ref) {\n                ref._ref = undefined;\n                delete ref._nodeDescription;\n            }\n            else if ('_items' in ref) {\n                ref._items = undefined;\n                delete ref._linkingError;\n            }\n        }\n        document.references = [];\n    }\n    getCandidate(refInfo) {\n        const scope = this.scopeProvider.getScope(refInfo);\n        const description = scope.getElement(refInfo.reference.$refText);\n        return description ?? this.createLinkingError(refInfo);\n    }\n    getCandidates(refInfo) {\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    buildReference(node, property, refNode, refText) {\n        // See behavior description in doc of Linker, update that on changes in here.\n        // eslint-disable-next-line @typescript-eslint/no-this-alias\n        const linker = this;\n        const reference = {\n            $refNode: refNode,\n            $refText: refText,\n            _ref: undefined,\n            get ref() {\n                if (isAstNode(this._ref)) {\n                    // Most frequent case: the target is already resolved.\n                    return this._ref;\n                }\n                else if (isAstNodeDescription(this._nodeDescription)) {\n                    // A candidate has been found before, but it is not loaded yet.\n                    const linkedNode = linker.loadAstNode(this._nodeDescription);\n                    this._ref = linkedNode ??\n                        linker.createLinkingError({ reference, container: node, property }, this._nodeDescription);\n                }\n                else if (this._ref === undefined) {\n                    // The reference has not been linked yet, so do that now.\n                    this._ref = RefResolving;\n                    const document = findRootNode(node).$document;\n                    const refData = linker.getLinkedNode({ reference, container: node, property });\n                    if (refData.error && document && document.state < DocumentState.ComputedScopes) {\n                        // Document scope is not ready, don't set `this._ref` so linker can retry later.\n                        return this._ref = undefined;\n                    }\n                    this._ref = refData.node ?? refData.error;\n                    this._nodeDescription = refData.descr;\n                    document?.references.push(this);\n                }\n                else if (this._ref === RefResolving) {\n                    linker.throwCyclicReferenceError(node, property, refText);\n                }\n                return isAstNode(this._ref) ? this._ref : undefined;\n            },\n            get $nodeDescription() {\n                return this._nodeDescription;\n            },\n            get error() {\n                return isLinkingError(this._ref) ? this._ref : undefined;\n            }\n        };\n        return reference;\n    }\n    buildMultiReference(node, property, refNode, refText) {\n        // See behavior description in doc of Linker, update that on changes in here.\n        // eslint-disable-next-line @typescript-eslint/no-this-alias\n        const linker = this;\n        const reference = {\n            $refNode: refNode,\n            $refText: refText,\n            _items: undefined,\n            get items() {\n                if (Array.isArray(this._items)) {\n                    return this._items;\n                }\n                else if (this._items === undefined) {\n                    this._items = RefResolving;\n                    const document = findRootNode(node).$document;\n                    const descriptions = linker.getCandidates({\n                        reference,\n                        container: node,\n                        property\n                    });\n                    const items = [];\n                    if (isLinkingError(descriptions)) {\n                        this._linkingError = descriptions;\n                    }\n                    else {\n                        for (const description of descriptions) {\n                            const linkedNode = linker.loadAstNode(description);\n                            if (linkedNode) {\n                                items.push({ ref: linkedNode, $nodeDescription: description });\n                            }\n                        }\n                    }\n                    this._items = items;\n                    document?.references.push(this);\n                }\n                else if (this._items === RefResolving) {\n                    linker.throwCyclicReferenceError(node, property, refText);\n                }\n                return Array.isArray(this._items) ? this._items : [];\n            },\n            get error() {\n                if (this._linkingError) {\n                    return this._linkingError;\n                }\n                const refs = this.items;\n                if (refs.length > 0) {\n                    return undefined;\n                }\n                else {\n                    return (this._linkingError = linker.createLinkingError({ reference, container: node, property }));\n                }\n            }\n        };\n        return reference;\n    }\n    throwCyclicReferenceError(node, property, refText) {\n        throw new Error(`Cyclic reference resolution detected: ${this.astNodeLocator.getAstNodePath(node)}/${property} (symbol '${refText}')`);\n    }\n    getLinkedNode(refInfo) {\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: this.createLinkingError(refInfo, description)\n                };\n            }\n        }\n        catch (err) {\n            console.error(`An error occurred while resolving reference to '${refInfo.reference.$refText}':`, err);\n            const errorMessage = err.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    loadAstNode(nodeDescription) {\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    createLinkingError(refInfo, targetDescription) {\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//# sourceMappingURL=linker.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { findNodeForProperty } from '../utils/grammar-utils.js';\nexport function isNamed(node) {\n    return typeof node.name === 'string';\n}\nexport class DefaultNameProvider {\n    getName(node) {\n        if (isNamed(node)) {\n            return node.name;\n        }\n        return undefined;\n    }\n    getNameNode(node) {\n        return findNodeForProperty(node.$cstNode, 'name');\n    }\n}\n//# sourceMappingURL=name-provider.js.map","/******************************************************************************\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 ******************************************************************************/\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';\nexport class DefaultReferences {\n    constructor(services) {\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    findDeclarations(sourceCstNode) {\n        if (sourceCstNode) {\n            const assignment = findAssignment(sourceCstNode);\n            const nodeElem = sourceCstNode.astNode;\n            if (assignment && nodeElem) {\n                const reference = nodeElem[assignment.feature];\n                if (isReference(reference) || isMultiReference(reference)) {\n                    return getReferenceNodes(reference);\n                }\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     * 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    getSelfNodes(node) {\n        if (!this.hasMultiReference) {\n            return [node];\n        }\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    getNodeFromReferenceDescription(ref) {\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    findDeclarationNodes(sourceCstNode) {\n        const astNodes = this.findDeclarations(sourceCstNode);\n        const cstNodes = [];\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    findReferences(targetNode, options) {\n        const refs = [];\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    getSelfReferences(targetNode) {\n        const selfNodes = this.getSelfNodes(targetNode);\n        const references = [];\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//# sourceMappingURL=references.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { EMPTY_STREAM, Reduction, stream } from './stream.js';\n/**\n * A multimap is a variation of a Map that has potentially multiple values for every key.\n */\nexport class MultiMap {\n    constructor(elements) {\n        this.map = new Map();\n        if (elements) {\n            for (const [key, value] of elements) {\n                this.add(key, value);\n            }\n        }\n    }\n    /**\n     * The total number of values in the multimap.\n     */\n    get size() {\n        return Reduction.sum(stream(this.map.values()).map(a => a.length));\n    }\n    /**\n     * Clear all entries in the multimap.\n     */\n    clear() {\n        this.map.clear();\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, value) {\n        if (value === undefined) {\n            return this.map.delete(key);\n        }\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                    }\n                    else {\n                        values.splice(index, 1);\n                    }\n                    return true;\n                }\n            }\n            return false;\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) {\n        return this.map.get(key) ?? [];\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) {\n        const values = this.map.get(key);\n        return values ? stream(values) : EMPTY_STREAM;\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, value) {\n        if (value === undefined) {\n            return this.map.has(key);\n        }\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     * Add the given key / value pair to the multimap.\n     */\n    add(key, value) {\n        if (this.map.has(key)) {\n            this.map.get(key).push(value);\n        }\n        else {\n            this.map.set(key, [value]);\n        }\n        return this;\n    }\n    /**\n     * Add the given set of key / value pairs to the multimap.\n     */\n    addAll(key, values) {\n        if (this.map.has(key)) {\n            this.map.get(key).push(...values);\n        }\n        else {\n            this.map.set(key, Array.from(values));\n        }\n        return this;\n    }\n    /**\n     * Invokes the given callback function for every key / value pair in the multimap.\n     */\n    forEach(callbackfn) {\n        this.map.forEach((array, key) => array.forEach(value => callbackfn(value, key, this)));\n    }\n    /**\n     * Returns an iterator of key, value pairs for every entry in the map.\n     */\n    [Symbol.iterator]() {\n        return this.entries().iterator();\n    }\n    /**\n     * Returns a stream of key, value pairs for every entry in the map.\n     */\n    entries() {\n        return stream(this.map.entries())\n            .flatMap(([key, array]) => array.map(value => [key, value]));\n    }\n    /**\n     * Returns a stream of keys in the map.\n     */\n    keys() {\n        return stream(this.map.keys());\n    }\n    /**\n     * Returns a stream of values in the map.\n     */\n    values() {\n        return stream(this.map.values()).flat();\n    }\n    /**\n     * Returns a stream of key, value set pairs for every key in the map.\n     */\n    entriesGroupedByKey() {\n        return stream(this.map.entries());\n    }\n}\nexport class BiMap {\n    get size() {\n        return this.map.size;\n    }\n    constructor(elements) {\n        this.map = new Map();\n        this.inverse = new Map();\n        if (elements) {\n            for (const [key, value] of elements) {\n                this.set(key, value);\n            }\n        }\n    }\n    clear() {\n        this.map.clear();\n        this.inverse.clear();\n    }\n    set(key, value) {\n        this.map.set(key, value);\n        this.inverse.set(value, key);\n        return this;\n    }\n    get(key) {\n        return this.map.get(key);\n    }\n    getKey(value) {\n        return this.inverse.get(value);\n    }\n    delete(key) {\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//# sourceMappingURL=collections.js.map","/******************************************************************************\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 ******************************************************************************/\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';\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 {\n    constructor(services) {\n        this.nameProvider = services.references.NameProvider;\n        this.descriptions = services.workspace.AstNodeDescriptionProvider;\n    }\n    async collectExportedSymbols(document, cancelToken = CancellationToken.None) {\n        return this.collectExportedSymbolsForNode(document.parseResult.value, document, undefined, cancelToken);\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, document, children = streamContents, cancelToken = CancellationToken.None) {\n        const exports = [];\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     * 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    addExportedSymbol(node, exports, document) {\n        const name = this.nameProvider.getName(node);\n        if (name) {\n            exports.push(this.descriptions.createDescription(node, name, document));\n        }\n    }\n    // --- local symbols gathering ---\n    async collectLocalSymbols(document, cancelToken = CancellationToken.None) {\n        const rootNode = document.parseResult.value;\n        const symbols = new MultiMap();\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     * 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    addLocalSymbol(node, document, symbols) {\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//# sourceMappingURL=scope-computation.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { MultiMap } from '../utils/collections.js';\nimport { EMPTY_STREAM, stream } from '../utils/stream.js';\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 {\n    constructor(elements, outerScope, options) {\n        this.elements = elements;\n        this.outerScope = outerScope;\n        this.caseInsensitive = options?.caseInsensitive ?? false;\n        this.concatOuterScope = options?.concatOuterScope ?? true;\n    }\n    getAllElements() {\n        if (this.outerScope) {\n            return this.elements.concat(this.outerScope.getAllElements());\n        }\n        else {\n            return this.elements;\n        }\n    }\n    getElement(name) {\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    getElements(name) {\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        }\n        else {\n            return local;\n        }\n    }\n}\nexport class MapScope {\n    constructor(elements, outerScope, options) {\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    getElement(name) {\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    getElements(name) {\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        }\n        else {\n            return stream(arr);\n        }\n    }\n    getAllElements() {\n        let elementStream = stream(this.elements.values());\n        if (this.outerScope) {\n            elementStream = elementStream.concat(this.outerScope.getAllElements());\n        }\n        return elementStream;\n    }\n}\nexport class MultiMapScope {\n    constructor(elements, outerScope, options) {\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    getElement(name) {\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    getElements(name) {\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        }\n        else {\n            return stream(local);\n        }\n    }\n    getAllElements() {\n        let elementStream = stream(this.elements.values());\n        if (this.outerScope) {\n            elementStream = elementStream.concat(this.outerScope.getAllElements());\n        }\n        return elementStream;\n    }\n}\nexport const EMPTY_SCOPE = {\n    getElement() {\n        return undefined;\n    },\n    getElements() {\n        return EMPTY_STREAM;\n    },\n    getAllElements() {\n        return EMPTY_STREAM;\n    }\n};\n//# sourceMappingURL=scope.js.map","/******************************************************************************\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 ******************************************************************************/\nexport class DisposableCache {\n    constructor() {\n        this.toDispose = [];\n        this.isDisposed = false;\n    }\n    onDispose(disposable) {\n        this.toDispose.push(disposable);\n    }\n    dispose() {\n        this.throwIfDisposed();\n        this.clear();\n        this.isDisposed = true;\n        this.toDispose.forEach(disposable => disposable.dispose());\n    }\n    throwIfDisposed() {\n        if (this.isDisposed) {\n            throw new Error('This cache has already been disposed');\n        }\n    }\n}\nexport class SimpleCache extends DisposableCache {\n    constructor() {\n        super(...arguments);\n        this.cache = new Map();\n    }\n    has(key) {\n        this.throwIfDisposed();\n        return this.cache.has(key);\n    }\n    set(key, value) {\n        this.throwIfDisposed();\n        this.cache.set(key, value);\n    }\n    get(key, provider) {\n        this.throwIfDisposed();\n        if (this.cache.has(key)) {\n            return this.cache.get(key);\n        }\n        else if (provider) {\n            const value = provider();\n            this.cache.set(key, value);\n            return value;\n        }\n        else {\n            return undefined;\n        }\n    }\n    delete(key) {\n        this.throwIfDisposed();\n        return this.cache.delete(key);\n    }\n    clear() {\n        this.throwIfDisposed();\n        this.cache.clear();\n    }\n}\nexport class ContextCache extends DisposableCache {\n    constructor(converter) {\n        super();\n        this.cache = new Map();\n        this.converter = converter ?? (value => value);\n    }\n    has(contextKey, key) {\n        this.throwIfDisposed();\n        return this.cacheForContext(contextKey).has(key);\n    }\n    set(contextKey, key, value) {\n        this.throwIfDisposed();\n        this.cacheForContext(contextKey).set(key, value);\n    }\n    get(contextKey, key, provider) {\n        this.throwIfDisposed();\n        const contextCache = this.cacheForContext(contextKey);\n        if (contextCache.has(key)) {\n            return contextCache.get(key);\n        }\n        else if (provider) {\n            const value = provider();\n            contextCache.set(key, value);\n            return value;\n        }\n        else {\n            return undefined;\n        }\n    }\n    delete(contextKey, key) {\n        this.throwIfDisposed();\n        return this.cacheForContext(contextKey).delete(key);\n    }\n    clear(contextKey) {\n        this.throwIfDisposed();\n        if (contextKey) {\n            const mapKey = this.converter(contextKey);\n            this.cache.delete(mapKey);\n        }\n        else {\n            this.cache.clear();\n        }\n    }\n    cacheForContext(contextKey) {\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 * 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 extends ContextCache {\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, state) {\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        }\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 * 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 extends SimpleCache {\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, state) {\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        }\n        else {\n            this.toDispose.push(sharedServices.workspace.DocumentBuilder.onUpdate(() => {\n                this.clear();\n            }));\n        }\n    }\n}\n//# sourceMappingURL=caching.js.map","/******************************************************************************\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 ******************************************************************************/\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';\nexport class DefaultScopeProvider {\n    constructor(services) {\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(services.shared);\n    }\n    getScope(context) {\n        const scopes = [];\n        const referenceType = this.reflection.getReferenceType(context);\n        const localSymbols = getDocument(context.container).localSymbols;\n        if (localSymbols) {\n            let currentNode = context.container;\n            do {\n                if (localSymbols.has(currentNode)) {\n                    scopes.push(localSymbols.getStream(currentNode).filter(desc => this.reflection.isSubtype(desc.type, referenceType)));\n                }\n                currentNode = currentNode.$container;\n            } while (currentNode);\n        }\n        let result = 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     * Create a scope for the given collection of AST node descriptions.\n     */\n    createScope(elements, outerScope, options) {\n        return new StreamScope(stream(elements), outerScope, options);\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    createScopeForNodes(elements, outerScope, options) {\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     * Create a global scope filtered for the given reference type.\n     */\n    getGlobalScope(referenceType, _context) {\n        return this.globalScopeCache.get(referenceType, () => new MultiMapScope(this.indexManager.allElements(referenceType)));\n    }\n}\n//# sourceMappingURL=scope-provider.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { URI } from 'vscode-uri';\nimport { isAstNode, isMultiReference, isReference } from '../syntax-tree.js';\nimport { getDocument } from '../utils/ast-utils.js';\nimport { findNodesForProperty } from '../utils/grammar-utils.js';\nexport function isAstNodeWithComment(node) {\n    return typeof node.$comment === 'string';\n}\nfunction isIntermediateReference(obj) {\n    return typeof obj === 'object' && !!obj && ('$ref' in obj || '$error' in obj);\n}\nexport class DefaultJsonSerializer {\n    constructor(services) {\n        /** The set of AstNode properties to be ignored by the serializer. */\n        this.ignoreProperties = new Set(['$container', '$containerProperty', '$containerIndex', '$document', '$cstNode']);\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    serialize(node, options) {\n        const serializeOptions = options ?? {};\n        const specificReplacer = options?.replacer;\n        const defaultReplacer = (key, value) => this.replacer(key, value, serializeOptions);\n        const replacer = specificReplacer ? (key, value) => specificReplacer(key, value, defaultReplacer) : defaultReplacer;\n        try {\n            this.currentDocument = getDocument(node);\n            return JSON.stringify(node, replacer, options?.space);\n        }\n        finally {\n            this.currentDocument = undefined;\n        }\n    }\n    deserialize(content, options) {\n        const deserializeOptions = options ?? {};\n        const root = JSON.parse(content);\n        this.linkNode(root, root, deserializeOptions);\n        return root;\n    }\n    replacer(key, value, { refText, sourceText, textRegions, comments, uriConverter }) {\n        if (this.ignoreProperties.has(key)) {\n            return undefined;\n        }\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                    }\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                };\n            }\n            else {\n                return {\n                    $error: value.error?.message ?? 'Could not resolve reference',\n                    $refText\n                };\n            }\n        }\n        else if (isMultiReference(value)) {\n            const $refText = refText ? value.$refText : undefined;\n            const $refs = [];\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                    }\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            };\n        }\n        else if (isAstNode(value)) {\n            let astNode = 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 ?? (astNode = { ...value });\n                astNode.$sourceText = value.$cstNode?.text;\n            }\n            if (comments) {\n                astNode ?? (astNode = { ...value });\n                const comment = this.commentProvider.getComment(value);\n                if (comment) {\n                    astNode.$comment = comment.replace(/\\r/g, '');\n                }\n            }\n            return astNode ?? value;\n        }\n        else {\n            return value;\n        }\n    }\n    addAstNodeRegionWithAssignmentsTo(node) {\n        const createDocumentSegment = cstNode => ({\n            offset: cstNode.offset,\n            end: cstNode.end,\n            length: cstNode.length,\n            range: cstNode.range,\n        });\n        if (node.$cstNode) {\n            const textRegion = node.$textRegion = createDocumentSegment(node.$cstNode);\n            const assignments = textRegion.assignments = {};\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            return node;\n        }\n        return undefined;\n    }\n    linkNode(node, root, options, container, containerProperty, containerIndex) {\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                    }\n                    else if (isAstNode(element)) {\n                        this.linkNode(element, root, options, node, propertyName, index);\n                    }\n                }\n            }\n            else if (isIntermediateReference(item)) {\n                node[propertyName] = this.reviveReference(node, propertyName, root, item, options);\n            }\n            else if (isAstNode(item)) {\n                this.linkNode(item, root, options, node, propertyName);\n            }\n        }\n        const mutable = node;\n        mutable.$container = container;\n        mutable.$containerProperty = containerProperty;\n        mutable.$containerIndex = containerIndex;\n    }\n    reviveReference(container, property, root, reference, options) {\n        let refText = reference.$refText;\n        let error = reference.$error;\n        let ref;\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            }\n            else {\n                error = refNode;\n            }\n        }\n        else if (reference.$refs) {\n            const refs = [];\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 ?? (error = 'Could not resolve multi-reference');\n            }\n            else {\n                return {\n                    $refText: refText ?? '',\n                    items: refs\n                };\n            }\n        }\n        if (error) {\n            ref ?? (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        }\n        else {\n            return undefined;\n        }\n    }\n    getRefNode(root, uri, uriConverter) {\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        }\n        catch (err) {\n            return String(err);\n        }\n    }\n}\n//# sourceMappingURL=json-serializer.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { UriUtils } from './utils/uri-utils.js';\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 {\n    /**\n     * @deprecated Since 3.1.0. Use the new `fileExtensionMap` (or `languageIdMap`) property instead.\n     */\n    get map() {\n        return this.fileExtensionMap;\n    }\n    constructor(services) {\n        this.languageIdMap = new Map();\n        this.fileExtensionMap = new Map();\n        this.fileNameMap = new Map();\n        this.textDocuments = services?.workspace.TextDocuments;\n    }\n    register(language) {\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    getServices(uri) {\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        if (!services) {\n            if (languageId) {\n                throw new Error(`The service registry contains no services for the extension '${ext}' for language '${languageId}'.`);\n            }\n            else {\n                throw new Error(`The service registry contains no services for the extension '${ext}'.`);\n            }\n        }\n        return services;\n    }\n    hasServices(uri) {\n        try {\n            this.getServices(uri);\n            return true;\n        }\n        catch {\n            return false;\n        }\n    }\n    get all() {\n        return Array.from(this.languageIdMap.values());\n    }\n}\n//# sourceMappingURL=service-registry.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { assertUnreachable } from '../index.js';\nimport { MultiMap } from '../utils/collections.js';\nimport { isOperationCancelled } from '../utils/promise-utils.js';\nimport { stream } from '../utils/stream.js';\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) {\n    return { code };\n}\nexport var ValidationCategory;\n(function (ValidationCategory) {\n    ValidationCategory.defaults = ['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    ValidationCategory.all = ValidationCategory.defaults;\n})(ValidationCategory || (ValidationCategory = {}));\n/**\n * Manages a set of `ValidationCheck`s to be applied when documents are validated.\n */\nexport class ValidationRegistry {\n    constructor(services) {\n        this.entries = new MultiMap();\n        this.knownCategories = new Set(ValidationCategory.defaults);\n        this.entriesBefore = [];\n        this.entriesAfter = [];\n        this.reflection = services.shared.AstReflection;\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(checksRecord, thisObj = this, category = 'fast') {\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;\n            if (Array.isArray(callbacks)) {\n                for (const check of callbacks) {\n                    const entry = {\n                        check: this.wrapValidationException(check, thisObj),\n                        category\n                    };\n                    this.addEntry(type, entry);\n                }\n            }\n            else if (typeof callbacks === 'function') {\n                const entry = {\n                    check: this.wrapValidationException(callbacks, thisObj),\n                    category\n                };\n                this.addEntry(type, entry);\n            }\n            else {\n                assertUnreachable(callbacks);\n            }\n        }\n    }\n    wrapValidationException(check, thisObj) {\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    async handleException(functionality, messageContext, accept, node) {\n        try {\n            await functionality();\n        }\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    addEntry(type, entry) {\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    getChecks(type, categories) {\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     * 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, thisObj = this) {\n        this.entriesBefore.push(this.wrapPreparationException(checkBefore, 'An error occurred during set-up of the validation', thisObj));\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, thisObj = this) {\n        this.entriesAfter.push(this.wrapPreparationException(checkAfter, 'An error occurred during tear-down of the validation', thisObj));\n    }\n    wrapPreparationException(check, messageContext, thisObj) {\n        return async (rootNode, accept, categories, cancelToken) => {\n            await this.handleException(() => check.call(thisObj, rootNode, accept, categories, cancelToken), messageContext, accept, rootNode);\n        };\n    }\n    get checksBefore() {\n        return this.entriesBefore;\n    }\n    get checksAfter() {\n        return this.entriesAfter;\n    }\n    getAllValidationCategories(_document) {\n        return this.knownCategories;\n    }\n}\n//# sourceMappingURL=validation-registry.js.map","/******************************************************************************\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 ******************************************************************************/\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';\nexport const VALIDATE_EACH_NODE = Object.freeze({\n    validateNode: true,\n    validateChildren: true,\n});\nexport class DefaultDocumentValidator {\n    constructor(services) {\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    async validateDocument(document, options = {}, cancelToken = CancellationToken.None) {\n        const parseResult = document.parseResult;\n        const diagnostics = [];\n        await interruptAndCheck(cancelToken);\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            this.processParsingErrors(parseResult, diagnostics, options);\n            if (options.stopAfterParsingErrors && diagnostics.some(d => d.data?.code === DocumentValidator.ParsingError)) {\n                return diagnostics;\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        // Process custom validations\n        try {\n            diagnostics.push(...await this.validateAst(parseResult.value, options, cancelToken));\n        }\n        catch (err) {\n            if (isOperationCancelled(err)) {\n                throw err;\n            }\n            console.error('An error occurred during validation:', err);\n        }\n        await interruptAndCheck(cancelToken);\n        return diagnostics;\n    }\n    processLexingErrors(parseResult, diagnostics, _options) {\n        const lexerDiagnostics = [...parseResult.lexerErrors, ...parseResult.lexerReport?.diagnostics ?? []];\n        for (const lexerDiagnostic of lexerDiagnostics) {\n            const severity = lexerDiagnostic.severity ?? 'error';\n            const 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    processParsingErrors(parseResult, diagnostics, _options) {\n        for (const parserError of parseResult.parserErrors) {\n            let range = 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.previousToken;\n                    if (!isNaN(token.startOffset)) {\n                        const position = { line: token.endLine - 1, character: token.endColumn };\n                        range = { start: position, end: position };\n                    }\n                    else {\n                        // No valid prev token. Might be empty document or containing only hidden tokens.\n                        // Point to document start\n                        const position = { line: 0, character: 0 };\n                        range = { start: position, end: position };\n                    }\n                }\n            }\n            else {\n                range = tokenToRange(parserError.token);\n            }\n            if (range) {\n                const 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    processLinkingErrors(document, diagnostics, _options) {\n        for (const reference of document.references) {\n            const linkingError = reference.error;\n            if (linkingError) {\n                const info = {\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                    }\n                };\n                diagnostics.push(this.toDiagnostic('error', linkingError.message, info));\n            }\n        }\n    }\n    async validateAst(rootNode, options, cancelToken = CancellationToken.None) {\n        const validationItems = [];\n        const acceptor = (severity, message, info) => {\n            validationItems.push(this.toDiagnostic(severity, message, info));\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        return validationItems;\n    }\n    async validateAstBefore(rootNode, options, acceptor, cancelToken = CancellationToken.None) {\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    async validateAstNodes(rootNode, options, acceptor, cancelToken = CancellationToken.None) {\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                        }\n                        finally {\n                            task.stopSubTask(node.$type);\n                        }\n                    }\n                    if (!nodeOptions.validateChildren) {\n                        nodes.prune();\n                    }\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    validateSingleNodeOptions(_node, _options) {\n        return VALIDATE_EACH_NODE;\n    }\n    async validateAstAfter(rootNode, options, acceptor, cancelToken = CancellationToken.None) {\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    toDiagnostic(severity, message, info) {\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    getSource() {\n        return this.metadata.languageId;\n    }\n}\nexport function getDiagnosticRange(info) {\n    if (info.range) {\n        return info.range;\n    }\n    let cstNode;\n    if (typeof info.property === 'string') {\n        cstNode = findNodeForProperty(info.node.$cstNode, info.property, info.index);\n    }\n    else if (typeof info.keyword === 'string') {\n        cstNode = findNodeForKeyword(info.node.$cstNode, info.keyword, info.index);\n    }\n    cstNode ?? (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 * 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) {\n    switch (severity) {\n        case 'error':\n            return 1;\n        case 'warning':\n            return 2;\n        case 'info':\n            return 3;\n        case 'hint':\n            return 4;\n        default:\n            throw new Error('Invalid diagnostic severity: ' + severity);\n    }\n}\nexport function toDiagnosticData(severity) {\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}\nexport var DocumentValidator;\n(function (DocumentValidator) {\n    DocumentValidator.LexingError = 'lexing-error';\n    DocumentValidator.LexingWarning = 'lexing-warning';\n    DocumentValidator.LexingInfo = 'lexing-info';\n    DocumentValidator.LexingHint = 'lexing-hint';\n    DocumentValidator.ParsingError = 'parsing-error';\n    DocumentValidator.LinkingError = 'linking-error';\n})(DocumentValidator || (DocumentValidator = {}));\n//# sourceMappingURL=document-validator.js.map","/******************************************************************************\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 ******************************************************************************/\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';\nexport class DefaultAstNodeDescriptionProvider {\n    constructor(services) {\n        this.astNodeLocator = services.workspace.AstNodeLocator;\n        this.nameProvider = services.references.NameProvider;\n    }\n    createDescription(node, name, document) {\n        const doc = document ?? getDocument(node);\n        name ?? (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;\n        const nameSegmentGetter = () => nameNodeSegment ?? (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}\nexport class DefaultReferenceDescriptionProvider {\n    constructor(services) {\n        this.nodeLocator = services.workspace.AstNodeLocator;\n    }\n    async createDescriptions(document, cancelToken = CancellationToken.None) {\n        const descr = [];\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    createInfoDescriptions(refInfo) {\n        const reference = refInfo.reference;\n        if (reference.error || !reference.$refNode) {\n            return [];\n        }\n        let items = [];\n        if (isReference(reference) && reference.$nodeDescription) {\n            items = [reference.$nodeDescription];\n        }\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 = [];\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//# sourceMappingURL=ast-descriptions.js.map","/******************************************************************************\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 ******************************************************************************/\nexport class DefaultAstNodeLocator {\n    constructor() {\n        this.segmentSeparator = '/';\n        this.indexSeparator = '@';\n    }\n    getAstNodePath(node) {\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    getPathSegment({ $containerProperty, $containerIndex }) {\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    getAstNode(node, path) {\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[property];\n                return array?.[arrayIndex];\n            }\n            return previousValue[currentValue];\n        }, node);\n    }\n}\n//# sourceMappingURL=ast-node-locator.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { Emitter } from '../utils/event.js';\nimport { Deferred } from '../utils/promise-utils.js';\n/**\n * Base configuration provider for building up other configuration providers\n */\nexport class DefaultConfigurationProvider {\n    constructor(services) {\n        this._ready = new Deferred();\n        this.onConfigurationSectionUpdateEmitter = new Emitter();\n        this.settings = {};\n        this.workspaceConfig = false;\n        this.serviceRegistry = services.ServiceRegistry;\n    }\n    get ready() {\n        return this._ready.promise;\n    }\n    initialize(params) {\n        this.workspaceConfig = params.capabilities.workspace?.configuration ?? false;\n    }\n    async initialized(params) {\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                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            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 => ({\n                    // Fetch the configuration changes for all languages\n                    section: this.toSectionName(lang.LanguageMetaData.languageId)\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     *  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) {\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    updateSectionConfiguration(section, configuration) {\n        this.settings[section] = configuration;\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, configuration) {\n        await this.ready;\n        const sectionName = this.toSectionName(language);\n        if (this.settings[sectionName]) {\n            return this.settings[sectionName][configuration];\n        }\n    }\n    toSectionName(languageId) {\n        return `${languageId}`;\n    }\n    get onConfigurationSectionUpdate() {\n        return this.onConfigurationSectionUpdateEmitter.event;\n    }\n}\n//# sourceMappingURL=configuration.js.map","\"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.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 = 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    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    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 * The parameter structure is automatically inferred on the number of parameters\n * and the parameter type in case of a single param.\n */\nParameterStructures.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 */\nParameterStructures.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 */\nParameterStructures.byName = new ParameterStructures('byName');\n/**\n * An abstract implementation of a MessageType.\n */\nclass AbstractMessageSignature {\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    constructor(method) {\n        super(method, 0);\n    }\n}\nexports.RequestType0 = RequestType0;\nclass RequestType extends AbstractMessageSignature {\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    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    constructor(method) {\n        super(method, 2);\n    }\n}\nexports.RequestType2 = RequestType2;\nclass RequestType3 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 3);\n    }\n}\nexports.RequestType3 = RequestType3;\nclass RequestType4 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 4);\n    }\n}\nexports.RequestType4 = RequestType4;\nclass RequestType5 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 5);\n    }\n}\nexports.RequestType5 = RequestType5;\nclass RequestType6 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 6);\n    }\n}\nexports.RequestType6 = RequestType6;\nclass RequestType7 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 7);\n    }\n}\nexports.RequestType7 = RequestType7;\nclass RequestType8 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 8);\n    }\n}\nexports.RequestType8 = RequestType8;\nclass RequestType9 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 9);\n    }\n}\nexports.RequestType9 = RequestType9;\nclass NotificationType extends AbstractMessageSignature {\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    constructor(method) {\n        super(method, 0);\n    }\n}\nexports.NotificationType0 = NotificationType0;\nclass NotificationType1 extends AbstractMessageSignature {\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    constructor(method) {\n        super(method, 2);\n    }\n}\nexports.NotificationType2 = NotificationType2;\nclass NotificationType3 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 3);\n    }\n}\nexports.NotificationType3 = NotificationType3;\nclass NotificationType4 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 4);\n    }\n}\nexports.NotificationType4 = NotificationType4;\nclass NotificationType5 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 5);\n    }\n}\nexports.NotificationType5 = NotificationType5;\nclass NotificationType6 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 6);\n    }\n}\nexports.NotificationType6 = NotificationType6;\nclass NotificationType7 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 7);\n    }\n}\nexports.NotificationType7 = NotificationType7;\nclass NotificationType8 extends AbstractMessageSignature {\n    constructor(method) {\n        super(method, 8);\n    }\n}\nexports.NotificationType8 = NotificationType8;\nclass NotificationType9 extends AbstractMessageSignature {\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 *--------------------------------------------------------------------------------------------*/\nvar _a;\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    constructor() {\n        this[_a] = 'LinkedMap';\n        this._map = new Map();\n        this._head = undefined;\n        this._tail = undefined;\n        this._size = 0;\n        this._state = 0;\n    }\n    clear() {\n        this._map.clear();\n        this._head = undefined;\n        this._tail = undefined;\n        this._size = 0;\n        this._state++;\n    }\n    isEmpty() {\n        return !this._head && !this._tail;\n    }\n    get size() {\n        return this._size;\n    }\n    get first() {\n        return this._head?.value;\n    }\n    get last() {\n        return this._tail?.value;\n    }\n    has(key) {\n        return this._map.has(key);\n    }\n    get(key, touch = 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    [(_a = Symbol.toStringTag, Symbol.iterator)]() {\n        return this.entries();\n    }\n    trimOld(newSize) {\n        if (newSize >= this.size) {\n            return;\n        }\n        if (newSize === 0) {\n            this.clear();\n            return;\n        }\n        let current = this._head;\n        let currentSize = this.size;\n        while (current && currentSize > newSize) {\n            this._map.delete(current.key);\n            current = current.next;\n            currentSize--;\n        }\n        this._head = current;\n        this._size = currentSize;\n        if (current) {\n            current.previous = undefined;\n        }\n        this._state++;\n    }\n    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    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 });\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    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    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    constructor(buffer) {\n        this.token = new SharedArrayBufferCancellationToken(buffer);\n    }\n    cancel() {\n    }\n    dispose() {\n    }\n}\nclass SharedArrayReceiverStrategy {\n    constructor() {\n        this.kind = 'request';\n    }\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 * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Semaphore = void 0;\nconst ral_1 = require(\"./ral\");\nclass Semaphore {\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(`To 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 * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ReadableStreamMessageReader = exports.AbstractMessageReader = exports.MessageReader = void 0;\nconst ral_1 = require(\"./ral\");\nconst Is = require(\"./is\");\nconst events_1 = require(\"./events\");\nconst semaphore_1 = require(\"./semaphore\");\nvar MessageReader;\n(function (MessageReader) {\n    function is(value) {\n        let 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    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    }\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    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 * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.WriteableStreamMessageWriter = exports.AbstractMessageWriter = exports.MessageWriter = void 0;\nconst ral_1 = require(\"./ral\");\nconst Is = 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        let 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    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    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    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            column: 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        let 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 * ------------------------------------------------------------------------------------------ */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createMessageConnection = exports.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.Trace = exports.NullLogger = exports.ProgressType = exports.ProgressToken = void 0;\nconst ral_1 = require(\"./ral\");\nconst Is = 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    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 TraceValues;\n(function (TraceValues) {\n    /**\n     * Turn tracing off.\n     */\n    TraceValues.Off = 'off';\n    /**\n     * Trace messages only.\n     */\n    TraceValues.Messages = 'messages';\n    /**\n     * Compact message tracing.\n     */\n    TraceValues.Compact = 'compact';\n    /**\n     * Verbose message tracing.\n     */\n    TraceValues.Verbose = 'verbose';\n})(TraceValues || (exports.TraceValues = TraceValues = {}));\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    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 && (CancellationStrategy.is(candidate.cancellationStrategy) || ConnectionStrategy.is(candidate.connectionStrategy) || MessageStrategy.is(candidate.messageStrategy));\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    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 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            queue.set(createResponseQueueKey(message.id), message);\n        }\n        else {\n            queue.set(createNotificationQueueKey(), message);\n        }\n    }\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 triggerMessageQueue() {\n        if (timer || messageQueue.size === 0) {\n            return;\n        }\n        timer = (0, ral_1.default)().timer.setImmediate(() => {\n            timer = undefined;\n            processMessageQueue();\n        });\n    }\n    function handleMessage(message) {\n        if (messages_1.Message.isRequest(message)) {\n            handleRequest(message);\n        }\n        else if (messages_1.Message.isNotification(message)) {\n            handleNotification(message);\n        }\n        else if (messages_1.Message.isResponse(message)) {\n            handleResponse(message);\n        }\n        else {\n            handleInvalidMessage(message);\n        }\n    }\n    function processMessageQueue() {\n        if (messageQueue.size === 0) {\n            return;\n        }\n        const message = messageQueue.shift();\n        try {\n            const messageStrategy = options?.messageStrategy;\n            if (MessageStrategy.is(messageStrategy)) {\n                messageStrategy.handleMessage(message, handleMessage);\n            }\n            else {\n                handleMessage(message);\n            }\n        }\n        finally {\n            triggerMessageQueue();\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    function handleRequest(requestMessage) {\n        if (isDisposed()) {\n            // we return here silently since we fired an event when the\n            // connection got disposed.\n            return;\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            messageWriter.write(message).catch(() => logger.error(`Sending response failed.`));\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            messageWriter.write(message).catch(() => logger.error(`Sending response failed.`));\n        }\n        function replySuccess(result, method, startTime) {\n            // The JSON RPC defines that a response must either have a result or an error\n            // So we can't treat undefined as a valid response result.\n            if (result === undefined) {\n                result = null;\n            }\n            const message = {\n                jsonrpc: version,\n                id: requestMessage.id,\n                result: result\n            };\n            traceSendingResponse(message, method, startTime);\n            messageWriter.write(message).catch(() => logger.error(`Sending response failed.`));\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                            replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InvalidParams, `Request ${requestMessage.method} defines ${type.numberOfParams} params but received none.`), requestMessage.method, startTime);\n                            return;\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                            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                            return;\n                        }\n                        handlerResult = requestHandler(...requestMessage.params, cancellationSource.token);\n                    }\n                    else {\n                        if (type !== undefined && type.parameterStructures === messages_1.ParameterStructures.byPosition) {\n                            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                            return;\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 promise = handlerResult;\n                if (!handlerResult) {\n                    requestTokens.delete(tokenKey);\n                    replySuccess(handlerResult, requestMessage.method, startTime);\n                }\n                else if (promise.then) {\n                    promise.then((resultOrError) => {\n                        requestTokens.delete(tokenKey);\n                        reply(resultOrError, requestMessage.method, startTime);\n                    }, error => {\n                        requestTokens.delete(tokenKey);\n                        if (error instanceof messages_1.ResponseError) {\n                            replyError(error, requestMessage.method, startTime);\n                        }\n                        else if (error && Is.string(error.message)) {\n                            replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InternalError, `Request ${requestMessage.method} failed with message: ${error.message}`), requestMessage.method, startTime);\n                        }\n                        else {\n                            replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InternalError, `Request ${requestMessage.method} failed unexpectedly without providing any details.`), requestMessage.method, startTime);\n                        }\n                    });\n                }\n                else {\n                    requestTokens.delete(tokenKey);\n                    reply(handlerResult, requestMessage.method, startTime);\n                }\n            }\n            catch (error) {\n                requestTokens.delete(tokenKey);\n                if (error instanceof messages_1.ResponseError) {\n                    reply(error, requestMessage.method, startTime);\n                }\n                else if (error && Is.string(error.message)) {\n                    replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InternalError, `Request ${requestMessage.method} failed with message: ${error.message}`), requestMessage.method, startTime);\n                }\n                else {\n                    replyError(new messages_1.ResponseError(messages_1.ErrorCodes.InternalError, `Request ${requestMessage.method} failed unexpectedly without providing any details.`), requestMessage.method, startTime);\n                }\n            }\n        }\n        else {\n            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    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                        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                            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                            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                        notificationHandler(message.params);\n                    }\n                }\n                else if (starNotificationHandler) {\n                    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`;\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`;\n                }\n                else {\n                    data = 'No parameters provided.\\n\\n';\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`;\n                }\n                else {\n                    if (message.result) {\n                        data = `Result: ${stringifyTrace(message.result)}\\n\\n`;\n                    }\n                    else if (message.error === undefined) {\n                        data = 'No result returned.\\n\\n';\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`;\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`;\n                }\n                else {\n                    data = 'No parameters provided.\\n\\n';\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`;\n                }\n                else {\n                    if (message.result) {\n                        data = `Result: ${stringifyTrace(message.result)}\\n\\n`;\n                    }\n                    else if (message.error === undefined) {\n                        data = 'No result returned.\\n\\n';\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                let 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                        notificationHandlers.delete(method);\n                    }\n                    else {\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                    progressHandlers.delete(token);\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            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            if (token) {\n                disposable = token.onCancellationRequested(() => {\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                        return Promise.resolve();\n                    }\n                    else {\n                        return p.catch(() => {\n                            logger.log(`Sending cancellation messages for id ${id} failed`);\n                        });\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            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                    await messageWriter.write(requestMessage);\n                    responsePromises.set(id, responsePromise);\n                }\n                catch (error) {\n                    logger.error(`Sending request failed.`);\n                    // Writing the message failed. So we need to reject the promise.\n                    responsePromise.reject(new messages_1.ResponseError(messages_1.ErrorCodes.MessageWriteError, error.message ? error.message : 'Unknown reason'));\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                        requestHandlers.delete(method);\n                    }\n                    else {\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            // eslint-disable-next-line no-console\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, (params) => {\n        const handler = progressHandlers.get(params.token);\n        if (handler) {\n            handler(params.value);\n        }\n        else {\n            unhandledProgressEmitter.fire(params);\n        }\n    });\n    return connection;\n}\nexports.createMessageConnection = createMessageConnection;\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\" />\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.CancellationReceiverStrategy = exports.ConnectionError = exports.ConnectionErrors = exports.LogTraceNotification = exports.SetTraceNotification = exports.TraceFormat = exports.TraceValues = 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, \"TraceValues\", { enumerable: true, get: function () { return connection_1.TraceValues; } });\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, \"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; } });\nconst ral_1 = require(\"./ral\");\nexports.RAL = ral_1.default;\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 api_1 = require(\"../common/api\");\nclass MessageBuffer extends api_1.AbstractMessageBuffer {\n    constructor(encoding = 'utf-8') {\n        super(encoding);\n        this.asciiDecoder = new TextDecoder('ascii');\n    }\n    emptyBuffer() {\n        return MessageBuffer.emptyBuffer;\n    }\n    fromString(value, _encoding) {\n        return (new TextEncoder()).encode(value);\n    }\n    toString(value, encoding) {\n        if (encoding === 'ascii') {\n            return this.asciiDecoder.decode(value);\n        }\n        else {\n            return (new TextDecoder(encoding)).decode(value);\n        }\n    }\n    asNative(buffer, length) {\n        if (length === undefined) {\n            return buffer;\n        }\n        else {\n            return buffer.slice(0, length);\n        }\n    }\n    allocNative(length) {\n        return new Uint8Array(length);\n    }\n}\nMessageBuffer.emptyBuffer = new Uint8Array(0);\nclass ReadableStreamWrapper {\n    constructor(socket) {\n        this.socket = socket;\n        this._onData = new api_1.Emitter();\n        this._messageListener = (event) => {\n            const blob = event.data;\n            blob.arrayBuffer().then((buffer) => {\n                this._onData.fire(new Uint8Array(buffer));\n            }, () => {\n                (0, api_1.RAL)().console.error(`Converting blob to array buffer failed.`);\n            });\n        };\n        this.socket.addEventListener('message', this._messageListener);\n    }\n    onClose(listener) {\n        this.socket.addEventListener('close', listener);\n        return api_1.Disposable.create(() => this.socket.removeEventListener('close', listener));\n    }\n    onError(listener) {\n        this.socket.addEventListener('error', listener);\n        return api_1.Disposable.create(() => this.socket.removeEventListener('error', listener));\n    }\n    onEnd(listener) {\n        this.socket.addEventListener('end', listener);\n        return api_1.Disposable.create(() => this.socket.removeEventListener('end', listener));\n    }\n    onData(listener) {\n        return this._onData.event(listener);\n    }\n}\nclass WritableStreamWrapper {\n    constructor(socket) {\n        this.socket = socket;\n    }\n    onClose(listener) {\n        this.socket.addEventListener('close', listener);\n        return api_1.Disposable.create(() => this.socket.removeEventListener('close', listener));\n    }\n    onError(listener) {\n        this.socket.addEventListener('error', listener);\n        return api_1.Disposable.create(() => this.socket.removeEventListener('error', listener));\n    }\n    onEnd(listener) {\n        this.socket.addEventListener('end', listener);\n        return api_1.Disposable.create(() => this.socket.removeEventListener('end', listener));\n    }\n    write(data, encoding) {\n        if (typeof data === 'string') {\n            if (encoding !== undefined && encoding !== 'utf-8') {\n                throw new Error(`In a Browser environments only utf-8 text encoding is supported. But got encoding: ${encoding}`);\n            }\n            this.socket.send(data);\n        }\n        else {\n            this.socket.send(data);\n        }\n        return Promise.resolve();\n    }\n    end() {\n        this.socket.close();\n    }\n}\nconst _textEncoder = new TextEncoder();\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                if (options.charset !== 'utf-8') {\n                    throw new Error(`In a Browser environments only utf-8 text encoding is supported. But got encoding: ${options.charset}`);\n                }\n                return Promise.resolve(_textEncoder.encode(JSON.stringify(msg, undefined, 0)));\n            }\n        }),\n        decoder: Object.freeze({\n            name: 'application/json',\n            decode: (buffer, options) => {\n                if (!(buffer instanceof Uint8Array)) {\n                    throw new Error(`In a Browser environments only Uint8Arrays are supported.`);\n                }\n                return Promise.resolve(JSON.parse(new TextDecoder(options.charset).decode(buffer)));\n            }\n        })\n    }),\n    stream: Object.freeze({\n        asReadableStream: (socket) => new ReadableStreamWrapper(socket),\n        asWritableStream: (socket) => new WritableStreamWrapper(socket)\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 = setTimeout(callback, 0, ...args);\n            return { dispose: () => clearTimeout(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\";\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.createMessageConnection = exports.BrowserMessageWriter = exports.BrowserMessageReader = void 0;\nconst ril_1 = require(\"./ril\");\n// Install the browser runtime abstract.\nril_1.default.install();\nconst api_1 = require(\"../common/api\");\n__exportStar(require(\"../common/api\"), exports);\nclass BrowserMessageReader extends api_1.AbstractMessageReader {\n    constructor(port) {\n        super();\n        this._onData = new api_1.Emitter();\n        this._messageListener = (event) => {\n            this._onData.fire(event.data);\n        };\n        port.addEventListener('error', (event) => this.fireError(event));\n        port.onmessage = this._messageListener;\n    }\n    listen(callback) {\n        return this._onData.event(callback);\n    }\n}\nexports.BrowserMessageReader = BrowserMessageReader;\nclass BrowserMessageWriter extends api_1.AbstractMessageWriter {\n    constructor(port) {\n        super();\n        this.port = port;\n        this.errorCount = 0;\n        port.addEventListener('error', (event) => this.fireError(event));\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.BrowserMessageWriter = BrowserMessageWriter;\nfunction createMessageConnection(reader, writer, logger, options) {\n    if (logger === undefined) {\n        logger = api_1.NullLogger;\n    }\n    if (api_1.ConnectionStrategy.is(options)) {\n        options = { connectionStrategy: options };\n    }\n    return (0, api_1.createMessageConnection)(reader, writer, logger, options);\n}\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 * ----------------------------------------------------------------------------------------- */\n'use strict';\n\nmodule.exports = require('./lib/browser/main');","\"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.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    constructor(method) {\n        this.method = method;\n    }\n}\nexports.RegistrationType = RegistrationType;\nclass ProtocolRequestType0 extends vscode_jsonrpc_1.RequestType0 {\n    constructor(method) {\n        super(method);\n    }\n}\nexports.ProtocolRequestType0 = ProtocolRequestType0;\nclass ProtocolRequestType extends vscode_jsonrpc_1.RequestType {\n    constructor(method) {\n        super(method, vscode_jsonrpc_1.ParameterStructures.byName);\n    }\n}\nexports.ProtocolRequestType = ProtocolRequestType;\nclass ProtocolNotificationType0 extends vscode_jsonrpc_1.NotificationType0 {\n    constructor(method) {\n        super(method);\n    }\n}\nexports.ProtocolNotificationType0 = ProtocolNotificationType0;\nclass ProtocolNotificationType extends vscode_jsonrpc_1.NotificationType {\n    constructor(method) {\n        super(method, vscode_jsonrpc_1.ParameterStructures.byName);\n    }\n}\nexports.ProtocolNotificationType = ProtocolNotificationType;\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.objectLiteral = exports.typedArray = exports.stringArray = exports.array = exports.func = exports.error = exports.number = exports.string = exports.boolean = void 0;\nfunction boolean(value) {\n    return value === true || value === false;\n}\nexports.boolean = boolean;\nfunction string(value) {\n    return typeof value === 'string' || value instanceof String;\n}\nexports.string = string;\nfunction number(value) {\n    return typeof value === 'number' || value instanceof Number;\n}\nexports.number = number;\nfunction error(value) {\n    return value instanceof Error;\n}\nexports.error = error;\nfunction func(value) {\n    return typeof value === 'function';\n}\nexports.func = func;\nfunction array(value) {\n    return Array.isArray(value);\n}\nexports.array = array;\nfunction stringArray(value) {\n    return array(value) && value.every(elem => string(elem));\n}\nexports.stringArray = stringArray;\nfunction typedArray(value, check) {\n    return Array.isArray(value) && value.every(check);\n}\nexports.typedArray = typedArray;\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}\nexports.objectLiteral = objectLiteral;\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 || (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 LocatioLink 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 || (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 || (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 || (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 || (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 || (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 ColorInformation ColorInformation[]} 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 || (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 || (exports.FoldingRangeRequest = FoldingRangeRequest = {}));\n/**\n * @since 3.18.0\n * @proposed\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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 * ------------------------------------------------------------------------------------------ */\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 = 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 || (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 || (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 || (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 * ------------------------------------------------------------------------------------------ */\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 = 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 * @proposed\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 || (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.WorkspaceSymbolRequest = exports.CodeActionResolveRequest = exports.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.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.FailureHandlingKind = exports.ResourceOperationKind = exports.UnregistrationRequest = exports.RegistrationRequest = exports.DocumentSelector = exports.NotebookCellTextDocumentFilter = exports.NotebookDocumentFilter = exports.TextDocumentFilter = void 0;\nexports.MonikerRequest = exports.MonikerKind = exports.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 = void 0;\nexports.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 = void 0;\nconst messages_1 = require(\"./messages\");\nconst vscode_languageserver_types_1 = require(\"vscode-languageserver-types\");\nconst Is = 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; } });\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) || Is.string(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 (let 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 * 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 || (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 || (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 || (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 || (exports.DidOpenTextDocumentNotification = DidOpenTextDocumentNotification = {}));\nvar TextDocumentContentChangeEvent;\n(function (TextDocumentContentChangeEvent) {\n    /**\n     * Checks whether the information describes a delta event.\n     */\n    function isIncremental(event) {\n        let candidate = event;\n        return candidate !== undefined && candidate !== null &&\n            typeof candidate.text === 'string' && candidate.range !== undefined &&\n            (candidate.rangeLength === undefined || typeof candidate.rangeLength === 'number');\n    }\n    TextDocumentContentChangeEvent.isIncremental = isIncremental;\n    /**\n     * Checks whether the information describes a full replacement event.\n     */\n    function isFull(event) {\n        let candidate = event;\n        return candidate !== undefined && candidate !== null &&\n            typeof candidate.text === 'string' && candidate.range === undefined && candidate.rangeLength === undefined;\n    }\n    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 || (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 || (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 || (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 || (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 || (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 || (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 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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (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 || (exports.DocumentRangeFormattingRequest = DocumentRangeFormattingRequest = {}));\n/**\n * A request to format ranges in a document.\n *\n * @since 3.18.0\n * @proposed\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 || (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 || (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 || (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 || (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 || (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 || (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 = void 0;\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}\nexports.createProtocolConnection = createProtocolConnection;\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 as 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 * ------------------------------------------------------------------------------------------ */\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 = void 0;\nconst browser_1 = require(\"vscode-jsonrpc/browser\");\n__exportStar(require(\"vscode-jsonrpc/browser\"), exports);\n__exportStar(require(\"../common/api\"), exports);\nfunction createProtocolConnection(reader, writer, logger, options) {\n    return (0, browser_1.createMessageConnection)(reader, writer, logger, options);\n}\nexports.createProtocolConnection = createProtocolConnection;\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 ******************************************************************************/\nexport var Disposable;\n(function (Disposable) {\n    function create(callback) {\n        return {\n            dispose: async () => await callback()\n        };\n    }\n    Disposable.create = create;\n})(Disposable || (Disposable = {}));\n//# sourceMappingURL=disposable.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { LSPErrorCodes, ResponseError } from 'vscode-languageserver-protocol';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { Disposable } from '../utils/disposable.js';\nimport { MultiMap } from '../utils/collections.js';\nimport { OperationCancelled, interruptAndCheck, isOperationCancelled } from '../utils/promise-utils.js';\nimport { stream } from '../utils/stream.js';\nimport { UriUtils } from '../utils/uri-utils.js';\nimport { DocumentState } from './documents.js';\nexport class DefaultDocumentBuilder {\n    constructor(services) {\n        this.updateBuildOptions = {\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        this.updateListeners = [];\n        this.buildPhaseListeners = new MultiMap();\n        this.documentPhaseListeners = new MultiMap();\n        this.buildState = new Map();\n        this.documentBuildWaiters = new Map();\n        this.currentState = DocumentState.Changed;\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    async build(documents, options = {}, cancelToken = CancellationToken.None) {\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                }\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            }\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    async update(changed, deleted, cancelToken = CancellationToken.None) {\n        this.currentState = DocumentState.Changed;\n        // Remove all metadata of documents that are reported as deleted\n        const deletedUris = [];\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        // Collect and sort all documents that we should rebuild\n        const rebuildDocuments = this.sortDocuments(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            .toArray());\n        await this.buildDocuments(rebuildDocuments, this.updateBuildOptions, cancelToken);\n    }\n    resultsAreIncomplete(document, options) {\n        return this.findMissingValidationCategories(document, options).length >= 1;\n    }\n    findMissingValidationCategories(document, options) {\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    async findChangedUris(changed) {\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            }\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        }\n        catch {\n            // If we can't determine the file type, we discard the change\n        }\n        return [];\n    }\n    async emitUpdate(changed, deleted) {\n        await Promise.all(this.updateListeners.map(listener => listener(changed, deleted)));\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    sortDocuments(documents) {\n        let left = 0;\n        let right = documents.length - 1;\n        while (left < right) {\n            while (left < documents.length && this.hasTextDocument(documents[left])) {\n                left++;\n            }\n            while (right >= 0 && !this.hasTextDocument(documents[right])) {\n                right--;\n            }\n            if (left < right) {\n                [documents[left], documents[right]] = [documents[right], documents[left]];\n            }\n        }\n        return documents;\n    }\n    hasTextDocument(doc) {\n        return Boolean(this.textDocuments?.get(doc.uri));\n    }\n    /**\n     * Check whether the given document should be relinked after changes were found in the given URIs.\n     */\n    shouldRelink(document, changedUris) {\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    onUpdate(callback) {\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    resetToState(document, state) {\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    cleanUpDeleted(document) {\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     * 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    async buildDocuments(documents, options, cancelToken) {\n        this.prepareBuild(documents, options);\n        // 0. Parse content\n        await this.runCancelable(documents, DocumentState.Parsed, cancelToken, doc => this.langiumDocumentFactory.update(doc, cancelToken));\n        // 1. Index content: collect the documents' symbols being accessible by other documents\n        await this.runCancelable(documents, DocumentState.IndexedContent, cancelToken, doc => this.indexManager.updateContent(doc, cancelToken));\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 => this.indexManager.updateReferences(doc, cancelToken));\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            }\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    markAsCompleted(document) {\n        const state = this.buildState.get(document.uri.toString());\n        if (state) {\n            state.completed = true;\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    prepareBuild(documents, options) {\n        for (const doc of documents) {\n            const key = doc.uri.toString();\n            const state = this.buildState.get(key);\n            if (!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            }\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     * 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    async runCancelable(documents, targetState, cancelToken, callback) {\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        // 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    onBuildPhase(targetState, callback) {\n        this.buildPhaseListeners.add(targetState, callback);\n        return Disposable.create(() => {\n            this.buildPhaseListeners.delete(targetState, callback);\n        });\n    }\n    onDocumentPhase(targetState, callback) {\n        this.documentPhaseListeners.add(targetState, callback);\n        return Disposable.create(() => {\n            this.documentPhaseListeners.delete(targetState, callback);\n        });\n    }\n    waitUntil(state, uriOrToken, cancelToken) {\n        let uri = undefined;\n        if (uriOrToken && 'path' in uriOrToken) {\n            uri = uriOrToken;\n        }\n        else {\n            cancelToken = uriOrToken;\n        }\n        cancelToken ?? (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    awaitDocumentState(state, uri, cancelToken) {\n        const document = this.langiumDocuments.getDocument(uri);\n        if (!document) {\n            return Promise.reject(new ResponseError(LSPErrorCodes.ServerCancelled, `No document found for URI: ${uri.toString()}`));\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(new ResponseError(LSPErrorCodes.RequestFailed, `Document state of ${uri.toString()} is ${DocumentState[document.state]}, requiring ${DocumentState[state]}, but workspace state is already ${DocumentState[this.currentState]}. Returning undefined.`));\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    awaitBuilderState(state, cancelToken) {\n        if (this.currentState >= state) {\n            return Promise.resolve();\n        }\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    async notifyDocumentPhase(document, state, cancelToken) {\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            }\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    async notifyBuildPhase(documents, state, cancelToken) {\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     * 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    shouldLink(document) {\n        return this.getBuildOptions(document).eagerLinking ?? true;\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    shouldValidate(document) {\n        return Boolean(this.getBuildOptions(document).validation);\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    async validate(document, cancelToken) {\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        }\n        else {\n            document.diagnostics = diagnostics;\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 ?? (state.result = {});\n            if (state.result.validationChecks) {\n                state.result.validationChecks = stream(state.result.validationChecks).concat(validationOptions.categories).distinct().toArray();\n            }\n            else {\n                state.result.validationChecks = [...validationOptions.categories];\n            }\n        }\n    }\n    getBuildOptions(document) {\n        return this.buildState.get(document.uri.toString())?.options ?? {};\n    }\n}\n//# sourceMappingURL=document-builder.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { getDocument } from '../utils/ast-utils.js';\nimport { ContextCache } from '../utils/caching.js';\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { stream } from '../utils/stream.js';\nimport { UriUtils } from '../utils/uri-utils.js';\nexport class DefaultIndexManager {\n    constructor(services) {\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        this.symbolIndex = new Map();\n        /**\n         * This is a cache for the `allElements()` method.\n         * It caches the descriptions from `symbolIndex` grouped by types.\n         */\n        this.symbolByTypeIndex = new ContextCache();\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        this.referenceIndex = new Map();\n        this.documents = services.workspace.LangiumDocuments;\n        this.serviceRegistry = services.ServiceRegistry;\n        this.astReflection = services.AstReflection;\n    }\n    findAllReferences(targetNode, astNodePath) {\n        const targetDocUri = getDocument(targetNode).uri;\n        const result = [];\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    allElements(nodeType, uris) {\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    getFileDescriptions(uri, nodeType) {\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    remove(uri) {\n        this.removeContent(uri);\n        this.removeReferences(uri);\n    }\n    removeContent(uri) {\n        const uriString = uri.toString();\n        this.symbolIndex.delete(uriString);\n        this.symbolByTypeIndex.clear(uriString);\n    }\n    removeReferences(uri) {\n        const uriString = uri.toString();\n        this.referenceIndex.delete(uriString);\n    }\n    async updateContent(document, cancelToken = CancellationToken.None) {\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    async updateReferences(document, cancelToken = CancellationToken.None) {\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    isAffected(document, changedUris) {\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//# sourceMappingURL=index-manager.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { CancellationToken } from '../utils/cancellation.js';\nimport { Deferred, interruptAndCheck } from '../utils/promise-utils.js';\nimport { URI, UriUtils } from '../utils/uri-utils.js';\nimport { stream } from '../utils/stream.js';\nexport class DefaultWorkspaceManager {\n    constructor(services) {\n        this.initialBuildOptions = {};\n        this._ready = new Deferred();\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    get ready() {\n        return this._ready.promise;\n    }\n    get workspaceFolders() {\n        return this.folders;\n    }\n    initialize(params) {\n        this.folders = params.workspaceFolders ?? undefined;\n    }\n    initialized(_params) {\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    async initializeWorkspace(folders, cancelToken = CancellationToken.None) {\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     * 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    async performStartup(folders) {\n        const documents = [];\n        const collector = (document) => {\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 = [];\n        await Promise.all(folders.map(wf => this.getRootFolder(wf))\n            .map(async (entry) => this.traverseFolder(entry, uris)));\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    async loadWorkspaceDocuments(uris, collector) {\n        await Promise.all(uris.map(async (uri) => {\n            const document = await this.langiumDocuments.getOrCreateDocument(uri);\n            collector(document);\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    loadAdditionalDocuments(_folders, _collector) {\n        return Promise.resolve();\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    getRootFolder(workspaceFolder) {\n        return URI.parse(workspaceFolder.uri);\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    async traverseFolder(folderPath, uris) {\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                    }\n                    else if (entry.isFile) {\n                        uris.push(entry.uri);\n                    }\n                }\n            }));\n        }\n        catch (e) {\n            console.error('Failure to read directory content of ' + folderPath.toString(true), e);\n        }\n    }\n    async searchFolder(uri) {\n        const uris = [];\n        await this.traverseFolder(uri, uris);\n        return uris;\n    }\n    /**\n     * Determine whether the given folder entry shall be included while indexing the workspace.\n     */\n    shouldIncludeEntry(entry) {\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        }\n        else if (entry.isFile) {\n            return this.serviceRegistry.hasServices(entry.uri);\n        }\n        return false;\n    }\n}\n//# sourceMappingURL=workspace-manager.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { Lexer as ChevrotainLexer, defaultLexerErrorProvider } from 'chevrotain';\nexport class DefaultLexerErrorMessageProvider {\n    buildUnexpectedCharactersMessage(fullText, startOffset, length, line, column) {\n        return defaultLexerErrorProvider.buildUnexpectedCharactersMessage(fullText, startOffset, length, line, column);\n    }\n    buildUnableToPopLexerModeMessage(token) {\n        return defaultLexerErrorProvider.buildUnableToPopLexerModeMessage(token);\n    }\n}\nexport const DEFAULT_TOKENIZE_OPTIONS = { mode: 'full' };\nexport class DefaultLexer {\n    constructor(services) {\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    get definition() {\n        return this.tokenTypes;\n    }\n    tokenize(text, _options = DEFAULT_TOKENIZE_OPTIONS) {\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    toTokenTypeDictionary(buildTokens) {\n        if (isTokenTypeDictionary(buildTokens))\n            return buildTokens;\n        const tokens = isIMultiModeLexerDefinition(buildTokens) ? Object.values(buildTokens.modes).flat() : buildTokens;\n        const res = {};\n        tokens.forEach(token => res[token.name] = token);\n        return res;\n    }\n}\n/**\n * Returns a check whether the given TokenVocabulary is TokenType array\n */\nexport function isTokenTypeArray(tokenVocabulary) {\n    return Array.isArray(tokenVocabulary) && (tokenVocabulary.length === 0 || 'name' in tokenVocabulary[0]);\n}\n/**\n * Returns a check whether the given TokenVocabulary is IMultiModeLexerDefinition\n */\nexport function isIMultiModeLexerDefinition(tokenVocabulary) {\n    return tokenVocabulary && 'modes' in tokenVocabulary && 'defaultMode' in tokenVocabulary;\n}\n/**\n * Returns a check whether the given TokenVocabulary is TokenTypeDictionary\n */\nexport function isTokenTypeDictionary(tokenVocabulary) {\n    return !isTokenTypeArray(tokenVocabulary) && !isIMultiModeLexerDefinition(tokenVocabulary);\n}\n//# sourceMappingURL=lexer.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { Position, Range } from 'vscode-languageserver-types';\nimport { NEWLINE_REGEXP, escapeRegExp } from '../utils/regexp-utils.js';\nimport { URI } from '../utils/uri-utils.js';\nexport function parseJSDoc(node, start, options) {\n    let opts;\n    let position;\n    if (typeof node === 'string') {\n        position = start;\n        opts = options;\n    }\n    else {\n        position = node.range.start;\n        opts = start;\n    }\n    if (!position) {\n        position = Position.create(0, 0);\n    }\n    const lines = getLines(node);\n    const normalizedOptions = normalizeOptions(opts);\n    const tokens = tokenize({\n        lines,\n        position,\n        options: normalizedOptions\n    });\n    return parseJSDocComment({\n        index: 0,\n        tokens,\n        position\n    });\n}\nexport function isJSDoc(node, options) {\n    const normalizedOptions = normalizeOptions(options);\n    const lines = getLines(node);\n    if (lines.length === 0) {\n        return false;\n    }\n    const first = lines[0];\n    const last = lines[lines.length - 1];\n    const firstRegex = normalizedOptions.start;\n    const lastRegex = normalizedOptions.end;\n    return Boolean(firstRegex?.exec(first)) && Boolean(lastRegex?.exec(last));\n}\nfunction getLines(node) {\n    let content = '';\n    if (typeof node === 'string') {\n        content = node;\n    }\n    else {\n        content = node.text;\n    }\n    const lines = content.split(NEWLINE_REGEXP);\n    return lines;\n}\nconst tagRegex = /\\s*(@([\\p{L}][\\p{L}\\p{N}]*)?)/uy;\nconst inlineTagRegex = /\\{(@[\\p{L}][\\p{L}\\p{N}]*)(\\s*)([^\\r\\n}]+)?\\}/gu;\nfunction tokenize(context) {\n    const tokens = [];\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        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        }\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        line = line.substring(0, lastCharacter(line));\n        const whitespaceEnd = skipWhitespace(line, index);\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        }\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            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        currentLine++;\n        currentCharacter = 0;\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    return tokens;\n}\nfunction buildInlineTokens(tags, line, lineIndex, characterIndex) {\n    const tokens = [];\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    }\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(Position.create(lineIndex, lastIndex + characterIndex), Position.create(lineIndex, matchIndex + characterIndex))\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(Position.create(lineIndex, lastIndex + offset + characterIndex), Position.create(lineIndex, lastIndex + offset + tagName.length + characterIndex))\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(Position.create(lineIndex, lastIndex + offset + characterIndex), Position.create(lineIndex, lastIndex + offset + value.length + characterIndex))\n                });\n            }\n            else {\n                tokens.push({\n                    type: 'text',\n                    content: '',\n                    range: Range.create(Position.create(lineIndex, lastIndex + offset + characterIndex), Position.create(lineIndex, lastIndex + offset + characterIndex))\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(Position.create(lineIndex, lastIndex + characterIndex), Position.create(lineIndex, lastIndex + characterIndex + endContent.length))\n            });\n        }\n    }\n    return tokens;\n}\nconst nonWhitespaceRegex = /\\S/;\nconst whitespaceEndRegex = /\\s*$/;\nfunction skipWhitespace(line, index) {\n    const match = line.substring(index).match(nonWhitespaceRegex);\n    if (match) {\n        return index + match.index;\n    }\n    else {\n        return line.length;\n    }\n}\nfunction lastCharacter(line) {\n    const match = line.match(whitespaceEndRegex);\n    if (match && typeof match.index === 'number') {\n        return match.index;\n    }\n    return undefined;\n}\n// Parsing\nfunction parseJSDocComment(context) {\n    const startPosition = 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 = [];\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}\nfunction parseJSDocElement(context, last) {\n    const next = context.tokens[context.index];\n    if (next.type === 'tag') {\n        return parseJSDocTag(context, false);\n    }\n    else if (next.type === 'text' || next.type === 'inline-tag') {\n        return parseJSDocText(context);\n    }\n    else {\n        appendEmptyLine(next, last);\n        context.index++;\n        return undefined;\n    }\n}\nfunction appendEmptyLine(token, element) {\n    if (element) {\n        const line = new JSDocLineImpl('', token.range);\n        if ('inlines' in element) {\n            element.inlines.push(line);\n        }\n        else {\n            element.content.inlines.push(line);\n        }\n    }\n}\nfunction parseJSDocText(context) {\n    let token = context.tokens[context.index];\n    const firstToken = token;\n    let lastToken = token;\n    const lines = [];\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}\nfunction parseJSDocInline(context) {\n    const token = context.tokens[context.index];\n    if (token.type === 'inline-tag') {\n        return parseJSDocTag(context, true);\n    }\n    else {\n        return parseJSDocLine(context);\n    }\n}\nfunction parseJSDocTag(context, inline) {\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(name, new JSDocTextImpl([docLine], docLine.range), inline, Range.create(tagToken.range.start, docLine.range.end));\n        }\n        else {\n            const textDoc = parseJSDocText(context);\n            return new JSDocTagImpl(name, textDoc, inline, 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}\nfunction parseJSDocLine(context) {\n    const token = context.tokens[context.index++];\n    return new JSDocLineImpl(token.content, token.range);\n}\nfunction normalizeOptions(options) {\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}\nfunction normalizeOption(option, start) {\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        }\n        else {\n            return new RegExp(`\\\\s*${escaped}\\\\s*$`);\n        }\n    }\n    else {\n        return option;\n    }\n}\nclass JSDocCommentImpl {\n    constructor(elements, range) {\n        this.elements = elements;\n        this.range = range;\n    }\n    getTag(name) {\n        return this.getAllTags().find(e => e.name === name);\n    }\n    getTags(name) {\n        return this.getAllTags().filter(e => e.name === name);\n    }\n    getAllTags() {\n        return this.elements.filter(e => 'name' in e);\n    }\n    toString() {\n        let value = '';\n        for (const element of this.elements) {\n            if (value.length === 0) {\n                value = element.toString();\n            }\n            else {\n                const text = element.toString();\n                value += fillNewlines(value) + text;\n            }\n        }\n        return value.trim();\n    }\n    toMarkdown(options) {\n        let value = '';\n        for (const element of this.elements) {\n            if (value.length === 0) {\n                value = element.toMarkdown(options);\n            }\n            else {\n                const text = element.toMarkdown(options);\n                value += fillNewlines(value) + text;\n            }\n        }\n        return value.trim();\n    }\n}\nclass JSDocTagImpl {\n    constructor(name, content, inline, range) {\n        this.name = name;\n        this.content = content;\n        this.inline = inline;\n        this.range = range;\n    }\n    toString() {\n        let text = `@${this.name}`;\n        const content = this.content.toString();\n        if (this.content.inlines.length === 1) {\n            text = `${text} ${content}`;\n        }\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        }\n        else {\n            return text;\n        }\n    }\n    toMarkdown(options) {\n        return options?.renderTag?.(this) ?? this.toMarkdownDefault(options);\n    }\n    toMarkdownDefault(options) {\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        }\n        else if (options?.tag === 'bold') {\n            marker = '**';\n        }\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} — ${content}`;\n        }\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        }\n        else {\n            return text;\n        }\n    }\n}\nfunction renderInlineTag(tag, content, options) {\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}\nfunction renderLinkDefault(content, display) {\n    try {\n        URI.parse(content, true);\n        return `[${display}](${content})`;\n    }\n    catch {\n        return content;\n    }\n}\nclass JSDocTextImpl {\n    constructor(lines, range) {\n        this.inlines = lines;\n        this.range = range;\n    }\n    toString() {\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    toMarkdown(options) {\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}\nclass JSDocLineImpl {\n    constructor(text, range) {\n        this.text = text;\n        this.range = range;\n    }\n    toString() {\n        return this.text;\n    }\n    toMarkdown() {\n        return this.text;\n    }\n}\nfunction fillNewlines(text) {\n    if (text.endsWith('\\n')) {\n        return '\\n';\n    }\n    else {\n        return '\\n\\n';\n    }\n}\n//# sourceMappingURL=jsdoc.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { getDocument } from '../utils/ast-utils.js';\nimport { isJSDoc, parseJSDoc } from './jsdoc.js';\nexport class JSDocDocumentationProvider {\n    constructor(services) {\n        this.indexManager = services.shared.workspace.IndexManager;\n        this.commentProvider = services.documentation.CommentProvider;\n    }\n    getDocumentation(node) {\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    documentationLinkRenderer(node, name, display) {\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        }\n        else {\n            return undefined;\n        }\n    }\n    documentationTagRenderer(_node, _tag) {\n        // Fall back to the default tag rendering\n        return undefined;\n    }\n    findNameInLocalSymbols(node, name) {\n        const document = getDocument(node);\n        const precomputed = document.localSymbols;\n        if (!precomputed) {\n            return undefined;\n        }\n        let currentNode = 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        return undefined;\n    }\n    findNameInGlobalScope(node, name) {\n        const description = this.indexManager.allElements().find(e => e.name === name);\n        return description;\n    }\n}\n//# sourceMappingURL=documentation-provider.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { isAstNodeWithComment } from '../serializer/json-serializer.js';\nimport { findCommentNode } from '../utils/cst-utils.js';\nexport class DefaultCommentProvider {\n    constructor(services) {\n        this.grammarConfig = () => services.parser.GrammarConfig;\n    }\n    getComment(node) {\n        if (isAstNodeWithComment(node)) {\n            return node.$comment;\n        }\n        return findCommentNode(node.$cstNode, this.grammarConfig().multilineCommentRules)?.text;\n    }\n}\n//# sourceMappingURL=comment-provider.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { Deferred, OperationCancelled } from '../utils/promise-utils.js';\nimport { Emitter } from '../utils/event.js';\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 {\n    constructor(services) {\n        this.syncParser = services.parser.LangiumParser;\n    }\n    parse(text, _cancelToken) {\n        return Promise.resolve(this.syncParser.parse(text));\n    }\n}\nexport class AbstractThreadedAsyncParser {\n    constructor(services) {\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        this.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        this.terminationDelay = 200;\n        this.workerPool = [];\n        this.queue = [];\n        this.hydrator = services.serializer.Hydrator;\n    }\n    initializeWorkers() {\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    async parse(text, cancelToken) {\n        const worker = await this.acquireParserWorker(cancelToken);\n        const deferred = new Deferred();\n        let timeout;\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(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    terminateWorker(worker) {\n        worker.terminate();\n        const index = this.workerPool.indexOf(worker);\n        if (index >= 0) {\n            this.workerPool.splice(index, 1);\n        }\n    }\n    async acquireParserWorker(cancelToken) {\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();\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}\nexport class ParserWorker {\n    get ready() {\n        return this._ready;\n    }\n    get onReady() {\n        return this.onReadyEmitter.event;\n    }\n    constructor(sendMessage, onMessage, onError, terminate) {\n        this.onReadyEmitter = new Emitter();\n        this.deferred = new Deferred();\n        this._ready = true;\n        this._parsing = false;\n        this.sendMessage = sendMessage;\n        this._terminate = terminate;\n        onMessage(result => {\n            const parseResult = result;\n            this.deferred.resolve(parseResult);\n            this.unlock();\n        });\n        onError(error => {\n            this.deferred.reject(error);\n            this.unlock();\n        });\n    }\n    terminate() {\n        this.deferred.reject(OperationCancelled);\n        this._terminate();\n    }\n    lock() {\n        this._ready = false;\n    }\n    unlock() {\n        this._parsing = false;\n        this._ready = true;\n        this.onReadyEmitter.fire();\n    }\n    parse(text) {\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//# sourceMappingURL=async-parser.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { CancellationToken, CancellationTokenSource } from '../utils/cancellation.js';\nimport { Deferred, isOperationCancelled, startCancelableOperation } from '../utils/promise-utils.js';\nexport class DefaultWorkspaceLock {\n    constructor() {\n        this.previousTokenSource = new CancellationTokenSource();\n        this.writeQueue = [];\n        this.readQueue = [];\n        this.done = true;\n    }\n    write(action) {\n        this.cancelWrite();\n        const tokenSource = startCancelableOperation();\n        this.previousTokenSource = tokenSource;\n        return this.enqueue(this.writeQueue, action, tokenSource.token);\n    }\n    read(action) {\n        return this.enqueue(this.readQueue, action);\n    }\n    enqueue(queue, action, cancellationToken = CancellationToken.None) {\n        const deferred = new Deferred();\n        const entry = {\n            action,\n            deferred,\n            cancellationToken\n        };\n        queue.push(entry);\n        this.performNextOperation();\n        return deferred.promise;\n    }\n    async performNextOperation() {\n        if (!this.done) {\n            return;\n        }\n        const entries = [];\n        if (this.writeQueue.length > 0) {\n            // Just perform the next write action\n            entries.push(this.writeQueue.shift());\n        }\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        }\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            }\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                }\n                else {\n                    deferred.reject(err);\n                }\n            }\n        }));\n        this.done = true;\n        this.performNextOperation();\n    }\n    cancelWrite() {\n        this.previousTokenSource.cancel();\n    }\n}\n//# sourceMappingURL=workspace-lock.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { CompositeCstNodeImpl, LeafCstNodeImpl, RootCstNodeImpl } from '../parser/cst-node-builder.js';\nimport { isAbstractElement } from '../languages/generated/ast.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';\nexport class DefaultHydrator {\n    constructor(services) {\n        this.grammarElementIdMap = new BiMap();\n        this.tokenTypeIdMap = new BiMap();\n        this.grammar = services.Grammar;\n        this.lexer = services.parser.Lexer;\n        this.linker = services.references.Linker;\n    }\n    dehydrate(result) {\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    dehydrateLexerReport(lexerReport) {\n        // By default, lexer reports are serializable\n        return lexerReport;\n    }\n    createDehyrationContext(node) {\n        const astNodes = new Map();\n        const cstNodes = new Map();\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    dehydrateAstNode(node, context) {\n        const obj = context.astNodes.get(node);\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 = [];\n                obj[name] = arr;\n                for (const item of value) {\n                    if (isAstNode(item)) {\n                        arr.push(this.dehydrateAstNode(item, context));\n                    }\n                    else if (isReference(item)) {\n                        arr.push(this.dehydrateReference(item, context));\n                    }\n                    else {\n                        arr.push(item);\n                    }\n                }\n            }\n            else if (isAstNode(value)) {\n                obj[name] = this.dehydrateAstNode(value, context);\n            }\n            else if (isReference(value)) {\n                obj[name] = this.dehydrateReference(value, context);\n            }\n            else if (value !== undefined) {\n                obj[name] = value;\n            }\n        }\n        return obj;\n    }\n    dehydrateReference(reference, context) {\n        const obj = {};\n        obj.$refText = reference.$refText;\n        if (reference.$refNode) {\n            obj.$refNode = context.cstNodes.get(reference.$refNode);\n        }\n        return obj;\n    }\n    dehydrateCstNode(node, context) {\n        const cstNode = context.cstNodes.get(node);\n        if (isRootCstNode(node)) {\n            cstNode.fullText = node.fullText;\n        }\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        }\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    hydrate(result) {\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)\n        };\n    }\n    createHydrationContext(node) {\n        const astNodes = new Map();\n        const cstNodes = new Map();\n        for (const astNode of streamAst(node)) {\n            astNodes.set(astNode, {});\n        }\n        let root;\n        if (node.$cstNode) {\n            for (const cstNode of streamCst(node.$cstNode)) {\n                let cst;\n                if ('fullText' in cstNode) {\n                    cst = new RootCstNodeImpl(cstNode.fullText);\n                    root = cst;\n                }\n                else if ('content' in cstNode) {\n                    cst = new CompositeCstNodeImpl();\n                }\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    hydrateAstNode(node, context) {\n        const astNode = context.astNodes.get(node);\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 = [];\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                    }\n                    else if (isReference(item)) {\n                        arr.push(this.hydrateReference(item, astNode, name, context));\n                    }\n                    else {\n                        arr.push(item);\n                    }\n                }\n            }\n            else if (isAstNode(value)) {\n                astNode[name] = this.setParent(this.hydrateAstNode(value, context), astNode);\n            }\n            else if (isReference(value)) {\n                astNode[name] = this.hydrateReference(value, astNode, name, context);\n            }\n            else if (value !== undefined) {\n                astNode[name] = value;\n            }\n        }\n        return astNode;\n    }\n    setParent(node, parent) {\n        node.$container = parent;\n        return node;\n    }\n    hydrateReference(reference, node, name, context) {\n        return this.linker.buildReference(node, name, context.cstNodes.get(reference.$refNode), reference.$refText);\n    }\n    hydrateCstNode(cstNode, context, num = 0) {\n        const cstNodeObj = context.cstNodes.get(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    hydrateCstLeafNode(cstNode) {\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(offset, length, {\n            start: {\n                line: startLine,\n                character: startColumn\n            },\n            end: {\n                line: endLine,\n                character: endColumn\n            }\n        }, tokenType, hidden);\n        return node;\n    }\n    getTokenType(name) {\n        return this.lexer.definition[name];\n    }\n    getGrammarElementId(node) {\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    getGrammarElement(id) {\n        if (this.grammarElementIdMap.size === 0) {\n            this.createGrammarElementIdMap();\n        }\n        const element = this.grammarElementIdMap.getKey(id);\n        return element;\n    }\n    createGrammarElementIdMap() {\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//# sourceMappingURL=hydrator.js.map","/******************************************************************************\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******************************************************************************/\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 * 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) {\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 * 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) {\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//# sourceMappingURL=default-module.js.map","/******************************************************************************\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 ******************************************************************************/\nexport var Module;\n(function (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    Module.merge = (m1, m2) => _merge(_merge({}, m1), m2);\n})(Module || (Module = {}));\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(module1, module2, module3, module4, module5, module6, module7, module8, module9) {\n    const module = [module1, module2, module3, module4, module5, module6, module7, module8, module9].reduce(_merge, {});\n    return _inject(module);\n}\nconst isProxy = Symbol('isProxy');\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(item) {\n    if (item && item[isProxy]) {\n        for (const value of Object.values(item)) {\n            eagerLoad(value);\n        }\n    }\n    return item;\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(module, injector) {\n    const proxy = new Proxy({}, {\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            }\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 * 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 * 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(obj, prop, module, injector) {\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    }\n    else if (prop in module) {\n        const value = module[prop];\n        obj[prop] = __requested__;\n        try {\n            obj[prop] = (typeof value === 'function') ? value(injector) : _inject(value, injector);\n        }\n        catch (error) {\n            obj[prop] = error instanceof Error ? error : undefined;\n            throw error;\n        }\n        return obj[prop];\n    }\n    else {\n        return undefined;\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, source) {\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                    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                    }\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                }\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//# sourceMappingURL=dependency-injection.js.map","/******************************************************************************\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 ******************************************************************************/\nexport class EmptyFileSystemProvider {\n    stat(_uri) {\n        throw new Error('No file system is available.');\n    }\n    statSync(_uri) {\n        throw new Error('No file system is available.');\n    }\n    async exists() {\n        return false;\n    }\n    existsSync() {\n        return false;\n    }\n    readBinary() {\n        throw new Error('No file system is available.');\n    }\n    readBinarySync() {\n        throw new Error('No file system is available.');\n    }\n    readFile() {\n        throw new Error('No file system is available.');\n    }\n    readFileSync() {\n        throw new Error('No file system is available.');\n    }\n    async readDirectory() {\n        return [];\n    }\n    readDirectorySync() {\n        return [];\n    }\n}\nexport const EmptyFileSystem = {\n    fileSystemProvider: () => new EmptyFileSystemProvider()\n};\n//# sourceMappingURL=file-system-provider.js.map","/******************************************************************************\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 ******************************************************************************/\nimport { createDefaultCoreModule, createDefaultSharedCoreModule } from '../default-module.js';\nimport { inject } from '../dependency-injection.js';\nimport * as ast from '../languages/generated/ast.js';\nimport { EmptyFileSystem } from '../workspace/file-system-provider.js';\nimport { URI } from './uri-utils.js';\nconst minimalGrammarModule = {\n    Grammar: () => undefined,\n    LanguageMetaData: () => ({\n        caseInsensitive: false,\n        fileExtensions: ['.langium'],\n        languageId: 'langium'\n    })\n};\nconst minimalSharedGrammarModule = {\n    AstReflection: () => new ast.LangiumGrammarAstReflection()\n};\nfunction createMinimalGrammarServices() {\n    const shared = inject(createDefaultSharedCoreModule(EmptyFileSystem), minimalSharedGrammarModule);\n    const grammar = inject(createDefaultCoreModule({ shared }), minimalGrammarModule);\n    shared.ServiceRegistry.register(grammar);\n    return grammar;\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) {\n    const services = createMinimalGrammarServices();\n    const astNode = services.serializer.JsonSerializer.deserialize(json);\n    services.shared.workspace.LangiumDocumentFactory.fromModel(astNode, URI.parse(`memory:/${astNode.name ?? 'grammar'}.langium`));\n    return astNode;\n}\n//# sourceMappingURL=grammar-loader.js.map","var __defProp = Object.defineProperty;\nvar __name = (target, value) => __defProp(target, \"name\", { value, configurable: true });\n\n// src/language/generated/ast.ts\nimport * as langium from \"langium\";\nvar ArchitectureGrammar;\n((ArchitectureGrammar2) => {\n  ArchitectureGrammar2.Terminals = {\n    ARROW_DIRECTION: /L|R|T|B/,\n    ARROW_GROUP: /\\{group\\}/,\n    ARROW_INTO: /<|>/,\n    ACC_DESCR: /[\\t ]*accDescr(?:[\\t ]*:([^\\n\\r]*?(?=%%)|[^\\n\\r]*)|\\s*{([^}]*)})/,\n    ACC_TITLE: /[\\t ]*accTitle[\\t ]*:(?:[^\\n\\r]*?(?=%%)|[^\\n\\r]*)/,\n    TITLE: /[\\t ]*title(?:[\\t ][^\\n\\r]*?(?=%%)|[\\t ][^\\n\\r]*|)/,\n    STRING: /\"([^\"\\\\]|\\\\.)*\"|'([^'\\\\]|\\\\.)*'/,\n    ID: /[\\w]([-\\w]*\\w)?/,\n    NEWLINE: /\\r?\\n/,\n    WHITESPACE: /[\\t ]+/,\n    YAML: /---[\\t ]*\\r?\\n(?:[\\S\\s]*?\\r?\\n)?---(?:\\r?\\n|(?!\\S))/,\n    DIRECTIVE: /[\\t ]*%%{[\\S\\s]*?}%%(?:\\r?\\n|(?!\\S))/,\n    SINGLE_LINE_COMMENT: /[\\t ]*%%[^\\n\\r]*/,\n    ARCH_ICON: /\\([\\w-:]+\\)/,\n    ARCH_TITLE: /\\[[\\w ]+\\]/\n  };\n})(ArchitectureGrammar || (ArchitectureGrammar = {}));\nvar GitGraphGrammar;\n((GitGraphGrammar2) => {\n  GitGraphGrammar2.Terminals = {\n    ACC_DESCR: /[\\t ]*accDescr(?:[\\t ]*:([^\\n\\r]*?(?=%%)|[^\\n\\r]*)|\\s*{([^}]*)})/,\n    ACC_TITLE: /[\\t ]*accTitle[\\t ]*:(?:[^\\n\\r]*?(?=%%)|[^\\n\\r]*)/,\n    TITLE: /[\\t ]*title(?:[\\t ][^\\n\\r]*?(?=%%)|[\\t ][^\\n\\r]*|)/,\n    INT: /0|[1-9][0-9]*(?!\\.)/,\n    STRING: /\"([^\"\\\\]|\\\\.)*\"|'([^'\\\\]|\\\\.)*'/,\n    NEWLINE: /\\r?\\n/,\n    WHITESPACE: /[\\t ]+/,\n    YAML: /---[\\t ]*\\r?\\n(?:[\\S\\s]*?\\r?\\n)?---(?:\\r?\\n|(?!\\S))/,\n    DIRECTIVE: /[\\t ]*%%{[\\S\\s]*?}%%(?:\\r?\\n|(?!\\S))/,\n    SINGLE_LINE_COMMENT: /[\\t ]*%%[^\\n\\r]*/,\n    REFERENCE: /\\w([-\\./\\w]*[-\\w])?/\n  };\n})(GitGraphGrammar || (GitGraphGrammar = {}));\nvar InfoGrammar;\n((InfoGrammar2) => {\n  InfoGrammar2.Terminals = {\n    ACC_DESCR: /[\\t ]*accDescr(?:[\\t ]*:([^\\n\\r]*?(?=%%)|[^\\n\\r]*)|\\s*{([^}]*)})/,\n    ACC_TITLE: /[\\t ]*accTitle[\\t ]*:(?:[^\\n\\r]*?(?=%%)|[^\\n\\r]*)/,\n    TITLE: /[\\t ]*title(?:[\\t ][^\\n\\r]*?(?=%%)|[\\t ][^\\n\\r]*|)/,\n    NEWLINE: /\\r?\\n/,\n    WHITESPACE: /[\\t ]+/,\n    YAML: /---[\\t ]*\\r?\\n(?:[\\S\\s]*?\\r?\\n)?---(?:\\r?\\n|(?!\\S))/,\n    DIRECTIVE: /[\\t ]*%%{[\\S\\s]*?}%%(?:\\r?\\n|(?!\\S))/,\n    SINGLE_LINE_COMMENT: /[\\t ]*%%[^\\n\\r]*/\n  };\n})(InfoGrammar || (InfoGrammar = {}));\nvar PacketGrammar;\n((PacketGrammar2) => {\n  PacketGrammar2.Terminals = {\n    ACC_DESCR: /[\\t ]*accDescr(?:[\\t ]*:([^\\n\\r]*?(?=%%)|[^\\n\\r]*)|\\s*{([^}]*)})/,\n    ACC_TITLE: /[\\t ]*accTitle[\\t ]*:(?:[^\\n\\r]*?(?=%%)|[^\\n\\r]*)/,\n    TITLE: /[\\t ]*title(?:[\\t ][^\\n\\r]*?(?=%%)|[\\t ][^\\n\\r]*|)/,\n    INT: /0|[1-9][0-9]*(?!\\.)/,\n    STRING: /\"([^\"\\\\]|\\\\.)*\"|'([^'\\\\]|\\\\.)*'/,\n    NEWLINE: /\\r?\\n/,\n    WHITESPACE: /[\\t ]+/,\n    YAML: /---[\\t ]*\\r?\\n(?:[\\S\\s]*?\\r?\\n)?---(?:\\r?\\n|(?!\\S))/,\n    DIRECTIVE: /[\\t ]*%%{[\\S\\s]*?}%%(?:\\r?\\n|(?!\\S))/,\n    SINGLE_LINE_COMMENT: /[\\t ]*%%[^\\n\\r]*/\n  };\n})(PacketGrammar || (PacketGrammar = {}));\nvar PieGrammar;\n((PieGrammar2) => {\n  PieGrammar2.Terminals = {\n    NUMBER_PIE: /(?:-?[0-9]+\\.[0-9]+(?!\\.))|(?:-?(0|[1-9][0-9]*)(?!\\.))/,\n    ACC_DESCR: /[\\t ]*accDescr(?:[\\t ]*:([^\\n\\r]*?(?=%%)|[^\\n\\r]*)|\\s*{([^}]*)})/,\n    ACC_TITLE: /[\\t ]*accTitle[\\t ]*:(?:[^\\n\\r]*?(?=%%)|[^\\n\\r]*)/,\n    TITLE: /[\\t ]*title(?:[\\t ][^\\n\\r]*?(?=%%)|[\\t ][^\\n\\r]*|)/,\n    STRING: /\"([^\"\\\\]|\\\\.)*\"|'([^'\\\\]|\\\\.)*'/,\n    NEWLINE: /\\r?\\n/,\n    WHITESPACE: /[\\t ]+/,\n    YAML: /---[\\t ]*\\r?\\n(?:[\\S\\s]*?\\r?\\n)?---(?:\\r?\\n|(?!\\S))/,\n    DIRECTIVE: /[\\t ]*%%{[\\S\\s]*?}%%(?:\\r?\\n|(?!\\S))/,\n    SINGLE_LINE_COMMENT: /[\\t ]*%%[^\\n\\r]*/\n  };\n})(PieGrammar || (PieGrammar = {}));\nvar RadarGrammar;\n((RadarGrammar2) => {\n  RadarGrammar2.Terminals = {\n    GRATICULE: /circle|polygon/,\n    BOOLEAN: /true|false/,\n    ACC_DESCR: /[\\t ]*accDescr(?:[\\t ]*:([^\\n\\r]*?(?=%%)|[^\\n\\r]*)|\\s*{([^}]*)})/,\n    ACC_TITLE: /[\\t ]*accTitle[\\t ]*:(?:[^\\n\\r]*?(?=%%)|[^\\n\\r]*)/,\n    TITLE: /[\\t ]*title(?:[\\t ][^\\n\\r]*?(?=%%)|[\\t ][^\\n\\r]*|)/,\n    NUMBER: /(?:[0-9]+\\.[0-9]+(?!\\.))|(?:0|[1-9][0-9]*(?!\\.))/,\n    STRING: /\"([^\"\\\\]|\\\\.)*\"|'([^'\\\\]|\\\\.)*'/,\n    ID: /[\\w]([-\\w]*\\w)?/,\n    NEWLINE: /\\r?\\n/,\n    WHITESPACE: /[\\t ]+/,\n    YAML: /---[\\t ]*\\r?\\n(?:[\\S\\s]*?\\r?\\n)?---(?:\\r?\\n|(?!\\S))/,\n    DIRECTIVE: /[\\t ]*%%{[\\S\\s]*?}%%(?:\\r?\\n|(?!\\S))/,\n    SINGLE_LINE_COMMENT: /[\\t ]*%%[^\\n\\r]*/\n  };\n})(RadarGrammar || (RadarGrammar = {}));\nvar TreemapGrammar;\n((TreemapGrammar2) => {\n  TreemapGrammar2.Terminals = {\n    ACC_DESCR: /[\\t ]*accDescr(?:[\\t ]*:([^\\n\\r]*?(?=%%)|[^\\n\\r]*)|\\s*{([^}]*)})/,\n    ACC_TITLE: /[\\t ]*accTitle[\\t ]*:(?:[^\\n\\r]*?(?=%%)|[^\\n\\r]*)/,\n    TITLE: /[\\t ]*title(?:[\\t ][^\\n\\r]*?(?=%%)|[\\t ][^\\n\\r]*|)/,\n    TREEMAP_KEYWORD: /treemap-beta|treemap/,\n    CLASS_DEF: /classDef\\s+([a-zA-Z_][a-zA-Z0-9_]+)(?:\\s+([^;\\r\\n]*))?(?:;)?/,\n    STYLE_SEPARATOR: /:::/,\n    SEPARATOR: /:/,\n    COMMA: /,/,\n    INDENTATION: /[ \\t]{1,}/,\n    WS: /[ \\t]+/,\n    ML_COMMENT: /\\%\\%[^\\n]*/,\n    NL: /\\r?\\n/,\n    ID2: /[a-zA-Z_][a-zA-Z0-9_]*/,\n    NUMBER2: /[0-9_\\.\\,]+/,\n    STRING2: /\"[^\"]*\"|'[^']*'/\n  };\n})(TreemapGrammar || (TreemapGrammar = {}));\nvar MermaidTerminals = {\n  ...ArchitectureGrammar.Terminals,\n  ...GitGraphGrammar.Terminals,\n  ...InfoGrammar.Terminals,\n  ...PacketGrammar.Terminals,\n  ...PieGrammar.Terminals,\n  ...RadarGrammar.Terminals,\n  ...TreemapGrammar.Terminals\n};\nvar Architecture = {\n  $type: \"Architecture\",\n  accDescr: \"accDescr\",\n  accTitle: \"accTitle\",\n  edges: \"edges\",\n  groups: \"groups\",\n  junctions: \"junctions\",\n  services: \"services\",\n  title: \"title\"\n};\nfunction isArchitecture(item) {\n  return reflection.isInstance(item, Architecture.$type);\n}\n__name(isArchitecture, \"isArchitecture\");\nvar Axis = {\n  $type: \"Axis\",\n  label: \"label\",\n  name: \"name\"\n};\nvar Branch = {\n  $type: \"Branch\",\n  name: \"name\",\n  order: \"order\"\n};\nfunction isBranch(item) {\n  return reflection.isInstance(item, Branch.$type);\n}\n__name(isBranch, \"isBranch\");\nvar Checkout = {\n  $type: \"Checkout\",\n  branch: \"branch\"\n};\nvar CherryPicking = {\n  $type: \"CherryPicking\",\n  id: \"id\",\n  parent: \"parent\",\n  tags: \"tags\"\n};\nvar ClassDefStatement = {\n  $type: \"ClassDefStatement\",\n  className: \"className\",\n  styleText: \"styleText\"\n};\nvar Commit = {\n  $type: \"Commit\",\n  id: \"id\",\n  message: \"message\",\n  tags: \"tags\",\n  type: \"type\"\n};\nfunction isCommit(item) {\n  return reflection.isInstance(item, Commit.$type);\n}\n__name(isCommit, \"isCommit\");\nvar Curve = {\n  $type: \"Curve\",\n  entries: \"entries\",\n  label: \"label\",\n  name: \"name\"\n};\nvar Direction = {\n  $type: \"Direction\",\n  accDescr: \"accDescr\",\n  accTitle: \"accTitle\",\n  dir: \"dir\",\n  statements: \"statements\",\n  title: \"title\"\n};\nvar Edge = {\n  $type: \"Edge\",\n  lhsDir: \"lhsDir\",\n  lhsGroup: \"lhsGroup\",\n  lhsId: \"lhsId\",\n  lhsInto: \"lhsInto\",\n  rhsDir: \"rhsDir\",\n  rhsGroup: \"rhsGroup\",\n  rhsId: \"rhsId\",\n  rhsInto: \"rhsInto\",\n  title: \"title\"\n};\nvar Entry = {\n  $type: \"Entry\",\n  axis: \"axis\",\n  value: \"value\"\n};\nvar GitGraph = {\n  $type: \"GitGraph\",\n  accDescr: \"accDescr\",\n  accTitle: \"accTitle\",\n  statements: \"statements\",\n  title: \"title\"\n};\nfunction isGitGraph(item) {\n  return reflection.isInstance(item, GitGraph.$type);\n}\n__name(isGitGraph, \"isGitGraph\");\nvar Group = {\n  $type: \"Group\",\n  icon: \"icon\",\n  id: \"id\",\n  in: \"in\",\n  title: \"title\"\n};\nvar Info = {\n  $type: \"Info\",\n  accDescr: \"accDescr\",\n  accTitle: \"accTitle\",\n  title: \"title\"\n};\nfunction isInfo(item) {\n  return reflection.isInstance(item, Info.$type);\n}\n__name(isInfo, \"isInfo\");\nvar Item = {\n  $type: \"Item\",\n  classSelector: \"classSelector\",\n  name: \"name\"\n};\nvar Junction = {\n  $type: \"Junction\",\n  id: \"id\",\n  in: \"in\"\n};\nvar Leaf = {\n  $type: \"Leaf\",\n  classSelector: \"classSelector\",\n  name: \"name\",\n  value: \"value\"\n};\nvar Merge = {\n  $type: \"Merge\",\n  branch: \"branch\",\n  id: \"id\",\n  tags: \"tags\",\n  type: \"type\"\n};\nfunction isMerge(item) {\n  return reflection.isInstance(item, Merge.$type);\n}\n__name(isMerge, \"isMerge\");\nvar Option = {\n  $type: \"Option\",\n  name: \"name\",\n  value: \"value\"\n};\nvar Packet = {\n  $type: \"Packet\",\n  accDescr: \"accDescr\",\n  accTitle: \"accTitle\",\n  blocks: \"blocks\",\n  title: \"title\"\n};\nfunction isPacket(item) {\n  return reflection.isInstance(item, Packet.$type);\n}\n__name(isPacket, \"isPacket\");\nvar PacketBlock = {\n  $type: \"PacketBlock\",\n  bits: \"bits\",\n  end: \"end\",\n  label: \"label\",\n  start: \"start\"\n};\nfunction isPacketBlock(item) {\n  return reflection.isInstance(item, PacketBlock.$type);\n}\n__name(isPacketBlock, \"isPacketBlock\");\nvar Pie = {\n  $type: \"Pie\",\n  accDescr: \"accDescr\",\n  accTitle: \"accTitle\",\n  sections: \"sections\",\n  showData: \"showData\",\n  title: \"title\"\n};\nfunction isPie(item) {\n  return reflection.isInstance(item, Pie.$type);\n}\n__name(isPie, \"isPie\");\nvar PieSection = {\n  $type: \"PieSection\",\n  label: \"label\",\n  value: \"value\"\n};\nfunction isPieSection(item) {\n  return reflection.isInstance(item, PieSection.$type);\n}\n__name(isPieSection, \"isPieSection\");\nvar Radar = {\n  $type: \"Radar\",\n  accDescr: \"accDescr\",\n  accTitle: \"accTitle\",\n  axes: \"axes\",\n  curves: \"curves\",\n  options: \"options\",\n  title: \"title\"\n};\nvar Section = {\n  $type: \"Section\",\n  classSelector: \"classSelector\",\n  name: \"name\"\n};\nvar Service = {\n  $type: \"Service\",\n  icon: \"icon\",\n  iconText: \"iconText\",\n  id: \"id\",\n  in: \"in\",\n  title: \"title\"\n};\nvar Statement = {\n  $type: \"Statement\"\n};\nvar Treemap = {\n  $type: \"Treemap\",\n  accDescr: \"accDescr\",\n  accTitle: \"accTitle\",\n  title: \"title\",\n  TreemapRows: \"TreemapRows\"\n};\nfunction isTreemap(item) {\n  return reflection.isInstance(item, Treemap.$type);\n}\n__name(isTreemap, \"isTreemap\");\nvar TreemapRow = {\n  $type: \"TreemapRow\",\n  indent: \"indent\",\n  item: \"item\"\n};\nvar MermaidAstReflection = class extends langium.AbstractAstReflection {\n  constructor() {\n    super(...arguments);\n    this.types = {\n      Architecture: {\n        name: Architecture.$type,\n        properties: {\n          accDescr: {\n            name: Architecture.accDescr\n          },\n          accTitle: {\n            name: Architecture.accTitle\n          },\n          edges: {\n            name: Architecture.edges,\n            defaultValue: []\n          },\n          groups: {\n            name: Architecture.groups,\n            defaultValue: []\n          },\n          junctions: {\n            name: Architecture.junctions,\n            defaultValue: []\n          },\n          services: {\n            name: Architecture.services,\n            defaultValue: []\n          },\n          title: {\n            name: Architecture.title\n          }\n        },\n        superTypes: []\n      },\n      Axis: {\n        name: Axis.$type,\n        properties: {\n          label: {\n            name: Axis.label\n          },\n          name: {\n            name: Axis.name\n          }\n        },\n        superTypes: []\n      },\n      Branch: {\n        name: Branch.$type,\n        properties: {\n          name: {\n            name: Branch.name\n          },\n          order: {\n            name: Branch.order\n          }\n        },\n        superTypes: [Statement.$type]\n      },\n      Checkout: {\n        name: Checkout.$type,\n        properties: {\n          branch: {\n            name: Checkout.branch\n          }\n        },\n        superTypes: [Statement.$type]\n      },\n      CherryPicking: {\n        name: CherryPicking.$type,\n        properties: {\n          id: {\n            name: CherryPicking.id\n          },\n          parent: {\n            name: CherryPicking.parent\n          },\n          tags: {\n            name: CherryPicking.tags,\n            defaultValue: []\n          }\n        },\n        superTypes: [Statement.$type]\n      },\n      ClassDefStatement: {\n        name: ClassDefStatement.$type,\n        properties: {\n          className: {\n            name: ClassDefStatement.className\n          },\n          styleText: {\n            name: ClassDefStatement.styleText\n          }\n        },\n        superTypes: []\n      },\n      Commit: {\n        name: Commit.$type,\n        properties: {\n          id: {\n            name: Commit.id\n          },\n          message: {\n            name: Commit.message\n          },\n          tags: {\n            name: Commit.tags,\n            defaultValue: []\n          },\n          type: {\n            name: Commit.type\n          }\n        },\n        superTypes: [Statement.$type]\n      },\n      Curve: {\n        name: Curve.$type,\n        properties: {\n          entries: {\n            name: Curve.entries,\n            defaultValue: []\n          },\n          label: {\n            name: Curve.label\n          },\n          name: {\n            name: Curve.name\n          }\n        },\n        superTypes: []\n      },\n      Direction: {\n        name: Direction.$type,\n        properties: {\n          accDescr: {\n            name: Direction.accDescr\n          },\n          accTitle: {\n            name: Direction.accTitle\n          },\n          dir: {\n            name: Direction.dir\n          },\n          statements: {\n            name: Direction.statements,\n            defaultValue: []\n          },\n          title: {\n            name: Direction.title\n          }\n        },\n        superTypes: [GitGraph.$type]\n      },\n      Edge: {\n        name: Edge.$type,\n        properties: {\n          lhsDir: {\n            name: Edge.lhsDir\n          },\n          lhsGroup: {\n            name: Edge.lhsGroup,\n            defaultValue: false\n          },\n          lhsId: {\n            name: Edge.lhsId\n          },\n          lhsInto: {\n            name: Edge.lhsInto,\n            defaultValue: false\n          },\n          rhsDir: {\n            name: Edge.rhsDir\n          },\n          rhsGroup: {\n            name: Edge.rhsGroup,\n            defaultValue: false\n          },\n          rhsId: {\n            name: Edge.rhsId\n          },\n          rhsInto: {\n            name: Edge.rhsInto,\n            defaultValue: false\n          },\n          title: {\n            name: Edge.title\n          }\n        },\n        superTypes: []\n      },\n      Entry: {\n        name: Entry.$type,\n        properties: {\n          axis: {\n            name: Entry.axis,\n            referenceType: Axis.$type\n          },\n          value: {\n            name: Entry.value\n          }\n        },\n        superTypes: []\n      },\n      GitGraph: {\n        name: GitGraph.$type,\n        properties: {\n          accDescr: {\n            name: GitGraph.accDescr\n          },\n          accTitle: {\n            name: GitGraph.accTitle\n          },\n          statements: {\n            name: GitGraph.statements,\n            defaultValue: []\n          },\n          title: {\n            name: GitGraph.title\n          }\n        },\n        superTypes: []\n      },\n      Group: {\n        name: Group.$type,\n        properties: {\n          icon: {\n            name: Group.icon\n          },\n          id: {\n            name: Group.id\n          },\n          in: {\n            name: Group.in\n          },\n          title: {\n            name: Group.title\n          }\n        },\n        superTypes: []\n      },\n      Info: {\n        name: Info.$type,\n        properties: {\n          accDescr: {\n            name: Info.accDescr\n          },\n          accTitle: {\n            name: Info.accTitle\n          },\n          title: {\n            name: Info.title\n          }\n        },\n        superTypes: []\n      },\n      Item: {\n        name: Item.$type,\n        properties: {\n          classSelector: {\n            name: Item.classSelector\n          },\n          name: {\n            name: Item.name\n          }\n        },\n        superTypes: []\n      },\n      Junction: {\n        name: Junction.$type,\n        properties: {\n          id: {\n            name: Junction.id\n          },\n          in: {\n            name: Junction.in\n          }\n        },\n        superTypes: []\n      },\n      Leaf: {\n        name: Leaf.$type,\n        properties: {\n          classSelector: {\n            name: Leaf.classSelector\n          },\n          name: {\n            name: Leaf.name\n          },\n          value: {\n            name: Leaf.value\n          }\n        },\n        superTypes: [Item.$type]\n      },\n      Merge: {\n        name: Merge.$type,\n        properties: {\n          branch: {\n            name: Merge.branch\n          },\n          id: {\n            name: Merge.id\n          },\n          tags: {\n            name: Merge.tags,\n            defaultValue: []\n          },\n          type: {\n            name: Merge.type\n          }\n        },\n        superTypes: [Statement.$type]\n      },\n      Option: {\n        name: Option.$type,\n        properties: {\n          name: {\n            name: Option.name\n          },\n          value: {\n            name: Option.value,\n            defaultValue: false\n          }\n        },\n        superTypes: []\n      },\n      Packet: {\n        name: Packet.$type,\n        properties: {\n          accDescr: {\n            name: Packet.accDescr\n          },\n          accTitle: {\n            name: Packet.accTitle\n          },\n          blocks: {\n            name: Packet.blocks,\n            defaultValue: []\n          },\n          title: {\n            name: Packet.title\n          }\n        },\n        superTypes: []\n      },\n      PacketBlock: {\n        name: PacketBlock.$type,\n        properties: {\n          bits: {\n            name: PacketBlock.bits\n          },\n          end: {\n            name: PacketBlock.end\n          },\n          label: {\n            name: PacketBlock.label\n          },\n          start: {\n            name: PacketBlock.start\n          }\n        },\n        superTypes: []\n      },\n      Pie: {\n        name: Pie.$type,\n        properties: {\n          accDescr: {\n            name: Pie.accDescr\n          },\n          accTitle: {\n            name: Pie.accTitle\n          },\n          sections: {\n            name: Pie.sections,\n            defaultValue: []\n          },\n          showData: {\n            name: Pie.showData,\n            defaultValue: false\n          },\n          title: {\n            name: Pie.title\n          }\n        },\n        superTypes: []\n      },\n      PieSection: {\n        name: PieSection.$type,\n        properties: {\n          label: {\n            name: PieSection.label\n          },\n          value: {\n            name: PieSection.value\n          }\n        },\n        superTypes: []\n      },\n      Radar: {\n        name: Radar.$type,\n        properties: {\n          accDescr: {\n            name: Radar.accDescr\n          },\n          accTitle: {\n            name: Radar.accTitle\n          },\n          axes: {\n            name: Radar.axes,\n            defaultValue: []\n          },\n          curves: {\n            name: Radar.curves,\n            defaultValue: []\n          },\n          options: {\n            name: Radar.options,\n            defaultValue: []\n          },\n          title: {\n            name: Radar.title\n          }\n        },\n        superTypes: []\n      },\n      Section: {\n        name: Section.$type,\n        properties: {\n          classSelector: {\n            name: Section.classSelector\n          },\n          name: {\n            name: Section.name\n          }\n        },\n        superTypes: [Item.$type]\n      },\n      Service: {\n        name: Service.$type,\n        properties: {\n          icon: {\n            name: Service.icon\n          },\n          iconText: {\n            name: Service.iconText\n          },\n          id: {\n            name: Service.id\n          },\n          in: {\n            name: Service.in\n          },\n          title: {\n            name: Service.title\n          }\n        },\n        superTypes: []\n      },\n      Statement: {\n        name: Statement.$type,\n        properties: {},\n        superTypes: []\n      },\n      Treemap: {\n        name: Treemap.$type,\n        properties: {\n          accDescr: {\n            name: Treemap.accDescr\n          },\n          accTitle: {\n            name: Treemap.accTitle\n          },\n          title: {\n            name: Treemap.title\n          },\n          TreemapRows: {\n            name: Treemap.TreemapRows,\n            defaultValue: []\n          }\n        },\n        superTypes: []\n      },\n      TreemapRow: {\n        name: TreemapRow.$type,\n        properties: {\n          indent: {\n            name: TreemapRow.indent\n          },\n          item: {\n            name: TreemapRow.item\n          }\n        },\n        superTypes: []\n      }\n    };\n  }\n  static {\n    __name(this, \"MermaidAstReflection\");\n  }\n};\nvar reflection = new MermaidAstReflection();\n\n// src/language/generated/grammar.ts\nimport { loadGrammarFromJson } from \"langium\";\nvar loadedArchitectureGrammarGrammar;\nvar ArchitectureGrammarGrammar = /* @__PURE__ */ __name(() => loadedArchitectureGrammarGrammar ?? (loadedArchitectureGrammarGrammar = loadGrammarFromJson(`{\"$type\":\"Grammar\",\"isDeclared\":true,\"name\":\"ArchitectureGrammar\",\"imports\":[],\"rules\":[{\"$type\":\"ParserRule\",\"entry\":true,\"name\":\"Architecture\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@23\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Keyword\",\"value\":\"architecture-beta\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@23\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@13\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@1\"},\"arguments\":[]}],\"cardinality\":\"*\"}]},\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"Statement\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"groups\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@5\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"services\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@6\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"junctions\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@7\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"edges\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}}]},\"entry\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"LeftPort\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\":\"},{\"$type\":\"Assignment\",\"feature\":\"lhsDir\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]}}]},\"entry\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"RightPort\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"rhsDir\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]}},{\"$type\":\"Keyword\",\"value\":\":\"}]},\"entry\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"Arrow\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"arguments\":[]},{\"$type\":\"Assignment\",\"feature\":\"lhsInto\",\"operator\":\"?=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"arguments\":[]},\"cardinality\":\"?\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"--\"},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"-\"},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@29\"},\"arguments\":[]}},{\"$type\":\"Keyword\",\"value\":\"-\"}]}]},{\"$type\":\"Assignment\",\"feature\":\"rhsInto\",\"operator\":\"?=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"arguments\":[]},\"cardinality\":\"?\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@3\"},\"arguments\":[]}]},\"entry\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Group\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"group\"},{\"$type\":\"Assignment\",\"feature\":\"id\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"icon\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@28\"},\"arguments\":[]},\"cardinality\":\"?\"},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@29\"},\"arguments\":[]},\"cardinality\":\"?\"},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"in\"},{\"$type\":\"Assignment\",\"feature\":\"in\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}}],\"cardinality\":\"?\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Service\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"service\"},{\"$type\":\"Assignment\",\"feature\":\"id\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"iconText\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@21\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"icon\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@28\"},\"arguments\":[]}}],\"cardinality\":\"?\"},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@29\"},\"arguments\":[]},\"cardinality\":\"?\"},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"in\"},{\"$type\":\"Assignment\",\"feature\":\"in\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}}],\"cardinality\":\"?\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Junction\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"junction\"},{\"$type\":\"Assignment\",\"feature\":\"id\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"in\"},{\"$type\":\"Assignment\",\"feature\":\"in\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}}],\"cardinality\":\"?\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Edge\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"lhsId\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"lhsGroup\",\"operator\":\"?=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@10\"},\"arguments\":[]},\"cardinality\":\"?\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@4\"},\"arguments\":[]},{\"$type\":\"Assignment\",\"feature\":\"rhsId\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"rhsGroup\",\"operator\":\"?=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@10\"},\"arguments\":[]},\"cardinality\":\"?\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"ARROW_DIRECTION\",\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"L\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"R\"},\"parenthesized\":false}],\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"T\"},\"parenthesized\":false}],\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"B\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ARROW_GROUP\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\{group\\\\\\\\}/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ARROW_INTO\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/<|>/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"ParserRule\",\"name\":\"EOL\",\"dataType\":\"string\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@23\"},\"arguments\":[],\"cardinality\":\"+\"},{\"$type\":\"EndOfFile\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"TitleAndAccessibilities\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"accDescr\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@15\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"accTitle\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@16\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[]}],\"cardinality\":\"+\"},\"entry\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"BOOLEAN\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"boolean\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"true\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"false\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_DESCR\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accDescr(?:[\\\\\\\\t ]*:([^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)|\\\\\\\\s*{([^}]*)})/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accTitle[\\\\\\\\t ]*:(?:[^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*title(?:[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*|)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"FLOAT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[0-9]+\\\\\\\\.[0-9]+(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"INT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/0|[1-9][0-9]*(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NUMBER\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@18\"},\"parenthesized\":false},{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@19\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"STRING\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\"([^\\\\\"\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*\\\\\"|'([^'\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*'/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ID\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\w]([-\\\\\\\\w]*\\\\\\\\w)?/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NEWLINE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\r?\\\\\\\\n/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"WHITESPACE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]+/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"YAML\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/---[\\\\\\\\t ]*\\\\\\\\r?\\\\\\\\n(?:[\\\\\\\\S\\\\\\\\s]*?\\\\\\\\r?\\\\\\\\n)?---(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"DIRECTIVE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%{[\\\\\\\\S\\\\\\\\s]*?}%%(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"SINGLE_LINE_COMMENT\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%[^\\\\\\\\n\\\\\\\\r]*/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"name\":\"ARCH_ICON\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\([\\\\\\\\w-:]+\\\\\\\\)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ARCH_TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\[[\\\\\\\\w ]+\\\\\\\\]/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false}],\"interfaces\":[],\"types\":[]}`)), \"ArchitectureGrammarGrammar\");\nvar loadedGitGraphGrammarGrammar;\nvar GitGraphGrammarGrammar = /* @__PURE__ */ __name(() => loadedGitGraphGrammarGrammar ?? (loadedGitGraphGrammarGrammar = loadGrammarFromJson(`{\"$type\":\"Grammar\",\"isDeclared\":true,\"name\":\"GitGraphGrammar\",\"imports\":[],\"rules\":[{\"$type\":\"ParserRule\",\"entry\":true,\"name\":\"GitGraph\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@19\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"gitGraph\"},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"gitGraph\"},{\"$type\":\"Keyword\",\"value\":\":\"}]},{\"$type\":\"Keyword\",\"value\":\"gitGraph:\"},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"gitGraph\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"arguments\":[]},{\"$type\":\"Keyword\",\"value\":\":\"}]}]},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@19\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]},{\"$type\":\"Assignment\",\"feature\":\"statements\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@1\"},\"arguments\":[]}}],\"cardinality\":\"*\"}]},\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Statement\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@3\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@4\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@5\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@6\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@7\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Direction\",\"definition\":{\"$type\":\"Assignment\",\"feature\":\"dir\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"LR\"},{\"$type\":\"Keyword\",\"value\":\"TB\"},{\"$type\":\"Keyword\",\"value\":\"BT\"}]}},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Commit\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"commit\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"id:\"},{\"$type\":\"Assignment\",\"feature\":\"id\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"msg:\",\"cardinality\":\"?\"},{\"$type\":\"Assignment\",\"feature\":\"message\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"tag:\"},{\"$type\":\"Assignment\",\"feature\":\"tags\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"type:\"},{\"$type\":\"Assignment\",\"feature\":\"type\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"NORMAL\"},{\"$type\":\"Keyword\",\"value\":\"REVERSE\"},{\"$type\":\"Keyword\",\"value\":\"HIGHLIGHT\"}]}}]}],\"cardinality\":\"*\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Branch\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"branch\"},{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@24\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"order:\"},{\"$type\":\"Assignment\",\"feature\":\"order\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@15\"},\"arguments\":[]}}],\"cardinality\":\"?\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Merge\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"merge\"},{\"$type\":\"Assignment\",\"feature\":\"branch\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@24\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}]}},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"id:\"},{\"$type\":\"Assignment\",\"feature\":\"id\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"tag:\"},{\"$type\":\"Assignment\",\"feature\":\"tags\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"type:\"},{\"$type\":\"Assignment\",\"feature\":\"type\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"NORMAL\"},{\"$type\":\"Keyword\",\"value\":\"REVERSE\"},{\"$type\":\"Keyword\",\"value\":\"HIGHLIGHT\"}]}}]}],\"cardinality\":\"*\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Checkout\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"checkout\"},{\"$type\":\"Keyword\",\"value\":\"switch\"}]},{\"$type\":\"Assignment\",\"feature\":\"branch\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@24\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"CherryPicking\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"cherry-pick\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"id:\"},{\"$type\":\"Assignment\",\"feature\":\"id\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"tag:\"},{\"$type\":\"Assignment\",\"feature\":\"tags\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"parent:\"},{\"$type\":\"Assignment\",\"feature\":\"parent\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]}],\"cardinality\":\"*\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"EOL\",\"dataType\":\"string\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@19\"},\"arguments\":[],\"cardinality\":\"+\"},{\"$type\":\"EndOfFile\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"TitleAndAccessibilities\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"accDescr\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"accTitle\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@13\"},\"arguments\":[]}}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}],\"cardinality\":\"+\"},\"entry\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"BOOLEAN\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"boolean\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"true\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"false\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_DESCR\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accDescr(?:[\\\\\\\\t ]*:([^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)|\\\\\\\\s*{([^}]*)})/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accTitle[\\\\\\\\t ]*:(?:[^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*title(?:[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*|)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"FLOAT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[0-9]+\\\\\\\\.[0-9]+(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"INT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/0|[1-9][0-9]*(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NUMBER\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@14\"},\"parenthesized\":false},{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@15\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"STRING\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\"([^\\\\\"\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*\\\\\"|'([^'\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*'/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ID\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\w]([-\\\\\\\\w]*\\\\\\\\w)?/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NEWLINE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\r?\\\\\\\\n/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"WHITESPACE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]+/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"YAML\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/---[\\\\\\\\t ]*\\\\\\\\r?\\\\\\\\n(?:[\\\\\\\\S\\\\\\\\s]*?\\\\\\\\r?\\\\\\\\n)?---(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"DIRECTIVE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%{[\\\\\\\\S\\\\\\\\s]*?}%%(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"SINGLE_LINE_COMMENT\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%[^\\\\\\\\n\\\\\\\\r]*/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"name\":\"REFERENCE\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\w([-\\\\\\\\./\\\\\\\\w]*[-\\\\\\\\w])?/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false}],\"interfaces\":[],\"types\":[]}`)), \"GitGraphGrammarGrammar\");\nvar loadedInfoGrammarGrammar;\nvar InfoGrammarGrammar = /* @__PURE__ */ __name(() => loadedInfoGrammarGrammar ?? (loadedInfoGrammarGrammar = loadGrammarFromJson(`{\"$type\":\"Grammar\",\"isDeclared\":true,\"name\":\"InfoGrammar\",\"imports\":[],\"rules\":[{\"$type\":\"ParserRule\",\"entry\":true,\"name\":\"Info\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Keyword\",\"value\":\"info\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"showInfo\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[],\"cardinality\":\"*\"}],\"cardinality\":\"?\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"arguments\":[],\"cardinality\":\"?\"}]},\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"EOL\",\"dataType\":\"string\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[],\"cardinality\":\"+\"},{\"$type\":\"EndOfFile\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"TitleAndAccessibilities\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"accDescr\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@4\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"accTitle\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@5\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@6\"},\"arguments\":[]}}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@1\"},\"arguments\":[]}],\"cardinality\":\"+\"},\"entry\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"BOOLEAN\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"boolean\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"true\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"false\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_DESCR\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accDescr(?:[\\\\\\\\t ]*:([^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)|\\\\\\\\s*{([^}]*)})/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accTitle[\\\\\\\\t ]*:(?:[^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*title(?:[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*|)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"FLOAT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[0-9]+\\\\\\\\.[0-9]+(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"INT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/0|[1-9][0-9]*(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NUMBER\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@7\"},\"parenthesized\":false},{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"STRING\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\"([^\\\\\"\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*\\\\\"|'([^'\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*'/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ID\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\w]([-\\\\\\\\w]*\\\\\\\\w)?/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NEWLINE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\r?\\\\\\\\n/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"WHITESPACE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]+/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"YAML\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/---[\\\\\\\\t ]*\\\\\\\\r?\\\\\\\\n(?:[\\\\\\\\S\\\\\\\\s]*?\\\\\\\\r?\\\\\\\\n)?---(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"DIRECTIVE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%{[\\\\\\\\S\\\\\\\\s]*?}%%(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"SINGLE_LINE_COMMENT\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%[^\\\\\\\\n\\\\\\\\r]*/\",\"parenthesized\":false},\"fragment\":false}],\"interfaces\":[],\"types\":[]}`)), \"InfoGrammarGrammar\");\nvar loadedPacketGrammarGrammar;\nvar PacketGrammarGrammar = /* @__PURE__ */ __name(() => loadedPacketGrammarGrammar ?? (loadedPacketGrammarGrammar = loadGrammarFromJson(`{\"$type\":\"Grammar\",\"isDeclared\":true,\"name\":\"PacketGrammar\",\"imports\":[],\"rules\":[{\"$type\":\"ParserRule\",\"entry\":true,\"name\":\"Packet\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@13\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"packet\"},{\"$type\":\"Keyword\",\"value\":\"packet-beta\"}]},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@3\"},\"arguments\":[]},{\"$type\":\"Assignment\",\"feature\":\"blocks\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@1\"},\"arguments\":[]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@13\"},\"arguments\":[]}],\"cardinality\":\"*\"}]},\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"PacketBlock\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"start\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"-\"},{\"$type\":\"Assignment\",\"feature\":\"end\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]}}],\"cardinality\":\"?\"}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"+\"},{\"$type\":\"Assignment\",\"feature\":\"bits\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]}}]}]},{\"$type\":\"Keyword\",\"value\":\":\"},{\"$type\":\"Assignment\",\"feature\":\"label\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"arguments\":[]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"EOL\",\"dataType\":\"string\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@13\"},\"arguments\":[],\"cardinality\":\"+\"},{\"$type\":\"EndOfFile\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"TitleAndAccessibilities\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"accDescr\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@5\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"accTitle\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@6\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@7\"},\"arguments\":[]}}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"arguments\":[]}],\"cardinality\":\"+\"},\"entry\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"BOOLEAN\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"boolean\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"true\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"false\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_DESCR\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accDescr(?:[\\\\\\\\t ]*:([^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)|\\\\\\\\s*{([^}]*)})/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accTitle[\\\\\\\\t ]*:(?:[^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*title(?:[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*|)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"FLOAT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[0-9]+\\\\\\\\.[0-9]+(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"INT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/0|[1-9][0-9]*(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NUMBER\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"parenthesized\":false},{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"STRING\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\"([^\\\\\"\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*\\\\\"|'([^'\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*'/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ID\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\w]([-\\\\\\\\w]*\\\\\\\\w)?/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NEWLINE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\r?\\\\\\\\n/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"WHITESPACE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]+/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"YAML\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/---[\\\\\\\\t ]*\\\\\\\\r?\\\\\\\\n(?:[\\\\\\\\S\\\\\\\\s]*?\\\\\\\\r?\\\\\\\\n)?---(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"DIRECTIVE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%{[\\\\\\\\S\\\\\\\\s]*?}%%(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"SINGLE_LINE_COMMENT\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%[^\\\\\\\\n\\\\\\\\r]*/\",\"parenthesized\":false},\"fragment\":false}],\"interfaces\":[],\"types\":[]}`)), \"PacketGrammarGrammar\");\nvar loadedPieGrammarGrammar;\nvar PieGrammarGrammar = /* @__PURE__ */ __name(() => loadedPieGrammarGrammar ?? (loadedPieGrammarGrammar = loadGrammarFromJson(`{\"$type\":\"Grammar\",\"isDeclared\":true,\"name\":\"PieGrammar\",\"imports\":[],\"rules\":[{\"$type\":\"ParserRule\",\"entry\":true,\"name\":\"Pie\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@16\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Keyword\",\"value\":\"pie\"},{\"$type\":\"Assignment\",\"feature\":\"showData\",\"operator\":\"?=\",\"terminal\":{\"$type\":\"Keyword\",\"value\":\"showData\"},\"cardinality\":\"?\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@6\"},\"arguments\":[]},{\"$type\":\"Assignment\",\"feature\":\"sections\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@1\"},\"arguments\":[]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@16\"},\"arguments\":[]}],\"cardinality\":\"*\"}]},\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"PieSection\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"label\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@14\"},\"arguments\":[]}},{\"$type\":\"Keyword\",\"value\":\":\"},{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@4\"},\"arguments\":[]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@5\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"FLOAT_PIE\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/-?[0-9]+\\\\\\\\.[0-9]+(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"INT_PIE\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/-?(0|[1-9][0-9]*)(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NUMBER_PIE\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"parenthesized\":false},{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@3\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"ParserRule\",\"name\":\"EOL\",\"dataType\":\"string\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@16\"},\"arguments\":[],\"cardinality\":\"+\"},{\"$type\":\"EndOfFile\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"TitleAndAccessibilities\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"accDescr\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"accTitle\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@10\"},\"arguments\":[]}}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@5\"},\"arguments\":[]}],\"cardinality\":\"+\"},\"entry\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"BOOLEAN\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"boolean\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"true\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"false\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_DESCR\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accDescr(?:[\\\\\\\\t ]*:([^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)|\\\\\\\\s*{([^}]*)})/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accTitle[\\\\\\\\t ]*:(?:[^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*title(?:[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*|)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"FLOAT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[0-9]+\\\\\\\\.[0-9]+(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"INT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/0|[1-9][0-9]*(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NUMBER\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"parenthesized\":false},{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"STRING\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\"([^\\\\\"\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*\\\\\"|'([^'\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*'/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ID\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\w]([-\\\\\\\\w]*\\\\\\\\w)?/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NEWLINE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\r?\\\\\\\\n/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"WHITESPACE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]+/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"YAML\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/---[\\\\\\\\t ]*\\\\\\\\r?\\\\\\\\n(?:[\\\\\\\\S\\\\\\\\s]*?\\\\\\\\r?\\\\\\\\n)?---(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"DIRECTIVE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%{[\\\\\\\\S\\\\\\\\s]*?}%%(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"SINGLE_LINE_COMMENT\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%[^\\\\\\\\n\\\\\\\\r]*/\",\"parenthesized\":false},\"fragment\":false}],\"interfaces\":[],\"types\":[]}`)), \"PieGrammarGrammar\");\nvar loadedRadarGrammarGrammar;\nvar RadarGrammarGrammar = /* @__PURE__ */ __name(() => loadedRadarGrammarGrammar ?? (loadedRadarGrammarGrammar = loadGrammarFromJson(`{\"$type\":\"Grammar\",\"isDeclared\":true,\"name\":\"RadarGrammar\",\"imports\":[],\"rules\":[{\"$type\":\"ParserRule\",\"entry\":true,\"name\":\"Radar\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"radar-beta\"},{\"$type\":\"Keyword\",\"value\":\"radar-beta:\"},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"radar-beta\"},{\"$type\":\"Keyword\",\"value\":\":\"}]}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@10\"},\"arguments\":[]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"axis\"},{\"$type\":\"Assignment\",\"feature\":\"axes\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\",\"},{\"$type\":\"Assignment\",\"feature\":\"axes\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"arguments\":[]}}],\"cardinality\":\"*\"}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"curve\"},{\"$type\":\"Assignment\",\"feature\":\"curves\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@3\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\",\"},{\"$type\":\"Assignment\",\"feature\":\"curves\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@3\"},\"arguments\":[]}}],\"cardinality\":\"*\"}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"options\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@7\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\",\"},{\"$type\":\"Assignment\",\"feature\":\"options\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@7\"},\"arguments\":[]}}],\"cardinality\":\"*\"}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[]}],\"cardinality\":\"*\"}]},\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"Label\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\"[\"},{\"$type\":\"Assignment\",\"feature\":\"label\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@18\"},\"arguments\":[]}},{\"$type\":\"Keyword\",\"value\":\"]\"}]},\"entry\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Axis\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@19\"},\"arguments\":[]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@1\"},\"arguments\":[],\"cardinality\":\"?\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Curve\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@19\"},\"arguments\":[]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@1\"},\"arguments\":[],\"cardinality\":\"?\"},{\"$type\":\"Keyword\",\"value\":\"{\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@4\"},\"arguments\":[]},{\"$type\":\"Keyword\",\"value\":\"}\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"Entries\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Assignment\",\"feature\":\"entries\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@6\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\",\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Assignment\",\"feature\":\"entries\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@6\"},\"arguments\":[]}}],\"cardinality\":\"*\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"*\"}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Assignment\",\"feature\":\"entries\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@5\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Keyword\",\"value\":\",\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"*\"},{\"$type\":\"Assignment\",\"feature\":\"entries\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@5\"},\"arguments\":[]}}],\"cardinality\":\"*\"},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"*\"}]}]},\"entry\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"DetailedEntry\",\"returnType\":{\"$ref\":\"#/interfaces@0\"},\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"axis\",\"operator\":\"=\",\"terminal\":{\"$type\":\"CrossReference\",\"type\":{\"$ref\":\"#/rules@2\"},\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@19\"},\"arguments\":[]},\"deprecatedSyntax\":false,\"isMulti\":false}},{\"$type\":\"Keyword\",\"value\":\":\",\"cardinality\":\"?\"},{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"NumberEntry\",\"returnType\":{\"$ref\":\"#/interfaces@0\"},\"definition\":{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Option\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Keyword\",\"value\":\"showLegend\"}},{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Keyword\",\"value\":\"ticks\"}},{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Keyword\",\"value\":\"max\"}},{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Keyword\",\"value\":\"min\"}},{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}}]},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"Keyword\",\"value\":\"graticule\"}},{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]}}]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"GRATICULE\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"circle\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"polygon\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"ParserRule\",\"name\":\"EOL\",\"dataType\":\"string\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[],\"cardinality\":\"+\"},{\"$type\":\"EndOfFile\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"TitleAndAccessibilities\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"accDescr\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@12\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"accTitle\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@13\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@14\"},\"arguments\":[]}}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]}],\"cardinality\":\"+\"},\"entry\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"BOOLEAN\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"boolean\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"true\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"false\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_DESCR\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accDescr(?:[\\\\\\\\t ]*:([^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)|\\\\\\\\s*{([^}]*)})/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accTitle[\\\\\\\\t ]*:(?:[^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*title(?:[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*|)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"FLOAT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[0-9]+\\\\\\\\.[0-9]+(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"INT\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/0|[1-9][0-9]*(?!\\\\\\\\.)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NUMBER\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"number\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@15\"},\"parenthesized\":false},{\"$type\":\"TerminalRuleCall\",\"rule\":{\"$ref\":\"#/rules@16\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"STRING\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\"([^\\\\\"\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*\\\\\"|'([^'\\\\\\\\\\\\\\\\]|\\\\\\\\\\\\\\\\.)*'/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ID\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"string\"},\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\w]([-\\\\\\\\w]*\\\\\\\\w)?/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NEWLINE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\r?\\\\\\\\n/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"WHITESPACE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]+/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"YAML\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/---[\\\\\\\\t ]*\\\\\\\\r?\\\\\\\\n(?:[\\\\\\\\S\\\\\\\\s]*?\\\\\\\\r?\\\\\\\\n)?---(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"DIRECTIVE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%{[\\\\\\\\S\\\\\\\\s]*?}%%(?:\\\\\\\\r?\\\\\\\\n|(?!\\\\\\\\S))/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"SINGLE_LINE_COMMENT\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*%%[^\\\\\\\\n\\\\\\\\r]*/\",\"parenthesized\":false},\"fragment\":false}],\"interfaces\":[{\"$type\":\"Interface\",\"name\":\"Entry\",\"attributes\":[{\"$type\":\"TypeAttribute\",\"name\":\"axis\",\"isOptional\":true,\"type\":{\"$type\":\"ReferenceType\",\"referenceType\":{\"$type\":\"SimpleType\",\"typeRef\":{\"$ref\":\"#/rules@2\"}},\"isMulti\":false}},{\"$type\":\"TypeAttribute\",\"name\":\"value\",\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"number\"},\"isOptional\":false}],\"superTypes\":[]}],\"types\":[]}`)), \"RadarGrammarGrammar\");\nvar loadedTreemapGrammarGrammar;\nvar TreemapGrammarGrammar = /* @__PURE__ */ __name(() => loadedTreemapGrammarGrammar ?? (loadedTreemapGrammarGrammar = loadGrammarFromJson(`{\"$type\":\"Grammar\",\"isDeclared\":true,\"name\":\"TreemapGrammar\",\"rules\":[{\"$type\":\"ParserRule\",\"fragment\":true,\"name\":\"TitleAndAccessibilities\",\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"accDescr\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@2\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"accTitle\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@3\"},\"arguments\":[]}},{\"$type\":\"Assignment\",\"feature\":\"title\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@4\"},\"arguments\":[]}}],\"cardinality\":\"+\"},\"entry\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"BOOLEAN\",\"type\":{\"$type\":\"ReturnType\",\"name\":\"boolean\"},\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"true\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"false\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_DESCR\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accDescr(?:[\\\\\\\\t ]*:([^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)|\\\\\\\\s*{([^}]*)})/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"ACC_TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*accTitle[\\\\\\\\t ]*:(?:[^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[^\\\\\\\\n\\\\\\\\r]*)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"TITLE\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[\\\\\\\\t ]*title(?:[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*?(?=%%)|[\\\\\\\\t ][^\\\\\\\\n\\\\\\\\r]*|)/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"ParserRule\",\"entry\":true,\"name\":\"Treemap\",\"returnType\":{\"$ref\":\"#/interfaces@4\"},\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@6\"},\"arguments\":[]},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@0\"},\"arguments\":[]},{\"$type\":\"Assignment\",\"feature\":\"TreemapRows\",\"operator\":\"+=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@15\"},\"arguments\":[]}}],\"cardinality\":\"*\"}]},\"fragment\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"TREEMAP_KEYWORD\",\"definition\":{\"$type\":\"TerminalAlternatives\",\"elements\":[{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"treemap-beta\"},\"parenthesized\":false},{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\"treemap\"},\"parenthesized\":false}],\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"CLASS_DEF\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/classDef\\\\\\\\s+([a-zA-Z_][a-zA-Z0-9_]+)(?:\\\\\\\\s+([^;\\\\\\\\r\\\\\\\\n]*))?(?:;)?/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"STYLE_SEPARATOR\",\"definition\":{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\":::\"},\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"SEPARATOR\",\"definition\":{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\":\"},\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"COMMA\",\"definition\":{\"$type\":\"CharacterRange\",\"left\":{\"$type\":\"Keyword\",\"value\":\",\"},\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"INDENTATION\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[ \\\\\\\\t]{1,}/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"WS\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[ \\\\\\\\t]+/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"ML_COMMENT\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\%\\\\\\\\%[^\\\\\\\\n]*/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"TerminalRule\",\"hidden\":true,\"name\":\"NL\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\\\\r?\\\\\\\\n/\",\"parenthesized\":false},\"fragment\":false},{\"$type\":\"ParserRule\",\"name\":\"TreemapRow\",\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"indent\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"arguments\":[]},\"cardinality\":\"?\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"item\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@17\"},\"arguments\":[]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@16\"},\"arguments\":[]}]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"ClassDef\",\"dataType\":\"string\",\"definition\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@7\"},\"arguments\":[]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Item\",\"returnType\":{\"$ref\":\"#/interfaces@0\"},\"definition\":{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@19\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@18\"},\"arguments\":[]}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Section\",\"returnType\":{\"$ref\":\"#/interfaces@1\"},\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@23\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]},{\"$type\":\"Assignment\",\"feature\":\"classSelector\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[]}}],\"cardinality\":\"?\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"ParserRule\",\"name\":\"Leaf\",\"returnType\":{\"$ref\":\"#/interfaces@2\"},\"definition\":{\"$type\":\"Group\",\"elements\":[{\"$type\":\"Assignment\",\"feature\":\"name\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@23\"},\"arguments\":[]}},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"arguments\":[],\"cardinality\":\"?\"},{\"$type\":\"Alternatives\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@9\"},\"arguments\":[]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@10\"},\"arguments\":[]}]},{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@11\"},\"arguments\":[],\"cardinality\":\"?\"},{\"$type\":\"Assignment\",\"feature\":\"value\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@22\"},\"arguments\":[]}},{\"$type\":\"Group\",\"elements\":[{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@8\"},\"arguments\":[]},{\"$type\":\"Assignment\",\"feature\":\"classSelector\",\"operator\":\"=\",\"terminal\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@20\"},\"arguments\":[]}}],\"cardinality\":\"?\"}]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"ID2\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[a-zA-Z_][a-zA-Z0-9_]*/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"TerminalRule\",\"name\":\"NUMBER2\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/[0-9_\\\\\\\\.\\\\\\\\,]+/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false},{\"$type\":\"ParserRule\",\"name\":\"MyNumber\",\"dataType\":\"number\",\"definition\":{\"$type\":\"RuleCall\",\"rule\":{\"$ref\":\"#/rules@21\"},\"arguments\":[]},\"entry\":false,\"fragment\":false,\"parameters\":[]},{\"$type\":\"TerminalRule\",\"name\":\"STRING2\",\"definition\":{\"$type\":\"RegexToken\",\"regex\":\"/\\\\\"[^\\\\\"]*\\\\\"|'[^']*'/\",\"parenthesized\":false},\"fragment\":false,\"hidden\":false}],\"interfaces\":[{\"$type\":\"Interface\",\"name\":\"Item\",\"attributes\":[{\"$type\":\"TypeAttribute\",\"name\":\"name\",\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"string\"},\"isOptional\":false},{\"$type\":\"TypeAttribute\",\"name\":\"classSelector\",\"isOptional\":true,\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"string\"}}],\"superTypes\":[]},{\"$type\":\"Interface\",\"name\":\"Section\",\"superTypes\":[{\"$ref\":\"#/interfaces@0\"}],\"attributes\":[]},{\"$type\":\"Interface\",\"name\":\"Leaf\",\"superTypes\":[{\"$ref\":\"#/interfaces@0\"}],\"attributes\":[{\"$type\":\"TypeAttribute\",\"name\":\"value\",\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"number\"},\"isOptional\":false}]},{\"$type\":\"Interface\",\"name\":\"ClassDefStatement\",\"attributes\":[{\"$type\":\"TypeAttribute\",\"name\":\"className\",\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"string\"},\"isOptional\":false},{\"$type\":\"TypeAttribute\",\"name\":\"styleText\",\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"string\"},\"isOptional\":false}],\"superTypes\":[]},{\"$type\":\"Interface\",\"name\":\"Treemap\",\"attributes\":[{\"$type\":\"TypeAttribute\",\"name\":\"TreemapRows\",\"type\":{\"$type\":\"ArrayType\",\"elementType\":{\"$type\":\"SimpleType\",\"typeRef\":{\"$ref\":\"#/rules@15\"}}},\"isOptional\":false},{\"$type\":\"TypeAttribute\",\"name\":\"title\",\"isOptional\":true,\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"string\"}},{\"$type\":\"TypeAttribute\",\"name\":\"accTitle\",\"isOptional\":true,\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"string\"}},{\"$type\":\"TypeAttribute\",\"name\":\"accDescr\",\"isOptional\":true,\"type\":{\"$type\":\"SimpleType\",\"primitiveType\":\"string\"}}],\"superTypes\":[]}],\"imports\":[],\"types\":[],\"$comment\":\"/**\\\\n * Treemap grammar for Langium\\\\n * Converted from mindmap grammar\\\\n *\\\\n * The ML_COMMENT and NL hidden terminals handle whitespace, comments, and newlines\\\\n * before the treemap keyword, allowing for empty lines and comments before the\\\\n * treemap declaration.\\\\n */\"}`)), \"TreemapGrammarGrammar\");\n\n// src/language/generated/module.ts\nvar ArchitectureGrammarLanguageMetaData = {\n  languageId: \"architecture\",\n  fileExtensions: [\".mmd\", \".mermaid\"],\n  caseInsensitive: false,\n  mode: \"production\"\n};\nvar GitGraphGrammarLanguageMetaData = {\n  languageId: \"gitGraph\",\n  fileExtensions: [\".mmd\", \".mermaid\"],\n  caseInsensitive: false,\n  mode: \"production\"\n};\nvar InfoGrammarLanguageMetaData = {\n  languageId: \"info\",\n  fileExtensions: [\".mmd\", \".mermaid\"],\n  caseInsensitive: false,\n  mode: \"production\"\n};\nvar PacketGrammarLanguageMetaData = {\n  languageId: \"packet\",\n  fileExtensions: [\".mmd\", \".mermaid\"],\n  caseInsensitive: false,\n  mode: \"production\"\n};\nvar PieGrammarLanguageMetaData = {\n  languageId: \"pie\",\n  fileExtensions: [\".mmd\", \".mermaid\"],\n  caseInsensitive: false,\n  mode: \"production\"\n};\nvar RadarGrammarLanguageMetaData = {\n  languageId: \"radar\",\n  fileExtensions: [\".mmd\", \".mermaid\"],\n  caseInsensitive: false,\n  mode: \"production\"\n};\nvar TreemapGrammarLanguageMetaData = {\n  languageId: \"treemap\",\n  fileExtensions: [\".mmd\", \".mermaid\"],\n  caseInsensitive: false,\n  mode: \"production\"\n};\nvar MermaidGeneratedSharedModule = {\n  AstReflection: /* @__PURE__ */ __name(() => new MermaidAstReflection(), \"AstReflection\")\n};\nvar ArchitectureGrammarGeneratedModule = {\n  Grammar: /* @__PURE__ */ __name(() => ArchitectureGrammarGrammar(), \"Grammar\"),\n  LanguageMetaData: /* @__PURE__ */ __name(() => ArchitectureGrammarLanguageMetaData, \"LanguageMetaData\"),\n  parser: {}\n};\nvar GitGraphGrammarGeneratedModule = {\n  Grammar: /* @__PURE__ */ __name(() => GitGraphGrammarGrammar(), \"Grammar\"),\n  LanguageMetaData: /* @__PURE__ */ __name(() => GitGraphGrammarLanguageMetaData, \"LanguageMetaData\"),\n  parser: {}\n};\nvar InfoGrammarGeneratedModule = {\n  Grammar: /* @__PURE__ */ __name(() => InfoGrammarGrammar(), \"Grammar\"),\n  LanguageMetaData: /* @__PURE__ */ __name(() => InfoGrammarLanguageMetaData, \"LanguageMetaData\"),\n  parser: {}\n};\nvar PacketGrammarGeneratedModule = {\n  Grammar: /* @__PURE__ */ __name(() => PacketGrammarGrammar(), \"Grammar\"),\n  LanguageMetaData: /* @__PURE__ */ __name(() => PacketGrammarLanguageMetaData, \"LanguageMetaData\"),\n  parser: {}\n};\nvar PieGrammarGeneratedModule = {\n  Grammar: /* @__PURE__ */ __name(() => PieGrammarGrammar(), \"Grammar\"),\n  LanguageMetaData: /* @__PURE__ */ __name(() => PieGrammarLanguageMetaData, \"LanguageMetaData\"),\n  parser: {}\n};\nvar RadarGrammarGeneratedModule = {\n  Grammar: /* @__PURE__ */ __name(() => RadarGrammarGrammar(), \"Grammar\"),\n  LanguageMetaData: /* @__PURE__ */ __name(() => RadarGrammarLanguageMetaData, \"LanguageMetaData\"),\n  parser: {}\n};\nvar TreemapGrammarGeneratedModule = {\n  Grammar: /* @__PURE__ */ __name(() => TreemapGrammarGrammar(), \"Grammar\"),\n  LanguageMetaData: /* @__PURE__ */ __name(() => TreemapGrammarLanguageMetaData, \"LanguageMetaData\"),\n  parser: {}\n};\n\n// src/language/common/valueConverter.ts\nimport { DefaultValueConverter } from \"langium\";\n\n// src/language/common/matcher.ts\nvar accessibilityDescrRegex = /accDescr(?:[\\t ]*:([^\\n\\r]*)|\\s*{([^}]*)})/;\nvar accessibilityTitleRegex = /accTitle[\\t ]*:([^\\n\\r]*)/;\nvar titleRegex = /title([\\t ][^\\n\\r]*|)/;\n\n// src/language/common/valueConverter.ts\nvar rulesRegexes = {\n  ACC_DESCR: accessibilityDescrRegex,\n  ACC_TITLE: accessibilityTitleRegex,\n  TITLE: titleRegex\n};\nvar AbstractMermaidValueConverter = class extends DefaultValueConverter {\n  static {\n    __name(this, \"AbstractMermaidValueConverter\");\n  }\n  runConverter(rule, input, cstNode) {\n    let value = this.runCommonConverter(rule, input, cstNode);\n    if (value === void 0) {\n      value = this.runCustomConverter(rule, input, cstNode);\n    }\n    if (value === void 0) {\n      return super.runConverter(rule, input, cstNode);\n    }\n    return value;\n  }\n  runCommonConverter(rule, input, _cstNode) {\n    const regex = rulesRegexes[rule.name];\n    if (regex === void 0) {\n      return void 0;\n    }\n    const match = regex.exec(input);\n    if (match === null) {\n      return void 0;\n    }\n    if (match[1] !== void 0) {\n      return match[1].trim().replace(/[\\t ]{2,}/gm, \" \");\n    }\n    if (match[2] !== void 0) {\n      return match[2].replace(/^\\s*/gm, \"\").replace(/\\s+$/gm, \"\").replace(/[\\t ]{2,}/gm, \" \").replace(/[\\n\\r]{2,}/gm, \"\\n\");\n    }\n    return void 0;\n  }\n};\nvar CommonValueConverter = class extends AbstractMermaidValueConverter {\n  static {\n    __name(this, \"CommonValueConverter\");\n  }\n  runCustomConverter(_rule, _input, _cstNode) {\n    return void 0;\n  }\n};\n\n// src/language/common/tokenBuilder.ts\nimport { DefaultTokenBuilder } from \"langium\";\nvar AbstractMermaidTokenBuilder = class extends DefaultTokenBuilder {\n  static {\n    __name(this, \"AbstractMermaidTokenBuilder\");\n  }\n  constructor(keywords) {\n    super();\n    this.keywords = new Set(keywords);\n  }\n  buildKeywordTokens(rules, terminalTokens, options) {\n    const tokenTypes = super.buildKeywordTokens(rules, terminalTokens, options);\n    tokenTypes.forEach((tokenType) => {\n      if (this.keywords.has(tokenType.name) && tokenType.PATTERN !== void 0) {\n        tokenType.PATTERN = new RegExp(tokenType.PATTERN.toString() + \"(?:(?=%%)|(?!\\\\S))\");\n      }\n    });\n    return tokenTypes;\n  }\n};\nvar CommonTokenBuilder = class extends AbstractMermaidTokenBuilder {\n  static {\n    __name(this, \"CommonTokenBuilder\");\n  }\n};\n\nexport {\n  __name,\n  Architecture,\n  isArchitecture,\n  Branch,\n  isBranch,\n  Commit,\n  isCommit,\n  GitGraph,\n  isGitGraph,\n  Info,\n  isInfo,\n  Merge,\n  isMerge,\n  Packet,\n  isPacket,\n  PacketBlock,\n  isPacketBlock,\n  Pie,\n  isPie,\n  PieSection,\n  isPieSection,\n  Radar,\n  Statement,\n  Treemap,\n  isTreemap,\n  MermaidGeneratedSharedModule,\n  ArchitectureGrammarGeneratedModule,\n  GitGraphGrammarGeneratedModule,\n  InfoGrammarGeneratedModule,\n  PacketGrammarGeneratedModule,\n  PieGrammarGeneratedModule,\n  RadarGrammarGeneratedModule,\n  TreemapGrammarGeneratedModule,\n  AbstractMermaidValueConverter,\n  CommonValueConverter,\n  AbstractMermaidTokenBuilder,\n  CommonTokenBuilder\n};\n","import {\n  AbstractMermaidTokenBuilder,\n  CommonValueConverter,\n  GitGraphGrammarGeneratedModule,\n  MermaidGeneratedSharedModule,\n  __name\n} from \"./chunk-TCCFYFTB.mjs\";\n\n// src/language/gitGraph/module.ts\nimport {\n  inject,\n  createDefaultCoreModule,\n  createDefaultSharedCoreModule,\n  EmptyFileSystem\n} from \"langium\";\n\n// src/language/gitGraph/tokenBuilder.ts\nvar GitGraphTokenBuilder = class extends AbstractMermaidTokenBuilder {\n  static {\n    __name(this, \"GitGraphTokenBuilder\");\n  }\n  constructor() {\n    super([\"gitGraph\"]);\n  }\n};\n\n// src/language/gitGraph/module.ts\nvar GitGraphModule = {\n  parser: {\n    TokenBuilder: /* @__PURE__ */ __name(() => new GitGraphTokenBuilder(), \"TokenBuilder\"),\n    ValueConverter: /* @__PURE__ */ __name(() => new CommonValueConverter(), \"ValueConverter\")\n  }\n};\nfunction createGitGraphServices(context = EmptyFileSystem) {\n  const shared = inject(\n    createDefaultSharedCoreModule(context),\n    MermaidGeneratedSharedModule\n  );\n  const GitGraph = inject(\n    createDefaultCoreModule({ shared }),\n    GitGraphGrammarGeneratedModule,\n    GitGraphModule\n  );\n  shared.ServiceRegistry.register(GitGraph);\n  return { shared, GitGraph };\n}\n__name(createGitGraphServices, \"createGitGraphServices\");\n\nexport {\n  GitGraphModule,\n  createGitGraphServices\n};\n","import {\n  AbstractMermaidTokenBuilder,\n  CommonValueConverter,\n  InfoGrammarGeneratedModule,\n  MermaidGeneratedSharedModule,\n  __name\n} from \"./chunk-TCCFYFTB.mjs\";\n\n// src/language/info/module.ts\nimport {\n  EmptyFileSystem,\n  createDefaultCoreModule,\n  createDefaultSharedCoreModule,\n  inject\n} from \"langium\";\n\n// src/language/info/tokenBuilder.ts\nvar InfoTokenBuilder = class extends AbstractMermaidTokenBuilder {\n  static {\n    __name(this, \"InfoTokenBuilder\");\n  }\n  constructor() {\n    super([\"info\", \"showInfo\"]);\n  }\n};\n\n// src/language/info/module.ts\nvar InfoModule = {\n  parser: {\n    TokenBuilder: /* @__PURE__ */ __name(() => new InfoTokenBuilder(), \"TokenBuilder\"),\n    ValueConverter: /* @__PURE__ */ __name(() => new CommonValueConverter(), \"ValueConverter\")\n  }\n};\nfunction createInfoServices(context = EmptyFileSystem) {\n  const shared = inject(\n    createDefaultSharedCoreModule(context),\n    MermaidGeneratedSharedModule\n  );\n  const Info = inject(\n    createDefaultCoreModule({ shared }),\n    InfoGrammarGeneratedModule,\n    InfoModule\n  );\n  shared.ServiceRegistry.register(Info);\n  return { shared, Info };\n}\n__name(createInfoServices, \"createInfoServices\");\n\nexport {\n  InfoModule,\n  createInfoServices\n};\n","import {\n  AbstractMermaidTokenBuilder,\n  CommonValueConverter,\n  MermaidGeneratedSharedModule,\n  PacketGrammarGeneratedModule,\n  __name\n} from \"./chunk-TCCFYFTB.mjs\";\n\n// src/language/packet/module.ts\nimport {\n  EmptyFileSystem,\n  createDefaultCoreModule,\n  createDefaultSharedCoreModule,\n  inject\n} from \"langium\";\n\n// src/language/packet/tokenBuilder.ts\nvar PacketTokenBuilder = class extends AbstractMermaidTokenBuilder {\n  static {\n    __name(this, \"PacketTokenBuilder\");\n  }\n  constructor() {\n    super([\"packet\"]);\n  }\n};\n\n// src/language/packet/module.ts\nvar PacketModule = {\n  parser: {\n    TokenBuilder: /* @__PURE__ */ __name(() => new PacketTokenBuilder(), \"TokenBuilder\"),\n    ValueConverter: /* @__PURE__ */ __name(() => new CommonValueConverter(), \"ValueConverter\")\n  }\n};\nfunction createPacketServices(context = EmptyFileSystem) {\n  const shared = inject(\n    createDefaultSharedCoreModule(context),\n    MermaidGeneratedSharedModule\n  );\n  const Packet = inject(\n    createDefaultCoreModule({ shared }),\n    PacketGrammarGeneratedModule,\n    PacketModule\n  );\n  shared.ServiceRegistry.register(Packet);\n  return { shared, Packet };\n}\n__name(createPacketServices, \"createPacketServices\");\n\nexport {\n  PacketModule,\n  createPacketServices\n};\n","import {\n  AbstractMermaidTokenBuilder,\n  AbstractMermaidValueConverter,\n  MermaidGeneratedSharedModule,\n  PieGrammarGeneratedModule,\n  __name\n} from \"./chunk-TCCFYFTB.mjs\";\n\n// src/language/pie/module.ts\nimport {\n  EmptyFileSystem,\n  createDefaultCoreModule,\n  createDefaultSharedCoreModule,\n  inject\n} from \"langium\";\n\n// src/language/pie/tokenBuilder.ts\nvar PieTokenBuilder = class extends AbstractMermaidTokenBuilder {\n  static {\n    __name(this, \"PieTokenBuilder\");\n  }\n  constructor() {\n    super([\"pie\", \"showData\"]);\n  }\n};\n\n// src/language/pie/valueConverter.ts\nvar PieValueConverter = class extends AbstractMermaidValueConverter {\n  static {\n    __name(this, \"PieValueConverter\");\n  }\n  runCustomConverter(rule, input, _cstNode) {\n    if (rule.name !== \"PIE_SECTION_LABEL\") {\n      return void 0;\n    }\n    return input.replace(/\"/g, \"\").trim();\n  }\n};\n\n// src/language/pie/module.ts\nvar PieModule = {\n  parser: {\n    TokenBuilder: /* @__PURE__ */ __name(() => new PieTokenBuilder(), \"TokenBuilder\"),\n    ValueConverter: /* @__PURE__ */ __name(() => new PieValueConverter(), \"ValueConverter\")\n  }\n};\nfunction createPieServices(context = EmptyFileSystem) {\n  const shared = inject(\n    createDefaultSharedCoreModule(context),\n    MermaidGeneratedSharedModule\n  );\n  const Pie = inject(\n    createDefaultCoreModule({ shared }),\n    PieGrammarGeneratedModule,\n    PieModule\n  );\n  shared.ServiceRegistry.register(Pie);\n  return { shared, Pie };\n}\n__name(createPieServices, \"createPieServices\");\n\nexport {\n  PieModule,\n  createPieServices\n};\n","import {\n  AbstractMermaidTokenBuilder,\n  AbstractMermaidValueConverter,\n  ArchitectureGrammarGeneratedModule,\n  MermaidGeneratedSharedModule,\n  __name\n} from \"./chunk-TCCFYFTB.mjs\";\n\n// src/language/architecture/module.ts\nimport {\n  EmptyFileSystem,\n  createDefaultCoreModule,\n  createDefaultSharedCoreModule,\n  inject\n} from \"langium\";\n\n// src/language/architecture/tokenBuilder.ts\nvar ArchitectureTokenBuilder = class extends AbstractMermaidTokenBuilder {\n  static {\n    __name(this, \"ArchitectureTokenBuilder\");\n  }\n  constructor() {\n    super([\"architecture\"]);\n  }\n};\n\n// src/language/architecture/valueConverter.ts\nvar ArchitectureValueConverter = class extends AbstractMermaidValueConverter {\n  static {\n    __name(this, \"ArchitectureValueConverter\");\n  }\n  runCustomConverter(rule, input, _cstNode) {\n    if (rule.name === \"ARCH_ICON\") {\n      return input.replace(/[()]/g, \"\").trim();\n    } else if (rule.name === \"ARCH_TEXT_ICON\") {\n      return input.replace(/[\"()]/g, \"\");\n    } else if (rule.name === \"ARCH_TITLE\") {\n      return input.replace(/[[\\]]/g, \"\").trim();\n    }\n    return void 0;\n  }\n};\n\n// src/language/architecture/module.ts\nvar ArchitectureModule = {\n  parser: {\n    TokenBuilder: /* @__PURE__ */ __name(() => new ArchitectureTokenBuilder(), \"TokenBuilder\"),\n    ValueConverter: /* @__PURE__ */ __name(() => new ArchitectureValueConverter(), \"ValueConverter\")\n  }\n};\nfunction createArchitectureServices(context = EmptyFileSystem) {\n  const shared = inject(\n    createDefaultSharedCoreModule(context),\n    MermaidGeneratedSharedModule\n  );\n  const Architecture = inject(\n    createDefaultCoreModule({ shared }),\n    ArchitectureGrammarGeneratedModule,\n    ArchitectureModule\n  );\n  shared.ServiceRegistry.register(Architecture);\n  return { shared, Architecture };\n}\n__name(createArchitectureServices, \"createArchitectureServices\");\n\nexport {\n  ArchitectureModule,\n  createArchitectureServices\n};\n","import {\n  AbstractMermaidTokenBuilder,\n  CommonValueConverter,\n  MermaidGeneratedSharedModule,\n  RadarGrammarGeneratedModule,\n  __name\n} from \"./chunk-TCCFYFTB.mjs\";\n\n// src/language/radar/module.ts\nimport {\n  EmptyFileSystem,\n  createDefaultCoreModule,\n  createDefaultSharedCoreModule,\n  inject\n} from \"langium\";\n\n// src/language/radar/tokenBuilder.ts\nvar RadarTokenBuilder = class extends AbstractMermaidTokenBuilder {\n  static {\n    __name(this, \"RadarTokenBuilder\");\n  }\n  constructor() {\n    super([\"radar-beta\"]);\n  }\n};\n\n// src/language/radar/module.ts\nvar RadarModule = {\n  parser: {\n    TokenBuilder: /* @__PURE__ */ __name(() => new RadarTokenBuilder(), \"TokenBuilder\"),\n    ValueConverter: /* @__PURE__ */ __name(() => new CommonValueConverter(), \"ValueConverter\")\n  }\n};\nfunction createRadarServices(context = EmptyFileSystem) {\n  const shared = inject(\n    createDefaultSharedCoreModule(context),\n    MermaidGeneratedSharedModule\n  );\n  const Radar = inject(\n    createDefaultCoreModule({ shared }),\n    RadarGrammarGeneratedModule,\n    RadarModule\n  );\n  shared.ServiceRegistry.register(Radar);\n  return { shared, Radar };\n}\n__name(createRadarServices, \"createRadarServices\");\n\nexport {\n  RadarModule,\n  createRadarServices\n};\n","import {\n  AbstractMermaidTokenBuilder,\n  AbstractMermaidValueConverter,\n  MermaidGeneratedSharedModule,\n  TreemapGrammarGeneratedModule,\n  __name\n} from \"./chunk-TCCFYFTB.mjs\";\n\n// src/language/treemap/module.ts\nimport {\n  EmptyFileSystem,\n  createDefaultCoreModule,\n  createDefaultSharedCoreModule,\n  inject\n} from \"langium\";\n\n// src/language/treemap/tokenBuilder.ts\nvar TreemapTokenBuilder = class extends AbstractMermaidTokenBuilder {\n  static {\n    __name(this, \"TreemapTokenBuilder\");\n  }\n  constructor() {\n    super([\"treemap\"]);\n  }\n};\n\n// src/language/treemap/valueConverter.ts\nvar classDefRegex = /classDef\\s+([A-Z_a-z]\\w+)(?:\\s+([^\\n\\r;]*))?;?/;\nvar TreemapValueConverter = class extends AbstractMermaidValueConverter {\n  static {\n    __name(this, \"TreemapValueConverter\");\n  }\n  runCustomConverter(rule, input, _cstNode) {\n    if (rule.name === \"NUMBER2\") {\n      return parseFloat(input.replace(/,/g, \"\"));\n    } else if (rule.name === \"SEPARATOR\") {\n      return input.substring(1, input.length - 1);\n    } else if (rule.name === \"STRING2\") {\n      return input.substring(1, input.length - 1);\n    } else if (rule.name === \"INDENTATION\") {\n      return input.length;\n    } else if (rule.name === \"ClassDef\") {\n      if (typeof input !== \"string\") {\n        return input;\n      }\n      const match = classDefRegex.exec(input);\n      if (match) {\n        return {\n          $type: \"ClassDefStatement\",\n          className: match[1],\n          styleText: match[2] || void 0\n        };\n      }\n    }\n    return void 0;\n  }\n};\n\n// src/language/treemap/treemap-validator.ts\nfunction registerValidationChecks(services) {\n  const validator = services.validation.TreemapValidator;\n  const registry = services.validation.ValidationRegistry;\n  if (registry) {\n    const checks = {\n      Treemap: validator.checkSingleRoot.bind(validator)\n      // Remove unused validation for TreemapRow\n    };\n    registry.register(checks, validator);\n  }\n}\n__name(registerValidationChecks, \"registerValidationChecks\");\nvar TreemapValidator = class {\n  static {\n    __name(this, \"TreemapValidator\");\n  }\n  /**\n   * Validates that a treemap has only one root node.\n   * A root node is defined as a node that has no indentation.\n   */\n  checkSingleRoot(doc, accept) {\n    let rootNodeIndentation;\n    for (const row of doc.TreemapRows) {\n      if (!row.item) {\n        continue;\n      }\n      if (rootNodeIndentation === void 0 && // Check if this is a root node (no indentation)\n      row.indent === void 0) {\n        rootNodeIndentation = 0;\n      } else if (row.indent === void 0) {\n        accept(\"error\", \"Multiple root nodes are not allowed in a treemap.\", {\n          node: row,\n          property: \"item\"\n        });\n      } else if (rootNodeIndentation !== void 0 && rootNodeIndentation >= parseInt(row.indent, 10)) {\n        accept(\"error\", \"Multiple root nodes are not allowed in a treemap.\", {\n          node: row,\n          property: \"item\"\n        });\n      }\n    }\n  }\n};\n\n// src/language/treemap/module.ts\nvar TreemapModule = {\n  parser: {\n    TokenBuilder: /* @__PURE__ */ __name(() => new TreemapTokenBuilder(), \"TokenBuilder\"),\n    ValueConverter: /* @__PURE__ */ __name(() => new TreemapValueConverter(), \"ValueConverter\")\n  },\n  validation: {\n    TreemapValidator: /* @__PURE__ */ __name(() => new TreemapValidator(), \"TreemapValidator\")\n  }\n};\nfunction createTreemapServices(context = EmptyFileSystem) {\n  const shared = inject(\n    createDefaultSharedCoreModule(context),\n    MermaidGeneratedSharedModule\n  );\n  const Treemap = inject(\n    createDefaultCoreModule({ shared }),\n    TreemapGrammarGeneratedModule,\n    TreemapModule\n  );\n  shared.ServiceRegistry.register(Treemap);\n  registerValidationChecks(Treemap);\n  return { shared, Treemap };\n}\n__name(createTreemapServices, \"createTreemapServices\");\n\nexport {\n  TreemapModule,\n  createTreemapServices\n};\n","import {\n  GitGraphModule,\n  createGitGraphServices\n} from \"./chunks/mermaid-parser.core/chunk-4F5CHEZ2.mjs\";\nimport {\n  InfoModule,\n  createInfoServices\n} from \"./chunks/mermaid-parser.core/chunk-FRFDVMJY.mjs\";\nimport {\n  PacketModule,\n  createPacketServices\n} from \"./chunks/mermaid-parser.core/chunk-SJTYNZTY.mjs\";\nimport {\n  PieModule,\n  createPieServices\n} from \"./chunks/mermaid-parser.core/chunk-PL6DKKU2.mjs\";\nimport {\n  ArchitectureModule,\n  createArchitectureServices\n} from \"./chunks/mermaid-parser.core/chunk-UMXZTB3W.mjs\";\nimport {\n  RadarModule,\n  createRadarServices\n} from \"./chunks/mermaid-parser.core/chunk-TQ3KTPDO.mjs\";\nimport {\n  TreemapModule,\n  createTreemapServices\n} from \"./chunks/mermaid-parser.core/chunk-B2363JML.mjs\";\nimport {\n  AbstractMermaidTokenBuilder,\n  AbstractMermaidValueConverter,\n  Architecture,\n  ArchitectureGrammarGeneratedModule,\n  Branch,\n  Commit,\n  CommonTokenBuilder,\n  CommonValueConverter,\n  GitGraph,\n  GitGraphGrammarGeneratedModule,\n  Info,\n  InfoGrammarGeneratedModule,\n  Merge,\n  MermaidGeneratedSharedModule,\n  Packet,\n  PacketBlock,\n  PacketGrammarGeneratedModule,\n  Pie,\n  PieGrammarGeneratedModule,\n  PieSection,\n  Radar,\n  RadarGrammarGeneratedModule,\n  Statement,\n  Treemap,\n  TreemapGrammarGeneratedModule,\n  __name,\n  isArchitecture,\n  isBranch,\n  isCommit,\n  isGitGraph,\n  isInfo,\n  isMerge,\n  isPacket,\n  isPacketBlock,\n  isPie,\n  isPieSection,\n  isTreemap\n} from \"./chunks/mermaid-parser.core/chunk-TCCFYFTB.mjs\";\n\n// src/parse.ts\nvar parsers = {};\nvar initializers = {\n  info: /* @__PURE__ */ __name(async () => {\n    const { createInfoServices: createInfoServices2 } = await import(\"./chunks/mermaid-parser.core/info-VBDWY6EO.mjs\");\n    const parser = createInfoServices2().Info.parser.LangiumParser;\n    parsers.info = parser;\n  }, \"info\"),\n  packet: /* @__PURE__ */ __name(async () => {\n    const { createPacketServices: createPacketServices2 } = await import(\"./chunks/mermaid-parser.core/packet-DYOGHKS2.mjs\");\n    const parser = createPacketServices2().Packet.parser.LangiumParser;\n    parsers.packet = parser;\n  }, \"packet\"),\n  pie: /* @__PURE__ */ __name(async () => {\n    const { createPieServices: createPieServices2 } = await import(\"./chunks/mermaid-parser.core/pie-VRWISCQL.mjs\");\n    const parser = createPieServices2().Pie.parser.LangiumParser;\n    parsers.pie = parser;\n  }, \"pie\"),\n  architecture: /* @__PURE__ */ __name(async () => {\n    const { createArchitectureServices: createArchitectureServices2 } = await import(\"./chunks/mermaid-parser.core/architecture-7HQA4BMR.mjs\");\n    const parser = createArchitectureServices2().Architecture.parser.LangiumParser;\n    parsers.architecture = parser;\n  }, \"architecture\"),\n  gitGraph: /* @__PURE__ */ __name(async () => {\n    const { createGitGraphServices: createGitGraphServices2 } = await import(\"./chunks/mermaid-parser.core/gitGraph-G5XIXVHT.mjs\");\n    const parser = createGitGraphServices2().GitGraph.parser.LangiumParser;\n    parsers.gitGraph = parser;\n  }, \"gitGraph\"),\n  radar: /* @__PURE__ */ __name(async () => {\n    const { createRadarServices: createRadarServices2 } = await import(\"./chunks/mermaid-parser.core/radar-ZZBFDIW7.mjs\");\n    const parser = createRadarServices2().Radar.parser.LangiumParser;\n    parsers.radar = parser;\n  }, \"radar\"),\n  treemap: /* @__PURE__ */ __name(async () => {\n    const { createTreemapServices: createTreemapServices2 } = await import(\"./chunks/mermaid-parser.core/treemap-GDKQZRPO.mjs\");\n    const parser = createTreemapServices2().Treemap.parser.LangiumParser;\n    parsers.treemap = parser;\n  }, \"treemap\")\n};\nasync function parse(diagramType, text) {\n  const initializer = initializers[diagramType];\n  if (!initializer) {\n    throw new Error(`Unknown diagram type: ${diagramType}`);\n  }\n  if (!parsers[diagramType]) {\n    await initializer();\n  }\n  const parser = parsers[diagramType];\n  const result = parser.parse(text);\n  if (result.lexerErrors.length > 0 || result.parserErrors.length > 0) {\n    throw new MermaidParseError(result);\n  }\n  return result.value;\n}\n__name(parse, \"parse\");\nvar MermaidParseError = class extends Error {\n  constructor(result) {\n    const lexerErrors = result.lexerErrors.map((err) => err.message).join(\"\\n\");\n    const parserErrors = result.parserErrors.map((err) => err.message).join(\"\\n\");\n    super(`Parsing failed: ${lexerErrors} ${parserErrors}`);\n    this.result = result;\n  }\n  static {\n    __name(this, \"MermaidParseError\");\n  }\n};\nexport {\n  AbstractMermaidTokenBuilder,\n  AbstractMermaidValueConverter,\n  Architecture,\n  ArchitectureGrammarGeneratedModule as ArchitectureGeneratedModule,\n  ArchitectureModule,\n  Branch,\n  Commit,\n  CommonTokenBuilder,\n  CommonValueConverter,\n  GitGraph,\n  GitGraphGrammarGeneratedModule as GitGraphGeneratedModule,\n  GitGraphModule,\n  Info,\n  InfoGrammarGeneratedModule as InfoGeneratedModule,\n  InfoModule,\n  Merge,\n  MermaidGeneratedSharedModule,\n  MermaidParseError,\n  Packet,\n  PacketBlock,\n  PacketGrammarGeneratedModule as PacketGeneratedModule,\n  PacketModule,\n  Pie,\n  PieGrammarGeneratedModule as PieGeneratedModule,\n  PieModule,\n  PieSection,\n  Radar,\n  RadarGrammarGeneratedModule as RadarGeneratedModule,\n  RadarModule,\n  Statement,\n  Treemap,\n  TreemapGrammarGeneratedModule as TreemapGeneratedModule,\n  TreemapModule,\n  createArchitectureServices,\n  createGitGraphServices,\n  createInfoServices,\n  createPacketServices,\n  createPieServices,\n  createRadarServices,\n  createTreemapServices,\n  isArchitecture,\n  isBranch,\n  isCommit,\n  isGitGraph,\n  isInfo,\n  isMerge,\n  isPacket,\n  isPacketBlock,\n  isPie,\n  isPieSection,\n  isTreemap,\n  parse\n};\n"],"names":["objectProto","hasOwnProperty","assign","createAssigner","object","source","isPrototype","isArrayLike","copyObject","keys","key","assignValue","baseSlice","array","start","end","index","length","result","compact","resIndex","value","arrayAggregator","setter","iteratee","accumulator","baseAggregator","collection","baseEach","createAggregator","initializer","func","isArray","baseIteratee","LARGE_ARRAY_SIZE","baseDifference","values","comparator","includes","arrayIncludes","isCommon","valuesLength","cacheHas","SetCache","outer","computed","valuesIndex","difference","baseRest","isArrayLikeObject","baseFlatten","drop","n","guard","toInteger","dropRight","arrayEvery","predicate","baseEvery","every","head","flatMap","map","groupBy","baseAssignValue","stringTag","isString","isObjectLike","baseGetTag","nativeMax","fromIndex","baseIndexOf","indexOf","regexpTag","baseIsRegExp","nodeIsRegExp","nodeUtil","isRegExp","baseUnary","FUNC_ERROR_TEXT","negate","args","pickBy","props","arrayMap","getAllKeysIn","prop","basePickBy","path","reject","arrayFilter","baseFilter","baseSome","some","arraySome","uniq","baseUniq","uniqBy","isAstNode","obj","isReference","isMultiReference","isAstNodeDescription","isLinkingError","AbstractAstReflection","refInfo","metaData","referenceType","type","node","subtype","supertype","nested","existing","s","allTypes","types","possibleSubType","isCompositeCstNode","isLeafCstNode","isRootCstNode","StreamImpl","startFn","nextFn","iterator","count","next","keyFn","valueFn","entryStream","element","other","state","DONE_RESULT","separator","addSeparator","toString","searchElement","callbackfn","done","initialValue","previousValue","mapped","isIterable","depth","stream","skipCount","i","maxSize","by","otherKeySet","item","e","ownKey","EMPTY_STREAM","collections","TreeStreamImpl","root","children","options","Reduction","sum","b","product","min","max","linkContentToContainer","name","getContainerOfType","typePredicate","getDocument","findRootNode","getReferenceNodes","reference","streamContents","range","property","isAstNodeInRange","streamAllContents","streamAst","astNode","nodeRange","inRange","streamReferences","assignMandatoryProperties","reflection","typeMetaData","genericNode","copyDefaultValue","propertyType","AbstractElement","isAbstractElement","AbstractParserRule","isAbstractParserRule","AbstractRule","AbstractType","Action","isAction","Alternatives","isAlternatives","ArrayLiteral","ArrayType","Assignment","isAssignment","BooleanLiteral","isBooleanLiteral","CharacterRange","isCharacterRange","Condition","Conjunction","isConjunction","CrossReference","isCrossReference","Disjunction","isDisjunction","EndOfFile","isEndOfFile","Grammar","GrammarImport","Group","isGroup","InferredType","isInferredType","InfixRule","isInfixRule","InfixRuleOperatorList","InfixRuleOperators","Interface","isInterface","Keyword","isKeyword","NamedArgument","NegatedToken","isNegatedToken","Negation","isNegation","NumberLiteral","Parameter","ParameterReference","isParameterReference","ParserRule","isParserRule","ReferenceType","RegexToken","isRegexToken","ReturnType","isReturnType","RuleCall","isRuleCall","SimpleType","isSimpleType","StringLiteral","TerminalAlternatives","isTerminalAlternatives","TerminalElement","TerminalGroup","isTerminalGroup","TerminalRule","isTerminalRule","TerminalRuleCall","isTerminalRuleCall","Type","isType","TypeAttribute","TypeDefinition","UnionType","UnorderedGroup","isUnorderedGroup","UntilToken","isUntilToken","ValueLiteral","Wildcard","isWildcard","LangiumGrammarAstReflection","langium.AbstractAstReflection","streamCst","isChildNode","child","parent","tokenToRange","token","toDocumentSegment","offset","RangeComparison","compareRange","to","startInside","endInside","DefaultNameRegexp","findCommentNode","cstNode","commentNames","previous","getPreviousNode","isCommentNode","endIndex","hidden","ErrorWithLocation","message","assertUnreachable","_","cc","char","insertToSet","set","subItem","addFlag","flagObj","flagKey","ASSERT_EXISTS","ASSERT_NEVER_REACH_HERE","isCharacter","digitsCharCodes","wordCharCodes","whitespaceCodes","hexDigitPattern","decimalPattern","decimalPatternNoZero","RegExpParser","newState","input","flags","alts","begin","terms","disjunction","isBacktracking","atLeast","atMost","atom","complement","escapeCode","letter","escapedChar","nextChar","from","capturing","groupAst","number","howMuch","prevState","howMany","hexString","hexChar","BaseRegExpVisitor","subChild","NEWLINE_REGEXP","regexpParser","TerminalRegExpVisitor","regex","escapeRegExp","visitor","isMultilineComment","regexp","whitespaceCharacters","isWhitespace","ws","partialMatches","partial","partialRegExp","match","re","process","tmp","appendRaw","nbChars","appendOptional","getEntryRule","grammar","ast.isParserRule","getHiddenRules","ast.isTerminalRule","getAllReachableRules","allTerminals","ruleNames","entryRule","topMostRules","rule","ruleDfs","rules","visitedSet","ast.isRuleCall","refRule","getCrossReferenceTerminal","crossRef","findNameAssignment","isCommentTerminal","terminalRule","terminalRegex","findNodesForProperty","findNodesForPropertyInternal","findNodeForProperty","nodes","first","nodeFeature","ast.isAssignment","findNodeForKeyword","keyword","findNodesForKeywordInternal","ast.isKeyword","treeIterator","keywordNodes","childNode","findAssignment","assignment","startNode","ast.isInferredType","ast.isAction","ast.isAbstractParserRule","findNameAssignmentInternal","cache","go","refType","childAssignment","ast.isSimpleType","isDataTypeRule","isDataTypeRuleInternal","visited","ast.isInfixRule","getExplicitRuleType","getTypeName","ast.isInterface","ast.isType","ast.isReturnType","actionType","getActionType","action","getRuleType","abstractElementToRegex","flagText","WILDCARD","ast.isTerminalAlternatives","terminalAlternativesToRegex","ast.isTerminalGroup","terminalGroupToRegex","ast.isCharacterRange","characterRangeToRegex","ast.isTerminalRuleCall","withCardinality","ast.isNegatedToken","negateTokenToRegex","ast.isUntilToken","untilTokenToRegex","ast.isRegexToken","lastSlash","regexFlags","ast.isWildcard","alternatives","group","until","keywordToRegex","createGrammarConfig","services","PRINT_ERROR","msg","PRINT_WARNING","timer","val","toFastProperties","toBecomeFast","FakeConstructor","fakeInstance","fakeAccess","tokenLabel","tokType","hasTokenLabel","AbstractProduction","_definition","forEach","prod","NonTerminal","v","definition","Rule","Alternative","RepetitionMandatory","RepetitionMandatoryWithSeparator","Repetition","RepetitionWithSeparator","Alternation","Terminal","serializeGrammar","topRules","serializeProduction","convertDefinition","serializedNonTerminal","Option","serializedTerminal","pattern","GAstVisitor","nodeAny","isSequenceProd","isOptionalProd","alreadyVisited","subProd","isBranchingProd","getProductionDslName","RestWalker","prevRest","currRest","terminal","refProd","flatProd","fullOrRest","optionProd","atLeastOneProd","fullAtLeastOneRest","atLeastOneSepProd","fullAtLeastOneSepRest","restForRepetitionWithSeparator","manyProd","fullManyRest","manySepProd","fullManySepRest","orProd","alt","prodWrapper","repSepProd","firstForTerminal","firstForSequence","firstForBranching","firstSet","seq","nextSubProdIdx","hasInnerProdsRemaining","currSubProd","isLastInnerProdOptional","allAlternativesFirsts","innerProd","flatten","IN","ResyncFollowsWalker","topProd","followName","buildBetweenProdsFollowPrefix","fullRest","restProd","t_in_topProd_follows","computeAllProdsFollows","topProductions","reSyncFollows","currRefsFollow","inner","occurenceInParent","regExpAstCache","regExpParser","getRegExpAst","regExp","regExpStr","regExpAst","clearRegExpParserCache","complementErrorMessage","failedOptimizationPrefixMsg","getOptimizedStartCodesIndices","ensureOptimizations","ast","firstCharOptimizedIndices","msgSuffix","ignoreCase","term","addOptimizedIdxToResult","code","rangeCode","minOptimizationVal","minUnOptVal","maxUnOptVal","minOptIdx","charCodeToOptimizedIndex","maxOptIdx","currOptIdx","isOptionalQuantifier","isWholeOptional","optimizedCharIdx","handleIgnoreCase","upperChar","lowerChar","findCode","setNode","targetCharCodes","find","codeOrRange","targetCode","quantifier","CharCodeFinder","canMatchCharCode","charCodes","charCodeFinder","PATTERN","DEFAULT_MODE","MODES","analyzeTokenTypes","tokenTypes","defaults","tracer","initCharCodeToOptimizedIndexMap","onlyRelevantTypes","currType","Lexer","hasCustom","allTransformedPatterns","currPattern","regExpSource","addStickyFlag","isFunction","escapedRegExpString","wrappedRegExp","patternIdxToType","patternIdxToGroup","patternIdxToLongerAltIdxArr","patternIdxToPushMode","patternIdxToPopMode","clazz","groupName","isUndefined","longerAltType","has","patternIdxToCanLineTerminator","lineTerminatorCharCodes","getCharCodes","checkLineBreaksIssues","patternIdxToIsCustom","patternIdxToShort","emptyGroups","patternIdxToConfig","isCustomPattern","isShortPattern","reduce","acc","x","idx","canBeOptimized","charCodeToPatternIdxToConfig","currTokType","charCode","optimizedIdx","addToMapOfArrays","lastOptimizedIdx","charOrInt","currOptimizedIdx","optimizedCodes","isEmpty","validatePatterns","validModesNames","errors","missingResult","findMissingPatterns","invalidResult","findInvalidPatterns","validTokenTypes","validateRegExpPattern","findInvalidGroupType","findModesThatDoNotExist","findUnreachablePatterns","withRegExpPatterns","filter","findEndOfInputAnchor","findStartOfInputAnchor","findUnsupportedFlags","findDuplicatePatterns","findEmptyMatchRegExps","tokenTypesWithMissingPattern","LexerDefinitionErrorType","valid","tokenTypesWithInvalidPattern","end_of_input","EndAnchorFinder","invalidRegex","regexpAst","endAnchorVisitor","matchesEmptyString","start_of_input","StartAnchorFinder","startAnchorVisitor","invalidFlags","found","identicalPatterns","outerType","innerType","duplicatePatterns","currIdenticalSet","setOfIdentical","tokenTypeNames","invalidTypes","validModes","invalidModes","canBeTested","noMetaChar","aTokType","aIdx","bStr","bIdx","bTokType","tryToMatchStrToPattern","str","usesLookAheadOrBehind","regExpArray","performRuntimeChecks","lexerDefinition","trackLines","lineTerminatorCharacters","currModeValue","currModeName","currIdx","longerAlt","currLongerAlt","performWarningRuntimeChecks","warnings","hasAnyLineBreak","allTokenTypes","concreteTokenTypes","terminatorCharCodes","currIssue","warningDescriptor","buildLineBreakIssueMessage","cloneEmptyGroups","clonedResult","groupKeys","currKey","currGroupValue","tokenType","LineTerminatorOptimizedTester","text","len","c","details","charsOrCodes","numOrString","charCodeToOptimizedIdxMap","tokenStructuredMatcher","tokInstance","tokConstructor","instanceType","tokenStructuredMatcherNoCategories","tokenShortNameIdx","tokenIdxToClass","augmentTokenTypes","tokenTypesAndParents","expandCategories","assignTokenDefaultProps","assignCategoriesMapProp","assignCategoriesTokensProp","clone","categories","searching","newCategories","hasShortKeyProperty","hasCategoriesProperty","hasExtendingTokensTypesProperty","hasExtendingTokensTypesMapProperty","singleAssignCategoriesToksMap","nextNode","pathNode","nextCategory","newPath","isTokenType","defaultLexerErrorProvider","fullText","startOffset","line","column","mode","DEFAULT_LEXER_CONFIG","config","phaseDesc","phaseImpl","indent","time","traceMethod","traceInitVal","actualDefinition","hasOnlySingleMode","allModeNames","currModDef","currModName","currAnalyzeResult","allErrMessagesString","error","noop","identity","unOptimizedModes","cannotBeOptimized","modeName","initialMode","j","k","matchAltImage","matchedImage","payload","altPayload","imageLength","newToken","errLength","orgText","orgLength","matchedTokensIndex","guessedNumberOfTokens","matchedTokens","groups","lineTerminatorPattern","currModePatternsLength","currCharCodeToPatternIdxToConfig","modeStack","emptyArray","isOptimizedMode","pop_mode","popToken","newMode","last","modeCanBeOptimized","push_mode","currConfig","recoveryEnabled","nextCharCode","chosenPatternIdxToConfig","possiblePatterns","chosenPatternsLength","singleCharCode","longerAltLength","longerAltConfig","longerAltPattern","numOfLTsInMatch","foundTerminator","lastLTEndOffset","errorStartOffset","errorLine","errorColumn","foundResyncPoint","pushMode","lastLTIdx","lastCharIsLT","fixForEndingInLT","oldColumn","image","tokenTypeIdx","startLine","startColumn","tokenVector","tokenToAdd","PARENT","CATEGORIES","LABEL","GROUP","PUSH_MODE","POP_MODE","LONGER_ALT","LINE_BREAKS","START_CHARS_HINT","createToken","createTokenInternal","EOF","createTokenInstance","endOffset","endLine","endColumn","tokenMatcher","defaultParserErrorProvider","expected","actual","ruleName","firstRedundant","expectedPathsPerAlt","customUserDescription","errPrefix","errSuffix","allLookAheadPaths","currAltPaths","nextValidTokenSequences","currPath","currTokenType","calculatedDescription","itemMsg","expectedIterationPaths","defaultGrammarResolverErrorProvider","topLevelRule","undefinedRule","defaultGrammarValidatorErrorProvider","duplicateProds","getExtraProductionArgument","topLevelName","duplicateProd","dslName","extraArgument","hasExplicitIndex","pathMsg","currTok","occurrence","isEmptyPath","currMessage","currtok","pathNames","currRule","leftRecursivePath","resolveGrammar","topLevels","errMsgProvider","refResolver","GastRefResolverVisitor","nameToTopRule","ref","ParserDefinitionErrorType","AbstractNextPossibleTokensWalker","NextAfterTokenWalker","AbstractNextTerminalAfterProductionWalker","topRule","NextTerminalAfterManyWalker","firstAfterMany","_first","NextTerminalAfterManySepWalker","firstAfterManySep","NextTerminalAfterAtLeastOneWalker","firstAfterAtLeastOne","NextTerminalAfterAtLeastOneSepWalker","atleastOneSepProd","firstAfterfirstAfterAtLeastOneSep","possiblePathsFrom","targetDef","maxLength","remainingPathWith","nextDef","getAlternativesForProd","newDef","currAlt","nextPossibleTokensAfter","initialDef","tokMatcher","maxLookAhead","EXIT_NON_TERMINAL","EXIT_NON_TERMINAL_ARR","EXIT_ALTERNATIVE","foundCompletePath","tokenVectorLength","minimalAlternativesIndex","possiblePaths","currDef","currRuleStack","currOccurrenceStack","nextPath","nextIdx","actualToken","newRuleStack","newOccurrenceStack","nextPathWithout","nextPathWith","secondIteration","separatorGast","nthRepetition","currAltPath","expandTopLevelRule","newCurrOccurrenceStack","PROD_TYPE","getProdType","getLookaheadPaths","prodType","maxLookahead","getLookaheadPathsForOr","getLookaheadPathsForOptionalProd","buildLookaheadFuncForOr","ruleGrammar","hasPredicates","dynamicTokensEnabled","laFuncBuilder","lookAheadPaths","areTokenCategoriesNotUsed","buildLookaheadFuncForOptionalProd","lookaheadBuilder","buildAlternativesLookAheadFunc","numOfAlts","areAllOneTokenLookahead","orAlts","predicates","t","currNumOfPaths","currPredicate","currPathLength","nextToken","singleTokenAlts","choiceToAlt","currExtendingType","buildSingleAlternativeLookaheadFunction","numOfPaths","singleTokensTypes","expectedTokenUniqueKey","RestDefinitionFinderWalker","targetOccurrence","targetProdType","expectedProdType","InsideDefinitionFinderVisitor","targetRef","expectedProdName","initializeArrayOfArrays","size","pathToHashKeys","longerKeys","currShorterKey","categoriesKeySuffix","isUniquePrefixHash","altKnownPathsKeys","searchPathKeys","currAltIdx","otherAltKnownPathsKeys","searchIdx","searchKey","lookAheadSequenceFromAlternatives","altsDefs","partialAlts","finalResult","altsHashes","dict","newData","pathLength","currDataset","altIdx","currAltPathsAndSuffixes","currPathIdx","currPathPrefix","suffixDef","prefixKeys","currAltResult","containsPath","newPartialPathsAndSuffixes","insideDefVisitor","insideDef","afterDef","insideFlat","AlternativeGAST","afterFlat","alternative","searchPath","compareOtherPath","otherPath","searchTok","otherTok","isStrictPrefixOfPath","prefix","otherTokType","singleAltPaths","singlePath","validateLookahead","lookaheadValidationErrorMessages","errorMessage","validateGrammar","grammarName","duplicateErrors","currTopLevel","validateDuplicateProductions","termsNamespaceConflictErrors","checkTerminalAndNoneTerminalsNameSpace","tooManyAltsErrors","curRule","validateTooManyAlts","duplicateRulesError","validateRuleDoesNotAlreadyExist","collectorVisitor","OccurrenceValidationCollector","allRuleProductions","productionGroups","identifyProductionForDuplicates","duplicates","currGroup","currDuplicates","firstProd","defError","param","subrule","option","manySep","atLeastOne","atLeastOneSep","many","or","allRules","className","errMsg","validateRuleIsOverridden","definedRulesNames","validateNoLeftRecursion","nextNonTerminals","getFirstNoneTerminal","validNextSteps","errorsFromNextSteps","currRefRule","currSubDef","isFirstOptional","hasMore","rest","OrCollector","validateEmptyOrAlternative","orCollector","ors","currOr","exceptLast","currAlternative","possibleFirstInAlt","validateAmbiguousAlternationAlternatives","globalMaxLookahead","currOccurrence","actualMaxLookahead","altsAmbiguityErrors","checkAlternativesAmbiguities","altsPrefixAmbiguityErrors","checkPrefixAlternativesAmbiguities","RepetitionCollector","validateSomeNonEmptyLookaheadPath","topLevelRules","currTopRule","currProd","pathsInsideProduction","alternation","foundAmbiguousPaths","identicalAmbiguities","altsCurrPathAppearsIn","currOtherAlt","currOtherAltIdx","currAmbDescriptor","ambgIndices","pathsAndIndices","currPathsAndIdx","currPathAndIdx","targetIdx","targetPath","prefixAmbiguitiesPathsAndIndices","searchPathAndIdx","currAmbPathAndIdx","tokenNames","currToken","currRuleName","actualOptions","topRulesTable","orgResolveGrammar","orgValidateGrammar","MISMATCHED_TOKEN_EXCEPTION","NO_VIABLE_ALT_EXCEPTION","EARLY_EXIT_EXCEPTION","NOT_ALL_INPUT_PARSED_EXCEPTION","RECOGNITION_EXCEPTION_NAMES","isRecognitionException","RecognitionException","MismatchedTokenException","previousToken","NoViableAltException","NotAllInputParsedException","EarlyExitException","EOF_FOLLOW_KEY","IN_RULE_RECOVERY_EXCEPTION","InRuleRecoveryException","Recoverable","DEFAULT_PARSER_CONFIG","attemptInRepetitionRecovery","tokToInsert","grammarRule","grammarRuleArgs","lookAheadFunc","expectedTokType","reSyncTokType","savedLexerState","resyncedTokens","passedResyncPoint","nextTokenWithoutResync","generateErrorMessage","expectTokAfterLastMatch","nextTokIdx","notStuck","tokIdxInRule","grammarPath","follows","nextTok","expectedToken","mismatchedTok","possibleFollowsTokType","followKey","currentRuleReSyncSet","allPossibleReSyncTokTypes","foundMatch","resyncTokType","currRuleShortName","currRuleIdx","prevRuleShortName","explicitRuleStack","explicitOccurrenceStack","followStack","resyncTokens","prodFunc","lookaheadFunc","dslMethodIdx","prodOccurrence","nextToksWalker","pathRuleStack","pathOccurrenceStack","currShortName","firstAfterRepInfo","isEndOfRule","BITS_FOR_METHOD_TYPE","BITS_FOR_OCCURRENCE_IDX","OR_IDX","OPTION_IDX","MANY_IDX","AT_LEAST_ONE_IDX","MANY_SEP_IDX","AT_LEAST_ONE_SEP_IDX","getKeyForAutomaticLookahead","ruleIdx","LLkLookaheadStrategy","_a","leftRecursionErrors","emptyAltErrors","ambiguousAltsErrors","emptyRepetitionErrors","LooksAhead","repetition","repetitionMandatory","repetitionMandatoryWithSeparator","repetitionWithSeparator","collectMethods","prodIdx","laFunc","prodKey","prodMaxLookahead","dslMethodName","DslMethodsCollectorVisitor","dslMethods","setNodeLocationOnlyOffset","currNodeLocation","newLocationInfo","setNodeLocationFull","addTerminalToCst","tokenTypeName","addNoneTerminalToCst","ruleResult","NAME","defineNameProp","nameValue","defaultVisit","ctx","childrenNames","childrenNamesLength","currChildName","currChildArray","currChildArrayLength","currChild","createBaseSemanticVisitorConstructor","derivedConstructor","semanticProto","semanticDefinitionErrors","validateVisitor","errorMessages","currDefError","createBaseVisitorConstructorWithDefaults","baseConstructor","withDefaultsProto","CstVisitorDefinitionError","visitorInstance","validateMissingCstMethods","missingRuleNames","TreeBuilder","fullRuleName","ruleCstNode","prevToken","loc","consumedToken","rootCst","ruleCstResult","preCstNode","newBaseCstVisitorConstructor","newConstructor","ruleStack","occurrenceStack","LexerAdapter","newInput","END_OF_FILE","soughtIdx","RecognizerApi","impl","ruleToCall","actionORMethodDef","altsOrOpts","implementation","DEFAULT_RULE_CONFIG","ruleImplementation","ruleErrors","orgState","RecognizerEngine","tokenVocabulary","uniqueTokens","isObject","noTokenCategoriesUsed","tokenConstructor","resyncEnabled","recoveryValueFunc","shortName","invokeRuleWithTry","cst","resyncEnabledConfig","isFirstInvokedRule","reSyncEnabled","recogError","partialCstResult","orgLookaheadFunction","laKey","separatorLookAheadFunc","lookaheadFunction","nextTerminalAfterWalker","beforeIteration","altIdxToTake","firstRedundantTok","eFromConsumption","eFromInRuleRecovery","savedErrors","savedRuleStack","fullName","idxInCallingRule","ErrorHandler","newErrors","userDefinedErrMsg","insideProdPaths","actualTokens","errMsgTypes","lookAheadPathsPerAlternative","ContentAssist","startRuleName","precedingInput","startRuleGast","topRuleName","topProduction","RECORDING_NULL_OBJECT","HANDLE_SEPARATOR","MAX_METHOD_IDX","RFT","RECORDING_PHASE_TOKEN","RECORDING_PHASE_CSTNODE","GastRecorder","arg1","arg2","that","def","newTopLevelRule","originalError","recordProd","recordOrProd","assertMethodIdxIsValid","getIdxSuffix","prevProd","peek","newNoneTerminal","prodConstructor","mainProdArg","handleSep","grammarAction","newProd","hasOptions","newOrProd","currAltFlat","PerformanceTracer","userTraceInitPerf","traceIsNumber","applyMixins","derivedCtor","baseCtors","baseCtor","baseProto","propName","basePropDescriptor","EMPTY_ALT","Parser","parserInstance","defErrorsMsgs","originalGrammarAction","recordedRuleGast","resolverErrors","validationErrors","lookaheadValidationErrors","allFollows","_b","EmbeddedActionsParser","configClone","buildATNKey","ATN_BASIC","ATN_RULE_START","ATN_PLUS_BLOCK_START","ATN_STAR_BLOCK_START","ATN_RULE_STOP","ATN_BLOCK_END","ATN_STAR_LOOP_BACK","ATN_STAR_LOOP_ENTRY","ATN_PLUS_LOOP_BACK","ATN_LOOP_END","AbstractTransition","target","AtomTransition","EpsilonTransition","RuleTransition","ruleStart","followState","createATN","atn","createRuleStartAndStopATNStates","ruleLength","ruleBlock","block","buildRuleHandle","stop","production","tokenRef","ruleRef","repetitionSep","repetitionMandatorySep","starState","defineDecisionState","handle","makeAlts","star","sep","plusState","plus","optional","handles","makeBlock","blkStart","blkEnd","loop","epsilon","entry","loopEnd","altsLength","transition","isRuleTransition","ruleTransition","removeState","left","right","addTransition","currentRule","nonTerminal","call","a","DFA_ERROR","ATNConfigSet","getATNConfigKey","createDFACache","startState","decision","predicateSet","PredicateSet","EMPTY_PREDICATES","LLStarLookaheadStrategy","initATNSimulator","dfas","logging","decisionIndex","isLL1Sequence","prediction","gate","adaptivePredict","g","sequences","allowEmpty","fullSet","altSet","indices","decisionLength","decisionToDFA","dfaCaches","dfa","closure","computeStartState","addDFAState","newDFAState","performLookahead","s0","previousD","d","getExistingTargetState","computeLookaheadTarget","buildAdaptivePredictError","lookahead","reach","computeReachSet","addDFAEdge","predictedAlt","getUniqueAlt","hasConflictTerminatingPrediction","reportLookaheadAmbiguity","ambiguityIndices","prefixPath","atnState","buildAmbiguityError","current","nextTransitions","nextTokenTypes","configs","intermediate","skippedStopStates","transitionLength","getReachableTarget","hasConfigInRuleStopState","mapKey","numberOfTransitions","p","atnStack","followConfig","getEpsilonTarget","stack","allConfigsInRuleStopStates","altSets","getConflictingAltSets","hasConflictingAltSet","hasStateAssociatedWithOneAlt","configToAlts","DocumentUri","is","URI","integer","uinteger","Position","create","character","candidate","Is","Range","one","two","three","four","Location","uri","LocationLink","targetUri","targetRange","targetSelectionRange","originSelectionRange","Color","red","green","blue","alpha","ColorInformation","color","ColorPresentation","label","textEdit","additionalTextEdits","TextEdit","FoldingRangeKind","FoldingRange","startCharacter","endCharacter","kind","collapsedText","DiagnosticRelatedInformation","location","DiagnosticSeverity","DiagnosticTag","CodeDescription","Diagnostic","severity","relatedInformation","Command","title","command","replace","newText","insert","position","del","ChangeAnnotation","needsConfirmation","description","ChangeAnnotationIdentifier","AnnotatedTextEdit","annotation","TextDocumentEdit","textDocument","edits","OptionalVersionedTextDocumentIdentifier","CreateFile","RenameFile","oldUri","newUri","DeleteFile","WorkspaceEdit","change","TextEditChangeImpl","changeAnnotations","edit","id","ChangeAnnotations","annotations","idOrAnnotation","WorkspaceChange","workspaceEdit","textEditChange","textDocumentEdit","optionsOrAnnotation","operation","TextDocumentIdentifier","VersionedTextDocumentIdentifier","version","TextDocumentItem","languageId","MarkupKind","MarkupContent","CompletionItemKind","InsertTextFormat","CompletionItemTag","InsertReplaceEdit","InsertTextMode","CompletionItemLabelDetails","CompletionItem","CompletionList","items","isIncomplete","MarkedString","fromPlainText","plainText","Hover","ParameterInformation","documentation","SignatureInformation","parameters","DocumentHighlightKind","DocumentHighlight","SymbolKind","SymbolTag","SymbolInformation","containerName","WorkspaceSymbol","DocumentSymbol","detail","selectionRange","CodeActionKind","CodeActionTriggerKind","CodeActionContext","diagnostics","only","triggerKind","CodeAction","kindOrCommandOrEdit","checkKind","CodeLens","data","FormattingOptions","tabSize","insertSpaces","DocumentLink","SelectionRange","SemanticTokenTypes","SemanticTokenModifiers","SemanticTokens","InlineValueText","InlineValueVariableLookup","variableName","caseSensitiveLookup","InlineValueEvaluatableExpression","expression","InlineValueContext","frameId","stoppedLocation","InlayHintKind","InlayHintLabelPart","InlayHint","StringValue","createSnippet","InlineCompletionItem","insertText","filterText","InlineCompletionList","InlineCompletionTriggerKind","SelectedCompletionInfo","InlineCompletionContext","selectedCompletionInfo","WorkspaceFolder","EOL","TextDocument","content","FullTextDocument","applyEdits","document","sortedEdits","mergeSort","diff","lastModifiedOffset","compare","leftIdx","rightIdx","FullTextDocument$1","event","lineOffsets","isLineStart","ch","low","high","mid","lineOffset","nextLineOffset","defined","undefined","boolean","string","numberRange","objectLiteral","typedArray","check","CstNodeBuilder","RootCstNodeImpl","feature","compositeNode","CompositeCstNodeImpl","leafNode","LeafCstNodeImpl","tokens","added","AbstractCstNode","CstNodeContainer","firstNode","lastNode","firstRange","lastRange","DatatypeSymbol","isDataTypeNode","ruleSuffix","withRuleSuffix","AbstractLangiumParser","ProfilerWrapper","ChevrotainWrapper","choices","callback","LangiumParser","infixName","ruleMethod","precedence","lexerResult","$type","createNode","hiddenTokens","convertedValue","fragment","newItem","parts","operators","lowestPrecedenceIdx","lowestPrecedenceValue","operator","opPrecedence","leftOperators","rightOperators","leftParts","rightParts","leftInfix","rightInfix","leftTree","rightTree","existingValue","newValue","targetCstNode","AbstractParserErrorMessageProvider","LangiumParserErrorMessageProvider","LangiumCompletionParser","defaultConfig","useDefaultLookahead","task","createParser","parser","buildRules","parserContext","reachable","parserRules","buildElement","infixRules","buildInfixRule","expressionRule","allKeywords","outerGroup","part1Assignment","innerGroup","operatorAssignment","part2Assignment","getRule","ignoreGuard","method","buildKeyword","buildAction","buildCrossReference","buildRuleCall","buildAlternatives","buildUnorderedGroup","buildGroup","wrap","getGuardCondition","ruleCall","buildRuleCallPredicate","getToken","namedArgs","arg","namedPredicates","buildPredicate","ruleArgs","parameterName","condition","methods","predicatedMethod","orIdx","idFunc","groupIdx","lParser","stackId","groupState","wrapped","assignTerminal","cardinality","getRuleName","createCompletionParser","lexer","createLangiumParser","prepareLangiumParser","DefaultTokenBuilder","reachableRules","terminalTokens","stickyRegex","caseInsensitive","keywordPattern","longerAlts","DefaultValueConverter","ValueConverter","convertString","c1","convertEscapeCharacter","convertID","convertInt","convertBigint","convertDate","convertNumber","convertBoolean","ral","_ral","RAL","install","stringArray","elem","events","ral_1","require$$0","Event","_disposable","CallbackList","context","bucket","foundCallbackWithDifferentContext","ret","callbacks","contexts","Emitter","_options","listener","thisArgs","disposables","cancellation","require$$1","events_1","require$$2","CancellationToken","shortcutEvent","MutableToken","CancellationTokenSource","delayNextTick","resolve","lastTick","globalInterruptionPeriod","startCancelableOperation","OperationCancelled","isOperationCancelled","err","interruptAndCheck","Deferred","changes","getWellformedRange","addedLineOffsets","computeLineOffsets","isEOL","update","getWellformedEdit","spans","isAtLineStart","textOffset","LIB","r","o","h","f","u","l","I","__publicField","w","m","y","C","A","P","Utils","UriUtils","isWindows","equals","relative","fromPath","toPath","fromParts","toParts","upperCaseDriveLetter","backPart","toPart","normalize","contains","parentPath","childPath","UriTrie","nodeToDelete","uriString","part","DocumentState","DefaultLangiumDocumentFactory","cancellationToken","model","parseResult","cancelToken","textDocumentGetter","oldText","serviceRegistry","textDoc","DefaultLangiumDocuments","folder","langiumDoc","langiumDocs","RefResolving","DefaultLinker","linkedNode","descriptions","desc","refNode","refText","linker","refData","nodeDescription","doc","targetDescription","isNamed","DefaultNameProvider","DefaultReferences","sourceCstNode","nodeElem","nameNode","references","headNode","astNodes","cstNodes","targetNode","refs","indexReferences","selfNodes","selfNode","MultiMap","elements","BiMap","DefaultScopeComputation","parentNode","exports","rootNode","symbols","container","StreamScope","outerScope","lowerCaseName","local","MultiMapScope","localName","elementStream","DisposableCache","disposable","SimpleCache","provider","ContextCache","converter","contextKey","contextCache","documentCache","WorkspaceCache","sharedServices","_changed","deleted","DefaultScopeProvider","scopes","localSymbols","currentNode","_context","isAstNodeWithComment","isIntermediateReference","DefaultJsonSerializer","serializeOptions","specificReplacer","defaultReplacer","replacer","deserializeOptions","sourceText","textRegions","comments","uriConverter","refValue","$refText","targetDocument","$refs","comment","createDocumentSegment","textRegion","assignments","propertyAssignments","containerProperty","containerIndex","propertyName","mutable","refUri","fragmentIndex","documentUri","DefaultServiceRegistry","language","ext","diagnosticData","ValidationCategory","ValidationRegistry","checksRecord","thisObj","category","accept","functionality","messageContext","messageDetails","checks","checkBefore","checkAfter","_document","VALIDATE_EACH_NODE","DefaultDocumentValidator","DocumentValidator","lexerDiagnostics","lexerDiagnostic","diagnostic","toDiagnosticSeverity","toDiagnosticData","parserError","linkingError","info","validationItems","acceptor","checksBefore","nodeOptions","_node","checksAfter","getDiagnosticRange","DefaultAstNodeDescriptionProvider","nameNodeSegment","nameSegmentGetter","DefaultReferenceDescriptionProvider","descr","sourceUri","sourcePath","segment","DefaultAstNodeLocator","containerPath","newSegment","$containerProperty","$containerIndex","currentValue","propertyIndex","arrayIndex","DefaultConfigurationProvider","params","languages","lang","configToUpdate","conf","section","configuration","sectionName","messages","ErrorCodes","ResponseError","ParameterStructures","AbstractMessageSignature","numberOfParams","RequestType0","RequestType","_parameterStructures","RequestType1","RequestType2","RequestType3","RequestType4","RequestType5","RequestType6","RequestType7","RequestType8","RequestType9","NotificationType","NotificationType0","NotificationType1","NotificationType2","NotificationType3","NotificationType4","NotificationType5","NotificationType6","NotificationType7","NotificationType8","NotificationType9","Message","isRequest","isNotification","isResponse","linkedMap","Touch","LinkedMap","touch","thisArg","newSize","currentSize","LRUCache","limit","ratio","Disposable","sharedArrayCancellation","cancellation_1","CancellationState","SharedArraySenderStrategy","request","buffer","_conn","SharedArrayBufferCancellationToken","SharedArrayBufferCancellationTokenSource","SharedArrayReceiverStrategy","semaphore","Semaphore","capacity","thunk","messageReader","semaphore_1","require$$3","MessageReader","AbstractMessageReader","ResolvedMessageReaderOptions","fromOptions","charset","contentDecoder","contentDecoders","contentTypeDecoder","contentTypeDecoders","decoder","ReadableStreamMessageReader","readable","timeout","headers","contentLength","body","bytes","messageWriter","ContentLength","CRLF","MessageWriter","AbstractMessageWriter","ResolvedMessageWriterOptions","WriteableStreamMessageWriter","writable","messageBuffer","CR","LF","AbstractMessageBuffer","encoding","chunk","toAppend","lowerCaseKeys","chunkIndex","chunkBytesRead","row","header","byteCount","resultOffset","chunkPart","messages_1","linkedMap_1","require$$4","require$$5","CancelNotification","ProgressToken","ProgressNotification","ProgressType","StarRequestHandler","Trace","TraceValues","fromString","TraceFormat","SetTraceNotification","LogTraceNotification","ConnectionErrors","ConnectionError","ConnectionStrategy","IdCancellationReceiverStrategy","RequestCancellationReceiverStrategy","CancellationReceiverStrategy","CancellationSenderStrategy","conn","CancellationStrategy","MessageStrategy","ConnectionOptions","ConnectionState","createMessageConnection","_logger","logger","sequenceNumber","notificationSequenceNumber","unknownResponseSequenceNumber","starRequestHandler","requestHandlers","starNotificationHandler","notificationHandlers","progressHandlers","messageQueue","responsePromises","knownCanceledRequests","requestTokens","trace","traceFormat","errorEmitter","closeEmitter","unhandledNotificationEmitter","unhandledProgressEmitter","disposeEmitter","cancellationStrategy","createRequestQueueKey","createResponseQueueKey","createNotificationQueueKey","addMessageToQueue","queue","cancelUndispatched","_message","isListening","isClosed","isDisposed","closeHandler","readErrorHandler","writeErrorHandler","triggerMessageQueue","processMessageQueue","handleMessage","handleRequest","handleNotification","handleResponse","handleInvalidMessage","messageStrategy","cancelId","toCancel","strategy","response","traceSendingResponse","traceReceivedNotification","requestMessage","reply","resultOrError","startTime","replyError","replySuccess","traceReceivedRequest","requestHandler","tokenKey","cancellationSource","handlerResult","promise","responseMessage","responsePromise","traceReceivedResponse","notificationHandler","responseHandler","stringifyTrace","traceSendingRequest","logLSPMessage","traceSendingNotification","lspMessage","throwIfClosedOrDisposed","throwIfListening","throwIfNotListening","undefinedToNull","nullToUndefined","isNamedParam","computeSingleParam","parameterStructures","computeMessageParams","connection","messageParams","paramStart","paramEnd","notificationMessage","handler","_type","resolveWithCleanup","rejectWithCleanup","_value","_tracer","sendNotificationOrTraceOptions","_sendNotification","_traceFormat","verbose","disposable_1","sharedArrayCancellation_1","messageReader_1","require$$6","messageWriter_1","require$$7","messageBuffer_1","require$$8","connection_1","require$$9","require$$10","ril","api_1","MessageBuffer","_encoding","ReadableStreamWrapper","socket","WritableStreamWrapper","_textEncoder","_ril","ms","RIL","__createBinding","this","k2","__exportStar","BrowserMessageReader","port","BrowserMessageWriter","reader","writer","browser","vscode_jsonrpc_1","MessageDirection","RegistrationType","ProtocolRequestType0","ProtocolRequestType","ProtocolNotificationType0","ProtocolNotificationType","protocol_implementation","ImplementationRequest","protocol_typeDefinition","TypeDefinitionRequest","protocol_workspaceFolder","WorkspaceFoldersRequest","DidChangeWorkspaceFoldersNotification","protocol_configuration","ConfigurationRequest","protocol_colorProvider","DocumentColorRequest","ColorPresentationRequest","protocol_foldingRange","FoldingRangeRequest","FoldingRangeRefreshRequest","protocol_declaration","DeclarationRequest","protocol_selectionRange","SelectionRangeRequest","protocol_progress","WorkDoneProgress","WorkDoneProgressCreateRequest","WorkDoneProgressCancelNotification","protocol_callHierarchy","CallHierarchyPrepareRequest","CallHierarchyIncomingCallsRequest","CallHierarchyOutgoingCallsRequest","protocol_semanticTokens","TokenFormat","SemanticTokensRegistrationType","SemanticTokensRequest","SemanticTokensDeltaRequest","SemanticTokensRangeRequest","SemanticTokensRefreshRequest","protocol_showDocument","ShowDocumentRequest","protocol_linkedEditingRange","LinkedEditingRangeRequest","protocol_fileOperations","FileOperationPatternKind","WillCreateFilesRequest","DidCreateFilesNotification","WillRenameFilesRequest","DidRenameFilesNotification","DidDeleteFilesNotification","WillDeleteFilesRequest","protocol_moniker","UniquenessLevel","MonikerKind","MonikerRequest","protocol_typeHierarchy","TypeHierarchyPrepareRequest","TypeHierarchySupertypesRequest","TypeHierarchySubtypesRequest","protocol_inlineValue","InlineValueRequest","InlineValueRefreshRequest","protocol_inlayHint","InlayHintRequest","InlayHintResolveRequest","InlayHintRefreshRequest","protocol_diagnostic","DiagnosticServerCancellationData","DocumentDiagnosticReportKind","DocumentDiagnosticRequest","WorkspaceDiagnosticRequest","DiagnosticRefreshRequest","protocol_notebook","vscode_languageserver_types_1","NotebookCellKind","ExecutionSummary","executionOrder","success","NotebookCell","equalsMetadata","oneArray","otherArray","oneKeys","otherKeys","NotebookDocument","notebookType","cells","NotebookDocumentSyncRegistrationType","DidOpenNotebookDocumentNotification","NotebookCellArrayChange","deleteCount","DidChangeNotebookDocumentNotification","DidSaveNotebookDocumentNotification","DidCloseNotebookDocumentNotification","protocol_inlineCompletion","InlineCompletionRequest","protocol_implementation_1","protocol_typeDefinition_1","protocol_workspaceFolder_1","protocol_configuration_1","protocol_colorProvider_1","protocol_foldingRange_1","protocol_declaration_1","protocol_selectionRange_1","protocol_progress_1","require$$11","protocol_callHierarchy_1","require$$12","protocol_semanticTokens_1","require$$13","protocol_showDocument_1","require$$14","protocol_linkedEditingRange_1","require$$15","protocol_fileOperations_1","require$$16","protocol_moniker_1","require$$17","protocol_typeHierarchy_1","require$$18","protocol_inlineValue_1","require$$19","protocol_inlayHint_1","require$$20","protocol_diagnostic_1","require$$21","protocol_notebook_1","require$$22","protocol_inlineCompletion_1","require$$23","TextDocumentFilter","NotebookDocumentFilter","NotebookCellTextDocumentFilter","DocumentSelector","RegistrationRequest","UnregistrationRequest","ResourceOperationKind","FailureHandlingKind","PositionEncodingKind","StaticRegistrationOptions","hasId","TextDocumentRegistrationOptions","WorkDoneProgressOptions","hasWorkDoneProgress","InitializeRequest","InitializeErrorCodes","InitializedNotification","ShutdownRequest","ExitNotification","DidChangeConfigurationNotification","MessageType","ShowMessageNotification","ShowMessageRequest","LogMessageNotification","TelemetryEventNotification","TextDocumentSyncKind","DidOpenTextDocumentNotification","TextDocumentContentChangeEvent","isIncremental","isFull","DidChangeTextDocumentNotification","DidCloseTextDocumentNotification","DidSaveTextDocumentNotification","TextDocumentSaveReason","WillSaveTextDocumentNotification","WillSaveTextDocumentWaitUntilRequest","DidChangeWatchedFilesNotification","FileChangeType","RelativePattern","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","createProtocolConnection","output","LSPErrorCodes","browser_1","DefaultDocumentBuilder","documents","changed","deletedUris","deletedUri","deletedDocs","changedUris","changedUri","changedDocument","allChangedUris","rebuildDocuments","allCategories","executedCategories","requestedCategories","requested","stat","scopeComputation","toBeLinked","toBeValidated","targetState","targetStateDocs","uriOrToken","buildDisposable","cancelDisposable","listenersCopy","validator","validationOptions","DefaultIndexManager","astNodePath","targetDocUri","docRefs","refDescr","nodeType","uris","documentUris","indexData","DefaultWorkspaceManager","_params","folders","collector","wf","uniqueUris","_folders","_collector","workspaceFolder","folderPath","DefaultLexerErrorMessageProvider","DEFAULT_TOKENIZE_OPTIONS","DefaultLexer","lexerTokens","isTokenTypeDictionary","ChevrotainLexer","chevrotainResult","buildTokens","isIMultiModeLexerDefinition","res","isTokenTypeArray","parseJSDoc","opts","lines","getLines","normalizedOptions","normalizeOptions","tokenize","parseJSDocComment","isJSDoc","firstRegex","lastRegex","tagRegex","inlineTagRegex","currentLine","currentCharacter","lastCharacter","skipWhitespace","tagMatch","fullMatch","inlineTagMatches","buildInlineTokens","tags","lineIndex","characterIndex","lastIndex","matchIndex","startContent","tagName","endContent","nonWhitespaceRegex","whitespaceEndRegex","startPosition","JSDocCommentImpl","parseJSDocElement","parseJSDocTag","parseJSDocText","appendEmptyLine","JSDocLineImpl","firstToken","lastToken","parseJSDocInline","JSDocTextImpl","parseJSDocLine","inline","tagToken","docLine","JSDocTagImpl","normalizeOption","escaped","fillNewlines","rendered","renderInlineTag","marker","tag","display","displayStart","renderLinkDefault","JSDocDocumentationProvider","link","_tag","precomputed","DefaultCommentProvider","DefaultAsyncParser","_cancelToken","DefaultWorkspaceLock","tokenSource","deferred","entries","DefaultHydrator","lexerReport","arr","num","cstNodeObj","hydrated","createDefaultCoreModule","createDefaultSharedCoreModule","Module","m1","m2","_merge","inject","module1","module2","module3","module4","module5","module6","module7","module8","module9","module","_inject","isProxy","injector","proxy","_resolve","__requested__","sourceValue","targetValue","EmptyFileSystemProvider","_uri","EmptyFileSystem","minimalGrammarModule","minimalSharedGrammarModule","ast.LangiumGrammarAstReflection","createMinimalGrammarServices","shared","loadGrammarFromJson","json","__defProp","__name","ArchitectureGrammar","ArchitectureGrammar2","GitGraphGrammar","GitGraphGrammar2","InfoGrammar","InfoGrammar2","PacketGrammar","PacketGrammar2","PieGrammar","PieGrammar2","RadarGrammar","RadarGrammar2","TreemapGrammar","TreemapGrammar2","Architecture","isArchitecture","Axis","Branch","isBranch","Checkout","CherryPicking","ClassDefStatement","Commit","isCommit","Curve","Direction","Edge","Entry","GitGraph","isGitGraph","Info","isInfo","Item","Junction","Leaf","Merge","isMerge","Packet","isPacket","PacketBlock","isPacketBlock","Pie","isPie","PieSection","isPieSection","Radar","Section","Service","Statement","Treemap","isTreemap","TreemapRow","MermaidAstReflection","loadedArchitectureGrammarGrammar","ArchitectureGrammarGrammar","loadedGitGraphGrammarGrammar","GitGraphGrammarGrammar","loadedInfoGrammarGrammar","InfoGrammarGrammar","loadedPacketGrammarGrammar","PacketGrammarGrammar","loadedPieGrammarGrammar","PieGrammarGrammar","loadedRadarGrammarGrammar","RadarGrammarGrammar","loadedTreemapGrammarGrammar","TreemapGrammarGrammar","ArchitectureGrammarLanguageMetaData","GitGraphGrammarLanguageMetaData","InfoGrammarLanguageMetaData","PacketGrammarLanguageMetaData","PieGrammarLanguageMetaData","RadarGrammarLanguageMetaData","TreemapGrammarLanguageMetaData","MermaidGeneratedSharedModule","ArchitectureGrammarGeneratedModule","GitGraphGrammarGeneratedModule","InfoGrammarGeneratedModule","PacketGrammarGeneratedModule","PieGrammarGeneratedModule","RadarGrammarGeneratedModule","TreemapGrammarGeneratedModule","accessibilityDescrRegex","accessibilityTitleRegex","titleRegex","rulesRegexes","AbstractMermaidValueConverter","_cstNode","CommonValueConverter","_rule","_input","AbstractMermaidTokenBuilder","keywords","GitGraphTokenBuilder","GitGraphModule","createGitGraphServices","InfoTokenBuilder","InfoModule","createInfoServices","PacketTokenBuilder","PacketModule","createPacketServices","PieTokenBuilder","PieValueConverter","PieModule","createPieServices","ArchitectureTokenBuilder","ArchitectureValueConverter","ArchitectureModule","createArchitectureServices","RadarTokenBuilder","RadarModule","createRadarServices","TreemapTokenBuilder","classDefRegex","TreemapValueConverter","registerValidationChecks","registry","TreemapValidator","rootNodeIndentation","TreemapModule","createTreemapServices","parsers","initializers","createInfoServices2","infoVBDWY6EO","createPacketServices2","packetDYOGHKS2","createPieServices2","pieVRWISCQL","createArchitectureServices2","architecture7HQA4BMR","createGitGraphServices2","gitGraphG5XIXVHT","createRadarServices2","radarZZBFDIW7","createTreemapServices2","treemapGDKQZRPO","parse","diagramType","MermaidParseError","lexerErrors","parserErrors"],"mappings":";;;;;;;AAQA,IAAIA,KAAc,OAAO,WAGrBC,KAAiBD,GAAY,gBAkC7BE,KAASC,GAAe,SAASC,GAAQC,GAAQ;AACnD,MAAIC,GAAYD,CAAM,KAAKE,GAAYF,CAAM,GAAG;AAC9C,IAAAG,GAAWH,GAAQI,GAAKJ,CAAM,GAAGD,CAAM;AACvC;AAAA,EACF;AACA,WAASM,KAAOL;AACd,IAAIJ,GAAe,KAAKI,GAAQK,CAAG,KACjCC,GAAYP,GAAQM,GAAKL,EAAOK,CAAG,CAAC;AAG1C,CAAC;AC9CD,SAASE,GAAUC,GAAOC,GAAOC,GAAK;AACpC,MAAIC,IAAQ,IACRC,IAASJ,EAAM;AAEnB,EAAIC,IAAQ,MACVA,IAAQ,CAACA,IAAQG,IAAS,IAAKA,IAASH,IAE1CC,IAAMA,IAAME,IAASA,IAASF,GAC1BA,IAAM,MACRA,KAAOE,IAETA,IAASH,IAAQC,IAAM,IAAMA,IAAMD,MAAW,GAC9CA,OAAW;AAGX,WADII,IAAS,MAAMD,CAAM,GAClB,EAAED,IAAQC;AACf,IAAAC,EAAOF,CAAK,IAAIH,EAAMG,IAAQF,CAAK;AAErC,SAAOI;AACT;ACbA,SAASC,GAAQN,GAAO;AAMtB,WALIG,IAAQ,IACRC,IAASJ,KAAS,OAAO,IAAIA,EAAM,QACnCO,IAAW,GACXF,IAAS,CAAA,GAEN,EAAEF,IAAQC,KAAQ;AACvB,QAAII,IAAQR,EAAMG,CAAK;AACvB,IAAIK,MACFH,EAAOE,GAAU,IAAIC;AAAA,EAEzB;AACA,SAAOH;AACT;AClBA,SAASI,GAAgBT,GAAOU,GAAQC,GAAUC,GAAa;AAI7D,WAHIT,IAAQ,IACRC,IAASJ,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEG,IAAQC,KAAQ;AACvB,QAAII,IAAQR,EAAMG,CAAK;AACvB,IAAAO,EAAOE,GAAaJ,GAAOG,EAASH,CAAK,GAAGR,CAAK;AAAA,EACnD;AACA,SAAOY;AACT;ACNA,SAASC,GAAeC,GAAYJ,GAAQC,GAAUC,GAAa;AACjE,SAAAG,GAASD,GAAY,SAASN,GAAOX,GAAKiB,GAAY;AACpD,IAAAJ,EAAOE,GAAaJ,GAAOG,EAASH,CAAK,GAAGM,CAAU;AAAA,EACxD,CAAC,GACMF;AACT;ACLA,SAASI,GAAiBN,GAAQO,GAAa;AAC7C,SAAO,SAASH,GAAYH,GAAU;AACpC,QAAIO,IAAOC,GAAQL,CAAU,IAAIL,KAAkBI,IAC/CD,IAAcK,IAAcA,EAAW,IAAK,CAAA;AAEhD,WAAOC,EAAKJ,GAAYJ,GAAQU,GAAaT,CAAW,GAAGC,CAAW;AAAA,EACxE;AACF;ACZA,IAAIS,KAAmB;AAavB,SAASC,GAAetB,GAAOuB,GAAQZ,GAAUa,GAAY;AAC3D,MAAIrB,IAAQ,IACRsB,IAAWC,IACXC,IAAW,IACXvB,IAASJ,EAAM,QACfK,IAAS,CAAA,GACTuB,IAAeL,EAAO;AAE1B,MAAI,CAACnB;AACH,WAAOC;AASJ,EAAIkB,EAAO,UAAUF,OACxBI,IAAWI,IACXF,IAAW,IACXJ,IAAS,IAAIO,GAASP,CAAM;AAE9B,EAAAQ;AACA,WAAO,EAAE5B,IAAQC,KAAQ;AACvB,UAAII,IAAQR,EAAMG,CAAK,GACnB6B,IAA8BxB;AAGlC,UADAA,IAAuBA,MAAU,IAAKA,IAAQ,GAC1CmB,KAAYK,MAAaA,GAAU;AAErC,iBADIC,IAAcL,GACXK;AACL,cAAIV,EAAOU,CAAW,MAAMD;AAC1B,qBAASD;AAGb,QAAA1B,EAAO,KAAKG,CAAK;AAAA,MACnB,MACK,CAAKiB,EAASF,GAAQS,GAAUR,CAAU,KAC7CnB,EAAO,KAAKG,CAAK;AAAA,IAErB;AACA,SAAOH;AACT;ACtCA,IAAI6B,KAAaC,GAAS,SAASnC,GAAOuB,GAAQ;AAChD,SAAOa,GAAkBpC,CAAK,IAC1BsB,GAAetB,GAAOqC,GAAYd,GAAQ,GAAGa,IAAmB,EAAI,CAAC,IACrE,CAAA;AACN,CAAC;ACFD,SAASE,GAAKtC,GAAOuC,GAAGC,GAAO;AAC7B,MAAIpC,IAASJ,KAAS,OAAO,IAAIA,EAAM;AACvC,SAAKI,KAGLmC,IAAcA,MAAM,SAAa,IAAIE,GAAUF,CAAC,GACzCxC,GAAUC,GAAOuC,IAAI,IAAI,IAAIA,GAAGnC,CAAM,KAHpC,CAAA;AAIX;ACPA,SAASsC,GAAU1C,GAAOuC,GAAGC,GAAO;AAClC,MAAIpC,IAASJ,KAAS,OAAO,IAAIA,EAAM;AACvC,SAAKI,KAGLmC,IAAcA,MAAM,SAAa,IAAIE,GAAUF,CAAC,GAChDA,IAAInC,IAASmC,GACNxC,GAAUC,GAAO,GAAGuC,IAAI,IAAI,IAAIA,CAAC,KAJ/B,CAAA;AAKX;AC1BA,SAASI,GAAW3C,GAAO4C,GAAW;AAIpC,WAHIzC,IAAQ,IACRC,IAASJ,KAAS,OAAO,IAAIA,EAAM,QAEhC,EAAEG,IAAQC;AACf,QAAI,CAACwC,EAAU5C,EAAMG,CAAK,GAAGA,GAAOH,CAAK;AACvC,aAAO;AAGX,SAAO;AACT;ACTA,SAAS6C,GAAU/B,GAAY8B,GAAW;AACxC,MAAIvC,IAAS;AACb,SAAAU,GAASD,GAAY,SAASN,GAAOL,GAAOW,GAAY;AACtD,WAAAT,IAAS,CAAC,CAACuC,EAAUpC,GAAOL,GAAOW,CAAU,GACtCT;AAAA,EACT,CAAC,GACMA;AACT;AC6BA,SAASyC,GAAMhC,GAAY8B,GAAWJ,GAAO;AAC3C,MAAItB,IAAOC,GAAQL,CAAU,IAAI6B,KAAaE;AAI9C,SAAO3B,EAAKJ,GAAYM,GAAawB,CAAY,CAAC;AACpD;ACnCA,SAASG,GAAK/C,GAAO;AACnB,SAAQA,KAASA,EAAM,SAAUA,EAAM,CAAC,IAAI;AAC9C;ACIA,SAASgD,GAAQlC,GAAYH,GAAU;AACrC,SAAO0B,GAAYY,EAAInC,GAAYH,CAAQ,CAAI;AACjD;ACtBA,IAAIxB,KAAc,OAAO,WAGrBC,KAAiBD,GAAY,gBAyB7B+D,KAAUlC,GAAiB,SAASX,GAAQG,GAAOX,GAAK;AAC1D,EAAIT,GAAe,KAAKiB,GAAQR,CAAG,IACjCQ,EAAOR,CAAG,EAAE,KAAKW,CAAK,IAEtB2C,GAAgB9C,GAAQR,GAAK,CAACW,CAAK,CAAC;AAExC,CAAC,GCjCG4C,KAAY;AAmBhB,SAASC,GAAS7C,GAAO;AACvB,SAAO,OAAOA,KAAS,YACpB,CAACW,GAAQX,CAAK,KAAK8C,GAAa9C,CAAK,KAAK+C,GAAW/C,CAAK,KAAK4C;AACpE;ACpBA,IAAII,KAAY,KAAK;AAgCrB,SAAS/B,GAASX,GAAYN,GAAOiD,GAAWjB,GAAO;AACrD,EAAA1B,IAAapB,GAAYoB,CAAU,IAAIA,IAAaS,GAAOT,CAAU,GACrE2C,IAAaA,IAAuBhB,GAAUgB,CAAS,IAAI;AAE3D,MAAIrD,IAASU,EAAW;AACxB,SAAI2C,IAAY,MACdA,IAAYD,GAAUpD,IAASqD,GAAW,CAAC,IAEtCJ,GAASvC,CAAU,IACrB2C,KAAarD,KAAUU,EAAW,QAAQN,GAAOiD,CAAS,IAAI,KAC9D,CAAC,CAACrD,KAAUsD,GAAY5C,GAAYN,GAAOiD,CAAS,IAAI;AAC/D;ACrBA,SAASE,GAAQ3D,GAAOQ,GAAOiD,GAAW;AACxC,MAAIrD,IAASJ,KAAS,OAAO,IAAIA,EAAM;AACvC,MAAI,CAACI;AACH,WAAO;AAET,MAAID,IAA4B;AAIhC,SAAOuD,GAAY1D,GAAOQ,GAAOL,CAAK;AACxC;ACnCA,IAAIyD,KAAY;AAShB,SAASC,GAAarD,GAAO;AAC3B,SAAO8C,GAAa9C,CAAK,KAAK+C,GAAW/C,CAAK,KAAKoD;AACrD;ACVA,IAAIE,KAAeC,MAAYA,GAAS,UAmBpCC,KAAWF,KAAeG,GAAUH,EAAY,IAAID,ICvBpDK,KAAkB;AAsBtB,SAASC,GAAOvB,GAAW;AACzB,MAAI,OAAOA,KAAa;AACtB,UAAM,IAAI,UAAUsB,EAAe;AAErC,SAAO,WAAW;AAChB,QAAIE,IAAO;AACX,YAAQA,EAAK,QAAM;AAAA,MACjB,KAAK;AAAG,eAAO,CAACxB,EAAU,KAAK,IAAI;AAAA,MACnC,KAAK;AAAG,eAAO,CAACA,EAAU,KAAK,MAAMwB,EAAK,CAAC,CAAC;AAAA,MAC5C,KAAK;AAAG,eAAO,CAACxB,EAAU,KAAK,MAAMwB,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,MACrD,KAAK;AAAG,eAAO,CAACxB,EAAU,KAAK,MAAMwB,EAAK,CAAC,GAAGA,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,IACpE;AACI,WAAO,CAACxB,EAAU,MAAM,MAAMwB,CAAI;AAAA,EACpC;AACF;ACdA,SAASC,GAAO9E,GAAQqD,GAAW;AACjC,MAAIrD,KAAU;AACZ,WAAO,CAAA;AAET,MAAI+E,IAAQC,GAASC,GAAajF,CAAM,GAAG,SAASkF,GAAM;AACxD,WAAO,CAACA,CAAI;AAAA,EACd,CAAC;AACD,SAAA7B,IAAYxB,GAAawB,CAAS,GAC3B8B,GAAWnF,GAAQ+E,GAAO,SAAS9D,GAAOmE,GAAM;AACrD,WAAO/B,EAAUpC,GAAOmE,EAAK,CAAC,CAAC;AAAA,EACjC,CAAC;AACH;ACMA,SAASC,GAAO9D,GAAY8B,GAAW;AACrC,MAAI1B,IAAOC,GAAQL,CAAU,IAAI+D,KAAcC;AAC/C,SAAO5D,EAAKJ,GAAYqD,GAAO/C,GAAawB,CAAY,CAAC,CAAC;AAC5D;AChCA,SAASmC,GAASjE,GAAY8B,GAAW;AACvC,MAAIvC;AAEJ,SAAAU,GAASD,GAAY,SAASN,GAAOL,GAAOW,GAAY;AACtD,WAAAT,IAASuC,EAAUpC,GAAOL,GAAOW,CAAU,GACpC,CAACT;AAAA,EACV,CAAC,GACM,CAAC,CAACA;AACX;ACuBA,SAAS2E,GAAKlE,GAAY8B,GAAWJ,GAAO;AAC1C,MAAItB,IAAOC,GAAQL,CAAU,IAAImE,KAAYF;AAI7C,SAAO7D,EAAKJ,GAAYM,GAAawB,CAAY,CAAC;AACpD;AC5BA,SAASsC,GAAKlF,GAAO;AACnB,SAAQA,KAASA,EAAM,SAAUmF,GAASnF,CAAK,IAAI,CAAA;AACrD;ACIA,SAASoF,GAAOpF,GAAOW,GAAU;AAC/B,SAAQX,KAASA,EAAM,SAAUmF,GAASnF,GAAOoB,GAAaT,CAAW,CAAC,IAAI,CAAA;AAChF;ACvBO,SAAS0E,GAAUC,GAAK;AAC3B,SAAO,OAAOA,KAAQ,YAAYA,MAAQ,QAAQ,OAAOA,EAAI,SAAU;AAC3E;AACO,SAASC,GAAYD,GAAK;AAC7B,SAAO,OAAOA,KAAQ,YAAYA,MAAQ,QAAQ,OAAOA,EAAI,YAAa,YAAY,SAASA;AACnG;AACO,SAASE,GAAiBF,GAAK;AAClC,SAAO,OAAOA,KAAQ,YAAYA,MAAQ,QAAQ,OAAOA,EAAI,YAAa,YAAY,WAAWA;AACrG;AACO,SAASG,GAAqBH,GAAK;AACtC,SAAO,OAAOA,KAAQ,YAAYA,MAAQ,QACnC,OAAOA,EAAI,QAAS,YACpB,OAAOA,EAAI,QAAS,YACpB,OAAOA,EAAI,QAAS;AAC/B;AACO,SAASI,GAAeJ,GAAK;AAChC,SAAO,OAAOA,KAAQ,YAAYA,MAAQ,QACnC,OAAOA,EAAI,QAAS,YACpB,OAAOA,EAAI,WAAY;AAClC;AAKO,MAAMK,GAAsB;AAAA,EAC/B,cAAc;AACV,SAAK,WAAW,CAAA,GAChB,KAAK,cAAc,CAAA;AAAA,EACvB;AAAA,EACA,cAAc;AACV,WAAO,OAAO,KAAK,KAAK,KAAK;AAAA,EACjC;AAAA,EACA,iBAAiBC,GAAS;AACtB,UAAMC,IAAW,KAAK,MAAMD,EAAQ,UAAU,KAAK;AACnD,QAAI,CAACC;AACD,YAAM,IAAI,MAAM,QAAQD,EAAQ,UAAU,SAAS,WAAW,aAAa;AAE/E,UAAME,IAAgBD,EAAS,WAAWD,EAAQ,QAAQ,GAAG;AAC7D,QAAI,CAACE;AACD,YAAM,IAAI,MAAM,YAAYF,EAAQ,YAAY,WAAW,YAAYA,EAAQ,UAAU,KAAK,sBAAsB;AAExH,WAAOE;AAAA,EACX;AAAA,EACA,gBAAgBC,GAAM;AAClB,UAAM1F,IAAS,KAAK,MAAM0F,CAAI;AAC9B,WAAK1F,KACM;AAAA,MACH,MAAM0F;AAAA,MACN,YAAY,CAAA;AAAA,MACZ,YAAY,CAAA;AAAA,IAC5B;AAAA,EAGI;AAAA,EACA,WAAWC,GAAMD,GAAM;AACnB,WAAOV,GAAUW,CAAI,KAAK,KAAK,UAAUA,EAAK,OAAOD,CAAI;AAAA,EAC7D;AAAA,EACA,UAAUE,GAASC,GAAW;AAC1B,QAAID,MAAYC;AACZ,aAAO;AAEX,QAAIC,IAAS,KAAK,SAASF,CAAO;AAClC,IAAKE,MACDA,IAAS,KAAK,SAASF,CAAO,IAAI,CAAA;AAEtC,UAAMG,IAAWD,EAAOD,CAAS;AACjC,QAAIE,MAAa;AACb,aAAOA;AAEN;AACD,YAAMP,IAAW,KAAK,MAAMI,CAAO,GAC7B5F,IAASwF,IAAWA,EAAS,WAAW,KAAK,CAAAQ,MAAK,KAAK,UAAUA,GAAGH,CAAS,CAAC,IAAI;AACxF,aAAAC,EAAOD,CAAS,IAAI7F,GACbA;AAAA,IACX;AAAA,EACJ;AAAA,EACA,eAAe0F,GAAM;AACjB,UAAMK,IAAW,KAAK,YAAYL,CAAI;AACtC,QAAIK;AACA,aAAOA;AAEN;AACD,YAAME,IAAW,KAAK,YAAW,GAC3BC,IAAQ,CAAA;AACd,iBAAWC,KAAmBF;AAC1B,QAAI,KAAK,UAAUE,GAAiBT,CAAI,KACpCQ,EAAM,KAAKC,CAAe;AAGlC,kBAAK,YAAYT,CAAI,IAAIQ,GAClBA;AAAA,IACX;AAAA,EACJ;AACJ;AACO,SAASE,GAAmBT,GAAM;AACrC,SAAO,OAAOA,KAAS,YAAYA,MAAS,QAAQ,MAAM,QAAQA,EAAK,OAAO;AAClF;AACO,SAASU,GAAcV,GAAM;AAChC,SAAO,OAAOA,KAAS,YAAYA,MAAS,QAAQ,OAAOA,EAAK,aAAc;AAClF;AACO,SAASW,GAAcX,GAAM;AAChC,SAAOS,GAAmBT,CAAI,KAAK,OAAOA,EAAK,YAAa;AAChE;ACjGO,MAAMY,GAAW;AAAA,EACpB,YAAYC,GAASC,GAAQ;AACzB,SAAK,UAAUD,GACf,KAAK,SAASC;AAAA,EAClB;AAAA,EACA,WAAW;AACP,UAAMC,IAAW;AAAA,MACb,OAAO,KAAK,QAAO;AAAA,MACnB,MAAM,MAAM,KAAK,OAAOA,EAAS,KAAK;AAAA,MACtC,CAAC,OAAO,QAAQ,GAAG,MAAMA;AAAA,IACrC;AACQ,WAAOA;AAAA,EACX;AAAA,EACA,CAAC,OAAO,QAAQ,IAAI;AAChB,WAAO,KAAK,SAAQ;AAAA,EACxB;AAAA,EACA,UAAU;AAEN,WAAO,EADU,KAAK,SAAQ,EACN,KAAI,EAAG;AAAA,EACnC;AAAA,EACA,QAAQ;AACJ,UAAMA,IAAW,KAAK,SAAQ;AAC9B,QAAIC,IAAQ,GACRC,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK;AACT,MAAAD,KACAC,IAAOF,EAAS,KAAI;AAExB,WAAOC;AAAA,EACX;AAAA,EACA,UAAU;AACN,UAAM3G,IAAS,CAAA,GACT0G,IAAW,KAAK,SAAQ;AAC9B,QAAIE;AACJ;AACI,MAAAA,IAAOF,EAAS,KAAI,GAChBE,EAAK,UAAU,UACf5G,EAAO,KAAK4G,EAAK,KAAK;AAAA,WAErB,CAACA,EAAK;AACf,WAAO5G;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,IAAI,IAAI,IAAI;AAAA,EACvB;AAAA,EACA,MAAM6G,GAAOC,GAAS;AAClB,UAAMC,IAAc,KAAK,IAAI,CAAAC,MAAW;AAAA,MACpCH,IAAQA,EAAMG,CAAO,IAAIA;AAAA,MACzBF,IAAUA,EAAQE,CAAO,IAAIA;AAAA,IACzC,CAAS;AACD,WAAO,IAAI,IAAID,CAAW;AAAA,EAC9B;AAAA,EACA,WAAW;AACP,WAAO,KAAK,KAAI;AAAA,EACpB;AAAA,EACA,OAAOE,GAAO;AACV,WAAO,IAAIV,GAAW,OAAO,EAAE,OAAO,KAAK,QAAO,GAAI,WAAW,IAAO,UAAUU,EAAM,OAAO,QAAQ,EAAC,EAAE,IAAK,CAAAC,MAAS;AACpH,UAAIlH;AACJ,UAAI,CAACkH,EAAM,WAAW;AAClB;AAEI,cADAlH,IAAS,KAAK,OAAOkH,EAAM,KAAK,GAC5B,CAAClH,EAAO;AACR,mBAAOA;AAAA,eAEN,CAACA,EAAO;AACjB,QAAAkH,EAAM,YAAY;AAAA,MACtB;AACA;AAEI,YADAlH,IAASkH,EAAM,SAAS,KAAI,GACxB,CAAClH,EAAO;AACR,iBAAOA;AAAA,aAEN,CAACA,EAAO;AACjB,aAAOmH;AAAA,IACX,CAAC;AAAA,EACL;AAAA,EACA,KAAKC,IAAY,KAAK;AAClB,UAAMV,IAAW,KAAK,SAAQ;AAC9B,QAAIvG,IAAQ,IACRH,GACAqH,IAAe;AACnB;AACI,MAAArH,IAAS0G,EAAS,KAAI,GACjB1G,EAAO,SACJqH,MACAlH,KAASiH,IAEbjH,KAASmH,GAAStH,EAAO,KAAK,IAElCqH,IAAe;AAAA,WACV,CAACrH,EAAO;AACjB,WAAOG;AAAA,EACX;AAAA,EACA,QAAQoH,GAAenE,IAAY,GAAG;AAClC,UAAMsD,IAAW,KAAK,SAAQ;AAC9B,QAAI5G,IAAQ,GACR8G,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK,QAAM;AACf,UAAI9G,KAASsD,KAAawD,EAAK,UAAUW;AACrC,eAAOzH;AAEX,MAAA8G,IAAOF,EAAS,KAAI,GACpB5G;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,MAAMyC,GAAW;AACb,UAAMmE,IAAW,KAAK,SAAQ;AAC9B,QAAIE,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK,QAAM;AACf,UAAI,CAACrE,EAAUqE,EAAK,KAAK;AACrB,eAAO;AAEX,MAAAA,IAAOF,EAAS,KAAI;AAAA,IACxB;AACA,WAAO;AAAA,EACX;AAAA,EACA,KAAKnE,GAAW;AACZ,UAAMmE,IAAW,KAAK,SAAQ;AAC9B,QAAIE,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK,QAAM;AACf,UAAIrE,EAAUqE,EAAK,KAAK;AACpB,eAAO;AAEX,MAAAA,IAAOF,EAAS,KAAI;AAAA,IACxB;AACA,WAAO;AAAA,EACX;AAAA,EACA,QAAQc,GAAY;AAChB,UAAMd,IAAW,KAAK,SAAQ;AAC9B,QAAI5G,IAAQ,GACR8G,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK;AACT,MAAAY,EAAWZ,EAAK,OAAO9G,CAAK,GAC5B8G,IAAOF,EAAS,KAAI,GACpB5G;AAAA,EAER;AAAA,EACA,IAAI0H,GAAY;AACZ,WAAO,IAAIjB,GAAW,KAAK,SAAS,CAACW,MAAU;AAC3C,YAAM,EAAE,MAAAO,GAAM,OAAAtH,EAAK,IAAK,KAAK,OAAO+G,CAAK;AACzC,aAAIO,IACON,KAGA,EAAE,MAAM,IAAO,OAAOK,EAAWrH,CAAK,EAAC;AAAA,IAEtD,CAAC;AAAA,EACL;AAAA,EACA,OAAOoC,GAAW;AACd,WAAO,IAAIgE,GAAW,KAAK,SAAS,CAAAW,MAAS;AACzC,UAAIlH;AACJ;AAEI,YADAA,IAAS,KAAK,OAAOkH,CAAK,GACtB,CAAClH,EAAO,QAAQuC,EAAUvC,EAAO,KAAK;AACtC,iBAAOA;AAAA,aAEN,CAACA,EAAO;AACjB,aAAOmH;AAAA,IACX,CAAC;AAAA,EACL;AAAA,EACA,cAAc;AACV,WAAO,KAAK,OAAO,OAAwB,KAAM,IAAI;AAAA,EACzD;AAAA,EACA,OAAOK,GAAYE,GAAc;AAC7B,UAAMhB,IAAW,KAAK,SAAQ;AAC9B,QAAIiB,IAAgBD,GAChBd,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK;AACT,MAAIe,MAAkB,SAClBA,IAAgBf,EAAK,QAGrBe,IAAgBH,EAAWG,GAAef,EAAK,KAAK,GAExDA,IAAOF,EAAS,KAAI;AAExB,WAAOiB;AAAA,EACX;AAAA,EACA,YAAYH,GAAYE,GAAc;AAClC,WAAO,KAAK,gBAAgB,KAAK,SAAQ,GAAIF,GAAYE,CAAY;AAAA,EACzE;AAAA,EACA,gBAAgBhB,GAAUc,GAAYE,GAAc;AAChD,UAAMd,IAAOF,EAAS,KAAI;AAC1B,QAAIE,EAAK;AACL,aAAOc;AAEX,UAAMC,IAAgB,KAAK,gBAAgBjB,GAAUc,GAAYE,CAAY;AAC7E,WAAIC,MAAkB,SACXf,EAAK,QAETY,EAAWG,GAAef,EAAK,KAAK;AAAA,EAC/C;AAAA,EACA,KAAKrE,GAAW;AACZ,UAAMmE,IAAW,KAAK,SAAQ;AAC9B,QAAIE,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK,QAAM;AACf,UAAIrE,EAAUqE,EAAK,KAAK;AACpB,eAAOA,EAAK;AAEhB,MAAAA,IAAOF,EAAS,KAAI;AAAA,IACxB;AAAA,EAEJ;AAAA,EACA,UAAUnE,GAAW;AACjB,UAAMmE,IAAW,KAAK,SAAQ;AAC9B,QAAI5G,IAAQ,GACR8G,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK,QAAM;AACf,UAAIrE,EAAUqE,EAAK,KAAK;AACpB,eAAO9G;AAEX,MAAA8G,IAAOF,EAAS,KAAI,GACpB5G;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,SAASyH,GAAe;AACpB,UAAMb,IAAW,KAAK,SAAQ;AAC9B,QAAIE,IAAOF,EAAS,KAAI;AACxB,WAAO,CAACE,EAAK,QAAM;AACf,UAAIA,EAAK,UAAUW;AACf,eAAO;AAEX,MAAAX,IAAOF,EAAS,KAAI;AAAA,IACxB;AACA,WAAO;AAAA,EACX;AAAA,EACA,QAAQc,GAAY;AAChB,WAAO,IAAIjB,GAAW,OAAO,EAAE,MAAM,KAAK,QAAO,EAAE,IAAK,CAACW,MAAU;AAC/D,SAAG;AACC,YAAIA,EAAM,UAAU;AAChB,gBAAMN,IAAOM,EAAM,SAAS,KAAI;AAChC,cAAIN,EAAK;AACL,YAAAM,EAAM,WAAW;AAAA;AAGjB,mBAAON;AAAA,QAEf;AACA,cAAM,EAAE,MAAAa,GAAM,OAAAtH,EAAK,IAAK,KAAK,OAAO+G,EAAM,IAAI;AAC9C,YAAI,CAACO,GAAM;AACP,gBAAMG,IAASJ,EAAWrH,CAAK;AAC/B,cAAI0H,GAAWD,CAAM;AACjB,YAAAV,EAAM,WAAWU,EAAO,OAAO,QAAQ,EAAC;AAAA;AAGxC,mBAAO,EAAE,MAAM,IAAO,OAAOA,EAAM;AAAA,QAE3C;AAAA,MACJ,SAASV,EAAM;AACf,aAAOC;AAAA,IACX,CAAC;AAAA,EACL;AAAA,EACA,KAAKW,GAAO;AAIR,QAHIA,MAAU,WACVA,IAAQ,IAERA,KAAS;AACT,aAAO;AAEX,UAAMC,IAASD,IAAQ,IAAI,KAAK,KAAKA,IAAQ,CAAC,IAAI;AAClD,WAAO,IAAIvB,GAAW,OAAO,EAAE,MAAMwB,EAAO,QAAO,EAAE,IAAK,CAACb,MAAU;AACjE,SAAG;AACC,YAAIA,EAAM,UAAU;AAChB,gBAAMN,IAAOM,EAAM,SAAS,KAAI;AAChC,cAAIN,EAAK;AACL,YAAAM,EAAM,WAAW;AAAA;AAGjB,mBAAON;AAAA,QAEf;AACA,cAAM,EAAE,MAAAa,GAAM,OAAAtH,EAAK,IAAK4H,EAAO,OAAOb,EAAM,IAAI;AAChD,YAAI,CAACO;AACD,cAAII,GAAW1H,CAAK;AAChB,YAAA+G,EAAM,WAAW/G,EAAM,OAAO,QAAQ,EAAC;AAAA;AAGvC,mBAAO,EAAE,MAAM,IAAO,OAAOA,EAAK;AAAA,MAG9C,SAAS+G,EAAM;AACf,aAAOC;AAAA,IACX,CAAC;AAAA,EACL;AAAA,EACA,OAAO;AAEH,UAAMnH,IADW,KAAK,SAAQ,EACN,KAAI;AAC5B,QAAI,CAAAA,EAAO;AAGX,aAAOA,EAAO;AAAA,EAClB;AAAA,EACA,KAAKgI,IAAY,GAAG;AAChB,WAAO,IAAIzB,GAAW,MAAM;AACxB,YAAMW,IAAQ,KAAK,QAAO;AAC1B,eAASe,IAAI,GAAGA,IAAID,GAAWC;AAE3B,YADa,KAAK,OAAOf,CAAK,EACrB;AACL,iBAAOA;AAGf,aAAOA;AAAA,IACX,GAAG,KAAK,MAAM;AAAA,EAClB;AAAA,EACA,MAAMgB,GAAS;AACX,WAAO,IAAI3B,GAAW,OAAO,EAAE,MAAM,GAAG,OAAO,KAAK,QAAO,MAAO,CAAAW,OAC9DA,EAAM,QACFA,EAAM,OAAOgB,IACNf,KAEJ,KAAK,OAAOD,EAAM,KAAK,EACjC;AAAA,EACL;AAAA,EACA,SAASiB,GAAI;AACT,WAAO,IAAI5B,GAAW,OAAO,EAAE,KAAK,oBAAI,IAAG,GAAI,eAAe,KAAK,UAAS,IAAK,CAAAW,MAAS;AACtF,UAAIlH;AACJ;AAEI,YADAA,IAAS,KAAK,OAAOkH,EAAM,aAAa,GACpC,CAAClH,EAAO,MAAM;AACd,gBAAMG,IAAQgI,IAAKA,EAAGnI,EAAO,KAAK,IAAIA,EAAO;AAC7C,cAAI,CAACkH,EAAM,IAAI,IAAI/G,CAAK;AACpB,mBAAA+G,EAAM,IAAI,IAAI/G,CAAK,GACZH;AAAA,QAEf;AAAA,aACK,CAACA,EAAO;AACjB,aAAOmH;AAAA,IACX,CAAC;AAAA,EACL;AAAA,EACA,QAAQF,GAAOzH,GAAK;AAChB,UAAM4I,IAAc,oBAAI,IAAG;AAC3B,eAAWC,KAAQpB,GAAO;AACtB,YAAM9G,IAAQX,IAAMA,EAAI6I,CAAI,IAAIA;AAChC,MAAAD,EAAY,IAAIjI,CAAK;AAAA,IACzB;AACA,WAAO,KAAK,OAAO,CAAAmI,MAAK;AACpB,YAAMC,IAAS/I,IAAMA,EAAI8I,CAAC,IAAIA;AAC9B,aAAO,CAACF,EAAY,IAAIG,CAAM;AAAA,IAClC,CAAC;AAAA,EACL;AACJ;AACA,SAASjB,GAASe,GAAM;AACpB,SAAI,OAAOA,KAAS,WACTA,IAEP,OAAOA,IAAS,MACT,cAGP,OAAOA,EAAK,YAAa,aAElBA,EAAK,SAAQ,IAEjB,OAAO,UAAU,SAAS,KAAKA,CAAI;AAC9C;AACA,SAASR,GAAW5C,GAAK;AACrB,SAAO,CAAC,CAACA,KAAO,OAAOA,EAAI,OAAO,QAAQ,KAAM;AACpD;AAKO,MAAMuD,KAAe,IAAIjC,GAAW;GAAiB,MAAMY,EAAW,GAIhEA,KAAc,OAAO,OAAO,EAAE,MAAM,IAAM,OAAO,QAAW;AAIlE,SAASY,MAAUU,GAAa;AACnC,MAAIA,EAAY,WAAW,GAAG;AAC1B,UAAMhI,IAAagI,EAAY,CAAC;AAChC,QAAIhI,aAAsB8F;AACtB,aAAO9F;AAEX,QAAIoH,GAAWpH,CAAU;AACrB,aAAO,IAAI8F,GAAW,MAAM9F,EAAW,OAAO,QAAQ,EAAC,GAAI,CAACiG,MAAaA,EAAS,MAAM;AAE5F,QAAI,OAAOjG,EAAW,UAAW;AAC7B,aAAO,IAAI8F,GAAW,OAAO,EAAE,OAAO,EAAC,IAAK,CAACW,MACrCA,EAAM,QAAQzG,EAAW,SAClB,EAAE,MAAM,IAAO,OAAOA,EAAWyG,EAAM,OAAO,EAAC,IAG/CC,EAEd;AAAA,EAET;AACA,SAAIsB,EAAY,SAAS,IACd,IAAIlC,GAAW,OAAO,EAAE,WAAW,GAAG,UAAU,EAAC,IAAK,CAACW,MAAU;AACpE,OAAG;AACC,UAAIA,EAAM,UAAU;AAChB,cAAMN,IAAOM,EAAM,SAAS,KAAI;AAChC,YAAI,CAACN,EAAK;AACN,iBAAOA;AAEX,QAAAM,EAAM,WAAW;AAAA,MACrB;AACA,UAAIA,EAAM,OAAO;AACb,YAAIA,EAAM,WAAWA,EAAM,MAAM;AAC7B,iBAAO,EAAE,MAAM,IAAO,OAAOA,EAAM,MAAMA,EAAM,UAAU,EAAC;AAE9D,QAAAA,EAAM,QAAQ,QACdA,EAAM,WAAW;AAAA,MACrB;AACA,UAAIA,EAAM,YAAYuB,EAAY,QAAQ;AACtC,cAAMhI,IAAagI,EAAYvB,EAAM,WAAW;AAChD,QAAIW,GAAWpH,CAAU,IACrByG,EAAM,WAAWzG,EAAW,OAAO,QAAQ,EAAC,IAEvCA,KAAc,OAAOA,EAAW,UAAW,aAChDyG,EAAM,QAAQzG;AAAA,MAEtB;AAAA,IACJ,SAASyG,EAAM,YAAYA,EAAM,SAASA,EAAM,YAAYuB,EAAY;AACxE,WAAOtB;AAAA,EACX,CAAC,IAEEqB;AACX;AAMO,MAAME,WAAuBnC,GAAW;AAAA,EAC3C,YAAYoC,GAAMC,GAAUC,GAAS;AACjC,UAAM,OAAO;AAAA,MACT,WAAWA,GAAS,cAAc,CAAC,CAACF,CAAI,EAAE,OAAO,QAAQ,EAAC,CAAE,IAAI,CAACC,EAASD,CAAI,EAAE,OAAO,QAAQ,GAAG;AAAA,MAClG,QAAQ;AAAA,IACpB,IAAY,CAAAzB,MAAS;AAKT,WAJIA,EAAM,WACNA,EAAM,UAAU,IAAG,GACnBA,EAAM,SAAS,KAEZA,EAAM,UAAU,SAAS,KAAG;AAE/B,cAAMN,IADWM,EAAM,UAAUA,EAAM,UAAU,SAAS,CAAC,EACrC,KAAI;AAC1B,YAAIN,EAAK;AACL,UAAAM,EAAM,UAAU,IAAG;AAAA;AAGnB,iBAAAA,EAAM,UAAU,KAAK0B,EAAShC,EAAK,KAAK,EAAE,OAAO,QAAQ,GAAG,GACrDA;AAAA,MAEf;AACA,aAAOO;AAAA,IACX,CAAC;AAAA,EACL;AAAA,EACA,WAAW;AACP,UAAMT,IAAW;AAAA,MACb,OAAO,KAAK,QAAO;AAAA,MACnB,MAAM,MAAM,KAAK,OAAOA,EAAS,KAAK;AAAA,MACtC,OAAO,MAAM;AACT,QAAAA,EAAS,MAAM,SAAS;AAAA,MAC5B;AAAA,MACA,CAAC,OAAO,QAAQ,GAAG,MAAMA;AAAA,IACrC;AACQ,WAAOA;AAAA,EACX;AACJ;AAIO,IAAIoC;AAAA,CACV,SAAUA,GAAW;AAIlB,WAASC,EAAIhB,GAAQ;AACjB,WAAOA,EAAO,OAAO,CAAC,GAAGiB,MAAM,IAAIA,GAAG,CAAC;AAAA,EAC3C;AACA,EAAAF,EAAU,MAAMC;AAIhB,WAASE,EAAQlB,GAAQ;AACrB,WAAOA,EAAO,OAAO,CAAC,GAAGiB,MAAM,IAAIA,GAAG,CAAC;AAAA,EAC3C;AACA,EAAAF,EAAU,UAAUG;AAIpB,WAASC,EAAInB,GAAQ;AACjB,WAAOA,EAAO,OAAO,CAAC,GAAGiB,MAAM,KAAK,IAAI,GAAGA,CAAC,CAAC;AAAA,EACjD;AACA,EAAAF,EAAU,MAAMI;AAIhB,WAASC,EAAIpB,GAAQ;AACjB,WAAOA,EAAO,OAAO,CAAC,GAAGiB,MAAM,KAAK,IAAI,GAAGA,CAAC,CAAC;AAAA,EACjD;AACA,EAAAF,EAAU,MAAMK;AACpB,GAAGL,OAAcA,KAAY,CAAA,EAAG;AChfzB,SAASM,GAAuBzD,GAAMkD,IAAU,IAAI;AACvD,aAAW,CAACQ,GAAMlJ,CAAK,KAAK,OAAO,QAAQwF,CAAI;AAC3C,IAAK0D,EAAK,WAAW,GAAG,MAChB,MAAM,QAAQlJ,CAAK,IACnBA,EAAM,QAAQ,CAACkI,GAAMvI,MAAU;AAC3B,MAAIkF,GAAUqD,CAAI,MACdA,EAAK,aAAa1C,GAClB0C,EAAK,qBAAqBgB,GAC1BhB,EAAK,kBAAkBvI,GACnB+I,EAAQ,QACRO,GAAuBf,GAAMQ,CAAO;AAAA,IAGhD,CAAC,IAEI7D,GAAU7E,CAAK,MACpBA,EAAM,aAAawF,GACnBxF,EAAM,qBAAqBkJ,GACvBR,EAAQ,QACRO,GAAuBjJ,GAAO0I,CAAO;AAKzD;AAMO,SAASS,GAAmB3D,GAAM4D,GAAe;AACpD,MAAIlB,IAAO1C;AACX,SAAO0C,KAAM;AACT,QAAIkB,EAAclB,CAAI;AAClB,aAAOA;AAEX,IAAAA,IAAOA,EAAK;AAAA,EAChB;AAEJ;AAqBO,SAASmB,GAAY7D,GAAM;AAE9B,QAAM3F,IADWyJ,GAAa9D,CAAI,EACV;AACxB,MAAI,CAAC3F;AACD,UAAM,IAAI,MAAM,2BAA2B;AAE/C,SAAOA;AACX;AAIO,SAASyJ,GAAa9D,GAAM;AAC/B,SAAOA,EAAK;AACR,IAAAA,IAAOA,EAAK;AAEhB,SAAOA;AACX;AAIO,SAAS+D,GAAkBC,GAAW;AACzC,SAAIzE,GAAYyE,CAAS,IACdA,EAAU,MAAM,CAACA,EAAU,GAAG,IAAI,CAAA,IAEpCxE,GAAiBwE,CAAS,IACxBA,EAAU,MAAM,IAAI,CAAAtB,MAAQA,EAAK,GAAG,IAExC,CAAA;AACX;AAKO,SAASuB,GAAejE,GAAMkD,GAAS;AAC1C,MAAI,CAAClD;AACD,UAAM,IAAI,MAAM,0BAA0B;AAE9C,QAAMkE,IAAQhB,GAAS;AACvB,SAAO,IAAItC,GAAW,OAAO;AAAA,IACzB,MAAM,OAAO,KAAKZ,CAAI;AAAA,IACtB,UAAU;AAAA,IACV,YAAY;AAAA,EACpB,IAAQ,CAAAuB,MAAS;AACT,WAAOA,EAAM,WAAWA,EAAM,KAAK,UAAQ;AACvC,YAAM4C,IAAW5C,EAAM,KAAKA,EAAM,QAAQ;AAC1C,UAAI,CAAC4C,EAAS,WAAW,GAAG,GAAG;AAC3B,cAAM3J,IAAQwF,EAAKmE,CAAQ;AAC3B,YAAI9E,GAAU7E,CAAK;AAEf,cADA+G,EAAM,YACF6C,GAAiB5J,GAAO0J,CAAK;AAC7B,mBAAO,EAAE,MAAM,IAAO,OAAA1J,EAAK;AAAA,mBAG1B,MAAM,QAAQA,CAAK,GAAG;AAC3B,iBAAO+G,EAAM,aAAa/G,EAAM,UAAQ;AACpC,kBAAML,IAAQoH,EAAM,cACdF,IAAU7G,EAAML,CAAK;AAC3B,gBAAIkF,GAAUgC,CAAO,KAAK+C,GAAiB/C,GAAS6C,CAAK;AACrD,qBAAO,EAAE,MAAM,IAAO,OAAO7C,EAAO;AAAA,UAE5C;AACA,UAAAE,EAAM,aAAa;AAAA,QACvB;AAAA,MACJ;AACA,MAAAA,EAAM;AAAA,IACV;AACA,WAAOC;AAAA,EACX,CAAC;AACL;AAKO,SAAS6C,GAAkBrB,GAAME,GAAS;AAC7C,MAAI,CAACF;AACD,UAAM,IAAI,MAAM,+BAA+B;AAEnD,SAAO,IAAID,GAAeC,GAAM,CAAAhD,MAAQiE,GAAejE,GAAMkD,CAAO,CAAC;AACzE;AAKO,SAASoB,GAAUtB,GAAME,GAAS;AACrC,MAAI,CAACF;AACD,UAAM,IAAI,MAAM,+BAA+B;AAMnD,SAAO,IAAID,GAAeC,GAAM,CAAAhD,MAAQiE,GAAejE,GAAMkD,CAAO,GAAG,EAAE,aAAa,IAAM;AAChG;AACA,SAASkB,GAAiBG,GAASL,GAAO;AACtC,MAAI,CAACA;AACD,WAAO;AAEX,QAAMM,IAAYD,EAAQ,UAAU;AACpC,SAAKC,IAGEC,GAAQD,GAAWN,CAAK,IAFpB;AAGf;AAKO,SAASQ,GAAiB1E,GAAM;AACnC,SAAO,IAAIY,GAAW,OAAO;AAAA,IACzB,MAAM,OAAO,KAAKZ,CAAI;AAAA,IACtB,UAAU;AAAA,IACV,YAAY;AAAA,EACpB,IAAQ,CAAAuB,MAAS;AACT,WAAOA,EAAM,WAAWA,EAAM,KAAK,UAAQ;AACvC,YAAM4C,IAAW5C,EAAM,KAAKA,EAAM,QAAQ;AAC1C,UAAI,CAAC4C,EAAS,WAAW,GAAG,GAAG;AAC3B,cAAM3J,IAAQwF,EAAKmE,CAAQ;AAC3B,YAAI5E,GAAY/E,CAAK,KAAKgF,GAAiBhF,CAAK;AAC5C,iBAAA+G,EAAM,YACC,EAAE,MAAM,IAAO,OAAO,EAAE,WAAW/G,GAAO,WAAWwF,GAAM,UAAAmE,IAAU;AAE3E,YAAI,MAAM,QAAQ3J,CAAK,GAAG;AAC3B,iBAAO+G,EAAM,aAAa/G,EAAM,UAAQ;AACpC,kBAAML,IAAQoH,EAAM,cACdF,IAAU7G,EAAML,CAAK;AAC3B,gBAAIoF,GAAY8B,CAAO,KAAK7B,GAAiBhF,CAAK;AAC9C,qBAAO,EAAE,MAAM,IAAO,OAAO,EAAE,WAAW6G,GAAS,WAAWrB,GAAM,UAAAmE,GAAU,OAAAhK,EAAK,EAAE;AAAA,UAE7F;AACA,UAAAoH,EAAM,aAAa;AAAA,QACvB;AAAA,MACJ;AACA,MAAAA,EAAM;AAAA,IACV;AACA,WAAOC;AAAA,EACX,CAAC;AACL;AAOO,SAASmD,GAA0BC,GAAY5E,GAAM;AACxD,QAAM6E,IAAeD,EAAW,gBAAgB5E,EAAK,KAAK,GACpD8E,IAAc9E;AACpB,aAAWmE,KAAY,OAAO,OAAOU,EAAa,UAAU;AAExD,IAAIV,EAAS,iBAAiB,UAAaW,EAAYX,EAAS,IAAI,MAAM,WACtEW,EAAYX,EAAS,IAAI,IAAIY,GAAiBZ,EAAS,YAAY;AAG/E;AACA,SAASY,GAAiBC,GAAc;AACpC,SAAI,MAAM,QAAQA,CAAY,IACnB,CAAC,GAAGA,EAAa,IAAID,EAAgB,CAAC,IAGtCC;AAEf;ACzNO,MAAMC,KAAkB;AAAA,EAC3B,OAAO;AAAA,EACP,aAAa;AACjB;AACO,SAASC,GAAkBxC,GAAM;AACpC,SAAOkC,GAAW,WAAWlC,GAAMuC,GAAgB,KAAK;AAC5D;AACO,MAAME,KAAqB;AAAA,EAC9B,OAAO;AACX;AACO,SAASC,GAAqB1C,GAAM;AACvC,SAAOkC,GAAW,WAAWlC,GAAMyC,GAAmB,KAAK;AAC/D;AACO,MAAME,KAAe;AAAA,EACxB,OAAO;AACX,GAIaC,KAAe;AAAA,EACxB,OAAO;AACX,GAIaC,KAAS;AAAA,EAClB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,SAAS;AAAA,EACT,cAAc;AAAA,EACd,UAAU;AAAA,EACV,MAAM;AACV;AACO,SAASC,GAAS9C,GAAM;AAC3B,SAAOkC,GAAW,WAAWlC,GAAM6C,GAAO,KAAK;AACnD;AACO,MAAME,KAAe;AAAA,EACxB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,UAAU;AACd;AACO,SAASC,GAAehD,GAAM;AACjC,SAAOkC,GAAW,WAAWlC,GAAM+C,GAAa,KAAK;AACzD;AACO,MAAME,KAAe;AAAA,EACxB,OAAO;AAAA,EACP,UAAU;AACd,GAIaC,KAAY;AAAA,EACrB,OAAO;AAAA,EACP,aAAa;AACjB,GAIaC,KAAa;AAAA,EACtB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,SAAS;AAAA,EACT,UAAU;AAAA,EACV,WAAW;AAAA,EACX,UAAU;AACd;AACO,SAASC,GAAapD,GAAM;AAC/B,SAAOkC,GAAW,WAAWlC,GAAMmD,GAAW,KAAK;AACvD;AACO,MAAME,KAAiB;AAAA,EAC1B,OAAO;AAAA,EACP,MAAM;AACV;AACO,SAASC,GAAiBtD,GAAM;AACnC,SAAOkC,GAAW,WAAWlC,GAAMqD,GAAe,KAAK;AAC3D;AACO,MAAME,KAAiB;AAAA,EAC1B,OAAO;AAAA,EACP,aAAa;AAAA,EACb,MAAM;AAAA,EACN,WAAW;AAAA,EACX,eAAe;AAAA,EACf,OAAO;AACX;AACO,SAASC,GAAiBxD,GAAM;AACnC,SAAOkC,GAAW,WAAWlC,GAAMuD,GAAe,KAAK;AAC3D;AACO,MAAME,KAAY;AAAA,EACrB,OAAO;AACX,GAIaC,KAAc;AAAA,EACvB,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AACX;AACO,SAASC,GAAc3D,GAAM;AAChC,SAAOkC,GAAW,WAAWlC,GAAM0D,GAAY,KAAK;AACxD;AACO,MAAME,KAAiB;AAAA,EAC1B,OAAO;AAAA,EACP,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,SAAS;AAAA,EACT,UAAU;AAAA,EACV,MAAM;AACV;AACO,SAASC,GAAiB7D,GAAM;AACnC,SAAOkC,GAAW,WAAWlC,GAAM4D,GAAe,KAAK;AAC3D;AACO,MAAME,KAAc;AAAA,EACvB,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AACX;AACO,SAASC,GAAc/D,GAAM;AAChC,SAAOkC,GAAW,WAAWlC,GAAM8D,GAAY,KAAK;AACxD;AACO,MAAME,KAAY;AAAA,EACrB,OAAO;AAAA,EACP,aAAa;AACjB;AACO,SAASC,GAAYjE,GAAM;AAC9B,SAAOkC,GAAW,WAAWlC,GAAMgE,GAAU,KAAK;AACtD;AACO,MAAME,KAAU;AAAA,EACnB,OAAO;AAAA,EACP,SAAS;AAAA,EACT,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AACX,GAIaC,KAAgB;AAAA,EACzB,OAAO;AAAA,EACP,MAAM;AACV,GAIaC,KAAQ;AAAA,EACjB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,UAAU;AAAA,EACV,gBAAgB;AAAA,EAChB,WAAW;AACf;AACO,SAASC,GAAQrE,GAAM;AAC1B,SAAOkC,GAAW,WAAWlC,GAAMoE,GAAM,KAAK;AAClD;AACO,MAAME,KAAe;AAAA,EACxB,OAAO;AAAA,EACP,MAAM;AACV;AACO,SAASC,GAAevE,GAAM;AACjC,SAAOkC,GAAW,WAAWlC,GAAMsE,GAAa,KAAK;AACzD;AACO,MAAME,KAAY;AAAA,EACrB,OAAO;AAAA,EACP,MAAM;AAAA,EACN,UAAU;AAAA,EACV,cAAc;AAAA,EACd,MAAM;AAAA,EACN,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,YAAY;AAChB;AACO,SAASC,GAAYzE,GAAM;AAC9B,SAAOkC,GAAW,WAAWlC,GAAMwE,GAAU,KAAK;AACtD;AACO,MAAME,KAAwB;AAAA,EACjC,OAAO;AAAA,EACP,eAAe;AAAA,EACf,WAAW;AACf,GAIaC,KAAqB;AAAA,EAC9B,OAAO;AAAA,EACP,aAAa;AACjB,GAIaC,KAAY;AAAA,EACrB,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,MAAM;AAAA,EACN,YAAY;AAChB;AACO,SAASC,GAAY7E,GAAM;AAC9B,SAAOkC,GAAW,WAAWlC,GAAM4E,GAAU,KAAK;AACtD;AACO,MAAME,KAAU;AAAA,EACnB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW;AAAA,EACX,OAAO;AACX;AACO,SAASC,GAAU/E,GAAM;AAC5B,SAAOkC,GAAW,WAAWlC,GAAM8E,GAAQ,KAAK;AACpD;AACO,MAAME,KAAgB;AAAA,EACzB,OAAO;AAAA,EACP,cAAc;AAAA,EACd,WAAW;AAAA,EACX,OAAO;AACX,GAIaC,KAAe;AAAA,EACxB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW;AAAA,EACX,eAAe;AAAA,EACf,UAAU;AACd;AACO,SAASC,GAAelF,GAAM;AACjC,SAAOkC,GAAW,WAAWlC,GAAMiF,GAAa,KAAK;AACzD;AACO,MAAME,KAAW;AAAA,EACpB,OAAO;AAAA,EACP,OAAO;AACX;AACO,SAASC,GAAWpF,GAAM;AAC7B,SAAOkC,GAAW,WAAWlC,GAAMmF,GAAS,KAAK;AACrD;AACO,MAAME,KAAgB;AAAA,EACzB,OAAO;AAAA,EACP,OAAO;AACX,GAIaC,KAAY;AAAA,EACrB,OAAO;AAAA,EACP,MAAM;AACV,GAIaC,KAAqB;AAAA,EAC9B,OAAO;AAAA,EACP,WAAW;AACf;AACO,SAASC,GAAqBxF,GAAM;AACvC,SAAOkC,GAAW,WAAWlC,GAAMuF,GAAmB,KAAK;AAC/D;AACO,MAAME,KAAa;AAAA,EACtB,OAAO;AAAA,EACP,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,OAAO;AAAA,EACP,UAAU;AAAA,EACV,cAAc;AAAA,EACd,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,YAAY;AAChB;AACO,SAASC,GAAa1F,GAAM;AAC/B,SAAOkC,GAAW,WAAWlC,GAAMyF,GAAW,KAAK;AACvD;AACO,MAAME,KAAgB;AAAA,EACzB,OAAO;AAAA,EACP,SAAS;AAAA,EACT,eAAe;AACnB,GAIaC,KAAa;AAAA,EACtB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW;AAAA,EACX,eAAe;AAAA,EACf,OAAO;AACX;AACO,SAASC,GAAa7F,GAAM;AAC/B,SAAOkC,GAAW,WAAWlC,GAAM4F,GAAW,KAAK;AACvD;AACO,MAAME,KAAa;AAAA,EACtB,OAAO;AAAA,EACP,MAAM;AACV;AACO,SAASC,GAAa/F,GAAM;AAC/B,SAAOkC,GAAW,WAAWlC,GAAM8F,GAAW,KAAK;AACvD;AACO,MAAME,KAAW;AAAA,EACpB,OAAO;AAAA,EACP,WAAW;AAAA,EACX,aAAa;AAAA,EACb,WAAW;AAAA,EACX,MAAM;AACV;AACO,SAASC,GAAWjG,GAAM;AAC7B,SAAOkC,GAAW,WAAWlC,GAAMgG,GAAS,KAAK;AACrD;AACO,MAAME,KAAa;AAAA,EACtB,OAAO;AAAA,EACP,eAAe;AAAA,EACf,YAAY;AAAA,EACZ,SAAS;AACb;AACO,SAASC,GAAanG,GAAM;AAC/B,SAAOkC,GAAW,WAAWlC,GAAMkG,GAAW,KAAK;AACvD;AACO,MAAME,KAAgB;AAAA,EACzB,OAAO;AAAA,EACP,OAAO;AACX,GAIaC,KAAuB;AAAA,EAChC,OAAO;AAAA,EACP,aAAa;AAAA,EACb,UAAU;AAAA,EACV,WAAW;AAAA,EACX,eAAe;AACnB;AACO,SAASC,GAAuBtG,GAAM;AACzC,SAAOkC,GAAW,WAAWlC,GAAMqG,GAAqB,KAAK;AACjE;AACO,MAAME,KAAkB;AAAA,EAC3B,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW;AAAA,EACX,eAAe;AACnB,GAIaC,KAAgB;AAAA,EACzB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,UAAU;AAAA,EACV,WAAW;AAAA,EACX,eAAe;AACnB;AACO,SAASC,GAAgBzG,GAAM;AAClC,SAAOkC,GAAW,WAAWlC,GAAMwG,GAAc,KAAK;AAC1D;AACO,MAAME,KAAe;AAAA,EACxB,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,MAAM;AACV;AACO,SAASC,GAAe3G,GAAM;AACjC,SAAOkC,GAAW,WAAWlC,GAAM0G,GAAa,KAAK;AACzD;AACO,MAAME,KAAmB;AAAA,EAC5B,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW;AAAA,EACX,eAAe;AAAA,EACf,MAAM;AACV;AACO,SAASC,GAAmB7G,GAAM;AACrC,SAAOkC,GAAW,WAAWlC,GAAM4G,GAAiB,KAAK;AAC7D;AACO,MAAME,KAAO;AAAA,EAChB,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AACV;AACO,SAASC,GAAO/G,GAAM;AACzB,SAAOkC,GAAW,WAAWlC,GAAM8G,GAAK,KAAK;AACjD;AACO,MAAME,KAAgB;AAAA,EACzB,OAAO;AAAA,EACP,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,MAAM;AAAA,EACN,MAAM;AACV,GAIaC,KAAiB;AAAA,EAC1B,OAAO;AACX,GAIaC,KAAY;AAAA,EACrB,OAAO;AAAA,EACP,OAAO;AACX,GAIaC,KAAiB;AAAA,EAC1B,OAAO;AAAA,EACP,aAAa;AAAA,EACb,UAAU;AACd;AACO,SAASC,GAAiBpH,GAAM;AACnC,SAAOkC,GAAW,WAAWlC,GAAMmH,GAAe,KAAK;AAC3D;AACO,MAAME,KAAa;AAAA,EACtB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW;AAAA,EACX,eAAe;AAAA,EACf,UAAU;AACd;AACO,SAASC,GAAatH,GAAM;AAC/B,SAAOkC,GAAW,WAAWlC,GAAMqH,GAAW,KAAK;AACvD;AACO,MAAME,KAAe;AAAA,EACxB,OAAO;AACX,GAIaC,KAAW;AAAA,EACpB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW;AAAA,EACX,eAAe;AACnB;AACO,SAASC,GAAWzH,GAAM;AAC7B,SAAOkC,GAAW,WAAWlC,GAAMwH,GAAS,KAAK;AACrD;AACO,MAAME,WAAoCC,GAA8B;AAAA,EAC3E,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,QAAQ;AAAA,MACT,iBAAiB;AAAA,QACb,MAAMpF,GAAgB;AAAA,QACtB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAgB;AAAA,UAC9C;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,oBAAoB;AAAA,QAChB,MAAME,GAAmB;AAAA,QACzB,YAAY,CAAA;AAAA,QACZ,YAAY,CAACE,GAAa,OAAOC,GAAa,KAAK;AAAA,MACnE;AAAA,MACY,cAAc;AAAA,QACV,MAAMD,GAAa;AAAA,QACnB,YAAY,CAAA;AAAA,QACZ,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,cAAc;AAAA,QACV,MAAMC,GAAa;AAAA,QACnB,YAAY,CAAA;AAAA,QACZ,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,QAAQ;AAAA,QACJ,MAAMC,GAAO;AAAA,QACb,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAO;AAAA,UACrC;AAAA,UACoB,SAAS;AAAA,YACL,MAAMA,GAAO;AAAA,UACrC;AAAA,UACoB,cAAc;AAAA,YACV,MAAMA,GAAO;AAAA,UACrC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAO;AAAA,UACrC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAO;AAAA,YACb,eAAeD,GAAa;AAAA,UACpD;AAAA,QACA;AAAA,QACgB,YAAY,CAACL,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,cAAc;AAAA,QACV,MAAMQ,GAAa;AAAA,QACnB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAa;AAAA,UAC3C;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAa;AAAA,YACnB,cAAc,CAAA;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAACR,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,cAAc;AAAA,QACV,MAAMU,GAAa;AAAA,QACnB,YAAY;AAAA,UACR,UAAU;AAAA,YACN,MAAMA,GAAa;AAAA,YACnB,cAAc,CAAA;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAACsE,GAAa,KAAK;AAAA,MAC/C;AAAA,MACY,WAAW;AAAA,QACP,MAAMrE,GAAU;AAAA,QAChB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAU;AAAA,UACxC;AAAA,QACA;AAAA,QACgB,YAAY,CAAC+D,GAAe,KAAK;AAAA,MACjD;AAAA,MACY,YAAY;AAAA,QACR,MAAM9D,GAAW;AAAA,QACjB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,SAAS;AAAA,YACL,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAW;AAAA,UACzC;AAAA,QACA;AAAA,QACgB,YAAY,CAACZ,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,gBAAgB;AAAA,QACZ,MAAMc,GAAe;AAAA,QACrB,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAe;AAAA,YACrB,cAAc;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAACI,GAAU,OAAO8D,GAAa,KAAK;AAAA,MAChE;AAAA,MACY,gBAAgB;AAAA,QACZ,MAAMhE,GAAe;AAAA,QACrB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAe;AAAA,UAC7C;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAe;AAAA,UAC7C;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAe;AAAA,UAC7C;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAe;AAAA,YACrB,cAAc;AAAA,UACtC;AAAA,UACoB,OAAO;AAAA,YACH,MAAMA,GAAe;AAAA,UAC7C;AAAA,QACA;AAAA,QACgB,YAAY,CAACgD,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,WAAW;AAAA,QACP,MAAM9C,GAAU;AAAA,QAChB,YAAY,CAAA;AAAA,QACZ,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,aAAa;AAAA,QACT,MAAMC,GAAY;AAAA,QAClB,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAY;AAAA,UAC1C;AAAA,UACoB,OAAO;AAAA,YACH,MAAMA,GAAY;AAAA,UAC1C;AAAA,QACA;AAAA,QACgB,YAAY,CAACD,GAAU,KAAK;AAAA,MAC5C;AAAA,MACY,gBAAgB;AAAA,QACZ,MAAMG,GAAe;AAAA,QACrB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAe;AAAA,UAC7C;AAAA,UACoB,kBAAkB;AAAA,YACd,MAAMA,GAAe;AAAA,YACrB,cAAc;AAAA,UACtC;AAAA,UACoB,SAAS;AAAA,YACL,MAAMA,GAAe;AAAA,YACrB,cAAc;AAAA,UACtC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAe;AAAA,UAC7C;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAe;AAAA,YACrB,eAAehB,GAAa;AAAA,UACpD;AAAA,QACA;AAAA,QACgB,YAAY,CAACL,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,aAAa;AAAA,QACT,MAAMuB,GAAY;AAAA,QAClB,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAY;AAAA,UAC1C;AAAA,UACoB,OAAO;AAAA,YACH,MAAMA,GAAY;AAAA,UAC1C;AAAA,QACA;AAAA,QACgB,YAAY,CAACL,GAAU,KAAK;AAAA,MAC5C;AAAA,MACY,WAAW;AAAA,QACP,MAAMO,GAAU;AAAA,QAChB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAU;AAAA,UACxC;AAAA,QACA;AAAA,QACgB,YAAY,CAACzB,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,SAAS;AAAA,QACL,MAAM2B,GAAQ;AAAA,QACd,YAAY;AAAA,UACR,SAAS;AAAA,YACL,MAAMA,GAAQ;AAAA,YACd,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAQ;AAAA,YACd,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAQ;AAAA,YACd,cAAc;AAAA,UACtC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAQ;AAAA,UACtC;AAAA,UACoB,OAAO;AAAA,YACH,MAAMA,GAAQ;AAAA,YACd,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,OAAO;AAAA,YACH,MAAMA,GAAQ;AAAA,YACd,cAAc,CAAA;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,eAAe;AAAA,QACX,MAAMC,GAAc;AAAA,QACpB,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAc;AAAA,UAC5C;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,OAAO;AAAA,QACH,MAAMC,GAAM;AAAA,QACZ,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAM;AAAA,UACpC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAM;AAAA,YACZ,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,gBAAgB;AAAA,YACZ,MAAMA,GAAM;AAAA,UACpC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAM;AAAA,UACpC;AAAA,QACA;AAAA,QACgB,YAAY,CAAC7B,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,cAAc;AAAA,QACV,MAAM+B,GAAa;AAAA,QACnB,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAa;AAAA,UAC3C;AAAA,QACA;AAAA,QACgB,YAAY,CAAC1B,GAAa,KAAK;AAAA,MAC/C;AAAA,MACY,WAAW;AAAA,QACP,MAAM4B,GAAU;AAAA,QAChB,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAU;AAAA,UACxC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAU;AAAA,UACxC;AAAA,UACoB,cAAc;AAAA,YACV,MAAMA,GAAU;AAAA,UACxC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAU;AAAA,UACxC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAU;AAAA,UACxC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAU;AAAA,YAChB,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAU;AAAA,YAChB,eAAe5B,GAAa;AAAA,UACpD;AAAA,QACA;AAAA,QACgB,YAAY,CAACH,GAAmB,KAAK;AAAA,MACrD;AAAA,MACY,uBAAuB;AAAA,QACnB,MAAMiC,GAAsB;AAAA,QAC5B,YAAY;AAAA,UACR,eAAe;AAAA,YACX,MAAMA,GAAsB;AAAA,UACpD;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAsB;AAAA,YAC5B,cAAc,CAAA;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,oBAAoB;AAAA,QAChB,MAAMC,GAAmB;AAAA,QACzB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAmB;AAAA,YACzB,cAAc,CAAA;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,WAAW;AAAA,QACP,MAAMC,GAAU;AAAA,QAChB,YAAY;AAAA,UACR,YAAY;AAAA,YACR,MAAMA,GAAU;AAAA,YAChB,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAU;AAAA,UACxC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAU;AAAA,YAChB,cAAc,CAAA;AAAA,YACd,eAAehC,GAAa;AAAA,UACpD;AAAA,QACA;AAAA,QACgB,YAAY,CAACA,GAAa,KAAK;AAAA,MAC/C;AAAA,MACY,SAAS;AAAA,QACL,MAAMkC,GAAQ;AAAA,QACd,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAQ;AAAA,UACtC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAQ;AAAA,UACtC;AAAA,UACoB,OAAO;AAAA,YACH,MAAMA,GAAQ;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAACvC,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,eAAe;AAAA,QACX,MAAMyC,GAAc;AAAA,QACpB,YAAY;AAAA,UACR,cAAc;AAAA,YACV,MAAMA,GAAc;AAAA,YACpB,cAAc;AAAA,UACtC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAc;AAAA,YACpB,eAAeM,GAAU;AAAA,UACjD;AAAA,UACoB,OAAO;AAAA,YACH,MAAMN,GAAc;AAAA,UAC5C;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,cAAc;AAAA,QACV,MAAMC,GAAa;AAAA,QACnB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAa;AAAA,UAC3C;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAa;AAAA,UAC3C;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAa;AAAA,YACnB,cAAc;AAAA,UACtC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAa;AAAA,UAC3C;AAAA,QACA;AAAA,QACgB,YAAY,CAACsB,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,UAAU;AAAA,QACN,MAAMpB,GAAS;AAAA,QACf,YAAY;AAAA,UACR,OAAO;AAAA,YACH,MAAMA,GAAS;AAAA,UACvC;AAAA,QACA;AAAA,QACgB,YAAY,CAAC1B,GAAU,KAAK;AAAA,MAC5C;AAAA,MACY,eAAe;AAAA,QACX,MAAM4B,GAAc;AAAA,QACpB,YAAY;AAAA,UACR,OAAO;AAAA,YACH,MAAMA,GAAc;AAAA,UAC5C;AAAA,QACA;AAAA,QACgB,YAAY,CAACkC,GAAa,KAAK;AAAA,MAC/C;AAAA,MACY,WAAW;AAAA,QACP,MAAMjC,GAAU;AAAA,QAChB,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAU;AAAA,UACxC;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,oBAAoB;AAAA,QAChB,MAAMC,GAAmB;AAAA,QACzB,YAAY;AAAA,UACR,WAAW;AAAA,YACP,MAAMA,GAAmB;AAAA,YACzB,eAAeD,GAAU;AAAA,UACjD;AAAA,QACA;AAAA,QACgB,YAAY,CAAC7B,GAAU,KAAK;AAAA,MAC5C;AAAA,MACY,YAAY;AAAA,QACR,MAAMgC,GAAW;AAAA,QACjB,YAAY;AAAA,UACR,UAAU;AAAA,YACN,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,OAAO;AAAA,YACH,MAAMA,GAAW;AAAA,YACjB,cAAc;AAAA,UACtC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAW;AAAA,YACjB,cAAc;AAAA,UACtC;AAAA,UACoB,cAAc;AAAA,YACV,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAW;AAAA,YACjB,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAW;AAAA,YACjB,eAAe7C,GAAa;AAAA,UACpD;AAAA,QACA;AAAA,QACgB,YAAY,CAACH,GAAmB,KAAK;AAAA,MACrD;AAAA,MACY,eAAe;AAAA,QACX,MAAMkD,GAAc;AAAA,QACpB,YAAY;AAAA,UACR,SAAS;AAAA,YACL,MAAMA,GAAc;AAAA,YACpB,cAAc;AAAA,UACtC;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAc;AAAA,UAC5C;AAAA,QACA;AAAA,QACgB,YAAY,CAACsB,GAAe,KAAK;AAAA,MACjD;AAAA,MACY,YAAY;AAAA,QACR,MAAMrB,GAAW;AAAA,QACjB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAW;AAAA,YACjB,cAAc;AAAA,UACtC;AAAA,UACoB,OAAO;AAAA,YACH,MAAMA,GAAW;AAAA,UACzC;AAAA,QACA;AAAA,QACgB,YAAY,CAACW,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,YAAY;AAAA,QACR,MAAMT,GAAW;AAAA,QACjB,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAW;AAAA,UACzC;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,UAAU;AAAA,QACN,MAAME,GAAS;AAAA,QACf,YAAY;AAAA,UACR,WAAW;AAAA,YACP,MAAMA,GAAS;AAAA,YACf,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,aAAa;AAAA,YACT,MAAMA,GAAS;AAAA,UACvC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAS;AAAA,UACvC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAS;AAAA,YACf,eAAerD,GAAa;AAAA,UACpD;AAAA,QACA;AAAA,QACgB,YAAY,CAACJ,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,YAAY;AAAA,QACR,MAAM2D,GAAW;AAAA,QACjB,YAAY;AAAA,UACR,eAAe;AAAA,YACX,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,SAAS;AAAA,YACL,MAAMA,GAAW;AAAA,YACjB,eAAetD,GAAa;AAAA,UACpD;AAAA,QACA;AAAA,QACgB,YAAY,CAACqE,GAAe,KAAK;AAAA,MACjD;AAAA,MACY,eAAe;AAAA,QACX,MAAMb,GAAc;AAAA,QACpB,YAAY;AAAA,UACR,OAAO;AAAA,YACH,MAAMA,GAAc;AAAA,UAC5C;AAAA,QACA;AAAA,QACgB,YAAY,CAACmB,GAAa,KAAK;AAAA,MAC/C;AAAA,MACY,sBAAsB;AAAA,QAClB,MAAMlB,GAAqB;AAAA,QAC3B,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAqB;AAAA,UACnD;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAqB;AAAA,YAC3B,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAqB;AAAA,UACnD;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAqB;AAAA,YAC3B,cAAc;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAACE,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,iBAAiB;AAAA,QACb,MAAMA,GAAgB;AAAA,QACtB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAgB;AAAA,UAC9C;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAgB;AAAA,UAC9C;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAgB;AAAA,YACtB,cAAc;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAAChE,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,eAAe;AAAA,QACX,MAAMiE,GAAc;AAAA,QACpB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAc;AAAA,UAC5C;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAc;AAAA,YACpB,cAAc,CAAA;AAAA,UACtC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAc;AAAA,UAC5C;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAc;AAAA,YACpB,cAAc;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAACD,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,cAAc;AAAA,QACV,MAAMG,GAAa;AAAA,QACnB,YAAY;AAAA,UACR,YAAY;AAAA,YACR,MAAMA,GAAa;AAAA,UAC3C;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAa;AAAA,YACnB,cAAc;AAAA,UACtC;AAAA,UACoB,QAAQ;AAAA,YACJ,MAAMA,GAAa;AAAA,YACnB,cAAc;AAAA,UACtC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAa;AAAA,UAC3C;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAa;AAAA,UAC3C;AAAA,QACA;AAAA,QACgB,YAAY,CAAC/D,GAAa,KAAK;AAAA,MAC/C;AAAA,MACY,kBAAkB;AAAA,QACd,MAAMiE,GAAiB;AAAA,QACvB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAiB;AAAA,UAC/C;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAiB;AAAA,UAC/C;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAiB;AAAA,YACvB,cAAc;AAAA,UACtC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAiB;AAAA,YACvB,eAAeF,GAAa;AAAA,UACpD;AAAA,QACA;AAAA,QACgB,YAAY,CAACH,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,MAAM;AAAA,QACF,MAAMO,GAAK;AAAA,QACX,YAAY;AAAA,UACR,MAAM;AAAA,YACF,MAAMA,GAAK;AAAA,UACnC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAK;AAAA,UACnC;AAAA,QACA;AAAA,QACgB,YAAY,CAAClE,GAAa,KAAK;AAAA,MAC/C;AAAA,MACY,eAAe;AAAA,QACX,MAAMoE,GAAc;AAAA,QACpB,YAAY;AAAA,UACR,cAAc;AAAA,YACV,MAAMA,GAAc;AAAA,UAC5C;AAAA,UACoB,YAAY;AAAA,YACR,MAAMA,GAAc;AAAA,YACpB,cAAc;AAAA,UACtC;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAc;AAAA,UAC5C;AAAA,UACoB,MAAM;AAAA,YACF,MAAMA,GAAc;AAAA,UAC5C;AAAA,QACA;AAAA,QACgB,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,gBAAgB;AAAA,QACZ,MAAMC,GAAe;AAAA,QACrB,YAAY,CAAA;AAAA,QACZ,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,WAAW;AAAA,QACP,MAAMC,GAAU;AAAA,QAChB,YAAY;AAAA,UACR,OAAO;AAAA,YACH,MAAMA,GAAU;AAAA,YAChB,cAAc,CAAA;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAACD,GAAe,KAAK;AAAA,MACjD;AAAA,MACY,gBAAgB;AAAA,QACZ,MAAME,GAAe;AAAA,QACrB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAe;AAAA,UAC7C;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAe;AAAA,YACrB,cAAc,CAAA;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAAC5E,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,YAAY;AAAA,QACR,MAAM8E,GAAW;AAAA,QACjB,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAW;AAAA,UACzC;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAW;AAAA,YACjB,cAAc;AAAA,UACtC;AAAA,UACoB,UAAU;AAAA,YACN,MAAMA,GAAW;AAAA,UACzC;AAAA,QACA;AAAA,QACgB,YAAY,CAACd,GAAgB,KAAK;AAAA,MAClD;AAAA,MACY,cAAc;AAAA,QACV,MAAMgB,GAAa;AAAA,QACnB,YAAY,CAAA;AAAA,QACZ,YAAY,CAAA;AAAA,MAC5B;AAAA,MACY,UAAU;AAAA,QACN,MAAMC,GAAS;AAAA,QACf,YAAY;AAAA,UACR,aAAa;AAAA,YACT,MAAMA,GAAS;AAAA,UACvC;AAAA,UACoB,WAAW;AAAA,YACP,MAAMA,GAAS;AAAA,UACvC;AAAA,UACoB,eAAe;AAAA,YACX,MAAMA,GAAS;AAAA,YACf,cAAc;AAAA,UACtC;AAAA,QACA;AAAA,QACgB,YAAY,CAACjB,GAAgB,KAAK;AAAA,MAClD;AAAA,IACA;AAAA,EACI;AACJ;AACO,MAAMrE,KAAa,IAAIwF,GAA2B;AChoClD,SAASE,GAAUtK,GAAM;AAC5B,SAAO,IAAI+C,GAAe/C,GAAM,CAAAqB,MACxBZ,GAAmBY,CAAO,IACnBA,EAAQ,UAGR,CAAA,GAEZ,EAAE,aAAa,IAAM;AAC5B;AAUO,SAASkJ,GAAYC,GAAOC,GAAQ;AACvC,SAAOD,EAAM;AAET,QADAA,IAAQA,EAAM,WACVA,MAAUC;AACV,aAAO;AAGf,SAAO;AACX;AACO,SAASC,GAAaC,GAAO;AAGhC,SAAO;AAAA,IACH,OAAO;AAAA,MACH,WAAWA,EAAM,cAAc;AAAA,MAC/B,MAAMA,EAAM,YAAY;AAAA,IACpC;AAAA,IACQ,KAAK;AAAA,MACD,WAAWA,EAAM;AAAA;AAAA,MACjB,MAAMA,EAAM,UAAU;AAAA,IAClC;AAAA,EACA;AACA;AACO,SAASC,GAAkB5K,GAAM;AACpC,MAAI,CAACA;AACD;AAEJ,QAAM,EAAE,QAAA6K,GAAQ,KAAA3Q,GAAK,OAAAgK,EAAK,IAAKlE;AAC/B,SAAO;AAAA,IACH,OAAAkE;AAAA,IACA,QAAA2G;AAAA,IACA,KAAA3Q;AAAA,IACA,QAAQA,IAAM2Q;AAAA,EACtB;AACA;AACO,IAAIC;AAAA,CACV,SAAUA,GAAiB;AACxB,EAAAA,EAAgBA,EAAgB,SAAY,CAAC,IAAI,UACjDA,EAAgBA,EAAgB,QAAW,CAAC,IAAI,SAChDA,EAAgBA,EAAgB,eAAkB,CAAC,IAAI,gBACvDA,EAAgBA,EAAgB,cAAiB,CAAC,IAAI,eACtDA,EAAgBA,EAAgB,SAAY,CAAC,IAAI,UACjDA,EAAgBA,EAAgB,UAAa,CAAC,IAAI;AACtD,GAAGA,OAAoBA,KAAkB,CAAA,EAAG;AACrC,SAASC,GAAa7G,GAAO8G,GAAI;AACpC,MAAI9G,EAAM,IAAI,OAAO8G,EAAG,MAAM,QAAS9G,EAAM,IAAI,SAAS8G,EAAG,MAAM,QAAQ9G,EAAM,IAAI,aAAa8G,EAAG,MAAM;AACvG,WAAOF,GAAgB;AAEtB,MAAI5G,EAAM,MAAM,OAAO8G,EAAG,IAAI,QAAS9G,EAAM,MAAM,SAAS8G,EAAG,IAAI,QAAQ9G,EAAM,MAAM,aAAa8G,EAAG,IAAI;AAC5G,WAAOF,GAAgB;AAE3B,QAAMG,IAAc/G,EAAM,MAAM,OAAO8G,EAAG,MAAM,QAAS9G,EAAM,MAAM,SAAS8G,EAAG,MAAM,QAAQ9G,EAAM,MAAM,aAAa8G,EAAG,MAAM,WAC3HE,IAAYhH,EAAM,IAAI,OAAO8G,EAAG,IAAI,QAAS9G,EAAM,IAAI,SAAS8G,EAAG,IAAI,QAAQ9G,EAAM,IAAI,aAAa8G,EAAG,IAAI;AACnH,SAAIC,KAAeC,IACRJ,GAAgB,SAElBG,IACEH,GAAgB,cAElBI,IACEJ,GAAgB,eAGhBA,GAAgB;AAE/B;AACO,SAASrG,GAAQP,GAAO8G,GAAI;AAE/B,SADmBD,GAAa7G,GAAO8G,CAAE,IACrBF,GAAgB;AACxC;AAGO,MAAMK,KAAoB;AAoB1B,SAASC,GAAgBC,GAASC,GAAc;AACnD,MAAID,GAAS;AACT,UAAME,IAAWC,GAAgBH,GAAS,EAAI;AAC9C,QAAIE,KAAYE,GAAcF,GAAUD,CAAY;AAChD,aAAOC;AAEX,QAAI5K,GAAc0K,CAAO,GAAG;AAGxB,YAAMK,IAAWL,EAAQ,QAAQ,UAAU,CAAA1I,MAAK,CAACA,EAAE,MAAM;AACzD,eAAS,IAAI+I,IAAW,GAAG,KAAK,GAAG,KAAK;AACpC,cAAMlB,IAAQa,EAAQ,QAAQ,CAAC;AAC/B,YAAII,GAAcjB,GAAOc,CAAY;AACjC,iBAAOd;AAAA,MAEf;AAAA,IACJ;AAAA,EACJ;AAEJ;AACO,SAASiB,GAAcJ,GAASC,GAAc;AACjD,SAAO5K,GAAc2K,CAAO,KAAKC,EAAa,SAASD,EAAQ,UAAU,IAAI;AACjF;AAoEO,SAASG,GAAgBxL,GAAM2L,IAAS,IAAM;AACjD,SAAO3L,EAAK,aAAW;AACnB,UAAMyK,IAASzK,EAAK;AACpB,QAAI7F,IAAQsQ,EAAO,QAAQ,QAAQzK,CAAI;AACvC,WAAO7F,IAAQ,KAAG;AACd,MAAAA;AACA,YAAMoR,IAAWd,EAAO,QAAQtQ,CAAK;AACrC,UAAIwR,KAAU,CAACJ,EAAS;AACpB,eAAOA;AAAA,IAEf;AACA,IAAAvL,IAAOyK;AAAA,EACX;AAEJ;AC1PO,MAAMmB,WAA0B,MAAM;AAAA,EACzC,YAAY5L,GAAM6L,GAAS;AACvB,UAAM7L,IAAO,GAAG6L,CAAO,OAAO7L,EAAK,MAAM,MAAM,IAAI,IAAIA,EAAK,MAAM,MAAM,SAAS,KAAK6L,CAAO;AAAA,EACjG;AACJ;AACO,SAASC,GAAkBC,GAAGF,IAAU,gCAAgC;AAC3E,QAAM,IAAI,MAAMA,CAAO;AAC3B;ACZO,SAASG,EAAGC,GAAM;AACrB,SAAOA,EAAK,WAAW,CAAC;AAC5B;AACO,SAASC,GAAYxJ,GAAMyJ,GAAK;AACnC,EAAI,MAAM,QAAQzJ,CAAI,IAClBA,EAAK,QAAQ,SAAU0J,GAAS;AAC5B,IAAAD,EAAI,KAAKC,CAAO;AAAA,EACpB,CAAC,IAGDD,EAAI,KAAKzJ,CAAI;AAErB;AACO,SAAS2J,GAAQC,GAASC,GAAS;AACtC,MAAID,EAAQC,CAAO,MAAM;AACrB,UAAM,oBAAoBA;AAEpB,EAAAD,EAAQC,CAAO,GACzBD,EAAQC,CAAO,IAAI;AACvB;AACO,SAASC,GAAclN,GAAK;AAE/B,MAAIA,MAAQ;AACR,UAAM,MAAM,yCAAyC;AAEzD,SAAO;AACX;AAEO,SAASmN,KAA0B;AACtC,QAAM,MAAM,yCAAyC;AACzD;AACO,SAASC,GAAYpN,GAAK;AAC7B,SAAOA,EAAI,SAAY;AAC3B;AChCO,MAAMqN,KAAkB,CAAA;AAC/B,SAASrK,IAAI0J,EAAG,GAAG,GAAG1J,KAAK0J,EAAG,GAAG,GAAG1J;AAChC,EAAAqK,GAAgB,KAAKrK,CAAC;AAEnB,MAAMsK,KAAgB,CAACZ,EAAG,GAAG,CAAC,EAAE,OAAOW,EAAe;AAC7D,SAASrK,IAAI0J,EAAG,GAAG,GAAG1J,KAAK0J,EAAG,GAAG,GAAG1J;AAChC,EAAAsK,GAAc,KAAKtK,CAAC;AAExB,SAASA,IAAI0J,EAAG,GAAG,GAAG1J,KAAK0J,EAAG,GAAG,GAAG1J;AAChC,EAAAsK,GAAc,KAAKtK,CAAC;AAGjB,MAAMuK,KAAkB;AAAA,EAC3Bb,EAAG,GAAG;AAAA,EACNA,EAAG,IAAI;AAAA,EACPA,EAAG;AAAA,CAAI;AAAA,EACPA,EAAG,IAAI;AAAA,EACPA,EAAG,GAAI;AAAA,EACPA,EAAG,IAAI;AAAA,EACPA,EAAG,GAAI;AAAA,EACPA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,QAAQ;AAAA,EACXA,EAAG,QAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,GAAQ;AAAA,EACXA,EAAG,QAAQ;AACf,GCrCMc,KAAkB,eAClBC,KAAiB,SACjBC,KAAuB;AAGtB,MAAMC,GAAa;AAAA,EACtB,cAAc;AACV,SAAK,MAAM,GACX,KAAK,QAAQ,IACb,KAAK,WAAW;AAAA,EACpB;AAAA,EACA,YAAY;AACR,WAAO;AAAA,MACH,KAAK,KAAK;AAAA,MACV,OAAO,KAAK;AAAA,MACZ,UAAU,KAAK;AAAA,IAC3B;AAAA,EACI;AAAA,EACA,aAAaC,GAAU;AACnB,SAAK,MAAMA,EAAS,KACpB,KAAK,QAAQA,EAAS,OACtB,KAAK,WAAWA,EAAS;AAAA,EAC7B;AAAA,EACA,QAAQC,GAAO;AAEX,SAAK,MAAM,GACX,KAAK,QAAQA,GACb,KAAK,WAAW,GAChB,KAAK,YAAY,GAAG;AACpB,UAAM3S,IAAQ,KAAK,YAAW;AAC9B,SAAK,YAAY,GAAG;AACpB,UAAM4S,IAAQ;AAAA,MACV,MAAM;AAAA,MACN,KAAK,EAAE,OAAO,KAAK,KAAK,KAAKD,EAAM,OAAM;AAAA,MACzC,QAAQ;AAAA,MACR,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,SAAS;AAAA,MACT,QAAQ;AAAA,IACpB;AACQ,WAAO,KAAK;AACR,cAAQ,KAAK,QAAO,GAAE;AAAA,QAClB,KAAK;AACD,UAAAd,GAAQe,GAAO,QAAQ;AACvB;AAAA,QACJ,KAAK;AACD,UAAAf,GAAQe,GAAO,YAAY;AAC3B;AAAA,QACJ,KAAK;AACD,UAAAf,GAAQe,GAAO,WAAW;AAC1B;AAAA,QACJ,KAAK;AACD,UAAAf,GAAQe,GAAO,SAAS;AACxB;AAAA,QACJ,KAAK;AACD,UAAAf,GAAQe,GAAO,QAAQ;AACvB;AAAA,MACpB;AAEQ,QAAI,KAAK,QAAQ,KAAK,MAAM;AACxB,YAAM,MAAM,sBAAsB,KAAK,MAAM,UAAU,KAAK,GAAG,CAAC;AAEpE,WAAO;AAAA,MACH,MAAM;AAAA,MACN,OAAOA;AAAA,MACP,OAAO5S;AAAA,MACP,KAAK,KAAK,IAAI,CAAC;AAAA,IAC3B;AAAA,EACI;AAAA,EACA,cAAc;AACV,UAAM6S,IAAO,CAAA,GACPC,IAAQ,KAAK;AAEnB,SADAD,EAAK,KAAK,KAAK,aAAa,GACrB,KAAK,SAAQ,MAAO;AACvB,WAAK,YAAY,GAAG,GACpBA,EAAK,KAAK,KAAK,aAAa;AAEhC,WAAO,EAAE,MAAM,eAAe,OAAOA,GAAM,KAAK,KAAK,IAAIC,CAAK,EAAC;AAAA,EACnE;AAAA,EACA,cAAc;AACV,UAAMC,IAAQ,CAAA,GACRD,IAAQ,KAAK;AACnB,WAAO,KAAK;AACR,MAAAC,EAAM,KAAK,KAAK,MAAM;AAE1B,WAAO,EAAE,MAAM,eAAe,OAAOA,GAAO,KAAK,KAAK,IAAID,CAAK,EAAC;AAAA,EACpE;AAAA,EACA,OAAO;AACH,WAAI,KAAK,gBACE,KAAK,UAAS,IAGd,KAAK,KAAI;AAAA,EAExB;AAAA,EACA,YAAY;AACR,UAAMA,IAAQ,KAAK;AACnB,YAAQ,KAAK,QAAO,GAAE;AAAA,MAClB,KAAK;AACD,eAAO;AAAA,UACH,MAAM;AAAA,UACN,KAAK,KAAK,IAAIA,CAAK;AAAA,QACvC;AAAA,MACY,KAAK;AACD,eAAO,EAAE,MAAM,aAAa,KAAK,KAAK,IAAIA,CAAK,EAAC;AAAA;AAAA,MAEpD,KAAK;AACD,gBAAQ,KAAK,QAAO,GAAE;AAAA,UAClB,KAAK;AACD,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,KAAK,KAAK,IAAIA,CAAK;AAAA,YAC/C;AAAA,UACoB,KAAK;AACD,mBAAO;AAAA,cACH,MAAM;AAAA,cACN,KAAK,KAAK,IAAIA,CAAK;AAAA,YAC/C;AAAA,QACA;AAEgB,cAAM,MAAM,0BAA0B;AAAA;AAAA,MAE1C,KAAK;AACD,aAAK,YAAY,GAAG;AACpB,YAAIvN;AACJ,gBAAQ,KAAK,QAAO,GAAE;AAAA,UAClB,KAAK;AACD,YAAAA,IAAO;AACP;AAAA,UACJ,KAAK;AACD,YAAAA,IAAO;AACP;AAAA,UACJ,KAAK,KAAK;AACN,oBAAQ,KAAK,QAAO,GAAE;AAAA,cAClB,KAAK;AACD,gBAAAA,IAAO;AACP;AAAA,cACJ,KAAK;AACD,gBAAAA,IAAO;AAAA,YACvC;AACwB;AAAA,UACJ;AAAA,QACpB;AACgB,QAAAyM,GAAczM,CAAI;AAClB,cAAMyN,IAAc,KAAK,YAAW;AACpC,oBAAK,YAAY,GAAG,GACb;AAAA,UACH,MAAMzN;AAAA,UACN,OAAOyN;AAAA,UACP,KAAK,KAAK,IAAIF,CAAK;AAAA,QACvC;AAAA,IACA;AAEQ,WAAOb,GAAuB;AAAA,EAClC;AAAA,EACA,WAAWgB,IAAiB,IAAO;AAC/B,QAAIvJ;AACJ,UAAMoJ,IAAQ,KAAK;AACnB,YAAQ,KAAK,QAAO,GAAE;AAAA,MAClB,KAAK;AACD,QAAApJ,IAAQ;AAAA,UACJ,SAAS;AAAA,UACT,QAAQ;AAAA,QAC5B;AACgB;AAAA,MACJ,KAAK;AACD,QAAAA,IAAQ;AAAA,UACJ,SAAS;AAAA,UACT,QAAQ;AAAA,QAC5B;AACgB;AAAA,MACJ,KAAK;AACD,QAAAA,IAAQ;AAAA,UACJ,SAAS;AAAA,UACT,QAAQ;AAAA,QAC5B;AACgB;AAAA,MACJ,KAAK;AACD,cAAMwJ,IAAU,KAAK,qBAAoB;AACzC,gBAAQ,KAAK,QAAO,GAAE;AAAA,UAClB,KAAK;AACD,YAAAxJ,IAAQ;AAAA,cACJ,SAASwJ;AAAA,cACT,QAAQA;AAAA,YACpC;AACwB;AAAA,UACJ,KAAK;AACD,gBAAIC;AACJ,YAAI,KAAK,aACLA,IAAS,KAAK,qBAAoB,GAClCzJ,IAAQ;AAAA,cACJ,SAASwJ;AAAA,cACT,QAAQC;AAAA,YACxC,KAG4BzJ,IAAQ;AAAA,cACJ,SAASwJ;AAAA,cACT,QAAQ;AAAA,YACxC,GAEwB,KAAK,YAAY,GAAG;AACpB;AAAA,QACxB;AAGgB,YAAID,MAAmB,MAAQvJ,MAAU;AACrC;AAEJ,QAAAsI,GAActI,CAAK;AACnB;AAAA,IAChB;AAGQ,QAAI,EAAAuJ,MAAmB,MAAQvJ,MAAU,WAIrCsI,GAActI,CAAK;AACnB,aAAI,KAAK,SAAS,CAAC,MAAM,OACrB,KAAK,YAAY,GAAG,GACpBA,EAAM,SAAS,MAGfA,EAAM,SAAS,IAEnBA,EAAM,OAAO,cACbA,EAAM,MAAM,KAAK,IAAIoJ,CAAK,GACnBpJ;AAAA,EAEf;AAAA,EACA,OAAO;AACH,QAAI0J;AACJ,UAAMN,IAAQ,KAAK;AACnB,YAAQ,KAAK,SAAQ,GAAE;AAAA,MACnB,KAAK;AACD,QAAAM,IAAO,KAAK,OAAM;AAClB;AAAA,MACJ,KAAK;AACD,QAAAA,IAAO,KAAK,WAAU;AACtB;AAAA,MACJ,KAAK;AACD,QAAAA,IAAO,KAAK,eAAc;AAC1B;AAAA,MACJ,KAAK;AACD,QAAAA,IAAO,KAAK,MAAK;AACjB;AAAA,IAChB;AAKQ,QAJIA,MAAS,UAAa,KAAK,mBAAkB,MAC7CA,IAAO,KAAK,iBAAgB,IAG5BpB,GAAcoB,CAAI;AAClB,aAAAA,EAAK,MAAM,KAAK,IAAIN,CAAK,GACrB,KAAK,mBACLM,EAAK,aAAa,KAAK,WAAU,IAE9BA;AAAA,EAIf;AAAA,EACA,SAAS;AACL,gBAAK,YAAY,GAAG,GACb;AAAA,MACH,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,OAAO,CAAC5B,EAAG;AAAA,CAAI,GAAGA,EAAG,IAAI,GAAGA,EAAG,QAAQ,GAAGA,EAAG,QAAQ,CAAC;AAAA,IAClE;AAAA,EACI;AAAA,EACA,aAAa;AAET,YADA,KAAK,YAAY,IAAI,GACb,KAAK,SAAQ,GAAE;AAAA,MACnB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,eAAO,KAAK,kBAAiB;AAAA,MACjC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,eAAO,KAAK,qBAAoB;AAAA,MACpC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,eAAO,KAAK,kBAAiB;AAAA,MACjC,KAAK;AACD,eAAO,KAAK,wBAAuB;AAAA,MACvC,KAAK;AACD,eAAO,KAAK,iBAAgB;AAAA,MAChC,KAAK;AACD,eAAO,KAAK,sBAAqB;AAAA,MACrC,KAAK;AACD,eAAO,KAAK,gCAA+B;AAAA,MAC/C;AACI,eAAO,KAAK,mBAAkB;AAAA,IAC9C;AAAA,EACI;AAAA,EACA,oBAAoB;AAEhB,WAAO,EAAE,MAAM,sBAAsB,OADvB,KAAK,gBAAe,EACe;AAAA,EACrD;AAAA,EACA,uBAAuB;AACnB,QAAIG,GACA0B,IAAa;AACjB,YAAQ,KAAK,QAAO,GAAE;AAAA,MAClB,KAAK;AACD,QAAA1B,IAAMQ;AACN;AAAA,MACJ,KAAK;AACD,QAAAR,IAAMQ,IACNkB,IAAa;AACb;AAAA,MACJ,KAAK;AACD,QAAA1B,IAAMU;AACN;AAAA,MACJ,KAAK;AACD,QAAAV,IAAMU,IACNgB,IAAa;AACb;AAAA,MACJ,KAAK;AACD,QAAA1B,IAAMS;AACN;AAAA,MACJ,KAAK;AACD,QAAAT,IAAMS,IACNiB,IAAa;AACb;AAAA,IAChB;AAEQ,QAAIrB,GAAcL,CAAG;AACjB,aAAO,EAAE,MAAM,OAAO,OAAOA,GAAK,YAAY0B,EAAU;AAAA,EAIhE;AAAA,EACA,oBAAoB;AAChB,QAAIC;AACJ,YAAQ,KAAK,QAAO,GAAE;AAAA,MAClB,KAAK;AACD,QAAAA,IAAa9B,EAAG,IAAI;AACpB;AAAA,MACJ,KAAK;AACD,QAAA8B,IAAa9B,EAAG;AAAA,CAAI;AACpB;AAAA,MACJ,KAAK;AACD,QAAA8B,IAAa9B,EAAG,IAAI;AACpB;AAAA,MACJ,KAAK;AACD,QAAA8B,IAAa9B,EAAG,GAAI;AACpB;AAAA,MACJ,KAAK;AACD,QAAA8B,IAAa9B,EAAG,IAAI;AACpB;AAAA,IAChB;AAEQ,QAAIQ,GAAcsB,CAAU;AACxB,aAAO,EAAE,MAAM,aAAa,OAAOA,EAAU;AAAA,EAIrD;AAAA,EACA,0BAA0B;AACtB,SAAK,YAAY,GAAG;AACpB,UAAMC,IAAS,KAAK,QAAO;AAC3B,QAAI,WAAW,KAAKA,CAAM,MAAM;AAC5B,YAAM,MAAM,UAAU;AAG1B,WAAO,EAAE,MAAM,aAAa,OADTA,EAAO,YAAW,EAAG,WAAW,CAAC,IAAI,GACX;AAAA,EACjD;AAAA,EACA,mBAAmB;AAGf,gBAAK,YAAY,GAAG,GACb,EAAE,MAAM,aAAa,OAAO/B,EAAG,IAAI,EAAC;AAAA,EAC/C;AAAA,EACA,wBAAwB;AACpB,gBAAK,YAAY,GAAG,GACb,KAAK,eAAe,CAAC;AAAA,EAChC;AAAA,EACA,kCAAkC;AAC9B,gBAAK,YAAY,GAAG,GACb,KAAK,eAAe,CAAC;AAAA,EAChC;AAAA,EACA,qBAAqB;AAGjB,UAAMgC,IAAc,KAAK,QAAO;AAChC,WAAO,EAAE,MAAM,aAAa,OAAOhC,EAAGgC,CAAW,EAAC;AAAA,EACtD;AAAA,EACA,4BAA4B;AACxB,YAAQ,KAAK,SAAQ,GAAE;AAAA;AAAA,MAEnB,KAAK;AAAA;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AACD,cAAM,MAAM,KAAK;AAAA,MACrB;AACI,cAAMC,IAAW,KAAK,QAAO;AAC7B,eAAO,EAAE,MAAM,aAAa,OAAOjC,EAAGiC,CAAQ,EAAC;AAAA,IAC/D;AAAA,EACI;AAAA,EACA,iBAAiB;AACb,UAAM9B,IAAM,CAAA;AACZ,QAAI0B,IAAa;AAMjB,SALA,KAAK,YAAY,GAAG,GAChB,KAAK,SAAS,CAAC,MAAM,QACrB,KAAK,YAAY,GAAG,GACpBA,IAAa,KAEV,KAAK,iBAAe;AACvB,YAAMK,IAAO,KAAK,UAAS;AAE3B,UADyBA,EAAK,MAC1BxB,GAAYwB,CAAI,KAAK,KAAK,YAAW,GAAI;AACzC,aAAK,YAAY,GAAG;AACpB,cAAMlD,IAAK,KAAK,UAAS;AAGzB,YAFuBA,EAAG,MAEtB0B,GAAY1B,CAAE,GAAG;AACjB,cAAIA,EAAG,QAAQkD,EAAK;AAChB,kBAAM,MAAM,uCAAuC;AAEvD,UAAA/B,EAAI,KAAK,EAAE,MAAM+B,EAAK,OAAO,IAAIlD,EAAG,OAAO;AAAA,QAC/C;AAGI,UAAAkB,GAAYgC,EAAK,OAAO/B,CAAG,GAC3BA,EAAI,KAAKH,EAAG,GAAG,CAAC,GAChBE,GAAYlB,EAAG,OAAOmB,CAAG;AAAA,MAEjC;AAEI,QAAAD,GAAYgC,EAAK,OAAO/B,CAAG;AAAA,IAEnC;AACA,gBAAK,YAAY,GAAG,GACb,EAAE,MAAM,OAAO,YAAY0B,GAAY,OAAO1B,EAAG;AAAA,EAC5D;AAAA,EACA,YAAY;AACR,YAAQ,KAAK,SAAQ,GAAE;AAAA;AAAA,MAEnB,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AACD,cAAM,MAAM,KAAK;AAAA,MACrB,KAAK;AACD,eAAO,KAAK,YAAW;AAAA,MAC3B;AACI,eAAO,KAAK,0BAAyB;AAAA,IACrD;AAAA,EACI;AAAA,EACA,cAAc;AAEV,YADA,KAAK,YAAY,IAAI,GACb,KAAK,SAAQ,GAAE;AAAA;AAAA;AAAA,MAGnB,KAAK;AACD,oBAAK,YAAY,GAAG,GACb,EAAE,MAAM,aAAa,OAAOH,EAAG,IAAQ,EAAC;AAAA,MACnD,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,eAAO,KAAK,qBAAoB;AAAA,MACpC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,eAAO,KAAK,kBAAiB;AAAA,MACjC,KAAK;AACD,eAAO,KAAK,wBAAuB;AAAA,MACvC,KAAK;AACD,eAAO,KAAK,iBAAgB;AAAA,MAChC,KAAK;AACD,eAAO,KAAK,sBAAqB;AAAA,MACrC,KAAK;AACD,eAAO,KAAK,gCAA+B;AAAA,MAC/C;AACI,eAAO,KAAK,mBAAkB;AAAA,IAC9C;AAAA,EACI;AAAA,EACA,QAAQ;AACJ,QAAImC,IAAY;AAChB,SAAK,YAAY,GAAG,GACZ,KAAK,SAAS,CAAC,MACd,OACD,KAAK,YAAY,GAAG,GACpB,KAAK,YAAY,GAAG,GACpBA,IAAY,MAGZ,KAAK;AAGb,UAAM3T,IAAQ,KAAK,YAAW;AAC9B,SAAK,YAAY,GAAG;AACpB,UAAM4T,IAAW;AAAA,MACb,MAAM;AAAA,MACN,WAAWD;AAAA,MACX,OAAO3T;AAAA,IACnB;AACQ,WAAI2T,MACAC,EAAS,MAAS,KAAK,WAEpBA;AAAA,EACX;AAAA,EACA,kBAAkB;AACd,QAAIC,IAAS,KAAK,QAAO;AAGzB,QAAIrB,GAAqB,KAAKqB,CAAM,MAAM;AACtC,YAAM,MAAM,8BAA8B;AAE9C,WAAOtB,GAAe,KAAK,KAAK,SAAS,CAAC,CAAC;AACvC,MAAAsB,KAAU,KAAK,QAAO;AAE1B,WAAO,SAASA,GAAQ,EAAE;AAAA,EAC9B;AAAA,EACA,uBAAuB;AACnB,QAAIA,IAAS,KAAK,QAAO;AACzB,QAAItB,GAAe,KAAKsB,CAAM,MAAM;AAChC,YAAM,MAAM,sBAAsB;AAEtC,WAAOtB,GAAe,KAAK,KAAK,SAAS,CAAC,CAAC;AACvC,MAAAsB,KAAU,KAAK,QAAO;AAE1B,WAAO,SAASA,GAAQ,EAAE;AAAA,EAC9B;AAAA,EACA,mBAAmB;AACf,UAAMJ,IAAW,KAAK,QAAO;AAC7B,YAAQA,GAAQ;AAAA;AAAA,MAEZ,KAAK;AAAA;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAED,cAAM,MAAM,KAAK;AAAA,MACrB;AACI,eAAO,EAAE,MAAM,aAAa,OAAOjC,EAAGiC,CAAQ,EAAC;AAAA,IAC/D;AAAA,EACI;AAAA,EACA,eAAe;AACX,YAAQ,KAAK,SAAS,CAAC,GAAC;AAAA,MACpB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,eAAO;AAAA,MACX;AACI,eAAO;AAAA,IACvB;AAAA,EACI;AAAA,EACA,cAAc;AACV,WAAO,KAAK,SAAQ,MAAO,OAAO,KAAK,YAAY,CAAC;AAAA,EACxD;AAAA,EACA,UAAU;AACN,WAAOlB,GAAe,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,EAC/C;AAAA,EACA,YAAYuB,IAAU,GAAG;AACrB,YAAQ,KAAK,SAASA,CAAO,GAAC;AAAA,MAC1B,KAAK;AAAA,MACL,KAAK;AAAA;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,eAAO;AAAA,MACX;AACI,eAAO;AAAA,IACvB;AAAA,EACI;AAAA,EACA,SAAS;AACL,WAAO,KAAK,YAAY,KAAK,YAAW;AAAA,EAC5C;AAAA,EACA,SAAS;AACL,QAAI,KAAK;AACL,aAAO;AAEX,YAAQ,KAAK,SAAS,CAAC,GAAC;AAAA,MACpB,KAAK;AAAA,MACL,KAAK;AAAA;AAAA,MACL,KAAK;AAAA;AAAA;AAAA,MAEL,KAAK;AACD,eAAO;AAAA,MACX;AACI,eAAO;AAAA,IACvB;AAAA,EACI;AAAA,EACA,cAAc;AACV,YAAQ,KAAK,SAAS,CAAC,GAAC;AAAA,MACpB,KAAK;AAAA,MACL,KAAK;AACD,eAAO;AAAA;AAAA,MAEX,KAAK;AACD,gBAAQ,KAAK,SAAS,CAAC,GAAC;AAAA,UACpB,KAAK;AAAA,UACL,KAAK;AACD,mBAAO;AAAA,UACX;AACI,mBAAO;AAAA,QAC/B;AAAA;AAAA,MAEY,KAAK;AACD,eAAQ,KAAK,SAAS,CAAC,MAAM,QACxB,KAAK,SAAS,CAAC,MAAM,OAClB,KAAK,SAAS,CAAC,MAAM,OACpB,KAAK,SAAS,CAAC,MAAM,QACjB,KAAK,SAAS,CAAC,MAAM,OAAO,KAAK,SAAS,CAAC,MAAM;AAAA,MAClE;AACI,eAAO;AAAA,IACvB;AAAA,EACI;AAAA,EACA,eAAe;AACX,UAAMC,IAAY,KAAK,UAAS;AAChC,QAAI;AACA,aAAO,KAAK,WAAW,EAAI,MAAM;AAAA,IACrC,QACU;AACN,aAAO;AAAA,IACX,UACR;AACY,WAAK,aAAaA,CAAS;AAAA,IAC/B;AAAA,EACJ;AAAA,EACA,qBAAqB;AACjB,YAAQ,KAAK,SAAQ,GAAE;AAAA,MACnB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACD,eAAO;AAAA,MACX;AACI,eAAO;AAAA,IACvB;AAAA,EACI;AAAA,EACA,eAAeC,GAAS;AACpB,QAAIC,IAAY;AAChB,aAAS,IAAI,GAAG,IAAID,GAAS,KAAK;AAC9B,YAAME,IAAU,KAAK,QAAO;AAC5B,UAAI5B,GAAgB,KAAK4B,CAAO,MAAM;AAClC,cAAM,MAAM,+BAA+B;AAE/C,MAAAD,KAAaC;AAAA,IACjB;AAEA,WAAO,EAAE,MAAM,aAAa,OADX,SAASD,GAAW,EAAE,EACI;AAAA,EAC/C;AAAA,EACA,SAASH,IAAU,GAAG;AAClB,WAAO,KAAK,MAAM,KAAK,MAAMA,CAAO;AAAA,EACxC;AAAA,EACA,UAAU;AACN,UAAML,IAAW,KAAK,SAAS,CAAC;AAChC,gBAAK,YAAY,MAAS,GACnBA;AAAA,EACX;AAAA,EACA,YAAYhC,GAAM;AACd,QAAIA,MAAS,UAAa,KAAK,MAAM,KAAK,GAAG,MAAMA;AAC/C,YAAM,MAAM,gBACRA,IACA,mBACA,KAAK,MAAM,KAAK,GAAG,IACnB,kBACA,KAAK,GAAG;AAEhB,QAAI,KAAK,OAAO,KAAK,MAAM;AACvB,YAAM,MAAM,yBAAyB;AAEzC,SAAK;AAAA,EACT;AAAA,EACA,IAAIqB,GAAO;AACP,WAAO,EAAE,OAAOA,GAAO,KAAK,KAAK,IAAG;AAAA,EACxC;AACJ;ACtuBO,MAAMqB,GAAkB;AAAA,EAC3B,cAAc3O,GAAM;AAChB,eAAWnG,KAAOmG,GAAM;AACpB,YAAMwK,IAAQxK,EAAKnG,CAAG;AAEtB,MAAImG,EAAK,eAAenG,CAAG,MACnB2Q,EAAM,SAAS,SACf,KAAK,MAAMA,CAAK,IAEX,MAAM,QAAQA,CAAK,KACxBA,EAAM,QAAQ,CAACoE,MAAa;AACxB,aAAK,MAAMA,CAAQ;AAAA,MACvB,GAAG,IAAI;AAAA,IAGnB;AAAA,EACJ;AAAA,EACA,MAAM5O,GAAM;AACR,YAAQA,EAAK,MAAI;AAAA,MACb,KAAK;AACD,aAAK,aAAaA,CAAI;AACtB;AAAA,MACJ,KAAK;AACD,aAAK,WAAWA,CAAI;AACpB;AAAA,MACJ,KAAK;AACD,aAAK,iBAAiBA,CAAI;AAC1B;AAAA,MACJ,KAAK;AACD,aAAK,iBAAiBA,CAAI;AAC1B;AAAA,MACJ,KAAK;AACD,aAAK,iBAAiBA,CAAI;AAC1B;AAAA,MACJ,KAAK;AACD,aAAK,eAAeA,CAAI;AACxB;AAAA,MACJ,KAAK;AACD,aAAK,kBAAkBA,CAAI;AAC3B;AAAA,MACJ,KAAK;AACD,aAAK,qBAAqBA,CAAI;AAC9B;AAAA,MACJ,KAAK;AACD,aAAK,eAAeA,CAAI;AACxB;AAAA,MACJ,KAAK;AACD,aAAK,uBAAuBA,CAAI;AAChC;AAAA,MACJ,KAAK;AACD,aAAK,gBAAgBA,CAAI;AACzB;AAAA,MACJ,KAAK;AACD,aAAK,wBAAwBA,CAAI;AACjC;AAAA,MACJ,KAAK;AACD,aAAK,eAAeA,CAAI;AACxB;AAAA,MACJ,KAAK;AACD,aAAK,SAASA,CAAI;AAClB;AAAA,MACJ,KAAK;AACD,aAAK,WAAWA,CAAI;AACpB;AAAA,MACJ,KAAK;AACD,aAAK,wBAAwBA,CAAI;AACjC;AAAA,MACJ,KAAK;AACD,aAAK,gBAAgBA,CAAI;AACzB;AAAA,IAChB;AACQ,SAAK,cAAcA,CAAI;AAAA,EAC3B;AAAA,EACA,aAAaA,GAAM;AAAA,EAAE;AAAA,EACrB,WAAWA,GAAM;AAAA,EAAE;AAAA,EACnB,iBAAiBA,GAAM;AAAA,EAAE;AAAA,EACzB,iBAAiBA,GAAM;AAAA,EAAE;AAAA;AAAA,EAEzB,iBAAiBA,GAAM;AAAA,EAAE;AAAA,EACzB,eAAeA,GAAM;AAAA,EAAE;AAAA,EACvB,kBAAkBA,GAAM;AAAA,EAAE;AAAA,EAC1B,qBAAqBA,GAAM;AAAA,EAAE;AAAA,EAC7B,eAAeA,GAAM;AAAA,EAAE;AAAA,EACvB,uBAAuBA,GAAM;AAAA,EAAE;AAAA,EAC/B,gBAAgBA,GAAM;AAAA,EAAE;AAAA,EACxB,wBAAwBA,GAAM;AAAA,EAAE;AAAA;AAAA,EAEhC,eAAeA,GAAM;AAAA,EAAE;AAAA,EACvB,SAASA,GAAM;AAAA,EAAE;AAAA,EACjB,WAAWA,GAAM;AAAA,EAAE;AAAA,EACnB,wBAAwBA,GAAM;AAAA,EAAE;AAAA,EAChC,gBAAgBA,GAAM;AAAA,EAAE;AAC5B;ACtFO,MAAM6O,KAAiB,WACxBC,KAAe,IAAI7B,GAAY;AAcrC,MAAM8B,WAA8BJ,GAAkB;AAAA,EAClD,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,aAAa,IAClB,KAAK,iBAAiB,CAAA,GACtB,KAAK,YAAY;AAAA,EACrB;AAAA,EACA,IAAI,WAAW;AACX,WAAO,KAAK,eAAe,KAAK,EAAE;AAAA,EACtC;AAAA,EACA,MAAMK,GAAO;AACT,SAAK,YAAY,IACjB,KAAK,QAAQA,GACb,KAAK,cAAc,IACnB,KAAK,aAAa,IAClB,KAAK,iBAAiB,CAAA;AAAA,EAC1B;AAAA,EACA,WAAWhP,GAAM;AACb,IAAIA,EAAK,eACL,KAAK,aAAa,IAClB,KAAK,iBAAiB,CAAA;AAAA,EAE9B;AAAA,EACA,eAAeA,GAAM;AACjB,UAAMiM,IAAO,OAAO,aAAajM,EAAK,KAAK;AAI3C,QAHI,CAAC,KAAK,aAAaiM,MAAS;AAAA,MAC5B,KAAK,YAAY,KAEjBjM,EAAK;AACL,WAAK,aAAa,IAClB,KAAK,iBAAiB,CAAA;AAAA,SAErB;AACD,YAAMgO,IAAciB,GAAahD,CAAI;AACrC,WAAK,eAAe,KAAK+B,CAAW,GAChC,KAAK,eACL,KAAK,eAAeA;AAAA,IAE5B;AAAA,EACJ;AAAA,EACA,SAAShO,GAAM;AACX,QAAI,CAAC,KAAK,WAAW;AACjB,YAAMmM,IAAM,KAAK,MAAM,UAAUnM,EAAK,IAAI,OAAOA,EAAK,IAAI,GAAG,GACvDgP,IAAQ,IAAI,OAAO7C,CAAG;AAC5B,WAAK,YAAY,EAAQ;AAAA,EAAK,MAAM6C,CAAK;AAAA,IAC7C;AACA,QAAIhP,EAAK;AACL,WAAK,aAAa,IAClB,KAAK,iBAAiB,CAAA;AAAA,SAErB;AACD,YAAMmM,IAAM,KAAK,MAAM,UAAUnM,EAAK,IAAI,OAAOA,EAAK,IAAI,GAAG;AAC7D,WAAK,eAAe,KAAKmM,CAAG,GACxB,KAAK,eACL,KAAK,eAAeA;AAAA,IAE5B;AAAA,EACJ;AAAA,EACA,cAAcnM,GAAM;AAChB,IAAIA,EAAK,SAAS,WAGAA,EACJ,cAId,MAAM,cAAcA,CAAI;AAAA,EAC5B;AACJ;AACA,MAAMkP,KAAU,IAAIH,GAAqB;AAuBlC,SAASI,GAAmBC,GAAQ;AACvC,MAAI;AACA,WAAI,OAAOA,KAAW,aAClBA,IAAS,IAAI,OAAOA,CAAM,IAE9BA,IAASA,EAAO,SAAQ,GACxBF,GAAQ,MAAME,CAAM,GAEpBF,GAAQ,MAAMJ,GAAa,QAAQM,CAAM,CAAC,GACnCF,GAAQ;AAAA,EACnB,QACM;AACF,WAAO;AAAA,EACX;AACJ;AAKO,MAAMG,KAAwB;AAAA,0CACyB,MAAM,EAAE;AAC/D,SAASC,GAAa9U,GAAO;AAChC,QAAM4U,IAAS,OAAO5U,KAAU,WAAW,IAAI,OAAOA,CAAK,IAAIA;AAC/D,SAAO6U,GAAqB,KAAK,CAACE,MAAOH,EAAO,KAAKG,CAAE,CAAC;AAC5D;AACO,SAASN,GAAazU,GAAO;AAChC,SAAOA,EAAM,QAAQ,uBAAuB,MAAM;AACtD;AAOO,SAASgV,GAAeR,GAAO7B,GAAO;AACzC,QAAMsC,IAAUC,GAAcV,CAAK,GAC7BW,IAAQxC,EAAM,MAAMsC,CAAO;AACjC,SAAO,CAAC,CAACE,KAASA,EAAM,CAAC,EAAE,SAAS;AACxC;AAOO,SAASD,GAAcV,GAAO;AACjC,EAAI,OAAOA,KAAU,aACjBA,IAAQ,IAAI,OAAOA,CAAK;AAE5B,QAAMY,IAAKZ,GAAOxV,IAASwV,EAAM;AACjC,MAAI1M,IAAI;AACR,WAASuN,IAAU;AACf,QAAIxV,IAAS,IAAIyV;AACjB,aAASC,EAAUC,GAAS;AACxB,MAAA3V,KAAUb,EAAO,OAAO8I,GAAG0N,CAAO,GAClC1N,KAAK0N;AAAA,IACT;AACA,aAASC,EAAeD,GAAS;AAC7B,MAAA3V,KAAU,QAAQb,EAAO,OAAO8I,GAAG0N,CAAO,IAAI,OAC9C1N,KAAK0N;AAAA,IACT;AACA,WAAO1N,IAAI9I,EAAO;AACd,cAAQA,EAAO8I,CAAC,GAAC;AAAA,QACb,KAAK;AACD,kBAAQ9I,EAAO8I,IAAI,CAAC,GAAC;AAAA,YACjB,KAAK;AACD,cAAA2N,EAAe,CAAC;AAChB;AAAA,YACJ,KAAK;AACD,cAAAA,EAAe,CAAC;AAChB;AAAA,YACJ,KAAK;AACD,cAAIL,EAAG,UACCpW,EAAO8I,IAAI,CAAC,MAAM,MAClB2N,EAAezW,EAAO,QAAQ,KAAK8I,CAAC,IAAIA,IAAI,CAAC,IAG7C2N,EAAe,CAAC,IAIpBA,EAAe,CAAC;AAEpB;AAAA,YACJ,KAAK;AAAA,YACL,KAAK;AACD,cAAIL,EAAG,UACHK,EAAezW,EAAO,QAAQ,KAAK8I,CAAC,IAAIA,IAAI,CAAC,IAG7C2N,EAAe,CAAC;AAEpB;AAAA,YACJ,KAAK;AACD,cAAAA,EAAezW,EAAO,QAAQ,KAAK8I,CAAC,IAAIA,IAAI,CAAC;AAC7C;AAAA,YACJ;AACI,cAAA2N,EAAe,CAAC;AAChB;AAAA,UAC5B;AACoB;AAAA,QACJ,KAAK;AACD,UAAAH,IAAM,oBACNA,EAAI,YAAYxN,GAChBwN,IAAMA,EAAI,KAAKtW,CAAM,KAAK,CAAA,GAC1ByW,EAAeH,EAAI,CAAC,EAAE,MAAM;AAC5B;AAAA,QACJ,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACD,UAAAC,EAAU,CAAC;AACX;AAAA,QACJ,KAAK;AACD,UAAAD,IAAM,iBACNA,EAAI,YAAYxN,GAChBwN,IAAMA,EAAI,KAAKtW,CAAM,GACjBsW,IACAC,EAAUD,EAAI,CAAC,EAAE,MAAM,IAGvBG,EAAe,CAAC;AAEpB;AAAA,QACJ,KAAK;AACD,cAAIzW,EAAO8I,IAAI,CAAC,MAAM;AAClB,oBAAQ9I,EAAO8I,IAAI,CAAC,GAAC;AAAA,cACjB,KAAK;AACD,gBAAAjI,KAAU,OACViI,KAAK,GACLjI,KAAUwV,EAAO,IAAK;AACtB;AAAA,cACJ,KAAK;AACD,gBAAAxV,KAAU,OACViI,KAAK,GACLjI,KAAUwV,EAAO,IAAK;AACtB;AAAA,cACJ,KAAK;AACD,gBAAAC,IAAMxN,GACNA,KAAK,GACLuN,EAAO,GACPxV,KAAUb,EAAO,OAAOsW,GAAKxN,IAAIwN,CAAG;AACpC;AAAA,cACJ,KAAK;AACD,wBAAQtW,EAAO8I,IAAI,CAAC,GAAC;AAAA,kBACjB,KAAK;AAAA,kBACL,KAAK;AACD,oBAAAwN,IAAMxN,GACNA,KAAK,GACLuN,EAAO,GACPxV,KAAUb,EAAO,OAAOsW,GAAKxN,IAAIwN,CAAG;AACpC;AAAA,kBACJ;AACI,oBAAAC,EAAUvW,EAAO,QAAQ,KAAK8I,CAAC,IAAIA,IAAI,CAAC,GACxCjI,KAAUwV,EAAO,IAAK;AACtB;AAAA,gBACxC;AACgC;AAAA,YAChC;AAAA;AAGwB,YAAAE,EAAU,CAAC,GACX1V,KAAUwV,EAAO,IAAK;AAE1B;AAAA,QACJ,KAAK;AACD,mBAAEvN,GACKjI;AAAA,QACX;AACI,UAAA4V,EAAe,CAAC;AAChB;AAAA,MACpB;AAEQ,WAAO5V;AAAA,EACX;AACA,SAAO,IAAI,OAAOwV,KAAWb,EAAM,KAAK;AAC5C;ACrRO,SAASkB,GAAaC,GAAS;AAClC,SAAOA,EAAQ,MAAM,KAAK,OAAKC,GAAiB,CAAC,KAAK,EAAE,KAAK;AACjE;AAIO,SAASC,GAAeF,GAAS;AACpC,SAAOA,EAAQ,MAAM,OAAO,OAAKG,GAAmB,CAAC,KAAK,EAAE,MAAM;AACtE;AASO,SAASC,GAAqBJ,GAASK,GAAc;AACxD,QAAMC,IAAY,oBAAI,IAAG,GACnBC,IAAYR,GAAaC,CAAO;AACtC,MAAI,CAACO;AACD,WAAO,IAAI,IAAIP,EAAQ,KAAK;AAEhC,QAAMQ,IAAe,CAACD,CAAS,EAAE,OAAOL,GAAeF,CAAO,CAAC;AAC/D,aAAWS,KAAQD;AACf,IAAAE,GAAQD,GAAMH,GAAWD,CAAY;AAEzC,QAAMM,IAAQ,oBAAI,IAAG;AACrB,aAAWF,KAAQT,EAAQ;AACvB,KAAIM,EAAU,IAAIG,EAAK,IAAI,KAAMN,GAAmBM,CAAI,KAAKA,EAAK,WAC9DE,EAAM,IAAIF,CAAI;AAGtB,SAAOE;AACX;AACA,SAASD,GAAQD,GAAMG,GAAYP,GAAc;AAC7C,EAAAO,EAAW,IAAIH,EAAK,IAAI,GACxBvM,GAAkBuM,CAAI,EAAE,QAAQ,CAAA5Q,MAAQ;AACpC,QAAIgR,GAAehR,CAAI,KAAMwQ,GAA+C;AACxE,YAAMS,IAAUjR,EAAK,KAAK;AAC1B,MAAIiR,KAAW,CAACF,EAAW,IAAIE,EAAQ,IAAI,KACvCJ,GAAQI,GAASF,GAAYP,CAAY;AAAA,IAEjD;AAAA,EACJ,CAAC;AACL;AA8BO,SAASU,GAA0BC,GAAU;AAChD,MAAIA,EAAS;AACT,WAAOA,EAAS;AAEf,MAAIA,EAAS,KAAK;AAEnB,WADsBC,GAAmBD,EAAS,KAAK,GAAG,GACpC;AAG9B;AAMO,SAASE,GAAkBC,GAAc;AAC5C,SAAOA,EAAa,UAAU,CAAChC,GAAaiC,GAAcD,CAAY,CAAC;AAC3E;AAOO,SAASE,GAAqBxR,GAAMmE,GAAU;AACjD,SAAI,CAACnE,KAAQ,CAACmE,IACH,CAAA,IAEJsN,GAA6BzR,GAAMmE,GAAUnE,EAAK,SAAS,EAAI;AAC1E;AAUO,SAAS0R,GAAoB1R,GAAMmE,GAAUhK,GAAO;AACvD,MAAI,CAAC6F,KAAQ,CAACmE;AACV;AAEJ,QAAMwN,IAAQF,GAA6BzR,GAAMmE,GAAUnE,EAAK,SAAS,EAAI;AAC7E,MAAI2R,EAAM,WAAW;AAGrB,WAAIxX,MAAU,SACVA,IAAQ,KAAK,IAAI,GAAG,KAAK,IAAIA,GAAOwX,EAAM,SAAS,CAAC,CAAC,IAGrDxX,IAAQ,GAELwX,EAAMxX,CAAK;AACtB;AACA,SAASsX,GAA6BzR,GAAMmE,GAAU9C,GAASuQ,GAAO;AAClE,MAAI,CAACA,GAAO;AACR,UAAMC,IAAclO,GAAmB3D,EAAK,eAAe8R,EAAgB;AAC3E,QAAID,KAAeA,EAAY,YAAY1N;AACvC,aAAO,CAACnE,CAAI;AAAA,EAEpB;AACA,SAAIS,GAAmBT,CAAI,KAAKA,EAAK,YAAYqB,IACtCrB,EAAK,QAAQ,QAAQ,CAAA2C,MAAK8O,GAA6B9O,GAAGwB,GAAU9C,GAAS,EAAK,CAAC,IAEvF,CAAA;AACX;AAsBO,SAAS0Q,GAAmB/R,GAAMgS,GAAS7X,GAAO;AACrD,MAAI,CAAC6F;AACD;AAEJ,QAAM2R,IAAQM,GAA4BjS,GAAMgS,GAAShS,GAAM,OAAO;AACtE,MAAI2R,EAAM,WAAW;AAGrB,WAAIxX,MAAU,SACVA,IAAQ,KAAK,IAAI,GAAG,KAAK,IAAIA,GAAOwX,EAAM,SAAS,CAAC,CAAC,IAGrDxX,IAAQ,GAELwX,EAAMxX,CAAK;AACtB;AACO,SAAS8X,GAA4BjS,GAAMgS,GAAS3Q,GAAS;AAChE,MAAIrB,EAAK,YAAYqB;AACjB,WAAO,CAAA;AAEX,MAAI6Q,GAAclS,EAAK,aAAa,KAAKA,EAAK,cAAc,UAAUgS;AAClE,WAAO,CAAChS,CAAI;AAEhB,QAAMmS,IAAe7H,GAAUtK,CAAI,EAAE,SAAQ;AAC7C,MAAI3F;AACJ,QAAM+X,IAAe,CAAA;AACrB;AAEI,QADA/X,IAAS8X,EAAa,KAAI,GACtB,CAAC9X,EAAO,MAAM;AACd,YAAMgY,IAAYhY,EAAO;AACzB,MAAIgY,EAAU,YAAYhR,IAClB6Q,GAAcG,EAAU,aAAa,KAAKA,EAAU,cAAc,UAAUL,KAC5EI,EAAa,KAAKC,CAAS,IAI/BF,EAAa,MAAK;AAAA,IAE1B;AAAA,SACK,CAAC9X,EAAO;AACjB,SAAO+X;AACX;AAOO,SAASE,GAAejH,GAAS;AACpC,QAAM9G,IAAU8G,EAAQ;AAGxB,SAAO9G,MAAY8G,EAAQ,WAAW,WAAS;AAC3C,UAAMkH,IAAa5O,GAAmB0H,EAAQ,eAAeyG,EAAgB;AAC7E,QAAIS;AACA,aAAOA;AAEX,IAAAlH,IAAUA,EAAQ;AAAA,EACtB;AAEJ;AAMO,SAAS+F,GAAmBrR,GAAM;AACrC,MAAIyS,IAAYzS;AAChB,SAAI0S,GAAmBD,CAAS,MAExBE,GAAaF,EAAU,UAAU,IAEjCA,IAAYA,EAAU,WAAW,aAE5BG,GAAyBH,EAAU,UAAU,IAElDA,IAAYA,EAAU,aAGtB1G,GAAkB0G,EAAU,UAAU,IAGvCI,GAA2B7S,GAAMyS,GAAW,oBAAI,IAAG,CAAE;AAChE;AACA,SAASI,GAA2B7S,GAAMyS,GAAWK,GAAO;AAExD,WAASC,EAAG9S,GAAM+S,GAAS;AACvB,QAAIC;AAGJ,WAFyBrP,GAAmB3D,GAAM8R,EAAgB,MAG9DkB,IAAkBJ,GAA2BG,GAASA,GAASF,CAAK,IAExEA,EAAM,IAAI9S,GAAMiT,CAAe,GACxBA;AAAA,EACX;AACA,MAAIH,EAAM,IAAI9S,CAAI;AACd,WAAO8S,EAAM,IAAI9S,CAAI;AAEzB,EAAA8S,EAAM,IAAI9S,GAAM,MAAS;AACzB,aAAWC,KAAQqE,GAAkBmO,CAAS,GAAG;AAC7C,QAAIV,GAAiB9R,CAAI,KAAKA,EAAK,QAAQ,YAAW,MAAO;AACzD,aAAA6S,EAAM,IAAI9S,GAAMC,CAAI,GACbA;AAEN,QAAIgR,GAAehR,CAAI,KAAKoQ,GAAiBpQ,EAAK,KAAK,GAAG;AAC3D,aAAO8S,EAAG9S,GAAMA,EAAK,KAAK,GAAG;AAE5B,QAAIiT,GAAiBjT,CAAI,KAAKA,EAAK,SAAS;AAC7C,aAAO8S,EAAG9S,GAAMA,EAAK,QAAQ,GAAG;AAAA,EAExC;AAEJ;AAuCO,SAASkT,GAAetC,GAAM;AACjC,SAAOuC,GAAuBvC,GAAM,oBAAI,KAAK;AACjD;AACA,SAASuC,GAAuBvC,GAAMwC,GAAS;AAC3C,MAAIA,EAAQ,IAAIxC,CAAI;AAChB,WAAO;AAGP,EAAAwC,EAAQ,IAAIxC,CAAI;AAEpB,aAAW5Q,KAAQqE,GAAkBuM,CAAI;AACrC,QAAII,GAAehR,CAAI;AAQnB,UAPI,CAACA,EAAK,KAAK,OAIXoQ,GAAiBpQ,EAAK,KAAK,GAAG,KAAK,CAACmT,GAAuBnT,EAAK,KAAK,KAAKoT,CAAO,KAGjFC,GAAgBrT,EAAK,KAAK,GAAG;AAC7B,eAAO;AAAA,WAGV;AAAA,UAAI8R,GAAiB9R,CAAI;AAC1B,eAAO;AAEN,UAAI0S,GAAa1S,CAAI;AACtB,eAAO;AAAA;AAGf,SAAO,EAAQ4Q,EAAK;AACxB;AA4CO,SAAS0C,GAAoB1C,GAAM;AACtC,MAAIN,CAAAA,GAAmBM,CAAI,GAG3B;AAAA,QAAIA,EAAK;AACL,aAAOA,EAAK,aAAa;AAExB,QAAIA,EAAK;AACV,aAAOA,EAAK;AAEX,QAAIA,EAAK,YAAY;AACtB,YAAMmC,IAAUnC,EAAK,WAAW;AAChC,UAAImC;AACA,eAAOA,EAAQ;AAAA,IAEvB;AAAA;AAEJ;AACO,SAASQ,GAAYxT,GAAM;AAC9B,MAAI4S,GAAyB5S,CAAI;AAC7B,WAAOqQ,GAAiBrQ,CAAI,KAAKmT,GAAenT,CAAI,IAAIA,EAAK,OAAOuT,GAAoBvT,CAAI,KAAKA,EAAK;AAErG,MAAIyT,GAAgBzT,CAAI,KAAK0T,GAAW1T,CAAI,KAAK2T,GAAiB3T,CAAI;AACvE,WAAOA,EAAK;AAEX,MAAI2S,GAAa3S,CAAI,GAAG;AACzB,UAAM4T,IAAaC,GAAc7T,CAAI;AACrC,QAAI4T;AACA,aAAOA;AAAA,EAEf,WACSlB,GAAmB1S,CAAI;AAC5B,WAAOA,EAAK;AAEhB,QAAM,IAAI,MAAM,iCAAiC;AACrD;AACO,SAAS6T,GAAcC,GAAQ;AAClC,MAAIA,EAAO;AACP,WAAOA,EAAO,aAAa;AAE1B,MAAIA,EAAO,MAAM;AAClB,WAAON,GAAYM,EAAO,KAAK,GAAG;AAG1C;AAuBO,SAASC,GAAYlD,GAAM;AAC9B,SAAIN,GAAmBM,CAAI,IAChBA,EAAK,MAAM,QAAQ,WAGnB0C,GAAoB1C,CAAI,KAAKA,EAAK;AAEjD;AACO,SAASW,GAAcD,GAAc;AACxC,QAAMlE,IAAQ;AAAA,IACV,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACX,GACU5T,IAASua,GAAuBzC,EAAa,YAAYlE,CAAK,GAC9D4G,IAAW,OAAO,QAAQ5G,CAAK,EAAE,OAAO,CAAC,GAAG5S,CAAK,MAAMA,CAAK,EAAE,IAAI,CAAC,CAACkJ,CAAI,MAAMA,CAAI,EAAE,KAAK,EAAE;AACjG,SAAO,IAAI,OAAOlK,GAAQwa,CAAQ;AACtC;AAEA,MAAMC,KAAW,SAAS;AAC1B,SAASF,GAAuB1S,GAAS+L,GAAO;AAC5C,MAAI8G,GAA2B7S,CAAO;AAClC,WAAO8S,GAA4B9S,CAAO;AAEzC,MAAI+S,GAAoB/S,CAAO;AAChC,WAAOgT,GAAqBhT,CAAO;AAElC,MAAIiT,GAAqBjT,CAAO;AACjC,WAAOkT,GAAsBlT,CAAO;AAEnC,MAAImT,GAAuBnT,CAAO,GAAG;AACtC,UAAMuP,IAAOvP,EAAQ,KAAK;AAC1B,QAAI,CAACuP;AACD,YAAM,IAAI,MAAM,yBAAyB;AAE7C,WAAO6D,GAAgBV,GAAuBnD,EAAK,UAAU,GAAG;AAAA,MAC5D,aAAavP,EAAQ;AAAA,MACrB,WAAWA,EAAQ;AAAA,MACnB,eAAeA,EAAQ;AAAA,IACnC,CAAS;AAAA,EACL,OACK;AAAA,QAAIqT,GAAmBrT,CAAO;AAC/B,aAAOsT,GAAmBtT,CAAO;AAEhC,QAAIuT,GAAiBvT,CAAO;AAC7B,aAAOwT,GAAkBxT,CAAO;AAE/B,QAAIyT,GAAiBzT,CAAO,GAAG;AAChC,YAAM0T,IAAY1T,EAAQ,MAAM,YAAY,GAAG,GACzC7H,IAAS6H,EAAQ,MAAM,UAAU,GAAG0T,CAAS,GAC7CC,IAAa3T,EAAQ,MAAM,UAAU0T,IAAY,CAAC;AACxD,aAAI3H,MACAA,EAAM,IAAI4H,EAAW,SAAS,GAAG,GACjC5H,EAAM,IAAI4H,EAAW,SAAS,GAAG,GACjC5H,EAAM,IAAI4H,EAAW,SAAS,GAAG,IAE9BP,GAAgBjb,GAAQ;AAAA,QAC3B,aAAa6H,EAAQ;AAAA,QACrB,WAAWA,EAAQ;AAAA,QACnB,eAAeA,EAAQ;AAAA,QACvB,MAAM;AAAA,MAClB,CAAS;AAAA,IACL,OACK;AAAA,UAAI4T,GAAe5T,CAAO;AAC3B,eAAOoT,GAAgBR,IAAU;AAAA,UAC7B,aAAa5S,EAAQ;AAAA,UACrB,WAAWA,EAAQ;AAAA,UACnB,eAAeA,EAAQ;AAAA,QACnC,CAAS;AAGD,YAAM,IAAI,MAAM,6BAA6BA,GAAS,KAAK,KAAKA,GAAS,UAAU,IAAI,EAAE;AAAA;AAAA;AAEjG;AACA,SAAS8S,GAA4Be,GAAc;AAC/C,SAAOT,GAAgBS,EAAa,SAAS,IAAI,OAAKnB,GAAuB,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG;AAAA,IACxF,aAAamB,EAAa;AAAA,IAC1B,WAAWA,EAAa;AAAA,IACxB,eAAeA,EAAa;AAAA,IAC5B,MAAM;AAAA;AAAA,EACd,CAAK;AACL;AACA,SAASb,GAAqBc,GAAO;AACjC,SAAOV,GAAgBU,EAAM,SAAS,IAAI,OAAKpB,GAAuB,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG;AAAA,IAChF,aAAaoB,EAAM;AAAA,IACnB,WAAWA,EAAM;AAAA,IACjB,eAAeA,EAAM;AAAA,IACrB,MAAM;AAAA;AAAA,EACd,CAAK;AACL;AACA,SAASN,GAAkBO,GAAO;AAC9B,SAAOX,GAAgB,GAAGR,EAAQ,KAAKF,GAAuBqB,EAAM,QAAQ,CAAC,IAAI;AAAA,IAC7E,aAAaA,EAAM;AAAA,IACnB,WAAWA,EAAM;AAAA,IACjB,eAAeA,EAAM;AAAA,EAC7B,CAAK;AACL;AACA,SAAST,GAAmBxW,GAAQ;AAChC,SAAOsW,GAAgB,MAAMV,GAAuB5V,EAAO,QAAQ,CAAC,IAAI8V,EAAQ,MAAM;AAAA,IAClF,aAAa9V,EAAO;AAAA,IACpB,WAAWA,EAAO;AAAA,IAClB,eAAeA,EAAO;AAAA,EAC9B,CAAK;AACL;AACA,SAASoW,GAAsBrQ,GAAO;AAClC,SAAIA,EAAM,QACCuQ,GAAgB,IAAIY,GAAenR,EAAM,IAAI,CAAC,IAAImR,GAAenR,EAAM,KAAK,CAAC,KAAK;AAAA,IACrF,aAAaA,EAAM;AAAA,IACnB,WAAWA,EAAM;AAAA,IACjB,eAAeA,EAAM;AAAA,IACrB,MAAM;AAAA,EAClB,CAAS,IAEEuQ,GAAgBY,GAAenR,EAAM,IAAI,GAAG;AAAA,IAC/C,aAAaA,EAAM;AAAA,IACnB,WAAWA,EAAM;AAAA,IACjB,eAAeA,EAAM;AAAA,IACrB,MAAM;AAAA,EACd,CAAK;AACL;AACA,SAASmR,GAAerD,GAAS;AAC7B,SAAO/C,GAAa+C,EAAQ,KAAK;AACrC;AACA,SAASyC,GAAgBzF,GAAO9L,GAAS;AAKrC,UAJIA,EAAQ,iBAAiBA,EAAQ,aAAaA,EAAQ,SAAS,QAE/D8L,IAAQ,IADY9L,EAAQ,cAAcA,EAAQ,gBAAgB,KAAK,KAChD,GAAG8L,CAAK,MAE/B9L,EAAQ,cACD,GAAG8L,CAAK,GAAG9L,EAAQ,WAAW,KAElC8L;AACX;AC/kBO,SAASsG,GAAoBC,GAAU;AAC1C,QAAMzE,IAAQ,CAAA,GACRX,IAAUoF,EAAS;AACzB,aAAW3E,KAAQT,EAAQ;AACvB,IAAI9G,GAAeuH,CAAI,KAAKS,GAAkBT,CAAI,KAAKzB,GAAmBoC,GAAcX,CAAI,CAAC,KACzFE,EAAM,KAAKF,EAAK,IAAI;AAG5B,SAAO;AAAA,IACH,uBAAuBE;AAAA,IACvB,YAAY3F;AAAA,EACpB;AACA;ACzBO,SAASqK,GAAYC,GAAK;AAE7B,EAAI,WAAW,QAAQ,SACnB,QAAQ,MAAM,UAAUA,CAAG,EAAE;AAErC;AACO,SAASC,GAAcD,GAAK;AAE/B,EAAI,WAAW,QAAQ,QAEnB,QAAQ,KAAK,YAAYA,CAAG,EAAE;AAEtC;ACZO,SAASE,GAAMza,GAAM;AACxB,QAAMjB,KAAQ,oBAAI,KAAI,GAAG,QAAO,GAC1B2b,IAAM1a,EAAI;AAGhB,SAAO,EAAE,OAFG,oBAAI,KAAI,GAAG,QAAO,IACVjB,GACE,OAAO2b,EAAG;AACpC;ACLO,SAASC,GAAiBC,GAAc;AAC3C,WAASC,IAAkB;AAAA,EAAE;AAE7B,EAAAA,EAAgB,YAAYD;AAC5B,QAAME,IAAe,IAAID,EAAe;AACxC,WAASE,IAAa;AAClB,WAAO,OAAOD,EAAa;AAAA,EAC/B;AAGA,SAAAC,EAAU,GACVA,EAAU,GAICH;AAMf;ACpBA,SAASI,GAAWC,GAAS;AACzB,SAAIC,GAAcD,CAAO,IACdA,EAAQ,QAGRA,EAAQ;AAEvB;AAEA,SAASC,GAAc9W,GAAK;AACxB,SAAOjC,GAASiC,EAAI,KAAK,KAAKA,EAAI,UAAU;AAChD;AACO,MAAM+W,GAAmB;AAAA,EAC5B,IAAI,aAAa;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,WAAW7b,GAAO;AAClB,SAAK,cAAcA;AAAA,EACvB;AAAA,EACA,YAAY8b,GAAa;AACrB,SAAK,cAAcA;AAAA,EACvB;AAAA,EACA,OAAOpH,GAAS;AACZ,IAAAA,EAAQ,MAAM,IAAI,GAClBqH,EAAQ,KAAK,YAAY,CAACC,MAAS;AAC/B,MAAAA,EAAK,OAAOtH,CAAO;AAAA,IACvB,CAAC;AAAA,EACL;AACJ;AACO,MAAMuH,WAAoBJ,GAAmB;AAAA,EAChD,YAAYnT,GAAS;AACjB,UAAM,CAAA,CAAE,GACR,KAAK,MAAM,GACX7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AAAA,EACA,IAAI,WAAWC,GAAY;AAAA,EAE3B;AAAA,EACA,IAAI,aAAa;AACb,WAAI,KAAK,mBAAmB,SACjB,KAAK,eAAe,aAExB,CAAA;AAAA,EACX;AAAA,EACA,OAAOzH,GAAS;AACZ,IAAAA,EAAQ,MAAM,IAAI;AAAA,EAEtB;AACJ;AACO,MAAM0H,WAAaP,GAAmB;AAAA,EACzC,YAAYnT,GAAS;AACjB,UAAMA,EAAQ,UAAU,GACxB,KAAK,UAAU,IACf7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AACJ;AACO,MAAMG,WAAoBR,GAAmB;AAAA,EAChD,YAAYnT,GAAS;AACjB,UAAMA,EAAQ,UAAU,GACxB,KAAK,oBAAoB,IACzB7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AACJ;SACO,cAAqBL,GAAmB;AAAA,EAC3C,YAAYnT,GAAS;AACjB,UAAMA,EAAQ,UAAU,GACxB,KAAK,MAAM,GACX7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AACJ;AACO,MAAMI,WAA4BT,GAAmB;AAAA,EACxD,YAAYnT,GAAS;AACjB,UAAMA,EAAQ,UAAU,GACxB,KAAK,MAAM,GACX7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AACJ;AACO,MAAMK,WAAyCV,GAAmB;AAAA,EACrE,YAAYnT,GAAS;AACjB,UAAMA,EAAQ,UAAU,GACxB,KAAK,MAAM,GACX7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AACJ;AACO,MAAMM,WAAmBX,GAAmB;AAAA,EAC/C,YAAYnT,GAAS;AACjB,UAAMA,EAAQ,UAAU,GACxB,KAAK,MAAM,GACX7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AACJ;AACO,MAAMO,WAAgCZ,GAAmB;AAAA,EAC5D,YAAYnT,GAAS;AACjB,UAAMA,EAAQ,UAAU,GACxB,KAAK,MAAM,GACX7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AACJ;AACO,MAAMQ,WAAoBb,GAAmB;AAAA,EAChD,IAAI,aAAa;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,WAAW7b,GAAO;AAClB,SAAK,cAAcA;AAAA,EACvB;AAAA,EACA,YAAY0I,GAAS;AACjB,UAAMA,EAAQ,UAAU,GACxB,KAAK,MAAM,GACX,KAAK,oBAAoB,IACzB,KAAK,gBAAgB,IACrB7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AACJ;AACO,MAAMS,GAAS;AAAA,EAClB,YAAYjU,GAAS;AACjB,SAAK,MAAM,GACX7J,GAAO,MAAMgF,GAAO6E,GAAS,CAACwT,MAAMA,MAAM,MAAS,CAAC;AAAA,EACxD;AAAA,EACA,OAAOxH,GAAS;AACZ,IAAAA,EAAQ,MAAM,IAAI;AAAA,EACtB;AACJ;AACO,SAASkI,GAAiBC,GAAU;AACvC,SAAOpa,EAAIoa,GAAUC,EAAmB;AAC5C;AACO,SAASA,GAAoBtX,GAAM;AACtC,WAASuX,EAAkBZ,GAAY;AACnC,WAAO1Z,EAAI0Z,GAAYW,EAAmB;AAAA,EAC9C;AAEA,MAAItX,aAAgByW,IAAa;AAC7B,UAAMe,IAAwB;AAAA,MAC1B,MAAM;AAAA,MACN,MAAMxX,EAAK;AAAA,MACX,KAAKA,EAAK;AAAA,IACtB;AACQ,WAAI3C,GAAS2C,EAAK,KAAK,MACnBwX,EAAsB,QAAQxX,EAAK,QAEhCwX;AAAA,EACX,OACK;AAAA,QAAIxX,aAAgB6W;AACrB,aAAO;AAAA,QACH,MAAM;AAAA,QACN,YAAYU,EAAkBvX,EAAK,UAAU;AAAA,MACzD;AAES,QAAIA,aAAgByX;AACrB,aAAO;AAAA,QACH,MAAM;AAAA,QACN,KAAKzX,EAAK;AAAA,QACV,YAAYuX,EAAkBvX,EAAK,UAAU;AAAA,MACzD;AAES,QAAIA,aAAgB8W;AACrB,aAAO;AAAA,QACH,MAAM;AAAA,QACN,KAAK9W,EAAK;AAAA,QACV,YAAYuX,EAAkBvX,EAAK,UAAU;AAAA,MACzD;AAES,QAAIA,aAAgB+W;AACrB,aAAO;AAAA,QACH,MAAM;AAAA,QACN,KAAK/W,EAAK;AAAA,QACV,WAAYsX,GAAoB,IAAIH,GAAS,EAAE,cAAcnX,EAAK,UAAS,CAAE,CAAC;AAAA,QAC9E,YAAYuX,EAAkBvX,EAAK,UAAU;AAAA,MACzD;AAES,QAAIA,aAAgBiX;AACrB,aAAO;AAAA,QACH,MAAM;AAAA,QACN,KAAKjX,EAAK;AAAA,QACV,WAAYsX,GAAoB,IAAIH,GAAS,EAAE,cAAcnX,EAAK,UAAS,CAAE,CAAC;AAAA,QAC9E,YAAYuX,EAAkBvX,EAAK,UAAU;AAAA,MACzD;AAES,QAAIA,aAAgBgX;AACrB,aAAO;AAAA,QACH,MAAM;AAAA,QACN,KAAKhX,EAAK;AAAA,QACV,YAAYuX,EAAkBvX,EAAK,UAAU;AAAA,MACzD;AAES,QAAIA,aAAgBkX;AACrB,aAAO;AAAA,QACH,MAAM;AAAA,QACN,KAAKlX,EAAK;AAAA,QACV,YAAYuX,EAAkBvX,EAAK,UAAU;AAAA,MACzD;AAES,QAAIA,aAAgBmX,IAAU;AAC/B,YAAMO,IAAqB;AAAA,QACvB,MAAM;AAAA,QACN,MAAM1X,EAAK,aAAa;AAAA,QACxB,OAAOkW,GAAWlW,EAAK,YAAY;AAAA,QACnC,KAAKA,EAAK;AAAA,MACtB;AACQ,MAAI3C,GAAS2C,EAAK,KAAK,MACnB0X,EAAmB,gBAAgB1X,EAAK;AAE5C,YAAM2X,IAAU3X,EAAK,aAAa;AAClC,aAAIA,EAAK,aAAa,YAClB0X,EAAmB,UAAU1Z,GAAS2Z,CAAO,IACvCA,EAAQ,SACRA,IAEHD;AAAA,IACX,OACK;AAAA,UAAI1X,aAAgB4W;AACrB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,MAAM5W,EAAK;AAAA,UACX,SAASA,EAAK;AAAA,UACd,YAAYuX,EAAkBvX,EAAK,UAAU;AAAA,QACzD;AAIQ,YAAM,MAAM,sBAAsB;AAAA;AAAA;AAE1C;AC9NO,MAAM4X,GAAY;AAAA,EACrB,MAAM5X,GAAM;AACR,UAAM6X,IAAU7X;AAChB,YAAQ6X,EAAQ,aAAW;AAAA,MACvB,KAAKpB;AACD,eAAO,KAAK,iBAAiBoB,CAAO;AAAA,MACxC,KAAKhB;AACD,eAAO,KAAK,iBAAiBgB,CAAO;AAAA,MACxC,KAAKJ;AACD,eAAO,KAAK,YAAYI,CAAO;AAAA,MACnC,KAAKf;AACD,eAAO,KAAK,yBAAyBe,CAAO;AAAA,MAChD,KAAKd;AACD,eAAO,KAAK,sCAAsCc,CAAO;AAAA,MAC7D,KAAKZ;AACD,eAAO,KAAK,6BAA6BY,CAAO;AAAA,MACpD,KAAKb;AACD,eAAO,KAAK,gBAAgBa,CAAO;AAAA,MACvC,KAAKX;AACD,eAAO,KAAK,iBAAiBW,CAAO;AAAA,MACxC,KAAKV;AACD,eAAO,KAAK,cAAcU,CAAO;AAAA,MACrC,KAAKjB;AACD,eAAO,KAAK,UAAUiB,CAAO;AAAA;AAAA,MAEjC;AACI,cAAM,MAAM,sBAAsB;AAAA,IAClD;AAAA,EACI;AAAA;AAAA,EAEA,iBAAiB7X,GAAM;AAAA,EAAE;AAAA;AAAA,EAEzB,iBAAiBA,GAAM;AAAA,EAAE;AAAA;AAAA,EAEzB,YAAYA,GAAM;AAAA,EAAE;AAAA;AAAA,EAEpB,gBAAgBA,GAAM;AAAA,EAAE;AAAA;AAAA,EAExB,yBAAyBA,GAAM;AAAA,EAAE;AAAA;AAAA,EAEjC,sCAAsCA,GAAM;AAAA,EAAE;AAAA;AAAA,EAE9C,6BAA6BA,GAAM;AAAA,EAAE;AAAA;AAAA,EAErC,iBAAiBA,GAAM;AAAA,EAAE;AAAA;AAAA,EAEzB,cAAcA,GAAM;AAAA,EAAE;AAAA;AAAA,EAEtB,UAAUA,GAAM;AAAA,EAAE;AACtB;AChDO,SAAS8X,GAAetB,GAAM;AACjC,SAAQA,aAAgBK,MACpBL,aAAgBiB,MAChBjB,aAAgBQ,MAChBR,aAAgBM,MAChBN,aAAgBO,MAChBP,aAAgBS,MAChBT,aAAgBW,MAChBX,aAAgBI;AACxB;AACO,SAASmB,GAAevB,GAAMwB,IAAiB,IAAI;AAItD,SAH2BxB,aAAgBiB,MACvCjB,aAAgBQ,MAChBR,aAAgBS,KAET,KAKPT,aAAgBU,KAETlY,GAAKwX,EAAK,YAAY,CAACyB,MACnBF,GAAeE,GAASD,CAAc,CAChD,IAEIxB,aAAgBC,MAAehb,GAASuc,GAAgBxB,CAAI,IAE1D,KAEFA,aAAgBH,MACjBG,aAAgBC,MAChBuB,EAAe,KAAKxB,CAAI,GAErB1Z,GAAM0Z,EAAK,YAAY,CAACyB,MACpBF,GAAeE,GAASD,CAAc,CAChD,KAGM;AAEf;AACO,SAASE,GAAgB1B,GAAM;AAClC,SAAOA,aAAgBU;AAC3B;AACO,SAASiB,GAAqB3B,GAAM;AAEvC,MAAIA,aAAgBC;AAChB,WAAO;AAEN,MAAID,aAAgBiB;AACrB,WAAO;AAEN,MAAIjB,aAAgBU;AACrB,WAAO;AAEN,MAAIV,aAAgBM;AACrB,WAAO;AAEN,MAAIN,aAAgBO;AACrB,WAAO;AAEN,MAAIP,aAAgBS;AACrB,WAAO;AAEN,MAAIT,aAAgBQ;AACrB,WAAO;AAEN,MAAIR,aAAgBW;AACrB,WAAO;AAIP,QAAM,MAAM,sBAAsB;AAE1C;ACxEO,MAAMiB,GAAW;AAAA,EACpB,KAAK5B,GAAM6B,IAAW,IAAI;AACtB,IAAA9B,EAAQC,EAAK,YAAY,CAACyB,GAAS9d,MAAU;AACzC,YAAMme,IAAWhc,GAAKka,EAAK,YAAYrc,IAAQ,CAAC;AAEhD,UAAI8d,aAAmBxB;AACnB,aAAK,YAAYwB,GAASK,GAAUD,CAAQ;AAAA,eAEvCJ,aAAmBd;AACxB,aAAK,aAAac,GAASK,GAAUD,CAAQ;AAAA,eAExCJ,aAAmBpB;AACxB,aAAK,SAASoB,GAASK,GAAUD,CAAQ;AAAA,eAEpCJ,aAAmBR;AACxB,aAAK,WAAWQ,GAASK,GAAUD,CAAQ;AAAA,eAEtCJ,aAAmBnB;AACxB,aAAK,eAAemB,GAASK,GAAUD,CAAQ;AAAA,eAE1CJ,aAAmBlB;AACxB,aAAK,kBAAkBkB,GAASK,GAAUD,CAAQ;AAAA,eAE7CJ,aAAmBhB;AACxB,aAAK,YAAYgB,GAASK,GAAUD,CAAQ;AAAA,eAEvCJ,aAAmBjB;AACxB,aAAK,SAASiB,GAASK,GAAUD,CAAQ;AAAA,eAEpCJ,aAAmBf;AACxB,aAAK,OAAOe,GAASK,GAAUD,CAAQ;AAAA;AAGvC,cAAM,MAAM,sBAAsB;AAAA,IAE1C,CAAC;AAAA,EACL;AAAA,EACA,aAAaE,GAAUD,GAAUD,GAAU;AAAA,EAAE;AAAA,EAC7C,YAAYG,GAASF,GAAUD,GAAU;AAAA,EAAE;AAAA,EAC3C,SAASI,GAAUH,GAAUD,GAAU;AAEnC,UAAMK,IAAaJ,EAAS,OAAOD,CAAQ;AAC3C,SAAK,KAAKI,GAAUC,CAAU;AAAA,EAClC;AAAA,EACA,WAAWC,GAAYL,GAAUD,GAAU;AAEvC,UAAMK,IAAaJ,EAAS,OAAOD,CAAQ;AAC3C,SAAK,KAAKM,GAAYD,CAAU;AAAA,EACpC;AAAA,EACA,eAAeE,GAAgBN,GAAUD,GAAU;AAE/C,UAAMQ,IAAqB;AAAA,MACvB,IAAIpB,GAAO,EAAE,YAAYmB,EAAe,WAAU,CAAE;AAAA,IAChE,EAAU,OAAON,GAAUD,CAAQ;AAC3B,SAAK,KAAKO,GAAgBC,CAAkB;AAAA,EAChD;AAAA,EACA,kBAAkBC,GAAmBR,GAAUD,GAAU;AAErD,UAAMU,IAAwBC,GAA+BF,GAAmBR,GAAUD,CAAQ;AAClG,SAAK,KAAKS,GAAmBC,CAAqB;AAAA,EACtD;AAAA,EACA,SAASE,GAAUX,GAAUD,GAAU;AAEnC,UAAMa,IAAe;AAAA,MACjB,IAAIzB,GAAO,EAAE,YAAYwB,EAAS,WAAU,CAAE;AAAA,IAC1D,EAAU,OAAOX,GAAUD,CAAQ;AAC3B,SAAK,KAAKY,GAAUC,CAAY;AAAA,EACpC;AAAA,EACA,YAAYC,GAAab,GAAUD,GAAU;AAEzC,UAAMe,IAAkBJ,GAA+BG,GAAab,GAAUD,CAAQ;AACtF,SAAK,KAAKc,GAAaC,CAAe;AAAA,EAC1C;AAAA,EACA,OAAOC,GAAQf,GAAUD,GAAU;AAE/B,UAAMK,IAAaJ,EAAS,OAAOD,CAAQ;AAE3C,IAAA9B,EAAQ8C,EAAO,YAAY,CAACC,MAAQ;AAIhC,YAAMC,IAAc,IAAI1C,GAAY,EAAE,YAAY,CAACyC,CAAG,GAAG;AACzD,WAAK,KAAKC,GAAab,CAAU;AAAA,IACrC,CAAC;AAAA,EACL;AACJ;AACA,SAASM,GAA+BQ,GAAYlB,GAAUD,GAAU;AASpE,SARmB;AAAA,IACf,IAAIZ,GAAO;AAAA,MACP,YAAY;AAAA,QACR,IAAIN,GAAS,EAAE,cAAcqC,EAAW,UAAS,CAAE;AAAA,MACnE,EAAc,OAAOA,EAAW,UAAU;AAAA,IAC1C,CAAS;AAAA,EACT,EACsC,OAAOlB,GAAUD,CAAQ;AAE/D;ACnGO,SAASzG,GAAM4E,GAAM;AAExB,MAAIA,aAAgBC;AAShB,WAAO7E,GAAM4E,EAAK,cAAc;AAE/B,MAAIA,aAAgBW;AACrB,WAAOsC,GAAiBjD,CAAI;AAE3B,MAAIsB,GAAetB,CAAI;AACxB,WAAOkD,GAAiBlD,CAAI;AAE3B,MAAI0B,GAAgB1B,CAAI;AACzB,WAAOmD,GAAkBnD,CAAI;AAG7B,QAAM,MAAM,sBAAsB;AAE1C;AACO,SAASkD,GAAiBlD,GAAM;AACnC,MAAIoD,IAAW,CAAA;AACf,QAAMC,IAAMrD,EAAK;AACjB,MAAIsD,IAAiB,GACjBC,IAAyBF,EAAI,SAASC,GACtCE,GAEAC,IAA0B;AAE9B,SAAOF,KAA0BE;AAC7B,IAAAD,IAAcH,EAAIC,CAAc,GAChCG,IAA0BlC,GAAeiC,CAAW,GACpDJ,IAAWA,EAAS,OAAOhI,GAAMoI,CAAW,CAAC,GAC7CF,IAAiBA,IAAiB,GAClCC,IAAyBF,EAAI,SAASC;AAE1C,SAAO5a,GAAK0a,CAAQ;AACxB;AACO,SAASD,GAAkBnD,GAAM;AACpC,QAAM0D,IAAwBjd,EAAIuZ,EAAK,YAAY,CAAC2D,MACzCvI,GAAMuI,CAAS,CACzB;AACD,SAAOjb,GAAKkb,GAAQF,CAAqB,CAAC;AAC9C;AACO,SAAST,GAAiBlB,GAAU;AACvC,SAAO,CAACA,EAAS,YAAY;AACjC;ACrDO,MAAM8B,KAAK;ACMX,MAAMC,WAA4BlC,GAAW;AAAA,EAChD,YAAYmC,GAAS;AACjB,UAAK,GACL,KAAK,UAAUA,GACf,KAAK,UAAU,CAAA;AAAA,EACnB;AAAA,EACA,eAAe;AACX,gBAAK,KAAK,KAAK,OAAO,GACf,KAAK;AAAA,EAChB;AAAA,EACA,aAAahC,GAAUD,GAAUD,GAAU;AAAA,EAE3C;AAAA,EACA,YAAYG,GAASF,GAAUD,GAAU;AACrC,UAAMmC,IAAaC,GAA8BjC,EAAQ,gBAAgBA,EAAQ,GAAG,IAChF,KAAK,QAAQ,MACXkC,IAAWpC,EAAS,OAAOD,CAAQ,GACnCsC,IAAW,IAAI9D,GAAY,EAAE,YAAY6D,EAAQ,CAAE,GACnDE,IAAuBhJ,GAAM+I,CAAQ;AAC3C,SAAK,QAAQH,CAAU,IAAII;AAAA,EAC/B;AACJ;AACO,SAASC,GAAuBC,GAAgB;AACnD,QAAMC,IAAgB,CAAA;AACtB,SAAAxE,EAAQuE,GAAgB,CAACP,MAAY;AACjC,UAAMS,IAAiB,IAAIV,GAAoBC,CAAO,EAAE,aAAY;AACpE,IAAAlhB,GAAO0hB,GAAeC,CAAc;AAAA,EACxC,CAAC,GACMD;AACX;AACO,SAASN,GAA8BQ,GAAOC,GAAmB;AACpE,SAAOD,EAAM,OAAOC,IAAoBb;AAC5C;ACtCA,IAAIc,KAAiB,CAAA;AACrB,MAAMC,KAAe,IAAInO,GAAY;AAC9B,SAASoO,GAAaC,GAAQ;AACjC,QAAMC,IAAYD,EAAO,SAAQ;AACjC,MAAIH,GAAe,eAAeI,CAAS;AACvC,WAAOJ,GAAeI,CAAS;AAE9B;AACD,UAAMC,IAAYJ,GAAa,QAAQG,CAAS;AAChD,WAAAJ,GAAeI,CAAS,IAAIC,GACrBA;AAAA,EACX;AACJ;AACO,SAASC,KAAyB;AACrC,EAAAN,KAAiB,CAAA;AACrB;ACXA,MAAMO,KAAyB,iEAClBC,KAA8B;AAAA;AACpC,SAASC,GAA8BN,GAAQO,IAAsB,IAAO;AAC/E,MAAI;AACA,UAAMC,IAAMT,GAAaC,CAAM;AAE/B,WADmBS,GAA0BD,EAAI,OAAO,CAAA,GAAIA,EAAI,MAAM,UAAU;AAAA,EAEpF,SACOnZ,GAAG;AAIN,QAAIA,EAAE,YAAY+Y;AACd,MAAIG,KACAnG,GAAc,GAAGiG,EAA2B,0BACbL,EAAO,SAAQ,CAAE;AAAA;AAAA;AAAA,2FAGiD;AAAA,SAGpG;AACD,UAAIU,IAAY;AAChB,MAAIH,MACAG,IACI;AAAA;AAAA,kGAGRxG,GAAY,GAAGmG,EAA2B;AAAA,qBACfL,EAAO,SAAQ,CAAE;AAAA;AAAA,6EAGxCU,CAAS;AAAA,IACjB;AAAA,EACJ;AACA,SAAO,CAAA;AACX;AACO,SAASD,GAA0BD,GAAKzhB,GAAQ4hB,GAAY;AAC/D,UAAQH,EAAI,MAAI;AAAA,IACZ,KAAK;AACD,eAAS,IAAI,GAAG,IAAIA,EAAI,MAAM,QAAQ;AAClC,QAAAC,GAA0BD,EAAI,MAAM,CAAC,GAAGzhB,GAAQ4hB,CAAU;AAE9D;AAAA,IACJ,KAAK;AACD,YAAM1O,IAAQuO,EAAI;AAClB,eAAS,IAAI,GAAG,IAAIvO,EAAM,QAAQ,KAAK;AACnC,cAAM2O,IAAO3O,EAAM,CAAC;AAEpB,gBAAQ2O,EAAK,MAAI;AAAA,UACb,KAAK;AAAA;AAAA;AAAA;AAAA,UAIL,KAAK;AAAA;AAAA,UAEL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACD;AAAA,QACxB;AACgB,cAAMtO,IAAOsO;AACb,gBAAQtO,EAAK,MAAI;AAAA,UACb,KAAK;AACD,YAAAuO,GAAwBvO,EAAK,OAAOvT,GAAQ4hB,CAAU;AACtD;AAAA,UACJ,KAAK;AACD,gBAAIrO,EAAK,eAAe;AACpB,oBAAM,MAAM8N,EAAsB;AAEtC,YAAAnF,EAAQ3I,EAAK,OAAO,CAACwO,MAAS;AAC1B,kBAAI,OAAOA,KAAS;AAChB,gBAAAD,GAAwBC,GAAM/hB,GAAQ4hB,CAAU;AAAA,mBAE/C;AAED,sBAAM/X,IAAQkY;AAEd,oBAAIH,MAAe;AACf,2BAASI,IAAYnY,EAAM,MAAMmY,KAAanY,EAAM,IAAImY;AACpD,oBAAAF,GAAwBE,GAAWhiB,GAAQ4hB,CAAU;AAAA,qBAIxD;AAED,2BAASI,IAAYnY,EAAM,MAAMmY,KAAanY,EAAM,MAAMmY,IAAYC,IAAoBD;AACtF,oBAAAF,GAAwBE,GAAWhiB,GAAQ4hB,CAAU;AAGzD,sBAAI/X,EAAM,MAAMoY,IAAoB;AAChC,0BAAMC,IAAcrY,EAAM,QAAQoY,KAC5BpY,EAAM,OACNoY,IACAE,IAActY,EAAM,IACpBuY,IAAYC,GAAyBH,CAAW,GAChDI,IAAYD,GAAyBF,CAAW;AACtD,6BAASI,IAAaH,GAAWG,KAAcD,GAAWC;AACtD,sBAAAviB,EAAOuiB,CAAU,IAAIA;AAAA,kBAE7B;AAAA,gBACJ;AAAA,cACJ;AAAA,YACJ,CAAC;AACD;AAAA,UACJ,KAAK;AACD,YAAAb,GAA0BnO,EAAK,OAAOvT,GAAQ4hB,CAAU;AACxD;AAAA;AAAA,UAEJ;AACI,kBAAM,MAAM,sBAAsB;AAAA,QAC1D;AAEgB,cAAMY,IAAuBjP,EAAK,eAAe,UAAaA,EAAK,WAAW,YAAY;AAC1F;AAAA;AAAA;AAAA,UAGCA,EAAK,SAAS,WAAWkP,GAAgBlP,CAAI,MAAM;AAAA,UAE/CA,EAAK,SAAS,WAAWiP,MAAyB;AAAA;AACnD;AAAA,MAER;AACA;AAAA;AAAA,IAEJ;AACI,YAAM,MAAM,uBAAuB;AAAA,EAC/C;AAEI,SAAOthB,GAAOlB,CAAM;AACxB;AACA,SAAS8hB,GAAwBC,GAAM/hB,GAAQ4hB,GAAY;AACvD,QAAMc,IAAmBL,GAAyBN,CAAI;AACtD,EAAA/hB,EAAO0iB,CAAgB,IAAIA,GACvBd,MAAe,MACfe,GAAiBZ,GAAM/hB,CAAM;AAErC;AACA,SAAS2iB,GAAiBZ,GAAM/hB,GAAQ;AACpC,QAAM4R,IAAO,OAAO,aAAamQ,CAAI,GAC/Ba,IAAYhR,EAAK,YAAW;AAElC,MAAIgR,MAAchR,GAAM;AACpB,UAAM8Q,IAAmBL,GAAyBO,EAAU,WAAW,CAAC,CAAC;AACzE,IAAA5iB,EAAO0iB,CAAgB,IAAIA;AAAA,EAC/B,OACK;AACD,UAAMG,IAAYjR,EAAK,YAAW;AAClC,QAAIiR,MAAcjR,GAAM;AACpB,YAAM8Q,IAAmBL,GAAyBQ,EAAU,WAAW,CAAC,CAAC;AACzE,MAAA7iB,EAAO0iB,CAAgB,IAAIA;AAAA,IAC/B;AAAA,EACJ;AACJ;AACA,SAASI,GAASC,GAASC,GAAiB;AACxC,SAAOC,GAAKF,EAAQ,OAAO,CAACG,MAAgB;AACxC,QAAI,OAAOA,KAAgB;AACvB,aAAO9hB,GAAS4hB,GAAiBE,CAAW;AAE3C;AAED,YAAMrZ,IAAQqZ;AACd,aAAQD,GAAKD,GAAiB,CAACG,MAAetZ,EAAM,QAAQsZ,KAAcA,KAActZ,EAAM,EAAE,MAAM;AAAA,IAC1G;AAAA,EACJ,CAAC;AACL;AACA,SAAS4Y,GAAgBhB,GAAK;AAC1B,QAAM2B,IAAa3B,EAAI;AACvB,SAAI2B,KAAcA,EAAW,YAAY,IAC9B,KAEN3B,EAAI,QAGF3gB,GAAQ2gB,EAAI,KAAK,IAClBhf,GAAMgf,EAAI,OAAOgB,EAAe,IAChCA,GAAgBhB,EAAI,KAAK,IAJpB;AAKf;AACA,MAAM4B,WAAuB/O,GAAkB;AAAA,EAC3C,YAAY0O,GAAiB;AACzB,UAAK,GACL,KAAK,kBAAkBA,GACvB,KAAK,QAAQ;AAAA,EACjB;AAAA,EACA,cAAcrd,GAAM;AAEhB,QAAI,KAAK,UAAU,IAKnB;AAAA,cAAQA,EAAK,MAAI;AAAA,QACb,KAAK;AACD,eAAK,eAAeA,CAAI;AACxB;AAAA,QACJ,KAAK;AACD,eAAK,uBAAuBA,CAAI;AAChC;AAAA,QACJ,KAAK;AACD,eAAK,gBAAgBA,CAAI;AACzB;AAAA,QACJ,KAAK;AACD,eAAK,wBAAwBA,CAAI;AACjC;AAAA,MAChB;AACQ,YAAM,cAAcA,CAAI;AAAA;AAAA,EAC5B;AAAA,EACA,eAAeA,GAAM;AACjB,IAAIvE,GAAS,KAAK,iBAAiBuE,EAAK,KAAK,MACzC,KAAK,QAAQ;AAAA,EAErB;AAAA,EACA,SAASA,GAAM;AACX,IAAIA,EAAK,aACDmd,GAASnd,GAAM,KAAK,eAAe,MAAM,WACzC,KAAK,QAAQ,MAIbmd,GAASnd,GAAM,KAAK,eAAe,MAAM,WACzC,KAAK,QAAQ;AAAA,EAGzB;AACJ;AACO,SAAS2d,GAAiBC,GAAWjG,GAAS;AACjD,MAAIA,aAAmB,QAAQ;AAC3B,UAAMmE,IAAMT,GAAa1D,CAAO,GAC1BkG,IAAiB,IAAIH,GAAeE,CAAS;AACnD,WAAAC,EAAe,MAAM/B,CAAG,GACjB+B,EAAe;AAAA,EAC1B;AAEI,WAAQP,GAAK3F,GAAS,CAAC1L,MACZxQ,GAASmiB,GAAW3R,EAAK,WAAW,CAAC,CAAC,CAChD,MAAM;AAEf;AChPA,MAAM6R,KAAU,WACHC,KAAe,eACfC,KAAQ;AACd,SAASC,GAAkBC,GAAYhb,GAAS;AACnD,EAAAA,IAAUib,GAASjb,GAAS;AAAA,IACxB,OAAO;AAAA,IACP,UAAU;AAAA,IACV,kBAAkB;AAAA,IAClB,0BAA0B,CAAC,MAAM;AAAA,CAAI;AAAA,IACrC,QAAQ,CAACuS,GAAK5B,MAAWA,EAAM;AAAA,EACvC,CAAK;AACD,QAAMuK,IAASlb,EAAQ;AACvB,EAAAkb,EAAO,mCAAmC,MAAM;AAC5C,IAAAC,GAA+B;AAAA,EACnC,CAAC;AACD,MAAIC;AACJ,EAAAF,EAAO,mBAAmB,MAAM;AAC5B,IAAAE,IAAoB1f,GAAOsf,GAAY,CAACK,MAC7BA,EAAST,EAAO,MAAMU,GAAM,EACtC;AAAA,EACL,CAAC;AACD,MAAIC,IAAY,IACZC;AACJ,EAAAN,EAAO,sBAAsB,MAAM;AAC/B,IAAAK,IAAY,IACZC,IAAyBzhB,EAAIqhB,GAAmB,CAACC,MAAa;AAC1D,YAAMI,IAAcJ,EAAST,EAAO;AAEpC,UAAI9f,GAAS2gB,CAAW,GAAG;AACvB,cAAMC,IAAeD,EAAY;AACjC,eAAIC,EAAa,WAAW;AAAA,QAExBA,MAAiB,OACjBA,MAAiB,OACjBA,MAAiB,OACjB,CAACD,EAAY,aACNC,IAEFA,EAAa,WAAW,KAC7BA,EAAa,CAAC,MAAM;AAAA,QAEpB,CAACnjB,GAAS;AAAA,UACN;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACxB,GAAuBmjB,EAAa,CAAC,CAAC,IAIXA,EAAa,CAAC,IAGdC,GAAcF,CAAW;AAAA,MAExC,OACK;AAAA,YAAIG,GAAWH,CAAW;AAC3B,iBAAAF,IAAY,IAEL,EAAE,MAAME,EAAW;AAEzB,YAAI,OAAOA,KAAgB;AAC5B,iBAAAF,IAAY,IAELE;AAEN,YAAI,OAAOA,KAAgB,UAAU;AACtC,cAAIA,EAAY,WAAW;AACvB,mBAAOA;AAEN;AACD,kBAAMI,IAAsBJ,EAAY,QAAQ,uBAAuB,MAAM,GACvEK,IAAgB,IAAI,OAAOD,CAAmB;AACpD,mBAAOF,GAAcG,CAAa;AAAA,UACtC;AAAA,QACJ;AAEI,gBAAM,MAAM,sBAAsB;AAAA;AAAA,IAE1C,CAAC;AAAA,EACL,CAAC;AACD,MAAIC,GACAC,GACAC,GACAC,GACAC;AACJ,EAAAjB,EAAO,gBAAgB,MAAM;AACzB,IAAAa,IAAmBhiB,EAAIqhB,GAAmB,CAACC,MAAaA,EAAS,YAAY,GAC7EW,IAAoBjiB,EAAIqhB,GAAmB,CAACgB,MAAU;AAClD,YAAMC,IAAYD,EAAM;AAExB,UAAIC,MAAcf,GAAM,SAGnB;AAAA,YAAInhB,GAASkiB,CAAS;AACvB,iBAAOA;AAEN,YAAIC,GAAYD,CAAS;AAC1B,iBAAO;AAGP,cAAM,MAAM,sBAAsB;AAAA;AAAA,IAE1C,CAAC,GACDJ,IAA8BliB,EAAIqhB,GAAmB,CAACgB,MAAU;AAC5D,YAAMG,IAAgBH,EAAM;AAC5B,UAAIG;AAIA,eAHwBtkB,GAAQskB,CAAa,IACvCxiB,EAAIwiB,GAAe,CAAC1f,MAASpC,GAAQ2gB,GAAmBve,CAAI,CAAC,IAC7D,CAACpC,GAAQ2gB,GAAmBmB,CAAa,CAAC;AAAA,IAGxD,CAAC,GACDL,IAAuBniB,EAAIqhB,GAAmB,CAACgB,MAAUA,EAAM,SAAS,GACxED,IAAsBpiB,EAAIqhB,GAAmB,CAACgB,MAAUI,EAAIJ,GAAO,UAAU,CAAC;AAAA,EAClF,CAAC;AACD,MAAIK;AACJ,EAAAvB,EAAO,4BAA4B,MAAM;AACrC,UAAMwB,IAA0BC,GAAa3c,EAAQ,wBAAwB;AAC7E,IAAAyc,IAAgC1iB,EAAIqhB,GAAmB,CAACnI,MAAY,EAAK,GACrEjT,EAAQ,qBAAqB,iBAC7Byc,IAAgC1iB,EAAIqhB,GAAmB,CAACnI,MAChDuJ,EAAIvJ,GAAS,aAAa,IACnB,CAAC,CAACA,EAAQ,cAGT2J,GAAsB3J,GAASyJ,CAAuB,MAAM,MAChEjC,GAAiBiC,GAAyBzJ,EAAQ,OAAO,CAEpE;AAAA,EAET,CAAC;AACD,MAAI4J,GACAC,GACAC,GACAC;AACJ,EAAA9B,EAAO,mBAAmB,MAAM;AAC5B,IAAA2B,IAAuB9iB,EAAIqhB,GAAmB6B,EAAe,GAC7DH,IAAoB/iB,EAAIyhB,GAAwB0B,EAAc,GAC9DH,IAAcI,GAAO/B,GAAmB,CAACgC,GAAKhB,MAAU;AACpD,YAAMC,IAAYD,EAAM;AACxB,aAAIjiB,GAASkiB,CAAS,KAAOA,MAAcf,GAAM,YAC7C8B,EAAIf,CAAS,IAAI,CAAA,IAEde;AAAA,IACX,GAAG,CAAA,CAAE,GACLJ,IAAqBjjB,EAAIyhB,GAAwB,CAAC6B,GAAGC,OAC1C;AAAA,MACH,SAAS9B,EAAuB8B,CAAG;AAAA,MACnC,WAAWrB,EAA4BqB,CAAG;AAAA,MAC1C,mBAAmBb,EAA8Ba,CAAG;AAAA,MACpD,UAAUT,EAAqBS,CAAG;AAAA,MAClC,OAAOR,EAAkBQ,CAAG;AAAA,MAC5B,OAAOtB,EAAkBsB,CAAG;AAAA,MAC5B,MAAMpB,EAAqBoB,CAAG;AAAA,MAC9B,KAAKnB,EAAoBmB,CAAG;AAAA,MAC5B,cAAcvB,EAAiBuB,CAAG;AAAA,MAClC,WAAWlC,EAAkBkC,CAAG;AAAA,IAChD,EACS;AAAA,EACL,CAAC;AACD,MAAIC,IAAiB,IACjBC,IAA+B,CAAA;AACnC,SAAKxd,EAAQ,YACTkb,EAAO,2BAA2B,MAAM;AACpC,IAAAsC,IAA+BL,GAAO/B,GAAmB,CAACjkB,GAAQsmB,GAAaH,MAAQ;AACnF,UAAI,OAAOG,EAAY,WAAY,UAAU;AACzC,cAAMC,IAAWD,EAAY,QAAQ,WAAW,CAAC,GAC3CE,IAAenE,GAAyBkE,CAAQ;AACtD,QAAAE,GAAiBzmB,GAAQwmB,GAAcX,EAAmBM,CAAG,CAAC;AAAA,MAClE,WACSrlB,GAAQwlB,EAAY,gBAAgB,GAAG;AAC5C,YAAII;AACJ,QAAAxK,EAAQoK,EAAY,kBAAkB,CAACK,MAAc;AACjD,gBAAMJ,IAAW,OAAOI,KAAc,WAChCA,EAAU,WAAW,CAAC,IACtBA,GACAC,KAAmBvE,GAAyBkE,CAAQ;AAK1D,UAAIG,MAAqBE,OACrBF,IAAmBE,IACnBH,GAAiBzmB,GAAQ4mB,IAAkBf,EAAmBM,CAAG,CAAC;AAAA,QAE1E,CAAC;AAAA,MACL,WACSxiB,GAAS2iB,EAAY,OAAO;AACjC,YAAIA,EAAY,QAAQ;AACpB,UAAAF,IAAiB,IACbvd,EAAQ,uBACRsS,GAAY,GAAGmG,EAA2B,wBACbgF,EAAY,QAAQ,SAAQ,CAAE;AAAA;AAAA;AAAA,gGAG2C;AAAA,aAGzG;AACD,gBAAMO,IAAiBtF,GAA8B+E,EAAY,SAASzd,EAAQ,mBAAmB;AAIrG,UAAIie,GAAQD,CAAc,MAItBT,IAAiB,KAErBlK,EAAQ2K,GAAgB,CAAC9E,MAAS;AAC9B,YAAA0E,GAAiBzmB,GAAQ+hB,GAAM8D,EAAmBM,CAAG,CAAC;AAAA,UAC1D,CAAC;AAAA,QACL;AAAA;AAGA,QAAItd,EAAQ,uBACRsS,GAAY,GAAGmG,EAA2B,gBACrBgF,EAAY,IAAI;AAAA;AAAA,+FAEgE,GAEzGF,IAAiB;AAErB,aAAOpmB;AAAA,IACX,GAAG,CAAA,CAAE;AAAA,EACT,CAAC,GAEE;AAAA,IACH,aAAa4lB;AAAA,IACb,oBAAoBC;AAAA,IACpB,8BAA8BQ;AAAA,IAC9B,WAAWjC;AAAA,IACX,gBAAgBgC;AAAA,EACxB;AACA;AACO,SAASW,GAAiBlD,GAAYmD,GAAiB;AAC1D,MAAIC,IAAS,CAAA;AACb,QAAMC,IAAgBC,GAAoBtD,CAAU;AACpD,EAAAoD,IAASA,EAAO,OAAOC,EAAc,MAAM;AAC3C,QAAME,IAAgBC,GAAoBH,EAAc,KAAK,GACvDI,IAAkBF,EAAc;AACtC,SAAAH,IAASA,EAAO,OAAOG,EAAc,MAAM,GAC3CH,IAASA,EAAO,OAAOM,GAAsBD,CAAe,CAAC,GAC7DL,IAASA,EAAO,OAAOO,GAAqBF,CAAe,CAAC,GAC5DL,IAASA,EAAO,OAAOQ,GAAwBH,GAAiBN,CAAe,CAAC,GAChFC,IAASA,EAAO,OAAOS,GAAwBJ,CAAe,CAAC,GACxDL;AACX;AACA,SAASM,GAAsB1D,GAAY;AACvC,MAAIoD,IAAS,CAAA;AACb,QAAMU,IAAqBC,GAAO/D,GAAY,CAACyC,MAAgB3iB,GAAS2iB,EAAY7C,EAAO,CAAC,CAAC;AAC7F,SAAAwD,IAASA,EAAO,OAAOY,GAAqBF,CAAkB,CAAC,GAC/DV,IAASA,EAAO,OAAOa,GAAuBH,CAAkB,CAAC,GACjEV,IAASA,EAAO,OAAOc,GAAqBJ,CAAkB,CAAC,GAC/DV,IAASA,EAAO,OAAOe,GAAsBL,CAAkB,CAAC,GAChEV,IAASA,EAAO,OAAOgB,GAAsBN,CAAkB,CAAC,GACzDV;AACX;AACO,SAASE,GAAoBtD,GAAY;AAC5C,QAAMqE,IAA+BN,GAAO/D,GAAY,CAACK,MAC9C,CAACmB,EAAInB,GAAUT,EAAO,CAChC,GACKwD,IAASrkB,EAAIslB,GAA8B,CAAChE,OACvC;AAAA,IACH,SAAS,mBACLA,EAAS,OACT;AAAA,IACJ,MAAMiE,GAAyB;AAAA,IAC/B,YAAY,CAACjE,CAAQ;AAAA,EACjC,EACK,GACKkE,IAAQvmB,GAAWgiB,GAAYqE,CAA4B;AACjE,SAAO,EAAE,QAAAjB,GAAQ,OAAAmB,EAAK;AAC1B;AACO,SAASf,GAAoBxD,GAAY;AAC5C,QAAMwE,IAA+BT,GAAO/D,GAAY,CAACK,MAAa;AAClE,UAAM5G,IAAU4G,EAAST,EAAO;AAChC,WAAQ,CAAC9f,GAAS2Z,CAAO,KACrB,CAACmH,GAAWnH,CAAO,KACnB,CAAC+H,EAAI/H,GAAS,MAAM,KACpB,CAACta,GAASsa,CAAO;AAAA,EACzB,CAAC,GACK2J,IAASrkB,EAAIylB,GAA8B,CAACnE,OACvC;AAAA,IACH,SAAS,mBACLA,EAAS,OACT;AAAA,IAEJ,MAAMiE,GAAyB;AAAA,IAC/B,YAAY,CAACjE,CAAQ;AAAA,EACjC,EACK,GACKkE,IAAQvmB,GAAWgiB,GAAYwE,CAA4B;AACjE,SAAO,EAAE,QAAApB,GAAQ,OAAAmB,EAAK;AAC1B;AACA,MAAME,KAAe;AACd,SAAST,GAAqBhE,GAAY;AAAA,EAC7C,MAAM0E,UAAwBjU,GAAkB;AAAA,IAC5C,cAAc;AACV,YAAM,GAAG,SAAS,GAClB,KAAK,QAAQ;AAAA,IACjB;AAAA,IACA,eAAe3O,GAAM;AACjB,WAAK,QAAQ;AAAA,IACjB;AAAA,EACR;AACI,QAAM6iB,IAAeZ,GAAO/D,GAAY,CAACK,MAAa;AAClD,UAAM5G,IAAU4G,EAAS;AACzB,QAAI;AACA,YAAMuE,IAAYzH,GAAa1D,CAAO,GAChCoL,IAAmB,IAAIH,EAAe;AAC5C,aAAAG,EAAiB,MAAMD,CAAS,GACzBC,EAAiB;AAAA,IAC5B,QACU;AAGN,aAAOJ,GAAa,KAAKhL,EAAQ,MAAM;AAAA,IAC3C;AAAA,EACJ,CAAC;AAaD,SAZe1a,EAAI4lB,GAAc,CAACtE,OACvB;AAAA,IACH,SAAS;AAAA,mBAELA,EAAS,OACT;AAAA;AAAA,IAGJ,MAAMiE,GAAyB;AAAA,IAC/B,YAAY,CAACjE,CAAQ;AAAA,EACjC,EACK;AAEL;AACO,SAAS+D,GAAsBpE,GAAY;AAC9C,QAAM8E,IAAqBf,GAAO/D,GAAY,CAACK,MAC3BA,EAAS,QACV,KAAK,EAAE,CACzB;AAUD,SATethB,EAAI+lB,GAAoB,CAACzE,OAC7B;AAAA,IACH,SAAS,mBACLA,EAAS,OACT;AAAA,IACJ,MAAMiE,GAAyB;AAAA,IAC/B,YAAY,CAACjE,CAAQ;AAAA,EACjC,EACK;AAEL;AACA,MAAM0E,KAAiB;AAChB,SAASd,GAAuBjE,GAAY;AAAA,EAC/C,MAAMgF,UAA0BvU,GAAkB;AAAA,IAC9C,cAAc;AACV,YAAM,GAAG,SAAS,GAClB,KAAK,QAAQ;AAAA,IACjB;AAAA,IACA,iBAAiB3O,GAAM;AACnB,WAAK,QAAQ;AAAA,IACjB;AAAA,EACR;AACI,QAAM6iB,IAAeZ,GAAO/D,GAAY,CAACK,MAAa;AAClD,UAAM5G,IAAU4G,EAAS;AACzB,QAAI;AACA,YAAMuE,IAAYzH,GAAa1D,CAAO,GAChCwL,IAAqB,IAAID,EAAiB;AAChD,aAAAC,EAAmB,MAAML,CAAS,GAC3BK,EAAmB;AAAA,IAC9B,QACU;AAGN,aAAOF,GAAe,KAAKtL,EAAQ,MAAM;AAAA,IAC7C;AAAA,EACJ,CAAC;AAaD,SAZe1a,EAAI4lB,GAAc,CAACtE,OACvB;AAAA,IACH,SAAS;AAAA,mBAELA,EAAS,OACT;AAAA;AAAA,IAGJ,MAAMiE,GAAyB;AAAA,IAC/B,YAAY,CAACjE,CAAQ;AAAA,EACjC,EACK;AAEL;AACO,SAAS6D,GAAqBlE,GAAY;AAC7C,QAAMkF,IAAenB,GAAO/D,GAAY,CAACK,MAAa;AAClD,UAAM5G,IAAU4G,EAAST,EAAO;AAChC,WAAOnG,aAAmB,WAAWA,EAAQ,aAAaA,EAAQ;AAAA,EACtE,CAAC;AAUD,SATe1a,EAAImmB,GAAc,CAAC7E,OACvB;AAAA,IACH,SAAS,mBACLA,EAAS,OACT;AAAA,IACJ,MAAMiE,GAAyB;AAAA,IAC/B,YAAY,CAACjE,CAAQ;AAAA,EACjC,EACK;AAEL;AAEO,SAAS8D,GAAsBnE,GAAY;AAC9C,QAAMmF,IAAQ,CAAA;AACd,MAAIC,IAAoBrmB,EAAIihB,GAAY,CAACqF,MAC9BlD,GAAOnC,GAAY,CAAC7jB,GAAQmpB,OAC3BD,EAAU,QAAQ,WAAWC,EAAU,QAAQ,UAC/C,CAAC/nB,GAAS4nB,GAAOG,CAAS,KAC1BA,EAAU,YAAYhF,GAAM,OAG5B6E,EAAM,KAAKG,CAAS,GACpBnpB,EAAO,KAAKmpB,CAAS,IACdnpB,IAGZ,CAAA,CAAE,CACR;AACD,EAAAipB,IAAoBhpB,GAAQgpB,CAAiB;AAC7C,QAAMG,IAAoBxB,GAAOqB,GAAmB,CAACI,MAC1CA,EAAiB,SAAS,CACpC;AAaD,SAZezmB,EAAIwmB,GAAmB,CAACE,MAAmB;AACtD,UAAMC,IAAiB3mB,EAAI0mB,GAAgB,CAACpF,MACjCA,EAAS,IACnB;AAED,WAAO;AAAA,MACH,SAAS,6BAFS3M,GAAM+R,CAAc,EAAE,OAEW,wDACOC,EAAe,KAAK,IAAI,CAAC;AAAA,MACnF,MAAMpB,GAAyB;AAAA,MAC/B,YAAYmB;AAAA,IACxB;AAAA,EACI,CAAC;AAEL;AACO,SAAS9B,GAAqB3D,GAAY;AAC7C,QAAM2F,IAAe5B,GAAO/D,GAAY,CAACoB,MAAU;AAC/C,QAAI,CAACI,EAAIJ,GAAO,OAAO;AACnB,aAAO;AAEX,UAAMnK,IAAQmK,EAAM;AACpB,WAAOnK,MAAUqJ,GAAM,WAAWrJ,MAAUqJ,GAAM,MAAM,CAACnhB,GAAS8X,CAAK;AAAA,EAC3E,CAAC;AAUD,SATelY,EAAI4mB,GAAc,CAACtF,OACvB;AAAA,IACH,SAAS,mBACLA,EAAS,OACT;AAAA,IACJ,MAAMiE,GAAyB;AAAA,IAC/B,YAAY,CAACjE,CAAQ;AAAA,EACjC,EACK;AAEL;AACO,SAASuD,GAAwB5D,GAAY4F,GAAY;AAC5D,QAAMC,IAAe9B,GAAO/D,GAAY,CAACoB,MAC7BA,EAAM,cAAc,UAAa,CAAC7jB,GAASqoB,GAAYxE,EAAM,SAAS,CACjF;AAUD,SATeriB,EAAI8mB,GAAc,CAAC5N,OAGvB;AAAA,IACH,SAHQ,iBAAiBA,EAAQ,IAAI,8DAA8DA,EAAQ,SAAS;AAAA,IAIpH,MAAMqM,GAAyB;AAAA,IAC/B,YAAY,CAACrM,CAAO;AAAA,EAChC,EACK;AAEL;AACO,SAAS4L,GAAwB7D,GAAY;AAChD,QAAMoD,IAAS,CAAA,GACT0C,IAAc3D,GAAOnC,GAAY,CAAC7jB,GAAQ8b,GAASqK,MAAQ;AAC7D,UAAM7I,IAAUxB,EAAQ;AACxB,WAAIwB,MAAY6G,GAAM,OAKlBnhB,GAASsa,CAAO,IAChBtd,EAAO,KAAK,EAAE,KAAKsd,GAAS,KAAA6I,GAAK,WAAWrK,GAAS,IAEhDnY,GAAS2Z,CAAO,KAAKsM,GAAWtM,CAAO,KAC5Ctd,EAAO,KAAK,EAAE,KAAKsd,EAAQ,QAAQ,KAAA6I,GAAK,WAAWrK,GAAS,IAEzD9b;AAAA,EACX,GAAG,CAAA,CAAE;AACL,SAAAkc,EAAQ2H,GAAY,CAACgG,GAAUC,MAAS;AACpC,IAAA5N,EAAQyN,GAAa,CAAC,EAAE,KAAKI,GAAM,KAAKC,GAAM,WAAWC,QAAe;AACpE,UAAIH,IAAOE,KAAQE,GAAuBH,GAAMF,EAAS,OAAO,GAAG;AAC/D,cAAMzO,IAAM,YAAY6O,EAAS,IAAI;AAAA,4CACYJ,EAAS,IAAI;AAAA;AAG9D,QAAA5C,EAAO,KAAK;AAAA,UACR,SAAS7L;AAAA,UACT,MAAM+M,GAAyB;AAAA,UAC/B,YAAY,CAAC0B,GAAUI,CAAQ;AAAA,QACnD,CAAiB;AAAA,MACL;AAAA,IACJ,CAAC;AAAA,EACL,CAAC,GACMhD;AACX;AACA,SAASiD,GAAuBC,GAAK7M,GAAS;AAC1C,MAAI3Z,GAAS2Z,CAAO,GAAG;AACnB,QAAI8M,GAAsB9M,CAAO;AAK7B,aAAO;AAEX,UAAM+M,IAAc/M,EAAQ,KAAK6M,CAAG;AACpC,WAAOE,MAAgB,QAAQA,EAAY,UAAU;AAAA,EACzD,OACK;AAAA,QAAI5F,GAAWnH,CAAO;AAEvB,aAAOA,EAAQ6M,GAAK,GAAG,CAAA,GAAI,CAAA,CAAE;AAE5B,QAAI9E,EAAI/H,GAAS,MAAM;AAExB,aAAOA,EAAQ,KAAK6M,GAAK,GAAG,CAAA,GAAI,CAAA,CAAE;AAEjC,QAAI,OAAO7M,KAAY;AACxB,aAAOA,MAAY6M;AAGnB,UAAM,MAAM,sBAAsB;AAAA;AAE1C;AACA,SAASP,GAAW3I,GAAQ;AAiBxB,SAAQgC,GAfU;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACR,GAC4B,CAACrR,MAASqP,EAAO,OAAO,QAAQrP,CAAI,MAAM,EAAE,MAAM;AAC9E;AACA,SAASwY,GAAsBnJ,GAAQ;AACnC,SAAO,oCAAoC,KAAKA,EAAO,MAAM;AACjE;AAOO,SAASuD,GAAclH,GAAS;AACnC,QAAMvK,IAAQuK,EAAQ,aAAa,OAAO;AAC1C,SAAO,IAAI,OAAO,GAAGA,EAAQ,MAAM,IAAIvK,CAAK;AAChD;AACO,SAASuX,GAAqBC,GAAiBC,GAAYC,GAA0B;AACxF,QAAMxD,IAAS,CAAA;AAEf,SAAK5B,EAAIkF,GAAiB7G,EAAY,KAClCuD,EAAO,KAAK;AAAA,IACR,SAAS,wDACLvD,KACA;AAAA;AAAA,IACJ,MAAMyE,GAAyB;AAAA,EAC3C,CAAS,GAEA9C,EAAIkF,GAAiB5G,EAAK,KAC3BsD,EAAO,KAAK;AAAA,IACR,SAAS,wDACLtD,KACA;AAAA;AAAA,IACJ,MAAMwE,GAAyB;AAAA,EAC3C,CAAS,GAED9C,EAAIkF,GAAiB5G,EAAK,KAC1B0B,EAAIkF,GAAiB7G,EAAY,KACjC,CAAC2B,EAAIkF,EAAgB,OAAOA,EAAgB,WAAW,KACvDtD,EAAO,KAAK;AAAA,IACR,SAAS,kDAAkDvD,EAAY,MAAM6G,EAAgB,WAAW;AAAA;AAAA,IAExG,MAAMpC,GAAyB;AAAA,EAC3C,CAAS,GAED9C,EAAIkF,GAAiB5G,EAAK,KAC1BzH,EAAQqO,EAAgB,OAAO,CAACG,GAAeC,MAAiB;AAC5D,IAAAzO,EAAQwO,GAAe,CAACpE,GAAasE,MAAY;AAC7C,UAAIzF,GAAYmB,CAAW;AACvB,QAAAW,EAAO,KAAK;AAAA,UACR,SAAS,sEACD0D,CAAY,gBAAgBC,CAAO;AAAA;AAAA,UAC3C,MAAMzC,GAAyB;AAAA,QACvD,CAAqB;AAAA,eAEI9C,EAAIiB,GAAa,YAAY,GAAG;AACrC,cAAMuE,IAAY/pB,GAAQwlB,EAAY,UAAU,IAC1CA,EAAY,aACZ,CAACA,EAAY,UAAU;AAC7B,QAAApK,EAAQ2O,GAAW,CAACC,MAAkB;AAClC,UAAI,CAAC3F,GAAY2F,CAAa,KAC1B,CAAC1pB,GAASspB,GAAeI,CAAa,KACtC7D,EAAO,KAAK;AAAA,YACR,SAAS,8DAA8D6D,EAAc,IAAI,eAAexE,EAAY,IAAI,sBAAsBqE,CAAY;AAAA;AAAA,YAC1J,MAAMxC,GAAyB;AAAA,UAC/D,CAA6B;AAAA,QAET,CAAC;AAAA,MACL;AAAA,IACJ,CAAC;AAAA,EACL,CAAC,GAEElB;AACX;AACO,SAAS8D,GAA4BR,GAAiBC,GAAYC,GAA0B;AAC/F,QAAMO,IAAW,CAAA;AACjB,MAAIC,IAAkB;AACtB,QAAMC,IAAgBjrB,GAAQ8f,GAAQ7e,GAAOqpB,EAAgB,KAAK,CAAC,CAAC,GAC9DY,IAAqB5mB,GAAO2mB,GAAe,CAAChH,MAAaA,EAAST,EAAO,MAAMU,GAAM,EAAE,GACvFiH,IAAsB5F,GAAaiF,CAAwB;AACjE,SAAID,KACAtO,EAAQiP,GAAoB,CAACrP,MAAY;AACrC,UAAMuP,IAAY5F,GAAsB3J,GAASsP,CAAmB;AACpE,QAAIC,MAAc,IAAO;AAErB,YAAMC,IAAoB;AAAA,QACtB,SAFYC,GAA2BzP,GAASuP,CAAS;AAAA,QAGzD,MAAMA,EAAU;AAAA,QAChB,WAAWvP;AAAA,MAC/B;AACgB,MAAAkP,EAAS,KAAKM,CAAiB;AAAA,IACnC;AAGI,MAAIjG,EAAIvJ,GAAS,aAAa,IACtBA,EAAQ,gBAAgB,OACxBmP,IAAkB,MAIlB3H,GAAiB8H,GAAqBtP,EAAQ,OAAO,MACrDmP,IAAkB;AAAA,EAIlC,CAAC,GAEDT,KAAc,CAACS,KACfD,EAAS,KAAK;AAAA,IACV,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,IAKT,MAAM7C,GAAyB;AAAA,EAC3C,CAAS,GAEE6C;AACX;AACO,SAASQ,GAAiB5F,GAAa;AAC1C,QAAM6F,IAAe,CAAA,GACfC,IAAYnsB,GAAKqmB,CAAW;AAClC,SAAA1J,EAAQwP,GAAW,CAACC,MAAY;AAC5B,UAAMC,IAAiBhG,EAAY+F,CAAO;AAE1C,QAAI7qB,GAAQ8qB,CAAc;AACtB,MAAAH,EAAaE,CAAO,IAAI,CAAA;AAAA;AAGxB,YAAM,MAAM,sBAAsB;AAAA,EAE1C,CAAC,GACMF;AACX;AAEO,SAAS3F,GAAgB+F,GAAW;AACvC,QAAMvO,IAAUuO,EAAU;AAE1B,MAAIloB,GAAS2Z,CAAO;AAChB,WAAO;AAEN,MAAImH,GAAWnH,CAAO;AAEvB,WAAO;AAEN,MAAI+H,EAAI/H,GAAS,MAAM;AAExB,WAAO;AAEN,MAAIta,GAASsa,CAAO;AACrB,WAAO;AAGP,QAAM,MAAM,sBAAsB;AAE1C;AACO,SAASyI,GAAezI,GAAS;AACpC,SAAIta,GAASsa,CAAO,KAAKA,EAAQ,WAAW,IACjCA,EAAQ,WAAW,CAAC,IAGpB;AAEf;AAIO,MAAMwO,KAAgC;AAAA;AAAA,EAEzC,MAAM,SAAUC,GAAM;AAClB,UAAMC,IAAMD,EAAK;AACjB,aAAS9jB,IAAI,KAAK,WAAWA,IAAI+jB,GAAK/jB,KAAK;AACvC,YAAMgkB,IAAIF,EAAK,WAAW9jB,CAAC;AAC3B,UAAIgkB,MAAM;AACN,oBAAK,YAAYhkB,IAAI,GACd;AAEN,UAAIgkB,MAAM;AACX,eAAIF,EAAK,WAAW9jB,IAAI,CAAC,MAAM,KAC3B,KAAK,YAAYA,IAAI,IAGrB,KAAK,YAAYA,IAAI,GAElB;AAAA,IAEf;AACA,WAAO;AAAA,EACX;AAAA,EACA,WAAW;AACf;AACA,SAASwd,GAAsB3J,GAASyJ,GAAyB;AAC7D,MAAIF,EAAIvJ,GAAS,aAAa;AAG1B,WAAO;AAIP,MAAInY,GAASmY,EAAQ,OAAO,GAAG;AAC3B,QAAI;AAEA,MAAAwH,GAAiBiC,GAAyBzJ,EAAQ,OAAO;AAAA,IAC7D,SACOxT,GAAG;AAEN,aAAO;AAAA,QACH,OAAO6f,GAAyB;AAAA,QAChC,QAAQ7f,EAAE;AAAA,MAC9B;AAAA,IACY;AACA,WAAO;AAAA,EACX,OACK;AAAA,QAAItF,GAAS8Y,EAAQ,OAAO;AAE7B,aAAO;AAEN,QAAIgK,GAAgBhK,CAAO;AAE5B,aAAO,EAAE,OAAOqM,GAAyB,kBAAiB;AAG1D,UAAM,MAAM,sBAAsB;AAAA;AAG9C;AACO,SAASoD,GAA2BzP,GAASoQ,GAAS;AAEzD,MAAIA,EAAQ,UAAU/D,GAAyB;AAC3C,WAAQ;AAAA,0BACwBrM,EAAQ,IAAI;AAAA,gBACtBoQ,EAAQ,MAAM;AAAA;AAGnC,MAAIA,EAAQ,UAAU/D,GAAyB;AAChD,WAAQ;AAAA,0BACwBrM,EAAQ,IAAI;AAAA;AAI5C,QAAM,MAAM,sBAAsB;AAE1C;AACA,SAAS0J,GAAa2G,GAAc;AAShC,SARkBvpB,EAAIupB,GAAc,CAACC,MAC7BppB,GAASopB,CAAW,IACbA,EAAY,WAAW,CAAC,IAGxBA,CAEd;AAEL;AACA,SAAS3F,GAAiB7jB,GAAKpD,GAAKW,GAAO;AACvC,EAAIyC,EAAIpD,CAAG,MAAM,SACboD,EAAIpD,CAAG,IAAI,CAACW,CAAK,IAGjByC,EAAIpD,CAAG,EAAE,KAAKW,CAAK;AAE3B;AACO,MAAM8hB,KAAqB;AAgBlC,IAAIoK,KAA4B,CAAA;AACzB,SAAShK,GAAyBkE,GAAU;AAC/C,SAAOA,IAAWtE,KACZsE,IACA8F,GAA0B9F,CAAQ;AAC5C;AASA,SAASvC,KAAkC;AACvC,MAAI8C,GAAQuF,EAAyB,GAAG;AACpC,IAAAA,KAA4B,IAAI,MAAM,KAAK;AAC3C,aAASpkB,IAAI,GAAGA,IAAI,OAAOA;AACvB,MAAAokB,GAA0BpkB,CAAC,IAAIA,IAAI,MAAM,MAAM,CAAC,EAAEA,IAAI,OAAOA;AAAA,EAErE;AACJ;ACn2BO,SAASqkB,GAAuBC,GAAaC,GAAgB;AAChE,QAAMC,IAAeF,EAAY;AACjC,SAAIE,MAAiBD,EAAe,eACzB,KAGCA,EAAe,aAAa,MAChCA,EAAe,mBAAmBC,CAAY,MAAM;AAEhE;AAGO,SAASC,GAAmCpc,GAAOwL,GAAS;AAC/D,SAAOxL,EAAM,iBAAiBwL,EAAQ;AAC1C;AACO,IAAI6Q,KAAoB;AACxB,MAAMC,KAAkB,CAAA;AACxB,SAASC,GAAkBhJ,GAAY;AAE1C,QAAMiJ,IAAuBC,GAAiBlJ,CAAU;AAExD,EAAAmJ,GAAwBF,CAAoB,GAE5CG,GAAwBH,CAAoB,GAC5CI,GAA2BJ,CAAoB,GAC/C5Q,EAAQ4Q,GAAsB,CAAChR,MAAY;AACvC,IAAAA,EAAQ,WAAWA,EAAQ,gBAAgB,SAAS;AAAA,EACxD,CAAC;AACL;AACO,SAASiR,GAAiBlJ,GAAY;AACzC,MAAI7jB,IAASmtB,GAAMtJ,CAAU,GACzBuJ,IAAavJ,GACbwJ,IAAY;AAChB,SAAOA,KAAW;AACd,IAAAD,IAAantB,GAAQ8f,GAAQnd,EAAIwqB,GAAY,CAAC9G,MAAgBA,EAAY,UAAU,CAAC,CAAC;AACtF,UAAMgH,IAAgBzrB,GAAWurB,GAAYptB,CAAM;AACnD,IAAAA,IAASA,EAAO,OAAOstB,CAAa,GAChCxG,GAAQwG,CAAa,IACrBD,IAAY,KAGZD,IAAaE;AAAA,EAErB;AACA,SAAOttB;AACX;AACO,SAASgtB,GAAwBnJ,GAAY;AAChD,EAAA3H,EAAQ2H,GAAY,CAACyC,MAAgB;AACjC,IAAKiH,GAAoBjH,CAAW,MAChCsG,GAAgBD,EAAiB,IAAIrG,GACrCA,EAAY,eAAeqG,OAG3Ba,GAAsBlH,CAAW,KACjC,CAACxlB,GAAQwlB,EAAY,UAAU,MAI/BA,EAAY,aAAa,CAACA,EAAY,UAAU,IAE/CkH,GAAsBlH,CAAW,MAClCA,EAAY,aAAa,CAAA,IAExBmH,GAAgCnH,CAAW,MAC5CA,EAAY,kBAAkB,CAAA,IAE7BoH,GAAmCpH,CAAW,MAC/CA,EAAY,qBAAqB,CAAA;AAAA,EAEzC,CAAC;AACL;AACO,SAAS4G,GAA2BrJ,GAAY;AACnD,EAAA3H,EAAQ2H,GAAY,CAACyC,MAAgB;AAEjC,IAAAA,EAAY,kBAAkB,CAAA,GAC9BpK,EAAQoK,EAAY,oBAAoB,CAAC/K,GAAK/b,MAAQ;AAClD,MAAA8mB,EAAY,gBAAgB,KAAKsG,GAAgBptB,CAAG,EAAE,YAAY;AAAA,IACtE,CAAC;AAAA,EACL,CAAC;AACL;AACO,SAASytB,GAAwBpJ,GAAY;AAChD,EAAA3H,EAAQ2H,GAAY,CAACyC,MAAgB;AACjC,IAAAqH,GAA8B,CAAA,GAAIrH,CAAW;AAAA,EACjD,CAAC;AACL;AACO,SAASqH,GAA8BrpB,GAAMspB,GAAU;AAC1D,EAAA1R,EAAQ5X,GAAM,CAACupB,MAAa;AACxB,IAAAD,EAAS,mBAAmBC,EAAS,YAAY,IAAI;AAAA,EACzD,CAAC,GACD3R,EAAQ0R,EAAS,YAAY,CAACE,MAAiB;AAC3C,UAAMC,IAAUzpB,EAAK,OAAOspB,CAAQ;AAEpC,IAAKxsB,GAAS2sB,GAASD,CAAY,KAC/BH,GAA8BI,GAASD,CAAY;AAAA,EAE3D,CAAC;AACL;AACO,SAASP,GAAoBzR,GAAS;AACzC,SAAOuJ,EAAIvJ,GAAS,cAAc;AACtC;AACO,SAAS0R,GAAsB1R,GAAS;AAC3C,SAAOuJ,EAAIvJ,GAAS,YAAY;AACpC;AACO,SAAS2R,GAAgC3R,GAAS;AACrD,SAAOuJ,EAAIvJ,GAAS,iBAAiB;AACzC;AACO,SAAS4R,GAAmC5R,GAAS;AACxD,SAAOuJ,EAAIvJ,GAAS,oBAAoB;AAC5C;AACO,SAASkS,GAAYlS,GAAS;AACjC,SAAOuJ,EAAIvJ,GAAS,cAAc;AACtC;AChHO,MAAMmS,KAA4B;AAAA,EACrC,iCAAiC3d,GAAO;AACpC,WAAO,uDAAuDA,EAAM,KAAK;AAAA,EAC7E;AAAA,EACA,iCAAiC4d,GAAUC,GAAapuB,GAAQquB,GAAMC,GAAQC,GAAM;AAChF,WAAQ,2BAA2BJ,EAAS,OAAOC,CAAW,CAAC,iBAAiBA,CAAW,aAAkBpuB,CAAM;AAAA,EACvH;AACJ;ACDO,IAAIooB;AAAA,CACV,SAAUA,GAA0B;AACjC,EAAAA,EAAyBA,EAAyB,kBAAqB,CAAC,IAAI,mBAC5EA,EAAyBA,EAAyB,kBAAqB,CAAC,IAAI,mBAC5EA,EAAyBA,EAAyB,mBAAsB,CAAC,IAAI,oBAC7EA,EAAyBA,EAAyB,0BAA6B,CAAC,IAAI,2BACpFA,EAAyBA,EAAyB,2BAA8B,CAAC,IAAI,4BACrFA,EAAyBA,EAAyB,2BAA8B,CAAC,IAAI,4BACrFA,EAAyBA,EAAyB,2BAA8B,CAAC,IAAI,4BACrFA,EAAyBA,EAAyB,wCAA2C,CAAC,IAAI,yCAClGA,EAAyBA,EAAyB,0CAA6C,CAAC,IAAI,2CACpGA,EAAyBA,EAAyB,qDAAwD,CAAC,IAAI,sDAC/GA,EAAyBA,EAAyB,4CAA+C,EAAE,IAAI,6CACvGA,EAAyBA,EAAyB,mBAAsB,EAAE,IAAI,oBAC9EA,EAAyBA,EAAyB,sBAAyB,EAAE,IAAI,uBACjFA,EAAyBA,EAAyB,uBAA0B,EAAE,IAAI,wBAClFA,EAAyBA,EAAyB,sBAAyB,EAAE,IAAI,uBACjFA,EAAyBA,EAAyB,sBAAyB,EAAE,IAAI,uBACjFA,EAAyBA,EAAyB,oBAAuB,EAAE,IAAI,qBAC/EA,EAAyBA,EAAyB,kDAAqD,EAAE,IAAI;AACjH,GAAGA,OAA6BA,KAA2B,CAAA,EAAG;AAC9D,MAAMoG,KAAuB;AAAA,EACzB,+BAA+B;AAAA,EAC/B,kBAAkB;AAAA,EAClB,wBAAwB;AAAA,EACxB,0BAA0B,CAAC;AAAA,GAAM,IAAI;AAAA,EACrC,qBAAqB;AAAA,EACrB,UAAU;AAAA,EACV,sBAAsBN;AAAA,EACtB,eAAe;AAAA,EACf,iBAAiB;AAAA,EACjB,iBAAiB;AACrB;AACA,OAAO,OAAOM,EAAoB;AAC3B,MAAMpK,GAAM;AAAA,EACf,YAAYoG,GAAiBiE,IAASD,IAAsB;AAoCxD,QAnCA,KAAK,kBAAkBhE,GACvB,KAAK,wBAAwB,CAAA,GAC7B,KAAK,yBAAyB,CAAA,GAC9B,KAAK,qBAAqB,CAAA,GAC1B,KAAK,+BAA+B,CAAA,GACpC,KAAK,QAAQ,CAAA,GACb,KAAK,cAAc,CAAA,GACnB,KAAK,kBAAkB,IACvB,KAAK,gBAAgB,IACrB,KAAK,YAAY,IACjB,KAAK,qBAAqB,CAAA,GAG1B,KAAK,aAAa,CAACkE,GAAWC,MAAc;AAGxC,UAAI,KAAK,kBAAkB,IAAM;AAC7B,aAAK;AACL,cAAMC,IAAS,IAAI,MAAM,KAAK,kBAAkB,CAAC,EAAE,KAAK,GAAI;AAC5D,QAAI,KAAK,kBAAkB,KAAK,qBAC5B,QAAQ,IAAI,GAAGA,CAAM,QAAQF,CAAS,GAAG;AAE7C,cAAM,EAAE,MAAAG,GAAM,OAAAzuB,MAAUmb,GAAMoT,CAAS,GAEjCG,IAAcD,IAAO,KAAK,QAAQ,OAAO,QAAQ;AACvD,eAAI,KAAK,kBAAkB,KAAK,qBAC5BC,EAAY,GAAGF,CAAM,QAAQF,CAAS,WAAWG,CAAI,IAAI,GAE7D,KAAK,mBACEzuB;AAAA,MACX;AAEI,eAAOuuB,EAAS;AAAA,IAExB,GACI,OAAOF,KAAW;AAClB,YAAM,MAAM;AAAA,8CACuC;AAEvD,SAAK,SAASxvB,GAAO,CAAA,GAAIuvB,IAAsBC,CAAM;AACrD,UAAMM,IAAe,KAAK,OAAO;AACjC,IAAIA,MAAiB,MACjB,KAAK,oBAAoB,OACzB,KAAK,gBAAgB,MAEhB,OAAOA,KAAiB,aAC7B,KAAK,oBAAoBA,GACzB,KAAK,gBAAgB,KAEzB,KAAK,kBAAkB,IACvB,KAAK,WAAW,qBAAqB,MAAM;AACvC,UAAIC,GACAC,IAAoB;AACxB,WAAK,WAAW,yBAAyB,MAAM;AAC3C,YAAI,KAAK,OAAO,2BACZT,GAAqB;AAErB,eAAK,OAAO,yBAAyBzC;AAAA,iBAGjC,KAAK,OAAO,6BACZyC,GAAqB;AACrB,gBAAM,MAAM;AAAA,uGACiG;AAGrH,YAAIC,EAAO,YAAYA,EAAO;AAC1B,gBAAM,MAAM,oEAAoE;AAEpF,aAAK,kBAAkB,kBAAkB,KAAK,KAAK,OAAO,gBAAgB,GAC1E,KAAK,gBAAgB,QAAQ,KAAK,KAAK,OAAO,gBAAgB,GAE1D1tB,GAAQypB,CAAe,IACvBwE,IAAmB;AAAA,UACf,OAAO,EAAE,aAAa5B,GAAM5C,CAAe,EAAC;AAAA,UAC5C,aAAa7G;AAAA,QACrC,KAIoBsL,IAAoB,IACpBD,IAAmB5B,GAAM5C,CAAe;AAAA,MAEhD,CAAC,GACG,KAAK,OAAO,oBAAoB,OAChC,KAAK,WAAW,wBAAwB,MAAM;AAC1C,aAAK,wBAAwB,KAAK,sBAAsB,OAAOD,GAAqByE,GAAkB,KAAK,iBAAiB,KAAK,OAAO,wBAAwB,CAAC;AAAA,MACrK,CAAC,GACD,KAAK,WAAW,+BAA+B,MAAM;AACjD,aAAK,yBAAyB,KAAK,uBAAuB,OAAOhE,GAA4BgE,GAAkB,KAAK,iBAAiB,KAAK,OAAO,wBAAwB,CAAC;AAAA,MAC9K,CAAC,IAGLA,EAAiB,QAAQA,EAAiB,QACpCA,EAAiB,QACjB,CAAA,GAGN7S,EAAQ6S,EAAiB,OAAO,CAACrE,GAAeC,MAAiB;AAC7D,QAAAoE,EAAiB,MAAMpE,CAAY,IAAIpmB,GAAOmmB,GAAe,CAACpE,MAAgBnB,GAAYmB,CAAW,CAAC;AAAA,MAC1G,CAAC;AACD,YAAM2I,IAAe1vB,GAAKwvB,EAAiB,KAAK;AAoChD,UAnCA7S,EAAQ6S,EAAiB,OAAO,CAACG,GAAYC,MAAgB;AACzD,aAAK,WAAW,UAAUA,CAAW,gBAAgB,MAAM;AAUvD,cATA,KAAK,MAAM,KAAKA,CAAW,GACvB,KAAK,OAAO,oBAAoB,MAChC,KAAK,WAAW,oBAAoB,MAAM;AACtC,iBAAK,wBAAwB,KAAK,sBAAsB,OAAOpI,GAAiBmI,GAAYD,CAAY,CAAC;AAAA,UAC7G,CAAC,GAKDnI,GAAQ,KAAK,qBAAqB,GAAG;AACrC,YAAA+F,GAAkBqC,CAAU;AAC5B,gBAAIE;AACJ,iBAAK,WAAW,qBAAqB,MAAM;AACvC,cAAAA,IAAoBxL,GAAkBsL,GAAY;AAAA,gBAC9C,0BAA0B,KAAK,OAAO;AAAA,gBACtC,kBAAkBV,EAAO;AAAA,gBACzB,qBAAqBA,EAAO;AAAA,gBAC5B,UAAUA,EAAO;AAAA,gBACjB,QAAQ,KAAK;AAAA,cAC7C,CAA6B;AAAA,YACL,CAAC,GACD,KAAK,mBAAmBW,CAAW,IAC/BC,EAAkB,oBACtB,KAAK,6BAA6BD,CAAW,IACzCC,EAAkB,8BACtB,KAAK,cAAcpwB,GAAO,CAAA,GAAI,KAAK,aAAaowB,EAAkB,WAAW,GAC7E,KAAK,YAAYA,EAAkB,aAAa,KAAK,WACrD,KAAK,mBAAmBD,CAAW,IAC/BC,EAAkB;AAAA,UAC1B;AAAA,QACJ,CAAC;AAAA,MACL,CAAC,GACD,KAAK,cAAcL,EAAiB,aAChC,CAACjI,GAAQ,KAAK,qBAAqB,KACnC,CAAC,KAAK,OAAO,+BAA+B;AAI5C,cAAMuI,IAHiBzsB,EAAI,KAAK,uBAAuB,CAAC0sB,MAC7CA,EAAM,OAChB,EAC2C,KAAK;AAAA,CAA2B;AAC5E,cAAM,IAAI,MAAM;AAAA,IAA8CD,CAAoB;AAAA,MACtF;AAEA,MAAAnT,EAAQ,KAAK,wBAAwB,CAACoP,MAAsB;AACxD,QAAAjQ,GAAciQ,EAAkB,OAAO;AAAA,MAC3C,CAAC,GACD,KAAK,WAAW,wCAAwC,MAAM;AAa1D,YATI0D,MACA,KAAK,cAAcO,KAEnB,KAAK,oBAAoB,OACzB,KAAK,mBAAmBC,KAExB,KAAK,kBAAkB,OACvB,KAAK,mCAAmCD,KAExC,QAAQ,KAAK,KAAK,OAAO,gBAAgB;AACzC,eAAK,sBAAsB,KAAK;AAAA,iBAE3B,aAAa,KAAK,KAAK,OAAO,gBAAgB;AACnD,eAAK,sBAAsB,KAAK;AAAA,iBAE3B,cAAc,KAAK,KAAK,OAAO,gBAAgB;AACpD,eAAK,sBAAsB,KAAK;AAAA;AAGhC,gBAAM,MAAM,8CAA8C,KAAK,OAAO,gBAAgB,GAAG;AAE7F,QAAI,KAAK,aACL,KAAK,WAAW,KAAK,mBACrB,KAAK,gBAAgB,KAAK,4BAG1B,KAAK,WAAW,KAAK,2BACrB,KAAK,gBAAgB,KAAK;AAAA,MAElC,CAAC,GACD,KAAK,WAAW,gCAAgC,MAAM;AAClD,cAAME,IAAmBzJ,GAAO,KAAK,oBAAoB,CAAC0J,GAAmBtJ,GAAgBuJ,OACrFvJ,MAAmB,MACnBsJ,EAAkB,KAAKC,CAAQ,GAE5BD,IACR,CAAA,CAAE;AACL,YAAIlB,EAAO,uBAAuB,CAAC1H,GAAQ2I,CAAgB;AACvD,gBAAM,MAAM,kBAAkBA,EAAiB,KAAK,IAAI,CAAC;AAAA;AAAA,yEAEsB;AAAA,MAEvF,CAAC,GACD,KAAK,WAAW,0BAA0B,MAAM;AAC5C,QAAArO,GAAsB;AAAA,MAC1B,CAAC,GACD,KAAK,WAAW,oBAAoB,MAAM;AACtC,QAAA5F,GAAiB,IAAI;AAAA,MACzB,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,SAASuQ,GAAM6D,IAAc,KAAK,aAAa;AAC3C,QAAI,CAAC9I,GAAQ,KAAK,qBAAqB,GAAG;AAItC,YAAMuI,IAHiBzsB,EAAI,KAAK,uBAAuB,CAAC0sB,MAC7CA,EAAM,OAChB,EAC2C,KAAK;AAAA,CAA2B;AAC5E,YAAM,IAAI,MAAM;AAAA,IACZD,CAAoB;AAAA,IAC5B;AACA,WAAO,KAAK,iBAAiBtD,GAAM6D,CAAW;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB7D,GAAM6D,GAAa;AAChC,QAAI3nB,GAAG4nB,GAAGC,GAAGC,GAAelF,GAAWmF,GAAcC,GAASC,GAAYC,GAAarV,GAAOgB,GAASsU,GAAUC,GAAWjV,GAAK9F;AACjI,UAAMgb,IAAUvE,GACVwE,IAAYD,EAAQ;AAC1B,QAAI9f,IAAS,GACTggB,IAAqB;AAKzB,UAAMC,IAAwB,KAAK,YAC7B,IACA,KAAK,MAAM1E,EAAK,SAAS,EAAE,GAC3B2E,IAAgB,IAAI,MAAMD,CAAqB,GAC/CxJ,KAAS,CAAA;AACf,QAAImH,KAAO,KAAK,kBAAkB,IAAI,QAClCC,KAAS,KAAK,kBAAkB,IAAI;AACxC,UAAMsC,IAASnF,GAAiB,KAAK,WAAW,GAC1ChB,IAAa,KAAK,iBAClBoG,IAAwB,KAAK,OAAO;AAC1C,QAAIC,IAAyB,GACzBhL,IAAqB,CAAA,GACrBiL,IAAmC,CAAA;AACvC,UAAMC,IAAY,CAAA,GACZC,IAAa,CAAA;AACnB,WAAO,OAAOA,CAAU;AACxB,QAAIC,IAAkB;AACtB,UAAMC,IAAW,CAACC,MAAa;AAE3B,UAAIJ,EAAU,WAAW;AAAA;AAAA,MAGrBI,EAAS,UAAU,cAAc,QAAW;AAG5C,cAAM/V,KAAM,KAAK,OAAO,qBAAqB,iCAAiC+V,CAAQ;AACtF,QAAAlK,GAAO,KAAK;AAAA,UACR,QAAQkK,EAAS;AAAA,UACjB,MAAMA,EAAS;AAAA,UACf,QAAQA,EAAS;AAAA,UACjB,QAAQA,EAAS,MAAM;AAAA,UACvB,SAAS/V;AAAA,QAC7B,CAAiB;AAAA,MACL,OACK;AACD,QAAA2V,EAAU,IAAG;AACb,cAAMK,KAAUC,GAAKN,CAAS;AAC9B,QAAAlL,IAAqB,KAAK,mBAAmBuL,EAAO,GACpDN,IACI,KAAK,6BAA6BM,EAAO,GAC7CP,IAAyBhL,EAAmB;AAC5C,cAAMyL,KAAqB,KAAK,mBAAmBF,EAAO,KAAK,KAAK,OAAO,aAAa;AACxF,QAAIN,KAAoCQ,KACpCL,IAAkB,KAGlBA,IAAkB;AAAA,MAE1B;AAAA,IACJ;AACA,aAASM,EAAUH,GAAS;AACxB,MAAAL,EAAU,KAAKK,CAAO,GACtBN,IACI,KAAK,6BAA6BM,CAAO,GAC7CvL,IAAqB,KAAK,mBAAmBuL,CAAO,GACpDP,IAAyBhL,EAAmB,QAC5CgL,IAAyBhL,EAAmB;AAC5C,YAAMyL,KAAqB,KAAK,mBAAmBF,CAAO,KAAK,KAAK,OAAO,aAAa;AACxF,MAAIN,KAAoCQ,KACpCL,IAAkB,KAGlBA,IAAkB;AAAA,IAE1B;AAGA,IAAAM,EAAU,KAAK,MAAM3B,CAAW;AAChC,QAAI4B;AACJ,UAAMC,KAAkB,KAAK,OAAO;AACpC,WAAOjhB,IAAS+f,KAAW;AACvB,MAAAP,IAAe,MACfG,IAAc;AACd,YAAMuB,IAAepB,EAAQ,WAAW9f,CAAM;AAC9C,UAAImhB;AACJ,UAAIV,GAAiB;AACjB,cAAMvO,KAAmBL,GAAyBqP,CAAY,GACxDE,KAAmBd,EAAiCpO,EAAgB;AAC1E,QAAAiP,KACIC,OAAqB,SAAYA,KAAmBZ;AAAA,MAC5D;AAEI,QAAAW,KAA2B9L;AAE/B,YAAMgM,KAAuBF,GAAyB;AACtD,WAAK1pB,IAAI,GAAGA,IAAI4pB,IAAsB5pB,KAAK;AACvC,QAAAupB,IAAaG,GAAyB1pB,CAAC;AACvC,cAAMqc,KAAckN,EAAW;AAC/B,QAAAvB,IAAU;AAEV,cAAM6B,KAAiBN,EAAW;AA0BlC,YAzBIM,OAAmB,KACfJ,MAAiBI,OAEjB3B,IAAc,GACdH,IAAe1L,MAGdkN,EAAW,aAAa,MAC7Blc,IAAQgP,GAAY,KAAKgM,GAAS9f,GAAQkgB,GAAeC,CAAM,GAC3Drb,MAAU,QACV0a,IAAe1a,EAAM,CAAC,GACtB6a,IAAcH,EAAa,QACvB1a,EAAM,YAAY,WAClB2a,IAAU3a,EAAM,YAIpB0a,IAAe,SAInB1L,GAAY,YAAY9T,GACxB2f,IAAc,KAAK,YAAY7L,IAAayH,GAAMvb,CAAM,IAGxD2f,MAAgB,IAAI;AAIpB,cADAtF,IAAY2G,EAAW,WACnB3G,MAAc,QAAW;AACzB,YAAAmF,IAAejE,EAAK,UAAUvb,GAAQA,IAAS2f,CAAW;AAC1D,kBAAM4B,KAAkBlH,EAAU;AAClC,iBAAKiF,IAAI,GAAGA,IAAIiC,IAAiBjC,KAAK;AAClC,oBAAMkC,KAAkBnM,EAAmBgF,EAAUiF,CAAC,CAAC,GACjDmC,KAAmBD,GAAgB;AAoBzC,kBAnBA9B,IAAa,MAGT8B,GAAgB,aAAa,MAC7B1c,IAAQ2c,GAAiB,KAAK3B,GAAS9f,GAAQkgB,GAAeC,CAAM,GAChErb,MAAU,QACVya,IAAgBza,EAAM,CAAC,GACnBA,EAAM,YAAY,WAClB4a,IAAa5a,EAAM,YAIvBya,IAAgB,SAIpBkC,GAAiB,YAAYzhB,GAC7Buf,IAAgB,KAAK,MAAMkC,IAAkBlG,GAAMvb,CAAM,IAEzDuf,KAAiBA,EAAc,SAASC,EAAa,QAAQ;AAC7D,gBAAAA,IAAeD,GACfI,IAAcJ,EAAc,QAC5BE,IAAUC,GACVsB,IAAaQ;AAGb;AAAA,cACJ;AAAA,YACJ;AAAA,UACJ;AACA;AAAA,QACJ;AAAA,MACJ;AAEA,UAAI7B,MAAgB,IAAI;AAkBpB,YAjBArV,IAAQ0W,EAAW,OACf1W,MAAU,WACVkV,IACIA,MAAiB,OACXA,IACAjE,EAAK,UAAUvb,GAAQA,IAAS2f,CAAW,GACrDrU,IAAU0V,EAAW,cACrBpB,IAAW,KAAK,oBAAoBJ,GAAcxf,GAAQsL,GAAS0V,EAAW,WAAWpD,IAAMC,IAAQ8B,CAAW,GAClH,KAAK,cAAcC,GAAUH,CAAO,GAChCnV,MAAU,KACV0V,IAAqB,KAAK,SAASE,GAAeF,GAAoBJ,CAAQ,IAG9EO,EAAO7V,CAAK,EAAE,KAAKsV,CAAQ,IAI/B5F,MAAe,MAAQgH,EAAW,sBAAsB,IAAM;AAC9D,cAAIU,KAAkB,GAClBC,IACAC;AACJ,UAAAxB,EAAsB,YAAY;AAClC;AAEI,YAAAZ,IACIA,MAAiB,OACXA,IACAjE,EAAK,UAAUvb,GAAQA,IAAS2f,CAAW,GACrDgC,KAAkBvB,EAAsB,KAAKZ,CAAY,GACrDmC,OAAoB,OACpBC,KAAkBxB,EAAsB,YAAY,GACpDsB;AAAA,iBAECC,OAAoB;AAC7B,UAAID,OAAoB,KACpB9D,KAAOA,KAAO8D,IACd7D,KAAS8B,IAAciC,IACvB,KAAK,iCAAiChC,GAAUtV,GAAOsX,IAAiBF,IAAiB9D,IAAMC,IAAQ8B,CAAW,KAGlH9B,KAAS,KAAK,iBAAiBA,IAAQ8B,CAAW;AAAA,QAE1D;AAEI,UAAA9B,KAAS,KAAK,iBAAiBA,IAAQ8B,CAAW;AAEtD,QAAA3f,IAASA,IAAS2f,GAElB,KAAK,YAAYqB,GAAYN,GAAUK,GAAWnB,CAAQ;AAAA,MAC9D,OACK;AAED,cAAMiC,KAAmB7hB,GACnB8hB,KAAYlE,IACZmE,KAAclE;AACpB,YAAImE,KAAmBf,OAAoB;AAC3C,eAAOe,OAAqB,MAAShiB,IAAS+f;AAE1C,eADA/f,KACKqf,IAAI,GAAGA,IAAIgB,GAAwBhB,KAAK;AACzC,kBAAM2B,KAAa3L,EAAmBgK,CAAC,GACjCvL,IAAckN,GAAW,SAEzBM,KAAiBN,GAAW;AAelC,gBAdIM,OAAmB,KACfxB,EAAQ,WAAW9f,CAAM,MAAMshB,OAE/BU,KAAmB,MAGlBhB,GAAW,aAAa,KAC7BgB,KACIlO,EAAY,KAAKgM,GAAS9f,GAAQkgB,GAAeC,CAAM,MAAM,QAGjErM,EAAY,YAAY9T,GACxBgiB,KAAmBlO,EAAY,KAAKyH,CAAI,MAAM,OAE9CyG,OAAqB;AACrB;AAAA,UAER;AAaJ,YAXAnC,IAAY7f,IAAS6hB,IACrBhE,KAAS,KAAK,iBAAiBA,IAAQgC,CAAS,GAEhDjV,IAAM,KAAK,OAAO,qBAAqB,iCAAiCkV,GAAS+B,IAAkBhC,GAAWiC,IAAWC,IAAalB,GAAKN,CAAS,CAAC,GACrJ9J,GAAO,KAAK;AAAA,UACR,QAAQoL;AAAA,UACR,MAAMC;AAAA,UACN,QAAQC;AAAA,UACR,QAAQlC;AAAA,UACR,SAASjV;AAAA,QAC7B,CAAiB,GACGqW,OAAoB;AACpB;AAAA,MAER;AAAA,IACJ;AAGA,WAAK,KAAK,cAENf,EAAc,SAASF,IAEpB;AAAA,MACH,QAAQE;AAAA,MACR,QAAQC;AAAA,MACR,QAAQ1J;AAAA,IACpB;AAAA,EACI;AAAA,EACA,YAAYuH,GAAQ0C,GAAUK,GAAWnB,GAAU;AAC/C,QAAI5B,EAAO,QAAQ,IAAM;AAGrB,YAAMiE,IAAWjE,EAAO;AACxB,MAAA0C,EAASd,CAAQ,GACbqC,MAAa,UACblB,EAAU,KAAK,MAAMkB,CAAQ;AAAA,IAErC,MACK,CAAIjE,EAAO,SAAS,UACrB+C,EAAU,KAAK,MAAM/C,EAAO,IAAI;AAAA,EAExC;AAAA;AAAA,EAEA,iCAAiC4B,GAAUtV,GAAO4X,GAAWR,GAAiB9D,GAAMC,GAAQ8B,GAAa;AACrG,QAAIwC,GAAcC;AAClB,IAAI9X,MAAU,WAEV6X,IAAeD,MAAcvC,IAAc,GAC3CyC,IAAmBD,IAAe,KAAK,GACjCT,MAAoB,KAAKS,MAAiB,OAE5CvC,EAAS,UAAUhC,IAAOwE,GAG1BxC,EAAS,YAAY/B,IAAS,IAAI,CAACuE;AAAA,EAI/C;AAAA,EACA,iBAAiBC,GAAW1C,GAAa;AACrC,WAAO0C,IAAY1C;AAAA,EACvB;AAAA,EACA,sBAAsB2C,GAAO3E,GAAa4E,GAAclH,GAAW;AAC/D,WAAO;AAAA,MACH,OAAAiH;AAAA,MACA,aAAA3E;AAAA,MACA,cAAA4E;AAAA,MACA,WAAAlH;AAAA,IACZ;AAAA,EACI;AAAA,EACA,qBAAqBiH,GAAO3E,GAAa4E,GAAclH,GAAWmH,GAAWC,GAAa;AACtF,WAAO;AAAA,MACH,OAAAH;AAAA,MACA,aAAA3E;AAAA,MACA,WAAA6E;AAAA,MACA,aAAAC;AAAA,MACA,cAAAF;AAAA,MACA,WAAAlH;AAAA,IACZ;AAAA,EACI;AAAA,EACA,gBAAgBiH,GAAO3E,GAAa4E,GAAclH,GAAWmH,GAAWC,GAAa9C,GAAa;AAC9F,WAAO;AAAA,MACH,OAAA2C;AAAA,MACA,aAAA3E;AAAA,MACA,WAAWA,IAAcgC,IAAc;AAAA,MACvC,WAAA6C;AAAA,MACA,SAASA;AAAA,MACT,aAAAC;AAAA,MACA,WAAWA,IAAc9C,IAAc;AAAA,MACvC,cAAA4C;AAAA,MACA,WAAAlH;AAAA,IACZ;AAAA,EACI;AAAA,EACA,kBAAkBqH,GAAapzB,GAAOqzB,GAAY;AAC9C,WAAAD,EAAY,KAAKC,CAAU,GACpBrzB;AAAA,EACX;AAAA,EACA,0BAA0BozB,GAAapzB,GAAOqzB,GAAY;AACtD,WAAAD,EAAYpzB,CAAK,IAAIqzB,GACrBrzB,KACOA;AAAA,EACX;AAAA,EACA,sBAAsBwQ,GAAO2f,GAAS;AAAA,EAAE;AAAA,EACxC,wBAAwB3f,GAAO2f,GAAS;AACpC,IAAIA,MAAY,SACZ3f,EAAM,UAAU2f;AAAA,EAExB;AAAA,EACA,MAAM3S,GAASyO,GAAMvb,GAAQ;AAEzB,WADc8M,EAAQ,KAAKyO,CAAI,MACjB,KACHA,EAAK,UAAUvb,GAAQ8M,EAAQ,SAAS,IAE5C;AAAA,EACX;AAAA,EACA,YAAYA,GAASyO,GAAMvb,GAAQ;AAE/B,WADc8M,EAAQ,KAAKyO,CAAI,MACjB,KACHzO,EAAQ,YAAY9M,IAExB;AAAA,EACX;AACJ;AACA2T,GAAM,UAAU;AAEhBA,GAAM,KAAK;AC5nBJ,SAAStI,GAAWC,GAAS;AAChC,SAAIC,GAAcD,CAAO,IACdA,EAAQ,QAGRA,EAAQ;AAEvB;AAIO,SAASC,GAAc9W,GAAK;AAC/B,SAAOjC,GAASiC,EAAI,KAAK,KAAKA,EAAI,UAAU;AAChD;AACA,MAAMmuB,KAAS,UACTC,KAAa,cACbC,KAAQ,SACRC,KAAQ,SACRC,KAAY,aACZC,KAAW,YACXC,KAAa,cACbC,KAAc,eACdC,KAAmB;AAClB,SAASC,GAAYrF,GAAQ;AAChC,SAAOsF,GAAoBtF,CAAM;AACrC;AACA,SAASsF,GAAoBtF,GAAQ;AACjC,QAAMlR,IAAUkR,EAAO,SACjB3C,IAAY,CAAA;AAKlB,MAJAA,EAAU,OAAO2C,EAAO,MACnBrJ,GAAY7H,CAAO,MACpBuO,EAAU,UAAUvO,IAEpB+H,EAAImJ,GAAQ4E,EAAM;AAClB,UAAO;AAAA;AAGX,SAAI/N,EAAImJ,GAAQ6E,EAAU,MAEtBxH,EAAU,aAAa2C,EAAO6E,EAAU,IAE5CxG,GAAkB,CAAChB,CAAS,CAAC,GACzBxG,EAAImJ,GAAQ8E,EAAK,MACjBzH,EAAU,QAAQ2C,EAAO8E,EAAK,IAE9BjO,EAAImJ,GAAQ+E,EAAK,MACjB1H,EAAU,QAAQ2C,EAAO+E,EAAK,IAE9BlO,EAAImJ,GAAQiF,EAAQ,MACpB5H,EAAU,WAAW2C,EAAOiF,EAAQ,IAEpCpO,EAAImJ,GAAQgF,EAAS,MACrB3H,EAAU,YAAY2C,EAAOgF,EAAS,IAEtCnO,EAAImJ,GAAQkF,EAAU,MACtB7H,EAAU,aAAa2C,EAAOkF,EAAU,IAExCrO,EAAImJ,GAAQmF,EAAW,MACvB9H,EAAU,cAAc2C,EAAOmF,EAAW,IAE1CtO,EAAImJ,GAAQoF,EAAgB,MAC5B/H,EAAU,mBAAmB2C,EAAOoF,EAAgB,IAEjD/H;AACX;AACO,MAAMkI,KAAMF,GAAY,EAAE,MAAM,OAAO,SAAS1P,GAAM,IAAI;AACjE0I,GAAkB,CAACkH,EAAG,CAAC;AAChB,SAASC,GAAoBlY,GAASgX,GAAO3E,GAAa8F,GAAWjB,GAAWkB,GAASjB,GAAakB,GAAW;AACpH,SAAO;AAAA,IACH,OAAArB;AAAA,IACA,aAAA3E;AAAA,IACA,WAAA8F;AAAA,IACA,WAAAjB;AAAA,IACA,SAAAkB;AAAA,IACA,aAAAjB;AAAA,IACA,WAAAkB;AAAA,IACA,cAAcrY,EAAQ;AAAA,IACtB,WAAWA;AAAA,EACnB;AACA;AACO,SAASsY,GAAa9jB,GAAOwL,GAAS;AACzC,SAAOwQ,GAAuBhc,GAAOwL,CAAO;AAChD;AClFO,MAAMuY,KAA6B;AAAA,EACtC,0BAA0B,EAAE,UAAAC,GAAU,QAAAC,GAAQ,UAAArjB,GAAU,UAAAsjB,EAAQ,GAAI;AAMhE,WADY,aAJKzY,GAAcuY,CAAQ,IAEjC,OAAOzY,GAAWyY,CAAQ,CAAC,SAC3B,qBAAqBA,EAAS,IAAI,MACJ,mBAAmBC,EAAO,KAAK;AAAA,EAEvE;AAAA,EACA,8BAA8B,EAAE,gBAAAE,GAAgB,UAAAD,KAAY;AACxD,WAAO,+CAA+CC,EAAe;AAAA,EACzE;AAAA,EACA,wBAAwB,EAAE,qBAAAC,GAAqB,QAAAH,GAAQ,UAAArjB,GAAU,uBAAAyjB,GAAuB,UAAAH,KAAa;AACjG,UAAMI,IAAY,eAGZC,IAAY;AAAA,gBADCtd,GAAMgd,CAAM,EAAE,QACiB;AAClD,QAAII;AACA,aAAOC,IAAYD,IAAwBE;AAE1C;AACD,YAAMC,IAAoB9O,GAAO0O,GAAqB,CAAC10B,GAAQ+0B,MAAiB/0B,EAAO,OAAO+0B,CAAY,GAAG,EAAE,GACzGC,IAA0BpyB,EAAIkyB,GAAmB,CAACG,MAAa,IAAIryB,EAAIqyB,GAAU,CAACC,MAAkBrZ,GAAWqZ,CAAa,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,GAE5IC,IAAwB;AAAA,EADCvyB,EAAIoyB,GAAyB,CAACI,GAASjP,MAAQ,KAAKA,IAAM,CAAC,KAAKiP,CAAO,EAAE,EACR,KAAK;AAAA,CAAI,CAAC;AAC1G,aAAOR,IAAYO,IAAwBN;AAAA,IAC/C;AAAA,EACJ;AAAA,EACA,sBAAsB,EAAE,wBAAAQ,GAAwB,QAAAd,GAAQ,uBAAAI,GAAuB,UAAAH,EAAQ,GAAK;AACxF,UAAMI,IAAY,eAGZC,IAAY;AAAA,gBADCtd,GAAMgd,CAAM,EAAE,QACiB;AAClD,QAAII;AACA,aAAOC,IAAYD,IAAwBE;AAE1C;AAED,YAAMM,IAAwB;AAAA,KADEvyB,EAAIyyB,GAAwB,CAACJ,MAAa,IAAIryB,EAAIqyB,GAAU,CAACC,MAAkBrZ,GAAWqZ,CAAa,CAAC,EAAE,KAAK,GAAG,CAAC,GAAG,EAEtH,KAAK,IAAI,CAAC;AAC1C,aAAON,IAAYO,IAAwBN;AAAA,IAC/C;AAAA,EACJ;AACJ;AACA,OAAO,OAAOR,EAA0B;AACjC,MAAMiB,KAAsC;AAAA,EAC/C,uBAAuBC,GAAcC,GAAe;AAOhD,WANY,kEACRA,EAAc,kBACd;AAAA,6BAEAD,EAAa,OACb;AAAA,EAER;AACJ,GACaE,KAAuC;AAAA,EAChD,yBAAyBF,GAAcG,GAAgB;AACnD,aAASC,EAA2BxZ,GAAM;AACtC,aAAIA,aAAgBW,KACTX,EAAK,aAAa,OAEpBA,aAAgBC,KACdD,EAAK,kBAGL;AAAA,IAEf;AACA,UAAMyZ,IAAeL,EAAa,MAC5BM,IAAgBte,GAAMme,CAAc,GACpC51B,IAAQ+1B,EAAc,KACtBC,IAAUhY,GAAqB+X,CAAa,GAC5CE,IAAgBJ,EAA2BE,CAAa,GACxDG,IAAmBl2B,IAAQ;AACjC,QAAIsb,IAAM,KAAK0a,CAAO,GAAGE,IAAmBl2B,IAAQ,EAAE,MAAMi2B,IAAgB,oBAAoBA,CAAa,OAAO,EAAE;AAAA,4CAClFL,EAAe,MAAM,oCAAoCE,CAAY;AAAA;AAAA;AAIzG,WAAAxa,IAAMA,EAAI,QAAQ,WAAW,GAAG,GAChCA,IAAMA,EAAI,QAAQ,UAAU;AAAA,CAAI,GACzBA;AAAA,EACX;AAAA,EACA,4BAA4B7E,GAAM;AAM9B,WALe;AAAA,0EACgEA,EAAK,IAAI;AAAA;AAAA;AAAA;AAAA,EAK5F;AAAA,EACA,qCAAqC1N,GAAS;AAC1C,UAAMotB,IAAUrzB,EAAIiG,EAAQ,YAAY,CAACqtB,MAAYra,GAAWqa,CAAO,CAAC,EAAE,KAAK,IAAI,GAC7EC,IAAattB,EAAQ,YAAY,QAAQ,IAAI,KAAKA,EAAQ,YAAY;AAM5E,WALe,4BAA4BA,EAAQ,iBAAiB,KAAK,IAAI,CAAC;AAAA,QACjEstB,CAAU,aAAattB,EAAQ,aAAa,IAAI;AAAA,GACrDotB,CAAO;AAAA;AAAA;AAAA,EAInB;AAAA,EACA,+BAA+BptB,GAAS;AACpC,UAAMstB,IAAattB,EAAQ,YAAY,QAAQ,IAAI,KAAKA,EAAQ,YAAY,KACtEutB,IAAcvtB,EAAQ,WAAW,WAAW;AAClD,QAAIwtB,IAAc,qCAAqCxtB,EAAQ,iBAAiB,KAAK,IAAI,CAAC,WAAWstB,CAAU,aAC/FttB,EAAQ,aAAa,IAAI;AAAA;AACzC,QAAIutB;AACA,MAAAC,KACI;AAAA;AAAA;AAAA,SAGH;AACD,YAAMJ,IAAUrzB,EAAIiG,EAAQ,YAAY,CAACytB,MAAYza,GAAWya,CAAO,CAAC,EAAE,KAAK,IAAI;AACnF,MAAAD,KAAe,IAAIJ,CAAO;AAAA;AAAA,IAC9B;AACA,WAAAI,KACI;AAAA,uBAEGA;AAAA,EACX;AAAA,EACA,0BAA0BxtB,GAAS;AAC/B,QAAIitB,IAAUhY,GAAqBjV,EAAQ,UAAU;AACrD,WAAIA,EAAQ,WAAW,QAAQ,MAC3BitB,KAAWjtB,EAAQ,WAAW,MAEnB,mBAAmBitB,CAAO,kBAAkBjtB,EAAQ,aAAa,IAAI;AAAA;AAAA,EAGxF;AAAA;AAAA;AAAA,EAGA,oBAAoBA,GAAS;AAEzB,WAAO;AAAA,EACX;AAAA,EACA,2BAA2BA,GAAS;AAIhC,WAHe,iCAAiCA,EAAQ,iBAAiB,CAAC,WAC5DA,EAAQ,YAAY,GAAG,aAAaA,EAAQ,aAAa,IAAI;AAAA;AAAA,EAG/E;AAAA,EACA,8BAA8BA,GAAS;AAGnC,WAFe;AAAA,KACLA,EAAQ,YAAY,GAAG,aAAaA,EAAQ,aAAa,IAAI;AAAA,OAAiBA,EAAQ,YAAY,WAAW,SAAS,CAAC;AAAA,EAErI;AAAA,EACA,wBAAwBA,GAAS;AAC7B,UAAM2rB,IAAW3rB,EAAQ,aAAa,MAChC0tB,IAAY3zB,EAAIiG,EAAQ,mBAAmB,CAAC2tB,MAAaA,EAAS,IAAI,GACtEC,IAAoB,GAAGjC,CAAQ,QAAQ+B,EACxC,OAAO,CAAC/B,CAAQ,CAAC,EACjB,KAAK,OAAO,CAAC;AAMlB,WALe;AAAA,SACDA,CAAQ;AAAA;AAAA,GACwDiC,CAAiB;AAAA;AAAA;AAAA,EAInG;AAAA;AAAA;AAAA,EAGA,0BAA0B5tB,GAAS;AAE/B,WAAO;AAAA,EACX;AAAA,EACA,4BAA4BA,GAAS;AACjC,QAAI2rB;AACJ,WAAI3rB,EAAQ,wBAAwB0T,KAChCiY,IAAW3rB,EAAQ,aAAa,OAGhC2rB,IAAW3rB,EAAQ,cAER,iCAAiC2rB,CAAQ,2CAA2C3rB,EAAQ,WAAW;AAAA,EAE1H;AACJ;ACjLO,SAAS6tB,GAAeC,GAAWC,GAAgB;AACtD,QAAMC,IAAc,IAAIC,GAAuBH,GAAWC,CAAc;AACxE,SAAAC,EAAY,YAAW,GAChBA,EAAY;AACvB;AACO,MAAMC,WAA+BvZ,GAAY;AAAA,EACpD,YAAYwZ,GAAeH,GAAgB;AACvC,UAAK,GACL,KAAK,gBAAgBG,GACrB,KAAK,iBAAiBH,GACtB,KAAK,SAAS,CAAA;AAAA,EAClB;AAAA,EACA,cAAc;AACV,IAAA1a,EAAQhb,GAAO,KAAK,aAAa,GAAG,CAACib,MAAS;AAC1C,WAAK,eAAeA,GACpBA,EAAK,OAAO,IAAI;AAAA,IACpB,CAAC;AAAA,EACL;AAAA,EACA,iBAAiBxW,GAAM;AACnB,UAAMqxB,IAAM,KAAK,cAAcrxB,EAAK,eAAe;AACnD,QAAKqxB;AAUD,MAAArxB,EAAK,iBAAiBqxB;AAAA,SAVhB;AACN,YAAM5b,IAAM,KAAK,eAAe,uBAAuB,KAAK,cAAczV,CAAI;AAC9E,WAAK,OAAO,KAAK;AAAA,QACb,SAASyV;AAAA,QACT,MAAM6b,GAA0B;AAAA,QAChC,UAAU,KAAK,aAAa;AAAA,QAC5B,mBAAmBtxB,EAAK;AAAA,MACxC,CAAa;AAAA,IACL;AAAA,EAIJ;AACJ;AChCO,MAAMuxB,WAAyCnZ,GAAW;AAAA,EAC7D,YAAYmC,GAAS5b,GAAM;AACvB,UAAK,GACL,KAAK,UAAU4b,GACf,KAAK,OAAO5b,GACZ,KAAK,mBAAmB,CAAA,GACxB,KAAK,qBAAqB,IAC1B,KAAK,2BAA2B,GAChC,KAAK,QAAQ,IACb,KAAK,gBAAgB;AAAA,EACzB;AAAA,EACA,eAAe;AAEX,QADA,KAAK,QAAQ,IACT,KAAK,KAAK,UAAU,CAAC,MAAM,KAAK,QAAQ;AACxC,YAAM,MAAM,qDAAqD;AAGrE,gBAAK,YAAY6oB,GAAM,KAAK,KAAK,SAAS,EAAE,WAC5C,KAAK,kBAAkBA,GAAM,KAAK,KAAK,eAAe,EAAE,WAExD,KAAK,UAAU,IAAG,GAClB,KAAK,gBAAgB,IAAG,GACxB,KAAK,mBAAkB,GACvB,KAAK,KAAK,KAAK,OAAO,GACf,KAAK;AAAA,EAChB;AAAA,EACA,KAAKhR,GAAM6B,IAAW,IAAI;AAEtB,IAAK,KAAK,SACN,MAAM,KAAK7B,GAAM6B,CAAQ;AAAA,EAEjC;AAAA,EACA,YAAYG,GAASF,GAAUD,GAAU;AAErC,QAAIG,EAAQ,eAAe,SAAS,KAAK,sBACrCA,EAAQ,QAAQ,KAAK,0BAA0B;AAC/C,YAAMkC,IAAWpC,EAAS,OAAOD,CAAQ;AACzC,WAAK,mBAAkB,GACvB,KAAK,KAAKG,EAAQ,gBAAgBkC,CAAQ;AAAA,IAC9C;AAAA,EACJ;AAAA,EACA,qBAAqB;AAEjB,IAAIyG,GAAQ,KAAK,SAAS,KAGtB,KAAK,qBAAqB,IAC1B,KAAK,2BAA2B,GAChC,KAAK,gBAAgB,OAGrB,KAAK,qBAAqB,KAAK,UAAU,IAAG,GAC5C,KAAK,2BAA2B,KAAK,gBAAgB,IAAG;AAAA,EAEhE;AACJ;AACO,MAAMqQ,WAA6BD,GAAiC;AAAA,EACvE,YAAYhX,GAAS5b,GAAM;AACvB,UAAM4b,GAAS5b,CAAI,GACnB,KAAK,OAAOA,GACZ,KAAK,mBAAmB,IACxB,KAAK,yBAAyB,GAC9B,KAAK,mBAAmB,KAAK,KAAK,QAAQ,MAC1C,KAAK,yBAAyB,KAAK,KAAK;AAAA,EAC5C;AAAA,EACA,aAAa4Z,GAAUD,GAAUD,GAAU;AACvC,QAAI,KAAK,iBACLE,EAAS,aAAa,SAAS,KAAK,oBACpCA,EAAS,QAAQ,KAAK,0BACtB,CAAC,KAAK,OAAO;AACb,YAAMmC,IAAWpC,EAAS,OAAOD,CAAQ,GACnCsC,IAAW,IAAI9D,GAAY,EAAE,YAAY6D,EAAQ,CAAE;AACzD,WAAK,mBAAmB9I,GAAM+I,CAAQ,GACtC,KAAK,QAAQ;AAAA,IACjB;AAAA,EACJ;AACJ;AAKO,MAAM8W,WAAkDrZ,GAAW;AAAA,EACtE,YAAYsZ,GAASlB,GAAY;AAC7B,UAAK,GACL,KAAK,UAAUkB,GACf,KAAK,aAAalB,GAClB,KAAK,SAAS;AAAA,MACV,OAAO;AAAA,MACP,YAAY;AAAA,MACZ,aAAa;AAAA,IACzB;AAAA,EACI;AAAA,EACA,eAAe;AACX,gBAAK,KAAK,KAAK,OAAO,GACf,KAAK;AAAA,EAChB;AACJ;AACO,MAAMmB,WAAoCF,GAA0C;AAAA,EACvF,SAASxY,GAAUX,GAAUD,GAAU;AACnC,QAAIY,EAAS,QAAQ,KAAK,YAAY;AAClC,YAAM2Y,IAAiBC,GAAOvZ,EAAS,OAAOD,CAAQ,CAAC;AACvD,WAAK,OAAO,cAAcuZ,MAAmB,QACzCA,aAA0Bza,OAC1B,KAAK,OAAO,QAAQya,EAAe,cACnC,KAAK,OAAO,aAAaA,EAAe;AAAA,IAEhD;AAEI,YAAM,SAAS3Y,GAAUX,GAAUD,CAAQ;AAAA,EAEnD;AACJ;AACO,MAAMyZ,WAAuCL,GAA0C;AAAA,EAC1F,YAAYtY,GAAab,GAAUD,GAAU;AACzC,QAAIc,EAAY,QAAQ,KAAK,YAAY;AACrC,YAAM4Y,IAAoBF,GAAOvZ,EAAS,OAAOD,CAAQ,CAAC;AAC1D,WAAK,OAAO,cAAc0Z,MAAsB,QAC5CA,aAA6B5a,OAC7B,KAAK,OAAO,QAAQ4a,EAAkB,cACtC,KAAK,OAAO,aAAaA,EAAkB;AAAA,IAEnD;AAEI,YAAM,YAAY5Y,GAAab,GAAUD,CAAQ;AAAA,EAEzD;AACJ;AACO,MAAM2Z,WAA0CP,GAA0C;AAAA,EAC7F,eAAe7Y,GAAgBN,GAAUD,GAAU;AAC/C,QAAIO,EAAe,QAAQ,KAAK,YAAY;AACxC,YAAMqZ,IAAuBJ,GAAOvZ,EAAS,OAAOD,CAAQ,CAAC;AAC7D,WAAK,OAAO,cAAc4Z,MAAyB,QAC/CA,aAAgC9a,OAChC,KAAK,OAAO,QAAQ8a,EAAqB,cACzC,KAAK,OAAO,aAAaA,EAAqB;AAAA,IAEtD;AAEI,YAAM,eAAerZ,GAAgBN,GAAUD,CAAQ;AAAA,EAE/D;AACJ;AAEO,MAAM6Z,WAA6CT,GAA0C;AAAA,EAChG,kBAAkBU,GAAmB7Z,GAAUD,GAAU;AACrD,QAAI8Z,EAAkB,QAAQ,KAAK,YAAY;AAC3C,YAAMC,IAAoCP,GAAOvZ,EAAS,OAAOD,CAAQ,CAAC;AAC1E,WAAK,OAAO,cAAc+Z,MAAsC,QAC5DA,aAA6Cjb,OAC7C,KAAK,OAAO,QAAQib,EAAkC,cACtD,KAAK,OAAO,aAAaA,EAAkC;AAAA,IAEnE;AAEI,YAAM,kBAAkBD,GAAmB7Z,GAAUD,CAAQ;AAAA,EAErE;AACJ;AACO,SAASga,GAAkBC,GAAWC,GAAWjD,IAAW,CAAA,GAAI;AAEnE,EAAAA,IAAW9H,GAAM8H,CAAQ;AACzB,MAAIj1B,IAAS,CAAA,GACT,IAAI;AAER,WAASm4B,EAAkBC,GAAS;AAChC,WAAOA,EAAQ,OAAOn2B,GAAKg2B,GAAW,IAAI,CAAC,CAAC;AAAA,EAChD;AAEA,WAASI,EAAuB/b,GAAY;AACxC,UAAMzB,IAAemd,GAAkBG,EAAkB7b,CAAU,GAAG4b,GAAWjD,CAAQ;AACzF,WAAOj1B,EAAO,OAAO6a,CAAY;AAAA,EACrC;AAQA,SAAOoa,EAAS,SAASiD,KAAa,IAAID,EAAU,UAAQ;AACxD,UAAM9b,IAAO8b,EAAU,CAAC;AAExB,QAAI9b,aAAgBK;AAChB,aAAO6b,EAAuBlc,EAAK,UAAU;AAE5C,QAAIA,aAAgBC;AACrB,aAAOic,EAAuBlc,EAAK,UAAU;AAE5C,QAAIA,aAAgBiB;AACrB,MAAApd,IAASq4B,EAAuBlc,EAAK,UAAU;AAAA,aAE1CA,aAAgBM,IAAqB;AAC1C,YAAM6b,IAASnc,EAAK,WAAW,OAAO;AAAA,QAClC,IAAIQ,GAAW;AAAA,UACX,YAAYR,EAAK;AAAA,QACrC,CAAiB;AAAA,MACjB,CAAa;AACD,aAAOkc,EAAuBC,CAAM;AAAA,IACxC,WACSnc,aAAgBO,IAAkC;AACvD,YAAM4b,IAAS;AAAA,QACX,IAAI9b,GAAY,EAAE,YAAYL,EAAK,WAAU,CAAE;AAAA,QAC/C,IAAIQ,GAAW;AAAA,UACX,YAAY,CAAC,IAAIG,GAAS,EAAE,cAAcX,EAAK,UAAS,CAAE,CAAC,EAAE,OAAOA,EAAK,UAAU;AAAA,QACvG,CAAiB;AAAA,MACjB;AACY,aAAOkc,EAAuBC,CAAM;AAAA,IACxC,WACSnc,aAAgBS,IAAyB;AAC9C,YAAM0b,IAASnc,EAAK,WAAW,OAAO;AAAA,QAClC,IAAIQ,GAAW;AAAA,UACX,YAAY,CAAC,IAAIG,GAAS,EAAE,cAAcX,EAAK,UAAS,CAAE,CAAC,EAAE,OAAOA,EAAK,UAAU;AAAA,QACvG,CAAiB;AAAA,MACjB,CAAa;AACD,MAAAnc,IAASq4B,EAAuBC,CAAM;AAAA,IAC1C,WACSnc,aAAgBQ,IAAY;AACjC,YAAM2b,IAASnc,EAAK,WAAW,OAAO;AAAA,QAClC,IAAIQ,GAAW;AAAA,UACX,YAAYR,EAAK;AAAA,QACrC,CAAiB;AAAA,MACjB,CAAa;AACD,MAAAnc,IAASq4B,EAAuBC,CAAM;AAAA,IAC1C,OACK;AAAA,UAAInc,aAAgBU;AACrB,eAAAX,EAAQC,EAAK,YAAY,CAACoc,MAAY;AAIlC,UAAIzR,GAAQyR,EAAQ,UAAU,MAAM,OAChCv4B,IAASq4B,EAAuBE,EAAQ,UAAU;AAAA,QAE1D,CAAC,GACMv4B;AAEN,UAAImc,aAAgBW;AACrB,QAAAmY,EAAS,KAAK9Y,EAAK,YAAY;AAAA;AAG/B,cAAM,MAAM,sBAAsB;AAAA;AAEtC;AAAA,EACJ;AACA,SAAAnc,EAAO,KAAK;AAAA,IACR,aAAai1B;AAAA,IACb,WAAWhzB,GAAKg2B,GAAW,CAAC;AAAA,EACpC,CAAK,GACMj4B;AACX;AACO,SAASw4B,GAAwBC,GAAYvF,GAAawF,GAAYC,GAAc;AACvF,QAAMC,IAAoB,sBAEpBC,IAAwB,CAACD,CAAiB,GAC1CE,IAAmB;AACzB,MAAIC,IAAoB;AACxB,QAAMC,IAAoB9F,EAAY,QAChC+F,IAA2BD,IAAoBL,IAAe,GAC9D34B,IAAS,CAAA,GACTk5B,IAAgB,CAAA;AAOtB,OANAA,EAAc,KAAK;AAAA,IACf,KAAK;AAAA,IACL,KAAKT;AAAA,IACL,WAAW,CAAA;AAAA,IACX,iBAAiB,CAAA;AAAA,EACzB,CAAK,GACM,CAAC3R,GAAQoS,CAAa,KAAG;AAC5B,UAAMjE,IAAWiE,EAAc,IAAG;AAElC,QAAIjE,MAAa6D,GAAkB;AAC/B,MAAIC,KACA1H,GAAK6H,CAAa,EAAE,OAAOD,KAE3BC,EAAc,IAAG;AAErB;AAAA,IACJ;AACA,UAAMC,IAAUlE,EAAS,KACnBrK,IAAUqK,EAAS,KACnBmE,IAAgBnE,EAAS,WACzBoE,IAAsBpE,EAAS;AAErC,QAAInO,GAAQqS,CAAO;AACf;AAEJ,UAAMhd,IAAOgd,EAAQ,CAAC;AAEtB,QAAIhd,MAASyc,GAAmB;AAC5B,YAAMU,IAAW;AAAA,QACb,KAAK1O;AAAA,QACL,KAAK3oB,GAAKk3B,CAAO;AAAA,QACjB,WAAW92B,GAAU+2B,CAAa;AAAA,QAClC,iBAAiB/2B,GAAUg3B,CAAmB;AAAA,MAC9D;AACY,MAAAH,EAAc,KAAKI,CAAQ;AAAA,IAC/B,WACSnd,aAAgBW;AAErB,UAAI8N,IAAUoO,IAAoB,GAAG;AACjC,cAAMO,IAAU3O,IAAU,GACpB4O,IAActG,EAAYqG,CAAO;AACvC,YAAIb,EAAWc,GAAard,EAAK,YAAY,GAAG;AAC5C,gBAAMmd,IAAW;AAAA,YACb,KAAKC;AAAA,YACL,KAAKt3B,GAAKk3B,CAAO;AAAA,YACjB,WAAWC;AAAA,YACX,iBAAiBC;AAAA,UACzC;AACoB,UAAAH,EAAc,KAAKI,CAAQ;AAAA,QAC/B;AAAA,MAEJ,WACS1O,MAAYoO,IAAoB;AAErC,QAAAh5B,EAAO,KAAK;AAAA,UACR,eAAemc,EAAK;AAAA,UACpB,qBAAqBA,EAAK;AAAA,UAC1B,WAAWid;AAAA,UACX,iBAAiBC;AAAA,QACrC,CAAiB,GACDN,IAAoB;AAAA;AAGpB,cAAM,MAAM,sBAAsB;AAAA,aAGjC5c,aAAgBC,IAAa;AAClC,YAAMqd,IAAetM,GAAMiM,CAAa;AACxC,MAAAK,EAAa,KAAKtd,EAAK,eAAe;AACtC,YAAMud,IAAqBvM,GAAMkM,CAAmB;AACpD,MAAAK,EAAmB,KAAKvd,EAAK,GAAG;AAChC,YAAMmd,IAAW;AAAA,QACb,KAAK1O;AAAA,QACL,KAAKzO,EAAK,WAAW,OAAO0c,GAAuB52B,GAAKk3B,CAAO,CAAC;AAAA,QAChE,WAAWM;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAR,EAAc,KAAKI,CAAQ;AAAA,IAC/B,WACSnd,aAAgBiB,IAAQ;AAE7B,YAAMuc,IAAkB;AAAA,QACpB,KAAK/O;AAAA,QACL,KAAK3oB,GAAKk3B,CAAO;AAAA,QACjB,WAAWC;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAH,EAAc,KAAKS,CAAe,GAElCT,EAAc,KAAKJ,CAAgB;AACnC,YAAMc,IAAe;AAAA,QACjB,KAAKhP;AAAA,QACL,KAAKzO,EAAK,WAAW,OAAOla,GAAKk3B,CAAO,CAAC;AAAA,QACzC,WAAWC;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAH,EAAc,KAAKU,CAAY;AAAA,IACnC,WACSzd,aAAgBM,IAAqB;AAE1C,YAAMod,IAAkB,IAAIld,GAAW;AAAA,QACnC,YAAYR,EAAK;AAAA,QACjB,KAAKA,EAAK;AAAA,MAC1B,CAAa,GACKic,IAAUjc,EAAK,WAAW,OAAO,CAAC0d,CAAe,GAAG53B,GAAKk3B,CAAO,CAAC,GACjEG,IAAW;AAAA,QACb,KAAK1O;AAAA,QACL,KAAKwN;AAAA,QACL,WAAWgB;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAH,EAAc,KAAKI,CAAQ;AAAA,IAC/B,WACSnd,aAAgBO,IAAkC;AAEvD,YAAMod,IAAgB,IAAIhd,GAAS;AAAA,QAC/B,cAAcX,EAAK;AAAA,MACnC,CAAa,GACK0d,IAAkB,IAAIld,GAAW;AAAA,QACnC,YAAY,CAACmd,CAAa,EAAE,OAAO3d,EAAK,UAAU;AAAA,QAClD,KAAKA,EAAK;AAAA,MAC1B,CAAa,GACKic,IAAUjc,EAAK,WAAW,OAAO,CAAC0d,CAAe,GAAG53B,GAAKk3B,CAAO,CAAC,GACjEG,IAAW;AAAA,QACb,KAAK1O;AAAA,QACL,KAAKwN;AAAA,QACL,WAAWgB;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAH,EAAc,KAAKI,CAAQ;AAAA,IAC/B,WACSnd,aAAgBS,IAAyB;AAE9C,YAAM+c,IAAkB;AAAA,QACpB,KAAK/O;AAAA,QACL,KAAK3oB,GAAKk3B,CAAO;AAAA,QACjB,WAAWC;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAH,EAAc,KAAKS,CAAe,GAElCT,EAAc,KAAKJ,CAAgB;AACnC,YAAMgB,IAAgB,IAAIhd,GAAS;AAAA,QAC/B,cAAcX,EAAK;AAAA,MACnC,CAAa,GACK4d,IAAgB,IAAIpd,GAAW;AAAA,QACjC,YAAY,CAACmd,CAAa,EAAE,OAAO3d,EAAK,UAAU;AAAA,QAClD,KAAKA,EAAK;AAAA,MAC1B,CAAa,GACKic,IAAUjc,EAAK,WAAW,OAAO,CAAC4d,CAAa,GAAG93B,GAAKk3B,CAAO,CAAC,GAC/DS,IAAe;AAAA,QACjB,KAAKhP;AAAA,QACL,KAAKwN;AAAA,QACL,WAAWgB;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAH,EAAc,KAAKU,CAAY;AAAA,IACnC,WACSzd,aAAgBQ,IAAY;AAEjC,YAAMgd,IAAkB;AAAA,QACpB,KAAK/O;AAAA,QACL,KAAK3oB,GAAKk3B,CAAO;AAAA,QACjB,WAAWC;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAH,EAAc,KAAKS,CAAe,GAElCT,EAAc,KAAKJ,CAAgB;AAEnC,YAAMiB,IAAgB,IAAIpd,GAAW;AAAA,QACjC,YAAYR,EAAK;AAAA,QACjB,KAAKA,EAAK;AAAA,MAC1B,CAAa,GACKic,IAAUjc,EAAK,WAAW,OAAO,CAAC4d,CAAa,GAAG93B,GAAKk3B,CAAO,CAAC,GAC/DS,IAAe;AAAA,QACjB,KAAKhP;AAAA,QACL,KAAKwN;AAAA,QACL,WAAWgB;AAAA,QACX,iBAAiBC;AAAA,MACjC;AACY,MAAAH,EAAc,KAAKU,CAAY;AAAA,IACnC,WACSzd,aAAgBU;AAErB,eAAS5U,IAAIkU,EAAK,WAAW,SAAS,GAAGlU,KAAK,GAAGA,KAAK;AAClD,cAAMswB,IAAUpc,EAAK,WAAWlU,CAAC,GAC3B+xB,IAAc;AAAA,UAChB,KAAKpP;AAAA,UACL,KAAK2N,EAAQ,WAAW,OAAOt2B,GAAKk3B,CAAO,CAAC;AAAA,UAC5C,WAAWC;AAAA,UACX,iBAAiBC;AAAA,QACrC;AACgB,QAAAH,EAAc,KAAKc,CAAW,GAC9Bd,EAAc,KAAKJ,CAAgB;AAAA,MACvC;AAAA,aAEK3c,aAAgBK;AACrB,MAAA0c,EAAc,KAAK;AAAA,QACf,KAAKtO;AAAA,QACL,KAAKzO,EAAK,WAAW,OAAOla,GAAKk3B,CAAO,CAAC;AAAA,QACzC,WAAWC;AAAA,QACX,iBAAiBC;AAAA,MACjC,CAAa;AAAA,aAEIld,aAAgBI;AAErB,MAAA2c,EAAc,KAAKe,GAAmB9d,GAAMyO,GAASwO,GAAeC,CAAmB,CAAC;AAAA;AAGxF,YAAM,MAAM,sBAAsB;AAAA,EAE1C;AACA,SAAOr5B;AACX;AACA,SAASi6B,GAAmB5C,GAASzM,GAASwO,GAAeC,GAAqB;AAC9E,QAAMI,IAAetM,GAAMiM,CAAa;AACxC,EAAAK,EAAa,KAAKpC,EAAQ,IAAI;AAC9B,QAAM6C,IAAyB/M,GAAMkM,CAAmB;AAExD,SAAAa,EAAuB,KAAK,CAAC,GACtB;AAAA,IACH,KAAKtP;AAAA,IACL,KAAKyM,EAAQ;AAAA,IACb,WAAWoC;AAAA,IACX,iBAAiBS;AAAA,EACzB;AACA;ACreO,IAAIC;AAAA,CACV,SAAUA,GAAW;AAClB,EAAAA,EAAUA,EAAU,SAAY,CAAC,IAAI,UACrCA,EAAUA,EAAU,aAAgB,CAAC,IAAI,cACzCA,EAAUA,EAAU,uBAA0B,CAAC,IAAI,wBACnDA,EAAUA,EAAU,sCAAyC,CAAC,IAAI,uCAClEA,EAAUA,EAAU,4BAA+B,CAAC,IAAI,6BACxDA,EAAUA,EAAU,cAAiB,CAAC,IAAI;AAC9C,GAAGA,OAAcA,KAAY,CAAA,EAAG;AACzB,SAASC,GAAYje,GAAM;AAE9B,MAAIA,aAAgBiB,MAAUjB,MAAS;AACnC,WAAOge,GAAU;AAEhB,MAAIhe,aAAgBQ,MAAcR,MAAS;AAC5C,WAAOge,GAAU;AAEhB,MAAIhe,aAAgBM,MACrBN,MAAS;AACT,WAAOge,GAAU;AAEhB,MAAIhe,aAAgBO,MACrBP,MAAS;AACT,WAAOge,GAAU;AAEhB,MAAIhe,aAAgBS,MACrBT,MAAS;AACT,WAAOge,GAAU;AAEhB,MAAIhe,aAAgBU,MAAeV,MAAS;AAC7C,WAAOge,GAAU;AAGjB,QAAM,MAAM,sBAAsB;AAE1C;AACO,SAASE,GAAkBxxB,GAAS;AACvC,QAAM,EAAE,YAAAstB,GAAY,MAAA5f,GAAM,UAAA+jB,GAAU,cAAAC,EAAY,IAAK1xB,GAC/CnD,IAAO00B,GAAYE,CAAQ;AACjC,SAAI50B,MAASy0B,GAAU,cACZK,GAAuBrE,GAAY5f,GAAMgkB,CAAY,IAGrDE,GAAiCtE,GAAY5f,GAAM7Q,GAAM60B,CAAY;AAEpF;AACO,SAASG,GAAwBvE,GAAYwE,GAAaJ,GAAcK,GAAeC,GAAsBC,GAAe;AAC/H,QAAMC,IAAiBP,GAAuBrE,GAAYwE,GAAaJ,CAAY,GAC7EnG,IAAe4G,GAA0BD,CAAc,IACvDrO,KACAJ;AACN,SAAOwO,EAAcC,GAAgBH,GAAexG,GAAcyG,CAAoB;AAC1F;AAaO,SAASI,GAAkC9E,GAAYwE,GAAa7K,GAAG+K,GAAsBP,GAAUY,GAAkB;AAC5H,QAAMH,IAAiBN,GAAiCtE,GAAYwE,GAAaL,GAAUxK,CAAC,GACtFsE,IAAe4G,GAA0BD,CAAc,IACvDrO,KACAJ;AACN,SAAO4O,EAAiBH,EAAe,CAAC,GAAG3G,GAAcyG,CAAoB;AACjF;AACO,SAASM,GAA+BnoB,GAAM4nB,GAAexG,GAAcyG,GAAsB;AACpG,QAAMO,IAAYpoB,EAAK,QACjBqoB,IAA0B54B,GAAMuQ,GAAM,CAACulB,MAClC91B,GAAM81B,GAAS,CAACtD,MACZA,EAAS,WAAW,CAC9B,CACJ;AAED,MAAI2F;AAIA,WAAO,SAAUU,GAAQ;AAIrB,YAAMC,IAAa34B,EAAI04B,GAAQ,CAAC/C,MAAYA,EAAQ,IAAI;AACxD,eAASiD,IAAI,GAAGA,IAAIJ,GAAWI,KAAK;AAChC,cAAMjD,IAAUvlB,EAAKwoB,CAAC,GAChBC,IAAiBlD,EAAQ,QACzBmD,IAAgBH,EAAWC,CAAC;AAClC,YAAI,EAAAE,MAAkB,UAAaA,EAAc,KAAK,IAAI,MAAM;AAIhE,UAAApC,EAAU,UAASzJ,IAAI,GAAGA,IAAI4L,GAAgB5L,KAAK;AAC/C,kBAAMoF,IAAWsD,EAAQ1I,CAAC,GACpB8L,IAAiB1G,EAAS;AAChC,qBAAShtB,IAAI,GAAGA,IAAI0zB,GAAgB1zB,KAAK;AACrC,oBAAM2zB,IAAY,KAAK,GAAG3zB,IAAI,CAAC;AAC/B,kBAAImsB,EAAawH,GAAW3G,EAAShtB,CAAC,CAAC,MAAM;AAGzC,yBAASqxB;AAAA,YAEjB;AAGA,mBAAOkC;AAAA,UACX;AAAA,MAGJ;AAAA,IAGJ;AAEC,MAAIH,KAA2B,CAACR,GAAsB;AAGvD,UAAMgB,IAAkBj5B,EAAIoQ,GAAM,CAACulB,MACxBxY,GAAQwY,CAAO,CACzB,GACKuD,IAAc9V,GAAO6V,GAAiB,CAAC77B,GAAQu4B,GAASpS,OAC1DjK,EAAQqc,GAAS,CAACjS,MAAgB;AAC9B,MAAKjB,EAAIrlB,GAAQsmB,EAAY,YAAY,MACrCtmB,EAAOsmB,EAAY,YAAY,IAAIH,IAEvCjK,EAAQoK,EAAY,iBAAiB,CAACyV,MAAsB;AACxD,QAAK1W,EAAIrlB,GAAQ+7B,CAAiB,MAC9B/7B,EAAO+7B,CAAiB,IAAI5V;AAAA,MAEpC,CAAC;AAAA,IACL,CAAC,GACMnmB,IACR,CAAA,CAAE;AAIL,WAAO,WAAY;AACf,YAAM47B,IAAY,KAAK,GAAG,CAAC;AAC3B,aAAOE,EAAYF,EAAU,YAAY;AAAA,IAC7C;AAAA,EACJ;AAOI,WAAO,WAAY;AACf,eAASJ,IAAI,GAAGA,IAAIJ,GAAWI,KAAK;AAChC,cAAMjD,IAAUvlB,EAAKwoB,CAAC,GAChBC,IAAiBlD,EAAQ;AAC/B,QAAAe,EAAU,UAASzJ,IAAI,GAAGA,IAAI4L,GAAgB5L,KAAK;AAC/C,gBAAMoF,IAAWsD,EAAQ1I,CAAC,GACpB8L,IAAiB1G,EAAS;AAChC,mBAAShtB,IAAI,GAAGA,IAAI0zB,GAAgB1zB,KAAK;AACrC,kBAAM2zB,IAAY,KAAK,GAAG3zB,IAAI,CAAC;AAC/B,gBAAImsB,EAAawH,GAAW3G,EAAShtB,CAAC,CAAC,MAAM;AAGzC,uBAASqxB;AAAA,UAEjB;AAGA,iBAAOkC;AAAA,QACX;AAAA,MAGJ;AAAA,IAGJ;AAER;AACO,SAASQ,GAAwC/c,GAAKmV,GAAcyG,GAAsB;AAC7F,QAAMQ,IAA0B54B,GAAMwc,GAAK,CAACgW,MACjCA,EAAS,WAAW,CAC9B,GACKgH,IAAahd,EAAI;AAGvB,MAAIoc,KAA2B,CAACR,GAAsB;AAClD,UAAMqB,IAAoBnc,GAAQd,CAAG;AACrC,QAAIid,EAAkB,WAAW,KAC7BpV,GAAQoV,EAAkB,CAAC,EAAE,eAAe,GAAG;AAE/C,YAAMC,IADoBD,EAAkB,CAAC,EACI;AACjD,aAAO,WAAY;AACf,eAAO,KAAK,GAAG,CAAC,EAAE,iBAAiBC;AAAA,MACvC;AAAA,IACJ,OACK;AACD,YAAML,IAAc9V,GAAOkW,GAAmB,CAACl8B,GAAQsmB,GAAaH,OAChEnmB,EAAOsmB,EAAY,YAAY,IAAI,IACnCpK,EAAQoK,EAAY,iBAAiB,CAACyV,MAAsB;AACxD,QAAA/7B,EAAO+7B,CAAiB,IAAI;AAAA,MAChC,CAAC,GACM/7B,IACR,CAAA,CAAE;AACL,aAAO,WAAY;AACf,cAAM47B,IAAY,KAAK,GAAG,CAAC;AAC3B,eAAOE,EAAYF,EAAU,YAAY,MAAM;AAAA,MACnD;AAAA,IACJ;AAAA,EACJ;AAEI,WAAO,WAAY;AACf,MAAAtC,EAAU,UAASzJ,IAAI,GAAGA,IAAIoM,GAAYpM,KAAK;AAC3C,cAAMoF,IAAWhW,EAAI4Q,CAAC,GAChB8L,IAAiB1G,EAAS;AAChC,iBAAShtB,IAAI,GAAGA,IAAI0zB,GAAgB1zB,KAAK;AACrC,gBAAM2zB,IAAY,KAAK,GAAG3zB,IAAI,CAAC;AAC/B,cAAImsB,EAAawH,GAAW3G,EAAShtB,CAAC,CAAC,MAAM;AAGzC,qBAASqxB;AAAA,QAEjB;AAEA,eAAO;AAAA,MACX;AAEA,aAAO;AAAA,IACX;AAER;AACA,MAAM8C,WAAmCre,GAAW;AAAA,EAChD,YAAYmC,GAASmc,GAAkBC,GAAgB;AACnD,UAAK,GACL,KAAK,UAAUpc,GACf,KAAK,mBAAmBmc,GACxB,KAAK,iBAAiBC;AAAA,EAC1B;AAAA,EACA,eAAe;AACX,gBAAK,KAAK,KAAK,OAAO,GACf,KAAK;AAAA,EAChB;AAAA,EACA,cAAc32B,GAAM42B,GAAkBte,GAAUD,GAAU;AACtD,WAAIrY,EAAK,QAAQ,KAAK,oBAClB,KAAK,mBAAmB42B,KACxB,KAAK,UAAUte,EAAS,OAAOD,CAAQ,GAChC,MAGJ;AAAA,EACX;AAAA,EACA,WAAWM,GAAYL,GAAUD,GAAU;AACvC,IAAK,KAAK,cAAcM,GAAY6b,GAAU,QAAQlc,GAAUD,CAAQ,KACpE,MAAM,WAAWM,GAAYL,GAAUD,CAAQ;AAAA,EAEvD;AAAA,EACA,eAAeO,GAAgBN,GAAUD,GAAU;AAC/C,IAAK,KAAK,cAAcO,GAAgB4b,GAAU,sBAAsBlc,GAAUD,CAAQ,KACtF,MAAM,WAAWO,GAAgBN,GAAUD,CAAQ;AAAA,EAE3D;AAAA,EACA,kBAAkBS,GAAmBR,GAAUD,GAAU;AACrD,IAAK,KAAK,cAAcS,GAAmB0b,GAAU,qCAAqClc,GAAUD,CAAQ,KACxG,MAAM,WAAWS,GAAmBR,GAAUD,CAAQ;AAAA,EAE9D;AAAA,EACA,SAASY,GAAUX,GAAUD,GAAU;AACnC,IAAK,KAAK,cAAcY,GAAUub,GAAU,YAAYlc,GAAUD,CAAQ,KACtE,MAAM,WAAWY,GAAUX,GAAUD,CAAQ;AAAA,EAErD;AAAA,EACA,YAAYc,GAAab,GAAUD,GAAU;AACzC,IAAK,KAAK,cAAcc,GAAaqb,GAAU,2BAA2Blc,GAAUD,CAAQ,KACxF,MAAM,WAAWc,GAAab,GAAUD,CAAQ;AAAA,EAExD;AACJ;AAIA,MAAMwe,WAAsCjf,GAAY;AAAA,EACpD,YAAY8e,GAAkBC,GAAgBG,GAAW;AACrD,UAAK,GACL,KAAK,mBAAmBJ,GACxB,KAAK,iBAAiBC,GACtB,KAAK,YAAYG,GACjB,KAAK,SAAS,CAAA;AAAA,EAClB;AAAA,EACA,cAAc92B,GAAM+2B,GAAkB;AAClC,IAAI/2B,EAAK,QAAQ,KAAK,oBAClB,KAAK,mBAAmB+2B,MACvB,KAAK,cAAc,UAAa/2B,MAAS,KAAK,eAC/C,KAAK,SAASA,EAAK;AAAA,EAE3B;AAAA,EACA,YAAYA,GAAM;AACd,SAAK,cAAcA,GAAMw0B,GAAU,MAAM;AAAA,EAC7C;AAAA,EACA,gBAAgBx0B,GAAM;AAClB,SAAK,cAAcA,GAAMw0B,GAAU,UAAU;AAAA,EACjD;AAAA,EACA,yBAAyBx0B,GAAM;AAC3B,SAAK,cAAcA,GAAMw0B,GAAU,oBAAoB;AAAA,EAC3D;AAAA,EACA,sCAAsCx0B,GAAM;AACxC,SAAK,cAAcA,GAAMw0B,GAAU,mCAAmC;AAAA,EAC1E;AAAA,EACA,6BAA6Bx0B,GAAM;AAC/B,SAAK,cAAcA,GAAMw0B,GAAU,yBAAyB;AAAA,EAChE;AAAA,EACA,iBAAiBx0B,GAAM;AACnB,SAAK,cAAcA,GAAMw0B,GAAU,WAAW;AAAA,EAClD;AACJ;AACA,SAASwC,GAAwBC,GAAM;AACnC,QAAM58B,IAAS,IAAI,MAAM48B,CAAI;AAC7B,WAAS30B,IAAI,GAAGA,IAAI20B,GAAM30B;AACtB,IAAAjI,EAAOiI,CAAC,IAAI,CAAA;AAEhB,SAAOjI;AACX;AAMA,SAAS68B,GAAev4B,GAAM;AAC1B,MAAI/E,IAAO,CAAC,EAAE;AACd,WAAS0I,IAAI,GAAGA,IAAI3D,EAAK,QAAQ2D,KAAK;AAClC,UAAM6T,IAAUxX,EAAK2D,CAAC,GAChB60B,IAAa,CAAA;AACnB,aAASjN,IAAI,GAAGA,IAAItwB,EAAK,QAAQswB,KAAK;AAClC,YAAMkN,IAAiBx9B,EAAKswB,CAAC;AAC7B,MAAAiN,EAAW,KAAKC,IAAiB,MAAMjhB,EAAQ,YAAY;AAC3D,eAAS0f,IAAI,GAAGA,IAAI1f,EAAQ,gBAAgB,QAAQ0f,KAAK;AACrD,cAAMwB,IAAsB,MAAMlhB,EAAQ,gBAAgB0f,CAAC;AAC3D,QAAAsB,EAAW,KAAKC,IAAiBC,CAAmB;AAAA,MACxD;AAAA,IACJ;AACA,IAAAz9B,IAAOu9B;AAAA,EACX;AACA,SAAOv9B;AACX;AAIA,SAAS09B,GAAmBC,GAAmBC,GAAgBhX,GAAK;AAChE,WAASiX,IAAa,GAAGA,IAAaF,EAAkB,QAAQE,KAAc;AAE1E,QAAIA,MAAejX;AACf;AAEJ,UAAMkX,IAAyBH,EAAkBE,CAAU;AAC3D,aAASE,IAAY,GAAGA,IAAYH,EAAe,QAAQG,KAAa;AACpE,YAAMC,IAAYJ,EAAeG,CAAS;AAC1C,UAAID,EAAuBE,CAAS,MAAM;AACtC,eAAO;AAAA,IAEf;AAAA,EACJ;AAEA,SAAO;AACX;AACO,SAASC,GAAkCC,GAAU3N,GAAG;AAC3D,QAAM4N,IAAc96B,EAAI66B,GAAU,CAAClF,MAAYP,GAAkB,CAACO,CAAO,GAAG,CAAC,CAAC,GACxEoF,IAAchB,GAAwBe,EAAY,MAAM,GACxDE,IAAah7B,EAAI86B,GAAa,CAAC3I,MAAiB;AAClD,UAAM8I,IAAO,CAAA;AACb,WAAA3hB,EAAQ6Y,GAAc,CAAC1sB,MAAS;AAC5B,YAAM9I,IAAOs9B,GAAex0B,EAAK,WAAW;AAC5C,MAAA6T,EAAQ3c,GAAM,CAACosB,MAAY;AACvB,QAAAkS,EAAKlS,CAAO,IAAI;AAAA,MACpB,CAAC;AAAA,IACL,CAAC,GACMkS;AAAA,EACX,CAAC;AACD,MAAIC,IAAUJ;AAEd,WAASK,IAAa,GAAGA,KAAcjO,GAAGiO,KAAc;AACpD,UAAMC,IAAcF;AACpB,IAAAA,IAAUnB,GAAwBqB,EAAY,MAAM;AAEpD,aAASC,IAAS,GAAGA,IAASD,EAAY,QAAQC,KAAU;AACxD,YAAMC,IAA0BF,EAAYC,CAAM;AAElD,eAASE,IAAc,GAAGA,IAAcD,EAAwB,QAAQC,KAAe;AACnF,cAAMC,IAAiBF,EAAwBC,CAAW,EAAE,aACtDE,IAAYH,EAAwBC,CAAW,EAAE,WACjDG,IAAazB,GAAeuB,CAAc;AAGhD,YAFiBnB,GAAmBW,GAAYU,GAAYL,CAAM,KAElDnX,GAAQuX,CAAS,KAAKD,EAAe,WAAWtO,GAAG;AAC/D,gBAAMyO,IAAgBZ,EAAYM,CAAM;AAExC,cAAIO,GAAaD,GAAeH,CAAc,MAAM,IAAO;AACvD,YAAAG,EAAc,KAAKH,CAAc;AAEjC,qBAASvO,IAAI,GAAGA,IAAIyO,EAAW,QAAQzO,KAAK;AACxC,oBAAMlE,IAAU2S,EAAWzO,CAAC;AAC5B,cAAA+N,EAAWK,CAAM,EAAEtS,CAAO,IAAI;AAAA,YAClC;AAAA,UACJ;AAAA,QACJ,OAEK;AACD,gBAAM8S,IAA6BzG,GAAkBqG,GAAWN,IAAa,GAAGK,CAAc;AAC9F,UAAAN,EAAQG,CAAM,IAAIH,EAAQG,CAAM,EAAE,OAAOQ,CAA0B,GAEnEviB,EAAQuiB,GAA4B,CAACp2B,MAAS;AAC1C,kBAAMi2B,IAAazB,GAAex0B,EAAK,WAAW;AAClD,YAAA6T,EAAQoiB,GAAY,CAAC9+B,MAAQ;AACzB,cAAAo+B,EAAWK,CAAM,EAAEz+B,CAAG,IAAI;AAAA,YAC9B,CAAC;AAAA,UACL,CAAC;AAAA,QACL;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AACA,SAAOm+B;AACX;AACO,SAASnD,GAAuBrE,GAAYwE,GAAa7K,GAAG9Q,GAAQ;AACvE,QAAMnK,IAAU,IAAI2nB,GAA8BrG,GAAYgE,GAAU,aAAanb,CAAM;AAC3F,SAAA2b,EAAY,OAAO9lB,CAAO,GACnB2oB,GAAkC3oB,EAAQ,QAAQib,CAAC;AAC9D;AACO,SAAS2K,GAAiCtE,GAAYwE,GAAaL,GAAUxK,GAAG;AACnF,QAAM4O,IAAmB,IAAIlC,GAA8BrG,GAAYmE,CAAQ;AAC/E,EAAAK,EAAY,OAAO+D,CAAgB;AACnC,QAAMC,IAAYD,EAAiB,QAE7BE,IADiB,IAAIxC,GAA2BzB,GAAaxE,GAAYmE,CAAQ,EACvD,aAAY,GACtCuE,IAAa,IAAIC,GAAgB,EAAE,YAAYH,EAAS,CAAE,GAC1DI,IAAY,IAAID,GAAgB,EAAE,YAAYF,EAAQ,CAAE;AAC9D,SAAOpB,GAAkC,CAACqB,GAAYE,CAAS,GAAGjP,CAAC;AACvE;AACO,SAAS0O,GAAaQ,GAAaC,GAAY;AAClD,EAAAC,EAAkB,UAASj3B,IAAI,GAAGA,IAAI+2B,EAAY,QAAQ/2B,KAAK;AAC3D,UAAMk3B,IAAYH,EAAY/2B,CAAC;AAC/B,QAAIk3B,EAAU,WAAWF,EAAW,QAGpC;AAAA,eAASpP,IAAI,GAAGA,IAAIsP,EAAU,QAAQtP,KAAK;AACvC,cAAMuP,IAAYH,EAAWpP,CAAC,GACxBwP,IAAWF,EAAUtP,CAAC;AAG5B,aAFuBuP,MAAcC,KACjCA,EAAS,mBAAmBD,EAAU,YAAY,MAAM,YACrC;AACnB,mBAASF;AAAA,MAEjB;AACA,aAAO;AAAA;AAAA,EACX;AACA,SAAO;AACX;AACO,SAASI,GAAqBC,GAAQt4B,GAAO;AAChD,SAAQs4B,EAAO,SAASt4B,EAAM,UAC1BxE,GAAM88B,GAAQ,CAACzjB,GAASqK,MAAQ;AAC5B,UAAMqZ,IAAev4B,EAAMkf,CAAG;AAC9B,WAAQrK,MAAY0jB,KAChBA,EAAa,mBAAmB1jB,EAAQ,YAAY;AAAA,EAC5D,CAAC;AACT;AACO,SAASkf,GAA0BD,GAAgB;AACtD,SAAOt4B,GAAMs4B,GAAgB,CAAC0E,MAAmBh9B,GAAMg9B,GAAgB,CAACC,MAAej9B,GAAMi9B,GAAY,CAACpvB,MAAUwW,GAAQxW,EAAM,eAAe,CAAC,CAAC,CAAC;AACxJ;AC/cO,SAASqvB,GAAkB92B,GAAS;AACvC,QAAM+2B,IAAmC/2B,EAAQ,kBAAkB,SAAS;AAAA,IACxE,OAAOA,EAAQ;AAAA,IACf,YAAYA,EAAQ;AAAA,IACpB,aAAaA,EAAQ;AAAA,EAC7B,CAAK;AACD,SAAOjG,EAAIg9B,GAAkC,CAACC,MAAkB,OAAO,OAAO,EAAE,MAAM5I,GAA0B,+BAA+B4I,CAAY,CAAE;AACjK;AACO,SAASC,GAAgBnJ,GAAW9S,GAAY+S,GAAgBmJ,GAAa;AAChF,QAAMC,IAAkBr9B,GAAQg0B,GAAW,CAACsJ,MAAiBC,GAA6BD,GAAcrJ,CAAc,CAAC,GACjHuJ,IAA+BC,GAAuCzJ,GAAW9S,GAAY+S,CAAc,GAC3GyJ,IAAoB19B,GAAQg0B,GAAW,CAAC2J,MAAYC,GAAoBD,GAAS1J,CAAc,CAAC,GAChG4J,IAAsB79B,GAAQg0B,GAAW,CAAC2J,MAAYG,GAAgCH,GAAS3J,GAAWoJ,GAAanJ,CAAc,CAAC;AAC5I,SAAOoJ,EAAgB,OAAOG,GAA8BE,GAAmBG,CAAmB;AACtG;AACA,SAASN,GAA6B3K,GAAcqB,GAAgB;AAChE,QAAM8J,IAAmB,IAAIC,GAA6B;AAC1D,EAAApL,EAAa,OAAOmL,CAAgB;AACpC,QAAME,IAAqBF,EAAiB,gBACtCG,IAAmBh+B,GAAQ+9B,GAAoBE,EAA+B,GAC9EC,IAAa/8B,GAAO68B,GAAkB,CAACG,MAClCA,EAAU,SAAS,CAC7B;AAkBD,SAjBep+B,EAAI1B,GAAO6/B,CAAU,GAAG,CAACE,MAAmB;AACvD,UAAMC,IAAY3pB,GAAM0pB,CAAc,GAChC7lB,IAAMwb,EAAe,yBAAyBrB,GAAc0L,CAAc,GAC1EnL,IAAUhY,GAAqBojB,CAAS,GACxCC,IAAW;AAAA,MACb,SAAS/lB;AAAA,MACT,MAAM6b,GAA0B;AAAA,MAChC,UAAU1B,EAAa;AAAA,MACvB,SAASO;AAAA,MACT,YAAYoL,EAAU;AAAA,IAClC,GACcE,IAAQzL,GAA2BuL,CAAS;AAClD,WAAIE,MACAD,EAAS,YAAYC,IAElBD;AAAA,EACX,CAAC;AAEL;AACO,SAASL,GAAgC3kB,GAAM;AAClD,SAAO,GAAG2B,GAAqB3B,CAAI,CAAC,MAAMA,EAAK,GAAG,MAAMwZ,GAA2BxZ,CAAI,CAAC;AAC5F;AACA,SAASwZ,GAA2BxZ,GAAM;AACtC,SAAIA,aAAgBW,KACTX,EAAK,aAAa,OAEpBA,aAAgBC,KACdD,EAAK,kBAGL;AAEf;AACO,MAAMwkB,WAAsCpjB,GAAY;AAAA,EAC3D,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,iBAAiB,CAAA;AAAA,EAC1B;AAAA,EACA,iBAAiB8jB,GAAS;AACtB,SAAK,eAAe,KAAKA,CAAO;AAAA,EACpC;AAAA,EACA,YAAYC,GAAQ;AAChB,SAAK,eAAe,KAAKA,CAAM;AAAA,EACnC;AAAA,EACA,6BAA6BC,GAAS;AAClC,SAAK,eAAe,KAAKA,CAAO;AAAA,EACpC;AAAA,EACA,yBAAyBC,GAAY;AACjC,SAAK,eAAe,KAAKA,CAAU;AAAA,EACvC;AAAA,EACA,sCAAsCC,GAAe;AACjD,SAAK,eAAe,KAAKA,CAAa;AAAA,EAC1C;AAAA,EACA,gBAAgBC,GAAM;AAClB,SAAK,eAAe,KAAKA,CAAI;AAAA,EACjC;AAAA,EACA,iBAAiBC,GAAI;AACjB,SAAK,eAAe,KAAKA,CAAE;AAAA,EAC/B;AAAA,EACA,cAAczjB,GAAU;AACpB,SAAK,eAAe,KAAKA,CAAQ;AAAA,EACrC;AACJ;AACO,SAASuiB,GAAgClqB,GAAMqrB,GAAUC,GAAWjL,GAAgB;AACvF,QAAM3P,IAAS,CAAA;AAOf,MANoBjB,GAAO4b,GAAU,CAAC5hC,GAAQsgC,MACtCA,EAAQ,SAAS/pB,EAAK,OACfvW,IAAS,IAEbA,GACR,CAAC,IACc,GAAG;AACjB,UAAM8hC,IAASlL,EAAe,4BAA4B;AAAA,MACtD,cAAcrgB;AAAA,MACd,aAAasrB;AAAA,IACzB,CAAS;AACD,IAAA5a,EAAO,KAAK;AAAA,MACR,SAAS6a;AAAA,MACT,MAAM7K,GAA0B;AAAA,MAChC,UAAU1gB,EAAK;AAAA,IAC3B,CAAS;AAAA,EACL;AACA,SAAO0Q;AACX;AAIO,SAAS8a,GAAyBvN,GAAUwN,GAAmBH,GAAW;AAC7E,QAAM5a,IAAS,CAAA;AACf,MAAI6a;AACJ,SAAK1gC,GAAS4gC,GAAmBxN,CAAQ,MACrCsN,IACI,kCAAkCtN,CAAQ,6CAA6CqN,CAAS,wDAEpG5a,EAAO,KAAK;AAAA,IACR,SAAS6a;AAAA,IACT,MAAM7K,GAA0B;AAAA,IAChC,UAAUzC;AAAA,EACtB,CAAS,IAEEvN;AACX;AACO,SAASgb,GAAwB5K,GAASb,GAAUI,GAAgBtyB,IAAO,CAAA,GAAI;AAClF,QAAM2iB,IAAS,CAAA,GACTib,IAAmBC,GAAqB3L,EAAS,UAAU;AACjE,MAAI1P,GAAQob,CAAgB;AACxB,WAAO,CAAA;AAEN;AACD,UAAM1N,IAAW6C,EAAQ;AAEzB,IAD2Bj2B,GAAS8gC,GAAkB7K,CAAO,KAEzDpQ,EAAO,KAAK;AAAA,MACR,SAAS2P,EAAe,wBAAwB;AAAA,QAC5C,cAAcS;AAAA,QACd,mBAAmB/yB;AAAA,MACvC,CAAiB;AAAA,MACD,MAAM2yB,GAA0B;AAAA,MAChC,UAAUzC;AAAA,IAC1B,CAAa;AAIL,UAAM4N,IAAiBvgC,GAAWqgC,GAAkB59B,EAAK,OAAO,CAAC+yB,CAAO,CAAC,CAAC,GACpEgL,IAAsB1/B,GAAQy/B,GAAgB,CAACE,MAAgB;AACjE,YAAMvU,IAAUZ,GAAM7oB,CAAI;AAC1B,aAAAypB,EAAQ,KAAKuU,CAAW,GACjBL,GAAwB5K,GAASiL,GAAa1L,GAAgB7I,CAAO;AAAA,IAChF,CAAC;AACD,WAAO9G,EAAO,OAAOob,CAAmB;AAAA,EAC5C;AACJ;AACO,SAASF,GAAqB7lB,GAAY;AAC7C,MAAItc,IAAS,CAAA;AACb,MAAI8mB,GAAQxK,CAAU;AAClB,WAAOtc;AAEX,QAAMkhC,IAAY3pB,GAAM+E,CAAU;AAElC,MAAI4kB,aAAqB9kB;AACrB,IAAApc,EAAO,KAAKkhC,EAAU,cAAc;AAAA,WAE/BA,aAAqBpC,MAC1BoC,aAAqB9jB,MACrB8jB,aAAqBzkB,MACrBykB,aAAqBxkB,MACrBwkB,aAAqBtkB,MACrBskB,aAAqBvkB;AACrB,IAAA3c,IAASA,EAAO,OAAOmiC,GAAqBjB,EAAU,UAAU,CAAC;AAAA,WAE5DA,aAAqBrkB;AAE1B,IAAA7c,IAAS+f,GAAQnd,EAAIs+B,EAAU,YAAY,CAACqB,MAAeJ,GAAqBI,EAAW,UAAU,CAAC,CAAC;AAAA,WAElG,EAAArB,aAAqBpkB,IAI1B,OAAM,MAAM,sBAAsB;AAEtC,QAAM0lB,IAAkB9kB,GAAewjB,CAAS,GAC1CuB,IAAUnmB,EAAW,SAAS;AACpC,MAAIkmB,KAAmBC,GAAS;AAC5B,UAAMC,IAAOzgC,GAAKqa,CAAU;AAC5B,WAAOtc,EAAO,OAAOmiC,GAAqBO,CAAI,CAAC;AAAA,EACnD;AAEI,WAAO1iC;AAEf;AACA,MAAM2iC,WAAoBplB,GAAY;AAAA,EAClC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,eAAe,CAAA;AAAA,EACxB;AAAA,EACA,iBAAiB5X,GAAM;AACnB,SAAK,aAAa,KAAKA,CAAI;AAAA,EAC/B;AACJ;AACO,SAASi9B,GAA2BrN,GAAcqB,GAAgB;AACrE,QAAMiM,IAAc,IAAIF,GAAW;AACnC,EAAApN,EAAa,OAAOsN,CAAW;AAC/B,QAAMC,IAAMD,EAAY;AAyBxB,SAxBelgC,GAAQmgC,GAAK,CAACC,MAAW;AACpC,UAAMC,IAAa3gC,GAAU0gC,EAAO,UAAU;AAC9C,WAAOpgC,GAAQqgC,GAAY,CAACC,GAAiB7F,MAAe;AACxD,YAAM8F,IAAqB1K,GAAwB,CAACyK,CAAe,GAAG,CAAA,GAAI3W,IAAwB,CAAC;AACnG,aAAIxF,GAAQoc,CAAkB,IACnB;AAAA,QACH;AAAA,UACI,SAAStM,EAAe,2BAA2B;AAAA,YAC/C,cAAcrB;AAAA,YACd,aAAawN;AAAA,YACb,gBAAgB3F;AAAA,UAC5C,CAAyB;AAAA,UACD,MAAMnG,GAA0B;AAAA,UAChC,UAAU1B,EAAa;AAAA,UACvB,YAAYwN,EAAO;AAAA,UACnB,aAAa3F,IAAa;AAAA,QAClD;AAAA,MACA,IAGuB,CAAA;AAAA,IAEf,CAAC;AAAA,EACL,CAAC;AAEL;AACO,SAAS+F,GAAyC5N,GAAc6N,GAAoBxM,GAAgB;AACvG,QAAMiM,IAAc,IAAIF,GAAW;AACnC,EAAApN,EAAa,OAAOsN,CAAW;AAC/B,MAAIC,IAAMD,EAAY;AAGtB,SAAAC,IAAMv+B,GAAOu+B,GAAK,CAACC,MAAWA,EAAO,sBAAsB,EAAI,GAChDpgC,GAAQmgC,GAAK,CAACC,MAAW;AACpC,UAAMM,IAAiBN,EAAO,KACxBO,IAAqBP,EAAO,gBAAgBK,GAC5CvoB,IAAe2f,GAAuB6I,GAAgB9N,GAAc+N,GAAoBP,CAAM,GAC9FQ,IAAsBC,GAA6B3oB,GAAckoB,GAAQxN,GAAcqB,CAAc,GACrG6M,IAA4BC,GAAmC7oB,GAAckoB,GAAQxN,GAAcqB,CAAc;AACvH,WAAO2M,EAAoB,OAAOE,CAAyB;AAAA,EAC/D,CAAC;AAEL;AACO,MAAME,WAA4BpmB,GAAY;AAAA,EACjD,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,iBAAiB,CAAA;AAAA,EAC1B;AAAA,EACA,6BAA6BgkB,GAAS;AAClC,SAAK,eAAe,KAAKA,CAAO;AAAA,EACpC;AAAA,EACA,yBAAyBC,GAAY;AACjC,SAAK,eAAe,KAAKA,CAAU;AAAA,EACvC;AAAA,EACA,sCAAsCC,GAAe;AACjD,SAAK,eAAe,KAAKA,CAAa;AAAA,EAC1C;AAAA,EACA,gBAAgBC,GAAM;AAClB,SAAK,eAAe,KAAKA,CAAI;AAAA,EACjC;AACJ;AACO,SAASnB,GAAoBhL,GAAcqB,GAAgB;AAC9D,QAAMiM,IAAc,IAAIF,GAAW;AACnC,EAAApN,EAAa,OAAOsN,CAAW;AAC/B,QAAMC,IAAMD,EAAY;AAmBxB,SAlBelgC,GAAQmgC,GAAK,CAACC,MACrBA,EAAO,WAAW,SAAS,MACpB;AAAA,IACH;AAAA,MACI,SAASnM,EAAe,8BAA8B;AAAA,QAClD,cAAcrB;AAAA,QACd,aAAawN;AAAA,MACrC,CAAqB;AAAA,MACD,MAAM9L,GAA0B;AAAA,MAChC,UAAU1B,EAAa;AAAA,MACvB,YAAYwN,EAAO;AAAA,IACvC;AAAA,EACA,IAGmB,CAAA,CAEd;AAEL;AACO,SAASa,GAAkCC,GAAetJ,GAAc3D,GAAgB;AAC3F,QAAM3P,IAAS,CAAA;AACf,SAAA/K,EAAQ2nB,GAAe,CAACC,MAAgB;AACpC,UAAMpD,IAAmB,IAAIiD,GAAmB;AAChD,IAAAG,EAAY,OAAOpD,CAAgB;AACnC,UAAME,IAAqBF,EAAiB;AAC5C,IAAAxkB,EAAQ0kB,GAAoB,CAACmD,MAAa;AACtC,YAAMzJ,IAAWF,GAAY2J,CAAQ,GAC/BT,IAAqBS,EAAS,gBAAgBxJ,GAC9C8I,IAAiBU,EAAS,KAE1BC,IADQvJ,GAAiC4I,GAAgBS,GAAaxJ,GAAUgJ,CAAkB,EACpE,CAAC;AACrC,UAAIxc,GAAQ/G,GAAQikB,CAAqB,CAAC,GAAG;AACzC,cAAMlC,IAASlL,EAAe,0BAA0B;AAAA,UACpD,cAAckN;AAAA,UACd,YAAYC;AAAA,QAChC,CAAiB;AACD,QAAA9c,EAAO,KAAK;AAAA,UACR,SAAS6a;AAAA,UACT,MAAM7K,GAA0B;AAAA,UAChC,UAAU6M,EAAY;AAAA,QAC1C,CAAiB;AAAA,MACL;AAAA,IACJ,CAAC;AAAA,EACL,CAAC,GACM7c;AACX;AACA,SAASuc,GAA6B3oB,GAAcopB,GAAa1tB,GAAMqgB,GAAgB;AACnF,QAAMsN,IAAsB,CAAA,GACtBC,IAAuBne,GAAOnL,GAAc,CAAC7a,GAAQu4B,GAAS6E,OAE5D6G,EAAY,WAAW7G,CAAU,EAAE,sBAAsB,MAG7DlhB,EAAQqc,GAAS,CAACtD,MAAa;AAC3B,UAAMmP,IAAwB,CAAChH,CAAU;AACzC,IAAAlhB,EAAQrB,GAAc,CAACwpB,GAAcC,MAAoB;AACrD,MAAIlH,MAAekH,KACf9F,GAAa6F,GAAcpP,CAAQ;AAAA,MAEnCgP,EAAY,WAAWK,CAAe,EAAE,sBAAsB,MAC9DF,EAAsB,KAAKE,CAAe;AAAA,IAElD,CAAC,GACGF,EAAsB,SAAS,KAC/B,CAAC5F,GAAa0F,GAAqBjP,CAAQ,MAC3CiP,EAAoB,KAAKjP,CAAQ,GACjCj1B,EAAO,KAAK;AAAA,MACR,MAAMokC;AAAA,MACN,MAAMnP;AAAA,IAC1B,CAAiB;AAAA,EAET,CAAC,GACMj1B,IACR,CAAA,CAAE;AAiBL,SAhBmB4C,EAAIuhC,GAAsB,CAACI,MAAsB;AAChE,UAAMC,IAAc5hC,EAAI2hC,EAAkB,MAAM,CAACnH,MAAeA,IAAa,CAAC;AAO9E,WAAO;AAAA,MACH,SAPgBxG,EAAe,+BAA+B;AAAA,QAC9D,cAAcrgB;AAAA,QACd,aAAa0tB;AAAA,QACb,kBAAkBO;AAAA,QAClB,YAAYD,EAAkB;AAAA,MAC1C,CAAS;AAAA,MAGG,MAAMtN,GAA0B;AAAA,MAChC,UAAU1gB,EAAK;AAAA,MACf,YAAY0tB,EAAY;AAAA,MACxB,cAAcM,EAAkB;AAAA,IAC5C;AAAA,EACI,CAAC;AAEL;AACO,SAASb,GAAmC7oB,GAAcopB,GAAa1tB,GAAMqgB,GAAgB;AAEhG,QAAM6N,IAAkBze,GAAOnL,GAAc,CAAC7a,GAAQu4B,GAASpS,MAAQ;AACnE,UAAMue,IAAkB9hC,EAAI21B,GAAS,CAACtD,OAC3B,EAAE,KAAK9O,GAAK,MAAM8O,EAAQ,EACpC;AACD,WAAOj1B,EAAO,OAAO0kC,CAAe;AAAA,EACxC,GAAG,CAAA,CAAE;AAuCL,SAtCezkC,GAAQ0C,GAAQ8hC,GAAiB,CAACE,MAAmB;AAGhE,QAFwBV,EAAY,WAAWU,EAAe,GAAG,EAE7C,sBAAsB;AACtC,aAAO,CAAA;AAEX,UAAMC,IAAYD,EAAe,KAC3BE,IAAaF,EAAe,MAC5BG,IAAmCld,GAAO6c,GAAiB,CAACM;AAAA;AAAA,MAI9Dd,EAAY,WAAWc,EAAiB,GAAG,EAAE,sBACzC,MACAA,EAAiB,MAAMH;AAAA;AAAA,MAGvBtF,GAAqByF,EAAiB,MAAMF,CAAU;AAAA,KAC7D;AAkBD,WAjB6BjiC,EAAIkiC,GAAkC,CAACE,MAAsB;AACtF,YAAMR,IAAc,CAACQ,EAAkB,MAAM,GAAGJ,IAAY,CAAC,GACvDzO,IAAa8N,EAAY,QAAQ,IAAI,KAAKA,EAAY;AAO5D,aAAO;AAAA,QACH,SAPYrN,EAAe,qCAAqC;AAAA,UAChE,cAAcrgB;AAAA,UACd,aAAa0tB;AAAA,UACb,kBAAkBO;AAAA,UAClB,YAAYQ,EAAkB;AAAA,QAC9C,CAAa;AAAA,QAGG,MAAM/N,GAA0B;AAAA,QAChC,UAAU1gB,EAAK;AAAA,QACf,YAAY4f;AAAA,QACZ,cAAcqO;AAAA,MAC9B;AAAA,IACQ,CAAC;AAAA,EAEL,CAAC,CAAC;AAEN;AACA,SAASpE,GAAuCzJ,GAAW9S,GAAY+S,GAAgB;AACnF,QAAM3P,IAAS,CAAA,GACTge,IAAariC,EAAIihB,GAAY,CAACqhB,MAAcA,EAAU,IAAI;AAChE,SAAAhpB,EAAQya,GAAW,CAACH,MAAa;AAC7B,UAAM2O,IAAe3O,EAAS;AAC9B,QAAIp1B,GAAS6jC,GAAYE,CAAY,GAAG;AACpC,YAAMrD,IAASlL,EAAe,4BAA4BJ,CAAQ;AAClE,MAAAvP,EAAO,KAAK;AAAA,QACR,SAAS6a;AAAA,QACT,MAAM7K,GAA0B;AAAA,QAChC,UAAUkO;AAAA,MAC1B,CAAa;AAAA,IACL;AAAA,EACJ,CAAC,GACMle;AACX;AC7aO,SAASyP,GAAe7tB,GAAS;AACpC,QAAMu8B,IAAgBthB,GAASjb,GAAS;AAAA,IACpC,gBAAgBysB;AAAA,EACxB,CAAK,GACK+P,IAAgB,CAAA;AACtB,SAAAnpB,EAAQrT,EAAQ,OAAO,CAAC0N,MAAS;AAC7B,IAAA8uB,EAAc9uB,EAAK,IAAI,IAAIA;AAAA,EAC/B,CAAC,GACM+uB,GAAkBD,GAAeD,EAAc,cAAc;AACxE;AACO,SAAStF,GAAgBj3B,GAAS;AACrC,SAAAA,IAAUib,GAASjb,GAAS;AAAA,IACxB,gBAAgB4sB;AAAA,EACxB,CAAK,GACM8P,GAAmB18B,EAAQ,OAAOA,EAAQ,YAAYA,EAAQ,gBAAgBA,EAAQ,WAAW;AAC5G;AClBA,MAAM28B,KAA6B,4BAC7BC,KAA0B,wBAC1BC,KAAuB,sBACvBC,KAAiC,8BACjCC,KAA8B;AAAA,EAChCJ;AAAA,EACAC;AAAA,EACAC;AAAA,EACAC;AACJ;AACA,OAAO,OAAOC,EAA2B;AAElC,SAASC,GAAuBvW,GAAO;AAE1C,SAAOluB,GAASwkC,IAA6BtW,EAAM,IAAI;AAC3D;AACA,MAAMwW,WAA6B,MAAM;AAAA,EACrC,YAAYt0B,GAASlB,GAAO;AACxB,UAAMkB,CAAO,GACb,KAAK,QAAQlB,GACb,KAAK,iBAAiB,CAAA,GAEtB,OAAO,eAAe,MAAM,WAAW,SAAS,GAE5C,MAAM,qBACN,MAAM,kBAAkB,MAAM,KAAK,WAAW;AAAA,EAEtD;AACJ;AACO,MAAMy1B,WAAiCD,GAAqB;AAAA,EAC/D,YAAYt0B,GAASlB,GAAO01B,GAAe;AACvC,UAAMx0B,GAASlB,CAAK,GACpB,KAAK,gBAAgB01B,GACrB,KAAK,OAAOR;AAAA,EAChB;AACJ;AACO,MAAMS,WAA6BH,GAAqB;AAAA,EAC3D,YAAYt0B,GAASlB,GAAO01B,GAAe;AACvC,UAAMx0B,GAASlB,CAAK,GACpB,KAAK,gBAAgB01B,GACrB,KAAK,OAAOP;AAAA,EAChB;AACJ;AACO,MAAMS,WAAmCJ,GAAqB;AAAA,EACjE,YAAYt0B,GAASlB,GAAO;AACxB,UAAMkB,GAASlB,CAAK,GACpB,KAAK,OAAOq1B;AAAA,EAChB;AACJ;AACO,MAAMQ,WAA2BL,GAAqB;AAAA,EACzD,YAAYt0B,GAASlB,GAAO01B,GAAe;AACvC,UAAMx0B,GAASlB,CAAK,GACpB,KAAK,gBAAgB01B,GACrB,KAAK,OAAON;AAAA,EAChB;AACJ;ACnDO,MAAMU,KAAiB,CAAA,GACjBC,KAA6B;AACnC,MAAMC,WAAgC,MAAM;AAAA,EAC/C,YAAY90B,GAAS;AACjB,UAAMA,CAAO,GACb,KAAK,OAAO60B;AAAA,EAChB;AACJ;AAIO,MAAME,GAAY;AAAA,EACrB,gBAAgB/X,GAAQ;AACpB,SAAK,mBAAmB,CAAA,GACxB,KAAK,gBAAgB,CAAA,GACrB,KAAK,kBAAkBnJ,EAAImJ,GAAQ,iBAAiB,IAC9CA,EAAO,kBACPgY,GAAsB,iBAIxB,KAAK,oBACL,KAAK,8BAA8BC;AAAA,EAE3C;AAAA,EACA,iBAAiB3qB,GAAS;AACtB,UAAM4qB,IAAc1S,GAAoBlY,GAAS,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACjF,WAAA4qB,EAAY,uBAAuB,IAC5BA;AAAA,EACX;AAAA,EACA,iCAAiC5qB,GAAS;AACtC,WAAO;AAAA,EACX;AAAA,EACA,gCAAgCA,GAAS;AACrC,WAAO;AAAA,EACX;AAAA,EACA,wBAAwB6qB,GAAaC,GAAiBC,GAAeC,GAAiB;AAElF,UAAMC,IAAgB,KAAK,oBAAmB,GACxCC,IAAkB,KAAK,iBAAgB,GACvCC,IAAiB,CAAA;AACvB,QAAIC,IAAoB;AACxB,UAAMC,IAAyB,KAAK,GAAG,CAAC;AACxC,QAAIjC,IAAY,KAAK,GAAG,CAAC;AACzB,UAAMkC,IAAuB,MAAM;AAC/B,YAAMpB,IAAgB,KAAK,GAAG,CAAC,GAGzB5qB,IAAM,KAAK,qBAAqB,0BAA0B;AAAA,QAC5D,UAAU0rB;AAAA,QACV,QAAQK;AAAA,QACR,UAAUnB;AAAA,QACV,UAAU,KAAK,oBAAmB;AAAA,MAClD,CAAa,GACK1W,IAAQ,IAAIyW,GAAyB3qB,GAAK+rB,GAAwB,KAAK,GAAG,CAAC,CAAC;AAElF,MAAA7X,EAAM,iBAAiBjtB,GAAU4kC,CAAc,GAC/C,KAAK,WAAW3X,CAAK;AAAA,IACzB;AACA,WAAO,CAAC4X;AAEJ,UAAI,KAAK,aAAahC,GAAW4B,CAAe,GAAG;AAC/C,QAAAM,EAAoB;AACpB;AAAA,MACJ,WACSP,EAAc,KAAK,IAAI,GAAG;AAE/B,QAAAO,EAAoB,GAEpBT,EAAY,MAAM,MAAMC,CAAe;AACvC;AAAA,MACJ,MACK,CAAI,KAAK,aAAa1B,GAAW6B,CAAa,IAC/CG,IAAoB,MAGpBhC,IAAY,KAAK,WAAU,GAC3B,KAAK,kBAAkBA,GAAW+B,CAAc;AAMxD,SAAK,iBAAiBD,CAAe;AAAA,EACzC;AAAA,EACA,kCAAkCK,GAAyBC,GAAYC,GAAU;AAkB7E,WAfI,EAAAA,MAAa,MAIb,KAAK,aAAa,KAAK,GAAG,CAAC,GAAGF,CAAuB,KAKrD,KAAK,oBAML,KAAK,yBAAyBA,GAAyB,KAAK,4BAA4BA,GAAyBC,CAAU,CAAC;AAAA,EAIpI;AAAA;AAAA,EAEA,4BAA4BxrB,GAAS0rB,GAAc;AAC/C,UAAMC,IAAc,KAAK,sBAAsB3rB,GAAS0rB,CAAY;AAEpE,WADgB,KAAK,0BAA0BC,CAAW;AAAA,EAE9D;AAAA,EACA,kBAAkBX,GAAiBY,GAAS;AACxC,QAAI,KAAK,mCAAmCZ,GAAiBY,CAAO;AAEhE,aADoB,KAAK,iBAAiBZ,CAAe;AAG7D,QAAI,KAAK,kCAAkCA,CAAe,GAAG;AACzD,YAAMa,IAAU,KAAK,WAAU;AAC/B,kBAAK,aAAY,GACVA;AAAA,IACX;AACA,UAAM,IAAIrB,GAAwB,eAAe;AAAA,EACrD;AAAA,EACA,yBAAyBsB,GAAeF,GAAS;AAC7C,WAAQ,KAAK,mCAAmCE,GAAeF,CAAO,KAClE,KAAK,kCAAkCE,CAAa;AAAA,EAC5D;AAAA,EACA,mCAAmCd,GAAiBY,GAAS;AAKzD,QAJI,CAAC,KAAK,iCAAiCZ,CAAe,KAItDhgB,GAAQ4gB,CAAO;AACf,aAAO;AAEX,UAAMG,IAAgB,KAAK,GAAG,CAAC;AAI/B,WAHiC5kB,GAAKykB,GAAS,CAACI,MACrC,KAAK,aAAaD,GAAeC,CAAsB,CACjE,MAAM;AAAA,EAEX;AAAA,EACA,kCAAkChB,GAAiB;AAC/C,WAAK,KAAK,gCAAgCA,CAAe,IAGvB,KAAK,aAAa,KAAK,GAAG,CAAC,GAAGA,CAAe,IAFpE;AAAA,EAIf;AAAA,EACA,yBAAyB/T,GAAc;AACnC,UAAMgV,IAAY,KAAK,iBAAgB,GACjCC,IAAuB,KAAK,0BAA0BD,CAAS;AACrE,WAAO3mC,GAAS4mC,GAAsBjV,CAAY;AAAA,EACtD;AAAA,EACA,sBAAsB;AAClB,UAAMkV,IAA4B,KAAK,iBAAgB;AAEvD,QAAIrM,IAAY,KAAK,GAAG,CAAC,GACrB9L,IAAI;AACR,eAAa;AACT,YAAMoY,IAAajlB,GAAKglB,GAA2B,CAACE,MAC/B/T,GAAawH,GAAWuM,CAAa,CAEzD;AACD,UAAID,MAAe;AACf,eAAOA;AAEX,MAAAtM,IAAY,KAAK,GAAG9L,CAAC,GACrBA;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,mBAAmB;AAEf,QAAI,KAAK,WAAW,WAAW;AAC3B,aAAOsW;AAEX,UAAMgC,IAAoB,KAAK,6BAA4B,GACrDC,IAAc,KAAK,mCAAkC,GACrDC,IAAoB,KAAK,iCAAgC;AAC/D,WAAO;AAAA,MACH,UAAU,KAAK,wBAAwBF,CAAiB;AAAA,MACxD,kBAAkBC;AAAA,MAClB,QAAQ,KAAK,wBAAwBC,CAAiB;AAAA,IAClE;AAAA,EACI;AAAA,EACA,0BAA0B;AACtB,UAAMC,IAAoB,KAAK,YACzBC,IAA0B,KAAK;AACrC,WAAO5lC,EAAI2lC,GAAmB,CAAC/T,GAAUrO,MACjCA,MAAQ,IACDigB,KAEJ;AAAA,MACH,UAAU,KAAK,wBAAwB5R,CAAQ;AAAA,MAC/C,kBAAkBgU,EAAwBriB,CAAG;AAAA,MAC7C,QAAQ,KAAK,wBAAwBoiB,EAAkBpiB,IAAM,CAAC,CAAC;AAAA,IAC/E,CACS;AAAA,EACL;AAAA,EACA,mBAAmB;AACf,UAAMsiB,IAAc7lC,EAAI,KAAK,wBAAuB,GAAI,CAAC+oB,MAC9C,KAAK,0BAA0BA,CAAO,CAChD;AACD,WAAO5L,GAAQ0oB,CAAW;AAAA,EAC9B;AAAA,EACA,0BAA0BV,GAAW;AACjC,QAAIA,MAAc3B;AACd,aAAO,CAACrS,EAAG;AAEf,UAAM5T,IAAa4nB,EAAU,WAAWA,EAAU,mBAAmB/nB,KAAK+nB,EAAU;AACpF,WAAO,KAAK,cAAc5nB,CAAU;AAAA,EACxC;AAAA;AAAA;AAAA,EAGA,kBAAkB7P,GAAOo4B,GAAc;AACnC,WAAK,KAAK,aAAap4B,GAAOyjB,EAAG,KAC7B2U,EAAa,KAAKp4B,CAAK,GAEpBo4B;AAAA,EACX;AAAA,EACA,SAAS5sB,GAAS;AACd,UAAMmrB,IAAiB,CAAA;AACvB,QAAIU,IAAU,KAAK,GAAG,CAAC;AACvB,WAAO,KAAK,aAAaA,GAAS7rB,CAAO,MAAM;AAC3C,MAAA6rB,IAAU,KAAK,WAAU,GACzB,KAAK,kBAAkBA,GAASV,CAAc;AAGlD,WAAO5kC,GAAU4kC,CAAc;AAAA,EACnC;AAAA,EACA,4BAA4B0B,GAAU5kC,GAAM6kC,GAAeC,GAAcC,GAAgBC,GAAgBxB,GAAU;AAAA,EAGnH;AAAA,EACA,sBAAsBzrB,GAAS0rB,GAAc;AACzC,UAAMwB,IAAgB,KAAK,0BAAyB,GAC9CC,IAAsB9b,GAAM,KAAK,qBAAqB;AAO5D,WANoB;AAAA,MAChB,WAAW6b;AAAA,MACX,iBAAiBC;AAAA,MACjB,SAASntB;AAAA,MACT,mBAAmB0rB;AAAA,IAC/B;AAAA,EAEI;AAAA,EACA,4BAA4B;AACxB,WAAO5kC,EAAI,KAAK,YAAY,CAACsmC,MAAkB,KAAK,wBAAwBA,CAAa,CAAC;AAAA,EAC9F;AACJ;AACO,SAASzC,GAA4BkC,GAAU5kC,GAAM6kC,GAAeC,GAAcC,GAAgBC,GAAgBxB,GAAU;AAC/H,QAAM/nC,IAAM,KAAK,4BAA4BqpC,GAAcC,CAAc;AACzE,MAAIK,IAAoB,KAAK,iBAAiB3pC,CAAG;AACjD,MAAI2pC,MAAsB,QAAW;AACjC,UAAMhE,IAAe,KAAK,oBAAmB,GACvCxK,IAAc,KAAK,mBAAkB,EAAGwK,CAAY;AAE1D,IAAAgE,IADe,IAAIJ,EAAepO,GAAamO,CAAc,EAClC,aAAY,GACvC,KAAK,iBAAiBtpC,CAAG,IAAI2pC;AAAA,EACjC;AACA,MAAI9B,IAA0B8B,EAAkB,OAC5C7B,IAAa6B,EAAkB;AACnC,QAAMC,IAAcD,EAAkB;AAWtC,EARI,KAAK,WAAW,WAAW,KAC3BC,KACA/B,MAA4B,WAC5BA,IAA0BtT,IAC1BuT,IAAa,IAIb,EAAAD,MAA4B,UAAaC,MAAe,WAGxD,KAAK,kCAAkCD,GAAyBC,GAAYC,CAAQ,KAIpF,KAAK,wBAAwBoB,GAAU5kC,GAAM6kC,GAAevB,CAAuB;AAE3F;AC1RO,MAAMgC,KAAuB,GACvBC,KAA0B,GAO1BC,KAAS,KAAKD,IACdE,KAAa,KAAKF,IAClBG,KAAW,KAAKH,IAChBI,KAAmB,KAAKJ,IACxBK,KAAe,KAAKL,IACpBM,KAAuB,KAAKN;AAElC,SAASO,GAA4BC,GAASjB,GAAc1S,GAAY;AAC3E,SAAOA,IAAa0S,IAAeiB;AACvC;AClBO,MAAMC,GAAqB;AAAA,EAC9B,YAAYlhC,GAAS;AACjB,QAAImhC;AACJ,SAAK,gBACAA,IAAuDnhC,GAAQ,kBAAkB,QAAQmhC,MAAO,SAASA,IAAKxD,GAAsB;AAAA,EAC7I;AAAA,EACA,SAAS39B,GAAS;AACd,UAAMohC,IAAsB,KAAK,wBAAwBphC,EAAQ,KAAK;AACtE,QAAIie,GAAQmjB,CAAmB,GAAG;AAC9B,YAAMC,IAAiB,KAAK,4BAA4BrhC,EAAQ,KAAK,GAC/DshC,IAAsB,KAAK,yCAAyCthC,EAAQ,OAAO,KAAK,YAAY,GACpGuhC,IAAwB,KAAK,kCAAkCvhC,EAAQ,OAAO,KAAK,YAAY;AAOrG,aANkB;AAAA,QACd,GAAGohC;AAAA,QACH,GAAGC;AAAA,QACH,GAAGC;AAAA,QACH,GAAGC;AAAA,MACnB;AAAA,IAEQ;AACA,WAAOH;AAAA,EACX;AAAA,EACA,wBAAwBxzB,GAAO;AAC3B,WAAO9T,GAAQ8T,GAAO,CAACqtB,MAAgB7B,GAAwB6B,GAAaA,GAAarO,EAAoC,CAAC;AAAA,EAClI;AAAA,EACA,4BAA4Bhf,GAAO;AAC/B,WAAO9T,GAAQ8T,GAAO,CAACqtB,MAAgBlB,GAA2BkB,GAAarO,EAAoC,CAAC;AAAA,EACxH;AAAA,EACA,yCAAyChf,GAAO8jB,GAAc;AAC1D,WAAO53B,GAAQ8T,GAAO,CAACqtB,MAAgBX,GAAyCW,GAAavJ,GAAc9E,EAAoC,CAAC;AAAA,EACpJ;AAAA,EACA,kCAAkChf,GAAO8jB,GAAc;AACnD,WAAOqJ,GAAkCntB,GAAO8jB,GAAc9E,EAAoC;AAAA,EACtG;AAAA,EACA,6BAA6B5sB,GAAS;AAClC,WAAO6xB,GAAwB7xB,EAAQ,gBAAgBA,EAAQ,MAAMA,EAAQ,cAAcA,EAAQ,eAAeA,EAAQ,sBAAsBsyB,EAA8B;AAAA,EAClL;AAAA,EACA,0BAA0BtyB,GAAS;AAC/B,WAAOoyB,GAAkCpyB,EAAQ,gBAAgBA,EAAQ,MAAMA,EAAQ,cAAcA,EAAQ,sBAAsBuxB,GAAYvxB,EAAQ,QAAQ,GAAGmzB,EAAuC;AAAA,EAC7M;AACJ;ACrCO,MAAMqO,GAAW;AAAA,EACpB,eAAe7b,GAAQ;AACnB,SAAK,uBAAuBnJ,EAAImJ,GAAQ,sBAAsB,IACxDA,EAAO,uBACPgY,GAAsB,sBAC5B,KAAK,eAAenhB,EAAImJ,GAAQ,cAAc,IACxCA,EAAO,eACPgY,GAAsB,cAC5B,KAAK,oBAAoBnhB,EAAImJ,GAAQ,mBAAmB,IAClDA,EAAO,oBACP,IAAIub,GAAqB,EAAE,cAAc,KAAK,aAAY,CAAE,GAClE,KAAK,sBAAsB,oBAAI,IAAG;AAAA,EACtC;AAAA,EACA,6BAA6BtzB,GAAO;AAChC,IAAAyF,EAAQzF,GAAO,CAAC+f,MAAa;AACzB,WAAK,WAAW,GAAGA,EAAS,IAAI,mBAAmB,MAAM;AACrD,cAAM,EAAE,aAAAyN,GAAa,YAAAqG,GAAY,QAAAhJ,GAAQ,qBAAAiJ,GAAqB,kCAAAC,GAAkC,yBAAAC,EAAuB,IAAMC,GAAelU,CAAQ;AACpJ,QAAAta,EAAQ+nB,GAAa,CAACF,MAAa;AAC/B,gBAAM4G,IAAU5G,EAAS,QAAQ,IAAI,KAAKA,EAAS;AACnD,eAAK,WAAW,GAAGjmB,GAAqBimB,CAAQ,CAAC,GAAG4G,CAAO,IAAI,MAAM;AACjE,kBAAMC,IAAS,KAAK,kBAAkB,6BAA6B;AAAA,cAC/D,gBAAgB7G,EAAS;AAAA,cACzB,MAAMvN;AAAA,cACN,cAAcuN,EAAS,gBAAgB,KAAK;AAAA,cAC5C,eAAeA,EAAS;AAAA,cACxB,sBAAsB,KAAK;AAAA,YACvD,CAAyB,GACKvkC,IAAMqqC,GAA4B,KAAK,oBAAoBrT,EAAS,IAAI,GAAG+S,IAAQxF,EAAS,GAAG;AACrG,iBAAK,eAAevkC,GAAKorC,CAAM;AAAA,UACnC,CAAC;AAAA,QACL,CAAC,GACD1uB,EAAQouB,GAAY,CAACvG,MAAa;AAC9B,eAAK,qBAAqBvN,GAAUuN,EAAS,KAAK0F,IAAU,cAAc1F,EAAS,cAAcjmB,GAAqBimB,CAAQ,CAAC;AAAA,QACnI,CAAC,GACD7nB,EAAQolB,GAAQ,CAACyC,MAAa;AAC1B,eAAK,qBAAqBvN,GAAUuN,EAAS,KAAKyF,IAAY,UAAUzF,EAAS,cAAcjmB,GAAqBimB,CAAQ,CAAC;AAAA,QACjI,CAAC,GACD7nB,EAAQquB,GAAqB,CAACxG,MAAa;AACvC,eAAK,qBAAqBvN,GAAUuN,EAAS,KAAK2F,IAAkB,uBAAuB3F,EAAS,cAAcjmB,GAAqBimB,CAAQ,CAAC;AAAA,QACpJ,CAAC,GACD7nB,EAAQsuB,GAAkC,CAACzG,MAAa;AACpD,eAAK,qBAAqBvN,GAAUuN,EAAS,KAAK6F,IAAsB,oCAAoC7F,EAAS,cAAcjmB,GAAqBimB,CAAQ,CAAC;AAAA,QACrK,CAAC,GACD7nB,EAAQuuB,GAAyB,CAAC1G,MAAa;AAC3C,eAAK,qBAAqBvN,GAAUuN,EAAS,KAAK4F,IAAc,2BAA2B5F,EAAS,cAAcjmB,GAAqBimB,CAAQ,CAAC;AAAA,QACpJ,CAAC;AAAA,MACL,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,qBAAqBxtB,GAAMuyB,GAAgB+B,GAASvQ,GAAUwQ,GAAkBC,GAAe;AAC3F,SAAK,WAAW,GAAGA,CAAa,GAAGjC,MAAmB,IAAI,KAAKA,CAAc,IAAI,MAAM;AACnF,YAAM8B,IAAS,KAAK,kBAAkB,0BAA0B;AAAA,QAC5D,gBAAA9B;AAAA,QACA,MAAAvyB;AAAA,QACA,cAAcu0B,KAAoB,KAAK;AAAA,QACvC,sBAAsB,KAAK;AAAA,QAC3B,UAAAxQ;AAAA,MAChB,CAAa,GACK96B,IAAMqqC,GAA4B,KAAK,oBAAoBtzB,EAAK,IAAI,GAAGs0B,GAAS/B,CAAc;AACpG,WAAK,eAAetpC,GAAKorC,CAAM;AAAA,IACnC,CAAC;AAAA,EACL;AAAA;AAAA,EAEA,4BAA4B/B,GAAc1S,GAAY;AAClD,UAAMiS,IAAoB,KAAK,6BAA4B;AAC3D,WAAOyB,GAA4BzB,GAAmBS,GAAc1S,CAAU;AAAA,EAClF;AAAA,EACA,mBAAmB32B,GAAK;AACpB,WAAO,KAAK,oBAAoB,IAAIA,CAAG;AAAA,EAC3C;AAAA;AAAA,EAEA,eAAeA,GAAKW,GAAO;AACvB,SAAK,oBAAoB,IAAIX,GAAKW,CAAK;AAAA,EAC3C;AACJ;AACA,MAAM6qC,WAAmCztB,GAAY;AAAA,EACjD,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,aAAa;AAAA,MACd,QAAQ,CAAA;AAAA,MACR,aAAa,CAAA;AAAA,MACb,YAAY,CAAA;AAAA,MACZ,yBAAyB,CAAA;AAAA,MACzB,qBAAqB,CAAA;AAAA,MACrB,kCAAkC,CAAA;AAAA,IAC9C;AAAA,EACI;AAAA,EACA,QAAQ;AACJ,SAAK,aAAa;AAAA,MACd,QAAQ,CAAA;AAAA,MACR,aAAa,CAAA;AAAA,MACb,YAAY,CAAA;AAAA,MACZ,yBAAyB,CAAA;AAAA,MACzB,qBAAqB,CAAA;AAAA,MACrB,kCAAkC,CAAA;AAAA,IAC9C;AAAA,EACI;AAAA,EACA,YAAY+jB,GAAQ;AAChB,SAAK,WAAW,OAAO,KAAKA,CAAM;AAAA,EACtC;AAAA,EACA,6BAA6BC,GAAS;AAClC,SAAK,WAAW,wBAAwB,KAAKA,CAAO;AAAA,EACxD;AAAA,EACA,yBAAyBC,GAAY;AACjC,SAAK,WAAW,oBAAoB,KAAKA,CAAU;AAAA,EACvD;AAAA,EACA,sCAAsCC,GAAe;AACjD,SAAK,WAAW,iCAAiC,KAAKA,CAAa;AAAA,EACvE;AAAA,EACA,gBAAgBC,GAAM;AAClB,SAAK,WAAW,WAAW,KAAKA,CAAI;AAAA,EACxC;AAAA,EACA,iBAAiBC,GAAI;AACjB,SAAK,WAAW,YAAY,KAAKA,CAAE;AAAA,EACvC;AACJ;AACA,MAAMjB,KAAmB,IAAIsK,GAA0B;AAChD,SAASN,GAAen0B,GAAM;AACjC,EAAAmqB,GAAiB,MAAK,GACtBnqB,EAAK,OAAOmqB,EAAgB;AAC5B,QAAMuK,IAAavK,GAAiB;AAEpC,SAAAA,GAAiB,MAAK,GACfuK;AACX;AC7HO,SAASC,GAA0BC,GAAkBC,GAAiB;AAEzE,EAAI,MAAMD,EAAiB,WAAW,MAAM,MAIxCA,EAAiB,cAAcC,EAAgB,aAC/CD,EAAiB,YAAYC,EAAgB,aAMxCD,EAAiB,YAAYC,EAAgB,cAClDD,EAAiB,YAAYC,EAAgB;AAErD;AAQO,SAASC,GAAoBF,GAAkBC,GAAiB;AAEnE,EAAI,MAAMD,EAAiB,WAAW,MAAM,MAIxCA,EAAiB,cAAcC,EAAgB,aAC/CD,EAAiB,cAAcC,EAAgB,aAC/CD,EAAiB,YAAYC,EAAgB,WAC7CD,EAAiB,YAAYC,EAAgB,WAC7CD,EAAiB,YAAYC,EAAgB,WAC7CD,EAAiB,UAAUC,EAAgB,WAMtCD,EAAiB,YAAYC,EAAgB,cAClDD,EAAiB,YAAYC,EAAgB,WAC7CD,EAAiB,YAAYC,EAAgB,WAC7CD,EAAiB,UAAUC,EAAgB;AAEnD;AACO,SAASE,GAAiB3lC,GAAM2K,GAAOi7B,GAAe;AACzD,EAAI5lC,EAAK,SAAS4lC,CAAa,MAAM,SACjC5lC,EAAK,SAAS4lC,CAAa,IAAI,CAACj7B,CAAK,IAGrC3K,EAAK,SAAS4lC,CAAa,EAAE,KAAKj7B,CAAK;AAE/C;AACO,SAASk7B,GAAqB7lC,GAAM6uB,GAAUiX,GAAY;AAC7D,EAAI9lC,EAAK,SAAS6uB,CAAQ,MAAM,SAC5B7uB,EAAK,SAAS6uB,CAAQ,IAAI,CAACiX,CAAU,IAGrC9lC,EAAK,SAAS6uB,CAAQ,EAAE,KAAKiX,CAAU;AAE/C;ACrEA,MAAMC,KAAO;AACN,SAASC,GAAe1mC,GAAK2mC,GAAW;AAC3C,SAAO,eAAe3mC,GAAKymC,IAAM;AAAA,IAC7B,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,UAAU;AAAA,IACV,OAAOE;AAAA,EACf,CAAK;AACL;ACNO,SAASC,GAAaC,GAAK1K,GAAO;AACrC,QAAM2K,IAAgBxsC,GAAKusC,CAAG,GACxBE,IAAsBD,EAAc;AAC1C,WAAS,IAAI,GAAG,IAAIC,GAAqB,KAAK;AAC1C,UAAMC,IAAgBF,EAAc,CAAC,GAC/BG,IAAiBJ,EAAIG,CAAa,GAClCE,IAAuBD,EAAe;AAC5C,aAASrc,IAAI,GAAGA,IAAIsc,GAAsBtc,KAAK;AAC3C,YAAMuc,IAAYF,EAAerc,CAAC;AAElC,MAAIuc,EAAU,iBAAiB,UAC3B,KAAKA,EAAU,IAAI,EAAEA,EAAU,UAAUhL,CAAK;AAAA,IAEtD;AAAA,EACJ;AAEJ;AACO,SAASiL,GAAqCtM,GAAa3pB,GAAW;AACzE,QAAMk2B,IAAqB,WAAY;AAAA,EAAE;AAIzC,EAAAX,GAAeW,GAAoBvM,IAAc,eAAe;AAChE,QAAMwM,IAAgB;AAAA,IAClB,OAAO,SAAUv7B,GAASowB,GAAO;AAQ7B,UANItgC,GAAQkQ,CAAO,MAGfA,IAAUA,EAAQ,CAAC,IAGnB,CAAAmU,GAAYnU,CAAO;AAGvB,eAAO,KAAKA,EAAQ,IAAI,EAAEA,EAAQ,UAAUowB,CAAK;AAAA,IACrD;AAAA,IACA,iBAAiB,WAAY;AACzB,YAAMoL,IAA2BC,GAAgB,MAAMr2B,CAAS;AAChE,UAAI,CAAC0Q,GAAQ0lB,CAAwB,GAAG;AACpC,cAAME,IAAgB9pC,EAAI4pC,GAA0B,CAACG,MAAiBA,EAAa,GAAG;AACtF,cAAM,MAAM,mCAAmC,KAAK,YAAY,IAAI;AAAA,GAC7DD,EAAc,KAAK;AAAA;AAAA,CAAM,EAAE,QAAQ,OAAO;AAAA,EAAM,CAAC,EAAE;AAAA,MAC9D;AAAA,IACJ;AAAA,EACR;AACI,SAAAJ,EAAmB,YAAYC,GAC/BD,EAAmB,UAAU,cAAcA,GAC3CA,EAAmB,cAAcl2B,GAC1Bk2B;AACX;AACO,SAASM,GAAyC7M,GAAa3pB,GAAWy2B,GAAiB;AAC9F,QAAMP,IAAqB,WAAY;AAAA,EAAE;AAIzC,EAAAX,GAAeW,GAAoBvM,IAAc,2BAA2B;AAC5E,QAAM+M,IAAoB,OAAO,OAAOD,EAAgB,SAAS;AACjE,SAAA3wB,EAAQ9F,GAAW,CAACoe,MAAa;AAC7B,IAAAsY,EAAkBtY,CAAQ,IAAIqX;AAAA,EAClC,CAAC,GACDS,EAAmB,YAAYQ,GAC/BR,EAAmB,UAAU,cAAcA,GACpCA;AACX;AACO,IAAIS;AAAA,CACV,SAAUA,GAA2B;AAClC,EAAAA,EAA0BA,EAA0B,mBAAsB,CAAC,IAAI,oBAC/EA,EAA0BA,EAA0B,iBAAoB,CAAC,IAAI;AACjF,GAAGA,OAA8BA,KAA4B,CAAA,EAAG;AACzD,SAASN,GAAgBO,GAAiB52B,GAAW;AAExD,SADsB62B,GAA0BD,GAAiB52B,CAAS;AAE9E;AACO,SAAS62B,GAA0BD,GAAiB52B,GAAW;AAClE,QAAM82B,IAAmBtlB,GAAOxR,GAAW,CAAC+uB,MACjC1gB,GAAWuoB,EAAgB7H,CAAY,CAAC,MAAM,EACxD,GACKle,IAASrkB,EAAIsqC,GAAkB,CAAC/H,OAC3B;AAAA,IACH,KAAK,4BAA4BA,CAAY,QAAS6H,EAAgB,YAAY,IAAI;AAAA,IACtF,MAAMD,GAA0B;AAAA,IAChC,YAAY5H;AAAA,EACxB,EACK;AACD,SAAOllC,GAAQgnB,CAAM;AACzB;ACjFO,MAAMkmB,GAAY;AAAA,EACrB,gBAAgB3e,GAAQ;AAOpB,QANA,KAAK,YAAY,CAAA,GAEjB,KAAK,YAAYA,EAAO,WACxB,KAAK,uBAAuBnJ,EAAImJ,GAAQ,sBAAsB,IACxDA,EAAO,uBACPgY,GAAsB,sBACxB,CAAC,KAAK;AACN,WAAK,2BAA2BjX,IAChC,KAAK,wBAAwBA,IAC7B,KAAK,kBAAkBA,IACvB,KAAK,qBAAqBA,IAC1B,KAAK,cAAcA;AAAA,aAGf,QAAQ,KAAK,KAAK,oBAAoB;AACtC,MAAI,KAAK,mBACL,KAAK,2BAA2B8b,IAChC,KAAK,0BAA0BA,IAC/B,KAAK,cAAc9b,IACnB,KAAK,yBAAyB,KAAK,uCAGnC,KAAK,2BAA2BA,IAChC,KAAK,0BAA0BA,IAC/B,KAAK,cAAc,KAAK,iBACxB,KAAK,yBAAyB,KAAK;AAAA,aAGlC,cAAc,KAAK,KAAK,oBAAoB;AACjD,MAAI,KAAK,mBACL,KAAK,2BAA2B2b,IAChC,KAAK,0BAA0BA,IAC/B,KAAK,cAAc3b,IACnB,KAAK,yBACD,KAAK,6CAGT,KAAK,2BAA2BA,IAChC,KAAK,0BAA0BA,IAC/B,KAAK,cAAc,KAAK,uBACxB,KAAK,yBACD,KAAK;AAAA,aAGR,QAAQ,KAAK,KAAK,oBAAoB;AAC3C,WAAK,2BAA2BA,IAChC,KAAK,0BAA0BA,IAC/B,KAAK,cAAcA,IACnB,KAAK,yBAAyBA;AAAA;AAG9B,YAAM,MAAM,kDAAkDf,EAAO,oBAAoB,GAAG;AAAA,EAGxG;AAAA,EACA,yCAAyCxd,GAAS;AAC9C,IAAAA,EAAQ,WAAW;AAAA,MACf,aAAa;AAAA,MACb,WAAW;AAAA,IACvB;AAAA,EACI;AAAA,EACA,wCAAwCA,GAAS;AAC7C,IAAAA,EAAQ,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA,MAKf,aAAa,KAAK,GAAG,CAAC,EAAE;AAAA,MACxB,WAAW;AAAA,IACvB;AAAA,EACI;AAAA,EACA,mCAAmCA,GAAS;AACxC,IAAAA,EAAQ,WAAW;AAAA,MACf,aAAa;AAAA,MACb,WAAW;AAAA,MACX,aAAa;AAAA,MACb,WAAW;AAAA,MACX,SAAS;AAAA,MACT,WAAW;AAAA,IACvB;AAAA,EACI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kCAAkCA,GAAS;AACvC,UAAM4qB,IAAY,KAAK,GAAG,CAAC;AAC3B,IAAA5qB,EAAQ,WAAW;AAAA,MACf,aAAa4qB,EAAU;AAAA,MACvB,WAAWA,EAAU;AAAA,MACrB,aAAaA,EAAU;AAAA,MACvB,WAAW;AAAA,MACX,SAAS;AAAA,MACT,WAAW;AAAA,IACvB;AAAA,EACI;AAAA,EACA,yBAAyBwR,GAAc;AACnC,UAAMp8B,IAAU;AAAA,MACZ,MAAMo8B;AAAA,MACN,UAAU,uBAAO,OAAO,IAAI;AAAA,IACxC;AACQ,SAAK,uBAAuBp8B,CAAO,GACnC,KAAK,UAAU,KAAKA,CAAO;AAAA,EAC/B;AAAA,EACA,wBAAwB;AACpB,SAAK,UAAU,IAAG;AAAA,EACtB;AAAA,EACA,gBAAgBq8B,GAAa;AAEzB,UAAMC,IAAY,KAAK,GAAG,CAAC,GACrBC,IAAMF,EAAY;AAGxB,IAAIE,EAAI,eAAeD,EAAU,eAC7BC,EAAI,YAAYD,EAAU,WAC1BC,EAAI,UAAUD,EAAU,SACxBC,EAAI,YAAYD,EAAU,cAI1BC,EAAI,cAAc,KAClBA,EAAI,YAAY,KAChBA,EAAI,cAAc;AAAA,EAE1B;AAAA,EACA,sBAAsBF,GAAa;AAC/B,UAAMC,IAAY,KAAK,GAAG,CAAC,GAErBC,IAAMF,EAAY;AAGxB,IAAIE,EAAI,eAAeD,EAAU,cAC7BC,EAAI,YAAYD,EAAU,YAI1BC,EAAI,cAAc;AAAA,EAE1B;AAAA,EACA,gBAAgB/tC,GAAKguC,GAAe;AAChC,UAAMC,IAAU,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AACxD,IAAAnC,GAAiBmC,GAASD,GAAehuC,CAAG,GAE5C,KAAK,yBAAyBiuC,EAAQ,UAAUD,CAAa;AAAA,EACjE;AAAA,EACA,mBAAmBE,GAAelZ,GAAU;AACxC,UAAMmZ,IAAa,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AAC3D,IAAAnC,GAAqBmC,GAAYnZ,GAAUkZ,CAAa,GAExD,KAAK,wBAAwBC,EAAW,UAAUD,EAAc,QAAQ;AAAA,EAC5E;AAAA,EACA,+BAA+B;AAC3B,QAAIvoB,GAAY,KAAK,yBAAyB,GAAG;AAC7C,YAAMyoB,IAA+BvB,GAAqC,KAAK,WAAW9sC,GAAK,KAAK,oBAAoB,CAAC;AACzH,kBAAK,4BAA4BquC,GAC1BA;AAAA,IACX;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,2CAA2C;AACvC,QAAIzoB,GAAY,KAAK,qCAAqC,GAAG;AACzD,YAAM0oB,IAAiBjB,GAAyC,KAAK,WAAWrtC,GAAK,KAAK,oBAAoB,GAAG,KAAK,8BAA8B;AACpJ,kBAAK,wCAAwCsuC,GACtCA;AAAA,IACX;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,+BAA+B;AAC3B,UAAMC,IAAY,KAAK;AACvB,WAAOA,EAAUA,EAAU,SAAS,CAAC;AAAA,EACzC;AAAA,EACA,mCAAmC;AAC/B,UAAMA,IAAY,KAAK;AACvB,WAAOA,EAAUA,EAAU,SAAS,CAAC;AAAA,EACzC;AAAA,EACA,qCAAqC;AACjC,UAAMC,IAAkB,KAAK;AAC7B,WAAOA,EAAgBA,EAAgB,SAAS,CAAC;AAAA,EACrD;AACJ;ACrLO,MAAMC,GAAa;AAAA,EACtB,mBAAmB;AACf,SAAK,YAAY,CAAA,GACjB,KAAK,kBAAkB,GACvB,KAAK,UAAU;AAAA,EACnB;AAAA,EACA,IAAI,MAAMC,GAAU;AAGhB,QAAI,KAAK,qBAAqB;AAC1B,YAAM,MAAM,kFAAkF;AAIlG,SAAK,MAAK,GACV,KAAK,YAAYA,GACjB,KAAK,kBAAkBA,EAAS;AAAA,EACpC;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA,EAEA,aAAa;AACT,WAAI,KAAK,WAAW,KAAK,UAAU,SAAS,KACxC,KAAK,aAAY,GACV,KAAK,GAAG,CAAC,KAGTC;AAAA,EAEf;AAAA;AAAA;AAAA,EAGA,GAAGj6B,GAAS;AACR,UAAMk6B,IAAY,KAAK,UAAUl6B;AACjC,WAAIk6B,IAAY,KAAK,KAAK,mBAAmBA,IAClCD,KAGA,KAAK,UAAUC,CAAS;AAAA,EAEvC;AAAA,EACA,eAAe;AACX,SAAK;AAAA,EACT;AAAA,EACA,mBAAmB;AACf,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,iBAAiBt7B,GAAU;AACvB,SAAK,UAAUA;AAAA,EACnB;AAAA,EACA,kBAAkB;AACd,SAAK,UAAU;AAAA,EACnB;AAAA,EACA,wBAAwB;AACpB,SAAK,UAAU,KAAK,UAAU,SAAS;AAAA,EAC3C;AAAA,EACA,mBAAmB;AACf,WAAO,KAAK,iBAAgB;AAAA,EAChC;AACJ;ACtDO,MAAMu7B,GAAc;AAAA,EACvB,OAAOC,GAAM;AACT,WAAOA,EAAK,KAAK,IAAI;AAAA,EACzB;AAAA,EACA,QAAQloB,GAAKrK,GAASjT,GAAS;AAC3B,WAAO,KAAK,gBAAgBiT,GAASqK,GAAKtd,CAAO;AAAA,EACrD;AAAA,EACA,QAAQsd,GAAKmoB,GAAYzlC,GAAS;AAC9B,WAAO,KAAK,gBAAgBylC,GAAYnoB,GAAKtd,CAAO;AAAA,EACxD;AAAA,EACA,OAAOsd,GAAKooB,GAAmB;AAC3B,WAAO,KAAK,eAAeA,GAAmBpoB,CAAG;AAAA,EACrD;AAAA,EACA,GAAGA,GAAKqoB,GAAY;AAChB,WAAO,KAAK,WAAWA,GAAYroB,CAAG;AAAA,EAC1C;AAAA,EACA,KAAKA,GAAKooB,GAAmB;AACzB,WAAO,KAAK,aAAapoB,GAAKooB,CAAiB;AAAA,EACnD;AAAA,EACA,WAAWpoB,GAAKooB,GAAmB;AAC/B,WAAO,KAAK,mBAAmBpoB,GAAKooB,CAAiB;AAAA,EACzD;AAAA,EACA,QAAQzyB,GAASjT,GAAS;AACtB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,SAASiT,GAASjT,GAAS;AACvB,WAAO,KAAK,gBAAgBiT,GAAS,GAAGjT,CAAO;AAAA,EACnD;AAAA,EACA,QAAQylC,GAAYzlC,GAAS;AACzB,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,SAASylC,GAAYzlC,GAAS;AAC1B,WAAO,KAAK,gBAAgBylC,GAAY,GAAGzlC,CAAO;AAAA,EACtD;AAAA,EACA,OAAO0lC,GAAmB;AACtB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,QAAQA,GAAmB;AACvB,WAAO,KAAK,eAAeA,GAAmB,CAAC;AAAA,EACnD;AAAA,EACA,GAAGC,GAAY;AACX,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,IAAIA,GAAY;AACZ,WAAO,KAAK,WAAWA,GAAY,CAAC;AAAA,EACxC;AAAA,EACA,KAAKD,GAAmB;AACpB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,MAAMA,GAAmB;AACrB,SAAK,aAAa,GAAGA,CAAiB;AAAA,EAC1C;AAAA,EACA,SAAS1lC,GAAS;AACd,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,UAAUA,GAAS;AACf,SAAK,qBAAqB,GAAGA,CAAO;AAAA,EACxC;AAAA,EACA,aAAa0lC,GAAmB;AAC5B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,cAAcA,GAAmB;AAC7B,WAAO,KAAK,mBAAmB,GAAGA,CAAiB;AAAA,EACvD;AAAA,EACA,cAAcA,GAAmB;AAC7B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,cAAcA,GAAmB;AAC7B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,cAAcA,GAAmB;AAC7B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,cAAcA,GAAmB;AAC7B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,cAAcA,GAAmB;AAC7B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,cAAcA,GAAmB;AAC7B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,cAAcA,GAAmB;AAC7B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,cAAcA,GAAmB;AAC7B,SAAK,mBAAmB,GAAGA,CAAiB;AAAA,EAChD;AAAA,EACA,iBAAiB1lC,GAAS;AACtB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,kBAAkBA,GAAS;AACvB,SAAK,2BAA2B,GAAGA,CAAO;AAAA,EAC9C;AAAA,EACA,KAAKQ,GAAMolC,GAAgBjgB,IAASkgB,IAAqB;AACrD,QAAIttC,GAAS,KAAK,mBAAmBiI,CAAI,GAAG;AAKxC,YAAMimB,IAAQ;AAAA,QACV,SALWmG,GAAqC,4BAA4B;AAAA,UAC5E,cAAcpsB;AAAA,UACd,aAAa,KAAK;AAAA,QAClC,CAAa;AAAA,QAGG,MAAM4tB,GAA0B;AAAA,QAChC,UAAU5tB;AAAA,MAC1B;AACY,WAAK,iBAAiB,KAAKimB,CAAK;AAAA,IACpC;AACA,SAAK,kBAAkB,KAAKjmB,CAAI;AAChC,UAAMslC,IAAqB,KAAK,WAAWtlC,GAAMolC,GAAgBjgB,CAAM;AACvE,gBAAKnlB,CAAI,IAAIslC,GACNA;AAAA,EACX;AAAA,EACA,cAActlC,GAAMglC,GAAM7f,IAASkgB,IAAqB;AACpD,UAAME,IAAa7M,GAAyB14B,GAAM,KAAK,mBAAmB,KAAK,SAAS;AACxF,SAAK,mBAAmB,KAAK,iBAAiB,OAAOulC,CAAU;AAC/D,UAAMD,IAAqB,KAAK,WAAWtlC,GAAMglC,GAAM7f,CAAM;AAC7D,gBAAKnlB,CAAI,IAAIslC,GACNA;AAAA,EACX;AAAA,EACA,UAAUhI,GAAa5iC,GAAM;AACzB,WAAO,WAAY;AAEf,WAAK,oBAAoB,KAAK,CAAC;AAC/B,YAAM8qC,IAAW,KAAK,eAAc;AACpC,UAAI;AACA,eAAAlI,EAAY,MAAM,MAAM5iC,CAAI,GAErB;AAAA,MACX,SACOuE,GAAG;AACN,YAAIu9B,GAAuBv9B,CAAC;AACxB,iBAAO;AAGP,cAAMA;AAAA,MAEd,UACZ;AACgB,aAAK,iBAAiBumC,CAAQ,GAC9B,KAAK,oBAAoB,IAAG;AAAA,MAChC;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA,EAEA,qBAAqB;AACjB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,+BAA+B;AAC3B,WAAO9xB,GAAiB7b,GAAO,KAAK,oBAAoB,CAAC;AAAA,EAC7D;AACJ;AC/TO,MAAM4tC,GAAiB;AAAA,EAC1B,qBAAqBC,GAAiBvgB,GAAQ;AAc1C,QAbA,KAAK,YAAY,KAAK,YAAY,MAElC,KAAK,sBAAsB,CAAA,GAC3B,KAAK,sBAAsB,CAAA,GAC3B,KAAK,mBAAmB,KACxB,KAAK,eAAe9B,IACpB,KAAK,aAAa,GAClB,KAAK,oBAAoB,CAAA,GACzB,KAAK,YAAY,CAAA,GACjB,KAAK,sBAAsB,CAAA,GAC3B,KAAK,aAAa,CAAA,GAClB,KAAK,wBAAwB,CAAA,GAC7B,KAAK,uBAAuB,CAAA,GACxBrH,EAAImJ,GAAQ,mBAAmB;AAC/B,YAAM,MAAM;AAAA;AAAA,sBAEgB;AAEhC,QAAI1tB,GAAQiuC,CAAe,GAAG;AAI1B,UAAIjoB,GAAQioB,CAAe;AACvB,cAAM,MAAM;AAAA;AAAA,2CAEqC;AAErD,UAAI,OAAOA,EAAgB,CAAC,EAAE,eAAgB;AAC1C,cAAM,MAAM;AAAA;AAAA,sBAEgB;AAAA,IAEpC;AACA,QAAIjuC,GAAQiuC,CAAe;AACvB,WAAK,YAAY/oB,GAAO+oB,GAAiB,CAAC9oB,GAAKnK,OAC3CmK,EAAInK,EAAQ,IAAI,IAAIA,GACbmK,IACR,CAAA,CAAE;AAAA,aAEAZ,EAAI0pB,GAAiB,OAAO,KACjCtsC,GAAMsd,GAAQ7e,GAAO6tC,EAAgB,KAAK,CAAC,GAAG/gB,EAAW,GAAG;AAC5D,YAAM9C,IAAgBnL,GAAQ7e,GAAO6tC,EAAgB,KAAK,CAAC,GACrDC,IAAenqC,GAAKqmB,CAAa;AACvC,WAAK,YAAYlF,GAAOgpB,GAAc,CAAC/oB,GAAKnK,OACxCmK,EAAInK,EAAQ,IAAI,IAAIA,GACbmK,IACR,CAAA,CAAE;AAAA,IACT,WACSgpB,GAASF,CAAe;AAC7B,WAAK,YAAY5hB,GAAM4hB,CAAe;AAAA;AAGtC,YAAM,IAAI,MAAM,wIACyD;AAI7E,SAAK,UAAU,MAAShb;AACxB,UAAM7I,IAAgB7F,EAAI0pB,GAAiB,OAAO,IAC5ChvB,GAAQ7e,GAAO6tC,EAAgB,KAAK,CAAC,IACrC7tC,GAAO6tC,CAAe,GACtBG,IAAwBzsC,GAAMyoB,GAAe,CAACikB,MAAqBroB,GAAQqoB,EAAiB,eAAe,CAAC;AAClH,SAAK,eAAeD,IACdxiB,KACAJ,IAINO,GAAkB3rB,GAAO,KAAK,SAAS,CAAC;AAAA,EAC5C;AAAA,EACA,WAAWszB,GAAU6Z,GAAM7f,GAAQ;AAC/B,QAAI,KAAK;AACL,YAAM,MAAM,iBAAiBgG,CAAQ;AAAA,6FAC6D;AAEtG,UAAM4a,IAAgB/pB,EAAImJ,GAAQ,eAAe,IAC3CA,EAAO,gBACPkgB,GAAoB,eACpBW,IAAoBhqB,EAAImJ,GAAQ,mBAAmB,IACnDA,EAAO,oBACPkgB,GAAoB,mBAGpBY,IAAY,KAAK,oBAAqBjG,KAAuBC;AACnE,SAAK,oBACL,KAAK,oBAAoBgG,CAAS,IAAI9a,GACtC,KAAK,oBAAoBA,CAAQ,IAAI8a;AACrC,QAAIC;AAGJ,WAAI,KAAK,cAAc,KACnBA,IAAoB,YAA8BxrC,GAAM;AACpD,UAAI;AACA,aAAK,0BAA0BurC,GAAW9a,GAAU,KAAK,UAAU,GACnE6Z,EAAK,MAAM,MAAMtqC,CAAI;AACrB,cAAMyrC,IAAM,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AACpD,oBAAK,YAAYA,CAAG,GACbA;AAAA,MACX,SACOlnC,GAAG;AACN,eAAO,KAAK,gBAAgBA,GAAG8mC,GAAeC,CAAiB;AAAA,MACnE,UAChB;AACoB,aAAK,uBAAsB;AAAA,MAC/B;AAAA,IACJ,IAGAE,IAAoB,YAAiCxrC,GAAM;AACvD,UAAI;AACA,oBAAK,0BAA0BurC,GAAW9a,GAAU,KAAK,UAAU,GAC5D6Z,EAAK,MAAM,MAAMtqC,CAAI;AAAA,MAChC,SACOuE,GAAG;AACN,eAAO,KAAK,gBAAgBA,GAAG8mC,GAAeC,CAAiB;AAAA,MACnE,UAChB;AACoB,aAAK,uBAAsB;AAAA,MAC/B;AAAA,IACJ,GAEuB,OAAO,OAAOE,GAAmB,EAAE,UAAA/a,GAAU,uBAAuB6Z,GAAM;AAAA,EAEzG;AAAA,EACA,gBAAgB,GAAGoB,GAAqBJ,GAAmB;AACvD,UAAMK,IAAqB,KAAK,WAAW,WAAW,GAKhDC,IAAgBF,KAAuB,CAAC,KAAK,eAAc,KAAM,KAAK;AAC5E,QAAI5J,GAAuB,CAAC,GAAG;AAC3B,YAAM+J,IAAa;AACnB,UAAID,GAAe;AACf,cAAM5I,IAAgB,KAAK,oBAAmB;AAC9C,YAAI,KAAK,yBAAyBA,CAAa;AAE3C,cADA6I,EAAW,iBAAiB,KAAK,SAAS7I,CAAa,GACnD,KAAK,WAAW;AAChB,kBAAM8I,IAAmB,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AACjE,mBAAAA,EAAiB,gBAAgB,IAC1BA;AAAA,UACX;AAEI,mBAAOR,EAAkB,CAAC;AAAA,aAG7B;AACD,cAAI,KAAK,WAAW;AAChB,kBAAMQ,IAAmB,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AACjE,YAAAA,EAAiB,gBAAgB,IACjCD,EAAW,mBAAmBC;AAAA,UAClC;AAEA,gBAAMD;AAAA,QACV;AAAA,MACJ,OACK;AAAA,YAAIF;AAEL,sBAAK,sBAAqB,GAGnBL,EAAkB,CAAC;AAI1B,cAAMO;AAAA;AAAA,IAEd;AAGI,YAAM;AAAA,EAEd;AAAA;AAAA,EAEA,eAAerB,GAAmBpY,GAAY;AAC1C,UAAM32B,IAAM,KAAK,4BAA4BgqC,IAAYrT,CAAU;AACnE,WAAO,KAAK,oBAAoBoY,GAAmBpY,GAAY32B,CAAG;AAAA,EACtE;AAAA,EACA,oBAAoB+uC,GAAmBpY,GAAY32B,GAAK;AACpD,QAAIqnC,IAAgB,KAAK,mBAAmBrnC,CAAG,GAC3Cga;AACJ,QAAI,OAAO+0B,KAAsB,YAAY;AACzC,MAAA/0B,IAAS+0B,EAAkB;AAC3B,YAAMhsC,IAAYgsC,EAAkB;AAEpC,UAAIhsC,MAAc,QAAW;AACzB,cAAMutC,IAAuBjJ;AAC7B,QAAAA,IAAgB,MACLtkC,EAAU,KAAK,IAAI,KAAKutC,EAAqB,KAAK,IAAI;AAAA,MAErE;AAAA,IACJ;AAEI,MAAAt2B,IAAS+0B;AAEb,QAAI1H,EAAc,KAAK,IAAI,MAAM;AAC7B,aAAOrtB,EAAO,KAAK,IAAI;AAAA,EAG/B;AAAA,EACA,mBAAmBsvB,GAAgByF,GAAmB;AAClD,UAAMwB,IAAQ,KAAK,4BAA4BrG,IAAkBZ,CAAc;AAC/E,WAAO,KAAK,wBAAwBA,GAAgByF,GAAmBwB,CAAK;AAAA,EAChF;AAAA,EACA,wBAAwBjH,GAAgByF,GAAmB/uC,GAAK;AAC5D,QAAIqnC,IAAgB,KAAK,mBAAmBrnC,CAAG,GAC3Cga;AACJ,QAAI,OAAO+0B,KAAsB,YAAY;AACzC,MAAA/0B,IAAS+0B,EAAkB;AAC3B,YAAMhsC,IAAYgsC,EAAkB;AAEpC,UAAIhsC,MAAc,QAAW;AACzB,cAAMutC,IAAuBjJ;AAC7B,QAAAA,IAAgB,MACLtkC,EAAU,KAAK,IAAI,KAAKutC,EAAqB,KAAK,IAAI;AAAA,MAErE;AAAA,IACJ;AAEI,MAAAt2B,IAAS+0B;AAEb,QAAI1H,EAAc,KAAK,IAAI,MAAM,IAAM;AACnC,UAAIU,IAAW,KAAK,mBAAmB/tB,CAAM;AAC7C,aAAOqtB,EAAc,KAAK,IAAI,MAAM,MAChCU,MAAa;AACb,QAAAA,IAAW,KAAK,mBAAmB/tB,CAAM;AAAA,IAEjD;AAEI,YAAM,KAAK,wBAAwBsvB,GAAgB3O,GAAU,sBAAsBoU,EAAkB,OAAO;AAMhH,SAAK,4BAA4B,KAAK,oBAAoB,CAACzF,GAAgByF,CAAiB,GAAG1H,GAAe6C,IAAkBZ,GAAgBnR,EAAiC;AAAA,EACrL;AAAA,EACA,2BAA2BmR,GAAgBjgC,GAAS;AAChD,UAAMknC,IAAQ,KAAK,4BAA4BnG,IAAsBd,CAAc;AACnF,SAAK,gCAAgCA,GAAgBjgC,GAASknC,CAAK;AAAA,EACvE;AAAA,EACA,gCAAgCjH,GAAgBjgC,GAASrJ,GAAK;AAC1D,UAAMga,IAAS3Q,EAAQ,KACjBzB,IAAYyB,EAAQ;AAG1B,QAFoC,KAAK,mBAAmBrJ,CAAG,EAE/B,KAAK,IAAI,MAAM,IAAM;AACjD,MAAAga,EAAO,KAAK,IAAI;AAGhB,YAAMw2B,IAAyB,MACpB,KAAK,aAAa,KAAK,GAAG,CAAC,GAAG5oC,CAAS;AAGlD,aAAO,KAAK,aAAa,KAAK,GAAG,CAAC,GAAGA,CAAS,MAAM;AAGhD,aAAK,QAAQA,CAAS,GAEtBoS,EAAO,KAAK,IAAI;AAGpB,WAAK,4BAA4B,KAAK,6BAA6B;AAAA,QAC/DsvB;AAAA,QACA1hC;AAAA,QACA4oC;AAAA,QACAx2B;AAAA,QACAqe;AAAA,MAChB,GAAemY,GAAwBpG,IAAsBd,GAAgBjR,EAAoC;AAAA,IACzG;AAEI,YAAM,KAAK,wBAAwBiR,GAAgB3O,GAAU,qCAAqCtxB,EAAQ,OAAO;AAAA,EAEzH;AAAA,EACA,aAAaigC,GAAgByF,GAAmB;AAC5C,UAAMwB,IAAQ,KAAK,4BAA4BtG,IAAUX,CAAc;AACvE,WAAO,KAAK,kBAAkBA,GAAgByF,GAAmBwB,CAAK;AAAA,EAC1E;AAAA,EACA,kBAAkBjH,GAAgByF,GAAmB/uC,GAAK;AACtD,QAAIywC,IAAoB,KAAK,mBAAmBzwC,CAAG,GAC/Cga;AACJ,QAAI,OAAO+0B,KAAsB,YAAY;AACzC,MAAA/0B,IAAS+0B,EAAkB;AAC3B,YAAMhsC,IAAYgsC,EAAkB;AAEpC,UAAIhsC,MAAc,QAAW;AACzB,cAAMutC,IAAuBG;AAC7B,QAAAA,IAAoB,MACT1tC,EAAU,KAAK,IAAI,KAAKutC,EAAqB,KAAK,IAAI;AAAA,MAErE;AAAA,IACJ;AAEI,MAAAt2B,IAAS+0B;AAEb,QAAIhH,IAAW;AACf,WAAO0I,EAAkB,KAAK,IAAI,MAAM,MAAQ1I,MAAa;AACzD,MAAAA,IAAW,KAAK,mBAAmB/tB,CAAM;AAG7C,SAAK;AAAA,MAA4B,KAAK;AAAA,MAAc,CAACsvB,GAAgByF,CAAiB;AAAA,MAAG0B;AAAA,MAAmBxG;AAAA,MAAUX;AAAA,MAAgBxR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMtIiQ;AAAA,IAAQ;AAAA,EACZ;AAAA,EACA,qBAAqBuB,GAAgBjgC,GAAS;AAC1C,UAAMknC,IAAQ,KAAK,4BAA4BpG,IAAcb,CAAc;AAC3E,SAAK,0BAA0BA,GAAgBjgC,GAASknC,CAAK;AAAA,EACjE;AAAA,EACA,0BAA0BjH,GAAgBjgC,GAASrJ,GAAK;AACpD,UAAMga,IAAS3Q,EAAQ,KACjBzB,IAAYyB,EAAQ;AAG1B,QAF6B,KAAK,mBAAmBrJ,CAAG,EAE/B,KAAK,IAAI,MAAM,IAAM;AAC1C,MAAAga,EAAO,KAAK,IAAI;AAChB,YAAMw2B,IAAyB,MACpB,KAAK,aAAa,KAAK,GAAG,CAAC,GAAG5oC,CAAS;AAGlD,aAAO,KAAK,aAAa,KAAK,GAAG,CAAC,GAAGA,CAAS,MAAM;AAGhD,aAAK,QAAQA,CAAS,GAEtBoS,EAAO,KAAK,IAAI;AAGpB,WAAK,4BAA4B,KAAK,6BAA6B;AAAA,QAC/DsvB;AAAA,QACA1hC;AAAA,QACA4oC;AAAA,QACAx2B;AAAA,QACAie;AAAA,MAChB,GAAeuY,GAAwBrG,IAAcb,GAAgBrR,EAA8B;AAAA,IAC3F;AAAA,EACJ;AAAA,EACA,4BAA4BqR,GAAgB1hC,GAAW4oC,GAAwBx2B,GAAQ02B,GAAyB;AAC5G,WAAOF,EAAsB;AAGzB,WAAK,QAAQ5oC,CAAS,GACtBoS,EAAO,KAAK,IAAI;AAQpB,SAAK,4BAA4B,KAAK,6BAA6B;AAAA,MAC/DsvB;AAAA,MACA1hC;AAAA,MACA4oC;AAAA,MACAx2B;AAAA,MACA02B;AAAA,IACZ,GAAWF,GAAwBpG,IAAsBd,GAAgBoH,CAAuB;AAAA,EAC5F;AAAA,EACA,mBAAmB12B,GAAQ;AACvB,UAAM22B,IAAkB,KAAK,iBAAgB;AAC7C,WAAA32B,EAAO,KAAK,IAAI,GACO,KAAK,iBAAgB,IAGpB22B;AAAA,EAC5B;AAAA,EACA,WAAW3B,GAAYrY,GAAY;AAC/B,UAAM4Z,IAAQ,KAAK,4BAA4BxG,IAAQpT,CAAU,GAC3DnjB,IAAOlS,GAAQ0tC,CAAU,IAAIA,IAAaA,EAAW,KAErD4B,IADS,KAAK,mBAAmBL,CAAK,EAChB,KAAK,MAAM/8B,CAAI;AAC3C,QAAIo9B,MAAiB;AAEjB,aAD0Bp9B,EAAKo9B,CAAY,EAClB,IAAI,KAAK,IAAI;AAE1C,SAAK,oBAAoBja,GAAYqY,EAAW,OAAO;AAAA,EAC3D;AAAA,EACA,yBAAyB;AAKrB,QAJA,KAAK,WAAW,IAAG,GACnB,KAAK,sBAAsB,IAAG,GAE9B,KAAK,sBAAqB,GACtB,KAAK,WAAW,WAAW,KAAK,KAAK,eAAc,MAAO,IAAO;AACjE,YAAM6B,IAAoB,KAAK,GAAG,CAAC,GAC7BvO,IAAS,KAAK,qBAAqB,8BAA8B;AAAA,QACnE,gBAAgBuO;AAAA,QAChB,UAAU,KAAK,oBAAmB;AAAA,MAClD,CAAa;AACD,WAAK,WAAW,IAAInK,GAA2BpE,GAAQuO,CAAiB,CAAC;AAAA,IAC7E;AAAA,EACJ;AAAA,EACA,gBAAgB/B,GAAYnoB,GAAKtd,GAAS;AACtC,QAAI4iC;AACJ,QAAI;AACA,YAAM1nC,IAAO8E,MAAY,SAAYA,EAAQ,OAAO;AACpD,kBAAK,aAAasd,GAClBslB,IAAa6C,EAAW,MAAM,MAAMvqC,CAAI,GACxC,KAAK,mBAAmB0nC,GAAY5iC,MAAY,UAAaA,EAAQ,UAAU,SACzEA,EAAQ,QACRylC,EAAW,QAAQ,GAClB7C;AAAA,IACX,SACOnjC,GAAG;AACN,YAAM,KAAK,qBAAqBA,GAAGO,GAASylC,EAAW,QAAQ;AAAA,IACnE;AAAA,EACJ;AAAA,EACA,qBAAqB,GAAGzlC,GAAS2rB,GAAU;AACvC,UAAIqR,GAAuB,CAAC,KAAK,EAAE,qBAAqB,WACpD,KAAK,mBAAmB,EAAE,kBAAkBh9B,MAAY,UAAaA,EAAQ,UAAU,SACjFA,EAAQ,QACR2rB,CAAQ,GACd,OAAO,EAAE,mBAEP;AAAA,EACV;AAAA,EACA,gBAAgB1Y,GAASqK,GAAKtd,GAAS;AACnC,QAAI2kC;AACJ,QAAI;AACA,YAAM5R,IAAY,KAAK,GAAG,CAAC;AAC3B,MAAI,KAAK,aAAaA,GAAW9f,CAAO,MAAM,MAC1C,KAAK,aAAY,GACjB0xB,IAAgB5R,KAGhB,KAAK,qBAAqB9f,GAAS8f,GAAW/yB,CAAO;AAAA,IAE7D,SACOynC,GAAkB;AACrB,MAAA9C,IAAgB,KAAK,wBAAwB1xB,GAASqK,GAAKmqB,CAAgB;AAAA,IAC/E;AACA,gBAAK,gBAAgBznC,MAAY,UAAaA,EAAQ,UAAU,SAC1DA,EAAQ,QACRiT,EAAQ,MAAM0xB,CAAa,GAC1BA;AAAA,EACX;AAAA,EACA,qBAAqB1xB,GAAS8f,GAAW/yB,GAAS;AAC9C,QAAIuS;AACJ,UAAM4qB,IAAgB,KAAK,GAAG,CAAC;AAC/B,UAAIn9B,MAAY,UAAaA,EAAQ,UACjCuS,IAAMvS,EAAQ,UAGduS,IAAM,KAAK,qBAAqB,0BAA0B;AAAA,MACtD,UAAUU;AAAA,MACV,QAAQ8f;AAAA,MACR,UAAUoK;AAAA,MACV,UAAU,KAAK,oBAAmB;AAAA,IAClD,CAAa,GAEC,KAAK,WAAW,IAAID,GAAyB3qB,GAAKwgB,GAAWoK,CAAa,CAAC;AAAA,EACrF;AAAA,EACA,wBAAwBlqB,GAASqK,GAAKmqB,GAAkB;AAGpD,QAAI,KAAK;AAAA,IAELA,EAAiB,SAAS,8BAC1B,CAAC,KAAK,kBAAkB;AACxB,YAAM5I,IAAU,KAAK,4BAA4B5rB,GAASqK,CAAG;AAC7D,UAAI;AACA,eAAO,KAAK,kBAAkBrK,GAAS4rB,CAAO;AAAA,MAClD,SACO6I,GAAqB;AACxB,cAAIA,EAAoB,SAASlK,KAGvBiK,IAGAC;AAAA,MAEd;AAAA,IACJ;AAEI,YAAMD;AAAA,EAEd;AAAA,EACA,iBAAiB;AAEb,UAAME,IAAc,KAAK,QACnBC,IAAiBtjB,GAAM,KAAK,UAAU;AAC5C,WAAO;AAAA,MACH,QAAQqjB;AAAA,MACR,YAAY,KAAK,iBAAgB;AAAA,MACjC,YAAYC;AAAA,MACZ,WAAW,KAAK;AAAA,IAC5B;AAAA,EACI;AAAA,EACA,iBAAiB59B,GAAU;AACvB,SAAK,SAASA,EAAS,QACvB,KAAK,iBAAiBA,EAAS,UAAU,GACzC,KAAK,aAAaA,EAAS;AAAA,EAC/B;AAAA,EACA,0BAA0By8B,GAAWoB,GAAUC,GAAkB;AAC7D,SAAK,sBAAsB,KAAKA,CAAgB,GAChD,KAAK,WAAW,KAAKrB,CAAS,GAE9B,KAAK,yBAAyBoB,CAAQ;AAAA,EAC1C;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,oBAAoB,WAAW;AAAA,EAC/C;AAAA,EACA,sBAAsB;AAClB,UAAMpB,IAAY,KAAK,6BAA4B;AACnD,WAAO,KAAK,oBAAoBA,CAAS;AAAA,EAC7C;AAAA,EACA,wBAAwBA,GAAW;AAC/B,WAAO,KAAK,oBAAoBA,CAAS;AAAA,EAC7C;AAAA,EACA,iBAAiB;AACb,WAAO,KAAK,aAAa,KAAK,GAAG,CAAC,GAAGvb,EAAG;AAAA,EAC5C;AAAA,EACA,QAAQ;AACJ,SAAK,gBAAe,GACpB,KAAK,aAAa,GAClB,KAAK,sBAAsB,CAAA,GAC3B,KAAK,SAAS,CAAA,GACd,KAAK,aAAa,CAAA,GAElB,KAAK,YAAY,CAAA,GACjB,KAAK,wBAAwB,CAAA;AAAA,EACjC;AACJ;ACrhBO,MAAM6c,GAAa;AAAA,EACtB,iBAAiBpiB,GAAQ;AACrB,SAAK,UAAU,CAAA,GACf,KAAK,uBAAuBnJ,EAAImJ,GAAQ,sBAAsB,IACxDA,EAAO,uBACPgY,GAAsB;AAAA,EAChC;AAAA,EACA,WAAWlX,GAAO;AACd,QAAIuW,GAAuBvW,CAAK;AAC5B,aAAAA,EAAM,UAAU;AAAA,QACZ,WAAW,KAAK,0BAAyB;AAAA,QACzC,qBAAqBnC,GAAM,KAAK,qBAAqB;AAAA,MACrE,GACY,KAAK,QAAQ,KAAKmC,CAAK,GAChBA;AAGP,UAAM,MAAM,6DAA6D;AAAA,EAEjF;AAAA,EACA,IAAI,SAAS;AACT,WAAOnC,GAAM,KAAK,OAAO;AAAA,EAC7B;AAAA,EACA,IAAI,OAAO0jB,GAAW;AAClB,SAAK,UAAUA;AAAA,EACnB;AAAA;AAAA,EAEA,wBAAwB1a,GAAYmE,GAAUwW,GAAmB;AAC7D,UAAMtc,IAAW,KAAK,oBAAmB,GACnCmG,IAAc,KAAK,mBAAkB,EAAGnG,CAAQ,GAEhDuc,IAD+BtW,GAAiCtE,GAAYwE,GAAaL,GAAU,KAAK,YAAY,EACrE,CAAC,GAChD0W,IAAe,CAAA;AACrB,aAAS/oC,IAAI,GAAGA,KAAK,KAAK,cAAcA;AACpC,MAAA+oC,EAAa,KAAK,KAAK,GAAG/oC,CAAC,CAAC;AAEhC,UAAMmT,IAAM,KAAK,qBAAqB,sBAAsB;AAAA,MACxD,wBAAwB21B;AAAA,MACxB,QAAQC;AAAA,MACR,UAAU,KAAK,GAAG,CAAC;AAAA,MACnB,uBAAuBF;AAAA,MACvB,UAAUtc;AAAA,IACtB,CAAS;AACD,UAAM,KAAK,WAAW,IAAI2R,GAAmB/qB,GAAK,KAAK,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;AAAA,EAC7E;AAAA;AAAA,EAEA,oBAAoB+a,GAAY8a,GAAa;AACzC,UAAMzc,IAAW,KAAK,oBAAmB,GACnCmG,IAAc,KAAK,mBAAkB,EAAGnG,CAAQ,GAEhD0c,IAA+B1W,GAAuBrE,GAAYwE,GAAa,KAAK,YAAY,GAChGqW,IAAe,CAAA;AACrB,aAAS/oC,IAAI,GAAGA,KAAK,KAAK,cAAcA;AACpC,MAAA+oC,EAAa,KAAK,KAAK,GAAG/oC,CAAC,CAAC;AAEhC,UAAM+9B,IAAgB,KAAK,GAAG,CAAC,GACzBlE,IAAS,KAAK,qBAAqB,wBAAwB;AAAA,MAC7D,qBAAqBoP;AAAA,MACrB,QAAQF;AAAA,MACR,UAAUhL;AAAA,MACV,uBAAuBiL;AAAA,MACvB,UAAU,KAAK,oBAAmB;AAAA,IAC9C,CAAS;AACD,UAAM,KAAK,WAAW,IAAIhL,GAAqBnE,GAAQ,KAAK,GAAG,CAAC,GAAGkE,CAAa,CAAC;AAAA,EACrF;AACJ;ACtEO,MAAMmL,GAAc;AAAA,EACvB,oBAAoB;AAAA,EAAE;AAAA,EACtB,qBAAqBC,GAAeC,GAAgB;AAChD,UAAMC,IAAgB,KAAK,qBAAqBF,CAAa;AAC7D,QAAIjsB,GAAYmsB,CAAa;AACzB,YAAM,MAAM,UAAUF,CAAa,oCAAoC;AAE3E,WAAO5Y,GAAwB,CAAC8Y,CAAa,GAAGD,GAAgB,KAAK,cAAc,KAAK,YAAY;AAAA,EACxG;AAAA;AAAA;AAAA,EAGA,0BAA0B5J,GAAa;AACnC,UAAM8J,IAAch6B,GAAMkwB,EAAY,SAAS,GAEzC+J,IADkB,KAAK,mBAAkB,EACTD,CAAW;AAEjD,WAD+B,IAAIpa,GAAqBqa,GAAe/J,CAAW,EAAE,aAAY;AAAA,EAEpG;AACJ;ACbA,MAAMgK,KAAwB;AAAA,EAC1B,aAAa;AACjB;AACA,OAAO,OAAOA,EAAqB;AACnC,MAAMC,KAAmB,IACnBC,KAAiB,KAAK,IAAI,GAAGrI,EAAuB,IAAI,GACxDsI,KAAM/d,GAAY,EAAE,MAAM,yBAAyB,SAAS1P,GAAM,IAAI;AAC5E0I,GAAkB,CAAC+kB,EAAG,CAAC;AACvB,MAAMC,KAAwB7d;AAAA,EAAoB4d;AAAA,EAAK;AAAA;AAAA;AAAA;AAAA,EAKvD;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAE;AACtB,OAAO,OAAOC,EAAqB;AACnC,MAAMC,KAA0B;AAAA,EAC5B,MAAM;AAAA;AAAA,EAEN,UAAU,CAAA;AACd;AAIO,MAAMC,GAAa;AAAA,EACtB,iBAAiBvjB,GAAQ;AACrB,SAAK,qBAAqB,CAAA,GAC1B,KAAK,kBAAkB;AAAA,EAC3B;AAAA,EACA,kBAAkB;AACd,SAAK,kBAAkB,IACvB,KAAK,WAAW,oBAAoB,MAAM;AAUtC,eAASvmB,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,cAAMke,IAAMle,IAAI,IAAIA,IAAI;AACxB,aAAK,UAAUke,CAAG,EAAE,IAAI,SAAU6rB,GAAMC,GAAM;AAC1C,iBAAO,KAAK,sBAAsBD,GAAM/pC,GAAGgqC,CAAI;AAAA,QACnD,GACA,KAAK,UAAU9rB,CAAG,EAAE,IAAI,SAAU6rB,GAAMC,GAAM;AAC1C,iBAAO,KAAK,sBAAsBD,GAAM/pC,GAAGgqC,CAAI;AAAA,QACnD,GACA,KAAK,SAAS9rB,CAAG,EAAE,IAAI,SAAU6rB,GAAM;AACnC,iBAAO,KAAK,qBAAqBA,GAAM/pC,CAAC;AAAA,QAC5C,GACA,KAAK,KAAKke,CAAG,EAAE,IAAI,SAAU6rB,GAAM;AAC/B,iBAAO,KAAK,iBAAiBA,GAAM/pC,CAAC;AAAA,QACxC,GACA,KAAK,OAAOke,CAAG,EAAE,IAAI,SAAU6rB,GAAM;AACjC,eAAK,mBAAmB/pC,GAAG+pC,CAAI;AAAA,QACnC,GACA,KAAK,WAAW7rB,CAAG,EAAE,IAAI,SAAU6rB,GAAM;AACrC,eAAK,2BAA2B/pC,GAAG+pC,CAAI;AAAA,QAC3C,GACA,KAAK,eAAe7rB,CAAG,EAAE,IAAI,SAAU6rB,GAAM;AACzC,eAAK,yBAAyB/pC,GAAG+pC,CAAI;AAAA,QACzC,GACA,KAAK,mBAAmB7rB,CAAG,EAAE,IAAI,SAAU6rB,GAAM;AAC7C,eAAK,iCAAiC/pC,GAAG+pC,CAAI;AAAA,QACjD;AAAA,MACJ;AAEA,WAAK,UAAa,SAAU7rB,GAAK6rB,GAAMC,GAAM;AACzC,eAAO,KAAK,sBAAsBD,GAAM7rB,GAAK8rB,CAAI;AAAA,MACrD,GACA,KAAK,UAAa,SAAU9rB,GAAK6rB,GAAMC,GAAM;AACzC,eAAO,KAAK,sBAAsBD,GAAM7rB,GAAK8rB,CAAI;AAAA,MACrD,GACA,KAAK,SAAY,SAAU9rB,GAAK6rB,GAAM;AAClC,eAAO,KAAK,qBAAqBA,GAAM7rB,CAAG;AAAA,MAC9C,GACA,KAAK,KAAQ,SAAUA,GAAK6rB,GAAM;AAC9B,eAAO,KAAK,iBAAiBA,GAAM7rB,CAAG;AAAA,MAC1C,GACA,KAAK,OAAU,SAAUA,GAAK6rB,GAAM;AAChC,aAAK,mBAAmB7rB,GAAK6rB,CAAI;AAAA,MACrC,GACA,KAAK,aAAgB,SAAU7rB,GAAK6rB,GAAM;AACtC,aAAK,yBAAyB7rB,GAAK6rB,CAAI;AAAA,MAC3C,GACA,KAAK,SAAS,KAAK,eACnB,KAAK,YAAY,KAAK,kBACtB,KAAK,KAAK,KAAK;AAAA,IACnB,CAAC;AAAA,EACL;AAAA,EACA,mBAAmB;AACf,SAAK,kBAAkB,IAKvB,KAAK,WAAW,8BAA8B,MAAM;AAChD,YAAME,IAAO;AACb,eAASjqC,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,cAAMke,IAAMle,IAAI,IAAIA,IAAI;AACxB,eAAOiqC,EAAK,UAAU/rB,CAAG,EAAE,GAC3B,OAAO+rB,EAAK,UAAU/rB,CAAG,EAAE,GAC3B,OAAO+rB,EAAK,SAAS/rB,CAAG,EAAE,GAC1B,OAAO+rB,EAAK,KAAK/rB,CAAG,EAAE,GACtB,OAAO+rB,EAAK,OAAO/rB,CAAG,EAAE,GACxB,OAAO+rB,EAAK,WAAW/rB,CAAG,EAAE,GAC5B,OAAO+rB,EAAK,eAAe/rB,CAAG,EAAE,GAChC,OAAO+rB,EAAK,mBAAmB/rB,CAAG,EAAE;AAAA,MACxC;AACA,aAAO+rB,EAAK,SACZ,OAAOA,EAAK,SACZ,OAAOA,EAAK,QACZ,OAAOA,EAAK,IACZ,OAAOA,EAAK,MACZ,OAAOA,EAAK,YACZ,OAAOA,EAAK,QACZ,OAAOA,EAAK,WACZ,OAAOA,EAAK;AAAA,IAChB,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc7D,GAAM;AAAA,EAEpB;AAAA;AAAA,EAEA,iBAAiB1H,GAAa5iC,GAAM;AAChC,WAAO,MAAM;AAAA,EACjB;AAAA;AAAA;AAAA,EAGA,UAAUkQ,GAAS;AAGf,WAAOi6B;AAAA,EACX;AAAA,EACA,mBAAmB7kC,GAAM8oC,GAAK;AAC1B,QAAI;AACA,YAAMC,IAAkB,IAAI71B,GAAK,EAAE,YAAY,IAAI,MAAMlT,GAAM;AAC/D,aAAA+oC,EAAgB,OAAO/oC,GACvB,KAAK,mBAAmB,KAAK+oC,CAAe,GAC5CD,EAAI,KAAK,IAAI,GACb,KAAK,mBAAmB,IAAG,GACpBC;AAAA,IACX,SACOC,GAAe;AAClB,UAAIA,EAAc,yBAAyB;AACvC,YAAI;AACA,UAAAA,EAAc,UACVA,EAAc,UACV;AAAA;AAAA;AAAA,QAEZ,QACwB;AAEpB,gBAAMA;AAAA,QACV;AAEJ,YAAMA;AAAA,IACV;AAAA,EACJ;AAAA;AAAA,EAEA,qBAAqB9D,GAAmBpY,GAAY;AAChD,WAAOmc,GAAW,KAAK,MAAMl1B,IAAQmxB,GAAmBpY,CAAU;AAAA,EACtE;AAAA,EACA,yBAAyBA,GAAYoY,GAAmB;AACpD,IAAA+D,GAAW,KAAK,MAAM71B,IAAqB8xB,GAAmBpY,CAAU;AAAA,EAC5E;AAAA,EACA,iCAAiCA,GAAYttB,GAAS;AAClD,IAAAypC,GAAW,KAAK,MAAM51B,IAAkC7T,GAASstB,GAAYub,EAAgB;AAAA,EACjG;AAAA,EACA,mBAAmBvb,GAAYoY,GAAmB;AAC9C,IAAA+D,GAAW,KAAK,MAAM31B,IAAY4xB,GAAmBpY,CAAU;AAAA,EACnE;AAAA,EACA,2BAA2BA,GAAYttB,GAAS;AAC5C,IAAAypC,GAAW,KAAK,MAAM11B,IAAyB/T,GAASstB,GAAYub,EAAgB;AAAA,EACxF;AAAA,EACA,iBAAiBlD,GAAYrY,GAAY;AACrC,WAAOoc,GAAa,KAAK,MAAM/D,GAAYrY,CAAU;AAAA,EACzD;AAAA,EACA,sBAAsBmY,GAAYnY,GAAYttB,GAAS;AAEnD,QADA2pC,GAAuBrc,CAAU,GAC7B,CAACmY,KAAcjpB,EAAIipB,GAAY,UAAU,MAAM,IAAO;AACtD,YAAMhf,IAAQ,IAAI,MAAM,WAAWmjB,GAAatc,CAAU,CAAC,uEACL,KAAK,UAAUmY,CAAU,CAAC;AAAA,2BAC9C,KAAK,mBAAmB,CAAC,EAAE,IAAI,GAAG;AACpE,YAAAhf,EAAM,uBAAuB,IACvBA;AAAA,IACV;AACA,UAAMojB,IAAWC,GAAK,KAAK,kBAAkB,GACvCne,IAAW8Z,EAAW,UACtBsE,IAAkB,IAAIx2B,GAAY;AAAA,MACpC,KAAK+Z;AAAA,MACL,iBAAiB3B;AAAA,MACjB,OAAyD3rB,GAAQ;AAAA;AAAA,MAEjE,gBAAgB;AAAA,IAC5B,CAAS;AACD,WAAA6pC,EAAS,WAAW,KAAKE,CAAe,GACjC,KAAK,YACNd,KACAL;AAAA,EACV;AAAA,EACA,sBAAsB31B,GAASqa,GAAYttB,GAAS;AAEhD,QADA2pC,GAAuBrc,CAAU,GAC7B,CAAC5I,GAAoBzR,CAAO,GAAG;AAC/B,YAAMwT,IAAQ,IAAI,MAAM,WAAWmjB,GAAatc,CAAU,CAAC,mEACT,KAAK,UAAUra,CAAO,CAAC;AAAA,2BACvC,KAAK,mBAAmB,CAAC,EAAE,IAAI,GAAG;AACpE,YAAAwT,EAAM,uBAAuB,IACvBA;AAAA,IACV;AACA,UAAMojB,IAAWC,GAAK,KAAK,kBAAkB,GACvCC,IAAkB,IAAI91B,GAAS;AAAA,MACjC,KAAKqZ;AAAA,MACL,cAAcra;AAAA,MACd,OAAyDjT,GAAQ;AAAA,IAC7E,CAAS;AACD,WAAA6pC,EAAS,WAAW,KAAKE,CAAe,GACjCf;AAAA,EACX;AACJ;AACA,SAASS,GAAWO,GAAiBC,GAAa3c,GAAY4c,IAAY,IAAO;AAC7E,EAAAP,GAAuBrc,CAAU;AACjC,QAAMuc,IAAWC,GAAK,KAAK,kBAAkB,GACvCK,IAAgBvuB,GAAWquB,CAAW,IAAIA,IAAcA,EAAY,KACpEG,IAAU,IAAIJ,EAAgB,EAAE,YAAY,IAAI,KAAK1c,GAAY;AACvE,SAAI4c,MACAE,EAAQ,YAAYH,EAAY,MAEhCztB,EAAIytB,GAAa,eAAe,MAChCG,EAAQ,eAAeH,EAAY,gBAEvC,KAAK,mBAAmB,KAAKG,CAAO,GACpCD,EAAc,KAAK,IAAI,GACvBN,EAAS,WAAW,KAAKO,CAAO,GAChC,KAAK,mBAAmB,IAAG,GACpBxB;AACX;AACA,SAASc,GAAaO,GAAa3c,GAAY;AAC3C,EAAAqc,GAAuBrc,CAAU;AACjC,QAAMuc,IAAWC,GAAK,KAAK,kBAAkB,GAEvCO,IAAapyC,GAAQgyC,CAAW,MAAM,IACtC9/B,IAAOkgC,MAAe,KAAQJ,IAAcA,EAAY,KACxDK,IAAY,IAAIt2B,GAAY;AAAA,IAC9B,YAAY,CAAA;AAAA,IACZ,KAAKsZ;AAAA,IACL,mBAAmB+c,KAAcJ,EAAY,uBAAuB;AAAA,EAC5E,CAAK;AACD,EAAIztB,EAAIytB,GAAa,eAAe,MAChCK,EAAU,eAAeL,EAAY;AAEzC,QAAMlY,IAAgBj2B,GAAKqO,GAAM,CAACulB,MAAY9T,GAAW8T,EAAQ,IAAI,CAAC;AACtE,SAAA4a,EAAU,gBAAgBvY,GAC1B8X,EAAS,WAAW,KAAKS,CAAS,GAClCj3B,EAAQlJ,GAAM,CAACulB,MAAY;AACvB,UAAM6a,IAAc,IAAI52B,GAAY,EAAE,YAAY,CAAA,EAAE,CAAE;AACtD,IAAA22B,EAAU,WAAW,KAAKC,CAAW,GACjC/tB,EAAIkT,GAAS,oBAAoB,IACjC6a,EAAY,oBAAoB7a,EAAQ,qBAGnClT,EAAIkT,GAAS,MAAM,MACxB6a,EAAY,oBAAoB,KAEpC,KAAK,mBAAmB,KAAKA,CAAW,GACxC7a,EAAQ,IAAI,KAAK,IAAI,GACrB,KAAK,mBAAmB,IAAG;AAAA,EAC/B,CAAC,GACMkZ;AACX;AACA,SAASgB,GAAatsB,GAAK;AACvB,SAAOA,MAAQ,IAAI,KAAK,GAAGA,CAAG;AAClC;AACA,SAASqsB,GAAuBrsB,GAAK;AACjC,MAAIA,IAAM,KAAKA,IAAMwrB,IAAgB;AACjC,UAAMriB,IAAQ,IAAI;AAAA;AAAA,MAElB,kCAAkCnJ,CAAG;AAAA,wDACuBwrB,KAAiB,CAAC;AAAA,IAAE;AAChF,UAAAriB,EAAM,uBAAuB,IACvBA;AAAA,EACV;AACJ;AC/RO,MAAM+jB,GAAkB;AAAA,EAC3B,sBAAsB7kB,GAAQ;AAC1B,QAAInJ,EAAImJ,GAAQ,eAAe,GAAG;AAC9B,YAAM8kB,IAAoB9kB,EAAO,eAC3B+kB,IAAgB,OAAOD,KAAsB;AACnD,WAAK,oBAAoBC,IACnBD,IACA,OACN,KAAK,gBAAgBC,IACfD,IAAoB,IACpBA;AAAA,IACV;AAEI,WAAK,oBAAoB,GACzB,KAAK,gBAAgB9M,GAAsB;AAE/C,SAAK,kBAAkB;AAAA,EAC3B;AAAA,EACA,WAAW/X,GAAWC,GAAW;AAG7B,QAAI,KAAK,kBAAkB,IAAM;AAC7B,WAAK;AACL,YAAMC,IAAS,IAAI,MAAM,KAAK,kBAAkB,CAAC,EAAE,KAAK,GAAI;AAC5D,MAAI,KAAK,kBAAkB,KAAK,qBAC5B,QAAQ,IAAI,GAAGA,CAAM,QAAQF,CAAS,GAAG;AAE7C,YAAM,EAAE,MAAAG,GAAM,OAAAzuB,MAAUmb,GAAMoT,CAAS,GAEjCG,IAAcD,IAAO,KAAK,QAAQ,OAAO,QAAQ;AACvD,aAAI,KAAK,kBAAkB,KAAK,qBAC5BC,EAAY,GAAGF,CAAM,QAAQF,CAAS,WAAWG,CAAI,IAAI,GAE7D,KAAK,mBACEzuB;AAAA,IACX;AAEI,aAAOuuB,EAAS;AAAA,EAExB;AACJ;AC9CO,SAAS8kB,GAAYC,GAAaC,GAAW;AAChD,EAAAA,EAAU,QAAQ,CAACC,MAAa;AAC5B,UAAMC,IAAYD,EAAS;AAC3B,WAAO,oBAAoBC,CAAS,EAAE,QAAQ,CAACC,MAAa;AACxD,UAAIA,MAAa;AACb;AAEJ,YAAMC,IAAqB,OAAO,yBAAyBF,GAAWC,CAAQ;AAE9E,MAAIC,MACCA,EAAmB,OAAOA,EAAmB,OAC9C,OAAO,eAAeL,EAAY,WAAWI,GAAUC,CAAkB,IAGzEL,EAAY,UAAUI,CAAQ,IAAIF,EAAS,UAAUE,CAAQ;AAAA,IAErE,CAAC;AAAA,EACL,CAAC;AACL;ACAO,MAAM3F,KAAcla,GAAoBD,IAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACpF,OAAO,OAAOma,EAAW;AAClB,MAAM1H,KAAwB,OAAO,OAAO;AAAA,EAC/C,iBAAiB;AAAA,EACjB,cAAc;AAAA,EACd,sBAAsB;AAAA,EACtB,WAAW;AAAA,EACX,sBAAsBnS;AAAA,EACtB,sBAAsB;AAAA,EACtB,eAAe;AAAA,EACf,iBAAiB;AACrB,CAAC,GACYqa,KAAsB,OAAO,OAAO;AAAA,EAC7C,mBAAmB,MAAA;AAAA;AAAA,EACnB,eAAe;AACnB,CAAC;AACM,IAAIzX;AAAA,CACV,SAAUA,GAA2B;AAClC,EAAAA,EAA0BA,EAA0B,oBAAuB,CAAC,IAAI,qBAChFA,EAA0BA,EAA0B,sBAAyB,CAAC,IAAI,uBAClFA,EAA0BA,EAA0B,wBAA2B,CAAC,IAAI,yBACpFA,EAA0BA,EAA0B,wBAA2B,CAAC,IAAI,yBACpFA,EAA0BA,EAA0B,yBAA4B,CAAC,IAAI,0BACrFA,EAA0BA,EAA0B,iBAAoB,CAAC,IAAI,kBAC7EA,EAA0BA,EAA0B,sBAAyB,CAAC,IAAI,uBAClFA,EAA0BA,EAA0B,iBAAoB,CAAC,IAAI,kBAC7EA,EAA0BA,EAA0B,kCAAqC,CAAC,IAAI,mCAC9FA,EAA0BA,EAA0B,qBAAwB,CAAC,IAAI,sBACjFA,EAA0BA,EAA0B,yBAA4B,EAAE,IAAI,0BACtFA,EAA0BA,EAA0B,wBAA2B,EAAE,IAAI,yBACrFA,EAA0BA,EAA0B,gBAAmB,EAAE,IAAI,iBAC7EA,EAA0BA,EAA0B,8BAAiC,EAAE,IAAI;AAC/F,GAAGA,OAA8BA,KAA4B,CAAA,EAAG;AACzD,SAAS8c,GAAU5zC,IAAQ,QAAW;AACzC,SAAO,WAAY;AACf,WAAOA;AAAA,EACX;AACJ;AACO,MAAM6zC,GAAO;AAAA;AAAA;AAAA;AAAA,EAIhB,OAAO,oBAAoBC,GAAgB;AACvC,UAAM,MAAM,4HACqD;AAAA,EACrE;AAAA,EACA,sBAAsB;AAClB,SAAK,WAAW,uBAAuB,MAAM;AACzC,UAAIC;AACJ,WAAK,mBAAmB;AACxB,YAAMrS,IAAY,KAAK;AACvB,WAAK,WAAW,eAAe,MAAM;AAIjC,QAAArmB,GAAiB,IAAI;AAAA,MACzB,CAAC,GACD,KAAK,WAAW,qBAAqB,MAAM;AACvC,YAAI;AACA,eAAK,gBAAe,GAEpBU,EAAQ,KAAK,mBAAmB,CAACipB,MAAiB;AAE9C,kBAAMgP,IADc,KAAKhP,CAAY,EACK;AAC1C,gBAAIiP;AACJ,iBAAK,WAAW,GAAGjP,CAAY,SAAS,MAAM;AAC1C,cAAAiP,IAAmB,KAAK,mBAAmBjP,GAAcgP,CAAqB;AAAA,YAClF,CAAC,GACD,KAAK,qBAAqBhP,CAAY,IAAIiP;AAAA,UAC9C,CAAC;AAAA,QACL,UAChB;AACoB,eAAK,iBAAgB;AAAA,QACzB;AAAA,MACJ,CAAC;AACD,UAAIC,IAAiB,CAAA;AA2CrB,UA1CA,KAAK,WAAW,qBAAqB,MAAM;AACvC,QAAAA,IAAiB3d,GAAe;AAAA,UAC5B,OAAOx1B,GAAO,KAAK,oBAAoB;AAAA,QAC3D,CAAiB,GACD,KAAK,mBAAmB,KAAK,iBAAiB,OAAOmzC,CAAc;AAAA,MACvE,CAAC,GACD,KAAK,WAAW,uBAAuB,MAAM;AAGzC,YAAIvtB,GAAQutB,CAAc,KAAK,KAAK,oBAAoB,IAAO;AAC3D,gBAAMC,IAAmBxU,GAAgB;AAAA,YACrC,OAAO5+B,GAAO,KAAK,oBAAoB;AAAA,YACvC,YAAYA,GAAO,KAAK,SAAS;AAAA,YACjC,gBAAgBu0B;AAAA,YAChB,aAAaoM;AAAA,UACrC,CAAqB,GACK0S,IAA4B5U,GAAkB;AAAA,YAChD,mBAAmB,KAAK;AAAA,YACxB,OAAOz+B,GAAO,KAAK,oBAAoB;AAAA,YACvC,YAAYA,GAAO,KAAK,SAAS;AAAA,YACjC,aAAa2gC;AAAA,UACrC,CAAqB;AACD,eAAK,mBAAmB,KAAK,iBAAiB,OAAOyS,GAAkBC,CAAyB;AAAA,QACpG;AAAA,MACJ,CAAC,GAEGztB,GAAQ,KAAK,gBAAgB,MAEzB,KAAK,mBACL,KAAK,WAAW,0BAA0B,MAAM;AAC5C,cAAM0tB,IAAah0B,GAAuBtf,GAAO,KAAK,oBAAoB,CAAC;AAC3E,aAAK,gBAAgBszC;AAAA,MACzB,CAAC,GAEL,KAAK,WAAW,6BAA6B,MAAM;AAC/C,YAAIxK,GAAIyK;AACR,SAACA,KAAMzK,IAAK,KAAK,mBAAmB,gBAAgB,QAAQyK,MAAO,UAAkBA,EAAG,KAAKzK,GAAI;AAAA,UAC7F,OAAO9oC,GAAO,KAAK,oBAAoB;AAAA,QAC/D,CAAqB,GACD,KAAK,6BAA6BA,GAAO,KAAK,oBAAoB,CAAC;AAAA,MACvE,CAAC,IAED,CAAC8yC,GAAO,oCACR,CAACltB,GAAQ,KAAK,gBAAgB;AAC9B,cAAAotB,IAAgBtxC,EAAI,KAAK,kBAAkB,CAACu+B,MAAaA,EAAS,OAAO,GACnE,IAAI,MAAM;AAAA,GAAwC+S,EAAc,KAAK;AAAA;AAAA,CAAqC,CAAC,EAAE;AAAA,IAE3H,CAAC;AAAA,EACL;AAAA,EACA,YAAYnF,GAAiBvgB,GAAQ;AACjC,SAAK,mBAAmB,CAAA,GACxB,KAAK,mBAAmB;AACxB,UAAM0jB,IAAO;AAUb,QATAA,EAAK,iBAAiB1jB,CAAM,GAC5B0jB,EAAK,iBAAgB,GACrBA,EAAK,eAAe1jB,CAAM,GAC1B0jB,EAAK,qBAAqBnD,GAAiBvgB,CAAM,GACjD0jB,EAAK,gBAAgB1jB,CAAM,GAC3B0jB,EAAK,gBAAgB1jB,CAAM,GAC3B0jB,EAAK,kBAAiB,GACtBA,EAAK,iBAAiB1jB,CAAM,GAC5B0jB,EAAK,sBAAsB1jB,CAAM,GAC7BnJ,EAAImJ,GAAQ,eAAe;AAC3B,YAAM,IAAI,MAAM;AAAA;AAAA;AAAA,sBAGU;AAE9B,SAAK,kBAAkBnJ,EAAImJ,GAAQ,iBAAiB,IAC9CA,EAAO,kBACPgY,GAAsB;AAAA,EAChC;AACJ;AAOAwN,GAAO,mCAAmC;AAC1CR,GAAYQ,IAAQ;AAAA,EAChBzN;AAAA,EACA8D;AAAA,EACA8C;AAAA,EACAa;AAAA,EACAc;AAAA,EACAV;AAAA,EACAwC;AAAA,EACAO;AAAA,EACAY;AAAA,EACAsB;AACJ,CAAC;AAQM,MAAMqB,WAA8BV,GAAO;AAAA,EAC9C,YAAYjF,GAAiBvgB,IAASgY,IAAuB;AACzD,UAAMmO,IAAcxnB,GAAMqB,CAAM;AAChC,IAAAmmB,EAAY,YAAY,IACxB,MAAM5F,GAAiB4F,CAAW;AAAA,EACtC;AACJ;AC/LO,SAASC,GAAYr+B,GAAM7Q,GAAMywB,GAAY;AAChD,SAAO,GAAG5f,EAAK,IAAI,IAAI7Q,CAAI,IAAIywB,CAAU;AAC7C;AAEO,MAAM0e,KAAY,GACZC,KAAiB,GACjBC,KAAuB,GACvBC,KAAuB,GAGvBC,KAAgB,GAChBC,KAAgB,GAChBC,KAAqB,GACrBC,KAAsB,IACtBC,KAAqB,IACrBC,KAAe;AACrB,MAAMC,GAAmB;AAAA,EAC5B,YAAYC,GAAQ;AAChB,SAAK,SAASA;AAAA,EAClB;AAAA,EACA,YAAY;AACR,WAAO;AAAA,EACX;AACJ;AACO,MAAMC,WAAuBF,GAAmB;AAAA,EACnD,YAAYC,GAAQ3pB,GAAW;AAC3B,UAAM2pB,CAAM,GACZ,KAAK,YAAY3pB;AAAA,EACrB;AACJ;AACO,MAAM6pB,WAA0BH,GAAmB;AAAA,EACtD,YAAYC,GAAQ;AAChB,UAAMA,CAAM;AAAA,EAChB;AAAA,EACA,YAAY;AACR,WAAO;AAAA,EACX;AACJ;AACO,MAAMG,WAAuBJ,GAAmB;AAAA,EACnD,YAAYK,GAAWr/B,GAAMs/B,GAAa;AACtC,UAAMD,CAAS,GACf,KAAK,OAAOr/B,GACZ,KAAK,cAAcs/B;AAAA,EACvB;AAAA,EACA,YAAY;AACR,WAAO;AAAA,EACX;AACJ;AACO,SAASC,GAAUr/B,GAAO;AAC7B,QAAMs/B,IAAM;AAAA,IACR,aAAa,CAAA;AAAA,IACb,gBAAgB,CAAA;AAAA,IAChB,kBAAkB,oBAAI,IAAG;AAAA,IACzB,iBAAiB,oBAAI,IAAG;AAAA,IACxB,QAAQ,CAAA;AAAA,EAChB;AACI,EAAAC,GAAgCD,GAAKt/B,CAAK;AAC1C,QAAMw/B,IAAax/B,EAAM;AACzB,WAASxO,IAAI,GAAGA,IAAIguC,GAAYhuC,KAAK;AACjC,UAAMsO,IAAOE,EAAMxO,CAAC,GACdiuC,IAAYC,GAAMJ,GAAKx/B,GAAMA,CAAI;AACvC,IAAI2/B,MAAc,UAGlBE,GAAgBL,GAAKx/B,GAAM2/B,CAAS;AAAA,EACxC;AACA,SAAOH;AACX;AACA,SAASC,GAAgCD,GAAKt/B,GAAO;AACjD,QAAMw/B,IAAax/B,EAAM;AACzB,WAASxO,IAAI,GAAGA,IAAIguC,GAAYhuC,KAAK;AACjC,UAAMsO,IAAOE,EAAMxO,CAAC,GACdrI,IAAQiT,GAASkjC,GAAKx/B,GAAM,QAAW;AAAA,MACzC,MAAMu+B;AAAA,IAClB,CAAS,GACKuB,IAAOxjC,GAASkjC,GAAKx/B,GAAM,QAAW;AAAA,MACxC,MAAM0+B;AAAA,IAClB,CAAS;AACD,IAAAr1C,EAAM,OAAOy2C,GACbN,EAAI,iBAAiB,IAAIx/B,GAAM3W,CAAK,GACpCm2C,EAAI,gBAAgB,IAAIx/B,GAAM8/B,CAAI;AAAA,EACtC;AACJ;AACA,SAAS9iC,GAAKwiC,GAAKx/B,GAAM+/B,GAAY;AACjC,SAAIA,aAAsBx5B,KACfy5B,GAASR,GAAKx/B,GAAM+/B,EAAW,cAAcA,CAAU,IAEzDA,aAAsBl6B,KACpBo6B,GAAQT,GAAKx/B,GAAM+/B,CAAU,IAE/BA,aAAsBz5B,KACpBonB,GAAY8R,GAAKx/B,GAAM+/B,CAAU,IAEnCA,aAAsBl5B,KACpBkkB,GAAOyU,GAAKx/B,GAAM+/B,CAAU,IAE9BA,aAAsB35B,KACpB2tB,GAAWyL,GAAKx/B,GAAM+/B,CAAU,IAElCA,aAAsB15B,KACpB65B,GAAcV,GAAKx/B,GAAM+/B,CAAU,IAErCA,aAAsB75B,KACpB8tB,GAAoBwL,GAAKx/B,GAAM+/B,CAAU,IAE3CA,aAAsB55B,KACpBg6B,GAAuBX,GAAKx/B,GAAM+/B,CAAU,IAG5CH,GAAMJ,GAAKx/B,GAAM+/B,CAAU;AAE1C;AACA,SAAShM,GAAWyL,GAAKx/B,GAAM+zB,GAAY;AACvC,QAAMqM,IAAY9jC,GAASkjC,GAAKx/B,GAAM+zB,GAAY;AAAA,IAC9C,MAAM0K;AAAA,EACd,CAAK;AACD,EAAA4B,GAAoBb,GAAKY,CAAS;AAClC,QAAME,IAASC,GAASf,GAAKx/B,GAAMogC,GAAWrM,GAAY6L,GAAMJ,GAAKx/B,GAAM+zB,CAAU,CAAC;AACtF,SAAOyM,GAAKhB,GAAKx/B,GAAM+zB,GAAYuM,CAAM;AAC7C;AACA,SAASJ,GAAcV,GAAKx/B,GAAM+zB,GAAY;AAC1C,QAAMqM,IAAY9jC,GAASkjC,GAAKx/B,GAAM+zB,GAAY;AAAA,IAC9C,MAAM0K;AAAA,EACd,CAAK;AACD,EAAA4B,GAAoBb,GAAKY,CAAS;AAClC,QAAME,IAASC,GAASf,GAAKx/B,GAAMogC,GAAWrM,GAAY6L,GAAMJ,GAAKx/B,GAAM+zB,CAAU,CAAC,GAChF0M,IAAMT,GAASR,GAAKx/B,GAAM+zB,EAAW,WAAWA,CAAU;AAChE,SAAOyM,GAAKhB,GAAKx/B,GAAM+zB,GAAYuM,GAAQG,CAAG;AAClD;AACA,SAASzM,GAAoBwL,GAAKx/B,GAAM+zB,GAAY;AAChD,QAAM2M,IAAYpkC,GAASkjC,GAAKx/B,GAAM+zB,GAAY;AAAA,IAC9C,MAAMyK;AAAA,EACd,CAAK;AACD,EAAA6B,GAAoBb,GAAKkB,CAAS;AAClC,QAAMJ,IAASC,GAASf,GAAKx/B,GAAM0gC,GAAW3M,GAAY6L,GAAMJ,GAAKx/B,GAAM+zB,CAAU,CAAC;AACtF,SAAO4M,GAAKnB,GAAKx/B,GAAM+zB,GAAYuM,CAAM;AAC7C;AACA,SAASH,GAAuBX,GAAKx/B,GAAM+zB,GAAY;AACnD,QAAM2M,IAAYpkC,GAASkjC,GAAKx/B,GAAM+zB,GAAY;AAAA,IAC9C,MAAMyK;AAAA,EACd,CAAK;AACD,EAAA6B,GAAoBb,GAAKkB,CAAS;AAClC,QAAMJ,IAASC,GAASf,GAAKx/B,GAAM0gC,GAAW3M,GAAY6L,GAAMJ,GAAKx/B,GAAM+zB,CAAU,CAAC,GAChF0M,IAAMT,GAASR,GAAKx/B,GAAM+zB,EAAW,WAAWA,CAAU;AAChE,SAAO4M,GAAKnB,GAAKx/B,GAAM+zB,GAAYuM,GAAQG,CAAG;AAClD;AACA,SAAS/S,GAAY8R,GAAKx/B,GAAM0tB,GAAa;AACzC,QAAMrkC,IAAQiT,GAASkjC,GAAKx/B,GAAM0tB,GAAa;AAAA,IAC3C,MAAM4Q;AAAA,EACd,CAAK;AACD,EAAA+B,GAAoBb,GAAKn2C,CAAK;AAC9B,QAAMoT,IAAOpQ,EAAIqhC,EAAY,YAAY,CAAC37B,MAAMiL,GAAKwiC,GAAKx/B,GAAMjO,CAAC,CAAC;AAElE,SADewuC,GAASf,GAAKx/B,GAAM3W,GAAOqkC,GAAa,GAAGjxB,CAAI;AAElE;AACA,SAASsuB,GAAOyU,GAAKx/B,GAAM+qB,GAAQ;AAC/B,QAAM1hC,IAAQiT,GAASkjC,GAAKx/B,GAAM+qB,GAAQ;AAAA,IACtC,MAAMuT;AAAA,EACd,CAAK;AACD,EAAA+B,GAAoBb,GAAKn2C,CAAK;AAC9B,QAAMi3C,IAASC,GAASf,GAAKx/B,GAAM3W,GAAO0hC,GAAQ6U,GAAMJ,GAAKx/B,GAAM+qB,CAAM,CAAC;AAC1E,SAAO6V,GAASpB,GAAKx/B,GAAM+qB,GAAQuV,CAAM;AAC7C;AACA,SAASV,GAAMJ,GAAKx/B,GAAM4/B,GAAO;AAC7B,QAAMiB,IAAUxvB,GAAOhlB,EAAIuzC,EAAM,YAAY,CAAC7tC,MAAMiL,GAAKwiC,GAAKx/B,GAAMjO,CAAC,CAAC,GAAG,CAACA,MAAMA,MAAM,MAAS;AAC/F,SAAI8uC,EAAQ,WAAW,IACZA,EAAQ,CAAC,IAEXA,EAAQ,WAAW,IACxB,SAGOC,GAAUtB,GAAKqB,CAAO;AAErC;AACA,SAASF,GAAKnB,GAAKx/B,GAAM2gC,GAAML,GAAQG,GAAK;AACxC,QAAMM,IAAWT,EAAO,MAClBU,IAASV,EAAO,OAChBW,IAAO3kC,GAASkjC,GAAKx/B,GAAM2gC,GAAM;AAAA,IACnC,MAAM7B;AAAA,EACd,CAAK;AACD,EAAAuB,GAAoBb,GAAKyB,CAAI;AAC7B,QAAM33C,IAAMgT,GAASkjC,GAAKx/B,GAAM2gC,GAAM;AAAA,IAClC,MAAM5B;AAAA,EACd,CAAK;AACD,SAAAgC,EAAS,WAAWE,GACpB33C,EAAI,WAAW23C,GACfzB,EAAI,YAAYnB,GAAYr+B,GAAMygC,IAAM,qCAAqC,uBAAuBE,EAAK,GAAG,CAAC,IAAIM,GACjHC,GAAQF,GAAQC,CAAI,GAGhBR,MAAQ,UACRS,GAAQD,GAAMF,CAAQ,GACtBG,GAAQD,GAAM33C,CAAG,MAGjB43C,GAAQD,GAAM33C,CAAG,GAEjB43C,GAAQD,GAAMR,EAAI,IAAI,GACtBS,GAAQT,EAAI,OAAOM,CAAQ,IAExB;AAAA,IACH,MAAMA;AAAA,IACN,OAAOz3C;AAAA,EACf;AACA;AACA,SAASk3C,GAAKhB,GAAKx/B,GAAMwgC,GAAMF,GAAQG,GAAK;AACxC,QAAMp3C,IAAQi3C,EAAO,MACfh3C,IAAMg3C,EAAO,OACba,IAAQ7kC,GAASkjC,GAAKx/B,GAAMwgC,GAAM;AAAA,IACpC,MAAM3B;AAAA,EACd,CAAK;AACD,EAAAwB,GAAoBb,GAAK2B,CAAK;AAC9B,QAAMC,IAAU9kC,GAASkjC,GAAKx/B,GAAMwgC,GAAM;AAAA,IACtC,MAAMzB;AAAA,EACd,CAAK,GACKkC,IAAO3kC,GAASkjC,GAAKx/B,GAAMwgC,GAAM;AAAA,IACnC,MAAM5B;AAAA,EACd,CAAK;AACD,SAAAuC,EAAM,WAAWF,GACjBG,EAAQ,WAAWH,GACnBC,GAAQC,GAAO93C,CAAK,GACpB63C,GAAQC,GAAOC,CAAO,GACtBF,GAAQ53C,GAAK23C,CAAI,GACbR,MAAQ,UACRS,GAAQD,GAAMG,CAAO,GAErBF,GAAQD,GAAMR,EAAI,IAAI,GACtBS,GAAQT,EAAI,OAAOp3C,CAAK,KAGxB63C,GAAQD,GAAME,CAAK,GAEvB3B,EAAI,YAAYnB,GAAYr+B,GAAMygC,IAAM,4BAA4B,cAAcD,EAAK,GAAG,CAAC,IAAIW,GACxF;AAAA,IACH,MAAMA;AAAA,IACN,OAAOC;AAAA,EACf;AACA;AACA,SAASR,GAASpB,GAAKx/B,GAAM4gC,GAAUN,GAAQ;AAC3C,QAAMj3C,IAAQi3C,EAAO,MACfh3C,IAAMg3C,EAAO;AACnB,SAAAY,GAAQ73C,GAAOC,CAAG,GAClBk2C,EAAI,YAAYnB,GAAYr+B,GAAM,UAAU4gC,EAAS,GAAG,CAAC,IAAIv3C,GACtDi3C;AACX;AACA,SAASD,GAAoBb,GAAK7uC,GAAO;AACrC,SAAA6uC,EAAI,eAAe,KAAK7uC,CAAK,GAC7BA,EAAM,WAAW6uC,EAAI,eAAe,SAAS,GACtC7uC,EAAM;AACjB;AACA,SAAS4vC,GAASf,GAAKx/B,GAAM3W,GAAO02C,MAAetjC,GAAM;AACrD,QAAMnT,IAAMgT,GAASkjC,GAAKx/B,GAAM+/B,GAAY;AAAA,IACxC,MAAMpB;AAAA,IACN,OAAAt1C;AAAA,EACR,CAAK;AACD,EAAAA,EAAM,MAAMC;AACZ,aAAWof,KAAOjM;AACd,IAAIiM,MAAQ,UAERw4B,GAAQ73C,GAAOqf,EAAI,IAAI,GACvBw4B,GAAQx4B,EAAI,OAAOpf,CAAG,KAGtB43C,GAAQ73C,GAAOC,CAAG;AAG1B,QAAMg3C,IAAS;AAAA,IACX,MAAMj3C;AAAA,IACN,OAAOC;AAAA,EACf;AACI,SAAAk2C,EAAI,YAAYnB,GAAYr+B,GAAM6jB,GAAYkc,CAAU,GAAGA,EAAW,GAAG,CAAC,IAAI12C,GACvEi3C;AACX;AACA,SAASzc,GAAYkc,GAAY;AAC7B,MAAIA,aAAsBz5B;AACtB,WAAO;AAEN,MAAIy5B,aAAsBl5B;AAC3B,WAAO;AAEN,MAAIk5B,aAAsB35B;AAC3B,WAAO;AAEN,MAAI25B,aAAsB15B;AAC3B,WAAO;AAEN,MAAI05B,aAAsB75B;AAC3B,WAAO;AAEN,MAAI65B,aAAsB55B;AAC3B,WAAO;AAGP,QAAM,IAAI,MAAM,qCAAqC;AAE7D;AACA,SAAS26B,GAAUtB,GAAK/iC,GAAM;AAC1B,QAAM4kC,IAAa5kC,EAAK;AACxB,WAAS/K,IAAI,GAAGA,IAAI2vC,IAAa,GAAG3vC,KAAK;AACrC,UAAM4uC,IAAS7jC,EAAK/K,CAAC;AACrB,QAAI4vC;AACJ,IAAIhB,EAAO,KAAK,YAAY,WAAW,MACnCgB,IAAahB,EAAO,KAAK,YAAY,CAAC;AAE1C,UAAMiB,IAAmBD,aAAsBlC,IACzCoC,IAAiBF,GACjBjxC,IAAOoM,EAAK/K,IAAI,CAAC,EAAE;AACzB,IAAI4uC,EAAO,KAAK,SAAShC,MACrBgC,EAAO,MAAM,SAAShC,MACtBgD,MAAe,WACbC,KAAoBC,EAAe,gBAAgBlB,EAAO,SACxDgB,EAAW,WAAWhB,EAAO,UAE7BiB,IACAC,EAAe,cAAcnxC,IAG7BixC,EAAW,SAASjxC,GAExBoxC,GAAYjC,GAAKc,EAAO,KAAK,KAI7BY,GAAQZ,EAAO,OAAOjwC,CAAI;AAAA,EAElC;AACA,QAAM2Q,IAAQvE,EAAK,CAAC,GACdqe,IAAOre,EAAK4kC,IAAa,CAAC;AAChC,SAAO;AAAA,IACH,MAAMrgC,EAAM;AAAA,IACZ,OAAO8Z,EAAK;AAAA,EACpB;AACA;AACA,SAASklB,GAASR,GAAKx/B,GAAMsV,GAAWyqB,GAAY;AAChD,QAAM2B,IAAOplC,GAASkjC,GAAKx/B,GAAM+/B,GAAY;AAAA,IACzC,MAAMzB;AAAA,EACd,CAAK,GACKqD,IAAQrlC,GAASkjC,GAAKx/B,GAAM+/B,GAAY;AAAA,IAC1C,MAAMzB;AAAA,EACd,CAAK;AACD,SAAAsD,GAAcF,GAAM,IAAIxC,GAAeyC,GAAOrsB,CAAS,CAAC,GACjD;AAAA,IACH,MAAAosB;AAAA,IACA,OAAAC;AAAA,EACR;AACA;AACA,SAAS1B,GAAQT,GAAKqC,GAAaC,GAAa;AAC5C,QAAM9hC,IAAO8hC,EAAY,gBACnBz4C,IAAQm2C,EAAI,iBAAiB,IAAIx/B,CAAI,GACrC0hC,IAAOplC,GAASkjC,GAAKqC,GAAaC,GAAa;AAAA,IACjD,MAAMxD;AAAA,EACd,CAAK,GACKqD,IAAQrlC,GAASkjC,GAAKqC,GAAaC,GAAa;AAAA,IAClD,MAAMxD;AAAA,EACd,CAAK,GACKyD,IAAO,IAAI3C,GAAe/1C,GAAO2W,GAAM2hC,CAAK;AAClD,SAAAC,GAAcF,GAAMK,CAAI,GACjB;AAAA,IACH,MAAAL;AAAA,IACA,OAAAC;AAAA,EACR;AACA;AACA,SAAS9B,GAAgBL,GAAKx/B,GAAM4/B,GAAO;AACvC,QAAMv2C,IAAQm2C,EAAI,iBAAiB,IAAIx/B,CAAI;AAC3C,EAAAkhC,GAAQ73C,GAAOu2C,EAAM,IAAI;AACzB,QAAME,IAAON,EAAI,gBAAgB,IAAIx/B,CAAI;AACzC,SAAAkhC,GAAQtB,EAAM,OAAOE,CAAI,GACV;AAAA,IACX,MAAMz2C;AAAA,IACN,OAAOy2C;AAAA,EACf;AAEA;AACA,SAASoB,GAAQc,GAAGvvC,GAAG;AACnB,QAAM6uC,IAAa,IAAInC,GAAkB1sC,CAAC;AAC1C,EAAAmvC,GAAcI,GAAGV,CAAU;AAC/B;AACA,SAAShlC,GAASkjC,GAAKx/B,GAAM+/B,GAAYlhC,GAAS;AAC9C,QAAMomB,IAAI,OAAO,OAAO;AAAA,IAAE,KAAAua;AAAA,IACtB,YAAAO;AAAA,IAAY,wBAAwB;AAAA,IAAO,MAAA//B;AAAA,IAAM,aAAa,CAAA;AAAA,IAAI,qBAAqB,CAAA;AAAA,IAAI,aAAaw/B,EAAI,OAAO;AAAA,EAAM,GAAI3gC,CAAO;AACxI,SAAA2gC,EAAI,OAAO,KAAKva,CAAC,GACVA;AACX;AACA,SAAS2c,GAAcjxC,GAAO2wC,GAAY;AAGtC,EAAI3wC,EAAM,YAAY,WAAW,MAC7BA,EAAM,yBAAyB2wC,EAAW,UAAS,IAEvD3wC,EAAM,YAAY,KAAK2wC,CAAU;AACrC;AACA,SAASG,GAAYjC,GAAK7uC,GAAO;AAC7B,EAAA6uC,EAAI,OAAO,OAAOA,EAAI,OAAO,QAAQ7uC,CAAK,GAAG,CAAC;AAClD;AC5YO,MAAMsxC,KAAY,CAAA;AAClB,MAAMC,GAAa;AAAA,EACtB,cAAc;AACV,SAAK,MAAM,CAAA,GACX,KAAK,UAAU,CAAA;AAAA,EACnB;AAAA,EACA,IAAI,OAAO;AACP,WAAO,KAAK,QAAQ;AAAA,EACxB;AAAA,EACA,WAAW;AAEP,SAAK,MAAM,CAAA;AAAA,EACf;AAAA,EACA,IAAIjqB,GAAQ;AACR,UAAMhvB,IAAMk5C,GAAgBlqB,CAAM;AAGlC,IAAMhvB,KAAO,KAAK,QACd,KAAK,IAAIA,CAAG,IAAI,KAAK,QAAQ,QAC7B,KAAK,QAAQ,KAAKgvB,CAAM;AAAA,EAEhC;AAAA,EACA,IAAI,WAAW;AACX,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,OAAO;AACP,WAAO5rB,EAAI,KAAK,SAAS,CAAC,MAAM,EAAE,GAAG;AAAA,EACzC;AAAA,EACA,IAAI,MAAM;AACN,QAAIzC,IAAQ;AACZ,eAAW2vB,KAAK,KAAK;AACjB,MAAA3vB,KAAS2vB,IAAI;AAEjB,WAAO3vB;AAAA,EACX;AACJ;AACO,SAASu4C,GAAgBlqB,GAAQvP,IAAM,IAAM;AAChD,SAAO,GAAGA,IAAM,IAAIuP,EAAO,GAAG,KAAK,EAAE,IAAIA,EAAO,MAAM,WAAW,IAAIA,EAAO,MAAM,IAAI,CAAClmB,MAAMA,EAAE,YAAY,UAAU,EAAE,KAAK,GAAG,CAAC;AACpI;AC5BA,SAASqwC,GAAeC,GAAYC,GAAU;AAC1C,QAAMj2C,IAAM,CAAA;AACZ,SAAO,CAACk2C,MAAiB;AACrB,UAAMt5C,IAAMs5C,EAAa,SAAQ;AACjC,QAAI/yC,IAAWnD,EAAIpD,CAAG;AACtB,WAAIuG,MAAa,WAIbA,IAAW;AAAA,MACP,eAAe6yC;AAAA,MACf,UAAAC;AAAA,MACA,QAAQ,CAAA;AAAA,IACxB,GACYj2C,EAAIpD,CAAG,IAAIuG,IACJA;AAAA,EAEf;AACJ;AACA,MAAMgzC,GAAa;AAAA,EACf,cAAc;AACV,SAAK,aAAa,CAAA;AAAA,EACtB;AAAA,EACA,GAAGj5C,GAAO;AACN,WAAOA,KAAS,KAAK,WAAW,UAAU,KAAK,WAAWA,CAAK;AAAA,EACnE;AAAA,EACA,IAAIA,GAAOK,GAAO;AACd,SAAK,WAAWL,CAAK,IAAIK;AAAA,EAC7B;AAAA,EACA,WAAW;AACP,QAAIA,IAAQ;AACZ,UAAMy8B,IAAO,KAAK,WAAW;AAC7B,aAAS30B,IAAI,GAAGA,IAAI20B,GAAM30B;AACtB,MAAA9H,KAAS,KAAK,WAAW8H,CAAC,MAAM,KAAO,MAAM;AAEjD,WAAO9H;AAAA,EACX;AACJ;AACA,MAAM64C,KAAmB,IAAID,GAAY;AAClC,MAAME,WAAgClP,GAAqB;AAAA,EAC9D,YAAYlhC,GAAS;AACjB,QAAImhC;AACJ,UAAK,GACL,KAAK,WAAWA,IAAuDnhC,GAAQ,aAAa,QAAQmhC,MAAO,SAASA,KAAM,CAACx4B,MAAY,QAAQ,IAAIA,CAAO;AAAA,EAC9J;AAAA,EACA,WAAW3I,GAAS;AAChB,SAAK,MAAMitC,GAAUjtC,EAAQ,KAAK,GAClC,KAAK,OAAOqwC,GAAiB,KAAK,GAAG;AAAA,EACzC;AAAA,EACA,2CAA2C;AACvC,WAAO,CAAA;AAAA,EACX;AAAA,EACA,8BAA8B;AAC1B,WAAO,CAAA;AAAA,EACX;AAAA,EACA,6BAA6BrwC,GAAS;AAClC,UAAM,EAAE,gBAAAigC,GAAgB,MAAAvyB,GAAM,eAAAqkB,GAAe,sBAAAC,EAAoB,IAAKhyB,GAChEswC,IAAO,KAAK,MACZC,IAAU,KAAK,SACf55C,IAAMo1C,GAAYr+B,GAAM,eAAeuyB,CAAc,GAErDuQ,IADgB,KAAK,IAAI,YAAY75C,CAAG,EACV,UAC9Bk+B,IAAc96B,EAAIy3B,GAAkB;AAAA,MACtC,cAAc;AAAA,MACd,YAAYyO;AAAA,MACZ,UAAU;AAAA,MACV,MAAMvyB;AAAA,IAClB,CAAS,GAAG,CAACgiB,MAAY31B,EAAI21B,GAAS,CAACj0B,MAASA,EAAK,CAAC,CAAC,CAAC;AAChD,QAAIg1C,GAAc5b,GAAa,EAAK,KAAK,CAAC7C,GAAsB;AAC5D,YAAMiB,IAAc9V,GAAO0X,GAAa,CAAC19B,GAAQu4B,GAASpS,OACtDjK,EAAQqc,GAAS,CAACjS,MAAgB;AAC9B,QAAIA,MACAtmB,EAAOsmB,EAAY,YAAY,IAAIH,GACnCjK,EAAQoK,EAAY,iBAAiB,CAACyV,MAAsB;AACxD,UAAA/7B,EAAO+7B,CAAiB,IAAI5V;AAAA,QAChC,CAAC;AAAA,MAET,CAAC,GACMnmB,IACR,CAAA,CAAE;AACL,aAAI46B,IACO,SAAUU,GAAQ;AACrB,YAAI0O;AACJ,cAAMpO,IAAY,KAAK,GAAG,CAAC,GACrB2d,IAAazd,EAAYF,EAAU,YAAY;AACrD,YAAIN,MAAW,UAAaie,MAAe,QAAW;AAClD,gBAAMC,KAAQxP,IAAK1O,EAAOie,CAAU,OAAO,QAAQvP,MAAO,SAAS,SAASA,EAAG;AAC/E,cAAIwP,MAAS,UAAaA,EAAK,KAAK,IAAI,MAAM;AAC1C;AAAA,QAER;AACA,eAAOD;AAAA,MACX,IAGO,WAAY;AACf,cAAM3d,IAAY,KAAK,GAAG,CAAC;AAC3B,eAAOE,EAAYF,EAAU,YAAY;AAAA,MAC7C;AAAA,IAER,MACK,QAAIhB,IACE,SAAUU,GAAQ;AACrB,YAAMC,IAAa,IAAIwd,GAAY,GAC7Bh5C,IAASu7B,MAAW,SAAY,IAAIA,EAAO;AACjD,eAASrzB,IAAI,GAAGA,IAAIlI,GAAQkI,KAAK;AAC7B,cAAMuxC,IAAuDle,IAAOrzB,CAAC,EAAE;AACvE,QAAAszB,EAAW,IAAItzB,GAAGuxC,MAAS,UAAaA,EAAK,KAAK,IAAI,CAAC;AAAA,MAC3D;AACA,YAAMx5C,IAASy5C,GAAgB,KAAK,MAAMN,GAAME,GAAe9d,GAAY6d,CAAO;AAClF,aAAO,OAAOp5C,KAAW,WAAWA,IAAS;AAAA,IACjD,IAGO,WAAY;AACf,YAAMA,IAASy5C,GAAgB,KAAK,MAAMN,GAAME,GAAeL,IAAkBI,CAAO;AACxF,aAAO,OAAOp5C,KAAW,WAAWA,IAAS;AAAA,IACjD;AAAA,EAER;AAAA,EACA,0BAA0B6I,GAAS;AAC/B,UAAM,EAAE,gBAAAigC,GAAgB,MAAAvyB,GAAM,UAAA+jB,GAAU,sBAAAO,EAAoB,IAAKhyB,GAC3DswC,IAAO,KAAK,MACZC,IAAU,KAAK,SACf55C,IAAMo1C,GAAYr+B,GAAM+jB,GAAUwO,CAAc,GAEhDuQ,IADgB,KAAK,IAAI,YAAY75C,CAAG,EACV,UAC9BwT,IAAOpQ,EAAIy3B,GAAkB;AAAA,MAC/B,cAAc;AAAA,MACd,YAAYyO;AAAA,MACZ,UAAAxO;AAAA,MACA,MAAA/jB;AAAA,IACZ,CAAS,GAAG,CAACjO,MACM1F,EAAI0F,GAAG,CAACoxC,MAAMA,EAAE,CAAC,CAAC,CAC5B;AACD,QAAIJ,GAActmC,CAAI,KAAKA,EAAK,CAAC,EAAE,CAAC,KAAK,CAAC6nB,GAAsB;AAC5D,YAAM5b,IAAMjM,EAAK,CAAC,GACZkpB,IAAoBnc,GAAQd,CAAG;AACrC,UAAIid,EAAkB,WAAW,KAC7BpV,GAAQoV,EAAkB,CAAC,EAAE,eAAe,GAAG;AAE/C,cAAMC,IADoBD,EAAkB,CAAC,EACI;AACjD,eAAO,WAAY;AACf,iBAAO,KAAK,GAAG,CAAC,EAAE,iBAAiBC;AAAA,QACvC;AAAA,MACJ,OACK;AACD,cAAML,IAAc9V,GAAOkW,GAAmB,CAACl8B,GAAQsmB,OAC/CA,MAAgB,WAChBtmB,EAAOsmB,EAAY,YAAY,IAAI,IACnCpK,EAAQoK,EAAY,iBAAiB,CAACyV,MAAsB;AACxD,UAAA/7B,EAAO+7B,CAAiB,IAAI;AAAA,QAChC,CAAC,IAEE/7B,IACR,CAAA,CAAE;AACL,eAAO,WAAY;AACf,gBAAM47B,IAAY,KAAK,GAAG,CAAC;AAC3B,iBAAOE,EAAYF,EAAU,YAAY,MAAM;AAAA,QACnD;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,WAAY;AACf,YAAM57B,IAASy5C,GAAgB,KAAK,MAAMN,GAAME,GAAeL,IAAkBI,CAAO;AACxF,aAAO,OAAOp5C,KAAW,WAAW,KAAQA,MAAW;AAAA,IAC3D;AAAA,EACJ;AACJ;AACA,SAASs5C,GAAcK,GAAWC,IAAa,IAAM;AACjD,QAAMC,IAAU,oBAAI,IAAG;AACvB,aAAW56B,KAAO06B,GAAW;AACzB,UAAMG,IAAS,oBAAI,IAAG;AACtB,eAAWh+B,KAAWmD,GAAK;AACvB,UAAInD,MAAY,QAAW;AACvB,YAAI89B;AAEA;AAGA,eAAO;AAAA,MAEf;AACA,YAAMG,IAAU,CAACj+B,EAAQ,YAAY,EAAE,OAAOA,EAAQ,eAAe;AACrE,iBAAWhc,KAASi6C;AAChB,YAAIF,EAAQ,IAAI/5C,CAAK;AACjB,cAAI,CAACg6C,EAAO,IAAIh6C,CAAK;AACjB,mBAAO;AAAA;AAIX,UAAA+5C,EAAQ,IAAI/5C,CAAK,GACjBg6C,EAAO,IAAIh6C,CAAK;AAAA,IAG5B;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAASo5C,GAAiBnD,GAAK;AAC3B,QAAMiE,IAAiBjE,EAAI,eAAe,QACpCkE,IAAgB,MAAMD,CAAc;AAC1C,WAAS/xC,IAAI,GAAGA,IAAI+xC,GAAgB/xC;AAChC,IAAAgyC,EAAchyC,CAAC,IAAI0wC,GAAe5C,EAAI,eAAe9tC,CAAC,GAAGA,CAAC;AAE9D,SAAOgyC;AACX;AACA,SAASR,GAAgBS,GAAWrB,GAAUC,GAAcM,GAAS;AACjE,QAAMe,IAAMD,EAAUrB,CAAQ,EAAEC,CAAY;AAC5C,MAAIl5C,IAAQu6C,EAAI;AAChB,MAAIv6C,MAAU,QAAW;AACrB,UAAMw6C,IAAUC,GAAkBF,EAAI,aAAa;AACnD,IAAAv6C,IAAQ06C,GAAYH,GAAKI,GAAYH,CAAO,CAAC,GAC7CD,EAAI,QAAQv6C;AAAA,EAChB;AAEA,SADY46C,GAAiB,MAAM,MAAM,CAACL,GAAKv6C,GAAOk5C,GAAcM,CAAO,CAAC;AAEhF;AACA,SAASoB,GAAiBL,GAAKM,GAAI3B,GAAcM,GAAS;AACtD,MAAIsB,IAAYD,GACZxyC,IAAI;AACR,QAAM3D,IAAO,CAAA;AACb,MAAIk3B,IAAI,KAAK,GAAGvzB,GAAG;AACnB,aAAa;AACT,QAAI0yC,IAAIC,GAAuBF,GAAWlf,CAAC;AAI3C,QAHImf,MAAM,WACNA,IAAIE,GAAuB,MAAM,MAAM,CAACV,GAAKO,GAAWlf,GAAGvzB,GAAG6wC,GAAcM,CAAO,CAAC,IAEpFuB,MAAMnC;AACN,aAAOsC,GAA0Bx2C,GAAMo2C,GAAWlf,CAAC;AAEvD,QAAImf,EAAE,kBAAkB;AACpB,aAAOA,EAAE;AAEb,IAAAD,IAAYC,GACZr2C,EAAK,KAAKk3B,CAAC,GACXA,IAAI,KAAK,GAAGvzB,GAAG;AAAA,EACnB;AACJ;AACA,SAAS4yC,GAAuBV,GAAKO,GAAWpqC,GAAOyqC,GAAWjC,GAAcM,GAAS;AACrF,QAAM4B,IAAQC,GAAgBP,EAAU,SAASpqC,GAAOwoC,CAAY;AACpE,MAAIkC,EAAM,SAAS;AACf,WAAAE,GAAWf,GAAKO,GAAWpqC,GAAOkoC,EAAS,GACpCA;AAEX,MAAI3lC,IAAW0nC,GAAYS,CAAK;AAChC,QAAMG,IAAeC,GAAaJ,GAAOlC,CAAY;AACrD,MAAIqC,MAAiB;AACjB,IAAAtoC,EAAS,gBAAgB,IACzBA,EAAS,aAAasoC,GACtBtoC,EAAS,QAAQ,YAAYsoC;AAAA,WAExBE,GAAiCL,CAAK,GAAG;AAC9C,UAAMzB,IAAarwC,GAAI8xC,EAAM,IAAI;AACjC,IAAAnoC,EAAS,gBAAgB,IACzBA,EAAS,aAAa0mC,GACtB1mC,EAAS,QAAQ,YAAY0mC,GAC7B+B,GAAyB,MAAM,MAAM,CAACnB,GAAKY,GAAWC,EAAM,MAAM5B,CAAO,CAAC;AAAA,EAC9E;AACA,SAAAvmC,IAAWqoC,GAAWf,GAAKO,GAAWpqC,GAAOuC,CAAQ,GAC9CA;AACX;AACA,SAASyoC,GAAyBnB,GAAKY,GAAWQ,GAAkBnC,GAAS;AACzE,QAAMoC,IAAa,CAAA;AACnB,WAASvzC,IAAI,GAAGA,KAAK8yC,GAAW9yC;AAC5B,IAAAuzC,EAAW,KAAK,KAAK,GAAGvzC,CAAC,EAAE,SAAS;AAExC,QAAMwzC,IAAWtB,EAAI,eACf5kB,IAAekmB,EAAS,MACxBnF,IAAamF,EAAS,YACtBjqC,IAAUkqC,GAAoB;AAAA,IAChC,cAAAnmB;AAAA,IACA,kBAAAgmB;AAAA,IACA,YAAAjF;AAAA,IACA,YAAAkF;AAAA,EACR,CAAK;AACD,EAAApC,EAAQ5nC,CAAO;AACnB;AACA,SAASkqC,GAAoB7yC,GAAS;AAClC,QAAMotB,IAAUrzB,EAAIiG,EAAQ,YAAY,CAACytB,MAAYza,GAAWya,CAAO,CAAC,EAAE,KAAK,IAAI,GAC7EH,IAAattB,EAAQ,WAAW,QAAQ,IAAI,KAAKA,EAAQ,WAAW;AAC1E,MAAIwtB,IAAc,qCAAqCxtB,EAAQ,iBAAiB,KAAK,IAAI,CAAC,SAASiV,GAAqBjV,EAAQ,UAAU,CAAC,GAAGstB,CAAU,aACxIttB,EAAQ,aAAa,IAAI;AAAA,GACjCotB,CAAO;AAAA;AACf,SAAAI,IACIA,IACI;AAAA,uBAEDA;AACX;AACA,SAASvY,GAAqB3B,GAAM;AAChC,MAAIA,aAAgBC;AAChB,WAAO;AAEN,MAAID,aAAgBiB;AACrB,WAAO;AAEN,MAAIjB,aAAgBU;AACrB,WAAO;AAEN,MAAIV,aAAgBM;AACrB,WAAO;AAEN,MAAIN,aAAgBO;AACrB,WAAO;AAEN,MAAIP,aAAgBS;AACrB,WAAO;AAEN,MAAIT,aAAgBQ;AACrB,WAAO;AAEN,MAAIR,aAAgBW;AACrB,WAAO;AAGP,QAAM,MAAM,sBAAsB;AAE1C;AACA,SAASg+B,GAA0Bx2C,GAAM4M,GAAUyqC,GAAS;AACxD,QAAMC,IAAkBj5C,GAAQuO,EAAS,QAAQ,UAAU,CAAC5I,MAAMA,EAAE,MAAM,WAAW,GAC/EuzC,IAAiB92C,GAAO62C,EACzB,OAAO,CAACtzC,MAAMA,aAAamtC,EAAc,EACzC,IAAI,CAACntC,MAAMA,EAAE,SAAS,GAAG,CAACA,MAAMA,EAAE,YAAY;AACnD,SAAO;AAAA,IACH,aAAaqzC;AAAA,IACb,oBAAoBE;AAAA,IACpB,WAAWv3C;AAAA,EACnB;AACA;AACA,SAASs2C,GAAuB1zC,GAAOoJ,GAAO;AAC1C,SAAOpJ,EAAM,MAAMoJ,EAAM,YAAY;AACzC;AACA,SAAS2qC,GAAgBa,GAASxrC,GAAOwoC,GAAc;AACnD,QAAMiD,IAAe,IAAItD,GAAY,GAC/BuD,IAAoB,CAAA;AAC1B,aAAW/vB,KAAK6vB,EAAQ,UAAU;AAC9B,QAAIhD,EAAa,GAAG7sB,EAAE,GAAG,MAAM;AAC3B;AAEJ,QAAIA,EAAE,MAAM,SAASgpB,IAAe;AAChC,MAAA+G,EAAkB,KAAK/vB,CAAC;AACxB;AAAA,IACJ;AACA,UAAMgwB,IAAmBhwB,EAAE,MAAM,YAAY;AAC7C,aAAShkB,IAAI,GAAGA,IAAIg0C,GAAkBh0C,KAAK;AACvC,YAAM4vC,IAAa5rB,EAAE,MAAM,YAAYhkB,CAAC,GAClCutC,IAAS0G,GAAmBrE,GAAYvnC,CAAK;AACnD,MAAIklC,MAAW,UACXuG,EAAa,IAAI;AAAA,QACb,OAAOvG;AAAA,QACP,KAAKvpB,EAAE;AAAA,QACP,OAAOA,EAAE;AAAA,MAC7B,CAAiB;AAAA,IAET;AAAA,EACJ;AACA,MAAI+uB;AAIJ,MAHIgB,EAAkB,WAAW,KAAKD,EAAa,SAAS,MACxDf,IAAQe,IAERf,MAAU,QAAW;AACrB,IAAAA,IAAQ,IAAIvC,GAAY;AACxB,eAAWxsB,KAAK8vB,EAAa;AACzB,MAAA3B,GAAQnuB,GAAG+uB,CAAK;AAAA,EAExB;AACA,MAAIgB,EAAkB,SAAS,KAAK,CAACG,GAAyBnB,CAAK;AAC/D,eAAW/uB,KAAK+vB;AACZ,MAAAhB,EAAM,IAAI/uB,CAAC;AAGnB,SAAO+uB;AACX;AACA,SAASkB,GAAmBrE,GAAYvnC,GAAO;AAC3C,MAAIunC,aAAsBpC,MACtBrhB,GAAa9jB,GAAOunC,EAAW,SAAS;AACxC,WAAOA,EAAW;AAG1B;AACA,SAASuD,GAAaU,GAAShD,GAAc;AACzC,MAAI75B;AACJ,aAAWgN,KAAK6vB,EAAQ;AACpB,QAAIhD,EAAa,GAAG7sB,EAAE,GAAG,MAAM;AAC3B,UAAIhN,MAAQ;AACR,QAAAA,IAAMgN,EAAE;AAAA,eAEHhN,MAAQgN,EAAE;AACf;AAAA;AAIZ,SAAOhN;AACX;AACA,SAASs7B,GAAYH,GAAS;AAC1B,SAAO;AAAA,IACH,SAASA;AAAA,IACT,OAAO,CAAA;AAAA,IACP,eAAe;AAAA,IACf,YAAY;AAAA,EACpB;AACA;AACA,SAASc,GAAWf,GAAKtmC,GAAMvD,GAAOK,GAAI;AACtC,SAAAA,IAAK2pC,GAAYH,GAAKxpC,CAAE,GACxBkD,EAAK,MAAMvD,EAAM,YAAY,IAAIK,GAC1BA;AACX;AACA,SAAS2pC,GAAYH,GAAKjzC,GAAO;AAC7B,MAAIA,MAAUsxC;AACV,WAAOtxC;AAIX,QAAMk1C,IAASl1C,EAAM,QAAQ,KACvBnB,IAAWo0C,EAAI,OAAOiC,CAAM;AAClC,SAAIr2C,MAAa,SACNA,KAEXmB,EAAM,QAAQ,SAAQ,GACtBizC,EAAI,OAAOiC,CAAM,IAAIl1C,GACdA;AACX;AACA,SAASmzC,GAAkBoB,GAAU;AACjC,QAAMK,IAAU,IAAIrD,GAAY,GAC1B4D,IAAsBZ,EAAS,YAAY;AACjD,WAASxzC,IAAI,GAAGA,IAAIo0C,GAAqBp0C,KAAK;AAE1C,UAAMumB,IAAS;AAAA,MACX,OAFWitB,EAAS,YAAYxzC,CAAC,EAAE;AAAA,MAGnC,KAAKA;AAAA,MACL,OAAO,CAAA;AAAA,IACnB;AACQ,IAAAmyC,GAAQ5rB,GAAQstB,CAAO;AAAA,EAC3B;AACA,SAAOA;AACX;AACA,SAAS1B,GAAQ5rB,GAAQstB,GAAS;AAC9B,QAAMQ,IAAI9tB,EAAO;AACjB,MAAI8tB,EAAE,SAASrH,IAAe;AAC1B,QAAIzmB,EAAO,MAAM,SAAS,GAAG;AACzB,YAAM+tB,IAAW,CAAC,GAAG/tB,EAAO,KAAK,GAE3BguB,IAAe;AAAA,QACjB,OAFgBD,EAAS,IAAG;AAAA,QAG5B,KAAK/tB,EAAO;AAAA,QACZ,OAAO+tB;AAAA,MACvB;AACY,MAAAnC,GAAQoC,GAAcV,CAAO;AAAA,IACjC;AAII,MAAAA,EAAQ,IAAIttB,CAAM;AAEtB;AAAA,EACJ;AACA,EAAK8tB,EAAE,0BACHR,EAAQ,IAAIttB,CAAM;AAEtB,QAAMytB,IAAmBK,EAAE,YAAY;AACvC,WAAS,IAAI,GAAG,IAAIL,GAAkB,KAAK;AACvC,UAAMpE,IAAayE,EAAE,YAAY,CAAC,GAC5BrwB,IAAIwwB,GAAiBjuB,GAAQqpB,CAAU;AAC7C,IAAI5rB,MAAM,UACNmuB,GAAQnuB,GAAG6vB,CAAO;AAAA,EAE1B;AACJ;AACA,SAASW,GAAiBjuB,GAAQqpB,GAAY;AAC1C,MAAIA,aAAsBnC;AACtB,WAAO;AAAA,MACH,OAAOmC,EAAW;AAAA,MAClB,KAAKrpB,EAAO;AAAA,MACZ,OAAOA,EAAO;AAAA,IAC1B;AAES,MAAIqpB,aAAsBlC,IAAgB;AAC3C,UAAM+G,IAAQ,CAAC,GAAGluB,EAAO,OAAOqpB,EAAW,WAAW;AACtD,WAAO;AAAA,MACH,OAAOA,EAAW;AAAA,MAClB,KAAKrpB,EAAO;AAAA,MACZ,OAAAkuB;AAAA,IACZ;AAAA,EACI;AAEJ;AACA,SAASP,GAAyBL,GAAS;AACvC,aAAW7vB,KAAK6vB,EAAQ;AACpB,QAAI7vB,EAAE,MAAM,SAASgpB;AACjB,aAAO;AAGf,SAAO;AACX;AACA,SAAS0H,GAA2Bb,GAAS;AACzC,aAAW7vB,KAAK6vB,EAAQ;AACpB,QAAI7vB,EAAE,MAAM,SAASgpB;AACjB,aAAO;AAGf,SAAO;AACX;AACA,SAASoG,GAAiCS,GAAS;AAC/C,MAAIa,GAA2Bb,CAAO;AAClC,WAAO;AAEX,QAAMc,IAAUC,GAAsBf,EAAQ,QAAQ;AAEtD,SADkBgB,GAAqBF,CAAO,KAAK,CAACG,GAA6BH,CAAO;AAE5F;AACA,SAASC,GAAsBf,GAAS;AACpC,QAAMkB,IAAe,oBAAI,IAAG;AAC5B,aAAW/wB,KAAK6vB,GAAS;AACrB,UAAMt8C,IAAMk5C,GAAgBzsB,GAAG,EAAK;AACpC,QAAIjZ,IAAOgqC,EAAa,IAAIx9C,CAAG;AAC/B,IAAIwT,MAAS,WACTA,IAAO,CAAA,GACPgqC,EAAa,IAAIx9C,GAAKwT,CAAI,IAE9BA,EAAKiZ,EAAE,GAAG,IAAI;AAAA,EAClB;AACA,SAAO+wB;AACX;AACA,SAASF,GAAqBF,GAAS;AACnC,aAAWz8C,KAAS,MAAM,KAAKy8C,EAAQ,OAAM,CAAE;AAC3C,QAAI,OAAO,KAAKz8C,CAAK,EAAE,SAAS;AAC5B,aAAO;AAGf,SAAO;AACX;AACA,SAAS48C,GAA6BH,GAAS;AAC3C,aAAWz8C,KAAS,MAAM,KAAKy8C,EAAQ,OAAM,CAAE;AAC3C,QAAI,OAAO,KAAKz8C,CAAK,EAAE,WAAW;AAC9B,aAAO;AAGf,SAAO;AACX;ACriBO,IAAI88C;AAAA,CACV,SAAUA,GAAa;AACpB,WAASC,EAAG/8C,GAAO;AACf,WAAO,OAAOA,KAAU;AAAA,EAC5B;AACA,EAAA88C,EAAY,KAAKC;AACrB,GAAGD,OAAgBA,KAAc,CAAA,EAAG;AAC7B,IAAIE;AAAAA,CACV,SAAUA,GAAK;AACZ,WAASD,EAAG/8C,GAAO;AACf,WAAO,OAAOA,KAAU;AAAA,EAC5B;AACA,EAAAg9C,EAAI,KAAKD;AACb,GAAGC,OAAQA,KAAM,CAAA,EAAG;AACb,IAAIC;AAAA,CACV,SAAUA,GAAS;AAChB,EAAAA,EAAQ,YAAY,aACpBA,EAAQ,YAAY;AACpB,WAASF,EAAG/8C,GAAO;AACf,WAAO,OAAOA,KAAU,YAAYi9C,EAAQ,aAAaj9C,KAASA,KAASi9C,EAAQ;AAAA,EACvF;AACA,EAAAA,EAAQ,KAAKF;AACjB,GAAGE,OAAYA,KAAU,CAAA,EAAG;AACrB,IAAIC;AAAA,CACV,SAAUA,GAAU;AACjB,EAAAA,EAAS,YAAY,GACrBA,EAAS,YAAY;AACrB,WAASH,EAAG/8C,GAAO;AACf,WAAO,OAAOA,KAAU,YAAYk9C,EAAS,aAAal9C,KAASA,KAASk9C,EAAS;AAAA,EACzF;AACA,EAAAA,EAAS,KAAKH;AAClB,GAAGG,OAAaA,KAAW,CAAA,EAAG;AAKvB,IAAIC;AAAA,CACV,SAAUA,GAAU;AAMjB,WAASC,EAAOnvB,GAAMovB,GAAW;AAC7B,WAAIpvB,MAAS,OAAO,cAChBA,IAAOivB,GAAS,YAEhBG,MAAc,OAAO,cACrBA,IAAYH,GAAS,YAElB,EAAE,MAAAjvB,GAAM,WAAAovB,EAAS;AAAA,EAC5B;AACA,EAAAF,EAAS,SAASC;AAIlB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKC,EAAG,SAASD,EAAU,IAAI,KAAKC,EAAG,SAASD,EAAU,SAAS;AAAA,EACxG;AACA,EAAAH,EAAS,KAAKJ;AAClB,GAAGI,OAAaA,KAAW,CAAA,EAAG;AAKvB,IAAIK;AAAA,CACV,SAAUA,GAAO;AACd,WAASJ,EAAOK,GAAKC,GAAKC,GAAOC,GAAM;AACnC,QAAIL,EAAG,SAASE,CAAG,KAAKF,EAAG,SAASG,CAAG,KAAKH,EAAG,SAASI,CAAK,KAAKJ,EAAG,SAASK,CAAI;AAC9E,aAAO,EAAE,OAAOT,GAAS,OAAOM,GAAKC,CAAG,GAAG,KAAKP,GAAS,OAAOQ,GAAOC,CAAI,EAAC;AAE3E,QAAIT,GAAS,GAAGM,CAAG,KAAKN,GAAS,GAAGO,CAAG;AACxC,aAAO,EAAE,OAAOD,GAAK,KAAKC,EAAG;AAG7B,UAAM,IAAI,MAAM,8CAA8CD,CAAG,KAAKC,CAAG,KAAKC,CAAK,KAAKC,CAAI,GAAG;AAAA,EAEvG;AACA,EAAAJ,EAAM,SAASJ;AAIf,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKH,GAAS,GAAGG,EAAU,KAAK,KAAKH,GAAS,GAAGG,EAAU,GAAG;AAAA,EACnG;AACA,EAAAE,EAAM,KAAKT;AACf,GAAGS,MAAUA,IAAQ,CAAA,EAAG;AAKjB,IAAIK;AAAA,CACV,SAAUA,GAAU;AAMjB,WAAST,EAAOU,GAAKp0C,GAAO;AACxB,WAAO,EAAE,KAAAo0C,GAAK,OAAAp0C,EAAK;AAAA,EACvB;AACA,EAAAm0C,EAAS,SAAST;AAIlB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKE,EAAM,GAAGF,EAAU,KAAK,MAAMC,EAAG,OAAOD,EAAU,GAAG,KAAKC,EAAG,UAAUD,EAAU,GAAG;AAAA,EAC9H;AACA,EAAAO,EAAS,KAAKd;AAClB,GAAGc,OAAaA,KAAW,CAAA,EAAG;AAKvB,IAAIE;AAAA,CACV,SAAUA,GAAc;AAQrB,WAASX,EAAOY,GAAWC,GAAaC,GAAsBC,GAAsB;AAChF,WAAO,EAAE,WAAAH,GAAW,aAAAC,GAAa,sBAAAC,GAAsB,sBAAAC,EAAoB;AAAA,EAC/E;AACA,EAAAJ,EAAa,SAASX;AAItB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKE,EAAM,GAAGF,EAAU,WAAW,KAAKC,EAAG,OAAOD,EAAU,SAAS,KAC/FE,EAAM,GAAGF,EAAU,oBAAoB,MACtCE,EAAM,GAAGF,EAAU,oBAAoB,KAAKC,EAAG,UAAUD,EAAU,oBAAoB;AAAA,EACnG;AACA,EAAAS,EAAa,KAAKhB;AACtB,GAAGgB,OAAiBA,KAAe,CAAA,EAAG;AAK/B,IAAIK;AAAA,CACV,SAAUA,GAAO;AAId,WAAShB,EAAOiB,GAAKC,GAAOC,GAAMC,GAAO;AACrC,WAAO;AAAA,MACH,KAAAH;AAAA,MACA,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,OAAAC;AAAA,IACZ;AAAA,EACI;AACA,EAAAJ,EAAM,SAAShB;AAIf,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKC,EAAG,YAAYD,EAAU,KAAK,GAAG,CAAC,KACjEC,EAAG,YAAYD,EAAU,OAAO,GAAG,CAAC,KACpCC,EAAG,YAAYD,EAAU,MAAM,GAAG,CAAC,KACnCC,EAAG,YAAYD,EAAU,OAAO,GAAG,CAAC;AAAA,EAC/C;AACA,EAAAc,EAAM,KAAKrB;AACf,GAAGqB,OAAUA,KAAQ,CAAA,EAAG;AAKjB,IAAIK;AAAA,CACV,SAAUA,GAAkB;AAIzB,WAASrB,EAAO1zC,GAAOg1C,GAAO;AAC1B,WAAO;AAAA,MACH,OAAAh1C;AAAA,MACA,OAAAg1C;AAAA,IACZ;AAAA,EACI;AACA,EAAAD,EAAiB,SAASrB;AAI1B,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKE,EAAM,GAAGF,EAAU,KAAK,KAAKc,GAAM,GAAGd,EAAU,KAAK;AAAA,EAC/F;AACA,EAAAmB,EAAiB,KAAK1B;AAC1B,GAAG0B,OAAqBA,KAAmB,CAAA,EAAG;AAKvC,IAAIE;AAAA,CACV,SAAUA,GAAmB;AAI1B,WAASvB,EAAOwB,GAAOC,GAAUC,GAAqB;AAClD,WAAO;AAAA,MACH,OAAAF;AAAA,MACA,UAAAC;AAAA,MACA,qBAAAC;AAAA,IACZ;AAAA,EACI;AACA,EAAAH,EAAkB,SAASvB;AAI3B,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKC,EAAG,OAAOD,EAAU,KAAK,MACvDC,EAAG,UAAUD,EAAU,QAAQ,KAAKyB,GAAS,GAAGzB,CAAS,OACzDC,EAAG,UAAUD,EAAU,mBAAmB,KAAKC,EAAG,WAAWD,EAAU,qBAAqByB,GAAS,EAAE;AAAA,EACnH;AACA,EAAAJ,EAAkB,KAAK5B;AAC3B,GAAG4B,OAAsBA,KAAoB,CAAA,EAAG;AAIzC,IAAIK;AAAA,CACV,SAAUA,GAAkB;AAIzB,EAAAA,EAAiB,UAAU,WAI3BA,EAAiB,UAAU,WAI3BA,EAAiB,SAAS;AAC9B,GAAGA,OAAqBA,KAAmB,CAAA,EAAG;AAKvC,IAAIC;AAAA,CACV,SAAUA,GAAc;AAIrB,WAAS7B,EAAOvqB,GAAWkB,GAASmrB,GAAgBC,GAAcC,GAAMC,GAAe;AACnF,UAAMx/C,IAAS;AAAA,MACX,WAAAgzB;AAAA,MACA,SAAAkB;AAAA,IACZ;AACQ,WAAIwpB,EAAG,QAAQ2B,CAAc,MACzBr/C,EAAO,iBAAiBq/C,IAExB3B,EAAG,QAAQ4B,CAAY,MACvBt/C,EAAO,eAAes/C,IAEtB5B,EAAG,QAAQ6B,CAAI,MACfv/C,EAAO,OAAOu/C,IAEd7B,EAAG,QAAQ8B,CAAa,MACxBx/C,EAAO,gBAAgBw/C,IAEpBx/C;AAAA,EACX;AACA,EAAAo/C,EAAa,SAAS7B;AAItB,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKC,EAAG,SAASD,EAAU,SAAS,KAAKC,EAAG,SAASD,EAAU,SAAS,MACjGC,EAAG,UAAUD,EAAU,cAAc,KAAKC,EAAG,SAASD,EAAU,cAAc,OAC9EC,EAAG,UAAUD,EAAU,YAAY,KAAKC,EAAG,SAASD,EAAU,YAAY,OAC1EC,EAAG,UAAUD,EAAU,IAAI,KAAKC,EAAG,OAAOD,EAAU,IAAI;AAAA,EACpE;AACA,EAAA2B,EAAa,KAAKlC;AACtB,GAAGkC,OAAiBA,KAAe,CAAA,EAAG;AAK/B,IAAIK;AAAA,CACV,SAAUA,GAA8B;AAIrC,WAASlC,EAAOmC,GAAUluC,GAAS;AAC/B,WAAO;AAAA,MACH,UAAAkuC;AAAA,MACA,SAAAluC;AAAA,IACZ;AAAA,EACI;AACA,EAAAiuC,EAA6B,SAASlC;AAItC,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKO,GAAS,GAAGP,EAAU,QAAQ,KAAKC,EAAG,OAAOD,EAAU,OAAO;AAAA,EAClG;AACA,EAAAgC,EAA6B,KAAKvC;AACtC,GAAGuC,OAAiCA,KAA+B,CAAA,EAAG;AAI/D,IAAIE;AAAA,CACV,SAAUA,GAAoB;AAI3B,EAAAA,EAAmB,QAAQ,GAI3BA,EAAmB,UAAU,GAI7BA,EAAmB,cAAc,GAIjCA,EAAmB,OAAO;AAC9B,GAAGA,OAAuBA,KAAqB,CAAA,EAAG;AAM3C,IAAIC;AAAA,CACV,SAAUA,GAAe;AAOtB,EAAAA,EAAc,cAAc,GAM5BA,EAAc,aAAa;AAC/B,GAAGA,OAAkBA,KAAgB,CAAA,EAAG;AAMjC,IAAIC;AAAA,CACV,SAAUA,GAAiB;AACxB,WAAS3C,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKC,EAAG,OAAOD,EAAU,IAAI;AAAA,EAClE;AACA,EAAAoC,EAAgB,KAAK3C;AACzB,GAAG2C,OAAoBA,KAAkB,CAAA,EAAG;AAKrC,IAAIC;AAAA,CACV,SAAUA,GAAY;AAInB,WAASvC,EAAO1zC,GAAO2H,GAASuuC,GAAUh+B,GAAM5iB,GAAQ6gD,GAAoB;AACxE,QAAIhgD,IAAS,EAAE,OAAA6J,GAAO,SAAA2H,EAAO;AAC7B,WAAIksC,EAAG,QAAQqC,CAAQ,MACnB//C,EAAO,WAAW+/C,IAElBrC,EAAG,QAAQ37B,CAAI,MACf/hB,EAAO,OAAO+hB,IAEd27B,EAAG,QAAQv+C,CAAM,MACjBa,EAAO,SAASb,IAEhBu+C,EAAG,QAAQsC,CAAkB,MAC7BhgD,EAAO,qBAAqBggD,IAEzBhgD;AAAA,EACX;AACA,EAAA8/C,EAAW,SAASvC;AAIpB,WAASL,EAAG/8C,GAAO;AACf,QAAI6pC;AACJ,QAAIyT,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KACpBE,EAAM,GAAGF,EAAU,KAAK,KACxBC,EAAG,OAAOD,EAAU,OAAO,MAC1BC,EAAG,OAAOD,EAAU,QAAQ,KAAKC,EAAG,UAAUD,EAAU,QAAQ,OAChEC,EAAG,QAAQD,EAAU,IAAI,KAAKC,EAAG,OAAOD,EAAU,IAAI,KAAKC,EAAG,UAAUD,EAAU,IAAI,OACtFC,EAAG,UAAUD,EAAU,eAAe,KAAMC,EAAG,QAAQ1T,IAAKyT,EAAU,qBAAqB,QAAQzT,MAAO,SAAS,SAASA,EAAG,IAAI,OACnI0T,EAAG,OAAOD,EAAU,MAAM,KAAKC,EAAG,UAAUD,EAAU,MAAM,OAC5DC,EAAG,UAAUD,EAAU,kBAAkB,KAAKC,EAAG,WAAWD,EAAU,oBAAoBgC,GAA6B,EAAE;AAAA,EACrI;AACA,EAAAK,EAAW,KAAK5C;AACpB,GAAG4C,OAAeA,KAAa,CAAA,EAAG;AAK3B,IAAIG;AAAA,CACV,SAAUA,GAAS;AAIhB,WAAS1C,EAAO2C,GAAOC,MAAYp8C,GAAM;AACrC,QAAI/D,IAAS,EAAE,OAAAkgD,GAAO,SAAAC,EAAO;AAC7B,WAAIzC,EAAG,QAAQ35C,CAAI,KAAKA,EAAK,SAAS,MAClC/D,EAAO,YAAY+D,IAEhB/D;AAAA,EACX;AACA,EAAAigD,EAAQ,SAAS1C;AAIjB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKC,EAAG,OAAOD,EAAU,KAAK,KAAKC,EAAG,OAAOD,EAAU,OAAO;AAAA,EAC7F;AACA,EAAAwC,EAAQ,KAAK/C;AACjB,GAAG+C,OAAYA,KAAU,CAAA,EAAG;AAKrB,IAAIf;AAAA,CACV,SAAUA,GAAU;AAMjB,WAASkB,EAAQv2C,GAAOw2C,GAAS;AAC7B,WAAO,EAAE,OAAAx2C,GAAO,SAAAw2C,EAAO;AAAA,EAC3B;AACA,EAAAnB,EAAS,UAAUkB;AAMnB,WAASE,EAAOC,GAAUF,GAAS;AAC/B,WAAO,EAAE,OAAO,EAAE,OAAOE,GAAU,KAAKA,EAAQ,GAAI,SAAAF,EAAO;AAAA,EAC/D;AACA,EAAAnB,EAAS,SAASoB;AAKlB,WAASE,EAAI32C,GAAO;AAChB,WAAO,EAAE,OAAAA,GAAO,SAAS,GAAE;AAAA,EAC/B;AACA,EAAAq1C,EAAS,MAAMsB;AACf,WAAStD,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAC1BC,EAAG,OAAOD,EAAU,OAAO,KAC3BE,EAAM,GAAGF,EAAU,KAAK;AAAA,EACnC;AACA,EAAAyB,EAAS,KAAKhC;AAClB,GAAGgC,OAAaA,KAAW,CAAA,EAAG;AACvB,IAAIuB;AAAA,CACV,SAAUA,GAAkB;AACzB,WAASlD,EAAOwB,GAAO2B,GAAmBC,GAAa;AACnD,UAAM3gD,IAAS,EAAE,OAAA++C,EAAK;AACtB,WAAI2B,MAAsB,WACtB1gD,EAAO,oBAAoB0gD,IAE3BC,MAAgB,WAChB3gD,EAAO,cAAc2gD,IAElB3gD;AAAA,EACX;AACA,EAAAygD,EAAiB,SAASlD;AAC1B,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKC,EAAG,OAAOD,EAAU,KAAK,MAC1DC,EAAG,QAAQD,EAAU,iBAAiB,KAAKA,EAAU,sBAAsB,YAC3EC,EAAG,OAAOD,EAAU,WAAW,KAAKA,EAAU,gBAAgB;AAAA,EACvE;AACA,EAAAgD,EAAiB,KAAKvD;AAC1B,GAAGuD,OAAqBA,KAAmB,CAAA,EAAG;AACvC,IAAIG;AAAA,CACV,SAAUA,GAA4B;AACnC,WAAS1D,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,OAAOD,CAAS;AAAA,EAC9B;AACA,EAAAmD,EAA2B,KAAK1D;AACpC,GAAG0D,OAA+BA,KAA6B,CAAA,EAAG;AAC3D,IAAIC;AAAA,CACV,SAAUA,GAAmB;AAQ1B,WAAST,EAAQv2C,GAAOw2C,GAASS,GAAY;AACzC,WAAO,EAAE,OAAAj3C,GAAO,SAAAw2C,GAAS,cAAcS,EAAU;AAAA,EACrD;AACA,EAAAD,EAAkB,UAAUT;AAQ5B,WAASE,EAAOC,GAAUF,GAASS,GAAY;AAC3C,WAAO,EAAE,OAAO,EAAE,OAAOP,GAAU,KAAKA,KAAY,SAAAF,GAAS,cAAcS,EAAU;AAAA,EACzF;AACA,EAAAD,EAAkB,SAASP;AAO3B,WAASE,EAAI32C,GAAOi3C,GAAY;AAC5B,WAAO,EAAE,OAAAj3C,GAAO,SAAS,IAAI,cAAci3C,EAAU;AAAA,EACzD;AACA,EAAAD,EAAkB,MAAML;AACxB,WAAStD,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAO++C,GAAS,GAAGzB,CAAS,MAAMgD,GAAiB,GAAGhD,EAAU,YAAY,KAAKmD,GAA2B,GAAGnD,EAAU,YAAY;AAAA,EACzI;AACA,EAAAoD,EAAkB,KAAK3D;AAC3B,GAAG2D,OAAsBA,KAAoB,CAAA,EAAG;AAKzC,IAAIE;AAAA,CACV,SAAUA,GAAkB;AAIzB,WAASxD,EAAOyD,GAAcC,GAAO;AACjC,WAAO,EAAE,cAAAD,GAAc,OAAAC,EAAK;AAAA,EAChC;AACA,EAAAF,EAAiB,SAASxD;AAC1B,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KACpByD,GAAwC,GAAGzD,EAAU,YAAY,KACjE,MAAM,QAAQA,EAAU,KAAK;AAAA,EACxC;AACA,EAAAsD,EAAiB,KAAK7D;AAC1B,GAAG6D,OAAqBA,KAAmB,CAAA,EAAG;AACvC,IAAII;AAAA,CACV,SAAUA,GAAY;AACnB,WAAS5D,EAAOU,GAAKp1C,GAASi4C,GAAY;AACtC,QAAI9gD,IAAS;AAAA,MACT,MAAM;AAAA,MACN,KAAAi+C;AAAA,IACZ;AACQ,WAAIp1C,MAAY,WAAcA,EAAQ,cAAc,UAAaA,EAAQ,mBAAmB,YACxF7I,EAAO,UAAU6I,IAEjBi4C,MAAe,WACf9gD,EAAO,eAAe8gD,IAEnB9gD;AAAA,EACX;AACA,EAAAmhD,EAAW,SAAS5D;AACpB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOs9C,KAAaA,EAAU,SAAS,YAAYC,EAAG,OAAOD,EAAU,GAAG,MAAMA,EAAU,YAAY,WAChGA,EAAU,QAAQ,cAAc,UAAaC,EAAG,QAAQD,EAAU,QAAQ,SAAS,OAAOA,EAAU,QAAQ,mBAAmB,UAAaC,EAAG,QAAQD,EAAU,QAAQ,cAAc,QAASA,EAAU,iBAAiB,UAAamD,GAA2B,GAAGnD,EAAU,YAAY;AAAA,EACtS;AACA,EAAA0D,EAAW,KAAKjE;AACpB,GAAGiE,OAAeA,KAAa,CAAA,EAAG;AAC3B,IAAIC;AAAA,CACV,SAAUA,GAAY;AACnB,WAAS7D,EAAO8D,GAAQC,GAAQz4C,GAASi4C,GAAY;AACjD,QAAI9gD,IAAS;AAAA,MACT,MAAM;AAAA,MACN,QAAAqhD;AAAA,MACA,QAAAC;AAAA,IACZ;AACQ,WAAIz4C,MAAY,WAAcA,EAAQ,cAAc,UAAaA,EAAQ,mBAAmB,YACxF7I,EAAO,UAAU6I,IAEjBi4C,MAAe,WACf9gD,EAAO,eAAe8gD,IAEnB9gD;AAAA,EACX;AACA,EAAAohD,EAAW,SAAS7D;AACpB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOs9C,KAAaA,EAAU,SAAS,YAAYC,EAAG,OAAOD,EAAU,MAAM,KAAKC,EAAG,OAAOD,EAAU,MAAM,MAAMA,EAAU,YAAY,WAClIA,EAAU,QAAQ,cAAc,UAAaC,EAAG,QAAQD,EAAU,QAAQ,SAAS,OAAOA,EAAU,QAAQ,mBAAmB,UAAaC,EAAG,QAAQD,EAAU,QAAQ,cAAc,QAASA,EAAU,iBAAiB,UAAamD,GAA2B,GAAGnD,EAAU,YAAY;AAAA,EACtS;AACA,EAAA2D,EAAW,KAAKlE;AACpB,GAAGkE,OAAeA,KAAa,CAAA,EAAG;AAC3B,IAAIG;AAAA,CACV,SAAUA,GAAY;AACnB,WAAShE,EAAOU,GAAKp1C,GAASi4C,GAAY;AACtC,QAAI9gD,IAAS;AAAA,MACT,MAAM;AAAA,MACN,KAAAi+C;AAAA,IACZ;AACQ,WAAIp1C,MAAY,WAAcA,EAAQ,cAAc,UAAaA,EAAQ,sBAAsB,YAC3F7I,EAAO,UAAU6I,IAEjBi4C,MAAe,WACf9gD,EAAO,eAAe8gD,IAEnB9gD;AAAA,EACX;AACA,EAAAuhD,EAAW,SAAShE;AACpB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOs9C,KAAaA,EAAU,SAAS,YAAYC,EAAG,OAAOD,EAAU,GAAG,MAAMA,EAAU,YAAY,WAChGA,EAAU,QAAQ,cAAc,UAAaC,EAAG,QAAQD,EAAU,QAAQ,SAAS,OAAOA,EAAU,QAAQ,sBAAsB,UAAaC,EAAG,QAAQD,EAAU,QAAQ,iBAAiB,QAASA,EAAU,iBAAiB,UAAamD,GAA2B,GAAGnD,EAAU,YAAY;AAAA,EAC5S;AACA,EAAA8D,EAAW,KAAKrE;AACpB,GAAGqE,OAAeA,KAAa,CAAA,EAAG;AAC3B,IAAIC;AAAA,CACV,SAAUA,GAAe;AACtB,WAAStE,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOs9C,MACFA,EAAU,YAAY,UAAaA,EAAU,oBAAoB,YACjEA,EAAU,oBAAoB,UAAaA,EAAU,gBAAgB,MAAM,CAACgE,MACrE/D,EAAG,OAAO+D,EAAO,IAAI,IACdN,GAAW,GAAGM,CAAM,KAAKL,GAAW,GAAGK,CAAM,KAAKF,GAAW,GAAGE,CAAM,IAGtEV,GAAiB,GAAGU,CAAM,CAExC;AAAA,EACT;AACA,EAAAD,EAAc,KAAKtE;AACvB,GAAGsE,OAAkBA,KAAgB,CAAA,EAAG;AACxC,MAAME,GAAmB;AAAA,EACrB,YAAYT,GAAOU,GAAmB;AAClC,SAAK,QAAQV,GACb,KAAK,oBAAoBU;AAAA,EAC7B;AAAA,EACA,OAAOpB,GAAUF,GAASS,GAAY;AAClC,QAAIc,GACAC;AAcJ,QAbIf,MAAe,SACfc,IAAO1C,GAAS,OAAOqB,GAAUF,CAAO,IAEnCO,GAA2B,GAAGE,CAAU,KAC7Ce,IAAKf,GACLc,IAAOf,GAAkB,OAAON,GAAUF,GAASS,CAAU,MAG7D,KAAK,wBAAwB,KAAK,iBAAiB,GACnDe,IAAK,KAAK,kBAAkB,OAAOf,CAAU,GAC7Cc,IAAOf,GAAkB,OAAON,GAAUF,GAASwB,CAAE,IAEzD,KAAK,MAAM,KAAKD,CAAI,GAChBC,MAAO;AACP,aAAOA;AAAA,EAEf;AAAA,EACA,QAAQh4C,GAAOw2C,GAASS,GAAY;AAChC,QAAIc,GACAC;AAcJ,QAbIf,MAAe,SACfc,IAAO1C,GAAS,QAAQr1C,GAAOw2C,CAAO,IAEjCO,GAA2B,GAAGE,CAAU,KAC7Ce,IAAKf,GACLc,IAAOf,GAAkB,QAAQh3C,GAAOw2C,GAASS,CAAU,MAG3D,KAAK,wBAAwB,KAAK,iBAAiB,GACnDe,IAAK,KAAK,kBAAkB,OAAOf,CAAU,GAC7Cc,IAAOf,GAAkB,QAAQh3C,GAAOw2C,GAASwB,CAAE,IAEvD,KAAK,MAAM,KAAKD,CAAI,GAChBC,MAAO;AACP,aAAOA;AAAA,EAEf;AAAA,EACA,OAAOh4C,GAAOi3C,GAAY;AACtB,QAAIc,GACAC;AAcJ,QAbIf,MAAe,SACfc,IAAO1C,GAAS,IAAIr1C,CAAK,IAEpB+2C,GAA2B,GAAGE,CAAU,KAC7Ce,IAAKf,GACLc,IAAOf,GAAkB,IAAIh3C,GAAOi3C,CAAU,MAG9C,KAAK,wBAAwB,KAAK,iBAAiB,GACnDe,IAAK,KAAK,kBAAkB,OAAOf,CAAU,GAC7Cc,IAAOf,GAAkB,IAAIh3C,GAAOg4C,CAAE,IAE1C,KAAK,MAAM,KAAKD,CAAI,GAChBC,MAAO;AACP,aAAOA;AAAA,EAEf;AAAA,EACA,IAAID,GAAM;AACN,SAAK,MAAM,KAAKA,CAAI;AAAA,EACxB;AAAA,EACA,MAAM;AACF,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,QAAQ;AACJ,SAAK,MAAM,OAAO,GAAG,KAAK,MAAM,MAAM;AAAA,EAC1C;AAAA,EACA,wBAAwBzhD,GAAO;AAC3B,QAAIA,MAAU;AACV,YAAM,IAAI,MAAM,kEAAkE;AAAA,EAE1F;AACJ;AAIA,MAAM2hD,GAAkB;AAAA,EACpB,YAAYC,GAAa;AACrB,SAAK,eAAeA,MAAgB,SAAY,uBAAO,OAAO,IAAI,IAAIA,GACtE,KAAK,WAAW,GAChB,KAAK,QAAQ;AAAA,EACjB;AAAA,EACA,MAAM;AACF,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,OAAO;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAOC,GAAgBlB,GAAY;AAC/B,QAAIe;AAQJ,QAPIjB,GAA2B,GAAGoB,CAAc,IAC5CH,IAAKG,KAGLH,IAAK,KAAK,OAAM,GAChBf,IAAakB,IAEb,KAAK,aAAaH,CAAE,MAAM;AAC1B,YAAM,IAAI,MAAM,MAAMA,CAAE,qBAAqB;AAEjD,QAAIf,MAAe;AACf,YAAM,IAAI,MAAM,iCAAiCe,CAAE,EAAE;AAEzD,gBAAK,aAAaA,CAAE,IAAIf,GACxB,KAAK,SACEe;AAAA,EACX;AAAA,EACA,SAAS;AACL,gBAAK,YACE,KAAK,SAAS,SAAQ;AAAA,EACjC;AACJ;AAIO,MAAMI,GAAgB;AAAA,EACzB,YAAYC,GAAe;AACvB,SAAK,mBAAmB,uBAAO,OAAO,IAAI,GACtCA,MAAkB,UAClB,KAAK,iBAAiBA,GAClBA,EAAc,mBACd,KAAK,qBAAqB,IAAIJ,GAAkBI,EAAc,iBAAiB,GAC/EA,EAAc,oBAAoB,KAAK,mBAAmB,IAAG,GAC7DA,EAAc,gBAAgB,QAAQ,CAACT,MAAW;AAC9C,UAAIV,GAAiB,GAAGU,CAAM,GAAG;AAC7B,cAAMU,IAAiB,IAAIT,GAAmBD,EAAO,OAAO,KAAK,kBAAkB;AACnF,aAAK,iBAAiBA,EAAO,aAAa,GAAG,IAAIU;AAAA,MACrD;AAAA,IACJ,CAAC,KAEID,EAAc,WACnB,OAAO,KAAKA,EAAc,OAAO,EAAE,QAAQ,CAAC1iD,MAAQ;AAChD,YAAM2iD,IAAiB,IAAIT,GAAmBQ,EAAc,QAAQ1iD,CAAG,CAAC;AACxE,WAAK,iBAAiBA,CAAG,IAAI2iD;AAAA,IACjC,CAAC,KAIL,KAAK,iBAAiB,CAAA;AAAA,EAE9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,OAAO;AACP,gBAAK,oBAAmB,GACpB,KAAK,uBAAuB,WACxB,KAAK,mBAAmB,SAAS,IACjC,KAAK,eAAe,oBAAoB,SAGxC,KAAK,eAAe,oBAAoB,KAAK,mBAAmB,IAAG,IAGpE,KAAK;AAAA,EAChB;AAAA,EACA,kBAAkB3iD,GAAK;AACnB,QAAI0hD,GAAwC,GAAG1hD,CAAG,GAAG;AAEjD,UADA,KAAK,oBAAmB,GACpB,KAAK,eAAe,oBAAoB;AACxC,cAAM,IAAI,MAAM,wDAAwD;AAE5E,YAAMwhD,IAAe,EAAE,KAAKxhD,EAAI,KAAK,SAASA,EAAI,QAAO;AACzD,UAAIQ,IAAS,KAAK,iBAAiBghD,EAAa,GAAG;AACnD,UAAI,CAAChhD,GAAQ;AACT,cAAMihD,IAAQ,CAAA,GACRmB,IAAmB;AAAA,UACrB,cAAApB;AAAA,UACA,OAAAC;AAAA,QACpB;AACgB,aAAK,eAAe,gBAAgB,KAAKmB,CAAgB,GACzDpiD,IAAS,IAAI0hD,GAAmBT,GAAO,KAAK,kBAAkB,GAC9D,KAAK,iBAAiBD,EAAa,GAAG,IAAIhhD;AAAA,MAC9C;AACA,aAAOA;AAAA,IACX,OACK;AAED,UADA,KAAK,YAAW,GACZ,KAAK,eAAe,YAAY;AAChC,cAAM,IAAI,MAAM,gEAAgE;AAEpF,UAAIA,IAAS,KAAK,iBAAiBR,CAAG;AACtC,UAAI,CAACQ,GAAQ;AACT,YAAIihD,IAAQ,CAAA;AACZ,aAAK,eAAe,QAAQzhD,CAAG,IAAIyhD,GACnCjhD,IAAS,IAAI0hD,GAAmBT,CAAK,GACrC,KAAK,iBAAiBzhD,CAAG,IAAIQ;AAAA,MACjC;AACA,aAAOA;AAAA,IACX;AAAA,EACJ;AAAA,EACA,sBAAsB;AAClB,IAAI,KAAK,eAAe,oBAAoB,UAAa,KAAK,eAAe,YAAY,WACrF,KAAK,qBAAqB,IAAI8hD,GAAiB,GAC/C,KAAK,eAAe,kBAAkB,CAAA,GACtC,KAAK,eAAe,oBAAoB,KAAK,mBAAmB,IAAG;AAAA,EAE3E;AAAA,EACA,cAAc;AACV,IAAI,KAAK,eAAe,oBAAoB,UAAa,KAAK,eAAe,YAAY,WACrF,KAAK,eAAe,UAAU,uBAAO,OAAO,IAAI;AAAA,EAExD;AAAA,EACA,WAAW7D,GAAKoE,GAAqBx5C,GAAS;AAE1C,QADA,KAAK,oBAAmB,GACpB,KAAK,eAAe,oBAAoB;AACxC,YAAM,IAAI,MAAM,wDAAwD;AAE5E,QAAIi4C;AACJ,IAAIL,GAAiB,GAAG4B,CAAmB,KAAKzB,GAA2B,GAAGyB,CAAmB,IAC7FvB,IAAauB,IAGbx5C,IAAUw5C;AAEd,QAAIC,GACAT;AASJ,QARIf,MAAe,SACfwB,IAAYnB,GAAW,OAAOlD,GAAKp1C,CAAO,KAG1Cg5C,IAAKjB,GAA2B,GAAGE,CAAU,IAAIA,IAAa,KAAK,mBAAmB,OAAOA,CAAU,GACvGwB,IAAYnB,GAAW,OAAOlD,GAAKp1C,GAASg5C,CAAE,IAElD,KAAK,eAAe,gBAAgB,KAAKS,CAAS,GAC9CT,MAAO;AACP,aAAOA;AAAA,EAEf;AAAA,EACA,WAAWR,GAAQC,GAAQe,GAAqBx5C,GAAS;AAErD,QADA,KAAK,oBAAmB,GACpB,KAAK,eAAe,oBAAoB;AACxC,YAAM,IAAI,MAAM,wDAAwD;AAE5E,QAAIi4C;AACJ,IAAIL,GAAiB,GAAG4B,CAAmB,KAAKzB,GAA2B,GAAGyB,CAAmB,IAC7FvB,IAAauB,IAGbx5C,IAAUw5C;AAEd,QAAIC,GACAT;AASJ,QARIf,MAAe,SACfwB,IAAYlB,GAAW,OAAOC,GAAQC,GAAQz4C,CAAO,KAGrDg5C,IAAKjB,GAA2B,GAAGE,CAAU,IAAIA,IAAa,KAAK,mBAAmB,OAAOA,CAAU,GACvGwB,IAAYlB,GAAW,OAAOC,GAAQC,GAAQz4C,GAASg5C,CAAE,IAE7D,KAAK,eAAe,gBAAgB,KAAKS,CAAS,GAC9CT,MAAO;AACP,aAAOA;AAAA,EAEf;AAAA,EACA,WAAW5D,GAAKoE,GAAqBx5C,GAAS;AAE1C,QADA,KAAK,oBAAmB,GACpB,KAAK,eAAe,oBAAoB;AACxC,YAAM,IAAI,MAAM,wDAAwD;AAE5E,QAAIi4C;AACJ,IAAIL,GAAiB,GAAG4B,CAAmB,KAAKzB,GAA2B,GAAGyB,CAAmB,IAC7FvB,IAAauB,IAGbx5C,IAAUw5C;AAEd,QAAIC,GACAT;AASJ,QARIf,MAAe,SACfwB,IAAYf,GAAW,OAAOtD,GAAKp1C,CAAO,KAG1Cg5C,IAAKjB,GAA2B,GAAGE,CAAU,IAAIA,IAAa,KAAK,mBAAmB,OAAOA,CAAU,GACvGwB,IAAYf,GAAW,OAAOtD,GAAKp1C,GAASg5C,CAAE,IAElD,KAAK,eAAe,gBAAgB,KAAKS,CAAS,GAC9CT,MAAO;AACP,aAAOA;AAAA,EAEf;AACJ;AAKO,IAAIU;AAAA,CACV,SAAUA,GAAwB;AAK/B,WAAShF,EAAOU,GAAK;AACjB,WAAO,EAAE,KAAAA,EAAG;AAAA,EAChB;AACA,EAAAsE,EAAuB,SAAShF;AAIhC,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKC,EAAG,OAAOD,EAAU,GAAG;AAAA,EAC3D;AACA,EAAA8E,EAAuB,KAAKrF;AAChC,GAAGqF,OAA2BA,KAAyB,CAAA,EAAG;AAKnD,IAAIC;AAAA,CACV,SAAUA,GAAiC;AAMxC,WAASjF,EAAOU,GAAKwE,GAAS;AAC1B,WAAO,EAAE,KAAAxE,GAAK,SAAAwE,EAAO;AAAA,EACzB;AACA,EAAAD,EAAgC,SAASjF;AAIzC,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKC,EAAG,OAAOD,EAAU,GAAG,KAAKC,EAAG,QAAQD,EAAU,OAAO;AAAA,EAC5F;AACA,EAAA+E,EAAgC,KAAKtF;AACzC,GAAGsF,OAAoCA,KAAkC,CAAA,EAAG;AAKrE,IAAItB;AAAA,CACV,SAAUA,GAAyC;AAMhD,WAAS3D,EAAOU,GAAKwE,GAAS;AAC1B,WAAO,EAAE,KAAAxE,GAAK,SAAAwE,EAAO;AAAA,EACzB;AACA,EAAAvB,EAAwC,SAAS3D;AAIjD,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKC,EAAG,OAAOD,EAAU,GAAG,MAAMA,EAAU,YAAY,QAAQC,EAAG,QAAQD,EAAU,OAAO;AAAA,EAC3H;AACA,EAAAyD,EAAwC,KAAKhE;AACjD,GAAGgE,OAA4CA,KAA0C,CAAA,EAAG;AAKrF,IAAIwB;AAAA,CACV,SAAUA,GAAkB;AAQzB,WAASnF,EAAOU,GAAK0E,GAAYF,GAAS12B,GAAM;AAC5C,WAAO,EAAE,KAAAkyB,GAAK,YAAA0E,GAAY,SAAAF,GAAS,MAAA12B,EAAI;AAAA,EAC3C;AACA,EAAA22B,EAAiB,SAASnF;AAI1B,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKC,EAAG,OAAOD,EAAU,GAAG,KAAKC,EAAG,OAAOD,EAAU,UAAU,KAAKC,EAAG,QAAQD,EAAU,OAAO,KAAKC,EAAG,OAAOD,EAAU,IAAI;AAAA,EAC5J;AACA,EAAAiF,EAAiB,KAAKxF;AAC1B,GAAGwF,OAAqBA,KAAmB,CAAA,EAAG;AAQvC,IAAIE;AAAA,CACV,SAAUA,GAAY;AAInB,EAAAA,EAAW,YAAY,aAIvBA,EAAW,WAAW;AAItB,WAAS1F,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOs9C,MAAcmF,EAAW,aAAanF,MAAcmF,EAAW;AAAA,EAC1E;AACA,EAAAA,EAAW,KAAK1F;AACpB,GAAG0F,OAAeA,KAAa,CAAA,EAAG;AAC3B,IAAIC;AAAA,CACV,SAAUA,GAAe;AAItB,WAAS3F,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcv9C,CAAK,KAAKyiD,GAAW,GAAGnF,EAAU,IAAI,KAAKC,EAAG,OAAOD,EAAU,KAAK;AAAA,EAChG;AACA,EAAAoF,EAAc,KAAK3F;AACvB,GAAG2F,OAAkBA,KAAgB,CAAA,EAAG;AAIjC,IAAIC;AAAA,CACV,SAAUA,GAAoB;AAC3B,EAAAA,EAAmB,OAAO,GAC1BA,EAAmB,SAAS,GAC5BA,EAAmB,WAAW,GAC9BA,EAAmB,cAAc,GACjCA,EAAmB,QAAQ,GAC3BA,EAAmB,WAAW,GAC9BA,EAAmB,QAAQ,GAC3BA,EAAmB,YAAY,GAC/BA,EAAmB,SAAS,GAC5BA,EAAmB,WAAW,IAC9BA,EAAmB,OAAO,IAC1BA,EAAmB,QAAQ,IAC3BA,EAAmB,OAAO,IAC1BA,EAAmB,UAAU,IAC7BA,EAAmB,UAAU,IAC7BA,EAAmB,QAAQ,IAC3BA,EAAmB,OAAO,IAC1BA,EAAmB,YAAY,IAC/BA,EAAmB,SAAS,IAC5BA,EAAmB,aAAa,IAChCA,EAAmB,WAAW,IAC9BA,EAAmB,SAAS,IAC5BA,EAAmB,QAAQ,IAC3BA,EAAmB,WAAW,IAC9BA,EAAmB,gBAAgB;AACvC,GAAGA,OAAuBA,KAAqB,CAAA,EAAG;AAK3C,IAAIC;AAAA,CACV,SAAUA,GAAkB;AAIzB,EAAAA,EAAiB,YAAY,GAW7BA,EAAiB,UAAU;AAC/B,GAAGA,OAAqBA,KAAmB,CAAA,EAAG;AAOvC,IAAIC;AAAA,CACV,SAAUA,GAAmB;AAI1B,EAAAA,EAAkB,aAAa;AACnC,GAAGA,OAAsBA,KAAoB,CAAA,EAAG;AAMzC,IAAIC;AAAA,CACV,SAAUA,GAAmB;AAI1B,WAAS1F,EAAO8C,GAASC,GAAQF,GAAS;AACtC,WAAO,EAAE,SAAAC,GAAS,QAAAC,GAAQ,SAAAF,EAAO;AAAA,EACrC;AACA,EAAA6C,EAAkB,SAAS1F;AAI3B,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOs9C,KAAaC,EAAG,OAAOD,EAAU,OAAO,KAAKE,EAAM,GAAGF,EAAU,MAAM,KAAKE,EAAM,GAAGF,EAAU,OAAO;AAAA,EAChH;AACA,EAAAwF,EAAkB,KAAK/F;AAC3B,GAAG+F,OAAsBA,KAAoB,CAAA,EAAG;AAOzC,IAAIC;AAAA,CACV,SAAUA,GAAgB;AAQvB,EAAAA,EAAe,OAAO,GAUtBA,EAAe,oBAAoB;AACvC,GAAGA,OAAmBA,KAAiB,CAAA,EAAG;AACnC,IAAIC;AAAA,CACV,SAAUA,GAA4B;AACnC,WAASjG,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOs9C,MAAcC,EAAG,OAAOD,EAAU,MAAM,KAAKA,EAAU,WAAW,YACpEC,EAAG,OAAOD,EAAU,WAAW,KAAKA,EAAU,gBAAgB;AAAA,EACvE;AACA,EAAA0F,EAA2B,KAAKjG;AACpC,GAAGiG,OAA+BA,KAA6B,CAAA,EAAG;AAK3D,IAAIC;AAAA,CACV,SAAUA,GAAgB;AAKvB,WAAS7F,EAAOwB,GAAO;AACnB,WAAO,EAAE,OAAAA,EAAK;AAAA,EAClB;AACA,EAAAqE,EAAe,SAAS7F;AAC5B,GAAG6F,OAAmBA,KAAiB,CAAA,EAAG;AAKnC,IAAIC;AAAA,CACV,SAAUA,GAAgB;AAOvB,WAAS9F,EAAO+F,GAAOC,GAAc;AACjC,WAAO,EAAE,OAAOD,KAAgB,CAAA,GAAI,cAAc,CAAC,CAACC,EAAY;AAAA,EACpE;AACA,EAAAF,EAAe,SAAS9F;AAC5B,GAAG8F,OAAmBA,KAAiB,CAAA,EAAG;AACnC,IAAIG;AAAA,CACV,SAAUA,GAAc;AAMrB,WAASC,EAAcC,GAAW;AAC9B,WAAOA,EAAU,QAAQ,yBAAyB,MAAM;AAAA,EAC5D;AACA,EAAAF,EAAa,gBAAgBC;AAI7B,WAASvG,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,OAAOD,CAAS,KAAMC,EAAG,cAAcD,CAAS,KAAKC,EAAG,OAAOD,EAAU,QAAQ,KAAKC,EAAG,OAAOD,EAAU,KAAK;AAAA,EAC7H;AACA,EAAA+F,EAAa,KAAKtG;AACtB,GAAGsG,OAAiBA,KAAe,CAAA,EAAG;AAC/B,IAAIG;AAAA,CACV,SAAUA,GAAO;AAId,WAASzG,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAO,CAAC,CAACs9C,KAAaC,EAAG,cAAcD,CAAS,MAAMoF,GAAc,GAAGpF,EAAU,QAAQ,KACrF+F,GAAa,GAAG/F,EAAU,QAAQ,KAClCC,EAAG,WAAWD,EAAU,UAAU+F,GAAa,EAAE,OAAOrjD,EAAM,UAAU,UAAaw9C,EAAM,GAAGx9C,EAAM,KAAK;AAAA,EACjH;AACA,EAAAwjD,EAAM,KAAKzG;AACf,GAAGyG,OAAUA,KAAQ,CAAA,EAAG;AAKjB,IAAIC;AAAA,CACV,SAAUA,GAAsB;AAO7B,WAASrG,EAAOwB,GAAO8E,GAAe;AAClC,WAAOA,IAAgB,EAAE,OAAA9E,GAAO,eAAA8E,EAAa,IAAK,EAAE,OAAA9E,EAAK;AAAA,EAC7D;AACA,EAAA6E,EAAqB,SAASrG;AAClC,GAAGqG,OAAyBA,KAAuB,CAAA,EAAG;AAK/C,IAAIE;AAAA,CACV,SAAUA,GAAsB;AAC7B,WAASvG,EAAOwB,GAAO8E,MAAkBE,GAAY;AACjD,QAAI/jD,IAAS,EAAE,OAAA++C,EAAK;AACpB,WAAIrB,EAAG,QAAQmG,CAAa,MACxB7jD,EAAO,gBAAgB6jD,IAEvBnG,EAAG,QAAQqG,CAAU,IACrB/jD,EAAO,aAAa+jD,IAGpB/jD,EAAO,aAAa,CAAA,GAEjBA;AAAA,EACX;AACA,EAAA8jD,EAAqB,SAASvG;AAClC,GAAGuG,OAAyBA,KAAuB,CAAA,EAAG;AAI/C,IAAIE;AAAA,CACV,SAAUA,GAAuB;AAI9B,EAAAA,EAAsB,OAAO,GAI7BA,EAAsB,OAAO,GAI7BA,EAAsB,QAAQ;AAClC,GAAGA,OAA0BA,KAAwB,CAAA,EAAG;AAKjD,IAAIC;AAAA,CACV,SAAUA,GAAmB;AAM1B,WAAS1G,EAAO1zC,GAAO01C,GAAM;AACzB,QAAIv/C,IAAS,EAAE,OAAA6J,EAAK;AACpB,WAAI6zC,EAAG,OAAO6B,CAAI,MACdv/C,EAAO,OAAOu/C,IAEXv/C;AAAA,EACX;AACA,EAAAikD,EAAkB,SAAS1G;AAC/B,GAAG0G,OAAsBA,KAAoB,CAAA,EAAG;AAIzC,IAAIC;AAAA,CACV,SAAUA,GAAY;AACnB,EAAAA,EAAW,OAAO,GAClBA,EAAW,SAAS,GACpBA,EAAW,YAAY,GACvBA,EAAW,UAAU,GACrBA,EAAW,QAAQ,GACnBA,EAAW,SAAS,GACpBA,EAAW,WAAW,GACtBA,EAAW,QAAQ,GACnBA,EAAW,cAAc,GACzBA,EAAW,OAAO,IAClBA,EAAW,YAAY,IACvBA,EAAW,WAAW,IACtBA,EAAW,WAAW,IACtBA,EAAW,WAAW,IACtBA,EAAW,SAAS,IACpBA,EAAW,SAAS,IACpBA,EAAW,UAAU,IACrBA,EAAW,QAAQ,IACnBA,EAAW,SAAS,IACpBA,EAAW,MAAM,IACjBA,EAAW,OAAO,IAClBA,EAAW,aAAa,IACxBA,EAAW,SAAS,IACpBA,EAAW,QAAQ,IACnBA,EAAW,WAAW,IACtBA,EAAW,gBAAgB;AAC/B,GAAGA,OAAeA,KAAa,CAAA,EAAG;AAM3B,IAAIC;AAAA,CACV,SAAUA,GAAW;AAIlB,EAAAA,EAAU,aAAa;AAC3B,GAAGA,OAAcA,KAAY,CAAA,EAAG;AACzB,IAAIC;AAAA,CACV,SAAUA,GAAmB;AAU1B,WAAS7G,EAAOl0C,GAAMk2C,GAAM11C,GAAOo0C,GAAKoG,GAAe;AACnD,QAAIrkD,IAAS;AAAA,MACT,MAAAqJ;AAAA,MACA,MAAAk2C;AAAA,MACA,UAAU,EAAE,KAAAtB,GAAK,OAAAp0C,EAAK;AAAA,IAClC;AACQ,WAAIw6C,MACArkD,EAAO,gBAAgBqkD,IAEpBrkD;AAAA,EACX;AACA,EAAAokD,EAAkB,SAAS7G;AAC/B,GAAG6G,OAAsBA,KAAoB,CAAA,EAAG;AACzC,IAAIE;AAAA,CACV,SAAUA,GAAiB;AAUxB,WAAS/G,EAAOl0C,GAAMk2C,GAAMtB,GAAKp0C,GAAO;AACpC,WAAOA,MAAU,SACX,EAAE,MAAAR,GAAM,MAAAk2C,GAAM,UAAU,EAAE,KAAAtB,GAAK,OAAAp0C,EAAK,EAAE,IACtC,EAAE,MAAAR,GAAM,MAAAk2C,GAAM,UAAU,EAAE,KAAAtB,EAAG,EAAE;AAAA,EACzC;AACA,EAAAqG,EAAgB,SAAS/G;AAC7B,GAAG+G,OAAoBA,KAAkB,CAAA,EAAG;AACrC,IAAIC;AAAA,CACV,SAAUA,GAAgB;AAWvB,WAAShH,EAAOl0C,GAAMm7C,GAAQjF,GAAM11C,GAAO46C,GAAgB77C,GAAU;AACjE,QAAI5I,IAAS;AAAA,MACT,MAAAqJ;AAAA,MACA,QAAAm7C;AAAA,MACA,MAAAjF;AAAA,MACA,OAAA11C;AAAA,MACA,gBAAA46C;AAAA,IACZ;AACQ,WAAI77C,MAAa,WACb5I,EAAO,WAAW4I,IAEf5I;AAAA,EACX;AACA,EAAAukD,EAAe,SAAShH;AAIxB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOs9C,KACHC,EAAG,OAAOD,EAAU,IAAI,KAAKC,EAAG,OAAOD,EAAU,IAAI,KACrDE,EAAM,GAAGF,EAAU,KAAK,KAAKE,EAAM,GAAGF,EAAU,cAAc,MAC7DA,EAAU,WAAW,UAAaC,EAAG,OAAOD,EAAU,MAAM,OAC5DA,EAAU,eAAe,UAAaC,EAAG,QAAQD,EAAU,UAAU,OACrEA,EAAU,aAAa,UAAa,MAAM,QAAQA,EAAU,QAAQ,OACpEA,EAAU,SAAS,UAAa,MAAM,QAAQA,EAAU,IAAI;AAAA,EACrE;AACA,EAAA8G,EAAe,KAAKrH;AACxB,GAAGqH,OAAmBA,KAAiB,CAAA,EAAG;AAInC,IAAIG;AAAA,CACV,SAAUA,GAAgB;AAIvB,EAAAA,EAAe,QAAQ,IAIvBA,EAAe,WAAW,YAI1BA,EAAe,WAAW,YAY1BA,EAAe,kBAAkB,oBAWjCA,EAAe,iBAAiB,mBAahCA,EAAe,kBAAkB,oBAMjCA,EAAe,SAAS,UAIxBA,EAAe,wBAAwB,0BASvCA,EAAe,eAAe;AAClC,GAAGA,OAAmBA,KAAiB,CAAA,EAAG;AAMnC,IAAIC;AAAA,CACV,SAAUA,GAAuB;AAI9B,EAAAA,EAAsB,UAAU,GAOhCA,EAAsB,YAAY;AACtC,GAAGA,OAA0BA,KAAwB,CAAA,EAAG;AAKjD,IAAIC;AAAA,CACV,SAAUA,GAAmB;AAI1B,WAASrH,EAAOsH,GAAaC,GAAMC,GAAa;AAC5C,QAAI/kD,IAAS,EAAE,aAAA6kD,EAAW;AAC1B,WAA0BC,KAAS,SAC/B9kD,EAAO,OAAO8kD,IAEeC,KAAgB,SAC7C/kD,EAAO,cAAc+kD,IAElB/kD;AAAA,EACX;AACA,EAAA4kD,EAAkB,SAASrH;AAI3B,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKC,EAAG,WAAWD,EAAU,aAAaqC,GAAW,EAAE,MAC1ErC,EAAU,SAAS,UAAaC,EAAG,WAAWD,EAAU,MAAMC,EAAG,MAAM,OACvED,EAAU,gBAAgB,UAAaA,EAAU,gBAAgBkH,GAAsB,WAAWlH,EAAU,gBAAgBkH,GAAsB;AAAA,EAC9J;AACA,EAAAC,EAAkB,KAAK1H;AAC3B,GAAG0H,OAAsBA,KAAoB,CAAA,EAAG;AACzC,IAAII;AAAA,CACV,SAAUA,GAAY;AACnB,WAASzH,EAAO2C,GAAO+E,GAAqB1F,GAAM;AAC9C,QAAIv/C,IAAS,EAAE,OAAAkgD,EAAK,GAChBgF,IAAY;AAChB,WAAI,OAAOD,KAAwB,YAC/BC,IAAY,IACZllD,EAAO,OAAOilD,KAEThF,GAAQ,GAAGgF,CAAmB,IACnCjlD,EAAO,UAAUilD,IAGjBjlD,EAAO,OAAOilD,GAEdC,KAAa3F,MAAS,WACtBv/C,EAAO,OAAOu/C,IAEXv/C;AAAA,EACX;AACA,EAAAglD,EAAW,SAASzH;AACpB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOs9C,KAAaC,EAAG,OAAOD,EAAU,KAAK,MACxCA,EAAU,gBAAgB,UAAaC,EAAG,WAAWD,EAAU,aAAaqC,GAAW,EAAE,OACzFrC,EAAU,SAAS,UAAaC,EAAG,OAAOD,EAAU,IAAI,OACxDA,EAAU,SAAS,UAAaA,EAAU,YAAY,YACtDA,EAAU,YAAY,UAAawC,GAAQ,GAAGxC,EAAU,OAAO,OAC/DA,EAAU,gBAAgB,UAAaC,EAAG,QAAQD,EAAU,WAAW,OACvEA,EAAU,SAAS,UAAa+D,GAAc,GAAG/D,EAAU,IAAI;AAAA,EACxE;AACA,EAAAuH,EAAW,KAAK9H;AACpB,GAAG8H,OAAeA,KAAa,CAAA,EAAG;AAK3B,IAAIG;AAAA,CACV,SAAUA,GAAU;AAIjB,WAAS5H,EAAO1zC,GAAOu7C,GAAM;AACzB,QAAIplD,IAAS,EAAE,OAAA6J,EAAK;AACpB,WAAI6zC,EAAG,QAAQ0H,CAAI,MACfplD,EAAO,OAAOolD,IAEXplD;AAAA,EACX;AACA,EAAAmlD,EAAS,SAAS5H;AAIlB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKE,EAAM,GAAGF,EAAU,KAAK,MAAMC,EAAG,UAAUD,EAAU,OAAO,KAAKwC,GAAQ,GAAGxC,EAAU,OAAO;AAAA,EACjI;AACA,EAAA0H,EAAS,KAAKjI;AAClB,GAAGiI,OAAaA,KAAW,CAAA,EAAG;AAKvB,IAAIE;AAAA,CACV,SAAUA,GAAmB;AAI1B,WAAS9H,EAAO+H,GAASC,GAAc;AACnC,WAAO,EAAE,SAAAD,GAAS,cAAAC,EAAY;AAAA,EAClC;AACA,EAAAF,EAAkB,SAAS9H;AAI3B,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKC,EAAG,SAASD,EAAU,OAAO,KAAKC,EAAG,QAAQD,EAAU,YAAY;AAAA,EACvG;AACA,EAAA4H,EAAkB,KAAKnI;AAC3B,GAAGmI,OAAsBA,KAAoB,CAAA,EAAG;AAKzC,IAAIG;AAAA,CACV,SAAUA,GAAc;AAIrB,WAASjI,EAAO1zC,GAAO2rC,GAAQ4P,GAAM;AACjC,WAAO,EAAE,OAAAv7C,GAAO,QAAA2rC,GAAQ,MAAA4P,EAAI;AAAA,EAChC;AACA,EAAAI,EAAa,SAASjI;AAItB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKE,EAAM,GAAGF,EAAU,KAAK,MAAMC,EAAG,UAAUD,EAAU,MAAM,KAAKC,EAAG,OAAOD,EAAU,MAAM;AAAA,EAC9H;AACA,EAAA+H,EAAa,KAAKtI;AACtB,GAAGsI,OAAiBA,KAAe,CAAA,EAAG;AAK/B,IAAIC;AAAA,CACV,SAAUA,GAAgB;AAMvB,WAASlI,EAAO1zC,GAAOuG,GAAQ;AAC3B,WAAO,EAAE,OAAAvG,GAAO,QAAAuG,EAAM;AAAA,EAC1B;AACA,EAAAq1C,EAAe,SAASlI;AACxB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKE,EAAM,GAAGF,EAAU,KAAK,MAAMA,EAAU,WAAW,UAAagI,EAAe,GAAGhI,EAAU,MAAM;AAAA,EAC5I;AACA,EAAAgI,EAAe,KAAKvI;AACxB,GAAGuI,OAAmBA,KAAiB,CAAA,EAAG;AAQnC,IAAIC;AAAA,CACV,SAAUA,GAAoB;AAC3B,EAAAA,EAAmB,YAAe,aAKlCA,EAAmB,OAAU,QAC7BA,EAAmB,QAAW,SAC9BA,EAAmB,OAAU,QAC7BA,EAAmB,YAAe,aAClCA,EAAmB,SAAY,UAC/BA,EAAmB,gBAAmB,iBACtCA,EAAmB,YAAe,aAClCA,EAAmB,WAAc,YACjCA,EAAmB,WAAc,YACjCA,EAAmB,aAAgB,cACnCA,EAAmB,QAAW,SAC9BA,EAAmB,WAAc,YACjCA,EAAmB,SAAY,UAC/BA,EAAmB,QAAW,SAC9BA,EAAmB,UAAa,WAChCA,EAAmB,WAAc,YACjCA,EAAmB,UAAa,WAChCA,EAAmB,SAAY,UAC/BA,EAAmB,SAAY,UAC/BA,EAAmB,SAAY,UAC/BA,EAAmB,WAAc,YAIjCA,EAAmB,YAAe;AACtC,GAAGA,OAAuBA,KAAqB,CAAA,EAAG;AAQ3C,IAAIC;AAAA,CACV,SAAUA,GAAwB;AAC/B,EAAAA,EAAuB,cAAiB,eACxCA,EAAuB,aAAgB,cACvCA,EAAuB,WAAc,YACrCA,EAAuB,SAAY,UACnCA,EAAuB,aAAgB,cACvCA,EAAuB,WAAc,YACrCA,EAAuB,QAAW,SAClCA,EAAuB,eAAkB,gBACzCA,EAAuB,gBAAmB,iBAC1CA,EAAuB,iBAAoB;AAC/C,GAAGA,OAA2BA,KAAyB,CAAA,EAAG;AAInD,IAAIC;AAAA,CACV,SAAUA,GAAgB;AACvB,WAAS1I,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,MAAMA,EAAU,aAAa,UAAa,OAAOA,EAAU,YAAa,aACrG,MAAM,QAAQA,EAAU,IAAI,MAAMA,EAAU,KAAK,WAAW,KAAK,OAAOA,EAAU,KAAK,CAAC,KAAM;AAAA,EACtG;AACA,EAAAmI,EAAe,KAAK1I;AACxB,GAAG0I,OAAmBA,KAAiB,CAAA,EAAG;AAMnC,IAAIC;AAAA,CACV,SAAUA,GAAiB;AAIxB,WAAStI,EAAO1zC,GAAOkiB,GAAM;AACzB,WAAO,EAAE,OAAAliB,GAAO,MAAAkiB,EAAI;AAAA,EACxB;AACA,EAAA85B,EAAgB,SAAStI;AACzB,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAkCs9C,KAAc,QAAQE,EAAM,GAAGF,EAAU,KAAK,KAAKC,EAAG,OAAOD,EAAU,IAAI;AAAA,EACjH;AACA,EAAAoI,EAAgB,KAAK3I;AACzB,GAAG2I,OAAoBA,KAAkB,CAAA,EAAG;AAMrC,IAAIC;AAAA,CACV,SAAUA,GAA2B;AAIlC,WAASvI,EAAO1zC,GAAOk8C,GAAcC,GAAqB;AACtD,WAAO,EAAE,OAAAn8C,GAAO,cAAAk8C,GAAc,qBAAAC,EAAmB;AAAA,EACrD;AACA,EAAAF,EAA0B,SAASvI;AACnC,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAkCs9C,KAAc,QAAQE,EAAM,GAAGF,EAAU,KAAK,KAAKC,EAAG,QAAQD,EAAU,mBAAmB,MACrHC,EAAG,OAAOD,EAAU,YAAY,KAAKA,EAAU,iBAAiB;AAAA,EAC5E;AACA,EAAAqI,EAA0B,KAAK5I;AACnC,GAAG4I,OAA8BA,KAA4B,CAAA,EAAG;AAMzD,IAAIG;AAAA,CACV,SAAUA,GAAkC;AAIzC,WAAS1I,EAAO1zC,GAAOq8C,GAAY;AAC/B,WAAO,EAAE,OAAAr8C,GAAO,YAAAq8C,EAAU;AAAA,EAC9B;AACA,EAAAD,EAAiC,SAAS1I;AAC1C,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAkCs9C,KAAc,QAAQE,EAAM,GAAGF,EAAU,KAAK,MACxEC,EAAG,OAAOD,EAAU,UAAU,KAAKA,EAAU,eAAe;AAAA,EACxE;AACA,EAAAwI,EAAiC,KAAK/I;AAC1C,GAAG+I,OAAqCA,KAAmC,CAAA,EAAG;AAOvE,IAAIE;AAAA,CACV,SAAUA,GAAoB;AAI3B,WAAS5I,EAAO6I,GAASC,GAAiB;AACtC,WAAO,EAAE,SAAAD,GAAS,iBAAAC,EAAe;AAAA,EACrC;AACA,EAAAF,EAAmB,SAAS5I;AAI5B,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,QAAQD,CAAS,KAAKE,EAAM,GAAGx9C,EAAM,eAAe;AAAA,EAClE;AACA,EAAAgmD,EAAmB,KAAKjJ;AAC5B,GAAGiJ,OAAuBA,KAAqB,CAAA,EAAG;AAM3C,IAAIG;AAAA,CACV,SAAUA,GAAe;AAItB,EAAAA,EAAc,OAAO,GAIrBA,EAAc,YAAY;AAC1B,WAASpJ,EAAG/8C,GAAO;AACf,WAAOA,MAAU,KAAKA,MAAU;AAAA,EACpC;AACA,EAAAmmD,EAAc,KAAKpJ;AACvB,GAAGoJ,OAAkBA,KAAgB,CAAA,EAAG;AACjC,IAAIC;AAAA,CACV,SAAUA,GAAoB;AAC3B,WAAShJ,EAAOp9C,GAAO;AACnB,WAAO,EAAE,OAAAA,EAAK;AAAA,EAClB;AACA,EAAAomD,EAAmB,SAAShJ;AAC5B,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,MACzBA,EAAU,YAAY,UAAaC,EAAG,OAAOD,EAAU,OAAO,KAAKoF,GAAc,GAAGpF,EAAU,OAAO,OACrGA,EAAU,aAAa,UAAaO,GAAS,GAAGP,EAAU,QAAQ,OAClEA,EAAU,YAAY,UAAawC,GAAQ,GAAGxC,EAAU,OAAO;AAAA,EAC3E;AACA,EAAA8I,EAAmB,KAAKrJ;AAC5B,GAAGqJ,OAAuBA,KAAqB,CAAA,EAAG;AAC3C,IAAIC;AAAA,CACV,SAAUA,GAAW;AAClB,WAASjJ,EAAOgD,GAAUxB,GAAOQ,GAAM;AACnC,UAAMv/C,IAAS,EAAE,UAAAugD,GAAU,OAAAxB,EAAK;AAChC,WAAIQ,MAAS,WACTv/C,EAAO,OAAOu/C,IAEXv/C;AAAA,EACX;AACA,EAAAwmD,EAAU,SAASjJ;AACnB,WAASL,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKH,GAAS,GAAGG,EAAU,QAAQ,MAC5DC,EAAG,OAAOD,EAAU,KAAK,KAAKC,EAAG,WAAWD,EAAU,OAAO8I,GAAmB,EAAE,OAClF9I,EAAU,SAAS,UAAa6I,GAAc,GAAG7I,EAAU,IAAI,MAC/DA,EAAU,cAAc,UAAcC,EAAG,WAAWD,EAAU,WAAWyB,GAAS,EAAE,MACpFzB,EAAU,YAAY,UAAaC,EAAG,OAAOD,EAAU,OAAO,KAAKoF,GAAc,GAAGpF,EAAU,OAAO,OACrGA,EAAU,gBAAgB,UAAaC,EAAG,QAAQD,EAAU,WAAW,OACvEA,EAAU,iBAAiB,UAAaC,EAAG,QAAQD,EAAU,YAAY;AAAA,EACrF;AACA,EAAA+I,EAAU,KAAKtJ;AACnB,GAAGsJ,OAAcA,KAAY,CAAA,EAAG;AACzB,IAAIC;AAAA,CACV,SAAUA,GAAa;AACpB,WAASC,EAAcvmD,GAAO;AAC1B,WAAO,EAAE,MAAM,WAAW,OAAAA,EAAK;AAAA,EACnC;AACA,EAAAsmD,EAAY,gBAAgBC;AAChC,GAAGD,OAAgBA,KAAc,CAAA,EAAG;AAC7B,IAAIE;AAAA,CACV,SAAUA,GAAsB;AAC7B,WAASpJ,EAAOqJ,GAAYC,GAAYh9C,GAAOs2C,GAAS;AACpD,WAAO,EAAE,YAAAyG,GAAY,YAAAC,GAAY,OAAAh9C,GAAO,SAAAs2C,EAAO;AAAA,EACnD;AACA,EAAAwG,EAAqB,SAASpJ;AAClC,GAAGoJ,OAAyBA,KAAuB,CAAA,EAAG;AAC/C,IAAIG;AAAA,CACV,SAAUA,GAAsB;AAC7B,WAASvJ,EAAO+F,GAAO;AACnB,WAAO,EAAE,OAAAA,EAAK;AAAA,EAClB;AACA,EAAAwD,EAAqB,SAASvJ;AAClC,GAAGuJ,OAAyBA,KAAuB,CAAA,EAAG;AAO/C,IAAIC;AAAA,CACV,SAAUA,GAA6B;AAIpC,EAAAA,EAA4B,UAAU,GAItCA,EAA4B,YAAY;AAC5C,GAAGA,OAAgCA,KAA8B,CAAA,EAAG;AAC7D,IAAIC;AAAA,CACV,SAAUA,GAAwB;AAC/B,WAASzJ,EAAO1zC,GAAOkiB,GAAM;AACzB,WAAO,EAAE,OAAAliB,GAAO,MAAAkiB,EAAI;AAAA,EACxB;AACA,EAAAi7B,EAAuB,SAASzJ;AACpC,GAAGyJ,OAA2BA,KAAyB,CAAA,EAAG;AACnD,IAAIC;AAAA,CACV,SAAUA,GAAyB;AAChC,WAAS1J,EAAOwH,GAAamC,GAAwB;AACjD,WAAO,EAAE,aAAAnC,GAAa,wBAAAmC,EAAsB;AAAA,EAChD;AACA,EAAAD,EAAwB,SAAS1J;AACrC,GAAG0J,OAA4BA,KAA0B,CAAA,EAAG;AACrD,IAAIE;AAAA,CACV,SAAUA,GAAiB;AACxB,WAASjK,EAAG/8C,GAAO;AACf,UAAMs9C,IAAYt9C;AAClB,WAAOu9C,EAAG,cAAcD,CAAS,KAAKN,GAAI,GAAGM,EAAU,GAAG,KAAKC,EAAG,OAAOD,EAAU,IAAI;AAAA,EAC3F;AACA,EAAA0J,EAAgB,KAAKjK;AACzB,GAAGiK,OAAoBA,KAAkB,CAAA,EAAG;AACrC,MAAMC,KAAM,CAAC;AAAA,GAAM;AAAA,GAAQ,IAAI;AAI/B,IAAIC;AAAAA,CACV,SAAUA,GAAc;AAQrB,WAAS9J,EAAOU,GAAK0E,GAAYF,GAAS6E,GAAS;AAC/C,WAAO,IAAIC,GAAiBtJ,GAAK0E,GAAYF,GAAS6E,CAAO;AAAA,EACjE;AACA,EAAAD,EAAa,SAAS9J;AAItB,WAASL,EAAG/8C,GAAO;AACf,QAAIs9C,IAAYt9C;AAChB,WAAO,GAAAu9C,EAAG,QAAQD,CAAS,KAAKC,EAAG,OAAOD,EAAU,GAAG,MAAMC,EAAG,UAAUD,EAAU,UAAU,KAAKC,EAAG,OAAOD,EAAU,UAAU,MAAMC,EAAG,SAASD,EAAU,SAAS,KAC/JC,EAAG,KAAKD,EAAU,OAAO,KAAKC,EAAG,KAAKD,EAAU,UAAU,KAAKC,EAAG,KAAKD,EAAU,QAAQ;AAAA,EACpG;AACA,EAAA4J,EAAa,KAAKnK;AAClB,WAASsK,EAAWC,GAAUxG,GAAO;AACjC,QAAIl1B,IAAO07B,EAAS,QAAO,GACvBC,IAAcC,EAAU1G,GAAO,CAAC1I,GAAGvvC,MAAM;AACzC,UAAI4+C,IAAOrP,EAAE,MAAM,MAAM,OAAOvvC,EAAE,MAAM,MAAM;AAC9C,aAAI4+C,MAAS,IACFrP,EAAE,MAAM,MAAM,YAAYvvC,EAAE,MAAM,MAAM,YAE5C4+C;AAAA,IACX,CAAC,GACGC,IAAqB97B,EAAK;AAC9B,aAAS9jB,IAAIy/C,EAAY,SAAS,GAAGz/C,KAAK,GAAGA,KAAK;AAC9C,UAAIK,IAAIo/C,EAAYz/C,CAAC,GACjBkmB,IAAcs5B,EAAS,SAASn/C,EAAE,MAAM,KAAK,GAC7C2rB,IAAYwzB,EAAS,SAASn/C,EAAE,MAAM,GAAG;AAC7C,UAAI2rB,KAAa4zB;AACb,QAAA97B,IAAOA,EAAK,UAAU,GAAGoC,CAAW,IAAI7lB,EAAE,UAAUyjB,EAAK,UAAUkI,GAAWlI,EAAK,MAAM;AAAA;AAGzF,cAAM,IAAI,MAAM,kBAAkB;AAEtC,MAAA87B,IAAqB15B;AAAA,IACzB;AACA,WAAOpC;AAAA,EACX;AACA,EAAAs7B,EAAa,aAAaG;AAC1B,WAASG,EAAUvC,GAAM0C,GAAS;AAC9B,QAAI1C,EAAK,UAAU;AAEf,aAAOA;AAEX,UAAM9I,IAAK8I,EAAK,SAAS,IAAK,GACxBnN,IAAOmN,EAAK,MAAM,GAAG9I,CAAC,GACtBpE,IAAQkN,EAAK,MAAM9I,CAAC;AAC1B,IAAAqL,EAAU1P,GAAM6P,CAAO,GACvBH,EAAUzP,GAAO4P,CAAO;AACxB,QAAIC,IAAU,GACVC,IAAW,GACX//C,IAAI;AACR,WAAO8/C,IAAU9P,EAAK,UAAU+P,IAAW9P,EAAM;AAE7C,MADU4P,EAAQ7P,EAAK8P,CAAO,GAAG7P,EAAM8P,CAAQ,CAAC,KACrC,IAEP5C,EAAKn9C,GAAG,IAAIgwC,EAAK8P,GAAS,IAI1B3C,EAAKn9C,GAAG,IAAIiwC,EAAM8P,GAAU;AAGpC,WAAOD,IAAU9P,EAAK;AAClB,MAAAmN,EAAKn9C,GAAG,IAAIgwC,EAAK8P,GAAS;AAE9B,WAAOC,IAAW9P,EAAM;AACpB,MAAAkN,EAAKn9C,GAAG,IAAIiwC,EAAM8P,GAAU;AAEhC,WAAO5C;AAAA,EACX;AACJ,GAAGiC,OAAiBA,KAAe,CAAA,EAAG;AAItC,IAAAY,KAAA,MAAuB;AAAA,EACnB,YAAYhK,GAAK0E,GAAYF,GAAS6E,GAAS;AAC3C,SAAK,OAAOrJ,GACZ,KAAK,cAAc0E,GACnB,KAAK,WAAWF,GAChB,KAAK,WAAW6E,GAChB,KAAK,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,QAAQz9C,GAAO;AACX,QAAIA,GAAO;AACP,UAAIjK,IAAQ,KAAK,SAASiK,EAAM,KAAK,GACjChK,IAAM,KAAK,SAASgK,EAAM,GAAG;AACjC,aAAO,KAAK,SAAS,UAAUjK,GAAOC,CAAG;AAAA,IAC7C;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAOqoD,GAAOzF,GAAS;AACnB,SAAK,WAAWyF,EAAM,MACtB,KAAK,WAAWzF,GAChB,KAAK,eAAe;AAAA,EACxB;AAAA,EACA,iBAAiB;AACb,QAAI,KAAK,iBAAiB,QAAW;AACjC,UAAI0F,IAAc,CAAA,GACdp8B,IAAO,KAAK,UACZq8B,IAAc;AAClB,eAAS,IAAI,GAAG,IAAIr8B,EAAK,QAAQ,KAAK;AAClC,QAAIq8B,MACAD,EAAY,KAAK,CAAC,GAClBC,IAAc;AAElB,YAAIC,IAAKt8B,EAAK,OAAO,CAAC;AACtB,QAAAq8B,IAAeC,MAAO,QAAQA,MAAO;AAAA,GACjCA,MAAO,QAAQ,IAAI,IAAIt8B,EAAK,UAAUA,EAAK,OAAO,IAAI,CAAC,MAAM;AAAA,KAC7D;AAAA,MAER;AACA,MAAIq8B,KAAer8B,EAAK,SAAS,KAC7Bo8B,EAAY,KAAKp8B,EAAK,MAAM,GAEhC,KAAK,eAAeo8B;AAAA,IACxB;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,WAAW33C,GAAQ;AACf,IAAAA,IAAS,KAAK,IAAI,KAAK,IAAIA,GAAQ,KAAK,SAAS,MAAM,GAAG,CAAC;AAC3D,QAAI23C,IAAc,KAAK,eAAc,GACjCG,IAAM,GAAGC,IAAOJ,EAAY;AAChC,QAAII,MAAS;AACT,aAAOjL,GAAS,OAAO,GAAG9sC,CAAM;AAEpC,WAAO83C,IAAMC,KAAM;AACf,UAAIC,IAAM,KAAK,OAAOF,IAAMC,KAAQ,CAAC;AACrC,MAAIJ,EAAYK,CAAG,IAAIh4C,IACnB+3C,IAAOC,IAGPF,IAAME,IAAM;AAAA,IAEpB;AAGA,QAAIp6B,IAAOk6B,IAAM;AACjB,WAAOhL,GAAS,OAAOlvB,GAAM5d,IAAS23C,EAAY/5B,CAAI,CAAC;AAAA,EAC3D;AAAA,EACA,SAASmyB,GAAU;AACf,QAAI4H,IAAc,KAAK,eAAc;AACrC,QAAI5H,EAAS,QAAQ4H,EAAY;AAC7B,aAAO,KAAK,SAAS;AAEpB,QAAI5H,EAAS,OAAO;AACrB,aAAO;AAEX,QAAIkI,IAAaN,EAAY5H,EAAS,IAAI,GACtCmI,IAAkBnI,EAAS,OAAO,IAAI4H,EAAY,SAAUA,EAAY5H,EAAS,OAAO,CAAC,IAAI,KAAK,SAAS;AAC/G,WAAO,KAAK,IAAI,KAAK,IAAIkI,IAAalI,EAAS,WAAWmI,CAAc,GAAGD,CAAU;AAAA,EACzF;AAAA,EACA,IAAI,YAAY;AACZ,WAAO,KAAK,eAAc,EAAG;AAAA,EACjC;AACJ;AACA,IAAI/K;AAAA,CACH,SAAUA,GAAI;AACX,QAAMp2C,IAAW,OAAO,UAAU;AAClC,WAASqhD,EAAQxoD,GAAO;AACpB,WAAO,OAAOA,IAAU;AAAA,EAC5B;AACA,EAAAu9C,EAAG,UAAUiL;AACb,WAASC,EAAUzoD,GAAO;AACtB,WAAO,OAAOA,IAAU;AAAA,EAC5B;AACA,EAAAu9C,EAAG,YAAYkL;AACf,WAASC,EAAQ1oD,GAAO;AACpB,WAAOA,MAAU,MAAQA,MAAU;AAAA,EACvC;AACA,EAAAu9C,EAAG,UAAUmL;AACb,WAASC,EAAO3oD,GAAO;AACnB,WAAOmH,EAAS,KAAKnH,CAAK,MAAM;AAAA,EACpC;AACA,EAAAu9C,EAAG,SAASoL;AACZ,WAAS90C,EAAO7T,GAAO;AACnB,WAAOmH,EAAS,KAAKnH,CAAK,MAAM;AAAA,EACpC;AACA,EAAAu9C,EAAG,SAAS1pC;AACZ,WAAS+0C,EAAY5oD,GAAO+I,GAAKC,GAAK;AAClC,WAAO7B,EAAS,KAAKnH,CAAK,MAAM,qBAAqB+I,KAAO/I,KAASA,KAASgJ;AAAA,EAClF;AACA,EAAAu0C,EAAG,cAAcqL;AACjB,WAAS3L,EAAQj9C,GAAO;AACpB,WAAOmH,EAAS,KAAKnH,CAAK,MAAM,qBAAqB,eAAeA,KAASA,KAAS;AAAA,EAC1F;AACA,EAAAu9C,EAAG,UAAUN;AACb,WAASC,EAASl9C,GAAO;AACrB,WAAOmH,EAAS,KAAKnH,CAAK,MAAM,qBAAqB,KAAKA,KAASA,KAAS;AAAA,EAChF;AACA,EAAAu9C,EAAG,WAAWL;AACd,WAASx8C,EAAKV,GAAO;AACjB,WAAOmH,EAAS,KAAKnH,CAAK,MAAM;AAAA,EACpC;AACA,EAAAu9C,EAAG,OAAO78C;AACV,WAASmoD,EAAc7oD,GAAO;AAI1B,WAAOA,MAAU,QAAQ,OAAOA,KAAU;AAAA,EAC9C;AACA,EAAAu9C,EAAG,gBAAgBsL;AACnB,WAASC,EAAW9oD,GAAO+oD,GAAO;AAC9B,WAAO,MAAM,QAAQ/oD,CAAK,KAAKA,EAAM,MAAM+oD,CAAK;AAAA,EACpD;AACA,EAAAxL,EAAG,aAAauL;AACpB,GAAGvL,MAAOA,IAAK,CAAA,EAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtqEX,MAAMyL,GAAe;AAAA,EACxB,cAAc;AACV,SAAK,YAAY,CAAA;AAAA,EACrB;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC,KAAK,KAAK;AAAA,EAC7D;AAAA,EACA,cAAcr2C,GAAO;AACjB,gBAAK,WAAW,IAAIs2C,GAAgBt2C,CAAK,GACzC,KAAK,SAAS,OAAO,KAAK,UAC1B,KAAK,YAAY,CAAC,KAAK,QAAQ,GACxB,KAAK;AAAA,EAChB;AAAA,EACA,mBAAmBu2C,GAAS;AACxB,UAAMC,IAAgB,IAAIC,GAAoB;AAC9C,WAAAD,EAAc,gBAAgBD,GAC9BC,EAAc,OAAO,KAAK,UAC1B,KAAK,QAAQ,QAAQ,KAAKA,CAAa,GACvC,KAAK,UAAU,KAAKA,CAAa,GAC1BA;AAAA,EACX;AAAA,EACA,cAAch5C,GAAO+4C,GAAS;AAC1B,UAAMG,IAAW,IAAIC,GAAgBn5C,EAAM,aAAaA,EAAM,MAAM,QAAQD,GAAaC,CAAK,GAAGA,EAAM,WAAW,CAAC+4C,CAAO;AAC1H,WAAAG,EAAS,gBAAgBH,GACzBG,EAAS,OAAO,KAAK,UACrB,KAAK,QAAQ,QAAQ,KAAKA,CAAQ,GAC3BA;AAAA,EACX;AAAA,EACA,WAAW7jD,GAAM;AACb,UAAMyK,IAASzK,EAAK;AACpB,QAAIyK,GAAQ;AACR,YAAMtQ,IAAQsQ,EAAO,QAAQ,QAAQzK,CAAI;AACzC,MAAI7F,KAAS,KACTsQ,EAAO,QAAQ,OAAOtQ,GAAO,CAAC;AAAA,IAEtC;AAAA,EACJ;AAAA,EACA,eAAe4pD,GAAQ;AACnB,UAAMpyC,IAAQ,CAAA;AACd,eAAWhH,KAASo5C,GAAQ;AACxB,YAAMF,IAAW,IAAIC,GAAgBn5C,EAAM,aAAaA,EAAM,MAAM,QAAQD,GAAaC,CAAK,GAAGA,EAAM,WAAW,EAAI;AACtH,MAAAk5C,EAAS,OAAO,KAAK,UACrBlyC,EAAM,KAAKkyC,CAAQ;AAAA,IACvB;AACA,QAAI7N,IAAU,KAAK,SACfgO,IAAQ;AAEZ,QAAIhO,EAAQ,QAAQ,SAAS,GAAG;AAC5B,MAAAA,EAAQ,QAAQ,KAAK,GAAGrkC,CAAK;AAC7B;AAAA,IACJ;AAGA,WAAOqkC,EAAQ,aAAW;AACtB,YAAM77C,IAAQ67C,EAAQ,UAAU,QAAQ,QAAQA,CAAO;AACvD,UAAI77C,IAAQ,GAAG;AAEX,QAAA67C,EAAQ,UAAU,QAAQ,OAAO77C,GAAO,GAAG,GAAGwX,CAAK,GACnDqyC,IAAQ;AACR;AAAA,MACJ;AACA,MAAAhO,IAAUA,EAAQ;AAAA,IACtB;AAGA,IAAKgO,KACD,KAAK,SAAS,QAAQ,QAAQ,GAAGryC,CAAK;AAAA,EAE9C;AAAA,EACA,UAAUjP,GAAM;AACZ,UAAMszC,IAAU,KAAK;AAGrB,IAAI,OAAOtzC,EAAK,SAAU,YAAY,CAACA,EAAK,eACxC,KAAK,QAAQ,UAAUA,IAE3BA,EAAK,WAAWszC;AAChB,UAAMh2C,IAAO,KAAK,UAAU,IAAG;AAG/B,IAAIA,GAAM,QAAQ,WAAW,KACzB,KAAK,WAAWA,CAAI;AAAA,EAE5B;AACJ;AACO,MAAMikD,GAAgB;AAAA,EACzB,IAAI,SAAS;AACT,WAAO;AAAA,EACX;AAAA,EACA,IAAI,UAAU;AACV,UAAMjkD,IAAO,OAAO,KAAK,UAAU,SAAU,WAAW,KAAK,WAAW,KAAK,WAAW;AACxF,QAAI,CAACA;AACD,YAAM,IAAI,MAAM,yCAAyC;AAE7D,WAAOA;AAAA,EACX;AAAA,EACA,IAAI,QAAQxF,GAAO;AACf,SAAK,WAAWA;AAAA,EACpB;AAAA,EACA,IAAI,OAAO;AACP,WAAO,KAAK,KAAK,SAAS,UAAU,KAAK,QAAQ,KAAK,GAAG;AAAA,EAC7D;AACJ;AACO,MAAMspD,WAAwBG,GAAgB;AAAA,EACjD,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,MAAM;AACN,WAAO,KAAK,UAAU,KAAK;AAAA,EAC/B;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,YAAY;AACZ,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,YAAYp5C,GAAQzQ,GAAQ8J,GAAOgiB,GAAWva,IAAS,IAAO;AAC1D,UAAK,GACL,KAAK,UAAUA,GACf,KAAK,UAAUd,GACf,KAAK,aAAaqb,GAClB,KAAK,UAAU9rB,GACf,KAAK,SAAS8J;AAAA,EAClB;AACJ;AACO,MAAM0/C,WAA6BK,GAAgB;AAAA,EACtD,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,UAAU,IAAIC,GAAiB,IAAI;AAAA,EAC5C;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,oBAAoB,UAAU;AAAA,EAC9C;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,MAAM,KAAK;AAAA,EAC3B;AAAA,EACA,IAAI,MAAM;AACN,WAAO,KAAK,mBAAmB,OAAO;AAAA,EAC1C;AAAA,EACA,IAAI,QAAQ;AACR,UAAMC,IAAY,KAAK,oBACjBC,IAAW,KAAK;AACtB,QAAID,KAAaC,GAAU;AACvB,UAAI,KAAK,gBAAgB,QAAW;AAChC,cAAM,EAAE,OAAOC,EAAU,IAAKF,GACxB,EAAE,OAAOG,EAAS,IAAKF;AAC7B,aAAK,cAAc,EAAE,OAAOC,EAAW,OAAO,KAAKC,EAAU,IAAI,OAAOD,EAAW,MAAM,OAAOA,EAAW,QAAQC,EAAU,IAAG;AAAA,MACpI;AACA,aAAO,KAAK;AAAA,IAChB;AAEI,aAAO,EAAE,OAAO3M,GAAS,OAAO,GAAG,CAAC,GAAG,KAAKA,GAAS,OAAO,GAAG,CAAC,EAAC;AAAA,EAEzE;AAAA,EACA,IAAI,qBAAqB;AACrB,eAAWntC,KAAS,KAAK;AACrB,UAAI,CAACA,EAAM;AACP,eAAOA;AAGf,WAAO,KAAK,QAAQ,CAAC;AAAA,EACzB;AAAA,EACA,IAAI,oBAAoB;AACpB,aAASlI,IAAI,KAAK,QAAQ,SAAS,GAAGA,KAAK,GAAGA,KAAK;AAC/C,YAAMkI,IAAQ,KAAK,QAAQlI,CAAC;AAC5B,UAAI,CAACkI,EAAM;AACP,eAAOA;AAAA,IAEf;AACA,WAAO,KAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC;AAAA,EAC/C;AACJ;AACA,MAAM05C,WAAyB,MAAM;AAAA,EACjC,YAAYz5C,GAAQ;AAChB,UAAK,GACL,KAAK,SAASA,GACd,OAAO,eAAe,MAAMy5C,GAAiB,SAAS;AAAA,EAC1D;AAAA,EACA,QAAQvG,GAAO;AACX,gBAAK,WAAWA,CAAK,GACd,MAAM,KAAK,GAAGA,CAAK;AAAA,EAC9B;AAAA,EACA,WAAWA,GAAO;AACd,gBAAK,WAAWA,CAAK,GACd,MAAM,QAAQ,GAAGA,CAAK;AAAA,EACjC;AAAA,EACA,OAAO1jD,GAAO+G,MAAU28C,GAAO;AAC3B,gBAAK,WAAWA,CAAK,GACd,MAAM,OAAO1jD,GAAO+G,GAAO,GAAG28C,CAAK;AAAA,EAC9C;AAAA,EACA,WAAWA,GAAO;AACd,eAAWj7C,KAAQi7C;AACf,MAAAj7C,EAAK,YAAY,KAAK;AAAA,EAE9B;AACJ;AACO,MAAM+gD,WAAwBG,GAAqB;AAAA,EACtD,IAAI,OAAO;AACP,WAAO,KAAK,MAAM,UAAU,KAAK,QAAQ,KAAK,GAAG;AAAA,EACrD;AAAA,EACA,IAAI,WAAW;AACX,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,YAAYz2C,GAAO;AACf,UAAK,GACL,KAAK,QAAQ,IACb,KAAK,QAAQA,KAAS;AAAA,EAC1B;AACJ;AChNO,MAAMo3C,KAAiB,uBAAO,UAAU;AAC/C,SAASC,GAAexkD,GAAM;AAC1B,SAAOA,EAAK,UAAUukD;AAC1B;AACA,MAAME,KAAa,KACbC,KAAiB,CAAChhD,MAASA,EAAK,SAAS+gD,EAAU,IAAI/gD,IAAOA,IAAO+gD;AACpE,MAAME,GAAsB;AAAA,EAC/B,YAAYpvC,GAAU;AAClB,SAAK,mBAAmB,oBAAI,IAAG,GAC/B,KAAK,WAAW,oBAAI,IAAG,GACvB,KAAK,QAAQA,EAAS,OAAO;AAC7B,UAAMwuC,IAAS,KAAK,MAAM,YACpBpT,IAAap7B,EAAS,iBAAiB,SAAS;AACtD,IAAIA,EAAS,OAAO,UAAU,iBAAiB,SAAS,SAAS,IAC7D,KAAK,UAAU,IAAIqvC,GAAgBb,GAAQ;AAAA,MACvC,GAAGxuC,EAAS,OAAO;AAAA,MACnB,iBAAiBo7B;AAAA,MACjB,sBAAsBp7B,EAAS,OAAO;AAAA,IACtD,GAAeA,EAAS,OAAO,UAAU,gBAAgB,WAAW,WAAWA,EAAS,iBAAiB,UAAU,CAAC,IAGxG,KAAK,UAAU,IAAIsvC,GAAkBd,GAAQ;AAAA,MACzC,GAAGxuC,EAAS,OAAO;AAAA,MACnB,iBAAiBo7B;AAAA,MACjB,sBAAsBp7B,EAAS,OAAO;AAAA,IACtD,CAAa;AAAA,EAET;AAAA,EACA,aAAaiL,GAAKskC,GAAS;AACvB,SAAK,QAAQ,OAAOtkC,GAAKskC,CAAO;AAAA,EACpC;AAAA,EACA,SAAStkC,GAAKukC,GAAU;AACpB,SAAK,QAAQ,WAAWvkC,GAAKukC,CAAQ;AAAA,EACzC;AAAA,EACA,KAAKvkC,GAAKukC,GAAU;AAChB,SAAK,QAAQ,SAASvkC,GAAKukC,CAAQ;AAAA,EACvC;AAAA,EACA,WAAWvkC,GAAKukC,GAAU;AACtB,SAAK,QAAQ,eAAevkC,GAAKukC,CAAQ;AAAA,EAC7C;AAAA,EACA,QAAQrhD,GAAM;AACV,WAAO,KAAK,SAAS,IAAIA,CAAI;AAAA,EACjC;AAAA,EACA,cAAc;AACV,WAAO,KAAK,QAAQ;AAAA,EACxB;AAAA,EACA,IAAI,kBAAkB;AAClB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,eAAe;AACX,WAAO,KAAK,QAAQ;AAAA,EACxB;AAAA,EACA,WAAW;AACP,SAAK,QAAQ,iBAAgB;AAAA,EACjC;AACJ;AACO,MAAMshD,WAAsBL,GAAsB;AAAA,EACrD,IAAI,UAAU;AACV,WAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAAA,EAC3C;AAAA,EACA,YAAYpvC,GAAU;AAClB,UAAMA,CAAQ,GACd,KAAK,cAAc,IAAIiuC,GAAc,GACrC,KAAK,QAAQ,CAAA,GACb,KAAK,gBAAgB,oBAAI,IAAG,GAC5B,KAAK,qBAAqB,oBAAI,IAAG,GACjC,KAAK,SAASjuC,EAAS,WAAW,QAClC,KAAK,YAAYA,EAAS,OAAO,gBACjC,KAAK,gBAAgBA,EAAS,OAAO;AAAA,EACzC;AAAA,EACA,KAAK3E,GAAM83B,GAAM;AACb,UAAM3oC,IAAO,KAAK,gBAAgB6Q,CAAI;AACtC,QAAIq0C;AACJ,IAAI99C,GAAYyJ,CAAI,MAChBq0C,IAAYr0C,EAAK,MACjB,KAAK,sBAAsBA,CAAI;AAEnC,UAAMs0C,IAAa,KAAK,QAAQ,YAAYR,GAAe9zC,EAAK,IAAI,GAAG,KAAK,oBAAoB7Q,GAAMklD,GAAWvc,CAAI,EAAE,KAAK,IAAI,CAAC;AACjI,gBAAK,SAAS,IAAI93B,EAAK,MAAMs0C,CAAU,GACnC98C,GAAawI,CAAI,KAAKA,EAAK,UAC3B,KAAK,WAAWs0C,IAEbA;AAAA,EACX;AAAA,EACA,sBAAsBt0C,GAAM;AACxB,UAAMlN,IAAOkN,EAAK,MACZ3T,IAAM,oBAAI,IAAG;AACnB,aAAS,IAAI,GAAG,IAAI2T,EAAK,UAAU,YAAY,QAAQ,KAAK;AACxD,YAAMu0C,IAAav0C,EAAK,UAAU,YAAY,CAAC;AAC/C,iBAAWoB,KAAWmzC,EAAW;AAC7B,QAAAloD,EAAI,IAAI+U,EAAQ,OAAO;AAAA,UACnB,YAAY;AAAA,UACZ,YAAYmzC,EAAW,kBAAkB;AAAA,QAC7D,CAAiB;AAAA,IAET;AACA,SAAK,mBAAmB,IAAIzhD,GAAMzG,CAAG;AAAA,EACzC;AAAA,EACA,gBAAgB2T,GAAM;AAClB,WAAIzJ,GAAYyJ,CAAI,IACT2C,GAAY3C,CAAI,IAElBA,EAAK,WACV,SAEKsC,GAAetC,CAAI,IACjB2zC,KAGAhxC,GAAY3C,CAAI;AAAA,EAE/B;AAAA,EACA,MAAMzD,GAAOjK,IAAU,IAAI;AACvB,SAAK,YAAY,cAAciK,CAAK;AACpC,UAAMi4C,IAAc,KAAK,cAAc,KAAK,MAAM,SAASj4C,CAAK;AAChE,SAAK,QAAQ,QAAQi4C,EAAY;AACjC,UAAMF,IAAahiD,EAAQ,OAAO,KAAK,SAAS,IAAIA,EAAQ,IAAI,IAAI,KAAK;AACzE,QAAI,CAACgiD;AACD,YAAM,IAAI,MAAMhiD,EAAQ,OAAO,4BAA4BA,EAAQ,IAAI,MAAM,yBAAyB;AAE1G,UAAM7I,IAAS,KAAK,QAAQ6qD,CAAU;AACtC,gBAAK,YAAY,eAAeE,EAAY,MAAM,GAClD,KAAK,gBAAgB,MAAK,GAC1B,KAAK,cAAc,QACnB3hD,GAAuBpJ,GAAQ,EAAE,MAAM,GAAI,CAAE,GACtC;AAAA,MACH,OAAOA;AAAA,MACP,aAAa+qD,EAAY;AAAA,MACzB,aAAaA,EAAY;AAAA,MACzB,cAAc,KAAK,QAAQ;AAAA,IACvC;AAAA,EACI;AAAA,EACA,QAAQx0C,GAAM;AACV,QAAIvW,IAAS,KAAK,QAAQ,KAAKuW,CAAI;AAOnC,QANI,KAAK,MAAM,SAAS,MAGpBvW,IAAS,KAAK,UAAS,IAGvBA,MAAW;AACX,YAAM,IAAI,MAAM,uBAAuB;AAEtC,QAAI,KAAK,MAAM,SAAS;AACzB,YAAM,IAAI,MAAM,yCAAyC;AAE7D,WAAOA;AAAA,EACX;AAAA,EACA,oBAAoBgrD,GAAOJ,GAAWnc,GAAgB;AAClD,WAAO,CAAC1qC,MAAS;AAEb,YAAMknD,IAAa,CAAC,KAAK,YAAW,KAAMD,MAAU;AACpD,UAAIC,GAAY;AACZ,cAAMtlD,IAAO,EAAE,OAAAqlD,EAAK;AACpB,aAAK,MAAM,KAAKrlD,CAAI,GAChBqlD,MAAUd,KACVvkD,EAAK,QAAQ,KAERilD,MAAc,WACnBjlD,EAAK,aAAailD;AAAA,MAE1B;AAGA,aAAAnc,EAAe1qC,CAAI,GAGZknD,IAAa,KAAK,UAAS,IAAK;AAAA,IAC3C;AAAA,EACJ;AAAA,EACA,oBAAoB36C,GAAO;AACvB,UAAM46C,IAAe,KAAK,YAAY;AACtC,QAAI,CAACA,EAAa;AACd,aAAO,CAAA;AAEX,UAAM16C,IAASF,EAAM;AACrB,aAAS,IAAI,GAAG,IAAI46C,EAAa,QAAQ;AAErC,UADcA,EAAa,CAAC,EAClB,cAAc16C;AACpB,eAAO06C,EAAa,OAAO,GAAG,CAAC;AAGvC,WAAOA,EAAa,OAAO,GAAGA,EAAa,MAAM;AAAA,EACrD;AAAA,EACA,QAAQ/kC,GAAK0F,GAAWw9B,GAAS;AAC7B,UAAM/4C,IAAQ,KAAK,QAAQ,YAAY6V,GAAK0F,CAAS;AACrD,QAAI,CAAC,KAAK,YAAW,KAAM,KAAK,aAAavb,CAAK,GAAG;AAKjD,YAAM46C,IAAe,KAAK,oBAAoB56C,CAAK;AACnD,WAAK,YAAY,eAAe46C,CAAY;AAC5C,YAAM1B,IAAW,KAAK,YAAY,cAAcl5C,GAAO+4C,CAAO,GACxD,EAAE,YAAAnxC,GAAY,UAAApB,EAAQ,IAAK,KAAK,cAAcuyC,CAAO,GACrD1N,IAAU,KAAK;AACrB,UAAIzjC,GAAY;AACZ,cAAMizC,IAAiB/9C,GAAUi8C,CAAO,IAAI/4C,EAAM,QAAQ,KAAK,UAAU,QAAQA,EAAM,OAAOk5C,CAAQ;AACtG,aAAK,OAAOtxC,EAAW,UAAUA,EAAW,SAASizC,GAAgB3B,GAAU1yC,CAAQ;AAAA,MAC3F,WACSqzC,GAAexO,CAAO,GAAG;AAC9B,YAAI5vB,IAAOzb,EAAM;AACjB,QAAKlD,GAAUi8C,CAAO,MAClBt9B,IAAO,KAAK,UAAU,QAAQA,GAAMy9B,CAAQ,EAAE,SAAQ,IAE1D7N,EAAQ,SAAS5vB;AAAA,MACrB;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAazb,GAAO;AAChB,WAAO,CAACA,EAAM,wBAAwB,CAAC,MAAMA,EAAM,WAAW,KAAK,OAAOA,EAAM,aAAc,YAAY,CAAC,MAAMA,EAAM,SAAS;AAAA,EACpI;AAAA,EACA,QAAQ6V,GAAK5P,GAAM60C,GAAU/B,GAAStlD,GAAM;AACxC,QAAIiN;AACJ,IAAI,CAAC,KAAK,YAAW,KAAM,CAACo6C,MAKxBp6C,IAAU,KAAK,YAAY,mBAAmBq4C,CAAO;AAEzD,QAAIrpD;AACJ,QAAI;AACA,MAAAA,IAAS,KAAK,QAAQ,YAAYmmB,GAAK5P,GAAMxS,CAAI;AAAA,IACrD,UACR;AACY,MAAK,KAAK,kBAIF/D,MAAW,UAAa,CAACorD,MACzBprD,IAAS,KAAK,UAAS,IAIvBA,MAAW,UAAagR,KAAWA,EAAQ,SAAS,KACpD,KAAK,yBAAyBhR,GAAQqpD,GAASr4C,CAAO;AAAA,IAKlE;AAAA,EACJ;AAAA,EACA,yBAAyBhR,GAAQqpD,GAASr4C,GAAS;AAC/C,UAAM,EAAE,YAAAkH,GAAY,UAAApB,EAAQ,IAAK,KAAK,cAAcuyC,CAAO;AAC3D,QAAInxC;AACA,WAAK,OAAOA,EAAW,UAAUA,EAAW,SAASlY,GAAQgR,GAAS8F,CAAQ;AAAA,aAEzE,CAACoB,GAAY;AAMlB,YAAMyjC,IAAU,KAAK;AACrB,UAAIwO,GAAexO,CAAO;AACtB,QAAAA,EAAQ,SAAS37C,EAAO,SAAQ;AAAA,eAE3B,OAAOA,KAAW,YAAYA,GAAQ;AAE3C,cAAMqrD,IADS,KAAK,sBAAsBrrD,GAAQ27C,CAAO;AAEzD,aAAK,MAAM,IAAG,GACd,KAAK,MAAM,KAAK0P,CAAO;AAAA,MAC3B;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,OAAOL,GAAOxxC,GAAQ;AAClB,QAAI,CAAC,KAAK,eAAe;AACrB,UAAI6X,IAAO,KAAK;AAChB,UAAI7X,EAAO,WAAWA,EAAO,UAAU;AACnC,QAAA6X,IAAO,KAAK,UAAS,GACrB,KAAK,YAAY,WAAWA,EAAK,QAAQ,GAC5B,KAAK,YAAY,mBAAmB7X,CAAM,EAClD,QAAQ,KAAK6X,EAAK,QAAQ;AAC/B,cAAMg6B,IAAU,EAAE,OAAAL,EAAK;AACvB,aAAK,MAAM,KAAKK,CAAO,GACvB,KAAK,OAAO7xC,EAAO,UAAUA,EAAO,SAAS6X,GAAMA,EAAK,QAAQ;AAAA,MACpE;AAEI,QAAAA,EAAK,QAAQ25B;AAAA,IAErB;AAAA,EACJ;AAAA,EACA,YAAY;AACR,QAAI,KAAK;AACL;AAEJ,UAAM/lD,IAAM,KAAK,MAAM,IAAG;AAE1B,WADA,KAAK,YAAY,UAAUA,CAAG,GAC1B,gBAAgBA,IACT,KAAK,eAAeA,GAAK,KAAK,mBAAmB,IAAIA,EAAI,UAAU,CAAC,IAEtEklD,GAAellD,CAAG,IAChB,KAAK,UAAU,QAAQA,EAAI,OAAOA,EAAI,QAAQ,KAGrDqF,GAA0B,KAAK,eAAerF,CAAG,GAE9CA;AAAA,EACX;AAAA,EACA,eAAeA,GAAK6lD,GAAY;AAC5B,UAAMQ,IAAQrmD,EAAI;AAClB,QAAI,CAAC,MAAM,QAAQqmD,CAAK,KAAKA,EAAM,WAAW;AAE1C;AAEJ,UAAMC,IAAYtmD,EAAI;AACtB,QAAI,CAAC,MAAM,QAAQsmD,CAAS,KAAKD,EAAM,SAAS;AAG5C,aAAOA,EAAM,CAAC;AAGlB,QAAIE,IAAsB,GACtBC,IAAwB;AAC5B,aAASxjD,IAAI,GAAGA,IAAIsjD,EAAU,QAAQtjD,KAAK;AACvC,YAAMyjD,IAAWH,EAAUtjD,CAAC,GACtB0jD,IAAeb,EAAW,IAAIY,CAAQ,KAAK;AAAA,QAC7C,YAAY;AAAA,QACZ,YAAY;AAAA,MAC5B;AAEY,MAAIC,EAAa,aAAaF,KAE1BA,IAAwBE,EAAa,YACrCH,IAAsBvjD,KAEjB0jD,EAAa,eAAeF,MAE5BE,EAAa,eAGdH,IAAsBvjD;AAAA,IAKlC;AAEA,UAAM2jD,IAAgBL,EAAU,MAAM,GAAGC,CAAmB,GACtDK,IAAiBN,EAAU,MAAMC,IAAsB,CAAC,GACxDM,IAAYR,EAAM,MAAM,GAAGE,IAAsB,CAAC,GAClDO,IAAaT,EAAM,MAAME,IAAsB,CAAC,GAEhDQ,IAAY;AAAA,MACd,YAAY/mD,EAAI;AAAA,MAChB,OAAOA,EAAI;AAAA,MACX,UAAUA,EAAI;AAAA,MACd,OAAO6mD;AAAA,MACP,WAAWF;AAAA,IACvB,GACcK,IAAa;AAAA,MACf,YAAYhnD,EAAI;AAAA,MAChB,OAAOA,EAAI;AAAA,MACX,UAAUA,EAAI;AAAA,MACd,OAAO8mD;AAAA,MACP,WAAWF;AAAA,IACvB,GAEcK,IAAW,KAAK,eAAeF,GAAWlB,CAAU,GACpDqB,IAAY,KAAK,eAAeF,GAAYnB,CAAU;AAE5D,WAAO;AAAA,MACH,OAAO7lD,EAAI;AAAA,MACX,UAAUA,EAAI;AAAA,MACd,MAAMinD;AAAA,MACN,UAAUX,EAAUC,CAAmB;AAAA,MACvC,OAAOW;AAAA,IACnB;AAAA,EACI;AAAA,EACA,cAAc9C,GAAS;AACnB,QAAI,CAAC,KAAK,cAAc,IAAIA,CAAO,GAAG;AAClC,YAAMnxC,IAAa5O,GAAmB+/C,GAAS59C,EAAY;AAC3D,WAAK,cAAc,IAAI49C,GAAS;AAAA,QAC5B,YAAYnxC;AAAA,QACZ,UAAUA,KAAchM,GAAiBgM,EAAW,QAAQ,IAAKA,EAAW,SAAS,UAAU,UAAU,WAAY;AAAA,MACrI,CAAa;AAAA,IACL;AACA,WAAO,KAAK,cAAc,IAAImxC,CAAO;AAAA,EACzC;AAAA,EACA,OAAOqC,GAAUrC,GAASlpD,GAAO6Q,GAAS8F,GAAU;AAChD,UAAM7R,IAAM,KAAK;AACjB,QAAIoD;AAUJ,YATIyO,MAAa,YAAY,OAAO3W,KAAU,WAC1CkI,IAAO,KAAK,OAAO,eAAepD,GAAKokD,GAASr4C,GAAS7Q,CAAK,IAEzD2W,MAAa,WAAW,OAAO3W,KAAU,WAC9CkI,IAAO,KAAK,OAAO,oBAAoBpD,GAAKokD,GAASr4C,GAAS7Q,CAAK,IAGnEkI,IAAOlI,GAEHurD,GAAQ;AAAA,MACZ,KAAK,KAAK;AACN,QAAAzmD,EAAIokD,CAAO,IAAIhhD;AACf;AAAA,MACJ;AAAA,MACA,KAAK,MAAM;AACP,QAAApD,EAAIokD,CAAO,IAAI;AACf;AAAA,MACJ;AAAA,MACA,KAAK;AACD,QAAK,MAAM,QAAQpkD,EAAIokD,CAAO,CAAC,MAC3BpkD,EAAIokD,CAAO,IAAI,CAAA,IAEnBpkD,EAAIokD,CAAO,EAAE,KAAKhhD,CAAI;AAAA,IAEtC;AAAA,EACI;AAAA,EACA,sBAAsBmtC,GAAQr2C,GAAQ;AAClC,eAAW,CAACkK,GAAM+iD,CAAa,KAAK,OAAO,QAAQjtD,CAAM,GAAG;AACxD,YAAMktD,IAAW7W,EAAOnsC,CAAI;AAC5B,MAAIgjD,MAAa,SACb7W,EAAOnsC,CAAI,IAAI+iD,IAEV,MAAM,QAAQC,CAAQ,KAAK,MAAM,QAAQD,CAAa,MAC3DA,EAAc,KAAK,GAAGC,CAAQ,GAC9B7W,EAAOnsC,CAAI,IAAI+iD;AAAA,IAEvB;AAMA,UAAME,IAAgB9W,EAAO;AAC7B,WAAI8W,MACAA,EAAc,UAAU,QACxB9W,EAAO,WAAW,SAEfA;AAAA,EACX;AAAA,EACA,IAAI,mBAAmB;AACnB,WAAO,KAAK,QAAQ;AAAA,EACxB;AACJ;AACO,MAAM+W,GAAmC;AAAA,EAC5C,0BAA0B1jD,GAAS;AAC/B,WAAOwrB,GAA2B,0BAA0BxrB,CAAO;AAAA,EACvE;AAAA,EACA,8BAA8BA,GAAS;AACnC,WAAOwrB,GAA2B,8BAA8BxrB,CAAO;AAAA,EAC3E;AAAA,EACA,wBAAwBA,GAAS;AAC7B,WAAOwrB,GAA2B,wBAAwBxrB,CAAO;AAAA,EACrE;AAAA,EACA,sBAAsBA,GAAS;AAC3B,WAAOwrB,GAA2B,sBAAsBxrB,CAAO;AAAA,EACnE;AACJ;AACO,MAAM2jD,WAA0CD,GAAmC;AAAA,EACtF,0BAA0B,EAAE,UAAAj4B,GAAU,QAAAC,KAAU;AAM5C,WAAO,aALaD,EAAS,QACvB,MAAMA,EAAS,QAAQ,MACvBA,EAAS,KAAK,SAAS,KAAK,IACxB,YAAYA,EAAS,KAAK,UAAU,GAAGA,EAAS,KAAK,SAAS,CAAC,CAAC,MAChE,kBAAkBA,EAAS,IAAI,GACV,gBAAgBC,EAAO,KAAK;AAAA,EAC/D;AAAA,EACA,8BAA8B,EAAE,gBAAAE,KAAkB;AAC9C,WAAO,qCAAqCA,EAAe,KAAK;AAAA,EACpE;AACJ;AACO,MAAMg4B,WAAgCnC,GAAsB;AAAA,EAC/D,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,SAAS,CAAA,GACd,KAAK,eAAe,CAAA,GACpB,KAAK,mBAAmB,CAAA,GACxB,KAAK,iBAAiB,GACtB,KAAK,YAAY;AAAA,EACrB;AAAA,EACA,SAAS;AAAA,EAET;AAAA,EACA,YAAY;AAAA,EAGZ;AAAA,EACA,MAAMx3C,GAAO;AACT,SAAK,WAAU;AACf,UAAM42C,IAAS,KAAK,MAAM,SAAS52C,GAAO,EAAE,MAAM,WAAW;AAC7D,gBAAK,SAAS42C,EAAO,QACrB,KAAK,QAAQ,QAAQ,CAAC,GAAG,KAAK,MAAM,GACpC,KAAK,SAAS,KAAK,KAAK,SAAS,CAAA,CAAE,GACnC,KAAK,gBAAgB,MAAK,GACnB;AAAA,MACH,QAAQ,KAAK;AAAA,MACb,cAAc,CAAC,GAAG,KAAK,gBAAgB;AAAA,MACvC,YAAY,KAAK;AAAA,IAC7B;AAAA,EACI;AAAA,EACA,KAAKnzC,GAAM83B,GAAM;AACb,UAAMwc,IAAa,KAAK,QAAQ,YAAYR,GAAe9zC,EAAK,IAAI,GAAG,KAAK,oBAAoB83B,CAAI,EAAE,KAAK,IAAI,CAAC;AAChH,gBAAK,SAAS,IAAI93B,EAAK,MAAMs0C,CAAU,GACnCt0C,EAAK,UACL,KAAK,WAAWs0C,IAEbA;AAAA,EACX;AAAA,EACA,aAAa;AACT,SAAK,eAAe,CAAA,GACpB,KAAK,mBAAmB,CAAA,GACxB,KAAK,iBAAiB,GACtB,KAAK,YAAY;AAAA,EACrB;AAAA,EACA,oBAAoBpc,GAAgB;AAChC,WAAO,CAAC1qC,MAAS;AACb,YAAM64B,IAAO,KAAK,cAAa;AAC/B,UAAI;AACA,QAAA6R,EAAe1qC,CAAI;AAAA,MACvB,UACZ;AACgB,aAAK,eAAe64B,CAAI;AAAA,MAC5B;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,2BAA2B;AACvB,SAAK,aAAa,OAAO,KAAK,SAAS;AAAA,EAC3C;AAAA,EACA,gBAAgB;AACZ,UAAMA,IAAO,KAAK,aAAa;AAC/B,gBAAK,YAAYA,GACVA;AAAA,EACX;AAAA,EACA,eAAeA,GAAM;AACjB,SAAK,yBAAwB,GAC7B,KAAK,YAAYA;AAAA,EACrB;AAAA,EACA,QAAQzW,GAAK0F,GAAWw9B,GAAS;AAC7B,SAAK,QAAQ,YAAYljC,GAAK0F,CAAS,GAClC,KAAK,kBACN,KAAK,mBAAmB,CAAC,GAAG,KAAK,cAAcw9B,CAAO,GACtD,KAAK,iBAAiB,KAAK,UAAU;AAAA,EAE7C;AAAA,EACA,QAAQljC,GAAK5P,GAAM60C,GAAU/B,GAAStlD,GAAM;AACxC,SAAK,OAAOslD,CAAO,GACnB,KAAK,QAAQ,YAAYljC,GAAK5P,GAAMxS,CAAI,GACxC,KAAK,MAAMslD,CAAO;AAAA,EACtB;AAAA,EACA,OAAOriD,GAAS;AACZ,IAAK,KAAK,iBACN,KAAK,aAAa,KAAKA,CAAO;AAAA,EAEtC;AAAA,EACA,MAAMA,GAAS;AACX,QAAI,CAAC,KAAK,eAAe;AACrB,YAAMlH,IAAQ,KAAK,aAAa,YAAYkH,CAAO;AACnD,MAAIlH,KAAS,KACT,KAAK,aAAa,OAAOA,CAAK;AAAA,IAEtC;AAAA,EACJ;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,QAAQ;AAAA,EACxB;AACJ;AACA,MAAM4sD,KAAgB;AAAA,EAClB,iBAAiB;AAAA,EACjB,sBAAsB;AAAA,EACtB,iBAAiB;AAAA,EACjB,sBAAsB,IAAIF,GAAiC;AAC/D;AAKA,MAAMhC,WAA0B9V,GAAsB;AAAA,EAClD,YAAYgV,GAAQl7B,GAAQ;AACxB,UAAMm+B,IAAsBn+B,KAAU,kBAAkBA;AACxD,UAAMk7B,GAAQ;AAAA,MACV,GAAGgD;AAAA,MACH,mBAAmBC,IACb,IAAI5iB,GAAqB,EAAE,cAAcvb,EAAO,aAAY,CAAE,IAC9D,IAAIyqB,GAAwB;AAAA;AAAA,QAE1B,SAASzqB,EAAO,kBAAkB,MAAM;AAAA,QAAE,IAAI;AAAA,MAClE,CAAiB;AAAA,MACL,GAAGA;AAAA,IACf,CAAS;AAAA,EACL;AAAA,EACA,IAAI,eAAe;AACf,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,YAAYnlB,GAAMglC,GAAM7f,GAAQ;AAC5B,WAAO,KAAK,KAAKnlB,GAAMglC,GAAM7f,CAAM;AAAA,EACvC;AAAA,EACA,mBAAmB;AACf,SAAK,oBAAmB;AAAA,EAC5B;AAAA,EACA,YAAYrI,GAAK0F,GAAW;AACxB,WAAO,KAAK,QAAQ1F,GAAK0F,GAAW,MAAS;AAAA,EACjD;AAAA,EACA,YAAY1F,GAAK5P,GAAMxS,GAAM;AACzB,WAAO,KAAK,QAAQoiB,GAAK5P,GAAM;AAAA,MAC3B,MAAM,CAACxS,CAAI;AAAA,IACvB,CAAS;AAAA,EACL;AAAA,EACA,OAAOoiB,GAAKskC,GAAS;AACjB,SAAK,GAAGtkC,GAAKskC,CAAO;AAAA,EACxB;AAAA,EACA,WAAWtkC,GAAKukC,GAAU;AACtB,SAAK,OAAOvkC,GAAKukC,CAAQ;AAAA,EAC7B;AAAA,EACA,SAASvkC,GAAKukC,GAAU;AACpB,SAAK,KAAKvkC,GAAKukC,CAAQ;AAAA,EAC3B;AAAA,EACA,eAAevkC,GAAKukC,GAAU;AAC1B,SAAK,WAAWvkC,GAAKukC,CAAQ;AAAA,EACjC;AAAA,EACA,KAAKn0C,GAAM;AACP,WAAOA,EAAK,KAAK,MAAM,EAAE;AAAA,EAC7B;AACJ;AACA,MAAMg0C,WAAwBC,GAAkB;AAAA,EAC5C,YAAYd,GAAQl7B,GAAQo+B,GAAM;AAC9B,UAAMlD,GAAQl7B,CAAM,GACpB,KAAK,OAAOo+B;AAAA,EAChB;AAAA,EACA,KAAKr2C,GAAM;AACP,SAAK,KAAK,MAAK,GACf,KAAK,KAAK,aAAa,KAAK,SAASA,CAAI,CAAC;AAC1C,QAAI;AACA,aAAO,MAAM,KAAKA,CAAI;AAAA,IAC1B,UACR;AACY,WAAK,KAAK,YAAY,KAAK,SAASA,CAAI,CAAC,GACzC,KAAK,KAAK,KAAI;AAAA,IAClB;AAAA,EACJ;AAAA,EACA,SAASA,GAAM;AACX,WAAOA,EAAK;AAAA,EAChB;AAAA,EACA,QAAQ4P,GAAKmoB,GAAYzlC,GAAS;AAC9B,SAAK,KAAK,aAAa,KAAK,SAASylC,CAAU,CAAC;AAChD,QAAI;AACA,aAAO,MAAM,QAAQnoB,GAAKmoB,GAAYzlC,CAAO;AAAA,IACjD,UACR;AACY,WAAK,KAAK,YAAY,KAAK,SAASylC,CAAU,CAAC;AAAA,IACnD;AAAA,EACJ;AACJ;AC5oBO,SAASue,GAAa/2C,GAASg3C,GAAQpD,GAAQ;AAMlD,SAAAqD,GALsB;AAAA,IAClB,QAAAD;AAAA,IACA,QAAApD;AAAA,IACA,WAAW,oBAAI,IAAG;AAAA,EAC1B,GAC8B5zC,CAAO,GAC1Bg3C;AACX;AACA,SAASC,GAAWC,GAAel3C,GAAS;AACxC,QAAMm3C,IAAY/2C,GAAqBJ,GAAS,EAAK,GAC/Co3C,IAAcnlD,GAAO+N,EAAQ,KAAK,EAAE,OAAO/H,EAAY,EAAE,OAAO,CAAAwI,MAAQ02C,EAAU,IAAI12C,CAAI,CAAC;AACjG,aAAWA,KAAQ22C,GAAa;AAC5B,UAAMphB,IAAM;AAAA,MACR,GAAGkhB;AAAA,MACH,SAAS;AAAA,MACT,UAAU;AAAA,MACV,SAAS;AAAA,MACT,MAAM;AAAA,MACN,IAAI;AAAA,IAChB;AACQ,IAAAA,EAAc,OAAO,KAAKz2C,GAAM42C,GAAarhB,GAAKv1B,EAAK,UAAU,CAAC;AAAA,EACtE;AACA,QAAM62C,IAAarlD,GAAO+N,EAAQ,KAAK,EAAE,OAAOhJ,EAAW,EAAE,OAAO,CAAAyJ,MAAQ02C,EAAU,IAAI12C,CAAI,CAAC;AAC/F,aAAWA,KAAQ62C;AACf,IAAAJ,EAAc,OAAO,KAAKz2C,GAAM82C,GAAeL,GAAez2C,CAAI,CAAC;AAE3E;AACA,SAAS82C,GAAevhB,GAAKv1B,GAAM;AAC/B,QAAM+2C,IAAiB/2C,EAAK,KAAK,KAAK;AACtC,MAAI,CAAC+2C;AACD,UAAM,IAAI,MAAM,yDAAyD/2C,EAAK,KAAK,KAAK,QAAQ;AAEpG,MAAIvH,GAAes+C,CAAc;AAC7B,UAAM,IAAI,MAAM,8CAA8C;AAIlE,QAAMC,IAAch3C,EAAK,UAAU,YAAY,QAAQ,CAAAjO,MAAKA,EAAE,SAAS,GAEjEklD,IAAa;AAAA,IACf,OAAO;AAAA,IACP,UAAU,CAAA;AAAA,EAClB,GACUC,IAAkB;AAAA,IACpB,YAAYD;AAAA,IACZ,OAAO;AAAA,IACP,SAAS;AAAA,IACT,UAAU;AAAA,IACV,UAAUj3C,EAAK;AAAA,EACvB,GAGUm3C,IAAa;AAAA,IACf,YAAYF;AAAA,IACZ,OAAO;AAAA,IACP,UAAU,CAAA;AAAA,IACV,aAAa;AAAA,EACrB;AACI,EAAAA,EAAW,SAAS,KAAKC,GAAiBC,CAAU;AAMpD,QAAMC,IAAqB;AAAA,IACvB,YAAYD;AAAA,IACZ,OAAO;AAAA,IACP,SAAS;AAAA,IACT,UAAU;AAAA,IACV,UATiB;AAAA,MACjB,OAAO;AAAA,MACP,UAAUH;AAAA,IAClB;AAAA,EAOA,GAEUK,IAAkB;AAAA,IACpB,GAAGH;AAAA,IACH,YAAYC;AAAA,EACpB;AACI,EAAAA,EAAW,SAAS,KAAKC,GAAoBC,CAAe;AAE5D,QAAMtyB,IADSiyB,EAAY,IAAI,CAAAjlD,MAAKwjC,EAAI,OAAOxjC,EAAE,KAAK,CAAC,EACjC,IAAI,CAACgI,GAAOxQ,OAAW;AAAA,IACzC,KAAK,MAAMgsC,EAAI,OAAO,QAAQhsC,GAAOwQ,GAAOq9C,CAAkB;AAAA,EACtE,EAAM;AACF,MAAItsB;AACJ,SAAO,CAACt9B,MAAS;AACb,IAAAs9B,MAAYA,IAAUwsB,GAAQ/hB,GAAKwhB,CAAc,IACjDxhB,EAAI,OAAO,QAAQ,GAAGzK,GAAS,IAAOosB,GAAiB1pD,CAAI,GAC3D+nC,EAAI,OAAO,KAAK,GAAG;AAAA,MACf,KAAK,MAAM;AACP,QAAAA,EAAI,OAAO,aAAa,GAAGxQ,CAAM,GACjCwQ,EAAI,OAAO,QAAQ,GAAGzK,GAAS,IAAOusB,GAAiB7pD,CAAI;AAAA,MAC/D;AAAA,IACZ,CAAS;AAAA,EACL;AACJ;AACA,SAASopD,GAAarhB,GAAK9kC,GAAS8mD,IAAc,IAAO;AACrD,MAAIC;AACJ,MAAI3gD,GAAUpG,CAAO;AACjB,IAAA+mD,IAASC,GAAaliB,GAAK9kC,CAAO;AAAA,WAE7BmE,GAASnE,CAAO;AACrB,IAAA+mD,IAASE,GAAYniB,GAAK9kC,CAAO;AAAA,WAE5ByE,GAAazE,CAAO;AACzB,IAAA+mD,IAASZ,GAAarhB,GAAK9kC,EAAQ,QAAQ;AAAA,WAEtCkF,GAAiBlF,CAAO;AAC7B,IAAA+mD,IAASG,GAAoBpiB,GAAK9kC,CAAO;AAAA,WAEpCsH,GAAWtH,CAAO;AACvB,IAAA+mD,IAASI,GAAcriB,GAAK9kC,CAAO;AAAA,WAE9BqE,GAAerE,CAAO;AAC3B,IAAA+mD,IAASK,GAAkBtiB,GAAK9kC,CAAO;AAAA,WAElCyI,GAAiBzI,CAAO;AAC7B,IAAA+mD,IAASM,GAAoBviB,GAAK9kC,CAAO;AAAA,WAEpC0F,GAAQ1F,CAAO;AACpB,IAAA+mD,IAASO,GAAWxiB,GAAK9kC,CAAO;AAAA,WAE3BsF,GAAYtF,CAAO,GAAG;AAC3B,UAAMmf,IAAM2lB,EAAI;AAChB,IAAAiiB,IAAS,MAAMjiB,EAAI,OAAO,QAAQ3lB,GAAK4N,IAAK/sB,CAAO;AAAA,EACvD;AAEI,UAAM,IAAIuK,GAAkBvK,EAAQ,UAAU,4BAA4BA,EAAQ,KAAK,EAAE;AAE7F,SAAOunD,GAAKziB,GAAKgiB,IAAc,SAAYU,GAAkBxnD,CAAO,GAAG+mD,GAAQ/mD,EAAQ,WAAW;AACtG;AACA,SAASinD,GAAYniB,GAAKtyB,GAAQ;AAC9B,QAAMF,IAAaJ,GAAYM,CAAM;AACrC,SAAO,MAAMsyB,EAAI,OAAO,OAAOxyB,GAAYE,CAAM;AACrD;AACA,SAAS20C,GAAcriB,GAAK2iB,GAAU;AAClC,QAAMl4C,IAAOk4C,EAAS,KAAK;AAC3B,MAAI1jD,GAAqBwL,CAAI,GAAG;AAC5B,UAAM4P,IAAM2lB,EAAI,WACVsf,IAAWr9C,GAAawI,CAAI,KAAKA,EAAK,UACtChU,IAAYksD,EAAS,UAAU,SAAS,IAAIC,GAAuBn4C,GAAMk4C,EAAS,SAAS,IAAI,OAAO,CAAA;AAC5G,QAAIptB;AACJ,WAAO,CAACt9B,MAAS;AACb,MAAAs9B,MAAYA,IAAUwsB,GAAQ/hB,GAAKv1B,CAAI,IACvCu1B,EAAI,OAAO,QAAQ3lB,GAAKkb,GAAS+pB,GAAUqD,GAAUlsD,EAAUwB,CAAI,CAAC;AAAA,IACxE;AAAA,EACJ,WACSiL,GAAeuH,CAAI,GAAG;AAC3B,UAAM4P,IAAM2lB,EAAI,WACViiB,IAASY,GAAS7iB,GAAKv1B,EAAK,IAAI;AACtC,WAAO,MAAMu1B,EAAI,OAAO,QAAQ3lB,GAAK4nC,GAAQU,CAAQ;AAAA,EACzD,WACUl4C;AAIN,IAAA9E,GAAsB;AAAA;AAHtB,UAAM,IAAIF,GAAkBk9C,EAAS,UAAU,mBAAmBA,EAAS,KAAK,QAAQ,EAAE;AAKlG;AACA,SAASC,GAAuBn4C,GAAMq4C,GAAW;AAE7C,MAD0BA,EAAU,KAAK,CAAAC,MAAOA,EAAI,YAAY,GACzC;AACnB,UAAMC,IAAkBF,EAAU,IAAI,CAAAC,OAAQ;AAAA,MAC1C,eAAeA,EAAI,WAAW,KAAK;AAAA,MACnC,WAAWE,GAAeF,EAAI,KAAK;AAAA,IAC/C,EAAU;AACF,WAAO,CAAC9qD,MAAS;AACb,YAAMirD,IAAW,CAAA;AACjB,iBAAW,EAAE,eAAAC,GAAe,WAAA1sD,EAAS,KAAMusD;AACvC,QAAIG,MACAD,EAASC,CAAa,IAAI1sD,EAAUwB,CAAI;AAGhD,aAAOirD;AAAA,IACX;AAAA,EACJ,OACK;AACD,UAAMzzB,IAAaqzB,EAAU,IAAI,CAAAC,MAAOE,GAAeF,EAAI,KAAK,CAAC;AACjE,WAAO,CAAC9qD,MAAS;AACb,YAAMirD,IAAW,CAAA;AACjB,eAAS/mD,IAAI,GAAGA,IAAIszB,EAAW,QAAQtzB;AACnC,YAAIA,IAAIsO,EAAK,WAAW,QAAQ;AAC5B,gBAAM04C,IAAgB14C,EAAK,WAAWtO,CAAC,EAAE,MACnC1F,IAAYg5B,EAAWtzB,CAAC;AAC9B,UAAA+mD,EAASC,CAAa,IAAI1sD,EAAUwB,CAAI;AAAA,QAC5C;AAEJ,aAAOirD;AAAA,IACX;AAAA,EACJ;AACJ;AACA,SAASD,GAAeG,GAAW;AAC/B,MAAI9iD,GAAc8iD,CAAS,GAAG;AAC1B,UAAMjX,IAAO8W,GAAeG,EAAU,IAAI,GACpChX,IAAQ6W,GAAeG,EAAU,KAAK;AAC5C,WAAO,CAACnrD,MAAUk0C,EAAKl0C,CAAI,KAAKm0C,EAAMn0C,CAAI;AAAA,EAC9C,WACSiI,GAAckjD,CAAS,GAAG;AAC/B,UAAMjX,IAAO8W,GAAeG,EAAU,IAAI,GACpChX,IAAQ6W,GAAeG,EAAU,KAAK;AAC5C,WAAO,CAACnrD,MAAUk0C,EAAKl0C,CAAI,KAAKm0C,EAAMn0C,CAAI;AAAA,EAC9C,WACS0J,GAAWyhD,CAAS,GAAG;AAC5B,UAAM/uD,IAAQ4uD,GAAeG,EAAU,KAAK;AAC5C,WAAO,CAACnrD,MAAS,CAAC5D,EAAM4D,CAAI;AAAA,EAChC,WACS8J,GAAqBqhD,CAAS,GAAG;AACtC,UAAM7lD,IAAO6lD,EAAU,UAAU,IAAI;AACrC,WAAO,CAACnrD,MAASA,MAAS,UAAaA,EAAKsF,CAAI,MAAM;AAAA,EAC1D,WACSsC,GAAiBujD,CAAS,GAAG;AAClC,UAAM/uD,IAAQ,EAAQ+uD,EAAU;AAChC,WAAO,MAAM/uD;AAAA,EACjB;AACA,EAAAsR,GAA2B;AAC/B;AACA,SAAS28C,GAAkBtiB,GAAKjxB,GAAc;AAC1C,MAAIA,EAAa,SAAS,WAAW;AACjC,WAAOsyC,GAAarhB,GAAKjxB,EAAa,SAAS,CAAC,CAAC;AAEhD;AACD,UAAMs0C,IAAU,CAAA;AAChB,eAAWnoD,KAAW6T,EAAa,UAAU;AACzC,YAAMu0C,IAAmB;AAAA;AAAA;AAAA,QAGrB,KAAKjC,GAAarhB,GAAK9kC,GAAS,EAAI;AAAA,MACpD,GACkB7E,IAAQqsD,GAAkBxnD,CAAO;AACvC,MAAI7E,MACAitD,EAAiB,OAAOL,GAAe5sD,CAAK,IAEhDgtD,EAAQ,KAAKC,CAAgB;AAAA,IACjC;AACA,UAAMjpC,IAAM2lB,EAAI;AAChB,WAAO,CAAC/nC,MAAS+nC,EAAI,OAAO,aAAa3lB,GAAKgpC,EAAQ,IAAI,CAAApB,MAAU;AAChE,YAAM9uC,IAAM;AAAA,QACR,KAAK,MAAM8uC,EAAO,IAAIhqD,CAAI;AAAA,MAC1C,GACkBy1C,IAAOuU,EAAO;AACpB,aAAIvU,MACAv6B,EAAI,OAAO,MAAMu6B,EAAKz1C,CAAI,IAEvBkb;AAAA,IACX,CAAC,CAAC;AAAA,EACN;AACJ;AACA,SAASovC,GAAoBviB,GAAKhxB,GAAO;AACrC,MAAIA,EAAM,SAAS,WAAW;AAC1B,WAAOqyC,GAAarhB,GAAKhxB,EAAM,SAAS,CAAC,CAAC;AAE9C,QAAMq0C,IAAU,CAAA;AAChB,aAAWnoD,KAAW8T,EAAM,UAAU;AAClC,UAAMs0C,IAAmB;AAAA;AAAA;AAAA,MAGrB,KAAKjC,GAAarhB,GAAK9kC,GAAS,EAAI;AAAA,IAChD,GACc7E,IAAQqsD,GAAkBxnD,CAAO;AACvC,IAAI7E,MACAitD,EAAiB,OAAOL,GAAe5sD,CAAK,IAEhDgtD,EAAQ,KAAKC,CAAgB;AAAA,EACjC;AACA,QAAMC,IAAQvjB,EAAI,MACZwjB,IAAS,CAACC,GAAUC,MAAY;AAClC,UAAMC,IAAUD,EAAQ,aAAY,EAAG,KAAK,GAAG;AAC/C,WAAO,UAAUD,CAAQ,IAAIE,CAAO;AAAA,EACxC,GACM50C,IAAe,CAAC9W,MAAS+nC,EAAI,OAAO,aAAaujB,GAAOF,EAAQ,IAAI,CAACpB,GAAQ5nC,MAAQ;AACvF,UAAMlH,IAAM,EAAE,KAAK,MAAM,GAAI,GACvB6tC,IAAShhB,EAAI;AACnB,IAAA7sB,EAAI,MAAM,MAAM;AAEZ,UADA8uC,EAAO,IAAIhqD,CAAI,GACX,CAAC+oD,EAAO,eAAe;AACvB,cAAMttD,IAAM8vD,EAAOD,GAAOvC,CAAM;AAChC,QAAKA,EAAO,gBAAgB,IAAIttD,CAAG,KAE/BstD,EAAO,gBAAgB,IAAIttD,GAAK,CAAA,CAAE;AAEtC,cAAMkwD,IAAa5C,EAAO,gBAAgB,IAAIttD,CAAG;AACjD,QAAI,OAAOkwD,IAAavpC,CAAG,IAAM,QAE7BupC,EAAWvpC,CAAG,IAAI;AAAA,MAE1B;AAAA,IACJ;AACA,UAAMqzB,IAAOuU,EAAO;AACpB,WAAIvU,IACAv6B,EAAI,OAAO,MAAMu6B,EAAKz1C,CAAI,IAG1Bkb,EAAI,OAAO,MAEO,CADc6tC,EAAO,gBAAgB,IAAIwC,EAAOD,GAAOvC,CAAM,CAAC,IACvC3mC,CAAG,GAIzClH;AAAA,EACX,CAAC,CAAC,GACI0wC,IAAUpB,GAAKziB,GAAK0iB,GAAkB1zC,CAAK,GAAGD,GAAc,GAAG;AACrE,SAAO,CAAC9W,MAAS;AACb,IAAA4rD,EAAQ5rD,CAAI,GACP+nC,EAAI,OAAO,iBACZA,EAAI,OAAO,gBAAgB,OAAOwjB,EAAOD,GAAOvjB,EAAI,MAAM,CAAC;AAAA,EAEnE;AACJ;AACA,SAASwiB,GAAWxiB,GAAKhxB,GAAO;AAC5B,QAAMq0C,IAAUr0C,EAAM,SAAS,IAAI,CAAAxS,MAAK6kD,GAAarhB,GAAKxjC,CAAC,CAAC;AAC5D,SAAO,CAACvE,MAASorD,EAAQ,QAAQ,CAAApB,MAAUA,EAAOhqD,CAAI,CAAC;AAC3D;AACA,SAASyqD,GAAkBxnD,GAAS;AAChC,MAAI0F,GAAQ1F,CAAO;AACf,WAAOA,EAAQ;AAGvB;AACA,SAASknD,GAAoBpiB,GAAKh1B,GAAUoH,IAAWpH,EAAS,UAAU;AACtE,MAAKoH;AAWA,QAAI5P,GAAW4P,CAAQ,KAAKnQ,GAAamQ,EAAS,KAAK,GAAG,GAAG;AAE9D,YAAM3H,IAAO2H,EAAS,KAAK,KACrBiI,IAAM2lB,EAAI;AAChB,UAAIzK;AACJ,aAAO,CAACt9B,MAAS;AACb,QAAAs9B,MAAYA,IAAUwsB,GAAQ/hB,GAAKv1B,CAAI,IACvCu1B,EAAI,OAAO,QAAQ3lB,GAAKkb,GAAS,IAAOvqB,GAAU/S,CAAI;AAAA,MAC1D;AAAA,IACJ,WACSuK,GAAW4P,CAAQ,KAAKlP,GAAekP,EAAS,KAAK,GAAG,GAAG;AAChE,YAAMiI,IAAM2lB,EAAI,WACV70B,IAAe03C,GAAS7iB,GAAK5tB,EAAS,KAAK,IAAI,IAAI;AACzD,aAAO,MAAM4tB,EAAI,OAAO,QAAQ3lB,GAAKlP,GAAcH,CAAQ;AAAA,IAC/D,WACS1J,GAAU8Q,CAAQ,GAAG;AAC1B,YAAMiI,IAAM2lB,EAAI,WACVn0B,IAAUg3C,GAAS7iB,GAAK5tB,EAAS,KAAK;AAC5C,aAAO,MAAM4tB,EAAI,OAAO,QAAQ3lB,GAAKxO,GAASb,CAAQ;AAAA,IAC1D;AAEI,YAAM,IAAI,MAAM,wCAAwC;AAAA,OAhC7C;AACX,QAAI,CAACA,EAAS,KAAK;AACf,YAAM,IAAI,MAAM,0CAA0CA,EAAS,KAAK,QAAQ;AAGpF,UAAM84C,IADa74C,GAAmBD,EAAS,KAAK,GAAG,GACpB;AACnC,QAAI,CAAC84C;AACD,YAAM,IAAI,MAAM,8CAA8C12C,GAAYpC,EAAS,KAAK,GAAG,CAAC;AAEhG,WAAOo3C,GAAoBpiB,GAAKh1B,GAAU84C,CAAc;AAAA,EAC5D;AAwBJ;AACA,SAAS5B,GAAaliB,GAAKn0B,GAAS;AAChC,QAAMwO,IAAM2lB,EAAI,WACVx7B,IAAQw7B,EAAI,OAAOn0B,EAAQ,KAAK;AACtC,MAAI,CAACrH;AACD,UAAM,IAAI,MAAM,uCAAuCqH,EAAQ,KAAK;AAExE,SAAO,MAAMm0B,EAAI,OAAO,QAAQ3lB,GAAK7V,GAAOqH,CAAO;AACvD;AACA,SAAS42C,GAAKziB,GAAK3pC,GAAO4rD,GAAQ8B,GAAa;AAC3C,QAAMrW,IAAOr3C,KAAS4sD,GAAe5sD,CAAK;AAC1C,MAAI,CAAC0tD;AACD,QAAIrW,GAAM;AACN,YAAMrzB,IAAM2lB,EAAI;AAChB,aAAO,CAAC/nC,MAAS+nC,EAAI,OAAO,aAAa3lB,GAAK;AAAA,QAC1C;AAAA,UACI,KAAK,MAAM4nC,EAAOhqD,CAAI;AAAA,UACtB,MAAM,MAAMy1C,EAAKz1C,CAAI;AAAA,QACzC;AAAA,QACgB;AAAA,UACI,KAAKgwC,GAAS;AAAA,UACd,MAAM,MAAM,CAACyF,EAAKz1C,CAAI;AAAA,QAC1C;AAAA,MACA,CAAa;AAAA,IACL;AAEI,aAAOgqD;AAGf,MAAI8B,MAAgB,KAAK;AACrB,UAAM1pC,IAAM2lB,EAAI;AAChB,WAAO,CAAC/nC,MAAS+nC,EAAI,OAAO,KAAK3lB,GAAK;AAAA,MAClC,KAAK,MAAM4nC,EAAOhqD,CAAI;AAAA,MACtB,MAAMy1C,IAAO,MAAMA,EAAKz1C,CAAI,IAAI;AAAA,IAC5C,CAAS;AAAA,EACL,WACS8rD,MAAgB,KAAK;AAC1B,UAAM1pC,IAAM2lB,EAAI;AAChB,QAAI0N,GAAM;AACN,YAAM6V,IAAQvjB,EAAI;AAKlB,aAAO,CAAC/nC,MAAS+nC,EAAI,OAAO,aAAaujB,GAAO;AAAA,QAC5C;AAAA,UACI,KAAK,MAAMvjB,EAAI,OAAO,WAAW3lB,GAAK;AAAA,YAClC,KAAK,MAAM4nC,EAAOhqD,CAAI;AAAA,UAC9C,CAAqB;AAAA,UACD,MAAM,MAAMy1C,EAAKz1C,CAAI;AAAA,QACzC;AAAA,QACgB;AAAA,UACI,KAAKgwC,GAAS;AAAA,UACd,MAAM,MAAM,CAACyF,EAAKz1C,CAAI;AAAA,QAC1C;AAAA,MACA,CAAa;AAAA,IACL;AAEI,aAAO,CAACA,MAAS+nC,EAAI,OAAO,WAAW3lB,GAAK;AAAA,QACxC,KAAK,MAAM4nC,EAAOhqD,CAAI;AAAA,MACtC,CAAa;AAAA,EAET,WACS8rD,MAAgB,KAAK;AAC1B,UAAM1pC,IAAM2lB,EAAI;AAChB,WAAO,CAAC/nC,MAAS+nC,EAAI,OAAO,SAAS3lB,GAAK;AAAA,MACtC,KAAK,MAAM4nC,EAAOhqD,CAAI;AAAA,MACtB,MAAMy1C,IAAO,MAAMA,EAAKz1C,CAAI,IAAI;AAAA,IAC5C,CAAS;AAAA,EACL;AAEI,IAAA0N,GAA6B;AAErC;AACA,SAASo8C,GAAQ/hB,GAAK9kC,GAAS;AAC3B,QAAMqC,IAAOymD,GAAYhkB,GAAK9kC,CAAO,GAC/BuP,IAAOu1B,EAAI,OAAO,QAAQziC,CAAI;AACpC,MAAI,CAACkN;AACD,UAAM,IAAI,MAAM,SAASlN,CAAI,eAAe;AAChD,SAAOkN;AACX;AACA,SAASu5C,GAAYhkB,GAAK9kC,GAAS;AAC/B,MAAI+D,GAAqB/D,CAAO;AAC5B,WAAOA,EAAQ;AAEd,MAAI8kC,EAAI,UAAU,IAAI9kC,CAAO;AAC9B,WAAO8kC,EAAI,UAAU,IAAI9kC,CAAO;AAE/B;AACD,QAAIqB,IAAOrB,GACPoJ,IAAS/H,EAAK,YACdmsB,IAAWxtB,EAAQ;AACvB,WAAO,CAAC+G,GAAaqC,CAAM;AACvB,OAAI1D,GAAQ0D,CAAM,KAAK/E,GAAe+E,CAAM,KAAKX,GAAiBW,CAAM,OAEpEokB,IADcpkB,EAAO,SAAS,QAAQ/H,CAAI,EACzB,SAAQ,IAAK,MAAMmsB,IAExCnsB,IAAO+H,GACPA,IAASA,EAAO;AAGpB,WAAAokB,IADapkB,EACG,OAAO,MAAMokB,GAC7BsX,EAAI,UAAU,IAAI9kC,GAASwtB,CAAQ,GAC5BA;AAAA,EACX;AACJ;AACA,SAASm6B,GAAS7iB,GAAKziC,GAAM;AACzB,QAAMiH,IAAQw7B,EAAI,OAAOziC,CAAI;AAC7B,MAAI,CAACiH;AACD,UAAM,IAAI,MAAM,UAAUjH,CAAI,eAAe;AACjD,SAAOiH;AACX;ACjdO,SAASy/C,GAAuB70C,GAAU;AAC7C,QAAMpF,IAAUoF,EAAS,SACnB80C,IAAQ90C,EAAS,OAAO,OACxB4xC,IAAS,IAAIL,GAAwBvxC,CAAQ;AACnD,SAAA2xC,GAAa/2C,GAASg3C,GAAQkD,EAAM,UAAU,GAC9ClD,EAAO,SAAQ,GACRA;AACX;ACHO,SAASmD,GAAoB/0C,GAAU;AAC1C,QAAM4xC,IAASoD,GAAqBh1C,CAAQ;AAC5C,SAAA4xC,EAAO,SAAQ,GACRA;AACX;AAKO,SAASoD,GAAqBh1C,GAAU;AAC3C,QAAMpF,IAAUoF,EAAS,SACnB80C,IAAQ90C,EAAS,OAAO,OACxB4xC,IAAS,IAAInC,GAAczvC,CAAQ;AACzC,SAAO2xC,GAAa/2C,GAASg3C,GAAQkD,EAAM,UAAU;AACzD;ACdO,MAAMG,GAAoB;AAAA,EAC7B,cAAc;AAIV,SAAK,cAAc,CAAA;AAAA,EACvB;AAAA,EACA,YAAYr6C,GAASjN,GAAS;AAC1B,UAAMunD,IAAiBroD,GAAOmO,GAAqBJ,GAAS,EAAK,CAAC,GAC5Du6C,IAAiB,KAAK,oBAAoBD,CAAc,GACxD1G,IAAS,KAAK,mBAAmB0G,GAAgBC,GAAgBxnD,CAAO;AAI9E,WAAA6gD,EAAO,KAAK,GAAG2G,CAAc,GAGtB3G;AAAA,EACX;AAAA;AAAA,EAEA,kBAAkB39B,GAAM;AACpB,WAAO,EAAE,aAAa,KAAK,iBAAgB;AAAA,EAC/C;AAAA,EACA,iBAAiB;AACb,UAAM84B,IAAc,CAAC,GAAG,KAAK,WAAW;AACxC,gBAAK,cAAc,CAAA,GACZA;AAAA,EACX;AAAA,EACA,oBAAoBpuC,GAAO;AACvB,WAAOA,EAAM,OAAOzH,EAAc,EAAE,OAAO,CAAA1G,MAAK,CAACA,EAAE,QAAQ,EACtD,IAAI,CAAA4V,MAAY,KAAK,mBAAmBA,CAAQ,CAAC,EAAE,QAAO;AAAA,EACnE;AAAA,EACA,mBAAmBA,GAAU;AACzB,UAAMvJ,IAAQuC,GAAcgH,CAAQ,GAC9BZ,IAAU,KAAK,sBAAsB3I,CAAK,IAAI,KAAK,qBAAqBA,CAAK,IAAIA,GACjFkX,IAAY;AAAA,MACd,MAAM3N,EAAS;AAAA,MACf,SAASZ;AAAA,IACrB;AACQ,WAAI,OAAOA,KAAY,eACnBuO,EAAU,cAAc,KAExB3N,EAAS,WAET2N,EAAU,QAAQ5W,GAAaN,CAAK,IAAIwP,GAAM,UAAU,WAErD0H;AAAA,EACX;AAAA,EACA,sBAAsBlX,GAAO;AACzB,WAAI,GAAAA,EAAM,MAAM,SAAS,GAAG,KAAKA,EAAM,MAAM,SAAS,GAAG;AAAA,EAO7D;AAAA,EACA,qBAAqBA,GAAO;AACxB,UAAM27C,IAAc,IAAI,OAAO37C,GAAOA,EAAM,QAAQ,GAAG;AACvD,WAAO,CAACoX,GAAMvb,OACV8/C,EAAY,YAAY9/C,GACL8/C,EAAY,KAAKvkC,CAAI;AAAA,EAGhD;AAAA,EACA,mBAAmBtV,GAAO45C,GAAgBxnD,GAAS;AAC/C,WAAO4N,EAEF,OAAO1L,EAAoB,EAC3B,QAAQ,CAAAwL,MAAQvM,GAAkBuM,CAAI,EAAE,OAAOnJ,EAAS,CAAC,EACzD,SAAS,CAAA9E,MAAKA,EAAE,KAAK,EAAE,QAAO,EAE9B,KAAK,CAACiwC,GAAGvvC,MAAMA,EAAE,MAAM,SAASuvC,EAAE,MAAM,MAAM,EAC9C,IAAI,CAAA5gC,MAAW,KAAK,kBAAkBA,GAAS04C,GAAgB,EAAQxnD,GAAS,eAAgB,CAAC;AAAA,EAC1G;AAAA,EACA,kBAAkB8O,GAAS04C,GAAgBE,GAAiB;AACxD,UAAMC,IAAiB,KAAK,oBAAoB74C,GAAS44C,CAAe,GAClE1kC,IAAY;AAAA,MACd,MAAMlU,EAAQ;AAAA,MACd,SAAS64C;AAAA,MACT,YAAY,KAAK,cAAc74C,GAAS04C,CAAc;AAAA,IAClE;AACQ,WAAI,OAAOG,KAAmB,eAC1B3kC,EAAU,cAAc,KAErBA;AAAA,EACX;AAAA,EACA,oBAAoBlU,GAAS44C,GAAiB;AAC1C,WAAOA,IACH,IAAI,OAAO37C,GAAa+C,EAAQ,KAAK,GAAG,GAAG,IAC3CA,EAAQ;AAAA,EAChB;AAAA,EACA,cAAcA,GAAS04C,GAAgB;AACnC,WAAOA,EAAe,OAAO,CAACI,GAAYngD,MAAU;AAChD,YAAMgN,IAAUhN,GAAO;AACvB,aAAIgN,GAAS,UAAUnI,GAAe,MAAMmI,EAAQ,SAAS,KAAK3F,EAAQ,KAAK,KAC3E84C,EAAW,KAAKngD,CAAK,GAElBmgD;AAAA,IACX,GAAG,CAAA,CAAE;AAAA,EACT;AACJ;ACzGO,MAAMC,GAAsB;AAAA,EAC/B,QAAQ59C,GAAO9B,GAAS;AACpB,QAAIq4C,IAAUr4C,EAAQ;AAItB,QAHI9E,GAAiBm9C,CAAO,MACxBA,IAAUxyC,GAA0BwyC,CAAO,IAE3C/6C,GAAW+6C,CAAO,GAAG;AACrB,YAAM9yC,IAAO8yC,EAAQ,KAAK;AAC1B,UAAI,CAAC9yC;AACD,cAAM,IAAI,MAAM,yCAAyC;AAE7D,aAAO,KAAK,aAAaA,GAAMzD,GAAO9B,CAAO;AAAA,IACjD;AACA,WAAO8B;AAAA,EACX;AAAA;AAAA,EAEA,aAAayD,GAAMzD,GAAO9B,GAAS;AAC/B,YAAQuF,EAAK,KAAK,YAAW,GAAE;AAAA,MAC3B,KAAK;AAAO,eAAOo6C,GAAe,WAAW79C,CAAK;AAAA,MAClD,KAAK;AAAU,eAAO69C,GAAe,cAAc79C,CAAK;AAAA,MACxD,KAAK;AAAM,eAAO69C,GAAe,UAAU79C,CAAK;AAAA,IAC5D;AACQ,YAAQ2G,GAAYlD,CAAI,GAAG,YAAW,GAAE;AAAA,MACpC,KAAK;AAAU,eAAOo6C,GAAe,cAAc79C,CAAK;AAAA,MACxD,KAAK;AAAW,eAAO69C,GAAe,eAAe79C,CAAK;AAAA,MAC1D,KAAK;AAAU,eAAO69C,GAAe,cAAc79C,CAAK;AAAA,MACxD,KAAK;AAAQ,eAAO69C,GAAe,YAAY79C,CAAK;AAAA,MACpD;AAAS,eAAOA;AAAA,IAC5B;AAAA,EACI;AACJ;AACO,IAAI69C;AAAA,CACV,SAAUA,GAAgB;AACvB,WAASC,EAAc99C,GAAO;AAC1B,QAAI9S,IAAS;AACb,aAASiI,IAAI,GAAGA,IAAI6K,EAAM,SAAS,GAAG7K,KAAK;AACvC,YAAMgkB,IAAInZ,EAAM,OAAO7K,CAAC;AACxB,UAAIgkB,MAAM,MAAM;AACZ,cAAM4kC,IAAK/9C,EAAM,OAAO,EAAE7K,CAAC;AAC3B,QAAAjI,KAAU8wD,EAAuBD,CAAE;AAAA,MACvC;AAEI,QAAA7wD,KAAUisB;AAAA,IAElB;AACA,WAAOjsB;AAAA,EACX;AACA,EAAA2wD,EAAe,gBAAgBC;AAC/B,WAASE,EAAuBl/C,GAAM;AAClC,YAAQA,GAAI;AAAA,MACR,KAAK;AAAK,eAAO;AAAA,MACjB,KAAK;AAAK,eAAO;AAAA,MACjB,KAAK;AAAK,eAAO;AAAA;AAAA,MACjB,KAAK;AAAK,eAAO;AAAA,MACjB,KAAK;AAAK,eAAO;AAAA,MACjB,KAAK;AAAK,eAAO;AAAA,MACjB,KAAK;AAAK,eAAO;AAAA,MACjB;AAAS,eAAOA;AAAA,IAC5B;AAAA,EACI;AACA,WAASm/C,EAAUj+C,GAAO;AACtB,WAAIA,EAAM,OAAO,CAAC,MAAM,MACbA,EAAM,UAAU,CAAC,IAGjBA;AAAA,EAEf;AACA,EAAA69C,EAAe,YAAYI;AAC3B,WAASC,EAAWl+C,GAAO;AACvB,WAAO,SAASA,CAAK;AAAA,EACzB;AACA,EAAA69C,EAAe,aAAaK;AAC5B,WAASC,EAAcn+C,GAAO;AAC1B,WAAO,OAAOA,CAAK;AAAA,EACvB;AACA,EAAA69C,EAAe,gBAAgBM;AAC/B,WAASC,EAAYp+C,GAAO;AACxB,WAAO,IAAI,KAAKA,CAAK;AAAA,EACzB;AACA,EAAA69C,EAAe,cAAcO;AAC7B,WAASC,EAAcr+C,GAAO;AAC1B,WAAO,OAAOA,CAAK;AAAA,EACvB;AACA,EAAA69C,EAAe,gBAAgBQ;AAC/B,WAASC,EAAet+C,GAAO;AAC3B,WAAOA,EAAM,YAAW,MAAO;AAAA,EACnC;AACA,EAAA69C,EAAe,iBAAiBS;AACpC,GAAGT,OAAmBA,KAAiB,CAAA,EAAG;;;;UC3F1C,OAAO,eAAeU,IAAS,cAAc,EAAE,OAAO,IAAM;AAC5D,MAAIC;AACJ,WAASC,IAAM;AACX,QAAID,MAAS;AACT,YAAM,IAAI,MAAM,wCAAwC;AAE5D,WAAOA;AAAA,EACX;AACA,UAAC,SAAUC,GAAK;AACZ,aAASC,EAAQH,GAAK;AAClB,UAAIA,MAAQ;AACR,cAAM,IAAI,MAAM,uCAAuC;AAE3D,MAAAC,IAAOD;AAAA,IACf;AACI,IAAAE,EAAI,UAAUC;AAAA,EAClB,GAAGD,MAAQA,IAAM,CAAA,EAAG,GACpBF,GAAA,UAAkBE;;;;;UCjBlB,OAAO,eAAerU,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,cAAsBA,GAAA,QAAgBA,GAAA,OAAeA,GAAA,QAAgBA,GAAA,SAAiBA,GAAA,SAAiBA,GAAA,UAAkB;AACzH,WAAS2L,EAAQ1oD,GAAO;AACpB,WAAOA,MAAU,MAAQA,MAAU;AAAA,EACvC;AACA+8C,EAAAA,GAAA,UAAkB2L;AAClB,WAASC,EAAO3oD,GAAO;AACnB,WAAO,OAAOA,KAAU,YAAYA,aAAiB;AAAA,EACzD;AACA+8C,EAAAA,GAAA,SAAiB4L;AACjB,WAAS90C,EAAO7T,GAAO;AACnB,WAAO,OAAOA,KAAU,YAAYA,aAAiB;AAAA,EACzD;AACA+8C,EAAAA,GAAA,SAAiBlpC;AACjB,WAASsb,EAAMnvB,GAAO;AAClB,WAAOA,aAAiB;AAAA,EAC5B;AACA+8C,EAAAA,GAAA,QAAgB5tB;AAChB,WAASzuB,EAAKV,GAAO;AACjB,WAAO,OAAOA,KAAU;AAAA,EAC5B;AACA+8C,EAAAA,GAAA,OAAer8C;AACf,WAASlB,EAAMQ,GAAO;AAClB,WAAO,MAAM,QAAQA,CAAK;AAAA,EAC9B;AACA+8C,EAAAA,GAAA,QAAgBv9C;AAChB,WAAS8xD,EAAYtxD,GAAO;AACxB,WAAOR,EAAMQ,CAAK,KAAKA,EAAM,MAAM,CAAAuxD,MAAQ5I,EAAO4I,CAAI,CAAC;AAAA,EAC3D;AACAxU,SAAAA,GAAA,cAAsBuU;;;;;UC7BtB,OAAO,eAAeE,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,UAAkBA,GAAA,QAAgB;AAClC,QAAMC,IAAQC,GAAA;AACd,MAAIC;AACJ,GAAC,SAAUA,GAAO;AACd,UAAMC,IAAc,EAAE,UAAU;AAAA,MAAG;AACnC,IAAAD,EAAM,OAAO,WAAY;AAAE,aAAOC;AAAA,IAAY;AAAA,EAClD,GAAGD,MAAUH,GAAA,QAAgBG,IAAQ,CAAA,EAAG;AAAA,EACxC,MAAME,EAAa;AAAA,IACf,IAAItH,GAAUuH,IAAU,MAAMC,GAAQ;AAClC,MAAK,KAAK,eACN,KAAK,aAAa,CAAA,GAClB,KAAK,YAAY,CAAA,IAErB,KAAK,WAAW,KAAKxH,CAAQ,GAC7B,KAAK,UAAU,KAAKuH,CAAO,GACvB,MAAM,QAAQC,CAAM,KACpBA,EAAO,KAAK,EAAE,SAAS,MAAM,KAAK,OAAOxH,GAAUuH,CAAO,GAAG;AAAA,IAEzE;AAAA,IACI,OAAOvH,GAAUuH,IAAU,MAAM;AAC7B,UAAI,CAAC,KAAK;AACN;AAEJ,UAAIE,IAAoC;AACxC,eAASlqD,IAAI,GAAG+jB,IAAM,KAAK,WAAW,QAAQ/jB,IAAI+jB,GAAK/jB;AACnD,YAAI,KAAK,WAAWA,CAAC,MAAMyiD;AACvB,cAAI,KAAK,UAAUziD,CAAC,MAAMgqD,GAAS;AAE/B,iBAAK,WAAW,OAAOhqD,GAAG,CAAC,GAC3B,KAAK,UAAU,OAAOA,GAAG,CAAC;AAC1B;AAAA,UACpB;AAEoB,YAAAkqD,IAAoC;AAIhD,UAAIA;AACA,cAAM,IAAI,MAAM,mFAAmF;AAAA,IAE/G;AAAA,IACI,UAAUpuD,GAAM;AACZ,UAAI,CAAC,KAAK;AACN,eAAO,CAAA;AAEX,YAAMquD,IAAM,CAAA,GAAIC,IAAY,KAAK,WAAW,MAAM,CAAC,GAAGC,IAAW,KAAK,UAAU,MAAM,CAAC;AACvF,eAASrqD,IAAI,GAAG+jB,IAAMqmC,EAAU,QAAQpqD,IAAI+jB,GAAK/jB;AAC7C,YAAI;AACA,UAAAmqD,EAAI,KAAKC,EAAUpqD,CAAC,EAAE,MAAMqqD,EAASrqD,CAAC,GAAGlE,CAAI,CAAC;AAAA,QAC9D,SACmBuE,GAAG;AAEN,cAAIspD,EAAM,SAAO,EAAI,QAAQ,MAAMtpD,CAAC;AAAA,QACpD;AAEQ,aAAO8pD;AAAA,IACf;AAAA,IACI,UAAU;AACN,aAAO,CAAC,KAAK,cAAc,KAAK,WAAW,WAAW;AAAA,IAC9D;AAAA,IACI,UAAU;AACN,WAAK,aAAa,QAClB,KAAK,YAAY;AAAA,IACzB;AAAA,EACA;AAAA,EACA,MAAMG,EAAQ;AAAA,IACV,YAAYC,GAAU;AAClB,WAAK,WAAWA;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKI,IAAI,QAAQ;AACR,aAAK,KAAK,WACN,KAAK,SAAS,CAACC,GAAUC,GAAUC,MAAgB;AAC/C,QAAK,KAAK,eACN,KAAK,aAAa,IAAIX,EAAY,IAElC,KAAK,YAAY,KAAK,SAAS,sBAAsB,KAAK,WAAW,aACrE,KAAK,SAAS,mBAAmB,IAAI,GAEzC,KAAK,WAAW,IAAIS,GAAUC,CAAQ;AACtC,cAAM1yD,IAAS;AAAA,UACX,SAAS,MAAM;AACX,YAAK,KAAK,eAIV,KAAK,WAAW,OAAOyyD,GAAUC,CAAQ,GACzC1yD,EAAO,UAAUuyD,EAAQ,OACrB,KAAK,YAAY,KAAK,SAAS,wBAAwB,KAAK,WAAW,aACvE,KAAK,SAAS,qBAAqB,IAAI;AAAA,UAEnE;AAAA;AAEgB,eAAI,MAAM,QAAQI,CAAW,KACzBA,EAAY,KAAK3yD,CAAM,GAEpBA;AAAA,MACvB,IAEe,KAAK;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKI,KAAKkoD,GAAO;AACR,MAAI,KAAK,cACL,KAAK,WAAW,OAAO,KAAK,KAAK,YAAYA,CAAK;AAAA,IAE9D;AAAA,IACI,UAAU;AACN,MAAI,KAAK,eACL,KAAK,WAAW,QAAO,GACvB,KAAK,aAAa;AAAA,IAE9B;AAAA,EACA;AACA,SAAAyJ,GAAA,UAAkBY,GAClBA,EAAQ,QAAQ,WAAY;AAAA,EAAA;;;;;UC1H5B,OAAO,eAAeK,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,0BAAkCA,GAAA,oBAA4B;AAC9D,QAAMhB,IAAQC,GAAA,GACRnU,IAAKmV,GAAA,GACLC,IAAWC,GAAA;AACjB,MAAIC;AACJ,GAAC,SAAUA,GAAmB;AAC1B,IAAAA,EAAkB,OAAO,OAAO,OAAO;AAAA,MACnC,yBAAyB;AAAA,MACzB,yBAAyBF,EAAS,MAAM;AAAA,IAChD,CAAK,GACDE,EAAkB,YAAY,OAAO,OAAO;AAAA,MACxC,yBAAyB;AAAA,MACzB,yBAAyBF,EAAS,MAAM;AAAA,IAChD,CAAK;AACD,aAAS5V,EAAG/8C,GAAO;AACf,YAAMs9C,IAAYt9C;AAClB,aAAOs9C,MAAcA,MAAcuV,EAAkB,QAC9CvV,MAAcuV,EAAkB,aAC/BtV,EAAG,QAAQD,EAAU,uBAAuB,KAAK,CAAC,CAACA,EAAU;AAAA,IAC7E;AACI,IAAAuV,EAAkB,KAAK9V;AAAA,EAC3B,GAAG8V,MAAsBJ,GAAA,oBAA4BI,IAAoB,CAAA,EAAG;AAC5E,QAAMC,IAAgB,OAAO,OAAO,SAAUvI,GAAUuH,GAAS;AAC7D,UAAMpb,QAAa+a,EAAM,WAAW,MAAM,WAAWlH,EAAS,KAAKuH,CAAO,GAAG,CAAC;AAC9E,WAAO,EAAE,UAAU;AAAE,MAAApb,EAAO,QAAO;AAAA,IAAG,EAAE;AAAA,EAC5C,CAAC;AAAA,EACD,MAAMqc,EAAa;AAAA,IACf,cAAc;AACV,WAAK,eAAe;AAAA,IAC5B;AAAA,IACI,SAAS;AACL,MAAK,KAAK,iBACN,KAAK,eAAe,IAChB,KAAK,aACL,KAAK,SAAS,KAAK,MAAS,GAC5B,KAAK,QAAO;AAAA,IAG5B;AAAA,IACI,IAAI,0BAA0B;AAC1B,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,IAAI,0BAA0B;AAC1B,aAAI,KAAK,eACED,KAEN,KAAK,aACN,KAAK,WAAW,IAAIH,EAAS,QAAO,IAEjC,KAAK,SAAS;AAAA,IAC7B;AAAA,IACI,UAAU;AACN,MAAI,KAAK,aACL,KAAK,SAAS,QAAO,GACrB,KAAK,WAAW;AAAA,IAE5B;AAAA,EACA;AAAA,EACA,MAAMK,EAAwB;AAAA,IAC1B,IAAI,QAAQ;AACR,aAAK,KAAK,WAGN,KAAK,SAAS,IAAID,EAAY,IAE3B,KAAK;AAAA,IACpB;AAAA,IACI,SAAS;AACL,MAAK,KAAK,SAON,KAAK,OAAO,OAAM,IAHlB,KAAK,SAASF,EAAkB;AAAA,IAK5C;AAAA,IACI,UAAU;AACN,MAAK,KAAK,SAID,KAAK,kBAAkBE,KAE5B,KAAK,OAAO,QAAO,IAJnB,KAAK,SAASF,EAAkB;AAAA,IAM5C;AAAA,EACA;AACA,SAAAJ,GAAA,0BAAkCO;;;ACrF3B,SAASC,KAAgB;AAC5B,SAAO,IAAI,QAAQ,CAAAC,MAAW;AAG1B,IAAI,OAAO,eAAiB,MACxB,WAAWA,GAAS,CAAC,IAGrB,aAAaA,CAAO;AAAA,EAE5B,CAAC;AACL;AACA,IAAIC,KAAW,GACXC,KAA2B;AAIxB,SAASC,KAA2B;AACvC,SAAAF,KAAW,YAAY,IAAG,GACnB,IAAIH,GAAAA,wBAAuB;AACtC;AAaO,MAAMM,KAAqB,uBAAO,oBAAoB;AAKtD,SAASC,GAAqBC,GAAK;AACtC,SAAOA,MAAQF;AACnB;AAYO,eAAeG,GAAkBtjD,GAAO;AAC3C,MAAIA,MAAU0iD,GAAAA,kBAAkB;AAE5B;AAEJ,QAAMrX,IAAU,YAAY,IAAG;AAS/B,MARIA,IAAU2X,MAAYC,OACtBD,KAAW3X,GACX,MAAMyX,GAAa,GAInBE,KAAW,YAAY,IAAG,IAE1BhjD,EAAM;AACN,UAAMmjD;AAEd;AAKO,MAAMI,GAAS;AAAA,EAClB,cAAc;AACV,SAAK,UAAU,IAAI,QAAQ,CAACR,GAAS9uD,MAAW;AAC5C,WAAK,UAAU,CAACsqD,OACZwE,EAAQxE,CAAG,GACJ,OAEX,KAAK,SAAS,CAAC8E,OACXpvD,EAAOovD,CAAG,GACH;AAAA,IAEf,CAAC;AAAA,EACL;AACJ;AC5FA,MAAMpM,GAAiB;AAAA,EACnB,YAAYtJ,GAAK0E,GAAYF,GAAS6E,GAAS;AAC3C,SAAK,OAAOrJ,GACZ,KAAK,cAAc0E,GACnB,KAAK,WAAWF,GAChB,KAAK,WAAW6E,GAChB,KAAK,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,QAAQz9C,GAAO;AACX,QAAIA,GAAO;AACP,YAAMjK,IAAQ,KAAK,SAASiK,EAAM,KAAK,GACjChK,IAAM,KAAK,SAASgK,EAAM,GAAG;AACnC,aAAO,KAAK,SAAS,UAAUjK,GAAOC,CAAG;AAAA,IAC7C;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAOi0D,GAASrR,GAAS;AACrB,eAAWhB,KAAUqS;AACjB,UAAIvM,GAAiB,cAAc9F,CAAM,GAAG;AAExC,cAAM53C,IAAQkqD,GAAmBtS,EAAO,KAAK,GAEvCtzB,IAAc,KAAK,SAAStkB,EAAM,KAAK,GACvCoqB,IAAY,KAAK,SAASpqB,EAAM,GAAG;AACzC,aAAK,WAAW,KAAK,SAAS,UAAU,GAAGskB,CAAW,IAAIszB,EAAO,OAAO,KAAK,SAAS,UAAUxtB,GAAW,KAAK,SAAS,MAAM;AAE/H,cAAMjB,IAAY,KAAK,IAAInpB,EAAM,MAAM,MAAM,CAAC,GACxCqqB,IAAU,KAAK,IAAIrqB,EAAM,IAAI,MAAM,CAAC;AAC1C,YAAIs+C,IAAc,KAAK;AACvB,cAAM6L,IAAmBC,GAAmBxS,EAAO,MAAM,IAAOtzB,CAAW;AAC3E,YAAI+F,IAAUlB,MAAcghC,EAAiB;AACzC,mBAAS/rD,IAAI,GAAG+jB,IAAMgoC,EAAiB,QAAQ/rD,IAAI+jB,GAAK/jB;AACpD,YAAAkgD,EAAYlgD,IAAI+qB,IAAY,CAAC,IAAIghC,EAAiB/rD,CAAC;AAAA;AAIvD,UAAI+rD,EAAiB,SAAS,MAC1B7L,EAAY,OAAOn1B,IAAY,GAAGkB,IAAUlB,GAAW,GAAGghC,CAAgB,IAG1E,KAAK,eAAe7L,IAAcA,EAAY,MAAM,GAAGn1B,IAAY,CAAC,EAAE,OAAOghC,GAAkB7L,EAAY,MAAMj0B,IAAU,CAAC,CAAC;AAGrI,cAAM0zB,IAAOnG,EAAO,KAAK,UAAUxtB,IAAY9F;AAC/C,YAAIy5B,MAAS;AACT,mBAAS3/C,IAAI+qB,IAAY,IAAIghC,EAAiB,QAAQhoC,IAAMm8B,EAAY,QAAQlgD,IAAI+jB,GAAK/jB;AACrF,YAAAkgD,EAAYlgD,CAAC,IAAIkgD,EAAYlgD,CAAC,IAAI2/C;AAAA,MAG9C,WACSL,GAAiB,OAAO9F,CAAM;AACnC,aAAK,WAAWA,EAAO,MACvB,KAAK,eAAe;AAAA;AAGpB,cAAM,IAAI,MAAM,+BAA+B;AAGvD,SAAK,WAAWgB;AAAA,EACpB;AAAA,EACA,iBAAiB;AACb,WAAI,KAAK,iBAAiB,WACtB,KAAK,eAAewR,GAAmB,KAAK,UAAU,EAAI,IAEvD,KAAK;AAAA,EAChB;AAAA,EACA,WAAWzjD,GAAQ;AACf,IAAAA,IAAS,KAAK,IAAI,KAAK,IAAIA,GAAQ,KAAK,SAAS,MAAM,GAAG,CAAC;AAC3D,UAAM23C,IAAc,KAAK,eAAc;AACvC,QAAIG,IAAM,GAAGC,IAAOJ,EAAY;AAChC,QAAII,MAAS;AACT,aAAO,EAAE,MAAM,GAAG,WAAW/3C,EAAM;AAEvC,WAAO83C,IAAMC,KAAM;AACf,YAAMC,IAAM,KAAK,OAAOF,IAAMC,KAAQ,CAAC;AACvC,MAAIJ,EAAYK,CAAG,IAAIh4C,IACnB+3C,IAAOC,IAGPF,IAAME,IAAM;AAAA,IAEpB;AAGA,UAAMp6B,IAAOk6B,IAAM;AACnB,WAAA93C,IAAS,KAAK,gBAAgBA,GAAQ23C,EAAY/5B,CAAI,CAAC,GAChD,EAAE,MAAAA,GAAM,WAAW5d,IAAS23C,EAAY/5B,CAAI,EAAC;AAAA,EACxD;AAAA,EACA,SAASmyB,GAAU;AACf,UAAM4H,IAAc,KAAK,eAAc;AACvC,QAAI5H,EAAS,QAAQ4H,EAAY;AAC7B,aAAO,KAAK,SAAS;AAEpB,QAAI5H,EAAS,OAAO;AACrB,aAAO;AAEX,UAAMkI,IAAaN,EAAY5H,EAAS,IAAI;AAC5C,QAAIA,EAAS,aAAa;AACtB,aAAOkI;AAEX,UAAMC,IAAkBnI,EAAS,OAAO,IAAI4H,EAAY,SAAUA,EAAY5H,EAAS,OAAO,CAAC,IAAI,KAAK,SAAS,QAC3G/vC,IAAS,KAAK,IAAIi4C,IAAalI,EAAS,WAAWmI,CAAc;AACvE,WAAO,KAAK,gBAAgBl4C,GAAQi4C,CAAU;AAAA,EAClD;AAAA,EACA,gBAAgBj4C,GAAQi4C,GAAY;AAChC,WAAOj4C,IAASi4C,KAAcyL,GAAM,KAAK,SAAS,WAAW1jD,IAAS,CAAC,CAAC;AACpE,MAAAA;AAEJ,WAAOA;AAAA,EACX;AAAA,EACA,IAAI,YAAY;AACZ,WAAO,KAAK,eAAc,EAAG;AAAA,EACjC;AAAA,EACA,OAAO,cAAc03C,GAAO;AACxB,UAAMzK,IAAYyK;AAClB,WAAkCzK,KAAc,QAC5C,OAAOA,EAAU,QAAS,YAAYA,EAAU,UAAU,WACzDA,EAAU,gBAAgB,UAAa,OAAOA,EAAU,eAAgB;AAAA,EACjF;AAAA,EACA,OAAO,OAAOyK,GAAO;AACjB,UAAMzK,IAAYyK;AAClB,WAAkCzK,KAAc,QAC5C,OAAOA,EAAU,QAAS,YAAYA,EAAU,UAAU,UAAaA,EAAU,gBAAgB;AAAA,EACzG;AACJ;AACO,IAAI4J;AAAA,CACV,SAAUA,GAAc;AASrB,WAAS9J,EAAOU,GAAK0E,GAAYF,GAAS6E,GAAS;AAC/C,WAAO,IAAIC,GAAiBtJ,GAAK0E,GAAYF,GAAS6E,CAAO;AAAA,EACjE;AACA,EAAAD,EAAa,SAAS9J;AAUtB,WAAS4W,EAAO1M,GAAUqM,GAASrR,GAAS;AACxC,QAAIgF,aAAoBF;AACpB,aAAAE,EAAS,OAAOqM,GAASrR,CAAO,GACzBgF;AAGP,UAAM,IAAI,MAAM,sEAAsE;AAAA,EAE9F;AACA,EAAAJ,EAAa,SAAS8M;AACtB,WAAS3M,EAAWC,GAAUxG,GAAO;AACjC,UAAMl1B,IAAO07B,EAAS,QAAO,GACvBC,IAAcC,GAAU1G,EAAM,IAAImT,EAAiB,GAAG,CAAC7b,GAAGvvC,MAAM;AAClE,YAAM4+C,IAAOrP,EAAE,MAAM,MAAM,OAAOvvC,EAAE,MAAM,MAAM;AAChD,aAAI4+C,MAAS,IACFrP,EAAE,MAAM,MAAM,YAAYvvC,EAAE,MAAM,MAAM,YAE5C4+C;AAAA,IACX,CAAC;AACD,QAAIC,IAAqB;AACzB,UAAMwM,IAAQ,CAAA;AACd,eAAW/rD,KAAKo/C,GAAa;AACzB,YAAMv5B,IAAcs5B,EAAS,SAASn/C,EAAE,MAAM,KAAK;AACnD,UAAI6lB,IAAc05B;AACd,cAAM,IAAI,MAAM,kBAAkB;AAEjC,MAAI15B,IAAc05B,KACnBwM,EAAM,KAAKtoC,EAAK,UAAU87B,GAAoB15B,CAAW,CAAC,GAE1D7lB,EAAE,QAAQ,UACV+rD,EAAM,KAAK/rD,EAAE,OAAO,GAExBu/C,IAAqBJ,EAAS,SAASn/C,EAAE,MAAM,GAAG;AAAA,IACtD;AACA,WAAA+rD,EAAM,KAAKtoC,EAAK,OAAO87B,CAAkB,CAAC,GACnCwM,EAAM,KAAK,EAAE;AAAA,EACxB;AACA,EAAAhN,EAAa,aAAaG;AAC9B,GAAGH,OAAiBA,KAAe,CAAA,EAAG;AACtC,SAASM,GAAUvC,GAAM0C,GAAS;AAC9B,MAAI1C,EAAK,UAAU;AAEf,WAAOA;AAEX,QAAM9I,IAAK8I,EAAK,SAAS,IAAK,GACxBnN,IAAOmN,EAAK,MAAM,GAAG9I,CAAC,GACtBpE,IAAQkN,EAAK,MAAM9I,CAAC;AAC1B,EAAAqL,GAAU1P,GAAM6P,CAAO,GACvBH,GAAUzP,GAAO4P,CAAO;AACxB,MAAIC,IAAU,GACVC,IAAW,GACX//C,IAAI;AACR,SAAO8/C,IAAU9P,EAAK,UAAU+P,IAAW9P,EAAM;AAE7C,IADY4P,EAAQ7P,EAAK8P,CAAO,GAAG7P,EAAM8P,CAAQ,CAAC,KACvC,IAEP5C,EAAKn9C,GAAG,IAAIgwC,EAAK8P,GAAS,IAI1B3C,EAAKn9C,GAAG,IAAIiwC,EAAM8P,GAAU;AAGpC,SAAOD,IAAU9P,EAAK;AAClB,IAAAmN,EAAKn9C,GAAG,IAAIgwC,EAAK8P,GAAS;AAE9B,SAAOC,IAAW9P,EAAM;AACpB,IAAAkN,EAAKn9C,GAAG,IAAIiwC,EAAM8P,GAAU;AAEhC,SAAO5C;AACX;AACA,SAAS6O,GAAmBloC,GAAMuoC,GAAeC,IAAa,GAAG;AAC7D,QAAMv0D,IAASs0D,IAAgB,CAACC,CAAU,IAAI,CAAA;AAC9C,WAAS,IAAI,GAAG,IAAIxoC,EAAK,QAAQ,KAAK;AAClC,UAAMs8B,IAAKt8B,EAAK,WAAW,CAAC;AAC5B,IAAImoC,GAAM7L,CAAE,MACJA,MAAO,MAAoC,IAAI,IAAIt8B,EAAK,UAAUA,EAAK,WAAW,IAAI,CAAC,MAAM,MAC7F,KAEJ/rB,EAAO,KAAKu0D,IAAa,IAAI,CAAC;AAAA,EAEtC;AACA,SAAOv0D;AACX;AACA,SAASk0D,GAAMtiD,GAAM;AACjB,SAAOA,MAAS,MAAoCA,MAAS;AACjE;AACA,SAASmiD,GAAmBlqD,GAAO;AAC/B,QAAMjK,IAAQiK,EAAM,OACdhK,IAAMgK,EAAM;AAClB,SAAIjK,EAAM,OAAOC,EAAI,QAASD,EAAM,SAASC,EAAI,QAAQD,EAAM,YAAYC,EAAI,YACpE,EAAE,OAAOA,GAAK,KAAKD,EAAK,IAE5BiK;AACX;AACA,SAASuqD,GAAkBpV,GAAU;AACjC,QAAMn1C,IAAQkqD,GAAmB/U,EAAS,KAAK;AAC/C,SAAIn1C,MAAUm1C,EAAS,QACZ,EAAE,SAASA,EAAS,SAAS,OAAAn1C,EAAK,IAEtCm1C;AACX;ACvQA,IAAIwV;AAAA,CAAK,MAAI;AAAc,MAAI,IAAE,EAAC,KAAI,CAAAh5B,MAAG;AAAC,aAASlzB,EAAEkzB,GAAE;AAAC,UAAa,OAAOA,KAAjB,SAAmB,OAAM,IAAI,UAAU,qCAAmC,KAAK,UAAUA,CAAC,CAAC;AAAA,IAAC;AAAC,aAASi5B,EAAEj5B,GAAElzB,GAAE;AAAC,eAAQmsD,GAAEvyD,IAAE,IAAG+F,IAAE,GAAEysD,IAAE,IAAG1uD,IAAE,GAAE2uD,IAAE,GAAEA,KAAGn5B,EAAE,QAAO,EAAEm5B,GAAE;AAAC,YAAGA,IAAEn5B,EAAE,OAAO,CAAAi5B,IAAEj5B,EAAE,WAAWm5B,CAAC;AAAA,aAAM;AAAC,cAAQF,MAAL,GAAO;AAAM,UAAAA,IAAE;AAAA,QAAE;AAAC,YAAQA,MAAL,IAAO;AAAC,cAAG,EAAAC,MAAIC,IAAE,KAAO3uD,MAAJ,GAAY,KAAG0uD,MAAIC,IAAE,KAAO3uD,MAAJ,GAAM;AAAC,gBAAG9D,EAAE,SAAO,KAAO+F,MAAJ,KAAY/F,EAAE,WAAWA,EAAE,SAAO,CAAC,MAA5B,MAAoCA,EAAE,WAAWA,EAAE,SAAO,CAAC,MAA5B;AAA8B,kBAAGA,EAAE,SAAO,GAAE;AAAC,oBAAIq2C,KAAEr2C,EAAE,YAAY,GAAG;AAAE,oBAAGq2C,OAAIr2C,EAAE,SAAO,GAAE;AAAC,kBAAKq2C,OAAL,MAAQr2C,IAAE,IAAG+F,IAAE,KAAGA,KAAG/F,IAAEA,EAAE,MAAM,GAAEq2C,EAAC,GAAG,SAAO,IAAEr2C,EAAE,YAAY,GAAG,GAAEwyD,IAAEC,GAAE3uD,IAAE;AAAE;AAAA,gBAAQ;AAAA,cAAC,WAAa9D,EAAE,WAAN,KAAkBA,EAAE,WAAN,GAAa;AAAC,gBAAAA,IAAE,IAAG+F,IAAE,GAAEysD,IAAEC,GAAE3uD,IAAE;AAAE;AAAA,cAAQ;AAAA;AAAC,YAAAsC,MAAIpG,EAAE,SAAO,IAAEA,KAAG,QAAMA,IAAE,MAAK+F,IAAE;AAAA,UAAE,MAAM,CAAA/F,EAAE,SAAO,IAAEA,KAAG,MAAIs5B,EAAE,MAAMk5B,IAAE,GAAEC,CAAC,IAAEzyD,IAAEs5B,EAAE,MAAMk5B,IAAE,GAAEC,CAAC,GAAE1sD,IAAE0sD,IAAED,IAAE;AAAE,UAAAA,IAAEC,GAAE3uD,IAAE;AAAA,QAAC,MAAM,CAAKyuD,MAAL,MAAazuD,MAAL,KAAO,EAAEA,IAAEA,IAAE;AAAA,MAAE;AAAC,aAAO9D;AAAA,IAAC;AAAC,QAAIA,IAAE,EAAC,SAAQ,WAAU;AAAC,eAAQs5B,GAAEt5B,IAAE,IAAG+F,IAAE,IAAGysD,IAAE,UAAU,SAAO,GAAEA,KAAG,MAAI,CAACzsD,GAAEysD,KAAI;AAAC,YAAI1uD;AAAE,QAAA0uD,KAAG,IAAE1uD,IAAE,UAAU0uD,CAAC,KAAYl5B,MAAT,WAAaA,IAAE,QAAQ,IAAG,IAAIx1B,IAAEw1B,IAAGlzB,EAAEtC,CAAC,GAAMA,EAAE,WAAN,MAAe9D,IAAE8D,IAAE,MAAI9D,GAAE+F,IAAOjC,EAAE,WAAW,CAAC,MAAnB;AAAA,MAAqB;AAAC,aAAO9D,IAAEuyD,EAAEvyD,GAAE,CAAC+F,CAAC,GAAEA,IAAE/F,EAAE,SAAO,IAAE,MAAIA,IAAE,MAAIA,EAAE,SAAO,IAAEA,IAAE;AAAA,IAAG,GAAE,WAAU,SAASs5B,GAAE;AAAC,UAAGlzB,EAAEkzB,CAAC,GAAMA,EAAE,WAAN,EAAa,QAAM;AAAI,UAAIt5B,IAAOs5B,EAAE,WAAW,CAAC,MAAnB,IAAqBvzB,IAAOuzB,EAAE,WAAWA,EAAE,SAAO,CAAC,MAA5B;AAA8B,cAAYA,IAAEi5B,EAAEj5B,GAAE,CAACt5B,CAAC,GAAG,WAAhB,KAAwBA,MAAIs5B,IAAE,MAAKA,EAAE,SAAO,KAAGvzB,MAAIuzB,KAAG,MAAKt5B,IAAE,MAAIs5B,IAAEA;AAAA,IAAC,GAAE,YAAW,SAASA,GAAE;AAAC,aAAOlzB,EAAEkzB,CAAC,GAAEA,EAAE,SAAO,KAAQA,EAAE,WAAW,CAAC,MAAnB;AAAA,IAAoB,GAAE,MAAK,WAAU;AAAC,UAAO,UAAU,WAAd,EAAqB,QAAM;AAAI,eAAQA,GAAEi5B,IAAE,GAAEA,IAAE,UAAU,QAAO,EAAEA,GAAE;AAAC,YAAIxsD,IAAE,UAAUwsD,CAAC;AAAE,QAAAnsD,EAAEL,CAAC,GAAEA,EAAE,SAAO,MAAauzB,MAAT,SAAWA,IAAEvzB,IAAEuzB,KAAG,MAAIvzB;AAAA,MAAE;AAAC,aAAgBuzB,MAAT,SAAW,MAAIt5B,EAAE,UAAUs5B,CAAC;AAAA,IAAC,GAAE,UAAS,SAASA,GAAEi5B,GAAE;AAA6B,UAAzBnsD,EAAEkzB,CAAC,GAAElzB,EAAEmsD,CAAC,GAAEj5B,MAAIi5B,MAAej5B,IAAEt5B,EAAE,QAAQs5B,CAAC,QAAMi5B,IAAEvyD,EAAE,QAAQuyD,CAAC,GAAG,QAAM;AAAG,eAAQxsD,IAAE,GAAEA,IAAEuzB,EAAE,UAAaA,EAAE,WAAWvzB,CAAC,MAAnB,IAAqB,EAAEA,EAAE;AAAC,eAAQysD,IAAEl5B,EAAE,QAAOx1B,IAAE0uD,IAAEzsD,GAAE0sD,IAAE,GAAEA,IAAEF,EAAE,UAAaA,EAAE,WAAWE,CAAC,MAAnB,IAAqB,EAAEA,EAAE;AAAC,eAAQpc,IAAEkc,EAAE,SAAOE,GAAE1oC,IAAEjmB,IAAEuyC,IAAEvyC,IAAEuyC,GAAEqc,KAAE,IAAGC,IAAE,GAAEA,KAAG5oC,GAAE,EAAE4oC,GAAE;AAAC,YAAGA,MAAI5oC,GAAE;AAAC,cAAGssB,IAAEtsB,GAAE;AAAC,gBAAQwoC,EAAE,WAAWE,IAAEE,CAAC,MAArB,GAAuB,QAAOJ,EAAE,MAAME,IAAEE,IAAE,CAAC;AAAE,gBAAOA,MAAJ,EAAM,QAAOJ,EAAE,MAAME,IAAEE,CAAC;AAAA,UAAC,MAAM,CAAA7uD,IAAEimB,MAASuP,EAAE,WAAWvzB,IAAE4sD,CAAC,MAArB,KAAuBD,KAAEC,IAAMA,MAAJ,MAAQD,KAAE;AAAI;AAAA,QAAK;AAAC,YAAIE,KAAEt5B,EAAE,WAAWvzB,IAAE4sD,CAAC;AAAE,YAAGC,OAAIL,EAAE,WAAWE,IAAEE,CAAC,EAAE;AAAM,QAAKC,OAAL,OAASF,KAAEC;AAAA,MAAE;AAAC,UAAInb,KAAE;AAAG,WAAImb,IAAE5sD,IAAE2sD,KAAE,GAAEC,KAAGH,GAAE,EAAEG,EAAE,CAAAA,MAAIH,KAAQl5B,EAAE,WAAWq5B,CAAC,MAAnB,OAA2Bnb,GAAE,WAAN,IAAaA,MAAG,OAAKA,MAAG;AAAO,aAAOA,GAAE,SAAO,IAAEA,KAAE+a,EAAE,MAAME,IAAEC,EAAC,KAAGD,KAAGC,IAAOH,EAAE,WAAWE,CAAC,MAAnB,MAAsB,EAAEA,GAAEF,EAAE,MAAME,CAAC;AAAA,IAAE,GAAE,WAAU,SAASn5B,GAAE;AAAC,aAAOA;AAAA,IAAC,GAAE,SAAQ,SAASA,GAAE;AAAC,UAAGlzB,EAAEkzB,CAAC,GAAMA,EAAE,WAAN,EAAa,QAAM;AAAI,eAAQi5B,IAAEj5B,EAAE,WAAW,CAAC,GAAEt5B,IAAOuyD,MAAL,IAAOxsD,IAAE,IAAGysD,IAAE,IAAG1uD,IAAEw1B,EAAE,SAAO,GAAEx1B,KAAG,GAAE,EAAEA,EAAE,MAASyuD,IAAEj5B,EAAE,WAAWx1B,CAAC,OAAtB;AAA0B,YAAG,CAAC0uD,GAAE;AAAC,UAAAzsD,IAAEjC;AAAE;AAAA,QAAK;AAAA,YAAO,CAAA0uD,IAAE;AAAG,aAAWzsD,WAAE/F,IAAE,MAAI,MAAIA,KAAO+F,MAAJ,IAAM,OAAKuzB,EAAE,MAAM,GAAEvzB,CAAC;AAAA,IAAC,GAAE,UAAS,SAASuzB,GAAEi5B,GAAE;AAAC,UAAYA,MAAT,UAAsB,OAAOA,KAAjB,SAAmB,OAAM,IAAI,UAAU,iCAAiC;AAAE,MAAAnsD,EAAEkzB,CAAC;AAAE,UAAIt5B,GAAE+F,IAAE,GAAEysD,IAAE,IAAG1uD,IAAE;AAAG,UAAYyuD,MAAT,UAAYA,EAAE,SAAO,KAAGA,EAAE,UAAQj5B,EAAE,QAAO;AAAC,YAAGi5B,EAAE,WAASj5B,EAAE,UAAQi5B,MAAIj5B,EAAE,QAAM;AAAG,YAAIm5B,IAAEF,EAAE,SAAO,GAAElc,IAAE;AAAG,aAAIr2C,IAAEs5B,EAAE,SAAO,GAAEt5B,KAAG,GAAE,EAAEA,GAAE;AAAC,cAAI+pB,KAAEuP,EAAE,WAAWt5B,CAAC;AAAE,cAAQ+pB,OAAL;AAAQ,gBAAG,CAACjmB,GAAE;AAAC,cAAAiC,IAAE/F,IAAE;AAAE;AAAA,YAAK;AAAA,gBAAM,CAAKq2C,MAAL,OAASvyC,IAAE,IAAGuyC,IAAEr2C,IAAE,IAAGyyD,KAAG,MAAI1oC,OAAIwoC,EAAE,WAAWE,CAAC,IAAM,EAAEA,KAAN,OAAUD,IAAExyD,MAAIyyD,IAAE,IAAGD,IAAEnc;AAAA,QAAG;AAAC,eAAOtwC,MAAIysD,IAAEA,IAAEnc,IAAOmc,MAAL,OAASA,IAAEl5B,EAAE,SAAQA,EAAE,MAAMvzB,GAAEysD,CAAC;AAAA,MAAC;AAAC,WAAIxyD,IAAEs5B,EAAE,SAAO,GAAEt5B,KAAG,GAAE,EAAEA,EAAE,KAAQs5B,EAAE,WAAWt5B,CAAC,MAAnB;AAAsB,YAAG,CAAC8D,GAAE;AAAC,UAAAiC,IAAE/F,IAAE;AAAE;AAAA,QAAK;AAAA,YAAM,CAAKwyD,MAAL,OAAS1uD,IAAE,IAAG0uD,IAAExyD,IAAE;AAAG,aAAWwyD,WAAE,KAAGl5B,EAAE,MAAMvzB,GAAEysD,CAAC;AAAA,IAAC,GAAE,SAAQ,SAASl5B,GAAE;AAAC,MAAAlzB,EAAEkzB,CAAC;AAAE,eAAQi5B,IAAE,IAAGvyD,IAAE,GAAE+F,IAAE,IAAGysD,IAAE,IAAG1uD,IAAE,GAAE2uD,IAAEn5B,EAAE,SAAO,GAAEm5B,KAAG,GAAE,EAAEA,GAAE;AAAC,YAAIpc,IAAE/c,EAAE,WAAWm5B,CAAC;AAAE,YAAQpc,MAAL,GAAO,CAAKtwC,MAAL,OAASysD,IAAE,IAAGzsD,IAAE0sD,IAAE,IAAQpc,MAAL,KAAYkc,MAAL,KAAOA,IAAEE,IAAM3uD,MAAJ,MAAQA,IAAE,KAAQyuD,MAAL,OAASzuD,IAAE;AAAA,iBAAY,CAAC0uD,GAAE;AAAC,UAAAxyD,IAAEyyD,IAAE;AAAE;AAAA,QAAK;AAAA,MAAC;AAAC,aAAWF,MAAL,MAAaxsD,MAAL,MAAYjC,MAAJ,KAAWA,MAAJ,KAAOyuD,MAAIxsD,IAAE,KAAGwsD,MAAIvyD,IAAE,IAAE,KAAGs5B,EAAE,MAAMi5B,GAAExsD,CAAC;AAAA,IAAC,GAAE,QAAO,SAASuzB,GAAE;AAAC,UAAUA,MAAP,QAAoB,OAAOA,KAAjB,SAAmB,OAAM,IAAI,UAAU,qEAAmE,OAAOA,CAAC;AAAE,cAAO,SAASA,GAAElzB,GAAE;AAAC,YAAImsD,IAAEnsD,EAAE,OAAKA,EAAE,MAAKpG,IAAEoG,EAAE,SAAOA,EAAE,QAAM,OAAKA,EAAE,OAAK;AAAI,eAAOmsD,IAAEA,MAAInsD,EAAE,OAAKmsD,IAAEvyD,IAAEuyD,IAAE,MAAIvyD,IAAEA;AAAA,MAAC,GAAE,GAAEs5B,CAAC;AAAA,IAAC,GAAE,OAAM,SAASA,GAAE;AAAC,MAAAlzB,EAAEkzB,CAAC;AAAE,UAAIi5B,IAAE,EAAC,MAAK,IAAG,KAAI,IAAG,MAAK,IAAG,KAAI,IAAG,MAAK,GAAE;AAAE,UAAOj5B,EAAE,WAAN,EAAa,QAAOi5B;AAAE,UAAIvyD,GAAE+F,IAAEuzB,EAAE,WAAW,CAAC,GAAEk5B,IAAOzsD,MAAL;AAAO,MAAAysD,KAAGD,EAAE,OAAK,KAAIvyD,IAAE,KAAGA,IAAE;AAAE,eAAQ8D,IAAE,IAAG2uD,IAAE,GAAEpc,IAAE,IAAGtsB,KAAE,IAAG2oC,IAAEp5B,EAAE,SAAO,GAAEq5B,KAAE,GAAED,KAAG1yD,GAAE,EAAE0yD,EAAE,MAAS3sD,IAAEuzB,EAAE,WAAWo5B,CAAC,OAAtB,GAAyB,CAAKrc,MAAL,OAAStsB,KAAE,IAAGssB,IAAEqc,IAAE,IAAQ3sD,MAAL,KAAYjC,MAAL,KAAOA,IAAE4uD,IAAMC,OAAJ,MAAQA,KAAE,KAAQ7uD,MAAL,OAAS6uD,KAAE;AAAA,eAAY,CAAC5oC,IAAE;AAAC,QAAA0oC,IAAEC,IAAE;AAAE;AAAA,MAAK;AAAC,aAAW5uD,MAAL,MAAauyC,MAAL,MAAYsc,OAAJ,KAAWA,OAAJ,KAAO7uD,MAAIuyC,IAAE,KAAGvyC,MAAI2uD,IAAE,IAAOpc,MAAL,OAASkc,EAAE,OAAKA,EAAE,OAASE,MAAJ,KAAOD,IAAEl5B,EAAE,MAAM,GAAE+c,CAAC,IAAE/c,EAAE,MAAMm5B,GAAEpc,CAAC,MAAQoc,MAAJ,KAAOD,KAAGD,EAAE,OAAKj5B,EAAE,MAAM,GAAEx1B,CAAC,GAAEyuD,EAAE,OAAKj5B,EAAE,MAAM,GAAE+c,CAAC,MAAIkc,EAAE,OAAKj5B,EAAE,MAAMm5B,GAAE3uD,CAAC,GAAEyuD,EAAE,OAAKj5B,EAAE,MAAMm5B,GAAEpc,CAAC,IAAGkc,EAAE,MAAIj5B,EAAE,MAAMx1B,GAAEuyC,CAAC,IAAGoc,IAAE,IAAEF,EAAE,MAAIj5B,EAAE,MAAM,GAAEm5B,IAAE,CAAC,IAAED,MAAID,EAAE,MAAI,MAAKA;AAAA,IAAC,GAAE,KAAI,KAAI,WAAU,KAAI,OAAM,MAAK,OAAM,KAAI;AAAE,IAAAvyD,EAAE,QAAMA,GAAEs5B,EAAE,UAAQt5B;AAAA,EAAC,EAAC,GAAE,IAAE,CAAA;AAAG,WAASuyD,EAAEvyD,GAAE;AAAC,QAAI+F,IAAE,EAAE/F,CAAC;AAAE,QAAY+F,MAAT,OAAW,QAAOA,EAAE;AAAQ,QAAIysD,IAAE,EAAExyD,CAAC,IAAE,EAAC,SAAQ,GAAE;AAAE,WAAO,EAAEA,CAAC,EAAEwyD,GAAEA,EAAE,SAAQD,CAAC,GAAEC,EAAE;AAAA,EAAO;AAAC,EAAAD,EAAE,IAAE,CAACj5B,GAAElzB,MAAI;AAAC,aAAQpG,KAAKoG,EAAE,CAAAmsD,EAAE,EAAEnsD,GAAEpG,CAAC,KAAG,CAACuyD,EAAE,EAAEj5B,GAAEt5B,CAAC,KAAG,OAAO,eAAes5B,GAAEt5B,GAAE,EAAC,YAAW,IAAG,KAAIoG,EAAEpG,CAAC,EAAC,CAAC;AAAA,EAAC,GAAEuyD,EAAE,IAAE,CAACj5B,GAAElzB,MAAI,OAAO,UAAU,eAAe,KAAKkzB,GAAElzB,CAAC,GAAEmsD,EAAE,IAAE,CAAAj5B,MAAG;AAAC,IAAa,OAAO,SAApB,OAA4B,OAAO,eAAa,OAAO,eAAeA,GAAE,OAAO,aAAY,EAAC,OAAM,SAAQ,CAAC,GAAE,OAAO,eAAeA,GAAE,cAAa,EAAC,OAAM,GAAE,CAAC;AAAA,EAAC;AAAE,MAAIt5B,IAAE,CAAA;AAAG,MAAI;AAAE,EAAGuyD,EAAE,EAAEvyD,CAAC,GAAEuyD,EAAE,EAAEvyD,GAAE,EAAC,KAAI,MAAI4yD,GAAE,OAAM,MAAIC,GAAC,CAAC,GAAY,OAAO,WAAjB,WAAyB,IAAY,QAAQ,aAAlB,UAA6C,OAAO,aAAjB,aAAsD,IAApB,UAAU,UAAc,QAAQ,SAAS,KAAG;AAAE,QAAML,IAAE,kBAAiB1uD,IAAE,OAAM2uD,IAAE;AAAQ,WAASpc,EAAE/c,GAAElzB,GAAE;AAAC,QAAG,CAACkzB,EAAE,UAAQlzB,EAAE,OAAM,IAAI,MAAM,2DAA2DkzB,EAAE,SAAS,aAAaA,EAAE,IAAI,cAAcA,EAAE,KAAK,iBAAiBA,EAAE,QAAQ,IAAI;AAAE,QAAGA,EAAE,UAAQ,CAACk5B,EAAE,KAAKl5B,EAAE,MAAM,EAAE,OAAM,IAAI,MAAM,iDAAiD;AAAE,QAAGA,EAAE;AAAK,UAAGA,EAAE;AAAW,YAAG,CAACx1B,EAAE,KAAKw1B,EAAE,IAAI,EAAE,OAAM,IAAI,MAAM,0IAA0I;AAAA,iBAAUm5B,EAAE,KAAKn5B,EAAE,IAAI,EAAE,OAAM,IAAI,MAAM,2HAA2H;AAAA;AAAA,EAAC;AAAC,QAAMvP,IAAE,IAAG2oC,IAAE,KAAIC,IAAE;AAAA,EAA+D,MAAMC,EAAC;AAAA,IAA+S,YAAYt5B,GAAElzB,GAAEmsD,GAAEvyD,GAAE+F,GAAEysD,IAAE,IAAG;AAAhE,MAAAM,GAAA;AAAO,MAAAA,GAAA;AAAU,MAAAA,GAAA;AAAK,MAAAA,GAAA;AAAM,MAAAA,GAAA;AAAqC,MAAU,OAAOx5B,KAAjB,YAAoB,KAAK,SAAOA,EAAE,UAAQvP,GAAE,KAAK,YAAUuP,EAAE,aAAWvP,GAAE,KAAK,OAAKuP,EAAE,QAAMvP,GAAE,KAAK,QAAMuP,EAAE,SAAOvP,GAAE,KAAK,WAASuP,EAAE,YAAUvP,MAAI,KAAK,SAAO,0BAASuP,GAAElzB,GAAE;AAAC,eAAOkzB,KAAGlzB,IAAEkzB,IAAE;AAAA,MAAM,GAAEA,GAAEk5B,CAAC,GAAE,KAAK,YAAUpsD,KAAG2jB,GAAE,KAAK,QAAK,SAASuP,GAAElzB,GAAE;AAAC,gBAAOkzB,GAAC;AAAA,UAAE,KAAI;AAAA,UAAQ,KAAI;AAAA,UAAO,KAAI;AAAO,YAAAlzB,IAAEA,EAAE,CAAC,MAAIssD,MAAItsD,IAAEssD,IAAEtsD,KAAGA,IAAEssD;AAAA,QAAC;AAAC,eAAOtsD;AAAA,MAAC,GAAE,KAAK,QAAOmsD,KAAGxoC,CAAC,GAAE,KAAK,QAAM/pB,KAAG+pB,GAAE,KAAK,WAAShkB,KAAGgkB,GAAEssB,EAAE,MAAKmc,CAAC;AAAA,IAAE;AAAA,IAA1sB,OAAO,MAAMl5B,GAAE;AAAC,aAAOA,aAAas5B,KAAG,CAAC,CAACt5B,KAAa,OAAOA,EAAE,aAAnB,YAAwC,OAAOA,EAAE,YAAnB,YAAuC,OAAOA,EAAE,QAAnB,YAAmC,OAAOA,EAAE,SAAnB,YAAoC,OAAOA,EAAE,UAAnB,YAAqC,OAAOA,EAAE,UAAnB,YAAuC,OAAOA,EAAE,QAArB,cAAuC,OAAOA,EAAE,YAArB;AAAA,IAA6B;AAAA,IAAmc,IAAI,SAAQ;AAAC,aAAOnf,EAAE,IAAO;AAAA,IAAC;AAAA,IAAC,KAAKmf,GAAE;AAAC,UAAG,CAACA,EAAE,QAAO;AAAK,UAAG,EAAC,QAAOlzB,GAAE,WAAUmsD,GAAE,MAAKvyD,GAAE,OAAM+F,GAAE,UAASysD,EAAC,IAAEl5B;AAAE,aAAgBlzB,MAAT,SAAWA,IAAE,KAAK,SAAcA,MAAP,SAAWA,IAAE2jB,IAAYwoC,MAAT,SAAWA,IAAE,KAAK,YAAiBA,MAAP,SAAWA,IAAExoC,IAAY/pB,MAAT,SAAWA,IAAE,KAAK,OAAYA,MAAP,SAAWA,IAAE+pB,IAAYhkB,MAAT,SAAWA,IAAE,KAAK,QAAaA,MAAP,SAAWA,IAAEgkB,IAAYyoC,MAAT,SAAWA,IAAE,KAAK,WAAgBA,MAAP,SAAWA,IAAEzoC,IAAG3jB,MAAI,KAAK,UAAQmsD,MAAI,KAAK,aAAWvyD,MAAI,KAAK,QAAM+F,MAAI,KAAK,SAAOysD,MAAI,KAAK,WAAS,OAAK,IAAI/Z,EAAEryC,GAAEmsD,GAAEvyD,GAAE+F,GAAEysD,CAAC;AAAA,IAAC;AAAA,IAAC,OAAO,MAAMl5B,GAAElzB,IAAE,IAAG;AAAC,YAAMmsD,IAAEI,EAAE,KAAKr5B,CAAC;AAAE,aAAOi5B,IAAE,IAAI9Z,EAAE8Z,EAAE,CAAC,KAAGxoC,GAAEgpC,EAAER,EAAE,CAAC,KAAGxoC,CAAC,GAAEgpC,EAAER,EAAE,CAAC,KAAGxoC,CAAC,GAAEgpC,EAAER,EAAE,CAAC,KAAGxoC,CAAC,GAAEgpC,EAAER,EAAE,CAAC,KAAGxoC,CAAC,GAAE3jB,CAAC,IAAE,IAAIqyC,EAAE1uB,GAAEA,GAAEA,GAAEA,GAAEA,CAAC;AAAA,IAAC;AAAA,IAAC,OAAO,KAAKuP,GAAE;AAAC,UAAIlzB,IAAE2jB;AAAE,UAAG,MAAIuP,IAAEA,EAAE,QAAQ,OAAMo5B,CAAC,IAAGp5B,EAAE,CAAC,MAAIo5B,KAAGp5B,EAAE,CAAC,MAAIo5B,GAAE;AAAC,cAAMH,IAAEj5B,EAAE,QAAQo5B,GAAE,CAAC;AAAE,QAAKH,MAAL,MAAQnsD,IAAEkzB,EAAE,UAAU,CAAC,GAAEA,IAAEo5B,MAAItsD,IAAEkzB,EAAE,UAAU,GAAEi5B,CAAC,GAAEj5B,IAAEA,EAAE,UAAUi5B,CAAC,KAAGG;AAAA,MAAE;AAAC,aAAO,IAAIja,EAAE,QAAOryC,GAAEkzB,GAAEvP,GAAEA,CAAC;AAAA,IAAC;AAAA,IAAC,OAAO,KAAKuP,GAAE;AAAC,YAAMlzB,IAAE,IAAIqyC,EAAEnf,EAAE,QAAOA,EAAE,WAAUA,EAAE,MAAKA,EAAE,OAAMA,EAAE,QAAQ;AAAE,aAAO+c,EAAEjwC,GAAE,EAAE,GAAEA;AAAA,IAAC;AAAA,IAAC,SAASkzB,IAAE,IAAG;AAAC,aAAOxyB,EAAE,MAAKwyB,CAAC;AAAA,IAAC;AAAA,IAAC,SAAQ;AAAC,aAAO;AAAA,IAAI;AAAA,IAAC,OAAO,OAAOA,GAAE;AAAC,UAAGA,GAAE;AAAC,YAAGA,aAAas5B,EAAE,QAAOt5B;AAAE;AAAC,gBAAMlzB,IAAE,IAAIqyC,EAAEnf,CAAC;AAAE,iBAAOlzB,EAAE,aAAWkzB,EAAE,UAASlzB,EAAE,UAAQkzB,EAAE,SAAOke,IAAEle,EAAE,SAAO,MAAKlzB;AAAA,QAAC;AAAA,MAAC;AAAC,aAAOkzB;AAAA,IAAC;AAAA,EAAC;AAAC,QAAMke,IAAE,IAAE,IAAE;AAAA,EAAO,MAAMiB,UAAUma,EAAC;AAAA,IAAjB;AAAA;AAAkB,MAAAE,GAAA,oBAAW;AAAK,MAAAA,GAAA,iBAAQ;AAAA;AAAA,IAAK,IAAI,SAAQ;AAAC,aAAO,KAAK,YAAU,KAAK,UAAQ34C,EAAE,IAAO,IAAG,KAAK;AAAA,IAAO;AAAA,IAAC,SAASmf,IAAE,IAAG;AAAC,aAAOA,IAAExyB,EAAE,MAAK,EAAE,KAAG,KAAK,eAAa,KAAK,aAAWA,EAAE,MAAK,EAAE,IAAG,KAAK;AAAA,IAAW;AAAA,IAAC,SAAQ;AAAC,YAAMwyB,IAAE,EAAC,MAAK,EAAC;AAAE,aAAO,KAAK,YAAUA,EAAE,SAAO,KAAK,SAAQA,EAAE,OAAKke,IAAG,KAAK,eAAale,EAAE,WAAS,KAAK,aAAY,KAAK,SAAOA,EAAE,OAAK,KAAK,OAAM,KAAK,WAASA,EAAE,SAAO,KAAK,SAAQ,KAAK,cAAYA,EAAE,YAAU,KAAK,YAAW,KAAK,UAAQA,EAAE,QAAM,KAAK,QAAO,KAAK,aAAWA,EAAE,WAAS,KAAK,WAAUA;AAAA,IAAC;AAAA,EAAC;AAAC,QAAM8gB,IAAE,EAAC,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,OAAM,IAAG,MAAK;AAAE,WAAS4Y,EAAE15B,GAAElzB,GAAEmsD,GAAE;AAAC,QAAIvyD,GAAE+F,IAAE;AAAG,aAAQysD,IAAE,GAAEA,IAAEl5B,EAAE,QAAOk5B,KAAI;AAAC,YAAM1uD,IAAEw1B,EAAE,WAAWk5B,CAAC;AAAE,UAAG1uD,KAAG,MAAIA,KAAG,OAAKA,KAAG,MAAIA,KAAG,MAAIA,KAAG,MAAIA,KAAG,MAASA,MAAL,MAAaA,MAAL,MAAaA,MAAL,MAAcA,MAAN,OAASsC,KAAQtC,MAAL,MAAQyuD,KAAQzuD,MAAL,MAAQyuD,KAAQzuD,MAAL,MAAQyuD,KAAQzuD,MAAL,IAAYiC,aAAI/F,KAAG,mBAAmBs5B,EAAE,UAAUvzB,GAAEysD,CAAC,CAAC,GAAEzsD,IAAE,KAAa/F,MAAT,WAAaA,KAAGs5B,EAAE,OAAOk5B,CAAC;AAAA,WAAO;AAAC,QAASxyD,MAAT,WAAaA,IAAEs5B,EAAE,OAAO,GAAEk5B,CAAC;AAAG,cAAMpsD,IAAEg0C,EAAEt2C,CAAC;AAAE,QAASsC,MAAT,UAAiBL,MAAL,OAAS/F,KAAG,mBAAmBs5B,EAAE,UAAUvzB,GAAEysD,CAAC,CAAC,GAAEzsD,IAAE,KAAI/F,KAAGoG,KAAQL,MAAL,OAASA,IAAEysD;AAAA,MAAE;AAAA,IAAC;AAAC,WAAWzsD,MAAL,OAAS/F,KAAG,mBAAmBs5B,EAAE,UAAUvzB,CAAC,CAAC,IAAY/F,MAAT,SAAWA,IAAEs5B;AAAA,EAAC;AAAC,WAAS25B,EAAE35B,GAAE;AAAC,QAAIlzB;AAAE,aAAQmsD,IAAE,GAAEA,IAAEj5B,EAAE,QAAOi5B,KAAI;AAAC,YAAMvyD,IAAEs5B,EAAE,WAAWi5B,CAAC;AAAE,MAAKvyD,MAAL,MAAaA,MAAL,MAAiBoG,MAAT,WAAaA,IAAEkzB,EAAE,OAAO,GAAEi5B,CAAC,IAAGnsD,KAAGg0C,EAAEp6C,CAAC,KAAYoG,MAAT,WAAaA,KAAGkzB,EAAEi5B,CAAC;AAAA,IAAE;AAAC,WAAgBnsD,MAAT,SAAWA,IAAEkzB;AAAA,EAAC;AAAC,WAASnf,EAAEmf,GAAElzB,GAAE;AAAC,QAAImsD;AAAE,WAAOA,IAAEj5B,EAAE,aAAWA,EAAE,KAAK,SAAO,KAAYA,EAAE,WAAX,SAAkB,KAAKA,EAAE,SAAS,GAAGA,EAAE,IAAI,KAAQA,EAAE,KAAK,WAAW,CAAC,MAAxB,OAA4BA,EAAE,KAAK,WAAW,CAAC,KAAG,MAAIA,EAAE,KAAK,WAAW,CAAC,KAAG,MAAIA,EAAE,KAAK,WAAW,CAAC,KAAG,MAAIA,EAAE,KAAK,WAAW,CAAC,KAAG,QAAWA,EAAE,KAAK,WAAW,CAAC,MAAxB,KAA6CA,EAAE,KAAK,CAAC,EAAE,gBAAcA,EAAE,KAAK,OAAO,CAAC,IAAEA,EAAE,MAAK,MAAIi5B,IAAEA,EAAE,QAAQ,OAAM,IAAI,IAAGA;AAAA,EAAC;AAAC,WAASzrD,EAAEwyB,GAAElzB,GAAE;AAAC,UAAMmsD,IAAEnsD,IAAE6sD,IAAED;AAAE,QAAIhzD,IAAE,IAAG,EAAC,QAAO+F,GAAE,WAAUysD,GAAE,MAAK1uD,GAAE,OAAM2uD,GAAE,UAASpc,EAAC,IAAE/c;AAAE,QAAGvzB,MAAI/F,KAAG+F,GAAE/F,KAAG,OAAMwyD,KAAYzsD,MAAT,YAAc/F,KAAG0yD,GAAE1yD,KAAG0yD,IAAGF,GAAE;AAAC,UAAIl5B,IAAEk5B,EAAE,QAAQ,GAAG;AAAE,UAAQl5B,MAAL,IAAO;AAAC,cAAMlzB,IAAEosD,EAAE,OAAO,GAAEl5B,CAAC;AAAE,QAAAk5B,IAAEA,EAAE,OAAOl5B,IAAE,CAAC,GAAEA,IAAElzB,EAAE,YAAY,GAAG,GAAOkzB,MAAL,KAAOt5B,KAAGuyD,EAAEnsD,GAAE,IAAG,EAAE,KAAGpG,KAAGuyD,EAAEnsD,EAAE,OAAO,GAAEkzB,CAAC,GAAE,IAAG,EAAE,GAAEt5B,KAAG,KAAIA,KAAGuyD,EAAEnsD,EAAE,OAAOkzB,IAAE,CAAC,GAAE,IAAG,EAAE,IAAGt5B,KAAG;AAAA,MAAG;AAAC,MAAAwyD,IAAEA,EAAE,YAAW,GAAGl5B,IAAEk5B,EAAE,YAAY,GAAG,GAAOl5B,MAAL,KAAOt5B,KAAGuyD,EAAEC,GAAE,IAAG,EAAE,KAAGxyD,KAAGuyD,EAAEC,EAAE,OAAO,GAAEl5B,CAAC,GAAE,IAAG,EAAE,GAAEt5B,KAAGwyD,EAAE,OAAOl5B,CAAC;AAAA,IAAE;AAAC,QAAGx1B,GAAE;AAAC,UAAGA,EAAE,UAAQ,KAAQA,EAAE,WAAW,CAAC,MAAnB,MAA2BA,EAAE,WAAW,CAAC,MAAnB,IAAqB;AAAC,cAAMw1B,IAAEx1B,EAAE,WAAW,CAAC;AAAE,QAAAw1B,KAAG,MAAIA,KAAG,OAAKx1B,IAAE,IAAI,OAAO,aAAaw1B,IAAE,EAAE,CAAC,IAAIx1B,EAAE,OAAO,CAAC,CAAC;AAAA,MAAG,WAASA,EAAE,UAAQ,KAAQA,EAAE,WAAW,CAAC,MAAnB,IAAqB;AAAC,cAAMw1B,IAAEx1B,EAAE,WAAW,CAAC;AAAE,QAAAw1B,KAAG,MAAIA,KAAG,OAAKx1B,IAAE,GAAG,OAAO,aAAaw1B,IAAE,EAAE,CAAC,IAAIx1B,EAAE,OAAO,CAAC,CAAC;AAAA,MAAG;AAAC,MAAA9D,KAAGuyD,EAAEzuD,GAAE,IAAG,EAAE;AAAA,IAAC;AAAC,WAAO2uD,MAAIzyD,KAAG,KAAIA,KAAGuyD,EAAEE,GAAE,IAAG,EAAE,IAAGpc,MAAIr2C,KAAG,KAAIA,KAAGoG,IAAEiwC,IAAE2c,EAAE3c,GAAE,IAAG,EAAE,IAAGr2C;AAAA,EAAC;AAAC,WAASkzD,EAAE55B,GAAE;AAAC,QAAG;AAAC,aAAO,mBAAmBA,CAAC;AAAA,IAAC,QAAM;AAAC,aAAOA,EAAE,SAAO,IAAEA,EAAE,OAAO,GAAE,CAAC,IAAE45B,EAAE55B,EAAE,OAAO,CAAC,CAAC,IAAEA;AAAA,IAAC;AAAA,EAAC;AAAC,QAAM65B,IAAE;AAA8B,WAASJ,EAAEz5B,GAAE;AAAC,WAAOA,EAAE,MAAM65B,CAAC,IAAE75B,EAAE,QAAQ65B,IAAG,CAAA75B,MAAG45B,EAAE55B,CAAC,MAAIA;AAAA,EAAC;AAAC,MAAItV,IAAEuuC,EAAE,GAAG;AAAE,QAAMa,KAAEpvC,EAAE,SAAOA,GAAExU,KAAE;AAAI,MAAIqjD;AAAE,GAAC,SAASv5B,GAAE;AAAC,IAAAA,EAAE,WAAS,SAASA,MAAKlzB,GAAE;AAAC,aAAOkzB,EAAE,KAAK,EAAC,MAAK85B,GAAE,KAAK95B,EAAE,MAAK,GAAGlzB,CAAC,EAAC,CAAC;AAAA,IAAC,GAAEkzB,EAAE,cAAY,SAASA,MAAKlzB,GAAE;AAAC,UAAImsD,IAAEj5B,EAAE,MAAKt5B,IAAE;AAAG,MAAAuyD,EAAE,CAAC,MAAI/iD,OAAI+iD,IAAE/iD,KAAE+iD,GAAEvyD,IAAE;AAAI,UAAI+F,IAAEqtD,GAAE,QAAQb,GAAE,GAAGnsD,CAAC;AAAE,aAAOpG,KAAG+F,EAAE,CAAC,MAAIyJ,MAAG,CAAC8pB,EAAE,cAAYvzB,IAAEA,EAAE,UAAU,CAAC,IAAGuzB,EAAE,KAAK,EAAC,MAAKvzB,EAAC,CAAC;AAAA,IAAC,GAAEuzB,EAAE,UAAQ,SAASA,GAAE;AAAC,UAAOA,EAAE,KAAK,WAAX,KAAmBA,EAAE,SAAO9pB,GAAE,QAAO8pB;AAAE,UAAIlzB,IAAEgtD,GAAE,QAAQ95B,EAAE,IAAI;AAAE,aAAWlzB,EAAE,WAAN,KAAmBA,EAAE,WAAW,CAAC,MAAnB,OAAuBA,IAAE,KAAIkzB,EAAE,KAAK,EAAC,MAAKlzB,EAAC,CAAC;AAAA,IAAC,GAAEkzB,EAAE,WAAS,SAASA,GAAE;AAAC,aAAO85B,GAAE,SAAS95B,EAAE,IAAI;AAAA,IAAC,GAAEA,EAAE,UAAQ,SAASA,GAAE;AAAC,aAAO85B,GAAE,QAAQ95B,EAAE,IAAI;AAAA,IAAC;AAAA,EAAC,GAAEu5B,OAAIA,KAAE,CAAA,EAAG,GAAEP,KAAItyD;AAAC,GAAC;AAAW,MAAK,EAAC,KAAAi7C,IAAI,OAAAoY,GAAK,IAAEf;ACO97U,IAAIgB;AAAA,CACV,SAAUA,GAAU;AACjB,EAAAA,EAAS,WAAWD,GAAM,UAC1BC,EAAS,UAAUD,GAAM,SACzBC,EAAS,UAAUD,GAAM,SACzBC,EAAS,WAAWD,GAAM,UAC1BC,EAAS,cAAcD,GAAM;AAC7B,QAAME,IAAY,OAAO,WAAY,YAAY,SAAS,aAAa;AACvE,WAASC,EAAO,GAAG1sD,GAAG;AAClB,WAAO,GAAG,eAAeA,GAAG,SAAQ;AAAA,EACxC;AACA,EAAAwsD,EAAS,SAASE;AAClB,WAASC,EAAS9hD,GAAMlD,GAAI;AACxB,UAAMilD,IAAW,OAAO/hD,KAAS,WAAWspC,GAAI,MAAMtpC,CAAI,EAAE,OAAOA,EAAK,MAClEgiD,IAAS,OAAOllD,KAAO,WAAWwsC,GAAI,MAAMxsC,CAAE,EAAE,OAAOA,EAAG,MAC1DmlD,IAAYF,EAAS,MAAM,GAAG,EAAE,OAAO,CAAAttD,MAAKA,EAAE,SAAS,CAAC,GACxDytD,IAAUF,EAAO,MAAM,GAAG,EAAE,OAAO,CAAAvtD,MAAKA,EAAE,SAAS,CAAC;AAC1D,QAAImtD,GAAW;AACX,YAAMO,IAAuB;AAO7B,UANIF,EAAU,CAAC,KAAKE,EAAqB,KAAKF,EAAU,CAAC,CAAC,MACtDA,EAAU,CAAC,IAAIA,EAAU,CAAC,EAAE,YAAW,IAEvCC,EAAQ,CAAC,KAAKC,EAAqB,KAAKD,EAAQ,CAAC,CAAC,MAClDA,EAAQ,CAAC,IAAIA,EAAQ,CAAC,EAAE,YAAW,IAEnCD,EAAU,CAAC,MAAMC,EAAQ,CAAC;AAE1B,eAAOF,EAAO,UAAU,CAAC;AAAA,IAEjC;AACA,QAAI5tD,IAAI;AACR,WAAOA,IAAI6tD,EAAU,UACbA,EAAU7tD,CAAC,MAAM8tD,EAAQ9tD,CAAC,GADLA;AACzB;AAIJ,UAAMguD,IAAW,MAAM,OAAOH,EAAU,SAAS7tD,CAAC,GAC5CiuD,IAASH,EAAQ,MAAM9tD,CAAC,EAAE,KAAK,GAAG;AACxC,WAAOguD,IAAWC;AAAA,EACtB;AACA,EAAAV,EAAS,WAAWG;AACpB,WAASQ,EAAUlY,GAAK;AACpB,WAAOd,GAAI,MAAMc,EAAI,SAAQ,CAAE,EAAE,SAAQ;AAAA,EAC7C;AACA,EAAAuX,EAAS,YAAYW;AACrB,WAASC,EAAShmD,GAAQD,GAAO;AAC7B,QAAIkmD,IAAa,OAAOjmD,KAAW,WAAWA,IAASA,EAAO,MAC1DkmD,IAAY,OAAOnmD,KAAU,WAAWA,IAAQA,EAAM;AAS1D,WAPImmD,EAAU,OAAOA,EAAU,SAAS,CAAC,MAAM,QAC3CA,IAAYA,EAAU,MAAM,GAAG,EAAE,IAEjCD,EAAW,OAAOA,EAAW,SAAS,CAAC,MAAM,QAC7CA,IAAaA,EAAW,MAAM,GAAG,EAAE,IAGnCC,MAAcD,IACP,KAGPC,EAAU,SAASD,EAAW,UAI9BC,EAAU,OAAOD,EAAW,MAAM,MAAM,MACjC,KAGJC,EAAU,WAAWD,CAAU;AAAA,EAC1C;AACA,EAAAb,EAAS,WAAWY;AACxB,GAAGZ,OAAaA,KAAW,CAAA,EAAG;AASvB,MAAMe,GAAQ;AAAA,EACjB,cAAc;AACV,SAAK,OAAO,EAAE,MAAM,IAAI,UAAU,oBAAI,MAAK;AAAA,EAC/C;AAAA,EACA,aAAatY,GAAK;AACd,WAAOuX,GAAS,UAAUvX,CAAG;AAAA,EACjC;AAAA,EACA,QAAQ;AACJ,SAAK,KAAK,SAAS,MAAK;AAAA,EAC5B;AAAA,EACA,OAAOA,GAAKj3C,GAAS;AACjB,UAAMrB,IAAO,KAAK,QAAQ,KAAK,aAAas4C,CAAG,GAAG,EAAI;AACtD,IAAAt4C,EAAK,UAAUqB;AAAA,EACnB;AAAA,EACA,OAAOi3C,GAAK;AACR,UAAMuY,IAAe,KAAK,QAAQ,KAAK,aAAavY,CAAG,GAAG,EAAK;AAC/D,IAAIuY,GAAc,UACdA,EAAa,OAAO,SAAS,OAAOA,EAAa,IAAI;AAAA,EAE7D;AAAA,EACA,IAAIvY,GAAK;AACL,WAAO,KAAK,QAAQ,KAAK,aAAaA,CAAG,GAAG,EAAK,GAAG,YAAY;AAAA,EACpE;AAAA,EACA,QAAQA,GAAK;AACT,WAAO,KAAK,QAAQ,KAAK,aAAaA,CAAG,GAAG,EAAK,MAAM;AAAA,EAC3D;AAAA,EACA,KAAKA,GAAK;AACN,WAAO,KAAK,QAAQ,KAAK,aAAaA,CAAG,GAAG,EAAK,GAAG;AAAA,EACxD;AAAA,EACA,SAASA,GAAK;AACV,UAAMwY,IAAY,KAAK,aAAaxY,CAAG,GACjCt4C,IAAO,KAAK,QAAQ8wD,GAAW,EAAK;AAC1C,QAAK9wD;AAGL,aAAO;AAAA,QACH,MAAMA,EAAK;AAAA,QACX,KAAK6vD,GAAS,SAASrY,GAAI,MAAMsZ,CAAS,GAAG9wD,EAAK,IAAI,EAAE,SAAQ;AAAA,QAChE,SAASA,EAAK;AAAA,MAC1B;AAAA,EACI;AAAA,EACA,aAAas4C,GAAK;AACd,UAAMwY,IAAY,KAAK,aAAaxY,CAAG,GACjCt4C,IAAO,KAAK,QAAQ8wD,GAAW,EAAK;AAC1C,WAAK9wD,IAGE,MAAM,KAAKA,EAAK,SAAS,QAAQ,EAAE,IAAI,CAAAwK,OAAU;AAAA,MACpD,MAAMA,EAAM;AAAA,MACZ,KAAKqlD,GAAS,SAASrY,GAAI,MAAMsZ,CAAS,GAAGtmD,EAAM,IAAI,EAAE,SAAQ;AAAA,MACjE,SAASA,EAAM;AAAA,IAC3B,EAAU,IANS,CAAA;AAAA,EAOf;AAAA,EACA,MAAM;AACF,WAAO,KAAK,cAAc,KAAK,IAAI;AAAA,EACvC;AAAA,EACA,QAAQovB,GAAQ;AACZ,UAAM55B,IAAO,KAAK,QAAQ6vD,GAAS,UAAUj2B,CAAM,GAAG,EAAK;AAC3D,WAAK55B,IAGE,KAAK,cAAcA,CAAI,IAFnB,CAAA;AAAA,EAGf;AAAA,EACA,QAAQs4C,GAAKV,GAAQ;AACjB,UAAM+N,IAAQrN,EAAI,MAAM,GAAG;AAC3B,IAAIA,EAAI,OAAOA,EAAI,SAAS,CAAC,MAAM,OAE/BqN,EAAM,IAAG;AAEb,QAAI3P,IAAU,KAAK;AACnB,eAAW+a,KAAQpL,GAAO;AACtB,UAAIn7C,IAAQwrC,EAAQ,SAAS,IAAI+a,CAAI;AACrC,UAAI,CAACvmD;AACD,YAAIotC;AACA,UAAAptC,IAAQ;AAAA,YACJ,MAAMumD;AAAA,YACN,UAAU,oBAAI,IAAG;AAAA,YACjB,QAAQ/a;AAAA,UAChC,GACoBA,EAAQ,SAAS,IAAI+a,GAAMvmD,CAAK;AAAA;AAGhC;AAGR,MAAAwrC,IAAUxrC;AAAA,IACd;AACA,WAAOwrC;AAAA,EACX;AAAA,EACA,cAAch2C,GAAM;AAChB,UAAM3F,IAAS,CAAA;AACf,IAAI2F,EAAK,WACL3F,EAAO,KAAK2F,EAAK,OAAO;AAE5B,eAAWwK,KAASxK,EAAK,SAAS,OAAM;AACpC,MAAA3F,EAAO,KAAK,GAAG,KAAK,cAAcmQ,CAAK,CAAC;AAE5C,WAAOnQ;AAAA,EACX;AACJ;ACrKO,IAAI22D;AAAA,CACV,SAAUA,GAAe;AAKtB,EAAAA,EAAcA,EAAc,UAAa,CAAC,IAAI,WAM9CA,EAAcA,EAAc,SAAY,CAAC,IAAI,UAK7CA,EAAcA,EAAc,iBAAoB,CAAC,IAAI,kBAQrDA,EAAcA,EAAc,iBAAoB,CAAC,IAAI,kBAKrDA,EAAcA,EAAc,SAAY,CAAC,IAAI,UAM7CA,EAAcA,EAAc,oBAAuB,CAAC,IAAI,qBAKxDA,EAAcA,EAAc,YAAe,CAAC,IAAI;AACpD,GAAGA,MAAkBA,IAAgB,CAAA,EAAG;AACjC,MAAMC,GAA8B;AAAA,EACvC,YAAY17C,GAAU;AAClB,SAAK,kBAAkBA,EAAS,iBAChC,KAAK,gBAAgBA,EAAS,UAAU,eACxC,KAAK,qBAAqBA,EAAS,UAAU;AAAA,EACjD;AAAA,EACA,MAAM,QAAQ+iC,GAAK4Y,IAAoB7D,GAAAA,kBAAkB,MAAM;AAC3D,UAAM1L,IAAU,MAAM,KAAK,mBAAmB,SAASrJ,CAAG;AAC1D,WAAO,KAAK,YAAYA,GAAKqJ,GAASuP,CAAiB;AAAA,EAC3D;AAAA,EACA,iBAAiB7V,GAAc/C,GAAK3tC,GAAO;AAEvC,WADA2tC,IAAMA,KAAOd,GAAI,MAAM6D,EAAa,GAAG,GACnCgS,GAAAA,kBAAkB,GAAG1iD,CAAK,IACnB,KAAK,YAAY2tC,GAAK+C,GAAc1wC,CAAK,IAGzC,KAAK,OAAO2tC,GAAK+C,GAAc1wC,CAAK;AAAA,EAEnD;AAAA,EACA,WAAWyb,GAAMkyB,GAAK3tC,GAAO;AACzB,WAAI0iD,GAAAA,kBAAkB,GAAG1iD,CAAK,IACnB,KAAK,YAAY2tC,GAAKlyB,GAAMzb,CAAK,IAGjC,KAAK,OAAO2tC,GAAKlyB,GAAMzb,CAAK;AAAA,EAE3C;AAAA,EACA,UAAUwmD,GAAO7Y,GAAK;AAClB,WAAO,KAAK,OAAOA,GAAK,EAAE,QAAQ6Y,EAAK,CAAE;AAAA,EAC7C;AAAA,EACA,OAAO7Y,GAAKqJ,GAASz+C,GAAS;AAC1B,QAAI,OAAOy+C,KAAY,UAAU;AAC7B,YAAMyP,IAAc,KAAK,MAAM9Y,GAAKqJ,GAASz+C,CAAO;AACpD,aAAO,KAAK,sBAAsBkuD,GAAa9Y,GAAK,QAAWqJ,CAAO;AAAA,IAC1E,WACS,YAAYA,GAAS;AAC1B,YAAMyP,IAAc,EAAE,OAAOzP,EAAQ,QAAQ,cAAc,CAAA,GAAI,aAAa,GAAE;AAC9E,aAAO,KAAK,sBAAsByP,GAAa9Y,CAAG;AAAA,IACtD,OACK;AACD,YAAM8Y,IAAc,KAAK,MAAM9Y,GAAKqJ,EAAQ,QAAO,GAAIz+C,CAAO;AAC9D,aAAO,KAAK,sBAAsBkuD,GAAa9Y,GAAKqJ,CAAO;AAAA,IAC/D;AAAA,EACJ;AAAA,EACA,MAAM,YAAYrJ,GAAKqJ,GAAS0P,GAAa;AACzC,QAAI,OAAO1P,KAAY,UAAU;AAC7B,YAAMyP,IAAc,MAAM,KAAK,WAAW9Y,GAAKqJ,GAAS0P,CAAW;AACnE,aAAO,KAAK,sBAAsBD,GAAa9Y,GAAK,QAAWqJ,CAAO;AAAA,IAC1E,OACK;AACD,YAAMyP,IAAc,MAAM,KAAK,WAAW9Y,GAAKqJ,EAAQ,QAAO,GAAI0P,CAAW;AAC7E,aAAO,KAAK,sBAAsBD,GAAa9Y,GAAKqJ,CAAO;AAAA,IAC/D;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,sBAAsByP,GAAa9Y,GAAK+C,GAAcj1B,GAAM;AACxD,QAAI07B;AACJ,QAAIzG;AACA,MAAAyG,IAAW;AAAA,QACP,aAAAsP;AAAA,QACA,KAAA9Y;AAAA,QACA,OAAO0Y,EAAc;AAAA,QACrB,YAAY,CAAA;AAAA,QACZ,cAAA3V;AAAA,MAChB;AAAA,SAEa;AACD,YAAMiW,IAAqB,KAAK,yBAAyBhZ,GAAKlyB,CAAI;AAClE,MAAA07B,IAAW;AAAA,QACP,aAAAsP;AAAA,QACA,KAAA9Y;AAAA,QACA,OAAO0Y,EAAc;AAAA,QACrB,YAAY,CAAA;AAAA,QACZ,IAAI,eAAe;AACf,iBAAOM,EAAkB;AAAA,QAC7B;AAAA,MAChB;AAAA,IACQ;AACA,WAAAF,EAAY,MAAM,YAAYtP,GACvBA;AAAA,EACX;AAAA,EACA,MAAM,OAAOA,GAAUoP,GAAmB;AAEtC,UAAMK,IAAUzP,EAAS,YAAY,MAAM,UAAU,KAAK,UACpDzG,IAAe,KAAK,eAAe,IAAIyG,EAAS,IAAI,UAAU,GAC9D17B,IAAOi1B,IAAeA,EAAa,QAAO,IAAK,MAAM,KAAK,mBAAmB,SAASyG,EAAS,GAAG;AACxG,QAAIzG;AACA,aAAO,eAAeyG,GAAU,gBAAgB;AAAA,QAC5C,OAAOzG;AAAA,MACvB,CAAa;AAAA,SAEA;AACD,YAAMiW,IAAqB,KAAK,yBAAyBxP,EAAS,KAAK17B,CAAI;AAC3E,aAAO,eAAe07B,GAAU,gBAAgB;AAAA,QAC5C,KAAKwP;AAAA,MACrB,CAAa;AAAA,IACL;AAGA,WAAIC,MAAYnrC,MACZ07B,EAAS,cAAc,MAAM,KAAK,WAAWA,EAAS,KAAK17B,GAAM8qC,CAAiB,GAClFpP,EAAS,YAAY,MAAM,YAAYA,IAE3CA,EAAS,QAAQkP,EAAc,QACxBlP;AAAA,EACX;AAAA,EACA,MAAMxJ,GAAKlyB,GAAMljB,GAAS;AAEtB,WADiB,KAAK,gBAAgB,YAAYo1C,CAAG,EACrC,OAAO,cAAc,MAAMlyB,GAAMljB,CAAO;AAAA,EAC5D;AAAA,EACA,WAAWo1C,GAAKlyB,GAAM8qC,GAAmB;AAErC,WADiB,KAAK,gBAAgB,YAAY5Y,CAAG,EACrC,OAAO,YAAY,MAAMlyB,GAAM8qC,CAAiB;AAAA,EACpE;AAAA,EACA,yBAAyB5Y,GAAKlyB,GAAM;AAChC,UAAMorC,IAAkB,KAAK;AAC7B,QAAIC;AACJ,WAAO,MACIA,MAAYA,IAAU/P,GAAa,OAAOpJ,EAAI,YAAYkZ,EAAgB,YAAYlZ,CAAG,EAAE,iBAAiB,YAAY,GAAGlyB,KAAQ,EAAE;AAAA,EAEpJ;AACJ;AACO,MAAMsrC,GAAwB;AAAA,EACjC,YAAYn8C,GAAU;AAClB,SAAK,eAAe,IAAIq7C,GAAO,GAC/B,KAAK,WAAWr7C,GAChB,KAAK,yBAAyBA,EAAS,UAAU,wBACjD,KAAK,kBAAkB,MAAMA,EAAS,UAAU;AAAA,EACpD;AAAA,EACA,IAAI,MAAM;AACN,WAAOnT,GAAO,KAAK,aAAa,IAAG,CAAE;AAAA,EACzC;AAAA,EACA,YAAY0/C,GAAU;AAClB,UAAMgP,IAAYhP,EAAS,IAAI,SAAQ;AACvC,QAAI,KAAK,aAAa,IAAIgP,CAAS;AAC/B,YAAM,IAAI,MAAM,4BAA4BA,CAAS,uBAAuB;AAEhF,SAAK,aAAa,OAAOA,GAAWhP,CAAQ;AAAA,EAChD;AAAA,EACA,YAAYxJ,GAAK;AACb,UAAMwY,IAAYxY,EAAI,SAAQ;AAC9B,WAAO,KAAK,aAAa,KAAKwY,CAAS;AAAA,EAC3C;AAAA,EACA,aAAaa,GAAQ;AACjB,UAAMb,IAAYa,EAAO,SAAQ;AACjC,WAAO,KAAK,aAAa,QAAQb,CAAS;AAAA,EAC9C;AAAA,EACA,MAAM,oBAAoBxY,GAAK4Y,GAAmB;AAC9C,QAAIpP,IAAW,KAAK,YAAYxJ,CAAG;AACnC,WAAIwJ,MAGJA,IAAW,MAAM,KAAK,uBAAuB,QAAQxJ,GAAK4Y,CAAiB,GAC3E,KAAK,YAAYpP,CAAQ,GAClBA;AAAA,EACX;AAAA,EACA,eAAexJ,GAAKlyB,GAAM8qC,GAAmB;AACzC,QAAIA;AACA,aAAO,KAAK,uBAAuB,WAAW9qC,GAAMkyB,GAAK4Y,CAAiB,EAAE,KAAK,CAAApP,OAC7E,KAAK,YAAYA,CAAQ,GAClBA,EACV;AAEA;AACD,YAAMA,IAAW,KAAK,uBAAuB,WAAW17B,GAAMkyB,CAAG;AACjE,kBAAK,YAAYwJ,CAAQ,GAClBA;AAAA,IACX;AAAA,EACJ;AAAA,EACA,YAAYxJ,GAAK;AACb,WAAO,KAAK,aAAa,IAAIA,EAAI,SAAQ,CAAE;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,mBAAmBA,GAAK;AACpB,UAAMwY,IAAYxY,EAAI,SAAQ,GACxBsZ,IAAa,KAAK,aAAa,KAAKd,CAAS;AACnD,WAAIc,KACA,KAAK,gBAAe,EAAG,aAAaA,GAAYZ,EAAc,OAAO,GAElEY;AAAA,EACX;AAAA,EACA,eAAetZ,GAAK;AAChB,UAAMwY,IAAYxY,EAAI,SAAQ,GACxBsZ,IAAa,KAAK,aAAa,KAAKd,CAAS;AACnD,WAAIc,MACAA,EAAW,QAAQZ,EAAc,SACjC,KAAK,aAAa,OAAOF,CAAS,IAE/Bc;AAAA,EACX;AAAA,EACA,gBAAgBD,GAAQ;AACpB,UAAMb,IAAYa,EAAO,SAAQ,GAC3BE,IAAc,KAAK,aAAa,QAAQf,CAAS;AACvD,eAAWc,KAAcC;AACrB,MAAAD,EAAW,QAAQZ,EAAc;AAErC,gBAAK,aAAa,OAAOF,CAAS,GAC3Be;AAAA,EACX;AACJ;AC1QO,MAAMC,KAAe,uBAAO,cAAc;AAC1C,MAAMC,GAAc;AAAA,EACvB,YAAYx8C,GAAU;AAClB,SAAK,aAAaA,EAAS,OAAO,eAClC,KAAK,mBAAmB,MAAMA,EAAS,OAAO,UAAU,kBACxD,KAAK,gBAAgBA,EAAS,WAAW,eACzC,KAAK,iBAAiBA,EAAS,UAAU,gBACzC,KAAK,WAAWA,EAAS,OAAO,UAAU,iBAC1C,KAAK,aAAaA,EAAS,iBAAiB;AAAA,EAChD;AAAA,EACA,MAAM,KAAKusC,GAAUuP,IAAchE,GAAAA,kBAAkB,MAAM;AACvD,QAAI,KAAK,UAAU,SAAS,SAAS,GAAG;AACpC,YAAMpG,IAAO,KAAK,SAAS,WAAW,WAAW,KAAK,UAAU;AAChE,MAAAA,EAAK,MAAK;AACV,UAAI;AACA,mBAAWjnD,KAAQsE,GAAUw9C,EAAS,YAAY,KAAK;AACnD,gBAAMmM,GAAkBoD,CAAW,GACnC3sD,GAAiB1E,CAAI,EAAE,QAAQ,CAAAqxB,MAAO;AAClC,kBAAM3tB,IAAO,GAAG1D,EAAK,KAAK,IAAIqxB,EAAI,QAAQ;AAC1C,YAAA41B,EAAK,aAAavjD,CAAI;AACtB,gBAAI;AACA,mBAAK,OAAO2tB,GAAKywB,CAAQ;AAAA,YAC7B,UACxB;AAC4B,cAAAmF,EAAK,YAAYvjD,CAAI;AAAA,YACzB;AAAA,UACJ,CAAC;AAAA,MAET,UACZ;AACgB,QAAAujD,EAAK,KAAI;AAAA,MACb;AAAA,IACJ;AAEI,iBAAWjnD,KAAQsE,GAAUw9C,EAAS,YAAY,KAAK;AACnD,cAAMmM,GAAkBoD,CAAW,GACnC3sD,GAAiB1E,CAAI,EAAE,QAAQ,CAAAqxB,MAAO,KAAK,OAAOA,GAAKywB,CAAQ,CAAC;AAAA,EAG5E;AAAA,EACA,OAAOliD,GAASkiD,GAAU;AACtB,UAAMzwB,IAAMzxB,EAAQ;AAEpB,QAAI,UAAUyxB,KAAOA,EAAI,SAAS,QAAW;AACzC,MAAAA,EAAI,OAAOygC;AACX,UAAI;AACA,cAAM9W,IAAc,KAAK,aAAap7C,CAAO;AAC7C,YAAIF,GAAes7C,CAAW;AAC1B,UAAA3pB,EAAI,OAAO2pB;AAAA,aAEV;AACD,UAAA3pB,EAAI,mBAAmB2pB;AACvB,gBAAMgX,IAAa,KAAK,YAAYhX,CAAW;AAC/C,UAAA3pB,EAAI,OAAO2gC,KAAc,KAAK,mBAAmBpyD,GAASo7C,CAAW;AAAA,QACzE;AAAA,MACJ,SACOgT,GAAK;AACR,gBAAQ,MAAM,mDAAmD38B,EAAI,QAAQ,MAAM28B,CAAG;AACtF,cAAM9zB,IAAe8zB,EAAI,WAAW,OAAOA,CAAG;AAC9C,QAAA38B,EAAI,OAAO;AAAA,UACP,MAAMzxB;AAAA,UACN,SAAS,mDAAmDyxB,EAAI,QAAQ,MAAM6I,CAAY;AAAA,QAC9G;AAAA,MACY;AACA,MAAA4nB,EAAS,WAAW,KAAKzwB,CAAG;AAAA,IAChC,WACS,YAAYA,KAAOA,EAAI,WAAW,QAAW;AAClD,MAAAA,EAAI,SAASygC;AACb,UAAI;AACA,cAAMG,IAAe,KAAK,cAAcryD,CAAO,GACzC+9C,IAAQ,CAAA;AACd,YAAIj+C,GAAeuyD,CAAY;AAC3B,UAAA5gC,EAAI,gBAAgB4gC;AAAA;AAGpB,qBAAWjX,KAAeiX,GAAc;AACpC,kBAAMD,IAAa,KAAK,YAAYhX,CAAW;AAC/C,YAAIgX,KACArU,EAAM,KAAK,EAAE,KAAKqU,GAAY,kBAAkBhX,GAAa;AAAA,UAErE;AAEJ,QAAA3pB,EAAI,SAASssB;AAAA,MACjB,SACOqQ,GAAK;AACR,QAAA38B,EAAI,gBAAgB;AAAA,UAChB,MAAMzxB;AAAA,UACN,SAAS,mDAAmDyxB,EAAI,QAAQ,MAAM28B,CAAG;AAAA,QACrG,GACgB38B,EAAI,SAAS,CAAA;AAAA,MACjB;AACA,MAAAywB,EAAS,WAAW,KAAKzwB,CAAG;AAAA,IAChC;AAAA,EACJ;AAAA,EACA,OAAOywB,GAAU;AACb,eAAWzwB,KAAOywB,EAAS;AACvB,MAAI,UAAUzwB,KACVA,EAAI,OAAO,QACX,OAAOA,EAAI,oBAEN,YAAYA,MACjBA,EAAI,SAAS,QACb,OAAOA,EAAI;AAGnB,IAAAywB,EAAS,aAAa,CAAA;AAAA,EAC1B;AAAA,EACA,aAAaliD,GAAS;AAGlB,WAFc,KAAK,cAAc,SAASA,CAAO,EACvB,WAAWA,EAAQ,UAAU,QAAQ,KACzC,KAAK,mBAAmBA,CAAO;AAAA,EACzD;AAAA,EACA,cAAcA,GAAS;AAEnB,UAAMqyD,IADQ,KAAK,cAAc,SAASryD,CAAO,EACtB,YAAYA,EAAQ,UAAU,QAAQ,EAAE,SAAS,CAAAsyD,MAAQ,GAAGA,EAAK,WAAW,IAAIA,EAAK,IAAI,EAAE,EAAE,QAAO;AAC/H,WAAOD,EAAa,SAAS,IAAIA,IAAe,KAAK,mBAAmBryD,CAAO;AAAA,EACnF;AAAA,EACA,eAAeI,GAAMmE,GAAUguD,GAASC,GAAS;AAG7C,UAAMC,IAAS,MACTruD,IAAY;AAAA,MACd,UAAUmuD;AAAA,MACV,UAAUC;AAAA,MACV,MAAM;AAAA,MACN,IAAI,MAAM;AACN,YAAI/yD,GAAU,KAAK,IAAI;AAEnB,iBAAO,KAAK;AAEX,YAAII,GAAqB,KAAK,gBAAgB,GAAG;AAElD,gBAAMuyD,IAAaK,EAAO,YAAY,KAAK,gBAAgB;AAC3D,eAAK,OAAOL,KACRK,EAAO,mBAAmB,EAAE,WAAAruD,GAAW,WAAWhE,GAAM,UAAAmE,EAAQ,GAAI,KAAK,gBAAgB;AAAA,QACjG,WACS,KAAK,SAAS,QAAW;AAE9B,eAAK,OAAO2tD;AACZ,gBAAMhQ,IAAWh+C,GAAa9D,CAAI,EAAE,WAC9BsyD,IAAUD,EAAO,cAAc,EAAE,WAAAruD,GAAW,WAAWhE,GAAM,UAAAmE,GAAU;AAC7E,cAAImuD,EAAQ,SAASxQ,KAAYA,EAAS,QAAQkP,EAAc;AAE5D,mBAAO,KAAK,OAAO;AAEvB,eAAK,OAAOsB,EAAQ,QAAQA,EAAQ,OACpC,KAAK,mBAAmBA,EAAQ,OAChCxQ,GAAU,WAAW,KAAK,IAAI;AAAA,QAClC,MACK,CAAI,KAAK,SAASgQ,MACnBO,EAAO,0BAA0BryD,GAAMmE,GAAUiuD,CAAO;AAE5D,eAAO/yD,GAAU,KAAK,IAAI,IAAI,KAAK,OAAO;AAAA,MAC9C;AAAA,MACA,IAAI,mBAAmB;AACnB,eAAO,KAAK;AAAA,MAChB;AAAA,MACA,IAAI,QAAQ;AACR,eAAOK,GAAe,KAAK,IAAI,IAAI,KAAK,OAAO;AAAA,MACnD;AAAA,IACZ;AACQ,WAAOsE;AAAA,EACX;AAAA,EACA,oBAAoBhE,GAAMmE,GAAUguD,GAASC,GAAS;AAGlD,UAAMC,IAAS,MACTruD,IAAY;AAAA,MACd,UAAUmuD;AAAA,MACV,UAAUC;AAAA,MACV,QAAQ;AAAA,MACR,IAAI,QAAQ;AACR,YAAI,MAAM,QAAQ,KAAK,MAAM;AACzB,iBAAO,KAAK;AAEX,YAAI,KAAK,WAAW,QAAW;AAChC,eAAK,SAASN;AACd,gBAAMhQ,IAAWh+C,GAAa9D,CAAI,EAAE,WAC9BiyD,IAAeI,EAAO,cAAc;AAAA,YACtC,WAAAruD;AAAA,YACA,WAAWhE;AAAA,YACX,UAAAmE;AAAA,UACxB,CAAqB,GACKw5C,IAAQ,CAAA;AACd,cAAIj+C,GAAeuyD,CAAY;AAC3B,iBAAK,gBAAgBA;AAAA;AAGrB,uBAAWjX,KAAeiX,GAAc;AACpC,oBAAMD,IAAaK,EAAO,YAAYrX,CAAW;AACjD,cAAIgX,KACArU,EAAM,KAAK,EAAE,KAAKqU,GAAY,kBAAkBhX,GAAa;AAAA,YAErE;AAEJ,eAAK,SAAS2C,GACdmE,GAAU,WAAW,KAAK,IAAI;AAAA,QAClC,MACK,CAAI,KAAK,WAAWgQ,MACrBO,EAAO,0BAA0BryD,GAAMmE,GAAUiuD,CAAO;AAE5D,eAAO,MAAM,QAAQ,KAAK,MAAM,IAAI,KAAK,SAAS,CAAA;AAAA,MACtD;AAAA,MACA,IAAI,QAAQ;AACR,YAAI,KAAK;AACL,iBAAO,KAAK;AAGhB,YAAI,EADS,KAAK,MACT,SAAS;AAId,iBAAQ,KAAK,gBAAgBC,EAAO,mBAAmB,EAAE,WAAAruD,GAAW,WAAWhE,GAAM,UAAAmE,GAAU;AAAA,MAEvG;AAAA,IACZ;AACQ,WAAOH;AAAA,EACX;AAAA,EACA,0BAA0BhE,GAAMmE,GAAUiuD,GAAS;AAC/C,UAAM,IAAI,MAAM,yCAAyC,KAAK,eAAe,eAAepyD,CAAI,CAAC,IAAImE,CAAQ,aAAaiuD,CAAO,IAAI;AAAA,EACzI;AAAA,EACA,cAAcxyD,GAAS;AACnB,QAAI;AACA,YAAMo7C,IAAc,KAAK,aAAap7C,CAAO;AAC7C,UAAIF,GAAes7C,CAAW;AAC1B,eAAO,EAAE,OAAOA,EAAW;AAE/B,YAAMgX,IAAa,KAAK,YAAYhX,CAAW;AAC/C,aAAIgX,IACO,EAAE,MAAMA,GAAY,OAAOhX,EAAW,IAGtC;AAAA,QACH,OAAOA;AAAA,QACP,OAAO,KAAK,mBAAmBp7C,GAASo7C,CAAW;AAAA,MACvE;AAAA,IAEQ,SACOgT,GAAK;AACR,cAAQ,MAAM,mDAAmDpuD,EAAQ,UAAU,QAAQ,MAAMouD,CAAG;AACpG,YAAM9zB,IAAe8zB,EAAI,WAAW,OAAOA,CAAG;AAC9C,aAAO;AAAA,QACH,OAAO;AAAA,UACH,MAAMpuD;AAAA,UACN,SAAS,mDAAmDA,EAAQ,UAAU,QAAQ,MAAMs6B,CAAY;AAAA,QAC5H;AAAA,MACA;AAAA,IACQ;AAAA,EACJ;AAAA,EACA,YAAYq4B,GAAiB;AACzB,QAAIA,EAAgB;AAChB,aAAOA,EAAgB;AAE3B,UAAMC,IAAM,KAAK,iBAAgB,EAAG,YAAYD,EAAgB,WAAW;AAC3E,QAAKC;AAGL,aAAO,KAAK,eAAe,WAAWA,EAAI,YAAY,OAAOD,EAAgB,IAAI;AAAA,EACrF;AAAA,EACA,mBAAmB3yD,GAAS6yD,GAAmB;AAG3C,UAAM3Q,IAAWh+C,GAAalE,EAAQ,SAAS,EAAE;AACjD,IAAIkiD,KAAYA,EAAS,QAAQkP,EAAc,kBAC3C,QAAQ,KAAK,gFAAgFlP,EAAS,GAAG,IAAI;AAEjH,UAAMhiD,IAAgB,KAAK,WAAW,iBAAiBF,CAAO;AAC9D,WAAO;AAAA,MACH,MAAMA;AAAA,MACN,SAAS,kCAAkCE,CAAa,WAAWF,EAAQ,UAAU,QAAQ;AAAA,MAC7F,mBAAA6yD;AAAA,IACZ;AAAA,EACI;AACJ;ACrRO,SAASC,GAAQ1yD,GAAM;AAC1B,SAAO,OAAOA,EAAK,QAAS;AAChC;AACO,MAAM2yD,GAAoB;AAAA,EAC7B,QAAQ3yD,GAAM;AACV,QAAI0yD,GAAQ1yD,CAAI;AACZ,aAAOA,EAAK;AAAA,EAGpB;AAAA,EACA,YAAYA,GAAM;AACd,WAAO0R,GAAoB1R,EAAK,UAAU,MAAM;AAAA,EACpD;AACJ;ACPO,MAAM4yD,GAAkB;AAAA,EAC3B,YAAYr9C,GAAU;AAClB,SAAK,eAAeA,EAAS,WAAW,cACxC,KAAK,QAAQA,EAAS,OAAO,UAAU,cACvC,KAAK,cAAcA,EAAS,UAAU,gBACtC,KAAK,YAAYA,EAAS,OAAO,UAAU,kBAC3C,KAAK,oBAAoBjR,GAAUiR,EAAS,OAAO,EAAE,KAAK,CAAAvV,MAAQuG,GAAiBvG,CAAI,KAAKA,EAAK,OAAO;AAAA,EAC5G;AAAA,EACA,iBAAiB6yD,GAAe;AAC5B,QAAIA,GAAe;AACf,YAAMtgD,IAAaD,GAAeugD,CAAa,GACzCC,IAAWD,EAAc;AAC/B,UAAItgD,KAAcugD,GAAU;AACxB,cAAM9uD,IAAY8uD,EAASvgD,EAAW,OAAO;AAC7C,YAAIhT,GAAYyE,CAAS,KAAKxE,GAAiBwE,CAAS;AACpD,iBAAOD,GAAkBC,CAAS;AAEjC,YAAI,MAAM,QAAQA,CAAS;AAC5B,qBAAWqtB,KAAOrtB;AACd,iBAAKzE,GAAY8xB,CAAG,KAAK7xB,GAAiB6xB,CAAG,MAAMA,EAAI,YAChDA,EAAI,SAAS,UAAUwhC,EAAc,UACrCxhC,EAAI,SAAS,OAAOwhC,EAAc;AACrC,qBAAO9uD,GAAkBstB,CAAG;AAAA;AAAA,MAI5C;AACA,UAAIyhC,GAAU;AACV,cAAMC,IAAW,KAAK,aAAa,YAAYD,CAAQ;AAEvD,YAAIC,MAAaA,MAAaF,KAAiBtoD,GAAYsoD,GAAeE,CAAQ;AAC9E,iBAAO,KAAK,aAAaD,CAAQ;AAAA,MAEzC;AAAA,IACJ;AACA,WAAO,CAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa9yD,GAAM;AACf,QAAK,KAAK,mBAGL;AAID,YAAMgzD,IAAa,KAAK,MAAM,kBAAkBhzD,GAAM,KAAK,YAAY,eAAeA,CAAI,CAAC,GAGrFizD,IAAW,KAAK,gCAAgCD,EAAW,KAAI,CAAE;AACvE,UAAIC;AAEA,mBAAW5hC,KAAO3sB,GAAiBuuD,CAAQ;AACvC,cAAIzzD,GAAiB6xB,EAAI,SAAS,KAAKA,EAAI,UAAU,MAAM,KAAK,CAAA3uB,MAAQA,EAAK,QAAQ1C,CAAI;AAErF,mBAAOqxB,EAAI,UAAU,MAAM,IAAI,CAAA3uB,MAAQA,EAAK,GAAG;AAAA;AAI3D,aAAO,CAAC1C,CAAI;AAAA,IAChB;AApBI,aAAO,CAACA,CAAI;AAAA,EAqBpB;AAAA,EACA,gCAAgCqxB,GAAK;AACjC,QAAI,CAACA;AACD;AAEJ,UAAMmhC,IAAM,KAAK,UAAU,YAAYnhC,EAAI,SAAS;AACpD,QAAImhC;AACA,aAAO,KAAK,YAAY,WAAWA,EAAI,YAAY,OAAOnhC,EAAI,UAAU;AAAA,EAGhF;AAAA,EACA,qBAAqBwhC,GAAe;AAChC,UAAMK,IAAW,KAAK,iBAAiBL,CAAa,GAC9CM,IAAW,CAAA;AACjB,eAAW5uD,KAAW2uD,GAAU;AAC5B,YAAM7nD,IAAU,KAAK,aAAa,YAAY9G,CAAO,KAAKA,EAAQ;AAClE,MAAI8G,KACA8nD,EAAS,KAAK9nD,CAAO;AAAA,IAE7B;AACA,WAAO8nD;AAAA,EACX;AAAA,EACA,eAAeC,GAAYlwD,GAAS;AAChC,UAAMmwD,IAAO,CAAA;AACb,IAAInwD,EAAQ,sBACRmwD,EAAK,KAAK,GAAG,KAAK,kBAAkBD,CAAU,CAAC;AAEnD,QAAIE,IAAkB,KAAK,MAAM,kBAAkBF,GAAY,KAAK,YAAY,eAAeA,CAAU,CAAC;AAC1G,WAAIlwD,EAAQ,gBACRowD,IAAkBA,EAAgB,OAAO,CAAAjiC,MAAOw+B,GAAS,OAAOx+B,EAAI,WAAWnuB,EAAQ,WAAW,CAAC,IAEvGmwD,EAAK,KAAK,GAAGC,CAAe,GACrBlxD,GAAOixD,CAAI;AAAA,EACtB;AAAA,EACA,kBAAkBD,GAAY;AAC1B,UAAMG,IAAY,KAAK,aAAaH,CAAU,GACxCJ,IAAa,CAAA;AACnB,eAAWQ,KAAYD,GAAW;AAC9B,YAAMR,IAAW,KAAK,aAAa,YAAYS,CAAQ;AACvD,UAAIT,GAAU;AACV,cAAMP,IAAM3uD,GAAY2vD,CAAQ,GAC1B70D,IAAO,KAAK,YAAY,eAAe60D,CAAQ;AACrD,QAAAR,EAAW,KAAK;AAAA,UACZ,WAAWR,EAAI;AAAA,UACf,YAAY7zD;AAAA,UACZ,WAAW6zD,EAAI;AAAA,UACf,YAAY7zD;AAAA,UACZ,SAASiM,GAAkBmoD,CAAQ;AAAA,UACnC,OAAO;AAAA,QAC3B,CAAiB;AAAA,MACL;AAAA,IACJ;AACA,WAAOC;AAAA,EACX;AACJ;ACzHO,MAAMS,GAAS;AAAA,EAClB,YAAYC,GAAU;AAElB,QADA,KAAK,MAAM,oBAAI,IAAG,GACdA;AACA,iBAAW,CAAC75D,GAAKW,CAAK,KAAKk5D;AACvB,aAAK,IAAI75D,GAAKW,CAAK;AAAA,EAG/B;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,OAAO;AACP,WAAO2I,GAAU,IAAIf,GAAO,KAAK,IAAI,OAAM,CAAE,EAAE,IAAI,CAAAwwC,MAAKA,EAAE,MAAM,CAAC;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQ;AACJ,SAAK,IAAI,MAAK;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO/4C,GAAKW,GAAO;AACf,QAAIA,MAAU;AACV,aAAO,KAAK,IAAI,OAAOX,CAAG;AAEzB;AACD,YAAM0B,IAAS,KAAK,IAAI,IAAI1B,CAAG;AAC/B,UAAI0B,GAAQ;AACR,cAAMpB,IAAQoB,EAAO,QAAQf,CAAK;AAClC,YAAIL,KAAS;AACT,iBAAIoB,EAAO,WAAW,IAClB,KAAK,IAAI,OAAO1B,CAAG,IAGnB0B,EAAO,OAAOpB,GAAO,CAAC,GAEnB;AAAA,MAEf;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAIN,GAAK;AACL,WAAO,KAAK,IAAI,IAAIA,CAAG,KAAK,CAAA;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,UAAUA,GAAK;AACX,UAAM0B,IAAS,KAAK,IAAI,IAAI1B,CAAG;AAC/B,WAAO0B,IAAS6G,GAAO7G,CAAM,IAAIsH;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAIhJ,GAAKW,GAAO;AACZ,QAAIA,MAAU;AACV,aAAO,KAAK,IAAI,IAAIX,CAAG;AAEtB;AACD,YAAM0B,IAAS,KAAK,IAAI,IAAI1B,CAAG;AAC/B,aAAI0B,IACOA,EAAO,QAAQf,CAAK,KAAK,IAE7B;AAAA,IACX;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,IAAIX,GAAKW,GAAO;AACZ,WAAI,KAAK,IAAI,IAAIX,CAAG,IAChB,KAAK,IAAI,IAAIA,CAAG,EAAE,KAAKW,CAAK,IAG5B,KAAK,IAAI,IAAIX,GAAK,CAACW,CAAK,CAAC,GAEtB;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,OAAOX,GAAK0B,GAAQ;AAChB,WAAI,KAAK,IAAI,IAAI1B,CAAG,IAChB,KAAK,IAAI,IAAIA,CAAG,EAAE,KAAK,GAAG0B,CAAM,IAGhC,KAAK,IAAI,IAAI1B,GAAK,MAAM,KAAK0B,CAAM,CAAC,GAEjC;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQsG,GAAY;AAChB,SAAK,IAAI,QAAQ,CAAC7H,GAAOH,MAAQG,EAAM,QAAQ,CAAAQ,MAASqH,EAAWrH,GAAOX,GAAK,IAAI,CAAC,CAAC;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA,EAIA,CAAC,OAAO,QAAQ,IAAI;AAChB,WAAO,KAAK,QAAO,EAAG,SAAQ;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU;AACN,WAAOuI,GAAO,KAAK,IAAI,QAAO,CAAE,EAC3B,QAAQ,CAAC,CAACvI,GAAKG,CAAK,MAAMA,EAAM,IAAI,CAAAQ,MAAS,CAACX,GAAKW,CAAK,CAAC,CAAC;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO;AACH,WAAO4H,GAAO,KAAK,IAAI,KAAI,CAAE;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA,EAIA,SAAS;AACL,WAAOA,GAAO,KAAK,IAAI,OAAM,CAAE,EAAE,KAAI;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAIA,sBAAsB;AAClB,WAAOA,GAAO,KAAK,IAAI,QAAO,CAAE;AAAA,EACpC;AACJ;AACO,MAAMuxD,GAAM;AAAA,EACf,IAAI,OAAO;AACP,WAAO,KAAK,IAAI;AAAA,EACpB;AAAA,EACA,YAAYD,GAAU;AAGlB,QAFA,KAAK,MAAM,oBAAI,IAAG,GAClB,KAAK,UAAU,oBAAI,IAAG,GAClBA;AACA,iBAAW,CAAC75D,GAAKW,CAAK,KAAKk5D;AACvB,aAAK,IAAI75D,GAAKW,CAAK;AAAA,EAG/B;AAAA,EACA,QAAQ;AACJ,SAAK,IAAI,MAAK,GACd,KAAK,QAAQ,MAAK;AAAA,EACtB;AAAA,EACA,IAAIX,GAAKW,GAAO;AACZ,gBAAK,IAAI,IAAIX,GAAKW,CAAK,GACvB,KAAK,QAAQ,IAAIA,GAAOX,CAAG,GACpB;AAAA,EACX;AAAA,EACA,IAAIA,GAAK;AACL,WAAO,KAAK,IAAI,IAAIA,CAAG;AAAA,EAC3B;AAAA,EACA,OAAOW,GAAO;AACV,WAAO,KAAK,QAAQ,IAAIA,CAAK;AAAA,EACjC;AAAA,EACA,OAAOX,GAAK;AACR,UAAMW,IAAQ,KAAK,IAAI,IAAIX,CAAG;AAC9B,WAAIW,MAAU,UACV,KAAK,IAAI,OAAOX,CAAG,GACnB,KAAK,QAAQ,OAAOW,CAAK,GAClB,MAEJ;AAAA,EACX;AACJ;AC5KO,MAAMo5D,GAAwB;AAAA,EACjC,YAAYr+C,GAAU;AAClB,SAAK,eAAeA,EAAS,WAAW,cACxC,KAAK,eAAeA,EAAS,UAAU;AAAA,EAC3C;AAAA,EACA,MAAM,uBAAuBusC,GAAUuP,IAAchE,GAAAA,kBAAkB,MAAM;AACzE,WAAO,KAAK,8BAA8BvL,EAAS,YAAY,OAAOA,GAAU,QAAWuP,CAAW;AAAA,EAC1G;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,8BAA8BwC,GAAY/R,GAAU7+C,IAAWgB,IAAgBotD,IAAchE,GAAAA,kBAAkB,MAAM;AACvH,UAAMyG,IAAU,CAAA;AAChB,SAAK,kBAAkBD,GAAYC,GAAShS,CAAQ;AACpD,eAAW9hD,KAAQiD,EAAS4wD,CAAU;AAClC,YAAM5F,GAAkBoD,CAAW,GACnC,KAAK,kBAAkBrxD,GAAM8zD,GAAShS,CAAQ;AAElD,WAAOgS;AAAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,kBAAkB9zD,GAAM8zD,GAAShS,GAAU;AACvC,UAAMp+C,IAAO,KAAK,aAAa,QAAQ1D,CAAI;AAC3C,IAAI0D,KACAowD,EAAQ,KAAK,KAAK,aAAa,kBAAkB9zD,GAAM0D,GAAMo+C,CAAQ,CAAC;AAAA,EAE9E;AAAA;AAAA,EAEA,MAAM,oBAAoBA,GAAUuP,IAAchE,GAAAA,kBAAkB,MAAM;AACtE,UAAM0G,IAAWjS,EAAS,YAAY,OAChCkS,IAAU,IAAIP,GAAQ;AAE5B,eAAWzzD,KAAQqE,GAAkB0vD,CAAQ;AACzC,YAAM9F,GAAkBoD,CAAW,GACnC,KAAK,eAAerxD,GAAM8hD,GAAUkS,CAAO;AAE/C,WAAOA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAeh0D,GAAM8hD,GAAUkS,GAAS;AACpC,UAAMC,IAAYj0D,EAAK;AACvB,QAAIi0D,GAAW;AACX,YAAMvwD,IAAO,KAAK,aAAa,QAAQ1D,CAAI;AAC3C,MAAI0D,KACAswD,EAAQ,IAAIC,GAAW,KAAK,aAAa,kBAAkBj0D,GAAM0D,GAAMo+C,CAAQ,CAAC;AAAA,IAExF;AAAA,EACJ;AACJ;ACzEO,MAAMoS,GAAY;AAAA,EACrB,YAAYR,GAAUS,GAAYjxD,GAAS;AACvC,SAAK,WAAWwwD,GAChB,KAAK,aAAaS,GAClB,KAAK,kBAAkBjxD,GAAS,mBAAmB,IACnD,KAAK,mBAAmBA,GAAS,oBAAoB;AAAA,EACzD;AAAA,EACA,iBAAiB;AACb,WAAI,KAAK,aACE,KAAK,SAAS,OAAO,KAAK,WAAW,gBAAgB,IAGrD,KAAK;AAAA,EAEpB;AAAA,EACA,WAAWQ,GAAM;AACb,UAAM0wD,IAAgB,KAAK,kBAAkB1wD,EAAK,YAAW,IAAKA,GAC5D2wD,IAAQ,KAAK,kBACb,KAAK,SAAS,KAAK,CAAA1xD,MAAKA,EAAE,KAAK,YAAW,MAAOyxD,CAAa,IAC9D,KAAK,SAAS,KAAK,CAAAzxD,MAAKA,EAAE,SAASe,CAAI;AAC7C,QAAI2wD;AACA,aAAOA;AAEX,QAAI,KAAK;AACL,aAAO,KAAK,WAAW,WAAW3wD,CAAI;AAAA,EAG9C;AAAA,EACA,YAAYA,GAAM;AACd,UAAM0wD,IAAgB,KAAK,kBAAkB1wD,EAAK,YAAW,IAAKA,GAC5D2wD,IAAQ,KAAK,kBACb,KAAK,SAAS,OAAO,CAAA1xD,MAAKA,EAAE,KAAK,YAAW,MAAOyxD,CAAa,IAChE,KAAK,SAAS,OAAO,CAAAzxD,MAAKA,EAAE,SAASe,CAAI;AAC/C,YAAK,KAAK,oBAAoB2wD,EAAM,QAAO,MAAO,KAAK,aAC5CA,EAAM,OAAO,KAAK,WAAW,YAAY3wD,CAAI,CAAC,IAG9C2wD;AAAA,EAEf;AACJ;AA4CO,MAAMC,GAAc;AAAA,EACvB,YAAYZ,GAAUS,GAAYjxD,GAAS;AACvC,SAAK,WAAW,IAAIuwD,GAAQ,GAC5B,KAAK,kBAAkBvwD,GAAS,mBAAmB,IACnD,KAAK,mBAAmBA,GAAS,oBAAoB;AACrD,eAAW7B,KAAWqyD,GAAU;AAC5B,YAAMhwD,IAAO,KAAK,kBACZrC,EAAQ,KAAK,YAAW,IACxBA,EAAQ;AACd,WAAK,SAAS,IAAIqC,GAAMrC,CAAO;AAAA,IACnC;AACA,SAAK,aAAa8yD;AAAA,EACtB;AAAA,EACA,WAAWzwD,GAAM;AACb,UAAM6wD,IAAY,KAAK,kBAAkB7wD,EAAK,YAAW,IAAKA,GACxD2wD,IAAQ,KAAK,SAAS,IAAIE,CAAS,EAAE,CAAC;AAC5C,QAAIF;AACA,aAAOA;AAEX,QAAI,KAAK;AACL,aAAO,KAAK,WAAW,WAAW3wD,CAAI;AAAA,EAG9C;AAAA,EACA,YAAYA,GAAM;AACd,UAAM6wD,IAAY,KAAK,kBAAkB7wD,EAAK,YAAW,IAAKA,GACxD2wD,IAAQ,KAAK,SAAS,IAAIE,CAAS;AACzC,YAAK,KAAK,oBAAoBF,EAAM,WAAW,MAAM,KAAK,aAC/CjyD,GAAOiyD,CAAK,EAAE,OAAO,KAAK,WAAW,YAAY3wD,CAAI,CAAC,IAGtDtB,GAAOiyD,CAAK;AAAA,EAE3B;AAAA,EACA,iBAAiB;AACb,QAAIG,IAAgBpyD,GAAO,KAAK,SAAS,OAAM,CAAE;AACjD,WAAI,KAAK,eACLoyD,IAAgBA,EAAc,OAAO,KAAK,WAAW,eAAc,CAAE,IAElEA;AAAA,EACX;AACJ;ACpIO,MAAMC,GAAgB;AAAA,EACzB,cAAc;AACV,SAAK,YAAY,CAAA,GACjB,KAAK,aAAa;AAAA,EACtB;AAAA,EACA,UAAUC,GAAY;AAClB,SAAK,UAAU,KAAKA,CAAU;AAAA,EAClC;AAAA,EACA,UAAU;AACN,SAAK,gBAAe,GACpB,KAAK,MAAK,GACV,KAAK,aAAa,IAClB,KAAK,UAAU,QAAQ,CAAAA,MAAcA,EAAW,QAAO,CAAE;AAAA,EAC7D;AAAA,EACA,kBAAkB;AACd,QAAI,KAAK;AACL,YAAM,IAAI,MAAM,sCAAsC;AAAA,EAE9D;AACJ;AACO,MAAMC,WAAoBF,GAAgB;AAAA,EAC7C,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,QAAQ,oBAAI,IAAG;AAAA,EACxB;AAAA,EACA,IAAI56D,GAAK;AACL,gBAAK,gBAAe,GACb,KAAK,MAAM,IAAIA,CAAG;AAAA,EAC7B;AAAA,EACA,IAAIA,GAAKW,GAAO;AACZ,SAAK,gBAAe,GACpB,KAAK,MAAM,IAAIX,GAAKW,CAAK;AAAA,EAC7B;AAAA,EACA,IAAIX,GAAK+6D,GAAU;AAEf,QADA,KAAK,gBAAe,GAChB,KAAK,MAAM,IAAI/6D,CAAG;AAClB,aAAO,KAAK,MAAM,IAAIA,CAAG;AAExB,QAAI+6D,GAAU;AACf,YAAMp6D,IAAQo6D,EAAQ;AACtB,kBAAK,MAAM,IAAI/6D,GAAKW,CAAK,GAClBA;AAAA,IACX;AAEI;AAAA,EAER;AAAA,EACA,OAAOX,GAAK;AACR,gBAAK,gBAAe,GACb,KAAK,MAAM,OAAOA,CAAG;AAAA,EAChC;AAAA,EACA,QAAQ;AACJ,SAAK,gBAAe,GACpB,KAAK,MAAM,MAAK;AAAA,EACpB;AACJ;AACO,MAAMg7D,WAAqBJ,GAAgB;AAAA,EAC9C,YAAYK,GAAW;AACnB,UAAK,GACL,KAAK,QAAQ,oBAAI,IAAG,GACpB,KAAK,YAAYA,MAAc,CAAAt6D,MAASA;AAAA,EAC5C;AAAA,EACA,IAAIu6D,GAAYl7D,GAAK;AACjB,gBAAK,gBAAe,GACb,KAAK,gBAAgBk7D,CAAU,EAAE,IAAIl7D,CAAG;AAAA,EACnD;AAAA,EACA,IAAIk7D,GAAYl7D,GAAKW,GAAO;AACxB,SAAK,gBAAe,GACpB,KAAK,gBAAgBu6D,CAAU,EAAE,IAAIl7D,GAAKW,CAAK;AAAA,EACnD;AAAA,EACA,IAAIu6D,GAAYl7D,GAAK+6D,GAAU;AAC3B,SAAK,gBAAe;AACpB,UAAMI,IAAe,KAAK,gBAAgBD,CAAU;AACpD,QAAIC,EAAa,IAAIn7D,CAAG;AACpB,aAAOm7D,EAAa,IAAIn7D,CAAG;AAE1B,QAAI+6D,GAAU;AACf,YAAMp6D,IAAQo6D,EAAQ;AACtB,aAAAI,EAAa,IAAIn7D,GAAKW,CAAK,GACpBA;AAAA,IACX;AAEI;AAAA,EAER;AAAA,EACA,OAAOu6D,GAAYl7D,GAAK;AACpB,gBAAK,gBAAe,GACb,KAAK,gBAAgBk7D,CAAU,EAAE,OAAOl7D,CAAG;AAAA,EACtD;AAAA,EACA,MAAMk7D,GAAY;AAEd,QADA,KAAK,gBAAe,GAChBA,GAAY;AACZ,YAAMte,IAAS,KAAK,UAAUse,CAAU;AACxC,WAAK,MAAM,OAAOte,CAAM;AAAA,IAC5B;AAEI,WAAK,MAAM,MAAK;AAAA,EAExB;AAAA,EACA,gBAAgBse,GAAY;AACxB,UAAMte,IAAS,KAAK,UAAUse,CAAU;AACxC,QAAIE,IAAgB,KAAK,MAAM,IAAIxe,CAAM;AACzC,WAAKwe,MACDA,IAAgB,oBAAI,IAAG,GACvB,KAAK,MAAM,IAAIxe,GAAQwe,CAAa,IAEjCA;AAAA,EACX;AACJ;AA4CO,MAAMC,WAAuBP,GAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS5C,YAAYQ,GAAgB5zD,GAAO;AAC/B,UAAK,GACDA,KACA,KAAK,UAAU,KAAK4zD,EAAe,UAAU,gBAAgB,aAAa5zD,GAAO,MAAM;AACnF,WAAK,MAAK;AAAA,IACd,CAAC,CAAC,GACF,KAAK,UAAU,KAAK4zD,EAAe,UAAU,gBAAgB,SAAS,CAACC,GAAUC,MAAY;AACzF,MAAIA,EAAQ,SAAS,KACjB,KAAK,MAAK;AAAA,IAElB,CAAC,CAAC,KAGF,KAAK,UAAU,KAAKF,EAAe,UAAU,gBAAgB,SAAS,MAAM;AACxE,WAAK,MAAK;AAAA,IACd,CAAC,CAAC;AAAA,EAEV;AACJ;AC/KO,MAAMG,GAAqB;AAAA,EAC9B,YAAY//C,GAAU;AAClB,SAAK,aAAaA,EAAS,OAAO,eAClC,KAAK,eAAeA,EAAS,WAAW,cACxC,KAAK,eAAeA,EAAS,UAAU,4BACvC,KAAK,eAAeA,EAAS,OAAO,UAAU,cAC9C,KAAK,mBAAmB,IAAI2/C,GAAe3/C,EAAS,MAAM;AAAA,EAC9D;AAAA,EACA,SAAS+2C,GAAS;AACd,UAAMiJ,IAAS,CAAA,GACTz1D,IAAgB,KAAK,WAAW,iBAAiBwsD,CAAO,GACxDkJ,IAAe3xD,GAAYyoD,EAAQ,SAAS,EAAE;AACpD,QAAIkJ,GAAc;AACd,UAAIC,IAAcnJ,EAAQ;AAC1B;AACI,QAAIkJ,EAAa,IAAIC,CAAW,KAC5BF,EAAO,KAAKC,EAAa,UAAUC,CAAW,EAAE,OAAO,CAAAvD,MAAQ,KAAK,WAAW,UAAUA,EAAK,MAAMpyD,CAAa,CAAC,CAAC,GAEvH21D,IAAcA,EAAY;AAAA,aACrBA;AAAA,IACb;AACA,QAAIp7D,IAAS,KAAK,eAAeyF,GAAewsD,CAAO;AACvD,aAAShqD,IAAIizD,EAAO,SAAS,GAAGjzD,KAAK,GAAGA;AACpC,MAAAjI,IAAS,KAAK,YAAYk7D,EAAOjzD,CAAC,GAAGjI,CAAM;AAE/C,WAAOA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,YAAYq5D,GAAUS,GAAYjxD,GAAS;AACvC,WAAO,IAAIgxD,GAAY9xD,GAAOsxD,CAAQ,GAAGS,GAAYjxD,CAAO;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoBwwD,GAAUS,GAAYjxD,GAAS;AAC/C,UAAM7C,IAAI+B,GAAOsxD,CAAQ,EAAE,IAAI,CAAA/wD,MAAK;AAChC,YAAMe,IAAO,KAAK,aAAa,QAAQf,CAAC;AACxC,UAAIe;AACA,eAAO,KAAK,aAAa,kBAAkBf,GAAGe,CAAI;AAAA,IAG1D,CAAC,EAAE,YAAW;AACd,WAAO,IAAIwwD,GAAY7zD,GAAG8zD,GAAYjxD,CAAO;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA,EAIA,eAAepD,GAAe41D,GAAU;AACpC,WAAO,KAAK,iBAAiB,IAAI51D,GAAe,MAAM,IAAIw0D,GAAc,KAAK,aAAa,YAAYx0D,CAAa,CAAC,CAAC;AAAA,EACzH;AACJ;ACrDO,SAAS61D,GAAqB31D,GAAM;AACvC,SAAO,OAAOA,EAAK,YAAa;AACpC;AACA,SAAS41D,GAAwBt2D,GAAK;AAClC,SAAO,OAAOA,KAAQ,YAAY,CAAC,CAACA,MAAQ,UAAUA,KAAO,YAAYA;AAC7E;AACO,MAAMu2D,GAAsB;AAAA,EAC/B,YAAYtgD,GAAU;AAElB,SAAK,mBAAmB,oBAAI,IAAI,CAAC,cAAc,sBAAsB,mBAAmB,aAAa,UAAU,CAAC,GAChH,KAAK,mBAAmBA,EAAS,OAAO,UAAU,kBAClD,KAAK,iBAAiBA,EAAS,UAAU,gBACzC,KAAK,eAAeA,EAAS,WAAW,cACxC,KAAK,kBAAkBA,EAAS,cAAc;AAAA,EAClD;AAAA,EACA,UAAUvV,GAAMkD,GAAS;AACrB,UAAM4yD,IAAmB5yD,KAAW,CAAA,GAC9B6yD,IAAmB7yD,GAAS,UAC5B8yD,IAAkB,CAACn8D,GAAKW,MAAU,KAAK,SAASX,GAAKW,GAAOs7D,CAAgB,GAC5EG,IAAWF,IAAmB,CAACl8D,GAAKW,MAAUu7D,EAAiBl8D,GAAKW,GAAOw7D,CAAe,IAAIA;AACpG,QAAI;AACA,kBAAK,kBAAkBnyD,GAAY7D,CAAI,GAChC,KAAK,UAAUA,GAAMi2D,GAAU/yD,GAAS,KAAK;AAAA,IACxD,UACR;AACY,WAAK,kBAAkB;AAAA,IAC3B;AAAA,EACJ;AAAA,EACA,YAAYy+C,GAASz+C,GAAS;AAC1B,UAAMgzD,IAAqBhzD,KAAW,CAAA,GAChCF,IAAO,KAAK,MAAM2+C,CAAO;AAC/B,gBAAK,SAAS3+C,GAAMA,GAAMkzD,CAAkB,GACrClzD;AAAA,EACX;AAAA,EACA,SAASnJ,GAAKW,GAAO,EAAE,SAAA43D,GAAS,YAAA+D,GAAY,aAAAC,GAAa,UAAAC,GAAU,cAAAC,KAAgB;AAC/E,QAAI,MAAK,iBAAiB,IAAIz8D,CAAG;AAG5B,UAAI0F,GAAY/E,CAAK,GAAG;AACzB,cAAM+7D,IAAW/7D,EAAM,KACjBg8D,IAAWpE,IAAU53D,EAAM,WAAW;AAC5C,YAAI+7D,GAAU;AACV,gBAAME,IAAiB5yD,GAAY0yD,CAAQ;AAC3C,cAAI/d,IAAY;AAChB,UAAI,KAAK,mBAAmB,KAAK,oBAAoBie,MAC7CH,IACA9d,IAAY8d,EAAaG,EAAe,KAAKF,CAAQ,IAGrD/d,IAAYie,EAAe,IAAI,SAAQ;AAG/C,gBAAMv3B,IAAa,KAAK,eAAe,eAAeq3B,CAAQ;AAC9D,iBAAO;AAAA,YACH,MAAM,GAAG/d,CAAS,IAAItZ,CAAU;AAAA,YAChC,UAAAs3B;AAAA,UACpB;AAAA,QACY;AAEI,iBAAO;AAAA,YACH,QAAQh8D,EAAM,OAAO,WAAW;AAAA,YAChC,UAAAg8D;AAAA,UACpB;AAAA,MAEQ,WACSh3D,GAAiBhF,CAAK,GAAG;AAC9B,cAAMg8D,IAAWpE,IAAU53D,EAAM,WAAW,QACtCk8D,IAAQ,CAAA;AACd,mBAAWh0D,KAAQlI,EAAM,OAAO;AAC5B,gBAAM+7D,IAAW7zD,EAAK,KAChB+zD,IAAiB5yD,GAAYnB,EAAK,GAAG;AAC3C,cAAI81C,IAAY;AAChB,UAAI,KAAK,mBAAmB,KAAK,oBAAoBie,MAC7CH,IACA9d,IAAY8d,EAAaG,EAAe,KAAKF,CAAQ,IAGrD/d,IAAYie,EAAe,IAAI,SAAQ;AAG/C,gBAAMv3B,IAAa,KAAK,eAAe,eAAeq3B,CAAQ;AAC9D,UAAAG,EAAM,KAAK,GAAGle,CAAS,IAAItZ,CAAU,EAAE;AAAA,QAC3C;AACA,eAAO;AAAA,UACH,OAAAw3B;AAAA,UACA,UAAAF;AAAA,QAChB;AAAA,MACQ,WACSn3D,GAAU7E,CAAK,GAAG;AACvB,YAAI+J;AAYJ,YAXI6xD,MACA7xD,IAAU,KAAK,kCAAkC,EAAE,GAAG/J,EAAK,CAAE,IACxD,CAACX,KAAOW,EAAM,cAAc+J,GAAS,gBAEtCA,EAAQ,YAAY,cAAc,KAAK,iBAAiB,IAAI,SAAQ,KAGxE4xD,KAAc,CAACt8D,MACf0K,MAAYA,IAAU,EAAE,GAAG/J,MAC3B+J,EAAQ,cAAc/J,EAAM,UAAU,OAEtC67D,GAAU;AACV,UAAA9xD,MAAYA,IAAU,EAAE,GAAG/J;AAC3B,gBAAMm8D,IAAU,KAAK,gBAAgB,WAAWn8D,CAAK;AACrD,UAAIm8D,MACApyD,EAAQ,WAAWoyD,EAAQ,QAAQ,OAAO,EAAE;AAAA,QAEpD;AACA,eAAOpyD,KAAW/J;AAAA,MACtB;AAEI,eAAOA;AAAA,EAEf;AAAA,EACA,kCAAkCwF,GAAM;AACpC,UAAM42D,IAAwB,CAAAvrD,OAAY;AAAA,MACtC,QAAQA,EAAQ;AAAA,MAChB,KAAKA,EAAQ;AAAA,MACb,QAAQA,EAAQ;AAAA,MAChB,OAAOA,EAAQ;AAAA,IAC3B;AACQ,QAAIrL,EAAK,UAAU;AACf,YAAM62D,IAAa72D,EAAK,cAAc42D,EAAsB52D,EAAK,QAAQ,GACnE82D,IAAcD,EAAW,cAAc,CAAA;AAC7C,oBAAO,KAAK72D,CAAI,EAAE,OAAO,CAAAnG,MAAO,CAACA,EAAI,WAAW,GAAG,CAAC,EAAE,QAAQ,CAAAA,MAAO;AACjE,cAAMk9D,IAAsBvlD,GAAqBxR,EAAK,UAAUnG,CAAG,EAAE,IAAI+8D,CAAqB;AAC9F,QAAIG,EAAoB,WAAW,MAC/BD,EAAYj9D,CAAG,IAAIk9D;AAAA,MAE3B,CAAC,GACM/2D;AAAA,IACX;AAAA,EAEJ;AAAA,EACA,SAASA,GAAMgD,GAAME,GAAS+wD,GAAW+C,GAAmBC,GAAgB;AACxE,eAAW,CAACC,GAAcx0D,CAAI,KAAK,OAAO,QAAQ1C,CAAI;AAClD,UAAI,MAAM,QAAQ0C,CAAI;AAClB,iBAASvI,IAAQ,GAAGA,IAAQuI,EAAK,QAAQvI,KAAS;AAC9C,gBAAMkH,IAAUqB,EAAKvI,CAAK;AAC1B,UAAIy7D,GAAwBv0D,CAAO,IAC/BqB,EAAKvI,CAAK,IAAI,KAAK,gBAAgB6F,GAAMk3D,GAAcl0D,GAAM3B,GAAS6B,CAAO,IAExE7D,GAAUgC,CAAO,KACtB,KAAK,SAASA,GAAS2B,GAAME,GAASlD,GAAMk3D,GAAc/8D,CAAK;AAAA,QAEvE;AAAA,UAEC,CAAIy7D,GAAwBlzD,CAAI,IACjC1C,EAAKk3D,CAAY,IAAI,KAAK,gBAAgBl3D,GAAMk3D,GAAcl0D,GAAMN,GAAMQ,CAAO,IAE5E7D,GAAUqD,CAAI,KACnB,KAAK,SAASA,GAAMM,GAAME,GAASlD,GAAMk3D,CAAY;AAG7D,UAAMC,IAAUn3D;AAChB,IAAAm3D,EAAQ,aAAalD,GACrBkD,EAAQ,qBAAqBH,GAC7BG,EAAQ,kBAAkBF;AAAA,EAC9B;AAAA,EACA,gBAAgBhD,GAAW9vD,GAAUnB,GAAMgB,GAAWd,GAAS;AAC3D,QAAIkvD,IAAUpuD,EAAU,UACpB2lB,IAAQ3lB,EAAU,QAClBqtB;AACJ,QAAIrtB,EAAU,MAAM;AAChB,YAAMmuD,IAAU,KAAK,WAAWnvD,GAAMgB,EAAU,MAAMd,EAAQ,YAAY;AAC1E,UAAI7D,GAAU8yD,CAAO;AACjB,eAAKC,MACDA,IAAU,KAAK,aAAa,QAAQD,CAAO,IAExC;AAAA,UACH,UAAUC,KAAW;AAAA,UACrB,KAAKD;AAAA,QACzB;AAGgB,MAAAxoC,IAAQwoC;AAAA,IAEhB,WACSnuD,EAAU,OAAO;AACtB,YAAMqvD,IAAO,CAAA;AACb,iBAAW+D,KAAUpzD,EAAU,OAAO;AAClC,cAAMmuD,IAAU,KAAK,WAAWnvD,GAAMo0D,GAAQl0D,EAAQ,YAAY;AAClE,QAAI7D,GAAU8yD,CAAO,KACjBkB,EAAK,KAAK,EAAE,KAAKlB,EAAO,CAAE;AAAA,MAElC;AACA,UAAIkB,EAAK,WAAW;AAChB,QAAAhiC,IAAM;AAAA,UACF,UAAU+gC,KAAW;AAAA,UACrB,OAAOiB;AAAA,QAC3B,GACgB1pC,MAAUA,IAAQ;AAAA;AAGlB,eAAO;AAAA,UACH,UAAUyoC,KAAW;AAAA,UACrB,OAAOiB;AAAA,QAC3B;AAAA,IAEQ;AACA,QAAI1pC;AACA,aAAA0H,MAAQA,IAAM;AAAA,QACV,UAAU+gC,KAAW;AAAA,QACrB,KAAK;AAAA,MACrB,IACY/gC,EAAI,QAAQ;AAAA,QACR,MAAM;AAAA,UACF,WAAA4iC;AAAA,UACA,UAAA9vD;AAAA,UACA,WAAWktB;AAAA,QAC/B;AAAA,QACgB,SAAS1H;AAAA,MACzB,GACmB0H;AAAA,EAKf;AAAA,EACA,WAAWruB,GAAMs1C,GAAKge,GAAc;AAChC,QAAI;AACA,YAAMe,IAAgB/e,EAAI,QAAQ,GAAG;AACrC,UAAI+e,MAAkB,GAAG;AACrB,cAAMr3D,IAAO,KAAK,eAAe,WAAWgD,GAAMs1C,EAAI,UAAU,CAAC,CAAC;AAClE,eAAKt4C,KACM,6BAA6Bs4C;AAAA,MAG5C;AACA,UAAI+e,IAAgB,GAAG;AACnB,cAAMC,IAAchB,IAAeA,EAAahe,CAAG,IAAId,GAAI,MAAMc,CAAG,GAC9DwJ,IAAW,KAAK,iBAAiB,YAAYwV,CAAW;AAC9D,eAAKxV,IAGEA,EAAS,YAAY,QAFjB,sCAAsCxJ;AAAA,MAGrD;AACA,YAAMgf,IAAchB,IAAeA,EAAahe,EAAI,UAAU,GAAG+e,CAAa,CAAC,IAAI7f,GAAI,MAAMc,EAAI,UAAU,GAAG+e,CAAa,CAAC,GACtHvV,IAAW,KAAK,iBAAiB,YAAYwV,CAAW;AAC9D,UAAI,CAACxV;AACD,eAAO,sCAAsCxJ;AAEjD,UAAI+e,MAAkB/e,EAAI,SAAS;AAC/B,eAAOwJ,EAAS,YAAY;AAEhC,YAAM9hD,IAAO,KAAK,eAAe,WAAW8hD,EAAS,YAAY,OAAOxJ,EAAI,UAAU+e,IAAgB,CAAC,CAAC;AACxG,aAAKr3D,KACM,4BAA4Bs4C;AAAA,IAG3C,SACO0V,GAAK;AACR,aAAO,OAAOA,CAAG;AAAA,IACrB;AAAA,EACJ;AACJ;AC/PO,MAAMuJ,GAAuB;AAAA;AAAA;AAAA;AAAA,EAIhC,IAAI,MAAM;AACN,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,YAAYhiD,GAAU;AAClB,SAAK,gBAAgB,oBAAI,IAAG,GAC5B,KAAK,mBAAmB,oBAAI,IAAG,GAC/B,KAAK,cAAc,oBAAI,IAAG,GAC1B,KAAK,gBAAgBA,GAAU,UAAU;AAAA,EAC7C;AAAA,EACA,SAASiiD,GAAU;AACf,UAAM/X,IAAO+X,EAAS;AACtB,eAAWC,KAAOhY,EAAK;AACnB,MAAI,KAAK,iBAAiB,IAAIgY,CAAG,KAC7B,QAAQ,KAAK,sBAAsBA,CAAG,0DAA0DhY,EAAK,UAAU,IAAI,GAEvH,KAAK,iBAAiB,IAAIgY,GAAKD,CAAQ;AAE3C,QAAI/X,EAAK;AACL,iBAAW/7C,KAAQ+7C,EAAK;AACpB,QAAI,KAAK,YAAY,IAAI/7C,CAAI,KACzB,QAAQ,KAAK,iBAAiBA,CAAI,0DAA0D+7C,EAAK,UAAU,IAAI,GAEnH,KAAK,YAAY,IAAI/7C,GAAM8zD,CAAQ;AAG3C,SAAK,cAAc,IAAI/X,EAAK,YAAY+X,CAAQ;AAAA,EACpD;AAAA,EACA,YAAYlf,GAAK;AACb,QAAI,KAAK,cAAc,SAAS;AAC5B,YAAM,IAAI,MAAM,uFAAuF;AAE3G,UAAM0E,IAAa,KAAK,eAAe,IAAI1E,CAAG,GAAG;AACjD,QAAI0E,MAAe,QAAW;AAC1B,YAAMznC,IAAW,KAAK,cAAc,IAAIynC,CAAU;AAClD,UAAIznC;AACA,eAAOA;AAAA,IAEf;AACA,UAAMkiD,IAAM5H,GAAS,QAAQvX,CAAG,GAC1B50C,IAAOmsD,GAAS,SAASvX,CAAG,GAC5B/iC,IAAW,KAAK,YAAY,IAAI7R,CAAI,KAAK,KAAK,iBAAiB,IAAI+zD,CAAG;AAC5E,QAAI,CAACliD;AACD,YAAIynC,IACM,IAAI,MAAM,gEAAgEya,CAAG,mBAAmBza,CAAU,IAAI,IAG9G,IAAI,MAAM,gEAAgEya,CAAG,IAAI;AAG/F,WAAOliD;AAAA,EACX;AAAA,EACA,YAAY+iC,GAAK;AACb,QAAI;AACA,kBAAK,YAAYA,CAAG,GACb;AAAA,IACX,QACM;AACF,aAAO;AAAA,IACX;AAAA,EACJ;AAAA,EACA,IAAI,MAAM;AACN,WAAO,MAAM,KAAK,KAAK,cAAc,OAAM,CAAE;AAAA,EACjD;AACJ;AChEO,SAASof,GAAet7C,GAAM;AACjC,SAAO,EAAE,MAAAA,EAAI;AACjB;AACO,IAAIu7C;AAAA,CACV,SAAUA,GAAoB;AAC3B,EAAAA,EAAmB,WAAW,CAAC,QAAQ,QAAQ,UAAU,GAKzDA,EAAmB,MAAMA,EAAmB;AAChD,GAAGA,OAAuBA,KAAqB,CAAA,EAAG;AAI3C,MAAMC,GAAmB;AAAA,EAC5B,YAAYriD,GAAU;AAClB,SAAK,UAAU,IAAIk+C,GAAQ,GAC3B,KAAK,kBAAkB,IAAI,IAAIkE,GAAmB,QAAQ,GAC1D,KAAK,gBAAgB,CAAA,GACrB,KAAK,eAAe,CAAA,GACpB,KAAK,aAAapiD,EAAS,OAAO;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAASsiD,GAAcC,IAAU,MAAMC,IAAW,QAAQ;AACtD,QAAIA,MAAa;AACb,YAAM,IAAI,MAAM,2EAA2E;AAE/F,SAAK,gBAAgB,IAAIA,CAAQ;AACjC,eAAW,CAACh4D,GAAM2iD,CAAE,KAAK,OAAO,QAAQmV,CAAY,GAAG;AACnD,YAAMnL,IAAYhK;AAClB,UAAI,MAAM,QAAQgK,CAAS;AACvB,mBAAWnJ,KAASmJ,GAAW;AAC3B,gBAAM3a,IAAQ;AAAA,YACV,OAAO,KAAK,wBAAwBwR,GAAOuU,CAAO;AAAA,YAClD,UAAAC;AAAA,UACxB;AACoB,eAAK,SAASh4D,GAAMgyC,CAAK;AAAA,QAC7B;AAAA,eAEK,OAAO2a,KAAc,YAAY;AACtC,cAAM3a,IAAQ;AAAA,UACV,OAAO,KAAK,wBAAwB2a,GAAWoL,CAAO;AAAA,UACtD,UAAAC;AAAA,QACpB;AACgB,aAAK,SAASh4D,GAAMgyC,CAAK;AAAA,MAC7B;AAEI,QAAAjmC,GAA2B;AAAA,IAEnC;AAAA,EACJ;AAAA,EACA,wBAAwBy3C,GAAOuU,GAAS;AACpC,WAAO,OAAO93D,GAAMg4D,GAAQ3G,MAAgB;AACxC,YAAM,KAAK,gBAAgB,MAAM9N,EAAM,KAAKuU,GAAS93D,GAAMg4D,GAAQ3G,CAAW,GAAG,uCAAuC2G,GAAQh4D,CAAI;AAAA,IACxI;AAAA,EACJ;AAAA,EACA,MAAM,gBAAgBi4D,GAAeC,GAAgBF,GAAQh4D,GAAM;AAC/D,QAAI;AACA,YAAMi4D,EAAa;AAAA,IACvB,SACOjK,GAAK;AACR,UAAID,GAAqBC,CAAG;AACxB,cAAMA;AAEV,cAAQ,MAAM,GAAGkK,CAAc,KAAKlK,CAAG,GACnCA,aAAe,SAASA,EAAI,SAC5B,QAAQ,MAAMA,EAAI,KAAK;AAE3B,YAAMmK,IAAiBnK,aAAe,QAAQA,EAAI,UAAU,OAAOA,CAAG;AACtE,MAAAgK,EAAO,SAAS,GAAGE,CAAc,KAAKC,CAAc,IAAI,EAAE,MAAAn4D,GAAM;AAAA,IACpE;AAAA,EACJ;AAAA,EACA,SAASD,GAAMgyC,GAAO;AAClB,QAAIhyC,MAAS,WAAW;AACpB,WAAK,QAAQ,IAAI,WAAWgyC,CAAK;AACjC;AAAA,IACJ;AACA,eAAW9xC,KAAW,KAAK,WAAW,eAAeF,CAAI;AACrD,WAAK,QAAQ,IAAIE,GAAS8xC,CAAK;AAAA,EAEvC;AAAA,EACA,UAAUhyC,GAAM0nB,GAAY;AACxB,QAAI2wC,IAASh2D,GAAO,KAAK,QAAQ,IAAIrC,CAAI,CAAC,EACrC,OAAO,KAAK,QAAQ,IAAI,SAAS,CAAC;AACvC,WAAI0nB,MACA2wC,IAASA,EAAO,OAAO,CAAArmB,MAAStqB,EAAW,SAASsqB,EAAM,QAAQ,CAAC,IAEhEqmB,EAAO,IAAI,CAAArmB,MAASA,EAAM,KAAK;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,uBAAuBsmB,GAAaP,IAAU,MAAM;AAChD,SAAK,cAAc,KAAK,KAAK,yBAAyBO,GAAa,qDAAqDP,CAAO,CAAC;AAAA,EACpI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,sBAAsBQ,GAAYR,IAAU,MAAM;AAC9C,SAAK,aAAa,KAAK,KAAK,yBAAyBQ,GAAY,wDAAwDR,CAAO,CAAC;AAAA,EACrI;AAAA,EACA,yBAAyBvU,GAAO2U,GAAgBJ,GAAS;AACrD,WAAO,OAAO/D,GAAUiE,GAAQvwC,GAAY4pC,MAAgB;AACxD,YAAM,KAAK,gBAAgB,MAAM9N,EAAM,KAAKuU,GAAS/D,GAAUiE,GAAQvwC,GAAY4pC,CAAW,GAAG6G,GAAgBF,GAAQjE,CAAQ;AAAA,IACrI;AAAA,EACJ;AAAA,EACA,IAAI,eAAe;AACf,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,cAAc;AACd,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,2BAA2BwE,GAAW;AAClC,WAAO,KAAK;AAAA,EAChB;AACJ;ACtJO,MAAMC,KAAqB,OAAO,OAAO;AAAA,EAC5C,cAAc;AAAA,EACd,kBAAkB;AACtB,CAAC;AACM,MAAMC,GAAyB;AAAA,EAClC,YAAYljD,GAAU;AAClB,SAAK,qBAAqBA,EAAS,WAAW,oBAC9C,KAAK,WAAWA,EAAS,kBACzB,KAAK,WAAWA,EAAS,OAAO,UAAU,iBAC1C,KAAK,aAAaA,EAAS,iBAAiB;AAAA,EAChD;AAAA,EACA,MAAM,iBAAiBusC,GAAU5+C,IAAU,CAAA,GAAImuD,IAAchE,GAAAA,kBAAkB,MAAM;AACjF,UAAM+D,IAActP,EAAS,aACvB5C,IAAc,CAAA;AAEpB,QADA,MAAM+O,GAAkBoD,CAAW,IAC/B,CAACnuD,EAAQ,cAAcA,EAAQ,WAAW,SAAS,UAAU,OAC7D,KAAK,oBAAoBkuD,GAAalS,GAAah8C,CAAO,GACtDA,EAAQ,yBAAyBg8C,EAAY,KAAK,CAAAlK,MAAKA,EAAE,MAAM,SAAS0jB,GAAkB,WAAW,MAGzG,KAAK,qBAAqBtH,GAAalS,GAAah8C,CAAO,GACvDA,EAAQ,0BAA0Bg8C,EAAY,KAAK,CAAAlK,MAAKA,EAAE,MAAM,SAAS0jB,GAAkB,YAAY,OAG3G,KAAK,qBAAqB5W,GAAU5C,GAAah8C,CAAO,GACpDA,EAAQ,0BAA0Bg8C,EAAY,KAAK,CAAAlK,MAAKA,EAAE,MAAM,SAAS0jB,GAAkB,YAAY;AACvG,aAAOxZ;AAIf,QAAI;AACA,MAAAA,EAAY,KAAK,GAAG,MAAM,KAAK,YAAYkS,EAAY,OAAOluD,GAASmuD,CAAW,CAAC;AAAA,IACvF,SACOrD,GAAK;AACR,UAAID,GAAqBC,CAAG;AACxB,cAAMA;AAEV,cAAQ,MAAM,wCAAwCA,CAAG;AAAA,IAC7D;AACA,iBAAMC,GAAkBoD,CAAW,GAC5BnS;AAAA,EACX;AAAA,EACA,oBAAoBkS,GAAalS,GAAa2N,GAAU;AACpD,UAAM8L,IAAmB,CAAC,GAAGvH,EAAY,aAAa,GAAGA,EAAY,aAAa,eAAe,EAAE;AACnG,eAAWwH,KAAmBD,GAAkB;AAC5C,YAAMve,IAAWwe,EAAgB,YAAY,SACvCC,IAAa;AAAA,QACf,UAAUC,GAAqB1e,CAAQ;AAAA,QACvC,OAAO;AAAA,UACH,OAAO;AAAA,YACH,MAAMwe,EAAgB,OAAO;AAAA,YAC7B,WAAWA,EAAgB,SAAS;AAAA,UAC5D;AAAA,UACoB,KAAK;AAAA,YACD,MAAMA,EAAgB,OAAO;AAAA,YAC7B,WAAWA,EAAgB,SAASA,EAAgB,SAAS;AAAA,UACrF;AAAA,QACA;AAAA,QACgB,SAASA,EAAgB;AAAA,QACzB,MAAMG,GAAiB3e,CAAQ;AAAA,QAC/B,QAAQ,KAAK,UAAS;AAAA,MACtC;AACY,MAAA8E,EAAY,KAAK2Z,CAAU;AAAA,IAC/B;AAAA,EACJ;AAAA,EACA,qBAAqBzH,GAAalS,GAAa2N,GAAU;AACrD,eAAWmM,KAAe5H,EAAY,cAAc;AAChD,UAAIltD;AAIJ,UAAI,MAAM80D,EAAY,MAAM,WAAW;AAGnC,YAAI,mBAAmBA,GAAa;AAChC,gBAAMruD,IAAQquD,EAAY;AAC1B,cAAK,MAAMruD,EAAM,WAAW,GAIvB;AAGD,kBAAMiwC,IAAW,EAAE,MAAM,GAAG,WAAW,EAAC;AACxC,YAAA12C,IAAQ,EAAE,OAAO02C,GAAU,KAAKA,EAAQ;AAAA,UAC5C,OAT+B;AAC3B,kBAAMA,IAAW,EAAE,MAAMjwC,EAAM,UAAU,GAAG,WAAWA,EAAM,UAAS;AACtE,YAAAzG,IAAQ,EAAE,OAAO02C,GAAU,KAAKA,EAAQ;AAAA,UAC5C;AAAA,QAOJ;AAAA;AAGA,QAAA12C,IAAQwG,GAAasuD,EAAY,KAAK;AAE1C,UAAI90D,GAAO;AACP,cAAM20D,IAAa;AAAA,UACf,UAAUC,GAAqB,OAAO;AAAA,UACtC,OAAA50D;AAAA,UACA,SAAS80D,EAAY;AAAA,UACrB,MAAMtB,GAAegB,GAAkB,YAAY;AAAA,UACnD,QAAQ,KAAK,UAAS;AAAA,QAC1C;AACgB,QAAAxZ,EAAY,KAAK2Z,CAAU;AAAA,MAC/B;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,qBAAqB/W,GAAU5C,GAAa2N,GAAU;AAClD,eAAW7oD,KAAa89C,EAAS,YAAY;AACzC,YAAMmX,IAAej1D,EAAU;AAC/B,UAAIi1D,GAAc;AACd,cAAMC,IAAO;AAAA,UACT,MAAMD,EAAa,KAAK;AAAA,UACxB,OAAOj1D,EAAU,UAAU;AAAA,UAC3B,UAAUi1D,EAAa,KAAK;AAAA,UAC5B,OAAOA,EAAa,KAAK;AAAA,UACzB,MAAM;AAAA,YACF,MAAMP,GAAkB;AAAA,YACxB,eAAeO,EAAa,KAAK,UAAU;AAAA,YAC3C,UAAUA,EAAa,KAAK;AAAA,YAC5B,SAASA,EAAa,KAAK,UAAU;AAAA,UAC7D;AAAA,QACA;AACgB,QAAA/Z,EAAY,KAAK,KAAK,aAAa,SAAS+Z,EAAa,SAASC,CAAI,CAAC;AAAA,MAC3E;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,MAAM,YAAYnF,GAAU7wD,GAASmuD,IAAchE,GAAAA,kBAAkB,MAAM;AACvE,UAAM8L,IAAkB,CAAA,GAClBC,IAAW,CAAChf,GAAUvuC,GAASqtD,MAAS;AAC1C,MAAAC,EAAgB,KAAK,KAAK,aAAa/e,GAAUvuC,GAASqtD,CAAI,CAAC;AAAA,IACnE;AACA,iBAAM,KAAK,kBAAkBnF,GAAU7wD,GAASk2D,GAAU/H,CAAW,GACrE,MAAM,KAAK,iBAAiB0C,GAAU7wD,GAASk2D,GAAU/H,CAAW,GACpE,MAAM,KAAK,iBAAiB0C,GAAU7wD,GAASk2D,GAAU/H,CAAW,GAC7D8H;AAAA,EACX;AAAA,EACA,MAAM,kBAAkBpF,GAAU7wD,GAASk2D,GAAU/H,IAAchE,GAAAA,kBAAkB,MAAM;AACvF,UAAMgM,IAAe,KAAK,mBAAmB;AAC7C,eAAWhB,KAAegB;AACtB,YAAMpL,GAAkBoD,CAAW,GACnC,MAAMgH,EAAYtE,GAAUqF,GAAUl2D,EAAQ,cAAc,CAAA,GAAImuD,CAAW;AAAA,EAEnF;AAAA,EACA,MAAM,iBAAiB0C,GAAU7wD,GAASk2D,GAAU/H,IAAchE,GAAAA,kBAAkB,MAAM;AACtF,QAAI,KAAK,UAAU,SAAS,YAAY,GAAG;AACvC,YAAMpG,IAAO,KAAK,SAAS,WAAW,cAAc,KAAK,UAAU;AACnE,MAAAA,EAAK,MAAK;AACV,UAAI;AACA,cAAMt1C,IAAQrN,GAAUyvD,CAAQ,EAAE,SAAQ;AAC1C,mBAAW/zD,KAAQ2R,GAAO;AACtB,UAAAs1C,EAAK,aAAajnD,EAAK,KAAK;AAC5B,gBAAMs5D,IAAc,KAAK,0BAA0Bt5D,GAAMkD,CAAO;AAChE,cAAIo2D,EAAY;AACZ,gBAAI;AACA,oBAAMlB,IAAS,KAAK,mBAAmB,UAAUp4D,EAAK,OAAOkD,EAAQ,UAAU;AAC/E,yBAAWqgD,KAAS6U;AAChB,sBAAM7U,EAAMvjD,GAAMo5D,GAAU/H,CAAW;AAAA,YAE/C,UACxB;AAC4B,cAAApK,EAAK,YAAYjnD,EAAK,KAAK;AAAA,YAC/B;AAEJ,UAAKs5D,EAAY,oBACb3nD,EAAM,MAAK;AAAA,QAEnB;AAAA,MACJ,UACZ;AACgB,QAAAs1C,EAAK,KAAI;AAAA,MACb;AAAA,IACJ,OACK;AACD,YAAMt1C,IAAQrN,GAAUyvD,CAAQ,EAAE,SAAQ;AAC1C,iBAAW/zD,KAAQ2R,GAAO;AACtB,cAAMs8C,GAAkBoD,CAAW;AACnC,cAAMiI,IAAc,KAAK,0BAA0Bt5D,GAAMkD,CAAO;AAChE,YAAIo2D,EAAY,cAAc;AAC1B,gBAAMlB,IAAS,KAAK,mBAAmB,UAAUp4D,EAAK,OAAOkD,EAAQ,UAAU;AAC/E,qBAAWqgD,KAAS6U;AAChB,kBAAM7U,EAAMvjD,GAAMo5D,GAAU/H,CAAW;AAAA,QAE/C;AACA,QAAKiI,EAAY,oBACb3nD,EAAM,MAAK;AAAA,MAEnB;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,0BAA0B4nD,GAAO1M,GAAU;AACvC,WAAO2L;AAAA,EACX;AAAA,EACA,MAAM,iBAAiBzE,GAAU7wD,GAASk2D,GAAU/H,IAAchE,GAAAA,kBAAkB,MAAM;AACtF,UAAMmM,IAAc,KAAK,mBAAmB;AAC5C,eAAWlB,KAAckB;AACrB,YAAMvL,GAAkBoD,CAAW,GACnC,MAAMiH,EAAWvE,GAAUqF,GAAUl2D,EAAQ,cAAc,CAAA,GAAImuD,CAAW;AAAA,EAElF;AAAA,EACA,aAAajX,GAAUvuC,GAASqtD,GAAM;AAClC,WAAO;AAAA,MACH,SAAArtD;AAAA,MACA,OAAO4tD,GAAmBP,CAAI;AAAA,MAC9B,UAAUJ,GAAqB1e,CAAQ;AAAA,MACvC,MAAM8e,EAAK;AAAA,MACX,iBAAiBA,EAAK;AAAA,MACtB,MAAMA,EAAK;AAAA,MACX,oBAAoBA,EAAK;AAAA,MACzB,MAAMA,EAAK;AAAA,MACX,QAAQ,KAAK,UAAS;AAAA,IAClC;AAAA,EACI;AAAA,EACA,YAAY;AACR,WAAO,KAAK,SAAS;AAAA,EACzB;AACJ;AACO,SAASO,GAAmBP,GAAM;AACrC,MAAIA,EAAK;AACL,WAAOA,EAAK;AAEhB,MAAI7tD;AAQJ,SAPI,OAAO6tD,EAAK,YAAa,WACzB7tD,IAAUqG,GAAoBwnD,EAAK,KAAK,UAAUA,EAAK,UAAUA,EAAK,KAAK,IAEtE,OAAOA,EAAK,WAAY,aAC7B7tD,IAAU0G,GAAmBmnD,EAAK,KAAK,UAAUA,EAAK,SAASA,EAAK,KAAK,IAE7E7tD,MAAYA,IAAU6tD,EAAK,KAAK,WAC3B7tD,IAMEA,EAAQ,QALJ;AAAA,IACH,OAAO,EAAE,MAAM,GAAG,WAAW,EAAC;AAAA,IAC9B,KAAK,EAAE,MAAM,GAAG,WAAW,EAAC;AAAA,EACxC;AAGA;AAOO,SAASytD,GAAqB1e,GAAU;AAC3C,UAAQA,GAAQ;AAAA,IACZ,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX,KAAK;AACD,aAAO;AAAA,IACX;AACI,YAAM,IAAI,MAAM,kCAAkCA,CAAQ;AAAA,EACtE;AACA;AACO,SAAS2e,GAAiB3e,GAAU;AACvC,UAAQA,GAAQ;AAAA,IACZ,KAAK;AACD,aAAOsd,GAAegB,GAAkB,WAAW;AAAA,IACvD,KAAK;AACD,aAAOhB,GAAegB,GAAkB,aAAa;AAAA,IACzD,KAAK;AACD,aAAOhB,GAAegB,GAAkB,UAAU;AAAA,IACtD,KAAK;AACD,aAAOhB,GAAegB,GAAkB,UAAU;AAAA,IACtD;AACI,YAAM,IAAI,MAAM,kCAAkCte,CAAQ;AAAA,EACtE;AACA;AACO,IAAIse;AAAA,CACV,SAAUA,GAAmB;AAC1B,EAAAA,EAAkB,cAAc,gBAChCA,EAAkB,gBAAgB,kBAClCA,EAAkB,aAAa,eAC/BA,EAAkB,aAAa,eAC/BA,EAAkB,eAAe,iBACjCA,EAAkB,eAAe;AACrC,GAAGA,OAAsBA,KAAoB,CAAA,EAAG;ACnRzC,MAAMgB,GAAkC;AAAA,EAC3C,YAAYnkD,GAAU;AAClB,SAAK,iBAAiBA,EAAS,UAAU,gBACzC,KAAK,eAAeA,EAAS,WAAW;AAAA,EAC5C;AAAA,EACA,kBAAkBvV,GAAM0D,GAAMo+C,GAAU;AACpC,UAAM0Q,IAAM1Q,KAAYj+C,GAAY7D,CAAI;AACxC,IAAA0D,MAASA,IAAO,KAAK,aAAa,QAAQ1D,CAAI;AAC9C,UAAMrB,IAAO,KAAK,eAAe,eAAeqB,CAAI;AACpD,QAAI,CAAC0D;AACD,YAAM,IAAI,MAAM,gBAAgB/E,CAAI,eAAe;AAEvD,QAAIg7D;AACJ,UAAMC,IAAoB,MAAMD,MAAoBA,IAAkB/uD,GAAkB,KAAK,aAAa,YAAY5K,CAAI,KAAKA,EAAK,QAAQ;AAC5I,WAAO;AAAA,MACH,MAAAA;AAAA,MACA,MAAA0D;AAAA,MACA,IAAI,cAAc;AACd,eAAOk2D,EAAiB;AAAA,MAC5B;AAAA,MACA,kBAAkBhvD,GAAkB5K,EAAK,QAAQ;AAAA,MACjD,MAAMA,EAAK;AAAA,MACX,aAAawyD,EAAI;AAAA,MACjB,MAAA7zD;AAAA,IACZ;AAAA,EACI;AACJ;AACO,MAAMk7D,GAAoC;AAAA,EAC7C,YAAYtkD,GAAU;AAClB,SAAK,cAAcA,EAAS,UAAU;AAAA,EAC1C;AAAA,EACA,MAAM,mBAAmBusC,GAAUuP,IAAchE,GAAAA,kBAAkB,MAAM;AACrE,UAAMyM,IAAQ,CAAA,GACR/F,IAAWjS,EAAS,YAAY;AACtC,eAAWv9C,KAAWD,GAAUyvD,CAAQ;AACpC,YAAM9F,GAAkBoD,CAAW,GACnC3sD,GAAiBH,CAAO,EAAE,QAAQ,CAAA3E,MAAW;AACzC,QAAKA,EAAQ,UAAU,SACnBk6D,EAAM,KAAK,GAAG,KAAK,uBAAuBl6D,CAAO,CAAC;AAAA,MAE1D,CAAC;AAEL,WAAOk6D;AAAA,EACX;AAAA,EACA,uBAAuBl6D,GAAS;AAC5B,UAAMoE,IAAYpE,EAAQ;AAC1B,QAAIoE,EAAU,SAAS,CAACA,EAAU;AAC9B,aAAO,CAAA;AAEX,QAAI25C,IAAQ,CAAA;AACZ,IAAIp+C,GAAYyE,CAAS,KAAKA,EAAU,mBACpC25C,IAAQ,CAAC35C,EAAU,gBAAgB,IAE9BxE,GAAiBwE,CAAS,MAC/B25C,IAAQ35C,EAAU,MAAM,IAAI,CAAArB,MAAKA,EAAE,gBAAgB,EAAE,OAAO,CAAAA,MAAKA,MAAM,MAAS;AAEpF,UAAMo3D,IAAYl2D,GAAYjE,EAAQ,SAAS,EAAE,KAC3Co6D,IAAa,KAAK,YAAY,eAAep6D,EAAQ,SAAS,GAC9DqyD,IAAe,CAAA,GACfgI,IAAUrvD,GAAkB5G,EAAU,QAAQ;AACpD,eAAWtB,KAAQi7C;AACf,MAAAsU,EAAa,KAAK;AAAA,QACd,WAAA8H;AAAA,QACA,YAAAC;AAAA,QACA,WAAWt3D,EAAK;AAAA,QAChB,YAAYA,EAAK;AAAA,QACjB,SAAAu3D;AAAA,QACA,OAAOpK,GAAS,OAAOntD,EAAK,aAAaq3D,CAAS;AAAA,MAClE,CAAa;AAEL,WAAO9H;AAAA,EACX;AACJ;AC9EO,MAAMiI,GAAsB;AAAA,EAC/B,cAAc;AACV,SAAK,mBAAmB,KACxB,KAAK,iBAAiB;AAAA,EAC1B;AAAA,EACA,eAAel6D,GAAM;AACjB,QAAIA,EAAK,YAAY;AACjB,YAAMm6D,IAAgB,KAAK,eAAen6D,EAAK,UAAU,GACnDo6D,IAAa,KAAK,eAAep6D,CAAI;AAE3C,aADiBm6D,IAAgB,KAAK,mBAAmBC;AAAA,IAE7D;AACA,WAAO;AAAA,EACX;AAAA,EACA,eAAe,EAAE,oBAAAC,GAAoB,iBAAAC,KAAmB;AACpD,QAAI,CAACD;AACD,YAAM,IAAI,MAAM,2CAA2C;AAE/D,WAAIC,MAAoB,SACbD,IAAqB,KAAK,iBAAiBC,IAE/CD;AAAA,EACX;AAAA,EACA,WAAWr6D,GAAMrB,GAAM;AAEnB,WADiBA,EAAK,MAAM,KAAK,gBAAgB,EACjC,OAAO,CAACqD,GAAeu4D,MAAiB;AACpD,UAAI,CAACv4D,KAAiBu4D,EAAa,WAAW;AAC1C,eAAOv4D;AAEX,YAAMw4D,IAAgBD,EAAa,QAAQ,KAAK,cAAc;AAC9D,UAAIC,IAAgB,GAAG;AACnB,cAAMr2D,IAAWo2D,EAAa,UAAU,GAAGC,CAAa,GAClDC,IAAa,SAASF,EAAa,UAAUC,IAAgB,CAAC,CAAC;AAErE,eADcx4D,EAAcmC,CAAQ,IACrBs2D,CAAU;AAAA,MAC7B;AACA,aAAOz4D,EAAcu4D,CAAY;AAAA,IACrC,GAAGv6D,CAAI;AAAA,EACX;AACJ;;AClCO,MAAM06D,GAA6B;AAAA,EACtC,YAAYnlD,GAAU;AAClB,SAAK,SAAS,IAAI24C,GAAQ,GAC1B,KAAK,sCAAsC,IAAItB,WAAO,GACtD,KAAK,WAAW,CAAA,GAChB,KAAK,kBAAkB,IACvB,KAAK,kBAAkBr3C,EAAS;AAAA,EACpC;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,KAAK,OAAO;AAAA,EACvB;AAAA,EACA,WAAWolD,GAAQ;AACf,SAAK,kBAAkBA,EAAO,aAAa,WAAW,iBAAiB;AAAA,EAC3E;AAAA,EACA,MAAM,YAAYA,GAAQ;AACtB,QAAI,KAAK,iBAAiB;AACtB,UAAIA,EAAO,UAAU;AAGjB,cAAMC,IAAY,KAAK,gBAAgB;AACvC,QAAAD,EAAO,SAAS;AAAA;AAAA,UAEZ,SAASC,EAAU,IAAI,CAAAC,MAAQ,KAAK,cAAcA,EAAK,iBAAiB,UAAU,CAAC;AAAA,QACvG,CAAiB;AAAA,MACL;AACA,UAAIF,EAAO,oBAAoB;AAG3B,cAAMG,IAAiB,KAAK,gBAAgB,IAAI,IAAI,CAAAD,OAAS;AAAA;AAAA,UAEzD,SAAS,KAAK,cAAcA,EAAK,iBAAiB,UAAU;AAAA,QAChF,EAAkB,GAEI1kB,IAAU,MAAMwkB,EAAO,mBAAmBG,CAAc;AAC9D,QAAAA,EAAe,QAAQ,CAACC,GAAMv6C,MAAQ;AAClC,eAAK,2BAA2Bu6C,EAAK,SAAS5kB,EAAQ31B,CAAG,CAAC;AAAA,QAC9D,CAAC;AAAA,MACL;AAAA,IACJ;AACA,SAAK,OAAO,QAAO;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,oBAAoBs7B,GAAQ;AACxB,IAAI,OAAOA,EAAO,YAAa,YAAYA,EAAO,aAAa,QAG/D,OAAO,QAAQA,EAAO,QAAQ,EAAE,QAAQ,CAAC,CAACkf,GAASC,CAAa,MAAM;AAClE,WAAK,2BAA2BD,GAASC,CAAa,GACtD,KAAK,oCAAoC,KAAK,EAAE,SAAAD,GAAS,eAAAC,EAAa,CAAE;AAAA,IAC5E,CAAC;AAAA,EACL;AAAA,EACA,2BAA2BD,GAASC,GAAe;AAC/C,SAAK,SAASD,CAAO,IAAIC;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,iBAAiBzD,GAAUyD,GAAe;AAC5C,UAAM,KAAK;AACX,UAAMC,IAAc,KAAK,cAAc1D,CAAQ;AAC/C,QAAI,KAAK,SAAS0D,CAAW;AACzB,aAAO,KAAK,SAASA,CAAW,EAAED,CAAa;AAAA,EAEvD;AAAA,EACA,cAAcje,GAAY;AACtB,WAAO,GAAGA,CAAU;AAAA,EACxB;AAAA,EACA,IAAI,+BAA+B;AAC/B,WAAO,KAAK,oCAAoC;AAAA,EACpD;AACJ;;;;UCnFA,OAAO,eAAeme,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,UAAkBA,EAAA,oBAA4BA,EAAA,oBAA4BA,sBAA4BA,EAAA,oBAA4BA,EAAA,oBAA4BA,EAAA,oBAA4BA,EAAA,oBAA4BA,EAAA,oBAA4BA,EAAA,oBAA4BA,EAAA,oBAA4BA,EAAA,mBAA2BA,EAAA,eAAuBA,EAAA,eAAuBA,iBAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,gBAAsBA,EAAA,eAAuBA,EAAA,2BAAmCA,EAAA,sBAA8BA,EAAA,gBAAwBA,EAAA,aAAqB;AAC/qB,QAAM5jB,IAAK2U,GAAA;AAIX,MAAIkP;AACJ,GAAC,SAAUA,GAAY;AAEnB,IAAAA,EAAW,aAAa,QACxBA,EAAW,iBAAiB,QAC5BA,EAAW,iBAAiB,QAC5BA,EAAW,gBAAgB,QAC3BA,EAAW,gBAAgB,QAU3BA,EAAW,iCAAiC,QAE5CA,EAAW,mBAAmB,QAI9BA,EAAW,oBAAoB,QAI/BA,EAAW,mBAAmB,QAK9BA,EAAW,0BAA0B,QAIrCA,EAAW,qBAAqB,QAKhCA,EAAW,uBAAuB,QAClCA,EAAW,mBAAmB,QAO9BA,EAAW,+BAA+B,OAE1CA,EAAW,iBAAiB;AAAA,EAChC,GAAGA,MAAeD,EAAA,aAAqBC,IAAa,CAAA,EAAG;AAAA,EAKvD,MAAMC,UAAsB,MAAM;AAAA,IAC9B,YAAYj/C,GAAMvQ,GAAS4zC,GAAM;AAC7B,YAAM5zC,CAAO,GACb,KAAK,OAAO0rC,EAAG,OAAOn7B,CAAI,IAAIA,IAAOg/C,EAAW,kBAChD,KAAK,OAAO3b,GACZ,OAAO,eAAe,MAAM4b,EAAc,SAAS;AAAA,IAC3D;AAAA,IACI,SAAS;AACL,YAAMhhE,IAAS;AAAA,QACX,MAAM,KAAK;AAAA,QACX,SAAS,KAAK;AAAA;AAElB,aAAI,KAAK,SAAS,WACdA,EAAO,OAAO,KAAK,OAEhBA;AAAA,IACf;AAAA,EACA;AACA8gE,EAAAA,EAAA,gBAAwBE;AAAA,EACxB,MAAMC,EAAoB;AAAA,IACtB,YAAY1hB,GAAM;AACd,WAAK,OAAOA;AAAA,IACpB;AAAA,IACI,OAAO,GAAGp/C,GAAO;AACb,aAAOA,MAAU8gE,EAAoB,QAAQ9gE,MAAU8gE,EAAoB,UAAU9gE,MAAU8gE,EAAoB;AAAA,IAC3H;AAAA,IACI,WAAW;AACP,aAAO,KAAK;AAAA,IACpB;AAAA,EACA;AACAH,EAAAA,EAAA,sBAA8BG,GAK9BA,EAAoB,OAAO,IAAIA,EAAoB,MAAM,GAKzDA,EAAoB,aAAa,IAAIA,EAAoB,YAAY,GAMrEA,EAAoB,SAAS,IAAIA,EAAoB,QAAQ;AAAA,EAI7D,MAAMC,EAAyB;AAAA,IAC3B,YAAYnT,GAAQoT,GAAgB;AAChC,WAAK,SAASpT,GACd,KAAK,iBAAiBoT;AAAA,IAC9B;AAAA,IACI,IAAI,sBAAsB;AACtB,aAAOF,EAAoB;AAAA,IACnC;AAAA,EACA;AACAH,EAAAA,EAAA,2BAAmCI;AAAA,EAInC,MAAME,UAAqBF,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBM;AAAA,EACvB,MAAMC,UAAoBH,EAAyB;AAAA,IAC/C,YAAYnT,GAAQuT,IAAuBL,EAAoB,MAAM;AACjE,YAAMlT,GAAQ,CAAC,GACf,KAAK,uBAAuBuT;AAAA,IACpC;AAAA,IACI,IAAI,sBAAsB;AACtB,aAAO,KAAK;AAAA,IACpB;AAAA,EACA;AACAR,EAAAA,EAAA,cAAsBO;AAAA,EACtB,MAAME,UAAqBL,EAAyB;AAAA,IAChD,YAAYnT,GAAQuT,IAAuBL,EAAoB,MAAM;AACjE,YAAMlT,GAAQ,CAAC,GACf,KAAK,uBAAuBuT;AAAA,IACpC;AAAA,IACI,IAAI,sBAAsB;AACtB,aAAO,KAAK;AAAA,IACpB;AAAA,EACA;AACAR,EAAAA,EAAA,eAAuBS;AAAA,EACvB,MAAMC,UAAqBN,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBU;AAAA,EACvB,MAAMC,UAAqBP,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBW;AAAA,EACvB,MAAMC,UAAqBR,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBY;AAAA,EACvB,MAAMC,UAAqBT,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBa;AAAA,EACvB,MAAMC,UAAqBV,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBc;AAAA,EACvB,MAAMC,UAAqBX,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBe;AAAA,EACvB,MAAMC,UAAqBZ,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBgB;AAAA,EACvB,MAAMC,UAAqBb,EAAyB;AAAA,IAChD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,eAAuBiB;AAAA,EACvB,MAAMC,UAAyBd,EAAyB;AAAA,IACpD,YAAYnT,GAAQuT,IAAuBL,EAAoB,MAAM;AACjE,YAAMlT,GAAQ,CAAC,GACf,KAAK,uBAAuBuT;AAAA,IACpC;AAAA,IACI,IAAI,sBAAsB;AACtB,aAAO,KAAK;AAAA,IACpB;AAAA,EACA;AACAR,EAAAA,EAAA,mBAA2BkB;AAAA,EAC3B,MAAMC,UAA0Bf,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4BmB;AAAA,EAC5B,MAAMC,UAA0BhB,EAAyB;AAAA,IACrD,YAAYnT,GAAQuT,IAAuBL,EAAoB,MAAM;AACjE,YAAMlT,GAAQ,CAAC,GACf,KAAK,uBAAuBuT;AAAA,IACpC;AAAA,IACI,IAAI,sBAAsB;AACtB,aAAO,KAAK;AAAA,IACpB;AAAA,EACA;AACAR,EAAAA,EAAA,oBAA4BoB;AAAA,EAC5B,MAAMC,UAA0BjB,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4BqB;AAAA,EAC5B,MAAMC,UAA0BlB,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4BsB;AAAA,EAC5B,MAAMC,UAA0BnB,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4BuB;AAAA,EAC5B,MAAMC,UAA0BpB,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4BwB;AAAA,EAC5B,MAAMC,UAA0BrB,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4ByB;AAAA,EAC5B,MAAMC,WAA0BtB,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4B0B;AAAA,EAC5B,MAAMC,WAA0BvB,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4B2B;AAAA,EAC5B,MAAMC,WAA0BxB,EAAyB;AAAA,IACrD,YAAYnT,GAAQ;AAChB,YAAMA,GAAQ,CAAC;AAAA,IACvB;AAAA,EACA;AACA+S,EAAAA,EAAA,oBAA4B4B;AAC5B,MAAIC;AACJ,UAAC,SAAUA,GAAS;AAIhB,aAASC,EAAUpxD,GAAS;AACxB,YAAMisC,IAAYjsC;AAClB,aAAOisC,KAAaP,EAAG,OAAOO,EAAU,MAAM,MAAMP,EAAG,OAAOO,EAAU,EAAE,KAAKP,EAAG,OAAOO,EAAU,EAAE;AAAA,IAC7G;AACI,IAAAklB,EAAQ,YAAYC;AAIpB,aAASC,EAAerxD,GAAS;AAC7B,YAAMisC,IAAYjsC;AAClB,aAAOisC,KAAaP,EAAG,OAAOO,EAAU,MAAM,KAAKjsC,EAAQ,OAAO;AAAA,IAC1E;AACI,IAAAmxD,EAAQ,iBAAiBE;AAIzB,aAASC,EAAWtxD,GAAS;AACzB,YAAMisC,IAAYjsC;AAClB,aAAOisC,MAAcA,EAAU,WAAW,UAAU,CAAC,CAACA,EAAU,WAAWP,EAAG,OAAOO,EAAU,EAAE,KAAKP,EAAG,OAAOO,EAAU,EAAE,KAAKA,EAAU,OAAO;AAAA,IAC1J;AACI,IAAAklB,EAAQ,aAAaG;AAAA,EACzB,GAAGH,MAAY7B,EAAA,UAAkB6B,IAAU,CAAA,EAAG;;;;;;AC5S9C,MAAI34B;AACJ,SAAO,eAAe+4B,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,WAAmBA,GAAA,YAAoBA,GAAA,QAAgB;AACvD,MAAIC;AACJ,GAAC,SAAUA,GAAO;AACd,IAAAA,EAAM,OAAO,GACbA,EAAM,QAAQ,GACdA,EAAM,QAAQA,EAAM,OACpBA,EAAM,OAAO,GACbA,EAAM,QAAQA,EAAM;AAAA,EACxB,GAAGA,MAAUD,GAAA,QAAgBC,IAAQ,CAAA,EAAG;AAAA,EACxC,MAAMC,EAAU;AAAA,IACZ,cAAc;AACV,WAAKj5B,CAAE,IAAI,aACX,KAAK,OAAO,oBAAI,IAAG,GACnB,KAAK,QAAQ,QACb,KAAK,QAAQ,QACb,KAAK,QAAQ,GACb,KAAK,SAAS;AAAA,IACtB;AAAA,IACI,QAAQ;AACJ,WAAK,KAAK,MAAK,GACf,KAAK,QAAQ,QACb,KAAK,QAAQ,QACb,KAAK,QAAQ,GACb,KAAK;AAAA,IACb;AAAA,IACI,UAAU;AACN,aAAO,CAAC,KAAK,SAAS,CAAC,KAAK;AAAA,IACpC;AAAA,IACI,IAAI,OAAO;AACP,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,IAAI,QAAQ;AACR,aAAO,KAAK,OAAO;AAAA,IAC3B;AAAA,IACI,IAAI,OAAO;AACP,aAAO,KAAK,OAAO;AAAA,IAC3B;AAAA,IACI,IAAIxqC,GAAK;AACL,aAAO,KAAK,KAAK,IAAIA,CAAG;AAAA,IAChC;AAAA,IACI,IAAIA,GAAK0jE,IAAQF,EAAM,MAAM;AACzB,YAAM36D,IAAO,KAAK,KAAK,IAAI7I,CAAG;AAC9B,UAAK6I;AAGL,eAAI66D,MAAUF,EAAM,QAChB,KAAK,MAAM36D,GAAM66D,CAAK,GAEnB76D,EAAK;AAAA,IACpB;AAAA,IACI,IAAI7I,GAAKW,GAAO+iE,IAAQF,EAAM,MAAM;AAChC,UAAI36D,IAAO,KAAK,KAAK,IAAI7I,CAAG;AAC5B,UAAI6I;AACA,QAAAA,EAAK,QAAQlI,GACT+iE,MAAUF,EAAM,QAChB,KAAK,MAAM36D,GAAM66D,CAAK;AAAA,WAGzB;AAED,gBADA76D,IAAO,EAAE,KAAA7I,GAAK,OAAAW,GAAO,MAAM,QAAW,UAAU,OAAS,GACjD+iE,GAAK;AAAA,UACT,KAAKF,EAAM;AACP,iBAAK,YAAY36D,CAAI;AACrB;AAAA,UACJ,KAAK26D,EAAM;AACP,iBAAK,aAAa36D,CAAI;AACtB;AAAA,UACJ,KAAK26D,EAAM;AACP,iBAAK,YAAY36D,CAAI;AACrB;AAAA,UACJ;AACI,iBAAK,YAAYA,CAAI;AACrB;AAAA,QACpB;AACY,aAAK,KAAK,IAAI7I,GAAK6I,CAAI,GACvB,KAAK;AAAA,MACjB;AACQ,aAAO;AAAA,IACf;AAAA,IACI,OAAO7I,GAAK;AACR,aAAO,CAAC,CAAC,KAAK,OAAOA,CAAG;AAAA,IAChC;AAAA,IACI,OAAOA,GAAK;AACR,YAAM6I,IAAO,KAAK,KAAK,IAAI7I,CAAG;AAC9B,UAAK6I;AAGL,oBAAK,KAAK,OAAO7I,CAAG,GACpB,KAAK,WAAW6I,CAAI,GACpB,KAAK,SACEA,EAAK;AAAA,IACpB;AAAA,IACI,QAAQ;AACJ,UAAI,CAAC,KAAK,SAAS,CAAC,KAAK;AACrB;AAEJ,UAAI,CAAC,KAAK,SAAS,CAAC,KAAK;AACrB,cAAM,IAAI,MAAM,cAAc;AAElC,YAAMA,IAAO,KAAK;AAClB,kBAAK,KAAK,OAAOA,EAAK,GAAG,GACzB,KAAK,WAAWA,CAAI,GACpB,KAAK,SACEA,EAAK;AAAA,IACpB;AAAA,IACI,QAAQb,GAAY27D,GAAS;AACzB,YAAMj8D,IAAQ,KAAK;AACnB,UAAIy0C,IAAU,KAAK;AACnB,aAAOA,KAAS;AAOZ,YANIwnB,IACA37D,EAAW,KAAK27D,CAAO,EAAExnB,EAAQ,OAAOA,EAAQ,KAAK,IAAI,IAGzDn0C,EAAWm0C,EAAQ,OAAOA,EAAQ,KAAK,IAAI,GAE3C,KAAK,WAAWz0C;AAChB,gBAAM,IAAI,MAAM,0CAA0C;AAE9D,QAAAy0C,IAAUA,EAAQ;AAAA,MAC9B;AAAA,IACA;AAAA,IACI,OAAO;AACH,YAAMz0C,IAAQ,KAAK;AACnB,UAAIy0C,IAAU,KAAK;AACnB,YAAMj1C,IAAW;AAAA,QACb,CAAC,OAAO,QAAQ,GAAG,MACRA;AAAA,QAEX,MAAM,MAAM;AACR,cAAI,KAAK,WAAWQ;AAChB,kBAAM,IAAI,MAAM,0CAA0C;AAE9D,cAAIy0C,GAAS;AACT,kBAAM37C,IAAS,EAAE,OAAO27C,EAAQ,KAAK,MAAM,GAAK;AAChD,mBAAAA,IAAUA,EAAQ,MACX37C;AAAA,UAC3B;AAEoB,mBAAO,EAAE,OAAO,QAAW,MAAM,GAAI;AAAA,QAEzD;AAAA;AAEQ,aAAO0G;AAAA,IACf;AAAA,IACI,SAAS;AACL,YAAMQ,IAAQ,KAAK;AACnB,UAAIy0C,IAAU,KAAK;AACnB,YAAMj1C,IAAW;AAAA,QACb,CAAC,OAAO,QAAQ,GAAG,MACRA;AAAA,QAEX,MAAM,MAAM;AACR,cAAI,KAAK,WAAWQ;AAChB,kBAAM,IAAI,MAAM,0CAA0C;AAE9D,cAAIy0C,GAAS;AACT,kBAAM37C,IAAS,EAAE,OAAO27C,EAAQ,OAAO,MAAM,GAAK;AAClD,mBAAAA,IAAUA,EAAQ,MACX37C;AAAA,UAC3B;AAEoB,mBAAO,EAAE,OAAO,QAAW,MAAM,GAAI;AAAA,QAEzD;AAAA;AAEQ,aAAO0G;AAAA,IACf;AAAA,IACI,UAAU;AACN,YAAMQ,IAAQ,KAAK;AACnB,UAAIy0C,IAAU,KAAK;AACnB,YAAMj1C,IAAW;AAAA,QACb,CAAC,OAAO,QAAQ,GAAG,MACRA;AAAA,QAEX,MAAM,MAAM;AACR,cAAI,KAAK,WAAWQ;AAChB,kBAAM,IAAI,MAAM,0CAA0C;AAE9D,cAAIy0C,GAAS;AACT,kBAAM37C,IAAS,EAAE,OAAO,CAAC27C,EAAQ,KAAKA,EAAQ,KAAK,GAAG,MAAM,GAAK;AACjE,mBAAAA,IAAUA,EAAQ,MACX37C;AAAA,UAC3B;AAEoB,mBAAO,EAAE,OAAO,QAAW,MAAM,GAAI;AAAA,QAEzD;AAAA;AAEQ,aAAO0G;AAAA,IACf;AAAA,IACI,EAAEsjC,IAAK,OAAO,aAAa,OAAO,SAAQ,IAAK;AAC3C,aAAO,KAAK,QAAO;AAAA,IAC3B;AAAA,IACI,QAAQo5B,GAAS;AACb,UAAIA,KAAW,KAAK;AAChB;AAEJ,UAAIA,MAAY,GAAG;AACf,aAAK,MAAK;AACV;AAAA,MACZ;AACQ,UAAIznB,IAAU,KAAK,OACf0nB,IAAc,KAAK;AACvB,aAAO1nB,KAAW0nB,IAAcD;AAC5B,aAAK,KAAK,OAAOznB,EAAQ,GAAG,GAC5BA,IAAUA,EAAQ,MAClB0nB;AAEJ,WAAK,QAAQ1nB,GACb,KAAK,QAAQ0nB,GACT1nB,MACAA,EAAQ,WAAW,SAEvB,KAAK;AAAA,IACb;AAAA,IACI,aAAatzC,GAAM;AAEf,UAAI,CAAC,KAAK,SAAS,CAAC,KAAK;AACrB,aAAK,QAAQA;AAAA,eAEP,KAAK;AAIX,QAAAA,EAAK,OAAO,KAAK,OACjB,KAAK,MAAM,WAAWA;AAAA;AAJtB,cAAM,IAAI,MAAM,cAAc;AAMlC,WAAK,QAAQA,GACb,KAAK;AAAA,IACb;AAAA,IACI,YAAYA,GAAM;AAEd,UAAI,CAAC,KAAK,SAAS,CAAC,KAAK;AACrB,aAAK,QAAQA;AAAA,eAEP,KAAK;AAIX,QAAAA,EAAK,WAAW,KAAK,OACrB,KAAK,MAAM,OAAOA;AAAA;AAJlB,cAAM,IAAI,MAAM,cAAc;AAMlC,WAAK,QAAQA,GACb,KAAK;AAAA,IACb;AAAA,IACI,WAAWA,GAAM;AACb,UAAIA,MAAS,KAAK,SAASA,MAAS,KAAK;AACrC,aAAK,QAAQ,QACb,KAAK,QAAQ;AAAA,eAERA,MAAS,KAAK,OAAO;AAG1B,YAAI,CAACA,EAAK;AACN,gBAAM,IAAI,MAAM,cAAc;AAElC,QAAAA,EAAK,KAAK,WAAW,QACrB,KAAK,QAAQA,EAAK;AAAA,MAC9B,WACiBA,MAAS,KAAK,OAAO;AAG1B,YAAI,CAACA,EAAK;AACN,gBAAM,IAAI,MAAM,cAAc;AAElC,QAAAA,EAAK,SAAS,OAAO,QACrB,KAAK,QAAQA,EAAK;AAAA,MAC9B,OACa;AACD,cAAMzB,IAAOyB,EAAK,MACZ6I,IAAW7I,EAAK;AACtB,YAAI,CAACzB,KAAQ,CAACsK;AACV,gBAAM,IAAI,MAAM,cAAc;AAElC,QAAAtK,EAAK,WAAWsK,GAChBA,EAAS,OAAOtK;AAAA,MAC5B;AACQ,MAAAyB,EAAK,OAAO,QACZA,EAAK,WAAW,QAChB,KAAK;AAAA,IACb;AAAA,IACI,MAAMA,GAAM66D,GAAO;AACf,UAAI,CAAC,KAAK,SAAS,CAAC,KAAK;AACrB,cAAM,IAAI,MAAM,cAAc;AAElC,UAAK,EAAAA,MAAUF,EAAM,SAASE,MAAUF,EAAM;AAG9C,YAAIE,MAAUF,EAAM,OAAO;AACvB,cAAI36D,MAAS,KAAK;AACd;AAEJ,gBAAMzB,IAAOyB,EAAK,MACZ6I,IAAW7I,EAAK;AAEtB,UAAIA,MAAS,KAAK,SAGd6I,EAAS,OAAO,QAChB,KAAK,QAAQA,MAIbtK,EAAK,WAAWsK,GAChBA,EAAS,OAAOtK,IAGpByB,EAAK,WAAW,QAChBA,EAAK,OAAO,KAAK,OACjB,KAAK,MAAM,WAAWA,GACtB,KAAK,QAAQA,GACb,KAAK;AAAA,QACjB,WACiB66D,MAAUF,EAAM,MAAM;AAC3B,cAAI36D,MAAS,KAAK;AACd;AAEJ,gBAAMzB,IAAOyB,EAAK,MACZ6I,IAAW7I,EAAK;AAEtB,UAAIA,MAAS,KAAK,SAGdzB,EAAK,WAAW,QAChB,KAAK,QAAQA,MAIbA,EAAK,WAAWsK,GAChBA,EAAS,OAAOtK,IAEpByB,EAAK,OAAO,QACZA,EAAK,WAAW,KAAK,OACrB,KAAK,MAAM,OAAOA,GAClB,KAAK,QAAQA,GACb,KAAK;AAAA,QACjB;AAAA;AAAA,IACA;AAAA,IACI,SAAS;AACL,YAAM+8C,IAAO,CAAA;AACb,kBAAK,QAAQ,CAACjlD,GAAOX,MAAQ;AACzB,QAAA4lD,EAAK,KAAK,CAAC5lD,GAAKW,CAAK,CAAC;AAAA,MAClC,CAAS,GACMilD;AAAA,IACf;AAAA,IACI,SAASA,GAAM;AACX,WAAK,MAAK;AACV,iBAAW,CAAC5lD,GAAKW,CAAK,KAAKilD;AACvB,aAAK,IAAI5lD,GAAKW,CAAK;AAAA,IAE/B;AAAA,EACA;AACA,EAAA4iE,GAAA,YAAoBE;AAAA,EACpB,MAAMK,UAAiBL,EAAU;AAAA,IAC7B,YAAYM,GAAOC,IAAQ,GAAG;AAC1B,YAAK,GACL,KAAK,SAASD,GACd,KAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAAGC,CAAK,GAAG,CAAC;AAAA,IACpD;AAAA,IACI,IAAI,QAAQ;AACR,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,IAAI,MAAMD,GAAO;AACb,WAAK,SAASA,GACd,KAAK,UAAS;AAAA,IACtB;AAAA,IACI,IAAI,QAAQ;AACR,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,IAAI,MAAMC,GAAO;AACb,WAAK,SAAS,KAAK,IAAI,KAAK,IAAI,GAAGA,CAAK,GAAG,CAAC,GAC5C,KAAK,UAAS;AAAA,IACtB;AAAA,IACI,IAAIhkE,GAAK0jE,IAAQF,EAAM,OAAO;AAC1B,aAAO,MAAM,IAAIxjE,GAAK0jE,CAAK;AAAA,IACnC;AAAA,IACI,KAAK1jE,GAAK;AACN,aAAO,MAAM,IAAIA,GAAKwjE,EAAM,IAAI;AAAA,IACxC;AAAA,IACI,IAAIxjE,GAAKW,GAAO;AACZ,mBAAM,IAAIX,GAAKW,GAAO6iE,EAAM,IAAI,GAChC,KAAK,UAAS,GACP;AAAA,IACf;AAAA,IACI,YAAY;AACR,MAAI,KAAK,OAAO,KAAK,UACjB,KAAK,QAAQ,KAAK,MAAM,KAAK,SAAS,KAAK,MAAM,CAAC;AAAA,IAE9D;AAAA,EACA;AACA,SAAAD,GAAA,WAAmBO;;;;;UCxYnB,OAAO,eAAejJ,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,aAAqB;AACrB,MAAIoJ;AACJ,UAAC,SAAUA,GAAY;AACnB,aAASlmB,EAAO18C,GAAM;AAClB,aAAO;AAAA,QACH,SAASA;AAAA;IAErB;AACI,IAAA4iE,EAAW,SAASlmB;AAAA,EACxB,GAAGkmB,MAAepJ,GAAA,aAAqBoJ,IAAa,CAAA,EAAG;;;;;UCVvD,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,8BAAsCA,GAAA,4BAAoC;AAC1E,QAAMC,IAAiB9R,GAAA;AACvB,MAAI+R;AACJ,GAAC,SAAUA,GAAmB;AAC1B,IAAAA,EAAkB,WAAW,GAC7BA,EAAkB,YAAY;AAAA,EAClC,GAAGA,MAAsBA,IAAoB,CAAA,EAAG;AAAA,EAChD,MAAMC,EAA0B;AAAA,IAC5B,cAAc;AACV,WAAK,UAAU,oBAAI,IAAG;AAAA,IAC9B;AAAA,IACI,mBAAmBC,GAAS;AACxB,UAAIA,EAAQ,OAAO;AACf;AAEJ,YAAMC,IAAS,IAAI,kBAAkB,CAAC,GAChC3e,IAAO,IAAI,WAAW2e,GAAQ,GAAG,CAAC;AACxC,MAAA3e,EAAK,CAAC,IAAIwe,EAAkB,UAC5B,KAAK,QAAQ,IAAIE,EAAQ,IAAIC,CAAM,GACnCD,EAAQ,oBAAoBC;AAAA,IACpC;AAAA,IACI,MAAM,iBAAiBC,GAAOniB,GAAI;AAC9B,YAAMkiB,IAAS,KAAK,QAAQ,IAAIliB,CAAE;AAClC,UAAIkiB,MAAW;AACX;AAEJ,YAAM3e,IAAO,IAAI,WAAW2e,GAAQ,GAAG,CAAC;AACxC,cAAQ,MAAM3e,GAAM,GAAGwe,EAAkB,SAAS;AAAA,IAC1D;AAAA,IACI,QAAQ/hB,GAAI;AACR,WAAK,QAAQ,OAAOA,CAAE;AAAA,IAC9B;AAAA,IACI,UAAU;AACN,WAAK,QAAQ,MAAK;AAAA,IAC1B;AAAA,EACA;AACA,EAAA6hB,GAAA,4BAAoCG;AAAA,EACpC,MAAMI,EAAmC;AAAA,IACrC,YAAYF,GAAQ;AAChB,WAAK,OAAO,IAAI,WAAWA,GAAQ,GAAG,CAAC;AAAA,IAC/C;AAAA,IACI,IAAI,0BAA0B;AAC1B,aAAO,QAAQ,KAAK,KAAK,MAAM,CAAC,MAAMH,EAAkB;AAAA,IAChE;AAAA,IACI,IAAI,0BAA0B;AAC1B,YAAM,IAAI,MAAM,yEAAyE;AAAA,IACjG;AAAA,EACA;AAAA,EACA,MAAMM,EAAyC;AAAA,IAC3C,YAAYH,GAAQ;AAChB,WAAK,QAAQ,IAAIE,EAAmCF,CAAM;AAAA,IAClE;AAAA,IACI,SAAS;AAAA,IACb;AAAA,IACI,UAAU;AAAA,IACd;AAAA,EACA;AAAA,EACA,MAAMI,EAA4B;AAAA,IAC9B,cAAc;AACV,WAAK,OAAO;AAAA,IACpB;AAAA,IACI,8BAA8BL,GAAS;AACnC,YAAMC,IAASD,EAAQ;AACvB,aAAIC,MAAW,SACJ,IAAIJ,EAAe,wBAAuB,IAE9C,IAAIO,EAAyCH,CAAM;AAAA,IAClE;AAAA,EACA;AACA,SAAAL,GAAA,8BAAsCS;;;;;UCtEtC,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,YAAoB;AACpB,QAAMxS,IAAQC,GAAA;AAAA,EACd,MAAMwS,EAAU;AAAA,IACZ,YAAYC,IAAW,GAAG;AACtB,UAAIA,KAAY;AACZ,cAAM,IAAI,MAAM,iCAAiC;AAErD,WAAK,YAAYA,GACjB,KAAK,UAAU,GACf,KAAK,WAAW,CAAA;AAAA,IACxB;AAAA,IACI,KAAKC,GAAO;AACR,aAAO,IAAI,QAAQ,CAAClR,GAAS9uD,MAAW;AACpC,aAAK,SAAS,KAAK,EAAE,OAAAggE,GAAO,SAAAlR,GAAS,QAAA9uD,GAAQ,GAC7C,KAAK,QAAO;AAAA,MACxB,CAAS;AAAA,IACT;AAAA,IACI,IAAI,SAAS;AACT,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,UAAU;AACN,MAAI,KAAK,SAAS,WAAW,KAAK,KAAK,YAAY,KAAK,iBAGpDqtD,EAAM,WAAW,MAAM,aAAa,MAAM,KAAK,WAAW;AAAA,IACtE;AAAA,IACI,YAAY;AACR,UAAI,KAAK,SAAS,WAAW,KAAK,KAAK,YAAY,KAAK;AACpD;AAEJ,YAAMhrD,IAAO,KAAK,SAAS,MAAK;AAEhC,UADA,KAAK,WACD,KAAK,UAAU,KAAK;AACpB,cAAM,IAAI,MAAM,uBAAuB;AAE3C,UAAI;AACA,cAAM5G,IAAS4G,EAAK,MAAK;AACzB,QAAI5G,aAAkB,UAClBA,EAAO,KAAK,CAACG,MAAU;AACnB,eAAK,WACLyG,EAAK,QAAQzG,CAAK,GAClB,KAAK,QAAO;AAAA,QAChC,GAAmB,CAACwzD,MAAQ;AACR,eAAK,WACL/sD,EAAK,OAAO+sD,CAAG,GACf,KAAK,QAAO;AAAA,QAChC,CAAiB,KAGD,KAAK,WACL/sD,EAAK,QAAQ5G,CAAM,GACnB,KAAK,QAAO;AAAA,MAE5B,SACe2zD,GAAK;AACR,aAAK,WACL/sD,EAAK,OAAO+sD,CAAG,GACf,KAAK,QAAO;AAAA,MACxB;AAAA,IACA;AAAA,EACA;AACA,SAAAyQ,GAAA,YAAoBC;;;;;UC9DpB,OAAO,eAAeG,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,8BAAsCA,GAAA,wBAAgCA,GAAA,gBAAwB;AAC9F,QAAM5S,IAAQC,GAAA,GACRnU,IAAKmV,GAAA,GACLC,IAAWC,GAAA,GACX0R,IAAcC,GAAA;AACpB,MAAIC;AACJ,GAAC,SAAUA,GAAe;AACtB,aAASznB,EAAG/8C,GAAO;AACf,UAAIs9C,IAAYt9C;AAChB,aAAOs9C,KAAaC,EAAG,KAAKD,EAAU,MAAM,KAAKC,EAAG,KAAKD,EAAU,OAAO,KACtEC,EAAG,KAAKD,EAAU,OAAO,KAAKC,EAAG,KAAKD,EAAU,OAAO,KAAKC,EAAG,KAAKD,EAAU,gBAAgB;AAAA,IAC1G;AACI,IAAAknB,EAAc,KAAKznB;AAAA,EACvB,GAAGynB,MAAkBH,GAAA,gBAAwBG,IAAgB,CAAA,EAAG;AAAA,EAChE,MAAMC,EAAsB;AAAA,IACxB,cAAc;AACV,WAAK,eAAe,IAAI9R,EAAS,QAAO,GACxC,KAAK,eAAe,IAAIA,EAAS,QAAO,GACxC,KAAK,wBAAwB,IAAIA,EAAS,QAAO;AAAA,IACzD;AAAA,IACI,UAAU;AACN,WAAK,aAAa,QAAO,GACzB,KAAK,aAAa,QAAO;AAAA,IACjC;AAAA,IACI,IAAI,UAAU;AACV,aAAO,KAAK,aAAa;AAAA,IACjC;AAAA,IACI,UAAUxjC,GAAO;AACb,WAAK,aAAa,KAAK,KAAK,QAAQA,CAAK,CAAC;AAAA,IAClD;AAAA,IACI,IAAI,UAAU;AACV,aAAO,KAAK,aAAa;AAAA,IACjC;AAAA,IACI,YAAY;AACR,WAAK,aAAa,KAAK,MAAS;AAAA,IACxC;AAAA,IACI,IAAI,mBAAmB;AACnB,aAAO,KAAK,sBAAsB;AAAA,IAC1C;AAAA,IACI,mBAAmBuvC,GAAM;AACrB,WAAK,sBAAsB,KAAKA,CAAI;AAAA,IAC5C;AAAA,IACI,QAAQvvC,GAAO;AACX,aAAIA,aAAiB,QACVA,IAGA,IAAI,MAAM,kCAAkCouB,EAAG,OAAOpuB,EAAM,OAAO,IAAIA,EAAM,UAAU,SAAS,EAAE;AAAA,IAErH;AAAA,EACA;AACA,EAAAk1C,GAAA,wBAAgCI;AAChC,MAAIC;AACJ,GAAC,SAAUA,GAA8B;AACrC,aAASC,EAAYj8D,GAAS;AAC1B,UAAIk8D,GAEAC;AACJ,YAAMC,IAAkB,oBAAI,IAAG;AAC/B,UAAIC;AACJ,YAAMC,IAAsB,oBAAI,IAAG;AACnC,UAAIt8D,MAAY,UAAa,OAAOA,KAAY;AAC5C,QAAAk8D,IAAUl8D,KAAW;AAAA,WAEpB;AAMD,YALAk8D,IAAUl8D,EAAQ,WAAW,SACzBA,EAAQ,mBAAmB,WAC3Bm8D,IAAiBn8D,EAAQ,gBACzBo8D,EAAgB,IAAID,EAAe,MAAMA,CAAc,IAEvDn8D,EAAQ,oBAAoB;AAC5B,qBAAWu8D,KAAWv8D,EAAQ;AAC1B,YAAAo8D,EAAgB,IAAIG,EAAQ,MAAMA,CAAO;AAOjD,YAJIv8D,EAAQ,uBAAuB,WAC/Bq8D,IAAqBr8D,EAAQ,oBAC7Bs8D,EAAoB,IAAID,EAAmB,MAAMA,CAAkB,IAEnEr8D,EAAQ,wBAAwB;AAChC,qBAAWu8D,KAAWv8D,EAAQ;AAC1B,YAAAs8D,EAAoB,IAAIC,EAAQ,MAAMA,CAAO;AAAA,MAGjE;AACQ,aAAIF,MAAuB,WACvBA,QAAyBtT,EAAM,SAAO,EAAI,gBAAgB,SAC1DuT,EAAoB,IAAID,EAAmB,MAAMA,CAAkB,IAEhE,EAAE,SAAAH,GAAS,gBAAAC,GAAgB,iBAAAC,GAAiB,oBAAAC,GAAoB,qBAAAC,EAAmB;AAAA,IAClG;AACI,IAAAN,EAA6B,cAAcC;AAAA,EAC/C,GAAGD,MAAiCA,IAA+B,CAAA,EAAG;AAAA,EACtE,MAAMQ,UAAoCT,EAAsB;AAAA,IAC5D,YAAYU,GAAUz8D,GAAS;AAC3B,YAAK,GACL,KAAK,WAAWy8D,GAChB,KAAK,UAAUT,EAA6B,YAAYh8D,CAAO,GAC/D,KAAK,aAAa+oD,EAAM,SAAO,EAAI,cAAc,OAAO,KAAK,QAAQ,OAAO,GAC5E,KAAK,yBAAyB,KAC9B,KAAK,oBAAoB,IACzB,KAAK,eAAe,GACpB,KAAK,gBAAgB,IAAI6S,EAAY,UAAU,CAAC;AAAA,IACxD;AAAA,IACI,IAAI,sBAAsBc,GAAS;AAC/B,WAAK,yBAAyBA;AAAA,IACtC;AAAA,IACI,IAAI,wBAAwB;AACxB,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,OAAO7a,GAAU;AACb,WAAK,oBAAoB,IACzB,KAAK,eAAe,GACpB,KAAK,sBAAsB,QAC3B,KAAK,WAAWA;AAChB,YAAM1qD,IAAS,KAAK,SAAS,OAAO,CAAColD,MAAS;AAC1C,aAAK,OAAOA,CAAI;AAAA,MAC5B,CAAS;AACD,kBAAK,SAAS,QAAQ,CAAC91B,MAAU,KAAK,UAAUA,CAAK,CAAC,GACtD,KAAK,SAAS,QAAQ,MAAM,KAAK,UAAS,CAAE,GACrCtvB;AAAA,IACf;AAAA,IACI,OAAOolD,GAAM;AACT,UAAI;AAEA,aADA,KAAK,OAAO,OAAOA,CAAI,OACV;AACT,cAAI,KAAK,sBAAsB,IAAI;AAC/B,kBAAMogB,IAAU,KAAK,OAAO,eAAe,EAAI;AAC/C,gBAAI,CAACA;AACD;AAEJ,kBAAMC,IAAgBD,EAAQ,IAAI,gBAAgB;AAClD,gBAAI,CAACC,GAAe;AAChB,mBAAK,UAAU,IAAI,MAAM;AAAA,EAAmD,KAAK,UAAU,OAAO,YAAYD,CAAO,CAAC,CAAC,EAAE,CAAC;AAC1H;AAAA,YACxB;AACoB,kBAAMzlE,IAAS,SAAS0lE,CAAa;AACrC,gBAAI,MAAM1lE,CAAM,GAAG;AACf,mBAAK,UAAU,IAAI,MAAM,8CAA8C0lE,CAAa,EAAE,CAAC;AACvF;AAAA,YACxB;AACoB,iBAAK,oBAAoB1lE;AAAA,UAC7C;AACgB,gBAAM2lE,IAAO,KAAK,OAAO,YAAY,KAAK,iBAAiB;AAC3D,cAAIA,MAAS,QAAW;AAEpB,iBAAK,uBAAsB;AAC3B;AAAA,UACpB;AACgB,eAAK,yBAAwB,GAC7B,KAAK,oBAAoB,IAKzB,KAAK,cAAc,KAAK,YAAY;AAChC,kBAAMC,IAAQ,KAAK,QAAQ,mBAAmB,SACxC,MAAM,KAAK,QAAQ,eAAe,OAAOD,CAAI,IAC7CA,GACAl0D,IAAU,MAAM,KAAK,QAAQ,mBAAmB,OAAOm0D,GAAO,KAAK,OAAO;AAChF,iBAAK,SAASn0D,CAAO;AAAA,UACzC,CAAiB,EAAE,MAAM,CAAC8d,MAAU;AAChB,iBAAK,UAAUA,CAAK;AAAA,UACxC,CAAiB;AAAA,QACjB;AAAA,MACA,SACeA,GAAO;AACV,aAAK,UAAUA,CAAK;AAAA,MAChC;AAAA,IACA;AAAA,IACI,2BAA2B;AACvB,MAAI,KAAK,wBACL,KAAK,oBAAoB,QAAO,GAChC,KAAK,sBAAsB;AAAA,IAEvC;AAAA,IACI,yBAAyB;AAErB,MADA,KAAK,yBAAwB,GACzB,OAAK,0BAA0B,OAGnC,KAAK,0BAA0BsiC,EAAM,SAAO,EAAI,MAAM,WAAW,CAACthD,GAAOi1D,MAAY;AACjF,aAAK,sBAAsB,QACvBj1D,MAAU,KAAK,iBACf,KAAK,mBAAmB,EAAE,cAAcA,GAAO,aAAai1D,GAAS,GACrE,KAAK,uBAAsB;AAAA,MAE3C,GAAW,KAAK,wBAAwB,KAAK,cAAc,KAAK,sBAAsB;AAAA,IACtF;AAAA,EACA;AACA,SAAAf,GAAA,8BAAsCa;;;;;UC/LtC,OAAO,eAAeO,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,+BAAuCA,GAAA,wBAAgCA,GAAA,gBAAwB;AAC/F,QAAMhU,IAAQC,GAAA,GACRnU,IAAKmV,GAAA,GACL4R,IAAc1R,GAAA,GACdD,IAAW4R,GAAA,GACXmB,IAAgB,oBAChBC,IAAO;AAAA;AACb,MAAIC;AACJ,GAAC,SAAUA,GAAe;AACtB,aAAS7oB,EAAG/8C,GAAO;AACf,UAAIs9C,IAAYt9C;AAChB,aAAOs9C,KAAaC,EAAG,KAAKD,EAAU,OAAO,KAAKC,EAAG,KAAKD,EAAU,OAAO,KACvEC,EAAG,KAAKD,EAAU,OAAO,KAAKC,EAAG,KAAKD,EAAU,KAAK;AAAA,IACjE;AACI,IAAAsoB,EAAc,KAAK7oB;AAAA,EACvB,GAAG6oB,MAAkBH,GAAA,gBAAwBG,IAAgB,CAAA,EAAG;AAAA,EAChE,MAAMC,EAAsB;AAAA,IACxB,cAAc;AACV,WAAK,eAAe,IAAIlT,EAAS,QAAO,GACxC,KAAK,eAAe,IAAIA,EAAS,QAAO;AAAA,IAChD;AAAA,IACI,UAAU;AACN,WAAK,aAAa,QAAO,GACzB,KAAK,aAAa,QAAO;AAAA,IACjC;AAAA,IACI,IAAI,UAAU;AACV,aAAO,KAAK,aAAa;AAAA,IACjC;AAAA,IACI,UAAUxjC,GAAO9d,GAAS7K,GAAO;AAC7B,WAAK,aAAa,KAAK,CAAC,KAAK,QAAQ2oB,CAAK,GAAG9d,GAAS7K,CAAK,CAAC;AAAA,IACpE;AAAA,IACI,IAAI,UAAU;AACV,aAAO,KAAK,aAAa;AAAA,IACjC;AAAA,IACI,YAAY;AACR,WAAK,aAAa,KAAK,MAAS;AAAA,IACxC;AAAA,IACI,QAAQ2oB,GAAO;AACX,aAAIA,aAAiB,QACVA,IAGA,IAAI,MAAM,kCAAkCouB,EAAG,OAAOpuB,EAAM,OAAO,IAAIA,EAAM,UAAU,SAAS,EAAE;AAAA,IAErH;AAAA,EACA;AACA,EAAAs2C,GAAA,wBAAgCI;AAChC,MAAIC;AACJ,GAAC,SAAUA,GAA8B;AACrC,aAASnB,EAAYj8D,GAAS;AAC1B,aAAIA,MAAY,UAAa,OAAOA,KAAY,WACrC,EAAE,SAASA,KAAW,SAAS,wBAAwB+oD,EAAM,SAAO,EAAI,gBAAgB,QAAO,IAG/F,EAAE,SAAS/oD,EAAQ,WAAW,SAAS,gBAAgBA,EAAQ,gBAAgB,oBAAoBA,EAAQ,0BAA0B+oD,EAAM,SAAO,EAAI,gBAAgB,QAAO;AAAA,IAEhM;AACI,IAAAqU,EAA6B,cAAcnB;AAAA,EAC/C,GAAGmB,MAAiCA,IAA+B,CAAA,EAAG;AAAA,EACtE,MAAMC,UAAqCF,EAAsB;AAAA,IAC7D,YAAYG,GAAUt9D,GAAS;AAC3B,YAAK,GACL,KAAK,WAAWs9D,GAChB,KAAK,UAAUF,EAA6B,YAAYp9D,CAAO,GAC/D,KAAK,aAAa,GAClB,KAAK,iBAAiB,IAAI47D,EAAY,UAAU,CAAC,GACjD,KAAK,SAAS,QAAQ,CAACn1C,MAAU,KAAK,UAAUA,CAAK,CAAC,GACtD,KAAK,SAAS,QAAQ,MAAM,KAAK,UAAS,CAAE;AAAA,IACpD;AAAA,IACI,MAAM,MAAMlU,GAAK;AACb,aAAO,KAAK,eAAe,KAAK,YACZ,KAAK,QAAQ,mBAAmB,OAAOA,GAAK,KAAK,OAAO,EAAE,KAAK,CAAC2oD,MACxE,KAAK,QAAQ,mBAAmB,SACzB,KAAK,QAAQ,eAAe,OAAOA,CAAM,IAGzCA,CAEd,EACc,KAAK,CAACA,MAAW;AAC5B,cAAMyB,IAAU,CAAA;AAChB,eAAAA,EAAQ,KAAKK,GAAe9B,EAAO,WAAW,SAAQ,GAAI+B,CAAI,GAC9DN,EAAQ,KAAKM,CAAI,GACV,KAAK,QAAQ1qD,GAAKoqD,GAASzB,CAAM;AAAA,MACxD,GAAe,CAACz0C,MAAU;AACV,mBAAK,UAAUA,CAAK,GACdA;AAAA,MACtB,CAAa,CACJ;AAAA,IACT;AAAA,IACI,MAAM,QAAQlU,GAAKoqD,GAASpgB,GAAM;AAC9B,UAAI;AACA,qBAAM,KAAK,SAAS,MAAMogB,EAAQ,KAAK,EAAE,GAAG,OAAO,GAC5C,KAAK,SAAS,MAAMpgB,CAAI;AAAA,MAC3C,SACe91B,GAAO;AACV,oBAAK,YAAYA,GAAOlU,CAAG,GACpB,QAAQ,OAAOkU,CAAK;AAAA,MACvC;AAAA,IACA;AAAA,IACI,YAAYA,GAAOlU,GAAK;AACpB,WAAK,cACL,KAAK,UAAUkU,GAAOlU,GAAK,KAAK,UAAU;AAAA,IAClD;AAAA,IACI,MAAM;AACF,WAAK,SAAS,IAAG;AAAA,IACzB;AAAA,EACA;AACA,SAAAwqD,GAAA,+BAAuCM;;;;;UC7GvC,OAAO,eAAeE,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,wBAAgC;AAChC,QAAMC,IAAK,IACLC,IAAK,IACLR,IAAO;AAAA;AAAA,EACb,MAAMS,EAAsB;AAAA,IACxB,YAAYC,IAAW,SAAS;AAC5B,WAAK,YAAYA,GACjB,KAAK,UAAU,CAAA,GACf,KAAK,eAAe;AAAA,IAC5B;AAAA,IACI,IAAI,WAAW;AACX,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,OAAOC,GAAO;AACV,YAAMC,IAAW,OAAOD,KAAU,WAAW,KAAK,WAAWA,GAAO,KAAK,SAAS,IAAIA;AACtF,WAAK,QAAQ,KAAKC,CAAQ,GAC1B,KAAK,gBAAgBA,EAAS;AAAA,IACtC;AAAA,IACI,eAAeC,IAAgB,IAAO;AAClC,UAAI,KAAK,QAAQ,WAAW;AACxB;AAEJ,UAAIz/D,IAAQ,GACR0/D,IAAa,GACbp2D,IAAS,GACTq2D,IAAiB;AACrB,MAAAC,EAAK,QAAOF,IAAa,KAAK,QAAQ,UAAQ;AAC1C,cAAMH,IAAQ,KAAK,QAAQG,CAAU;AAE7B,aADRp2D,IAAS,GACMA,IAASi2D,EAAM,UAAQ;AAElC,kBADcA,EAAMj2D,CAAM,GACb;AAAA,YACT,KAAK61D;AACD,sBAAQn/D,GAAK;AAAA,gBACT,KAAK;AACD,kBAAAA,IAAQ;AACR;AAAA,gBACJ,KAAK;AACD,kBAAAA,IAAQ;AACR;AAAA,gBACJ;AACI,kBAAAA,IAAQ;AAAA,cACxC;AACwB;AAAA,YACJ,KAAKo/D;AACD,sBAAQp/D,GAAK;AAAA,gBACT,KAAK;AACD,kBAAAA,IAAQ;AACR;AAAA,gBACJ,KAAK;AACD,kBAAAA,IAAQ,GACRsJ;AACA,wBAAMs2D;AAAA,gBACV;AACI,kBAAA5/D,IAAQ;AAAA,cACxC;AACwB;AAAA,YACJ;AACI,cAAAA,IAAQ;AAAA,UAChC;AACgB,UAAAsJ;AAAA,QAChB;AACY,QAAAq2D,KAAkBJ,EAAM,YACxBG;AAAA,MACZ;AACQ,UAAI1/D,MAAU;AACV;AAIJ,YAAM68D,IAAS,KAAK,MAAM8C,IAAiBr2D,CAAM,GAC3CxQ,IAAS,oBAAI,IAAG,GAChBwlE,IAAU,KAAK,SAASzB,GAAQ,OAAO,EAAE,MAAM+B,CAAI;AACzD,UAAIN,EAAQ,SAAS;AACjB,eAAOxlE;AAEX,eAASiI,IAAI,GAAGA,IAAIu9D,EAAQ,SAAS,GAAGv9D,KAAK;AACzC,cAAM8+D,IAASvB,EAAQv9D,CAAC,GAClBnI,IAAQinE,EAAO,QAAQ,GAAG;AAChC,YAAIjnE,MAAU;AACV,gBAAM,IAAI,MAAM;AAAA,EAAyDinE,CAAM,EAAE;AAErF,cAAMvnE,IAAMunE,EAAO,OAAO,GAAGjnE,CAAK,GAC5BK,IAAQ4mE,EAAO,OAAOjnE,IAAQ,CAAC,EAAE,KAAI;AAC3C,QAAAE,EAAO,IAAI2mE,IAAgBnnE,EAAI,YAAW,IAAKA,GAAKW,CAAK;AAAA,MACrE;AACQ,aAAOH;AAAA,IACf;AAAA,IACI,YAAYD,GAAQ;AAChB,UAAI,OAAK,eAAeA;AAGxB,eAAO,KAAK,MAAMA,CAAM;AAAA,IAChC;AAAA,IACI,IAAI,gBAAgB;AAChB,aAAO,KAAK;AAAA,IACpB;AAAA,IACI,MAAMinE,GAAW;AACb,UAAIA,MAAc;AACd,eAAO,KAAK,YAAW;AAE3B,UAAIA,IAAY,KAAK;AACjB,cAAM,IAAI,MAAM,4BAA4B;AAEhD,UAAI,KAAK,QAAQ,CAAC,EAAE,eAAeA,GAAW;AAE1C,cAAMP,IAAQ,KAAK,QAAQ,CAAC;AAC5B,oBAAK,QAAQ,MAAK,GAClB,KAAK,gBAAgBO,GACd,KAAK,SAASP,CAAK;AAAA,MACtC;AACQ,UAAI,KAAK,QAAQ,CAAC,EAAE,aAAaO,GAAW;AAExC,cAAMP,IAAQ,KAAK,QAAQ,CAAC,GACtBzmE,IAAS,KAAK,SAASymE,GAAOO,CAAS;AAC7C,oBAAK,QAAQ,CAAC,IAAIP,EAAM,MAAMO,CAAS,GACvC,KAAK,gBAAgBA,GACdhnE;AAAA,MACnB;AACQ,YAAMA,IAAS,KAAK,YAAYgnE,CAAS;AACzC,UAAIC,IAAe,GACfL,IAAa;AACjB,aAAOI,IAAY,KAAG;AAClB,cAAMP,IAAQ,KAAK,QAAQG,CAAU;AACrC,YAAIH,EAAM,aAAaO,GAAW;AAE9B,gBAAME,IAAYT,EAAM,MAAM,GAAGO,CAAS;AAC1C,UAAAhnE,EAAO,IAAIknE,GAAWD,CAAY,GAClCA,KAAgBD,GAChB,KAAK,QAAQJ,CAAU,IAAIH,EAAM,MAAMO,CAAS,GAChD,KAAK,gBAAgBA,GACrBA,KAAaA;AAAA,QAC7B;AAGgB,UAAAhnE,EAAO,IAAIymE,GAAOQ,CAAY,GAC9BA,KAAgBR,EAAM,YACtB,KAAK,QAAQ,MAAK,GAClB,KAAK,gBAAgBA,EAAM,YAC3BO,KAAaP,EAAM;AAAA,MAEnC;AACQ,aAAOzmE;AAAA,IACf;AAAA,EACA;AACA,SAAAomE,GAAA,wBAAgCG;;;;;AClJhC,WAAO,eAAc9M,GAAU,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,0BAAkCA,sBAA4BA,EAAA,kBAA0BA,EAAA,uBAA+BA,+BAAqCA,EAAA,+BAAuCA,EAAA,sCAA8CA,mCAAyCA,EAAA,qBAA6BA,EAAA,kBAA0BA,qBAA2BA,EAAA,uBAA+BA,EAAA,uBAA+BA,gBAAsBA,EAAA,cAAsBA,EAAA,QAAgBA,eAAqBA,EAAA,eAAuBA,EAAA,gBAAwB;AAC1iB,UAAM7H,IAAQC,GAAA,GACRnU,IAAKmV,GAAA,GACLsU,IAAapU,GAAA,GACbqU,IAAc1C,GAAA,GACd5R,IAAWuU,GAAA,GACX1D,IAAiB2D,GAAA;AACvB,QAAIC;AACJ,KAAC,SAAUA,GAAoB;AAC3B,MAAAA,EAAmB,OAAO,IAAIJ,EAAW,iBAAiB,iBAAiB;AAAA,IAC/E,GAAGI,MAAuBA,IAAqB,CAAA,EAAG;AAClD,QAAIC;AACJ,KAAC,SAAUA,GAAe;AACtB,eAAStqB,EAAG/8C,GAAO;AACf,eAAO,OAAOA,KAAU,YAAY,OAAOA,KAAU;AAAA,MAC7D;AACI,MAAAqnE,EAAc,KAAKtqB;AAAA,IACvB,GAAGsqB,MAAkB/N,EAAA,gBAAwB+N,IAAgB,CAAA,EAAG;AAChE,QAAIC;AACJ,KAAC,SAAUA,GAAsB;AAC7B,MAAAA,EAAqB,OAAO,IAAIN,EAAW,iBAAiB,YAAY;AAAA,IAC5E,GAAGM,MAAyBA,IAAuB,CAAA,EAAG;AAAA,IACtD,MAAMC,EAAa;AAAA,MACf,cAAc;AAAA,MAClB;AAAA,IACA;AACAjO,IAAAA,EAAA,eAAuBiO;AACvB,QAAIC;AACJ,KAAC,SAAUA,GAAoB;AAC3B,eAASzqB,EAAG/8C,GAAO;AACf,eAAOu9C,EAAG,KAAKv9C,CAAK;AAAA,MAC5B;AACI,MAAAwnE,EAAmB,KAAKzqB;AAAA,IAC5B,GAAGyqB,MAAuBA,IAAqB,CAAA,EAAG,GAClDlO,EAAA,aAAqB,OAAO,OAAO;AAAA,MAC/B,OAAO,MAAM;AAAA,MAAA;AAAA,MACb,MAAM,MAAM;AAAA,MAAA;AAAA,MACZ,MAAM,MAAM;AAAA,MAAA;AAAA,MACZ,KAAK,MAAM;AAAA,MAAA;AAAA,IACf,CAAC;AACD,QAAImO;AACJ,KAAC,SAAUA,GAAO;AACd,MAAAA,EAAMA,EAAM,MAAS,CAAC,IAAI,OAC1BA,EAAMA,EAAM,WAAc,CAAC,IAAI,YAC/BA,EAAMA,EAAM,UAAa,CAAC,IAAI,WAC9BA,EAAMA,EAAM,UAAa,CAAC,IAAI;AAAA,IAClC,GAAGA,MAAUnO,EAAA,QAAgBmO,IAAQ,CAAA,EAAG;AACxC,QAAIC;AACJ,KAAC,SAAUA,GAAa;AAIpB,MAAAA,EAAY,MAAM,OAIlBA,EAAY,WAAW,YAIvBA,EAAY,UAAU,WAItBA,EAAY,UAAU;AAAA,IAC1B,GAAGA,MAAgBpO,EAAA,cAAsBoO,IAAc,CAAA,EAAG,IACzD,SAAUD,GAAO;AACd,eAASE,EAAW3nE,GAAO;AACvB,YAAI,CAACu9C,EAAG,OAAOv9C,CAAK;AAChB,iBAAOynE,EAAM;AAGjB,gBADAznE,IAAQA,EAAM,YAAW,GACjBA,GAAK;AAAA,UACT,KAAK;AACD,mBAAOynE,EAAM;AAAA,UACjB,KAAK;AACD,mBAAOA,EAAM;AAAA,UACjB,KAAK;AACD,mBAAOA,EAAM;AAAA,UACjB,KAAK;AACD,mBAAOA,EAAM;AAAA,UACjB;AACI,mBAAOA,EAAM;AAAA,QAC7B;AAAA,MACA;AACI,MAAAA,EAAM,aAAaE;AACnB,eAASxgE,EAASnH,GAAO;AACrB,gBAAQA,GAAK;AAAA,UACT,KAAKynE,EAAM;AACP,mBAAO;AAAA,UACX,KAAKA,EAAM;AACP,mBAAO;AAAA,UACX,KAAKA,EAAM;AACP,mBAAO;AAAA,UACX,KAAKA,EAAM;AACP,mBAAO;AAAA,UACX;AACI,mBAAO;AAAA,QACvB;AAAA,MACA;AACI,MAAAA,EAAM,WAAWtgE;AAAA,IACrB,GAAGsgE,MAAUnO,EAAA,QAAgBmO,IAAQ,CAAA,EAAG;AACxC,QAAIG;AACJ,KAAC,SAAUA,GAAa;AACpB,MAAAA,EAAY,OAAU,QACtBA,EAAY,OAAU;AAAA,IAC1B,GAAGA,MAAgBtO,EAAA,cAAsBsO,IAAc,CAAA,EAAG,IACzD,SAAUA,GAAa;AACpB,eAASD,EAAW3nE,GAAO;AACvB,eAAKu9C,EAAG,OAAOv9C,CAAK,KAGpBA,IAAQA,EAAM,YAAW,GACrBA,MAAU,SACH4nE,EAAY,OAGZA,EAAY,QAPZA,EAAY;AAAA,MAS/B;AACI,MAAAA,EAAY,aAAaD;AAAA,IAC7B,GAAGC,MAAgBtO,EAAA,cAAsBsO,IAAc,CAAA,EAAG;AAC1D,QAAIC;AACJ,KAAC,SAAUA,GAAsB;AAC7B,MAAAA,EAAqB,OAAO,IAAIb,EAAW,iBAAiB,YAAY;AAAA,IAC5E,GAAGa,MAAyBvO,EAAA,uBAA+BuO,IAAuB,CAAA,EAAG;AACrF,QAAIC;AACJ,KAAC,SAAUA,GAAsB;AAC7B,MAAAA,EAAqB,OAAO,IAAId,EAAW,iBAAiB,YAAY;AAAA,IAC5E,GAAGc,MAAyBxO,EAAA,uBAA+BwO,IAAuB,CAAA,EAAG;AACrF,QAAIC;AACJ,KAAC,SAAUA,GAAkB;AAIzB,MAAAA,EAAiBA,EAAiB,SAAY,CAAC,IAAI,UAInDA,EAAiBA,EAAiB,WAAc,CAAC,IAAI,YAIrDA,EAAiBA,EAAiB,mBAAsB,CAAC,IAAI;AAAA,IACjE,GAAGA,MAAqBzO,EAAA,mBAA2ByO,IAAmB,CAAA,EAAG;AAAA,IACzE,MAAMC,UAAwB,MAAM;AAAA,MAChC,YAAYpmD,GAAMvQ,GAAS;AACvB,cAAMA,CAAO,GACb,KAAK,OAAOuQ,GACZ,OAAO,eAAe,MAAMomD,EAAgB,SAAS;AAAA,MAC7D;AAAA,IACA;AACA1O,IAAAA,EAAA,kBAA0B0O;AAC1B,QAAIC;AACJ,KAAC,SAAUA,GAAoB;AAC3B,eAASlrB,EAAG/8C,GAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,KAAaC,EAAG,KAAKD,EAAU,kBAAkB;AAAA,MAChE;AACI,MAAA2qB,EAAmB,KAAKlrB;AAAA,IAC5B,GAAGkrB,MAAuB3O,EAAA,qBAA6B2O,IAAqB,CAAA,EAAG;AAC/E,QAAIC;AACJ,KAAC,SAAUA,GAAgC;AACvC,eAASnrB,EAAG/8C,GAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,MAAcA,EAAU,SAAS,UAAaA,EAAU,SAAS,SAASC,EAAG,KAAKD,EAAU,6BAA6B,MAAMA,EAAU,YAAY,UAAaC,EAAG,KAAKD,EAAU,OAAO;AAAA,MAC1M;AACI,MAAA4qB,EAA+B,KAAKnrB;AAAA,IACxC,GAAGmrB,MAAmC5O,EAAA,iCAAyC4O,IAAiC,CAAA,EAAG;AACnH,QAAIC;AACJ,KAAC,SAAUA,GAAqC;AAC5C,eAASprB,EAAG/8C,GAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,KAAaA,EAAU,SAAS,aAAaC,EAAG,KAAKD,EAAU,6BAA6B,MAAMA,EAAU,YAAY,UAAaC,EAAG,KAAKD,EAAU,OAAO;AAAA,MAC7K;AACI,MAAA6qB,EAAoC,KAAKprB;AAAA,IAC7C,GAAGorB,MAAwC7O,EAAA,sCAA8C6O,IAAsC,CAAA,EAAG;AAClI,QAAIC;AACJ,KAAC,SAAUA,GAA8B;AACrC,MAAAA,EAA6B,UAAU,OAAO,OAAO;AAAA,QACjD,8BAA8B72D,GAAG;AAC7B,iBAAO,IAAIiyD,EAAe,wBAAuB;AAAA,QAC7D;AAAA,MACA,CAAK;AACD,eAASzmB,EAAG/8C,GAAO;AACf,eAAOkoE,EAA+B,GAAGloE,CAAK,KAAKmoE,EAAoC,GAAGnoE,CAAK;AAAA,MACvG;AACI,MAAAooE,EAA6B,KAAKrrB;AAAA,IACtC,GAAGqrB,MAAiC9O,EAAA,+BAAuC8O,IAA+B,CAAA,EAAG;AAC7G,QAAIC;AACJ,KAAC,SAAUA,GAA4B;AACnC,MAAAA,EAA2B,UAAU,OAAO,OAAO;AAAA,QAC/C,iBAAiBC,GAAM5mB,GAAI;AACvB,iBAAO4mB,EAAK,iBAAiBlB,EAAmB,MAAM,EAAE,IAAA1lB,EAAE,CAAE;AAAA,QACxE;AAAA,QACQ,QAAQnwC,GAAG;AAAA,QAAA;AAAA,MACnB,CAAK;AACD,eAASwrC,EAAG/8C,GAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,KAAaC,EAAG,KAAKD,EAAU,gBAAgB,KAAKC,EAAG,KAAKD,EAAU,OAAO;AAAA,MAC5F;AACI,MAAA+qB,EAA2B,KAAKtrB;AAAA,IACpC,GAAGsrB,MAA+B/O,EAAA,6BAAqC+O,IAA6B,CAAA,EAAG;AACvG,QAAIE;AACJ,KAAC,SAAUA,GAAsB;AAC7B,MAAAA,EAAqB,UAAU,OAAO,OAAO;AAAA,QACzC,UAAUH,EAA6B;AAAA,QACvC,QAAQC,EAA2B;AAAA,MAC3C,CAAK;AACD,eAAStrB,EAAG/8C,GAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,KAAa8qB,EAA6B,GAAG9qB,EAAU,QAAQ,KAAK+qB,EAA2B,GAAG/qB,EAAU,MAAM;AAAA,MACjI;AACI,MAAAirB,EAAqB,KAAKxrB;AAAA,IAC9B,GAAGwrB,OAAyBjP,EAAA,uBAA+BiP,KAAuB,CAAA,EAAG;AACrF,QAAIC;AACJ,KAAC,SAAUA,GAAiB;AACxB,eAASzrB,EAAG/8C,GAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,KAAaC,EAAG,KAAKD,EAAU,aAAa;AAAA,MAC3D;AACI,MAAAkrB,EAAgB,KAAKzrB;AAAA,IACzB,GAAGyrB,OAAoBlP,EAAA,kBAA0BkP,KAAkB,CAAA,EAAG;AACtE,QAAIC;AACJ,KAAC,SAAUA,GAAmB;AAC1B,eAAS1rB,EAAG/8C,GAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,MAAcirB,GAAqB,GAAGjrB,EAAU,oBAAoB,KAAK2qB,EAAmB,GAAG3qB,EAAU,kBAAkB,KAAKkrB,GAAgB,GAAGlrB,EAAU,eAAe;AAAA,MAC3L;AACI,MAAAmrB,EAAkB,KAAK1rB;AAAA,IAC3B,GAAG0rB,OAAsBnP,EAAA,oBAA4BmP,KAAoB,CAAA,EAAG;AAC5E,QAAIC;AACJ,KAAC,SAAUA,GAAiB;AACxB,MAAAA,EAAgBA,EAAgB,MAAS,CAAC,IAAI,OAC9CA,EAAgBA,EAAgB,YAAe,CAAC,IAAI,aACpDA,EAAgBA,EAAgB,SAAY,CAAC,IAAI,UACjDA,EAAgBA,EAAgB,WAAc,CAAC,IAAI;AAAA,IACvD,GAAGA,MAAoBA,IAAkB,CAAA,EAAG;AAC5C,aAASC,EAAwBtE,GAAeoB,GAAemD,GAASlgE,GAAS;AAC7E,YAAMmgE,IAASD,MAAY,SAAYA,IAAUtP,EAAQ;AACzD,UAAIwP,IAAiB,GACjBC,IAA6B,GAC7BC,IAAgC;AACpC,YAAM1mB,IAAU;AAChB,UAAI2mB;AACJ,YAAMC,KAAkB,oBAAI,IAAG;AAC/B,UAAIC;AACJ,YAAMC,KAAuB,oBAAI,IAAG,GAC9BC,KAAmB,oBAAI,IAAG;AAChC,UAAIluD,IACAmuD,KAAe,IAAIrC,EAAY,UAAS,GACxCsC,KAAmB,oBAAI,IAAG,GAC1BC,KAAwB,oBAAI,IAAG,GAC/BC,KAAgB,oBAAI,IAAG,GACvBC,IAAQjC,EAAM,KACdkC,KAAc/B,EAAY,MAC1BhkD,IACA7c,KAAQ2hE,EAAgB;AAC5B,YAAMkB,KAAe,IAAIjX,EAAS,QAAO,GACnCkX,KAAe,IAAIlX,EAAS,QAAO,GACnCmX,KAA+B,IAAInX,EAAS,QAAO,GACnDoX,KAA2B,IAAIpX,EAAS,QAAO,GAC/CqX,KAAiB,IAAIrX,EAAS,QAAO,GACrCsX,KAAwBvhE,KAAWA,EAAQ,uBAAwBA,EAAQ,uBAAuB6/D,GAAqB;AAC7H,eAAS2B,GAAsBxoB,GAAI;AAC/B,YAAIA,MAAO;AACP,gBAAM,IAAI,MAAM,0EAA0E;AAE9F,eAAO,SAASA,EAAG,SAAQ;AAAA,MACnC;AACI,eAASyoB,GAAuBzoB,GAAI;AAChC,eAAIA,MAAO,OACA,kBAAkB,EAAEsnB,GAA+B,SAAQ,IAG3D,SAAStnB,EAAG,SAAQ;AAAA,MAEvC;AACI,eAAS0oB,KAA6B;AAClC,eAAO,UAAU,EAAErB,GAA4B,SAAQ;AAAA,MAC/D;AACI,eAASsB,GAAkBC,GAAOj5D,GAAS;AACvC,QAAI21D,EAAW,QAAQ,UAAU31D,CAAO,IACpCi5D,EAAM,IAAIJ,GAAsB74D,EAAQ,EAAE,GAAGA,CAAO,IAE/C21D,EAAW,QAAQ,WAAW31D,CAAO,IAC1Ci5D,EAAM,IAAIH,GAAuB94D,EAAQ,EAAE,GAAGA,CAAO,IAGrDi5D,EAAM,IAAIF,GAA0B,GAAI/4D,CAAO;AAAA,MAE3D;AACI,eAASk5D,GAAmBC,GAAU;AAAA,MAE1C;AACI,eAASC,KAAc;AACnB,eAAO1jE,OAAU2hE,EAAgB;AAAA,MACzC;AACI,eAASgC,KAAW;AAChB,eAAO3jE,OAAU2hE,EAAgB;AAAA,MACzC;AACI,eAASiC,KAAa;AAClB,eAAO5jE,OAAU2hE,EAAgB;AAAA,MACzC;AACI,eAASkC,KAAe;AACpB,SAAI7jE,OAAU2hE,EAAgB,OAAO3hE,OAAU2hE,EAAgB,eAC3D3hE,KAAQ2hE,EAAgB,QACxBmB,GAAa,KAAK,MAAS;AAAA,MAGvC;AACI,eAASgB,GAAiB17C,GAAO;AAC7B,QAAAy6C,GAAa,KAAK,CAACz6C,GAAO,QAAW,MAAS,CAAC;AAAA,MACvD;AACI,eAAS27C,GAAkB7lB,GAAM;AAC7B,QAAA2kB,GAAa,KAAK3kB,CAAI;AAAA,MAC9B;AACI,MAAAof,EAAc,QAAQuG,EAAY,GAClCvG,EAAc,QAAQwG,EAAgB,GACtCpF,EAAc,QAAQmF,EAAY,GAClCnF,EAAc,QAAQqF,EAAiB;AACvC,eAASC,KAAsB;AAC3B,QAAI5vD,MAASmuD,GAAa,SAAS,MAGnCnuD,SAAYs2C,EAAM,SAAO,EAAI,MAAM,aAAa,MAAM;AAClD,UAAAt2C,KAAQ,QACR6vD,GAAmB;AAAA,QAC/B,CAAS;AAAA,MACT;AACI,eAASC,GAAc55D,GAAS;AAC5B,QAAI21D,EAAW,QAAQ,UAAU31D,CAAO,IACpC65D,GAAc75D,CAAO,IAEhB21D,EAAW,QAAQ,eAAe31D,CAAO,IAC9C85D,GAAmB95D,CAAO,IAErB21D,EAAW,QAAQ,WAAW31D,CAAO,IAC1C+5D,GAAe/5D,CAAO,IAGtBg6D,GAAqBh6D,CAAO;AAAA,MAExC;AACI,eAAS25D,KAAsB;AAC3B,YAAI1B,GAAa,SAAS;AACtB;AAEJ,cAAMj4D,IAAUi4D,GAAa,MAAK;AAClC,YAAI;AACA,gBAAMgC,IAAkB5iE,GAAS;AACjC,UAAI8/D,GAAgB,GAAG8C,CAAe,IAClCA,EAAgB,cAAcj6D,GAAS45D,EAAa,IAGpDA,GAAc55D,CAAO;AAAA,QAErC;AAEY,UAAA05D,GAAmB;AAAA,QAC/B;AAAA,MACA;AACI,YAAMxgB,KAAW,CAACl5C,MAAY;AAC1B,YAAI;AAGA,cAAI21D,EAAW,QAAQ,eAAe31D,CAAO,KAAKA,EAAQ,WAAW+1D,EAAmB,KAAK,QAAQ;AACjG,kBAAMmE,IAAWl6D,EAAQ,OAAO,IAC1BhS,IAAM6qE,GAAsBqB,CAAQ,GACpCC,IAAWlC,GAAa,IAAIjqE,CAAG;AACrC,gBAAI2nE,EAAW,QAAQ,UAAUwE,CAAQ,GAAG;AACxC,oBAAMC,KAAW/iE,GAAS,oBACpBgjE,KAAYD,MAAYA,GAAS,qBAAsBA,GAAS,mBAAmBD,GAAUjB,EAAkB,IAAI;AACzH,kBAAImB,OAAaA,GAAS,UAAU,UAAaA,GAAS,WAAW,SAAY;AAC7E,gBAAApC,GAAa,OAAOjqE,CAAG,GACvBoqE,GAAc,OAAO8B,CAAQ,GAC7BG,GAAS,KAAKF,EAAS,IACvBG,GAAqBD,IAAUr6D,EAAQ,QAAQ,KAAK,IAAG,CAAE,GACzDo0D,EAAc,MAAMiG,EAAQ,EAAE,MAAM,MAAM7C,EAAO,MAAM,+CAA+C,CAAC;AACvG;AAAA,cACxB;AAAA,YACA;AACgB,kBAAMnS,KAAoB+S,GAAc,IAAI8B,CAAQ;AAEpD,gBAAI7U,OAAsB,QAAW;AACjC,cAAAA,GAAkB,OAAM,GACxBkV,GAA0Bv6D,CAAO;AACjC;AAAA,YACpB;AAIoB,cAAAm4D,GAAsB,IAAI+B,CAAQ;AAAA,UAEtD;AACY,UAAAlB,GAAkBf,IAAcj4D,CAAO;AAAA,QACnD;AAEY,UAAA05D,GAAmB;AAAA,QAC/B;AAAA,MACA;AACI,eAASG,GAAcW,GAAgB;AACnC,YAAIlB,GAAU;AAGV;AAEJ,iBAASmB,EAAMC,GAAene,IAAQoe,IAAW;AAC7C,gBAAM36D,KAAU;AAAA,YACZ,SAASixC;AAAA,YACT,IAAIupB,EAAe;AAAA;AAEvB,UAAIE,aAAyB/E,EAAW,gBACpC31D,GAAQ,QAAQ06D,EAAc,OAAM,IAGpC16D,GAAQ,SAAS06D,MAAkB,SAAY,OAAOA,GAE1DJ,GAAqBt6D,IAASu8C,IAAQoe,EAAS,GAC/CvG,EAAc,MAAMp0D,EAAO,EAAE,MAAM,MAAMw3D,EAAO,MAAM,0BAA0B,CAAC;AAAA,QAC7F;AACQ,iBAASoD,EAAW98C,GAAOy+B,IAAQoe,IAAW;AAC1C,gBAAM36D,KAAU;AAAA,YACZ,SAASixC;AAAA,YACT,IAAIupB,EAAe;AAAA,YACnB,OAAO18C,EAAM,OAAM;AAAA;AAEvB,UAAAw8C,GAAqBt6D,IAASu8C,IAAQoe,EAAS,GAC/CvG,EAAc,MAAMp0D,EAAO,EAAE,MAAM,MAAMw3D,EAAO,MAAM,0BAA0B,CAAC;AAAA,QAC7F;AACQ,iBAASqD,EAAarsE,GAAQ+tD,IAAQoe,IAAW;AAG7C,UAAInsE,MAAW,WACXA,IAAS;AAEb,gBAAMwR,KAAU;AAAA,YACZ,SAASixC;AAAA,YACT,IAAIupB,EAAe;AAAA,YACnB,QAAQhsE;AAAA;AAEZ,UAAA8rE,GAAqBt6D,IAASu8C,IAAQoe,EAAS,GAC/CvG,EAAc,MAAMp0D,EAAO,EAAE,MAAM,MAAMw3D,EAAO,MAAM,0BAA0B,CAAC;AAAA,QAC7F;AACQ,QAAAsD,GAAqBN,CAAc;AACnC,cAAMhlE,KAAUqiE,GAAgB,IAAI2C,EAAe,MAAM;AACzD,YAAItmE,IACA6mE;AACJ,QAAIvlE,OACAtB,KAAOsB,GAAQ,MACfulE,KAAiBvlE,GAAQ;AAE7B,cAAMmlE,KAAY,KAAK,IAAG;AAC1B,YAAII,MAAkBnD,GAAoB;AACtC,gBAAMoD,IAAWR,EAAe,MAAM,OAAO,KAAK,IAAG,CAAE,GACjDS,KAAqBpE,EAA+B,GAAG+B,GAAqB,QAAQ,IACpFA,GAAqB,SAAS,8BAA8BoC,CAAQ,IACpEpC,GAAqB,SAAS,8BAA8B4B,CAAc;AAChF,UAAIA,EAAe,OAAO,QAAQrC,GAAsB,IAAIqC,EAAe,EAAE,KACzES,GAAmB,OAAM,GAEzBT,EAAe,OAAO,QACtBpC,GAAc,IAAI4C,GAAUC,EAAkB;AAElD,cAAI;AACA,gBAAIC;AACJ,gBAAIH;AACA,kBAAIP,EAAe,WAAW,QAAW;AACrC,oBAAItmE,OAAS,UAAaA,GAAK,mBAAmB,GAAG;AACjD,kBAAA0mE,EAAW,IAAIjF,EAAW,cAAcA,EAAW,WAAW,eAAe,WAAW6E,EAAe,MAAM,YAAYtmE,GAAK,cAAc,4BAA4B,GAAGsmE,EAAe,QAAQG,EAAS;AAC3M;AAAA,gBAC5B;AACwB,gBAAAO,KAAgBH,GAAeE,GAAmB,KAAK;AAAA,cAC/E,WAC6B,MAAM,QAAQT,EAAe,MAAM,GAAG;AAC3C,oBAAItmE,OAAS,UAAaA,GAAK,wBAAwByhE,EAAW,oBAAoB,QAAQ;AAC1F,kBAAAiF,EAAW,IAAIjF,EAAW,cAAcA,EAAW,WAAW,eAAe,WAAW6E,EAAe,MAAM,iEAAiE,GAAGA,EAAe,QAAQG,EAAS;AACjN;AAAA,gBAC5B;AACwB,gBAAAO,KAAgBH,GAAe,GAAGP,EAAe,QAAQS,GAAmB,KAAK;AAAA,cACzG,OACyB;AACD,oBAAI/mE,OAAS,UAAaA,GAAK,wBAAwByhE,EAAW,oBAAoB,YAAY;AAC9F,kBAAAiF,EAAW,IAAIjF,EAAW,cAAcA,EAAW,WAAW,eAAe,WAAW6E,EAAe,MAAM,iEAAiE,GAAGA,EAAe,QAAQG,EAAS;AACjN;AAAA,gBAC5B;AACwB,gBAAAO,KAAgBH,GAAeP,EAAe,QAAQS,GAAmB,KAAK;AAAA,cACtG;AAAA,gBAEqB,CAAIrD,MACLsD,KAAgBtD,EAAmB4C,EAAe,QAAQA,EAAe,QAAQS,GAAmB,KAAK;AAE7G,kBAAME,KAAUD;AAChB,YAAKA,KAIIC,GAAQ,OACbA,GAAQ,KAAK,CAACT,OAAkB;AAC5B,cAAAtC,GAAc,OAAO4C,CAAQ,GAC7BP,EAAMC,IAAeF,EAAe,QAAQG,EAAS;AAAA,YAC7E,GAAuB,CAAA78C,OAAS;AACR,cAAAs6C,GAAc,OAAO4C,CAAQ,GACzBl9C,cAAiB63C,EAAW,gBAC5BiF,EAAW98C,IAAO08C,EAAe,QAAQG,EAAS,IAE7C78C,MAASouB,EAAG,OAAOpuB,GAAM,OAAO,IACrC88C,EAAW,IAAIjF,EAAW,cAAcA,EAAW,WAAW,eAAe,WAAW6E,EAAe,MAAM,yBAAyB18C,GAAM,OAAO,EAAE,GAAG08C,EAAe,QAAQG,EAAS,IAGxLC,EAAW,IAAIjF,EAAW,cAAcA,EAAW,WAAW,eAAe,WAAW6E,EAAe,MAAM,qDAAqD,GAAGA,EAAe,QAAQG,EAAS;AAAA,YAEjO,CAAqB,KAGDvC,GAAc,OAAO4C,CAAQ,GAC7BP,EAAMS,IAAeV,EAAe,QAAQG,EAAS,MAtBrDvC,GAAc,OAAO4C,CAAQ,GAC7BH,EAAaK,IAAeV,EAAe,QAAQG,EAAS;AAAA,UAuBhF,SACmB78C,IAAO;AACV,YAAAs6C,GAAc,OAAO4C,CAAQ,GACzBl9C,cAAiB63C,EAAW,gBAC5B8E,EAAM38C,IAAO08C,EAAe,QAAQG,EAAS,IAExC78C,MAASouB,EAAG,OAAOpuB,GAAM,OAAO,IACrC88C,EAAW,IAAIjF,EAAW,cAAcA,EAAW,WAAW,eAAe,WAAW6E,EAAe,MAAM,yBAAyB18C,GAAM,OAAO,EAAE,GAAG08C,EAAe,QAAQG,EAAS,IAGxLC,EAAW,IAAIjF,EAAW,cAAcA,EAAW,WAAW,eAAe,WAAW6E,EAAe,MAAM,qDAAqD,GAAGA,EAAe,QAAQG,EAAS;AAAA,UAEzN;AAAA,QACA;AAEY,UAAAC,EAAW,IAAIjF,EAAW,cAAcA,EAAW,WAAW,gBAAgB,oBAAoB6E,EAAe,MAAM,EAAE,GAAGA,EAAe,QAAQG,EAAS;AAAA,MAExK;AACI,eAASZ,GAAeqB,GAAiB;AACrC,YAAI,CAAA9B,GAAU;AAId,cAAI8B,EAAgB,OAAO;AACvB,YAAIA,EAAgB,QAChB5D,EAAO,MAAM;AAAA,EAAqD,KAAK,UAAU4D,EAAgB,OAAO,QAAW,CAAC,CAAC,EAAE,IAGvH5D,EAAO,MAAM,8EAA8E;AAAA,eAG9F;AACD,kBAAMxpE,IAAMotE,EAAgB,IACtBC,IAAkBnD,GAAiB,IAAIlqE,CAAG;AAEhD,gBADAstE,GAAsBF,GAAiBC,CAAe,GAClDA,MAAoB,QAAW;AAC/B,cAAAnD,GAAiB,OAAOlqE,CAAG;AAC3B,kBAAI;AACA,oBAAIotE,EAAgB,OAAO;AACvB,wBAAMt9C,IAAQs9C,EAAgB;AAC9B,kBAAAC,EAAgB,OAAO,IAAI1F,EAAW,cAAc73C,EAAM,MAAMA,EAAM,SAASA,EAAM,IAAI,CAAC;AAAA,gBAClH,WAC6Bs9C,EAAgB,WAAW;AAChC,kBAAAC,EAAgB,QAAQD,EAAgB,MAAM;AAAA;AAG9C,wBAAM,IAAI,MAAM,sBAAsB;AAAA,cAE9D,SACuBt9C,GAAO;AACV,gBAAIA,EAAM,UACN05C,EAAO,MAAM,qBAAqB6D,EAAgB,MAAM,0BAA0Bv9C,EAAM,OAAO,EAAE,IAGjG05C,EAAO,MAAM,qBAAqB6D,EAAgB,MAAM,wBAAwB;AAAA,cAExG;AAAA,YACA;AAAA,UACA;AAAA,MACA;AACI,eAASvB,GAAmB95D,GAAS;AACjC,YAAIs5D,GAAU;AAEV;AAEJ,YAAIplE,GACAqnE;AACJ,YAAIv7D,EAAQ,WAAW+1D,EAAmB,KAAK,QAAQ;AACnD,gBAAMmE,IAAWl6D,EAAQ,OAAO;AAChC,UAAAm4D,GAAsB,OAAO+B,CAAQ,GACrCK,GAA0Bv6D,CAAO;AACjC;AAAA,QACZ,OACa;AACD,gBAAMxK,IAAUuiE,GAAqB,IAAI/3D,EAAQ,MAAM;AACvD,UAAIxK,MACA+lE,IAAsB/lE,EAAQ,SAC9BtB,IAAOsB,EAAQ;AAAA,QAE/B;AACQ,YAAI+lE,KAAuBzD;AACvB,cAAI;AAEA,gBADAyC,GAA0Bv6D,CAAO,GAC7Bu7D;AACA,kBAAIv7D,EAAQ,WAAW;AACnB,gBAAI9L,MAAS,UACLA,EAAK,mBAAmB,KAAKA,EAAK,wBAAwByhE,EAAW,oBAAoB,UACzF6B,EAAO,MAAM,gBAAgBx3D,EAAQ,MAAM,YAAY9L,EAAK,cAAc,4BAA4B,GAG9GqnE,EAAmB;AAAA,uBAEd,MAAM,QAAQv7D,EAAQ,MAAM,GAAG;AAGpC,sBAAM8uD,IAAS9uD,EAAQ;AACvB,gBAAIA,EAAQ,WAAWi2D,EAAqB,KAAK,UAAUnH,EAAO,WAAW,KAAKkH,EAAc,GAAGlH,EAAO,CAAC,CAAC,IACxGyM,EAAoB,EAAE,OAAOzM,EAAO,CAAC,GAAG,OAAOA,EAAO,CAAC,GAAG,KAGtD56D,MAAS,WACLA,EAAK,wBAAwByhE,EAAW,oBAAoB,UAC5D6B,EAAO,MAAM,gBAAgBx3D,EAAQ,MAAM,iEAAiE,GAE5G9L,EAAK,mBAAmB8L,EAAQ,OAAO,UACvCw3D,EAAO,MAAM,gBAAgBx3D,EAAQ,MAAM,YAAY9L,EAAK,cAAc,wBAAwB46D,EAAO,MAAM,YAAY,IAGnIyM,EAAoB,GAAGzM,CAAM;AAAA,cAEzD;AAEwB,gBAAI56D,MAAS,UAAaA,EAAK,wBAAwByhE,EAAW,oBAAoB,cAClF6B,EAAO,MAAM,gBAAgBx3D,EAAQ,MAAM,iEAAiE,GAEhHu7D,EAAoBv7D,EAAQ,MAAM;AAAA,gBAGrC,CAAI83D,KACLA,EAAwB93D,EAAQ,QAAQA,EAAQ,MAAM;AAAA,UAE1E,SACmB8d,GAAO;AACV,YAAIA,EAAM,UACN05C,EAAO,MAAM,yBAAyBx3D,EAAQ,MAAM,0BAA0B8d,EAAM,OAAO,EAAE,IAG7F05C,EAAO,MAAM,yBAAyBx3D,EAAQ,MAAM,wBAAwB;AAAA,UAEhG;AAAA;AAGY,UAAAy4D,GAA6B,KAAKz4D,CAAO;AAAA,MAErD;AACI,eAASg6D,GAAqBh6D,GAAS;AACnC,YAAI,CAACA,GAAS;AACV,UAAAw3D,EAAO,MAAM,yBAAyB;AACtC;AAAA,QACZ;AACQ,QAAAA,EAAO,MAAM;AAAA,EAA6E,KAAK,UAAUx3D,GAAS,MAAM,CAAC,CAAC,EAAE;AAE5H,cAAMo7D,IAAkBp7D;AACxB,YAAIksC,EAAG,OAAOkvB,EAAgB,EAAE,KAAKlvB,EAAG,OAAOkvB,EAAgB,EAAE,GAAG;AAChE,gBAAMptE,IAAMotE,EAAgB,IACtBI,IAAkBtD,GAAiB,IAAIlqE,CAAG;AAChD,UAAIwtE,KACAA,EAAgB,OAAO,IAAI,MAAM,mEAAmE,CAAC;AAAA,QAErH;AAAA,MACA;AACI,eAASC,GAAe3M,GAAQ;AAC5B,YAA4BA,KAAW;AAGvC,kBAAQuJ,GAAK;AAAA,YACT,KAAKjC,EAAM;AACP,qBAAO,KAAK,UAAUtH,GAAQ,MAAM,CAAC;AAAA,YACzC,KAAKsH,EAAM;AACP,qBAAO,KAAK,UAAUtH,CAAM;AAAA,YAChC;AACI;AAAA,UAChB;AAAA,MACA;AACI,eAAS4M,GAAoB17D,GAAS;AAClC,YAAI,EAAAq4D,MAAUjC,EAAM,OAAO,CAAC7jD;AAG5B,cAAI+lD,OAAgB/B,EAAY,MAAM;AAClC,gBAAI3iB;AACJ,aAAKykB,MAAUjC,EAAM,WAAWiC,MAAUjC,EAAM,YAAYp2D,EAAQ,WAChE4zC,IAAO,WAAW6nB,GAAez7D,EAAQ,MAAM,CAAC;AAAA;AAAA,IAEpDuS,GAAO,IAAI,oBAAoBvS,EAAQ,MAAM,OAAOA,EAAQ,EAAE,OAAO4zC,CAAI;AAAA,UACrF;AAEY,YAAA+nB,GAAc,gBAAgB37D,CAAO;AAAA,MAEjD;AACI,eAAS47D,GAAyB57D,GAAS;AACvC,YAAI,EAAAq4D,MAAUjC,EAAM,OAAO,CAAC7jD;AAG5B,cAAI+lD,OAAgB/B,EAAY,MAAM;AAClC,gBAAI3iB;AACJ,aAAIykB,MAAUjC,EAAM,WAAWiC,MAAUjC,EAAM,aACvCp2D,EAAQ,SACR4zC,IAAO,WAAW6nB,GAAez7D,EAAQ,MAAM,CAAC;AAAA;AAAA,IAGhD4zC,IAAO;AAAA;AAAA,IAGfrhC,GAAO,IAAI,yBAAyBvS,EAAQ,MAAM,MAAM4zC,CAAI;AAAA,UACxE;AAEY,YAAA+nB,GAAc,qBAAqB37D,CAAO;AAAA,MAEtD;AACI,eAASs6D,GAAqBt6D,GAASu8C,GAAQoe,GAAW;AACtD,YAAI,EAAAtC,MAAUjC,EAAM,OAAO,CAAC7jD;AAG5B,cAAI+lD,OAAgB/B,EAAY,MAAM;AAClC,gBAAI3iB;AACJ,aAAIykB,MAAUjC,EAAM,WAAWiC,MAAUjC,EAAM,aACvCp2D,EAAQ,SAASA,EAAQ,MAAM,OAC/B4zC,IAAO,eAAe6nB,GAAez7D,EAAQ,MAAM,IAAI,CAAC;AAAA;AAAA,IAGpDA,EAAQ,SACR4zC,IAAO,WAAW6nB,GAAez7D,EAAQ,MAAM,CAAC;AAAA;AAAA,IAE3CA,EAAQ,UAAU,WACvB4zC,IAAO;AAAA;AAAA,KAInBrhC,GAAO,IAAI,qBAAqBgqC,CAAM,OAAOv8C,EAAQ,EAAE,+BAA+B,KAAK,IAAG,IAAK26D,CAAS,MAAM/mB,CAAI;AAAA,UAClI;AAEY,YAAA+nB,GAAc,iBAAiB37D,CAAO;AAAA,MAElD;AACI,eAAS86D,GAAqB96D,GAAS;AACnC,YAAI,EAAAq4D,MAAUjC,EAAM,OAAO,CAAC7jD;AAG5B,cAAI+lD,OAAgB/B,EAAY,MAAM;AAClC,gBAAI3iB;AACJ,aAAKykB,MAAUjC,EAAM,WAAWiC,MAAUjC,EAAM,YAAYp2D,EAAQ,WAChE4zC,IAAO,WAAW6nB,GAAez7D,EAAQ,MAAM,CAAC;AAAA;AAAA,IAEpDuS,GAAO,IAAI,qBAAqBvS,EAAQ,MAAM,OAAOA,EAAQ,EAAE,OAAO4zC,CAAI;AAAA,UACtF;AAEY,YAAA+nB,GAAc,mBAAmB37D,CAAO;AAAA,MAEpD;AACI,eAASu6D,GAA0Bv6D,GAAS;AACxC,YAAI,EAAAq4D,MAAUjC,EAAM,OAAO,CAAC7jD,MAAUvS,EAAQ,WAAWy2D,EAAqB,KAAK;AAGnF,cAAI6B,OAAgB/B,EAAY,MAAM;AAClC,gBAAI3iB;AACJ,aAAIykB,MAAUjC,EAAM,WAAWiC,MAAUjC,EAAM,aACvCp2D,EAAQ,SACR4zC,IAAO,WAAW6nB,GAAez7D,EAAQ,MAAM,CAAC;AAAA;AAAA,IAGhD4zC,IAAO;AAAA;AAAA,IAGfrhC,GAAO,IAAI,0BAA0BvS,EAAQ,MAAM,MAAM4zC,CAAI;AAAA,UACzE;AAEY,YAAA+nB,GAAc,wBAAwB37D,CAAO;AAAA,MAEzD;AACI,eAASs7D,GAAsBt7D,GAASq7D,GAAiB;AACrD,YAAI,EAAAhD,MAAUjC,EAAM,OAAO,CAAC7jD;AAG5B,cAAI+lD,OAAgB/B,EAAY,MAAM;AAClC,gBAAI3iB;AAcJ,iBAbIykB,MAAUjC,EAAM,WAAWiC,MAAUjC,EAAM,aACvCp2D,EAAQ,SAASA,EAAQ,MAAM,OAC/B4zC,IAAO,eAAe6nB,GAAez7D,EAAQ,MAAM,IAAI,CAAC;AAAA;AAAA,IAGpDA,EAAQ,SACR4zC,IAAO,WAAW6nB,GAAez7D,EAAQ,MAAM,CAAC;AAAA;AAAA,IAE3CA,EAAQ,UAAU,WACvB4zC,IAAO;AAAA;AAAA,KAIfynB,GAAiB;AACjB,oBAAMv9C,IAAQ9d,EAAQ,QAAQ,oBAAoBA,EAAQ,MAAM,OAAO,KAAKA,EAAQ,MAAM,IAAI,OAAO;AACrG,cAAAuS,GAAO,IAAI,sBAAsB8oD,EAAgB,MAAM,OAAOr7D,EAAQ,EAAE,SAAS,KAAK,IAAG,IAAKq7D,EAAgB,UAAU,MAAMv9C,CAAK,IAAI81B,CAAI;AAAA,YAC3J;AAEgB,cAAArhC,GAAO,IAAI,qBAAqBvS,EAAQ,EAAE,qCAAqC4zC,CAAI;AAAA,UAEnG;AAEY,YAAA+nB,GAAc,oBAAoB37D,CAAO;AAAA,MAErD;AACI,eAAS27D,GAAcznE,GAAM8L,GAAS;AAClC,YAAI,CAACuS,MAAU8lD,MAAUjC,EAAM;AAC3B;AAEJ,cAAMyF,IAAa;AAAA,UACf,cAAc;AAAA,UACd,MAAA3nE;AAAA,UACA,SAAA8L;AAAA,UACA,WAAW,KAAK,IAAG;AAAA;AAEvB,QAAAuS,GAAO,IAAIspD,CAAU;AAAA,MAC7B;AACI,eAASC,KAA0B;AAC/B,YAAIzC,GAAQ;AACR,gBAAM,IAAI1C,EAAgBD,EAAiB,QAAQ,uBAAuB;AAE9E,YAAI4C,GAAU;AACV,gBAAM,IAAI3C,EAAgBD,EAAiB,UAAU,yBAAyB;AAAA,MAE1F;AACI,eAASqF,KAAmB;AACxB,YAAI3C,GAAW;AACX,gBAAM,IAAIzC,EAAgBD,EAAiB,kBAAkB,iCAAiC;AAAA,MAE1G;AACI,eAASsF,KAAsB;AAC3B,YAAI,CAAC5C,GAAW;AACZ,gBAAM,IAAI,MAAM,sBAAsB;AAAA,MAElD;AACI,eAAS6C,GAAgBrsC,GAAO;AAC5B,eAAIA,MAAU,SACH,OAGAA;AAAA,MAEnB;AACI,eAASssC,GAAgBtsC,GAAO;AAC5B,YAAIA,MAAU;AAIV,iBAAOA;AAAA,MAEnB;AACI,eAASusC,EAAavsC,GAAO;AACzB,eAA8BA,KAAU,QAAQ,CAAC,MAAM,QAAQA,CAAK,KAAK,OAAOA,KAAU;AAAA,MAClG;AACI,eAASwsC,GAAmBC,GAAqBzsC,GAAO;AACpD,gBAAQysC,GAAmB;AAAA,UACvB,KAAK1G,EAAW,oBAAoB;AAChC,mBAAIwG,EAAavsC,CAAK,IACXssC,GAAgBtsC,CAAK,IAGrB,CAACqsC,GAAgBrsC,CAAK,CAAC;AAAA,UAEtC,KAAK+lC,EAAW,oBAAoB;AAChC,gBAAI,CAACwG,EAAavsC,CAAK;AACnB,oBAAM,IAAI,MAAM,iEAAiE;AAErF,mBAAOssC,GAAgBtsC,CAAK;AAAA,UAChC,KAAK+lC,EAAW,oBAAoB;AAChC,mBAAO,CAACsG,GAAgBrsC,CAAK,CAAC;AAAA,UAClC;AACI,kBAAM,IAAI,MAAM,+BAA+BysC,EAAoB,SAAQ,CAAE,EAAE;AAAA,QAC/F;AAAA,MACA;AACI,eAASC,GAAqBpoE,GAAM46D,GAAQ;AACxC,YAAItgE;AACJ,cAAMmhE,IAAiBz7D,EAAK;AAC5B,gBAAQy7D,GAAc;AAAA,UAClB,KAAK;AACD,YAAAnhE,IAAS;AACT;AAAA,UACJ,KAAK;AACD,YAAAA,IAAS4tE,GAAmBloE,EAAK,qBAAqB46D,EAAO,CAAC,CAAC;AAC/D;AAAA,UACJ;AACI,YAAAtgE,IAAS,CAAA;AACT,qBAASiI,KAAI,GAAGA,KAAIq4D,EAAO,UAAUr4D,KAAIk5D,GAAgBl5D;AACrD,cAAAjI,EAAO,KAAKytE,GAAgBnN,EAAOr4D,EAAC,CAAC,CAAC;AAE1C,gBAAIq4D,EAAO,SAASa;AAChB,uBAASl5D,KAAIq4D,EAAO,QAAQr4D,KAAIk5D,GAAgBl5D;AAC5C,gBAAAjI,EAAO,KAAK,IAAI;AAGxB;AAAA,QAChB;AACQ,eAAOA;AAAA,MACf;AACI,YAAM+tE,IAAa;AAAA,QACf,kBAAkB,CAACroE,MAAS3B,MAAS;AACjC,UAAAupE,GAAuB;AACvB,cAAIvf,GACAigB;AACJ,cAAItwB,EAAG,OAAOh4C,CAAI,GAAG;AACjB,YAAAqoD,IAASroD;AACT,kBAAM6R,KAAQxT,EAAK,CAAC;AACpB,gBAAIkqE,KAAa,GACbJ,KAAsB1G,EAAW,oBAAoB;AACzD,YAAIA,EAAW,oBAAoB,GAAG5vD,EAAK,MACvC02D,KAAa,GACbJ,KAAsBt2D;AAE1B,gBAAI22D,IAAWnqE,EAAK;AACpB,kBAAMo9D,KAAiB+M,IAAWD;AAClC,oBAAQ9M,IAAc;AAAA,cAClB,KAAK;AACD,gBAAA6M,IAAgB;AAChB;AAAA,cACJ,KAAK;AACD,gBAAAA,IAAgBJ,GAAmBC,IAAqB9pE,EAAKkqE,EAAU,CAAC;AACxE;AAAA,cACJ;AACI,oBAAIJ,OAAwB1G,EAAW,oBAAoB;AACvD,wBAAM,IAAI,MAAM,YAAYhG,EAAc,6DAA6D;AAE3G,gBAAA6M,IAAgBjqE,EAAK,MAAMkqE,IAAYC,CAAQ,EAAE,IAAI,CAAA/tE,OAASstE,GAAgBttE,EAAK,CAAC;AACpF;AAAA,YACxB;AAAA,UACA,OACiB;AACD,kBAAMmgE,KAASv8D;AACf,YAAAgqD,IAASroD,EAAK,QACdsoE,IAAgBF,GAAqBpoE,GAAM46D,EAAM;AAAA,UACjE;AACY,gBAAM6N,KAAsB;AAAA,YACxB,SAAS1rB;AAAA,YACT,QAAQsL;AAAA,YACR,QAAQigB;AAAA;AAEZ,iBAAAZ,GAAyBe,EAAmB,GACrCvI,EAAc,MAAMuI,EAAmB,EAAE,MAAM,CAAC7+C,OAAU;AAC7D,kBAAA05C,EAAO,MAAM,8BAA8B,GACrC15C;AAAA,UACtB,CAAa;AAAA,QACb;AAAA,QACQ,gBAAgB,CAAC5pB,GAAM0oE,MAAY;AAC/B,UAAAd,GAAuB;AACvB,cAAIvf;AACJ,iBAAIrQ,EAAG,KAAKh4C,CAAI,IACZ4jE,IAA0B5jE,IAErB0oE,MACD1wB,EAAG,OAAOh4C,CAAI,KACdqoD,IAASroD,GACT6jE,GAAqB,IAAI7jE,GAAM,EAAE,MAAM,QAAW,SAAA0oE,GAAS,MAG3DrgB,IAASroD,EAAK,QACd6jE,GAAqB,IAAI7jE,EAAK,QAAQ,EAAE,MAAAA,GAAM,SAAA0oE,GAAS,KAGxD;AAAA,YACH,SAAS,MAAM;AACX,cAAIrgB,MAAW,SACXwb,GAAqB,OAAOxb,CAAM,IAGlCub,IAA0B;AAAA,YAElD;AAAA;QAEA;AAAA,QACQ,YAAY,CAAC+E,GAAO/9D,GAAO89D,MAAY;AACnC,cAAI5E,GAAiB,IAAIl5D,CAAK;AAC1B,kBAAM,IAAI,MAAM,8BAA8BA,CAAK,qBAAqB;AAE5E,iBAAAk5D,GAAiB,IAAIl5D,GAAO89D,CAAO,GAC5B;AAAA,YACH,SAAS,MAAM;AACX,cAAA5E,GAAiB,OAAOl5D,CAAK;AAAA,YACjD;AAAA;QAEA;AAAA,QACQ,cAAc,CAAC+9D,GAAO/9D,GAAOnQ,MAGlB4tE,EAAW,iBAAiBtG,EAAqB,MAAM,EAAE,OAAAn3D,GAAO,OAAAnQ,GAAO;AAAA,QAElF,qBAAqB+pE,GAAyB;AAAA,QAC9C,aAAa,CAACxkE,MAAS3B,MAAS;AAC5B,UAAAupE,GAAuB,GACvBE,GAAmB;AACnB,cAAIzf,GACAigB,GACA19D;AACJ,cAAIotC,EAAG,OAAOh4C,CAAI,GAAG;AACjB,YAAAqoD,IAASroD;AACT,kBAAM6R,IAAQxT,EAAK,CAAC,GACdstB,KAAOttB,EAAKA,EAAK,SAAS,CAAC;AACjC,gBAAIkqE,KAAa,GACbJ,KAAsB1G,EAAW,oBAAoB;AACzD,YAAIA,EAAW,oBAAoB,GAAG5vD,CAAK,MACvC02D,KAAa,GACbJ,KAAsBt2D;AAE1B,gBAAI22D,KAAWnqE,EAAK;AACpB,YAAI4/D,EAAe,kBAAkB,GAAGtyC,EAAI,MACxC68C,KAAWA,KAAW,GACtB59D,KAAQ+gB;AAEZ,kBAAM8vC,KAAiB+M,KAAWD;AAClC,oBAAQ9M,IAAc;AAAA,cAClB,KAAK;AACD,gBAAA6M,IAAgB;AAChB;AAAA,cACJ,KAAK;AACD,gBAAAA,IAAgBJ,GAAmBC,IAAqB9pE,EAAKkqE,EAAU,CAAC;AACxE;AAAA,cACJ;AACI,oBAAIJ,OAAwB1G,EAAW,oBAAoB;AACvD,wBAAM,IAAI,MAAM,YAAYhG,EAAc,wDAAwD;AAEtG,gBAAA6M,IAAgBjqE,EAAK,MAAMkqE,IAAYC,EAAQ,EAAE,IAAI,CAAA/tE,OAASstE,GAAgBttE,EAAK,CAAC;AACpF;AAAA,YACxB;AAAA,UACA,OACiB;AACD,kBAAMmgE,IAASv8D;AACf,YAAAgqD,IAASroD,EAAK,QACdsoE,IAAgBF,GAAqBpoE,GAAM46D,CAAM;AACjD,kBAAMa,KAAiBz7D,EAAK;AAC5B,YAAA4K,KAAQqzD,EAAe,kBAAkB,GAAGrD,EAAOa,EAAc,CAAC,IAAIb,EAAOa,EAAc,IAAI;AAAA,UAC/G;AACY,gBAAMtf,KAAKonB;AACX,cAAI5O;AACJ,UAAI/pD,OACA+pD,KAAa/pD,GAAM,wBAAwB,MAAM;AAC7C,kBAAMgsC,IAAI8tB,GAAqB,OAAO,iBAAiB2D,GAAYlsB,EAAE;AACrE,mBAAIvF,MAAM,UACN0sB,EAAO,IAAI,qEAAqEnnB,EAAE,EAAE,GAC7E,QAAQ,QAAO,KAGfvF,EAAE,MAAM,MAAM;AACjB,cAAA0sB,EAAO,IAAI,wCAAwCnnB,EAAE,SAAS;AAAA,YAC1F,CAAyB;AAAA,UAEzB,CAAiB;AAEL,gBAAMmqB,KAAiB;AAAA,YACnB,SAASvpB;AAAA,YACT,IAAIZ;AAAA,YACJ,QAAQkM;AAAA,YACR,QAAQigB;AAAA;AAEZ,iBAAAd,GAAoBlB,EAAc,GAC9B,OAAO5B,GAAqB,OAAO,sBAAuB,cAC1DA,GAAqB,OAAO,mBAAmB4B,EAAc,GAE1D,IAAI,QAAQ,OAAO3Y,GAAS9uD,OAAW;AAC1C,kBAAM+pE,KAAqB,CAAC7Z,OAAM;AAC9B,cAAApB,EAAQoB,EAAC,GACT2V,GAAqB,OAAO,QAAQvoB,EAAE,GACtCwY,IAAY,QAAO;AAAA,YACvC,GACsBkU,KAAoB,CAAC9Z,OAAM;AAC7B,cAAAlwD,GAAOkwD,EAAC,GACR2V,GAAqB,OAAO,QAAQvoB,EAAE,GACtCwY,IAAY,QAAO;AAAA,YACvC,GACsBwS,KAAkB,EAAE,QAAQ9e,GAAQ,YAAY,KAAK,IAAG,GAAI,SAASugB,IAAoB,QAAQC,GAAiB;AACxH,gBAAI;AACA,oBAAM3I,EAAc,MAAMoG,EAAc,GACxCtC,GAAiB,IAAI7nB,IAAIgrB,EAAe;AAAA,YAC5D,SACuBv9C,IAAO;AACV,oBAAA05C,EAAO,MAAM,yBAAyB,GAEtC6D,GAAgB,OAAO,IAAI1F,EAAW,cAAcA,EAAW,WAAW,mBAAmB73C,GAAM,UAAUA,GAAM,UAAU,gBAAgB,CAAC,GACxIA;AAAA,YAC1B;AAAA,UACA,CAAa;AAAA,QACb;AAAA,QACQ,WAAW,CAAC5pB,GAAM0oE,MAAY;AAC1B,UAAAd,GAAuB;AACvB,cAAIvf,IAAS;AACb,iBAAI4Z,EAAmB,GAAGjiE,CAAI,KAC1BqoD,IAAS,QACTqb,IAAqB1jE,KAEhBg4C,EAAG,OAAOh4C,CAAI,KACnBqoD,IAAS,MACLqgB,MAAY,WACZrgB,IAASroD,GACT2jE,GAAgB,IAAI3jE,GAAM,EAAE,SAAS0oE,GAAS,MAAM,QAAW,MAI/DA,MAAY,WACZrgB,IAASroD,EAAK,QACd2jE,GAAgB,IAAI3jE,EAAK,QAAQ,EAAE,MAAAA,GAAM,SAAA0oE,GAAS,IAGnD;AAAA,YACH,SAAS,MAAM;AACX,cAAIrgB,MAAW,SAGXA,MAAW,SACXsb,GAAgB,OAAOtb,CAAM,IAG7Bqb,IAAqB;AAAA,YAE7C;AAAA;QAEA;AAAA,QACQ,oBAAoB,MACTM,GAAiB,OAAO;AAAA,QAEnC,OAAO,OAAO8E,GAAQC,GAASC,MAAmC;AAC9D,cAAIC,IAAoB,IACpBC,KAAe7G,EAAY;AAC/B,UAAI2G,MAAmC,WAC/BhxB,EAAG,QAAQgxB,CAA8B,IACzCC,IAAoBD,KAGpBC,IAAoBD,EAA+B,oBAAoB,IACvEE,KAAeF,EAA+B,eAAe3G,EAAY,QAGjF8B,IAAQ2E,GACR1E,KAAc8E,IACV/E,MAAUjC,EAAM,MAChB7jD,KAAS,SAGTA,KAAS0qD,GAETE,KAAqB,CAAC9D,QAAc,CAACC,GAAU,KAC/C,MAAMiD,EAAW,iBAAiB/F,EAAqB,MAAM,EAAE,OAAOJ,EAAM,SAAS4G,CAAM,GAAG;AAAA,QAE9G;AAAA,QACQ,SAASzE,GAAa;AAAA,QACtB,SAASC,GAAa;AAAA,QACtB,yBAAyBC,GAA6B;AAAA,QACtD,WAAWE,GAAe;AAAA,QAC1B,KAAK,MAAM;AACP,UAAAvE,EAAc,IAAG;AAAA,QAC7B;AAAA,QACQ,SAAS,MAAM;AACX,cAAIkF,GAAU;AACV;AAEJ,UAAA5jE,KAAQ2hE,EAAgB,UACxBsB,GAAe,KAAK,MAAS;AAC7B,gBAAM76C,IAAQ,IAAI63C,EAAW,cAAcA,EAAW,WAAW,yBAAyB,yDAAyD;AACnJ,qBAAWwF,KAAWjD,GAAiB;AACnC,YAAAiD,EAAQ,OAAOr9C,CAAK;AAExB,UAAAo6C,KAAmB,oBAAI,IAAG,GAC1BE,KAAgB,oBAAI,IAAG,GACvBD,KAAwB,oBAAI,IAAG,GAC/BF,KAAe,IAAIrC,EAAY,UAAS,GAEpC1pB,EAAG,KAAKkoB,EAAc,OAAO,KAC7BA,EAAc,QAAO,GAErBloB,EAAG,KAAK8mB,EAAc,OAAO,KAC7BA,EAAc,QAAO;AAAA,QAErC;AAAA,QACQ,QAAQ,MAAM;AACV,UAAA8I,GAAuB,GACvBC,GAAgB,GAChBrmE,KAAQ2hE,EAAgB,WACxBrE,EAAc,OAAO9Z,EAAQ;AAAA,QACzC;AAAA,QACQ,SAAS,MAAM;AAEX,cAAIkH,EAAM,SAAO,EAAI,QAAQ,IAAI,SAAS;AAAA,QACtD;AAAA;AAEI,aAAAmc,EAAW,eAAe9F,EAAqB,MAAM,CAAC3H,MAAW;AAC7D,YAAIuJ,MAAUjC,EAAM,OAAO,CAAC7jD;AACxB;AAEJ,cAAM8qD,IAAUhF,MAAUjC,EAAM,WAAWiC,MAAUjC,EAAM;AAC3D,QAAA7jD,GAAO,IAAIu8C,EAAO,SAASuO,IAAUvO,EAAO,UAAU,MAAS;AAAA,MACvE,CAAK,GACDyN,EAAW,eAAetG,EAAqB,MAAM,CAACnH,MAAW;AAC7D,cAAM8N,IAAU5E,GAAiB,IAAIlJ,EAAO,KAAK;AACjD,QAAI8N,IACAA,EAAQ9N,EAAO,KAAK,IAGpB4J,GAAyB,KAAK5J,CAAM;AAAA,MAEhD,CAAK,GACMyN;AAAA,IACX;AACAtU,IAAAA,EAAA,0BAAkCqP;AAAA;;;;;ACrrClC,WAAO,eAAcrP,GAAU,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,eAAuBA,EAAA,gBAAwBA,4BAAkCA,EAAA,aAAqBA,EAAA,oBAA4BA,uBAA6BA,EAAA,wBAAgCA,EAAA,+BAAuCA,EAAA,wBAAgCA,EAAA,gBAAwBA,EAAA,8BAAsCA,EAAA,wBAAgCA,kBAAwBA,EAAA,8BAAsCA,EAAA,4BAAoCA,EAAA,oBAA4BA,EAAA,0BAAkCA,EAAA,UAAkBA,EAAA,QAAgBA,eAAqBA,EAAA,WAAmBA,EAAA,QAAgBA,EAAA,YAAoBA,EAAA,sBAA8BA,EAAA,oBAA4BA,EAAA,oBAA4BA,sBAA4BA,EAAA,oBAA4BA,EAAA,oBAA4BA,sBAA4BA,EAAA,oBAA4BA,EAAA,oBAA4BA,sBAA4BA,EAAA,oBAA4BA,EAAA,mBAA2BA,EAAA,aAAqBA,EAAA,gBAAwBA,EAAA,eAAuBA,EAAA,eAAuBA,iBAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,eAAuBA,iBAAuBA,EAAA,cAAsBA,EAAA,UAAkBA,EAAA,MAAc,QAC5wCA,EAAA,kBAA0BA,EAAA,uBAA+BA,EAAA,6BAAqCA,EAAA,+BAAuCA,EAAA,kBAA0BA,EAAA,mBAA2BA,EAAA,uBAA+BA,EAAA,uBAA+BA,EAAA,cAAsBA,EAAA,cAAsBA,EAAA,QAAgB;AACpT,UAAM0N,IAAatV,GAAA;AACnB,WAAO,eAAe4H,GAAS,WAAW,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAQ,EAAE,CAAE,GAC/G,OAAO,eAAe1N,GAAS,eAAe,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAY,EAAE,CAAE,GACvH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAa,EAAE,CAAE,GACzH,OAAO,eAAe1N,GAAS,iBAAiB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAc,EAAE,CAAE,GAC3H,OAAO,eAAe1N,GAAS,cAAc,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAW,EAAE,CAAE,GACrH,OAAO,eAAe1N,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAiB,EAAE,CAAE,GACjI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAkB,EAAE,CAAE,GACnI,OAAO,eAAe1N,GAAS,uBAAuB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0N,EAAW;AAAA,IAAoB,EAAE,CAAE;AACvI,UAAMC,IAAcvU,GAAA;AACpB,WAAO,eAAe4G,GAAS,aAAa,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2N,EAAY;AAAA,IAAU,EAAE,CAAE,GACpH,OAAO,eAAe3N,GAAS,YAAY,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2N,EAAY;AAAA,IAAS,EAAE,CAAE,GAClH,OAAO,eAAe3N,GAAS,SAAS,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2N,EAAY;AAAA,IAAM,EAAE,CAAE;AAC5G,UAAM0H,IAAe/b,GAAA;AACrB,WAAO,eAAe0G,GAAS,cAAc,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqV,EAAa;AAAA,IAAW,EAAE,CAAE;AACvH,UAAMhc,IAAW4R,GAAA;AACjB,WAAO,eAAejL,GAAS,SAAS,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO3G,EAAS;AAAA,IAAM,EAAE,CAAE,GACzG,OAAO,eAAe2G,GAAS,WAAW,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO3G,EAAS;AAAA,IAAQ,EAAE,CAAE;AAC7G,UAAM6Q,IAAiB0D,GAAA;AACvB,WAAO,eAAe5N,GAAS,2BAA2B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOkK,EAAe;AAAA,IAAwB,EAAE,CAAE,GACnJ,OAAO,eAAelK,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOkK,EAAe;AAAA,IAAkB,EAAE,CAAE;AACvI,UAAMoL,IAA4BzH,GAAA;AAClC,WAAO,eAAe7N,GAAS,6BAA6B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOsV,EAA0B;AAAA,IAA0B,EAAE,CAAE,GAClK,OAAO,eAAetV,GAAS,+BAA+B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOsV,EAA0B;AAAA,IAA4B,EAAE,CAAE;AACtK,UAAMC,IAAkBC,GAAA;AACxB,WAAO,eAAexV,GAAS,iBAAiB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOuV,EAAgB;AAAA,IAAc,EAAE,CAAE,GAChI,OAAO,eAAevV,GAAS,yBAAyB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOuV,EAAgB;AAAA,IAAsB,EAAE,CAAE,GAChJ,OAAO,eAAevV,GAAS,+BAA+B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOuV,EAAgB;AAAA,IAA4B,EAAE,CAAE;AAC5J,UAAME,IAAkBC,GAAA;AACxB,WAAO,eAAe1V,GAAS,iBAAiB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOyV,EAAgB;AAAA,IAAc,EAAE,CAAE,GAChI,OAAO,eAAezV,GAAS,yBAAyB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOyV,EAAgB;AAAA,IAAsB,EAAE,CAAE,GAChJ,OAAO,eAAezV,GAAS,gCAAgC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOyV,EAAgB;AAAA,IAA6B,EAAE,CAAE;AAC9J,UAAME,IAAkBC,GAAA;AACxB,WAAO,eAAe5V,GAAS,yBAAyB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2V,EAAgB;AAAA,IAAsB,EAAE,CAAE;AAChJ,UAAME,IAAeC,GAAA;AACrB,WAAO,eAAe9V,GAAS,sBAAsB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAmB,EAAE,CAAE,GACvI,OAAO,eAAe7V,GAAS,qBAAqB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAkB,EAAE,CAAE,GACrI,OAAO,eAAe7V,GAAS,cAAc,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAW,EAAE,CAAE,GACvH,OAAO,eAAe7V,GAAS,2BAA2B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAwB,EAAE,CAAE,GACjJ,OAAO,eAAe7V,GAAS,iBAAiB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAc,EAAE,CAAE,GAC7H,OAAO,eAAe7V,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAa,EAAE,CAAE,GAC3H,OAAO,eAAe7V,GAAS,SAAS,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAM,EAAE,CAAE,GAC7G,OAAO,eAAe7V,GAAS,eAAe,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAY,EAAE,CAAE,GACzH,OAAO,eAAe7V,GAAS,eAAe,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAY,EAAE,CAAE,GACzH,OAAO,eAAe7V,GAAS,wBAAwB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAqB,EAAE,CAAE,GAC3I,OAAO,eAAe7V,GAAS,wBAAwB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAqB,EAAE,CAAE,GAC3I,OAAO,eAAe7V,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAiB,EAAE,CAAE,GACnI,OAAO,eAAe7V,GAAS,mBAAmB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAgB,EAAE,CAAE,GACjI,OAAO,eAAe7V,GAAS,gCAAgC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAA6B,EAAE,CAAE,GAC3J,OAAO,eAAe7V,GAAS,8BAA8B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAA2B,EAAE,CAAE,GACvJ,OAAO,eAAe7V,GAAS,wBAAwB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAqB,EAAE,CAAE,GAC3I,OAAO,eAAe7V,GAAS,mBAAmB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAgB,EAAE,CAAE;AACjI,UAAM1d,IAAQ4d,GAAA;AACd/V,IAAAA,EAAA,MAAc7H,EAAM;AAAA;;;;;UC3EpB,OAAO,eAAe6d,IAAS,cAAc,EAAE,OAAO,IAAM;AAC5D,QAAMC,IAAQ7d,GAAA;AAAA,EACd,MAAM8d,UAAsBD,EAAM,sBAAsB;AAAA,IACpD,YAAYlJ,IAAW,SAAS;AAC5B,YAAMA,CAAQ,GACd,KAAK,eAAe,IAAI,YAAY,OAAO;AAAA,IACnD;AAAA,IACI,cAAc;AACV,aAAOmJ,EAAc;AAAA,IAC7B;AAAA,IACI,WAAWxvE,GAAOyvE,GAAW;AACzB,aAAQ,IAAI,cAAe,OAAOzvE,CAAK;AAAA,IAC/C;AAAA,IACI,SAASA,GAAOqmE,GAAU;AACtB,aAAIA,MAAa,UACN,KAAK,aAAa,OAAOrmE,CAAK,IAG7B,IAAI,YAAYqmE,CAAQ,EAAG,OAAOrmE,CAAK;AAAA,IAE3D;AAAA,IACI,SAAS4jE,GAAQhkE,GAAQ;AACrB,aAAIA,MAAW,SACJgkE,IAGAA,EAAO,MAAM,GAAGhkE,CAAM;AAAA,IAEzC;AAAA,IACI,YAAYA,GAAQ;AAChB,aAAO,IAAI,WAAWA,CAAM;AAAA,IACpC;AAAA,EACA;AACA,EAAA4vE,EAAc,cAAc,IAAI,WAAW,CAAC;AAAA,EAC5C,MAAME,EAAsB;AAAA,IACxB,YAAYC,GAAQ;AAChB,WAAK,SAASA,GACd,KAAK,UAAU,IAAIJ,EAAM,QAAO,GAChC,KAAK,mBAAmB,CAACxnB,MAAU;AAE/B,QADaA,EAAM,KACd,YAAW,EAAG,KAAK,CAAC6b,MAAW;AAChC,eAAK,QAAQ,KAAK,IAAI,WAAWA,CAAM,CAAC;AAAA,QACxD,GAAe,MAAM;AACL,cAAI2L,EAAM,KAAG,EAAI,QAAQ,MAAM,yCAAyC;AAAA,QACxF,CAAa;AAAA,MACb,GACQ,KAAK,OAAO,iBAAiB,WAAW,KAAK,gBAAgB;AAAA,IACrE;AAAA,IACI,QAAQjd,GAAU;AACd,kBAAK,OAAO,iBAAiB,SAASA,CAAQ,GACvCid,EAAM,WAAW,OAAO,MAAM,KAAK,OAAO,oBAAoB,SAASjd,CAAQ,CAAC;AAAA,IAC/F;AAAA,IACI,QAAQA,GAAU;AACd,kBAAK,OAAO,iBAAiB,SAASA,CAAQ,GACvCid,EAAM,WAAW,OAAO,MAAM,KAAK,OAAO,oBAAoB,SAASjd,CAAQ,CAAC;AAAA,IAC/F;AAAA,IACI,MAAMA,GAAU;AACZ,kBAAK,OAAO,iBAAiB,OAAOA,CAAQ,GACrCid,EAAM,WAAW,OAAO,MAAM,KAAK,OAAO,oBAAoB,OAAOjd,CAAQ,CAAC;AAAA,IAC7F;AAAA,IACI,OAAOA,GAAU;AACb,aAAO,KAAK,QAAQ,MAAMA,CAAQ;AAAA,IAC1C;AAAA,EACA;AAAA,EACA,MAAMsd,EAAsB;AAAA,IACxB,YAAYD,GAAQ;AAChB,WAAK,SAASA;AAAA,IACtB;AAAA,IACI,QAAQrd,GAAU;AACd,kBAAK,OAAO,iBAAiB,SAASA,CAAQ,GACvCid,EAAM,WAAW,OAAO,MAAM,KAAK,OAAO,oBAAoB,SAASjd,CAAQ,CAAC;AAAA,IAC/F;AAAA,IACI,QAAQA,GAAU;AACd,kBAAK,OAAO,iBAAiB,SAASA,CAAQ,GACvCid,EAAM,WAAW,OAAO,MAAM,KAAK,OAAO,oBAAoB,SAASjd,CAAQ,CAAC;AAAA,IAC/F;AAAA,IACI,MAAMA,GAAU;AACZ,kBAAK,OAAO,iBAAiB,OAAOA,CAAQ,GACrCid,EAAM,WAAW,OAAO,MAAM,KAAK,OAAO,oBAAoB,OAAOjd,CAAQ,CAAC;AAAA,IAC7F;AAAA,IACI,MAAMrN,GAAMohB,GAAU;AAClB,UAAI,OAAOphB,KAAS,UAAU;AAC1B,YAAIohB,MAAa,UAAaA,MAAa;AACvC,gBAAM,IAAI,MAAM,sFAAsFA,CAAQ,EAAE;AAEpH,aAAK,OAAO,KAAKphB,CAAI;AAAA,MACjC;AAEY,aAAK,OAAO,KAAKA,CAAI;AAEzB,aAAO,QAAQ,QAAO;AAAA,IAC9B;AAAA,IACI,MAAM;AACF,WAAK,OAAO,MAAK;AAAA,IACzB;AAAA,EACA;AACA,QAAM4qB,IAAe,IAAI,YAAW,GAC9BC,IAAO,OAAO,OAAO;AAAA,IACvB,eAAe,OAAO,OAAO;AAAA,MACzB,QAAQ,CAACzJ,MAAa,IAAImJ,EAAcnJ,CAAQ;AAAA,IACxD,CAAK;AAAA,IACD,iBAAiB,OAAO,OAAO;AAAA,MAC3B,SAAS,OAAO,OAAO;AAAA,QACnB,MAAM;AAAA,QACN,QAAQ,CAACprD,GAAKvS,MAAY;AACtB,cAAIA,EAAQ,YAAY;AACpB,kBAAM,IAAI,MAAM,sFAAsFA,EAAQ,OAAO,EAAE;AAE3H,iBAAO,QAAQ,QAAQmnE,EAAa,OAAO,KAAK,UAAU50D,GAAK,QAAW,CAAC,CAAC,CAAC;AAAA,QAC7F;AAAA,MACA,CAAS;AAAA,MACD,SAAS,OAAO,OAAO;AAAA,QACnB,MAAM;AAAA,QACN,QAAQ,CAAC2oD,GAAQl7D,MAAY;AACzB,cAAI,EAAEk7D,aAAkB;AACpB,kBAAM,IAAI,MAAM,2DAA2D;AAE/E,iBAAO,QAAQ,QAAQ,KAAK,MAAM,IAAI,YAAYl7D,EAAQ,OAAO,EAAE,OAAOk7D,CAAM,CAAC,CAAC;AAAA,QAClG;AAAA,OACS;AAAA,IACT,CAAK;AAAA,IACD,QAAQ,OAAO,OAAO;AAAA,MAClB,kBAAkB,CAAC+L,MAAW,IAAID,EAAsBC,CAAM;AAAA,MAC9D,kBAAkB,CAACA,MAAW,IAAIC,EAAsBD,CAAM;AAAA,IACtE,CAAK;AAAA,IACD;AAAA,IACA,OAAO,OAAO,OAAO;AAAA,MACjB,WAAWplB,GAAUwlB,MAAOnsE,GAAM;AAC9B,cAAM8yC,IAAS,WAAW6T,GAAUwlB,GAAI,GAAGnsE,CAAI;AAC/C,eAAO,EAAE,SAAS,MAAM,aAAa8yC,CAAM,EAAC;AAAA,MACxD;AAAA,MACQ,aAAa6T,MAAa3mD,GAAM;AAC5B,cAAM8yC,IAAS,WAAW6T,GAAU,GAAG,GAAG3mD,CAAI;AAC9C,eAAO,EAAE,SAAS,MAAM,aAAa8yC,CAAM,EAAC;AAAA,MACxD;AAAA,MACQ,YAAY6T,GAAUwlB,MAAOnsE,GAAM;AAC/B,cAAM8yC,IAAS,YAAY6T,GAAUwlB,GAAI,GAAGnsE,CAAI;AAChD,eAAO,EAAE,SAAS,MAAM,cAAc8yC,CAAM,EAAC;AAAA,MACzD;AAAA,KACK;AAAA,EACL,CAAC;AACD,WAASs5B,IAAM;AACX,WAAOF;AAAA,EACX;AACA,UAAC,SAAUE,GAAK;AACZ,aAAS3e,IAAU;AACf,MAAAke,EAAM,IAAI,QAAQO,CAAI;AAAA,IAC9B;AACI,IAAAE,EAAI,UAAU3e;AAAA,EAClB,GAAG2e,MAAQA,IAAM,CAAA,EAAG,GACpBV,GAAA,UAAkBU;;;;;ACtJlB,QAAIC,IAAmBC,MAAQA,GAAK,oBAAqB,OAAO,UAAU,SAAS3b,GAAGQ,GAAGplC,GAAGwgD,GAAI;AAC5F,MAAIA,MAAO,WAAWA,IAAKxgD;AAC3B,UAAI+nC,IAAO,OAAO,yBAAyB3C,GAAGplC,CAAC;AAC/C,OAAI,CAAC+nC,MAAS,SAASA,IAAO,CAAC3C,EAAE,aAAa2C,EAAK,YAAYA,EAAK,mBAClEA,IAAO,EAAE,YAAY,IAAM,KAAK,WAAW;AAAE,eAAO3C,EAAEplC,CAAC;AAAA,QAAI,IAE7D,OAAO,eAAe4kC,GAAG4b,GAAIzY,CAAI;AAAA,IACrC,MAAM,SAASnD,GAAGQ,GAAGplC,GAAGwgD,GAAI;AACxB,MAAIA,MAAO,WAAWA,IAAKxgD,IAC3B4kC,EAAE4b,CAAE,IAAIpb,EAAEplC,CAAC;AAAA,IACf,KACIygD,IAAgBF,MAAQA,GAAK,gBAAiB,SAASnb,GAAGuE,GAAS;AACnE,eAASnd,KAAK4Y,EAAG,CAAI5Y,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKmd,GAASnd,CAAC,KAAG8zB,EAAgB3W,GAASvE,GAAG5Y,CAAC;AAAA,IAC5H;AACA,WAAO,eAAcmd,GAAU,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,0BAAkCA,EAAA,uBAA+BA,EAAA,uBAA+B,QAClF5H,GAAA,EAER,QAAQ,QAAO;AACrB,UAAM6d,IAAQ7c,GAAA;AACd,IAAA0d,EAAa1d,GAAA,GAA0B4G,CAAO;AAAA,IAC9C,MAAM+W,UAA6Bd,EAAM,sBAAsB;AAAA,MAC3D,YAAYe,GAAM;AACd,cAAK,GACL,KAAK,UAAU,IAAIf,EAAM,QAAO,GAChC,KAAK,mBAAmB,CAACxnB,MAAU;AAC/B,eAAK,QAAQ,KAAKA,EAAM,IAAI;AAAA,QACxC,GACQuoB,EAAK,iBAAiB,SAAS,CAACvoB,MAAU,KAAK,UAAUA,CAAK,CAAC,GAC/DuoB,EAAK,YAAY,KAAK;AAAA,MAC9B;AAAA,MACI,OAAO/lB,GAAU;AACb,eAAO,KAAK,QAAQ,MAAMA,CAAQ;AAAA,MAC1C;AAAA,IACA;AACA+O,IAAAA,EAAA,uBAA+B+W;AAAA,IAC/B,MAAME,UAA6BhB,EAAM,sBAAsB;AAAA,MAC3D,YAAYe,GAAM;AACd,cAAK,GACL,KAAK,OAAOA,GACZ,KAAK,aAAa,GAClBA,EAAK,iBAAiB,SAAS,CAACvoB,MAAU,KAAK,UAAUA,CAAK,CAAC;AAAA,MACvE;AAAA,MACI,MAAM9sC,GAAK;AACP,YAAI;AACA,sBAAK,KAAK,YAAYA,CAAG,GAClB,QAAQ,QAAO;AAAA,QAClC,SACekU,GAAO;AACV,sBAAK,YAAYA,GAAOlU,CAAG,GACpB,QAAQ,OAAOkU,CAAK;AAAA,QACvC;AAAA,MACA;AAAA,MACI,YAAYA,GAAOlU,GAAK;AACpB,aAAK,cACL,KAAK,UAAUkU,GAAOlU,GAAK,KAAK,UAAU;AAAA,MAClD;AAAA,MACI,MAAM;AAAA,MACV;AAAA,IACA;AACAq+C,IAAAA,EAAA,uBAA+BiX;AAC/B,aAAS5H,EAAwB6H,GAAQC,GAAQ5H,GAAQngE,GAAS;AAC9D,aAAImgE,MAAW,WACXA,IAAS0G,EAAM,aAEfA,EAAM,mBAAmB,GAAG7mE,CAAO,MACnCA,IAAU,EAAE,oBAAoBA,EAAO,QAEhC6mE,EAAM,yBAAyBiB,GAAQC,GAAQ5H,GAAQngE,CAAO;AAAA,IAC7E;AACA4wD,IAAAA,EAAA,0BAAkCqP;AAAA;;;;wBCrElC+H,KAAiBhf,GAAA;;;;;;;UCDjB,OAAO,eAAeiP,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,2BAAmCA,GAAA,4BAAoCA,GAAA,sBAA8BA,GAAA,uBAA+BA,GAAA,mBAA2BA,GAAA,mBAA2B;AAC1L,QAAMgQ,IAAmBjf,GAAA;AACzB,MAAIkf;AACJ,GAAC,SAAUA,GAAkB;AACzB,IAAAA,EAAiB,iBAAoB,kBACrCA,EAAiB,iBAAoB,kBACrCA,EAAiB,OAAU;AAAA,EAC/B,GAAGA,MAAqBjQ,GAAA,mBAA2BiQ,IAAmB,CAAA,EAAG;AAAA,EACzE,MAAMC,EAAiB;AAAA,IACnB,YAAYjjB,GAAQ;AAChB,WAAK,SAASA;AAAA,IACtB;AAAA,EACA;AACA,EAAA+S,GAAA,mBAA2BkQ;AAAA,EAC3B,MAAMC,UAA6BH,EAAiB,aAAa;AAAA,IAC7D,YAAY/iB,GAAQ;AAChB,YAAMA,CAAM;AAAA,IACpB;AAAA,EACA;AACA,EAAA+S,GAAA,uBAA+BmQ;AAAA,EAC/B,MAAMC,UAA4BJ,EAAiB,YAAY;AAAA,IAC3D,YAAY/iB,GAAQ;AAChB,YAAMA,GAAQ+iB,EAAiB,oBAAoB,MAAM;AAAA,IACjE;AAAA,EACA;AACA,EAAAhQ,GAAA,sBAA8BoQ;AAAA,EAC9B,MAAMC,UAAkCL,EAAiB,kBAAkB;AAAA,IACvE,YAAY/iB,GAAQ;AAChB,YAAMA,CAAM;AAAA,IACpB;AAAA,EACA;AACA,EAAA+S,GAAA,4BAAoCqQ;AAAA,EACpC,MAAMC,UAAiCN,EAAiB,iBAAiB;AAAA,IACrE,YAAY/iB,GAAQ;AAChB,YAAMA,GAAQ+iB,EAAiB,oBAAoB,MAAM;AAAA,IACjE;AAAA,EACA;AACA,SAAAhQ,GAAA,2BAAmCsQ;;;;;UCtCnC,OAAO,eAAel0B,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,gBAAwBA,GAAA,aAAqBA,iBAAsBA,GAAA,QAAgBA,GAAA,OAAeA,GAAA,QAAgBA,YAAiBA,GAAA,SAAiBA,GAAA,UAAkB;AACtK,WAAS2L,EAAQ1oD,GAAO;AACpB,WAAOA,MAAU,MAAQA,MAAU;AAAA,EACvC;AACA,EAAA+8C,GAAA,UAAkB2L;AAClB,WAASC,EAAO3oD,GAAO;AACnB,WAAO,OAAOA,KAAU,YAAYA,aAAiB;AAAA,EACzD;AACA,EAAA+8C,GAAA,SAAiB4L;AACjB,WAAS90C,EAAO7T,GAAO;AACnB,WAAO,OAAOA,KAAU,YAAYA,aAAiB;AAAA,EACzD;AACA,EAAA+8C,GAAA,SAAiBlpC;AACjB,WAASsb,EAAMnvB,GAAO;AAClB,WAAOA,aAAiB;AAAA,EAC5B;AACA,EAAA+8C,GAAA,QAAgB5tB;AAChB,WAASzuB,EAAKV,GAAO;AACjB,WAAO,OAAOA,KAAU;AAAA,EAC5B;AACA,EAAA+8C,GAAA,OAAer8C;AACf,WAASlB,EAAMQ,GAAO;AAClB,WAAO,MAAM,QAAQA,CAAK;AAAA,EAC9B;AACA,EAAA+8C,GAAA,QAAgBv9C;AAChB,WAAS8xD,EAAYtxD,GAAO;AACxB,WAAOR,EAAMQ,CAAK,KAAKA,EAAM,MAAM,CAAAuxD,MAAQ5I,EAAO4I,CAAI,CAAC;AAAA,EAC3D;AACA,EAAAxU,GAAA,cAAsBuU;AACtB,WAASxI,EAAW9oD,GAAO+oD,GAAO;AAC9B,WAAO,MAAM,QAAQ/oD,CAAK,KAAKA,EAAM,MAAM+oD,CAAK;AAAA,EACpD;AACA,EAAAhM,GAAA,aAAqB+L;AACrB,WAASD,EAAc7oD,GAAO;AAI1B,WAAOA,MAAU,QAAQ,OAAOA,KAAU;AAAA,EAC9C;AACA,SAAA+8C,GAAA,gBAAwB8L;;;;;UCxCxB,OAAO,eAAeqoB,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,wBAAgC;AAChC,QAAMlK,IAAatV,GAAA;AAQnB,MAAIyf;AACJ,UAAC,SAAUA,GAAuB;AAC9B,IAAAA,EAAsB,SAAS,+BAC/BA,EAAsB,mBAAmBnK,EAAW,iBAAiB,gBACrEmK,EAAsB,OAAO,IAAInK,EAAW,oBAAoBmK,EAAsB,MAAM;AAAA,EAChG,GAAGA,MAA0BD,GAAA,wBAAgCC,IAAwB,CAAA,EAAG;;;;;UCfxF,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,wBAAgC;AAChC,QAAMpK,IAAatV,GAAA;AAQnB,MAAI2f;AACJ,UAAC,SAAUA,GAAuB;AAC9B,IAAAA,EAAsB,SAAS,+BAC/BA,EAAsB,mBAAmBrK,EAAW,iBAAiB,gBACrEqK,EAAsB,OAAO,IAAIrK,EAAW,oBAAoBqK,EAAsB,MAAM;AAAA,EAChG,GAAGA,MAA0BD,GAAA,wBAAgCC,IAAwB,CAAA,EAAG;;;;;UCfxF,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,wCAAgDA,GAAA,0BAAkC;AAClF,QAAMtK,IAAatV,GAAA;AAInB,MAAI6f;AACJ,GAAC,SAAUA,GAAyB;AAChC,IAAAA,EAAwB,SAAS,8BACjCA,EAAwB,mBAAmBvK,EAAW,iBAAiB,gBACvEuK,EAAwB,OAAO,IAAIvK,EAAW,qBAAqBuK,EAAwB,MAAM;AAAA,EACrG,GAAGA,MAA4BD,GAAA,0BAAkCC,IAA0B,CAAA,EAAG;AAK9F,MAAIC;AACJ,UAAC,SAAUA,GAAuC;AAC9C,IAAAA,EAAsC,SAAS,uCAC/CA,EAAsC,mBAAmBxK,EAAW,iBAAiB,gBACrFwK,EAAsC,OAAO,IAAIxK,EAAW,yBAAyBwK,EAAsC,MAAM;AAAA,EACrI,GAAGA,MAA0CF,GAAA,wCAAgDE,IAAwC,CAAA,EAAG;;;;;UCrBxI,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,uBAA+B;AAC/B,QAAMzK,IAAatV,GAAA;AAWnB,MAAIggB;AACJ,UAAC,SAAUA,GAAsB;AAC7B,IAAAA,EAAqB,SAAS,2BAC9BA,EAAqB,mBAAmB1K,EAAW,iBAAiB,gBACpE0K,EAAqB,OAAO,IAAI1K,EAAW,oBAAoB0K,EAAqB,MAAM;AAAA,EAC9F,GAAGA,MAAyBD,GAAA,uBAA+BC,IAAuB,CAAA,EAAG;;;;;UClBrF,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,2BAAmCA,GAAA,uBAA+B;AAClE,QAAM3K,IAAatV,GAAA;AAOnB,MAAIkgB;AACJ,GAAC,SAAUA,GAAsB;AAC7B,IAAAA,EAAqB,SAAS,8BAC9BA,EAAqB,mBAAmB5K,EAAW,iBAAiB,gBACpE4K,EAAqB,OAAO,IAAI5K,EAAW,oBAAoB4K,EAAqB,MAAM;AAAA,EAC9F,GAAGA,MAAyBD,GAAA,uBAA+BC,IAAuB,CAAA,EAAG;AAOrF,MAAIC;AACJ,UAAC,SAAUA,GAA0B;AACjC,IAAAA,EAAyB,SAAS,kCAClCA,EAAyB,mBAAmB7K,EAAW,iBAAiB,gBACxE6K,EAAyB,OAAO,IAAI7K,EAAW,oBAAoB6K,EAAyB,MAAM;AAAA,EACtG,GAAGA,MAA6BF,GAAA,2BAAmCE,IAA2B,CAAA,EAAG;;;;;UC1BjG,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,6BAAqCA,GAAA,sBAA8B;AACnE,QAAM9K,IAAatV,GAAA;AAOnB,MAAIqgB;AACJ,GAAC,SAAUA,GAAqB;AAC5B,IAAAA,EAAoB,SAAS,6BAC7BA,EAAoB,mBAAmB/K,EAAW,iBAAiB,gBACnE+K,EAAoB,OAAO,IAAI/K,EAAW,oBAAoB+K,EAAoB,MAAM;AAAA,EAC5F,GAAGA,MAAwBD,GAAA,sBAA8BC,IAAsB,CAAA,EAAG;AAKlF,MAAIC;AACJ,UAAC,SAAUA,GAA4B;AACnC,IAAAA,EAA2B,SAAS,kCACpCA,EAA2B,mBAAmBhL,EAAW,iBAAiB,gBAC1EgL,EAA2B,OAAO,IAAIhL,EAAW,qBAAqBgL,EAA2B,MAAM;AAAA,EAC3G,GAAGA,MAA+BF,GAAA,6BAAqCE,IAA6B,CAAA,EAAG;;;;;UCxBvG,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,qBAA6B;AAC7B,QAAMjL,IAAatV,GAAA;AASnB,MAAIwgB;AACJ,UAAC,SAAUA,GAAoB;AAC3B,IAAAA,EAAmB,SAAS,4BAC5BA,EAAmB,mBAAmBlL,EAAW,iBAAiB,gBAClEkL,EAAmB,OAAO,IAAIlL,EAAW,oBAAoBkL,EAAmB,MAAM;AAAA,EAC1F,GAAGA,MAAuBD,GAAA,qBAA6BC,IAAqB,CAAA,EAAG;;;;;UChB/E,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,wBAAgC;AAChC,QAAMnL,IAAatV,GAAA;AAOnB,MAAI0gB;AACJ,UAAC,SAAUA,GAAuB;AAC9B,IAAAA,EAAsB,SAAS,+BAC/BA,EAAsB,mBAAmBpL,EAAW,iBAAiB,gBACrEoL,EAAsB,OAAO,IAAIpL,EAAW,oBAAoBoL,EAAsB,MAAM;AAAA,EAChG,GAAGA,MAA0BD,GAAA,wBAAgCC,IAAwB,CAAA,EAAG;;;;;UCdxF,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,qCAA6CA,GAAA,gCAAwCA,GAAA,mBAA2B;AAChH,QAAM1B,IAAmBjf,GAAA,GACnBsV,IAAatU,GAAA;AACnB,MAAI4f;AACJ,GAAC,SAAUA,GAAkB;AACzB,IAAAA,EAAiB,OAAO,IAAI3B,EAAiB,aAAY;AACzD,aAAS5zB,EAAG/8C,GAAO;AACf,aAAOA,MAAUsyE,EAAiB;AAAA,IAC1C;AACI,IAAAA,EAAiB,KAAKv1B;AAAA,EAC1B,GAAGu1B,MAAqBD,GAAA,mBAA2BC,IAAmB,CAAA,EAAG;AAKzE,MAAIC;AACJ,GAAC,SAAUA,GAA+B;AACtC,IAAAA,EAA8B,SAAS,kCACvCA,EAA8B,mBAAmBvL,EAAW,iBAAiB,gBAC7EuL,EAA8B,OAAO,IAAIvL,EAAW,oBAAoBuL,EAA8B,MAAM;AAAA,EAChH,GAAGA,MAAkCF,GAAA,gCAAwCE,IAAgC,CAAA,EAAG;AAKhH,MAAIC;AACJ,UAAC,SAAUA,GAAoC;AAC3C,IAAAA,EAAmC,SAAS,kCAC5CA,EAAmC,mBAAmBxL,EAAW,iBAAiB,gBAClFwL,EAAmC,OAAO,IAAIxL,EAAW,yBAAyBwL,EAAmC,MAAM;AAAA,EAC/H,GAAGA,MAAuCH,GAAA,qCAA6CG,IAAqC,CAAA,EAAG;;;;;UC/B/H,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,oCAA4CA,GAAA,oCAA4CA,GAAA,8BAAsC;AAC9H,QAAMzL,IAAatV,GAAA;AAOnB,MAAIghB;AACJ,GAAC,SAAUA,GAA6B;AACpC,IAAAA,EAA4B,SAAS,qCACrCA,EAA4B,mBAAmB1L,EAAW,iBAAiB,gBAC3E0L,EAA4B,OAAO,IAAI1L,EAAW,oBAAoB0L,EAA4B,MAAM;AAAA,EAC5G,GAAGA,MAAgCD,GAAA,8BAAsCC,IAA8B,CAAA,EAAG;AAM1G,MAAIC;AACJ,GAAC,SAAUA,GAAmC;AAC1C,IAAAA,EAAkC,SAAS,+BAC3CA,EAAkC,mBAAmB3L,EAAW,iBAAiB,gBACjF2L,EAAkC,OAAO,IAAI3L,EAAW,oBAAoB2L,EAAkC,MAAM;AAAA,EACxH,GAAGA,MAAsCF,GAAA,oCAA4CE,IAAoC,CAAA,EAAG;AAM5H,MAAIC;AACJ,UAAC,SAAUA,GAAmC;AAC1C,IAAAA,EAAkC,SAAS,+BAC3CA,EAAkC,mBAAmB5L,EAAW,iBAAiB,gBACjF4L,EAAkC,OAAO,IAAI5L,EAAW,oBAAoB4L,EAAkC,MAAM;AAAA,EACxH,GAAGA,MAAsCH,GAAA,oCAA4CG,IAAoC,CAAA,EAAG;;;;;UCpC5H,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,+BAAuCA,GAAA,6BAAqCA,GAAA,6BAAqCA,GAAA,wBAAgCA,GAAA,iCAAyCA,GAAA,cAAsB;AAChN,QAAM7L,IAAatV,GAAA;AAEnB,MAAIohB;AACJ,GAAC,SAAUA,GAAa;AACpB,IAAAA,EAAY,WAAW;AAAA,EAC3B,GAAGA,MAAgBD,GAAA,cAAsBC,IAAc,CAAA,EAAG;AAC1D,MAAIC;AACJ,GAAC,SAAUA,GAAgC;AACvC,IAAAA,EAA+B,SAAS,+BACxCA,EAA+B,OAAO,IAAI/L,EAAW,iBAAiB+L,EAA+B,MAAM;AAAA,EAC/G,GAAGA,MAAmCF,GAAA,iCAAyCE,IAAiC,CAAA,EAAG;AAInH,MAAIC;AACJ,GAAC,SAAUA,GAAuB;AAC9B,IAAAA,EAAsB,SAAS,oCAC/BA,EAAsB,mBAAmBhM,EAAW,iBAAiB,gBACrEgM,EAAsB,OAAO,IAAIhM,EAAW,oBAAoBgM,EAAsB,MAAM,GAC5FA,EAAsB,qBAAqBD,EAA+B;AAAA,EAC9E,GAAGC,MAA0BH,GAAA,wBAAgCG,IAAwB,CAAA,EAAG;AAIxF,MAAIC;AACJ,GAAC,SAAUA,GAA4B;AACnC,IAAAA,EAA2B,SAAS,0CACpCA,EAA2B,mBAAmBjM,EAAW,iBAAiB,gBAC1EiM,EAA2B,OAAO,IAAIjM,EAAW,oBAAoBiM,EAA2B,MAAM,GACtGA,EAA2B,qBAAqBF,EAA+B;AAAA,EACnF,GAAGE,MAA+BJ,GAAA,6BAAqCI,IAA6B,CAAA,EAAG;AAIvG,MAAIC;AACJ,GAAC,SAAUA,GAA4B;AACnC,IAAAA,EAA2B,SAAS,qCACpCA,EAA2B,mBAAmBlM,EAAW,iBAAiB,gBAC1EkM,EAA2B,OAAO,IAAIlM,EAAW,oBAAoBkM,EAA2B,MAAM,GACtGA,EAA2B,qBAAqBH,EAA+B;AAAA,EACnF,GAAGG,MAA+BL,GAAA,6BAAqCK,IAA6B,CAAA,EAAG;AAIvG,MAAIC;AACJ,UAAC,SAAUA,GAA8B;AACrC,IAAAA,EAA6B,SAAS,oCACtCA,EAA6B,mBAAmBnM,EAAW,iBAAiB,gBAC5EmM,EAA6B,OAAO,IAAInM,EAAW,qBAAqBmM,EAA6B,MAAM;AAAA,EAC/G,GAAGA,MAAiCN,GAAA,+BAAuCM,IAA+B,CAAA,EAAG;;;;;UCnD7G,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,sBAA8B;AAC9B,QAAMpM,IAAatV,GAAA;AASnB,MAAI2hB;AACJ,UAAC,SAAUA,GAAqB;AAC5B,IAAAA,EAAoB,SAAS,uBAC7BA,EAAoB,mBAAmBrM,EAAW,iBAAiB,gBACnEqM,EAAoB,OAAO,IAAIrM,EAAW,oBAAoBqM,EAAoB,MAAM;AAAA,EAC5F,GAAGA,MAAwBD,GAAA,sBAA8BC,IAAsB,CAAA,EAAG;;;;;UChBlF,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,4BAAoC;AACpC,QAAMtM,IAAatV,GAAA;AAMnB,MAAI6hB;AACJ,UAAC,SAAUA,GAA2B;AAClC,IAAAA,EAA0B,SAAS,mCACnCA,EAA0B,mBAAmBvM,EAAW,iBAAiB,gBACzEuM,EAA0B,OAAO,IAAIvM,EAAW,oBAAoBuM,EAA0B,MAAM;AAAA,EACxG,GAAGA,MAA8BD,GAAA,4BAAoCC,IAA4B,CAAA,EAAG;;;;;UCbpG,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,yBAAiCA,GAAA,6BAAqCA,GAAA,6BAAqCA,GAAA,yBAAiCA,GAAA,6BAAqCA,GAAA,yBAAiCA,GAAA,2BAAmC;AACrP,QAAMxM,IAAatV,GAAA;AAOnB,MAAI+hB;AACJ,GAAC,SAAUA,GAA0B;AAIjC,IAAAA,EAAyB,OAAO,QAIhCA,EAAyB,SAAS;AAAA,EACtC,GAAGA,MAA6BD,GAAA,2BAAmCC,IAA2B,CAAA,EAAG;AAWjG,MAAIC;AACJ,GAAC,SAAUA,GAAwB;AAC/B,IAAAA,EAAuB,SAAS,6BAChCA,EAAuB,mBAAmB1M,EAAW,iBAAiB,gBACtE0M,EAAuB,OAAO,IAAI1M,EAAW,oBAAoB0M,EAAuB,MAAM;AAAA,EAClG,GAAGA,MAA2BF,GAAA,yBAAiCE,IAAyB,CAAA,EAAG;AAO3F,MAAIC;AACJ,GAAC,SAAUA,GAA4B;AACnC,IAAAA,EAA2B,SAAS,4BACpCA,EAA2B,mBAAmB3M,EAAW,iBAAiB,gBAC1E2M,EAA2B,OAAO,IAAI3M,EAAW,yBAAyB2M,EAA2B,MAAM;AAAA,EAC/G,GAAGA,MAA+BH,GAAA,6BAAqCG,IAA6B,CAAA,EAAG;AAOvG,MAAIC;AACJ,GAAC,SAAUA,GAAwB;AAC/B,IAAAA,EAAuB,SAAS,6BAChCA,EAAuB,mBAAmB5M,EAAW,iBAAiB,gBACtE4M,EAAuB,OAAO,IAAI5M,EAAW,oBAAoB4M,EAAuB,MAAM;AAAA,EAClG,GAAGA,MAA2BJ,GAAA,yBAAiCI,IAAyB,CAAA,EAAG;AAO3F,MAAIC;AACJ,GAAC,SAAUA,GAA4B;AACnC,IAAAA,EAA2B,SAAS,4BACpCA,EAA2B,mBAAmB7M,EAAW,iBAAiB,gBAC1E6M,EAA2B,OAAO,IAAI7M,EAAW,yBAAyB6M,EAA2B,MAAM;AAAA,EAC/G,GAAGA,MAA+BL,GAAA,6BAAqCK,IAA6B,CAAA,EAAG;AAOvG,MAAIC;AACJ,GAAC,SAAUA,GAA4B;AACnC,IAAAA,EAA2B,SAAS,4BACpCA,EAA2B,mBAAmB9M,EAAW,iBAAiB,gBAC1E8M,EAA2B,OAAO,IAAI9M,EAAW,yBAAyB8M,EAA2B,MAAM;AAAA,EAC/G,GAAGA,MAA+BN,GAAA,6BAAqCM,IAA6B,CAAA,EAAG;AAOvG,MAAIC;AACJ,UAAC,SAAUA,GAAwB;AAC/B,IAAAA,EAAuB,SAAS,6BAChCA,EAAuB,mBAAmB/M,EAAW,iBAAiB,gBACtE+M,EAAuB,OAAO,IAAI/M,EAAW,oBAAoB+M,EAAuB,MAAM;AAAA,EAClG,GAAGA,MAA2BP,GAAA,yBAAiCO,IAAyB,CAAA,EAAG;;;;;UC/F3F,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,iBAAyBA,GAAA,cAAsBA,GAAA,kBAA0B;AACzE,QAAMhN,IAAatV,GAAA;AAMnB,MAAIuiB;AACJ,GAAC,SAAUA,GAAiB;AAIxB,IAAAA,EAAgB,WAAW,YAI3BA,EAAgB,UAAU,WAI1BA,EAAgB,QAAQ,SAIxBA,EAAgB,SAAS,UAIzBA,EAAgB,SAAS;AAAA,EAC7B,GAAGA,MAAoBD,GAAA,kBAA0BC,IAAkB,CAAA,EAAG;AAMtE,MAAIC;AACJ,GAAC,SAAUA,GAAa;AAIpB,IAAAA,EAAY,UAAU,UAItBA,EAAY,UAAU,UAKtBA,EAAY,QAAQ;AAAA,EACxB,GAAGA,MAAgBF,GAAA,cAAsBE,IAAc,CAAA,EAAG;AAM1D,MAAIC;AACJ,UAAC,SAAUA,GAAgB;AACvB,IAAAA,EAAe,SAAS,wBACxBA,EAAe,mBAAmBnN,EAAW,iBAAiB,gBAC9DmN,EAAe,OAAO,IAAInN,EAAW,oBAAoBmN,EAAe,MAAM;AAAA,EAClF,GAAGA,MAAmBH,GAAA,iBAAyBG,IAAiB,CAAA,EAAG;;;;;UC9DnE,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,+BAAuCA,GAAA,iCAAyCA,GAAA,8BAAsC;AACtH,QAAMpN,IAAatV,GAAA;AAOnB,MAAI2iB;AACJ,GAAC,SAAUA,GAA6B;AACpC,IAAAA,EAA4B,SAAS,qCACrCA,EAA4B,mBAAmBrN,EAAW,iBAAiB,gBAC3EqN,EAA4B,OAAO,IAAIrN,EAAW,oBAAoBqN,EAA4B,MAAM;AAAA,EAC5G,GAAGA,MAAgCD,GAAA,8BAAsCC,IAA8B,CAAA,EAAG;AAM1G,MAAIC;AACJ,GAAC,SAAUA,GAAgC;AACvC,IAAAA,EAA+B,SAAS,4BACxCA,EAA+B,mBAAmBtN,EAAW,iBAAiB,gBAC9EsN,EAA+B,OAAO,IAAItN,EAAW,oBAAoBsN,EAA+B,MAAM;AAAA,EAClH,GAAGA,MAAmCF,GAAA,iCAAyCE,IAAiC,CAAA,EAAG;AAMnH,MAAIC;AACJ,UAAC,SAAUA,GAA8B;AACrC,IAAAA,EAA6B,SAAS,0BACtCA,EAA6B,mBAAmBvN,EAAW,iBAAiB,gBAC5EuN,EAA6B,OAAO,IAAIvN,EAAW,oBAAoBuN,EAA6B,MAAM;AAAA,EAC9G,GAAGA,MAAiCH,GAAA,+BAAuCG,IAA+B,CAAA,EAAG;;;;;UCpC7G,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,4BAAoCA,GAAA,qBAA6B;AACjE,QAAMxN,IAAatV,GAAA;AAQnB,MAAI+iB;AACJ,GAAC,SAAUA,GAAoB;AAC3B,IAAAA,EAAmB,SAAS,4BAC5BA,EAAmB,mBAAmBzN,EAAW,iBAAiB,gBAClEyN,EAAmB,OAAO,IAAIzN,EAAW,oBAAoByN,EAAmB,MAAM;AAAA,EAC1F,GAAGA,MAAuBD,GAAA,qBAA6BC,IAAqB,CAAA,EAAG;AAI/E,MAAIC;AACJ,UAAC,SAAUA,GAA2B;AAClC,IAAAA,EAA0B,SAAS,iCACnCA,EAA0B,mBAAmB1N,EAAW,iBAAiB,gBACzE0N,EAA0B,OAAO,IAAI1N,EAAW,qBAAqB0N,EAA0B,MAAM;AAAA,EACzG,GAAGA,MAA8BF,GAAA,4BAAoCE,IAA4B,CAAA,EAAG;;;;;UCxBpG,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,0BAAkCA,GAAA,0BAAkCA,GAAA,mBAA2B;AAC/F,QAAM3N,IAAatV,GAAA;AAQnB,MAAIkjB;AACJ,GAAC,SAAUA,GAAkB;AACzB,IAAAA,EAAiB,SAAS,0BAC1BA,EAAiB,mBAAmB5N,EAAW,iBAAiB,gBAChE4N,EAAiB,OAAO,IAAI5N,EAAW,oBAAoB4N,EAAiB,MAAM;AAAA,EACtF,GAAGA,MAAqBD,GAAA,mBAA2BC,IAAmB,CAAA,EAAG;AAQzE,MAAIC;AACJ,GAAC,SAAUA,GAAyB;AAChC,IAAAA,EAAwB,SAAS,qBACjCA,EAAwB,mBAAmB7N,EAAW,iBAAiB,gBACvE6N,EAAwB,OAAO,IAAI7N,EAAW,oBAAoB6N,EAAwB,MAAM;AAAA,EACpG,GAAGA,MAA4BF,GAAA,0BAAkCE,IAA0B,CAAA,EAAG;AAI9F,MAAIC;AACJ,UAAC,SAAUA,GAAyB;AAChC,IAAAA,EAAwB,SAAS,+BACjCA,EAAwB,mBAAmB9N,EAAW,iBAAiB,gBACvE8N,EAAwB,OAAO,IAAI9N,EAAW,qBAAqB8N,EAAwB,MAAM;AAAA,EACrG,GAAGA,MAA4BH,GAAA,0BAAkCG,IAA0B,CAAA,EAAG;;;;;UCrC9F,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,2BAAmCA,GAAA,6BAAqCA,GAAA,4BAAoCA,kCAAuCA,GAAA,mCAA2C;AAC9L,QAAMpE,IAAmBjf,GAAA,GACnBnU,IAAKmV,GAAA,GACLsU,IAAapU,GAAA;AAInB,MAAIoiB;AACJ,GAAC,SAAUA,GAAkC;AACzC,aAASj4B,EAAG/8C,GAAO;AACf,YAAMs9C,IAAYt9C;AAClB,aAAOs9C,KAAaC,EAAG,QAAQD,EAAU,gBAAgB;AAAA,IACjE;AACI,IAAA03B,EAAiC,KAAKj4B;AAAA,EAC1C,GAAGi4B,MAAqCD,GAAA,mCAA2CC,IAAmC,CAAA,EAAG;AAMzH,MAAIC;AACJ,GAAC,SAAUA,GAA8B;AAKrC,IAAAA,EAA6B,OAAO,QAKpCA,EAA6B,YAAY;AAAA,EAC7C,GAAGA,MAAiCF,GAAA,+BAAuCE,IAA+B,CAAA,EAAG;AAM7G,MAAIC;AACJ,GAAC,SAAUA,GAA2B;AAClC,IAAAA,EAA0B,SAAS,2BACnCA,EAA0B,mBAAmBlO,EAAW,iBAAiB,gBACzEkO,EAA0B,OAAO,IAAIlO,EAAW,oBAAoBkO,EAA0B,MAAM,GACpGA,EAA0B,gBAAgB,IAAIvE,EAAiB,aAAY;AAAA,EAC/E,GAAGuE,MAA8BH,GAAA,4BAAoCG,IAA4B,CAAA,EAAG;AAMpG,MAAIC;AACJ,GAAC,SAAUA,GAA4B;AACnC,IAAAA,EAA2B,SAAS,wBACpCA,EAA2B,mBAAmBnO,EAAW,iBAAiB,gBAC1EmO,EAA2B,OAAO,IAAInO,EAAW,oBAAoBmO,EAA2B,MAAM,GACtGA,EAA2B,gBAAgB,IAAIxE,EAAiB,aAAY;AAAA,EAChF,GAAGwE,MAA+BJ,GAAA,6BAAqCI,IAA6B,CAAA,EAAG;AAMvG,MAAIC;AACJ,UAAC,SAAUA,GAA0B;AACjC,IAAAA,EAAyB,SAAS,gCAClCA,EAAyB,mBAAmBpO,EAAW,iBAAiB,gBACxEoO,EAAyB,OAAO,IAAIpO,EAAW,qBAAqBoO,EAAyB,MAAM;AAAA,EACvG,GAAGA,MAA6BL,GAAA,2BAAmCK,IAA2B,CAAA,EAAG;;;;;UCpEjG,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,uCAA+CA,yCAA8CA,GAAA,wCAAgDA,GAAA,0BAAkCA,yCAA8CA,GAAA,uCAA+CA,GAAA,mBAA2BA,kBAAuBA,GAAA,mBAA2BA,GAAA,mBAA2B;AACpX,QAAMC,IAAgC5jB,IAChCnU,IAAKmV,GAAA,GACLsU,IAAapU,GAAA;AAMnB,MAAI2iB;AACJ,GAAC,SAAUA,GAAkB;AAIzB,IAAAA,EAAiB,SAAS,GAI1BA,EAAiB,OAAO;AACxB,aAASx4B,EAAG/8C,GAAO;AACf,aAAOA,MAAU,KAAKA,MAAU;AAAA,IACxC;AACI,IAAAu1E,EAAiB,KAAKx4B;AAAA,EAC1B,GAAGw4B,MAAqBF,GAAA,mBAA2BE,IAAmB,CAAA,EAAG;AACzE,MAAIC;AACJ,GAAC,SAAUA,GAAkB;AACzB,aAASp4B,EAAOq4B,GAAgBC,GAAS;AACrC,YAAM71E,IAAS,EAAE,gBAAA41E,EAAc;AAC/B,cAAIC,MAAY,MAAQA,MAAY,QAChC71E,EAAO,UAAU61E,IAEd71E;AAAA,IACf;AACI,IAAA21E,EAAiB,SAASp4B;AAC1B,aAASL,EAAG/8C,GAAO;AACf,YAAMs9C,IAAYt9C;AAClB,aAAOu9C,EAAG,cAAcD,CAAS,KAAKg4B,EAA8B,SAAS,GAAGh4B,EAAU,cAAc,MAAMA,EAAU,YAAY,UAAaC,EAAG,QAAQD,EAAU,OAAO;AAAA,IACrL;AACI,IAAAk4B,EAAiB,KAAKz4B;AACtB,aAASwY,EAAO9X,GAAK32C,GAAO;AACxB,aAAI22C,MAAQ32C,IACD,KAEP22C,KAAQ,QAA6B32C,MAAU,QAAQA,MAAU,SAC1D,KAEJ22C,EAAI,mBAAmB32C,EAAM,kBAAkB22C,EAAI,YAAY32C,EAAM;AAAA,IACpF;AACI,IAAA0uE,EAAiB,SAASjgB;AAAA,EAC9B,GAAGigB,MAAqBH,GAAA,mBAA2BG,IAAmB,CAAA,EAAG;AACzE,MAAIG;AACJ,GAAC,SAAUA,GAAc;AACrB,aAASv4B,EAAOgC,GAAMkI,GAAU;AAC5B,aAAO,EAAE,MAAAlI,GAAM,UAAAkI,EAAQ;AAAA,IAC/B;AACI,IAAAquB,EAAa,SAASv4B;AACtB,aAASL,EAAG/8C,GAAO;AACf,YAAMs9C,IAAYt9C;AAClB,aAAOu9C,EAAG,cAAcD,CAAS,KAAKi4B,EAAiB,GAAGj4B,EAAU,IAAI,KAAKg4B,EAA8B,YAAY,GAAGh4B,EAAU,QAAQ,MACvIA,EAAU,aAAa,UAAaC,EAAG,cAAcD,EAAU,QAAQ;AAAA,IACpF;AACI,IAAAq4B,EAAa,KAAK54B;AAClB,aAAS0K,EAAKhK,GAAKC,GAAK;AACpB,YAAM79C,IAAS,oBAAI,IAAG;AACtB,aAAI49C,EAAI,aAAaC,EAAI,YACrB79C,EAAO,IAAI,UAAU,GAErB49C,EAAI,SAASC,EAAI,QACjB79C,EAAO,IAAI,MAAM,GAEjB49C,EAAI,qBAAqBC,EAAI,oBAC7B79C,EAAO,IAAI,kBAAkB,IAE5B49C,EAAI,aAAa,UAAaC,EAAI,aAAa,WAAc,CAACk4B,EAAen4B,EAAI,UAAUC,EAAI,QAAQ,KACxG79C,EAAO,IAAI,UAAU,IAEpB49C,EAAI,qBAAqB,UAAaC,EAAI,qBAAqB,WAAc,CAAC83B,EAAiB,OAAO/3B,EAAI,kBAAkBC,EAAI,gBAAgB,KACjJ79C,EAAO,IAAI,kBAAkB,GAE1BA;AAAA,IACf;AACI,IAAA81E,EAAa,OAAOluB;AACpB,aAASmuB,EAAen4B,GAAK32C,GAAO;AAChC,UAAI22C,MAAQ32C;AACR,eAAO;AAQX,UANI22C,KAAQ,QAA6B32C,MAAU,QAAQA,MAAU,UAGjE,OAAO22C,KAAQ,OAAO32C,KAGtB,OAAO22C,KAAQ;AACf,eAAO;AAEX,YAAMo4B,IAAW,MAAM,QAAQp4B,CAAG,GAC5Bq4B,IAAa,MAAM,QAAQhvE,CAAK;AACtC,UAAI+uE,MAAaC;AACb,eAAO;AAEX,UAAID,KAAYC,GAAY;AACxB,YAAIr4B,EAAI,WAAW32C,EAAM;AACrB,iBAAO;AAEX,iBAASgB,IAAI,GAAGA,IAAI21C,EAAI,QAAQ31C;AAC5B,cAAI,CAAC8tE,EAAen4B,EAAI31C,CAAC,GAAGhB,EAAMgB,CAAC,CAAC;AAChC,mBAAO;AAAA,MAG3B;AACQ,UAAIy1C,EAAG,cAAcE,CAAG,KAAKF,EAAG,cAAcz2C,CAAK,GAAG;AAClD,cAAMivE,IAAU,OAAO,KAAKt4B,CAAG,GACzBu4B,IAAY,OAAO,KAAKlvE,CAAK;AAMnC,YALIivE,EAAQ,WAAWC,EAAU,WAGjCD,EAAQ,KAAI,GACZC,EAAU,KAAI,GACV,CAACJ,EAAeG,GAASC,CAAS;AAClC,iBAAO;AAEX,iBAASluE,KAAI,GAAGA,KAAIiuE,EAAQ,QAAQjuE,MAAK;AACrC,gBAAM7D,KAAO8xE,EAAQjuE,EAAC;AACtB,cAAI,CAAC8tE,EAAen4B,EAAIx5C,EAAI,GAAG6C,EAAM7C,EAAI,CAAC;AACtC,mBAAO;AAAA,QAE3B;AAAA,MACA;AACQ,aAAO;AAAA,IACf;AAAA,EACA,GAAG0xE,MAAiBN,GAAA,eAAuBM,IAAe,CAAA,EAAG;AAC7D,MAAIM;AACJ,GAAC,SAAUA,GAAkB;AACzB,aAAS74B,EAAOU,GAAKo4B,GAAc5zB,GAAS6zB,GAAO;AAC/C,aAAO,EAAE,KAAAr4B,GAAK,cAAAo4B,GAAc,SAAA5zB,GAAS,OAAA6zB,EAAK;AAAA,IAClD;AACI,IAAAF,EAAiB,SAAS74B;AAC1B,aAASL,EAAG/8C,GAAO;AACf,YAAMs9C,IAAYt9C;AAClB,aAAOu9C,EAAG,cAAcD,CAAS,KAAKC,EAAG,OAAOD,EAAU,GAAG,KAAKg4B,EAA8B,QAAQ,GAAGh4B,EAAU,OAAO,KAAKC,EAAG,WAAWD,EAAU,OAAOq4B,EAAa,EAAE;AAAA,IACvL;AACI,IAAAM,EAAiB,KAAKl5B;AAAA,EAC1B,GAAGk5B,MAAqBZ,GAAA,mBAA2BY,IAAmB,CAAA,EAAG;AACzE,MAAIG;AACJ,GAAC,SAAUA,GAAsC;AAC7C,IAAAA,EAAqC,SAAS,yBAC9CA,EAAqC,mBAAmBpP,EAAW,iBAAiB,gBACpFoP,EAAqC,OAAO,IAAIpP,EAAW,iBAAiBoP,EAAqC,MAAM;AAAA,EAC3H,GAAGA,MAAyCf,GAAA,uCAA+Ce,IAAuC,CAAA,EAAG;AAMrI,MAAIC;AACJ,GAAC,SAAUA,GAAqC;AAC5C,IAAAA,EAAoC,SAAS,4BAC7CA,EAAoC,mBAAmBrP,EAAW,iBAAiB,gBACnFqP,EAAoC,OAAO,IAAIrP,EAAW,yBAAyBqP,EAAoC,MAAM,GAC7HA,EAAoC,qBAAqBD,EAAqC;AAAA,EAClG,GAAGC,MAAwChB,GAAA,sCAA8CgB,IAAsC,CAAA,EAAG;AAClI,MAAIC;AACJ,GAAC,SAAUA,GAAyB;AAChC,aAASv5B,EAAG/8C,GAAO;AACf,YAAMs9C,IAAYt9C;AAClB,aAAOu9C,EAAG,cAAcD,CAAS,KAAKg4B,EAA8B,SAAS,GAAGh4B,EAAU,KAAK,KAAKg4B,EAA8B,SAAS,GAAGh4B,EAAU,WAAW,MAAMA,EAAU,UAAU,UAAaC,EAAG,WAAWD,EAAU,OAAOq4B,EAAa,EAAE;AAAA,IAChQ;AACI,IAAAW,EAAwB,KAAKv5B;AAC7B,aAASK,EAAO39C,GAAO82E,GAAaJ,GAAO;AACvC,YAAMt2E,IAAS,EAAE,OAAAJ,GAAO,aAAA82E,EAAW;AACnC,aAAIJ,MAAU,WACVt2E,EAAO,QAAQs2E,IAEZt2E;AAAA,IACf;AACI,IAAAy2E,EAAwB,SAASl5B;AAAA,EACrC,GAAGk5B,MAA4BjB,GAAA,0BAAkCiB,IAA0B,CAAA,EAAG;AAC9F,MAAIE;AACJ,GAAC,SAAUA,GAAuC;AAC9C,IAAAA,EAAsC,SAAS,8BAC/CA,EAAsC,mBAAmBxP,EAAW,iBAAiB,gBACrFwP,EAAsC,OAAO,IAAIxP,EAAW,yBAAyBwP,EAAsC,MAAM,GACjIA,EAAsC,qBAAqBJ,EAAqC;AAAA,EACpG,GAAGI,MAA0CnB,GAAA,wCAAgDmB,IAAwC,CAAA,EAAG;AAMxI,MAAIC;AACJ,GAAC,SAAUA,GAAqC;AAC5C,IAAAA,EAAoC,SAAS,4BAC7CA,EAAoC,mBAAmBzP,EAAW,iBAAiB,gBACnFyP,EAAoC,OAAO,IAAIzP,EAAW,yBAAyByP,EAAoC,MAAM,GAC7HA,EAAoC,qBAAqBL,EAAqC;AAAA,EAClG,GAAGK,MAAwCpB,GAAA,sCAA8CoB,IAAsC,CAAA,EAAG;AAMlI,MAAIC;AACJ,UAAC,SAAUA,GAAsC;AAC7C,IAAAA,EAAqC,SAAS,6BAC9CA,EAAqC,mBAAmB1P,EAAW,iBAAiB,gBACpF0P,EAAqC,OAAO,IAAI1P,EAAW,yBAAyB0P,EAAqC,MAAM,GAC/HA,EAAqC,qBAAqBN,EAAqC;AAAA,EACnG,GAAGM,MAAyCrB,GAAA,uCAA+CqB,IAAuC,CAAA,EAAG;;;;;UChNrI,OAAO,eAAeC,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,0BAAkC;AAClC,QAAM3P,IAAatV,GAAA;AASnB,MAAIklB;AACJ,UAAC,SAAUA,GAAyB;AAChC,IAAAA,EAAwB,SAAS,iCACjCA,EAAwB,mBAAmB5P,EAAW,iBAAiB,gBACvE4P,EAAwB,OAAO,IAAI5P,EAAW,oBAAoB4P,EAAwB,MAAM;AAAA,EACpG,GAAGA,MAA4BD,GAAA,0BAAkCC,IAA0B,CAAA,EAAG;;;;;AChB9F,WAAO,eAActd,GAAU,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,yBAAiCA,EAAA,2BAAmCA,sBAA4BA,EAAA,wBAAgCA,EAAA,2BAAmCA,sBAA4BA,EAAA,oBAA4BA,EAAA,uBAA+BA,EAAA,2BAAmCA,EAAA,eAAuBA,EAAA,2BAAmCA,EAAA,oBAA4BA,0BAAgCA,EAAA,iCAAyCA,EAAA,YAAoBA,EAAA,kBAA0BA,EAAA,iBAAyBA,EAAA,oCAA4CA,EAAA,uCAA+CA,qCAA2CA,EAAA,yBAAiCA,EAAA,kCAA0CA,EAAA,mCAA2CA,EAAA,oCAA4CA,EAAA,iCAAyCA,EAAA,kCAA0CA,yBAA+BA,EAAA,6BAAqCA,EAAA,yBAAiCA,uBAA6BA,EAAA,0BAAkCA,EAAA,cAAsBA,uCAA6CA,EAAA,mBAA2BA,EAAA,kBAA0BA,EAAA,0BAAkCA,EAAA,uBAA+BA,EAAA,oBAA4BA,EAAA,0BAAkCA,oCAA0CA,EAAA,4BAAoCA,EAAA,uBAA+BA,EAAA,sBAA8BA,EAAA,wBAAgCA,EAAA,wBAAgCA,EAAA,sBAA8BA,qBAA2BA,EAAA,iCAAyCA,EAAA,yBAAiCA,EAAA,qBAA6B,QACpoDA,EAAA,iBAAyBA,EAAA,cAAsBA,oBAA0BA,EAAA,yBAAiCA,EAAA,6BAAqCA,2BAAiCA,EAAA,6BAAqCA,EAAA,yBAAiCA,EAAA,6BAAqCA,EAAA,2BAAmCA,EAAA,4BAAoCA,EAAA,sBAA8BA,mCAAyCA,EAAA,+BAAuCA,EAAA,6BAAqCA,EAAA,6BAAqCA,EAAA,wBAAgCA,EAAA,cAAsBA,EAAA,8BAAsCA,sCAA4CA,EAAA,oCAA4CA,EAAA,qCAA6CA,EAAA,gCAAwCA,EAAA,mBAA2BA,EAAA,wBAAgCA,EAAA,qBAA6BA,+BAAqCA,EAAA,sBAA8BA,EAAA,2BAAmCA,yBAA+BA,EAAA,uBAA+BA,EAAA,wCAAgDA,4BAAkCA,EAAA,wBAAgCA,EAAA,wBAAgCA,EAAA,4BAAoCA,EAAA,wBAAgCA,EAAA,uBAA+BA,EAAA,gBAAwBA,kCAAwCA,EAAA,kCAA0CA,EAAA,kCAA0CA,EAAA,iCAAyCA,EAAA,4BAAoCA,EAAA,6BAAqCA,EAAA,sBAA8BA,2BAAiCA,EAAA,yBAAiCA,EAAA,kBAA0BA,EAAA,gCAAwC,QAC5rDA,EAAA,0BAAkCA,EAAA,uCAA+CA,EAAA,sCAA8CA,EAAA,wCAAgDA,EAAA,0BAAkCA,EAAA,sCAA8CA,yCAA+CA,EAAA,mBAA2BA,EAAA,eAAuBA,EAAA,mBAA2BA,EAAA,mBAA2BA,EAAA,2BAAmCA,EAAA,6BAAqCA,8BAAoCA,EAAA,+BAAuCA,EAAA,mCAA2CA,EAAA,0BAAkCA,EAAA,0BAAkCA,EAAA,mBAA2BA,EAAA,4BAAoCA,uBAA6BA,EAAA,iCAAyCA,EAAA,+BAAuCA,EAAA,8BAAsC;AAC12B,UAAM0N,IAAatV,GAAA,GACb4jB,IAAgC5iB,IAChCnV,IAAKqV,GAAA,GACLikB,IAA4BtS,GAAA;AAClC,WAAO,eAAejL,GAAS,yBAAyB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOud,EAA0B;AAAA,IAAsB,EAAE,CAAE;AAC1J,UAAMC,IAA4B5P,GAAA;AAClC,WAAO,eAAe5N,GAAS,yBAAyB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOwd,EAA0B;AAAA,IAAsB,EAAE,CAAE;AAC1J,UAAMC,IAA6B5P,GAAA;AACnC,WAAO,eAAe7N,GAAS,2BAA2B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOyd,EAA2B;AAAA,IAAwB,EAAE,CAAE,GAC/J,OAAO,eAAezd,GAAS,yCAAyC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOyd,EAA2B;AAAA,IAAsC,EAAE,CAAE;AAC3L,UAAMC,IAA2BlI,GAAA;AACjC,WAAO,eAAexV,GAAS,wBAAwB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO0d,EAAyB;AAAA,IAAqB,EAAE,CAAE;AACvJ,UAAMC,IAA2BjI,GAAA;AACjC,WAAO,eAAe1V,GAAS,wBAAwB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2d,EAAyB;AAAA,IAAqB,EAAE,CAAE,GACvJ,OAAO,eAAe3d,GAAS,4BAA4B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2d,EAAyB;AAAA,IAAyB,EAAE,CAAE;AAC/J,UAAMC,IAA0BhI,GAAA;AAChC,WAAO,eAAe5V,GAAS,uBAAuB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO4d,EAAwB;AAAA,IAAoB,EAAE,CAAE,GACpJ,OAAO,eAAe5d,GAAS,8BAA8B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO4d,EAAwB;AAAA,IAA2B,EAAE,CAAE;AAClK,UAAMC,IAAyB/H,GAAA;AAC/B,WAAO,eAAe9V,GAAS,sBAAsB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6d,EAAuB;AAAA,IAAmB,EAAE,CAAE;AACjJ,UAAMC,IAA4B/H,GAAA;AAClC,WAAO,eAAe/V,GAAS,yBAAyB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO8d,EAA0B;AAAA,IAAsB,EAAE,CAAE;AAC1J,UAAMC,IAAsBC,GAAA;AAC5B,WAAO,eAAehe,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO+d,EAAoB;AAAA,IAAiB,EAAE,CAAE,GAC1I,OAAO,eAAe/d,GAAS,iCAAiC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO+d,EAAoB;AAAA,IAA8B,EAAE,CAAE,GACpK,OAAO,eAAe/d,GAAS,sCAAsC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO+d,EAAoB;AAAA,IAAmC,EAAE,CAAE;AAC9K,UAAME,IAA2BC,GAAA;AACjC,WAAO,eAAele,GAAS,qCAAqC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOie,EAAyB;AAAA,IAAkC,EAAE,CAAE,GACjL,OAAO,eAAeje,GAAS,qCAAqC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOie,EAAyB;AAAA,IAAkC,EAAE,CAAE,GACjL,OAAO,eAAeje,GAAS,+BAA+B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOie,EAAyB;AAAA,IAA4B,EAAE,CAAE;AACrK,UAAME,IAA4BC,GAAA;AAClC,WAAO,eAAepe,GAAS,eAAe,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOme,EAA0B;AAAA,IAAY,EAAE,CAAE,GACtI,OAAO,eAAene,GAAS,yBAAyB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOme,EAA0B;AAAA,IAAsB,EAAE,CAAE,GAC1J,OAAO,eAAene,GAAS,8BAA8B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOme,EAA0B;AAAA,IAA2B,EAAE,CAAE,GACpK,OAAO,eAAene,GAAS,8BAA8B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOme,EAA0B;AAAA,IAA2B,EAAE,CAAE,GACpK,OAAO,eAAene,GAAS,gCAAgC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOme,EAA0B;AAAA,IAA6B,EAAE,CAAE,GACxK,OAAO,eAAene,GAAS,kCAAkC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOme,EAA0B;AAAA,IAA+B,EAAE,CAAE;AAC5K,UAAME,IAA0BC,GAAA;AAChC,WAAO,eAAete,GAAS,uBAAuB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqe,EAAwB;AAAA,IAAoB,EAAE,CAAE;AACpJ,UAAME,IAAgCC,GAAA;AACtC,WAAO,eAAexe,GAAS,6BAA6B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOue,EAA8B;AAAA,IAA0B,EAAE,CAAE;AACtK,UAAME,IAA4BC,GAAA;AAClC,WAAO,eAAe1e,GAAS,4BAA4B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOye,EAA0B;AAAA,IAAyB,EAAE,CAAE,GAChK,OAAO,eAAeze,GAAS,8BAA8B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOye,EAA0B;AAAA,IAA2B,EAAE,CAAE,GACpK,OAAO,eAAeze,GAAS,0BAA0B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOye,EAA0B;AAAA,IAAuB,EAAE,CAAE,GAC5J,OAAO,eAAeze,GAAS,8BAA8B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOye,EAA0B;AAAA,IAA2B,EAAE,CAAE,GACpK,OAAO,eAAeze,GAAS,0BAA0B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOye,EAA0B;AAAA,IAAuB,EAAE,CAAE,GAC5J,OAAO,eAAeze,GAAS,8BAA8B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOye,EAA0B;AAAA,IAA2B,EAAE,CAAE,GACpK,OAAO,eAAeze,GAAS,0BAA0B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOye,EAA0B;AAAA,IAAuB,EAAE,CAAE;AAC5J,UAAME,IAAqBC,GAAA;AAC3B,WAAO,eAAe5e,GAAS,mBAAmB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2e,EAAmB;AAAA,IAAgB,EAAE,CAAE,GACvI,OAAO,eAAe3e,GAAS,eAAe,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2e,EAAmB;AAAA,IAAY,EAAE,CAAE,GAC/H,OAAO,eAAe3e,GAAS,kBAAkB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO2e,EAAmB;AAAA,IAAe,EAAE,CAAE;AACrI,UAAME,IAA2BC,GAAA;AACjC,WAAO,eAAe9e,GAAS,+BAA+B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6e,EAAyB;AAAA,IAA4B,EAAE,CAAE,GACrK,OAAO,eAAe7e,GAAS,gCAAgC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6e,EAAyB;AAAA,IAA6B,EAAE,CAAE,GACvK,OAAO,eAAe7e,GAAS,kCAAkC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6e,EAAyB;AAAA,IAA+B,EAAE,CAAE;AAC3K,UAAME,IAAyBC,GAAA;AAC/B,WAAO,eAAehf,GAAS,sBAAsB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO+e,EAAuB;AAAA,IAAmB,EAAE,CAAE,GACjJ,OAAO,eAAe/e,GAAS,6BAA6B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO+e,EAAuB;AAAA,IAA0B,EAAE,CAAE;AAC/J,UAAME,IAAuBC,GAAA;AAC7B,WAAO,eAAelf,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOif,EAAqB;AAAA,IAAiB,EAAE,CAAE,GAC3I,OAAO,eAAejf,GAAS,2BAA2B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOif,EAAqB;AAAA,IAAwB,EAAE,CAAE,GACzJ,OAAO,eAAejf,GAAS,2BAA2B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOif,EAAqB;AAAA,IAAwB,EAAE,CAAE;AACzJ,UAAME,IAAwBC,GAAA;AAC9B,WAAO,eAAepf,GAAS,oCAAoC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOmf,EAAsB;AAAA,IAAiC,EAAE,CAAE,GAC5K,OAAO,eAAenf,GAAS,gCAAgC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOmf,EAAsB;AAAA,IAA6B,EAAE,CAAE,GACpK,OAAO,eAAenf,GAAS,6BAA6B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOmf,EAAsB;AAAA,IAA0B,EAAE,CAAE,GAC9J,OAAO,eAAenf,GAAS,8BAA8B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOmf,EAAsB;AAAA,IAA2B,EAAE,CAAE,GAChK,OAAO,eAAenf,GAAS,4BAA4B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOmf,EAAsB;AAAA,IAAyB,EAAE,CAAE;AAC5J,UAAME,IAAsBC,GAAA;AAC5B,WAAO,eAAetf,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAiB,EAAE,CAAE,GAC1I,OAAO,eAAerf,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAiB,EAAE,CAAE,GAC1I,OAAO,eAAerf,GAAS,gBAAgB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAa,EAAE,CAAE,GAClI,OAAO,eAAerf,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAiB,EAAE,CAAE,GAC1I,OAAO,eAAerf,GAAS,wCAAwC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAqC,EAAE,CAAE,GAClL,OAAO,eAAerf,GAAS,uCAAuC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAoC,EAAE,CAAE,GAChL,OAAO,eAAerf,GAAS,2BAA2B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAwB,EAAE,CAAE,GACxJ,OAAO,eAAerf,GAAS,yCAAyC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAsC,EAAE,CAAE,GACpL,OAAO,eAAerf,GAAS,uCAAuC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAoC,EAAE,CAAE,GAChL,OAAO,eAAerf,GAAS,wCAAwC,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOqf,EAAoB;AAAA,IAAqC,EAAE,CAAE;AAClL,UAAME,KAA8BC,GAAA;AACpC,WAAO,eAAexf,GAAS,2BAA2B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOuf,GAA4B;AAAA,IAAwB,EAAE,CAAE;AAShK,QAAIE;AACJ,KAAC,SAAUA,GAAoB;AAC3B,eAASh8B,GAAG/8C,IAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOu9C,EAAG,OAAOD,CAAS,KAAMC,EAAG,OAAOD,EAAU,QAAQ,KAAKC,EAAG,OAAOD,EAAU,MAAM,KAAKC,EAAG,OAAOD,EAAU,OAAO;AAAA,MACnI;AACI,MAAAy7B,EAAmB,KAAKh8B;AAAA,IAC5B,GAAGg8B,OAAuBzf,EAAA,qBAA6Byf,KAAqB,CAAA,EAAG;AAO/E,QAAIC;AACJ,KAAC,SAAUA,GAAwB;AAC/B,eAASj8B,GAAG/8C,IAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOu9C,EAAG,cAAcD,CAAS,MAAMC,EAAG,OAAOD,EAAU,YAAY,KAAKC,EAAG,OAAOD,EAAU,MAAM,KAAKC,EAAG,OAAOD,EAAU,OAAO;AAAA,MAC9I;AACI,MAAA07B,EAAuB,KAAKj8B;AAAA,IAChC,GAAGi8B,OAA2B1f,EAAA,yBAAiC0f,KAAyB,CAAA,EAAG;AAO3F,QAAIC;AACJ,KAAC,SAAUA,GAAgC;AACvC,eAASl8B,GAAG/8C,IAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOu9C,EAAG,cAAcD,CAAS,MACzBC,EAAG,OAAOD,EAAU,QAAQ,KAAK07B,GAAuB,GAAG17B,EAAU,QAAQ,OAC7EA,EAAU,aAAa,UAAaC,EAAG,OAAOD,EAAU,QAAQ;AAAA,MAChF;AACI,MAAA27B,EAA+B,KAAKl8B;AAAA,IACxC,GAAGk8B,MAAmC3f,EAAA,iCAAyC2f,IAAiC,CAAA,EAAG;AAKnH,QAAIC;AACJ,KAAC,SAAUA,GAAkB;AACzB,eAASn8B,GAAG/8C,IAAO;AACf,YAAI,CAAC,MAAM,QAAQA,EAAK;AACpB,iBAAO;AAEX,iBAASuxD,KAAQvxD;AACb,cAAI,CAACu9C,EAAG,OAAOgU,CAAI,KAAK,CAACwnB,GAAmB,GAAGxnB,CAAI,KAAK,CAAC0nB,EAA+B,GAAG1nB,CAAI;AAC3F,mBAAO;AAGf,eAAO;AAAA,MACf;AACI,MAAA2nB,EAAiB,KAAKn8B;AAAA,IAC1B,GAAGm8B,MAAqB5f,EAAA,mBAA2B4f,IAAmB,CAAA,EAAG;AAKzE,QAAIC;AACJ,KAAC,SAAUA,GAAqB;AAC5B,MAAAA,EAAoB,SAAS,6BAC7BA,EAAoB,mBAAmBnS,EAAW,iBAAiB,gBACnEmS,EAAoB,OAAO,IAAInS,EAAW,oBAAoBmS,EAAoB,MAAM;AAAA,IAC5F,GAAGA,MAAwB7f,EAAA,sBAA8B6f,IAAsB,CAAA,EAAG;AAKlF,QAAIC;AACJ,KAAC,SAAUA,GAAuB;AAC9B,MAAAA,EAAsB,SAAS,+BAC/BA,EAAsB,mBAAmBpS,EAAW,iBAAiB,gBACrEoS,EAAsB,OAAO,IAAIpS,EAAW,oBAAoBoS,EAAsB,MAAM;AAAA,IAChG,GAAGA,MAA0B9f,EAAA,wBAAgC8f,IAAwB,CAAA,EAAG;AACxF,QAAIC;AACJ,KAAC,SAAUA,GAAuB;AAI9B,MAAAA,EAAsB,SAAS,UAI/BA,EAAsB,SAAS,UAI/BA,EAAsB,SAAS;AAAA,IACnC,GAAGA,MAA0B/f,EAAA,wBAAgC+f,IAAwB,CAAA,EAAG;AACxF,QAAIC;AACJ,KAAC,SAAUA,GAAqB;AAK5B,MAAAA,EAAoB,QAAQ,SAK5BA,EAAoB,gBAAgB,iBAMpCA,EAAoB,wBAAwB,yBAK5CA,EAAoB,OAAO;AAAA,IAC/B,GAAGA,MAAwBhgB,EAAA,sBAA8BggB,IAAsB,CAAA,EAAG;AAMlF,QAAIC;AACJ,KAAC,SAAUA,GAAsB;AAI7B,MAAAA,EAAqB,OAAO,SAO5BA,EAAqB,QAAQ,UAQ7BA,EAAqB,QAAQ;AAAA,IACjC,GAAGA,MAAyBjgB,EAAA,uBAA+BigB,IAAuB,CAAA,EAAG;AAKrF,QAAIC;AACJ,KAAC,SAAUA,GAA2B;AAClC,eAASC,GAAMz5E,IAAO;AAClB,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,KAAaC,EAAG,OAAOD,EAAU,EAAE,KAAKA,EAAU,GAAG,SAAS;AAAA,MAC7E;AACI,MAAAk8B,EAA0B,QAAQC;AAAA,IACtC,GAAGD,MAA8BlgB,EAAA,4BAAoCkgB,IAA4B,CAAA,EAAG;AAKpG,QAAIE;AACJ,KAAC,SAAUA,GAAiC;AACxC,eAAS38B,GAAG/8C,IAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,MAAcA,EAAU,qBAAqB,QAAQ47B,EAAiB,GAAG57B,EAAU,gBAAgB;AAAA,MAClH;AACI,MAAAo8B,EAAgC,KAAK38B;AAAA,IACzC,GAAG28B,MAAoCpgB,EAAA,kCAA0CogB,IAAkC,CAAA,EAAG;AAKtH,QAAIC;AACJ,KAAC,SAAUA,GAAyB;AAChC,eAAS58B,GAAG/8C,GAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOu9C,EAAG,cAAcD,CAAS,MAAMA,EAAU,qBAAqB,UAAaC,EAAG,QAAQD,EAAU,gBAAgB;AAAA,MAChI;AACI,MAAAq8B,EAAwB,KAAK58B;AAC7B,eAAS68B,GAAoB55E,GAAO;AAChC,cAAMs9C,IAAYt9C;AAClB,eAAOs9C,KAAaC,EAAG,QAAQD,EAAU,gBAAgB;AAAA,MACjE;AACI,MAAAq8B,EAAwB,sBAAsBC;AAAA,IAClD,GAAGD,MAA4BrgB,EAAA,0BAAkCqgB,IAA0B,CAAA,EAAG;AAQ9F,QAAIE;AACJ,KAAC,SAAUA,GAAmB;AAC1B,MAAAA,EAAkB,SAAS,cAC3BA,EAAkB,mBAAmB7S,EAAW,iBAAiB,gBACjE6S,EAAkB,OAAO,IAAI7S,EAAW,oBAAoB6S,EAAkB,MAAM;AAAA,IACxF,GAAGA,MAAsBvgB,EAAA,oBAA4BugB,IAAoB,CAAA,EAAG;AAI5E,QAAIC;AACJ,KAAC,SAAUA,GAAsB;AAO7B,MAAAA,EAAqB,yBAAyB;AAAA,IAClD,GAAGA,MAAyBxgB,EAAA,uBAA+BwgB,IAAuB,CAAA,EAAG;AAMrF,QAAIC;AACJ,KAAC,SAAUA,GAAyB;AAChC,MAAAA,EAAwB,SAAS,eACjCA,EAAwB,mBAAmB/S,EAAW,iBAAiB,gBACvE+S,EAAwB,OAAO,IAAI/S,EAAW,yBAAyB+S,EAAwB,MAAM;AAAA,IACzG,GAAGA,OAA4BzgB,EAAA,0BAAkCygB,KAA0B,CAAA,EAAG;AAQ9F,QAAIC;AACJ,KAAC,SAAUA,GAAiB;AACxB,MAAAA,EAAgB,SAAS,YACzBA,EAAgB,mBAAmBhT,EAAW,iBAAiB,gBAC/DgT,EAAgB,OAAO,IAAIhT,EAAW,qBAAqBgT,EAAgB,MAAM;AAAA,IACrF,GAAGA,MAAoB1gB,EAAA,kBAA0B0gB,IAAkB,CAAA,EAAG;AAMtE,QAAIC;AACJ,KAAC,SAAUA,GAAkB;AACzB,MAAAA,EAAiB,SAAS,QAC1BA,EAAiB,mBAAmBjT,EAAW,iBAAiB,gBAChEiT,EAAiB,OAAO,IAAIjT,EAAW,0BAA0BiT,EAAiB,MAAM;AAAA,IAC5F,GAAGA,OAAqB3gB,EAAA,mBAA2B2gB,KAAmB,CAAA,EAAG;AAMzE,QAAIC;AACJ,KAAC,SAAUA,GAAoC;AAC3C,MAAAA,EAAmC,SAAS,oCAC5CA,EAAmC,mBAAmBlT,EAAW,iBAAiB,gBAClFkT,EAAmC,OAAO,IAAIlT,EAAW,yBAAyBkT,EAAmC,MAAM;AAAA,IAC/H,GAAGA,OAAuC5gB,EAAA,qCAA6C4gB,KAAqC,CAAA,EAAG;AAK/H,QAAIC;AACJ,KAAC,SAAUA,GAAa;AAIpB,MAAAA,EAAY,QAAQ,GAIpBA,EAAY,UAAU,GAItBA,EAAY,OAAO,GAInBA,EAAY,MAAM,GAMlBA,EAAY,QAAQ;AAAA,IACxB,GAAGA,OAAgB7gB,EAAA,cAAsB6gB,KAAc,CAAA,EAAG;AAK1D,QAAIC;AACJ,KAAC,SAAUA,GAAyB;AAChC,MAAAA,EAAwB,SAAS,sBACjCA,EAAwB,mBAAmBpT,EAAW,iBAAiB,gBACvEoT,EAAwB,OAAO,IAAIpT,EAAW,yBAAyBoT,EAAwB,MAAM;AAAA,IACzG,GAAGA,OAA4B9gB,EAAA,0BAAkC8gB,KAA0B,CAAA,EAAG;AAK9F,QAAIC;AACJ,KAAC,SAAUA,GAAoB;AAC3B,MAAAA,EAAmB,SAAS,6BAC5BA,EAAmB,mBAAmBrT,EAAW,iBAAiB,gBAClEqT,EAAmB,OAAO,IAAIrT,EAAW,oBAAoBqT,EAAmB,MAAM;AAAA,IAC1F,GAAGA,OAAuB/gB,EAAA,qBAA6B+gB,KAAqB,CAAA,EAAG;AAK/E,QAAIC;AACJ,KAAC,SAAUA,GAAwB;AAC/B,MAAAA,EAAuB,SAAS,qBAChCA,EAAuB,mBAAmBtT,EAAW,iBAAiB,gBACtEsT,EAAuB,OAAO,IAAItT,EAAW,yBAAyBsT,EAAuB,MAAM;AAAA,IACvG,GAAGA,OAA2BhhB,EAAA,yBAAiCghB,KAAyB,CAAA,EAAG;AAM3F,QAAIC;AACJ,KAAC,SAAUA,GAA4B;AACnC,MAAAA,EAA2B,SAAS,mBACpCA,EAA2B,mBAAmBvT,EAAW,iBAAiB,gBAC1EuT,EAA2B,OAAO,IAAIvT,EAAW,yBAAyBuT,EAA2B,MAAM;AAAA,IAC/G,GAAGA,OAA+BjhB,EAAA,6BAAqCihB,KAA6B,CAAA,EAAG;AAKvG,QAAIC;AACJ,KAAC,SAAUA,GAAsB;AAI7B,MAAAA,EAAqB,OAAO,GAK5BA,EAAqB,OAAO,GAM5BA,EAAqB,cAAc;AAAA,IACvC,GAAGA,MAAyBlhB,EAAA,uBAA+BkhB,IAAuB,CAAA,EAAG;AAWrF,QAAIC;AACJ,KAAC,SAAUA,GAAiC;AACxC,MAAAA,EAAgC,SAAS,wBACzCA,EAAgC,mBAAmBzT,EAAW,iBAAiB,gBAC/EyT,EAAgC,OAAO,IAAIzT,EAAW,yBAAyByT,EAAgC,MAAM;AAAA,IACzH,GAAGA,OAAoCnhB,EAAA,kCAA0CmhB,KAAkC,CAAA,EAAG;AACtH,QAAIC;AACJ,KAAC,SAAUA,GAAgC;AAIvC,eAASC,GAAc5yB,GAAO;AAC1B,YAAIzK,IAAYyK;AAChB,eAAkCzK,KAAc,QAC5C,OAAOA,EAAU,QAAS,YAAYA,EAAU,UAAU,WACzDA,EAAU,gBAAgB,UAAa,OAAOA,EAAU,eAAgB;AAAA,MACrF;AACI,MAAAo9B,EAA+B,gBAAgBC;AAI/C,eAASC,GAAO7yB,GAAO;AACnB,YAAIzK,IAAYyK;AAChB,eAAkCzK,KAAc,QAC5C,OAAOA,EAAU,QAAS,YAAYA,EAAU,UAAU,UAAaA,EAAU,gBAAgB;AAAA,MAC7G;AACI,MAAAo9B,EAA+B,SAASE;AAAA,IAC5C,GAAGF,OAAmCphB,EAAA,iCAAyCohB,KAAiC,CAAA,EAAG;AAKnH,QAAIG;AACJ,KAAC,SAAUA,GAAmC;AAC1C,MAAAA,EAAkC,SAAS,0BAC3CA,EAAkC,mBAAmB7T,EAAW,iBAAiB,gBACjF6T,EAAkC,OAAO,IAAI7T,EAAW,yBAAyB6T,EAAkC,MAAM;AAAA,IAC7H,GAAGA,OAAsCvhB,EAAA,oCAA4CuhB,KAAoC,CAAA,EAAG;AAU5H,QAAIC;AACJ,KAAC,SAAUA,GAAkC;AACzC,MAAAA,EAAiC,SAAS,yBAC1CA,EAAiC,mBAAmB9T,EAAW,iBAAiB,gBAChF8T,EAAiC,OAAO,IAAI9T,EAAW,yBAAyB8T,EAAiC,MAAM;AAAA,IAC3H,GAAGA,OAAqCxhB,EAAA,mCAA2CwhB,KAAmC,CAAA,EAAG;AAKzH,QAAIC;AACJ,KAAC,SAAUA,GAAiC;AACxC,MAAAA,EAAgC,SAAS,wBACzCA,EAAgC,mBAAmB/T,EAAW,iBAAiB,gBAC/E+T,EAAgC,OAAO,IAAI/T,EAAW,yBAAyB+T,EAAgC,MAAM;AAAA,IACzH,GAAGA,OAAoCzhB,EAAA,kCAA0CyhB,KAAkC,CAAA,EAAG;AAItH,QAAIC;AACJ,KAAC,SAAUA,GAAwB;AAK/B,MAAAA,EAAuB,SAAS,GAIhCA,EAAuB,aAAa,GAIpCA,EAAuB,WAAW;AAAA,IACtC,GAAGA,OAA2B1hB,EAAA,yBAAiC0hB,KAAyB,CAAA,EAAG;AAK3F,QAAIC;AACJ,KAAC,SAAUA,GAAkC;AACzC,MAAAA,EAAiC,SAAS,yBAC1CA,EAAiC,mBAAmBjU,EAAW,iBAAiB,gBAChFiU,EAAiC,OAAO,IAAIjU,EAAW,yBAAyBiU,EAAiC,MAAM;AAAA,IAC3H,GAAGA,OAAqC3hB,EAAA,mCAA2C2hB,KAAmC,CAAA,EAAG;AASzH,QAAIC;AACJ,KAAC,SAAUA,GAAsC;AAC7C,MAAAA,EAAqC,SAAS,kCAC9CA,EAAqC,mBAAmBlU,EAAW,iBAAiB,gBACpFkU,EAAqC,OAAO,IAAIlU,EAAW,oBAAoBkU,EAAqC,MAAM;AAAA,IAC9H,GAAGA,OAAyC5hB,EAAA,uCAA+C4hB,KAAuC,CAAA,EAAG;AAKrI,QAAIC;AACJ,KAAC,SAAUA,GAAmC;AAC1C,MAAAA,EAAkC,SAAS,mCAC3CA,EAAkC,mBAAmBnU,EAAW,iBAAiB,gBACjFmU,EAAkC,OAAO,IAAInU,EAAW,yBAAyBmU,EAAkC,MAAM;AAAA,IAC7H,GAAGA,OAAsC7hB,EAAA,oCAA4C6hB,KAAoC,CAAA,EAAG;AAI5H,QAAIC;AACJ,KAAC,SAAUA,GAAgB;AAIvB,MAAAA,EAAe,UAAU,GAIzBA,EAAe,UAAU,GAIzBA,EAAe,UAAU;AAAA,IAC7B,GAAGA,OAAmB9hB,EAAA,iBAAyB8hB,KAAiB,CAAA,EAAG;AACnE,QAAIC;AACJ,KAAC,SAAUA,GAAiB;AACxB,eAASt+B,GAAG/8C,IAAO;AACf,cAAMs9C,IAAYt9C;AAClB,eAAOu9C,EAAG,cAAcD,CAAS,MAAMg4B,EAA8B,IAAI,GAAGh4B,EAAU,OAAO,KAAKg4B,EAA8B,gBAAgB,GAAGh4B,EAAU,OAAO,MAAMC,EAAG,OAAOD,EAAU,OAAO;AAAA,MAC7M;AACI,MAAA+9B,EAAgB,KAAKt+B;AAAA,IACzB,GAAGs+B,OAAoB/hB,EAAA,kBAA0B+hB,KAAkB,CAAA,EAAG;AACtE,QAAIC;AACJ,KAAC,SAAUA,GAAW;AAIlB,MAAAA,EAAU,SAAS,GAInBA,EAAU,SAAS,GAInBA,EAAU,SAAS;AAAA,IACvB,GAAGA,OAAchiB,EAAA,YAAoBgiB,KAAY,CAAA,EAAG;AAKpD,QAAIC;AACJ,KAAC,SAAUA,GAAgC;AACvC,MAAAA,EAA+B,SAAS,mCACxCA,EAA+B,mBAAmBvU,EAAW,iBAAiB,gBAC9EuU,EAA+B,OAAO,IAAIvU,EAAW,yBAAyBuU,EAA+B,MAAM;AAAA,IACvH,GAAGA,OAAmCjiB,EAAA,iCAAyCiiB,KAAiC,CAAA,EAAG;AAInH,QAAIC;AACJ,KAAC,SAAUA,GAAuB;AAK9B,MAAAA,EAAsB,UAAU,GAKhCA,EAAsB,mBAAmB,GAIzCA,EAAsB,kCAAkC;AAAA,IAC5D,GAAGA,OAA0BliB,EAAA,wBAAgCkiB,KAAwB,CAAA,EAAG;AAYxF,QAAIC;AACJ,KAAC,SAAUA,GAAmB;AAC1B,MAAAA,EAAkB,SAAS,2BAC3BA,EAAkB,mBAAmBzU,EAAW,iBAAiB,gBACjEyU,EAAkB,OAAO,IAAIzU,EAAW,oBAAoByU,EAAkB,MAAM;AAAA,IACxF,GAAGA,OAAsBniB,EAAA,oBAA4BmiB,KAAoB,CAAA,EAAG;AAM5E,QAAIC;AACJ,KAAC,SAAUA,GAA0B;AACjC,MAAAA,EAAyB,SAAS,0BAClCA,EAAyB,mBAAmB1U,EAAW,iBAAiB,gBACxE0U,EAAyB,OAAO,IAAI1U,EAAW,oBAAoB0U,EAAyB,MAAM;AAAA,IACtG,GAAGA,OAA6BpiB,EAAA,2BAAmCoiB,KAA2B,CAAA,EAAG;AAMjG,QAAIC;AACJ,KAAC,SAAUA,GAAc;AACrB,MAAAA,EAAa,SAAS,sBACtBA,EAAa,mBAAmB3U,EAAW,iBAAiB,gBAC5D2U,EAAa,OAAO,IAAI3U,EAAW,oBAAoB2U,EAAa,MAAM;AAAA,IAC9E,GAAGA,OAAiBriB,EAAA,eAAuBqiB,KAAe,CAAA,EAAG;AAM7D,QAAIC;AACJ,KAAC,SAAUA,GAA0B;AAIjC,MAAAA,EAAyB,UAAU,GAInCA,EAAyB,mBAAmB,GAI5CA,EAAyB,gBAAgB;AAAA,IAC7C,GAAGA,OAA6BtiB,EAAA,2BAAmCsiB,KAA2B,CAAA,EAAG;AACjG,QAAIC;AACJ,KAAC,SAAUA,GAAsB;AAC7B,MAAAA,EAAqB,SAAS,8BAC9BA,EAAqB,mBAAmB7U,EAAW,iBAAiB,gBACpE6U,EAAqB,OAAO,IAAI7U,EAAW,oBAAoB6U,EAAqB,MAAM;AAAA,IAC9F,GAAGA,OAAyBviB,EAAA,uBAA+BuiB,KAAuB,CAAA,EAAG;AAOrF,QAAIC;AACJ,KAAC,SAAUA,GAAmB;AAC1B,MAAAA,EAAkB,SAAS,2BAC3BA,EAAkB,mBAAmB9U,EAAW,iBAAiB,gBACjE8U,EAAkB,OAAO,IAAI9U,EAAW,oBAAoB8U,EAAkB,MAAM;AAAA,IACxF,GAAGA,OAAsBxiB,EAAA,oBAA4BwiB,KAAoB,CAAA,EAAG;AAO5E,QAAIC;AACJ,KAAC,SAAUA,GAAmB;AAC1B,MAAAA,EAAkB,SAAS,2BAC3BA,EAAkB,mBAAmB/U,EAAW,iBAAiB,gBACjE+U,EAAkB,OAAO,IAAI/U,EAAW,oBAAoB+U,EAAkB,MAAM;AAAA,IACxF,GAAGA,OAAsBziB,EAAA,oBAA4ByiB,KAAoB,CAAA,EAAG;AAO5E,QAAIC;AACJ,KAAC,SAAUA,GAA0B;AACjC,MAAAA,EAAyB,SAAS,kCAClCA,EAAyB,mBAAmBhV,EAAW,iBAAiB,gBACxEgV,EAAyB,OAAO,IAAIhV,EAAW,oBAAoBgV,EAAyB,MAAM;AAAA,IACtG,GAAGA,OAA6B1iB,EAAA,2BAAmC0iB,KAA2B,CAAA,EAAG;AAOjG,QAAIC;AACJ,KAAC,SAAUA,GAAuB;AAC9B,MAAAA,EAAsB,SAAS,+BAC/BA,EAAsB,mBAAmBjV,EAAW,iBAAiB,gBACrEiV,EAAsB,OAAO,IAAIjV,EAAW,oBAAoBiV,EAAsB,MAAM;AAAA,IAChG,GAAGA,OAA0B3iB,EAAA,wBAAgC2iB,KAAwB,CAAA,EAAG;AAIxF,QAAIC;AACJ,KAAC,SAAUA,GAAmB;AAC1B,MAAAA,EAAkB,SAAS,2BAC3BA,EAAkB,mBAAmBlV,EAAW,iBAAiB,gBACjEkV,EAAkB,OAAO,IAAIlV,EAAW,oBAAoBkV,EAAkB,MAAM;AAAA,IACxF,GAAGA,OAAsB5iB,EAAA,oBAA4B4iB,KAAoB,CAAA,EAAG;AAM5E,QAAIC;AACJ,KAAC,SAAUA,GAA0B;AACjC,MAAAA,EAAyB,SAAS,sBAClCA,EAAyB,mBAAmBnV,EAAW,iBAAiB,gBACxEmV,EAAyB,OAAO,IAAInV,EAAW,oBAAoBmV,EAAyB,MAAM;AAAA,IACtG,GAAGA,OAA6B7iB,EAAA,2BAAmC6iB,KAA2B,CAAA,EAAG;AAYjG,QAAIC;AACJ,KAAC,SAAUA,GAAwB;AAC/B,MAAAA,EAAuB,SAAS,oBAChCA,EAAuB,mBAAmBpV,EAAW,iBAAiB,gBACtEoV,EAAuB,OAAO,IAAIpV,EAAW,oBAAoBoV,EAAuB,MAAM;AAAA,IAClG,GAAGA,OAA2B9iB,EAAA,yBAAiC8iB,KAAyB,CAAA,EAAG;AAO3F,QAAIC;AACJ,KAAC,SAAUA,GAA+B;AACtC,MAAAA,EAA8B,SAAS,2BACvCA,EAA8B,mBAAmBrV,EAAW,iBAAiB,gBAC7EqV,EAA8B,OAAO,IAAIrV,EAAW,oBAAoBqV,EAA8B,MAAM;AAAA,IAChH,GAAGA,OAAkC/iB,EAAA,gCAAwC+iB,KAAgC,CAAA,EAAG;AAIhH,QAAIC;AACJ,KAAC,SAAUA,GAAiB;AACxB,MAAAA,EAAgB,SAAS,yBACzBA,EAAgB,mBAAmBtV,EAAW,iBAAiB,gBAC/DsV,EAAgB,OAAO,IAAItV,EAAW,oBAAoBsV,EAAgB,MAAM;AAAA,IACpF,GAAGA,OAAoBhjB,EAAA,kBAA0BgjB,KAAkB,CAAA,EAAG;AAItE,QAAIC;AACJ,KAAC,SAAUA,GAAwB;AAC/B,MAAAA,EAAuB,SAAS,oBAChCA,EAAuB,mBAAmBvV,EAAW,iBAAiB,gBACtEuV,EAAuB,OAAO,IAAIvV,EAAW,oBAAoBuV,EAAuB,MAAM;AAAA,IAClG,GAAGA,OAA2BjjB,EAAA,yBAAiCijB,KAAyB,CAAA,EAAG;AAM3F,QAAIC;AACJ,KAAC,SAAUA,GAAwB;AAC/B,MAAAA,EAAuB,SAAS,8BAChCA,EAAuB,mBAAmBxV,EAAW,iBAAiB,gBACtEwV,EAAuB,OAAO,IAAIxV,EAAW,qBAAqBwV,EAAuB,MAAM;AAAA,IACnG,GAAGA,OAA2BljB,EAAA,yBAAiCkjB,KAAyB,CAAA,EAAG;AAI3F,QAAIC;AACJ,KAAC,SAAUA,GAAqB;AAC5B,MAAAA,EAAoB,SAAS,6BAC7BA,EAAoB,mBAAmBzV,EAAW,iBAAiB,gBACnEyV,EAAoB,OAAO,IAAIzV,EAAW,oBAAoByV,EAAoB,MAAM;AAAA,IAC5F,GAAGA,OAAwBnjB,EAAA,sBAA8BmjB,KAAsB,CAAA,EAAG;AAMlF,QAAIC;AACJ,KAAC,SAAUA,GAA4B;AACnC,MAAAA,EAA2B,SAAS,wBACpCA,EAA2B,mBAAmB1V,EAAW,iBAAiB,gBAC1E0V,EAA2B,OAAO,IAAI1V,EAAW,oBAAoB0V,EAA2B,MAAM;AAAA,IAC1G,GAAGA,OAA+BpjB,EAAA,6BAAqCojB,KAA6B,CAAA,EAAG;AAIvG,QAAIC;AACJ,KAAC,SAAUA,GAA2B;AAClC,MAAAA,EAA0B,SAAS,2BACnCA,EAA0B,mBAAmB3V,EAAW,iBAAiB,gBACzE2V,EAA0B,OAAO,IAAI3V,EAAW,oBAAoB2V,EAA0B,MAAM;AAAA,IACxG,GAAGA,OAA8BrjB,EAAA,4BAAoCqjB,KAA4B,CAAA,EAAG;AAIpG,QAAIC;AACJ,KAAC,SAAUA,GAAgC;AACvC,MAAAA,EAA+B,SAAS,gCACxCA,EAA+B,mBAAmB5V,EAAW,iBAAiB,gBAC9E4V,EAA+B,OAAO,IAAI5V,EAAW,oBAAoB4V,EAA+B,MAAM;AAAA,IAClH,GAAGA,OAAmCtjB,EAAA,iCAAyCsjB,KAAiC,CAAA,EAAG;AAOnH,QAAIC;AACJ,KAAC,SAAUA,GAAiC;AACxC,MAAAA,EAAgC,SAAS,iCACzCA,EAAgC,mBAAmB7V,EAAW,iBAAiB,gBAC/E6V,EAAgC,OAAO,IAAI7V,EAAW,oBAAoB6V,EAAgC,MAAM;AAAA,IACpH,GAAGA,OAAoCvjB,EAAA,kCAA0CujB,KAAkC,CAAA,EAAG;AAItH,QAAIC;AACJ,KAAC,SAAUA,GAAiC;AACxC,MAAAA,EAAgC,SAAS,iCACzCA,EAAgC,mBAAmB9V,EAAW,iBAAiB,gBAC/E8V,EAAgC,OAAO,IAAI9V,EAAW,oBAAoB8V,EAAgC,MAAM;AAAA,IACpH,GAAGA,OAAoCxjB,EAAA,kCAA0CwjB,KAAkC,CAAA,EAAG;AAEtH,QAAIC;AACJ,KAAC,SAAUA,GAA+B;AAKtC,MAAAA,EAA8B,aAAa;AAAA,IAC/C,GAAGA,OAAkCzjB,EAAA,gCAAwCyjB,KAAgC,CAAA,EAAG;AAIhH,QAAIC;AACJ,KAAC,SAAUA,GAAe;AACtB,MAAAA,EAAc,SAAS,uBACvBA,EAAc,mBAAmBhW,EAAW,iBAAiB,gBAC7DgW,EAAc,OAAO,IAAIhW,EAAW,oBAAoBgW,EAAc,MAAM;AAAA,IAChF,GAAGA,OAAkB1jB,EAAA,gBAAwB0jB,KAAgB,CAAA,EAAG;AAMhE,QAAIC;AACJ,KAAC,SAAUA,GAAsB;AAC7B,MAAAA,EAAqB,SAAS,8BAC9BA,EAAqB,mBAAmBjW,EAAW,iBAAiB,gBACpEiW,EAAqB,OAAO,IAAIjW,EAAW,oBAAoBiW,EAAqB,MAAM;AAAA,IAC9F,GAAGA,OAAyB3jB,EAAA,uBAA+B2jB,KAAuB,CAAA,EAAG;AAKrF,QAAIC;AACJ,KAAC,SAAUA,GAAuB;AAC9B,MAAAA,EAAsB,SAAS,4BAC/BA,EAAsB,mBAAmBlW,EAAW,iBAAiB,gBACrEkW,EAAsB,OAAO,IAAIlW,EAAW,oBAAoBkW,EAAsB,MAAM;AAAA,IAChG,GAAGA,OAA0B5jB,EAAA,wBAAgC4jB,KAAwB,CAAA,EAAG;AAIxF,QAAIC;AACJ,KAAC,SAAUA,GAA2B;AAClC,MAAAA,EAA0B,SAAS,uBACnCA,EAA0B,mBAAmBnW,EAAW,iBAAiB,gBACzEmW,EAA0B,OAAO,IAAInW,EAAW,oBAAoB,qBAAqB;AAAA,IAC7F,GAAGmW,OAA8B7jB,EAAA,4BAAoC6jB,KAA4B,CAAA,EAAG;AAAA;;;;;UCz6BpG,OAAO,eAAevP,IAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,GAAA,2BAAmC;AACnC,QAAM+C,IAAmBjf,GAAA;AACzB,WAAS0rB,EAAyBzqE,GAAO0qE,GAAQxU,GAAQngE,GAAS;AAC9D,WAAIioE,EAAiB,mBAAmB,GAAGjoE,CAAO,MAC9CA,IAAU,EAAE,oBAAoBA,EAAO,QAEhCioE,EAAiB,yBAAyBh+D,GAAO0qE,GAAQxU,GAAQngE,CAAO;AAAA,EACvF;AACA,SAAAklE,GAAA,2BAAmCwP;;;;;ACTnC,QAAInN,IAAmBC,MAAQA,GAAK,oBAAqB,OAAO,UAAU,SAAS3b,GAAGQ,GAAGplC,GAAGwgD,GAAI;AAC5F,MAAIA,MAAO,WAAWA,IAAKxgD;AAC3B,UAAI+nC,IAAO,OAAO,yBAAyB3C,GAAGplC,CAAC;AAC/C,OAAI,CAAC+nC,MAAS,SAASA,IAAO,CAAC3C,EAAE,aAAa2C,EAAK,YAAYA,EAAK,mBAClEA,IAAO,EAAE,YAAY,IAAM,KAAK,WAAW;AAAE,eAAO3C,EAAEplC,CAAC;AAAA,QAAI,IAE7D,OAAO,eAAe4kC,GAAG4b,GAAIzY,CAAI;AAAA,IACrC,MAAM,SAASnD,GAAGQ,GAAGplC,GAAGwgD,GAAI;AACxB,MAAIA,MAAO,WAAWA,IAAKxgD,IAC3B4kC,EAAE4b,CAAE,IAAIpb,EAAEplC,CAAC;AAAA,IACf,KACIygD,IAAgBF,MAAQA,GAAK,gBAAiB,SAASnb,GAAGuE,GAAS;AACnE,eAASnd,KAAK4Y,EAAG,CAAI5Y,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKmd,GAASnd,CAAC,KAAG8zB,EAAgB3W,GAASvE,GAAG5Y,CAAC;AAAA,IAC5H;AACA,WAAO,eAAcmd,GAAU,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,gBAAwBA,EAAA,2BAAmC,QAC3D8W,EAAa1e,GAAA,GAA2B4H,CAAO,GAC/C8W,EAAa1d,IAAwC4G,CAAO,GAC5D8W,EAAaxd,GAAA,GAAuB0G,CAAO,GAC3C8W,EAAa7L,GAAA,GAAuBjL,CAAO;AAC3C,QAAI6V,IAAejI,GAAA;AACnB,WAAO,eAAe5N,GAAS,4BAA4B,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAO6V,EAAa;AAAA,IAAyB,EAAE,CAAE;AACnJ,QAAImO;AACJ,KAAC,SAAUA,GAAe;AAOtB,MAAAA,EAAc,6BAA6B,QAS3CA,EAAc,gBAAgB,QAQ9BA,EAAc,kBAAkB,QAWhCA,EAAc,kBAAkB,QAKhCA,EAAc,mBAAmB,QAOjCA,EAAc,2BAA2B;AAAA,IAC7C,GAAGA,MAAkBhkB,EAAA,gBAAwBgkB,IAAgB,CAAA,EAAG;AAAA;;;;;ACvEhE,QAAIrN,IAAmBC,MAAQA,GAAK,oBAAqB,OAAO,UAAU,SAAS3b,GAAGQ,GAAGplC,GAAGwgD,GAAI;AAC5F,MAAIA,MAAO,WAAWA,IAAKxgD;AAC3B,UAAI+nC,IAAO,OAAO,yBAAyB3C,GAAGplC,CAAC;AAC/C,OAAI,CAAC+nC,MAAS,SAASA,IAAO,CAAC3C,EAAE,aAAa2C,EAAK,YAAYA,EAAK,mBAClEA,IAAO,EAAE,YAAY,IAAM,KAAK,WAAW;AAAE,eAAO3C,EAAEplC,CAAC;AAAA,QAAI,IAE7D,OAAO,eAAe4kC,GAAG4b,GAAIzY,CAAI;AAAA,IACrC,MAAM,SAASnD,GAAGQ,GAAGplC,GAAGwgD,GAAI;AACxB,MAAIA,MAAO,WAAWA,IAAKxgD,IAC3B4kC,EAAE4b,CAAE,IAAIpb,EAAEplC,CAAC;AAAA,IACf,KACIygD,IAAgBF,MAAQA,GAAK,gBAAiB,SAASnb,GAAGuE,GAAS;AACnE,eAASnd,KAAK4Y,EAAG,CAAI5Y,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKmd,GAASnd,CAAC,KAAG8zB,EAAgB3W,GAASvE,GAAG5Y,CAAC;AAAA,IAC5H;AACA,WAAO,eAAcmd,GAAU,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,2BAAmC;AACnC,UAAMikB,IAAY7rB,GAAA;AAClB,IAAA0e,EAAa1e,GAAA,GAAmC4H,CAAO,GACvD8W,EAAa1d,GAAA,GAA0B4G,CAAO;AAC9C,aAAS8jB,EAAyB5M,GAAQC,GAAQ5H,GAAQngE,GAAS;AAC/D,iBAAW60E,EAAU,yBAAyB/M,GAAQC,GAAQ5H,GAAQngE,CAAO;AAAA,IACjF;AACA4wD,IAAAA,EAAA,2BAAmC8jB;AAAA;;eCtBxB9Z;AAAA,CACV,SAAUA,GAAY;AACnB,WAASlmB,EAAOmN,GAAU;AACtB,WAAO;AAAA,MACH,SAAS,YAAY,MAAMA,EAAQ;AAAA,IAC/C;AAAA,EACI;AACA,EAAA+Y,EAAW,SAASlmB;AACxB,GAAGkmB,OAAeA,KAAa,CAAA,EAAG;ACA3B,MAAMka,GAAuB;AAAA,EAChC,YAAYziE,GAAU;AAClB,SAAK,qBAAqB;AAAA;AAAA,MAEtB,YAAY;AAAA,QACR,YAAY,CAAC,YAAY,MAAM;AAAA,MAC/C;AAAA,IACA,GACQ,KAAK,kBAAkB,CAAA,GACvB,KAAK,sBAAsB,IAAIk+C,GAAQ,GACvC,KAAK,yBAAyB,IAAIA,GAAQ,GAC1C,KAAK,aAAa,oBAAI,IAAG,GACzB,KAAK,uBAAuB,oBAAI,IAAG,GACnC,KAAK,eAAezC,EAAc,SAClC,KAAK,mBAAmBz7C,EAAS,UAAU,kBAC3C,KAAK,yBAAyBA,EAAS,UAAU,wBACjD,KAAK,gBAAgBA,EAAS,UAAU,eACxC,KAAK,eAAeA,EAAS,UAAU,cACvC,KAAK,qBAAqBA,EAAS,UAAU,oBAC7C,KAAK,mBAAmB,MAAMA,EAAS,UAAU,kBACjD,KAAK,kBAAkBA,EAAS;AAAA,EACpC;AAAA,EACA,MAAM,MAAM0iE,GAAW/0E,IAAU,CAAA,GAAImuD,IAAchE,GAAAA,kBAAkB,MAAM;AACvE,eAAWvL,KAAYm2B,GAAW;AAC9B,YAAMp+E,IAAMioD,EAAS,IAAI,SAAQ;AACjC,UAAIA,EAAS,UAAUkP,EAAc;AACjC,YAAI,OAAO9tD,EAAQ,cAAe,aAAaA,EAAQ;AAEnD,eAAK,aAAa4+C,GAAUkP,EAAc,iBAAiB;AAAA,iBAEtD,OAAO9tD,EAAQ,cAAe,UAAU;AAG7C,gBAAMukB,IAAa,KAAK,gCAAgCq6B,GAAU5+C,CAAO;AACzE,UAAIukB,EAAW,SAAS,MAGpB,KAAK,WAAW,IAAI5tB,GAAK;AAAA,YACrB,WAAW;AAAA,YACX,SAAS;AAAA,cACL,YAAY;AAAA,gBACR,YAAA4tB;AAAA,cACpC;AAAA,YACA;AAAA,YAC4B,QAAQ,KAAK,WAAW,IAAI5tB,CAAG,GAAG;AAAA,UAC9D,CAAyB,GAEDioD,EAAS,QAAQkP,EAAc;AAAA,QAEvC;AAAA;AAIA,aAAK,WAAW,OAAOn3D,CAAG;AAAA,IAElC;AACA,SAAK,eAAem3D,EAAc,SAClC,MAAM,KAAK,WAAWinB,EAAU,IAAI,CAAAt1E,MAAKA,EAAE,GAAG,GAAG,EAAE,GACnD,MAAM,KAAK,eAAes1E,GAAW/0E,GAASmuD,CAAW;AAAA,EAC7D;AAAA,EACA,MAAM,OAAO6mB,GAAS7iB,GAAShE,IAAchE,GAAAA,kBAAkB,MAAM;AACjE,SAAK,eAAe2D,EAAc;AAElC,UAAMmnB,IAAc,CAAA;AACpB,eAAWC,KAAc/iB,GAAS;AAE9B,YAAMgjB,IAAc,KAAK,iBAAiB,gBAAgBD,CAAU;AACpE,iBAAW5lB,KAAO6lB;AACd,QAAAF,EAAY,KAAK3lB,EAAI,GAAG,GACxB,KAAK,eAAeA,CAAG;AAAA,IAE/B;AAEA,UAAM8lB,KAAe,MAAM,QAAQ,IAAIJ,EAAQ,IAAI,CAAA5/B,MAAO,KAAK,gBAAgBA,CAAG,CAAC,CAAC,GAAG,KAAI;AAE3F,eAAWigC,KAAcD,GAAa;AAClC,UAAIE,IAAkB,KAAK,iBAAiB,YAAYD,CAAU;AAClE,MAAIC,MAAoB,WAIpBA,IAAkB,KAAK,uBAAuB,UAAU,EAAE,OAAO,UAAS,GAAID,CAAU,GACxFC,EAAgB,QAAQxnB,EAAc,SACtC,KAAK,iBAAiB,YAAYwnB,CAAe,IAErD,KAAK,aAAaA,GAAiBxnB,EAAc,OAAO;AAAA,IAC5D;AAEA,UAAMynB,IAAiBr2E,GAAOk2E,CAAW,EAAE,OAAOH,CAAW,EAAE,IAAI,CAAA7/B,MAAOA,EAAI,SAAQ,CAAE,EAAE,MAAK;AAC/F,SAAK,iBAAiB,IACjB,OAAO,CAAAka,MAAO,CAACimB,EAAe,IAAIjmB,EAAI,IAAI,SAAQ,CAAE,KAAK,KAAK,aAAaA,GAAKimB,CAAc,CAAC,EAC/F,QAAQ,CAAAjmB,MAAO,KAAK,aAAaA,GAAKxB,EAAc,cAAc,CAAC,GAExE,MAAM,KAAK,WAAWsnB,GAAaH,CAAW,GAE9C,MAAMlqB,GAAkBoD,CAAW;AAEnC,UAAMqnB,IAAmB,KAAK,cAAc,KAAK,iBAAiB,IAC7D,OAAO,CAAAlmB;AAAA;AAAA,MAEZA,EAAI,QAAQxB,EAAc,aAEnB,CAAC,KAAK,WAAW,IAAIwB,EAAI,IAAI,SAAQ,CAAE,GAAG,aAG1C,KAAK,qBAAqBA,GAAK,KAAK,kBAAkB;AAAA,KAAC,EACzD,SAAS;AACd,UAAM,KAAK,eAAekmB,GAAkB,KAAK,oBAAoBrnB,CAAW;AAAA,EACpF;AAAA,EACA,qBAAqBvP,GAAU5+C,GAAS;AACpC,WAAO,KAAK,gCAAgC4+C,GAAU5+C,CAAO,EAAE,UAAU;AAAA,EAC7E;AAAA,EACA,gCAAgC4+C,GAAU5+C,GAAS;AAC/C,UAAM3B,IAAQ,KAAK,WAAW,IAAIugD,EAAS,IAAI,UAAU,GACnD62B,IAAgB,KAAK,gBAAgB,YAAY72B,EAAS,GAAG,EAAE,WAAW,mBAAmB,2BAA2BA,CAAQ,GAChI82B,IAAqBr3E,GAAO,QAAQ,mBAAmB,IAAI,IAAIA,GAAO,QAAQ,gBAAgB,IAAIA,GAAO,YAAYo3E,IAAgB,oBAAI,IAAG,GAC5IE,IAAuB31E,MAAY,UAAaA,EAAQ,eAAe,KAAQy1E,IAC/E,OAAOz1E,EAAQ,cAAe,WAAYA,EAAQ,WAAW,cAAcy1E,IAAiB,CAAA;AAClG,WAAOv2E,GAAOy2E,CAAmB,EAAE,OAAO,CAAAC,MAAa,CAACF,EAAmB,IAAIE,CAAS,CAAC,EAAE,QAAO;AAAA,EACtG;AAAA,EACA,MAAM,gBAAgBZ,GAAS;AAG3B,QADiB,KAAK,iBAAiB,YAAYA,CAAO,KAAK,KAAK,eAAe,IAAIA,CAAO;AAE1F,aAAO,CAACA,CAAO;AAGnB,QAAI;AACA,YAAMa,IAAO,MAAM,KAAK,mBAAmB,KAAKb,CAAO;AACvD,UAAIa,EAAK;AAGL,eADa,MAAM,KAAK,iBAAgB,EAAG,aAAab,CAAO;AAG9D,UAAI,KAAK,iBAAgB,EAAG,mBAAmBa,CAAI;AAEpD,eAAO,CAACb,CAAO;AAAA,IAEvB,QACM;AAAA,IAEN;AACA,WAAO,CAAA;AAAA,EACX;AAAA,EACA,MAAM,WAAWA,GAAS7iB,GAAS;AAC/B,UAAM,QAAQ,IAAI,KAAK,gBAAgB,IAAI,CAAAvI,MAAYA,EAASorB,GAAS7iB,CAAO,CAAC,CAAC;AAAA,EACtF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAc4iB,GAAW;AACrB,QAAI3lC,IAAO,GACPC,IAAQ0lC,EAAU,SAAS;AAC/B,WAAO3lC,IAAOC,KAAO;AACjB,aAAOD,IAAO2lC,EAAU,UAAU,KAAK,gBAAgBA,EAAU3lC,CAAI,CAAC;AAClE,QAAAA;AAEJ,aAAOC,KAAS,KAAK,CAAC,KAAK,gBAAgB0lC,EAAU1lC,CAAK,CAAC;AACvD,QAAAA;AAEJ,MAAID,IAAOC,MACP,CAAC0lC,EAAU3lC,CAAI,GAAG2lC,EAAU1lC,CAAK,CAAC,IAAI,CAAC0lC,EAAU1lC,CAAK,GAAG0lC,EAAU3lC,CAAI,CAAC;AAAA,IAEhF;AACA,WAAO2lC;AAAA,EACX;AAAA,EACA,gBAAgBzlB,GAAK;AACjB,WAAO,EAAQ,KAAK,eAAe,IAAIA,EAAI,GAAG;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa1Q,GAAUw2B,GAAa;AAEhC,WAAIx2B,EAAS,WAAW,KAAK,CAAAzwB,MAAOA,EAAI,UAAU,MAAS,IAChD,KAGJ,KAAK,aAAa,WAAWywB,GAAUw2B,CAAW;AAAA,EAC7D;AAAA,EACA,SAASvzB,GAAU;AACf,gBAAK,gBAAgB,KAAKA,CAAQ,GAC3B+Y,GAAW,OAAO,MAAM;AAC3B,YAAM3jE,IAAQ,KAAK,gBAAgB,QAAQ4qD,CAAQ;AACnD,MAAI5qD,KAAS,KACT,KAAK,gBAAgB,OAAOA,GAAO,CAAC;AAAA,IAE5C,CAAC;AAAA,EACL;AAAA,EACA,aAAa2nD,GAAUvgD,GAAO;AAC1B,YAAQA,GAAK;AAAA,MACT,KAAKyvD,EAAc;AAAA,MAGnB,KAAKA,EAAc;AACf,aAAK,aAAa,cAAclP,EAAS,GAAG;AAAA;AAAA,MAEhD,KAAKkP,EAAc;AACf,QAAAlP,EAAS,eAAe;AAAA;AAAA,MAE5B,KAAKkP,EAAc;AAEf,QADe,KAAK,gBAAgB,YAAYlP,EAAS,GAAG,EAAE,WAAW,OAClE,OAAOA,CAAQ;AAAA,MAG1B,KAAKkP,EAAc;AACf,aAAK,aAAa,iBAAiBlP,EAAS,GAAG;AAAA;AAAA,MAEnD,KAAKkP,EAAc;AACf,QAAAlP,EAAS,cAAc,QACvB,KAAK,WAAW,OAAOA,EAAS,IAAI,SAAQ,CAAE;AAAA;AAAA,MAElD,KAAKkP,EAAc;AAAA,IAE/B;AACQ,IAAIlP,EAAS,QAAQvgD,MACjBugD,EAAS,QAAQvgD;AAAA,EAEzB;AAAA,EACA,eAAeugD,GAAU;AACrB,SAAK,WAAW,OAAOA,EAAS,IAAI,SAAQ,CAAE,GAC9C,KAAK,aAAa,OAAOA,EAAS,GAAG,GAIrCA,EAAS,QAAQkP,EAAc;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,eAAeinB,GAAW/0E,GAASmuD,GAAa;AAClD,SAAK,aAAa4mB,GAAW/0E,CAAO,GAEpC,MAAM,KAAK,cAAc+0E,GAAWjnB,EAAc,QAAQK,GAAa,CAAAmB,MAAO,KAAK,uBAAuB,OAAOA,GAAKnB,CAAW,CAAC,GAElI,MAAM,KAAK,cAAc4mB,GAAWjnB,EAAc,gBAAgBK,GAAa,CAAAmB,MAAO,KAAK,aAAa,cAAcA,GAAKnB,CAAW,CAAC,GAEvI,MAAM,KAAK,cAAc4mB,GAAWjnB,EAAc,gBAAgBK,GAAa,OAAOmB,MAAQ;AAC1F,YAAMwmB,IAAmB,KAAK,gBAAgB,YAAYxmB,EAAI,GAAG,EAAE,WAAW;AAC9E,MAAAA,EAAI,eAAe,MAAMwmB,EAAiB,oBAAoBxmB,GAAKnB,CAAW;AAAA,IAClF,CAAC;AAED,UAAM4nB,IAAahB,EAAU,OAAO,CAAAzlB,MAAO,KAAK,WAAWA,CAAG,CAAC;AAC/D,UAAM,KAAK,cAAcymB,GAAYjoB,EAAc,QAAQK,GAAa,CAAAmB,MACrD,KAAK,gBAAgB,YAAYA,EAAI,GAAG,EAAE,WAAW,OACtD,KAAKA,GAAKnB,CAAW,CACtC,GAED,MAAM,KAAK,cAAc4nB,GAAYjoB,EAAc,mBAAmBK,GAAa,CAAAmB,MAAO,KAAK,aAAa,iBAAiBA,GAAKnB,CAAW,CAAC;AAE9I,UAAM6nB,IAAgBjB,EAAU,OAAO,CAAAzlB,MAC/B,KAAK,eAAeA,CAAG,IAChB,MAGP,KAAK,gBAAgBA,CAAG,GACjB,GAEd;AACD,UAAM,KAAK,cAAc0mB,GAAeloB,EAAc,WAAWK,GAAa,OAAOmB,MAAQ;AACzF,YAAM,KAAK,SAASA,GAAKnB,CAAW,GACpC,KAAK,gBAAgBmB,CAAG;AAAA,IAC5B,CAAC;AAAA,EACL;AAAA,EACA,gBAAgB1Q,GAAU;AACtB,UAAMvgD,IAAQ,KAAK,WAAW,IAAIugD,EAAS,IAAI,UAAU;AACzD,IAAIvgD,MACAA,EAAM,YAAY;AAAA,EAE1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa02E,GAAW/0E,GAAS;AAC7B,eAAWsvD,KAAOylB,GAAW;AACzB,YAAMp+E,IAAM24D,EAAI,IAAI,SAAQ,GACtBjxD,IAAQ,KAAK,WAAW,IAAI1H,CAAG;AACrC,OAAI,CAAC0H,KACEA,EAAM,cAET,KAAK,WAAW,IAAI1H,GAAK;AAAA,QACrB,WAAW;AAAA,QACX,SAAAqJ;AAAA,QACA,QAAQ3B,GAAO;AAAA,MACnC,CAAiB;AAAA,IAMT;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,cAAc02E,GAAWkB,GAAa9nB,GAAatM,GAAU;AAC/D,eAAWjD,KAAYm2B;AACnB,MAAIn2B,EAAS,QAAQq3B,MACjB,MAAMlrB,GAAkBoD,CAAW,GACnC,MAAMtM,EAASjD,CAAQ,GACvBA,EAAS,QAAQq3B,GACjB,MAAM,KAAK,oBAAoBr3B,GAAUq3B,GAAa9nB,CAAW;AAMzE,UAAM+nB,IAAkBnB,EAAU,OAAO,CAAAzlB,MAAOA,EAAI,UAAU2mB,CAAW;AACzE,UAAM,KAAK,iBAAiBC,GAAiBD,GAAa9nB,CAAW,GACrE,KAAK,eAAe8nB;AAAA,EACxB;AAAA,EACA,aAAaA,GAAap0B,GAAU;AAChC,gBAAK,oBAAoB,IAAIo0B,GAAap0B,CAAQ,GAC3C+Y,GAAW,OAAO,MAAM;AAC3B,WAAK,oBAAoB,OAAOqb,GAAap0B,CAAQ;AAAA,IACzD,CAAC;AAAA,EACL;AAAA,EACA,gBAAgBo0B,GAAap0B,GAAU;AACnC,gBAAK,uBAAuB,IAAIo0B,GAAap0B,CAAQ,GAC9C+Y,GAAW,OAAO,MAAM;AAC3B,WAAK,uBAAuB,OAAOqb,GAAap0B,CAAQ;AAAA,IAC5D,CAAC;AAAA,EACL;AAAA,EACA,UAAUxjD,GAAO83E,GAAYhoB,GAAa;AACtC,QAAI/Y;AAQJ,WAPI+gC,KAAc,UAAUA,IACxB/gC,IAAM+gC,IAGNhoB,IAAcgoB,GAElBhoB,MAAgBA,IAAchE,GAAAA,kBAAkB,OAC5C/U,IACO,KAAK,mBAAmB/2C,GAAO+2C,GAAK+Y,CAAW,IAG/C,KAAK,kBAAkB9vD,GAAO8vD,CAAW;AAAA,EAExD;AAAA,EACA,mBAAmB9vD,GAAO+2C,GAAK+Y,GAAa;AACxC,UAAMvP,IAAW,KAAK,iBAAiB,YAAYxJ,CAAG;AACtD,QAAKwJ,GAGA;AAAA,UAAIA,EAAS,SAASvgD;AACvB,eAAO,QAAQ,QAAQ+2C,CAAG;AAEzB,UAAI+Y,EAAY;AACjB,eAAO,QAAQ,OAAOvD,EAAkB;AAEvC,UAAI,KAAK,gBAAgBvsD,KAASA,IAAQugD,EAAS;AAIpD,eAAO,QAAQ,OAAO,IAAIuZ,GAAAA,cAAcyc,GAAAA,cAAc,eAAe,qBAAqBx/B,EAAI,SAAQ,CAAE,OAAO0Y,EAAclP,EAAS,KAAK,CAAC,eAAekP,EAAczvD,CAAK,CAAC,oCAAoCyvD,EAAc,KAAK,YAAY,CAAC,wBAAwB,CAAC;AAAA,UAZ5Q,QAAO,QAAQ,OAAO,IAAIqK,GAAAA,cAAcyc,GAAAA,cAAc,iBAAiB,8BAA8Bx/B,EAAI,SAAQ,CAAE,EAAE,CAAC;AAc1H,WAAO,IAAI,QAAQ,CAACoV,GAAS9uD,MAAW;AACpC,YAAM06E,IAAkB,KAAK,gBAAgB/3E,GAAO,CAACixD,MAAQ;AACzD,QAAI3C,GAAS,OAAO2C,EAAI,KAAKla,CAAG,MAC5BghC,EAAgB,QAAO,GACvBC,EAAiB,QAAO,GACxB7rB,EAAQ8E,EAAI,GAAG;AAAA,MAEvB,CAAC,GACK+mB,IAAmBloB,EAAY,wBAAwB,MAAM;AAC/D,QAAAioB,EAAgB,QAAO,GACvBC,EAAiB,QAAO,GACxB36E,EAAOkvD,EAAkB;AAAA,MAC7B,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,kBAAkBvsD,GAAO8vD,GAAa;AAClC,WAAI,KAAK,gBAAgB9vD,IACd,QAAQ,QAAO,IAEjB8vD,EAAY,0BACV,QAAQ,OAAOvD,EAAkB,IAErC,IAAI,QAAQ,CAACJ,GAAS9uD,MAAW;AACpC,YAAM06E,IAAkB,KAAK,aAAa/3E,GAAO,MAAM;AACnD,QAAA+3E,EAAgB,QAAO,GACvBC,EAAiB,QAAO,GACxB7rB,EAAO;AAAA,MACX,CAAC,GACK6rB,IAAmBloB,EAAY,wBAAwB,MAAM;AAC/D,QAAAioB,EAAgB,QAAO,GACvBC,EAAiB,QAAO,GACxB36E,EAAOkvD,EAAkB;AAAA,MAC7B,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,MAAM,oBAAoBhM,GAAUvgD,GAAO8vD,GAAa;AAEpD,UAAMmoB,IADY,KAAK,uBAAuB,IAAIj4E,CAAK,EACvB,MAAK;AACrC,eAAWurD,KAAY0sB;AACnB,UAAI;AACA,cAAMvrB,GAAkBoD,CAAW,GACnC,MAAMvE,EAAShL,GAAUuP,CAAW;AAAA,MACxC,SACOrD,GAAK;AAGR,YAAI,CAACD,GAAqBC,CAAG;AACzB,gBAAMA;AAAA,MAEd;AAAA,EAER;AAAA,EACA,MAAM,iBAAiBiqB,GAAW12E,GAAO8vD,GAAa;AAClD,QAAI4mB,EAAU,WAAW;AAErB;AAGJ,UAAMuB,IADY,KAAK,oBAAoB,IAAIj4E,CAAK,EACpB,MAAK;AACrC,eAAWurD,KAAY0sB;AACnB,YAAMvrB,GAAkBoD,CAAW,GACnC,MAAMvE,EAASmrB,GAAW5mB,CAAW;AAAA,EAE7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAWvP,GAAU;AACjB,WAAO,KAAK,gBAAgBA,CAAQ,EAAE,gBAAgB;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAeA,GAAU;AACrB,WAAO,EAAQ,KAAK,gBAAgBA,CAAQ,EAAE;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAASA,GAAUuP,GAAa;AAClC,UAAMooB,IAAY,KAAK,gBAAgB,YAAY33B,EAAS,GAAG,EAAE,WAAW,mBACtE5+C,IAAU,KAAK,gBAAgB4+C,CAAQ,GACvC43B,IAAoB,OAAOx2E,EAAQ,cAAe,WAAW,EAAE,GAAGA,EAAQ,WAAU,IAAK,CAAA;AAC/F,IAAAw2E,EAAkB,aAAa,KAAK,gCAAgC53B,GAAU5+C,CAAO;AACrF,UAAMg8C,IAAc,MAAMu6B,EAAU,iBAAiB33B,GAAU43B,GAAmBroB,CAAW;AAC7F,IAAIvP,EAAS,cACTA,EAAS,YAAY,KAAK,GAAG5C,CAAW,IAGxC4C,EAAS,cAAc5C;AAG3B,UAAM39C,IAAQ,KAAK,WAAW,IAAIugD,EAAS,IAAI,UAAU;AACzD,IAAIvgD,MACAA,EAAM,WAAWA,EAAM,SAAS,CAAA,IAC5BA,EAAM,OAAO,mBACbA,EAAM,OAAO,mBAAmBa,GAAOb,EAAM,OAAO,gBAAgB,EAAE,OAAOm4E,EAAkB,UAAU,EAAE,SAAQ,EAAG,QAAO,IAG7Hn4E,EAAM,OAAO,mBAAmB,CAAC,GAAGm4E,EAAkB,UAAU;AAAA,EAG5E;AAAA,EACA,gBAAgB53B,GAAU;AACtB,WAAO,KAAK,WAAW,IAAIA,EAAS,IAAI,SAAQ,CAAE,GAAG,WAAW,CAAA;AAAA,EACpE;AACJ;AC3eO,MAAM63B,GAAoB;AAAA,EAC7B,YAAYpkE,GAAU;AAKlB,SAAK,cAAc,oBAAI,IAAG,GAK1B,KAAK,oBAAoB,IAAIs/C,GAAY,GAMzC,KAAK,iBAAiB,oBAAI,IAAG,GAC7B,KAAK,YAAYt/C,EAAS,UAAU,kBACpC,KAAK,kBAAkBA,EAAS,iBAChC,KAAK,gBAAgBA,EAAS;AAAA,EAClC;AAAA,EACA,kBAAkB69C,GAAYwmB,GAAa;AACvC,UAAMC,IAAeh2E,GAAYuvD,CAAU,EAAE,KACvC/4D,IAAS,CAAA;AACf,gBAAK,eAAe,QAAQ,CAAAy/E,MAAW;AACnC,MAAAA,EAAQ,QAAQ,CAAAC,MAAY;AACxB,QAAIlqB,GAAS,OAAOkqB,EAAS,WAAWF,CAAY,KAAKE,EAAS,eAAeH,KAC7Ev/E,EAAO,KAAK0/E,CAAQ;AAAA,MAE5B,CAAC;AAAA,IACL,CAAC,GACM33E,GAAO/H,CAAM;AAAA,EACxB;AAAA,EACA,YAAY2/E,GAAUC,GAAM;AACxB,QAAIC,IAAe93E,GAAO,KAAK,YAAY,KAAI,CAAE;AACjD,WAAI63E,MACAC,IAAeA,EAAa,OAAO,CAAA5hC,MAAO,CAAC2hC,KAAQA,EAAK,IAAI3hC,CAAG,CAAC,IAE7D4hC,EACF,IAAI,CAAA5hC,MAAO,KAAK,oBAAoBA,GAAK0hC,CAAQ,CAAC,EAClD,KAAI;AAAA,EACb;AAAA,EACA,oBAAoB1hC,GAAK0hC,GAAU;AAC/B,WAAKA,IAGgB,KAAK,kBAAkB,IAAI1hC,GAAK0hC,GAAU,OAC/B,KAAK,YAAY,IAAI1hC,CAAG,KAAK,CAAA,GAC9B,OAAO,CAAA31C,MAAK,KAAK,cAAc,UAAUA,EAAE,MAAMq3E,CAAQ,CAAC,CACxF,IALU,KAAK,YAAY,IAAI1hC,CAAG,KAAK,CAAA;AAAA,EAO5C;AAAA,EACA,OAAOA,GAAK;AACR,SAAK,cAAcA,CAAG,GACtB,KAAK,iBAAiBA,CAAG;AAAA,EAC7B;AAAA,EACA,cAAcA,GAAK;AACf,UAAMwY,IAAYxY,EAAI,SAAQ;AAC9B,SAAK,YAAY,OAAOwY,CAAS,GACjC,KAAK,kBAAkB,MAAMA,CAAS;AAAA,EAC1C;AAAA,EACA,iBAAiBxY,GAAK;AAClB,UAAMwY,IAAYxY,EAAI,SAAQ;AAC9B,SAAK,eAAe,OAAOwY,CAAS;AAAA,EACxC;AAAA,EACA,MAAM,cAAchP,GAAUuP,IAAchE,GAAAA,kBAAkB,MAAM;AAEhE,UAAMyG,IAAU,MADC,KAAK,gBAAgB,YAAYhS,EAAS,GAAG,EAC/B,WAAW,iBAAiB,uBAAuBA,GAAUuP,CAAW,GACjG/Y,IAAMwJ,EAAS,IAAI,SAAQ;AACjC,SAAK,YAAY,IAAIxJ,GAAKwb,CAAO,GACjC,KAAK,kBAAkB,MAAMxb,CAAG;AAAA,EACpC;AAAA,EACA,MAAM,iBAAiBwJ,GAAUuP,IAAchE,GAAAA,kBAAkB,MAAM;AAEnE,UAAM8sB,IAAY,MADD,KAAK,gBAAgB,YAAYr4B,EAAS,GAAG,EAC7B,UAAU,6BAA6B,mBAAmBA,GAAUuP,CAAW;AAChH,SAAK,eAAe,IAAIvP,EAAS,IAAI,SAAQ,GAAIq4B,CAAS;AAAA,EAC9D;AAAA,EACA,WAAWr4B,GAAUw2B,GAAa;AAC9B,UAAMtlB,IAAa,KAAK,eAAe,IAAIlR,EAAS,IAAI,UAAU;AAClE,WAAKkR,IAGEA,EAAW,KAAK,CAAA3hC,MAAO,CAACA,EAAI,SAASinD,EAAY,IAAIjnD,EAAI,UAAU,SAAQ,CAAE,CAAC,IAF1E;AAAA,EAGf;AACJ;ACtFO,MAAM+oD,GAAwB;AAAA,EACjC,YAAY7kE,GAAU;AAClB,SAAK,sBAAsB,CAAA,GAC3B,KAAK,SAAS,IAAI24C,GAAQ,GAC1B,KAAK,kBAAkB34C,EAAS,iBAChC,KAAK,mBAAmBA,EAAS,UAAU,kBAC3C,KAAK,kBAAkBA,EAAS,UAAU,iBAC1C,KAAK,qBAAqBA,EAAS,UAAU,oBAC7C,KAAK,QAAQA,EAAS,UAAU;AAAA,EACpC;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,KAAK,OAAO;AAAA,EACvB;AAAA,EACA,IAAI,mBAAmB;AACnB,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,WAAWolD,GAAQ;AACf,SAAK,UAAUA,EAAO,oBAAoB;AAAA,EAC9C;AAAA,EACA,YAAY0f,GAAS;AAGjB,WAAO,KAAK,MAAM,MAAM,CAAA1vE,MAAS,KAAK,oBAAoB,KAAK,WAAW,CAAA,GAAIA,CAAK,CAAC;AAAA,EACxF;AAAA,EACA,MAAM,oBAAoB2vE,GAASjpB,IAAchE,GAAAA,kBAAkB,MAAM;AACrE,UAAM4qB,IAAY,MAAM,KAAK,eAAeqC,CAAO;AAGnD,UAAMrsB,GAAkBoD,CAAW,GACnC,MAAM,KAAK,gBAAgB,MAAM4mB,GAAW,KAAK,qBAAqB5mB,CAAW;AAAA,EACrF;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,eAAeipB,GAAS;AAC1B,UAAMrC,IAAY,CAAA,GACZsC,IAAY,CAACz4B,MAAa;AAC5B,MAAAm2B,EAAU,KAAKn2B,CAAQ,GAClB,KAAK,iBAAiB,YAAYA,EAAS,GAAG,KAC/C,KAAK,iBAAiB,YAAYA,CAAQ;AAAA,IAElD;AAIA,UAAM,KAAK,wBAAwBw4B,GAASC,CAAS;AACrD,UAAMN,IAAO,CAAA;AACb,UAAM,QAAQ,IAAIK,EAAQ,IAAI,CAAAE,MAAM,KAAK,cAAcA,CAAE,CAAC,EACrD,IAAI,OAAOzoC,MAAU,KAAK,eAAeA,GAAOkoC,CAAI,CAAC,CAAC;AAC3D,UAAMQ,IAAar4E,GAAO63E,CAAI,EAEzB,SAAS,CAAA3hC,MAAOA,EAAI,SAAQ,CAAE,EAE9B,OAAO,CAAAA,MAAO,CAAC,KAAK,iBAAiB,YAAYA,CAAG,CAAC;AAC1D,iBAAM,KAAK,uBAAuBmiC,GAAYF,CAAS,GACvD,KAAK,OAAO,QAAO,GACZtC;AAAA,EACX;AAAA,EACA,MAAM,uBAAuBgC,GAAMM,GAAW;AAC1C,UAAM,QAAQ,IAAIN,EAAK,IAAI,OAAO3hC,MAAQ;AACtC,YAAMwJ,IAAW,MAAM,KAAK,iBAAiB,oBAAoBxJ,CAAG;AACpE,MAAAiiC,EAAUz4B,CAAQ;AAAA,IACtB,CAAC,CAAC;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,wBAAwB44B,GAAUC,GAAY;AAC1C,WAAO,QAAQ,QAAO;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAcC,GAAiB;AAC3B,WAAOpjC,GAAI,MAAMojC,EAAgB,GAAG;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,eAAeC,GAAYZ,GAAM;AACnC,QAAI;AACA,YAAMt4B,IAAU,MAAM,KAAK,mBAAmB,cAAck5B,CAAU;AACtE,YAAM,QAAQ,IAAIl5B,EAAQ,IAAI,OAAO5P,MAAU;AAC3C,QAAI,KAAK,mBAAmBA,CAAK,MACzBA,EAAM,cACN,MAAM,KAAK,eAAeA,EAAM,KAAKkoC,CAAI,IAEpCloC,EAAM,UACXkoC,EAAK,KAAKloC,EAAM,GAAG;AAAA,MAG/B,CAAC,CAAC;AAAA,IACN,SACOpvC,GAAG;AACN,cAAQ,MAAM,0CAA0Ck4E,EAAW,SAAS,EAAI,GAAGl4E,CAAC;AAAA,IACxF;AAAA,EACJ;AAAA,EACA,MAAM,aAAa21C,GAAK;AACpB,UAAM2hC,IAAO,CAAA;AACb,iBAAM,KAAK,eAAe3hC,GAAK2hC,CAAI,GAC5BA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,mBAAmBloC,GAAO;AACtB,UAAMruC,IAAOmsD,GAAS,SAAS9d,EAAM,GAAG;AACxC,WAAIruC,EAAK,WAAW,GAAG,IACZ,KAEPquC,EAAM,cACCruC,MAAS,kBAAkBA,MAAS,QAEtCquC,EAAM,SACJ,KAAK,gBAAgB,YAAYA,EAAM,GAAG,IAE9C;AAAA,EACX;AACJ;AC/HO,MAAM+oC,GAAiC;AAAA,EAC1C,iCAAiCvyD,GAAUC,GAAapuB,GAAQquB,GAAMC,GAAQ;AAC1E,WAAOJ,GAA0B,iCAAiCC,GAAUC,GAAapuB,GAAQquB,GAAMC,CAAM;AAAA,EACjH;AAAA,EACA,iCAAiC/d,GAAO;AACpC,WAAO2d,GAA0B,iCAAiC3d,CAAK;AAAA,EAC3E;AACJ;AACO,MAAMowE,KAA2B,EAAE,MAAM,OAAM;AAC/C,MAAMC,GAAa;AAAA,EACtB,YAAYzlE,GAAU;AAClB,SAAK,uBAAuBA,EAAS,OAAO,2BAC5C,KAAK,eAAeA,EAAS,OAAO;AACpC,UAAMwuC,IAAS,KAAK,aAAa,YAAYxuC,EAAS,SAAS;AAAA,MAC3D,iBAAiBA,EAAS,iBAAiB;AAAA,IACvD,CAAS;AACD,SAAK,aAAa,KAAK,sBAAsBwuC,CAAM;AACnD,UAAMk3B,IAAcC,GAAsBn3B,CAAM,IAAI,OAAO,OAAOA,CAAM,IAAIA,GACtEpT,IAAap7B,EAAS,iBAAiB,SAAS;AACtD,SAAK,kBAAkB,IAAI4lE,GAAgBF,GAAa;AAAA,MACpD,kBAAkB;AAAA,MAClB,iBAAiBtqC;AAAA,MACjB,sBAAsB,KAAK;AAAA,IACvC,CAAS;AAAA,EACL;AAAA,EACA,IAAI,aAAa;AACb,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,SAASvqB,GAAMymC,IAAWkuB,IAA0B;AAChD,UAAMK,IAAmB,KAAK,gBAAgB,SAASh1D,CAAI;AAC3D,WAAO;AAAA,MACH,QAAQg1D,EAAiB;AAAA,MACzB,QAAQA,EAAiB;AAAA,MACzB,QAAQA,EAAiB,OAAO,UAAU,CAAA;AAAA,MAC1C,QAAQ,KAAK,aAAa,oBAAoBh1D,CAAI;AAAA,IAC9D;AAAA,EACI;AAAA,EACA,sBAAsBi1D,GAAa;AAC/B,QAAIH,GAAsBG,CAAW;AACjC,aAAOA;AACX,UAAMt3B,IAASu3B,GAA4BD,CAAW,IAAI,OAAO,OAAOA,EAAY,KAAK,EAAE,KAAI,IAAKA,GAC9FE,IAAM,CAAA;AACZ,WAAAx3B,EAAO,QAAQ,CAAAp5C,MAAS4wE,EAAI5wE,EAAM,IAAI,IAAIA,CAAK,GACxC4wE;AAAA,EACX;AACJ;AAIO,SAASC,GAAiBpyC,GAAiB;AAC9C,SAAO,MAAM,QAAQA,CAAe,MAAMA,EAAgB,WAAW,KAAK,UAAUA,EAAgB,CAAC;AACzG;AAIO,SAASkyC,GAA4BlyC,GAAiB;AACzD,SAAOA,KAAmB,WAAWA,KAAmB,iBAAiBA;AAC7E;AAIO,SAAS8xC,GAAsB9xC,GAAiB;AACnD,SAAO,CAACoyC,GAAiBpyC,CAAe,KAAK,CAACkyC,GAA4BlyC,CAAe;AAC7F;AC7DO,SAASqyC,GAAWz7E,GAAM/F,GAAOiJ,GAAS;AAC7C,MAAIw4E,GACA9gC;AACJ,EAAI,OAAO56C,KAAS,YAChB46C,IAAW3gD,GACXyhF,IAAOx4E,MAGP03C,IAAW56C,EAAK,MAAM,OACtB07E,IAAOzhF,IAEN2gD,MACDA,IAAWjD,GAAS,OAAO,GAAG,CAAC;AAEnC,QAAMgkC,IAAQC,GAAS57E,CAAI,GACrB67E,IAAoBC,GAAiBJ,CAAI,GACzC33B,IAASg4B,GAAS;AAAA,IACpB,OAAAJ;AAAA,IACA,UAAA/gC;AAAA,IACA,SAASihC;AAAA,EACjB,CAAK;AACD,SAAOG,GAAkB;AAAA,IACrB,OAAO;AAAA,IACP,QAAAj4B;AAAA,IACA,UAAAnJ;AAAA,EACR,CAAK;AACL;AACO,SAASqhC,GAAQj8E,GAAMkD,GAAS;AACnC,QAAM24E,IAAoBC,GAAiB54E,CAAO,GAC5Cy4E,IAAQC,GAAS57E,CAAI;AAC3B,MAAI27E,EAAM,WAAW;AACjB,WAAO;AAEX,QAAM/pE,IAAQ+pE,EAAM,CAAC,GACfjwD,IAAOiwD,EAAMA,EAAM,SAAS,CAAC,GAC7BO,IAAaL,EAAkB,OAC/BM,IAAYN,EAAkB;AACpC,SAAO,EAAQK,GAAY,KAAKtqE,CAAK,KAAM,EAAQuqE,GAAW,KAAKzwD,CAAI;AAC3E;AACA,SAASkwD,GAAS57E,GAAM;AACpB,MAAI2hD,IAAU;AACd,SAAI,OAAO3hD,KAAS,WAChB2hD,IAAU3hD,IAGV2hD,IAAU3hD,EAAK,MAEL2hD,EAAQ,MAAM9yC,EAAc;AAE9C;AACA,MAAMutE,KAAW,mCACXC,KAAiB;AACvB,SAASN,GAASzvB,GAAS;AACvB,QAAMvI,IAAS,CAAA;AACf,MAAIu4B,IAAchwB,EAAQ,SAAS,MAC/BiwB,IAAmBjwB,EAAQ,SAAS;AACxC,WAAS,IAAI,GAAG,IAAIA,EAAQ,MAAM,QAAQ,KAAK;AAC3C,UAAM16C,IAAQ,MAAM,GACd8Z,IAAO,MAAM4gC,EAAQ,MAAM,SAAS;AAC1C,QAAI7jC,IAAO6jC,EAAQ,MAAM,CAAC,GACtBnyD,IAAQ;AACZ,QAAIyX,KAAS06C,EAAQ,QAAQ,OAAO;AAChC,YAAM38C,IAAQ28C,EAAQ,QAAQ,OAAO,KAAK7jC,CAAI;AAC9C,MAAI9Y,MACAxV,IAAQwV,EAAM,QAAQA,EAAM,CAAC,EAAE;AAAA,IAEvC,OACK;AACD,YAAMA,IAAQ28C,EAAQ,QAAQ,MAAM,KAAK7jC,CAAI;AAC7C,MAAI9Y,MACAxV,IAAQwV,EAAM,QAAQA,EAAM,CAAC,EAAE;AAAA,IAEvC;AACA,QAAI+b,GAAM;AACN,YAAM/b,IAAQ28C,EAAQ,QAAQ,KAAK,KAAK7jC,CAAI;AAC5C,MAAI9Y,MACA8Y,IAAOA,EAAK,UAAU,GAAG9Y,EAAM,KAAK;AAAA,IAE5C;AAGA,QAFA8Y,IAAOA,EAAK,UAAU,GAAG+zD,GAAc/zD,CAAI,CAAC,GACtBg0D,GAAeh0D,GAAMtuB,CAAK,KAC3BsuB,EAAK;AAEtB,UAAIs7B,EAAO,SAAS,GAAG;AACnB,cAAMnJ,IAAWjD,GAAS,OAAO2kC,GAAaC,CAAgB;AAC9D,QAAAx4B,EAAO,KAAK;AAAA,UACR,MAAM;AAAA,UACN,SAAS;AAAA,UACT,OAAO/L,EAAM,OAAO4C,GAAUA,CAAQ;AAAA,QAC1D,CAAiB;AAAA,MACL;AAAA,WAEC;AACD,MAAAwhC,GAAS,YAAYjiF;AACrB,YAAMuiF,IAAWN,GAAS,KAAK3zD,CAAI;AACnC,UAAIi0D,GAAU;AACV,cAAMC,IAAYD,EAAS,CAAC,GACtBliF,IAAQkiF,EAAS,CAAC,GAClBziF,IAAQ09C,GAAS,OAAO2kC,GAAaC,IAAmBpiF,CAAK,GAC7DD,IAAMy9C,GAAS,OAAO2kC,GAAaC,IAAmBpiF,IAAQwiF,EAAU,MAAM;AACpF,QAAA54B,EAAO,KAAK;AAAA,UACR,MAAM;AAAA,UACN,SAASvpD;AAAA,UACT,OAAOw9C,EAAM,OAAO/9C,GAAOC,CAAG;AAAA,QAClD,CAAiB,GACDC,KAASwiF,EAAU,QACnBxiF,IAAQsiF,GAAeh0D,GAAMtuB,CAAK;AAAA,MACtC;AACA,UAAIA,IAAQsuB,EAAK,QAAQ;AACrB,cAAMsU,IAAOtU,EAAK,UAAUtuB,CAAK,GAC3ByiF,IAAmB,MAAM,KAAK7/C,EAAK,SAASs/C,EAAc,CAAC;AACjE,QAAAt4B,EAAO,KAAK,GAAG84B,GAAkBD,GAAkB7/C,GAAMu/C,GAAaC,IAAmBpiF,CAAK,CAAC;AAAA,MACnG;AAAA,IACJ;AACA,IAAAmiF,KACAC,IAAmB;AAAA,EACvB;AAEA,SAAIx4B,EAAO,SAAS,KAAKA,EAAOA,EAAO,SAAS,CAAC,EAAE,SAAS,UACjDA,EAAO,MAAM,GAAG,EAAE,IAEtBA;AACX;AACA,SAAS84B,GAAkBC,GAAMr0D,GAAMs0D,GAAWC,GAAgB;AAC9D,QAAMj5B,IAAS,CAAA;AACf,MAAI+4B,EAAK,WAAW,GAAG;AACnB,UAAM7iF,IAAQ09C,GAAS,OAAOolC,GAAWC,CAAc,GACjD9iF,IAAMy9C,GAAS,OAAOolC,GAAWC,IAAiBv0D,EAAK,MAAM;AACnE,IAAAs7B,EAAO,KAAK;AAAA,MACR,MAAM;AAAA,MACN,SAASt7B;AAAA,MACT,OAAOuvB,EAAM,OAAO/9C,GAAOC,CAAG;AAAA,IAC1C,CAAS;AAAA,EACL,OACK;AACD,QAAI+iF,IAAY;AAChB,eAAWttE,KAASmtE,GAAM;AACtB,YAAMI,IAAavtE,EAAM,OACnBwtE,IAAe10D,EAAK,UAAUw0D,GAAWC,CAAU;AACzD,MAAIC,EAAa,SAAS,KACtBp5B,EAAO,KAAK;AAAA,QACR,MAAM;AAAA,QACN,SAASt7B,EAAK,UAAUw0D,GAAWC,CAAU;AAAA,QAC7C,OAAOllC,EAAM,OAAOL,GAAS,OAAOolC,GAAWE,IAAYD,CAAc,GAAGrlC,GAAS,OAAOolC,GAAWG,IAAaF,CAAc,CAAC;AAAA,MACvJ,CAAiB;AAEL,UAAInyE,IAASsyE,EAAa,SAAS;AACnC,YAAMC,IAAUztE,EAAM,CAAC;AAOvB,UANAo0C,EAAO,KAAK;AAAA,QACR,MAAM;AAAA,QACN,SAASq5B;AAAA,QACT,OAAOplC,EAAM,OAAOL,GAAS,OAAOolC,GAAWE,IAAYpyE,IAASmyE,CAAc,GAAGrlC,GAAS,OAAOolC,GAAWE,IAAYpyE,IAASuyE,EAAQ,SAASJ,CAAc,CAAC;AAAA,MACrL,CAAa,GACDnyE,KAAUuyE,EAAQ,QACdztE,EAAM,WAAW,GAAG;AACpB,QAAA9E,KAAU8E,EAAM,CAAC,EAAE;AACnB,cAAMnV,IAAQmV,EAAM,CAAC;AACrB,QAAAo0C,EAAO,KAAK;AAAA,UACR,MAAM;AAAA,UACN,SAASvpD;AAAA,UACT,OAAOw9C,EAAM,OAAOL,GAAS,OAAOolC,GAAWE,IAAYpyE,IAASmyE,CAAc,GAAGrlC,GAAS,OAAOolC,GAAWE,IAAYpyE,IAASrQ,EAAM,SAASwiF,CAAc,CAAC;AAAA,QACvL,CAAiB;AAAA,MACL;AAEI,QAAAj5B,EAAO,KAAK;AAAA,UACR,MAAM;AAAA,UACN,SAAS;AAAA,UACT,OAAO/L,EAAM,OAAOL,GAAS,OAAOolC,GAAWE,IAAYpyE,IAASmyE,CAAc,GAAGrlC,GAAS,OAAOolC,GAAWE,IAAYpyE,IAASmyE,CAAc,CAAC;AAAA,QACxK,CAAiB;AAEL,MAAAC,IAAYC,IAAavtE,EAAM,CAAC,EAAE;AAAA,IACtC;AACA,UAAM0tE,IAAa50D,EAAK,UAAUw0D,CAAS;AAC3C,IAAII,EAAW,SAAS,KACpBt5B,EAAO,KAAK;AAAA,MACR,MAAM;AAAA,MACN,SAASs5B;AAAA,MACT,OAAOrlC,EAAM,OAAOL,GAAS,OAAOolC,GAAWE,IAAYD,CAAc,GAAGrlC,GAAS,OAAOolC,GAAWE,IAAYD,IAAiBK,EAAW,MAAM,CAAC;AAAA,IACtK,CAAa;AAAA,EAET;AACA,SAAOt5B;AACX;AACA,MAAMu5B,KAAqB,MACrBC,KAAqB;AAC3B,SAASd,GAAeh0D,GAAMtuB,GAAO;AACjC,QAAMwV,IAAQ8Y,EAAK,UAAUtuB,CAAK,EAAE,MAAMmjF,EAAkB;AAC5D,SAAI3tE,IACOxV,IAAQwV,EAAM,QAGd8Y,EAAK;AAEpB;AACA,SAAS+zD,GAAc/zD,GAAM;AACzB,QAAM9Y,IAAQ8Y,EAAK,MAAM80D,EAAkB;AAC3C,MAAI5tE,KAAS,OAAOA,EAAM,SAAU;AAChC,WAAOA,EAAM;AAGrB;AAEA,SAASqsE,GAAkB1vB,GAAS;AAChC,QAAMkxB,IAAgB7lC,GAAS,OAAO2U,EAAQ,SAAS,MAAMA,EAAQ,SAAS,SAAS;AACvF,MAAIA,EAAQ,OAAO,WAAW;AAC1B,WAAO,IAAImxB,GAAiB,IAAIzlC,EAAM,OAAOwlC,GAAeA,CAAa,CAAC;AAE9E,QAAM9pB,IAAW,CAAA;AACjB,SAAOpH,EAAQ,QAAQA,EAAQ,OAAO,UAAQ;AAC1C,UAAMjrD,IAAUq8E,GAAkBpxB,GAASoH,EAASA,EAAS,SAAS,CAAC,CAAC;AACxE,IAAIryD,KACAqyD,EAAS,KAAKryD,CAAO;AAAA,EAE7B;AACA,QAAMpH,IAAQy5D,EAAS,CAAC,GAAG,MAAM,SAAS8pB,GACpCtjF,IAAMw5D,EAASA,EAAS,SAAS,CAAC,GAAG,MAAM,OAAO8pB;AACxD,SAAO,IAAIC,GAAiB/pB,GAAU1b,EAAM,OAAO/9C,GAAOC,CAAG,CAAC;AAClE;AACA,SAASwjF,GAAkBpxB,GAAS5gC,GAAM;AACtC,QAAMzqB,IAAOqrD,EAAQ,OAAOA,EAAQ,KAAK;AACzC,MAAIrrD,EAAK,SAAS;AACd,WAAO08E,GAAcrxB,GAAS,EAAK;AAElC,MAAIrrD,EAAK,SAAS,UAAUA,EAAK,SAAS;AAC3C,WAAO28E,GAAetxB,CAAO;AAG7B,EAAAuxB,GAAgB58E,GAAMyqB,CAAI,GAC1B4gC,EAAQ;AAGhB;AACA,SAASuxB,GAAgBlzE,GAAOtJ,GAAS;AACrC,MAAIA,GAAS;AACT,UAAMonB,IAAO,IAAIq1D,GAAc,IAAInzE,EAAM,KAAK;AAC9C,IAAI,aAAatJ,IACbA,EAAQ,QAAQ,KAAKonB,CAAI,IAGzBpnB,EAAQ,QAAQ,QAAQ,KAAKonB,CAAI;AAAA,EAEzC;AACJ;AACA,SAASm1D,GAAetxB,GAAS;AAC7B,MAAI3hD,IAAQ2hD,EAAQ,OAAOA,EAAQ,KAAK;AACxC,QAAMyxB,IAAapzE;AACnB,MAAIqzE,IAAYrzE;AAChB,QAAMgxE,IAAQ,CAAA;AACd,SAAOhxE,KAASA,EAAM,SAAS,WAAWA,EAAM,SAAS;AACrD,IAAAgxE,EAAM,KAAKsC,GAAiB3xB,CAAO,CAAC,GACpC0xB,IAAYrzE,GACZA,IAAQ2hD,EAAQ,OAAOA,EAAQ,KAAK;AAExC,SAAO,IAAI4xB,GAAcvC,GAAO3jC,EAAM,OAAO+lC,EAAW,MAAM,OAAOC,EAAU,MAAM,GAAG,CAAC;AAC7F;AACA,SAASC,GAAiB3xB,GAAS;AAE/B,SADcA,EAAQ,OAAOA,EAAQ,KAAK,EAChC,SAAS,eACRqxB,GAAcrxB,GAAS,EAAI,IAG3B6xB,GAAe7xB,CAAO;AAErC;AACA,SAASqxB,GAAcrxB,GAAS8xB,GAAQ;AACpC,QAAMC,IAAW/xB,EAAQ,OAAOA,EAAQ,OAAO,GACzC5oD,IAAO26E,EAAS,QAAQ,UAAU,CAAC;AAEzC,MADkB/xB,EAAQ,OAAOA,EAAQ,KAAK,GAC/B,SAAS;AACpB,QAAI8xB,GAAQ;AACR,YAAME,IAAUH,GAAe7xB,CAAO;AACtC,aAAO,IAAIiyB,GAAa76E,GAAM,IAAIw6E,GAAc,CAACI,CAAO,GAAGA,EAAQ,KAAK,GAAGF,GAAQpmC,EAAM,OAAOqmC,EAAS,MAAM,OAAOC,EAAQ,MAAM,GAAG,CAAC;AAAA,IAC5I,OACK;AACD,YAAM7sB,IAAUmsB,GAAetxB,CAAO;AACtC,aAAO,IAAIiyB,GAAa76E,GAAM+tD,GAAS2sB,GAAQpmC,EAAM,OAAOqmC,EAAS,MAAM,OAAO5sB,EAAQ,MAAM,GAAG,CAAC;AAAA,IACxG;AAAA,OAEC;AACD,UAAMvtD,IAAQm6E,EAAS;AACvB,WAAO,IAAIE,GAAa76E,GAAM,IAAIw6E,GAAc,CAAA,GAAIh6E,CAAK,GAAGk6E,GAAQl6E,CAAK;AAAA,EAC7E;AACJ;AACA,SAASi6E,GAAe7xB,GAAS;AAC7B,QAAM3hD,IAAQ2hD,EAAQ,OAAOA,EAAQ,OAAO;AAC5C,SAAO,IAAIwxB,GAAcnzE,EAAM,SAASA,EAAM,KAAK;AACvD;AACA,SAASmxE,GAAiB54E,GAAS;AAC/B,MAAI,CAACA;AACD,WAAO44E,GAAiB;AAAA,MACpB,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM;AAAA,IAClB,CAAS;AAEL,QAAM,EAAE,OAAA7hF,GAAO,KAAAC,GAAK,MAAAuuB,EAAI,IAAKvlB;AAC7B,SAAO;AAAA,IACH,OAAOs7E,GAAgBvkF,GAAO,EAAI;AAAA,IAClC,KAAKukF,GAAgBtkF,GAAK,EAAK;AAAA,IAC/B,MAAMskF,GAAgB/1D,GAAM,EAAI;AAAA,EACxC;AACA;AACA,SAAS+1D,GAAgB7iD,GAAQ1hC,GAAO;AACpC,MAAI,OAAO0hC,KAAW,YAAY,OAAOA,KAAW,UAAU;AAC1D,UAAM8iD,IAAU,OAAO9iD,KAAW,WAAW1sB,GAAa0sB,CAAM,IAAIA,EAAO;AAC3E,WAAI1hC,IACO,IAAI,OAAO,QAAQwkF,CAAO,EAAE,IAG5B,IAAI,OAAO,OAAOA,CAAO,OAAO;AAAA,EAE/C;AAEI,WAAO9iD;AAEf;AACA,MAAM8hD,GAAiB;AAAA,EACnB,YAAY/pB,GAAUxvD,GAAO;AACzB,SAAK,WAAWwvD,GAChB,KAAK,QAAQxvD;AAAA,EACjB;AAAA,EACA,OAAOR,GAAM;AACT,WAAO,KAAK,aAAa,KAAK,CAAAf,MAAKA,EAAE,SAASe,CAAI;AAAA,EACtD;AAAA,EACA,QAAQA,GAAM;AACV,WAAO,KAAK,aAAa,OAAO,CAAAf,MAAKA,EAAE,SAASe,CAAI;AAAA,EACxD;AAAA,EACA,aAAa;AACT,WAAO,KAAK,SAAS,OAAO,OAAK,UAAU,CAAC;AAAA,EAChD;AAAA,EACA,WAAW;AACP,QAAIlJ,IAAQ;AACZ,eAAW6G,KAAW,KAAK;AACvB,UAAI7G,EAAM,WAAW;AACjB,QAAAA,IAAQ6G,EAAQ,SAAQ;AAAA,WAEvB;AACD,cAAM+kB,IAAO/kB,EAAQ,SAAQ;AAC7B,QAAA7G,KAASkkF,GAAalkF,CAAK,IAAI4rB;AAAA,MACnC;AAEJ,WAAO5rB,EAAM,KAAI;AAAA,EACrB;AAAA,EACA,WAAW0I,GAAS;AAChB,QAAI1I,IAAQ;AACZ,eAAW6G,KAAW,KAAK;AACvB,UAAI7G,EAAM,WAAW;AACjB,QAAAA,IAAQ6G,EAAQ,WAAW6B,CAAO;AAAA,WAEjC;AACD,cAAMkjB,IAAO/kB,EAAQ,WAAW6B,CAAO;AACvC,QAAA1I,KAASkkF,GAAalkF,CAAK,IAAI4rB;AAAA,MACnC;AAEJ,WAAO5rB,EAAM,KAAI;AAAA,EACrB;AACJ;AACA,MAAM+jF,GAAa;AAAA,EACf,YAAY76E,GAAMi+C,GAASy8B,GAAQl6E,GAAO;AACtC,SAAK,OAAOR,GACZ,KAAK,UAAUi+C,GACf,KAAK,SAASy8B,GACd,KAAK,QAAQl6E;AAAA,EACjB;AAAA,EACA,WAAW;AACP,QAAIkiB,IAAO,IAAI,KAAK,IAAI;AACxB,UAAMu7B,IAAU,KAAK,QAAQ,SAAQ;AAOrC,WANI,KAAK,QAAQ,QAAQ,WAAW,IAChCv7B,IAAO,GAAGA,CAAI,IAAIu7B,CAAO,KAEpB,KAAK,QAAQ,QAAQ,SAAS,MACnCv7B,IAAO,GAAGA,CAAI;AAAA,EAAKu7B,CAAO,KAE1B,KAAK,SAEE,IAAIv7B,CAAI,MAGRA;AAAA,EAEf;AAAA,EACA,WAAWljB,GAAS;AAChB,WAAOA,GAAS,YAAY,IAAI,KAAK,KAAK,kBAAkBA,CAAO;AAAA,EACvE;AAAA,EACA,kBAAkBA,GAAS;AACvB,UAAMy+C,IAAU,KAAK,QAAQ,WAAWz+C,CAAO;AAC/C,QAAI,KAAK,QAAQ;AACb,YAAMy7E,IAAWC,GAAgB,KAAK,MAAMj9B,GAASz+C,KAAW,EAAE;AAClE,UAAI,OAAOy7E,KAAa;AACpB,eAAOA;AAAA,IAEf;AACA,QAAIE,IAAS;AACb,IAAI37E,GAAS,QAAQ,YAAYA,GAAS,QAAQ,SAC9C27E,IAAS,MAEJ37E,GAAS,QAAQ,SACtB27E,IAAS,OAEJ37E,GAAS,QAAQ,kBACtB27E,IAAS;AAEb,QAAIz4D,IAAO,GAAGy4D,CAAM,IAAI,KAAK,IAAI,GAAGA,CAAM;AAO1C,WANI,KAAK,QAAQ,QAAQ,WAAW,IAChCz4D,IAAO,GAAGA,CAAI,MAAMu7B,CAAO,KAEtB,KAAK,QAAQ,QAAQ,SAAS,MACnCv7B,IAAO,GAAGA,CAAI;AAAA,EAAKu7B,CAAO,KAE1B,KAAK,SAEE,IAAIv7B,CAAI,MAGRA;AAAA,EAEf;AACJ;AACA,SAASw4D,GAAgBE,GAAKn9B,GAASz+C,GAAS;AAC5C,MAAI47E,MAAQ,eAAeA,MAAQ,cAAcA,MAAQ,QAAQ;AAC7D,UAAM3kF,IAAQwnD,EAAQ,QAAQ,GAAG;AACjC,QAAIo9B,IAAUp9B;AACd,QAAIxnD,IAAQ,GAAG;AACX,YAAM6kF,IAAevC,GAAe96B,GAASxnD,CAAK;AAClD,MAAA4kF,IAAUp9B,EAAQ,UAAUq9B,CAAY,GACxCr9B,IAAUA,EAAQ,UAAU,GAAGxnD,CAAK;AAAA,IACxC;AACA,YAAI2kF,MAAQ,cAAeA,MAAQ,UAAU57E,EAAQ,SAAS,YAE1D67E,IAAU,KAAKA,CAAO,OAEL77E,EAAQ,aAAay+C,GAASo9B,CAAO,KAAKE,GAAkBt9B,GAASo9B,CAAO;AAAA,EAErG;AAEJ;AACA,SAASE,GAAkBt9B,GAASo9B,GAAS;AACzC,MAAI;AACA,WAAAvnC,GAAI,MAAMmK,GAAS,EAAI,GAChB,IAAIo9B,CAAO,KAAKp9B,CAAO;AAAA,EAClC,QACM;AACF,WAAOA;AAAA,EACX;AACJ;AACA,MAAMu8B,GAAc;AAAA,EAChB,YAAYvC,GAAOz3E,GAAO;AACtB,SAAK,UAAUy3E,GACf,KAAK,QAAQz3E;AAAA,EACjB;AAAA,EACA,WAAW;AACP,QAAIkiB,IAAO;AACX,aAAS9jB,IAAI,GAAGA,IAAI,KAAK,QAAQ,QAAQA,KAAK;AAC1C,YAAM87E,IAAS,KAAK,QAAQ97E,CAAC,GACvBrB,IAAO,KAAK,QAAQqB,IAAI,CAAC;AAC/B,MAAA8jB,KAAQg4D,EAAO,SAAQ,GACnBn9E,KAAQA,EAAK,MAAM,MAAM,OAAOm9E,EAAO,MAAM,MAAM,SACnDh4D,KAAQ;AAAA;AAAA,IAEhB;AACA,WAAOA;AAAA,EACX;AAAA,EACA,WAAWljB,GAAS;AAChB,QAAIkjB,IAAO;AACX,aAAS9jB,IAAI,GAAGA,IAAI,KAAK,QAAQ,QAAQA,KAAK;AAC1C,YAAM87E,IAAS,KAAK,QAAQ97E,CAAC,GACvBrB,IAAO,KAAK,QAAQqB,IAAI,CAAC;AAC/B,MAAA8jB,KAAQg4D,EAAO,WAAWl7E,CAAO,GAC7BjC,KAAQA,EAAK,MAAM,MAAM,OAAOm9E,EAAO,MAAM,MAAM,SACnDh4D,KAAQ;AAAA;AAAA,IAEhB;AACA,WAAOA;AAAA,EACX;AACJ;AACA,MAAM03D,GAAc;AAAA,EAChB,YAAY13D,GAAMliB,GAAO;AACrB,SAAK,OAAOkiB,GACZ,KAAK,QAAQliB;AAAA,EACjB;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,aAAa;AACT,WAAO,KAAK;AAAA,EAChB;AACJ;AACA,SAASw6E,GAAat4D,GAAM;AACxB,SAAIA,EAAK,SAAS;AAAA,CAAI,IACX;AAAA,IAGA;AAAA;AAAA;AAEf;AC/eO,MAAM84D,GAA2B;AAAA,EACpC,YAAY3pE,GAAU;AAClB,SAAK,eAAeA,EAAS,OAAO,UAAU,cAC9C,KAAK,kBAAkBA,EAAS,cAAc;AAAA,EAClD;AAAA,EACA,iBAAiBvV,GAAM;AACnB,UAAM22D,IAAU,KAAK,gBAAgB,WAAW32D,CAAI;AACpD,QAAI22D,KAAWslB,GAAQtlB,CAAO;AAE1B,aADoB8kB,GAAW9kB,CAAO,EACnB,WAAW;AAAA,QAC1B,YAAY,CAACwoB,GAAMJ,MACR,KAAK,0BAA0B/+E,GAAMm/E,GAAMJ,CAAO;AAAA,QAE7D,WAAW,CAACD,MACD,KAAK,yBAAyB9+E,GAAM8+E,CAAG;AAAA,MAElE,CAAa;AAAA,EAGT;AAAA,EACA,0BAA0B9+E,GAAM0D,GAAMq7E,GAAS;AAC3C,UAAM/jC,IAAc,KAAK,uBAAuBh7C,GAAM0D,CAAI,KAAK,KAAK,sBAAsB1D,GAAM0D,CAAI;AACpG,QAAIs3C,KAAeA,EAAY,aAAa;AACxC,YAAMvyB,IAAOuyB,EAAY,YAAY,MAAM,MAAM,OAAO,GAClDnD,IAAYmD,EAAY,YAAY,MAAM,MAAM,YAAY,GAC5D1C,IAAM0C,EAAY,YAAY,KAAK,EAAE,UAAU,IAAIvyB,CAAI,IAAIovB,CAAS,GAAE,CAAE;AAC9E,aAAO,IAAIknC,CAAO,KAAKzmC,EAAI,SAAQ,CAAE;AAAA,IACzC;AAEI;AAAA,EAER;AAAA,EACA,yBAAyBihB,GAAO6lB,GAAM;AAAA,EAGtC;AAAA,EACA,uBAAuBp/E,GAAM0D,GAAM;AAE/B,UAAM27E,IADWx7E,GAAY7D,CAAI,EACJ;AAC7B,QAAI,CAACq/E;AACD;AAEJ,QAAI5pB,IAAcz1D;AAClB,OAAG;AAEC,YAAMg7C,IADkBqkC,EAAY,UAAU5pB,CAAW,EACrB,KAAK,CAAA9yD,MAAKA,EAAE,SAASe,CAAI;AAC7D,UAAIs3C;AACA,eAAOA;AAEX,MAAAya,IAAcA,EAAY;AAAA,IAC9B,SAASA;AAAA,EAEb;AAAA,EACA,sBAAsBz1D,GAAM0D,GAAM;AAE9B,WADoB,KAAK,aAAa,YAAW,EAAG,KAAK,CAAAf,MAAKA,EAAE,SAASe,CAAI;AAAA,EAEjF;AACJ;ACzDO,MAAM47E,GAAuB;AAAA,EAChC,YAAY/pE,GAAU;AAClB,SAAK,gBAAgB,MAAMA,EAAS,OAAO;AAAA,EAC/C;AAAA,EACA,WAAWvV,GAAM;AACb,WAAI21D,GAAqB31D,CAAI,IAClBA,EAAK,WAEToL,GAAgBpL,EAAK,UAAU,KAAK,cAAa,EAAG,qBAAqB,GAAG;AAAA,EACvF;AACJ;ACJO,MAAMu/E,GAAmB;AAAA,EAC5B,YAAYhqE,GAAU;AAClB,SAAK,aAAaA,EAAS,OAAO;AAAA,EACtC;AAAA,EACA,MAAM6Q,GAAMo5D,GAAc;AACtB,WAAO,QAAQ,QAAQ,KAAK,WAAW,MAAMp5D,CAAI,CAAC;AAAA,EACtD;AACJ;ACbO,MAAMq5D,GAAqB;AAAA,EAC9B,cAAc;AACV,SAAK,sBAAsB,IAAIjyB,2BAAuB,GACtD,KAAK,aAAa,CAAA,GAClB,KAAK,YAAY,CAAA,GACjB,KAAK,OAAO;AAAA,EAChB;AAAA,EACA,MAAM35C,GAAQ;AACV,SAAK,YAAW;AAChB,UAAM6rE,IAAc7xB,GAAwB;AAC5C,gBAAK,sBAAsB6xB,GACpB,KAAK,QAAQ,KAAK,YAAY7rE,GAAQ6rE,EAAY,KAAK;AAAA,EAClE;AAAA,EACA,KAAK7rE,GAAQ;AACT,WAAO,KAAK,QAAQ,KAAK,WAAWA,CAAM;AAAA,EAC9C;AAAA,EACA,QAAQixD,GAAOjxD,GAAQq9C,IAAoB7D,GAAAA,kBAAkB,MAAM;AAC/D,UAAMsyB,IAAW,IAAIzxB,GAAQ,GACvBnc,IAAQ;AAAA,MACV,QAAAl+B;AAAA,MACA,UAAA8rE;AAAA,MACA,mBAAAzuB;AAAA,IACZ;AACQ,WAAA4T,EAAM,KAAK/yB,CAAK,GAChB,KAAK,qBAAoB,GAClB4tC,EAAS;AAAA,EACpB;AAAA,EACA,MAAM,uBAAuB;AACzB,QAAI,CAAC,KAAK;AACN;AAEJ,UAAMC,IAAU,CAAA;AAChB,QAAI,KAAK,WAAW,SAAS;AAEzB,MAAAA,EAAQ,KAAK,KAAK,WAAW,MAAK,CAAE;AAAA,aAE/B,KAAK,UAAU,SAAS;AAE7B,MAAAA,EAAQ,KAAK,GAAG,KAAK,UAAU,OAAO,GAAG,KAAK,UAAU,MAAM,CAAC;AAAA;AAG/D;AAEJ,SAAK,OAAO,IACZ,MAAM,QAAQ,IAAIA,EAAQ,IAAI,OAAO,EAAE,QAAA/rE,GAAQ,UAAA8rE,GAAU,mBAAAzuB,QAAwB;AAC7E,UAAI;AAEA,cAAM72D,IAAS,MAAM,QAAQ,QAAO,EAAG,KAAK,MAAMwZ,EAAOq9C,CAAiB,CAAC;AAC3E,QAAAyuB,EAAS,QAAQtlF,CAAM;AAAA,MAC3B,SACO2zD,GAAK;AACR,QAAID,GAAqBC,CAAG,IAExB2xB,EAAS,QAAQ,MAAS,IAG1BA,EAAS,OAAO3xB,CAAG;AAAA,MAE3B;AAAA,IACJ,CAAC,CAAC,GACF,KAAK,OAAO,IACZ,KAAK,qBAAoB;AAAA,EAC7B;AAAA,EACA,cAAc;AACV,SAAK,oBAAoB,OAAM;AAAA,EACnC;AACJ;AC9DO,MAAM6xB,GAAgB;AAAA,EACzB,YAAYtqE,GAAU;AAClB,SAAK,sBAAsB,IAAIo+C,GAAK,GACpC,KAAK,iBAAiB,IAAIA,GAAK,GAC/B,KAAK,UAAUp+C,EAAS,SACxB,KAAK,QAAQA,EAAS,OAAO,OAC7B,KAAK,SAASA,EAAS,WAAW;AAAA,EACtC;AAAA,EACA,UAAUlb,GAAQ;AACd,WAAO;AAAA,MACH,aAAaA,EAAO;AAAA,MACpB,aAAaA,EAAO,cAAc,KAAK,qBAAqBA,EAAO,WAAW,IAAI;AAAA;AAAA;AAAA,MAGlF,cAAcA,EAAO,aAAa,IAAI,CAAAsI,OAAM,EAAE,GAAGA,GAAG,SAASA,EAAE,QAAO,EAAG;AAAA,MACzE,OAAO,KAAK,iBAAiBtI,EAAO,OAAO,KAAK,wBAAwBA,EAAO,KAAK,CAAC;AAAA,IACjG;AAAA,EACI;AAAA,EACA,qBAAqBylF,GAAa;AAE9B,WAAOA;AAAA,EACX;AAAA,EACA,wBAAwB9/E,GAAM;AAC1B,UAAMkzD,IAAW,oBAAI,IAAG,GAClBC,IAAW,oBAAI,IAAG;AACxB,eAAW5uD,KAAWD,GAAUtE,CAAI;AAChC,MAAAkzD,EAAS,IAAI3uD,GAAS,EAAE;AAE5B,QAAIvE,EAAK;AACL,iBAAWqL,KAAWf,GAAUtK,EAAK,QAAQ;AACzC,QAAAmzD,EAAS,IAAI9nD,GAAS,EAAE;AAGhC,WAAO;AAAA,MACH,UAAA6nD;AAAA,MACA,UAAAC;AAAA,IACZ;AAAA,EACI;AAAA,EACA,iBAAiBnzD,GAAMssD,GAAS;AAC5B,UAAMhtD,IAAMgtD,EAAQ,SAAS,IAAItsD,CAAI;AACrC,IAAAV,EAAI,QAAQU,EAAK,OACjBV,EAAI,kBAAkBU,EAAK,iBAC3BV,EAAI,qBAAqBU,EAAK,oBAC1BA,EAAK,aAAa,WAClBV,EAAI,WAAW,KAAK,iBAAiBU,EAAK,UAAUssD,CAAO;AAE/D,eAAW,CAAC5oD,GAAMlJ,CAAK,KAAK,OAAO,QAAQwF,CAAI;AAC3C,UAAI,CAAA0D,EAAK,WAAW,GAAG;AAGvB,YAAI,MAAM,QAAQlJ,CAAK,GAAG;AACtB,gBAAMulF,IAAM,CAAA;AACZ,UAAAzgF,EAAIoE,CAAI,IAAIq8E;AACZ,qBAAWr9E,KAAQlI;AACf,YAAI6E,GAAUqD,CAAI,IACdq9E,EAAI,KAAK,KAAK,iBAAiBr9E,GAAM4pD,CAAO,CAAC,IAExC/sD,GAAYmD,CAAI,IACrBq9E,EAAI,KAAK,KAAK,mBAAmBr9E,GAAM4pD,CAAO,CAAC,IAG/CyzB,EAAI,KAAKr9E,CAAI;AAAA,QAGzB,MACK,CAAIrD,GAAU7E,CAAK,IACpB8E,EAAIoE,CAAI,IAAI,KAAK,iBAAiBlJ,GAAO8xD,CAAO,IAE3C/sD,GAAY/E,CAAK,IACtB8E,EAAIoE,CAAI,IAAI,KAAK,mBAAmBlJ,GAAO8xD,CAAO,IAE7C9xD,MAAU,WACf8E,EAAIoE,CAAI,IAAIlJ;AAGpB,WAAO8E;AAAA,EACX;AAAA,EACA,mBAAmB0E,GAAWsoD,GAAS;AACnC,UAAMhtD,IAAM,CAAA;AACZ,WAAAA,EAAI,WAAW0E,EAAU,UACrBA,EAAU,aACV1E,EAAI,WAAWgtD,EAAQ,SAAS,IAAItoD,EAAU,QAAQ,IAEnD1E;AAAA,EACX;AAAA,EACA,iBAAiBU,GAAMssD,GAAS;AAC5B,UAAMjhD,IAAUihD,EAAQ,SAAS,IAAItsD,CAAI;AACzC,WAAIW,GAAcX,CAAI,IAClBqL,EAAQ,WAAWrL,EAAK,WAIxBqL,EAAQ,gBAAgB,KAAK,oBAAoBrL,EAAK,aAAa,GAEvEqL,EAAQ,SAASrL,EAAK,QACtBqL,EAAQ,UAAUihD,EAAQ,SAAS,IAAItsD,EAAK,OAAO,GAC/CS,GAAmBT,CAAI,IACvBqL,EAAQ,UAAUrL,EAAK,QAAQ,IAAI,CAAAwK,MAAS,KAAK,iBAAiBA,GAAO8hD,CAAO,CAAC,IAE5E5rD,GAAcV,CAAI,MACvBqL,EAAQ,YAAYrL,EAAK,UAAU,MACnCqL,EAAQ,SAASrL,EAAK,QACtBqL,EAAQ,SAASrL,EAAK,QACtBqL,EAAQ,YAAYrL,EAAK,MAAM,MAAM,MACrCqL,EAAQ,cAAcrL,EAAK,MAAM,MAAM,WACvCqL,EAAQ,UAAUrL,EAAK,MAAM,IAAI,MACjCqL,EAAQ,YAAYrL,EAAK,MAAM,IAAI,YAEhCqL;AAAA,EACX;AAAA,EACA,QAAQhR,GAAQ;AACZ,UAAM2F,IAAO3F,EAAO,OACdiyD,IAAU,KAAK,uBAAuBtsD,CAAI;AAChD,WAAI,cAAcA,KACd,KAAK,eAAeA,EAAK,UAAUssD,CAAO,GAEvC;AAAA,MACH,aAAajyD,EAAO;AAAA,MACpB,aAAaA,EAAO;AAAA,MACpB,cAAcA,EAAO;AAAA,MACrB,OAAO,KAAK,eAAe2F,GAAMssD,CAAO;AAAA,IACpD;AAAA,EACI;AAAA,EACA,uBAAuBtsD,GAAM;AACzB,UAAMkzD,IAAW,oBAAI,IAAG,GAClBC,IAAW,oBAAI,IAAG;AACxB,eAAW5uD,KAAWD,GAAUtE,CAAI;AAChC,MAAAkzD,EAAS,IAAI3uD,GAAS,EAAE;AAE5B,QAAIvB;AACJ,QAAIhD,EAAK;AACL,iBAAWqL,KAAWf,GAAUtK,EAAK,QAAQ,GAAG;AAC5C,YAAI6pC;AACJ,QAAI,cAAcx+B,KACdw+B,IAAM,IAAI4Z,GAAgBp4C,EAAQ,QAAQ,GAC1CrI,IAAO6mC,KAEF,aAAax+B,IAClBw+B,IAAM,IAAI+Z,GAAoB,IAEzB,eAAev4C,MACpBw+B,IAAM,KAAK,mBAAmBx+B,CAAO,IAErCw+B,MACAspB,EAAS,IAAI9nD,GAASw+B,CAAG,GACzBA,EAAI,OAAO7mC;AAAA,MAEnB;AAEJ,WAAO;AAAA,MACH,UAAAkwD;AAAA,MACA,UAAAC;AAAA,IACZ;AAAA,EACI;AAAA,EACA,eAAenzD,GAAMssD,GAAS;AAC1B,UAAM/nD,IAAU+nD,EAAQ,SAAS,IAAItsD,CAAI;AACzC,IAAAuE,EAAQ,QAAQvE,EAAK,OACrBuE,EAAQ,kBAAkBvE,EAAK,iBAC/BuE,EAAQ,qBAAqBvE,EAAK,oBAC9BA,EAAK,aACLuE,EAAQ,WAAW+nD,EAAQ,SAAS,IAAItsD,EAAK,QAAQ;AAEzD,eAAW,CAAC0D,GAAMlJ,CAAK,KAAK,OAAO,QAAQwF,CAAI;AAC3C,UAAI,CAAA0D,EAAK,WAAW,GAAG;AAGvB,YAAI,MAAM,QAAQlJ,CAAK,GAAG;AACtB,gBAAMulF,IAAM,CAAA;AACZ,UAAAx7E,EAAQb,CAAI,IAAIq8E;AAChB,qBAAWr9E,KAAQlI;AACf,YAAI6E,GAAUqD,CAAI,IACdq9E,EAAI,KAAK,KAAK,UAAU,KAAK,eAAer9E,GAAM4pD,CAAO,GAAG/nD,CAAO,CAAC,IAE/DhF,GAAYmD,CAAI,IACrBq9E,EAAI,KAAK,KAAK,iBAAiBr9E,GAAM6B,GAASb,GAAM4oD,CAAO,CAAC,IAG5DyzB,EAAI,KAAKr9E,CAAI;AAAA,QAGzB,MACK,CAAIrD,GAAU7E,CAAK,IACpB+J,EAAQb,CAAI,IAAI,KAAK,UAAU,KAAK,eAAelJ,GAAO8xD,CAAO,GAAG/nD,CAAO,IAEtEhF,GAAY/E,CAAK,IACtB+J,EAAQb,CAAI,IAAI,KAAK,iBAAiBlJ,GAAO+J,GAASb,GAAM4oD,CAAO,IAE9D9xD,MAAU,WACf+J,EAAQb,CAAI,IAAIlJ;AAGxB,WAAO+J;AAAA,EACX;AAAA,EACA,UAAUvE,GAAMyK,GAAQ;AACpB,WAAAzK,EAAK,aAAayK,GACXzK;AAAA,EACX;AAAA,EACA,iBAAiBgE,GAAWhE,GAAM0D,GAAM4oD,GAAS;AAC7C,WAAO,KAAK,OAAO,eAAetsD,GAAM0D,GAAM4oD,EAAQ,SAAS,IAAItoD,EAAU,QAAQ,GAAGA,EAAU,QAAQ;AAAA,EAC9G;AAAA,EACA,eAAeqH,GAASihD,GAAS0zB,IAAM,GAAG;AACtC,UAAMC,IAAa3zB,EAAQ,SAAS,IAAIjhD,CAAO;AAK/C,QAJI,OAAOA,EAAQ,iBAAkB,aACjC40E,EAAW,gBAAgB,KAAK,kBAAkB50E,EAAQ,aAAa,IAE3E40E,EAAW,UAAU3zB,EAAQ,SAAS,IAAIjhD,EAAQ,OAAO,GACrD5K,GAAmBw/E,CAAU;AAC7B,iBAAWz1E,KAASa,EAAQ,SAAS;AACjC,cAAM60E,IAAW,KAAK,eAAe11E,GAAO8hD,GAAS0zB,GAAK;AAC1D,QAAAC,EAAW,QAAQ,KAAKC,CAAQ;AAAA,MACpC;AAEJ,WAAOD;AAAA,EACX;AAAA,EACA,mBAAmB50E,GAAS;AACxB,UAAM6a,IAAY,KAAK,aAAa7a,EAAQ,SAAS,GAC/CR,IAASQ,EAAQ,QACjBjR,IAASiR,EAAQ,QACjBgiB,IAAYhiB,EAAQ,WACpBiiB,IAAcjiB,EAAQ,aACtBkjB,IAAUljB,EAAQ,SAClBmjB,IAAYnjB,EAAQ,WACpBM,IAASN,EAAQ;AAWvB,WAVa,IAAIy4C,GAAgBj5C,GAAQzQ,GAAQ;AAAA,MAC7C,OAAO;AAAA,QACH,MAAMizB;AAAA,QACN,WAAWC;AAAA,MAC3B;AAAA,MACY,KAAK;AAAA,QACD,MAAMiB;AAAA,QACN,WAAWC;AAAA,MAC3B;AAAA,IACA,GAAWtI,GAAWva,CAAM;AAAA,EAExB;AAAA,EACA,aAAajI,GAAM;AACf,WAAO,KAAK,MAAM,WAAWA,CAAI;AAAA,EACrC;AAAA,EACA,oBAAoB1D,GAAM;AACtB,QAAKA;AAGL,aAAI,KAAK,oBAAoB,SAAS,KAClC,KAAK,0BAAyB,GAE3B,KAAK,oBAAoB,IAAIA,CAAI;AAAA,EAC5C;AAAA,EACA,kBAAkBk8C,GAAI;AAClB,WAAI,KAAK,oBAAoB,SAAS,KAClC,KAAK,0BAAyB,GAElB,KAAK,oBAAoB,OAAOA,CAAE;AAAA,EAEtD;AAAA,EACA,4BAA4B;AACxB,QAAIA,IAAK;AACT,eAAW76C,KAAWiD,GAAU,KAAK,OAAO;AACxC,MAAIY,GAAkB7D,CAAO,KACzB,KAAK,oBAAoB,IAAIA,GAAS66C,GAAI;AAAA,EAGtD;AACJ;AC5OO,SAASikC,GAAwB7zB,GAAS;AAC7C,SAAO;AAAA,IACH,eAAe;AAAA,MACX,iBAAiB,CAAC/2C,MAAa,IAAI+pE,GAAuB/pE,CAAQ;AAAA,MAClE,uBAAuB,CAACA,MAAa,IAAI2pE,GAA2B3pE,CAAQ;AAAA,IACxF;AAAA,IACQ,QAAQ;AAAA,MACJ,aAAa,CAACA,MAAa,IAAIgqE,GAAmBhqE,CAAQ;AAAA,MAC1D,eAAe,CAACA,MAAaD,GAAoBC,CAAQ;AAAA,MACzD,eAAe,CAACA,MAAa+0C,GAAoB/0C,CAAQ;AAAA,MACzD,kBAAkB,CAACA,MAAa60C,GAAuB70C,CAAQ;AAAA,MAC/D,gBAAgB,MAAM,IAAIw1C,GAAqB;AAAA,MAC/C,cAAc,MAAM,IAAIP,GAAmB;AAAA,MAC3C,OAAO,CAACj1C,MAAa,IAAIylE,GAAazlE,CAAQ;AAAA,MAC9C,4BAA4B,MAAM,IAAIsxC,GAAiC;AAAA,MACvE,2BAA2B,MAAM,IAAIi0B,GAAgC;AAAA,IACjF;AAAA,IACQ,WAAW;AAAA,MACP,gBAAgB,MAAM,IAAI5gB,GAAqB;AAAA,MAC/C,4BAA4B,CAAC3kD,MAAa,IAAImkD,GAAkCnkD,CAAQ;AAAA,MACxF,8BAA8B,CAACA,MAAa,IAAIskD,GAAoCtkD,CAAQ;AAAA,IACxG;AAAA,IACQ,YAAY;AAAA,MACR,QAAQ,CAACA,MAAa,IAAIw8C,GAAcx8C,CAAQ;AAAA,MAChD,cAAc,MAAM,IAAIo9C,GAAmB;AAAA,MAC3C,eAAe,CAACp9C,MAAa,IAAI+/C,GAAqB//C,CAAQ;AAAA,MAC9D,kBAAkB,CAACA,MAAa,IAAIq+C,GAAwBr+C,CAAQ;AAAA,MACpE,YAAY,CAACA,MAAa,IAAIq9C,GAAkBr9C,CAAQ;AAAA,IACpE;AAAA,IACQ,YAAY;AAAA,MACR,UAAU,CAACA,MAAa,IAAIsqE,GAAgBtqE,CAAQ;AAAA,MACpD,gBAAgB,CAACA,MAAa,IAAIsgD,GAAsBtgD,CAAQ;AAAA,IAC5E;AAAA,IACQ,YAAY;AAAA,MACR,mBAAmB,CAACA,MAAa,IAAIkjD,GAAyBljD,CAAQ;AAAA,MACtE,oBAAoB,CAACA,MAAa,IAAIqiD,GAAmBriD,CAAQ;AAAA,IAC7E;AAAA,IACQ,QAAQ,MAAM+2C,EAAQ;AAAA,EAC9B;AACA;AAKO,SAAS8zB,GAA8B9zB,GAAS;AACnD,SAAO;AAAA,IACH,iBAAiB,CAAC/2C,MAAa,IAAIgiD,GAAuBhiD,CAAQ;AAAA,IAClE,WAAW;AAAA,MACP,kBAAkB,CAACA,MAAa,IAAIm8C,GAAwBn8C,CAAQ;AAAA,MACpE,wBAAwB,CAACA,MAAa,IAAI07C,GAA8B17C,CAAQ;AAAA,MAChF,iBAAiB,CAACA,MAAa,IAAIyiE,GAAuBziE,CAAQ;AAAA,MAClE,cAAc,CAACA,MAAa,IAAIokE,GAAoBpkE,CAAQ;AAAA,MAC5D,kBAAkB,CAACA,MAAa,IAAI6kE,GAAwB7kE,CAAQ;AAAA,MACpE,oBAAoB,CAACA,MAAa+2C,EAAQ,mBAAmB/2C,CAAQ;AAAA,MACrE,eAAe,MAAM,IAAIkqE,GAAoB;AAAA,MAC7C,uBAAuB,CAAClqE,MAAa,IAAImlD,GAA6BnlD,CAAQ;AAAA,IAC1F;AAAA,IACQ,WAAW,CAAA;AAAA,EACnB;AACA;AC3FO,IAAI8qE;AAAA,CACV,SAAUA,GAAQ;AAWf,EAAAA,EAAO,QAAQ,CAACC,GAAIC,MAAOC,GAAOA,GAAO,CAAA,GAAIF,CAAE,GAAGC,CAAE;AACxD,GAAGF,OAAWA,KAAS,CAAA,EAAG;AAuBnB,SAASI,GAAOC,GAASC,GAASC,GAASC,GAASC,GAASC,GAASC,GAASC,GAASC,GAAS;AACpG,QAAMC,IAAS,CAACT,GAASC,GAASC,GAASC,GAASC,GAASC,GAASC,GAASC,GAASC,CAAO,EAAE,OAAOV,IAAQ,CAAA,CAAE;AAClH,SAAOY,GAAQD,CAAM;AACzB;AACA,MAAME,KAAU,uBAAO,SAAS;AAiBhC,SAASD,GAAQD,GAAQG,GAAU;AAC/B,QAAMC,IAAQ,IAAI,MAAM,IAAI;AAAA,IACxB,gBAAgB,MAAM;AAAA,IACtB,KAAK,MAAM;AACP,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACvE;AAAA,IACA,KAAK,CAACjiF,GAAKb,MACHA,MAAS4iF,KACF,KAGAG,GAASliF,GAAKb,GAAM0iF,GAAQG,KAAYC,CAAK;AAAA,IAG5D,0BAA0B,CAACjiF,GAAKb,OAAU+iF,GAASliF,GAAKb,GAAM0iF,GAAQG,KAAYC,CAAK,GAAG,OAAO,yBAAyBjiF,GAAKb,CAAI;AAAA;AAAA,IACnI,KAAK,CAACsN,GAAGtN,MAASA,KAAQ0iF;AAAA;AAAA,IAC1B,SAAS,MAAM,CAAC,GAAG,OAAO,oBAAoBA,CAAM,CAAC;AAAA;AAAA,EAC7D,CAAK;AACD,SAAOI;AACX;AAKA,MAAME,KAAgB,uBAAM;AAa5B,SAASD,GAASliF,GAAKb,GAAM0iF,GAAQG,GAAU;AAC3C,MAAI7iF,KAAQa,GAAK;AACb,QAAIA,EAAIb,CAAI,aAAa;AACrB,YAAM,IAAI,MAAM,6FAA6Fa,EAAIb,CAAI,CAAC;AAE1H,QAAIa,EAAIb,CAAI,MAAMgjF;AACd,YAAM,IAAI,MAAM,kCAAkC,OAAOhjF,CAAI,IAAI,wGAAwG;AAE7K,WAAOa,EAAIb,CAAI;AAAA,EACnB,WACSA,KAAQ0iF,GAAQ;AACrB,UAAM3mF,IAAQ2mF,EAAO1iF,CAAI;AACzB,IAAAa,EAAIb,CAAI,IAAIgjF;AACZ,QAAI;AACA,MAAAniF,EAAIb,CAAI,IAAK,OAAOjE,KAAU,aAAcA,EAAM8mF,CAAQ,IAAIF,GAAQ5mF,GAAO8mF,CAAQ;AAAA,IACzF,SACO33D,GAAO;AACV,YAAArqB,EAAIb,CAAI,IAAIkrB,aAAiB,QAAQA,IAAQ,QACvCA;AAAA,IACV;AACA,WAAOrqB,EAAIb,CAAI;AAAA,EACnB;AAEI;AAER;AAQA,SAAS+hF,GAAO3wC,GAAQr2C,GAAQ;AAC5B,MAAIA;AACA,eAAW,CAACK,GAAK6nF,CAAW,KAAK,OAAO,QAAQloF,CAAM;AAClD,UAAiCkoF,KAAgB;AAC7C,YAAI,OAAOA,KAAgB,UAAU;AACjC,gBAAMC,IAAc9xC,EAAOh2C,CAAG;AAC9B,UAAI,OAAO8nF,KAAgB,YAAYA,MAAgB,OAEnD9xC,EAAOh2C,CAAG,IAAI2mF,GAAOmB,GAAaD,CAAW,IAO7C7xC,EAAOh2C,CAAG,IAAI2mF,GAAO,CAAA,GAAIkB,CAAW;AAAA,QAE5C;AAII,UAAA7xC,EAAOh2C,CAAG,IAAI6nF;AAAA;AAQ9B,SAAO7xC;AACX;AC7JO,MAAM+xC,GAAwB;AAAA,EACjC,KAAKC,GAAM;AACP,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAClD;AAAA,EACA,SAASA,GAAM;AACX,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAClD;AAAA,EACA,MAAM,SAAS;AACX,WAAO;AAAA,EACX;AAAA,EACA,aAAa;AACT,WAAO;AAAA,EACX;AAAA,EACA,aAAa;AACT,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAClD;AAAA,EACA,iBAAiB;AACb,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAClD;AAAA,EACA,WAAW;AACP,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAClD;AAAA,EACA,eAAe;AACX,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAClD;AAAA,EACA,MAAM,gBAAgB;AAClB,WAAO,CAAA;AAAA,EACX;AAAA,EACA,oBAAoB;AAChB,WAAO,CAAA;AAAA,EACX;AACJ;AACO,MAAMC,KAAkB;AAAA,EAC3B,oBAAoB,MAAM,IAAIF,GAAuB;AACzD,GC7BMG,KAAuB;AAAA,EACzB,SAAS,MAAA;AAAA;AAAA,EACT,kBAAkB,OAAO;AAAA,IACrB,iBAAiB;AAAA,IACjB,gBAAgB,CAAC,UAAU;AAAA,IAC3B,YAAY;AAAA,EACpB;AACA,GACMC,KAA6B;AAAA,EAC/B,eAAe,MAAM,IAAIC,GAA+B;AAC5D;AACA,SAASC,KAA+B;AACpC,QAAMC,IAAS1B,GAAOL,GAA8B0B,EAAe,GAAGE,EAA0B,GAC1F7xE,IAAUswE,GAAON,GAAwB,EAAE,QAAAgC,EAAM,CAAE,GAAGJ,EAAoB;AAChF,SAAAI,EAAO,gBAAgB,SAAShyE,CAAO,GAChCA;AACX;AAKO,SAASiyE,GAAoBC,GAAM;AACtC,QAAM9sE,IAAW2sE,GAA4B,GACvC39E,IAAUgR,EAAS,WAAW,eAAe,YAAY8sE,CAAI;AACnE,SAAA9sE,EAAS,OAAO,UAAU,uBAAuB,UAAUhR,GAASizC,GAAI,MAAM,WAAWjzC,EAAQ,QAAQ,SAAS,UAAU,CAAC,GACtHA;AACX;ACpCA,IAAI+9E,KAAY,OAAO,gBACnBC,IAAS,CAAC1yC,GAAQr1C,MAAU8nF,GAAUzyC,GAAQ,QAAQ,EAAE,OAAAr1C,GAAO,cAAc,IAAM,GAInFgoF;AAAA,CACH,CAACC,MAAyB;AACzB,EAAAA,EAAqB,YAAY;AAAA,IAC/B,iBAAiB;AAAA,IACjB,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,IAAI;AAAA,IACJ,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,WAAW;AAAA,IACX,qBAAqB;AAAA,IACrB,WAAW;AAAA,IACX,YAAY;AAAA,EAChB;AACA,GAAGD,OAAwBA,KAAsB,CAAA,EAAG;AACpD,IAAIE;AAAA,CACH,CAACC,MAAqB;AACrB,EAAAA,EAAiB,YAAY;AAAA,IAC3B,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,WAAW;AAAA,IACX,qBAAqB;AAAA,IACrB,WAAW;AAAA,EACf;AACA,GAAGD,OAAoBA,KAAkB,CAAA,EAAG;AAC5C,IAAIE;AAAA,CACH,CAACC,MAAiB;AACjB,EAAAA,EAAa,YAAY;AAAA,IACvB,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,WAAW;AAAA,IACX,qBAAqB;AAAA,EACzB;AACA,GAAGD,OAAgBA,KAAc,CAAA,EAAG;AACpC,IAAIE;AAAA,CACH,CAACC,MAAmB;AACnB,EAAAA,EAAe,YAAY;AAAA,IACzB,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,WAAW;AAAA,IACX,qBAAqB;AAAA,EACzB;AACA,GAAGD,OAAkBA,KAAgB,CAAA,EAAG;AACxC,IAAIE;AAAA,CACH,CAACC,MAAgB;AAChB,EAAAA,EAAY,YAAY;AAAA,IACtB,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,WAAW;AAAA,IACX,qBAAqB;AAAA,EACzB;AACA,GAAGD,OAAeA,KAAa,CAAA,EAAG;AAClC,IAAIE;AAAA,CACH,CAACC,MAAkB;AAClB,EAAAA,EAAc,YAAY;AAAA,IACxB,WAAW;AAAA,IACX,SAAS;AAAA,IACT,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,IAAI;AAAA,IACJ,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,WAAW;AAAA,IACX,qBAAqB;AAAA,EACzB;AACA,GAAGD,OAAiBA,KAAe,CAAA,EAAG;AACtC,IAAIE;AAAA,CACH,CAACC,MAAoB;AACpB,EAAAA,EAAgB,YAAY;AAAA,IAC1B,WAAW;AAAA,IACX,WAAW;AAAA,IACX,OAAO;AAAA,IACP,iBAAiB;AAAA,IACjB,WAAW;AAAA,IACX,iBAAiB;AAAA,IACjB,WAAW;AAAA,IACX,OAAO;AAAA,IACP,aAAa;AAAA,IACb,IAAI;AAAA,IACJ,YAAY;AAAA,IACZ,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,EACb;AACA,GAAGD,OAAmBA,KAAiB,CAAA,EAAG;AAAA,CACnB;AAAA,EACrB,GAAGZ,GAAoB;AAAA,EACvB,GAAGE,GAAgB;AAAA,EACnB,GAAGE,GAAY;AAAA,EACf,GAAGE,GAAc;AAAA,EACjB,GAAGE,GAAW;AAAA,EACd,GAAGE,GAAa;AAAA,EAChB,GAAGE,GAAe;AACpB;AACA,IAAIE,KAAe;AAAA,EACjB,OAAO;AAAA,EACP,UAAU;AAAA,EACV,UAAU;AAAA,EACV,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,UAAU;AAAA,EACV,OAAO;AACT;AACA,SAASC,GAAe7gF,GAAM;AAC5B,SAAOkC,GAAW,WAAWlC,GAAM4gF,GAAa,KAAK;AACvD;AACAf,EAAOgB,IAAgB,gBAAgB;AACvC,IAAIC,KAAO;AAAA,EACT,OAAO;AAAA,EACP,OAAO;AAAA,EACP,MAAM;AACR,GACIC,KAAS;AAAA,EACX,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AACT;AACA,SAASC,GAAShhF,GAAM;AACtB,SAAOkC,GAAW,WAAWlC,GAAM+gF,GAAO,KAAK;AACjD;AACAlB,EAAOmB,IAAU,UAAU;AAC3B,IAAIC,KAAW;AAAA,EACb,OAAO;AAAA,EACP,QAAQ;AACV,GACIC,KAAgB;AAAA,EAClB,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,QAAQ;AAAA,EACR,MAAM;AACR,GACIC,KAAoB;AAAA,EACtB,OAAO;AAAA,EACP,WAAW;AAAA,EACX,WAAW;AACb,GACIC,KAAS;AAAA,EACX,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,SAAS;AAAA,EACT,MAAM;AAAA,EACN,MAAM;AACR;AACA,SAASC,GAASrhF,GAAM;AACtB,SAAOkC,GAAW,WAAWlC,GAAMohF,GAAO,KAAK;AACjD;AACAvB,EAAOwB,IAAU,UAAU;AAC3B,IAAIC,KAAQ;AAAA,EACV,OAAO;AAAA,EACP,SAAS;AAAA,EACT,OAAO;AAAA,EACP,MAAM;AACR,GACIC,KAAY;AAAA,EACd,OAAO;AAAA,EACP,UAAU;AAAA,EACV,UAAU;AAAA,EACV,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,OAAO;AACT,GACIC,KAAO;AAAA,EACT,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,OAAO;AAAA,EACP,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,OAAO;AAAA,EACP,SAAS;AAAA,EACT,OAAO;AACT,GACIC,KAAQ;AAAA,EACV,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AACT,GACIC,KAAW;AAAA,EACb,OAAO;AAAA,EACP,UAAU;AAAA,EACV,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,OAAO;AACT;AACA,SAASC,GAAW3hF,GAAM;AACxB,SAAOkC,GAAW,WAAWlC,GAAM0hF,GAAS,KAAK;AACnD;AACA7B,EAAO8B,IAAY,YAAY;AAC/B,IAAIv9E,KAAQ;AAAA,EACV,OAAO;AAAA,EACP,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,OAAO;AACT,GACIw9E,KAAO;AAAA,EACT,OAAO;AAAA,EACP,UAAU;AAAA,EACV,UAAU;AAAA,EACV,OAAO;AACT;AACA,SAASC,GAAO7hF,GAAM;AACpB,SAAOkC,GAAW,WAAWlC,GAAM4hF,GAAK,KAAK;AAC/C;AACA/B,EAAOgC,IAAQ,QAAQ;AACvB,IAAIC,KAAO;AAAA,EACT,OAAO;AAAA,EACP,eAAe;AAAA,EACf,MAAM;AACR,GACIC,KAAW;AAAA,EACb,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,IAAI;AACN,GACIC,KAAO;AAAA,EACT,OAAO;AAAA,EACP,eAAe;AAAA,EACf,MAAM;AAAA,EACN,OAAO;AACT,GACIC,KAAQ;AAAA,EACV,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AACR;AACA,SAASC,GAAQliF,GAAM;AACrB,SAAOkC,GAAW,WAAWlC,GAAMiiF,GAAM,KAAK;AAChD;AACApC,EAAOqC,IAAS,SAAS;AACzB,IAAIntE,KAAS;AAAA,EACX,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AACT,GACIotE,KAAS;AAAA,EACX,OAAO;AAAA,EACP,UAAU;AAAA,EACV,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,OAAO;AACT;AACA,SAASC,GAASpiF,GAAM;AACtB,SAAOkC,GAAW,WAAWlC,GAAMmiF,GAAO,KAAK;AACjD;AACAtC,EAAOuC,IAAU,UAAU;AAC3B,IAAIC,KAAc;AAAA,EAChB,OAAO;AAAA,EACP,MAAM;AAAA,EACN,KAAK;AAAA,EACL,OAAO;AAAA,EACP,OAAO;AACT;AACA,SAASC,GAActiF,GAAM;AAC3B,SAAOkC,GAAW,WAAWlC,GAAMqiF,GAAY,KAAK;AACtD;AACAxC,EAAOyC,IAAe,eAAe;AACrC,IAAIC,KAAM;AAAA,EACR,OAAO;AAAA,EACP,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,OAAO;AACT;AACA,SAASC,GAAMxiF,GAAM;AACnB,SAAOkC,GAAW,WAAWlC,GAAMuiF,GAAI,KAAK;AAC9C;AACA1C,EAAO2C,IAAO,OAAO;AACrB,IAAIC,KAAa;AAAA,EACf,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AACT;AACA,SAASC,GAAa1iF,GAAM;AAC1B,SAAOkC,GAAW,WAAWlC,GAAMyiF,GAAW,KAAK;AACrD;AACA5C,EAAO6C,IAAc,cAAc;AACnC,IAAIC,KAAQ;AAAA,EACV,OAAO;AAAA,EACP,UAAU;AAAA,EACV,UAAU;AAAA,EACV,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,OAAO;AACT,GACIC,KAAU;AAAA,EACZ,OAAO;AAAA,EACP,eAAe;AAAA,EACf,MAAM;AACR,GACIC,KAAU;AAAA,EACZ,OAAO;AAAA,EACP,MAAM;AAAA,EACN,UAAU;AAAA,EACV,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,OAAO;AACT,GACIC,KAAY;AAAA,EACd,OAAO;AACT,GACIC,KAAU;AAAA,EACZ,OAAO;AAAA,EACP,UAAU;AAAA,EACV,UAAU;AAAA,EACV,OAAO;AAAA,EACP,aAAa;AACf;AACA,SAASC,GAAUhjF,GAAM;AACvB,SAAOkC,GAAW,WAAWlC,GAAM+iF,GAAQ,KAAK;AAClD;AACAlD,EAAOmD,IAAW,WAAW;AAC7B,IAAIC,KAAa;AAAA,EACf,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,MAAM;AACR,OACIC,MAAuBvhD,KAAA,cAAch6B,GAA8B;AAAA,EACrE,cAAc;AACZ,UAAM,GAAG,SAAS,GAClB,KAAK,QAAQ;AAAA,MACX,cAAc;AAAA,QACZ,MAAMi5E,GAAa;AAAA,QACnB,YAAY;AAAA,UACV,UAAU;AAAA,YACR,MAAMA,GAAa;AAAA,UAC/B;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAa;AAAA,UAC/B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAa;AAAA,YACnB,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,QAAQ;AAAA,YACN,MAAMA,GAAa;AAAA,YACnB,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,WAAW;AAAA,YACT,MAAMA,GAAa;AAAA,YACnB,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAa;AAAA,YACnB,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAa;AAAA,UAC/B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,MAAM;AAAA,QACJ,MAAME,GAAK;AAAA,QACX,YAAY;AAAA,UACV,OAAO;AAAA,YACL,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAK;AAAA,UACvB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,QAAQ;AAAA,QACN,MAAMC,GAAO;AAAA,QACb,YAAY;AAAA,UACV,MAAM;AAAA,YACJ,MAAMA,GAAO;AAAA,UACzB;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAO;AAAA,UACzB;AAAA,QACA;AAAA,QACQ,YAAY,CAAC+B,GAAU,KAAK;AAAA,MACpC;AAAA,MACM,UAAU;AAAA,QACR,MAAM7B,GAAS;AAAA,QACf,YAAY;AAAA,UACV,QAAQ;AAAA,YACN,MAAMA,GAAS;AAAA,UAC3B;AAAA,QACA;AAAA,QACQ,YAAY,CAAC6B,GAAU,KAAK;AAAA,MACpC;AAAA,MACM,eAAe;AAAA,QACb,MAAM5B,GAAc;AAAA,QACpB,YAAY;AAAA,UACV,IAAI;AAAA,YACF,MAAMA,GAAc;AAAA,UAChC;AAAA,UACU,QAAQ;AAAA,YACN,MAAMA,GAAc;AAAA,UAChC;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAc;AAAA,YACpB,cAAc,CAAA;AAAA,UAC1B;AAAA,QACA;AAAA,QACQ,YAAY,CAAC4B,GAAU,KAAK;AAAA,MACpC;AAAA,MACM,mBAAmB;AAAA,QACjB,MAAM3B,GAAkB;AAAA,QACxB,YAAY;AAAA,UACV,WAAW;AAAA,YACT,MAAMA,GAAkB;AAAA,UACpC;AAAA,UACU,WAAW;AAAA,YACT,MAAMA,GAAkB;AAAA,UACpC;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,QAAQ;AAAA,QACN,MAAMC,GAAO;AAAA,QACb,YAAY;AAAA,UACV,IAAI;AAAA,YACF,MAAMA,GAAO;AAAA,UACzB;AAAA,UACU,SAAS;AAAA,YACP,MAAMA,GAAO;AAAA,UACzB;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAO;AAAA,YACb,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAO;AAAA,UACzB;AAAA,QACA;AAAA,QACQ,YAAY,CAAC0B,GAAU,KAAK;AAAA,MACpC;AAAA,MACM,OAAO;AAAA,QACL,MAAMxB,GAAM;AAAA,QACZ,YAAY;AAAA,UACV,SAAS;AAAA,YACP,MAAMA,GAAM;AAAA,YACZ,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAM;AAAA,UACxB;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAM;AAAA,UACxB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,WAAW;AAAA,QACT,MAAMC,GAAU;AAAA,QAChB,YAAY;AAAA,UACV,UAAU;AAAA,YACR,MAAMA,GAAU;AAAA,UAC5B;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAU;AAAA,UAC5B;AAAA,UACU,KAAK;AAAA,YACH,MAAMA,GAAU;AAAA,UAC5B;AAAA,UACU,YAAY;AAAA,YACV,MAAMA,GAAU;AAAA,YAChB,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAU;AAAA,UAC5B;AAAA,QACA;AAAA,QACQ,YAAY,CAACG,GAAS,KAAK;AAAA,MACnC;AAAA,MACM,MAAM;AAAA,QACJ,MAAMF,GAAK;AAAA,QACX,YAAY;AAAA,UACV,QAAQ;AAAA,YACN,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAK;AAAA,YACX,cAAc;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,SAAS;AAAA,YACP,MAAMA,GAAK;AAAA,YACX,cAAc;AAAA,UAC1B;AAAA,UACU,QAAQ;AAAA,YACN,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAK;AAAA,YACX,cAAc;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,SAAS;AAAA,YACP,MAAMA,GAAK;AAAA,YACX,cAAc;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAK;AAAA,UACvB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,OAAO;AAAA,QACL,MAAMC,GAAM;AAAA,QACZ,YAAY;AAAA,UACV,MAAM;AAAA,YACJ,MAAMA,GAAM;AAAA,YACZ,eAAeX,GAAK;AAAA,UAChC;AAAA,UACU,OAAO;AAAA,YACL,MAAMW,GAAM;AAAA,UACxB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,UAAU;AAAA,QACR,MAAMC,GAAS;AAAA,QACf,YAAY;AAAA,UACV,UAAU;AAAA,YACR,MAAMA,GAAS;AAAA,UAC3B;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAS;AAAA,UAC3B;AAAA,UACU,YAAY;AAAA,YACV,MAAMA,GAAS;AAAA,YACf,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAS;AAAA,UAC3B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,OAAO;AAAA,QACL,MAAMt9E,GAAM;AAAA,QACZ,YAAY;AAAA,UACV,MAAM;AAAA,YACJ,MAAMA,GAAM;AAAA,UACxB;AAAA,UACU,IAAI;AAAA,YACF,MAAMA,GAAM;AAAA,UACxB;AAAA,UACU,IAAI;AAAA,YACF,MAAMA,GAAM;AAAA,UACxB;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAM;AAAA,UACxB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,MAAM;AAAA,QACJ,MAAMw9E,GAAK;AAAA,QACX,YAAY;AAAA,UACV,UAAU;AAAA,YACR,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAK;AAAA,UACvB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,MAAM;AAAA,QACJ,MAAME,GAAK;AAAA,QACX,YAAY;AAAA,UACV,eAAe;AAAA,YACb,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAK;AAAA,UACvB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,UAAU;AAAA,QACR,MAAMC,GAAS;AAAA,QACf,YAAY;AAAA,UACV,IAAI;AAAA,YACF,MAAMA,GAAS;AAAA,UAC3B;AAAA,UACU,IAAI;AAAA,YACF,MAAMA,GAAS;AAAA,UAC3B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,MAAM;AAAA,QACJ,MAAMC,GAAK;AAAA,QACX,YAAY;AAAA,UACV,eAAe;AAAA,YACb,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAK;AAAA,UACvB;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAK;AAAA,UACvB;AAAA,QACA;AAAA,QACQ,YAAY,CAACF,GAAK,KAAK;AAAA,MAC/B;AAAA,MACM,OAAO;AAAA,QACL,MAAMG,GAAM;AAAA,QACZ,YAAY;AAAA,UACV,QAAQ;AAAA,YACN,MAAMA,GAAM;AAAA,UACxB;AAAA,UACU,IAAI;AAAA,YACF,MAAMA,GAAM;AAAA,UACxB;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAM;AAAA,YACZ,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAM;AAAA,UACxB;AAAA,QACA;AAAA,QACQ,YAAY,CAACa,GAAU,KAAK;AAAA,MACpC;AAAA,MACM,QAAQ;AAAA,QACN,MAAM/tE,GAAO;AAAA,QACb,YAAY;AAAA,UACV,MAAM;AAAA,YACJ,MAAMA,GAAO;AAAA,UACzB;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAO;AAAA,YACb,cAAc;AAAA,UAC1B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,QAAQ;AAAA,QACN,MAAMotE,GAAO;AAAA,QACb,YAAY;AAAA,UACV,UAAU;AAAA,YACR,MAAMA,GAAO;AAAA,UACzB;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAO;AAAA,UACzB;AAAA,UACU,QAAQ;AAAA,YACN,MAAMA,GAAO;AAAA,YACb,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAO;AAAA,UACzB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,aAAa;AAAA,QACX,MAAME,GAAY;AAAA,QAClB,YAAY;AAAA,UACV,MAAM;AAAA,YACJ,MAAMA,GAAY;AAAA,UAC9B;AAAA,UACU,KAAK;AAAA,YACH,MAAMA,GAAY;AAAA,UAC9B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAY;AAAA,UAC9B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAY;AAAA,UAC9B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,KAAK;AAAA,QACH,MAAME,GAAI;AAAA,QACV,YAAY;AAAA,UACV,UAAU;AAAA,YACR,MAAMA,GAAI;AAAA,UACtB;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAI;AAAA,UACtB;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAI;AAAA,YACV,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAI;AAAA,YACV,cAAc;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAI;AAAA,UACtB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,YAAY;AAAA,QACV,MAAME,GAAW;AAAA,QACjB,YAAY;AAAA,UACV,OAAO;AAAA,YACL,MAAMA,GAAW;AAAA,UAC7B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAW;AAAA,UAC7B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,OAAO;AAAA,QACL,MAAME,GAAM;AAAA,QACZ,YAAY;AAAA,UACV,UAAU;AAAA,YACR,MAAMA,GAAM;AAAA,UACxB;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAM;AAAA,UACxB;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAM;AAAA,YACZ,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,QAAQ;AAAA,YACN,MAAMA,GAAM;AAAA,YACZ,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,SAAS;AAAA,YACP,MAAMA,GAAM;AAAA,YACZ,cAAc,CAAA;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAM;AAAA,UACxB;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,SAAS;AAAA,QACP,MAAMC,GAAQ;AAAA,QACd,YAAY;AAAA,UACV,eAAe;AAAA,YACb,MAAMA,GAAQ;AAAA,UAC1B;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAQ;AAAA,UAC1B;AAAA,QACA;AAAA,QACQ,YAAY,CAACd,GAAK,KAAK;AAAA,MAC/B;AAAA,MACM,SAAS;AAAA,QACP,MAAMe,GAAQ;AAAA,QACd,YAAY;AAAA,UACV,MAAM;AAAA,YACJ,MAAMA,GAAQ;AAAA,UAC1B;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAQ;AAAA,UAC1B;AAAA,UACU,IAAI;AAAA,YACF,MAAMA,GAAQ;AAAA,UAC1B;AAAA,UACU,IAAI;AAAA,YACF,MAAMA,GAAQ;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAQ;AAAA,UAC1B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,WAAW;AAAA,QACT,MAAMC,GAAU;AAAA,QAChB,YAAY,CAAA;AAAA,QACZ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,SAAS;AAAA,QACP,MAAMC,GAAQ;AAAA,QACd,YAAY;AAAA,UACV,UAAU;AAAA,YACR,MAAMA,GAAQ;AAAA,UAC1B;AAAA,UACU,UAAU;AAAA,YACR,MAAMA,GAAQ;AAAA,UAC1B;AAAA,UACU,OAAO;AAAA,YACL,MAAMA,GAAQ;AAAA,UAC1B;AAAA,UACU,aAAa;AAAA,YACX,MAAMA,GAAQ;AAAA,YACd,cAAc,CAAA;AAAA,UAC1B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,MACM,YAAY;AAAA,QACV,MAAME,GAAW;AAAA,QACjB,YAAY;AAAA,UACV,QAAQ;AAAA,YACN,MAAMA,GAAW;AAAA,UAC7B;AAAA,UACU,MAAM;AAAA,YACJ,MAAMA,GAAW;AAAA,UAC7B;AAAA,QACA;AAAA,QACQ,YAAY,CAAA;AAAA,MACpB;AAAA,IACA;AAAA,EACE;AAIF,GAFIpD,EAAOl+C,IAAM,sBAAsB,GAjfZA,KAofvBz/B,KAAa,IAAIghF,GAAoB,GAIrCC,IACAC,KAA6C,gBAAAvD,EAAO,MAAMsD,OAAqCA,KAAmCzD,GAAoB,yvWAAyvW,IAAI,4BAA4B,GAC/6W2D,IACAC,KAAyC,gBAAAzD,EAAO,MAAMwD,OAAiCA,KAA+B3D,GAAoB,m6UAAm6U,IAAI,wBAAwB,GACzkV6D,IACAC,KAAqC,gBAAA3D,EAAO,MAAM0D,OAA6BA,KAA2B7D,GAAoB,ktJAAktJ,IAAI,oBAAoB,GACx2J+D,IACAC,KAAuC,gBAAA7D,EAAO,MAAM4D,OAA+BA,KAA6B/D,GAAoB,4tLAA4tL,IAAI,sBAAsB,GAC13LiE,IACAC,KAAoC,gBAAA/D,EAAO,MAAM8D,OAA4BA,KAA0BjE,GAAoB,+kMAA+kM,IAAI,mBAAmB,GACjuMmE,IACAC,KAAsC,gBAAAjE,EAAO,MAAMgE,OAA8BA,KAA4BnE,GAAoB,u/WAAu/W,IAAI,qBAAqB,GACjpXqE,IACAC,KAAwC,gBAAAnE,EAAO,MAAMkE,OAAgCA,KAA8BrE,GAAoB,8yRAA8yR,IAAI,uBAAuB,GAGh9RuE,KAAsC;AAAA,EACxC,YAAY;AAAA,EACZ,gBAAgB,CAAC,QAAQ,UAAU;AAAA,EACnC,iBAAiB;AAAA,EACjB,MAAM;AACR,GACIC,KAAkC;AAAA,EACpC,YAAY;AAAA,EACZ,gBAAgB,CAAC,QAAQ,UAAU;AAAA,EACnC,iBAAiB;AAAA,EACjB,MAAM;AACR,GACIC,KAA8B;AAAA,EAChC,YAAY;AAAA,EACZ,gBAAgB,CAAC,QAAQ,UAAU;AAAA,EACnC,iBAAiB;AAAA,EACjB,MAAM;AACR,GACIC,KAAgC;AAAA,EAClC,YAAY;AAAA,EACZ,gBAAgB,CAAC,QAAQ,UAAU;AAAA,EACnC,iBAAiB;AAAA,EACjB,MAAM;AACR,GACIC,KAA6B;AAAA,EAC/B,YAAY;AAAA,EACZ,gBAAgB,CAAC,QAAQ,UAAU;AAAA,EACnC,iBAAiB;AAAA,EACjB,MAAM;AACR,GACIC,KAA+B;AAAA,EACjC,YAAY;AAAA,EACZ,gBAAgB,CAAC,QAAQ,UAAU;AAAA,EACnC,iBAAiB;AAAA,EACjB,MAAM;AACR,GACIC,KAAiC;AAAA,EACnC,YAAY;AAAA,EACZ,gBAAgB,CAAC,QAAQ,UAAU;AAAA,EACnC,iBAAiB;AAAA,EACjB,MAAM;AACR,GACIC,KAA+B;AAAA,EACjC,eAA+B,gBAAA3E,EAAO,MAAM,IAAIqD,GAAoB,GAAI,eAAe;AACzF,GACIuB,KAAqC;AAAA,EACvC,SAAyB,gBAAA5E,EAAO,MAAMuD,GAA0B,GAAI,SAAS;AAAA,EAC7E,kBAAkC,gBAAAvD,EAAO,MAAMoE,IAAqC,kBAAkB;AAAA,EACtG,QAAQ,CAAA;AACV,GACIS,KAAiC;AAAA,EACnC,SAAyB,gBAAA7E,EAAO,MAAMyD,GAAsB,GAAI,SAAS;AAAA,EACzE,kBAAkC,gBAAAzD,EAAO,MAAMqE,IAAiC,kBAAkB;AAAA,EAClG,QAAQ,CAAA;AACV,GACIS,KAA6B;AAAA,EAC/B,SAAyB,gBAAA9E,EAAO,MAAM2D,GAAkB,GAAI,SAAS;AAAA,EACrE,kBAAkC,gBAAA3D,EAAO,MAAMsE,IAA6B,kBAAkB;AAAA,EAC9F,QAAQ,CAAA;AACV,GACIS,KAA+B;AAAA,EACjC,SAAyB,gBAAA/E,EAAO,MAAM6D,GAAoB,GAAI,SAAS;AAAA,EACvE,kBAAkC,gBAAA7D,EAAO,MAAMuE,IAA+B,kBAAkB;AAAA,EAChG,QAAQ,CAAA;AACV,GACIS,KAA4B;AAAA,EAC9B,SAAyB,gBAAAhF,EAAO,MAAM+D,GAAiB,GAAI,SAAS;AAAA,EACpE,kBAAkC,gBAAA/D,EAAO,MAAMwE,IAA4B,kBAAkB;AAAA,EAC7F,QAAQ,CAAA;AACV,GACIS,KAA8B;AAAA,EAChC,SAAyB,gBAAAjF,EAAO,MAAMiE,GAAmB,GAAI,SAAS;AAAA,EACtE,kBAAkC,gBAAAjE,EAAO,MAAMyE,IAA8B,kBAAkB;AAAA,EAC/F,QAAQ,CAAA;AACV,GACIS,KAAgC;AAAA,EAClC,SAAyB,gBAAAlF,EAAO,MAAMmE,GAAqB,GAAI,SAAS;AAAA,EACxE,kBAAkC,gBAAAnE,EAAO,MAAM0E,IAAgC,kBAAkB;AAAA,EACjG,QAAQ,CAAA;AACV,GAMIS,KAA0B,8CAC1BC,KAA0B,6BAC1BC,KAAa,yBAGbC,KAAe;AAAA,EACjB,WAAWH;AAAA,EACX,WAAWC;AAAA,EACX,OAAOC;AACT,OACIE,MAAgCzjD,KAAA,cAAc0mB,GAAsB;AAAA,EAItE,aAAan6C,GAAMzD,GAAO9B,GAAS;AACjC,QAAI7Q,IAAQ,KAAK,mBAAmBoW,GAAMzD,GAAO9B,CAAO;AAIxD,WAHI7Q,MAAU,WACZA,IAAQ,KAAK,mBAAmBoW,GAAMzD,GAAO9B,CAAO,IAElD7Q,MAAU,SACL,MAAM,aAAaoW,GAAMzD,GAAO9B,CAAO,IAEzC7Q;AAAA,EACT;AAAA,EACA,mBAAmBoW,GAAMzD,GAAO46E,GAAU;AACxC,UAAM/4E,IAAQ64E,GAAaj3E,EAAK,IAAI;AACpC,QAAI5B,MAAU;AACZ;AAEF,UAAMW,IAAQX,EAAM,KAAK7B,CAAK;AAC9B,QAAIwC,MAAU,MAGd;AAAA,UAAIA,EAAM,CAAC,MAAM;AACf,eAAOA,EAAM,CAAC,EAAE,KAAI,EAAG,QAAQ,eAAe,GAAG;AAEnD,UAAIA,EAAM,CAAC,MAAM;AACf,eAAOA,EAAM,CAAC,EAAE,QAAQ,UAAU,EAAE,EAAE,QAAQ,UAAU,EAAE,EAAE,QAAQ,eAAe,GAAG,EAAE,QAAQ,gBAAgB;AAAA,CAAI;AAAA;AAAA,EAGxH;AACF,GA7BI4yE,EAAOl+C,IAAM,+BAA+B,GAFZA,SAgChC2jD,MAAuB3jD,KAAA,cAAcyjD,GAA8B;AAAA,EAIrE,mBAAmBG,GAAOC,GAAQH,GAAU;AAAA,EAE5C;AACF,GALIxF,EAAOl+C,IAAM,sBAAsB,GAFZA,SAWvB8jD,MAA8B9jD,KAAA,cAAcmmB,GAAoB;AAAA,EAIlE,YAAY49B,GAAU;AACpB,UAAK,GACL,KAAK,WAAW,IAAI,IAAIA,CAAQ;AAAA,EAClC;AAAA,EACA,mBAAmBt3E,GAAO45C,GAAgBxnD,GAAS;AACjD,UAAMgb,IAAa,MAAM,mBAAmBpN,GAAO45C,GAAgBxnD,CAAO;AAC1E,WAAAgb,EAAW,QAAQ,CAACgI,MAAc;AAChC,MAAI,KAAK,SAAS,IAAIA,EAAU,IAAI,KAAKA,EAAU,YAAY,WAC7DA,EAAU,UAAU,IAAI,OAAOA,EAAU,QAAQ,SAAQ,IAAK,oBAAoB;AAAA,IAEtF,CAAC,GACMhI;AAAA,EACT;AACF,GAfIqkE,EAAOl+C,IAAM,6BAA6B,GAFZA;AAkBTA,KAAA,cAAc8jD,GAA4B;AAInE,GAFI5F,EAAOl+C,IAAM,oBAAoB;QC7/BjCgkD,MAAuBhkD,KAAA,cAAc8jD,GAA4B;AAAA,EAInE,cAAc;AACZ,UAAM,CAAC,UAAU,CAAC;AAAA,EACpB;AACF,GALI5F,EAAOl+C,IAAM,sBAAsB,GAFZA,KAUvBikD,KAAiB;AAAA,EACnB,QAAQ;AAAA,IACN,cAA8B,gBAAA/F,EAAO,MAAM,IAAI8F,GAAoB,GAAI,cAAc;AAAA,IACrF,gBAAgC,gBAAA9F,EAAO,MAAM,IAAIyF,GAAoB,GAAI,gBAAgB;AAAA,EAC7F;AACA;AACA,SAASO,GAAuBj8B,IAAUw1B,IAAiB;AACzD,QAAMK,IAAS1B;AAAA,IACbL,GAA8B9zB,CAAO;AAAA,IACrC46B;AAAA,EACJ,GACQ9C,IAAW3D;AAAA,IACfN,GAAwB,EAAE,QAAAgC,GAAQ;AAAA,IAClCiF;AAAA,IACAkB;AAAA,EACJ;AACE,SAAAnG,EAAO,gBAAgB,SAASiC,CAAQ,GACjC,EAAE,QAAAjC,GAAQ,UAAAiC,EAAQ;AAC3B;AACA7B,EAAOgG,IAAwB,wBAAwB;QC7BnDC,MAAmBnkD,KAAA,cAAc8jD,GAA4B;AAAA,EAI/D,cAAc;AACZ,UAAM,CAAC,QAAQ,UAAU,CAAC;AAAA,EAC5B;AACF,GALI5F,EAAOl+C,IAAM,kBAAkB,GAFZA,KAUnBokD,KAAa;AAAA,EACf,QAAQ;AAAA,IACN,cAA8B,gBAAAlG,EAAO,MAAM,IAAIiG,GAAgB,GAAI,cAAc;AAAA,IACjF,gBAAgC,gBAAAjG,EAAO,MAAM,IAAIyF,GAAoB,GAAI,gBAAgB;AAAA,EAC7F;AACA;AACA,SAASU,GAAmBp8B,IAAUw1B,IAAiB;AACrD,QAAMK,IAAS1B;AAAA,IACbL,GAA8B9zB,CAAO;AAAA,IACrC46B;AAAA,EACJ,GACQ5C,IAAO7D;AAAA,IACXN,GAAwB,EAAE,QAAAgC,GAAQ;AAAA,IAClCkF;AAAA,IACAoB;AAAA,EACJ;AACE,SAAAtG,EAAO,gBAAgB,SAASmC,CAAI,GAC7B,EAAE,QAAAnC,GAAQ,MAAAmC,EAAI;AACvB;AACA/B,EAAOmG,IAAoB,oBAAoB;QC7B3CC,MAAqBtkD,KAAA,cAAc8jD,GAA4B;AAAA,EAIjE,cAAc;AACZ,UAAM,CAAC,QAAQ,CAAC;AAAA,EAClB;AACF,GALI5F,EAAOl+C,IAAM,oBAAoB,GAFZA,KAUrBukD,KAAe;AAAA,EACjB,QAAQ;AAAA,IACN,cAA8B,gBAAArG,EAAO,MAAM,IAAIoG,GAAkB,GAAI,cAAc;AAAA,IACnF,gBAAgC,gBAAApG,EAAO,MAAM,IAAIyF,GAAoB,GAAI,gBAAgB;AAAA,EAC7F;AACA;AACA,SAASa,GAAqBv8B,IAAUw1B,IAAiB;AACvD,QAAMK,IAAS1B;AAAA,IACbL,GAA8B9zB,CAAO;AAAA,IACrC46B;AAAA,EACJ,GACQrC,IAASpE;AAAA,IACbN,GAAwB,EAAE,QAAAgC,GAAQ;AAAA,IAClCmF;AAAA,IACAsB;AAAA,EACJ;AACE,SAAAzG,EAAO,gBAAgB,SAAS0C,CAAM,GAC/B,EAAE,QAAA1C,GAAQ,QAAA0C,EAAM;AACzB;AACAtC,EAAOsG,IAAsB,sBAAsB;QC7B/CC,MAAkBzkD,KAAA,cAAc8jD,GAA4B;AAAA,EAI9D,cAAc;AACZ,UAAM,CAAC,OAAO,UAAU,CAAC;AAAA,EAC3B;AACF,GALI5F,EAAOl+C,IAAM,iBAAiB,GAFZA,SAUlB0kD,MAAoB1kD,KAAA,cAAcyjD,GAA8B;AAAA,EAIlE,mBAAmBl3E,GAAMzD,GAAO46E,GAAU;AACxC,QAAIn3E,EAAK,SAAS;AAGlB,aAAOzD,EAAM,QAAQ,MAAM,EAAE,EAAE,KAAI;AAAA,EACrC;AACF,GARIo1E,EAAOl+C,IAAM,mBAAmB,GAFZA,KAapB2kD,KAAY;AAAA,EACd,QAAQ;AAAA,IACN,cAA8B,gBAAAzG,EAAO,MAAM,IAAIuG,GAAe,GAAI,cAAc;AAAA,IAChF,gBAAgC,gBAAAvG,EAAO,MAAM,IAAIwG,GAAiB,GAAI,gBAAgB;AAAA,EAC1F;AACA;AACA,SAASE,GAAkB38B,IAAUw1B,IAAiB;AACpD,QAAMK,IAAS1B;AAAA,IACbL,GAA8B9zB,CAAO;AAAA,IACrC46B;AAAA,EACJ,GACQjC,IAAMxE;AAAA,IACVN,GAAwB,EAAE,QAAAgC,GAAQ;AAAA,IAClCoF;AAAA,IACAyB;AAAA,EACJ;AACE,SAAA7G,EAAO,gBAAgB,SAAS8C,CAAG,GAC5B,EAAE,QAAA9C,GAAQ,KAAA8C,EAAG;AACtB;AACA1C,EAAO0G,IAAmB,mBAAmB;QC1CzCC,MAA2B7kD,KAAA,cAAc8jD,GAA4B;AAAA,EAIvE,cAAc;AACZ,UAAM,CAAC,cAAc,CAAC;AAAA,EACxB;AACF,GALI5F,EAAOl+C,IAAM,0BAA0B,GAFZA,SAU3B8kD,MAA6B9kD,KAAA,cAAcyjD,GAA8B;AAAA,EAI3E,mBAAmBl3E,GAAMzD,GAAO46E,GAAU;AACxC,QAAIn3E,EAAK,SAAS;AAChB,aAAOzD,EAAM,QAAQ,SAAS,EAAE,EAAE,KAAI;AACjC,QAAIyD,EAAK,SAAS;AACvB,aAAOzD,EAAM,QAAQ,UAAU,EAAE;AAC5B,QAAIyD,EAAK,SAAS;AACvB,aAAOzD,EAAM,QAAQ,UAAU,EAAE,EAAE,KAAI;AAAA,EAG3C;AACF,GAZIo1E,EAAOl+C,IAAM,4BAA4B,GAFZA,KAiB7B+kD,KAAqB;AAAA,EACvB,QAAQ;AAAA,IACN,cAA8B,gBAAA7G,EAAO,MAAM,IAAI2G,GAAwB,GAAI,cAAc;AAAA,IACzF,gBAAgC,gBAAA3G,EAAO,MAAM,IAAI4G,GAA0B,GAAI,gBAAgB;AAAA,EACnG;AACA;AACA,SAASE,GAA2B/8B,IAAUw1B,IAAiB;AAC7D,QAAMK,IAAS1B;AAAA,IACbL,GAA8B9zB,CAAO;AAAA,IACrC46B;AAAA,EACJ,GACQ5D,IAAe7C;AAAA,IACnBN,GAAwB,EAAE,QAAAgC,GAAQ;AAAA,IAClCgF;AAAA,IACAiC;AAAA,EACJ;AACE,SAAAjH,EAAO,gBAAgB,SAASmB,CAAY,GACrC,EAAE,QAAAnB,GAAQ,cAAAmB,EAAY;AAC/B;AACAf,EAAO8G,IAA4B,4BAA4B;QC9C3DC,MAAoBjlD,KAAA,cAAc8jD,GAA4B;AAAA,EAIhE,cAAc;AACZ,UAAM,CAAC,YAAY,CAAC;AAAA,EACtB;AACF,GALI5F,EAAOl+C,IAAM,mBAAmB,GAFZA,KAUpBklD,KAAc;AAAA,EAChB,QAAQ;AAAA,IACN,cAA8B,gBAAAhH,EAAO,MAAM,IAAI+G,GAAiB,GAAI,cAAc;AAAA,IAClF,gBAAgC,gBAAA/G,EAAO,MAAM,IAAIyF,GAAoB,GAAI,gBAAgB;AAAA,EAC7F;AACA;AACA,SAASwB,GAAoBl9B,IAAUw1B,IAAiB;AACtD,QAAMK,IAAS1B;AAAA,IACbL,GAA8B9zB,CAAO;AAAA,IACrC46B;AAAA,EACJ,GACQ7B,IAAQ5E;AAAA,IACZN,GAAwB,EAAE,QAAAgC,GAAQ;AAAA,IAClCqF;AAAA,IACA+B;AAAA,EACJ;AACE,SAAApH,EAAO,gBAAgB,SAASkD,CAAK,GAC9B,EAAE,QAAAlD,GAAQ,OAAAkD,EAAK;AACxB;AACA9C,EAAOiH,IAAqB,qBAAqB;QC7B7CC,MAAsBplD,KAAA,cAAc8jD,GAA4B;AAAA,EAIlE,cAAc;AACZ,UAAM,CAAC,SAAS,CAAC;AAAA,EACnB;AACF,GALI5F,EAAOl+C,IAAM,qBAAqB,GAFZA,KAUtBqlD,KAAgB,sDAChBC,MAAwBtlD,KAAA,cAAcyjD,GAA8B;AAAA,EAItE,mBAAmBl3E,GAAMzD,GAAO46E,GAAU;AACxC,QAAIn3E,EAAK,SAAS;AAChB,aAAO,WAAWzD,EAAM,QAAQ,MAAM,EAAE,CAAC;AACpC,QAAIyD,EAAK,SAAS;AACvB,aAAOzD,EAAM,UAAU,GAAGA,EAAM,SAAS,CAAC;AACrC,QAAIyD,EAAK,SAAS;AACvB,aAAOzD,EAAM,UAAU,GAAGA,EAAM,SAAS,CAAC;AACrC,QAAIyD,EAAK,SAAS;AACvB,aAAOzD,EAAM;AACR,QAAIyD,EAAK,SAAS,YAAY;AACnC,UAAI,OAAOzD,KAAU;AACnB,eAAOA;AAET,YAAMwC,IAAQ+5E,GAAc,KAAKv8E,CAAK;AACtC,UAAIwC;AACF,eAAO;AAAA,UACL,OAAO;AAAA,UACP,WAAWA,EAAM,CAAC;AAAA,UAClB,WAAWA,EAAM,CAAC,KAAK;AAAA,QACjC;AAAA,IAEI;AAAA,EAEF;AACF,GA1BI4yE,EAAOl+C,IAAM,uBAAuB,GAFZA;AA+B5B,SAASulD,GAAyBr0E,GAAU;AAC1C,QAAMkkE,IAAYlkE,EAAS,WAAW,kBAChCs0E,IAAWt0E,EAAS,WAAW;AACrC,MAAIs0E,GAAU;AACZ,UAAMzxB,IAAS;AAAA,MACb,SAASqhB,EAAU,gBAAgB,KAAKA,CAAS;AAAA;AAAA,IAEvD;AACI,IAAAoQ,EAAS,SAASzxB,GAAQqhB,CAAS;AAAA,EACrC;AACF;AACA8I,EAAOqH,IAA0B,0BAA0B;QACvDE,MAAmBzlD,KAAA,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ3B,gBAAgBmuB,GAAKwF,GAAQ;AAC3B,QAAI+xB;AACJ,eAAW5oB,KAAO3O,EAAI;AACpB,MAAK2O,EAAI,SAGL4oB,MAAwB;AAAA,MAC5B5oB,EAAI,WAAW,SACb4oB,IAAsB,IACb5oB,EAAI,WAAW,SACxBnJ,EAAO,SAAS,qDAAqD;AAAA,QACnE,MAAMmJ;AAAA,QACN,UAAU;AAAA,MACpB,CAAS,IACQ4oB,MAAwB,UAAUA,KAAuB,SAAS5oB,EAAI,QAAQ,EAAE,KACzFnJ,EAAO,SAAS,qDAAqD;AAAA,QACnE,MAAMmJ;AAAA,QACN,UAAU;AAAA,MACpB,CAAS;AAAA,EAGP;AACF,GA5BIohB,EAAOl+C,IAAM,kBAAkB,GAFZA,KAiCnB2lD,KAAgB;AAAA,EAClB,QAAQ;AAAA,IACN,cAA8B,gBAAAzH,EAAO,MAAM,IAAIkH,GAAmB,GAAI,cAAc;AAAA,IACpF,gBAAgC,gBAAAlH,EAAO,MAAM,IAAIoH,GAAqB,GAAI,gBAAgB;AAAA,EAC9F;AAAA,EACE,YAAY;AAAA,IACV,kBAAkC,gBAAApH,EAAO,MAAM,IAAIuH,GAAgB,GAAI,kBAAkB;AAAA,EAC7F;AACA;AACA,SAASG,GAAsB39B,IAAUw1B,IAAiB;AACxD,QAAMK,IAAS1B;AAAA,IACbL,GAA8B9zB,CAAO;AAAA,IACrC46B;AAAA,EACJ,GACQzB,IAAUhF;AAAA,IACdN,GAAwB,EAAE,QAAAgC,GAAQ;AAAA,IAClCsF;AAAA,IACAuC;AAAA,EACJ;AACE,SAAA7H,EAAO,gBAAgB,SAASsD,CAAO,GACvCmE,GAAyBnE,CAAO,GACzB,EAAE,QAAAtD,GAAQ,SAAAsD,EAAO;AAC1B;AACAlD,EAAO0H,IAAuB,uBAAuB;AC1DrD,IAAIC,KAAU,CAAA,GACVC,KAAe;AAAA,EACjB,MAAsB,gBAAA5H,EAAO,YAAY;AACvC,UAAM,EAAE,oBAAoB6H,EAAmB,IAAK,MAAM,QAAA,QAAA,EAAA,KAAA,MAAAC,EAAA,GACpDljC,IAASijC,EAAmB,EAAG,KAAK,OAAO;AACjD,IAAAF,GAAQ,OAAO/iC;AAAA,EACjB,GAAG,MAAM;AAAA,EACT,QAAwB,gBAAAo7B,EAAO,YAAY;AACzC,UAAM,EAAE,sBAAsB+H,EAAqB,IAAK,MAAM,QAAA,QAAA,EAAA,KAAA,MAAAC,EAAA,GACxDpjC,IAASmjC,EAAqB,EAAG,OAAO,OAAO;AACrD,IAAAJ,GAAQ,SAAS/iC;AAAA,EACnB,GAAG,QAAQ;AAAA,EACX,KAAqB,gBAAAo7B,EAAO,YAAY;AACtC,UAAM,EAAE,mBAAmBiI,EAAkB,IAAK,MAAM,QAAA,QAAA,EAAA,KAAA,MAAAC,EAAA,GAClDtjC,IAASqjC,EAAkB,EAAG,IAAI,OAAO;AAC/C,IAAAN,GAAQ,MAAM/iC;AAAA,EAChB,GAAG,KAAK;AAAA,EACR,cAA8B,gBAAAo7B,EAAO,YAAY;AAC/C,UAAM,EAAE,4BAA4BmI,EAA2B,IAAK,MAAM,QAAA,QAAA,EAAA,KAAA,MAAAC,EAAA,GACpExjC,IAASujC,EAA2B,EAAG,aAAa,OAAO;AACjE,IAAAR,GAAQ,eAAe/iC;AAAA,EACzB,GAAG,cAAc;AAAA,EACjB,UAA0B,gBAAAo7B,EAAO,YAAY;AAC3C,UAAM,EAAE,wBAAwBqI,EAAuB,IAAK,MAAM,QAAA,QAAA,EAAA,KAAA,MAAAC,EAAA,GAC5D1jC,IAASyjC,EAAuB,EAAG,SAAS,OAAO;AACzD,IAAAV,GAAQ,WAAW/iC;AAAA,EACrB,GAAG,UAAU;AAAA,EACb,OAAuB,gBAAAo7B,EAAO,YAAY;AACxC,UAAM,EAAE,qBAAqBuI,EAAoB,IAAK,MAAM,QAAA,QAAA,EAAA,KAAA,MAAAC,EAAA,GACtD5jC,IAAS2jC,EAAoB,EAAG,MAAM,OAAO;AACnD,IAAAZ,GAAQ,QAAQ/iC;AAAA,EAClB,GAAG,OAAO;AAAA,EACV,SAAyB,gBAAAo7B,EAAO,YAAY;AAC1C,UAAM,EAAE,uBAAuByI,EAAsB,IAAK,MAAM,QAAA,QAAA,EAAA,KAAA,MAAAC,EAAA,GAC1D9jC,IAAS6jC,EAAsB,EAAG,QAAQ,OAAO;AACvD,IAAAd,GAAQ,UAAU/iC;AAAA,EACpB,GAAG,SAAS;AACd;AACA,eAAe+jC,GAAMC,GAAa/kE,GAAM;AACtC,QAAMnrB,IAAckvF,GAAagB,CAAW;AAC5C,MAAI,CAAClwF;AACH,UAAM,IAAI,MAAM,yBAAyBkwF,CAAW,EAAE;AAExD,EAAKjB,GAAQiB,CAAW,KACtB,MAAMlwF,EAAW;AAGnB,QAAMZ,IADS6vF,GAAQiB,CAAW,EACZ,MAAM/kE,CAAI;AAChC,MAAI/rB,EAAO,YAAY,SAAS,KAAKA,EAAO,aAAa,SAAS;AAChE,UAAM,IAAI+wF,GAAkB/wF,CAAM;AAEpC,SAAOA,EAAO;AAChB;AACAkoF,EAAO2I,IAAO,OAAO;QACjBE,MAAoB/mD,KAAA,cAAc,MAAM;AAAA,EAC1C,YAAYhqC,GAAQ;AAClB,UAAMgxF,IAAchxF,EAAO,YAAY,IAAI,CAAC2zD,MAAQA,EAAI,OAAO,EAAE,KAAK;AAAA,CAAI,GACpEs9B,IAAejxF,EAAO,aAAa,IAAI,CAAC2zD,MAAQA,EAAI,OAAO,EAAE,KAAK;AAAA,CAAI;AAC5E,UAAM,mBAAmBq9B,CAAW,IAAIC,CAAY,EAAE,GACtD,KAAK,SAASjxF;AAAA,EAChB;AAIF,GAFIkoF,EAAOl+C,IAAM,mBAAmB,GARZA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180]}