@sme.up/ketchup2 2.0.0-SNAPSHOT-20250908152453 → 2.0.0-SNAPSHOT-20250909094906

package/dist/{dagre-2BBEFEWP-CLTO8d-K.js → dagre-5GWH7T2D-gZxGoa1q.js}

@@ -1,9 +1,9 @@
-import { _ as w, ar as F, as as Y, at as _, au as H, l as r, c as V, av as z, aw as U, ag as $, al as q, ah as P, af as K, ax as Q, ay as W, az as Z } from "./index-VJw3klPt.js";
-import { G as B } from "./graph-CMnK4YO3.js";
-import { l as I } from "./layout-kUC11kUc.js";
-import { i as b } from "./_baseUniq-DUO9awf7.js";
-import { c as L } from "./clone-B-bAOLls.js";
-import { m as A } from "./_basePickBy-Bq-OHVlJ.js";
+import { _ as w, at as F, au as Y, av as _, aw as H, l as i, c as V, ax as z, ay as U, ai as $, an as q, aj as P, ah as K, az as Q, aA as W, aB as Z } from "./index-JAUwzcHq.js";
+import { G as B } from "./graph-Vhpd_PNV.js";
+import { l as I } from "./layout-DtdTzvka.js";
+import { i as b } from "./_baseUniq-ChWtQCAg.js";
+import { c as L } from "./clone-BIRPLFeu.js";
+import { m as A } from "./_basePickBy-Do84EYM_.js";
 function h(e) {
   var t = {
     options: {
@@ -18,8 +18,8 @@ function h(e) {
 }
 function ee(e) {
   return A(e.nodes(), function(t) {
-    var n = e.node(t), a = e.parent(t), i = { v: t };
-    return b(n) || (i.value = n), b(a) || (i.parent = a), i;
+    var n = e.node(t), a = e.parent(t), r = { v: t };
+    return b(n) || (r.value = n), b(a) || (r.parent = a), r;
   });
 }
 function ne(e) {
@@ -32,12 +32,12 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
   y.clear(), J.clear(), d.clear();
 }, "clear"), D = /* @__PURE__ */ w((e, t) => {
   const n = y.get(t) || [];
-  return r.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
+  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
 }, "isDescendant"), se = /* @__PURE__ */ w((e, t) => {
   const n = y.get(t) || [];
-  return r.info("Descendants of ", t, " is ", n), r.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || D(e.v, t) || D(e.w, t) || n.includes(e.w) : (r.debug("Tilt, ", t, ",not in descendants"), !1);
+  return i.info("Descendants of ", t, " is ", n), i.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || D(e.v, t) || D(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
 }, "edgeInCluster"), G = /* @__PURE__ */ w((e, t, n, a) => {
-  r.warn(
+  i.warn(
     "Copying children of ",
     e,
     "root",
@@ -46,13 +46,13 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
     t.node(e),
     a
   );
-  const i = t.children(e) || [];
-  e !== a && i.push(e), r.warn("Copying (nodes) clusterId", e, "nodes", i), i.forEach((o) => {
+  const r = t.children(e) || [];
+  e !== a && r.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", r), r.forEach((o) => {
     if (t.children(o).length > 0)
       G(o, t, n, a);
     else {
       const l = t.node(o);
-      r.info("cp ", o, " to ", a, " with parent ", e), n.setNode(o, l), a !== t.parent(o) && (r.warn("Setting parent", o, t.parent(o)), n.setParent(o, t.parent(o))), e !== a && o !== e ? (r.debug("Setting parent", o, e), n.setParent(o, e)) : (r.info("In copy ", e, "root", a, "data", t.node(e), a), r.debug(
+      i.info("cp ", o, " to ", a, " with parent ", e), n.setNode(o, l), a !== t.parent(o) && (i.warn("Setting parent", o, t.parent(o)), n.setParent(o, t.parent(o))), e !== a && o !== e ? (i.debug("Setting parent", o, e), n.setParent(o, e)) : (i.info("In copy ", e, "root", a, "data", t.node(e), a), i.debug(
         "Not Setting parent for node=",
         o,
         "cluster!==rootId",
@@ -61,12 +61,12 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
         o !== e
       ));
       const u = t.edges(o);
-      r.debug("Copying Edges", u), u.forEach((c) => {
-        r.info("Edge", c);
+      i.debug("Copying Edges", u), u.forEach((c) => {
+        i.info("Edge", c);
         const m = t.edge(c.v, c.w, c.name);
-        r.info("Edge data", m, a);
+        i.info("Edge data", m, a);
         try {
-          se(c, a) ? (r.info("Copying as ", c.v, c.w, m, c.name), n.setEdge(c.v, c.w, m, c.name), r.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : r.info(
+          se(c, a) ? (i.info("Copying as ", c.v, c.w, m, c.name), n.setEdge(c.v, c.w, m, c.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
             "Skipping copy of edge ",
             c.v,
             "-->",
@@ -77,64 +77,64 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
             e
           );
         } catch (v) {
-          r.error(v);
+          i.error(v);
         }
       });
     }
-    r.debug("Removing node", o), t.removeNode(o);
+    i.debug("Removing node", o), t.removeNode(o);
   });
 }, "copy"), R = /* @__PURE__ */ w((e, t) => {
   const n = t.children(e);
   let a = [...n];
-  for (const i of n)
-    J.set(i, e), a = [...a, ...R(i, t)];
+  for (const r of n)
+    J.set(r, e), a = [...a, ...R(r, t)];
   return a;
-}, "extractDescendants"), re = /* @__PURE__ */ w((e, t, n) => {
-  const a = e.edges().filter((c) => c.v === t || c.w === t), i = e.edges().filter((c) => c.v === n || c.w === n), o = a.map((c) => ({ v: c.v === t ? n : c.v, w: c.w === t ? t : c.w })), l = i.map((c) => ({ v: c.v, w: c.w }));
+}, "extractDescendants"), ie = /* @__PURE__ */ w((e, t, n) => {
+  const a = e.edges().filter((c) => c.v === t || c.w === t), r = e.edges().filter((c) => c.v === n || c.w === n), o = a.map((c) => ({ v: c.v === t ? n : c.v, w: c.w === t ? t : c.w })), l = r.map((c) => ({ v: c.v, w: c.w }));
   return o.filter((c) => l.some((m) => c.v === m.v && c.w === m.w));
 }, "findCommonEdges"), C = /* @__PURE__ */ w((e, t, n) => {
   const a = t.children(e);
-  if (r.trace("Searching children of id ", e, a), a.length < 1)
+  if (i.trace("Searching children of id ", e, a), a.length < 1)
     return e;
-  let i;
+  let r;
   for (const o of a) {
-    const l = C(o, t, n), u = re(t, n, l);
+    const l = C(o, t, n), u = ie(t, n, l);
     if (l)
       if (u.length > 0)
-        i = l;
+        r = l;
       else
         return l;
   }
-  return i;
-}, "findNonClusterChild"), k = /* @__PURE__ */ w((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), ie = /* @__PURE__ */ w((e, t) => {
+  return r;
+}, "findNonClusterChild"), k = /* @__PURE__ */ w((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ w((e, t) => {
   if (!e || t > 10) {
-    r.debug("Opting out, no graph ");
+    i.debug("Opting out, no graph ");
     return;
   } else
-    r.debug("Opting in, graph ");
+    i.debug("Opting in, graph ");
   e.nodes().forEach(function(n) {
-    e.children(n).length > 0 && (r.warn(
+    e.children(n).length > 0 && (i.warn(
       "Cluster identified",
       n,
       " Replacement id in edges: ",
       C(n, e, n)
     ), y.set(n, R(n, e)), d.set(n, { id: C(n, e, n), clusterData: e.node(n) }));
   }), e.nodes().forEach(function(n) {
-    const a = e.children(n), i = e.edges();
-    a.length > 0 ? (r.debug("Cluster identified", n, y), i.forEach((o) => {
+    const a = e.children(n), r = e.edges();
+    a.length > 0 ? (i.debug("Cluster identified", n, y), r.forEach((o) => {
       const l = D(o.v, n), u = D(o.w, n);
-      l ^ u && (r.warn("Edge: ", o, " leaves cluster ", n), r.warn("Descendants of XXX ", n, ": ", y.get(n)), d.get(n).externalConnections = !0);
-    })) : r.debug("Not a cluster ", n, y);
+      l ^ u && (i.warn("Edge: ", o, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", y.get(n)), d.get(n).externalConnections = !0);
+    })) : i.debug("Not a cluster ", n, y);
   });
   for (let n of d.keys()) {
-    const a = d.get(n).id, i = e.parent(a);
-    i !== n && d.has(i) && !d.get(i).externalConnections && (d.get(n).id = i);
+    const a = d.get(n).id, r = e.parent(a);
+    r !== n && d.has(r) && !d.get(r).externalConnections && (d.get(n).id = r);
   }
   e.edges().forEach(function(n) {
     const a = e.edge(n);
-    r.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), r.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
-    let i = n.v, o = n.w;
-    if (r.warn(
+    i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
+    let r = n.v, o = n.w;
+    if (i.warn(
       "Fix XXX",
       d,
       "ids:",
@@ -145,53 +145,53 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
       " --- ",
       d.get(n.w)
     ), d.get(n.v) || d.get(n.w)) {
-      if (r.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), i = k(n.v), o = k(n.w), e.removeEdge(n.v, n.w, n.name), i !== n.v) {
-        const l = e.parent(i);
+      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), r = k(n.v), o = k(n.w), e.removeEdge(n.v, n.w, n.name), r !== n.v) {
+        const l = e.parent(r);
         d.get(l).externalConnections = !0, a.fromCluster = n.v;
       }
       if (o !== n.w) {
         const l = e.parent(o);
         d.get(l).externalConnections = !0, a.toCluster = n.w;
       }
-      r.warn("Fix Replacing with XXX", i, o, n.name), e.setEdge(i, o, a, n.name);
+      i.warn("Fix Replacing with XXX", r, o, n.name), e.setEdge(r, o, a, n.name);
     }
-  }), r.warn("Adjusted Graph", h(e)), T(e, 0), r.trace(d);
+  }), i.warn("Adjusted Graph", h(e)), T(e, 0), i.trace(d);
 }, "adjustClustersAndEdges"), T = /* @__PURE__ */ w((e, t) => {
-  if (r.warn("extractor - ", t, h(e), e.children("D")), t > 10) {
-    r.error("Bailing out");
+  if (i.warn("extractor - ", t, h(e), e.children("D")), t > 10) {
+    i.error("Bailing out");
     return;
   }
   let n = e.nodes(), a = !1;
-  for (const i of n) {
-    const o = e.children(i);
+  for (const r of n) {
+    const o = e.children(r);
     a = a || o.length > 0;
   }
   if (!a) {
-    r.debug("Done, no node has children", e.nodes());
+    i.debug("Done, no node has children", e.nodes());
     return;
   }
-  r.debug("Nodes = ", n, t);
-  for (const i of n)
-    if (r.debug(
+  i.debug("Nodes = ", n, t);
+  for (const r of n)
+    if (i.debug(
       "Extracting node",
-      i,
+      r,
       d,
-      d.has(i) && !d.get(i).externalConnections,
-      !e.parent(i),
-      e.node(i),
+      d.has(r) && !d.get(r).externalConnections,
+      !e.parent(r),
+      e.node(r),
       e.children("D"),
       " Depth ",
       t
-    ), !d.has(i))
-      r.debug("Not a cluster", i, t);
-    else if (!d.get(i).externalConnections && e.children(i) && e.children(i).length > 0) {
-      r.warn(
+    ), !d.has(r))
+      i.debug("Not a cluster", r, t);
+    else if (!d.get(r).externalConnections && e.children(r) && e.children(r).length > 0) {
+      i.warn(
         "Cluster without external connections, without a parent and with children",
-        i,
+        r,
         t
       );
       let l = e.graph().rankdir === "TB" ? "LR" : "TB";
-      d.get(i)?.clusterData?.dir && (l = d.get(i).clusterData.dir, r.warn("Fixing dir", d.get(i).clusterData.dir, l));
+      d.get(r)?.clusterData?.dir && (l = d.get(r).clusterData.dir, i.warn("Fixing dir", d.get(r).clusterData.dir, l));
       const u = new B({
         multigraph: !0,
         compound: !0
@@ -204,52 +204,52 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
       }).setDefaultEdgeLabel(function() {
         return {};
       });
-      r.warn("Old graph before copy", h(e)), G(i, e, u, i), e.setNode(i, {
+      i.warn("Old graph before copy", h(e)), G(r, e, u, r), e.setNode(r, {
         clusterNode: !0,
-        id: i,
-        clusterData: d.get(i).clusterData,
-        label: d.get(i).label,
+        id: r,
+        clusterData: d.get(r).clusterData,
+        label: d.get(r).label,
         graph: u
-      }), r.warn("New graph after copy node: (", i, ")", h(u)), r.debug("Old graph after copy", h(e));
+      }), i.warn("New graph after copy node: (", r, ")", h(u)), i.debug("Old graph after copy", h(e));
     } else
-      r.warn(
+      i.warn(
         "Cluster ** ",
-        i,
+        r,
         " **not meeting the criteria !externalConnections:",
-        !d.get(i).externalConnections,
+        !d.get(r).externalConnections,
         " no parent: ",
-        !e.parent(i),
+        !e.parent(r),
         " children ",
-        e.children(i) && e.children(i).length > 0,
+        e.children(r) && e.children(r).length > 0,
         e.children("D"),
         t
-      ), r.debug(d);
-  n = e.nodes(), r.warn("New list of nodes", n);
-  for (const i of n) {
-    const o = e.node(i);
-    r.warn(" Now next level", i, o), o?.clusterNode && T(o.graph, t + 1);
+      ), i.debug(d);
+  n = e.nodes(), i.warn("New list of nodes", n);
+  for (const r of n) {
+    const o = e.node(r);
+    i.warn(" Now next level", r, o), o?.clusterNode && T(o.graph, t + 1);
   }
 }, "extractor"), M = /* @__PURE__ */ w((e, t) => {
   if (t.length === 0)
     return [];
   let n = Object.assign([], t);
   return t.forEach((a) => {
-    const i = e.children(a), o = M(e, i);
+    const r = e.children(a), o = M(e, r);
     n = [...n, ...o];
   }), n;
-}, "sorter"), oe = /* @__PURE__ */ w((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ w(async (e, t, n, a, i, o) => {
-  r.warn("Graph in recursive render:XAX", h(t), i);
+}, "sorter"), oe = /* @__PURE__ */ w((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ w(async (e, t, n, a, r, o) => {
+  i.warn("Graph in recursive render:XAX", h(t), r);
   const l = t.graph().rankdir;
-  r.trace("Dir in recursive render - dir:", l);
+  i.trace("Dir in recursive render - dir:", l);
   const u = e.insert("g").attr("class", "root");
-  t.nodes() ? r.info("Recursive render XXX", t.nodes()) : r.info("No nodes found for", t), t.edges().length > 0 && r.info("Recursive edges", t.edge(t.edges()[0]));
+  t.nodes() ? i.info("Recursive render XXX", t.nodes()) : i.info("No nodes found for", t), t.edges().length > 0 && i.info("Recursive edges", t.edge(t.edges()[0]));
   const c = u.insert("g").attr("class", "clusters"), m = u.insert("g").attr("class", "edgePaths"), v = u.insert("g").attr("class", "edgeLabels"), X = u.insert("g").attr("class", "nodes");
   await Promise.all(
     t.nodes().map(async function(f) {
       const s = t.node(f);
-      if (i !== void 0) {
-        const g = JSON.parse(JSON.stringify(i.clusterData));
-        r.trace(
+      if (r !== void 0) {
+        const g = JSON.parse(JSON.stringify(r.clusterData));
+        i.trace(
           `Setting data for parent cluster XXX
  Node.id = `,
           f,
@@ -258,11 +258,11 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
           g.height,
           `
 Parent cluster`,
-          i.height
-        ), t.setNode(i.id, g), t.parent(f) || (r.trace("Setting parent", f, i.id), t.setParent(f, i.id, g));
+          r.height
+        ), t.setNode(r.id, g), t.parent(f) || (i.trace("Setting parent", f, r.id), t.setParent(f, r.id, g));
       }
-      if (r.info("(Insert) Node XXX" + f + ": " + JSON.stringify(t.node(f))), s?.clusterNode) {
-        r.info("Cluster identified XBX", f, s.width, t.node(f));
+      if (i.info("(Insert) Node XXX" + f + ": " + JSON.stringify(t.node(f))), s?.clusterNode) {
+        i.info("Cluster identified XBX", f, s.width, t.node(f));
         const { ranksep: g, nodesep: E } = t.graph();
         s.graph.setGraph({
           ...s.graph.graph(),
@@ -277,7 +277,7 @@ Parent cluster`,
           t.node(f),
           o
         ), x = N.elem;
-        z(s, x), s.diff = N.diff || 0, r.info(
+        z(s, x), s.diff = N.diff || 0, i.info(
           "New compound node after recursive render XAX",
           f,
           "width",
@@ -289,7 +289,7 @@ Parent cluster`,
           // node.y
         ), U(x, s);
       } else
-        t.children(f).length > 0 ? (r.trace(
+        t.children(f).length > 0 ? (i.trace(
           "Cluster - the non recursive path XBX",
           f,
           s.id,
@@ -297,12 +297,12 @@ Parent cluster`,
           s.width,
           "Graph:",
           t
-        ), r.trace(C(s.id, t)), d.set(s.id, { id: C(s.id, t), node: s })) : (r.trace("Node - the non recursive path XAX", f, X, t.node(f), l), await $(X, t.node(f), { config: o, dir: l }));
+        ), i.trace(C(s.id, t)), d.set(s.id, { id: C(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", f, X, t.node(f), l), await $(X, t.node(f), { config: o, dir: l }));
     })
   ), await (/* @__PURE__ */ w(async () => {
     const f = t.edges().map(async function(s) {
       const g = t.edge(s.v, s.w, s.name);
-      r.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), r.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), r.info(
+      i.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), i.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), i.info(
         "Fix",
         d,
         "ids:",
@@ -314,12 +314,12 @@ Parent cluster`,
       ), await Z(v, g);
     });
     await Promise.all(f);
-  }, "processEdges"))(), r.info("Graph before layout:", JSON.stringify(h(t))), r.info("############################################# XXX"), r.info("###                Layout                 ### XXX"), r.info("############################################# XXX"), I(t), r.info("Graph after layout:", JSON.stringify(h(t)));
+  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(h(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(h(t)));
   let O = 0, { subGraphTitleTotalMargin: S } = q(o);
   return await Promise.all(
     oe(t).map(async function(f) {
       const s = t.node(f);
-      if (r.info(
+      if (i.info(
         "Position XBX => " + f + ": (" + s.x,
         "," + s.y,
         ") width: ",
@@ -327,7 +327,7 @@ Parent cluster`,
         " height: ",
         s.height
       ), s?.clusterNode)
-        s.y += S, r.info(
+        s.y += S, i.info(
           "A tainted cluster node XBX1",
           f,
           s.id,
@@ -338,7 +338,7 @@ Parent cluster`,
           t.parent(f)
         ), d.get(s.id).node = s, P(s);
       else if (t.children(f).length > 0) {
-        r.info(
+        i.info(
           "A pure cluster node XBX1",
           f,
           s.id,
@@ -349,10 +349,10 @@ Parent cluster`,
           t.parent(f)
         ), s.height += S, t.node(s.parentId);
         const g = s?.padding / 2 || 0, E = s?.labelBBox?.height || 0, N = E - g || 0;
-        r.debug("OffsetY", N, "labelHeight", E, "halfPadding", g), await K(c, s), d.get(s.id).node = s;
+        i.debug("OffsetY", N, "labelHeight", E, "halfPadding", g), await K(c, s), d.get(s.id).node = s;
       } else {
         const g = t.node(s.parentId);
-        s.y += S / 2, r.info(
+        s.y += S / 2, i.info(
           "A regular node XBX1 - using the padding",
           s.id,
           "parent",
@@ -372,15 +372,15 @@ Parent cluster`,
     })
   ), t.edges().forEach(function(f) {
     const s = t.edge(f);
-    r.info("Edge " + f.v + " -> " + f.w + ": " + JSON.stringify(s), s), s.points.forEach((x) => x.y += S / 2);
+    i.info("Edge " + f.v + " -> " + f.w + ": " + JSON.stringify(s), s), s.points.forEach((x) => x.y += S / 2);
     const g = t.node(f.v);
     var E = t.node(f.w);
     const N = Q(m, s, d, n, g, E, a);
     W(s, N);
   }), t.nodes().forEach(function(f) {
     const s = t.node(f);
-    r.info(f, s.type, s.diff), s.isGroup && (O = s.diff);
-  }), r.warn("Returning from recursive render XAX", u, O), { elem: u, diff: O };
+    i.info(f, s.type, s.diff), s.isGroup && (O = s.diff);
+  }), i.warn("Returning from recursive render XAX", u, O), { elem: u, diff: O };
 }, "recursiveRender"), ge = /* @__PURE__ */ w(async (e, t) => {
   const n = new B({
     multigraph: !0,
@@ -396,7 +396,7 @@ Parent cluster`,
   }), a = t.select("g");
   F(a, e.markers, e.type, e.diagramId), Y(), _(), H(), te(), e.nodes.forEach((o) => {
     n.setNode(o.id, { ...o }), o.parentId && n.setParent(o.id, o.parentId);
-  }), r.debug("Edges:", e.edges), e.edges.forEach((o) => {
+  }), i.debug("Edges:", e.edges), e.edges.forEach((o) => {
     if (o.start === o.end) {
       const l = o.start, u = l + "---" + l + "---1", c = l + "---" + l + "---2", m = n.node(l);
       n.setNode(u, {
@@ -428,15 +428,15 @@ Parent cluster`,
       v.label = "", v.arrowTypeEnd = "none", v.id = l + "-cyclic-special-1", X.arrowTypeStart = "none", X.arrowTypeEnd = "none", X.id = l + "-cyclic-special-mid", p.label = "", m.isGroup && (v.fromCluster = l, p.toCluster = l), p.id = l + "-cyclic-special-2", p.arrowTypeStart = "none", n.setEdge(l, u, v, l + "-cyclic-special-0"), n.setEdge(u, c, X, l + "-cyclic-special-1"), n.setEdge(c, l, p, l + "-cyc<lic-special-2");
     } else
       n.setEdge(o.start, o.end, { ...o }, o.id);
-  }), r.warn("Graph at first:", JSON.stringify(h(n))), ie(n), r.warn("Graph after XAX:", JSON.stringify(h(n)));
-  const i = V();
+  }), i.warn("Graph at first:", JSON.stringify(h(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(h(n)));
+  const r = V();
   await j(
     a,
     n,
     e.type,
     e.diagramId,
     void 0,
-    i
+    r
   );
 }, "render");
 export {

package/dist/{diagram-4IRLE6MV-Cz4wPwXi.js → diagram-N5W7TBWH-BdTxNJib.js}

@@ -1,7 +1,7 @@
-import { s as he } from "./chunk-NRVI72HA-DLE8wk3-.js";
-import { _ as w, D as te, E as ae, H as ue, e as pe, l as K, aZ as P, d as Y, b as fe, a as ge, p as me, q as ye, g as Se, s as ve, F as xe, a_ as be, y as we } from "./index-VJw3klPt.js";
-import { p as Ce } from "./chunk-ANTBXLJU-BdaEgFx7.js";
-import { p as Te } from "./mermaid-parser.core-BnvQOoyE.js";
+import { _ as w, D as te, E as ae, H as he, e as ue, l as K, a$ as P, d as Y, b as pe, a as fe, p as ge, q as me, g as ye, s as Se, F as ve, b0 as xe, y as be } from "./index-JAUwzcHq.js";
+import { s as we } from "./chunk-QN33PNHL-DfPMtcCm.js";
+import { p as Ce } from "./chunk-4BX2VUAB-B3NOuiDi.js";
+import { p as Te } from "./mermaid-parser.core-DX0wl6-K.js";
 import { b as O } from "./defaultLocale-D7EN2tov.js";
 import { o as J } from "./ordinal-DfAQgscy.js";
 function Le(t) {
@@ -97,10 +97,10 @@ function* Re() {
 }
 function Q(t, a) {
   t instanceof Map ? (t = [void 0, t], a === void 0 && (a = Ie)) : a === void 0 && (a = He);
-  for (var l = new Z(t), n, o = [l], s, d, h, g; n = o.pop(); )
+  for (var l = new U(t), n, o = [l], s, d, h, g; n = o.pop(); )
     if ((d = a(n.data)) && (g = (d = Array.from(d)).length))
       for (n.children = d, h = g - 1; h >= 0; --h)
-        o.push(s = d[h] = new Z(d[h])), s.parent = n, s.depth = n.depth + 1;
+        o.push(s = d[h] = new U(d[h])), s.parent = n, s.depth = n.depth + 1;
   return l.eachBefore(qe);
 }
 function We() {
@@ -121,11 +121,11 @@ function qe(t) {
     t.height = a;
   while ((t = t.parent) && t.height < ++a);
 }
-function Z(t) {
+function U(t) {
   this.data = t, this.depth = this.height = 0, this.parent = null;
 }
-Z.prototype = Q.prototype = {
-  constructor: Z,
+U.prototype = Q.prototype = {
+  constructor: U,
   count: $e,
   each: Ae,
   eachAfter: ke,
@@ -164,8 +164,8 @@ function Ye(t, a, l, n, o) {
   for (var s = t.children, d, h = -1, g = s.length, c = t.value && (o - l) / t.value; ++h < g; )
     d = s[h], d.x0 = a, d.x1 = n, d.y0 = l, d.y1 = l += d.value * c;
 }
-var Ze = (1 + Math.sqrt(5)) / 2;
-function Ue(t, a, l, n, o, s) {
+var Ue = (1 + Math.sqrt(5)) / 2;
+function Ze(t, a, l, n, o, s) {
   for (var d = [], h = a.children, g, c, u = 0, b = 0, r = h.length, x, S, v = a.value, p, m, N, k, V, R, M; u < r; ) {
     x = o - l, S = s - n;
     do
@@ -184,12 +184,12 @@ function Ue(t, a, l, n, o, s) {
 }
 const Je = function t(a) {
   function l(n, o, s, d, h) {
-    Ue(a, n, o, s, d, h);
+    Ze(a, n, o, s, d, h);
   }
   return l.ratio = function(n) {
     return t((n = +n) > 1 ? n : 1);
   }, l;
-}(Ze);
+}(Ue);
 function Ke() {
   var t = Je, a = !1, l = 1, n = 1, o = [0], s = q, d = q, h = q, g = q, c = q;
   function u(r) {
@@ -223,13 +223,13 @@ function Ke() {
 }
 var E, ne = (E = class {
   constructor() {
-    this.nodes = [], this.levels = /* @__PURE__ */ new Map(), this.outerNodes = [], this.classes = /* @__PURE__ */ new Map(), this.setAccTitle = fe, this.getAccTitle = ge, this.setDiagramTitle = me, this.getDiagramTitle = ye, this.getAccDescription = Se, this.setAccDescription = ve;
+    this.nodes = [], this.levels = /* @__PURE__ */ new Map(), this.outerNodes = [], this.classes = /* @__PURE__ */ new Map(), this.setAccTitle = pe, this.getAccTitle = fe, this.setDiagramTitle = ge, this.getDiagramTitle = me, this.getAccDescription = ye, this.setAccDescription = Se;
   }
   getNodes() {
     return this.nodes;
   }
   getConfig() {
-    const a = xe, l = ae();
+    const a = ve, l = ae();
     return te({
       ...a.treemap,
       ...l.treemap ?? {}
@@ -244,7 +244,7 @@ var E, ne = (E = class {
   addClass(a, l) {
     const n = this.classes.get(a) ?? { id: a, styles: [], textStyles: [] }, o = l.replace(/\\,/g, "§§§").replace(/,/g, ";").replace(/§§§/g, ",").split(";");
     o && o.forEach((s) => {
-      be(s) && (n?.textStyles ? n.textStyles.push(s) : n.textStyles = [s]), n?.styles ? n.styles.push(s) : n.styles = [s];
+      xe(s) && (n?.textStyles ? n.textStyles.push(s) : n.textStyles = [s]), n?.styles ? n.styles.push(s) : n.styles = [s];
     }), this.classes.set(a, n);
   }
   getClasses() {
@@ -254,7 +254,7 @@ var E, ne = (E = class {
     return this.classes.get(a)?.styles ?? [];
   }
   clear() {
-    we(), this.nodes = [], this.levels = /* @__PURE__ */ new Map(), this.outerNodes = [], this.classes = /* @__PURE__ */ new Map(), this.root = void 0;
+    be(), this.nodes = [], this.levels = /* @__PURE__ */ new Map(), this.outerNodes = [], this.classes = /* @__PURE__ */ new Map(), this.root = void 0;
   }
 }, w(E, "TreeMapDB"), E);
 function le(t) {
@@ -323,8 +323,8 @@ var Qe = /* @__PURE__ */ w((t, a) => {
   const o = n.db, s = o.getConfig(), d = s.padding ?? tt, h = o.getDiagramTitle(), g = o.getRoot(), { themeVariables: c } = ae();
   if (!g)
     return;
-  const u = h ? 30 : 0, b = ue(a), r = s.nodeWidth ? s.nodeWidth * B : 960, x = s.nodeHeight ? s.nodeHeight * B : 500, S = r, v = x + u;
-  b.attr("viewBox", `0 0 ${S} ${v}`), pe(b, v, S, s.useMaxWidth);
+  const u = h ? 30 : 0, b = he(a), r = s.nodeWidth ? s.nodeWidth * B : 960, x = s.nodeHeight ? s.nodeHeight * B : 500, S = r, v = x + u;
+  b.attr("viewBox", `0 0 ${S} ${v}`), ue(b, v, S, s.useMaxWidth);
   let p;
   try {
     const e = s.valueFormat || ",";
@@ -441,12 +441,12 @@ var Qe = /* @__PURE__ */ w((t, a) => {
     let I = Math.max(
       z,
       Math.min(T, Math.round(y * L))
-    ), U = y + H + I;
-    for (; U > F && y > _ && (y--, I = Math.max(
+    ), Z = y + H + I;
+    for (; Z > F && y > _ && (y--, I = Math.max(
       z,
       Math.min(T, Math.round(y * L))
     ), !(I < z && y === _)); )
-      i.style("font-size", `${y}px`), U = y + H + I;
+      i.style("font-size", `${y}px`), Z = y + H + I;
     i.style("font-size", `${y}px`), ($.getComputedTextLength() > D || y < _ || F < y) && i.style("display", "none");
   }), s.showValues !== !1 && j.append("text").attr("class", "treemapValue").attr("x", (i) => (i.x1 - i.x0) / 2).attr("y", function(i) {
     return (i.y1 - i.y0) / 2;
@@ -475,7 +475,7 @@ var Qe = /* @__PURE__ */ w((t, a) => {
     f.node().getComputedTextLength() > de || z + T > ce || T < y ? f.style("display", "none") : f.style("display", null);
   });
   const oe = s.diagramPadding ?? 8;
-  he(b, oe, "flowchart", s?.useMaxWidth || !1);
+  we(b, oe, "flowchart", s?.useMaxWidth || !1);
 }, "draw"), nt = /* @__PURE__ */ w(function(t, a) {
   return a.db.getClasses();
 }, "getClasses"), lt = { draw: at, getClasses: nt }, rt = {