@sourcegraph/amp 0.0.1749585689-g82b91d → 0.0.1749600114-g5c00b8

package/dist/chunk-EOAU2GW5-CpRNAcjo.js

@@ -0,0 +1,253 @@
+#!/usr/bin/env node
+import { y as _, k as c, f as a, i as l, A as j, v as m, o as L } from "./chunk-TGZYFRKZ-BYBLXoJz.js";
+import { _ as o, bs as g, bt as O, bu as y } from "./console-CoE5Qzyz.js";
+var P = "\0", u = "\0", v = "
", C = class {
+  static {
+    o(this, "Graph");
+  }
+  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 = g(void 0), this._defaultEdgeLabelFn = g(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 = {};
+  }
+  /* === Graph functions ========= */
+  isDirected() {
+    return this._isDirected;
+  }
+  isMultigraph() {
+    return this._isMultigraph;
+  }
+  isCompound() {
+    return this._isCompound;
+  }
+  setGraph(e) {
+    return this._label = e, this;
+  }
+  graph() {
+    return this._label;
+  }
+  /* === Node functions ========== */
+  setDefaultNodeLabel(e) {
+    return O(e) || (e = g(e)), this._defaultNodeLabelFn = e, this;
+  }
+  nodeCount() {
+    return this._nodeCount;
+  }
+  nodes() {
+    return _(this._nodes);
+  }
+  sources() {
+    var e = this;
+    return c(this.nodes(), function(t) {
+      return y(e._in[t]);
+    });
+  }
+  sinks() {
+    var e = this;
+    return c(this.nodes(), function(t) {
+      return y(e._out[t]);
+    });
+  }
+  setNodes(e, t) {
+    var s = arguments, i = this;
+    return a(e, function(n) {
+      s.length > 1 ? i.setNode(n, t) : i.setNode(n);
+    }), 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 = /* @__PURE__ */ o((s) => this.removeEdge(this._edgeObjs[s]), "removeEdge");
+      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], a(this.children(e), (s) => {
+        this.setParent(s);
+      }), delete this._children[e]), a(_(this._in[e]), t), delete this._in[e], delete this._preds[e], a(_(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 (l(t))
+      t = u;
+    else {
+      t += "";
+      for (var s = t; !l(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 (l(e) && (e = u), this._isCompound) {
+      var t = this._children[e];
+      if (t)
+        return _(t);
+    } else {
+      if (e === u)
+        return this.nodes();
+      if (this.hasNode(e))
+        return [];
+    }
+  }
+  predecessors(e) {
+    var t = this._preds[e];
+    if (t)
+      return _(t);
+  }
+  successors(e) {
+    var t = this._sucs[e];
+    if (t)
+      return _(t);
+  }
+  neighbors(e) {
+    var t = this.predecessors(e);
+    if (t)
+      return j(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;
+    a(this._nodes, function(r, h) {
+      e(h) && t.setNode(h, r);
+    }), a(this._edgeObjs, function(r) {
+      t.hasNode(r.v) && t.hasNode(r.w) && t.setEdge(r, s.edge(r));
+    });
+    var i = {};
+    function n(r) {
+      var h = s.parent(r);
+      return h === void 0 || t.hasNode(h) ? (i[r] = h, h) : h in i ? i[h] : n(h);
+    }
+    return o(n, "findParent"), this._isCompound && a(t.nodes(), function(r) {
+      t.setParent(r, n(r));
+    }), t;
+  }
+  /* === Edge functions ========== */
+  setDefaultEdgeLabel(e) {
+    return O(e) || (e = g(e)), this._defaultEdgeLabelFn = e, this;
+  }
+  edgeCount() {
+    return this._edgeCount;
+  }
+  edges() {
+    return m(this._edgeObjs);
+  }
+  setPath(e, t) {
+    var s = this, i = arguments;
+    return L(e, function(n, r) {
+      return i.length > 1 ? s.setEdge(n, r, t) : s.setEdge(n, r), r;
+    }), this;
+  }
+  /*
+   * setEdge(v, w, [value, [name]])
+   * setEdge({ v, w, [name] }, [value])
+   */
+  setEdge() {
+    var e, t, s, i, n = !1, r = arguments[0];
+    typeof r == "object" && r !== null && "v" in r ? (e = r.v, t = r.w, s = r.name, arguments.length === 2 && (i = arguments[1], n = !0)) : (e = r, t = arguments[1], s = arguments[3], arguments.length > 2 && (i = arguments[2], n = !0)), e = "" + e, t = "" + t, l(s) || (s = "" + s);
+    var h = f(this._isDirected, e, t, s);
+    if (Object.prototype.hasOwnProperty.call(this._edgeLabels, h))
+      return n && (this._edgeLabels[h] = i), this;
+    if (!l(s) && !this._isMultigraph)
+      throw new Error("Cannot set a named edge when isMultigraph = false");
+    this.setNode(e), this.setNode(t), this._edgeLabels[h] = n ? i : this._defaultEdgeLabelFn(e, t, s);
+    var d = N(this._isDirected, e, t, s);
+    return e = d.v, t = d.w, Object.freeze(d), this._edgeObjs[h] = d, b(this._preds[t], e), b(this._sucs[e], t), this._in[t][h] = d, this._out[e][h] = d, this._edgeCount++, this;
+  }
+  edge(e, t, s) {
+    var i = arguments.length === 1 ? p(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s);
+    return this._edgeLabels[i];
+  }
+  hasEdge(e, t, s) {
+    var i = arguments.length === 1 ? p(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s);
+    return Object.prototype.hasOwnProperty.call(this._edgeLabels, i);
+  }
+  removeEdge(e, t, s) {
+    var i = arguments.length === 1 ? p(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s), n = this._edgeObjs[i];
+    return n && (e = n.v, t = n.w, delete this._edgeLabels[i], delete this._edgeObjs[i], E(this._preds[t], e), E(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 = m(s);
+      return t ? c(i, function(n) {
+        return n.v === t;
+      }) : i;
+    }
+  }
+  outEdges(e, t) {
+    var s = this._out[e];
+    if (s) {
+      var i = m(s);
+      return t ? c(i, function(n) {
+        return n.w === t;
+      }) : i;
+    }
+  }
+  nodeEdges(e, t) {
+    var s = this.inEdges(e, t);
+    if (s)
+      return s.concat(this.outEdges(e, t));
+  }
+};
+C.prototype._nodeCount = 0;
+C.prototype._edgeCount = 0;
+function b(e, t) {
+  e[t] ? e[t]++ : e[t] = 1;
+}
+o(b, "incrementOrInitEntry");
+function E(e, t) {
+  --e[t] || delete e[t];
+}
+o(E, "decrementOrRemoveEntry");
+function f(e, t, s, i) {
+  var n = "" + t, r = "" + s;
+  if (!e && n > r) {
+    var h = n;
+    n = r, r = h;
+  }
+  return n + v + r + v + (l(i) ? P : i);
+}
+o(f, "edgeArgsToId");
+function N(e, t, s, i) {
+  var n = "" + t, r = "" + s;
+  if (!e && n > r) {
+    var h = n;
+    n = r, r = h;
+  }
+  var d = { v: n, w: r };
+  return i && (d.name = i), d;
+}
+o(N, "edgeArgsToObj");
+function p(e, t) {
+  return f(e, t.v, t.w, t.name);
+}
+o(p, "edgeObjToId");
+export {
+  C as G
+};