@kong-ui-public/documentation 0.7.83 → 0.7.84

package/dist/{graph-BDwITe7N-Dg4ZhErV.js → graph-C5siWsaJ-djbzUgq8.js}

@@ -1,11 +1,11 @@
-import { m as D, S as j, L as d, $ as l, E as p, v as u, x as g, R as m, M as F } from "./_baseUniq-Cede_3wW-BVX848YU.js";
-import { k as M, n as f, o as b, q as O, r as C } from "./index-D1jNpyAG.js";
-var P = M(function(o) {
-  return D(j(o, 1, O, !0));
-}), y = "\0", a = "\0", L = "
";
-class w {
+import { k as L, n as g, o as v, q as E, r as b } from "./index-BXFfc1qh.js";
+import { L as N, _ as j, $ as _, S as p, I as a, P as l, E as m, v as P } from "./_baseUniq-CXqhI00C-BfnSCqya.js";
+var D = L(function(o) {
+  return N(j(o, 1, E, !0));
+}), F = "\0", d = "\0", C = "
";
+class y {
   constructor(t = {}) {
-    this._isDirected = d(t, "directed") ? t.directed : !0, this._isMultigraph = d(t, "multigraph") ? t.multigraph : !1, this._isCompound = d(t, "compound") ? t.compound : !1, this._label = void 0, this._defaultNodeLabelFn = f(void 0), this._defaultEdgeLabelFn = f(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[a] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
+    this._isDirected = Object.prototype.hasOwnProperty.call(t, "directed") ? t.directed : !0, this._isMultigraph = Object.prototype.hasOwnProperty.call(t, "multigraph") ? t.multigraph : !1, this._isCompound = Object.prototype.hasOwnProperty.call(t, "compound") ? t.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[d] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
   }
   /* === Graph functions ========= */
   isDirected() {
@@ -25,61 +25,58 @@ class w {
   }
   /* === Node functions ========== */
   setDefaultNodeLabel(t) {
-    return b(t) || (t = f(t)), this._defaultNodeLabelFn = t, this;
+    return v(t) || (t = g(t)), this._defaultNodeLabelFn = t, this;
   }
   nodeCount() {
     return this._nodeCount;
   }
   nodes() {
-    return l(this._nodes);
+    return _(this._nodes);
   }
   sources() {
     var t = this;
     return p(this.nodes(), function(e) {
-      return C(t._in[e]);
+      return b(t._in[e]);
     });
   }
   sinks() {
     var t = this;
     return p(this.nodes(), function(e) {
-      return C(t._out[e]);
+      return b(t._out[e]);
     });
   }
   setNodes(t, e) {
     var s = arguments, i = this;
-    return u(t, function(r) {
+    return a(t, function(r) {
       s.length > 1 ? i.setNode(r, e) : i.setNode(r);
     }), this;
   }
   setNode(t, e) {
-    return d(this._nodes, t) ? (arguments.length > 1 && (this._nodes[t] = e), this) : (this._nodes[t] = arguments.length > 1 ? e : this._defaultNodeLabelFn(t), this._isCompound && (this._parent[t] = a, this._children[t] = {}, this._children[a][t] = !0), this._in[t] = {}, this._preds[t] = {}, this._out[t] = {}, this._sucs[t] = {}, ++this._nodeCount, this);
+    return Object.prototype.hasOwnProperty.call(this._nodes, t) ? (arguments.length > 1 && (this._nodes[t] = e), this) : (this._nodes[t] = arguments.length > 1 ? e : this._defaultNodeLabelFn(t), this._isCompound && (this._parent[t] = d, this._children[t] = {}, this._children[d][t] = !0), this._in[t] = {}, this._preds[t] = {}, this._out[t] = {}, this._sucs[t] = {}, ++this._nodeCount, this);
   }
   node(t) {
     return this._nodes[t];
   }
   hasNode(t) {
-    return d(this._nodes, t);
+    return Object.prototype.hasOwnProperty.call(this._nodes, t);
   }
   removeNode(t) {
-    var e = this;
-    if (d(this._nodes, t)) {
-      var s = function(i) {
-        e.removeEdge(e._edgeObjs[i]);
-      };
-      delete this._nodes[t], this._isCompound && (this._removeFromParentsChildList(t), delete this._parent[t], u(this.children(t), function(i) {
-        e.setParent(i);
-      }), delete this._children[t]), u(l(this._in[t]), s), delete this._in[t], delete this._preds[t], u(l(this._out[t]), s), delete this._out[t], delete this._sucs[t], --this._nodeCount;
+    if (Object.prototype.hasOwnProperty.call(this._nodes, t)) {
+      var e = (s) => this.removeEdge(this._edgeObjs[s]);
+      delete this._nodes[t], this._isCompound && (this._removeFromParentsChildList(t), delete this._parent[t], a(this.children(t), (s) => {
+        this.setParent(s);
+      }), delete this._children[t]), a(_(this._in[t]), e), delete this._in[t], delete this._preds[t], a(_(this._out[t]), e), delete this._out[t], delete this._sucs[t], --this._nodeCount;
     }
     return this;
   }
   setParent(t, e) {
     if (!this._isCompound)
       throw new Error("Cannot set parent in a non-compound graph");
-    if (g(e))
-      e = a;
+    if (l(e))
+      e = d;
     else {
       e += "";
-      for (var s = e; !g(s); s = this.parent(s))
+      for (var s = e; !l(s); s = this.parent(s))
         if (s === t)
           throw new Error("Setting " + e + " as parent of " + t + " would create a cycle");
       this.setNode(e);
@@ -92,17 +89,17 @@ class w {
   parent(t) {
     if (this._isCompound) {
       var e = this._parent[t];
-      if (e !== a)
+      if (e !== d)
         return e;
     }
   }
   children(t) {
-    if (g(t) && (t = a), this._isCompound) {
+    if (l(t) && (t = d), this._isCompound) {
       var e = this._children[t];
       if (e)
-        return l(e);
+        return _(e);
     } else {
-      if (t === a)
+      if (t === d)
         return this.nodes();
       if (this.hasNode(t))
         return [];
@@ -111,17 +108,17 @@ class w {
   predecessors(t) {
     var e = this._preds[t];
     if (e)
-      return l(e);
+      return _(e);
   }
   successors(t) {
     var e = this._sucs[t];
     if (e)
-      return l(e);
+      return _(e);
   }
   neighbors(t) {
     var e = this.predecessors(t);
     if (e)
-      return P(e, this.successors(t));
+      return D(e, this.successors(t));
   }
   isLeaf(t) {
     var e;
@@ -135,9 +132,9 @@ class w {
     });
     e.setGraph(this.graph());
     var s = this;
-    u(this._nodes, function(n, h) {
+    a(this._nodes, function(n, h) {
       t(h) && e.setNode(h, n);
-    }), u(this._edgeObjs, function(n) {
+    }), a(this._edgeObjs, function(n) {
       e.hasNode(n.v) && e.hasNode(n.w) && e.setEdge(n, s.edge(n));
     });
     var i = {};
@@ -145,13 +142,13 @@ class w {
       var h = s.parent(n);
       return h === void 0 || e.hasNode(h) ? (i[n] = h, h) : h in i ? i[h] : r(h);
     }
-    return this._isCompound && u(e.nodes(), function(n) {
+    return this._isCompound && a(e.nodes(), function(n) {
       e.setParent(n, r(n));
     }), e;
   }
   /* === Edge functions ========== */
   setDefaultEdgeLabel(t) {
-    return b(t) || (t = f(t)), this._defaultEdgeLabelFn = t, this;
+    return v(t) || (t = g(t)), this._defaultEdgeLabelFn = t, this;
   }
   edgeCount() {
     return this._edgeCount;
@@ -161,7 +158,7 @@ class w {
   }
   setPath(t, e) {
     var s = this, i = arguments;
-    return F(t, function(r, n) {
+    return P(t, function(r, n) {
       return i.length > 1 ? s.setEdge(r, n, e) : s.setEdge(r, n), n;
     }), this;
   }
@@ -171,27 +168,27 @@ class w {
    */
   setEdge() {
     var t, e, s, i, r = !1, n = arguments[0];
-    typeof n == "object" && n !== null && "v" in n ? (t = n.v, e = n.w, s = n.name, arguments.length === 2 && (i = arguments[1], r = !0)) : (t = n, e = arguments[1], s = arguments[3], arguments.length > 2 && (i = arguments[2], r = !0)), t = "" + t, e = "" + e, g(s) || (s = "" + s);
+    typeof n == "object" && n !== null && "v" in n ? (t = n.v, e = n.w, s = n.name, arguments.length === 2 && (i = arguments[1], r = !0)) : (t = n, e = arguments[1], s = arguments[3], arguments.length > 2 && (i = arguments[2], r = !0)), t = "" + t, e = "" + e, l(s) || (s = "" + s);
     var h = c(this._isDirected, t, e, s);
-    if (d(this._edgeLabels, h))
+    if (Object.prototype.hasOwnProperty.call(this._edgeLabels, h))
       return r && (this._edgeLabels[h] = i), this;
-    if (!g(s) && !this._isMultigraph)
+    if (!l(s) && !this._isMultigraph)
       throw new Error("Cannot set a named edge when isMultigraph = false");
     this.setNode(t), this.setNode(e), this._edgeLabels[h] = r ? i : this._defaultEdgeLabelFn(t, e, s);
-    var _ = k(this._isDirected, t, e, s);
-    return t = _.v, e = _.w, Object.freeze(_), this._edgeObjs[h] = _, E(this._preds[e], t), E(this._sucs[t], e), this._in[e][h] = _, this._out[t][h] = _, this._edgeCount++, this;
+    var u = M(this._isDirected, t, e, s);
+    return t = u.v, e = u.w, Object.freeze(u), this._edgeObjs[h] = u, O(this._preds[e], t), O(this._sucs[t], e), this._in[e][h] = u, this._out[t][h] = u, this._edgeCount++, this;
   }
   edge(t, e, s) {
-    var i = arguments.length === 1 ? v(this._isDirected, arguments[0]) : c(this._isDirected, t, e, s);
+    var i = arguments.length === 1 ? f(this._isDirected, arguments[0]) : c(this._isDirected, t, e, s);
     return this._edgeLabels[i];
   }
   hasEdge(t, e, s) {
-    var i = arguments.length === 1 ? v(this._isDirected, arguments[0]) : c(this._isDirected, t, e, s);
-    return d(this._edgeLabels, i);
+    var i = arguments.length === 1 ? f(this._isDirected, arguments[0]) : c(this._isDirected, t, e, s);
+    return Object.prototype.hasOwnProperty.call(this._edgeLabels, i);
   }
   removeEdge(t, e, s) {
-    var i = arguments.length === 1 ? v(this._isDirected, arguments[0]) : c(this._isDirected, t, e, s), r = this._edgeObjs[i];
-    return r && (t = r.v, e = r.w, delete this._edgeLabels[i], delete this._edgeObjs[i], N(this._preds[e], t), N(this._sucs[t], e), delete this._in[e][i], delete this._out[t][i], this._edgeCount--), this;
+    var i = arguments.length === 1 ? f(this._isDirected, arguments[0]) : c(this._isDirected, t, e, s), r = this._edgeObjs[i];
+    return r && (t = r.v, e = r.w, delete this._edgeLabels[i], delete this._edgeObjs[i], w(this._preds[e], t), w(this._sucs[t], e), delete this._in[e][i], delete this._out[t][i], this._edgeCount--), this;
   }
   inEdges(t, e) {
     var s = this._in[t];
@@ -217,12 +214,12 @@ class w {
       return s.concat(this.outEdges(t, e));
   }
 }
-w.prototype._nodeCount = 0;
-w.prototype._edgeCount = 0;
-function E(o, t) {
+y.prototype._nodeCount = 0;
+y.prototype._edgeCount = 0;
+function O(o, t) {
   o[t] ? o[t]++ : o[t] = 1;
 }
-function N(o, t) {
+function w(o, t) {
   --o[t] || delete o[t];
 }
 function c(o, t, e, s) {
@@ -231,9 +228,9 @@ function c(o, t, e, s) {
     var n = i;
     i = r, r = n;
   }
-  return i + L + r + L + (g(s) ? y : s);
+  return i + C + r + C + (l(s) ? F : s);
 }
-function k(o, t, e, s) {
+function M(o, t, e, s) {
   var i = "" + t, r = "" + e;
   if (!o && i > r) {
     var n = i;
@@ -242,9 +239,9 @@ function k(o, t, e, s) {
   var h = { v: i, w: r };
   return s && (h.name = s), h;
 }
-function v(o, t) {
+function f(o, t) {
   return c(o, t.v, t.w, t.name);
 }
 export {
-  w as D
+  y as L
 };