@ucap-llm/ai-ui 1.1.13 → 1.1.15

package/{graph-e71f0e3e.mjs → graph-9e073c5f.mjs}

@@ -1,5 +1,5 @@
-import { az as N, aA as j, aB as f, aC as b, aD as _, aE as E } from "./index-f83d4b07.mjs";
-import { a as v, c as P, f as g, d, i as l, v as p, r as D } from "./_baseUniq-2bcae05e.mjs";
+import { cP as N, cQ as j, cR as f, cS as b, cT as _, cU as E } from "./index-433e2395.mjs";
+import { a as v, c as P, f as g, d, i as l, v as p, r as D } from "./_baseUniq-8cd7fbc4.mjs";
 var w = N(function(o) {
   return v(P(o, 1, j, !0));
 });
@@ -177,8 +177,8 @@ class L {
     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] = r ? i : this._defaultEdgeLabelFn(e, t, s);
-    var u = A(this._isDirected, e, t, s);
-    return e = u.v, t = u.w, Object.freeze(u), this._edgeObjs[h] = u, C(this._preds[t], e), C(this._sucs[e], t), this._in[t][h] = u, this._out[e][h] = u, this._edgeCount++, this;
+    var u = G(this._isDirected, e, t, s);
+    return e = u.v, t = u.w, Object.freeze(u), this._edgeObjs[h] = u, y(this._preds[t], e), y(this._sucs[e], t), this._in[t][h] = u, this._out[e][h] = u, this._edgeCount++, this;
   }
   edge(e, t, s) {
     var i = arguments.length === 1 ? m(this._isDirected, arguments[0]) : c(this._isDirected, e, t, s);
@@ -190,7 +190,7 @@ class L {
   }
   removeEdge(e, t, s) {
     var i = arguments.length === 1 ? m(this._isDirected, arguments[0]) : c(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], y(this._preds[t], e), y(this._sucs[e], t), delete this._in[t][i], delete this._out[e][i], this._edgeCount--), this;
+    return r && (e = r.v, t = r.w, delete this._edgeLabels[i], delete this._edgeObjs[i], C(this._preds[t], e), C(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];
@@ -218,10 +218,10 @@ class L {
 }
 L.prototype._nodeCount = 0;
 L.prototype._edgeCount = 0;
-function C(o, e) {
+function y(o, e) {
   o[e] ? o[e]++ : o[e] = 1;
 }
-function y(o, e) {
+function C(o, e) {
   --o[e] || delete o[e];
 }
 function c(o, e, t, s) {
@@ -232,7 +232,7 @@ function c(o, e, t, s) {
   }
   return i + O + r + O + (l(s) ? M : s);
 }
-function A(o, e, t, s) {
+function G(o, e, t, s) {
   var i = "" + e, r = "" + t;
   if (!o && i > r) {
     var n = i;

package/graph-DOmtxVvg-727f4e14.mjs

@@ -0,0 +1,247 @@
+import { an as y, az as g, b0 as v, b1 as N, b2 as b } from "./index-433e2395.mjs";
+import { I as L, O as j, d as _, _ as p, $ as d, E as l, S as f, P } from "./_baseUniq-DPnX6tpB-5eb6efbd.mjs";
+var D = y(function(o) {
+  return L(j(o, 1, N, !0));
+}), F = "\0", a = "\0", C = "
";
+class E {
+  constructor(t = {}) {
+    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[a] = {}), 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(t) {
+    return this._label = t, this;
+  }
+  graph() {
+    return this._label;
+  }
+  /* === Node functions ========== */
+  setDefaultNodeLabel(t) {
+    return v(t) || (t = g(t)), this._defaultNodeLabelFn = t, this;
+  }
+  nodeCount() {
+    return this._nodeCount;
+  }
+  nodes() {
+    return _(this._nodes);
+  }
+  sources() {
+    var t = this;
+    return p(this.nodes(), function(e) {
+      return b(t._in[e]);
+    });
+  }
+  sinks() {
+    var t = this;
+    return p(this.nodes(), function(e) {
+      return b(t._out[e]);
+    });
+  }
+  setNodes(t, e) {
+    var s = arguments, i = this;
+    return d(t, function(r) {
+      s.length > 1 ? i.setNode(r, e) : i.setNode(r);
+    }), this;
+  }
+  setNode(t, e) {
+    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] = a, this._children[t] = {}, this._children[a][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 Object.prototype.hasOwnProperty.call(this._nodes, t);
+  }
+  removeNode(t) {
+    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], d(this.children(t), (s) => {
+        this.setParent(s);
+      }), delete this._children[t]), d(_(this._in[t]), e), delete this._in[t], delete this._preds[t], d(_(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 (l(e))
+      e = a;
+    else {
+      e += "";
+      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);
+    }
+    return this.setNode(t), this._removeFromParentsChildList(t), this._parent[t] = e, this._children[e][t] = !0, this;
+  }
+  _removeFromParentsChildList(t) {
+    delete this._children[this._parent[t]][t];
+  }
+  parent(t) {
+    if (this._isCompound) {
+      var e = this._parent[t];
+      if (e !== a)
+        return e;
+    }
+  }
+  children(t) {
+    if (l(t) && (t = a), this._isCompound) {
+      var e = this._children[t];
+      if (e)
+        return _(e);
+    } else {
+      if (t === a)
+        return this.nodes();
+      if (this.hasNode(t))
+        return [];
+    }
+  }
+  predecessors(t) {
+    var e = this._preds[t];
+    if (e)
+      return _(e);
+  }
+  successors(t) {
+    var e = this._sucs[t];
+    if (e)
+      return _(e);
+  }
+  neighbors(t) {
+    var e = this.predecessors(t);
+    if (e)
+      return D(e, this.successors(t));
+  }
+  isLeaf(t) {
+    var e;
+    return this.isDirected() ? e = this.successors(t) : e = this.neighbors(t), e.length === 0;
+  }
+  filterNodes(t) {
+    var e = new this.constructor({
+      directed: this._isDirected,
+      multigraph: this._isMultigraph,
+      compound: this._isCompound
+    });
+    e.setGraph(this.graph());
+    var s = this;
+    d(this._nodes, function(n, h) {
+      t(h) && e.setNode(h, n);
+    }), d(this._edgeObjs, function(n) {
+      e.hasNode(n.v) && e.hasNode(n.w) && e.setEdge(n, s.edge(n));
+    });
+    var i = {};
+    function r(n) {
+      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 && d(e.nodes(), function(n) {
+      e.setParent(n, r(n));
+    }), e;
+  }
+  /* === Edge functions ========== */
+  setDefaultEdgeLabel(t) {
+    return v(t) || (t = g(t)), this._defaultEdgeLabelFn = t, this;
+  }
+  edgeCount() {
+    return this._edgeCount;
+  }
+  edges() {
+    return f(this._edgeObjs);
+  }
+  setPath(t, e) {
+    var s = this, i = arguments;
+    return P(t, function(r, n) {
+      return i.length > 1 ? s.setEdge(r, n, e) : s.setEdge(r, n), n;
+    }), this;
+  }
+  /*
+   * setEdge(v, w, [value, [name]])
+   * setEdge({ v, w, [name] }, [value])
+   */
+  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, l(s) || (s = "" + s);
+    var h = c(this._isDirected, t, e, s);
+    if (Object.prototype.hasOwnProperty.call(this._edgeLabels, h))
+      return r && (this._edgeLabels[h] = i), this;
+    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 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 ? m(this._isDirected, arguments[0]) : c(this._isDirected, t, e, s);
+    return this._edgeLabels[i];
+  }
+  hasEdge(t, e, s) {
+    var i = arguments.length === 1 ? m(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 ? m(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];
+    if (s) {
+      var i = f(s);
+      return e ? p(i, function(r) {
+        return r.v === e;
+      }) : i;
+    }
+  }
+  outEdges(t, e) {
+    var s = this._out[t];
+    if (s) {
+      var i = f(s);
+      return e ? p(i, function(r) {
+        return r.w === e;
+      }) : i;
+    }
+  }
+  nodeEdges(t, e) {
+    var s = this.inEdges(t, e);
+    if (s)
+      return s.concat(this.outEdges(t, e));
+  }
+}
+E.prototype._nodeCount = 0;
+E.prototype._edgeCount = 0;
+function O(o, t) {
+  o[t] ? o[t]++ : o[t] = 1;
+}
+function w(o, t) {
+  --o[t] || delete o[t];
+}
+function c(o, t, e, s) {
+  var i = "" + t, r = "" + e;
+  if (!o && i > r) {
+    var n = i;
+    i = r, r = n;
+  }
+  return i + C + r + C + (l(s) ? F : s);
+}
+function M(o, t, e, s) {
+  var i = "" + t, r = "" + e;
+  if (!o && i > r) {
+    var n = i;
+    i = r, r = n;
+  }
+  var h = { v: i, w: r };
+  return s && (h.name = s), h;
+}
+function m(o, t) {
+  return c(o, t.v, t.w, t.name);
+}
+export {
+  E as L
+};