@aiquants/markdown 1.2.1 → 1.4.0

package/dist/{graph-BasevfV_.js.map → graph-0wpLgWY1.js.map}

@@ -1 +1 @@
-{"version":3,"file":"graph-BasevfV_.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]}
+{"version":3,"file":"graph-0wpLgWY1.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]}

package/dist/graph-BzzeK1Gv.cjs

@@ -0,0 +1,2 @@
+"use strict";const a=require("./extractHeadings-LdKvrkA9.cjs"),n=require("./_baseUniq-m50KmyvQ.cjs");var b=a.baseRest(function(o){return n.baseUniq(n.baseFlatten(o,1,a.isArrayLikeObject,!0))}),E="\0",u="\0",g="
";class f{constructor(e={}){this._isDirected=Object.prototype.hasOwnProperty.call(e,"directed")?e.directed:!0,this._isMultigraph=Object.prototype.hasOwnProperty.call(e,"multigraph")?e.multigraph:!1,this._isCompound=Object.prototype.hasOwnProperty.call(e,"compound")?e.compound:!1,this._label=void 0,this._defaultNodeLabelFn=a.constant$1(void 0),this._defaultEdgeLabelFn=a.constant$1(void 0),this._nodes={},this._isCompound&&(this._parent={},this._children={},this._children[u]={}),this._in={},this._preds={},this._out={},this._sucs={},this._edgeObjs={},this._edgeLabels={}}isDirected(){return this._isDirected}isMultigraph(){return this._isMultigraph}isCompound(){return this._isCompound}setGraph(e){return this._label=e,this}graph(){return this._label}setDefaultNodeLabel(e){return a.isFunction(e)||(e=a.constant$1(e)),this._defaultNodeLabelFn=e,this}nodeCount(){return this._nodeCount}nodes(){return n.keys(this._nodes)}sources(){var e=this;return n.filter(this.nodes(),function(t){return a.isEmpty(e._in[t])})}sinks(){var e=this;return n.filter(this.nodes(),function(t){return a.isEmpty(e._out[t])})}setNodes(e,t){var s=arguments,i=this;return n.forEach(e,function(r){s.length>1?i.setNode(r,t):i.setNode(r)}),this}setNode(e,t){return Object.prototype.hasOwnProperty.call(this._nodes,e)?(arguments.length>1&&(this._nodes[e]=t),this):(this._nodes[e]=arguments.length>1?t:this._defaultNodeLabelFn(e),this._isCompound&&(this._parent[e]=u,this._children[e]={},this._children[u][e]=!0),this._in[e]={},this._preds[e]={},this._out[e]={},this._sucs[e]={},++this._nodeCount,this)}node(e){return this._nodes[e]}hasNode(e){return Object.prototype.hasOwnProperty.call(this._nodes,e)}removeNode(e){if(Object.prototype.hasOwnProperty.call(this._nodes,e)){var t=s=>this.removeEdge(this._edgeObjs[s]);delete this._nodes[e],this._isCompound&&(this._removeFromParentsChildList(e),delete this._parent[e],n.forEach(this.children(e),s=>{this.setParent(s)}),delete this._children[e]),n.forEach(n.keys(this._in[e]),t),delete this._in[e],delete this._preds[e],n.forEach(n.keys(this._out[e]),t),delete this._out[e],delete this._sucs[e],--this._nodeCount}return this}setParent(e,t){if(!this._isCompound)throw new Error("Cannot set parent in a non-compound graph");if(n.isUndefined(t))t=u;else{t+="";for(var s=t;!n.isUndefined(s);s=this.parent(s))if(s===e)throw new Error("Setting "+t+" as parent of "+e+" would create a cycle");this.setNode(t)}return this.setNode(e),this._removeFromParentsChildList(e),this._parent[e]=t,this._children[t][e]=!0,this}_removeFromParentsChildList(e){delete this._children[this._parent[e]][e]}parent(e){if(this._isCompound){var t=this._parent[e];if(t!==u)return t}}children(e){if(n.isUndefined(e)&&(e=u),this._isCompound){var t=this._children[e];if(t)return n.keys(t)}else{if(e===u)return this.nodes();if(this.hasNode(e))return[]}}predecessors(e){var t=this._preds[e];if(t)return n.keys(t)}successors(e){var t=this._sucs[e];if(t)return n.keys(t)}neighbors(e){var t=this.predecessors(e);if(t)return b(t,this.successors(e))}isLeaf(e){var t;return this.isDirected()?t=this.successors(e):t=this.neighbors(e),t.length===0}filterNodes(e){var t=new this.constructor({directed:this._isDirected,multigraph:this._isMultigraph,compound:this._isCompound});t.setGraph(this.graph());var s=this;n.forEach(this._nodes,function(h,d){e(d)&&t.setNode(d,h)}),n.forEach(this._edgeObjs,function(h){t.hasNode(h.v)&&t.hasNode(h.w)&&t.setEdge(h,s.edge(h))});var i={};function r(h){var d=s.parent(h);return d===void 0||t.hasNode(d)?(i[h]=d,d):d in i?i[d]:r(d)}return this._isCompound&&n.forEach(t.nodes(),function(h){t.setParent(h,r(h))}),t}setDefaultEdgeLabel(e){return a.isFunction(e)||(e=a.constant$1(e)),this._defaultEdgeLabelFn=e,this}edgeCount(){return this._edgeCount}edges(){return n.values(this._edgeObjs)}setPath(e,t){var s=this,i=arguments;return n.reduce(e,function(r,h){return i.length>1?s.setEdge(r,h,t):s.setEdge(r,h),h}),this}setEdge(){var e,t,s,i,r=!1,h=arguments[0];typeof h=="object"&&h!==null&&"v"in h?(e=h.v,t=h.w,s=h.name,arguments.length===2&&(i=arguments[1],r=!0)):(e=h,t=arguments[1],s=arguments[3],arguments.length>2&&(i=arguments[2],r=!0)),e=""+e,t=""+t,n.isUndefined(s)||(s=""+s);var d=_(this._isDirected,e,t,s);if(Object.prototype.hasOwnProperty.call(this._edgeLabels,d))return r&&(this._edgeLabels[d]=i),this;if(!n.isUndefined(s)&&!this._isMultigraph)throw new Error("Cannot set a named edge when isMultigraph = false");this.setNode(e),this.setNode(t),this._edgeLabels[d]=r?i:this._defaultEdgeLabelFn(e,t,s);var l=y(this._isDirected,e,t,s);return e=l.v,t=l.w,Object.freeze(l),this._edgeObjs[d]=l,p(this._preds[t],e),p(this._sucs[e],t),this._in[t][d]=l,this._out[e][d]=l,this._edgeCount++,this}edge(e,t,s){var i=arguments.length===1?c(this._isDirected,arguments[0]):_(this._isDirected,e,t,s);return this._edgeLabels[i]}hasEdge(e,t,s){var i=arguments.length===1?c(this._isDirected,arguments[0]):_(this._isDirected,e,t,s);return Object.prototype.hasOwnProperty.call(this._edgeLabels,i)}removeEdge(e,t,s){var i=arguments.length===1?c(this._isDirected,arguments[0]):_(this._isDirected,e,t,s),r=this._edgeObjs[i];return r&&(e=r.v,t=r.w,delete this._edgeLabels[i],delete this._edgeObjs[i],m(this._preds[t],e),m(this._sucs[e],t),delete this._in[t][i],delete this._out[e][i],this._edgeCount--),this}inEdges(e,t){var s=this._in[e];if(s){var i=n.values(s);return t?n.filter(i,function(r){return r.v===t}):i}}outEdges(e,t){var s=this._out[e];if(s){var i=n.values(s);return t?n.filter(i,function(r){return r.w===t}):i}}nodeEdges(e,t){var s=this.inEdges(e,t);if(s)return s.concat(this.outEdges(e,t))}}f.prototype._nodeCount=0;f.prototype._edgeCount=0;function p(o,e){o[e]?o[e]++:o[e]=1}function m(o,e){--o[e]||delete o[e]}function _(o,e,t,s){var i=""+e,r=""+t;if(!o&&i>r){var h=i;i=r,r=h}return i+g+r+g+(n.isUndefined(s)?E:s)}function y(o,e,t,s){var i=""+e,r=""+t;if(!o&&i>r){var h=i;i=r,r=h}var d={v:i,w:r};return s&&(d.name=s),d}function c(o,e){return _(o,e.v,e.w,e.name)}exports.Graph=f;
+//# sourceMappingURL=graph-BzzeK1Gv.cjs.map

package/dist/{graph-rSA-aI4s.cjs.map → graph-BzzeK1Gv.cjs.map}

@@ -1 +1 @@
-{"version":3,"file":"graph-rSA-aI4s.cjs","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":"2FAqBA,IAAIA,EAAQC,EAAAA,SAAS,SAASC,EAAQ,CACpC,OAAOC,EAAAA,SAASC,EAAAA,YAAYF,EAAQ,EAAGG,EAAAA,kBAAmB,EAAI,CAAC,CACjE,CAAC,ECrBGC,EAAoB,KACpBC,EAAa,KACbC,EAAiB,IAqBd,MAAMC,CAAM,CACjB,YAAYC,EAAO,GAAI,CACrB,KAAK,YAAc,OAAO,UAAU,eAAe,KAAKA,EAAM,UAAU,EACpEA,EAAK,SACL,GACJ,KAAK,cAAgB,OAAO,UAAU,eAAe,KAAKA,EAAM,YAAY,EACxEA,EAAK,WACL,GACJ,KAAK,YAAc,OAAO,UAAU,eAAe,KAAKA,EAAM,UAAU,EACpEA,EAAK,SACL,GAGJ,KAAK,OAAS,OAGd,KAAK,oBAAsBC,EAAAA,WAAW,MAAS,EAG/C,KAAK,oBAAsBA,EAAAA,WAAW,MAAS,EAG/C,KAAK,OAAS,CAAA,EAEV,KAAK,cAEP,KAAK,QAAU,CAAA,EAGf,KAAK,UAAY,CAAA,EACjB,KAAK,UAAUJ,CAAU,EAAI,CAAA,GAI/B,KAAK,IAAM,CAAA,EAGX,KAAK,OAAS,CAAA,EAGd,KAAK,KAAO,CAAA,EAGZ,KAAK,MAAQ,CAAA,EAGb,KAAK,UAAY,CAAA,EAGjB,KAAK,YAAc,CAAA,CACrB,CAEA,YAAa,CACX,OAAO,KAAK,WACd,CACA,cAAe,CACb,OAAO,KAAK,aACd,CACA,YAAa,CACX,OAAO,KAAK,WACd,CACA,SAASK,EAAO,CACd,YAAK,OAASA,EACP,IACT,CACA,OAAQ,CACN,OAAO,KAAK,MACd,CAEA,oBAAoBC,EAAY,CAC9B,OAAKC,EAAAA,WAAaD,CAAU,IAC1BA,EAAaF,EAAAA,WAAWE,CAAU,GAEpC,KAAK,oBAAsBA,EACpB,IACT,CACA,WAAY,CACV,OAAO,KAAK,UACd,CACA,OAAQ,CACN,OAAOE,EAAAA,KAAO,KAAK,MAAM,CAC3B,CACA,SAAU,CACR,IAAIC,EAAO,KACX,OAAOC,EAAAA,OAAS,KAAK,MAAK,EAAI,SAAUC,EAAG,CACzC,OAAOC,UAAUH,EAAK,IAAIE,CAAC,CAAC,CAC9B,CAAC,CACH,CACA,OAAQ,CACN,IAAIF,EAAO,KACX,OAAOC,EAAAA,OAAS,KAAK,MAAK,EAAI,SAAUC,EAAG,CACzC,OAAOC,UAAUH,EAAK,KAAKE,CAAC,CAAC,CAC/B,CAAC,CACH,CACA,SAASE,EAAIC,EAAO,CAClB,IAAIC,EAAO,UACPN,EAAO,KACXO,OAAAA,UAAOH,EAAI,SAAUF,EAAG,CAClBI,EAAK,OAAS,EAChBN,EAAK,QAAQE,EAAGG,CAAK,EAErBL,EAAK,QAAQE,CAAC,CAElB,CAAC,EACM,IACT,CACA,QAAQA,EAAGG,EAAO,CAChB,OAAI,OAAO,UAAU,eAAe,KAAK,KAAK,OAAQH,CAAC,GACjD,UAAU,OAAS,IACrB,KAAK,OAAOA,CAAC,EAAIG,GAEZ,OAIT,KAAK,OAAOH,CAAC,EAAI,UAAU,OAAS,EAAIG,EAAQ,KAAK,oBAAoBH,CAAC,EACtE,KAAK,cACP,KAAK,QAAQA,CAAC,EAAIX,EAClB,KAAK,UAAUW,CAAC,EAAI,CAAA,EACpB,KAAK,UAAUX,CAAU,EAAEW,CAAC,EAAI,IAElC,KAAK,IAAIA,CAAC,EAAI,CAAA,EACd,KAAK,OAAOA,CAAC,EAAI,CAAA,EACjB,KAAK,KAAKA,CAAC,EAAI,CAAA,EACf,KAAK,MAAMA,CAAC,EAAI,CAAA,EAChB,EAAE,KAAK,WACA,KACT,CACA,KAAKA,EAAG,CACN,OAAO,KAAK,OAAOA,CAAC,CACtB,CACA,QAAQA,EAAG,CACT,OAAO,OAAO,UAAU,eAAe,KAAK,KAAK,OAAQA,CAAC,CAC5D,CACA,WAAWA,EAAG,CACZ,GAAI,OAAO,UAAU,eAAe,KAAK,KAAK,OAAQA,CAAC,EAAG,CACxD,IAAIM,EAAcC,GAAM,KAAK,WAAW,KAAK,UAAUA,CAAC,CAAC,EACzD,OAAO,KAAK,OAAOP,CAAC,EAChB,KAAK,cACP,KAAK,4BAA4BA,CAAC,EAClC,OAAO,KAAK,QAAQA,CAAC,EACrBK,EAAAA,QAAO,KAAK,SAASL,CAAC,EAAIQ,GAAU,CAClC,KAAK,UAAUA,CAAK,CACtB,CAAC,EACD,OAAO,KAAK,UAAUR,CAAC,GAEzBK,EAAAA,QAAOR,EAAAA,KAAO,KAAK,IAAIG,CAAC,CAAC,EAAGM,CAAU,EACtC,OAAO,KAAK,IAAIN,CAAC,EACjB,OAAO,KAAK,OAAOA,CAAC,EACpBK,EAAAA,QAAOR,EAAAA,KAAO,KAAK,KAAKG,CAAC,CAAC,EAAGM,CAAU,EACvC,OAAO,KAAK,KAAKN,CAAC,EAClB,OAAO,KAAK,MAAMA,CAAC,EACnB,EAAE,KAAK,UACT,CACA,OAAO,IACT,CACA,UAAUA,EAAGS,EAAQ,CACnB,GAAI,CAAC,KAAK,YACR,MAAM,IAAI,MAAM,2CAA2C,EAG7D,GAAIC,EAAAA,YAAcD,CAAM,EACtBA,EAASpB,MACJ,CAELoB,GAAU,GACV,QAASE,EAAWF,EAAQ,CAACC,cAAcC,CAAQ,EAAGA,EAAW,KAAK,OAAOA,CAAQ,EACnF,GAAIA,IAAaX,EACf,MAAM,IAAI,MAAM,WAAaS,EAAS,iBAAmBT,EAAI,uBAAuB,EAIxF,KAAK,QAAQS,CAAM,CACrB,CAEA,YAAK,QAAQT,CAAC,EACd,KAAK,4BAA4BA,CAAC,EAClC,KAAK,QAAQA,CAAC,EAAIS,EAClB,KAAK,UAAUA,CAAM,EAAET,CAAC,EAAI,GACrB,IACT,CACA,4BAA4BA,EAAG,CAC7B,OAAO,KAAK,UAAU,KAAK,QAAQA,CAAC,CAAC,EAAEA,CAAC,CAC1C,CACA,OAAOA,EAAG,CACR,GAAI,KAAK,YAAa,CACpB,IAAIS,EAAS,KAAK,QAAQT,CAAC,EAC3B,GAAIS,IAAWpB,EACb,OAAOoB,CAEX,CACF,CACA,SAAST,EAAG,CAKV,GAJIU,EAAAA,YAAcV,CAAC,IACjBA,EAAIX,GAGF,KAAK,YAAa,CACpB,IAAIuB,EAAW,KAAK,UAAUZ,CAAC,EAC/B,GAAIY,EACF,OAAOf,EAAAA,KAAOe,CAAQ,CAE1B,KAAO,IAAIZ,IAAMX,EACf,OAAO,KAAK,MAAK,EACZ,GAAI,KAAK,QAAQW,CAAC,EACvB,MAAO,CAAA,EAEX,CACA,aAAaA,EAAG,CACd,IAAIa,EAAS,KAAK,OAAOb,CAAC,EAC1B,GAAIa,EACF,OAAOhB,EAAAA,KAAOgB,CAAM,CAExB,CACA,WAAWb,EAAG,CACZ,IAAIc,EAAQ,KAAK,MAAMd,CAAC,EACxB,GAAIc,EACF,OAAOjB,EAAAA,KAAOiB,CAAK,CAEvB,CACA,UAAUd,EAAG,CACX,IAAIe,EAAQ,KAAK,aAAaf,CAAC,EAC/B,GAAIe,EACF,OAAOC,EAAQD,EAAO,KAAK,WAAWf,CAAC,CAAC,CAE5C,CACA,OAAOA,EAAG,CACR,IAAIiB,EACJ,OAAI,KAAK,aACPA,EAAY,KAAK,WAAWjB,CAAC,EAE7BiB,EAAY,KAAK,UAAUjB,CAAC,EAEvBiB,EAAU,SAAW,CAC9B,CACA,YAAYC,EAAQ,CAElB,IAAIC,EAAO,IAAI,KAAK,YAAY,CAC9B,SAAU,KAAK,YACf,WAAY,KAAK,cACjB,SAAU,KAAK,WACrB,CAAK,EAEDA,EAAK,SAAS,KAAK,OAAO,EAE1B,IAAIrB,EAAO,KACXO,EAAAA,QAAO,KAAK,OAAQ,SAAUF,EAAOH,EAAG,CAClCkB,EAAOlB,CAAC,GACVmB,EAAK,QAAQnB,EAAGG,CAAK,CAEzB,CAAC,EAEDE,EAAAA,QAAO,KAAK,UAAW,SAAUE,EAAG,CAE9BY,EAAK,QAAQZ,EAAE,CAAC,GAAKY,EAAK,QAAQZ,EAAE,CAAC,GACvCY,EAAK,QAAQZ,EAAGT,EAAK,KAAKS,CAAC,CAAC,CAEhC,CAAC,EAED,IAAIa,EAAU,CAAA,EACd,SAASC,EAAWrB,EAAG,CACrB,IAAIS,EAASX,EAAK,OAAOE,CAAC,EAC1B,OAAIS,IAAW,QAAaU,EAAK,QAAQV,CAAM,GAC7CW,EAAQpB,CAAC,EAAIS,EACNA,GACEA,KAAUW,EACZA,EAAQX,CAAM,EAEdY,EAAWZ,CAAM,CAE5B,CAEA,OAAI,KAAK,aACPJ,EAAAA,QAAOc,EAAK,MAAK,EAAI,SAAUnB,EAAG,CAChCmB,EAAK,UAAUnB,EAAGqB,EAAWrB,CAAC,CAAC,CACjC,CAAC,EAGImB,CACT,CAEA,oBAAoBxB,EAAY,CAC9B,OAAKC,EAAAA,WAAaD,CAAU,IAC1BA,EAAaF,EAAAA,WAAWE,CAAU,GAEpC,KAAK,oBAAsBA,EACpB,IACT,CACA,WAAY,CACV,OAAO,KAAK,UACd,CACA,OAAQ,CACN,OAAO2B,EAAAA,OAAS,KAAK,SAAS,CAChC,CACA,QAAQpB,EAAIC,EAAO,CACjB,IAAIL,EAAO,KACPM,EAAO,UACXmB,OAAAA,EAAAA,OAASrB,EAAI,SAAUF,EAAGwB,EAAG,CAC3B,OAAIpB,EAAK,OAAS,EAChBN,EAAK,QAAQE,EAAGwB,EAAGrB,CAAK,EAExBL,EAAK,QAAQE,EAAGwB,CAAC,EAEZA,CACT,CAAC,EACM,IACT,CAKA,SAAU,CACR,IAAIxB,EAAGwB,EAAGC,EAAMtB,EACZuB,EAAiB,GACjBC,EAAO,UAAU,CAAC,EAElB,OAAOA,GAAS,UAAYA,IAAS,MAAQ,MAAOA,GACtD3B,EAAI2B,EAAK,EACTH,EAAIG,EAAK,EACTF,EAAOE,EAAK,KACR,UAAU,SAAW,IACvBxB,EAAQ,UAAU,CAAC,EACnBuB,EAAiB,MAGnB1B,EAAI2B,EACJH,EAAI,UAAU,CAAC,EACfC,EAAO,UAAU,CAAC,EACd,UAAU,OAAS,IACrBtB,EAAQ,UAAU,CAAC,EACnBuB,EAAiB,KAIrB1B,EAAI,GAAKA,EACTwB,EAAI,GAAKA,EACJd,EAAAA,YAAce,CAAI,IACrBA,EAAO,GAAKA,GAGd,IAAIlB,EAAIqB,EAAa,KAAK,YAAa5B,EAAGwB,EAAGC,CAAI,EACjD,GAAI,OAAO,UAAU,eAAe,KAAK,KAAK,YAAalB,CAAC,EAC1D,OAAImB,IACF,KAAK,YAAYnB,CAAC,EAAIJ,GAEjB,KAGT,GAAI,CAACO,EAAAA,YAAce,CAAI,GAAK,CAAC,KAAK,cAChC,MAAM,IAAI,MAAM,mDAAmD,EAKrE,KAAK,QAAQzB,CAAC,EACd,KAAK,QAAQwB,CAAC,EAGd,KAAK,YAAYjB,CAAC,EAAImB,EAAiBvB,EAAQ,KAAK,oBAAoBH,EAAGwB,EAAGC,CAAI,EAElF,IAAII,EAAUC,EAAc,KAAK,YAAa9B,EAAGwB,EAAGC,CAAI,EAExD,OAAAzB,EAAI6B,EAAQ,EACZL,EAAIK,EAAQ,EAEZ,OAAO,OAAOA,CAAO,EACrB,KAAK,UAAUtB,CAAC,EAAIsB,EACpBE,EAAqB,KAAK,OAAOP,CAAC,EAAGxB,CAAC,EACtC+B,EAAqB,KAAK,MAAM/B,CAAC,EAAGwB,CAAC,EACrC,KAAK,IAAIA,CAAC,EAAEjB,CAAC,EAAIsB,EACjB,KAAK,KAAK7B,CAAC,EAAEO,CAAC,EAAIsB,EAClB,KAAK,aACE,IACT,CACA,KAAK7B,EAAGwB,EAAGC,EAAM,CACf,IAAIlB,EACF,UAAU,SAAW,EACjByB,EAAY,KAAK,YAAa,UAAU,CAAC,CAAC,EAC1CJ,EAAa,KAAK,YAAa5B,EAAGwB,EAAGC,CAAI,EAC/C,OAAO,KAAK,YAAYlB,CAAC,CAC3B,CACA,QAAQP,EAAGwB,EAAGC,EAAM,CAClB,IAAIlB,EACF,UAAU,SAAW,EACjByB,EAAY,KAAK,YAAa,UAAU,CAAC,CAAC,EAC1CJ,EAAa,KAAK,YAAa5B,EAAGwB,EAAGC,CAAI,EAC/C,OAAO,OAAO,UAAU,eAAe,KAAK,KAAK,YAAalB,CAAC,CACjE,CACA,WAAWP,EAAGwB,EAAGC,EAAM,CACrB,IAAIlB,EACF,UAAU,SAAW,EACjByB,EAAY,KAAK,YAAa,UAAU,CAAC,CAAC,EAC1CJ,EAAa,KAAK,YAAa5B,EAAGwB,EAAGC,CAAI,EAC3CQ,EAAO,KAAK,UAAU1B,CAAC,EAC3B,OAAI0B,IACFjC,EAAIiC,EAAK,EACTT,EAAIS,EAAK,EACT,OAAO,KAAK,YAAY1B,CAAC,EACzB,OAAO,KAAK,UAAUA,CAAC,EACvB2B,EAAuB,KAAK,OAAOV,CAAC,EAAGxB,CAAC,EACxCkC,EAAuB,KAAK,MAAMlC,CAAC,EAAGwB,CAAC,EACvC,OAAO,KAAK,IAAIA,CAAC,EAAEjB,CAAC,EACpB,OAAO,KAAK,KAAKP,CAAC,EAAEO,CAAC,EACrB,KAAK,cAEA,IACT,CACA,QAAQP,EAAGmC,EAAG,CACZ,IAAIC,EAAM,KAAK,IAAIpC,CAAC,EACpB,GAAIoC,EAAK,CACP,IAAIC,EAAQf,EAAAA,OAASc,CAAG,EACxB,OAAKD,EAGEpC,EAAAA,OAASsC,EAAO,SAAUJ,EAAM,CACrC,OAAOA,EAAK,IAAME,CACpB,CAAC,EAJQE,CAKX,CACF,CACA,SAASrC,EAAGwB,EAAG,CACb,IAAIc,EAAO,KAAK,KAAKtC,CAAC,EACtB,GAAIsC,EAAM,CACR,IAAID,EAAQf,EAAAA,OAASgB,CAAI,EACzB,OAAKd,EAGEzB,EAAAA,OAASsC,EAAO,SAAUJ,EAAM,CACrC,OAAOA,EAAK,IAAMT,CACpB,CAAC,EAJQa,CAKX,CACF,CACA,UAAUrC,EAAGwB,EAAG,CACd,IAAIe,EAAU,KAAK,QAAQvC,EAAGwB,CAAC,EAC/B,GAAIe,EACF,OAAOA,EAAQ,OAAO,KAAK,SAASvC,EAAGwB,CAAC,CAAC,CAE7C,CACF,CAGAjC,EAAM,UAAU,WAAa,EAG7BA,EAAM,UAAU,WAAa,EAE7B,SAASwC,EAAqBS,EAAKC,EAAG,CAChCD,EAAIC,CAAC,EACPD,EAAIC,CAAC,IAELD,EAAIC,CAAC,EAAI,CAEb,CAEA,SAASP,EAAuBM,EAAKC,EAAG,CACjC,EAAED,EAAIC,CAAC,GACV,OAAOD,EAAIC,CAAC,CAEhB,CAEA,SAASb,EAAac,EAAYC,EAAIC,EAAInB,EAAM,CAC9C,IAAIzB,EAAI,GAAK2C,EACTnB,EAAI,GAAKoB,EACb,GAAI,CAACF,GAAc1C,EAAIwB,EAAG,CACxB,IAAIqB,EAAM7C,EACVA,EAAIwB,EACJA,EAAIqB,CACN,CACA,OAAO7C,EAAIV,EAAiBkC,EAAIlC,GAAkBoB,EAAAA,YAAce,CAAI,EAAIrC,EAAoBqC,EAC9F,CAEA,SAASK,EAAcY,EAAYC,EAAIC,EAAInB,EAAM,CAC/C,IAAIzB,EAAI,GAAK2C,EACTnB,EAAI,GAAKoB,EACb,GAAI,CAACF,GAAc1C,EAAIwB,EAAG,CACxB,IAAIqB,EAAM7C,EACVA,EAAIwB,EACJA,EAAIqB,CACN,CACA,IAAIhB,EAAU,CAAE,EAAG7B,EAAG,EAAGwB,CAAC,EAC1B,OAAIC,IACFI,EAAQ,KAAOJ,GAEVI,CACT,CAEA,SAASG,EAAYU,EAAYb,EAAS,CACxC,OAAOD,EAAac,EAAYb,EAAQ,EAAGA,EAAQ,EAAGA,EAAQ,IAAI,CACpE","x_google_ignoreList":[0,1]}
+{"version":3,"file":"graph-BzzeK1Gv.cjs","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":"qGAqBA,IAAIA,EAAQC,EAAAA,SAAS,SAASC,EAAQ,CACpC,OAAOC,EAAAA,SAASC,EAAAA,YAAYF,EAAQ,EAAGG,EAAAA,kBAAmB,EAAI,CAAC,CACjE,CAAC,ECrBGC,EAAoB,KACpBC,EAAa,KACbC,EAAiB,IAqBd,MAAMC,CAAM,CACjB,YAAYC,EAAO,GAAI,CACrB,KAAK,YAAc,OAAO,UAAU,eAAe,KAAKA,EAAM,UAAU,EACpEA,EAAK,SACL,GACJ,KAAK,cAAgB,OAAO,UAAU,eAAe,KAAKA,EAAM,YAAY,EACxEA,EAAK,WACL,GACJ,KAAK,YAAc,OAAO,UAAU,eAAe,KAAKA,EAAM,UAAU,EACpEA,EAAK,SACL,GAGJ,KAAK,OAAS,OAGd,KAAK,oBAAsBC,EAAAA,WAAW,MAAS,EAG/C,KAAK,oBAAsBA,EAAAA,WAAW,MAAS,EAG/C,KAAK,OAAS,CAAA,EAEV,KAAK,cAEP,KAAK,QAAU,CAAA,EAGf,KAAK,UAAY,CAAA,EACjB,KAAK,UAAUJ,CAAU,EAAI,CAAA,GAI/B,KAAK,IAAM,CAAA,EAGX,KAAK,OAAS,CAAA,EAGd,KAAK,KAAO,CAAA,EAGZ,KAAK,MAAQ,CAAA,EAGb,KAAK,UAAY,CAAA,EAGjB,KAAK,YAAc,CAAA,CACrB,CAEA,YAAa,CACX,OAAO,KAAK,WACd,CACA,cAAe,CACb,OAAO,KAAK,aACd,CACA,YAAa,CACX,OAAO,KAAK,WACd,CACA,SAASK,EAAO,CACd,YAAK,OAASA,EACP,IACT,CACA,OAAQ,CACN,OAAO,KAAK,MACd,CAEA,oBAAoBC,EAAY,CAC9B,OAAKC,EAAAA,WAAaD,CAAU,IAC1BA,EAAaF,EAAAA,WAAWE,CAAU,GAEpC,KAAK,oBAAsBA,EACpB,IACT,CACA,WAAY,CACV,OAAO,KAAK,UACd,CACA,OAAQ,CACN,OAAOE,EAAAA,KAAO,KAAK,MAAM,CAC3B,CACA,SAAU,CACR,IAAIC,EAAO,KACX,OAAOC,EAAAA,OAAS,KAAK,MAAK,EAAI,SAAUC,EAAG,CACzC,OAAOC,UAAUH,EAAK,IAAIE,CAAC,CAAC,CAC9B,CAAC,CACH,CACA,OAAQ,CACN,IAAIF,EAAO,KACX,OAAOC,EAAAA,OAAS,KAAK,MAAK,EAAI,SAAUC,EAAG,CACzC,OAAOC,UAAUH,EAAK,KAAKE,CAAC,CAAC,CAC/B,CAAC,CACH,CACA,SAASE,EAAIC,EAAO,CAClB,IAAIC,EAAO,UACPN,EAAO,KACXO,OAAAA,UAAOH,EAAI,SAAUF,EAAG,CAClBI,EAAK,OAAS,EAChBN,EAAK,QAAQE,EAAGG,CAAK,EAErBL,EAAK,QAAQE,CAAC,CAElB,CAAC,EACM,IACT,CACA,QAAQA,EAAGG,EAAO,CAChB,OAAI,OAAO,UAAU,eAAe,KAAK,KAAK,OAAQH,CAAC,GACjD,UAAU,OAAS,IACrB,KAAK,OAAOA,CAAC,EAAIG,GAEZ,OAIT,KAAK,OAAOH,CAAC,EAAI,UAAU,OAAS,EAAIG,EAAQ,KAAK,oBAAoBH,CAAC,EACtE,KAAK,cACP,KAAK,QAAQA,CAAC,EAAIX,EAClB,KAAK,UAAUW,CAAC,EAAI,CAAA,EACpB,KAAK,UAAUX,CAAU,EAAEW,CAAC,EAAI,IAElC,KAAK,IAAIA,CAAC,EAAI,CAAA,EACd,KAAK,OAAOA,CAAC,EAAI,CAAA,EACjB,KAAK,KAAKA,CAAC,EAAI,CAAA,EACf,KAAK,MAAMA,CAAC,EAAI,CAAA,EAChB,EAAE,KAAK,WACA,KACT,CACA,KAAKA,EAAG,CACN,OAAO,KAAK,OAAOA,CAAC,CACtB,CACA,QAAQA,EAAG,CACT,OAAO,OAAO,UAAU,eAAe,KAAK,KAAK,OAAQA,CAAC,CAC5D,CACA,WAAWA,EAAG,CACZ,GAAI,OAAO,UAAU,eAAe,KAAK,KAAK,OAAQA,CAAC,EAAG,CACxD,IAAIM,EAAcC,GAAM,KAAK,WAAW,KAAK,UAAUA,CAAC,CAAC,EACzD,OAAO,KAAK,OAAOP,CAAC,EAChB,KAAK,cACP,KAAK,4BAA4BA,CAAC,EAClC,OAAO,KAAK,QAAQA,CAAC,EACrBK,EAAAA,QAAO,KAAK,SAASL,CAAC,EAAIQ,GAAU,CAClC,KAAK,UAAUA,CAAK,CACtB,CAAC,EACD,OAAO,KAAK,UAAUR,CAAC,GAEzBK,EAAAA,QAAOR,EAAAA,KAAO,KAAK,IAAIG,CAAC,CAAC,EAAGM,CAAU,EACtC,OAAO,KAAK,IAAIN,CAAC,EACjB,OAAO,KAAK,OAAOA,CAAC,EACpBK,EAAAA,QAAOR,EAAAA,KAAO,KAAK,KAAKG,CAAC,CAAC,EAAGM,CAAU,EACvC,OAAO,KAAK,KAAKN,CAAC,EAClB,OAAO,KAAK,MAAMA,CAAC,EACnB,EAAE,KAAK,UACT,CACA,OAAO,IACT,CACA,UAAUA,EAAGS,EAAQ,CACnB,GAAI,CAAC,KAAK,YACR,MAAM,IAAI,MAAM,2CAA2C,EAG7D,GAAIC,EAAAA,YAAcD,CAAM,EACtBA,EAASpB,MACJ,CAELoB,GAAU,GACV,QAASE,EAAWF,EAAQ,CAACC,cAAcC,CAAQ,EAAGA,EAAW,KAAK,OAAOA,CAAQ,EACnF,GAAIA,IAAaX,EACf,MAAM,IAAI,MAAM,WAAaS,EAAS,iBAAmBT,EAAI,uBAAuB,EAIxF,KAAK,QAAQS,CAAM,CACrB,CAEA,YAAK,QAAQT,CAAC,EACd,KAAK,4BAA4BA,CAAC,EAClC,KAAK,QAAQA,CAAC,EAAIS,EAClB,KAAK,UAAUA,CAAM,EAAET,CAAC,EAAI,GACrB,IACT,CACA,4BAA4BA,EAAG,CAC7B,OAAO,KAAK,UAAU,KAAK,QAAQA,CAAC,CAAC,EAAEA,CAAC,CAC1C,CACA,OAAOA,EAAG,CACR,GAAI,KAAK,YAAa,CACpB,IAAIS,EAAS,KAAK,QAAQT,CAAC,EAC3B,GAAIS,IAAWpB,EACb,OAAOoB,CAEX,CACF,CACA,SAAST,EAAG,CAKV,GAJIU,EAAAA,YAAcV,CAAC,IACjBA,EAAIX,GAGF,KAAK,YAAa,CACpB,IAAIuB,EAAW,KAAK,UAAUZ,CAAC,EAC/B,GAAIY,EACF,OAAOf,EAAAA,KAAOe,CAAQ,CAE1B,KAAO,IAAIZ,IAAMX,EACf,OAAO,KAAK,MAAK,EACZ,GAAI,KAAK,QAAQW,CAAC,EACvB,MAAO,CAAA,EAEX,CACA,aAAaA,EAAG,CACd,IAAIa,EAAS,KAAK,OAAOb,CAAC,EAC1B,GAAIa,EACF,OAAOhB,EAAAA,KAAOgB,CAAM,CAExB,CACA,WAAWb,EAAG,CACZ,IAAIc,EAAQ,KAAK,MAAMd,CAAC,EACxB,GAAIc,EACF,OAAOjB,EAAAA,KAAOiB,CAAK,CAEvB,CACA,UAAUd,EAAG,CACX,IAAIe,EAAQ,KAAK,aAAaf,CAAC,EAC/B,GAAIe,EACF,OAAOC,EAAQD,EAAO,KAAK,WAAWf,CAAC,CAAC,CAE5C,CACA,OAAOA,EAAG,CACR,IAAIiB,EACJ,OAAI,KAAK,aACPA,EAAY,KAAK,WAAWjB,CAAC,EAE7BiB,EAAY,KAAK,UAAUjB,CAAC,EAEvBiB,EAAU,SAAW,CAC9B,CACA,YAAYC,EAAQ,CAElB,IAAIC,EAAO,IAAI,KAAK,YAAY,CAC9B,SAAU,KAAK,YACf,WAAY,KAAK,cACjB,SAAU,KAAK,WACrB,CAAK,EAEDA,EAAK,SAAS,KAAK,OAAO,EAE1B,IAAIrB,EAAO,KACXO,EAAAA,QAAO,KAAK,OAAQ,SAAUF,EAAOH,EAAG,CAClCkB,EAAOlB,CAAC,GACVmB,EAAK,QAAQnB,EAAGG,CAAK,CAEzB,CAAC,EAEDE,EAAAA,QAAO,KAAK,UAAW,SAAUE,EAAG,CAE9BY,EAAK,QAAQZ,EAAE,CAAC,GAAKY,EAAK,QAAQZ,EAAE,CAAC,GACvCY,EAAK,QAAQZ,EAAGT,EAAK,KAAKS,CAAC,CAAC,CAEhC,CAAC,EAED,IAAIa,EAAU,CAAA,EACd,SAASC,EAAWrB,EAAG,CACrB,IAAIS,EAASX,EAAK,OAAOE,CAAC,EAC1B,OAAIS,IAAW,QAAaU,EAAK,QAAQV,CAAM,GAC7CW,EAAQpB,CAAC,EAAIS,EACNA,GACEA,KAAUW,EACZA,EAAQX,CAAM,EAEdY,EAAWZ,CAAM,CAE5B,CAEA,OAAI,KAAK,aACPJ,EAAAA,QAAOc,EAAK,MAAK,EAAI,SAAUnB,EAAG,CAChCmB,EAAK,UAAUnB,EAAGqB,EAAWrB,CAAC,CAAC,CACjC,CAAC,EAGImB,CACT,CAEA,oBAAoBxB,EAAY,CAC9B,OAAKC,EAAAA,WAAaD,CAAU,IAC1BA,EAAaF,EAAAA,WAAWE,CAAU,GAEpC,KAAK,oBAAsBA,EACpB,IACT,CACA,WAAY,CACV,OAAO,KAAK,UACd,CACA,OAAQ,CACN,OAAO2B,EAAAA,OAAS,KAAK,SAAS,CAChC,CACA,QAAQpB,EAAIC,EAAO,CACjB,IAAIL,EAAO,KACPM,EAAO,UACXmB,OAAAA,EAAAA,OAASrB,EAAI,SAAUF,EAAGwB,EAAG,CAC3B,OAAIpB,EAAK,OAAS,EAChBN,EAAK,QAAQE,EAAGwB,EAAGrB,CAAK,EAExBL,EAAK,QAAQE,EAAGwB,CAAC,EAEZA,CACT,CAAC,EACM,IACT,CAKA,SAAU,CACR,IAAIxB,EAAGwB,EAAGC,EAAMtB,EACZuB,EAAiB,GACjBC,EAAO,UAAU,CAAC,EAElB,OAAOA,GAAS,UAAYA,IAAS,MAAQ,MAAOA,GACtD3B,EAAI2B,EAAK,EACTH,EAAIG,EAAK,EACTF,EAAOE,EAAK,KACR,UAAU,SAAW,IACvBxB,EAAQ,UAAU,CAAC,EACnBuB,EAAiB,MAGnB1B,EAAI2B,EACJH,EAAI,UAAU,CAAC,EACfC,EAAO,UAAU,CAAC,EACd,UAAU,OAAS,IACrBtB,EAAQ,UAAU,CAAC,EACnBuB,EAAiB,KAIrB1B,EAAI,GAAKA,EACTwB,EAAI,GAAKA,EACJd,EAAAA,YAAce,CAAI,IACrBA,EAAO,GAAKA,GAGd,IAAIlB,EAAIqB,EAAa,KAAK,YAAa5B,EAAGwB,EAAGC,CAAI,EACjD,GAAI,OAAO,UAAU,eAAe,KAAK,KAAK,YAAalB,CAAC,EAC1D,OAAImB,IACF,KAAK,YAAYnB,CAAC,EAAIJ,GAEjB,KAGT,GAAI,CAACO,EAAAA,YAAce,CAAI,GAAK,CAAC,KAAK,cAChC,MAAM,IAAI,MAAM,mDAAmD,EAKrE,KAAK,QAAQzB,CAAC,EACd,KAAK,QAAQwB,CAAC,EAGd,KAAK,YAAYjB,CAAC,EAAImB,EAAiBvB,EAAQ,KAAK,oBAAoBH,EAAGwB,EAAGC,CAAI,EAElF,IAAII,EAAUC,EAAc,KAAK,YAAa9B,EAAGwB,EAAGC,CAAI,EAExD,OAAAzB,EAAI6B,EAAQ,EACZL,EAAIK,EAAQ,EAEZ,OAAO,OAAOA,CAAO,EACrB,KAAK,UAAUtB,CAAC,EAAIsB,EACpBE,EAAqB,KAAK,OAAOP,CAAC,EAAGxB,CAAC,EACtC+B,EAAqB,KAAK,MAAM/B,CAAC,EAAGwB,CAAC,EACrC,KAAK,IAAIA,CAAC,EAAEjB,CAAC,EAAIsB,EACjB,KAAK,KAAK7B,CAAC,EAAEO,CAAC,EAAIsB,EAClB,KAAK,aACE,IACT,CACA,KAAK7B,EAAGwB,EAAGC,EAAM,CACf,IAAIlB,EACF,UAAU,SAAW,EACjByB,EAAY,KAAK,YAAa,UAAU,CAAC,CAAC,EAC1CJ,EAAa,KAAK,YAAa5B,EAAGwB,EAAGC,CAAI,EAC/C,OAAO,KAAK,YAAYlB,CAAC,CAC3B,CACA,QAAQP,EAAGwB,EAAGC,EAAM,CAClB,IAAIlB,EACF,UAAU,SAAW,EACjByB,EAAY,KAAK,YAAa,UAAU,CAAC,CAAC,EAC1CJ,EAAa,KAAK,YAAa5B,EAAGwB,EAAGC,CAAI,EAC/C,OAAO,OAAO,UAAU,eAAe,KAAK,KAAK,YAAalB,CAAC,CACjE,CACA,WAAWP,EAAGwB,EAAGC,EAAM,CACrB,IAAIlB,EACF,UAAU,SAAW,EACjByB,EAAY,KAAK,YAAa,UAAU,CAAC,CAAC,EAC1CJ,EAAa,KAAK,YAAa5B,EAAGwB,EAAGC,CAAI,EAC3CQ,EAAO,KAAK,UAAU1B,CAAC,EAC3B,OAAI0B,IACFjC,EAAIiC,EAAK,EACTT,EAAIS,EAAK,EACT,OAAO,KAAK,YAAY1B,CAAC,EACzB,OAAO,KAAK,UAAUA,CAAC,EACvB2B,EAAuB,KAAK,OAAOV,CAAC,EAAGxB,CAAC,EACxCkC,EAAuB,KAAK,MAAMlC,CAAC,EAAGwB,CAAC,EACvC,OAAO,KAAK,IAAIA,CAAC,EAAEjB,CAAC,EACpB,OAAO,KAAK,KAAKP,CAAC,EAAEO,CAAC,EACrB,KAAK,cAEA,IACT,CACA,QAAQP,EAAGmC,EAAG,CACZ,IAAIC,EAAM,KAAK,IAAIpC,CAAC,EACpB,GAAIoC,EAAK,CACP,IAAIC,EAAQf,EAAAA,OAASc,CAAG,EACxB,OAAKD,EAGEpC,EAAAA,OAASsC,EAAO,SAAUJ,EAAM,CACrC,OAAOA,EAAK,IAAME,CACpB,CAAC,EAJQE,CAKX,CACF,CACA,SAASrC,EAAGwB,EAAG,CACb,IAAIc,EAAO,KAAK,KAAKtC,CAAC,EACtB,GAAIsC,EAAM,CACR,IAAID,EAAQf,EAAAA,OAASgB,CAAI,EACzB,OAAKd,EAGEzB,EAAAA,OAASsC,EAAO,SAAUJ,EAAM,CACrC,OAAOA,EAAK,IAAMT,CACpB,CAAC,EAJQa,CAKX,CACF,CACA,UAAUrC,EAAGwB,EAAG,CACd,IAAIe,EAAU,KAAK,QAAQvC,EAAGwB,CAAC,EAC/B,GAAIe,EACF,OAAOA,EAAQ,OAAO,KAAK,SAASvC,EAAGwB,CAAC,CAAC,CAE7C,CACF,CAGAjC,EAAM,UAAU,WAAa,EAG7BA,EAAM,UAAU,WAAa,EAE7B,SAASwC,EAAqBS,EAAKC,EAAG,CAChCD,EAAIC,CAAC,EACPD,EAAIC,CAAC,IAELD,EAAIC,CAAC,EAAI,CAEb,CAEA,SAASP,EAAuBM,EAAKC,EAAG,CACjC,EAAED,EAAIC,CAAC,GACV,OAAOD,EAAIC,CAAC,CAEhB,CAEA,SAASb,EAAac,EAAYC,EAAIC,EAAInB,EAAM,CAC9C,IAAIzB,EAAI,GAAK2C,EACTnB,EAAI,GAAKoB,EACb,GAAI,CAACF,GAAc1C,EAAIwB,EAAG,CACxB,IAAIqB,EAAM7C,EACVA,EAAIwB,EACJA,EAAIqB,CACN,CACA,OAAO7C,EAAIV,EAAiBkC,EAAIlC,GAAkBoB,EAAAA,YAAce,CAAI,EAAIrC,EAAoBqC,EAC9F,CAEA,SAASK,EAAcY,EAAYC,EAAIC,EAAInB,EAAM,CAC/C,IAAIzB,EAAI,GAAK2C,EACTnB,EAAI,GAAKoB,EACb,GAAI,CAACF,GAAc1C,EAAIwB,EAAG,CACxB,IAAIqB,EAAM7C,EACVA,EAAIwB,EACJA,EAAIqB,CACN,CACA,IAAIhB,EAAU,CAAE,EAAG7B,EAAG,EAAGwB,CAAC,EAC1B,OAAIC,IACFI,EAAQ,KAAOJ,GAEVI,CACT,CAEA,SAASG,EAAYU,EAAYb,EAAS,CACxC,OAAOD,EAAac,EAAYb,EAAQ,EAAGA,EAAQ,EAAGA,EAAQ,IAAI,CACpE","x_google_ignoreList":[0,1]}

package/dist/index.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index-BDajGLDt.cjs");exports.BlockLinkNode=e.BlockLinkNode;exports.BlockquoteNode=e.BlockquoteNode;exports.CodeNode=e.CodeNode;exports.DeleteNode=e.DeleteNode;exports.EmphasisNode=e.EmphasisNode;exports.FootnoteBackLinkNode=e.FootnoteBackLinkNode;exports.FootnoteReferenceNode=e.FootnoteReferenceNode;exports.FootnotesSection=e.FootnotesSection;exports.HTMLNode=e.HTMLNode;exports.HeadingNode=e.HeadingNode;exports.ImageNode=e.ImageNode;exports.InlineCodeNode=e.InlineCodeNode;exports.InlineMathNode=e.InlineMathNode;exports.LinkNode=e.LinkNode;exports.ListItemNode=e.ListItemNode;exports.ListNode=e.ListNode;exports.MarkdownRenderer=e.MarkdownRenderer;exports.MathNode=e.MathNode;exports.MermaidDiagram=e.MermaidDiagram;exports.NodesRenderer=e.NodesRenderer;exports.ParagraphNode=e.ParagraphNode;exports.RichLinkCard=e.RichLinkCard;exports.StrongNode=e.StrongNode;exports.TableNode=e.TableNode;exports.TextNode=e.TextNode;exports.ThematicBreakNode=e.ThematicBreakNode;exports.TwitterEmbedNode=e.TwitterEmbedNode;exports.YouTubeEmbedNode=e.YouTubeEmbedNode;exports.ZennDetailsNode=e.ZennDetailsNode;exports.ZennMessageNode=e.ZennMessageNode;exports.createIntentTweetLink=e.createIntentTweetLink;exports.extractYouTubeVideoId=e.extractYouTubeVideoId;exports.fetchSiteMetadata=e.fetchSiteMetadata;exports.getFaviconUrl=e.getFaviconUrl;exports.parseMarkdown=e.parseMarkdown;exports.remarkBlockLink=e.remarkBlockLink;exports.remarkBlockLinkMetadata=e.remarkBlockLinkMetadata;exports.remarkCustomHeadingId=e.remarkCustomHeadingId;exports.remarkFootnoteBackLink=e.remarkFootnoteBackLink;exports.remarkHtmlAnchorToLink=e.remarkHtmlAnchorToLink;exports.remarkHtmlInHtml=e.remarkHtmlInHtml;exports.remarkImageSize=e.remarkImageSize;exports.remarkImportDirective=e.remarkImportDirective;exports.remarkParentNode=e.remarkParentNode;exports.remarkResolveUriAsync=e.remarkResolveUriAsync;exports.remarkTwitterEmbed=e.remarkTwitterEmbed;exports.remarkYouTubeEmbed=e.remarkYouTubeEmbed;exports.remarkZennMessage=e.remarkZennMessage;exports.transformUriAsync=e.transformUriAsync;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./extractHeadings-LdKvrkA9.cjs"),o=require("./remark-zenn-message-B5yftsqg.cjs");exports.BlockLinkNode=e.BlockLinkNode;exports.BlockquoteNode=e.BlockquoteNode;exports.CodeNode=e.CodeNode;exports.DeleteNode=e.DeleteNode;exports.EmphasisNode=e.EmphasisNode;exports.FootnoteBackLinkNode=e.FootnoteBackLinkNode;exports.FootnoteReferenceNode=e.FootnoteReferenceNode;exports.FootnotesSection=e.FootnotesSection;exports.HeadingNode=e.HeadingNode;exports.ImageNode=e.ImageNode;exports.InlineCodeNode=e.InlineCodeNode;exports.LinkNode=e.LinkNode;exports.ListItemNode=e.ListItemNode;exports.ListNode=e.ListNode;exports.MarkdownRenderer=e.MarkdownRenderer;exports.MermaidDiagram=e.MermaidDiagram;exports.NodesRenderer=e.NodesRenderer;exports.ParagraphNode=e.ParagraphNode;exports.RichLinkCard=e.RichLinkCard;exports.StrongNode=e.StrongNode;exports.TableNode=e.TableNode;exports.TableOfContents=e.TableOfContents;exports.TextNode=e.TextNode;exports.ThematicBreakNode=e.ThematicBreakNode;exports.TwitterEmbedNode=e.TwitterEmbedNode;exports.YouTubeEmbedNode=e.YouTubeEmbedNode;exports.ZennDetailsNode=e.ZennDetailsNode;exports.ZennMessageNode=e.ZennMessageNode;exports.createIntentTweetLink=e.createIntentTweetLink;exports.extractHeadings=e.extractHeadings;exports.extractYouTubeVideoId=o.extractYouTubeVideoId;exports.fetchSiteMetadata=o.fetchSiteMetadata;exports.remarkBlockLink=o.remarkBlockLink;exports.remarkBlockLinkMetadata=o.remarkBlockLinkMetadata;exports.remarkCustomHeadingId=o.remarkCustomHeadingId;exports.remarkFootnoteBackLink=o.remarkFootnoteBackLink;exports.remarkHtmlAnchorToLink=o.remarkHtmlAnchorToLink;exports.remarkHtmlInHtml=o.remarkHtmlInHtml;exports.remarkImageSize=o.remarkImageSize;exports.remarkParentNode=o.remarkParentNode;exports.remarkTwitterEmbed=o.remarkTwitterEmbed;exports.remarkYouTubeEmbed=o.remarkYouTubeEmbed;exports.remarkZennMessage=o.remarkZennMessage;
 //# sourceMappingURL=index.cjs.map

package/dist/index.client.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./extractHeadings-LdKvrkA9.cjs"),o=require("./remark-zenn-message-B5yftsqg.cjs");exports.BlockLinkNode=e.BlockLinkNode;exports.BlockquoteNode=e.BlockquoteNode;exports.CodeNode=e.CodeNode;exports.DeleteNode=e.DeleteNode;exports.EmphasisNode=e.EmphasisNode;exports.FootnoteBackLinkNode=e.FootnoteBackLinkNode;exports.FootnoteReferenceNode=e.FootnoteReferenceNode;exports.FootnotesSection=e.FootnotesSection;exports.HeadingNode=e.HeadingNode;exports.ImageNode=e.ImageNode;exports.InlineCodeNode=e.InlineCodeNode;exports.LinkNode=e.LinkNode;exports.ListItemNode=e.ListItemNode;exports.ListNode=e.ListNode;exports.MarkdownRenderer=e.MarkdownRenderer;exports.MermaidDiagram=e.MermaidDiagram;exports.NodesRenderer=e.NodesRenderer;exports.ParagraphNode=e.ParagraphNode;exports.RichLinkCard=e.RichLinkCard;exports.StrongNode=e.StrongNode;exports.TableNode=e.TableNode;exports.TableOfContents=e.TableOfContents;exports.TextNode=e.TextNode;exports.ThematicBreakNode=e.ThematicBreakNode;exports.TwitterEmbedNode=e.TwitterEmbedNode;exports.YouTubeEmbedNode=e.YouTubeEmbedNode;exports.ZennDetailsNode=e.ZennDetailsNode;exports.ZennMessageNode=e.ZennMessageNode;exports.createIntentTweetLink=e.createIntentTweetLink;exports.extractHeadings=e.extractHeadings;exports.extractYouTubeVideoId=o.extractYouTubeVideoId;exports.fetchSiteMetadata=o.fetchSiteMetadata;exports.remarkBlockLink=o.remarkBlockLink;exports.remarkBlockLinkMetadata=o.remarkBlockLinkMetadata;exports.remarkCustomHeadingId=o.remarkCustomHeadingId;exports.remarkFootnoteBackLink=o.remarkFootnoteBackLink;exports.remarkHtmlAnchorToLink=o.remarkHtmlAnchorToLink;exports.remarkHtmlInHtml=o.remarkHtmlInHtml;exports.remarkImageSize=o.remarkImageSize;exports.remarkParentNode=o.remarkParentNode;exports.remarkTwitterEmbed=o.remarkTwitterEmbed;exports.remarkYouTubeEmbed=o.remarkYouTubeEmbed;exports.remarkZennMessage=o.remarkZennMessage;
+//# sourceMappingURL=index.client.cjs.map

package/dist/index.client.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.client.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/index.client.d.ts

@@ -0,0 +1,2 @@
+export * from './src/index.client'
+export {}

package/dist/index.client.js

@@ -0,0 +1,48 @@
+import { B as o, b as s, C as r, D as d, E as t, F as n, c as k, d as i, H as m, I as N, e as c, L as l, f as g, g as L, M as T, a as b, N as I, P as h, R as u, S as B, T as f, l as H, h as M, i as C, j as E, Y as x, Z as F, k as R, m as S, n as p } from "./extractHeadings-rFktacYX.js";
+import { e as D, f as Y, r as Z, a as P, b as j, c as q, d as z, g as A, h as O, i as V, j as v, k as y, l as G } from "./remark-zenn-message-B-AEffpD.js";
+export {
+  o as BlockLinkNode,
+  s as BlockquoteNode,
+  r as CodeNode,
+  d as DeleteNode,
+  t as EmphasisNode,
+  n as FootnoteBackLinkNode,
+  k as FootnoteReferenceNode,
+  i as FootnotesSection,
+  m as HeadingNode,
+  N as ImageNode,
+  c as InlineCodeNode,
+  l as LinkNode,
+  g as ListItemNode,
+  L as ListNode,
+  T as MarkdownRenderer,
+  b as MermaidDiagram,
+  I as NodesRenderer,
+  h as ParagraphNode,
+  u as RichLinkCard,
+  B as StrongNode,
+  f as TableNode,
+  H as TableOfContents,
+  M as TextNode,
+  C as ThematicBreakNode,
+  E as TwitterEmbedNode,
+  x as YouTubeEmbedNode,
+  F as ZennDetailsNode,
+  R as ZennMessageNode,
+  S as createIntentTweetLink,
+  p as extractHeadings,
+  D as extractYouTubeVideoId,
+  Y as fetchSiteMetadata,
+  Z as remarkBlockLink,
+  P as remarkBlockLinkMetadata,
+  j as remarkCustomHeadingId,
+  q as remarkFootnoteBackLink,
+  z as remarkHtmlAnchorToLink,
+  A as remarkHtmlInHtml,
+  O as remarkImageSize,
+  V as remarkParentNode,
+  v as remarkTwitterEmbed,
+  y as remarkYouTubeEmbed,
+  G as remarkZennMessage
+};
+//# sourceMappingURL=index.client.js.map

package/dist/index.client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.client.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/index.js

@@ -1,53 +1,48 @@
-import { bF as s, bG as o, bH as r, bI as d, bJ as t, bK as c, bL as n, bM as b, bO as i, bN as k, bP as m, bQ as N, bR as l, bS as L, bT as T, bU as g, bD as I, bV as M, bE as h, c4 as u, bW as B, bX as H, bY as E, bZ as F, b_ as R, b$ as f, c0 as p, c1 as w, c2 as D, c3 as S, c5 as C, c6 as U, c7 as Y, cn as Z, cm as v, c8 as x, c9 as A, ca as P, cb as y, cc as V, cd as j, ce as q, cf as z, cg as G, ch as J, ci as K, cj as O, ck as Q, cl as W } from "./index-caKpab-1.js";
+import { B as o, b as s, C as r, D as d, E as t, F as n, c as k, d as i, H as m, I as N, e as c, L as l, f as g, g as L, M as T, a as b, N as I, P as h, R as u, S as B, T as f, l as H, h as M, i as C, j as E, Y as x, Z as F, k as R, m as S, n as p } from "./extractHeadings-rFktacYX.js";
+import { e as D, f as Y, r as Z, a as P, b as j, c as q, d as z, g as A, h as O, i as V, j as v, k as y, l as G } from "./remark-zenn-message-B-AEffpD.js";
 export {
-  s as BlockLinkNode,
-  o as BlockquoteNode,
+  o as BlockLinkNode,
+  s as BlockquoteNode,
   r as CodeNode,
   d as DeleteNode,
   t as EmphasisNode,
-  c as FootnoteBackLinkNode,
-  n as FootnoteReferenceNode,
-  b as FootnotesSection,
-  i as HTMLNode,
-  k as HeadingNode,
-  m as ImageNode,
-  N as InlineCodeNode,
-  l as InlineMathNode,
-  L as LinkNode,
-  T as ListItemNode,
-  g as ListNode,
-  I as MarkdownRenderer,
-  M as MathNode,
-  h as MermaidDiagram,
-  u as NodesRenderer,
-  B as ParagraphNode,
-  H as RichLinkCard,
-  E as StrongNode,
-  F as TableNode,
-  R as TextNode,
-  f as ThematicBreakNode,
-  p as TwitterEmbedNode,
-  w as YouTubeEmbedNode,
-  D as ZennDetailsNode,
-  S as ZennMessageNode,
-  C as createIntentTweetLink,
-  U as extractYouTubeVideoId,
+  n as FootnoteBackLinkNode,
+  k as FootnoteReferenceNode,
+  i as FootnotesSection,
+  m as HeadingNode,
+  N as ImageNode,
+  c as InlineCodeNode,
+  l as LinkNode,
+  g as ListItemNode,
+  L as ListNode,
+  T as MarkdownRenderer,
+  b as MermaidDiagram,
+  I as NodesRenderer,
+  h as ParagraphNode,
+  u as RichLinkCard,
+  B as StrongNode,
+  f as TableNode,
+  H as TableOfContents,
+  M as TextNode,
+  C as ThematicBreakNode,
+  E as TwitterEmbedNode,
+  x as YouTubeEmbedNode,
+  F as ZennDetailsNode,
+  R as ZennMessageNode,
+  S as createIntentTweetLink,
+  p as extractHeadings,
+  D as extractYouTubeVideoId,
   Y as fetchSiteMetadata,
-  Z as getFaviconUrl,
-  v as parseMarkdown,
-  x as remarkBlockLink,
-  A as remarkBlockLinkMetadata,
-  P as remarkCustomHeadingId,
-  y as remarkFootnoteBackLink,
-  V as remarkHtmlAnchorToLink,
-  j as remarkHtmlInHtml,
-  q as remarkImageSize,
-  z as remarkImportDirective,
-  G as remarkParentNode,
-  J as remarkResolveUriAsync,
-  K as remarkTwitterEmbed,
-  O as remarkYouTubeEmbed,
-  Q as remarkZennMessage,
-  W as transformUriAsync
+  Z as remarkBlockLink,
+  P as remarkBlockLinkMetadata,
+  j as remarkCustomHeadingId,
+  q as remarkFootnoteBackLink,
+  z as remarkHtmlAnchorToLink,
+  A as remarkHtmlInHtml,
+  O as remarkImageSize,
+  V as remarkParentNode,
+  v as remarkTwitterEmbed,
+  y as remarkYouTubeEmbed,
+  G as remarkZennMessage
 };
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/index.server.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const E=require("node:fs/promises"),m=require("node:path"),h=require("unist-util-visit"),u=require("./remark-zenn-message-B5yftsqg.cjs"),N=require("cheerio"),R=require("url-join"),T=require("remark"),C=require("remark-breaks"),I=require("remark-frontmatter"),M=require("remark-gfm"),v=require("remark-math"),U=require("github-slugger");function $(e){const n=Object.create(null,{[Symbol.toStringTag]:{value:"Module"}});if(e){for(const r in e)if(r!=="default"){const t=Object.getOwnPropertyDescriptor(e,r);Object.defineProperty(n,r,t.get?t:{enumerable:!0,get:()=>e[r]})}}return n.default=e,Object.freeze(n)}const q=$(N),_=/<!--\s+@import\s+"(.+?)"\s+-->/;function b(e){return async n=>{const{markdownFilePath:r}=e,t=m.dirname(r),o=[];if(h.visit(n,"html",(s,i,a)=>{if(!a||typeof i!="number")return;const l=s.value.match(_);if(!l)return;const g=l[1],f=m.resolve(t,g);Array.isArray(a.children)&&o.push({parent:a,index:i,absolutePath:f})}),o.length===0)return;const c=await Promise.all(o.map(async({absolutePath:s})=>{try{const i=await E.readFile(s,"utf-8");return this.parse(i)}catch(i){return i&&i.code==="ENOENT"?u.Logger.warn(`[remark-import-directive] Import file not found: ${s}`):u.Logger.error(`[remark-import-directive] Error processing import: ${s}`,i),null}}));for(let s=o.length-1;s>=0;s--){const{parent:i,index:a}=o[s],l=c[s];l?.children&&Array.isArray(l.children)&&i.children.splice(a,1,...l.children)}}}const H=/^[a-z][a-z0-9+.-]*:/,k=async(e,n,r,t,o=!1)=>{if(!e)return"";if(H.test(e)){const g=e.substring(0,e.indexOf(":")).toLowerCase();if(["http","https","mailto","tel","file"].includes(g))return e}if(e.startsWith("#")||e.startsWith("/"))return e;const c=decodeURIComponent(e),s=m.dirname(r),i=m.normalize(m.join(s,c)),a=m.resolve(t,i);if(!a.startsWith(t)||i.startsWith(".."))return u.Logger.error(`Security Alert: Attempt to access file outside project root: ${a}`),"";if(o)try{await E.access(a)}catch{return u.Logger.warn(`File not found: ${a}`),""}const l=i.replace(/\\/g,"/");return n?R("/assets/",l):`?filePath=${encodeURIComponent(l)}`};function S(e){return async n=>{if(!(e?.markdownFilePath&&e?.workspaceRoot)){u.Logger.warn("remark-resolve-uri-async: markdownFilePath and workspaceRoot are required. Skipping URI resolution.");return}const r=[],t=[];h.visit(n,["image","link","html"],s=>{if(s.type==="html")t.push(s);else{const i=s;i.url&&r.push({node:i,isImage:i.type==="image"})}});const o=r.map(async({node:s,isImage:i})=>{const a=await k(s.url,i,e.markdownFilePath,e.workspaceRoot,e.validateExistence);s.url=a}),c=t.map(async s=>{const i=q.load(s.value,null,!1);let a=!1;const l=i("img").toArray();for(const f of l){const d=i(f).attr("src");if(d){const p=await k(d,!0,e.markdownFilePath,e.workspaceRoot,e.validateExistence);p!==d&&(i(f).attr("src",p),a=!0)}}const g=i("a").toArray();for(const f of g){const d=i(f).attr("href");if(d){const p=await k(d,!1,e.markdownFilePath,e.workspaceRoot,e.validateExistence);p!==d&&(i(f).attr("href",p),a=!0)}}if(a){const f=i.html();f&&(s.value=f)}});await Promise.all([...o,...c])}}const L=()=>e=>{const n=new U;h.visit(e,"heading",r=>{const t=r;if(t.data?.hProperties?.id){n.slug(t.data.hProperties.id);return}const o=u.extractHeadingPlainText(r.children),c=n.slug(o);t.data||(t.data={}),t.data.hProperties||(t.data.hProperties={}),t.data.hProperties.id=c})},O=e=>{const n=[];let r="",t=0;const o=c=>{c.length!==0&&n.push({type:"text",value:c})};for(;t<e.length;){const c=e[t];if(c==="\\"&&t+2<e.length&&e[t+1]==="="&&e[t+2]==="="){r+="==",t+=3;continue}if(!(c==="="&&t+1<e.length&&e[t+1]==="=")){r+=c,t+=1;continue}let s=0;for(;t+s<e.length&&e[t+s]==="=";)s+=1;if(s%2===1){r+="=",t+=1;continue}let i=t+2,a=!1;for(;i<e.length-1;){if(e[i]==="\\"&&i+2<e.length&&e[i+1]==="="&&e[i+2]==="="){i+=3;continue}if(e[i]==="="&&e[i+1]==="="){a=!0;break}i+=1}if(!a){r+="==",t+=2;continue}const l=e.slice(t+2,i);if(l.length===0){r+="====",t=i+2;continue}o(r),r="",n.push({type:"mark",children:[{type:"text",value:l}]}),t=i+2}return o(r),n},j=()=>e=>{h.visit(e,"text",(n,r,t)=>{if(!t||r===void 0||!n.value.includes("=="))return;const o=O(n.value);o.length===1&&o[0].type==="text"&&o[0].value===n.value||t.children.splice(r,1,...o)})},F=/\\([ \\!"#$%&'()*+,./:;<=>?@[\]^_`{|}~-])/g,D=/(^|[^\\])(\\\\)*\s/,z=e=>{const n=[];let r="",t=0;const o=c=>{c.length!==0&&n.push({type:"text",value:c})};for(;t<e.length;){const c=e[t];if(c==="\\"&&t+1<e.length&&e[t+1]==="~"){r+="~",t+=2;continue}if(c!=="~"){r+=c,t+=1;continue}if(t+1<e.length&&e[t+1]==="~"){r+="~~",t+=2;continue}let s=t+1,i=!1;for(;s<e.length;){if(e[s]==="\\"&&s+1<e.length){s+=2;continue}if(e[s]==="~"){if(s+1<e.length&&e[s+1]==="~"){s+=2;continue}i=!0;break}s+=1}if(!i){r+="~",t+=1;continue}const a=e.slice(t+1,s);if(a.length===0){r+="~~",t=s+1;continue}if(D.test(a)){r+="~",t+=1;continue}o(r),r="",n.push({type:"subscript",children:[{type:"text",value:a.replace(F,"$1")}]}),t=s+1}return o(r),n},B=()=>e=>{h.visit(e,"text",(n,r,t)=>{if(!t||r===void 0||!n.value.includes("~"))return;const o=z(n.value);o.length===1&&o[0].type==="text"&&o[0].value===n.value||t.children.splice(r,1,...o)})},W=/\\([ \\!"#$%&'()*+,./:;<=>?@[\]^_`{|}~-])/g,G=/(^|[^\\])(\\\\)*\s/,V=e=>{const n=[];let r="",t=0;const o=c=>{c.length!==0&&n.push({type:"text",value:c})};for(;t<e.length;){const c=e[t];if(c==="\\"&&t+1<e.length&&e[t+1]==="^"){r+="^",t+=2;continue}if(c!=="^"){r+=c,t+=1;continue}let s=t+1,i=!1;for(;s<e.length;){if(e[s]==="\\"&&s+1<e.length){s+=2;continue}if(e[s]==="^"){i=!0;break}s+=1}if(!i){r+="^",t+=1;continue}const a=e.slice(t+1,s);if(a.length===0){r+="^^",t=s+1;continue}if(G.test(a)){r+="^",t+=1;continue}o(r),r="",n.push({type:"superscript",children:[{type:"text",value:a.replace(W,"$1")}]}),t=s+1}return o(r),n},Z=()=>e=>{h.visit(e,"text",(n,r,t)=>{if(!t||r===void 0||!n.value.includes("^"))return;const o=V(n.value);o.length===1&&o[0].type==="text"&&o[0].value===n.value||t.children.splice(r,1,...o)})},J=e=>e.children.map(n=>n.type==="text"?n.value:"").join(""),x=e=>{const n=J(e).trim();return n===">"?">":n==="^"?"^":null},K=e=>e.data??{},y=e=>{const n=K(e);return n.hProperties||(n.hProperties={}),e.data||(e.data=n),n.hProperties},A=e=>{const n=y(e);n.merged=!0},X=e=>{const n=y(e);n.colSpan=(n.colSpan??1)+1},Y=e=>{const n=y(e);n.rowSpan=(n.rowSpan??1)+1},Q=(e,n)=>{for(let r=n+1;r<e.children.length;r+=1){const t=e.children[r];if(t&&x(t)===null)return t}return null},ee=(e,n)=>{const r=[];for(const t of e){const o=[];for(let c=t.children.length-1;c>=0;c-=1){const s=t.children[c];if(!s||x(s)!==">"){o[c]=s??null;continue}const i=Q(t,c);if(!i){o[c]=s;continue}X(i),A(s);const a=y(i),l=n?.[c]??void 0;l&&(a.textAlign=l),o[c]=i}r.push(o)}return r},te=(e,n)=>{for(let r=0;r<e.length;r+=1){const t=e[r];for(let o=0;o<t.children.length;o+=1){const c=t.children[o];if(!c||x(c)!=="^")continue;const s=r>0?n[r-1]?.[o]??null:null;s&&(Y(s),A(c),n[r]&&(n[r][o]=s))}}},re=()=>e=>{h.visit(e,"table",n=>{const r=n.children,t=ee(r,n.align);te(r,t)})},ne=["address","article","aside","blockquote","details","dialog","dd","div","dl","dt","fieldset","figcaption","figure","footer","form","header","hgroup","main","nav","ol","pre","section","table","ul"],P=e=>{const n=e.match(/^\s*<([a-z0-9-]+)([^>]*)>\s*$/i);if(!n)return null;const r=n[1].toLowerCase();if(!ne.includes(r))return null;const t={},o=n[2],c=/([a-z0-9:-]+)(?:=(?:"([^"]*)"|'([^']*)'|([^\s>]+)))?/gi;let s;for(;(s=c.exec(o))!==null;){const i=s[1],a=s[2]??s[3]??s[4]??"";t[i]=a}return{tagName:r,attributes:t}},se=(e,n)=>new RegExp(`^\\s*<\\/\\s*${n}\\s*>\\s*$`,"i").test(e),w=e=>{const n=[];let r=0;for(;r<e.length;){const t=e[r];if(t.type==="html"){const o=P(t.value);if(o){let c=r+1,s=1,i=-1;for(;c<e.length;){const a=e[c];if(a.type==="html"){const l=P(a.value);if(l&&l.tagName===o.tagName)s++;else if(se(a.value,o.tagName)&&(s--,s===0)){i=c;break}}c++}if(i!==-1){const a=e.slice(r+1,i),l=w(a);n.push({type:"html-block-container",data:{tagName:o.tagName,properties:o.attributes},children:l}),r=i+1;continue}}}"children"in t&&Array.isArray(t.children)&&(t.children=w(t.children)),n.push(t),r++}return n},ie=()=>e=>{e.children&&(e.children=w(e.children))},oe=async(e,n,r)=>{const t=T.remark().use(u.remarkHtmlInHtml).use(ie).use(u.remarkHtmlAnchorToLink).use(u.remarkParentNode).use(u.remarkFootnoteBackLink).use(I).use(C).use(u.remarkImageSize).use(u.remarkZennMessage).use(v).use(b,{markdownFilePath:n}).use(u.remarkTwitterEmbed).use(u.remarkYouTubeEmbed).use(u.remarkBlockLink).use(u.remarkBlockLinkMetadata).use(u.remarkCustomHeadingId).use(L).use(M,{singleTilde:!1}).use(re).use(Z).use(B).use(j).use(S,{markdownFilePath:n,workspaceRoot:r,validateExistence:!0}),o=t.parse(e);return await t.run(o)};exports.parseMarkdown=oe;exports.remarkImportDirective=b;exports.remarkResolveUriAsync=S;exports.transformUriAsync=k;
+//# sourceMappingURL=index.server.cjs.map