@prefecthq/prefab-ui-docs 0.18.5 → 0.19.1

package/dist/_renderer/embed.mjs

@@ -1 +1 @@
-export * from "./embed-2Uwza0kv.mjs";
+export * from "./embed-DFtZIRIq.mjs";

package/dist/_renderer/{erDiagram-INFDFZHY-tXSAU2V-.mjs → erDiagram-INFDFZHY-DJZ-Zixz.mjs}

@@ -1,7 +1,7 @@
-import { g as Vt } from "./chunk-55IACEB6-DJd76JUM.mjs";
-import { s as Mt } from "./chunk-KX2RTZJC-D-YALGvM.mjs";
-import { _ as u, b as Bt, a as Ft, s as Yt, g as Pt, p as zt, q as Gt, c as it, l as L, y as Kt, x as Ut, A as Zt, B as jt, o as Wt, r as Qt, d as Xt, u as qt } from "./mermaid.core-PVHvn-x_.mjs";
-import { c as Ht } from "./channel-KNgIWRh0.mjs";
+import { g as Vt } from "./chunk-55IACEB6-DaW7GfFV.mjs";
+import { s as Mt } from "./chunk-KX2RTZJC-CTqbQjR-.mjs";
+import { _ as u, b as Bt, a as Ft, s as Yt, g as Pt, p as zt, q as Gt, c as it, l as L, y as Kt, x as Ut, A as Zt, B as jt, o as Wt, r as Qt, d as Xt, u as qt } from "./mermaid.core-DQ-KgOR7.mjs";
+import { c as Ht } from "./channel-Dxxn7h_C.mjs";
 var _t = (function() {
   var s = /* @__PURE__ */ u(function(R, n, a, c) {
     for (a = a || {}, c = R.length; c--; a[R[c]] = n) ;

package/dist/_renderer/{flowDiagram-PKNHOUZH-Ck7GoCsb.mjs → flowDiagram-PKNHOUZH-C3qBnAyS.mjs}

@@ -1,10 +1,10 @@
-import { g as Ht } from "./chunk-FMBD7UC4-BrYDtYUs.mjs";
-import { _ as m, n as Mt, l as t1, c as b1, d as O1, o as Xt, r as Qt, u as rt, b as Jt, s as Zt, p as $t, a as te, g as ee, q as se, k as ie, t as re, J as ae, v as ne, x as it, y as ue, z as oe, A as le } from "./mermaid.core-PVHvn-x_.mjs";
-import { c as ce } from "./chunk-JSJVCQXG-DxoJlCoN.mjs";
-import { g as he } from "./chunk-55IACEB6-DJd76JUM.mjs";
-import { s as de } from "./chunk-KX2RTZJC-D-YALGvM.mjs";
+import { g as Ht } from "./chunk-FMBD7UC4-C2VBZLyr.mjs";
+import { _ as m, n as Mt, l as t1, c as b1, d as O1, o as Xt, r as Qt, u as rt, b as Jt, s as Zt, p as $t, a as te, g as ee, q as se, k as ie, t as re, J as ae, v as ne, x as it, y as ue, z as oe, A as le } from "./mermaid.core-DQ-KgOR7.mjs";
+import { c as ce } from "./chunk-JSJVCQXG-BVfJez3_.mjs";
+import { g as he } from "./chunk-55IACEB6-DaW7GfFV.mjs";
+import { s as de } from "./chunk-KX2RTZJC-CTqbQjR-.mjs";
 import { p as pe } from "./purify.es-M2Bspgo5.mjs";
-import { c as fe } from "./channel-KNgIWRh0.mjs";
+import { c as fe } from "./channel-Dxxn7h_C.mjs";
 var ge = "flowchart-", G1, be = (G1 = class {
   // cspell:ignore funs
   constructor() {

package/dist/_renderer/{ganttDiagram-A5KZAMGK-CHkrOJ1q.mjs → ganttDiagram-A5KZAMGK-BjgfTqvH.mjs}

@@ -1,4 +1,4 @@
-import { g as ze, s as Ve, q as Re, p as He, a as qe, b as Be, _ as c, c as dt, d as Tt, e as je, av as G, l as ot, k as Ge, j as Xe, y as Ue, u as Ze } from "./mermaid.core-PVHvn-x_.mjs";
+import { g as ze, s as Ve, q as Re, p as He, a as qe, b as Be, _ as c, c as dt, d as Tt, e as je, at as G, l as ot, k as Ge, j as Xe, y as Ue, u as Ze } from "./mermaid.core-DQ-KgOR7.mjs";
 import { g as Ft } from "./icons-z7UO1VFZ.mjs";
 import { t as Qe, m as Ke, a as Je, b as se, c as ae, d as tr, e as er, f as rr, g as ir, h as nr, i as sr, j as ar, k as oe, l as ce, n as le, s as ue, o as de } from "./time-sQ_UKgU4.mjs";
 import { l as or } from "./linear-CVnzSbdA.mjs";

package/dist/_renderer/{gitGraphDiagram-K3NZZRJ6-7nzMCub3.mjs → gitGraphDiagram-K3NZZRJ6-DM5r_Ru5.mjs}

@@ -1,7 +1,7 @@
-import { p as V } from "./chunk-4BX2VUAB-D4ZFWMD0.mjs";
-import { I as X } from "./chunk-QZHKN3VN-CfPAZxEs.mjs";
-import { q as J, p as Q, s as Z, g as rr, a as er, b as tr, _ as $, l as m, d as ar, u as sr, C as nr, y as or, k as E, D as cr, E as ir, F as dr, G as hr } from "./mermaid.core-PVHvn-x_.mjs";
-import { p as lr } from "./treemap-KZPCXAKY-BF1hUklX.mjs";
+import { p as V } from "./chunk-4BX2VUAB-Bh5bI7_v.mjs";
+import { I as X } from "./chunk-QZHKN3VN-B1cy_y-U.mjs";
+import { q as J, p as Q, s as Z, g as rr, a as er, b as tr, _ as $, l as m, d as ar, u as sr, C as nr, y as or, k as E, D as cr, E as ir, F as dr, G as hr } from "./mermaid.core-DQ-KgOR7.mjs";
+import { p as lr } from "./treemap-KZPCXAKY-DMkjhMHM.mjs";
 var p = {
   NORMAL: 0,
   REVERSE: 1,

package/dist/_renderer/{graph-bHaNzIrW.mjs → graph-0OcQYBsN.mjs}

@@ -1,14 +1,145 @@
-import { ac as N, ad as j, ae as f, af as b, ag as E } from "./mermaid.core-PVHvn-x_.mjs";
-import { a as v, c as P, k as _, f as g, d, i as l, v as p, r as D } from "./_baseUniq-dLGXSXpi.mjs";
-var w = N(function(o) {
-  return v(P(o, 1, j, !0));
-}), F = "\0", a = "\0", O = "
";
-class L {
+import { au as T, av as C, aw as Z, ax as R, ay as v, az as k, aA as K, aB as L, aC as V, aD as j, aE as ee, aF as te, aG as re, aH as se, aI as ne, aJ as ie, ao as ae, aK as oe, aL as ue, aM as he, aN as y, aO as S, aP as $ } from "./mermaid.core-DQ-KgOR7.mjs";
+import { k as d, g as H, s as de, e as ce, f as fe, h as ge, j as le, d as _e, l as be, b as pe, m, n as g, r as ye } from "./_baseUniq-DH9CMfkg.mjs";
+function me(t, e) {
+  return t && T(e, d(e), t);
+}
+function je(t, e) {
+  return t && T(e, C(e), t);
+}
+function Te(t, e) {
+  return T(t, H(t), e);
+}
+var Oe = Object.getOwnPropertySymbols, Y = Oe ? function(t) {
+  for (var e = []; t; )
+    ce(e, H(t)), t = Z(t);
+  return e;
+} : de;
+function Ae(t, e) {
+  return T(t, Y(t), e);
+}
+function Ee(t) {
+  return fe(t, C, Y);
+}
+var Ce = Object.prototype, Le = Ce.hasOwnProperty;
+function we(t) {
+  var e = t.length, r = new t.constructor(e);
+  return e && typeof t[0] == "string" && Le.call(t, "index") && (r.index = t.index, r.input = t.input), r;
+}
+function Ne(t, e) {
+  var r = e ? R(t.buffer) : t.buffer;
+  return new t.constructor(r, t.byteOffset, t.byteLength);
+}
+var Fe = /\w*$/;
+function Pe(t) {
+  var e = new t.constructor(t.source, Fe.exec(t));
+  return e.lastIndex = t.lastIndex, e;
+}
+var I = v ? v.prototype : void 0, D = I ? I.valueOf : void 0;
+function ve(t) {
+  return D ? Object(D.call(t)) : {};
+}
+var Se = "[object Boolean]", $e = "[object Date]", Ie = "[object Map]", De = "[object Number]", Me = "[object RegExp]", Ge = "[object Set]", xe = "[object String]", Ue = "[object Symbol]", Be = "[object ArrayBuffer]", Re = "[object DataView]", Ke = "[object Float32Array]", Ve = "[object Float64Array]", He = "[object Int8Array]", Ye = "[object Int16Array]", qe = "[object Int32Array]", Je = "[object Uint8Array]", We = "[object Uint8ClampedArray]", ze = "[object Uint16Array]", Qe = "[object Uint32Array]";
+function Xe(t, e, r) {
+  var s = t.constructor;
+  switch (e) {
+    case Be:
+      return R(t);
+    case Se:
+    case $e:
+      return new s(+t);
+    case Re:
+      return Ne(t, r);
+    case Ke:
+    case Ve:
+    case He:
+    case Ye:
+    case qe:
+    case Je:
+    case We:
+    case ze:
+    case Qe:
+      return k(t, r);
+    case Ie:
+      return new s();
+    case De:
+    case xe:
+      return new s(t);
+    case Me:
+      return Pe(t);
+    case Ge:
+      return new s();
+    case Ue:
+      return ve(t);
+  }
+}
+var Ze = "[object Map]";
+function ke(t) {
+  return K(t) && L(t) == Ze;
+}
+var M = j && j.isMap, et = M ? V(M) : ke, tt = "[object Set]";
+function rt(t) {
+  return K(t) && L(t) == tt;
+}
+var G = j && j.isSet, st = G ? V(G) : rt, nt = 1, it = 2, at = 4, q = "[object Arguments]", ot = "[object Array]", ut = "[object Boolean]", ht = "[object Date]", dt = "[object Error]", J = "[object Function]", ct = "[object GeneratorFunction]", ft = "[object Map]", gt = "[object Number]", W = "[object Object]", lt = "[object RegExp]", _t = "[object Set]", bt = "[object String]", pt = "[object Symbol]", yt = "[object WeakMap]", mt = "[object ArrayBuffer]", jt = "[object DataView]", Tt = "[object Float32Array]", Ot = "[object Float64Array]", At = "[object Int8Array]", Et = "[object Int16Array]", Ct = "[object Int32Array]", Lt = "[object Uint8Array]", wt = "[object Uint8ClampedArray]", Nt = "[object Uint16Array]", Ft = "[object Uint32Array]", o = {};
+o[q] = o[ot] = o[mt] = o[jt] = o[ut] = o[ht] = o[Tt] = o[Ot] = o[At] = o[Et] = o[Ct] = o[ft] = o[gt] = o[W] = o[lt] = o[_t] = o[bt] = o[pt] = o[Lt] = o[wt] = o[Nt] = o[Ft] = !0;
+o[dt] = o[J] = o[yt] = !1;
+function O(t, e, r, s, n, a) {
+  var i, u = e & nt, h = e & it, Q = e & at;
+  if (i !== void 0)
+    return i;
+  if (!ee(t))
+    return t;
+  var w = ae(t);
+  if (w) {
+    if (i = we(t), !u)
+      return te(t, i);
+  } else {
+    var _ = L(t), N = _ == J || _ == ct;
+    if (re(t))
+      return se(t, u);
+    if (_ == W || _ == q || N && !n) {
+      if (i = h || N ? {} : ne(t), !u)
+        return h ? Ae(t, je(i, t)) : Te(t, me(i, t));
+    } else {
+      if (!o[_])
+        return n ? t : {};
+      i = Xe(t, _, u);
+    }
+  }
+  a || (a = new ie());
+  var F = a.get(t);
+  if (F)
+    return F;
+  a.set(t, i), st(t) ? t.forEach(function(c) {
+    i.add(O(c, e, r, c, t, a));
+  }) : et(t) && t.forEach(function(c, f) {
+    i.set(f, O(c, e, r, f, t, a));
+  });
+  var X = Q ? h ? Ee : le : h ? C : d, P = w ? void 0 : X(t);
+  return ge(P || t, function(c, f) {
+    P && (f = c, c = t[f]), oe(i, f, O(c, e, r, f, t, a));
+  }), i;
+}
+function Pt(t, e) {
+  return _e(e, function(r) {
+    return t[r];
+  });
+}
+function A(t) {
+  return t == null ? [] : Pt(t, d(t));
+}
+function b(t) {
+  return t === void 0;
+}
+var vt = ue(function(t) {
+  return be(pe(t, 1, he, !0));
+}), St = "\0", l = "\0", x = "
";
+class z {
   /**
    * @param {GraphOptions} [opts] - Graph options.
    */
   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 = 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(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 = y(void 0), this._defaultEdgeLabelFn = y(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[l] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
   }
   /* === Graph functions ========= */
   /**
@@ -84,7 +215,7 @@ class L {
    * @returns {this}
    */
   setDefaultNodeLabel(e) {
-    return b(e) || (e = f(e)), this._defaultNodeLabelFn = e, this;
+    return S(e) || (e = y(e)), this._defaultNodeLabelFn = e, this;
   }
   /**
    * @returns {number} the number of nodes in the graph.
@@ -100,7 +231,7 @@ class L {
    * Takes `O(|V|)` time.
    */
   nodes() {
-    return _(this._nodes);
+    return d(this._nodes);
   }
   /**
    * @returns {NodeID[]} those nodes in the graph that have no in-edges.
@@ -108,8 +239,8 @@ class L {
    */
   sources() {
     var e = this;
-    return g(this.nodes(), function(t) {
-      return E(e._in[t]);
+    return m(this.nodes(), function(r) {
+      return $(e._in[r]);
     });
   }
   /**
@@ -118,8 +249,8 @@ class L {
    */
   sinks() {
     var e = this;
-    return g(this.nodes(), function(t) {
-      return E(e._out[t]);
+    return m(this.nodes(), function(r) {
+      return $(e._out[r]);
     });
   }
   /**
@@ -130,10 +261,10 @@ class L {
    * @returns {this}
    * @remarks Complexity: O(|names|).
    */
-  setNodes(e, t) {
-    var s = arguments, i = this;
-    return d(e, function(r) {
-      s.length > 1 ? i.setNode(r, t) : i.setNode(r);
+  setNodes(e, r) {
+    var s = arguments, n = this;
+    return g(e, function(a) {
+      s.length > 1 ? n.setNode(a, r) : n.setNode(a);
     }), this;
   }
   /**
@@ -146,8 +277,8 @@ class L {
    * @returns {this} the graph, allowing this to be chained with other functions.
    * @remarks Takes `O(1)` time.
    */
-  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] = a, this._children[e] = {}, this._children[a][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+  setNode(e, r) {
+    return Object.prototype.hasOwnProperty.call(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = r), this) : (this._nodes[e] = arguments.length > 1 ? r : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = l, this._children[e] = {}, this._children[l][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
   }
   /**
    * Gets the label of node with specified name.
@@ -183,10 +314,10 @@ class L {
    */
   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], d(this.children(e), (s) => {
+      var r = (s) => this.removeEdge(this._edgeObjs[s]);
+      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], g(this.children(e), (s) => {
         this.setParent(s);
-      }), delete this._children[e]), d(_(this._in[e]), t), delete this._in[e], delete this._preds[e], d(_(this._out[e]), t), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+      }), delete this._children[e]), g(d(this._in[e]), r), delete this._in[e], delete this._preds[e], g(d(this._out[e]), r), delete this._out[e], delete this._sucs[e], --this._nodeCount;
     }
     return this;
   }
@@ -201,19 +332,19 @@ class L {
    * @throws if setting the parent would create a cycle.
    * @remarks Takes `O(1)` time.
    */
-  setParent(e, t) {
+  setParent(e, r) {
     if (!this._isCompound)
       throw new Error("Cannot set parent in a non-compound graph");
-    if (l(t))
-      t = a;
+    if (b(r))
+      r = l;
     else {
-      t += "";
-      for (var s = t; !l(s); s = this.parent(s))
+      r += "";
+      for (var s = r; !b(s); s = this.parent(s))
         if (s === e)
-          throw new Error("Setting " + t + " as parent of " + e + " would create a cycle");
-      this.setNode(t);
+          throw new Error("Setting " + r + " as parent of " + e + " would create a cycle");
+      this.setNode(r);
     }
-    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
+    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = r, this._children[r][e] = !0, this;
   }
   /**
    * @private
@@ -234,9 +365,9 @@ class L {
    */
   parent(e) {
     if (this._isCompound) {
-      var t = this._parent[e];
-      if (t !== a)
-        return t;
+      var r = this._parent[e];
+      if (r !== l)
+        return r;
     }
   }
   /**
@@ -250,12 +381,12 @@ class L {
    * @remarks Takes `O(|V|)` time.
    */
   children(e) {
-    if (l(e) && (e = a), this._isCompound) {
-      var t = this._children[e];
-      if (t)
-        return _(t);
+    if (b(e) && (e = l), this._isCompound) {
+      var r = this._children[e];
+      if (r)
+        return d(r);
     } else {
-      if (e === a)
+      if (e === l)
         return this.nodes();
       if (this.hasNode(e))
         return [];
@@ -270,9 +401,9 @@ class L {
    * Takes `O(|V|)` time.
    */
   predecessors(e) {
-    var t = this._preds[e];
-    if (t)
-      return _(t);
+    var r = this._preds[e];
+    if (r)
+      return d(r);
   }
   /**
    * @param {NodeID | number} v - Node ID.
@@ -283,9 +414,9 @@ class L {
    * Takes `O(|V|)` time.
    */
   successors(e) {
-    var t = this._sucs[e];
-    if (t)
-      return _(t);
+    var r = this._sucs[e];
+    if (r)
+      return d(r);
   }
   /**
    * @param {NodeID | number} v - Node ID.
@@ -295,17 +426,17 @@ class L {
    * @remarks Takes `O(|V|)` time.
    */
   neighbors(e) {
-    var t = this.predecessors(e);
-    if (t)
-      return w(t, this.successors(e));
+    var r = this.predecessors(e);
+    if (r)
+      return vt(r, this.successors(e));
   }
   /**
    * @param {NodeID | number} v - Node ID.
    * @returns {boolean} True if the node is a leaf (has no successors), false otherwise.
    */
   isLeaf(e) {
-    var t;
-    return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), t.length === 0;
+    var r;
+    return this.isDirected() ? r = this.successors(e) : r = this.neighbors(e), r.length === 0;
   }
   /**
      * Creates new graph with nodes filtered via `filter`.
@@ -320,26 +451,26 @@ class L {
      * @remarks Average-case complexity: O(|E|+|V|).
      */
   filterNodes(e) {
-    var t = new this.constructor({
+    var r = new this.constructor({
       directed: this._isDirected,
       multigraph: this._isMultigraph,
       compound: this._isCompound
     });
-    t.setGraph(this.graph());
+    r.setGraph(this.graph());
     var s = this;
-    d(this._nodes, function(n, h) {
-      e(h) && t.setNode(h, n);
-    }), d(this._edgeObjs, function(n) {
-      t.hasNode(n.v) && t.hasNode(n.w) && t.setEdge(n, s.edge(n));
+    g(this._nodes, function(i, u) {
+      e(u) && r.setNode(u, i);
+    }), g(this._edgeObjs, function(i) {
+      r.hasNode(i.v) && r.hasNode(i.w) && r.setEdge(i, s.edge(i));
     });
-    var i = {};
-    function r(n) {
-      var h = s.parent(n);
-      return h === void 0 || t.hasNode(h) ? (i[n] = h, h) : h in i ? i[h] : r(h);
+    var n = {};
+    function a(i) {
+      var u = s.parent(i);
+      return u === void 0 || r.hasNode(u) ? (n[i] = u, u) : u in n ? n[u] : a(u);
     }
-    return this._isCompound && d(t.nodes(), function(n) {
-      t.setParent(n, r(n));
-    }), t;
+    return this._isCompound && g(r.nodes(), function(i) {
+      r.setParent(i, a(i));
+    }), r;
   }
   /* === Edge functions ========== */
   /**
@@ -352,7 +483,7 @@ class L {
    * @returns {this}
    */
   setDefaultEdgeLabel(e) {
-    return b(e) || (e = f(e)), this._defaultEdgeLabelFn = e, this;
+    return S(e) || (e = y(e)), this._defaultEdgeLabelFn = e, this;
   }
   /**
    * @returns {number} the number of edges in the graph.
@@ -372,7 +503,7 @@ class L {
    * Takes `O(|E|)` time.
    */
   edges() {
-    return p(this._edgeObjs);
+    return A(this._edgeObjs);
   }
   /**
    * Establish an edges path over the nodes in nodes list.
@@ -386,10 +517,10 @@ class L {
    * @returns {this}
    * @remarks Complexity: O(|nodes|).
    */
-  setPath(e, t) {
-    var s = this, i = arguments;
-    return D(e, function(r, n) {
-      return i.length > 1 ? s.setEdge(r, n, t) : s.setEdge(r, n), n;
+  setPath(e, r) {
+    var s = this, n = arguments;
+    return ye(e, function(a, i) {
+      return n.length > 1 ? s.setEdge(a, i, r) : s.setEdge(a, i), i;
     }), this;
   }
   /**
@@ -419,16 +550,16 @@ class L {
    * @remarks Takes `O(1)` time.
    */
   setEdge() {
-    var e, t, s, i, r = !1, n = arguments[0];
-    typeof n == "object" && n !== null && "v" in n ? (e = n.v, t = n.w, s = n.name, arguments.length === 2 && (i = arguments[1], r = !0)) : (e = n, t = arguments[1], s = arguments[3], arguments.length > 2 && (i = arguments[2], r = !0)), e = "" + e, t = "" + t, l(s) || (s = "" + s);
-    var h = c(this._isDirected, e, t, s);
-    if (Object.prototype.hasOwnProperty.call(this._edgeLabels, h))
-      return r && (this._edgeLabels[h] = i), this;
-    if (!l(s) && !this._isMultigraph)
+    var e, r, s, n, a = !1, i = arguments[0];
+    typeof i == "object" && i !== null && "v" in i ? (e = i.v, r = i.w, s = i.name, arguments.length === 2 && (n = arguments[1], a = !0)) : (e = i, r = arguments[1], s = arguments[3], arguments.length > 2 && (n = arguments[2], a = !0)), e = "" + e, r = "" + r, b(s) || (s = "" + s);
+    var u = p(this._isDirected, e, r, s);
+    if (Object.prototype.hasOwnProperty.call(this._edgeLabels, u))
+      return a && (this._edgeLabels[u] = n), this;
+    if (!b(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 = M(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;
+    this.setNode(e), this.setNode(r), this._edgeLabels[u] = a ? n : this._defaultEdgeLabelFn(e, r, s);
+    var h = $t(this._isDirected, e, r, s);
+    return e = h.v, r = h.w, Object.freeze(h), this._edgeObjs[u] = h, U(this._preds[r], e), U(this._sucs[e], r), this._in[r][u] = h, this._out[e][u] = h, this._edgeCount++, this;
   }
   /**
    * Gets the label for the specified edge.
@@ -456,9 +587,9 @@ class L {
    * `v` and `w` can be interchanged for undirected graphs.
    * Takes `O(1)` time.
    */
-  edge(e, t, s) {
-    var i = arguments.length === 1 ? m(this._isDirected, arguments[0]) : c(this._isDirected, e, t, s);
-    return this._edgeLabels[i];
+  edge(e, r, s) {
+    var n = arguments.length === 1 ? E(this._isDirected, arguments[0]) : p(this._isDirected, e, r, s);
+    return this._edgeLabels[n];
   }
   /**
    * Detects whether the graph contains specified edge or not.
@@ -486,9 +617,9 @@ class L {
    * No subgraphs are considered.
    * Takes `O(1)` time.
    */
-  hasEdge(e, t, s) {
-    var i = arguments.length === 1 ? m(this._isDirected, arguments[0]) : c(this._isDirected, e, t, s);
-    return Object.prototype.hasOwnProperty.call(this._edgeLabels, i);
+  hasEdge(e, r, s) {
+    var n = arguments.length === 1 ? E(this._isDirected, arguments[0]) : p(this._isDirected, e, r, s);
+    return Object.prototype.hasOwnProperty.call(this._edgeLabels, n);
   }
   /**
    * Removes the edge (`v`, `w`) if the graph has an edge between `v` and `w`
@@ -515,9 +646,9 @@ class L {
    * `v` and `w` can be interchanged for undirected graphs.
    * Takes `O(1)` time.
    */
-  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], C(this._preds[t], e), C(this._sucs[e], t), delete this._in[t][i], delete this._out[e][i], this._edgeCount--), this;
+  removeEdge(e, r, s) {
+    var n = arguments.length === 1 ? E(this._isDirected, arguments[0]) : p(this._isDirected, e, r, s), a = this._edgeObjs[n];
+    return a && (e = a.v, r = a.w, delete this._edgeLabels[n], delete this._edgeObjs[n], B(this._preds[r], e), B(this._sucs[e], r), delete this._in[r][n], delete this._out[e][n], this._edgeCount--), this;
   }
   /**
    * @param {NodeID | number} v - Target node ID.
@@ -529,13 +660,13 @@ class L {
    * Behavior is undefined for undirected graphs - use {@link nodeEdges} instead.
    * Takes `O(|E|)` time.
    */
-  inEdges(e, t) {
+  inEdges(e, r) {
     var s = this._in[e];
     if (s) {
-      var i = p(s);
-      return t ? g(i, function(r) {
-        return r.v === t;
-      }) : i;
+      var n = A(s);
+      return r ? m(n, function(a) {
+        return a.v === r;
+      }) : n;
     }
   }
   /**
@@ -548,13 +679,13 @@ class L {
    * Behavior is undefined for undirected graphs - use {@link nodeEdges} instead.
    * Takes `O(|E|)` time.
    */
-  outEdges(e, t) {
+  outEdges(e, r) {
     var s = this._out[e];
     if (s) {
-      var i = p(s);
-      return t ? g(i, function(r) {
-        return r.w === t;
-      }) : i;
+      var n = A(s);
+      return r ? m(n, function(a) {
+        return a.w === r;
+      }) : n;
     }
   }
   /**
@@ -565,40 +696,43 @@ class L {
    * of direction. Returns `undefined` if node `v` is not in the graph.
    * @remarks Takes `O(|E|)` time.
    */
-  nodeEdges(e, t) {
-    var s = this.inEdges(e, t);
+  nodeEdges(e, r) {
+    var s = this.inEdges(e, r);
     if (s)
-      return s.concat(this.outEdges(e, t));
+      return s.concat(this.outEdges(e, r));
   }
 }
-L.prototype._nodeCount = 0;
-L.prototype._edgeCount = 0;
-function y(o, e) {
-  o[e] ? o[e]++ : o[e] = 1;
+z.prototype._nodeCount = 0;
+z.prototype._edgeCount = 0;
+function U(t, e) {
+  t[e] ? t[e]++ : t[e] = 1;
 }
-function C(o, e) {
-  --o[e] || delete o[e];
+function B(t, e) {
+  --t[e] || delete t[e];
 }
-function c(o, e, t, s) {
-  var i = "" + e, r = "" + t;
-  if (!o && i > r) {
-    var n = i;
-    i = r, r = n;
+function p(t, e, r, s) {
+  var n = "" + e, a = "" + r;
+  if (!t && n > a) {
+    var i = n;
+    n = a, a = i;
   }
-  return i + O + r + O + (l(s) ? F : s);
+  return n + x + a + x + (b(s) ? St : s);
 }
-function M(o, e, t, s) {
-  var i = "" + e, r = "" + t;
-  if (!o && i > r) {
-    var n = i;
-    i = r, r = n;
-  }
-  var h = { v: i, w: r };
-  return s && (h.name = s), h;
+function $t(t, e, r, s) {
+  var n = "" + e, a = "" + r;
+  if (!t && n > a) {
+    var i = n;
+    n = a, a = i;
+  }
+  var u = { v: n, w: a };
+  return s && (u.name = s), u;
 }
-function m(o, e) {
-  return c(o, e.v, e.w, e.name);
+function E(t, e) {
+  return p(t, e.v, e.w, e.name);
 }
 export {
-  L as G
+  z as G,
+  O as b,
+  b as i,
+  A as v
 };

package/dist/_renderer/{infoDiagram-LFFYTUFH-b285s-9o.mjs → infoDiagram-LFFYTUFH-CFe_1CRy.mjs}

@@ -1,5 +1,5 @@
-import { _ as a, l as s, H as o, e as i } from "./mermaid.core-PVHvn-x_.mjs";
-import { p as g } from "./treemap-KZPCXAKY-BF1hUklX.mjs";
+import { _ as a, l as s, H as o, e as i } from "./mermaid.core-DQ-KgOR7.mjs";
+import { p as g } from "./treemap-KZPCXAKY-DMkjhMHM.mjs";
 var p = {
   parse: /* @__PURE__ */ a(async (r) => {
     const e = await g("info", r);

package/dist/_renderer/{ishikawaDiagram-PHBUUO56-BiKtVObK.mjs → ishikawaDiagram-PHBUUO56-Bk2A15A6.mjs}

@@ -1,4 +1,4 @@
-import { _ as o, c as ot, N as ut, H as dt, ab as yt, y as ft, k as pt, p as it, a as gt, b as kt, g as wt, s as mt, q as _t, e as bt } from "./mermaid.core-PVHvn-x_.mjs";
+import { _ as o, c as ot, N as ut, H as dt, ab as yt, y as ft, k as pt, p as it, a as gt, b as kt, g as wt, s as mt, q as _t, e as bt } from "./mermaid.core-DQ-KgOR7.mjs";
 var tt = (function() {
   var e = /* @__PURE__ */ o(function(M, t, s, i) {
     for (s = s || {}, i = M.length; i--; s[M[i]] = t) ;