lowcoder-comps 2.4.13 → 2.4.15

package/{c8211b18.js → 832e744b.js}

@@ -1,4 +1,4 @@
-import { c as r } from "./b7fefb34.js";
+import { c as r } from "./eb3bf879.js";
 var e = 4;
 function a(o) {
   return r(o, e);

package/{81a0d6f1.js → 8718dc59.js}

@@ -1,16 +1,16 @@
-import { p as e, f as o } from "./bfff0c9e.js";
-import { f as t, g as a } from "./e47dc9ca.js";
-import { x as i } from "./eeeac330.js";
-import "./b7fefb34.js";
-import "./febae45b.js";
-import "./89baa2e6.js";
-import "./c8211b18.js";
-import "./1de1a3c9.js";
-import "./5d259708.js";
-import "./6c5168e9.js";
+import { p as e, f as o } from "./3ebe8123.js";
+import { f as t, g as a } from "./21ce624b.js";
+import { x as i } from "./7cc252e4.js";
+import "./eb3bf879.js";
+import "./eb5cf40c.js";
+import "./a8d4a50e.js";
+import "./832e744b.js";
+import "./b0862b2f.js";
+import "./5fd9a898.js";
+import "./5a31cef7.js";
 import "./2ff2c7a6.js";
-import "./256b619e.js";
-import "./140d1965.js";
+import "./428ebac9.js";
+import "./1e5b4466.js";
 const M = {
   parser: e,
   db: o,

package/{7a22ada0.js → 88953f96.js}

@@ -1,5 +1,5 @@
-import { M as Re, N as je, R as Be, O as Ze, P as Cn, Q as Jt, T as Dn, c as ge, g as ye, e as xt, s as Mn, a as Sn, F as _n, G as Un, d as Yn, b as Fn, H as Ln, o as En, l as Zt, j as Pt, k as An, m as In, C as Wn } from "./eeeac330.js";
-import { b as On, t as _e, c as Hn, a as Nn, l as Vn } from "./93e77b54.js";
+import { M as Re, N as je, R as Be, O as Ze, P as Cn, Q as Jt, T as Dn, c as ge, g as ye, e as xt, s as Mn, a as Sn, F as _n, G as Un, d as Yn, b as Fn, H as Ln, o as En, l as Zt, j as Pt, k as An, m as In, C as Wn } from "./7cc252e4.js";
+import { b as On, t as _e, c as Hn, a as Nn, l as Vn } from "./558e8ee5.js";
 import { i as Pn } from "./f9637058.js";
 function zn(t, e) {
   let n;
@@ -45,9 +45,9 @@ function qn() {
   return !this.__axis;
 }
 function Xe(t, e) {
-  var n = [], r = null, i = null, s = 6, a = 6, k = 3, Y = typeof window != "undefined" && window.devicePixelRatio > 1 ? 0 : 0.5, g = t === Rt || t === zt ? -1 : 1, b = t === zt || t === Kt ? "x" : "y", U = t === Rt || t === le ? Bn : Zn;
+  var n = [], r = null, i = null, s = 6, a = 6, k = 3, Y = typeof window < "u" && window.devicePixelRatio > 1 ? 0 : 0.5, g = t === Rt || t === zt ? -1 : 1, b = t === zt || t === Kt ? "x" : "y", U = t === Rt || t === le ? Bn : Zn;
   function C(v) {
-    var X = r == null ? e.ticks ? e.ticks.apply(e, n) : e.domain() : r, y = i == null ? e.tickFormat ? e.tickFormat.apply(e, n) : jn : i, L = Math.max(s, 0) + k, O = e.range(), W = +O[0] + Y, j = +O[O.length - 1] + Y, B = (e.bandwidth ? $n : Xn)(e.copy(), Y), G = v.selection ? v.selection() : v, x = G.selectAll(".domain").data([null]), A = G.selectAll(".tick").data(X, e).order(), T = A.exit(), F = A.enter().append("g").attr("class", "tick"), D = A.select("line"), w = A.select("text");
+    var X = r ?? (e.ticks ? e.ticks.apply(e, n) : e.domain()), y = i ?? (e.tickFormat ? e.tickFormat.apply(e, n) : jn), L = Math.max(s, 0) + k, O = e.range(), W = +O[0] + Y, j = +O[O.length - 1] + Y, B = (e.bandwidth ? $n : Xn)(e.copy(), Y), G = v.selection ? v.selection() : v, x = G.selectAll(".domain").data([null]), A = G.selectAll(".tick").data(X, e).order(), T = A.exit(), F = A.enter().append("g").attr("class", "tick"), D = A.select("line"), w = A.select("text");
     x = x.merge(x.enter().insert("path", ".tick").attr("class", "domain").attr("stroke", "currentColor")), A = A.merge(F), D = D.merge(F.append("line").attr("stroke", "currentColor").attr(b + "2", g * s)), w = w.merge(F.append("text").attr("fill", "currentColor").attr(b, g * L).attr("dy", t === Rt ? "0em" : t === le ? "0.71em" : "0.32em")), v !== G && (x = x.transition(v), A = A.transition(v), D = D.transition(v), w = w.transition(v), T = T.transition(v).attr("opacity", Ue).attr("transform", function(o) {
       return isFinite(o = B(o)) ? U(o + Y) : this.getAttribute("transform");
     }), F.attr("opacity", Ue).attr("transform", function(o) {
@@ -98,17 +98,17 @@ function Ke(t) {
   return e === n && n === r ? s = a = i : (s = te((0.4360747 * e + 0.3850649 * n + 0.1430804 * r) / $e), a = te((0.0139322 * e + 0.0971045 * n + 0.7141733 * r) / Ge)), new at(116 * i - 16, 500 * (s - i), 200 * (i - a), t.opacity);
 }
 function er(t, e, n, r) {
-  return arguments.length === 1 ? Ke(t) : new at(t, e, n, r == null ? 1 : r);
+  return arguments.length === 1 ? Ke(t) : new at(t, e, n, r ?? 1);
 }
 function at(t, e, n, r) {
   this.l = +t, this.a = +e, this.b = +n, this.opacity = +r;
 }
 Re(at, er, je(Ze, {
   brighter(t) {
-    return new at(this.l + Xt * (t == null ? 1 : t), this.a, this.b, this.opacity);
+    return new at(this.l + Xt * (t ?? 1), this.a, this.b, this.opacity);
   },
   darker(t) {
-    return new at(this.l - Xt * (t == null ? 1 : t), this.a, this.b, this.opacity);
+    return new at(this.l - Xt * (t ?? 1), this.a, this.b, this.opacity);
   },
   rgb() {
     var t = (this.l + 16) / 116, e = isNaN(this.a) ? t : t + this.a / 500, n = isNaN(this.b) ? t : t - this.b / 200;
@@ -141,7 +141,7 @@ function nr(t) {
   return new lt(e < 0 ? e + 360 : e, Math.sqrt(t.a * t.a + t.b * t.b), t.l, t.opacity);
 }
 function ue(t, e, n, r) {
-  return arguments.length === 1 ? nr(t) : new lt(t, e, n, r == null ? 1 : r);
+  return arguments.length === 1 ? nr(t) : new lt(t, e, n, r ?? 1);
 }
 function lt(t, e, n, r) {
   this.h = +t, this.c = +e, this.l = +n, this.opacity = +r;
@@ -154,10 +154,10 @@ function tn(t) {
 }
 Re(lt, ue, je(Ze, {
   brighter(t) {
-    return new lt(this.h, this.c, this.l + Xt * (t == null ? 1 : t), this.opacity);
+    return new lt(this.h, this.c, this.l + Xt * (t ?? 1), this.opacity);
   },
   darker(t) {
-    return new lt(this.h, this.c, this.l - Xt * (t == null ? 1 : t), this.opacity);
+    return new lt(this.h, this.c, this.l - Xt * (t ?? 1), this.opacity);
   },
   rgb() {
     return tn(this).rgb();
@@ -882,12 +882,12 @@ function fn(t, e, n, r, i, s, a, k, Y, g) {
     return arguments.length ? C(Array.from(x, Ti)) : C().map(pi);
   }, b.ticks = function(x) {
     var A = C();
-    return t(A[0], A[A.length - 1], x == null ? 10 : x);
+    return t(A[0], A[A.length - 1], x ?? 10);
   }, b.tickFormat = function(x, A) {
     return A == null ? G : g(A);
   }, b.nice = function(x) {
     var A = C();
-    return (!x || typeof x.range != "function") && (x = e(A[0], A[A.length - 1], x == null ? 10 : x)), x ? C(sr(A, x)) : b;
+    return (!x || typeof x.range != "function") && (x = e(A[0], A[A.length - 1], x ?? 10)), x ? C(sr(A, x)) : b;
   }, b.copy = function() {
     return Nn(b, fn(t, e, n, r, i, s, a, k, Y, g));
   }, b;
@@ -1035,7 +1035,7 @@ var dn = { exports: {} };
               h && !_ || (M = _ > 0 ? _ - 1 : rt.getMonth());
               var l = H || 0, R = V || 0, N = I || 0, q = P || 0;
               return it ? new Date(Date.UTC(E, M, p, l, R, N, q + 60 * it.offset * 1e3)) : Z ? new Date(Date.UTC(E, M, p, l, R, N, q)) : new Date(E, M, p, l, R, N, q);
-            } catch (Q) {
+            } catch {
               return /* @__PURE__ */ new Date("");
             }
           }(G, T, x), this.init(), o && o !== !0 && (this.$L = this.locale(o).$L), w && G != this.format(T) && (this.$d = /* @__PURE__ */ new Date("")), k = {};
@@ -1250,7 +1250,7 @@ var fe = function() {
       var d = this, m = [0], u = [], S = [null], c = [], Z = this.table, f = "", h = 0, _ = 0, $ = 2, H = 1, V = c.slice.call(arguments, 1), I = Object.create(this.lexer), P = { yy: {} };
       for (var it in this.yy)
         Object.prototype.hasOwnProperty.call(this.yy, it) && (P.yy[it] = this.yy[it]);
-      I.setInput(o, P.yy), P.yy.lexer = I, P.yy.parser = this, typeof I.yylloc == "undefined" && (I.yylloc = {});
+      I.setInput(o, P.yy), P.yy.lexer = I, P.yy.parser = this, typeof I.yylloc > "u" && (I.yylloc = {});
       var rt = I.yylloc;
       c.push(rt);
       var p = I.options && I.options.ranges;
@@ -1260,7 +1260,7 @@ var fe = function() {
         return ot = u.pop() || I.lex() || H, typeof ot != "number" && (ot instanceof Array && (u = ot, ot = u.pop()), ot = d.symbols_[ot] || ot), ot;
       }
       for (var M, l, R, N, q = {}, Q, et, _t, Vt; ; ) {
-        if (l = m[m.length - 1], this.defaultActions[l] ? R = this.defaultActions[l] : ((M === null || typeof M == "undefined") && (M = E()), R = Z[l] && Z[l][M]), typeof R == "undefined" || !R.length || !R[0]) {
+        if (l = m[m.length - 1], this.defaultActions[l] ? R = this.defaultActions[l] : ((M === null || typeof M > "u") && (M = E()), R = Z[l] && Z[l][M]), typeof R > "u" || !R.length || !R[0]) {
           var Qt = "";
           Vt = [];
           for (Q in Z[l])
@@ -1298,7 +1298,7 @@ Expecting ` + Vt.join(", ") + ", got '" + (this.terminals_[M] || M) + "'" : Qt =
               R[1],
               S,
               c
-            ].concat(V)), typeof N != "undefined")
+            ].concat(V)), typeof N < "u")
               return N;
             et && (m = m.slice(0, -1 * et * 2), S = S.slice(0, -1 * et), c = c.slice(0, -1 * et)), m.push(this.productions_[R[1]][0]), S.push(q.$), c.push(q._$), _t = Z[m[m.length - 2]][m[m.length - 1]], m.push(_t);
             break;
@@ -1692,7 +1692,7 @@ const _i = function() {
   return [e, a];
 }, de = function(t, e, n) {
   n = n.trim();
-  const i = new RegExp("^after\\s+(?<ids>[\\d\\w- ]+)").exec(n);
+  const i = /^after\s+(?<ids>[\d\w- ]+)/.exec(n);
   if (i !== null) {
     let a = null;
     for (const Y of i.groups.ids.split(" ")) {
@@ -1724,7 +1724,7 @@ const _i = function() {
   return e !== null ? [Number.parseFloat(e[1]), e[2]] : [NaN, "ms"];
 }, Tn = function(t, e, n, r = !1) {
   n = n.trim();
-  const s = new RegExp("^until\\s+(?<ids>[\\d\\w- ]+)").exec(n);
+  const s = /^until\s+(?<ids>[\d\w- ]+)/.exec(n);
   if (s !== null) {
     let b = null;
     for (const C of s.groups.ids.split(" ")) {

package/a8d4a50e.js

@@ -0,0 +1,373 @@
+import { i as N, G as A } from "./eb3bf879.js";
+import { m as $, l as H } from "./eb5cf40c.js";
+import { c as V } from "./832e744b.js";
+import { i as U, u as W, s as _, a as q, b as z, g as D, p as O, c as K, d as Q, e as Y, f as Z, h as J, j as p } from "./b0862b2f.js";
+import { l as s, e as T, r as S, j as L } from "./7cc252e4.js";
+import { a as I } from "./5fd9a898.js";
+function m(e) {
+  var t = {
+    options: {
+      directed: e.isDirected(),
+      multigraph: e.isMultigraph(),
+      compound: e.isCompound()
+    },
+    nodes: tt(e),
+    edges: et(e)
+  };
+  return N(e.graph()) || (t.value = V(e.graph())), t;
+}
+function tt(e) {
+  return $(e.nodes(), function(t) {
+    var n = e.node(t), r = e.parent(t), i = { v: t };
+    return N(n) || (i.value = n), N(r) || (i.parent = r), i;
+  });
+}
+function et(e) {
+  return $(e.edges(), function(t) {
+    var n = e.edge(t), r = { v: t.v, w: t.w };
+    return N(t.name) || (r.name = t.name), N(n) || (r.value = n), r;
+  });
+}
+let l = {}, g = {}, R = {};
+const nt = () => {
+  g = {}, R = {}, l = {};
+}, B = (e, t) => (s.trace("In isDescendant", t, " ", e, " = ", g[t].includes(e)), !!g[t].includes(e)), it = (e, t) => (s.info("Descendants of ", t, " is ", g[t]), s.info("Edge is ", e), e.v === t || e.w === t ? !1 : g[t] ? g[t].includes(e.v) || B(e.v, t) || B(e.w, t) || g[t].includes(e.w) : (s.debug("Tilt, ", t, ",not in descendants"), !1)), P = (e, t, n, r) => {
+  s.warn(
+    "Copying children of ",
+    e,
+    "root",
+    r,
+    "data",
+    t.node(e),
+    r
+  );
+  const i = t.children(e) || [];
+  e !== r && i.push(e), s.warn("Copying (nodes) clusterId", e, "nodes", i), i.forEach((a) => {
+    if (t.children(a).length > 0)
+      P(a, t, n, r);
+    else {
+      const d = t.node(a);
+      s.info("cp ", a, " to ", r, " with parent ", e), n.setNode(a, d), r !== t.parent(a) && (s.warn("Setting parent", a, t.parent(a)), n.setParent(a, t.parent(a))), e !== r && a !== e ? (s.debug("Setting parent", a, e), n.setParent(a, e)) : (s.info("In copy ", e, "root", r, "data", t.node(e), r), s.debug(
+        "Not Setting parent for node=",
+        a,
+        "cluster!==rootId",
+        e !== r,
+        "node!==clusterId",
+        a !== e
+      ));
+      const u = t.edges(a);
+      s.debug("Copying Edges", u), u.forEach((f) => {
+        s.info("Edge", f);
+        const h = t.edge(f.v, f.w, f.name);
+        s.info("Edge data", h, r);
+        try {
+          it(f, r) ? (s.info("Copying as ", f.v, f.w, h, f.name), n.setEdge(f.v, f.w, h, f.name), s.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : s.info(
+            "Skipping copy of edge ",
+            f.v,
+            "-->",
+            f.w,
+            " rootId: ",
+            r,
+            " clusterId:",
+            e
+          );
+        } catch (w) {
+          s.error(w);
+        }
+      });
+    }
+    s.debug("Removing node", a), t.removeNode(a);
+  });
+}, k = (e, t) => {
+  const n = t.children(e);
+  let r = [...n];
+  for (const i of n)
+    R[i] = e, r = [...r, ...k(i, t)];
+  return r;
+}, C = (e, t) => {
+  s.trace("Searching", e);
+  const n = t.children(e);
+  if (s.trace("Searching children of id ", e, n), n.length < 1)
+    return s.trace("This is a valid node", e), e;
+  for (const r of n) {
+    const i = C(r, t);
+    if (i)
+      return s.trace("Found replacement for", e, " => ", i), i;
+  }
+}, X = (e) => !l[e] || !l[e].externalConnections ? e : l[e] ? l[e].id : e, st = (e, t) => {
+  if (!e || t > 10) {
+    s.debug("Opting out, no graph ");
+    return;
+  } else
+    s.debug("Opting in, graph ");
+  e.nodes().forEach(function(n) {
+    e.children(n).length > 0 && (s.warn(
+      "Cluster identified",
+      n,
+      " Replacement id in edges: ",
+      C(n, e)
+    ), g[n] = k(n, e), l[n] = { id: C(n, e), clusterData: e.node(n) });
+  }), e.nodes().forEach(function(n) {
+    const r = e.children(n), i = e.edges();
+    r.length > 0 ? (s.debug("Cluster identified", n, g), i.forEach((a) => {
+      if (a.v !== n && a.w !== n) {
+        const d = B(a.v, n), u = B(a.w, n);
+        d ^ u && (s.warn("Edge: ", a, " leaves cluster ", n), s.warn("Descendants of XXX ", n, ": ", g[n]), l[n].externalConnections = !0);
+      }
+    })) : s.debug("Not a cluster ", n, g);
+  });
+  for (let n of Object.keys(l)) {
+    const r = l[n].id, i = e.parent(r);
+    i !== n && l[i] && !l[i].externalConnections && (l[n].id = i);
+  }
+  e.edges().forEach(function(n) {
+    const r = e.edge(n);
+    s.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), s.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
+    let i = n.v, a = n.w;
+    if (s.warn(
+      "Fix XXX",
+      l,
+      "ids:",
+      n.v,
+      n.w,
+      "Translating: ",
+      l[n.v],
+      " --- ",
+      l[n.w]
+    ), l[n.v] && l[n.w] && l[n.v] === l[n.w]) {
+      s.warn("Fixing and trixing link to self - removing XXX", n.v, n.w, n.name), s.warn("Fixing and trixing - removing XXX", n.v, n.w, n.name), i = X(n.v), a = X(n.w), e.removeEdge(n.v, n.w, n.name);
+      const d = n.w + "---" + n.v;
+      e.setNode(d, {
+        domId: d,
+        id: d,
+        labelStyle: "",
+        labelText: r.label,
+        padding: 0,
+        shape: "labelRect",
+        style: ""
+      });
+      const u = structuredClone(r), f = structuredClone(r);
+      u.label = "", u.arrowTypeEnd = "none", f.label = "", u.fromCluster = n.v, f.toCluster = n.v, e.setEdge(i, d, u, n.name + "-cyclic-special"), e.setEdge(d, a, f, n.name + "-cyclic-special");
+    } else if (l[n.v] || l[n.w]) {
+      if (s.warn("Fixing and trixing - removing XXX", n.v, n.w, n.name), i = X(n.v), a = X(n.w), e.removeEdge(n.v, n.w, n.name), i !== n.v) {
+        const d = e.parent(i);
+        l[d].externalConnections = !0, r.fromCluster = n.v;
+      }
+      if (a !== n.w) {
+        const d = e.parent(a);
+        l[d].externalConnections = !0, r.toCluster = n.w;
+      }
+      s.warn("Fix Replacing with XXX", i, a, n.name), e.setEdge(i, a, r, n.name);
+    }
+  }), s.warn("Adjusted Graph", m(e)), F(e, 0), s.trace(l);
+}, F = (e, t) => {
+  if (s.warn("extractor - ", t, m(e), e.children("D")), t > 10) {
+    s.error("Bailing out");
+    return;
+  }
+  let n = e.nodes(), r = !1;
+  for (const i of n) {
+    const a = e.children(i);
+    r = r || a.length > 0;
+  }
+  if (!r) {
+    s.debug("Done, no node has children", e.nodes());
+    return;
+  }
+  s.debug("Nodes = ", n, t);
+  for (const i of n)
+    if (s.debug(
+      "Extracting node",
+      i,
+      l,
+      l[i] && !l[i].externalConnections,
+      !e.parent(i),
+      e.node(i),
+      e.children("D"),
+      " Depth ",
+      t
+    ), !l[i])
+      s.debug("Not a cluster", i, t);
+    else if (!l[i].externalConnections && // !graph.parent(node) &&
+    e.children(i) && e.children(i).length > 0) {
+      s.warn(
+        "Cluster without external connections, without a parent and with children",
+        i,
+        t
+      );
+      let d = e.graph().rankdir === "TB" ? "LR" : "TB";
+      l[i] && l[i].clusterData && l[i].clusterData.dir && (d = l[i].clusterData.dir, s.warn("Fixing dir", l[i].clusterData.dir, d));
+      const u = new A({
+        multigraph: !0,
+        compound: !0
+      }).setGraph({
+        rankdir: d,
+        // Todo: set proper spacing
+        nodesep: 50,
+        ranksep: 50,
+        marginx: 8,
+        marginy: 8
+      }).setDefaultEdgeLabel(function() {
+        return {};
+      });
+      s.warn("Old graph before copy", m(e)), P(i, e, u, i), e.setNode(i, {
+        clusterNode: !0,
+        id: i,
+        clusterData: l[i].clusterData,
+        labelText: l[i].labelText,
+        graph: u
+      }), s.warn("New graph after copy node: (", i, ")", m(u)), s.debug("Old graph after copy", m(e));
+    } else
+      s.warn(
+        "Cluster ** ",
+        i,
+        " **not meeting the criteria !externalConnections:",
+        !l[i].externalConnections,
+        " no parent: ",
+        !e.parent(i),
+        " children ",
+        e.children(i) && e.children(i).length > 0,
+        e.children("D"),
+        t
+      ), s.debug(l);
+  n = e.nodes(), s.warn("New list of nodes", n);
+  for (const i of n) {
+    const a = e.node(i);
+    s.warn(" Now next level", i, a), a.clusterNode && F(a.graph, t + 1);
+  }
+}, G = (e, t) => {
+  if (t.length === 0)
+    return [];
+  let n = Object.assign(t);
+  return t.forEach((r) => {
+    const i = e.children(r), a = G(e, i);
+    n = [...n, ...a];
+  }), n;
+}, rt = (e) => G(e, e.children()), at = (e, t) => {
+  s.info("Creating subgraph rect for ", t.id, t);
+  const n = T(), r = e.insert("g").attr("class", "cluster" + (t.class ? " " + t.class : "")).attr("id", t.id), i = r.insert("rect", ":first-child"), a = S(n.flowchart.htmlLabels), d = r.insert("g").attr("class", "cluster-label"), u = t.labelType === "markdown" ? I(d, t.labelText, { style: t.labelStyle, useHtmlLabels: a }) : d.node().appendChild(J(t.labelText, t.labelStyle, void 0, !0));
+  let f = u.getBBox();
+  if (S(n.flowchart.htmlLabels)) {
+    const c = u.children[0], o = L(u);
+    f = c.getBoundingClientRect(), o.attr("width", f.width), o.attr("height", f.height);
+  }
+  const h = 0 * t.padding, w = h / 2, x = t.width <= f.width + h ? f.width + h : t.width;
+  t.width <= f.width + h ? t.diff = (f.width - t.width) / 2 - t.padding / 2 : t.diff = -t.padding / 2, s.trace("Data ", t, JSON.stringify(t)), i.attr("style", t.style).attr("rx", t.rx).attr("ry", t.ry).attr("x", t.x - x / 2).attr("y", t.y - t.height / 2 - w).attr("width", x).attr("height", t.height + h);
+  const { subGraphTitleTopMargin: v } = D(n);
+  a ? d.attr(
+    "transform",
+    // This puts the label on top of the box instead of inside it
+    `translate(${t.x - f.width / 2}, ${t.y - t.height / 2 + v})`
+  ) : d.attr(
+    "transform",
+    // This puts the label on top of the box instead of inside it
+    `translate(${t.x}, ${t.y - t.height / 2 + v})`
+  );
+  const y = i.node().getBBox();
+  return t.width = y.width, t.height = y.height, t.intersect = function(c) {
+    return p(t, c);
+  }, r;
+}, ct = (e, t) => {
+  const n = e.insert("g").attr("class", "note-cluster").attr("id", t.id), r = n.insert("rect", ":first-child"), i = 0 * t.padding, a = i / 2;
+  r.attr("rx", t.rx).attr("ry", t.ry).attr("x", t.x - t.width / 2 - a).attr("y", t.y - t.height / 2 - a).attr("width", t.width + i).attr("height", t.height + i).attr("fill", "none");
+  const d = r.node().getBBox();
+  return t.width = d.width, t.height = d.height, t.intersect = function(u) {
+    return p(t, u);
+  }, n;
+}, ot = (e, t) => {
+  const n = T(), r = e.insert("g").attr("class", t.classes).attr("id", t.id), i = r.insert("rect", ":first-child"), a = r.insert("g").attr("class", "cluster-label"), d = r.append("rect"), u = a.node().appendChild(J(t.labelText, t.labelStyle, void 0, !0));
+  let f = u.getBBox();
+  if (S(n.flowchart.htmlLabels)) {
+    const c = u.children[0], o = L(u);
+    f = c.getBoundingClientRect(), o.attr("width", f.width), o.attr("height", f.height);
+  }
+  f = u.getBBox();
+  const h = 0 * t.padding, w = h / 2, x = t.width <= f.width + t.padding ? f.width + t.padding : t.width;
+  t.width <= f.width + t.padding ? t.diff = (f.width + t.padding * 0 - t.width) / 2 : t.diff = -t.padding / 2, i.attr("class", "outer").attr("x", t.x - x / 2 - w).attr("y", t.y - t.height / 2 - w).attr("width", x + h).attr("height", t.height + h), d.attr("class", "inner").attr("x", t.x - x / 2 - w).attr("y", t.y - t.height / 2 - w + f.height - 1).attr("width", x + h).attr("height", t.height + h - f.height - 3);
+  const { subGraphTitleTopMargin: v } = D(n);
+  a.attr(
+    "transform",
+    `translate(${t.x - f.width / 2}, ${t.y - t.height / 2 - t.padding / 3 + (S(n.flowchart.htmlLabels) ? 5 : 3) + v})`
+  );
+  const y = i.node().getBBox();
+  return t.height = y.height, t.intersect = function(c) {
+    return p(t, c);
+  }, r;
+}, lt = (e, t) => {
+  const n = e.insert("g").attr("class", t.classes).attr("id", t.id), r = n.insert("rect", ":first-child"), i = 0 * t.padding, a = i / 2;
+  r.attr("class", "divider").attr("x", t.x - t.width / 2 - a).attr("y", t.y - t.height / 2).attr("width", t.width + i).attr("height", t.height + i);
+  const d = r.node().getBBox();
+  return t.width = d.width, t.height = d.height, t.diff = -t.padding / 2, t.intersect = function(u) {
+    return p(t, u);
+  }, n;
+}, ft = { rect: at, roundedWithTitle: ot, noteGroup: ct, divider: lt };
+let j = {};
+const dt = (e, t) => {
+  s.trace("Inserting cluster");
+  const n = t.shape || "rect";
+  j[t.id] = ft[n](e, t);
+}, ut = () => {
+  j = {};
+}, M = async (e, t, n, r, i, a) => {
+  s.info("Graph in recursive render: XXX", m(t), i);
+  const d = t.graph().rankdir;
+  s.trace("Dir in recursive render - dir:", d);
+  const u = e.insert("g").attr("class", "root");
+  t.nodes() ? s.info("Recursive render XXX", t.nodes()) : s.info("No nodes found for", t), t.edges().length > 0 && s.trace("Recursive edges", t.edge(t.edges()[0]));
+  const f = u.insert("g").attr("class", "clusters"), h = u.insert("g").attr("class", "edgePaths"), w = u.insert("g").attr("class", "edgeLabels"), x = u.insert("g").attr("class", "nodes");
+  await Promise.all(
+    t.nodes().map(async function(c) {
+      const o = t.node(c);
+      if (i !== void 0) {
+        const b = JSON.parse(JSON.stringify(i.clusterData));
+        s.info("Setting data for cluster XXX (", c, ") ", b, i), t.setNode(i.id, b), t.parent(c) || (s.trace("Setting parent", c, i.id), t.setParent(c, i.id, b));
+      }
+      if (s.info("(Insert) Node XXX" + c + ": " + JSON.stringify(t.node(c))), o && o.clusterNode) {
+        s.info("Cluster identified", c, o.width, t.node(c));
+        const b = await M(
+          x,
+          o.graph,
+          n,
+          r,
+          t.node(c),
+          a
+        ), E = b.elem;
+        W(o, E), o.diff = b.diff || 0, s.info("Node bounds (abc123)", c, o, o.width, o.x, o.y), _(E, o), s.warn("Recursive render complete ", E, o);
+      } else
+        t.children(c).length > 0 ? (s.info("Cluster - the non recursive path XXX", c, o.id, o, t), s.info(C(o.id, t)), l[o.id] = { id: C(o.id, t), node: o }) : (s.info("Node - the non recursive path", c, o.id, o), await q(x, t.node(c), d));
+    })
+  ), t.edges().forEach(function(c) {
+    const o = t.edge(c.v, c.w, c.name);
+    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(c)), s.info("Edge " + c.v + " -> " + c.w + ": ", c, " ", JSON.stringify(t.edge(c))), s.info("Fix", l, "ids:", c.v, c.w, "Translating: ", l[c.v], l[c.w]), z(w, o);
+  }), t.edges().forEach(function(c) {
+    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(c));
+  }), s.info("#############################################"), s.info("###                Layout                 ###"), s.info("#############################################"), s.info(t), H(t), s.info("Graph after layout:", m(t));
+  let v = 0;
+  const { subGraphTitleTotalMargin: y } = D(a);
+  return rt(t).forEach(function(c) {
+    const o = t.node(c);
+    s.info("Position " + c + ": " + JSON.stringify(t.node(c))), s.info(
+      "Position " + c + ": (" + o.x,
+      "," + o.y,
+      ") width: ",
+      o.width,
+      " height: ",
+      o.height
+    ), o && o.clusterNode ? (o.y += y, O(o)) : t.children(c).length > 0 ? (o.height += y, dt(f, o), l[o.id].node = o) : (o.y += y / 2, O(o));
+  }), t.edges().forEach(function(c) {
+    const o = t.edge(c);
+    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(o), o), o.points.forEach((E) => E.y += y / 2);
+    const b = K(h, c, o, l, n, t, r);
+    Q(o, b);
+  }), t.nodes().forEach(function(c) {
+    const o = t.node(c);
+    s.info(c, o.type, o.diff), o.type === "group" && (v = o.diff);
+  }), { elem: u, diff: v };
+}, bt = async (e, t, n, r, i) => {
+  U(e, n, r, i), Y(), Z(), ut(), nt(), s.warn("Graph at first:", JSON.stringify(m(t))), st(t), s.warn("Graph after:", JSON.stringify(m(t)));
+  const a = T();
+  await M(e, t, r, i, void 0, a);
+};
+export {
+  bt as r
+};