@costrict/cs-darwin-x64-baseline 1.2.21

package/bin/parser.worker.js.map

@@ -0,0 +1,11 @@
+{
+  "version": 3,
+  "sources": ["../../node_modules/.bun/web-tree-sitter@0.25.10/node_modules/web-tree-sitter/tree-sitter.js", "../../node_modules/.bun/@opentui+core@0.1.86+8e67d58793ed4a15/node_modules/@opentui/core/parser.worker.js"],
+  "sourcesContent": [
+    "var __defProp = Object.defineProperty;\nvar __name = (target, value) => __defProp(target, \"name\", { value, configurable: true });\n\n// src/constants.ts\nvar SIZE_OF_SHORT = 2;\nvar SIZE_OF_INT = 4;\nvar SIZE_OF_CURSOR = 4 * SIZE_OF_INT;\nvar SIZE_OF_NODE = 5 * SIZE_OF_INT;\nvar SIZE_OF_POINT = 2 * SIZE_OF_INT;\nvar SIZE_OF_RANGE = 2 * SIZE_OF_INT + 2 * SIZE_OF_POINT;\nvar ZERO_POINT = { row: 0, column: 0 };\nvar INTERNAL = Symbol(\"INTERNAL\");\nfunction assertInternal(x) {\n  if (x !== INTERNAL) throw new Error(\"Illegal constructor\");\n}\n__name(assertInternal, \"assertInternal\");\nfunction isPoint(point) {\n  return !!point && typeof point.row === \"number\" && typeof point.column === \"number\";\n}\n__name(isPoint, \"isPoint\");\nfunction setModule(module2) {\n  C = module2;\n}\n__name(setModule, \"setModule\");\nvar C;\n\n// src/lookahead_iterator.ts\nvar LookaheadIterator = class {\n  static {\n    __name(this, \"LookaheadIterator\");\n  }\n  /** @internal */\n  [0] = 0;\n  // Internal handle for WASM\n  /** @internal */\n  language;\n  /** @internal */\n  constructor(internal, address, language) {\n    assertInternal(internal);\n    this[0] = address;\n    this.language = language;\n  }\n  /** Get the current symbol of the lookahead iterator. */\n  get currentTypeId() {\n    return C._ts_lookahead_iterator_current_symbol(this[0]);\n  }\n  /** Get the current symbol name of the lookahead iterator. */\n  get currentType() {\n    return this.language.types[this.currentTypeId] || \"ERROR\";\n  }\n  /** Delete the lookahead iterator, freeing its resources. */\n  delete() {\n    C._ts_lookahead_iterator_delete(this[0]);\n    this[0] = 0;\n  }\n  /**\n   * Reset the lookahead iterator.\n   *\n   * This returns `true` if the language was set successfully and `false`\n   * otherwise.\n   */\n  reset(language, stateId) {\n    if (C._ts_lookahead_iterator_reset(this[0], language[0], stateId)) {\n      this.language = language;\n      return true;\n    }\n    return false;\n  }\n  /**\n   * Reset the lookahead iterator to another state.\n   *\n   * This returns `true` if the iterator was reset to the given state and\n   * `false` otherwise.\n   */\n  resetState(stateId) {\n    return Boolean(C._ts_lookahead_iterator_reset_state(this[0], stateId));\n  }\n  /**\n   * Returns an iterator that iterates over the symbols of the lookahead iterator.\n   *\n   * The iterator will yield the current symbol name as a string for each step\n   * until there are no more symbols to iterate over.\n   */\n  [Symbol.iterator]() {\n    return {\n      next: /* @__PURE__ */ __name(() => {\n        if (C._ts_lookahead_iterator_next(this[0])) {\n          return { done: false, value: this.currentType };\n        }\n        return { done: true, value: \"\" };\n      }, \"next\")\n    };\n  }\n};\n\n// src/tree.ts\nfunction getText(tree, startIndex, endIndex, startPosition) {\n  const length = endIndex - startIndex;\n  let result = tree.textCallback(startIndex, startPosition);\n  if (result) {\n    startIndex += result.length;\n    while (startIndex < endIndex) {\n      const string = tree.textCallback(startIndex, startPosition);\n      if (string && string.length > 0) {\n        startIndex += string.length;\n        result += string;\n      } else {\n        break;\n      }\n    }\n    if (startIndex > endIndex) {\n      result = result.slice(0, length);\n    }\n  }\n  return result ?? \"\";\n}\n__name(getText, \"getText\");\nvar Tree = class _Tree {\n  static {\n    __name(this, \"Tree\");\n  }\n  /** @internal */\n  [0] = 0;\n  // Internal handle for WASM\n  /** @internal */\n  textCallback;\n  /** The language that was used to parse the syntax tree. */\n  language;\n  /** @internal */\n  constructor(internal, address, language, textCallback) {\n    assertInternal(internal);\n    this[0] = address;\n    this.language = language;\n    this.textCallback = textCallback;\n  }\n  /** Create a shallow copy of the syntax tree. This is very fast. */\n  copy() {\n    const address = C._ts_tree_copy(this[0]);\n    return new _Tree(INTERNAL, address, this.language, this.textCallback);\n  }\n  /** Delete the syntax tree, freeing its resources. */\n  delete() {\n    C._ts_tree_delete(this[0]);\n    this[0] = 0;\n  }\n  /** Get the root node of the syntax tree. */\n  get rootNode() {\n    C._ts_tree_root_node_wasm(this[0]);\n    return unmarshalNode(this);\n  }\n  /**\n   * Get the root node of the syntax tree, but with its position shifted\n   * forward by the given offset.\n   */\n  rootNodeWithOffset(offsetBytes, offsetExtent) {\n    const address = TRANSFER_BUFFER + SIZE_OF_NODE;\n    C.setValue(address, offsetBytes, \"i32\");\n    marshalPoint(address + SIZE_OF_INT, offsetExtent);\n    C._ts_tree_root_node_with_offset_wasm(this[0]);\n    return unmarshalNode(this);\n  }\n  /**\n   * Edit the syntax tree to keep it in sync with source code that has been\n   * edited.\n   *\n   * You must describe the edit both in terms of byte offsets and in terms of\n   * row/column coordinates.\n   */\n  edit(edit) {\n    marshalEdit(edit);\n    C._ts_tree_edit_wasm(this[0]);\n  }\n  /** Create a new {@link TreeCursor} starting from the root of the tree. */\n  walk() {\n    return this.rootNode.walk();\n  }\n  /**\n   * Compare this old edited syntax tree to a new syntax tree representing\n   * the same document, returning a sequence of ranges whose syntactic\n   * structure has changed.\n   *\n   * For this to work correctly, this syntax tree must have been edited such\n   * that its ranges match up to the new tree. Generally, you'll want to\n   * call this method right after calling one of the [`Parser::parse`]\n   * functions. Call it on the old tree that was passed to parse, and\n   * pass the new tree that was returned from `parse`.\n   */\n  getChangedRanges(other) {\n    if (!(other instanceof _Tree)) {\n      throw new TypeError(\"Argument must be a Tree\");\n    }\n    C._ts_tree_get_changed_ranges_wasm(this[0], other[0]);\n    const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const result = new Array(count);\n    if (count > 0) {\n      let address = buffer;\n      for (let i2 = 0; i2 < count; i2++) {\n        result[i2] = unmarshalRange(address);\n        address += SIZE_OF_RANGE;\n      }\n      C._free(buffer);\n    }\n    return result;\n  }\n  /** Get the included ranges that were used to parse the syntax tree. */\n  getIncludedRanges() {\n    C._ts_tree_included_ranges_wasm(this[0]);\n    const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const result = new Array(count);\n    if (count > 0) {\n      let address = buffer;\n      for (let i2 = 0; i2 < count; i2++) {\n        result[i2] = unmarshalRange(address);\n        address += SIZE_OF_RANGE;\n      }\n      C._free(buffer);\n    }\n    return result;\n  }\n};\n\n// src/tree_cursor.ts\nvar TreeCursor = class _TreeCursor {\n  static {\n    __name(this, \"TreeCursor\");\n  }\n  /** @internal */\n  // @ts-expect-error: never read\n  [0] = 0;\n  // Internal handle for Wasm\n  /** @internal */\n  // @ts-expect-error: never read\n  [1] = 0;\n  // Internal handle for Wasm\n  /** @internal */\n  // @ts-expect-error: never read\n  [2] = 0;\n  // Internal handle for Wasm\n  /** @internal */\n  // @ts-expect-error: never read\n  [3] = 0;\n  // Internal handle for Wasm\n  /** @internal */\n  tree;\n  /** @internal */\n  constructor(internal, tree) {\n    assertInternal(internal);\n    this.tree = tree;\n    unmarshalTreeCursor(this);\n  }\n  /** Creates a deep copy of the tree cursor. This allocates new memory. */\n  copy() {\n    const copy = new _TreeCursor(INTERNAL, this.tree);\n    C._ts_tree_cursor_copy_wasm(this.tree[0]);\n    unmarshalTreeCursor(copy);\n    return copy;\n  }\n  /** Delete the tree cursor, freeing its resources. */\n  delete() {\n    marshalTreeCursor(this);\n    C._ts_tree_cursor_delete_wasm(this.tree[0]);\n    this[0] = this[1] = this[2] = 0;\n  }\n  /** Get the tree cursor's current {@link Node}. */\n  get currentNode() {\n    marshalTreeCursor(this);\n    C._ts_tree_cursor_current_node_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /**\n   * Get the numerical field id of this tree cursor's current node.\n   *\n   * See also {@link TreeCursor#currentFieldName}.\n   */\n  get currentFieldId() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_current_field_id_wasm(this.tree[0]);\n  }\n  /** Get the field name of this tree cursor's current node. */\n  get currentFieldName() {\n    return this.tree.language.fields[this.currentFieldId];\n  }\n  /**\n   * Get the depth of the cursor's current node relative to the original\n   * node that the cursor was constructed with.\n   */\n  get currentDepth() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_current_depth_wasm(this.tree[0]);\n  }\n  /**\n   * Get the index of the cursor's current node out of all of the\n   * descendants of the original node that the cursor was constructed with.\n   */\n  get currentDescendantIndex() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_current_descendant_index_wasm(this.tree[0]);\n  }\n  /** Get the type of the cursor's current node. */\n  get nodeType() {\n    return this.tree.language.types[this.nodeTypeId] || \"ERROR\";\n  }\n  /** Get the type id of the cursor's current node. */\n  get nodeTypeId() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_current_node_type_id_wasm(this.tree[0]);\n  }\n  /** Get the state id of the cursor's current node. */\n  get nodeStateId() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_current_node_state_id_wasm(this.tree[0]);\n  }\n  /** Get the id of the cursor's current node. */\n  get nodeId() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_current_node_id_wasm(this.tree[0]);\n  }\n  /**\n   * Check if the cursor's current node is *named*.\n   *\n   * Named nodes correspond to named rules in the grammar, whereas\n   * *anonymous* nodes correspond to string literals in the grammar.\n   */\n  get nodeIsNamed() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_current_node_is_named_wasm(this.tree[0]) === 1;\n  }\n  /**\n   * Check if the cursor's current node is *missing*.\n   *\n   * Missing nodes are inserted by the parser in order to recover from\n   * certain kinds of syntax errors.\n   */\n  get nodeIsMissing() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_current_node_is_missing_wasm(this.tree[0]) === 1;\n  }\n  /** Get the string content of the cursor's current node. */\n  get nodeText() {\n    marshalTreeCursor(this);\n    const startIndex = C._ts_tree_cursor_start_index_wasm(this.tree[0]);\n    const endIndex = C._ts_tree_cursor_end_index_wasm(this.tree[0]);\n    C._ts_tree_cursor_start_position_wasm(this.tree[0]);\n    const startPosition = unmarshalPoint(TRANSFER_BUFFER);\n    return getText(this.tree, startIndex, endIndex, startPosition);\n  }\n  /** Get the start position of the cursor's current node. */\n  get startPosition() {\n    marshalTreeCursor(this);\n    C._ts_tree_cursor_start_position_wasm(this.tree[0]);\n    return unmarshalPoint(TRANSFER_BUFFER);\n  }\n  /** Get the end position of the cursor's current node. */\n  get endPosition() {\n    marshalTreeCursor(this);\n    C._ts_tree_cursor_end_position_wasm(this.tree[0]);\n    return unmarshalPoint(TRANSFER_BUFFER);\n  }\n  /** Get the start index of the cursor's current node. */\n  get startIndex() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_start_index_wasm(this.tree[0]);\n  }\n  /** Get the end index of the cursor's current node. */\n  get endIndex() {\n    marshalTreeCursor(this);\n    return C._ts_tree_cursor_end_index_wasm(this.tree[0]);\n  }\n  /**\n   * Move this cursor to the first child of its current node.\n   *\n   * This returns `true` if the cursor successfully moved, and returns\n   * `false` if there were no children.\n   */\n  gotoFirstChild() {\n    marshalTreeCursor(this);\n    const result = C._ts_tree_cursor_goto_first_child_wasm(this.tree[0]);\n    unmarshalTreeCursor(this);\n    return result === 1;\n  }\n  /**\n   * Move this cursor to the last child of its current node.\n   *\n   * This returns `true` if the cursor successfully moved, and returns\n   * `false` if there were no children.\n   *\n   * Note that this function may be slower than\n   * {@link TreeCursor#gotoFirstChild} because it needs to\n   * iterate through all the children to compute the child's position.\n   */\n  gotoLastChild() {\n    marshalTreeCursor(this);\n    const result = C._ts_tree_cursor_goto_last_child_wasm(this.tree[0]);\n    unmarshalTreeCursor(this);\n    return result === 1;\n  }\n  /**\n   * Move this cursor to the parent of its current node.\n   *\n   * This returns `true` if the cursor successfully moved, and returns\n   * `false` if there was no parent node (the cursor was already on the\n   * root node).\n   *\n   * Note that the node the cursor was constructed with is considered the root\n   * of the cursor, and the cursor cannot walk outside this node.\n   */\n  gotoParent() {\n    marshalTreeCursor(this);\n    const result = C._ts_tree_cursor_goto_parent_wasm(this.tree[0]);\n    unmarshalTreeCursor(this);\n    return result === 1;\n  }\n  /**\n   * Move this cursor to the next sibling of its current node.\n   *\n   * This returns `true` if the cursor successfully moved, and returns\n   * `false` if there was no next sibling node.\n   *\n   * Note that the node the cursor was constructed with is considered the root\n   * of the cursor, and the cursor cannot walk outside this node.\n   */\n  gotoNextSibling() {\n    marshalTreeCursor(this);\n    const result = C._ts_tree_cursor_goto_next_sibling_wasm(this.tree[0]);\n    unmarshalTreeCursor(this);\n    return result === 1;\n  }\n  /**\n   * Move this cursor to the previous sibling of its current node.\n   *\n   * This returns `true` if the cursor successfully moved, and returns\n   * `false` if there was no previous sibling node.\n   *\n   * Note that this function may be slower than\n   * {@link TreeCursor#gotoNextSibling} due to how node\n   * positions are stored. In the worst case, this will need to iterate\n   * through all the children up to the previous sibling node to recalculate\n   * its position. Also note that the node the cursor was constructed with is\n   * considered the root of the cursor, and the cursor cannot walk outside this node.\n   */\n  gotoPreviousSibling() {\n    marshalTreeCursor(this);\n    const result = C._ts_tree_cursor_goto_previous_sibling_wasm(this.tree[0]);\n    unmarshalTreeCursor(this);\n    return result === 1;\n  }\n  /**\n   * Move the cursor to the node that is the nth descendant of\n   * the original node that the cursor was constructed with, where\n   * zero represents the original node itself.\n   */\n  gotoDescendant(goalDescendantIndex) {\n    marshalTreeCursor(this);\n    C._ts_tree_cursor_goto_descendant_wasm(this.tree[0], goalDescendantIndex);\n    unmarshalTreeCursor(this);\n  }\n  /**\n   * Move this cursor to the first child of its current node that contains or\n   * starts after the given byte offset.\n   *\n   * This returns `true` if the cursor successfully moved to a child node, and returns\n   * `false` if no such child was found.\n   */\n  gotoFirstChildForIndex(goalIndex) {\n    marshalTreeCursor(this);\n    C.setValue(TRANSFER_BUFFER + SIZE_OF_CURSOR, goalIndex, \"i32\");\n    const result = C._ts_tree_cursor_goto_first_child_for_index_wasm(this.tree[0]);\n    unmarshalTreeCursor(this);\n    return result === 1;\n  }\n  /**\n   * Move this cursor to the first child of its current node that contains or\n   * starts after the given byte offset.\n   *\n   * This returns the index of the child node if one was found, and returns\n   * `null` if no such child was found.\n   */\n  gotoFirstChildForPosition(goalPosition) {\n    marshalTreeCursor(this);\n    marshalPoint(TRANSFER_BUFFER + SIZE_OF_CURSOR, goalPosition);\n    const result = C._ts_tree_cursor_goto_first_child_for_position_wasm(this.tree[0]);\n    unmarshalTreeCursor(this);\n    return result === 1;\n  }\n  /**\n   * Re-initialize this tree cursor to start at the original node that the\n   * cursor was constructed with.\n   */\n  reset(node) {\n    marshalNode(node);\n    marshalTreeCursor(this, TRANSFER_BUFFER + SIZE_OF_NODE);\n    C._ts_tree_cursor_reset_wasm(this.tree[0]);\n    unmarshalTreeCursor(this);\n  }\n  /**\n   * Re-initialize a tree cursor to the same position as another cursor.\n   *\n   * Unlike {@link TreeCursor#reset}, this will not lose parent\n   * information and allows reusing already created cursors.\n   */\n  resetTo(cursor) {\n    marshalTreeCursor(this, TRANSFER_BUFFER);\n    marshalTreeCursor(cursor, TRANSFER_BUFFER + SIZE_OF_CURSOR);\n    C._ts_tree_cursor_reset_to_wasm(this.tree[0], cursor.tree[0]);\n    unmarshalTreeCursor(this);\n  }\n};\n\n// src/node.ts\nvar Node = class {\n  static {\n    __name(this, \"Node\");\n  }\n  /** @internal */\n  // @ts-expect-error: never read\n  [0] = 0;\n  // Internal handle for Wasm\n  /** @internal */\n  _children;\n  /** @internal */\n  _namedChildren;\n  /** @internal */\n  constructor(internal, {\n    id,\n    tree,\n    startIndex,\n    startPosition,\n    other\n  }) {\n    assertInternal(internal);\n    this[0] = other;\n    this.id = id;\n    this.tree = tree;\n    this.startIndex = startIndex;\n    this.startPosition = startPosition;\n  }\n  /**\n   * The numeric id for this node that is unique.\n   *\n   * Within a given syntax tree, no two nodes have the same id. However:\n   *\n   * * If a new tree is created based on an older tree, and a node from the old tree is reused in\n   *   the process, then that node will have the same id in both trees.\n   *\n   * * A node not marked as having changes does not guarantee it was reused.\n   *\n   * * If a node is marked as having changed in the old tree, it will not be reused.\n   */\n  id;\n  /** The byte index where this node starts. */\n  startIndex;\n  /** The position where this node starts. */\n  startPosition;\n  /** The tree that this node belongs to. */\n  tree;\n  /** Get this node's type as a numerical id. */\n  get typeId() {\n    marshalNode(this);\n    return C._ts_node_symbol_wasm(this.tree[0]);\n  }\n  /**\n   * Get the node's type as a numerical id as it appears in the grammar,\n   * ignoring aliases.\n   */\n  get grammarId() {\n    marshalNode(this);\n    return C._ts_node_grammar_symbol_wasm(this.tree[0]);\n  }\n  /** Get this node's type as a string. */\n  get type() {\n    return this.tree.language.types[this.typeId] || \"ERROR\";\n  }\n  /**\n   * Get this node's symbol name as it appears in the grammar, ignoring\n   * aliases as a string.\n   */\n  get grammarType() {\n    return this.tree.language.types[this.grammarId] || \"ERROR\";\n  }\n  /**\n   * Check if this node is *named*.\n   *\n   * Named nodes correspond to named rules in the grammar, whereas\n   * *anonymous* nodes correspond to string literals in the grammar.\n   */\n  get isNamed() {\n    marshalNode(this);\n    return C._ts_node_is_named_wasm(this.tree[0]) === 1;\n  }\n  /**\n   * Check if this node is *extra*.\n   *\n   * Extra nodes represent things like comments, which are not required\n   * by the grammar, but can appear anywhere.\n   */\n  get isExtra() {\n    marshalNode(this);\n    return C._ts_node_is_extra_wasm(this.tree[0]) === 1;\n  }\n  /**\n   * Check if this node represents a syntax error.\n   *\n   * Syntax errors represent parts of the code that could not be incorporated\n   * into a valid syntax tree.\n   */\n  get isError() {\n    marshalNode(this);\n    return C._ts_node_is_error_wasm(this.tree[0]) === 1;\n  }\n  /**\n   * Check if this node is *missing*.\n   *\n   * Missing nodes are inserted by the parser in order to recover from\n   * certain kinds of syntax errors.\n   */\n  get isMissing() {\n    marshalNode(this);\n    return C._ts_node_is_missing_wasm(this.tree[0]) === 1;\n  }\n  /** Check if this node has been edited. */\n  get hasChanges() {\n    marshalNode(this);\n    return C._ts_node_has_changes_wasm(this.tree[0]) === 1;\n  }\n  /**\n   * Check if this node represents a syntax error or contains any syntax\n   * errors anywhere within it.\n   */\n  get hasError() {\n    marshalNode(this);\n    return C._ts_node_has_error_wasm(this.tree[0]) === 1;\n  }\n  /** Get the byte index where this node ends. */\n  get endIndex() {\n    marshalNode(this);\n    return C._ts_node_end_index_wasm(this.tree[0]);\n  }\n  /** Get the position where this node ends. */\n  get endPosition() {\n    marshalNode(this);\n    C._ts_node_end_point_wasm(this.tree[0]);\n    return unmarshalPoint(TRANSFER_BUFFER);\n  }\n  /** Get the string content of this node. */\n  get text() {\n    return getText(this.tree, this.startIndex, this.endIndex, this.startPosition);\n  }\n  /** Get this node's parse state. */\n  get parseState() {\n    marshalNode(this);\n    return C._ts_node_parse_state_wasm(this.tree[0]);\n  }\n  /** Get the parse state after this node. */\n  get nextParseState() {\n    marshalNode(this);\n    return C._ts_node_next_parse_state_wasm(this.tree[0]);\n  }\n  /** Check if this node is equal to another node. */\n  equals(other) {\n    return this.tree === other.tree && this.id === other.id;\n  }\n  /**\n   * Get the node's child at the given index, where zero represents the first child.\n   *\n   * This method is fairly fast, but its cost is technically log(n), so if\n   * you might be iterating over a long list of children, you should use\n   * {@link Node#children} instead.\n   */\n  child(index) {\n    marshalNode(this);\n    C._ts_node_child_wasm(this.tree[0], index);\n    return unmarshalNode(this.tree);\n  }\n  /**\n   * Get this node's *named* child at the given index.\n   *\n   * See also {@link Node#isNamed}.\n   * This method is fairly fast, but its cost is technically log(n), so if\n   * you might be iterating over a long list of children, you should use\n   * {@link Node#namedChildren} instead.\n   */\n  namedChild(index) {\n    marshalNode(this);\n    C._ts_node_named_child_wasm(this.tree[0], index);\n    return unmarshalNode(this.tree);\n  }\n  /**\n   * Get this node's child with the given numerical field id.\n   *\n   * See also {@link Node#childForFieldName}. You can\n   * convert a field name to an id using {@link Language#fieldIdForName}.\n   */\n  childForFieldId(fieldId) {\n    marshalNode(this);\n    C._ts_node_child_by_field_id_wasm(this.tree[0], fieldId);\n    return unmarshalNode(this.tree);\n  }\n  /**\n   * Get the first child with the given field name.\n   *\n   * If multiple children may have the same field name, access them using\n   * {@link Node#childrenForFieldName}.\n   */\n  childForFieldName(fieldName) {\n    const fieldId = this.tree.language.fields.indexOf(fieldName);\n    if (fieldId !== -1) return this.childForFieldId(fieldId);\n    return null;\n  }\n  /** Get the field name of this node's child at the given index. */\n  fieldNameForChild(index) {\n    marshalNode(this);\n    const address = C._ts_node_field_name_for_child_wasm(this.tree[0], index);\n    if (!address) return null;\n    return C.AsciiToString(address);\n  }\n  /** Get the field name of this node's named child at the given index. */\n  fieldNameForNamedChild(index) {\n    marshalNode(this);\n    const address = C._ts_node_field_name_for_named_child_wasm(this.tree[0], index);\n    if (!address) return null;\n    return C.AsciiToString(address);\n  }\n  /**\n   * Get an array of this node's children with a given field name.\n   *\n   * See also {@link Node#children}.\n   */\n  childrenForFieldName(fieldName) {\n    const fieldId = this.tree.language.fields.indexOf(fieldName);\n    if (fieldId !== -1 && fieldId !== 0) return this.childrenForFieldId(fieldId);\n    return [];\n  }\n  /**\n    * Get an array of this node's children with a given field id.\n    *\n    * See also {@link Node#childrenForFieldName}.\n    */\n  childrenForFieldId(fieldId) {\n    marshalNode(this);\n    C._ts_node_children_by_field_id_wasm(this.tree[0], fieldId);\n    const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const result = new Array(count);\n    if (count > 0) {\n      let address = buffer;\n      for (let i2 = 0; i2 < count; i2++) {\n        result[i2] = unmarshalNode(this.tree, address);\n        address += SIZE_OF_NODE;\n      }\n      C._free(buffer);\n    }\n    return result;\n  }\n  /** Get the node's first child that contains or starts after the given byte offset. */\n  firstChildForIndex(index) {\n    marshalNode(this);\n    const address = TRANSFER_BUFFER + SIZE_OF_NODE;\n    C.setValue(address, index, \"i32\");\n    C._ts_node_first_child_for_byte_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /** Get the node's first named child that contains or starts after the given byte offset. */\n  firstNamedChildForIndex(index) {\n    marshalNode(this);\n    const address = TRANSFER_BUFFER + SIZE_OF_NODE;\n    C.setValue(address, index, \"i32\");\n    C._ts_node_first_named_child_for_byte_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /** Get this node's number of children. */\n  get childCount() {\n    marshalNode(this);\n    return C._ts_node_child_count_wasm(this.tree[0]);\n  }\n  /**\n   * Get this node's number of *named* children.\n   *\n   * See also {@link Node#isNamed}.\n   */\n  get namedChildCount() {\n    marshalNode(this);\n    return C._ts_node_named_child_count_wasm(this.tree[0]);\n  }\n  /** Get this node's first child. */\n  get firstChild() {\n    return this.child(0);\n  }\n  /**\n   * Get this node's first named child.\n   *\n   * See also {@link Node#isNamed}.\n   */\n  get firstNamedChild() {\n    return this.namedChild(0);\n  }\n  /** Get this node's last child. */\n  get lastChild() {\n    return this.child(this.childCount - 1);\n  }\n  /**\n   * Get this node's last named child.\n   *\n   * See also {@link Node#isNamed}.\n   */\n  get lastNamedChild() {\n    return this.namedChild(this.namedChildCount - 1);\n  }\n  /**\n   * Iterate over this node's children.\n   *\n   * If you're walking the tree recursively, you may want to use the\n   * {@link TreeCursor} APIs directly instead.\n   */\n  get children() {\n    if (!this._children) {\n      marshalNode(this);\n      C._ts_node_children_wasm(this.tree[0]);\n      const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n      const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n      this._children = new Array(count);\n      if (count > 0) {\n        let address = buffer;\n        for (let i2 = 0; i2 < count; i2++) {\n          this._children[i2] = unmarshalNode(this.tree, address);\n          address += SIZE_OF_NODE;\n        }\n        C._free(buffer);\n      }\n    }\n    return this._children;\n  }\n  /**\n   * Iterate over this node's named children.\n   *\n   * See also {@link Node#children}.\n   */\n  get namedChildren() {\n    if (!this._namedChildren) {\n      marshalNode(this);\n      C._ts_node_named_children_wasm(this.tree[0]);\n      const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n      const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n      this._namedChildren = new Array(count);\n      if (count > 0) {\n        let address = buffer;\n        for (let i2 = 0; i2 < count; i2++) {\n          this._namedChildren[i2] = unmarshalNode(this.tree, address);\n          address += SIZE_OF_NODE;\n        }\n        C._free(buffer);\n      }\n    }\n    return this._namedChildren;\n  }\n  /**\n   * Get the descendants of this node that are the given type, or in the given types array.\n   *\n   * The types array should contain node type strings, which can be retrieved from {@link Language#types}.\n   *\n   * Additionally, a `startPosition` and `endPosition` can be passed in to restrict the search to a byte range.\n   */\n  descendantsOfType(types, startPosition = ZERO_POINT, endPosition = ZERO_POINT) {\n    if (!Array.isArray(types)) types = [types];\n    const symbols = [];\n    const typesBySymbol = this.tree.language.types;\n    for (const node_type of types) {\n      if (node_type == \"ERROR\") {\n        symbols.push(65535);\n      }\n    }\n    for (let i2 = 0, n = typesBySymbol.length; i2 < n; i2++) {\n      if (types.includes(typesBySymbol[i2])) {\n        symbols.push(i2);\n      }\n    }\n    const symbolsAddress = C._malloc(SIZE_OF_INT * symbols.length);\n    for (let i2 = 0, n = symbols.length; i2 < n; i2++) {\n      C.setValue(symbolsAddress + i2 * SIZE_OF_INT, symbols[i2], \"i32\");\n    }\n    marshalNode(this);\n    C._ts_node_descendants_of_type_wasm(\n      this.tree[0],\n      symbolsAddress,\n      symbols.length,\n      startPosition.row,\n      startPosition.column,\n      endPosition.row,\n      endPosition.column\n    );\n    const descendantCount = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const descendantAddress = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const result = new Array(descendantCount);\n    if (descendantCount > 0) {\n      let address = descendantAddress;\n      for (let i2 = 0; i2 < descendantCount; i2++) {\n        result[i2] = unmarshalNode(this.tree, address);\n        address += SIZE_OF_NODE;\n      }\n    }\n    C._free(descendantAddress);\n    C._free(symbolsAddress);\n    return result;\n  }\n  /** Get this node's next sibling. */\n  get nextSibling() {\n    marshalNode(this);\n    C._ts_node_next_sibling_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /** Get this node's previous sibling. */\n  get previousSibling() {\n    marshalNode(this);\n    C._ts_node_prev_sibling_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /**\n   * Get this node's next *named* sibling.\n   *\n   * See also {@link Node#isNamed}.\n   */\n  get nextNamedSibling() {\n    marshalNode(this);\n    C._ts_node_next_named_sibling_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /**\n   * Get this node's previous *named* sibling.\n   *\n   * See also {@link Node#isNamed}.\n   */\n  get previousNamedSibling() {\n    marshalNode(this);\n    C._ts_node_prev_named_sibling_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /** Get the node's number of descendants, including one for the node itself. */\n  get descendantCount() {\n    marshalNode(this);\n    return C._ts_node_descendant_count_wasm(this.tree[0]);\n  }\n  /**\n   * Get this node's immediate parent.\n   * Prefer {@link Node#childWithDescendant} for iterating over this node's ancestors.\n   */\n  get parent() {\n    marshalNode(this);\n    C._ts_node_parent_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /**\n   * Get the node that contains `descendant`.\n   *\n   * Note that this can return `descendant` itself.\n   */\n  childWithDescendant(descendant) {\n    marshalNode(this);\n    marshalNode(descendant, 1);\n    C._ts_node_child_with_descendant_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /** Get the smallest node within this node that spans the given byte range. */\n  descendantForIndex(start2, end = start2) {\n    if (typeof start2 !== \"number\" || typeof end !== \"number\") {\n      throw new Error(\"Arguments must be numbers\");\n    }\n    marshalNode(this);\n    const address = TRANSFER_BUFFER + SIZE_OF_NODE;\n    C.setValue(address, start2, \"i32\");\n    C.setValue(address + SIZE_OF_INT, end, \"i32\");\n    C._ts_node_descendant_for_index_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /** Get the smallest named node within this node that spans the given byte range. */\n  namedDescendantForIndex(start2, end = start2) {\n    if (typeof start2 !== \"number\" || typeof end !== \"number\") {\n      throw new Error(\"Arguments must be numbers\");\n    }\n    marshalNode(this);\n    const address = TRANSFER_BUFFER + SIZE_OF_NODE;\n    C.setValue(address, start2, \"i32\");\n    C.setValue(address + SIZE_OF_INT, end, \"i32\");\n    C._ts_node_named_descendant_for_index_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /** Get the smallest node within this node that spans the given point range. */\n  descendantForPosition(start2, end = start2) {\n    if (!isPoint(start2) || !isPoint(end)) {\n      throw new Error(\"Arguments must be {row, column} objects\");\n    }\n    marshalNode(this);\n    const address = TRANSFER_BUFFER + SIZE_OF_NODE;\n    marshalPoint(address, start2);\n    marshalPoint(address + SIZE_OF_POINT, end);\n    C._ts_node_descendant_for_position_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /** Get the smallest named node within this node that spans the given point range. */\n  namedDescendantForPosition(start2, end = start2) {\n    if (!isPoint(start2) || !isPoint(end)) {\n      throw new Error(\"Arguments must be {row, column} objects\");\n    }\n    marshalNode(this);\n    const address = TRANSFER_BUFFER + SIZE_OF_NODE;\n    marshalPoint(address, start2);\n    marshalPoint(address + SIZE_OF_POINT, end);\n    C._ts_node_named_descendant_for_position_wasm(this.tree[0]);\n    return unmarshalNode(this.tree);\n  }\n  /**\n   * Create a new {@link TreeCursor} starting from this node.\n   *\n   * Note that the given node is considered the root of the cursor,\n   * and the cursor cannot walk outside this node.\n   */\n  walk() {\n    marshalNode(this);\n    C._ts_tree_cursor_new_wasm(this.tree[0]);\n    return new TreeCursor(INTERNAL, this.tree);\n  }\n  /**\n   * Edit this node to keep it in-sync with source code that has been edited.\n   *\n   * This function is only rarely needed. When you edit a syntax tree with\n   * the {@link Tree#edit} method, all of the nodes that you retrieve from\n   * the tree afterward will already reflect the edit. You only need to\n   * use {@link Node#edit} when you have a specific {@link Node} instance that\n   * you want to keep and continue to use after an edit.\n   */\n  edit(edit) {\n    if (this.startIndex >= edit.oldEndIndex) {\n      this.startIndex = edit.newEndIndex + (this.startIndex - edit.oldEndIndex);\n      let subbedPointRow;\n      let subbedPointColumn;\n      if (this.startPosition.row > edit.oldEndPosition.row) {\n        subbedPointRow = this.startPosition.row - edit.oldEndPosition.row;\n        subbedPointColumn = this.startPosition.column;\n      } else {\n        subbedPointRow = 0;\n        subbedPointColumn = this.startPosition.column;\n        if (this.startPosition.column >= edit.oldEndPosition.column) {\n          subbedPointColumn = this.startPosition.column - edit.oldEndPosition.column;\n        }\n      }\n      if (subbedPointRow > 0) {\n        this.startPosition.row += subbedPointRow;\n        this.startPosition.column = subbedPointColumn;\n      } else {\n        this.startPosition.column += subbedPointColumn;\n      }\n    } else if (this.startIndex > edit.startIndex) {\n      this.startIndex = edit.newEndIndex;\n      this.startPosition.row = edit.newEndPosition.row;\n      this.startPosition.column = edit.newEndPosition.column;\n    }\n  }\n  /** Get the S-expression representation of this node. */\n  toString() {\n    marshalNode(this);\n    const address = C._ts_node_to_string_wasm(this.tree[0]);\n    const result = C.AsciiToString(address);\n    C._free(address);\n    return result;\n  }\n};\n\n// src/marshal.ts\nfunction unmarshalCaptures(query, tree, address, patternIndex, result) {\n  for (let i2 = 0, n = result.length; i2 < n; i2++) {\n    const captureIndex = C.getValue(address, \"i32\");\n    address += SIZE_OF_INT;\n    const node = unmarshalNode(tree, address);\n    address += SIZE_OF_NODE;\n    result[i2] = { patternIndex, name: query.captureNames[captureIndex], node };\n  }\n  return address;\n}\n__name(unmarshalCaptures, \"unmarshalCaptures\");\nfunction marshalNode(node, index = 0) {\n  let address = TRANSFER_BUFFER + index * SIZE_OF_NODE;\n  C.setValue(address, node.id, \"i32\");\n  address += SIZE_OF_INT;\n  C.setValue(address, node.startIndex, \"i32\");\n  address += SIZE_OF_INT;\n  C.setValue(address, node.startPosition.row, \"i32\");\n  address += SIZE_OF_INT;\n  C.setValue(address, node.startPosition.column, \"i32\");\n  address += SIZE_OF_INT;\n  C.setValue(address, node[0], \"i32\");\n}\n__name(marshalNode, \"marshalNode\");\nfunction unmarshalNode(tree, address = TRANSFER_BUFFER) {\n  const id = C.getValue(address, \"i32\");\n  address += SIZE_OF_INT;\n  if (id === 0) return null;\n  const index = C.getValue(address, \"i32\");\n  address += SIZE_OF_INT;\n  const row = C.getValue(address, \"i32\");\n  address += SIZE_OF_INT;\n  const column = C.getValue(address, \"i32\");\n  address += SIZE_OF_INT;\n  const other = C.getValue(address, \"i32\");\n  const result = new Node(INTERNAL, {\n    id,\n    tree,\n    startIndex: index,\n    startPosition: { row, column },\n    other\n  });\n  return result;\n}\n__name(unmarshalNode, \"unmarshalNode\");\nfunction marshalTreeCursor(cursor, address = TRANSFER_BUFFER) {\n  C.setValue(address + 0 * SIZE_OF_INT, cursor[0], \"i32\");\n  C.setValue(address + 1 * SIZE_OF_INT, cursor[1], \"i32\");\n  C.setValue(address + 2 * SIZE_OF_INT, cursor[2], \"i32\");\n  C.setValue(address + 3 * SIZE_OF_INT, cursor[3], \"i32\");\n}\n__name(marshalTreeCursor, \"marshalTreeCursor\");\nfunction unmarshalTreeCursor(cursor) {\n  cursor[0] = C.getValue(TRANSFER_BUFFER + 0 * SIZE_OF_INT, \"i32\");\n  cursor[1] = C.getValue(TRANSFER_BUFFER + 1 * SIZE_OF_INT, \"i32\");\n  cursor[2] = C.getValue(TRANSFER_BUFFER + 2 * SIZE_OF_INT, \"i32\");\n  cursor[3] = C.getValue(TRANSFER_BUFFER + 3 * SIZE_OF_INT, \"i32\");\n}\n__name(unmarshalTreeCursor, \"unmarshalTreeCursor\");\nfunction marshalPoint(address, point) {\n  C.setValue(address, point.row, \"i32\");\n  C.setValue(address + SIZE_OF_INT, point.column, \"i32\");\n}\n__name(marshalPoint, \"marshalPoint\");\nfunction unmarshalPoint(address) {\n  const result = {\n    row: C.getValue(address, \"i32\") >>> 0,\n    column: C.getValue(address + SIZE_OF_INT, \"i32\") >>> 0\n  };\n  return result;\n}\n__name(unmarshalPoint, \"unmarshalPoint\");\nfunction marshalRange(address, range) {\n  marshalPoint(address, range.startPosition);\n  address += SIZE_OF_POINT;\n  marshalPoint(address, range.endPosition);\n  address += SIZE_OF_POINT;\n  C.setValue(address, range.startIndex, \"i32\");\n  address += SIZE_OF_INT;\n  C.setValue(address, range.endIndex, \"i32\");\n  address += SIZE_OF_INT;\n}\n__name(marshalRange, \"marshalRange\");\nfunction unmarshalRange(address) {\n  const result = {};\n  result.startPosition = unmarshalPoint(address);\n  address += SIZE_OF_POINT;\n  result.endPosition = unmarshalPoint(address);\n  address += SIZE_OF_POINT;\n  result.startIndex = C.getValue(address, \"i32\") >>> 0;\n  address += SIZE_OF_INT;\n  result.endIndex = C.getValue(address, \"i32\") >>> 0;\n  return result;\n}\n__name(unmarshalRange, \"unmarshalRange\");\nfunction marshalEdit(edit, address = TRANSFER_BUFFER) {\n  marshalPoint(address, edit.startPosition);\n  address += SIZE_OF_POINT;\n  marshalPoint(address, edit.oldEndPosition);\n  address += SIZE_OF_POINT;\n  marshalPoint(address, edit.newEndPosition);\n  address += SIZE_OF_POINT;\n  C.setValue(address, edit.startIndex, \"i32\");\n  address += SIZE_OF_INT;\n  C.setValue(address, edit.oldEndIndex, \"i32\");\n  address += SIZE_OF_INT;\n  C.setValue(address, edit.newEndIndex, \"i32\");\n  address += SIZE_OF_INT;\n}\n__name(marshalEdit, \"marshalEdit\");\nfunction unmarshalLanguageMetadata(address) {\n  const major_version = C.getValue(address, \"i32\");\n  const minor_version = C.getValue(address += SIZE_OF_INT, \"i32\");\n  const patch_version = C.getValue(address += SIZE_OF_INT, \"i32\");\n  return { major_version, minor_version, patch_version };\n}\n__name(unmarshalLanguageMetadata, \"unmarshalLanguageMetadata\");\n\n// src/query.ts\nvar PREDICATE_STEP_TYPE_CAPTURE = 1;\nvar PREDICATE_STEP_TYPE_STRING = 2;\nvar QUERY_WORD_REGEX = /[\\w-]+/g;\nvar CaptureQuantifier = {\n  Zero: 0,\n  ZeroOrOne: 1,\n  ZeroOrMore: 2,\n  One: 3,\n  OneOrMore: 4\n};\nvar isCaptureStep = /* @__PURE__ */ __name((step) => step.type === \"capture\", \"isCaptureStep\");\nvar isStringStep = /* @__PURE__ */ __name((step) => step.type === \"string\", \"isStringStep\");\nvar QueryErrorKind = {\n  Syntax: 1,\n  NodeName: 2,\n  FieldName: 3,\n  CaptureName: 4,\n  PatternStructure: 5\n};\nvar QueryError = class _QueryError extends Error {\n  constructor(kind, info2, index, length) {\n    super(_QueryError.formatMessage(kind, info2));\n    this.kind = kind;\n    this.info = info2;\n    this.index = index;\n    this.length = length;\n    this.name = \"QueryError\";\n  }\n  static {\n    __name(this, \"QueryError\");\n  }\n  /** Formats an error message based on the error kind and info */\n  static formatMessage(kind, info2) {\n    switch (kind) {\n      case QueryErrorKind.NodeName:\n        return `Bad node name '${info2.word}'`;\n      case QueryErrorKind.FieldName:\n        return `Bad field name '${info2.word}'`;\n      case QueryErrorKind.CaptureName:\n        return `Bad capture name @${info2.word}`;\n      case QueryErrorKind.PatternStructure:\n        return `Bad pattern structure at offset ${info2.suffix}`;\n      case QueryErrorKind.Syntax:\n        return `Bad syntax at offset ${info2.suffix}`;\n    }\n  }\n};\nfunction parseAnyPredicate(steps, index, operator, textPredicates) {\n  if (steps.length !== 3) {\n    throw new Error(\n      `Wrong number of arguments to \\`#${operator}\\` predicate. Expected 2, got ${steps.length - 1}`\n    );\n  }\n  if (!isCaptureStep(steps[1])) {\n    throw new Error(\n      `First argument of \\`#${operator}\\` predicate must be a capture. Got \"${steps[1].value}\"`\n    );\n  }\n  const isPositive = operator === \"eq?\" || operator === \"any-eq?\";\n  const matchAll = !operator.startsWith(\"any-\");\n  if (isCaptureStep(steps[2])) {\n    const captureName1 = steps[1].name;\n    const captureName2 = steps[2].name;\n    textPredicates[index].push((captures) => {\n      const nodes1 = [];\n      const nodes2 = [];\n      for (const c of captures) {\n        if (c.name === captureName1) nodes1.push(c.node);\n        if (c.name === captureName2) nodes2.push(c.node);\n      }\n      const compare = /* @__PURE__ */ __name((n1, n2, positive) => {\n        return positive ? n1.text === n2.text : n1.text !== n2.text;\n      }, \"compare\");\n      return matchAll ? nodes1.every((n1) => nodes2.some((n2) => compare(n1, n2, isPositive))) : nodes1.some((n1) => nodes2.some((n2) => compare(n1, n2, isPositive)));\n    });\n  } else {\n    const captureName = steps[1].name;\n    const stringValue = steps[2].value;\n    const matches = /* @__PURE__ */ __name((n) => n.text === stringValue, \"matches\");\n    const doesNotMatch = /* @__PURE__ */ __name((n) => n.text !== stringValue, \"doesNotMatch\");\n    textPredicates[index].push((captures) => {\n      const nodes = [];\n      for (const c of captures) {\n        if (c.name === captureName) nodes.push(c.node);\n      }\n      const test = isPositive ? matches : doesNotMatch;\n      return matchAll ? nodes.every(test) : nodes.some(test);\n    });\n  }\n}\n__name(parseAnyPredicate, \"parseAnyPredicate\");\nfunction parseMatchPredicate(steps, index, operator, textPredicates) {\n  if (steps.length !== 3) {\n    throw new Error(\n      `Wrong number of arguments to \\`#${operator}\\` predicate. Expected 2, got ${steps.length - 1}.`\n    );\n  }\n  if (steps[1].type !== \"capture\") {\n    throw new Error(\n      `First argument of \\`#${operator}\\` predicate must be a capture. Got \"${steps[1].value}\".`\n    );\n  }\n  if (steps[2].type !== \"string\") {\n    throw new Error(\n      `Second argument of \\`#${operator}\\` predicate must be a string. Got @${steps[2].name}.`\n    );\n  }\n  const isPositive = operator === \"match?\" || operator === \"any-match?\";\n  const matchAll = !operator.startsWith(\"any-\");\n  const captureName = steps[1].name;\n  const regex = new RegExp(steps[2].value);\n  textPredicates[index].push((captures) => {\n    const nodes = [];\n    for (const c of captures) {\n      if (c.name === captureName) nodes.push(c.node.text);\n    }\n    const test = /* @__PURE__ */ __name((text, positive) => {\n      return positive ? regex.test(text) : !regex.test(text);\n    }, \"test\");\n    if (nodes.length === 0) return !isPositive;\n    return matchAll ? nodes.every((text) => test(text, isPositive)) : nodes.some((text) => test(text, isPositive));\n  });\n}\n__name(parseMatchPredicate, \"parseMatchPredicate\");\nfunction parseAnyOfPredicate(steps, index, operator, textPredicates) {\n  if (steps.length < 2) {\n    throw new Error(\n      `Wrong number of arguments to \\`#${operator}\\` predicate. Expected at least 1. Got ${steps.length - 1}.`\n    );\n  }\n  if (steps[1].type !== \"capture\") {\n    throw new Error(\n      `First argument of \\`#${operator}\\` predicate must be a capture. Got \"${steps[1].value}\".`\n    );\n  }\n  const isPositive = operator === \"any-of?\";\n  const captureName = steps[1].name;\n  const stringSteps = steps.slice(2);\n  if (!stringSteps.every(isStringStep)) {\n    throw new Error(\n      `Arguments to \\`#${operator}\\` predicate must be strings.\".`\n    );\n  }\n  const values = stringSteps.map((s) => s.value);\n  textPredicates[index].push((captures) => {\n    const nodes = [];\n    for (const c of captures) {\n      if (c.name === captureName) nodes.push(c.node.text);\n    }\n    if (nodes.length === 0) return !isPositive;\n    return nodes.every((text) => values.includes(text)) === isPositive;\n  });\n}\n__name(parseAnyOfPredicate, \"parseAnyOfPredicate\");\nfunction parseIsPredicate(steps, index, operator, assertedProperties, refutedProperties) {\n  if (steps.length < 2 || steps.length > 3) {\n    throw new Error(\n      `Wrong number of arguments to \\`#${operator}\\` predicate. Expected 1 or 2. Got ${steps.length - 1}.`\n    );\n  }\n  if (!steps.every(isStringStep)) {\n    throw new Error(\n      `Arguments to \\`#${operator}\\` predicate must be strings.\".`\n    );\n  }\n  const properties = operator === \"is?\" ? assertedProperties : refutedProperties;\n  if (!properties[index]) properties[index] = {};\n  properties[index][steps[1].value] = steps[2]?.value ?? null;\n}\n__name(parseIsPredicate, \"parseIsPredicate\");\nfunction parseSetDirective(steps, index, setProperties) {\n  if (steps.length < 2 || steps.length > 3) {\n    throw new Error(`Wrong number of arguments to \\`#set!\\` predicate. Expected 1 or 2. Got ${steps.length - 1}.`);\n  }\n  if (!steps.every(isStringStep)) {\n    throw new Error(`Arguments to \\`#set!\\` predicate must be strings.\".`);\n  }\n  if (!setProperties[index]) setProperties[index] = {};\n  setProperties[index][steps[1].value] = steps[2]?.value ?? null;\n}\n__name(parseSetDirective, \"parseSetDirective\");\nfunction parsePattern(index, stepType, stepValueId, captureNames, stringValues, steps, textPredicates, predicates, setProperties, assertedProperties, refutedProperties) {\n  if (stepType === PREDICATE_STEP_TYPE_CAPTURE) {\n    const name2 = captureNames[stepValueId];\n    steps.push({ type: \"capture\", name: name2 });\n  } else if (stepType === PREDICATE_STEP_TYPE_STRING) {\n    steps.push({ type: \"string\", value: stringValues[stepValueId] });\n  } else if (steps.length > 0) {\n    if (steps[0].type !== \"string\") {\n      throw new Error(\"Predicates must begin with a literal value\");\n    }\n    const operator = steps[0].value;\n    switch (operator) {\n      case \"any-not-eq?\":\n      case \"not-eq?\":\n      case \"any-eq?\":\n      case \"eq?\":\n        parseAnyPredicate(steps, index, operator, textPredicates);\n        break;\n      case \"any-not-match?\":\n      case \"not-match?\":\n      case \"any-match?\":\n      case \"match?\":\n        parseMatchPredicate(steps, index, operator, textPredicates);\n        break;\n      case \"not-any-of?\":\n      case \"any-of?\":\n        parseAnyOfPredicate(steps, index, operator, textPredicates);\n        break;\n      case \"is?\":\n      case \"is-not?\":\n        parseIsPredicate(steps, index, operator, assertedProperties, refutedProperties);\n        break;\n      case \"set!\":\n        parseSetDirective(steps, index, setProperties);\n        break;\n      default:\n        predicates[index].push({ operator, operands: steps.slice(1) });\n    }\n    steps.length = 0;\n  }\n}\n__name(parsePattern, \"parsePattern\");\nvar Query = class {\n  static {\n    __name(this, \"Query\");\n  }\n  /** @internal */\n  [0] = 0;\n  // Internal handle for WASM\n  /** @internal */\n  exceededMatchLimit;\n  /** @internal */\n  textPredicates;\n  /** The names of the captures used in the query. */\n  captureNames;\n  /** The quantifiers of the captures used in the query. */\n  captureQuantifiers;\n  /**\n   * The other user-defined predicates associated with the given index.\n   *\n   * This includes predicates with operators other than:\n   * - `match?`\n   * - `eq?` and `not-eq?`\n   * - `any-of?` and `not-any-of?`\n   * - `is?` and `is-not?`\n   * - `set!`\n   */\n  predicates;\n  /** The properties for predicates with the operator `set!`. */\n  setProperties;\n  /** The properties for predicates with the operator `is?`. */\n  assertedProperties;\n  /** The properties for predicates with the operator `is-not?`. */\n  refutedProperties;\n  /** The maximum number of in-progress matches for this cursor. */\n  matchLimit;\n  /**\n   * Create a new query from a string containing one or more S-expression\n   * patterns.\n   *\n   * The query is associated with a particular language, and can only be run\n   * on syntax nodes parsed with that language. References to Queries can be\n   * shared between multiple threads.\n   *\n   * @link {@see https://tree-sitter.github.io/tree-sitter/using-parsers/queries}\n   */\n  constructor(language, source) {\n    const sourceLength = C.lengthBytesUTF8(source);\n    const sourceAddress = C._malloc(sourceLength + 1);\n    C.stringToUTF8(source, sourceAddress, sourceLength + 1);\n    const address = C._ts_query_new(\n      language[0],\n      sourceAddress,\n      sourceLength,\n      TRANSFER_BUFFER,\n      TRANSFER_BUFFER + SIZE_OF_INT\n    );\n    if (!address) {\n      const errorId = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n      const errorByte = C.getValue(TRANSFER_BUFFER, \"i32\");\n      const errorIndex = C.UTF8ToString(sourceAddress, errorByte).length;\n      const suffix = source.slice(errorIndex, errorIndex + 100).split(\"\\n\")[0];\n      const word = suffix.match(QUERY_WORD_REGEX)?.[0] ?? \"\";\n      C._free(sourceAddress);\n      switch (errorId) {\n        case QueryErrorKind.Syntax:\n          throw new QueryError(QueryErrorKind.Syntax, { suffix: `${errorIndex}: '${suffix}'...` }, errorIndex, 0);\n        case QueryErrorKind.NodeName:\n          throw new QueryError(errorId, { word }, errorIndex, word.length);\n        case QueryErrorKind.FieldName:\n          throw new QueryError(errorId, { word }, errorIndex, word.length);\n        case QueryErrorKind.CaptureName:\n          throw new QueryError(errorId, { word }, errorIndex, word.length);\n        case QueryErrorKind.PatternStructure:\n          throw new QueryError(errorId, { suffix: `${errorIndex}: '${suffix}'...` }, errorIndex, 0);\n      }\n    }\n    const stringCount = C._ts_query_string_count(address);\n    const captureCount = C._ts_query_capture_count(address);\n    const patternCount = C._ts_query_pattern_count(address);\n    const captureNames = new Array(captureCount);\n    const captureQuantifiers = new Array(patternCount);\n    const stringValues = new Array(stringCount);\n    for (let i2 = 0; i2 < captureCount; i2++) {\n      const nameAddress = C._ts_query_capture_name_for_id(\n        address,\n        i2,\n        TRANSFER_BUFFER\n      );\n      const nameLength = C.getValue(TRANSFER_BUFFER, \"i32\");\n      captureNames[i2] = C.UTF8ToString(nameAddress, nameLength);\n    }\n    for (let i2 = 0; i2 < patternCount; i2++) {\n      const captureQuantifiersArray = new Array(captureCount);\n      for (let j = 0; j < captureCount; j++) {\n        const quantifier = C._ts_query_capture_quantifier_for_id(address, i2, j);\n        captureQuantifiersArray[j] = quantifier;\n      }\n      captureQuantifiers[i2] = captureQuantifiersArray;\n    }\n    for (let i2 = 0; i2 < stringCount; i2++) {\n      const valueAddress = C._ts_query_string_value_for_id(\n        address,\n        i2,\n        TRANSFER_BUFFER\n      );\n      const nameLength = C.getValue(TRANSFER_BUFFER, \"i32\");\n      stringValues[i2] = C.UTF8ToString(valueAddress, nameLength);\n    }\n    const setProperties = new Array(patternCount);\n    const assertedProperties = new Array(patternCount);\n    const refutedProperties = new Array(patternCount);\n    const predicates = new Array(patternCount);\n    const textPredicates = new Array(patternCount);\n    for (let i2 = 0; i2 < patternCount; i2++) {\n      const predicatesAddress = C._ts_query_predicates_for_pattern(address, i2, TRANSFER_BUFFER);\n      const stepCount = C.getValue(TRANSFER_BUFFER, \"i32\");\n      predicates[i2] = [];\n      textPredicates[i2] = [];\n      const steps = new Array();\n      let stepAddress = predicatesAddress;\n      for (let j = 0; j < stepCount; j++) {\n        const stepType = C.getValue(stepAddress, \"i32\");\n        stepAddress += SIZE_OF_INT;\n        const stepValueId = C.getValue(stepAddress, \"i32\");\n        stepAddress += SIZE_OF_INT;\n        parsePattern(\n          i2,\n          stepType,\n          stepValueId,\n          captureNames,\n          stringValues,\n          steps,\n          textPredicates,\n          predicates,\n          setProperties,\n          assertedProperties,\n          refutedProperties\n        );\n      }\n      Object.freeze(textPredicates[i2]);\n      Object.freeze(predicates[i2]);\n      Object.freeze(setProperties[i2]);\n      Object.freeze(assertedProperties[i2]);\n      Object.freeze(refutedProperties[i2]);\n    }\n    C._free(sourceAddress);\n    this[0] = address;\n    this.captureNames = captureNames;\n    this.captureQuantifiers = captureQuantifiers;\n    this.textPredicates = textPredicates;\n    this.predicates = predicates;\n    this.setProperties = setProperties;\n    this.assertedProperties = assertedProperties;\n    this.refutedProperties = refutedProperties;\n    this.exceededMatchLimit = false;\n  }\n  /** Delete the query, freeing its resources. */\n  delete() {\n    C._ts_query_delete(this[0]);\n    this[0] = 0;\n  }\n  /**\n   * Iterate over all of the matches in the order that they were found.\n   *\n   * Each match contains the index of the pattern that matched, and a list of\n   * captures. Because multiple patterns can match the same set of nodes,\n   * one match may contain captures that appear *before* some of the\n   * captures from a previous match.\n   *\n   * @param {Node} node - The node to execute the query on.\n   *\n   * @param {QueryOptions} options - Options for query execution.\n   */\n  matches(node, options = {}) {\n    const startPosition = options.startPosition ?? ZERO_POINT;\n    const endPosition = options.endPosition ?? ZERO_POINT;\n    const startIndex = options.startIndex ?? 0;\n    const endIndex = options.endIndex ?? 0;\n    const matchLimit = options.matchLimit ?? 4294967295;\n    const maxStartDepth = options.maxStartDepth ?? 4294967295;\n    const timeoutMicros = options.timeoutMicros ?? 0;\n    const progressCallback = options.progressCallback;\n    if (typeof matchLimit !== \"number\") {\n      throw new Error(\"Arguments must be numbers\");\n    }\n    this.matchLimit = matchLimit;\n    if (endIndex !== 0 && startIndex > endIndex) {\n      throw new Error(\"`startIndex` cannot be greater than `endIndex`\");\n    }\n    if (endPosition !== ZERO_POINT && (startPosition.row > endPosition.row || startPosition.row === endPosition.row && startPosition.column > endPosition.column)) {\n      throw new Error(\"`startPosition` cannot be greater than `endPosition`\");\n    }\n    if (progressCallback) {\n      C.currentQueryProgressCallback = progressCallback;\n    }\n    marshalNode(node);\n    C._ts_query_matches_wasm(\n      this[0],\n      node.tree[0],\n      startPosition.row,\n      startPosition.column,\n      endPosition.row,\n      endPosition.column,\n      startIndex,\n      endIndex,\n      matchLimit,\n      maxStartDepth,\n      timeoutMicros\n    );\n    const rawCount = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const startAddress = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const didExceedMatchLimit = C.getValue(TRANSFER_BUFFER + 2 * SIZE_OF_INT, \"i32\");\n    const result = new Array(rawCount);\n    this.exceededMatchLimit = Boolean(didExceedMatchLimit);\n    let filteredCount = 0;\n    let address = startAddress;\n    for (let i2 = 0; i2 < rawCount; i2++) {\n      const patternIndex = C.getValue(address, \"i32\");\n      address += SIZE_OF_INT;\n      const captureCount = C.getValue(address, \"i32\");\n      address += SIZE_OF_INT;\n      const captures = new Array(captureCount);\n      address = unmarshalCaptures(this, node.tree, address, patternIndex, captures);\n      if (this.textPredicates[patternIndex].every((p) => p(captures))) {\n        result[filteredCount] = { pattern: patternIndex, patternIndex, captures };\n        const setProperties = this.setProperties[patternIndex];\n        result[filteredCount].setProperties = setProperties;\n        const assertedProperties = this.assertedProperties[patternIndex];\n        result[filteredCount].assertedProperties = assertedProperties;\n        const refutedProperties = this.refutedProperties[patternIndex];\n        result[filteredCount].refutedProperties = refutedProperties;\n        filteredCount++;\n      }\n    }\n    result.length = filteredCount;\n    C._free(startAddress);\n    C.currentQueryProgressCallback = null;\n    return result;\n  }\n  /**\n   * Iterate over all of the individual captures in the order that they\n   * appear.\n   *\n   * This is useful if you don't care about which pattern matched, and just\n   * want a single, ordered sequence of captures.\n   *\n   * @param {Node} node - The node to execute the query on.\n   *\n   * @param {QueryOptions} options - Options for query execution.\n   */\n  captures(node, options = {}) {\n    const startPosition = options.startPosition ?? ZERO_POINT;\n    const endPosition = options.endPosition ?? ZERO_POINT;\n    const startIndex = options.startIndex ?? 0;\n    const endIndex = options.endIndex ?? 0;\n    const matchLimit = options.matchLimit ?? 4294967295;\n    const maxStartDepth = options.maxStartDepth ?? 4294967295;\n    const timeoutMicros = options.timeoutMicros ?? 0;\n    const progressCallback = options.progressCallback;\n    if (typeof matchLimit !== \"number\") {\n      throw new Error(\"Arguments must be numbers\");\n    }\n    this.matchLimit = matchLimit;\n    if (endIndex !== 0 && startIndex > endIndex) {\n      throw new Error(\"`startIndex` cannot be greater than `endIndex`\");\n    }\n    if (endPosition !== ZERO_POINT && (startPosition.row > endPosition.row || startPosition.row === endPosition.row && startPosition.column > endPosition.column)) {\n      throw new Error(\"`startPosition` cannot be greater than `endPosition`\");\n    }\n    if (progressCallback) {\n      C.currentQueryProgressCallback = progressCallback;\n    }\n    marshalNode(node);\n    C._ts_query_captures_wasm(\n      this[0],\n      node.tree[0],\n      startPosition.row,\n      startPosition.column,\n      endPosition.row,\n      endPosition.column,\n      startIndex,\n      endIndex,\n      matchLimit,\n      maxStartDepth,\n      timeoutMicros\n    );\n    const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const startAddress = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const didExceedMatchLimit = C.getValue(TRANSFER_BUFFER + 2 * SIZE_OF_INT, \"i32\");\n    const result = new Array();\n    this.exceededMatchLimit = Boolean(didExceedMatchLimit);\n    const captures = new Array();\n    let address = startAddress;\n    for (let i2 = 0; i2 < count; i2++) {\n      const patternIndex = C.getValue(address, \"i32\");\n      address += SIZE_OF_INT;\n      const captureCount = C.getValue(address, \"i32\");\n      address += SIZE_OF_INT;\n      const captureIndex = C.getValue(address, \"i32\");\n      address += SIZE_OF_INT;\n      captures.length = captureCount;\n      address = unmarshalCaptures(this, node.tree, address, patternIndex, captures);\n      if (this.textPredicates[patternIndex].every((p) => p(captures))) {\n        const capture = captures[captureIndex];\n        const setProperties = this.setProperties[patternIndex];\n        capture.setProperties = setProperties;\n        const assertedProperties = this.assertedProperties[patternIndex];\n        capture.assertedProperties = assertedProperties;\n        const refutedProperties = this.refutedProperties[patternIndex];\n        capture.refutedProperties = refutedProperties;\n        result.push(capture);\n      }\n    }\n    C._free(startAddress);\n    C.currentQueryProgressCallback = null;\n    return result;\n  }\n  /** Get the predicates for a given pattern. */\n  predicatesForPattern(patternIndex) {\n    return this.predicates[patternIndex];\n  }\n  /**\n   * Disable a certain capture within a query.\n   *\n   * This prevents the capture from being returned in matches, and also\n   * avoids any resource usage associated with recording the capture.\n   */\n  disableCapture(captureName) {\n    const captureNameLength = C.lengthBytesUTF8(captureName);\n    const captureNameAddress = C._malloc(captureNameLength + 1);\n    C.stringToUTF8(captureName, captureNameAddress, captureNameLength + 1);\n    C._ts_query_disable_capture(this[0], captureNameAddress, captureNameLength);\n    C._free(captureNameAddress);\n  }\n  /**\n   * Disable a certain pattern within a query.\n   *\n   * This prevents the pattern from matching, and also avoids any resource\n   * usage associated with the pattern. This throws an error if the pattern\n   * index is out of bounds.\n   */\n  disablePattern(patternIndex) {\n    if (patternIndex >= this.predicates.length) {\n      throw new Error(\n        `Pattern index is ${patternIndex} but the pattern count is ${this.predicates.length}`\n      );\n    }\n    C._ts_query_disable_pattern(this[0], patternIndex);\n  }\n  /**\n   * Check if, on its last execution, this cursor exceeded its maximum number\n   * of in-progress matches.\n   */\n  didExceedMatchLimit() {\n    return this.exceededMatchLimit;\n  }\n  /** Get the byte offset where the given pattern starts in the query's source. */\n  startIndexForPattern(patternIndex) {\n    if (patternIndex >= this.predicates.length) {\n      throw new Error(\n        `Pattern index is ${patternIndex} but the pattern count is ${this.predicates.length}`\n      );\n    }\n    return C._ts_query_start_byte_for_pattern(this[0], patternIndex);\n  }\n  /** Get the byte offset where the given pattern ends in the query's source. */\n  endIndexForPattern(patternIndex) {\n    if (patternIndex >= this.predicates.length) {\n      throw new Error(\n        `Pattern index is ${patternIndex} but the pattern count is ${this.predicates.length}`\n      );\n    }\n    return C._ts_query_end_byte_for_pattern(this[0], patternIndex);\n  }\n  /** Get the number of patterns in the query. */\n  patternCount() {\n    return C._ts_query_pattern_count(this[0]);\n  }\n  /** Get the index for a given capture name. */\n  captureIndexForName(captureName) {\n    return this.captureNames.indexOf(captureName);\n  }\n  /** Check if a given pattern within a query has a single root node. */\n  isPatternRooted(patternIndex) {\n    return C._ts_query_is_pattern_rooted(this[0], patternIndex) === 1;\n  }\n  /** Check if a given pattern within a query has a single root node. */\n  isPatternNonLocal(patternIndex) {\n    return C._ts_query_is_pattern_non_local(this[0], patternIndex) === 1;\n  }\n  /**\n   * Check if a given step in a query is 'definite'.\n   *\n   * A query step is 'definite' if its parent pattern will be guaranteed to\n   * match successfully once it reaches the step.\n   */\n  isPatternGuaranteedAtStep(byteIndex) {\n    return C._ts_query_is_pattern_guaranteed_at_step(this[0], byteIndex) === 1;\n  }\n};\n\n// src/language.ts\nvar LANGUAGE_FUNCTION_REGEX = /^tree_sitter_\\w+$/;\nvar Language = class _Language {\n  static {\n    __name(this, \"Language\");\n  }\n  /** @internal */\n  [0] = 0;\n  // Internal handle for WASM\n  /**\n   * A list of all node types in the language. The index of each type in this\n   * array is its node type id.\n   */\n  types;\n  /**\n   * A list of all field names in the language. The index of each field name in\n   * this array is its field id.\n   */\n  fields;\n  /** @internal */\n  constructor(internal, address) {\n    assertInternal(internal);\n    this[0] = address;\n    this.types = new Array(C._ts_language_symbol_count(this[0]));\n    for (let i2 = 0, n = this.types.length; i2 < n; i2++) {\n      if (C._ts_language_symbol_type(this[0], i2) < 2) {\n        this.types[i2] = C.UTF8ToString(C._ts_language_symbol_name(this[0], i2));\n      }\n    }\n    this.fields = new Array(C._ts_language_field_count(this[0]) + 1);\n    for (let i2 = 0, n = this.fields.length; i2 < n; i2++) {\n      const fieldName = C._ts_language_field_name_for_id(this[0], i2);\n      if (fieldName !== 0) {\n        this.fields[i2] = C.UTF8ToString(fieldName);\n      } else {\n        this.fields[i2] = null;\n      }\n    }\n  }\n  /**\n   * Gets the name of the language.\n   */\n  get name() {\n    const ptr = C._ts_language_name(this[0]);\n    if (ptr === 0) return null;\n    return C.UTF8ToString(ptr);\n  }\n  /**\n   * @deprecated since version 0.25.0, use {@link Language#abiVersion} instead\n   * Gets the version of the language.\n   */\n  get version() {\n    return C._ts_language_version(this[0]);\n  }\n  /**\n   * Gets the ABI version of the language.\n   */\n  get abiVersion() {\n    return C._ts_language_abi_version(this[0]);\n  }\n  /**\n  * Get the metadata for this language. This information is generated by the\n  * CLI, and relies on the language author providing the correct metadata in\n  * the language's `tree-sitter.json` file.\n  */\n  get metadata() {\n    C._ts_language_metadata(this[0]);\n    const length = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const address = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    if (length === 0) return null;\n    return unmarshalLanguageMetadata(address);\n  }\n  /**\n   * Gets the number of fields in the language.\n   */\n  get fieldCount() {\n    return this.fields.length - 1;\n  }\n  /**\n   * Gets the number of states in the language.\n   */\n  get stateCount() {\n    return C._ts_language_state_count(this[0]);\n  }\n  /**\n   * Get the field id for a field name.\n   */\n  fieldIdForName(fieldName) {\n    const result = this.fields.indexOf(fieldName);\n    return result !== -1 ? result : null;\n  }\n  /**\n   * Get the field name for a field id.\n   */\n  fieldNameForId(fieldId) {\n    return this.fields[fieldId] ?? null;\n  }\n  /**\n   * Get the node type id for a node type name.\n   */\n  idForNodeType(type, named) {\n    const typeLength = C.lengthBytesUTF8(type);\n    const typeAddress = C._malloc(typeLength + 1);\n    C.stringToUTF8(type, typeAddress, typeLength + 1);\n    const result = C._ts_language_symbol_for_name(this[0], typeAddress, typeLength, named ? 1 : 0);\n    C._free(typeAddress);\n    return result || null;\n  }\n  /**\n   * Gets the number of node types in the language.\n   */\n  get nodeTypeCount() {\n    return C._ts_language_symbol_count(this[0]);\n  }\n  /**\n   * Get the node type name for a node type id.\n   */\n  nodeTypeForId(typeId) {\n    const name2 = C._ts_language_symbol_name(this[0], typeId);\n    return name2 ? C.UTF8ToString(name2) : null;\n  }\n  /**\n   * Check if a node type is named.\n   *\n   * @see {@link https://tree-sitter.github.io/tree-sitter/using-parsers/2-basic-parsing.html#named-vs-anonymous-nodes}\n   */\n  nodeTypeIsNamed(typeId) {\n    return C._ts_language_type_is_named_wasm(this[0], typeId) ? true : false;\n  }\n  /**\n   * Check if a node type is visible.\n   */\n  nodeTypeIsVisible(typeId) {\n    return C._ts_language_type_is_visible_wasm(this[0], typeId) ? true : false;\n  }\n  /**\n   * Get the supertypes ids of this language.\n   *\n   * @see {@link https://tree-sitter.github.io/tree-sitter/using-parsers/6-static-node-types.html?highlight=supertype#supertype-nodes}\n   */\n  get supertypes() {\n    C._ts_language_supertypes_wasm(this[0]);\n    const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const result = new Array(count);\n    if (count > 0) {\n      let address = buffer;\n      for (let i2 = 0; i2 < count; i2++) {\n        result[i2] = C.getValue(address, \"i16\");\n        address += SIZE_OF_SHORT;\n      }\n    }\n    return result;\n  }\n  /**\n   * Get the subtype ids for a given supertype node id.\n   */\n  subtypes(supertype) {\n    C._ts_language_subtypes_wasm(this[0], supertype);\n    const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const result = new Array(count);\n    if (count > 0) {\n      let address = buffer;\n      for (let i2 = 0; i2 < count; i2++) {\n        result[i2] = C.getValue(address, \"i16\");\n        address += SIZE_OF_SHORT;\n      }\n    }\n    return result;\n  }\n  /**\n   * Get the next state id for a given state id and node type id.\n   */\n  nextState(stateId, typeId) {\n    return C._ts_language_next_state(this[0], stateId, typeId);\n  }\n  /**\n   * Create a new lookahead iterator for this language and parse state.\n   *\n   * This returns `null` if state is invalid for this language.\n   *\n   * Iterating {@link LookaheadIterator} will yield valid symbols in the given\n   * parse state. Newly created lookahead iterators will return the `ERROR`\n   * symbol from {@link LookaheadIterator#currentType}.\n   *\n   * Lookahead iterators can be useful for generating suggestions and improving\n   * syntax error diagnostics. To get symbols valid in an `ERROR` node, use the\n   * lookahead iterator on its first leaf node state. For `MISSING` nodes, a\n   * lookahead iterator created on the previous non-extra leaf node may be\n   * appropriate.\n   */\n  lookaheadIterator(stateId) {\n    const address = C._ts_lookahead_iterator_new(this[0], stateId);\n    if (address) return new LookaheadIterator(INTERNAL, address, this);\n    return null;\n  }\n  /**\n   * @deprecated since version 0.25.0, call `new` on a {@link Query} instead\n   *\n   * Create a new query from a string containing one or more S-expression\n   * patterns.\n   *\n   * The query is associated with a particular language, and can only be run\n   * on syntax nodes parsed with that language. References to Queries can be\n   * shared between multiple threads.\n   *\n   * @link {@see https://tree-sitter.github.io/tree-sitter/using-parsers/queries}\n   */\n  query(source) {\n    console.warn(\"Language.query is deprecated. Use new Query(language, source) instead.\");\n    return new Query(this, source);\n  }\n  /**\n   * Load a language from a WebAssembly module.\n   * The module can be provided as a path to a file or as a buffer.\n   */\n  static async load(input) {\n    let bytes;\n    if (input instanceof Uint8Array) {\n      bytes = Promise.resolve(input);\n    } else {\n      if (globalThis.process?.versions.node) {\n        const fs2 = await import(\"fs/promises\");\n        bytes = fs2.readFile(input);\n      } else {\n        bytes = fetch(input).then((response) => response.arrayBuffer().then((buffer) => {\n          if (response.ok) {\n            return new Uint8Array(buffer);\n          } else {\n            const body2 = new TextDecoder(\"utf-8\").decode(buffer);\n            throw new Error(`Language.load failed with status ${response.status}.\n\n${body2}`);\n          }\n        }));\n      }\n    }\n    const mod = await C.loadWebAssemblyModule(await bytes, { loadAsync: true });\n    const symbolNames = Object.keys(mod);\n    const functionName = symbolNames.find((key) => LANGUAGE_FUNCTION_REGEX.test(key) && !key.includes(\"external_scanner_\"));\n    if (!functionName) {\n      console.log(`Couldn't find language function in WASM file. Symbols:\n${JSON.stringify(symbolNames, null, 2)}`);\n      throw new Error(\"Language.load failed: no language function found in WASM file\");\n    }\n    const languageAddress = mod[functionName]();\n    return new _Language(INTERNAL, languageAddress);\n  }\n};\n\n// lib/tree-sitter.mjs\nvar Module2 = (() => {\n  var _scriptName = import.meta.url;\n  return async function(moduleArg = {}) {\n    var moduleRtn;\n    var Module = moduleArg;\n    var readyPromiseResolve, readyPromiseReject;\n    var readyPromise = new Promise((resolve, reject) => {\n      readyPromiseResolve = resolve;\n      readyPromiseReject = reject;\n    });\n    var ENVIRONMENT_IS_WEB = typeof window == \"object\";\n    var ENVIRONMENT_IS_WORKER = typeof WorkerGlobalScope != \"undefined\";\n    var ENVIRONMENT_IS_NODE = typeof process == \"object\" && typeof process.versions == \"object\" && typeof process.versions.node == \"string\" && process.type != \"renderer\";\n    var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;\n    if (ENVIRONMENT_IS_NODE) {\n      const { createRequire } = await import(\"module\");\n      var require = createRequire(import.meta.url);\n    }\n    Module.currentQueryProgressCallback = null;\n    Module.currentProgressCallback = null;\n    Module.currentLogCallback = null;\n    Module.currentParseCallback = null;\n    var moduleOverrides = Object.assign({}, Module);\n    var arguments_ = [];\n    var thisProgram = \"./this.program\";\n    var quit_ = /* @__PURE__ */ __name((status, toThrow) => {\n      throw toThrow;\n    }, \"quit_\");\n    var scriptDirectory = \"\";\n    function locateFile(path) {\n      if (Module[\"locateFile\"]) {\n        return Module[\"locateFile\"](path, scriptDirectory);\n      }\n      return scriptDirectory + path;\n    }\n    __name(locateFile, \"locateFile\");\n    var readAsync, readBinary;\n    if (ENVIRONMENT_IS_NODE) {\n      var fs = require(\"fs\");\n      var nodePath = require(\"path\");\n      if (!import.meta.url.startsWith(\"data:\")) {\n        scriptDirectory = nodePath.dirname(require(\"url\").fileURLToPath(import.meta.url)) + \"/\";\n      }\n      readBinary = /* @__PURE__ */ __name((filename) => {\n        filename = isFileURI(filename) ? new URL(filename) : filename;\n        var ret = fs.readFileSync(filename);\n        return ret;\n      }, \"readBinary\");\n      readAsync = /* @__PURE__ */ __name(async (filename, binary2 = true) => {\n        filename = isFileURI(filename) ? new URL(filename) : filename;\n        var ret = fs.readFileSync(filename, binary2 ? void 0 : \"utf8\");\n        return ret;\n      }, \"readAsync\");\n      if (!Module[\"thisProgram\"] && process.argv.length > 1) {\n        thisProgram = process.argv[1].replace(/\\\\/g, \"/\");\n      }\n      arguments_ = process.argv.slice(2);\n      quit_ = /* @__PURE__ */ __name((status, toThrow) => {\n        process.exitCode = status;\n        throw toThrow;\n      }, \"quit_\");\n    } else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {\n      if (ENVIRONMENT_IS_WORKER) {\n        scriptDirectory = self.location.href;\n      } else if (typeof document != \"undefined\" && document.currentScript) {\n        scriptDirectory = document.currentScript.src;\n      }\n      if (_scriptName) {\n        scriptDirectory = _scriptName;\n      }\n      if (scriptDirectory.startsWith(\"blob:\")) {\n        scriptDirectory = \"\";\n      } else {\n        scriptDirectory = scriptDirectory.slice(0, scriptDirectory.replace(/[?#].*/, \"\").lastIndexOf(\"/\") + 1);\n      }\n      {\n        if (ENVIRONMENT_IS_WORKER) {\n          readBinary = /* @__PURE__ */ __name((url) => {\n            var xhr = new XMLHttpRequest();\n            xhr.open(\"GET\", url, false);\n            xhr.responseType = \"arraybuffer\";\n            xhr.send(null);\n            return new Uint8Array(\n              /** @type{!ArrayBuffer} */\n              xhr.response\n            );\n          }, \"readBinary\");\n        }\n        readAsync = /* @__PURE__ */ __name(async (url) => {\n          if (isFileURI(url)) {\n            return new Promise((resolve, reject) => {\n              var xhr = new XMLHttpRequest();\n              xhr.open(\"GET\", url, true);\n              xhr.responseType = \"arraybuffer\";\n              xhr.onload = () => {\n                if (xhr.status == 200 || xhr.status == 0 && xhr.response) {\n                  resolve(xhr.response);\n                  return;\n                }\n                reject(xhr.status);\n              };\n              xhr.onerror = reject;\n              xhr.send(null);\n            });\n          }\n          var response = await fetch(url, {\n            credentials: \"same-origin\"\n          });\n          if (response.ok) {\n            return response.arrayBuffer();\n          }\n          throw new Error(response.status + \" : \" + response.url);\n        }, \"readAsync\");\n      }\n    } else {\n    }\n    var out = Module[\"print\"] || console.log.bind(console);\n    var err = Module[\"printErr\"] || console.error.bind(console);\n    Object.assign(Module, moduleOverrides);\n    moduleOverrides = null;\n    if (Module[\"arguments\"]) arguments_ = Module[\"arguments\"];\n    if (Module[\"thisProgram\"]) thisProgram = Module[\"thisProgram\"];\n    var dynamicLibraries = Module[\"dynamicLibraries\"] || [];\n    var wasmBinary = Module[\"wasmBinary\"];\n    var wasmMemory;\n    var ABORT = false;\n    var EXITSTATUS;\n    function assert(condition, text) {\n      if (!condition) {\n        abort(text);\n      }\n    }\n    __name(assert, \"assert\");\n    var HEAP, HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAP64, HEAPU64, HEAPF64;\n    var HEAP_DATA_VIEW;\n    var runtimeInitialized = false;\n    var isFileURI = /* @__PURE__ */ __name((filename) => filename.startsWith(\"file://\"), \"isFileURI\");\n    function updateMemoryViews() {\n      var b = wasmMemory.buffer;\n      Module[\"HEAP_DATA_VIEW\"] = HEAP_DATA_VIEW = new DataView(b);\n      Module[\"HEAP8\"] = HEAP8 = new Int8Array(b);\n      Module[\"HEAP16\"] = HEAP16 = new Int16Array(b);\n      Module[\"HEAPU8\"] = HEAPU8 = new Uint8Array(b);\n      Module[\"HEAPU16\"] = HEAPU16 = new Uint16Array(b);\n      Module[\"HEAP32\"] = HEAP32 = new Int32Array(b);\n      Module[\"HEAPU32\"] = HEAPU32 = new Uint32Array(b);\n      Module[\"HEAPF32\"] = HEAPF32 = new Float32Array(b);\n      Module[\"HEAPF64\"] = HEAPF64 = new Float64Array(b);\n      Module[\"HEAP64\"] = HEAP64 = new BigInt64Array(b);\n      Module[\"HEAPU64\"] = HEAPU64 = new BigUint64Array(b);\n    }\n    __name(updateMemoryViews, \"updateMemoryViews\");\n    if (Module[\"wasmMemory\"]) {\n      wasmMemory = Module[\"wasmMemory\"];\n    } else {\n      var INITIAL_MEMORY = Module[\"INITIAL_MEMORY\"] || 33554432;\n      wasmMemory = new WebAssembly.Memory({\n        \"initial\": INITIAL_MEMORY / 65536,\n        // In theory we should not need to emit the maximum if we want \"unlimited\"\n        // or 4GB of memory, but VMs error on that atm, see\n        // https://github.com/emscripten-core/emscripten/issues/14130\n        // And in the pthreads case we definitely need to emit a maximum. So\n        // always emit one.\n        \"maximum\": 32768\n      });\n    }\n    updateMemoryViews();\n    var __RELOC_FUNCS__ = [];\n    function preRun() {\n      if (Module[\"preRun\"]) {\n        if (typeof Module[\"preRun\"] == \"function\") Module[\"preRun\"] = [Module[\"preRun\"]];\n        while (Module[\"preRun\"].length) {\n          addOnPreRun(Module[\"preRun\"].shift());\n        }\n      }\n      callRuntimeCallbacks(onPreRuns);\n    }\n    __name(preRun, \"preRun\");\n    function initRuntime() {\n      runtimeInitialized = true;\n      callRuntimeCallbacks(__RELOC_FUNCS__);\n      wasmExports[\"__wasm_call_ctors\"]();\n      callRuntimeCallbacks(onPostCtors);\n    }\n    __name(initRuntime, \"initRuntime\");\n    function preMain() {\n    }\n    __name(preMain, \"preMain\");\n    function postRun() {\n      if (Module[\"postRun\"]) {\n        if (typeof Module[\"postRun\"] == \"function\") Module[\"postRun\"] = [Module[\"postRun\"]];\n        while (Module[\"postRun\"].length) {\n          addOnPostRun(Module[\"postRun\"].shift());\n        }\n      }\n      callRuntimeCallbacks(onPostRuns);\n    }\n    __name(postRun, \"postRun\");\n    var runDependencies = 0;\n    var dependenciesFulfilled = null;\n    function getUniqueRunDependency(id) {\n      return id;\n    }\n    __name(getUniqueRunDependency, \"getUniqueRunDependency\");\n    function addRunDependency(id) {\n      runDependencies++;\n      Module[\"monitorRunDependencies\"]?.(runDependencies);\n    }\n    __name(addRunDependency, \"addRunDependency\");\n    function removeRunDependency(id) {\n      runDependencies--;\n      Module[\"monitorRunDependencies\"]?.(runDependencies);\n      if (runDependencies == 0) {\n        if (dependenciesFulfilled) {\n          var callback = dependenciesFulfilled;\n          dependenciesFulfilled = null;\n          callback();\n        }\n      }\n    }\n    __name(removeRunDependency, \"removeRunDependency\");\n    function abort(what) {\n      Module[\"onAbort\"]?.(what);\n      what = \"Aborted(\" + what + \")\";\n      err(what);\n      ABORT = true;\n      what += \". Build with -sASSERTIONS for more info.\";\n      var e = new WebAssembly.RuntimeError(what);\n      readyPromiseReject(e);\n      throw e;\n    }\n    __name(abort, \"abort\");\n    var wasmBinaryFile;\n    function findWasmBinary() {\n      if (Module[\"locateFile\"]) {\n        return locateFile(\"tree-sitter.wasm\");\n      }\n      return new URL(\"tree-sitter.wasm\", import.meta.url).href;\n    }\n    __name(findWasmBinary, \"findWasmBinary\");\n    function getBinarySync(file) {\n      if (file == wasmBinaryFile && wasmBinary) {\n        return new Uint8Array(wasmBinary);\n      }\n      if (readBinary) {\n        return readBinary(file);\n      }\n      throw \"both async and sync fetching of the wasm failed\";\n    }\n    __name(getBinarySync, \"getBinarySync\");\n    async function getWasmBinary(binaryFile) {\n      if (!wasmBinary) {\n        try {\n          var response = await readAsync(binaryFile);\n          return new Uint8Array(response);\n        } catch {\n        }\n      }\n      return getBinarySync(binaryFile);\n    }\n    __name(getWasmBinary, \"getWasmBinary\");\n    async function instantiateArrayBuffer(binaryFile, imports) {\n      try {\n        var binary2 = await getWasmBinary(binaryFile);\n        var instance2 = await WebAssembly.instantiate(binary2, imports);\n        return instance2;\n      } catch (reason) {\n        err(`failed to asynchronously prepare wasm: ${reason}`);\n        abort(reason);\n      }\n    }\n    __name(instantiateArrayBuffer, \"instantiateArrayBuffer\");\n    async function instantiateAsync(binary2, binaryFile, imports) {\n      if (!binary2 && typeof WebAssembly.instantiateStreaming == \"function\" && !isFileURI(binaryFile) && !ENVIRONMENT_IS_NODE) {\n        try {\n          var response = fetch(binaryFile, {\n            credentials: \"same-origin\"\n          });\n          var instantiationResult = await WebAssembly.instantiateStreaming(response, imports);\n          return instantiationResult;\n        } catch (reason) {\n          err(`wasm streaming compile failed: ${reason}`);\n          err(\"falling back to ArrayBuffer instantiation\");\n        }\n      }\n      return instantiateArrayBuffer(binaryFile, imports);\n    }\n    __name(instantiateAsync, \"instantiateAsync\");\n    function getWasmImports() {\n      return {\n        \"env\": wasmImports,\n        \"wasi_snapshot_preview1\": wasmImports,\n        \"GOT.mem\": new Proxy(wasmImports, GOTHandler),\n        \"GOT.func\": new Proxy(wasmImports, GOTHandler)\n      };\n    }\n    __name(getWasmImports, \"getWasmImports\");\n    async function createWasm() {\n      function receiveInstance(instance2, module2) {\n        wasmExports = instance2.exports;\n        wasmExports = relocateExports(wasmExports, 1024);\n        var metadata2 = getDylinkMetadata(module2);\n        if (metadata2.neededDynlibs) {\n          dynamicLibraries = metadata2.neededDynlibs.concat(dynamicLibraries);\n        }\n        mergeLibSymbols(wasmExports, \"main\");\n        LDSO.init();\n        loadDylibs();\n        __RELOC_FUNCS__.push(wasmExports[\"__wasm_apply_data_relocs\"]);\n        removeRunDependency(\"wasm-instantiate\");\n        return wasmExports;\n      }\n      __name(receiveInstance, \"receiveInstance\");\n      addRunDependency(\"wasm-instantiate\");\n      function receiveInstantiationResult(result2) {\n        return receiveInstance(result2[\"instance\"], result2[\"module\"]);\n      }\n      __name(receiveInstantiationResult, \"receiveInstantiationResult\");\n      var info2 = getWasmImports();\n      if (Module[\"instantiateWasm\"]) {\n        return new Promise((resolve, reject) => {\n          Module[\"instantiateWasm\"](info2, (mod, inst) => {\n            receiveInstance(mod, inst);\n            resolve(mod.exports);\n          });\n        });\n      }\n      wasmBinaryFile ??= findWasmBinary();\n      try {\n        var result = await instantiateAsync(wasmBinary, wasmBinaryFile, info2);\n        var exports = receiveInstantiationResult(result);\n        return exports;\n      } catch (e) {\n        readyPromiseReject(e);\n        return Promise.reject(e);\n      }\n    }\n    __name(createWasm, \"createWasm\");\n    var ASM_CONSTS = {};\n    class ExitStatus {\n      static {\n        __name(this, \"ExitStatus\");\n      }\n      name = \"ExitStatus\";\n      constructor(status) {\n        this.message = `Program terminated with exit(${status})`;\n        this.status = status;\n      }\n    }\n    var GOT = {};\n    var currentModuleWeakSymbols = /* @__PURE__ */ new Set([]);\n    var GOTHandler = {\n      get(obj, symName) {\n        var rtn = GOT[symName];\n        if (!rtn) {\n          rtn = GOT[symName] = new WebAssembly.Global({\n            \"value\": \"i32\",\n            \"mutable\": true\n          });\n        }\n        if (!currentModuleWeakSymbols.has(symName)) {\n          rtn.required = true;\n        }\n        return rtn;\n      }\n    };\n    var LE_HEAP_LOAD_F32 = /* @__PURE__ */ __name((byteOffset) => HEAP_DATA_VIEW.getFloat32(byteOffset, true), \"LE_HEAP_LOAD_F32\");\n    var LE_HEAP_LOAD_F64 = /* @__PURE__ */ __name((byteOffset) => HEAP_DATA_VIEW.getFloat64(byteOffset, true), \"LE_HEAP_LOAD_F64\");\n    var LE_HEAP_LOAD_I16 = /* @__PURE__ */ __name((byteOffset) => HEAP_DATA_VIEW.getInt16(byteOffset, true), \"LE_HEAP_LOAD_I16\");\n    var LE_HEAP_LOAD_I32 = /* @__PURE__ */ __name((byteOffset) => HEAP_DATA_VIEW.getInt32(byteOffset, true), \"LE_HEAP_LOAD_I32\");\n    var LE_HEAP_LOAD_U16 = /* @__PURE__ */ __name((byteOffset) => HEAP_DATA_VIEW.getUint16(byteOffset, true), \"LE_HEAP_LOAD_U16\");\n    var LE_HEAP_LOAD_U32 = /* @__PURE__ */ __name((byteOffset) => HEAP_DATA_VIEW.getUint32(byteOffset, true), \"LE_HEAP_LOAD_U32\");\n    var LE_HEAP_STORE_F32 = /* @__PURE__ */ __name((byteOffset, value) => HEAP_DATA_VIEW.setFloat32(byteOffset, value, true), \"LE_HEAP_STORE_F32\");\n    var LE_HEAP_STORE_F64 = /* @__PURE__ */ __name((byteOffset, value) => HEAP_DATA_VIEW.setFloat64(byteOffset, value, true), \"LE_HEAP_STORE_F64\");\n    var LE_HEAP_STORE_I16 = /* @__PURE__ */ __name((byteOffset, value) => HEAP_DATA_VIEW.setInt16(byteOffset, value, true), \"LE_HEAP_STORE_I16\");\n    var LE_HEAP_STORE_I32 = /* @__PURE__ */ __name((byteOffset, value) => HEAP_DATA_VIEW.setInt32(byteOffset, value, true), \"LE_HEAP_STORE_I32\");\n    var LE_HEAP_STORE_U16 = /* @__PURE__ */ __name((byteOffset, value) => HEAP_DATA_VIEW.setUint16(byteOffset, value, true), \"LE_HEAP_STORE_U16\");\n    var LE_HEAP_STORE_U32 = /* @__PURE__ */ __name((byteOffset, value) => HEAP_DATA_VIEW.setUint32(byteOffset, value, true), \"LE_HEAP_STORE_U32\");\n    var callRuntimeCallbacks = /* @__PURE__ */ __name((callbacks) => {\n      while (callbacks.length > 0) {\n        callbacks.shift()(Module);\n      }\n    }, \"callRuntimeCallbacks\");\n    var onPostRuns = [];\n    var addOnPostRun = /* @__PURE__ */ __name((cb) => onPostRuns.unshift(cb), \"addOnPostRun\");\n    var onPreRuns = [];\n    var addOnPreRun = /* @__PURE__ */ __name((cb) => onPreRuns.unshift(cb), \"addOnPreRun\");\n    var UTF8Decoder = typeof TextDecoder != \"undefined\" ? new TextDecoder() : void 0;\n    var UTF8ArrayToString = /* @__PURE__ */ __name((heapOrArray, idx = 0, maxBytesToRead = NaN) => {\n      var endIdx = idx + maxBytesToRead;\n      var endPtr = idx;\n      while (heapOrArray[endPtr] && !(endPtr >= endIdx)) ++endPtr;\n      if (endPtr - idx > 16 && heapOrArray.buffer && UTF8Decoder) {\n        return UTF8Decoder.decode(heapOrArray.subarray(idx, endPtr));\n      }\n      var str = \"\";\n      while (idx < endPtr) {\n        var u0 = heapOrArray[idx++];\n        if (!(u0 & 128)) {\n          str += String.fromCharCode(u0);\n          continue;\n        }\n        var u1 = heapOrArray[idx++] & 63;\n        if ((u0 & 224) == 192) {\n          str += String.fromCharCode((u0 & 31) << 6 | u1);\n          continue;\n        }\n        var u2 = heapOrArray[idx++] & 63;\n        if ((u0 & 240) == 224) {\n          u0 = (u0 & 15) << 12 | u1 << 6 | u2;\n        } else {\n          u0 = (u0 & 7) << 18 | u1 << 12 | u2 << 6 | heapOrArray[idx++] & 63;\n        }\n        if (u0 < 65536) {\n          str += String.fromCharCode(u0);\n        } else {\n          var ch = u0 - 65536;\n          str += String.fromCharCode(55296 | ch >> 10, 56320 | ch & 1023);\n        }\n      }\n      return str;\n    }, \"UTF8ArrayToString\");\n    var getDylinkMetadata = /* @__PURE__ */ __name((binary2) => {\n      var offset = 0;\n      var end = 0;\n      function getU8() {\n        return binary2[offset++];\n      }\n      __name(getU8, \"getU8\");\n      function getLEB() {\n        var ret = 0;\n        var mul = 1;\n        while (1) {\n          var byte = binary2[offset++];\n          ret += (byte & 127) * mul;\n          mul *= 128;\n          if (!(byte & 128)) break;\n        }\n        return ret;\n      }\n      __name(getLEB, \"getLEB\");\n      function getString() {\n        var len = getLEB();\n        offset += len;\n        return UTF8ArrayToString(binary2, offset - len, len);\n      }\n      __name(getString, \"getString\");\n      function failIf(condition, message) {\n        if (condition) throw new Error(message);\n      }\n      __name(failIf, \"failIf\");\n      var name2 = \"dylink.0\";\n      if (binary2 instanceof WebAssembly.Module) {\n        var dylinkSection = WebAssembly.Module.customSections(binary2, name2);\n        if (dylinkSection.length === 0) {\n          name2 = \"dylink\";\n          dylinkSection = WebAssembly.Module.customSections(binary2, name2);\n        }\n        failIf(dylinkSection.length === 0, \"need dylink section\");\n        binary2 = new Uint8Array(dylinkSection[0]);\n        end = binary2.length;\n      } else {\n        var int32View = new Uint32Array(new Uint8Array(binary2.subarray(0, 24)).buffer);\n        var magicNumberFound = int32View[0] == 1836278016 || int32View[0] == 6386541;\n        failIf(!magicNumberFound, \"need to see wasm magic number\");\n        failIf(binary2[8] !== 0, \"need the dylink section to be first\");\n        offset = 9;\n        var section_size = getLEB();\n        end = offset + section_size;\n        name2 = getString();\n      }\n      var customSection = {\n        neededDynlibs: [],\n        tlsExports: /* @__PURE__ */ new Set(),\n        weakImports: /* @__PURE__ */ new Set()\n      };\n      if (name2 == \"dylink\") {\n        customSection.memorySize = getLEB();\n        customSection.memoryAlign = getLEB();\n        customSection.tableSize = getLEB();\n        customSection.tableAlign = getLEB();\n        var neededDynlibsCount = getLEB();\n        for (var i2 = 0; i2 < neededDynlibsCount; ++i2) {\n          var libname = getString();\n          customSection.neededDynlibs.push(libname);\n        }\n      } else {\n        failIf(name2 !== \"dylink.0\");\n        var WASM_DYLINK_MEM_INFO = 1;\n        var WASM_DYLINK_NEEDED = 2;\n        var WASM_DYLINK_EXPORT_INFO = 3;\n        var WASM_DYLINK_IMPORT_INFO = 4;\n        var WASM_SYMBOL_TLS = 256;\n        var WASM_SYMBOL_BINDING_MASK = 3;\n        var WASM_SYMBOL_BINDING_WEAK = 1;\n        while (offset < end) {\n          var subsectionType = getU8();\n          var subsectionSize = getLEB();\n          if (subsectionType === WASM_DYLINK_MEM_INFO) {\n            customSection.memorySize = getLEB();\n            customSection.memoryAlign = getLEB();\n            customSection.tableSize = getLEB();\n            customSection.tableAlign = getLEB();\n          } else if (subsectionType === WASM_DYLINK_NEEDED) {\n            var neededDynlibsCount = getLEB();\n            for (var i2 = 0; i2 < neededDynlibsCount; ++i2) {\n              libname = getString();\n              customSection.neededDynlibs.push(libname);\n            }\n          } else if (subsectionType === WASM_DYLINK_EXPORT_INFO) {\n            var count = getLEB();\n            while (count--) {\n              var symname = getString();\n              var flags2 = getLEB();\n              if (flags2 & WASM_SYMBOL_TLS) {\n                customSection.tlsExports.add(symname);\n              }\n            }\n          } else if (subsectionType === WASM_DYLINK_IMPORT_INFO) {\n            var count = getLEB();\n            while (count--) {\n              var modname = getString();\n              var symname = getString();\n              var flags2 = getLEB();\n              if ((flags2 & WASM_SYMBOL_BINDING_MASK) == WASM_SYMBOL_BINDING_WEAK) {\n                customSection.weakImports.add(symname);\n              }\n            }\n          } else {\n            offset += subsectionSize;\n          }\n        }\n      }\n      return customSection;\n    }, \"getDylinkMetadata\");\n    function getValue(ptr, type = \"i8\") {\n      if (type.endsWith(\"*\")) type = \"*\";\n      switch (type) {\n        case \"i1\":\n          return HEAP8[ptr];\n        case \"i8\":\n          return HEAP8[ptr];\n        case \"i16\":\n          return LE_HEAP_LOAD_I16((ptr >> 1) * 2);\n        case \"i32\":\n          return LE_HEAP_LOAD_I32((ptr >> 2) * 4);\n        case \"i64\":\n          return HEAP64[ptr >> 3];\n        case \"float\":\n          return LE_HEAP_LOAD_F32((ptr >> 2) * 4);\n        case \"double\":\n          return LE_HEAP_LOAD_F64((ptr >> 3) * 8);\n        case \"*\":\n          return LE_HEAP_LOAD_U32((ptr >> 2) * 4);\n        default:\n          abort(`invalid type for getValue: ${type}`);\n      }\n    }\n    __name(getValue, \"getValue\");\n    var newDSO = /* @__PURE__ */ __name((name2, handle2, syms) => {\n      var dso = {\n        refcount: Infinity,\n        name: name2,\n        exports: syms,\n        global: true\n      };\n      LDSO.loadedLibsByName[name2] = dso;\n      if (handle2 != void 0) {\n        LDSO.loadedLibsByHandle[handle2] = dso;\n      }\n      return dso;\n    }, \"newDSO\");\n    var LDSO = {\n      loadedLibsByName: {},\n      loadedLibsByHandle: {},\n      init() {\n        newDSO(\"__main__\", 0, wasmImports);\n      }\n    };\n    var ___heap_base = 78224;\n    var alignMemory = /* @__PURE__ */ __name((size, alignment) => Math.ceil(size / alignment) * alignment, \"alignMemory\");\n    var getMemory = /* @__PURE__ */ __name((size) => {\n      if (runtimeInitialized) {\n        return _calloc(size, 1);\n      }\n      var ret = ___heap_base;\n      var end = ret + alignMemory(size, 16);\n      ___heap_base = end;\n      GOT[\"__heap_base\"].value = end;\n      return ret;\n    }, \"getMemory\");\n    var isInternalSym = /* @__PURE__ */ __name((symName) => [\"__cpp_exception\", \"__c_longjmp\", \"__wasm_apply_data_relocs\", \"__dso_handle\", \"__tls_size\", \"__tls_align\", \"__set_stack_limits\", \"_emscripten_tls_init\", \"__wasm_init_tls\", \"__wasm_call_ctors\", \"__start_em_asm\", \"__stop_em_asm\", \"__start_em_js\", \"__stop_em_js\"].includes(symName) || symName.startsWith(\"__em_js__\"), \"isInternalSym\");\n    var uleb128Encode = /* @__PURE__ */ __name((n, target) => {\n      if (n < 128) {\n        target.push(n);\n      } else {\n        target.push(n % 128 | 128, n >> 7);\n      }\n    }, \"uleb128Encode\");\n    var sigToWasmTypes = /* @__PURE__ */ __name((sig) => {\n      var typeNames = {\n        \"i\": \"i32\",\n        \"j\": \"i64\",\n        \"f\": \"f32\",\n        \"d\": \"f64\",\n        \"e\": \"externref\",\n        \"p\": \"i32\"\n      };\n      var type = {\n        parameters: [],\n        results: sig[0] == \"v\" ? [] : [typeNames[sig[0]]]\n      };\n      for (var i2 = 1; i2 < sig.length; ++i2) {\n        type.parameters.push(typeNames[sig[i2]]);\n      }\n      return type;\n    }, \"sigToWasmTypes\");\n    var generateFuncType = /* @__PURE__ */ __name((sig, target) => {\n      var sigRet = sig.slice(0, 1);\n      var sigParam = sig.slice(1);\n      var typeCodes = {\n        \"i\": 127,\n        // i32\n        \"p\": 127,\n        // i32\n        \"j\": 126,\n        // i64\n        \"f\": 125,\n        // f32\n        \"d\": 124,\n        // f64\n        \"e\": 111\n      };\n      target.push(96);\n      uleb128Encode(sigParam.length, target);\n      for (var i2 = 0; i2 < sigParam.length; ++i2) {\n        target.push(typeCodes[sigParam[i2]]);\n      }\n      if (sigRet == \"v\") {\n        target.push(0);\n      } else {\n        target.push(1, typeCodes[sigRet]);\n      }\n    }, \"generateFuncType\");\n    var convertJsFunctionToWasm = /* @__PURE__ */ __name((func2, sig) => {\n      if (typeof WebAssembly.Function == \"function\") {\n        return new WebAssembly.Function(sigToWasmTypes(sig), func2);\n      }\n      var typeSectionBody = [1];\n      generateFuncType(sig, typeSectionBody);\n      var bytes = [\n        0,\n        97,\n        115,\n        109,\n        // magic (\"\\0asm\")\n        1,\n        0,\n        0,\n        0,\n        // version: 1\n        1\n      ];\n      uleb128Encode(typeSectionBody.length, bytes);\n      bytes.push(...typeSectionBody);\n      bytes.push(\n        2,\n        7,\n        // import section\n        // (import \"e\" \"f\" (func 0 (type 0)))\n        1,\n        1,\n        101,\n        1,\n        102,\n        0,\n        0,\n        7,\n        5,\n        // export section\n        // (export \"f\" (func 0 (type 0)))\n        1,\n        1,\n        102,\n        0,\n        0\n      );\n      var module2 = new WebAssembly.Module(new Uint8Array(bytes));\n      var instance2 = new WebAssembly.Instance(module2, {\n        \"e\": {\n          \"f\": func2\n        }\n      });\n      var wrappedFunc = instance2.exports[\"f\"];\n      return wrappedFunc;\n    }, \"convertJsFunctionToWasm\");\n    var wasmTableMirror = [];\n    var wasmTable = new WebAssembly.Table({\n      \"initial\": 31,\n      \"element\": \"anyfunc\"\n    });\n    var getWasmTableEntry = /* @__PURE__ */ __name((funcPtr) => {\n      var func2 = wasmTableMirror[funcPtr];\n      if (!func2) {\n        if (funcPtr >= wasmTableMirror.length) wasmTableMirror.length = funcPtr + 1;\n        wasmTableMirror[funcPtr] = func2 = wasmTable.get(funcPtr);\n      }\n      return func2;\n    }, \"getWasmTableEntry\");\n    var updateTableMap = /* @__PURE__ */ __name((offset, count) => {\n      if (functionsInTableMap) {\n        for (var i2 = offset; i2 < offset + count; i2++) {\n          var item = getWasmTableEntry(i2);\n          if (item) {\n            functionsInTableMap.set(item, i2);\n          }\n        }\n      }\n    }, \"updateTableMap\");\n    var functionsInTableMap;\n    var getFunctionAddress = /* @__PURE__ */ __name((func2) => {\n      if (!functionsInTableMap) {\n        functionsInTableMap = /* @__PURE__ */ new WeakMap();\n        updateTableMap(0, wasmTable.length);\n      }\n      return functionsInTableMap.get(func2) || 0;\n    }, \"getFunctionAddress\");\n    var freeTableIndexes = [];\n    var getEmptyTableSlot = /* @__PURE__ */ __name(() => {\n      if (freeTableIndexes.length) {\n        return freeTableIndexes.pop();\n      }\n      try {\n        wasmTable.grow(1);\n      } catch (err2) {\n        if (!(err2 instanceof RangeError)) {\n          throw err2;\n        }\n        throw \"Unable to grow wasm table. Set ALLOW_TABLE_GROWTH.\";\n      }\n      return wasmTable.length - 1;\n    }, \"getEmptyTableSlot\");\n    var setWasmTableEntry = /* @__PURE__ */ __name((idx, func2) => {\n      wasmTable.set(idx, func2);\n      wasmTableMirror[idx] = wasmTable.get(idx);\n    }, \"setWasmTableEntry\");\n    var addFunction = /* @__PURE__ */ __name((func2, sig) => {\n      var rtn = getFunctionAddress(func2);\n      if (rtn) {\n        return rtn;\n      }\n      var ret = getEmptyTableSlot();\n      try {\n        setWasmTableEntry(ret, func2);\n      } catch (err2) {\n        if (!(err2 instanceof TypeError)) {\n          throw err2;\n        }\n        var wrapped = convertJsFunctionToWasm(func2, sig);\n        setWasmTableEntry(ret, wrapped);\n      }\n      functionsInTableMap.set(func2, ret);\n      return ret;\n    }, \"addFunction\");\n    var updateGOT = /* @__PURE__ */ __name((exports, replace) => {\n      for (var symName in exports) {\n        if (isInternalSym(symName)) {\n          continue;\n        }\n        var value = exports[symName];\n        GOT[symName] ||= new WebAssembly.Global({\n          \"value\": \"i32\",\n          \"mutable\": true\n        });\n        if (replace || GOT[symName].value == 0) {\n          if (typeof value == \"function\") {\n            GOT[symName].value = addFunction(value);\n          } else if (typeof value == \"number\") {\n            GOT[symName].value = value;\n          } else {\n            err(`unhandled export type for '${symName}': ${typeof value}`);\n          }\n        }\n      }\n    }, \"updateGOT\");\n    var relocateExports = /* @__PURE__ */ __name((exports, memoryBase2, replace) => {\n      var relocated = {};\n      for (var e in exports) {\n        var value = exports[e];\n        if (typeof value == \"object\") {\n          value = value.value;\n        }\n        if (typeof value == \"number\") {\n          value += memoryBase2;\n        }\n        relocated[e] = value;\n      }\n      updateGOT(relocated, replace);\n      return relocated;\n    }, \"relocateExports\");\n    var isSymbolDefined = /* @__PURE__ */ __name((symName) => {\n      var existing = wasmImports[symName];\n      if (!existing || existing.stub) {\n        return false;\n      }\n      return true;\n    }, \"isSymbolDefined\");\n    var dynCall = /* @__PURE__ */ __name((sig, ptr, args2 = []) => {\n      var rtn = getWasmTableEntry(ptr)(...args2);\n      return rtn;\n    }, \"dynCall\");\n    var stackSave = /* @__PURE__ */ __name(() => _emscripten_stack_get_current(), \"stackSave\");\n    var stackRestore = /* @__PURE__ */ __name((val) => __emscripten_stack_restore(val), \"stackRestore\");\n    var createInvokeFunction = /* @__PURE__ */ __name((sig) => (ptr, ...args2) => {\n      var sp = stackSave();\n      try {\n        return dynCall(sig, ptr, args2);\n      } catch (e) {\n        stackRestore(sp);\n        if (e !== e + 0) throw e;\n        _setThrew(1, 0);\n        if (sig[0] == \"j\") return 0n;\n      }\n    }, \"createInvokeFunction\");\n    var resolveGlobalSymbol = /* @__PURE__ */ __name((symName, direct = false) => {\n      var sym;\n      if (isSymbolDefined(symName)) {\n        sym = wasmImports[symName];\n      } else if (symName.startsWith(\"invoke_\")) {\n        sym = wasmImports[symName] = createInvokeFunction(symName.split(\"_\")[1]);\n      }\n      return {\n        sym,\n        name: symName\n      };\n    }, \"resolveGlobalSymbol\");\n    var onPostCtors = [];\n    var addOnPostCtor = /* @__PURE__ */ __name((cb) => onPostCtors.unshift(cb), \"addOnPostCtor\");\n    var UTF8ToString = /* @__PURE__ */ __name((ptr, maxBytesToRead) => ptr ? UTF8ArrayToString(HEAPU8, ptr, maxBytesToRead) : \"\", \"UTF8ToString\");\n    var loadWebAssemblyModule = /* @__PURE__ */ __name((binary, flags, libName, localScope, handle) => {\n      var metadata = getDylinkMetadata(binary);\n      currentModuleWeakSymbols = metadata.weakImports;\n      function loadModule() {\n        var memAlign = Math.pow(2, metadata.memoryAlign);\n        var memoryBase = metadata.memorySize ? alignMemory(getMemory(metadata.memorySize + memAlign), memAlign) : 0;\n        var tableBase = metadata.tableSize ? wasmTable.length : 0;\n        if (handle) {\n          HEAP8[handle + 8] = 1;\n          LE_HEAP_STORE_U32((handle + 12 >> 2) * 4, memoryBase);\n          LE_HEAP_STORE_I32((handle + 16 >> 2) * 4, metadata.memorySize);\n          LE_HEAP_STORE_U32((handle + 20 >> 2) * 4, tableBase);\n          LE_HEAP_STORE_I32((handle + 24 >> 2) * 4, metadata.tableSize);\n        }\n        if (metadata.tableSize) {\n          wasmTable.grow(metadata.tableSize);\n        }\n        var moduleExports;\n        function resolveSymbol(sym) {\n          var resolved = resolveGlobalSymbol(sym).sym;\n          if (!resolved && localScope) {\n            resolved = localScope[sym];\n          }\n          if (!resolved) {\n            resolved = moduleExports[sym];\n          }\n          return resolved;\n        }\n        __name(resolveSymbol, \"resolveSymbol\");\n        var proxyHandler = {\n          get(stubs, prop) {\n            switch (prop) {\n              case \"__memory_base\":\n                return memoryBase;\n              case \"__table_base\":\n                return tableBase;\n            }\n            if (prop in wasmImports && !wasmImports[prop].stub) {\n              var res = wasmImports[prop];\n              return res;\n            }\n            if (!(prop in stubs)) {\n              var resolved;\n              stubs[prop] = (...args2) => {\n                resolved ||= resolveSymbol(prop);\n                return resolved(...args2);\n              };\n            }\n            return stubs[prop];\n          }\n        };\n        var proxy = new Proxy({}, proxyHandler);\n        var info = {\n          \"GOT.mem\": new Proxy({}, GOTHandler),\n          \"GOT.func\": new Proxy({}, GOTHandler),\n          \"env\": proxy,\n          \"wasi_snapshot_preview1\": proxy\n        };\n        function postInstantiation(module, instance) {\n          updateTableMap(tableBase, metadata.tableSize);\n          moduleExports = relocateExports(instance.exports, memoryBase);\n          if (!flags.allowUndefined) {\n            reportUndefinedSymbols();\n          }\n          function addEmAsm(addr, body) {\n            var args = [];\n            var arity = 0;\n            for (; arity < 16; arity++) {\n              if (body.indexOf(\"$\" + arity) != -1) {\n                args.push(\"$\" + arity);\n              } else {\n                break;\n              }\n            }\n            args = args.join(\",\");\n            var func = `(${args}) => { ${body} };`;\n            ASM_CONSTS[start] = eval(func);\n          }\n          __name(addEmAsm, \"addEmAsm\");\n          if (\"__start_em_asm\" in moduleExports) {\n            var start = moduleExports[\"__start_em_asm\"];\n            var stop = moduleExports[\"__stop_em_asm\"];\n            while (start < stop) {\n              var jsString = UTF8ToString(start);\n              addEmAsm(start, jsString);\n              start = HEAPU8.indexOf(0, start) + 1;\n            }\n          }\n          function addEmJs(name, cSig, body) {\n            var jsArgs = [];\n            cSig = cSig.slice(1, -1);\n            if (cSig != \"void\") {\n              cSig = cSig.split(\",\");\n              for (var i in cSig) {\n                var jsArg = cSig[i].split(\" \").pop();\n                jsArgs.push(jsArg.replace(\"*\", \"\"));\n              }\n            }\n            var func = `(${jsArgs}) => ${body};`;\n            moduleExports[name] = eval(func);\n          }\n          __name(addEmJs, \"addEmJs\");\n          for (var name in moduleExports) {\n            if (name.startsWith(\"__em_js__\")) {\n              var start = moduleExports[name];\n              var jsString = UTF8ToString(start);\n              var parts = jsString.split(\"<::>\");\n              addEmJs(name.replace(\"__em_js__\", \"\"), parts[0], parts[1]);\n              delete moduleExports[name];\n            }\n          }\n          var applyRelocs = moduleExports[\"__wasm_apply_data_relocs\"];\n          if (applyRelocs) {\n            if (runtimeInitialized) {\n              applyRelocs();\n            } else {\n              __RELOC_FUNCS__.push(applyRelocs);\n            }\n          }\n          var init = moduleExports[\"__wasm_call_ctors\"];\n          if (init) {\n            if (runtimeInitialized) {\n              init();\n            } else {\n              addOnPostCtor(init);\n            }\n          }\n          return moduleExports;\n        }\n        __name(postInstantiation, \"postInstantiation\");\n        if (flags.loadAsync) {\n          if (binary instanceof WebAssembly.Module) {\n            var instance = new WebAssembly.Instance(binary, info);\n            return Promise.resolve(postInstantiation(binary, instance));\n          }\n          return WebAssembly.instantiate(binary, info).then((result) => postInstantiation(result.module, result.instance));\n        }\n        var module = binary instanceof WebAssembly.Module ? binary : new WebAssembly.Module(binary);\n        var instance = new WebAssembly.Instance(module, info);\n        return postInstantiation(module, instance);\n      }\n      __name(loadModule, \"loadModule\");\n      if (flags.loadAsync) {\n        return metadata.neededDynlibs.reduce((chain, dynNeeded) => chain.then(() => loadDynamicLibrary(dynNeeded, flags, localScope)), Promise.resolve()).then(loadModule);\n      }\n      metadata.neededDynlibs.forEach((needed) => loadDynamicLibrary(needed, flags, localScope));\n      return loadModule();\n    }, \"loadWebAssemblyModule\");\n    var mergeLibSymbols = /* @__PURE__ */ __name((exports, libName2) => {\n      for (var [sym, exp] of Object.entries(exports)) {\n        const setImport = /* @__PURE__ */ __name((target) => {\n          if (!isSymbolDefined(target)) {\n            wasmImports[target] = exp;\n          }\n        }, \"setImport\");\n        setImport(sym);\n        const main_alias = \"__main_argc_argv\";\n        if (sym == \"main\") {\n          setImport(main_alias);\n        }\n        if (sym == main_alias) {\n          setImport(\"main\");\n        }\n      }\n    }, \"mergeLibSymbols\");\n    var asyncLoad = /* @__PURE__ */ __name(async (url) => {\n      var arrayBuffer = await readAsync(url);\n      return new Uint8Array(arrayBuffer);\n    }, \"asyncLoad\");\n    function loadDynamicLibrary(libName2, flags2 = {\n      global: true,\n      nodelete: true\n    }, localScope2, handle2) {\n      var dso = LDSO.loadedLibsByName[libName2];\n      if (dso) {\n        if (!flags2.global) {\n          if (localScope2) {\n            Object.assign(localScope2, dso.exports);\n          }\n        } else if (!dso.global) {\n          dso.global = true;\n          mergeLibSymbols(dso.exports, libName2);\n        }\n        if (flags2.nodelete && dso.refcount !== Infinity) {\n          dso.refcount = Infinity;\n        }\n        dso.refcount++;\n        if (handle2) {\n          LDSO.loadedLibsByHandle[handle2] = dso;\n        }\n        return flags2.loadAsync ? Promise.resolve(true) : true;\n      }\n      dso = newDSO(libName2, handle2, \"loading\");\n      dso.refcount = flags2.nodelete ? Infinity : 1;\n      dso.global = flags2.global;\n      function loadLibData() {\n        if (handle2) {\n          var data = LE_HEAP_LOAD_U32((handle2 + 28 >> 2) * 4);\n          var dataSize = LE_HEAP_LOAD_U32((handle2 + 32 >> 2) * 4);\n          if (data && dataSize) {\n            var libData = HEAP8.slice(data, data + dataSize);\n            return flags2.loadAsync ? Promise.resolve(libData) : libData;\n          }\n        }\n        var libFile = locateFile(libName2);\n        if (flags2.loadAsync) {\n          return asyncLoad(libFile);\n        }\n        if (!readBinary) {\n          throw new Error(`${libFile}: file not found, and synchronous loading of external files is not available`);\n        }\n        return readBinary(libFile);\n      }\n      __name(loadLibData, \"loadLibData\");\n      function getExports() {\n        if (flags2.loadAsync) {\n          return loadLibData().then((libData) => loadWebAssemblyModule(libData, flags2, libName2, localScope2, handle2));\n        }\n        return loadWebAssemblyModule(loadLibData(), flags2, libName2, localScope2, handle2);\n      }\n      __name(getExports, \"getExports\");\n      function moduleLoaded(exports) {\n        if (dso.global) {\n          mergeLibSymbols(exports, libName2);\n        } else if (localScope2) {\n          Object.assign(localScope2, exports);\n        }\n        dso.exports = exports;\n      }\n      __name(moduleLoaded, \"moduleLoaded\");\n      if (flags2.loadAsync) {\n        return getExports().then((exports) => {\n          moduleLoaded(exports);\n          return true;\n        });\n      }\n      moduleLoaded(getExports());\n      return true;\n    }\n    __name(loadDynamicLibrary, \"loadDynamicLibrary\");\n    var reportUndefinedSymbols = /* @__PURE__ */ __name(() => {\n      for (var [symName, entry] of Object.entries(GOT)) {\n        if (entry.value == 0) {\n          var value = resolveGlobalSymbol(symName, true).sym;\n          if (!value && !entry.required) {\n            continue;\n          }\n          if (typeof value == \"function\") {\n            entry.value = addFunction(value, value.sig);\n          } else if (typeof value == \"number\") {\n            entry.value = value;\n          } else {\n            throw new Error(`bad export type for '${symName}': ${typeof value}`);\n          }\n        }\n      }\n    }, \"reportUndefinedSymbols\");\n    var loadDylibs = /* @__PURE__ */ __name(() => {\n      if (!dynamicLibraries.length) {\n        reportUndefinedSymbols();\n        return;\n      }\n      addRunDependency(\"loadDylibs\");\n      dynamicLibraries.reduce((chain, lib) => chain.then(() => loadDynamicLibrary(lib, {\n        loadAsync: true,\n        global: true,\n        nodelete: true,\n        allowUndefined: true\n      })), Promise.resolve()).then(() => {\n        reportUndefinedSymbols();\n        removeRunDependency(\"loadDylibs\");\n      });\n    }, \"loadDylibs\");\n    var noExitRuntime = Module[\"noExitRuntime\"] || true;\n    function setValue(ptr, value, type = \"i8\") {\n      if (type.endsWith(\"*\")) type = \"*\";\n      switch (type) {\n        case \"i1\":\n          HEAP8[ptr] = value;\n          break;\n        case \"i8\":\n          HEAP8[ptr] = value;\n          break;\n        case \"i16\":\n          LE_HEAP_STORE_I16((ptr >> 1) * 2, value);\n          break;\n        case \"i32\":\n          LE_HEAP_STORE_I32((ptr >> 2) * 4, value);\n          break;\n        case \"i64\":\n          HEAP64[ptr >> 3] = BigInt(value);\n          break;\n        case \"float\":\n          LE_HEAP_STORE_F32((ptr >> 2) * 4, value);\n          break;\n        case \"double\":\n          LE_HEAP_STORE_F64((ptr >> 3) * 8, value);\n          break;\n        case \"*\":\n          LE_HEAP_STORE_U32((ptr >> 2) * 4, value);\n          break;\n        default:\n          abort(`invalid type for setValue: ${type}`);\n      }\n    }\n    __name(setValue, \"setValue\");\n    var ___memory_base = new WebAssembly.Global({\n      \"value\": \"i32\",\n      \"mutable\": false\n    }, 1024);\n    var ___stack_pointer = new WebAssembly.Global({\n      \"value\": \"i32\",\n      \"mutable\": true\n    }, 78224);\n    var ___table_base = new WebAssembly.Global({\n      \"value\": \"i32\",\n      \"mutable\": false\n    }, 1);\n    var __abort_js = /* @__PURE__ */ __name(() => abort(\"\"), \"__abort_js\");\n    __abort_js.sig = \"v\";\n    var _emscripten_get_now = /* @__PURE__ */ __name(() => performance.now(), \"_emscripten_get_now\");\n    _emscripten_get_now.sig = \"d\";\n    var _emscripten_date_now = /* @__PURE__ */ __name(() => Date.now(), \"_emscripten_date_now\");\n    _emscripten_date_now.sig = \"d\";\n    var nowIsMonotonic = 1;\n    var checkWasiClock = /* @__PURE__ */ __name((clock_id) => clock_id >= 0 && clock_id <= 3, \"checkWasiClock\");\n    var INT53_MAX = 9007199254740992;\n    var INT53_MIN = -9007199254740992;\n    var bigintToI53Checked = /* @__PURE__ */ __name((num) => num < INT53_MIN || num > INT53_MAX ? NaN : Number(num), \"bigintToI53Checked\");\n    function _clock_time_get(clk_id, ignored_precision, ptime) {\n      ignored_precision = bigintToI53Checked(ignored_precision);\n      if (!checkWasiClock(clk_id)) {\n        return 28;\n      }\n      var now;\n      if (clk_id === 0) {\n        now = _emscripten_date_now();\n      } else if (nowIsMonotonic) {\n        now = _emscripten_get_now();\n      } else {\n        return 52;\n      }\n      var nsec = Math.round(now * 1e3 * 1e3);\n      HEAP64[ptime >> 3] = BigInt(nsec);\n      return 0;\n    }\n    __name(_clock_time_get, \"_clock_time_get\");\n    _clock_time_get.sig = \"iijp\";\n    var getHeapMax = /* @__PURE__ */ __name(() => (\n      // Stay one Wasm page short of 4GB: while e.g. Chrome is able to allocate\n      // full 4GB Wasm memories, the size will wrap back to 0 bytes in Wasm side\n      // for any code that deals with heap sizes, which would require special\n      // casing all heap size related code to treat 0 specially.\n      2147483648\n    ), \"getHeapMax\");\n    var growMemory = /* @__PURE__ */ __name((size) => {\n      var b = wasmMemory.buffer;\n      var pages = (size - b.byteLength + 65535) / 65536 | 0;\n      try {\n        wasmMemory.grow(pages);\n        updateMemoryViews();\n        return 1;\n      } catch (e) {\n      }\n    }, \"growMemory\");\n    var _emscripten_resize_heap = /* @__PURE__ */ __name((requestedSize) => {\n      var oldSize = HEAPU8.length;\n      requestedSize >>>= 0;\n      var maxHeapSize = getHeapMax();\n      if (requestedSize > maxHeapSize) {\n        return false;\n      }\n      for (var cutDown = 1; cutDown <= 4; cutDown *= 2) {\n        var overGrownHeapSize = oldSize * (1 + 0.2 / cutDown);\n        overGrownHeapSize = Math.min(overGrownHeapSize, requestedSize + 100663296);\n        var newSize = Math.min(maxHeapSize, alignMemory(Math.max(requestedSize, overGrownHeapSize), 65536));\n        var replacement = growMemory(newSize);\n        if (replacement) {\n          return true;\n        }\n      }\n      return false;\n    }, \"_emscripten_resize_heap\");\n    _emscripten_resize_heap.sig = \"ip\";\n    var _fd_close = /* @__PURE__ */ __name((fd) => 52, \"_fd_close\");\n    _fd_close.sig = \"ii\";\n    function _fd_seek(fd, offset, whence, newOffset) {\n      offset = bigintToI53Checked(offset);\n      return 70;\n    }\n    __name(_fd_seek, \"_fd_seek\");\n    _fd_seek.sig = \"iijip\";\n    var printCharBuffers = [null, [], []];\n    var printChar = /* @__PURE__ */ __name((stream, curr) => {\n      var buffer = printCharBuffers[stream];\n      if (curr === 0 || curr === 10) {\n        (stream === 1 ? out : err)(UTF8ArrayToString(buffer));\n        buffer.length = 0;\n      } else {\n        buffer.push(curr);\n      }\n    }, \"printChar\");\n    var flush_NO_FILESYSTEM = /* @__PURE__ */ __name(() => {\n      if (printCharBuffers[1].length) printChar(1, 10);\n      if (printCharBuffers[2].length) printChar(2, 10);\n    }, \"flush_NO_FILESYSTEM\");\n    var SYSCALLS = {\n      varargs: void 0,\n      getStr(ptr) {\n        var ret = UTF8ToString(ptr);\n        return ret;\n      }\n    };\n    var _fd_write = /* @__PURE__ */ __name((fd, iov, iovcnt, pnum) => {\n      var num = 0;\n      for (var i2 = 0; i2 < iovcnt; i2++) {\n        var ptr = LE_HEAP_LOAD_U32((iov >> 2) * 4);\n        var len = LE_HEAP_LOAD_U32((iov + 4 >> 2) * 4);\n        iov += 8;\n        for (var j = 0; j < len; j++) {\n          printChar(fd, HEAPU8[ptr + j]);\n        }\n        num += len;\n      }\n      LE_HEAP_STORE_U32((pnum >> 2) * 4, num);\n      return 0;\n    }, \"_fd_write\");\n    _fd_write.sig = \"iippp\";\n    function _tree_sitter_log_callback(isLexMessage, messageAddress) {\n      if (Module.currentLogCallback) {\n        const message = UTF8ToString(messageAddress);\n        Module.currentLogCallback(message, isLexMessage !== 0);\n      }\n    }\n    __name(_tree_sitter_log_callback, \"_tree_sitter_log_callback\");\n    function _tree_sitter_parse_callback(inputBufferAddress, index, row, column, lengthAddress) {\n      const INPUT_BUFFER_SIZE = 10 * 1024;\n      const string = Module.currentParseCallback(index, {\n        row,\n        column\n      });\n      if (typeof string === \"string\") {\n        setValue(lengthAddress, string.length, \"i32\");\n        stringToUTF16(string, inputBufferAddress, INPUT_BUFFER_SIZE);\n      } else {\n        setValue(lengthAddress, 0, \"i32\");\n      }\n    }\n    __name(_tree_sitter_parse_callback, \"_tree_sitter_parse_callback\");\n    function _tree_sitter_progress_callback(currentOffset, hasError) {\n      if (Module.currentProgressCallback) {\n        return Module.currentProgressCallback({\n          currentOffset,\n          hasError\n        });\n      }\n      return false;\n    }\n    __name(_tree_sitter_progress_callback, \"_tree_sitter_progress_callback\");\n    function _tree_sitter_query_progress_callback(currentOffset) {\n      if (Module.currentQueryProgressCallback) {\n        return Module.currentQueryProgressCallback({\n          currentOffset\n        });\n      }\n      return false;\n    }\n    __name(_tree_sitter_query_progress_callback, \"_tree_sitter_query_progress_callback\");\n    var runtimeKeepaliveCounter = 0;\n    var keepRuntimeAlive = /* @__PURE__ */ __name(() => noExitRuntime || runtimeKeepaliveCounter > 0, \"keepRuntimeAlive\");\n    var _proc_exit = /* @__PURE__ */ __name((code) => {\n      EXITSTATUS = code;\n      if (!keepRuntimeAlive()) {\n        Module[\"onExit\"]?.(code);\n        ABORT = true;\n      }\n      quit_(code, new ExitStatus(code));\n    }, \"_proc_exit\");\n    _proc_exit.sig = \"vi\";\n    var exitJS = /* @__PURE__ */ __name((status, implicit) => {\n      EXITSTATUS = status;\n      _proc_exit(status);\n    }, \"exitJS\");\n    var handleException = /* @__PURE__ */ __name((e) => {\n      if (e instanceof ExitStatus || e == \"unwind\") {\n        return EXITSTATUS;\n      }\n      quit_(1, e);\n    }, \"handleException\");\n    var lengthBytesUTF8 = /* @__PURE__ */ __name((str) => {\n      var len = 0;\n      for (var i2 = 0; i2 < str.length; ++i2) {\n        var c = str.charCodeAt(i2);\n        if (c <= 127) {\n          len++;\n        } else if (c <= 2047) {\n          len += 2;\n        } else if (c >= 55296 && c <= 57343) {\n          len += 4;\n          ++i2;\n        } else {\n          len += 3;\n        }\n      }\n      return len;\n    }, \"lengthBytesUTF8\");\n    var stringToUTF8Array = /* @__PURE__ */ __name((str, heap, outIdx, maxBytesToWrite) => {\n      if (!(maxBytesToWrite > 0)) return 0;\n      var startIdx = outIdx;\n      var endIdx = outIdx + maxBytesToWrite - 1;\n      for (var i2 = 0; i2 < str.length; ++i2) {\n        var u = str.charCodeAt(i2);\n        if (u >= 55296 && u <= 57343) {\n          var u1 = str.charCodeAt(++i2);\n          u = 65536 + ((u & 1023) << 10) | u1 & 1023;\n        }\n        if (u <= 127) {\n          if (outIdx >= endIdx) break;\n          heap[outIdx++] = u;\n        } else if (u <= 2047) {\n          if (outIdx + 1 >= endIdx) break;\n          heap[outIdx++] = 192 | u >> 6;\n          heap[outIdx++] = 128 | u & 63;\n        } else if (u <= 65535) {\n          if (outIdx + 2 >= endIdx) break;\n          heap[outIdx++] = 224 | u >> 12;\n          heap[outIdx++] = 128 | u >> 6 & 63;\n          heap[outIdx++] = 128 | u & 63;\n        } else {\n          if (outIdx + 3 >= endIdx) break;\n          heap[outIdx++] = 240 | u >> 18;\n          heap[outIdx++] = 128 | u >> 12 & 63;\n          heap[outIdx++] = 128 | u >> 6 & 63;\n          heap[outIdx++] = 128 | u & 63;\n        }\n      }\n      heap[outIdx] = 0;\n      return outIdx - startIdx;\n    }, \"stringToUTF8Array\");\n    var stringToUTF8 = /* @__PURE__ */ __name((str, outPtr, maxBytesToWrite) => stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite), \"stringToUTF8\");\n    var stackAlloc = /* @__PURE__ */ __name((sz) => __emscripten_stack_alloc(sz), \"stackAlloc\");\n    var stringToUTF8OnStack = /* @__PURE__ */ __name((str) => {\n      var size = lengthBytesUTF8(str) + 1;\n      var ret = stackAlloc(size);\n      stringToUTF8(str, ret, size);\n      return ret;\n    }, \"stringToUTF8OnStack\");\n    var AsciiToString = /* @__PURE__ */ __name((ptr) => {\n      var str = \"\";\n      while (1) {\n        var ch = HEAPU8[ptr++];\n        if (!ch) return str;\n        str += String.fromCharCode(ch);\n      }\n    }, \"AsciiToString\");\n    var stringToUTF16 = /* @__PURE__ */ __name((str, outPtr, maxBytesToWrite) => {\n      maxBytesToWrite ??= 2147483647;\n      if (maxBytesToWrite < 2) return 0;\n      maxBytesToWrite -= 2;\n      var startPtr = outPtr;\n      var numCharsToWrite = maxBytesToWrite < str.length * 2 ? maxBytesToWrite / 2 : str.length;\n      for (var i2 = 0; i2 < numCharsToWrite; ++i2) {\n        var codeUnit = str.charCodeAt(i2);\n        LE_HEAP_STORE_I16((outPtr >> 1) * 2, codeUnit);\n        outPtr += 2;\n      }\n      LE_HEAP_STORE_I16((outPtr >> 1) * 2, 0);\n      return outPtr - startPtr;\n    }, \"stringToUTF16\");\n    var wasmImports = {\n      /** @export */\n      __heap_base: ___heap_base,\n      /** @export */\n      __indirect_function_table: wasmTable,\n      /** @export */\n      __memory_base: ___memory_base,\n      /** @export */\n      __stack_pointer: ___stack_pointer,\n      /** @export */\n      __table_base: ___table_base,\n      /** @export */\n      _abort_js: __abort_js,\n      /** @export */\n      clock_time_get: _clock_time_get,\n      /** @export */\n      emscripten_resize_heap: _emscripten_resize_heap,\n      /** @export */\n      fd_close: _fd_close,\n      /** @export */\n      fd_seek: _fd_seek,\n      /** @export */\n      fd_write: _fd_write,\n      /** @export */\n      memory: wasmMemory,\n      /** @export */\n      tree_sitter_log_callback: _tree_sitter_log_callback,\n      /** @export */\n      tree_sitter_parse_callback: _tree_sitter_parse_callback,\n      /** @export */\n      tree_sitter_progress_callback: _tree_sitter_progress_callback,\n      /** @export */\n      tree_sitter_query_progress_callback: _tree_sitter_query_progress_callback\n    };\n    var wasmExports = await createWasm();\n    var ___wasm_call_ctors = wasmExports[\"__wasm_call_ctors\"];\n    var _malloc = Module[\"_malloc\"] = wasmExports[\"malloc\"];\n    var _calloc = Module[\"_calloc\"] = wasmExports[\"calloc\"];\n    var _realloc = Module[\"_realloc\"] = wasmExports[\"realloc\"];\n    var _free = Module[\"_free\"] = wasmExports[\"free\"];\n    var _memcmp = Module[\"_memcmp\"] = wasmExports[\"memcmp\"];\n    var _ts_language_symbol_count = Module[\"_ts_language_symbol_count\"] = wasmExports[\"ts_language_symbol_count\"];\n    var _ts_language_state_count = Module[\"_ts_language_state_count\"] = wasmExports[\"ts_language_state_count\"];\n    var _ts_language_version = Module[\"_ts_language_version\"] = wasmExports[\"ts_language_version\"];\n    var _ts_language_abi_version = Module[\"_ts_language_abi_version\"] = wasmExports[\"ts_language_abi_version\"];\n    var _ts_language_metadata = Module[\"_ts_language_metadata\"] = wasmExports[\"ts_language_metadata\"];\n    var _ts_language_name = Module[\"_ts_language_name\"] = wasmExports[\"ts_language_name\"];\n    var _ts_language_field_count = Module[\"_ts_language_field_count\"] = wasmExports[\"ts_language_field_count\"];\n    var _ts_language_next_state = Module[\"_ts_language_next_state\"] = wasmExports[\"ts_language_next_state\"];\n    var _ts_language_symbol_name = Module[\"_ts_language_symbol_name\"] = wasmExports[\"ts_language_symbol_name\"];\n    var _ts_language_symbol_for_name = Module[\"_ts_language_symbol_for_name\"] = wasmExports[\"ts_language_symbol_for_name\"];\n    var _strncmp = Module[\"_strncmp\"] = wasmExports[\"strncmp\"];\n    var _ts_language_symbol_type = Module[\"_ts_language_symbol_type\"] = wasmExports[\"ts_language_symbol_type\"];\n    var _ts_language_field_name_for_id = Module[\"_ts_language_field_name_for_id\"] = wasmExports[\"ts_language_field_name_for_id\"];\n    var _ts_lookahead_iterator_new = Module[\"_ts_lookahead_iterator_new\"] = wasmExports[\"ts_lookahead_iterator_new\"];\n    var _ts_lookahead_iterator_delete = Module[\"_ts_lookahead_iterator_delete\"] = wasmExports[\"ts_lookahead_iterator_delete\"];\n    var _ts_lookahead_iterator_reset_state = Module[\"_ts_lookahead_iterator_reset_state\"] = wasmExports[\"ts_lookahead_iterator_reset_state\"];\n    var _ts_lookahead_iterator_reset = Module[\"_ts_lookahead_iterator_reset\"] = wasmExports[\"ts_lookahead_iterator_reset\"];\n    var _ts_lookahead_iterator_next = Module[\"_ts_lookahead_iterator_next\"] = wasmExports[\"ts_lookahead_iterator_next\"];\n    var _ts_lookahead_iterator_current_symbol = Module[\"_ts_lookahead_iterator_current_symbol\"] = wasmExports[\"ts_lookahead_iterator_current_symbol\"];\n    var _ts_parser_delete = Module[\"_ts_parser_delete\"] = wasmExports[\"ts_parser_delete\"];\n    var _ts_parser_reset = Module[\"_ts_parser_reset\"] = wasmExports[\"ts_parser_reset\"];\n    var _ts_parser_set_language = Module[\"_ts_parser_set_language\"] = wasmExports[\"ts_parser_set_language\"];\n    var _ts_parser_timeout_micros = Module[\"_ts_parser_timeout_micros\"] = wasmExports[\"ts_parser_timeout_micros\"];\n    var _ts_parser_set_timeout_micros = Module[\"_ts_parser_set_timeout_micros\"] = wasmExports[\"ts_parser_set_timeout_micros\"];\n    var _ts_parser_set_included_ranges = Module[\"_ts_parser_set_included_ranges\"] = wasmExports[\"ts_parser_set_included_ranges\"];\n    var _ts_query_new = Module[\"_ts_query_new\"] = wasmExports[\"ts_query_new\"];\n    var _ts_query_delete = Module[\"_ts_query_delete\"] = wasmExports[\"ts_query_delete\"];\n    var _iswspace = Module[\"_iswspace\"] = wasmExports[\"iswspace\"];\n    var _iswalnum = Module[\"_iswalnum\"] = wasmExports[\"iswalnum\"];\n    var _ts_query_pattern_count = Module[\"_ts_query_pattern_count\"] = wasmExports[\"ts_query_pattern_count\"];\n    var _ts_query_capture_count = Module[\"_ts_query_capture_count\"] = wasmExports[\"ts_query_capture_count\"];\n    var _ts_query_string_count = Module[\"_ts_query_string_count\"] = wasmExports[\"ts_query_string_count\"];\n    var _ts_query_capture_name_for_id = Module[\"_ts_query_capture_name_for_id\"] = wasmExports[\"ts_query_capture_name_for_id\"];\n    var _ts_query_capture_quantifier_for_id = Module[\"_ts_query_capture_quantifier_for_id\"] = wasmExports[\"ts_query_capture_quantifier_for_id\"];\n    var _ts_query_string_value_for_id = Module[\"_ts_query_string_value_for_id\"] = wasmExports[\"ts_query_string_value_for_id\"];\n    var _ts_query_predicates_for_pattern = Module[\"_ts_query_predicates_for_pattern\"] = wasmExports[\"ts_query_predicates_for_pattern\"];\n    var _ts_query_start_byte_for_pattern = Module[\"_ts_query_start_byte_for_pattern\"] = wasmExports[\"ts_query_start_byte_for_pattern\"];\n    var _ts_query_end_byte_for_pattern = Module[\"_ts_query_end_byte_for_pattern\"] = wasmExports[\"ts_query_end_byte_for_pattern\"];\n    var _ts_query_is_pattern_rooted = Module[\"_ts_query_is_pattern_rooted\"] = wasmExports[\"ts_query_is_pattern_rooted\"];\n    var _ts_query_is_pattern_non_local = Module[\"_ts_query_is_pattern_non_local\"] = wasmExports[\"ts_query_is_pattern_non_local\"];\n    var _ts_query_is_pattern_guaranteed_at_step = Module[\"_ts_query_is_pattern_guaranteed_at_step\"] = wasmExports[\"ts_query_is_pattern_guaranteed_at_step\"];\n    var _ts_query_disable_capture = Module[\"_ts_query_disable_capture\"] = wasmExports[\"ts_query_disable_capture\"];\n    var _ts_query_disable_pattern = Module[\"_ts_query_disable_pattern\"] = wasmExports[\"ts_query_disable_pattern\"];\n    var _ts_tree_copy = Module[\"_ts_tree_copy\"] = wasmExports[\"ts_tree_copy\"];\n    var _ts_tree_delete = Module[\"_ts_tree_delete\"] = wasmExports[\"ts_tree_delete\"];\n    var _ts_init = Module[\"_ts_init\"] = wasmExports[\"ts_init\"];\n    var _ts_parser_new_wasm = Module[\"_ts_parser_new_wasm\"] = wasmExports[\"ts_parser_new_wasm\"];\n    var _ts_parser_enable_logger_wasm = Module[\"_ts_parser_enable_logger_wasm\"] = wasmExports[\"ts_parser_enable_logger_wasm\"];\n    var _ts_parser_parse_wasm = Module[\"_ts_parser_parse_wasm\"] = wasmExports[\"ts_parser_parse_wasm\"];\n    var _ts_parser_included_ranges_wasm = Module[\"_ts_parser_included_ranges_wasm\"] = wasmExports[\"ts_parser_included_ranges_wasm\"];\n    var _ts_language_type_is_named_wasm = Module[\"_ts_language_type_is_named_wasm\"] = wasmExports[\"ts_language_type_is_named_wasm\"];\n    var _ts_language_type_is_visible_wasm = Module[\"_ts_language_type_is_visible_wasm\"] = wasmExports[\"ts_language_type_is_visible_wasm\"];\n    var _ts_language_supertypes_wasm = Module[\"_ts_language_supertypes_wasm\"] = wasmExports[\"ts_language_supertypes_wasm\"];\n    var _ts_language_subtypes_wasm = Module[\"_ts_language_subtypes_wasm\"] = wasmExports[\"ts_language_subtypes_wasm\"];\n    var _ts_tree_root_node_wasm = Module[\"_ts_tree_root_node_wasm\"] = wasmExports[\"ts_tree_root_node_wasm\"];\n    var _ts_tree_root_node_with_offset_wasm = Module[\"_ts_tree_root_node_with_offset_wasm\"] = wasmExports[\"ts_tree_root_node_with_offset_wasm\"];\n    var _ts_tree_edit_wasm = Module[\"_ts_tree_edit_wasm\"] = wasmExports[\"ts_tree_edit_wasm\"];\n    var _ts_tree_included_ranges_wasm = Module[\"_ts_tree_included_ranges_wasm\"] = wasmExports[\"ts_tree_included_ranges_wasm\"];\n    var _ts_tree_get_changed_ranges_wasm = Module[\"_ts_tree_get_changed_ranges_wasm\"] = wasmExports[\"ts_tree_get_changed_ranges_wasm\"];\n    var _ts_tree_cursor_new_wasm = Module[\"_ts_tree_cursor_new_wasm\"] = wasmExports[\"ts_tree_cursor_new_wasm\"];\n    var _ts_tree_cursor_copy_wasm = Module[\"_ts_tree_cursor_copy_wasm\"] = wasmExports[\"ts_tree_cursor_copy_wasm\"];\n    var _ts_tree_cursor_delete_wasm = Module[\"_ts_tree_cursor_delete_wasm\"] = wasmExports[\"ts_tree_cursor_delete_wasm\"];\n    var _ts_tree_cursor_reset_wasm = Module[\"_ts_tree_cursor_reset_wasm\"] = wasmExports[\"ts_tree_cursor_reset_wasm\"];\n    var _ts_tree_cursor_reset_to_wasm = Module[\"_ts_tree_cursor_reset_to_wasm\"] = wasmExports[\"ts_tree_cursor_reset_to_wasm\"];\n    var _ts_tree_cursor_goto_first_child_wasm = Module[\"_ts_tree_cursor_goto_first_child_wasm\"] = wasmExports[\"ts_tree_cursor_goto_first_child_wasm\"];\n    var _ts_tree_cursor_goto_last_child_wasm = Module[\"_ts_tree_cursor_goto_last_child_wasm\"] = wasmExports[\"ts_tree_cursor_goto_last_child_wasm\"];\n    var _ts_tree_cursor_goto_first_child_for_index_wasm = Module[\"_ts_tree_cursor_goto_first_child_for_index_wasm\"] = wasmExports[\"ts_tree_cursor_goto_first_child_for_index_wasm\"];\n    var _ts_tree_cursor_goto_first_child_for_position_wasm = Module[\"_ts_tree_cursor_goto_first_child_for_position_wasm\"] = wasmExports[\"ts_tree_cursor_goto_first_child_for_position_wasm\"];\n    var _ts_tree_cursor_goto_next_sibling_wasm = Module[\"_ts_tree_cursor_goto_next_sibling_wasm\"] = wasmExports[\"ts_tree_cursor_goto_next_sibling_wasm\"];\n    var _ts_tree_cursor_goto_previous_sibling_wasm = Module[\"_ts_tree_cursor_goto_previous_sibling_wasm\"] = wasmExports[\"ts_tree_cursor_goto_previous_sibling_wasm\"];\n    var _ts_tree_cursor_goto_descendant_wasm = Module[\"_ts_tree_cursor_goto_descendant_wasm\"] = wasmExports[\"ts_tree_cursor_goto_descendant_wasm\"];\n    var _ts_tree_cursor_goto_parent_wasm = Module[\"_ts_tree_cursor_goto_parent_wasm\"] = wasmExports[\"ts_tree_cursor_goto_parent_wasm\"];\n    var _ts_tree_cursor_current_node_type_id_wasm = Module[\"_ts_tree_cursor_current_node_type_id_wasm\"] = wasmExports[\"ts_tree_cursor_current_node_type_id_wasm\"];\n    var _ts_tree_cursor_current_node_state_id_wasm = Module[\"_ts_tree_cursor_current_node_state_id_wasm\"] = wasmExports[\"ts_tree_cursor_current_node_state_id_wasm\"];\n    var _ts_tree_cursor_current_node_is_named_wasm = Module[\"_ts_tree_cursor_current_node_is_named_wasm\"] = wasmExports[\"ts_tree_cursor_current_node_is_named_wasm\"];\n    var _ts_tree_cursor_current_node_is_missing_wasm = Module[\"_ts_tree_cursor_current_node_is_missing_wasm\"] = wasmExports[\"ts_tree_cursor_current_node_is_missing_wasm\"];\n    var _ts_tree_cursor_current_node_id_wasm = Module[\"_ts_tree_cursor_current_node_id_wasm\"] = wasmExports[\"ts_tree_cursor_current_node_id_wasm\"];\n    var _ts_tree_cursor_start_position_wasm = Module[\"_ts_tree_cursor_start_position_wasm\"] = wasmExports[\"ts_tree_cursor_start_position_wasm\"];\n    var _ts_tree_cursor_end_position_wasm = Module[\"_ts_tree_cursor_end_position_wasm\"] = wasmExports[\"ts_tree_cursor_end_position_wasm\"];\n    var _ts_tree_cursor_start_index_wasm = Module[\"_ts_tree_cursor_start_index_wasm\"] = wasmExports[\"ts_tree_cursor_start_index_wasm\"];\n    var _ts_tree_cursor_end_index_wasm = Module[\"_ts_tree_cursor_end_index_wasm\"] = wasmExports[\"ts_tree_cursor_end_index_wasm\"];\n    var _ts_tree_cursor_current_field_id_wasm = Module[\"_ts_tree_cursor_current_field_id_wasm\"] = wasmExports[\"ts_tree_cursor_current_field_id_wasm\"];\n    var _ts_tree_cursor_current_depth_wasm = Module[\"_ts_tree_cursor_current_depth_wasm\"] = wasmExports[\"ts_tree_cursor_current_depth_wasm\"];\n    var _ts_tree_cursor_current_descendant_index_wasm = Module[\"_ts_tree_cursor_current_descendant_index_wasm\"] = wasmExports[\"ts_tree_cursor_current_descendant_index_wasm\"];\n    var _ts_tree_cursor_current_node_wasm = Module[\"_ts_tree_cursor_current_node_wasm\"] = wasmExports[\"ts_tree_cursor_current_node_wasm\"];\n    var _ts_node_symbol_wasm = Module[\"_ts_node_symbol_wasm\"] = wasmExports[\"ts_node_symbol_wasm\"];\n    var _ts_node_field_name_for_child_wasm = Module[\"_ts_node_field_name_for_child_wasm\"] = wasmExports[\"ts_node_field_name_for_child_wasm\"];\n    var _ts_node_field_name_for_named_child_wasm = Module[\"_ts_node_field_name_for_named_child_wasm\"] = wasmExports[\"ts_node_field_name_for_named_child_wasm\"];\n    var _ts_node_children_by_field_id_wasm = Module[\"_ts_node_children_by_field_id_wasm\"] = wasmExports[\"ts_node_children_by_field_id_wasm\"];\n    var _ts_node_first_child_for_byte_wasm = Module[\"_ts_node_first_child_for_byte_wasm\"] = wasmExports[\"ts_node_first_child_for_byte_wasm\"];\n    var _ts_node_first_named_child_for_byte_wasm = Module[\"_ts_node_first_named_child_for_byte_wasm\"] = wasmExports[\"ts_node_first_named_child_for_byte_wasm\"];\n    var _ts_node_grammar_symbol_wasm = Module[\"_ts_node_grammar_symbol_wasm\"] = wasmExports[\"ts_node_grammar_symbol_wasm\"];\n    var _ts_node_child_count_wasm = Module[\"_ts_node_child_count_wasm\"] = wasmExports[\"ts_node_child_count_wasm\"];\n    var _ts_node_named_child_count_wasm = Module[\"_ts_node_named_child_count_wasm\"] = wasmExports[\"ts_node_named_child_count_wasm\"];\n    var _ts_node_child_wasm = Module[\"_ts_node_child_wasm\"] = wasmExports[\"ts_node_child_wasm\"];\n    var _ts_node_named_child_wasm = Module[\"_ts_node_named_child_wasm\"] = wasmExports[\"ts_node_named_child_wasm\"];\n    var _ts_node_child_by_field_id_wasm = Module[\"_ts_node_child_by_field_id_wasm\"] = wasmExports[\"ts_node_child_by_field_id_wasm\"];\n    var _ts_node_next_sibling_wasm = Module[\"_ts_node_next_sibling_wasm\"] = wasmExports[\"ts_node_next_sibling_wasm\"];\n    var _ts_node_prev_sibling_wasm = Module[\"_ts_node_prev_sibling_wasm\"] = wasmExports[\"ts_node_prev_sibling_wasm\"];\n    var _ts_node_next_named_sibling_wasm = Module[\"_ts_node_next_named_sibling_wasm\"] = wasmExports[\"ts_node_next_named_sibling_wasm\"];\n    var _ts_node_prev_named_sibling_wasm = Module[\"_ts_node_prev_named_sibling_wasm\"] = wasmExports[\"ts_node_prev_named_sibling_wasm\"];\n    var _ts_node_descendant_count_wasm = Module[\"_ts_node_descendant_count_wasm\"] = wasmExports[\"ts_node_descendant_count_wasm\"];\n    var _ts_node_parent_wasm = Module[\"_ts_node_parent_wasm\"] = wasmExports[\"ts_node_parent_wasm\"];\n    var _ts_node_child_with_descendant_wasm = Module[\"_ts_node_child_with_descendant_wasm\"] = wasmExports[\"ts_node_child_with_descendant_wasm\"];\n    var _ts_node_descendant_for_index_wasm = Module[\"_ts_node_descendant_for_index_wasm\"] = wasmExports[\"ts_node_descendant_for_index_wasm\"];\n    var _ts_node_named_descendant_for_index_wasm = Module[\"_ts_node_named_descendant_for_index_wasm\"] = wasmExports[\"ts_node_named_descendant_for_index_wasm\"];\n    var _ts_node_descendant_for_position_wasm = Module[\"_ts_node_descendant_for_position_wasm\"] = wasmExports[\"ts_node_descendant_for_position_wasm\"];\n    var _ts_node_named_descendant_for_position_wasm = Module[\"_ts_node_named_descendant_for_position_wasm\"] = wasmExports[\"ts_node_named_descendant_for_position_wasm\"];\n    var _ts_node_start_point_wasm = Module[\"_ts_node_start_point_wasm\"] = wasmExports[\"ts_node_start_point_wasm\"];\n    var _ts_node_end_point_wasm = Module[\"_ts_node_end_point_wasm\"] = wasmExports[\"ts_node_end_point_wasm\"];\n    var _ts_node_start_index_wasm = Module[\"_ts_node_start_index_wasm\"] = wasmExports[\"ts_node_start_index_wasm\"];\n    var _ts_node_end_index_wasm = Module[\"_ts_node_end_index_wasm\"] = wasmExports[\"ts_node_end_index_wasm\"];\n    var _ts_node_to_string_wasm = Module[\"_ts_node_to_string_wasm\"] = wasmExports[\"ts_node_to_string_wasm\"];\n    var _ts_node_children_wasm = Module[\"_ts_node_children_wasm\"] = wasmExports[\"ts_node_children_wasm\"];\n    var _ts_node_named_children_wasm = Module[\"_ts_node_named_children_wasm\"] = wasmExports[\"ts_node_named_children_wasm\"];\n    var _ts_node_descendants_of_type_wasm = Module[\"_ts_node_descendants_of_type_wasm\"] = wasmExports[\"ts_node_descendants_of_type_wasm\"];\n    var _ts_node_is_named_wasm = Module[\"_ts_node_is_named_wasm\"] = wasmExports[\"ts_node_is_named_wasm\"];\n    var _ts_node_has_changes_wasm = Module[\"_ts_node_has_changes_wasm\"] = wasmExports[\"ts_node_has_changes_wasm\"];\n    var _ts_node_has_error_wasm = Module[\"_ts_node_has_error_wasm\"] = wasmExports[\"ts_node_has_error_wasm\"];\n    var _ts_node_is_error_wasm = Module[\"_ts_node_is_error_wasm\"] = wasmExports[\"ts_node_is_error_wasm\"];\n    var _ts_node_is_missing_wasm = Module[\"_ts_node_is_missing_wasm\"] = wasmExports[\"ts_node_is_missing_wasm\"];\n    var _ts_node_is_extra_wasm = Module[\"_ts_node_is_extra_wasm\"] = wasmExports[\"ts_node_is_extra_wasm\"];\n    var _ts_node_parse_state_wasm = Module[\"_ts_node_parse_state_wasm\"] = wasmExports[\"ts_node_parse_state_wasm\"];\n    var _ts_node_next_parse_state_wasm = Module[\"_ts_node_next_parse_state_wasm\"] = wasmExports[\"ts_node_next_parse_state_wasm\"];\n    var _ts_query_matches_wasm = Module[\"_ts_query_matches_wasm\"] = wasmExports[\"ts_query_matches_wasm\"];\n    var _ts_query_captures_wasm = Module[\"_ts_query_captures_wasm\"] = wasmExports[\"ts_query_captures_wasm\"];\n    var _memset = Module[\"_memset\"] = wasmExports[\"memset\"];\n    var _memcpy = Module[\"_memcpy\"] = wasmExports[\"memcpy\"];\n    var _memmove = Module[\"_memmove\"] = wasmExports[\"memmove\"];\n    var _iswalpha = Module[\"_iswalpha\"] = wasmExports[\"iswalpha\"];\n    var _iswblank = Module[\"_iswblank\"] = wasmExports[\"iswblank\"];\n    var _iswdigit = Module[\"_iswdigit\"] = wasmExports[\"iswdigit\"];\n    var _iswlower = Module[\"_iswlower\"] = wasmExports[\"iswlower\"];\n    var _iswupper = Module[\"_iswupper\"] = wasmExports[\"iswupper\"];\n    var _iswxdigit = Module[\"_iswxdigit\"] = wasmExports[\"iswxdigit\"];\n    var _memchr = Module[\"_memchr\"] = wasmExports[\"memchr\"];\n    var _strlen = Module[\"_strlen\"] = wasmExports[\"strlen\"];\n    var _strcmp = Module[\"_strcmp\"] = wasmExports[\"strcmp\"];\n    var _strncat = Module[\"_strncat\"] = wasmExports[\"strncat\"];\n    var _strncpy = Module[\"_strncpy\"] = wasmExports[\"strncpy\"];\n    var _towlower = Module[\"_towlower\"] = wasmExports[\"towlower\"];\n    var _towupper = Module[\"_towupper\"] = wasmExports[\"towupper\"];\n    var _setThrew = wasmExports[\"setThrew\"];\n    var __emscripten_stack_restore = wasmExports[\"_emscripten_stack_restore\"];\n    var __emscripten_stack_alloc = wasmExports[\"_emscripten_stack_alloc\"];\n    var _emscripten_stack_get_current = wasmExports[\"emscripten_stack_get_current\"];\n    var ___wasm_apply_data_relocs = wasmExports[\"__wasm_apply_data_relocs\"];\n    Module[\"setValue\"] = setValue;\n    Module[\"getValue\"] = getValue;\n    Module[\"UTF8ToString\"] = UTF8ToString;\n    Module[\"stringToUTF8\"] = stringToUTF8;\n    Module[\"lengthBytesUTF8\"] = lengthBytesUTF8;\n    Module[\"AsciiToString\"] = AsciiToString;\n    Module[\"stringToUTF16\"] = stringToUTF16;\n    Module[\"loadWebAssemblyModule\"] = loadWebAssemblyModule;\n    function callMain(args2 = []) {\n      var entryFunction = resolveGlobalSymbol(\"main\").sym;\n      if (!entryFunction) return;\n      args2.unshift(thisProgram);\n      var argc = args2.length;\n      var argv = stackAlloc((argc + 1) * 4);\n      var argv_ptr = argv;\n      args2.forEach((arg) => {\n        LE_HEAP_STORE_U32((argv_ptr >> 2) * 4, stringToUTF8OnStack(arg));\n        argv_ptr += 4;\n      });\n      LE_HEAP_STORE_U32((argv_ptr >> 2) * 4, 0);\n      try {\n        var ret = entryFunction(argc, argv);\n        exitJS(\n          ret,\n          /* implicit = */\n          true\n        );\n        return ret;\n      } catch (e) {\n        return handleException(e);\n      }\n    }\n    __name(callMain, \"callMain\");\n    function run(args2 = arguments_) {\n      if (runDependencies > 0) {\n        dependenciesFulfilled = run;\n        return;\n      }\n      preRun();\n      if (runDependencies > 0) {\n        dependenciesFulfilled = run;\n        return;\n      }\n      function doRun() {\n        Module[\"calledRun\"] = true;\n        if (ABORT) return;\n        initRuntime();\n        preMain();\n        readyPromiseResolve(Module);\n        Module[\"onRuntimeInitialized\"]?.();\n        var noInitialRun = Module[\"noInitialRun\"];\n        if (!noInitialRun) callMain(args2);\n        postRun();\n      }\n      __name(doRun, \"doRun\");\n      if (Module[\"setStatus\"]) {\n        Module[\"setStatus\"](\"Running...\");\n        setTimeout(() => {\n          setTimeout(() => Module[\"setStatus\"](\"\"), 1);\n          doRun();\n        }, 1);\n      } else {\n        doRun();\n      }\n    }\n    __name(run, \"run\");\n    if (Module[\"preInit\"]) {\n      if (typeof Module[\"preInit\"] == \"function\") Module[\"preInit\"] = [Module[\"preInit\"]];\n      while (Module[\"preInit\"].length > 0) {\n        Module[\"preInit\"].pop()();\n      }\n    }\n    run();\n    moduleRtn = readyPromise;\n    return moduleRtn;\n  };\n})();\nvar tree_sitter_default = Module2;\n\n// src/bindings.ts\nvar Module3 = null;\nasync function initializeBinding(moduleOptions) {\n  if (!Module3) {\n    Module3 = await tree_sitter_default(moduleOptions);\n  }\n  return Module3;\n}\n__name(initializeBinding, \"initializeBinding\");\nfunction checkModule() {\n  return !!Module3;\n}\n__name(checkModule, \"checkModule\");\n\n// src/parser.ts\nvar TRANSFER_BUFFER;\nvar LANGUAGE_VERSION;\nvar MIN_COMPATIBLE_VERSION;\nvar Parser = class {\n  static {\n    __name(this, \"Parser\");\n  }\n  /** @internal */\n  [0] = 0;\n  // Internal handle for WASM\n  /** @internal */\n  [1] = 0;\n  // Internal handle for WASM\n  /** @internal */\n  logCallback = null;\n  /** The parser's current language. */\n  language = null;\n  /**\n   * This must always be called before creating a Parser.\n   *\n   * You can optionally pass in options to configure the WASM module, the most common\n   * one being `locateFile` to help the module find the `.wasm` file.\n   */\n  static async init(moduleOptions) {\n    setModule(await initializeBinding(moduleOptions));\n    TRANSFER_BUFFER = C._ts_init();\n    LANGUAGE_VERSION = C.getValue(TRANSFER_BUFFER, \"i32\");\n    MIN_COMPATIBLE_VERSION = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n  }\n  /**\n   * Create a new parser.\n   */\n  constructor() {\n    this.initialize();\n  }\n  /** @internal */\n  initialize() {\n    if (!checkModule()) {\n      throw new Error(\"cannot construct a Parser before calling `init()`\");\n    }\n    C._ts_parser_new_wasm();\n    this[0] = C.getValue(TRANSFER_BUFFER, \"i32\");\n    this[1] = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n  }\n  /** Delete the parser, freeing its resources. */\n  delete() {\n    C._ts_parser_delete(this[0]);\n    C._free(this[1]);\n    this[0] = 0;\n    this[1] = 0;\n  }\n  /**\n   * Set the language that the parser should use for parsing.\n   *\n   * If the language was not successfully assigned, an error will be thrown.\n   * This happens if the language was generated with an incompatible\n   * version of the Tree-sitter CLI. Check the language's version using\n   * {@link Language#version} and compare it to this library's\n   * {@link LANGUAGE_VERSION} and {@link MIN_COMPATIBLE_VERSION} constants.\n   */\n  setLanguage(language) {\n    let address;\n    if (!language) {\n      address = 0;\n      this.language = null;\n    } else if (language.constructor === Language) {\n      address = language[0];\n      const version = C._ts_language_version(address);\n      if (version < MIN_COMPATIBLE_VERSION || LANGUAGE_VERSION < version) {\n        throw new Error(\n          `Incompatible language version ${version}. Compatibility range ${MIN_COMPATIBLE_VERSION} through ${LANGUAGE_VERSION}.`\n        );\n      }\n      this.language = language;\n    } else {\n      throw new Error(\"Argument must be a Language\");\n    }\n    C._ts_parser_set_language(this[0], address);\n    return this;\n  }\n  /**\n   * Parse a slice of UTF8 text.\n   *\n   * @param {string | ParseCallback} callback - The UTF8-encoded text to parse or a callback function.\n   *\n   * @param {Tree | null} [oldTree] - A previous syntax tree parsed from the same document. If the text of the\n   *   document has changed since `oldTree` was created, then you must edit `oldTree` to match\n   *   the new text using {@link Tree#edit}.\n   *\n   * @param {ParseOptions} [options] - Options for parsing the text.\n   *  This can be used to set the included ranges, or a progress callback.\n   *\n   * @returns {Tree | null} A {@link Tree} if parsing succeeded, or `null` if:\n   *  - The parser has not yet had a language assigned with {@link Parser#setLanguage}.\n   *  - The progress callback returned true.\n   */\n  parse(callback, oldTree, options) {\n    if (typeof callback === \"string\") {\n      C.currentParseCallback = (index) => callback.slice(index);\n    } else if (typeof callback === \"function\") {\n      C.currentParseCallback = callback;\n    } else {\n      throw new Error(\"Argument must be a string or a function\");\n    }\n    if (options?.progressCallback) {\n      C.currentProgressCallback = options.progressCallback;\n    } else {\n      C.currentProgressCallback = null;\n    }\n    if (this.logCallback) {\n      C.currentLogCallback = this.logCallback;\n      C._ts_parser_enable_logger_wasm(this[0], 1);\n    } else {\n      C.currentLogCallback = null;\n      C._ts_parser_enable_logger_wasm(this[0], 0);\n    }\n    let rangeCount = 0;\n    let rangeAddress = 0;\n    if (options?.includedRanges) {\n      rangeCount = options.includedRanges.length;\n      rangeAddress = C._calloc(rangeCount, SIZE_OF_RANGE);\n      let address = rangeAddress;\n      for (let i2 = 0; i2 < rangeCount; i2++) {\n        marshalRange(address, options.includedRanges[i2]);\n        address += SIZE_OF_RANGE;\n      }\n    }\n    const treeAddress = C._ts_parser_parse_wasm(\n      this[0],\n      this[1],\n      oldTree ? oldTree[0] : 0,\n      rangeAddress,\n      rangeCount\n    );\n    if (!treeAddress) {\n      C.currentParseCallback = null;\n      C.currentLogCallback = null;\n      C.currentProgressCallback = null;\n      return null;\n    }\n    if (!this.language) {\n      throw new Error(\"Parser must have a language to parse\");\n    }\n    const result = new Tree(INTERNAL, treeAddress, this.language, C.currentParseCallback);\n    C.currentParseCallback = null;\n    C.currentLogCallback = null;\n    C.currentProgressCallback = null;\n    return result;\n  }\n  /**\n   * Instruct the parser to start the next parse from the beginning.\n   *\n   * If the parser previously failed because of a timeout, cancellation,\n   * or callback, then by default, it will resume where it left off on the\n   * next call to {@link Parser#parse} or other parsing functions.\n   * If you don't want to resume, and instead intend to use this parser to\n   * parse some other document, you must call `reset` first.\n   */\n  reset() {\n    C._ts_parser_reset(this[0]);\n  }\n  /** Get the ranges of text that the parser will include when parsing. */\n  getIncludedRanges() {\n    C._ts_parser_included_ranges_wasm(this[0]);\n    const count = C.getValue(TRANSFER_BUFFER, \"i32\");\n    const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, \"i32\");\n    const result = new Array(count);\n    if (count > 0) {\n      let address = buffer;\n      for (let i2 = 0; i2 < count; i2++) {\n        result[i2] = unmarshalRange(address);\n        address += SIZE_OF_RANGE;\n      }\n      C._free(buffer);\n    }\n    return result;\n  }\n  /**\n   * @deprecated since version 0.25.0, prefer passing a progress callback to {@link Parser#parse}\n   *\n   * Get the duration in microseconds that parsing is allowed to take.\n   *\n   * This is set via {@link Parser#setTimeoutMicros}.\n   */\n  getTimeoutMicros() {\n    return C._ts_parser_timeout_micros(this[0]);\n  }\n  /**\n   * @deprecated since version 0.25.0, prefer passing a progress callback to {@link Parser#parse}\n   *\n   * Set the maximum duration in microseconds that parsing should be allowed\n   * to take before halting.\n   *\n   * If parsing takes longer than this, it will halt early, returning `null`.\n   * See {@link Parser#parse} for more information.\n   */\n  setTimeoutMicros(timeout) {\n    C._ts_parser_set_timeout_micros(this[0], 0, timeout);\n  }\n  /** Set the logging callback that a parser should use during parsing. */\n  setLogger(callback) {\n    if (!callback) {\n      this.logCallback = null;\n    } else if (typeof callback !== \"function\") {\n      throw new Error(\"Logger callback must be a function\");\n    } else {\n      this.logCallback = callback;\n    }\n    return this;\n  }\n  /** Get the parser's current logger. */\n  getLogger() {\n    return this.logCallback;\n  }\n};\nexport {\n  CaptureQuantifier,\n  LANGUAGE_VERSION,\n  Language,\n  LookaheadIterator,\n  MIN_COMPATIBLE_VERSION,\n  Node,\n  Parser,\n  Query,\n  Tree,\n  TreeCursor\n};\n//# sourceMappingURL=tree-sitter.js.map\n",
+    "// @bun\nvar __require = import.meta.require;\n\n// src/lib/tree-sitter/parser.worker.ts\nimport { Parser, Query, Language } from \"web-tree-sitter\";\nimport { mkdir as mkdir2 } from \"fs/promises\";\nimport * as path2 from \"path\";\n\n// src/lib/tree-sitter/download-utils.ts\nimport { mkdir, writeFile } from \"fs/promises\";\nimport * as path from \"path\";\n\nclass DownloadUtils {\n  static hashUrl(url) {\n    let hash = 0;\n    for (let i = 0;i < url.length; i++) {\n      const char = url.charCodeAt(i);\n      hash = (hash << 5) - hash + char;\n      hash = hash & hash;\n    }\n    return Math.abs(hash).toString(16);\n  }\n  static async downloadOrLoad(source, cacheDir, cacheSubdir, fileExtension, useHashForCache = true, filetype) {\n    const isUrl = source.startsWith(\"http://\") || source.startsWith(\"https://\");\n    if (isUrl) {\n      let cacheFileName;\n      if (useHashForCache) {\n        const hash = this.hashUrl(source);\n        cacheFileName = filetype ? `${filetype}-${hash}${fileExtension}` : `${hash}${fileExtension}`;\n      } else {\n        cacheFileName = path.basename(source);\n      }\n      const cacheFile = path.join(cacheDir, cacheSubdir, cacheFileName);\n      await mkdir(path.dirname(cacheFile), { recursive: true });\n      try {\n        const cachedContent = await Bun.file(cacheFile).arrayBuffer();\n        if (cachedContent.byteLength > 0) {\n          console.log(`Loaded from cache: ${cacheFile} (${source})`);\n          return { content: cachedContent, filePath: cacheFile };\n        }\n      } catch (error) {}\n      try {\n        console.log(`Downloading from URL: ${source}`);\n        const response = await fetch(source);\n        if (!response.ok) {\n          return { error: `Failed to fetch from ${source}: ${response.statusText}` };\n        }\n        const content = await response.arrayBuffer();\n        try {\n          await writeFile(cacheFile, Buffer.from(content));\n          console.log(`Cached: ${source}`);\n        } catch (cacheError) {\n          console.warn(`Failed to cache: ${cacheError}`);\n        }\n        return { content, filePath: cacheFile };\n      } catch (error) {\n        return { error: `Error downloading from ${source}: ${error}` };\n      }\n    } else {\n      try {\n        console.log(`Loading from local path: ${source}`);\n        const content = await Bun.file(source).arrayBuffer();\n        return { content, filePath: source };\n      } catch (error) {\n        return { error: `Error loading from local path ${source}: ${error}` };\n      }\n    }\n  }\n  static async downloadToPath(source, targetPath) {\n    const isUrl = source.startsWith(\"http://\") || source.startsWith(\"https://\");\n    await mkdir(path.dirname(targetPath), { recursive: true });\n    if (isUrl) {\n      try {\n        console.log(`Downloading from URL: ${source}`);\n        const response = await fetch(source);\n        if (!response.ok) {\n          return { error: `Failed to fetch from ${source}: ${response.statusText}` };\n        }\n        const content = await response.arrayBuffer();\n        await writeFile(targetPath, Buffer.from(content));\n        console.log(`Downloaded: ${source} -> ${targetPath}`);\n        return { content, filePath: targetPath };\n      } catch (error) {\n        return { error: `Error downloading from ${source}: ${error}` };\n      }\n    } else {\n      try {\n        console.log(`Copying from local path: ${source}`);\n        const content = await Bun.file(source).arrayBuffer();\n        await writeFile(targetPath, Buffer.from(content));\n        return { content, filePath: targetPath };\n      } catch (error) {\n        return { error: `Error copying from local path ${source}: ${error}` };\n      }\n    }\n  }\n  static async fetchHighlightQueries(sources, cacheDir, filetype) {\n    const queryPromises = sources.map((source) => this.fetchHighlightQuery(source, cacheDir, filetype));\n    const queryResults = await Promise.all(queryPromises);\n    const validQueries = queryResults.filter((query) => query.trim().length > 0);\n    return validQueries.join(`\n`);\n  }\n  static async fetchHighlightQuery(source, cacheDir, filetype) {\n    const result = await this.downloadOrLoad(source, cacheDir, \"queries\", \".scm\", true, filetype);\n    if (result.error) {\n      console.error(`Error fetching highlight query from ${source}:`, result.error);\n      return \"\";\n    }\n    if (result.content) {\n      return new TextDecoder().decode(result.content);\n    }\n    return \"\";\n  }\n}\n\n// src/lib/tree-sitter/parser.worker.ts\nimport { isMainThread } from \"worker_threads\";\n\n// src/lib/bunfs.ts\nimport { basename as basename2, join as join2 } from \"path\";\nfunction isBunfsPath(path2) {\n  return path2.includes(\"$bunfs\") || /^B:[\\\\/]~BUN/i.test(path2);\n}\nfunction getBunfsRootPath() {\n  return process.platform === \"win32\" ? \"B:\\\\~BUN\\\\root\" : \"/$bunfs/root\";\n}\nfunction normalizeBunfsPath(fileName) {\n  return join2(getBunfsRootPath(), basename2(fileName));\n}\n\n// src/lib/tree-sitter/parser.worker.ts\nvar self = globalThis;\n\nclass ParserWorker {\n  bufferParsers = new Map;\n  filetypeParserOptions = new Map;\n  filetypeParsers = new Map;\n  filetypeParserPromises = new Map;\n  reusableParsers = new Map;\n  reusableParserPromises = new Map;\n  initializePromise;\n  performance;\n  dataPath;\n  tsDataPath;\n  initialized = false;\n  constructor() {\n    this.performance = {\n      averageParseTime: 0,\n      parseTimes: [],\n      averageQueryTime: 0,\n      queryTimes: []\n    };\n  }\n  async fetchQueries(sources, filetype) {\n    if (!this.tsDataPath) {\n      return \"\";\n    }\n    return DownloadUtils.fetchHighlightQueries(sources, this.tsDataPath, filetype);\n  }\n  async initialize({ dataPath }) {\n    if (this.initializePromise) {\n      return this.initializePromise;\n    }\n    this.initializePromise = new Promise(async (resolve, reject) => {\n      this.dataPath = dataPath;\n      this.tsDataPath = path2.join(dataPath, \"tree-sitter\");\n      try {\n        await mkdir2(path2.join(this.tsDataPath, \"languages\"), { recursive: true });\n        await mkdir2(path2.join(this.tsDataPath, \"queries\"), { recursive: true });\n        let { default: treeWasm } = await import(\"web-tree-sitter/tree-sitter.wasm\", {\n          with: { type: \"wasm\" }\n        });\n        if (isBunfsPath(treeWasm)) {\n          treeWasm = normalizeBunfsPath(path2.parse(treeWasm).base);\n        }\n        await Parser.init({\n          locateFile() {\n            return treeWasm;\n          }\n        });\n        this.initialized = true;\n        resolve();\n      } catch (error) {\n        reject(error);\n      }\n    });\n    return this.initializePromise;\n  }\n  addFiletypeParser(filetypeParser) {\n    this.filetypeParserOptions.set(filetypeParser.filetype, filetypeParser);\n  }\n  async createQueries(filetypeParser, language) {\n    try {\n      const highlightQueryContent = await this.fetchQueries(filetypeParser.queries.highlights, filetypeParser.filetype);\n      if (!highlightQueryContent) {\n        console.error(\"Failed to fetch highlight queries for:\", filetypeParser.filetype);\n        return;\n      }\n      const highlightsQuery = new Query(language, highlightQueryContent);\n      const result = {\n        highlights: highlightsQuery\n      };\n      if (filetypeParser.queries.injections && filetypeParser.queries.injections.length > 0) {\n        const injectionQueryContent = await this.fetchQueries(filetypeParser.queries.injections, filetypeParser.filetype);\n        if (injectionQueryContent) {\n          result.injections = new Query(language, injectionQueryContent);\n        }\n      }\n      return result;\n    } catch (error) {\n      console.error(\"Error creating queries for\", filetypeParser.filetype, filetypeParser.queries);\n      console.error(error);\n      return;\n    }\n  }\n  async loadLanguage(languageSource) {\n    if (!this.initialized || !this.tsDataPath) {\n      return;\n    }\n    const result = await DownloadUtils.downloadOrLoad(languageSource, this.tsDataPath, \"languages\", \".wasm\", false);\n    if (result.error) {\n      console.error(`Error loading language ${languageSource}:`, result.error);\n      return;\n    }\n    if (!result.filePath) {\n      return;\n    }\n    const normalizedPath = result.filePath.replaceAll(\"\\\\\", \"/\");\n    try {\n      const language = await Language.load(normalizedPath);\n      return language;\n    } catch (error) {\n      console.error(`Error loading language from ${normalizedPath}:`, error);\n      return;\n    }\n  }\n  async resolveFiletypeParser(filetype) {\n    if (this.filetypeParsers.has(filetype)) {\n      return this.filetypeParsers.get(filetype);\n    }\n    if (this.filetypeParserPromises.has(filetype)) {\n      return this.filetypeParserPromises.get(filetype);\n    }\n    const loadingPromise = this.loadFiletypeParser(filetype);\n    this.filetypeParserPromises.set(filetype, loadingPromise);\n    try {\n      const result = await loadingPromise;\n      if (result) {\n        this.filetypeParsers.set(filetype, result);\n      }\n      return result;\n    } finally {\n      this.filetypeParserPromises.delete(filetype);\n    }\n  }\n  async loadFiletypeParser(filetype) {\n    const filetypeParserOptions = this.filetypeParserOptions.get(filetype);\n    if (!filetypeParserOptions) {\n      return;\n    }\n    const language = await this.loadLanguage(filetypeParserOptions.wasm);\n    if (!language) {\n      return;\n    }\n    const queries = await this.createQueries(filetypeParserOptions, language);\n    if (!queries) {\n      console.error(\"Failed to create queries for:\", filetype);\n      return;\n    }\n    const filetypeParser = {\n      ...filetypeParserOptions,\n      queries,\n      language\n    };\n    return filetypeParser;\n  }\n  async preloadParser(filetype) {\n    return this.resolveFiletypeParser(filetype);\n  }\n  async getReusableParser(filetype) {\n    if (this.reusableParsers.has(filetype)) {\n      return this.reusableParsers.get(filetype);\n    }\n    if (this.reusableParserPromises.has(filetype)) {\n      return this.reusableParserPromises.get(filetype);\n    }\n    const creationPromise = this.createReusableParser(filetype);\n    this.reusableParserPromises.set(filetype, creationPromise);\n    try {\n      const result = await creationPromise;\n      if (result) {\n        this.reusableParsers.set(filetype, result);\n      }\n      return result;\n    } finally {\n      this.reusableParserPromises.delete(filetype);\n    }\n  }\n  async createReusableParser(filetype) {\n    const filetypeParser = await this.resolveFiletypeParser(filetype);\n    if (!filetypeParser) {\n      return;\n    }\n    const parser = new Parser;\n    parser.setLanguage(filetypeParser.language);\n    const reusableState = {\n      parser,\n      filetypeParser,\n      queries: filetypeParser.queries\n    };\n    return reusableState;\n  }\n  async handleInitializeParser(bufferId, version, content, filetype, messageId) {\n    const filetypeParser = await this.resolveFiletypeParser(filetype);\n    if (!filetypeParser) {\n      self.postMessage({\n        type: \"PARSER_INIT_RESPONSE\",\n        bufferId,\n        messageId,\n        hasParser: false,\n        warning: `No parser available for filetype ${filetype}`\n      });\n      return;\n    }\n    const parser = new Parser;\n    parser.setLanguage(filetypeParser.language);\n    const tree = parser.parse(content);\n    if (!tree) {\n      self.postMessage({\n        type: \"PARSER_INIT_RESPONSE\",\n        bufferId,\n        messageId,\n        hasParser: false,\n        error: \"Failed to parse buffer\"\n      });\n      return;\n    }\n    const parserState = {\n      parser,\n      tree,\n      queries: filetypeParser.queries,\n      filetype,\n      content,\n      injectionMapping: filetypeParser.injectionMapping\n    };\n    this.bufferParsers.set(bufferId, parserState);\n    self.postMessage({\n      type: \"PARSER_INIT_RESPONSE\",\n      bufferId,\n      messageId,\n      hasParser: true\n    });\n    const highlights = await this.initialQuery(parserState);\n    self.postMessage({\n      type: \"HIGHLIGHT_RESPONSE\",\n      bufferId,\n      version,\n      ...highlights\n    });\n  }\n  async initialQuery(parserState) {\n    const query = parserState.queries.highlights;\n    const matches = query.captures(parserState.tree.rootNode);\n    let injectionRanges = new Map;\n    if (parserState.queries.injections) {\n      const injectionResult = await this.processInjections(parserState);\n      matches.push(...injectionResult.captures);\n      injectionRanges = injectionResult.injectionRanges;\n    }\n    return this.getHighlights(parserState, matches, injectionRanges);\n  }\n  getNodeText(node, content) {\n    return content.substring(node.startIndex, node.endIndex);\n  }\n  async processInjections(parserState) {\n    const injectionMatches = [];\n    const injectionRanges = new Map;\n    if (!parserState.queries.injections) {\n      return { captures: injectionMatches, injectionRanges };\n    }\n    const content = parserState.content;\n    const injectionCaptures = parserState.queries.injections.captures(parserState.tree.rootNode);\n    const languageGroups = new Map;\n    const injectionMapping = parserState.injectionMapping;\n    for (const capture of injectionCaptures) {\n      const captureName = capture.name;\n      if (captureName === \"injection.content\" || captureName.includes(\"injection\")) {\n        const nodeType = capture.node.type;\n        let targetLanguage;\n        if (injectionMapping?.nodeTypes && injectionMapping.nodeTypes[nodeType]) {\n          targetLanguage = injectionMapping.nodeTypes[nodeType];\n        } else if (nodeType === \"code_fence_content\") {\n          const parent = capture.node.parent;\n          if (parent) {\n            const infoString = parent.children.find((child) => child.type === \"info_string\");\n            if (infoString) {\n              const languageNode = infoString.children.find((child) => child.type === \"language\");\n              if (languageNode) {\n                const languageName = this.getNodeText(languageNode, content);\n                if (injectionMapping?.infoStringMap && injectionMapping.infoStringMap[languageName]) {\n                  targetLanguage = injectionMapping.infoStringMap[languageName];\n                } else {\n                  targetLanguage = languageName;\n                }\n              }\n            }\n          }\n        }\n        if (targetLanguage) {\n          if (!languageGroups.has(targetLanguage)) {\n            languageGroups.set(targetLanguage, []);\n          }\n          languageGroups.get(targetLanguage).push({ node: capture.node, name: capture.name });\n        }\n      }\n    }\n    for (const [language, captures] of languageGroups.entries()) {\n      const injectedParser = await this.getReusableParser(language);\n      if (!injectedParser) {\n        console.warn(`No parser found for injection language: ${language}`);\n        continue;\n      }\n      if (!injectionRanges.has(language)) {\n        injectionRanges.set(language, []);\n      }\n      const parser = injectedParser.parser;\n      for (const { node: injectionNode } of captures) {\n        try {\n          injectionRanges.get(language).push({\n            start: injectionNode.startIndex,\n            end: injectionNode.endIndex\n          });\n          const injectionContent = this.getNodeText(injectionNode, content);\n          const tree = parser.parse(injectionContent);\n          if (tree) {\n            const matches = injectedParser.queries.highlights.captures(tree.rootNode);\n            for (const match of matches) {\n              const offsetCapture = {\n                name: match.name,\n                patternIndex: match.patternIndex,\n                _injectedQuery: injectedParser.queries.highlights,\n                node: {\n                  ...match.node,\n                  startPosition: {\n                    row: match.node.startPosition.row + injectionNode.startPosition.row,\n                    column: match.node.startPosition.row === 0 ? match.node.startPosition.column + injectionNode.startPosition.column : match.node.startPosition.column\n                  },\n                  endPosition: {\n                    row: match.node.endPosition.row + injectionNode.startPosition.row,\n                    column: match.node.endPosition.row === 0 ? match.node.endPosition.column + injectionNode.startPosition.column : match.node.endPosition.column\n                  },\n                  startIndex: match.node.startIndex + injectionNode.startIndex,\n                  endIndex: match.node.endIndex + injectionNode.startIndex\n                }\n              };\n              injectionMatches.push(offsetCapture);\n            }\n            tree.delete();\n          }\n        } catch (error) {\n          console.error(`Error processing injection for language ${language}:`, error);\n        }\n      }\n    }\n    return { captures: injectionMatches, injectionRanges };\n  }\n  editToRange(edit) {\n    return {\n      startPosition: {\n        column: edit.startPosition.column,\n        row: edit.startPosition.row\n      },\n      endPosition: {\n        column: edit.newEndPosition.column,\n        row: edit.newEndPosition.row\n      },\n      startIndex: edit.startIndex,\n      endIndex: edit.newEndIndex\n    };\n  }\n  async handleEdits(bufferId, content, edits) {\n    const parserState = this.bufferParsers.get(bufferId);\n    if (!parserState) {\n      return { warning: \"No parser state found for buffer\" };\n    }\n    parserState.content = content;\n    for (const edit of edits) {\n      parserState.tree.edit(edit);\n    }\n    const startParse = performance.now();\n    const newTree = parserState.parser.parse(content, parserState.tree);\n    const endParse = performance.now();\n    const parseTime = endParse - startParse;\n    this.performance.parseTimes.push(parseTime);\n    if (this.performance.parseTimes.length > 10) {\n      this.performance.parseTimes.shift();\n    }\n    this.performance.averageParseTime = this.performance.parseTimes.reduce((acc, time) => acc + time, 0) / this.performance.parseTimes.length;\n    if (!newTree) {\n      return { error: \"Failed to parse buffer\" };\n    }\n    const changedRanges = parserState.tree.getChangedRanges(newTree);\n    parserState.tree = newTree;\n    const startQuery = performance.now();\n    const matches = [];\n    if (changedRanges.length === 0) {\n      edits.forEach((edit) => {\n        const range = this.editToRange(edit);\n        changedRanges.push(range);\n      });\n    }\n    for (const range of changedRanges) {\n      let node = parserState.tree.rootNode.descendantForPosition(range.startPosition, range.endPosition);\n      if (!node) {\n        continue;\n      }\n      if (node.equals(parserState.tree.rootNode)) {\n        const rangeCaptures = parserState.queries.highlights.captures(node, {\n          startIndex: range.startIndex - 100,\n          endIndex: range.endIndex + 1000\n        });\n        matches.push(...rangeCaptures);\n        continue;\n      }\n      while (node && !this.nodeContainsRange(node, range)) {\n        node = node.parent;\n      }\n      if (!node) {\n        node = parserState.tree.rootNode;\n      }\n      const nodeCaptures = parserState.queries.highlights.captures(node);\n      matches.push(...nodeCaptures);\n    }\n    let injectionRanges = new Map;\n    if (parserState.queries.injections) {\n      const injectionResult = await this.processInjections(parserState);\n      matches.push(...injectionResult.captures);\n      injectionRanges = injectionResult.injectionRanges;\n    }\n    const endQuery = performance.now();\n    const queryTime = endQuery - startQuery;\n    this.performance.queryTimes.push(queryTime);\n    if (this.performance.queryTimes.length > 10) {\n      this.performance.queryTimes.shift();\n    }\n    this.performance.averageQueryTime = this.performance.queryTimes.reduce((acc, time) => acc + time, 0) / this.performance.queryTimes.length;\n    return this.getHighlights(parserState, matches, injectionRanges);\n  }\n  nodeContainsRange(node, range) {\n    return node.startPosition.row <= range.startPosition.row && node.endPosition.row >= range.endPosition.row && (node.startPosition.row < range.startPosition.row || node.startPosition.column <= range.startPosition.column) && (node.endPosition.row > range.endPosition.row || node.endPosition.column >= range.endPosition.column);\n  }\n  getHighlights(parserState, matches, injectionRanges) {\n    const lineHighlights = new Map;\n    const droppedHighlights = new Map;\n    for (const match of matches) {\n      const node = match.node;\n      const startLine = node.startPosition.row;\n      const endLine = node.endPosition.row;\n      const highlight = {\n        startCol: node.startPosition.column,\n        endCol: node.endPosition.column,\n        group: match.name\n      };\n      if (!lineHighlights.has(startLine)) {\n        lineHighlights.set(startLine, new Map);\n        droppedHighlights.set(startLine, new Map);\n      }\n      if (lineHighlights.get(startLine)?.has(node.id)) {\n        droppedHighlights.get(startLine)?.set(node.id, lineHighlights.get(startLine)?.get(node.id));\n      }\n      lineHighlights.get(startLine)?.set(node.id, highlight);\n      if (startLine !== endLine) {\n        for (let line = startLine + 1;line <= endLine; line++) {\n          if (!lineHighlights.has(line)) {\n            lineHighlights.set(line, new Map);\n          }\n          const hl = {\n            startCol: 0,\n            endCol: node.endPosition.column,\n            group: match.name\n          };\n          lineHighlights.get(line)?.set(node.id, hl);\n        }\n      }\n    }\n    return {\n      highlights: Array.from(lineHighlights.entries()).map(([line, lineHighlights2]) => ({\n        line,\n        highlights: Array.from(lineHighlights2.values()),\n        droppedHighlights: droppedHighlights.get(line) ? Array.from(droppedHighlights.get(line).values()) : []\n      }))\n    };\n  }\n  getSimpleHighlights(matches, injectionRanges) {\n    const highlights = [];\n    const flatInjectionRanges = [];\n    for (const [lang, ranges] of injectionRanges.entries()) {\n      for (const range of ranges) {\n        flatInjectionRanges.push({ ...range, lang });\n      }\n    }\n    for (const match of matches) {\n      const node = match.node;\n      let isInjection = false;\n      let injectionLang;\n      let containsInjection = false;\n      for (const injRange of flatInjectionRanges) {\n        if (node.startIndex >= injRange.start && node.endIndex <= injRange.end) {\n          isInjection = true;\n          injectionLang = injRange.lang;\n          break;\n        } else if (node.startIndex <= injRange.start && node.endIndex >= injRange.end) {\n          containsInjection = true;\n          break;\n        }\n      }\n      const matchQuery = match._injectedQuery;\n      const patternProperties = matchQuery?.setProperties?.[match.patternIndex];\n      const concealValue = patternProperties?.conceal ?? match.setProperties?.conceal;\n      const concealLines = patternProperties?.conceal_lines ?? match.setProperties?.conceal_lines;\n      const meta = {};\n      if (isInjection && injectionLang) {\n        meta.isInjection = true;\n        meta.injectionLang = injectionLang;\n      }\n      if (containsInjection) {\n        meta.containsInjection = true;\n      }\n      if (concealValue !== undefined) {\n        meta.conceal = concealValue;\n      }\n      if (concealLines !== undefined) {\n        meta.concealLines = concealLines;\n      }\n      if (Object.keys(meta).length > 0) {\n        highlights.push([node.startIndex, node.endIndex, match.name, meta]);\n      } else {\n        highlights.push([node.startIndex, node.endIndex, match.name]);\n      }\n    }\n    highlights.sort((a, b) => a[0] - b[0]);\n    return highlights;\n  }\n  async handleResetBuffer(bufferId, version, content) {\n    const parserState = this.bufferParsers.get(bufferId);\n    if (!parserState) {\n      return { warning: \"No parser state found for buffer\" };\n    }\n    parserState.content = content;\n    const newTree = parserState.parser.parse(content);\n    if (!newTree) {\n      return { error: \"Failed to parse buffer during reset\" };\n    }\n    parserState.tree = newTree;\n    const matches = parserState.queries.highlights.captures(parserState.tree.rootNode);\n    let injectionRanges = new Map;\n    if (parserState.queries.injections) {\n      const injectionResult = await this.processInjections(parserState);\n      matches.push(...injectionResult.captures);\n      injectionRanges = injectionResult.injectionRanges;\n    }\n    return this.getHighlights(parserState, matches, injectionRanges);\n  }\n  disposeBuffer(bufferId) {\n    const parserState = this.bufferParsers.get(bufferId);\n    if (!parserState) {\n      return;\n    }\n    parserState.tree.delete();\n    parserState.parser.delete();\n    this.bufferParsers.delete(bufferId);\n  }\n  async handleOneShotHighlight(content, filetype, messageId) {\n    const reusableState = await this.getReusableParser(filetype);\n    if (!reusableState) {\n      self.postMessage({\n        type: \"ONESHOT_HIGHLIGHT_RESPONSE\",\n        messageId,\n        hasParser: false,\n        warning: `No parser available for filetype ${filetype}`\n      });\n      return;\n    }\n    const parseContent = filetype === \"markdown\" && content.endsWith(\"```\") ? content + `\n` : content;\n    const tree = reusableState.parser.parse(parseContent);\n    if (!tree) {\n      self.postMessage({\n        type: \"ONESHOT_HIGHLIGHT_RESPONSE\",\n        messageId,\n        hasParser: false,\n        error: \"Failed to parse content\"\n      });\n      return;\n    }\n    try {\n      const matches = reusableState.filetypeParser.queries.highlights.captures(tree.rootNode);\n      let injectionRanges = new Map;\n      if (reusableState.filetypeParser.queries.injections) {\n        const parserState = {\n          parser: reusableState.parser,\n          tree,\n          queries: reusableState.filetypeParser.queries,\n          filetype,\n          content,\n          injectionMapping: reusableState.filetypeParser.injectionMapping\n        };\n        const injectionResult = await this.processInjections(parserState);\n        matches.push(...injectionResult.captures);\n        injectionRanges = injectionResult.injectionRanges;\n      }\n      const highlights = this.getSimpleHighlights(matches, injectionRanges);\n      self.postMessage({\n        type: \"ONESHOT_HIGHLIGHT_RESPONSE\",\n        messageId,\n        hasParser: true,\n        highlights\n      });\n    } finally {\n      tree.delete();\n    }\n  }\n  async updateDataPath(dataPath) {\n    this.dataPath = dataPath;\n    this.tsDataPath = path2.join(dataPath, \"tree-sitter\");\n    try {\n      await mkdir2(path2.join(this.tsDataPath, \"languages\"), { recursive: true });\n      await mkdir2(path2.join(this.tsDataPath, \"queries\"), { recursive: true });\n    } catch (error) {\n      throw new Error(`Failed to update data path: ${error}`);\n    }\n  }\n  async clearCache() {\n    if (!this.dataPath || !this.tsDataPath) {\n      throw new Error(\"No data path configured\");\n    }\n    const { rm } = await import(\"fs/promises\");\n    try {\n      const treeSitterPath = path2.join(this.dataPath, \"tree-sitter\");\n      await rm(treeSitterPath, { recursive: true, force: true });\n      await mkdir2(path2.join(treeSitterPath, \"languages\"), { recursive: true });\n      await mkdir2(path2.join(treeSitterPath, \"queries\"), { recursive: true });\n      this.filetypeParsers.clear();\n      this.filetypeParserPromises.clear();\n      this.reusableParsers.clear();\n      this.reusableParserPromises.clear();\n    } catch (error) {\n      throw new Error(`Failed to clear cache: ${error}`);\n    }\n  }\n}\nif (!isMainThread) {\n  let logMessage = function(type, ...args) {\n    self.postMessage({\n      type: \"WORKER_LOG\",\n      logType: type,\n      data: args\n    });\n  };\n  const worker = new ParserWorker;\n  console.log = (...args) => logMessage(\"log\", ...args);\n  console.error = (...args) => logMessage(\"error\", ...args);\n  console.warn = (...args) => logMessage(\"warn\", ...args);\n  self.onmessage = async (e) => {\n    const { type, bufferId, version, content, filetype, edits, filetypeParser, messageId, dataPath } = e.data;\n    try {\n      switch (type) {\n        case \"INIT\":\n          try {\n            await worker.initialize({ dataPath });\n            self.postMessage({ type: \"INIT_RESPONSE\" });\n          } catch (error) {\n            self.postMessage({\n              type: \"INIT_RESPONSE\",\n              error: error instanceof Error ? error.stack || error.message : String(error)\n            });\n          }\n          break;\n        case \"ADD_FILETYPE_PARSER\":\n          worker.addFiletypeParser(filetypeParser);\n          break;\n        case \"PRELOAD_PARSER\":\n          const maybeParser = await worker.preloadParser(filetype);\n          self.postMessage({ type: \"PRELOAD_PARSER_RESPONSE\", messageId, hasParser: !!maybeParser });\n          break;\n        case \"INITIALIZE_PARSER\":\n          await worker.handleInitializeParser(bufferId, version, content, filetype, messageId);\n          break;\n        case \"HANDLE_EDITS\":\n          const response = await worker.handleEdits(bufferId, content, edits);\n          if (response.highlights && response.highlights.length > 0) {\n            self.postMessage({ type: \"HIGHLIGHT_RESPONSE\", bufferId, version, ...response });\n          } else if (response.warning) {\n            self.postMessage({ type: \"WARNING\", bufferId, warning: response.warning });\n          } else if (response.error) {\n            self.postMessage({ type: \"ERROR\", bufferId, error: response.error });\n          }\n          break;\n        case \"GET_PERFORMANCE\":\n          self.postMessage({ type: \"PERFORMANCE_RESPONSE\", performance: worker.performance, messageId });\n          break;\n        case \"RESET_BUFFER\":\n          const resetResponse = await worker.handleResetBuffer(bufferId, version, content);\n          if (resetResponse.highlights && resetResponse.highlights.length > 0) {\n            self.postMessage({ type: \"HIGHLIGHT_RESPONSE\", bufferId, version, ...resetResponse });\n          } else if (resetResponse.warning) {\n            self.postMessage({ type: \"WARNING\", bufferId, warning: resetResponse.warning });\n          } else if (resetResponse.error) {\n            self.postMessage({ type: \"ERROR\", bufferId, error: resetResponse.error });\n          }\n          break;\n        case \"DISPOSE_BUFFER\":\n          worker.disposeBuffer(bufferId);\n          self.postMessage({ type: \"BUFFER_DISPOSED\", bufferId });\n          break;\n        case \"ONESHOT_HIGHLIGHT\":\n          await worker.handleOneShotHighlight(content, filetype, messageId);\n          break;\n        case \"UPDATE_DATA_PATH\":\n          try {\n            await worker.updateDataPath(dataPath);\n            self.postMessage({ type: \"UPDATE_DATA_PATH_RESPONSE\", messageId });\n          } catch (error) {\n            self.postMessage({\n              type: \"UPDATE_DATA_PATH_RESPONSE\",\n              messageId,\n              error: error instanceof Error ? error.message : String(error)\n            });\n          }\n          break;\n        case \"CLEAR_CACHE\":\n          try {\n            await worker.clearCache();\n            self.postMessage({ type: \"CLEAR_CACHE_RESPONSE\", messageId });\n          } catch (error) {\n            self.postMessage({\n              type: \"CLEAR_CACHE_RESPONSE\",\n              messageId,\n              error: error instanceof Error ? error.message : String(error)\n            });\n          }\n          break;\n        default:\n          self.postMessage({\n            type: \"ERROR\",\n            bufferId,\n            error: `Unknown message type: ${type}`\n          });\n      }\n    } catch (error) {\n      self.postMessage({\n        type: \"ERROR\",\n        bufferId,\n        error: error instanceof Error ? error.stack || error.message : String(error)\n      });\n    }\n  };\n}\n\n//# debugId=D486E9806A62187464756E2164756E21\n//# sourceMappingURL=parser.worker.js.map\n"
+  ],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAYA,SAAS,cAAc,CAAC,GAAG;AAAA,EACzB,IAAI,MAAM;AAAA,IAAU,MAAM,IAAI,MAAM,qBAAqB;AAAA;AAG3D,SAAS,OAAO,CAAC,OAAO;AAAA,EACtB,OAAO,CAAC,CAAC,SAAS,OAAO,MAAM,QAAQ,YAAY,OAAO,MAAM,WAAW;AAAA;AAG7E,SAAS,SAAS,CAAC,SAAS;AAAA,EAC1B,IAAI;AAAA;AA2EN,SAAS,OAAO,CAAC,MAAM,YAAY,UAAU,eAAe;AAAA,EAC1D,MAAM,SAAS,WAAW;AAAA,EAC1B,IAAI,SAAS,KAAK,aAAa,YAAY,aAAa;AAAA,EACxD,IAAI,QAAQ;AAAA,IACV,cAAc,OAAO;AAAA,IACrB,OAAO,aAAa,UAAU;AAAA,MAC5B,MAAM,SAAS,KAAK,aAAa,YAAY,aAAa;AAAA,MAC1D,IAAI,UAAU,OAAO,SAAS,GAAG;AAAA,QAC/B,cAAc,OAAO;AAAA,QACrB,UAAU;AAAA,MACZ,EAAO;AAAA,QACL;AAAA;AAAA,IAEJ;AAAA,IACA,IAAI,aAAa,UAAU;AAAA,MACzB,SAAS,OAAO,MAAM,GAAG,MAAM;AAAA,IACjC;AAAA,EACF;AAAA,EACA,OAAO,UAAU;AAAA;AA07BnB,SAAS,iBAAiB,CAAC,OAAO,MAAM,SAAS,cAAc,QAAQ;AAAA,EACrE,SAAS,KAAK,GAAG,IAAI,OAAO,OAAQ,KAAK,GAAG,MAAM;AAAA,IAChD,MAAM,eAAe,EAAE,SAAS,SAAS,KAAK;AAAA,IAC9C,WAAW;AAAA,IACX,MAAM,OAAO,cAAc,MAAM,OAAO;AAAA,IACxC,WAAW;AAAA,IACX,OAAO,MAAM,EAAE,cAAc,MAAM,MAAM,aAAa,eAAe,KAAK;AAAA,EAC5E;AAAA,EACA,OAAO;AAAA;AAGT,SAAS,WAAW,CAAC,MAAM,QAAQ,GAAG;AAAA,EACpC,IAAI,UAAU,kBAAkB,QAAQ;AAAA,EACxC,EAAE,SAAS,SAAS,KAAK,IAAI,KAAK;AAAA,EAClC,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,KAAK,YAAY,KAAK;AAAA,EAC1C,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,KAAK,cAAc,KAAK,KAAK;AAAA,EACjD,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,KAAK,cAAc,QAAQ,KAAK;AAAA,EACpD,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,KAAK,IAAI,KAAK;AAAA;AAGpC,SAAS,aAAa,CAAC,MAAM,UAAU,iBAAiB;AAAA,EACtD,MAAM,KAAK,EAAE,SAAS,SAAS,KAAK;AAAA,EACpC,WAAW;AAAA,EACX,IAAI,OAAO;AAAA,IAAG,OAAO;AAAA,EACrB,MAAM,QAAQ,EAAE,SAAS,SAAS,KAAK;AAAA,EACvC,WAAW;AAAA,EACX,MAAM,MAAM,EAAE,SAAS,SAAS,KAAK;AAAA,EACrC,WAAW;AAAA,EACX,MAAM,SAAS,EAAE,SAAS,SAAS,KAAK;AAAA,EACxC,WAAW;AAAA,EACX,MAAM,QAAQ,EAAE,SAAS,SAAS,KAAK;AAAA,EACvC,MAAM,SAAS,IAAI,KAAK,UAAU;AAAA,IAChC;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ,eAAe,EAAE,KAAK,OAAO;AAAA,IAC7B;AAAA,EACF,CAAC;AAAA,EACD,OAAO;AAAA;AAGT,SAAS,iBAAiB,CAAC,QAAQ,UAAU,iBAAiB;AAAA,EAC5D,EAAE,SAAS,UAAU,IAAI,aAAa,OAAO,IAAI,KAAK;AAAA,EACtD,EAAE,SAAS,UAAU,IAAI,aAAa,OAAO,IAAI,KAAK;AAAA,EACtD,EAAE,SAAS,UAAU,IAAI,aAAa,OAAO,IAAI,KAAK;AAAA,EACtD,EAAE,SAAS,UAAU,IAAI,aAAa,OAAO,IAAI,KAAK;AAAA;AAGxD,SAAS,mBAAmB,CAAC,QAAQ;AAAA,EACnC,OAAO,KAAK,EAAE,SAAS,kBAAkB,IAAI,aAAa,KAAK;AAAA,EAC/D,OAAO,KAAK,EAAE,SAAS,kBAAkB,IAAI,aAAa,KAAK;AAAA,EAC/D,OAAO,KAAK,EAAE,SAAS,kBAAkB,IAAI,aAAa,KAAK;AAAA,EAC/D,OAAO,KAAK,EAAE,SAAS,kBAAkB,IAAI,aAAa,KAAK;AAAA;AAGjE,SAAS,YAAY,CAAC,SAAS,OAAO;AAAA,EACpC,EAAE,SAAS,SAAS,MAAM,KAAK,KAAK;AAAA,EACpC,EAAE,SAAS,UAAU,aAAa,MAAM,QAAQ,KAAK;AAAA;AAGvD,SAAS,cAAc,CAAC,SAAS;AAAA,EAC/B,MAAM,SAAS;AAAA,IACb,KAAK,EAAE,SAAS,SAAS,KAAK,MAAM;AAAA,IACpC,QAAQ,EAAE,SAAS,UAAU,aAAa,KAAK,MAAM;AAAA,EACvD;AAAA,EACA,OAAO;AAAA;AAGT,SAAS,YAAY,CAAC,SAAS,OAAO;AAAA,EACpC,aAAa,SAAS,MAAM,aAAa;AAAA,EACzC,WAAW;AAAA,EACX,aAAa,SAAS,MAAM,WAAW;AAAA,EACvC,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,MAAM,YAAY,KAAK;AAAA,EAC3C,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,MAAM,UAAU,KAAK;AAAA,EACzC,WAAW;AAAA;AAGb,SAAS,cAAc,CAAC,SAAS;AAAA,EAC/B,MAAM,SAAS,CAAC;AAAA,EAChB,OAAO,gBAAgB,eAAe,OAAO;AAAA,EAC7C,WAAW;AAAA,EACX,OAAO,cAAc,eAAe,OAAO;AAAA,EAC3C,WAAW;AAAA,EACX,OAAO,aAAa,EAAE,SAAS,SAAS,KAAK,MAAM;AAAA,EACnD,WAAW;AAAA,EACX,OAAO,WAAW,EAAE,SAAS,SAAS,KAAK,MAAM;AAAA,EACjD,OAAO;AAAA;AAGT,SAAS,WAAW,CAAC,MAAM,UAAU,iBAAiB;AAAA,EACpD,aAAa,SAAS,KAAK,aAAa;AAAA,EACxC,WAAW;AAAA,EACX,aAAa,SAAS,KAAK,cAAc;AAAA,EACzC,WAAW;AAAA,EACX,aAAa,SAAS,KAAK,cAAc;AAAA,EACzC,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,KAAK,YAAY,KAAK;AAAA,EAC1C,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,KAAK,aAAa,KAAK;AAAA,EAC3C,WAAW;AAAA,EACX,EAAE,SAAS,SAAS,KAAK,aAAa,KAAK;AAAA,EAC3C,WAAW;AAAA;AAGb,SAAS,yBAAyB,CAAC,SAAS;AAAA,EAC1C,MAAM,gBAAgB,EAAE,SAAS,SAAS,KAAK;AAAA,EAC/C,MAAM,gBAAgB,EAAE,SAAS,WAAW,aAAa,KAAK;AAAA,EAC9D,MAAM,gBAAgB,EAAE,SAAS,WAAW,aAAa,KAAK;AAAA,EAC9D,OAAO,EAAE,eAAe,eAAe,cAAc;AAAA;AAoDvD,SAAS,iBAAiB,CAAC,OAAO,OAAO,UAAU,gBAAgB;AAAA,EACjE,IAAI,MAAM,WAAW,GAAG;AAAA,IACtB,MAAM,IAAI,MACR,mCAAmC,yCAAyC,MAAM,SAAS,GAC7F;AAAA,EACF;AAAA,EACA,IAAI,CAAC,cAAc,MAAM,EAAE,GAAG;AAAA,IAC5B,MAAM,IAAI,MACR,wBAAwB,gDAAgD,MAAM,GAAG,QACnF;AAAA,EACF;AAAA,EACA,MAAM,aAAa,aAAa,SAAS,aAAa;AAAA,EACtD,MAAM,WAAW,CAAC,SAAS,WAAW,MAAM;AAAA,EAC5C,IAAI,cAAc,MAAM,EAAE,GAAG;AAAA,IAC3B,MAAM,eAAe,MAAM,GAAG;AAAA,IAC9B,MAAM,eAAe,MAAM,GAAG;AAAA,IAC9B,eAAe,OAAO,KAAK,CAAC,aAAa;AAAA,MACvC,MAAM,SAAS,CAAC;AAAA,MAChB,MAAM,SAAS,CAAC;AAAA,MAChB,WAAW,KAAK,UAAU;AAAA,QACxB,IAAI,EAAE,SAAS;AAAA,UAAc,OAAO,KAAK,EAAE,IAAI;AAAA,QAC/C,IAAI,EAAE,SAAS;AAAA,UAAc,OAAO,KAAK,EAAE,IAAI;AAAA,MACjD;AAAA,MACA,MAAM,UAA0B,OAAO,CAAC,IAAI,IAAI,aAAa;AAAA,QAC3D,OAAO,WAAW,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS,GAAG;AAAA,SACtD,SAAS;AAAA,MACZ,OAAO,WAAW,OAAO,MAAM,CAAC,OAAO,OAAO,KAAK,CAAC,OAAO,QAAQ,IAAI,IAAI,UAAU,CAAC,CAAC,IAAI,OAAO,KAAK,CAAC,OAAO,OAAO,KAAK,CAAC,OAAO,QAAQ,IAAI,IAAI,UAAU,CAAC,CAAC;AAAA,KAChK;AAAA,EACH,EAAO;AAAA,IACL,MAAM,cAAc,MAAM,GAAG;AAAA,IAC7B,MAAM,cAAc,MAAM,GAAG;AAAA,IAC7B,MAAM,UAA0B,OAAO,CAAC,MAAM,EAAE,SAAS,aAAa,SAAS;AAAA,IAC/E,MAAM,eAA+B,OAAO,CAAC,MAAM,EAAE,SAAS,aAAa,cAAc;AAAA,IACzF,eAAe,OAAO,KAAK,CAAC,aAAa;AAAA,MACvC,MAAM,QAAQ,CAAC;AAAA,MACf,WAAW,KAAK,UAAU;AAAA,QACxB,IAAI,EAAE,SAAS;AAAA,UAAa,MAAM,KAAK,EAAE,IAAI;AAAA,MAC/C;AAAA,MACA,MAAM,OAAO,aAAa,UAAU;AAAA,MACpC,OAAO,WAAW,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK,IAAI;AAAA,KACtD;AAAA;AAAA;AAIL,SAAS,mBAAmB,CAAC,OAAO,OAAO,UAAU,gBAAgB;AAAA,EACnE,IAAI,MAAM,WAAW,GAAG;AAAA,IACtB,MAAM,IAAI,MACR,mCAAmC,yCAAyC,MAAM,SAAS,IAC7F;AAAA,EACF;AAAA,EACA,IAAI,MAAM,GAAG,SAAS,WAAW;AAAA,IAC/B,MAAM,IAAI,MACR,wBAAwB,gDAAgD,MAAM,GAAG,SACnF;AAAA,EACF;AAAA,EACA,IAAI,MAAM,GAAG,SAAS,UAAU;AAAA,IAC9B,MAAM,IAAI,MACR,yBAAyB,+CAA+C,MAAM,GAAG,OACnF;AAAA,EACF;AAAA,EACA,MAAM,aAAa,aAAa,YAAY,aAAa;AAAA,EACzD,MAAM,WAAW,CAAC,SAAS,WAAW,MAAM;AAAA,EAC5C,MAAM,cAAc,MAAM,GAAG;AAAA,EAC7B,MAAM,QAAQ,IAAI,OAAO,MAAM,GAAG,KAAK;AAAA,EACvC,eAAe,OAAO,KAAK,CAAC,aAAa;AAAA,IACvC,MAAM,QAAQ,CAAC;AAAA,IACf,WAAW,KAAK,UAAU;AAAA,MACxB,IAAI,EAAE,SAAS;AAAA,QAAa,MAAM,KAAK,EAAE,KAAK,IAAI;AAAA,IACpD;AAAA,IACA,MAAM,OAAuB,OAAO,CAAC,MAAM,aAAa;AAAA,MACtD,OAAO,WAAW,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;AAAA,OACpD,MAAM;AAAA,IACT,IAAI,MAAM,WAAW;AAAA,MAAG,OAAO,CAAC;AAAA,IAChC,OAAO,WAAW,MAAM,MAAM,CAAC,SAAS,KAAK,MAAM,UAAU,CAAC,IAAI,MAAM,KAAK,CAAC,SAAS,KAAK,MAAM,UAAU,CAAC;AAAA,GAC9G;AAAA;AAGH,SAAS,mBAAmB,CAAC,OAAO,OAAO,UAAU,gBAAgB;AAAA,EACnE,IAAI,MAAM,SAAS,GAAG;AAAA,IACpB,MAAM,IAAI,MACR,mCAAmC,kDAAkD,MAAM,SAAS,IACtG;AAAA,EACF;AAAA,EACA,IAAI,MAAM,GAAG,SAAS,WAAW;AAAA,IAC/B,MAAM,IAAI,MACR,wBAAwB,gDAAgD,MAAM,GAAG,SACnF;AAAA,EACF;AAAA,EACA,MAAM,aAAa,aAAa;AAAA,EAChC,MAAM,cAAc,MAAM,GAAG;AAAA,EAC7B,MAAM,cAAc,MAAM,MAAM,CAAC;AAAA,EACjC,IAAI,CAAC,YAAY,MAAM,YAAY,GAAG;AAAA,IACpC,MAAM,IAAI,MACR,mBAAmB,yCACrB;AAAA,EACF;AAAA,EACA,MAAM,SAAS,YAAY,IAAI,CAAC,MAAM,EAAE,KAAK;AAAA,EAC7C,eAAe,OAAO,KAAK,CAAC,aAAa;AAAA,IACvC,MAAM,QAAQ,CAAC;AAAA,IACf,WAAW,KAAK,UAAU;AAAA,MACxB,IAAI,EAAE,SAAS;AAAA,QAAa,MAAM,KAAK,EAAE,KAAK,IAAI;AAAA,IACpD;AAAA,IACA,IAAI,MAAM,WAAW;AAAA,MAAG,OAAO,CAAC;AAAA,IAChC,OAAO,MAAM,MAAM,CAAC,SAAS,OAAO,SAAS,IAAI,CAAC,MAAM;AAAA,GACzD;AAAA;AAGH,SAAS,gBAAgB,CAAC,OAAO,OAAO,UAAU,oBAAoB,mBAAmB;AAAA,EACvF,IAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG;AAAA,IACxC,MAAM,IAAI,MACR,mCAAmC,8CAA8C,MAAM,SAAS,IAClG;AAAA,EACF;AAAA,EACA,IAAI,CAAC,MAAM,MAAM,YAAY,GAAG;AAAA,IAC9B,MAAM,IAAI,MACR,mBAAmB,yCACrB;AAAA,EACF;AAAA,EACA,MAAM,aAAa,aAAa,QAAQ,qBAAqB;AAAA,EAC7D,IAAI,CAAC,WAAW;AAAA,IAAQ,WAAW,SAAS,CAAC;AAAA,EAC7C,WAAW,OAAO,MAAM,GAAG,SAAS,MAAM,IAAI,SAAS;AAAA;AAGzD,SAAS,iBAAiB,CAAC,OAAO,OAAO,eAAe;AAAA,EACtD,IAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG;AAAA,IACxC,MAAM,IAAI,MAAM,0EAA0E,MAAM,SAAS,IAAI;AAAA,EAC/G;AAAA,EACA,IAAI,CAAC,MAAM,MAAM,YAAY,GAAG;AAAA,IAC9B,MAAM,IAAI,MAAM,qDAAqD;AAAA,EACvE;AAAA,EACA,IAAI,CAAC,cAAc;AAAA,IAAQ,cAAc,SAAS,CAAC;AAAA,EACnD,cAAc,OAAO,MAAM,GAAG,SAAS,MAAM,IAAI,SAAS;AAAA;AAG5D,SAAS,YAAY,CAAC,OAAO,UAAU,aAAa,cAAc,cAAc,OAAO,gBAAgB,YAAY,eAAe,oBAAoB,mBAAmB;AAAA,EACvK,IAAI,aAAa,6BAA6B;AAAA,IAC5C,MAAM,QAAQ,aAAa;AAAA,IAC3B,MAAM,KAAK,EAAE,MAAM,WAAW,MAAM,MAAM,CAAC;AAAA,EAC7C,EAAO,SAAI,aAAa,4BAA4B;AAAA,IAClD,MAAM,KAAK,EAAE,MAAM,UAAU,OAAO,aAAa,aAAa,CAAC;AAAA,EACjE,EAAO,SAAI,MAAM,SAAS,GAAG;AAAA,IAC3B,IAAI,MAAM,GAAG,SAAS,UAAU;AAAA,MAC9B,MAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAAA,IACA,MAAM,WAAW,MAAM,GAAG;AAAA,IAC1B,QAAQ;AAAA,WACD;AAAA,WACA;AAAA,WACA;AAAA,WACA;AAAA,QACH,kBAAkB,OAAO,OAAO,UAAU,cAAc;AAAA,QACxD;AAAA,WACG;AAAA,WACA;AAAA,WACA;AAAA,WACA;AAAA,QACH,oBAAoB,OAAO,OAAO,UAAU,cAAc;AAAA,QAC1D;AAAA,WACG;AAAA,WACA;AAAA,QACH,oBAAoB,OAAO,OAAO,UAAU,cAAc;AAAA,QAC1D;AAAA,WACG;AAAA,WACA;AAAA,QACH,iBAAiB,OAAO,OAAO,UAAU,oBAAoB,iBAAiB;AAAA,QAC9E;AAAA,WACG;AAAA,QACH,kBAAkB,OAAO,OAAO,aAAa;AAAA,QAC7C;AAAA;AAAA,QAEA,WAAW,OAAO,KAAK,EAAE,UAAU,UAAU,MAAM,MAAM,CAAC,EAAE,CAAC;AAAA;AAAA,IAEjE,MAAM,SAAS;AAAA,EACjB;AAAA;AA4xEF,eAAe,iBAAiB,CAAC,eAAe;AAAA,EAC9C,IAAI,CAAC,SAAS;AAAA,IACZ,UAAU,MAAM,oBAAoB,aAAa;AAAA,EACnD;AAAA,EACA,OAAO;AAAA;AAGT,SAAS,WAAW,GAAG;AAAA,EACrB,OAAO,CAAC,CAAC;AAAA;AAAA,IAnqHP,YACA,SAAS,CAAC,QAAQ,UAAU,WAAU,QAAQ,QAAQ,EAAE,OAAO,cAAc,KAAK,CAAC,GAGnF,gBAAgB,GAChB,cAAc,GACd,gBACA,cACA,eACA,eACA,YACA,UAaA,GAGA,mBA0FA,MA2GA,YA+RA,MAoqBA,8BAA8B,GAC9B,6BAA6B,GAC7B,kBACA,mBAOA,eACA,cACA,gBAOA,YA4MA,OAiZA,yBACA,UA0PA,SAyoDA,qBAGA,UAAU,MAcV,iBACA,kBACA,wBACA;AAAA;AAAA,EA3qHA,aAAY,OAAO;AAAA,EAMnB,iBAAiB,IAAI;AAAA,EACrB,eAAe,IAAI;AAAA,EACnB,gBAAgB,IAAI;AAAA,EACpB,gBAAgB,IAAI,cAAc,IAAI;AAAA,EACtC,aAAa,EAAE,KAAK,GAAG,QAAQ,EAAE;AAAA,EACjC,WAAW,OAAO,UAAU;AAAA,EAIhC,OAAO,gBAAgB,gBAAgB;AAAA,EAIvC,OAAO,SAAS,SAAS;AAAA,EAIzB,OAAO,WAAW,WAAW;AAAA,EAIzB,oBAAoB,MAAM;AAAA,WACrB;AAAA,MACL,OAAO,MAAM,mBAAmB;AAAA;AAAA,KAGjC,KAAK;AAAA,IAGN;AAAA,IAEA,WAAW,CAAC,UAAU,SAAS,UAAU;AAAA,MACvC,eAAe,QAAQ;AAAA,MACvB,KAAK,KAAK;AAAA,MACV,KAAK,WAAW;AAAA;AAAA,QAGd,aAAa,GAAG;AAAA,MAClB,OAAO,EAAE,sCAAsC,KAAK,EAAE;AAAA;AAAA,QAGpD,WAAW,GAAG;AAAA,MAChB,OAAO,KAAK,SAAS,MAAM,KAAK,kBAAkB;AAAA;AAAA,IAGpD,MAAM,GAAG;AAAA,MACP,EAAE,8BAA8B,KAAK,EAAE;AAAA,MACvC,KAAK,KAAK;AAAA;AAAA,IAQZ,KAAK,CAAC,UAAU,SAAS;AAAA,MACvB,IAAI,EAAE,6BAA6B,KAAK,IAAI,SAAS,IAAI,OAAO,GAAG;AAAA,QACjE,KAAK,WAAW;AAAA,QAChB,OAAO;AAAA,MACT;AAAA,MACA,OAAO;AAAA;AAAA,IAQT,UAAU,CAAC,SAAS;AAAA,MAClB,OAAO,QAAQ,EAAE,mCAAmC,KAAK,IAAI,OAAO,CAAC;AAAA;AAAA,KAQtE,OAAO,SAAS,GAAG;AAAA,MAClB,OAAO;AAAA,QACL,MAAsB,OAAO,MAAM;AAAA,UACjC,IAAI,EAAE,4BAA4B,KAAK,EAAE,GAAG;AAAA,YAC1C,OAAO,EAAE,MAAM,OAAO,OAAO,KAAK,YAAY;AAAA,UAChD;AAAA,UACA,OAAO,EAAE,MAAM,MAAM,OAAO,GAAG;AAAA,WAC9B,MAAM;AAAA,MACX;AAAA;AAAA,EAEJ;AAAA,EAuBA,OAAO,SAAS,SAAS;AAAA,EACrB,OAAO,MAAM,MAAM;AAAA,WACd;AAAA,MACL,OAAO,MAAM,MAAM;AAAA;AAAA,KAGpB,KAAK;AAAA,IAGN;AAAA,IAEA;AAAA,IAEA,WAAW,CAAC,UAAU,SAAS,UAAU,cAAc;AAAA,MACrD,eAAe,QAAQ;AAAA,MACvB,KAAK,KAAK;AAAA,MACV,KAAK,WAAW;AAAA,MAChB,KAAK,eAAe;AAAA;AAAA,IAGtB,IAAI,GAAG;AAAA,MACL,MAAM,UAAU,EAAE,cAAc,KAAK,EAAE;AAAA,MACvC,OAAO,IAAI,MAAM,UAAU,SAAS,KAAK,UAAU,KAAK,YAAY;AAAA;AAAA,IAGtE,MAAM,GAAG;AAAA,MACP,EAAE,gBAAgB,KAAK,EAAE;AAAA,MACzB,KAAK,KAAK;AAAA;AAAA,QAGR,QAAQ,GAAG;AAAA,MACb,EAAE,wBAAwB,KAAK,EAAE;AAAA,MACjC,OAAO,cAAc,IAAI;AAAA;AAAA,IAM3B,kBAAkB,CAAC,aAAa,cAAc;AAAA,MAC5C,MAAM,UAAU,kBAAkB;AAAA,MAClC,EAAE,SAAS,SAAS,aAAa,KAAK;AAAA,MACtC,aAAa,UAAU,aAAa,YAAY;AAAA,MAChD,EAAE,oCAAoC,KAAK,EAAE;AAAA,MAC7C,OAAO,cAAc,IAAI;AAAA;AAAA,IAS3B,IAAI,CAAC,MAAM;AAAA,MACT,YAAY,IAAI;AAAA,MAChB,EAAE,mBAAmB,KAAK,EAAE;AAAA;AAAA,IAG9B,IAAI,GAAG;AAAA,MACL,OAAO,KAAK,SAAS,KAAK;AAAA;AAAA,IAa5B,gBAAgB,CAAC,OAAO;AAAA,MACtB,IAAI,EAAE,iBAAiB,QAAQ;AAAA,QAC7B,MAAM,IAAI,UAAU,yBAAyB;AAAA,MAC/C;AAAA,MACA,EAAE,iCAAiC,KAAK,IAAI,MAAM,EAAE;AAAA,MACpD,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAC/C,MAAM,SAAS,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MAC9D,MAAM,SAAS,IAAI,MAAM,KAAK;AAAA,MAC9B,IAAI,QAAQ,GAAG;AAAA,QACb,IAAI,UAAU;AAAA,QACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,UACjC,OAAO,MAAM,eAAe,OAAO;AAAA,UACnC,WAAW;AAAA,QACb;AAAA,QACA,EAAE,MAAM,MAAM;AAAA,MAChB;AAAA,MACA,OAAO;AAAA;AAAA,IAGT,iBAAiB,GAAG;AAAA,MAClB,EAAE,8BAA8B,KAAK,EAAE;AAAA,MACvC,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAC/C,MAAM,SAAS,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MAC9D,MAAM,SAAS,IAAI,MAAM,KAAK;AAAA,MAC9B,IAAI,QAAQ,GAAG;AAAA,QACb,IAAI,UAAU;AAAA,QACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,UACjC,OAAO,MAAM,eAAe,OAAO;AAAA,UACnC,WAAW;AAAA,QACb;AAAA,QACA,EAAE,MAAM,MAAM;AAAA,MAChB;AAAA,MACA,OAAO;AAAA;AAAA,EAEX;AAAA,EAGI,aAAa,MAAM,YAAY;AAAA,WAC1B;AAAA,MACL,OAAO,MAAM,YAAY;AAAA;AAAA,KAI1B,KAAK;AAAA,KAIL,KAAK;AAAA,KAIL,KAAK;AAAA,KAIL,KAAK;AAAA,IAGN;AAAA,IAEA,WAAW,CAAC,UAAU,MAAM;AAAA,MAC1B,eAAe,QAAQ;AAAA,MACvB,KAAK,OAAO;AAAA,MACZ,oBAAoB,IAAI;AAAA;AAAA,IAG1B,IAAI,GAAG;AAAA,MACL,MAAM,OAAO,IAAI,YAAY,UAAU,KAAK,IAAI;AAAA,MAChD,EAAE,0BAA0B,KAAK,KAAK,EAAE;AAAA,MACxC,oBAAoB,IAAI;AAAA,MACxB,OAAO;AAAA;AAAA,IAGT,MAAM,GAAG;AAAA,MACP,kBAAkB,IAAI;AAAA,MACtB,EAAE,4BAA4B,KAAK,KAAK,EAAE;AAAA,MAC1C,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAAA;AAAA,QAG5B,WAAW,GAAG;AAAA,MAChB,kBAAkB,IAAI;AAAA,MACtB,EAAE,kCAAkC,KAAK,KAAK,EAAE;AAAA,MAChD,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,QAO5B,cAAc,GAAG;AAAA,MACnB,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,sCAAsC,KAAK,KAAK,EAAE;AAAA;AAAA,QAGzD,gBAAgB,GAAG;AAAA,MACrB,OAAO,KAAK,KAAK,SAAS,OAAO,KAAK;AAAA;AAAA,QAMpC,YAAY,GAAG;AAAA,MACjB,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,mCAAmC,KAAK,KAAK,EAAE;AAAA;AAAA,QAMtD,sBAAsB,GAAG;AAAA,MAC3B,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,8CAA8C,KAAK,KAAK,EAAE;AAAA;AAAA,QAGjE,QAAQ,GAAG;AAAA,MACb,OAAO,KAAK,KAAK,SAAS,MAAM,KAAK,eAAe;AAAA;AAAA,QAGlD,UAAU,GAAG;AAAA,MACf,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,0CAA0C,KAAK,KAAK,EAAE;AAAA;AAAA,QAG7D,WAAW,GAAG;AAAA,MAChB,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,2CAA2C,KAAK,KAAK,EAAE;AAAA;AAAA,QAG9D,MAAM,GAAG;AAAA,MACX,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,qCAAqC,KAAK,KAAK,EAAE;AAAA;AAAA,QAQxD,WAAW,GAAG;AAAA,MAChB,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,2CAA2C,KAAK,KAAK,EAAE,MAAM;AAAA;AAAA,QAQpE,aAAa,GAAG;AAAA,MAClB,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,6CAA6C,KAAK,KAAK,EAAE,MAAM;AAAA;AAAA,QAGtE,QAAQ,GAAG;AAAA,MACb,kBAAkB,IAAI;AAAA,MACtB,MAAM,aAAa,EAAE,iCAAiC,KAAK,KAAK,EAAE;AAAA,MAClE,MAAM,WAAW,EAAE,+BAA+B,KAAK,KAAK,EAAE;AAAA,MAC9D,EAAE,oCAAoC,KAAK,KAAK,EAAE;AAAA,MAClD,MAAM,gBAAgB,eAAe,eAAe;AAAA,MACpD,OAAO,QAAQ,KAAK,MAAM,YAAY,UAAU,aAAa;AAAA;AAAA,QAG3D,aAAa,GAAG;AAAA,MAClB,kBAAkB,IAAI;AAAA,MACtB,EAAE,oCAAoC,KAAK,KAAK,EAAE;AAAA,MAClD,OAAO,eAAe,eAAe;AAAA;AAAA,QAGnC,WAAW,GAAG;AAAA,MAChB,kBAAkB,IAAI;AAAA,MACtB,EAAE,kCAAkC,KAAK,KAAK,EAAE;AAAA,MAChD,OAAO,eAAe,eAAe;AAAA;AAAA,QAGnC,UAAU,GAAG;AAAA,MACf,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,iCAAiC,KAAK,KAAK,EAAE;AAAA;AAAA,QAGpD,QAAQ,GAAG;AAAA,MACb,kBAAkB,IAAI;AAAA,MACtB,OAAO,EAAE,+BAA+B,KAAK,KAAK,EAAE;AAAA;AAAA,IAQtD,cAAc,GAAG;AAAA,MACf,kBAAkB,IAAI;AAAA,MACtB,MAAM,SAAS,EAAE,sCAAsC,KAAK,KAAK,EAAE;AAAA,MACnE,oBAAoB,IAAI;AAAA,MACxB,OAAO,WAAW;AAAA;AAAA,IAYpB,aAAa,GAAG;AAAA,MACd,kBAAkB,IAAI;AAAA,MACtB,MAAM,SAAS,EAAE,qCAAqC,KAAK,KAAK,EAAE;AAAA,MAClE,oBAAoB,IAAI;AAAA,MACxB,OAAO,WAAW;AAAA;AAAA,IAYpB,UAAU,GAAG;AAAA,MACX,kBAAkB,IAAI;AAAA,MACtB,MAAM,SAAS,EAAE,iCAAiC,KAAK,KAAK,EAAE;AAAA,MAC9D,oBAAoB,IAAI;AAAA,MACxB,OAAO,WAAW;AAAA;AAAA,IAWpB,eAAe,GAAG;AAAA,MAChB,kBAAkB,IAAI;AAAA,MACtB,MAAM,SAAS,EAAE,uCAAuC,KAAK,KAAK,EAAE;AAAA,MACpE,oBAAoB,IAAI;AAAA,MACxB,OAAO,WAAW;AAAA;AAAA,IAepB,mBAAmB,GAAG;AAAA,MACpB,kBAAkB,IAAI;AAAA,MACtB,MAAM,SAAS,EAAE,2CAA2C,KAAK,KAAK,EAAE;AAAA,MACxE,oBAAoB,IAAI;AAAA,MACxB,OAAO,WAAW;AAAA;AAAA,IAOpB,cAAc,CAAC,qBAAqB;AAAA,MAClC,kBAAkB,IAAI;AAAA,MACtB,EAAE,qCAAqC,KAAK,KAAK,IAAI,mBAAmB;AAAA,MACxE,oBAAoB,IAAI;AAAA;AAAA,IAS1B,sBAAsB,CAAC,WAAW;AAAA,MAChC,kBAAkB,IAAI;AAAA,MACtB,EAAE,SAAS,kBAAkB,gBAAgB,WAAW,KAAK;AAAA,MAC7D,MAAM,SAAS,EAAE,gDAAgD,KAAK,KAAK,EAAE;AAAA,MAC7E,oBAAoB,IAAI;AAAA,MACxB,OAAO,WAAW;AAAA;AAAA,IASpB,yBAAyB,CAAC,cAAc;AAAA,MACtC,kBAAkB,IAAI;AAAA,MACtB,aAAa,kBAAkB,gBAAgB,YAAY;AAAA,MAC3D,MAAM,SAAS,EAAE,mDAAmD,KAAK,KAAK,EAAE;AAAA,MAChF,oBAAoB,IAAI;AAAA,MACxB,OAAO,WAAW;AAAA;AAAA,IAMpB,KAAK,CAAC,MAAM;AAAA,MACV,YAAY,IAAI;AAAA,MAChB,kBAAkB,MAAM,kBAAkB,YAAY;AAAA,MACtD,EAAE,2BAA2B,KAAK,KAAK,EAAE;AAAA,MACzC,oBAAoB,IAAI;AAAA;AAAA,IAQ1B,OAAO,CAAC,QAAQ;AAAA,MACd,kBAAkB,MAAM,eAAe;AAAA,MACvC,kBAAkB,QAAQ,kBAAkB,cAAc;AAAA,MAC1D,EAAE,8BAA8B,KAAK,KAAK,IAAI,OAAO,KAAK,EAAE;AAAA,MAC5D,oBAAoB,IAAI;AAAA;AAAA,EAE5B;AAAA,EAGI,OAAO,MAAM;AAAA,WACR;AAAA,MACL,OAAO,MAAM,MAAM;AAAA;AAAA,KAIpB,KAAK;AAAA,IAGN;AAAA,IAEA;AAAA,IAEA,WAAW,CAAC;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,OACC;AAAA,MACD,eAAe,QAAQ;AAAA,MACvB,KAAK,KAAK;AAAA,MACV,KAAK,KAAK;AAAA,MACV,KAAK,OAAO;AAAA,MACZ,KAAK,aAAa;AAAA,MAClB,KAAK,gBAAgB;AAAA;AAAA,IAcvB;AAAA,IAEA;AAAA,IAEA;AAAA,IAEA;AAAA,QAEI,MAAM,GAAG;AAAA,MACX,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,qBAAqB,KAAK,KAAK,EAAE;AAAA;AAAA,QAMxC,SAAS,GAAG;AAAA,MACd,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,6BAA6B,KAAK,KAAK,EAAE;AAAA;AAAA,QAGhD,IAAI,GAAG;AAAA,MACT,OAAO,KAAK,KAAK,SAAS,MAAM,KAAK,WAAW;AAAA;AAAA,QAM9C,WAAW,GAAG;AAAA,MAChB,OAAO,KAAK,KAAK,SAAS,MAAM,KAAK,cAAc;AAAA;AAAA,QAQjD,OAAO,GAAG;AAAA,MACZ,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,uBAAuB,KAAK,KAAK,EAAE,MAAM;AAAA;AAAA,QAQhD,OAAO,GAAG;AAAA,MACZ,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,uBAAuB,KAAK,KAAK,EAAE,MAAM;AAAA;AAAA,QAQhD,OAAO,GAAG;AAAA,MACZ,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,uBAAuB,KAAK,KAAK,EAAE,MAAM;AAAA;AAAA,QAQhD,SAAS,GAAG;AAAA,MACd,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,yBAAyB,KAAK,KAAK,EAAE,MAAM;AAAA;AAAA,QAGlD,UAAU,GAAG;AAAA,MACf,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,0BAA0B,KAAK,KAAK,EAAE,MAAM;AAAA;AAAA,QAMnD,QAAQ,GAAG;AAAA,MACb,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,wBAAwB,KAAK,KAAK,EAAE,MAAM;AAAA;AAAA,QAGjD,QAAQ,GAAG;AAAA,MACb,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,wBAAwB,KAAK,KAAK,EAAE;AAAA;AAAA,QAG3C,WAAW,GAAG;AAAA,MAChB,YAAY,IAAI;AAAA,MAChB,EAAE,wBAAwB,KAAK,KAAK,EAAE;AAAA,MACtC,OAAO,eAAe,eAAe;AAAA;AAAA,QAGnC,IAAI,GAAG;AAAA,MACT,OAAO,QAAQ,KAAK,MAAM,KAAK,YAAY,KAAK,UAAU,KAAK,aAAa;AAAA;AAAA,QAG1E,UAAU,GAAG;AAAA,MACf,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,0BAA0B,KAAK,KAAK,EAAE;AAAA;AAAA,QAG7C,cAAc,GAAG;AAAA,MACnB,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,+BAA+B,KAAK,KAAK,EAAE;AAAA;AAAA,IAGtD,MAAM,CAAC,OAAO;AAAA,MACZ,OAAO,KAAK,SAAS,MAAM,QAAQ,KAAK,OAAO,MAAM;AAAA;AAAA,IASvD,KAAK,CAAC,OAAO;AAAA,MACX,YAAY,IAAI;AAAA,MAChB,EAAE,oBAAoB,KAAK,KAAK,IAAI,KAAK;AAAA,MACzC,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAUhC,UAAU,CAAC,OAAO;AAAA,MAChB,YAAY,IAAI;AAAA,MAChB,EAAE,0BAA0B,KAAK,KAAK,IAAI,KAAK;AAAA,MAC/C,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAQhC,eAAe,CAAC,SAAS;AAAA,MACvB,YAAY,IAAI;AAAA,MAChB,EAAE,gCAAgC,KAAK,KAAK,IAAI,OAAO;AAAA,MACvD,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAQhC,iBAAiB,CAAC,WAAW;AAAA,MAC3B,MAAM,UAAU,KAAK,KAAK,SAAS,OAAO,QAAQ,SAAS;AAAA,MAC3D,IAAI,YAAY;AAAA,QAAI,OAAO,KAAK,gBAAgB,OAAO;AAAA,MACvD,OAAO;AAAA;AAAA,IAGT,iBAAiB,CAAC,OAAO;AAAA,MACvB,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,EAAE,mCAAmC,KAAK,KAAK,IAAI,KAAK;AAAA,MACxE,IAAI,CAAC;AAAA,QAAS,OAAO;AAAA,MACrB,OAAO,EAAE,cAAc,OAAO;AAAA;AAAA,IAGhC,sBAAsB,CAAC,OAAO;AAAA,MAC5B,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,EAAE,yCAAyC,KAAK,KAAK,IAAI,KAAK;AAAA,MAC9E,IAAI,CAAC;AAAA,QAAS,OAAO;AAAA,MACrB,OAAO,EAAE,cAAc,OAAO;AAAA;AAAA,IAOhC,oBAAoB,CAAC,WAAW;AAAA,MAC9B,MAAM,UAAU,KAAK,KAAK,SAAS,OAAO,QAAQ,SAAS;AAAA,MAC3D,IAAI,YAAY,MAAM,YAAY;AAAA,QAAG,OAAO,KAAK,mBAAmB,OAAO;AAAA,MAC3E,OAAO,CAAC;AAAA;AAAA,IAOV,kBAAkB,CAAC,SAAS;AAAA,MAC1B,YAAY,IAAI;AAAA,MAChB,EAAE,mCAAmC,KAAK,KAAK,IAAI,OAAO;AAAA,MAC1D,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAC/C,MAAM,SAAS,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MAC9D,MAAM,SAAS,IAAI,MAAM,KAAK;AAAA,MAC9B,IAAI,QAAQ,GAAG;AAAA,QACb,IAAI,UAAU;AAAA,QACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,UACjC,OAAO,MAAM,cAAc,KAAK,MAAM,OAAO;AAAA,UAC7C,WAAW;AAAA,QACb;AAAA,QACA,EAAE,MAAM,MAAM;AAAA,MAChB;AAAA,MACA,OAAO;AAAA;AAAA,IAGT,kBAAkB,CAAC,OAAO;AAAA,MACxB,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,kBAAkB;AAAA,MAClC,EAAE,SAAS,SAAS,OAAO,KAAK;AAAA,MAChC,EAAE,mCAAmC,KAAK,KAAK,EAAE;AAAA,MACjD,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAGhC,uBAAuB,CAAC,OAAO;AAAA,MAC7B,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,kBAAkB;AAAA,MAClC,EAAE,SAAS,SAAS,OAAO,KAAK;AAAA,MAChC,EAAE,yCAAyC,KAAK,KAAK,EAAE;AAAA,MACvD,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,QAG5B,UAAU,GAAG;AAAA,MACf,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,0BAA0B,KAAK,KAAK,EAAE;AAAA;AAAA,QAO7C,eAAe,GAAG;AAAA,MACpB,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,gCAAgC,KAAK,KAAK,EAAE;AAAA;AAAA,QAGnD,UAAU,GAAG;AAAA,MACf,OAAO,KAAK,MAAM,CAAC;AAAA;AAAA,QAOjB,eAAe,GAAG;AAAA,MACpB,OAAO,KAAK,WAAW,CAAC;AAAA;AAAA,QAGtB,SAAS,GAAG;AAAA,MACd,OAAO,KAAK,MAAM,KAAK,aAAa,CAAC;AAAA;AAAA,QAOnC,cAAc,GAAG;AAAA,MACnB,OAAO,KAAK,WAAW,KAAK,kBAAkB,CAAC;AAAA;AAAA,QAQ7C,QAAQ,GAAG;AAAA,MACb,IAAI,CAAC,KAAK,WAAW;AAAA,QACnB,YAAY,IAAI;AAAA,QAChB,EAAE,uBAAuB,KAAK,KAAK,EAAE;AAAA,QACrC,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,QAC/C,MAAM,SAAS,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,QAC9D,KAAK,YAAY,IAAI,MAAM,KAAK;AAAA,QAChC,IAAI,QAAQ,GAAG;AAAA,UACb,IAAI,UAAU;AAAA,UACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,YACjC,KAAK,UAAU,MAAM,cAAc,KAAK,MAAM,OAAO;AAAA,YACrD,WAAW;AAAA,UACb;AAAA,UACA,EAAE,MAAM,MAAM;AAAA,QAChB;AAAA,MACF;AAAA,MACA,OAAO,KAAK;AAAA;AAAA,QAOV,aAAa,GAAG;AAAA,MAClB,IAAI,CAAC,KAAK,gBAAgB;AAAA,QACxB,YAAY,IAAI;AAAA,QAChB,EAAE,6BAA6B,KAAK,KAAK,EAAE;AAAA,QAC3C,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,QAC/C,MAAM,SAAS,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,QAC9D,KAAK,iBAAiB,IAAI,MAAM,KAAK;AAAA,QACrC,IAAI,QAAQ,GAAG;AAAA,UACb,IAAI,UAAU;AAAA,UACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,YACjC,KAAK,eAAe,MAAM,cAAc,KAAK,MAAM,OAAO;AAAA,YAC1D,WAAW;AAAA,UACb;AAAA,UACA,EAAE,MAAM,MAAM;AAAA,QAChB;AAAA,MACF;AAAA,MACA,OAAO,KAAK;AAAA;AAAA,IASd,iBAAiB,CAAC,OAAO,gBAAgB,YAAY,cAAc,YAAY;AAAA,MAC7E,IAAI,CAAC,MAAM,QAAQ,KAAK;AAAA,QAAG,QAAQ,CAAC,KAAK;AAAA,MACzC,MAAM,UAAU,CAAC;AAAA,MACjB,MAAM,gBAAgB,KAAK,KAAK,SAAS;AAAA,MACzC,WAAW,aAAa,OAAO;AAAA,QAC7B,IAAI,aAAa,SAAS;AAAA,UACxB,QAAQ,KAAK,KAAK;AAAA,QACpB;AAAA,MACF;AAAA,MACA,SAAS,KAAK,GAAG,IAAI,cAAc,OAAQ,KAAK,GAAG,MAAM;AAAA,QACvD,IAAI,MAAM,SAAS,cAAc,GAAG,GAAG;AAAA,UACrC,QAAQ,KAAK,EAAE;AAAA,QACjB;AAAA,MACF;AAAA,MACA,MAAM,iBAAiB,EAAE,QAAQ,cAAc,QAAQ,MAAM;AAAA,MAC7D,SAAS,KAAK,GAAG,IAAI,QAAQ,OAAQ,KAAK,GAAG,MAAM;AAAA,QACjD,EAAE,SAAS,iBAAiB,KAAK,aAAa,QAAQ,KAAK,KAAK;AAAA,MAClE;AAAA,MACA,YAAY,IAAI;AAAA,MAChB,EAAE,kCACA,KAAK,KAAK,IACV,gBACA,QAAQ,QACR,cAAc,KACd,cAAc,QACd,YAAY,KACZ,YAAY,MACd;AAAA,MACA,MAAM,kBAAkB,EAAE,SAAS,iBAAiB,KAAK;AAAA,MACzD,MAAM,oBAAoB,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MACzE,MAAM,SAAS,IAAI,MAAM,eAAe;AAAA,MACxC,IAAI,kBAAkB,GAAG;AAAA,QACvB,IAAI,UAAU;AAAA,QACd,SAAS,KAAK,EAAG,KAAK,iBAAiB,MAAM;AAAA,UAC3C,OAAO,MAAM,cAAc,KAAK,MAAM,OAAO;AAAA,UAC7C,WAAW;AAAA,QACb;AAAA,MACF;AAAA,MACA,EAAE,MAAM,iBAAiB;AAAA,MACzB,EAAE,MAAM,cAAc;AAAA,MACtB,OAAO;AAAA;AAAA,QAGL,WAAW,GAAG;AAAA,MAChB,YAAY,IAAI;AAAA,MAChB,EAAE,2BAA2B,KAAK,KAAK,EAAE;AAAA,MACzC,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,QAG5B,eAAe,GAAG;AAAA,MACpB,YAAY,IAAI;AAAA,MAChB,EAAE,2BAA2B,KAAK,KAAK,EAAE;AAAA,MACzC,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,QAO5B,gBAAgB,GAAG;AAAA,MACrB,YAAY,IAAI;AAAA,MAChB,EAAE,iCAAiC,KAAK,KAAK,EAAE;AAAA,MAC/C,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,QAO5B,oBAAoB,GAAG;AAAA,MACzB,YAAY,IAAI;AAAA,MAChB,EAAE,iCAAiC,KAAK,KAAK,EAAE;AAAA,MAC/C,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,QAG5B,eAAe,GAAG;AAAA,MACpB,YAAY,IAAI;AAAA,MAChB,OAAO,EAAE,+BAA+B,KAAK,KAAK,EAAE;AAAA;AAAA,QAMlD,MAAM,GAAG;AAAA,MACX,YAAY,IAAI;AAAA,MAChB,EAAE,qBAAqB,KAAK,KAAK,EAAE;AAAA,MACnC,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAOhC,mBAAmB,CAAC,YAAY;AAAA,MAC9B,YAAY,IAAI;AAAA,MAChB,YAAY,YAAY,CAAC;AAAA,MACzB,EAAE,oCAAoC,KAAK,KAAK,EAAE;AAAA,MAClD,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAGhC,kBAAkB,CAAC,QAAQ,MAAM,QAAQ;AAAA,MACvC,IAAI,OAAO,WAAW,YAAY,OAAO,QAAQ,UAAU;AAAA,QACzD,MAAM,IAAI,MAAM,2BAA2B;AAAA,MAC7C;AAAA,MACA,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,kBAAkB;AAAA,MAClC,EAAE,SAAS,SAAS,QAAQ,KAAK;AAAA,MACjC,EAAE,SAAS,UAAU,aAAa,KAAK,KAAK;AAAA,MAC5C,EAAE,mCAAmC,KAAK,KAAK,EAAE;AAAA,MACjD,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAGhC,uBAAuB,CAAC,QAAQ,MAAM,QAAQ;AAAA,MAC5C,IAAI,OAAO,WAAW,YAAY,OAAO,QAAQ,UAAU;AAAA,QACzD,MAAM,IAAI,MAAM,2BAA2B;AAAA,MAC7C;AAAA,MACA,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,kBAAkB;AAAA,MAClC,EAAE,SAAS,SAAS,QAAQ,KAAK;AAAA,MACjC,EAAE,SAAS,UAAU,aAAa,KAAK,KAAK;AAAA,MAC5C,EAAE,yCAAyC,KAAK,KAAK,EAAE;AAAA,MACvD,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAGhC,qBAAqB,CAAC,QAAQ,MAAM,QAAQ;AAAA,MAC1C,IAAI,CAAC,QAAQ,MAAM,KAAK,CAAC,QAAQ,GAAG,GAAG;AAAA,QACrC,MAAM,IAAI,MAAM,yCAAyC;AAAA,MAC3D;AAAA,MACA,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,kBAAkB;AAAA,MAClC,aAAa,SAAS,MAAM;AAAA,MAC5B,aAAa,UAAU,eAAe,GAAG;AAAA,MACzC,EAAE,sCAAsC,KAAK,KAAK,EAAE;AAAA,MACpD,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAGhC,0BAA0B,CAAC,QAAQ,MAAM,QAAQ;AAAA,MAC/C,IAAI,CAAC,QAAQ,MAAM,KAAK,CAAC,QAAQ,GAAG,GAAG;AAAA,QACrC,MAAM,IAAI,MAAM,yCAAyC;AAAA,MAC3D;AAAA,MACA,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,kBAAkB;AAAA,MAClC,aAAa,SAAS,MAAM;AAAA,MAC5B,aAAa,UAAU,eAAe,GAAG;AAAA,MACzC,EAAE,4CAA4C,KAAK,KAAK,EAAE;AAAA,MAC1D,OAAO,cAAc,KAAK,IAAI;AAAA;AAAA,IAQhC,IAAI,GAAG;AAAA,MACL,YAAY,IAAI;AAAA,MAChB,EAAE,yBAAyB,KAAK,KAAK,EAAE;AAAA,MACvC,OAAO,IAAI,WAAW,UAAU,KAAK,IAAI;AAAA;AAAA,IAW3C,IAAI,CAAC,MAAM;AAAA,MACT,IAAI,KAAK,cAAc,KAAK,aAAa;AAAA,QACvC,KAAK,aAAa,KAAK,eAAe,KAAK,aAAa,KAAK;AAAA,QAC7D,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI,KAAK,cAAc,MAAM,KAAK,eAAe,KAAK;AAAA,UACpD,iBAAiB,KAAK,cAAc,MAAM,KAAK,eAAe;AAAA,UAC9D,oBAAoB,KAAK,cAAc;AAAA,QACzC,EAAO;AAAA,UACL,iBAAiB;AAAA,UACjB,oBAAoB,KAAK,cAAc;AAAA,UACvC,IAAI,KAAK,cAAc,UAAU,KAAK,eAAe,QAAQ;AAAA,YAC3D,oBAAoB,KAAK,cAAc,SAAS,KAAK,eAAe;AAAA,UACtE;AAAA;AAAA,QAEF,IAAI,iBAAiB,GAAG;AAAA,UACtB,KAAK,cAAc,OAAO;AAAA,UAC1B,KAAK,cAAc,SAAS;AAAA,QAC9B,EAAO;AAAA,UACL,KAAK,cAAc,UAAU;AAAA;AAAA,MAEjC,EAAO,SAAI,KAAK,aAAa,KAAK,YAAY;AAAA,QAC5C,KAAK,aAAa,KAAK;AAAA,QACvB,KAAK,cAAc,MAAM,KAAK,eAAe;AAAA,QAC7C,KAAK,cAAc,SAAS,KAAK,eAAe;AAAA,MAClD;AAAA;AAAA,IAGF,QAAQ,GAAG;AAAA,MACT,YAAY,IAAI;AAAA,MAChB,MAAM,UAAU,EAAE,wBAAwB,KAAK,KAAK,EAAE;AAAA,MACtD,MAAM,SAAS,EAAE,cAAc,OAAO;AAAA,MACtC,EAAE,MAAM,OAAO;AAAA,MACf,OAAO;AAAA;AAAA,EAEX;AAAA,EAaA,OAAO,mBAAmB,mBAAmB;AAAA,EAa7C,OAAO,aAAa,aAAa;AAAA,EAqBjC,OAAO,eAAe,eAAe;AAAA,EAOrC,OAAO,mBAAmB,mBAAmB;AAAA,EAO7C,OAAO,qBAAqB,qBAAqB;AAAA,EAKjD,OAAO,cAAc,cAAc;AAAA,EAQnC,OAAO,gBAAgB,gBAAgB;AAAA,EAWvC,OAAO,cAAc,cAAc;AAAA,EAYnC,OAAO,gBAAgB,gBAAgB;AAAA,EAevC,OAAO,aAAa,aAAa;AAAA,EAOjC,OAAO,2BAA2B,2BAA2B;AAAA,EAKzD,mBAAmB;AAAA,EACnB,oBAAoB;AAAA,IACtB,MAAM;AAAA,IACN,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,KAAK;AAAA,IACL,WAAW;AAAA,EACb;AAAA,EACI,gBAAgC,OAAO,CAAC,SAAS,KAAK,SAAS,WAAW,eAAe;AAAA,EACzF,eAA+B,OAAO,CAAC,SAAS,KAAK,SAAS,UAAU,cAAc;AAAA,EACtF,iBAAiB;AAAA,IACnB,QAAQ;AAAA,IACR,UAAU;AAAA,IACV,WAAW;AAAA,IACX,aAAa;AAAA,IACb,kBAAkB;AAAA,EACpB;AAAA,EACI,aAAa,MAAM,oBAAoB,MAAM;AAAA,IAC/C,WAAW,CAAC,MAAM,OAAO,OAAO,QAAQ;AAAA,MACtC,MAAM,YAAY,cAAc,MAAM,KAAK,CAAC;AAAA,MAC5C,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,MACZ,KAAK,QAAQ;AAAA,MACb,KAAK,SAAS;AAAA,MACd,KAAK,OAAO;AAAA;AAAA,WAEP;AAAA,MACL,OAAO,MAAM,YAAY;AAAA;AAAA,WAGpB,aAAa,CAAC,MAAM,OAAO;AAAA,MAChC,QAAQ;AAAA,aACD,eAAe;AAAA,UAClB,OAAO,kBAAkB,MAAM;AAAA,aAC5B,eAAe;AAAA,UAClB,OAAO,mBAAmB,MAAM;AAAA,aAC7B,eAAe;AAAA,UAClB,OAAO,qBAAqB,MAAM;AAAA,aAC/B,eAAe;AAAA,UAClB,OAAO,mCAAmC,MAAM;AAAA,aAC7C,eAAe;AAAA,UAClB,OAAO,wBAAwB,MAAM;AAAA;AAAA;AAAA,EAG7C;AAAA,EA4CA,OAAO,mBAAmB,mBAAmB;AAAA,EAiC7C,OAAO,qBAAqB,qBAAqB;AAAA,EA8BjD,OAAO,qBAAqB,qBAAqB;AAAA,EAgBjD,OAAO,kBAAkB,kBAAkB;AAAA,EAW3C,OAAO,mBAAmB,mBAAmB;AAAA,EA0C7C,OAAO,cAAc,cAAc;AAAA,EAC/B,QAAQ,MAAM;AAAA,WACT;AAAA,MACL,OAAO,MAAM,OAAO;AAAA;AAAA,KAGrB,KAAK;AAAA,IAGN;AAAA,IAEA;AAAA,IAEA;AAAA,IAEA;AAAA,IAWA;AAAA,IAEA;AAAA,IAEA;AAAA,IAEA;AAAA,IAEA;AAAA,IAWA,WAAW,CAAC,UAAU,QAAQ;AAAA,MAC5B,MAAM,eAAe,EAAE,gBAAgB,MAAM;AAAA,MAC7C,MAAM,gBAAgB,EAAE,QAAQ,eAAe,CAAC;AAAA,MAChD,EAAE,aAAa,QAAQ,eAAe,eAAe,CAAC;AAAA,MACtD,MAAM,UAAU,EAAE,cAChB,SAAS,IACT,eACA,cACA,iBACA,kBAAkB,WACpB;AAAA,MACA,IAAI,CAAC,SAAS;AAAA,QACZ,MAAM,UAAU,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,QAC/D,MAAM,YAAY,EAAE,SAAS,iBAAiB,KAAK;AAAA,QACnD,MAAM,aAAa,EAAE,aAAa,eAAe,SAAS,EAAE;AAAA,QAC5D,MAAM,SAAS,OAAO,MAAM,YAAY,aAAa,GAAG,EAAE,MAAM;AAAA,CAAI,EAAE;AAAA,QACtE,MAAM,OAAO,OAAO,MAAM,gBAAgB,IAAI,MAAM;AAAA,QACpD,EAAE,MAAM,aAAa;AAAA,QACrB,QAAQ;AAAA,eACD,eAAe;AAAA,YAClB,MAAM,IAAI,WAAW,eAAe,QAAQ,EAAE,QAAQ,GAAG,gBAAgB,aAAa,GAAG,YAAY,CAAC;AAAA,eACnG,eAAe;AAAA,YAClB,MAAM,IAAI,WAAW,SAAS,EAAE,KAAK,GAAG,YAAY,KAAK,MAAM;AAAA,eAC5D,eAAe;AAAA,YAClB,MAAM,IAAI,WAAW,SAAS,EAAE,KAAK,GAAG,YAAY,KAAK,MAAM;AAAA,eAC5D,eAAe;AAAA,YAClB,MAAM,IAAI,WAAW,SAAS,EAAE,KAAK,GAAG,YAAY,KAAK,MAAM;AAAA,eAC5D,eAAe;AAAA,YAClB,MAAM,IAAI,WAAW,SAAS,EAAE,QAAQ,GAAG,gBAAgB,aAAa,GAAG,YAAY,CAAC;AAAA;AAAA,MAE9F;AAAA,MACA,MAAM,cAAc,EAAE,uBAAuB,OAAO;AAAA,MACpD,MAAM,eAAe,EAAE,wBAAwB,OAAO;AAAA,MACtD,MAAM,eAAe,EAAE,wBAAwB,OAAO;AAAA,MACtD,MAAM,eAAe,IAAI,MAAM,YAAY;AAAA,MAC3C,MAAM,qBAAqB,IAAI,MAAM,YAAY;AAAA,MACjD,MAAM,eAAe,IAAI,MAAM,WAAW;AAAA,MAC1C,SAAS,KAAK,EAAG,KAAK,cAAc,MAAM;AAAA,QACxC,MAAM,cAAc,EAAE,8BACpB,SACA,IACA,eACF;AAAA,QACA,MAAM,aAAa,EAAE,SAAS,iBAAiB,KAAK;AAAA,QACpD,aAAa,MAAM,EAAE,aAAa,aAAa,UAAU;AAAA,MAC3D;AAAA,MACA,SAAS,KAAK,EAAG,KAAK,cAAc,MAAM;AAAA,QACxC,MAAM,0BAA0B,IAAI,MAAM,YAAY;AAAA,QACtD,SAAS,IAAI,EAAG,IAAI,cAAc,KAAK;AAAA,UACrC,MAAM,aAAa,EAAE,oCAAoC,SAAS,IAAI,CAAC;AAAA,UACvE,wBAAwB,KAAK;AAAA,QAC/B;AAAA,QACA,mBAAmB,MAAM;AAAA,MAC3B;AAAA,MACA,SAAS,KAAK,EAAG,KAAK,aAAa,MAAM;AAAA,QACvC,MAAM,eAAe,EAAE,8BACrB,SACA,IACA,eACF;AAAA,QACA,MAAM,aAAa,EAAE,SAAS,iBAAiB,KAAK;AAAA,QACpD,aAAa,MAAM,EAAE,aAAa,cAAc,UAAU;AAAA,MAC5D;AAAA,MACA,MAAM,gBAAgB,IAAI,MAAM,YAAY;AAAA,MAC5C,MAAM,qBAAqB,IAAI,MAAM,YAAY;AAAA,MACjD,MAAM,oBAAoB,IAAI,MAAM,YAAY;AAAA,MAChD,MAAM,aAAa,IAAI,MAAM,YAAY;AAAA,MACzC,MAAM,iBAAiB,IAAI,MAAM,YAAY;AAAA,MAC7C,SAAS,KAAK,EAAG,KAAK,cAAc,MAAM;AAAA,QACxC,MAAM,oBAAoB,EAAE,iCAAiC,SAAS,IAAI,eAAe;AAAA,QACzF,MAAM,YAAY,EAAE,SAAS,iBAAiB,KAAK;AAAA,QACnD,WAAW,MAAM,CAAC;AAAA,QAClB,eAAe,MAAM,CAAC;AAAA,QACtB,MAAM,QAAQ,IAAI;AAAA,QAClB,IAAI,cAAc;AAAA,QAClB,SAAS,IAAI,EAAG,IAAI,WAAW,KAAK;AAAA,UAClC,MAAM,WAAW,EAAE,SAAS,aAAa,KAAK;AAAA,UAC9C,eAAe;AAAA,UACf,MAAM,cAAc,EAAE,SAAS,aAAa,KAAK;AAAA,UACjD,eAAe;AAAA,UACf,aACE,IACA,UACA,aACA,cACA,cACA,OACA,gBACA,YACA,eACA,oBACA,iBACF;AAAA,QACF;AAAA,QACA,OAAO,OAAO,eAAe,GAAG;AAAA,QAChC,OAAO,OAAO,WAAW,GAAG;AAAA,QAC5B,OAAO,OAAO,cAAc,GAAG;AAAA,QAC/B,OAAO,OAAO,mBAAmB,GAAG;AAAA,QACpC,OAAO,OAAO,kBAAkB,GAAG;AAAA,MACrC;AAAA,MACA,EAAE,MAAM,aAAa;AAAA,MACrB,KAAK,KAAK;AAAA,MACV,KAAK,eAAe;AAAA,MACpB,KAAK,qBAAqB;AAAA,MAC1B,KAAK,iBAAiB;AAAA,MACtB,KAAK,aAAa;AAAA,MAClB,KAAK,gBAAgB;AAAA,MACrB,KAAK,qBAAqB;AAAA,MAC1B,KAAK,oBAAoB;AAAA,MACzB,KAAK,qBAAqB;AAAA;AAAA,IAG5B,MAAM,GAAG;AAAA,MACP,EAAE,iBAAiB,KAAK,EAAE;AAAA,MAC1B,KAAK,KAAK;AAAA;AAAA,IAcZ,OAAO,CAAC,MAAM,UAAU,CAAC,GAAG;AAAA,MAC1B,MAAM,gBAAgB,QAAQ,iBAAiB;AAAA,MAC/C,MAAM,cAAc,QAAQ,eAAe;AAAA,MAC3C,MAAM,aAAa,QAAQ,cAAc;AAAA,MACzC,MAAM,WAAW,QAAQ,YAAY;AAAA,MACrC,MAAM,aAAa,QAAQ,cAAc;AAAA,MACzC,MAAM,gBAAgB,QAAQ,iBAAiB;AAAA,MAC/C,MAAM,gBAAgB,QAAQ,iBAAiB;AAAA,MAC/C,MAAM,mBAAmB,QAAQ;AAAA,MACjC,IAAI,OAAO,eAAe,UAAU;AAAA,QAClC,MAAM,IAAI,MAAM,2BAA2B;AAAA,MAC7C;AAAA,MACA,KAAK,aAAa;AAAA,MAClB,IAAI,aAAa,KAAK,aAAa,UAAU;AAAA,QAC3C,MAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AAAA,MACA,IAAI,gBAAgB,eAAe,cAAc,MAAM,YAAY,OAAO,cAAc,QAAQ,YAAY,OAAO,cAAc,SAAS,YAAY,SAAS;AAAA,QAC7J,MAAM,IAAI,MAAM,sDAAsD;AAAA,MACxE;AAAA,MACA,IAAI,kBAAkB;AAAA,QACpB,EAAE,+BAA+B;AAAA,MACnC;AAAA,MACA,YAAY,IAAI;AAAA,MAChB,EAAE,uBACA,KAAK,IACL,KAAK,KAAK,IACV,cAAc,KACd,cAAc,QACd,YAAY,KACZ,YAAY,QACZ,YACA,UACA,YACA,eACA,aACF;AAAA,MACA,MAAM,WAAW,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAClD,MAAM,eAAe,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MACpE,MAAM,sBAAsB,EAAE,SAAS,kBAAkB,IAAI,aAAa,KAAK;AAAA,MAC/E,MAAM,SAAS,IAAI,MAAM,QAAQ;AAAA,MACjC,KAAK,qBAAqB,QAAQ,mBAAmB;AAAA,MACrD,IAAI,gBAAgB;AAAA,MACpB,IAAI,UAAU;AAAA,MACd,SAAS,KAAK,EAAG,KAAK,UAAU,MAAM;AAAA,QACpC,MAAM,eAAe,EAAE,SAAS,SAAS,KAAK;AAAA,QAC9C,WAAW;AAAA,QACX,MAAM,eAAe,EAAE,SAAS,SAAS,KAAK;AAAA,QAC9C,WAAW;AAAA,QACX,MAAM,WAAW,IAAI,MAAM,YAAY;AAAA,QACvC,UAAU,kBAAkB,MAAM,KAAK,MAAM,SAAS,cAAc,QAAQ;AAAA,QAC5E,IAAI,KAAK,eAAe,cAAc,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG;AAAA,UAC/D,OAAO,iBAAiB,EAAE,SAAS,cAAc,cAAc,SAAS;AAAA,UACxE,MAAM,gBAAgB,KAAK,cAAc;AAAA,UACzC,OAAO,eAAe,gBAAgB;AAAA,UACtC,MAAM,qBAAqB,KAAK,mBAAmB;AAAA,UACnD,OAAO,eAAe,qBAAqB;AAAA,UAC3C,MAAM,oBAAoB,KAAK,kBAAkB;AAAA,UACjD,OAAO,eAAe,oBAAoB;AAAA,UAC1C;AAAA,QACF;AAAA,MACF;AAAA,MACA,OAAO,SAAS;AAAA,MAChB,EAAE,MAAM,YAAY;AAAA,MACpB,EAAE,+BAA+B;AAAA,MACjC,OAAO;AAAA;AAAA,IAaT,QAAQ,CAAC,MAAM,UAAU,CAAC,GAAG;AAAA,MAC3B,MAAM,gBAAgB,QAAQ,iBAAiB;AAAA,MAC/C,MAAM,cAAc,QAAQ,eAAe;AAAA,MAC3C,MAAM,aAAa,QAAQ,cAAc;AAAA,MACzC,MAAM,WAAW,QAAQ,YAAY;AAAA,MACrC,MAAM,aAAa,QAAQ,cAAc;AAAA,MACzC,MAAM,gBAAgB,QAAQ,iBAAiB;AAAA,MAC/C,MAAM,gBAAgB,QAAQ,iBAAiB;AAAA,MAC/C,MAAM,mBAAmB,QAAQ;AAAA,MACjC,IAAI,OAAO,eAAe,UAAU;AAAA,QAClC,MAAM,IAAI,MAAM,2BAA2B;AAAA,MAC7C;AAAA,MACA,KAAK,aAAa;AAAA,MAClB,IAAI,aAAa,KAAK,aAAa,UAAU;AAAA,QAC3C,MAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AAAA,MACA,IAAI,gBAAgB,eAAe,cAAc,MAAM,YAAY,OAAO,cAAc,QAAQ,YAAY,OAAO,cAAc,SAAS,YAAY,SAAS;AAAA,QAC7J,MAAM,IAAI,MAAM,sDAAsD;AAAA,MACxE;AAAA,MACA,IAAI,kBAAkB;AAAA,QACpB,EAAE,+BAA+B;AAAA,MACnC;AAAA,MACA,YAAY,IAAI;AAAA,MAChB,EAAE,wBACA,KAAK,IACL,KAAK,KAAK,IACV,cAAc,KACd,cAAc,QACd,YAAY,KACZ,YAAY,QACZ,YACA,UACA,YACA,eACA,aACF;AAAA,MACA,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAC/C,MAAM,eAAe,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MACpE,MAAM,sBAAsB,EAAE,SAAS,kBAAkB,IAAI,aAAa,KAAK;AAAA,MAC/E,MAAM,SAAS,IAAI;AAAA,MACnB,KAAK,qBAAqB,QAAQ,mBAAmB;AAAA,MACrD,MAAM,WAAW,IAAI;AAAA,MACrB,IAAI,UAAU;AAAA,MACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,QACjC,MAAM,eAAe,EAAE,SAAS,SAAS,KAAK;AAAA,QAC9C,WAAW;AAAA,QACX,MAAM,eAAe,EAAE,SAAS,SAAS,KAAK;AAAA,QAC9C,WAAW;AAAA,QACX,MAAM,eAAe,EAAE,SAAS,SAAS,KAAK;AAAA,QAC9C,WAAW;AAAA,QACX,SAAS,SAAS;AAAA,QAClB,UAAU,kBAAkB,MAAM,KAAK,MAAM,SAAS,cAAc,QAAQ;AAAA,QAC5E,IAAI,KAAK,eAAe,cAAc,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG;AAAA,UAC/D,MAAM,UAAU,SAAS;AAAA,UACzB,MAAM,gBAAgB,KAAK,cAAc;AAAA,UACzC,QAAQ,gBAAgB;AAAA,UACxB,MAAM,qBAAqB,KAAK,mBAAmB;AAAA,UACnD,QAAQ,qBAAqB;AAAA,UAC7B,MAAM,oBAAoB,KAAK,kBAAkB;AAAA,UACjD,QAAQ,oBAAoB;AAAA,UAC5B,OAAO,KAAK,OAAO;AAAA,QACrB;AAAA,MACF;AAAA,MACA,EAAE,MAAM,YAAY;AAAA,MACpB,EAAE,+BAA+B;AAAA,MACjC,OAAO;AAAA;AAAA,IAGT,oBAAoB,CAAC,cAAc;AAAA,MACjC,OAAO,KAAK,WAAW;AAAA;AAAA,IAQzB,cAAc,CAAC,aAAa;AAAA,MAC1B,MAAM,oBAAoB,EAAE,gBAAgB,WAAW;AAAA,MACvD,MAAM,qBAAqB,EAAE,QAAQ,oBAAoB,CAAC;AAAA,MAC1D,EAAE,aAAa,aAAa,oBAAoB,oBAAoB,CAAC;AAAA,MACrE,EAAE,0BAA0B,KAAK,IAAI,oBAAoB,iBAAiB;AAAA,MAC1E,EAAE,MAAM,kBAAkB;AAAA;AAAA,IAS5B,cAAc,CAAC,cAAc;AAAA,MAC3B,IAAI,gBAAgB,KAAK,WAAW,QAAQ;AAAA,QAC1C,MAAM,IAAI,MACR,oBAAoB,yCAAyC,KAAK,WAAW,QAC/E;AAAA,MACF;AAAA,MACA,EAAE,0BAA0B,KAAK,IAAI,YAAY;AAAA;AAAA,IAMnD,mBAAmB,GAAG;AAAA,MACpB,OAAO,KAAK;AAAA;AAAA,IAGd,oBAAoB,CAAC,cAAc;AAAA,MACjC,IAAI,gBAAgB,KAAK,WAAW,QAAQ;AAAA,QAC1C,MAAM,IAAI,MACR,oBAAoB,yCAAyC,KAAK,WAAW,QAC/E;AAAA,MACF;AAAA,MACA,OAAO,EAAE,iCAAiC,KAAK,IAAI,YAAY;AAAA;AAAA,IAGjE,kBAAkB,CAAC,cAAc;AAAA,MAC/B,IAAI,gBAAgB,KAAK,WAAW,QAAQ;AAAA,QAC1C,MAAM,IAAI,MACR,oBAAoB,yCAAyC,KAAK,WAAW,QAC/E;AAAA,MACF;AAAA,MACA,OAAO,EAAE,+BAA+B,KAAK,IAAI,YAAY;AAAA;AAAA,IAG/D,YAAY,GAAG;AAAA,MACb,OAAO,EAAE,wBAAwB,KAAK,EAAE;AAAA;AAAA,IAG1C,mBAAmB,CAAC,aAAa;AAAA,MAC/B,OAAO,KAAK,aAAa,QAAQ,WAAW;AAAA;AAAA,IAG9C,eAAe,CAAC,cAAc;AAAA,MAC5B,OAAO,EAAE,4BAA4B,KAAK,IAAI,YAAY,MAAM;AAAA;AAAA,IAGlE,iBAAiB,CAAC,cAAc;AAAA,MAC9B,OAAO,EAAE,+BAA+B,KAAK,IAAI,YAAY,MAAM;AAAA;AAAA,IAQrE,yBAAyB,CAAC,WAAW;AAAA,MACnC,OAAO,EAAE,wCAAwC,KAAK,IAAI,SAAS,MAAM;AAAA;AAAA,EAE7E;AAAA,EAGI,0BAA0B;AAAA,EAC1B,WAAW,MAAM,UAAU;AAAA,WACtB;AAAA,MACL,OAAO,MAAM,UAAU;AAAA;AAAA,KAGxB,KAAK;AAAA,IAMN;AAAA,IAKA;AAAA,IAEA,WAAW,CAAC,UAAU,SAAS;AAAA,MAC7B,eAAe,QAAQ;AAAA,MACvB,KAAK,KAAK;AAAA,MACV,KAAK,QAAQ,IAAI,MAAM,EAAE,0BAA0B,KAAK,EAAE,CAAC;AAAA,MAC3D,SAAS,KAAK,GAAG,IAAI,KAAK,MAAM,OAAQ,KAAK,GAAG,MAAM;AAAA,QACpD,IAAI,EAAE,yBAAyB,KAAK,IAAI,EAAE,IAAI,GAAG;AAAA,UAC/C,KAAK,MAAM,MAAM,EAAE,aAAa,EAAE,yBAAyB,KAAK,IAAI,EAAE,CAAC;AAAA,QACzE;AAAA,MACF;AAAA,MACA,KAAK,SAAS,IAAI,MAAM,EAAE,yBAAyB,KAAK,EAAE,IAAI,CAAC;AAAA,MAC/D,SAAS,KAAK,GAAG,IAAI,KAAK,OAAO,OAAQ,KAAK,GAAG,MAAM;AAAA,QACrD,MAAM,YAAY,EAAE,+BAA+B,KAAK,IAAI,EAAE;AAAA,QAC9D,IAAI,cAAc,GAAG;AAAA,UACnB,KAAK,OAAO,MAAM,EAAE,aAAa,SAAS;AAAA,QAC5C,EAAO;AAAA,UACL,KAAK,OAAO,MAAM;AAAA;AAAA,MAEtB;AAAA;AAAA,QAKE,IAAI,GAAG;AAAA,MACT,MAAM,MAAM,EAAE,kBAAkB,KAAK,EAAE;AAAA,MACvC,IAAI,QAAQ;AAAA,QAAG,OAAO;AAAA,MACtB,OAAO,EAAE,aAAa,GAAG;AAAA;AAAA,QAMvB,OAAO,GAAG;AAAA,MACZ,OAAO,EAAE,qBAAqB,KAAK,EAAE;AAAA;AAAA,QAKnC,UAAU,GAAG;AAAA,MACf,OAAO,EAAE,yBAAyB,KAAK,EAAE;AAAA;AAAA,QAOvC,QAAQ,GAAG;AAAA,MACb,EAAE,sBAAsB,KAAK,EAAE;AAAA,MAC/B,MAAM,SAAS,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAChD,MAAM,UAAU,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MAC/D,IAAI,WAAW;AAAA,QAAG,OAAO;AAAA,MACzB,OAAO,0BAA0B,OAAO;AAAA;AAAA,QAKtC,UAAU,GAAG;AAAA,MACf,OAAO,KAAK,OAAO,SAAS;AAAA;AAAA,QAK1B,UAAU,GAAG;AAAA,MACf,OAAO,EAAE,yBAAyB,KAAK,EAAE;AAAA;AAAA,IAK3C,cAAc,CAAC,WAAW;AAAA,MACxB,MAAM,SAAS,KAAK,OAAO,QAAQ,SAAS;AAAA,MAC5C,OAAO,WAAW,KAAK,SAAS;AAAA;AAAA,IAKlC,cAAc,CAAC,SAAS;AAAA,MACtB,OAAO,KAAK,OAAO,YAAY;AAAA;AAAA,IAKjC,aAAa,CAAC,MAAM,OAAO;AAAA,MACzB,MAAM,aAAa,EAAE,gBAAgB,IAAI;AAAA,MACzC,MAAM,cAAc,EAAE,QAAQ,aAAa,CAAC;AAAA,MAC5C,EAAE,aAAa,MAAM,aAAa,aAAa,CAAC;AAAA,MAChD,MAAM,SAAS,EAAE,6BAA6B,KAAK,IAAI,aAAa,YAAY,QAAQ,IAAI,CAAC;AAAA,MAC7F,EAAE,MAAM,WAAW;AAAA,MACnB,OAAO,UAAU;AAAA;AAAA,QAKf,aAAa,GAAG;AAAA,MAClB,OAAO,EAAE,0BAA0B,KAAK,EAAE;AAAA;AAAA,IAK5C,aAAa,CAAC,QAAQ;AAAA,MACpB,MAAM,QAAQ,EAAE,yBAAyB,KAAK,IAAI,MAAM;AAAA,MACxD,OAAO,QAAQ,EAAE,aAAa,KAAK,IAAI;AAAA;AAAA,IAOzC,eAAe,CAAC,QAAQ;AAAA,MACtB,OAAO,EAAE,gCAAgC,KAAK,IAAI,MAAM,IAAI,OAAO;AAAA;AAAA,IAKrE,iBAAiB,CAAC,QAAQ;AAAA,MACxB,OAAO,EAAE,kCAAkC,KAAK,IAAI,MAAM,IAAI,OAAO;AAAA;AAAA,QAOnE,UAAU,GAAG;AAAA,MACf,EAAE,6BAA6B,KAAK,EAAE;AAAA,MACtC,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAC/C,MAAM,SAAS,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MAC9D,MAAM,SAAS,IAAI,MAAM,KAAK;AAAA,MAC9B,IAAI,QAAQ,GAAG;AAAA,QACb,IAAI,UAAU;AAAA,QACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,UACjC,OAAO,MAAM,EAAE,SAAS,SAAS,KAAK;AAAA,UACtC,WAAW;AAAA,QACb;AAAA,MACF;AAAA,MACA,OAAO;AAAA;AAAA,IAKT,QAAQ,CAAC,WAAW;AAAA,MAClB,EAAE,2BAA2B,KAAK,IAAI,SAAS;AAAA,MAC/C,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAC/C,MAAM,SAAS,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MAC9D,MAAM,SAAS,IAAI,MAAM,KAAK;AAAA,MAC9B,IAAI,QAAQ,GAAG;AAAA,QACb,IAAI,UAAU;AAAA,QACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,UACjC,OAAO,MAAM,EAAE,SAAS,SAAS,KAAK;AAAA,UACtC,WAAW;AAAA,QACb;AAAA,MACF;AAAA,MACA,OAAO;AAAA;AAAA,IAKT,SAAS,CAAC,SAAS,QAAQ;AAAA,MACzB,OAAO,EAAE,wBAAwB,KAAK,IAAI,SAAS,MAAM;AAAA;AAAA,IAiB3D,iBAAiB,CAAC,SAAS;AAAA,MACzB,MAAM,UAAU,EAAE,2BAA2B,KAAK,IAAI,OAAO;AAAA,MAC7D,IAAI;AAAA,QAAS,OAAO,IAAI,kBAAkB,UAAU,SAAS,IAAI;AAAA,MACjE,OAAO;AAAA;AAAA,IAcT,KAAK,CAAC,QAAQ;AAAA,MACZ,QAAQ,KAAK,wEAAwE;AAAA,MACrF,OAAO,IAAI,MAAM,MAAM,MAAM;AAAA;AAAA,gBAMlB,KAAI,CAAC,OAAO;AAAA,MACvB,IAAI;AAAA,MACJ,IAAI,iBAAiB,YAAY;AAAA,QAC/B,QAAQ,QAAQ,QAAQ,KAAK;AAAA,MAC/B,EAAO;AAAA,QACL,IAAI,WAAW,SAAS,SAAS,MAAM;AAAA,UACrC,MAAM,MAAM,MAAa;AAAA,UACzB,QAAQ,IAAI,SAAS,KAAK;AAAA,QAC5B,EAAO;AAAA,UACL,QAAQ,MAAM,KAAK,EAAE,KAAK,CAAC,aAAa,SAAS,YAAY,EAAE,KAAK,CAAC,WAAW;AAAA,YAC9E,IAAI,SAAS,IAAI;AAAA,cACf,OAAO,IAAI,WAAW,MAAM;AAAA,YAC9B,EAAO;AAAA,cACL,MAAM,QAAQ,IAAI,YAAY,OAAO,EAAE,OAAO,MAAM;AAAA,cACpD,MAAM,IAAI,MAAM,oCAAoC,SAAS;AAAA;AAAA,EAEvE,OAAO;AAAA;AAAA,WAEA,CAAC;AAAA;AAAA;AAAA,MAGN,MAAM,MAAM,MAAM,EAAE,sBAAsB,MAAM,OAAO,EAAE,WAAW,KAAK,CAAC;AAAA,MAC1E,MAAM,cAAc,OAAO,KAAK,GAAG;AAAA,MACnC,MAAM,eAAe,YAAY,KAAK,CAAC,QAAQ,wBAAwB,KAAK,GAAG,KAAK,CAAC,IAAI,SAAS,mBAAmB,CAAC;AAAA,MACtH,IAAI,CAAC,cAAc;AAAA,QACjB,QAAQ,IAAI;AAAA,EAChB,KAAK,UAAU,aAAa,MAAM,CAAC,GAAG;AAAA,QAClC,MAAM,IAAI,MAAM,+DAA+D;AAAA,MACjF;AAAA,MACA,MAAM,kBAAkB,IAAI,cAAc;AAAA,MAC1C,OAAO,IAAI,UAAU,UAAU,eAAe;AAAA;AAAA,EAElD;AAAA,EAGI,WAAW,MAAM;AAAA,IACnB,IAAI,cAAc,YAAY;AAAA,IAC9B,OAAO,cAAc,CAAC,YAAY,CAAC,GAAG;AAAA,MACpC,IAAI;AAAA,MACJ,IAAI,SAAS;AAAA,MACb,IAAI,qBAAqB;AAAA,MACzB,IAAI,eAAe,IAAI,QAAQ,CAAC,SAAS,WAAW;AAAA,QAClD,sBAAsB;AAAA,QACtB,qBAAqB;AAAA,OACtB;AAAA,MACD,IAAI,qBAAqB,OAAO,UAAU;AAAA,MAC1C,IAAI,wBAAwB,OAAO,qBAAqB;AAAA,MACxD,IAAI,sBAAsB,OAAO,WAAW,YAAY,OAAO,QAAQ,YAAY,YAAY,OAAO,QAAQ,SAAS,QAAQ,YAAY,QAAQ,QAAQ;AAAA,MAC3J,IAAI,uBAAuB,CAAC,sBAAsB,CAAC,uBAAuB,CAAC;AAAA,MAC3E,IAAI,qBAAqB;AAAA,QACvB,QAAQ,kBAAkB,MAAa;AAAA,QACvC,IAAI,UAAU,cAAc,YAAY,GAAG;AAAA,MAC7C;AAAA,MACA,OAAO,+BAA+B;AAAA,MACtC,OAAO,0BAA0B;AAAA,MACjC,OAAO,qBAAqB;AAAA,MAC5B,OAAO,uBAAuB;AAAA,MAC9B,IAAI,kBAAkB,OAAO,OAAO,CAAC,GAAG,MAAM;AAAA,MAC9C,IAAI,aAAa,CAAC;AAAA,MAClB,IAAI,cAAc;AAAA,MAClB,IAAI,QAAwB,OAAO,CAAC,QAAQ,YAAY;AAAA,QACtD,MAAM;AAAA,SACL,OAAO;AAAA,MACV,IAAI,kBAAkB;AAAA,MACtB,SAAS,UAAU,CAAC,MAAM;AAAA,QACxB,IAAI,OAAO,eAAe;AAAA,UACxB,OAAO,OAAO,cAAc,MAAM,eAAe;AAAA,QACnD;AAAA,QACA,OAAO,kBAAkB;AAAA;AAAA,MAE3B,OAAO,YAAY,YAAY;AAAA,MAC/B,IAAI,WAAW;AAAA,MACf,IAAI,qBAAqB;AAAA,QACvB,IAAI,KAAK,QAAQ,IAAI;AAAA,QACrB,IAAI,WAAW,QAAQ,MAAM;AAAA,QAC7B,IAAI,CAAC,YAAY,IAAI,WAAW,OAAO,GAAG;AAAA,UACxC,kBAAkB,SAAS,QAAQ,QAAQ,KAAK,EAAE,cAAc,YAAY,GAAG,CAAC,IAAI;AAAA,QACtF;AAAA,QACA,aAA6B,OAAO,CAAC,aAAa;AAAA,UAChD,WAAW,UAAU,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI;AAAA,UACrD,IAAI,MAAM,GAAG,aAAa,QAAQ;AAAA,UAClC,OAAO;AAAA,WACN,YAAY;AAAA,QACf,YAA4B,OAAO,OAAO,UAAU,UAAU,SAAS;AAAA,UACrE,WAAW,UAAU,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI;AAAA,UACrD,IAAI,MAAM,GAAG,aAAa,UAAU,UAAe,YAAI,MAAM;AAAA,UAC7D,OAAO;AAAA,WACN,WAAW;AAAA,QACd,IAAI,CAAC,OAAO,kBAAkB,QAAQ,KAAK,SAAS,GAAG;AAAA,UACrD,cAAc,QAAQ,KAAK,GAAG,QAAQ,OAAO,GAAG;AAAA,QAClD;AAAA,QACA,aAAa,QAAQ,KAAK,MAAM,CAAC;AAAA,QACjC,QAAwB,OAAO,CAAC,QAAQ,YAAY;AAAA,UAClD,QAAQ,WAAW;AAAA,UACnB,MAAM;AAAA,WACL,OAAO;AAAA,MACZ,EAAO,SAAI,sBAAsB,uBAAuB;AAAA,QACtD,IAAI,uBAAuB;AAAA,UACzB,kBAAkB,KAAK,SAAS;AAAA,QAClC,EAAO,SAAI,OAAO,YAAY,eAAe,SAAS,eAAe;AAAA,UACnE,kBAAkB,SAAS,cAAc;AAAA,QAC3C;AAAA,QACA,IAAI,aAAa;AAAA,UACf,kBAAkB;AAAA,QACpB;AAAA,QACA,IAAI,gBAAgB,WAAW,OAAO,GAAG;AAAA,UACvC,kBAAkB;AAAA,QACpB,EAAO;AAAA,UACL,kBAAkB,gBAAgB,MAAM,GAAG,gBAAgB,QAAQ,UAAU,EAAE,EAAE,YAAY,GAAG,IAAI,CAAC;AAAA;AAAA,QAEvG;AAAA,UACE,IAAI,uBAAuB;AAAA,YACzB,aAA6B,OAAO,CAAC,QAAQ;AAAA,cAC3C,IAAI,MAAM,IAAI;AAAA,cACd,IAAI,KAAK,OAAO,KAAK,KAAK;AAAA,cAC1B,IAAI,eAAe;AAAA,cACnB,IAAI,KAAK,IAAI;AAAA,cACb,OAAO,IAAI,WAET,IAAI,QACN;AAAA,eACC,YAAY;AAAA,UACjB;AAAA,UACA,YAA4B,OAAO,OAAO,QAAQ;AAAA,YAChD,IAAI,UAAU,GAAG,GAAG;AAAA,cAClB,OAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AAAA,gBACtC,IAAI,MAAM,IAAI;AAAA,gBACd,IAAI,KAAK,OAAO,KAAK,IAAI;AAAA,gBACzB,IAAI,eAAe;AAAA,gBACnB,IAAI,SAAS,MAAM;AAAA,kBACjB,IAAI,IAAI,UAAU,OAAO,IAAI,UAAU,KAAK,IAAI,UAAU;AAAA,oBACxD,QAAQ,IAAI,QAAQ;AAAA,oBACpB;AAAA,kBACF;AAAA,kBACA,OAAO,IAAI,MAAM;AAAA;AAAA,gBAEnB,IAAI,UAAU;AAAA,gBACd,IAAI,KAAK,IAAI;AAAA,eACd;AAAA,YACH;AAAA,YACA,IAAI,WAAW,MAAM,MAAM,KAAK;AAAA,cAC9B,aAAa;AAAA,YACf,CAAC;AAAA,YACD,IAAI,SAAS,IAAI;AAAA,cACf,OAAO,SAAS,YAAY;AAAA,YAC9B;AAAA,YACA,MAAM,IAAI,MAAM,SAAS,SAAS,QAAQ,SAAS,GAAG;AAAA,aACrD,WAAW;AAAA,QAChB;AAAA,MACF,EAAO;AAAA,MAEP,IAAI,MAAM,OAAO,YAAY,QAAQ,IAAI,KAAK,OAAO;AAAA,MACrD,IAAI,MAAM,OAAO,eAAe,QAAQ,MAAM,KAAK,OAAO;AAAA,MAC1D,OAAO,OAAO,QAAQ,eAAe;AAAA,MACrC,kBAAkB;AAAA,MAClB,IAAI,OAAO;AAAA,QAAc,aAAa,OAAO;AAAA,MAC7C,IAAI,OAAO;AAAA,QAAgB,cAAc,OAAO;AAAA,MAChD,IAAI,mBAAmB,OAAO,uBAAuB,CAAC;AAAA,MACtD,IAAI,aAAa,OAAO;AAAA,MACxB,IAAI;AAAA,MACJ,IAAI,QAAQ;AAAA,MACZ,IAAI;AAAA,MACJ,SAAS,MAAM,CAAC,WAAW,MAAM;AAAA,QAC/B,IAAI,CAAC,WAAW;AAAA,UACd,MAAM,IAAI;AAAA,QACZ;AAAA;AAAA,MAEF,OAAO,QAAQ,QAAQ;AAAA,MACvB,IAAI,MAAM,OAAO,QAAQ,QAAQ,SAAS,QAAQ,SAAS,SAAS,QAAQ,SAAS;AAAA,MACrF,IAAI;AAAA,MACJ,IAAI,qBAAqB;AAAA,MACzB,IAAI,YAA4B,OAAO,CAAC,aAAa,SAAS,WAAW,SAAS,GAAG,WAAW;AAAA,MAChG,SAAS,iBAAiB,GAAG;AAAA,QAC3B,IAAI,IAAI,WAAW;AAAA,QACnB,OAAO,oBAAoB,iBAAiB,IAAI,SAAS,CAAC;AAAA,QAC1D,OAAO,WAAW,QAAQ,IAAI,UAAU,CAAC;AAAA,QACzC,OAAO,YAAY,SAAS,IAAI,WAAW,CAAC;AAAA,QAC5C,OAAO,YAAY,SAAS,IAAI,WAAW,CAAC;AAAA,QAC5C,OAAO,aAAa,UAAU,IAAI,YAAY,CAAC;AAAA,QAC/C,OAAO,YAAY,SAAS,IAAI,WAAW,CAAC;AAAA,QAC5C,OAAO,aAAa,UAAU,IAAI,YAAY,CAAC;AAAA,QAC/C,OAAO,aAAa,UAAU,IAAI,aAAa,CAAC;AAAA,QAChD,OAAO,aAAa,UAAU,IAAI,aAAa,CAAC;AAAA,QAChD,OAAO,YAAY,SAAS,IAAI,cAAc,CAAC;AAAA,QAC/C,OAAO,aAAa,UAAU,IAAI,eAAe,CAAC;AAAA;AAAA,MAEpD,OAAO,mBAAmB,mBAAmB;AAAA,MAC7C,IAAI,OAAO,eAAe;AAAA,QACxB,aAAa,OAAO;AAAA,MACtB,EAAO;AAAA,QACL,IAAI,iBAAiB,OAAO,qBAAqB;AAAA,QACjD,aAAa,IAAI,YAAY,OAAO;AAAA,UAClC,SAAW,iBAAiB;AAAA,UAM5B,SAAW;AAAA,QACb,CAAC;AAAA;AAAA,MAEH,kBAAkB;AAAA,MAClB,IAAI,kBAAkB,CAAC;AAAA,MACvB,SAAS,MAAM,GAAG;AAAA,QAChB,IAAI,OAAO,WAAW;AAAA,UACpB,IAAI,OAAO,OAAO,aAAa;AAAA,YAAY,OAAO,YAAY,CAAC,OAAO,SAAS;AAAA,UAC/E,OAAO,OAAO,UAAU,QAAQ;AAAA,YAC9B,YAAY,OAAO,UAAU,MAAM,CAAC;AAAA,UACtC;AAAA,QACF;AAAA,QACA,qBAAqB,SAAS;AAAA;AAAA,MAEhC,OAAO,QAAQ,QAAQ;AAAA,MACvB,SAAS,WAAW,GAAG;AAAA,QACrB,qBAAqB;AAAA,QACrB,qBAAqB,eAAe;AAAA,QACpC,YAAY,qBAAqB;AAAA,QACjC,qBAAqB,WAAW;AAAA;AAAA,MAElC,OAAO,aAAa,aAAa;AAAA,MACjC,SAAS,OAAO,GAAG;AAAA,MAEnB,OAAO,SAAS,SAAS;AAAA,MACzB,SAAS,OAAO,GAAG;AAAA,QACjB,IAAI,OAAO,YAAY;AAAA,UACrB,IAAI,OAAO,OAAO,cAAc;AAAA,YAAY,OAAO,aAAa,CAAC,OAAO,UAAU;AAAA,UAClF,OAAO,OAAO,WAAW,QAAQ;AAAA,YAC/B,aAAa,OAAO,WAAW,MAAM,CAAC;AAAA,UACxC;AAAA,QACF;AAAA,QACA,qBAAqB,UAAU;AAAA;AAAA,MAEjC,OAAO,SAAS,SAAS;AAAA,MACzB,IAAI,kBAAkB;AAAA,MACtB,IAAI,wBAAwB;AAAA,MAC5B,SAAS,sBAAsB,CAAC,IAAI;AAAA,QAClC,OAAO;AAAA;AAAA,MAET,OAAO,wBAAwB,wBAAwB;AAAA,MACvD,SAAS,gBAAgB,CAAC,IAAI;AAAA,QAC5B;AAAA,QACA,OAAO,4BAA4B,eAAe;AAAA;AAAA,MAEpD,OAAO,kBAAkB,kBAAkB;AAAA,MAC3C,SAAS,mBAAmB,CAAC,IAAI;AAAA,QAC/B;AAAA,QACA,OAAO,4BAA4B,eAAe;AAAA,QAClD,IAAI,mBAAmB,GAAG;AAAA,UACxB,IAAI,uBAAuB;AAAA,YACzB,IAAI,WAAW;AAAA,YACf,wBAAwB;AAAA,YACxB,SAAS;AAAA,UACX;AAAA,QACF;AAAA;AAAA,MAEF,OAAO,qBAAqB,qBAAqB;AAAA,MACjD,SAAS,KAAK,CAAC,MAAM;AAAA,QACnB,OAAO,aAAa,IAAI;AAAA,QACxB,OAAO,aAAa,OAAO;AAAA,QAC3B,IAAI,IAAI;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,IAAI,IAAI,IAAI,YAAY,aAAa,IAAI;AAAA,QACzC,mBAAmB,CAAC;AAAA,QACpB,MAAM;AAAA;AAAA,MAER,OAAO,OAAO,OAAO;AAAA,MACrB,IAAI;AAAA,MACJ,SAAS,cAAc,GAAG;AAAA,QACxB,IAAI,OAAO,eAAe;AAAA,UACxB,OAAO,WAAW,kBAAkB;AAAA,QACtC;AAAA,QACA,OAAO,IAAI,IAAI,oBAAoB,YAAY,GAAG,EAAE;AAAA;AAAA,MAEtD,OAAO,gBAAgB,gBAAgB;AAAA,MACvC,SAAS,aAAa,CAAC,MAAM;AAAA,QAC3B,IAAI,QAAQ,kBAAkB,YAAY;AAAA,UACxC,OAAO,IAAI,WAAW,UAAU;AAAA,QAClC;AAAA,QACA,IAAI,YAAY;AAAA,UACd,OAAO,WAAW,IAAI;AAAA,QACxB;AAAA,QACA,MAAM;AAAA;AAAA,MAER,OAAO,eAAe,eAAe;AAAA,MACrC,eAAe,aAAa,CAAC,YAAY;AAAA,QACvC,IAAI,CAAC,YAAY;AAAA,UACf,IAAI;AAAA,YACF,IAAI,WAAW,MAAM,UAAU,UAAU;AAAA,YACzC,OAAO,IAAI,WAAW,QAAQ;AAAA,YAC9B,MAAM;AAAA,QAEV;AAAA,QACA,OAAO,cAAc,UAAU;AAAA;AAAA,MAEjC,OAAO,eAAe,eAAe;AAAA,MACrC,eAAe,sBAAsB,CAAC,YAAY,SAAS;AAAA,QACzD,IAAI;AAAA,UACF,IAAI,UAAU,MAAM,cAAc,UAAU;AAAA,UAC5C,IAAI,YAAY,MAAM,YAAY,YAAY,SAAS,OAAO;AAAA,UAC9D,OAAO;AAAA,UACP,OAAO,QAAQ;AAAA,UACf,IAAI,0CAA0C,QAAQ;AAAA,UACtD,MAAM,MAAM;AAAA;AAAA;AAAA,MAGhB,OAAO,wBAAwB,wBAAwB;AAAA,MACvD,eAAe,gBAAgB,CAAC,SAAS,YAAY,SAAS;AAAA,QAC5D,IAAI,CAAC,WAAW,OAAO,YAAY,wBAAwB,cAAc,CAAC,UAAU,UAAU,KAAK,CAAC,qBAAqB;AAAA,UACvH,IAAI;AAAA,YACF,IAAI,WAAW,MAAM,YAAY;AAAA,cAC/B,aAAa;AAAA,YACf,CAAC;AAAA,YACD,IAAI,sBAAsB,MAAM,YAAY,qBAAqB,UAAU,OAAO;AAAA,YAClF,OAAO;AAAA,YACP,OAAO,QAAQ;AAAA,YACf,IAAI,kCAAkC,QAAQ;AAAA,YAC9C,IAAI,2CAA2C;AAAA;AAAA,QAEnD;AAAA,QACA,OAAO,uBAAuB,YAAY,OAAO;AAAA;AAAA,MAEnD,OAAO,kBAAkB,kBAAkB;AAAA,MAC3C,SAAS,cAAc,GAAG;AAAA,QACxB,OAAO;AAAA,UACL,KAAO;AAAA,UACP,wBAA0B;AAAA,UAC1B,WAAW,IAAI,MAAM,aAAa,UAAU;AAAA,UAC5C,YAAY,IAAI,MAAM,aAAa,UAAU;AAAA,QAC/C;AAAA;AAAA,MAEF,OAAO,gBAAgB,gBAAgB;AAAA,MACvC,eAAe,UAAU,GAAG;AAAA,QAC1B,SAAS,eAAe,CAAC,WAAW,SAAS;AAAA,UAC3C,cAAc,UAAU;AAAA,UACxB,cAAc,gBAAgB,aAAa,IAAI;AAAA,UAC/C,IAAI,YAAY,kBAAkB,OAAO;AAAA,UACzC,IAAI,UAAU,eAAe;AAAA,YAC3B,mBAAmB,UAAU,cAAc,OAAO,gBAAgB;AAAA,UACpE;AAAA,UACA,gBAAgB,aAAa,MAAM;AAAA,UACnC,KAAK,KAAK;AAAA,UACV,WAAW;AAAA,UACX,gBAAgB,KAAK,YAAY,2BAA2B;AAAA,UAC5D,oBAAoB,kBAAkB;AAAA,UACtC,OAAO;AAAA;AAAA,QAET,OAAO,iBAAiB,iBAAiB;AAAA,QACzC,iBAAiB,kBAAkB;AAAA,QACnC,SAAS,0BAA0B,CAAC,SAAS;AAAA,UAC3C,OAAO,gBAAgB,QAAQ,aAAa,QAAQ,SAAS;AAAA;AAAA,QAE/D,OAAO,4BAA4B,4BAA4B;AAAA,QAC/D,IAAI,QAAQ,eAAe;AAAA,QAC3B,IAAI,OAAO,oBAAoB;AAAA,UAC7B,OAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AAAA,YACtC,OAAO,mBAAmB,OAAO,CAAC,KAAK,SAAS;AAAA,cAC9C,gBAAgB,KAAK,IAAI;AAAA,cACzB,QAAQ,IAAI,OAAO;AAAA,aACpB;AAAA,WACF;AAAA,QACH;AAAA,QACA,mBAAmB,eAAe;AAAA,QAClC,IAAI;AAAA,UACF,IAAI,SAAS,MAAM,iBAAiB,YAAY,gBAAgB,KAAK;AAAA,UACrE,IAAI,UAAU,2BAA2B,MAAM;AAAA,UAC/C,OAAO;AAAA,UACP,OAAO,GAAG;AAAA,UACV,mBAAmB,CAAC;AAAA,UACpB,OAAO,QAAQ,OAAO,CAAC;AAAA;AAAA;AAAA,MAG3B,OAAO,YAAY,YAAY;AAAA,MAC/B,IAAI,aAAa,CAAC;AAAA;AAAA,MAClB,MAAM,WAAW;AAAA,eACR;AAAA,UACL,OAAO,MAAM,YAAY;AAAA;AAAA,QAE3B,OAAO;AAAA,QACP,WAAW,CAAC,QAAQ;AAAA,UAClB,KAAK,UAAU,gCAAgC;AAAA,UAC/C,KAAK,SAAS;AAAA;AAAA,MAElB;AAAA,MACA,IAAI,MAAM,CAAC;AAAA,MACX,IAAI,2BAA2C,IAAI,IAAI,CAAC,CAAC;AAAA,MACzD,IAAI,aAAa;AAAA,QACf,GAAG,CAAC,KAAK,SAAS;AAAA,UAChB,IAAI,MAAM,IAAI;AAAA,UACd,IAAI,CAAC,KAAK;AAAA,YACR,MAAM,IAAI,WAAW,IAAI,YAAY,OAAO;AAAA,cAC1C,OAAS;AAAA,cACT,SAAW;AAAA,YACb,CAAC;AAAA,UACH;AAAA,UACA,IAAI,CAAC,yBAAyB,IAAI,OAAO,GAAG;AAAA,YAC1C,IAAI,WAAW;AAAA,UACjB;AAAA,UACA,OAAO;AAAA;AAAA,MAEX;AAAA,MACA,IAAI,mBAAmC,OAAO,CAAC,eAAe,eAAe,WAAW,YAAY,IAAI,GAAG,kBAAkB;AAAA,MAC7H,IAAI,mBAAmC,OAAO,CAAC,eAAe,eAAe,WAAW,YAAY,IAAI,GAAG,kBAAkB;AAAA,MAC7H,IAAI,mBAAmC,OAAO,CAAC,eAAe,eAAe,SAAS,YAAY,IAAI,GAAG,kBAAkB;AAAA,MAC3H,IAAI,mBAAmC,OAAO,CAAC,eAAe,eAAe,SAAS,YAAY,IAAI,GAAG,kBAAkB;AAAA,MAC3H,IAAI,mBAAmC,OAAO,CAAC,eAAe,eAAe,UAAU,YAAY,IAAI,GAAG,kBAAkB;AAAA,MAC5H,IAAI,mBAAmC,OAAO,CAAC,eAAe,eAAe,UAAU,YAAY,IAAI,GAAG,kBAAkB;AAAA,MAC5H,IAAI,oBAAoC,OAAO,CAAC,YAAY,UAAU,eAAe,WAAW,YAAY,OAAO,IAAI,GAAG,mBAAmB;AAAA,MAC7I,IAAI,oBAAoC,OAAO,CAAC,YAAY,UAAU,eAAe,WAAW,YAAY,OAAO,IAAI,GAAG,mBAAmB;AAAA,MAC7I,IAAI,oBAAoC,OAAO,CAAC,YAAY,UAAU,eAAe,SAAS,YAAY,OAAO,IAAI,GAAG,mBAAmB;AAAA,MAC3I,IAAI,oBAAoC,OAAO,CAAC,YAAY,UAAU,eAAe,SAAS,YAAY,OAAO,IAAI,GAAG,mBAAmB;AAAA,MAC3I,IAAI,oBAAoC,OAAO,CAAC,YAAY,UAAU,eAAe,UAAU,YAAY,OAAO,IAAI,GAAG,mBAAmB;AAAA,MAC5I,IAAI,oBAAoC,OAAO,CAAC,YAAY,UAAU,eAAe,UAAU,YAAY,OAAO,IAAI,GAAG,mBAAmB;AAAA,MAC5I,IAAI,uBAAuC,OAAO,CAAC,cAAc;AAAA,QAC/D,OAAO,UAAU,SAAS,GAAG;AAAA,UAC3B,UAAU,MAAM,EAAE,MAAM;AAAA,QAC1B;AAAA,SACC,sBAAsB;AAAA,MACzB,IAAI,aAAa,CAAC;AAAA,MAClB,IAAI,eAA+B,OAAO,CAAC,OAAO,WAAW,QAAQ,EAAE,GAAG,cAAc;AAAA,MACxF,IAAI,YAAY,CAAC;AAAA,MACjB,IAAI,cAA8B,OAAO,CAAC,OAAO,UAAU,QAAQ,EAAE,GAAG,aAAa;AAAA,MACrF,IAAI,cAAc,OAAO,eAAe,cAAc,IAAI,cAAqB;AAAA,MAC/E,IAAI,oBAAoC,OAAO,CAAC,aAAa,MAAM,GAAG,iBAAiB,QAAQ;AAAA,QAC7F,IAAI,SAAS,MAAM;AAAA,QACnB,IAAI,SAAS;AAAA,QACb,OAAO,YAAY,WAAW,EAAE,UAAU;AAAA,UAAS,EAAE;AAAA,QACrD,IAAI,SAAS,MAAM,MAAM,YAAY,UAAU,aAAa;AAAA,UAC1D,OAAO,YAAY,OAAO,YAAY,SAAS,KAAK,MAAM,CAAC;AAAA,QAC7D;AAAA,QACA,IAAI,MAAM;AAAA,QACV,OAAO,MAAM,QAAQ;AAAA,UACnB,IAAI,KAAK,YAAY;AAAA,UACrB,IAAI,EAAE,KAAK,MAAM;AAAA,YACf,OAAO,OAAO,aAAa,EAAE;AAAA,YAC7B;AAAA,UACF;AAAA,UACA,IAAI,KAAK,YAAY,SAAS;AAAA,UAC9B,KAAK,KAAK,QAAQ,KAAK;AAAA,YACrB,OAAO,OAAO,cAAc,KAAK,OAAO,IAAI,EAAE;AAAA,YAC9C;AAAA,UACF;AAAA,UACA,IAAI,KAAK,YAAY,SAAS;AAAA,UAC9B,KAAK,KAAK,QAAQ,KAAK;AAAA,YACrB,MAAM,KAAK,OAAO,KAAK,MAAM,IAAI;AAAA,UACnC,EAAO;AAAA,YACL,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,IAAI,YAAY,SAAS;AAAA;AAAA,UAElE,IAAI,KAAK,OAAO;AAAA,YACd,OAAO,OAAO,aAAa,EAAE;AAAA,UAC/B,EAAO;AAAA,YACL,IAAI,KAAK,KAAK;AAAA,YACd,OAAO,OAAO,aAAa,QAAQ,MAAM,IAAI,QAAQ,KAAK,IAAI;AAAA;AAAA,QAElE;AAAA,QACA,OAAO;AAAA,SACN,mBAAmB;AAAA,MACtB,IAAI,oBAAoC,OAAO,CAAC,YAAY;AAAA,QAC1D,IAAI,SAAS;AAAA,QACb,IAAI,MAAM;AAAA,QACV,SAAS,KAAK,GAAG;AAAA,UACf,OAAO,QAAQ;AAAA;AAAA,QAEjB,OAAO,OAAO,OAAO;AAAA,QACrB,SAAS,MAAM,GAAG;AAAA,UAChB,IAAI,MAAM;AAAA,UACV,IAAI,MAAM;AAAA,UACV,OAAO,MAAG;AAAA,YACR,IAAI,OAAO,QAAQ;AAAA,YACnB,QAAQ,OAAO,OAAO;AAAA,YACtB,OAAO;AAAA,YACP,IAAI,EAAE,OAAO;AAAA,cAAM;AAAA,UACrB;AAAA,UACA,OAAO;AAAA;AAAA,QAET,OAAO,QAAQ,QAAQ;AAAA,QACvB,SAAS,SAAS,GAAG;AAAA,UACnB,IAAI,MAAM,OAAO;AAAA,UACjB,UAAU;AAAA,UACV,OAAO,kBAAkB,SAAS,SAAS,KAAK,GAAG;AAAA;AAAA,QAErD,OAAO,WAAW,WAAW;AAAA,QAC7B,SAAS,MAAM,CAAC,WAAW,SAAS;AAAA,UAClC,IAAI;AAAA,YAAW,MAAM,IAAI,MAAM,OAAO;AAAA;AAAA,QAExC,OAAO,QAAQ,QAAQ;AAAA,QACvB,IAAI,QAAQ;AAAA,QACZ,IAAI,mBAAmB,YAAY,QAAQ;AAAA,UACzC,IAAI,gBAAgB,YAAY,OAAO,eAAe,SAAS,KAAK;AAAA,UACpE,IAAI,cAAc,WAAW,GAAG;AAAA,YAC9B,QAAQ;AAAA,YACR,gBAAgB,YAAY,OAAO,eAAe,SAAS,KAAK;AAAA,UAClE;AAAA,UACA,OAAO,cAAc,WAAW,GAAG,qBAAqB;AAAA,UACxD,UAAU,IAAI,WAAW,cAAc,EAAE;AAAA,UACzC,MAAM,QAAQ;AAAA,QAChB,EAAO;AAAA,UACL,IAAI,YAAY,IAAI,YAAY,IAAI,WAAW,QAAQ,SAAS,GAAG,EAAE,CAAC,EAAE,MAAM;AAAA,UAC9E,IAAI,mBAAmB,UAAU,MAAM,cAAc,UAAU,MAAM;AAAA,UACrE,OAAO,CAAC,kBAAkB,+BAA+B;AAAA,UACzD,OAAO,QAAQ,OAAO,GAAG,qCAAqC;AAAA,UAC9D,SAAS;AAAA,UACT,IAAI,eAAe,OAAO;AAAA,UAC1B,MAAM,SAAS;AAAA,UACf,QAAQ,UAAU;AAAA;AAAA,QAEpB,IAAI,gBAAgB;AAAA,UAClB,eAAe,CAAC;AAAA,UAChB,YAA4B,IAAI;AAAA,UAChC,aAA6B,IAAI;AAAA,QACnC;AAAA,QACA,IAAI,SAAS,UAAU;AAAA,UACrB,cAAc,aAAa,OAAO;AAAA,UAClC,cAAc,cAAc,OAAO;AAAA,UACnC,cAAc,YAAY,OAAO;AAAA,UACjC,cAAc,aAAa,OAAO;AAAA,UAClC,IAAI,qBAAqB,OAAO;AAAA,UAChC,SAAS,KAAK,EAAG,KAAK,oBAAoB,EAAE,IAAI;AAAA,YAC9C,IAAI,UAAU,UAAU;AAAA,YACxB,cAAc,cAAc,KAAK,OAAO;AAAA,UAC1C;AAAA,QACF,EAAO;AAAA,UACL,OAAO,UAAU,UAAU;AAAA,UAC3B,IAAI,uBAAuB;AAAA,UAC3B,IAAI,qBAAqB;AAAA,UACzB,IAAI,0BAA0B;AAAA,UAC9B,IAAI,0BAA0B;AAAA,UAC9B,IAAI,kBAAkB;AAAA,UACtB,IAAI,2BAA2B;AAAA,UAC/B,IAAI,2BAA2B;AAAA,UAC/B,OAAO,SAAS,KAAK;AAAA,YACnB,IAAI,iBAAiB,MAAM;AAAA,YAC3B,IAAI,iBAAiB,OAAO;AAAA,YAC5B,IAAI,mBAAmB,sBAAsB;AAAA,cAC3C,cAAc,aAAa,OAAO;AAAA,cAClC,cAAc,cAAc,OAAO;AAAA,cACnC,cAAc,YAAY,OAAO;AAAA,cACjC,cAAc,aAAa,OAAO;AAAA,YACpC,EAAO,SAAI,mBAAmB,oBAAoB;AAAA,cAChD,IAAI,qBAAqB,OAAO;AAAA,cAChC,SAAS,KAAK,EAAG,KAAK,oBAAoB,EAAE,IAAI;AAAA,gBAC9C,UAAU,UAAU;AAAA,gBACpB,cAAc,cAAc,KAAK,OAAO;AAAA,cAC1C;AAAA,YACF,EAAO,SAAI,mBAAmB,yBAAyB;AAAA,cACrD,IAAI,QAAQ,OAAO;AAAA,cACnB,OAAO,SAAS;AAAA,gBACd,IAAI,UAAU,UAAU;AAAA,gBACxB,IAAI,SAAS,OAAO;AAAA,gBACpB,IAAI,SAAS,iBAAiB;AAAA,kBAC5B,cAAc,WAAW,IAAI,OAAO;AAAA,gBACtC;AAAA,cACF;AAAA,YACF,EAAO,SAAI,mBAAmB,yBAAyB;AAAA,cACrD,IAAI,QAAQ,OAAO;AAAA,cACnB,OAAO,SAAS;AAAA,gBACd,IAAI,UAAU,UAAU;AAAA,gBACxB,IAAI,UAAU,UAAU;AAAA,gBACxB,IAAI,SAAS,OAAO;AAAA,gBACpB,KAAK,SAAS,6BAA6B,0BAA0B;AAAA,kBACnE,cAAc,YAAY,IAAI,OAAO;AAAA,gBACvC;AAAA,cACF;AAAA,YACF,EAAO;AAAA,cACL,UAAU;AAAA;AAAA,UAEd;AAAA;AAAA,QAEF,OAAO;AAAA,SACN,mBAAmB;AAAA,MACtB,SAAS,QAAQ,CAAC,KAAK,OAAO,MAAM;AAAA,QAClC,IAAI,KAAK,SAAS,GAAG;AAAA,UAAG,OAAO;AAAA,QAC/B,QAAQ;AAAA,eACD;AAAA,YACH,OAAO,MAAM;AAAA,eACV;AAAA,YACH,OAAO,MAAM;AAAA,eACV;AAAA,YACH,OAAO,kBAAkB,OAAO,KAAK,CAAC;AAAA,eACnC;AAAA,YACH,OAAO,kBAAkB,OAAO,KAAK,CAAC;AAAA,eACnC;AAAA,YACH,OAAO,OAAO,OAAO;AAAA,eAClB;AAAA,YACH,OAAO,kBAAkB,OAAO,KAAK,CAAC;AAAA,eACnC;AAAA,YACH,OAAO,kBAAkB,OAAO,KAAK,CAAC;AAAA,eACnC;AAAA,YACH,OAAO,kBAAkB,OAAO,KAAK,CAAC;AAAA;AAAA,YAEtC,MAAM,8BAA8B,MAAM;AAAA;AAAA;AAAA,MAGhD,OAAO,UAAU,UAAU;AAAA,MAC3B,IAAI,SAAyB,OAAO,CAAC,OAAO,SAAS,SAAS;AAAA,QAC5D,IAAI,MAAM;AAAA,UACR,UAAU;AAAA,UACV,MAAM;AAAA,UACN,SAAS;AAAA,UACT,QAAQ;AAAA,QACV;AAAA,QACA,KAAK,iBAAiB,SAAS;AAAA,QAC/B,IAAI,WAAgB,MAAG;AAAA,UACrB,KAAK,mBAAmB,WAAW;AAAA,QACrC;AAAA,QACA,OAAO;AAAA,SACN,QAAQ;AAAA,MACX,IAAI,OAAO;AAAA,QACT,kBAAkB,CAAC;AAAA,QACnB,oBAAoB,CAAC;AAAA,QACrB,IAAI,GAAG;AAAA,UACL,OAAO,YAAY,GAAG,WAAW;AAAA;AAAA,MAErC;AAAA,MACA,IAAI,eAAe;AAAA,MACnB,IAAI,cAA8B,OAAO,CAAC,MAAM,cAAc,KAAK,KAAK,OAAO,SAAS,IAAI,WAAW,aAAa;AAAA,MACpH,IAAI,YAA4B,OAAO,CAAC,SAAS;AAAA,QAC/C,IAAI,oBAAoB;AAAA,UACtB,OAAO,QAAQ,MAAM,CAAC;AAAA,QACxB;AAAA,QACA,IAAI,MAAM;AAAA,QACV,IAAI,MAAM,MAAM,YAAY,MAAM,EAAE;AAAA,QACpC,eAAe;AAAA,QACf,IAAI,eAAe,QAAQ;AAAA,QAC3B,OAAO;AAAA,SACN,WAAW;AAAA,MACd,IAAI,gBAAgC,OAAO,CAAC,YAAY,CAAC,mBAAmB,eAAe,4BAA4B,gBAAgB,cAAc,eAAe,sBAAsB,wBAAwB,mBAAmB,qBAAqB,kBAAkB,iBAAiB,iBAAiB,cAAc,EAAE,SAAS,OAAO,KAAK,QAAQ,WAAW,WAAW,GAAG,eAAe;AAAA,MACnY,IAAI,gBAAgC,OAAO,CAAC,GAAG,WAAW;AAAA,QACxD,IAAI,IAAI,KAAK;AAAA,UACX,OAAO,KAAK,CAAC;AAAA,QACf,EAAO;AAAA,UACL,OAAO,KAAK,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA;AAAA,SAElC,eAAe;AAAA,MAClB,IAAI,iBAAiC,OAAO,CAAC,QAAQ;AAAA,QACnD,IAAI,YAAY;AAAA,UACd,GAAK;AAAA,UACL,GAAK;AAAA,UACL,GAAK;AAAA,UACL,GAAK;AAAA,UACL,GAAK;AAAA,UACL,GAAK;AAAA,QACP;AAAA,QACA,IAAI,OAAO;AAAA,UACT,YAAY,CAAC;AAAA,UACb,SAAS,IAAI,MAAM,MAAM,CAAC,IAAI,CAAC,UAAU,IAAI,GAAG;AAAA,QAClD;AAAA,QACA,SAAS,KAAK,EAAG,KAAK,IAAI,QAAQ,EAAE,IAAI;AAAA,UACtC,KAAK,WAAW,KAAK,UAAU,IAAI,IAAI;AAAA,QACzC;AAAA,QACA,OAAO;AAAA,SACN,gBAAgB;AAAA,MACnB,IAAI,mBAAmC,OAAO,CAAC,KAAK,WAAW;AAAA,QAC7D,IAAI,SAAS,IAAI,MAAM,GAAG,CAAC;AAAA,QAC3B,IAAI,WAAW,IAAI,MAAM,CAAC;AAAA,QAC1B,IAAI,YAAY;AAAA,UACd,GAAK;AAAA,UAEL,GAAK;AAAA,UAEL,GAAK;AAAA,UAEL,GAAK;AAAA,UAEL,GAAK;AAAA,UAEL,GAAK;AAAA,QACP;AAAA,QACA,OAAO,KAAK,EAAE;AAAA,QACd,cAAc,SAAS,QAAQ,MAAM;AAAA,QACrC,SAAS,KAAK,EAAG,KAAK,SAAS,QAAQ,EAAE,IAAI;AAAA,UAC3C,OAAO,KAAK,UAAU,SAAS,IAAI;AAAA,QACrC;AAAA,QACA,IAAI,UAAU,KAAK;AAAA,UACjB,OAAO,KAAK,CAAC;AAAA,QACf,EAAO;AAAA,UACL,OAAO,KAAK,GAAG,UAAU,OAAO;AAAA;AAAA,SAEjC,kBAAkB;AAAA,MACrB,IAAI,0BAA0C,OAAO,CAAC,OAAO,QAAQ;AAAA,QACnE,IAAI,OAAO,YAAY,YAAY,YAAY;AAAA,UAC7C,OAAO,IAAI,YAAY,SAAS,eAAe,GAAG,GAAG,KAAK;AAAA,QAC5D;AAAA,QACA,IAAI,kBAAkB,CAAC,CAAC;AAAA,QACxB,iBAAiB,KAAK,eAAe;AAAA,QACrC,IAAI,QAAQ;AAAA,UACV;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UAEA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UAEA;AAAA,QACF;AAAA,QACA,cAAc,gBAAgB,QAAQ,KAAK;AAAA,QAC3C,MAAM,KAAK,GAAG,eAAe;AAAA,QAC7B,MAAM,KACJ,GACA,GAGA,GACA,GACA,KACA,GACA,KACA,GACA,GACA,GACA,GAGA,GACA,GACA,KACA,GACA,CACF;AAAA,QACA,IAAI,UAAU,IAAI,YAAY,OAAO,IAAI,WAAW,KAAK,CAAC;AAAA,QAC1D,IAAI,YAAY,IAAI,YAAY,SAAS,SAAS;AAAA,UAChD,GAAK;AAAA,YACH,GAAK;AAAA,UACP;AAAA,QACF,CAAC;AAAA,QACD,IAAI,cAAc,UAAU,QAAQ;AAAA,QACpC,OAAO;AAAA,SACN,yBAAyB;AAAA,MAC5B,IAAI,kBAAkB,CAAC;AAAA,MACvB,IAAI,YAAY,IAAI,YAAY,MAAM;AAAA,QACpC,SAAW;AAAA,QACX,SAAW;AAAA,MACb,CAAC;AAAA,MACD,IAAI,oBAAoC,OAAO,CAAC,YAAY;AAAA,QAC1D,IAAI,QAAQ,gBAAgB;AAAA,QAC5B,IAAI,CAAC,OAAO;AAAA,UACV,IAAI,WAAW,gBAAgB;AAAA,YAAQ,gBAAgB,SAAS,UAAU;AAAA,UAC1E,gBAAgB,WAAW,QAAQ,UAAU,IAAI,OAAO;AAAA,QAC1D;AAAA,QACA,OAAO;AAAA,SACN,mBAAmB;AAAA,MACtB,IAAI,iBAAiC,OAAO,CAAC,QAAQ,UAAU;AAAA,QAC7D,IAAI,qBAAqB;AAAA,UACvB,SAAS,KAAK,OAAQ,KAAK,SAAS,OAAO,MAAM;AAAA,YAC/C,IAAI,OAAO,kBAAkB,EAAE;AAAA,YAC/B,IAAI,MAAM;AAAA,cACR,oBAAoB,IAAI,MAAM,EAAE;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AAAA,SACC,gBAAgB;AAAA,MACnB,IAAI;AAAA,MACJ,IAAI,qBAAqC,OAAO,CAAC,UAAU;AAAA,QACzD,IAAI,CAAC,qBAAqB;AAAA,UACxB,sBAAsC,IAAI;AAAA,UAC1C,eAAe,GAAG,UAAU,MAAM;AAAA,QACpC;AAAA,QACA,OAAO,oBAAoB,IAAI,KAAK,KAAK;AAAA,SACxC,oBAAoB;AAAA,MACvB,IAAI,mBAAmB,CAAC;AAAA,MACxB,IAAI,oBAAoC,OAAO,MAAM;AAAA,QACnD,IAAI,iBAAiB,QAAQ;AAAA,UAC3B,OAAO,iBAAiB,IAAI;AAAA,QAC9B;AAAA,QACA,IAAI;AAAA,UACF,UAAU,KAAK,CAAC;AAAA,UAChB,OAAO,MAAM;AAAA,UACb,IAAI,EAAE,gBAAgB,aAAa;AAAA,YACjC,MAAM;AAAA,UACR;AAAA,UACA,MAAM;AAAA;AAAA,QAER,OAAO,UAAU,SAAS;AAAA,SACzB,mBAAmB;AAAA,MACtB,IAAI,oBAAoC,OAAO,CAAC,KAAK,UAAU;AAAA,QAC7D,UAAU,IAAI,KAAK,KAAK;AAAA,QACxB,gBAAgB,OAAO,UAAU,IAAI,GAAG;AAAA,SACvC,mBAAmB;AAAA,MACtB,IAAI,cAA8B,OAAO,CAAC,OAAO,QAAQ;AAAA,QACvD,IAAI,MAAM,mBAAmB,KAAK;AAAA,QAClC,IAAI,KAAK;AAAA,UACP,OAAO;AAAA,QACT;AAAA,QACA,IAAI,MAAM,kBAAkB;AAAA,QAC5B,IAAI;AAAA,UACF,kBAAkB,KAAK,KAAK;AAAA,UAC5B,OAAO,MAAM;AAAA,UACb,IAAI,EAAE,gBAAgB,YAAY;AAAA,YAChC,MAAM;AAAA,UACR;AAAA,UACA,IAAI,UAAU,wBAAwB,OAAO,GAAG;AAAA,UAChD,kBAAkB,KAAK,OAAO;AAAA;AAAA,QAEhC,oBAAoB,IAAI,OAAO,GAAG;AAAA,QAClC,OAAO;AAAA,SACN,aAAa;AAAA,MAChB,IAAI,YAA4B,OAAO,CAAC,SAAS,YAAY;AAAA,QAC3D,SAAS,WAAW,SAAS;AAAA,UAC3B,IAAI,cAAc,OAAO,GAAG;AAAA,YAC1B;AAAA,UACF;AAAA,UACA,IAAI,QAAQ,QAAQ;AAAA,UACpB,IAAI,aAAa,IAAI,YAAY,OAAO;AAAA,YACtC,OAAS;AAAA,YACT,SAAW;AAAA,UACb,CAAC;AAAA,UACD,IAAI,WAAW,IAAI,SAAS,SAAS,GAAG;AAAA,YACtC,IAAI,OAAO,SAAS,YAAY;AAAA,cAC9B,IAAI,SAAS,QAAQ,YAAY,KAAK;AAAA,YACxC,EAAO,SAAI,OAAO,SAAS,UAAU;AAAA,cACnC,IAAI,SAAS,QAAQ;AAAA,YACvB,EAAO;AAAA,cACL,IAAI,8BAA8B,aAAa,OAAO,OAAO;AAAA;AAAA,UAEjE;AAAA,QACF;AAAA,SACC,WAAW;AAAA,MACd,IAAI,kBAAkC,OAAO,CAAC,SAAS,aAAa,YAAY;AAAA,QAC9E,IAAI,YAAY,CAAC;AAAA,QACjB,SAAS,KAAK,SAAS;AAAA,UACrB,IAAI,QAAQ,QAAQ;AAAA,UACpB,IAAI,OAAO,SAAS,UAAU;AAAA,YAC5B,QAAQ,MAAM;AAAA,UAChB;AAAA,UACA,IAAI,OAAO,SAAS,UAAU;AAAA,YAC5B,SAAS;AAAA,UACX;AAAA,UACA,UAAU,KAAK;AAAA,QACjB;AAAA,QACA,UAAU,WAAW,OAAO;AAAA,QAC5B,OAAO;AAAA,SACN,iBAAiB;AAAA,MACpB,IAAI,kBAAkC,OAAO,CAAC,YAAY;AAAA,QACxD,IAAI,WAAW,YAAY;AAAA,QAC3B,IAAI,CAAC,YAAY,SAAS,MAAM;AAAA,UAC9B,OAAO;AAAA,QACT;AAAA,QACA,OAAO;AAAA,SACN,iBAAiB;AAAA,MACpB,IAAI,UAA0B,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,MAAM;AAAA,QAC7D,IAAI,MAAM,kBAAkB,GAAG,EAAE,GAAG,KAAK;AAAA,QACzC,OAAO;AAAA,SACN,SAAS;AAAA,MACZ,IAAI,YAA4B,OAAO,MAAM,8BAA8B,GAAG,WAAW;AAAA,MACzF,IAAI,eAA+B,OAAO,CAAC,QAAQ,2BAA2B,GAAG,GAAG,cAAc;AAAA,MAClG,IAAI,uBAAuC,OAAO,CAAC,QAAQ,CAAC,QAAQ,UAAU;AAAA,QAC5E,IAAI,KAAK,UAAU;AAAA,QACnB,IAAI;AAAA,UACF,OAAO,QAAQ,KAAK,KAAK,KAAK;AAAA,UAC9B,OAAO,GAAG;AAAA,UACV,aAAa,EAAE;AAAA,UACf,IAAI,MAAM,IAAI;AAAA,YAAG,MAAM;AAAA,UACvB,UAAU,GAAG,CAAC;AAAA,UACd,IAAI,IAAI,MAAM;AAAA,YAAK,OAAO;AAAA;AAAA,SAE3B,sBAAsB;AAAA,MACzB,IAAI,sBAAsC,OAAO,CAAC,SAAS,SAAS,UAAU;AAAA,QAC5E,IAAI;AAAA,QACJ,IAAI,gBAAgB,OAAO,GAAG;AAAA,UAC5B,MAAM,YAAY;AAAA,QACpB,EAAO,SAAI,QAAQ,WAAW,SAAS,GAAG;AAAA,UACxC,MAAM,YAAY,WAAW,qBAAqB,QAAQ,MAAM,GAAG,EAAE,EAAE;AAAA,QACzE;AAAA,QACA,OAAO;AAAA,UACL;AAAA,UACA,MAAM;AAAA,QACR;AAAA,SACC,qBAAqB;AAAA,MACxB,IAAI,cAAc,CAAC;AAAA,MACnB,IAAI,gBAAgC,OAAO,CAAC,OAAO,YAAY,QAAQ,EAAE,GAAG,eAAe;AAAA,MAC3F,IAAI,eAA+B,OAAO,CAAC,KAAK,mBAAmB,MAAM,kBAAkB,QAAQ,KAAK,cAAc,IAAI,IAAI,cAAc;AAAA,MAC5I,IAAI,wBAAwC,OAAO,CAAC,QAAQ,OAAO,SAAS,YAAY,WAAW;AAAA,QACjG,IAAI,WAAW,kBAAkB,MAAM;AAAA,QACvC,2BAA2B,SAAS;AAAA,QACpC,SAAS,UAAU,GAAG;AAAA,UACpB,IAAI,WAAW,KAAK,IAAI,GAAG,SAAS,WAAW;AAAA,UAC/C,IAAI,aAAa,SAAS,aAAa,YAAY,UAAU,SAAS,aAAa,QAAQ,GAAG,QAAQ,IAAI;AAAA,UAC1G,IAAI,YAAY,SAAS,YAAY,UAAU,SAAS;AAAA,UACxD,IAAI,QAAQ;AAAA,YACV,MAAM,SAAS,KAAK;AAAA,YACpB,mBAAmB,SAAS,MAAM,KAAK,GAAG,UAAU;AAAA,YACpD,mBAAmB,SAAS,MAAM,KAAK,GAAG,SAAS,UAAU;AAAA,YAC7D,mBAAmB,SAAS,MAAM,KAAK,GAAG,SAAS;AAAA,YACnD,mBAAmB,SAAS,MAAM,KAAK,GAAG,SAAS,SAAS;AAAA,UAC9D;AAAA,UACA,IAAI,SAAS,WAAW;AAAA,YACtB,UAAU,KAAK,SAAS,SAAS;AAAA,UACnC;AAAA,UACA,IAAI;AAAA,UACJ,SAAS,aAAa,CAAC,KAAK;AAAA,YAC1B,IAAI,WAAW,oBAAoB,GAAG,EAAE;AAAA,YACxC,IAAI,CAAC,YAAY,YAAY;AAAA,cAC3B,WAAW,WAAW;AAAA,YACxB;AAAA,YACA,IAAI,CAAC,UAAU;AAAA,cACb,WAAW,cAAc;AAAA,YAC3B;AAAA,YACA,OAAO;AAAA;AAAA,UAET,OAAO,eAAe,eAAe;AAAA,UACrC,IAAI,eAAe;AAAA,YACjB,GAAG,CAAC,OAAO,MAAM;AAAA,cACf,QAAQ;AAAA,qBACD;AAAA,kBACH,OAAO;AAAA,qBACJ;AAAA,kBACH,OAAO;AAAA;AAAA,cAEX,IAAI,QAAQ,eAAe,CAAC,YAAY,MAAM,MAAM;AAAA,gBAClD,IAAI,MAAM,YAAY;AAAA,gBACtB,OAAO;AAAA,cACT;AAAA,cACA,IAAI,EAAE,QAAQ,QAAQ;AAAA,gBACpB,IAAI;AAAA,gBACJ,MAAM,QAAQ,IAAI,UAAU;AAAA,kBAC1B,aAAa,cAAc,IAAI;AAAA,kBAC/B,OAAO,SAAS,GAAG,KAAK;AAAA;AAAA,cAE5B;AAAA,cACA,OAAO,MAAM;AAAA;AAAA,UAEjB;AAAA,UACA,IAAI,QAAQ,IAAI,MAAM,CAAC,GAAG,YAAY;AAAA,UACtC,IAAI,OAAO;AAAA,YACT,WAAW,IAAI,MAAM,CAAC,GAAG,UAAU;AAAA,YACnC,YAAY,IAAI,MAAM,CAAC,GAAG,UAAU;AAAA,YACpC,KAAO;AAAA,YACP,wBAA0B;AAAA,UAC5B;AAAA,UACA,SAAS,iBAAiB,CAAC,QAAQ,UAAU;AAAA,YAC3C,eAAe,WAAW,SAAS,SAAS;AAAA,YAC5C,gBAAgB,gBAAgB,SAAS,SAAS,UAAU;AAAA,YAC5D,IAAI,CAAC,MAAM,gBAAgB;AAAA,cACzB,uBAAuB;AAAA,YACzB;AAAA,YACA,SAAS,QAAQ,CAAC,MAAM,MAAM;AAAA,cAC5B,IAAI,OAAO,CAAC;AAAA,cACZ,IAAI,QAAQ;AAAA,cACZ,MAAO,QAAQ,IAAI,SAAS;AAAA,gBAC1B,IAAI,KAAK,QAAQ,MAAM,KAAK,KAAK,IAAI;AAAA,kBACnC,KAAK,KAAK,MAAM,KAAK;AAAA,gBACvB,EAAO;AAAA,kBACL;AAAA;AAAA,cAEJ;AAAA,cACA,OAAO,KAAK,KAAK,GAAG;AAAA,cACpB,IAAI,OAAO,IAAI,cAAc;AAAA,cAC7B,WAAW,SAAS,KAAK,IAAI;AAAA;AAAA,YAE/B,OAAO,UAAU,UAAU;AAAA,YAC3B,IAAI,oBAAoB,eAAe;AAAA,cACrC,IAAI,QAAQ,cAAc;AAAA,cAC1B,IAAI,OAAO,cAAc;AAAA,cACzB,OAAO,QAAQ,MAAM;AAAA,gBACnB,IAAI,WAAW,aAAa,KAAK;AAAA,gBACjC,SAAS,OAAO,QAAQ;AAAA,gBACxB,QAAQ,OAAO,QAAQ,GAAG,KAAK,IAAI;AAAA,cACrC;AAAA,YACF;AAAA,YACA,SAAS,OAAO,CAAC,MAAM,MAAM,MAAM;AAAA,cACjC,IAAI,SAAS,CAAC;AAAA,cACd,OAAO,KAAK,MAAM,GAAG,EAAE;AAAA,cACvB,IAAI,QAAQ,QAAQ;AAAA,gBAClB,OAAO,KAAK,MAAM,GAAG;AAAA,gBACrB,SAAS,KAAK,MAAM;AAAA,kBAClB,IAAI,QAAQ,KAAK,GAAG,MAAM,GAAG,EAAE,IAAI;AAAA,kBACnC,OAAO,KAAK,MAAM,QAAQ,KAAK,EAAE,CAAC;AAAA,gBACpC;AAAA,cACF;AAAA,cACA,IAAI,OAAO,IAAI,cAAc;AAAA,cAC7B,cAAc,QAAQ,KAAK,IAAI;AAAA;AAAA,YAEjC,OAAO,SAAS,SAAS;AAAA,YACzB,SAAS,QAAQ,eAAe;AAAA,cAC9B,IAAI,KAAK,WAAW,WAAW,GAAG;AAAA,gBAChC,IAAI,QAAQ,cAAc;AAAA,gBAC1B,IAAI,WAAW,aAAa,KAAK;AAAA,gBACjC,IAAI,QAAQ,SAAS,MAAM,MAAM;AAAA,gBACjC,QAAQ,KAAK,QAAQ,aAAa,EAAE,GAAG,MAAM,IAAI,MAAM,EAAE;AAAA,gBACzD,OAAO,cAAc;AAAA,cACvB;AAAA,YACF;AAAA,YACA,IAAI,cAAc,cAAc;AAAA,YAChC,IAAI,aAAa;AAAA,cACf,IAAI,oBAAoB;AAAA,gBACtB,YAAY;AAAA,cACd,EAAO;AAAA,gBACL,gBAAgB,KAAK,WAAW;AAAA;AAAA,YAEpC;AAAA,YACA,IAAI,OAAO,cAAc;AAAA,YACzB,IAAI,MAAM;AAAA,cACR,IAAI,oBAAoB;AAAA,gBACtB,KAAK;AAAA,cACP,EAAO;AAAA,gBACL,cAAc,IAAI;AAAA;AAAA,YAEtB;AAAA,YACA,OAAO;AAAA;AAAA,UAET,OAAO,mBAAmB,mBAAmB;AAAA,UAC7C,IAAI,MAAM,WAAW;AAAA,YACnB,IAAI,kBAAkB,YAAY,QAAQ;AAAA,cACxC,IAAI,WAAW,IAAI,YAAY,SAAS,QAAQ,IAAI;AAAA,cACpD,OAAO,QAAQ,QAAQ,kBAAkB,QAAQ,QAAQ,CAAC;AAAA,YAC5D;AAAA,YACA,OAAO,YAAY,YAAY,QAAQ,IAAI,EAAE,KAAK,CAAC,WAAW,kBAAkB,OAAO,QAAQ,OAAO,QAAQ,CAAC;AAAA,UACjH;AAAA,UACA,IAAI,SAAS,kBAAkB,YAAY,SAAS,SAAS,IAAI,YAAY,OAAO,MAAM;AAAA,UAC1F,IAAI,WAAW,IAAI,YAAY,SAAS,QAAQ,IAAI;AAAA,UACpD,OAAO,kBAAkB,QAAQ,QAAQ;AAAA;AAAA,QAE3C,OAAO,YAAY,YAAY;AAAA,QAC/B,IAAI,MAAM,WAAW;AAAA,UACnB,OAAO,SAAS,cAAc,OAAO,CAAC,OAAO,cAAc,MAAM,KAAK,MAAM,mBAAmB,WAAW,OAAO,UAAU,CAAC,GAAG,QAAQ,QAAQ,CAAC,EAAE,KAAK,UAAU;AAAA,QACnK;AAAA,QACA,SAAS,cAAc,QAAQ,CAAC,WAAW,mBAAmB,QAAQ,OAAO,UAAU,CAAC;AAAA,QACxF,OAAO,WAAW;AAAA,SACjB,uBAAuB;AAAA,MAC1B,IAAI,kBAAkC,OAAO,CAAC,SAAS,aAAa;AAAA,QAClE,UAAU,KAAK,QAAQ,OAAO,QAAQ,OAAO,GAAG;AAAA,UAC9C,MAAM,YAA4B,OAAO,CAAC,WAAW;AAAA,YACnD,IAAI,CAAC,gBAAgB,MAAM,GAAG;AAAA,cAC5B,YAAY,UAAU;AAAA,YACxB;AAAA,aACC,WAAW;AAAA,UACd,UAAU,GAAG;AAAA,UACb,MAAM,aAAa;AAAA,UACnB,IAAI,OAAO,QAAQ;AAAA,YACjB,UAAU,UAAU;AAAA,UACtB;AAAA,UACA,IAAI,OAAO,YAAY;AAAA,YACrB,UAAU,MAAM;AAAA,UAClB;AAAA,QACF;AAAA,SACC,iBAAiB;AAAA,MACpB,IAAI,YAA4B,OAAO,OAAO,QAAQ;AAAA,QACpD,IAAI,cAAc,MAAM,UAAU,GAAG;AAAA,QACrC,OAAO,IAAI,WAAW,WAAW;AAAA,SAChC,WAAW;AAAA,MACd,SAAS,kBAAkB,CAAC,UAAU,SAAS;AAAA,QAC7C,QAAQ;AAAA,QACR,UAAU;AAAA,MACZ,GAAG,aAAa,SAAS;AAAA,QACvB,IAAI,MAAM,KAAK,iBAAiB;AAAA,QAChC,IAAI,KAAK;AAAA,UACP,IAAI,CAAC,OAAO,QAAQ;AAAA,YAClB,IAAI,aAAa;AAAA,cACf,OAAO,OAAO,aAAa,IAAI,OAAO;AAAA,YACxC;AAAA,UACF,EAAO,SAAI,CAAC,IAAI,QAAQ;AAAA,YACtB,IAAI,SAAS;AAAA,YACb,gBAAgB,IAAI,SAAS,QAAQ;AAAA,UACvC;AAAA,UACA,IAAI,OAAO,YAAY,IAAI,aAAa,UAAU;AAAA,YAChD,IAAI,WAAW;AAAA,UACjB;AAAA,UACA,IAAI;AAAA,UACJ,IAAI,SAAS;AAAA,YACX,KAAK,mBAAmB,WAAW;AAAA,UACrC;AAAA,UACA,OAAO,OAAO,YAAY,QAAQ,QAAQ,IAAI,IAAI;AAAA,QACpD;AAAA,QACA,MAAM,OAAO,UAAU,SAAS,SAAS;AAAA,QACzC,IAAI,WAAW,OAAO,WAAW,WAAW;AAAA,QAC5C,IAAI,SAAS,OAAO;AAAA,QACpB,SAAS,WAAW,GAAG;AAAA,UACrB,IAAI,SAAS;AAAA,YACX,IAAI,OAAO,kBAAkB,UAAU,MAAM,KAAK,CAAC;AAAA,YACnD,IAAI,WAAW,kBAAkB,UAAU,MAAM,KAAK,CAAC;AAAA,YACvD,IAAI,QAAQ,UAAU;AAAA,cACpB,IAAI,UAAU,MAAM,MAAM,MAAM,OAAO,QAAQ;AAAA,cAC/C,OAAO,OAAO,YAAY,QAAQ,QAAQ,OAAO,IAAI;AAAA,YACvD;AAAA,UACF;AAAA,UACA,IAAI,UAAU,WAAW,QAAQ;AAAA,UACjC,IAAI,OAAO,WAAW;AAAA,YACpB,OAAO,UAAU,OAAO;AAAA,UAC1B;AAAA,UACA,IAAI,CAAC,YAAY;AAAA,YACf,MAAM,IAAI,MAAM,GAAG,qFAAqF;AAAA,UAC1G;AAAA,UACA,OAAO,WAAW,OAAO;AAAA;AAAA,QAE3B,OAAO,aAAa,aAAa;AAAA,QACjC,SAAS,UAAU,GAAG;AAAA,UACpB,IAAI,OAAO,WAAW;AAAA,YACpB,OAAO,YAAY,EAAE,KAAK,CAAC,YAAY,sBAAsB,SAAS,QAAQ,UAAU,aAAa,OAAO,CAAC;AAAA,UAC/G;AAAA,UACA,OAAO,sBAAsB,YAAY,GAAG,QAAQ,UAAU,aAAa,OAAO;AAAA;AAAA,QAEpF,OAAO,YAAY,YAAY;AAAA,QAC/B,SAAS,YAAY,CAAC,SAAS;AAAA,UAC7B,IAAI,IAAI,QAAQ;AAAA,YACd,gBAAgB,SAAS,QAAQ;AAAA,UACnC,EAAO,SAAI,aAAa;AAAA,YACtB,OAAO,OAAO,aAAa,OAAO;AAAA,UACpC;AAAA,UACA,IAAI,UAAU;AAAA;AAAA,QAEhB,OAAO,cAAc,cAAc;AAAA,QACnC,IAAI,OAAO,WAAW;AAAA,UACpB,OAAO,WAAW,EAAE,KAAK,CAAC,YAAY;AAAA,YACpC,aAAa,OAAO;AAAA,YACpB,OAAO;AAAA,WACR;AAAA,QACH;AAAA,QACA,aAAa,WAAW,CAAC;AAAA,QACzB,OAAO;AAAA;AAAA,MAET,OAAO,oBAAoB,oBAAoB;AAAA,MAC/C,IAAI,yBAAyC,OAAO,MAAM;AAAA,QACxD,UAAU,SAAS,UAAU,OAAO,QAAQ,GAAG,GAAG;AAAA,UAChD,IAAI,MAAM,SAAS,GAAG;AAAA,YACpB,IAAI,QAAQ,oBAAoB,SAAS,IAAI,EAAE;AAAA,YAC/C,IAAI,CAAC,SAAS,CAAC,MAAM,UAAU;AAAA,cAC7B;AAAA,YACF;AAAA,YACA,IAAI,OAAO,SAAS,YAAY;AAAA,cAC9B,MAAM,QAAQ,YAAY,OAAO,MAAM,GAAG;AAAA,YAC5C,EAAO,SAAI,OAAO,SAAS,UAAU;AAAA,cACnC,MAAM,QAAQ;AAAA,YAChB,EAAO;AAAA,cACL,MAAM,IAAI,MAAM,wBAAwB,aAAa,OAAO,OAAO;AAAA;AAAA,UAEvE;AAAA,QACF;AAAA,SACC,wBAAwB;AAAA,MAC3B,IAAI,aAA6B,OAAO,MAAM;AAAA,QAC5C,IAAI,CAAC,iBAAiB,QAAQ;AAAA,UAC5B,uBAAuB;AAAA,UACvB;AAAA,QACF;AAAA,QACA,iBAAiB,YAAY;AAAA,QAC7B,iBAAiB,OAAO,CAAC,OAAO,QAAQ,MAAM,KAAK,MAAM,mBAAmB,KAAK;AAAA,UAC/E,WAAW;AAAA,UACX,QAAQ;AAAA,UACR,UAAU;AAAA,UACV,gBAAgB;AAAA,QAClB,CAAC,CAAC,GAAG,QAAQ,QAAQ,CAAC,EAAE,KAAK,MAAM;AAAA,UACjC,uBAAuB;AAAA,UACvB,oBAAoB,YAAY;AAAA,SACjC;AAAA,SACA,YAAY;AAAA,MACf,IAAI,gBAAgB,OAAO,oBAAoB;AAAA,MAC/C,SAAS,QAAQ,CAAC,KAAK,OAAO,OAAO,MAAM;AAAA,QACzC,IAAI,KAAK,SAAS,GAAG;AAAA,UAAG,OAAO;AAAA,QAC/B,QAAQ;AAAA,eACD;AAAA,YACH,MAAM,OAAO;AAAA,YACb;AAAA,eACG;AAAA,YACH,MAAM,OAAO;AAAA,YACb;AAAA,eACG;AAAA,YACH,mBAAmB,OAAO,KAAK,GAAG,KAAK;AAAA,YACvC;AAAA,eACG;AAAA,YACH,mBAAmB,OAAO,KAAK,GAAG,KAAK;AAAA,YACvC;AAAA,eACG;AAAA,YACH,OAAO,OAAO,KAAK,OAAO,KAAK;AAAA,YAC/B;AAAA,eACG;AAAA,YACH,mBAAmB,OAAO,KAAK,GAAG,KAAK;AAAA,YACvC;AAAA,eACG;AAAA,YACH,mBAAmB,OAAO,KAAK,GAAG,KAAK;AAAA,YACvC;AAAA,eACG;AAAA,YACH,mBAAmB,OAAO,KAAK,GAAG,KAAK;AAAA,YACvC;AAAA;AAAA,YAEA,MAAM,8BAA8B,MAAM;AAAA;AAAA;AAAA,MAGhD,OAAO,UAAU,UAAU;AAAA,MAC3B,IAAI,iBAAiB,IAAI,YAAY,OAAO;AAAA,QAC1C,OAAS;AAAA,QACT,SAAW;AAAA,MACb,GAAG,IAAI;AAAA,MACP,IAAI,mBAAmB,IAAI,YAAY,OAAO;AAAA,QAC5C,OAAS;AAAA,QACT,SAAW;AAAA,MACb,GAAG,KAAK;AAAA,MACR,IAAI,gBAAgB,IAAI,YAAY,OAAO;AAAA,QACzC,OAAS;AAAA,QACT,SAAW;AAAA,MACb,GAAG,CAAC;AAAA,MACJ,IAAI,aAA6B,OAAO,MAAM,MAAM,EAAE,GAAG,YAAY;AAAA,MACrE,WAAW,MAAM;AAAA,MACjB,IAAI,sBAAsC,OAAO,MAAM,YAAY,IAAI,GAAG,qBAAqB;AAAA,MAC/F,oBAAoB,MAAM;AAAA,MAC1B,IAAI,uBAAuC,OAAO,MAAM,KAAK,IAAI,GAAG,sBAAsB;AAAA,MAC1F,qBAAqB,MAAM;AAAA,MAC3B,IAAI,iBAAiB;AAAA,MACrB,IAAI,iBAAiC,OAAO,CAAC,aAAa,YAAY,KAAK,YAAY,GAAG,gBAAgB;AAAA,MAC1G,IAAI,YAAY;AAAA,MAChB,IAAI,YAAY;AAAA,MAChB,IAAI,qBAAqC,OAAO,CAAC,QAAQ,MAAM,aAAa,MAAM,YAAY,MAAM,OAAO,GAAG,GAAG,oBAAoB;AAAA,MACrI,SAAS,eAAe,CAAC,QAAQ,mBAAmB,OAAO;AAAA,QACzD,oBAAoB,mBAAmB,iBAAiB;AAAA,QACxD,IAAI,CAAC,eAAe,MAAM,GAAG;AAAA,UAC3B,OAAO;AAAA,QACT;AAAA,QACA,IAAI;AAAA,QACJ,IAAI,WAAW,GAAG;AAAA,UAChB,MAAM,qBAAqB;AAAA,QAC7B,EAAO,SAAI,gBAAgB;AAAA,UACzB,MAAM,oBAAoB;AAAA,QAC5B,EAAO;AAAA,UACL,OAAO;AAAA;AAAA,QAET,IAAI,OAAO,KAAK,MAAM,MAAM,OAAM,IAAG;AAAA,QACrC,OAAO,SAAS,KAAK,OAAO,IAAI;AAAA,QAChC,OAAO;AAAA;AAAA,MAET,OAAO,iBAAiB,iBAAiB;AAAA,MACzC,gBAAgB,MAAM;AAAA,MACtB,IAAI,aAA6B,OAAO,MAKtC,YACC,YAAY;AAAA,MACf,IAAI,aAA6B,OAAO,CAAC,SAAS;AAAA,QAChD,IAAI,IAAI,WAAW;AAAA,QACnB,IAAI,SAAS,OAAO,EAAE,aAAa,SAAS,QAAQ;AAAA,QACpD,IAAI;AAAA,UACF,WAAW,KAAK,KAAK;AAAA,UACrB,kBAAkB;AAAA,UAClB,OAAO;AAAA,UACP,OAAO,GAAG;AAAA,SAEX,YAAY;AAAA,MACf,IAAI,0BAA0C,OAAO,CAAC,kBAAkB;AAAA,QACtE,IAAI,UAAU,OAAO;AAAA,QACrB,mBAAmB;AAAA,QACnB,IAAI,cAAc,WAAW;AAAA,QAC7B,IAAI,gBAAgB,aAAa;AAAA,UAC/B,OAAO;AAAA,QACT;AAAA,QACA,SAAS,UAAU,EAAG,WAAW,GAAG,WAAW,GAAG;AAAA,UAChD,IAAI,oBAAoB,WAAW,IAAI,MAAM;AAAA,UAC7C,oBAAoB,KAAK,IAAI,mBAAmB,gBAAgB,SAAS;AAAA,UACzE,IAAI,UAAU,KAAK,IAAI,aAAa,YAAY,KAAK,IAAI,eAAe,iBAAiB,GAAG,KAAK,CAAC;AAAA,UAClG,IAAI,cAAc,WAAW,OAAO;AAAA,UACpC,IAAI,aAAa;AAAA,YACf,OAAO;AAAA,UACT;AAAA,QACF;AAAA,QACA,OAAO;AAAA,SACN,yBAAyB;AAAA,MAC5B,wBAAwB,MAAM;AAAA,MAC9B,IAAI,YAA4B,OAAO,CAAC,OAAO,IAAI,WAAW;AAAA,MAC9D,UAAU,MAAM;AAAA,MAChB,SAAS,QAAQ,CAAC,IAAI,QAAQ,QAAQ,WAAW;AAAA,QAC/C,SAAS,mBAAmB,MAAM;AAAA,QAClC,OAAO;AAAA;AAAA,MAET,OAAO,UAAU,UAAU;AAAA,MAC3B,SAAS,MAAM;AAAA,MACf,IAAI,mBAAmB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAAA,MACpC,IAAI,YAA4B,OAAO,CAAC,QAAQ,SAAS;AAAA,QACvD,IAAI,SAAS,iBAAiB;AAAA,QAC9B,IAAI,SAAS,KAAK,SAAS,IAAI;AAAA,WAC5B,WAAW,IAAI,MAAM,KAAK,kBAAkB,MAAM,CAAC;AAAA,UACpD,OAAO,SAAS;AAAA,QAClB,EAAO;AAAA,UACL,OAAO,KAAK,IAAI;AAAA;AAAA,SAEjB,WAAW;AAAA,MACd,IAAI,sBAAsC,OAAO,MAAM;AAAA,QACrD,IAAI,iBAAiB,GAAG;AAAA,UAAQ,UAAU,GAAG,EAAE;AAAA,QAC/C,IAAI,iBAAiB,GAAG;AAAA,UAAQ,UAAU,GAAG,EAAE;AAAA,SAC9C,qBAAqB;AAAA,MACxB,IAAI,WAAW;AAAA,QACb,SAAc;AAAA,QACd,MAAM,CAAC,KAAK;AAAA,UACV,IAAI,MAAM,aAAa,GAAG;AAAA,UAC1B,OAAO;AAAA;AAAA,MAEX;AAAA,MACA,IAAI,YAA4B,OAAO,CAAC,IAAI,KAAK,QAAQ,SAAS;AAAA,QAChE,IAAI,MAAM;AAAA,QACV,SAAS,KAAK,EAAG,KAAK,QAAQ,MAAM;AAAA,UAClC,IAAI,MAAM,kBAAkB,OAAO,KAAK,CAAC;AAAA,UACzC,IAAI,MAAM,kBAAkB,MAAM,KAAK,KAAK,CAAC;AAAA,UAC7C,OAAO;AAAA,UACP,SAAS,IAAI,EAAG,IAAI,KAAK,KAAK;AAAA,YAC5B,UAAU,IAAI,OAAO,MAAM,EAAE;AAAA,UAC/B;AAAA,UACA,OAAO;AAAA,QACT;AAAA,QACA,mBAAmB,QAAQ,KAAK,GAAG,GAAG;AAAA,QACtC,OAAO;AAAA,SACN,WAAW;AAAA,MACd,UAAU,MAAM;AAAA,MAChB,SAAS,yBAAyB,CAAC,cAAc,gBAAgB;AAAA,QAC/D,IAAI,OAAO,oBAAoB;AAAA,UAC7B,MAAM,UAAU,aAAa,cAAc;AAAA,UAC3C,OAAO,mBAAmB,SAAS,iBAAiB,CAAC;AAAA,QACvD;AAAA;AAAA,MAEF,OAAO,2BAA2B,2BAA2B;AAAA,MAC7D,SAAS,2BAA2B,CAAC,oBAAoB,OAAO,KAAK,QAAQ,eAAe;AAAA,QAC1F,MAAM,oBAAoB;AAAA,QAC1B,MAAM,SAAS,OAAO,qBAAqB,OAAO;AAAA,UAChD;AAAA,UACA;AAAA,QACF,CAAC;AAAA,QACD,IAAI,OAAO,WAAW,UAAU;AAAA,UAC9B,SAAS,eAAe,OAAO,QAAQ,KAAK;AAAA,UAC5C,cAAc,QAAQ,oBAAoB,iBAAiB;AAAA,QAC7D,EAAO;AAAA,UACL,SAAS,eAAe,GAAG,KAAK;AAAA;AAAA;AAAA,MAGpC,OAAO,6BAA6B,6BAA6B;AAAA,MACjE,SAAS,8BAA8B,CAAC,eAAe,UAAU;AAAA,QAC/D,IAAI,OAAO,yBAAyB;AAAA,UAClC,OAAO,OAAO,wBAAwB;AAAA,YACpC;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA,OAAO;AAAA;AAAA,MAET,OAAO,gCAAgC,gCAAgC;AAAA,MACvE,SAAS,oCAAoC,CAAC,eAAe;AAAA,QAC3D,IAAI,OAAO,8BAA8B;AAAA,UACvC,OAAO,OAAO,6BAA6B;AAAA,YACzC;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA,OAAO;AAAA;AAAA,MAET,OAAO,sCAAsC,sCAAsC;AAAA,MACnF,IAAI,0BAA0B;AAAA,MAC9B,IAAI,mBAAmC,OAAO,MAAM,iBAAiB,0BAA0B,GAAG,kBAAkB;AAAA,MACpH,IAAI,aAA6B,OAAO,CAAC,SAAS;AAAA,QAChD,aAAa;AAAA,QACb,IAAI,CAAC,iBAAiB,GAAG;AAAA,UACvB,OAAO,YAAY,IAAI;AAAA,UACvB,QAAQ;AAAA,QACV;AAAA,QACA,MAAM,MAAM,IAAI,WAAW,IAAI,CAAC;AAAA,SAC/B,YAAY;AAAA,MACf,WAAW,MAAM;AAAA,MACjB,IAAI,SAAyB,OAAO,CAAC,QAAQ,aAAa;AAAA,QACxD,aAAa;AAAA,QACb,WAAW,MAAM;AAAA,SAChB,QAAQ;AAAA,MACX,IAAI,kBAAkC,OAAO,CAAC,MAAM;AAAA,QAClD,IAAI,aAAa,cAAc,KAAK,UAAU;AAAA,UAC5C,OAAO;AAAA,QACT;AAAA,QACA,MAAM,GAAG,CAAC;AAAA,SACT,iBAAiB;AAAA,MACpB,IAAI,kBAAkC,OAAO,CAAC,QAAQ;AAAA,QACpD,IAAI,MAAM;AAAA,QACV,SAAS,KAAK,EAAG,KAAK,IAAI,QAAQ,EAAE,IAAI;AAAA,UACtC,IAAI,IAAI,IAAI,WAAW,EAAE;AAAA,UACzB,IAAI,KAAK,KAAK;AAAA,YACZ;AAAA,UACF,EAAO,SAAI,KAAK,MAAM;AAAA,YACpB,OAAO;AAAA,UACT,EAAO,SAAI,KAAK,SAAS,KAAK,OAAO;AAAA,YACnC,OAAO;AAAA,YACP,EAAE;AAAA,UACJ,EAAO;AAAA,YACL,OAAO;AAAA;AAAA,QAEX;AAAA,QACA,OAAO;AAAA,SACN,iBAAiB;AAAA,MACpB,IAAI,oBAAoC,OAAO,CAAC,KAAK,MAAM,QAAQ,oBAAoB;AAAA,QACrF,IAAI,EAAE,kBAAkB;AAAA,UAAI,OAAO;AAAA,QACnC,IAAI,WAAW;AAAA,QACf,IAAI,SAAS,SAAS,kBAAkB;AAAA,QACxC,SAAS,KAAK,EAAG,KAAK,IAAI,QAAQ,EAAE,IAAI;AAAA,UACtC,IAAI,IAAI,IAAI,WAAW,EAAE;AAAA,UACzB,IAAI,KAAK,SAAS,KAAK,OAAO;AAAA,YAC5B,IAAI,KAAK,IAAI,WAAW,EAAE,EAAE;AAAA,YAC5B,IAAI,UAAU,IAAI,SAAS,MAAM,KAAK;AAAA,UACxC;AAAA,UACA,IAAI,KAAK,KAAK;AAAA,YACZ,IAAI,UAAU;AAAA,cAAQ;AAAA,YACtB,KAAK,YAAY;AAAA,UACnB,EAAO,SAAI,KAAK,MAAM;AAAA,YACpB,IAAI,SAAS,KAAK;AAAA,cAAQ;AAAA,YAC1B,KAAK,YAAY,MAAM,KAAK;AAAA,YAC5B,KAAK,YAAY,MAAM,IAAI;AAAA,UAC7B,EAAO,SAAI,KAAK,OAAO;AAAA,YACrB,IAAI,SAAS,KAAK;AAAA,cAAQ;AAAA,YAC1B,KAAK,YAAY,MAAM,KAAK;AAAA,YAC5B,KAAK,YAAY,MAAM,KAAK,IAAI;AAAA,YAChC,KAAK,YAAY,MAAM,IAAI;AAAA,UAC7B,EAAO;AAAA,YACL,IAAI,SAAS,KAAK;AAAA,cAAQ;AAAA,YAC1B,KAAK,YAAY,MAAM,KAAK;AAAA,YAC5B,KAAK,YAAY,MAAM,KAAK,KAAK;AAAA,YACjC,KAAK,YAAY,MAAM,KAAK,IAAI;AAAA,YAChC,KAAK,YAAY,MAAM,IAAI;AAAA;AAAA,QAE/B;AAAA,QACA,KAAK,UAAU;AAAA,QACf,OAAO,SAAS;AAAA,SACf,mBAAmB;AAAA,MACtB,IAAI,eAA+B,OAAO,CAAC,KAAK,QAAQ,oBAAoB,kBAAkB,KAAK,QAAQ,QAAQ,eAAe,GAAG,cAAc;AAAA,MACnJ,IAAI,aAA6B,OAAO,CAAC,OAAO,yBAAyB,EAAE,GAAG,YAAY;AAAA,MAC1F,IAAI,sBAAsC,OAAO,CAAC,QAAQ;AAAA,QACxD,IAAI,OAAO,gBAAgB,GAAG,IAAI;AAAA,QAClC,IAAI,MAAM,WAAW,IAAI;AAAA,QACzB,aAAa,KAAK,KAAK,IAAI;AAAA,QAC3B,OAAO;AAAA,SACN,qBAAqB;AAAA,MACxB,IAAI,gBAAgC,OAAO,CAAC,QAAQ;AAAA,QAClD,IAAI,MAAM;AAAA,QACV,OAAO,MAAG;AAAA,UACR,IAAI,KAAK,OAAO;AAAA,UAChB,IAAI,CAAC;AAAA,YAAI,OAAO;AAAA,UAChB,OAAO,OAAO,aAAa,EAAE;AAAA,QAC/B;AAAA,SACC,eAAe;AAAA,MAClB,IAAI,gBAAgC,OAAO,CAAC,KAAK,QAAQ,oBAAoB;AAAA,QAC3E,oBAAoB;AAAA,QACpB,IAAI,kBAAkB;AAAA,UAAG,OAAO;AAAA,QAChC,mBAAmB;AAAA,QACnB,IAAI,WAAW;AAAA,QACf,IAAI,kBAAkB,kBAAkB,IAAI,SAAS,IAAI,kBAAkB,IAAI,IAAI;AAAA,QACnF,SAAS,KAAK,EAAG,KAAK,iBAAiB,EAAE,IAAI;AAAA,UAC3C,IAAI,WAAW,IAAI,WAAW,EAAE;AAAA,UAChC,mBAAmB,UAAU,KAAK,GAAG,QAAQ;AAAA,UAC7C,UAAU;AAAA,QACZ;AAAA,QACA,mBAAmB,UAAU,KAAK,GAAG,CAAC;AAAA,QACtC,OAAO,SAAS;AAAA,SACf,eAAe;AAAA,MAClB,IAAI,cAAc;AAAA,QAEhB,aAAa;AAAA,QAEb,2BAA2B;AAAA,QAE3B,eAAe;AAAA,QAEf,iBAAiB;AAAA,QAEjB,cAAc;AAAA,QAEd,WAAW;AAAA,QAEX,gBAAgB;AAAA,QAEhB,wBAAwB;AAAA,QAExB,UAAU;AAAA,QAEV,SAAS;AAAA,QAET,UAAU;AAAA,QAEV,QAAQ;AAAA,QAER,0BAA0B;AAAA,QAE1B,4BAA4B;AAAA,QAE5B,+BAA+B;AAAA,QAE/B,qCAAqC;AAAA,MACvC;AAAA,MACA,IAAI,cAAc,MAAM,WAAW;AAAA,MACnC,IAAI,qBAAqB,YAAY;AAAA,MACrC,IAAI,UAAU,OAAO,aAAa,YAAY;AAAA,MAC9C,IAAI,UAAU,OAAO,aAAa,YAAY;AAAA,MAC9C,IAAI,WAAW,OAAO,cAAc,YAAY;AAAA,MAChD,IAAI,QAAQ,OAAO,WAAW,YAAY;AAAA,MAC1C,IAAI,UAAU,OAAO,aAAa,YAAY;AAAA,MAC9C,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,2BAA2B,OAAO,8BAA8B,YAAY;AAAA,MAChF,IAAI,uBAAuB,OAAO,0BAA0B,YAAY;AAAA,MACxE,IAAI,2BAA2B,OAAO,8BAA8B,YAAY;AAAA,MAChF,IAAI,wBAAwB,OAAO,2BAA2B,YAAY;AAAA,MAC1E,IAAI,oBAAoB,OAAO,uBAAuB,YAAY;AAAA,MAClE,IAAI,2BAA2B,OAAO,8BAA8B,YAAY;AAAA,MAChF,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,2BAA2B,OAAO,8BAA8B,YAAY;AAAA,MAChF,IAAI,+BAA+B,OAAO,kCAAkC,YAAY;AAAA,MACxF,IAAI,WAAW,OAAO,cAAc,YAAY;AAAA,MAChD,IAAI,2BAA2B,OAAO,8BAA8B,YAAY;AAAA,MAChF,IAAI,iCAAiC,OAAO,oCAAoC,YAAY;AAAA,MAC5F,IAAI,6BAA6B,OAAO,gCAAgC,YAAY;AAAA,MACpF,IAAI,gCAAgC,OAAO,mCAAmC,YAAY;AAAA,MAC1F,IAAI,qCAAqC,OAAO,wCAAwC,YAAY;AAAA,MACpG,IAAI,+BAA+B,OAAO,kCAAkC,YAAY;AAAA,MACxF,IAAI,8BAA8B,OAAO,iCAAiC,YAAY;AAAA,MACtF,IAAI,wCAAwC,OAAO,2CAA2C,YAAY;AAAA,MAC1G,IAAI,oBAAoB,OAAO,uBAAuB,YAAY;AAAA,MAClE,IAAI,mBAAmB,OAAO,sBAAsB,YAAY;AAAA,MAChE,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,gCAAgC,OAAO,mCAAmC,YAAY;AAAA,MAC1F,IAAI,iCAAiC,OAAO,oCAAoC,YAAY;AAAA,MAC5F,IAAI,gBAAgB,OAAO,mBAAmB,YAAY;AAAA,MAC1D,IAAI,mBAAmB,OAAO,sBAAsB,YAAY;AAAA,MAChE,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,yBAAyB,OAAO,4BAA4B,YAAY;AAAA,MAC5E,IAAI,gCAAgC,OAAO,mCAAmC,YAAY;AAAA,MAC1F,IAAI,sCAAsC,OAAO,yCAAyC,YAAY;AAAA,MACtG,IAAI,gCAAgC,OAAO,mCAAmC,YAAY;AAAA,MAC1F,IAAI,mCAAmC,OAAO,sCAAsC,YAAY;AAAA,MAChG,IAAI,mCAAmC,OAAO,sCAAsC,YAAY;AAAA,MAChG,IAAI,iCAAiC,OAAO,oCAAoC,YAAY;AAAA,MAC5F,IAAI,8BAA8B,OAAO,iCAAiC,YAAY;AAAA,MACtF,IAAI,iCAAiC,OAAO,oCAAoC,YAAY;AAAA,MAC5F,IAAI,0CAA0C,OAAO,6CAA6C,YAAY;AAAA,MAC9G,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,gBAAgB,OAAO,mBAAmB,YAAY;AAAA,MAC1D,IAAI,kBAAkB,OAAO,qBAAqB,YAAY;AAAA,MAC9D,IAAI,WAAW,OAAO,cAAc,YAAY;AAAA,MAChD,IAAI,sBAAsB,OAAO,yBAAyB,YAAY;AAAA,MACtE,IAAI,gCAAgC,OAAO,mCAAmC,YAAY;AAAA,MAC1F,IAAI,wBAAwB,OAAO,2BAA2B,YAAY;AAAA,MAC1E,IAAI,kCAAkC,OAAO,qCAAqC,YAAY;AAAA,MAC9F,IAAI,kCAAkC,OAAO,qCAAqC,YAAY;AAAA,MAC9F,IAAI,oCAAoC,OAAO,uCAAuC,YAAY;AAAA,MAClG,IAAI,+BAA+B,OAAO,kCAAkC,YAAY;AAAA,MACxF,IAAI,6BAA6B,OAAO,gCAAgC,YAAY;AAAA,MACpF,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,sCAAsC,OAAO,yCAAyC,YAAY;AAAA,MACtG,IAAI,qBAAqB,OAAO,wBAAwB,YAAY;AAAA,MACpE,IAAI,gCAAgC,OAAO,mCAAmC,YAAY;AAAA,MAC1F,IAAI,mCAAmC,OAAO,sCAAsC,YAAY;AAAA,MAChG,IAAI,2BAA2B,OAAO,8BAA8B,YAAY;AAAA,MAChF,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,8BAA8B,OAAO,iCAAiC,YAAY;AAAA,MACtF,IAAI,6BAA6B,OAAO,gCAAgC,YAAY;AAAA,MACpF,IAAI,gCAAgC,OAAO,mCAAmC,YAAY;AAAA,MAC1F,IAAI,wCAAwC,OAAO,2CAA2C,YAAY;AAAA,MAC1G,IAAI,uCAAuC,OAAO,0CAA0C,YAAY;AAAA,MACxG,IAAI,kDAAkD,OAAO,qDAAqD,YAAY;AAAA,MAC9H,IAAI,qDAAqD,OAAO,wDAAwD,YAAY;AAAA,MACpI,IAAI,yCAAyC,OAAO,4CAA4C,YAAY;AAAA,MAC5G,IAAI,6CAA6C,OAAO,gDAAgD,YAAY;AAAA,MACpH,IAAI,uCAAuC,OAAO,0CAA0C,YAAY;AAAA,MACxG,IAAI,mCAAmC,OAAO,sCAAsC,YAAY;AAAA,MAChG,IAAI,4CAA4C,OAAO,+CAA+C,YAAY;AAAA,MAClH,IAAI,6CAA6C,OAAO,gDAAgD,YAAY;AAAA,MACpH,IAAI,6CAA6C,OAAO,gDAAgD,YAAY;AAAA,MACpH,IAAI,+CAA+C,OAAO,kDAAkD,YAAY;AAAA,MACxH,IAAI,uCAAuC,OAAO,0CAA0C,YAAY;AAAA,MACxG,IAAI,sCAAsC,OAAO,yCAAyC,YAAY;AAAA,MACtG,IAAI,oCAAoC,OAAO,uCAAuC,YAAY;AAAA,MAClG,IAAI,mCAAmC,OAAO,sCAAsC,YAAY;AAAA,MAChG,IAAI,iCAAiC,OAAO,oCAAoC,YAAY;AAAA,MAC5F,IAAI,wCAAwC,OAAO,2CAA2C,YAAY;AAAA,MAC1G,IAAI,qCAAqC,OAAO,wCAAwC,YAAY;AAAA,MACpG,IAAI,gDAAgD,OAAO,mDAAmD,YAAY;AAAA,MAC1H,IAAI,oCAAoC,OAAO,uCAAuC,YAAY;AAAA,MAClG,IAAI,uBAAuB,OAAO,0BAA0B,YAAY;AAAA,MACxE,IAAI,qCAAqC,OAAO,wCAAwC,YAAY;AAAA,MACpG,IAAI,2CAA2C,OAAO,8CAA8C,YAAY;AAAA,MAChH,IAAI,qCAAqC,OAAO,wCAAwC,YAAY;AAAA,MACpG,IAAI,qCAAqC,OAAO,wCAAwC,YAAY;AAAA,MACpG,IAAI,2CAA2C,OAAO,8CAA8C,YAAY;AAAA,MAChH,IAAI,+BAA+B,OAAO,kCAAkC,YAAY;AAAA,MACxF,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,kCAAkC,OAAO,qCAAqC,YAAY;AAAA,MAC9F,IAAI,sBAAsB,OAAO,yBAAyB,YAAY;AAAA,MACtE,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,kCAAkC,OAAO,qCAAqC,YAAY;AAAA,MAC9F,IAAI,6BAA6B,OAAO,gCAAgC,YAAY;AAAA,MACpF,IAAI,6BAA6B,OAAO,gCAAgC,YAAY;AAAA,MACpF,IAAI,mCAAmC,OAAO,sCAAsC,YAAY;AAAA,MAChG,IAAI,mCAAmC,OAAO,sCAAsC,YAAY;AAAA,MAChG,IAAI,iCAAiC,OAAO,oCAAoC,YAAY;AAAA,MAC5F,IAAI,uBAAuB,OAAO,0BAA0B,YAAY;AAAA,MACxE,IAAI,sCAAsC,OAAO,yCAAyC,YAAY;AAAA,MACtG,IAAI,qCAAqC,OAAO,wCAAwC,YAAY;AAAA,MACpG,IAAI,2CAA2C,OAAO,8CAA8C,YAAY;AAAA,MAChH,IAAI,wCAAwC,OAAO,2CAA2C,YAAY;AAAA,MAC1G,IAAI,8CAA8C,OAAO,iDAAiD,YAAY;AAAA,MACtH,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,yBAAyB,OAAO,4BAA4B,YAAY;AAAA,MAC5E,IAAI,+BAA+B,OAAO,kCAAkC,YAAY;AAAA,MACxF,IAAI,oCAAoC,OAAO,uCAAuC,YAAY;AAAA,MAClG,IAAI,yBAAyB,OAAO,4BAA4B,YAAY;AAAA,MAC5E,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,yBAAyB,OAAO,4BAA4B,YAAY;AAAA,MAC5E,IAAI,2BAA2B,OAAO,8BAA8B,YAAY;AAAA,MAChF,IAAI,yBAAyB,OAAO,4BAA4B,YAAY;AAAA,MAC5E,IAAI,4BAA4B,OAAO,+BAA+B,YAAY;AAAA,MAClF,IAAI,iCAAiC,OAAO,oCAAoC,YAAY;AAAA,MAC5F,IAAI,yBAAyB,OAAO,4BAA4B,YAAY;AAAA,MAC5E,IAAI,0BAA0B,OAAO,6BAA6B,YAAY;AAAA,MAC9E,IAAI,UAAU,OAAO,aAAa,YAAY;AAAA,MAC9C,IAAI,UAAU,OAAO,aAAa,YAAY;AAAA,MAC9C,IAAI,WAAW,OAAO,cAAc,YAAY;AAAA,MAChD,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,aAAa,OAAO,gBAAgB,YAAY;AAAA,MACpD,IAAI,UAAU,OAAO,aAAa,YAAY;AAAA,MAC9C,IAAI,UAAU,OAAO,aAAa,YAAY;AAAA,MAC9C,IAAI,UAAU,OAAO,aAAa,YAAY;AAAA,MAC9C,IAAI,WAAW,OAAO,cAAc,YAAY;AAAA,MAChD,IAAI,WAAW,OAAO,cAAc,YAAY;AAAA,MAChD,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,YAAY,OAAO,eAAe,YAAY;AAAA,MAClD,IAAI,YAAY,YAAY;AAAA,MAC5B,IAAI,6BAA6B,YAAY;AAAA,MAC7C,IAAI,2BAA2B,YAAY;AAAA,MAC3C,IAAI,gCAAgC,YAAY;AAAA,MAChD,IAAI,4BAA4B,YAAY;AAAA,MAC5C,OAAO,cAAc;AAAA,MACrB,OAAO,cAAc;AAAA,MACrB,OAAO,kBAAkB;AAAA,MACzB,OAAO,kBAAkB;AAAA,MACzB,OAAO,qBAAqB;AAAA,MAC5B,OAAO,mBAAmB;AAAA,MAC1B,OAAO,mBAAmB;AAAA,MAC1B,OAAO,2BAA2B;AAAA,MAClC,SAAS,QAAQ,CAAC,QAAQ,CAAC,GAAG;AAAA,QAC5B,IAAI,gBAAgB,oBAAoB,MAAM,EAAE;AAAA,QAChD,IAAI,CAAC;AAAA,UAAe;AAAA,QACpB,MAAM,QAAQ,WAAW;AAAA,QACzB,IAAI,OAAO,MAAM;AAAA,QACjB,IAAI,OAAO,YAAY,OAAO,KAAK,CAAC;AAAA,QACpC,IAAI,WAAW;AAAA,QACf,MAAM,QAAQ,CAAC,QAAQ;AAAA,UACrB,mBAAmB,YAAY,KAAK,GAAG,oBAAoB,GAAG,CAAC;AAAA,UAC/D,YAAY;AAAA,SACb;AAAA,QACD,mBAAmB,YAAY,KAAK,GAAG,CAAC;AAAA,QACxC,IAAI;AAAA,UACF,IAAI,MAAM,cAAc,MAAM,IAAI;AAAA,UAClC,OACE,KAEA,IACF;AAAA,UACA,OAAO;AAAA,UACP,OAAO,GAAG;AAAA,UACV,OAAO,gBAAgB,CAAC;AAAA;AAAA;AAAA,MAG5B,OAAO,UAAU,UAAU;AAAA,MAC3B,SAAS,GAAG,CAAC,QAAQ,YAAY;AAAA,QAC/B,IAAI,kBAAkB,GAAG;AAAA,UACvB,wBAAwB;AAAA,UACxB;AAAA,QACF;AAAA,QACA,OAAO;AAAA,QACP,IAAI,kBAAkB,GAAG;AAAA,UACvB,wBAAwB;AAAA,UACxB;AAAA,QACF;AAAA,QACA,SAAS,KAAK,GAAG;AAAA,UACf,OAAO,eAAe;AAAA,UACtB,IAAI;AAAA,YAAO;AAAA,UACX,YAAY;AAAA,UACZ,QAAQ;AAAA,UACR,oBAAoB,MAAM;AAAA,UAC1B,OAAO,0BAA0B;AAAA,UACjC,IAAI,eAAe,OAAO;AAAA,UAC1B,IAAI,CAAC;AAAA,YAAc,SAAS,KAAK;AAAA,UACjC,QAAQ;AAAA;AAAA,QAEV,OAAO,OAAO,OAAO;AAAA,QACrB,IAAI,OAAO,cAAc;AAAA,UACvB,OAAO,aAAa,YAAY;AAAA,UAChC,WAAW,MAAM;AAAA,YACf,WAAW,MAAM,OAAO,aAAa,EAAE,GAAG,CAAC;AAAA,YAC3C,MAAM;AAAA,aACL,CAAC;AAAA,QACN,EAAO;AAAA,UACL,MAAM;AAAA;AAAA;AAAA,MAGV,OAAO,KAAK,KAAK;AAAA,MACjB,IAAI,OAAO,YAAY;AAAA,QACrB,IAAI,OAAO,OAAO,cAAc;AAAA,UAAY,OAAO,aAAa,CAAC,OAAO,UAAU;AAAA,QAClF,OAAO,OAAO,WAAW,SAAS,GAAG;AAAA,UACnC,OAAO,WAAW,IAAI,EAAE;AAAA,QAC1B;AAAA,MACF;AAAA,MACA,IAAI;AAAA,MACJ,YAAY;AAAA,MACZ,OAAO;AAAA;AAAA,KAER;AAAA,EACC,sBAAsB;AAAA,EAU1B,OAAO,mBAAmB,mBAAmB;AAAA,EAI7C,OAAO,aAAa,aAAa;AAAA,EAM7B,SAAS,MAAM;AAAA,WACV;AAAA,MACL,OAAO,MAAM,QAAQ;AAAA;AAAA,KAGtB,KAAK;AAAA,KAGL,KAAK;AAAA,IAGN,cAAc;AAAA,IAEd,WAAW;AAAA,gBAOE,KAAI,CAAC,eAAe;AAAA,MAC/B,UAAU,MAAM,kBAAkB,aAAa,CAAC;AAAA,MAChD,kBAAkB,EAAE,SAAS;AAAA,MAC7B,mBAAmB,EAAE,SAAS,iBAAiB,KAAK;AAAA,MACpD,yBAAyB,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA;AAAA,IAK1E,WAAW,GAAG;AAAA,MACZ,KAAK,WAAW;AAAA;AAAA,IAGlB,UAAU,GAAG;AAAA,MACX,IAAI,CAAC,YAAY,GAAG;AAAA,QAClB,MAAM,IAAI,MAAM,mDAAmD;AAAA,MACrE;AAAA,MACA,EAAE,oBAAoB;AAAA,MACtB,KAAK,KAAK,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAC3C,KAAK,KAAK,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA;AAAA,IAG3D,MAAM,GAAG;AAAA,MACP,EAAE,kBAAkB,KAAK,EAAE;AAAA,MAC3B,EAAE,MAAM,KAAK,EAAE;AAAA,MACf,KAAK,KAAK;AAAA,MACV,KAAK,KAAK;AAAA;AAAA,IAWZ,WAAW,CAAC,UAAU;AAAA,MACpB,IAAI;AAAA,MACJ,IAAI,CAAC,UAAU;AAAA,QACb,UAAU;AAAA,QACV,KAAK,WAAW;AAAA,MAClB,EAAO,SAAI,SAAS,gBAAgB,UAAU;AAAA,QAC5C,UAAU,SAAS;AAAA,QACnB,MAAM,UAAU,EAAE,qBAAqB,OAAO;AAAA,QAC9C,IAAI,UAAU,0BAA0B,mBAAmB,SAAS;AAAA,UAClE,MAAM,IAAI,MACR,iCAAiC,gCAAgC,kCAAkC,mBACrG;AAAA,QACF;AAAA,QACA,KAAK,WAAW;AAAA,MAClB,EAAO;AAAA,QACL,MAAM,IAAI,MAAM,6BAA6B;AAAA;AAAA,MAE/C,EAAE,wBAAwB,KAAK,IAAI,OAAO;AAAA,MAC1C,OAAO;AAAA;AAAA,IAkBT,KAAK,CAAC,UAAU,SAAS,SAAS;AAAA,MAChC,IAAI,OAAO,aAAa,UAAU;AAAA,QAChC,EAAE,uBAAuB,CAAC,UAAU,SAAS,MAAM,KAAK;AAAA,MAC1D,EAAO,SAAI,OAAO,aAAa,YAAY;AAAA,QACzC,EAAE,uBAAuB;AAAA,MAC3B,EAAO;AAAA,QACL,MAAM,IAAI,MAAM,yCAAyC;AAAA;AAAA,MAE3D,IAAI,SAAS,kBAAkB;AAAA,QAC7B,EAAE,0BAA0B,QAAQ;AAAA,MACtC,EAAO;AAAA,QACL,EAAE,0BAA0B;AAAA;AAAA,MAE9B,IAAI,KAAK,aAAa;AAAA,QACpB,EAAE,qBAAqB,KAAK;AAAA,QAC5B,EAAE,8BAA8B,KAAK,IAAI,CAAC;AAAA,MAC5C,EAAO;AAAA,QACL,EAAE,qBAAqB;AAAA,QACvB,EAAE,8BAA8B,KAAK,IAAI,CAAC;AAAA;AAAA,MAE5C,IAAI,aAAa;AAAA,MACjB,IAAI,eAAe;AAAA,MACnB,IAAI,SAAS,gBAAgB;AAAA,QAC3B,aAAa,QAAQ,eAAe;AAAA,QACpC,eAAe,EAAE,QAAQ,YAAY,aAAa;AAAA,QAClD,IAAI,UAAU;AAAA,QACd,SAAS,KAAK,EAAG,KAAK,YAAY,MAAM;AAAA,UACtC,aAAa,SAAS,QAAQ,eAAe,GAAG;AAAA,UAChD,WAAW;AAAA,QACb;AAAA,MACF;AAAA,MACA,MAAM,cAAc,EAAE,sBACpB,KAAK,IACL,KAAK,IACL,UAAU,QAAQ,KAAK,GACvB,cACA,UACF;AAAA,MACA,IAAI,CAAC,aAAa;AAAA,QAChB,EAAE,uBAAuB;AAAA,QACzB,EAAE,qBAAqB;AAAA,QACvB,EAAE,0BAA0B;AAAA,QAC5B,OAAO;AAAA,MACT;AAAA,MACA,IAAI,CAAC,KAAK,UAAU;AAAA,QAClB,MAAM,IAAI,MAAM,sCAAsC;AAAA,MACxD;AAAA,MACA,MAAM,SAAS,IAAI,KAAK,UAAU,aAAa,KAAK,UAAU,EAAE,oBAAoB;AAAA,MACpF,EAAE,uBAAuB;AAAA,MACzB,EAAE,qBAAqB;AAAA,MACvB,EAAE,0BAA0B;AAAA,MAC5B,OAAO;AAAA;AAAA,IAWT,KAAK,GAAG;AAAA,MACN,EAAE,iBAAiB,KAAK,EAAE;AAAA;AAAA,IAG5B,iBAAiB,GAAG;AAAA,MAClB,EAAE,gCAAgC,KAAK,EAAE;AAAA,MACzC,MAAM,QAAQ,EAAE,SAAS,iBAAiB,KAAK;AAAA,MAC/C,MAAM,SAAS,EAAE,SAAS,kBAAkB,aAAa,KAAK;AAAA,MAC9D,MAAM,SAAS,IAAI,MAAM,KAAK;AAAA,MAC9B,IAAI,QAAQ,GAAG;AAAA,QACb,IAAI,UAAU;AAAA,QACd,SAAS,KAAK,EAAG,KAAK,OAAO,MAAM;AAAA,UACjC,OAAO,MAAM,eAAe,OAAO;AAAA,UACnC,WAAW;AAAA,QACb;AAAA,QACA,EAAE,MAAM,MAAM;AAAA,MAChB;AAAA,MACA,OAAO;AAAA;AAAA,IAST,gBAAgB,GAAG;AAAA,MACjB,OAAO,EAAE,0BAA0B,KAAK,EAAE;AAAA;AAAA,IAW5C,gBAAgB,CAAC,SAAS;AAAA,MACxB,EAAE,8BAA8B,KAAK,IAAI,GAAG,OAAO;AAAA;AAAA,IAGrD,SAAS,CAAC,UAAU;AAAA,MAClB,IAAI,CAAC,UAAU;AAAA,QACb,KAAK,cAAc;AAAA,MACrB,EAAO,SAAI,OAAO,aAAa,YAAY;AAAA,QACzC,MAAM,IAAI,MAAM,oCAAoC;AAAA,MACtD,EAAO;AAAA,QACL,KAAK,cAAc;AAAA;AAAA,MAErB,OAAO;AAAA;AAAA,IAGT,SAAS,GAAG;AAAA,MACV,OAAO,KAAK;AAAA;AAAA,EAEhB;AAAA;;;;;;;;AC13HA;AACA,kBAAS;AACT;AAGA;AACA;AA2GA;AAGA,qBAAS,mBAAuB;AA5GhC,MAAM,cAAc;AAAA,SACX,OAAO,CAAC,KAAK;AAAA,IAClB,IAAI,OAAO;AAAA,IACX,SAAS,KAAI,EAAE,KAAI,IAAI,QAAQ,MAAK;AAAA,MAClC,MAAM,OAAO,IAAI,WAAW,EAAC;AAAA,MAC7B,QAAQ,QAAQ,KAAK,OAAO;AAAA,MAC5B,OAAO,OAAO;AAAA,IAChB;AAAA,IACA,OAAO,KAAK,IAAI,IAAI,EAAE,SAAS,EAAE;AAAA;AAAA,cAEtB,eAAc,CAAC,QAAQ,UAAU,aAAa,eAAe,kBAAkB,MAAM,UAAU;AAAA,IAC1G,MAAM,QAAQ,OAAO,WAAW,SAAS,KAAK,OAAO,WAAW,UAAU;AAAA,IAC1E,IAAI,OAAO;AAAA,MACT,IAAI;AAAA,MACJ,IAAI,iBAAiB;AAAA,QACnB,MAAM,OAAO,KAAK,QAAQ,MAAM;AAAA,QAChC,gBAAgB,WAAW,GAAG,YAAY,OAAO,kBAAkB,GAAG,OAAO;AAAA,MAC/E,EAAO;AAAA,QACL,gBAAqB,cAAS,MAAM;AAAA;AAAA,MAEtC,MAAM,YAAiB,UAAK,UAAU,aAAa,aAAa;AAAA,MAChE,MAAM,MAAW,aAAQ,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,MACxD,IAAI;AAAA,QACF,MAAM,gBAAgB,MAAM,IAAI,KAAK,SAAS,EAAE,YAAY;AAAA,QAC5D,IAAI,cAAc,aAAa,GAAG;AAAA,UAChC,QAAQ,IAAI,sBAAsB,cAAc,SAAS;AAAA,UACzD,OAAO,EAAE,SAAS,eAAe,UAAU,UAAU;AAAA,QACvD;AAAA,QACA,OAAO,OAAO;AAAA,MAChB,IAAI;AAAA,QACF,QAAQ,IAAI,yBAAyB,QAAQ;AAAA,QAC7C,MAAM,WAAW,MAAM,MAAM,MAAM;AAAA,QACnC,IAAI,CAAC,SAAS,IAAI;AAAA,UAChB,OAAO,EAAE,OAAO,wBAAwB,WAAW,SAAS,aAAa;AAAA,QAC3E;AAAA,QACA,MAAM,UAAU,MAAM,SAAS,YAAY;AAAA,QAC3C,IAAI;AAAA,UACF,MAAM,UAAU,WAAW,OAAO,KAAK,OAAO,CAAC;AAAA,UAC/C,QAAQ,IAAI,WAAW,QAAQ;AAAA,UAC/B,OAAO,YAAY;AAAA,UACnB,QAAQ,KAAK,oBAAoB,YAAY;AAAA;AAAA,QAE/C,OAAO,EAAE,SAAS,UAAU,UAAU;AAAA,QACtC,OAAO,OAAO;AAAA,QACd,OAAO,EAAE,OAAO,0BAA0B,WAAW,QAAQ;AAAA;AAAA,IAEjE,EAAO;AAAA,MACL,IAAI;AAAA,QACF,QAAQ,IAAI,4BAA4B,QAAQ;AAAA,QAChD,MAAM,UAAU,MAAM,IAAI,KAAK,MAAM,EAAE,YAAY;AAAA,QACnD,OAAO,EAAE,SAAS,UAAU,OAAO;AAAA,QACnC,OAAO,OAAO;AAAA,QACd,OAAO,EAAE,OAAO,iCAAiC,WAAW,QAAQ;AAAA;AAAA;AAAA;AAAA,cAI7D,eAAc,CAAC,QAAQ,YAAY;AAAA,IAC9C,MAAM,QAAQ,OAAO,WAAW,SAAS,KAAK,OAAO,WAAW,UAAU;AAAA,IAC1E,MAAM,MAAW,aAAQ,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,IACzD,IAAI,OAAO;AAAA,MACT,IAAI;AAAA,QACF,QAAQ,IAAI,yBAAyB,QAAQ;AAAA,QAC7C,MAAM,WAAW,MAAM,MAAM,MAAM;AAAA,QACnC,IAAI,CAAC,SAAS,IAAI;AAAA,UAChB,OAAO,EAAE,OAAO,wBAAwB,WAAW,SAAS,aAAa;AAAA,QAC3E;AAAA,QACA,MAAM,UAAU,MAAM,SAAS,YAAY;AAAA,QAC3C,MAAM,UAAU,YAAY,OAAO,KAAK,OAAO,CAAC;AAAA,QAChD,QAAQ,IAAI,eAAe,aAAa,YAAY;AAAA,QACpD,OAAO,EAAE,SAAS,UAAU,WAAW;AAAA,QACvC,OAAO,OAAO;AAAA,QACd,OAAO,EAAE,OAAO,0BAA0B,WAAW,QAAQ;AAAA;AAAA,IAEjE,EAAO;AAAA,MACL,IAAI;AAAA,QACF,QAAQ,IAAI,4BAA4B,QAAQ;AAAA,QAChD,MAAM,UAAU,MAAM,IAAI,KAAK,MAAM,EAAE,YAAY;AAAA,QACnD,MAAM,UAAU,YAAY,OAAO,KAAK,OAAO,CAAC;AAAA,QAChD,OAAO,EAAE,SAAS,UAAU,WAAW;AAAA,QACvC,OAAO,OAAO;AAAA,QACd,OAAO,EAAE,OAAO,iCAAiC,WAAW,QAAQ;AAAA;AAAA;AAAA;AAAA,cAI7D,sBAAqB,CAAC,SAAS,UAAU,UAAU;AAAA,IAC9D,MAAM,gBAAgB,QAAQ,IAAI,CAAC,WAAW,KAAK,oBAAoB,QAAQ,UAAU,QAAQ,CAAC;AAAA,IAClG,MAAM,eAAe,MAAM,QAAQ,IAAI,aAAa;AAAA,IACpD,MAAM,eAAe,aAAa,OAAO,CAAC,UAAU,MAAM,KAAK,EAAE,SAAS,CAAC;AAAA,IAC3E,OAAO,aAAa,KAAK;AAAA,CAC5B;AAAA;AAAA,cAEc,oBAAmB,CAAC,QAAQ,UAAU,UAAU;AAAA,IAC3D,MAAM,SAAS,MAAM,KAAK,eAAe,QAAQ,UAAU,WAAW,QAAQ,MAAM,QAAQ;AAAA,IAC5F,IAAI,OAAO,OAAO;AAAA,MAChB,QAAQ,MAAM,uCAAuC,WAAW,OAAO,KAAK;AAAA,MAC5E,OAAO;AAAA,IACT;AAAA,IACA,IAAI,OAAO,SAAS;AAAA,MAClB,OAAO,IAAI,YAAY,EAAE,OAAO,OAAO,OAAO;AAAA,IAChD;AAAA,IACA,OAAO;AAAA;AAEX;AAOA,SAAS,WAAW,CAAC,QAAO;AAAA,EAC1B,OAAO,OAAM,SAAS,QAAQ,KAAK,gBAAgB,KAAK,MAAK;AAAA;AAE/D,SAAS,gBAAgB,GAAG;AAAA,EAC1B,OAAyD;AAAA;AAE3D,SAAS,kBAAkB,CAAC,UAAU;AAAA,EACpC,OAAO,OAAM,iBAAiB,GAAG,UAAU,QAAQ,CAAC;AAAA;AAItD,IAAI,QAAO;AAAA;AAEX,MAAM,aAAa;AAAA,EACjB,gBAAgB,IAAI;AAAA,EACpB,wBAAwB,IAAI;AAAA,EAC5B,kBAAkB,IAAI;AAAA,EACtB,yBAAyB,IAAI;AAAA,EAC7B,kBAAkB,IAAI;AAAA,EACtB,yBAAyB,IAAI;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,cAAc;AAAA,EACd,WAAW,GAAG;AAAA,IACZ,KAAK,cAAc;AAAA,MACjB,kBAAkB;AAAA,MAClB,YAAY,CAAC;AAAA,MACb,kBAAkB;AAAA,MAClB,YAAY,CAAC;AAAA,IACf;AAAA;AAAA,OAEI,aAAY,CAAC,SAAS,UAAU;AAAA,IACpC,IAAI,CAAC,KAAK,YAAY;AAAA,MACpB,OAAO;AAAA,IACT;AAAA,IACA,OAAO,cAAc,sBAAsB,SAAS,KAAK,YAAY,QAAQ;AAAA;AAAA,OAEzE,WAAU,GAAG,YAAY;AAAA,IAC7B,IAAI,KAAK,mBAAmB;AAAA,MAC1B,OAAO,KAAK;AAAA,IACd;AAAA,IACA,KAAK,oBAAoB,IAAI,QAAQ,OAAO,SAAS,WAAW;AAAA,MAC9D,KAAK,WAAW;AAAA,MAChB,KAAK,aAAmB,WAAK,UAAU,aAAa;AAAA,MACpD,IAAI;AAAA,QACF,MAAM,OAAa,WAAK,KAAK,YAAY,WAAW,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,QAC1E,MAAM,OAAa,WAAK,KAAK,YAAY,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,QACxE,MAAM,SAAS,aAAa;AAAA,QAG5B,IAAI,YAAY,QAAQ,GAAG;AAAA,UACzB,WAAW,mBAAyB,YAAM,QAAQ,EAAE,IAAI;AAAA,QAC1D;AAAA,QACA,MAAM,OAAO,KAAK;AAAA,UAChB,UAAU,GAAG;AAAA,YACX,OAAO;AAAA;AAAA,QAEX,CAAC;AAAA,QACD,KAAK,cAAc;AAAA,QACnB,QAAQ;AAAA,QACR,OAAO,OAAO;AAAA,QACd,OAAO,KAAK;AAAA;AAAA,KAEf;AAAA,IACD,OAAO,KAAK;AAAA;AAAA,EAEd,iBAAiB,CAAC,gBAAgB;AAAA,IAChC,KAAK,sBAAsB,IAAI,eAAe,UAAU,cAAc;AAAA;AAAA,OAElE,cAAa,CAAC,gBAAgB,UAAU;AAAA,IAC5C,IAAI;AAAA,MACF,MAAM,wBAAwB,MAAM,KAAK,aAAa,eAAe,QAAQ,YAAY,eAAe,QAAQ;AAAA,MAChH,IAAI,CAAC,uBAAuB;AAAA,QAC1B,QAAQ,MAAM,0CAA0C,eAAe,QAAQ;AAAA,QAC/E;AAAA,MACF;AAAA,MACA,MAAM,kBAAkB,IAAI,MAAM,UAAU,qBAAqB;AAAA,MACjE,MAAM,SAAS;AAAA,QACb,YAAY;AAAA,MACd;AAAA,MACA,IAAI,eAAe,QAAQ,cAAc,eAAe,QAAQ,WAAW,SAAS,GAAG;AAAA,QACrF,MAAM,wBAAwB,MAAM,KAAK,aAAa,eAAe,QAAQ,YAAY,eAAe,QAAQ;AAAA,QAChH,IAAI,uBAAuB;AAAA,UACzB,OAAO,aAAa,IAAI,MAAM,UAAU,qBAAqB;AAAA,QAC/D;AAAA,MACF;AAAA,MACA,OAAO;AAAA,MACP,OAAO,OAAO;AAAA,MACd,QAAQ,MAAM,8BAA8B,eAAe,UAAU,eAAe,OAAO;AAAA,MAC3F,QAAQ,MAAM,KAAK;AAAA,MACnB;AAAA;AAAA;AAAA,OAGE,aAAY,CAAC,gBAAgB;AAAA,IACjC,IAAI,CAAC,KAAK,eAAe,CAAC,KAAK,YAAY;AAAA,MACzC;AAAA,IACF;AAAA,IACA,MAAM,SAAS,MAAM,cAAc,eAAe,gBAAgB,KAAK,YAAY,aAAa,SAAS,KAAK;AAAA,IAC9G,IAAI,OAAO,OAAO;AAAA,MAChB,QAAQ,MAAM,0BAA0B,mBAAmB,OAAO,KAAK;AAAA,MACvE;AAAA,IACF;AAAA,IACA,IAAI,CAAC,OAAO,UAAU;AAAA,MACpB;AAAA,IACF;AAAA,IACA,MAAM,iBAAiB,OAAO,SAAS,WAAW,MAAM,GAAG;AAAA,IAC3D,IAAI;AAAA,MACF,MAAM,WAAW,MAAM,SAAS,KAAK,cAAc;AAAA,MACnD,OAAO;AAAA,MACP,OAAO,OAAO;AAAA,MACd,QAAQ,MAAM,+BAA+B,mBAAmB,KAAK;AAAA,MACrE;AAAA;AAAA;AAAA,OAGE,sBAAqB,CAAC,UAAU;AAAA,IACpC,IAAI,KAAK,gBAAgB,IAAI,QAAQ,GAAG;AAAA,MACtC,OAAO,KAAK,gBAAgB,IAAI,QAAQ;AAAA,IAC1C;AAAA,IACA,IAAI,KAAK,uBAAuB,IAAI,QAAQ,GAAG;AAAA,MAC7C,OAAO,KAAK,uBAAuB,IAAI,QAAQ;AAAA,IACjD;AAAA,IACA,MAAM,iBAAiB,KAAK,mBAAmB,QAAQ;AAAA,IACvD,KAAK,uBAAuB,IAAI,UAAU,cAAc;AAAA,IACxD,IAAI;AAAA,MACF,MAAM,SAAS,MAAM;AAAA,MACrB,IAAI,QAAQ;AAAA,QACV,KAAK,gBAAgB,IAAI,UAAU,MAAM;AAAA,MAC3C;AAAA,MACA,OAAO;AAAA,cACP;AAAA,MACA,KAAK,uBAAuB,OAAO,QAAQ;AAAA;AAAA;AAAA,OAGzC,mBAAkB,CAAC,UAAU;AAAA,IACjC,MAAM,wBAAwB,KAAK,sBAAsB,IAAI,QAAQ;AAAA,IACrE,IAAI,CAAC,uBAAuB;AAAA,MAC1B;AAAA,IACF;AAAA,IACA,MAAM,WAAW,MAAM,KAAK,aAAa,sBAAsB,IAAI;AAAA,IACnE,IAAI,CAAC,UAAU;AAAA,MACb;AAAA,IACF;AAAA,IACA,MAAM,UAAU,MAAM,KAAK,cAAc,uBAAuB,QAAQ;AAAA,IACxE,IAAI,CAAC,SAAS;AAAA,MACZ,QAAQ,MAAM,iCAAiC,QAAQ;AAAA,MACvD;AAAA,IACF;AAAA,IACA,MAAM,iBAAiB;AAAA,SAClB;AAAA,MACH;AAAA,MACA;AAAA,IACF;AAAA,IACA,OAAO;AAAA;AAAA,OAEH,cAAa,CAAC,UAAU;AAAA,IAC5B,OAAO,KAAK,sBAAsB,QAAQ;AAAA;AAAA,OAEtC,kBAAiB,CAAC,UAAU;AAAA,IAChC,IAAI,KAAK,gBAAgB,IAAI,QAAQ,GAAG;AAAA,MACtC,OAAO,KAAK,gBAAgB,IAAI,QAAQ;AAAA,IAC1C;AAAA,IACA,IAAI,KAAK,uBAAuB,IAAI,QAAQ,GAAG;AAAA,MAC7C,OAAO,KAAK,uBAAuB,IAAI,QAAQ;AAAA,IACjD;AAAA,IACA,MAAM,kBAAkB,KAAK,qBAAqB,QAAQ;AAAA,IAC1D,KAAK,uBAAuB,IAAI,UAAU,eAAe;AAAA,IACzD,IAAI;AAAA,MACF,MAAM,SAAS,MAAM;AAAA,MACrB,IAAI,QAAQ;AAAA,QACV,KAAK,gBAAgB,IAAI,UAAU,MAAM;AAAA,MAC3C;AAAA,MACA,OAAO;AAAA,cACP;AAAA,MACA,KAAK,uBAAuB,OAAO,QAAQ;AAAA;AAAA;AAAA,OAGzC,qBAAoB,CAAC,UAAU;AAAA,IACnC,MAAM,iBAAiB,MAAM,KAAK,sBAAsB,QAAQ;AAAA,IAChE,IAAI,CAAC,gBAAgB;AAAA,MACnB;AAAA,IACF;AAAA,IACA,MAAM,SAAS,IAAI;AAAA,IACnB,OAAO,YAAY,eAAe,QAAQ;AAAA,IAC1C,MAAM,gBAAgB;AAAA,MACpB;AAAA,MACA;AAAA,MACA,SAAS,eAAe;AAAA,IAC1B;AAAA,IACA,OAAO;AAAA;AAAA,OAEH,uBAAsB,CAAC,UAAU,SAAS,SAAS,UAAU,WAAW;AAAA,IAC5E,MAAM,iBAAiB,MAAM,KAAK,sBAAsB,QAAQ;AAAA,IAChE,IAAI,CAAC,gBAAgB;AAAA,MACnB,MAAK,YAAY;AAAA,QACf,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA,WAAW;AAAA,QACX,SAAS,oCAAoC;AAAA,MAC/C,CAAC;AAAA,MACD;AAAA,IACF;AAAA,IACA,MAAM,SAAS,IAAI;AAAA,IACnB,OAAO,YAAY,eAAe,QAAQ;AAAA,IAC1C,MAAM,OAAO,OAAO,MAAM,OAAO;AAAA,IACjC,IAAI,CAAC,MAAM;AAAA,MACT,MAAK,YAAY;AAAA,QACf,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA,WAAW;AAAA,QACX,OAAO;AAAA,MACT,CAAC;AAAA,MACD;AAAA,IACF;AAAA,IACA,MAAM,cAAc;AAAA,MAClB;AAAA,MACA;AAAA,MACA,SAAS,eAAe;AAAA,MACxB;AAAA,MACA;AAAA,MACA,kBAAkB,eAAe;AAAA,IACnC;AAAA,IACA,KAAK,cAAc,IAAI,UAAU,WAAW;AAAA,IAC5C,MAAK,YAAY;AAAA,MACf,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA,WAAW;AAAA,IACb,CAAC;AAAA,IACD,MAAM,aAAa,MAAM,KAAK,aAAa,WAAW;AAAA,IACtD,MAAK,YAAY;AAAA,MACf,MAAM;AAAA,MACN;AAAA,MACA;AAAA,SACG;AAAA,IACL,CAAC;AAAA;AAAA,OAEG,aAAY,CAAC,aAAa;AAAA,IAC9B,MAAM,QAAQ,YAAY,QAAQ;AAAA,IAClC,MAAM,UAAU,MAAM,SAAS,YAAY,KAAK,QAAQ;AAAA,IACxD,IAAI,kBAAkB,IAAI;AAAA,IAC1B,IAAI,YAAY,QAAQ,YAAY;AAAA,MAClC,MAAM,kBAAkB,MAAM,KAAK,kBAAkB,WAAW;AAAA,MAChE,QAAQ,KAAK,GAAG,gBAAgB,QAAQ;AAAA,MACxC,kBAAkB,gBAAgB;AAAA,IACpC;AAAA,IACA,OAAO,KAAK,cAAc,aAAa,SAAS,eAAe;AAAA;AAAA,EAEjE,WAAW,CAAC,MAAM,SAAS;AAAA,IACzB,OAAO,QAAQ,UAAU,KAAK,YAAY,KAAK,QAAQ;AAAA;AAAA,OAEnD,kBAAiB,CAAC,aAAa;AAAA,IACnC,MAAM,mBAAmB,CAAC;AAAA,IAC1B,MAAM,kBAAkB,IAAI;AAAA,IAC5B,IAAI,CAAC,YAAY,QAAQ,YAAY;AAAA,MACnC,OAAO,EAAE,UAAU,kBAAkB,gBAAgB;AAAA,IACvD;AAAA,IACA,MAAM,UAAU,YAAY;AAAA,IAC5B,MAAM,oBAAoB,YAAY,QAAQ,WAAW,SAAS,YAAY,KAAK,QAAQ;AAAA,IAC3F,MAAM,iBAAiB,IAAI;AAAA,IAC3B,MAAM,mBAAmB,YAAY;AAAA,IACrC,WAAW,WAAW,mBAAmB;AAAA,MACvC,MAAM,cAAc,QAAQ;AAAA,MAC5B,IAAI,gBAAgB,uBAAuB,YAAY,SAAS,WAAW,GAAG;AAAA,QAC5E,MAAM,WAAW,QAAQ,KAAK;AAAA,QAC9B,IAAI;AAAA,QACJ,IAAI,kBAAkB,aAAa,iBAAiB,UAAU,WAAW;AAAA,UACvE,iBAAiB,iBAAiB,UAAU;AAAA,QAC9C,EAAO,SAAI,aAAa,sBAAsB;AAAA,UAC5C,MAAM,SAAS,QAAQ,KAAK;AAAA,UAC5B,IAAI,QAAQ;AAAA,YACV,MAAM,aAAa,OAAO,SAAS,KAAK,CAAC,UAAU,MAAM,SAAS,aAAa;AAAA,YAC/E,IAAI,YAAY;AAAA,cACd,MAAM,eAAe,WAAW,SAAS,KAAK,CAAC,UAAU,MAAM,SAAS,UAAU;AAAA,cAClF,IAAI,cAAc;AAAA,gBAChB,MAAM,eAAe,KAAK,YAAY,cAAc,OAAO;AAAA,gBAC3D,IAAI,kBAAkB,iBAAiB,iBAAiB,cAAc,eAAe;AAAA,kBACnF,iBAAiB,iBAAiB,cAAc;AAAA,gBAClD,EAAO;AAAA,kBACL,iBAAiB;AAAA;AAAA,cAErB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,IAAI,gBAAgB;AAAA,UAClB,IAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AAAA,YACvC,eAAe,IAAI,gBAAgB,CAAC,CAAC;AAAA,UACvC;AAAA,UACA,eAAe,IAAI,cAAc,EAAE,KAAK,EAAE,MAAM,QAAQ,MAAM,MAAM,QAAQ,KAAK,CAAC;AAAA,QACpF;AAAA,MACF;AAAA,IACF;AAAA,IACA,YAAY,UAAU,aAAa,eAAe,QAAQ,GAAG;AAAA,MAC3D,MAAM,iBAAiB,MAAM,KAAK,kBAAkB,QAAQ;AAAA,MAC5D,IAAI,CAAC,gBAAgB;AAAA,QACnB,QAAQ,KAAK,2CAA2C,UAAU;AAAA,QAClE;AAAA,MACF;AAAA,MACA,IAAI,CAAC,gBAAgB,IAAI,QAAQ,GAAG;AAAA,QAClC,gBAAgB,IAAI,UAAU,CAAC,CAAC;AAAA,MAClC;AAAA,MACA,MAAM,SAAS,eAAe;AAAA,MAC9B,aAAa,MAAM,mBAAmB,UAAU;AAAA,QAC9C,IAAI;AAAA,UACF,gBAAgB,IAAI,QAAQ,EAAE,KAAK;AAAA,YACjC,OAAO,cAAc;AAAA,YACrB,KAAK,cAAc;AAAA,UACrB,CAAC;AAAA,UACD,MAAM,mBAAmB,KAAK,YAAY,eAAe,OAAO;AAAA,UAChE,MAAM,OAAO,OAAO,MAAM,gBAAgB;AAAA,UAC1C,IAAI,MAAM;AAAA,YACR,MAAM,UAAU,eAAe,QAAQ,WAAW,SAAS,KAAK,QAAQ;AAAA,YACxE,WAAW,SAAS,SAAS;AAAA,cAC3B,MAAM,gBAAgB;AAAA,gBACpB,MAAM,MAAM;AAAA,gBACZ,cAAc,MAAM;AAAA,gBACpB,gBAAgB,eAAe,QAAQ;AAAA,gBACvC,MAAM;AAAA,qBACD,MAAM;AAAA,kBACT,eAAe;AAAA,oBACb,KAAK,MAAM,KAAK,cAAc,MAAM,cAAc,cAAc;AAAA,oBAChE,QAAQ,MAAM,KAAK,cAAc,QAAQ,IAAI,MAAM,KAAK,cAAc,SAAS,cAAc,cAAc,SAAS,MAAM,KAAK,cAAc;AAAA,kBAC/I;AAAA,kBACA,aAAa;AAAA,oBACX,KAAK,MAAM,KAAK,YAAY,MAAM,cAAc,cAAc;AAAA,oBAC9D,QAAQ,MAAM,KAAK,YAAY,QAAQ,IAAI,MAAM,KAAK,YAAY,SAAS,cAAc,cAAc,SAAS,MAAM,KAAK,YAAY;AAAA,kBACzI;AAAA,kBACA,YAAY,MAAM,KAAK,aAAa,cAAc;AAAA,kBAClD,UAAU,MAAM,KAAK,WAAW,cAAc;AAAA,gBAChD;AAAA,cACF;AAAA,cACA,iBAAiB,KAAK,aAAa;AAAA,YACrC;AAAA,YACA,KAAK,OAAO;AAAA,UACd;AAAA,UACA,OAAO,OAAO;AAAA,UACd,QAAQ,MAAM,2CAA2C,aAAa,KAAK;AAAA;AAAA,MAE/E;AAAA,IACF;AAAA,IACA,OAAO,EAAE,UAAU,kBAAkB,gBAAgB;AAAA;AAAA,EAEvD,WAAW,CAAC,MAAM;AAAA,IAChB,OAAO;AAAA,MACL,eAAe;AAAA,QACb,QAAQ,KAAK,cAAc;AAAA,QAC3B,KAAK,KAAK,cAAc;AAAA,MAC1B;AAAA,MACA,aAAa;AAAA,QACX,QAAQ,KAAK,eAAe;AAAA,QAC5B,KAAK,KAAK,eAAe;AAAA,MAC3B;AAAA,MACA,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,IACjB;AAAA;AAAA,OAEI,YAAW,CAAC,UAAU,SAAS,OAAO;AAAA,IAC1C,MAAM,cAAc,KAAK,cAAc,IAAI,QAAQ;AAAA,IACnD,IAAI,CAAC,aAAa;AAAA,MAChB,OAAO,EAAE,SAAS,mCAAmC;AAAA,IACvD;AAAA,IACA,YAAY,UAAU;AAAA,IACtB,WAAW,QAAQ,OAAO;AAAA,MACxB,YAAY,KAAK,KAAK,IAAI;AAAA,IAC5B;AAAA,IACA,MAAM,aAAa,YAAY,IAAI;AAAA,IACnC,MAAM,UAAU,YAAY,OAAO,MAAM,SAAS,YAAY,IAAI;AAAA,IAClE,MAAM,WAAW,YAAY,IAAI;AAAA,IACjC,MAAM,YAAY,WAAW;AAAA,IAC7B,KAAK,YAAY,WAAW,KAAK,SAAS;AAAA,IAC1C,IAAI,KAAK,YAAY,WAAW,SAAS,IAAI;AAAA,MAC3C,KAAK,YAAY,WAAW,MAAM;AAAA,IACpC;AAAA,IACA,KAAK,YAAY,mBAAmB,KAAK,YAAY,WAAW,OAAO,CAAC,KAAK,SAAS,MAAM,MAAM,CAAC,IAAI,KAAK,YAAY,WAAW;AAAA,IACnI,IAAI,CAAC,SAAS;AAAA,MACZ,OAAO,EAAE,OAAO,yBAAyB;AAAA,IAC3C;AAAA,IACA,MAAM,gBAAgB,YAAY,KAAK,iBAAiB,OAAO;AAAA,IAC/D,YAAY,OAAO;AAAA,IACnB,MAAM,aAAa,YAAY,IAAI;AAAA,IACnC,MAAM,UAAU,CAAC;AAAA,IACjB,IAAI,cAAc,WAAW,GAAG;AAAA,MAC9B,MAAM,QAAQ,CAAC,SAAS;AAAA,QACtB,MAAM,QAAQ,KAAK,YAAY,IAAI;AAAA,QACnC,cAAc,KAAK,KAAK;AAAA,OACzB;AAAA,IACH;AAAA,IACA,WAAW,SAAS,eAAe;AAAA,MACjC,IAAI,OAAO,YAAY,KAAK,SAAS,sBAAsB,MAAM,eAAe,MAAM,WAAW;AAAA,MACjG,IAAI,CAAC,MAAM;AAAA,QACT;AAAA,MACF;AAAA,MACA,IAAI,KAAK,OAAO,YAAY,KAAK,QAAQ,GAAG;AAAA,QAC1C,MAAM,gBAAgB,YAAY,QAAQ,WAAW,SAAS,MAAM;AAAA,UAClE,YAAY,MAAM,aAAa;AAAA,UAC/B,UAAU,MAAM,WAAW;AAAA,QAC7B,CAAC;AAAA,QACD,QAAQ,KAAK,GAAG,aAAa;AAAA,QAC7B;AAAA,MACF;AAAA,MACA,OAAO,QAAQ,CAAC,KAAK,kBAAkB,MAAM,KAAK,GAAG;AAAA,QACnD,OAAO,KAAK;AAAA,MACd;AAAA,MACA,IAAI,CAAC,MAAM;AAAA,QACT,OAAO,YAAY,KAAK;AAAA,MAC1B;AAAA,MACA,MAAM,eAAe,YAAY,QAAQ,WAAW,SAAS,IAAI;AAAA,MACjE,QAAQ,KAAK,GAAG,YAAY;AAAA,IAC9B;AAAA,IACA,IAAI,kBAAkB,IAAI;AAAA,IAC1B,IAAI,YAAY,QAAQ,YAAY;AAAA,MAClC,MAAM,kBAAkB,MAAM,KAAK,kBAAkB,WAAW;AAAA,MAChE,QAAQ,KAAK,GAAG,gBAAgB,QAAQ;AAAA,MACxC,kBAAkB,gBAAgB;AAAA,IACpC;AAAA,IACA,MAAM,WAAW,YAAY,IAAI;AAAA,IACjC,MAAM,YAAY,WAAW;AAAA,IAC7B,KAAK,YAAY,WAAW,KAAK,SAAS;AAAA,IAC1C,IAAI,KAAK,YAAY,WAAW,SAAS,IAAI;AAAA,MAC3C,KAAK,YAAY,WAAW,MAAM;AAAA,IACpC;AAAA,IACA,KAAK,YAAY,mBAAmB,KAAK,YAAY,WAAW,OAAO,CAAC,KAAK,SAAS,MAAM,MAAM,CAAC,IAAI,KAAK,YAAY,WAAW;AAAA,IACnI,OAAO,KAAK,cAAc,aAAa,SAAS,eAAe;AAAA;AAAA,EAEjE,iBAAiB,CAAC,MAAM,OAAO;AAAA,IAC7B,OAAO,KAAK,cAAc,OAAO,MAAM,cAAc,OAAO,KAAK,YAAY,OAAO,MAAM,YAAY,QAAQ,KAAK,cAAc,MAAM,MAAM,cAAc,OAAO,KAAK,cAAc,UAAU,MAAM,cAAc,YAAY,KAAK,YAAY,MAAM,MAAM,YAAY,OAAO,KAAK,YAAY,UAAU,MAAM,YAAY;AAAA;AAAA,EAE9T,aAAa,CAAC,aAAa,SAAS,iBAAiB;AAAA,IACnD,MAAM,iBAAiB,IAAI;AAAA,IAC3B,MAAM,oBAAoB,IAAI;AAAA,IAC9B,WAAW,SAAS,SAAS;AAAA,MAC3B,MAAM,OAAO,MAAM;AAAA,MACnB,MAAM,YAAY,KAAK,cAAc;AAAA,MACrC,MAAM,UAAU,KAAK,YAAY;AAAA,MACjC,MAAM,YAAY;AAAA,QAChB,UAAU,KAAK,cAAc;AAAA,QAC7B,QAAQ,KAAK,YAAY;AAAA,QACzB,OAAO,MAAM;AAAA,MACf;AAAA,MACA,IAAI,CAAC,eAAe,IAAI,SAAS,GAAG;AAAA,QAClC,eAAe,IAAI,WAAW,IAAI,GAAG;AAAA,QACrC,kBAAkB,IAAI,WAAW,IAAI,GAAG;AAAA,MAC1C;AAAA,MACA,IAAI,eAAe,IAAI,SAAS,GAAG,IAAI,KAAK,EAAE,GAAG;AAAA,QAC/C,kBAAkB,IAAI,SAAS,GAAG,IAAI,KAAK,IAAI,eAAe,IAAI,SAAS,GAAG,IAAI,KAAK,EAAE,CAAC;AAAA,MAC5F;AAAA,MACA,eAAe,IAAI,SAAS,GAAG,IAAI,KAAK,IAAI,SAAS;AAAA,MACrD,IAAI,cAAc,SAAS;AAAA,QACzB,SAAS,OAAO,YAAY,EAAE,QAAQ,SAAS,QAAQ;AAAA,UACrD,IAAI,CAAC,eAAe,IAAI,IAAI,GAAG;AAAA,YAC7B,eAAe,IAAI,MAAM,IAAI,GAAG;AAAA,UAClC;AAAA,UACA,MAAM,KAAK;AAAA,YACT,UAAU;AAAA,YACV,QAAQ,KAAK,YAAY;AAAA,YACzB,OAAO,MAAM;AAAA,UACf;AAAA,UACA,eAAe,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AAAA,IACA,OAAO;AAAA,MACL,YAAY,MAAM,KAAK,eAAe,QAAQ,CAAC,EAAE,IAAI,EAAE,MAAM,sBAAsB;AAAA,QACjF;AAAA,QACA,YAAY,MAAM,KAAK,gBAAgB,OAAO,CAAC;AAAA,QAC/C,mBAAmB,kBAAkB,IAAI,IAAI,IAAI,MAAM,KAAK,kBAAkB,IAAI,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC;AAAA,MACvG,EAAE;AAAA,IACJ;AAAA;AAAA,EAEF,mBAAmB,CAAC,SAAS,iBAAiB;AAAA,IAC5C,MAAM,aAAa,CAAC;AAAA,IACpB,MAAM,sBAAsB,CAAC;AAAA,IAC7B,YAAY,MAAM,WAAW,gBAAgB,QAAQ,GAAG;AAAA,MACtD,WAAW,SAAS,QAAQ;AAAA,QAC1B,oBAAoB,KAAK,KAAK,OAAO,KAAK,CAAC;AAAA,MAC7C;AAAA,IACF;AAAA,IACA,WAAW,SAAS,SAAS;AAAA,MAC3B,MAAM,OAAO,MAAM;AAAA,MACnB,IAAI,cAAc;AAAA,MAClB,IAAI;AAAA,MACJ,IAAI,oBAAoB;AAAA,MACxB,WAAW,YAAY,qBAAqB;AAAA,QAC1C,IAAI,KAAK,cAAc,SAAS,SAAS,KAAK,YAAY,SAAS,KAAK;AAAA,UACtE,cAAc;AAAA,UACd,gBAAgB,SAAS;AAAA,UACzB;AAAA,QACF,EAAO,SAAI,KAAK,cAAc,SAAS,SAAS,KAAK,YAAY,SAAS,KAAK;AAAA,UAC7E,oBAAoB;AAAA,UACpB;AAAA,QACF;AAAA,MACF;AAAA,MACA,MAAM,aAAa,MAAM;AAAA,MACzB,MAAM,oBAAoB,YAAY,gBAAgB,MAAM;AAAA,MAC5D,MAAM,eAAe,mBAAmB,WAAW,MAAM,eAAe;AAAA,MACxE,MAAM,eAAe,mBAAmB,iBAAiB,MAAM,eAAe;AAAA,MAC9E,MAAM,OAAO,CAAC;AAAA,MACd,IAAI,eAAe,eAAe;AAAA,QAChC,KAAK,cAAc;AAAA,QACnB,KAAK,gBAAgB;AAAA,MACvB;AAAA,MACA,IAAI,mBAAmB;AAAA,QACrB,KAAK,oBAAoB;AAAA,MAC3B;AAAA,MACA,IAAI,iBAAiB,WAAW;AAAA,QAC9B,KAAK,UAAU;AAAA,MACjB;AAAA,MACA,IAAI,iBAAiB,WAAW;AAAA,QAC9B,KAAK,eAAe;AAAA,MACtB;AAAA,MACA,IAAI,OAAO,KAAK,IAAI,EAAE,SAAS,GAAG;AAAA,QAChC,WAAW,KAAK,CAAC,KAAK,YAAY,KAAK,UAAU,MAAM,MAAM,IAAI,CAAC;AAAA,MACpE,EAAO;AAAA,QACL,WAAW,KAAK,CAAC,KAAK,YAAY,KAAK,UAAU,MAAM,IAAI,CAAC;AAAA;AAAA,IAEhE;AAAA,IACA,WAAW,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE;AAAA,IACrC,OAAO;AAAA;AAAA,OAEH,kBAAiB,CAAC,UAAU,SAAS,SAAS;AAAA,IAClD,MAAM,cAAc,KAAK,cAAc,IAAI,QAAQ;AAAA,IACnD,IAAI,CAAC,aAAa;AAAA,MAChB,OAAO,EAAE,SAAS,mCAAmC;AAAA,IACvD;AAAA,IACA,YAAY,UAAU;AAAA,IACtB,MAAM,UAAU,YAAY,OAAO,MAAM,OAAO;AAAA,IAChD,IAAI,CAAC,SAAS;AAAA,MACZ,OAAO,EAAE,OAAO,sCAAsC;AAAA,IACxD;AAAA,IACA,YAAY,OAAO;AAAA,IACnB,MAAM,UAAU,YAAY,QAAQ,WAAW,SAAS,YAAY,KAAK,QAAQ;AAAA,IACjF,IAAI,kBAAkB,IAAI;AAAA,IAC1B,IAAI,YAAY,QAAQ,YAAY;AAAA,MAClC,MAAM,kBAAkB,MAAM,KAAK,kBAAkB,WAAW;AAAA,MAChE,QAAQ,KAAK,GAAG,gBAAgB,QAAQ;AAAA,MACxC,kBAAkB,gBAAgB;AAAA,IACpC;AAAA,IACA,OAAO,KAAK,cAAc,aAAa,SAAS,eAAe;AAAA;AAAA,EAEjE,aAAa,CAAC,UAAU;AAAA,IACtB,MAAM,cAAc,KAAK,cAAc,IAAI,QAAQ;AAAA,IACnD,IAAI,CAAC,aAAa;AAAA,MAChB;AAAA,IACF;AAAA,IACA,YAAY,KAAK,OAAO;AAAA,IACxB,YAAY,OAAO,OAAO;AAAA,IAC1B,KAAK,cAAc,OAAO,QAAQ;AAAA;AAAA,OAE9B,uBAAsB,CAAC,SAAS,UAAU,WAAW;AAAA,IACzD,MAAM,gBAAgB,MAAM,KAAK,kBAAkB,QAAQ;AAAA,IAC3D,IAAI,CAAC,eAAe;AAAA,MAClB,MAAK,YAAY;AAAA,QACf,MAAM;AAAA,QACN;AAAA,QACA,WAAW;AAAA,QACX,SAAS,oCAAoC;AAAA,MAC/C,CAAC;AAAA,MACD;AAAA,IACF;AAAA,IACA,MAAM,eAAe,aAAa,cAAc,QAAQ,SAAS,KAAK,IAAI,UAAU;AAAA,IACpF;AAAA,IACA,MAAM,OAAO,cAAc,OAAO,MAAM,YAAY;AAAA,IACpD,IAAI,CAAC,MAAM;AAAA,MACT,MAAK,YAAY;AAAA,QACf,MAAM;AAAA,QACN;AAAA,QACA,WAAW;AAAA,QACX,OAAO;AAAA,MACT,CAAC;AAAA,MACD;AAAA,IACF;AAAA,IACA,IAAI;AAAA,MACF,MAAM,UAAU,cAAc,eAAe,QAAQ,WAAW,SAAS,KAAK,QAAQ;AAAA,MACtF,IAAI,kBAAkB,IAAI;AAAA,MAC1B,IAAI,cAAc,eAAe,QAAQ,YAAY;AAAA,QACnD,MAAM,cAAc;AAAA,UAClB,QAAQ,cAAc;AAAA,UACtB;AAAA,UACA,SAAS,cAAc,eAAe;AAAA,UACtC;AAAA,UACA;AAAA,UACA,kBAAkB,cAAc,eAAe;AAAA,QACjD;AAAA,QACA,MAAM,kBAAkB,MAAM,KAAK,kBAAkB,WAAW;AAAA,QAChE,QAAQ,KAAK,GAAG,gBAAgB,QAAQ;AAAA,QACxC,kBAAkB,gBAAgB;AAAA,MACpC;AAAA,MACA,MAAM,aAAa,KAAK,oBAAoB,SAAS,eAAe;AAAA,MACpE,MAAK,YAAY;AAAA,QACf,MAAM;AAAA,QACN;AAAA,QACA,WAAW;AAAA,QACX;AAAA,MACF,CAAC;AAAA,cACD;AAAA,MACA,KAAK,OAAO;AAAA;AAAA;AAAA,OAGV,eAAc,CAAC,UAAU;AAAA,IAC7B,KAAK,WAAW;AAAA,IAChB,KAAK,aAAmB,WAAK,UAAU,aAAa;AAAA,IACpD,IAAI;AAAA,MACF,MAAM,OAAa,WAAK,KAAK,YAAY,WAAW,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,MAC1E,MAAM,OAAa,WAAK,KAAK,YAAY,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,MACxE,OAAO,OAAO;AAAA,MACd,MAAM,IAAI,MAAM,+BAA+B,OAAO;AAAA;AAAA;AAAA,OAGpD,WAAU,GAAG;AAAA,IACjB,IAAI,CAAC,KAAK,YAAY,CAAC,KAAK,YAAY;AAAA,MACtC,MAAM,IAAI,MAAM,yBAAyB;AAAA,IAC3C;AAAA,IACA,QAAQ,OAAO,MAAa;AAAA,IAC5B,IAAI;AAAA,MACF,MAAM,iBAAuB,WAAK,KAAK,UAAU,aAAa;AAAA,MAC9D,MAAM,GAAG,gBAAgB,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,MACzD,MAAM,OAAa,WAAK,gBAAgB,WAAW,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,MACzE,MAAM,OAAa,WAAK,gBAAgB,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAAA,MACvE,KAAK,gBAAgB,MAAM;AAAA,MAC3B,KAAK,uBAAuB,MAAM;AAAA,MAClC,KAAK,gBAAgB,MAAM;AAAA,MAC3B,KAAK,uBAAuB,MAAM;AAAA,MAClC,OAAO,OAAO;AAAA,MACd,MAAM,IAAI,MAAM,0BAA0B,OAAO;AAAA;AAAA;AAGvD;AACA,IAAI,CAAC,cAAc;AAAA,EACjB,IAAI,aAAa,QAAQ,CAAC,SAAS,OAAM;AAAA,IACvC,MAAK,YAAY;AAAA,MACf,MAAM;AAAA,MACN,SAAS;AAAA,MACT,MAAM;AAAA,IACR,CAAC;AAAA;AAAA,EAEH,MAAM,SAAS,IAAI;AAAA,EACnB,QAAQ,MAAM,IAAI,UAAS,WAAW,OAAO,GAAG,KAAI;AAAA,EACpD,QAAQ,QAAQ,IAAI,UAAS,WAAW,SAAS,GAAG,KAAI;AAAA,EACxD,QAAQ,OAAO,IAAI,UAAS,WAAW,QAAQ,GAAG,KAAI;AAAA,EACtD,MAAK,YAAY,OAAO,MAAM;AAAA,IAC5B,QAAQ,MAAM,UAAU,SAAS,SAAS,UAAU,OAAO,gBAAgB,WAAW,aAAa,EAAE;AAAA,IACrG,IAAI;AAAA,MACF,QAAQ;AAAA,aACD;AAAA,UACH,IAAI;AAAA,YACF,MAAM,OAAO,WAAW,EAAE,SAAS,CAAC;AAAA,YACpC,MAAK,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAAA,YAC1C,OAAO,OAAO;AAAA,YACd,MAAK,YAAY;AAAA,cACf,MAAM;AAAA,cACN,OAAO,iBAAiB,QAAQ,MAAM,SAAS,MAAM,UAAU,OAAO,KAAK;AAAA,YAC7E,CAAC;AAAA;AAAA,UAEH;AAAA,aACG;AAAA,UACH,OAAO,kBAAkB,cAAc;AAAA,UACvC;AAAA,aACG;AAAA,UACH,MAAM,cAAc,MAAM,OAAO,cAAc,QAAQ;AAAA,UACvD,MAAK,YAAY,EAAE,MAAM,2BAA2B,WAAW,WAAW,CAAC,CAAC,YAAY,CAAC;AAAA,UACzF;AAAA,aACG;AAAA,UACH,MAAM,OAAO,uBAAuB,UAAU,SAAS,SAAS,UAAU,SAAS;AAAA,UACnF;AAAA,aACG;AAAA,UACH,MAAM,WAAW,MAAM,OAAO,YAAY,UAAU,SAAS,KAAK;AAAA,UAClE,IAAI,SAAS,cAAc,SAAS,WAAW,SAAS,GAAG;AAAA,YACzD,MAAK,YAAY,EAAE,MAAM,sBAAsB,UAAU,YAAY,SAAS,CAAC;AAAA,UACjF,EAAO,SAAI,SAAS,SAAS;AAAA,YAC3B,MAAK,YAAY,EAAE,MAAM,WAAW,UAAU,SAAS,SAAS,QAAQ,CAAC;AAAA,UAC3E,EAAO,SAAI,SAAS,OAAO;AAAA,YACzB,MAAK,YAAY,EAAE,MAAM,SAAS,UAAU,OAAO,SAAS,MAAM,CAAC;AAAA,UACrE;AAAA,UACA;AAAA,aACG;AAAA,UACH,MAAK,YAAY,EAAE,MAAM,wBAAwB,aAAa,OAAO,aAAa,UAAU,CAAC;AAAA,UAC7F;AAAA,aACG;AAAA,UACH,MAAM,gBAAgB,MAAM,OAAO,kBAAkB,UAAU,SAAS,OAAO;AAAA,UAC/E,IAAI,cAAc,cAAc,cAAc,WAAW,SAAS,GAAG;AAAA,YACnE,MAAK,YAAY,EAAE,MAAM,sBAAsB,UAAU,YAAY,cAAc,CAAC;AAAA,UACtF,EAAO,SAAI,cAAc,SAAS;AAAA,YAChC,MAAK,YAAY,EAAE,MAAM,WAAW,UAAU,SAAS,cAAc,QAAQ,CAAC;AAAA,UAChF,EAAO,SAAI,cAAc,OAAO;AAAA,YAC9B,MAAK,YAAY,EAAE,MAAM,SAAS,UAAU,OAAO,cAAc,MAAM,CAAC;AAAA,UAC1E;AAAA,UACA;AAAA,aACG;AAAA,UACH,OAAO,cAAc,QAAQ;AAAA,UAC7B,MAAK,YAAY,EAAE,MAAM,mBAAmB,SAAS,CAAC;AAAA,UACtD;AAAA,aACG;AAAA,UACH,MAAM,OAAO,uBAAuB,SAAS,UAAU,SAAS;AAAA,UAChE;AAAA,aACG;AAAA,UACH,IAAI;AAAA,YACF,MAAM,OAAO,eAAe,QAAQ;AAAA,YACpC,MAAK,YAAY,EAAE,MAAM,6BAA6B,UAAU,CAAC;AAAA,YACjE,OAAO,OAAO;AAAA,YACd,MAAK,YAAY;AAAA,cACf,MAAM;AAAA,cACN;AAAA,cACA,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,YAC9D,CAAC;AAAA;AAAA,UAEH;AAAA,aACG;AAAA,UACH,IAAI;AAAA,YACF,MAAM,OAAO,WAAW;AAAA,YACxB,MAAK,YAAY,EAAE,MAAM,wBAAwB,UAAU,CAAC;AAAA,YAC5D,OAAO,OAAO;AAAA,YACd,MAAK,YAAY;AAAA,cACf,MAAM;AAAA,cACN;AAAA,cACA,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,YAC9D,CAAC;AAAA;AAAA,UAEH;AAAA;AAAA,UAEA,MAAK,YAAY;AAAA,YACf,MAAM;AAAA,YACN;AAAA,YACA,OAAO,yBAAyB;AAAA,UAClC,CAAC;AAAA;AAAA,MAEL,OAAO,OAAO;AAAA,MACd,MAAK,YAAY;AAAA,QACf,MAAM;AAAA,QACN;AAAA,QACA,OAAO,iBAAiB,QAAQ,MAAM,SAAS,MAAM,UAAU,OAAO,KAAK;AAAA,MAC7E,CAAC;AAAA;AAAA;AAGP;",
+  "debugId": "500890750F7FE9FF64756E2164756E21",
+  "names": []
+}