@ogabrielluiz/patchflow 0.1.1 → 0.1.3

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../node_modules/@dagrejs/graphlib/lib/graph.js","../node_modules/@dagrejs/graphlib/lib/version.js","../node_modules/@dagrejs/graphlib/lib/index.js","../node_modules/@dagrejs/graphlib/lib/json.js","../node_modules/@dagrejs/graphlib/lib/alg/components.js","../node_modules/@dagrejs/graphlib/lib/data/priority-queue.js","../node_modules/@dagrejs/graphlib/lib/alg/dijkstra.js","../node_modules/@dagrejs/graphlib/lib/alg/dijkstra-all.js","../node_modules/@dagrejs/graphlib/lib/alg/tarjan.js","../node_modules/@dagrejs/graphlib/lib/alg/find-cycles.js","../node_modules/@dagrejs/graphlib/lib/alg/floyd-warshall.js","../node_modules/@dagrejs/graphlib/lib/alg/topsort.js","../node_modules/@dagrejs/graphlib/lib/alg/is-acyclic.js","../node_modules/@dagrejs/graphlib/lib/alg/dfs.js","../node_modules/@dagrejs/graphlib/lib/alg/postorder.js","../node_modules/@dagrejs/graphlib/lib/alg/preorder.js","../node_modules/@dagrejs/graphlib/lib/alg/prim.js","../node_modules/@dagrejs/graphlib/lib/alg/index.js","../node_modules/@dagrejs/graphlib/index.js","../node_modules/@dagrejs/dagre/lib/data/list.js","../node_modules/@dagrejs/dagre/lib/greedy-fas.js","../node_modules/@dagrejs/dagre/lib/util.js","../node_modules/@dagrejs/dagre/lib/acyclic.js","../node_modules/@dagrejs/dagre/lib/normalize.js","../node_modules/@dagrejs/dagre/lib/rank/util.js","../node_modules/@dagrejs/dagre/lib/rank/feasible-tree.js","../node_modules/@dagrejs/dagre/lib/rank/network-simplex.js","../node_modules/@dagrejs/dagre/lib/rank/index.js","../node_modules/@dagrejs/dagre/lib/parent-dummy-chains.js","../node_modules/@dagrejs/dagre/lib/nesting-graph.js","../node_modules/@dagrejs/dagre/lib/add-border-segments.js","../node_modules/@dagrejs/dagre/lib/coordinate-system.js","../node_modules/@dagrejs/dagre/lib/order/init-order.js","../node_modules/@dagrejs/dagre/lib/order/cross-count.js","../node_modules/@dagrejs/dagre/lib/order/barycenter.js","../node_modules/@dagrejs/dagre/lib/order/resolve-conflicts.js","../node_modules/@dagrejs/dagre/lib/order/sort.js","../node_modules/@dagrejs/dagre/lib/order/sort-subgraph.js","../node_modules/@dagrejs/dagre/lib/order/build-layer-graph.js","../node_modules/@dagrejs/dagre/lib/order/add-subgraph-constraints.js","../node_modules/@dagrejs/dagre/lib/order/index.js","../node_modules/@dagrejs/dagre/lib/position/bk.js","../node_modules/@dagrejs/dagre/lib/position/index.js","../node_modules/@dagrejs/dagre/lib/layout.js","../node_modules/@dagrejs/dagre/lib/debug.js","../node_modules/@dagrejs/dagre/lib/version.js","../node_modules/@dagrejs/dagre/index.js","../src/errors.ts","../src/parser.ts","../src/layout.ts","../src/edge-routing.ts","../src/renderer.ts","../src/themes/default.ts","../src/themes/dark.ts","../src/index.ts"],"sourcesContent":["\"use strict\";\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nclass Graph {\n  _isDirected = true;\n  _isMultigraph = false;\n  _isCompound = false;\n\n  // Label for the graph itself\n  _label;\n\n  // Defaults to be set when creating a new node\n  _defaultNodeLabelFn = () => undefined;\n\n  // Defaults to be set when creating a new edge\n  _defaultEdgeLabelFn = () => undefined;\n\n  // v -> label\n  _nodes = {};\n\n  // v -> edgeObj\n  _in = {};\n\n  // u -> v -> Number\n  _preds = {};\n\n  // v -> edgeObj\n  _out = {};\n\n  // v -> w -> Number\n  _sucs = {};\n\n  // e -> edgeObj\n  _edgeObjs = {};\n\n  // e -> label\n  _edgeLabels = {};\n\n  /* Number of nodes in the graph. Should only be changed by the implementation. */\n  _nodeCount = 0;\n\n  /* Number of edges in the graph. Should only be changed by the implementation. */\n  _edgeCount = 0;\n\n  _parent;\n\n  _children;\n\n  constructor(opts) {\n    if (opts) {\n      this._isDirected = Object.hasOwn(opts, \"directed\") ? opts.directed : true;\n      this._isMultigraph = Object.hasOwn(opts, \"multigraph\") ? opts.multigraph : false;\n      this._isCompound = Object.hasOwn(opts, \"compound\") ? opts.compound : false;\n    }\n\n    if (this._isCompound) {\n      // v -> parent\n      this._parent = {};\n\n      // v -> children\n      this._children = {};\n      this._children[GRAPH_NODE] = {};\n    }\n  }\n\n  /* === Graph functions ========= */\n\n  /**\n   * Whether graph was created with 'directed' flag set to true or not.\n   */\n  isDirected() {\n    return this._isDirected;\n  }\n\n  /**\n   * Whether graph was created with 'multigraph' flag set to true or not.\n   */\n  isMultigraph() {\n    return this._isMultigraph;\n  }\n\n  /**\n   * Whether graph was created with 'compound' flag set to true or not.\n   */\n  isCompound() {\n    return this._isCompound;\n  }\n\n  /**\n   * Sets the label of the graph.\n   */\n  setGraph(label) {\n    this._label = label;\n    return this;\n  }\n\n  /**\n   * Gets the graph label.\n   */\n  graph() {\n    return this._label;\n  }\n\n\n  /* === Node functions ========== */\n\n  /**\n   * Sets the default node label. If newDefault is a function, it will be\n   * invoked ach time when setting a label for a node. Otherwise, this label\n   * will be assigned as default label in case if no label was specified while\n   * setting a node.\n   * Complexity: O(1).\n   */\n  setDefaultNodeLabel(newDefault) {\n    this._defaultNodeLabelFn = newDefault;\n    if (typeof newDefault !== 'function') {\n      this._defaultNodeLabelFn = () => newDefault;\n    }\n\n    return this;\n  }\n\n  /**\n   * Gets the number of nodes in the graph.\n   * Complexity: O(1).\n   */\n  nodeCount() {\n    return this._nodeCount;\n  }\n\n  /**\n   * Gets all nodes of the graph. Note, the in case of compound graph subnodes are\n   * not included in list.\n   * Complexity: O(1).\n   */\n  nodes() {\n    return Object.keys(this._nodes);\n  }\n\n  /**\n   * Gets list of nodes without in-edges.\n   * Complexity: O(|V|).\n   */\n  sources() {\n    var self = this;\n    return this.nodes().filter(v => Object.keys(self._in[v]).length === 0);\n  }\n\n  /**\n   * Gets list of nodes without out-edges.\n   * Complexity: O(|V|).\n   */\n  sinks() {\n    var self = this;\n    return this.nodes().filter(v => Object.keys(self._out[v]).length === 0);\n  }\n\n  /**\n   * Invokes setNode method for each node in names list.\n   * Complexity: O(|names|).\n   */\n  setNodes(vs, value) {\n    var args = arguments;\n    var self = this;\n    vs.forEach(function(v) {\n      if (args.length > 1) {\n        self.setNode(v, value);\n      } else {\n        self.setNode(v);\n      }\n    });\n    return this;\n  }\n\n  /**\n   * Creates or updates the value for the node v in the graph. If label is supplied\n   * it is set as the value for the node. If label is not supplied and the node was\n   * created by this call then the default node label will be assigned.\n   * Complexity: O(1).\n   */\n  setNode(v, value) {\n    if (Object.hasOwn(this._nodes, v)) {\n      if (arguments.length > 1) {\n        this._nodes[v] = value;\n      }\n      return this;\n    }\n\n    this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n    if (this._isCompound) {\n      this._parent[v] = GRAPH_NODE;\n      this._children[v] = {};\n      this._children[GRAPH_NODE][v] = true;\n    }\n    this._in[v] = {};\n    this._preds[v] = {};\n    this._out[v] = {};\n    this._sucs[v] = {};\n    ++this._nodeCount;\n    return this;\n  }\n\n  /**\n   * Gets the label of node with specified name.\n   * Complexity: O(|V|).\n   */\n  node(v) {\n    return this._nodes[v];\n  }\n\n  /**\n   * Detects whether graph has a node with specified name or not.\n   */\n  hasNode(v) {\n    return Object.hasOwn(this._nodes, v);\n  }\n\n  /**\n   * Remove the node with the name from the graph or do nothing if the node is not in\n   * the graph. If the node was removed this function also removes any incident\n   * edges.\n   * Complexity: O(1).\n   */\n  removeNode(v) {\n    var self = this;\n    if (Object.hasOwn(this._nodes, v)) {\n      var removeEdge = e => self.removeEdge(self._edgeObjs[e]);\n      delete this._nodes[v];\n      if (this._isCompound) {\n        this._removeFromParentsChildList(v);\n        delete this._parent[v];\n        this.children(v).forEach(function(child) {\n          self.setParent(child);\n        });\n        delete this._children[v];\n      }\n      Object.keys(this._in[v]).forEach(removeEdge);\n      delete this._in[v];\n      delete this._preds[v];\n      Object.keys(this._out[v]).forEach(removeEdge);\n      delete this._out[v];\n      delete this._sucs[v];\n      --this._nodeCount;\n    }\n    return this;\n  }\n\n  /**\n   * Sets node p as a parent for node v if it is defined, or removes the\n   * parent for v if p is undefined. Method throws an exception in case of\n   * invoking it in context of noncompound graph.\n   * Average-case complexity: O(1).\n   */\n  setParent(v, parent) {\n    if (!this._isCompound) {\n      throw new Error(\"Cannot set parent in a non-compound graph\");\n    }\n\n    if (parent === undefined) {\n      parent = GRAPH_NODE;\n    } else {\n      // Coerce parent to string\n      parent += \"\";\n      for (var ancestor = parent; ancestor !== undefined; ancestor = this.parent(ancestor)) {\n        if (ancestor === v) {\n          throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n              \" would create a cycle\");\n        }\n      }\n\n      this.setNode(parent);\n    }\n\n    this.setNode(v);\n    this._removeFromParentsChildList(v);\n    this._parent[v] = parent;\n    this._children[parent][v] = true;\n    return this;\n  }\n\n  _removeFromParentsChildList(v) {\n    delete this._children[this._parent[v]][v];\n  }\n\n  /**\n   * Gets parent node for node v.\n   * Complexity: O(1).\n   */\n  parent(v) {\n    if (this._isCompound) {\n      var parent = this._parent[v];\n      if (parent !== GRAPH_NODE) {\n        return parent;\n      }\n    }\n  }\n\n  /**\n   * Gets list of direct children of node v.\n   * Complexity: O(1).\n   */\n  children(v = GRAPH_NODE) {\n    if (this._isCompound) {\n      var children = this._children[v];\n      if (children) {\n        return Object.keys(children);\n      }\n    } else if (v === GRAPH_NODE) {\n      return this.nodes();\n    } else if (this.hasNode(v)) {\n      return [];\n    }\n  }\n\n  /**\n   * Return all nodes that are predecessors of the specified node or undefined if node v is not in\n   * the graph. Behavior is undefined for undirected graphs - use neighbors instead.\n   * Complexity: O(|V|).\n   */\n  predecessors(v) {\n    var predsV = this._preds[v];\n    if (predsV) {\n      return Object.keys(predsV);\n    }\n  }\n\n  /**\n   * Return all nodes that are successors of the specified node or undefined if node v is not in\n   * the graph. Behavior is undefined for undirected graphs - use neighbors instead.\n   * Complexity: O(|V|).\n   */\n  successors(v) {\n    var sucsV = this._sucs[v];\n    if (sucsV) {\n      return Object.keys(sucsV);\n    }\n  }\n\n  /**\n   * Return all nodes that are predecessors or successors of the specified node or undefined if\n   * node v is not in the graph.\n   * Complexity: O(|V|).\n   */\n  neighbors(v) {\n    var preds = this.predecessors(v);\n    if (preds) {\n      const union = new Set(preds);\n      for (var succ of this.successors(v)) {\n        union.add(succ);\n      }\n\n      return Array.from(union.values());\n    }\n  }\n\n  isLeaf(v) {\n    var neighbors;\n    if (this.isDirected()) {\n      neighbors = this.successors(v);\n    } else {\n      neighbors = this.neighbors(v);\n    }\n    return neighbors.length === 0;\n  }\n\n  /**\n   * Creates new graph with nodes filtered via filter. Edges incident to rejected node\n   * are also removed. In case of compound graph, if parent is rejected by filter,\n   * than all its children are rejected too.\n   * Average-case complexity: O(|E|+|V|).\n   */\n  filterNodes(filter) {\n    var copy = new this.constructor({\n      directed: this._isDirected,\n      multigraph: this._isMultigraph,\n      compound: this._isCompound\n    });\n\n    copy.setGraph(this.graph());\n\n    var self = this;\n    Object.entries(this._nodes).forEach(function([v, value]) {\n      if (filter(v)) {\n        copy.setNode(v, value);\n      }\n    });\n\n    Object.values(this._edgeObjs).forEach(function(e) {\n      if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n        copy.setEdge(e, self.edge(e));\n      }\n    });\n\n    var parents = {};\n    function findParent(v) {\n      var parent = self.parent(v);\n      if (parent === undefined || copy.hasNode(parent)) {\n        parents[v] = parent;\n        return parent;\n      } else if (parent in parents) {\n        return parents[parent];\n      } else {\n        return findParent(parent);\n      }\n    }\n\n    if (this._isCompound) {\n      copy.nodes().forEach(v => copy.setParent(v, findParent(v)));\n    }\n\n    return copy;\n  }\n\n  /* === Edge functions ========== */\n\n  /**\n   * Sets the default edge label or factory function. This label will be\n   * assigned as default label in case if no label was specified while setting\n   * an edge or this function will be invoked each time when setting an edge\n   * with no label specified and returned value * will be used as a label for edge.\n   * Complexity: O(1).\n   */\n  setDefaultEdgeLabel(newDefault) {\n    this._defaultEdgeLabelFn = newDefault;\n    if (typeof newDefault !== 'function') {\n      this._defaultEdgeLabelFn = () => newDefault;\n    }\n\n    return this;\n  }\n\n  /**\n   * Gets the number of edges in the graph.\n   * Complexity: O(1).\n   */\n  edgeCount() {\n    return this._edgeCount;\n  }\n\n  /**\n   * Gets edges of the graph. In case of compound graph subgraphs are not considered.\n   * Complexity: O(|E|).\n   */\n  edges() {\n    return Object.values(this._edgeObjs);\n  }\n\n  /**\n   * Establish an edges path over the nodes in nodes list. If some edge is already\n   * exists, it will update its label, otherwise it will create an edge between pair\n   * of nodes with label provided or default label if no label provided.\n   * Complexity: O(|nodes|).\n   */\n  setPath(vs, value) {\n    var self = this;\n    var args = arguments;\n    vs.reduce(function(v, w) {\n      if (args.length > 1) {\n        self.setEdge(v, w, value);\n      } else {\n        self.setEdge(v, w);\n      }\n      return w;\n    });\n    return this;\n  }\n\n  /**\n   * Creates or updates the label for the edge (v, w) with the optionally supplied\n   * name. If label is supplied it is set as the value for the edge. If label is not\n   * supplied and the edge was created by this call then the default edge label will\n   * be assigned. The name parameter is only useful with multigraphs.\n   */\n  setEdge() {\n    var v, w, name, value;\n    var valueSpecified = false;\n    var arg0 = arguments[0];\n\n    if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n      v = arg0.v;\n      w = arg0.w;\n      name = arg0.name;\n      if (arguments.length === 2) {\n        value = arguments[1];\n        valueSpecified = true;\n      }\n    } else {\n      v = arg0;\n      w = arguments[1];\n      name = arguments[3];\n      if (arguments.length > 2) {\n        value = arguments[2];\n        valueSpecified = true;\n      }\n    }\n\n    v = \"\" + v;\n    w = \"\" + w;\n    if (name !== undefined) {\n      name = \"\" + name;\n    }\n\n    var e = edgeArgsToId(this._isDirected, v, w, name);\n    if (Object.hasOwn(this._edgeLabels, e)) {\n      if (valueSpecified) {\n        this._edgeLabels[e] = value;\n      }\n      return this;\n    }\n\n    if (name !== undefined && !this._isMultigraph) {\n      throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n    }\n\n    // It didn't exist, so we need to create it.\n    // First ensure the nodes exist.\n    this.setNode(v);\n    this.setNode(w);\n\n    this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n    var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n    // Ensure we add undirected edges in a consistent way.\n    v = edgeObj.v;\n    w = edgeObj.w;\n\n    Object.freeze(edgeObj);\n    this._edgeObjs[e] = edgeObj;\n    incrementOrInitEntry(this._preds[w], v);\n    incrementOrInitEntry(this._sucs[v], w);\n    this._in[w][e] = edgeObj;\n    this._out[v][e] = edgeObj;\n    this._edgeCount++;\n    return this;\n  }\n\n  /**\n   * Gets the label for the specified edge.\n   * Complexity: O(1).\n   */\n  edge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    return this._edgeLabels[e];\n  }\n\n  /**\n   * Gets the label for the specified edge and converts it to an object.\n   * Complexity: O(1)\n   */\n  edgeAsObj() {\n    const edge = this.edge(...arguments);\n    if (typeof edge !== \"object\") {\n      return {label: edge};\n    }\n\n    return edge;\n  }\n\n  /**\n   * Detects whether the graph contains specified edge or not. No subgraphs are considered.\n   * Complexity: O(1).\n   */\n  hasEdge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    return Object.hasOwn(this._edgeLabels, e);\n  }\n\n  /**\n   * Removes the specified edge from the graph. No subgraphs are considered.\n   * Complexity: O(1).\n   */\n  removeEdge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    var edge = this._edgeObjs[e];\n    if (edge) {\n      v = edge.v;\n      w = edge.w;\n      delete this._edgeLabels[e];\n      delete this._edgeObjs[e];\n      decrementOrRemoveEntry(this._preds[w], v);\n      decrementOrRemoveEntry(this._sucs[v], w);\n      delete this._in[w][e];\n      delete this._out[v][e];\n      this._edgeCount--;\n    }\n    return this;\n  }\n\n  /**\n   * Return all edges that point to the node v. Optionally filters those edges down to just those\n   * coming from node u. Behavior is undefined for undirected graphs - use nodeEdges instead.\n   * Complexity: O(|E|).\n   */\n  inEdges(v, u) {\n    var inV = this._in[v];\n    if (inV) {\n      var edges = Object.values(inV);\n      if (!u) {\n        return edges;\n      }\n      return edges.filter(edge => edge.v === u);\n    }\n  }\n\n  /**\n   * Return all edges that are pointed at by node v. Optionally filters those edges down to just\n   * those point to w. Behavior is undefined for undirected graphs - use nodeEdges instead.\n   * Complexity: O(|E|).\n   */\n  outEdges(v, w) {\n    var outV = this._out[v];\n    if (outV) {\n      var edges = Object.values(outV);\n      if (!w) {\n        return edges;\n      }\n      return edges.filter(edge => edge.w === w);\n    }\n  }\n\n  /**\n   * Returns all edges to or from node v regardless of direction. Optionally filters those edges\n   * down to just those between nodes v and w regardless of direction.\n   * Complexity: O(|E|).\n   */\n  nodeEdges(v, w) {\n    var inEdges = this.inEdges(v, w);\n    if (inEdges) {\n      return inEdges.concat(this.outEdges(v, w));\n    }\n  }\n}\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (name === undefined ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n\nmodule.exports = Graph;\n","module.exports = '2.2.4';\n","// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n","var Graph = require(\"./graph\");\n\nmodule.exports = {\n  write: write,\n  read: read\n};\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a string with\n * JSON.stringify. The graph can later be restored using json.read.\n */\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound()\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g)\n  };\n\n  if (g.graph() !== undefined) {\n    json.value = structuredClone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return g.nodes().map(function(v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (nodeValue !== undefined) {\n      node.value = nodeValue;\n    }\n    if (parent !== undefined) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return g.edges().map(function(e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (e.name !== undefined) {\n      edge.name = e.name;\n    }\n    if (edgeValue !== undefined) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @example\n * var g2 = graphlib.json.read(JSON.parse(str));\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n */\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  json.nodes.forEach(function(entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  json.edges.forEach(function(entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n","module.exports = components;\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (Object.hasOwn(visited, v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    g.successors(v).forEach(dfs);\n    g.predecessors(v).forEach(dfs);\n  }\n\n  g.nodes().forEach(function(v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n","/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nclass PriorityQueue {\n  _arr = [];\n  _keyIndices = {};\n\n  /**\n   * Returns the number of elements in the queue. Takes `O(1)` time.\n   */\n  size() {\n    return this._arr.length;\n  }\n\n  /**\n   * Returns the keys that are in the queue. Takes `O(n)` time.\n   */\n  keys() {\n    return this._arr.map(function(x) { return x.key; });\n  }\n\n  /**\n   * Returns `true` if **key** is in the queue and `false` if not.\n   */\n  has(key) {\n    return Object.hasOwn(this._keyIndices, key);\n  }\n\n  /**\n   * Returns the priority for **key**. If **key** is not present in the queue\n   * then this function returns `undefined`. Takes `O(1)` time.\n   *\n   * @param {Object} key\n   */\n  priority(key) {\n    var index = this._keyIndices[key];\n    if (index !== undefined) {\n      return this._arr[index].priority;\n    }\n  }\n\n  /**\n   * Returns the key for the minimum element in this queue. If the queue is\n   * empty this function throws an Error. Takes `O(1)` time.\n   */\n  min() {\n    if (this.size() === 0) {\n      throw new Error(\"Queue underflow\");\n    }\n    return this._arr[0].key;\n  }\n\n  /**\n   * Inserts a new key into the priority queue. If the key already exists in\n   * the queue this function returns `false`; otherwise it will return `true`.\n   * Takes `O(n)` time.\n   *\n   * @param {Object} key the key to add\n   * @param {Number} priority the initial priority for the key\n   */\n  add(key, priority) {\n    var keyIndices = this._keyIndices;\n    key = String(key);\n    if (!Object.hasOwn(keyIndices, key)) {\n      var arr = this._arr;\n      var index = arr.length;\n      keyIndices[key] = index;\n      arr.push({key: key, priority: priority});\n      this._decrease(index);\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n   */\n  removeMin() {\n    this._swap(0, this._arr.length - 1);\n    var min = this._arr.pop();\n    delete this._keyIndices[min.key];\n    this._heapify(0);\n    return min.key;\n  }\n\n  /**\n   * Decreases the priority for **key** to **priority**. If the new priority is\n   * greater than the previous priority, this function will throw an Error.\n   *\n   * @param {Object} key the key for which to raise priority\n   * @param {Number} priority the new priority for the key\n   */\n  decrease(key, priority) {\n    var index = this._keyIndices[key];\n    if (priority > this._arr[index].priority) {\n      throw new Error(\"New priority is greater than current priority. \" +\n          \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n    }\n    this._arr[index].priority = priority;\n    this._decrease(index);\n  }\n\n  _heapify(i) {\n    var arr = this._arr;\n    var l = 2 * i;\n    var r = l + 1;\n    var largest = i;\n    if (l < arr.length) {\n      largest = arr[l].priority < arr[largest].priority ? l : largest;\n      if (r < arr.length) {\n        largest = arr[r].priority < arr[largest].priority ? r : largest;\n      }\n      if (largest !== i) {\n        this._swap(i, largest);\n        this._heapify(largest);\n      }\n    }\n  }\n\n  _decrease(index) {\n    var arr = this._arr;\n    var priority = arr[index].priority;\n    var parent;\n    while (index !== 0) {\n      parent = index >> 1;\n      if (arr[parent].priority < priority) {\n        break;\n      }\n      this._swap(index, parent);\n      index = parent;\n    }\n  }\n\n  _swap(i, j) {\n    var arr = this._arr;\n    var keyIndices = this._keyIndices;\n    var origArrI = arr[i];\n    var origArrJ = arr[j];\n    arr[i] = origArrJ;\n    arr[j] = origArrI;\n    keyIndices[origArrJ.key] = i;\n    keyIndices[origArrI.key] = j;\n  }\n}\n\nmodule.exports = PriorityQueue;\n","var PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = () => 1;\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(g, String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function(edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function(v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n","var dijkstra = require(\"./dijkstra\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return g.nodes().reduce(function(acc, v) {\n    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n    return acc;\n  }, {});\n}\n","module.exports = tarjan;\n\nfunction tarjan(g) {\n  var index = 0;\n  var stack = [];\n  var visited = {}; // node id -> { onStack, lowlink, index }\n  var results = [];\n\n  function dfs(v) {\n    var entry = visited[v] = {\n      onStack: true,\n      lowlink: index,\n      index: index++\n    };\n    stack.push(v);\n\n    g.successors(v).forEach(function(w) {\n      if (!Object.hasOwn(visited, w)) {\n        dfs(w);\n        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n      } else if (visited[w].onStack) {\n        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n      }\n    });\n\n    if (entry.lowlink === entry.index) {\n      var cmpt = [];\n      var w;\n      do {\n        w = stack.pop();\n        visited[w].onStack = false;\n        cmpt.push(w);\n      } while (v !== w);\n      results.push(cmpt);\n    }\n  }\n\n  g.nodes().forEach(function(v) {\n    if (!Object.hasOwn(visited, v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n","var tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n  return tarjan(g).filter(function(cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n","module.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = () => 1;\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function(v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function(w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function(edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function(k) {\n    var rowK = results[k];\n    nodes.forEach(function(i) {\n      var rowI = results[i];\n      nodes.forEach(function(j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n","function topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (Object.hasOwn(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!Object.hasOwn(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      g.predecessors(node).forEach(visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  g.sinks().forEach(visit);\n\n  if (Object.keys(visited).length !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nclass CycleException extends Error {\n  constructor() {\n    super(...arguments);\n  }\n}\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n","var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n  try {\n    topsort(g);\n  } catch (e) {\n    if (e instanceof topsort.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n","module.exports = dfs;\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * If the order is not \"post\", it will be treated as \"pre\".\n */\nfunction dfs(g, vs, order) {\n  if (!Array.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = g.isDirected() ? v => g.successors(v) : v => g.neighbors(v);\n  var orderFunc = order === \"post\" ? postOrderDfs : preOrderDfs;\n\n  var acc = [];\n  var visited = {};\n  vs.forEach(v => {\n    if (!g.hasNode(v)) {\n      throw new Error(\"Graph does not have node: \" + v);\n    }\n\n    orderFunc(v, navigation, visited, acc);\n  });\n\n  return acc;\n}\n\nfunction postOrderDfs(v, navigation, visited, acc) {\n  var stack = [[v, false]];\n  while (stack.length > 0) {\n    var curr = stack.pop();\n    if (curr[1]) {\n      acc.push(curr[0]);\n    } else {\n      if (!Object.hasOwn(visited, curr[0])) {\n        visited[curr[0]] = true;\n        stack.push([curr[0], true]);\n        forEachRight(navigation(curr[0]), w => stack.push([w, false]));\n      }\n    }\n  }\n}\n\nfunction preOrderDfs(v, navigation, visited, acc) {\n  var stack = [v];\n  while (stack.length > 0) {\n    var curr = stack.pop();\n    if (!Object.hasOwn(visited, curr)) {\n      visited[curr] = true;\n      acc.push(curr);\n      forEachRight(navigation(curr), w => stack.push(w));\n    }\n  }\n}\n\nfunction forEachRight(array, iteratee) {\n  var length = array.length;\n  while (length--) {\n    iteratee(array[length], length, array);\n  }\n\n  return array;\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, \"post\");\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, \"pre\");\n}\n","var Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n  var result = new Graph();\n  var parents = {};\n  var pq = new PriorityQueue();\n  var v;\n\n  function updateNeighbors(edge) {\n    var w = edge.v === v ? edge.w : edge.v;\n    var pri = pq.priority(w);\n    if (pri !== undefined) {\n      var edgeWeight = weightFunc(edge);\n      if (edgeWeight < pri) {\n        parents[w] = v;\n        pq.decrease(w, edgeWeight);\n      }\n    }\n  }\n\n  if (g.nodeCount() === 0) {\n    return result;\n  }\n\n  g.nodes().forEach(function(v) {\n    pq.add(v, Number.POSITIVE_INFINITY);\n    result.setNode(v);\n  });\n\n  // Start from an arbitrary node\n  pq.decrease(g.nodes()[0], 0);\n\n  var init = false;\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    if (Object.hasOwn(parents, v)) {\n      result.setEdge(v, parents[v]);\n    } else if (init) {\n      throw new Error(\"Input graph is not connected: \" + g);\n    } else {\n      init = true;\n    }\n\n    g.nodeEdges(v).forEach(updateNeighbors);\n  }\n\n  return result;\n}\n","module.exports = {\n  components: require(\"./components\"),\n  dijkstra: require(\"./dijkstra\"),\n  dijkstraAll: require(\"./dijkstra-all\"),\n  findCycles: require(\"./find-cycles\"),\n  floydWarshall: require(\"./floyd-warshall\"),\n  isAcyclic: require(\"./is-acyclic\"),\n  postorder: require(\"./postorder\"),\n  preorder: require(\"./preorder\"),\n  prim: require(\"./prim\"),\n  tarjan: require(\"./tarjan\"),\n  topsort: require(\"./topsort\")\n};\n","/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n  Graph: lib.Graph,\n  json: require(\"./lib/json\"),\n  alg: require(\"./lib/alg\"),\n  version: lib.version\n};\n","/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nclass List {\n  constructor() {\n    let sentinel = {};\n    sentinel._next = sentinel._prev = sentinel;\n    this._sentinel = sentinel;\n  }\n\n  dequeue() {\n    let sentinel = this._sentinel;\n    let entry = sentinel._prev;\n    if (entry !== sentinel) {\n      unlink(entry);\n      return entry;\n    }\n  }\n\n  enqueue(entry) {\n    let sentinel = this._sentinel;\n    if (entry._prev && entry._next) {\n      unlink(entry);\n    }\n    entry._next = sentinel._next;\n    sentinel._next._prev = entry;\n    sentinel._next = entry;\n    entry._prev = sentinel;\n  }\n\n  toString() {\n    let strs = [];\n    let sentinel = this._sentinel;\n    let curr = sentinel._prev;\n    while (curr !== sentinel) {\n      strs.push(JSON.stringify(curr, filterOutLinks));\n      curr = curr._prev;\n    }\n    return \"[\" + strs.join(\", \") + \"]\";\n  }\n}\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n\nmodule.exports = List;\n","let Graph = require(\"@dagrejs/graphlib\").Graph;\nlet List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nlet DEFAULT_WEIGHT_FN = () => 1;\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  let state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  let results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return results.flatMap(e => g.outEdges(e.v, e.w));\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  let results = [];\n  let sources = buckets[buckets.length - 1];\n  let sinks = buckets[0];\n\n  let entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (let i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  let results = collectPredecessors ? [] : undefined;\n\n  g.inEdges(entry.v).forEach(edge => {\n    let weight = g.edge(edge);\n    let uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  g.outEdges(entry.v).forEach(edge => {\n    let weight = g.edge(edge);\n    let w = edge.w;\n    let wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  let fasGraph = new Graph();\n  let maxIn = 0;\n  let maxOut = 0;\n\n  g.nodes().forEach(v => {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  g.edges().forEach(e => {\n    let prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    let weight = weightFn(e);\n    let edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  let buckets = range(maxOut + maxIn + 3).map(() => new List());\n  let zeroIdx = maxIn + 1;\n\n  fasGraph.nodes().forEach(v => {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n\nfunction range(limit) {\n  const range = [];\n  for (let i = 0; i < limit; i++) {\n    range.push(i);\n  }\n\n  return range;\n}\n","/* eslint \"no-console\": off */\n\n\"use strict\";\n\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = {\n  addBorderNode,\n  addDummyNode,\n  applyWithChunking,\n  asNonCompoundGraph,\n  buildLayerMatrix,\n  intersectRect,\n  mapValues,\n  maxRank,\n  normalizeRanks,\n  notime,\n  partition,\n  pick,\n  predecessorWeights,\n  range,\n  removeEmptyRanks,\n  simplify,\n  successorWeights,\n  time,\n  uniqueId,\n  zipObject,\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v = name;\n  while (g.hasNode(v)) {\n    v = uniqueId(name);\n  }\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  let simplified = new Graph().setGraph(g.graph());\n  g.nodes().forEach(v => simplified.setNode(v, g.node(v)));\n  g.edges().forEach(e => {\n    let simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    let label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  let simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  g.nodes().forEach(v => {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  g.edges().forEach(e => {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  let weightMap = g.nodes().map(v => {\n    let sucs = {};\n    g.outEdges(v).forEach(e => {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  let weightMap = g.nodes().map(v => {\n    let preds = {};\n    g.inEdges(v).forEach(e => {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  let x = rect.x;\n  let y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  let dx = point.x - x;\n  let dy = point.y - y;\n  let w = rect.width / 2;\n  let h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  let sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  let layering = range(maxRank(g) + 1).map(() => []);\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    let rank = node.rank;\n    if (rank !== undefined) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  let nodeRanks = g.nodes().map(v => {\n    let rank = g.node(v).rank;\n    if (rank === undefined) {\n      return Number.MAX_VALUE;\n    }\n\n    return rank;\n  });\n  let min = applyWithChunking(Math.min, nodeRanks);\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (Object.hasOwn(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  let nodeRanks = g.nodes().map(v => g.node(v).rank);\n  let offset = applyWithChunking(Math.min, nodeRanks);\n\n  let layers = [];\n  g.nodes().forEach(v => {\n    let rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  let delta = 0;\n  let nodeRankFactor = g.graph().nodeRankFactor;\n  Array.from(layers).forEach((vs, i) => {\n    if (vs === undefined && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (vs !== undefined && delta) {\n      vs.forEach(v => g.node(v).rank += delta);\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  let node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction splitToChunks(array, chunkSize = CHUNKING_THRESHOLD) {\n  const chunks = [];\n  for (let i = 0; i < array.length; i += chunkSize) {\n    const chunk = array.slice(i, i + chunkSize);\n    chunks.push(chunk);\n  }\n  return chunks;\n}\n\nconst CHUNKING_THRESHOLD = 65535;\n\nfunction applyWithChunking(fn, argsArray) {\n  if(argsArray.length > CHUNKING_THRESHOLD) {\n    const chunks = splitToChunks(argsArray);\n    return fn.apply(null, chunks.map(chunk => fn.apply(null, chunk)));\n  } else {\n    return fn.apply(null, argsArray);\n  }\n}\n\nfunction maxRank(g) {\n  const nodes = g.nodes();\n  const nodeRanks = nodes.map(v => {\n    let rank = g.node(v).rank;\n    if (rank === undefined) {\n      return Number.MIN_VALUE;\n    }\n    return rank;\n  });\n\n  return applyWithChunking(Math.max, nodeRanks);\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  let result = { lhs: [], rhs: [] };\n  collection.forEach(value => {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  let start = Date.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (Date.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n\nlet idCounter = 0;\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return prefix + (\"\" + id);\n}\n\nfunction range(start, limit, step = 1) {\n  if (limit == null) {\n    limit = start;\n    start = 0;\n  }\n\n  let endCon = (i) => i < limit;\n  if (step < 0) {\n    endCon = (i) => limit < i;\n  }\n\n  const range = [];\n  for (let i = start; endCon(i); i += step) {\n    range.push(i);\n  }\n\n  return range;\n}\n\nfunction pick(source, keys) {\n  const dest = {};\n  for (const key of keys) {\n    if (source[key] !== undefined) {\n      dest[key] = source[key];\n    }\n  }\n\n  return dest;\n}\n\nfunction mapValues(obj, funcOrProp) {\n  let func = funcOrProp;\n  if (typeof funcOrProp === 'string') {\n    func = (val) => val[funcOrProp];\n  }\n\n  return Object.entries(obj).reduce((acc, [k, v]) => {\n    acc[k] = func(v, k);\n    return acc;\n  }, {});\n}\n\nfunction zipObject(props, values) {\n  return props.reduce((acc, key, i) => {\n    acc[key] = values[i];\n    return acc;\n  }, {});\n}\n","\"use strict\";\n\nlet greedyFAS = require(\"./greedy-fas\");\nlet uniqueId = require(\"./util\").uniqueId;\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  let fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  fas.forEach(e => {\n    let label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return e => {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  let fas = [];\n  let stack = {};\n  let visited = {};\n\n  function dfs(v) {\n    if (Object.hasOwn(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    g.outEdges(v).forEach(e => {\n      if (Object.hasOwn(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  g.nodes().forEach(dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  g.edges().forEach(e => {\n    let label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      let forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n","\"use strict\";\n\nlet util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  g.edges().forEach(edge => normalizeEdge(g, edge));\n}\n\nfunction normalizeEdge(g, e) {\n  let v = e.v;\n  let vRank = g.node(v).rank;\n  let w = e.w;\n  let wRank = g.node(w).rank;\n  let name = e.name;\n  let edgeLabel = g.edge(e);\n  let labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  let dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  g.graph().dummyChains.forEach(v => {\n    let node = g.node(v);\n    let origLabel = node.edgeLabel;\n    let w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === \"edge-label\") {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n","\"use strict\";\n\nconst { applyWithChunking } = require(\"../util\");\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (Object.hasOwn(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    let outEdgesMinLens = g.outEdges(v).map(e => {\n      if (e == null) {\n        return Number.POSITIVE_INFINITY;\n      }\n\n      return dfs(e.w) - g.edge(e).minlen;\n    });\n\n    var rank = applyWithChunking(Math.min, outEdgesMinLens);\n\n    if (rank === Number.POSITIVE_INFINITY) {\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  g.sources().forEach(dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","\"use strict\";\n\nvar Graph = require(\"@dagrejs/graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    g.nodeEdges(v).forEach(e => {\n      var edgeV = e.v,\n        w = (v === edgeV) ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  t.nodes().forEach(dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  const edges = g.edges();\n\n  return edges.reduce((acc, edge) => {\n    let edgeSlack = Number.POSITIVE_INFINITY;\n    if (t.hasNode(edge.v) !== t.hasNode(edge.w)) {\n      edgeSlack = slack(g, edge);\n    }\n\n    if (edgeSlack < acc[0]) {\n      return [edgeSlack, edge];\n    }\n\n    return acc;\n  }, [Number.POSITIVE_INFINITY, null])[1];\n}\n\nfunction shiftRanks(t, g, delta) {\n  t.nodes().forEach(v => g.node(v).rank += delta);\n}\n","\"use strict\";\n\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"@dagrejs/graphlib\").alg.preorder;\nvar postorder = require(\"@dagrejs/graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  initRank(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  vs.forEach(v => assignCutValue(t, g, v));\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  g.nodeEdges(child).forEach(e => {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  tree.neighbors(v).forEach(w => {\n    if (!Object.hasOwn(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return tree.edges().find(e => tree.edge(e).cutvalue < 0);\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = g.edges().filter(edge => {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return candidates.reduce((acc, edge) => {\n    if (slack(g, edge) < slack(g, acc)) {\n      return edge;\n    }\n\n    return acc;\n  });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = t.nodes().find(v => !g.node(v).parent);\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  vs.forEach(v => {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  var ranker = g.graph().ranker;\n  if (ranker instanceof Function) {\n    return ranker(g);\n  }\n\n  switch(g.graph().ranker) {\n  case \"network-simplex\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  case \"none\": break;\n  default: networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n","module.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  let postorderNums = postorder(g);\n\n  g.graph().dummyChains.forEach(v => {\n    let node = g.node(v);\n    let edgeObj = node.edgeObj;\n    let pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    let path = pathData.path;\n    let lca = pathData.lca;\n    let pathIdx = 0;\n    let pathV = path[pathIdx];\n    let ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  let vPath = [];\n  let wPath = [];\n  let low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  let lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  let parent;\n  let lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent &&\n           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  let result = {};\n  let lim = 0;\n\n  function dfs(v) {\n    let low = lim;\n    g.children(v).forEach(dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  g.children().forEach(dfs);\n\n  return result;\n}\n","let util = require(\"./util\");\n\nmodule.exports = {\n  run,\n  cleanup,\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundaries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  let root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  let depths = treeDepths(g);\n  let depthsArr = Object.values(depths);\n  let height = util.applyWithChunking(Math.max, depthsArr) - 1; // Note: depths is an Object not an array\n  let nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  g.edges().forEach(e => g.edge(e).minlen *= nodeSep);\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  let weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  g.children().forEach(child => dfs(g, root, nodeSep, weight, height, depths, child));\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  let children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  let top = util.addBorderNode(g, \"_bt\");\n  let bottom = util.addBorderNode(g, \"_bb\");\n  let label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  children.forEach(child => {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    let childNode = g.node(child);\n    let childTop = childNode.borderTop ? childNode.borderTop : child;\n    let childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    let thisWeight = childNode.borderTop ? weight : 2 * weight;\n    let minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      children.forEach(child => dfs(child, depth + 1));\n    }\n    depths[v] = depth;\n  }\n  g.children().forEach(v => dfs(v, 1));\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return g.edges().reduce((acc, e) => acc + g.edge(e).weight, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  g.edges().forEach(e => {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n","let util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    let children = g.children(v);\n    let node = g.node(v);\n    if (children.length) {\n      children.forEach(dfs);\n    }\n\n    if (Object.hasOwn(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (let rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  g.children().forEach(dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  let label = { width: 0, height: 0, rank: rank, borderType: prop };\n  let prev = sgNode[prop][rank - 1];\n  let curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n","\"use strict\";\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  let rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  let rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  g.nodes().forEach(v => swapWidthHeightOne(g.node(v)));\n  g.edges().forEach(e => swapWidthHeightOne(g.edge(e)));\n}\n\nfunction swapWidthHeightOne(attrs) {\n  let w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  g.nodes().forEach(v => reverseYOne(g.node(v)));\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(reverseYOne);\n    if (Object.hasOwn(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  g.nodes().forEach(v => swapXYOne(g.node(v)));\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(swapXYOne);\n    if (Object.hasOwn(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  let x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n","\"use strict\";\n\nlet util = require(\"../util\");\n\nmodule.exports = initOrder;\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  let visited = {};\n  let simpleNodes = g.nodes().filter(v => !g.children(v).length);\n  let simpleNodesRanks = simpleNodes.map(v => g.node(v).rank);\n  let maxRank = util.applyWithChunking(Math.max, simpleNodesRanks);\n  let layers = util.range(maxRank + 1).map(() => []);\n\n  function dfs(v) {\n    if (visited[v]) return;\n    visited[v] = true;\n    let node = g.node(v);\n    layers[node.rank].push(v);\n    g.successors(v).forEach(dfs);\n  }\n\n  let orderedVs = simpleNodes.sort((a, b) => g.node(a).rank - g.node(b).rank);\n  orderedVs.forEach(dfs);\n\n  return layers;\n}\n","\"use strict\";\n\nlet zipObject = require(\"../util\").zipObject;\n\nmodule.exports = crossCount;\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  let cc = 0;\n  for (let i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  let southPos = zipObject(southLayer, southLayer.map((v, i) => i));\n  let southEntries = northLayer.flatMap(v => {\n    return g.outEdges(v).map(e => {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }).sort((a, b) => a.pos - b.pos);\n  });\n\n  // Build the accumulator tree\n  let firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  let treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  let tree = new Array(treeSize).fill(0);\n\n  // Calculate the weighted crossings\n  let cc = 0;\n  southEntries.forEach(entry => {\n    let index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    let weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  });\n\n  return cc;\n}\n","module.exports = barycenter;\n\nfunction barycenter(g, movable = []) {\n  return movable.map(v => {\n    let inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      let result = inV.reduce((acc, e) => {\n        let edge = g.edge(e),\n          nodeU = g.node(e.v);\n        return {\n          sum: acc.sum + (edge.weight * nodeU.order),\n          weight: acc.weight + edge.weight\n        };\n      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n","\"use strict\";\n\nlet util = require(\"../util\");\n\nmodule.exports = resolveConflicts;\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  let mappedEntries = {};\n  entries.forEach((entry, i) => {\n    let tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (entry.barycenter !== undefined) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  cg.edges().forEach(e => {\n    let entryV = mappedEntries[e.v];\n    let entryW = mappedEntries[e.w];\n    if (entryV !== undefined && entryW !== undefined) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  let sourceSet = Object.values(mappedEntries).filter(entry => !entry.indegree);\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  let entries = [];\n\n  function handleIn(vEntry) {\n    return uEntry => {\n      if (uEntry.merged) {\n        return;\n      }\n      if (uEntry.barycenter === undefined ||\n          vEntry.barycenter === undefined ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return wEntry => {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    let entry = sourceSet.pop();\n    entries.push(entry);\n    entry[\"in\"].reverse().forEach(handleIn(entry));\n    entry.out.forEach(handleOut(entry));\n  }\n\n  return entries.filter(entry => !entry.merged).map(entry => {\n    return util.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n  });\n}\n\nfunction mergeEntries(target, source) {\n  let sum = 0;\n  let weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n","let util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  let parts = util.partition(entries, entry => {\n    return Object.hasOwn(entry, \"barycenter\");\n  });\n  let sortable = parts.lhs,\n    unsortable = parts.rhs.sort((a, b) => b.i - a.i),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  sortable.forEach(entry => {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  let result = { vs: vs.flat(true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  let last;\n  while (unsortable.length && (last = unsortable[unsortable.length - 1]).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return (entryV, entryW) => {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n","let barycenter = require(\"./barycenter\");\nlet resolveConflicts = require(\"./resolve-conflicts\");\nlet sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  let movable = g.children(v);\n  let node = g.node(v);\n  let bl = node ? node.borderLeft : undefined;\n  let br = node ? node.borderRight: undefined;\n  let subgraphs = {};\n\n  if (bl) {\n    movable = movable.filter(w => w !== bl && w !== br);\n  }\n\n  let barycenters = barycenter(g, movable);\n  barycenters.forEach(entry => {\n    if (g.children(entry.v).length) {\n      let subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (Object.hasOwn(subgraphResult, \"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  let entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  let result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = [bl, result.vs, br].flat(true);\n    if (g.predecessors(bl).length) {\n      let blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!Object.hasOwn(result, \"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  entries.forEach(entry => {\n    entry.vs = entry.vs.flatMap(v => {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    });\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (target.barycenter !== undefined) {\n    target.barycenter = (target.barycenter * target.weight +\n                         other.barycenter * other.weight) /\n                        (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n","let Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\nmodule.exports = buildLayerGraph;\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *    5. If `nodesWithRank` is not undefined, it must contains only the nodes\n *       which belong to `g` and belong to `rank`.\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship, nodesWithRank) {\n  if (!nodesWithRank) {\n    nodesWithRank = g.nodes();\n  }\n  let root = createRootNode(g),\n    result = new Graph({ compound: true })\n      .setGraph({ root: root })\n      .setDefaultNodeLabel((v) => g.node(v));\n\n  nodesWithRank.forEach((v) => {\n    let node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      g[relationship](v).forEach(e => {\n        let u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = edge !== undefined ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (Object.hasOwn(node, \"minRank\")) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank]\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = util.uniqueId(\"_root\"))));\n  return v;\n}\n","module.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  let prev = {},\n    rootPrev;\n\n  vs.forEach(v => {\n    let child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      children.forEach(function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.sortBy(subgraphs, \"order\").reduce(function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n","\"use strict\";\n\nlet initOrder = require(\"./init-order\");\nlet crossCount = require(\"./cross-count\");\nlet sortSubgraph = require(\"./sort-subgraph\");\nlet buildLayerGraph = require(\"./build-layer-graph\");\nlet addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\nmodule.exports = order;\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g, opts) {\n  if (opts && typeof opts.customOrder === 'function') {\n    opts.customOrder(g, order);\n    return;\n  }\n\n  let maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, util.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, util.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  let layering = initOrder(g);\n  assignOrder(g, layering);\n\n  if (opts && opts.disableOptimalOrderHeuristic) {\n    return;\n  }\n\n  let bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    let cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = Object.assign({}, layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  // Build an index mapping from rank to the nodes with that rank.\n  // This helps to avoid a quadratic search for all nodes with the same rank as\n  // the current node.\n  const nodesByRank = new Map();\n  const addNodeToRank = (rank, node) => {\n    if (!nodesByRank.has(rank)) {\n      nodesByRank.set(rank, []);\n    }\n    nodesByRank.get(rank).push(node);\n  };\n\n  // Visit the nodes in their original order in the graph, and add each\n  // node to the ranks(s) that it belongs to.\n  for (const v of g.nodes()) {\n    const node = g.node(v);\n    if (typeof node.rank === \"number\") {\n      addNodeToRank(node.rank, v);\n    }\n    // If there is a range of ranks, add it to each, but skip the `node.rank` which\n    // has already had the node added.\n    if (typeof node.minRank === \"number\" && typeof node.maxRank === \"number\") {\n      for (let r = node.minRank; r <= node.maxRank; r++) {\n        if (r !== node.rank) {\n          // Don't add this node to its `node.rank` twice.\n          addNodeToRank(r, v);\n        }\n      }\n    }\n  }\n\n  return ranks.map(function (rank) {\n    return buildLayerGraph(g, rank, relationship, nodesByRank.get(rank) || []);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  let cg = new Graph();\n  layerGraphs.forEach(function(lg) {\n    let root = lg.graph().root;\n    let sorted = sortSubgraph(lg, root, cg, biasRight);\n    sorted.vs.forEach((v, i) => lg.node(v).order = i);\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  Object.values(layering).forEach(layer => layer.forEach((v, i) => g.node(v).order = i));\n}\n","\"use strict\";\n\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: balance\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  let conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    let\n      // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = layer[layer.length - 1];\n\n    layer.forEach((v, i) => {\n      let w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        layer.slice(scanPos, i+1).forEach(scanNode => {\n          g.predecessors(scanNode).forEach(u => {\n            let uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  layering.length && layering.reduce(visitLayer);\n\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  let conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    let v;\n    util.range(southPos, southEnd).forEach(i => {\n      v = south[i];\n      if (g.node(v).dummy) {\n        g.predecessors(v).forEach(u => {\n          let uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    let prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    south.forEach((v, southLookahead) => {\n      if (g.node(v).dummy === \"border\") {\n        let predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  layering.length && layering.reduce(visitLayer);\n\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return g.predecessors(v).find(u => g.node(u).dummy);\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    let tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  let conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    let tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return !!conflicts[v] && Object.hasOwn(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  let root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  layering.forEach(layer => {\n    layer.forEach((v, order) => {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  layering.forEach(layer => {\n    let prevIdx = -1;\n    layer.forEach(v => {\n      let ws = neighborFn(v);\n      if (ws.length) {\n        ws = ws.sort((a, b) => pos[a] - pos[b]);\n        let mp = (ws.length - 1) / 2;\n        for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          let w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  let xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    let stack = blockG.nodes();\n    let elem = stack.pop();\n    let visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce((acc, e) => {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    let min = blockG.outEdges(elem).reduce((acc, e) => {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    let node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  Object.keys(align).forEach(v => xs[v] = xs[root[v]]);\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  let blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  layering.forEach(layer => {\n    let u;\n    layer.forEach(v => {\n      let vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return Object.values(xss).reduce((currentMinAndXs, xs) => {\n    let max = Number.NEGATIVE_INFINITY;\n    let min = Number.POSITIVE_INFINITY;\n\n    Object.entries(xs).forEach(([v, x]) => {\n      let halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    const newMin = max - min;\n    if (newMin < currentMinAndXs[0]) {\n      currentMinAndXs = [newMin, xs];\n    }\n    return currentMinAndXs;\n  }, [Number.POSITIVE_INFINITY, null])[1];\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  let alignToVals = Object.values(alignTo),\n    alignToMin = util.applyWithChunking(Math.min, alignToVals),\n    alignToMax = util.applyWithChunking(Math.max, alignToVals);\n\n  [\"u\", \"d\"].forEach(vert => {\n    [\"l\", \"r\"].forEach(horiz => {\n      let alignment = vert + horiz,\n        xs = xss[alignment];\n\n      if (xs === alignTo) return;\n\n      let xsVals = Object.values(xs);\n      let delta = alignToMin - util.applyWithChunking(Math.min, xsVals);\n      if (horiz !== \"l\") {\n        delta = alignToMax - util.applyWithChunking(Math.max,xsVals);\n      }\n\n      if (delta) {\n        xss[alignment] = util.mapValues(xs, x => x + delta);\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return util.mapValues(xss.ul, (num, v) => {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      let xs = Object.values(xss).map(xs => xs[v]).sort((a, b) => a - b);\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  let layering = util.buildLayerMatrix(g);\n  let conflicts = Object.assign(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  let xss = {};\n  let adjustedLayering;\n  [\"u\", \"d\"].forEach(vert => {\n    adjustedLayering = vert === \"u\" ? layering : Object.values(layering).reverse();\n    [\"l\", \"r\"].forEach(horiz => {\n      if (horiz === \"r\") {\n        adjustedLayering = adjustedLayering.map(inner => {\n          return Object.values(inner).reverse();\n        });\n      }\n\n      let neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      let align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      let xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = util.mapValues(xs, x => -x);\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n\n  let smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return (g, v, w) => {\n    let vLabel = g.node(v);\n    let wLabel = g.node(w);\n    let sum = 0;\n    let delta;\n\n    sum += vLabel.width / 2;\n    if (Object.hasOwn(vLabel, \"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (Object.hasOwn(wLabel, \"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n","\"use strict\";\n\nlet util = require(\"../util\");\nlet positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  Object.entries(positionX(g)).forEach(([v, x]) => g.node(v).x = x);\n}\n\nfunction positionY(g) {\n  let layering = util.buildLayerMatrix(g);\n  let rankSep = g.graph().ranksep;\n  let prevY = 0;\n  layering.forEach(layer => {\n    const maxHeight = layer.reduce((acc, v) => {\n      const height = g.node(v).height;\n      if (acc > height) {\n        return acc;\n      } else {\n        return height;\n      }\n    }, 0);\n    layer.forEach(v => g.node(v).y = prevY + maxHeight / 2);\n    prevY += maxHeight + rankSep;\n  });\n}\n\n","\"use strict\";\n\nlet acyclic = require(\"./acyclic\");\nlet normalize = require(\"./normalize\");\nlet rank = require(\"./rank\");\nlet normalizeRanks = require(\"./util\").normalizeRanks;\nlet parentDummyChains = require(\"./parent-dummy-chains\");\nlet removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nlet nestingGraph = require(\"./nesting-graph\");\nlet addBorderSegments = require(\"./add-border-segments\");\nlet coordinateSystem = require(\"./coordinate-system\");\nlet order = require(\"./order\");\nlet position = require(\"./position\");\nlet util = require(\"./util\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  let time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", () => {\n    let layoutGraph =\n      time(\"  buildLayoutGraph\", () => buildLayoutGraph(g));\n    time(\"  runLayout\",        () => runLayout(layoutGraph, time, opts));\n    time(\"  updateInputGraph\", () => updateInputGraph(g, layoutGraph));\n  });\n}\n\nfunction runLayout(g, time, opts) {\n  time(\"    makeSpaceForEdgeLabels\", () => makeSpaceForEdgeLabels(g));\n  time(\"    removeSelfEdges\",        () => removeSelfEdges(g));\n  time(\"    acyclic\",                () => acyclic.run(g));\n  time(\"    nestingGraph.run\",       () => nestingGraph.run(g));\n  time(\"    rank\",                   () => rank(util.asNonCompoundGraph(g)));\n  time(\"    injectEdgeLabelProxies\", () => injectEdgeLabelProxies(g));\n  time(\"    removeEmptyRanks\",       () => removeEmptyRanks(g));\n  time(\"    nestingGraph.cleanup\",   () => nestingGraph.cleanup(g));\n  time(\"    normalizeRanks\",         () => normalizeRanks(g));\n  time(\"    assignRankMinMax\",       () => assignRankMinMax(g));\n  time(\"    removeEdgeLabelProxies\", () => removeEdgeLabelProxies(g));\n  time(\"    normalize.run\",          () => normalize.run(g));\n  time(\"    parentDummyChains\",      () => parentDummyChains(g));\n  time(\"    addBorderSegments\",      () => addBorderSegments(g));\n  time(\"    order\",                  () => order(g, opts));\n  time(\"    insertSelfEdges\",        () => insertSelfEdges(g));\n  time(\"    adjustCoordinateSystem\", () => coordinateSystem.adjust(g));\n  time(\"    position\",               () => position(g));\n  time(\"    positionSelfEdges\",      () => positionSelfEdges(g));\n  time(\"    removeBorderNodes\",      () => removeBorderNodes(g));\n  time(\"    normalize.undo\",         () => normalize.undo(g));\n  time(\"    fixupEdgeLabelCoords\",   () => fixupEdgeLabelCoords(g));\n  time(\"    undoCoordinateSystem\",   () => coordinateSystem.undo(g));\n  time(\"    translateGraph\",         () => translateGraph(g));\n  time(\"    assignNodeIntersects\",   () => assignNodeIntersects(g));\n  time(\"    reversePoints\",          () => reversePointsForReversedEdges(g));\n  time(\"    acyclic.undo\",           () => acyclic.undo(g));\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  inputGraph.nodes().forEach(v => {\n    let inputLabel = inputGraph.node(v);\n    let layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n      inputLabel.rank = layoutLabel.rank;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  inputGraph.edges().forEach(e => {\n    let inputLabel = inputGraph.edge(e);\n    let layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (Object.hasOwn(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nlet graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nlet graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nlet graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nlet nodeNumAttrs = [\"width\", \"height\", \"rank\"];\nlet nodeDefaults = { width: 0, height: 0 };\nlet edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nlet edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nlet edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  let g = new Graph({ multigraph: true, compound: true });\n  let graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(Object.assign({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    util.pick(graph, graphAttrs)));\n\n  inputGraph.nodes().forEach(v => {\n    let node = canonicalize(inputGraph.node(v));\n    const newNode = selectNumberAttrs(node, nodeNumAttrs);\n    Object.keys(nodeDefaults).forEach(k => {\n      if (newNode[k] === undefined) {\n        newNode[k] = nodeDefaults[k];\n      }\n    });\n\n    g.setNode(v, newNode);\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  inputGraph.edges().forEach(e => {\n    let edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, Object.assign({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      util.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  let graph = g.graph();\n  graph.ranksep /= 2;\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.width && edge.height) {\n      let v = g.node(e.v);\n      let w = g.node(e.w);\n      let label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  let maxRank = 0;\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = Math.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  let minX = Number.POSITIVE_INFINITY;\n  let maxX = 0;\n  let minY = Number.POSITIVE_INFINITY;\n  let maxY = 0;\n  let graphLabel = g.graph();\n  let marginX = graphLabel.marginx || 0;\n  let marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    let x = attrs.x;\n    let y = attrs.y;\n    let w = attrs.width;\n    let h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  g.nodes().forEach(v => getExtremes(g.node(v)));\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (Object.hasOwn(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(p => {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (Object.hasOwn(edge, \"x\")) { edge.x -= minX; }\n    if (Object.hasOwn(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    let nodeV = g.node(e.v);\n    let nodeW = g.node(e.w);\n    let p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (Object.hasOwn(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  g.nodes().forEach(v => {\n    if (g.children(v).length) {\n      let node = g.node(v);\n      let t = g.node(node.borderTop);\n      let b = g.node(node.borderBottom);\n      let l = g.node(node.borderLeft[node.borderLeft.length - 1]);\n      let r = g.node(node.borderRight[node.borderRight.length - 1]);\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  g.nodes().forEach(v => {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  g.edges().forEach(e => {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  layers.forEach(layer => {\n    var orderShift = 0;\n    layer.forEach((v, i) => {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      (node.selfEdges || []).forEach(selfEdge => {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  g.nodes().forEach(v => {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return util.mapValues(util.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  if (attrs) {\n    Object.entries(attrs).forEach(([k, v]) => {\n      if (typeof k === \"string\") {\n        k = k.toLowerCase();\n      }\n\n      newAttrs[k] = v;\n    });\n  }\n  return newAttrs;\n}\n","let util = require(\"./util\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  let layerMatrix = util.buildLayerMatrix(g);\n\n  let h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  g.nodes().forEach(v => {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  g.edges().forEach(e => h.setEdge(e.v, e.w, {}, e.name));\n\n  layerMatrix.forEach((layer, i) => {\n    let layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    layer.reduce((u, v) => {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n","module.exports = \"1.1.8\";\n","/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"@dagrejs/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n","import type { ParseDiagnostic } from './types';\n\nexport const errorMessages = {\n  unknownOperator: (op: string) =>\n    `Unknown operator \"${op}\". Expected ->, >>, p>, g>, t>, or c>.`,\n\n  unclosedParen: () =>\n    `Unclosed parenthesis in port name.`,\n\n  missingPort: (side: 'source' | 'target') =>\n    `Missing port name on ${side} side of connection.`,\n\n  duplicateModule: (name: string) =>\n    `Module \"${name}\" declared more than once.`,\n\n  didYouMean: (got: string, suggestion: string) =>\n    `Module \"${got}\" is not declared. Did you mean \"${suggestion}\"?`,\n\n  syntaxError: (detail: string) =>\n    `Syntax error: ${detail}`,\n\n  emptyDiagram: () =>\n    `Diagram is empty — no connections found.`,\n};\n\nexport function formatDiagnostic(diag: ParseDiagnostic, sourceLine: string): string {\n  const prefix = `Line ${diag.line}, col ${diag.column}: ${diag.message}`;\n  const caret = ' '.repeat(diag.column - 1) + '^'.repeat(diag.length);\n  return `${prefix}\\n  ${sourceLine}\\n  ${caret}`;\n}\n\nexport function editDistance(a: string, b: string): number {\n  const la = a.length;\n  const lb = b.length;\n  const dp: number[][] = Array.from({ length: la + 1 }, () => Array(lb + 1).fill(0));\n  for (let i = 0; i <= la; i++) dp[i][0] = i;\n  for (let j = 0; j <= lb; j++) dp[0][j] = j;\n  for (let i = 1; i <= la; i++) {\n    for (let j = 1; j <= lb; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n      dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);\n    }\n  }\n  return dp[la][lb];\n}\n\nexport function sanitizeForSvg(str: string): string {\n  return str\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n    .replace(/'/g, '&#39;');\n}\n","import type {\n  ParseResult,\n  PatchGraph,\n  Block,\n  Connection,\n  Param,\n  ParseDiagnostic,\n  SignalType,\n} from './types';\nimport { SIGNAL_OPERATORS } from './types';\nimport { errorMessages, editDistance } from './errors';\n\n// ── Helpers ──\n\nfunction normalize(str: string): string {\n  return str.trim().toLowerCase().replace(/\\s+/g, '-');\n}\n\nfunction makeBlockId(module: string, section: string): string {\n  return `${normalize(module)}--${normalize(section)}`;\n}\n\nfunction parseGraphvizExtras(str: string): Record<string, string> {\n  const result: Record<string, string> = {};\n  // str is content inside [], e.g. \"color=red, weight=3\"\n  const parts = str.split(',');\n  for (const part of parts) {\n    const eqIdx = part.indexOf('=');\n    if (eqIdx !== -1) {\n      const key = part.slice(0, eqIdx).trim();\n      const value = part.slice(eqIdx + 1).trim();\n      result[key] = value;\n    }\n  }\n  return result;\n}\n\nfunction parseEndpoint(raw: string): { module: string; section: string | null; port: string } | null {\n  const trimmed = raw.trim();\n\n  // Find port in parentheses\n  const openParen = trimmed.lastIndexOf('(');\n  const closeParen = trimmed.lastIndexOf(')');\n  if (openParen === -1 || closeParen === -1 || closeParen < openParen) {\n    return null;\n  }\n\n  const port = trimmed.slice(openParen + 1, closeParen);\n  const before = trimmed.slice(0, openParen).trim();\n\n  // Check for dot notation\n  const dotIdx = before.indexOf('.');\n  if (dotIdx !== -1) {\n    const module = before.slice(0, dotIdx).trim();\n    const section = before.slice(dotIdx + 1).trim();\n    return { module, section, port };\n  }\n\n  return { module: before, section: null, port };\n}\n\n// Sort operators longest first to avoid substring collisions\nconst SORTED_OPERATORS = Object.keys(SIGNAL_OPERATORS).sort((a, b) => b.length - a.length);\n\nfunction findOperator(line: string): { operator: string; index: number } | null {\n  for (const op of SORTED_OPERATORS) {\n    const idx = line.indexOf(op);\n    if (idx !== -1) {\n      return { operator: op, index: idx };\n    }\n  }\n  return null;\n}\n\n// ── Main Parser ──\n\nexport function parse(input: string): ParseResult {\n  const errors: ParseDiagnostic[] = [];\n  const warnings: ParseDiagnostic[] = [];\n\n  // Normalize line endings\n  const normalized = input.replace(/\\r\\n/g, '\\n');\n  const lines = normalized.split('\\n');\n\n  const declaredModules: Map<string, Block> = new Map(); // lowercase name -> Block\n  const allBlocks: Map<string, Block> = new Map(); // blockId -> Block\n  const connections: Connection[] = [];\n\n  let currentModuleName: string | null = null;\n  let currentVoice: string | null = null;\n  const voices: string[] = [];\n  let lastParam: Param | null = null;\n  let connectionCounter = 0;\n\n  for (let lineIdx = 0; lineIdx < lines.length; lineIdx++) {\n    const line = lines[lineIdx];\n    const lineNum = lineIdx + 1;\n\n    // Blank lines\n    if (line.trim() === '') continue;\n\n    // Version header\n    if (line.startsWith('# patchflow')) continue;\n\n    // Comments\n    if (line.trim().startsWith('//')) continue;\n\n    // Connection lines\n    if (line.trimStart().startsWith('- ')) {\n      lastParam = null;\n      const connLine = line.trimStart().slice(2); // strip \"- \"\n\n      // Extract annotation (trailing // comment)\n      let annotation: string | null = null;\n      let workLine = connLine;\n      const annotationIdx = workLine.indexOf(' // ');\n      if (annotationIdx !== -1) {\n        annotation = workLine.slice(annotationIdx + 4).trim();\n        workLine = workLine.slice(0, annotationIdx);\n      }\n\n      // Extract graphviz extras [key=val, ...]\n      let graphvizExtras: Record<string, string> | null = null;\n      const bracketOpen = workLine.lastIndexOf('[');\n      const bracketClose = workLine.lastIndexOf(']');\n      if (bracketOpen !== -1 && bracketClose !== -1 && bracketClose > bracketOpen) {\n        const extrasStr = workLine.slice(bracketOpen + 1, bracketClose);\n        graphvizExtras = parseGraphvizExtras(extrasStr);\n        workLine = workLine.slice(0, bracketOpen).trim();\n      }\n\n      // Find operator\n      const opResult = findOperator(workLine);\n      if (!opResult) {\n        errors.push({\n          code: 'SYNTAX_ERROR',\n          message: errorMessages.syntaxError('no valid operator found'),\n          line: lineNum,\n          column: 1,\n          length: line.length,\n          severity: 'error',\n        });\n        continue;\n      }\n\n      const { operator, index: opIdx } = opResult;\n      const signalType = SIGNAL_OPERATORS[operator];\n      const sourcePart = workLine.slice(0, opIdx).trim();\n      const targetPart = workLine.slice(opIdx + operator.length).trim();\n\n      // Parse endpoints\n      const sourceEndpoint = parseEndpoint(sourcePart);\n      const targetEndpoint = parseEndpoint(targetPart);\n\n      if (!sourceEndpoint) {\n        errors.push({\n          code: 'MISSING_PORT',\n          message: errorMessages.missingPort('source'),\n          line: lineNum,\n          column: 1,\n          length: line.length,\n          severity: 'error',\n        });\n        continue;\n      }\n\n      if (!targetEndpoint) {\n        errors.push({\n          code: 'MISSING_PORT',\n          message: errorMessages.missingPort('target'),\n          line: lineNum,\n          column: 1,\n          length: line.length,\n          severity: 'error',\n        });\n        continue;\n      }\n\n      // Resolve blocks for source and target\n      const sourceBlock = resolveBlock(sourceEndpoint, currentVoice);\n      const targetBlock = resolveBlock(targetEndpoint, currentVoice);\n\n      // Ensure ports exist on blocks\n      ensurePort(sourceBlock, sourceEndpoint.port, 'out');\n      ensurePort(targetBlock, targetEndpoint.port, 'in');\n\n      const conn: Connection = {\n        id: `conn-${connectionCounter++}`,\n        source: {\n          blockId: sourceBlock.id,\n          portId: sourceEndpoint.port.trim().toLowerCase(),\n          portDisplay: sourceEndpoint.port.trim(),\n        },\n        target: {\n          blockId: targetBlock.id,\n          portId: targetEndpoint.port.trim().toLowerCase(),\n          portDisplay: targetEndpoint.port.trim(),\n        },\n        signalType,\n        annotation,\n        graphvizExtras,\n      };\n\n      connections.push(conn);\n      continue;\n    }\n\n    // Multiline params\n    if (line.trimStart().startsWith('|')) {\n      if (lastParam) {\n        const value = line.trimStart().slice(1).trim();\n        lastParam.value += '; ' + value;\n      }\n      continue;\n    }\n\n    // Parameters\n    if (line.trimStart().startsWith('*')) {\n      const paramContent = line.trimStart().slice(1).trim();\n      const colonIdx = paramContent.indexOf(':');\n      let key: string;\n      let value: string;\n      if (colonIdx !== -1) {\n        key = paramContent.slice(0, colonIdx).trim();\n        value = paramContent.slice(colonIdx + 1).trim();\n      } else {\n        key = paramContent;\n        value = '';\n      }\n\n      const param: Param = { key, value };\n      lastParam = param;\n\n      // Add to current module\n      if (currentModuleName) {\n        const lowerName = currentModuleName.toLowerCase();\n        const block = declaredModules.get(lowerName);\n        if (block) {\n          block.params.push(param);\n        }\n      }\n      continue;\n    }\n\n    // Module/Voice declarations (lines ending with :)\n    if (line.trim().endsWith(':') && !line.trim().startsWith('-') && !line.trim().startsWith('*') && !line.trim().startsWith('|')) {\n      lastParam = null;\n      const rawDecl = line.trim().slice(0, -1).trim();\n\n      // Parse optional variant in brackets: \"MODULE [Variant]\"\n      let moduleName = rawDecl;\n      let variant: string | null = null;\n      const variantMatch = rawDecl.match(/^(.+?)\\s*\\[(.+?)\\]\\s*$/);\n      if (variantMatch) {\n        moduleName = variantMatch[1].trim();\n        variant = variantMatch[2].trim();\n      }\n\n      // Voice declaration: \"VOICE <something>\" — tag subsequent items, don't create a block\n      if (/^voice\\s+/i.test(moduleName)) {\n        currentVoice = moduleName;\n        currentModuleName = null;\n        if (!voices.includes(moduleName)) {\n          voices.push(moduleName);\n        }\n        continue;\n      }\n\n      // Module declaration\n      currentModuleName = moduleName;\n\n      const lowerName = moduleName.toLowerCase();\n      if (!declaredModules.has(lowerName)) {\n        const block: Block = {\n          id: normalize(moduleName),\n          label: moduleName,\n          subLabel: variant,\n          params: [],\n          ports: [],\n          parentModule: null,\n          voice: currentVoice,\n        };\n        declaredModules.set(lowerName, block);\n        allBlocks.set(block.id, block);\n      } else if (variant) {\n        // Update subLabel if variant provided on re-declaration\n        const existing = declaredModules.get(lowerName)!;\n        if (!existing.subLabel) existing.subLabel = variant;\n      }\n      continue;\n    }\n\n    // If we get here, it's unrecognized — record an error and skip\n    errors.push({\n      code: 'SYNTAX_ERROR',\n      message: errorMessages.syntaxError('unrecognized line format'),\n      line: lineNum,\n      column: 1,\n      length: line.length,\n      severity: 'error',\n    });\n  }\n\n  // ── Post-processing ──\n\n  // Separate declared vs stub blocks\n  let declaredBlocksList: Block[] = [...declaredModules.values()];\n  const stubBlocks: Block[] = [];\n  for (const [id, block] of allBlocks) {\n    if (![...declaredModules.values()].find(b => b.id === id)) {\n      stubBlocks.push(block);\n    }\n  }\n\n  // ── Parent-module-with-sections post-processing ──\n  // For each declared block, if it has child sections (blocks with parentModule === this.label),\n  // migrate matching params to sections. Remove parent if empty and not directly referenced.\n  const blocksToRemove: Set<string> = new Set();\n  for (const parent of declaredBlocksList) {\n    const parentLabelLower = parent.label.trim().toLowerCase();\n    const childSections: Block[] = [];\n    for (const block of [...declaredBlocksList, ...stubBlocks]) {\n      if (block.parentModule && block.parentModule.trim().toLowerCase() === parentLabelLower) {\n        childSections.push(block);\n      }\n    }\n    if (childSections.length === 0) continue;\n\n    // Migrate matching params\n    const remainingParams: Param[] = [];\n    for (const param of parent.params) {\n      const keyLower = param.key.trim().toLowerCase();\n      const matchingSection = childSections.find(\n        s => s.label.trim().toLowerCase() === keyLower\n      );\n      if (matchingSection) {\n        matchingSection.params.push(param);\n      } else {\n        remainingParams.push(param);\n      }\n    }\n    parent.params = remainingParams;\n\n    // If parent has no remaining params AND is not directly connected, remove it\n    if (remainingParams.length === 0) {\n      const directlyReferenced = connections.some(\n        c => c.source.blockId === parent.id || c.target.blockId === parent.id\n      );\n      if (!directlyReferenced) {\n        blocksToRemove.add(parent.id);\n      }\n    }\n  }\n  if (blocksToRemove.size > 0) {\n    declaredBlocksList = declaredBlocksList.filter(b => !blocksToRemove.has(b.id));\n  }\n\n  // ── Feedback detection ──\n  const { forward, feedback } = detectFeedbackEdges(connections);\n\n  // ── Signal type stats ──\n  const signalTypeStats: Partial<Record<SignalType, number>> = {};\n  for (const conn of [...forward, ...feedback]) {\n    signalTypeStats[conn.signalType] = (signalTypeStats[conn.signalType] || 0) + 1;\n  }\n\n  // ── Edit-distance warnings ──\n  const declaredNames = [...declaredModules.keys()]; // already lowercase\n  for (const stub of stubBlocks) {\n    const stubLower = stub.label.toLowerCase();\n    for (const declName of declaredNames) {\n      const dist = editDistance(stubLower, declName);\n      if (dist > 0 && dist <= 2) {\n        const declBlock = declaredModules.get(declName)!;\n        warnings.push({\n          code: 'UNKNOWN_MODULE',\n          message: errorMessages.didYouMean(stub.label, declBlock.label),\n          line: 0,\n          column: 1,\n          length: stub.label.length,\n          severity: 'warning',\n        });\n        break;\n      }\n    }\n  }\n\n  const graph: PatchGraph = {\n    declaredBlocks: declaredBlocksList,\n    stubBlocks,\n    connections: forward,\n    feedbackEdges: feedback,\n    signalTypeStats,\n    voices,\n  };\n\n  return { graph, errors, warnings };\n\n  // ── Inner helper functions ──\n\n  function resolveBlock(\n    endpoint: { module: string; section: string | null; port: string },\n    voice: string | null\n  ): Block {\n    const { module, section } = endpoint;\n\n    if (section) {\n      // Dot notation: Module.Section\n      const blockId = makeBlockId(module, section);\n      if (allBlocks.has(blockId)) {\n        return allBlocks.get(blockId)!;\n      }\n      const block: Block = {\n        id: blockId,\n        label: section,\n        subLabel: null,\n        params: [],\n        ports: [],\n        parentModule: module,\n        voice,\n      };\n      allBlocks.set(blockId, block);\n      return block;\n    }\n\n    // No section — look up in declared modules first (case-insensitive)\n    const lowerModule = module.toLowerCase();\n    if (declaredModules.has(lowerModule)) {\n      return declaredModules.get(lowerModule)!;\n    }\n\n    // Check if we already have it in allBlocks\n    const blockId = normalize(module);\n    if (allBlocks.has(blockId)) {\n      return allBlocks.get(blockId)!;\n    }\n\n    // Create a new block (will end up as stub)\n    const block: Block = {\n      id: blockId,\n      label: module,\n      subLabel: null,\n      params: [],\n      ports: [],\n      parentModule: null,\n      voice,\n    };\n    allBlocks.set(blockId, block);\n    return block;\n  }\n\n  function ensurePort(block: Block, portName: string, direction: 'in' | 'out'): void {\n    const portId = portName.trim().toLowerCase();\n    const existing = block.ports.find(p => p.id === portId && p.direction === direction);\n    if (!existing) {\n      block.ports.push({\n        id: portId,\n        display: portName.trim(),\n        direction,\n      });\n    }\n  }\n}\n\n// ── Feedback Edge Detection ──\n\nfunction detectFeedbackEdges(connections: Connection[]): {\n  forward: Connection[];\n  feedback: Connection[];\n} {\n  if (connections.length === 0) {\n    return { forward: [], feedback: [] };\n  }\n\n  // Build adjacency list (block-level)\n  const adjacency: Map<string, Set<string>> = new Map();\n  const edgeMap: Map<string, Connection[]> = new Map(); // \"src->tgt\" -> connections\n\n  for (const conn of connections) {\n    const src = conn.source.blockId;\n    const tgt = conn.target.blockId;\n\n    if (!adjacency.has(src)) adjacency.set(src, new Set());\n    adjacency.get(src)!.add(tgt);\n\n    const edgeKey = `${src}->${tgt}`;\n    if (!edgeMap.has(edgeKey)) edgeMap.set(edgeKey, []);\n    edgeMap.get(edgeKey)!.push(conn);\n  }\n\n  // DFS cycle detection\n  const WHITE = 0, GRAY = 1, BLACK = 2;\n  const color: Map<string, number> = new Map();\n  const backEdges: Set<string> = new Set(); // edge keys that form cycles\n\n  // Get all nodes\n  const nodes = new Set<string>();\n  for (const conn of connections) {\n    nodes.add(conn.source.blockId);\n    nodes.add(conn.target.blockId);\n  }\n  for (const node of nodes) {\n    color.set(node, WHITE);\n  }\n\n  function dfs(u: string): void {\n    color.set(u, GRAY);\n    const neighbors = adjacency.get(u) || new Set();\n    for (const v of neighbors) {\n      const c = color.get(v) ?? WHITE;\n      if (c === GRAY) {\n        // Back edge found\n        backEdges.add(`${u}->${v}`);\n      } else if (c === WHITE) {\n        dfs(v);\n      }\n    }\n    color.set(u, BLACK);\n  }\n\n  for (const node of nodes) {\n    if (color.get(node) === WHITE) {\n      dfs(node);\n    }\n  }\n\n  // Partition connections\n  const forward: Connection[] = [];\n  const feedback: Connection[] = [];\n\n  for (const conn of connections) {\n    const edgeKey = `${conn.source.blockId}->${conn.target.blockId}`;\n    if (backEdges.has(edgeKey)) {\n      feedback.push(conn);\n    } else {\n      forward.push(conn);\n    }\n  }\n\n  return { forward, feedback };\n}\n","import dagre from '@dagrejs/dagre';\nimport type {\n  Block,\n  Connection,\n  LayoutBlock,\n  LayoutConnection,\n  LayoutOptions,\n  LayoutPort,\n  LayoutResult,\n  PatchGraph,\n  Point,\n  Port,\n  SignalType,\n} from './types';\nimport { feedbackArcPath, selfLoopArcPath, smoothstepPath } from './edge-routing';\n\n// ── Dimension estimation (no DOM) ──\n\nconst MIN_WIDTH = 140;\nconst MIN_HEIGHT = 90;\n\nfunction getBlockDimensions(block: Block, portCount: number): { width: number; height: number } {\n  const labelWidth = block.label.length * 8;\n  const subLabelWidth = block.subLabel ? block.subLabel.length * 7 : 0;\n  const paramWidths = block.params.map(p => (`${p.key}: ${p.value}`).length * 7);\n  const longestParam = paramWidths.length > 0 ? Math.max(...paramWidths) : 0;\n\n  const width = Math.max(\n    labelWidth + 40,\n    subLabelWidth + 40,\n    longestParam + 30,\n    MIN_WIDTH,\n  );\n\n  const labelArea = 50;\n  const subLabelArea = block.subLabel ? 18 : 0;\n  const paramsArea = 20 * block.params.length;\n  const portsArea = Math.max((portCount / 2) * 24, 30);\n  const padding = 20;\n\n  const height = Math.max(labelArea + subLabelArea + paramsArea + portsArea + padding, MIN_HEIGHT);\n\n  return { width, height };\n}\n\n// ── Port collection ──\n\n/**\n * Collect ports on every block based on all connections (forward + feedback).\n * If a port appears as both in and out, 'out' wins (source).\n */\nfunction collectPorts(\n  blocks: Block[],\n  connections: Connection[],\n): Map<string, Port[]> {\n  // Start from whatever ports each block already has declared.\n  const byBlock = new Map<string, Map<string, Port>>();\n  for (const block of blocks) {\n    const map = new Map<string, Port>();\n    for (const p of block.ports) {\n      // dedupe key ignores direction here; 'out' wins later if conflict\n      const existing = map.get(p.id);\n      if (!existing || (existing.direction === 'in' && p.direction === 'out')) {\n        map.set(p.id, { ...p });\n      }\n    }\n    byBlock.set(block.id, map);\n  }\n\n  for (const conn of connections) {\n    const srcBlock = byBlock.get(conn.source.blockId);\n    if (srcBlock) {\n      const existing = srcBlock.get(conn.source.portId);\n      if (!existing || existing.direction === 'in') {\n        srcBlock.set(conn.source.portId, {\n          id: conn.source.portId,\n          display: conn.source.portDisplay,\n          direction: 'out',\n        });\n      }\n    }\n    const tgtBlock = byBlock.get(conn.target.blockId);\n    if (tgtBlock) {\n      const existing = tgtBlock.get(conn.target.portId);\n      if (!existing) {\n        tgtBlock.set(conn.target.portId, {\n          id: conn.target.portId,\n          display: conn.target.portDisplay,\n          direction: 'in',\n        });\n      }\n      // if existing is 'out', keep it ('out' wins)\n    }\n  }\n\n  const result = new Map<string, Port[]>();\n  for (const [blockId, map] of byBlock) {\n    result.set(blockId, Array.from(map.values()));\n  }\n  return result;\n}\n\n// ── Port placement on block faces ──\n\nfunction placePorts(block: LayoutBlock, ports: Port[]): LayoutPort[] {\n  const inPorts = ports.filter(p => p.direction === 'in');\n  const outPorts = ports.filter(p => p.direction === 'out');\n\n  const layoutPorts: LayoutPort[] = [];\n  const startY = block.y + 40 + (block.subLabel ? 18 : 0);\n  const spacing = 24;\n\n  inPorts.forEach((p, i) => {\n    layoutPorts.push({\n      ...p,\n      position: { x: block.x, y: startY + i * spacing },\n      signalType: null,\n    });\n  });\n\n  outPorts.forEach((p, i) => {\n    layoutPorts.push({\n      ...p,\n      position: { x: block.x + block.width, y: startY + i * spacing },\n      signalType: null,\n    });\n  });\n\n  return layoutPorts;\n}\n\n// ── Signal type derivation ──\n\n/**\n * For each port, pick a signal type. Prefer forward edges; fall back to feedback.\n * For outputs: first connection where this port is the source.\n * For inputs: first connection where this port is the target.\n */\nfunction assignPortSignalTypes(\n  blocks: LayoutBlock[],\n  forward: Connection[],\n  feedback: Connection[],\n): void {\n  const pick = (\n    blockId: string,\n    portId: string,\n    direction: 'in' | 'out',\n    connections: Connection[],\n  ): SignalType | null => {\n    for (const conn of connections) {\n      if (direction === 'out') {\n        if (conn.source.blockId === blockId && conn.source.portId === portId) {\n          return conn.signalType;\n        }\n      } else {\n        if (conn.target.blockId === blockId && conn.target.portId === portId) {\n          return conn.signalType;\n        }\n      }\n    }\n    return null;\n  };\n\n  for (const block of blocks) {\n    for (const port of block.ports) {\n      const fromForward = pick(block.id, port.id, port.direction, forward);\n      if (fromForward) {\n        port.signalType = fromForward;\n        continue;\n      }\n      const fromFeedback = pick(block.id, port.id, port.direction, feedback);\n      if (fromFeedback) {\n        port.signalType = fromFeedback;\n      }\n    }\n  }\n}\n\n// ── Lookup helpers ──\n\nfunction findPortPosition(\n  block: LayoutBlock,\n  portId: string,\n  direction: 'in' | 'out',\n): Point {\n  const exact = block.ports.find(p => p.id === portId && p.direction === direction);\n  if (exact) return exact.position;\n  // fallback: any port with same id (different direction) — collectPorts\n  // synthesizes every connection endpoint, so the only way to miss an exact\n  // match is a direction mismatch on a port that exists in the block.\n  const any = block.ports.find(p => p.id === portId)!;\n  return any.position;\n}\n\n// ── Main ──\n\nexport function layout(graph: PatchGraph, options: LayoutOptions = {}): LayoutResult {\n  const direction = options.direction ?? 'LR';\n  const rankSep = options.rankSep ?? 200;\n  const nodeSep = options.nodeSep ?? 40;\n\n  const allBlocks: Block[] = [...graph.declaredBlocks, ...graph.stubBlocks];\n\n  // Collect ports using both forward and feedback edges\n  const allConnections = [...graph.connections, ...graph.feedbackEdges];\n  const portsByBlock = collectPorts(allBlocks, allConnections);\n\n  // Compute dimensions for each block\n  const dimsByBlock = new Map<string, { width: number; height: number }>();\n  for (const block of allBlocks) {\n    const ports = portsByBlock.get(block.id) ?? [];\n    dimsByBlock.set(block.id, getBlockDimensions(block, ports.length));\n  }\n\n  // Build dagre graph\n  const g = new dagre.graphlib.Graph();\n  g.setGraph({\n    rankdir: direction,\n    ranksep: rankSep,\n    nodesep: nodeSep,\n    marginx: 20,\n    marginy: 20,\n  });\n  g.setDefaultEdgeLabel(() => ({}));\n\n  for (const block of allBlocks) {\n    const d = dimsByBlock.get(block.id)!;\n    g.setNode(block.id, { width: d.width, height: d.height });\n  }\n\n  // Forward edges only (skip self-loops to avoid dagre issues)\n  for (const conn of graph.connections) {\n    if (conn.source.blockId === conn.target.blockId) continue;\n    g.setEdge(conn.source.blockId, conn.target.blockId);\n  }\n\n  dagre.layout(g);\n\n  // Extract positioned blocks\n  const layoutBlocks: LayoutBlock[] = [];\n  const blocksById = new Map<string, LayoutBlock>();\n\n  for (const block of allBlocks) {\n    const node = g.node(block.id);\n    const d = dimsByBlock.get(block.id)!;\n    const nodeX = node?.x ?? 0;\n    const nodeY = node?.y ?? 0;\n    const x = nodeX - d.width / 2;\n    const y = nodeY - d.height / 2;\n\n    const partial: LayoutBlock = {\n      id: block.id,\n      label: block.label,\n      subLabel: block.subLabel,\n      params: block.params,\n      ports: [],\n      parentModule: block.parentModule,\n      x,\n      y,\n      width: d.width,\n      height: d.height,\n    };\n    const ports = portsByBlock.get(block.id) ?? [];\n    partial.ports = placePorts(partial, ports);\n    layoutBlocks.push(partial);\n    blocksById.set(block.id, partial);\n  }\n\n  // Assign signal types to each port based on connections\n  assignPortSignalTypes(layoutBlocks, graph.connections, graph.feedbackEdges);\n\n  // Compute diagram bounds\n  let maxX = 0;\n  let maxY = 0;\n  for (const b of layoutBlocks) {\n    if (b.x + b.width > maxX) maxX = b.x + b.width;\n    if (b.y + b.height > maxY) maxY = b.y + b.height;\n  }\n\n  const hasFeedback = graph.feedbackEdges.length > 0;\n  const feedbackArcOffset = 20;\n  const diagramBottom = maxY + 10;\n\n  // Route connections\n  const layoutConnections: LayoutConnection[] = [];\n\n  for (const conn of graph.connections) {\n    const srcBlock = blocksById.get(conn.source.blockId);\n    const tgtBlock = blocksById.get(conn.target.blockId);\n    if (!srcBlock || !tgtBlock) continue;\n\n    const srcPos = findPortPosition(srcBlock, conn.source.portId, 'out');\n    const tgtPos = findPortPosition(tgtBlock, conn.target.portId, 'in');\n\n    let path: string;\n    if (conn.source.blockId === conn.target.blockId) {\n      const blockBottom = srcBlock.y + srcBlock.height;\n      path = selfLoopArcPath(srcPos, tgtPos, blockBottom, 20);\n    } else {\n      path = smoothstepPath(srcPos, tgtPos);\n    }\n\n    layoutConnections.push({\n      id: conn.id,\n      source: conn.source,\n      target: conn.target,\n      signalType: conn.signalType,\n      annotation: conn.annotation,\n      path,\n      isFeedback: false,\n      sourcePoint: srcPos,\n      targetPoint: tgtPos,\n    });\n  }\n\n  for (const conn of graph.feedbackEdges) {\n    const srcBlock = blocksById.get(conn.source.blockId);\n    const tgtBlock = blocksById.get(conn.target.blockId);\n    if (!srcBlock || !tgtBlock) continue;\n\n    const srcPos = findPortPosition(srcBlock, conn.source.portId, 'out');\n    const tgtPos = findPortPosition(tgtBlock, conn.target.portId, 'in');\n\n    const path = feedbackArcPath(srcPos, tgtPos, diagramBottom, feedbackArcOffset);\n\n    layoutConnections.push({\n      id: conn.id,\n      source: conn.source,\n      target: conn.target,\n      signalType: conn.signalType,\n      annotation: conn.annotation,\n      path,\n      isFeedback: true,\n      sourcePoint: srcPos,\n      targetPoint: tgtPos,\n    });\n  }\n\n  // Overall dimensions\n  const margin = 20;\n  // Feedback arcs drop to diagramBottom + feedbackArcOffset and carry an\n  // annotation below them, so reserve enough room for the arc + the\n  // annotation line + its text stroke padding.\n  const feedbackSpace = hasFeedback\n    ? (diagramBottom - maxY) + feedbackArcOffset + 30 + 16\n    : 0;\n  const width = maxX + margin;\n  const height = maxY + margin + feedbackSpace;\n\n  return {\n    blocks: layoutBlocks,\n    connections: layoutConnections,\n    width,\n    height,\n    signalTypeStats: graph.signalTypeStats,\n  };\n}\n","import type { Point } from './types';\n\nexport function straightPath(source: Point, target: Point): string {\n  return `M ${source.x} ${source.y} L ${target.x} ${target.y}`;\n}\n\nexport function rightAnglePath(source: Point, target: Point): string {\n  const midX = (source.x + target.x) / 2;\n  return [\n    `M ${source.x} ${source.y}`,\n    `L ${midX} ${source.y}`,\n    `L ${midX} ${target.y}`,\n    `L ${target.x} ${target.y}`,\n  ].join(' ');\n}\n\nexport function smoothstepPath(source: Point, target: Point): string {\n  const dx = target.x - source.x;\n  const controlOffset = Math.max(Math.abs(dx) * 0.4, 30);\n  const cx1 = source.x + controlOffset;\n  const cy1 = source.y;\n  const cx2 = target.x - controlOffset;\n  const cy2 = target.y;\n  return `M ${source.x} ${source.y} C ${cx1} ${cy1}, ${cx2} ${cy2}, ${target.x} ${target.y}`;\n}\n\nexport function feedbackArcPath(\n  source: Point,\n  target: Point,\n  diagramBottom: number,\n  arcOffset: number,\n): string {\n  const arcY = diagramBottom + arcOffset;\n  return [\n    `M ${source.x} ${source.y}`,\n    `L ${source.x + 20} ${source.y}`,\n    `L ${source.x + 20} ${arcY}`,\n    `L ${target.x - 20} ${arcY}`,\n    `L ${target.x - 20} ${target.y}`,\n    `L ${target.x} ${target.y}`,\n  ].join(' ');\n}\n\nexport function selfLoopArcPath(\n  source: Point,\n  target: Point,\n  blockBottom: number,\n  arcOffset: number,\n): string {\n  const arcY = blockBottom + arcOffset;\n  return [\n    `M ${source.x} ${source.y}`,\n    `L ${source.x + 15} ${source.y}`,\n    `Q ${source.x + 15} ${arcY}, ${(source.x + target.x) / 2} ${arcY}`,\n    `Q ${target.x - 15} ${arcY}, ${target.x - 15} ${target.y}`,\n    `L ${target.x} ${target.y}`,\n  ].join(' ');\n}\n","import type {\n  LayoutBlock,\n  LayoutConnection,\n  LayoutResult,\n  SignalType,\n  Theme,\n} from './types';\nimport { sanitizeForSvg } from './errors';\n\n// ── ID generation ──\n\nfunction genId(): string {\n  return 'pf-' + Math.random().toString(16).slice(2, 8);\n}\n\n// ── Accessibility summary ──\n\nfunction buildDesc(layoutResult: LayoutResult): string {\n  const blockCount = layoutResult.blocks.length;\n  const connCount = layoutResult.connections.length;\n  const stats = layoutResult.signalTypeStats;\n  const statsParts: string[] = [];\n  const order: SignalType[] = ['audio', 'cv', 'pitch', 'gate', 'trigger', 'clock'];\n  for (const t of order) {\n    const n = stats[t] ?? 0;\n    if (n > 0) statsParts.push(`${n} ${t}`);\n  }\n\n  let summary = `Patch diagram with ${blockCount} module${blockCount === 1 ? '' : 's'} and ${connCount} connection${connCount === 1 ? '' : 's'}.`;\n\n  if (blockCount > 0 && blockCount <= 6) {\n    const names = layoutResult.blocks.map(b => sanitizeForSvg(b.label)).join(', ');\n    summary += ` Modules: ${names}.`;\n  }\n\n  if (statsParts.length > 0) {\n    summary += ` Signals: ${statsParts.join(', ')}.`;\n  }\n\n  return summary;\n}\n\n// ── Layer builders ──\n\nfunction buildBackground(theme: Theme, idPrefix: string, width: number, height: number): string {\n  if (!theme.grid) return '';\n  return `<rect width=\"${width}\" height=\"${height}\" fill=\"url(#${idPrefix}-dots)\"/>`;\n}\n\nfunction buildCables(theme: Theme, connections: LayoutConnection[]): string {\n  const parts: string[] = [];\n  const tips: string[] = [];\n\n  for (const conn of connections) {\n    const cableColor = theme.cable.colors[conn.signalType];\n    parts.push(\n      `<path d=\"${conn.path}\" stroke=\"${cableColor.stroke}\" stroke-width=\"${theme.cable.width}\" ` +\n      `fill=\"none\" stroke-linecap=\"round\" stroke-linejoin=\"round\" ` +\n      `data-connection=\"${sanitizeForSvg(conn.id)}\" data-signal=\"${conn.signalType}\"/>`,\n    );\n    tips.push(\n      `<circle cx=\"${conn.sourcePoint.x}\" cy=\"${conn.sourcePoint.y}\" r=\"${theme.cable.plugTipRadius}\" fill=\"${cableColor.plugTip}\"/>`,\n    );\n    tips.push(\n      `<circle cx=\"${conn.targetPoint.x}\" cy=\"${conn.targetPoint.y}\" r=\"${theme.cable.plugTipRadius}\" fill=\"${cableColor.plugTip}\"/>`,\n    );\n  }\n\n  return parts.join('') + tips.join('');\n}\n\nfunction buildPanels(theme: Theme, idPrefix: string, blocks: LayoutBlock[]): string {\n  const parts: string[] = [];\n\n  for (const block of blocks) {\n    const moduleName = sanitizeForSvg(block.parentModule || block.label);\n    const label = sanitizeForSvg(block.label);\n    const fontFamily = sanitizeForSvg(theme.label.fontFamily);\n\n    const insetX = block.x + 12;\n    const insetY = block.y + 8;\n    const insetW = block.width - 24;\n\n    let group = `<g data-module=\"${moduleName}\" filter=\"url(#${idPrefix}-panel-shadow)\">`;\n    // Main panel rect\n    group += `<rect x=\"${block.x}\" y=\"${block.y}\" width=\"${block.width}\" height=\"${block.height}\" ` +\n      `fill=\"${theme.panel.fill}\" stroke=\"${theme.panel.stroke}\" stroke-width=\"0.75\" rx=\"${theme.panel.cornerRadius}\"/>`;\n    // Top highlight bevel\n    group += `<line x1=\"${block.x}\" y1=\"${block.y + 0.5}\" x2=\"${block.x + block.width}\" y2=\"${block.y + 0.5}\" ` +\n      `stroke=\"${theme.panel.highlight}\" stroke-width=\"${theme.panel.bevelWidth}\"/>`;\n    // Bottom shadow bevel\n    group += `<line x1=\"${block.x}\" y1=\"${block.y + block.height - 0.5}\" x2=\"${block.x + block.width}\" y2=\"${block.y + block.height - 0.5}\" ` +\n      `stroke=\"${theme.panel.shadow}\" stroke-width=\"0.5\"/>`;\n    // Inset label recess\n    group += `<rect x=\"${insetX}\" y=\"${insetY}\" width=\"${insetW}\" height=\"28\" ` +\n      `fill=\"${theme.label.plateFill}\" stroke=\"${theme.label.plateStroke}\" stroke-width=\"0.5\"/>`;\n    // Label\n    group += `<text x=\"${block.x + block.width / 2}\" y=\"${block.y + 22}\" text-anchor=\"middle\" ` +\n      `font-family=\"${fontFamily}\" font-size=\"14\" font-weight=\"700\" ` +\n      `fill=\"${theme.label.color}\" letter-spacing=\"3\">${label}</text>`;\n    // Sub-label: dark bar directly below the inset label plate (Monotrail style)\n    if (block.subLabel) {\n      const subLabel = sanitizeForSvg(block.subLabel);\n      const barX = insetX;\n      const barY = insetY + 28;\n      const barW = insetW;\n      const barH = 16;\n      group += `<rect class=\"pf-sublabel-bar\" x=\"${barX}\" y=\"${barY}\" width=\"${barW}\" height=\"${barH}\" ` +\n        `fill=\"${theme.panel.shadow}\"/>`;\n      group += `<text x=\"${block.x + block.width / 2}\" y=\"${barY + barH / 2 + 3}\" text-anchor=\"middle\" ` +\n        `font-family=\"${fontFamily}\" font-size=\"10\" fill=\"${theme.panel.fill}\" letter-spacing=\"1\">${subLabel}</text>`;\n    }\n    group += `</g>`;\n    parts.push(group);\n  }\n\n  return parts.join('');\n}\n\nfunction buildParams(blocks: LayoutBlock[], theme: Theme): string {\n  const parts: string[] = [];\n  const monoFont = \"'SF Mono', 'Fira Code', Consolas, 'Courier New', monospace\";\n\n  for (const block of blocks) {\n    const pw = block.width - 24;\n    const px = block.x + 12;\n    let py = block.y + 40 + (block.subLabel ? 18 : 0);\n    const blockLabelNorm = block.label.trim().toLowerCase();\n    for (const param of block.params) {\n      parts.push(\n        `<rect x=\"${px}\" y=\"${py}\" width=\"${pw}\" height=\"20\" fill=\"${theme.param.plateFill}\" stroke=\"${theme.param.plateStroke}\" stroke-width=\"0.5\"/>`,\n      );\n      const keyNorm = param.key.trim().toLowerCase();\n      const text = keyNorm === blockLabelNorm\n        ? sanitizeForSvg(param.value)\n        : `${sanitizeForSvg(param.key)}: ${sanitizeForSvg(param.value)}`;\n      parts.push(\n        `<text x=\"${px + pw / 2}\" y=\"${py + 14}\" text-anchor=\"middle\" ` +\n        `font-family=\"${monoFont}\" font-size=\"10\" fill=\"${theme.param.textColor}\">${text}</text>`,\n      );\n      py += 20;\n    }\n  }\n\n  return parts.join('');\n}\n\nfunction buildJacks(theme: Theme, idPrefix: string, blocks: LayoutBlock[]): string {\n  if (theme.port.hideSocket) return '';\n  const parts: string[] = [];\n  const c = theme.port.colors;\n\n  for (const block of blocks) {\n    for (const port of block.ports) {\n      const { x, y } = port.position;\n      const id = sanitizeForSvg(`${block.id}.${port.id}`);\n      let group = `<g data-port=\"${id}\" filter=\"url(#${idPrefix}-jack-shadow)\">`;\n      group += `<circle cx=\"${x}\" cy=\"${y}\" r=\"8\" fill=\"${c.bezel}\" stroke=\"${c.bezelStroke}\" stroke-width=\"0.75\"/>`;\n      group += `<circle cx=\"${x}\" cy=\"${y}\" r=\"5\" fill=\"${c.ring}\"/>`;\n      group += `<circle cx=\"${x}\" cy=\"${y}\" r=\"3\" fill=\"${c.hole}\"/>`;\n      group += `<circle cx=\"${x}\" cy=\"${y}\" r=\"1\" fill=\"${c.pin}\"/>`;\n      group += `</g>`;\n      parts.push(group);\n    }\n  }\n\n  return parts.join('');\n}\n\nconst SIGNAL_PILL_LABEL: Record<SignalType, string> = {\n  audio: 'audio',\n  cv: 'cv',\n  pitch: '1v/oct',\n  gate: 'gate',\n  trigger: 'trig',\n  clock: 'clk',\n};\n\nfunction buildLabels(theme: Theme, blocks: LayoutBlock[]): string {\n  const parts: string[] = [];\n  const fontFamily = sanitizeForSvg(theme.port.fontFamily);\n  const pillShow = theme.port.pill.show;\n  const pillFontSize = theme.port.pill.fontSize;\n  const pillTextColor = theme.port.pill.textColor;\n  const pillRadius = theme.port.pill.cornerRadius;\n  const pillPadX = 3;\n  const pillHeight = 11;\n  const pillGap = 6;\n  const charWidth = 6.5;\n\n  for (const block of blocks) {\n    for (const port of block.ports) {\n      const { x, y } = port.position;\n      const isOut = port.direction === 'out';\n      const labelX = isOut ? x + 14 : x - 14;\n      const labelY = y + 3;\n      const anchor = isOut ? 'start' : 'end';\n      const display = sanitizeForSvg(port.display);\n      const labelWidth = port.display.length * charWidth;\n\n      parts.push(\n        `<text x=\"${labelX}\" y=\"${labelY}\" font-family=\"${fontFamily}\" ` +\n        `font-size=\"${theme.port.fontSize}\" fill=\"${theme.port.labelColor}\" font-weight=\"600\" ` +\n        `text-anchor=\"${anchor}\">${display}</text>`,\n      );\n\n      if (pillShow && port.signalType) {\n        const pillText = SIGNAL_PILL_LABEL[port.signalType];\n        const pillWidth = pillText.length * charWidth + pillPadX * 2;\n        const pillColor = theme.cable.colors[port.signalType].stroke;\n        // Position pill next to the label (away from the socket)\n        let pillX: number;\n        if (isOut) {\n          // socket → label → pill\n          pillX = labelX + labelWidth + pillGap;\n        } else {\n          // pill → label → socket; pill sits to the left of label's leftmost edge\n          pillX = labelX - labelWidth - pillGap - pillWidth;\n        }\n        const pillY = y - pillHeight / 2;\n        const textX = pillX + pillWidth / 2;\n        const textY = pillY + pillHeight / 2 + pillFontSize / 2 - 1;\n        parts.push(\n          `<rect class=\"pf-port-pill\" x=\"${pillX}\" y=\"${pillY}\" width=\"${pillWidth}\" height=\"${pillHeight}\" ` +\n          `rx=\"${pillRadius}\" fill=\"${pillColor}\" data-signal=\"${port.signalType}\"/>`,\n        );\n        parts.push(\n          `<text class=\"pf-port-pill-text\" x=\"${textX}\" y=\"${textY}\" text-anchor=\"middle\" ` +\n          `font-family=\"${fontFamily}\" font-size=\"${pillFontSize}\" fill=\"${pillTextColor}\" font-weight=\"600\">${sanitizeForSvg(pillText)}</text>`,\n        );\n      }\n    }\n  }\n\n  return parts.join('');\n}\n\nfunction buildAnnotations(theme: Theme, connections: LayoutConnection[]): string {\n  const annotated = connections.filter(c => c.annotation);\n  if (annotated.length === 0) return '';\n\n  const parts: string[] = [];\n  const fontFamily = sanitizeForSvg(theme.annotation.fontFamily);\n  const noteFontSize = theme.annotation.fontSize + 1;\n  const markerFontFamily = fontFamily;\n\n  // Numbered markers on cables\n  annotated.forEach((conn, i) => {\n    const num = i + 1;\n    const sx = conn.sourcePoint.x;\n    const sy = conn.sourcePoint.y;\n    const tx = conn.targetPoint.x;\n    const ty = conn.targetPoint.y;\n\n    let mx: number;\n    let my: number;\n\n    if (conn.isFeedback) {\n      // Feedback arcs dip below the diagram — place marker at the arc's bottom-middle.\n      // The path format is: M sx sy L (sx+20) sy L (sx+20) arcY L (tx-20) arcY ...\n      // Extract arcY from the third point.\n      mx = (sx + tx) / 2;\n      const match = conn.path.match(/L\\s+\\S+\\s+\\S+\\s+L\\s+\\S+\\s+(\\S+)/);\n      my = match ? parseFloat(match[1]) : Math.max(sy, ty) + 30;\n    } else {\n      mx = (sx + tx) / 2;\n      my = (sy + ty) / 2;\n    }\n\n    const markerStroke = conn.isFeedback\n      ? theme.cable.colors[conn.signalType].stroke\n      : theme.label.color;\n\n    parts.push(\n      `<circle cx=\"${mx}\" cy=\"${my}\" r=\"8\" fill=\"${theme.panel.highlight}\" ` +\n      `stroke=\"${markerStroke}\" stroke-width=\"0.5\" data-annotation-marker=\"${num}\"/>`,\n    );\n    parts.push(\n      `<text x=\"${mx}\" y=\"${my + 3}\" text-anchor=\"middle\" ` +\n      `font-family=\"${markerFontFamily}\" font-size=\"9\" ` +\n      `fill=\"${theme.label.color}\">${num}</text>`,\n    );\n  });\n\n  // Notes panel in upper-left\n  const panelX = -120;\n  let panelY = 20;\n  const lineGap = 14;\n\n  annotated.forEach((conn, i) => {\n    const num = i + 1;\n    const noteText = `${num}. ${sanitizeForSvg(conn.annotation!)}`;\n    parts.push(\n      `<text x=\"${panelX}\" y=\"${panelY}\" ` +\n      `font-family=\"${fontFamily}\" font-size=\"${noteFontSize}\" ` +\n      `fill=\"${theme.annotation.color}\">${noteText}</text>`,\n    );\n    panelY += lineGap;\n  });\n\n  return parts.join('');\n}\n\nfunction buildLegend(theme: Theme, layoutResult: LayoutResult): string {\n  const order: SignalType[] = ['audio', 'cv', 'pitch', 'gate', 'trigger', 'clock'];\n  const used = order.filter(t => (layoutResult.signalTypeStats[t] ?? 0) > 0);\n  if (used.length === 0) return '';\n\n  const parts: string[] = [];\n  const fontFamily = sanitizeForSvg(theme.annotation.fontFamily);\n  const itemWidth = 70;\n  const y = layoutResult.height - 20;\n  let x = 20;\n\n  for (const sig of used) {\n    const color = theme.cable.colors[sig].stroke;\n    let g = `<g transform=\"translate(${x}, ${y})\">`;\n    g += `<line x1=\"0\" y1=\"0\" x2=\"20\" y2=\"0\" stroke=\"${color}\" stroke-width=\"3\" stroke-linecap=\"round\"/>`;\n    g += `<text x=\"26\" y=\"3\" font-family=\"${fontFamily}\" font-size=\"9\" fill=\"${theme.annotation.color}\">${sig}</text>`;\n    g += `</g>`;\n    parts.push(g);\n    x += itemWidth;\n  }\n\n  return parts.join('');\n}\n\n// ── Main renderer ──\n\nexport function renderSvg(layoutResult: LayoutResult, theme: Theme): string {\n  const idPrefix = genId();\n  const width = layoutResult.width;\n  const height = layoutResult.height;\n  const minWidth = Math.round(width);\n\n  const desc = buildDesc(layoutResult);\n\n  // Build defs\n  const defsParts: string[] = [];\n  defsParts.push(\n    `<filter id=\"${idPrefix}-panel-shadow\" x=\"-20%\" y=\"-20%\" width=\"140%\" height=\"140%\">` +\n    `<feDropShadow dx=\"0\" dy=\"2\" stdDeviation=\"${theme.panel.shadowBlur}\" flood-opacity=\"${theme.panel.shadowOpacity}\"/>` +\n    `</filter>`,\n  );\n  defsParts.push(\n    `<filter id=\"${idPrefix}-jack-shadow\" x=\"-20%\" y=\"-20%\" width=\"140%\" height=\"140%\">` +\n    `<feDropShadow dx=\"0\" dy=\"0.5\" stdDeviation=\"0.8\" flood-opacity=\"0.15\"/>` +\n    `</filter>`,\n  );\n  if (theme.grid) {\n    const spacing = theme.grid.spacing;\n    defsParts.push(\n      `<pattern id=\"${idPrefix}-dots\" width=\"${spacing}\" height=\"${spacing}\" patternUnits=\"userSpaceOnUse\">` +\n      `<circle cx=\"${spacing / 2}\" cy=\"${spacing / 2}\" r=\"${theme.grid.dotRadius}\" fill=\"${theme.grid.dotColor}\" opacity=\"${theme.grid.opacity}\"/>` +\n      `</pattern>`,\n    );\n  }\n\n  // Assemble layers\n  const layers = [\n    `<g class=\"pf-layer-bg\">${buildBackground(theme, idPrefix, width, height)}</g>`,\n    `<g class=\"pf-layer-cables\">${buildCables(theme, layoutResult.connections)}</g>`,\n    `<g class=\"pf-layer-panels\" >${buildPanels(theme, idPrefix, layoutResult.blocks)}</g>`,\n    `<g class=\"pf-layer-params\">${buildParams(layoutResult.blocks, theme)}</g>`,\n    `<g class=\"pf-layer-jacks\">${buildJacks(theme, idPrefix, layoutResult.blocks)}</g>`,\n    `<g class=\"pf-layer-labels\">${buildLabels(theme, layoutResult.blocks)}</g>`,\n    `<g class=\"pf-layer-annotations\">${buildAnnotations(theme, layoutResult.connections)}</g>`,\n    `<g class=\"pf-layer-legend\">${buildLegend(theme, layoutResult)}</g>`,\n  ].join('');\n\n  const style =\n    `<style>@media print { .pf-panel, .pf-jack { filter: none; } }</style>`;\n\n  // Extend the viewBox horizontally so port labels (\"Fall CV\", etc.) on the\n  // leftmost and rightmost blocks don't get clipped outside the SVG.\n  const labelPadX = 130;\n  const vbWidth = width + labelPadX * 2;\n  const svg =\n    `<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"${-labelPadX} 0 ${vbWidth} ${height}\" width=\"100%\" ` +\n    `data-pf-min-width=\"${minWidth + labelPadX * 2}\" role=\"img\" aria-labelledby=\"${idPrefix}-title ${idPrefix}-desc\">` +\n    `<title id=\"${idPrefix}-title\">Patch diagram</title>` +\n    `<desc id=\"${idPrefix}-desc\">${desc}</desc>` +\n    style +\n    `<defs>${defsParts.join('')}</defs>` +\n    layers +\n    `</svg>`;\n\n  return svg;\n}\n","import type { Theme, DeepPartial } from '../types';\n\nexport const defaultTheme: Theme = {\n  background: 'transparent',\n  panel: {\n    fill: '#e8e4dc',\n    stroke: '#cec8be',\n    highlight: '#f2efe8',\n    shadow: '#bdb8ae',\n    cornerRadius: 0,\n    shadowBlur: 3,\n    shadowOpacity: 0.10,\n    bevelWidth: 1,\n  },\n  label: {\n    fontFamily: \"system-ui, -apple-system, BlinkMacSystemFont, 'Segoe UI', sans-serif\",\n    color: '#1a1a1a',\n    subColor: '#888888',\n    plateFill: '#f4f1ea',\n    plateStroke: '#c5c0b6',\n  },\n  param: {\n    plateFill: '#f0ede6',\n    plateStroke: '#d5d0c6',\n    textColor: '#555555',\n  },\n  port: {\n    fontFamily: \"'SF Mono', 'Fira Code', Consolas, 'Courier New', monospace\",\n    fontSize: 9,\n    colors: {\n      bezel: '#c0bbb2',\n      bezelStroke: '#a8a39a',\n      ring: '#8a8580',\n      hole: '#555555',\n      pin: '#333333',\n    },\n    hideSocket: false,\n    labelColor: '#1a1a1a',\n    pill: {\n      show: true,\n      fontSize: 8,\n      textColor: '#ffffff',\n      cornerRadius: 0,\n    },\n  },\n  cable: {\n    width: 3,\n    colors: {\n      audio:   { stroke: '#e88ca5', plugTip: '#d47a93' },\n      cv:      { stroke: '#7bafd4', plugTip: '#6a9ec3' },\n      pitch:   { stroke: '#8cb87c', plugTip: '#7ba76b' },\n      gate:    { stroke: '#d4a054', plugTip: '#c49244' },\n      trigger: { stroke: '#d4a054', plugTip: '#c49244' },\n      clock:   { stroke: '#d4a054', plugTip: '#c49244' },\n    },\n    plugTipRadius: 3.5,\n  },\n  annotation: {\n    fontFamily: \"'SF Mono', 'Fira Code', Consolas, 'Courier New', monospace\",\n    fontSize: 9,\n    color: '#888888',\n    haloColor: '#f7f5f0',\n  },\n  grid: {\n    dotColor: '#aaaaaa',\n    dotRadius: 0.5,\n    spacing: 12,\n    opacity: 0.3,\n  },\n};\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction deepMerge<T>(target: T, source: DeepPartial<T>): T {\n  const result: Record<string, unknown> = { ...(target as Record<string, unknown>) };\n  const src = source as Record<string, unknown>;\n  const tgt = target as Record<string, unknown>;\n  for (const key in src) {\n    const sourceVal = src[key];\n    const targetVal = tgt[key];\n    if (\n      sourceVal !== null &&\n      typeof sourceVal === 'object' &&\n      !Array.isArray(sourceVal) &&\n      targetVal !== null &&\n      typeof targetVal === 'object' &&\n      !Array.isArray(targetVal)\n    ) {\n      result[key] = deepMerge(\n        targetVal as Record<string, unknown>,\n        sourceVal as DeepPartial<Record<string, unknown>>,\n      );\n    } else if (sourceVal !== undefined) {\n      result[key] = sourceVal;\n    }\n  }\n  return result as T;\n}\n\nexport function createTheme(overrides: DeepPartial<Theme>): Theme {\n  return deepMerge(defaultTheme, overrides);\n}\n","import type { Theme } from '../types';\nimport { createTheme } from './default';\n\n// Minimal dark-mode variant. Panels stay cream (the Braun aesthetic looks\n// fine on dark backgrounds). Only out-of-panel text (port labels, annotations,\n// legend) changes to remain readable on dark page backgrounds like GitHub's.\n//\n// Port labels and legend switch from near-black to a cream/light tone so they\n// read on the dark page background while still looking acceptable when they\n// graze the cream panel edges.\nexport const darkTheme: Theme = createTheme({\n  port: {\n    // Port labels sit outside the panel, on the page. Use a light cream so\n    // they read on dark page backgrounds.\n    labelColor: '#e8e4dc',\n  },\n  annotation: {\n    // Annotations on cables sit on the page bg. Lighten the text and match\n    // the halo to the GitHub dark page bg so the \"chip\" doesn't flash cream.\n    color: '#d0d0d0',\n    haloColor: '#0d1117',\n  },\n  grid: {\n    // Faint dot grid needs to be visible on dark backgrounds too.\n    dotColor: '#555555',\n    dotRadius: 0.5,\n    spacing: 12,\n    opacity: 0.5,\n  },\n});\n","export { parse } from './parser';\nexport { layout } from './layout';\nexport { renderSvg } from './renderer';\nexport { createTheme, defaultTheme } from './themes/default';\nexport { darkTheme } from './themes/dark';\n\nimport type { RenderOptions } from './types';\nimport { parse } from './parser';\nimport { layout } from './layout';\nimport { renderSvg } from './renderer';\nimport { createTheme, defaultTheme } from './themes/default';\n\n// Convenience: full pipeline\nexport function render(notation: string, options?: RenderOptions): string {\n  const parseResult = parse(notation);\n  const { graph } = parseResult;\n  const totalBlocks = graph.declaredBlocks.length + graph.stubBlocks.length;\n  const totalConnections = graph.connections.length + graph.feedbackEdges.length;\n  if (totalBlocks === 0 && totalConnections === 0) {\n    throw new Error('patchflow parse error: empty patch — no modules or connections found');\n  }\n  const layoutResult = layout(graph, {\n    direction: 'LR',\n  });\n  const theme = options?.theme ? createTheme(options.theme) : defaultTheme;\n  return renderSvg(layoutResult, theme);\n}\n\n// Re-export all types\nexport type {\n  SignalType, Port, Block, Connection, ConnectionEndpoint,\n  PatchGraph, Param,\n  LayoutBlock, LayoutConnection, LayoutPort, LayoutResult, Point,\n  Theme, CableColor, SocketColors,\n  RenderOptions, LayoutOptions,\n  ParseResult, ParseDiagnostic, ErrorCode, ErrorSeverity,\n  DeepPartial,\n} from './types';\n"],"mappings":";;;;;;;AAAA;AAAA;AAAA;AAEA,QAAI,oBAAoB;AACxB,QAAI,aAAa;AACjB,QAAI,iBAAiB;AAYrB,QAAM,QAAN,MAAY;AAAA,MACV,cAAc;AAAA,MACd,gBAAgB;AAAA,MAChB,cAAc;AAAA;AAAA,MAGd;AAAA;AAAA,MAGA,sBAAsB,MAAM;AAAA;AAAA,MAG5B,sBAAsB,MAAM;AAAA;AAAA,MAG5B,SAAS,CAAC;AAAA;AAAA,MAGV,MAAM,CAAC;AAAA;AAAA,MAGP,SAAS,CAAC;AAAA;AAAA,MAGV,OAAO,CAAC;AAAA;AAAA,MAGR,QAAQ,CAAC;AAAA;AAAA,MAGT,YAAY,CAAC;AAAA;AAAA,MAGb,cAAc,CAAC;AAAA;AAAA,MAGf,aAAa;AAAA;AAAA,MAGb,aAAa;AAAA,MAEb;AAAA,MAEA;AAAA,MAEA,YAAY,MAAM;AAChB,YAAI,MAAM;AACR,eAAK,cAAc,OAAO,OAAO,MAAM,UAAU,IAAI,KAAK,WAAW;AACrE,eAAK,gBAAgB,OAAO,OAAO,MAAM,YAAY,IAAI,KAAK,aAAa;AAC3E,eAAK,cAAc,OAAO,OAAO,MAAM,UAAU,IAAI,KAAK,WAAW;AAAA,QACvE;AAEA,YAAI,KAAK,aAAa;AAEpB,eAAK,UAAU,CAAC;AAGhB,eAAK,YAAY,CAAC;AAClB,eAAK,UAAU,UAAU,IAAI,CAAC;AAAA,QAChC;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa;AACX,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,eAAe;AACb,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,aAAa;AACX,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,SAAS,OAAO;AACd,aAAK,SAAS;AACd,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA,MAKA,QAAQ;AACN,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAYA,oBAAoB,YAAY;AAC9B,aAAK,sBAAsB;AAC3B,YAAI,OAAO,eAAe,YAAY;AACpC,eAAK,sBAAsB,MAAM;AAAA,QACnC;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ;AACN,eAAO,OAAO,KAAK,KAAK,MAAM;AAAA,MAChC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,UAAU;AACR,YAAI,OAAO;AACX,eAAO,KAAK,MAAM,EAAE,OAAO,OAAK,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,WAAW,CAAC;AAAA,MACvE;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,YAAI,OAAO;AACX,eAAO,KAAK,MAAM,EAAE,OAAO,OAAK,OAAO,KAAK,KAAK,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;AAAA,MACxE;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS,IAAI,OAAO;AAClB,YAAI,OAAO;AACX,YAAI,OAAO;AACX,WAAG,QAAQ,SAAS,GAAG;AACrB,cAAI,KAAK,SAAS,GAAG;AACnB,iBAAK,QAAQ,GAAG,KAAK;AAAA,UACvB,OAAO;AACL,iBAAK,QAAQ,CAAC;AAAA,UAChB;AAAA,QACF,CAAC;AACD,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,GAAG,OAAO;AAChB,YAAI,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG;AACjC,cAAI,UAAU,SAAS,GAAG;AACxB,iBAAK,OAAO,CAAC,IAAI;AAAA,UACnB;AACA,iBAAO;AAAA,QACT;AAEA,aAAK,OAAO,CAAC,IAAI,UAAU,SAAS,IAAI,QAAQ,KAAK,oBAAoB,CAAC;AAC1E,YAAI,KAAK,aAAa;AACpB,eAAK,QAAQ,CAAC,IAAI;AAClB,eAAK,UAAU,CAAC,IAAI,CAAC;AACrB,eAAK,UAAU,UAAU,EAAE,CAAC,IAAI;AAAA,QAClC;AACA,aAAK,IAAI,CAAC,IAAI,CAAC;AACf,aAAK,OAAO,CAAC,IAAI,CAAC;AAClB,aAAK,KAAK,CAAC,IAAI,CAAC;AAChB,aAAK,MAAM,CAAC,IAAI,CAAC;AACjB,UAAE,KAAK;AACP,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,KAAK,GAAG;AACN,eAAO,KAAK,OAAO,CAAC;AAAA,MACtB;AAAA;AAAA;AAAA;AAAA,MAKA,QAAQ,GAAG;AACT,eAAO,OAAO,OAAO,KAAK,QAAQ,CAAC;AAAA,MACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,WAAW,GAAG;AACZ,YAAI,OAAO;AACX,YAAI,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG;AACjC,cAAI,aAAa,OAAK,KAAK,WAAW,KAAK,UAAU,CAAC,CAAC;AACvD,iBAAO,KAAK,OAAO,CAAC;AACpB,cAAI,KAAK,aAAa;AACpB,iBAAK,4BAA4B,CAAC;AAClC,mBAAO,KAAK,QAAQ,CAAC;AACrB,iBAAK,SAAS,CAAC,EAAE,QAAQ,SAAS,OAAO;AACvC,mBAAK,UAAU,KAAK;AAAA,YACtB,CAAC;AACD,mBAAO,KAAK,UAAU,CAAC;AAAA,UACzB;AACA,iBAAO,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,QAAQ,UAAU;AAC3C,iBAAO,KAAK,IAAI,CAAC;AACjB,iBAAO,KAAK,OAAO,CAAC;AACpB,iBAAO,KAAK,KAAK,KAAK,CAAC,CAAC,EAAE,QAAQ,UAAU;AAC5C,iBAAO,KAAK,KAAK,CAAC;AAClB,iBAAO,KAAK,MAAM,CAAC;AACnB,YAAE,KAAK;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU,GAAG,QAAQ;AACnB,YAAI,CAAC,KAAK,aAAa;AACrB,gBAAM,IAAI,MAAM,2CAA2C;AAAA,QAC7D;AAEA,YAAI,WAAW,QAAW;AACxB,mBAAS;AAAA,QACX,OAAO;AAEL,oBAAU;AACV,mBAAS,WAAW,QAAQ,aAAa,QAAW,WAAW,KAAK,OAAO,QAAQ,GAAG;AACpF,gBAAI,aAAa,GAAG;AAClB,oBAAM,IAAI,MAAM,aAAa,SAAQ,mBAAmB,IACpD,uBAAuB;AAAA,YAC7B;AAAA,UACF;AAEA,eAAK,QAAQ,MAAM;AAAA,QACrB;AAEA,aAAK,QAAQ,CAAC;AACd,aAAK,4BAA4B,CAAC;AAClC,aAAK,QAAQ,CAAC,IAAI;AAClB,aAAK,UAAU,MAAM,EAAE,CAAC,IAAI;AAC5B,eAAO;AAAA,MACT;AAAA,MAEA,4BAA4B,GAAG;AAC7B,eAAO,KAAK,UAAU,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO,GAAG;AACR,YAAI,KAAK,aAAa;AACpB,cAAI,SAAS,KAAK,QAAQ,CAAC;AAC3B,cAAI,WAAW,YAAY;AACzB,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS,IAAI,YAAY;AACvB,YAAI,KAAK,aAAa;AACpB,cAAI,WAAW,KAAK,UAAU,CAAC;AAC/B,cAAI,UAAU;AACZ,mBAAO,OAAO,KAAK,QAAQ;AAAA,UAC7B;AAAA,QACF,WAAW,MAAM,YAAY;AAC3B,iBAAO,KAAK,MAAM;AAAA,QACpB,WAAW,KAAK,QAAQ,CAAC,GAAG;AAC1B,iBAAO,CAAC;AAAA,QACV;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa,GAAG;AACd,YAAI,SAAS,KAAK,OAAO,CAAC;AAC1B,YAAI,QAAQ;AACV,iBAAO,OAAO,KAAK,MAAM;AAAA,QAC3B;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,WAAW,GAAG;AACZ,YAAI,QAAQ,KAAK,MAAM,CAAC;AACxB,YAAI,OAAO;AACT,iBAAO,OAAO,KAAK,KAAK;AAAA,QAC1B;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,GAAG;AACX,YAAI,QAAQ,KAAK,aAAa,CAAC;AAC/B,YAAI,OAAO;AACT,gBAAM,QAAQ,IAAI,IAAI,KAAK;AAC3B,mBAAS,QAAQ,KAAK,WAAW,CAAC,GAAG;AACnC,kBAAM,IAAI,IAAI;AAAA,UAChB;AAEA,iBAAO,MAAM,KAAK,MAAM,OAAO,CAAC;AAAA,QAClC;AAAA,MACF;AAAA,MAEA,OAAO,GAAG;AACR,YAAI;AACJ,YAAI,KAAK,WAAW,GAAG;AACrB,sBAAY,KAAK,WAAW,CAAC;AAAA,QAC/B,OAAO;AACL,sBAAY,KAAK,UAAU,CAAC;AAAA,QAC9B;AACA,eAAO,UAAU,WAAW;AAAA,MAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,YAAY,QAAQ;AAClB,YAAI,OAAO,IAAI,KAAK,YAAY;AAAA,UAC9B,UAAU,KAAK;AAAA,UACf,YAAY,KAAK;AAAA,UACjB,UAAU,KAAK;AAAA,QACjB,CAAC;AAED,aAAK,SAAS,KAAK,MAAM,CAAC;AAE1B,YAAI,OAAO;AACX,eAAO,QAAQ,KAAK,MAAM,EAAE,QAAQ,SAAS,CAAC,GAAG,KAAK,GAAG;AACvD,cAAI,OAAO,CAAC,GAAG;AACb,iBAAK,QAAQ,GAAG,KAAK;AAAA,UACvB;AAAA,QACF,CAAC;AAED,eAAO,OAAO,KAAK,SAAS,EAAE,QAAQ,SAAS,GAAG;AAChD,cAAI,KAAK,QAAQ,EAAE,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC,GAAG;AAC1C,iBAAK,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC;AAAA,UAC9B;AAAA,QACF,CAAC;AAED,YAAI,UAAU,CAAC;AACf,iBAAS,WAAW,GAAG;AACrB,cAAI,SAAS,KAAK,OAAO,CAAC;AAC1B,cAAI,WAAW,UAAa,KAAK,QAAQ,MAAM,GAAG;AAChD,oBAAQ,CAAC,IAAI;AACb,mBAAO;AAAA,UACT,WAAW,UAAU,SAAS;AAC5B,mBAAO,QAAQ,MAAM;AAAA,UACvB,OAAO;AACL,mBAAO,WAAW,MAAM;AAAA,UAC1B;AAAA,QACF;AAEA,YAAI,KAAK,aAAa;AACpB,eAAK,MAAM,EAAE,QAAQ,OAAK,KAAK,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC;AAAA,QAC5D;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,oBAAoB,YAAY;AAC9B,aAAK,sBAAsB;AAC3B,YAAI,OAAO,eAAe,YAAY;AACpC,eAAK,sBAAsB,MAAM;AAAA,QACnC;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,OAAO,OAAO,KAAK,SAAS;AAAA,MACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,IAAI,OAAO;AACjB,YAAI,OAAO;AACX,YAAI,OAAO;AACX,WAAG,OAAO,SAAS,GAAG,GAAG;AACvB,cAAI,KAAK,SAAS,GAAG;AACnB,iBAAK,QAAQ,GAAG,GAAG,KAAK;AAAA,UAC1B,OAAO;AACL,iBAAK,QAAQ,GAAG,CAAC;AAAA,UACnB;AACA,iBAAO;AAAA,QACT,CAAC;AACD,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU;AACR,YAAI,GAAG,GAAG,MAAM;AAChB,YAAI,iBAAiB;AACrB,YAAI,OAAO,UAAU,CAAC;AAEtB,YAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,MAAM;AAC5D,cAAI,KAAK;AACT,cAAI,KAAK;AACT,iBAAO,KAAK;AACZ,cAAI,UAAU,WAAW,GAAG;AAC1B,oBAAQ,UAAU,CAAC;AACnB,6BAAiB;AAAA,UACnB;AAAA,QACF,OAAO;AACL,cAAI;AACJ,cAAI,UAAU,CAAC;AACf,iBAAO,UAAU,CAAC;AAClB,cAAI,UAAU,SAAS,GAAG;AACxB,oBAAQ,UAAU,CAAC;AACnB,6BAAiB;AAAA,UACnB;AAAA,QACF;AAEA,YAAI,KAAK;AACT,YAAI,KAAK;AACT,YAAI,SAAS,QAAW;AACtB,iBAAO,KAAK;AAAA,QACd;AAEA,YAAI,IAAI,aAAa,KAAK,aAAa,GAAG,GAAG,IAAI;AACjD,YAAI,OAAO,OAAO,KAAK,aAAa,CAAC,GAAG;AACtC,cAAI,gBAAgB;AAClB,iBAAK,YAAY,CAAC,IAAI;AAAA,UACxB;AACA,iBAAO;AAAA,QACT;AAEA,YAAI,SAAS,UAAa,CAAC,KAAK,eAAe;AAC7C,gBAAM,IAAI,MAAM,mDAAmD;AAAA,QACrE;AAIA,aAAK,QAAQ,CAAC;AACd,aAAK,QAAQ,CAAC;AAEd,aAAK,YAAY,CAAC,IAAI,iBAAiB,QAAQ,KAAK,oBAAoB,GAAG,GAAG,IAAI;AAElF,YAAI,UAAU,cAAc,KAAK,aAAa,GAAG,GAAG,IAAI;AAExD,YAAI,QAAQ;AACZ,YAAI,QAAQ;AAEZ,eAAO,OAAO,OAAO;AACrB,aAAK,UAAU,CAAC,IAAI;AACpB,6BAAqB,KAAK,OAAO,CAAC,GAAG,CAAC;AACtC,6BAAqB,KAAK,MAAM,CAAC,GAAG,CAAC;AACrC,aAAK,IAAI,CAAC,EAAE,CAAC,IAAI;AACjB,aAAK,KAAK,CAAC,EAAE,CAAC,IAAI;AAClB,aAAK;AACL,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,KAAK,GAAG,GAAG,MAAM;AACf,YAAI,IAAK,UAAU,WAAW,IAC1B,YAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1C,aAAa,KAAK,aAAa,GAAG,GAAG,IAAI;AAC7C,eAAO,KAAK,YAAY,CAAC;AAAA,MAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY;AACV,cAAM,OAAO,KAAK,KAAK,GAAG,SAAS;AACnC,YAAI,OAAO,SAAS,UAAU;AAC5B,iBAAO,EAAC,OAAO,KAAI;AAAA,QACrB;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,GAAG,GAAG,MAAM;AAClB,YAAI,IAAK,UAAU,WAAW,IAC1B,YAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1C,aAAa,KAAK,aAAa,GAAG,GAAG,IAAI;AAC7C,eAAO,OAAO,OAAO,KAAK,aAAa,CAAC;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,WAAW,GAAG,GAAG,MAAM;AACrB,YAAI,IAAK,UAAU,WAAW,IAC1B,YAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1C,aAAa,KAAK,aAAa,GAAG,GAAG,IAAI;AAC7C,YAAI,OAAO,KAAK,UAAU,CAAC;AAC3B,YAAI,MAAM;AACR,cAAI,KAAK;AACT,cAAI,KAAK;AACT,iBAAO,KAAK,YAAY,CAAC;AACzB,iBAAO,KAAK,UAAU,CAAC;AACvB,iCAAuB,KAAK,OAAO,CAAC,GAAG,CAAC;AACxC,iCAAuB,KAAK,MAAM,CAAC,GAAG,CAAC;AACvC,iBAAO,KAAK,IAAI,CAAC,EAAE,CAAC;AACpB,iBAAO,KAAK,KAAK,CAAC,EAAE,CAAC;AACrB,eAAK;AAAA,QACP;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,GAAG,GAAG;AACZ,YAAI,MAAM,KAAK,IAAI,CAAC;AACpB,YAAI,KAAK;AACP,cAAI,QAAQ,OAAO,OAAO,GAAG;AAC7B,cAAI,CAAC,GAAG;AACN,mBAAO;AAAA,UACT;AACA,iBAAO,MAAM,OAAO,UAAQ,KAAK,MAAM,CAAC;AAAA,QAC1C;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,SAAS,GAAG,GAAG;AACb,YAAI,OAAO,KAAK,KAAK,CAAC;AACtB,YAAI,MAAM;AACR,cAAI,QAAQ,OAAO,OAAO,IAAI;AAC9B,cAAI,CAAC,GAAG;AACN,mBAAO;AAAA,UACT;AACA,iBAAO,MAAM,OAAO,UAAQ,KAAK,MAAM,CAAC;AAAA,QAC1C;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,GAAG,GAAG;AACd,YAAI,UAAU,KAAK,QAAQ,GAAG,CAAC;AAC/B,YAAI,SAAS;AACX,iBAAO,QAAQ,OAAO,KAAK,SAAS,GAAG,CAAC,CAAC;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AAEA,aAAS,qBAAqB,KAAK,GAAG;AACpC,UAAI,IAAI,CAAC,GAAG;AACV,YAAI,CAAC;AAAA,MACP,OAAO;AACL,YAAI,CAAC,IAAI;AAAA,MACX;AAAA,IACF;AAEA,aAAS,uBAAuB,KAAK,GAAG;AACtC,UAAI,CAAC,EAAE,IAAI,CAAC,GAAG;AAAE,eAAO,IAAI,CAAC;AAAA,MAAG;AAAA,IAClC;AAEA,aAAS,aAAa,YAAY,IAAI,IAAI,MAAM;AAC9C,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK;AACb,UAAI,CAAC,cAAc,IAAI,GAAG;AACxB,YAAI,MAAM;AACV,YAAI;AACJ,YAAI;AAAA,MACN;AACA,aAAO,IAAI,iBAAiB,IAAI,kBACpB,SAAS,SAAY,oBAAoB;AAAA,IACvD;AAEA,aAAS,cAAc,YAAY,IAAI,IAAI,MAAM;AAC/C,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK;AACb,UAAI,CAAC,cAAc,IAAI,GAAG;AACxB,YAAI,MAAM;AACV,YAAI;AACJ,YAAI;AAAA,MACN;AACA,UAAI,UAAW,EAAE,GAAM,EAAK;AAC5B,UAAI,MAAM;AACR,gBAAQ,OAAO;AAAA,MACjB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,YAAY,SAAS;AACxC,aAAO,aAAa,YAAY,QAAQ,GAAG,QAAQ,GAAG,QAAQ,IAAI;AAAA,IACpE;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACvrBjB;AAAA;AAAA;AAAA,WAAO,UAAU;AAAA;AAAA;;;ACAjB;AAAA;AAAA;AACA,WAAO,UAAU;AAAA,MACf,OAAO;AAAA,MACP,SAAS;AAAA,IACX;AAAA;AAAA;;;ACJA;AAAA;AAAA;AAAA,QAAI,QAAQ;AAEZ,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAMA,aAAS,MAAM,GAAG;AAChB,UAAI,OAAO;AAAA,QACT,SAAS;AAAA,UACP,UAAU,EAAE,WAAW;AAAA,UACvB,YAAY,EAAE,aAAa;AAAA,UAC3B,UAAU,EAAE,WAAW;AAAA,QACzB;AAAA,QACA,OAAO,WAAW,CAAC;AAAA,QACnB,OAAO,WAAW,CAAC;AAAA,MACrB;AAEA,UAAI,EAAE,MAAM,MAAM,QAAW;AAC3B,aAAK,QAAQ,gBAAgB,EAAE,MAAM,CAAC;AAAA,MACxC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,GAAG;AACrB,aAAO,EAAE,MAAM,EAAE,IAAI,SAAS,GAAG;AAC/B,YAAI,YAAY,EAAE,KAAK,CAAC;AACxB,YAAI,SAAS,EAAE,OAAO,CAAC;AACvB,YAAI,OAAO,EAAE,EAAK;AAClB,YAAI,cAAc,QAAW;AAC3B,eAAK,QAAQ;AAAA,QACf;AACA,YAAI,WAAW,QAAW;AACxB,eAAK,SAAS;AAAA,QAChB;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,aAAS,WAAW,GAAG;AACrB,aAAO,EAAE,MAAM,EAAE,IAAI,SAAS,GAAG;AAC/B,YAAI,YAAY,EAAE,KAAK,CAAC;AACxB,YAAI,OAAO,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAC5B,YAAI,EAAE,SAAS,QAAW;AACxB,eAAK,OAAO,EAAE;AAAA,QAChB;AACA,YAAI,cAAc,QAAW;AAC3B,eAAK,QAAQ;AAAA,QACf;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAYA,aAAS,KAAK,MAAM;AAClB,UAAI,IAAI,IAAI,MAAM,KAAK,OAAO,EAAE,SAAS,KAAK,KAAK;AACnD,WAAK,MAAM,QAAQ,SAAS,OAAO;AACjC,UAAE,QAAQ,MAAM,GAAG,MAAM,KAAK;AAC9B,YAAI,MAAM,QAAQ;AAChB,YAAE,UAAU,MAAM,GAAG,MAAM,MAAM;AAAA,QACnC;AAAA,MACF,CAAC;AACD,WAAK,MAAM,QAAQ,SAAS,OAAO;AACjC,UAAE,QAAQ,EAAE,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG,MAAM,MAAM,KAAK,GAAG,MAAM,KAAK;AAAA,MACrE,CAAC;AACD,aAAO;AAAA,IACT;AAAA;AAAA;;;AC/EA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,WAAW,GAAG;AACrB,UAAI,UAAU,CAAC;AACf,UAAI,QAAQ,CAAC;AACb,UAAI;AAEJ,eAAS,IAAI,GAAG;AACd,YAAI,OAAO,OAAO,SAAS,CAAC,EAAG;AAC/B,gBAAQ,CAAC,IAAI;AACb,aAAK,KAAK,CAAC;AACX,UAAE,WAAW,CAAC,EAAE,QAAQ,GAAG;AAC3B,UAAE,aAAa,CAAC,EAAE,QAAQ,GAAG;AAAA,MAC/B;AAEA,QAAE,MAAM,EAAE,QAAQ,SAAS,GAAG;AAC5B,eAAO,CAAC;AACR,YAAI,CAAC;AACL,YAAI,KAAK,QAAQ;AACf,gBAAM,KAAK,IAAI;AAAA,QACjB;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;ACxBA;AAAA;AAAA;AAOA,QAAM,gBAAN,MAAoB;AAAA,MAClB,OAAO,CAAC;AAAA,MACR,cAAc,CAAC;AAAA;AAAA;AAAA;AAAA,MAKf,OAAO;AACL,eAAO,KAAK,KAAK;AAAA,MACnB;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO;AACL,eAAO,KAAK,KAAK,IAAI,SAAS,GAAG;AAAE,iBAAO,EAAE;AAAA,QAAK,CAAC;AAAA,MACpD;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,KAAK;AACP,eAAO,OAAO,OAAO,KAAK,aAAa,GAAG;AAAA,MAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,SAAS,KAAK;AACZ,YAAI,QAAQ,KAAK,YAAY,GAAG;AAChC,YAAI,UAAU,QAAW;AACvB,iBAAO,KAAK,KAAK,KAAK,EAAE;AAAA,QAC1B;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM;AACJ,YAAI,KAAK,KAAK,MAAM,GAAG;AACrB,gBAAM,IAAI,MAAM,iBAAiB;AAAA,QACnC;AACA,eAAO,KAAK,KAAK,CAAC,EAAE;AAAA,MACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,IAAI,KAAK,UAAU;AACjB,YAAI,aAAa,KAAK;AACtB,cAAM,OAAO,GAAG;AAChB,YAAI,CAAC,OAAO,OAAO,YAAY,GAAG,GAAG;AACnC,cAAI,MAAM,KAAK;AACf,cAAI,QAAQ,IAAI;AAChB,qBAAW,GAAG,IAAI;AAClB,cAAI,KAAK,EAAC,KAAU,SAAkB,CAAC;AACvC,eAAK,UAAU,KAAK;AACpB,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA,MAKA,YAAY;AACV,aAAK,MAAM,GAAG,KAAK,KAAK,SAAS,CAAC;AAClC,YAAI,MAAM,KAAK,KAAK,IAAI;AACxB,eAAO,KAAK,YAAY,IAAI,GAAG;AAC/B,aAAK,SAAS,CAAC;AACf,eAAO,IAAI;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,SAAS,KAAK,UAAU;AACtB,YAAI,QAAQ,KAAK,YAAY,GAAG;AAChC,YAAI,WAAW,KAAK,KAAK,KAAK,EAAE,UAAU;AACxC,gBAAM,IAAI,MAAM,yDACF,MAAM,WAAW,KAAK,KAAK,KAAK,EAAE,WAAW,WAAW,QAAQ;AAAA,QAChF;AACA,aAAK,KAAK,KAAK,EAAE,WAAW;AAC5B,aAAK,UAAU,KAAK;AAAA,MACtB;AAAA,MAEA,SAAS,GAAG;AACV,YAAI,MAAM,KAAK;AACf,YAAI,IAAI,IAAI;AACZ,YAAI,IAAI,IAAI;AACZ,YAAI,UAAU;AACd,YAAI,IAAI,IAAI,QAAQ;AAClB,oBAAU,IAAI,CAAC,EAAE,WAAW,IAAI,OAAO,EAAE,WAAW,IAAI;AACxD,cAAI,IAAI,IAAI,QAAQ;AAClB,sBAAU,IAAI,CAAC,EAAE,WAAW,IAAI,OAAO,EAAE,WAAW,IAAI;AAAA,UAC1D;AACA,cAAI,YAAY,GAAG;AACjB,iBAAK,MAAM,GAAG,OAAO;AACrB,iBAAK,SAAS,OAAO;AAAA,UACvB;AAAA,QACF;AAAA,MACF;AAAA,MAEA,UAAU,OAAO;AACf,YAAI,MAAM,KAAK;AACf,YAAI,WAAW,IAAI,KAAK,EAAE;AAC1B,YAAI;AACJ,eAAO,UAAU,GAAG;AAClB,mBAAS,SAAS;AAClB,cAAI,IAAI,MAAM,EAAE,WAAW,UAAU;AACnC;AAAA,UACF;AACA,eAAK,MAAM,OAAO,MAAM;AACxB,kBAAQ;AAAA,QACV;AAAA,MACF;AAAA,MAEA,MAAM,GAAG,GAAG;AACV,YAAI,MAAM,KAAK;AACf,YAAI,aAAa,KAAK;AACtB,YAAI,WAAW,IAAI,CAAC;AACpB,YAAI,WAAW,IAAI,CAAC;AACpB,YAAI,CAAC,IAAI;AACT,YAAI,CAAC,IAAI;AACT,mBAAW,SAAS,GAAG,IAAI;AAC3B,mBAAW,SAAS,GAAG,IAAI;AAAA,MAC7B;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACrJjB;AAAA;AAAA;AAAA,QAAI,gBAAgB;AAEpB,WAAO,UAAU;AAEjB,QAAI,sBAAsB,MAAM;AAEhC,aAAS,SAAS,GAAG,QAAQ,UAAU,QAAQ;AAC7C,aAAO;AAAA,QAAY;AAAA,QAAG,OAAO,MAAM;AAAA,QACjC,YAAY;AAAA,QACZ,UAAU,SAAS,GAAG;AAAE,iBAAO,EAAE,SAAS,CAAC;AAAA,QAAG;AAAA,MAAC;AAAA,IACnD;AAEA,aAAS,YAAY,GAAG,QAAQ,UAAU,QAAQ;AAChD,UAAI,UAAU,CAAC;AACf,UAAI,KAAK,IAAI,cAAc;AAC3B,UAAI,GAAG;AAEP,UAAI,kBAAkB,SAAS,MAAM;AACnC,YAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,YAAI,SAAS,QAAQ,CAAC;AACtB,YAAI,SAAS,SAAS,IAAI;AAC1B,YAAI,WAAW,OAAO,WAAW;AAEjC,YAAI,SAAS,GAAG;AACd,gBAAM,IAAI,MAAM,8DACe,OAAO,cAAc,MAAM;AAAA,QAC5D;AAEA,YAAI,WAAW,OAAO,UAAU;AAC9B,iBAAO,WAAW;AAClB,iBAAO,cAAc;AACrB,aAAG,SAAS,GAAG,QAAQ;AAAA,QACzB;AAAA,MACF;AAEA,QAAE,MAAM,EAAE,QAAQ,SAASA,IAAG;AAC5B,YAAI,WAAWA,OAAM,SAAS,IAAI,OAAO;AACzC,gBAAQA,EAAC,IAAI,EAAE,SAAmB;AAClC,WAAG,IAAIA,IAAG,QAAQ;AAAA,MACpB,CAAC;AAED,aAAO,GAAG,KAAK,IAAI,GAAG;AACpB,YAAI,GAAG,UAAU;AACjB,iBAAS,QAAQ,CAAC;AAClB,YAAI,OAAO,aAAa,OAAO,mBAAmB;AAChD;AAAA,QACF;AAEA,eAAO,CAAC,EAAE,QAAQ,eAAe;AAAA,MACnC;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACpDA;AAAA;AAAA;AAAA,QAAI,WAAW;AAEf,WAAO,UAAU;AAEjB,aAAS,YAAY,GAAG,YAAY,UAAU;AAC5C,aAAO,EAAE,MAAM,EAAE,OAAO,SAAS,KAAK,GAAG;AACvC,YAAI,CAAC,IAAI,SAAS,GAAG,GAAG,YAAY,QAAQ;AAC5C,eAAO;AAAA,MACT,GAAG,CAAC,CAAC;AAAA,IACP;AAAA;AAAA;;;ACTA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,OAAO,GAAG;AACjB,UAAI,QAAQ;AACZ,UAAI,QAAQ,CAAC;AACb,UAAI,UAAU,CAAC;AACf,UAAI,UAAU,CAAC;AAEf,eAAS,IAAI,GAAG;AACd,YAAI,QAAQ,QAAQ,CAAC,IAAI;AAAA,UACvB,SAAS;AAAA,UACT,SAAS;AAAA,UACT,OAAO;AAAA,QACT;AACA,cAAM,KAAK,CAAC;AAEZ,UAAE,WAAW,CAAC,EAAE,QAAQ,SAASC,IAAG;AAClC,cAAI,CAAC,OAAO,OAAO,SAASA,EAAC,GAAG;AAC9B,gBAAIA,EAAC;AACL,kBAAM,UAAU,KAAK,IAAI,MAAM,SAAS,QAAQA,EAAC,EAAE,OAAO;AAAA,UAC5D,WAAW,QAAQA,EAAC,EAAE,SAAS;AAC7B,kBAAM,UAAU,KAAK,IAAI,MAAM,SAAS,QAAQA,EAAC,EAAE,KAAK;AAAA,UAC1D;AAAA,QACF,CAAC;AAED,YAAI,MAAM,YAAY,MAAM,OAAO;AACjC,cAAI,OAAO,CAAC;AACZ,cAAI;AACJ,aAAG;AACD,gBAAI,MAAM,IAAI;AACd,oBAAQ,CAAC,EAAE,UAAU;AACrB,iBAAK,KAAK,CAAC;AAAA,UACb,SAAS,MAAM;AACf,kBAAQ,KAAK,IAAI;AAAA,QACnB;AAAA,MACF;AAEA,QAAE,MAAM,EAAE,QAAQ,SAAS,GAAG;AAC5B,YAAI,CAAC,OAAO,OAAO,SAAS,CAAC,GAAG;AAC9B,cAAI,CAAC;AAAA,QACP;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;AC5CA;AAAA;AAAA;AAAA,QAAI,SAAS;AAEb,WAAO,UAAU;AAEjB,aAAS,WAAW,GAAG;AACrB,aAAO,OAAO,CAAC,EAAE,OAAO,SAAS,MAAM;AACrC,eAAO,KAAK,SAAS,KAAM,KAAK,WAAW,KAAK,EAAE,QAAQ,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MAC5E,CAAC;AAAA,IACH;AAAA;AAAA;;;ACRA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,QAAI,sBAAsB,MAAM;AAEhC,aAAS,cAAc,GAAG,UAAU,QAAQ;AAC1C,aAAO;AAAA,QAAiB;AAAA,QACtB,YAAY;AAAA,QACZ,UAAU,SAAS,GAAG;AAAE,iBAAO,EAAE,SAAS,CAAC;AAAA,QAAG;AAAA,MAAC;AAAA,IACnD;AAEA,aAAS,iBAAiB,GAAG,UAAU,QAAQ;AAC7C,UAAI,UAAU,CAAC;AACf,UAAI,QAAQ,EAAE,MAAM;AAEpB,YAAM,QAAQ,SAAS,GAAG;AACxB,gBAAQ,CAAC,IAAI,CAAC;AACd,gBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE;AAC9B,cAAM,QAAQ,SAAS,GAAG;AACxB,cAAI,MAAM,GAAG;AACX,oBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,OAAO,kBAAkB;AAAA,UACvD;AAAA,QACF,CAAC;AACD,eAAO,CAAC,EAAE,QAAQ,SAAS,MAAM;AAC/B,cAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,cAAI,IAAI,SAAS,IAAI;AACrB,kBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,GAAG,aAAa,EAAE;AAAA,QAChD,CAAC;AAAA,MACH,CAAC;AAED,YAAM,QAAQ,SAAS,GAAG;AACxB,YAAI,OAAO,QAAQ,CAAC;AACpB,cAAM,QAAQ,SAAS,GAAG;AACxB,cAAI,OAAO,QAAQ,CAAC;AACpB,gBAAM,QAAQ,SAAS,GAAG;AACxB,gBAAI,KAAK,KAAK,CAAC;AACf,gBAAI,KAAK,KAAK,CAAC;AACf,gBAAI,KAAK,KAAK,CAAC;AACf,gBAAI,cAAc,GAAG,WAAW,GAAG;AACnC,gBAAI,cAAc,GAAG,UAAU;AAC7B,iBAAG,WAAW;AACd,iBAAG,cAAc,GAAG;AAAA,YACtB;AAAA,UACF,CAAC;AAAA,QACH,CAAC;AAAA,MACH,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;AC/CA;AAAA;AAAA;AAAA,aAAS,QAAQ,GAAG;AAClB,UAAI,UAAU,CAAC;AACf,UAAI,QAAQ,CAAC;AACb,UAAI,UAAU,CAAC;AAEf,eAAS,MAAM,MAAM;AACnB,YAAI,OAAO,OAAO,OAAO,IAAI,GAAG;AAC9B,gBAAM,IAAI,eAAe;AAAA,QAC3B;AAEA,YAAI,CAAC,OAAO,OAAO,SAAS,IAAI,GAAG;AACjC,gBAAM,IAAI,IAAI;AACd,kBAAQ,IAAI,IAAI;AAChB,YAAE,aAAa,IAAI,EAAE,QAAQ,KAAK;AAClC,iBAAO,MAAM,IAAI;AACjB,kBAAQ,KAAK,IAAI;AAAA,QACnB;AAAA,MACF;AAEA,QAAE,MAAM,EAAE,QAAQ,KAAK;AAEvB,UAAI,OAAO,KAAK,OAAO,EAAE,WAAW,EAAE,UAAU,GAAG;AACjD,cAAM,IAAI,eAAe;AAAA,MAC3B;AAEA,aAAO;AAAA,IACT;AAEA,QAAM,iBAAN,cAA6B,MAAM;AAAA,MACjC,cAAc;AACZ,cAAM,GAAG,SAAS;AAAA,MACpB;AAAA,IACF;AAEA,WAAO,UAAU;AACjB,YAAQ,iBAAiB;AAAA;AAAA;;;ACnCzB;AAAA;AAAA;AAAA,QAAI,UAAU;AAEd,WAAO,UAAU;AAEjB,aAAS,UAAU,GAAG;AACpB,UAAI;AACF,gBAAQ,CAAC;AAAA,MACX,SAAS,GAAG;AACV,YAAI,aAAa,QAAQ,gBAAgB;AACvC,iBAAO;AAAA,QACT;AACA,cAAM;AAAA,MACR;AACA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACdA;AAAA;AAAA;AAAA,WAAO,UAAU;AAUjB,aAAS,IAAI,GAAG,IAAI,OAAO;AACzB,UAAI,CAAC,MAAM,QAAQ,EAAE,GAAG;AACtB,aAAK,CAAC,EAAE;AAAA,MACV;AAEA,UAAI,aAAa,EAAE,WAAW,IAAI,OAAK,EAAE,WAAW,CAAC,IAAI,OAAK,EAAE,UAAU,CAAC;AAC3E,UAAI,YAAY,UAAU,SAAS,eAAe;AAElD,UAAI,MAAM,CAAC;AACX,UAAI,UAAU,CAAC;AACf,SAAG,QAAQ,OAAK;AACd,YAAI,CAAC,EAAE,QAAQ,CAAC,GAAG;AACjB,gBAAM,IAAI,MAAM,+BAA+B,CAAC;AAAA,QAClD;AAEA,kBAAU,GAAG,YAAY,SAAS,GAAG;AAAA,MACvC,CAAC;AAED,aAAO;AAAA,IACT;AAEA,aAAS,aAAa,GAAG,YAAY,SAAS,KAAK;AACjD,UAAI,QAAQ,CAAC,CAAC,GAAG,KAAK,CAAC;AACvB,aAAO,MAAM,SAAS,GAAG;AACvB,YAAI,OAAO,MAAM,IAAI;AACrB,YAAI,KAAK,CAAC,GAAG;AACX,cAAI,KAAK,KAAK,CAAC,CAAC;AAAA,QAClB,OAAO;AACL,cAAI,CAAC,OAAO,OAAO,SAAS,KAAK,CAAC,CAAC,GAAG;AACpC,oBAAQ,KAAK,CAAC,CAAC,IAAI;AACnB,kBAAM,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;AAC1B,yBAAa,WAAW,KAAK,CAAC,CAAC,GAAG,OAAK,MAAM,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,UAC/D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,aAAS,YAAY,GAAG,YAAY,SAAS,KAAK;AAChD,UAAI,QAAQ,CAAC,CAAC;AACd,aAAO,MAAM,SAAS,GAAG;AACvB,YAAI,OAAO,MAAM,IAAI;AACrB,YAAI,CAAC,OAAO,OAAO,SAAS,IAAI,GAAG;AACjC,kBAAQ,IAAI,IAAI;AAChB,cAAI,KAAK,IAAI;AACb,uBAAa,WAAW,IAAI,GAAG,OAAK,MAAM,KAAK,CAAC,CAAC;AAAA,QACnD;AAAA,MACF;AAAA,IACF;AAEA,aAAS,aAAa,OAAO,UAAU;AACrC,UAAI,SAAS,MAAM;AACnB,aAAO,UAAU;AACf,iBAAS,MAAM,MAAM,GAAG,QAAQ,KAAK;AAAA,MACvC;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;AClEA;AAAA;AAAA;AAAA,QAAI,MAAM;AAEV,WAAO,UAAU;AAEjB,aAAS,UAAU,GAAG,IAAI;AACxB,aAAO,IAAI,GAAG,IAAI,MAAM;AAAA,IAC1B;AAAA;AAAA;;;ACNA;AAAA;AAAA;AAAA,QAAI,MAAM;AAEV,WAAO,UAAU;AAEjB,aAAS,SAAS,GAAG,IAAI;AACvB,aAAO,IAAI,GAAG,IAAI,KAAK;AAAA,IACzB;AAAA;AAAA;;;ACNA;AAAA;AAAA;AAAA,QAAI,QAAQ;AACZ,QAAI,gBAAgB;AAEpB,WAAO,UAAU;AAEjB,aAAS,KAAK,GAAG,YAAY;AAC3B,UAAI,SAAS,IAAI,MAAM;AACvB,UAAI,UAAU,CAAC;AACf,UAAI,KAAK,IAAI,cAAc;AAC3B,UAAI;AAEJ,eAAS,gBAAgB,MAAM;AAC7B,YAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,YAAI,MAAM,GAAG,SAAS,CAAC;AACvB,YAAI,QAAQ,QAAW;AACrB,cAAI,aAAa,WAAW,IAAI;AAChC,cAAI,aAAa,KAAK;AACpB,oBAAQ,CAAC,IAAI;AACb,eAAG,SAAS,GAAG,UAAU;AAAA,UAC3B;AAAA,QACF;AAAA,MACF;AAEA,UAAI,EAAE,UAAU,MAAM,GAAG;AACvB,eAAO;AAAA,MACT;AAEA,QAAE,MAAM,EAAE,QAAQ,SAASC,IAAG;AAC5B,WAAG,IAAIA,IAAG,OAAO,iBAAiB;AAClC,eAAO,QAAQA,EAAC;AAAA,MAClB,CAAC;AAGD,SAAG,SAAS,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC;AAE3B,UAAI,OAAO;AACX,aAAO,GAAG,KAAK,IAAI,GAAG;AACpB,YAAI,GAAG,UAAU;AACjB,YAAI,OAAO,OAAO,SAAS,CAAC,GAAG;AAC7B,iBAAO,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAAA,QAC9B,WAAW,MAAM;AACf,gBAAM,IAAI,MAAM,mCAAmC,CAAC;AAAA,QACtD,OAAO;AACL,iBAAO;AAAA,QACT;AAEA,UAAE,UAAU,CAAC,EAAE,QAAQ,eAAe;AAAA,MACxC;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;AClDA;AAAA;AAAA;AAAA,WAAO,UAAU;AAAA,MACf,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,eAAe;AAAA,MACf,WAAW;AAAA,MACX,WAAW;AAAA,MACX,UAAU;AAAA,MACV,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,SAAS;AAAA,IACX;AAAA;AAAA;;;ACZA;AAAA;AAAA;AA8BA,QAAI,MAAM;AAEV,WAAO,UAAU;AAAA,MACf,OAAO,IAAI;AAAA,MACX,MAAM;AAAA,MACN,KAAK;AAAA,MACL,SAAS,IAAI;AAAA,IACf;AAAA;AAAA;;;ACrCA;AAAA;AAAA;AAKA,QAAM,OAAN,MAAW;AAAA,MACT,cAAc;AACZ,YAAI,WAAW,CAAC;AAChB,iBAAS,QAAQ,SAAS,QAAQ;AAClC,aAAK,YAAY;AAAA,MACnB;AAAA,MAEA,UAAU;AACR,YAAI,WAAW,KAAK;AACpB,YAAI,QAAQ,SAAS;AACrB,YAAI,UAAU,UAAU;AACtB,iBAAO,KAAK;AACZ,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,MAEA,QAAQ,OAAO;AACb,YAAI,WAAW,KAAK;AACpB,YAAI,MAAM,SAAS,MAAM,OAAO;AAC9B,iBAAO,KAAK;AAAA,QACd;AACA,cAAM,QAAQ,SAAS;AACvB,iBAAS,MAAM,QAAQ;AACvB,iBAAS,QAAQ;AACjB,cAAM,QAAQ;AAAA,MAChB;AAAA,MAEA,WAAW;AACT,YAAI,OAAO,CAAC;AACZ,YAAI,WAAW,KAAK;AACpB,YAAI,OAAO,SAAS;AACpB,eAAO,SAAS,UAAU;AACxB,eAAK,KAAK,KAAK,UAAU,MAAM,cAAc,CAAC;AAC9C,iBAAO,KAAK;AAAA,QACd;AACA,eAAO,MAAM,KAAK,KAAK,IAAI,IAAI;AAAA,MACjC;AAAA,IACF;AAEA,aAAS,OAAO,OAAO;AACrB,YAAM,MAAM,QAAQ,MAAM;AAC1B,YAAM,MAAM,QAAQ,MAAM;AAC1B,aAAO,MAAM;AACb,aAAO,MAAM;AAAA,IACf;AAEA,aAAS,eAAe,GAAG,GAAG;AAC5B,UAAI,MAAM,WAAW,MAAM,SAAS;AAClC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACzDjB;AAAA;AAAA;AAAA,QAAI,QAAQ,mBAA6B;AACzC,QAAI,OAAO;AASX,WAAO,UAAU;AAEjB,QAAI,oBAAoB,MAAM;AAE9B,aAAS,UAAU,GAAG,UAAU;AAC9B,UAAI,EAAE,UAAU,KAAK,GAAG;AACtB,eAAO,CAAC;AAAA,MACV;AACA,UAAI,QAAQ,WAAW,GAAG,YAAY,iBAAiB;AACvD,UAAI,UAAU,YAAY,MAAM,OAAO,MAAM,SAAS,MAAM,OAAO;AAGnE,aAAO,QAAQ,QAAQ,OAAK,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;AAAA,IAClD;AAEA,aAAS,YAAY,GAAG,SAAS,SAAS;AACxC,UAAI,UAAU,CAAC;AACf,UAAI,UAAU,QAAQ,QAAQ,SAAS,CAAC;AACxC,UAAI,QAAQ,QAAQ,CAAC;AAErB,UAAI;AACJ,aAAO,EAAE,UAAU,GAAG;AACpB,eAAQ,QAAQ,MAAM,QAAQ,GAAM;AAAE,qBAAW,GAAG,SAAS,SAAS,KAAK;AAAA,QAAG;AAC9E,eAAQ,QAAQ,QAAQ,QAAQ,GAAI;AAAE,qBAAW,GAAG,SAAS,SAAS,KAAK;AAAA,QAAG;AAC9E,YAAI,EAAE,UAAU,GAAG;AACjB,mBAAS,IAAI,QAAQ,SAAS,GAAG,IAAI,GAAG,EAAE,GAAG;AAC3C,oBAAQ,QAAQ,CAAC,EAAE,QAAQ;AAC3B,gBAAI,OAAO;AACT,wBAAU,QAAQ,OAAO,WAAW,GAAG,SAAS,SAAS,OAAO,IAAI,CAAC;AACrE;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,GAAG,SAAS,SAAS,OAAO,qBAAqB;AACnE,UAAI,UAAU,sBAAsB,CAAC,IAAI;AAEzC,QAAE,QAAQ,MAAM,CAAC,EAAE,QAAQ,UAAQ;AACjC,YAAI,SAAS,EAAE,KAAK,IAAI;AACxB,YAAI,SAAS,EAAE,KAAK,KAAK,CAAC;AAE1B,YAAI,qBAAqB;AACvB,kBAAQ,KAAK,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAE,CAAC;AAAA,QACvC;AAEA,eAAO,OAAO;AACd,qBAAa,SAAS,SAAS,MAAM;AAAA,MACvC,CAAC;AAED,QAAE,SAAS,MAAM,CAAC,EAAE,QAAQ,UAAQ;AAClC,YAAI,SAAS,EAAE,KAAK,IAAI;AACxB,YAAI,IAAI,KAAK;AACb,YAAI,SAAS,EAAE,KAAK,CAAC;AACrB,eAAO,IAAI,KAAK;AAChB,qBAAa,SAAS,SAAS,MAAM;AAAA,MACvC,CAAC;AAED,QAAE,WAAW,MAAM,CAAC;AAEpB,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,GAAG,UAAU;AAC/B,UAAI,WAAW,IAAI,MAAM;AACzB,UAAI,QAAQ;AACZ,UAAI,SAAS;AAEb,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,iBAAS,QAAQ,GAAG,EAAE,GAAM,MAAM,GAAG,KAAK,EAAE,CAAC;AAAA,MAC/C,CAAC;AAID,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,aAAa,SAAS,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;AAC5C,YAAI,SAAS,SAAS,CAAC;AACvB,YAAI,aAAa,aAAa;AAC9B,iBAAS,QAAQ,EAAE,GAAG,EAAE,GAAG,UAAU;AACrC,iBAAS,KAAK,IAAI,QAAQ,SAAS,KAAK,EAAE,CAAC,EAAE,OAAO,MAAM;AAC1D,gBAAS,KAAK,IAAI,OAAQ,SAAS,KAAK,EAAE,CAAC,EAAE,IAAI,KAAM,MAAM;AAAA,MAC/D,CAAC;AAED,UAAI,UAAU,MAAM,SAAS,QAAQ,CAAC,EAAE,IAAI,MAAM,IAAI,KAAK,CAAC;AAC5D,UAAI,UAAU,QAAQ;AAEtB,eAAS,MAAM,EAAE,QAAQ,OAAK;AAC5B,qBAAa,SAAS,SAAS,SAAS,KAAK,CAAC,CAAC;AAAA,MACjD,CAAC;AAED,aAAO,EAAE,OAAO,UAAU,SAAkB,QAAiB;AAAA,IAC/D;AAEA,aAAS,aAAa,SAAS,SAAS,OAAO;AAC7C,UAAI,CAAC,MAAM,KAAK;AACd,gBAAQ,CAAC,EAAE,QAAQ,KAAK;AAAA,MAC1B,WAAW,CAAC,MAAM,IAAI,GAAG;AACvB,gBAAQ,QAAQ,SAAS,CAAC,EAAE,QAAQ,KAAK;AAAA,MAC3C,OAAO;AACL,gBAAQ,MAAM,MAAM,MAAM,IAAI,IAAI,OAAO,EAAE,QAAQ,KAAK;AAAA,MAC1D;AAAA,IACF;AAEA,aAAS,MAAM,OAAO;AACpB,YAAMC,SAAQ,CAAC;AACf,eAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,QAAAA,OAAM,KAAK,CAAC;AAAA,MACd;AAEA,aAAOA;AAAA,IACT;AAAA;AAAA;;;AC3HA;AAAA;AAAA;AAIA,QAAI,QAAQ,mBAA6B;AAEzC,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAKA,aAAS,aAAa,GAAG,MAAM,OAAO,MAAM;AAC1C,UAAI,IAAI;AACR,aAAO,EAAE,QAAQ,CAAC,GAAG;AACnB,YAAI,SAAS,IAAI;AAAA,MACnB;AAEA,YAAM,QAAQ;AACd,QAAE,QAAQ,GAAG,KAAK;AAClB,aAAO;AAAA,IACT;AAMA,aAAS,SAAS,GAAG;AACnB,UAAI,aAAa,IAAI,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC;AAC/C,QAAE,MAAM,EAAE,QAAQ,OAAK,WAAW,QAAQ,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AACvD,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,cAAc,WAAW,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAE;AACtE,YAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,mBAAW,QAAQ,EAAE,GAAG,EAAE,GAAG;AAAA,UAC3B,QAAQ,YAAY,SAAS,MAAM;AAAA,UACnC,QAAQ,KAAK,IAAI,YAAY,QAAQ,MAAM,MAAM;AAAA,QACnD,CAAC;AAAA,MACH,CAAC;AACD,aAAO;AAAA,IACT;AAEA,aAAS,mBAAmB,GAAG;AAC7B,UAAI,aAAa,IAAI,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC;AAC/E,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,CAAC,EAAE,SAAS,CAAC,EAAE,QAAQ;AACzB,qBAAW,QAAQ,GAAG,EAAE,KAAK,CAAC,CAAC;AAAA,QACjC;AAAA,MACF,CAAC;AACD,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,mBAAW,QAAQ,GAAG,EAAE,KAAK,CAAC,CAAC;AAAA,MACjC,CAAC;AACD,aAAO;AAAA,IACT;AAEA,aAAS,iBAAiB,GAAG;AAC3B,UAAI,YAAY,EAAE,MAAM,EAAE,IAAI,OAAK;AACjC,YAAI,OAAO,CAAC;AACZ,UAAE,SAAS,CAAC,EAAE,QAAQ,OAAK;AACzB,eAAK,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC,KAAK,KAAK,EAAE,KAAK,CAAC,EAAE;AAAA,QAC3C,CAAC;AACD,eAAO;AAAA,MACT,CAAC;AACD,aAAO,UAAU,EAAE,MAAM,GAAG,SAAS;AAAA,IACvC;AAEA,aAAS,mBAAmB,GAAG;AAC7B,UAAI,YAAY,EAAE,MAAM,EAAE,IAAI,OAAK;AACjC,YAAI,QAAQ,CAAC;AACb,UAAE,QAAQ,CAAC,EAAE,QAAQ,OAAK;AACxB,gBAAM,EAAE,CAAC,KAAK,MAAM,EAAE,CAAC,KAAK,KAAK,EAAE,KAAK,CAAC,EAAE;AAAA,QAC7C,CAAC;AACD,eAAO;AAAA,MACT,CAAC;AACD,aAAO,UAAU,EAAE,MAAM,GAAG,SAAS;AAAA,IACvC;AAMA,aAAS,cAAc,MAAM,OAAO;AAClC,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK;AAIb,UAAI,KAAK,MAAM,IAAI;AACnB,UAAI,KAAK,MAAM,IAAI;AACnB,UAAI,IAAI,KAAK,QAAQ;AACrB,UAAI,IAAI,KAAK,SAAS;AAEtB,UAAI,CAAC,MAAM,CAAC,IAAI;AACd,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AAEA,UAAI,IAAI;AACR,UAAI,KAAK,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,EAAE,IAAI,GAAG;AAEvC,YAAI,KAAK,GAAG;AACV,cAAI,CAAC;AAAA,QACP;AACA,aAAK,IAAI,KAAK;AACd,aAAK;AAAA,MACP,OAAO;AAEL,YAAI,KAAK,GAAG;AACV,cAAI,CAAC;AAAA,QACP;AACA,aAAK;AACL,aAAK,IAAI,KAAK;AAAA,MAChB;AAEA,aAAO,EAAE,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG;AAAA,IAChC;AAMA,aAAS,iBAAiB,GAAG;AAC3B,UAAI,WAAW,MAAM,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC;AACjD,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,OAAO,KAAK;AAChB,YAAI,SAAS,QAAW;AACtB,mBAAS,IAAI,EAAE,KAAK,KAAK,IAAI;AAAA,QAC/B;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AAMA,aAAS,eAAe,GAAG;AACzB,UAAI,YAAY,EAAE,MAAM,EAAE,IAAI,OAAK;AACjC,YAAI,OAAO,EAAE,KAAK,CAAC,EAAE;AACrB,YAAI,SAAS,QAAW;AACtB,iBAAO,OAAO;AAAA,QAChB;AAEA,eAAO;AAAA,MACT,CAAC;AACD,UAAI,MAAM,kBAAkB,KAAK,KAAK,SAAS;AAC/C,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,OAAO,OAAO,MAAM,MAAM,GAAG;AAC/B,eAAK,QAAQ;AAAA,QACf;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,iBAAiB,GAAG;AAE3B,UAAI,YAAY,EAAE,MAAM,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC,EAAE,IAAI;AACjD,UAAI,SAAS,kBAAkB,KAAK,KAAK,SAAS;AAElD,UAAI,SAAS,CAAC;AACd,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC,EAAE,OAAO;AAC5B,YAAI,CAAC,OAAO,IAAI,GAAG;AACjB,iBAAO,IAAI,IAAI,CAAC;AAAA,QAClB;AACA,eAAO,IAAI,EAAE,KAAK,CAAC;AAAA,MACrB,CAAC;AAED,UAAI,QAAQ;AACZ,UAAI,iBAAiB,EAAE,MAAM,EAAE;AAC/B,YAAM,KAAK,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM;AACpC,YAAI,OAAO,UAAa,IAAI,mBAAmB,GAAG;AAChD,YAAE;AAAA,QACJ,WAAW,OAAO,UAAa,OAAO;AACpC,aAAG,QAAQ,OAAK,EAAE,KAAK,CAAC,EAAE,QAAQ,KAAK;AAAA,QACzC;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,cAAc,GAAG,QAAQ,MAAM,OAAO;AAC7C,UAAI,OAAO;AAAA,QACT,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AACA,UAAI,UAAU,UAAU,GAAG;AACzB,aAAK,OAAO;AACZ,aAAK,QAAQ;AAAA,MACf;AACA,aAAO,aAAa,GAAG,UAAU,MAAM,MAAM;AAAA,IAC/C;AAEA,aAAS,cAAc,OAAO,YAAY,oBAAoB;AAC5D,YAAM,SAAS,CAAC;AAChB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,WAAW;AAChD,cAAM,QAAQ,MAAM,MAAM,GAAG,IAAI,SAAS;AAC1C,eAAO,KAAK,KAAK;AAAA,MACnB;AACA,aAAO;AAAA,IACT;AAEA,QAAM,qBAAqB;AAE3B,aAAS,kBAAkB,IAAI,WAAW;AACxC,UAAG,UAAU,SAAS,oBAAoB;AACxC,cAAM,SAAS,cAAc,SAAS;AACtC,eAAO,GAAG,MAAM,MAAM,OAAO,IAAI,WAAS,GAAG,MAAM,MAAM,KAAK,CAAC,CAAC;AAAA,MAClE,OAAO;AACL,eAAO,GAAG,MAAM,MAAM,SAAS;AAAA,MACjC;AAAA,IACF;AAEA,aAAS,QAAQ,GAAG;AAClB,YAAM,QAAQ,EAAE,MAAM;AACtB,YAAM,YAAY,MAAM,IAAI,OAAK;AAC/B,YAAI,OAAO,EAAE,KAAK,CAAC,EAAE;AACrB,YAAI,SAAS,QAAW;AACtB,iBAAO,OAAO;AAAA,QAChB;AACA,eAAO;AAAA,MACT,CAAC;AAED,aAAO,kBAAkB,KAAK,KAAK,SAAS;AAAA,IAC9C;AAOA,aAAS,UAAU,YAAY,IAAI;AACjC,UAAI,SAAS,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE;AAChC,iBAAW,QAAQ,WAAS;AAC1B,YAAI,GAAG,KAAK,GAAG;AACb,iBAAO,IAAI,KAAK,KAAK;AAAA,QACvB,OAAO;AACL,iBAAO,IAAI,KAAK,KAAK;AAAA,QACvB;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AAMA,aAAS,KAAK,MAAM,IAAI;AACtB,UAAI,QAAQ,KAAK,IAAI;AACrB,UAAI;AACF,eAAO,GAAG;AAAA,MACZ,UAAE;AACA,gBAAQ,IAAI,OAAO,aAAa,KAAK,IAAI,IAAI,SAAS,IAAI;AAAA,MAC5D;AAAA,IACF;AAEA,aAAS,OAAO,MAAM,IAAI;AACxB,aAAO,GAAG;AAAA,IACZ;AAEA,QAAI,YAAY;AAChB,aAAS,SAAS,QAAQ;AACxB,UAAI,KAAK,EAAE;AACX,aAAO,UAAU,KAAK;AAAA,IACxB;AAEA,aAAS,MAAM,OAAO,OAAO,OAAO,GAAG;AACrC,UAAI,SAAS,MAAM;AACjB,gBAAQ;AACR,gBAAQ;AAAA,MACV;AAEA,UAAI,SAAS,CAAC,MAAM,IAAI;AACxB,UAAI,OAAO,GAAG;AACZ,iBAAS,CAAC,MAAM,QAAQ;AAAA,MAC1B;AAEA,YAAMC,SAAQ,CAAC;AACf,eAAS,IAAI,OAAO,OAAO,CAAC,GAAG,KAAK,MAAM;AACxC,QAAAA,OAAM,KAAK,CAAC;AAAA,MACd;AAEA,aAAOA;AAAA,IACT;AAEA,aAAS,KAAK,QAAQ,MAAM;AAC1B,YAAM,OAAO,CAAC;AACd,iBAAW,OAAO,MAAM;AACtB,YAAI,OAAO,GAAG,MAAM,QAAW;AAC7B,eAAK,GAAG,IAAI,OAAO,GAAG;AAAA,QACxB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,UAAU,KAAK,YAAY;AAClC,UAAI,OAAO;AACX,UAAI,OAAO,eAAe,UAAU;AAClC,eAAO,CAAC,QAAQ,IAAI,UAAU;AAAA,MAChC;AAEA,aAAO,OAAO,QAAQ,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM;AACjD,YAAI,CAAC,IAAI,KAAK,GAAG,CAAC;AAClB,eAAO;AAAA,MACT,GAAG,CAAC,CAAC;AAAA,IACP;AAEA,aAAS,UAAU,OAAO,QAAQ;AAChC,aAAO,MAAM,OAAO,CAAC,KAAK,KAAK,MAAM;AACnC,YAAI,GAAG,IAAI,OAAO,CAAC;AACnB,eAAO;AAAA,MACT,GAAG,CAAC,CAAC;AAAA,IACP;AAAA;AAAA;;;AC1UA;AAAA;AAAA;AAEA,QAAI,YAAY;AAChB,QAAI,WAAW,eAAkB;AAEjC,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAEA,aAAS,IAAI,GAAG;AACd,UAAI,MAAO,EAAE,MAAM,EAAE,cAAc,WAC/B,UAAU,GAAG,SAAS,CAAC,CAAC,IACxB,OAAO,CAAC;AACZ,UAAI,QAAQ,OAAK;AACf,YAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,UAAE,WAAW,CAAC;AACd,cAAM,cAAc,EAAE;AACtB,cAAM,WAAW;AACjB,UAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,OAAO,SAAS,KAAK,CAAC;AAAA,MAC5C,CAAC;AAED,eAAS,SAASC,IAAG;AACnB,eAAO,OAAK;AACV,iBAAOA,GAAE,KAAK,CAAC,EAAE;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AAEA,aAAS,OAAO,GAAG;AACjB,UAAI,MAAM,CAAC;AACX,UAAI,QAAQ,CAAC;AACb,UAAI,UAAU,CAAC;AAEf,eAAS,IAAI,GAAG;AACd,YAAI,OAAO,OAAO,SAAS,CAAC,GAAG;AAC7B;AAAA,QACF;AACA,gBAAQ,CAAC,IAAI;AACb,cAAM,CAAC,IAAI;AACX,UAAE,SAAS,CAAC,EAAE,QAAQ,OAAK;AACzB,cAAI,OAAO,OAAO,OAAO,EAAE,CAAC,GAAG;AAC7B,gBAAI,KAAK,CAAC;AAAA,UACZ,OAAO;AACL,gBAAI,EAAE,CAAC;AAAA,UACT;AAAA,QACF,CAAC;AACD,eAAO,MAAM,CAAC;AAAA,MAChB;AAEA,QAAE,MAAM,EAAE,QAAQ,GAAG;AACrB,aAAO;AAAA,IACT;AAEA,aAAS,KAAK,GAAG;AACf,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,YAAI,MAAM,UAAU;AAClB,YAAE,WAAW,CAAC;AAEd,cAAI,cAAc,MAAM;AACxB,iBAAO,MAAM;AACb,iBAAO,MAAM;AACb,YAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,OAAO,WAAW;AAAA,QACxC;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;;;AClEA;AAAA;AAAA;AAEA,QAAI,OAAO;AAEX,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAkBA,aAAS,IAAI,GAAG;AACd,QAAE,MAAM,EAAE,cAAc,CAAC;AACzB,QAAE,MAAM,EAAE,QAAQ,UAAQ,cAAc,GAAG,IAAI,CAAC;AAAA,IAClD;AAEA,aAAS,cAAc,GAAG,GAAG;AAC3B,UAAI,IAAI,EAAE;AACV,UAAI,QAAQ,EAAE,KAAK,CAAC,EAAE;AACtB,UAAI,IAAI,EAAE;AACV,UAAI,QAAQ,EAAE,KAAK,CAAC,EAAE;AACtB,UAAI,OAAO,EAAE;AACb,UAAI,YAAY,EAAE,KAAK,CAAC;AACxB,UAAI,YAAY,UAAU;AAE1B,UAAI,UAAU,QAAQ,EAAG;AAEzB,QAAE,WAAW,CAAC;AAEd,UAAI,OAAO,OAAO;AAClB,WAAK,IAAI,GAAG,EAAE,OAAO,QAAQ,OAAO,EAAE,GAAG,EAAE,OAAO;AAChD,kBAAU,SAAS,CAAC;AACpB,gBAAQ;AAAA,UACN,OAAO;AAAA,UAAG,QAAQ;AAAA,UAClB;AAAA,UAAsB,SAAS;AAAA,UAC/B,MAAM;AAAA,QACR;AACA,gBAAQ,KAAK,aAAa,GAAG,QAAQ,OAAO,IAAI;AAChD,YAAI,UAAU,WAAW;AACvB,gBAAM,QAAQ,UAAU;AACxB,gBAAM,SAAS,UAAU;AACzB,gBAAM,QAAQ;AACd,gBAAM,WAAW,UAAU;AAAA,QAC7B;AACA,UAAE,QAAQ,GAAG,OAAO,EAAE,QAAQ,UAAU,OAAO,GAAG,IAAI;AACtD,YAAI,MAAM,GAAG;AACX,YAAE,MAAM,EAAE,YAAY,KAAK,KAAK;AAAA,QAClC;AACA,YAAI;AAAA,MACN;AAEA,QAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,UAAU,OAAO,GAAG,IAAI;AAAA,IACpD;AAEA,aAAS,KAAK,GAAG;AACf,QAAE,MAAM,EAAE,YAAY,QAAQ,OAAK;AACjC,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,YAAY,KAAK;AACrB,YAAI;AACJ,UAAE,QAAQ,KAAK,SAAS,SAAS;AACjC,eAAO,KAAK,OAAO;AACjB,cAAI,EAAE,WAAW,CAAC,EAAE,CAAC;AACrB,YAAE,WAAW,CAAC;AACd,oBAAU,OAAO,KAAK,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAE,CAAC;AAC9C,cAAI,KAAK,UAAU,cAAc;AAC/B,sBAAU,IAAI,KAAK;AACnB,sBAAU,IAAI,KAAK;AACnB,sBAAU,QAAQ,KAAK;AACvB,sBAAU,SAAS,KAAK;AAAA,UAC1B;AACA,cAAI;AACJ,iBAAO,EAAE,KAAK,CAAC;AAAA,QACjB;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;;;ACxFA,IAAAC,gBAAA;AAAA;AAAA;AAEA,QAAM,EAAE,kBAAkB,IAAI;AAE9B,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAuBA,aAAS,YAAY,GAAG;AACtB,UAAI,UAAU,CAAC;AAEf,eAAS,IAAI,GAAG;AACd,YAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,YAAI,OAAO,OAAO,SAAS,CAAC,GAAG;AAC7B,iBAAO,MAAM;AAAA,QACf;AACA,gBAAQ,CAAC,IAAI;AAEb,YAAI,kBAAkB,EAAE,SAAS,CAAC,EAAE,IAAI,OAAK;AAC3C,cAAI,KAAK,MAAM;AACb,mBAAO,OAAO;AAAA,UAChB;AAEA,iBAAO,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;AAAA,QAC9B,CAAC;AAED,YAAI,OAAO,kBAAkB,KAAK,KAAK,eAAe;AAEtD,YAAI,SAAS,OAAO,mBAAmB;AACrC,iBAAO;AAAA,QACT;AAEA,eAAQ,MAAM,OAAO;AAAA,MACvB;AAEA,QAAE,QAAQ,EAAE,QAAQ,GAAG;AAAA,IACzB;AAMA,aAAS,MAAM,GAAG,GAAG;AACnB,aAAO,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE;AAAA,IACzD;AAAA;AAAA;;;AClEA;AAAA;AAAA;AAEA,QAAI,QAAQ,mBAA6B;AACzC,QAAI,QAAQ,gBAAkB;AAE9B,WAAO,UAAU;AA2BjB,aAAS,aAAa,GAAG;AACvB,UAAI,IAAI,IAAI,MAAM,EAAE,UAAU,MAAM,CAAC;AAGrC,UAAI,QAAQ,EAAE,MAAM,EAAE,CAAC;AACvB,UAAI,OAAO,EAAE,UAAU;AACvB,QAAE,QAAQ,OAAO,CAAC,CAAC;AAEnB,UAAI,MAAM;AACV,aAAO,UAAU,GAAG,CAAC,IAAI,MAAM;AAC7B,eAAO,iBAAiB,GAAG,CAAC;AAC5B,gBAAQ,EAAE,QAAQ,KAAK,CAAC,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI;AAC3D,mBAAW,GAAG,GAAG,KAAK;AAAA,MACxB;AAEA,aAAO;AAAA,IACT;AAMA,aAAS,UAAU,GAAG,GAAG;AACvB,eAAS,IAAI,GAAG;AACd,UAAE,UAAU,CAAC,EAAE,QAAQ,OAAK;AAC1B,cAAI,QAAQ,EAAE,GACZ,IAAK,MAAM,QAAS,EAAE,IAAI;AAC5B,cAAI,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG;AACjC,cAAE,QAAQ,GAAG,CAAC,CAAC;AACf,cAAE,QAAQ,GAAG,GAAG,CAAC,CAAC;AAClB,gBAAI,CAAC;AAAA,UACP;AAAA,QACF,CAAC;AAAA,MACH;AAEA,QAAE,MAAM,EAAE,QAAQ,GAAG;AACrB,aAAO,EAAE,UAAU;AAAA,IACrB;AAMA,aAAS,iBAAiB,GAAG,GAAG;AAC9B,YAAM,QAAQ,EAAE,MAAM;AAEtB,aAAO,MAAM,OAAO,CAAC,KAAK,SAAS;AACjC,YAAI,YAAY,OAAO;AACvB,YAAI,EAAE,QAAQ,KAAK,CAAC,MAAM,EAAE,QAAQ,KAAK,CAAC,GAAG;AAC3C,sBAAY,MAAM,GAAG,IAAI;AAAA,QAC3B;AAEA,YAAI,YAAY,IAAI,CAAC,GAAG;AACtB,iBAAO,CAAC,WAAW,IAAI;AAAA,QACzB;AAEA,eAAO;AAAA,MACT,GAAG,CAAC,OAAO,mBAAmB,IAAI,CAAC,EAAE,CAAC;AAAA,IACxC;AAEA,aAAS,WAAW,GAAG,GAAG,OAAO;AAC/B,QAAE,MAAM,EAAE,QAAQ,OAAK,EAAE,KAAK,CAAC,EAAE,QAAQ,KAAK;AAAA,IAChD;AAAA;AAAA;;;AC9FA;AAAA;AAAA;AAEA,QAAI,eAAe;AACnB,QAAI,QAAQ,gBAAkB;AAC9B,QAAI,WAAW,gBAAkB;AACjC,QAAI,WAAW,mBAA6B,IAAI;AAChD,QAAI,YAAY,mBAA6B,IAAI;AACjD,QAAI,WAAW,eAAmB;AAElC,WAAO,UAAU;AAGjB,mBAAe,mBAAmB;AAClC,mBAAe,gBAAgB;AAC/B,mBAAe,eAAe;AAC9B,mBAAe,YAAY;AAC3B,mBAAe,YAAY;AAC3B,mBAAe,gBAAgB;AAmC/B,aAAS,eAAe,GAAG;AACzB,UAAI,SAAS,CAAC;AACd,eAAS,CAAC;AACV,UAAI,IAAI,aAAa,CAAC;AACtB,uBAAiB,CAAC;AAClB,oBAAc,GAAG,CAAC;AAElB,UAAI,GAAG;AACP,aAAQ,IAAI,UAAU,CAAC,GAAI;AACzB,YAAI,UAAU,GAAG,GAAG,CAAC;AACrB,sBAAc,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1B;AAAA,IACF;AAKA,aAAS,cAAc,GAAG,GAAG;AAC3B,UAAI,KAAK,UAAU,GAAG,EAAE,MAAM,CAAC;AAC/B,WAAK,GAAG,MAAM,GAAG,GAAG,SAAS,CAAC;AAC9B,SAAG,QAAQ,OAAK,eAAe,GAAG,GAAG,CAAC,CAAC;AAAA,IACzC;AAEA,aAAS,eAAe,GAAG,GAAG,OAAO;AACnC,UAAI,WAAW,EAAE,KAAK,KAAK;AAC3B,UAAI,SAAS,SAAS;AACtB,QAAE,KAAK,OAAO,MAAM,EAAE,WAAW,aAAa,GAAG,GAAG,KAAK;AAAA,IAC3D;AAMA,aAAS,aAAa,GAAG,GAAG,OAAO;AACjC,UAAI,WAAW,EAAE,KAAK,KAAK;AAC3B,UAAI,SAAS,SAAS;AAEtB,UAAI,cAAc;AAElB,UAAI,YAAY,EAAE,KAAK,OAAO,MAAM;AAEpC,UAAI,WAAW;AAEf,UAAI,CAAC,WAAW;AACd,sBAAc;AACd,oBAAY,EAAE,KAAK,QAAQ,KAAK;AAAA,MAClC;AAEA,iBAAW,UAAU;AAErB,QAAE,UAAU,KAAK,EAAE,QAAQ,OAAK;AAC9B,YAAI,YAAY,EAAE,MAAM,OACtB,QAAQ,YAAY,EAAE,IAAI,EAAE;AAE9B,YAAI,UAAU,QAAQ;AACpB,cAAI,eAAe,cAAc,aAC/B,cAAc,EAAE,KAAK,CAAC,EAAE;AAE1B,sBAAY,eAAe,cAAc,CAAC;AAC1C,cAAI,WAAW,GAAG,OAAO,KAAK,GAAG;AAC/B,gBAAI,gBAAgB,EAAE,KAAK,OAAO,KAAK,EAAE;AACzC,wBAAY,eAAe,CAAC,gBAAgB;AAAA,UAC9C;AAAA,QACF;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAEA,aAAS,iBAAiB,MAAM,MAAM;AACpC,UAAI,UAAU,SAAS,GAAG;AACxB,eAAO,KAAK,MAAM,EAAE,CAAC;AAAA,MACvB;AACA,sBAAgB,MAAM,CAAC,GAAG,GAAG,IAAI;AAAA,IACnC;AAEA,aAAS,gBAAgB,MAAM,SAAS,SAAS,GAAG,QAAQ;AAC1D,UAAI,MAAM;AACV,UAAI,QAAQ,KAAK,KAAK,CAAC;AAEvB,cAAQ,CAAC,IAAI;AACb,WAAK,UAAU,CAAC,EAAE,QAAQ,OAAK;AAC7B,YAAI,CAAC,OAAO,OAAO,SAAS,CAAC,GAAG;AAC9B,oBAAU,gBAAgB,MAAM,SAAS,SAAS,GAAG,CAAC;AAAA,QACxD;AAAA,MACF,CAAC;AAED,YAAM,MAAM;AACZ,YAAM,MAAM;AACZ,UAAI,QAAQ;AACV,cAAM,SAAS;AAAA,MACjB,OAAO;AAEL,eAAO,MAAM;AAAA,MACf;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,UAAU,MAAM;AACvB,aAAO,KAAK,MAAM,EAAE,KAAK,OAAK,KAAK,KAAK,CAAC,EAAE,WAAW,CAAC;AAAA,IACzD;AAEA,aAAS,UAAU,GAAG,GAAG,MAAM;AAC7B,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK;AAKb,UAAI,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG;AACpB,YAAI,KAAK;AACT,YAAI,KAAK;AAAA,MACX;AAEA,UAAI,SAAS,EAAE,KAAK,CAAC;AACrB,UAAI,SAAS,EAAE,KAAK,CAAC;AACrB,UAAI,YAAY;AAChB,UAAI,OAAO;AAIX,UAAI,OAAO,MAAM,OAAO,KAAK;AAC3B,oBAAY;AACZ,eAAO;AAAA,MACT;AAEA,UAAI,aAAa,EAAE,MAAM,EAAE,OAAO,CAAAC,UAAQ;AACxC,eAAO,SAAS,aAAa,GAAG,EAAE,KAAKA,MAAK,CAAC,GAAG,SAAS,KAClD,SAAS,aAAa,GAAG,EAAE,KAAKA,MAAK,CAAC,GAAG,SAAS;AAAA,MAC3D,CAAC;AAED,aAAO,WAAW,OAAO,CAAC,KAAKA,UAAS;AACtC,YAAI,MAAM,GAAGA,KAAI,IAAI,MAAM,GAAG,GAAG,GAAG;AAClC,iBAAOA;AAAA,QACT;AAEA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,aAAS,cAAc,GAAG,GAAG,GAAG,GAAG;AACjC,UAAI,IAAI,EAAE;AACV,UAAI,IAAI,EAAE;AACV,QAAE,WAAW,GAAG,CAAC;AACjB,QAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACtB,uBAAiB,CAAC;AAClB,oBAAc,GAAG,CAAC;AAClB,kBAAY,GAAG,CAAC;AAAA,IAClB;AAEA,aAAS,YAAY,GAAG,GAAG;AACzB,UAAI,OAAO,EAAE,MAAM,EAAE,KAAK,OAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM;AAChD,UAAI,KAAK,SAAS,GAAG,IAAI;AACzB,WAAK,GAAG,MAAM,CAAC;AACf,SAAG,QAAQ,OAAK;AACd,YAAI,SAAS,EAAE,KAAK,CAAC,EAAE,QACrB,OAAO,EAAE,KAAK,GAAG,MAAM,GACvB,UAAU;AAEZ,YAAI,CAAC,MAAM;AACT,iBAAO,EAAE,KAAK,QAAQ,CAAC;AACvB,oBAAU;AAAA,QACZ;AAEA,UAAE,KAAK,CAAC,EAAE,OAAO,EAAE,KAAK,MAAM,EAAE,QAAQ,UAAU,KAAK,SAAS,CAAC,KAAK;AAAA,MACxE,CAAC;AAAA,IACH;AAKA,aAAS,WAAW,MAAM,GAAG,GAAG;AAC9B,aAAO,KAAK,QAAQ,GAAG,CAAC;AAAA,IAC1B;AAMA,aAAS,aAAa,MAAM,QAAQ,WAAW;AAC7C,aAAO,UAAU,OAAO,OAAO,OAAO,OAAO,OAAO,UAAU;AAAA,IAChE;AAAA;AAAA;;;AC1OA;AAAA;AAAA;AAEA,QAAI,WAAW;AACf,QAAI,cAAc,SAAS;AAC3B,QAAI,eAAe;AACnB,QAAI,iBAAiB;AAErB,WAAO,UAAU;AAqBjB,aAAS,KAAK,GAAG;AACf,UAAI,SAAS,EAAE,MAAM,EAAE;AACvB,UAAI,kBAAkB,UAAU;AAC9B,eAAO,OAAO,CAAC;AAAA,MACjB;AAEA,cAAO,EAAE,MAAM,EAAE,QAAQ;AAAA,QACzB,KAAK;AAAmB,+BAAqB,CAAC;AAAG;AAAA,QACjD,KAAK;AAAc,0BAAgB,CAAC;AAAG;AAAA,QACvC,KAAK;AAAgB,4BAAkB,CAAC;AAAG;AAAA,QAC3C,KAAK;AAAQ;AAAA,QACb;AAAS,+BAAqB,CAAC;AAAA,MAC/B;AAAA,IACF;AAGA,QAAI,oBAAoB;AAExB,aAAS,gBAAgB,GAAG;AAC1B,kBAAY,CAAC;AACb,mBAAa,CAAC;AAAA,IAChB;AAEA,aAAS,qBAAqB,GAAG;AAC/B,qBAAe,CAAC;AAAA,IAClB;AAAA;AAAA;;;ACrDA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,kBAAkB,GAAG;AAC5B,UAAI,gBAAgB,UAAU,CAAC;AAE/B,QAAE,MAAM,EAAE,YAAY,QAAQ,OAAK;AACjC,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,UAAU,KAAK;AACnB,YAAI,WAAW,SAAS,GAAG,eAAe,QAAQ,GAAG,QAAQ,CAAC;AAC9D,YAAI,OAAO,SAAS;AACpB,YAAI,MAAM,SAAS;AACnB,YAAI,UAAU;AACd,YAAI,QAAQ,KAAK,OAAO;AACxB,YAAI,YAAY;AAEhB,eAAO,MAAM,QAAQ,GAAG;AACtB,iBAAO,EAAE,KAAK,CAAC;AAEf,cAAI,WAAW;AACb,oBAAQ,QAAQ,KAAK,OAAO,OAAO,OAC5B,EAAE,KAAK,KAAK,EAAE,UAAU,KAAK,MAAM;AACxC;AAAA,YACF;AAEA,gBAAI,UAAU,KAAK;AACjB,0BAAY;AAAA,YACd;AAAA,UACF;AAEA,cAAI,CAAC,WAAW;AACd,mBAAO,UAAU,KAAK,SAAS,KACxB,EAAE,KAAK,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE,WAAW,KAAK,MAAM;AAC7D;AAAA,YACF;AACA,oBAAQ,KAAK,OAAO;AAAA,UACtB;AAEA,YAAE,UAAU,GAAG,KAAK;AACpB,cAAI,EAAE,WAAW,CAAC,EAAE,CAAC;AAAA,QACvB;AAAA,MACF,CAAC;AAAA,IACH;AAIA,aAAS,SAAS,GAAG,eAAe,GAAG,GAAG;AACxC,UAAI,QAAQ,CAAC;AACb,UAAI,QAAQ,CAAC;AACb,UAAI,MAAM,KAAK,IAAI,cAAc,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,GAAG;AAC7D,UAAI,MAAM,KAAK,IAAI,cAAc,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,GAAG;AAC7D,UAAI;AACJ,UAAI;AAGJ,eAAS;AACT,SAAG;AACD,iBAAS,EAAE,OAAO,MAAM;AACxB,cAAM,KAAK,MAAM;AAAA,MACnB,SAAS,WACC,cAAc,MAAM,EAAE,MAAM,OAAO,MAAM,cAAc,MAAM,EAAE;AACzE,YAAM;AAGN,eAAS;AACT,cAAQ,SAAS,EAAE,OAAO,MAAM,OAAO,KAAK;AAC1C,cAAM,KAAK,MAAM;AAAA,MACnB;AAEA,aAAO,EAAE,MAAM,MAAM,OAAO,MAAM,QAAQ,CAAC,GAAG,IAAS;AAAA,IACzD;AAEA,aAAS,UAAU,GAAG;AACpB,UAAI,SAAS,CAAC;AACd,UAAI,MAAM;AAEV,eAAS,IAAI,GAAG;AACd,YAAI,MAAM;AACV,UAAE,SAAS,CAAC,EAAE,QAAQ,GAAG;AACzB,eAAO,CAAC,IAAI,EAAE,KAAU,KAAK,MAAM;AAAA,MACrC;AACA,QAAE,SAAS,EAAE,QAAQ,GAAG;AAExB,aAAO;AAAA,IACT;AAAA;AAAA;;;ACnFA;AAAA;AAAA;AAAA,QAAI,OAAO;AAEX,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAyBA,aAAS,IAAI,GAAG;AACd,UAAI,OAAO,KAAK,aAAa,GAAG,QAAQ,CAAC,GAAG,OAAO;AACnD,UAAI,SAAS,WAAW,CAAC;AACzB,UAAI,YAAY,OAAO,OAAO,MAAM;AACpC,UAAI,SAAS,KAAK,kBAAkB,KAAK,KAAK,SAAS,IAAI;AAC3D,UAAI,UAAU,IAAI,SAAS;AAE3B,QAAE,MAAM,EAAE,cAAc;AAGxB,QAAE,MAAM,EAAE,QAAQ,OAAK,EAAE,KAAK,CAAC,EAAE,UAAU,OAAO;AAGlD,UAAI,SAAS,WAAW,CAAC,IAAI;AAG7B,QAAE,SAAS,EAAE,QAAQ,WAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,KAAK,CAAC;AAIlF,QAAE,MAAM,EAAE,iBAAiB;AAAA,IAC7B;AAEA,aAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,GAAG;AACxD,UAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,UAAI,CAAC,SAAS,QAAQ;AACpB,YAAI,MAAM,MAAM;AACd,YAAE,QAAQ,MAAM,GAAG,EAAE,QAAQ,GAAG,QAAQ,QAAQ,CAAC;AAAA,QACnD;AACA;AAAA,MACF;AAEA,UAAI,MAAM,KAAK,cAAc,GAAG,KAAK;AACrC,UAAI,SAAS,KAAK,cAAc,GAAG,KAAK;AACxC,UAAI,QAAQ,EAAE,KAAK,CAAC;AAEpB,QAAE,UAAU,KAAK,CAAC;AAClB,YAAM,YAAY;AAClB,QAAE,UAAU,QAAQ,CAAC;AACrB,YAAM,eAAe;AAErB,eAAS,QAAQ,WAAS;AACxB,YAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,KAAK;AAEnD,YAAI,YAAY,EAAE,KAAK,KAAK;AAC5B,YAAI,WAAW,UAAU,YAAY,UAAU,YAAY;AAC3D,YAAI,cAAc,UAAU,eAAe,UAAU,eAAe;AACpE,YAAI,aAAa,UAAU,YAAY,SAAS,IAAI;AACpD,YAAI,SAAS,aAAa,cAAc,IAAI,SAAS,OAAO,CAAC,IAAI;AAEjE,UAAE,QAAQ,KAAK,UAAU;AAAA,UACvB,QAAQ;AAAA,UACR;AAAA,UACA,aAAa;AAAA,QACf,CAAC;AAED,UAAE,QAAQ,aAAa,QAAQ;AAAA,UAC7B,QAAQ;AAAA,UACR;AAAA,UACA,aAAa;AAAA,QACf,CAAC;AAAA,MACH,CAAC;AAED,UAAI,CAAC,EAAE,OAAO,CAAC,GAAG;AAChB,UAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,QAAQ,SAAS,OAAO,CAAC,EAAE,CAAC;AAAA,MAChE;AAAA,IACF;AAEA,aAAS,WAAW,GAAG;AACrB,UAAI,SAAS,CAAC;AACd,eAASC,KAAI,GAAG,OAAO;AACrB,YAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,YAAI,YAAY,SAAS,QAAQ;AAC/B,mBAAS,QAAQ,WAASA,KAAI,OAAO,QAAQ,CAAC,CAAC;AAAA,QACjD;AACA,eAAO,CAAC,IAAI;AAAA,MACd;AACA,QAAE,SAAS,EAAE,QAAQ,OAAKA,KAAI,GAAG,CAAC,CAAC;AACnC,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,GAAG;AACrB,aAAO,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,KAAK,CAAC,EAAE,QAAQ,CAAC;AAAA,IAC/D;AAEA,aAAS,QAAQ,GAAG;AAClB,UAAI,aAAa,EAAE,MAAM;AACzB,QAAE,WAAW,WAAW,WAAW;AACnC,aAAO,WAAW;AAClB,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,aAAa;AACpB,YAAE,WAAW,CAAC;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;;;AC7HA;AAAA;AAAA;AAAA,QAAI,OAAO;AAEX,WAAO,UAAU;AAEjB,aAAS,kBAAkB,GAAG;AAC5B,eAAS,IAAI,GAAG;AACd,YAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,SAAS,QAAQ;AACnB,mBAAS,QAAQ,GAAG;AAAA,QACtB;AAEA,YAAI,OAAO,OAAO,MAAM,SAAS,GAAG;AAClC,eAAK,aAAa,CAAC;AACnB,eAAK,cAAc,CAAC;AACpB,mBAAS,OAAO,KAAK,SAAS,UAAU,KAAK,UAAU,GACrD,OAAO,SACP,EAAE,MAAM;AACR,0BAAc,GAAG,cAAc,OAAO,GAAG,MAAM,IAAI;AACnD,0BAAc,GAAG,eAAe,OAAO,GAAG,MAAM,IAAI;AAAA,UACtD;AAAA,QACF;AAAA,MACF;AAEA,QAAE,SAAS,EAAE,QAAQ,GAAG;AAAA,IAC1B;AAEA,aAAS,cAAc,GAAG,MAAM,QAAQ,IAAI,QAAQ,MAAM;AACxD,UAAI,QAAQ,EAAE,OAAO,GAAG,QAAQ,GAAG,MAAY,YAAY,KAAK;AAChE,UAAI,OAAO,OAAO,IAAI,EAAE,OAAO,CAAC;AAChC,UAAI,OAAO,KAAK,aAAa,GAAG,UAAU,OAAO,MAAM;AACvD,aAAO,IAAI,EAAE,IAAI,IAAI;AACrB,QAAE,UAAU,MAAM,EAAE;AACpB,UAAI,MAAM;AACR,UAAE,QAAQ,MAAM,MAAM,EAAE,QAAQ,EAAE,CAAC;AAAA,MACrC;AAAA,IACF;AAAA;AAAA;;;ACpCA;AAAA;AAAA;AAEA,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAEA,aAAS,OAAO,GAAG;AACjB,UAAI,UAAU,EAAE,MAAM,EAAE,QAAQ,YAAY;AAC5C,UAAI,YAAY,QAAQ,YAAY,MAAM;AACxC,wBAAgB,CAAC;AAAA,MACnB;AAAA,IACF;AAEA,aAAS,KAAK,GAAG;AACf,UAAI,UAAU,EAAE,MAAM,EAAE,QAAQ,YAAY;AAC5C,UAAI,YAAY,QAAQ,YAAY,MAAM;AACxC,iBAAS,CAAC;AAAA,MACZ;AAEA,UAAI,YAAY,QAAQ,YAAY,MAAM;AACxC,eAAO,CAAC;AACR,wBAAgB,CAAC;AAAA,MACnB;AAAA,IACF;AAEA,aAAS,gBAAgB,GAAG;AAC1B,QAAE,MAAM,EAAE,QAAQ,OAAK,mBAAmB,EAAE,KAAK,CAAC,CAAC,CAAC;AACpD,QAAE,MAAM,EAAE,QAAQ,OAAK,mBAAmB,EAAE,KAAK,CAAC,CAAC,CAAC;AAAA,IACtD;AAEA,aAAS,mBAAmB,OAAO;AACjC,UAAI,IAAI,MAAM;AACd,YAAM,QAAQ,MAAM;AACpB,YAAM,SAAS;AAAA,IACjB;AAEA,aAAS,SAAS,GAAG;AACnB,QAAE,MAAM,EAAE,QAAQ,OAAK,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;AAE7C,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,OAAO,QAAQ,WAAW;AAC/B,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAC5B,sBAAY,IAAI;AAAA,QAClB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,YAAY,OAAO;AAC1B,YAAM,IAAI,CAAC,MAAM;AAAA,IACnB;AAEA,aAAS,OAAO,GAAG;AACjB,QAAE,MAAM,EAAE,QAAQ,OAAK,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;AAE3C,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,OAAO,QAAQ,SAAS;AAC7B,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAC5B,oBAAU,IAAI;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,UAAU,OAAO;AACxB,UAAI,IAAI,MAAM;AACd,YAAM,IAAI,MAAM;AAChB,YAAM,IAAI;AAAA,IACZ;AAAA;AAAA;;;ACrEA;AAAA;AAAA;AAEA,QAAI,OAAO;AAEX,WAAO,UAAU;AAajB,aAAS,UAAU,GAAG;AACpB,UAAI,UAAU,CAAC;AACf,UAAI,cAAc,EAAE,MAAM,EAAE,OAAO,OAAK,CAAC,EAAE,SAAS,CAAC,EAAE,MAAM;AAC7D,UAAI,mBAAmB,YAAY,IAAI,OAAK,EAAE,KAAK,CAAC,EAAE,IAAI;AAC1D,UAAI,UAAU,KAAK,kBAAkB,KAAK,KAAK,gBAAgB;AAC/D,UAAI,SAAS,KAAK,MAAM,UAAU,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC;AAEjD,eAAS,IAAI,GAAG;AACd,YAAI,QAAQ,CAAC,EAAG;AAChB,gBAAQ,CAAC,IAAI;AACb,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,eAAO,KAAK,IAAI,EAAE,KAAK,CAAC;AACxB,UAAE,WAAW,CAAC,EAAE,QAAQ,GAAG;AAAA,MAC7B;AAEA,UAAI,YAAY,YAAY,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,IAAI;AAC1E,gBAAU,QAAQ,GAAG;AAErB,aAAO;AAAA,IACT;AAAA;AAAA;;;ACpCA;AAAA;AAAA;AAEA,QAAI,YAAY,eAAmB;AAEnC,WAAO,UAAU;AAkBjB,aAAS,WAAW,GAAG,UAAU;AAC/B,UAAI,KAAK;AACT,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;AACxC,cAAM,mBAAmB,GAAG,SAAS,IAAE,CAAC,GAAG,SAAS,CAAC,CAAC;AAAA,MACxD;AACA,aAAO;AAAA,IACT;AAEA,aAAS,mBAAmB,GAAG,YAAY,YAAY;AAIrD,UAAI,WAAW,UAAU,YAAY,WAAW,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;AAChE,UAAI,eAAe,WAAW,QAAQ,OAAK;AACzC,eAAO,EAAE,SAAS,CAAC,EAAE,IAAI,OAAK;AAC5B,iBAAO,EAAE,KAAK,SAAS,EAAE,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,EAAE,OAAO;AAAA,QACxD,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AAAA,MACjC,CAAC;AAGD,UAAI,aAAa;AACjB,aAAO,aAAa,WAAW,OAAQ,gBAAe;AACtD,UAAI,WAAW,IAAI,aAAa;AAChC,oBAAc;AACd,UAAI,OAAO,IAAI,MAAM,QAAQ,EAAE,KAAK,CAAC;AAGrC,UAAI,KAAK;AACT,mBAAa,QAAQ,WAAS;AAC5B,YAAI,QAAQ,MAAM,MAAM;AACxB,aAAK,KAAK,KAAK,MAAM;AACrB,YAAI,YAAY;AAChB,eAAO,QAAQ,GAAG;AAChB,cAAI,QAAQ,GAAG;AACb,yBAAa,KAAK,QAAQ,CAAC;AAAA,UAC7B;AACA,kBAAS,QAAQ,KAAM;AACvB,eAAK,KAAK,KAAK,MAAM;AAAA,QACvB;AACA,cAAM,MAAM,SAAS;AAAA,MACvB,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;ACjEA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,WAAW,GAAG,UAAU,CAAC,GAAG;AACnC,aAAO,QAAQ,IAAI,OAAK;AACtB,YAAI,MAAM,EAAE,QAAQ,CAAC;AACrB,YAAI,CAAC,IAAI,QAAQ;AACf,iBAAO,EAAE,EAAK;AAAA,QAChB,OAAO;AACL,cAAI,SAAS,IAAI,OAAO,CAAC,KAAK,MAAM;AAClC,gBAAI,OAAO,EAAE,KAAK,CAAC,GACjB,QAAQ,EAAE,KAAK,EAAE,CAAC;AACpB,mBAAO;AAAA,cACL,KAAK,IAAI,MAAO,KAAK,SAAS,MAAM;AAAA,cACpC,QAAQ,IAAI,SAAS,KAAK;AAAA,YAC5B;AAAA,UACF,GAAG,EAAE,KAAK,GAAG,QAAQ,EAAE,CAAC;AAExB,iBAAO;AAAA,YACL;AAAA,YACA,YAAY,OAAO,MAAM,OAAO;AAAA,YAChC,QAAQ,OAAO;AAAA,UACjB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;;;ACxBA;AAAA;AAAA;AAEA,QAAI,OAAO;AAEX,WAAO,UAAU;AA2BjB,aAAS,iBAAiB,SAAS,IAAI;AACrC,UAAI,gBAAgB,CAAC;AACrB,cAAQ,QAAQ,CAAC,OAAO,MAAM;AAC5B,YAAI,MAAM,cAAc,MAAM,CAAC,IAAI;AAAA,UACjC,UAAU;AAAA,UACV,MAAM,CAAC;AAAA,UACP,KAAK,CAAC;AAAA,UACN,IAAI,CAAC,MAAM,CAAC;AAAA,UACZ;AAAA,QACF;AACA,YAAI,MAAM,eAAe,QAAW;AAClC,cAAI,aAAa,MAAM;AACvB,cAAI,SAAS,MAAM;AAAA,QACrB;AAAA,MACF,CAAC;AAED,SAAG,MAAM,EAAE,QAAQ,OAAK;AACtB,YAAI,SAAS,cAAc,EAAE,CAAC;AAC9B,YAAI,SAAS,cAAc,EAAE,CAAC;AAC9B,YAAI,WAAW,UAAa,WAAW,QAAW;AAChD,iBAAO;AACP,iBAAO,IAAI,KAAK,cAAc,EAAE,CAAC,CAAC;AAAA,QACpC;AAAA,MACF,CAAC;AAED,UAAI,YAAY,OAAO,OAAO,aAAa,EAAE,OAAO,WAAS,CAAC,MAAM,QAAQ;AAE5E,aAAO,mBAAmB,SAAS;AAAA,IACrC;AAEA,aAAS,mBAAmB,WAAW;AACrC,UAAI,UAAU,CAAC;AAEf,eAAS,SAAS,QAAQ;AACxB,eAAO,YAAU;AACf,cAAI,OAAO,QAAQ;AACjB;AAAA,UACF;AACA,cAAI,OAAO,eAAe,UACtB,OAAO,eAAe,UACtB,OAAO,cAAc,OAAO,YAAY;AAC1C,yBAAa,QAAQ,MAAM;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAEA,eAAS,UAAU,QAAQ;AACzB,eAAO,YAAU;AACf,iBAAO,IAAI,EAAE,KAAK,MAAM;AACxB,cAAI,EAAE,OAAO,aAAa,GAAG;AAC3B,sBAAU,KAAK,MAAM;AAAA,UACvB;AAAA,QACF;AAAA,MACF;AAEA,aAAO,UAAU,QAAQ;AACvB,YAAI,QAAQ,UAAU,IAAI;AAC1B,gBAAQ,KAAK,KAAK;AAClB,cAAM,IAAI,EAAE,QAAQ,EAAE,QAAQ,SAAS,KAAK,CAAC;AAC7C,cAAM,IAAI,QAAQ,UAAU,KAAK,CAAC;AAAA,MACpC;AAEA,aAAO,QAAQ,OAAO,WAAS,CAAC,MAAM,MAAM,EAAE,IAAI,WAAS;AACzD,eAAO,KAAK,KAAK,OAAO,CAAC,MAAM,KAAK,cAAc,QAAQ,CAAC;AAAA,MAC7D,CAAC;AAAA,IACH;AAEA,aAAS,aAAa,QAAQ,QAAQ;AACpC,UAAI,MAAM;AACV,UAAI,SAAS;AAEb,UAAI,OAAO,QAAQ;AACjB,eAAO,OAAO,aAAa,OAAO;AAClC,kBAAU,OAAO;AAAA,MACnB;AAEA,UAAI,OAAO,QAAQ;AACjB,eAAO,OAAO,aAAa,OAAO;AAClC,kBAAU,OAAO;AAAA,MACnB;AAEA,aAAO,KAAK,OAAO,GAAG,OAAO,OAAO,EAAE;AACtC,aAAO,aAAa,MAAM;AAC1B,aAAO,SAAS;AAChB,aAAO,IAAI,KAAK,IAAI,OAAO,GAAG,OAAO,CAAC;AACtC,aAAO,SAAS;AAAA,IAClB;AAAA;AAAA;;;ACrHA;AAAA;AAAA;AAAA,QAAI,OAAO;AAEX,WAAO,UAAU;AAEjB,aAAS,KAAK,SAAS,WAAW;AAChC,UAAI,QAAQ,KAAK,UAAU,SAAS,WAAS;AAC3C,eAAO,OAAO,OAAO,OAAO,YAAY;AAAA,MAC1C,CAAC;AACD,UAAI,WAAW,MAAM,KACnB,aAAa,MAAM,IAAI,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC,GAC/C,KAAK,CAAC,GACN,MAAM,GACN,SAAS,GACT,UAAU;AAEZ,eAAS,KAAK,gBAAgB,CAAC,CAAC,SAAS,CAAC;AAE1C,gBAAU,kBAAkB,IAAI,YAAY,OAAO;AAEnD,eAAS,QAAQ,WAAS;AACxB,mBAAW,MAAM,GAAG;AACpB,WAAG,KAAK,MAAM,EAAE;AAChB,eAAO,MAAM,aAAa,MAAM;AAChC,kBAAU,MAAM;AAChB,kBAAU,kBAAkB,IAAI,YAAY,OAAO;AAAA,MACrD,CAAC;AAED,UAAI,SAAS,EAAE,IAAI,GAAG,KAAK,IAAI,EAAE;AACjC,UAAI,QAAQ;AACV,eAAO,aAAa,MAAM;AAC1B,eAAO,SAAS;AAAA,MAClB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,kBAAkB,IAAI,YAAY,OAAO;AAChD,UAAI;AACJ,aAAO,WAAW,WAAW,OAAO,WAAW,WAAW,SAAS,CAAC,GAAG,KAAK,OAAO;AACjF,mBAAW,IAAI;AACf,WAAG,KAAK,KAAK,EAAE;AACf;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,aAAS,gBAAgB,MAAM;AAC7B,aAAO,CAAC,QAAQ,WAAW;AACzB,YAAI,OAAO,aAAa,OAAO,YAAY;AACzC,iBAAO;AAAA,QACT,WAAW,OAAO,aAAa,OAAO,YAAY;AAChD,iBAAO;AAAA,QACT;AAEA,eAAO,CAAC,OAAO,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO;AAAA,MACzD;AAAA,IACF;AAAA;AAAA;;;ACvDA;AAAA;AAAA;AAAA,QAAI,aAAa;AACjB,QAAI,mBAAmB;AACvB,QAAI,OAAO;AAEX,WAAO,UAAU;AAEjB,aAAS,aAAa,GAAG,GAAG,IAAI,WAAW;AACzC,UAAI,UAAU,EAAE,SAAS,CAAC;AAC1B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,OAAO,KAAK,aAAa;AAClC,UAAI,KAAK,OAAO,KAAK,cAAa;AAClC,UAAI,YAAY,CAAC;AAEjB,UAAI,IAAI;AACN,kBAAU,QAAQ,OAAO,OAAK,MAAM,MAAM,MAAM,EAAE;AAAA,MACpD;AAEA,UAAI,cAAc,WAAW,GAAG,OAAO;AACvC,kBAAY,QAAQ,WAAS;AAC3B,YAAI,EAAE,SAAS,MAAM,CAAC,EAAE,QAAQ;AAC9B,cAAI,iBAAiB,aAAa,GAAG,MAAM,GAAG,IAAI,SAAS;AAC3D,oBAAU,MAAM,CAAC,IAAI;AACrB,cAAI,OAAO,OAAO,gBAAgB,YAAY,GAAG;AAC/C,6BAAiB,OAAO,cAAc;AAAA,UACxC;AAAA,QACF;AAAA,MACF,CAAC;AAED,UAAI,UAAU,iBAAiB,aAAa,EAAE;AAC9C,sBAAgB,SAAS,SAAS;AAElC,UAAI,SAAS,KAAK,SAAS,SAAS;AAEpC,UAAI,IAAI;AACN,eAAO,KAAK,CAAC,IAAI,OAAO,IAAI,EAAE,EAAE,KAAK,IAAI;AACzC,YAAI,EAAE,aAAa,EAAE,EAAE,QAAQ;AAC7B,cAAI,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC,GACvC,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC;AACvC,cAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,GAAG;AACxC,mBAAO,aAAa;AACpB,mBAAO,SAAS;AAAA,UAClB;AACA,iBAAO,cAAc,OAAO,aAAa,OAAO,SAC3B,OAAO,QAAQ,OAAO,UAAU,OAAO,SAAS;AACrE,iBAAO,UAAU;AAAA,QACnB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,gBAAgB,SAAS,WAAW;AAC3C,cAAQ,QAAQ,WAAS;AACvB,cAAM,KAAK,MAAM,GAAG,QAAQ,OAAK;AAC/B,cAAI,UAAU,CAAC,GAAG;AAChB,mBAAO,UAAU,CAAC,EAAE;AAAA,UACtB;AACA,iBAAO;AAAA,QACT,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAEA,aAAS,iBAAiB,QAAQ,OAAO;AACvC,UAAI,OAAO,eAAe,QAAW;AACnC,eAAO,cAAc,OAAO,aAAa,OAAO,SAC3B,MAAM,aAAa,MAAM,WACzB,OAAO,SAAS,MAAM;AAC3C,eAAO,UAAU,MAAM;AAAA,MACzB,OAAO;AACL,eAAO,aAAa,MAAM;AAC1B,eAAO,SAAS,MAAM;AAAA,MACxB;AAAA,IACF;AAAA;AAAA;;;ACxEA;AAAA;AAAA;AAAA,QAAI,QAAQ,mBAA6B;AACzC,QAAI,OAAO;AAEX,WAAO,UAAU;AAkCjB,aAAS,gBAAgB,GAAG,MAAM,cAAc,eAAe;AAC7D,UAAI,CAAC,eAAe;AAClB,wBAAgB,EAAE,MAAM;AAAA,MAC1B;AACA,UAAI,OAAO,eAAe,CAAC,GACzB,SAAS,IAAI,MAAM,EAAE,UAAU,KAAK,CAAC,EAClC,SAAS,EAAE,KAAW,CAAC,EACvB,oBAAoB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAEzC,oBAAc,QAAQ,CAAC,MAAM;AAC3B,YAAI,OAAO,EAAE,KAAK,CAAC,GACjB,SAAS,EAAE,OAAO,CAAC;AAErB,YAAI,KAAK,SAAS,QAAQ,KAAK,WAAW,QAAQ,QAAQ,KAAK,SAAS;AACtE,iBAAO,QAAQ,CAAC;AAChB,iBAAO,UAAU,GAAG,UAAU,IAAI;AAGlC,YAAE,YAAY,EAAE,CAAC,EAAE,QAAQ,OAAK;AAC9B,gBAAI,IAAI,EAAE,MAAM,IAAI,EAAE,IAAI,EAAE,GAC1B,OAAO,OAAO,KAAK,GAAG,CAAC,GACvB,SAAS,SAAS,SAAY,KAAK,SAAS;AAC9C,mBAAO,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,SAAS,OAAO,CAAC;AAAA,UAC5D,CAAC;AAED,cAAI,OAAO,OAAO,MAAM,SAAS,GAAG;AAClC,mBAAO,QAAQ,GAAG;AAAA,cAChB,YAAY,KAAK,WAAW,IAAI;AAAA,cAChC,aAAa,KAAK,YAAY,IAAI;AAAA,YACpC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAEA,aAAS,eAAe,GAAG;AACzB,UAAI;AACJ,aAAO,EAAE,QAAS,IAAI,KAAK,SAAS,OAAO,CAAE,EAAE;AAC/C,aAAO;AAAA,IACT;AAAA;AAAA;;;AC9EA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,uBAAuB,GAAG,IAAI,IAAI;AACzC,UAAI,OAAO,CAAC,GACV;AAEF,SAAG,QAAQ,OAAK;AACd,YAAI,QAAQ,EAAE,OAAO,CAAC,GACpB,QACA;AACF,eAAO,OAAO;AACZ,mBAAS,EAAE,OAAO,KAAK;AACvB,cAAI,QAAQ;AACV,wBAAY,KAAK,MAAM;AACvB,iBAAK,MAAM,IAAI;AAAA,UACjB,OAAO;AACL,wBAAY;AACZ,uBAAW;AAAA,UACb;AACA,cAAI,aAAa,cAAc,OAAO;AACpC,eAAG,QAAQ,WAAW,KAAK;AAC3B;AAAA,UACF;AACA,kBAAQ;AAAA,QACV;AAAA,MACF,CAAC;AAAA,IAyBH;AAAA;AAAA;;;AClDA;AAAA;AAAA;AAEA,QAAI,YAAY;AAChB,QAAI,aAAa;AACjB,QAAI,eAAe;AACnB,QAAI,kBAAkB;AACtB,QAAI,yBAAyB;AAC7B,QAAI,QAAQ,mBAA6B;AACzC,QAAI,OAAO;AAEX,WAAO,UAAU;AAiBjB,aAAS,MAAM,GAAG,MAAM;AACtB,UAAI,QAAQ,OAAO,KAAK,gBAAgB,YAAY;AAClD,aAAK,YAAY,GAAG,KAAK;AACzB;AAAA,MACF;AAEA,UAAI,UAAU,KAAK,QAAQ,CAAC,GAC1B,kBAAkB,iBAAiB,GAAG,KAAK,MAAM,GAAG,UAAU,CAAC,GAAG,SAAS,GAC3E,gBAAgB,iBAAiB,GAAG,KAAK,MAAM,UAAU,GAAG,IAAI,EAAE,GAAG,UAAU;AAEjF,UAAI,WAAW,UAAU,CAAC;AAC1B,kBAAY,GAAG,QAAQ;AAEvB,UAAI,QAAQ,KAAK,8BAA8B;AAC7C;AAAA,MACF;AAEA,UAAI,SAAS,OAAO,mBAClB;AAEF,eAAS,IAAI,GAAG,WAAW,GAAG,WAAW,GAAG,EAAE,GAAG,EAAE,UAAU;AAC3D,yBAAiB,IAAI,IAAI,kBAAkB,eAAe,IAAI,KAAK,CAAC;AAEpE,mBAAW,KAAK,iBAAiB,CAAC;AAClC,YAAI,KAAK,WAAW,GAAG,QAAQ;AAC/B,YAAI,KAAK,QAAQ;AACf,qBAAW;AACX,iBAAO,OAAO,OAAO,CAAC,GAAG,QAAQ;AACjC,mBAAS;AAAA,QACX;AAAA,MACF;AAEA,kBAAY,GAAG,IAAI;AAAA,IACrB;AAEA,aAAS,iBAAiB,GAAG,OAAO,cAAc;AAIhD,YAAM,cAAc,oBAAI,IAAI;AAC5B,YAAM,gBAAgB,CAAC,MAAM,SAAS;AACpC,YAAI,CAAC,YAAY,IAAI,IAAI,GAAG;AAC1B,sBAAY,IAAI,MAAM,CAAC,CAAC;AAAA,QAC1B;AACA,oBAAY,IAAI,IAAI,EAAE,KAAK,IAAI;AAAA,MACjC;AAIA,iBAAW,KAAK,EAAE,MAAM,GAAG;AACzB,cAAM,OAAO,EAAE,KAAK,CAAC;AACrB,YAAI,OAAO,KAAK,SAAS,UAAU;AACjC,wBAAc,KAAK,MAAM,CAAC;AAAA,QAC5B;AAGA,YAAI,OAAO,KAAK,YAAY,YAAY,OAAO,KAAK,YAAY,UAAU;AACxE,mBAAS,IAAI,KAAK,SAAS,KAAK,KAAK,SAAS,KAAK;AACjD,gBAAI,MAAM,KAAK,MAAM;AAEnB,4BAAc,GAAG,CAAC;AAAA,YACpB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,aAAO,MAAM,IAAI,SAAU,MAAM;AAC/B,eAAO,gBAAgB,GAAG,MAAM,cAAc,YAAY,IAAI,IAAI,KAAK,CAAC,CAAC;AAAA,MAC3E,CAAC;AAAA,IACH;AAEA,aAAS,iBAAiB,aAAa,WAAW;AAChD,UAAI,KAAK,IAAI,MAAM;AACnB,kBAAY,QAAQ,SAAS,IAAI;AAC/B,YAAI,OAAO,GAAG,MAAM,EAAE;AACtB,YAAI,SAAS,aAAa,IAAI,MAAM,IAAI,SAAS;AACjD,eAAO,GAAG,QAAQ,CAAC,GAAG,MAAM,GAAG,KAAK,CAAC,EAAE,QAAQ,CAAC;AAChD,+BAAuB,IAAI,IAAI,OAAO,EAAE;AAAA,MAC1C,CAAC;AAAA,IACH;AAEA,aAAS,YAAY,GAAG,UAAU;AAChC,aAAO,OAAO,QAAQ,EAAE,QAAQ,WAAS,MAAM,QAAQ,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,IACvF;AAAA;AAAA;;;AC9GA;AAAA;AAAA;AAEA,QAAI,QAAQ,mBAA6B;AACzC,QAAI,OAAO;AAOX,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAmBA,aAAS,mBAAmB,GAAG,UAAU;AACvC,UAAI,YAAY,CAAC;AAEjB,eAAS,WAAW,WAAW,OAAO;AACpC,YAGE,KAAK,GAGL,UAAU,GACV,kBAAkB,UAAU,QAC5B,WAAW,MAAM,MAAM,SAAS,CAAC;AAEnC,cAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,cAAI,IAAI,0BAA0B,GAAG,CAAC,GACpC,KAAK,IAAI,EAAE,KAAK,CAAC,EAAE,QAAQ;AAE7B,cAAI,KAAK,MAAM,UAAU;AACvB,kBAAM,MAAM,SAAS,IAAE,CAAC,EAAE,QAAQ,cAAY;AAC5C,gBAAE,aAAa,QAAQ,EAAE,QAAQ,OAAK;AACpC,oBAAI,SAAS,EAAE,KAAK,CAAC,GACnB,OAAO,OAAO;AAChB,qBAAK,OAAO,MAAM,KAAK,SACnB,EAAE,OAAO,SAAS,EAAE,KAAK,QAAQ,EAAE,QAAQ;AAC7C,8BAAY,WAAW,GAAG,QAAQ;AAAA,gBACpC;AAAA,cACF,CAAC;AAAA,YACH,CAAC;AACD,sBAAU,IAAI;AACd,iBAAK;AAAA,UACP;AAAA,QACF,CAAC;AAED,eAAO;AAAA,MACT;AAEA,eAAS,UAAU,SAAS,OAAO,UAAU;AAE7C,aAAO;AAAA,IACT;AAEA,aAAS,mBAAmB,GAAG,UAAU;AACvC,UAAI,YAAY,CAAC;AAEjB,eAAS,KAAK,OAAO,UAAU,UAAU,iBAAiB,iBAAiB;AACzE,YAAI;AACJ,aAAK,MAAM,UAAU,QAAQ,EAAE,QAAQ,OAAK;AAC1C,cAAI,MAAM,CAAC;AACX,cAAI,EAAE,KAAK,CAAC,EAAE,OAAO;AACnB,cAAE,aAAa,CAAC,EAAE,QAAQ,OAAK;AAC7B,kBAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,kBAAI,MAAM,UACL,MAAM,QAAQ,mBAAmB,MAAM,QAAQ,kBAAkB;AACpE,4BAAY,WAAW,GAAG,CAAC;AAAA,cAC7B;AAAA,YACF,CAAC;AAAA,UACH;AAAA,QACF,CAAC;AAAA,MACH;AAGA,eAAS,WAAW,OAAO,OAAO;AAChC,YAAI,eAAe,IACjB,cACA,WAAW;AAEb,cAAM,QAAQ,CAAC,GAAG,mBAAmB;AACnC,cAAI,EAAE,KAAK,CAAC,EAAE,UAAU,UAAU;AAChC,gBAAI,eAAe,EAAE,aAAa,CAAC;AACnC,gBAAI,aAAa,QAAQ;AACvB,6BAAe,EAAE,KAAK,aAAa,CAAC,CAAC,EAAE;AACvC,mBAAK,OAAO,UAAU,gBAAgB,cAAc,YAAY;AAChE,yBAAW;AACX,6BAAe;AAAA,YACjB;AAAA,UACF;AACA,eAAK,OAAO,UAAU,MAAM,QAAQ,cAAc,MAAM,MAAM;AAAA,QAChE,CAAC;AAED,eAAO;AAAA,MACT;AAEA,eAAS,UAAU,SAAS,OAAO,UAAU;AAE7C,aAAO;AAAA,IACT;AAEA,aAAS,0BAA0B,GAAG,GAAG;AACvC,UAAI,EAAE,KAAK,CAAC,EAAE,OAAO;AACnB,eAAO,EAAE,aAAa,CAAC,EAAE,KAAK,OAAK,EAAE,KAAK,CAAC,EAAE,KAAK;AAAA,MACpD;AAAA,IACF;AAEA,aAAS,YAAY,WAAW,GAAG,GAAG;AACpC,UAAI,IAAI,GAAG;AACT,YAAI,MAAM;AACV,YAAI;AACJ,YAAI;AAAA,MACN;AAEA,UAAI,aAAa,UAAU,CAAC;AAC5B,UAAI,CAAC,YAAY;AACf,kBAAU,CAAC,IAAI,aAAa,CAAC;AAAA,MAC/B;AACA,iBAAW,CAAC,IAAI;AAAA,IAClB;AAEA,aAAS,YAAY,WAAW,GAAG,GAAG;AACpC,UAAI,IAAI,GAAG;AACT,YAAI,MAAM;AACV,YAAI;AACJ,YAAI;AAAA,MACN;AACA,aAAO,CAAC,CAAC,UAAU,CAAC,KAAK,OAAO,OAAO,UAAU,CAAC,GAAG,CAAC;AAAA,IACxD;AAUA,aAAS,kBAAkB,GAAG,UAAU,WAAW,YAAY;AAC7D,UAAI,OAAO,CAAC,GACV,QAAQ,CAAC,GACT,MAAM,CAAC;AAKT,eAAS,QAAQ,WAAS;AACxB,cAAM,QAAQ,CAAC,GAAG,UAAU;AAC1B,eAAK,CAAC,IAAI;AACV,gBAAM,CAAC,IAAI;AACX,cAAI,CAAC,IAAI;AAAA,QACX,CAAC;AAAA,MACH,CAAC;AAED,eAAS,QAAQ,WAAS;AACxB,YAAI,UAAU;AACd,cAAM,QAAQ,OAAK;AACjB,cAAI,KAAK,WAAW,CAAC;AACrB,cAAI,GAAG,QAAQ;AACb,iBAAK,GAAG,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;AACtC,gBAAI,MAAM,GAAG,SAAS,KAAK;AAC3B,qBAAS,IAAI,KAAK,MAAM,EAAE,GAAG,KAAK,KAAK,KAAK,EAAE,GAAG,KAAK,IAAI,EAAE,GAAG;AAC7D,kBAAI,IAAI,GAAG,CAAC;AACZ,kBAAI,MAAM,CAAC,MAAM,KACb,UAAU,IAAI,CAAC,KACf,CAAC,YAAY,WAAW,GAAG,CAAC,GAAG;AACjC,sBAAM,CAAC,IAAI;AACX,sBAAM,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;AAC3B,0BAAU,IAAI,CAAC;AAAA,cACjB;AAAA,YACF;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH,CAAC;AAED,aAAO,EAAE,MAAY,MAAa;AAAA,IACpC;AAEA,aAAS,qBAAqB,GAAG,UAAU,MAAM,OAAO,YAAY;AAMlE,UAAI,KAAK,CAAC,GACR,SAAS,gBAAgB,GAAG,UAAU,MAAM,UAAU,GACtD,aAAa,aAAa,eAAe;AAE3C,eAAS,QAAQ,WAAW,eAAe;AACzC,YAAI,QAAQ,OAAO,MAAM;AACzB,YAAI,OAAO,MAAM,IAAI;AACrB,YAAI,UAAU,CAAC;AACf,eAAO,MAAM;AACX,cAAI,QAAQ,IAAI,GAAG;AACjB,sBAAU,IAAI;AAAA,UAChB,OAAO;AACL,oBAAQ,IAAI,IAAI;AAChB,kBAAM,KAAK,IAAI;AACf,oBAAQ,MAAM,OAAO,cAAc,IAAI,CAAC;AAAA,UAC1C;AAEA,iBAAO,MAAM,IAAI;AAAA,QACnB;AAAA,MACF;AAGA,eAAS,MAAM,MAAM;AACnB,WAAG,IAAI,IAAI,OAAO,QAAQ,IAAI,EAAE,OAAO,CAAC,KAAK,MAAM;AACjD,iBAAO,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AAAA,QAC/C,GAAG,CAAC;AAAA,MACN;AAGA,eAAS,MAAM,MAAM;AACnB,YAAI,MAAM,OAAO,SAAS,IAAI,EAAE,OAAO,CAAC,KAAK,MAAM;AACjD,iBAAO,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AAAA,QAC/C,GAAG,OAAO,iBAAiB;AAE3B,YAAI,OAAO,EAAE,KAAK,IAAI;AACtB,YAAI,QAAQ,OAAO,qBAAqB,KAAK,eAAe,YAAY;AACtE,aAAG,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG;AAAA,QACnC;AAAA,MACF;AAEA,cAAQ,OAAO,OAAO,aAAa,KAAK,MAAM,CAAC;AAC/C,cAAQ,OAAO,OAAO,WAAW,KAAK,MAAM,CAAC;AAG7C,aAAO,KAAK,KAAK,EAAE,QAAQ,OAAK,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;AAEnD,aAAO;AAAA,IACT;AAGA,aAAS,gBAAgB,GAAG,UAAU,MAAM,YAAY;AACtD,UAAI,aAAa,IAAI,MAAM,GACzB,aAAa,EAAE,MAAM,GACrB,QAAQ,IAAI,WAAW,SAAS,WAAW,SAAS,UAAU;AAEhE,eAAS,QAAQ,WAAS;AACxB,YAAI;AACJ,cAAM,QAAQ,OAAK;AACjB,cAAI,QAAQ,KAAK,CAAC;AAClB,qBAAW,QAAQ,KAAK;AACxB,cAAI,GAAG;AACL,gBAAI,QAAQ,KAAK,CAAC,GAChB,UAAU,WAAW,KAAK,OAAO,KAAK;AACxC,uBAAW,QAAQ,OAAO,OAAO,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;AAAA,UACzE;AACA,cAAI;AAAA,QACN,CAAC;AAAA,MACH,CAAC;AAED,aAAO;AAAA,IACT;AAKA,aAAS,2BAA2B,GAAG,KAAK;AAC1C,aAAO,OAAO,OAAO,GAAG,EAAE,OAAO,CAAC,iBAAiB,OAAO;AACxD,YAAI,MAAM,OAAO;AACjB,YAAI,MAAM,OAAO;AAEjB,eAAO,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM;AACrC,cAAI,YAAY,MAAM,GAAG,CAAC,IAAI;AAE9B,gBAAM,KAAK,IAAI,IAAI,WAAW,GAAG;AACjC,gBAAM,KAAK,IAAI,IAAI,WAAW,GAAG;AAAA,QACnC,CAAC;AAED,cAAM,SAAS,MAAM;AACrB,YAAI,SAAS,gBAAgB,CAAC,GAAG;AAC/B,4BAAkB,CAAC,QAAQ,EAAE;AAAA,QAC/B;AACA,eAAO;AAAA,MACT,GAAG,CAAC,OAAO,mBAAmB,IAAI,CAAC,EAAE,CAAC;AAAA,IACxC;AASA,aAAS,iBAAiB,KAAK,SAAS;AACtC,UAAI,cAAc,OAAO,OAAO,OAAO,GACrC,aAAa,KAAK,kBAAkB,KAAK,KAAK,WAAW,GACzD,aAAa,KAAK,kBAAkB,KAAK,KAAK,WAAW;AAE3D,OAAC,KAAK,GAAG,EAAE,QAAQ,UAAQ;AACzB,SAAC,KAAK,GAAG,EAAE,QAAQ,WAAS;AAC1B,cAAI,YAAY,OAAO,OACrB,KAAK,IAAI,SAAS;AAEpB,cAAI,OAAO,QAAS;AAEpB,cAAI,SAAS,OAAO,OAAO,EAAE;AAC7B,cAAI,QAAQ,aAAa,KAAK,kBAAkB,KAAK,KAAK,MAAM;AAChE,cAAI,UAAU,KAAK;AACjB,oBAAQ,aAAa,KAAK,kBAAkB,KAAK,KAAI,MAAM;AAAA,UAC7D;AAEA,cAAI,OAAO;AACT,gBAAI,SAAS,IAAI,KAAK,UAAU,IAAI,OAAK,IAAI,KAAK;AAAA,UACpD;AAAA,QACF,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAEA,aAAS,QAAQ,KAAK,OAAO;AAC3B,aAAO,KAAK,UAAU,IAAI,IAAI,CAAC,KAAK,MAAM;AACxC,YAAI,OAAO;AACT,iBAAO,IAAI,MAAM,YAAY,CAAC,EAAE,CAAC;AAAA,QACnC,OAAO;AACL,cAAI,KAAK,OAAO,OAAO,GAAG,EAAE,IAAI,CAAAC,QAAMA,IAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACjE,kBAAQ,GAAG,CAAC,IAAI,GAAG,CAAC,KAAK;AAAA,QAC3B;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,UAAU,GAAG;AACpB,UAAI,WAAW,KAAK,iBAAiB,CAAC;AACtC,UAAI,YAAY,OAAO;AAAA,QACrB,mBAAmB,GAAG,QAAQ;AAAA,QAC9B,mBAAmB,GAAG,QAAQ;AAAA,MAAC;AAEjC,UAAI,MAAM,CAAC;AACX,UAAI;AACJ,OAAC,KAAK,GAAG,EAAE,QAAQ,UAAQ;AACzB,2BAAmB,SAAS,MAAM,WAAW,OAAO,OAAO,QAAQ,EAAE,QAAQ;AAC7E,SAAC,KAAK,GAAG,EAAE,QAAQ,WAAS;AAC1B,cAAI,UAAU,KAAK;AACjB,+BAAmB,iBAAiB,IAAI,WAAS;AAC/C,qBAAO,OAAO,OAAO,KAAK,EAAE,QAAQ;AAAA,YACtC,CAAC;AAAA,UACH;AAEA,cAAI,cAAc,SAAS,MAAM,EAAE,eAAe,EAAE,YAAY,KAAK,CAAC;AACtE,cAAI,QAAQ,kBAAkB,GAAG,kBAAkB,WAAW,UAAU;AACxE,cAAI,KAAK;AAAA,YAAqB;AAAA,YAAG;AAAA,YAC/B,MAAM;AAAA,YAAM,MAAM;AAAA,YAAO,UAAU;AAAA,UAAG;AACxC,cAAI,UAAU,KAAK;AACjB,iBAAK,KAAK,UAAU,IAAI,OAAK,CAAC,CAAC;AAAA,UACjC;AACA,cAAI,OAAO,KAAK,IAAI;AAAA,QACtB,CAAC;AAAA,MACH,CAAC;AAGD,UAAI,gBAAgB,2BAA2B,GAAG,GAAG;AACrD,uBAAiB,KAAK,aAAa;AACnC,aAAO,QAAQ,KAAK,EAAE,MAAM,EAAE,KAAK;AAAA,IACrC;AAEA,aAAS,IAAI,SAAS,SAAS,YAAY;AACzC,aAAO,CAAC,GAAG,GAAG,MAAM;AAClB,YAAI,SAAS,EAAE,KAAK,CAAC;AACrB,YAAI,SAAS,EAAE,KAAK,CAAC;AACrB,YAAI,MAAM;AACV,YAAI;AAEJ,eAAO,OAAO,QAAQ;AACtB,YAAI,OAAO,OAAO,QAAQ,UAAU,GAAG;AACrC,kBAAQ,OAAO,SAAS,YAAY,GAAG;AAAA,YACvC,KAAK;AAAK,sBAAQ,CAAC,OAAO,QAAQ;AAAG;AAAA,YACrC,KAAK;AAAK,sBAAQ,OAAO,QAAQ;AAAG;AAAA,UACpC;AAAA,QACF;AACA,YAAI,OAAO;AACT,iBAAO,aAAa,QAAQ,CAAC;AAAA,QAC/B;AACA,gBAAQ;AAER,gBAAQ,OAAO,QAAQ,UAAU,WAAW;AAC5C,gBAAQ,OAAO,QAAQ,UAAU,WAAW;AAE5C,eAAO,OAAO,QAAQ;AACtB,YAAI,OAAO,OAAO,QAAQ,UAAU,GAAG;AACrC,kBAAQ,OAAO,SAAS,YAAY,GAAG;AAAA,YACvC,KAAK;AAAK,sBAAQ,OAAO,QAAQ;AAAG;AAAA,YACpC,KAAK;AAAK,sBAAQ,CAAC,OAAO,QAAQ;AAAG;AAAA,UACrC;AAAA,QACF;AACA,YAAI,OAAO;AACT,iBAAO,aAAa,QAAQ,CAAC;AAAA,QAC/B;AACA,gBAAQ;AAER,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,MAAM,GAAG,GAAG;AACnB,aAAO,EAAE,KAAK,CAAC,EAAE;AAAA,IACnB;AAAA;AAAA;;;ACvaA;AAAA;AAAA;AAEA,QAAI,OAAO;AACX,QAAI,YAAY,aAAgB;AAEhC,WAAO,UAAU;AAEjB,aAAS,SAAS,GAAG;AACnB,UAAI,KAAK,mBAAmB,CAAC;AAE7B,gBAAU,CAAC;AACX,aAAO,QAAQ,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,IAClE;AAEA,aAAS,UAAU,GAAG;AACpB,UAAI,WAAW,KAAK,iBAAiB,CAAC;AACtC,UAAI,UAAU,EAAE,MAAM,EAAE;AACxB,UAAI,QAAQ;AACZ,eAAS,QAAQ,WAAS;AACxB,cAAM,YAAY,MAAM,OAAO,CAAC,KAAK,MAAM;AACzC,gBAAM,SAAS,EAAE,KAAK,CAAC,EAAE;AACzB,cAAI,MAAM,QAAQ;AAChB,mBAAO;AAAA,UACT,OAAO;AACL,mBAAO;AAAA,UACT;AAAA,QACF,GAAG,CAAC;AACJ,cAAM,QAAQ,OAAK,EAAE,KAAK,CAAC,EAAE,IAAI,QAAQ,YAAY,CAAC;AACtD,iBAAS,YAAY;AAAA,MACvB,CAAC;AAAA,IACH;AAAA;AAAA;;;AC9BA;AAAA;AAAA;AAEA,QAAI,UAAU;AACd,QAAIC,aAAY;AAChB,QAAI,OAAO;AACX,QAAI,iBAAiB,eAAkB;AACvC,QAAI,oBAAoB;AACxB,QAAI,mBAAmB,eAAkB;AACzC,QAAI,eAAe;AACnB,QAAI,oBAAoB;AACxB,QAAI,mBAAmB;AACvB,QAAI,QAAQ;AACZ,QAAI,WAAW;AACf,QAAI,OAAO;AACX,QAAI,QAAQ,mBAA6B;AAEzC,WAAO,UAAUC;AAEjB,aAASA,QAAO,GAAG,MAAM;AACvB,UAAI,OAAO,QAAQ,KAAK,cAAc,KAAK,OAAO,KAAK;AACvD,WAAK,UAAU,MAAM;AACnB,YAAI,cACF,KAAK,sBAAsB,MAAM,iBAAiB,CAAC,CAAC;AACtD,aAAK,eAAsB,MAAM,UAAU,aAAa,MAAM,IAAI,CAAC;AACnE,aAAK,sBAAsB,MAAM,iBAAiB,GAAG,WAAW,CAAC;AAAA,MACnE,CAAC;AAAA,IACH;AAEA,aAAS,UAAU,GAAG,MAAM,MAAM;AAChC,WAAK,8BAA8B,MAAM,uBAAuB,CAAC,CAAC;AAClE,WAAK,uBAA8B,MAAM,gBAAgB,CAAC,CAAC;AAC3D,WAAK,eAA8B,MAAM,QAAQ,IAAI,CAAC,CAAC;AACvD,WAAK,wBAA8B,MAAM,aAAa,IAAI,CAAC,CAAC;AAC5D,WAAK,YAA8B,MAAM,KAAK,KAAK,mBAAmB,CAAC,CAAC,CAAC;AACzE,WAAK,8BAA8B,MAAM,uBAAuB,CAAC,CAAC;AAClE,WAAK,wBAA8B,MAAM,iBAAiB,CAAC,CAAC;AAC5D,WAAK,4BAA8B,MAAM,aAAa,QAAQ,CAAC,CAAC;AAChE,WAAK,sBAA8B,MAAM,eAAe,CAAC,CAAC;AAC1D,WAAK,wBAA8B,MAAM,iBAAiB,CAAC,CAAC;AAC5D,WAAK,8BAA8B,MAAM,uBAAuB,CAAC,CAAC;AAClE,WAAK,qBAA8B,MAAMD,WAAU,IAAI,CAAC,CAAC;AACzD,WAAK,yBAA8B,MAAM,kBAAkB,CAAC,CAAC;AAC7D,WAAK,yBAA8B,MAAM,kBAAkB,CAAC,CAAC;AAC7D,WAAK,aAA8B,MAAM,MAAM,GAAG,IAAI,CAAC;AACvD,WAAK,uBAA8B,MAAM,gBAAgB,CAAC,CAAC;AAC3D,WAAK,8BAA8B,MAAM,iBAAiB,OAAO,CAAC,CAAC;AACnE,WAAK,gBAA8B,MAAM,SAAS,CAAC,CAAC;AACpD,WAAK,yBAA8B,MAAM,kBAAkB,CAAC,CAAC;AAC7D,WAAK,yBAA8B,MAAM,kBAAkB,CAAC,CAAC;AAC7D,WAAK,sBAA8B,MAAMA,WAAU,KAAK,CAAC,CAAC;AAC1D,WAAK,4BAA8B,MAAM,qBAAqB,CAAC,CAAC;AAChE,WAAK,4BAA8B,MAAM,iBAAiB,KAAK,CAAC,CAAC;AACjE,WAAK,sBAA8B,MAAM,eAAe,CAAC,CAAC;AAC1D,WAAK,4BAA8B,MAAM,qBAAqB,CAAC,CAAC;AAChE,WAAK,qBAA8B,MAAM,8BAA8B,CAAC,CAAC;AACzE,WAAK,oBAA8B,MAAM,QAAQ,KAAK,CAAC,CAAC;AAAA,IAC1D;AAQA,aAAS,iBAAiB,YAAY,aAAa;AACjD,iBAAW,MAAM,EAAE,QAAQ,OAAK;AAC9B,YAAI,aAAa,WAAW,KAAK,CAAC;AAClC,YAAI,cAAc,YAAY,KAAK,CAAC;AAEpC,YAAI,YAAY;AACd,qBAAW,IAAI,YAAY;AAC3B,qBAAW,IAAI,YAAY;AAC3B,qBAAW,OAAO,YAAY;AAE9B,cAAI,YAAY,SAAS,CAAC,EAAE,QAAQ;AAClC,uBAAW,QAAQ,YAAY;AAC/B,uBAAW,SAAS,YAAY;AAAA,UAClC;AAAA,QACF;AAAA,MACF,CAAC;AAED,iBAAW,MAAM,EAAE,QAAQ,OAAK;AAC9B,YAAI,aAAa,WAAW,KAAK,CAAC;AAClC,YAAI,cAAc,YAAY,KAAK,CAAC;AAEpC,mBAAW,SAAS,YAAY;AAChC,YAAI,OAAO,OAAO,aAAa,GAAG,GAAG;AACnC,qBAAW,IAAI,YAAY;AAC3B,qBAAW,IAAI,YAAY;AAAA,QAC7B;AAAA,MACF,CAAC;AAED,iBAAW,MAAM,EAAE,QAAQ,YAAY,MAAM,EAAE;AAC/C,iBAAW,MAAM,EAAE,SAAS,YAAY,MAAM,EAAE;AAAA,IAClD;AAEA,QAAI,gBAAgB,CAAC,WAAW,WAAW,WAAW,WAAW,SAAS;AAC1E,QAAI,gBAAgB,EAAE,SAAS,IAAI,SAAS,IAAI,SAAS,IAAI,SAAS,KAAK;AAC3E,QAAI,aAAa,CAAC,aAAa,UAAU,WAAW,OAAO;AAC3D,QAAI,eAAe,CAAC,SAAS,UAAU,MAAM;AAC7C,QAAI,eAAe,EAAE,OAAO,GAAG,QAAQ,EAAE;AACzC,QAAI,eAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa;AACxE,QAAI,eAAe;AAAA,MACjB,QAAQ;AAAA,MAAG,QAAQ;AAAA,MAAG,OAAO;AAAA,MAAG,QAAQ;AAAA,MACxC,aAAa;AAAA,MAAI,UAAU;AAAA,IAC7B;AACA,QAAI,YAAY,CAAC,UAAU;AAQ3B,aAAS,iBAAiB,YAAY;AACpC,UAAI,IAAI,IAAI,MAAM,EAAE,YAAY,MAAM,UAAU,KAAK,CAAC;AACtD,UAAI,QAAQ,aAAa,WAAW,MAAM,CAAC;AAE3C,QAAE,SAAS,OAAO;AAAA,QAAO,CAAC;AAAA,QACxB;AAAA,QACA,kBAAkB,OAAO,aAAa;AAAA,QACtC,KAAK,KAAK,OAAO,UAAU;AAAA,MAAC,CAAC;AAE/B,iBAAW,MAAM,EAAE,QAAQ,OAAK;AAC9B,YAAI,OAAO,aAAa,WAAW,KAAK,CAAC,CAAC;AAC1C,cAAM,UAAU,kBAAkB,MAAM,YAAY;AACpD,eAAO,KAAK,YAAY,EAAE,QAAQ,OAAK;AACrC,cAAI,QAAQ,CAAC,MAAM,QAAW;AAC5B,oBAAQ,CAAC,IAAI,aAAa,CAAC;AAAA,UAC7B;AAAA,QACF,CAAC;AAED,UAAE,QAAQ,GAAG,OAAO;AACpB,UAAE,UAAU,GAAG,WAAW,OAAO,CAAC,CAAC;AAAA,MACrC,CAAC;AAED,iBAAW,MAAM,EAAE,QAAQ,OAAK;AAC9B,YAAI,OAAO,aAAa,WAAW,KAAK,CAAC,CAAC;AAC1C,UAAE,QAAQ,GAAG,OAAO;AAAA,UAAO,CAAC;AAAA,UAC1B;AAAA,UACA,kBAAkB,MAAM,YAAY;AAAA,UACpC,KAAK,KAAK,MAAM,SAAS;AAAA,QAAC,CAAC;AAAA,MAC/B,CAAC;AAED,aAAO;AAAA,IACT;AAUA,aAAS,uBAAuB,GAAG;AACjC,UAAI,QAAQ,EAAE,MAAM;AACpB,YAAM,WAAW;AACjB,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,UAAU;AACf,YAAI,KAAK,SAAS,YAAY,MAAM,KAAK;AACvC,cAAI,MAAM,YAAY,QAAQ,MAAM,YAAY,MAAM;AACpD,iBAAK,SAAS,KAAK;AAAA,UACrB,OAAO;AACL,iBAAK,UAAU,KAAK;AAAA,UACtB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAQA,aAAS,uBAAuB,GAAG;AACjC,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,SAAS,KAAK,QAAQ;AAC7B,cAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,cAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,cAAI,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,IAAI,EAAE,MAAM,EAAK;AACzD,eAAK,aAAa,GAAG,cAAc,OAAO,KAAK;AAAA,QACjD;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,iBAAiB,GAAG;AAC3B,UAAI,UAAU;AACd,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,WAAW;AAClB,eAAK,UAAU,EAAE,KAAK,KAAK,SAAS,EAAE;AACtC,eAAK,UAAU,EAAE,KAAK,KAAK,YAAY,EAAE;AACzC,oBAAU,KAAK,IAAI,SAAS,KAAK,OAAO;AAAA,QAC1C;AAAA,MACF,CAAC;AACD,QAAE,MAAM,EAAE,UAAU;AAAA,IACtB;AAEA,aAAS,uBAAuB,GAAG;AACjC,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,UAAU,cAAc;AAC/B,YAAE,KAAK,KAAK,CAAC,EAAE,YAAY,KAAK;AAChC,YAAE,WAAW,CAAC;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,eAAe,GAAG;AACzB,UAAI,OAAO,OAAO;AAClB,UAAI,OAAO;AACX,UAAI,OAAO,OAAO;AAClB,UAAI,OAAO;AACX,UAAI,aAAa,EAAE,MAAM;AACzB,UAAI,UAAU,WAAW,WAAW;AACpC,UAAI,UAAU,WAAW,WAAW;AAEpC,eAAS,YAAY,OAAO;AAC1B,YAAI,IAAI,MAAM;AACd,YAAI,IAAI,MAAM;AACd,YAAI,IAAI,MAAM;AACd,YAAI,IAAI,MAAM;AACd,eAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,eAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,eAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,eAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,MACjC;AAEA,QAAE,MAAM,EAAE,QAAQ,OAAK,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;AAC7C,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAC5B,sBAAY,IAAI;AAAA,QAClB;AAAA,MACF,CAAC;AAED,cAAQ;AACR,cAAQ;AAER,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,KAAK;AACV,aAAK,KAAK;AAAA,MACZ,CAAC;AAED,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,OAAO,QAAQ,OAAK;AACvB,YAAE,KAAK;AACP,YAAE,KAAK;AAAA,QACT,CAAC;AACD,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAAE,eAAK,KAAK;AAAA,QAAM;AAChD,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAAE,eAAK,KAAK;AAAA,QAAM;AAAA,MAClD,CAAC;AAED,iBAAW,QAAQ,OAAO,OAAO;AACjC,iBAAW,SAAS,OAAO,OAAO;AAAA,IACpC;AAEA,aAAS,qBAAqB,GAAG;AAC/B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtB,YAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtB,YAAI,IAAI;AACR,YAAI,CAAC,KAAK,QAAQ;AAChB,eAAK,SAAS,CAAC;AACf,eAAK;AACL,eAAK;AAAA,QACP,OAAO;AACL,eAAK,KAAK,OAAO,CAAC;AAClB,eAAK,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAAA,QACzC;AACA,aAAK,OAAO,QAAQ,KAAK,cAAc,OAAO,EAAE,CAAC;AACjD,aAAK,OAAO,KAAK,KAAK,cAAc,OAAO,EAAE,CAAC;AAAA,MAChD,CAAC;AAAA,IACH;AAEA,aAAS,qBAAqB,GAAG;AAC/B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAC5B,cAAI,KAAK,aAAa,OAAO,KAAK,aAAa,KAAK;AAClD,iBAAK,SAAS,KAAK;AAAA,UACrB;AACA,kBAAQ,KAAK,UAAU;AAAA,YACvB,KAAK;AAAK,mBAAK,KAAK,KAAK,QAAQ,IAAI,KAAK;AAAa;AAAA,YACvD,KAAK;AAAK,mBAAK,KAAK,KAAK,QAAQ,IAAI,KAAK;AAAa;AAAA,UACvD;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,8BAA8B,GAAG;AACxC,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,UAAU;AACjB,eAAK,OAAO,QAAQ;AAAA,QACtB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,kBAAkB,GAAG;AAC5B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,EAAE,SAAS,CAAC,EAAE,QAAQ;AACxB,cAAI,OAAO,EAAE,KAAK,CAAC;AACnB,cAAI,IAAI,EAAE,KAAK,KAAK,SAAS;AAC7B,cAAI,IAAI,EAAE,KAAK,KAAK,YAAY;AAChC,cAAI,IAAI,EAAE,KAAK,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC,CAAC;AAC1D,cAAI,IAAI,EAAE,KAAK,KAAK,YAAY,KAAK,YAAY,SAAS,CAAC,CAAC;AAE5D,eAAK,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAC/B,eAAK,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAChC,eAAK,IAAI,EAAE,IAAI,KAAK,QAAQ;AAC5B,eAAK,IAAI,EAAE,IAAI,KAAK,SAAS;AAAA,QAC/B;AAAA,MACF,CAAC;AAED,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,EAAE,KAAK,CAAC,EAAE,UAAU,UAAU;AAChC,YAAE,WAAW,CAAC;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,gBAAgB,GAAG;AAC1B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,EAAE,MAAM,EAAE,GAAG;AACf,cAAI,OAAO,EAAE,KAAK,EAAE,CAAC;AACrB,cAAI,CAAC,KAAK,WAAW;AACnB,iBAAK,YAAY,CAAC;AAAA,UACpB;AACA,eAAK,UAAU,KAAK,EAAE,GAAM,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;AAC9C,YAAE,WAAW,CAAC;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,gBAAgB,GAAG;AAC1B,UAAI,SAAS,KAAK,iBAAiB,CAAC;AACpC,aAAO,QAAQ,WAAS;AACtB,YAAI,aAAa;AACjB,cAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,cAAI,OAAO,EAAE,KAAK,CAAC;AACnB,eAAK,QAAQ,IAAI;AACjB,WAAC,KAAK,aAAa,CAAC,GAAG,QAAQ,cAAY;AACzC,iBAAK,aAAa,GAAG,YAAY;AAAA,cAC/B,OAAO,SAAS,MAAM;AAAA,cACtB,QAAQ,SAAS,MAAM;AAAA,cACvB,MAAM,KAAK;AAAA,cACX,OAAO,IAAK,EAAE;AAAA,cACd,GAAG,SAAS;AAAA,cACZ,OAAO,SAAS;AAAA,YAClB,GAAG,KAAK;AAAA,UACV,CAAC;AACD,iBAAO,KAAK;AAAA,QACd,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAEA,aAAS,kBAAkB,GAAG;AAC5B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,UAAU,YAAY;AAC7B,cAAI,WAAW,EAAE,KAAK,KAAK,EAAE,CAAC;AAC9B,cAAI,IAAI,SAAS,IAAI,SAAS,QAAQ;AACtC,cAAI,IAAI,SAAS;AACjB,cAAI,KAAK,KAAK,IAAI;AAClB,cAAI,KAAK,SAAS,SAAS;AAC3B,YAAE,QAAQ,KAAK,GAAG,KAAK,KAAK;AAC5B,YAAE,WAAW,CAAC;AACd,eAAK,MAAM,SAAS;AAAA,YAClB,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG;AAAA,YAC/B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG;AAAA,YAC/B,EAAE,GAAG,IAAQ,IAAQ,EAAK;AAAA,YAC1B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG;AAAA,YAC/B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG;AAAA,UACjC;AACA,eAAK,MAAM,IAAI,KAAK;AACpB,eAAK,MAAM,IAAI,KAAK;AAAA,QACtB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,kBAAkB,KAAK,OAAO;AACrC,aAAO,KAAK,UAAU,KAAK,KAAK,KAAK,KAAK,GAAG,MAAM;AAAA,IACrD;AAEA,aAAS,aAAa,OAAO;AAC3B,UAAI,WAAW,CAAC;AAChB,UAAI,OAAO;AACT,eAAO,QAAQ,KAAK,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM;AACxC,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE,YAAY;AAAA,UACpB;AAEA,mBAAS,CAAC,IAAI;AAAA,QAChB,CAAC;AAAA,MACH;AACA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACpZA;AAAA;AAAA;AAAA,QAAI,OAAO;AACX,QAAI,QAAQ,mBAA6B;AAEzC,WAAO,UAAU;AAAA,MACf;AAAA,IACF;AAGA,aAAS,cAAc,GAAG;AACxB,UAAI,cAAc,KAAK,iBAAiB,CAAC;AAEzC,UAAI,IAAI,IAAI,MAAM,EAAE,UAAU,MAAM,YAAY,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;AAEnE,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,UAAE,QAAQ,GAAG,EAAE,OAAO,EAAE,CAAC;AACzB,UAAE,UAAU,GAAG,UAAU,EAAE,KAAK,CAAC,EAAE,IAAI;AAAA,MACzC,CAAC;AAED,QAAE,MAAM,EAAE,QAAQ,OAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC;AAEtD,kBAAY,QAAQ,CAAC,OAAO,MAAM;AAChC,YAAI,SAAS,UAAU;AACvB,UAAE,QAAQ,QAAQ,EAAE,MAAM,OAAO,CAAC;AAClC,cAAM,OAAO,CAAC,GAAG,MAAM;AACrB,YAAE,QAAQ,GAAG,GAAG,EAAE,OAAO,QAAQ,CAAC;AAClC,iBAAO;AAAA,QACT,CAAC;AAAA,MACH,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;AC9BA,IAAAE,mBAAA;AAAA;AAAA;AAAA,WAAO,UAAU;AAAA;AAAA;;;ACAjB;AAAA;AAAA;AAsBA,WAAO,UAAU;AAAA,MACf,UAAU;AAAA,MAEV,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,MAAM;AAAA,QACJ,MAAM,eAAsB;AAAA,QAC5B,QAAQ,eAAsB;AAAA,MAChC;AAAA,MACA,SAAS;AAAA,IACX;AAAA;AAAA;;;AC9BO,IAAM,gBAAgB;AAAA,EAC3B,iBAAiB,CAAC,OAChB,qBAAqB,EAAE;AAAA,EAEzB,eAAe,MACb;AAAA,EAEF,aAAa,CAAC,SACZ,wBAAwB,IAAI;AAAA,EAE9B,iBAAiB,CAAC,SAChB,WAAW,IAAI;AAAA,EAEjB,YAAY,CAAC,KAAa,eACxB,WAAW,GAAG,oCAAoC,UAAU;AAAA,EAE9D,aAAa,CAAC,WACZ,iBAAiB,MAAM;AAAA,EAEzB,cAAc,MACZ;AACJ;AAQO,SAAS,aAAa,GAAW,GAAmB;AACzD,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,EAAE;AACb,QAAM,KAAiB,MAAM,KAAK,EAAE,QAAQ,KAAK,EAAE,GAAG,MAAM,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;AACjF,WAAS,IAAI,GAAG,KAAK,IAAI,IAAK,IAAG,CAAC,EAAE,CAAC,IAAI;AACzC,WAAS,IAAI,GAAG,KAAK,IAAI,IAAK,IAAG,CAAC,EAAE,CAAC,IAAI;AACzC,WAAS,IAAI,GAAG,KAAK,IAAI,KAAK;AAC5B,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK;AAC5B,YAAM,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI;AACzC,SAAG,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI;AAAA,IACjF;AAAA,EACF;AACA,SAAO,GAAG,EAAE,EAAE,EAAE;AAClB;AAEO,SAAS,eAAe,KAAqB;AAClD,SAAO,IACJ,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ,EACtB,QAAQ,MAAM,OAAO;AAC1B;;;ACvCA,SAAS,UAAU,KAAqB;AACtC,SAAO,IAAI,KAAK,EAAE,YAAY,EAAE,QAAQ,QAAQ,GAAG;AACrD;AAEA,SAAS,YAAY,QAAgB,SAAyB;AAC5D,SAAO,GAAG,UAAU,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC;AACpD;AAEA,SAAS,oBAAoB,KAAqC;AAChE,QAAM,SAAiC,CAAC;AAExC,QAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,aAAW,QAAQ,OAAO;AACxB,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,UAAU,IAAI;AAChB,YAAM,MAAM,KAAK,MAAM,GAAG,KAAK,EAAE,KAAK;AACtC,YAAM,QAAQ,KAAK,MAAM,QAAQ,CAAC,EAAE,KAAK;AACzC,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAA8E;AACnG,QAAM,UAAU,IAAI,KAAK;AAGzB,QAAM,YAAY,QAAQ,YAAY,GAAG;AACzC,QAAM,aAAa,QAAQ,YAAY,GAAG;AAC1C,MAAI,cAAc,MAAM,eAAe,MAAM,aAAa,WAAW;AACnE,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,QAAQ,MAAM,YAAY,GAAG,UAAU;AACpD,QAAM,SAAS,QAAQ,MAAM,GAAG,SAAS,EAAE,KAAK;AAGhD,QAAM,SAAS,OAAO,QAAQ,GAAG;AACjC,MAAI,WAAW,IAAI;AACjB,UAAM,SAAS,OAAO,MAAM,GAAG,MAAM,EAAE,KAAK;AAC5C,UAAM,UAAU,OAAO,MAAM,SAAS,CAAC,EAAE,KAAK;AAC9C,WAAO,EAAE,QAAQ,SAAS,KAAK;AAAA,EACjC;AAEA,SAAO,EAAE,QAAQ,QAAQ,SAAS,MAAM,KAAK;AAC/C;AAGA,IAAM,mBAAmB,OAAO,KAAK,gBAAgB,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAEzF,SAAS,aAAa,MAA0D;AAC9E,aAAW,MAAM,kBAAkB;AACjC,UAAM,MAAM,KAAK,QAAQ,EAAE;AAC3B,QAAI,QAAQ,IAAI;AACd,aAAO,EAAE,UAAU,IAAI,OAAO,IAAI;AAAA,IACpC;AAAA,EACF;AACA,SAAO;AACT;AAIO,SAAS,MAAM,OAA4B;AAChD,QAAM,SAA4B,CAAC;AACnC,QAAM,WAA8B,CAAC;AAGrC,QAAM,aAAa,MAAM,QAAQ,SAAS,IAAI;AAC9C,QAAM,QAAQ,WAAW,MAAM,IAAI;AAEnC,QAAM,kBAAsC,oBAAI,IAAI;AACpD,QAAM,YAAgC,oBAAI,IAAI;AAC9C,QAAM,cAA4B,CAAC;AAEnC,MAAI,oBAAmC;AACvC,MAAI,eAA8B;AAClC,QAAM,SAAmB,CAAC;AAC1B,MAAI,YAA0B;AAC9B,MAAI,oBAAoB;AAExB,WAAS,UAAU,GAAG,UAAU,MAAM,QAAQ,WAAW;AACvD,UAAM,OAAO,MAAM,OAAO;AAC1B,UAAM,UAAU,UAAU;AAG1B,QAAI,KAAK,KAAK,MAAM,GAAI;AAGxB,QAAI,KAAK,WAAW,aAAa,EAAG;AAGpC,QAAI,KAAK,KAAK,EAAE,WAAW,IAAI,EAAG;AAGlC,QAAI,KAAK,UAAU,EAAE,WAAW,IAAI,GAAG;AACrC,kBAAY;AACZ,YAAM,WAAW,KAAK,UAAU,EAAE,MAAM,CAAC;AAGzC,UAAI,aAA4B;AAChC,UAAI,WAAW;AACf,YAAM,gBAAgB,SAAS,QAAQ,MAAM;AAC7C,UAAI,kBAAkB,IAAI;AACxB,qBAAa,SAAS,MAAM,gBAAgB,CAAC,EAAE,KAAK;AACpD,mBAAW,SAAS,MAAM,GAAG,aAAa;AAAA,MAC5C;AAGA,UAAI,iBAAgD;AACpD,YAAM,cAAc,SAAS,YAAY,GAAG;AAC5C,YAAM,eAAe,SAAS,YAAY,GAAG;AAC7C,UAAI,gBAAgB,MAAM,iBAAiB,MAAM,eAAe,aAAa;AAC3E,cAAM,YAAY,SAAS,MAAM,cAAc,GAAG,YAAY;AAC9D,yBAAiB,oBAAoB,SAAS;AAC9C,mBAAW,SAAS,MAAM,GAAG,WAAW,EAAE,KAAK;AAAA,MACjD;AAGA,YAAM,WAAW,aAAa,QAAQ;AACtC,UAAI,CAAC,UAAU;AACb,eAAO,KAAK;AAAA,UACV,MAAM;AAAA,UACN,SAAS,cAAc,YAAY,yBAAyB;AAAA,UAC5D,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AAEA,YAAM,EAAE,UAAU,OAAO,MAAM,IAAI;AACnC,YAAM,aAAa,iBAAiB,QAAQ;AAC5C,YAAM,aAAa,SAAS,MAAM,GAAG,KAAK,EAAE,KAAK;AACjD,YAAM,aAAa,SAAS,MAAM,QAAQ,SAAS,MAAM,EAAE,KAAK;AAGhE,YAAM,iBAAiB,cAAc,UAAU;AAC/C,YAAM,iBAAiB,cAAc,UAAU;AAE/C,UAAI,CAAC,gBAAgB;AACnB,eAAO,KAAK;AAAA,UACV,MAAM;AAAA,UACN,SAAS,cAAc,YAAY,QAAQ;AAAA,UAC3C,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AAEA,UAAI,CAAC,gBAAgB;AACnB,eAAO,KAAK;AAAA,UACV,MAAM;AAAA,UACN,SAAS,cAAc,YAAY,QAAQ;AAAA,UAC3C,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AAGA,YAAM,cAAc,aAAa,gBAAgB,YAAY;AAC7D,YAAM,cAAc,aAAa,gBAAgB,YAAY;AAG7D,iBAAW,aAAa,eAAe,MAAM,KAAK;AAClD,iBAAW,aAAa,eAAe,MAAM,IAAI;AAEjD,YAAM,OAAmB;AAAA,QACvB,IAAI,QAAQ,mBAAmB;AAAA,QAC/B,QAAQ;AAAA,UACN,SAAS,YAAY;AAAA,UACrB,QAAQ,eAAe,KAAK,KAAK,EAAE,YAAY;AAAA,UAC/C,aAAa,eAAe,KAAK,KAAK;AAAA,QACxC;AAAA,QACA,QAAQ;AAAA,UACN,SAAS,YAAY;AAAA,UACrB,QAAQ,eAAe,KAAK,KAAK,EAAE,YAAY;AAAA,UAC/C,aAAa,eAAe,KAAK,KAAK;AAAA,QACxC;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,kBAAY,KAAK,IAAI;AACrB;AAAA,IACF;AAGA,QAAI,KAAK,UAAU,EAAE,WAAW,GAAG,GAAG;AACpC,UAAI,WAAW;AACb,cAAM,QAAQ,KAAK,UAAU,EAAE,MAAM,CAAC,EAAE,KAAK;AAC7C,kBAAU,SAAS,OAAO;AAAA,MAC5B;AACA;AAAA,IACF;AAGA,QAAI,KAAK,UAAU,EAAE,WAAW,GAAG,GAAG;AACpC,YAAM,eAAe,KAAK,UAAU,EAAE,MAAM,CAAC,EAAE,KAAK;AACpD,YAAM,WAAW,aAAa,QAAQ,GAAG;AACzC,UAAI;AACJ,UAAI;AACJ,UAAI,aAAa,IAAI;AACnB,cAAM,aAAa,MAAM,GAAG,QAAQ,EAAE,KAAK;AAC3C,gBAAQ,aAAa,MAAM,WAAW,CAAC,EAAE,KAAK;AAAA,MAChD,OAAO;AACL,cAAM;AACN,gBAAQ;AAAA,MACV;AAEA,YAAM,QAAe,EAAE,KAAK,MAAM;AAClC,kBAAY;AAGZ,UAAI,mBAAmB;AACrB,cAAM,YAAY,kBAAkB,YAAY;AAChD,cAAM,QAAQ,gBAAgB,IAAI,SAAS;AAC3C,YAAI,OAAO;AACT,gBAAM,OAAO,KAAK,KAAK;AAAA,QACzB;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,KAAK,KAAK,EAAE,SAAS,GAAG,KAAK,CAAC,KAAK,KAAK,EAAE,WAAW,GAAG,KAAK,CAAC,KAAK,KAAK,EAAE,WAAW,GAAG,KAAK,CAAC,KAAK,KAAK,EAAE,WAAW,GAAG,GAAG;AAC7H,kBAAY;AACZ,YAAM,UAAU,KAAK,KAAK,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK;AAG9C,UAAI,aAAa;AACjB,UAAI,UAAyB;AAC7B,YAAM,eAAe,QAAQ,MAAM,wBAAwB;AAC3D,UAAI,cAAc;AAChB,qBAAa,aAAa,CAAC,EAAE,KAAK;AAClC,kBAAU,aAAa,CAAC,EAAE,KAAK;AAAA,MACjC;AAGA,UAAI,aAAa,KAAK,UAAU,GAAG;AACjC,uBAAe;AACf,4BAAoB;AACpB,YAAI,CAAC,OAAO,SAAS,UAAU,GAAG;AAChC,iBAAO,KAAK,UAAU;AAAA,QACxB;AACA;AAAA,MACF;AAGA,0BAAoB;AAEpB,YAAM,YAAY,WAAW,YAAY;AACzC,UAAI,CAAC,gBAAgB,IAAI,SAAS,GAAG;AACnC,cAAM,QAAe;AAAA,UACnB,IAAI,UAAU,UAAU;AAAA,UACxB,OAAO;AAAA,UACP,UAAU;AAAA,UACV,QAAQ,CAAC;AAAA,UACT,OAAO,CAAC;AAAA,UACR,cAAc;AAAA,UACd,OAAO;AAAA,QACT;AACA,wBAAgB,IAAI,WAAW,KAAK;AACpC,kBAAU,IAAI,MAAM,IAAI,KAAK;AAAA,MAC/B,WAAW,SAAS;AAElB,cAAM,WAAW,gBAAgB,IAAI,SAAS;AAC9C,YAAI,CAAC,SAAS,SAAU,UAAS,WAAW;AAAA,MAC9C;AACA;AAAA,IACF;AAGA,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS,cAAc,YAAY,0BAA0B;AAAA,MAC7D,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ,KAAK;AAAA,MACb,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAKA,MAAI,qBAA8B,CAAC,GAAG,gBAAgB,OAAO,CAAC;AAC9D,QAAM,aAAsB,CAAC;AAC7B,aAAW,CAAC,IAAI,KAAK,KAAK,WAAW;AACnC,QAAI,CAAC,CAAC,GAAG,gBAAgB,OAAO,CAAC,EAAE,KAAK,OAAK,EAAE,OAAO,EAAE,GAAG;AACzD,iBAAW,KAAK,KAAK;AAAA,IACvB;AAAA,EACF;AAKA,QAAM,iBAA8B,oBAAI,IAAI;AAC5C,aAAW,UAAU,oBAAoB;AACvC,UAAM,mBAAmB,OAAO,MAAM,KAAK,EAAE,YAAY;AACzD,UAAM,gBAAyB,CAAC;AAChC,eAAW,SAAS,CAAC,GAAG,oBAAoB,GAAG,UAAU,GAAG;AAC1D,UAAI,MAAM,gBAAgB,MAAM,aAAa,KAAK,EAAE,YAAY,MAAM,kBAAkB;AACtF,sBAAc,KAAK,KAAK;AAAA,MAC1B;AAAA,IACF;AACA,QAAI,cAAc,WAAW,EAAG;AAGhC,UAAM,kBAA2B,CAAC;AAClC,eAAW,SAAS,OAAO,QAAQ;AACjC,YAAM,WAAW,MAAM,IAAI,KAAK,EAAE,YAAY;AAC9C,YAAM,kBAAkB,cAAc;AAAA,QACpC,OAAK,EAAE,MAAM,KAAK,EAAE,YAAY,MAAM;AAAA,MACxC;AACA,UAAI,iBAAiB;AACnB,wBAAgB,OAAO,KAAK,KAAK;AAAA,MACnC,OAAO;AACL,wBAAgB,KAAK,KAAK;AAAA,MAC5B;AAAA,IACF;AACA,WAAO,SAAS;AAGhB,QAAI,gBAAgB,WAAW,GAAG;AAChC,YAAM,qBAAqB,YAAY;AAAA,QACrC,OAAK,EAAE,OAAO,YAAY,OAAO,MAAM,EAAE,OAAO,YAAY,OAAO;AAAA,MACrE;AACA,UAAI,CAAC,oBAAoB;AACvB,uBAAe,IAAI,OAAO,EAAE;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AACA,MAAI,eAAe,OAAO,GAAG;AAC3B,yBAAqB,mBAAmB,OAAO,OAAK,CAAC,eAAe,IAAI,EAAE,EAAE,CAAC;AAAA,EAC/E;AAGA,QAAM,EAAE,SAAS,SAAS,IAAI,oBAAoB,WAAW;AAG7D,QAAM,kBAAuD,CAAC;AAC9D,aAAW,QAAQ,CAAC,GAAG,SAAS,GAAG,QAAQ,GAAG;AAC5C,oBAAgB,KAAK,UAAU,KAAK,gBAAgB,KAAK,UAAU,KAAK,KAAK;AAAA,EAC/E;AAGA,QAAM,gBAAgB,CAAC,GAAG,gBAAgB,KAAK,CAAC;AAChD,aAAW,QAAQ,YAAY;AAC7B,UAAM,YAAY,KAAK,MAAM,YAAY;AACzC,eAAW,YAAY,eAAe;AACpC,YAAM,OAAO,aAAa,WAAW,QAAQ;AAC7C,UAAI,OAAO,KAAK,QAAQ,GAAG;AACzB,cAAM,YAAY,gBAAgB,IAAI,QAAQ;AAC9C,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,SAAS,cAAc,WAAW,KAAK,OAAO,UAAU,KAAK;AAAA,UAC7D,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK,MAAM;AAAA,UACnB,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAoB;AAAA,IACxB,gBAAgB;AAAA,IAChB;AAAA,IACA,aAAa;AAAA,IACb,eAAe;AAAA,IACf;AAAA,IACA;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,QAAQ,SAAS;AAIjC,WAAS,aACP,UACA,OACO;AACP,UAAM,EAAE,QAAQ,QAAQ,IAAI;AAE5B,QAAI,SAAS;AAEX,YAAMC,WAAU,YAAY,QAAQ,OAAO;AAC3C,UAAI,UAAU,IAAIA,QAAO,GAAG;AAC1B,eAAO,UAAU,IAAIA,QAAO;AAAA,MAC9B;AACA,YAAMC,SAAe;AAAA,QACnB,IAAID;AAAA,QACJ,OAAO;AAAA,QACP,UAAU;AAAA,QACV,QAAQ,CAAC;AAAA,QACT,OAAO,CAAC;AAAA,QACR,cAAc;AAAA,QACd;AAAA,MACF;AACA,gBAAU,IAAIA,UAASC,MAAK;AAC5B,aAAOA;AAAA,IACT;AAGA,UAAM,cAAc,OAAO,YAAY;AACvC,QAAI,gBAAgB,IAAI,WAAW,GAAG;AACpC,aAAO,gBAAgB,IAAI,WAAW;AAAA,IACxC;AAGA,UAAM,UAAU,UAAU,MAAM;AAChC,QAAI,UAAU,IAAI,OAAO,GAAG;AAC1B,aAAO,UAAU,IAAI,OAAO;AAAA,IAC9B;AAGA,UAAM,QAAe;AAAA,MACnB,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,UAAU;AAAA,MACV,QAAQ,CAAC;AAAA,MACT,OAAO,CAAC;AAAA,MACR,cAAc;AAAA,MACd;AAAA,IACF;AACA,cAAU,IAAI,SAAS,KAAK;AAC5B,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,OAAc,UAAkB,WAA+B;AACjF,UAAM,SAAS,SAAS,KAAK,EAAE,YAAY;AAC3C,UAAM,WAAW,MAAM,MAAM,KAAK,OAAK,EAAE,OAAO,UAAU,EAAE,cAAc,SAAS;AACnF,QAAI,CAAC,UAAU;AACb,YAAM,MAAM,KAAK;AAAA,QACf,IAAI;AAAA,QACJ,SAAS,SAAS,KAAK;AAAA,QACvB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAIA,SAAS,oBAAoB,aAG3B;AACA,MAAI,YAAY,WAAW,GAAG;AAC5B,WAAO,EAAE,SAAS,CAAC,GAAG,UAAU,CAAC,EAAE;AAAA,EACrC;AAGA,QAAM,YAAsC,oBAAI,IAAI;AACpD,QAAM,UAAqC,oBAAI,IAAI;AAEnD,aAAW,QAAQ,aAAa;AAC9B,UAAM,MAAM,KAAK,OAAO;AACxB,UAAM,MAAM,KAAK,OAAO;AAExB,QAAI,CAAC,UAAU,IAAI,GAAG,EAAG,WAAU,IAAI,KAAK,oBAAI,IAAI,CAAC;AACrD,cAAU,IAAI,GAAG,EAAG,IAAI,GAAG;AAE3B,UAAM,UAAU,GAAG,GAAG,KAAK,GAAG;AAC9B,QAAI,CAAC,QAAQ,IAAI,OAAO,EAAG,SAAQ,IAAI,SAAS,CAAC,CAAC;AAClD,YAAQ,IAAI,OAAO,EAAG,KAAK,IAAI;AAAA,EACjC;AAGA,QAAM,QAAQ,GAAG,OAAO,GAAG,QAAQ;AACnC,QAAM,QAA6B,oBAAI,IAAI;AAC3C,QAAM,YAAyB,oBAAI,IAAI;AAGvC,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,QAAQ,aAAa;AAC9B,UAAM,IAAI,KAAK,OAAO,OAAO;AAC7B,UAAM,IAAI,KAAK,OAAO,OAAO;AAAA,EAC/B;AACA,aAAW,QAAQ,OAAO;AACxB,UAAM,IAAI,MAAM,KAAK;AAAA,EACvB;AAEA,WAAS,IAAI,GAAiB;AAC5B,UAAM,IAAI,GAAG,IAAI;AACjB,UAAM,YAAY,UAAU,IAAI,CAAC,KAAK,oBAAI,IAAI;AAC9C,eAAW,KAAK,WAAW;AACzB,YAAM,IAAI,MAAM,IAAI,CAAC,KAAK;AAC1B,UAAI,MAAM,MAAM;AAEd,kBAAU,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE;AAAA,MAC5B,WAAW,MAAM,OAAO;AACtB,YAAI,CAAC;AAAA,MACP;AAAA,IACF;AACA,UAAM,IAAI,GAAG,KAAK;AAAA,EACpB;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,MAAM,IAAI,IAAI,MAAM,OAAO;AAC7B,UAAI,IAAI;AAAA,IACV;AAAA,EACF;AAGA,QAAM,UAAwB,CAAC;AAC/B,QAAM,WAAyB,CAAC;AAEhC,aAAW,QAAQ,aAAa;AAC9B,UAAM,UAAU,GAAG,KAAK,OAAO,OAAO,KAAK,KAAK,OAAO,OAAO;AAC9D,QAAI,UAAU,IAAI,OAAO,GAAG;AAC1B,eAAS,KAAK,IAAI;AAAA,IACpB,OAAO;AACL,cAAQ,KAAK,IAAI;AAAA,IACnB;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,SAAS;AAC7B;;;AC5hBA,mBAAkB;;;ACgBX,SAAS,eAAe,QAAe,QAAuB;AACnE,QAAM,KAAK,OAAO,IAAI,OAAO;AAC7B,QAAM,gBAAgB,KAAK,IAAI,KAAK,IAAI,EAAE,IAAI,KAAK,EAAE;AACrD,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,MAAM,OAAO;AACnB,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,MAAM,OAAO;AACnB,SAAO,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAC1F;AAEO,SAAS,gBACd,QACA,QACA,eACA,WACQ;AACR,QAAM,OAAO,gBAAgB;AAC7B,SAAO;AAAA,IACL,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,IACzB,KAAK,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;AAAA,IAC9B,KAAK,OAAO,IAAI,EAAE,IAAI,IAAI;AAAA,IAC1B,KAAK,OAAO,IAAI,EAAE,IAAI,IAAI;AAAA,IAC1B,KAAK,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;AAAA,IAC9B,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,EAC3B,EAAE,KAAK,GAAG;AACZ;AAEO,SAAS,gBACd,QACA,QACA,aACA,WACQ;AACR,QAAM,OAAO,cAAc;AAC3B,SAAO;AAAA,IACL,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,IACzB,KAAK,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;AAAA,IAC9B,KAAK,OAAO,IAAI,EAAE,IAAI,IAAI,MAAM,OAAO,IAAI,OAAO,KAAK,CAAC,IAAI,IAAI;AAAA,IAChE,KAAK,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;AAAA,IACxD,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,EAC3B,EAAE,KAAK,GAAG;AACZ;;;ADvCA,IAAM,YAAY;AAClB,IAAM,aAAa;AAEnB,SAAS,mBAAmB,OAAc,WAAsD;AAC9F,QAAM,aAAa,MAAM,MAAM,SAAS;AACxC,QAAM,gBAAgB,MAAM,WAAW,MAAM,SAAS,SAAS,IAAI;AACnE,QAAM,cAAc,MAAM,OAAO,IAAI,OAAM,GAAG,EAAE,GAAG,KAAK,EAAE,KAAK,GAAI,SAAS,CAAC;AAC7E,QAAM,eAAe,YAAY,SAAS,IAAI,KAAK,IAAI,GAAG,WAAW,IAAI;AAEzE,QAAM,QAAQ,KAAK;AAAA,IACjB,aAAa;AAAA,IACb,gBAAgB;AAAA,IAChB,eAAe;AAAA,IACf;AAAA,EACF;AAEA,QAAM,YAAY;AAClB,QAAM,eAAe,MAAM,WAAW,KAAK;AAC3C,QAAM,aAAa,KAAK,MAAM,OAAO;AACrC,QAAM,YAAY,KAAK,IAAK,YAAY,IAAK,IAAI,EAAE;AACnD,QAAM,UAAU;AAEhB,QAAM,SAAS,KAAK,IAAI,YAAY,eAAe,aAAa,YAAY,SAAS,UAAU;AAE/F,SAAO,EAAE,OAAO,OAAO;AACzB;AAQA,SAAS,aACP,QACA,aACqB;AAErB,QAAM,UAAU,oBAAI,IAA+B;AACnD,aAAW,SAAS,QAAQ;AAC1B,UAAM,MAAM,oBAAI,IAAkB;AAClC,eAAW,KAAK,MAAM,OAAO;AAE3B,YAAM,WAAW,IAAI,IAAI,EAAE,EAAE;AAC7B,UAAI,CAAC,YAAa,SAAS,cAAc,QAAQ,EAAE,cAAc,OAAQ;AACvE,YAAI,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AAAA,MACxB;AAAA,IACF;AACA,YAAQ,IAAI,MAAM,IAAI,GAAG;AAAA,EAC3B;AAEA,aAAW,QAAQ,aAAa;AAC9B,UAAM,WAAW,QAAQ,IAAI,KAAK,OAAO,OAAO;AAChD,QAAI,UAAU;AACZ,YAAM,WAAW,SAAS,IAAI,KAAK,OAAO,MAAM;AAChD,UAAI,CAAC,YAAY,SAAS,cAAc,MAAM;AAC5C,iBAAS,IAAI,KAAK,OAAO,QAAQ;AAAA,UAC/B,IAAI,KAAK,OAAO;AAAA,UAChB,SAAS,KAAK,OAAO;AAAA,UACrB,WAAW;AAAA,QACb,CAAC;AAAA,MACH;AAAA,IACF;AACA,UAAM,WAAW,QAAQ,IAAI,KAAK,OAAO,OAAO;AAChD,QAAI,UAAU;AACZ,YAAM,WAAW,SAAS,IAAI,KAAK,OAAO,MAAM;AAChD,UAAI,CAAC,UAAU;AACb,iBAAS,IAAI,KAAK,OAAO,QAAQ;AAAA,UAC/B,IAAI,KAAK,OAAO;AAAA,UAChB,SAAS,KAAK,OAAO;AAAA,UACrB,WAAW;AAAA,QACb,CAAC;AAAA,MACH;AAAA,IAEF;AAAA,EACF;AAEA,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,SAAS,GAAG,KAAK,SAAS;AACpC,WAAO,IAAI,SAAS,MAAM,KAAK,IAAI,OAAO,CAAC,CAAC;AAAA,EAC9C;AACA,SAAO;AACT;AAIA,SAAS,WAAW,OAAoB,OAA6B;AACnE,QAAM,UAAU,MAAM,OAAO,OAAK,EAAE,cAAc,IAAI;AACtD,QAAM,WAAW,MAAM,OAAO,OAAK,EAAE,cAAc,KAAK;AAExD,QAAM,cAA4B,CAAC;AACnC,QAAM,SAAS,MAAM,IAAI,MAAM,MAAM,WAAW,KAAK;AACrD,QAAM,UAAU;AAEhB,UAAQ,QAAQ,CAAC,GAAG,MAAM;AACxB,gBAAY,KAAK;AAAA,MACf,GAAG;AAAA,MACH,UAAU,EAAE,GAAG,MAAM,GAAG,GAAG,SAAS,IAAI,QAAQ;AAAA,MAChD,YAAY;AAAA,IACd,CAAC;AAAA,EACH,CAAC;AAED,WAAS,QAAQ,CAAC,GAAG,MAAM;AACzB,gBAAY,KAAK;AAAA,MACf,GAAG;AAAA,MACH,UAAU,EAAE,GAAG,MAAM,IAAI,MAAM,OAAO,GAAG,SAAS,IAAI,QAAQ;AAAA,MAC9D,YAAY;AAAA,IACd,CAAC;AAAA,EACH,CAAC;AAED,SAAO;AACT;AASA,SAAS,sBACP,QACA,SACA,UACM;AACN,QAAM,OAAO,CACX,SACA,QACA,WACA,gBACsB;AACtB,eAAW,QAAQ,aAAa;AAC9B,UAAI,cAAc,OAAO;AACvB,YAAI,KAAK,OAAO,YAAY,WAAW,KAAK,OAAO,WAAW,QAAQ;AACpE,iBAAO,KAAK;AAAA,QACd;AAAA,MACF,OAAO;AACL,YAAI,KAAK,OAAO,YAAY,WAAW,KAAK,OAAO,WAAW,QAAQ;AACpE,iBAAO,KAAK;AAAA,QACd;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,aAAW,SAAS,QAAQ;AAC1B,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,cAAc,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,WAAW,OAAO;AACnE,UAAI,aAAa;AACf,aAAK,aAAa;AAClB;AAAA,MACF;AACA,YAAM,eAAe,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,WAAW,QAAQ;AACrE,UAAI,cAAc;AAChB,aAAK,aAAa;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AACF;AAIA,SAAS,iBACP,OACA,QACA,WACO;AACP,QAAM,QAAQ,MAAM,MAAM,KAAK,OAAK,EAAE,OAAO,UAAU,EAAE,cAAc,SAAS;AAChF,MAAI,MAAO,QAAO,MAAM;AAIxB,QAAM,MAAM,MAAM,MAAM,KAAK,OAAK,EAAE,OAAO,MAAM;AACjD,SAAO,IAAI;AACb;AAIO,SAAS,OAAO,OAAmB,UAAyB,CAAC,GAAiB;AACnF,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,UAAU,QAAQ,WAAW;AACnC,QAAM,UAAU,QAAQ,WAAW;AAEnC,QAAM,YAAqB,CAAC,GAAG,MAAM,gBAAgB,GAAG,MAAM,UAAU;AAGxE,QAAM,iBAAiB,CAAC,GAAG,MAAM,aAAa,GAAG,MAAM,aAAa;AACpE,QAAM,eAAe,aAAa,WAAW,cAAc;AAG3D,QAAM,cAAc,oBAAI,IAA+C;AACvE,aAAW,SAAS,WAAW;AAC7B,UAAM,QAAQ,aAAa,IAAI,MAAM,EAAE,KAAK,CAAC;AAC7C,gBAAY,IAAI,MAAM,IAAI,mBAAmB,OAAO,MAAM,MAAM,CAAC;AAAA,EACnE;AAGA,QAAM,IAAI,IAAI,aAAAC,QAAM,SAAS,MAAM;AACnC,IAAE,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,EACX,CAAC;AACD,IAAE,oBAAoB,OAAO,CAAC,EAAE;AAEhC,aAAW,SAAS,WAAW;AAC7B,UAAM,IAAI,YAAY,IAAI,MAAM,EAAE;AAClC,MAAE,QAAQ,MAAM,IAAI,EAAE,OAAO,EAAE,OAAO,QAAQ,EAAE,OAAO,CAAC;AAAA,EAC1D;AAGA,aAAW,QAAQ,MAAM,aAAa;AACpC,QAAI,KAAK,OAAO,YAAY,KAAK,OAAO,QAAS;AACjD,MAAE,QAAQ,KAAK,OAAO,SAAS,KAAK,OAAO,OAAO;AAAA,EACpD;AAEA,eAAAA,QAAM,OAAO,CAAC;AAGd,QAAM,eAA8B,CAAC;AACrC,QAAM,aAAa,oBAAI,IAAyB;AAEhD,aAAW,SAAS,WAAW;AAC7B,UAAM,OAAO,EAAE,KAAK,MAAM,EAAE;AAC5B,UAAM,IAAI,YAAY,IAAI,MAAM,EAAE;AAClC,UAAM,QAAQ,MAAM,KAAK;AACzB,UAAM,QAAQ,MAAM,KAAK;AACzB,UAAM,IAAI,QAAQ,EAAE,QAAQ;AAC5B,UAAM,IAAI,QAAQ,EAAE,SAAS;AAE7B,UAAM,UAAuB;AAAA,MAC3B,IAAI,MAAM;AAAA,MACV,OAAO,MAAM;AAAA,MACb,UAAU,MAAM;AAAA,MAChB,QAAQ,MAAM;AAAA,MACd,OAAO,CAAC;AAAA,MACR,cAAc,MAAM;AAAA,MACpB;AAAA,MACA;AAAA,MACA,OAAO,EAAE;AAAA,MACT,QAAQ,EAAE;AAAA,IACZ;AACA,UAAM,QAAQ,aAAa,IAAI,MAAM,EAAE,KAAK,CAAC;AAC7C,YAAQ,QAAQ,WAAW,SAAS,KAAK;AACzC,iBAAa,KAAK,OAAO;AACzB,eAAW,IAAI,MAAM,IAAI,OAAO;AAAA,EAClC;AAGA,wBAAsB,cAAc,MAAM,aAAa,MAAM,aAAa;AAG1E,MAAI,OAAO;AACX,MAAI,OAAO;AACX,aAAW,KAAK,cAAc;AAC5B,QAAI,EAAE,IAAI,EAAE,QAAQ,KAAM,QAAO,EAAE,IAAI,EAAE;AACzC,QAAI,EAAE,IAAI,EAAE,SAAS,KAAM,QAAO,EAAE,IAAI,EAAE;AAAA,EAC5C;AAEA,QAAM,cAAc,MAAM,cAAc,SAAS;AACjD,QAAM,oBAAoB;AAC1B,QAAM,gBAAgB,OAAO;AAG7B,QAAM,oBAAwC,CAAC;AAE/C,aAAW,QAAQ,MAAM,aAAa;AACpC,UAAM,WAAW,WAAW,IAAI,KAAK,OAAO,OAAO;AACnD,UAAM,WAAW,WAAW,IAAI,KAAK,OAAO,OAAO;AACnD,QAAI,CAAC,YAAY,CAAC,SAAU;AAE5B,UAAM,SAAS,iBAAiB,UAAU,KAAK,OAAO,QAAQ,KAAK;AACnE,UAAM,SAAS,iBAAiB,UAAU,KAAK,OAAO,QAAQ,IAAI;AAElE,QAAI;AACJ,QAAI,KAAK,OAAO,YAAY,KAAK,OAAO,SAAS;AAC/C,YAAM,cAAc,SAAS,IAAI,SAAS;AAC1C,aAAO,gBAAgB,QAAQ,QAAQ,aAAa,EAAE;AAAA,IACxD,OAAO;AACL,aAAO,eAAe,QAAQ,MAAM;AAAA,IACtC;AAEA,sBAAkB,KAAK;AAAA,MACrB,IAAI,KAAK;AAAA,MACT,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,YAAY,KAAK;AAAA,MACjB,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,aAAa;AAAA,IACf,CAAC;AAAA,EACH;AAEA,aAAW,QAAQ,MAAM,eAAe;AACtC,UAAM,WAAW,WAAW,IAAI,KAAK,OAAO,OAAO;AACnD,UAAM,WAAW,WAAW,IAAI,KAAK,OAAO,OAAO;AACnD,QAAI,CAAC,YAAY,CAAC,SAAU;AAE5B,UAAM,SAAS,iBAAiB,UAAU,KAAK,OAAO,QAAQ,KAAK;AACnE,UAAM,SAAS,iBAAiB,UAAU,KAAK,OAAO,QAAQ,IAAI;AAElE,UAAM,OAAO,gBAAgB,QAAQ,QAAQ,eAAe,iBAAiB;AAE7E,sBAAkB,KAAK;AAAA,MACrB,IAAI,KAAK;AAAA,MACT,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,YAAY,KAAK;AAAA,MACjB,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,aAAa;AAAA,IACf,CAAC;AAAA,EACH;AAGA,QAAM,SAAS;AAIf,QAAM,gBAAgB,cACjB,gBAAgB,OAAQ,oBAAoB,KAAK,KAClD;AACJ,QAAM,QAAQ,OAAO;AACrB,QAAM,SAAS,OAAO,SAAS;AAE/B,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,aAAa;AAAA,IACb;AAAA,IACA;AAAA,IACA,iBAAiB,MAAM;AAAA,EACzB;AACF;;;AEzVA,SAAS,QAAgB;AACvB,SAAO,QAAQ,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,CAAC;AACtD;AAIA,SAAS,UAAU,cAAoC;AACrD,QAAM,aAAa,aAAa,OAAO;AACvC,QAAM,YAAY,aAAa,YAAY;AAC3C,QAAM,QAAQ,aAAa;AAC3B,QAAM,aAAuB,CAAC;AAC9B,QAAM,QAAsB,CAAC,SAAS,MAAM,SAAS,QAAQ,WAAW,OAAO;AAC/E,aAAW,KAAK,OAAO;AACrB,UAAM,IAAI,MAAM,CAAC,KAAK;AACtB,QAAI,IAAI,EAAG,YAAW,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE;AAAA,EACxC;AAEA,MAAI,UAAU,sBAAsB,UAAU,UAAU,eAAe,IAAI,KAAK,GAAG,QAAQ,SAAS,cAAc,cAAc,IAAI,KAAK,GAAG;AAE5I,MAAI,aAAa,KAAK,cAAc,GAAG;AACrC,UAAM,QAAQ,aAAa,OAAO,IAAI,OAAK,eAAe,EAAE,KAAK,CAAC,EAAE,KAAK,IAAI;AAC7E,eAAW,aAAa,KAAK;AAAA,EAC/B;AAEA,MAAI,WAAW,SAAS,GAAG;AACzB,eAAW,aAAa,WAAW,KAAK,IAAI,CAAC;AAAA,EAC/C;AAEA,SAAO;AACT;AAIA,SAAS,gBAAgB,OAAc,UAAkB,OAAe,QAAwB;AAC9F,MAAI,CAAC,MAAM,KAAM,QAAO;AACxB,SAAO,gBAAgB,KAAK,aAAa,MAAM,gBAAgB,QAAQ;AACzE;AAEA,SAAS,YAAY,OAAc,aAAyC;AAC1E,QAAM,QAAkB,CAAC;AACzB,QAAM,OAAiB,CAAC;AAExB,aAAW,QAAQ,aAAa;AAC9B,UAAM,aAAa,MAAM,MAAM,OAAO,KAAK,UAAU;AACrD,UAAM;AAAA,MACJ,YAAY,KAAK,IAAI,aAAa,WAAW,MAAM,mBAAmB,MAAM,MAAM,KAAK,iFAEnE,eAAe,KAAK,EAAE,CAAC,kBAAkB,KAAK,UAAU;AAAA,IAC9E;AACA,SAAK;AAAA,MACH,eAAe,KAAK,YAAY,CAAC,SAAS,KAAK,YAAY,CAAC,QAAQ,MAAM,MAAM,aAAa,WAAW,WAAW,OAAO;AAAA,IAC5H;AACA,SAAK;AAAA,MACH,eAAe,KAAK,YAAY,CAAC,SAAS,KAAK,YAAY,CAAC,QAAQ,MAAM,MAAM,aAAa,WAAW,WAAW,OAAO;AAAA,IAC5H;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE;AACtC;AAEA,SAAS,YAAY,OAAc,UAAkB,QAA+B;AAClF,QAAM,QAAkB,CAAC;AAEzB,aAAW,SAAS,QAAQ;AAC1B,UAAM,aAAa,eAAe,MAAM,gBAAgB,MAAM,KAAK;AACnE,UAAM,QAAQ,eAAe,MAAM,KAAK;AACxC,UAAM,aAAa,eAAe,MAAM,MAAM,UAAU;AAExD,UAAM,SAAS,MAAM,IAAI;AACzB,UAAM,SAAS,MAAM,IAAI;AACzB,UAAM,SAAS,MAAM,QAAQ;AAE7B,QAAI,QAAQ,mBAAmB,UAAU,kBAAkB,QAAQ;AAEnE,aAAS,YAAY,MAAM,CAAC,QAAQ,MAAM,CAAC,YAAY,MAAM,KAAK,aAAa,MAAM,MAAM,WAChF,MAAM,MAAM,IAAI,aAAa,MAAM,MAAM,MAAM,6BAA6B,MAAM,MAAM,YAAY;AAE/G,aAAS,aAAa,MAAM,CAAC,SAAS,MAAM,IAAI,GAAG,SAAS,MAAM,IAAI,MAAM,KAAK,SAAS,MAAM,IAAI,GAAG,aAC1F,MAAM,MAAM,SAAS,mBAAmB,MAAM,MAAM,UAAU;AAE3E,aAAS,aAAa,MAAM,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,GAAG,SAAS,MAAM,IAAI,MAAM,KAAK,SAAS,MAAM,IAAI,MAAM,SAAS,GAAG,aACxH,MAAM,MAAM,MAAM;AAE/B,aAAS,YAAY,MAAM,QAAQ,MAAM,YAAY,MAAM,uBAChD,MAAM,MAAM,SAAS,aAAa,MAAM,MAAM,WAAW;AAEpE,aAAS,YAAY,MAAM,IAAI,MAAM,QAAQ,CAAC,QAAQ,MAAM,IAAI,EAAE,uCAChD,UAAU,4CACjB,MAAM,MAAM,KAAK,wBAAwB,KAAK;AAEzD,QAAI,MAAM,UAAU;AAClB,YAAM,WAAW,eAAe,MAAM,QAAQ;AAC9C,YAAM,OAAO;AACb,YAAM,OAAO,SAAS;AACtB,YAAM,OAAO;AACb,YAAM,OAAO;AACb,eAAS,oCAAoC,IAAI,QAAQ,IAAI,YAAY,IAAI,aAAa,IAAI,WACnF,MAAM,MAAM,MAAM;AAC7B,eAAS,YAAY,MAAM,IAAI,MAAM,QAAQ,CAAC,QAAQ,OAAO,OAAO,IAAI,CAAC,uCACvD,UAAU,0BAA0B,MAAM,MAAM,IAAI,wBAAwB,QAAQ;AAAA,IACxG;AACA,aAAS;AACT,UAAM,KAAK,KAAK;AAAA,EAClB;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,SAAS,YAAY,QAAuB,OAAsB;AAChE,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAW;AAEjB,aAAW,SAAS,QAAQ;AAC1B,UAAM,KAAK,MAAM,QAAQ;AACzB,UAAM,KAAK,MAAM,IAAI;AACrB,QAAI,KAAK,MAAM,IAAI,MAAM,MAAM,WAAW,KAAK;AAC/C,UAAM,iBAAiB,MAAM,MAAM,KAAK,EAAE,YAAY;AACtD,eAAW,SAAS,MAAM,QAAQ;AAChC,YAAM;AAAA,QACJ,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,uBAAuB,MAAM,MAAM,SAAS,aAAa,MAAM,MAAM,WAAW;AAAA,MACxH;AACA,YAAM,UAAU,MAAM,IAAI,KAAK,EAAE,YAAY;AAC7C,YAAM,OAAO,YAAY,iBACrB,eAAe,MAAM,KAAK,IAC1B,GAAG,eAAe,MAAM,GAAG,CAAC,KAAK,eAAe,MAAM,KAAK,CAAC;AAChE,YAAM;AAAA,QACJ,YAAY,KAAK,KAAK,CAAC,QAAQ,KAAK,EAAE,uCACtB,QAAQ,0BAA0B,MAAM,MAAM,SAAS,KAAK,IAAI;AAAA,MAClF;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,SAAS,WAAW,OAAc,UAAkB,QAA+B;AACjF,MAAI,MAAM,KAAK,WAAY,QAAO;AAClC,QAAM,QAAkB,CAAC;AACzB,QAAM,IAAI,MAAM,KAAK;AAErB,aAAW,SAAS,QAAQ;AAC1B,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,EAAE,GAAG,EAAE,IAAI,KAAK;AACtB,YAAM,KAAK,eAAe,GAAG,MAAM,EAAE,IAAI,KAAK,EAAE,EAAE;AAClD,UAAI,QAAQ,iBAAiB,EAAE,kBAAkB,QAAQ;AACzD,eAAS,eAAe,CAAC,SAAS,CAAC,iBAAiB,EAAE,KAAK,aAAa,EAAE,WAAW;AACrF,eAAS,eAAe,CAAC,SAAS,CAAC,iBAAiB,EAAE,IAAI;AAC1D,eAAS,eAAe,CAAC,SAAS,CAAC,iBAAiB,EAAE,IAAI;AAC1D,eAAS,eAAe,CAAC,SAAS,CAAC,iBAAiB,EAAE,GAAG;AACzD,eAAS;AACT,YAAM,KAAK,KAAK;AAAA,IAClB;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,IAAM,oBAAgD;AAAA,EACpD,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,MAAM;AAAA,EACN,SAAS;AAAA,EACT,OAAO;AACT;AAEA,SAAS,YAAY,OAAc,QAA+B;AAChE,QAAM,QAAkB,CAAC;AACzB,QAAM,aAAa,eAAe,MAAM,KAAK,UAAU;AACvD,QAAM,WAAW,MAAM,KAAK,KAAK;AACjC,QAAM,eAAe,MAAM,KAAK,KAAK;AACrC,QAAM,gBAAgB,MAAM,KAAK,KAAK;AACtC,QAAM,aAAa,MAAM,KAAK,KAAK;AACnC,QAAM,WAAW;AACjB,QAAM,aAAa;AACnB,QAAM,UAAU;AAChB,QAAM,YAAY;AAElB,aAAW,SAAS,QAAQ;AAC1B,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,EAAE,GAAG,EAAE,IAAI,KAAK;AACtB,YAAM,QAAQ,KAAK,cAAc;AACjC,YAAM,SAAS,QAAQ,IAAI,KAAK,IAAI;AACpC,YAAM,SAAS,IAAI;AACnB,YAAM,SAAS,QAAQ,UAAU;AACjC,YAAM,UAAU,eAAe,KAAK,OAAO;AAC3C,YAAM,aAAa,KAAK,QAAQ,SAAS;AAEzC,YAAM;AAAA,QACJ,YAAY,MAAM,QAAQ,MAAM,kBAAkB,UAAU,gBAC9C,MAAM,KAAK,QAAQ,WAAW,MAAM,KAAK,UAAU,oCACjD,MAAM,KAAK,OAAO;AAAA,MACpC;AAEA,UAAI,YAAY,KAAK,YAAY;AAC/B,cAAM,WAAW,kBAAkB,KAAK,UAAU;AAClD,cAAM,YAAY,SAAS,SAAS,YAAY,WAAW;AAC3D,cAAM,YAAY,MAAM,MAAM,OAAO,KAAK,UAAU,EAAE;AAEtD,YAAI;AACJ,YAAI,OAAO;AAET,kBAAQ,SAAS,aAAa;AAAA,QAChC,OAAO;AAEL,kBAAQ,SAAS,aAAa,UAAU;AAAA,QAC1C;AACA,cAAM,QAAQ,IAAI,aAAa;AAC/B,cAAM,QAAQ,QAAQ,YAAY;AAClC,cAAM,QAAQ,QAAQ,aAAa,IAAI,eAAe,IAAI;AAC1D,cAAM;AAAA,UACJ,iCAAiC,KAAK,QAAQ,KAAK,YAAY,SAAS,aAAa,UAAU,SACxF,UAAU,WAAW,SAAS,kBAAkB,KAAK,UAAU;AAAA,QACxE;AACA,cAAM;AAAA,UACJ,sCAAsC,KAAK,QAAQ,KAAK,uCACxC,UAAU,gBAAgB,YAAY,WAAW,aAAa,uBAAuB,eAAe,QAAQ,CAAC;AAAA,QAC/H;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,SAAS,iBAAiB,OAAc,aAAyC;AAC/E,QAAM,YAAY,YAAY,OAAO,OAAK,EAAE,UAAU;AACtD,MAAI,UAAU,WAAW,EAAG,QAAO;AAEnC,QAAM,QAAkB,CAAC;AACzB,QAAM,aAAa,eAAe,MAAM,WAAW,UAAU;AAC7D,QAAM,eAAe,MAAM,WAAW,WAAW;AACjD,QAAM,mBAAmB;AAGzB,YAAU,QAAQ,CAAC,MAAM,MAAM;AAC7B,UAAM,MAAM,IAAI;AAChB,UAAM,KAAK,KAAK,YAAY;AAC5B,UAAM,KAAK,KAAK,YAAY;AAC5B,UAAM,KAAK,KAAK,YAAY;AAC5B,UAAM,KAAK,KAAK,YAAY;AAE5B,QAAI;AACJ,QAAI;AAEJ,QAAI,KAAK,YAAY;AAInB,YAAM,KAAK,MAAM;AACjB,YAAM,QAAQ,KAAK,KAAK,MAAM,iCAAiC;AAC/D,WAAK,QAAQ,WAAW,MAAM,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,IACzD,OAAO;AACL,YAAM,KAAK,MAAM;AACjB,YAAM,KAAK,MAAM;AAAA,IACnB;AAEA,UAAM,eAAe,KAAK,aACtB,MAAM,MAAM,OAAO,KAAK,UAAU,EAAE,SACpC,MAAM,MAAM;AAEhB,UAAM;AAAA,MACJ,eAAe,EAAE,SAAS,EAAE,iBAAiB,MAAM,MAAM,SAAS,aACvD,YAAY,gDAAgD,GAAG;AAAA,IAC5E;AACA,UAAM;AAAA,MACJ,YAAY,EAAE,QAAQ,KAAK,CAAC,uCACZ,gBAAgB,yBACvB,MAAM,MAAM,KAAK,KAAK,GAAG;AAAA,IACpC;AAAA,EACF,CAAC;AAGD,QAAM,SAAS;AACf,MAAI,SAAS;AACb,QAAM,UAAU;AAEhB,YAAU,QAAQ,CAAC,MAAM,MAAM;AAC7B,UAAM,MAAM,IAAI;AAChB,UAAM,WAAW,GAAG,GAAG,KAAK,eAAe,KAAK,UAAW,CAAC;AAC5D,UAAM;AAAA,MACJ,YAAY,MAAM,QAAQ,MAAM,kBAChB,UAAU,gBAAgB,YAAY,WAC7C,MAAM,WAAW,KAAK,KAAK,QAAQ;AAAA,IAC9C;AACA,cAAU;AAAA,EACZ,CAAC;AAED,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,SAAS,YAAY,OAAc,cAAoC;AACrE,QAAM,QAAsB,CAAC,SAAS,MAAM,SAAS,QAAQ,WAAW,OAAO;AAC/E,QAAM,OAAO,MAAM,OAAO,QAAM,aAAa,gBAAgB,CAAC,KAAK,KAAK,CAAC;AACzE,MAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,QAAM,QAAkB,CAAC;AACzB,QAAM,aAAa,eAAe,MAAM,WAAW,UAAU;AAC7D,QAAM,YAAY;AAClB,QAAM,IAAI,aAAa,SAAS;AAChC,MAAI,IAAI;AAER,aAAW,OAAO,MAAM;AACtB,UAAM,QAAQ,MAAM,MAAM,OAAO,GAAG,EAAE;AACtC,QAAI,IAAI,2BAA2B,CAAC,KAAK,CAAC;AAC1C,SAAK,8CAA8C,KAAK;AACxD,SAAK,mCAAmC,UAAU,yBAAyB,MAAM,WAAW,KAAK,KAAK,GAAG;AACzG,SAAK;AACL,UAAM,KAAK,CAAC;AACZ,SAAK;AAAA,EACP;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAIO,SAAS,UAAU,cAA4B,OAAsB;AAC1E,QAAM,WAAW,MAAM;AACvB,QAAM,QAAQ,aAAa;AAC3B,QAAM,SAAS,aAAa;AAC5B,QAAM,WAAW,KAAK,MAAM,KAAK;AAEjC,QAAM,OAAO,UAAU,YAAY;AAGnC,QAAM,YAAsB,CAAC;AAC7B,YAAU;AAAA,IACR,eAAe,QAAQ,yGACsB,MAAM,MAAM,UAAU,oBAAoB,MAAM,MAAM,aAAa;AAAA,EAElH;AACA,YAAU;AAAA,IACR,eAAe,QAAQ;AAAA,EAGzB;AACA,MAAI,MAAM,MAAM;AACd,UAAM,UAAU,MAAM,KAAK;AAC3B,cAAU;AAAA,MACR,gBAAgB,QAAQ,iBAAiB,OAAO,aAAa,OAAO,+CACrD,UAAU,CAAC,SAAS,UAAU,CAAC,QAAQ,MAAM,KAAK,SAAS,WAAW,MAAM,KAAK,QAAQ,cAAc,MAAM,KAAK,OAAO;AAAA,IAE1I;AAAA,EACF;AAGA,QAAM,SAAS;AAAA,IACb,0BAA0B,gBAAgB,OAAO,UAAU,OAAO,MAAM,CAAC;AAAA,IACzE,8BAA8B,YAAY,OAAO,aAAa,WAAW,CAAC;AAAA,IAC1E,+BAA+B,YAAY,OAAO,UAAU,aAAa,MAAM,CAAC;AAAA,IAChF,8BAA8B,YAAY,aAAa,QAAQ,KAAK,CAAC;AAAA,IACrE,6BAA6B,WAAW,OAAO,UAAU,aAAa,MAAM,CAAC;AAAA,IAC7E,8BAA8B,YAAY,OAAO,aAAa,MAAM,CAAC;AAAA,IACrE,mCAAmC,iBAAiB,OAAO,aAAa,WAAW,CAAC;AAAA,IACpF,8BAA8B,YAAY,OAAO,YAAY,CAAC;AAAA,EAChE,EAAE,KAAK,EAAE;AAET,QAAM,QACJ;AAIF,QAAM,YAAY;AAClB,QAAM,UAAU,QAAQ,YAAY;AACpC,QAAM,MACJ,oDAAoD,CAAC,SAAS,MAAM,OAAO,IAAI,MAAM,qCAC/D,WAAW,YAAY,CAAC,iCAAiC,QAAQ,UAAU,QAAQ,qBAC3F,QAAQ,0CACT,QAAQ,UAAU,IAAI,YACnC,QACA,SAAS,UAAU,KAAK,EAAE,CAAC,YAC3B,SACA;AAEF,SAAO;AACT;;;AClYO,IAAM,eAAsB;AAAA,EACjC,YAAY;AAAA,EACZ,OAAO;AAAA,IACL,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,YAAY;AAAA,IACZ,eAAe;AAAA,IACf,YAAY;AAAA,EACd;AAAA,EACA,OAAO;AAAA,IACL,YAAY;AAAA,IACZ,OAAO;AAAA,IACP,UAAU;AAAA,IACV,WAAW;AAAA,IACX,aAAa;AAAA,EACf;AAAA,EACA,OAAO;AAAA,IACL,WAAW;AAAA,IACX,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AAAA,EACA,MAAM;AAAA,IACJ,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,QAAQ;AAAA,MACN,OAAO;AAAA,MACP,aAAa;AAAA,MACb,MAAM;AAAA,MACN,MAAM;AAAA,MACN,KAAK;AAAA,IACP;AAAA,IACA,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,UAAU;AAAA,MACV,WAAW;AAAA,MACX,cAAc;AAAA,IAChB;AAAA,EACF;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ;AAAA,MACN,OAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,IAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,OAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,MAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,SAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,OAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,IACnD;AAAA,IACA,eAAe;AAAA,EACjB;AAAA,EACA,YAAY;AAAA,IACV,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,OAAO;AAAA,IACP,WAAW;AAAA,EACb;AAAA,EACA,MAAM;AAAA,IACJ,UAAU;AAAA,IACV,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AACF;AAGA,SAAS,UAAa,QAAW,QAA2B;AAC1D,QAAM,SAAkC,EAAE,GAAI,OAAmC;AACjF,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,aAAW,OAAO,KAAK;AACrB,UAAM,YAAY,IAAI,GAAG;AACzB,UAAM,YAAY,IAAI,GAAG;AACzB,QACE,cAAc,QACd,OAAO,cAAc,YACrB,CAAC,MAAM,QAAQ,SAAS,KACxB,cAAc,QACd,OAAO,cAAc,YACrB,CAAC,MAAM,QAAQ,SAAS,GACxB;AACA,aAAO,GAAG,IAAI;AAAA,QACZ;AAAA,QACA;AAAA,MACF;AAAA,IACF,WAAW,cAAc,QAAW;AAClC,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,YAAY,WAAsC;AAChE,SAAO,UAAU,cAAc,SAAS;AAC1C;;;AC1FO,IAAM,YAAmB,YAAY;AAAA,EAC1C,MAAM;AAAA;AAAA;AAAA,IAGJ,YAAY;AAAA,EACd;AAAA,EACA,YAAY;AAAA;AAAA;AAAA,IAGV,OAAO;AAAA,IACP,WAAW;AAAA,EACb;AAAA,EACA,MAAM;AAAA;AAAA,IAEJ,UAAU;AAAA,IACV,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AACF,CAAC;;;AChBM,SAAS,OAAO,UAAkB,SAAiC;AACxE,QAAM,cAAc,MAAM,QAAQ;AAClC,QAAM,EAAE,MAAM,IAAI;AAClB,QAAM,cAAc,MAAM,eAAe,SAAS,MAAM,WAAW;AACnE,QAAM,mBAAmB,MAAM,YAAY,SAAS,MAAM,cAAc;AACxE,MAAI,gBAAgB,KAAK,qBAAqB,GAAG;AAC/C,UAAM,IAAI,MAAM,2EAAsE;AAAA,EACxF;AACA,QAAM,eAAe,OAAO,OAAO;AAAA,IACjC,WAAW;AAAA,EACb,CAAC;AACD,QAAM,QAAQ,SAAS,QAAQ,YAAY,QAAQ,KAAK,IAAI;AAC5D,SAAO,UAAU,cAAc,KAAK;AACtC;","names":["v","w","v","range","range","g","require_util","edge","dfs","xs","normalize","layout","require_version","blockId","block","dagre"]}
+{"version":3,"sources":["../node_modules/@dagrejs/graphlib/lib/graph.js","../node_modules/@dagrejs/graphlib/lib/version.js","../node_modules/@dagrejs/graphlib/lib/index.js","../node_modules/@dagrejs/graphlib/lib/json.js","../node_modules/@dagrejs/graphlib/lib/alg/components.js","../node_modules/@dagrejs/graphlib/lib/data/priority-queue.js","../node_modules/@dagrejs/graphlib/lib/alg/dijkstra.js","../node_modules/@dagrejs/graphlib/lib/alg/dijkstra-all.js","../node_modules/@dagrejs/graphlib/lib/alg/tarjan.js","../node_modules/@dagrejs/graphlib/lib/alg/find-cycles.js","../node_modules/@dagrejs/graphlib/lib/alg/floyd-warshall.js","../node_modules/@dagrejs/graphlib/lib/alg/topsort.js","../node_modules/@dagrejs/graphlib/lib/alg/is-acyclic.js","../node_modules/@dagrejs/graphlib/lib/alg/dfs.js","../node_modules/@dagrejs/graphlib/lib/alg/postorder.js","../node_modules/@dagrejs/graphlib/lib/alg/preorder.js","../node_modules/@dagrejs/graphlib/lib/alg/prim.js","../node_modules/@dagrejs/graphlib/lib/alg/index.js","../node_modules/@dagrejs/graphlib/index.js","../node_modules/@dagrejs/dagre/lib/data/list.js","../node_modules/@dagrejs/dagre/lib/greedy-fas.js","../node_modules/@dagrejs/dagre/lib/util.js","../node_modules/@dagrejs/dagre/lib/acyclic.js","../node_modules/@dagrejs/dagre/lib/normalize.js","../node_modules/@dagrejs/dagre/lib/rank/util.js","../node_modules/@dagrejs/dagre/lib/rank/feasible-tree.js","../node_modules/@dagrejs/dagre/lib/rank/network-simplex.js","../node_modules/@dagrejs/dagre/lib/rank/index.js","../node_modules/@dagrejs/dagre/lib/parent-dummy-chains.js","../node_modules/@dagrejs/dagre/lib/nesting-graph.js","../node_modules/@dagrejs/dagre/lib/add-border-segments.js","../node_modules/@dagrejs/dagre/lib/coordinate-system.js","../node_modules/@dagrejs/dagre/lib/order/init-order.js","../node_modules/@dagrejs/dagre/lib/order/cross-count.js","../node_modules/@dagrejs/dagre/lib/order/barycenter.js","../node_modules/@dagrejs/dagre/lib/order/resolve-conflicts.js","../node_modules/@dagrejs/dagre/lib/order/sort.js","../node_modules/@dagrejs/dagre/lib/order/sort-subgraph.js","../node_modules/@dagrejs/dagre/lib/order/build-layer-graph.js","../node_modules/@dagrejs/dagre/lib/order/add-subgraph-constraints.js","../node_modules/@dagrejs/dagre/lib/order/index.js","../node_modules/@dagrejs/dagre/lib/position/bk.js","../node_modules/@dagrejs/dagre/lib/position/index.js","../node_modules/@dagrejs/dagre/lib/layout.js","../node_modules/@dagrejs/dagre/lib/debug.js","../node_modules/@dagrejs/dagre/lib/version.js","../node_modules/@dagrejs/dagre/index.js","../src/errors.ts","../src/parser.ts","../src/layout.ts","../src/edge-routing.ts","../src/renderer.ts","../src/themes/default.ts","../src/themes/dark.ts","../src/index.ts"],"sourcesContent":["\"use strict\";\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nclass Graph {\n  _isDirected = true;\n  _isMultigraph = false;\n  _isCompound = false;\n\n  // Label for the graph itself\n  _label;\n\n  // Defaults to be set when creating a new node\n  _defaultNodeLabelFn = () => undefined;\n\n  // Defaults to be set when creating a new edge\n  _defaultEdgeLabelFn = () => undefined;\n\n  // v -> label\n  _nodes = {};\n\n  // v -> edgeObj\n  _in = {};\n\n  // u -> v -> Number\n  _preds = {};\n\n  // v -> edgeObj\n  _out = {};\n\n  // v -> w -> Number\n  _sucs = {};\n\n  // e -> edgeObj\n  _edgeObjs = {};\n\n  // e -> label\n  _edgeLabels = {};\n\n  /* Number of nodes in the graph. Should only be changed by the implementation. */\n  _nodeCount = 0;\n\n  /* Number of edges in the graph. Should only be changed by the implementation. */\n  _edgeCount = 0;\n\n  _parent;\n\n  _children;\n\n  constructor(opts) {\n    if (opts) {\n      this._isDirected = Object.hasOwn(opts, \"directed\") ? opts.directed : true;\n      this._isMultigraph = Object.hasOwn(opts, \"multigraph\") ? opts.multigraph : false;\n      this._isCompound = Object.hasOwn(opts, \"compound\") ? opts.compound : false;\n    }\n\n    if (this._isCompound) {\n      // v -> parent\n      this._parent = {};\n\n      // v -> children\n      this._children = {};\n      this._children[GRAPH_NODE] = {};\n    }\n  }\n\n  /* === Graph functions ========= */\n\n  /**\n   * Whether graph was created with 'directed' flag set to true or not.\n   */\n  isDirected() {\n    return this._isDirected;\n  }\n\n  /**\n   * Whether graph was created with 'multigraph' flag set to true or not.\n   */\n  isMultigraph() {\n    return this._isMultigraph;\n  }\n\n  /**\n   * Whether graph was created with 'compound' flag set to true or not.\n   */\n  isCompound() {\n    return this._isCompound;\n  }\n\n  /**\n   * Sets the label of the graph.\n   */\n  setGraph(label) {\n    this._label = label;\n    return this;\n  }\n\n  /**\n   * Gets the graph label.\n   */\n  graph() {\n    return this._label;\n  }\n\n\n  /* === Node functions ========== */\n\n  /**\n   * Sets the default node label. If newDefault is a function, it will be\n   * invoked ach time when setting a label for a node. Otherwise, this label\n   * will be assigned as default label in case if no label was specified while\n   * setting a node.\n   * Complexity: O(1).\n   */\n  setDefaultNodeLabel(newDefault) {\n    this._defaultNodeLabelFn = newDefault;\n    if (typeof newDefault !== 'function') {\n      this._defaultNodeLabelFn = () => newDefault;\n    }\n\n    return this;\n  }\n\n  /**\n   * Gets the number of nodes in the graph.\n   * Complexity: O(1).\n   */\n  nodeCount() {\n    return this._nodeCount;\n  }\n\n  /**\n   * Gets all nodes of the graph. Note, the in case of compound graph subnodes are\n   * not included in list.\n   * Complexity: O(1).\n   */\n  nodes() {\n    return Object.keys(this._nodes);\n  }\n\n  /**\n   * Gets list of nodes without in-edges.\n   * Complexity: O(|V|).\n   */\n  sources() {\n    var self = this;\n    return this.nodes().filter(v => Object.keys(self._in[v]).length === 0);\n  }\n\n  /**\n   * Gets list of nodes without out-edges.\n   * Complexity: O(|V|).\n   */\n  sinks() {\n    var self = this;\n    return this.nodes().filter(v => Object.keys(self._out[v]).length === 0);\n  }\n\n  /**\n   * Invokes setNode method for each node in names list.\n   * Complexity: O(|names|).\n   */\n  setNodes(vs, value) {\n    var args = arguments;\n    var self = this;\n    vs.forEach(function(v) {\n      if (args.length > 1) {\n        self.setNode(v, value);\n      } else {\n        self.setNode(v);\n      }\n    });\n    return this;\n  }\n\n  /**\n   * Creates or updates the value for the node v in the graph. If label is supplied\n   * it is set as the value for the node. If label is not supplied and the node was\n   * created by this call then the default node label will be assigned.\n   * Complexity: O(1).\n   */\n  setNode(v, value) {\n    if (Object.hasOwn(this._nodes, v)) {\n      if (arguments.length > 1) {\n        this._nodes[v] = value;\n      }\n      return this;\n    }\n\n    this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n    if (this._isCompound) {\n      this._parent[v] = GRAPH_NODE;\n      this._children[v] = {};\n      this._children[GRAPH_NODE][v] = true;\n    }\n    this._in[v] = {};\n    this._preds[v] = {};\n    this._out[v] = {};\n    this._sucs[v] = {};\n    ++this._nodeCount;\n    return this;\n  }\n\n  /**\n   * Gets the label of node with specified name.\n   * Complexity: O(|V|).\n   */\n  node(v) {\n    return this._nodes[v];\n  }\n\n  /**\n   * Detects whether graph has a node with specified name or not.\n   */\n  hasNode(v) {\n    return Object.hasOwn(this._nodes, v);\n  }\n\n  /**\n   * Remove the node with the name from the graph or do nothing if the node is not in\n   * the graph. If the node was removed this function also removes any incident\n   * edges.\n   * Complexity: O(1).\n   */\n  removeNode(v) {\n    var self = this;\n    if (Object.hasOwn(this._nodes, v)) {\n      var removeEdge = e => self.removeEdge(self._edgeObjs[e]);\n      delete this._nodes[v];\n      if (this._isCompound) {\n        this._removeFromParentsChildList(v);\n        delete this._parent[v];\n        this.children(v).forEach(function(child) {\n          self.setParent(child);\n        });\n        delete this._children[v];\n      }\n      Object.keys(this._in[v]).forEach(removeEdge);\n      delete this._in[v];\n      delete this._preds[v];\n      Object.keys(this._out[v]).forEach(removeEdge);\n      delete this._out[v];\n      delete this._sucs[v];\n      --this._nodeCount;\n    }\n    return this;\n  }\n\n  /**\n   * Sets node p as a parent for node v if it is defined, or removes the\n   * parent for v if p is undefined. Method throws an exception in case of\n   * invoking it in context of noncompound graph.\n   * Average-case complexity: O(1).\n   */\n  setParent(v, parent) {\n    if (!this._isCompound) {\n      throw new Error(\"Cannot set parent in a non-compound graph\");\n    }\n\n    if (parent === undefined) {\n      parent = GRAPH_NODE;\n    } else {\n      // Coerce parent to string\n      parent += \"\";\n      for (var ancestor = parent; ancestor !== undefined; ancestor = this.parent(ancestor)) {\n        if (ancestor === v) {\n          throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n              \" would create a cycle\");\n        }\n      }\n\n      this.setNode(parent);\n    }\n\n    this.setNode(v);\n    this._removeFromParentsChildList(v);\n    this._parent[v] = parent;\n    this._children[parent][v] = true;\n    return this;\n  }\n\n  _removeFromParentsChildList(v) {\n    delete this._children[this._parent[v]][v];\n  }\n\n  /**\n   * Gets parent node for node v.\n   * Complexity: O(1).\n   */\n  parent(v) {\n    if (this._isCompound) {\n      var parent = this._parent[v];\n      if (parent !== GRAPH_NODE) {\n        return parent;\n      }\n    }\n  }\n\n  /**\n   * Gets list of direct children of node v.\n   * Complexity: O(1).\n   */\n  children(v = GRAPH_NODE) {\n    if (this._isCompound) {\n      var children = this._children[v];\n      if (children) {\n        return Object.keys(children);\n      }\n    } else if (v === GRAPH_NODE) {\n      return this.nodes();\n    } else if (this.hasNode(v)) {\n      return [];\n    }\n  }\n\n  /**\n   * Return all nodes that are predecessors of the specified node or undefined if node v is not in\n   * the graph. Behavior is undefined for undirected graphs - use neighbors instead.\n   * Complexity: O(|V|).\n   */\n  predecessors(v) {\n    var predsV = this._preds[v];\n    if (predsV) {\n      return Object.keys(predsV);\n    }\n  }\n\n  /**\n   * Return all nodes that are successors of the specified node or undefined if node v is not in\n   * the graph. Behavior is undefined for undirected graphs - use neighbors instead.\n   * Complexity: O(|V|).\n   */\n  successors(v) {\n    var sucsV = this._sucs[v];\n    if (sucsV) {\n      return Object.keys(sucsV);\n    }\n  }\n\n  /**\n   * Return all nodes that are predecessors or successors of the specified node or undefined if\n   * node v is not in the graph.\n   * Complexity: O(|V|).\n   */\n  neighbors(v) {\n    var preds = this.predecessors(v);\n    if (preds) {\n      const union = new Set(preds);\n      for (var succ of this.successors(v)) {\n        union.add(succ);\n      }\n\n      return Array.from(union.values());\n    }\n  }\n\n  isLeaf(v) {\n    var neighbors;\n    if (this.isDirected()) {\n      neighbors = this.successors(v);\n    } else {\n      neighbors = this.neighbors(v);\n    }\n    return neighbors.length === 0;\n  }\n\n  /**\n   * Creates new graph with nodes filtered via filter. Edges incident to rejected node\n   * are also removed. In case of compound graph, if parent is rejected by filter,\n   * than all its children are rejected too.\n   * Average-case complexity: O(|E|+|V|).\n   */\n  filterNodes(filter) {\n    var copy = new this.constructor({\n      directed: this._isDirected,\n      multigraph: this._isMultigraph,\n      compound: this._isCompound\n    });\n\n    copy.setGraph(this.graph());\n\n    var self = this;\n    Object.entries(this._nodes).forEach(function([v, value]) {\n      if (filter(v)) {\n        copy.setNode(v, value);\n      }\n    });\n\n    Object.values(this._edgeObjs).forEach(function(e) {\n      if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n        copy.setEdge(e, self.edge(e));\n      }\n    });\n\n    var parents = {};\n    function findParent(v) {\n      var parent = self.parent(v);\n      if (parent === undefined || copy.hasNode(parent)) {\n        parents[v] = parent;\n        return parent;\n      } else if (parent in parents) {\n        return parents[parent];\n      } else {\n        return findParent(parent);\n      }\n    }\n\n    if (this._isCompound) {\n      copy.nodes().forEach(v => copy.setParent(v, findParent(v)));\n    }\n\n    return copy;\n  }\n\n  /* === Edge functions ========== */\n\n  /**\n   * Sets the default edge label or factory function. This label will be\n   * assigned as default label in case if no label was specified while setting\n   * an edge or this function will be invoked each time when setting an edge\n   * with no label specified and returned value * will be used as a label for edge.\n   * Complexity: O(1).\n   */\n  setDefaultEdgeLabel(newDefault) {\n    this._defaultEdgeLabelFn = newDefault;\n    if (typeof newDefault !== 'function') {\n      this._defaultEdgeLabelFn = () => newDefault;\n    }\n\n    return this;\n  }\n\n  /**\n   * Gets the number of edges in the graph.\n   * Complexity: O(1).\n   */\n  edgeCount() {\n    return this._edgeCount;\n  }\n\n  /**\n   * Gets edges of the graph. In case of compound graph subgraphs are not considered.\n   * Complexity: O(|E|).\n   */\n  edges() {\n    return Object.values(this._edgeObjs);\n  }\n\n  /**\n   * Establish an edges path over the nodes in nodes list. If some edge is already\n   * exists, it will update its label, otherwise it will create an edge between pair\n   * of nodes with label provided or default label if no label provided.\n   * Complexity: O(|nodes|).\n   */\n  setPath(vs, value) {\n    var self = this;\n    var args = arguments;\n    vs.reduce(function(v, w) {\n      if (args.length > 1) {\n        self.setEdge(v, w, value);\n      } else {\n        self.setEdge(v, w);\n      }\n      return w;\n    });\n    return this;\n  }\n\n  /**\n   * Creates or updates the label for the edge (v, w) with the optionally supplied\n   * name. If label is supplied it is set as the value for the edge. If label is not\n   * supplied and the edge was created by this call then the default edge label will\n   * be assigned. The name parameter is only useful with multigraphs.\n   */\n  setEdge() {\n    var v, w, name, value;\n    var valueSpecified = false;\n    var arg0 = arguments[0];\n\n    if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n      v = arg0.v;\n      w = arg0.w;\n      name = arg0.name;\n      if (arguments.length === 2) {\n        value = arguments[1];\n        valueSpecified = true;\n      }\n    } else {\n      v = arg0;\n      w = arguments[1];\n      name = arguments[3];\n      if (arguments.length > 2) {\n        value = arguments[2];\n        valueSpecified = true;\n      }\n    }\n\n    v = \"\" + v;\n    w = \"\" + w;\n    if (name !== undefined) {\n      name = \"\" + name;\n    }\n\n    var e = edgeArgsToId(this._isDirected, v, w, name);\n    if (Object.hasOwn(this._edgeLabels, e)) {\n      if (valueSpecified) {\n        this._edgeLabels[e] = value;\n      }\n      return this;\n    }\n\n    if (name !== undefined && !this._isMultigraph) {\n      throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n    }\n\n    // It didn't exist, so we need to create it.\n    // First ensure the nodes exist.\n    this.setNode(v);\n    this.setNode(w);\n\n    this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n    var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n    // Ensure we add undirected edges in a consistent way.\n    v = edgeObj.v;\n    w = edgeObj.w;\n\n    Object.freeze(edgeObj);\n    this._edgeObjs[e] = edgeObj;\n    incrementOrInitEntry(this._preds[w], v);\n    incrementOrInitEntry(this._sucs[v], w);\n    this._in[w][e] = edgeObj;\n    this._out[v][e] = edgeObj;\n    this._edgeCount++;\n    return this;\n  }\n\n  /**\n   * Gets the label for the specified edge.\n   * Complexity: O(1).\n   */\n  edge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    return this._edgeLabels[e];\n  }\n\n  /**\n   * Gets the label for the specified edge and converts it to an object.\n   * Complexity: O(1)\n   */\n  edgeAsObj() {\n    const edge = this.edge(...arguments);\n    if (typeof edge !== \"object\") {\n      return {label: edge};\n    }\n\n    return edge;\n  }\n\n  /**\n   * Detects whether the graph contains specified edge or not. No subgraphs are considered.\n   * Complexity: O(1).\n   */\n  hasEdge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    return Object.hasOwn(this._edgeLabels, e);\n  }\n\n  /**\n   * Removes the specified edge from the graph. No subgraphs are considered.\n   * Complexity: O(1).\n   */\n  removeEdge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    var edge = this._edgeObjs[e];\n    if (edge) {\n      v = edge.v;\n      w = edge.w;\n      delete this._edgeLabels[e];\n      delete this._edgeObjs[e];\n      decrementOrRemoveEntry(this._preds[w], v);\n      decrementOrRemoveEntry(this._sucs[v], w);\n      delete this._in[w][e];\n      delete this._out[v][e];\n      this._edgeCount--;\n    }\n    return this;\n  }\n\n  /**\n   * Return all edges that point to the node v. Optionally filters those edges down to just those\n   * coming from node u. Behavior is undefined for undirected graphs - use nodeEdges instead.\n   * Complexity: O(|E|).\n   */\n  inEdges(v, u) {\n    var inV = this._in[v];\n    if (inV) {\n      var edges = Object.values(inV);\n      if (!u) {\n        return edges;\n      }\n      return edges.filter(edge => edge.v === u);\n    }\n  }\n\n  /**\n   * Return all edges that are pointed at by node v. Optionally filters those edges down to just\n   * those point to w. Behavior is undefined for undirected graphs - use nodeEdges instead.\n   * Complexity: O(|E|).\n   */\n  outEdges(v, w) {\n    var outV = this._out[v];\n    if (outV) {\n      var edges = Object.values(outV);\n      if (!w) {\n        return edges;\n      }\n      return edges.filter(edge => edge.w === w);\n    }\n  }\n\n  /**\n   * Returns all edges to or from node v regardless of direction. Optionally filters those edges\n   * down to just those between nodes v and w regardless of direction.\n   * Complexity: O(|E|).\n   */\n  nodeEdges(v, w) {\n    var inEdges = this.inEdges(v, w);\n    if (inEdges) {\n      return inEdges.concat(this.outEdges(v, w));\n    }\n  }\n}\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (name === undefined ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n\nmodule.exports = Graph;\n","module.exports = '2.2.4';\n","// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n","var Graph = require(\"./graph\");\n\nmodule.exports = {\n  write: write,\n  read: read\n};\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a string with\n * JSON.stringify. The graph can later be restored using json.read.\n */\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound()\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g)\n  };\n\n  if (g.graph() !== undefined) {\n    json.value = structuredClone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return g.nodes().map(function(v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (nodeValue !== undefined) {\n      node.value = nodeValue;\n    }\n    if (parent !== undefined) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return g.edges().map(function(e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (e.name !== undefined) {\n      edge.name = e.name;\n    }\n    if (edgeValue !== undefined) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @example\n * var g2 = graphlib.json.read(JSON.parse(str));\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n */\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  json.nodes.forEach(function(entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  json.edges.forEach(function(entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n","module.exports = components;\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (Object.hasOwn(visited, v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    g.successors(v).forEach(dfs);\n    g.predecessors(v).forEach(dfs);\n  }\n\n  g.nodes().forEach(function(v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n","/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nclass PriorityQueue {\n  _arr = [];\n  _keyIndices = {};\n\n  /**\n   * Returns the number of elements in the queue. Takes `O(1)` time.\n   */\n  size() {\n    return this._arr.length;\n  }\n\n  /**\n   * Returns the keys that are in the queue. Takes `O(n)` time.\n   */\n  keys() {\n    return this._arr.map(function(x) { return x.key; });\n  }\n\n  /**\n   * Returns `true` if **key** is in the queue and `false` if not.\n   */\n  has(key) {\n    return Object.hasOwn(this._keyIndices, key);\n  }\n\n  /**\n   * Returns the priority for **key**. If **key** is not present in the queue\n   * then this function returns `undefined`. Takes `O(1)` time.\n   *\n   * @param {Object} key\n   */\n  priority(key) {\n    var index = this._keyIndices[key];\n    if (index !== undefined) {\n      return this._arr[index].priority;\n    }\n  }\n\n  /**\n   * Returns the key for the minimum element in this queue. If the queue is\n   * empty this function throws an Error. Takes `O(1)` time.\n   */\n  min() {\n    if (this.size() === 0) {\n      throw new Error(\"Queue underflow\");\n    }\n    return this._arr[0].key;\n  }\n\n  /**\n   * Inserts a new key into the priority queue. If the key already exists in\n   * the queue this function returns `false`; otherwise it will return `true`.\n   * Takes `O(n)` time.\n   *\n   * @param {Object} key the key to add\n   * @param {Number} priority the initial priority for the key\n   */\n  add(key, priority) {\n    var keyIndices = this._keyIndices;\n    key = String(key);\n    if (!Object.hasOwn(keyIndices, key)) {\n      var arr = this._arr;\n      var index = arr.length;\n      keyIndices[key] = index;\n      arr.push({key: key, priority: priority});\n      this._decrease(index);\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n   */\n  removeMin() {\n    this._swap(0, this._arr.length - 1);\n    var min = this._arr.pop();\n    delete this._keyIndices[min.key];\n    this._heapify(0);\n    return min.key;\n  }\n\n  /**\n   * Decreases the priority for **key** to **priority**. If the new priority is\n   * greater than the previous priority, this function will throw an Error.\n   *\n   * @param {Object} key the key for which to raise priority\n   * @param {Number} priority the new priority for the key\n   */\n  decrease(key, priority) {\n    var index = this._keyIndices[key];\n    if (priority > this._arr[index].priority) {\n      throw new Error(\"New priority is greater than current priority. \" +\n          \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n    }\n    this._arr[index].priority = priority;\n    this._decrease(index);\n  }\n\n  _heapify(i) {\n    var arr = this._arr;\n    var l = 2 * i;\n    var r = l + 1;\n    var largest = i;\n    if (l < arr.length) {\n      largest = arr[l].priority < arr[largest].priority ? l : largest;\n      if (r < arr.length) {\n        largest = arr[r].priority < arr[largest].priority ? r : largest;\n      }\n      if (largest !== i) {\n        this._swap(i, largest);\n        this._heapify(largest);\n      }\n    }\n  }\n\n  _decrease(index) {\n    var arr = this._arr;\n    var priority = arr[index].priority;\n    var parent;\n    while (index !== 0) {\n      parent = index >> 1;\n      if (arr[parent].priority < priority) {\n        break;\n      }\n      this._swap(index, parent);\n      index = parent;\n    }\n  }\n\n  _swap(i, j) {\n    var arr = this._arr;\n    var keyIndices = this._keyIndices;\n    var origArrI = arr[i];\n    var origArrJ = arr[j];\n    arr[i] = origArrJ;\n    arr[j] = origArrI;\n    keyIndices[origArrJ.key] = i;\n    keyIndices[origArrI.key] = j;\n  }\n}\n\nmodule.exports = PriorityQueue;\n","var PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = () => 1;\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(g, String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function(edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function(v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n","var dijkstra = require(\"./dijkstra\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return g.nodes().reduce(function(acc, v) {\n    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n    return acc;\n  }, {});\n}\n","module.exports = tarjan;\n\nfunction tarjan(g) {\n  var index = 0;\n  var stack = [];\n  var visited = {}; // node id -> { onStack, lowlink, index }\n  var results = [];\n\n  function dfs(v) {\n    var entry = visited[v] = {\n      onStack: true,\n      lowlink: index,\n      index: index++\n    };\n    stack.push(v);\n\n    g.successors(v).forEach(function(w) {\n      if (!Object.hasOwn(visited, w)) {\n        dfs(w);\n        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n      } else if (visited[w].onStack) {\n        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n      }\n    });\n\n    if (entry.lowlink === entry.index) {\n      var cmpt = [];\n      var w;\n      do {\n        w = stack.pop();\n        visited[w].onStack = false;\n        cmpt.push(w);\n      } while (v !== w);\n      results.push(cmpt);\n    }\n  }\n\n  g.nodes().forEach(function(v) {\n    if (!Object.hasOwn(visited, v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n","var tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n  return tarjan(g).filter(function(cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n","module.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = () => 1;\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function(v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function(w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function(edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function(k) {\n    var rowK = results[k];\n    nodes.forEach(function(i) {\n      var rowI = results[i];\n      nodes.forEach(function(j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n","function topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (Object.hasOwn(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!Object.hasOwn(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      g.predecessors(node).forEach(visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  g.sinks().forEach(visit);\n\n  if (Object.keys(visited).length !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nclass CycleException extends Error {\n  constructor() {\n    super(...arguments);\n  }\n}\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n","var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n  try {\n    topsort(g);\n  } catch (e) {\n    if (e instanceof topsort.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n","module.exports = dfs;\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * If the order is not \"post\", it will be treated as \"pre\".\n */\nfunction dfs(g, vs, order) {\n  if (!Array.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = g.isDirected() ? v => g.successors(v) : v => g.neighbors(v);\n  var orderFunc = order === \"post\" ? postOrderDfs : preOrderDfs;\n\n  var acc = [];\n  var visited = {};\n  vs.forEach(v => {\n    if (!g.hasNode(v)) {\n      throw new Error(\"Graph does not have node: \" + v);\n    }\n\n    orderFunc(v, navigation, visited, acc);\n  });\n\n  return acc;\n}\n\nfunction postOrderDfs(v, navigation, visited, acc) {\n  var stack = [[v, false]];\n  while (stack.length > 0) {\n    var curr = stack.pop();\n    if (curr[1]) {\n      acc.push(curr[0]);\n    } else {\n      if (!Object.hasOwn(visited, curr[0])) {\n        visited[curr[0]] = true;\n        stack.push([curr[0], true]);\n        forEachRight(navigation(curr[0]), w => stack.push([w, false]));\n      }\n    }\n  }\n}\n\nfunction preOrderDfs(v, navigation, visited, acc) {\n  var stack = [v];\n  while (stack.length > 0) {\n    var curr = stack.pop();\n    if (!Object.hasOwn(visited, curr)) {\n      visited[curr] = true;\n      acc.push(curr);\n      forEachRight(navigation(curr), w => stack.push(w));\n    }\n  }\n}\n\nfunction forEachRight(array, iteratee) {\n  var length = array.length;\n  while (length--) {\n    iteratee(array[length], length, array);\n  }\n\n  return array;\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, \"post\");\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, \"pre\");\n}\n","var Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n  var result = new Graph();\n  var parents = {};\n  var pq = new PriorityQueue();\n  var v;\n\n  function updateNeighbors(edge) {\n    var w = edge.v === v ? edge.w : edge.v;\n    var pri = pq.priority(w);\n    if (pri !== undefined) {\n      var edgeWeight = weightFunc(edge);\n      if (edgeWeight < pri) {\n        parents[w] = v;\n        pq.decrease(w, edgeWeight);\n      }\n    }\n  }\n\n  if (g.nodeCount() === 0) {\n    return result;\n  }\n\n  g.nodes().forEach(function(v) {\n    pq.add(v, Number.POSITIVE_INFINITY);\n    result.setNode(v);\n  });\n\n  // Start from an arbitrary node\n  pq.decrease(g.nodes()[0], 0);\n\n  var init = false;\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    if (Object.hasOwn(parents, v)) {\n      result.setEdge(v, parents[v]);\n    } else if (init) {\n      throw new Error(\"Input graph is not connected: \" + g);\n    } else {\n      init = true;\n    }\n\n    g.nodeEdges(v).forEach(updateNeighbors);\n  }\n\n  return result;\n}\n","module.exports = {\n  components: require(\"./components\"),\n  dijkstra: require(\"./dijkstra\"),\n  dijkstraAll: require(\"./dijkstra-all\"),\n  findCycles: require(\"./find-cycles\"),\n  floydWarshall: require(\"./floyd-warshall\"),\n  isAcyclic: require(\"./is-acyclic\"),\n  postorder: require(\"./postorder\"),\n  preorder: require(\"./preorder\"),\n  prim: require(\"./prim\"),\n  tarjan: require(\"./tarjan\"),\n  topsort: require(\"./topsort\")\n};\n","/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n  Graph: lib.Graph,\n  json: require(\"./lib/json\"),\n  alg: require(\"./lib/alg\"),\n  version: lib.version\n};\n","/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nclass List {\n  constructor() {\n    let sentinel = {};\n    sentinel._next = sentinel._prev = sentinel;\n    this._sentinel = sentinel;\n  }\n\n  dequeue() {\n    let sentinel = this._sentinel;\n    let entry = sentinel._prev;\n    if (entry !== sentinel) {\n      unlink(entry);\n      return entry;\n    }\n  }\n\n  enqueue(entry) {\n    let sentinel = this._sentinel;\n    if (entry._prev && entry._next) {\n      unlink(entry);\n    }\n    entry._next = sentinel._next;\n    sentinel._next._prev = entry;\n    sentinel._next = entry;\n    entry._prev = sentinel;\n  }\n\n  toString() {\n    let strs = [];\n    let sentinel = this._sentinel;\n    let curr = sentinel._prev;\n    while (curr !== sentinel) {\n      strs.push(JSON.stringify(curr, filterOutLinks));\n      curr = curr._prev;\n    }\n    return \"[\" + strs.join(\", \") + \"]\";\n  }\n}\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n\nmodule.exports = List;\n","let Graph = require(\"@dagrejs/graphlib\").Graph;\nlet List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nlet DEFAULT_WEIGHT_FN = () => 1;\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  let state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  let results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return results.flatMap(e => g.outEdges(e.v, e.w));\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  let results = [];\n  let sources = buckets[buckets.length - 1];\n  let sinks = buckets[0];\n\n  let entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (let i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  let results = collectPredecessors ? [] : undefined;\n\n  g.inEdges(entry.v).forEach(edge => {\n    let weight = g.edge(edge);\n    let uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  g.outEdges(entry.v).forEach(edge => {\n    let weight = g.edge(edge);\n    let w = edge.w;\n    let wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  let fasGraph = new Graph();\n  let maxIn = 0;\n  let maxOut = 0;\n\n  g.nodes().forEach(v => {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  g.edges().forEach(e => {\n    let prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    let weight = weightFn(e);\n    let edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  let buckets = range(maxOut + maxIn + 3).map(() => new List());\n  let zeroIdx = maxIn + 1;\n\n  fasGraph.nodes().forEach(v => {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n\nfunction range(limit) {\n  const range = [];\n  for (let i = 0; i < limit; i++) {\n    range.push(i);\n  }\n\n  return range;\n}\n","/* eslint \"no-console\": off */\n\n\"use strict\";\n\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = {\n  addBorderNode,\n  addDummyNode,\n  applyWithChunking,\n  asNonCompoundGraph,\n  buildLayerMatrix,\n  intersectRect,\n  mapValues,\n  maxRank,\n  normalizeRanks,\n  notime,\n  partition,\n  pick,\n  predecessorWeights,\n  range,\n  removeEmptyRanks,\n  simplify,\n  successorWeights,\n  time,\n  uniqueId,\n  zipObject,\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v = name;\n  while (g.hasNode(v)) {\n    v = uniqueId(name);\n  }\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  let simplified = new Graph().setGraph(g.graph());\n  g.nodes().forEach(v => simplified.setNode(v, g.node(v)));\n  g.edges().forEach(e => {\n    let simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    let label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  let simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  g.nodes().forEach(v => {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  g.edges().forEach(e => {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  let weightMap = g.nodes().map(v => {\n    let sucs = {};\n    g.outEdges(v).forEach(e => {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  let weightMap = g.nodes().map(v => {\n    let preds = {};\n    g.inEdges(v).forEach(e => {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  let x = rect.x;\n  let y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  let dx = point.x - x;\n  let dy = point.y - y;\n  let w = rect.width / 2;\n  let h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  let sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  let layering = range(maxRank(g) + 1).map(() => []);\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    let rank = node.rank;\n    if (rank !== undefined) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  let nodeRanks = g.nodes().map(v => {\n    let rank = g.node(v).rank;\n    if (rank === undefined) {\n      return Number.MAX_VALUE;\n    }\n\n    return rank;\n  });\n  let min = applyWithChunking(Math.min, nodeRanks);\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (Object.hasOwn(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  let nodeRanks = g.nodes().map(v => g.node(v).rank);\n  let offset = applyWithChunking(Math.min, nodeRanks);\n\n  let layers = [];\n  g.nodes().forEach(v => {\n    let rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  let delta = 0;\n  let nodeRankFactor = g.graph().nodeRankFactor;\n  Array.from(layers).forEach((vs, i) => {\n    if (vs === undefined && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (vs !== undefined && delta) {\n      vs.forEach(v => g.node(v).rank += delta);\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  let node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction splitToChunks(array, chunkSize = CHUNKING_THRESHOLD) {\n  const chunks = [];\n  for (let i = 0; i < array.length; i += chunkSize) {\n    const chunk = array.slice(i, i + chunkSize);\n    chunks.push(chunk);\n  }\n  return chunks;\n}\n\nconst CHUNKING_THRESHOLD = 65535;\n\nfunction applyWithChunking(fn, argsArray) {\n  if(argsArray.length > CHUNKING_THRESHOLD) {\n    const chunks = splitToChunks(argsArray);\n    return fn.apply(null, chunks.map(chunk => fn.apply(null, chunk)));\n  } else {\n    return fn.apply(null, argsArray);\n  }\n}\n\nfunction maxRank(g) {\n  const nodes = g.nodes();\n  const nodeRanks = nodes.map(v => {\n    let rank = g.node(v).rank;\n    if (rank === undefined) {\n      return Number.MIN_VALUE;\n    }\n    return rank;\n  });\n\n  return applyWithChunking(Math.max, nodeRanks);\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  let result = { lhs: [], rhs: [] };\n  collection.forEach(value => {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  let start = Date.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (Date.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n\nlet idCounter = 0;\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return prefix + (\"\" + id);\n}\n\nfunction range(start, limit, step = 1) {\n  if (limit == null) {\n    limit = start;\n    start = 0;\n  }\n\n  let endCon = (i) => i < limit;\n  if (step < 0) {\n    endCon = (i) => limit < i;\n  }\n\n  const range = [];\n  for (let i = start; endCon(i); i += step) {\n    range.push(i);\n  }\n\n  return range;\n}\n\nfunction pick(source, keys) {\n  const dest = {};\n  for (const key of keys) {\n    if (source[key] !== undefined) {\n      dest[key] = source[key];\n    }\n  }\n\n  return dest;\n}\n\nfunction mapValues(obj, funcOrProp) {\n  let func = funcOrProp;\n  if (typeof funcOrProp === 'string') {\n    func = (val) => val[funcOrProp];\n  }\n\n  return Object.entries(obj).reduce((acc, [k, v]) => {\n    acc[k] = func(v, k);\n    return acc;\n  }, {});\n}\n\nfunction zipObject(props, values) {\n  return props.reduce((acc, key, i) => {\n    acc[key] = values[i];\n    return acc;\n  }, {});\n}\n","\"use strict\";\n\nlet greedyFAS = require(\"./greedy-fas\");\nlet uniqueId = require(\"./util\").uniqueId;\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  let fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  fas.forEach(e => {\n    let label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return e => {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  let fas = [];\n  let stack = {};\n  let visited = {};\n\n  function dfs(v) {\n    if (Object.hasOwn(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    g.outEdges(v).forEach(e => {\n      if (Object.hasOwn(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  g.nodes().forEach(dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  g.edges().forEach(e => {\n    let label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      let forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n","\"use strict\";\n\nlet util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  g.edges().forEach(edge => normalizeEdge(g, edge));\n}\n\nfunction normalizeEdge(g, e) {\n  let v = e.v;\n  let vRank = g.node(v).rank;\n  let w = e.w;\n  let wRank = g.node(w).rank;\n  let name = e.name;\n  let edgeLabel = g.edge(e);\n  let labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  let dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  g.graph().dummyChains.forEach(v => {\n    let node = g.node(v);\n    let origLabel = node.edgeLabel;\n    let w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === \"edge-label\") {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n","\"use strict\";\n\nconst { applyWithChunking } = require(\"../util\");\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (Object.hasOwn(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    let outEdgesMinLens = g.outEdges(v).map(e => {\n      if (e == null) {\n        return Number.POSITIVE_INFINITY;\n      }\n\n      return dfs(e.w) - g.edge(e).minlen;\n    });\n\n    var rank = applyWithChunking(Math.min, outEdgesMinLens);\n\n    if (rank === Number.POSITIVE_INFINITY) {\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  g.sources().forEach(dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","\"use strict\";\n\nvar Graph = require(\"@dagrejs/graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    g.nodeEdges(v).forEach(e => {\n      var edgeV = e.v,\n        w = (v === edgeV) ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  t.nodes().forEach(dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  const edges = g.edges();\n\n  return edges.reduce((acc, edge) => {\n    let edgeSlack = Number.POSITIVE_INFINITY;\n    if (t.hasNode(edge.v) !== t.hasNode(edge.w)) {\n      edgeSlack = slack(g, edge);\n    }\n\n    if (edgeSlack < acc[0]) {\n      return [edgeSlack, edge];\n    }\n\n    return acc;\n  }, [Number.POSITIVE_INFINITY, null])[1];\n}\n\nfunction shiftRanks(t, g, delta) {\n  t.nodes().forEach(v => g.node(v).rank += delta);\n}\n","\"use strict\";\n\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"@dagrejs/graphlib\").alg.preorder;\nvar postorder = require(\"@dagrejs/graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  initRank(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  vs.forEach(v => assignCutValue(t, g, v));\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  g.nodeEdges(child).forEach(e => {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  tree.neighbors(v).forEach(w => {\n    if (!Object.hasOwn(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return tree.edges().find(e => tree.edge(e).cutvalue < 0);\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = g.edges().filter(edge => {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return candidates.reduce((acc, edge) => {\n    if (slack(g, edge) < slack(g, acc)) {\n      return edge;\n    }\n\n    return acc;\n  });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = t.nodes().find(v => !g.node(v).parent);\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  vs.forEach(v => {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  var ranker = g.graph().ranker;\n  if (ranker instanceof Function) {\n    return ranker(g);\n  }\n\n  switch(g.graph().ranker) {\n  case \"network-simplex\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  case \"none\": break;\n  default: networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n","module.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  let postorderNums = postorder(g);\n\n  g.graph().dummyChains.forEach(v => {\n    let node = g.node(v);\n    let edgeObj = node.edgeObj;\n    let pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    let path = pathData.path;\n    let lca = pathData.lca;\n    let pathIdx = 0;\n    let pathV = path[pathIdx];\n    let ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  let vPath = [];\n  let wPath = [];\n  let low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  let lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  let parent;\n  let lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent &&\n           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  let result = {};\n  let lim = 0;\n\n  function dfs(v) {\n    let low = lim;\n    g.children(v).forEach(dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  g.children().forEach(dfs);\n\n  return result;\n}\n","let util = require(\"./util\");\n\nmodule.exports = {\n  run,\n  cleanup,\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundaries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  let root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  let depths = treeDepths(g);\n  let depthsArr = Object.values(depths);\n  let height = util.applyWithChunking(Math.max, depthsArr) - 1; // Note: depths is an Object not an array\n  let nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  g.edges().forEach(e => g.edge(e).minlen *= nodeSep);\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  let weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  g.children().forEach(child => dfs(g, root, nodeSep, weight, height, depths, child));\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  let children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  let top = util.addBorderNode(g, \"_bt\");\n  let bottom = util.addBorderNode(g, \"_bb\");\n  let label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  children.forEach(child => {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    let childNode = g.node(child);\n    let childTop = childNode.borderTop ? childNode.borderTop : child;\n    let childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    let thisWeight = childNode.borderTop ? weight : 2 * weight;\n    let minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      children.forEach(child => dfs(child, depth + 1));\n    }\n    depths[v] = depth;\n  }\n  g.children().forEach(v => dfs(v, 1));\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return g.edges().reduce((acc, e) => acc + g.edge(e).weight, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  g.edges().forEach(e => {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n","let util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    let children = g.children(v);\n    let node = g.node(v);\n    if (children.length) {\n      children.forEach(dfs);\n    }\n\n    if (Object.hasOwn(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (let rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  g.children().forEach(dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  let label = { width: 0, height: 0, rank: rank, borderType: prop };\n  let prev = sgNode[prop][rank - 1];\n  let curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n","\"use strict\";\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  let rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  let rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  g.nodes().forEach(v => swapWidthHeightOne(g.node(v)));\n  g.edges().forEach(e => swapWidthHeightOne(g.edge(e)));\n}\n\nfunction swapWidthHeightOne(attrs) {\n  let w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  g.nodes().forEach(v => reverseYOne(g.node(v)));\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(reverseYOne);\n    if (Object.hasOwn(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  g.nodes().forEach(v => swapXYOne(g.node(v)));\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(swapXYOne);\n    if (Object.hasOwn(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  let x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n","\"use strict\";\n\nlet util = require(\"../util\");\n\nmodule.exports = initOrder;\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  let visited = {};\n  let simpleNodes = g.nodes().filter(v => !g.children(v).length);\n  let simpleNodesRanks = simpleNodes.map(v => g.node(v).rank);\n  let maxRank = util.applyWithChunking(Math.max, simpleNodesRanks);\n  let layers = util.range(maxRank + 1).map(() => []);\n\n  function dfs(v) {\n    if (visited[v]) return;\n    visited[v] = true;\n    let node = g.node(v);\n    layers[node.rank].push(v);\n    g.successors(v).forEach(dfs);\n  }\n\n  let orderedVs = simpleNodes.sort((a, b) => g.node(a).rank - g.node(b).rank);\n  orderedVs.forEach(dfs);\n\n  return layers;\n}\n","\"use strict\";\n\nlet zipObject = require(\"../util\").zipObject;\n\nmodule.exports = crossCount;\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  let cc = 0;\n  for (let i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  let southPos = zipObject(southLayer, southLayer.map((v, i) => i));\n  let southEntries = northLayer.flatMap(v => {\n    return g.outEdges(v).map(e => {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }).sort((a, b) => a.pos - b.pos);\n  });\n\n  // Build the accumulator tree\n  let firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  let treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  let tree = new Array(treeSize).fill(0);\n\n  // Calculate the weighted crossings\n  let cc = 0;\n  southEntries.forEach(entry => {\n    let index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    let weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  });\n\n  return cc;\n}\n","module.exports = barycenter;\n\nfunction barycenter(g, movable = []) {\n  return movable.map(v => {\n    let inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      let result = inV.reduce((acc, e) => {\n        let edge = g.edge(e),\n          nodeU = g.node(e.v);\n        return {\n          sum: acc.sum + (edge.weight * nodeU.order),\n          weight: acc.weight + edge.weight\n        };\n      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n","\"use strict\";\n\nlet util = require(\"../util\");\n\nmodule.exports = resolveConflicts;\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  let mappedEntries = {};\n  entries.forEach((entry, i) => {\n    let tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (entry.barycenter !== undefined) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  cg.edges().forEach(e => {\n    let entryV = mappedEntries[e.v];\n    let entryW = mappedEntries[e.w];\n    if (entryV !== undefined && entryW !== undefined) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  let sourceSet = Object.values(mappedEntries).filter(entry => !entry.indegree);\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  let entries = [];\n\n  function handleIn(vEntry) {\n    return uEntry => {\n      if (uEntry.merged) {\n        return;\n      }\n      if (uEntry.barycenter === undefined ||\n          vEntry.barycenter === undefined ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return wEntry => {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    let entry = sourceSet.pop();\n    entries.push(entry);\n    entry[\"in\"].reverse().forEach(handleIn(entry));\n    entry.out.forEach(handleOut(entry));\n  }\n\n  return entries.filter(entry => !entry.merged).map(entry => {\n    return util.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n  });\n}\n\nfunction mergeEntries(target, source) {\n  let sum = 0;\n  let weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n","let util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  let parts = util.partition(entries, entry => {\n    return Object.hasOwn(entry, \"barycenter\");\n  });\n  let sortable = parts.lhs,\n    unsortable = parts.rhs.sort((a, b) => b.i - a.i),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  sortable.forEach(entry => {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  let result = { vs: vs.flat(true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  let last;\n  while (unsortable.length && (last = unsortable[unsortable.length - 1]).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return (entryV, entryW) => {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n","let barycenter = require(\"./barycenter\");\nlet resolveConflicts = require(\"./resolve-conflicts\");\nlet sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  let movable = g.children(v);\n  let node = g.node(v);\n  let bl = node ? node.borderLeft : undefined;\n  let br = node ? node.borderRight: undefined;\n  let subgraphs = {};\n\n  if (bl) {\n    movable = movable.filter(w => w !== bl && w !== br);\n  }\n\n  let barycenters = barycenter(g, movable);\n  barycenters.forEach(entry => {\n    if (g.children(entry.v).length) {\n      let subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (Object.hasOwn(subgraphResult, \"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  let entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  let result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = [bl, result.vs, br].flat(true);\n    if (g.predecessors(bl).length) {\n      let blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!Object.hasOwn(result, \"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  entries.forEach(entry => {\n    entry.vs = entry.vs.flatMap(v => {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    });\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (target.barycenter !== undefined) {\n    target.barycenter = (target.barycenter * target.weight +\n                         other.barycenter * other.weight) /\n                        (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n","let Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\nmodule.exports = buildLayerGraph;\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *    5. If `nodesWithRank` is not undefined, it must contains only the nodes\n *       which belong to `g` and belong to `rank`.\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship, nodesWithRank) {\n  if (!nodesWithRank) {\n    nodesWithRank = g.nodes();\n  }\n  let root = createRootNode(g),\n    result = new Graph({ compound: true })\n      .setGraph({ root: root })\n      .setDefaultNodeLabel((v) => g.node(v));\n\n  nodesWithRank.forEach((v) => {\n    let node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      g[relationship](v).forEach(e => {\n        let u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = edge !== undefined ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (Object.hasOwn(node, \"minRank\")) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank]\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = util.uniqueId(\"_root\"))));\n  return v;\n}\n","module.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  let prev = {},\n    rootPrev;\n\n  vs.forEach(v => {\n    let child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      children.forEach(function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.sortBy(subgraphs, \"order\").reduce(function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n","\"use strict\";\n\nlet initOrder = require(\"./init-order\");\nlet crossCount = require(\"./cross-count\");\nlet sortSubgraph = require(\"./sort-subgraph\");\nlet buildLayerGraph = require(\"./build-layer-graph\");\nlet addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\nmodule.exports = order;\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g, opts) {\n  if (opts && typeof opts.customOrder === 'function') {\n    opts.customOrder(g, order);\n    return;\n  }\n\n  let maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, util.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, util.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  let layering = initOrder(g);\n  assignOrder(g, layering);\n\n  if (opts && opts.disableOptimalOrderHeuristic) {\n    return;\n  }\n\n  let bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    let cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = Object.assign({}, layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  // Build an index mapping from rank to the nodes with that rank.\n  // This helps to avoid a quadratic search for all nodes with the same rank as\n  // the current node.\n  const nodesByRank = new Map();\n  const addNodeToRank = (rank, node) => {\n    if (!nodesByRank.has(rank)) {\n      nodesByRank.set(rank, []);\n    }\n    nodesByRank.get(rank).push(node);\n  };\n\n  // Visit the nodes in their original order in the graph, and add each\n  // node to the ranks(s) that it belongs to.\n  for (const v of g.nodes()) {\n    const node = g.node(v);\n    if (typeof node.rank === \"number\") {\n      addNodeToRank(node.rank, v);\n    }\n    // If there is a range of ranks, add it to each, but skip the `node.rank` which\n    // has already had the node added.\n    if (typeof node.minRank === \"number\" && typeof node.maxRank === \"number\") {\n      for (let r = node.minRank; r <= node.maxRank; r++) {\n        if (r !== node.rank) {\n          // Don't add this node to its `node.rank` twice.\n          addNodeToRank(r, v);\n        }\n      }\n    }\n  }\n\n  return ranks.map(function (rank) {\n    return buildLayerGraph(g, rank, relationship, nodesByRank.get(rank) || []);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  let cg = new Graph();\n  layerGraphs.forEach(function(lg) {\n    let root = lg.graph().root;\n    let sorted = sortSubgraph(lg, root, cg, biasRight);\n    sorted.vs.forEach((v, i) => lg.node(v).order = i);\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  Object.values(layering).forEach(layer => layer.forEach((v, i) => g.node(v).order = i));\n}\n","\"use strict\";\n\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: balance\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  let conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    let\n      // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = layer[layer.length - 1];\n\n    layer.forEach((v, i) => {\n      let w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        layer.slice(scanPos, i+1).forEach(scanNode => {\n          g.predecessors(scanNode).forEach(u => {\n            let uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  layering.length && layering.reduce(visitLayer);\n\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  let conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    let v;\n    util.range(southPos, southEnd).forEach(i => {\n      v = south[i];\n      if (g.node(v).dummy) {\n        g.predecessors(v).forEach(u => {\n          let uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    let prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    south.forEach((v, southLookahead) => {\n      if (g.node(v).dummy === \"border\") {\n        let predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  layering.length && layering.reduce(visitLayer);\n\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return g.predecessors(v).find(u => g.node(u).dummy);\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    let tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  let conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    let tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return !!conflicts[v] && Object.hasOwn(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  let root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  layering.forEach(layer => {\n    layer.forEach((v, order) => {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  layering.forEach(layer => {\n    let prevIdx = -1;\n    layer.forEach(v => {\n      let ws = neighborFn(v);\n      if (ws.length) {\n        ws = ws.sort((a, b) => pos[a] - pos[b]);\n        let mp = (ws.length - 1) / 2;\n        for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          let w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  let xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    let stack = blockG.nodes();\n    let elem = stack.pop();\n    let visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce((acc, e) => {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    let min = blockG.outEdges(elem).reduce((acc, e) => {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    let node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  Object.keys(align).forEach(v => xs[v] = xs[root[v]]);\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  let blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  layering.forEach(layer => {\n    let u;\n    layer.forEach(v => {\n      let vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return Object.values(xss).reduce((currentMinAndXs, xs) => {\n    let max = Number.NEGATIVE_INFINITY;\n    let min = Number.POSITIVE_INFINITY;\n\n    Object.entries(xs).forEach(([v, x]) => {\n      let halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    const newMin = max - min;\n    if (newMin < currentMinAndXs[0]) {\n      currentMinAndXs = [newMin, xs];\n    }\n    return currentMinAndXs;\n  }, [Number.POSITIVE_INFINITY, null])[1];\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  let alignToVals = Object.values(alignTo),\n    alignToMin = util.applyWithChunking(Math.min, alignToVals),\n    alignToMax = util.applyWithChunking(Math.max, alignToVals);\n\n  [\"u\", \"d\"].forEach(vert => {\n    [\"l\", \"r\"].forEach(horiz => {\n      let alignment = vert + horiz,\n        xs = xss[alignment];\n\n      if (xs === alignTo) return;\n\n      let xsVals = Object.values(xs);\n      let delta = alignToMin - util.applyWithChunking(Math.min, xsVals);\n      if (horiz !== \"l\") {\n        delta = alignToMax - util.applyWithChunking(Math.max,xsVals);\n      }\n\n      if (delta) {\n        xss[alignment] = util.mapValues(xs, x => x + delta);\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return util.mapValues(xss.ul, (num, v) => {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      let xs = Object.values(xss).map(xs => xs[v]).sort((a, b) => a - b);\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  let layering = util.buildLayerMatrix(g);\n  let conflicts = Object.assign(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  let xss = {};\n  let adjustedLayering;\n  [\"u\", \"d\"].forEach(vert => {\n    adjustedLayering = vert === \"u\" ? layering : Object.values(layering).reverse();\n    [\"l\", \"r\"].forEach(horiz => {\n      if (horiz === \"r\") {\n        adjustedLayering = adjustedLayering.map(inner => {\n          return Object.values(inner).reverse();\n        });\n      }\n\n      let neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      let align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      let xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = util.mapValues(xs, x => -x);\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n\n  let smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return (g, v, w) => {\n    let vLabel = g.node(v);\n    let wLabel = g.node(w);\n    let sum = 0;\n    let delta;\n\n    sum += vLabel.width / 2;\n    if (Object.hasOwn(vLabel, \"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (Object.hasOwn(wLabel, \"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n","\"use strict\";\n\nlet util = require(\"../util\");\nlet positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  Object.entries(positionX(g)).forEach(([v, x]) => g.node(v).x = x);\n}\n\nfunction positionY(g) {\n  let layering = util.buildLayerMatrix(g);\n  let rankSep = g.graph().ranksep;\n  let prevY = 0;\n  layering.forEach(layer => {\n    const maxHeight = layer.reduce((acc, v) => {\n      const height = g.node(v).height;\n      if (acc > height) {\n        return acc;\n      } else {\n        return height;\n      }\n    }, 0);\n    layer.forEach(v => g.node(v).y = prevY + maxHeight / 2);\n    prevY += maxHeight + rankSep;\n  });\n}\n\n","\"use strict\";\n\nlet acyclic = require(\"./acyclic\");\nlet normalize = require(\"./normalize\");\nlet rank = require(\"./rank\");\nlet normalizeRanks = require(\"./util\").normalizeRanks;\nlet parentDummyChains = require(\"./parent-dummy-chains\");\nlet removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nlet nestingGraph = require(\"./nesting-graph\");\nlet addBorderSegments = require(\"./add-border-segments\");\nlet coordinateSystem = require(\"./coordinate-system\");\nlet order = require(\"./order\");\nlet position = require(\"./position\");\nlet util = require(\"./util\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  let time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", () => {\n    let layoutGraph =\n      time(\"  buildLayoutGraph\", () => buildLayoutGraph(g));\n    time(\"  runLayout\",        () => runLayout(layoutGraph, time, opts));\n    time(\"  updateInputGraph\", () => updateInputGraph(g, layoutGraph));\n  });\n}\n\nfunction runLayout(g, time, opts) {\n  time(\"    makeSpaceForEdgeLabels\", () => makeSpaceForEdgeLabels(g));\n  time(\"    removeSelfEdges\",        () => removeSelfEdges(g));\n  time(\"    acyclic\",                () => acyclic.run(g));\n  time(\"    nestingGraph.run\",       () => nestingGraph.run(g));\n  time(\"    rank\",                   () => rank(util.asNonCompoundGraph(g)));\n  time(\"    injectEdgeLabelProxies\", () => injectEdgeLabelProxies(g));\n  time(\"    removeEmptyRanks\",       () => removeEmptyRanks(g));\n  time(\"    nestingGraph.cleanup\",   () => nestingGraph.cleanup(g));\n  time(\"    normalizeRanks\",         () => normalizeRanks(g));\n  time(\"    assignRankMinMax\",       () => assignRankMinMax(g));\n  time(\"    removeEdgeLabelProxies\", () => removeEdgeLabelProxies(g));\n  time(\"    normalize.run\",          () => normalize.run(g));\n  time(\"    parentDummyChains\",      () => parentDummyChains(g));\n  time(\"    addBorderSegments\",      () => addBorderSegments(g));\n  time(\"    order\",                  () => order(g, opts));\n  time(\"    insertSelfEdges\",        () => insertSelfEdges(g));\n  time(\"    adjustCoordinateSystem\", () => coordinateSystem.adjust(g));\n  time(\"    position\",               () => position(g));\n  time(\"    positionSelfEdges\",      () => positionSelfEdges(g));\n  time(\"    removeBorderNodes\",      () => removeBorderNodes(g));\n  time(\"    normalize.undo\",         () => normalize.undo(g));\n  time(\"    fixupEdgeLabelCoords\",   () => fixupEdgeLabelCoords(g));\n  time(\"    undoCoordinateSystem\",   () => coordinateSystem.undo(g));\n  time(\"    translateGraph\",         () => translateGraph(g));\n  time(\"    assignNodeIntersects\",   () => assignNodeIntersects(g));\n  time(\"    reversePoints\",          () => reversePointsForReversedEdges(g));\n  time(\"    acyclic.undo\",           () => acyclic.undo(g));\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  inputGraph.nodes().forEach(v => {\n    let inputLabel = inputGraph.node(v);\n    let layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n      inputLabel.rank = layoutLabel.rank;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  inputGraph.edges().forEach(e => {\n    let inputLabel = inputGraph.edge(e);\n    let layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (Object.hasOwn(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nlet graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nlet graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nlet graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nlet nodeNumAttrs = [\"width\", \"height\", \"rank\"];\nlet nodeDefaults = { width: 0, height: 0 };\nlet edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nlet edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nlet edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  let g = new Graph({ multigraph: true, compound: true });\n  let graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(Object.assign({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    util.pick(graph, graphAttrs)));\n\n  inputGraph.nodes().forEach(v => {\n    let node = canonicalize(inputGraph.node(v));\n    const newNode = selectNumberAttrs(node, nodeNumAttrs);\n    Object.keys(nodeDefaults).forEach(k => {\n      if (newNode[k] === undefined) {\n        newNode[k] = nodeDefaults[k];\n      }\n    });\n\n    g.setNode(v, newNode);\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  inputGraph.edges().forEach(e => {\n    let edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, Object.assign({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      util.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  let graph = g.graph();\n  graph.ranksep /= 2;\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.width && edge.height) {\n      let v = g.node(e.v);\n      let w = g.node(e.w);\n      let label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  let maxRank = 0;\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = Math.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  let minX = Number.POSITIVE_INFINITY;\n  let maxX = 0;\n  let minY = Number.POSITIVE_INFINITY;\n  let maxY = 0;\n  let graphLabel = g.graph();\n  let marginX = graphLabel.marginx || 0;\n  let marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    let x = attrs.x;\n    let y = attrs.y;\n    let w = attrs.width;\n    let h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  g.nodes().forEach(v => getExtremes(g.node(v)));\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (Object.hasOwn(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(p => {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (Object.hasOwn(edge, \"x\")) { edge.x -= minX; }\n    if (Object.hasOwn(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    let nodeV = g.node(e.v);\n    let nodeW = g.node(e.w);\n    let p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (Object.hasOwn(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  g.nodes().forEach(v => {\n    if (g.children(v).length) {\n      let node = g.node(v);\n      let t = g.node(node.borderTop);\n      let b = g.node(node.borderBottom);\n      let l = g.node(node.borderLeft[node.borderLeft.length - 1]);\n      let r = g.node(node.borderRight[node.borderRight.length - 1]);\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  g.nodes().forEach(v => {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  g.edges().forEach(e => {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  layers.forEach(layer => {\n    var orderShift = 0;\n    layer.forEach((v, i) => {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      (node.selfEdges || []).forEach(selfEdge => {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  g.nodes().forEach(v => {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return util.mapValues(util.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  if (attrs) {\n    Object.entries(attrs).forEach(([k, v]) => {\n      if (typeof k === \"string\") {\n        k = k.toLowerCase();\n      }\n\n      newAttrs[k] = v;\n    });\n  }\n  return newAttrs;\n}\n","let util = require(\"./util\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  let layerMatrix = util.buildLayerMatrix(g);\n\n  let h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  g.nodes().forEach(v => {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  g.edges().forEach(e => h.setEdge(e.v, e.w, {}, e.name));\n\n  layerMatrix.forEach((layer, i) => {\n    let layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    layer.reduce((u, v) => {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n","module.exports = \"1.1.8\";\n","/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"@dagrejs/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n","import type { ParseDiagnostic } from './types';\n\nexport const errorMessages = {\n  unknownOperator: (op: string) =>\n    `Unknown operator \"${op}\". Expected ->, >>, p>, g>, t>, or c>.`,\n\n  unclosedParen: () =>\n    `Unclosed parenthesis in port name.`,\n\n  missingPort: (side: 'source' | 'target') =>\n    `Missing port name on ${side} side of connection.`,\n\n  duplicateModule: (name: string) =>\n    `Module \"${name}\" declared more than once.`,\n\n  didYouMean: (got: string, suggestion: string) =>\n    `Module \"${got}\" is not declared. Did you mean \"${suggestion}\"?`,\n\n  syntaxError: (detail: string) =>\n    `Syntax error: ${detail}`,\n\n  emptyDiagram: () =>\n    `Diagram is empty — no connections found.`,\n\n  ambiguousPortDirection: (port: string, module: string) =>\n    `Port \"${port}\" on module \"${module}\" is used as both input and output. Use distinct names like \"In ${port}\"/\"Out ${port}\" to disambiguate.`,\n};\n\nexport function formatDiagnostic(diag: ParseDiagnostic, sourceLine: string): string {\n  const prefix = `Line ${diag.line}, col ${diag.column}: ${diag.message}`;\n  const caret = ' '.repeat(diag.column - 1) + '^'.repeat(diag.length);\n  return `${prefix}\\n  ${sourceLine}\\n  ${caret}`;\n}\n\nexport function editDistance(a: string, b: string): number {\n  const la = a.length;\n  const lb = b.length;\n  const dp: number[][] = Array.from({ length: la + 1 }, () => Array(lb + 1).fill(0));\n  for (let i = 0; i <= la; i++) dp[i][0] = i;\n  for (let j = 0; j <= lb; j++) dp[0][j] = j;\n  for (let i = 1; i <= la; i++) {\n    for (let j = 1; j <= lb; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n      dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);\n    }\n  }\n  return dp[la][lb];\n}\n\nexport function sanitizeForSvg(str: string): string {\n  return str\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n    .replace(/'/g, '&#39;');\n}\n","import type {\n  ParseResult,\n  PatchGraph,\n  Block,\n  Connection,\n  Param,\n  ParseDiagnostic,\n  SignalType,\n} from './types';\nimport { SIGNAL_OPERATORS } from './types';\nimport { errorMessages, editDistance } from './errors';\n\n// ── Helpers ──\n\nfunction normalize(str: string): string {\n  return str.trim().toLowerCase().replace(/\\s+/g, '-');\n}\n\nfunction makeBlockId(module: string, section: string): string {\n  return `${normalize(module)}--${normalize(section)}`;\n}\n\nfunction parseGraphvizExtras(str: string): Record<string, string> {\n  const result: Record<string, string> = {};\n  // str is content inside [], e.g. \"color=red, weight=3\"\n  const parts = str.split(',');\n  for (const part of parts) {\n    const eqIdx = part.indexOf('=');\n    if (eqIdx !== -1) {\n      const key = part.slice(0, eqIdx).trim();\n      const value = part.slice(eqIdx + 1).trim();\n      result[key] = value;\n    }\n  }\n  return result;\n}\n\nfunction parseEndpoint(raw: string): { module: string; section: string | null; port: string } | null {\n  const trimmed = raw.trim();\n\n  // Find port in parentheses\n  const openParen = trimmed.lastIndexOf('(');\n  const closeParen = trimmed.lastIndexOf(')');\n  if (openParen === -1 || closeParen === -1 || closeParen < openParen) {\n    return null;\n  }\n\n  const port = trimmed.slice(openParen + 1, closeParen);\n  const before = trimmed.slice(0, openParen).trim();\n\n  // Check for dot notation\n  const dotIdx = before.indexOf('.');\n  if (dotIdx !== -1) {\n    const module = before.slice(0, dotIdx).trim();\n    const section = before.slice(dotIdx + 1).trim();\n    return { module, section, port };\n  }\n\n  return { module: before, section: null, port };\n}\n\n// Sort operators longest first to avoid substring collisions\nconst SORTED_OPERATORS = Object.keys(SIGNAL_OPERATORS).sort((a, b) => b.length - a.length);\n\nfunction findOperator(line: string): { operator: string; index: number } | null {\n  for (const op of SORTED_OPERATORS) {\n    const idx = line.indexOf(op);\n    if (idx !== -1) {\n      return { operator: op, index: idx };\n    }\n  }\n  return null;\n}\n\n// ── Main Parser ──\n\nexport function parse(input: string): ParseResult {\n  const errors: ParseDiagnostic[] = [];\n  const warnings: ParseDiagnostic[] = [];\n\n  // Normalize line endings\n  const normalized = input.replace(/\\r\\n/g, '\\n');\n  const lines = normalized.split('\\n');\n\n  const declaredModules: Map<string, Block> = new Map(); // lowercase name -> Block\n  const allBlocks: Map<string, Block> = new Map(); // blockId -> Block\n  const connections: Connection[] = [];\n\n  let currentModuleName: string | null = null;\n  let currentVoice: string | null = null;\n  const voices: string[] = [];\n  let lastParam: Param | null = null;\n  let connectionCounter = 0;\n\n  for (let lineIdx = 0; lineIdx < lines.length; lineIdx++) {\n    const line = lines[lineIdx];\n    const lineNum = lineIdx + 1;\n\n    // Blank lines\n    if (line.trim() === '') continue;\n\n    // Version header\n    if (line.startsWith('# patchflow')) continue;\n\n    // Comments\n    if (line.trim().startsWith('//')) continue;\n\n    // Connection lines\n    if (line.trimStart().startsWith('- ')) {\n      lastParam = null;\n      const connLine = line.trimStart().slice(2); // strip \"- \"\n\n      // Extract annotation (trailing // comment)\n      let annotation: string | null = null;\n      let workLine = connLine;\n      const annotationIdx = workLine.indexOf(' // ');\n      if (annotationIdx !== -1) {\n        annotation = workLine.slice(annotationIdx + 4).trim();\n        workLine = workLine.slice(0, annotationIdx);\n      }\n\n      // Extract graphviz extras [key=val, ...]\n      let graphvizExtras: Record<string, string> | null = null;\n      const bracketOpen = workLine.lastIndexOf('[');\n      const bracketClose = workLine.lastIndexOf(']');\n      if (bracketOpen !== -1 && bracketClose !== -1 && bracketClose > bracketOpen) {\n        const extrasStr = workLine.slice(bracketOpen + 1, bracketClose);\n        graphvizExtras = parseGraphvizExtras(extrasStr);\n        workLine = workLine.slice(0, bracketOpen).trim();\n      }\n\n      // Find operator\n      const opResult = findOperator(workLine);\n      if (!opResult) {\n        errors.push({\n          code: 'SYNTAX_ERROR',\n          message: errorMessages.syntaxError('no valid operator found'),\n          line: lineNum,\n          column: 1,\n          length: line.length,\n          severity: 'error',\n        });\n        continue;\n      }\n\n      const { operator, index: opIdx } = opResult;\n      const signalType = SIGNAL_OPERATORS[operator];\n      const sourcePart = workLine.slice(0, opIdx).trim();\n      const targetPart = workLine.slice(opIdx + operator.length).trim();\n\n      // Parse endpoints\n      const sourceEndpoint = parseEndpoint(sourcePart);\n      const targetEndpoint = parseEndpoint(targetPart);\n\n      if (!sourceEndpoint) {\n        errors.push({\n          code: 'MISSING_PORT',\n          message: errorMessages.missingPort('source'),\n          line: lineNum,\n          column: 1,\n          length: line.length,\n          severity: 'error',\n        });\n        continue;\n      }\n\n      if (!targetEndpoint) {\n        errors.push({\n          code: 'MISSING_PORT',\n          message: errorMessages.missingPort('target'),\n          line: lineNum,\n          column: 1,\n          length: line.length,\n          severity: 'error',\n        });\n        continue;\n      }\n\n      // Resolve blocks for source and target\n      const sourceBlock = resolveBlock(sourceEndpoint, currentVoice);\n      const targetBlock = resolveBlock(targetEndpoint, currentVoice);\n\n      // Ensure ports exist on blocks\n      ensurePort(sourceBlock, sourceEndpoint.port, 'out');\n      ensurePort(targetBlock, targetEndpoint.port, 'in');\n\n      const conn: Connection = {\n        id: `conn-${connectionCounter++}`,\n        source: {\n          blockId: sourceBlock.id,\n          portId: sourceEndpoint.port.trim().toLowerCase(),\n          portDisplay: sourceEndpoint.port.trim(),\n        },\n        target: {\n          blockId: targetBlock.id,\n          portId: targetEndpoint.port.trim().toLowerCase(),\n          portDisplay: targetEndpoint.port.trim(),\n        },\n        signalType,\n        annotation,\n        graphvizExtras,\n      };\n\n      connections.push(conn);\n      continue;\n    }\n\n    // Multiline params\n    if (line.trimStart().startsWith('|')) {\n      if (lastParam) {\n        const value = line.trimStart().slice(1).trim();\n        lastParam.value += '; ' + value;\n      }\n      continue;\n    }\n\n    // Parameters\n    if (line.trimStart().startsWith('*')) {\n      const paramContent = line.trimStart().slice(1).trim();\n      const colonIdx = paramContent.indexOf(':');\n      let key: string;\n      let value: string;\n      if (colonIdx !== -1) {\n        key = paramContent.slice(0, colonIdx).trim();\n        value = paramContent.slice(colonIdx + 1).trim();\n      } else {\n        key = paramContent;\n        value = '';\n      }\n\n      const param: Param = { key, value };\n      lastParam = param;\n\n      // Add to current module\n      if (currentModuleName) {\n        const lowerName = currentModuleName.toLowerCase();\n        const block = declaredModules.get(lowerName);\n        if (block) {\n          block.params.push(param);\n        }\n      }\n      continue;\n    }\n\n    // Module/Voice declarations (lines ending with :)\n    if (line.trim().endsWith(':') && !line.trim().startsWith('-') && !line.trim().startsWith('*') && !line.trim().startsWith('|')) {\n      lastParam = null;\n      const rawDecl = line.trim().slice(0, -1).trim();\n\n      // Parse optional variant in brackets: \"MODULE [Variant]\"\n      let moduleName = rawDecl;\n      let variant: string | null = null;\n      const variantMatch = rawDecl.match(/^(.+?)\\s*\\[(.+?)\\]\\s*$/);\n      if (variantMatch) {\n        moduleName = variantMatch[1].trim();\n        variant = variantMatch[2].trim();\n      }\n\n      // Voice declaration: \"VOICE <something>\" — tag subsequent items, don't create a block\n      if (/^voice\\s+/i.test(moduleName)) {\n        currentVoice = moduleName;\n        currentModuleName = null;\n        if (!voices.includes(moduleName)) {\n          voices.push(moduleName);\n        }\n        continue;\n      }\n\n      // Module declaration\n      currentModuleName = moduleName;\n\n      const lowerName = moduleName.toLowerCase();\n      if (!declaredModules.has(lowerName)) {\n        const block: Block = {\n          id: normalize(moduleName),\n          label: moduleName,\n          subLabel: variant,\n          params: [],\n          ports: [],\n          parentModule: null,\n          voice: currentVoice,\n        };\n        declaredModules.set(lowerName, block);\n        allBlocks.set(block.id, block);\n      } else if (variant) {\n        // Update subLabel if variant provided on re-declaration\n        const existing = declaredModules.get(lowerName)!;\n        if (!existing.subLabel) existing.subLabel = variant;\n      }\n      continue;\n    }\n\n    // If we get here, it's unrecognized — record an error and skip\n    errors.push({\n      code: 'SYNTAX_ERROR',\n      message: errorMessages.syntaxError('unrecognized line format'),\n      line: lineNum,\n      column: 1,\n      length: line.length,\n      severity: 'error',\n    });\n  }\n\n  // ── Post-processing ──\n\n  // Separate declared vs stub blocks\n  let declaredBlocksList: Block[] = [...declaredModules.values()];\n  const stubBlocks: Block[] = [];\n  for (const [id, block] of allBlocks) {\n    if (![...declaredModules.values()].find(b => b.id === id)) {\n      stubBlocks.push(block);\n    }\n  }\n\n  // ── Parent-module-with-sections post-processing ──\n  // For each declared block, if it has child sections (blocks with parentModule === this.label),\n  // migrate matching params to sections. Remove parent if empty and not directly referenced.\n  const blocksToRemove: Set<string> = new Set();\n  for (const parent of declaredBlocksList) {\n    const parentLabelLower = parent.label.trim().toLowerCase();\n    const childSections: Block[] = [];\n    for (const block of [...declaredBlocksList, ...stubBlocks]) {\n      if (block.parentModule && block.parentModule.trim().toLowerCase() === parentLabelLower) {\n        childSections.push(block);\n      }\n    }\n    if (childSections.length === 0) continue;\n\n    // Migrate matching params\n    const remainingParams: Param[] = [];\n    for (const param of parent.params) {\n      const keyLower = param.key.trim().toLowerCase();\n      const matchingSection = childSections.find(\n        s => s.label.trim().toLowerCase() === keyLower\n      );\n      if (matchingSection) {\n        matchingSection.params.push(param);\n      } else {\n        remainingParams.push(param);\n      }\n    }\n    parent.params = remainingParams;\n\n    // If parent has no remaining params AND is not directly connected, remove it\n    if (remainingParams.length === 0) {\n      const directlyReferenced = connections.some(\n        c => c.source.blockId === parent.id || c.target.blockId === parent.id\n      );\n      if (!directlyReferenced) {\n        blocksToRemove.add(parent.id);\n      }\n    }\n  }\n  if (blocksToRemove.size > 0) {\n    declaredBlocksList = declaredBlocksList.filter(b => !blocksToRemove.has(b.id));\n  }\n\n  // ── Feedback detection ──\n  const { forward, feedback } = detectFeedbackEdges(connections);\n\n  // ── Signal type stats ──\n  const signalTypeStats: Partial<Record<SignalType, number>> = {};\n  for (const conn of [...forward, ...feedback]) {\n    signalTypeStats[conn.signalType] = (signalTypeStats[conn.signalType] || 0) + 1;\n  }\n\n  // ── Edit-distance warnings ──\n  const declaredNames = [...declaredModules.keys()]; // already lowercase\n  for (const stub of stubBlocks) {\n    const stubLower = stub.label.toLowerCase();\n    for (const declName of declaredNames) {\n      const dist = editDistance(stubLower, declName);\n      if (dist > 0 && dist <= 2) {\n        const declBlock = declaredModules.get(declName)!;\n        warnings.push({\n          code: 'UNKNOWN_MODULE',\n          message: errorMessages.didYouMean(stub.label, declBlock.label),\n          line: 0,\n          column: 1,\n          length: stub.label.length,\n          severity: 'warning',\n        });\n        break;\n      }\n    }\n  }\n\n  // ── Ambiguous port direction detection ──\n  // Build map: blockId -> portId -> { asSource: lines[], asTarget: lines[] }\n  type PortUsage = { asSource: number[]; asTarget: number[] };\n  const portUsageMap: Map<string, Map<string, PortUsage>> = new Map();\n\n  const allConns = [...forward, ...feedback];\n  for (const conn of allConns) {\n    // Record source usage\n    const srcBlock = conn.source.blockId;\n    if (!portUsageMap.has(srcBlock)) portUsageMap.set(srcBlock, new Map());\n    const srcPorts = portUsageMap.get(srcBlock)!;\n    if (!srcPorts.has(conn.source.portId)) srcPorts.set(conn.source.portId, { asSource: [], asTarget: [] });\n    srcPorts.get(conn.source.portId)!.asSource.push(0);\n\n    // Record target usage\n    const tgtBlock = conn.target.blockId;\n    if (!portUsageMap.has(tgtBlock)) portUsageMap.set(tgtBlock, new Map());\n    const tgtPorts = portUsageMap.get(tgtBlock)!;\n    if (!tgtPorts.has(conn.target.portId)) tgtPorts.set(conn.target.portId, { asSource: [], asTarget: [] });\n    tgtPorts.get(conn.target.portId)!.asTarget.push(0);\n  }\n\n  for (const [blockId, portMap] of portUsageMap) {\n    for (const [portId, usage] of portMap) {\n      if (usage.asSource.length > 0 && usage.asTarget.length > 0) {\n        // Find the block to get its label and the portDisplay\n        const block = allBlocks.get(blockId);\n        const blockLabel = block ? block.label : blockId;\n        // Find a connection that uses this port to get portDisplay\n        const srcConn = allConns.find(c => c.source.blockId === blockId && c.source.portId === portId);\n        const tgtConn = allConns.find(c => c.target.blockId === blockId && c.target.portId === portId);\n        const portDisplay = srcConn ? srcConn.source.portDisplay : (tgtConn ? tgtConn.target.portDisplay : portId);\n\n        warnings.push({\n          code: 'AMBIGUOUS_PORT_DIRECTION',\n          message: errorMessages.ambiguousPortDirection(portDisplay, blockLabel),\n          line: 0,\n          column: 1,\n          length: 1,\n          severity: 'warning',\n        });\n      }\n    }\n  }\n\n  const graph: PatchGraph = {\n    declaredBlocks: declaredBlocksList,\n    stubBlocks,\n    connections: forward,\n    feedbackEdges: feedback,\n    signalTypeStats,\n    voices,\n  };\n\n  return { graph, errors, warnings };\n\n  // ── Inner helper functions ──\n\n  function resolveBlock(\n    endpoint: { module: string; section: string | null; port: string },\n    voice: string | null\n  ): Block {\n    const { module, section } = endpoint;\n\n    if (section) {\n      // Dot notation: Module.Section\n      const blockId = makeBlockId(module, section);\n      if (allBlocks.has(blockId)) {\n        return allBlocks.get(blockId)!;\n      }\n      const block: Block = {\n        id: blockId,\n        label: section,\n        subLabel: null,\n        params: [],\n        ports: [],\n        parentModule: module,\n        voice,\n      };\n      allBlocks.set(blockId, block);\n      return block;\n    }\n\n    // No section — look up in declared modules first (case-insensitive)\n    const lowerModule = module.toLowerCase();\n    if (declaredModules.has(lowerModule)) {\n      return declaredModules.get(lowerModule)!;\n    }\n\n    // Check if we already have it in allBlocks\n    const blockId = normalize(module);\n    if (allBlocks.has(blockId)) {\n      return allBlocks.get(blockId)!;\n    }\n\n    // Create a new block (will end up as stub)\n    const block: Block = {\n      id: blockId,\n      label: module,\n      subLabel: null,\n      params: [],\n      ports: [],\n      parentModule: null,\n      voice,\n    };\n    allBlocks.set(blockId, block);\n    return block;\n  }\n\n  function ensurePort(block: Block, portName: string, direction: 'in' | 'out'): void {\n    const portId = portName.trim().toLowerCase();\n    const existing = block.ports.find(p => p.id === portId && p.direction === direction);\n    if (!existing) {\n      block.ports.push({\n        id: portId,\n        display: portName.trim(),\n        direction,\n      });\n    }\n  }\n}\n\n// ── Feedback Edge Detection ──\n\nfunction detectFeedbackEdges(connections: Connection[]): {\n  forward: Connection[];\n  feedback: Connection[];\n} {\n  if (connections.length === 0) {\n    return { forward: [], feedback: [] };\n  }\n\n  // Build adjacency list (block-level)\n  const adjacency: Map<string, Set<string>> = new Map();\n  const edgeMap: Map<string, Connection[]> = new Map(); // \"src->tgt\" -> connections\n\n  for (const conn of connections) {\n    const src = conn.source.blockId;\n    const tgt = conn.target.blockId;\n\n    if (!adjacency.has(src)) adjacency.set(src, new Set());\n    adjacency.get(src)!.add(tgt);\n\n    const edgeKey = `${src}->${tgt}`;\n    if (!edgeMap.has(edgeKey)) edgeMap.set(edgeKey, []);\n    edgeMap.get(edgeKey)!.push(conn);\n  }\n\n  // DFS cycle detection\n  const WHITE = 0, GRAY = 1, BLACK = 2;\n  const color: Map<string, number> = new Map();\n  const backEdges: Set<string> = new Set(); // edge keys that form cycles\n\n  // Get all nodes\n  const nodes = new Set<string>();\n  for (const conn of connections) {\n    nodes.add(conn.source.blockId);\n    nodes.add(conn.target.blockId);\n  }\n  for (const node of nodes) {\n    color.set(node, WHITE);\n  }\n\n  function dfs(u: string): void {\n    color.set(u, GRAY);\n    const neighbors = adjacency.get(u) || new Set();\n    for (const v of neighbors) {\n      const c = color.get(v) ?? WHITE;\n      if (c === GRAY) {\n        // Back edge found\n        backEdges.add(`${u}->${v}`);\n      } else if (c === WHITE) {\n        dfs(v);\n      }\n    }\n    color.set(u, BLACK);\n  }\n\n  for (const node of nodes) {\n    if (color.get(node) === WHITE) {\n      dfs(node);\n    }\n  }\n\n  // Partition connections\n  const forward: Connection[] = [];\n  const feedback: Connection[] = [];\n\n  for (const conn of connections) {\n    const edgeKey = `${conn.source.blockId}->${conn.target.blockId}`;\n    if (backEdges.has(edgeKey)) {\n      feedback.push(conn);\n    } else {\n      forward.push(conn);\n    }\n  }\n\n  return { forward, feedback };\n}\n","import dagre from '@dagrejs/dagre';\nimport type {\n  Block,\n  Connection,\n  LayoutBlock,\n  LayoutConnection,\n  LayoutOptions,\n  LayoutPort,\n  LayoutResult,\n  PatchGraph,\n  Point,\n  Port,\n  SignalType,\n} from './types';\nimport { feedbackArcPath, selfLoopArcPath, smoothstepPath } from './edge-routing';\n\n// ── Dimension estimation (no DOM) ──\n\nconst MIN_WIDTH = 140;\nconst MIN_HEIGHT = 90;\n\nfunction getBlockDimensions(block: Block, portCount: number): { width: number; height: number } {\n  const labelWidth = block.label.length * 8;\n  const subLabelWidth = block.subLabel ? block.subLabel.length * 7 : 0;\n  const paramWidths = block.params.map(p => (`${p.key}: ${p.value}`).length * 7);\n  const longestParam = paramWidths.length > 0 ? Math.max(...paramWidths) : 0;\n\n  const width = Math.max(\n    labelWidth + 40,\n    subLabelWidth + 40,\n    longestParam + 30,\n    MIN_WIDTH,\n  );\n\n  const labelArea = 50;\n  const subLabelArea = block.subLabel ? 18 : 0;\n  const paramsArea = 20 * block.params.length;\n  const portsArea = Math.max((portCount / 2) * 24, 30);\n  const padding = 20;\n\n  const height = Math.max(labelArea + subLabelArea + paramsArea + portsArea + padding, MIN_HEIGHT);\n\n  return { width, height };\n}\n\n// ── Port collection ──\n\n/**\n * Collect ports on every block based on all connections (forward + feedback).\n * If a port appears as both in and out, 'out' wins (source).\n */\nfunction collectPorts(\n  blocks: Block[],\n  connections: Connection[],\n): Map<string, Port[]> {\n  // Start from whatever ports each block already has declared.\n  const byBlock = new Map<string, Map<string, Port>>();\n  for (const block of blocks) {\n    const map = new Map<string, Port>();\n    for (const p of block.ports) {\n      // dedupe key ignores direction here; 'out' wins later if conflict\n      const existing = map.get(p.id);\n      if (!existing || (existing.direction === 'in' && p.direction === 'out')) {\n        map.set(p.id, { ...p });\n      }\n    }\n    byBlock.set(block.id, map);\n  }\n\n  for (const conn of connections) {\n    const srcBlock = byBlock.get(conn.source.blockId);\n    if (srcBlock) {\n      const existing = srcBlock.get(conn.source.portId);\n      if (!existing || existing.direction === 'in') {\n        srcBlock.set(conn.source.portId, {\n          id: conn.source.portId,\n          display: conn.source.portDisplay,\n          direction: 'out',\n        });\n      }\n    }\n    const tgtBlock = byBlock.get(conn.target.blockId);\n    if (tgtBlock) {\n      const existing = tgtBlock.get(conn.target.portId);\n      if (!existing) {\n        tgtBlock.set(conn.target.portId, {\n          id: conn.target.portId,\n          display: conn.target.portDisplay,\n          direction: 'in',\n        });\n      }\n      // if existing is 'out', keep it ('out' wins)\n    }\n  }\n\n  const result = new Map<string, Port[]>();\n  for (const [blockId, map] of byBlock) {\n    result.set(blockId, Array.from(map.values()));\n  }\n  return result;\n}\n\n// ── Port placement on block faces ──\n\n/**\n * Compute the Y coordinate of the first port in a cluster so that the cluster\n * is vertically centered in the available area below the inset label and above\n * the block's bottom edge.\n */\nfunction startYForFace(blockY: number, blockHeight: number, portCount: number): number {\n  const topMargin = 40;    // below inset label recess\n  const bottomMargin = 30; // above block bottom edge\n  const topY = blockY + topMargin;\n  const bottomY = blockY + blockHeight - bottomMargin;\n  const availableHeight = bottomY - topY;\n  const clusterHeight = Math.max(0, (portCount - 1) * 24);\n  return topY + (availableHeight - clusterHeight) / 2;\n}\n\nfunction placePorts(block: LayoutBlock, ports: Port[]): LayoutPort[] {\n  const inPorts = ports.filter(p => p.direction === 'in');\n  const outPorts = ports.filter(p => p.direction === 'out');\n\n  const layoutPorts: LayoutPort[] = [];\n  const spacing = 24;\n\n  const inStartY = startYForFace(block.y, block.height, inPorts.length);\n  inPorts.forEach((p, i) => {\n    layoutPorts.push({\n      ...p,\n      position: { x: block.x, y: inStartY + i * spacing },\n      signalType: null,\n    });\n  });\n\n  const outStartY = startYForFace(block.y, block.height, outPorts.length);\n  outPorts.forEach((p, i) => {\n    layoutPorts.push({\n      ...p,\n      position: { x: block.x + block.width, y: outStartY + i * spacing },\n      signalType: null,\n    });\n  });\n\n  return layoutPorts;\n}\n\n// ── Signal type derivation ──\n\n/**\n * For each port, pick a signal type. Prefer forward edges; fall back to feedback.\n * For outputs: first connection where this port is the source.\n * For inputs: first connection where this port is the target.\n */\nfunction assignPortSignalTypes(\n  blocks: LayoutBlock[],\n  forward: Connection[],\n  feedback: Connection[],\n): void {\n  const pick = (\n    blockId: string,\n    portId: string,\n    direction: 'in' | 'out',\n    connections: Connection[],\n  ): SignalType | null => {\n    for (const conn of connections) {\n      if (direction === 'out') {\n        if (conn.source.blockId === blockId && conn.source.portId === portId) {\n          return conn.signalType;\n        }\n      } else {\n        if (conn.target.blockId === blockId && conn.target.portId === portId) {\n          return conn.signalType;\n        }\n      }\n    }\n    return null;\n  };\n\n  for (const block of blocks) {\n    for (const port of block.ports) {\n      const fromForward = pick(block.id, port.id, port.direction, forward);\n      if (fromForward) {\n        port.signalType = fromForward;\n        continue;\n      }\n      const fromFeedback = pick(block.id, port.id, port.direction, feedback);\n      if (fromFeedback) {\n        port.signalType = fromFeedback;\n      }\n    }\n  }\n}\n\n// ── Lookup helpers ──\n\nfunction findPortPosition(\n  block: LayoutBlock,\n  portId: string,\n  direction: 'in' | 'out',\n): Point {\n  const exact = block.ports.find(p => p.id === portId && p.direction === direction);\n  if (exact) return exact.position;\n  // fallback: any port with same id (different direction) — collectPorts\n  // synthesizes every connection endpoint, so the only way to miss an exact\n  // match is a direction mismatch on a port that exists in the block.\n  const any = block.ports.find(p => p.id === portId)!;\n  return any.position;\n}\n\n// ── Main ──\n\nexport function layout(graph: PatchGraph, options: LayoutOptions = {}): LayoutResult {\n  const direction = options.direction ?? 'LR';\n  const rankSep = options.rankSep ?? 120;\n  const nodeSep = options.nodeSep ?? 40;\n\n  const allBlocks: Block[] = [...graph.declaredBlocks, ...graph.stubBlocks];\n\n  // Collect ports using both forward and feedback edges\n  const allConnections = [...graph.connections, ...graph.feedbackEdges];\n  const portsByBlock = collectPorts(allBlocks, allConnections);\n\n  // Compute dimensions for each block\n  const dimsByBlock = new Map<string, { width: number; height: number }>();\n  for (const block of allBlocks) {\n    const ports = portsByBlock.get(block.id) ?? [];\n    dimsByBlock.set(block.id, getBlockDimensions(block, ports.length));\n  }\n\n  // Build dagre graph\n  const g = new dagre.graphlib.Graph();\n  g.setGraph({\n    rankdir: direction,\n    ranksep: rankSep,\n    nodesep: nodeSep,\n    marginx: 20,\n    marginy: 20,\n  });\n  g.setDefaultEdgeLabel(() => ({}));\n\n  for (const block of allBlocks) {\n    const d = dimsByBlock.get(block.id)!;\n    g.setNode(block.id, { width: d.width, height: d.height });\n  }\n\n  // Forward edges only (skip self-loops to avoid dagre issues)\n  for (const conn of graph.connections) {\n    if (conn.source.blockId === conn.target.blockId) continue;\n    g.setEdge(conn.source.blockId, conn.target.blockId);\n  }\n\n  dagre.layout(g);\n\n  // Extract positioned blocks\n  const layoutBlocks: LayoutBlock[] = [];\n  const blocksById = new Map<string, LayoutBlock>();\n\n  for (const block of allBlocks) {\n    const node = g.node(block.id);\n    const d = dimsByBlock.get(block.id)!;\n    const nodeX = node?.x ?? 0;\n    const nodeY = node?.y ?? 0;\n    const x = nodeX - d.width / 2;\n    const y = nodeY - d.height / 2;\n\n    const partial: LayoutBlock = {\n      id: block.id,\n      label: block.label,\n      subLabel: block.subLabel,\n      params: block.params,\n      ports: [],\n      parentModule: block.parentModule,\n      x,\n      y,\n      width: d.width,\n      height: d.height,\n    };\n    const ports = portsByBlock.get(block.id) ?? [];\n    partial.ports = placePorts(partial, ports);\n    layoutBlocks.push(partial);\n    blocksById.set(block.id, partial);\n  }\n\n  // Assign signal types to each port based on connections\n  assignPortSignalTypes(layoutBlocks, graph.connections, graph.feedbackEdges);\n\n  // Compute diagram bounds\n  let maxX = 0;\n  let maxY = 0;\n  for (const b of layoutBlocks) {\n    if (b.x + b.width > maxX) maxX = b.x + b.width;\n    if (b.y + b.height > maxY) maxY = b.y + b.height;\n  }\n\n  const hasFeedback = graph.feedbackEdges.length > 0;\n  const feedbackArcOffset = 20;\n  const diagramBottom = maxY + 10;\n\n  // Route connections\n  const layoutConnections: LayoutConnection[] = [];\n\n  for (const conn of graph.connections) {\n    const srcBlock = blocksById.get(conn.source.blockId);\n    const tgtBlock = blocksById.get(conn.target.blockId);\n    if (!srcBlock || !tgtBlock) continue;\n\n    const srcPos = findPortPosition(srcBlock, conn.source.portId, 'out');\n    const tgtPos = findPortPosition(tgtBlock, conn.target.portId, 'in');\n\n    let path: string;\n    if (conn.source.blockId === conn.target.blockId) {\n      const blockBottom = srcBlock.y + srcBlock.height;\n      path = selfLoopArcPath(srcPos, tgtPos, blockBottom, 20);\n    } else {\n      path = smoothstepPath(srcPos, tgtPos);\n    }\n\n    layoutConnections.push({\n      id: conn.id,\n      source: conn.source,\n      target: conn.target,\n      signalType: conn.signalType,\n      annotation: conn.annotation,\n      path,\n      isFeedback: false,\n      sourcePoint: srcPos,\n      targetPoint: tgtPos,\n    });\n  }\n\n  for (const conn of graph.feedbackEdges) {\n    const srcBlock = blocksById.get(conn.source.blockId);\n    const tgtBlock = blocksById.get(conn.target.blockId);\n    if (!srcBlock || !tgtBlock) continue;\n\n    const srcPos = findPortPosition(srcBlock, conn.source.portId, 'out');\n    const tgtPos = findPortPosition(tgtBlock, conn.target.portId, 'in');\n\n    const path = feedbackArcPath(srcPos, tgtPos, diagramBottom, feedbackArcOffset);\n\n    layoutConnections.push({\n      id: conn.id,\n      source: conn.source,\n      target: conn.target,\n      signalType: conn.signalType,\n      annotation: conn.annotation,\n      path,\n      isFeedback: true,\n      sourcePoint: srcPos,\n      targetPoint: tgtPos,\n    });\n  }\n\n  // Overall dimensions\n  const margin = 20;\n  // Feedback arcs drop to diagramBottom + feedbackArcOffset and carry an\n  // annotation below them, so reserve enough room for the arc + the\n  // annotation line + its text stroke padding.\n  const feedbackSpace = hasFeedback\n    ? (diagramBottom - maxY) + feedbackArcOffset + 30 + 16\n    : 0;\n  const width = maxX + margin;\n  const height = maxY + margin + feedbackSpace;\n\n  return {\n    blocks: layoutBlocks,\n    connections: layoutConnections,\n    width,\n    height,\n    signalTypeStats: graph.signalTypeStats,\n  };\n}\n","import type { Point } from './types';\n\nexport function straightPath(source: Point, target: Point): string {\n  return `M ${source.x} ${source.y} L ${target.x} ${target.y}`;\n}\n\nexport function rightAnglePath(source: Point, target: Point): string {\n  const midX = (source.x + target.x) / 2;\n  return [\n    `M ${source.x} ${source.y}`,\n    `L ${midX} ${source.y}`,\n    `L ${midX} ${target.y}`,\n    `L ${target.x} ${target.y}`,\n  ].join(' ');\n}\n\nexport function smoothstepPath(source: Point, target: Point): string {\n  const dx = target.x - source.x;\n  const controlOffset = Math.max(Math.abs(dx) * 0.4, 30);\n  const cx1 = source.x + controlOffset;\n  const cy1 = source.y;\n  const cx2 = target.x - controlOffset;\n  const cy2 = target.y;\n  return `M ${source.x} ${source.y} C ${cx1} ${cy1}, ${cx2} ${cy2}, ${target.x} ${target.y}`;\n}\n\nexport function feedbackArcPath(\n  source: Point,\n  target: Point,\n  diagramBottom: number,\n  arcOffset: number,\n): string {\n  const arcY = diagramBottom + arcOffset;\n  return [\n    `M ${source.x} ${source.y}`,\n    `L ${source.x + 20} ${source.y}`,\n    `L ${source.x + 20} ${arcY}`,\n    `L ${target.x - 20} ${arcY}`,\n    `L ${target.x - 20} ${target.y}`,\n    `L ${target.x} ${target.y}`,\n  ].join(' ');\n}\n\nexport function selfLoopArcPath(\n  source: Point,\n  target: Point,\n  blockBottom: number,\n  arcOffset: number,\n): string {\n  const arcY = blockBottom + arcOffset;\n  return [\n    `M ${source.x} ${source.y}`,\n    `L ${source.x + 15} ${source.y}`,\n    `Q ${source.x + 15} ${arcY}, ${(source.x + target.x) / 2} ${arcY}`,\n    `Q ${target.x - 15} ${arcY}, ${target.x - 15} ${target.y}`,\n    `L ${target.x} ${target.y}`,\n  ].join(' ');\n}\n","import type {\n  LayoutBlock,\n  LayoutConnection,\n  LayoutResult,\n  SignalType,\n  Theme,\n} from './types';\nimport { sanitizeForSvg } from './errors';\n\n// ── ID generation ──\n\nfunction genId(): string {\n  return 'pf-' + Math.random().toString(16).slice(2, 8);\n}\n\n// ── Accessibility summary ──\n\nfunction buildDesc(layoutResult: LayoutResult): string {\n  const blockCount = layoutResult.blocks.length;\n  const connCount = layoutResult.connections.length;\n  const stats = layoutResult.signalTypeStats;\n  const statsParts: string[] = [];\n  const order: SignalType[] = ['audio', 'cv', 'pitch', 'gate', 'trigger', 'clock'];\n  for (const t of order) {\n    const n = stats[t] ?? 0;\n    if (n > 0) statsParts.push(`${n} ${t}`);\n  }\n\n  let summary = `Patch diagram with ${blockCount} module${blockCount === 1 ? '' : 's'} and ${connCount} connection${connCount === 1 ? '' : 's'}.`;\n\n  if (blockCount > 0 && blockCount <= 6) {\n    const names = layoutResult.blocks.map(b => sanitizeForSvg(b.label)).join(', ');\n    summary += ` Modules: ${names}.`;\n  }\n\n  if (statsParts.length > 0) {\n    summary += ` Signals: ${statsParts.join(', ')}.`;\n  }\n\n  return summary;\n}\n\n// ── Layer builders ──\n\nfunction buildBackground(theme: Theme, idPrefix: string, width: number, height: number): string {\n  if (!theme.grid) return '';\n  return `<rect width=\"${width}\" height=\"${height}\" fill=\"url(#${idPrefix}-dots)\"/>`;\n}\n\nfunction buildCables(theme: Theme, connections: LayoutConnection[]): string {\n  const parts: string[] = [];\n  const tips: string[] = [];\n\n  for (const conn of connections) {\n    const cableColor = theme.cable.colors[conn.signalType];\n    parts.push(\n      `<path d=\"${conn.path}\" stroke=\"${cableColor.stroke}\" stroke-width=\"${theme.cable.width}\" ` +\n      `fill=\"none\" stroke-linecap=\"round\" stroke-linejoin=\"round\" ` +\n      `data-connection=\"${sanitizeForSvg(conn.id)}\" data-signal=\"${conn.signalType}\"/>`,\n    );\n    tips.push(\n      `<circle cx=\"${conn.sourcePoint.x}\" cy=\"${conn.sourcePoint.y}\" r=\"${theme.cable.plugTipRadius}\" fill=\"${cableColor.plugTip}\"/>`,\n    );\n    tips.push(\n      `<circle cx=\"${conn.targetPoint.x}\" cy=\"${conn.targetPoint.y}\" r=\"${theme.cable.plugTipRadius}\" fill=\"${cableColor.plugTip}\"/>`,\n    );\n  }\n\n  return parts.join('') + tips.join('');\n}\n\nfunction buildPanels(theme: Theme, idPrefix: string, blocks: LayoutBlock[]): string {\n  const parts: string[] = [];\n\n  for (const block of blocks) {\n    const moduleName = sanitizeForSvg(block.parentModule || block.label);\n    const label = sanitizeForSvg(block.label);\n    const fontFamily = sanitizeForSvg(theme.label.fontFamily);\n\n    const insetX = block.x + 12;\n    const insetY = block.y + 8;\n    const insetW = block.width - 24;\n\n    let group = `<g data-module=\"${moduleName}\" filter=\"url(#${idPrefix}-panel-shadow)\">`;\n    // Main panel rect\n    group += `<rect x=\"${block.x}\" y=\"${block.y}\" width=\"${block.width}\" height=\"${block.height}\" ` +\n      `fill=\"${theme.panel.fill}\" stroke=\"${theme.panel.stroke}\" stroke-width=\"0.75\" rx=\"${theme.panel.cornerRadius}\"/>`;\n    // Top highlight bevel\n    group += `<line x1=\"${block.x}\" y1=\"${block.y + 0.5}\" x2=\"${block.x + block.width}\" y2=\"${block.y + 0.5}\" ` +\n      `stroke=\"${theme.panel.highlight}\" stroke-width=\"${theme.panel.bevelWidth}\"/>`;\n    // Bottom shadow bevel\n    group += `<line x1=\"${block.x}\" y1=\"${block.y + block.height - 0.5}\" x2=\"${block.x + block.width}\" y2=\"${block.y + block.height - 0.5}\" ` +\n      `stroke=\"${theme.panel.shadow}\" stroke-width=\"0.5\"/>`;\n    // Inset label recess\n    group += `<rect x=\"${insetX}\" y=\"${insetY}\" width=\"${insetW}\" height=\"28\" ` +\n      `fill=\"${theme.label.plateFill}\" stroke=\"${theme.label.plateStroke}\" stroke-width=\"0.5\"/>`;\n    // Label\n    group += `<text x=\"${block.x + block.width / 2}\" y=\"${block.y + 22}\" text-anchor=\"middle\" ` +\n      `font-family=\"${fontFamily}\" font-size=\"14\" font-weight=\"700\" ` +\n      `fill=\"${theme.label.color}\" letter-spacing=\"3\">${label}</text>`;\n    // Sub-label: dark bar directly below the inset label plate (Monotrail style)\n    if (block.subLabel) {\n      const subLabel = sanitizeForSvg(block.subLabel);\n      const barX = insetX;\n      const barY = insetY + 28;\n      const barW = insetW;\n      const barH = 16;\n      group += `<rect class=\"pf-sublabel-bar\" x=\"${barX}\" y=\"${barY}\" width=\"${barW}\" height=\"${barH}\" ` +\n        `fill=\"${theme.panel.shadow}\"/>`;\n      group += `<text x=\"${block.x + block.width / 2}\" y=\"${barY + barH / 2 + 3}\" text-anchor=\"middle\" ` +\n        `font-family=\"${fontFamily}\" font-size=\"10\" fill=\"${theme.panel.fill}\" letter-spacing=\"1\">${subLabel}</text>`;\n    }\n    group += `</g>`;\n    parts.push(group);\n  }\n\n  return parts.join('');\n}\n\nfunction buildParams(blocks: LayoutBlock[], theme: Theme): string {\n  const parts: string[] = [];\n  const monoFont = \"'SF Mono', 'Fira Code', Consolas, 'Courier New', monospace\";\n\n  for (const block of blocks) {\n    const pw = block.width - 24;\n    const px = block.x + 12;\n    let py = block.y + 40 + (block.subLabel ? 18 : 0);\n    const blockLabelNorm = block.label.trim().toLowerCase();\n    for (const param of block.params) {\n      parts.push(\n        `<rect x=\"${px}\" y=\"${py}\" width=\"${pw}\" height=\"20\" fill=\"${theme.param.plateFill}\" stroke=\"${theme.param.plateStroke}\" stroke-width=\"0.5\"/>`,\n      );\n      const keyNorm = param.key.trim().toLowerCase();\n      const text = keyNorm === blockLabelNorm\n        ? sanitizeForSvg(param.value)\n        : `${sanitizeForSvg(param.key)}: ${sanitizeForSvg(param.value)}`;\n      parts.push(\n        `<text x=\"${px + pw / 2}\" y=\"${py + 14}\" text-anchor=\"middle\" ` +\n        `font-family=\"${monoFont}\" font-size=\"10\" fill=\"${theme.param.textColor}\">${text}</text>`,\n      );\n      py += 20;\n    }\n  }\n\n  return parts.join('');\n}\n\nfunction buildJacks(theme: Theme, idPrefix: string, blocks: LayoutBlock[]): string {\n  if (theme.port.hideSocket) return '';\n  const parts: string[] = [];\n  const c = theme.port.colors;\n\n  for (const block of blocks) {\n    for (const port of block.ports) {\n      const { x, y } = port.position;\n      const id = sanitizeForSvg(`${block.id}.${port.id}`);\n      let group = `<g data-port=\"${id}\" filter=\"url(#${idPrefix}-jack-shadow)\">`;\n      group += `<circle cx=\"${x}\" cy=\"${y}\" r=\"8\" fill=\"${c.bezel}\" stroke=\"${c.bezelStroke}\" stroke-width=\"0.75\"/>`;\n      group += `<circle cx=\"${x}\" cy=\"${y}\" r=\"5\" fill=\"${c.ring}\"/>`;\n      group += `<circle cx=\"${x}\" cy=\"${y}\" r=\"3\" fill=\"${c.hole}\"/>`;\n      group += `<circle cx=\"${x}\" cy=\"${y}\" r=\"1\" fill=\"${c.pin}\"/>`;\n      group += `</g>`;\n      parts.push(group);\n    }\n  }\n\n  return parts.join('');\n}\n\nconst SIGNAL_PILL_LABEL: Record<SignalType, string> = {\n  audio: 'audio',\n  cv: 'cv',\n  pitch: '1v/oct',\n  gate: 'gate',\n  trigger: 'trig',\n  clock: 'clk',\n};\n\n// Direction threshold (px) — cables going upward by more than this are considered \"straight up\"\nconst UPWARD_CABLE_THRESHOLD = 20;\n\n/**\n * For each port, decide whether its label should be placed BELOW the socket\n * (instead of the default ABOVE). The rule: if the cable at that socket heads\n * vertically upward (by more than a threshold), flip the label below so it\n * doesn't collide with the cable.\n *\n * Keyed by `${blockId}:${portId}:${direction}`.\n */\nfunction computeLabelBelowMap(connections: LayoutConnection[]): Map<string, boolean> {\n  const map = new Map<string, boolean>();\n  for (const conn of connections) {\n    // Source (output) port: cable leaves the socket toward targetPoint.\n    // If targetPoint.y is significantly above sourcePoint.y, cable goes up → flip below.\n    const srcKey = `${conn.source.blockId}:${conn.source.portId}:out`;\n    const srcDy = conn.targetPoint.y - conn.sourcePoint.y;\n    if (srcDy < -UPWARD_CABLE_THRESHOLD) {\n      map.set(srcKey, true);\n    } else if (!map.has(srcKey)) {\n      map.set(srcKey, false);\n    }\n\n    // Target (input) port: cable arrives from sourcePoint. If cable approaches\n    // from below going up (sourcePoint.y > targetPoint.y by threshold), flip below.\n    // Feedback edges are U-shaped: they leave the source going DOWN, traverse\n    // the bottom, and arrive at the target going UP. So feedback targets always\n    // flip below.\n    const tgtKey = `${conn.target.blockId}:${conn.target.portId}:in`;\n    const tgtDy = conn.sourcePoint.y - conn.targetPoint.y;\n    if (conn.isFeedback || tgtDy > UPWARD_CABLE_THRESHOLD) {\n      map.set(tgtKey, true);\n    } else if (!map.has(tgtKey)) {\n      map.set(tgtKey, false);\n    }\n  }\n  return map;\n}\n\nfunction buildLabels(theme: Theme, blocks: LayoutBlock[], connections: LayoutConnection[]): string {\n  const parts: string[] = [];\n  const fontFamily = sanitizeForSvg(theme.port.fontFamily);\n  const pillShow = theme.port.pill.show;\n  const pillFontSize = theme.port.pill.fontSize;\n  const pillTextColor = theme.port.pill.textColor;\n  const pillRadius = theme.port.pill.cornerRadius;\n  const pillPadX = 3;\n  const pillHeight = 11;\n  const charWidth = 6.5;\n\n  // Vertical offsets relative to the socket center\n  const pillOffsetAbove = 20;  // pill center above socket\n  const nameOffsetAbove = 32;  // port name text y above socket\n  const pillOffsetBelow = 20;  // pill center below socket\n  const nameOffsetBelow = 32;  // port name text y below socket\n\n  const belowMap = computeLabelBelowMap(connections);\n\n  // Horizontal offset from socket to label edge — keeps label fully outside the\n  // block panel so text never straddles the panel boundary (which caused clipping\n  // against the cream fill in dark mode).\n  const labelOffsetX = 6;\n\n  for (const block of blocks) {\n    for (const port of block.ports) {\n      const { x, y } = port.position;\n      const key = `${block.id}:${port.id}:${port.direction}`;\n      const below = belowMap.get(key) === true;\n      const display = sanitizeForSvg(port.display);\n      const isOutput = port.direction === 'out';\n\n      // Port name text baseline: vertically above or below the socket, but shifted\n      // horizontally OUTSIDE the block edge (right of output, left of input).\n      const textY = below ? y + nameOffsetBelow : y - nameOffsetAbove;\n      const textX = isOutput ? x + labelOffsetX : x - labelOffsetX;\n      const textAnchor = isOutput ? 'start' : 'end';\n\n      parts.push(\n        `<text x=\"${textX}\" y=\"${textY}\" font-family=\"${fontFamily}\" ` +\n        `font-size=\"${theme.port.fontSize}\" fill=\"${theme.port.labelColor}\" font-weight=\"600\" ` +\n        `text-anchor=\"${textAnchor}\" dominant-baseline=\"central\">${display}</text>`,\n      );\n\n      if (pillShow && port.signalType) {\n        const pillText = SIGNAL_PILL_LABEL[port.signalType];\n        const pillWidth = pillText.length * charWidth + pillPadX * 2;\n        const pillColor = theme.cable.colors[port.signalType].stroke;\n        // Pill is stacked between name and socket vertically, and shifted outside\n        // the block edge horizontally (adjacent to the port name above/below it).\n        const pillCenterY = below ? y + pillOffsetBelow : y - pillOffsetAbove;\n        const pillX = isOutput\n          ? x + labelOffsetX\n          : x - labelOffsetX - pillWidth;\n        const pillY = pillCenterY - pillHeight / 2;\n        const pillTextX = pillX + pillWidth / 2;\n        parts.push(\n          `<rect class=\"pf-port-pill\" x=\"${pillX}\" y=\"${pillY}\" width=\"${pillWidth}\" height=\"${pillHeight}\" ` +\n          `rx=\"${pillRadius}\" fill=\"${pillColor}\" data-signal=\"${port.signalType}\"/>`,\n        );\n        parts.push(\n          `<text class=\"pf-port-pill-text\" x=\"${pillTextX}\" y=\"${pillCenterY}\" text-anchor=\"middle\" dominant-baseline=\"central\" ` +\n          `font-family=\"${fontFamily}\" font-size=\"${pillFontSize}\" fill=\"${pillTextColor}\" font-weight=\"600\">${sanitizeForSvg(pillText)}</text>`,\n        );\n      }\n\n    }\n  }\n\n  return parts.join('');\n}\n\nfunction buildAnnotations(theme: Theme, connections: LayoutConnection[], layoutHeight: number): string {\n  const annotated = connections.filter(c => c.annotation);\n  if (annotated.length === 0) return '';\n\n  const parts: string[] = [];\n  const fontFamily = sanitizeForSvg(theme.annotation.fontFamily);\n  const noteFontSize = theme.annotation.fontSize + 2;\n  const markerFontFamily = fontFamily;\n\n  // Numbered markers on cables\n  annotated.forEach((conn, i) => {\n    const num = i + 1;\n    const sx = conn.sourcePoint.x;\n    const sy = conn.sourcePoint.y;\n    const tx = conn.targetPoint.x;\n    const ty = conn.targetPoint.y;\n\n    let mx: number;\n    let my: number;\n\n    if (conn.isFeedback) {\n      // Feedback arcs dip below the diagram — place marker at the arc's bottom-middle.\n      // The path format is: M sx sy L (sx+20) sy L (sx+20) arcY L (tx-20) arcY ...\n      // Extract arcY from the third point.\n      mx = (sx + tx) / 2;\n      const match = conn.path.match(/L\\s+\\S+\\s+\\S+\\s+L\\s+\\S+\\s+(\\S+)/);\n      my = match ? parseFloat(match[1]) : Math.max(sy, ty) + 30;\n    } else {\n      mx = (sx + tx) / 2;\n      my = (sy + ty) / 2;\n    }\n\n    const markerStroke = conn.isFeedback\n      ? theme.cable.colors[conn.signalType].stroke\n      : theme.annotation.color;\n\n    parts.push(\n      `<circle cx=\"${mx}\" cy=\"${my}\" r=\"8\" fill=\"${theme.panel.highlight}\" ` +\n      `stroke=\"${markerStroke}\" stroke-width=\"0.5\" data-annotation-marker=\"${num}\"/>`,\n    );\n    parts.push(\n      `<text x=\"${mx}\" y=\"${my + 3}\" text-anchor=\"middle\" ` +\n      `font-family=\"${markerFontFamily}\" font-size=\"9\" ` +\n      `fill=\"${theme.annotation.color}\">${num}</text>`,\n    );\n  });\n\n  // Notes panel in bottom-left, stacked upward above the legend line\n  const panelX = -120;\n  const lineGap = 16;\n  const noteCount = annotated.length;\n  // Bottom of notes sits at layoutHeight - 10 (just above the legend row)\n  const bottomY = layoutHeight - 10;\n  // First note (topmost) starts at bottomY - (noteCount - 1) * lineGap\n  const firstNoteY = bottomY - (noteCount - 1) * lineGap;\n\n  annotated.forEach((conn, i) => {\n    const num = i + 1;\n    const noteText = `${num}. ${sanitizeForSvg(conn.annotation!)}`;\n    const noteY = firstNoteY + i * lineGap;\n    parts.push(\n      `<text x=\"${panelX}\" y=\"${noteY}\" ` +\n      `font-family=\"${fontFamily}\" font-size=\"${noteFontSize}\" font-weight=\"600\" ` +\n      `fill=\"${theme.annotation.color}\">${noteText}</text>`,\n    );\n  });\n\n  return parts.join('');\n}\n\nfunction buildLegend(theme: Theme, layoutResult: LayoutResult): string {\n  const order: SignalType[] = ['audio', 'cv', 'pitch', 'gate', 'trigger', 'clock'];\n  const used = order.filter(t => (layoutResult.signalTypeStats[t] ?? 0) > 0);\n  if (used.length === 0) return '';\n\n  const parts: string[] = [];\n  const fontFamily = sanitizeForSvg(theme.annotation.fontFamily);\n  const itemWidth = 70;\n  const totalWidth = used.length * itemWidth;\n  // Right-align: place the legend's right edge at layoutResult.width\n  const legendStartX = layoutResult.width - totalWidth;\n  const y = layoutResult.height - 20;\n\n  for (let i = 0; i < used.length; i++) {\n    const sig = used[i];\n    const color = theme.cable.colors[sig].stroke;\n    const x = legendStartX + i * itemWidth;\n    let g = `<g transform=\"translate(${x}, ${y})\">`;\n    g += `<line x1=\"0\" y1=\"0\" x2=\"20\" y2=\"0\" stroke=\"${color}\" stroke-width=\"3\" stroke-linecap=\"round\"/>`;\n    g += `<text x=\"26\" y=\"3\" font-family=\"${fontFamily}\" font-size=\"9\" fill=\"${theme.annotation.color}\">${sig}</text>`;\n    g += `</g>`;\n    parts.push(g);\n  }\n\n  return parts.join('');\n}\n\n// ── Main renderer ──\n\nexport function renderSvg(layoutResult: LayoutResult, theme: Theme): string {\n  const idPrefix = genId();\n  const width = layoutResult.width;\n  const height = layoutResult.height;\n  const minWidth = Math.round(width);\n\n  const desc = buildDesc(layoutResult);\n\n  // Build defs\n  const defsParts: string[] = [];\n  defsParts.push(\n    `<filter id=\"${idPrefix}-panel-shadow\" x=\"-20%\" y=\"-20%\" width=\"140%\" height=\"140%\">` +\n    `<feDropShadow dx=\"0\" dy=\"2\" stdDeviation=\"${theme.panel.shadowBlur}\" flood-opacity=\"${theme.panel.shadowOpacity}\"/>` +\n    `</filter>`,\n  );\n  defsParts.push(\n    `<filter id=\"${idPrefix}-jack-shadow\" x=\"-20%\" y=\"-20%\" width=\"140%\" height=\"140%\">` +\n    `<feDropShadow dx=\"0\" dy=\"0.5\" stdDeviation=\"0.8\" flood-opacity=\"0.15\"/>` +\n    `</filter>`,\n  );\n  if (theme.grid) {\n    const spacing = theme.grid.spacing;\n    defsParts.push(\n      `<pattern id=\"${idPrefix}-dots\" width=\"${spacing}\" height=\"${spacing}\" patternUnits=\"userSpaceOnUse\">` +\n      `<circle cx=\"${spacing / 2}\" cy=\"${spacing / 2}\" r=\"${theme.grid.dotRadius}\" fill=\"${theme.grid.dotColor}\" opacity=\"${theme.grid.opacity}\"/>` +\n      `</pattern>`,\n    );\n  }\n\n  // Assemble layers\n  const layers = [\n    `<g class=\"pf-layer-bg\">${buildBackground(theme, idPrefix, width, height)}</g>`,\n    `<g class=\"pf-layer-cables\">${buildCables(theme, layoutResult.connections)}</g>`,\n    `<g class=\"pf-layer-panels\" >${buildPanels(theme, idPrefix, layoutResult.blocks)}</g>`,\n    `<g class=\"pf-layer-params\">${buildParams(layoutResult.blocks, theme)}</g>`,\n    `<g class=\"pf-layer-jacks\">${buildJacks(theme, idPrefix, layoutResult.blocks)}</g>`,\n    `<g class=\"pf-layer-labels\">${buildLabels(theme, layoutResult.blocks, layoutResult.connections)}</g>`,\n    `<g class=\"pf-layer-annotations\">${buildAnnotations(theme, layoutResult.connections, height)}</g>`,\n    `<g class=\"pf-layer-legend\">${buildLegend(theme, layoutResult)}</g>`,\n  ].join('');\n\n  const style =\n    `<style>@media print { .pf-panel, .pf-jack { filter: none; } }</style>`;\n\n  // Port labels are now stacked vertically above/below sockets, so horizontal\n  // padding only needs to clear the socket jacket (radius 8) plus a small buffer.\n  // Annotation notes anchor to x = -120, so keep enough left padding for them\n  // (they still read as margin-text aligned with the legend).\n  const labelPadX = 130;\n  const vbWidth = width + labelPadX * 2;\n\n  // Top padding: room for port name + pill stacked above the topmost socket\n  // (~40px: pill center at -20, text baseline at -32, plus text height).\n  const topPad = 40;\n  // Bottom padding must accommodate:\n  //   • port labels below sockets on the bottommost row (~40px)\n  //   • legend row: ~30px\n  //   • observation notes (bottom-left, stacked upward above legend)\n  const noteCount = layoutResult.connections.filter(c => c.annotation).length;\n  const notesHeight = noteCount > 0 ? noteCount * 16 + 10 : 0;\n  const bottomPad = Math.max(40, notesHeight + 10);\n  const vbHeight = height + topPad + bottomPad;\n\n  const svg =\n    `<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"${-labelPadX} ${-topPad} ${vbWidth} ${vbHeight}\" width=\"100%\" ` +\n    `data-pf-min-width=\"${minWidth + labelPadX * 2}\" role=\"img\" aria-labelledby=\"${idPrefix}-title ${idPrefix}-desc\">` +\n    `<title id=\"${idPrefix}-title\">Patch diagram</title>` +\n    `<desc id=\"${idPrefix}-desc\">${desc}</desc>` +\n    style +\n    `<defs>${defsParts.join('')}</defs>` +\n    layers +\n    `</svg>`;\n\n  return svg;\n}\n","import type { Theme, DeepPartial } from '../types';\n\nexport const defaultTheme: Theme = {\n  background: 'transparent',\n  panel: {\n    fill: '#e8e4dc',\n    stroke: '#cec8be',\n    highlight: '#f2efe8',\n    shadow: '#bdb8ae',\n    cornerRadius: 0,\n    shadowBlur: 3,\n    shadowOpacity: 0.10,\n    bevelWidth: 1,\n  },\n  label: {\n    fontFamily: \"system-ui, -apple-system, BlinkMacSystemFont, 'Segoe UI', sans-serif\",\n    color: '#1a1a1a',\n    subColor: '#888888',\n    plateFill: '#f4f1ea',\n    plateStroke: '#c5c0b6',\n  },\n  param: {\n    plateFill: '#f0ede6',\n    plateStroke: '#d5d0c6',\n    textColor: '#555555',\n  },\n  port: {\n    fontFamily: \"'SF Mono', 'Fira Code', Consolas, 'Courier New', monospace\",\n    fontSize: 9,\n    colors: {\n      bezel: '#c0bbb2',\n      bezelStroke: '#a8a39a',\n      ring: '#8a8580',\n      hole: '#555555',\n      pin: '#333333',\n    },\n    hideSocket: false,\n    labelColor: '#1a1a1a',\n    pill: {\n      show: true,\n      fontSize: 8,\n      textColor: '#ffffff',\n      cornerRadius: 0,\n    },\n  },\n  cable: {\n    width: 3,\n    colors: {\n      audio:   { stroke: '#e88ca5', plugTip: '#d47a93' },\n      cv:      { stroke: '#7bafd4', plugTip: '#6a9ec3' },\n      pitch:   { stroke: '#8cb87c', plugTip: '#7ba76b' },\n      gate:    { stroke: '#d4a054', plugTip: '#c49244' },\n      trigger: { stroke: '#d4a054', plugTip: '#c49244' },\n      clock:   { stroke: '#d4a054', plugTip: '#c49244' },\n    },\n    plugTipRadius: 3.5,\n  },\n  annotation: {\n    fontFamily: \"'SF Mono', 'Fira Code', Consolas, 'Courier New', monospace\",\n    fontSize: 9,\n    color: '#4a4a4a',\n    haloColor: '#f7f5f0',\n  },\n  grid: {\n    dotColor: '#aaaaaa',\n    dotRadius: 0.5,\n    spacing: 12,\n    opacity: 0.3,\n  },\n};\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction deepMerge<T>(target: T, source: DeepPartial<T>): T {\n  const result: Record<string, unknown> = { ...(target as Record<string, unknown>) };\n  const src = source as Record<string, unknown>;\n  const tgt = target as Record<string, unknown>;\n  for (const key in src) {\n    const sourceVal = src[key];\n    const targetVal = tgt[key];\n    if (\n      sourceVal !== null &&\n      typeof sourceVal === 'object' &&\n      !Array.isArray(sourceVal) &&\n      targetVal !== null &&\n      typeof targetVal === 'object' &&\n      !Array.isArray(targetVal)\n    ) {\n      result[key] = deepMerge(\n        targetVal as Record<string, unknown>,\n        sourceVal as DeepPartial<Record<string, unknown>>,\n      );\n    } else if (sourceVal !== undefined) {\n      result[key] = sourceVal;\n    }\n  }\n  return result as T;\n}\n\nexport function createTheme(overrides: DeepPartial<Theme>): Theme {\n  return deepMerge(defaultTheme, overrides);\n}\n","import type { Theme } from '../types';\nimport { createTheme } from './default';\n\n// Minimal dark-mode variant. Panels stay cream (the Braun aesthetic looks\n// fine on dark backgrounds). Only out-of-panel text (port labels, annotations,\n// legend) changes to remain readable on dark page backgrounds like GitHub's.\n//\n// Port labels and legend switch from near-black to a cream/light tone so they\n// read on the dark page background while still looking acceptable when they\n// graze the cream panel edges.\nexport const darkTheme: Theme = createTheme({\n  port: {\n    // Port labels sit outside the panel, on the page. Use a light cream so\n    // they read on dark page backgrounds.\n    labelColor: '#e8e4dc',\n  },\n  annotation: {\n    // Annotations on cables sit on the page bg. Lighten the text and match\n    // the halo to the GitHub dark page bg so the \"chip\" doesn't flash cream.\n    color: '#d0d0d0',\n    haloColor: '#0d1117',\n  },\n  grid: {\n    // Faint dot grid needs to be visible on dark backgrounds too.\n    dotColor: '#555555',\n    dotRadius: 0.5,\n    spacing: 12,\n    opacity: 0.5,\n  },\n});\n","export { parse } from './parser';\nexport { layout } from './layout';\nexport { renderSvg } from './renderer';\nexport { createTheme, defaultTheme } from './themes/default';\nexport { darkTheme } from './themes/dark';\n\nimport type { RenderOptions } from './types';\nimport { parse } from './parser';\nimport { layout } from './layout';\nimport { renderSvg } from './renderer';\nimport { createTheme, defaultTheme } from './themes/default';\n\n// Convenience: full pipeline\nexport function render(notation: string, options?: RenderOptions): string {\n  const parseResult = parse(notation);\n  const { graph } = parseResult;\n  const totalBlocks = graph.declaredBlocks.length + graph.stubBlocks.length;\n  const totalConnections = graph.connections.length + graph.feedbackEdges.length;\n  if (totalBlocks === 0 && totalConnections === 0) {\n    throw new Error('patchflow parse error: empty patch — no modules or connections found');\n  }\n  const layoutResult = layout(graph, {\n    direction: 'LR',\n  });\n  const theme = options?.theme ? createTheme(options.theme) : defaultTheme;\n  return renderSvg(layoutResult, theme);\n}\n\n// Re-export all types\nexport type {\n  SignalType, Port, Block, Connection, ConnectionEndpoint,\n  PatchGraph, Param,\n  LayoutBlock, LayoutConnection, LayoutPort, LayoutResult, Point,\n  Theme, CableColor, SocketColors,\n  RenderOptions, LayoutOptions,\n  ParseResult, ParseDiagnostic, ErrorCode, ErrorSeverity,\n  DeepPartial,\n} from './types';\n"],"mappings":";;;;;;;AAAA;AAAA;AAAA;AAEA,QAAI,oBAAoB;AACxB,QAAI,aAAa;AACjB,QAAI,iBAAiB;AAYrB,QAAM,QAAN,MAAY;AAAA,MACV,cAAc;AAAA,MACd,gBAAgB;AAAA,MAChB,cAAc;AAAA;AAAA,MAGd;AAAA;AAAA,MAGA,sBAAsB,MAAM;AAAA;AAAA,MAG5B,sBAAsB,MAAM;AAAA;AAAA,MAG5B,SAAS,CAAC;AAAA;AAAA,MAGV,MAAM,CAAC;AAAA;AAAA,MAGP,SAAS,CAAC;AAAA;AAAA,MAGV,OAAO,CAAC;AAAA;AAAA,MAGR,QAAQ,CAAC;AAAA;AAAA,MAGT,YAAY,CAAC;AAAA;AAAA,MAGb,cAAc,CAAC;AAAA;AAAA,MAGf,aAAa;AAAA;AAAA,MAGb,aAAa;AAAA,MAEb;AAAA,MAEA;AAAA,MAEA,YAAY,MAAM;AAChB,YAAI,MAAM;AACR,eAAK,cAAc,OAAO,OAAO,MAAM,UAAU,IAAI,KAAK,WAAW;AACrE,eAAK,gBAAgB,OAAO,OAAO,MAAM,YAAY,IAAI,KAAK,aAAa;AAC3E,eAAK,cAAc,OAAO,OAAO,MAAM,UAAU,IAAI,KAAK,WAAW;AAAA,QACvE;AAEA,YAAI,KAAK,aAAa;AAEpB,eAAK,UAAU,CAAC;AAGhB,eAAK,YAAY,CAAC;AAClB,eAAK,UAAU,UAAU,IAAI,CAAC;AAAA,QAChC;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa;AACX,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,eAAe;AACb,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,aAAa;AACX,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA,MAKA,SAAS,OAAO;AACd,aAAK,SAAS;AACd,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA,MAKA,QAAQ;AACN,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAYA,oBAAoB,YAAY;AAC9B,aAAK,sBAAsB;AAC3B,YAAI,OAAO,eAAe,YAAY;AACpC,eAAK,sBAAsB,MAAM;AAAA,QACnC;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ;AACN,eAAO,OAAO,KAAK,KAAK,MAAM;AAAA,MAChC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,UAAU;AACR,YAAI,OAAO;AACX,eAAO,KAAK,MAAM,EAAE,OAAO,OAAK,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,WAAW,CAAC;AAAA,MACvE;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,YAAI,OAAO;AACX,eAAO,KAAK,MAAM,EAAE,OAAO,OAAK,OAAO,KAAK,KAAK,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;AAAA,MACxE;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS,IAAI,OAAO;AAClB,YAAI,OAAO;AACX,YAAI,OAAO;AACX,WAAG,QAAQ,SAAS,GAAG;AACrB,cAAI,KAAK,SAAS,GAAG;AACnB,iBAAK,QAAQ,GAAG,KAAK;AAAA,UACvB,OAAO;AACL,iBAAK,QAAQ,CAAC;AAAA,UAChB;AAAA,QACF,CAAC;AACD,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,GAAG,OAAO;AAChB,YAAI,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG;AACjC,cAAI,UAAU,SAAS,GAAG;AACxB,iBAAK,OAAO,CAAC,IAAI;AAAA,UACnB;AACA,iBAAO;AAAA,QACT;AAEA,aAAK,OAAO,CAAC,IAAI,UAAU,SAAS,IAAI,QAAQ,KAAK,oBAAoB,CAAC;AAC1E,YAAI,KAAK,aAAa;AACpB,eAAK,QAAQ,CAAC,IAAI;AAClB,eAAK,UAAU,CAAC,IAAI,CAAC;AACrB,eAAK,UAAU,UAAU,EAAE,CAAC,IAAI;AAAA,QAClC;AACA,aAAK,IAAI,CAAC,IAAI,CAAC;AACf,aAAK,OAAO,CAAC,IAAI,CAAC;AAClB,aAAK,KAAK,CAAC,IAAI,CAAC;AAChB,aAAK,MAAM,CAAC,IAAI,CAAC;AACjB,UAAE,KAAK;AACP,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,KAAK,GAAG;AACN,eAAO,KAAK,OAAO,CAAC;AAAA,MACtB;AAAA;AAAA;AAAA;AAAA,MAKA,QAAQ,GAAG;AACT,eAAO,OAAO,OAAO,KAAK,QAAQ,CAAC;AAAA,MACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,WAAW,GAAG;AACZ,YAAI,OAAO;AACX,YAAI,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG;AACjC,cAAI,aAAa,OAAK,KAAK,WAAW,KAAK,UAAU,CAAC,CAAC;AACvD,iBAAO,KAAK,OAAO,CAAC;AACpB,cAAI,KAAK,aAAa;AACpB,iBAAK,4BAA4B,CAAC;AAClC,mBAAO,KAAK,QAAQ,CAAC;AACrB,iBAAK,SAAS,CAAC,EAAE,QAAQ,SAAS,OAAO;AACvC,mBAAK,UAAU,KAAK;AAAA,YACtB,CAAC;AACD,mBAAO,KAAK,UAAU,CAAC;AAAA,UACzB;AACA,iBAAO,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,QAAQ,UAAU;AAC3C,iBAAO,KAAK,IAAI,CAAC;AACjB,iBAAO,KAAK,OAAO,CAAC;AACpB,iBAAO,KAAK,KAAK,KAAK,CAAC,CAAC,EAAE,QAAQ,UAAU;AAC5C,iBAAO,KAAK,KAAK,CAAC;AAClB,iBAAO,KAAK,MAAM,CAAC;AACnB,YAAE,KAAK;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU,GAAG,QAAQ;AACnB,YAAI,CAAC,KAAK,aAAa;AACrB,gBAAM,IAAI,MAAM,2CAA2C;AAAA,QAC7D;AAEA,YAAI,WAAW,QAAW;AACxB,mBAAS;AAAA,QACX,OAAO;AAEL,oBAAU;AACV,mBAAS,WAAW,QAAQ,aAAa,QAAW,WAAW,KAAK,OAAO,QAAQ,GAAG;AACpF,gBAAI,aAAa,GAAG;AAClB,oBAAM,IAAI,MAAM,aAAa,SAAQ,mBAAmB,IACpD,uBAAuB;AAAA,YAC7B;AAAA,UACF;AAEA,eAAK,QAAQ,MAAM;AAAA,QACrB;AAEA,aAAK,QAAQ,CAAC;AACd,aAAK,4BAA4B,CAAC;AAClC,aAAK,QAAQ,CAAC,IAAI;AAClB,aAAK,UAAU,MAAM,EAAE,CAAC,IAAI;AAC5B,eAAO;AAAA,MACT;AAAA,MAEA,4BAA4B,GAAG;AAC7B,eAAO,KAAK,UAAU,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO,GAAG;AACR,YAAI,KAAK,aAAa;AACpB,cAAI,SAAS,KAAK,QAAQ,CAAC;AAC3B,cAAI,WAAW,YAAY;AACzB,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS,IAAI,YAAY;AACvB,YAAI,KAAK,aAAa;AACpB,cAAI,WAAW,KAAK,UAAU,CAAC;AAC/B,cAAI,UAAU;AACZ,mBAAO,OAAO,KAAK,QAAQ;AAAA,UAC7B;AAAA,QACF,WAAW,MAAM,YAAY;AAC3B,iBAAO,KAAK,MAAM;AAAA,QACpB,WAAW,KAAK,QAAQ,CAAC,GAAG;AAC1B,iBAAO,CAAC;AAAA,QACV;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa,GAAG;AACd,YAAI,SAAS,KAAK,OAAO,CAAC;AAC1B,YAAI,QAAQ;AACV,iBAAO,OAAO,KAAK,MAAM;AAAA,QAC3B;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,WAAW,GAAG;AACZ,YAAI,QAAQ,KAAK,MAAM,CAAC;AACxB,YAAI,OAAO;AACT,iBAAO,OAAO,KAAK,KAAK;AAAA,QAC1B;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,GAAG;AACX,YAAI,QAAQ,KAAK,aAAa,CAAC;AAC/B,YAAI,OAAO;AACT,gBAAM,QAAQ,IAAI,IAAI,KAAK;AAC3B,mBAAS,QAAQ,KAAK,WAAW,CAAC,GAAG;AACnC,kBAAM,IAAI,IAAI;AAAA,UAChB;AAEA,iBAAO,MAAM,KAAK,MAAM,OAAO,CAAC;AAAA,QAClC;AAAA,MACF;AAAA,MAEA,OAAO,GAAG;AACR,YAAI;AACJ,YAAI,KAAK,WAAW,GAAG;AACrB,sBAAY,KAAK,WAAW,CAAC;AAAA,QAC/B,OAAO;AACL,sBAAY,KAAK,UAAU,CAAC;AAAA,QAC9B;AACA,eAAO,UAAU,WAAW;AAAA,MAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,YAAY,QAAQ;AAClB,YAAI,OAAO,IAAI,KAAK,YAAY;AAAA,UAC9B,UAAU,KAAK;AAAA,UACf,YAAY,KAAK;AAAA,UACjB,UAAU,KAAK;AAAA,QACjB,CAAC;AAED,aAAK,SAAS,KAAK,MAAM,CAAC;AAE1B,YAAI,OAAO;AACX,eAAO,QAAQ,KAAK,MAAM,EAAE,QAAQ,SAAS,CAAC,GAAG,KAAK,GAAG;AACvD,cAAI,OAAO,CAAC,GAAG;AACb,iBAAK,QAAQ,GAAG,KAAK;AAAA,UACvB;AAAA,QACF,CAAC;AAED,eAAO,OAAO,KAAK,SAAS,EAAE,QAAQ,SAAS,GAAG;AAChD,cAAI,KAAK,QAAQ,EAAE,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC,GAAG;AAC1C,iBAAK,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC;AAAA,UAC9B;AAAA,QACF,CAAC;AAED,YAAI,UAAU,CAAC;AACf,iBAAS,WAAW,GAAG;AACrB,cAAI,SAAS,KAAK,OAAO,CAAC;AAC1B,cAAI,WAAW,UAAa,KAAK,QAAQ,MAAM,GAAG;AAChD,oBAAQ,CAAC,IAAI;AACb,mBAAO;AAAA,UACT,WAAW,UAAU,SAAS;AAC5B,mBAAO,QAAQ,MAAM;AAAA,UACvB,OAAO;AACL,mBAAO,WAAW,MAAM;AAAA,UAC1B;AAAA,QACF;AAEA,YAAI,KAAK,aAAa;AACpB,eAAK,MAAM,EAAE,QAAQ,OAAK,KAAK,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC;AAAA,QAC5D;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,oBAAoB,YAAY;AAC9B,aAAK,sBAAsB;AAC3B,YAAI,OAAO,eAAe,YAAY;AACpC,eAAK,sBAAsB,MAAM;AAAA,QACnC;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY;AACV,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,OAAO,OAAO,KAAK,SAAS;AAAA,MACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,IAAI,OAAO;AACjB,YAAI,OAAO;AACX,YAAI,OAAO;AACX,WAAG,OAAO,SAAS,GAAG,GAAG;AACvB,cAAI,KAAK,SAAS,GAAG;AACnB,iBAAK,QAAQ,GAAG,GAAG,KAAK;AAAA,UAC1B,OAAO;AACL,iBAAK,QAAQ,GAAG,CAAC;AAAA,UACnB;AACA,iBAAO;AAAA,QACT,CAAC;AACD,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU;AACR,YAAI,GAAG,GAAG,MAAM;AAChB,YAAI,iBAAiB;AACrB,YAAI,OAAO,UAAU,CAAC;AAEtB,YAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,MAAM;AAC5D,cAAI,KAAK;AACT,cAAI,KAAK;AACT,iBAAO,KAAK;AACZ,cAAI,UAAU,WAAW,GAAG;AAC1B,oBAAQ,UAAU,CAAC;AACnB,6BAAiB;AAAA,UACnB;AAAA,QACF,OAAO;AACL,cAAI;AACJ,cAAI,UAAU,CAAC;AACf,iBAAO,UAAU,CAAC;AAClB,cAAI,UAAU,SAAS,GAAG;AACxB,oBAAQ,UAAU,CAAC;AACnB,6BAAiB;AAAA,UACnB;AAAA,QACF;AAEA,YAAI,KAAK;AACT,YAAI,KAAK;AACT,YAAI,SAAS,QAAW;AACtB,iBAAO,KAAK;AAAA,QACd;AAEA,YAAI,IAAI,aAAa,KAAK,aAAa,GAAG,GAAG,IAAI;AACjD,YAAI,OAAO,OAAO,KAAK,aAAa,CAAC,GAAG;AACtC,cAAI,gBAAgB;AAClB,iBAAK,YAAY,CAAC,IAAI;AAAA,UACxB;AACA,iBAAO;AAAA,QACT;AAEA,YAAI,SAAS,UAAa,CAAC,KAAK,eAAe;AAC7C,gBAAM,IAAI,MAAM,mDAAmD;AAAA,QACrE;AAIA,aAAK,QAAQ,CAAC;AACd,aAAK,QAAQ,CAAC;AAEd,aAAK,YAAY,CAAC,IAAI,iBAAiB,QAAQ,KAAK,oBAAoB,GAAG,GAAG,IAAI;AAElF,YAAI,UAAU,cAAc,KAAK,aAAa,GAAG,GAAG,IAAI;AAExD,YAAI,QAAQ;AACZ,YAAI,QAAQ;AAEZ,eAAO,OAAO,OAAO;AACrB,aAAK,UAAU,CAAC,IAAI;AACpB,6BAAqB,KAAK,OAAO,CAAC,GAAG,CAAC;AACtC,6BAAqB,KAAK,MAAM,CAAC,GAAG,CAAC;AACrC,aAAK,IAAI,CAAC,EAAE,CAAC,IAAI;AACjB,aAAK,KAAK,CAAC,EAAE,CAAC,IAAI;AAClB,aAAK;AACL,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,KAAK,GAAG,GAAG,MAAM;AACf,YAAI,IAAK,UAAU,WAAW,IAC1B,YAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1C,aAAa,KAAK,aAAa,GAAG,GAAG,IAAI;AAC7C,eAAO,KAAK,YAAY,CAAC;AAAA,MAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY;AACV,cAAM,OAAO,KAAK,KAAK,GAAG,SAAS;AACnC,YAAI,OAAO,SAAS,UAAU;AAC5B,iBAAO,EAAC,OAAO,KAAI;AAAA,QACrB;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,GAAG,GAAG,MAAM;AAClB,YAAI,IAAK,UAAU,WAAW,IAC1B,YAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1C,aAAa,KAAK,aAAa,GAAG,GAAG,IAAI;AAC7C,eAAO,OAAO,OAAO,KAAK,aAAa,CAAC;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,WAAW,GAAG,GAAG,MAAM;AACrB,YAAI,IAAK,UAAU,WAAW,IAC1B,YAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1C,aAAa,KAAK,aAAa,GAAG,GAAG,IAAI;AAC7C,YAAI,OAAO,KAAK,UAAU,CAAC;AAC3B,YAAI,MAAM;AACR,cAAI,KAAK;AACT,cAAI,KAAK;AACT,iBAAO,KAAK,YAAY,CAAC;AACzB,iBAAO,KAAK,UAAU,CAAC;AACvB,iCAAuB,KAAK,OAAO,CAAC,GAAG,CAAC;AACxC,iCAAuB,KAAK,MAAM,CAAC,GAAG,CAAC;AACvC,iBAAO,KAAK,IAAI,CAAC,EAAE,CAAC;AACpB,iBAAO,KAAK,KAAK,CAAC,EAAE,CAAC;AACrB,eAAK;AAAA,QACP;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,GAAG,GAAG;AACZ,YAAI,MAAM,KAAK,IAAI,CAAC;AACpB,YAAI,KAAK;AACP,cAAI,QAAQ,OAAO,OAAO,GAAG;AAC7B,cAAI,CAAC,GAAG;AACN,mBAAO;AAAA,UACT;AACA,iBAAO,MAAM,OAAO,UAAQ,KAAK,MAAM,CAAC;AAAA,QAC1C;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,SAAS,GAAG,GAAG;AACb,YAAI,OAAO,KAAK,KAAK,CAAC;AACtB,YAAI,MAAM;AACR,cAAI,QAAQ,OAAO,OAAO,IAAI;AAC9B,cAAI,CAAC,GAAG;AACN,mBAAO;AAAA,UACT;AACA,iBAAO,MAAM,OAAO,UAAQ,KAAK,MAAM,CAAC;AAAA,QAC1C;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,GAAG,GAAG;AACd,YAAI,UAAU,KAAK,QAAQ,GAAG,CAAC;AAC/B,YAAI,SAAS;AACX,iBAAO,QAAQ,OAAO,KAAK,SAAS,GAAG,CAAC,CAAC;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AAEA,aAAS,qBAAqB,KAAK,GAAG;AACpC,UAAI,IAAI,CAAC,GAAG;AACV,YAAI,CAAC;AAAA,MACP,OAAO;AACL,YAAI,CAAC,IAAI;AAAA,MACX;AAAA,IACF;AAEA,aAAS,uBAAuB,KAAK,GAAG;AACtC,UAAI,CAAC,EAAE,IAAI,CAAC,GAAG;AAAE,eAAO,IAAI,CAAC;AAAA,MAAG;AAAA,IAClC;AAEA,aAAS,aAAa,YAAY,IAAI,IAAI,MAAM;AAC9C,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK;AACb,UAAI,CAAC,cAAc,IAAI,GAAG;AACxB,YAAI,MAAM;AACV,YAAI;AACJ,YAAI;AAAA,MACN;AACA,aAAO,IAAI,iBAAiB,IAAI,kBACpB,SAAS,SAAY,oBAAoB;AAAA,IACvD;AAEA,aAAS,cAAc,YAAY,IAAI,IAAI,MAAM;AAC/C,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK;AACb,UAAI,CAAC,cAAc,IAAI,GAAG;AACxB,YAAI,MAAM;AACV,YAAI;AACJ,YAAI;AAAA,MACN;AACA,UAAI,UAAW,EAAE,GAAM,EAAK;AAC5B,UAAI,MAAM;AACR,gBAAQ,OAAO;AAAA,MACjB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,YAAY,SAAS;AACxC,aAAO,aAAa,YAAY,QAAQ,GAAG,QAAQ,GAAG,QAAQ,IAAI;AAAA,IACpE;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACvrBjB;AAAA;AAAA;AAAA,WAAO,UAAU;AAAA;AAAA;;;ACAjB;AAAA;AAAA;AACA,WAAO,UAAU;AAAA,MACf,OAAO;AAAA,MACP,SAAS;AAAA,IACX;AAAA;AAAA;;;ACJA;AAAA;AAAA;AAAA,QAAI,QAAQ;AAEZ,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAMA,aAAS,MAAM,GAAG;AAChB,UAAI,OAAO;AAAA,QACT,SAAS;AAAA,UACP,UAAU,EAAE,WAAW;AAAA,UACvB,YAAY,EAAE,aAAa;AAAA,UAC3B,UAAU,EAAE,WAAW;AAAA,QACzB;AAAA,QACA,OAAO,WAAW,CAAC;AAAA,QACnB,OAAO,WAAW,CAAC;AAAA,MACrB;AAEA,UAAI,EAAE,MAAM,MAAM,QAAW;AAC3B,aAAK,QAAQ,gBAAgB,EAAE,MAAM,CAAC;AAAA,MACxC;AACA,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,GAAG;AACrB,aAAO,EAAE,MAAM,EAAE,IAAI,SAAS,GAAG;AAC/B,YAAI,YAAY,EAAE,KAAK,CAAC;AACxB,YAAI,SAAS,EAAE,OAAO,CAAC;AACvB,YAAI,OAAO,EAAE,EAAK;AAClB,YAAI,cAAc,QAAW;AAC3B,eAAK,QAAQ;AAAA,QACf;AACA,YAAI,WAAW,QAAW;AACxB,eAAK,SAAS;AAAA,QAChB;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,aAAS,WAAW,GAAG;AACrB,aAAO,EAAE,MAAM,EAAE,IAAI,SAAS,GAAG;AAC/B,YAAI,YAAY,EAAE,KAAK,CAAC;AACxB,YAAI,OAAO,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE;AAC5B,YAAI,EAAE,SAAS,QAAW;AACxB,eAAK,OAAO,EAAE;AAAA,QAChB;AACA,YAAI,cAAc,QAAW;AAC3B,eAAK,QAAQ;AAAA,QACf;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAYA,aAAS,KAAK,MAAM;AAClB,UAAI,IAAI,IAAI,MAAM,KAAK,OAAO,EAAE,SAAS,KAAK,KAAK;AACnD,WAAK,MAAM,QAAQ,SAAS,OAAO;AACjC,UAAE,QAAQ,MAAM,GAAG,MAAM,KAAK;AAC9B,YAAI,MAAM,QAAQ;AAChB,YAAE,UAAU,MAAM,GAAG,MAAM,MAAM;AAAA,QACnC;AAAA,MACF,CAAC;AACD,WAAK,MAAM,QAAQ,SAAS,OAAO;AACjC,UAAE,QAAQ,EAAE,GAAG,MAAM,GAAG,GAAG,MAAM,GAAG,MAAM,MAAM,KAAK,GAAG,MAAM,KAAK;AAAA,MACrE,CAAC;AACD,aAAO;AAAA,IACT;AAAA;AAAA;;;AC/EA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,WAAW,GAAG;AACrB,UAAI,UAAU,CAAC;AACf,UAAI,QAAQ,CAAC;AACb,UAAI;AAEJ,eAAS,IAAI,GAAG;AACd,YAAI,OAAO,OAAO,SAAS,CAAC,EAAG;AAC/B,gBAAQ,CAAC,IAAI;AACb,aAAK,KAAK,CAAC;AACX,UAAE,WAAW,CAAC,EAAE,QAAQ,GAAG;AAC3B,UAAE,aAAa,CAAC,EAAE,QAAQ,GAAG;AAAA,MAC/B;AAEA,QAAE,MAAM,EAAE,QAAQ,SAAS,GAAG;AAC5B,eAAO,CAAC;AACR,YAAI,CAAC;AACL,YAAI,KAAK,QAAQ;AACf,gBAAM,KAAK,IAAI;AAAA,QACjB;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;ACxBA;AAAA;AAAA;AAOA,QAAM,gBAAN,MAAoB;AAAA,MAClB,OAAO,CAAC;AAAA,MACR,cAAc,CAAC;AAAA;AAAA;AAAA;AAAA,MAKf,OAAO;AACL,eAAO,KAAK,KAAK;AAAA,MACnB;AAAA;AAAA;AAAA;AAAA,MAKA,OAAO;AACL,eAAO,KAAK,KAAK,IAAI,SAAS,GAAG;AAAE,iBAAO,EAAE;AAAA,QAAK,CAAC;AAAA,MACpD;AAAA;AAAA;AAAA;AAAA,MAKA,IAAI,KAAK;AACP,eAAO,OAAO,OAAO,KAAK,aAAa,GAAG;AAAA,MAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,SAAS,KAAK;AACZ,YAAI,QAAQ,KAAK,YAAY,GAAG;AAChC,YAAI,UAAU,QAAW;AACvB,iBAAO,KAAK,KAAK,KAAK,EAAE;AAAA,QAC1B;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,MAAM;AACJ,YAAI,KAAK,KAAK,MAAM,GAAG;AACrB,gBAAM,IAAI,MAAM,iBAAiB;AAAA,QACnC;AACA,eAAO,KAAK,KAAK,CAAC,EAAE;AAAA,MACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,IAAI,KAAK,UAAU;AACjB,YAAI,aAAa,KAAK;AACtB,cAAM,OAAO,GAAG;AAChB,YAAI,CAAC,OAAO,OAAO,YAAY,GAAG,GAAG;AACnC,cAAI,MAAM,KAAK;AACf,cAAI,QAAQ,IAAI;AAChB,qBAAW,GAAG,IAAI;AAClB,cAAI,KAAK,EAAC,KAAU,SAAkB,CAAC;AACvC,eAAK,UAAU,KAAK;AACpB,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA,MAKA,YAAY;AACV,aAAK,MAAM,GAAG,KAAK,KAAK,SAAS,CAAC;AAClC,YAAI,MAAM,KAAK,KAAK,IAAI;AACxB,eAAO,KAAK,YAAY,IAAI,GAAG;AAC/B,aAAK,SAAS,CAAC;AACf,eAAO,IAAI;AAAA,MACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,SAAS,KAAK,UAAU;AACtB,YAAI,QAAQ,KAAK,YAAY,GAAG;AAChC,YAAI,WAAW,KAAK,KAAK,KAAK,EAAE,UAAU;AACxC,gBAAM,IAAI,MAAM,yDACF,MAAM,WAAW,KAAK,KAAK,KAAK,EAAE,WAAW,WAAW,QAAQ;AAAA,QAChF;AACA,aAAK,KAAK,KAAK,EAAE,WAAW;AAC5B,aAAK,UAAU,KAAK;AAAA,MACtB;AAAA,MAEA,SAAS,GAAG;AACV,YAAI,MAAM,KAAK;AACf,YAAI,IAAI,IAAI;AACZ,YAAI,IAAI,IAAI;AACZ,YAAI,UAAU;AACd,YAAI,IAAI,IAAI,QAAQ;AAClB,oBAAU,IAAI,CAAC,EAAE,WAAW,IAAI,OAAO,EAAE,WAAW,IAAI;AACxD,cAAI,IAAI,IAAI,QAAQ;AAClB,sBAAU,IAAI,CAAC,EAAE,WAAW,IAAI,OAAO,EAAE,WAAW,IAAI;AAAA,UAC1D;AACA,cAAI,YAAY,GAAG;AACjB,iBAAK,MAAM,GAAG,OAAO;AACrB,iBAAK,SAAS,OAAO;AAAA,UACvB;AAAA,QACF;AAAA,MACF;AAAA,MAEA,UAAU,OAAO;AACf,YAAI,MAAM,KAAK;AACf,YAAI,WAAW,IAAI,KAAK,EAAE;AAC1B,YAAI;AACJ,eAAO,UAAU,GAAG;AAClB,mBAAS,SAAS;AAClB,cAAI,IAAI,MAAM,EAAE,WAAW,UAAU;AACnC;AAAA,UACF;AACA,eAAK,MAAM,OAAO,MAAM;AACxB,kBAAQ;AAAA,QACV;AAAA,MACF;AAAA,MAEA,MAAM,GAAG,GAAG;AACV,YAAI,MAAM,KAAK;AACf,YAAI,aAAa,KAAK;AACtB,YAAI,WAAW,IAAI,CAAC;AACpB,YAAI,WAAW,IAAI,CAAC;AACpB,YAAI,CAAC,IAAI;AACT,YAAI,CAAC,IAAI;AACT,mBAAW,SAAS,GAAG,IAAI;AAC3B,mBAAW,SAAS,GAAG,IAAI;AAAA,MAC7B;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACrJjB;AAAA;AAAA;AAAA,QAAI,gBAAgB;AAEpB,WAAO,UAAU;AAEjB,QAAI,sBAAsB,MAAM;AAEhC,aAAS,SAAS,GAAG,QAAQ,UAAU,QAAQ;AAC7C,aAAO;AAAA,QAAY;AAAA,QAAG,OAAO,MAAM;AAAA,QACjC,YAAY;AAAA,QACZ,UAAU,SAAS,GAAG;AAAE,iBAAO,EAAE,SAAS,CAAC;AAAA,QAAG;AAAA,MAAC;AAAA,IACnD;AAEA,aAAS,YAAY,GAAG,QAAQ,UAAU,QAAQ;AAChD,UAAI,UAAU,CAAC;AACf,UAAI,KAAK,IAAI,cAAc;AAC3B,UAAI,GAAG;AAEP,UAAI,kBAAkB,SAAS,MAAM;AACnC,YAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,YAAI,SAAS,QAAQ,CAAC;AACtB,YAAI,SAAS,SAAS,IAAI;AAC1B,YAAI,WAAW,OAAO,WAAW;AAEjC,YAAI,SAAS,GAAG;AACd,gBAAM,IAAI,MAAM,8DACe,OAAO,cAAc,MAAM;AAAA,QAC5D;AAEA,YAAI,WAAW,OAAO,UAAU;AAC9B,iBAAO,WAAW;AAClB,iBAAO,cAAc;AACrB,aAAG,SAAS,GAAG,QAAQ;AAAA,QACzB;AAAA,MACF;AAEA,QAAE,MAAM,EAAE,QAAQ,SAASA,IAAG;AAC5B,YAAI,WAAWA,OAAM,SAAS,IAAI,OAAO;AACzC,gBAAQA,EAAC,IAAI,EAAE,SAAmB;AAClC,WAAG,IAAIA,IAAG,QAAQ;AAAA,MACpB,CAAC;AAED,aAAO,GAAG,KAAK,IAAI,GAAG;AACpB,YAAI,GAAG,UAAU;AACjB,iBAAS,QAAQ,CAAC;AAClB,YAAI,OAAO,aAAa,OAAO,mBAAmB;AAChD;AAAA,QACF;AAEA,eAAO,CAAC,EAAE,QAAQ,eAAe;AAAA,MACnC;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACpDA;AAAA;AAAA;AAAA,QAAI,WAAW;AAEf,WAAO,UAAU;AAEjB,aAAS,YAAY,GAAG,YAAY,UAAU;AAC5C,aAAO,EAAE,MAAM,EAAE,OAAO,SAAS,KAAK,GAAG;AACvC,YAAI,CAAC,IAAI,SAAS,GAAG,GAAG,YAAY,QAAQ;AAC5C,eAAO;AAAA,MACT,GAAG,CAAC,CAAC;AAAA,IACP;AAAA;AAAA;;;ACTA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,OAAO,GAAG;AACjB,UAAI,QAAQ;AACZ,UAAI,QAAQ,CAAC;AACb,UAAI,UAAU,CAAC;AACf,UAAI,UAAU,CAAC;AAEf,eAAS,IAAI,GAAG;AACd,YAAI,QAAQ,QAAQ,CAAC,IAAI;AAAA,UACvB,SAAS;AAAA,UACT,SAAS;AAAA,UACT,OAAO;AAAA,QACT;AACA,cAAM,KAAK,CAAC;AAEZ,UAAE,WAAW,CAAC,EAAE,QAAQ,SAASC,IAAG;AAClC,cAAI,CAAC,OAAO,OAAO,SAASA,EAAC,GAAG;AAC9B,gBAAIA,EAAC;AACL,kBAAM,UAAU,KAAK,IAAI,MAAM,SAAS,QAAQA,EAAC,EAAE,OAAO;AAAA,UAC5D,WAAW,QAAQA,EAAC,EAAE,SAAS;AAC7B,kBAAM,UAAU,KAAK,IAAI,MAAM,SAAS,QAAQA,EAAC,EAAE,KAAK;AAAA,UAC1D;AAAA,QACF,CAAC;AAED,YAAI,MAAM,YAAY,MAAM,OAAO;AACjC,cAAI,OAAO,CAAC;AACZ,cAAI;AACJ,aAAG;AACD,gBAAI,MAAM,IAAI;AACd,oBAAQ,CAAC,EAAE,UAAU;AACrB,iBAAK,KAAK,CAAC;AAAA,UACb,SAAS,MAAM;AACf,kBAAQ,KAAK,IAAI;AAAA,QACnB;AAAA,MACF;AAEA,QAAE,MAAM,EAAE,QAAQ,SAAS,GAAG;AAC5B,YAAI,CAAC,OAAO,OAAO,SAAS,CAAC,GAAG;AAC9B,cAAI,CAAC;AAAA,QACP;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;AC5CA;AAAA;AAAA;AAAA,QAAI,SAAS;AAEb,WAAO,UAAU;AAEjB,aAAS,WAAW,GAAG;AACrB,aAAO,OAAO,CAAC,EAAE,OAAO,SAAS,MAAM;AACrC,eAAO,KAAK,SAAS,KAAM,KAAK,WAAW,KAAK,EAAE,QAAQ,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MAC5E,CAAC;AAAA,IACH;AAAA;AAAA;;;ACRA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,QAAI,sBAAsB,MAAM;AAEhC,aAAS,cAAc,GAAG,UAAU,QAAQ;AAC1C,aAAO;AAAA,QAAiB;AAAA,QACtB,YAAY;AAAA,QACZ,UAAU,SAAS,GAAG;AAAE,iBAAO,EAAE,SAAS,CAAC;AAAA,QAAG;AAAA,MAAC;AAAA,IACnD;AAEA,aAAS,iBAAiB,GAAG,UAAU,QAAQ;AAC7C,UAAI,UAAU,CAAC;AACf,UAAI,QAAQ,EAAE,MAAM;AAEpB,YAAM,QAAQ,SAAS,GAAG;AACxB,gBAAQ,CAAC,IAAI,CAAC;AACd,gBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE;AAC9B,cAAM,QAAQ,SAAS,GAAG;AACxB,cAAI,MAAM,GAAG;AACX,oBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,OAAO,kBAAkB;AAAA,UACvD;AAAA,QACF,CAAC;AACD,eAAO,CAAC,EAAE,QAAQ,SAAS,MAAM;AAC/B,cAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,cAAI,IAAI,SAAS,IAAI;AACrB,kBAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,GAAG,aAAa,EAAE;AAAA,QAChD,CAAC;AAAA,MACH,CAAC;AAED,YAAM,QAAQ,SAAS,GAAG;AACxB,YAAI,OAAO,QAAQ,CAAC;AACpB,cAAM,QAAQ,SAAS,GAAG;AACxB,cAAI,OAAO,QAAQ,CAAC;AACpB,gBAAM,QAAQ,SAAS,GAAG;AACxB,gBAAI,KAAK,KAAK,CAAC;AACf,gBAAI,KAAK,KAAK,CAAC;AACf,gBAAI,KAAK,KAAK,CAAC;AACf,gBAAI,cAAc,GAAG,WAAW,GAAG;AACnC,gBAAI,cAAc,GAAG,UAAU;AAC7B,iBAAG,WAAW;AACd,iBAAG,cAAc,GAAG;AAAA,YACtB;AAAA,UACF,CAAC;AAAA,QACH,CAAC;AAAA,MACH,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;AC/CA;AAAA;AAAA;AAAA,aAAS,QAAQ,GAAG;AAClB,UAAI,UAAU,CAAC;AACf,UAAI,QAAQ,CAAC;AACb,UAAI,UAAU,CAAC;AAEf,eAAS,MAAM,MAAM;AACnB,YAAI,OAAO,OAAO,OAAO,IAAI,GAAG;AAC9B,gBAAM,IAAI,eAAe;AAAA,QAC3B;AAEA,YAAI,CAAC,OAAO,OAAO,SAAS,IAAI,GAAG;AACjC,gBAAM,IAAI,IAAI;AACd,kBAAQ,IAAI,IAAI;AAChB,YAAE,aAAa,IAAI,EAAE,QAAQ,KAAK;AAClC,iBAAO,MAAM,IAAI;AACjB,kBAAQ,KAAK,IAAI;AAAA,QACnB;AAAA,MACF;AAEA,QAAE,MAAM,EAAE,QAAQ,KAAK;AAEvB,UAAI,OAAO,KAAK,OAAO,EAAE,WAAW,EAAE,UAAU,GAAG;AACjD,cAAM,IAAI,eAAe;AAAA,MAC3B;AAEA,aAAO;AAAA,IACT;AAEA,QAAM,iBAAN,cAA6B,MAAM;AAAA,MACjC,cAAc;AACZ,cAAM,GAAG,SAAS;AAAA,MACpB;AAAA,IACF;AAEA,WAAO,UAAU;AACjB,YAAQ,iBAAiB;AAAA;AAAA;;;ACnCzB;AAAA;AAAA;AAAA,QAAI,UAAU;AAEd,WAAO,UAAU;AAEjB,aAAS,UAAU,GAAG;AACpB,UAAI;AACF,gBAAQ,CAAC;AAAA,MACX,SAAS,GAAG;AACV,YAAI,aAAa,QAAQ,gBAAgB;AACvC,iBAAO;AAAA,QACT;AACA,cAAM;AAAA,MACR;AACA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACdA;AAAA;AAAA;AAAA,WAAO,UAAU;AAUjB,aAAS,IAAI,GAAG,IAAI,OAAO;AACzB,UAAI,CAAC,MAAM,QAAQ,EAAE,GAAG;AACtB,aAAK,CAAC,EAAE;AAAA,MACV;AAEA,UAAI,aAAa,EAAE,WAAW,IAAI,OAAK,EAAE,WAAW,CAAC,IAAI,OAAK,EAAE,UAAU,CAAC;AAC3E,UAAI,YAAY,UAAU,SAAS,eAAe;AAElD,UAAI,MAAM,CAAC;AACX,UAAI,UAAU,CAAC;AACf,SAAG,QAAQ,OAAK;AACd,YAAI,CAAC,EAAE,QAAQ,CAAC,GAAG;AACjB,gBAAM,IAAI,MAAM,+BAA+B,CAAC;AAAA,QAClD;AAEA,kBAAU,GAAG,YAAY,SAAS,GAAG;AAAA,MACvC,CAAC;AAED,aAAO;AAAA,IACT;AAEA,aAAS,aAAa,GAAG,YAAY,SAAS,KAAK;AACjD,UAAI,QAAQ,CAAC,CAAC,GAAG,KAAK,CAAC;AACvB,aAAO,MAAM,SAAS,GAAG;AACvB,YAAI,OAAO,MAAM,IAAI;AACrB,YAAI,KAAK,CAAC,GAAG;AACX,cAAI,KAAK,KAAK,CAAC,CAAC;AAAA,QAClB,OAAO;AACL,cAAI,CAAC,OAAO,OAAO,SAAS,KAAK,CAAC,CAAC,GAAG;AACpC,oBAAQ,KAAK,CAAC,CAAC,IAAI;AACnB,kBAAM,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;AAC1B,yBAAa,WAAW,KAAK,CAAC,CAAC,GAAG,OAAK,MAAM,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,UAC/D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,aAAS,YAAY,GAAG,YAAY,SAAS,KAAK;AAChD,UAAI,QAAQ,CAAC,CAAC;AACd,aAAO,MAAM,SAAS,GAAG;AACvB,YAAI,OAAO,MAAM,IAAI;AACrB,YAAI,CAAC,OAAO,OAAO,SAAS,IAAI,GAAG;AACjC,kBAAQ,IAAI,IAAI;AAChB,cAAI,KAAK,IAAI;AACb,uBAAa,WAAW,IAAI,GAAG,OAAK,MAAM,KAAK,CAAC,CAAC;AAAA,QACnD;AAAA,MACF;AAAA,IACF;AAEA,aAAS,aAAa,OAAO,UAAU;AACrC,UAAI,SAAS,MAAM;AACnB,aAAO,UAAU;AACf,iBAAS,MAAM,MAAM,GAAG,QAAQ,KAAK;AAAA,MACvC;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;AClEA;AAAA;AAAA;AAAA,QAAI,MAAM;AAEV,WAAO,UAAU;AAEjB,aAAS,UAAU,GAAG,IAAI;AACxB,aAAO,IAAI,GAAG,IAAI,MAAM;AAAA,IAC1B;AAAA;AAAA;;;ACNA;AAAA;AAAA;AAAA,QAAI,MAAM;AAEV,WAAO,UAAU;AAEjB,aAAS,SAAS,GAAG,IAAI;AACvB,aAAO,IAAI,GAAG,IAAI,KAAK;AAAA,IACzB;AAAA;AAAA;;;ACNA;AAAA;AAAA;AAAA,QAAI,QAAQ;AACZ,QAAI,gBAAgB;AAEpB,WAAO,UAAU;AAEjB,aAAS,KAAK,GAAG,YAAY;AAC3B,UAAI,SAAS,IAAI,MAAM;AACvB,UAAI,UAAU,CAAC;AACf,UAAI,KAAK,IAAI,cAAc;AAC3B,UAAI;AAEJ,eAAS,gBAAgB,MAAM;AAC7B,YAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AACrC,YAAI,MAAM,GAAG,SAAS,CAAC;AACvB,YAAI,QAAQ,QAAW;AACrB,cAAI,aAAa,WAAW,IAAI;AAChC,cAAI,aAAa,KAAK;AACpB,oBAAQ,CAAC,IAAI;AACb,eAAG,SAAS,GAAG,UAAU;AAAA,UAC3B;AAAA,QACF;AAAA,MACF;AAEA,UAAI,EAAE,UAAU,MAAM,GAAG;AACvB,eAAO;AAAA,MACT;AAEA,QAAE,MAAM,EAAE,QAAQ,SAASC,IAAG;AAC5B,WAAG,IAAIA,IAAG,OAAO,iBAAiB;AAClC,eAAO,QAAQA,EAAC;AAAA,MAClB,CAAC;AAGD,SAAG,SAAS,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC;AAE3B,UAAI,OAAO;AACX,aAAO,GAAG,KAAK,IAAI,GAAG;AACpB,YAAI,GAAG,UAAU;AACjB,YAAI,OAAO,OAAO,SAAS,CAAC,GAAG;AAC7B,iBAAO,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAAA,QAC9B,WAAW,MAAM;AACf,gBAAM,IAAI,MAAM,mCAAmC,CAAC;AAAA,QACtD,OAAO;AACL,iBAAO;AAAA,QACT;AAEA,UAAE,UAAU,CAAC,EAAE,QAAQ,eAAe;AAAA,MACxC;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;;;AClDA;AAAA;AAAA;AAAA,WAAO,UAAU;AAAA,MACf,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,eAAe;AAAA,MACf,WAAW;AAAA,MACX,WAAW;AAAA,MACX,UAAU;AAAA,MACV,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,SAAS;AAAA,IACX;AAAA;AAAA;;;ACZA;AAAA;AAAA;AA8BA,QAAI,MAAM;AAEV,WAAO,UAAU;AAAA,MACf,OAAO,IAAI;AAAA,MACX,MAAM;AAAA,MACN,KAAK;AAAA,MACL,SAAS,IAAI;AAAA,IACf;AAAA;AAAA;;;ACrCA;AAAA;AAAA;AAKA,QAAM,OAAN,MAAW;AAAA,MACT,cAAc;AACZ,YAAI,WAAW,CAAC;AAChB,iBAAS,QAAQ,SAAS,QAAQ;AAClC,aAAK,YAAY;AAAA,MACnB;AAAA,MAEA,UAAU;AACR,YAAI,WAAW,KAAK;AACpB,YAAI,QAAQ,SAAS;AACrB,YAAI,UAAU,UAAU;AACtB,iBAAO,KAAK;AACZ,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,MAEA,QAAQ,OAAO;AACb,YAAI,WAAW,KAAK;AACpB,YAAI,MAAM,SAAS,MAAM,OAAO;AAC9B,iBAAO,KAAK;AAAA,QACd;AACA,cAAM,QAAQ,SAAS;AACvB,iBAAS,MAAM,QAAQ;AACvB,iBAAS,QAAQ;AACjB,cAAM,QAAQ;AAAA,MAChB;AAAA,MAEA,WAAW;AACT,YAAI,OAAO,CAAC;AACZ,YAAI,WAAW,KAAK;AACpB,YAAI,OAAO,SAAS;AACpB,eAAO,SAAS,UAAU;AACxB,eAAK,KAAK,KAAK,UAAU,MAAM,cAAc,CAAC;AAC9C,iBAAO,KAAK;AAAA,QACd;AACA,eAAO,MAAM,KAAK,KAAK,IAAI,IAAI;AAAA,MACjC;AAAA,IACF;AAEA,aAAS,OAAO,OAAO;AACrB,YAAM,MAAM,QAAQ,MAAM;AAC1B,YAAM,MAAM,QAAQ,MAAM;AAC1B,aAAO,MAAM;AACb,aAAO,MAAM;AAAA,IACf;AAEA,aAAS,eAAe,GAAG,GAAG;AAC5B,UAAI,MAAM,WAAW,MAAM,SAAS;AAClC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,UAAU;AAAA;AAAA;;;ACzDjB;AAAA;AAAA;AAAA,QAAI,QAAQ,mBAA6B;AACzC,QAAI,OAAO;AASX,WAAO,UAAU;AAEjB,QAAI,oBAAoB,MAAM;AAE9B,aAAS,UAAU,GAAG,UAAU;AAC9B,UAAI,EAAE,UAAU,KAAK,GAAG;AACtB,eAAO,CAAC;AAAA,MACV;AACA,UAAI,QAAQ,WAAW,GAAG,YAAY,iBAAiB;AACvD,UAAI,UAAU,YAAY,MAAM,OAAO,MAAM,SAAS,MAAM,OAAO;AAGnE,aAAO,QAAQ,QAAQ,OAAK,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;AAAA,IAClD;AAEA,aAAS,YAAY,GAAG,SAAS,SAAS;AACxC,UAAI,UAAU,CAAC;AACf,UAAI,UAAU,QAAQ,QAAQ,SAAS,CAAC;AACxC,UAAI,QAAQ,QAAQ,CAAC;AAErB,UAAI;AACJ,aAAO,EAAE,UAAU,GAAG;AACpB,eAAQ,QAAQ,MAAM,QAAQ,GAAM;AAAE,qBAAW,GAAG,SAAS,SAAS,KAAK;AAAA,QAAG;AAC9E,eAAQ,QAAQ,QAAQ,QAAQ,GAAI;AAAE,qBAAW,GAAG,SAAS,SAAS,KAAK;AAAA,QAAG;AAC9E,YAAI,EAAE,UAAU,GAAG;AACjB,mBAAS,IAAI,QAAQ,SAAS,GAAG,IAAI,GAAG,EAAE,GAAG;AAC3C,oBAAQ,QAAQ,CAAC,EAAE,QAAQ;AAC3B,gBAAI,OAAO;AACT,wBAAU,QAAQ,OAAO,WAAW,GAAG,SAAS,SAAS,OAAO,IAAI,CAAC;AACrE;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,GAAG,SAAS,SAAS,OAAO,qBAAqB;AACnE,UAAI,UAAU,sBAAsB,CAAC,IAAI;AAEzC,QAAE,QAAQ,MAAM,CAAC,EAAE,QAAQ,UAAQ;AACjC,YAAI,SAAS,EAAE,KAAK,IAAI;AACxB,YAAI,SAAS,EAAE,KAAK,KAAK,CAAC;AAE1B,YAAI,qBAAqB;AACvB,kBAAQ,KAAK,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAE,CAAC;AAAA,QACvC;AAEA,eAAO,OAAO;AACd,qBAAa,SAAS,SAAS,MAAM;AAAA,MACvC,CAAC;AAED,QAAE,SAAS,MAAM,CAAC,EAAE,QAAQ,UAAQ;AAClC,YAAI,SAAS,EAAE,KAAK,IAAI;AACxB,YAAI,IAAI,KAAK;AACb,YAAI,SAAS,EAAE,KAAK,CAAC;AACrB,eAAO,IAAI,KAAK;AAChB,qBAAa,SAAS,SAAS,MAAM;AAAA,MACvC,CAAC;AAED,QAAE,WAAW,MAAM,CAAC;AAEpB,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,GAAG,UAAU;AAC/B,UAAI,WAAW,IAAI,MAAM;AACzB,UAAI,QAAQ;AACZ,UAAI,SAAS;AAEb,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,iBAAS,QAAQ,GAAG,EAAE,GAAM,MAAM,GAAG,KAAK,EAAE,CAAC;AAAA,MAC/C,CAAC;AAID,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,aAAa,SAAS,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;AAC5C,YAAI,SAAS,SAAS,CAAC;AACvB,YAAI,aAAa,aAAa;AAC9B,iBAAS,QAAQ,EAAE,GAAG,EAAE,GAAG,UAAU;AACrC,iBAAS,KAAK,IAAI,QAAQ,SAAS,KAAK,EAAE,CAAC,EAAE,OAAO,MAAM;AAC1D,gBAAS,KAAK,IAAI,OAAQ,SAAS,KAAK,EAAE,CAAC,EAAE,IAAI,KAAM,MAAM;AAAA,MAC/D,CAAC;AAED,UAAI,UAAU,MAAM,SAAS,QAAQ,CAAC,EAAE,IAAI,MAAM,IAAI,KAAK,CAAC;AAC5D,UAAI,UAAU,QAAQ;AAEtB,eAAS,MAAM,EAAE,QAAQ,OAAK;AAC5B,qBAAa,SAAS,SAAS,SAAS,KAAK,CAAC,CAAC;AAAA,MACjD,CAAC;AAED,aAAO,EAAE,OAAO,UAAU,SAAkB,QAAiB;AAAA,IAC/D;AAEA,aAAS,aAAa,SAAS,SAAS,OAAO;AAC7C,UAAI,CAAC,MAAM,KAAK;AACd,gBAAQ,CAAC,EAAE,QAAQ,KAAK;AAAA,MAC1B,WAAW,CAAC,MAAM,IAAI,GAAG;AACvB,gBAAQ,QAAQ,SAAS,CAAC,EAAE,QAAQ,KAAK;AAAA,MAC3C,OAAO;AACL,gBAAQ,MAAM,MAAM,MAAM,IAAI,IAAI,OAAO,EAAE,QAAQ,KAAK;AAAA,MAC1D;AAAA,IACF;AAEA,aAAS,MAAM,OAAO;AACpB,YAAMC,SAAQ,CAAC;AACf,eAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,QAAAA,OAAM,KAAK,CAAC;AAAA,MACd;AAEA,aAAOA;AAAA,IACT;AAAA;AAAA;;;AC3HA;AAAA;AAAA;AAIA,QAAI,QAAQ,mBAA6B;AAEzC,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAKA,aAAS,aAAa,GAAG,MAAM,OAAO,MAAM;AAC1C,UAAI,IAAI;AACR,aAAO,EAAE,QAAQ,CAAC,GAAG;AACnB,YAAI,SAAS,IAAI;AAAA,MACnB;AAEA,YAAM,QAAQ;AACd,QAAE,QAAQ,GAAG,KAAK;AAClB,aAAO;AAAA,IACT;AAMA,aAAS,SAAS,GAAG;AACnB,UAAI,aAAa,IAAI,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC;AAC/C,QAAE,MAAM,EAAE,QAAQ,OAAK,WAAW,QAAQ,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AACvD,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,cAAc,WAAW,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAE;AACtE,YAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,mBAAW,QAAQ,EAAE,GAAG,EAAE,GAAG;AAAA,UAC3B,QAAQ,YAAY,SAAS,MAAM;AAAA,UACnC,QAAQ,KAAK,IAAI,YAAY,QAAQ,MAAM,MAAM;AAAA,QACnD,CAAC;AAAA,MACH,CAAC;AACD,aAAO;AAAA,IACT;AAEA,aAAS,mBAAmB,GAAG;AAC7B,UAAI,aAAa,IAAI,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC;AAC/E,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,CAAC,EAAE,SAAS,CAAC,EAAE,QAAQ;AACzB,qBAAW,QAAQ,GAAG,EAAE,KAAK,CAAC,CAAC;AAAA,QACjC;AAAA,MACF,CAAC;AACD,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,mBAAW,QAAQ,GAAG,EAAE,KAAK,CAAC,CAAC;AAAA,MACjC,CAAC;AACD,aAAO;AAAA,IACT;AAEA,aAAS,iBAAiB,GAAG;AAC3B,UAAI,YAAY,EAAE,MAAM,EAAE,IAAI,OAAK;AACjC,YAAI,OAAO,CAAC;AACZ,UAAE,SAAS,CAAC,EAAE,QAAQ,OAAK;AACzB,eAAK,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC,KAAK,KAAK,EAAE,KAAK,CAAC,EAAE;AAAA,QAC3C,CAAC;AACD,eAAO;AAAA,MACT,CAAC;AACD,aAAO,UAAU,EAAE,MAAM,GAAG,SAAS;AAAA,IACvC;AAEA,aAAS,mBAAmB,GAAG;AAC7B,UAAI,YAAY,EAAE,MAAM,EAAE,IAAI,OAAK;AACjC,YAAI,QAAQ,CAAC;AACb,UAAE,QAAQ,CAAC,EAAE,QAAQ,OAAK;AACxB,gBAAM,EAAE,CAAC,KAAK,MAAM,EAAE,CAAC,KAAK,KAAK,EAAE,KAAK,CAAC,EAAE;AAAA,QAC7C,CAAC;AACD,eAAO;AAAA,MACT,CAAC;AACD,aAAO,UAAU,EAAE,MAAM,GAAG,SAAS;AAAA,IACvC;AAMA,aAAS,cAAc,MAAM,OAAO;AAClC,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK;AAIb,UAAI,KAAK,MAAM,IAAI;AACnB,UAAI,KAAK,MAAM,IAAI;AACnB,UAAI,IAAI,KAAK,QAAQ;AACrB,UAAI,IAAI,KAAK,SAAS;AAEtB,UAAI,CAAC,MAAM,CAAC,IAAI;AACd,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AAEA,UAAI,IAAI;AACR,UAAI,KAAK,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,EAAE,IAAI,GAAG;AAEvC,YAAI,KAAK,GAAG;AACV,cAAI,CAAC;AAAA,QACP;AACA,aAAK,IAAI,KAAK;AACd,aAAK;AAAA,MACP,OAAO;AAEL,YAAI,KAAK,GAAG;AACV,cAAI,CAAC;AAAA,QACP;AACA,aAAK;AACL,aAAK,IAAI,KAAK;AAAA,MAChB;AAEA,aAAO,EAAE,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG;AAAA,IAChC;AAMA,aAAS,iBAAiB,GAAG;AAC3B,UAAI,WAAW,MAAM,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC;AACjD,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,OAAO,KAAK;AAChB,YAAI,SAAS,QAAW;AACtB,mBAAS,IAAI,EAAE,KAAK,KAAK,IAAI;AAAA,QAC/B;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AAMA,aAAS,eAAe,GAAG;AACzB,UAAI,YAAY,EAAE,MAAM,EAAE,IAAI,OAAK;AACjC,YAAI,OAAO,EAAE,KAAK,CAAC,EAAE;AACrB,YAAI,SAAS,QAAW;AACtB,iBAAO,OAAO;AAAA,QAChB;AAEA,eAAO;AAAA,MACT,CAAC;AACD,UAAI,MAAM,kBAAkB,KAAK,KAAK,SAAS;AAC/C,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,OAAO,OAAO,MAAM,MAAM,GAAG;AAC/B,eAAK,QAAQ;AAAA,QACf;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,iBAAiB,GAAG;AAE3B,UAAI,YAAY,EAAE,MAAM,EAAE,IAAI,OAAK,EAAE,KAAK,CAAC,EAAE,IAAI;AACjD,UAAI,SAAS,kBAAkB,KAAK,KAAK,SAAS;AAElD,UAAI,SAAS,CAAC;AACd,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC,EAAE,OAAO;AAC5B,YAAI,CAAC,OAAO,IAAI,GAAG;AACjB,iBAAO,IAAI,IAAI,CAAC;AAAA,QAClB;AACA,eAAO,IAAI,EAAE,KAAK,CAAC;AAAA,MACrB,CAAC;AAED,UAAI,QAAQ;AACZ,UAAI,iBAAiB,EAAE,MAAM,EAAE;AAC/B,YAAM,KAAK,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM;AACpC,YAAI,OAAO,UAAa,IAAI,mBAAmB,GAAG;AAChD,YAAE;AAAA,QACJ,WAAW,OAAO,UAAa,OAAO;AACpC,aAAG,QAAQ,OAAK,EAAE,KAAK,CAAC,EAAE,QAAQ,KAAK;AAAA,QACzC;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,cAAc,GAAG,QAAQ,MAAM,OAAO;AAC7C,UAAI,OAAO;AAAA,QACT,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AACA,UAAI,UAAU,UAAU,GAAG;AACzB,aAAK,OAAO;AACZ,aAAK,QAAQ;AAAA,MACf;AACA,aAAO,aAAa,GAAG,UAAU,MAAM,MAAM;AAAA,IAC/C;AAEA,aAAS,cAAc,OAAO,YAAY,oBAAoB;AAC5D,YAAM,SAAS,CAAC;AAChB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,WAAW;AAChD,cAAM,QAAQ,MAAM,MAAM,GAAG,IAAI,SAAS;AAC1C,eAAO,KAAK,KAAK;AAAA,MACnB;AACA,aAAO;AAAA,IACT;AAEA,QAAM,qBAAqB;AAE3B,aAAS,kBAAkB,IAAI,WAAW;AACxC,UAAG,UAAU,SAAS,oBAAoB;AACxC,cAAM,SAAS,cAAc,SAAS;AACtC,eAAO,GAAG,MAAM,MAAM,OAAO,IAAI,WAAS,GAAG,MAAM,MAAM,KAAK,CAAC,CAAC;AAAA,MAClE,OAAO;AACL,eAAO,GAAG,MAAM,MAAM,SAAS;AAAA,MACjC;AAAA,IACF;AAEA,aAAS,QAAQ,GAAG;AAClB,YAAM,QAAQ,EAAE,MAAM;AACtB,YAAM,YAAY,MAAM,IAAI,OAAK;AAC/B,YAAI,OAAO,EAAE,KAAK,CAAC,EAAE;AACrB,YAAI,SAAS,QAAW;AACtB,iBAAO,OAAO;AAAA,QAChB;AACA,eAAO;AAAA,MACT,CAAC;AAED,aAAO,kBAAkB,KAAK,KAAK,SAAS;AAAA,IAC9C;AAOA,aAAS,UAAU,YAAY,IAAI;AACjC,UAAI,SAAS,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE;AAChC,iBAAW,QAAQ,WAAS;AAC1B,YAAI,GAAG,KAAK,GAAG;AACb,iBAAO,IAAI,KAAK,KAAK;AAAA,QACvB,OAAO;AACL,iBAAO,IAAI,KAAK,KAAK;AAAA,QACvB;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AAMA,aAAS,KAAK,MAAM,IAAI;AACtB,UAAI,QAAQ,KAAK,IAAI;AACrB,UAAI;AACF,eAAO,GAAG;AAAA,MACZ,UAAE;AACA,gBAAQ,IAAI,OAAO,aAAa,KAAK,IAAI,IAAI,SAAS,IAAI;AAAA,MAC5D;AAAA,IACF;AAEA,aAAS,OAAO,MAAM,IAAI;AACxB,aAAO,GAAG;AAAA,IACZ;AAEA,QAAI,YAAY;AAChB,aAAS,SAAS,QAAQ;AACxB,UAAI,KAAK,EAAE;AACX,aAAO,UAAU,KAAK;AAAA,IACxB;AAEA,aAAS,MAAM,OAAO,OAAO,OAAO,GAAG;AACrC,UAAI,SAAS,MAAM;AACjB,gBAAQ;AACR,gBAAQ;AAAA,MACV;AAEA,UAAI,SAAS,CAAC,MAAM,IAAI;AACxB,UAAI,OAAO,GAAG;AACZ,iBAAS,CAAC,MAAM,QAAQ;AAAA,MAC1B;AAEA,YAAMC,SAAQ,CAAC;AACf,eAAS,IAAI,OAAO,OAAO,CAAC,GAAG,KAAK,MAAM;AACxC,QAAAA,OAAM,KAAK,CAAC;AAAA,MACd;AAEA,aAAOA;AAAA,IACT;AAEA,aAAS,KAAK,QAAQ,MAAM;AAC1B,YAAM,OAAO,CAAC;AACd,iBAAW,OAAO,MAAM;AACtB,YAAI,OAAO,GAAG,MAAM,QAAW;AAC7B,eAAK,GAAG,IAAI,OAAO,GAAG;AAAA,QACxB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,UAAU,KAAK,YAAY;AAClC,UAAI,OAAO;AACX,UAAI,OAAO,eAAe,UAAU;AAClC,eAAO,CAAC,QAAQ,IAAI,UAAU;AAAA,MAChC;AAEA,aAAO,OAAO,QAAQ,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM;AACjD,YAAI,CAAC,IAAI,KAAK,GAAG,CAAC;AAClB,eAAO;AAAA,MACT,GAAG,CAAC,CAAC;AAAA,IACP;AAEA,aAAS,UAAU,OAAO,QAAQ;AAChC,aAAO,MAAM,OAAO,CAAC,KAAK,KAAK,MAAM;AACnC,YAAI,GAAG,IAAI,OAAO,CAAC;AACnB,eAAO;AAAA,MACT,GAAG,CAAC,CAAC;AAAA,IACP;AAAA;AAAA;;;AC1UA;AAAA;AAAA;AAEA,QAAI,YAAY;AAChB,QAAI,WAAW,eAAkB;AAEjC,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAEA,aAAS,IAAI,GAAG;AACd,UAAI,MAAO,EAAE,MAAM,EAAE,cAAc,WAC/B,UAAU,GAAG,SAAS,CAAC,CAAC,IACxB,OAAO,CAAC;AACZ,UAAI,QAAQ,OAAK;AACf,YAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,UAAE,WAAW,CAAC;AACd,cAAM,cAAc,EAAE;AACtB,cAAM,WAAW;AACjB,UAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,OAAO,SAAS,KAAK,CAAC;AAAA,MAC5C,CAAC;AAED,eAAS,SAASC,IAAG;AACnB,eAAO,OAAK;AACV,iBAAOA,GAAE,KAAK,CAAC,EAAE;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AAEA,aAAS,OAAO,GAAG;AACjB,UAAI,MAAM,CAAC;AACX,UAAI,QAAQ,CAAC;AACb,UAAI,UAAU,CAAC;AAEf,eAAS,IAAI,GAAG;AACd,YAAI,OAAO,OAAO,SAAS,CAAC,GAAG;AAC7B;AAAA,QACF;AACA,gBAAQ,CAAC,IAAI;AACb,cAAM,CAAC,IAAI;AACX,UAAE,SAAS,CAAC,EAAE,QAAQ,OAAK;AACzB,cAAI,OAAO,OAAO,OAAO,EAAE,CAAC,GAAG;AAC7B,gBAAI,KAAK,CAAC;AAAA,UACZ,OAAO;AACL,gBAAI,EAAE,CAAC;AAAA,UACT;AAAA,QACF,CAAC;AACD,eAAO,MAAM,CAAC;AAAA,MAChB;AAEA,QAAE,MAAM,EAAE,QAAQ,GAAG;AACrB,aAAO;AAAA,IACT;AAEA,aAAS,KAAK,GAAG;AACf,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,YAAI,MAAM,UAAU;AAClB,YAAE,WAAW,CAAC;AAEd,cAAI,cAAc,MAAM;AACxB,iBAAO,MAAM;AACb,iBAAO,MAAM;AACb,YAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,OAAO,WAAW;AAAA,QACxC;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;;;AClEA;AAAA;AAAA;AAEA,QAAI,OAAO;AAEX,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAkBA,aAAS,IAAI,GAAG;AACd,QAAE,MAAM,EAAE,cAAc,CAAC;AACzB,QAAE,MAAM,EAAE,QAAQ,UAAQ,cAAc,GAAG,IAAI,CAAC;AAAA,IAClD;AAEA,aAAS,cAAc,GAAG,GAAG;AAC3B,UAAI,IAAI,EAAE;AACV,UAAI,QAAQ,EAAE,KAAK,CAAC,EAAE;AACtB,UAAI,IAAI,EAAE;AACV,UAAI,QAAQ,EAAE,KAAK,CAAC,EAAE;AACtB,UAAI,OAAO,EAAE;AACb,UAAI,YAAY,EAAE,KAAK,CAAC;AACxB,UAAI,YAAY,UAAU;AAE1B,UAAI,UAAU,QAAQ,EAAG;AAEzB,QAAE,WAAW,CAAC;AAEd,UAAI,OAAO,OAAO;AAClB,WAAK,IAAI,GAAG,EAAE,OAAO,QAAQ,OAAO,EAAE,GAAG,EAAE,OAAO;AAChD,kBAAU,SAAS,CAAC;AACpB,gBAAQ;AAAA,UACN,OAAO;AAAA,UAAG,QAAQ;AAAA,UAClB;AAAA,UAAsB,SAAS;AAAA,UAC/B,MAAM;AAAA,QACR;AACA,gBAAQ,KAAK,aAAa,GAAG,QAAQ,OAAO,IAAI;AAChD,YAAI,UAAU,WAAW;AACvB,gBAAM,QAAQ,UAAU;AACxB,gBAAM,SAAS,UAAU;AACzB,gBAAM,QAAQ;AACd,gBAAM,WAAW,UAAU;AAAA,QAC7B;AACA,UAAE,QAAQ,GAAG,OAAO,EAAE,QAAQ,UAAU,OAAO,GAAG,IAAI;AACtD,YAAI,MAAM,GAAG;AACX,YAAE,MAAM,EAAE,YAAY,KAAK,KAAK;AAAA,QAClC;AACA,YAAI;AAAA,MACN;AAEA,QAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,UAAU,OAAO,GAAG,IAAI;AAAA,IACpD;AAEA,aAAS,KAAK,GAAG;AACf,QAAE,MAAM,EAAE,YAAY,QAAQ,OAAK;AACjC,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,YAAY,KAAK;AACrB,YAAI;AACJ,UAAE,QAAQ,KAAK,SAAS,SAAS;AACjC,eAAO,KAAK,OAAO;AACjB,cAAI,EAAE,WAAW,CAAC,EAAE,CAAC;AACrB,YAAE,WAAW,CAAC;AACd,oBAAU,OAAO,KAAK,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAE,CAAC;AAC9C,cAAI,KAAK,UAAU,cAAc;AAC/B,sBAAU,IAAI,KAAK;AACnB,sBAAU,IAAI,KAAK;AACnB,sBAAU,QAAQ,KAAK;AACvB,sBAAU,SAAS,KAAK;AAAA,UAC1B;AACA,cAAI;AACJ,iBAAO,EAAE,KAAK,CAAC;AAAA,QACjB;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;;;ACxFA,IAAAC,gBAAA;AAAA;AAAA;AAEA,QAAM,EAAE,kBAAkB,IAAI;AAE9B,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAuBA,aAAS,YAAY,GAAG;AACtB,UAAI,UAAU,CAAC;AAEf,eAAS,IAAI,GAAG;AACd,YAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,YAAI,OAAO,OAAO,SAAS,CAAC,GAAG;AAC7B,iBAAO,MAAM;AAAA,QACf;AACA,gBAAQ,CAAC,IAAI;AAEb,YAAI,kBAAkB,EAAE,SAAS,CAAC,EAAE,IAAI,OAAK;AAC3C,cAAI,KAAK,MAAM;AACb,mBAAO,OAAO;AAAA,UAChB;AAEA,iBAAO,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;AAAA,QAC9B,CAAC;AAED,YAAI,OAAO,kBAAkB,KAAK,KAAK,eAAe;AAEtD,YAAI,SAAS,OAAO,mBAAmB;AACrC,iBAAO;AAAA,QACT;AAEA,eAAQ,MAAM,OAAO;AAAA,MACvB;AAEA,QAAE,QAAQ,EAAE,QAAQ,GAAG;AAAA,IACzB;AAMA,aAAS,MAAM,GAAG,GAAG;AACnB,aAAO,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE;AAAA,IACzD;AAAA;AAAA;;;AClEA;AAAA;AAAA;AAEA,QAAI,QAAQ,mBAA6B;AACzC,QAAI,QAAQ,gBAAkB;AAE9B,WAAO,UAAU;AA2BjB,aAAS,aAAa,GAAG;AACvB,UAAI,IAAI,IAAI,MAAM,EAAE,UAAU,MAAM,CAAC;AAGrC,UAAI,QAAQ,EAAE,MAAM,EAAE,CAAC;AACvB,UAAI,OAAO,EAAE,UAAU;AACvB,QAAE,QAAQ,OAAO,CAAC,CAAC;AAEnB,UAAI,MAAM;AACV,aAAO,UAAU,GAAG,CAAC,IAAI,MAAM;AAC7B,eAAO,iBAAiB,GAAG,CAAC;AAC5B,gBAAQ,EAAE,QAAQ,KAAK,CAAC,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI;AAC3D,mBAAW,GAAG,GAAG,KAAK;AAAA,MACxB;AAEA,aAAO;AAAA,IACT;AAMA,aAAS,UAAU,GAAG,GAAG;AACvB,eAAS,IAAI,GAAG;AACd,UAAE,UAAU,CAAC,EAAE,QAAQ,OAAK;AAC1B,cAAI,QAAQ,EAAE,GACZ,IAAK,MAAM,QAAS,EAAE,IAAI;AAC5B,cAAI,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG;AACjC,cAAE,QAAQ,GAAG,CAAC,CAAC;AACf,cAAE,QAAQ,GAAG,GAAG,CAAC,CAAC;AAClB,gBAAI,CAAC;AAAA,UACP;AAAA,QACF,CAAC;AAAA,MACH;AAEA,QAAE,MAAM,EAAE,QAAQ,GAAG;AACrB,aAAO,EAAE,UAAU;AAAA,IACrB;AAMA,aAAS,iBAAiB,GAAG,GAAG;AAC9B,YAAM,QAAQ,EAAE,MAAM;AAEtB,aAAO,MAAM,OAAO,CAAC,KAAK,SAAS;AACjC,YAAI,YAAY,OAAO;AACvB,YAAI,EAAE,QAAQ,KAAK,CAAC,MAAM,EAAE,QAAQ,KAAK,CAAC,GAAG;AAC3C,sBAAY,MAAM,GAAG,IAAI;AAAA,QAC3B;AAEA,YAAI,YAAY,IAAI,CAAC,GAAG;AACtB,iBAAO,CAAC,WAAW,IAAI;AAAA,QACzB;AAEA,eAAO;AAAA,MACT,GAAG,CAAC,OAAO,mBAAmB,IAAI,CAAC,EAAE,CAAC;AAAA,IACxC;AAEA,aAAS,WAAW,GAAG,GAAG,OAAO;AAC/B,QAAE,MAAM,EAAE,QAAQ,OAAK,EAAE,KAAK,CAAC,EAAE,QAAQ,KAAK;AAAA,IAChD;AAAA;AAAA;;;AC9FA;AAAA;AAAA;AAEA,QAAI,eAAe;AACnB,QAAI,QAAQ,gBAAkB;AAC9B,QAAI,WAAW,gBAAkB;AACjC,QAAI,WAAW,mBAA6B,IAAI;AAChD,QAAI,YAAY,mBAA6B,IAAI;AACjD,QAAI,WAAW,eAAmB;AAElC,WAAO,UAAU;AAGjB,mBAAe,mBAAmB;AAClC,mBAAe,gBAAgB;AAC/B,mBAAe,eAAe;AAC9B,mBAAe,YAAY;AAC3B,mBAAe,YAAY;AAC3B,mBAAe,gBAAgB;AAmC/B,aAAS,eAAe,GAAG;AACzB,UAAI,SAAS,CAAC;AACd,eAAS,CAAC;AACV,UAAI,IAAI,aAAa,CAAC;AACtB,uBAAiB,CAAC;AAClB,oBAAc,GAAG,CAAC;AAElB,UAAI,GAAG;AACP,aAAQ,IAAI,UAAU,CAAC,GAAI;AACzB,YAAI,UAAU,GAAG,GAAG,CAAC;AACrB,sBAAc,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1B;AAAA,IACF;AAKA,aAAS,cAAc,GAAG,GAAG;AAC3B,UAAI,KAAK,UAAU,GAAG,EAAE,MAAM,CAAC;AAC/B,WAAK,GAAG,MAAM,GAAG,GAAG,SAAS,CAAC;AAC9B,SAAG,QAAQ,OAAK,eAAe,GAAG,GAAG,CAAC,CAAC;AAAA,IACzC;AAEA,aAAS,eAAe,GAAG,GAAG,OAAO;AACnC,UAAI,WAAW,EAAE,KAAK,KAAK;AAC3B,UAAI,SAAS,SAAS;AACtB,QAAE,KAAK,OAAO,MAAM,EAAE,WAAW,aAAa,GAAG,GAAG,KAAK;AAAA,IAC3D;AAMA,aAAS,aAAa,GAAG,GAAG,OAAO;AACjC,UAAI,WAAW,EAAE,KAAK,KAAK;AAC3B,UAAI,SAAS,SAAS;AAEtB,UAAI,cAAc;AAElB,UAAI,YAAY,EAAE,KAAK,OAAO,MAAM;AAEpC,UAAI,WAAW;AAEf,UAAI,CAAC,WAAW;AACd,sBAAc;AACd,oBAAY,EAAE,KAAK,QAAQ,KAAK;AAAA,MAClC;AAEA,iBAAW,UAAU;AAErB,QAAE,UAAU,KAAK,EAAE,QAAQ,OAAK;AAC9B,YAAI,YAAY,EAAE,MAAM,OACtB,QAAQ,YAAY,EAAE,IAAI,EAAE;AAE9B,YAAI,UAAU,QAAQ;AACpB,cAAI,eAAe,cAAc,aAC/B,cAAc,EAAE,KAAK,CAAC,EAAE;AAE1B,sBAAY,eAAe,cAAc,CAAC;AAC1C,cAAI,WAAW,GAAG,OAAO,KAAK,GAAG;AAC/B,gBAAI,gBAAgB,EAAE,KAAK,OAAO,KAAK,EAAE;AACzC,wBAAY,eAAe,CAAC,gBAAgB;AAAA,UAC9C;AAAA,QACF;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAEA,aAAS,iBAAiB,MAAM,MAAM;AACpC,UAAI,UAAU,SAAS,GAAG;AACxB,eAAO,KAAK,MAAM,EAAE,CAAC;AAAA,MACvB;AACA,sBAAgB,MAAM,CAAC,GAAG,GAAG,IAAI;AAAA,IACnC;AAEA,aAAS,gBAAgB,MAAM,SAAS,SAAS,GAAG,QAAQ;AAC1D,UAAI,MAAM;AACV,UAAI,QAAQ,KAAK,KAAK,CAAC;AAEvB,cAAQ,CAAC,IAAI;AACb,WAAK,UAAU,CAAC,EAAE,QAAQ,OAAK;AAC7B,YAAI,CAAC,OAAO,OAAO,SAAS,CAAC,GAAG;AAC9B,oBAAU,gBAAgB,MAAM,SAAS,SAAS,GAAG,CAAC;AAAA,QACxD;AAAA,MACF,CAAC;AAED,YAAM,MAAM;AACZ,YAAM,MAAM;AACZ,UAAI,QAAQ;AACV,cAAM,SAAS;AAAA,MACjB,OAAO;AAEL,eAAO,MAAM;AAAA,MACf;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,UAAU,MAAM;AACvB,aAAO,KAAK,MAAM,EAAE,KAAK,OAAK,KAAK,KAAK,CAAC,EAAE,WAAW,CAAC;AAAA,IACzD;AAEA,aAAS,UAAU,GAAG,GAAG,MAAM;AAC7B,UAAI,IAAI,KAAK;AACb,UAAI,IAAI,KAAK;AAKb,UAAI,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG;AACpB,YAAI,KAAK;AACT,YAAI,KAAK;AAAA,MACX;AAEA,UAAI,SAAS,EAAE,KAAK,CAAC;AACrB,UAAI,SAAS,EAAE,KAAK,CAAC;AACrB,UAAI,YAAY;AAChB,UAAI,OAAO;AAIX,UAAI,OAAO,MAAM,OAAO,KAAK;AAC3B,oBAAY;AACZ,eAAO;AAAA,MACT;AAEA,UAAI,aAAa,EAAE,MAAM,EAAE,OAAO,CAAAC,UAAQ;AACxC,eAAO,SAAS,aAAa,GAAG,EAAE,KAAKA,MAAK,CAAC,GAAG,SAAS,KAClD,SAAS,aAAa,GAAG,EAAE,KAAKA,MAAK,CAAC,GAAG,SAAS;AAAA,MAC3D,CAAC;AAED,aAAO,WAAW,OAAO,CAAC,KAAKA,UAAS;AACtC,YAAI,MAAM,GAAGA,KAAI,IAAI,MAAM,GAAG,GAAG,GAAG;AAClC,iBAAOA;AAAA,QACT;AAEA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,aAAS,cAAc,GAAG,GAAG,GAAG,GAAG;AACjC,UAAI,IAAI,EAAE;AACV,UAAI,IAAI,EAAE;AACV,QAAE,WAAW,GAAG,CAAC;AACjB,QAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACtB,uBAAiB,CAAC;AAClB,oBAAc,GAAG,CAAC;AAClB,kBAAY,GAAG,CAAC;AAAA,IAClB;AAEA,aAAS,YAAY,GAAG,GAAG;AACzB,UAAI,OAAO,EAAE,MAAM,EAAE,KAAK,OAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM;AAChD,UAAI,KAAK,SAAS,GAAG,IAAI;AACzB,WAAK,GAAG,MAAM,CAAC;AACf,SAAG,QAAQ,OAAK;AACd,YAAI,SAAS,EAAE,KAAK,CAAC,EAAE,QACrB,OAAO,EAAE,KAAK,GAAG,MAAM,GACvB,UAAU;AAEZ,YAAI,CAAC,MAAM;AACT,iBAAO,EAAE,KAAK,QAAQ,CAAC;AACvB,oBAAU;AAAA,QACZ;AAEA,UAAE,KAAK,CAAC,EAAE,OAAO,EAAE,KAAK,MAAM,EAAE,QAAQ,UAAU,KAAK,SAAS,CAAC,KAAK;AAAA,MACxE,CAAC;AAAA,IACH;AAKA,aAAS,WAAW,MAAM,GAAG,GAAG;AAC9B,aAAO,KAAK,QAAQ,GAAG,CAAC;AAAA,IAC1B;AAMA,aAAS,aAAa,MAAM,QAAQ,WAAW;AAC7C,aAAO,UAAU,OAAO,OAAO,OAAO,OAAO,OAAO,UAAU;AAAA,IAChE;AAAA;AAAA;;;AC1OA;AAAA;AAAA;AAEA,QAAI,WAAW;AACf,QAAI,cAAc,SAAS;AAC3B,QAAI,eAAe;AACnB,QAAI,iBAAiB;AAErB,WAAO,UAAU;AAqBjB,aAAS,KAAK,GAAG;AACf,UAAI,SAAS,EAAE,MAAM,EAAE;AACvB,UAAI,kBAAkB,UAAU;AAC9B,eAAO,OAAO,CAAC;AAAA,MACjB;AAEA,cAAO,EAAE,MAAM,EAAE,QAAQ;AAAA,QACzB,KAAK;AAAmB,+BAAqB,CAAC;AAAG;AAAA,QACjD,KAAK;AAAc,0BAAgB,CAAC;AAAG;AAAA,QACvC,KAAK;AAAgB,4BAAkB,CAAC;AAAG;AAAA,QAC3C,KAAK;AAAQ;AAAA,QACb;AAAS,+BAAqB,CAAC;AAAA,MAC/B;AAAA,IACF;AAGA,QAAI,oBAAoB;AAExB,aAAS,gBAAgB,GAAG;AAC1B,kBAAY,CAAC;AACb,mBAAa,CAAC;AAAA,IAChB;AAEA,aAAS,qBAAqB,GAAG;AAC/B,qBAAe,CAAC;AAAA,IAClB;AAAA;AAAA;;;ACrDA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,kBAAkB,GAAG;AAC5B,UAAI,gBAAgB,UAAU,CAAC;AAE/B,QAAE,MAAM,EAAE,YAAY,QAAQ,OAAK;AACjC,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,UAAU,KAAK;AACnB,YAAI,WAAW,SAAS,GAAG,eAAe,QAAQ,GAAG,QAAQ,CAAC;AAC9D,YAAI,OAAO,SAAS;AACpB,YAAI,MAAM,SAAS;AACnB,YAAI,UAAU;AACd,YAAI,QAAQ,KAAK,OAAO;AACxB,YAAI,YAAY;AAEhB,eAAO,MAAM,QAAQ,GAAG;AACtB,iBAAO,EAAE,KAAK,CAAC;AAEf,cAAI,WAAW;AACb,oBAAQ,QAAQ,KAAK,OAAO,OAAO,OAC5B,EAAE,KAAK,KAAK,EAAE,UAAU,KAAK,MAAM;AACxC;AAAA,YACF;AAEA,gBAAI,UAAU,KAAK;AACjB,0BAAY;AAAA,YACd;AAAA,UACF;AAEA,cAAI,CAAC,WAAW;AACd,mBAAO,UAAU,KAAK,SAAS,KACxB,EAAE,KAAK,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE,WAAW,KAAK,MAAM;AAC7D;AAAA,YACF;AACA,oBAAQ,KAAK,OAAO;AAAA,UACtB;AAEA,YAAE,UAAU,GAAG,KAAK;AACpB,cAAI,EAAE,WAAW,CAAC,EAAE,CAAC;AAAA,QACvB;AAAA,MACF,CAAC;AAAA,IACH;AAIA,aAAS,SAAS,GAAG,eAAe,GAAG,GAAG;AACxC,UAAI,QAAQ,CAAC;AACb,UAAI,QAAQ,CAAC;AACb,UAAI,MAAM,KAAK,IAAI,cAAc,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,GAAG;AAC7D,UAAI,MAAM,KAAK,IAAI,cAAc,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,GAAG;AAC7D,UAAI;AACJ,UAAI;AAGJ,eAAS;AACT,SAAG;AACD,iBAAS,EAAE,OAAO,MAAM;AACxB,cAAM,KAAK,MAAM;AAAA,MACnB,SAAS,WACC,cAAc,MAAM,EAAE,MAAM,OAAO,MAAM,cAAc,MAAM,EAAE;AACzE,YAAM;AAGN,eAAS;AACT,cAAQ,SAAS,EAAE,OAAO,MAAM,OAAO,KAAK;AAC1C,cAAM,KAAK,MAAM;AAAA,MACnB;AAEA,aAAO,EAAE,MAAM,MAAM,OAAO,MAAM,QAAQ,CAAC,GAAG,IAAS;AAAA,IACzD;AAEA,aAAS,UAAU,GAAG;AACpB,UAAI,SAAS,CAAC;AACd,UAAI,MAAM;AAEV,eAAS,IAAI,GAAG;AACd,YAAI,MAAM;AACV,UAAE,SAAS,CAAC,EAAE,QAAQ,GAAG;AACzB,eAAO,CAAC,IAAI,EAAE,KAAU,KAAK,MAAM;AAAA,MACrC;AACA,QAAE,SAAS,EAAE,QAAQ,GAAG;AAExB,aAAO;AAAA,IACT;AAAA;AAAA;;;ACnFA;AAAA;AAAA;AAAA,QAAI,OAAO;AAEX,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAyBA,aAAS,IAAI,GAAG;AACd,UAAI,OAAO,KAAK,aAAa,GAAG,QAAQ,CAAC,GAAG,OAAO;AACnD,UAAI,SAAS,WAAW,CAAC;AACzB,UAAI,YAAY,OAAO,OAAO,MAAM;AACpC,UAAI,SAAS,KAAK,kBAAkB,KAAK,KAAK,SAAS,IAAI;AAC3D,UAAI,UAAU,IAAI,SAAS;AAE3B,QAAE,MAAM,EAAE,cAAc;AAGxB,QAAE,MAAM,EAAE,QAAQ,OAAK,EAAE,KAAK,CAAC,EAAE,UAAU,OAAO;AAGlD,UAAI,SAAS,WAAW,CAAC,IAAI;AAG7B,QAAE,SAAS,EAAE,QAAQ,WAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,KAAK,CAAC;AAIlF,QAAE,MAAM,EAAE,iBAAiB;AAAA,IAC7B;AAEA,aAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,GAAG;AACxD,UAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,UAAI,CAAC,SAAS,QAAQ;AACpB,YAAI,MAAM,MAAM;AACd,YAAE,QAAQ,MAAM,GAAG,EAAE,QAAQ,GAAG,QAAQ,QAAQ,CAAC;AAAA,QACnD;AACA;AAAA,MACF;AAEA,UAAI,MAAM,KAAK,cAAc,GAAG,KAAK;AACrC,UAAI,SAAS,KAAK,cAAc,GAAG,KAAK;AACxC,UAAI,QAAQ,EAAE,KAAK,CAAC;AAEpB,QAAE,UAAU,KAAK,CAAC;AAClB,YAAM,YAAY;AAClB,QAAE,UAAU,QAAQ,CAAC;AACrB,YAAM,eAAe;AAErB,eAAS,QAAQ,WAAS;AACxB,YAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,KAAK;AAEnD,YAAI,YAAY,EAAE,KAAK,KAAK;AAC5B,YAAI,WAAW,UAAU,YAAY,UAAU,YAAY;AAC3D,YAAI,cAAc,UAAU,eAAe,UAAU,eAAe;AACpE,YAAI,aAAa,UAAU,YAAY,SAAS,IAAI;AACpD,YAAI,SAAS,aAAa,cAAc,IAAI,SAAS,OAAO,CAAC,IAAI;AAEjE,UAAE,QAAQ,KAAK,UAAU;AAAA,UACvB,QAAQ;AAAA,UACR;AAAA,UACA,aAAa;AAAA,QACf,CAAC;AAED,UAAE,QAAQ,aAAa,QAAQ;AAAA,UAC7B,QAAQ;AAAA,UACR;AAAA,UACA,aAAa;AAAA,QACf,CAAC;AAAA,MACH,CAAC;AAED,UAAI,CAAC,EAAE,OAAO,CAAC,GAAG;AAChB,UAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,QAAQ,SAAS,OAAO,CAAC,EAAE,CAAC;AAAA,MAChE;AAAA,IACF;AAEA,aAAS,WAAW,GAAG;AACrB,UAAI,SAAS,CAAC;AACd,eAASC,KAAI,GAAG,OAAO;AACrB,YAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,YAAI,YAAY,SAAS,QAAQ;AAC/B,mBAAS,QAAQ,WAASA,KAAI,OAAO,QAAQ,CAAC,CAAC;AAAA,QACjD;AACA,eAAO,CAAC,IAAI;AAAA,MACd;AACA,QAAE,SAAS,EAAE,QAAQ,OAAKA,KAAI,GAAG,CAAC,CAAC;AACnC,aAAO;AAAA,IACT;AAEA,aAAS,WAAW,GAAG;AACrB,aAAO,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,KAAK,CAAC,EAAE,QAAQ,CAAC;AAAA,IAC/D;AAEA,aAAS,QAAQ,GAAG;AAClB,UAAI,aAAa,EAAE,MAAM;AACzB,QAAE,WAAW,WAAW,WAAW;AACnC,aAAO,WAAW;AAClB,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,aAAa;AACpB,YAAE,WAAW,CAAC;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;;;AC7HA;AAAA;AAAA;AAAA,QAAI,OAAO;AAEX,WAAO,UAAU;AAEjB,aAAS,kBAAkB,GAAG;AAC5B,eAAS,IAAI,GAAG;AACd,YAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,SAAS,QAAQ;AACnB,mBAAS,QAAQ,GAAG;AAAA,QACtB;AAEA,YAAI,OAAO,OAAO,MAAM,SAAS,GAAG;AAClC,eAAK,aAAa,CAAC;AACnB,eAAK,cAAc,CAAC;AACpB,mBAAS,OAAO,KAAK,SAAS,UAAU,KAAK,UAAU,GACrD,OAAO,SACP,EAAE,MAAM;AACR,0BAAc,GAAG,cAAc,OAAO,GAAG,MAAM,IAAI;AACnD,0BAAc,GAAG,eAAe,OAAO,GAAG,MAAM,IAAI;AAAA,UACtD;AAAA,QACF;AAAA,MACF;AAEA,QAAE,SAAS,EAAE,QAAQ,GAAG;AAAA,IAC1B;AAEA,aAAS,cAAc,GAAG,MAAM,QAAQ,IAAI,QAAQ,MAAM;AACxD,UAAI,QAAQ,EAAE,OAAO,GAAG,QAAQ,GAAG,MAAY,YAAY,KAAK;AAChE,UAAI,OAAO,OAAO,IAAI,EAAE,OAAO,CAAC;AAChC,UAAI,OAAO,KAAK,aAAa,GAAG,UAAU,OAAO,MAAM;AACvD,aAAO,IAAI,EAAE,IAAI,IAAI;AACrB,QAAE,UAAU,MAAM,EAAE;AACpB,UAAI,MAAM;AACR,UAAE,QAAQ,MAAM,MAAM,EAAE,QAAQ,EAAE,CAAC;AAAA,MACrC;AAAA,IACF;AAAA;AAAA;;;ACpCA;AAAA;AAAA;AAEA,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,IACF;AAEA,aAAS,OAAO,GAAG;AACjB,UAAI,UAAU,EAAE,MAAM,EAAE,QAAQ,YAAY;AAC5C,UAAI,YAAY,QAAQ,YAAY,MAAM;AACxC,wBAAgB,CAAC;AAAA,MACnB;AAAA,IACF;AAEA,aAAS,KAAK,GAAG;AACf,UAAI,UAAU,EAAE,MAAM,EAAE,QAAQ,YAAY;AAC5C,UAAI,YAAY,QAAQ,YAAY,MAAM;AACxC,iBAAS,CAAC;AAAA,MACZ;AAEA,UAAI,YAAY,QAAQ,YAAY,MAAM;AACxC,eAAO,CAAC;AACR,wBAAgB,CAAC;AAAA,MACnB;AAAA,IACF;AAEA,aAAS,gBAAgB,GAAG;AAC1B,QAAE,MAAM,EAAE,QAAQ,OAAK,mBAAmB,EAAE,KAAK,CAAC,CAAC,CAAC;AACpD,QAAE,MAAM,EAAE,QAAQ,OAAK,mBAAmB,EAAE,KAAK,CAAC,CAAC,CAAC;AAAA,IACtD;AAEA,aAAS,mBAAmB,OAAO;AACjC,UAAI,IAAI,MAAM;AACd,YAAM,QAAQ,MAAM;AACpB,YAAM,SAAS;AAAA,IACjB;AAEA,aAAS,SAAS,GAAG;AACnB,QAAE,MAAM,EAAE,QAAQ,OAAK,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;AAE7C,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,OAAO,QAAQ,WAAW;AAC/B,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAC5B,sBAAY,IAAI;AAAA,QAClB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,YAAY,OAAO;AAC1B,YAAM,IAAI,CAAC,MAAM;AAAA,IACnB;AAEA,aAAS,OAAO,GAAG;AACjB,QAAE,MAAM,EAAE,QAAQ,OAAK,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;AAE3C,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,OAAO,QAAQ,SAAS;AAC7B,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAC5B,oBAAU,IAAI;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,UAAU,OAAO;AACxB,UAAI,IAAI,MAAM;AACd,YAAM,IAAI,MAAM;AAChB,YAAM,IAAI;AAAA,IACZ;AAAA;AAAA;;;ACrEA;AAAA;AAAA;AAEA,QAAI,OAAO;AAEX,WAAO,UAAU;AAajB,aAAS,UAAU,GAAG;AACpB,UAAI,UAAU,CAAC;AACf,UAAI,cAAc,EAAE,MAAM,EAAE,OAAO,OAAK,CAAC,EAAE,SAAS,CAAC,EAAE,MAAM;AAC7D,UAAI,mBAAmB,YAAY,IAAI,OAAK,EAAE,KAAK,CAAC,EAAE,IAAI;AAC1D,UAAI,UAAU,KAAK,kBAAkB,KAAK,KAAK,gBAAgB;AAC/D,UAAI,SAAS,KAAK,MAAM,UAAU,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC;AAEjD,eAAS,IAAI,GAAG;AACd,YAAI,QAAQ,CAAC,EAAG;AAChB,gBAAQ,CAAC,IAAI;AACb,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,eAAO,KAAK,IAAI,EAAE,KAAK,CAAC;AACxB,UAAE,WAAW,CAAC,EAAE,QAAQ,GAAG;AAAA,MAC7B;AAEA,UAAI,YAAY,YAAY,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,IAAI;AAC1E,gBAAU,QAAQ,GAAG;AAErB,aAAO;AAAA,IACT;AAAA;AAAA;;;ACpCA;AAAA;AAAA;AAEA,QAAI,YAAY,eAAmB;AAEnC,WAAO,UAAU;AAkBjB,aAAS,WAAW,GAAG,UAAU;AAC/B,UAAI,KAAK;AACT,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;AACxC,cAAM,mBAAmB,GAAG,SAAS,IAAE,CAAC,GAAG,SAAS,CAAC,CAAC;AAAA,MACxD;AACA,aAAO;AAAA,IACT;AAEA,aAAS,mBAAmB,GAAG,YAAY,YAAY;AAIrD,UAAI,WAAW,UAAU,YAAY,WAAW,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;AAChE,UAAI,eAAe,WAAW,QAAQ,OAAK;AACzC,eAAO,EAAE,SAAS,CAAC,EAAE,IAAI,OAAK;AAC5B,iBAAO,EAAE,KAAK,SAAS,EAAE,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,EAAE,OAAO;AAAA,QACxD,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AAAA,MACjC,CAAC;AAGD,UAAI,aAAa;AACjB,aAAO,aAAa,WAAW,OAAQ,gBAAe;AACtD,UAAI,WAAW,IAAI,aAAa;AAChC,oBAAc;AACd,UAAI,OAAO,IAAI,MAAM,QAAQ,EAAE,KAAK,CAAC;AAGrC,UAAI,KAAK;AACT,mBAAa,QAAQ,WAAS;AAC5B,YAAI,QAAQ,MAAM,MAAM;AACxB,aAAK,KAAK,KAAK,MAAM;AACrB,YAAI,YAAY;AAChB,eAAO,QAAQ,GAAG;AAChB,cAAI,QAAQ,GAAG;AACb,yBAAa,KAAK,QAAQ,CAAC;AAAA,UAC7B;AACA,kBAAS,QAAQ,KAAM;AACvB,eAAK,KAAK,KAAK,MAAM;AAAA,QACvB;AACA,cAAM,MAAM,SAAS;AAAA,MACvB,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;ACjEA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,WAAW,GAAG,UAAU,CAAC,GAAG;AACnC,aAAO,QAAQ,IAAI,OAAK;AACtB,YAAI,MAAM,EAAE,QAAQ,CAAC;AACrB,YAAI,CAAC,IAAI,QAAQ;AACf,iBAAO,EAAE,EAAK;AAAA,QAChB,OAAO;AACL,cAAI,SAAS,IAAI,OAAO,CAAC,KAAK,MAAM;AAClC,gBAAI,OAAO,EAAE,KAAK,CAAC,GACjB,QAAQ,EAAE,KAAK,EAAE,CAAC;AACpB,mBAAO;AAAA,cACL,KAAK,IAAI,MAAO,KAAK,SAAS,MAAM;AAAA,cACpC,QAAQ,IAAI,SAAS,KAAK;AAAA,YAC5B;AAAA,UACF,GAAG,EAAE,KAAK,GAAG,QAAQ,EAAE,CAAC;AAExB,iBAAO;AAAA,YACL;AAAA,YACA,YAAY,OAAO,MAAM,OAAO;AAAA,YAChC,QAAQ,OAAO;AAAA,UACjB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;;;ACxBA;AAAA;AAAA;AAEA,QAAI,OAAO;AAEX,WAAO,UAAU;AA2BjB,aAAS,iBAAiB,SAAS,IAAI;AACrC,UAAI,gBAAgB,CAAC;AACrB,cAAQ,QAAQ,CAAC,OAAO,MAAM;AAC5B,YAAI,MAAM,cAAc,MAAM,CAAC,IAAI;AAAA,UACjC,UAAU;AAAA,UACV,MAAM,CAAC;AAAA,UACP,KAAK,CAAC;AAAA,UACN,IAAI,CAAC,MAAM,CAAC;AAAA,UACZ;AAAA,QACF;AACA,YAAI,MAAM,eAAe,QAAW;AAClC,cAAI,aAAa,MAAM;AACvB,cAAI,SAAS,MAAM;AAAA,QACrB;AAAA,MACF,CAAC;AAED,SAAG,MAAM,EAAE,QAAQ,OAAK;AACtB,YAAI,SAAS,cAAc,EAAE,CAAC;AAC9B,YAAI,SAAS,cAAc,EAAE,CAAC;AAC9B,YAAI,WAAW,UAAa,WAAW,QAAW;AAChD,iBAAO;AACP,iBAAO,IAAI,KAAK,cAAc,EAAE,CAAC,CAAC;AAAA,QACpC;AAAA,MACF,CAAC;AAED,UAAI,YAAY,OAAO,OAAO,aAAa,EAAE,OAAO,WAAS,CAAC,MAAM,QAAQ;AAE5E,aAAO,mBAAmB,SAAS;AAAA,IACrC;AAEA,aAAS,mBAAmB,WAAW;AACrC,UAAI,UAAU,CAAC;AAEf,eAAS,SAAS,QAAQ;AACxB,eAAO,YAAU;AACf,cAAI,OAAO,QAAQ;AACjB;AAAA,UACF;AACA,cAAI,OAAO,eAAe,UACtB,OAAO,eAAe,UACtB,OAAO,cAAc,OAAO,YAAY;AAC1C,yBAAa,QAAQ,MAAM;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAEA,eAAS,UAAU,QAAQ;AACzB,eAAO,YAAU;AACf,iBAAO,IAAI,EAAE,KAAK,MAAM;AACxB,cAAI,EAAE,OAAO,aAAa,GAAG;AAC3B,sBAAU,KAAK,MAAM;AAAA,UACvB;AAAA,QACF;AAAA,MACF;AAEA,aAAO,UAAU,QAAQ;AACvB,YAAI,QAAQ,UAAU,IAAI;AAC1B,gBAAQ,KAAK,KAAK;AAClB,cAAM,IAAI,EAAE,QAAQ,EAAE,QAAQ,SAAS,KAAK,CAAC;AAC7C,cAAM,IAAI,QAAQ,UAAU,KAAK,CAAC;AAAA,MACpC;AAEA,aAAO,QAAQ,OAAO,WAAS,CAAC,MAAM,MAAM,EAAE,IAAI,WAAS;AACzD,eAAO,KAAK,KAAK,OAAO,CAAC,MAAM,KAAK,cAAc,QAAQ,CAAC;AAAA,MAC7D,CAAC;AAAA,IACH;AAEA,aAAS,aAAa,QAAQ,QAAQ;AACpC,UAAI,MAAM;AACV,UAAI,SAAS;AAEb,UAAI,OAAO,QAAQ;AACjB,eAAO,OAAO,aAAa,OAAO;AAClC,kBAAU,OAAO;AAAA,MACnB;AAEA,UAAI,OAAO,QAAQ;AACjB,eAAO,OAAO,aAAa,OAAO;AAClC,kBAAU,OAAO;AAAA,MACnB;AAEA,aAAO,KAAK,OAAO,GAAG,OAAO,OAAO,EAAE;AACtC,aAAO,aAAa,MAAM;AAC1B,aAAO,SAAS;AAChB,aAAO,IAAI,KAAK,IAAI,OAAO,GAAG,OAAO,CAAC;AACtC,aAAO,SAAS;AAAA,IAClB;AAAA;AAAA;;;ACrHA;AAAA;AAAA;AAAA,QAAI,OAAO;AAEX,WAAO,UAAU;AAEjB,aAAS,KAAK,SAAS,WAAW;AAChC,UAAI,QAAQ,KAAK,UAAU,SAAS,WAAS;AAC3C,eAAO,OAAO,OAAO,OAAO,YAAY;AAAA,MAC1C,CAAC;AACD,UAAI,WAAW,MAAM,KACnB,aAAa,MAAM,IAAI,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC,GAC/C,KAAK,CAAC,GACN,MAAM,GACN,SAAS,GACT,UAAU;AAEZ,eAAS,KAAK,gBAAgB,CAAC,CAAC,SAAS,CAAC;AAE1C,gBAAU,kBAAkB,IAAI,YAAY,OAAO;AAEnD,eAAS,QAAQ,WAAS;AACxB,mBAAW,MAAM,GAAG;AACpB,WAAG,KAAK,MAAM,EAAE;AAChB,eAAO,MAAM,aAAa,MAAM;AAChC,kBAAU,MAAM;AAChB,kBAAU,kBAAkB,IAAI,YAAY,OAAO;AAAA,MACrD,CAAC;AAED,UAAI,SAAS,EAAE,IAAI,GAAG,KAAK,IAAI,EAAE;AACjC,UAAI,QAAQ;AACV,eAAO,aAAa,MAAM;AAC1B,eAAO,SAAS;AAAA,MAClB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,kBAAkB,IAAI,YAAY,OAAO;AAChD,UAAI;AACJ,aAAO,WAAW,WAAW,OAAO,WAAW,WAAW,SAAS,CAAC,GAAG,KAAK,OAAO;AACjF,mBAAW,IAAI;AACf,WAAG,KAAK,KAAK,EAAE;AACf;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,aAAS,gBAAgB,MAAM;AAC7B,aAAO,CAAC,QAAQ,WAAW;AACzB,YAAI,OAAO,aAAa,OAAO,YAAY;AACzC,iBAAO;AAAA,QACT,WAAW,OAAO,aAAa,OAAO,YAAY;AAChD,iBAAO;AAAA,QACT;AAEA,eAAO,CAAC,OAAO,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO;AAAA,MACzD;AAAA,IACF;AAAA;AAAA;;;ACvDA;AAAA;AAAA;AAAA,QAAI,aAAa;AACjB,QAAI,mBAAmB;AACvB,QAAI,OAAO;AAEX,WAAO,UAAU;AAEjB,aAAS,aAAa,GAAG,GAAG,IAAI,WAAW;AACzC,UAAI,UAAU,EAAE,SAAS,CAAC;AAC1B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,OAAO,KAAK,aAAa;AAClC,UAAI,KAAK,OAAO,KAAK,cAAa;AAClC,UAAI,YAAY,CAAC;AAEjB,UAAI,IAAI;AACN,kBAAU,QAAQ,OAAO,OAAK,MAAM,MAAM,MAAM,EAAE;AAAA,MACpD;AAEA,UAAI,cAAc,WAAW,GAAG,OAAO;AACvC,kBAAY,QAAQ,WAAS;AAC3B,YAAI,EAAE,SAAS,MAAM,CAAC,EAAE,QAAQ;AAC9B,cAAI,iBAAiB,aAAa,GAAG,MAAM,GAAG,IAAI,SAAS;AAC3D,oBAAU,MAAM,CAAC,IAAI;AACrB,cAAI,OAAO,OAAO,gBAAgB,YAAY,GAAG;AAC/C,6BAAiB,OAAO,cAAc;AAAA,UACxC;AAAA,QACF;AAAA,MACF,CAAC;AAED,UAAI,UAAU,iBAAiB,aAAa,EAAE;AAC9C,sBAAgB,SAAS,SAAS;AAElC,UAAI,SAAS,KAAK,SAAS,SAAS;AAEpC,UAAI,IAAI;AACN,eAAO,KAAK,CAAC,IAAI,OAAO,IAAI,EAAE,EAAE,KAAK,IAAI;AACzC,YAAI,EAAE,aAAa,EAAE,EAAE,QAAQ;AAC7B,cAAI,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC,GACvC,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC;AACvC,cAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,GAAG;AACxC,mBAAO,aAAa;AACpB,mBAAO,SAAS;AAAA,UAClB;AACA,iBAAO,cAAc,OAAO,aAAa,OAAO,SAC3B,OAAO,QAAQ,OAAO,UAAU,OAAO,SAAS;AACrE,iBAAO,UAAU;AAAA,QACnB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAAS,gBAAgB,SAAS,WAAW;AAC3C,cAAQ,QAAQ,WAAS;AACvB,cAAM,KAAK,MAAM,GAAG,QAAQ,OAAK;AAC/B,cAAI,UAAU,CAAC,GAAG;AAChB,mBAAO,UAAU,CAAC,EAAE;AAAA,UACtB;AACA,iBAAO;AAAA,QACT,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAEA,aAAS,iBAAiB,QAAQ,OAAO;AACvC,UAAI,OAAO,eAAe,QAAW;AACnC,eAAO,cAAc,OAAO,aAAa,OAAO,SAC3B,MAAM,aAAa,MAAM,WACzB,OAAO,SAAS,MAAM;AAC3C,eAAO,UAAU,MAAM;AAAA,MACzB,OAAO;AACL,eAAO,aAAa,MAAM;AAC1B,eAAO,SAAS,MAAM;AAAA,MACxB;AAAA,IACF;AAAA;AAAA;;;ACxEA;AAAA;AAAA;AAAA,QAAI,QAAQ,mBAA6B;AACzC,QAAI,OAAO;AAEX,WAAO,UAAU;AAkCjB,aAAS,gBAAgB,GAAG,MAAM,cAAc,eAAe;AAC7D,UAAI,CAAC,eAAe;AAClB,wBAAgB,EAAE,MAAM;AAAA,MAC1B;AACA,UAAI,OAAO,eAAe,CAAC,GACzB,SAAS,IAAI,MAAM,EAAE,UAAU,KAAK,CAAC,EAClC,SAAS,EAAE,KAAW,CAAC,EACvB,oBAAoB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAEzC,oBAAc,QAAQ,CAAC,MAAM;AAC3B,YAAI,OAAO,EAAE,KAAK,CAAC,GACjB,SAAS,EAAE,OAAO,CAAC;AAErB,YAAI,KAAK,SAAS,QAAQ,KAAK,WAAW,QAAQ,QAAQ,KAAK,SAAS;AACtE,iBAAO,QAAQ,CAAC;AAChB,iBAAO,UAAU,GAAG,UAAU,IAAI;AAGlC,YAAE,YAAY,EAAE,CAAC,EAAE,QAAQ,OAAK;AAC9B,gBAAI,IAAI,EAAE,MAAM,IAAI,EAAE,IAAI,EAAE,GAC1B,OAAO,OAAO,KAAK,GAAG,CAAC,GACvB,SAAS,SAAS,SAAY,KAAK,SAAS;AAC9C,mBAAO,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,SAAS,OAAO,CAAC;AAAA,UAC5D,CAAC;AAED,cAAI,OAAO,OAAO,MAAM,SAAS,GAAG;AAClC,mBAAO,QAAQ,GAAG;AAAA,cAChB,YAAY,KAAK,WAAW,IAAI;AAAA,cAChC,aAAa,KAAK,YAAY,IAAI;AAAA,YACpC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAEA,aAAS,eAAe,GAAG;AACzB,UAAI;AACJ,aAAO,EAAE,QAAS,IAAI,KAAK,SAAS,OAAO,CAAE,EAAE;AAC/C,aAAO;AAAA,IACT;AAAA;AAAA;;;AC9EA;AAAA;AAAA;AAAA,WAAO,UAAU;AAEjB,aAAS,uBAAuB,GAAG,IAAI,IAAI;AACzC,UAAI,OAAO,CAAC,GACV;AAEF,SAAG,QAAQ,OAAK;AACd,YAAI,QAAQ,EAAE,OAAO,CAAC,GACpB,QACA;AACF,eAAO,OAAO;AACZ,mBAAS,EAAE,OAAO,KAAK;AACvB,cAAI,QAAQ;AACV,wBAAY,KAAK,MAAM;AACvB,iBAAK,MAAM,IAAI;AAAA,UACjB,OAAO;AACL,wBAAY;AACZ,uBAAW;AAAA,UACb;AACA,cAAI,aAAa,cAAc,OAAO;AACpC,eAAG,QAAQ,WAAW,KAAK;AAC3B;AAAA,UACF;AACA,kBAAQ;AAAA,QACV;AAAA,MACF,CAAC;AAAA,IAyBH;AAAA;AAAA;;;AClDA;AAAA;AAAA;AAEA,QAAI,YAAY;AAChB,QAAI,aAAa;AACjB,QAAI,eAAe;AACnB,QAAI,kBAAkB;AACtB,QAAI,yBAAyB;AAC7B,QAAI,QAAQ,mBAA6B;AACzC,QAAI,OAAO;AAEX,WAAO,UAAU;AAiBjB,aAAS,MAAM,GAAG,MAAM;AACtB,UAAI,QAAQ,OAAO,KAAK,gBAAgB,YAAY;AAClD,aAAK,YAAY,GAAG,KAAK;AACzB;AAAA,MACF;AAEA,UAAI,UAAU,KAAK,QAAQ,CAAC,GAC1B,kBAAkB,iBAAiB,GAAG,KAAK,MAAM,GAAG,UAAU,CAAC,GAAG,SAAS,GAC3E,gBAAgB,iBAAiB,GAAG,KAAK,MAAM,UAAU,GAAG,IAAI,EAAE,GAAG,UAAU;AAEjF,UAAI,WAAW,UAAU,CAAC;AAC1B,kBAAY,GAAG,QAAQ;AAEvB,UAAI,QAAQ,KAAK,8BAA8B;AAC7C;AAAA,MACF;AAEA,UAAI,SAAS,OAAO,mBAClB;AAEF,eAAS,IAAI,GAAG,WAAW,GAAG,WAAW,GAAG,EAAE,GAAG,EAAE,UAAU;AAC3D,yBAAiB,IAAI,IAAI,kBAAkB,eAAe,IAAI,KAAK,CAAC;AAEpE,mBAAW,KAAK,iBAAiB,CAAC;AAClC,YAAI,KAAK,WAAW,GAAG,QAAQ;AAC/B,YAAI,KAAK,QAAQ;AACf,qBAAW;AACX,iBAAO,OAAO,OAAO,CAAC,GAAG,QAAQ;AACjC,mBAAS;AAAA,QACX;AAAA,MACF;AAEA,kBAAY,GAAG,IAAI;AAAA,IACrB;AAEA,aAAS,iBAAiB,GAAG,OAAO,cAAc;AAIhD,YAAM,cAAc,oBAAI,IAAI;AAC5B,YAAM,gBAAgB,CAAC,MAAM,SAAS;AACpC,YAAI,CAAC,YAAY,IAAI,IAAI,GAAG;AAC1B,sBAAY,IAAI,MAAM,CAAC,CAAC;AAAA,QAC1B;AACA,oBAAY,IAAI,IAAI,EAAE,KAAK,IAAI;AAAA,MACjC;AAIA,iBAAW,KAAK,EAAE,MAAM,GAAG;AACzB,cAAM,OAAO,EAAE,KAAK,CAAC;AACrB,YAAI,OAAO,KAAK,SAAS,UAAU;AACjC,wBAAc,KAAK,MAAM,CAAC;AAAA,QAC5B;AAGA,YAAI,OAAO,KAAK,YAAY,YAAY,OAAO,KAAK,YAAY,UAAU;AACxE,mBAAS,IAAI,KAAK,SAAS,KAAK,KAAK,SAAS,KAAK;AACjD,gBAAI,MAAM,KAAK,MAAM;AAEnB,4BAAc,GAAG,CAAC;AAAA,YACpB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,aAAO,MAAM,IAAI,SAAU,MAAM;AAC/B,eAAO,gBAAgB,GAAG,MAAM,cAAc,YAAY,IAAI,IAAI,KAAK,CAAC,CAAC;AAAA,MAC3E,CAAC;AAAA,IACH;AAEA,aAAS,iBAAiB,aAAa,WAAW;AAChD,UAAI,KAAK,IAAI,MAAM;AACnB,kBAAY,QAAQ,SAAS,IAAI;AAC/B,YAAI,OAAO,GAAG,MAAM,EAAE;AACtB,YAAI,SAAS,aAAa,IAAI,MAAM,IAAI,SAAS;AACjD,eAAO,GAAG,QAAQ,CAAC,GAAG,MAAM,GAAG,KAAK,CAAC,EAAE,QAAQ,CAAC;AAChD,+BAAuB,IAAI,IAAI,OAAO,EAAE;AAAA,MAC1C,CAAC;AAAA,IACH;AAEA,aAAS,YAAY,GAAG,UAAU;AAChC,aAAO,OAAO,QAAQ,EAAE,QAAQ,WAAS,MAAM,QAAQ,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,IACvF;AAAA;AAAA;;;AC9GA;AAAA;AAAA;AAEA,QAAI,QAAQ,mBAA6B;AACzC,QAAI,OAAO;AAOX,WAAO,UAAU;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAmBA,aAAS,mBAAmB,GAAG,UAAU;AACvC,UAAI,YAAY,CAAC;AAEjB,eAAS,WAAW,WAAW,OAAO;AACpC,YAGE,KAAK,GAGL,UAAU,GACV,kBAAkB,UAAU,QAC5B,WAAW,MAAM,MAAM,SAAS,CAAC;AAEnC,cAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,cAAI,IAAI,0BAA0B,GAAG,CAAC,GACpC,KAAK,IAAI,EAAE,KAAK,CAAC,EAAE,QAAQ;AAE7B,cAAI,KAAK,MAAM,UAAU;AACvB,kBAAM,MAAM,SAAS,IAAE,CAAC,EAAE,QAAQ,cAAY;AAC5C,gBAAE,aAAa,QAAQ,EAAE,QAAQ,OAAK;AACpC,oBAAI,SAAS,EAAE,KAAK,CAAC,GACnB,OAAO,OAAO;AAChB,qBAAK,OAAO,MAAM,KAAK,SACnB,EAAE,OAAO,SAAS,EAAE,KAAK,QAAQ,EAAE,QAAQ;AAC7C,8BAAY,WAAW,GAAG,QAAQ;AAAA,gBACpC;AAAA,cACF,CAAC;AAAA,YACH,CAAC;AACD,sBAAU,IAAI;AACd,iBAAK;AAAA,UACP;AAAA,QACF,CAAC;AAED,eAAO;AAAA,MACT;AAEA,eAAS,UAAU,SAAS,OAAO,UAAU;AAE7C,aAAO;AAAA,IACT;AAEA,aAAS,mBAAmB,GAAG,UAAU;AACvC,UAAI,YAAY,CAAC;AAEjB,eAAS,KAAK,OAAO,UAAU,UAAU,iBAAiB,iBAAiB;AACzE,YAAI;AACJ,aAAK,MAAM,UAAU,QAAQ,EAAE,QAAQ,OAAK;AAC1C,cAAI,MAAM,CAAC;AACX,cAAI,EAAE,KAAK,CAAC,EAAE,OAAO;AACnB,cAAE,aAAa,CAAC,EAAE,QAAQ,OAAK;AAC7B,kBAAI,QAAQ,EAAE,KAAK,CAAC;AACpB,kBAAI,MAAM,UACL,MAAM,QAAQ,mBAAmB,MAAM,QAAQ,kBAAkB;AACpE,4BAAY,WAAW,GAAG,CAAC;AAAA,cAC7B;AAAA,YACF,CAAC;AAAA,UACH;AAAA,QACF,CAAC;AAAA,MACH;AAGA,eAAS,WAAW,OAAO,OAAO;AAChC,YAAI,eAAe,IACjB,cACA,WAAW;AAEb,cAAM,QAAQ,CAAC,GAAG,mBAAmB;AACnC,cAAI,EAAE,KAAK,CAAC,EAAE,UAAU,UAAU;AAChC,gBAAI,eAAe,EAAE,aAAa,CAAC;AACnC,gBAAI,aAAa,QAAQ;AACvB,6BAAe,EAAE,KAAK,aAAa,CAAC,CAAC,EAAE;AACvC,mBAAK,OAAO,UAAU,gBAAgB,cAAc,YAAY;AAChE,yBAAW;AACX,6BAAe;AAAA,YACjB;AAAA,UACF;AACA,eAAK,OAAO,UAAU,MAAM,QAAQ,cAAc,MAAM,MAAM;AAAA,QAChE,CAAC;AAED,eAAO;AAAA,MACT;AAEA,eAAS,UAAU,SAAS,OAAO,UAAU;AAE7C,aAAO;AAAA,IACT;AAEA,aAAS,0BAA0B,GAAG,GAAG;AACvC,UAAI,EAAE,KAAK,CAAC,EAAE,OAAO;AACnB,eAAO,EAAE,aAAa,CAAC,EAAE,KAAK,OAAK,EAAE,KAAK,CAAC,EAAE,KAAK;AAAA,MACpD;AAAA,IACF;AAEA,aAAS,YAAY,WAAW,GAAG,GAAG;AACpC,UAAI,IAAI,GAAG;AACT,YAAI,MAAM;AACV,YAAI;AACJ,YAAI;AAAA,MACN;AAEA,UAAI,aAAa,UAAU,CAAC;AAC5B,UAAI,CAAC,YAAY;AACf,kBAAU,CAAC,IAAI,aAAa,CAAC;AAAA,MAC/B;AACA,iBAAW,CAAC,IAAI;AAAA,IAClB;AAEA,aAAS,YAAY,WAAW,GAAG,GAAG;AACpC,UAAI,IAAI,GAAG;AACT,YAAI,MAAM;AACV,YAAI;AACJ,YAAI;AAAA,MACN;AACA,aAAO,CAAC,CAAC,UAAU,CAAC,KAAK,OAAO,OAAO,UAAU,CAAC,GAAG,CAAC;AAAA,IACxD;AAUA,aAAS,kBAAkB,GAAG,UAAU,WAAW,YAAY;AAC7D,UAAI,OAAO,CAAC,GACV,QAAQ,CAAC,GACT,MAAM,CAAC;AAKT,eAAS,QAAQ,WAAS;AACxB,cAAM,QAAQ,CAAC,GAAG,UAAU;AAC1B,eAAK,CAAC,IAAI;AACV,gBAAM,CAAC,IAAI;AACX,cAAI,CAAC,IAAI;AAAA,QACX,CAAC;AAAA,MACH,CAAC;AAED,eAAS,QAAQ,WAAS;AACxB,YAAI,UAAU;AACd,cAAM,QAAQ,OAAK;AACjB,cAAI,KAAK,WAAW,CAAC;AACrB,cAAI,GAAG,QAAQ;AACb,iBAAK,GAAG,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;AACtC,gBAAI,MAAM,GAAG,SAAS,KAAK;AAC3B,qBAAS,IAAI,KAAK,MAAM,EAAE,GAAG,KAAK,KAAK,KAAK,EAAE,GAAG,KAAK,IAAI,EAAE,GAAG;AAC7D,kBAAI,IAAI,GAAG,CAAC;AACZ,kBAAI,MAAM,CAAC,MAAM,KACb,UAAU,IAAI,CAAC,KACf,CAAC,YAAY,WAAW,GAAG,CAAC,GAAG;AACjC,sBAAM,CAAC,IAAI;AACX,sBAAM,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;AAC3B,0BAAU,IAAI,CAAC;AAAA,cACjB;AAAA,YACF;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH,CAAC;AAED,aAAO,EAAE,MAAY,MAAa;AAAA,IACpC;AAEA,aAAS,qBAAqB,GAAG,UAAU,MAAM,OAAO,YAAY;AAMlE,UAAI,KAAK,CAAC,GACR,SAAS,gBAAgB,GAAG,UAAU,MAAM,UAAU,GACtD,aAAa,aAAa,eAAe;AAE3C,eAAS,QAAQ,WAAW,eAAe;AACzC,YAAI,QAAQ,OAAO,MAAM;AACzB,YAAI,OAAO,MAAM,IAAI;AACrB,YAAI,UAAU,CAAC;AACf,eAAO,MAAM;AACX,cAAI,QAAQ,IAAI,GAAG;AACjB,sBAAU,IAAI;AAAA,UAChB,OAAO;AACL,oBAAQ,IAAI,IAAI;AAChB,kBAAM,KAAK,IAAI;AACf,oBAAQ,MAAM,OAAO,cAAc,IAAI,CAAC;AAAA,UAC1C;AAEA,iBAAO,MAAM,IAAI;AAAA,QACnB;AAAA,MACF;AAGA,eAAS,MAAM,MAAM;AACnB,WAAG,IAAI,IAAI,OAAO,QAAQ,IAAI,EAAE,OAAO,CAAC,KAAK,MAAM;AACjD,iBAAO,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AAAA,QAC/C,GAAG,CAAC;AAAA,MACN;AAGA,eAAS,MAAM,MAAM;AACnB,YAAI,MAAM,OAAO,SAAS,IAAI,EAAE,OAAO,CAAC,KAAK,MAAM;AACjD,iBAAO,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AAAA,QAC/C,GAAG,OAAO,iBAAiB;AAE3B,YAAI,OAAO,EAAE,KAAK,IAAI;AACtB,YAAI,QAAQ,OAAO,qBAAqB,KAAK,eAAe,YAAY;AACtE,aAAG,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG;AAAA,QACnC;AAAA,MACF;AAEA,cAAQ,OAAO,OAAO,aAAa,KAAK,MAAM,CAAC;AAC/C,cAAQ,OAAO,OAAO,WAAW,KAAK,MAAM,CAAC;AAG7C,aAAO,KAAK,KAAK,EAAE,QAAQ,OAAK,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;AAEnD,aAAO;AAAA,IACT;AAGA,aAAS,gBAAgB,GAAG,UAAU,MAAM,YAAY;AACtD,UAAI,aAAa,IAAI,MAAM,GACzB,aAAa,EAAE,MAAM,GACrB,QAAQ,IAAI,WAAW,SAAS,WAAW,SAAS,UAAU;AAEhE,eAAS,QAAQ,WAAS;AACxB,YAAI;AACJ,cAAM,QAAQ,OAAK;AACjB,cAAI,QAAQ,KAAK,CAAC;AAClB,qBAAW,QAAQ,KAAK;AACxB,cAAI,GAAG;AACL,gBAAI,QAAQ,KAAK,CAAC,GAChB,UAAU,WAAW,KAAK,OAAO,KAAK;AACxC,uBAAW,QAAQ,OAAO,OAAO,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;AAAA,UACzE;AACA,cAAI;AAAA,QACN,CAAC;AAAA,MACH,CAAC;AAED,aAAO;AAAA,IACT;AAKA,aAAS,2BAA2B,GAAG,KAAK;AAC1C,aAAO,OAAO,OAAO,GAAG,EAAE,OAAO,CAAC,iBAAiB,OAAO;AACxD,YAAI,MAAM,OAAO;AACjB,YAAI,MAAM,OAAO;AAEjB,eAAO,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM;AACrC,cAAI,YAAY,MAAM,GAAG,CAAC,IAAI;AAE9B,gBAAM,KAAK,IAAI,IAAI,WAAW,GAAG;AACjC,gBAAM,KAAK,IAAI,IAAI,WAAW,GAAG;AAAA,QACnC,CAAC;AAED,cAAM,SAAS,MAAM;AACrB,YAAI,SAAS,gBAAgB,CAAC,GAAG;AAC/B,4BAAkB,CAAC,QAAQ,EAAE;AAAA,QAC/B;AACA,eAAO;AAAA,MACT,GAAG,CAAC,OAAO,mBAAmB,IAAI,CAAC,EAAE,CAAC;AAAA,IACxC;AASA,aAAS,iBAAiB,KAAK,SAAS;AACtC,UAAI,cAAc,OAAO,OAAO,OAAO,GACrC,aAAa,KAAK,kBAAkB,KAAK,KAAK,WAAW,GACzD,aAAa,KAAK,kBAAkB,KAAK,KAAK,WAAW;AAE3D,OAAC,KAAK,GAAG,EAAE,QAAQ,UAAQ;AACzB,SAAC,KAAK,GAAG,EAAE,QAAQ,WAAS;AAC1B,cAAI,YAAY,OAAO,OACrB,KAAK,IAAI,SAAS;AAEpB,cAAI,OAAO,QAAS;AAEpB,cAAI,SAAS,OAAO,OAAO,EAAE;AAC7B,cAAI,QAAQ,aAAa,KAAK,kBAAkB,KAAK,KAAK,MAAM;AAChE,cAAI,UAAU,KAAK;AACjB,oBAAQ,aAAa,KAAK,kBAAkB,KAAK,KAAI,MAAM;AAAA,UAC7D;AAEA,cAAI,OAAO;AACT,gBAAI,SAAS,IAAI,KAAK,UAAU,IAAI,OAAK,IAAI,KAAK;AAAA,UACpD;AAAA,QACF,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAEA,aAAS,QAAQ,KAAK,OAAO;AAC3B,aAAO,KAAK,UAAU,IAAI,IAAI,CAAC,KAAK,MAAM;AACxC,YAAI,OAAO;AACT,iBAAO,IAAI,MAAM,YAAY,CAAC,EAAE,CAAC;AAAA,QACnC,OAAO;AACL,cAAI,KAAK,OAAO,OAAO,GAAG,EAAE,IAAI,CAAAC,QAAMA,IAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACjE,kBAAQ,GAAG,CAAC,IAAI,GAAG,CAAC,KAAK;AAAA,QAC3B;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,UAAU,GAAG;AACpB,UAAI,WAAW,KAAK,iBAAiB,CAAC;AACtC,UAAI,YAAY,OAAO;AAAA,QACrB,mBAAmB,GAAG,QAAQ;AAAA,QAC9B,mBAAmB,GAAG,QAAQ;AAAA,MAAC;AAEjC,UAAI,MAAM,CAAC;AACX,UAAI;AACJ,OAAC,KAAK,GAAG,EAAE,QAAQ,UAAQ;AACzB,2BAAmB,SAAS,MAAM,WAAW,OAAO,OAAO,QAAQ,EAAE,QAAQ;AAC7E,SAAC,KAAK,GAAG,EAAE,QAAQ,WAAS;AAC1B,cAAI,UAAU,KAAK;AACjB,+BAAmB,iBAAiB,IAAI,WAAS;AAC/C,qBAAO,OAAO,OAAO,KAAK,EAAE,QAAQ;AAAA,YACtC,CAAC;AAAA,UACH;AAEA,cAAI,cAAc,SAAS,MAAM,EAAE,eAAe,EAAE,YAAY,KAAK,CAAC;AACtE,cAAI,QAAQ,kBAAkB,GAAG,kBAAkB,WAAW,UAAU;AACxE,cAAI,KAAK;AAAA,YAAqB;AAAA,YAAG;AAAA,YAC/B,MAAM;AAAA,YAAM,MAAM;AAAA,YAAO,UAAU;AAAA,UAAG;AACxC,cAAI,UAAU,KAAK;AACjB,iBAAK,KAAK,UAAU,IAAI,OAAK,CAAC,CAAC;AAAA,UACjC;AACA,cAAI,OAAO,KAAK,IAAI;AAAA,QACtB,CAAC;AAAA,MACH,CAAC;AAGD,UAAI,gBAAgB,2BAA2B,GAAG,GAAG;AACrD,uBAAiB,KAAK,aAAa;AACnC,aAAO,QAAQ,KAAK,EAAE,MAAM,EAAE,KAAK;AAAA,IACrC;AAEA,aAAS,IAAI,SAAS,SAAS,YAAY;AACzC,aAAO,CAAC,GAAG,GAAG,MAAM;AAClB,YAAI,SAAS,EAAE,KAAK,CAAC;AACrB,YAAI,SAAS,EAAE,KAAK,CAAC;AACrB,YAAI,MAAM;AACV,YAAI;AAEJ,eAAO,OAAO,QAAQ;AACtB,YAAI,OAAO,OAAO,QAAQ,UAAU,GAAG;AACrC,kBAAQ,OAAO,SAAS,YAAY,GAAG;AAAA,YACvC,KAAK;AAAK,sBAAQ,CAAC,OAAO,QAAQ;AAAG;AAAA,YACrC,KAAK;AAAK,sBAAQ,OAAO,QAAQ;AAAG;AAAA,UACpC;AAAA,QACF;AACA,YAAI,OAAO;AACT,iBAAO,aAAa,QAAQ,CAAC;AAAA,QAC/B;AACA,gBAAQ;AAER,gBAAQ,OAAO,QAAQ,UAAU,WAAW;AAC5C,gBAAQ,OAAO,QAAQ,UAAU,WAAW;AAE5C,eAAO,OAAO,QAAQ;AACtB,YAAI,OAAO,OAAO,QAAQ,UAAU,GAAG;AACrC,kBAAQ,OAAO,SAAS,YAAY,GAAG;AAAA,YACvC,KAAK;AAAK,sBAAQ,OAAO,QAAQ;AAAG;AAAA,YACpC,KAAK;AAAK,sBAAQ,CAAC,OAAO,QAAQ;AAAG;AAAA,UACrC;AAAA,QACF;AACA,YAAI,OAAO;AACT,iBAAO,aAAa,QAAQ,CAAC;AAAA,QAC/B;AACA,gBAAQ;AAER,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,MAAM,GAAG,GAAG;AACnB,aAAO,EAAE,KAAK,CAAC,EAAE;AAAA,IACnB;AAAA;AAAA;;;ACvaA;AAAA;AAAA;AAEA,QAAI,OAAO;AACX,QAAI,YAAY,aAAgB;AAEhC,WAAO,UAAU;AAEjB,aAAS,SAAS,GAAG;AACnB,UAAI,KAAK,mBAAmB,CAAC;AAE7B,gBAAU,CAAC;AACX,aAAO,QAAQ,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,IAClE;AAEA,aAAS,UAAU,GAAG;AACpB,UAAI,WAAW,KAAK,iBAAiB,CAAC;AACtC,UAAI,UAAU,EAAE,MAAM,EAAE;AACxB,UAAI,QAAQ;AACZ,eAAS,QAAQ,WAAS;AACxB,cAAM,YAAY,MAAM,OAAO,CAAC,KAAK,MAAM;AACzC,gBAAM,SAAS,EAAE,KAAK,CAAC,EAAE;AACzB,cAAI,MAAM,QAAQ;AAChB,mBAAO;AAAA,UACT,OAAO;AACL,mBAAO;AAAA,UACT;AAAA,QACF,GAAG,CAAC;AACJ,cAAM,QAAQ,OAAK,EAAE,KAAK,CAAC,EAAE,IAAI,QAAQ,YAAY,CAAC;AACtD,iBAAS,YAAY;AAAA,MACvB,CAAC;AAAA,IACH;AAAA;AAAA;;;AC9BA;AAAA;AAAA;AAEA,QAAI,UAAU;AACd,QAAIC,aAAY;AAChB,QAAI,OAAO;AACX,QAAI,iBAAiB,eAAkB;AACvC,QAAI,oBAAoB;AACxB,QAAI,mBAAmB,eAAkB;AACzC,QAAI,eAAe;AACnB,QAAI,oBAAoB;AACxB,QAAI,mBAAmB;AACvB,QAAI,QAAQ;AACZ,QAAI,WAAW;AACf,QAAI,OAAO;AACX,QAAI,QAAQ,mBAA6B;AAEzC,WAAO,UAAUC;AAEjB,aAASA,QAAO,GAAG,MAAM;AACvB,UAAI,OAAO,QAAQ,KAAK,cAAc,KAAK,OAAO,KAAK;AACvD,WAAK,UAAU,MAAM;AACnB,YAAI,cACF,KAAK,sBAAsB,MAAM,iBAAiB,CAAC,CAAC;AACtD,aAAK,eAAsB,MAAM,UAAU,aAAa,MAAM,IAAI,CAAC;AACnE,aAAK,sBAAsB,MAAM,iBAAiB,GAAG,WAAW,CAAC;AAAA,MACnE,CAAC;AAAA,IACH;AAEA,aAAS,UAAU,GAAG,MAAM,MAAM;AAChC,WAAK,8BAA8B,MAAM,uBAAuB,CAAC,CAAC;AAClE,WAAK,uBAA8B,MAAM,gBAAgB,CAAC,CAAC;AAC3D,WAAK,eAA8B,MAAM,QAAQ,IAAI,CAAC,CAAC;AACvD,WAAK,wBAA8B,MAAM,aAAa,IAAI,CAAC,CAAC;AAC5D,WAAK,YAA8B,MAAM,KAAK,KAAK,mBAAmB,CAAC,CAAC,CAAC;AACzE,WAAK,8BAA8B,MAAM,uBAAuB,CAAC,CAAC;AAClE,WAAK,wBAA8B,MAAM,iBAAiB,CAAC,CAAC;AAC5D,WAAK,4BAA8B,MAAM,aAAa,QAAQ,CAAC,CAAC;AAChE,WAAK,sBAA8B,MAAM,eAAe,CAAC,CAAC;AAC1D,WAAK,wBAA8B,MAAM,iBAAiB,CAAC,CAAC;AAC5D,WAAK,8BAA8B,MAAM,uBAAuB,CAAC,CAAC;AAClE,WAAK,qBAA8B,MAAMD,WAAU,IAAI,CAAC,CAAC;AACzD,WAAK,yBAA8B,MAAM,kBAAkB,CAAC,CAAC;AAC7D,WAAK,yBAA8B,MAAM,kBAAkB,CAAC,CAAC;AAC7D,WAAK,aAA8B,MAAM,MAAM,GAAG,IAAI,CAAC;AACvD,WAAK,uBAA8B,MAAM,gBAAgB,CAAC,CAAC;AAC3D,WAAK,8BAA8B,MAAM,iBAAiB,OAAO,CAAC,CAAC;AACnE,WAAK,gBAA8B,MAAM,SAAS,CAAC,CAAC;AACpD,WAAK,yBAA8B,MAAM,kBAAkB,CAAC,CAAC;AAC7D,WAAK,yBAA8B,MAAM,kBAAkB,CAAC,CAAC;AAC7D,WAAK,sBAA8B,MAAMA,WAAU,KAAK,CAAC,CAAC;AAC1D,WAAK,4BAA8B,MAAM,qBAAqB,CAAC,CAAC;AAChE,WAAK,4BAA8B,MAAM,iBAAiB,KAAK,CAAC,CAAC;AACjE,WAAK,sBAA8B,MAAM,eAAe,CAAC,CAAC;AAC1D,WAAK,4BAA8B,MAAM,qBAAqB,CAAC,CAAC;AAChE,WAAK,qBAA8B,MAAM,8BAA8B,CAAC,CAAC;AACzE,WAAK,oBAA8B,MAAM,QAAQ,KAAK,CAAC,CAAC;AAAA,IAC1D;AAQA,aAAS,iBAAiB,YAAY,aAAa;AACjD,iBAAW,MAAM,EAAE,QAAQ,OAAK;AAC9B,YAAI,aAAa,WAAW,KAAK,CAAC;AAClC,YAAI,cAAc,YAAY,KAAK,CAAC;AAEpC,YAAI,YAAY;AACd,qBAAW,IAAI,YAAY;AAC3B,qBAAW,IAAI,YAAY;AAC3B,qBAAW,OAAO,YAAY;AAE9B,cAAI,YAAY,SAAS,CAAC,EAAE,QAAQ;AAClC,uBAAW,QAAQ,YAAY;AAC/B,uBAAW,SAAS,YAAY;AAAA,UAClC;AAAA,QACF;AAAA,MACF,CAAC;AAED,iBAAW,MAAM,EAAE,QAAQ,OAAK;AAC9B,YAAI,aAAa,WAAW,KAAK,CAAC;AAClC,YAAI,cAAc,YAAY,KAAK,CAAC;AAEpC,mBAAW,SAAS,YAAY;AAChC,YAAI,OAAO,OAAO,aAAa,GAAG,GAAG;AACnC,qBAAW,IAAI,YAAY;AAC3B,qBAAW,IAAI,YAAY;AAAA,QAC7B;AAAA,MACF,CAAC;AAED,iBAAW,MAAM,EAAE,QAAQ,YAAY,MAAM,EAAE;AAC/C,iBAAW,MAAM,EAAE,SAAS,YAAY,MAAM,EAAE;AAAA,IAClD;AAEA,QAAI,gBAAgB,CAAC,WAAW,WAAW,WAAW,WAAW,SAAS;AAC1E,QAAI,gBAAgB,EAAE,SAAS,IAAI,SAAS,IAAI,SAAS,IAAI,SAAS,KAAK;AAC3E,QAAI,aAAa,CAAC,aAAa,UAAU,WAAW,OAAO;AAC3D,QAAI,eAAe,CAAC,SAAS,UAAU,MAAM;AAC7C,QAAI,eAAe,EAAE,OAAO,GAAG,QAAQ,EAAE;AACzC,QAAI,eAAe,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa;AACxE,QAAI,eAAe;AAAA,MACjB,QAAQ;AAAA,MAAG,QAAQ;AAAA,MAAG,OAAO;AAAA,MAAG,QAAQ;AAAA,MACxC,aAAa;AAAA,MAAI,UAAU;AAAA,IAC7B;AACA,QAAI,YAAY,CAAC,UAAU;AAQ3B,aAAS,iBAAiB,YAAY;AACpC,UAAI,IAAI,IAAI,MAAM,EAAE,YAAY,MAAM,UAAU,KAAK,CAAC;AACtD,UAAI,QAAQ,aAAa,WAAW,MAAM,CAAC;AAE3C,QAAE,SAAS,OAAO;AAAA,QAAO,CAAC;AAAA,QACxB;AAAA,QACA,kBAAkB,OAAO,aAAa;AAAA,QACtC,KAAK,KAAK,OAAO,UAAU;AAAA,MAAC,CAAC;AAE/B,iBAAW,MAAM,EAAE,QAAQ,OAAK;AAC9B,YAAI,OAAO,aAAa,WAAW,KAAK,CAAC,CAAC;AAC1C,cAAM,UAAU,kBAAkB,MAAM,YAAY;AACpD,eAAO,KAAK,YAAY,EAAE,QAAQ,OAAK;AACrC,cAAI,QAAQ,CAAC,MAAM,QAAW;AAC5B,oBAAQ,CAAC,IAAI,aAAa,CAAC;AAAA,UAC7B;AAAA,QACF,CAAC;AAED,UAAE,QAAQ,GAAG,OAAO;AACpB,UAAE,UAAU,GAAG,WAAW,OAAO,CAAC,CAAC;AAAA,MACrC,CAAC;AAED,iBAAW,MAAM,EAAE,QAAQ,OAAK;AAC9B,YAAI,OAAO,aAAa,WAAW,KAAK,CAAC,CAAC;AAC1C,UAAE,QAAQ,GAAG,OAAO;AAAA,UAAO,CAAC;AAAA,UAC1B;AAAA,UACA,kBAAkB,MAAM,YAAY;AAAA,UACpC,KAAK,KAAK,MAAM,SAAS;AAAA,QAAC,CAAC;AAAA,MAC/B,CAAC;AAED,aAAO;AAAA,IACT;AAUA,aAAS,uBAAuB,GAAG;AACjC,UAAI,QAAQ,EAAE,MAAM;AACpB,YAAM,WAAW;AACjB,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,UAAU;AACf,YAAI,KAAK,SAAS,YAAY,MAAM,KAAK;AACvC,cAAI,MAAM,YAAY,QAAQ,MAAM,YAAY,MAAM;AACpD,iBAAK,SAAS,KAAK;AAAA,UACrB,OAAO;AACL,iBAAK,UAAU,KAAK;AAAA,UACtB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAQA,aAAS,uBAAuB,GAAG;AACjC,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,SAAS,KAAK,QAAQ;AAC7B,cAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,cAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,cAAI,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,IAAI,EAAE,MAAM,EAAK;AACzD,eAAK,aAAa,GAAG,cAAc,OAAO,KAAK;AAAA,QACjD;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,iBAAiB,GAAG;AAC3B,UAAI,UAAU;AACd,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,WAAW;AAClB,eAAK,UAAU,EAAE,KAAK,KAAK,SAAS,EAAE;AACtC,eAAK,UAAU,EAAE,KAAK,KAAK,YAAY,EAAE;AACzC,oBAAU,KAAK,IAAI,SAAS,KAAK,OAAO;AAAA,QAC1C;AAAA,MACF,CAAC;AACD,QAAE,MAAM,EAAE,UAAU;AAAA,IACtB;AAEA,aAAS,uBAAuB,GAAG;AACjC,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,UAAU,cAAc;AAC/B,YAAE,KAAK,KAAK,CAAC,EAAE,YAAY,KAAK;AAChC,YAAE,WAAW,CAAC;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,eAAe,GAAG;AACzB,UAAI,OAAO,OAAO;AAClB,UAAI,OAAO;AACX,UAAI,OAAO,OAAO;AAClB,UAAI,OAAO;AACX,UAAI,aAAa,EAAE,MAAM;AACzB,UAAI,UAAU,WAAW,WAAW;AACpC,UAAI,UAAU,WAAW,WAAW;AAEpC,eAAS,YAAY,OAAO;AAC1B,YAAI,IAAI,MAAM;AACd,YAAI,IAAI,MAAM;AACd,YAAI,IAAI,MAAM;AACd,YAAI,IAAI,MAAM;AACd,eAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,eAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,eAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAC/B,eAAO,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC;AAAA,MACjC;AAEA,QAAE,MAAM,EAAE,QAAQ,OAAK,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;AAC7C,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAC5B,sBAAY,IAAI;AAAA,QAClB;AAAA,MACF,CAAC;AAED,cAAQ;AACR,cAAQ;AAER,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,KAAK;AACV,aAAK,KAAK;AAAA,MACZ,CAAC;AAED,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,aAAK,OAAO,QAAQ,OAAK;AACvB,YAAE,KAAK;AACP,YAAE,KAAK;AAAA,QACT,CAAC;AACD,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAAE,eAAK,KAAK;AAAA,QAAM;AAChD,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAAE,eAAK,KAAK;AAAA,QAAM;AAAA,MAClD,CAAC;AAED,iBAAW,QAAQ,OAAO,OAAO;AACjC,iBAAW,SAAS,OAAO,OAAO;AAAA,IACpC;AAEA,aAAS,qBAAqB,GAAG;AAC/B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtB,YAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;AACtB,YAAI,IAAI;AACR,YAAI,CAAC,KAAK,QAAQ;AAChB,eAAK,SAAS,CAAC;AACf,eAAK;AACL,eAAK;AAAA,QACP,OAAO;AACL,eAAK,KAAK,OAAO,CAAC;AAClB,eAAK,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAAA,QACzC;AACA,aAAK,OAAO,QAAQ,KAAK,cAAc,OAAO,EAAE,CAAC;AACjD,aAAK,OAAO,KAAK,KAAK,cAAc,OAAO,EAAE,CAAC;AAAA,MAChD,CAAC;AAAA,IACH;AAEA,aAAS,qBAAqB,GAAG;AAC/B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,OAAO,OAAO,MAAM,GAAG,GAAG;AAC5B,cAAI,KAAK,aAAa,OAAO,KAAK,aAAa,KAAK;AAClD,iBAAK,SAAS,KAAK;AAAA,UACrB;AACA,kBAAQ,KAAK,UAAU;AAAA,YACvB,KAAK;AAAK,mBAAK,KAAK,KAAK,QAAQ,IAAI,KAAK;AAAa;AAAA,YACvD,KAAK;AAAK,mBAAK,KAAK,KAAK,QAAQ,IAAI,KAAK;AAAa;AAAA,UACvD;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,8BAA8B,GAAG;AACxC,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,UAAU;AACjB,eAAK,OAAO,QAAQ;AAAA,QACtB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,kBAAkB,GAAG;AAC5B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,EAAE,SAAS,CAAC,EAAE,QAAQ;AACxB,cAAI,OAAO,EAAE,KAAK,CAAC;AACnB,cAAI,IAAI,EAAE,KAAK,KAAK,SAAS;AAC7B,cAAI,IAAI,EAAE,KAAK,KAAK,YAAY;AAChC,cAAI,IAAI,EAAE,KAAK,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC,CAAC;AAC1D,cAAI,IAAI,EAAE,KAAK,KAAK,YAAY,KAAK,YAAY,SAAS,CAAC,CAAC;AAE5D,eAAK,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAC/B,eAAK,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;AAChC,eAAK,IAAI,EAAE,IAAI,KAAK,QAAQ;AAC5B,eAAK,IAAI,EAAE,IAAI,KAAK,SAAS;AAAA,QAC/B;AAAA,MACF,CAAC;AAED,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,EAAE,KAAK,CAAC,EAAE,UAAU,UAAU;AAChC,YAAE,WAAW,CAAC;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,gBAAgB,GAAG;AAC1B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,EAAE,MAAM,EAAE,GAAG;AACf,cAAI,OAAO,EAAE,KAAK,EAAE,CAAC;AACrB,cAAI,CAAC,KAAK,WAAW;AACnB,iBAAK,YAAY,CAAC;AAAA,UACpB;AACA,eAAK,UAAU,KAAK,EAAE,GAAM,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;AAC9C,YAAE,WAAW,CAAC;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,gBAAgB,GAAG;AAC1B,UAAI,SAAS,KAAK,iBAAiB,CAAC;AACpC,aAAO,QAAQ,WAAS;AACtB,YAAI,aAAa;AACjB,cAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,cAAI,OAAO,EAAE,KAAK,CAAC;AACnB,eAAK,QAAQ,IAAI;AACjB,WAAC,KAAK,aAAa,CAAC,GAAG,QAAQ,cAAY;AACzC,iBAAK,aAAa,GAAG,YAAY;AAAA,cAC/B,OAAO,SAAS,MAAM;AAAA,cACtB,QAAQ,SAAS,MAAM;AAAA,cACvB,MAAM,KAAK;AAAA,cACX,OAAO,IAAK,EAAE;AAAA,cACd,GAAG,SAAS;AAAA,cACZ,OAAO,SAAS;AAAA,YAClB,GAAG,KAAK;AAAA,UACV,CAAC;AACD,iBAAO,KAAK;AAAA,QACd,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAEA,aAAS,kBAAkB,GAAG;AAC5B,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,YAAI,OAAO,EAAE,KAAK,CAAC;AACnB,YAAI,KAAK,UAAU,YAAY;AAC7B,cAAI,WAAW,EAAE,KAAK,KAAK,EAAE,CAAC;AAC9B,cAAI,IAAI,SAAS,IAAI,SAAS,QAAQ;AACtC,cAAI,IAAI,SAAS;AACjB,cAAI,KAAK,KAAK,IAAI;AAClB,cAAI,KAAK,SAAS,SAAS;AAC3B,YAAE,QAAQ,KAAK,GAAG,KAAK,KAAK;AAC5B,YAAE,WAAW,CAAC;AACd,eAAK,MAAM,SAAS;AAAA,YAClB,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG;AAAA,YAC/B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG;AAAA,YAC/B,EAAE,GAAG,IAAQ,IAAQ,EAAK;AAAA,YAC1B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG;AAAA,YAC/B,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,IAAI,GAAG;AAAA,UACjC;AACA,eAAK,MAAM,IAAI,KAAK;AACpB,eAAK,MAAM,IAAI,KAAK;AAAA,QACtB;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,kBAAkB,KAAK,OAAO;AACrC,aAAO,KAAK,UAAU,KAAK,KAAK,KAAK,KAAK,GAAG,MAAM;AAAA,IACrD;AAEA,aAAS,aAAa,OAAO;AAC3B,UAAI,WAAW,CAAC;AAChB,UAAI,OAAO;AACT,eAAO,QAAQ,KAAK,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM;AACxC,cAAI,OAAO,MAAM,UAAU;AACzB,gBAAI,EAAE,YAAY;AAAA,UACpB;AAEA,mBAAS,CAAC,IAAI;AAAA,QAChB,CAAC;AAAA,MACH;AACA,aAAO;AAAA,IACT;AAAA;AAAA;;;ACpZA;AAAA;AAAA;AAAA,QAAI,OAAO;AACX,QAAI,QAAQ,mBAA6B;AAEzC,WAAO,UAAU;AAAA,MACf;AAAA,IACF;AAGA,aAAS,cAAc,GAAG;AACxB,UAAI,cAAc,KAAK,iBAAiB,CAAC;AAEzC,UAAI,IAAI,IAAI,MAAM,EAAE,UAAU,MAAM,YAAY,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;AAEnE,QAAE,MAAM,EAAE,QAAQ,OAAK;AACrB,UAAE,QAAQ,GAAG,EAAE,OAAO,EAAE,CAAC;AACzB,UAAE,UAAU,GAAG,UAAU,EAAE,KAAK,CAAC,EAAE,IAAI;AAAA,MACzC,CAAC;AAED,QAAE,MAAM,EAAE,QAAQ,OAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC;AAEtD,kBAAY,QAAQ,CAAC,OAAO,MAAM;AAChC,YAAI,SAAS,UAAU;AACvB,UAAE,QAAQ,QAAQ,EAAE,MAAM,OAAO,CAAC;AAClC,cAAM,OAAO,CAAC,GAAG,MAAM;AACrB,YAAE,QAAQ,GAAG,GAAG,EAAE,OAAO,QAAQ,CAAC;AAClC,iBAAO;AAAA,QACT,CAAC;AAAA,MACH,CAAC;AAED,aAAO;AAAA,IACT;AAAA;AAAA;;;AC9BA,IAAAE,mBAAA;AAAA;AAAA;AAAA,WAAO,UAAU;AAAA;AAAA;;;ACAjB;AAAA;AAAA;AAsBA,WAAO,UAAU;AAAA,MACf,UAAU;AAAA,MAEV,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,MAAM;AAAA,QACJ,MAAM,eAAsB;AAAA,QAC5B,QAAQ,eAAsB;AAAA,MAChC;AAAA,MACA,SAAS;AAAA,IACX;AAAA;AAAA;;;AC9BO,IAAM,gBAAgB;AAAA,EAC3B,iBAAiB,CAAC,OAChB,qBAAqB,EAAE;AAAA,EAEzB,eAAe,MACb;AAAA,EAEF,aAAa,CAAC,SACZ,wBAAwB,IAAI;AAAA,EAE9B,iBAAiB,CAAC,SAChB,WAAW,IAAI;AAAA,EAEjB,YAAY,CAAC,KAAa,eACxB,WAAW,GAAG,oCAAoC,UAAU;AAAA,EAE9D,aAAa,CAAC,WACZ,iBAAiB,MAAM;AAAA,EAEzB,cAAc,MACZ;AAAA,EAEF,wBAAwB,CAAC,MAAc,WACrC,SAAS,IAAI,gBAAgB,MAAM,mEAAmE,IAAI,UAAU,IAAI;AAC5H;AAQO,SAAS,aAAa,GAAW,GAAmB;AACzD,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,EAAE;AACb,QAAM,KAAiB,MAAM,KAAK,EAAE,QAAQ,KAAK,EAAE,GAAG,MAAM,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;AACjF,WAAS,IAAI,GAAG,KAAK,IAAI,IAAK,IAAG,CAAC,EAAE,CAAC,IAAI;AACzC,WAAS,IAAI,GAAG,KAAK,IAAI,IAAK,IAAG,CAAC,EAAE,CAAC,IAAI;AACzC,WAAS,IAAI,GAAG,KAAK,IAAI,KAAK;AAC5B,aAAS,IAAI,GAAG,KAAK,IAAI,KAAK;AAC5B,YAAM,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI;AACzC,SAAG,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI;AAAA,IACjF;AAAA,EACF;AACA,SAAO,GAAG,EAAE,EAAE,EAAE;AAClB;AAEO,SAAS,eAAe,KAAqB;AAClD,SAAO,IACJ,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ,EACtB,QAAQ,MAAM,OAAO;AAC1B;;;AC1CA,SAAS,UAAU,KAAqB;AACtC,SAAO,IAAI,KAAK,EAAE,YAAY,EAAE,QAAQ,QAAQ,GAAG;AACrD;AAEA,SAAS,YAAY,QAAgB,SAAyB;AAC5D,SAAO,GAAG,UAAU,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC;AACpD;AAEA,SAAS,oBAAoB,KAAqC;AAChE,QAAM,SAAiC,CAAC;AAExC,QAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,aAAW,QAAQ,OAAO;AACxB,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,UAAU,IAAI;AAChB,YAAM,MAAM,KAAK,MAAM,GAAG,KAAK,EAAE,KAAK;AACtC,YAAM,QAAQ,KAAK,MAAM,QAAQ,CAAC,EAAE,KAAK;AACzC,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAA8E;AACnG,QAAM,UAAU,IAAI,KAAK;AAGzB,QAAM,YAAY,QAAQ,YAAY,GAAG;AACzC,QAAM,aAAa,QAAQ,YAAY,GAAG;AAC1C,MAAI,cAAc,MAAM,eAAe,MAAM,aAAa,WAAW;AACnE,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,QAAQ,MAAM,YAAY,GAAG,UAAU;AACpD,QAAM,SAAS,QAAQ,MAAM,GAAG,SAAS,EAAE,KAAK;AAGhD,QAAM,SAAS,OAAO,QAAQ,GAAG;AACjC,MAAI,WAAW,IAAI;AACjB,UAAM,SAAS,OAAO,MAAM,GAAG,MAAM,EAAE,KAAK;AAC5C,UAAM,UAAU,OAAO,MAAM,SAAS,CAAC,EAAE,KAAK;AAC9C,WAAO,EAAE,QAAQ,SAAS,KAAK;AAAA,EACjC;AAEA,SAAO,EAAE,QAAQ,QAAQ,SAAS,MAAM,KAAK;AAC/C;AAGA,IAAM,mBAAmB,OAAO,KAAK,gBAAgB,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAEzF,SAAS,aAAa,MAA0D;AAC9E,aAAW,MAAM,kBAAkB;AACjC,UAAM,MAAM,KAAK,QAAQ,EAAE;AAC3B,QAAI,QAAQ,IAAI;AACd,aAAO,EAAE,UAAU,IAAI,OAAO,IAAI;AAAA,IACpC;AAAA,EACF;AACA,SAAO;AACT;AAIO,SAAS,MAAM,OAA4B;AAChD,QAAM,SAA4B,CAAC;AACnC,QAAM,WAA8B,CAAC;AAGrC,QAAM,aAAa,MAAM,QAAQ,SAAS,IAAI;AAC9C,QAAM,QAAQ,WAAW,MAAM,IAAI;AAEnC,QAAM,kBAAsC,oBAAI,IAAI;AACpD,QAAM,YAAgC,oBAAI,IAAI;AAC9C,QAAM,cAA4B,CAAC;AAEnC,MAAI,oBAAmC;AACvC,MAAI,eAA8B;AAClC,QAAM,SAAmB,CAAC;AAC1B,MAAI,YAA0B;AAC9B,MAAI,oBAAoB;AAExB,WAAS,UAAU,GAAG,UAAU,MAAM,QAAQ,WAAW;AACvD,UAAM,OAAO,MAAM,OAAO;AAC1B,UAAM,UAAU,UAAU;AAG1B,QAAI,KAAK,KAAK,MAAM,GAAI;AAGxB,QAAI,KAAK,WAAW,aAAa,EAAG;AAGpC,QAAI,KAAK,KAAK,EAAE,WAAW,IAAI,EAAG;AAGlC,QAAI,KAAK,UAAU,EAAE,WAAW,IAAI,GAAG;AACrC,kBAAY;AACZ,YAAM,WAAW,KAAK,UAAU,EAAE,MAAM,CAAC;AAGzC,UAAI,aAA4B;AAChC,UAAI,WAAW;AACf,YAAM,gBAAgB,SAAS,QAAQ,MAAM;AAC7C,UAAI,kBAAkB,IAAI;AACxB,qBAAa,SAAS,MAAM,gBAAgB,CAAC,EAAE,KAAK;AACpD,mBAAW,SAAS,MAAM,GAAG,aAAa;AAAA,MAC5C;AAGA,UAAI,iBAAgD;AACpD,YAAM,cAAc,SAAS,YAAY,GAAG;AAC5C,YAAM,eAAe,SAAS,YAAY,GAAG;AAC7C,UAAI,gBAAgB,MAAM,iBAAiB,MAAM,eAAe,aAAa;AAC3E,cAAM,YAAY,SAAS,MAAM,cAAc,GAAG,YAAY;AAC9D,yBAAiB,oBAAoB,SAAS;AAC9C,mBAAW,SAAS,MAAM,GAAG,WAAW,EAAE,KAAK;AAAA,MACjD;AAGA,YAAM,WAAW,aAAa,QAAQ;AACtC,UAAI,CAAC,UAAU;AACb,eAAO,KAAK;AAAA,UACV,MAAM;AAAA,UACN,SAAS,cAAc,YAAY,yBAAyB;AAAA,UAC5D,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AAEA,YAAM,EAAE,UAAU,OAAO,MAAM,IAAI;AACnC,YAAM,aAAa,iBAAiB,QAAQ;AAC5C,YAAM,aAAa,SAAS,MAAM,GAAG,KAAK,EAAE,KAAK;AACjD,YAAM,aAAa,SAAS,MAAM,QAAQ,SAAS,MAAM,EAAE,KAAK;AAGhE,YAAM,iBAAiB,cAAc,UAAU;AAC/C,YAAM,iBAAiB,cAAc,UAAU;AAE/C,UAAI,CAAC,gBAAgB;AACnB,eAAO,KAAK;AAAA,UACV,MAAM;AAAA,UACN,SAAS,cAAc,YAAY,QAAQ;AAAA,UAC3C,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AAEA,UAAI,CAAC,gBAAgB;AACnB,eAAO,KAAK;AAAA,UACV,MAAM;AAAA,UACN,SAAS,cAAc,YAAY,QAAQ;AAAA,UAC3C,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AAGA,YAAM,cAAc,aAAa,gBAAgB,YAAY;AAC7D,YAAM,cAAc,aAAa,gBAAgB,YAAY;AAG7D,iBAAW,aAAa,eAAe,MAAM,KAAK;AAClD,iBAAW,aAAa,eAAe,MAAM,IAAI;AAEjD,YAAM,OAAmB;AAAA,QACvB,IAAI,QAAQ,mBAAmB;AAAA,QAC/B,QAAQ;AAAA,UACN,SAAS,YAAY;AAAA,UACrB,QAAQ,eAAe,KAAK,KAAK,EAAE,YAAY;AAAA,UAC/C,aAAa,eAAe,KAAK,KAAK;AAAA,QACxC;AAAA,QACA,QAAQ;AAAA,UACN,SAAS,YAAY;AAAA,UACrB,QAAQ,eAAe,KAAK,KAAK,EAAE,YAAY;AAAA,UAC/C,aAAa,eAAe,KAAK,KAAK;AAAA,QACxC;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,kBAAY,KAAK,IAAI;AACrB;AAAA,IACF;AAGA,QAAI,KAAK,UAAU,EAAE,WAAW,GAAG,GAAG;AACpC,UAAI,WAAW;AACb,cAAM,QAAQ,KAAK,UAAU,EAAE,MAAM,CAAC,EAAE,KAAK;AAC7C,kBAAU,SAAS,OAAO;AAAA,MAC5B;AACA;AAAA,IACF;AAGA,QAAI,KAAK,UAAU,EAAE,WAAW,GAAG,GAAG;AACpC,YAAM,eAAe,KAAK,UAAU,EAAE,MAAM,CAAC,EAAE,KAAK;AACpD,YAAM,WAAW,aAAa,QAAQ,GAAG;AACzC,UAAI;AACJ,UAAI;AACJ,UAAI,aAAa,IAAI;AACnB,cAAM,aAAa,MAAM,GAAG,QAAQ,EAAE,KAAK;AAC3C,gBAAQ,aAAa,MAAM,WAAW,CAAC,EAAE,KAAK;AAAA,MAChD,OAAO;AACL,cAAM;AACN,gBAAQ;AAAA,MACV;AAEA,YAAM,QAAe,EAAE,KAAK,MAAM;AAClC,kBAAY;AAGZ,UAAI,mBAAmB;AACrB,cAAM,YAAY,kBAAkB,YAAY;AAChD,cAAM,QAAQ,gBAAgB,IAAI,SAAS;AAC3C,YAAI,OAAO;AACT,gBAAM,OAAO,KAAK,KAAK;AAAA,QACzB;AAAA,MACF;AACA;AAAA,IACF;AAGA,QAAI,KAAK,KAAK,EAAE,SAAS,GAAG,KAAK,CAAC,KAAK,KAAK,EAAE,WAAW,GAAG,KAAK,CAAC,KAAK,KAAK,EAAE,WAAW,GAAG,KAAK,CAAC,KAAK,KAAK,EAAE,WAAW,GAAG,GAAG;AAC7H,kBAAY;AACZ,YAAM,UAAU,KAAK,KAAK,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK;AAG9C,UAAI,aAAa;AACjB,UAAI,UAAyB;AAC7B,YAAM,eAAe,QAAQ,MAAM,wBAAwB;AAC3D,UAAI,cAAc;AAChB,qBAAa,aAAa,CAAC,EAAE,KAAK;AAClC,kBAAU,aAAa,CAAC,EAAE,KAAK;AAAA,MACjC;AAGA,UAAI,aAAa,KAAK,UAAU,GAAG;AACjC,uBAAe;AACf,4BAAoB;AACpB,YAAI,CAAC,OAAO,SAAS,UAAU,GAAG;AAChC,iBAAO,KAAK,UAAU;AAAA,QACxB;AACA;AAAA,MACF;AAGA,0BAAoB;AAEpB,YAAM,YAAY,WAAW,YAAY;AACzC,UAAI,CAAC,gBAAgB,IAAI,SAAS,GAAG;AACnC,cAAM,QAAe;AAAA,UACnB,IAAI,UAAU,UAAU;AAAA,UACxB,OAAO;AAAA,UACP,UAAU;AAAA,UACV,QAAQ,CAAC;AAAA,UACT,OAAO,CAAC;AAAA,UACR,cAAc;AAAA,UACd,OAAO;AAAA,QACT;AACA,wBAAgB,IAAI,WAAW,KAAK;AACpC,kBAAU,IAAI,MAAM,IAAI,KAAK;AAAA,MAC/B,WAAW,SAAS;AAElB,cAAM,WAAW,gBAAgB,IAAI,SAAS;AAC9C,YAAI,CAAC,SAAS,SAAU,UAAS,WAAW;AAAA,MAC9C;AACA;AAAA,IACF;AAGA,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS,cAAc,YAAY,0BAA0B;AAAA,MAC7D,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ,KAAK;AAAA,MACb,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAKA,MAAI,qBAA8B,CAAC,GAAG,gBAAgB,OAAO,CAAC;AAC9D,QAAM,aAAsB,CAAC;AAC7B,aAAW,CAAC,IAAI,KAAK,KAAK,WAAW;AACnC,QAAI,CAAC,CAAC,GAAG,gBAAgB,OAAO,CAAC,EAAE,KAAK,OAAK,EAAE,OAAO,EAAE,GAAG;AACzD,iBAAW,KAAK,KAAK;AAAA,IACvB;AAAA,EACF;AAKA,QAAM,iBAA8B,oBAAI,IAAI;AAC5C,aAAW,UAAU,oBAAoB;AACvC,UAAM,mBAAmB,OAAO,MAAM,KAAK,EAAE,YAAY;AACzD,UAAM,gBAAyB,CAAC;AAChC,eAAW,SAAS,CAAC,GAAG,oBAAoB,GAAG,UAAU,GAAG;AAC1D,UAAI,MAAM,gBAAgB,MAAM,aAAa,KAAK,EAAE,YAAY,MAAM,kBAAkB;AACtF,sBAAc,KAAK,KAAK;AAAA,MAC1B;AAAA,IACF;AACA,QAAI,cAAc,WAAW,EAAG;AAGhC,UAAM,kBAA2B,CAAC;AAClC,eAAW,SAAS,OAAO,QAAQ;AACjC,YAAM,WAAW,MAAM,IAAI,KAAK,EAAE,YAAY;AAC9C,YAAM,kBAAkB,cAAc;AAAA,QACpC,OAAK,EAAE,MAAM,KAAK,EAAE,YAAY,MAAM;AAAA,MACxC;AACA,UAAI,iBAAiB;AACnB,wBAAgB,OAAO,KAAK,KAAK;AAAA,MACnC,OAAO;AACL,wBAAgB,KAAK,KAAK;AAAA,MAC5B;AAAA,IACF;AACA,WAAO,SAAS;AAGhB,QAAI,gBAAgB,WAAW,GAAG;AAChC,YAAM,qBAAqB,YAAY;AAAA,QACrC,OAAK,EAAE,OAAO,YAAY,OAAO,MAAM,EAAE,OAAO,YAAY,OAAO;AAAA,MACrE;AACA,UAAI,CAAC,oBAAoB;AACvB,uBAAe,IAAI,OAAO,EAAE;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AACA,MAAI,eAAe,OAAO,GAAG;AAC3B,yBAAqB,mBAAmB,OAAO,OAAK,CAAC,eAAe,IAAI,EAAE,EAAE,CAAC;AAAA,EAC/E;AAGA,QAAM,EAAE,SAAS,SAAS,IAAI,oBAAoB,WAAW;AAG7D,QAAM,kBAAuD,CAAC;AAC9D,aAAW,QAAQ,CAAC,GAAG,SAAS,GAAG,QAAQ,GAAG;AAC5C,oBAAgB,KAAK,UAAU,KAAK,gBAAgB,KAAK,UAAU,KAAK,KAAK;AAAA,EAC/E;AAGA,QAAM,gBAAgB,CAAC,GAAG,gBAAgB,KAAK,CAAC;AAChD,aAAW,QAAQ,YAAY;AAC7B,UAAM,YAAY,KAAK,MAAM,YAAY;AACzC,eAAW,YAAY,eAAe;AACpC,YAAM,OAAO,aAAa,WAAW,QAAQ;AAC7C,UAAI,OAAO,KAAK,QAAQ,GAAG;AACzB,cAAM,YAAY,gBAAgB,IAAI,QAAQ;AAC9C,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,SAAS,cAAc,WAAW,KAAK,OAAO,UAAU,KAAK;AAAA,UAC7D,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ,KAAK,MAAM;AAAA,UACnB,UAAU;AAAA,QACZ,CAAC;AACD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAKA,QAAM,eAAoD,oBAAI,IAAI;AAElE,QAAM,WAAW,CAAC,GAAG,SAAS,GAAG,QAAQ;AACzC,aAAW,QAAQ,UAAU;AAE3B,UAAM,WAAW,KAAK,OAAO;AAC7B,QAAI,CAAC,aAAa,IAAI,QAAQ,EAAG,cAAa,IAAI,UAAU,oBAAI,IAAI,CAAC;AACrE,UAAM,WAAW,aAAa,IAAI,QAAQ;AAC1C,QAAI,CAAC,SAAS,IAAI,KAAK,OAAO,MAAM,EAAG,UAAS,IAAI,KAAK,OAAO,QAAQ,EAAE,UAAU,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC;AACtG,aAAS,IAAI,KAAK,OAAO,MAAM,EAAG,SAAS,KAAK,CAAC;AAGjD,UAAM,WAAW,KAAK,OAAO;AAC7B,QAAI,CAAC,aAAa,IAAI,QAAQ,EAAG,cAAa,IAAI,UAAU,oBAAI,IAAI,CAAC;AACrE,UAAM,WAAW,aAAa,IAAI,QAAQ;AAC1C,QAAI,CAAC,SAAS,IAAI,KAAK,OAAO,MAAM,EAAG,UAAS,IAAI,KAAK,OAAO,QAAQ,EAAE,UAAU,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC;AACtG,aAAS,IAAI,KAAK,OAAO,MAAM,EAAG,SAAS,KAAK,CAAC;AAAA,EACnD;AAEA,aAAW,CAAC,SAAS,OAAO,KAAK,cAAc;AAC7C,eAAW,CAAC,QAAQ,KAAK,KAAK,SAAS;AACrC,UAAI,MAAM,SAAS,SAAS,KAAK,MAAM,SAAS,SAAS,GAAG;AAE1D,cAAM,QAAQ,UAAU,IAAI,OAAO;AACnC,cAAM,aAAa,QAAQ,MAAM,QAAQ;AAEzC,cAAM,UAAU,SAAS,KAAK,OAAK,EAAE,OAAO,YAAY,WAAW,EAAE,OAAO,WAAW,MAAM;AAC7F,cAAM,UAAU,SAAS,KAAK,OAAK,EAAE,OAAO,YAAY,WAAW,EAAE,OAAO,WAAW,MAAM;AAC7F,cAAM,cAAc,UAAU,QAAQ,OAAO,cAAe,UAAU,QAAQ,OAAO,cAAc;AAEnG,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,SAAS,cAAc,uBAAuB,aAAa,UAAU;AAAA,UACrE,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAoB;AAAA,IACxB,gBAAgB;AAAA,IAChB;AAAA,IACA,aAAa;AAAA,IACb,eAAe;AAAA,IACf;AAAA,IACA;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,QAAQ,SAAS;AAIjC,WAAS,aACP,UACA,OACO;AACP,UAAM,EAAE,QAAQ,QAAQ,IAAI;AAE5B,QAAI,SAAS;AAEX,YAAMC,WAAU,YAAY,QAAQ,OAAO;AAC3C,UAAI,UAAU,IAAIA,QAAO,GAAG;AAC1B,eAAO,UAAU,IAAIA,QAAO;AAAA,MAC9B;AACA,YAAMC,SAAe;AAAA,QACnB,IAAID;AAAA,QACJ,OAAO;AAAA,QACP,UAAU;AAAA,QACV,QAAQ,CAAC;AAAA,QACT,OAAO,CAAC;AAAA,QACR,cAAc;AAAA,QACd;AAAA,MACF;AACA,gBAAU,IAAIA,UAASC,MAAK;AAC5B,aAAOA;AAAA,IACT;AAGA,UAAM,cAAc,OAAO,YAAY;AACvC,QAAI,gBAAgB,IAAI,WAAW,GAAG;AACpC,aAAO,gBAAgB,IAAI,WAAW;AAAA,IACxC;AAGA,UAAM,UAAU,UAAU,MAAM;AAChC,QAAI,UAAU,IAAI,OAAO,GAAG;AAC1B,aAAO,UAAU,IAAI,OAAO;AAAA,IAC9B;AAGA,UAAM,QAAe;AAAA,MACnB,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,UAAU;AAAA,MACV,QAAQ,CAAC;AAAA,MACT,OAAO,CAAC;AAAA,MACR,cAAc;AAAA,MACd;AAAA,IACF;AACA,cAAU,IAAI,SAAS,KAAK;AAC5B,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,OAAc,UAAkB,WAA+B;AACjF,UAAM,SAAS,SAAS,KAAK,EAAE,YAAY;AAC3C,UAAM,WAAW,MAAM,MAAM,KAAK,OAAK,EAAE,OAAO,UAAU,EAAE,cAAc,SAAS;AACnF,QAAI,CAAC,UAAU;AACb,YAAM,MAAM,KAAK;AAAA,QACf,IAAI;AAAA,QACJ,SAAS,SAAS,KAAK;AAAA,QACvB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAIA,SAAS,oBAAoB,aAG3B;AACA,MAAI,YAAY,WAAW,GAAG;AAC5B,WAAO,EAAE,SAAS,CAAC,GAAG,UAAU,CAAC,EAAE;AAAA,EACrC;AAGA,QAAM,YAAsC,oBAAI,IAAI;AACpD,QAAM,UAAqC,oBAAI,IAAI;AAEnD,aAAW,QAAQ,aAAa;AAC9B,UAAM,MAAM,KAAK,OAAO;AACxB,UAAM,MAAM,KAAK,OAAO;AAExB,QAAI,CAAC,UAAU,IAAI,GAAG,EAAG,WAAU,IAAI,KAAK,oBAAI,IAAI,CAAC;AACrD,cAAU,IAAI,GAAG,EAAG,IAAI,GAAG;AAE3B,UAAM,UAAU,GAAG,GAAG,KAAK,GAAG;AAC9B,QAAI,CAAC,QAAQ,IAAI,OAAO,EAAG,SAAQ,IAAI,SAAS,CAAC,CAAC;AAClD,YAAQ,IAAI,OAAO,EAAG,KAAK,IAAI;AAAA,EACjC;AAGA,QAAM,QAAQ,GAAG,OAAO,GAAG,QAAQ;AACnC,QAAM,QAA6B,oBAAI,IAAI;AAC3C,QAAM,YAAyB,oBAAI,IAAI;AAGvC,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,QAAQ,aAAa;AAC9B,UAAM,IAAI,KAAK,OAAO,OAAO;AAC7B,UAAM,IAAI,KAAK,OAAO,OAAO;AAAA,EAC/B;AACA,aAAW,QAAQ,OAAO;AACxB,UAAM,IAAI,MAAM,KAAK;AAAA,EACvB;AAEA,WAAS,IAAI,GAAiB;AAC5B,UAAM,IAAI,GAAG,IAAI;AACjB,UAAM,YAAY,UAAU,IAAI,CAAC,KAAK,oBAAI,IAAI;AAC9C,eAAW,KAAK,WAAW;AACzB,YAAM,IAAI,MAAM,IAAI,CAAC,KAAK;AAC1B,UAAI,MAAM,MAAM;AAEd,kBAAU,IAAI,GAAG,CAAC,KAAK,CAAC,EAAE;AAAA,MAC5B,WAAW,MAAM,OAAO;AACtB,YAAI,CAAC;AAAA,MACP;AAAA,IACF;AACA,UAAM,IAAI,GAAG,KAAK;AAAA,EACpB;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,MAAM,IAAI,IAAI,MAAM,OAAO;AAC7B,UAAI,IAAI;AAAA,IACV;AAAA,EACF;AAGA,QAAM,UAAwB,CAAC;AAC/B,QAAM,WAAyB,CAAC;AAEhC,aAAW,QAAQ,aAAa;AAC9B,UAAM,UAAU,GAAG,KAAK,OAAO,OAAO,KAAK,KAAK,OAAO,OAAO;AAC9D,QAAI,UAAU,IAAI,OAAO,GAAG;AAC1B,eAAS,KAAK,IAAI;AAAA,IACpB,OAAO;AACL,cAAQ,KAAK,IAAI;AAAA,IACnB;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,SAAS;AAC7B;;;ACzkBA,mBAAkB;;;ACgBX,SAAS,eAAe,QAAe,QAAuB;AACnE,QAAM,KAAK,OAAO,IAAI,OAAO;AAC7B,QAAM,gBAAgB,KAAK,IAAI,KAAK,IAAI,EAAE,IAAI,KAAK,EAAE;AACrD,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,MAAM,OAAO;AACnB,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,MAAM,OAAO;AACnB,SAAO,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAC1F;AAEO,SAAS,gBACd,QACA,QACA,eACA,WACQ;AACR,QAAM,OAAO,gBAAgB;AAC7B,SAAO;AAAA,IACL,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,IACzB,KAAK,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;AAAA,IAC9B,KAAK,OAAO,IAAI,EAAE,IAAI,IAAI;AAAA,IAC1B,KAAK,OAAO,IAAI,EAAE,IAAI,IAAI;AAAA,IAC1B,KAAK,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;AAAA,IAC9B,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,EAC3B,EAAE,KAAK,GAAG;AACZ;AAEO,SAAS,gBACd,QACA,QACA,aACA,WACQ;AACR,QAAM,OAAO,cAAc;AAC3B,SAAO;AAAA,IACL,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,IACzB,KAAK,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;AAAA,IAC9B,KAAK,OAAO,IAAI,EAAE,IAAI,IAAI,MAAM,OAAO,IAAI,OAAO,KAAK,CAAC,IAAI,IAAI;AAAA,IAChE,KAAK,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;AAAA,IACxD,KAAK,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,EAC3B,EAAE,KAAK,GAAG;AACZ;;;ADvCA,IAAM,YAAY;AAClB,IAAM,aAAa;AAEnB,SAAS,mBAAmB,OAAc,WAAsD;AAC9F,QAAM,aAAa,MAAM,MAAM,SAAS;AACxC,QAAM,gBAAgB,MAAM,WAAW,MAAM,SAAS,SAAS,IAAI;AACnE,QAAM,cAAc,MAAM,OAAO,IAAI,OAAM,GAAG,EAAE,GAAG,KAAK,EAAE,KAAK,GAAI,SAAS,CAAC;AAC7E,QAAM,eAAe,YAAY,SAAS,IAAI,KAAK,IAAI,GAAG,WAAW,IAAI;AAEzE,QAAM,QAAQ,KAAK;AAAA,IACjB,aAAa;AAAA,IACb,gBAAgB;AAAA,IAChB,eAAe;AAAA,IACf;AAAA,EACF;AAEA,QAAM,YAAY;AAClB,QAAM,eAAe,MAAM,WAAW,KAAK;AAC3C,QAAM,aAAa,KAAK,MAAM,OAAO;AACrC,QAAM,YAAY,KAAK,IAAK,YAAY,IAAK,IAAI,EAAE;AACnD,QAAM,UAAU;AAEhB,QAAM,SAAS,KAAK,IAAI,YAAY,eAAe,aAAa,YAAY,SAAS,UAAU;AAE/F,SAAO,EAAE,OAAO,OAAO;AACzB;AAQA,SAAS,aACP,QACA,aACqB;AAErB,QAAM,UAAU,oBAAI,IAA+B;AACnD,aAAW,SAAS,QAAQ;AAC1B,UAAM,MAAM,oBAAI,IAAkB;AAClC,eAAW,KAAK,MAAM,OAAO;AAE3B,YAAM,WAAW,IAAI,IAAI,EAAE,EAAE;AAC7B,UAAI,CAAC,YAAa,SAAS,cAAc,QAAQ,EAAE,cAAc,OAAQ;AACvE,YAAI,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AAAA,MACxB;AAAA,IACF;AACA,YAAQ,IAAI,MAAM,IAAI,GAAG;AAAA,EAC3B;AAEA,aAAW,QAAQ,aAAa;AAC9B,UAAM,WAAW,QAAQ,IAAI,KAAK,OAAO,OAAO;AAChD,QAAI,UAAU;AACZ,YAAM,WAAW,SAAS,IAAI,KAAK,OAAO,MAAM;AAChD,UAAI,CAAC,YAAY,SAAS,cAAc,MAAM;AAC5C,iBAAS,IAAI,KAAK,OAAO,QAAQ;AAAA,UAC/B,IAAI,KAAK,OAAO;AAAA,UAChB,SAAS,KAAK,OAAO;AAAA,UACrB,WAAW;AAAA,QACb,CAAC;AAAA,MACH;AAAA,IACF;AACA,UAAM,WAAW,QAAQ,IAAI,KAAK,OAAO,OAAO;AAChD,QAAI,UAAU;AACZ,YAAM,WAAW,SAAS,IAAI,KAAK,OAAO,MAAM;AAChD,UAAI,CAAC,UAAU;AACb,iBAAS,IAAI,KAAK,OAAO,QAAQ;AAAA,UAC/B,IAAI,KAAK,OAAO;AAAA,UAChB,SAAS,KAAK,OAAO;AAAA,UACrB,WAAW;AAAA,QACb,CAAC;AAAA,MACH;AAAA,IAEF;AAAA,EACF;AAEA,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,SAAS,GAAG,KAAK,SAAS;AACpC,WAAO,IAAI,SAAS,MAAM,KAAK,IAAI,OAAO,CAAC,CAAC;AAAA,EAC9C;AACA,SAAO;AACT;AASA,SAAS,cAAc,QAAgB,aAAqB,WAA2B;AACrF,QAAM,YAAY;AAClB,QAAM,eAAe;AACrB,QAAM,OAAO,SAAS;AACtB,QAAM,UAAU,SAAS,cAAc;AACvC,QAAM,kBAAkB,UAAU;AAClC,QAAM,gBAAgB,KAAK,IAAI,IAAI,YAAY,KAAK,EAAE;AACtD,SAAO,QAAQ,kBAAkB,iBAAiB;AACpD;AAEA,SAAS,WAAW,OAAoB,OAA6B;AACnE,QAAM,UAAU,MAAM,OAAO,OAAK,EAAE,cAAc,IAAI;AACtD,QAAM,WAAW,MAAM,OAAO,OAAK,EAAE,cAAc,KAAK;AAExD,QAAM,cAA4B,CAAC;AACnC,QAAM,UAAU;AAEhB,QAAM,WAAW,cAAc,MAAM,GAAG,MAAM,QAAQ,QAAQ,MAAM;AACpE,UAAQ,QAAQ,CAAC,GAAG,MAAM;AACxB,gBAAY,KAAK;AAAA,MACf,GAAG;AAAA,MACH,UAAU,EAAE,GAAG,MAAM,GAAG,GAAG,WAAW,IAAI,QAAQ;AAAA,MAClD,YAAY;AAAA,IACd,CAAC;AAAA,EACH,CAAC;AAED,QAAM,YAAY,cAAc,MAAM,GAAG,MAAM,QAAQ,SAAS,MAAM;AACtE,WAAS,QAAQ,CAAC,GAAG,MAAM;AACzB,gBAAY,KAAK;AAAA,MACf,GAAG;AAAA,MACH,UAAU,EAAE,GAAG,MAAM,IAAI,MAAM,OAAO,GAAG,YAAY,IAAI,QAAQ;AAAA,MACjE,YAAY;AAAA,IACd,CAAC;AAAA,EACH,CAAC;AAED,SAAO;AACT;AASA,SAAS,sBACP,QACA,SACA,UACM;AACN,QAAM,OAAO,CACX,SACA,QACA,WACA,gBACsB;AACtB,eAAW,QAAQ,aAAa;AAC9B,UAAI,cAAc,OAAO;AACvB,YAAI,KAAK,OAAO,YAAY,WAAW,KAAK,OAAO,WAAW,QAAQ;AACpE,iBAAO,KAAK;AAAA,QACd;AAAA,MACF,OAAO;AACL,YAAI,KAAK,OAAO,YAAY,WAAW,KAAK,OAAO,WAAW,QAAQ;AACpE,iBAAO,KAAK;AAAA,QACd;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,aAAW,SAAS,QAAQ;AAC1B,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,cAAc,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,WAAW,OAAO;AACnE,UAAI,aAAa;AACf,aAAK,aAAa;AAClB;AAAA,MACF;AACA,YAAM,eAAe,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,WAAW,QAAQ;AACrE,UAAI,cAAc;AAChB,aAAK,aAAa;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AACF;AAIA,SAAS,iBACP,OACA,QACA,WACO;AACP,QAAM,QAAQ,MAAM,MAAM,KAAK,OAAK,EAAE,OAAO,UAAU,EAAE,cAAc,SAAS;AAChF,MAAI,MAAO,QAAO,MAAM;AAIxB,QAAM,MAAM,MAAM,MAAM,KAAK,OAAK,EAAE,OAAO,MAAM;AACjD,SAAO,IAAI;AACb;AAIO,SAAS,OAAO,OAAmB,UAAyB,CAAC,GAAiB;AACnF,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,UAAU,QAAQ,WAAW;AACnC,QAAM,UAAU,QAAQ,WAAW;AAEnC,QAAM,YAAqB,CAAC,GAAG,MAAM,gBAAgB,GAAG,MAAM,UAAU;AAGxE,QAAM,iBAAiB,CAAC,GAAG,MAAM,aAAa,GAAG,MAAM,aAAa;AACpE,QAAM,eAAe,aAAa,WAAW,cAAc;AAG3D,QAAM,cAAc,oBAAI,IAA+C;AACvE,aAAW,SAAS,WAAW;AAC7B,UAAM,QAAQ,aAAa,IAAI,MAAM,EAAE,KAAK,CAAC;AAC7C,gBAAY,IAAI,MAAM,IAAI,mBAAmB,OAAO,MAAM,MAAM,CAAC;AAAA,EACnE;AAGA,QAAM,IAAI,IAAI,aAAAC,QAAM,SAAS,MAAM;AACnC,IAAE,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,EACX,CAAC;AACD,IAAE,oBAAoB,OAAO,CAAC,EAAE;AAEhC,aAAW,SAAS,WAAW;AAC7B,UAAM,IAAI,YAAY,IAAI,MAAM,EAAE;AAClC,MAAE,QAAQ,MAAM,IAAI,EAAE,OAAO,EAAE,OAAO,QAAQ,EAAE,OAAO,CAAC;AAAA,EAC1D;AAGA,aAAW,QAAQ,MAAM,aAAa;AACpC,QAAI,KAAK,OAAO,YAAY,KAAK,OAAO,QAAS;AACjD,MAAE,QAAQ,KAAK,OAAO,SAAS,KAAK,OAAO,OAAO;AAAA,EACpD;AAEA,eAAAA,QAAM,OAAO,CAAC;AAGd,QAAM,eAA8B,CAAC;AACrC,QAAM,aAAa,oBAAI,IAAyB;AAEhD,aAAW,SAAS,WAAW;AAC7B,UAAM,OAAO,EAAE,KAAK,MAAM,EAAE;AAC5B,UAAM,IAAI,YAAY,IAAI,MAAM,EAAE;AAClC,UAAM,QAAQ,MAAM,KAAK;AACzB,UAAM,QAAQ,MAAM,KAAK;AACzB,UAAM,IAAI,QAAQ,EAAE,QAAQ;AAC5B,UAAM,IAAI,QAAQ,EAAE,SAAS;AAE7B,UAAM,UAAuB;AAAA,MAC3B,IAAI,MAAM;AAAA,MACV,OAAO,MAAM;AAAA,MACb,UAAU,MAAM;AAAA,MAChB,QAAQ,MAAM;AAAA,MACd,OAAO,CAAC;AAAA,MACR,cAAc,MAAM;AAAA,MACpB;AAAA,MACA;AAAA,MACA,OAAO,EAAE;AAAA,MACT,QAAQ,EAAE;AAAA,IACZ;AACA,UAAM,QAAQ,aAAa,IAAI,MAAM,EAAE,KAAK,CAAC;AAC7C,YAAQ,QAAQ,WAAW,SAAS,KAAK;AACzC,iBAAa,KAAK,OAAO;AACzB,eAAW,IAAI,MAAM,IAAI,OAAO;AAAA,EAClC;AAGA,wBAAsB,cAAc,MAAM,aAAa,MAAM,aAAa;AAG1E,MAAI,OAAO;AACX,MAAI,OAAO;AACX,aAAW,KAAK,cAAc;AAC5B,QAAI,EAAE,IAAI,EAAE,QAAQ,KAAM,QAAO,EAAE,IAAI,EAAE;AACzC,QAAI,EAAE,IAAI,EAAE,SAAS,KAAM,QAAO,EAAE,IAAI,EAAE;AAAA,EAC5C;AAEA,QAAM,cAAc,MAAM,cAAc,SAAS;AACjD,QAAM,oBAAoB;AAC1B,QAAM,gBAAgB,OAAO;AAG7B,QAAM,oBAAwC,CAAC;AAE/C,aAAW,QAAQ,MAAM,aAAa;AACpC,UAAM,WAAW,WAAW,IAAI,KAAK,OAAO,OAAO;AACnD,UAAM,WAAW,WAAW,IAAI,KAAK,OAAO,OAAO;AACnD,QAAI,CAAC,YAAY,CAAC,SAAU;AAE5B,UAAM,SAAS,iBAAiB,UAAU,KAAK,OAAO,QAAQ,KAAK;AACnE,UAAM,SAAS,iBAAiB,UAAU,KAAK,OAAO,QAAQ,IAAI;AAElE,QAAI;AACJ,QAAI,KAAK,OAAO,YAAY,KAAK,OAAO,SAAS;AAC/C,YAAM,cAAc,SAAS,IAAI,SAAS;AAC1C,aAAO,gBAAgB,QAAQ,QAAQ,aAAa,EAAE;AAAA,IACxD,OAAO;AACL,aAAO,eAAe,QAAQ,MAAM;AAAA,IACtC;AAEA,sBAAkB,KAAK;AAAA,MACrB,IAAI,KAAK;AAAA,MACT,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,YAAY,KAAK;AAAA,MACjB,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,aAAa;AAAA,IACf,CAAC;AAAA,EACH;AAEA,aAAW,QAAQ,MAAM,eAAe;AACtC,UAAM,WAAW,WAAW,IAAI,KAAK,OAAO,OAAO;AACnD,UAAM,WAAW,WAAW,IAAI,KAAK,OAAO,OAAO;AACnD,QAAI,CAAC,YAAY,CAAC,SAAU;AAE5B,UAAM,SAAS,iBAAiB,UAAU,KAAK,OAAO,QAAQ,KAAK;AACnE,UAAM,SAAS,iBAAiB,UAAU,KAAK,OAAO,QAAQ,IAAI;AAElE,UAAM,OAAO,gBAAgB,QAAQ,QAAQ,eAAe,iBAAiB;AAE7E,sBAAkB,KAAK;AAAA,MACrB,IAAI,KAAK;AAAA,MACT,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,YAAY,KAAK;AAAA,MACjB,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,aAAa;AAAA,IACf,CAAC;AAAA,EACH;AAGA,QAAM,SAAS;AAIf,QAAM,gBAAgB,cACjB,gBAAgB,OAAQ,oBAAoB,KAAK,KAClD;AACJ,QAAM,QAAQ,OAAO;AACrB,QAAM,SAAS,OAAO,SAAS;AAE/B,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,aAAa;AAAA,IACb;AAAA,IACA;AAAA,IACA,iBAAiB,MAAM;AAAA,EACzB;AACF;;;AEzWA,SAAS,QAAgB;AACvB,SAAO,QAAQ,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,CAAC;AACtD;AAIA,SAAS,UAAU,cAAoC;AACrD,QAAM,aAAa,aAAa,OAAO;AACvC,QAAM,YAAY,aAAa,YAAY;AAC3C,QAAM,QAAQ,aAAa;AAC3B,QAAM,aAAuB,CAAC;AAC9B,QAAM,QAAsB,CAAC,SAAS,MAAM,SAAS,QAAQ,WAAW,OAAO;AAC/E,aAAW,KAAK,OAAO;AACrB,UAAM,IAAI,MAAM,CAAC,KAAK;AACtB,QAAI,IAAI,EAAG,YAAW,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE;AAAA,EACxC;AAEA,MAAI,UAAU,sBAAsB,UAAU,UAAU,eAAe,IAAI,KAAK,GAAG,QAAQ,SAAS,cAAc,cAAc,IAAI,KAAK,GAAG;AAE5I,MAAI,aAAa,KAAK,cAAc,GAAG;AACrC,UAAM,QAAQ,aAAa,OAAO,IAAI,OAAK,eAAe,EAAE,KAAK,CAAC,EAAE,KAAK,IAAI;AAC7E,eAAW,aAAa,KAAK;AAAA,EAC/B;AAEA,MAAI,WAAW,SAAS,GAAG;AACzB,eAAW,aAAa,WAAW,KAAK,IAAI,CAAC;AAAA,EAC/C;AAEA,SAAO;AACT;AAIA,SAAS,gBAAgB,OAAc,UAAkB,OAAe,QAAwB;AAC9F,MAAI,CAAC,MAAM,KAAM,QAAO;AACxB,SAAO,gBAAgB,KAAK,aAAa,MAAM,gBAAgB,QAAQ;AACzE;AAEA,SAAS,YAAY,OAAc,aAAyC;AAC1E,QAAM,QAAkB,CAAC;AACzB,QAAM,OAAiB,CAAC;AAExB,aAAW,QAAQ,aAAa;AAC9B,UAAM,aAAa,MAAM,MAAM,OAAO,KAAK,UAAU;AACrD,UAAM;AAAA,MACJ,YAAY,KAAK,IAAI,aAAa,WAAW,MAAM,mBAAmB,MAAM,MAAM,KAAK,iFAEnE,eAAe,KAAK,EAAE,CAAC,kBAAkB,KAAK,UAAU;AAAA,IAC9E;AACA,SAAK;AAAA,MACH,eAAe,KAAK,YAAY,CAAC,SAAS,KAAK,YAAY,CAAC,QAAQ,MAAM,MAAM,aAAa,WAAW,WAAW,OAAO;AAAA,IAC5H;AACA,SAAK;AAAA,MACH,eAAe,KAAK,YAAY,CAAC,SAAS,KAAK,YAAY,CAAC,QAAQ,MAAM,MAAM,aAAa,WAAW,WAAW,OAAO;AAAA,IAC5H;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE;AACtC;AAEA,SAAS,YAAY,OAAc,UAAkB,QAA+B;AAClF,QAAM,QAAkB,CAAC;AAEzB,aAAW,SAAS,QAAQ;AAC1B,UAAM,aAAa,eAAe,MAAM,gBAAgB,MAAM,KAAK;AACnE,UAAM,QAAQ,eAAe,MAAM,KAAK;AACxC,UAAM,aAAa,eAAe,MAAM,MAAM,UAAU;AAExD,UAAM,SAAS,MAAM,IAAI;AACzB,UAAM,SAAS,MAAM,IAAI;AACzB,UAAM,SAAS,MAAM,QAAQ;AAE7B,QAAI,QAAQ,mBAAmB,UAAU,kBAAkB,QAAQ;AAEnE,aAAS,YAAY,MAAM,CAAC,QAAQ,MAAM,CAAC,YAAY,MAAM,KAAK,aAAa,MAAM,MAAM,WAChF,MAAM,MAAM,IAAI,aAAa,MAAM,MAAM,MAAM,6BAA6B,MAAM,MAAM,YAAY;AAE/G,aAAS,aAAa,MAAM,CAAC,SAAS,MAAM,IAAI,GAAG,SAAS,MAAM,IAAI,MAAM,KAAK,SAAS,MAAM,IAAI,GAAG,aAC1F,MAAM,MAAM,SAAS,mBAAmB,MAAM,MAAM,UAAU;AAE3E,aAAS,aAAa,MAAM,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,GAAG,SAAS,MAAM,IAAI,MAAM,KAAK,SAAS,MAAM,IAAI,MAAM,SAAS,GAAG,aACxH,MAAM,MAAM,MAAM;AAE/B,aAAS,YAAY,MAAM,QAAQ,MAAM,YAAY,MAAM,uBAChD,MAAM,MAAM,SAAS,aAAa,MAAM,MAAM,WAAW;AAEpE,aAAS,YAAY,MAAM,IAAI,MAAM,QAAQ,CAAC,QAAQ,MAAM,IAAI,EAAE,uCAChD,UAAU,4CACjB,MAAM,MAAM,KAAK,wBAAwB,KAAK;AAEzD,QAAI,MAAM,UAAU;AAClB,YAAM,WAAW,eAAe,MAAM,QAAQ;AAC9C,YAAM,OAAO;AACb,YAAM,OAAO,SAAS;AACtB,YAAM,OAAO;AACb,YAAM,OAAO;AACb,eAAS,oCAAoC,IAAI,QAAQ,IAAI,YAAY,IAAI,aAAa,IAAI,WACnF,MAAM,MAAM,MAAM;AAC7B,eAAS,YAAY,MAAM,IAAI,MAAM,QAAQ,CAAC,QAAQ,OAAO,OAAO,IAAI,CAAC,uCACvD,UAAU,0BAA0B,MAAM,MAAM,IAAI,wBAAwB,QAAQ;AAAA,IACxG;AACA,aAAS;AACT,UAAM,KAAK,KAAK;AAAA,EAClB;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,SAAS,YAAY,QAAuB,OAAsB;AAChE,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAW;AAEjB,aAAW,SAAS,QAAQ;AAC1B,UAAM,KAAK,MAAM,QAAQ;AACzB,UAAM,KAAK,MAAM,IAAI;AACrB,QAAI,KAAK,MAAM,IAAI,MAAM,MAAM,WAAW,KAAK;AAC/C,UAAM,iBAAiB,MAAM,MAAM,KAAK,EAAE,YAAY;AACtD,eAAW,SAAS,MAAM,QAAQ;AAChC,YAAM;AAAA,QACJ,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,uBAAuB,MAAM,MAAM,SAAS,aAAa,MAAM,MAAM,WAAW;AAAA,MACxH;AACA,YAAM,UAAU,MAAM,IAAI,KAAK,EAAE,YAAY;AAC7C,YAAM,OAAO,YAAY,iBACrB,eAAe,MAAM,KAAK,IAC1B,GAAG,eAAe,MAAM,GAAG,CAAC,KAAK,eAAe,MAAM,KAAK,CAAC;AAChE,YAAM;AAAA,QACJ,YAAY,KAAK,KAAK,CAAC,QAAQ,KAAK,EAAE,uCACtB,QAAQ,0BAA0B,MAAM,MAAM,SAAS,KAAK,IAAI;AAAA,MAClF;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,SAAS,WAAW,OAAc,UAAkB,QAA+B;AACjF,MAAI,MAAM,KAAK,WAAY,QAAO;AAClC,QAAM,QAAkB,CAAC;AACzB,QAAM,IAAI,MAAM,KAAK;AAErB,aAAW,SAAS,QAAQ;AAC1B,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,EAAE,GAAG,EAAE,IAAI,KAAK;AACtB,YAAM,KAAK,eAAe,GAAG,MAAM,EAAE,IAAI,KAAK,EAAE,EAAE;AAClD,UAAI,QAAQ,iBAAiB,EAAE,kBAAkB,QAAQ;AACzD,eAAS,eAAe,CAAC,SAAS,CAAC,iBAAiB,EAAE,KAAK,aAAa,EAAE,WAAW;AACrF,eAAS,eAAe,CAAC,SAAS,CAAC,iBAAiB,EAAE,IAAI;AAC1D,eAAS,eAAe,CAAC,SAAS,CAAC,iBAAiB,EAAE,IAAI;AAC1D,eAAS,eAAe,CAAC,SAAS,CAAC,iBAAiB,EAAE,GAAG;AACzD,eAAS;AACT,YAAM,KAAK,KAAK;AAAA,IAClB;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,IAAM,oBAAgD;AAAA,EACpD,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,MAAM;AAAA,EACN,SAAS;AAAA,EACT,OAAO;AACT;AAGA,IAAM,yBAAyB;AAU/B,SAAS,qBAAqB,aAAuD;AACnF,QAAM,MAAM,oBAAI,IAAqB;AACrC,aAAW,QAAQ,aAAa;AAG9B,UAAM,SAAS,GAAG,KAAK,OAAO,OAAO,IAAI,KAAK,OAAO,MAAM;AAC3D,UAAM,QAAQ,KAAK,YAAY,IAAI,KAAK,YAAY;AACpD,QAAI,QAAQ,CAAC,wBAAwB;AACnC,UAAI,IAAI,QAAQ,IAAI;AAAA,IACtB,WAAW,CAAC,IAAI,IAAI,MAAM,GAAG;AAC3B,UAAI,IAAI,QAAQ,KAAK;AAAA,IACvB;AAOA,UAAM,SAAS,GAAG,KAAK,OAAO,OAAO,IAAI,KAAK,OAAO,MAAM;AAC3D,UAAM,QAAQ,KAAK,YAAY,IAAI,KAAK,YAAY;AACpD,QAAI,KAAK,cAAc,QAAQ,wBAAwB;AACrD,UAAI,IAAI,QAAQ,IAAI;AAAA,IACtB,WAAW,CAAC,IAAI,IAAI,MAAM,GAAG;AAC3B,UAAI,IAAI,QAAQ,KAAK;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,YAAY,OAAc,QAAuB,aAAyC;AACjG,QAAM,QAAkB,CAAC;AACzB,QAAM,aAAa,eAAe,MAAM,KAAK,UAAU;AACvD,QAAM,WAAW,MAAM,KAAK,KAAK;AACjC,QAAM,eAAe,MAAM,KAAK,KAAK;AACrC,QAAM,gBAAgB,MAAM,KAAK,KAAK;AACtC,QAAM,aAAa,MAAM,KAAK,KAAK;AACnC,QAAM,WAAW;AACjB,QAAM,aAAa;AACnB,QAAM,YAAY;AAGlB,QAAM,kBAAkB;AACxB,QAAM,kBAAkB;AACxB,QAAM,kBAAkB;AACxB,QAAM,kBAAkB;AAExB,QAAM,WAAW,qBAAqB,WAAW;AAKjD,QAAM,eAAe;AAErB,aAAW,SAAS,QAAQ;AAC1B,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,EAAE,GAAG,EAAE,IAAI,KAAK;AACtB,YAAM,MAAM,GAAG,MAAM,EAAE,IAAI,KAAK,EAAE,IAAI,KAAK,SAAS;AACpD,YAAM,QAAQ,SAAS,IAAI,GAAG,MAAM;AACpC,YAAM,UAAU,eAAe,KAAK,OAAO;AAC3C,YAAM,WAAW,KAAK,cAAc;AAIpC,YAAM,QAAQ,QAAQ,IAAI,kBAAkB,IAAI;AAChD,YAAM,QAAQ,WAAW,IAAI,eAAe,IAAI;AAChD,YAAM,aAAa,WAAW,UAAU;AAExC,YAAM;AAAA,QACJ,YAAY,KAAK,QAAQ,KAAK,kBAAkB,UAAU,gBAC5C,MAAM,KAAK,QAAQ,WAAW,MAAM,KAAK,UAAU,oCACjD,UAAU,iCAAiC,OAAO;AAAA,MACpE;AAEA,UAAI,YAAY,KAAK,YAAY;AAC/B,cAAM,WAAW,kBAAkB,KAAK,UAAU;AAClD,cAAM,YAAY,SAAS,SAAS,YAAY,WAAW;AAC3D,cAAM,YAAY,MAAM,MAAM,OAAO,KAAK,UAAU,EAAE;AAGtD,cAAM,cAAc,QAAQ,IAAI,kBAAkB,IAAI;AACtD,cAAM,QAAQ,WACV,IAAI,eACJ,IAAI,eAAe;AACvB,cAAM,QAAQ,cAAc,aAAa;AACzC,cAAM,YAAY,QAAQ,YAAY;AACtC,cAAM;AAAA,UACJ,iCAAiC,KAAK,QAAQ,KAAK,YAAY,SAAS,aAAa,UAAU,SACxF,UAAU,WAAW,SAAS,kBAAkB,KAAK,UAAU;AAAA,QACxE;AACA,cAAM;AAAA,UACJ,sCAAsC,SAAS,QAAQ,WAAW,mEAClD,UAAU,gBAAgB,YAAY,WAAW,aAAa,uBAAuB,eAAe,QAAQ,CAAC;AAAA,QAC/H;AAAA,MACF;AAAA,IAEF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,SAAS,iBAAiB,OAAc,aAAiC,cAA8B;AACrG,QAAM,YAAY,YAAY,OAAO,OAAK,EAAE,UAAU;AACtD,MAAI,UAAU,WAAW,EAAG,QAAO;AAEnC,QAAM,QAAkB,CAAC;AACzB,QAAM,aAAa,eAAe,MAAM,WAAW,UAAU;AAC7D,QAAM,eAAe,MAAM,WAAW,WAAW;AACjD,QAAM,mBAAmB;AAGzB,YAAU,QAAQ,CAAC,MAAM,MAAM;AAC7B,UAAM,MAAM,IAAI;AAChB,UAAM,KAAK,KAAK,YAAY;AAC5B,UAAM,KAAK,KAAK,YAAY;AAC5B,UAAM,KAAK,KAAK,YAAY;AAC5B,UAAM,KAAK,KAAK,YAAY;AAE5B,QAAI;AACJ,QAAI;AAEJ,QAAI,KAAK,YAAY;AAInB,YAAM,KAAK,MAAM;AACjB,YAAM,QAAQ,KAAK,KAAK,MAAM,iCAAiC;AAC/D,WAAK,QAAQ,WAAW,MAAM,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,IACzD,OAAO;AACL,YAAM,KAAK,MAAM;AACjB,YAAM,KAAK,MAAM;AAAA,IACnB;AAEA,UAAM,eAAe,KAAK,aACtB,MAAM,MAAM,OAAO,KAAK,UAAU,EAAE,SACpC,MAAM,WAAW;AAErB,UAAM;AAAA,MACJ,eAAe,EAAE,SAAS,EAAE,iBAAiB,MAAM,MAAM,SAAS,aACvD,YAAY,gDAAgD,GAAG;AAAA,IAC5E;AACA,UAAM;AAAA,MACJ,YAAY,EAAE,QAAQ,KAAK,CAAC,uCACZ,gBAAgB,yBACvB,MAAM,WAAW,KAAK,KAAK,GAAG;AAAA,IACzC;AAAA,EACF,CAAC;AAGD,QAAM,SAAS;AACf,QAAM,UAAU;AAChB,QAAM,YAAY,UAAU;AAE5B,QAAM,UAAU,eAAe;AAE/B,QAAM,aAAa,WAAW,YAAY,KAAK;AAE/C,YAAU,QAAQ,CAAC,MAAM,MAAM;AAC7B,UAAM,MAAM,IAAI;AAChB,UAAM,WAAW,GAAG,GAAG,KAAK,eAAe,KAAK,UAAW,CAAC;AAC5D,UAAM,QAAQ,aAAa,IAAI;AAC/B,UAAM;AAAA,MACJ,YAAY,MAAM,QAAQ,KAAK,kBACf,UAAU,gBAAgB,YAAY,6BAC7C,MAAM,WAAW,KAAK,KAAK,QAAQ;AAAA,IAC9C;AAAA,EACF,CAAC;AAED,SAAO,MAAM,KAAK,EAAE;AACtB;AAEA,SAAS,YAAY,OAAc,cAAoC;AACrE,QAAM,QAAsB,CAAC,SAAS,MAAM,SAAS,QAAQ,WAAW,OAAO;AAC/E,QAAM,OAAO,MAAM,OAAO,QAAM,aAAa,gBAAgB,CAAC,KAAK,KAAK,CAAC;AACzE,MAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,QAAM,QAAkB,CAAC;AACzB,QAAM,aAAa,eAAe,MAAM,WAAW,UAAU;AAC7D,QAAM,YAAY;AAClB,QAAM,aAAa,KAAK,SAAS;AAEjC,QAAM,eAAe,aAAa,QAAQ;AAC1C,QAAM,IAAI,aAAa,SAAS;AAEhC,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,QAAQ,MAAM,MAAM,OAAO,GAAG,EAAE;AACtC,UAAM,IAAI,eAAe,IAAI;AAC7B,QAAI,IAAI,2BAA2B,CAAC,KAAK,CAAC;AAC1C,SAAK,8CAA8C,KAAK;AACxD,SAAK,mCAAmC,UAAU,yBAAyB,MAAM,WAAW,KAAK,KAAK,GAAG;AACzG,SAAK;AACL,UAAM,KAAK,CAAC;AAAA,EACd;AAEA,SAAO,MAAM,KAAK,EAAE;AACtB;AAIO,SAAS,UAAU,cAA4B,OAAsB;AAC1E,QAAM,WAAW,MAAM;AACvB,QAAM,QAAQ,aAAa;AAC3B,QAAM,SAAS,aAAa;AAC5B,QAAM,WAAW,KAAK,MAAM,KAAK;AAEjC,QAAM,OAAO,UAAU,YAAY;AAGnC,QAAM,YAAsB,CAAC;AAC7B,YAAU;AAAA,IACR,eAAe,QAAQ,yGACsB,MAAM,MAAM,UAAU,oBAAoB,MAAM,MAAM,aAAa;AAAA,EAElH;AACA,YAAU;AAAA,IACR,eAAe,QAAQ;AAAA,EAGzB;AACA,MAAI,MAAM,MAAM;AACd,UAAM,UAAU,MAAM,KAAK;AAC3B,cAAU;AAAA,MACR,gBAAgB,QAAQ,iBAAiB,OAAO,aAAa,OAAO,+CACrD,UAAU,CAAC,SAAS,UAAU,CAAC,QAAQ,MAAM,KAAK,SAAS,WAAW,MAAM,KAAK,QAAQ,cAAc,MAAM,KAAK,OAAO;AAAA,IAE1I;AAAA,EACF;AAGA,QAAM,SAAS;AAAA,IACb,0BAA0B,gBAAgB,OAAO,UAAU,OAAO,MAAM,CAAC;AAAA,IACzE,8BAA8B,YAAY,OAAO,aAAa,WAAW,CAAC;AAAA,IAC1E,+BAA+B,YAAY,OAAO,UAAU,aAAa,MAAM,CAAC;AAAA,IAChF,8BAA8B,YAAY,aAAa,QAAQ,KAAK,CAAC;AAAA,IACrE,6BAA6B,WAAW,OAAO,UAAU,aAAa,MAAM,CAAC;AAAA,IAC7E,8BAA8B,YAAY,OAAO,aAAa,QAAQ,aAAa,WAAW,CAAC;AAAA,IAC/F,mCAAmC,iBAAiB,OAAO,aAAa,aAAa,MAAM,CAAC;AAAA,IAC5F,8BAA8B,YAAY,OAAO,YAAY,CAAC;AAAA,EAChE,EAAE,KAAK,EAAE;AAET,QAAM,QACJ;AAMF,QAAM,YAAY;AAClB,QAAM,UAAU,QAAQ,YAAY;AAIpC,QAAM,SAAS;AAKf,QAAM,YAAY,aAAa,YAAY,OAAO,OAAK,EAAE,UAAU,EAAE;AACrE,QAAM,cAAc,YAAY,IAAI,YAAY,KAAK,KAAK;AAC1D,QAAM,YAAY,KAAK,IAAI,IAAI,cAAc,EAAE;AAC/C,QAAM,WAAW,SAAS,SAAS;AAEnC,QAAM,MACJ,oDAAoD,CAAC,SAAS,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,QAAQ,qCAC1E,WAAW,YAAY,CAAC,iCAAiC,QAAQ,UAAU,QAAQ,qBAC3F,QAAQ,0CACT,QAAQ,UAAU,IAAI,YACnC,QACA,SAAS,UAAU,KAAK,EAAE,CAAC,YAC3B,SACA;AAEF,SAAO;AACT;;;AC7cO,IAAM,eAAsB;AAAA,EACjC,YAAY;AAAA,EACZ,OAAO;AAAA,IACL,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,YAAY;AAAA,IACZ,eAAe;AAAA,IACf,YAAY;AAAA,EACd;AAAA,EACA,OAAO;AAAA,IACL,YAAY;AAAA,IACZ,OAAO;AAAA,IACP,UAAU;AAAA,IACV,WAAW;AAAA,IACX,aAAa;AAAA,EACf;AAAA,EACA,OAAO;AAAA,IACL,WAAW;AAAA,IACX,aAAa;AAAA,IACb,WAAW;AAAA,EACb;AAAA,EACA,MAAM;AAAA,IACJ,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,QAAQ;AAAA,MACN,OAAO;AAAA,MACP,aAAa;AAAA,MACb,MAAM;AAAA,MACN,MAAM;AAAA,MACN,KAAK;AAAA,IACP;AAAA,IACA,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,UAAU;AAAA,MACV,WAAW;AAAA,MACX,cAAc;AAAA,IAChB;AAAA,EACF;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ;AAAA,MACN,OAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,IAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,OAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,MAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,SAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,MACjD,OAAS,EAAE,QAAQ,WAAW,SAAS,UAAU;AAAA,IACnD;AAAA,IACA,eAAe;AAAA,EACjB;AAAA,EACA,YAAY;AAAA,IACV,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,OAAO;AAAA,IACP,WAAW;AAAA,EACb;AAAA,EACA,MAAM;AAAA,IACJ,UAAU;AAAA,IACV,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AACF;AAGA,SAAS,UAAa,QAAW,QAA2B;AAC1D,QAAM,SAAkC,EAAE,GAAI,OAAmC;AACjF,QAAM,MAAM;AACZ,QAAM,MAAM;AACZ,aAAW,OAAO,KAAK;AACrB,UAAM,YAAY,IAAI,GAAG;AACzB,UAAM,YAAY,IAAI,GAAG;AACzB,QACE,cAAc,QACd,OAAO,cAAc,YACrB,CAAC,MAAM,QAAQ,SAAS,KACxB,cAAc,QACd,OAAO,cAAc,YACrB,CAAC,MAAM,QAAQ,SAAS,GACxB;AACA,aAAO,GAAG,IAAI;AAAA,QACZ;AAAA,QACA;AAAA,MACF;AAAA,IACF,WAAW,cAAc,QAAW;AAClC,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,YAAY,WAAsC;AAChE,SAAO,UAAU,cAAc,SAAS;AAC1C;;;AC1FO,IAAM,YAAmB,YAAY;AAAA,EAC1C,MAAM;AAAA;AAAA;AAAA,IAGJ,YAAY;AAAA,EACd;AAAA,EACA,YAAY;AAAA;AAAA;AAAA,IAGV,OAAO;AAAA,IACP,WAAW;AAAA,EACb;AAAA,EACA,MAAM;AAAA;AAAA,IAEJ,UAAU;AAAA,IACV,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AACF,CAAC;;;AChBM,SAAS,OAAO,UAAkB,SAAiC;AACxE,QAAM,cAAc,MAAM,QAAQ;AAClC,QAAM,EAAE,MAAM,IAAI;AAClB,QAAM,cAAc,MAAM,eAAe,SAAS,MAAM,WAAW;AACnE,QAAM,mBAAmB,MAAM,YAAY,SAAS,MAAM,cAAc;AACxE,MAAI,gBAAgB,KAAK,qBAAqB,GAAG;AAC/C,UAAM,IAAI,MAAM,2EAAsE;AAAA,EACxF;AACA,QAAM,eAAe,OAAO,OAAO;AAAA,IACjC,WAAW;AAAA,EACb,CAAC;AACD,QAAM,QAAQ,SAAS,QAAQ,YAAY,QAAQ,KAAK,IAAI;AAC5D,SAAO,UAAU,cAAc,KAAK;AACtC;","names":["v","w","v","range","range","g","require_util","edge","dfs","xs","normalize","layout","require_version","blockId","block","dagre"]}