@aiquants/markdown 0.2.0

package/dist/graph-DcafR7xD.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-DcafR7xD.js","sources":["../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/union.js","../../../node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/graphlib/graph.js"],"sourcesContent":["import baseFlatten from './_baseFlatten.js';\nimport baseRest from './_baseRest.js';\nimport baseUniq from './_baseUniq.js';\nimport isArrayLikeObject from './isArrayLikeObject.js';\n\n/**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\nvar union = baseRest(function(arrays) {\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\nexport default union;\n","import * as _ from 'lodash-es';\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\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.\nexport class Graph {\n  constructor(opts = {}) {\n    this._isDirected = Object.prototype.hasOwnProperty.call(opts, 'directed')\n      ? opts.directed\n      : true;\n    this._isMultigraph = Object.prototype.hasOwnProperty.call(opts, 'multigraph')\n      ? opts.multigraph\n      : false;\n    this._isCompound = Object.prototype.hasOwnProperty.call(opts, 'compound')\n      ? opts.compound\n      : false;\n\n    // Label for the graph itself\n    this._label = undefined;\n\n    // Defaults to be set when creating a new node\n    this._defaultNodeLabelFn = _.constant(undefined);\n\n    // Defaults to be set when creating a new edge\n    this._defaultEdgeLabelFn = _.constant(undefined);\n\n    // v -> label\n    this._nodes = {};\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    // v -> edgeObj\n    this._in = {};\n\n    // u -> v -> Number\n    this._preds = {};\n\n    // v -> edgeObj\n    this._out = {};\n\n    // v -> w -> Number\n    this._sucs = {};\n\n    // e -> edgeObj\n    this._edgeObjs = {};\n\n    // e -> label\n    this._edgeLabels = {};\n  }\n  /* === Graph functions ========= */\n  isDirected() {\n    return this._isDirected;\n  }\n  isMultigraph() {\n    return this._isMultigraph;\n  }\n  isCompound() {\n    return this._isCompound;\n  }\n  setGraph(label) {\n    this._label = label;\n    return this;\n  }\n  graph() {\n    return this._label;\n  }\n  /* === Node functions ========== */\n  setDefaultNodeLabel(newDefault) {\n    if (!_.isFunction(newDefault)) {\n      newDefault = _.constant(newDefault);\n    }\n    this._defaultNodeLabelFn = newDefault;\n    return this;\n  }\n  nodeCount() {\n    return this._nodeCount;\n  }\n  nodes() {\n    return _.keys(this._nodes);\n  }\n  sources() {\n    var self = this;\n    return _.filter(this.nodes(), function (v) {\n      return _.isEmpty(self._in[v]);\n    });\n  }\n  sinks() {\n    var self = this;\n    return _.filter(this.nodes(), function (v) {\n      return _.isEmpty(self._out[v]);\n    });\n  }\n  setNodes(vs, value) {\n    var args = arguments;\n    var self = this;\n    _.each(vs, 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  setNode(v, value) {\n    if (Object.prototype.hasOwnProperty.call(this._nodes, v)) {\n      if (arguments.length > 1) {\n        this._nodes[v] = value;\n      }\n      return this;\n    }\n\n    // @ts-expect-error\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  node(v) {\n    return this._nodes[v];\n  }\n  hasNode(v) {\n    return Object.prototype.hasOwnProperty.call(this._nodes, v);\n  }\n  removeNode(v) {\n    if (Object.prototype.hasOwnProperty.call(this._nodes, v)) {\n      var removeEdge = (e) => this.removeEdge(this._edgeObjs[e]);\n      delete this._nodes[v];\n      if (this._isCompound) {\n        this._removeFromParentsChildList(v);\n        delete this._parent[v];\n        _.each(this.children(v), (child) => {\n          this.setParent(child);\n        });\n        delete this._children[v];\n      }\n      _.each(_.keys(this._in[v]), removeEdge);\n      delete this._in[v];\n      delete this._preds[v];\n      _.each(_.keys(this._out[v]), removeEdge);\n      delete this._out[v];\n      delete this._sucs[v];\n      --this._nodeCount;\n    }\n    return this;\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 (_.isUndefined(parent)) {\n      parent = GRAPH_NODE;\n    } else {\n      // Coerce parent to string\n      parent += '';\n      for (var ancestor = parent; !_.isUndefined(ancestor); ancestor = this.parent(ancestor)) {\n        if (ancestor === v) {\n          throw new Error('Setting ' + parent + ' as parent of ' + v + ' 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  _removeFromParentsChildList(v) {\n    delete this._children[this._parent[v]][v];\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  children(v) {\n    if (_.isUndefined(v)) {\n      v = GRAPH_NODE;\n    }\n\n    if (this._isCompound) {\n      var children = this._children[v];\n      if (children) {\n        return _.keys(children);\n      }\n    } else if (v === GRAPH_NODE) {\n      return this.nodes();\n    } else if (this.hasNode(v)) {\n      return [];\n    }\n  }\n  predecessors(v) {\n    var predsV = this._preds[v];\n    if (predsV) {\n      return _.keys(predsV);\n    }\n  }\n  successors(v) {\n    var sucsV = this._sucs[v];\n    if (sucsV) {\n      return _.keys(sucsV);\n    }\n  }\n  neighbors(v) {\n    var preds = this.predecessors(v);\n    if (preds) {\n      return _.union(preds, this.successors(v));\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  filterNodes(filter) {\n    // @ts-expect-error\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    _.each(this._nodes, function (value, v) {\n      if (filter(v)) {\n        copy.setNode(v, value);\n      }\n    });\n\n    _.each(this._edgeObjs, function (e) {\n      // @ts-expect-error\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      _.each(copy.nodes(), function (v) {\n        copy.setParent(v, findParent(v));\n      });\n    }\n\n    return copy;\n  }\n  /* === Edge functions ========== */\n  setDefaultEdgeLabel(newDefault) {\n    if (!_.isFunction(newDefault)) {\n      newDefault = _.constant(newDefault);\n    }\n    this._defaultEdgeLabelFn = newDefault;\n    return this;\n  }\n  edgeCount() {\n    return this._edgeCount;\n  }\n  edges() {\n    return _.values(this._edgeObjs);\n  }\n  setPath(vs, value) {\n    var self = this;\n    var args = arguments;\n    _.reduce(vs, 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   * setEdge(v, w, [value, [name]])\n   * setEdge({ v, w, [name] }, [value])\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 (!_.isUndefined(name)) {\n      name = '' + name;\n    }\n\n    var e = edgeArgsToId(this._isDirected, v, w, name);\n    if (Object.prototype.hasOwnProperty.call(this._edgeLabels, e)) {\n      if (valueSpecified) {\n        this._edgeLabels[e] = value;\n      }\n      return this;\n    }\n\n    if (!_.isUndefined(name) && !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    // @ts-expect-error\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  edge(v, w, name) {\n    var e =\n      arguments.length === 1\n        ? edgeObjToId(this._isDirected, arguments[0])\n        : edgeArgsToId(this._isDirected, v, w, name);\n    return this._edgeLabels[e];\n  }\n  hasEdge(v, w, name) {\n    var e =\n      arguments.length === 1\n        ? edgeObjToId(this._isDirected, arguments[0])\n        : edgeArgsToId(this._isDirected, v, w, name);\n    return Object.prototype.hasOwnProperty.call(this._edgeLabels, e);\n  }\n  removeEdge(v, w, name) {\n    var e =\n      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  inEdges(v, u) {\n    var inV = this._in[v];\n    if (inV) {\n      var edges = _.values(inV);\n      if (!u) {\n        return edges;\n      }\n      return _.filter(edges, function (edge) {\n        return edge.v === u;\n      });\n    }\n  }\n  outEdges(v, w) {\n    var outV = this._out[v];\n    if (outV) {\n      var edges = _.values(outV);\n      if (!w) {\n        return edges;\n      }\n      return _.filter(edges, function (edge) {\n        return edge.w === w;\n      });\n    }\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\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\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]) {\n    delete map[k];\n  }\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 + (_.isUndefined(name) ? 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"],"names":["union","baseRest","arrays","baseUniq","baseFlatten","isArrayLikeObject","DEFAULT_EDGE_NAME","GRAPH_NODE","EDGE_KEY_DELIM","Graph","opts","_.constant","label","newDefault","_.isFunction","_.keys","self","_.filter","v","_.isEmpty","vs","value","args","_.each","removeEdge","e","child","parent","_.isUndefined","ancestor","children","predsV","sucsV","preds","_.union","neighbors","filter","copy","parents","findParent","_.values","_.reduce","w","name","valueSpecified","arg0","edgeArgsToId","edgeObj","edgeArgsToObj","incrementOrInitEntry","edgeObjToId","edge","decrementOrRemoveEntry","u","inV","edges","outV","inEdges","map","k","isDirected","v_","w_","tmp"],"mappings":";;AAqBA,IAAIA,IAAQC,EAAS,SAASC,GAAQ;AACpC,SAAOC,EAASC,EAAYF,GAAQ,GAAGG,GAAmB,EAAI,CAAC;AACjE,CAAC,GCrBGC,IAAoB,MACpBC,IAAa,MACbC,IAAiB;AAqBd,MAAMC,EAAM;AAAA,EACjB,YAAYC,IAAO,IAAI;AACrB,SAAK,cAAc,OAAO,UAAU,eAAe,KAAKA,GAAM,UAAU,IACpEA,EAAK,WACL,IACJ,KAAK,gBAAgB,OAAO,UAAU,eAAe,KAAKA,GAAM,YAAY,IACxEA,EAAK,aACL,IACJ,KAAK,cAAc,OAAO,UAAU,eAAe,KAAKA,GAAM,UAAU,IACpEA,EAAK,WACL,IAGJ,KAAK,SAAS,QAGd,KAAK,sBAAsBC,EAAW,MAAS,GAG/C,KAAK,sBAAsBA,EAAW,MAAS,GAG/C,KAAK,SAAS,CAAA,GAEV,KAAK,gBAEP,KAAK,UAAU,CAAA,GAGf,KAAK,YAAY,CAAA,GACjB,KAAK,UAAUJ,CAAU,IAAI,CAAA,IAI/B,KAAK,MAAM,CAAA,GAGX,KAAK,SAAS,CAAA,GAGd,KAAK,OAAO,CAAA,GAGZ,KAAK,QAAQ,CAAA,GAGb,KAAK,YAAY,CAAA,GAGjB,KAAK,cAAc,CAAA;AAAA,EACrB;AAAA;AAAA,EAEA,aAAa;AACX,WAAO,KAAK;AAAA,EACd;AAAA,EACA,eAAe;AACb,WAAO,KAAK;AAAA,EACd;AAAA,EACA,aAAa;AACX,WAAO,KAAK;AAAA,EACd;AAAA,EACA,SAASK,GAAO;AACd,gBAAK,SAASA,GACP;AAAA,EACT;AAAA,EACA,QAAQ;AACN,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAEA,oBAAoBC,GAAY;AAC9B,WAAKC,EAAaD,CAAU,MAC1BA,IAAaF,EAAWE,CAAU,IAEpC,KAAK,sBAAsBA,GACpB;AAAA,EACT;AAAA,EACA,YAAY;AACV,WAAO,KAAK;AAAA,EACd;AAAA,EACA,QAAQ;AACN,WAAOE,EAAO,KAAK,MAAM;AAAA,EAC3B;AAAA,EACA,UAAU;AACR,QAAIC,IAAO;AACX,WAAOC,EAAS,KAAK,MAAK,GAAI,SAAUC,GAAG;AACzC,aAAOC,EAAUH,EAAK,IAAIE,CAAC,CAAC;AAAA,IAC9B,CAAC;AAAA,EACH;AAAA,EACA,QAAQ;AACN,QAAIF,IAAO;AACX,WAAOC,EAAS,KAAK,MAAK,GAAI,SAAUC,GAAG;AACzC,aAAOC,EAAUH,EAAK,KAAKE,CAAC,CAAC;AAAA,IAC/B,CAAC;AAAA,EACH;AAAA,EACA,SAASE,GAAIC,GAAO;AAClB,QAAIC,IAAO,WACPN,IAAO;AACXO,WAAAA,EAAOH,GAAI,SAAUF,GAAG;AACtB,MAAII,EAAK,SAAS,IAChBN,EAAK,QAAQE,GAAGG,CAAK,IAErBL,EAAK,QAAQE,CAAC;AAAA,IAElB,CAAC,GACM;AAAA,EACT;AAAA,EACA,QAAQA,GAAGG,GAAO;AAChB,WAAI,OAAO,UAAU,eAAe,KAAK,KAAK,QAAQH,CAAC,KACjD,UAAU,SAAS,MACrB,KAAK,OAAOA,CAAC,IAAIG,IAEZ,SAIT,KAAK,OAAOH,CAAC,IAAI,UAAU,SAAS,IAAIG,IAAQ,KAAK,oBAAoBH,CAAC,GACtE,KAAK,gBACP,KAAK,QAAQA,CAAC,IAAIX,GAClB,KAAK,UAAUW,CAAC,IAAI,CAAA,GACpB,KAAK,UAAUX,CAAU,EAAEW,CAAC,IAAI,KAElC,KAAK,IAAIA,CAAC,IAAI,CAAA,GACd,KAAK,OAAOA,CAAC,IAAI,CAAA,GACjB,KAAK,KAAKA,CAAC,IAAI,CAAA,GACf,KAAK,MAAMA,CAAC,IAAI,CAAA,GAChB,EAAE,KAAK,YACA;AAAA,EACT;AAAA,EACA,KAAKA,GAAG;AACN,WAAO,KAAK,OAAOA,CAAC;AAAA,EACtB;AAAA,EACA,QAAQA,GAAG;AACT,WAAO,OAAO,UAAU,eAAe,KAAK,KAAK,QAAQA,CAAC;AAAA,EAC5D;AAAA,EACA,WAAWA,GAAG;AACZ,QAAI,OAAO,UAAU,eAAe,KAAK,KAAK,QAAQA,CAAC,GAAG;AACxD,UAAIM,IAAa,CAACC,MAAM,KAAK,WAAW,KAAK,UAAUA,CAAC,CAAC;AACzD,aAAO,KAAK,OAAOP,CAAC,GAChB,KAAK,gBACP,KAAK,4BAA4BA,CAAC,GAClC,OAAO,KAAK,QAAQA,CAAC,GACrBK,EAAO,KAAK,SAASL,CAAC,GAAG,CAACQ,MAAU;AAClC,aAAK,UAAUA,CAAK;AAAA,MACtB,CAAC,GACD,OAAO,KAAK,UAAUR,CAAC,IAEzBK,EAAOR,EAAO,KAAK,IAAIG,CAAC,CAAC,GAAGM,CAAU,GACtC,OAAO,KAAK,IAAIN,CAAC,GACjB,OAAO,KAAK,OAAOA,CAAC,GACpBK,EAAOR,EAAO,KAAK,KAAKG,CAAC,CAAC,GAAGM,CAAU,GACvC,OAAO,KAAK,KAAKN,CAAC,GAClB,OAAO,KAAK,MAAMA,CAAC,GACnB,EAAE,KAAK;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EACA,UAAUA,GAAGS,GAAQ;AACnB,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,2CAA2C;AAG7D,QAAIC,EAAcD,CAAM;AACtB,MAAAA,IAASpB;AAAA,SACJ;AAEL,MAAAoB,KAAU;AACV,eAASE,IAAWF,GAAQ,CAACC,EAAcC,CAAQ,GAAGA,IAAW,KAAK,OAAOA,CAAQ;AACnF,YAAIA,MAAaX;AACf,gBAAM,IAAI,MAAM,aAAaS,IAAS,mBAAmBT,IAAI,uBAAuB;AAIxF,WAAK,QAAQS,CAAM;AAAA,IACrB;AAEA,gBAAK,QAAQT,CAAC,GACd,KAAK,4BAA4BA,CAAC,GAClC,KAAK,QAAQA,CAAC,IAAIS,GAClB,KAAK,UAAUA,CAAM,EAAET,CAAC,IAAI,IACrB;AAAA,EACT;AAAA,EACA,4BAA4BA,GAAG;AAC7B,WAAO,KAAK,UAAU,KAAK,QAAQA,CAAC,CAAC,EAAEA,CAAC;AAAA,EAC1C;AAAA,EACA,OAAOA,GAAG;AACR,QAAI,KAAK,aAAa;AACpB,UAAIS,IAAS,KAAK,QAAQT,CAAC;AAC3B,UAAIS,MAAWpB;AACb,eAAOoB;AAAA,IAEX;AAAA,EACF;AAAA,EACA,SAAST,GAAG;AAKV,QAJIU,EAAcV,CAAC,MACjBA,IAAIX,IAGF,KAAK,aAAa;AACpB,UAAIuB,IAAW,KAAK,UAAUZ,CAAC;AAC/B,UAAIY;AACF,eAAOf,EAAOe,CAAQ;AAAA,IAE1B,OAAO;AAAA,UAAIZ,MAAMX;AACf,eAAO,KAAK,MAAK;AACZ,UAAI,KAAK,QAAQW,CAAC;AACvB,eAAO,CAAA;AAAA;AAAA,EAEX;AAAA,EACA,aAAaA,GAAG;AACd,QAAIa,IAAS,KAAK,OAAOb,CAAC;AAC1B,QAAIa;AACF,aAAOhB,EAAOgB,CAAM;AAAA,EAExB;AAAA,EACA,WAAWb,GAAG;AACZ,QAAIc,IAAQ,KAAK,MAAMd,CAAC;AACxB,QAAIc;AACF,aAAOjB,EAAOiB,CAAK;AAAA,EAEvB;AAAA,EACA,UAAUd,GAAG;AACX,QAAIe,IAAQ,KAAK,aAAaf,CAAC;AAC/B,QAAIe;AACF,aAAOC,EAAQD,GAAO,KAAK,WAAWf,CAAC,CAAC;AAAA,EAE5C;AAAA,EACA,OAAOA,GAAG;AACR,QAAIiB;AACJ,WAAI,KAAK,eACPA,IAAY,KAAK,WAAWjB,CAAC,IAE7BiB,IAAY,KAAK,UAAUjB,CAAC,GAEvBiB,EAAU,WAAW;AAAA,EAC9B;AAAA,EACA,YAAYC,GAAQ;AAElB,QAAIC,IAAO,IAAI,KAAK,YAAY;AAAA,MAC9B,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,IACrB,CAAK;AAED,IAAAA,EAAK,SAAS,KAAK,OAAO;AAE1B,QAAIrB,IAAO;AACXO,IAAAA,EAAO,KAAK,QAAQ,SAAUF,GAAOH,GAAG;AACtC,MAAIkB,EAAOlB,CAAC,KACVmB,EAAK,QAAQnB,GAAGG,CAAK;AAAA,IAEzB,CAAC,GAEDE,EAAO,KAAK,WAAW,SAAUE,GAAG;AAElC,MAAIY,EAAK,QAAQZ,EAAE,CAAC,KAAKY,EAAK,QAAQZ,EAAE,CAAC,KACvCY,EAAK,QAAQZ,GAAGT,EAAK,KAAKS,CAAC,CAAC;AAAA,IAEhC,CAAC;AAED,QAAIa,IAAU,CAAA;AACd,aAASC,EAAWrB,GAAG;AACrB,UAAIS,IAASX,EAAK,OAAOE,CAAC;AAC1B,aAAIS,MAAW,UAAaU,EAAK,QAAQV,CAAM,KAC7CW,EAAQpB,CAAC,IAAIS,GACNA,KACEA,KAAUW,IACZA,EAAQX,CAAM,IAEdY,EAAWZ,CAAM;AAAA,IAE5B;AAEA,WAAI,KAAK,eACPJ,EAAOc,EAAK,MAAK,GAAI,SAAUnB,GAAG;AAChC,MAAAmB,EAAK,UAAUnB,GAAGqB,EAAWrB,CAAC,CAAC;AAAA,IACjC,CAAC,GAGImB;AAAA,EACT;AAAA;AAAA,EAEA,oBAAoBxB,GAAY;AAC9B,WAAKC,EAAaD,CAAU,MAC1BA,IAAaF,EAAWE,CAAU,IAEpC,KAAK,sBAAsBA,GACpB;AAAA,EACT;AAAA,EACA,YAAY;AACV,WAAO,KAAK;AAAA,EACd;AAAA,EACA,QAAQ;AACN,WAAO2B,EAAS,KAAK,SAAS;AAAA,EAChC;AAAA,EACA,QAAQpB,GAAIC,GAAO;AACjB,QAAIL,IAAO,MACPM,IAAO;AACXmB,WAAAA,EAASrB,GAAI,SAAUF,GAAGwB,GAAG;AAC3B,aAAIpB,EAAK,SAAS,IAChBN,EAAK,QAAQE,GAAGwB,GAAGrB,CAAK,IAExBL,EAAK,QAAQE,GAAGwB,CAAC,GAEZA;AAAA,IACT,CAAC,GACM;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU;AACR,QAAIxB,GAAGwB,GAAGC,GAAMtB,GACZuB,IAAiB,IACjBC,IAAO,UAAU,CAAC;AAEtB,IAAI,OAAOA,KAAS,YAAYA,MAAS,QAAQ,OAAOA,KACtD3B,IAAI2B,EAAK,GACTH,IAAIG,EAAK,GACTF,IAAOE,EAAK,MACR,UAAU,WAAW,MACvBxB,IAAQ,UAAU,CAAC,GACnBuB,IAAiB,QAGnB1B,IAAI2B,GACJH,IAAI,UAAU,CAAC,GACfC,IAAO,UAAU,CAAC,GACd,UAAU,SAAS,MACrBtB,IAAQ,UAAU,CAAC,GACnBuB,IAAiB,MAIrB1B,IAAI,KAAKA,GACTwB,IAAI,KAAKA,GACJd,EAAce,CAAI,MACrBA,IAAO,KAAKA;AAGd,QAAIlB,IAAIqB,EAAa,KAAK,aAAa5B,GAAGwB,GAAGC,CAAI;AACjD,QAAI,OAAO,UAAU,eAAe,KAAK,KAAK,aAAalB,CAAC;AAC1D,aAAImB,MACF,KAAK,YAAYnB,CAAC,IAAIJ,IAEjB;AAGT,QAAI,CAACO,EAAce,CAAI,KAAK,CAAC,KAAK;AAChC,YAAM,IAAI,MAAM,mDAAmD;AAKrE,SAAK,QAAQzB,CAAC,GACd,KAAK,QAAQwB,CAAC,GAGd,KAAK,YAAYjB,CAAC,IAAImB,IAAiBvB,IAAQ,KAAK,oBAAoBH,GAAGwB,GAAGC,CAAI;AAElF,QAAII,IAAUC,EAAc,KAAK,aAAa9B,GAAGwB,GAAGC,CAAI;AAExD,WAAAzB,IAAI6B,EAAQ,GACZL,IAAIK,EAAQ,GAEZ,OAAO,OAAOA,CAAO,GACrB,KAAK,UAAUtB,CAAC,IAAIsB,GACpBE,EAAqB,KAAK,OAAOP,CAAC,GAAGxB,CAAC,GACtC+B,EAAqB,KAAK,MAAM/B,CAAC,GAAGwB,CAAC,GACrC,KAAK,IAAIA,CAAC,EAAEjB,CAAC,IAAIsB,GACjB,KAAK,KAAK7B,CAAC,EAAEO,CAAC,IAAIsB,GAClB,KAAK,cACE;AAAA,EACT;AAAA,EACA,KAAK7B,GAAGwB,GAAGC,GAAM;AACf,QAAIlB,IACF,UAAU,WAAW,IACjByB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAa5B,GAAGwB,GAAGC,CAAI;AAC/C,WAAO,KAAK,YAAYlB,CAAC;AAAA,EAC3B;AAAA,EACA,QAAQP,GAAGwB,GAAGC,GAAM;AAClB,QAAIlB,IACF,UAAU,WAAW,IACjByB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAa5B,GAAGwB,GAAGC,CAAI;AAC/C,WAAO,OAAO,UAAU,eAAe,KAAK,KAAK,aAAalB,CAAC;AAAA,EACjE;AAAA,EACA,WAAWP,GAAGwB,GAAGC,GAAM;AACrB,QAAIlB,IACF,UAAU,WAAW,IACjByB,EAAY,KAAK,aAAa,UAAU,CAAC,CAAC,IAC1CJ,EAAa,KAAK,aAAa5B,GAAGwB,GAAGC,CAAI,GAC3CQ,IAAO,KAAK,UAAU1B,CAAC;AAC3B,WAAI0B,MACFjC,IAAIiC,EAAK,GACTT,IAAIS,EAAK,GACT,OAAO,KAAK,YAAY1B,CAAC,GACzB,OAAO,KAAK,UAAUA,CAAC,GACvB2B,EAAuB,KAAK,OAAOV,CAAC,GAAGxB,CAAC,GACxCkC,EAAuB,KAAK,MAAMlC,CAAC,GAAGwB,CAAC,GACvC,OAAO,KAAK,IAAIA,CAAC,EAAEjB,CAAC,GACpB,OAAO,KAAK,KAAKP,CAAC,EAAEO,CAAC,GACrB,KAAK,eAEA;AAAA,EACT;AAAA,EACA,QAAQP,GAAGmC,GAAG;AACZ,QAAIC,IAAM,KAAK,IAAIpC,CAAC;AACpB,QAAIoC,GAAK;AACP,UAAIC,IAAQf,EAASc,CAAG;AACxB,aAAKD,IAGEpC,EAASsC,GAAO,SAAUJ,GAAM;AACrC,eAAOA,EAAK,MAAME;AAAA,MACpB,CAAC,IAJQE;AAAA,IAKX;AAAA,EACF;AAAA,EACA,SAASrC,GAAGwB,GAAG;AACb,QAAIc,IAAO,KAAK,KAAKtC,CAAC;AACtB,QAAIsC,GAAM;AACR,UAAID,IAAQf,EAASgB,CAAI;AACzB,aAAKd,IAGEzB,EAASsC,GAAO,SAAUJ,GAAM;AACrC,eAAOA,EAAK,MAAMT;AAAA,MACpB,CAAC,IAJQa;AAAA,IAKX;AAAA,EACF;AAAA,EACA,UAAUrC,GAAGwB,GAAG;AACd,QAAIe,IAAU,KAAK,QAAQvC,GAAGwB,CAAC;AAC/B,QAAIe;AACF,aAAOA,EAAQ,OAAO,KAAK,SAASvC,GAAGwB,CAAC,CAAC;AAAA,EAE7C;AACF;AAGAjC,EAAM,UAAU,aAAa;AAG7BA,EAAM,UAAU,aAAa;AAE7B,SAASwC,EAAqBS,GAAKC,GAAG;AACpC,EAAID,EAAIC,CAAC,IACPD,EAAIC,CAAC,MAELD,EAAIC,CAAC,IAAI;AAEb;AAEA,SAASP,EAAuBM,GAAKC,GAAG;AACtC,EAAK,EAAED,EAAIC,CAAC,KACV,OAAOD,EAAIC,CAAC;AAEhB;AAEA,SAASb,EAAac,GAAYC,GAAIC,GAAInB,GAAM;AAC9C,MAAIzB,IAAI,KAAK2C,GACTnB,IAAI,KAAKoB;AACb,MAAI,CAACF,KAAc1C,IAAIwB,GAAG;AACxB,QAAIqB,IAAM7C;AACV,IAAAA,IAAIwB,GACJA,IAAIqB;AAAA,EACN;AACA,SAAO7C,IAAIV,IAAiBkC,IAAIlC,KAAkBoB,EAAce,CAAI,IAAIrC,IAAoBqC;AAC9F;AAEA,SAASK,EAAcY,GAAYC,GAAIC,GAAInB,GAAM;AAC/C,MAAIzB,IAAI,KAAK2C,GACTnB,IAAI,KAAKoB;AACb,MAAI,CAACF,KAAc1C,IAAIwB,GAAG;AACxB,QAAIqB,IAAM7C;AACV,IAAAA,IAAIwB,GACJA,IAAIqB;AAAA,EACN;AACA,MAAIhB,IAAU,EAAE,GAAG7B,GAAG,GAAGwB,EAAC;AAC1B,SAAIC,MACFI,EAAQ,OAAOJ,IAEVI;AACT;AAEA,SAASG,EAAYU,GAAYb,GAAS;AACxC,SAAOD,EAAac,GAAYb,EAAQ,GAAGA,EAAQ,GAAGA,EAAQ,IAAI;AACpE;","x_google_ignoreList":[0,1]}